commit 127ea02fb87bfc9b120ff5288566b811ff857a70
Author: Ravi Gulhane <>
Date:   Wed Jun 3 15:34:57 2026 +0530

    first commit

diff --git a/README.md b/README.md
new file mode 100644
index 0000000..d34e698
--- /dev/null
+++ b/README.md
@@ -0,0 +1,14 @@
+# EventBuzz WhatsApp Concierge Service
+
+Hapi webhook server + BullMQ workers for the virtual concierge. Uses **one** MongoDB connection via `../backend/src/config/database` (do not add a separate `mongoose` dependency in chatbot).
+
+## Run locally
+
+1. Start Redis and MongoDB (same `MONGODB_URI` as backend). **DigitalOcean Managed Redis** needs TLS — the app enables it automatically for `*.ondigitalocean.com` / port `25061`, or set `REDIS_TLS=true` / use `rediss://` in `REDIS_URL`.
+2. Copy env from `backend/.env` and `chatbot/.env.example`.
+3. One terminal — `npm run dev` starts the **API** (port 3020), **ingest**, and **inbound** workers together (reloads on file changes). Use Ctrl+C to stop all.
+4. Optional — run only one process: `npm run dev:server`, `npm run dev:ingest`, or `npm run dev:inbound`.
+5. Optional — purge scheduler: `npm run dev:purge` (normally not needed locally).
+6. Point Meta webhook to `https://<host>/webhook/whatsapp`.
+
+Dashboard APIs live on the main backend (`/api/concierge-bots`).
diff --git a/chatbot_plan.md b/chatbot_plan.md
new file mode 100644
index 0000000..ea91d0e
--- /dev/null
+++ b/chatbot_plan.md
@@ -0,0 +1,368 @@
+This execution plan covers everything needed to build, deploy, and scale the **Event Buzz Virtual Concierge SaaS Chatbot** as a decoupled microservice running alongside your primary Node.js and Managed MongoDB stack on DigitalOcean.
+
+---
+
+## 🛠️ Step 1: System Infrastructure & Architecture Design
+
+Before writing any application logic, you must isolate this high-concurrency chatbot service from your main ticketing web platform so that peak event traffic doesn't degrade your core registration experience.
+
+```
+                  [ Meta WhatsApp Cloud API ]
+                               │ (HTTPS Post Webhooks)
+                               ▼
+                    [ DigitalOcean Droplet ]
+                               │
+                        [ Nginx Proxy ]
+                               │
+                       [ PM2 Cluster Mode ]
+                               │
+                    [ Node.js Webhook Server ]
+                               │
+                    [ BullMQ / Redis Queue ]
+                               │
+                     [ Background Worker ]
+                    /          |           \
+                   /           |            \
+                  ▼            ▼             ▼
+       [ OpenAI API ]   [ DO Managed Mongo ]  [ Ext. Location APIs ]
+       (Embeddings/LLM) (Shared Cluster DB)  (Google Places/Maps)
+
+```
+
+### 1.1 Infrastructure Components
+
+* **Compute Layer:** Spin up a dedicated DigitalOcean Droplet (Ubuntu 24.04, minimum 2 vCPUs / 4GB RAM to comfortably process in-memory mathematical arrays).
+* **Process Manager:** Use **PM2** running in cluster mode (`pm2 start server.js -i max`) to natively scale across all available virtual CPU cores.
+* **Message Broker:** Install **Redis** directly on the droplet or use a managed instance. This acts as the backbone for your queue architecture (**BullMQ**) to prevent webhook timeouts.
+* **Reverse Proxy:** Configure **Nginx** to handle SSL termination (via Let's Encrypt Certbot) and proxy incoming WhatsApp webhooks from port `443` to your internal Node.js port.
+
+### 1.2 Shared Database Connections
+
+Configure a dedicated, isolated database client instance connecting to your existing DigitalOcean Managed MongoDB cluster.
+
+* Add a strict connection pool parameter (`maxPoolSize: 50`) to handle rapid parallel worker queries.
+* Create a separate database name (e.g., `eventbuzz_whatsapp`) within the same cluster to logically isolate chatbot data from ticketing collections while retaining shared cluster resources.
+
+---
+
+## 🗄️ Step 2: Exact MongoDB Data Schemas
+
+Implement these exact Mongoose schemas to track configuration, session routing states, and the multi-tenant knowledge chunks.
+
+### 2.1 Knowledge Source Configuration Schema (`KnowledgeSource`)
+
+Tracks the individual assets uploaded by the organizer and controls the text verification states.
+
+```javascript
+const mongoose = require('mongoose');
+
+const KnowledgeSourceSchema = new mongoose.Schema({
+  eventId: { type: mongoose.Schema.Types.ObjectId, required: true, index: true },
+  type: { type: String, enum: ['url', 'pdf'], required: true },
+  sourcePath: { type: String, required: true }, // URL string or S3/DO Spaces file key
+  displayName: { type: String, required: true },
+  status: { 
+    type: String, 
+    enum: ['PENDING', 'PROCESSING', 'READY', 'FAILED'], 
+    default: 'PENDING' 
+  },
+  errorMessage: { type: String, default: null },
+  lastSyncedAt: { type: Date, default: Date.now }
+}, { timestamps: true });
+
+module.exports = mongoose.model('KnowledgeSource', KnowledgeSourceSchema);
+
+```
+
+### 2.2 Granular Vector Text Chunk Schema (`ContextChunk`)
+
+Stores individual text blocks alongside their mathematical representation array for localized context parsing.
+
+```javascript
+const ContextChunkSchema = new mongoose.Schema({
+  eventId: { type: mongoose.Schema.Types.ObjectId, required: true, index: true },
+  sourceId: { type: mongoose.Schema.Types.ObjectId, ref: 'KnowledgeSource', required: true, index: true },
+  rawText: { type: String, required: true },
+  embedding: { type: [Number], required: true }, // Storing 1536 float values natively
+  isActive: { type: Boolean, default: false, index: true } // False until organizer explicitly approves via preview
+});
+
+module.exports = mongoose.model('ContextChunk', ContextChunkSchema);
+
+```
+
+### 2.3 Interactive User Session State Schema (`ChatSubscriber`)
+
+Manages the individual conversation paths, data access masks, and tracking rules for attendees.
+
+```javascript
+const ChatSubscriberSchema = new mongoose.Schema({
+  eventId: { type: mongoose.Schema.Types.ObjectId, required: true, index: true },
+  attendeeId: { type: mongoose.Schema.Types.ObjectId, default: null }, // Linked when ticket matches
+  phoneNumber: { type: String, required: true, index: true }, // E.164 international format
+  sessionState: { 
+    type: String, 
+    enum: ['WELCOME_FORK', 'AWAITING_TICKET', 'MAIN_MENU', 'LOCAL_GUIDE_MODE'], 
+    default: 'WELCOME_FORK' 
+  },
+  metaContext: {
+    guestModeEnabled: { type: Boolean, default: false },
+    lastMenuInteraction: { type: Date, default: Date.now }
+  }
+}, { timestamps: true });
+
+// Ensures unique session footprint per phone number per event
+ChatSubscriberSchema.index({ eventId: 1, phoneNumber: 1 }, { unique: true });
+
+module.exports = mongoose.model('ChatSubscriber', ChatSubscriberSchema);
+
+```
+
+---
+
+## ⚙️ Step 3: The Content Ingestion Pipeline (Scraping, Chunking & Verification)
+
+When an event organizer triggers a sync or uploads documents, the backend processes it asynchronously using an execution queue.
+
+```
+[ Dashboard Input ] ──> [ BullMQ Job ] ──> [ Text Extractor ] ──> [ Token Splitter ] ──> [ Vector Array Generation ] ──> [ Staging Database ]
+
+```
+
+### 3.1 Text Extraction Rules
+
+* **For URLs:** Use a structured engine like `cheerio` or `playwright`. Inject a global sanitizer middleware to systematically drop `<script>`, `<style>`, `<nav>`, `<footer>`, and `<form>` components. Extract clean semantic content inside `<article>`, `<h1>-<h6>`, `<p>`, and `<li>` items.
+* **For PDFs:** Stream files via standard read streams into `pdf-parse`. Standardize layout anomalies by replacing consecutive whitespace, tabs, and duplicate carriage returns with a single space profile.
+
+### 3.2 Mathematical Text Chunking Logic
+
+Implement a fixed-size window sliding chunker:
+
+* **Target Size:** Maximum of 500 characters per text chunk.
+* **Overlap Margin:** Exactly 50 characters of overlap between sequential blocks to prevent losing contextual nuance at boundary lines.
+* **Metadata Attachment:** Map every individual chunk array back to its parent `sourceId` and `eventId`.
+
+### 3.3 Embeddings Vector API Integration
+
+Send text blocks to the OpenAI API endpoint using the `text-embedding-3-small` model architecture to generate 1536-dimensional arrays. Save these vector arrays straight to the `ContextChunk` collection with `isActive: false`.
+
+### 3.4 The Dashboard Preview UI Layer
+
+Build an interface inside the Event Buzz organizer management panel that exposes the staged records:
+
+* Read all items from `ContextChunk` where `sourceId === selection` and `isActive === false`.
+* Render these chunks inside an editable text grid component.
+* Provide clean, individual inline `Delete` overrides and text area modifiers.
+* **The Publish Action:** On click of "Approve & Train Bot", switch `isActive: true` globally for verified chunks.
+
+---
+
+## 📥 Step 4: Webhook Event-Driven Pipeline & In-Memory RAG Engine
+
+This core logic processes live incoming interactions under 200ms while maintaining zero context cross-contamination between events.
+
+### 4.1 Phase 1: Rapid Acknowledge & Queue Integration
+
+Meta requires an instant response to prevent duplicate webhook retries. Your endpoint must do nothing but drop the message payload into Redis.
+
+```javascript
+// server.js - Fastify / Express Entry Hook
+const { Queue } = require('bullmq');
+const inboundQueue = new Queue('whatsapp-inbound-processor');
+
+app.post('/webhook/whatsapp', async (request, reply) => {
+  const payload = request.body;
+
+  // Instantly protect webhook validity with Meta
+  reply.status(200).send('OK');
+
+  const value = payload.entry?.[0]?.changes?.[0]?.value;
+  if (value && value.messages?.[0]) {
+    await inboundQueue.add('process-message', {
+      phoneId: value.metadata.phone_number_id,
+      messageData: value.messages[0],
+      profileName: value.contacts?.[0]?.profile?.name || 'Guest'
+    });
+  }
+});
+
+```
+
+### 4.2 Phase 2: Context Resolution & User State Assessment
+
+Inside the execution worker processing the Redis queue items, run the lookup sequence:
+
+```javascript
+// worker.js
+const { Worker } = require('bullmq');
+const math = require('mathjs'); // For high-speed matrix cosine operations
+
+const worker = new Worker('whatsapp-inbound-processor', async (job) => {
+  const { phoneId, messageData, profileName } = job.data;
+  const userPhone = messageData.from;
+  const incomingRawText = messageData.text?.body?.trim();
+
+  // 1. Resolve exact Event tracking via incoming target metadata
+  const targetEvent = await Event.findOne({ "conciergeSettings.wabaPhoneNumberId": phoneId });
+  if (!targetEvent) return;
+
+  // 2. Fetch or initialize User Subscriber Session State
+  let subscriber = await ChatSubscriber.findOne({ eventId: targetEvent._id, phoneNumber: userPhone });
+  if (!subscriber) {
+    subscriber = await ChatSubscriber.create({
+      eventId: targetEvent._id,
+      phoneNumber: userPhone,
+      sessionState: 'WELCOME_FORK'
+    });
+    return await sendWelcomeGreeting(userPhone, targetEvent, profileName);
+  }
+
+  // 3. Evaluate User Action State Machine Route
+  await processStateRouting(subscriber, targetEvent, messageData, incomingRawText);
+});
+
+```
+
+### 4.3 Phase 3: High-Speed In-Memory Cosine Similarity Calculation
+
+When a text query falls back to document scanning, perform the exact vector evaluation step locally inside Node.js memory context:
+
+```javascript
+async function executeLocalRAG(eventId, userQueryString) {
+  // 1. Fetch user question vector embedding array from OpenAI
+  const queryEmbedding = await getOpenAIEmbedding(userQueryString);
+
+  // 2. Load the isolated vector profile cache for this specific event from MongoDB
+  const activeEventChunks = await ContextChunk.find({ eventId, isActive: true }).lean();
+  
+  if (activeEventChunks.length === 0) return null;
+
+  // 3. Compute Cosine Similarity metrics against active memory set
+  const rankedChunks = activeEventChunks.map(chunk => {
+    // Cosine Similarity Formula: A • B / (||A|| * ||B||)
+    const dotProduct = math.dot(queryEmbedding, chunk.embedding);
+    const normA = math.norm(queryEmbedding);
+    const normB = math.norm(chunk.embedding);
+    const similarity = dotProduct / (normA * normB);
+    return { text: chunk.rawText, score: similarity };
+  });
+
+  // 4. Extract top 3 matched components
+  rankedChunks.sort((a, b) => b.score - a.score);
+  return rankedChunks.slice(0, 3).map(c => c.text).join("\n\n");
+}
+
+```
+
+---
+
+## 🧭 Step 5: Attendee Interaction State Machine & Routing Logic
+
+Manage user intent, authentication state checks, and context masking based on subscription parameters.
+
+```
+                             [ User Message ]
+                                    │
+                  ┌─────────────────┴─────────────────┐
+                  ▼                                   ▼
+        [ State: WELCOME_FORK ]             [ State: GUEST_MODE / MAIN_MENU ]
+         - Look for Interactive Buttons       - Standard Request Verification
+         - Link Ticket OR Guest Route         - Intercept Profile Queries
+
+```
+
+### 5.1 Interactive State Logic Implementations
+
+#### Route A: `WELCOME_FORK` Context Evaluator
+
+* If user clicks interactive button ID `action_connect_ticket`: Update `sessionState: 'AWAITING_TICKET'`. Dispatch text template: *"Please type your Event Buzz Ticket ID or your registered email address below."*
+* If user clicks interactive button ID `action_guest_explore`: Update `sessionState: 'MAIN_MENU'`, set `metaContext.guestModeEnabled: true`. Fire main structural menu block.
+
+#### Route B: `AWAITING_TICKET` State Processing
+
+* Capture incoming string text values. Query Event Buzz core registration collection schema.
+* **Match Found:** Update `ChatSubscriber` record, write matching database internal reference key to `attendeeId`, drop user tracking state to `MAIN_MENU`. Dispatch confirmation template: *"Account validated! Your digital check-in access is ready."*
+* **Match Failed:** Deliver error notification payload: *"Ticket lookup failed. Please re-enter code or choose to switch to guest access path."* Append text selection buttons `[Re-try Ticket Registration]` and `[Browse as Guest]`.
+
+#### Route C: `MAIN_MENU` & `GUEST_MODE` Operational Rules
+
+* **Protected Inquiries Interception:** If a user in guest status submits requests mapping keywords like `"ticket"`, `"my seat"`, `"badge"`, or `"schedule"`, intercept the text logic without executing an OpenAI lookup. Reply directly with a standard system template message highlighting registration requirements.
+* **Global Access Processing:** Execute standard internal context matching (such as Wi-Fi queries) and trigger local RAG retrieval for location, logistics, and tourism inputs.
+
+---
+
+## 🧹 Step 6: Automated Infrastructure Cleaning Pipeline (Data Lifecycle)
+
+Protect system speed, lower storage overhead, and prevent database growth issues inside your DigitalOcean infrastructure by setting automated cleanup boundaries.
+
+### 6.1 Lifecycle Rules Setup
+
+Build an independent, recurring worker function managed via **BullMQ repeatable schedules** configured using a localized cron expression to trigger every single morning at exactly `02:00 AM UTC`.
+
+### 6.2 Data Removal Process Flow
+
+When the execution criteria kicks off, your backend performs a cascading removal query sequence:
+
+```javascript
+// daily-purge-cron.js
+const moment = require('moment');
+
+async function executeDataPurge() {
+  // Target events wrapped precisely 7 days ago
+  const thresholdDate = moment().subtract(7, 'days').toDate();
+
+  const expiredEvents = await Event.find({
+    endDate: { $lt: thresholdDate },
+    "conciergeSettings.status": { $ne: "ARCHIVED" }
+  });
+
+  for (const event of expiredEvents) {
+    const eventId = event._id;
+
+    // 1. Purge heavy binary array vector blocks completely
+    await ContextChunk.deleteMany({ eventId });
+
+    // 2. Wipe tracking source operational logs
+    await KnowledgeSource.deleteMany({ eventId });
+
+    // 3. Strip out temporal user subscriber conversation profiles
+    await ChatSubscriber.deleteMany({ eventId });
+
+    // 4. Log summary footprint variables into parent metrics object for historical reporting
+    event.conciergeSettings.status = "ARCHIVED";
+    await event.save();
+    
+    console.log(`Successfully purged chatbot dataset for Event ID: ${eventId}`);
+  }
+}
+
+```
+
+---
+
+## 🚀 Step 7: Complete Deployment & Testing Plan
+
+Follow this structural blueprint sequence to roll out your feature build smoothly into your production environments.
+
+### 7.1 Local Verification & Integration Strategy
+
+1. Build out individual background queue worker frameworks on local development configurations.
+2. Use **Ngrok** to provision a secured tunnel mapping directly down to local port instances (`ngrok http 3000`).
+3. Connect the generated secure URL endpoint within your Meta Developer App Management Panel profile under Webhook Subscriptions.
+4. Manually trigger testing profiles executing variations of text patterns to confirm state routing accuracy.
+
+### 7.2 DigitalOcean Droplet Production Setup Matrix
+
+1. Clone the isolated chatbot service repository package directory straight into the droplet target instance.
+2. Configure environment file parameters (`.env`) specifying secure environment token objects:
+```env
+MONGO_URI=mongodb+srv://<do_managed_credentials>
+REDIS_URL=redis://127.0.0.1:6333
+OPENAI_API_KEY=sk-proj-...
+META_WHATSAPP_TOKEN=EAAB...
+
+```
+
+
+3. Use PM2 configuration definitions to instantiate persistent executions.
+4. Finalize Nginx mapping setups pointing standard external endpoints securely right into internal routing endpoints.
\ No newline at end of file
diff --git a/ecosystem.config.cjs b/ecosystem.config.cjs
new file mode 100644
index 0000000..7666606
--- /dev/null
+++ b/ecosystem.config.cjs
@@ -0,0 +1,25 @@
+module.exports = {
+  apps: [
+    {
+      name: 'chatbot-api',
+      script: 'server.js',
+      instances: 1,
+      exec_mode: 'fork',
+    },
+    {
+      name: 'chatbot-inbound',
+      script: 'workers/inbound.js',
+      instances: 1,
+    },
+    {
+      name: 'chatbot-ingest',
+      script: 'workers/ingest.js',
+      instances: 1,
+    },
+    {
+      name: 'chatbot-purge',
+      script: 'workers/purge.js',
+      instances: 1,
+    },
+  ],
+};
diff --git a/node_modules/.bin/download-msgpackr-prebuilds b/node_modules/.bin/download-msgpackr-prebuilds
new file mode 120000
index 0000000..562dd61
--- /dev/null
+++ b/node_modules/.bin/download-msgpackr-prebuilds
@@ -0,0 +1 @@
+../msgpackr-extract/bin/download-prebuilds.js
\ No newline at end of file
diff --git a/node_modules/.bin/mathjs b/node_modules/.bin/mathjs
new file mode 120000
index 0000000..d147838
--- /dev/null
+++ b/node_modules/.bin/mathjs
@@ -0,0 +1 @@
+../mathjs/bin/cli.js
\ No newline at end of file
diff --git a/node_modules/.bin/node-gyp-build-optional-packages b/node_modules/.bin/node-gyp-build-optional-packages
new file mode 120000
index 0000000..9630206
--- /dev/null
+++ b/node_modules/.bin/node-gyp-build-optional-packages
@@ -0,0 +1 @@
+../node-gyp-build-optional-packages/bin.js
\ No newline at end of file
diff --git a/node_modules/.bin/node-gyp-build-optional-packages-optional b/node_modules/.bin/node-gyp-build-optional-packages-optional
new file mode 120000
index 0000000..5915bd7
--- /dev/null
+++ b/node_modules/.bin/node-gyp-build-optional-packages-optional
@@ -0,0 +1 @@
+../node-gyp-build-optional-packages/optional.js
\ No newline at end of file
diff --git a/node_modules/.bin/node-gyp-build-optional-packages-test b/node_modules/.bin/node-gyp-build-optional-packages-test
new file mode 120000
index 0000000..c0cc979
--- /dev/null
+++ b/node_modules/.bin/node-gyp-build-optional-packages-test
@@ -0,0 +1 @@
+../node-gyp-build-optional-packages/build-test.js
\ No newline at end of file
diff --git a/node_modules/.bin/semver b/node_modules/.bin/semver
new file mode 120000
index 0000000..5aaadf4
--- /dev/null
+++ b/node_modules/.bin/semver
@@ -0,0 +1 @@
+../semver/bin/semver.js
\ No newline at end of file
diff --git a/node_modules/.package-lock.json b/node_modules/.package-lock.json
new file mode 100644
index 0000000..3dbb5cb
--- /dev/null
+++ b/node_modules/.package-lock.json
@@ -0,0 +1,719 @@
+{
+  "name": "eventbuzz-chatbot",
+  "version": "1.0.0",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "node_modules/@babel/runtime": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.29.7.tgz",
+      "integrity": "sha512-Nq8OhGWiZIZGV6hLHoyAKLLcJihP/xFeBMGJoUrxTX2psI8dCifzLhZISFb+VWS3wFMRDmCGw5R+dOySCqPLhw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@hapi/accept": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/accept/-/accept-6.0.3.tgz",
+      "integrity": "sha512-p72f9k56EuF0n3MwlBNThyVE5PXX40g+aQh+C/xbKrfzahM2Oispv3AXmOIU51t3j77zay1qrX7IIziZXspMlw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/ammo": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/ammo/-/ammo-6.0.1.tgz",
+      "integrity": "sha512-pmL+nPod4g58kXrMcsGLp05O2jF4P2Q3GiL8qYV7nKYEh3cGf+rV4P5Jyi2Uq0agGhVU63GtaSAfBEZOlrJn9w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/b64": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/b64/-/b64-6.0.1.tgz",
+      "integrity": "sha512-ZvjX4JQReUmBheeCq+S9YavcnMMHWqx3S0jHNXWIM1kQDxB9cyfSycpVvjfrKcIS8Mh5N3hmu/YKo4Iag9g2Kw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/boom": {
+      "version": "10.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/boom/-/boom-10.0.1.tgz",
+      "integrity": "sha512-ERcCZaEjdH3OgSJlyjVk8pHIFeus91CjKP3v+MpgBNp5IvGzP2l/bRiD78nqYcKPaZdbKkK5vDBVPd2ohHBlsA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/bounce": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/bounce/-/bounce-3.0.2.tgz",
+      "integrity": "sha512-d0XmlTi3H9HFDHhQLjg4F4auL1EY3Wqj7j7/hGDhFFe6xAbnm3qiGrXeT93zZnPH8gH+SKAFYiRzu26xkXcH3g==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/bourne": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/@hapi/bourne/-/bourne-3.0.0.tgz",
+      "integrity": "sha512-Waj1cwPXJDucOib4a3bAISsKJVb15MKi9IvmTI/7ssVEm6sywXGjVJDhl6/umt1pK1ZS7PacXU3A1PmFKHEZ2w==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/call": {
+      "version": "9.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/call/-/call-9.0.1.tgz",
+      "integrity": "sha512-uPojQRqEL1GRZR4xXPqcLMujQGaEpyVPRyBlD8Pp5rqgIwLhtveF9PkixiKru2THXvuN8mUrLeet5fqxKAAMGg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/catbox": {
+      "version": "12.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/catbox/-/catbox-12.1.1.tgz",
+      "integrity": "sha512-hDqYB1J+R0HtZg4iPH3LEnldoaBsar6bYp0EonBmNQ9t5CO+1CqgCul2ZtFveW1ReA5SQuze9GPSU7/aecERhw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/podium": "^5.0.0",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/catbox-memory": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/catbox-memory/-/catbox-memory-6.0.2.tgz",
+      "integrity": "sha512-H1l4ugoFW/ZRkqeFrIo8p1rWN0PA4MDTfu4JmcoNDvnY975o29mqoZblqFTotxNHlEkMPpIiIBJTV+Mbi+aF0g==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/content": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/content/-/content-6.0.2.tgz",
+      "integrity": "sha512-OKyCOTjNR1hftwSjk9ueyAQTw8AwapvzBrPIWMGn39vhR5PmqLdYFmLc35bsSBye7gSMnlkXfc679bUdMIcRyQ==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.0"
+      }
+    },
+    "node_modules/@hapi/cryptiles": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/cryptiles/-/cryptiles-6.0.3.tgz",
+      "integrity": "sha512-r6VKalpbMHz4ci3gFjFysBmhwCg70RpYZy6OkjEpdXzAYnYFX5XsW7n4YMJvuIYpnMwLxGUjK/cBhA7X3JDvXw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/file": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/@hapi/file/-/file-3.0.0.tgz",
+      "integrity": "sha512-w+lKW+yRrLhJu620jT3y+5g2mHqnKfepreykvdOcl9/6up8GrQQn+l3FRTsjHTKbkbfQFkuksHpdv2EcpKcJ4Q==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/hapi": {
+      "version": "21.4.9",
+      "resolved": "https://registry.npmjs.org/@hapi/hapi/-/hapi-21.4.9.tgz",
+      "integrity": "sha512-YnecZOVx2AD08VvPl0ZaFS0MjEHqg+InGRmBRli731ct+VwI++dpu3BIYA1Z4SMr6HUAnpyvbQ1aq5woe3fBWg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/accept": "^6.0.3",
+        "@hapi/ammo": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bounce": "^3.0.2",
+        "@hapi/call": "^9.0.1",
+        "@hapi/catbox": "^12.1.1",
+        "@hapi/catbox-memory": "^6.0.2",
+        "@hapi/heavy": "^8.0.1",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/mimos": "^7.0.1",
+        "@hapi/podium": "^5.0.2",
+        "@hapi/shot": "^6.0.2",
+        "@hapi/somever": "^4.1.1",
+        "@hapi/statehood": "^8.2.1",
+        "@hapi/subtext": "^8.1.3",
+        "@hapi/teamwork": "^6.0.1",
+        "@hapi/topo": "^6.0.2",
+        "@hapi/validate": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=14.15.0"
+      }
+    },
+    "node_modules/@hapi/heavy": {
+      "version": "8.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/heavy/-/heavy-8.0.1.tgz",
+      "integrity": "sha512-gBD/NANosNCOp6RsYTsjo2vhr5eYA3BEuogk6cxY0QdhllkkTaJFYtTXv46xd6qhBVMbMMqcSdtqey+UQU3//w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/hoek": {
+      "version": "11.0.7",
+      "resolved": "https://registry.npmjs.org/@hapi/hoek/-/hoek-11.0.7.tgz",
+      "integrity": "sha512-HV5undWkKzcB4RZUusqOpcgxOaq6VOAH7zhhIr2g3G8NF/MlFO75SjOr2NfuSx0Mh40+1FqCkagKLJRykUWoFQ==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/iron": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/iron/-/iron-7.0.1.tgz",
+      "integrity": "sha512-tEZnrOujKpS6jLKliyWBl3A9PaE+ppuL/+gkbyPPDb/l2KSKQyH4lhMkVb+sBhwN+qaxxlig01JRqB8dk/mPxQ==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/b64": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/cryptiles": "^6.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/mimos": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/mimos/-/mimos-7.0.1.tgz",
+      "integrity": "sha512-b79V+BrG0gJ9zcRx1VGcCI6r6GEzzZUgiGEJVoq5gwzuB2Ig9Cax8dUuBauQCFKvl2YWSWyOc8mZ8HDaJOtkew==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "mime-db": "^1.52.0"
+      }
+    },
+    "node_modules/@hapi/nigel": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/nigel/-/nigel-5.0.1.tgz",
+      "integrity": "sha512-uv3dtYuB4IsNaha+tigWmN8mQw/O9Qzl5U26Gm4ZcJVtDdB1AVJOwX3X5wOX+A07qzpEZnOMBAm8jjSqGsU6Nw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/vise": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/pez": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/pez/-/pez-6.1.1.tgz",
+      "integrity": "sha512-yg2OS1tC0S1sHXvhUtWsfRn6lrKl9jKtRhZ+EI0woOW/gqX5vM2PZ1459ypCvCYDRLJ9nIyueeEH5MJV1ZDqIg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/b64": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/content": "^6.0.1",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/nigel": "^5.0.1"
+      }
+    },
+    "node_modules/@hapi/podium": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/podium/-/podium-5.0.2.tgz",
+      "integrity": "sha512-T7gf2JYHQQfEfewTQFbsaXoZxSvuXO/QBIGljucUQ/lmPnTTNAepoIKOakWNVWvo2fMEDjycu77r8k6dhreqHA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/teamwork": "^6.0.0",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/shot": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/shot/-/shot-6.0.3.tgz",
+      "integrity": "sha512-xKmKONUE5AxUNK+EQCSCz35UpPq4cSy6wRCFvMLCDHdyPeXsmAvwxvU4OemGqpWHtAQHyCPjnDbm/fEU9O6l/w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/somever": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/somever/-/somever-4.1.1.tgz",
+      "integrity": "sha512-lt3QQiDDOVRatS0ionFDNrDIv4eXz58IibQaZQDOg4DqqdNme8oa0iPWcE0+hkq/KTeBCPtEOjDOBKBKwDumVg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/bounce": "^3.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/statehood": {
+      "version": "8.2.1",
+      "resolved": "https://registry.npmjs.org/@hapi/statehood/-/statehood-8.2.1.tgz",
+      "integrity": "sha512-xf72TG/QINW26jUu+uL5H+crE1o8GplIgfPWwPZhnAGJzetIVAQEQYvzq+C0aEVHg5/lMMtQ+L9UryuSa5Yjkg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bounce": "^3.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/cryptiles": "^6.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/iron": "^7.0.1",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/subtext": {
+      "version": "8.1.3",
+      "resolved": "https://registry.npmjs.org/@hapi/subtext/-/subtext-8.1.3.tgz",
+      "integrity": "sha512-WTpEZQjBP3UJ3gGunNl3w5Ao1EOJsuu2vttZ2KEcG+csSLxc0dI6VIkl2md2jDlHiQ2ARAoqdSUScy05A/NHtA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/content": "^6.0.2",
+        "@hapi/file": "^3.0.0",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/pez": "^6.1.1",
+        "@hapi/wreck": "^18.1.1"
+      }
+    },
+    "node_modules/@hapi/teamwork": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/teamwork/-/teamwork-6.0.1.tgz",
+      "integrity": "sha512-52OXRslUfYwXAOG8k58f2h2ngXYQGP0x5RPOo+eWA/FtyLgHjGMrE3+e9LSXP/0q2YfHAK5wj9aA9DTy1K+kyQ==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/topo": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/topo/-/topo-6.0.2.tgz",
+      "integrity": "sha512-KR3rD5inZbGMrHmgPxsJ9dbi6zEK+C3ZwUwTa+eMwWLz7oijWUTWD2pMSNNYJAU6Qq+65NkxXjqHr/7LM2Xkqg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/validate": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/validate/-/validate-2.0.1.tgz",
+      "integrity": "sha512-NZmXRnrSLK8MQ9y/CMqE9WSspgB9xA41/LlYR0k967aSZebWr4yNrpxIbov12ICwKy4APSlWXZga9jN5p6puPA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/topo": "^6.0.1"
+      }
+    },
+    "node_modules/@hapi/vise": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/vise/-/vise-5.0.1.tgz",
+      "integrity": "sha512-XZYWzzRtINQLedPYlIkSkUr7m5Ddwlu99V9elh8CSygXstfv3UnWIXT0QD+wmR0VAG34d2Vx3olqcEhRRoTu9A==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/wreck": {
+      "version": "18.1.2",
+      "resolved": "https://registry.npmjs.org/@hapi/wreck/-/wreck-18.1.2.tgz",
+      "integrity": "sha512-3dMnV2pfhQiyEqu8DL3VBmxkdLiRDiiUDuG79Dp+UK1gL9ZxAfDOUhB6k3D5MLqcgJJ1IARyGFhwoc1NITr/pg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@ioredis/commands": {
+      "version": "1.10.0",
+      "resolved": "https://registry.npmjs.org/@ioredis/commands/-/commands-1.10.0.tgz",
+      "integrity": "sha512-UmeW7z4LfctwoQ5wkhVzgq8tXkreED2xZGpX+Bg+zA+WJFZCT6c062AfCK/Dfk81xZnnwdhJCUMkitihRaoC2Q==",
+      "license": "MIT"
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-darwin-arm64/-/msgpackr-extract-darwin-arm64-3.0.4.tgz",
+      "integrity": "sha512-LCkGo6JDfaBhgST7UpPWgNgLINpcpabaHfyz5OBx75nUYxBsaEPxjnyNjWpeb/xBup/682QnBfRBy2/LvPutZQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ]
+    },
+    "node_modules/bullmq": {
+      "version": "5.77.6",
+      "resolved": "https://registry.npmjs.org/bullmq/-/bullmq-5.77.6.tgz",
+      "integrity": "sha512-WCpSoCD4vWyRD+btOsFrO7iBGInrTgG155gTZCV8qY0Yex2KtsbVtFERx6V1WZ2xWl/5ZxnLar8Z8ufnS4f5jg==",
+      "license": "MIT",
+      "dependencies": {
+        "cron-parser": "4.9.0",
+        "ioredis": "5.10.1",
+        "msgpackr": "2.0.1",
+        "node-abort-controller": "3.1.1",
+        "semver": "7.8.0",
+        "tslib": "2.8.1"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "peerDependencies": {
+        "redis": ">=5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "redis": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/bullmq/node_modules/@ioredis/commands": {
+      "version": "1.5.1",
+      "resolved": "https://registry.npmjs.org/@ioredis/commands/-/commands-1.5.1.tgz",
+      "integrity": "sha512-JH8ZL/ywcJyR9MmJ5BNqZllXNZQqQbnVZOqpPQqE1vHiFgAw4NHbvE0FOduNU8IX9babitBT46571OnPTT0Zcw==",
+      "license": "MIT"
+    },
+    "node_modules/bullmq/node_modules/ioredis": {
+      "version": "5.10.1",
+      "resolved": "https://registry.npmjs.org/ioredis/-/ioredis-5.10.1.tgz",
+      "integrity": "sha512-HuEDBTI70aYdx1v6U97SbNx9F1+svQKBDo30o0b9fw055LMepzpOOd0Ccg9Q6tbqmBSJaMuY0fB7yw9/vjBYCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@ioredis/commands": "1.5.1",
+        "cluster-key-slot": "^1.1.0",
+        "debug": "^4.3.4",
+        "denque": "^2.1.0",
+        "lodash.defaults": "^4.2.0",
+        "lodash.isarguments": "^3.1.0",
+        "redis-errors": "^1.2.0",
+        "redis-parser": "^3.0.0",
+        "standard-as-callback": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/ioredis"
+      }
+    },
+    "node_modules/cluster-key-slot": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/cluster-key-slot/-/cluster-key-slot-1.1.1.tgz",
+      "integrity": "sha512-rwHwUfXL40Chm1r08yrhU3qpUvdVlgkKNeyeGPOxnW8/SyVDvgRaed/Uz54AqWNaTCAThlj6QAs3TZcKI0xDEw==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/complex.js": {
+      "version": "2.4.3",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.4.3.tgz",
+      "integrity": "sha512-UrQVSUur14tNX6tiP4y8T4w4FeJAX3bi2cIv0pu/DTLFNxoq7z2Yh83Vfzztj6Px3X/lubqQ9IrPp7Bpn6p4MQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/cron-parser": {
+      "version": "4.9.0",
+      "resolved": "https://registry.npmjs.org/cron-parser/-/cron-parser-4.9.0.tgz",
+      "integrity": "sha512-p0SaNjrHOnQeR8/VnfGbmg9te2kfyYSQ7Sc/j/6DtPL3JQvKxmjO9TSjNFpujqV3vEYYBvNNvXSxzyksBWAx1Q==",
+      "license": "MIT",
+      "dependencies": {
+        "luxon": "^3.2.1"
+      },
+      "engines": {
+        "node": ">=12.0.0"
+      }
+    },
+    "node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/decimal.js": {
+      "version": "10.6.0",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.6.0.tgz",
+      "integrity": "sha512-YpgQiITW3JXGntzdUmyUR1V812Hn8T1YVXhCu+wO3OpS4eU9l4YdD3qjyiKdV6mvV29zapkMeD390UVEf2lkUg==",
+      "license": "MIT"
+    },
+    "node_modules/denque": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/denque/-/denque-2.1.0.tgz",
+      "integrity": "sha512-HVQE3AAb/pxF8fQAoiqpvg9i3evqug3hoiwakOyZAwJm+6vZehbkYXZ0l4JxS+I3QxM97v5aaRNhj8v5oBhekw==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=0.10"
+      }
+    },
+    "node_modules/detect-libc": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/detect-libc/-/detect-libc-2.1.2.tgz",
+      "integrity": "sha512-Btj2BOOO83o3WyH59e8MgXsxEQVcarkUOpEYrubB0urwnN10yQ364rsiByU11nZlqWYZm05i/of7io4mzihBtQ==",
+      "license": "Apache-2.0",
+      "optional": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/dotenv": {
+      "version": "16.6.1",
+      "resolved": "https://registry.npmjs.org/dotenv/-/dotenv-16.6.1.tgz",
+      "integrity": "sha512-uBq4egWHTcTt33a72vpSG0z3HnPuIl6NqYcTrKEg2azoEyl2hpW0zqlxysq2pK9HlDIHyHyakeYaYnSAwd8bow==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://dotenvx.com"
+      }
+    },
+    "node_modules/escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw==",
+      "license": "MIT"
+    },
+    "node_modules/fraction.js": {
+      "version": "5.3.4",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-5.3.4.tgz",
+      "integrity": "sha512-1X1NTtiJphryn/uLQz3whtY6jK3fTqoE3ohKs0tT+Ujr1W59oopxmoEh7Lu5p6vBaPbgoM0bzveAW4Qi5RyWDQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/ioredis": {
+      "version": "5.11.0",
+      "resolved": "https://registry.npmjs.org/ioredis/-/ioredis-5.11.0.tgz",
+      "integrity": "sha512-EZBErytyVovD8f6pDfG3Kb37N6Y3lmDA9NNj+4+IP13CzzHGeX+OyeRM2Um13khRzoBSzzL+5lVnCX8V2RLeMg==",
+      "license": "MIT",
+      "dependencies": {
+        "@ioredis/commands": "1.10.0",
+        "cluster-key-slot": "1.1.1",
+        "debug": "4.4.3",
+        "denque": "2.1.0",
+        "redis-errors": "1.2.0",
+        "redis-parser": "3.0.0",
+        "standard-as-callback": "2.1.0"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/ioredis"
+      }
+    },
+    "node_modules/javascript-natural-sort": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/javascript-natural-sort/-/javascript-natural-sort-0.7.1.tgz",
+      "integrity": "sha512-nO6jcEfZWQXDhOiBtG2KvKyEptz7RVbpGP4vTD2hLBdmNQSsCiicO2Ioinv6UI4y9ukqnBpy+XZ9H6uLNgJTlw==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.defaults": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/lodash.defaults/-/lodash.defaults-4.2.0.tgz",
+      "integrity": "sha512-qjxPLHd3r5DnsdGacqOMU6pb/avJzdh9tFX2ymgoZE27BmjXrNy/y4LoaiTeAb+O3gL8AfpJGtqfX/ae2leYYQ==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.isarguments": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/lodash.isarguments/-/lodash.isarguments-3.1.0.tgz",
+      "integrity": "sha512-chi4NHZlZqZD18a0imDHnZPrDeBbTtVN7GXMwuGdRH9qotxAjYs3aVLKc7zNOG9eddR5Ksd8rvFEBc9SsggPpg==",
+      "license": "MIT"
+    },
+    "node_modules/luxon": {
+      "version": "3.7.2",
+      "resolved": "https://registry.npmjs.org/luxon/-/luxon-3.7.2.tgz",
+      "integrity": "sha512-vtEhXh/gNjI9Yg1u4jX/0YVPMvxzHuGgCm6tC5kZyb08yjGWGnqAjGJvcXbqQR2P3MyMEFnRbpcdFS6PBcLqew==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/mathjs": {
+      "version": "14.9.1",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-14.9.1.tgz",
+      "integrity": "sha512-xhqv8Xjf+caWG3WlaPekg4v8QFOR3D5+8ycfcjMcPcnCNDgAONQLaLfyGgrggJrcHx2yUGCpACRpiD4GmXwX+Q==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@babel/runtime": "^7.26.10",
+        "complex.js": "^2.2.5",
+        "decimal.js": "^10.4.3",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^5.2.1",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^4.2.1"
+      },
+      "bin": {
+        "mathjs": "bin/cli.js"
+      },
+      "engines": {
+        "node": ">= 18"
+      }
+    },
+    "node_modules/mime-db": {
+      "version": "1.54.0",
+      "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.54.0.tgz",
+      "integrity": "sha512-aU5EJuIN2WDemCcAp2vFBfp/m4EAhWJnUNSSw0ixs7/kXbd6Pg64EmwJkNdFhB8aWt1sH2CTXrLxo/iAGV3oPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/ms": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz",
+      "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==",
+      "license": "MIT"
+    },
+    "node_modules/msgpackr": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/msgpackr/-/msgpackr-2.0.1.tgz",
+      "integrity": "sha512-9J+tqTEsbHqY8YohazYgty7LgerFIWxvMLpUjqETSmjHojtJm2WnX2kK/2a1fLI7CO7ERP1YSEUXMucz4j+yBA==",
+      "license": "MIT",
+      "optionalDependencies": {
+        "msgpackr-extract": "^3.0.2"
+      }
+    },
+    "node_modules/msgpackr-extract": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/msgpackr-extract/-/msgpackr-extract-3.0.4.tgz",
+      "integrity": "sha512-4kmO/MdyUIkLIvTPr8VHLil4AtoKIoniWPIEk5+CDy0xnWC84azhSFmuJ7PxZdsYtiP5kEeQsORAVIeMgxT+Hw==",
+      "hasInstallScript": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "node-gyp-build-optional-packages": "5.2.2"
+      },
+      "bin": {
+        "download-msgpackr-prebuilds": "bin/download-prebuilds.js"
+      },
+      "optionalDependencies": {
+        "@msgpackr-extract/msgpackr-extract-darwin-arm64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-darwin-x64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-arm": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-arm64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-x64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-win32-x64": "3.0.4"
+      }
+    },
+    "node_modules/node-abort-controller": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/node-abort-controller/-/node-abort-controller-3.1.1.tgz",
+      "integrity": "sha512-AGK2yQKIjRuqnc6VkX2Xj5d+QW8xZ87pa1UK6yA6ouUyuxfHuMP6umE5QK7UmTeOAymo+Zx1Fxiuw9rVx8taHQ==",
+      "license": "MIT"
+    },
+    "node_modules/node-gyp-build-optional-packages": {
+      "version": "5.2.2",
+      "resolved": "https://registry.npmjs.org/node-gyp-build-optional-packages/-/node-gyp-build-optional-packages-5.2.2.tgz",
+      "integrity": "sha512-s+w+rBWnpTMwSFbaE0UXsRlg7hU4FjekKU4eyAih5T8nJuNZT1nNsskXpxmeqSK9UzkBl6UgRlnKc8hz8IEqOw==",
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "detect-libc": "^2.0.1"
+      },
+      "bin": {
+        "node-gyp-build-optional-packages": "bin.js",
+        "node-gyp-build-optional-packages-optional": "optional.js",
+        "node-gyp-build-optional-packages-test": "build-test.js"
+      }
+    },
+    "node_modules/redis-errors": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/redis-errors/-/redis-errors-1.2.0.tgz",
+      "integrity": "sha512-1qny3OExCf0UvUV/5wpYKf2YwPcOqXzkwKKSmKHiE6ZMQs5heeE/c8eXK+PNllPvmjgAbfnsbpkGZWy8cBpn9w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/redis-parser": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/redis-parser/-/redis-parser-3.0.0.tgz",
+      "integrity": "sha512-DJnGAeenTdpMEH6uAJRK/uiyEIH9WVsUmoLwzudwGJUwZPp80PDBWPHXSAGNPwNvIXAbe7MSUB1zQFugFml66A==",
+      "license": "MIT",
+      "dependencies": {
+        "redis-errors": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg==",
+      "license": "MIT"
+    },
+    "node_modules/semver": {
+      "version": "7.8.0",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-7.8.0.tgz",
+      "integrity": "sha512-AcM7dV/5ul4EekoQ29Agm5vri8JNqRyj39o0qpX6vDF2GZrtutZl5RwgD1XnZjiTAfncsJhMI48QQH3sN87YNA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/standard-as-callback": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/standard-as-callback/-/standard-as-callback-2.1.0.tgz",
+      "integrity": "sha512-qoRRSyROncaz1z0mvYqIE4lCd9p2R90i6GxW3uZv5ucSu8tU7B5HXUP1gG8pVZsYNVaXjk8ClXHPttLyxAL48A==",
+      "license": "MIT"
+    },
+    "node_modules/tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q==",
+      "license": "MIT"
+    },
+    "node_modules/tslib": {
+      "version": "2.8.1",
+      "resolved": "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz",
+      "integrity": "sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w==",
+      "license": "0BSD"
+    },
+    "node_modules/typed-function": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-4.2.2.tgz",
+      "integrity": "sha512-VwaXim9Gp1bngi/q3do8hgttYn2uC3MoT/gfuMWylnj1IeZBUAyPddHZlo1K05BDoj8DYPpMdiHqH1dDYdJf2A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 18"
+      }
+    }
+  }
+}
diff --git a/node_modules/@babel/runtime/LICENSE b/node_modules/@babel/runtime/LICENSE
new file mode 100644
index 0000000..f31575e
--- /dev/null
+++ b/node_modules/@babel/runtime/LICENSE
@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2014-present Sebastian McKenzie and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/@babel/runtime/README.md b/node_modules/@babel/runtime/README.md
new file mode 100644
index 0000000..2f3368e
--- /dev/null
+++ b/node_modules/@babel/runtime/README.md
@@ -0,0 +1,19 @@
+# @babel/runtime
+
+> babel's modular runtime helpers
+
+See our website [@babel/runtime](https://babeljs.io/docs/babel-runtime) for more information.
+
+## Install
+
+Using npm:
+
+```sh
+npm install --save @babel/runtime
+```
+
+or using yarn:
+
+```sh
+yarn add @babel/runtime
+```
diff --git a/node_modules/@babel/runtime/helpers/AwaitValue.js b/node_modules/@babel/runtime/helpers/AwaitValue.js
new file mode 100644
index 0000000..52a7e69
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/AwaitValue.js
@@ -0,0 +1,4 @@
+function _AwaitValue(t) {
+  this.wrapped = t;
+}
+module.exports = _AwaitValue, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/OverloadYield.js b/node_modules/@babel/runtime/helpers/OverloadYield.js
new file mode 100644
index 0000000..0eca88c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/OverloadYield.js
@@ -0,0 +1,4 @@
+function _OverloadYield(e, d) {
+  this.v = e, this.k = d;
+}
+module.exports = _OverloadYield, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js b/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js
new file mode 100644
index 0000000..0ff780e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecoratedDescriptor.js
@@ -0,0 +1,9 @@
+function _applyDecoratedDescriptor(i, e, r, n, l) {
+  var a = {};
+  return Object.keys(n).forEach(function (i) {
+    a[i] = n[i];
+  }), a.enumerable = !!a.enumerable, a.configurable = !!a.configurable, ("value" in a || a.initializer) && (a.writable = !0), a = r.slice().reverse().reduce(function (r, n) {
+    return n(i, e, r) || r;
+  }, a), l && void 0 !== a.initializer && (a.value = a.initializer ? a.initializer.call(l) : void 0, a.initializer = void 0), void 0 === a.initializer ? (Object.defineProperty(i, e, a), null) : a;
+}
+module.exports = _applyDecoratedDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs.js b/node_modules/@babel/runtime/helpers/applyDecs.js
new file mode 100644
index 0000000..3770c5a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs.js
@@ -0,0 +1,236 @@
+var _typeof = require("./typeof.js")["default"];
+var setFunctionName = require("./setFunctionName.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function old_createMetadataMethodsForProperty(e, t, a, r) {
+  return {
+    getMetadata: function getMetadata(o) {
+      old_assertNotFinished(r, "getMetadata"), old_assertMetadataKey(o);
+      var i = e[o];
+      if (void 0 !== i) if (1 === t) {
+        var n = i["public"];
+        if (void 0 !== n) return n[a];
+      } else if (2 === t) {
+        var l = i["private"];
+        if (void 0 !== l) return l.get(a);
+      } else if (Object.hasOwnProperty.call(i, "constructor")) return i.constructor;
+    },
+    setMetadata: function setMetadata(o, i) {
+      old_assertNotFinished(r, "setMetadata"), old_assertMetadataKey(o);
+      var n = e[o];
+      if (void 0 === n && (n = e[o] = {}), 1 === t) {
+        var l = n["public"];
+        void 0 === l && (l = n["public"] = {}), l[a] = i;
+      } else if (2 === t) {
+        var s = n.priv;
+        void 0 === s && (s = n["private"] = new Map()), s.set(a, i);
+      } else n.constructor = i;
+    }
+  };
+}
+function old_convertMetadataMapToFinal(e, t) {
+  var a = e[Symbol.metadata || Symbol["for"]("Symbol.metadata")],
+    r = Object.getOwnPropertySymbols(t);
+  if (0 !== r.length) {
+    for (var o = 0; o < r.length; o++) {
+      var i = r[o],
+        n = t[i],
+        l = a ? a[i] : null,
+        s = n["public"],
+        c = l ? l["public"] : null;
+      s && c && Object.setPrototypeOf(s, c);
+      var d = n["private"];
+      if (d) {
+        var u = Array.from(d.values()),
+          f = l ? l["private"] : null;
+        f && (u = u.concat(f)), n["private"] = u;
+      }
+      l && Object.setPrototypeOf(n, l);
+    }
+    a && Object.setPrototypeOf(t, a), e[Symbol.metadata || Symbol["for"]("Symbol.metadata")] = t;
+  }
+}
+function old_createAddInitializerMethod(e, t) {
+  return function (a) {
+    old_assertNotFinished(t, "addInitializer"), old_assertCallable(a, "An initializer"), e.push(a);
+  };
+}
+function old_memberDec(e, t, a, r, o, i, n, l, s) {
+  var c;
+  switch (i) {
+    case 1:
+      c = "accessor";
+      break;
+    case 2:
+      c = "method";
+      break;
+    case 3:
+      c = "getter";
+      break;
+    case 4:
+      c = "setter";
+      break;
+    default:
+      c = "field";
+  }
+  var d,
+    u,
+    f = {
+      kind: c,
+      name: l ? "#" + t : toPropertyKey(t),
+      isStatic: n,
+      isPrivate: l
+    },
+    p = {
+      v: !1
+    };
+  if (0 !== i && (f.addInitializer = old_createAddInitializerMethod(o, p)), l) {
+    d = 2, u = Symbol(t);
+    var v = {};
+    0 === i ? (v.get = a.get, v.set = a.set) : 2 === i ? v.get = function () {
+      return a.value;
+    } : (1 !== i && 3 !== i || (v.get = function () {
+      return a.get.call(this);
+    }), 1 !== i && 4 !== i || (v.set = function (e) {
+      a.set.call(this, e);
+    })), f.access = v;
+  } else d = 1, u = t;
+  try {
+    return e(s, Object.assign(f, old_createMetadataMethodsForProperty(r, d, u, p)));
+  } finally {
+    p.v = !0;
+  }
+}
+function old_assertNotFinished(e, t) {
+  if (e.v) throw Error("attempted to call " + t + " after decoration was finished");
+}
+function old_assertMetadataKey(e) {
+  if ("symbol" != _typeof(e)) throw new TypeError("Metadata keys must be symbols, received: " + e);
+}
+function old_assertCallable(e, t) {
+  if ("function" != typeof e) throw new TypeError(t + " must be a function");
+}
+function old_assertValidReturnValue(e, t) {
+  var a = _typeof(t);
+  if (1 === e) {
+    if ("object" !== a || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+    void 0 !== t.get && old_assertCallable(t.get, "accessor.get"), void 0 !== t.set && old_assertCallable(t.set, "accessor.set"), void 0 !== t.init && old_assertCallable(t.init, "accessor.init"), void 0 !== t.initializer && old_assertCallable(t.initializer, "accessor.initializer");
+  } else if ("function" !== a) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+}
+function old_getInit(e) {
+  var t;
+  return null == (t = e.init) && (t = e.initializer) && void 0 !== console && console.warn(".initializer has been renamed to .init as of March 2022"), t;
+}
+function old_applyMemberDec(e, t, a, r, o, i, n, l, s) {
+  var c,
+    d,
+    u,
+    f,
+    p,
+    v,
+    y,
+    h = a[0];
+  if (n ? (0 === o || 1 === o ? (c = {
+    get: a[3],
+    set: a[4]
+  }, u = "get") : 3 === o ? (c = {
+    get: a[3]
+  }, u = "get") : 4 === o ? (c = {
+    set: a[3]
+  }, u = "set") : c = {
+    value: a[3]
+  }, 0 !== o && (1 === o && setFunctionName(a[4], "#" + r, "set"), setFunctionName(a[3], "#" + r, u))) : 0 !== o && (c = Object.getOwnPropertyDescriptor(t, r)), 1 === o ? f = {
+    get: c.get,
+    set: c.set
+  } : 2 === o ? f = c.value : 3 === o ? f = c.get : 4 === o && (f = c.set), "function" == typeof h) void 0 !== (p = old_memberDec(h, r, c, l, s, o, i, n, f)) && (old_assertValidReturnValue(o, p), 0 === o ? d = p : 1 === o ? (d = old_getInit(p), v = p.get || f.get, y = p.set || f.set, f = {
+    get: v,
+    set: y
+  }) : f = p);else for (var m = h.length - 1; m >= 0; m--) {
+    var b;
+    void 0 !== (p = old_memberDec(h[m], r, c, l, s, o, i, n, f)) && (old_assertValidReturnValue(o, p), 0 === o ? b = p : 1 === o ? (b = old_getInit(p), v = p.get || f.get, y = p.set || f.set, f = {
+      get: v,
+      set: y
+    }) : f = p, void 0 !== b && (void 0 === d ? d = b : "function" == typeof d ? d = [d, b] : d.push(b)));
+  }
+  if (0 === o || 1 === o) {
+    if (void 0 === d) d = function d(e, t) {
+      return t;
+    };else if ("function" != typeof d) {
+      var g = d;
+      d = function d(e, t) {
+        for (var a = t, r = 0; r < g.length; r++) a = g[r].call(e, a);
+        return a;
+      };
+    } else {
+      var _ = d;
+      d = function d(e, t) {
+        return _.call(e, t);
+      };
+    }
+    e.push(d);
+  }
+  0 !== o && (1 === o ? (c.get = f.get, c.set = f.set) : 2 === o ? c.value = f : 3 === o ? c.get = f : 4 === o && (c.set = f), n ? 1 === o ? (e.push(function (e, t) {
+    return f.get.call(e, t);
+  }), e.push(function (e, t) {
+    return f.set.call(e, t);
+  })) : 2 === o ? e.push(f) : e.push(function (e, t) {
+    return f.call(e, t);
+  }) : Object.defineProperty(t, r, c));
+}
+function old_applyMemberDecs(e, t, a, r, o) {
+  for (var i, n, l = new Map(), s = new Map(), c = 0; c < o.length; c++) {
+    var d = o[c];
+    if (Array.isArray(d)) {
+      var u,
+        f,
+        p,
+        v = d[1],
+        y = d[2],
+        h = d.length > 3,
+        m = v >= 5;
+      if (m ? (u = t, f = r, 0 != (v -= 5) && (p = n = n || [])) : (u = t.prototype, f = a, 0 !== v && (p = i = i || [])), 0 !== v && !h) {
+        var b = m ? s : l,
+          g = b.get(y) || 0;
+        if (!0 === g || 3 === g && 4 !== v || 4 === g && 3 !== v) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + y);
+        !g && v > 2 ? b.set(y, v) : b.set(y, !0);
+      }
+      old_applyMemberDec(e, u, d, y, v, m, h, f, p);
+    }
+  }
+  old_pushInitializers(e, i), old_pushInitializers(e, n);
+}
+function old_pushInitializers(e, t) {
+  t && e.push(function (e) {
+    for (var a = 0; a < t.length; a++) t[a].call(e);
+    return e;
+  });
+}
+function old_applyClassDecs(e, t, a, r) {
+  if (r.length > 0) {
+    for (var o = [], i = t, n = t.name, l = r.length - 1; l >= 0; l--) {
+      var s = {
+        v: !1
+      };
+      try {
+        var c = Object.assign({
+            kind: "class",
+            name: n,
+            addInitializer: old_createAddInitializerMethod(o, s)
+          }, old_createMetadataMethodsForProperty(a, 0, n, s)),
+          d = r[l](i, c);
+      } finally {
+        s.v = !0;
+      }
+      void 0 !== d && (old_assertValidReturnValue(10, d), i = d);
+    }
+    e.push(i, function () {
+      for (var e = 0; e < o.length; e++) o[e].call(i);
+    });
+  }
+}
+function applyDecs(e, t, a) {
+  var r = [],
+    o = {},
+    i = {};
+  return old_applyMemberDecs(r, e, i, o, t), old_convertMetadataMapToFinal(e.prototype, i), old_applyClassDecs(r, e, o, a), old_convertMetadataMapToFinal(e, o), r;
+}
+module.exports = applyDecs, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs2203.js b/node_modules/@babel/runtime/helpers/applyDecs2203.js
new file mode 100644
index 0000000..5af267c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs2203.js
@@ -0,0 +1,184 @@
+var _typeof = require("./typeof.js")["default"];
+function applyDecs2203Factory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function memberDec(e, t, r, a, n, i, s, o) {
+    var c;
+    switch (n) {
+      case 1:
+        c = "accessor";
+        break;
+      case 2:
+        c = "method";
+        break;
+      case 3:
+        c = "getter";
+        break;
+      case 4:
+        c = "setter";
+        break;
+      default:
+        c = "field";
+    }
+    var l,
+      u,
+      f = {
+        kind: c,
+        name: s ? "#" + t : t,
+        "static": i,
+        "private": s
+      },
+      p = {
+        v: !1
+      };
+    0 !== n && (f.addInitializer = createAddInitializerMethod(a, p)), 0 === n ? s ? (l = r.get, u = r.set) : (l = function l() {
+      return this[t];
+    }, u = function u(e) {
+      this[t] = e;
+    }) : 2 === n ? l = function l() {
+      return r.value;
+    } : (1 !== n && 3 !== n || (l = function l() {
+      return r.get.call(this);
+    }), 1 !== n && 4 !== n || (u = function u(e) {
+      r.set.call(this, e);
+    })), f.access = l && u ? {
+      get: l,
+      set: u
+    } : l ? {
+      get: l
+    } : {
+      set: u
+    };
+    try {
+      return e(o, f);
+    } finally {
+      p.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function applyMemberDec(e, t, r, a, n, i, s, o) {
+    var c,
+      l,
+      u,
+      f,
+      p,
+      d,
+      h = r[0];
+    if (s ? c = 0 === n || 1 === n ? {
+      get: r[3],
+      set: r[4]
+    } : 3 === n ? {
+      get: r[3]
+    } : 4 === n ? {
+      set: r[3]
+    } : {
+      value: r[3]
+    } : 0 !== n && (c = Object.getOwnPropertyDescriptor(t, a)), 1 === n ? u = {
+      get: c.get,
+      set: c.set
+    } : 2 === n ? u = c.value : 3 === n ? u = c.get : 4 === n && (u = c.set), "function" == typeof h) void 0 !== (f = memberDec(h, a, c, o, n, i, s, u)) && (assertValidReturnValue(n, f), 0 === n ? l = f : 1 === n ? (l = f.init, p = f.get || u.get, d = f.set || u.set, u = {
+      get: p,
+      set: d
+    }) : u = f);else for (var v = h.length - 1; v >= 0; v--) {
+      var g;
+      void 0 !== (f = memberDec(h[v], a, c, o, n, i, s, u)) && (assertValidReturnValue(n, f), 0 === n ? g = f : 1 === n ? (g = f.init, p = f.get || u.get, d = f.set || u.set, u = {
+        get: p,
+        set: d
+      }) : u = f, void 0 !== g && (void 0 === l ? l = g : "function" == typeof l ? l = [l, g] : l.push(g)));
+    }
+    if (0 === n || 1 === n) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var y = l;
+        l = function l(e, t) {
+          for (var r = t, a = 0; a < y.length; a++) r = y[a].call(e, r);
+          return r;
+        };
+      } else {
+        var m = l;
+        l = function l(e, t) {
+          return m.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== n && (1 === n ? (c.get = u.get, c.set = u.set) : 2 === n ? c.value = u : 3 === n ? c.get = u : 4 === n && (c.set = u), s ? 1 === n ? (e.push(function (e, t) {
+      return u.get.call(e, t);
+    }), e.push(function (e, t) {
+      return u.set.call(e, t);
+    })) : 2 === n ? e.push(u) : e.push(function (e, t) {
+      return u.call(e, t);
+    }) : Object.defineProperty(t, a, c));
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r) {
+    var a = [];
+    return function (e, t, r) {
+      for (var a, n, i = new Map(), s = new Map(), o = 0; o < r.length; o++) {
+        var c = r[o];
+        if (Array.isArray(c)) {
+          var l,
+            u,
+            f = c[1],
+            p = c[2],
+            d = c.length > 3,
+            h = f >= 5;
+          if (h ? (l = t, 0 != (f -= 5) && (u = n = n || [])) : (l = t.prototype, 0 !== f && (u = a = a || [])), 0 !== f && !d) {
+            var v = h ? s : i,
+              g = v.get(p) || 0;
+            if (!0 === g || 3 === g && 4 !== f || 4 === g && 3 !== f) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + p);
+            !g && f > 2 ? v.set(p, f) : v.set(p, !0);
+          }
+          applyMemberDec(e, l, c, p, f, h, d, u);
+        }
+      }
+      pushInitializers(e, a), pushInitializers(e, n);
+    }(a, e, t), function (e, t, r) {
+      if (r.length > 0) {
+        for (var a = [], n = t, i = t.name, s = r.length - 1; s >= 0; s--) {
+          var o = {
+            v: !1
+          };
+          try {
+            var c = r[s](n, {
+              kind: "class",
+              name: i,
+              addInitializer: createAddInitializerMethod(a, o)
+            });
+          } finally {
+            o.v = !0;
+          }
+          void 0 !== c && (assertValidReturnValue(10, c), n = c);
+        }
+        e.push(n, function () {
+          for (var e = 0; e < a.length; e++) a[e].call(n);
+        });
+      }
+    }(a, e, r), a;
+  };
+}
+var applyDecs2203Impl;
+function applyDecs2203(e, t, r) {
+  return (applyDecs2203Impl = applyDecs2203Impl || applyDecs2203Factory())(e, t, r);
+}
+module.exports = applyDecs2203, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs2203R.js b/node_modules/@babel/runtime/helpers/applyDecs2203R.js
new file mode 100644
index 0000000..1be7f5e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs2203R.js
@@ -0,0 +1,191 @@
+var _typeof = require("./typeof.js")["default"];
+var setFunctionName = require("./setFunctionName.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function applyDecs2203RFactory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function memberDec(e, t, r, n, a, i, o, s) {
+    var c;
+    switch (a) {
+      case 1:
+        c = "accessor";
+        break;
+      case 2:
+        c = "method";
+        break;
+      case 3:
+        c = "getter";
+        break;
+      case 4:
+        c = "setter";
+        break;
+      default:
+        c = "field";
+    }
+    var l,
+      u,
+      f = {
+        kind: c,
+        name: o ? "#" + t : toPropertyKey(t),
+        "static": i,
+        "private": o
+      },
+      p = {
+        v: !1
+      };
+    0 !== a && (f.addInitializer = createAddInitializerMethod(n, p)), 0 === a ? o ? (l = r.get, u = r.set) : (l = function l() {
+      return this[t];
+    }, u = function u(e) {
+      this[t] = e;
+    }) : 2 === a ? l = function l() {
+      return r.value;
+    } : (1 !== a && 3 !== a || (l = function l() {
+      return r.get.call(this);
+    }), 1 !== a && 4 !== a || (u = function u(e) {
+      r.set.call(this, e);
+    })), f.access = l && u ? {
+      get: l,
+      set: u
+    } : l ? {
+      get: l
+    } : {
+      set: u
+    };
+    try {
+      return e(s, f);
+    } finally {
+      p.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function applyMemberDec(e, t, r, n, a, i, o, s) {
+    var c,
+      l,
+      u,
+      f,
+      p,
+      d,
+      h,
+      v = r[0];
+    if (o ? (0 === a || 1 === a ? (c = {
+      get: r[3],
+      set: r[4]
+    }, u = "get") : 3 === a ? (c = {
+      get: r[3]
+    }, u = "get") : 4 === a ? (c = {
+      set: r[3]
+    }, u = "set") : c = {
+      value: r[3]
+    }, 0 !== a && (1 === a && setFunctionName(r[4], "#" + n, "set"), setFunctionName(r[3], "#" + n, u))) : 0 !== a && (c = Object.getOwnPropertyDescriptor(t, n)), 1 === a ? f = {
+      get: c.get,
+      set: c.set
+    } : 2 === a ? f = c.value : 3 === a ? f = c.get : 4 === a && (f = c.set), "function" == typeof v) void 0 !== (p = memberDec(v, n, c, s, a, i, o, f)) && (assertValidReturnValue(a, p), 0 === a ? l = p : 1 === a ? (l = p.init, d = p.get || f.get, h = p.set || f.set, f = {
+      get: d,
+      set: h
+    }) : f = p);else for (var g = v.length - 1; g >= 0; g--) {
+      var y;
+      void 0 !== (p = memberDec(v[g], n, c, s, a, i, o, f)) && (assertValidReturnValue(a, p), 0 === a ? y = p : 1 === a ? (y = p.init, d = p.get || f.get, h = p.set || f.set, f = {
+        get: d,
+        set: h
+      }) : f = p, void 0 !== y && (void 0 === l ? l = y : "function" == typeof l ? l = [l, y] : l.push(y)));
+    }
+    if (0 === a || 1 === a) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var m = l;
+        l = function l(e, t) {
+          for (var r = t, n = 0; n < m.length; n++) r = m[n].call(e, r);
+          return r;
+        };
+      } else {
+        var b = l;
+        l = function l(e, t) {
+          return b.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== a && (1 === a ? (c.get = f.get, c.set = f.set) : 2 === a ? c.value = f : 3 === a ? c.get = f : 4 === a && (c.set = f), o ? 1 === a ? (e.push(function (e, t) {
+      return f.get.call(e, t);
+    }), e.push(function (e, t) {
+      return f.set.call(e, t);
+    })) : 2 === a ? e.push(f) : e.push(function (e, t) {
+      return f.call(e, t);
+    }) : Object.defineProperty(t, n, c));
+  }
+  function applyMemberDecs(e, t) {
+    for (var r, n, a = [], i = new Map(), o = new Map(), s = 0; s < t.length; s++) {
+      var c = t[s];
+      if (Array.isArray(c)) {
+        var l,
+          u,
+          f = c[1],
+          p = c[2],
+          d = c.length > 3,
+          h = f >= 5;
+        if (h ? (l = e, 0 != (f -= 5) && (u = n = n || [])) : (l = e.prototype, 0 !== f && (u = r = r || [])), 0 !== f && !d) {
+          var v = h ? o : i,
+            g = v.get(p) || 0;
+          if (!0 === g || 3 === g && 4 !== f || 4 === g && 3 !== f) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + p);
+          !g && f > 2 ? v.set(p, f) : v.set(p, !0);
+        }
+        applyMemberDec(a, l, c, p, f, h, d, u);
+      }
+    }
+    return pushInitializers(a, r), pushInitializers(a, n), a;
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r) {
+    return {
+      e: applyMemberDecs(e, t),
+      get c() {
+        return function (e, t) {
+          if (t.length > 0) {
+            for (var r = [], n = e, a = e.name, i = t.length - 1; i >= 0; i--) {
+              var o = {
+                v: !1
+              };
+              try {
+                var s = t[i](n, {
+                  kind: "class",
+                  name: a,
+                  addInitializer: createAddInitializerMethod(r, o)
+                });
+              } finally {
+                o.v = !0;
+              }
+              void 0 !== s && (assertValidReturnValue(10, s), n = s);
+            }
+            return [n, function () {
+              for (var e = 0; e < r.length; e++) r[e].call(n);
+            }];
+          }
+        }(e, r);
+      }
+    };
+  };
+}
+function applyDecs2203R(e, t, r) {
+  return (module.exports = applyDecs2203R = applyDecs2203RFactory(), module.exports.__esModule = true, module.exports["default"] = module.exports)(e, t, r);
+}
+module.exports = applyDecs2203R, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs2301.js b/node_modules/@babel/runtime/helpers/applyDecs2301.js
new file mode 100644
index 0000000..577eee8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs2301.js
@@ -0,0 +1,222 @@
+var _typeof = require("./typeof.js")["default"];
+var checkInRHS = require("./checkInRHS.js");
+var setFunctionName = require("./setFunctionName.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function applyDecs2301Factory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function assertInstanceIfPrivate(e, t) {
+    if (!e(t)) throw new TypeError("Attempted to access private element on non-instance");
+  }
+  function memberDec(e, t, r, n, a, i, s, o, c) {
+    var u;
+    switch (a) {
+      case 1:
+        u = "accessor";
+        break;
+      case 2:
+        u = "method";
+        break;
+      case 3:
+        u = "getter";
+        break;
+      case 4:
+        u = "setter";
+        break;
+      default:
+        u = "field";
+    }
+    var l,
+      f,
+      p = {
+        kind: u,
+        name: s ? "#" + t : toPropertyKey(t),
+        "static": i,
+        "private": s
+      },
+      d = {
+        v: !1
+      };
+    if (0 !== a && (p.addInitializer = createAddInitializerMethod(n, d)), s || 0 !== a && 2 !== a) {
+      if (2 === a) l = function l(e) {
+        return assertInstanceIfPrivate(c, e), r.value;
+      };else {
+        var h = 0 === a || 1 === a;
+        (h || 3 === a) && (l = s ? function (e) {
+          return assertInstanceIfPrivate(c, e), r.get.call(e);
+        } : function (e) {
+          return r.get.call(e);
+        }), (h || 4 === a) && (f = s ? function (e, t) {
+          assertInstanceIfPrivate(c, e), r.set.call(e, t);
+        } : function (e, t) {
+          r.set.call(e, t);
+        });
+      }
+    } else l = function l(e) {
+      return e[t];
+    }, 0 === a && (f = function f(e, r) {
+      e[t] = r;
+    });
+    var v = s ? c.bind() : function (e) {
+      return t in e;
+    };
+    p.access = l && f ? {
+      get: l,
+      set: f,
+      has: v
+    } : l ? {
+      get: l,
+      has: v
+    } : {
+      set: f,
+      has: v
+    };
+    try {
+      return e(o, p);
+    } finally {
+      d.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function curryThis2(e) {
+    return function (t) {
+      e(this, t);
+    };
+  }
+  function applyMemberDec(e, t, r, n, a, i, s, o, c) {
+    var u,
+      l,
+      f,
+      p,
+      d,
+      h,
+      v,
+      y,
+      g = r[0];
+    if (s ? (0 === a || 1 === a ? (u = {
+      get: (d = r[3], function () {
+        return d(this);
+      }),
+      set: curryThis2(r[4])
+    }, f = "get") : 3 === a ? (u = {
+      get: r[3]
+    }, f = "get") : 4 === a ? (u = {
+      set: r[3]
+    }, f = "set") : u = {
+      value: r[3]
+    }, 0 !== a && (1 === a && setFunctionName(u.set, "#" + n, "set"), setFunctionName(u[f || "value"], "#" + n, f))) : 0 !== a && (u = Object.getOwnPropertyDescriptor(t, n)), 1 === a ? p = {
+      get: u.get,
+      set: u.set
+    } : 2 === a ? p = u.value : 3 === a ? p = u.get : 4 === a && (p = u.set), "function" == typeof g) void 0 !== (h = memberDec(g, n, u, o, a, i, s, p, c)) && (assertValidReturnValue(a, h), 0 === a ? l = h : 1 === a ? (l = h.init, v = h.get || p.get, y = h.set || p.set, p = {
+      get: v,
+      set: y
+    }) : p = h);else for (var m = g.length - 1; m >= 0; m--) {
+      var b;
+      void 0 !== (h = memberDec(g[m], n, u, o, a, i, s, p, c)) && (assertValidReturnValue(a, h), 0 === a ? b = h : 1 === a ? (b = h.init, v = h.get || p.get, y = h.set || p.set, p = {
+        get: v,
+        set: y
+      }) : p = h, void 0 !== b && (void 0 === l ? l = b : "function" == typeof l ? l = [l, b] : l.push(b)));
+    }
+    if (0 === a || 1 === a) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var I = l;
+        l = function l(e, t) {
+          for (var r = t, n = 0; n < I.length; n++) r = I[n].call(e, r);
+          return r;
+        };
+      } else {
+        var w = l;
+        l = function l(e, t) {
+          return w.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== a && (1 === a ? (u.get = p.get, u.set = p.set) : 2 === a ? u.value = p : 3 === a ? u.get = p : 4 === a && (u.set = p), s ? 1 === a ? (e.push(function (e, t) {
+      return p.get.call(e, t);
+    }), e.push(function (e, t) {
+      return p.set.call(e, t);
+    })) : 2 === a ? e.push(p) : e.push(function (e, t) {
+      return p.call(e, t);
+    }) : Object.defineProperty(t, n, u));
+  }
+  function applyMemberDecs(e, t, r) {
+    for (var n, a, i, s = [], o = new Map(), c = new Map(), u = 0; u < t.length; u++) {
+      var l = t[u];
+      if (Array.isArray(l)) {
+        var f,
+          p,
+          d = l[1],
+          h = l[2],
+          v = l.length > 3,
+          y = d >= 5,
+          g = r;
+        if (y ? (f = e, 0 != (d -= 5) && (p = a = a || []), v && !i && (i = function i(t) {
+          return checkInRHS(t) === e;
+        }), g = i) : (f = e.prototype, 0 !== d && (p = n = n || [])), 0 !== d && !v) {
+          var m = y ? c : o,
+            b = m.get(h) || 0;
+          if (!0 === b || 3 === b && 4 !== d || 4 === b && 3 !== d) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + h);
+          !b && d > 2 ? m.set(h, d) : m.set(h, !0);
+        }
+        applyMemberDec(s, f, l, h, d, y, v, p, g);
+      }
+    }
+    return pushInitializers(s, n), pushInitializers(s, a), s;
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r, n) {
+    return {
+      e: applyMemberDecs(e, t, n),
+      get c() {
+        return function (e, t) {
+          if (t.length > 0) {
+            for (var r = [], n = e, a = e.name, i = t.length - 1; i >= 0; i--) {
+              var s = {
+                v: !1
+              };
+              try {
+                var o = t[i](n, {
+                  kind: "class",
+                  name: a,
+                  addInitializer: createAddInitializerMethod(r, s)
+                });
+              } finally {
+                s.v = !0;
+              }
+              void 0 !== o && (assertValidReturnValue(10, o), n = o);
+            }
+            return [n, function () {
+              for (var e = 0; e < r.length; e++) r[e].call(n);
+            }];
+          }
+        }(e, r);
+      }
+    };
+  };
+}
+function applyDecs2301(e, t, r, n) {
+  return (module.exports = applyDecs2301 = applyDecs2301Factory(), module.exports.__esModule = true, module.exports["default"] = module.exports)(e, t, r, n);
+}
+module.exports = applyDecs2301, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs2305.js b/node_modules/@babel/runtime/helpers/applyDecs2305.js
new file mode 100644
index 0000000..744c352
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs2305.js
@@ -0,0 +1,133 @@
+var _typeof = require("./typeof.js")["default"];
+var checkInRHS = require("./checkInRHS.js");
+var setFunctionName = require("./setFunctionName.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function applyDecs2305(e, t, r, n, o, a) {
+  function i(e, t, r) {
+    return function (n, o) {
+      return r && r(n), e[t].call(n, o);
+    };
+  }
+  function c(e, t) {
+    for (var r = 0; r < e.length; r++) e[r].call(t);
+    return t;
+  }
+  function s(e, t, r, n) {
+    if ("function" != typeof e && (n || void 0 !== e)) throw new TypeError(t + " must " + (r || "be") + " a function" + (n ? "" : " or undefined"));
+    return e;
+  }
+  function applyDec(e, t, r, n, o, a, c, u, l, f, p, d, h) {
+    function m(e) {
+      if (!h(e)) throw new TypeError("Attempted to access private element on non-instance");
+    }
+    var y,
+      v = t[0],
+      g = t[3],
+      b = !u;
+    if (!b) {
+      r || Array.isArray(v) || (v = [v]);
+      var w = {},
+        S = [],
+        A = 3 === o ? "get" : 4 === o || d ? "set" : "value";
+      f ? (p || d ? w = {
+        get: setFunctionName(function () {
+          return g(this);
+        }, n, "get"),
+        set: function set(e) {
+          t[4](this, e);
+        }
+      } : w[A] = g, p || setFunctionName(w[A], n, 2 === o ? "" : A)) : p || (w = Object.getOwnPropertyDescriptor(e, n));
+    }
+    for (var P = e, j = v.length - 1; j >= 0; j -= r ? 2 : 1) {
+      var D = v[j],
+        E = r ? v[j - 1] : void 0,
+        I = {},
+        O = {
+          kind: ["field", "accessor", "method", "getter", "setter", "class"][o],
+          name: n,
+          metadata: a,
+          addInitializer: function (e, t) {
+            if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+            s(t, "An initializer", "be", !0), c.push(t);
+          }.bind(null, I)
+        };
+      try {
+        if (b) (y = s(D.call(E, P, O), "class decorators", "return")) && (P = y);else {
+          var k, F;
+          O["static"] = l, O["private"] = f, f ? 2 === o ? k = function k(e) {
+            return m(e), w.value;
+          } : (o < 4 && (k = i(w, "get", m)), 3 !== o && (F = i(w, "set", m))) : (k = function k(e) {
+            return e[n];
+          }, (o < 2 || 4 === o) && (F = function F(e, t) {
+            e[n] = t;
+          }));
+          var N = O.access = {
+            has: f ? h.bind() : function (e) {
+              return n in e;
+            }
+          };
+          if (k && (N.get = k), F && (N.set = F), P = D.call(E, d ? {
+            get: w.get,
+            set: w.set
+          } : w[A], O), d) {
+            if ("object" == _typeof(P) && P) (y = s(P.get, "accessor.get")) && (w.get = y), (y = s(P.set, "accessor.set")) && (w.set = y), (y = s(P.init, "accessor.init")) && S.push(y);else if (void 0 !== P) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+          } else s(P, (p ? "field" : "method") + " decorators", "return") && (p ? S.push(P) : w[A] = P);
+        }
+      } finally {
+        I.v = !0;
+      }
+    }
+    return (p || d) && u.push(function (e, t) {
+      for (var r = S.length - 1; r >= 0; r--) t = S[r].call(e, t);
+      return t;
+    }), p || b || (f ? d ? u.push(i(w, "get"), i(w, "set")) : u.push(2 === o ? w[A] : i.call.bind(w[A])) : Object.defineProperty(e, n, w)), P;
+  }
+  function u(e, t) {
+    return Object.defineProperty(e, Symbol.metadata || Symbol["for"]("Symbol.metadata"), {
+      configurable: !0,
+      enumerable: !0,
+      value: t
+    });
+  }
+  if (arguments.length >= 6) var l = a[Symbol.metadata || Symbol["for"]("Symbol.metadata")];
+  var f = Object.create(null == l ? null : l),
+    p = function (e, t, r, n) {
+      var o,
+        a,
+        i = [],
+        s = function s(t) {
+          return checkInRHS(t) === e;
+        },
+        u = new Map();
+      function l(e) {
+        e && i.push(c.bind(null, e));
+      }
+      for (var f = 0; f < t.length; f++) {
+        var p = t[f];
+        if (Array.isArray(p)) {
+          var d = p[1],
+            h = p[2],
+            m = p.length > 3,
+            y = 16 & d,
+            v = !!(8 & d),
+            g = 0 == (d &= 7),
+            b = h + "/" + v;
+          if (!g && !m) {
+            var w = u.get(b);
+            if (!0 === w || 3 === w && 4 !== d || 4 === w && 3 !== d) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + h);
+            u.set(b, !(d > 2) || d);
+          }
+          applyDec(v ? e : e.prototype, p, y, m ? "#" + h : toPropertyKey(h), d, n, v ? a = a || [] : o = o || [], i, v, m, g, 1 === d, v && m ? s : r);
+        }
+      }
+      return l(o), l(a), i;
+    }(e, t, o, f);
+  return r.length || u(e, f), {
+    e: p,
+    get c() {
+      var t = [];
+      return r.length && [u(applyDec(e, [r], n, e.name, 5, f, t), f), c.bind(null, t, e)];
+    }
+  };
+}
+module.exports = applyDecs2305, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/applyDecs2311.js b/node_modules/@babel/runtime/helpers/applyDecs2311.js
new file mode 100644
index 0000000..5c7ed77
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/applyDecs2311.js
@@ -0,0 +1,124 @@
+var _typeof = require("./typeof.js")["default"];
+var checkInRHS = require("./checkInRHS.js");
+var setFunctionName = require("./setFunctionName.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function applyDecs2311(e, t, n, r, o, i) {
+  var a,
+    c,
+    u,
+    s,
+    f,
+    l,
+    p,
+    d = Symbol.metadata || Symbol["for"]("Symbol.metadata"),
+    m = Object.defineProperty,
+    h = Object.create,
+    y = [h(null), h(null)],
+    v = t.length;
+  function g(t, n, r) {
+    return function (o, i) {
+      n && (i = o, o = e);
+      for (var a = 0; a < t.length; a++) i = t[a].apply(o, r ? [i] : []);
+      return r ? i : o;
+    };
+  }
+  function b(e, t, n, r) {
+    if ("function" != typeof e && (r || void 0 !== e)) throw new TypeError(t + " must " + (n || "be") + " a function" + (r ? "" : " or undefined"));
+    return e;
+  }
+  function applyDec(e, t, n, r, o, i, u, s, f, l, p) {
+    function d(e) {
+      if (!p(e)) throw new TypeError("Attempted to access private element on non-instance");
+    }
+    var h = [].concat(t[0]),
+      v = t[3],
+      w = !u,
+      D = 1 === o,
+      S = 3 === o,
+      j = 4 === o,
+      E = 2 === o;
+    function I(t, n, r) {
+      return function (o, i) {
+        return n && (i = o, o = e), r && r(o), P[t].call(o, i);
+      };
+    }
+    if (!w) {
+      var P = {},
+        k = [],
+        F = S ? "get" : j || D ? "set" : "value";
+      if (f ? (l || D ? P = {
+        get: setFunctionName(function () {
+          return v(this);
+        }, r, "get"),
+        set: function set(e) {
+          t[4](this, e);
+        }
+      } : P[F] = v, l || setFunctionName(P[F], r, E ? "" : F)) : l || (P = Object.getOwnPropertyDescriptor(e, r)), !l && !f) {
+        if ((c = y[+s][r]) && 7 !== (c ^ o)) throw Error("Decorating two elements with the same name (" + P[F].name + ") is not supported yet");
+        y[+s][r] = o < 3 ? 1 : o;
+      }
+    }
+    for (var N = e, O = h.length - 1; O >= 0; O -= n ? 2 : 1) {
+      var T = b(h[O], "A decorator", "be", !0),
+        z = n ? h[O - 1] : void 0,
+        A = {},
+        H = {
+          kind: ["field", "accessor", "method", "getter", "setter", "class"][o],
+          name: r,
+          metadata: a,
+          addInitializer: function (e, t) {
+            if (e.v) throw new TypeError("attempted to call addInitializer after decoration was finished");
+            b(t, "An initializer", "be", !0), i.push(t);
+          }.bind(null, A)
+        };
+      if (w) c = T.call(z, N, H), A.v = 1, b(c, "class decorators", "return") && (N = c);else if (H["static"] = s, H["private"] = f, c = H.access = {
+        has: f ? p.bind() : function (e) {
+          return r in e;
+        }
+      }, j || (c.get = f ? E ? function (e) {
+        return d(e), P.value;
+      } : I("get", 0, d) : function (e) {
+        return e[r];
+      }), E || S || (c.set = f ? I("set", 0, d) : function (e, t) {
+        e[r] = t;
+      }), N = T.call(z, D ? {
+        get: P.get,
+        set: P.set
+      } : P[F], H), A.v = 1, D) {
+        if ("object" == _typeof(N) && N) (c = b(N.get, "accessor.get")) && (P.get = c), (c = b(N.set, "accessor.set")) && (P.set = c), (c = b(N.init, "accessor.init")) && k.unshift(c);else if (void 0 !== N) throw new TypeError("accessor decorators must return an object with get, set, or init properties or undefined");
+      } else b(N, (l ? "field" : "method") + " decorators", "return") && (l ? k.unshift(N) : P[F] = N);
+    }
+    return o < 2 && u.push(g(k, s, 1), g(i, s, 0)), l || w || (f ? D ? u.splice(-1, 0, I("get", s), I("set", s)) : u.push(E ? P[F] : b.call.bind(P[F])) : m(e, r, P)), N;
+  }
+  function w(e) {
+    return m(e, d, {
+      configurable: !0,
+      enumerable: !0,
+      value: a
+    });
+  }
+  return void 0 !== i && (a = i[d]), a = h(null == a ? null : a), f = [], l = function l(e) {
+    e && f.push(g(e));
+  }, p = function p(t, r) {
+    for (var i = 0; i < n.length; i++) {
+      var a = n[i],
+        c = a[1],
+        l = 7 & c;
+      if ((8 & c) == t && !l == r) {
+        var p = a[2],
+          d = !!a[3],
+          m = 16 & c;
+        applyDec(t ? e : e.prototype, a, m, d ? "#" + p : toPropertyKey(p), l, l < 2 ? [] : t ? s = s || [] : u = u || [], f, !!t, d, r, t && d ? function (t) {
+          return checkInRHS(t) === e;
+        } : o);
+      }
+    }
+  }, p(8, 0), p(0, 0), p(8, 1), p(0, 1), l(u), l(s), c = f, v || w(e), {
+    e: c,
+    get c() {
+      var n = [];
+      return v && [w(e = applyDec(e, [t], r, e.name, 5, n)), g(n, 1)];
+    }
+  };
+}
+module.exports = applyDecs2311, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayLikeToArray.js b/node_modules/@babel/runtime/helpers/arrayLikeToArray.js
new file mode 100644
index 0000000..19787e3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayLikeToArray.js
@@ -0,0 +1,6 @@
+function _arrayLikeToArray(r, a) {
+  (null == a || a > r.length) && (a = r.length);
+  for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
+  return n;
+}
+module.exports = _arrayLikeToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayWithHoles.js b/node_modules/@babel/runtime/helpers/arrayWithHoles.js
new file mode 100644
index 0000000..78bdd93
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayWithHoles.js
@@ -0,0 +1,4 @@
+function _arrayWithHoles(r) {
+  if (Array.isArray(r)) return r;
+}
+module.exports = _arrayWithHoles, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js b/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js
new file mode 100644
index 0000000..42218f5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/arrayWithoutHoles.js
@@ -0,0 +1,5 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+function _arrayWithoutHoles(r) {
+  if (Array.isArray(r)) return arrayLikeToArray(r);
+}
+module.exports = _arrayWithoutHoles, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/assertClassBrand.js b/node_modules/@babel/runtime/helpers/assertClassBrand.js
new file mode 100644
index 0000000..e63ed8f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/assertClassBrand.js
@@ -0,0 +1,5 @@
+function _assertClassBrand(e, t, n) {
+  if ("function" == typeof e ? e === t : e.has(t)) return arguments.length < 3 ? t : n;
+  throw new TypeError("Private element is not present on this object");
+}
+module.exports = _assertClassBrand, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/assertThisInitialized.js b/node_modules/@babel/runtime/helpers/assertThisInitialized.js
new file mode 100644
index 0000000..02594fb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/assertThisInitialized.js
@@ -0,0 +1,5 @@
+function _assertThisInitialized(e) {
+  if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  return e;
+}
+module.exports = _assertThisInitialized, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js b/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js
new file mode 100644
index 0000000..023568e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncGeneratorDelegate.js
@@ -0,0 +1,24 @@
+var OverloadYield = require("./OverloadYield.js");
+function _asyncGeneratorDelegate(t) {
+  var e = {},
+    n = !1;
+  function pump(e, r) {
+    return n = !0, r = new Promise(function (n) {
+      n(t[e](r));
+    }), {
+      done: !1,
+      value: new OverloadYield(r, 1)
+    };
+  }
+  return e["undefined" != typeof Symbol && Symbol.iterator || "@@iterator"] = function () {
+    return this;
+  }, e.next = function (t) {
+    return n ? (n = !1, t) : pump("next", t);
+  }, "function" == typeof t["throw"] && (e["throw"] = function (t) {
+    if (n) throw n = !1, t;
+    return pump("throw", t);
+  }), "function" == typeof t["return"] && (e["return"] = function (t) {
+    return n ? (n = !1, t) : pump("return", t);
+  }), e;
+}
+module.exports = _asyncGeneratorDelegate, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncIterator.js b/node_modules/@babel/runtime/helpers/asyncIterator.js
new file mode 100644
index 0000000..9c0c95c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncIterator.js
@@ -0,0 +1,45 @@
+function _asyncIterator(r) {
+  var n,
+    t,
+    o,
+    e = 2;
+  for ("undefined" != typeof Symbol && (t = Symbol.asyncIterator, o = Symbol.iterator); e--;) {
+    if (t && null != (n = r[t])) return n.call(r);
+    if (o && null != (n = r[o])) return new AsyncFromSyncIterator(n.call(r));
+    t = "@@asyncIterator", o = "@@iterator";
+  }
+  throw new TypeError("Object is not async iterable");
+}
+function AsyncFromSyncIterator(r) {
+  function AsyncFromSyncIteratorContinuation(r) {
+    if (Object(r) !== r) return Promise.reject(new TypeError(r + " is not an object."));
+    var n = r.done;
+    return Promise.resolve(r.value).then(function (r) {
+      return {
+        value: r,
+        done: n
+      };
+    });
+  }
+  return AsyncFromSyncIterator = function AsyncFromSyncIterator(r) {
+    this.s = r, this.n = r.next;
+  }, AsyncFromSyncIterator.prototype = {
+    s: null,
+    n: null,
+    next: function next() {
+      return AsyncFromSyncIteratorContinuation(this.n.apply(this.s, arguments));
+    },
+    "return": function _return(r) {
+      var n = this.s["return"];
+      return void 0 === n ? Promise.resolve({
+        value: r,
+        done: !0
+      }) : AsyncFromSyncIteratorContinuation(n.apply(this.s, arguments));
+    },
+    "throw": function _throw(r) {
+      var n = this.s["return"];
+      return void 0 === n ? Promise.reject(r) : AsyncFromSyncIteratorContinuation(n.apply(this.s, arguments));
+    }
+  }, new AsyncFromSyncIterator(r);
+}
+module.exports = _asyncIterator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/asyncToGenerator.js b/node_modules/@babel/runtime/helpers/asyncToGenerator.js
new file mode 100644
index 0000000..a080339
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/asyncToGenerator.js
@@ -0,0 +1,26 @@
+function asyncGeneratorStep(n, t, e, r, o, a, c) {
+  try {
+    var i = n[a](c),
+      u = i.value;
+  } catch (n) {
+    return void e(n);
+  }
+  i.done ? t(u) : Promise.resolve(u).then(r, o);
+}
+function _asyncToGenerator(n) {
+  return function () {
+    var t = this,
+      e = arguments;
+    return new Promise(function (r, o) {
+      var a = n.apply(t, e);
+      function _next(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "next", n);
+      }
+      function _throw(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "throw", n);
+      }
+      _next(void 0);
+    });
+  };
+}
+module.exports = _asyncToGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js b/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js
new file mode 100644
index 0000000..2d6fab9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/awaitAsyncGenerator.js
@@ -0,0 +1,5 @@
+var OverloadYield = require("./OverloadYield.js");
+function _awaitAsyncGenerator(e) {
+  return new OverloadYield(e, 0);
+}
+module.exports = _awaitAsyncGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/callSuper.js b/node_modules/@babel/runtime/helpers/callSuper.js
new file mode 100644
index 0000000..38eaf7f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/callSuper.js
@@ -0,0 +1,7 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+var isNativeReflectConstruct = require("./isNativeReflectConstruct.js");
+var possibleConstructorReturn = require("./possibleConstructorReturn.js");
+function _callSuper(t, o, e) {
+  return o = getPrototypeOf(o), possibleConstructorReturn(t, isNativeReflectConstruct() ? Reflect.construct(o, e || [], getPrototypeOf(t).constructor) : o.apply(t, e));
+}
+module.exports = _callSuper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/checkInRHS.js b/node_modules/@babel/runtime/helpers/checkInRHS.js
new file mode 100644
index 0000000..4eea13d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/checkInRHS.js
@@ -0,0 +1,6 @@
+var _typeof = require("./typeof.js")["default"];
+function _checkInRHS(e) {
+  if (Object(e) !== e) throw TypeError("right-hand side of 'in' should be an object, got " + (null !== e ? _typeof(e) : "null"));
+  return e;
+}
+module.exports = _checkInRHS, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js b/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js
new file mode 100644
index 0000000..33ad54c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/checkPrivateRedeclaration.js
@@ -0,0 +1,4 @@
+function _checkPrivateRedeclaration(e, t) {
+  if (t.has(e)) throw new TypeError("Cannot initialize the same private elements twice on an object");
+}
+module.exports = _checkPrivateRedeclaration, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js
new file mode 100644
index 0000000..9998b83
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorDestructureSet.js
@@ -0,0 +1,10 @@
+function _classApplyDescriptorDestructureSet(e, t) {
+  if (t.set) return "__destrObj" in t || (t.__destrObj = {
+    set value(r) {
+      t.set.call(e, r);
+    }
+  }), t.__destrObj;
+  if (!t.writable) throw new TypeError("attempted to set read only private field");
+  return t;
+}
+module.exports = _classApplyDescriptorDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js
new file mode 100644
index 0000000..ab62724
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorGet.js
@@ -0,0 +1,4 @@
+function _classApplyDescriptorGet(e, t) {
+  return t.get ? t.get.call(e) : t.value;
+}
+module.exports = _classApplyDescriptorGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js b/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js
new file mode 100644
index 0000000..0975f95
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classApplyDescriptorSet.js
@@ -0,0 +1,7 @@
+function _classApplyDescriptorSet(e, t, l) {
+  if (t.set) t.set.call(e, l);else {
+    if (!t.writable) throw new TypeError("attempted to set read only private field");
+    t.value = l;
+  }
+}
+module.exports = _classApplyDescriptorSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCallCheck.js b/node_modules/@babel/runtime/helpers/classCallCheck.js
new file mode 100644
index 0000000..21b8390
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCallCheck.js
@@ -0,0 +1,4 @@
+function _classCallCheck(a, n) {
+  if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
+}
+module.exports = _classCallCheck, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js
new file mode 100644
index 0000000..7520f74
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticAccess.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classCheckPrivateStaticAccess(s, a, r) {
+  return assertClassBrand(a, s, r);
+}
+module.exports = _classCheckPrivateStaticAccess, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js
new file mode 100644
index 0000000..7f70395
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classCheckPrivateStaticFieldDescriptor.js
@@ -0,0 +1,4 @@
+function _classCheckPrivateStaticFieldDescriptor(t, e) {
+  if (void 0 === t) throw new TypeError("attempted to " + e + " private static field before its declaration");
+}
+module.exports = _classCheckPrivateStaticFieldDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js b/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js
new file mode 100644
index 0000000..be855be
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classExtractFieldDescriptor.js
@@ -0,0 +1,5 @@
+var classPrivateFieldGet2 = require("./classPrivateFieldGet2.js");
+function _classExtractFieldDescriptor(e, t) {
+  return classPrivateFieldGet2(t, e);
+}
+module.exports = _classExtractFieldDescriptor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classNameTDZError.js b/node_modules/@babel/runtime/helpers/classNameTDZError.js
new file mode 100644
index 0000000..8141ff8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classNameTDZError.js
@@ -0,0 +1,4 @@
+function _classNameTDZError(e) {
+  throw new ReferenceError('Class "' + e + '" cannot be referenced in computed property keys.');
+}
+module.exports = _classNameTDZError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..97c764d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldDestructureSet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorDestructureSet = require("./classApplyDescriptorDestructureSet.js");
+var classPrivateFieldGet2 = require("./classPrivateFieldGet2.js");
+function _classPrivateFieldDestructureSet(e, t) {
+  var r = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorDestructureSet(e, r);
+}
+module.exports = _classPrivateFieldDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js
new file mode 100644
index 0000000..bbee142
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldGet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorGet = require("./classApplyDescriptorGet.js");
+var classPrivateFieldGet2 = require("./classPrivateFieldGet2.js");
+function _classPrivateFieldGet(e, t) {
+  var r = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorGet(e, r);
+}
+module.exports = _classPrivateFieldGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldGet2.js b/node_modules/@babel/runtime/helpers/classPrivateFieldGet2.js
new file mode 100644
index 0000000..d4c271c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldGet2.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classPrivateFieldGet2(s, a) {
+  return s.get(assertClassBrand(s, a));
+}
+module.exports = _classPrivateFieldGet2, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js b/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js
new file mode 100644
index 0000000..a290c19
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldInitSpec.js
@@ -0,0 +1,5 @@
+var checkPrivateRedeclaration = require("./checkPrivateRedeclaration.js");
+function _classPrivateFieldInitSpec(e, t, a) {
+  checkPrivateRedeclaration(e, t), t.set(e, a);
+}
+module.exports = _classPrivateFieldInitSpec, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js
new file mode 100644
index 0000000..f9e46f2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseBase.js
@@ -0,0 +1,5 @@
+function _classPrivateFieldBase(e, t) {
+  if (!{}.hasOwnProperty.call(e, t)) throw new TypeError("attempted to use private field on non-instance");
+  return e;
+}
+module.exports = _classPrivateFieldBase, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js
new file mode 100644
index 0000000..5dc687f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldLooseKey.js
@@ -0,0 +1,5 @@
+var id = 0;
+function _classPrivateFieldKey(e) {
+  return "__private_" + id++ + "_" + e;
+}
+module.exports = _classPrivateFieldKey, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js b/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js
new file mode 100644
index 0000000..f3746e7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldSet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorSet = require("./classApplyDescriptorSet.js");
+var classPrivateFieldGet2 = require("./classPrivateFieldGet2.js");
+function _classPrivateFieldSet(e, t, r) {
+  var s = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorSet(e, s, r), r;
+}
+module.exports = _classPrivateFieldSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateFieldSet2.js b/node_modules/@babel/runtime/helpers/classPrivateFieldSet2.js
new file mode 100644
index 0000000..25c60ca
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateFieldSet2.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classPrivateFieldSet2(s, a, r) {
+  return s.set(assertClassBrand(s, a), r), r;
+}
+module.exports = _classPrivateFieldSet2, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateGetter.js b/node_modules/@babel/runtime/helpers/classPrivateGetter.js
new file mode 100644
index 0000000..1b3cf30
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateGetter.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classPrivateGetter(s, r, a) {
+  return a(assertClassBrand(s, r));
+}
+module.exports = _classPrivateGetter, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js
new file mode 100644
index 0000000..e4af387
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodGet.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classPrivateMethodGet(s, a, r) {
+  return assertClassBrand(a, s), r;
+}
+module.exports = _classPrivateMethodGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js b/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js
new file mode 100644
index 0000000..821c8ed
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodInitSpec.js
@@ -0,0 +1,5 @@
+var checkPrivateRedeclaration = require("./checkPrivateRedeclaration.js");
+function _classPrivateMethodInitSpec(e, a) {
+  checkPrivateRedeclaration(e, a), a.add(e);
+}
+module.exports = _classPrivateMethodInitSpec, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js
new file mode 100644
index 0000000..a44fd78
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateMethodSet.js
@@ -0,0 +1,4 @@
+function _classPrivateMethodSet() {
+  throw new TypeError("attempted to reassign private method");
+}
+module.exports = _classPrivateMethodSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classPrivateSetter.js b/node_modules/@babel/runtime/helpers/classPrivateSetter.js
new file mode 100644
index 0000000..494f81f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classPrivateSetter.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classPrivateSetter(s, r, a, t) {
+  return r(assertClassBrand(s, a), t), t;
+}
+module.exports = _classPrivateSetter, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..2bb6e8b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldDestructureSet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorDestructureSet = require("./classApplyDescriptorDestructureSet.js");
+var assertClassBrand = require("./assertClassBrand.js");
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+function _classStaticPrivateFieldDestructureSet(t, r, s) {
+  return assertClassBrand(r, t), classCheckPrivateStaticFieldDescriptor(s, "set"), classApplyDescriptorDestructureSet(t, s);
+}
+module.exports = _classStaticPrivateFieldDestructureSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js
new file mode 100644
index 0000000..eb2365f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecGet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorGet = require("./classApplyDescriptorGet.js");
+var assertClassBrand = require("./assertClassBrand.js");
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+function _classStaticPrivateFieldSpecGet(t, s, r) {
+  return assertClassBrand(s, t), classCheckPrivateStaticFieldDescriptor(r, "get"), classApplyDescriptorGet(t, r);
+}
+module.exports = _classStaticPrivateFieldSpecGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js
new file mode 100644
index 0000000..7783cd8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateFieldSpecSet.js
@@ -0,0 +1,7 @@
+var classApplyDescriptorSet = require("./classApplyDescriptorSet.js");
+var assertClassBrand = require("./assertClassBrand.js");
+var classCheckPrivateStaticFieldDescriptor = require("./classCheckPrivateStaticFieldDescriptor.js");
+function _classStaticPrivateFieldSpecSet(s, t, r, e) {
+  return assertClassBrand(t, s), classCheckPrivateStaticFieldDescriptor(r, "set"), classApplyDescriptorSet(s, r, e), e;
+}
+module.exports = _classStaticPrivateFieldSpecSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js
new file mode 100644
index 0000000..c895be5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodGet.js
@@ -0,0 +1,5 @@
+var assertClassBrand = require("./assertClassBrand.js");
+function _classStaticPrivateMethodGet(s, a, t) {
+  return assertClassBrand(a, s), t;
+}
+module.exports = _classStaticPrivateMethodGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js
new file mode 100644
index 0000000..72560e6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/classStaticPrivateMethodSet.js
@@ -0,0 +1,4 @@
+function _classStaticPrivateMethodSet() {
+  throw new TypeError("attempted to set read only static private field");
+}
+module.exports = _classStaticPrivateMethodSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/construct.js b/node_modules/@babel/runtime/helpers/construct.js
new file mode 100644
index 0000000..aee8e70
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/construct.js
@@ -0,0 +1,10 @@
+var isNativeReflectConstruct = require("./isNativeReflectConstruct.js");
+var setPrototypeOf = require("./setPrototypeOf.js");
+function _construct(t, e, r) {
+  if (isNativeReflectConstruct()) return Reflect.construct.apply(null, arguments);
+  var o = [null];
+  o.push.apply(o, e);
+  var p = new (t.bind.apply(t, o))();
+  return r && setPrototypeOf(p, r.prototype), p;
+}
+module.exports = _construct, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createClass.js b/node_modules/@babel/runtime/helpers/createClass.js
new file mode 100644
index 0000000..8757f9e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createClass.js
@@ -0,0 +1,13 @@
+var toPropertyKey = require("./toPropertyKey.js");
+function _defineProperties(e, r) {
+  for (var t = 0; t < r.length; t++) {
+    var o = r[t];
+    o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, toPropertyKey(o.key), o);
+  }
+}
+function _createClass(e, r, t) {
+  return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), e;
+}
+module.exports = _createClass, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js b/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js
new file mode 100644
index 0000000..2778307
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createForOfIteratorHelper.js
@@ -0,0 +1,50 @@
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+function _createForOfIteratorHelper(r, e) {
+  var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (!t) {
+    if (Array.isArray(r) || (t = unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) {
+      t && (r = t);
+      var _n = 0,
+        F = function F() {};
+      return {
+        s: F,
+        n: function n() {
+          return _n >= r.length ? {
+            done: !0
+          } : {
+            done: !1,
+            value: r[_n++]
+          };
+        },
+        e: function e(r) {
+          throw r;
+        },
+        f: F
+      };
+    }
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+  var o,
+    a = !0,
+    u = !1;
+  return {
+    s: function s() {
+      t = t.call(r);
+    },
+    n: function n() {
+      var r = t.next();
+      return a = r.done, r;
+    },
+    e: function e(r) {
+      u = !0, o = r;
+    },
+    f: function f() {
+      try {
+        a || null == t["return"] || t["return"]();
+      } finally {
+        if (u) throw o;
+      }
+    }
+  };
+}
+module.exports = _createForOfIteratorHelper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js b/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js
new file mode 100644
index 0000000..bc81b1c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createForOfIteratorHelperLoose.js
@@ -0,0 +1,19 @@
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+function _createForOfIteratorHelperLoose(r, e) {
+  var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (t) return (t = t.call(r)).next.bind(t);
+  if (Array.isArray(r) || (t = unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) {
+    t && (r = t);
+    var o = 0;
+    return function () {
+      return o >= r.length ? {
+        done: !0
+      } : {
+        done: !1,
+        value: r[o++]
+      };
+    };
+  }
+  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+module.exports = _createForOfIteratorHelperLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/createSuper.js b/node_modules/@babel/runtime/helpers/createSuper.js
new file mode 100644
index 0000000..b1869e6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/createSuper.js
@@ -0,0 +1,16 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+var isNativeReflectConstruct = require("./isNativeReflectConstruct.js");
+var possibleConstructorReturn = require("./possibleConstructorReturn.js");
+function _createSuper(t) {
+  var r = isNativeReflectConstruct();
+  return function () {
+    var e,
+      o = getPrototypeOf(t);
+    if (r) {
+      var s = getPrototypeOf(this).constructor;
+      e = Reflect.construct(o, arguments, s);
+    } else e = o.apply(this, arguments);
+    return possibleConstructorReturn(this, e);
+  };
+}
+module.exports = _createSuper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/decorate.js b/node_modules/@babel/runtime/helpers/decorate.js
new file mode 100644
index 0000000..bc22acf
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/decorate.js
@@ -0,0 +1,250 @@
+var toArray = require("./toArray.js");
+var toPropertyKey = require("./toPropertyKey.js");
+function _decorate(e, r, t, i) {
+  var o = _getDecoratorsApi();
+  if (i) for (var n = 0; n < i.length; n++) o = i[n](o);
+  var s = r(function (e) {
+      o.initializeInstanceElements(e, a.elements);
+    }, t),
+    a = o.decorateClass(_coalesceClassElements(s.d.map(_createElementDescriptor)), e);
+  return o.initializeClassElements(s.F, a.elements), o.runClassFinishers(s.F, a.finishers);
+}
+function _getDecoratorsApi() {
+  _getDecoratorsApi = function _getDecoratorsApi() {
+    return e;
+  };
+  var e = {
+    elementsDefinitionOrder: [["method"], ["field"]],
+    initializeInstanceElements: function initializeInstanceElements(e, r) {
+      ["method", "field"].forEach(function (t) {
+        r.forEach(function (r) {
+          r.kind === t && "own" === r.placement && this.defineClassElement(e, r);
+        }, this);
+      }, this);
+    },
+    initializeClassElements: function initializeClassElements(e, r) {
+      var t = e.prototype;
+      ["method", "field"].forEach(function (i) {
+        r.forEach(function (r) {
+          var o = r.placement;
+          if (r.kind === i && ("static" === o || "prototype" === o)) {
+            var n = "static" === o ? e : t;
+            this.defineClassElement(n, r);
+          }
+        }, this);
+      }, this);
+    },
+    defineClassElement: function defineClassElement(e, r) {
+      var t = r.descriptor;
+      if ("field" === r.kind) {
+        var i = r.initializer;
+        t = {
+          enumerable: t.enumerable,
+          writable: t.writable,
+          configurable: t.configurable,
+          value: void 0 === i ? void 0 : i.call(e)
+        };
+      }
+      Object.defineProperty(e, r.key, t);
+    },
+    decorateClass: function decorateClass(e, r) {
+      var t = [],
+        i = [],
+        o = {
+          "static": [],
+          prototype: [],
+          own: []
+        };
+      if (e.forEach(function (e) {
+        this.addElementPlacement(e, o);
+      }, this), e.forEach(function (e) {
+        if (!_hasDecorators(e)) return t.push(e);
+        var r = this.decorateElement(e, o);
+        t.push(r.element), t.push.apply(t, r.extras), i.push.apply(i, r.finishers);
+      }, this), !r) return {
+        elements: t,
+        finishers: i
+      };
+      var n = this.decorateConstructor(t, r);
+      return i.push.apply(i, n.finishers), n.finishers = i, n;
+    },
+    addElementPlacement: function addElementPlacement(e, r, t) {
+      var i = r[e.placement];
+      if (!t && -1 !== i.indexOf(e.key)) throw new TypeError("Duplicated element (" + e.key + ")");
+      i.push(e.key);
+    },
+    decorateElement: function decorateElement(e, r) {
+      for (var t = [], i = [], o = e.decorators, n = o.length - 1; n >= 0; n--) {
+        var s = r[e.placement];
+        s.splice(s.indexOf(e.key), 1);
+        var a = this.fromElementDescriptor(e),
+          l = this.toElementFinisherExtras((0, o[n])(a) || a);
+        e = l.element, this.addElementPlacement(e, r), l.finisher && i.push(l.finisher);
+        var c = l.extras;
+        if (c) {
+          for (var p = 0; p < c.length; p++) this.addElementPlacement(c[p], r);
+          t.push.apply(t, c);
+        }
+      }
+      return {
+        element: e,
+        finishers: i,
+        extras: t
+      };
+    },
+    decorateConstructor: function decorateConstructor(e, r) {
+      for (var t = [], i = r.length - 1; i >= 0; i--) {
+        var o = this.fromClassDescriptor(e),
+          n = this.toClassDescriptor((0, r[i])(o) || o);
+        if (void 0 !== n.finisher && t.push(n.finisher), void 0 !== n.elements) {
+          e = n.elements;
+          for (var s = 0; s < e.length - 1; s++) for (var a = s + 1; a < e.length; a++) if (e[s].key === e[a].key && e[s].placement === e[a].placement) throw new TypeError("Duplicated element (" + e[s].key + ")");
+        }
+      }
+      return {
+        elements: e,
+        finishers: t
+      };
+    },
+    fromElementDescriptor: function fromElementDescriptor(e) {
+      var r = {
+        kind: e.kind,
+        key: e.key,
+        placement: e.placement,
+        descriptor: e.descriptor
+      };
+      return Object.defineProperty(r, Symbol.toStringTag, {
+        value: "Descriptor",
+        configurable: !0
+      }), "field" === e.kind && (r.initializer = e.initializer), r;
+    },
+    toElementDescriptors: function toElementDescriptors(e) {
+      if (void 0 !== e) return toArray(e).map(function (e) {
+        var r = this.toElementDescriptor(e);
+        return this.disallowProperty(e, "finisher", "An element descriptor"), this.disallowProperty(e, "extras", "An element descriptor"), r;
+      }, this);
+    },
+    toElementDescriptor: function toElementDescriptor(e) {
+      var r = e.kind + "";
+      if ("method" !== r && "field" !== r) throw new TypeError('An element descriptor\'s .kind property must be either "method" or "field", but a decorator created an element descriptor with .kind "' + r + '"');
+      var t = toPropertyKey(e.key),
+        i = e.placement + "";
+      if ("static" !== i && "prototype" !== i && "own" !== i) throw new TypeError('An element descriptor\'s .placement property must be one of "static", "prototype" or "own", but a decorator created an element descriptor with .placement "' + i + '"');
+      var o = e.descriptor;
+      this.disallowProperty(e, "elements", "An element descriptor");
+      var n = {
+        kind: r,
+        key: t,
+        placement: i,
+        descriptor: Object.assign({}, o)
+      };
+      return "field" !== r ? this.disallowProperty(e, "initializer", "A method descriptor") : (this.disallowProperty(o, "get", "The property descriptor of a field descriptor"), this.disallowProperty(o, "set", "The property descriptor of a field descriptor"), this.disallowProperty(o, "value", "The property descriptor of a field descriptor"), n.initializer = e.initializer), n;
+    },
+    toElementFinisherExtras: function toElementFinisherExtras(e) {
+      return {
+        element: this.toElementDescriptor(e),
+        finisher: _optionalCallableProperty(e, "finisher"),
+        extras: this.toElementDescriptors(e.extras)
+      };
+    },
+    fromClassDescriptor: function fromClassDescriptor(e) {
+      var r = {
+        kind: "class",
+        elements: e.map(this.fromElementDescriptor, this)
+      };
+      return Object.defineProperty(r, Symbol.toStringTag, {
+        value: "Descriptor",
+        configurable: !0
+      }), r;
+    },
+    toClassDescriptor: function toClassDescriptor(e) {
+      var r = e.kind + "";
+      if ("class" !== r) throw new TypeError('A class descriptor\'s .kind property must be "class", but a decorator created a class descriptor with .kind "' + r + '"');
+      this.disallowProperty(e, "key", "A class descriptor"), this.disallowProperty(e, "placement", "A class descriptor"), this.disallowProperty(e, "descriptor", "A class descriptor"), this.disallowProperty(e, "initializer", "A class descriptor"), this.disallowProperty(e, "extras", "A class descriptor");
+      var t = _optionalCallableProperty(e, "finisher");
+      return {
+        elements: this.toElementDescriptors(e.elements),
+        finisher: t
+      };
+    },
+    runClassFinishers: function runClassFinishers(e, r) {
+      for (var t = 0; t < r.length; t++) {
+        var i = (0, r[t])(e);
+        if (void 0 !== i) {
+          if ("function" != typeof i) throw new TypeError("Finishers must return a constructor.");
+          e = i;
+        }
+      }
+      return e;
+    },
+    disallowProperty: function disallowProperty(e, r, t) {
+      if (void 0 !== e[r]) throw new TypeError(t + " can't have a ." + r + " property.");
+    }
+  };
+  return e;
+}
+function _createElementDescriptor(e) {
+  var r,
+    t = toPropertyKey(e.key);
+  "method" === e.kind ? r = {
+    value: e.value,
+    writable: !0,
+    configurable: !0,
+    enumerable: !1
+  } : "get" === e.kind ? r = {
+    get: e.value,
+    configurable: !0,
+    enumerable: !1
+  } : "set" === e.kind ? r = {
+    set: e.value,
+    configurable: !0,
+    enumerable: !1
+  } : "field" === e.kind && (r = {
+    configurable: !0,
+    writable: !0,
+    enumerable: !0
+  });
+  var i = {
+    kind: "field" === e.kind ? "field" : "method",
+    key: t,
+    placement: e["static"] ? "static" : "field" === e.kind ? "own" : "prototype",
+    descriptor: r
+  };
+  return e.decorators && (i.decorators = e.decorators), "field" === e.kind && (i.initializer = e.value), i;
+}
+function _coalesceGetterSetter(e, r) {
+  void 0 !== e.descriptor.get ? r.descriptor.get = e.descriptor.get : r.descriptor.set = e.descriptor.set;
+}
+function _coalesceClassElements(e) {
+  for (var r = [], isSameElement = function isSameElement(e) {
+      return "method" === e.kind && e.key === o.key && e.placement === o.placement;
+    }, t = 0; t < e.length; t++) {
+    var i,
+      o = e[t];
+    if ("method" === o.kind && (i = r.find(isSameElement))) {
+      if (_isDataDescriptor(o.descriptor) || _isDataDescriptor(i.descriptor)) {
+        if (_hasDecorators(o) || _hasDecorators(i)) throw new ReferenceError("Duplicated methods (" + o.key + ") can't be decorated.");
+        i.descriptor = o.descriptor;
+      } else {
+        if (_hasDecorators(o)) {
+          if (_hasDecorators(i)) throw new ReferenceError("Decorators can't be placed on different accessors with for the same property (" + o.key + ").");
+          i.decorators = o.decorators;
+        }
+        _coalesceGetterSetter(o, i);
+      }
+    } else r.push(o);
+  }
+  return r;
+}
+function _hasDecorators(e) {
+  return e.decorators && e.decorators.length;
+}
+function _isDataDescriptor(e) {
+  return void 0 !== e && !(void 0 === e.value && void 0 === e.writable);
+}
+function _optionalCallableProperty(e, r) {
+  var t = e[r];
+  if (void 0 !== t && "function" != typeof t) throw new TypeError("Expected '" + r + "' to be a function");
+  return t;
+}
+module.exports = _decorate, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defaults.js b/node_modules/@babel/runtime/helpers/defaults.js
new file mode 100644
index 0000000..dfdbbb0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defaults.js
@@ -0,0 +1,9 @@
+function _defaults(e, r) {
+  for (var t = Object.getOwnPropertyNames(r), o = 0; o < t.length; o++) {
+    var n = t[o],
+      a = Object.getOwnPropertyDescriptor(r, n);
+    a && a.configurable && void 0 === e[n] && Object.defineProperty(e, n, a);
+  }
+  return e;
+}
+module.exports = _defaults, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defineAccessor.js b/node_modules/@babel/runtime/helpers/defineAccessor.js
new file mode 100644
index 0000000..dc065f0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defineAccessor.js
@@ -0,0 +1,8 @@
+function _defineAccessor(e, r, n, t) {
+  var c = {
+    configurable: !0,
+    enumerable: !0
+  };
+  return c[e] = t, Object.defineProperty(r, n, c);
+}
+module.exports = _defineAccessor, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js b/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js
new file mode 100644
index 0000000..ab9f43c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defineEnumerableProperties.js
@@ -0,0 +1,12 @@
+function _defineEnumerableProperties(e, r) {
+  for (var t in r) {
+    var n = r[t];
+    n.configurable = n.enumerable = !0, "value" in n && (n.writable = !0), Object.defineProperty(e, t, n);
+  }
+  if (Object.getOwnPropertySymbols) for (var a = Object.getOwnPropertySymbols(r), b = 0; b < a.length; b++) {
+    var i = a[b];
+    (n = r[i]).configurable = n.enumerable = !0, "value" in n && (n.writable = !0), Object.defineProperty(e, i, n);
+  }
+  return e;
+}
+module.exports = _defineEnumerableProperties, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/defineProperty.js b/node_modules/@babel/runtime/helpers/defineProperty.js
new file mode 100644
index 0000000..2c2ff1e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/defineProperty.js
@@ -0,0 +1,10 @@
+var toPropertyKey = require("./toPropertyKey.js");
+function _defineProperty(e, r, t) {
+  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : e[r] = t, e;
+}
+module.exports = _defineProperty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/dispose.js b/node_modules/@babel/runtime/helpers/dispose.js
new file mode 100644
index 0000000..c20193c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/dispose.js
@@ -0,0 +1,28 @@
+function dispose_SuppressedError(r, e) {
+  return "undefined" != typeof SuppressedError ? dispose_SuppressedError = SuppressedError : (dispose_SuppressedError = function dispose_SuppressedError(r, e) {
+    this.suppressed = e, this.error = r, this.stack = Error().stack;
+  }, dispose_SuppressedError.prototype = Object.create(Error.prototype, {
+    constructor: {
+      value: dispose_SuppressedError,
+      writable: !0,
+      configurable: !0
+    }
+  })), new dispose_SuppressedError(r, e);
+}
+function _dispose(r, e, s) {
+  function next() {
+    for (; r.length > 0;) try {
+      var o = r.pop(),
+        p = o.d.call(o.v);
+      if (o.a) return Promise.resolve(p).then(next, err);
+    } catch (r) {
+      return err(r);
+    }
+    if (s) throw e;
+  }
+  function err(r) {
+    return e = s ? new dispose_SuppressedError(e, r) : r, s = !0, next();
+  }
+  return next();
+}
+module.exports = _dispose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/AwaitValue.js b/node_modules/@babel/runtime/helpers/esm/AwaitValue.js
new file mode 100644
index 0000000..6f210c9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/AwaitValue.js
@@ -0,0 +1,4 @@
+function _AwaitValue(t) {
+  this.wrapped = t;
+}
+export { _AwaitValue as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/OverloadYield.js b/node_modules/@babel/runtime/helpers/esm/OverloadYield.js
new file mode 100644
index 0000000..d7753a6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/OverloadYield.js
@@ -0,0 +1,4 @@
+function _OverloadYield(e, d) {
+  this.v = e, this.k = d;
+}
+export { _OverloadYield as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js b/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js
new file mode 100644
index 0000000..0f33483
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecoratedDescriptor.js
@@ -0,0 +1,9 @@
+function _applyDecoratedDescriptor(i, e, r, n, l) {
+  var a = {};
+  return Object.keys(n).forEach(function (i) {
+    a[i] = n[i];
+  }), a.enumerable = !!a.enumerable, a.configurable = !!a.configurable, ("value" in a || a.initializer) && (a.writable = !0), a = r.slice().reverse().reduce(function (r, n) {
+    return n(i, e, r) || r;
+  }, a), l && void 0 !== a.initializer && (a.value = a.initializer ? a.initializer.call(l) : void 0, a.initializer = void 0), void 0 === a.initializer ? (Object.defineProperty(i, e, a), null) : a;
+}
+export { _applyDecoratedDescriptor as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs.js b/node_modules/@babel/runtime/helpers/esm/applyDecs.js
new file mode 100644
index 0000000..2b75dfd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs.js
@@ -0,0 +1,236 @@
+import _typeof from "./typeof.js";
+import setFunctionName from "./setFunctionName.js";
+import toPropertyKey from "./toPropertyKey.js";
+function old_createMetadataMethodsForProperty(e, t, a, r) {
+  return {
+    getMetadata: function getMetadata(o) {
+      old_assertNotFinished(r, "getMetadata"), old_assertMetadataKey(o);
+      var i = e[o];
+      if (void 0 !== i) if (1 === t) {
+        var n = i["public"];
+        if (void 0 !== n) return n[a];
+      } else if (2 === t) {
+        var l = i["private"];
+        if (void 0 !== l) return l.get(a);
+      } else if (Object.hasOwnProperty.call(i, "constructor")) return i.constructor;
+    },
+    setMetadata: function setMetadata(o, i) {
+      old_assertNotFinished(r, "setMetadata"), old_assertMetadataKey(o);
+      var n = e[o];
+      if (void 0 === n && (n = e[o] = {}), 1 === t) {
+        var l = n["public"];
+        void 0 === l && (l = n["public"] = {}), l[a] = i;
+      } else if (2 === t) {
+        var s = n.priv;
+        void 0 === s && (s = n["private"] = new Map()), s.set(a, i);
+      } else n.constructor = i;
+    }
+  };
+}
+function old_convertMetadataMapToFinal(e, t) {
+  var a = e[Symbol.metadata || Symbol["for"]("Symbol.metadata")],
+    r = Object.getOwnPropertySymbols(t);
+  if (0 !== r.length) {
+    for (var o = 0; o < r.length; o++) {
+      var i = r[o],
+        n = t[i],
+        l = a ? a[i] : null,
+        s = n["public"],
+        c = l ? l["public"] : null;
+      s && c && Object.setPrototypeOf(s, c);
+      var d = n["private"];
+      if (d) {
+        var u = Array.from(d.values()),
+          f = l ? l["private"] : null;
+        f && (u = u.concat(f)), n["private"] = u;
+      }
+      l && Object.setPrototypeOf(n, l);
+    }
+    a && Object.setPrototypeOf(t, a), e[Symbol.metadata || Symbol["for"]("Symbol.metadata")] = t;
+  }
+}
+function old_createAddInitializerMethod(e, t) {
+  return function (a) {
+    old_assertNotFinished(t, "addInitializer"), old_assertCallable(a, "An initializer"), e.push(a);
+  };
+}
+function old_memberDec(e, t, a, r, o, i, n, l, s) {
+  var c;
+  switch (i) {
+    case 1:
+      c = "accessor";
+      break;
+    case 2:
+      c = "method";
+      break;
+    case 3:
+      c = "getter";
+      break;
+    case 4:
+      c = "setter";
+      break;
+    default:
+      c = "field";
+  }
+  var d,
+    u,
+    f = {
+      kind: c,
+      name: l ? "#" + t : toPropertyKey(t),
+      isStatic: n,
+      isPrivate: l
+    },
+    p = {
+      v: !1
+    };
+  if (0 !== i && (f.addInitializer = old_createAddInitializerMethod(o, p)), l) {
+    d = 2, u = Symbol(t);
+    var v = {};
+    0 === i ? (v.get = a.get, v.set = a.set) : 2 === i ? v.get = function () {
+      return a.value;
+    } : (1 !== i && 3 !== i || (v.get = function () {
+      return a.get.call(this);
+    }), 1 !== i && 4 !== i || (v.set = function (e) {
+      a.set.call(this, e);
+    })), f.access = v;
+  } else d = 1, u = t;
+  try {
+    return e(s, Object.assign(f, old_createMetadataMethodsForProperty(r, d, u, p)));
+  } finally {
+    p.v = !0;
+  }
+}
+function old_assertNotFinished(e, t) {
+  if (e.v) throw Error("attempted to call " + t + " after decoration was finished");
+}
+function old_assertMetadataKey(e) {
+  if ("symbol" != _typeof(e)) throw new TypeError("Metadata keys must be symbols, received: " + e);
+}
+function old_assertCallable(e, t) {
+  if ("function" != typeof e) throw new TypeError(t + " must be a function");
+}
+function old_assertValidReturnValue(e, t) {
+  var a = _typeof(t);
+  if (1 === e) {
+    if ("object" !== a || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+    void 0 !== t.get && old_assertCallable(t.get, "accessor.get"), void 0 !== t.set && old_assertCallable(t.set, "accessor.set"), void 0 !== t.init && old_assertCallable(t.init, "accessor.init"), void 0 !== t.initializer && old_assertCallable(t.initializer, "accessor.initializer");
+  } else if ("function" !== a) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+}
+function old_getInit(e) {
+  var t;
+  return null == (t = e.init) && (t = e.initializer) && void 0 !== console && console.warn(".initializer has been renamed to .init as of March 2022"), t;
+}
+function old_applyMemberDec(e, t, a, r, o, i, n, l, s) {
+  var c,
+    d,
+    u,
+    f,
+    p,
+    v,
+    y,
+    h = a[0];
+  if (n ? (0 === o || 1 === o ? (c = {
+    get: a[3],
+    set: a[4]
+  }, u = "get") : 3 === o ? (c = {
+    get: a[3]
+  }, u = "get") : 4 === o ? (c = {
+    set: a[3]
+  }, u = "set") : c = {
+    value: a[3]
+  }, 0 !== o && (1 === o && setFunctionName(a[4], "#" + r, "set"), setFunctionName(a[3], "#" + r, u))) : 0 !== o && (c = Object.getOwnPropertyDescriptor(t, r)), 1 === o ? f = {
+    get: c.get,
+    set: c.set
+  } : 2 === o ? f = c.value : 3 === o ? f = c.get : 4 === o && (f = c.set), "function" == typeof h) void 0 !== (p = old_memberDec(h, r, c, l, s, o, i, n, f)) && (old_assertValidReturnValue(o, p), 0 === o ? d = p : 1 === o ? (d = old_getInit(p), v = p.get || f.get, y = p.set || f.set, f = {
+    get: v,
+    set: y
+  }) : f = p);else for (var m = h.length - 1; m >= 0; m--) {
+    var b;
+    void 0 !== (p = old_memberDec(h[m], r, c, l, s, o, i, n, f)) && (old_assertValidReturnValue(o, p), 0 === o ? b = p : 1 === o ? (b = old_getInit(p), v = p.get || f.get, y = p.set || f.set, f = {
+      get: v,
+      set: y
+    }) : f = p, void 0 !== b && (void 0 === d ? d = b : "function" == typeof d ? d = [d, b] : d.push(b)));
+  }
+  if (0 === o || 1 === o) {
+    if (void 0 === d) d = function d(e, t) {
+      return t;
+    };else if ("function" != typeof d) {
+      var g = d;
+      d = function d(e, t) {
+        for (var a = t, r = 0; r < g.length; r++) a = g[r].call(e, a);
+        return a;
+      };
+    } else {
+      var _ = d;
+      d = function d(e, t) {
+        return _.call(e, t);
+      };
+    }
+    e.push(d);
+  }
+  0 !== o && (1 === o ? (c.get = f.get, c.set = f.set) : 2 === o ? c.value = f : 3 === o ? c.get = f : 4 === o && (c.set = f), n ? 1 === o ? (e.push(function (e, t) {
+    return f.get.call(e, t);
+  }), e.push(function (e, t) {
+    return f.set.call(e, t);
+  })) : 2 === o ? e.push(f) : e.push(function (e, t) {
+    return f.call(e, t);
+  }) : Object.defineProperty(t, r, c));
+}
+function old_applyMemberDecs(e, t, a, r, o) {
+  for (var i, n, l = new Map(), s = new Map(), c = 0; c < o.length; c++) {
+    var d = o[c];
+    if (Array.isArray(d)) {
+      var u,
+        f,
+        p,
+        v = d[1],
+        y = d[2],
+        h = d.length > 3,
+        m = v >= 5;
+      if (m ? (u = t, f = r, 0 != (v -= 5) && (p = n = n || [])) : (u = t.prototype, f = a, 0 !== v && (p = i = i || [])), 0 !== v && !h) {
+        var b = m ? s : l,
+          g = b.get(y) || 0;
+        if (!0 === g || 3 === g && 4 !== v || 4 === g && 3 !== v) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + y);
+        !g && v > 2 ? b.set(y, v) : b.set(y, !0);
+      }
+      old_applyMemberDec(e, u, d, y, v, m, h, f, p);
+    }
+  }
+  old_pushInitializers(e, i), old_pushInitializers(e, n);
+}
+function old_pushInitializers(e, t) {
+  t && e.push(function (e) {
+    for (var a = 0; a < t.length; a++) t[a].call(e);
+    return e;
+  });
+}
+function old_applyClassDecs(e, t, a, r) {
+  if (r.length > 0) {
+    for (var o = [], i = t, n = t.name, l = r.length - 1; l >= 0; l--) {
+      var s = {
+        v: !1
+      };
+      try {
+        var c = Object.assign({
+            kind: "class",
+            name: n,
+            addInitializer: old_createAddInitializerMethod(o, s)
+          }, old_createMetadataMethodsForProperty(a, 0, n, s)),
+          d = r[l](i, c);
+      } finally {
+        s.v = !0;
+      }
+      void 0 !== d && (old_assertValidReturnValue(10, d), i = d);
+    }
+    e.push(i, function () {
+      for (var e = 0; e < o.length; e++) o[e].call(i);
+    });
+  }
+}
+function applyDecs(e, t, a) {
+  var r = [],
+    o = {},
+    i = {};
+  return old_applyMemberDecs(r, e, i, o, t), old_convertMetadataMapToFinal(e.prototype, i), old_applyClassDecs(r, e, o, a), old_convertMetadataMapToFinal(e, o), r;
+}
+export { applyDecs as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs2203.js b/node_modules/@babel/runtime/helpers/esm/applyDecs2203.js
new file mode 100644
index 0000000..8a9d7c5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs2203.js
@@ -0,0 +1,184 @@
+import _typeof from "./typeof.js";
+function applyDecs2203Factory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function memberDec(e, t, r, a, n, i, s, o) {
+    var c;
+    switch (n) {
+      case 1:
+        c = "accessor";
+        break;
+      case 2:
+        c = "method";
+        break;
+      case 3:
+        c = "getter";
+        break;
+      case 4:
+        c = "setter";
+        break;
+      default:
+        c = "field";
+    }
+    var l,
+      u,
+      f = {
+        kind: c,
+        name: s ? "#" + t : t,
+        "static": i,
+        "private": s
+      },
+      p = {
+        v: !1
+      };
+    0 !== n && (f.addInitializer = createAddInitializerMethod(a, p)), 0 === n ? s ? (l = r.get, u = r.set) : (l = function l() {
+      return this[t];
+    }, u = function u(e) {
+      this[t] = e;
+    }) : 2 === n ? l = function l() {
+      return r.value;
+    } : (1 !== n && 3 !== n || (l = function l() {
+      return r.get.call(this);
+    }), 1 !== n && 4 !== n || (u = function u(e) {
+      r.set.call(this, e);
+    })), f.access = l && u ? {
+      get: l,
+      set: u
+    } : l ? {
+      get: l
+    } : {
+      set: u
+    };
+    try {
+      return e(o, f);
+    } finally {
+      p.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function applyMemberDec(e, t, r, a, n, i, s, o) {
+    var c,
+      l,
+      u,
+      f,
+      p,
+      d,
+      h = r[0];
+    if (s ? c = 0 === n || 1 === n ? {
+      get: r[3],
+      set: r[4]
+    } : 3 === n ? {
+      get: r[3]
+    } : 4 === n ? {
+      set: r[3]
+    } : {
+      value: r[3]
+    } : 0 !== n && (c = Object.getOwnPropertyDescriptor(t, a)), 1 === n ? u = {
+      get: c.get,
+      set: c.set
+    } : 2 === n ? u = c.value : 3 === n ? u = c.get : 4 === n && (u = c.set), "function" == typeof h) void 0 !== (f = memberDec(h, a, c, o, n, i, s, u)) && (assertValidReturnValue(n, f), 0 === n ? l = f : 1 === n ? (l = f.init, p = f.get || u.get, d = f.set || u.set, u = {
+      get: p,
+      set: d
+    }) : u = f);else for (var v = h.length - 1; v >= 0; v--) {
+      var g;
+      void 0 !== (f = memberDec(h[v], a, c, o, n, i, s, u)) && (assertValidReturnValue(n, f), 0 === n ? g = f : 1 === n ? (g = f.init, p = f.get || u.get, d = f.set || u.set, u = {
+        get: p,
+        set: d
+      }) : u = f, void 0 !== g && (void 0 === l ? l = g : "function" == typeof l ? l = [l, g] : l.push(g)));
+    }
+    if (0 === n || 1 === n) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var y = l;
+        l = function l(e, t) {
+          for (var r = t, a = 0; a < y.length; a++) r = y[a].call(e, r);
+          return r;
+        };
+      } else {
+        var m = l;
+        l = function l(e, t) {
+          return m.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== n && (1 === n ? (c.get = u.get, c.set = u.set) : 2 === n ? c.value = u : 3 === n ? c.get = u : 4 === n && (c.set = u), s ? 1 === n ? (e.push(function (e, t) {
+      return u.get.call(e, t);
+    }), e.push(function (e, t) {
+      return u.set.call(e, t);
+    })) : 2 === n ? e.push(u) : e.push(function (e, t) {
+      return u.call(e, t);
+    }) : Object.defineProperty(t, a, c));
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r) {
+    var a = [];
+    return function (e, t, r) {
+      for (var a, n, i = new Map(), s = new Map(), o = 0; o < r.length; o++) {
+        var c = r[o];
+        if (Array.isArray(c)) {
+          var l,
+            u,
+            f = c[1],
+            p = c[2],
+            d = c.length > 3,
+            h = f >= 5;
+          if (h ? (l = t, 0 != (f -= 5) && (u = n = n || [])) : (l = t.prototype, 0 !== f && (u = a = a || [])), 0 !== f && !d) {
+            var v = h ? s : i,
+              g = v.get(p) || 0;
+            if (!0 === g || 3 === g && 4 !== f || 4 === g && 3 !== f) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + p);
+            !g && f > 2 ? v.set(p, f) : v.set(p, !0);
+          }
+          applyMemberDec(e, l, c, p, f, h, d, u);
+        }
+      }
+      pushInitializers(e, a), pushInitializers(e, n);
+    }(a, e, t), function (e, t, r) {
+      if (r.length > 0) {
+        for (var a = [], n = t, i = t.name, s = r.length - 1; s >= 0; s--) {
+          var o = {
+            v: !1
+          };
+          try {
+            var c = r[s](n, {
+              kind: "class",
+              name: i,
+              addInitializer: createAddInitializerMethod(a, o)
+            });
+          } finally {
+            o.v = !0;
+          }
+          void 0 !== c && (assertValidReturnValue(10, c), n = c);
+        }
+        e.push(n, function () {
+          for (var e = 0; e < a.length; e++) a[e].call(n);
+        });
+      }
+    }(a, e, r), a;
+  };
+}
+var applyDecs2203Impl;
+function applyDecs2203(e, t, r) {
+  return (applyDecs2203Impl = applyDecs2203Impl || applyDecs2203Factory())(e, t, r);
+}
+export { applyDecs2203 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs2203R.js b/node_modules/@babel/runtime/helpers/esm/applyDecs2203R.js
new file mode 100644
index 0000000..bccc42e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs2203R.js
@@ -0,0 +1,191 @@
+import _typeof from "./typeof.js";
+import setFunctionName from "./setFunctionName.js";
+import toPropertyKey from "./toPropertyKey.js";
+function applyDecs2203RFactory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function memberDec(e, t, r, n, a, i, o, s) {
+    var c;
+    switch (a) {
+      case 1:
+        c = "accessor";
+        break;
+      case 2:
+        c = "method";
+        break;
+      case 3:
+        c = "getter";
+        break;
+      case 4:
+        c = "setter";
+        break;
+      default:
+        c = "field";
+    }
+    var l,
+      u,
+      f = {
+        kind: c,
+        name: o ? "#" + t : toPropertyKey(t),
+        "static": i,
+        "private": o
+      },
+      p = {
+        v: !1
+      };
+    0 !== a && (f.addInitializer = createAddInitializerMethod(n, p)), 0 === a ? o ? (l = r.get, u = r.set) : (l = function l() {
+      return this[t];
+    }, u = function u(e) {
+      this[t] = e;
+    }) : 2 === a ? l = function l() {
+      return r.value;
+    } : (1 !== a && 3 !== a || (l = function l() {
+      return r.get.call(this);
+    }), 1 !== a && 4 !== a || (u = function u(e) {
+      r.set.call(this, e);
+    })), f.access = l && u ? {
+      get: l,
+      set: u
+    } : l ? {
+      get: l
+    } : {
+      set: u
+    };
+    try {
+      return e(s, f);
+    } finally {
+      p.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function applyMemberDec(e, t, r, n, a, i, o, s) {
+    var c,
+      l,
+      u,
+      f,
+      p,
+      d,
+      h,
+      v = r[0];
+    if (o ? (0 === a || 1 === a ? (c = {
+      get: r[3],
+      set: r[4]
+    }, u = "get") : 3 === a ? (c = {
+      get: r[3]
+    }, u = "get") : 4 === a ? (c = {
+      set: r[3]
+    }, u = "set") : c = {
+      value: r[3]
+    }, 0 !== a && (1 === a && setFunctionName(r[4], "#" + n, "set"), setFunctionName(r[3], "#" + n, u))) : 0 !== a && (c = Object.getOwnPropertyDescriptor(t, n)), 1 === a ? f = {
+      get: c.get,
+      set: c.set
+    } : 2 === a ? f = c.value : 3 === a ? f = c.get : 4 === a && (f = c.set), "function" == typeof v) void 0 !== (p = memberDec(v, n, c, s, a, i, o, f)) && (assertValidReturnValue(a, p), 0 === a ? l = p : 1 === a ? (l = p.init, d = p.get || f.get, h = p.set || f.set, f = {
+      get: d,
+      set: h
+    }) : f = p);else for (var g = v.length - 1; g >= 0; g--) {
+      var y;
+      void 0 !== (p = memberDec(v[g], n, c, s, a, i, o, f)) && (assertValidReturnValue(a, p), 0 === a ? y = p : 1 === a ? (y = p.init, d = p.get || f.get, h = p.set || f.set, f = {
+        get: d,
+        set: h
+      }) : f = p, void 0 !== y && (void 0 === l ? l = y : "function" == typeof l ? l = [l, y] : l.push(y)));
+    }
+    if (0 === a || 1 === a) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var m = l;
+        l = function l(e, t) {
+          for (var r = t, n = 0; n < m.length; n++) r = m[n].call(e, r);
+          return r;
+        };
+      } else {
+        var b = l;
+        l = function l(e, t) {
+          return b.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== a && (1 === a ? (c.get = f.get, c.set = f.set) : 2 === a ? c.value = f : 3 === a ? c.get = f : 4 === a && (c.set = f), o ? 1 === a ? (e.push(function (e, t) {
+      return f.get.call(e, t);
+    }), e.push(function (e, t) {
+      return f.set.call(e, t);
+    })) : 2 === a ? e.push(f) : e.push(function (e, t) {
+      return f.call(e, t);
+    }) : Object.defineProperty(t, n, c));
+  }
+  function applyMemberDecs(e, t) {
+    for (var r, n, a = [], i = new Map(), o = new Map(), s = 0; s < t.length; s++) {
+      var c = t[s];
+      if (Array.isArray(c)) {
+        var l,
+          u,
+          f = c[1],
+          p = c[2],
+          d = c.length > 3,
+          h = f >= 5;
+        if (h ? (l = e, 0 != (f -= 5) && (u = n = n || [])) : (l = e.prototype, 0 !== f && (u = r = r || [])), 0 !== f && !d) {
+          var v = h ? o : i,
+            g = v.get(p) || 0;
+          if (!0 === g || 3 === g && 4 !== f || 4 === g && 3 !== f) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + p);
+          !g && f > 2 ? v.set(p, f) : v.set(p, !0);
+        }
+        applyMemberDec(a, l, c, p, f, h, d, u);
+      }
+    }
+    return pushInitializers(a, r), pushInitializers(a, n), a;
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r) {
+    return {
+      e: applyMemberDecs(e, t),
+      get c() {
+        return function (e, t) {
+          if (t.length > 0) {
+            for (var r = [], n = e, a = e.name, i = t.length - 1; i >= 0; i--) {
+              var o = {
+                v: !1
+              };
+              try {
+                var s = t[i](n, {
+                  kind: "class",
+                  name: a,
+                  addInitializer: createAddInitializerMethod(r, o)
+                });
+              } finally {
+                o.v = !0;
+              }
+              void 0 !== s && (assertValidReturnValue(10, s), n = s);
+            }
+            return [n, function () {
+              for (var e = 0; e < r.length; e++) r[e].call(n);
+            }];
+          }
+        }(e, r);
+      }
+    };
+  };
+}
+function applyDecs2203R(e, t, r) {
+  return (applyDecs2203R = applyDecs2203RFactory())(e, t, r);
+}
+export { applyDecs2203R as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs2301.js b/node_modules/@babel/runtime/helpers/esm/applyDecs2301.js
new file mode 100644
index 0000000..8d110f7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs2301.js
@@ -0,0 +1,222 @@
+import _typeof from "./typeof.js";
+import checkInRHS from "./checkInRHS.js";
+import setFunctionName from "./setFunctionName.js";
+import toPropertyKey from "./toPropertyKey.js";
+function applyDecs2301Factory() {
+  function createAddInitializerMethod(e, t) {
+    return function (r) {
+      !function (e) {
+        if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+      }(t), assertCallable(r, "An initializer"), e.push(r);
+    };
+  }
+  function assertInstanceIfPrivate(e, t) {
+    if (!e(t)) throw new TypeError("Attempted to access private element on non-instance");
+  }
+  function memberDec(e, t, r, n, a, i, s, o, c) {
+    var u;
+    switch (a) {
+      case 1:
+        u = "accessor";
+        break;
+      case 2:
+        u = "method";
+        break;
+      case 3:
+        u = "getter";
+        break;
+      case 4:
+        u = "setter";
+        break;
+      default:
+        u = "field";
+    }
+    var l,
+      f,
+      p = {
+        kind: u,
+        name: s ? "#" + t : toPropertyKey(t),
+        "static": i,
+        "private": s
+      },
+      d = {
+        v: !1
+      };
+    if (0 !== a && (p.addInitializer = createAddInitializerMethod(n, d)), s || 0 !== a && 2 !== a) {
+      if (2 === a) l = function l(e) {
+        return assertInstanceIfPrivate(c, e), r.value;
+      };else {
+        var h = 0 === a || 1 === a;
+        (h || 3 === a) && (l = s ? function (e) {
+          return assertInstanceIfPrivate(c, e), r.get.call(e);
+        } : function (e) {
+          return r.get.call(e);
+        }), (h || 4 === a) && (f = s ? function (e, t) {
+          assertInstanceIfPrivate(c, e), r.set.call(e, t);
+        } : function (e, t) {
+          r.set.call(e, t);
+        });
+      }
+    } else l = function l(e) {
+      return e[t];
+    }, 0 === a && (f = function f(e, r) {
+      e[t] = r;
+    });
+    var v = s ? c.bind() : function (e) {
+      return t in e;
+    };
+    p.access = l && f ? {
+      get: l,
+      set: f,
+      has: v
+    } : l ? {
+      get: l,
+      has: v
+    } : {
+      set: f,
+      has: v
+    };
+    try {
+      return e(o, p);
+    } finally {
+      d.v = !0;
+    }
+  }
+  function assertCallable(e, t) {
+    if ("function" != typeof e) throw new TypeError(t + " must be a function");
+  }
+  function assertValidReturnValue(e, t) {
+    var r = _typeof(t);
+    if (1 === e) {
+      if ("object" !== r || null === t) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+      void 0 !== t.get && assertCallable(t.get, "accessor.get"), void 0 !== t.set && assertCallable(t.set, "accessor.set"), void 0 !== t.init && assertCallable(t.init, "accessor.init");
+    } else if ("function" !== r) throw new TypeError((0 === e ? "field" : 10 === e ? "class" : "method") + " decorators must return a function or void 0");
+  }
+  function curryThis2(e) {
+    return function (t) {
+      e(this, t);
+    };
+  }
+  function applyMemberDec(e, t, r, n, a, i, s, o, c) {
+    var u,
+      l,
+      f,
+      p,
+      d,
+      h,
+      v,
+      y,
+      g = r[0];
+    if (s ? (0 === a || 1 === a ? (u = {
+      get: (d = r[3], function () {
+        return d(this);
+      }),
+      set: curryThis2(r[4])
+    }, f = "get") : 3 === a ? (u = {
+      get: r[3]
+    }, f = "get") : 4 === a ? (u = {
+      set: r[3]
+    }, f = "set") : u = {
+      value: r[3]
+    }, 0 !== a && (1 === a && setFunctionName(u.set, "#" + n, "set"), setFunctionName(u[f || "value"], "#" + n, f))) : 0 !== a && (u = Object.getOwnPropertyDescriptor(t, n)), 1 === a ? p = {
+      get: u.get,
+      set: u.set
+    } : 2 === a ? p = u.value : 3 === a ? p = u.get : 4 === a && (p = u.set), "function" == typeof g) void 0 !== (h = memberDec(g, n, u, o, a, i, s, p, c)) && (assertValidReturnValue(a, h), 0 === a ? l = h : 1 === a ? (l = h.init, v = h.get || p.get, y = h.set || p.set, p = {
+      get: v,
+      set: y
+    }) : p = h);else for (var m = g.length - 1; m >= 0; m--) {
+      var b;
+      void 0 !== (h = memberDec(g[m], n, u, o, a, i, s, p, c)) && (assertValidReturnValue(a, h), 0 === a ? b = h : 1 === a ? (b = h.init, v = h.get || p.get, y = h.set || p.set, p = {
+        get: v,
+        set: y
+      }) : p = h, void 0 !== b && (void 0 === l ? l = b : "function" == typeof l ? l = [l, b] : l.push(b)));
+    }
+    if (0 === a || 1 === a) {
+      if (void 0 === l) l = function l(e, t) {
+        return t;
+      };else if ("function" != typeof l) {
+        var I = l;
+        l = function l(e, t) {
+          for (var r = t, n = 0; n < I.length; n++) r = I[n].call(e, r);
+          return r;
+        };
+      } else {
+        var w = l;
+        l = function l(e, t) {
+          return w.call(e, t);
+        };
+      }
+      e.push(l);
+    }
+    0 !== a && (1 === a ? (u.get = p.get, u.set = p.set) : 2 === a ? u.value = p : 3 === a ? u.get = p : 4 === a && (u.set = p), s ? 1 === a ? (e.push(function (e, t) {
+      return p.get.call(e, t);
+    }), e.push(function (e, t) {
+      return p.set.call(e, t);
+    })) : 2 === a ? e.push(p) : e.push(function (e, t) {
+      return p.call(e, t);
+    }) : Object.defineProperty(t, n, u));
+  }
+  function applyMemberDecs(e, t, r) {
+    for (var n, a, i, s = [], o = new Map(), c = new Map(), u = 0; u < t.length; u++) {
+      var l = t[u];
+      if (Array.isArray(l)) {
+        var f,
+          p,
+          d = l[1],
+          h = l[2],
+          v = l.length > 3,
+          y = d >= 5,
+          g = r;
+        if (y ? (f = e, 0 != (d -= 5) && (p = a = a || []), v && !i && (i = function i(t) {
+          return checkInRHS(t) === e;
+        }), g = i) : (f = e.prototype, 0 !== d && (p = n = n || [])), 0 !== d && !v) {
+          var m = y ? c : o,
+            b = m.get(h) || 0;
+          if (!0 === b || 3 === b && 4 !== d || 4 === b && 3 !== d) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + h);
+          !b && d > 2 ? m.set(h, d) : m.set(h, !0);
+        }
+        applyMemberDec(s, f, l, h, d, y, v, p, g);
+      }
+    }
+    return pushInitializers(s, n), pushInitializers(s, a), s;
+  }
+  function pushInitializers(e, t) {
+    t && e.push(function (e) {
+      for (var r = 0; r < t.length; r++) t[r].call(e);
+      return e;
+    });
+  }
+  return function (e, t, r, n) {
+    return {
+      e: applyMemberDecs(e, t, n),
+      get c() {
+        return function (e, t) {
+          if (t.length > 0) {
+            for (var r = [], n = e, a = e.name, i = t.length - 1; i >= 0; i--) {
+              var s = {
+                v: !1
+              };
+              try {
+                var o = t[i](n, {
+                  kind: "class",
+                  name: a,
+                  addInitializer: createAddInitializerMethod(r, s)
+                });
+              } finally {
+                s.v = !0;
+              }
+              void 0 !== o && (assertValidReturnValue(10, o), n = o);
+            }
+            return [n, function () {
+              for (var e = 0; e < r.length; e++) r[e].call(n);
+            }];
+          }
+        }(e, r);
+      }
+    };
+  };
+}
+function applyDecs2301(e, t, r, n) {
+  return (applyDecs2301 = applyDecs2301Factory())(e, t, r, n);
+}
+export { applyDecs2301 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs2305.js b/node_modules/@babel/runtime/helpers/esm/applyDecs2305.js
new file mode 100644
index 0000000..a11b2b9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs2305.js
@@ -0,0 +1,133 @@
+import _typeof from "./typeof.js";
+import checkInRHS from "./checkInRHS.js";
+import setFunctionName from "./setFunctionName.js";
+import toPropertyKey from "./toPropertyKey.js";
+function applyDecs2305(e, t, r, n, o, a) {
+  function i(e, t, r) {
+    return function (n, o) {
+      return r && r(n), e[t].call(n, o);
+    };
+  }
+  function c(e, t) {
+    for (var r = 0; r < e.length; r++) e[r].call(t);
+    return t;
+  }
+  function s(e, t, r, n) {
+    if ("function" != typeof e && (n || void 0 !== e)) throw new TypeError(t + " must " + (r || "be") + " a function" + (n ? "" : " or undefined"));
+    return e;
+  }
+  function applyDec(e, t, r, n, o, a, c, u, l, f, p, d, h) {
+    function m(e) {
+      if (!h(e)) throw new TypeError("Attempted to access private element on non-instance");
+    }
+    var y,
+      v = t[0],
+      g = t[3],
+      b = !u;
+    if (!b) {
+      r || Array.isArray(v) || (v = [v]);
+      var w = {},
+        S = [],
+        A = 3 === o ? "get" : 4 === o || d ? "set" : "value";
+      f ? (p || d ? w = {
+        get: setFunctionName(function () {
+          return g(this);
+        }, n, "get"),
+        set: function set(e) {
+          t[4](this, e);
+        }
+      } : w[A] = g, p || setFunctionName(w[A], n, 2 === o ? "" : A)) : p || (w = Object.getOwnPropertyDescriptor(e, n));
+    }
+    for (var P = e, j = v.length - 1; j >= 0; j -= r ? 2 : 1) {
+      var D = v[j],
+        E = r ? v[j - 1] : void 0,
+        I = {},
+        O = {
+          kind: ["field", "accessor", "method", "getter", "setter", "class"][o],
+          name: n,
+          metadata: a,
+          addInitializer: function (e, t) {
+            if (e.v) throw Error("attempted to call addInitializer after decoration was finished");
+            s(t, "An initializer", "be", !0), c.push(t);
+          }.bind(null, I)
+        };
+      try {
+        if (b) (y = s(D.call(E, P, O), "class decorators", "return")) && (P = y);else {
+          var k, F;
+          O["static"] = l, O["private"] = f, f ? 2 === o ? k = function k(e) {
+            return m(e), w.value;
+          } : (o < 4 && (k = i(w, "get", m)), 3 !== o && (F = i(w, "set", m))) : (k = function k(e) {
+            return e[n];
+          }, (o < 2 || 4 === o) && (F = function F(e, t) {
+            e[n] = t;
+          }));
+          var N = O.access = {
+            has: f ? h.bind() : function (e) {
+              return n in e;
+            }
+          };
+          if (k && (N.get = k), F && (N.set = F), P = D.call(E, d ? {
+            get: w.get,
+            set: w.set
+          } : w[A], O), d) {
+            if ("object" == _typeof(P) && P) (y = s(P.get, "accessor.get")) && (w.get = y), (y = s(P.set, "accessor.set")) && (w.set = y), (y = s(P.init, "accessor.init")) && S.push(y);else if (void 0 !== P) throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");
+          } else s(P, (p ? "field" : "method") + " decorators", "return") && (p ? S.push(P) : w[A] = P);
+        }
+      } finally {
+        I.v = !0;
+      }
+    }
+    return (p || d) && u.push(function (e, t) {
+      for (var r = S.length - 1; r >= 0; r--) t = S[r].call(e, t);
+      return t;
+    }), p || b || (f ? d ? u.push(i(w, "get"), i(w, "set")) : u.push(2 === o ? w[A] : i.call.bind(w[A])) : Object.defineProperty(e, n, w)), P;
+  }
+  function u(e, t) {
+    return Object.defineProperty(e, Symbol.metadata || Symbol["for"]("Symbol.metadata"), {
+      configurable: !0,
+      enumerable: !0,
+      value: t
+    });
+  }
+  if (arguments.length >= 6) var l = a[Symbol.metadata || Symbol["for"]("Symbol.metadata")];
+  var f = Object.create(null == l ? null : l),
+    p = function (e, t, r, n) {
+      var o,
+        a,
+        i = [],
+        s = function s(t) {
+          return checkInRHS(t) === e;
+        },
+        u = new Map();
+      function l(e) {
+        e && i.push(c.bind(null, e));
+      }
+      for (var f = 0; f < t.length; f++) {
+        var p = t[f];
+        if (Array.isArray(p)) {
+          var d = p[1],
+            h = p[2],
+            m = p.length > 3,
+            y = 16 & d,
+            v = !!(8 & d),
+            g = 0 == (d &= 7),
+            b = h + "/" + v;
+          if (!g && !m) {
+            var w = u.get(b);
+            if (!0 === w || 3 === w && 4 !== d || 4 === w && 3 !== d) throw Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: " + h);
+            u.set(b, !(d > 2) || d);
+          }
+          applyDec(v ? e : e.prototype, p, y, m ? "#" + h : toPropertyKey(h), d, n, v ? a = a || [] : o = o || [], i, v, m, g, 1 === d, v && m ? s : r);
+        }
+      }
+      return l(o), l(a), i;
+    }(e, t, o, f);
+  return r.length || u(e, f), {
+    e: p,
+    get c() {
+      var t = [];
+      return r.length && [u(applyDec(e, [r], n, e.name, 5, f, t), f), c.bind(null, t, e)];
+    }
+  };
+}
+export { applyDecs2305 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/applyDecs2311.js b/node_modules/@babel/runtime/helpers/esm/applyDecs2311.js
new file mode 100644
index 0000000..ab8c0fd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/applyDecs2311.js
@@ -0,0 +1,124 @@
+import _typeof from "./typeof.js";
+import checkInRHS from "./checkInRHS.js";
+import setFunctionName from "./setFunctionName.js";
+import toPropertyKey from "./toPropertyKey.js";
+function applyDecs2311(e, t, n, r, o, i) {
+  var a,
+    c,
+    u,
+    s,
+    f,
+    l,
+    p,
+    d = Symbol.metadata || Symbol["for"]("Symbol.metadata"),
+    m = Object.defineProperty,
+    h = Object.create,
+    y = [h(null), h(null)],
+    v = t.length;
+  function g(t, n, r) {
+    return function (o, i) {
+      n && (i = o, o = e);
+      for (var a = 0; a < t.length; a++) i = t[a].apply(o, r ? [i] : []);
+      return r ? i : o;
+    };
+  }
+  function b(e, t, n, r) {
+    if ("function" != typeof e && (r || void 0 !== e)) throw new TypeError(t + " must " + (n || "be") + " a function" + (r ? "" : " or undefined"));
+    return e;
+  }
+  function applyDec(e, t, n, r, o, i, u, s, f, l, p) {
+    function d(e) {
+      if (!p(e)) throw new TypeError("Attempted to access private element on non-instance");
+    }
+    var h = [].concat(t[0]),
+      v = t[3],
+      w = !u,
+      D = 1 === o,
+      S = 3 === o,
+      j = 4 === o,
+      E = 2 === o;
+    function I(t, n, r) {
+      return function (o, i) {
+        return n && (i = o, o = e), r && r(o), P[t].call(o, i);
+      };
+    }
+    if (!w) {
+      var P = {},
+        k = [],
+        F = S ? "get" : j || D ? "set" : "value";
+      if (f ? (l || D ? P = {
+        get: setFunctionName(function () {
+          return v(this);
+        }, r, "get"),
+        set: function set(e) {
+          t[4](this, e);
+        }
+      } : P[F] = v, l || setFunctionName(P[F], r, E ? "" : F)) : l || (P = Object.getOwnPropertyDescriptor(e, r)), !l && !f) {
+        if ((c = y[+s][r]) && 7 !== (c ^ o)) throw Error("Decorating two elements with the same name (" + P[F].name + ") is not supported yet");
+        y[+s][r] = o < 3 ? 1 : o;
+      }
+    }
+    for (var N = e, O = h.length - 1; O >= 0; O -= n ? 2 : 1) {
+      var T = b(h[O], "A decorator", "be", !0),
+        z = n ? h[O - 1] : void 0,
+        A = {},
+        H = {
+          kind: ["field", "accessor", "method", "getter", "setter", "class"][o],
+          name: r,
+          metadata: a,
+          addInitializer: function (e, t) {
+            if (e.v) throw new TypeError("attempted to call addInitializer after decoration was finished");
+            b(t, "An initializer", "be", !0), i.push(t);
+          }.bind(null, A)
+        };
+      if (w) c = T.call(z, N, H), A.v = 1, b(c, "class decorators", "return") && (N = c);else if (H["static"] = s, H["private"] = f, c = H.access = {
+        has: f ? p.bind() : function (e) {
+          return r in e;
+        }
+      }, j || (c.get = f ? E ? function (e) {
+        return d(e), P.value;
+      } : I("get", 0, d) : function (e) {
+        return e[r];
+      }), E || S || (c.set = f ? I("set", 0, d) : function (e, t) {
+        e[r] = t;
+      }), N = T.call(z, D ? {
+        get: P.get,
+        set: P.set
+      } : P[F], H), A.v = 1, D) {
+        if ("object" == _typeof(N) && N) (c = b(N.get, "accessor.get")) && (P.get = c), (c = b(N.set, "accessor.set")) && (P.set = c), (c = b(N.init, "accessor.init")) && k.unshift(c);else if (void 0 !== N) throw new TypeError("accessor decorators must return an object with get, set, or init properties or undefined");
+      } else b(N, (l ? "field" : "method") + " decorators", "return") && (l ? k.unshift(N) : P[F] = N);
+    }
+    return o < 2 && u.push(g(k, s, 1), g(i, s, 0)), l || w || (f ? D ? u.splice(-1, 0, I("get", s), I("set", s)) : u.push(E ? P[F] : b.call.bind(P[F])) : m(e, r, P)), N;
+  }
+  function w(e) {
+    return m(e, d, {
+      configurable: !0,
+      enumerable: !0,
+      value: a
+    });
+  }
+  return void 0 !== i && (a = i[d]), a = h(null == a ? null : a), f = [], l = function l(e) {
+    e && f.push(g(e));
+  }, p = function p(t, r) {
+    for (var i = 0; i < n.length; i++) {
+      var a = n[i],
+        c = a[1],
+        l = 7 & c;
+      if ((8 & c) == t && !l == r) {
+        var p = a[2],
+          d = !!a[3],
+          m = 16 & c;
+        applyDec(t ? e : e.prototype, a, m, d ? "#" + p : toPropertyKey(p), l, l < 2 ? [] : t ? s = s || [] : u = u || [], f, !!t, d, r, t && d ? function (t) {
+          return checkInRHS(t) === e;
+        } : o);
+      }
+    }
+  }, p(8, 0), p(0, 0), p(8, 1), p(0, 1), l(u), l(s), c = f, v || w(e), {
+    e: c,
+    get c() {
+      var n = [];
+      return v && [w(e = applyDec(e, [t], r, e.name, 5, n)), g(n, 1)];
+    }
+  };
+}
+export { applyDecs2311 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js b/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js
new file mode 100644
index 0000000..9ace772
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js
@@ -0,0 +1,6 @@
+function _arrayLikeToArray(r, a) {
+  (null == a || a > r.length) && (a = r.length);
+  for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
+  return n;
+}
+export { _arrayLikeToArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js b/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js
new file mode 100644
index 0000000..99fa715
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js
@@ -0,0 +1,4 @@
+function _arrayWithHoles(r) {
+  if (Array.isArray(r)) return r;
+}
+export { _arrayWithHoles as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js b/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js
new file mode 100644
index 0000000..1ce6f21
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js
@@ -0,0 +1,5 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+function _arrayWithoutHoles(r) {
+  if (Array.isArray(r)) return arrayLikeToArray(r);
+}
+export { _arrayWithoutHoles as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/assertClassBrand.js b/node_modules/@babel/runtime/helpers/esm/assertClassBrand.js
new file mode 100644
index 0000000..ae7b712
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/assertClassBrand.js
@@ -0,0 +1,5 @@
+function _assertClassBrand(e, t, n) {
+  if ("function" == typeof e ? e === t : e.has(t)) return arguments.length < 3 ? t : n;
+  throw new TypeError("Private element is not present on this object");
+}
+export { _assertClassBrand as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js b/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js
new file mode 100644
index 0000000..4a41bde
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js
@@ -0,0 +1,5 @@
+function _assertThisInitialized(e) {
+  if (void 0 === e) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
+  return e;
+}
+export { _assertThisInitialized as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js b/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js
new file mode 100644
index 0000000..e026689
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncGeneratorDelegate.js
@@ -0,0 +1,24 @@
+import OverloadYield from "./OverloadYield.js";
+function _asyncGeneratorDelegate(t) {
+  var e = {},
+    n = !1;
+  function pump(e, r) {
+    return n = !0, r = new Promise(function (n) {
+      n(t[e](r));
+    }), {
+      done: !1,
+      value: new OverloadYield(r, 1)
+    };
+  }
+  return e["undefined" != typeof Symbol && Symbol.iterator || "@@iterator"] = function () {
+    return this;
+  }, e.next = function (t) {
+    return n ? (n = !1, t) : pump("next", t);
+  }, "function" == typeof t["throw"] && (e["throw"] = function (t) {
+    if (n) throw n = !1, t;
+    return pump("throw", t);
+  }), "function" == typeof t["return"] && (e["return"] = function (t) {
+    return n ? (n = !1, t) : pump("return", t);
+  }), e;
+}
+export { _asyncGeneratorDelegate as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncIterator.js b/node_modules/@babel/runtime/helpers/esm/asyncIterator.js
new file mode 100644
index 0000000..2ed00b7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncIterator.js
@@ -0,0 +1,45 @@
+function _asyncIterator(r) {
+  var n,
+    t,
+    o,
+    e = 2;
+  for ("undefined" != typeof Symbol && (t = Symbol.asyncIterator, o = Symbol.iterator); e--;) {
+    if (t && null != (n = r[t])) return n.call(r);
+    if (o && null != (n = r[o])) return new AsyncFromSyncIterator(n.call(r));
+    t = "@@asyncIterator", o = "@@iterator";
+  }
+  throw new TypeError("Object is not async iterable");
+}
+function AsyncFromSyncIterator(r) {
+  function AsyncFromSyncIteratorContinuation(r) {
+    if (Object(r) !== r) return Promise.reject(new TypeError(r + " is not an object."));
+    var n = r.done;
+    return Promise.resolve(r.value).then(function (r) {
+      return {
+        value: r,
+        done: n
+      };
+    });
+  }
+  return AsyncFromSyncIterator = function AsyncFromSyncIterator(r) {
+    this.s = r, this.n = r.next;
+  }, AsyncFromSyncIterator.prototype = {
+    s: null,
+    n: null,
+    next: function next() {
+      return AsyncFromSyncIteratorContinuation(this.n.apply(this.s, arguments));
+    },
+    "return": function _return(r) {
+      var n = this.s["return"];
+      return void 0 === n ? Promise.resolve({
+        value: r,
+        done: !0
+      }) : AsyncFromSyncIteratorContinuation(n.apply(this.s, arguments));
+    },
+    "throw": function _throw(r) {
+      var n = this.s["return"];
+      return void 0 === n ? Promise.reject(r) : AsyncFromSyncIteratorContinuation(n.apply(this.s, arguments));
+    }
+  }, new AsyncFromSyncIterator(r);
+}
+export { _asyncIterator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js b/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js
new file mode 100644
index 0000000..00f29b1
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js
@@ -0,0 +1,26 @@
+function asyncGeneratorStep(n, t, e, r, o, a, c) {
+  try {
+    var i = n[a](c),
+      u = i.value;
+  } catch (n) {
+    return void e(n);
+  }
+  i.done ? t(u) : Promise.resolve(u).then(r, o);
+}
+function _asyncToGenerator(n) {
+  return function () {
+    var t = this,
+      e = arguments;
+    return new Promise(function (r, o) {
+      var a = n.apply(t, e);
+      function _next(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "next", n);
+      }
+      function _throw(n) {
+        asyncGeneratorStep(a, r, o, _next, _throw, "throw", n);
+      }
+      _next(void 0);
+    });
+  };
+}
+export { _asyncToGenerator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js b/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js
new file mode 100644
index 0000000..097c88c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/awaitAsyncGenerator.js
@@ -0,0 +1,5 @@
+import OverloadYield from "./OverloadYield.js";
+function _awaitAsyncGenerator(e) {
+  return new OverloadYield(e, 0);
+}
+export { _awaitAsyncGenerator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/callSuper.js b/node_modules/@babel/runtime/helpers/esm/callSuper.js
new file mode 100644
index 0000000..6d17a4e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/callSuper.js
@@ -0,0 +1,7 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+import isNativeReflectConstruct from "./isNativeReflectConstruct.js";
+import possibleConstructorReturn from "./possibleConstructorReturn.js";
+function _callSuper(t, o, e) {
+  return o = getPrototypeOf(o), possibleConstructorReturn(t, isNativeReflectConstruct() ? Reflect.construct(o, e || [], getPrototypeOf(t).constructor) : o.apply(t, e));
+}
+export { _callSuper as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/checkInRHS.js b/node_modules/@babel/runtime/helpers/esm/checkInRHS.js
new file mode 100644
index 0000000..12f59b4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/checkInRHS.js
@@ -0,0 +1,6 @@
+import _typeof from "./typeof.js";
+function _checkInRHS(e) {
+  if (Object(e) !== e) throw TypeError("right-hand side of 'in' should be an object, got " + (null !== e ? _typeof(e) : "null"));
+  return e;
+}
+export { _checkInRHS as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js b/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js
new file mode 100644
index 0000000..e9e6b3b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/checkPrivateRedeclaration.js
@@ -0,0 +1,4 @@
+function _checkPrivateRedeclaration(e, t) {
+  if (t.has(e)) throw new TypeError("Cannot initialize the same private elements twice on an object");
+}
+export { _checkPrivateRedeclaration as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js
new file mode 100644
index 0000000..5623419
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorDestructureSet.js
@@ -0,0 +1,10 @@
+function _classApplyDescriptorDestructureSet(e, t) {
+  if (t.set) return "__destrObj" in t || (t.__destrObj = {
+    set value(r) {
+      t.set.call(e, r);
+    }
+  }), t.__destrObj;
+  if (!t.writable) throw new TypeError("attempted to set read only private field");
+  return t;
+}
+export { _classApplyDescriptorDestructureSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js
new file mode 100644
index 0000000..b9259d3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorGet.js
@@ -0,0 +1,4 @@
+function _classApplyDescriptorGet(e, t) {
+  return t.get ? t.get.call(e) : t.value;
+}
+export { _classApplyDescriptorGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js
new file mode 100644
index 0000000..d9c4fbd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classApplyDescriptorSet.js
@@ -0,0 +1,7 @@
+function _classApplyDescriptorSet(e, t, l) {
+  if (t.set) t.set.call(e, l);else {
+    if (!t.writable) throw new TypeError("attempted to set read only private field");
+    t.value = l;
+  }
+}
+export { _classApplyDescriptorSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCallCheck.js b/node_modules/@babel/runtime/helpers/esm/classCallCheck.js
new file mode 100644
index 0000000..bf97219
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCallCheck.js
@@ -0,0 +1,4 @@
+function _classCallCheck(a, n) {
+  if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
+}
+export { _classCallCheck as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js
new file mode 100644
index 0000000..366ed05
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticAccess.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classCheckPrivateStaticAccess(s, a, r) {
+  return assertClassBrand(a, s, r);
+}
+export { _classCheckPrivateStaticAccess as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js
new file mode 100644
index 0000000..844be91
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classCheckPrivateStaticFieldDescriptor.js
@@ -0,0 +1,4 @@
+function _classCheckPrivateStaticFieldDescriptor(t, e) {
+  if (void 0 === t) throw new TypeError("attempted to " + e + " private static field before its declaration");
+}
+export { _classCheckPrivateStaticFieldDescriptor as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js b/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js
new file mode 100644
index 0000000..652689d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classExtractFieldDescriptor.js
@@ -0,0 +1,5 @@
+import classPrivateFieldGet2 from "./classPrivateFieldGet2.js";
+function _classExtractFieldDescriptor(e, t) {
+  return classPrivateFieldGet2(t, e);
+}
+export { _classExtractFieldDescriptor as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js b/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js
new file mode 100644
index 0000000..68e76ff
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classNameTDZError.js
@@ -0,0 +1,4 @@
+function _classNameTDZError(e) {
+  throw new ReferenceError('Class "' + e + '" cannot be referenced in computed property keys.');
+}
+export { _classNameTDZError as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..9303366
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldDestructureSet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorDestructureSet from "./classApplyDescriptorDestructureSet.js";
+import classPrivateFieldGet2 from "./classPrivateFieldGet2.js";
+function _classPrivateFieldDestructureSet(e, t) {
+  var r = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorDestructureSet(e, r);
+}
+export { _classPrivateFieldDestructureSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js
new file mode 100644
index 0000000..ce7ebcb
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorGet from "./classApplyDescriptorGet.js";
+import classPrivateFieldGet2 from "./classPrivateFieldGet2.js";
+function _classPrivateFieldGet(e, t) {
+  var r = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorGet(e, r);
+}
+export { _classPrivateFieldGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet2.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet2.js
new file mode 100644
index 0000000..4aa3da6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldGet2.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classPrivateFieldGet2(s, a) {
+  return s.get(assertClassBrand(s, a));
+}
+export { _classPrivateFieldGet2 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js
new file mode 100644
index 0000000..5dcdbe0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldInitSpec.js
@@ -0,0 +1,5 @@
+import checkPrivateRedeclaration from "./checkPrivateRedeclaration.js";
+function _classPrivateFieldInitSpec(e, t, a) {
+  checkPrivateRedeclaration(e, t), t.set(e, a);
+}
+export { _classPrivateFieldInitSpec as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js
new file mode 100644
index 0000000..4bd662c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseBase.js
@@ -0,0 +1,5 @@
+function _classPrivateFieldBase(e, t) {
+  if (!{}.hasOwnProperty.call(e, t)) throw new TypeError("attempted to use private field on non-instance");
+  return e;
+}
+export { _classPrivateFieldBase as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js
new file mode 100644
index 0000000..90d2193
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldLooseKey.js
@@ -0,0 +1,5 @@
+var id = 0;
+function _classPrivateFieldKey(e) {
+  return "__private_" + id++ + "_" + e;
+}
+export { _classPrivateFieldKey as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js
new file mode 100644
index 0000000..b5161bd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorSet from "./classApplyDescriptorSet.js";
+import classPrivateFieldGet2 from "./classPrivateFieldGet2.js";
+function _classPrivateFieldSet(e, t, r) {
+  var s = classPrivateFieldGet2(t, e);
+  return classApplyDescriptorSet(e, s, r), r;
+}
+export { _classPrivateFieldSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet2.js b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet2.js
new file mode 100644
index 0000000..337b01a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateFieldSet2.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classPrivateFieldSet2(s, a, r) {
+  return s.set(assertClassBrand(s, a), r), r;
+}
+export { _classPrivateFieldSet2 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateGetter.js b/node_modules/@babel/runtime/helpers/esm/classPrivateGetter.js
new file mode 100644
index 0000000..ff3e985
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateGetter.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classPrivateGetter(s, r, a) {
+  return a(assertClassBrand(s, r));
+}
+export { _classPrivateGetter as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js
new file mode 100644
index 0000000..4832fc6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodGet.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classPrivateMethodGet(s, a, r) {
+  return assertClassBrand(a, s), r;
+}
+export { _classPrivateMethodGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js
new file mode 100644
index 0000000..61e23e2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodInitSpec.js
@@ -0,0 +1,5 @@
+import checkPrivateRedeclaration from "./checkPrivateRedeclaration.js";
+function _classPrivateMethodInitSpec(e, a) {
+  checkPrivateRedeclaration(e, a), a.add(e);
+}
+export { _classPrivateMethodInitSpec as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js
new file mode 100644
index 0000000..d181b51
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateMethodSet.js
@@ -0,0 +1,4 @@
+function _classPrivateMethodSet() {
+  throw new TypeError("attempted to reassign private method");
+}
+export { _classPrivateMethodSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classPrivateSetter.js b/node_modules/@babel/runtime/helpers/esm/classPrivateSetter.js
new file mode 100644
index 0000000..9a80d59
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classPrivateSetter.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classPrivateSetter(s, r, a, t) {
+  return r(assertClassBrand(s, a), t), t;
+}
+export { _classPrivateSetter as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js
new file mode 100644
index 0000000..747e639
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldDestructureSet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorDestructureSet from "./classApplyDescriptorDestructureSet.js";
+import assertClassBrand from "./assertClassBrand.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+function _classStaticPrivateFieldDestructureSet(t, r, s) {
+  return assertClassBrand(r, t), classCheckPrivateStaticFieldDescriptor(s, "set"), classApplyDescriptorDestructureSet(t, s);
+}
+export { _classStaticPrivateFieldDestructureSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js
new file mode 100644
index 0000000..23684b7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecGet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorGet from "./classApplyDescriptorGet.js";
+import assertClassBrand from "./assertClassBrand.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+function _classStaticPrivateFieldSpecGet(t, s, r) {
+  return assertClassBrand(s, t), classCheckPrivateStaticFieldDescriptor(r, "get"), classApplyDescriptorGet(t, r);
+}
+export { _classStaticPrivateFieldSpecGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js
new file mode 100644
index 0000000..3a31468
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateFieldSpecSet.js
@@ -0,0 +1,7 @@
+import classApplyDescriptorSet from "./classApplyDescriptorSet.js";
+import assertClassBrand from "./assertClassBrand.js";
+import classCheckPrivateStaticFieldDescriptor from "./classCheckPrivateStaticFieldDescriptor.js";
+function _classStaticPrivateFieldSpecSet(s, t, r, e) {
+  return assertClassBrand(t, s), classCheckPrivateStaticFieldDescriptor(r, "set"), classApplyDescriptorSet(s, r, e), e;
+}
+export { _classStaticPrivateFieldSpecSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js
new file mode 100644
index 0000000..047b177
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodGet.js
@@ -0,0 +1,5 @@
+import assertClassBrand from "./assertClassBrand.js";
+function _classStaticPrivateMethodGet(s, a, t) {
+  return assertClassBrand(a, s), t;
+}
+export { _classStaticPrivateMethodGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js
new file mode 100644
index 0000000..a61ae63
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/classStaticPrivateMethodSet.js
@@ -0,0 +1,4 @@
+function _classStaticPrivateMethodSet() {
+  throw new TypeError("attempted to set read only static private field");
+}
+export { _classStaticPrivateMethodSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/construct.js b/node_modules/@babel/runtime/helpers/esm/construct.js
new file mode 100644
index 0000000..91609ff
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/construct.js
@@ -0,0 +1,10 @@
+import isNativeReflectConstruct from "./isNativeReflectConstruct.js";
+import setPrototypeOf from "./setPrototypeOf.js";
+function _construct(t, e, r) {
+  if (isNativeReflectConstruct()) return Reflect.construct.apply(null, arguments);
+  var o = [null];
+  o.push.apply(o, e);
+  var p = new (t.bind.apply(t, o))();
+  return r && setPrototypeOf(p, r.prototype), p;
+}
+export { _construct as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createClass.js b/node_modules/@babel/runtime/helpers/esm/createClass.js
new file mode 100644
index 0000000..9b17851
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createClass.js
@@ -0,0 +1,13 @@
+import toPropertyKey from "./toPropertyKey.js";
+function _defineProperties(e, r) {
+  for (var t = 0; t < r.length; t++) {
+    var o = r[t];
+    o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, toPropertyKey(o.key), o);
+  }
+}
+function _createClass(e, r, t) {
+  return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), e;
+}
+export { _createClass as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js
new file mode 100644
index 0000000..93b97f9
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelper.js
@@ -0,0 +1,50 @@
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+function _createForOfIteratorHelper(r, e) {
+  var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (!t) {
+    if (Array.isArray(r) || (t = unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) {
+      t && (r = t);
+      var _n = 0,
+        F = function F() {};
+      return {
+        s: F,
+        n: function n() {
+          return _n >= r.length ? {
+            done: !0
+          } : {
+            done: !1,
+            value: r[_n++]
+          };
+        },
+        e: function e(r) {
+          throw r;
+        },
+        f: F
+      };
+    }
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+  var o,
+    a = !0,
+    u = !1;
+  return {
+    s: function s() {
+      t = t.call(r);
+    },
+    n: function n() {
+      var r = t.next();
+      return a = r.done, r;
+    },
+    e: function e(r) {
+      u = !0, o = r;
+    },
+    f: function f() {
+      try {
+        a || null == t["return"] || t["return"]();
+      } finally {
+        if (u) throw o;
+      }
+    }
+  };
+}
+export { _createForOfIteratorHelper as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js
new file mode 100644
index 0000000..3deaae4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createForOfIteratorHelperLoose.js
@@ -0,0 +1,19 @@
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+function _createForOfIteratorHelperLoose(r, e) {
+  var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (t) return (t = t.call(r)).next.bind(t);
+  if (Array.isArray(r) || (t = unsupportedIterableToArray(r)) || e && r && "number" == typeof r.length) {
+    t && (r = t);
+    var o = 0;
+    return function () {
+      return o >= r.length ? {
+        done: !0
+      } : {
+        done: !1,
+        value: r[o++]
+      };
+    };
+  }
+  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+export { _createForOfIteratorHelperLoose as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/createSuper.js b/node_modules/@babel/runtime/helpers/esm/createSuper.js
new file mode 100644
index 0000000..dfabf71
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/createSuper.js
@@ -0,0 +1,16 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+import isNativeReflectConstruct from "./isNativeReflectConstruct.js";
+import possibleConstructorReturn from "./possibleConstructorReturn.js";
+function _createSuper(t) {
+  var r = isNativeReflectConstruct();
+  return function () {
+    var e,
+      o = getPrototypeOf(t);
+    if (r) {
+      var s = getPrototypeOf(this).constructor;
+      e = Reflect.construct(o, arguments, s);
+    } else e = o.apply(this, arguments);
+    return possibleConstructorReturn(this, e);
+  };
+}
+export { _createSuper as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/decorate.js b/node_modules/@babel/runtime/helpers/esm/decorate.js
new file mode 100644
index 0000000..f76b6a6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/decorate.js
@@ -0,0 +1,250 @@
+import toArray from "./toArray.js";
+import toPropertyKey from "./toPropertyKey.js";
+function _decorate(e, r, t, i) {
+  var o = _getDecoratorsApi();
+  if (i) for (var n = 0; n < i.length; n++) o = i[n](o);
+  var s = r(function (e) {
+      o.initializeInstanceElements(e, a.elements);
+    }, t),
+    a = o.decorateClass(_coalesceClassElements(s.d.map(_createElementDescriptor)), e);
+  return o.initializeClassElements(s.F, a.elements), o.runClassFinishers(s.F, a.finishers);
+}
+function _getDecoratorsApi() {
+  _getDecoratorsApi = function _getDecoratorsApi() {
+    return e;
+  };
+  var e = {
+    elementsDefinitionOrder: [["method"], ["field"]],
+    initializeInstanceElements: function initializeInstanceElements(e, r) {
+      ["method", "field"].forEach(function (t) {
+        r.forEach(function (r) {
+          r.kind === t && "own" === r.placement && this.defineClassElement(e, r);
+        }, this);
+      }, this);
+    },
+    initializeClassElements: function initializeClassElements(e, r) {
+      var t = e.prototype;
+      ["method", "field"].forEach(function (i) {
+        r.forEach(function (r) {
+          var o = r.placement;
+          if (r.kind === i && ("static" === o || "prototype" === o)) {
+            var n = "static" === o ? e : t;
+            this.defineClassElement(n, r);
+          }
+        }, this);
+      }, this);
+    },
+    defineClassElement: function defineClassElement(e, r) {
+      var t = r.descriptor;
+      if ("field" === r.kind) {
+        var i = r.initializer;
+        t = {
+          enumerable: t.enumerable,
+          writable: t.writable,
+          configurable: t.configurable,
+          value: void 0 === i ? void 0 : i.call(e)
+        };
+      }
+      Object.defineProperty(e, r.key, t);
+    },
+    decorateClass: function decorateClass(e, r) {
+      var t = [],
+        i = [],
+        o = {
+          "static": [],
+          prototype: [],
+          own: []
+        };
+      if (e.forEach(function (e) {
+        this.addElementPlacement(e, o);
+      }, this), e.forEach(function (e) {
+        if (!_hasDecorators(e)) return t.push(e);
+        var r = this.decorateElement(e, o);
+        t.push(r.element), t.push.apply(t, r.extras), i.push.apply(i, r.finishers);
+      }, this), !r) return {
+        elements: t,
+        finishers: i
+      };
+      var n = this.decorateConstructor(t, r);
+      return i.push.apply(i, n.finishers), n.finishers = i, n;
+    },
+    addElementPlacement: function addElementPlacement(e, r, t) {
+      var i = r[e.placement];
+      if (!t && -1 !== i.indexOf(e.key)) throw new TypeError("Duplicated element (" + e.key + ")");
+      i.push(e.key);
+    },
+    decorateElement: function decorateElement(e, r) {
+      for (var t = [], i = [], o = e.decorators, n = o.length - 1; n >= 0; n--) {
+        var s = r[e.placement];
+        s.splice(s.indexOf(e.key), 1);
+        var a = this.fromElementDescriptor(e),
+          l = this.toElementFinisherExtras((0, o[n])(a) || a);
+        e = l.element, this.addElementPlacement(e, r), l.finisher && i.push(l.finisher);
+        var c = l.extras;
+        if (c) {
+          for (var p = 0; p < c.length; p++) this.addElementPlacement(c[p], r);
+          t.push.apply(t, c);
+        }
+      }
+      return {
+        element: e,
+        finishers: i,
+        extras: t
+      };
+    },
+    decorateConstructor: function decorateConstructor(e, r) {
+      for (var t = [], i = r.length - 1; i >= 0; i--) {
+        var o = this.fromClassDescriptor(e),
+          n = this.toClassDescriptor((0, r[i])(o) || o);
+        if (void 0 !== n.finisher && t.push(n.finisher), void 0 !== n.elements) {
+          e = n.elements;
+          for (var s = 0; s < e.length - 1; s++) for (var a = s + 1; a < e.length; a++) if (e[s].key === e[a].key && e[s].placement === e[a].placement) throw new TypeError("Duplicated element (" + e[s].key + ")");
+        }
+      }
+      return {
+        elements: e,
+        finishers: t
+      };
+    },
+    fromElementDescriptor: function fromElementDescriptor(e) {
+      var r = {
+        kind: e.kind,
+        key: e.key,
+        placement: e.placement,
+        descriptor: e.descriptor
+      };
+      return Object.defineProperty(r, Symbol.toStringTag, {
+        value: "Descriptor",
+        configurable: !0
+      }), "field" === e.kind && (r.initializer = e.initializer), r;
+    },
+    toElementDescriptors: function toElementDescriptors(e) {
+      if (void 0 !== e) return toArray(e).map(function (e) {
+        var r = this.toElementDescriptor(e);
+        return this.disallowProperty(e, "finisher", "An element descriptor"), this.disallowProperty(e, "extras", "An element descriptor"), r;
+      }, this);
+    },
+    toElementDescriptor: function toElementDescriptor(e) {
+      var r = e.kind + "";
+      if ("method" !== r && "field" !== r) throw new TypeError('An element descriptor\'s .kind property must be either "method" or "field", but a decorator created an element descriptor with .kind "' + r + '"');
+      var t = toPropertyKey(e.key),
+        i = e.placement + "";
+      if ("static" !== i && "prototype" !== i && "own" !== i) throw new TypeError('An element descriptor\'s .placement property must be one of "static", "prototype" or "own", but a decorator created an element descriptor with .placement "' + i + '"');
+      var o = e.descriptor;
+      this.disallowProperty(e, "elements", "An element descriptor");
+      var n = {
+        kind: r,
+        key: t,
+        placement: i,
+        descriptor: Object.assign({}, o)
+      };
+      return "field" !== r ? this.disallowProperty(e, "initializer", "A method descriptor") : (this.disallowProperty(o, "get", "The property descriptor of a field descriptor"), this.disallowProperty(o, "set", "The property descriptor of a field descriptor"), this.disallowProperty(o, "value", "The property descriptor of a field descriptor"), n.initializer = e.initializer), n;
+    },
+    toElementFinisherExtras: function toElementFinisherExtras(e) {
+      return {
+        element: this.toElementDescriptor(e),
+        finisher: _optionalCallableProperty(e, "finisher"),
+        extras: this.toElementDescriptors(e.extras)
+      };
+    },
+    fromClassDescriptor: function fromClassDescriptor(e) {
+      var r = {
+        kind: "class",
+        elements: e.map(this.fromElementDescriptor, this)
+      };
+      return Object.defineProperty(r, Symbol.toStringTag, {
+        value: "Descriptor",
+        configurable: !0
+      }), r;
+    },
+    toClassDescriptor: function toClassDescriptor(e) {
+      var r = e.kind + "";
+      if ("class" !== r) throw new TypeError('A class descriptor\'s .kind property must be "class", but a decorator created a class descriptor with .kind "' + r + '"');
+      this.disallowProperty(e, "key", "A class descriptor"), this.disallowProperty(e, "placement", "A class descriptor"), this.disallowProperty(e, "descriptor", "A class descriptor"), this.disallowProperty(e, "initializer", "A class descriptor"), this.disallowProperty(e, "extras", "A class descriptor");
+      var t = _optionalCallableProperty(e, "finisher");
+      return {
+        elements: this.toElementDescriptors(e.elements),
+        finisher: t
+      };
+    },
+    runClassFinishers: function runClassFinishers(e, r) {
+      for (var t = 0; t < r.length; t++) {
+        var i = (0, r[t])(e);
+        if (void 0 !== i) {
+          if ("function" != typeof i) throw new TypeError("Finishers must return a constructor.");
+          e = i;
+        }
+      }
+      return e;
+    },
+    disallowProperty: function disallowProperty(e, r, t) {
+      if (void 0 !== e[r]) throw new TypeError(t + " can't have a ." + r + " property.");
+    }
+  };
+  return e;
+}
+function _createElementDescriptor(e) {
+  var r,
+    t = toPropertyKey(e.key);
+  "method" === e.kind ? r = {
+    value: e.value,
+    writable: !0,
+    configurable: !0,
+    enumerable: !1
+  } : "get" === e.kind ? r = {
+    get: e.value,
+    configurable: !0,
+    enumerable: !1
+  } : "set" === e.kind ? r = {
+    set: e.value,
+    configurable: !0,
+    enumerable: !1
+  } : "field" === e.kind && (r = {
+    configurable: !0,
+    writable: !0,
+    enumerable: !0
+  });
+  var i = {
+    kind: "field" === e.kind ? "field" : "method",
+    key: t,
+    placement: e["static"] ? "static" : "field" === e.kind ? "own" : "prototype",
+    descriptor: r
+  };
+  return e.decorators && (i.decorators = e.decorators), "field" === e.kind && (i.initializer = e.value), i;
+}
+function _coalesceGetterSetter(e, r) {
+  void 0 !== e.descriptor.get ? r.descriptor.get = e.descriptor.get : r.descriptor.set = e.descriptor.set;
+}
+function _coalesceClassElements(e) {
+  for (var r = [], isSameElement = function isSameElement(e) {
+      return "method" === e.kind && e.key === o.key && e.placement === o.placement;
+    }, t = 0; t < e.length; t++) {
+    var i,
+      o = e[t];
+    if ("method" === o.kind && (i = r.find(isSameElement))) {
+      if (_isDataDescriptor(o.descriptor) || _isDataDescriptor(i.descriptor)) {
+        if (_hasDecorators(o) || _hasDecorators(i)) throw new ReferenceError("Duplicated methods (" + o.key + ") can't be decorated.");
+        i.descriptor = o.descriptor;
+      } else {
+        if (_hasDecorators(o)) {
+          if (_hasDecorators(i)) throw new ReferenceError("Decorators can't be placed on different accessors with for the same property (" + o.key + ").");
+          i.decorators = o.decorators;
+        }
+        _coalesceGetterSetter(o, i);
+      }
+    } else r.push(o);
+  }
+  return r;
+}
+function _hasDecorators(e) {
+  return e.decorators && e.decorators.length;
+}
+function _isDataDescriptor(e) {
+  return void 0 !== e && !(void 0 === e.value && void 0 === e.writable);
+}
+function _optionalCallableProperty(e, r) {
+  var t = e[r];
+  if (void 0 !== t && "function" != typeof t) throw new TypeError("Expected '" + r + "' to be a function");
+  return t;
+}
+export { _decorate as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defaults.js b/node_modules/@babel/runtime/helpers/esm/defaults.js
new file mode 100644
index 0000000..d3041a3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defaults.js
@@ -0,0 +1,9 @@
+function _defaults(e, r) {
+  for (var t = Object.getOwnPropertyNames(r), o = 0; o < t.length; o++) {
+    var n = t[o],
+      a = Object.getOwnPropertyDescriptor(r, n);
+    a && a.configurable && void 0 === e[n] && Object.defineProperty(e, n, a);
+  }
+  return e;
+}
+export { _defaults as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defineAccessor.js b/node_modules/@babel/runtime/helpers/esm/defineAccessor.js
new file mode 100644
index 0000000..a8292de
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defineAccessor.js
@@ -0,0 +1,8 @@
+function _defineAccessor(e, r, n, t) {
+  var c = {
+    configurable: !0,
+    enumerable: !0
+  };
+  return c[e] = t, Object.defineProperty(r, n, c);
+}
+export { _defineAccessor as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js b/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js
new file mode 100644
index 0000000..3d31d98
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defineEnumerableProperties.js
@@ -0,0 +1,12 @@
+function _defineEnumerableProperties(e, r) {
+  for (var t in r) {
+    var n = r[t];
+    n.configurable = n.enumerable = !0, "value" in n && (n.writable = !0), Object.defineProperty(e, t, n);
+  }
+  if (Object.getOwnPropertySymbols) for (var a = Object.getOwnPropertySymbols(r), b = 0; b < a.length; b++) {
+    var i = a[b];
+    (n = r[i]).configurable = n.enumerable = !0, "value" in n && (n.writable = !0), Object.defineProperty(e, i, n);
+  }
+  return e;
+}
+export { _defineEnumerableProperties as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/defineProperty.js b/node_modules/@babel/runtime/helpers/esm/defineProperty.js
new file mode 100644
index 0000000..05ec32b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/defineProperty.js
@@ -0,0 +1,10 @@
+import toPropertyKey from "./toPropertyKey.js";
+function _defineProperty(e, r, t) {
+  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : e[r] = t, e;
+}
+export { _defineProperty as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/dispose.js b/node_modules/@babel/runtime/helpers/esm/dispose.js
new file mode 100644
index 0000000..a87ab20
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/dispose.js
@@ -0,0 +1,28 @@
+function dispose_SuppressedError(r, e) {
+  return "undefined" != typeof SuppressedError ? dispose_SuppressedError = SuppressedError : (dispose_SuppressedError = function dispose_SuppressedError(r, e) {
+    this.suppressed = e, this.error = r, this.stack = Error().stack;
+  }, dispose_SuppressedError.prototype = Object.create(Error.prototype, {
+    constructor: {
+      value: dispose_SuppressedError,
+      writable: !0,
+      configurable: !0
+    }
+  })), new dispose_SuppressedError(r, e);
+}
+function _dispose(r, e, s) {
+  function next() {
+    for (; r.length > 0;) try {
+      var o = r.pop(),
+        p = o.d.call(o.v);
+      if (o.a) return Promise.resolve(p).then(next, err);
+    } catch (r) {
+      return err(r);
+    }
+    if (s) throw e;
+  }
+  function err(r) {
+    return e = s ? new dispose_SuppressedError(e, r) : r, s = !0, next();
+  }
+  return next();
+}
+export { _dispose as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/extends.js b/node_modules/@babel/runtime/helpers/esm/extends.js
new file mode 100644
index 0000000..53f118c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/extends.js
@@ -0,0 +1,10 @@
+function _extends() {
+  return _extends = Object.assign ? Object.assign.bind() : function (n) {
+    for (var e = 1; e < arguments.length; e++) {
+      var t = arguments[e];
+      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);
+    }
+    return n;
+  }, _extends.apply(null, arguments);
+}
+export { _extends as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/get.js b/node_modules/@babel/runtime/helpers/esm/get.js
new file mode 100644
index 0000000..8124bc0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/get.js
@@ -0,0 +1,11 @@
+import superPropBase from "./superPropBase.js";
+function _get() {
+  return _get = "undefined" != typeof Reflect && Reflect.get ? Reflect.get.bind() : function (e, t, r) {
+    var p = superPropBase(e, t);
+    if (p) {
+      var n = Object.getOwnPropertyDescriptor(p, t);
+      return n.get ? n.get.call(arguments.length < 3 ? e : r) : n.value;
+    }
+  }, _get.apply(null, arguments);
+}
+export { _get as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js b/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js
new file mode 100644
index 0000000..9073c45
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js
@@ -0,0 +1,6 @@
+function _getPrototypeOf(t) {
+  return _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) {
+    return t.__proto__ || Object.getPrototypeOf(t);
+  }, _getPrototypeOf(t);
+}
+export { _getPrototypeOf as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/identity.js b/node_modules/@babel/runtime/helpers/esm/identity.js
new file mode 100644
index 0000000..6b564ac
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/identity.js
@@ -0,0 +1,4 @@
+function _identity(t) {
+  return t;
+}
+export { _identity as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/importDeferProxy.js b/node_modules/@babel/runtime/helpers/esm/importDeferProxy.js
new file mode 100644
index 0000000..6d35b52
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/importDeferProxy.js
@@ -0,0 +1,27 @@
+function _importDeferProxy(e) {
+  var t = null,
+    constValue = function constValue(e) {
+      return function () {
+        return e;
+      };
+    },
+    proxy = function proxy(r) {
+      return function (n, o, f) {
+        return null === t && (t = e()), r(t, o, f);
+      };
+    };
+  return new Proxy({}, {
+    defineProperty: constValue(!1),
+    deleteProperty: constValue(!1),
+    get: proxy(Reflect.get),
+    getOwnPropertyDescriptor: proxy(Reflect.getOwnPropertyDescriptor),
+    getPrototypeOf: constValue(null),
+    isExtensible: constValue(!1),
+    has: proxy(Reflect.has),
+    ownKeys: proxy(Reflect.ownKeys),
+    preventExtensions: constValue(!0),
+    set: constValue(!1),
+    setPrototypeOf: constValue(!1)
+  });
+}
+export { _importDeferProxy as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/inherits.js b/node_modules/@babel/runtime/helpers/esm/inherits.js
new file mode 100644
index 0000000..78f6e4e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/inherits.js
@@ -0,0 +1,14 @@
+import setPrototypeOf from "./setPrototypeOf.js";
+function _inherits(t, e) {
+  if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function");
+  t.prototype = Object.create(e && e.prototype, {
+    constructor: {
+      value: t,
+      writable: !0,
+      configurable: !0
+    }
+  }), Object.defineProperty(t, "prototype", {
+    writable: !1
+  }), e && setPrototypeOf(t, e);
+}
+export { _inherits as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js b/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js
new file mode 100644
index 0000000..0bd1330
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/inheritsLoose.js
@@ -0,0 +1,5 @@
+import setPrototypeOf from "./setPrototypeOf.js";
+function _inheritsLoose(t, o) {
+  t.prototype = Object.create(o.prototype), t.prototype.constructor = t, setPrototypeOf(t, o);
+}
+export { _inheritsLoose as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js b/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js
new file mode 100644
index 0000000..68bcc2c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/initializerDefineProperty.js
@@ -0,0 +1,9 @@
+function _initializerDefineProperty(e, i, r, l) {
+  r && Object.defineProperty(e, i, {
+    enumerable: r.enumerable,
+    configurable: r.configurable,
+    writable: r.writable,
+    value: r.initializer ? r.initializer.call(l) : void 0
+  });
+}
+export { _initializerDefineProperty as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js b/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js
new file mode 100644
index 0000000..0a658e3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/initializerWarningHelper.js
@@ -0,0 +1,4 @@
+function _initializerWarningHelper(r, e) {
+  throw Error("Decorating class property failed. Please ensure that transform-class-properties is enabled and runs after the decorators transform.");
+}
+export { _initializerWarningHelper as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/instanceof.js b/node_modules/@babel/runtime/helpers/esm/instanceof.js
new file mode 100644
index 0000000..316539e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/instanceof.js
@@ -0,0 +1,4 @@
+function _instanceof(n, e) {
+  return null != e && "undefined" != typeof Symbol && e[Symbol.hasInstance] ? !!e[Symbol.hasInstance](n) : n instanceof e;
+}
+export { _instanceof as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js b/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js
new file mode 100644
index 0000000..365d248
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/interopRequireDefault.js
@@ -0,0 +1,6 @@
+function _interopRequireDefault(e) {
+  return e && e.__esModule ? e : {
+    "default": e
+  };
+}
+export { _interopRequireDefault as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js b/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js
new file mode 100644
index 0000000..ed9ca31
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/interopRequireWildcard.js
@@ -0,0 +1,22 @@
+import _typeof from "./typeof.js";
+function _interopRequireWildcard(e, t) {
+  if ("function" == typeof WeakMap) var r = new WeakMap(),
+    n = new WeakMap();
+  return (_interopRequireWildcard = function _interopRequireWildcard(e, t) {
+    if (!t && e && e.__esModule) return e;
+    var o,
+      i,
+      f = {
+        __proto__: null,
+        "default": e
+      };
+    if (null === e || "object" != _typeof(e) && "function" != typeof e) return f;
+    if (o = t ? n : r) {
+      if (o.has(e)) return o.get(e);
+      o.set(e, f);
+    }
+    for (var _t in e) "default" !== _t && {}.hasOwnProperty.call(e, _t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, _t)) && (i.get || i.set) ? o(f, _t, i) : f[_t] = e[_t]);
+    return f;
+  })(e, t);
+}
+export { _interopRequireWildcard as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js b/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js
new file mode 100644
index 0000000..0cfe276
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/isNativeFunction.js
@@ -0,0 +1,8 @@
+function _isNativeFunction(t) {
+  try {
+    return -1 !== Function.toString.call(t).indexOf("[native code]");
+  } catch (n) {
+    return "function" == typeof t;
+  }
+}
+export { _isNativeFunction as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js b/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js
new file mode 100644
index 0000000..0eb5e39
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/isNativeReflectConstruct.js
@@ -0,0 +1,9 @@
+function _isNativeReflectConstruct() {
+  try {
+    var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+  } catch (t) {}
+  return (_isNativeReflectConstruct = function _isNativeReflectConstruct() {
+    return !!t;
+  })();
+}
+export { _isNativeReflectConstruct as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/iterableToArray.js b/node_modules/@babel/runtime/helpers/esm/iterableToArray.js
new file mode 100644
index 0000000..b7de339
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/iterableToArray.js
@@ -0,0 +1,4 @@
+function _iterableToArray(r) {
+  if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
+}
+export { _iterableToArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js
new file mode 100644
index 0000000..473f067
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js
@@ -0,0 +1,28 @@
+function _iterableToArrayLimit(r, l) {
+  var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (null != t) {
+    var e,
+      n,
+      i,
+      u,
+      a = [],
+      f = !0,
+      o = !1;
+    try {
+      if (i = (t = t.call(r)).next, 0 === l) {
+        if (Object(t) !== t) return;
+        f = !1;
+      } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
+    } catch (r) {
+      o = !0, n = r;
+    } finally {
+      try {
+        if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return;
+      } finally {
+        if (o) throw n;
+      }
+    }
+    return a;
+  }
+}
+export { _iterableToArrayLimit as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/jsx.js b/node_modules/@babel/runtime/helpers/esm/jsx.js
new file mode 100644
index 0000000..a120e5b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/jsx.js
@@ -0,0 +1,22 @@
+var REACT_ELEMENT_TYPE;
+function _createRawReactElement(e, r, E, l) {
+  REACT_ELEMENT_TYPE || (REACT_ELEMENT_TYPE = "function" == typeof Symbol && Symbol["for"] && Symbol["for"]("react.element") || 60103);
+  var o = e && e.defaultProps,
+    n = arguments.length - 3;
+  if (r || 0 === n || (r = {
+    children: void 0
+  }), 1 === n) r.children = l;else if (n > 1) {
+    for (var t = Array(n), f = 0; f < n; f++) t[f] = arguments[f + 3];
+    r.children = t;
+  }
+  if (r && o) for (var i in o) void 0 === r[i] && (r[i] = o[i]);else r || (r = o || {});
+  return {
+    $$typeof: REACT_ELEMENT_TYPE,
+    type: e,
+    key: void 0 === E ? null : "" + E,
+    ref: null,
+    props: r,
+    _owner: null
+  };
+}
+export { _createRawReactElement as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js b/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js
new file mode 100644
index 0000000..527c682
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/maybeArrayLike.js
@@ -0,0 +1,9 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+function _maybeArrayLike(r, a, e) {
+  if (a && !Array.isArray(a) && "number" == typeof a.length) {
+    var y = a.length;
+    return arrayLikeToArray(a, void 0 !== e && e < y ? e : y);
+  }
+  return r(a, e);
+}
+export { _maybeArrayLike as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js b/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js
new file mode 100644
index 0000000..5f70e0d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/newArrowCheck.js
@@ -0,0 +1,4 @@
+function _newArrowCheck(n, r) {
+  if (n !== r) throw new TypeError("Cannot instantiate an arrow function");
+}
+export { _newArrowCheck as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js b/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js
new file mode 100644
index 0000000..9050250
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js
@@ -0,0 +1,4 @@
+function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+export { _nonIterableRest as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js b/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js
new file mode 100644
index 0000000..fb03235
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js
@@ -0,0 +1,4 @@
+function _nonIterableSpread() {
+  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+export { _nonIterableSpread as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/nullishReceiverError.js b/node_modules/@babel/runtime/helpers/esm/nullishReceiverError.js
new file mode 100644
index 0000000..d8c3060
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/nullishReceiverError.js
@@ -0,0 +1,4 @@
+function _nullishReceiverError(r) {
+  throw new TypeError("Cannot set property of null or undefined.");
+}
+export { _nullishReceiverError as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js b/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js
new file mode 100644
index 0000000..a92eac8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectDestructuringEmpty.js
@@ -0,0 +1,4 @@
+function _objectDestructuringEmpty(t) {
+  if (null == t) throw new TypeError("Cannot destructure " + t);
+}
+export { _objectDestructuringEmpty as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectSpread.js b/node_modules/@babel/runtime/helpers/esm/objectSpread.js
new file mode 100644
index 0000000..0f82f06
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectSpread.js
@@ -0,0 +1,14 @@
+import defineProperty from "./defineProperty.js";
+function _objectSpread(e) {
+  for (var r = 1; r < arguments.length; r++) {
+    var t = null != arguments[r] ? Object(arguments[r]) : {},
+      o = Object.keys(t);
+    "function" == typeof Object.getOwnPropertySymbols && o.push.apply(o, Object.getOwnPropertySymbols(t).filter(function (e) {
+      return Object.getOwnPropertyDescriptor(t, e).enumerable;
+    })), o.forEach(function (r) {
+      defineProperty(e, r, t[r]);
+    });
+  }
+  return e;
+}
+export { _objectSpread as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectSpread2.js b/node_modules/@babel/runtime/helpers/esm/objectSpread2.js
new file mode 100644
index 0000000..0035bc7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectSpread2.js
@@ -0,0 +1,23 @@
+import defineProperty from "./defineProperty.js";
+function ownKeys(e, r) {
+  var t = Object.keys(e);
+  if (Object.getOwnPropertySymbols) {
+    var o = Object.getOwnPropertySymbols(e);
+    r && (o = o.filter(function (r) {
+      return Object.getOwnPropertyDescriptor(e, r).enumerable;
+    })), t.push.apply(t, o);
+  }
+  return t;
+}
+function _objectSpread2(e) {
+  for (var r = 1; r < arguments.length; r++) {
+    var t = null != arguments[r] ? arguments[r] : {};
+    r % 2 ? ownKeys(Object(t), !0).forEach(function (r) {
+      defineProperty(e, r, t[r]);
+    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
+      Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
+    });
+  }
+  return e;
+}
+export { _objectSpread2 as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js b/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js
new file mode 100644
index 0000000..598fb9a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js
@@ -0,0 +1,13 @@
+import objectWithoutPropertiesLoose from "./objectWithoutPropertiesLoose.js";
+function _objectWithoutProperties(e, t) {
+  if (null == e) return {};
+  var o,
+    r,
+    i = objectWithoutPropertiesLoose(e, t);
+  if (Object.getOwnPropertySymbols) {
+    var n = Object.getOwnPropertySymbols(e);
+    for (r = 0; r < n.length; r++) o = n[r], -1 === t.indexOf(o) && {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
+  }
+  return i;
+}
+export { _objectWithoutProperties as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js b/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js
new file mode 100644
index 0000000..90f68f3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js
@@ -0,0 +1,10 @@
+function _objectWithoutPropertiesLoose(r, e) {
+  if (null == r) return {};
+  var t = {};
+  for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
+    if (-1 !== e.indexOf(n)) continue;
+    t[n] = r[n];
+  }
+  return t;
+}
+export { _objectWithoutPropertiesLoose as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/package.json b/node_modules/@babel/runtime/helpers/esm/package.json
new file mode 100644
index 0000000..aead43d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "module"
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js b/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js
new file mode 100644
index 0000000..d84e1e6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js
@@ -0,0 +1,8 @@
+import _typeof from "./typeof.js";
+import assertThisInitialized from "./assertThisInitialized.js";
+function _possibleConstructorReturn(t, e) {
+  if (e && ("object" == _typeof(e) || "function" == typeof e)) return e;
+  if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined");
+  return assertThisInitialized(t);
+}
+export { _possibleConstructorReturn as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/readOnlyError.js b/node_modules/@babel/runtime/helpers/esm/readOnlyError.js
new file mode 100644
index 0000000..fcc3e33
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/readOnlyError.js
@@ -0,0 +1,4 @@
+function _readOnlyError(r) {
+  throw new TypeError('"' + r + '" is read-only');
+}
+export { _readOnlyError as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regenerator.js b/node_modules/@babel/runtime/helpers/esm/regenerator.js
new file mode 100644
index 0000000..6f2f2a1
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regenerator.js
@@ -0,0 +1,89 @@
+import regeneratorDefine from "./regeneratorDefine.js";
+function _regenerator() {
+  /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
+  var e,
+    t,
+    r = "function" == typeof Symbol ? Symbol : {},
+    n = r.iterator || "@@iterator",
+    o = r.toStringTag || "@@toStringTag";
+  function i(r, n, o, i) {
+    var c = n && n.prototype instanceof Generator ? n : Generator,
+      u = Object.create(c.prototype);
+    return regeneratorDefine(u, "_invoke", function (r, n, o) {
+      var i,
+        c,
+        u,
+        f = 0,
+        p = o || [],
+        y = !1,
+        G = {
+          p: 0,
+          n: 0,
+          v: e,
+          a: d,
+          f: d.bind(e, 4),
+          d: function d(t, r) {
+            return i = t, c = 0, u = e, G.n = r, a;
+          }
+        };
+      function d(r, n) {
+        for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
+          var o,
+            i = p[t],
+            d = G.p,
+            l = i[2];
+          r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0));
+        }
+        if (o || r > 1) return a;
+        throw y = !0, n;
+      }
+      return function (o, p, l) {
+        if (f > 1) throw TypeError("Generator is already running");
+        for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
+          i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
+          try {
+            if (f = 2, i) {
+              if (c || (o = "next"), t = i[o]) {
+                if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
+                if (!t.done) return t;
+                u = t.value, c < 2 && (c = 0);
+              } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
+              i = e;
+            } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
+          } catch (t) {
+            i = e, c = 1, u = t;
+          } finally {
+            f = 1;
+          }
+        }
+        return {
+          value: t,
+          done: y
+        };
+      };
+    }(r, o, i), !0), u;
+  }
+  var a = {};
+  function Generator() {}
+  function GeneratorFunction() {}
+  function GeneratorFunctionPrototype() {}
+  t = Object.getPrototypeOf;
+  var c = [][n] ? t(t([][n]())) : (regeneratorDefine(t = {}, n, function () {
+      return this;
+    }), t),
+    u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
+  function f(e) {
+    return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
+  }
+  return GeneratorFunction.prototype = GeneratorFunctionPrototype, regeneratorDefine(u, "constructor", GeneratorFunctionPrototype), regeneratorDefine(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", regeneratorDefine(GeneratorFunctionPrototype, o, "GeneratorFunction"), regeneratorDefine(u), regeneratorDefine(u, o, "Generator"), regeneratorDefine(u, n, function () {
+    return this;
+  }), regeneratorDefine(u, "toString", function () {
+    return "[object Generator]";
+  }), (_regenerator = function _regenerator() {
+    return {
+      w: i,
+      m: f
+    };
+  })();
+}
+export { _regenerator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorAsync.js b/node_modules/@babel/runtime/helpers/esm/regeneratorAsync.js
new file mode 100644
index 0000000..f73d4e6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorAsync.js
@@ -0,0 +1,8 @@
+import regeneratorAsyncGen from "./regeneratorAsyncGen.js";
+function _regeneratorAsync(n, e, r, t, o) {
+  var a = regeneratorAsyncGen(n, e, r, t, o);
+  return a.next().then(function (n) {
+    return n.done ? n.value : a.next();
+  });
+}
+export { _regeneratorAsync as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncGen.js b/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncGen.js
new file mode 100644
index 0000000..1932bcd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncGen.js
@@ -0,0 +1,6 @@
+import regenerator from "./regenerator.js";
+import regeneratorAsyncIterator from "./regeneratorAsyncIterator.js";
+function _regeneratorAsyncGen(r, e, t, o, n) {
+  return new regeneratorAsyncIterator(regenerator().w(r, e, t, o), n || Promise);
+}
+export { _regeneratorAsyncGen as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncIterator.js b/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncIterator.js
new file mode 100644
index 0000000..90d84cc
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorAsyncIterator.js
@@ -0,0 +1,33 @@
+import OverloadYield from "./OverloadYield.js";
+import regeneratorDefine from "./regeneratorDefine.js";
+function AsyncIterator(t, e) {
+  function n(r, o, i, f) {
+    try {
+      var c = t[r](o),
+        u = c.value;
+      return u instanceof OverloadYield ? e.resolve(u.v).then(function (t) {
+        n("next", t, i, f);
+      }, function (t) {
+        n("throw", t, i, f);
+      }) : e.resolve(u).then(function (t) {
+        c.value = t, i(c);
+      }, function (t) {
+        return n("throw", t, i, f);
+      });
+    } catch (t) {
+      f(t);
+    }
+  }
+  var r;
+  this.next || (regeneratorDefine(AsyncIterator.prototype), regeneratorDefine(AsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
+    return this;
+  })), regeneratorDefine(this, "_invoke", function (t, o, i) {
+    function f() {
+      return new e(function (e, r) {
+        n(t, i, e, r);
+      });
+    }
+    return r = r ? r.then(f, f) : f();
+  }, !0);
+}
+export { AsyncIterator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorDefine.js b/node_modules/@babel/runtime/helpers/esm/regeneratorDefine.js
new file mode 100644
index 0000000..7140470
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorDefine.js
@@ -0,0 +1,22 @@
+function _regeneratorDefine(e, r, n, t) {
+  var i = Object.defineProperty;
+  try {
+    i({}, "", {});
+  } catch (e) {
+    i = 0;
+  }
+  _regeneratorDefine = function regeneratorDefine(e, r, n, t) {
+    function o(r, n) {
+      _regeneratorDefine(e, r, function (e) {
+        return this._invoke(r, n, e);
+      });
+    }
+    r ? i ? i(e, r, {
+      value: n,
+      enumerable: !t,
+      configurable: !t,
+      writable: !t
+    }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
+  }, _regeneratorDefine(e, r, n, t);
+}
+export { _regeneratorDefine as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorKeys.js b/node_modules/@babel/runtime/helpers/esm/regeneratorKeys.js
new file mode 100644
index 0000000..5d0d48b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorKeys.js
@@ -0,0 +1,10 @@
+function _regeneratorKeys(e) {
+  var n = Object(e),
+    r = [];
+  for (var t in n) r.unshift(t);
+  return function e() {
+    for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
+    return e.done = !0, e;
+  };
+}
+export { _regeneratorKeys as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorRuntime.js b/node_modules/@babel/runtime/helpers/esm/regeneratorRuntime.js
new file mode 100644
index 0000000..3350188
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorRuntime.js
@@ -0,0 +1,77 @@
+import OverloadYield from "./OverloadYield.js";
+import regenerator from "./regenerator.js";
+import regeneratorAsync from "./regeneratorAsync.js";
+import regeneratorAsyncGen from "./regeneratorAsyncGen.js";
+import regeneratorAsyncIterator from "./regeneratorAsyncIterator.js";
+import regeneratorKeys from "./regeneratorKeys.js";
+import regeneratorValues from "./regeneratorValues.js";
+function _regeneratorRuntime() {
+  "use strict";
+
+  var r = regenerator(),
+    e = r.m(_regeneratorRuntime),
+    t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
+  function n(r) {
+    var e = "function" == typeof r && r.constructor;
+    return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
+  }
+  var o = {
+    "throw": 1,
+    "return": 2,
+    "break": 3,
+    "continue": 3
+  };
+  function a(r) {
+    var e, t;
+    return function (n) {
+      e || (e = {
+        stop: function stop() {
+          return t(n.a, 2);
+        },
+        "catch": function _catch() {
+          return n.v;
+        },
+        abrupt: function abrupt(r, e) {
+          return t(n.a, o[r], e);
+        },
+        delegateYield: function delegateYield(r, o, a) {
+          return e.resultName = o, t(n.d, regeneratorValues(r), a);
+        },
+        finish: function finish(r) {
+          return t(n.f, r);
+        }
+      }, t = function t(r, _t, o) {
+        n.p = e.prev, n.n = e.next;
+        try {
+          return r(_t, o);
+        } finally {
+          e.next = n.n;
+        }
+      }), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
+      try {
+        return r.call(this, e);
+      } finally {
+        n.p = e.prev, n.n = e.next;
+      }
+    };
+  }
+  return (_regeneratorRuntime = function _regeneratorRuntime() {
+    return {
+      wrap: function wrap(e, t, n, o) {
+        return r.w(a(e), t, n, o && o.reverse());
+      },
+      isGeneratorFunction: n,
+      mark: r.m,
+      awrap: function awrap(r, e) {
+        return new OverloadYield(r, e);
+      },
+      AsyncIterator: regeneratorAsyncIterator,
+      async: function async(r, e, t, o, u) {
+        return (n(e) ? regeneratorAsyncGen : regeneratorAsync)(a(r), e, t, o, u);
+      },
+      keys: regeneratorKeys,
+      values: regeneratorValues
+    };
+  })();
+}
+export { _regeneratorRuntime as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/regeneratorValues.js b/node_modules/@babel/runtime/helpers/esm/regeneratorValues.js
new file mode 100644
index 0000000..9996852
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/regeneratorValues.js
@@ -0,0 +1,19 @@
+import _typeof from "./typeof.js";
+function _regeneratorValues(e) {
+  if (null != e) {
+    var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
+      r = 0;
+    if (t) return t.call(e);
+    if ("function" == typeof e.next) return e;
+    if (!isNaN(e.length)) return {
+      next: function next() {
+        return e && r >= e.length && (e = void 0), {
+          value: e && e[r++],
+          done: !e
+        };
+      }
+    };
+  }
+  throw new TypeError(_typeof(e) + " is not iterable");
+}
+export { _regeneratorValues as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/set.js b/node_modules/@babel/runtime/helpers/esm/set.js
new file mode 100644
index 0000000..ed0a803
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/set.js
@@ -0,0 +1,22 @@
+import superPropBase from "./superPropBase.js";
+import defineProperty from "./defineProperty.js";
+function set(e, r, t, o) {
+  return set = "undefined" != typeof Reflect && Reflect.set ? Reflect.set : function (e, r, t, o) {
+    var f,
+      i = superPropBase(e, r);
+    if (i) {
+      if ((f = Object.getOwnPropertyDescriptor(i, r)).set) return f.set.call(o, t), !0;
+      if (!f.writable) return !1;
+    }
+    if (f = Object.getOwnPropertyDescriptor(o, r)) {
+      if (!f.writable) return !1;
+      f.value = t, Object.defineProperty(o, r, f);
+    } else defineProperty(o, r, t);
+    return !0;
+  }, set(e, r, t, o);
+}
+function _set(e, r, t, o, f) {
+  if (!set(e, r, t, o || e) && f) throw new TypeError("failed to set property");
+  return t;
+}
+export { _set as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/setFunctionName.js b/node_modules/@babel/runtime/helpers/esm/setFunctionName.js
new file mode 100644
index 0000000..82213ce
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/setFunctionName.js
@@ -0,0 +1,12 @@
+import _typeof from "./typeof.js";
+function setFunctionName(e, t, n) {
+  "symbol" == _typeof(t) && (t = (t = t.description) ? "[" + t + "]" : "");
+  try {
+    Object.defineProperty(e, "name", {
+      configurable: !0,
+      value: n ? n + " " + t : t
+    });
+  } catch (e) {}
+  return e;
+}
+export { setFunctionName as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js b/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js
new file mode 100644
index 0000000..c30983c
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js
@@ -0,0 +1,6 @@
+function _setPrototypeOf(t, e) {
+  return _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
+    return t.__proto__ = e, t;
+  }, _setPrototypeOf(t, e);
+}
+export { _setPrototypeOf as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js b/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js
new file mode 100644
index 0000000..41d5738
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/skipFirstGeneratorNext.js
@@ -0,0 +1,7 @@
+function _skipFirstGeneratorNext(t) {
+  return function () {
+    var r = t.apply(this, arguments);
+    return r.next(), r;
+  };
+}
+export { _skipFirstGeneratorNext as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/slicedToArray.js b/node_modules/@babel/runtime/helpers/esm/slicedToArray.js
new file mode 100644
index 0000000..c044c2a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/slicedToArray.js
@@ -0,0 +1,8 @@
+import arrayWithHoles from "./arrayWithHoles.js";
+import iterableToArrayLimit from "./iterableToArrayLimit.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableRest from "./nonIterableRest.js";
+function _slicedToArray(r, e) {
+  return arrayWithHoles(r) || iterableToArrayLimit(r, e) || unsupportedIterableToArray(r, e) || nonIterableRest();
+}
+export { _slicedToArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/superPropBase.js b/node_modules/@babel/runtime/helpers/esm/superPropBase.js
new file mode 100644
index 0000000..a5fa386
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/superPropBase.js
@@ -0,0 +1,6 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+function _superPropBase(t, o) {
+  for (; !{}.hasOwnProperty.call(t, o) && null !== (t = getPrototypeOf(t)););
+  return t;
+}
+export { _superPropBase as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/superPropGet.js b/node_modules/@babel/runtime/helpers/esm/superPropGet.js
new file mode 100644
index 0000000..b2b60a8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/superPropGet.js
@@ -0,0 +1,9 @@
+import get from "./get.js";
+import getPrototypeOf from "./getPrototypeOf.js";
+function _superPropGet(t, o, e, r) {
+  var p = get(getPrototypeOf(1 & r ? t.prototype : t), o, e);
+  return 2 & r && "function" == typeof p ? function (t) {
+    return p.apply(e, t);
+  } : p;
+}
+export { _superPropGet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/superPropSet.js b/node_modules/@babel/runtime/helpers/esm/superPropSet.js
new file mode 100644
index 0000000..e182f38
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/superPropSet.js
@@ -0,0 +1,6 @@
+import set from "./set.js";
+import getPrototypeOf from "./getPrototypeOf.js";
+function _superPropSet(t, e, o, r, p, f) {
+  return set(getPrototypeOf(f ? t.prototype : t), e, o, r, p);
+}
+export { _superPropSet as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js
new file mode 100644
index 0000000..3d842cd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteral.js
@@ -0,0 +1,8 @@
+function _taggedTemplateLiteral(e, t) {
+  return t || (t = e.slice(0)), Object.freeze(Object.defineProperties(e, {
+    raw: {
+      value: Object.freeze(t)
+    }
+  }));
+}
+export { _taggedTemplateLiteral as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js
new file mode 100644
index 0000000..741aeb8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/taggedTemplateLiteralLoose.js
@@ -0,0 +1,4 @@
+function _taggedTemplateLiteralLoose(e, t) {
+  return t || (t = e.slice(0)), e.raw = t, e;
+}
+export { _taggedTemplateLiteralLoose as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/tdz.js b/node_modules/@babel/runtime/helpers/esm/tdz.js
new file mode 100644
index 0000000..58df493
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/tdz.js
@@ -0,0 +1,4 @@
+function _tdzError(e) {
+  throw new ReferenceError(e + " is not defined - temporal dead zone");
+}
+export { _tdzError as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/temporalRef.js b/node_modules/@babel/runtime/helpers/esm/temporalRef.js
new file mode 100644
index 0000000..8dbf014
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/temporalRef.js
@@ -0,0 +1,6 @@
+import temporalUndefined from "./temporalUndefined.js";
+import tdz from "./tdz.js";
+function _temporalRef(r, e) {
+  return r === temporalUndefined ? tdz(e) : r;
+}
+export { _temporalRef as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js b/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js
new file mode 100644
index 0000000..2ec0b0d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/temporalUndefined.js
@@ -0,0 +1,2 @@
+function _temporalUndefined() {}
+export { _temporalUndefined as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toArray.js b/node_modules/@babel/runtime/helpers/esm/toArray.js
new file mode 100644
index 0000000..e5f0f52
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toArray.js
@@ -0,0 +1,8 @@
+import arrayWithHoles from "./arrayWithHoles.js";
+import iterableToArray from "./iterableToArray.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableRest from "./nonIterableRest.js";
+function _toArray(r) {
+  return arrayWithHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableRest();
+}
+export { _toArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js b/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js
new file mode 100644
index 0000000..f7338e4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toConsumableArray.js
@@ -0,0 +1,8 @@
+import arrayWithoutHoles from "./arrayWithoutHoles.js";
+import iterableToArray from "./iterableToArray.js";
+import unsupportedIterableToArray from "./unsupportedIterableToArray.js";
+import nonIterableSpread from "./nonIterableSpread.js";
+function _toConsumableArray(r) {
+  return arrayWithoutHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableSpread();
+}
+export { _toConsumableArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toPrimitive.js b/node_modules/@babel/runtime/helpers/esm/toPrimitive.js
new file mode 100644
index 0000000..9a3de46
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toPrimitive.js
@@ -0,0 +1,12 @@
+import _typeof from "./typeof.js";
+function toPrimitive(t, r) {
+  if ("object" != _typeof(t) || !t) return t;
+  var e = t[Symbol.toPrimitive];
+  if (void 0 !== e) {
+    var i = e.call(t, r || "default");
+    if ("object" != _typeof(i)) return i;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return ("string" === r ? String : Number)(t);
+}
+export { toPrimitive as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js b/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
new file mode 100644
index 0000000..b3274d8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js
@@ -0,0 +1,7 @@
+import _typeof from "./typeof.js";
+import toPrimitive from "./toPrimitive.js";
+function toPropertyKey(t) {
+  var i = toPrimitive(t, "string");
+  return "symbol" == _typeof(i) ? i : i + "";
+}
+export { toPropertyKey as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/toSetter.js b/node_modules/@babel/runtime/helpers/esm/toSetter.js
new file mode 100644
index 0000000..b1dbf7a
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/toSetter.js
@@ -0,0 +1,10 @@
+function _toSetter(t, e, n) {
+  e || (e = []);
+  var r = e.length++;
+  return Object.defineProperty({}, "_", {
+    set: function set(o) {
+      e[r] = o, t.apply(n, e);
+    }
+  });
+}
+export { _toSetter as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/tsRewriteRelativeImportExtensions.js b/node_modules/@babel/runtime/helpers/esm/tsRewriteRelativeImportExtensions.js
new file mode 100644
index 0000000..28ffc0b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/tsRewriteRelativeImportExtensions.js
@@ -0,0 +1,6 @@
+function tsRewriteRelativeImportExtensions(t, e) {
+  return "string" == typeof t && /^\.\.?\//.test(t) ? t.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+)?)\.([cm]?)ts$/i, function (t, s, r, n, o) {
+    return s ? e ? ".jsx" : ".js" : !r || n && o ? r + n + "." + o.toLowerCase() + "js" : t;
+  }) : t;
+}
+export { tsRewriteRelativeImportExtensions as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/typeof.js b/node_modules/@babel/runtime/helpers/esm/typeof.js
new file mode 100644
index 0000000..5b0bc9b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/typeof.js
@@ -0,0 +1,10 @@
+function _typeof(o) {
+  "@babel/helpers - typeof";
+
+  return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
+    return typeof o;
+  } : function (o) {
+    return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
+  }, _typeof(o);
+}
+export { _typeof as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js b/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js
new file mode 100644
index 0000000..33adc49
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js
@@ -0,0 +1,9 @@
+import arrayLikeToArray from "./arrayLikeToArray.js";
+function _unsupportedIterableToArray(r, a) {
+  if (r) {
+    if ("string" == typeof r) return arrayLikeToArray(r, a);
+    var t = {}.toString.call(r).slice(8, -1);
+    return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? arrayLikeToArray(r, a) : void 0;
+  }
+}
+export { _unsupportedIterableToArray as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/using.js b/node_modules/@babel/runtime/helpers/esm/using.js
new file mode 100644
index 0000000..9bda17b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/using.js
@@ -0,0 +1,12 @@
+function _using(o, n, e) {
+  if (null == n) return n;
+  if (Object(n) !== n) throw new TypeError("using declarations can only be used with objects, functions, null, or undefined.");
+  if (e) var r = n[Symbol.asyncDispose || Symbol["for"]("Symbol.asyncDispose")];
+  if (null == r && (r = n[Symbol.dispose || Symbol["for"]("Symbol.dispose")]), "function" != typeof r) throw new TypeError("Property [Symbol.dispose] is not a function.");
+  return o.push({
+    v: n,
+    d: r,
+    a: e
+  }), n;
+}
+export { _using as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/usingCtx.js b/node_modules/@babel/runtime/helpers/esm/usingCtx.js
new file mode 100644
index 0000000..1464379
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/usingCtx.js
@@ -0,0 +1,59 @@
+function _usingCtx() {
+  var r = "function" == typeof SuppressedError ? SuppressedError : function (r, e) {
+      var n = Error();
+      return n.name = "SuppressedError", n.error = r, n.suppressed = e, n;
+    },
+    e = {},
+    n = [];
+  function using(r, e) {
+    if (null != e) {
+      if (Object(e) !== e) throw new TypeError("using declarations can only be used with objects, functions, null, or undefined.");
+      if (r) var o = e[Symbol.asyncDispose || Symbol["for"]("Symbol.asyncDispose")];
+      if (void 0 === o && (o = e[Symbol.dispose || Symbol["for"]("Symbol.dispose")], r)) var t = o;
+      if ("function" != typeof o) throw new TypeError("Object is not disposable.");
+      t && (o = function o() {
+        try {
+          t.call(e);
+        } catch (r) {
+          return Promise.reject(r);
+        }
+      }), n.push({
+        v: e,
+        d: o,
+        a: r
+      });
+    } else r && n.push({
+      d: e,
+      a: r
+    });
+    return e;
+  }
+  return {
+    e: e,
+    u: using.bind(null, !1),
+    a: using.bind(null, !0),
+    d: function d() {
+      var o,
+        t = this.e,
+        s = 0;
+      function next() {
+        for (; o = n.pop();) try {
+          if (!o.a && 1 === s) return s = 0, n.push(o), Promise.resolve().then(next);
+          if (o.d) {
+            var r = o.d.call(o.v);
+            if (o.a) return s |= 2, Promise.resolve(r).then(next, err);
+          } else s |= 1;
+        } catch (r) {
+          return err(r);
+        }
+        if (1 === s) return t !== e ? Promise.reject(t) : Promise.resolve();
+        if (t !== e) throw t;
+      }
+      function err(n) {
+        return t = t !== e ? new r(n, t) : n, next();
+      }
+      return next();
+    }
+  };
+}
+export { _usingCtx as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js b/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js
new file mode 100644
index 0000000..7957d61
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapAsyncGenerator.js
@@ -0,0 +1,56 @@
+import OverloadYield from "./OverloadYield.js";
+function _wrapAsyncGenerator(e) {
+  return function () {
+    return new AsyncGenerator(e.apply(this, arguments));
+  };
+}
+function AsyncGenerator(e) {
+  var t, n;
+  function resume(t, n) {
+    try {
+      var r = e[t](n),
+        o = r.value,
+        u = o instanceof OverloadYield;
+      Promise.resolve(u ? o.v : o).then(function (n) {
+        if (u) {
+          var i = "return" === t && o.k ? t : "next";
+          if (!o.k || n.done) return resume(i, n);
+          n = e[i](n).value;
+        }
+        settle(!!r.done, n);
+      }, function (e) {
+        resume("throw", e);
+      });
+    } catch (e) {
+      settle(2, e);
+    }
+  }
+  function settle(e, r) {
+    2 === e ? t.reject(r) : t.resolve({
+      value: r,
+      done: e
+    }), (t = t.next) ? resume(t.key, t.arg) : n = null;
+  }
+  this._invoke = function (e, r) {
+    return new Promise(function (o, u) {
+      var i = {
+        key: e,
+        arg: r,
+        resolve: o,
+        reject: u,
+        next: null
+      };
+      n ? n = n.next = i : (t = n = i, resume(e, r));
+    });
+  }, "function" != typeof e["return"] && (this["return"] = void 0);
+}
+AsyncGenerator.prototype["function" == typeof Symbol && Symbol.asyncIterator || "@@asyncIterator"] = function () {
+  return this;
+}, AsyncGenerator.prototype.next = function (e) {
+  return this._invoke("next", e);
+}, AsyncGenerator.prototype["throw"] = function (e) {
+  return this._invoke("throw", e);
+}, AsyncGenerator.prototype["return"] = function (e) {
+  return this._invoke("return", e);
+};
+export { _wrapAsyncGenerator as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js b/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js
new file mode 100644
index 0000000..15bf78f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapNativeSuper.js
@@ -0,0 +1,27 @@
+import getPrototypeOf from "./getPrototypeOf.js";
+import setPrototypeOf from "./setPrototypeOf.js";
+import isNativeFunction from "./isNativeFunction.js";
+import construct from "./construct.js";
+function _wrapNativeSuper(t) {
+  var r = "function" == typeof Map ? new Map() : void 0;
+  return _wrapNativeSuper = function _wrapNativeSuper(t) {
+    if (null === t || !isNativeFunction(t)) return t;
+    if ("function" != typeof t) throw new TypeError("Super expression must either be null or a function");
+    if (void 0 !== r) {
+      if (r.has(t)) return r.get(t);
+      r.set(t, Wrapper);
+    }
+    function Wrapper() {
+      return construct(t, arguments, getPrototypeOf(this).constructor);
+    }
+    return Wrapper.prototype = Object.create(t.prototype, {
+      constructor: {
+        value: Wrapper,
+        enumerable: !1,
+        writable: !0,
+        configurable: !0
+      }
+    }), setPrototypeOf(Wrapper, t);
+  }, _wrapNativeSuper(t);
+}
+export { _wrapNativeSuper as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js b/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js
new file mode 100644
index 0000000..c455faa
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/wrapRegExp.js
@@ -0,0 +1,52 @@
+import _typeof from "./typeof.js";
+import setPrototypeOf from "./setPrototypeOf.js";
+import inherits from "./inherits.js";
+function _wrapRegExp() {
+  _wrapRegExp = function _wrapRegExp(e, r) {
+    return new BabelRegExp(e, void 0, r);
+  };
+  var e = RegExp.prototype,
+    r = new WeakMap();
+  function BabelRegExp(e, t, p) {
+    var o = RegExp(e, t);
+    return r.set(o, p || r.get(e)), setPrototypeOf(o, BabelRegExp.prototype);
+  }
+  function buildGroups(e, t) {
+    var p = r.get(t);
+    return Object.keys(p).reduce(function (r, t) {
+      var o = p[t];
+      if ("number" == typeof o) r[t] = e[o];else {
+        for (var i = 0; void 0 === e[o[i]] && i + 1 < o.length;) i++;
+        r[t] = e[o[i]];
+      }
+      return r;
+    }, Object.create(null));
+  }
+  return inherits(BabelRegExp, RegExp), BabelRegExp.prototype.exec = function (r) {
+    var t = e.exec.call(this, r);
+    if (t) {
+      t.groups = buildGroups(t, this);
+      var p = t.indices;
+      p && (p.groups = buildGroups(p, this));
+    }
+    return t;
+  }, BabelRegExp.prototype[Symbol.replace] = function (t, p) {
+    if ("string" == typeof p) {
+      var o = r.get(this);
+      return e[Symbol.replace].call(this, t, p.replace(/\$<([^>]+)(>|$)/g, function (e, r, t) {
+        if ("" === t) return e;
+        var p = o[r];
+        return Array.isArray(p) ? "$" + p.join("$") : "number" == typeof p ? "$" + p : "";
+      }));
+    }
+    if ("function" == typeof p) {
+      var i = this;
+      return e[Symbol.replace].call(this, t, function () {
+        var e = arguments;
+        return "object" != _typeof(e[e.length - 1]) && (e = [].slice.call(e)).push(buildGroups(e, i)), p.apply(this, e);
+      });
+    }
+    return e[Symbol.replace].call(this, t, p);
+  }, _wrapRegExp.apply(this, arguments);
+}
+export { _wrapRegExp as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js b/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js
new file mode 100644
index 0000000..250c286
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/esm/writeOnlyError.js
@@ -0,0 +1,4 @@
+function _writeOnlyError(r) {
+  throw new TypeError('"' + r + '" is write-only');
+}
+export { _writeOnlyError as default };
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/extends.js b/node_modules/@babel/runtime/helpers/extends.js
new file mode 100644
index 0000000..eee4a1f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/extends.js
@@ -0,0 +1,10 @@
+function _extends() {
+  return module.exports = _extends = Object.assign ? Object.assign.bind() : function (n) {
+    for (var e = 1; e < arguments.length; e++) {
+      var t = arguments[e];
+      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);
+    }
+    return n;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _extends.apply(null, arguments);
+}
+module.exports = _extends, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/get.js b/node_modules/@babel/runtime/helpers/get.js
new file mode 100644
index 0000000..15428de
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/get.js
@@ -0,0 +1,11 @@
+var superPropBase = require("./superPropBase.js");
+function _get() {
+  return module.exports = _get = "undefined" != typeof Reflect && Reflect.get ? Reflect.get.bind() : function (e, t, r) {
+    var p = superPropBase(e, t);
+    if (p) {
+      var n = Object.getOwnPropertyDescriptor(p, t);
+      return n.get ? n.get.call(arguments.length < 3 ? e : r) : n.value;
+    }
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _get.apply(null, arguments);
+}
+module.exports = _get, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/getPrototypeOf.js b/node_modules/@babel/runtime/helpers/getPrototypeOf.js
new file mode 100644
index 0000000..9070748
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/getPrototypeOf.js
@@ -0,0 +1,6 @@
+function _getPrototypeOf(t) {
+  return module.exports = _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function (t) {
+    return t.__proto__ || Object.getPrototypeOf(t);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _getPrototypeOf(t);
+}
+module.exports = _getPrototypeOf, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/identity.js b/node_modules/@babel/runtime/helpers/identity.js
new file mode 100644
index 0000000..54de5b5
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/identity.js
@@ -0,0 +1,4 @@
+function _identity(t) {
+  return t;
+}
+module.exports = _identity, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/importDeferProxy.js b/node_modules/@babel/runtime/helpers/importDeferProxy.js
new file mode 100644
index 0000000..cffaae6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/importDeferProxy.js
@@ -0,0 +1,27 @@
+function _importDeferProxy(e) {
+  var t = null,
+    constValue = function constValue(e) {
+      return function () {
+        return e;
+      };
+    },
+    proxy = function proxy(r) {
+      return function (n, o, f) {
+        return null === t && (t = e()), r(t, o, f);
+      };
+    };
+  return new Proxy({}, {
+    defineProperty: constValue(!1),
+    deleteProperty: constValue(!1),
+    get: proxy(Reflect.get),
+    getOwnPropertyDescriptor: proxy(Reflect.getOwnPropertyDescriptor),
+    getPrototypeOf: constValue(null),
+    isExtensible: constValue(!1),
+    has: proxy(Reflect.has),
+    ownKeys: proxy(Reflect.ownKeys),
+    preventExtensions: constValue(!0),
+    set: constValue(!1),
+    setPrototypeOf: constValue(!1)
+  });
+}
+module.exports = _importDeferProxy, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/inherits.js b/node_modules/@babel/runtime/helpers/inherits.js
new file mode 100644
index 0000000..715a78e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/inherits.js
@@ -0,0 +1,14 @@
+var setPrototypeOf = require("./setPrototypeOf.js");
+function _inherits(t, e) {
+  if ("function" != typeof e && null !== e) throw new TypeError("Super expression must either be null or a function");
+  t.prototype = Object.create(e && e.prototype, {
+    constructor: {
+      value: t,
+      writable: !0,
+      configurable: !0
+    }
+  }), Object.defineProperty(t, "prototype", {
+    writable: !1
+  }), e && setPrototypeOf(t, e);
+}
+module.exports = _inherits, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/inheritsLoose.js b/node_modules/@babel/runtime/helpers/inheritsLoose.js
new file mode 100644
index 0000000..a27baf0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/inheritsLoose.js
@@ -0,0 +1,5 @@
+var setPrototypeOf = require("./setPrototypeOf.js");
+function _inheritsLoose(t, o) {
+  t.prototype = Object.create(o.prototype), t.prototype.constructor = t, setPrototypeOf(t, o);
+}
+module.exports = _inheritsLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/initializerDefineProperty.js b/node_modules/@babel/runtime/helpers/initializerDefineProperty.js
new file mode 100644
index 0000000..f9fa317
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/initializerDefineProperty.js
@@ -0,0 +1,9 @@
+function _initializerDefineProperty(e, i, r, l) {
+  r && Object.defineProperty(e, i, {
+    enumerable: r.enumerable,
+    configurable: r.configurable,
+    writable: r.writable,
+    value: r.initializer ? r.initializer.call(l) : void 0
+  });
+}
+module.exports = _initializerDefineProperty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/initializerWarningHelper.js b/node_modules/@babel/runtime/helpers/initializerWarningHelper.js
new file mode 100644
index 0000000..e14ce59
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/initializerWarningHelper.js
@@ -0,0 +1,4 @@
+function _initializerWarningHelper(r, e) {
+  throw Error("Decorating class property failed. Please ensure that transform-class-properties is enabled and runs after the decorators transform.");
+}
+module.exports = _initializerWarningHelper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/instanceof.js b/node_modules/@babel/runtime/helpers/instanceof.js
new file mode 100644
index 0000000..9952301
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/instanceof.js
@@ -0,0 +1,4 @@
+function _instanceof(n, e) {
+  return null != e && "undefined" != typeof Symbol && e[Symbol.hasInstance] ? !!e[Symbol.hasInstance](n) : n instanceof e;
+}
+module.exports = _instanceof, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/interopRequireDefault.js b/node_modules/@babel/runtime/helpers/interopRequireDefault.js
new file mode 100644
index 0000000..6944715
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/interopRequireDefault.js
@@ -0,0 +1,6 @@
+function _interopRequireDefault(e) {
+  return e && e.__esModule ? e : {
+    "default": e
+  };
+}
+module.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/interopRequireWildcard.js b/node_modules/@babel/runtime/helpers/interopRequireWildcard.js
new file mode 100644
index 0000000..d5f1054
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/interopRequireWildcard.js
@@ -0,0 +1,22 @@
+var _typeof = require("./typeof.js")["default"];
+function _interopRequireWildcard(e, t) {
+  if ("function" == typeof WeakMap) var r = new WeakMap(),
+    n = new WeakMap();
+  return (module.exports = _interopRequireWildcard = function _interopRequireWildcard(e, t) {
+    if (!t && e && e.__esModule) return e;
+    var o,
+      i,
+      f = {
+        __proto__: null,
+        "default": e
+      };
+    if (null === e || "object" != _typeof(e) && "function" != typeof e) return f;
+    if (o = t ? n : r) {
+      if (o.has(e)) return o.get(e);
+      o.set(e, f);
+    }
+    for (var _t in e) "default" !== _t && {}.hasOwnProperty.call(e, _t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, _t)) && (i.get || i.set) ? o(f, _t, i) : f[_t] = e[_t]);
+    return f;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports)(e, t);
+}
+module.exports = _interopRequireWildcard, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/isNativeFunction.js b/node_modules/@babel/runtime/helpers/isNativeFunction.js
new file mode 100644
index 0000000..f0eb49e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/isNativeFunction.js
@@ -0,0 +1,8 @@
+function _isNativeFunction(t) {
+  try {
+    return -1 !== Function.toString.call(t).indexOf("[native code]");
+  } catch (n) {
+    return "function" == typeof t;
+  }
+}
+module.exports = _isNativeFunction, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js b/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js
new file mode 100644
index 0000000..b677e10
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/isNativeReflectConstruct.js
@@ -0,0 +1,9 @@
+function _isNativeReflectConstruct() {
+  try {
+    var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+  } catch (t) {}
+  return (module.exports = _isNativeReflectConstruct = function _isNativeReflectConstruct() {
+    return !!t;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports)();
+}
+module.exports = _isNativeReflectConstruct, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/iterableToArray.js b/node_modules/@babel/runtime/helpers/iterableToArray.js
new file mode 100644
index 0000000..c839a32
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/iterableToArray.js
@@ -0,0 +1,4 @@
+function _iterableToArray(r) {
+  if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
+}
+module.exports = _iterableToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js b/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js
new file mode 100644
index 0000000..2671778
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/iterableToArrayLimit.js
@@ -0,0 +1,28 @@
+function _iterableToArrayLimit(r, l) {
+  var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (null != t) {
+    var e,
+      n,
+      i,
+      u,
+      a = [],
+      f = !0,
+      o = !1;
+    try {
+      if (i = (t = t.call(r)).next, 0 === l) {
+        if (Object(t) !== t) return;
+        f = !1;
+      } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
+    } catch (r) {
+      o = !0, n = r;
+    } finally {
+      try {
+        if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return;
+      } finally {
+        if (o) throw n;
+      }
+    }
+    return a;
+  }
+}
+module.exports = _iterableToArrayLimit, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/jsx.js b/node_modules/@babel/runtime/helpers/jsx.js
new file mode 100644
index 0000000..3415eea
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/jsx.js
@@ -0,0 +1,22 @@
+var REACT_ELEMENT_TYPE;
+function _createRawReactElement(e, r, E, l) {
+  REACT_ELEMENT_TYPE || (REACT_ELEMENT_TYPE = "function" == typeof Symbol && Symbol["for"] && Symbol["for"]("react.element") || 60103);
+  var o = e && e.defaultProps,
+    n = arguments.length - 3;
+  if (r || 0 === n || (r = {
+    children: void 0
+  }), 1 === n) r.children = l;else if (n > 1) {
+    for (var t = Array(n), f = 0; f < n; f++) t[f] = arguments[f + 3];
+    r.children = t;
+  }
+  if (r && o) for (var i in o) void 0 === r[i] && (r[i] = o[i]);else r || (r = o || {});
+  return {
+    $$typeof: REACT_ELEMENT_TYPE,
+    type: e,
+    key: void 0 === E ? null : "" + E,
+    ref: null,
+    props: r,
+    _owner: null
+  };
+}
+module.exports = _createRawReactElement, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/maybeArrayLike.js b/node_modules/@babel/runtime/helpers/maybeArrayLike.js
new file mode 100644
index 0000000..9873cc7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/maybeArrayLike.js
@@ -0,0 +1,9 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+function _maybeArrayLike(r, a, e) {
+  if (a && !Array.isArray(a) && "number" == typeof a.length) {
+    var y = a.length;
+    return arrayLikeToArray(a, void 0 !== e && e < y ? e : y);
+  }
+  return r(a, e);
+}
+module.exports = _maybeArrayLike, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/newArrowCheck.js b/node_modules/@babel/runtime/helpers/newArrowCheck.js
new file mode 100644
index 0000000..8e74d99
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/newArrowCheck.js
@@ -0,0 +1,4 @@
+function _newArrowCheck(n, r) {
+  if (n !== r) throw new TypeError("Cannot instantiate an arrow function");
+}
+module.exports = _newArrowCheck, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/nonIterableRest.js b/node_modules/@babel/runtime/helpers/nonIterableRest.js
new file mode 100644
index 0000000..95265ba
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/nonIterableRest.js
@@ -0,0 +1,4 @@
+function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+module.exports = _nonIterableRest, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/nonIterableSpread.js b/node_modules/@babel/runtime/helpers/nonIterableSpread.js
new file mode 100644
index 0000000..3fcf23f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/nonIterableSpread.js
@@ -0,0 +1,4 @@
+function _nonIterableSpread() {
+  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+module.exports = _nonIterableSpread, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/nullishReceiverError.js b/node_modules/@babel/runtime/helpers/nullishReceiverError.js
new file mode 100644
index 0000000..970e023
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/nullishReceiverError.js
@@ -0,0 +1,4 @@
+function _nullishReceiverError(r) {
+  throw new TypeError("Cannot set property of null or undefined.");
+}
+module.exports = _nullishReceiverError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js b/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js
new file mode 100644
index 0000000..9f62a1b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectDestructuringEmpty.js
@@ -0,0 +1,4 @@
+function _objectDestructuringEmpty(t) {
+  if (null == t) throw new TypeError("Cannot destructure " + t);
+}
+module.exports = _objectDestructuringEmpty, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectSpread.js b/node_modules/@babel/runtime/helpers/objectSpread.js
new file mode 100644
index 0000000..a367643
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectSpread.js
@@ -0,0 +1,14 @@
+var defineProperty = require("./defineProperty.js");
+function _objectSpread(e) {
+  for (var r = 1; r < arguments.length; r++) {
+    var t = null != arguments[r] ? Object(arguments[r]) : {},
+      o = Object.keys(t);
+    "function" == typeof Object.getOwnPropertySymbols && o.push.apply(o, Object.getOwnPropertySymbols(t).filter(function (e) {
+      return Object.getOwnPropertyDescriptor(t, e).enumerable;
+    })), o.forEach(function (r) {
+      defineProperty(e, r, t[r]);
+    });
+  }
+  return e;
+}
+module.exports = _objectSpread, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectSpread2.js b/node_modules/@babel/runtime/helpers/objectSpread2.js
new file mode 100644
index 0000000..4f3b9fa
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectSpread2.js
@@ -0,0 +1,23 @@
+var defineProperty = require("./defineProperty.js");
+function ownKeys(e, r) {
+  var t = Object.keys(e);
+  if (Object.getOwnPropertySymbols) {
+    var o = Object.getOwnPropertySymbols(e);
+    r && (o = o.filter(function (r) {
+      return Object.getOwnPropertyDescriptor(e, r).enumerable;
+    })), t.push.apply(t, o);
+  }
+  return t;
+}
+function _objectSpread2(e) {
+  for (var r = 1; r < arguments.length; r++) {
+    var t = null != arguments[r] ? arguments[r] : {};
+    r % 2 ? ownKeys(Object(t), !0).forEach(function (r) {
+      defineProperty(e, r, t[r]);
+    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
+      Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
+    });
+  }
+  return e;
+}
+module.exports = _objectSpread2, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectWithoutProperties.js b/node_modules/@babel/runtime/helpers/objectWithoutProperties.js
new file mode 100644
index 0000000..3a40f9e
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectWithoutProperties.js
@@ -0,0 +1,13 @@
+var objectWithoutPropertiesLoose = require("./objectWithoutPropertiesLoose.js");
+function _objectWithoutProperties(e, t) {
+  if (null == e) return {};
+  var o,
+    r,
+    i = objectWithoutPropertiesLoose(e, t);
+  if (Object.getOwnPropertySymbols) {
+    var n = Object.getOwnPropertySymbols(e);
+    for (r = 0; r < n.length; r++) o = n[r], -1 === t.indexOf(o) && {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
+  }
+  return i;
+}
+module.exports = _objectWithoutProperties, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js b/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js
new file mode 100644
index 0000000..c243acd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/objectWithoutPropertiesLoose.js
@@ -0,0 +1,10 @@
+function _objectWithoutPropertiesLoose(r, e) {
+  if (null == r) return {};
+  var t = {};
+  for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
+    if (-1 !== e.indexOf(n)) continue;
+    t[n] = r[n];
+  }
+  return t;
+}
+module.exports = _objectWithoutPropertiesLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js b/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js
new file mode 100644
index 0000000..06e6e6d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/possibleConstructorReturn.js
@@ -0,0 +1,8 @@
+var _typeof = require("./typeof.js")["default"];
+var assertThisInitialized = require("./assertThisInitialized.js");
+function _possibleConstructorReturn(t, e) {
+  if (e && ("object" == _typeof(e) || "function" == typeof e)) return e;
+  if (void 0 !== e) throw new TypeError("Derived constructors may only return object or undefined");
+  return assertThisInitialized(t);
+}
+module.exports = _possibleConstructorReturn, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/readOnlyError.js b/node_modules/@babel/runtime/helpers/readOnlyError.js
new file mode 100644
index 0000000..1bf3e09
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/readOnlyError.js
@@ -0,0 +1,4 @@
+function _readOnlyError(r) {
+  throw new TypeError('"' + r + '" is read-only');
+}
+module.exports = _readOnlyError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regenerator.js b/node_modules/@babel/runtime/helpers/regenerator.js
new file mode 100644
index 0000000..0cf8710
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regenerator.js
@@ -0,0 +1,89 @@
+var regeneratorDefine = require("./regeneratorDefine.js");
+function _regenerator() {
+  /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/babel/babel/blob/main/packages/babel-helpers/LICENSE */
+  var e,
+    t,
+    r = "function" == typeof Symbol ? Symbol : {},
+    n = r.iterator || "@@iterator",
+    o = r.toStringTag || "@@toStringTag";
+  function i(r, n, o, i) {
+    var c = n && n.prototype instanceof Generator ? n : Generator,
+      u = Object.create(c.prototype);
+    return regeneratorDefine(u, "_invoke", function (r, n, o) {
+      var i,
+        c,
+        u,
+        f = 0,
+        p = o || [],
+        y = !1,
+        G = {
+          p: 0,
+          n: 0,
+          v: e,
+          a: d,
+          f: d.bind(e, 4),
+          d: function d(t, r) {
+            return i = t, c = 0, u = e, G.n = r, a;
+          }
+        };
+      function d(r, n) {
+        for (c = r, u = n, t = 0; !y && f && !o && t < p.length; t++) {
+          var o,
+            i = p[t],
+            d = G.p,
+            l = i[2];
+          r > 3 ? (o = l === n) && (u = i[(c = i[4]) ? 5 : (c = 3, 3)], i[4] = i[5] = e) : i[0] <= d && ((o = r < 2 && d < i[1]) ? (c = 0, G.v = n, G.n = i[1]) : d < l && (o = r < 3 || i[0] > n || n > l) && (i[4] = r, i[5] = n, G.n = l, c = 0));
+        }
+        if (o || r > 1) return a;
+        throw y = !0, n;
+      }
+      return function (o, p, l) {
+        if (f > 1) throw TypeError("Generator is already running");
+        for (y && 1 === p && d(p, l), c = p, u = l; (t = c < 2 ? e : u) || !y;) {
+          i || (c ? c < 3 ? (c > 1 && (G.n = -1), d(c, u)) : G.n = u : G.v = u);
+          try {
+            if (f = 2, i) {
+              if (c || (o = "next"), t = i[o]) {
+                if (!(t = t.call(i, u))) throw TypeError("iterator result is not an object");
+                if (!t.done) return t;
+                u = t.value, c < 2 && (c = 0);
+              } else 1 === c && (t = i["return"]) && t.call(i), c < 2 && (u = TypeError("The iterator does not provide a '" + o + "' method"), c = 1);
+              i = e;
+            } else if ((t = (y = G.n < 0) ? u : r.call(n, G)) !== a) break;
+          } catch (t) {
+            i = e, c = 1, u = t;
+          } finally {
+            f = 1;
+          }
+        }
+        return {
+          value: t,
+          done: y
+        };
+      };
+    }(r, o, i), !0), u;
+  }
+  var a = {};
+  function Generator() {}
+  function GeneratorFunction() {}
+  function GeneratorFunctionPrototype() {}
+  t = Object.getPrototypeOf;
+  var c = [][n] ? t(t([][n]())) : (regeneratorDefine(t = {}, n, function () {
+      return this;
+    }), t),
+    u = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(c);
+  function f(e) {
+    return Object.setPrototypeOf ? Object.setPrototypeOf(e, GeneratorFunctionPrototype) : (e.__proto__ = GeneratorFunctionPrototype, regeneratorDefine(e, o, "GeneratorFunction")), e.prototype = Object.create(u), e;
+  }
+  return GeneratorFunction.prototype = GeneratorFunctionPrototype, regeneratorDefine(u, "constructor", GeneratorFunctionPrototype), regeneratorDefine(GeneratorFunctionPrototype, "constructor", GeneratorFunction), GeneratorFunction.displayName = "GeneratorFunction", regeneratorDefine(GeneratorFunctionPrototype, o, "GeneratorFunction"), regeneratorDefine(u), regeneratorDefine(u, o, "Generator"), regeneratorDefine(u, n, function () {
+    return this;
+  }), regeneratorDefine(u, "toString", function () {
+    return "[object Generator]";
+  }), (module.exports = _regenerator = function _regenerator() {
+    return {
+      w: i,
+      m: f
+    };
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports)();
+}
+module.exports = _regenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorAsync.js b/node_modules/@babel/runtime/helpers/regeneratorAsync.js
new file mode 100644
index 0000000..d1e4c3f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorAsync.js
@@ -0,0 +1,8 @@
+var regeneratorAsyncGen = require("./regeneratorAsyncGen.js");
+function _regeneratorAsync(n, e, r, t, o) {
+  var a = regeneratorAsyncGen(n, e, r, t, o);
+  return a.next().then(function (n) {
+    return n.done ? n.value : a.next();
+  });
+}
+module.exports = _regeneratorAsync, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorAsyncGen.js b/node_modules/@babel/runtime/helpers/regeneratorAsyncGen.js
new file mode 100644
index 0000000..f0212e3
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorAsyncGen.js
@@ -0,0 +1,6 @@
+var regenerator = require("./regenerator.js");
+var regeneratorAsyncIterator = require("./regeneratorAsyncIterator.js");
+function _regeneratorAsyncGen(r, e, t, o, n) {
+  return new regeneratorAsyncIterator(regenerator().w(r, e, t, o), n || Promise);
+}
+module.exports = _regeneratorAsyncGen, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorAsyncIterator.js b/node_modules/@babel/runtime/helpers/regeneratorAsyncIterator.js
new file mode 100644
index 0000000..afcb060
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorAsyncIterator.js
@@ -0,0 +1,33 @@
+var OverloadYield = require("./OverloadYield.js");
+var regeneratorDefine = require("./regeneratorDefine.js");
+function AsyncIterator(t, e) {
+  function n(r, o, i, f) {
+    try {
+      var c = t[r](o),
+        u = c.value;
+      return u instanceof OverloadYield ? e.resolve(u.v).then(function (t) {
+        n("next", t, i, f);
+      }, function (t) {
+        n("throw", t, i, f);
+      }) : e.resolve(u).then(function (t) {
+        c.value = t, i(c);
+      }, function (t) {
+        return n("throw", t, i, f);
+      });
+    } catch (t) {
+      f(t);
+    }
+  }
+  var r;
+  this.next || (regeneratorDefine(AsyncIterator.prototype), regeneratorDefine(AsyncIterator.prototype, "function" == typeof Symbol && Symbol.asyncIterator || "@asyncIterator", function () {
+    return this;
+  })), regeneratorDefine(this, "_invoke", function (t, o, i) {
+    function f() {
+      return new e(function (e, r) {
+        n(t, i, e, r);
+      });
+    }
+    return r = r ? r.then(f, f) : f();
+  }, !0);
+}
+module.exports = AsyncIterator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorDefine.js b/node_modules/@babel/runtime/helpers/regeneratorDefine.js
new file mode 100644
index 0000000..8d7ffe0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorDefine.js
@@ -0,0 +1,22 @@
+function _regeneratorDefine(e, r, n, t) {
+  var i = Object.defineProperty;
+  try {
+    i({}, "", {});
+  } catch (e) {
+    i = 0;
+  }
+  module.exports = _regeneratorDefine = function regeneratorDefine(e, r, n, t) {
+    function o(r, n) {
+      _regeneratorDefine(e, r, function (e) {
+        return this._invoke(r, n, e);
+      });
+    }
+    r ? i ? i(e, r, {
+      value: n,
+      enumerable: !t,
+      configurable: !t,
+      writable: !t
+    }) : e[r] = n : (o("next", 0), o("throw", 1), o("return", 2));
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _regeneratorDefine(e, r, n, t);
+}
+module.exports = _regeneratorDefine, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorKeys.js b/node_modules/@babel/runtime/helpers/regeneratorKeys.js
new file mode 100644
index 0000000..99442bd
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorKeys.js
@@ -0,0 +1,10 @@
+function _regeneratorKeys(e) {
+  var n = Object(e),
+    r = [];
+  for (var t in n) r.unshift(t);
+  return function e() {
+    for (; r.length;) if ((t = r.pop()) in n) return e.value = t, e.done = !1, e;
+    return e.done = !0, e;
+  };
+}
+module.exports = _regeneratorKeys, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorRuntime.js b/node_modules/@babel/runtime/helpers/regeneratorRuntime.js
new file mode 100644
index 0000000..24baaa0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorRuntime.js
@@ -0,0 +1,77 @@
+var OverloadYield = require("./OverloadYield.js");
+var regenerator = require("./regenerator.js");
+var regeneratorAsync = require("./regeneratorAsync.js");
+var regeneratorAsyncGen = require("./regeneratorAsyncGen.js");
+var regeneratorAsyncIterator = require("./regeneratorAsyncIterator.js");
+var regeneratorKeys = require("./regeneratorKeys.js");
+var regeneratorValues = require("./regeneratorValues.js");
+function _regeneratorRuntime() {
+  "use strict";
+
+  var r = regenerator(),
+    e = r.m(_regeneratorRuntime),
+    t = (Object.getPrototypeOf ? Object.getPrototypeOf(e) : e.__proto__).constructor;
+  function n(r) {
+    var e = "function" == typeof r && r.constructor;
+    return !!e && (e === t || "GeneratorFunction" === (e.displayName || e.name));
+  }
+  var o = {
+    "throw": 1,
+    "return": 2,
+    "break": 3,
+    "continue": 3
+  };
+  function a(r) {
+    var e, t;
+    return function (n) {
+      e || (e = {
+        stop: function stop() {
+          return t(n.a, 2);
+        },
+        "catch": function _catch() {
+          return n.v;
+        },
+        abrupt: function abrupt(r, e) {
+          return t(n.a, o[r], e);
+        },
+        delegateYield: function delegateYield(r, o, a) {
+          return e.resultName = o, t(n.d, regeneratorValues(r), a);
+        },
+        finish: function finish(r) {
+          return t(n.f, r);
+        }
+      }, t = function t(r, _t, o) {
+        n.p = e.prev, n.n = e.next;
+        try {
+          return r(_t, o);
+        } finally {
+          e.next = n.n;
+        }
+      }), e.resultName && (e[e.resultName] = n.v, e.resultName = void 0), e.sent = n.v, e.next = n.n;
+      try {
+        return r.call(this, e);
+      } finally {
+        n.p = e.prev, n.n = e.next;
+      }
+    };
+  }
+  return (module.exports = _regeneratorRuntime = function _regeneratorRuntime() {
+    return {
+      wrap: function wrap(e, t, n, o) {
+        return r.w(a(e), t, n, o && o.reverse());
+      },
+      isGeneratorFunction: n,
+      mark: r.m,
+      awrap: function awrap(r, e) {
+        return new OverloadYield(r, e);
+      },
+      AsyncIterator: regeneratorAsyncIterator,
+      async: function async(r, e, t, o, u) {
+        return (n(e) ? regeneratorAsyncGen : regeneratorAsync)(a(r), e, t, o, u);
+      },
+      keys: regeneratorKeys,
+      values: regeneratorValues
+    };
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports)();
+}
+module.exports = _regeneratorRuntime, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/regeneratorValues.js b/node_modules/@babel/runtime/helpers/regeneratorValues.js
new file mode 100644
index 0000000..1335a23
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/regeneratorValues.js
@@ -0,0 +1,19 @@
+var _typeof = require("./typeof.js")["default"];
+function _regeneratorValues(e) {
+  if (null != e) {
+    var t = e["function" == typeof Symbol && Symbol.iterator || "@@iterator"],
+      r = 0;
+    if (t) return t.call(e);
+    if ("function" == typeof e.next) return e;
+    if (!isNaN(e.length)) return {
+      next: function next() {
+        return e && r >= e.length && (e = void 0), {
+          value: e && e[r++],
+          done: !e
+        };
+      }
+    };
+  }
+  throw new TypeError(_typeof(e) + " is not iterable");
+}
+module.exports = _regeneratorValues, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/set.js b/node_modules/@babel/runtime/helpers/set.js
new file mode 100644
index 0000000..6421470
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/set.js
@@ -0,0 +1,22 @@
+var superPropBase = require("./superPropBase.js");
+var defineProperty = require("./defineProperty.js");
+function set(e, r, t, o) {
+  return set = "undefined" != typeof Reflect && Reflect.set ? Reflect.set : function (e, r, t, o) {
+    var f,
+      i = superPropBase(e, r);
+    if (i) {
+      if ((f = Object.getOwnPropertyDescriptor(i, r)).set) return f.set.call(o, t), !0;
+      if (!f.writable) return !1;
+    }
+    if (f = Object.getOwnPropertyDescriptor(o, r)) {
+      if (!f.writable) return !1;
+      f.value = t, Object.defineProperty(o, r, f);
+    } else defineProperty(o, r, t);
+    return !0;
+  }, set(e, r, t, o);
+}
+function _set(e, r, t, o, f) {
+  if (!set(e, r, t, o || e) && f) throw new TypeError("failed to set property");
+  return t;
+}
+module.exports = _set, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/setFunctionName.js b/node_modules/@babel/runtime/helpers/setFunctionName.js
new file mode 100644
index 0000000..9664076
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/setFunctionName.js
@@ -0,0 +1,12 @@
+var _typeof = require("./typeof.js")["default"];
+function setFunctionName(e, t, n) {
+  "symbol" == _typeof(t) && (t = (t = t.description) ? "[" + t + "]" : "");
+  try {
+    Object.defineProperty(e, "name", {
+      configurable: !0,
+      value: n ? n + " " + t : t
+    });
+  } catch (e) {}
+  return e;
+}
+module.exports = setFunctionName, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/setPrototypeOf.js b/node_modules/@babel/runtime/helpers/setPrototypeOf.js
new file mode 100644
index 0000000..7d991ff
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/setPrototypeOf.js
@@ -0,0 +1,6 @@
+function _setPrototypeOf(t, e) {
+  return module.exports = _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function (t, e) {
+    return t.__proto__ = e, t;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _setPrototypeOf(t, e);
+}
+module.exports = _setPrototypeOf, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js b/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js
new file mode 100644
index 0000000..2aed548
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/skipFirstGeneratorNext.js
@@ -0,0 +1,7 @@
+function _skipFirstGeneratorNext(t) {
+  return function () {
+    var r = t.apply(this, arguments);
+    return r.next(), r;
+  };
+}
+module.exports = _skipFirstGeneratorNext, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/slicedToArray.js b/node_modules/@babel/runtime/helpers/slicedToArray.js
new file mode 100644
index 0000000..3d752c4
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/slicedToArray.js
@@ -0,0 +1,8 @@
+var arrayWithHoles = require("./arrayWithHoles.js");
+var iterableToArrayLimit = require("./iterableToArrayLimit.js");
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+var nonIterableRest = require("./nonIterableRest.js");
+function _slicedToArray(r, e) {
+  return arrayWithHoles(r) || iterableToArrayLimit(r, e) || unsupportedIterableToArray(r, e) || nonIterableRest();
+}
+module.exports = _slicedToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/superPropBase.js b/node_modules/@babel/runtime/helpers/superPropBase.js
new file mode 100644
index 0000000..5cad459
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/superPropBase.js
@@ -0,0 +1,6 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+function _superPropBase(t, o) {
+  for (; !{}.hasOwnProperty.call(t, o) && null !== (t = getPrototypeOf(t)););
+  return t;
+}
+module.exports = _superPropBase, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/superPropGet.js b/node_modules/@babel/runtime/helpers/superPropGet.js
new file mode 100644
index 0000000..baf8b10
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/superPropGet.js
@@ -0,0 +1,9 @@
+var get = require("./get.js");
+var getPrototypeOf = require("./getPrototypeOf.js");
+function _superPropGet(t, o, e, r) {
+  var p = get(getPrototypeOf(1 & r ? t.prototype : t), o, e);
+  return 2 & r && "function" == typeof p ? function (t) {
+    return p.apply(e, t);
+  } : p;
+}
+module.exports = _superPropGet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/superPropSet.js b/node_modules/@babel/runtime/helpers/superPropSet.js
new file mode 100644
index 0000000..e0578c0
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/superPropSet.js
@@ -0,0 +1,6 @@
+var set = require("./set.js");
+var getPrototypeOf = require("./getPrototypeOf.js");
+function _superPropSet(t, e, o, r, p, f) {
+  return set(getPrototypeOf(f ? t.prototype : t), e, o, r, p);
+}
+module.exports = _superPropSet, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js b/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js
new file mode 100644
index 0000000..38d6065
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/taggedTemplateLiteral.js
@@ -0,0 +1,8 @@
+function _taggedTemplateLiteral(e, t) {
+  return t || (t = e.slice(0)), Object.freeze(Object.defineProperties(e, {
+    raw: {
+      value: Object.freeze(t)
+    }
+  }));
+}
+module.exports = _taggedTemplateLiteral, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js b/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js
new file mode 100644
index 0000000..2f8c146
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/taggedTemplateLiteralLoose.js
@@ -0,0 +1,4 @@
+function _taggedTemplateLiteralLoose(e, t) {
+  return t || (t = e.slice(0)), e.raw = t, e;
+}
+module.exports = _taggedTemplateLiteralLoose, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/tdz.js b/node_modules/@babel/runtime/helpers/tdz.js
new file mode 100644
index 0000000..c66f476
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/tdz.js
@@ -0,0 +1,4 @@
+function _tdzError(e) {
+  throw new ReferenceError(e + " is not defined - temporal dead zone");
+}
+module.exports = _tdzError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/temporalRef.js b/node_modules/@babel/runtime/helpers/temporalRef.js
new file mode 100644
index 0000000..54c9190
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/temporalRef.js
@@ -0,0 +1,6 @@
+var temporalUndefined = require("./temporalUndefined.js");
+var tdz = require("./tdz.js");
+function _temporalRef(r, e) {
+  return r === temporalUndefined ? tdz(e) : r;
+}
+module.exports = _temporalRef, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/temporalUndefined.js b/node_modules/@babel/runtime/helpers/temporalUndefined.js
new file mode 100644
index 0000000..f8def80
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/temporalUndefined.js
@@ -0,0 +1,2 @@
+function _temporalUndefined() {}
+module.exports = _temporalUndefined, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toArray.js b/node_modules/@babel/runtime/helpers/toArray.js
new file mode 100644
index 0000000..2be1d2b
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toArray.js
@@ -0,0 +1,8 @@
+var arrayWithHoles = require("./arrayWithHoles.js");
+var iterableToArray = require("./iterableToArray.js");
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+var nonIterableRest = require("./nonIterableRest.js");
+function _toArray(r) {
+  return arrayWithHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableRest();
+}
+module.exports = _toArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toConsumableArray.js b/node_modules/@babel/runtime/helpers/toConsumableArray.js
new file mode 100644
index 0000000..698f9c6
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toConsumableArray.js
@@ -0,0 +1,8 @@
+var arrayWithoutHoles = require("./arrayWithoutHoles.js");
+var iterableToArray = require("./iterableToArray.js");
+var unsupportedIterableToArray = require("./unsupportedIterableToArray.js");
+var nonIterableSpread = require("./nonIterableSpread.js");
+function _toConsumableArray(r) {
+  return arrayWithoutHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableSpread();
+}
+module.exports = _toConsumableArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toPrimitive.js b/node_modules/@babel/runtime/helpers/toPrimitive.js
new file mode 100644
index 0000000..ef9d249
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toPrimitive.js
@@ -0,0 +1,12 @@
+var _typeof = require("./typeof.js")["default"];
+function toPrimitive(t, r) {
+  if ("object" != _typeof(t) || !t) return t;
+  var e = t[Symbol.toPrimitive];
+  if (void 0 !== e) {
+    var i = e.call(t, r || "default");
+    if ("object" != _typeof(i)) return i;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return ("string" === r ? String : Number)(t);
+}
+module.exports = toPrimitive, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toPropertyKey.js b/node_modules/@babel/runtime/helpers/toPropertyKey.js
new file mode 100644
index 0000000..3ca3d4f
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toPropertyKey.js
@@ -0,0 +1,7 @@
+var _typeof = require("./typeof.js")["default"];
+var toPrimitive = require("./toPrimitive.js");
+function toPropertyKey(t) {
+  var i = toPrimitive(t, "string");
+  return "symbol" == _typeof(i) ? i : i + "";
+}
+module.exports = toPropertyKey, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/toSetter.js b/node_modules/@babel/runtime/helpers/toSetter.js
new file mode 100644
index 0000000..e0012a8
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/toSetter.js
@@ -0,0 +1,10 @@
+function _toSetter(t, e, n) {
+  e || (e = []);
+  var r = e.length++;
+  return Object.defineProperty({}, "_", {
+    set: function set(o) {
+      e[r] = o, t.apply(n, e);
+    }
+  });
+}
+module.exports = _toSetter, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/tsRewriteRelativeImportExtensions.js b/node_modules/@babel/runtime/helpers/tsRewriteRelativeImportExtensions.js
new file mode 100644
index 0000000..4de0e4d
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/tsRewriteRelativeImportExtensions.js
@@ -0,0 +1,6 @@
+function tsRewriteRelativeImportExtensions(t, e) {
+  return "string" == typeof t && /^\.\.?\//.test(t) ? t.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+)?)\.([cm]?)ts$/i, function (t, s, r, n, o) {
+    return s ? e ? ".jsx" : ".js" : !r || n && o ? r + n + "." + o.toLowerCase() + "js" : t;
+  }) : t;
+}
+module.exports = tsRewriteRelativeImportExtensions, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/typeof.js b/node_modules/@babel/runtime/helpers/typeof.js
new file mode 100644
index 0000000..b6fbfaf
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/typeof.js
@@ -0,0 +1,10 @@
+function _typeof(o) {
+  "@babel/helpers - typeof";
+
+  return module.exports = _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) {
+    return typeof o;
+  } : function (o) {
+    return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _typeof(o);
+}
+module.exports = _typeof, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js b/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js
new file mode 100644
index 0000000..8fb1a71
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/unsupportedIterableToArray.js
@@ -0,0 +1,9 @@
+var arrayLikeToArray = require("./arrayLikeToArray.js");
+function _unsupportedIterableToArray(r, a) {
+  if (r) {
+    if ("string" == typeof r) return arrayLikeToArray(r, a);
+    var t = {}.toString.call(r).slice(8, -1);
+    return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? arrayLikeToArray(r, a) : void 0;
+  }
+}
+module.exports = _unsupportedIterableToArray, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/using.js b/node_modules/@babel/runtime/helpers/using.js
new file mode 100644
index 0000000..37c79e2
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/using.js
@@ -0,0 +1,12 @@
+function _using(o, n, e) {
+  if (null == n) return n;
+  if (Object(n) !== n) throw new TypeError("using declarations can only be used with objects, functions, null, or undefined.");
+  if (e) var r = n[Symbol.asyncDispose || Symbol["for"]("Symbol.asyncDispose")];
+  if (null == r && (r = n[Symbol.dispose || Symbol["for"]("Symbol.dispose")]), "function" != typeof r) throw new TypeError("Property [Symbol.dispose] is not a function.");
+  return o.push({
+    v: n,
+    d: r,
+    a: e
+  }), n;
+}
+module.exports = _using, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/usingCtx.js b/node_modules/@babel/runtime/helpers/usingCtx.js
new file mode 100644
index 0000000..652ab15
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/usingCtx.js
@@ -0,0 +1,59 @@
+function _usingCtx() {
+  var r = "function" == typeof SuppressedError ? SuppressedError : function (r, e) {
+      var n = Error();
+      return n.name = "SuppressedError", n.error = r, n.suppressed = e, n;
+    },
+    e = {},
+    n = [];
+  function using(r, e) {
+    if (null != e) {
+      if (Object(e) !== e) throw new TypeError("using declarations can only be used with objects, functions, null, or undefined.");
+      if (r) var o = e[Symbol.asyncDispose || Symbol["for"]("Symbol.asyncDispose")];
+      if (void 0 === o && (o = e[Symbol.dispose || Symbol["for"]("Symbol.dispose")], r)) var t = o;
+      if ("function" != typeof o) throw new TypeError("Object is not disposable.");
+      t && (o = function o() {
+        try {
+          t.call(e);
+        } catch (r) {
+          return Promise.reject(r);
+        }
+      }), n.push({
+        v: e,
+        d: o,
+        a: r
+      });
+    } else r && n.push({
+      d: e,
+      a: r
+    });
+    return e;
+  }
+  return {
+    e: e,
+    u: using.bind(null, !1),
+    a: using.bind(null, !0),
+    d: function d() {
+      var o,
+        t = this.e,
+        s = 0;
+      function next() {
+        for (; o = n.pop();) try {
+          if (!o.a && 1 === s) return s = 0, n.push(o), Promise.resolve().then(next);
+          if (o.d) {
+            var r = o.d.call(o.v);
+            if (o.a) return s |= 2, Promise.resolve(r).then(next, err);
+          } else s |= 1;
+        } catch (r) {
+          return err(r);
+        }
+        if (1 === s) return t !== e ? Promise.reject(t) : Promise.resolve();
+        if (t !== e) throw t;
+      }
+      function err(n) {
+        return t = t !== e ? new r(n, t) : n, next();
+      }
+      return next();
+    }
+  };
+}
+module.exports = _usingCtx, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js b/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js
new file mode 100644
index 0000000..a3d32d7
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapAsyncGenerator.js
@@ -0,0 +1,56 @@
+var OverloadYield = require("./OverloadYield.js");
+function _wrapAsyncGenerator(e) {
+  return function () {
+    return new AsyncGenerator(e.apply(this, arguments));
+  };
+}
+function AsyncGenerator(e) {
+  var t, n;
+  function resume(t, n) {
+    try {
+      var r = e[t](n),
+        o = r.value,
+        u = o instanceof OverloadYield;
+      Promise.resolve(u ? o.v : o).then(function (n) {
+        if (u) {
+          var i = "return" === t && o.k ? t : "next";
+          if (!o.k || n.done) return resume(i, n);
+          n = e[i](n).value;
+        }
+        settle(!!r.done, n);
+      }, function (e) {
+        resume("throw", e);
+      });
+    } catch (e) {
+      settle(2, e);
+    }
+  }
+  function settle(e, r) {
+    2 === e ? t.reject(r) : t.resolve({
+      value: r,
+      done: e
+    }), (t = t.next) ? resume(t.key, t.arg) : n = null;
+  }
+  this._invoke = function (e, r) {
+    return new Promise(function (o, u) {
+      var i = {
+        key: e,
+        arg: r,
+        resolve: o,
+        reject: u,
+        next: null
+      };
+      n ? n = n.next = i : (t = n = i, resume(e, r));
+    });
+  }, "function" != typeof e["return"] && (this["return"] = void 0);
+}
+AsyncGenerator.prototype["function" == typeof Symbol && Symbol.asyncIterator || "@@asyncIterator"] = function () {
+  return this;
+}, AsyncGenerator.prototype.next = function (e) {
+  return this._invoke("next", e);
+}, AsyncGenerator.prototype["throw"] = function (e) {
+  return this._invoke("throw", e);
+}, AsyncGenerator.prototype["return"] = function (e) {
+  return this._invoke("return", e);
+};
+module.exports = _wrapAsyncGenerator, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapNativeSuper.js b/node_modules/@babel/runtime/helpers/wrapNativeSuper.js
new file mode 100644
index 0000000..acd87ab
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapNativeSuper.js
@@ -0,0 +1,27 @@
+var getPrototypeOf = require("./getPrototypeOf.js");
+var setPrototypeOf = require("./setPrototypeOf.js");
+var isNativeFunction = require("./isNativeFunction.js");
+var construct = require("./construct.js");
+function _wrapNativeSuper(t) {
+  var r = "function" == typeof Map ? new Map() : void 0;
+  return module.exports = _wrapNativeSuper = function _wrapNativeSuper(t) {
+    if (null === t || !isNativeFunction(t)) return t;
+    if ("function" != typeof t) throw new TypeError("Super expression must either be null or a function");
+    if (void 0 !== r) {
+      if (r.has(t)) return r.get(t);
+      r.set(t, Wrapper);
+    }
+    function Wrapper() {
+      return construct(t, arguments, getPrototypeOf(this).constructor);
+    }
+    return Wrapper.prototype = Object.create(t.prototype, {
+      constructor: {
+        value: Wrapper,
+        enumerable: !1,
+        writable: !0,
+        configurable: !0
+      }
+    }), setPrototypeOf(Wrapper, t);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports, _wrapNativeSuper(t);
+}
+module.exports = _wrapNativeSuper, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/wrapRegExp.js b/node_modules/@babel/runtime/helpers/wrapRegExp.js
new file mode 100644
index 0000000..3d6e6ce
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/wrapRegExp.js
@@ -0,0 +1,52 @@
+var _typeof = require("./typeof.js")["default"];
+var setPrototypeOf = require("./setPrototypeOf.js");
+var inherits = require("./inherits.js");
+function _wrapRegExp() {
+  module.exports = _wrapRegExp = function _wrapRegExp(e, r) {
+    return new BabelRegExp(e, void 0, r);
+  }, module.exports.__esModule = true, module.exports["default"] = module.exports;
+  var e = RegExp.prototype,
+    r = new WeakMap();
+  function BabelRegExp(e, t, p) {
+    var o = RegExp(e, t);
+    return r.set(o, p || r.get(e)), setPrototypeOf(o, BabelRegExp.prototype);
+  }
+  function buildGroups(e, t) {
+    var p = r.get(t);
+    return Object.keys(p).reduce(function (r, t) {
+      var o = p[t];
+      if ("number" == typeof o) r[t] = e[o];else {
+        for (var i = 0; void 0 === e[o[i]] && i + 1 < o.length;) i++;
+        r[t] = e[o[i]];
+      }
+      return r;
+    }, Object.create(null));
+  }
+  return inherits(BabelRegExp, RegExp), BabelRegExp.prototype.exec = function (r) {
+    var t = e.exec.call(this, r);
+    if (t) {
+      t.groups = buildGroups(t, this);
+      var p = t.indices;
+      p && (p.groups = buildGroups(p, this));
+    }
+    return t;
+  }, BabelRegExp.prototype[Symbol.replace] = function (t, p) {
+    if ("string" == typeof p) {
+      var o = r.get(this);
+      return e[Symbol.replace].call(this, t, p.replace(/\$<([^>]+)(>|$)/g, function (e, r, t) {
+        if ("" === t) return e;
+        var p = o[r];
+        return Array.isArray(p) ? "$" + p.join("$") : "number" == typeof p ? "$" + p : "";
+      }));
+    }
+    if ("function" == typeof p) {
+      var i = this;
+      return e[Symbol.replace].call(this, t, function () {
+        var e = arguments;
+        return "object" != _typeof(e[e.length - 1]) && (e = [].slice.call(e)).push(buildGroups(e, i)), p.apply(this, e);
+      });
+    }
+    return e[Symbol.replace].call(this, t, p);
+  }, _wrapRegExp.apply(this, arguments);
+}
+module.exports = _wrapRegExp, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/helpers/writeOnlyError.js b/node_modules/@babel/runtime/helpers/writeOnlyError.js
new file mode 100644
index 0000000..c98ee82
--- /dev/null
+++ b/node_modules/@babel/runtime/helpers/writeOnlyError.js
@@ -0,0 +1,4 @@
+function _writeOnlyError(r) {
+  throw new TypeError('"' + r + '" is write-only');
+}
+module.exports = _writeOnlyError, module.exports.__esModule = true, module.exports["default"] = module.exports;
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/package.json b/node_modules/@babel/runtime/package.json
new file mode 100644
index 0000000..0f7db7f
--- /dev/null
+++ b/node_modules/@babel/runtime/package.json
@@ -0,0 +1,1107 @@
+{
+  "name": "@babel/runtime",
+  "version": "7.29.7",
+  "description": "babel's modular runtime helpers",
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/babel/babel.git",
+    "directory": "packages/babel-runtime"
+  },
+  "homepage": "https://babel.dev/docs/en/next/babel-runtime",
+  "author": "The Babel Team (https://babel.dev/team)",
+  "exports": {
+    "./helpers/OverloadYield": [
+      {
+        "node": "./helpers/OverloadYield.js",
+        "import": "./helpers/esm/OverloadYield.js",
+        "default": "./helpers/OverloadYield.js"
+      },
+      "./helpers/OverloadYield.js"
+    ],
+    "./helpers/esm/OverloadYield": "./helpers/esm/OverloadYield.js",
+    "./helpers/applyDecoratedDescriptor": [
+      {
+        "node": "./helpers/applyDecoratedDescriptor.js",
+        "import": "./helpers/esm/applyDecoratedDescriptor.js",
+        "default": "./helpers/applyDecoratedDescriptor.js"
+      },
+      "./helpers/applyDecoratedDescriptor.js"
+    ],
+    "./helpers/esm/applyDecoratedDescriptor": "./helpers/esm/applyDecoratedDescriptor.js",
+    "./helpers/applyDecs2311": [
+      {
+        "node": "./helpers/applyDecs2311.js",
+        "import": "./helpers/esm/applyDecs2311.js",
+        "default": "./helpers/applyDecs2311.js"
+      },
+      "./helpers/applyDecs2311.js"
+    ],
+    "./helpers/esm/applyDecs2311": "./helpers/esm/applyDecs2311.js",
+    "./helpers/arrayLikeToArray": [
+      {
+        "node": "./helpers/arrayLikeToArray.js",
+        "import": "./helpers/esm/arrayLikeToArray.js",
+        "default": "./helpers/arrayLikeToArray.js"
+      },
+      "./helpers/arrayLikeToArray.js"
+    ],
+    "./helpers/esm/arrayLikeToArray": "./helpers/esm/arrayLikeToArray.js",
+    "./helpers/arrayWithHoles": [
+      {
+        "node": "./helpers/arrayWithHoles.js",
+        "import": "./helpers/esm/arrayWithHoles.js",
+        "default": "./helpers/arrayWithHoles.js"
+      },
+      "./helpers/arrayWithHoles.js"
+    ],
+    "./helpers/esm/arrayWithHoles": "./helpers/esm/arrayWithHoles.js",
+    "./helpers/arrayWithoutHoles": [
+      {
+        "node": "./helpers/arrayWithoutHoles.js",
+        "import": "./helpers/esm/arrayWithoutHoles.js",
+        "default": "./helpers/arrayWithoutHoles.js"
+      },
+      "./helpers/arrayWithoutHoles.js"
+    ],
+    "./helpers/esm/arrayWithoutHoles": "./helpers/esm/arrayWithoutHoles.js",
+    "./helpers/assertClassBrand": [
+      {
+        "node": "./helpers/assertClassBrand.js",
+        "import": "./helpers/esm/assertClassBrand.js",
+        "default": "./helpers/assertClassBrand.js"
+      },
+      "./helpers/assertClassBrand.js"
+    ],
+    "./helpers/esm/assertClassBrand": "./helpers/esm/assertClassBrand.js",
+    "./helpers/assertThisInitialized": [
+      {
+        "node": "./helpers/assertThisInitialized.js",
+        "import": "./helpers/esm/assertThisInitialized.js",
+        "default": "./helpers/assertThisInitialized.js"
+      },
+      "./helpers/assertThisInitialized.js"
+    ],
+    "./helpers/esm/assertThisInitialized": "./helpers/esm/assertThisInitialized.js",
+    "./helpers/asyncGeneratorDelegate": [
+      {
+        "node": "./helpers/asyncGeneratorDelegate.js",
+        "import": "./helpers/esm/asyncGeneratorDelegate.js",
+        "default": "./helpers/asyncGeneratorDelegate.js"
+      },
+      "./helpers/asyncGeneratorDelegate.js"
+    ],
+    "./helpers/esm/asyncGeneratorDelegate": "./helpers/esm/asyncGeneratorDelegate.js",
+    "./helpers/asyncIterator": [
+      {
+        "node": "./helpers/asyncIterator.js",
+        "import": "./helpers/esm/asyncIterator.js",
+        "default": "./helpers/asyncIterator.js"
+      },
+      "./helpers/asyncIterator.js"
+    ],
+    "./helpers/esm/asyncIterator": "./helpers/esm/asyncIterator.js",
+    "./helpers/asyncToGenerator": [
+      {
+        "node": "./helpers/asyncToGenerator.js",
+        "import": "./helpers/esm/asyncToGenerator.js",
+        "default": "./helpers/asyncToGenerator.js"
+      },
+      "./helpers/asyncToGenerator.js"
+    ],
+    "./helpers/esm/asyncToGenerator": "./helpers/esm/asyncToGenerator.js",
+    "./helpers/awaitAsyncGenerator": [
+      {
+        "node": "./helpers/awaitAsyncGenerator.js",
+        "import": "./helpers/esm/awaitAsyncGenerator.js",
+        "default": "./helpers/awaitAsyncGenerator.js"
+      },
+      "./helpers/awaitAsyncGenerator.js"
+    ],
+    "./helpers/esm/awaitAsyncGenerator": "./helpers/esm/awaitAsyncGenerator.js",
+    "./helpers/callSuper": [
+      {
+        "node": "./helpers/callSuper.js",
+        "import": "./helpers/esm/callSuper.js",
+        "default": "./helpers/callSuper.js"
+      },
+      "./helpers/callSuper.js"
+    ],
+    "./helpers/esm/callSuper": "./helpers/esm/callSuper.js",
+    "./helpers/checkInRHS": [
+      {
+        "node": "./helpers/checkInRHS.js",
+        "import": "./helpers/esm/checkInRHS.js",
+        "default": "./helpers/checkInRHS.js"
+      },
+      "./helpers/checkInRHS.js"
+    ],
+    "./helpers/esm/checkInRHS": "./helpers/esm/checkInRHS.js",
+    "./helpers/checkPrivateRedeclaration": [
+      {
+        "node": "./helpers/checkPrivateRedeclaration.js",
+        "import": "./helpers/esm/checkPrivateRedeclaration.js",
+        "default": "./helpers/checkPrivateRedeclaration.js"
+      },
+      "./helpers/checkPrivateRedeclaration.js"
+    ],
+    "./helpers/esm/checkPrivateRedeclaration": "./helpers/esm/checkPrivateRedeclaration.js",
+    "./helpers/classCallCheck": [
+      {
+        "node": "./helpers/classCallCheck.js",
+        "import": "./helpers/esm/classCallCheck.js",
+        "default": "./helpers/classCallCheck.js"
+      },
+      "./helpers/classCallCheck.js"
+    ],
+    "./helpers/esm/classCallCheck": "./helpers/esm/classCallCheck.js",
+    "./helpers/classNameTDZError": [
+      {
+        "node": "./helpers/classNameTDZError.js",
+        "import": "./helpers/esm/classNameTDZError.js",
+        "default": "./helpers/classNameTDZError.js"
+      },
+      "./helpers/classNameTDZError.js"
+    ],
+    "./helpers/esm/classNameTDZError": "./helpers/esm/classNameTDZError.js",
+    "./helpers/classPrivateFieldGet2": [
+      {
+        "node": "./helpers/classPrivateFieldGet2.js",
+        "import": "./helpers/esm/classPrivateFieldGet2.js",
+        "default": "./helpers/classPrivateFieldGet2.js"
+      },
+      "./helpers/classPrivateFieldGet2.js"
+    ],
+    "./helpers/esm/classPrivateFieldGet2": "./helpers/esm/classPrivateFieldGet2.js",
+    "./helpers/classPrivateFieldInitSpec": [
+      {
+        "node": "./helpers/classPrivateFieldInitSpec.js",
+        "import": "./helpers/esm/classPrivateFieldInitSpec.js",
+        "default": "./helpers/classPrivateFieldInitSpec.js"
+      },
+      "./helpers/classPrivateFieldInitSpec.js"
+    ],
+    "./helpers/esm/classPrivateFieldInitSpec": "./helpers/esm/classPrivateFieldInitSpec.js",
+    "./helpers/classPrivateFieldLooseBase": [
+      {
+        "node": "./helpers/classPrivateFieldLooseBase.js",
+        "import": "./helpers/esm/classPrivateFieldLooseBase.js",
+        "default": "./helpers/classPrivateFieldLooseBase.js"
+      },
+      "./helpers/classPrivateFieldLooseBase.js"
+    ],
+    "./helpers/esm/classPrivateFieldLooseBase": "./helpers/esm/classPrivateFieldLooseBase.js",
+    "./helpers/classPrivateFieldLooseKey": [
+      {
+        "node": "./helpers/classPrivateFieldLooseKey.js",
+        "import": "./helpers/esm/classPrivateFieldLooseKey.js",
+        "default": "./helpers/classPrivateFieldLooseKey.js"
+      },
+      "./helpers/classPrivateFieldLooseKey.js"
+    ],
+    "./helpers/esm/classPrivateFieldLooseKey": "./helpers/esm/classPrivateFieldLooseKey.js",
+    "./helpers/classPrivateFieldSet2": [
+      {
+        "node": "./helpers/classPrivateFieldSet2.js",
+        "import": "./helpers/esm/classPrivateFieldSet2.js",
+        "default": "./helpers/classPrivateFieldSet2.js"
+      },
+      "./helpers/classPrivateFieldSet2.js"
+    ],
+    "./helpers/esm/classPrivateFieldSet2": "./helpers/esm/classPrivateFieldSet2.js",
+    "./helpers/classPrivateGetter": [
+      {
+        "node": "./helpers/classPrivateGetter.js",
+        "import": "./helpers/esm/classPrivateGetter.js",
+        "default": "./helpers/classPrivateGetter.js"
+      },
+      "./helpers/classPrivateGetter.js"
+    ],
+    "./helpers/esm/classPrivateGetter": "./helpers/esm/classPrivateGetter.js",
+    "./helpers/classPrivateMethodInitSpec": [
+      {
+        "node": "./helpers/classPrivateMethodInitSpec.js",
+        "import": "./helpers/esm/classPrivateMethodInitSpec.js",
+        "default": "./helpers/classPrivateMethodInitSpec.js"
+      },
+      "./helpers/classPrivateMethodInitSpec.js"
+    ],
+    "./helpers/esm/classPrivateMethodInitSpec": "./helpers/esm/classPrivateMethodInitSpec.js",
+    "./helpers/classPrivateSetter": [
+      {
+        "node": "./helpers/classPrivateSetter.js",
+        "import": "./helpers/esm/classPrivateSetter.js",
+        "default": "./helpers/classPrivateSetter.js"
+      },
+      "./helpers/classPrivateSetter.js"
+    ],
+    "./helpers/esm/classPrivateSetter": "./helpers/esm/classPrivateSetter.js",
+    "./helpers/classStaticPrivateMethodGet": [
+      {
+        "node": "./helpers/classStaticPrivateMethodGet.js",
+        "import": "./helpers/esm/classStaticPrivateMethodGet.js",
+        "default": "./helpers/classStaticPrivateMethodGet.js"
+      },
+      "./helpers/classStaticPrivateMethodGet.js"
+    ],
+    "./helpers/esm/classStaticPrivateMethodGet": "./helpers/esm/classStaticPrivateMethodGet.js",
+    "./helpers/construct": [
+      {
+        "node": "./helpers/construct.js",
+        "import": "./helpers/esm/construct.js",
+        "default": "./helpers/construct.js"
+      },
+      "./helpers/construct.js"
+    ],
+    "./helpers/esm/construct": "./helpers/esm/construct.js",
+    "./helpers/createClass": [
+      {
+        "node": "./helpers/createClass.js",
+        "import": "./helpers/esm/createClass.js",
+        "default": "./helpers/createClass.js"
+      },
+      "./helpers/createClass.js"
+    ],
+    "./helpers/esm/createClass": "./helpers/esm/createClass.js",
+    "./helpers/createForOfIteratorHelper": [
+      {
+        "node": "./helpers/createForOfIteratorHelper.js",
+        "import": "./helpers/esm/createForOfIteratorHelper.js",
+        "default": "./helpers/createForOfIteratorHelper.js"
+      },
+      "./helpers/createForOfIteratorHelper.js"
+    ],
+    "./helpers/esm/createForOfIteratorHelper": "./helpers/esm/createForOfIteratorHelper.js",
+    "./helpers/createForOfIteratorHelperLoose": [
+      {
+        "node": "./helpers/createForOfIteratorHelperLoose.js",
+        "import": "./helpers/esm/createForOfIteratorHelperLoose.js",
+        "default": "./helpers/createForOfIteratorHelperLoose.js"
+      },
+      "./helpers/createForOfIteratorHelperLoose.js"
+    ],
+    "./helpers/esm/createForOfIteratorHelperLoose": "./helpers/esm/createForOfIteratorHelperLoose.js",
+    "./helpers/createSuper": [
+      {
+        "node": "./helpers/createSuper.js",
+        "import": "./helpers/esm/createSuper.js",
+        "default": "./helpers/createSuper.js"
+      },
+      "./helpers/createSuper.js"
+    ],
+    "./helpers/esm/createSuper": "./helpers/esm/createSuper.js",
+    "./helpers/decorate": [
+      {
+        "node": "./helpers/decorate.js",
+        "import": "./helpers/esm/decorate.js",
+        "default": "./helpers/decorate.js"
+      },
+      "./helpers/decorate.js"
+    ],
+    "./helpers/esm/decorate": "./helpers/esm/decorate.js",
+    "./helpers/defaults": [
+      {
+        "node": "./helpers/defaults.js",
+        "import": "./helpers/esm/defaults.js",
+        "default": "./helpers/defaults.js"
+      },
+      "./helpers/defaults.js"
+    ],
+    "./helpers/esm/defaults": "./helpers/esm/defaults.js",
+    "./helpers/defineAccessor": [
+      {
+        "node": "./helpers/defineAccessor.js",
+        "import": "./helpers/esm/defineAccessor.js",
+        "default": "./helpers/defineAccessor.js"
+      },
+      "./helpers/defineAccessor.js"
+    ],
+    "./helpers/esm/defineAccessor": "./helpers/esm/defineAccessor.js",
+    "./helpers/defineProperty": [
+      {
+        "node": "./helpers/defineProperty.js",
+        "import": "./helpers/esm/defineProperty.js",
+        "default": "./helpers/defineProperty.js"
+      },
+      "./helpers/defineProperty.js"
+    ],
+    "./helpers/esm/defineProperty": "./helpers/esm/defineProperty.js",
+    "./helpers/extends": [
+      {
+        "node": "./helpers/extends.js",
+        "import": "./helpers/esm/extends.js",
+        "default": "./helpers/extends.js"
+      },
+      "./helpers/extends.js"
+    ],
+    "./helpers/esm/extends": "./helpers/esm/extends.js",
+    "./helpers/get": [
+      {
+        "node": "./helpers/get.js",
+        "import": "./helpers/esm/get.js",
+        "default": "./helpers/get.js"
+      },
+      "./helpers/get.js"
+    ],
+    "./helpers/esm/get": "./helpers/esm/get.js",
+    "./helpers/getPrototypeOf": [
+      {
+        "node": "./helpers/getPrototypeOf.js",
+        "import": "./helpers/esm/getPrototypeOf.js",
+        "default": "./helpers/getPrototypeOf.js"
+      },
+      "./helpers/getPrototypeOf.js"
+    ],
+    "./helpers/esm/getPrototypeOf": "./helpers/esm/getPrototypeOf.js",
+    "./helpers/identity": [
+      {
+        "node": "./helpers/identity.js",
+        "import": "./helpers/esm/identity.js",
+        "default": "./helpers/identity.js"
+      },
+      "./helpers/identity.js"
+    ],
+    "./helpers/esm/identity": "./helpers/esm/identity.js",
+    "./helpers/importDeferProxy": [
+      {
+        "node": "./helpers/importDeferProxy.js",
+        "import": "./helpers/esm/importDeferProxy.js",
+        "default": "./helpers/importDeferProxy.js"
+      },
+      "./helpers/importDeferProxy.js"
+    ],
+    "./helpers/esm/importDeferProxy": "./helpers/esm/importDeferProxy.js",
+    "./helpers/inherits": [
+      {
+        "node": "./helpers/inherits.js",
+        "import": "./helpers/esm/inherits.js",
+        "default": "./helpers/inherits.js"
+      },
+      "./helpers/inherits.js"
+    ],
+    "./helpers/esm/inherits": "./helpers/esm/inherits.js",
+    "./helpers/inheritsLoose": [
+      {
+        "node": "./helpers/inheritsLoose.js",
+        "import": "./helpers/esm/inheritsLoose.js",
+        "default": "./helpers/inheritsLoose.js"
+      },
+      "./helpers/inheritsLoose.js"
+    ],
+    "./helpers/esm/inheritsLoose": "./helpers/esm/inheritsLoose.js",
+    "./helpers/initializerDefineProperty": [
+      {
+        "node": "./helpers/initializerDefineProperty.js",
+        "import": "./helpers/esm/initializerDefineProperty.js",
+        "default": "./helpers/initializerDefineProperty.js"
+      },
+      "./helpers/initializerDefineProperty.js"
+    ],
+    "./helpers/esm/initializerDefineProperty": "./helpers/esm/initializerDefineProperty.js",
+    "./helpers/initializerWarningHelper": [
+      {
+        "node": "./helpers/initializerWarningHelper.js",
+        "import": "./helpers/esm/initializerWarningHelper.js",
+        "default": "./helpers/initializerWarningHelper.js"
+      },
+      "./helpers/initializerWarningHelper.js"
+    ],
+    "./helpers/esm/initializerWarningHelper": "./helpers/esm/initializerWarningHelper.js",
+    "./helpers/instanceof": [
+      {
+        "node": "./helpers/instanceof.js",
+        "import": "./helpers/esm/instanceof.js",
+        "default": "./helpers/instanceof.js"
+      },
+      "./helpers/instanceof.js"
+    ],
+    "./helpers/esm/instanceof": "./helpers/esm/instanceof.js",
+    "./helpers/interopRequireDefault": [
+      {
+        "node": "./helpers/interopRequireDefault.js",
+        "import": "./helpers/esm/interopRequireDefault.js",
+        "default": "./helpers/interopRequireDefault.js"
+      },
+      "./helpers/interopRequireDefault.js"
+    ],
+    "./helpers/esm/interopRequireDefault": "./helpers/esm/interopRequireDefault.js",
+    "./helpers/interopRequireWildcard": [
+      {
+        "node": "./helpers/interopRequireWildcard.js",
+        "import": "./helpers/esm/interopRequireWildcard.js",
+        "default": "./helpers/interopRequireWildcard.js"
+      },
+      "./helpers/interopRequireWildcard.js"
+    ],
+    "./helpers/esm/interopRequireWildcard": "./helpers/esm/interopRequireWildcard.js",
+    "./helpers/isNativeFunction": [
+      {
+        "node": "./helpers/isNativeFunction.js",
+        "import": "./helpers/esm/isNativeFunction.js",
+        "default": "./helpers/isNativeFunction.js"
+      },
+      "./helpers/isNativeFunction.js"
+    ],
+    "./helpers/esm/isNativeFunction": "./helpers/esm/isNativeFunction.js",
+    "./helpers/isNativeReflectConstruct": [
+      {
+        "node": "./helpers/isNativeReflectConstruct.js",
+        "import": "./helpers/esm/isNativeReflectConstruct.js",
+        "default": "./helpers/isNativeReflectConstruct.js"
+      },
+      "./helpers/isNativeReflectConstruct.js"
+    ],
+    "./helpers/esm/isNativeReflectConstruct": "./helpers/esm/isNativeReflectConstruct.js",
+    "./helpers/iterableToArray": [
+      {
+        "node": "./helpers/iterableToArray.js",
+        "import": "./helpers/esm/iterableToArray.js",
+        "default": "./helpers/iterableToArray.js"
+      },
+      "./helpers/iterableToArray.js"
+    ],
+    "./helpers/esm/iterableToArray": "./helpers/esm/iterableToArray.js",
+    "./helpers/iterableToArrayLimit": [
+      {
+        "node": "./helpers/iterableToArrayLimit.js",
+        "import": "./helpers/esm/iterableToArrayLimit.js",
+        "default": "./helpers/iterableToArrayLimit.js"
+      },
+      "./helpers/iterableToArrayLimit.js"
+    ],
+    "./helpers/esm/iterableToArrayLimit": "./helpers/esm/iterableToArrayLimit.js",
+    "./helpers/jsx": [
+      {
+        "node": "./helpers/jsx.js",
+        "import": "./helpers/esm/jsx.js",
+        "default": "./helpers/jsx.js"
+      },
+      "./helpers/jsx.js"
+    ],
+    "./helpers/esm/jsx": "./helpers/esm/jsx.js",
+    "./helpers/maybeArrayLike": [
+      {
+        "node": "./helpers/maybeArrayLike.js",
+        "import": "./helpers/esm/maybeArrayLike.js",
+        "default": "./helpers/maybeArrayLike.js"
+      },
+      "./helpers/maybeArrayLike.js"
+    ],
+    "./helpers/esm/maybeArrayLike": "./helpers/esm/maybeArrayLike.js",
+    "./helpers/newArrowCheck": [
+      {
+        "node": "./helpers/newArrowCheck.js",
+        "import": "./helpers/esm/newArrowCheck.js",
+        "default": "./helpers/newArrowCheck.js"
+      },
+      "./helpers/newArrowCheck.js"
+    ],
+    "./helpers/esm/newArrowCheck": "./helpers/esm/newArrowCheck.js",
+    "./helpers/nonIterableRest": [
+      {
+        "node": "./helpers/nonIterableRest.js",
+        "import": "./helpers/esm/nonIterableRest.js",
+        "default": "./helpers/nonIterableRest.js"
+      },
+      "./helpers/nonIterableRest.js"
+    ],
+    "./helpers/esm/nonIterableRest": "./helpers/esm/nonIterableRest.js",
+    "./helpers/nonIterableSpread": [
+      {
+        "node": "./helpers/nonIterableSpread.js",
+        "import": "./helpers/esm/nonIterableSpread.js",
+        "default": "./helpers/nonIterableSpread.js"
+      },
+      "./helpers/nonIterableSpread.js"
+    ],
+    "./helpers/esm/nonIterableSpread": "./helpers/esm/nonIterableSpread.js",
+    "./helpers/nullishReceiverError": [
+      {
+        "node": "./helpers/nullishReceiverError.js",
+        "import": "./helpers/esm/nullishReceiverError.js",
+        "default": "./helpers/nullishReceiverError.js"
+      },
+      "./helpers/nullishReceiverError.js"
+    ],
+    "./helpers/esm/nullishReceiverError": "./helpers/esm/nullishReceiverError.js",
+    "./helpers/objectDestructuringEmpty": [
+      {
+        "node": "./helpers/objectDestructuringEmpty.js",
+        "import": "./helpers/esm/objectDestructuringEmpty.js",
+        "default": "./helpers/objectDestructuringEmpty.js"
+      },
+      "./helpers/objectDestructuringEmpty.js"
+    ],
+    "./helpers/esm/objectDestructuringEmpty": "./helpers/esm/objectDestructuringEmpty.js",
+    "./helpers/objectSpread2": [
+      {
+        "node": "./helpers/objectSpread2.js",
+        "import": "./helpers/esm/objectSpread2.js",
+        "default": "./helpers/objectSpread2.js"
+      },
+      "./helpers/objectSpread2.js"
+    ],
+    "./helpers/esm/objectSpread2": "./helpers/esm/objectSpread2.js",
+    "./helpers/objectWithoutProperties": [
+      {
+        "node": "./helpers/objectWithoutProperties.js",
+        "import": "./helpers/esm/objectWithoutProperties.js",
+        "default": "./helpers/objectWithoutProperties.js"
+      },
+      "./helpers/objectWithoutProperties.js"
+    ],
+    "./helpers/esm/objectWithoutProperties": "./helpers/esm/objectWithoutProperties.js",
+    "./helpers/objectWithoutPropertiesLoose": [
+      {
+        "node": "./helpers/objectWithoutPropertiesLoose.js",
+        "import": "./helpers/esm/objectWithoutPropertiesLoose.js",
+        "default": "./helpers/objectWithoutPropertiesLoose.js"
+      },
+      "./helpers/objectWithoutPropertiesLoose.js"
+    ],
+    "./helpers/esm/objectWithoutPropertiesLoose": "./helpers/esm/objectWithoutPropertiesLoose.js",
+    "./helpers/possibleConstructorReturn": [
+      {
+        "node": "./helpers/possibleConstructorReturn.js",
+        "import": "./helpers/esm/possibleConstructorReturn.js",
+        "default": "./helpers/possibleConstructorReturn.js"
+      },
+      "./helpers/possibleConstructorReturn.js"
+    ],
+    "./helpers/esm/possibleConstructorReturn": "./helpers/esm/possibleConstructorReturn.js",
+    "./helpers/readOnlyError": [
+      {
+        "node": "./helpers/readOnlyError.js",
+        "import": "./helpers/esm/readOnlyError.js",
+        "default": "./helpers/readOnlyError.js"
+      },
+      "./helpers/readOnlyError.js"
+    ],
+    "./helpers/esm/readOnlyError": "./helpers/esm/readOnlyError.js",
+    "./helpers/regenerator": [
+      {
+        "node": "./helpers/regenerator.js",
+        "import": "./helpers/esm/regenerator.js",
+        "default": "./helpers/regenerator.js"
+      },
+      "./helpers/regenerator.js"
+    ],
+    "./helpers/esm/regenerator": "./helpers/esm/regenerator.js",
+    "./helpers/regeneratorAsync": [
+      {
+        "node": "./helpers/regeneratorAsync.js",
+        "import": "./helpers/esm/regeneratorAsync.js",
+        "default": "./helpers/regeneratorAsync.js"
+      },
+      "./helpers/regeneratorAsync.js"
+    ],
+    "./helpers/esm/regeneratorAsync": "./helpers/esm/regeneratorAsync.js",
+    "./helpers/regeneratorAsyncGen": [
+      {
+        "node": "./helpers/regeneratorAsyncGen.js",
+        "import": "./helpers/esm/regeneratorAsyncGen.js",
+        "default": "./helpers/regeneratorAsyncGen.js"
+      },
+      "./helpers/regeneratorAsyncGen.js"
+    ],
+    "./helpers/esm/regeneratorAsyncGen": "./helpers/esm/regeneratorAsyncGen.js",
+    "./helpers/regeneratorKeys": [
+      {
+        "node": "./helpers/regeneratorKeys.js",
+        "import": "./helpers/esm/regeneratorKeys.js",
+        "default": "./helpers/regeneratorKeys.js"
+      },
+      "./helpers/regeneratorKeys.js"
+    ],
+    "./helpers/esm/regeneratorKeys": "./helpers/esm/regeneratorKeys.js",
+    "./helpers/regeneratorValues": [
+      {
+        "node": "./helpers/regeneratorValues.js",
+        "import": "./helpers/esm/regeneratorValues.js",
+        "default": "./helpers/regeneratorValues.js"
+      },
+      "./helpers/regeneratorValues.js"
+    ],
+    "./helpers/esm/regeneratorValues": "./helpers/esm/regeneratorValues.js",
+    "./helpers/set": [
+      {
+        "node": "./helpers/set.js",
+        "import": "./helpers/esm/set.js",
+        "default": "./helpers/set.js"
+      },
+      "./helpers/set.js"
+    ],
+    "./helpers/esm/set": "./helpers/esm/set.js",
+    "./helpers/setFunctionName": [
+      {
+        "node": "./helpers/setFunctionName.js",
+        "import": "./helpers/esm/setFunctionName.js",
+        "default": "./helpers/setFunctionName.js"
+      },
+      "./helpers/setFunctionName.js"
+    ],
+    "./helpers/esm/setFunctionName": "./helpers/esm/setFunctionName.js",
+    "./helpers/setPrototypeOf": [
+      {
+        "node": "./helpers/setPrototypeOf.js",
+        "import": "./helpers/esm/setPrototypeOf.js",
+        "default": "./helpers/setPrototypeOf.js"
+      },
+      "./helpers/setPrototypeOf.js"
+    ],
+    "./helpers/esm/setPrototypeOf": "./helpers/esm/setPrototypeOf.js",
+    "./helpers/skipFirstGeneratorNext": [
+      {
+        "node": "./helpers/skipFirstGeneratorNext.js",
+        "import": "./helpers/esm/skipFirstGeneratorNext.js",
+        "default": "./helpers/skipFirstGeneratorNext.js"
+      },
+      "./helpers/skipFirstGeneratorNext.js"
+    ],
+    "./helpers/esm/skipFirstGeneratorNext": "./helpers/esm/skipFirstGeneratorNext.js",
+    "./helpers/slicedToArray": [
+      {
+        "node": "./helpers/slicedToArray.js",
+        "import": "./helpers/esm/slicedToArray.js",
+        "default": "./helpers/slicedToArray.js"
+      },
+      "./helpers/slicedToArray.js"
+    ],
+    "./helpers/esm/slicedToArray": "./helpers/esm/slicedToArray.js",
+    "./helpers/superPropBase": [
+      {
+        "node": "./helpers/superPropBase.js",
+        "import": "./helpers/esm/superPropBase.js",
+        "default": "./helpers/superPropBase.js"
+      },
+      "./helpers/superPropBase.js"
+    ],
+    "./helpers/esm/superPropBase": "./helpers/esm/superPropBase.js",
+    "./helpers/superPropGet": [
+      {
+        "node": "./helpers/superPropGet.js",
+        "import": "./helpers/esm/superPropGet.js",
+        "default": "./helpers/superPropGet.js"
+      },
+      "./helpers/superPropGet.js"
+    ],
+    "./helpers/esm/superPropGet": "./helpers/esm/superPropGet.js",
+    "./helpers/superPropSet": [
+      {
+        "node": "./helpers/superPropSet.js",
+        "import": "./helpers/esm/superPropSet.js",
+        "default": "./helpers/superPropSet.js"
+      },
+      "./helpers/superPropSet.js"
+    ],
+    "./helpers/esm/superPropSet": "./helpers/esm/superPropSet.js",
+    "./helpers/taggedTemplateLiteral": [
+      {
+        "node": "./helpers/taggedTemplateLiteral.js",
+        "import": "./helpers/esm/taggedTemplateLiteral.js",
+        "default": "./helpers/taggedTemplateLiteral.js"
+      },
+      "./helpers/taggedTemplateLiteral.js"
+    ],
+    "./helpers/esm/taggedTemplateLiteral": "./helpers/esm/taggedTemplateLiteral.js",
+    "./helpers/taggedTemplateLiteralLoose": [
+      {
+        "node": "./helpers/taggedTemplateLiteralLoose.js",
+        "import": "./helpers/esm/taggedTemplateLiteralLoose.js",
+        "default": "./helpers/taggedTemplateLiteralLoose.js"
+      },
+      "./helpers/taggedTemplateLiteralLoose.js"
+    ],
+    "./helpers/esm/taggedTemplateLiteralLoose": "./helpers/esm/taggedTemplateLiteralLoose.js",
+    "./helpers/tdz": [
+      {
+        "node": "./helpers/tdz.js",
+        "import": "./helpers/esm/tdz.js",
+        "default": "./helpers/tdz.js"
+      },
+      "./helpers/tdz.js"
+    ],
+    "./helpers/esm/tdz": "./helpers/esm/tdz.js",
+    "./helpers/temporalRef": [
+      {
+        "node": "./helpers/temporalRef.js",
+        "import": "./helpers/esm/temporalRef.js",
+        "default": "./helpers/temporalRef.js"
+      },
+      "./helpers/temporalRef.js"
+    ],
+    "./helpers/esm/temporalRef": "./helpers/esm/temporalRef.js",
+    "./helpers/temporalUndefined": [
+      {
+        "node": "./helpers/temporalUndefined.js",
+        "import": "./helpers/esm/temporalUndefined.js",
+        "default": "./helpers/temporalUndefined.js"
+      },
+      "./helpers/temporalUndefined.js"
+    ],
+    "./helpers/esm/temporalUndefined": "./helpers/esm/temporalUndefined.js",
+    "./helpers/toArray": [
+      {
+        "node": "./helpers/toArray.js",
+        "import": "./helpers/esm/toArray.js",
+        "default": "./helpers/toArray.js"
+      },
+      "./helpers/toArray.js"
+    ],
+    "./helpers/esm/toArray": "./helpers/esm/toArray.js",
+    "./helpers/toConsumableArray": [
+      {
+        "node": "./helpers/toConsumableArray.js",
+        "import": "./helpers/esm/toConsumableArray.js",
+        "default": "./helpers/toConsumableArray.js"
+      },
+      "./helpers/toConsumableArray.js"
+    ],
+    "./helpers/esm/toConsumableArray": "./helpers/esm/toConsumableArray.js",
+    "./helpers/toPrimitive": [
+      {
+        "node": "./helpers/toPrimitive.js",
+        "import": "./helpers/esm/toPrimitive.js",
+        "default": "./helpers/toPrimitive.js"
+      },
+      "./helpers/toPrimitive.js"
+    ],
+    "./helpers/esm/toPrimitive": "./helpers/esm/toPrimitive.js",
+    "./helpers/toPropertyKey": [
+      {
+        "node": "./helpers/toPropertyKey.js",
+        "import": "./helpers/esm/toPropertyKey.js",
+        "default": "./helpers/toPropertyKey.js"
+      },
+      "./helpers/toPropertyKey.js"
+    ],
+    "./helpers/esm/toPropertyKey": "./helpers/esm/toPropertyKey.js",
+    "./helpers/toSetter": [
+      {
+        "node": "./helpers/toSetter.js",
+        "import": "./helpers/esm/toSetter.js",
+        "default": "./helpers/toSetter.js"
+      },
+      "./helpers/toSetter.js"
+    ],
+    "./helpers/esm/toSetter": "./helpers/esm/toSetter.js",
+    "./helpers/tsRewriteRelativeImportExtensions": [
+      {
+        "node": "./helpers/tsRewriteRelativeImportExtensions.js",
+        "import": "./helpers/esm/tsRewriteRelativeImportExtensions.js",
+        "default": "./helpers/tsRewriteRelativeImportExtensions.js"
+      },
+      "./helpers/tsRewriteRelativeImportExtensions.js"
+    ],
+    "./helpers/esm/tsRewriteRelativeImportExtensions": "./helpers/esm/tsRewriteRelativeImportExtensions.js",
+    "./helpers/typeof": [
+      {
+        "node": "./helpers/typeof.js",
+        "import": "./helpers/esm/typeof.js",
+        "default": "./helpers/typeof.js"
+      },
+      "./helpers/typeof.js"
+    ],
+    "./helpers/esm/typeof": "./helpers/esm/typeof.js",
+    "./helpers/unsupportedIterableToArray": [
+      {
+        "node": "./helpers/unsupportedIterableToArray.js",
+        "import": "./helpers/esm/unsupportedIterableToArray.js",
+        "default": "./helpers/unsupportedIterableToArray.js"
+      },
+      "./helpers/unsupportedIterableToArray.js"
+    ],
+    "./helpers/esm/unsupportedIterableToArray": "./helpers/esm/unsupportedIterableToArray.js",
+    "./helpers/usingCtx": [
+      {
+        "node": "./helpers/usingCtx.js",
+        "import": "./helpers/esm/usingCtx.js",
+        "default": "./helpers/usingCtx.js"
+      },
+      "./helpers/usingCtx.js"
+    ],
+    "./helpers/esm/usingCtx": "./helpers/esm/usingCtx.js",
+    "./helpers/wrapAsyncGenerator": [
+      {
+        "node": "./helpers/wrapAsyncGenerator.js",
+        "import": "./helpers/esm/wrapAsyncGenerator.js",
+        "default": "./helpers/wrapAsyncGenerator.js"
+      },
+      "./helpers/wrapAsyncGenerator.js"
+    ],
+    "./helpers/esm/wrapAsyncGenerator": "./helpers/esm/wrapAsyncGenerator.js",
+    "./helpers/wrapNativeSuper": [
+      {
+        "node": "./helpers/wrapNativeSuper.js",
+        "import": "./helpers/esm/wrapNativeSuper.js",
+        "default": "./helpers/wrapNativeSuper.js"
+      },
+      "./helpers/wrapNativeSuper.js"
+    ],
+    "./helpers/esm/wrapNativeSuper": "./helpers/esm/wrapNativeSuper.js",
+    "./helpers/wrapRegExp": [
+      {
+        "node": "./helpers/wrapRegExp.js",
+        "import": "./helpers/esm/wrapRegExp.js",
+        "default": "./helpers/wrapRegExp.js"
+      },
+      "./helpers/wrapRegExp.js"
+    ],
+    "./helpers/esm/wrapRegExp": "./helpers/esm/wrapRegExp.js",
+    "./helpers/writeOnlyError": [
+      {
+        "node": "./helpers/writeOnlyError.js",
+        "import": "./helpers/esm/writeOnlyError.js",
+        "default": "./helpers/writeOnlyError.js"
+      },
+      "./helpers/writeOnlyError.js"
+    ],
+    "./helpers/esm/writeOnlyError": "./helpers/esm/writeOnlyError.js",
+    "./helpers/AwaitValue": [
+      {
+        "node": "./helpers/AwaitValue.js",
+        "import": "./helpers/esm/AwaitValue.js",
+        "default": "./helpers/AwaitValue.js"
+      },
+      "./helpers/AwaitValue.js"
+    ],
+    "./helpers/esm/AwaitValue": "./helpers/esm/AwaitValue.js",
+    "./helpers/applyDecs": [
+      {
+        "node": "./helpers/applyDecs.js",
+        "import": "./helpers/esm/applyDecs.js",
+        "default": "./helpers/applyDecs.js"
+      },
+      "./helpers/applyDecs.js"
+    ],
+    "./helpers/esm/applyDecs": "./helpers/esm/applyDecs.js",
+    "./helpers/applyDecs2203": [
+      {
+        "node": "./helpers/applyDecs2203.js",
+        "import": "./helpers/esm/applyDecs2203.js",
+        "default": "./helpers/applyDecs2203.js"
+      },
+      "./helpers/applyDecs2203.js"
+    ],
+    "./helpers/esm/applyDecs2203": "./helpers/esm/applyDecs2203.js",
+    "./helpers/applyDecs2203R": [
+      {
+        "node": "./helpers/applyDecs2203R.js",
+        "import": "./helpers/esm/applyDecs2203R.js",
+        "default": "./helpers/applyDecs2203R.js"
+      },
+      "./helpers/applyDecs2203R.js"
+    ],
+    "./helpers/esm/applyDecs2203R": "./helpers/esm/applyDecs2203R.js",
+    "./helpers/applyDecs2301": [
+      {
+        "node": "./helpers/applyDecs2301.js",
+        "import": "./helpers/esm/applyDecs2301.js",
+        "default": "./helpers/applyDecs2301.js"
+      },
+      "./helpers/applyDecs2301.js"
+    ],
+    "./helpers/esm/applyDecs2301": "./helpers/esm/applyDecs2301.js",
+    "./helpers/applyDecs2305": [
+      {
+        "node": "./helpers/applyDecs2305.js",
+        "import": "./helpers/esm/applyDecs2305.js",
+        "default": "./helpers/applyDecs2305.js"
+      },
+      "./helpers/applyDecs2305.js"
+    ],
+    "./helpers/esm/applyDecs2305": "./helpers/esm/applyDecs2305.js",
+    "./helpers/classApplyDescriptorDestructureSet": [
+      {
+        "node": "./helpers/classApplyDescriptorDestructureSet.js",
+        "import": "./helpers/esm/classApplyDescriptorDestructureSet.js",
+        "default": "./helpers/classApplyDescriptorDestructureSet.js"
+      },
+      "./helpers/classApplyDescriptorDestructureSet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorDestructureSet": "./helpers/esm/classApplyDescriptorDestructureSet.js",
+    "./helpers/classApplyDescriptorGet": [
+      {
+        "node": "./helpers/classApplyDescriptorGet.js",
+        "import": "./helpers/esm/classApplyDescriptorGet.js",
+        "default": "./helpers/classApplyDescriptorGet.js"
+      },
+      "./helpers/classApplyDescriptorGet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorGet": "./helpers/esm/classApplyDescriptorGet.js",
+    "./helpers/classApplyDescriptorSet": [
+      {
+        "node": "./helpers/classApplyDescriptorSet.js",
+        "import": "./helpers/esm/classApplyDescriptorSet.js",
+        "default": "./helpers/classApplyDescriptorSet.js"
+      },
+      "./helpers/classApplyDescriptorSet.js"
+    ],
+    "./helpers/esm/classApplyDescriptorSet": "./helpers/esm/classApplyDescriptorSet.js",
+    "./helpers/classCheckPrivateStaticAccess": [
+      {
+        "node": "./helpers/classCheckPrivateStaticAccess.js",
+        "import": "./helpers/esm/classCheckPrivateStaticAccess.js",
+        "default": "./helpers/classCheckPrivateStaticAccess.js"
+      },
+      "./helpers/classCheckPrivateStaticAccess.js"
+    ],
+    "./helpers/esm/classCheckPrivateStaticAccess": "./helpers/esm/classCheckPrivateStaticAccess.js",
+    "./helpers/classCheckPrivateStaticFieldDescriptor": [
+      {
+        "node": "./helpers/classCheckPrivateStaticFieldDescriptor.js",
+        "import": "./helpers/esm/classCheckPrivateStaticFieldDescriptor.js",
+        "default": "./helpers/classCheckPrivateStaticFieldDescriptor.js"
+      },
+      "./helpers/classCheckPrivateStaticFieldDescriptor.js"
+    ],
+    "./helpers/esm/classCheckPrivateStaticFieldDescriptor": "./helpers/esm/classCheckPrivateStaticFieldDescriptor.js",
+    "./helpers/classExtractFieldDescriptor": [
+      {
+        "node": "./helpers/classExtractFieldDescriptor.js",
+        "import": "./helpers/esm/classExtractFieldDescriptor.js",
+        "default": "./helpers/classExtractFieldDescriptor.js"
+      },
+      "./helpers/classExtractFieldDescriptor.js"
+    ],
+    "./helpers/esm/classExtractFieldDescriptor": "./helpers/esm/classExtractFieldDescriptor.js",
+    "./helpers/classPrivateFieldDestructureSet": [
+      {
+        "node": "./helpers/classPrivateFieldDestructureSet.js",
+        "import": "./helpers/esm/classPrivateFieldDestructureSet.js",
+        "default": "./helpers/classPrivateFieldDestructureSet.js"
+      },
+      "./helpers/classPrivateFieldDestructureSet.js"
+    ],
+    "./helpers/esm/classPrivateFieldDestructureSet": "./helpers/esm/classPrivateFieldDestructureSet.js",
+    "./helpers/classPrivateFieldGet": [
+      {
+        "node": "./helpers/classPrivateFieldGet.js",
+        "import": "./helpers/esm/classPrivateFieldGet.js",
+        "default": "./helpers/classPrivateFieldGet.js"
+      },
+      "./helpers/classPrivateFieldGet.js"
+    ],
+    "./helpers/esm/classPrivateFieldGet": "./helpers/esm/classPrivateFieldGet.js",
+    "./helpers/classPrivateFieldSet": [
+      {
+        "node": "./helpers/classPrivateFieldSet.js",
+        "import": "./helpers/esm/classPrivateFieldSet.js",
+        "default": "./helpers/classPrivateFieldSet.js"
+      },
+      "./helpers/classPrivateFieldSet.js"
+    ],
+    "./helpers/esm/classPrivateFieldSet": "./helpers/esm/classPrivateFieldSet.js",
+    "./helpers/classPrivateMethodGet": [
+      {
+        "node": "./helpers/classPrivateMethodGet.js",
+        "import": "./helpers/esm/classPrivateMethodGet.js",
+        "default": "./helpers/classPrivateMethodGet.js"
+      },
+      "./helpers/classPrivateMethodGet.js"
+    ],
+    "./helpers/esm/classPrivateMethodGet": "./helpers/esm/classPrivateMethodGet.js",
+    "./helpers/classPrivateMethodSet": [
+      {
+        "node": "./helpers/classPrivateMethodSet.js",
+        "import": "./helpers/esm/classPrivateMethodSet.js",
+        "default": "./helpers/classPrivateMethodSet.js"
+      },
+      "./helpers/classPrivateMethodSet.js"
+    ],
+    "./helpers/esm/classPrivateMethodSet": "./helpers/esm/classPrivateMethodSet.js",
+    "./helpers/classStaticPrivateFieldDestructureSet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldDestructureSet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldDestructureSet.js",
+        "default": "./helpers/classStaticPrivateFieldDestructureSet.js"
+      },
+      "./helpers/classStaticPrivateFieldDestructureSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldDestructureSet": "./helpers/esm/classStaticPrivateFieldDestructureSet.js",
+    "./helpers/classStaticPrivateFieldSpecGet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldSpecGet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldSpecGet.js",
+        "default": "./helpers/classStaticPrivateFieldSpecGet.js"
+      },
+      "./helpers/classStaticPrivateFieldSpecGet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldSpecGet": "./helpers/esm/classStaticPrivateFieldSpecGet.js",
+    "./helpers/classStaticPrivateFieldSpecSet": [
+      {
+        "node": "./helpers/classStaticPrivateFieldSpecSet.js",
+        "import": "./helpers/esm/classStaticPrivateFieldSpecSet.js",
+        "default": "./helpers/classStaticPrivateFieldSpecSet.js"
+      },
+      "./helpers/classStaticPrivateFieldSpecSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateFieldSpecSet": "./helpers/esm/classStaticPrivateFieldSpecSet.js",
+    "./helpers/classStaticPrivateMethodSet": [
+      {
+        "node": "./helpers/classStaticPrivateMethodSet.js",
+        "import": "./helpers/esm/classStaticPrivateMethodSet.js",
+        "default": "./helpers/classStaticPrivateMethodSet.js"
+      },
+      "./helpers/classStaticPrivateMethodSet.js"
+    ],
+    "./helpers/esm/classStaticPrivateMethodSet": "./helpers/esm/classStaticPrivateMethodSet.js",
+    "./helpers/defineEnumerableProperties": [
+      {
+        "node": "./helpers/defineEnumerableProperties.js",
+        "import": "./helpers/esm/defineEnumerableProperties.js",
+        "default": "./helpers/defineEnumerableProperties.js"
+      },
+      "./helpers/defineEnumerableProperties.js"
+    ],
+    "./helpers/esm/defineEnumerableProperties": "./helpers/esm/defineEnumerableProperties.js",
+    "./helpers/dispose": [
+      {
+        "node": "./helpers/dispose.js",
+        "import": "./helpers/esm/dispose.js",
+        "default": "./helpers/dispose.js"
+      },
+      "./helpers/dispose.js"
+    ],
+    "./helpers/esm/dispose": "./helpers/esm/dispose.js",
+    "./helpers/objectSpread": [
+      {
+        "node": "./helpers/objectSpread.js",
+        "import": "./helpers/esm/objectSpread.js",
+        "default": "./helpers/objectSpread.js"
+      },
+      "./helpers/objectSpread.js"
+    ],
+    "./helpers/esm/objectSpread": "./helpers/esm/objectSpread.js",
+    "./helpers/regeneratorRuntime": [
+      {
+        "node": "./helpers/regeneratorRuntime.js",
+        "import": "./helpers/esm/regeneratorRuntime.js",
+        "default": "./helpers/regeneratorRuntime.js"
+      },
+      "./helpers/regeneratorRuntime.js"
+    ],
+    "./helpers/esm/regeneratorRuntime": "./helpers/esm/regeneratorRuntime.js",
+    "./helpers/using": [
+      {
+        "node": "./helpers/using.js",
+        "import": "./helpers/esm/using.js",
+        "default": "./helpers/using.js"
+      },
+      "./helpers/using.js"
+    ],
+    "./helpers/esm/using": "./helpers/esm/using.js",
+    "./package": "./package.json",
+    "./package.json": "./package.json",
+    "./regenerator": "./regenerator/index.js",
+    "./regenerator/*.js": "./regenerator/*.js",
+    "./regenerator/": "./regenerator/"
+  },
+  "engines": {
+    "node": ">=6.9.0"
+  },
+  "type": "commonjs"
+}
\ No newline at end of file
diff --git a/node_modules/@babel/runtime/regenerator/index.js b/node_modules/@babel/runtime/regenerator/index.js
new file mode 100644
index 0000000..5881357
--- /dev/null
+++ b/node_modules/@babel/runtime/regenerator/index.js
@@ -0,0 +1,15 @@
+// TODO(Babel 8): Remove this file.
+
+var runtime = require("../helpers/regeneratorRuntime")();
+module.exports = runtime;
+
+// Copied from https://github.com/facebook/regenerator/blob/main/packages/runtime/runtime.js#L736=
+try {
+  regeneratorRuntime = runtime;
+} catch (accidentalStrictMode) {
+  if (typeof globalThis === "object") {
+    globalThis.regeneratorRuntime = runtime;
+  } else {
+    Function("r", "regeneratorRuntime = r")(runtime);
+  }
+}
diff --git a/node_modules/@hapi/accept/LICENSE.md b/node_modules/@hapi/accept/LICENSE.md
new file mode 100755
index 0000000..1c118c6
--- /dev/null
+++ b/node_modules/@hapi/accept/LICENSE.md
@@ -0,0 +1,12 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2015-2016, Mark Bradshaw
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/accept/README.md b/node_modules/@hapi/accept/README.md
new file mode 100755
index 0000000..865de15
--- /dev/null
+++ b/node_modules/@hapi/accept/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/accept
+
+#### HTTP Accept-* headers parsing.
+
+**accept** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/accept/)
+- [Version status](https://hapi.dev/resources/status/#accept) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/accept/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/accept/lib/header.js b/node_modules/@hapi/accept/lib/header.js
new file mode 100755
index 0000000..ced9e2b
--- /dev/null
+++ b/node_modules/@hapi/accept/lib/header.js
@@ -0,0 +1,232 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+exports.selection = function (header, preferences, options) {
+
+    const selections = exports.selections(header, preferences, options);
+    return selections.length ? selections[0] : '';
+};
+
+
+exports.selections = function (header, preferences, options) {
+
+    Hoek.assert(!preferences || Array.isArray(preferences), 'Preferences must be an array');
+
+    return internals.parse(header || '', preferences, options);
+};
+
+
+//      RFC 7231 Section 5.3.3 (https://tools.ietf.org/html/rfc7231#section-5.3.3)
+//
+//      Accept-Charset  = *( "," OWS ) ( ( charset / "*" ) [ weight ] ) *( OWS "," [ OWS ( ( charset / "*" ) [ weight ] ) ] )
+//      charset         = token
+//
+//      Accept-Charset: iso-8859-5, unicode-1-1;q=0.8
+
+
+//      RFC 7231 Section 5.3.4 (https://tools.ietf.org/html/rfc7231#section-5.3.4)
+//
+//      Accept-Encoding = [ ( "," / ( codings [ weight ] ) ) *( OWS "," [ OWS ( codings [ weight ] ) ] ) ]
+//      codings         = content-coding / "identity" / "*"
+//      content-coding  = token
+//
+//      Accept-Encoding: compress, gzip
+//      Accept-Encoding:
+//      Accept-Encoding: *
+//      Accept-Encoding: compress;q=0.5, gzip;q=1.0
+//      Accept-Encoding: gzip;q=1.0, identity; q=0.5, *;q=0
+
+
+//      RFC 7231 Section 5.3.5 (https://tools.ietf.org/html/rfc7231#section-5.3.5)
+//
+//      Accept-Language = *( "," OWS ) ( language-range [ weight ] ) *( OWS "," [ OWS ( language-range [ weight ] ) ] )
+//      language-range  = ( 1*8ALPHA *( "-" 1*8alphanum ) ) / "*"   ; [RFC4647], Section 2.1
+//      alphanum        = ALPHA / DIGIT
+//
+//       Accept-Language: da, en-gb;q=0.8, en;q=0.7
+
+
+//      token           = 1*tchar
+//      tchar           = "!" / "#" / "$" / "%" / "&" / "'" / "*"
+//                        / "+" / "-" / "." / "^" / "_" / "`" / "|" / "~"
+//                        / DIGIT / ALPHA
+//                        ; any VCHAR, except delimiters
+//      OWS             = *( SP / HTAB )
+
+
+//      RFC 7231 Section 5.3.1 (https://tools.ietf.org/html/rfc7231#section-5.3.1)
+//
+//      The weight is normalized to a real number in the range 0 through 1,
+//      where 0.001 is the least preferred and 1 is the most preferred; a
+//      value of 0 means "not acceptable".  If no "q" parameter is present,
+//      the default weight is 1.
+//
+//       weight = OWS ";" OWS "q=" qvalue
+//       qvalue = ( "0" [ "." 0*3DIGIT ] ) / ( "1" [ "." 0*3("0") ] )
+
+
+internals.parse = function (raw, preferences, options) {
+
+    // Normalize header (remove spaces and tabs)
+
+    const header = raw.replace(/[ \t]/g, '');
+
+    // Normalize preferences
+
+    const lowers = new Map();
+    if (preferences) {
+        let pos = 0;
+        for (const preference of preferences) {
+            const lower = preference.toLowerCase();
+            lowers.set(lower, { orig: preference, pos: pos++ });
+
+            if (options.prefixMatch) {
+                const parts = lower.split('-');
+                while (parts.pop(), parts.length > 0) {
+                    const joined = parts.join('-');
+                    if (!lowers.has(joined)) {
+                        lowers.set(joined, { orig: preference, pos: pos++ });
+                    }
+                }
+            }
+        }
+    }
+
+    // Parse selections
+
+    const parts = header.split(',');
+    const selections = [];
+    const map = new Set();
+
+    for (let i = 0; i < parts.length; ++i) {
+        const part = parts[i];
+        if (!part) {                            // Ignore empty parts or leading commas
+            continue;
+        }
+
+        // Parse parameters
+
+        const params = part.split(';');
+        if (params.length > 2) {
+            throw Boom.badRequest(`Invalid ${options.type} header`);
+        }
+
+        let token = params[0].toLowerCase();
+        if (!token) {
+            throw Boom.badRequest(`Invalid ${options.type} header`);
+        }
+
+        if (options.equivalents?.has(token)) {
+            token = options.equivalents.get(token);
+        }
+
+        const selection = {
+            token,
+            pos: i,
+            q: 1
+        };
+
+        if (preferences &&
+            lowers.has(token)) {
+
+            selection.pref = lowers.get(token).pos;
+        }
+
+        map.add(selection.token);
+
+        // Parse q=value
+
+        if (params.length === 2) {
+            const q = params[1];
+            const [key, value] = q.split('=');
+
+            if (!value ||
+                key !== 'q' && key !== 'Q') {
+
+                throw Boom.badRequest(`Invalid ${options.type} header`);
+            }
+
+            const score = parseFloat(value);
+            if (score === 0) {
+                continue;
+            }
+
+            if (Number.isFinite(score) &&
+                score <= 1 &&
+                score >= 0.001) {
+
+                selection.q = score;
+            }
+        }
+
+        selections.push(selection);             // Only add allowed selections (q !== 0)
+    }
+
+    // Sort selection based on q and then position in header
+
+    selections.sort(internals.sort);
+
+    // Extract tokens
+
+    const values = selections.map((selection) => selection.token);
+
+    if (options.default &&
+        !map.has(options.default)) {
+
+        values.push(options.default);
+    }
+
+    if (!preferences?.length) {
+        return values;
+    }
+
+    const preferred = [];
+    for (const selection of values) {
+        if (selection === '*') {
+            for (const [preference, value] of lowers) {
+                if (!map.has(preference)) {
+                    preferred.push(value.orig);
+                }
+            }
+        }
+        else {
+            const lower = selection.toLowerCase();
+            if (lowers.has(lower)) {
+                preferred.push(lowers.get(lower).orig);
+            }
+        }
+    }
+
+    return preferred;
+};
+
+
+internals.sort = function (a, b) {
+
+    const aFirst = -1;
+    const bFirst = 1;
+
+    if (b.q !== a.q) {
+        return b.q - a.q;
+    }
+
+    if (b.pref !== a.pref) {
+        if (a.pref === undefined) {
+            return bFirst;
+        }
+
+        if (b.pref === undefined) {
+            return aFirst;
+        }
+
+        return a.pref - b.pref;
+    }
+
+    return a.pos - b.pos;
+};
diff --git a/node_modules/@hapi/accept/lib/index.d.ts b/node_modules/@hapi/accept/lib/index.d.ts
new file mode 100755
index 0000000..a9be6da
--- /dev/null
+++ b/node_modules/@hapi/accept/lib/index.d.ts
@@ -0,0 +1,114 @@
+/**
+ * Identifies the best character-set for an HTTP response based on the HTTP request Accept-Charset header.
+ * 
+ * @param header - the HTTP Accept-Charset header content.
+ * @param preferences - an optional array of character-set strings in order of server preference.
+ * 
+ * @return a string with the preferred accepted character-set.
+ */
+export function charset(header?: string, preferences?: readonly string[]): string;
+
+
+/**
+ * Sorts the character-sets in the HTTP request Accept-Charset header based on client preference from most to least desired.
+ *
+ * @param header - the HTTP Accept-Charset header content.
+ *
+ * @return an array of strings of character-sets sorted from the most to the least desired.
+ */
+export function charsets(header?: string): string[];
+
+
+/**
+ * Identifies the best encoding for an HTTP response based on the HTTP request Accept-Encoding header.
+ *
+ * @param header - the HTTP Accept-Encoding header content.
+ * @param preferences - an optional array of encoding strings in order of server preference.
+ *
+ * @return a string with the preferred accepted encoding.
+ */
+export function encoding(header?: string, preferences?: readonly string[]): string;
+
+
+/**
+ * Sorts the encodings in the HTTP request Accept-Encoding header based on client preference from most to least desired.
+ *
+ * @param header - the HTTP Accept-Encoding header content.
+ *
+ * @return an array of strings of encodings sorted from the most to the least desired.
+ */
+export function encodings(header?: string): string[];
+
+
+/**
+ * Identifies the best language for an HTTP response based on the HTTP request Accept-Language header.
+ *
+ * @param header - the HTTP Accept-Language header content.
+ * @param preferences - an optional array of language strings in order of server preference.
+ *
+ * @return a string with the preferred accepted language.
+ */
+export function language(header?: string, preferences?: readonly string[]): string;
+
+
+/**
+ * Sorts the languages in the HTTP request Accept-Language header based on client preference from most to least desired.
+ *
+ * @param header - the HTTP Accept-Language header content.
+ *
+ * @return an array of strings of languages sorted from the most to the least desired.
+ */
+export function languages(header?: string): string[];
+
+
+/**
+ * Identifies the best media-type for an HTTP response based on the HTTP request Accept header.
+ *
+ * @param header - the HTTP Accept header content.
+ * @param preferences - an optional array of media-type strings in order of server preference.
+ *
+ * @return a string with the preferred accepted media-type.
+ */
+export function mediaType(header?: string, preferences?: readonly string[]): string;
+
+
+/**
+ * Sorts the media-types in the HTTP request Accept header based on client preference from most to least desired.
+ *
+ * @param header - the HTTP Accept header content.
+ * @param preferences - an optional array of media-type strings in order of server preference.
+ *
+ * @return an array of strings of media-types sorted from the most to the least desired.
+ */
+export function mediaTypes(header?: string, preferences?: readonly string[]): string[];
+
+
+/**
+ * Parses the Accept-* headers of an HTTP request and returns an array of client preferences for each header.
+ * 
+ * @param headers - the HTTP request headers object.
+ * 
+ * @return an object with a key for each accept header result.
+ */
+export function parseAll(headers: parseAll.Headers): parseAll.Result;
+
+export namespace parseAll {
+
+    interface Headers {
+
+        readonly 'accept-charset'?: string;
+        readonly 'accept-encoding'?: string;
+        readonly 'accept-language'?: string;
+        readonly accept?: string;
+
+        readonly [header: string]: any;
+    }
+
+    interface Result {
+
+        charsets: string[];
+        encodings: string[];
+        languages: string[];
+        mediaTypes: string[];
+    }
+}
diff --git a/node_modules/@hapi/accept/lib/index.js b/node_modules/@hapi/accept/lib/index.js
new file mode 100755
index 0000000..a406cbd
--- /dev/null
+++ b/node_modules/@hapi/accept/lib/index.js
@@ -0,0 +1,48 @@
+'use strict';
+
+const Header = require('./header');
+const Media = require('./media');
+
+
+const internals = {
+    options: {
+        charset: {
+            type: 'accept-charset'
+        },
+        encoding: {
+            type: 'accept-encoding',
+            default: 'identity',
+            equivalents: new Map([
+                ['x-compress', 'compress'],
+                ['x-gzip', 'gzip']
+            ])
+        },
+        language: {
+            type: 'accept-language',
+            prefixMatch: true
+        }
+    }
+};
+
+
+for (const type in internals.options) {
+    exports[type] = (header, preferences) => Header.selection(header, preferences, internals.options[type]);
+
+    exports[`${type}s`] = (header, preferences) => Header.selections(header, preferences, internals.options[type]);
+}
+
+
+exports.mediaType = (header, preferences) => Media.selection(header, preferences);
+
+exports.mediaTypes = (header, preferences) => Media.selections(header, preferences);
+
+
+exports.parseAll = function (requestHeaders) {
+
+    return {
+        charsets: exports.charsets(requestHeaders['accept-charset']),
+        encodings: exports.encodings(requestHeaders['accept-encoding']),
+        languages: exports.languages(requestHeaders['accept-language']),
+        mediaTypes: exports.mediaTypes(requestHeaders.accept)
+    };
+};
diff --git a/node_modules/@hapi/accept/lib/media.js b/node_modules/@hapi/accept/lib/media.js
new file mode 100755
index 0000000..eeb046f
--- /dev/null
+++ b/node_modules/@hapi/accept/lib/media.js
@@ -0,0 +1,322 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+exports.selection = function (header, preferences) {
+
+    const selections = exports.selections(header, preferences);
+    return selections.length ? selections[0] : '';
+};
+
+
+exports.selections = function (header, preferences) {
+
+    Hoek.assert(!preferences || Array.isArray(preferences), 'Preferences must be an array');
+
+    return internals.parse(header, preferences);
+};
+
+
+//      RFC 7231 Section 5.3.2 (https://tools.ietf.org/html/rfc7231#section-5.3.2)
+//
+//      Accept          = [ ( "," / ( media-range [ accept-params ] ) ) *( OWS "," [ OWS ( media-range [ accept-params ] ) ] ) ]
+//      media-range     = ( "*/*" / ( type "/*" ) / ( type "/" subtype ) ) *( OWS ";" OWS parameter )
+//      accept-params   = weight *accept-ext
+//      accept-ext      = OWS ";" OWS token [ "=" ( token / quoted-string ) ]
+//      type            = token
+//      subtype         = token
+//      parameter       = token "=" ( token / quoted-string )
+//
+//      quoted-string   = DQUOTE *( qdtext / quoted-pair ) DQUOTE
+//      qdtext          = HTAB / SP /%x21 / %x23-5B / %x5D-7E / obs-text
+//      obs-text        = %x80-FF
+//      quoted-pair     = "\" ( HTAB / SP / VCHAR / obs-text )
+//      VCHAR           = %x21-7E                                ; visible (printing) characters
+//      token           = 1*tchar
+//      tchar           = "!" / "#" / "$" / "%" / "&" / "'" / "*" / "+" / "-" / "." / "^" / "_" / "`" / "|" / "~" / DIGIT / ALPHA
+//      OWS             = *( SP / HTAB )
+//
+//      Accept: audio/*; q=0.2, audio/basic
+//      Accept: text/plain; q=0.5, text/html, text/x-dvi; q=0.8, text/x-c
+//      Accept: text/plain, application/json;q=0.5, text/html, */*; q = 0.1
+//      Accept: text/plain, application/json;q=0.5, text/html, text/drop;q=0
+//      Accept: text/*, text/plain, text/plain;format=flowed, */*
+//      Accept: text/*;q=0.3, text/html;q=0.7, text/html;level=1, text/html;level=2;q=0.4, */*;q=0.5
+
+
+//      RFC 7231 Section 5.3.1 (https://tools.ietf.org/html/rfc7231#section-5.3.1)
+//
+//      The weight is normalized to a real number in the range 0 through 1,
+//      where 0.001 is the least preferred and 1 is the most preferred; a
+//      value of 0 means "not acceptable".  If no "q" parameter is present,
+//      the default weight is 1.
+//
+//       weight = OWS ";" OWS "q=" qvalue
+//       qvalue = ( "0" [ "." 0*3DIGIT ] ) / ( "1" [ "." 0*3("0") ] )
+
+
+//                         */*        type/*                              type/subtype
+internals.validMediaRx = /^(?:\*\/\*)|(?:[\w\!#\$%&'\*\+\-\.\^`\|~]+\/\*)|(?:[\w\!#\$%&'\*\+\-\.\^`\|~]+\/[\w\!#\$%&'\*\+\-\.\^`\|~]+)$/;
+
+
+internals.parse = function (raw, preferences) {
+
+    // Normalize header (remove spaces and temporary remove quoted strings)
+
+    const { header, quoted } = internals.normalize(raw);
+
+    // Parse selections
+
+    const parts = header.split(',');
+    const selections = [];
+    const map = {};
+
+    for (let i = 0; i < parts.length; ++i) {
+        const part = parts[i];
+        if (!part) {                                    // Ignore empty parts or leading commas
+            continue;
+        }
+
+        // Parse parameters
+
+        const pairs = part.split(';');
+        const token = pairs.shift().toLowerCase();
+
+        if (!internals.validMediaRx.test(token)) {       // Ignore invalid types
+            continue;
+        }
+
+        const selection = {
+            token,
+            params: {},
+            exts: {},
+            pos: i
+        };
+
+        // Parse key=value
+
+        let target = 'params';
+        for (const pair of pairs) {
+            const kv = pair.split('=');
+            if (kv.length !== 2 ||
+                !kv[1]) {
+
+                throw Boom.badRequest(`Invalid accept header`);
+            }
+
+            const key = kv[0];
+            let value = kv[1];
+
+            if (key === 'q' ||
+                key === 'Q') {
+
+                target = 'exts';
+
+                value = parseFloat(value);
+                if (!Number.isFinite(value) ||
+                    value > 1 ||
+                    (value < 0.001 && value !== 0)) {
+
+                    value = 1;
+                }
+
+                selection.q = value;
+            }
+            else {
+                if (value[0] === '"') {
+                    value = `"${quoted[value]}"`;
+                }
+
+                selection[target][kv[0]] = value;
+            }
+        }
+
+        const params = Object.keys(selection.params);
+        selection.original = [''].concat(params.map((key) => `${key}=${selection.params[key]}`)).join(';');
+        selection.specificity = params.length;
+
+        if (selection.q === undefined) {     // Default no preference to q=1 (top preference)
+            selection.q = 1;
+        }
+
+        const tparts = selection.token.split('/');
+        selection.type = tparts[0];
+        selection.subtype = tparts[1];
+
+        map[selection.token] = selection;
+
+        if (selection.q) {                   // Skip denied selections (q=0)
+            selections.push(selection);
+        }
+    }
+
+    // Sort selection based on q and then position in header
+
+    selections.sort(internals.sort);
+
+    return internals.preferences(map, selections, preferences);
+};
+
+
+internals.normalize = function (raw) {
+
+    raw = raw || '*/*';
+
+    const normalized = {
+        header: raw,
+        quoted: {}
+    };
+
+    if (raw.includes('"')) {
+        let i = 0;
+        normalized.header = raw.replace(/="([^"]*)"/g, ($0, $1) => {
+
+            const key = '"' + ++i;
+            normalized.quoted[key] = $1;
+            return '=' + key;
+        });
+    }
+
+    normalized.header = normalized.header.replace(/[ \t]/g, '');
+    return normalized;
+};
+
+
+internals.sort = function (a, b) {
+
+    // Sort by quality score
+
+    if (b.q !== a.q) {
+        return b.q - a.q;
+    }
+
+    // Sort by type
+
+    if (a.type !== b.type) {
+        return internals.innerSort(a, b, 'type');
+    }
+
+    // Sort by subtype
+
+    if (a.subtype !== b.subtype) {
+        return internals.innerSort(a, b, 'subtype');
+    }
+
+    // Sort by specificity
+
+    if (a.specificity !== b.specificity) {
+        return b.specificity - a.specificity;
+    }
+
+    return a.pos - b.pos;
+};
+
+
+internals.innerSort = function (a, b, key) {
+
+    const aFirst = -1;
+    const bFirst = 1;
+
+    if (a[key] === '*') {
+        return bFirst;
+    }
+
+    if (b[key] === '*') {
+        return aFirst;
+    }
+
+    return a[key] < b[key] ? aFirst : bFirst;       // Group alphabetically
+};
+
+
+internals.preferences = function (map, selections, preferences) {
+
+    // Return selections if no preferences
+
+    if (!preferences?.length) {
+        return selections.map((selection) => selection.token + selection.original);
+    }
+
+    // Map wildcards and filter selections to preferences
+
+    const lowers = Object.create(null);
+    const flat = Object.create(null);
+    let any = false;
+
+    for (const preference of preferences) {
+        const lower = preference.toLowerCase();
+        flat[lower] = preference;
+        const parts = lower.split('/');
+        const type = parts[0];
+        const subtype = parts[1];
+
+        if (type === '*') {
+            Hoek.assert(subtype === '*', 'Invalid media type preference contains wildcard type with a subtype');
+            any = true;
+            continue;
+        }
+
+        lowers[type] = lowers[type] ?? Object.create(null);
+        lowers[type][subtype] = preference;
+    }
+
+    const preferred = [];
+    for (const selection of selections) {
+        const token = selection.token;
+        const { type, subtype } = map[token];
+        const subtypes = lowers[type];
+
+        // */*
+
+        if (type === '*') {
+            for (const preference of Object.keys(flat)) {
+                if (!map[preference]) {
+                    preferred.push(flat[preference]);
+                }
+            }
+
+            if (any) {
+                preferred.push('*/*');
+            }
+
+            continue;
+        }
+
+        // any
+
+        if (any) {
+            preferred.push((flat[token] || token) + selection.original);
+            continue;
+        }
+
+        // type/subtype
+
+        if (subtype !== '*') {
+            const pref = flat[token];
+            if (pref ||
+                (subtypes && subtypes['*'])) {
+
+                preferred.push((pref || token) + selection.original);
+            }
+
+            continue;
+        }
+
+        // type/*
+
+        if (subtypes) {
+            for (const psub of Object.keys(subtypes)) {
+                if (!map[`${type}/${psub}`]) {
+                    preferred.push(subtypes[psub]);
+                }
+            }
+        }
+    }
+
+    return preferred;
+};
diff --git a/node_modules/@hapi/accept/package.json b/node_modules/@hapi/accept/package.json
new file mode 100755
index 0000000..877f4b8
--- /dev/null
+++ b/node_modules/@hapi/accept/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "@hapi/accept",
+  "description": "HTTP Accept-* headers parsing",
+  "version": "6.0.3",
+  "repository": "git://github.com/hapijs/accept",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "HTTP",
+    "header",
+    "accept",
+    "accept-encoding"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/ammo/LICENSE.md b/node_modules/@hapi/ammo/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/ammo/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/ammo/README.md b/node_modules/@hapi/ammo/README.md
new file mode 100644
index 0000000..04cdac5
--- /dev/null
+++ b/node_modules/@hapi/ammo/README.md
@@ -0,0 +1,18 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/ammo
+
+#### HTTP Range processing utilities.
+
+**ammo** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/ammo/)
+- [Versions status](https://hapi.dev/resources/status/#ammo) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/ammo/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
+
diff --git a/node_modules/@hapi/ammo/lib/index.d.ts b/node_modules/@hapi/ammo/lib/index.d.ts
new file mode 100755
index 0000000..69604ba
--- /dev/null
+++ b/node_modules/@hapi/ammo/lib/index.d.ts
@@ -0,0 +1,41 @@
+/// <reference types="node" />
+
+import * as Stream from 'stream';
+
+
+/**
+ * Parses an HTTP Range header.
+ * 
+ * @param header - the HTTP Range header.
+ * @param length - the payload length.
+ * 
+ * @returns an array of range objects.
+ */
+export function header(header: string, length: number): null | Range[];
+
+
+/**
+ * A transform stream taking full payload and returning the requested range.
+ */
+export class Clip extends Stream.Transform {
+
+    /**
+     * Constructs a new transform steam.
+     * 
+     * @param range - the requested range.
+     */
+    constructor(range: Range);
+}
+
+
+export interface Range {
+    /**
+     * The range start position (inclusive).
+     */
+    readonly from: number;
+
+    /**
+     * The range end position (inclusive).
+     */
+    readonly to: number;
+}
diff --git a/node_modules/@hapi/ammo/lib/index.js b/node_modules/@hapi/ammo/lib/index.js
new file mode 100755
index 0000000..4baef6e
--- /dev/null
+++ b/node_modules/@hapi/ammo/lib/index.js
@@ -0,0 +1,185 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+// RFC 7233 (https://tools.ietf.org/html/rfc7233#appendix-D)
+//
+// Range = "bytes" "=" byte-range-set
+// byte-range-set = *( "," OWS ) byte-range-spec *( OWS "," [ OWS byte-range-spec ] )
+// byte-range-spec = ( 1*DIGIT "-" [ 1*DIGIT ] ) / ( "-" 1*DIGIT )
+
+
+//                                12  3          3 4       425         6  7          7 8       865 1
+internals.headerRx = /^bytes=[\s,]*((?:(?:\d+\-\d*)|(?:\-\d+))(?:\s*,\s*(?:(?:\d+\-\d*)|(?:\-\d+)))*)$/i;
+
+
+exports.header = function (header, length) {
+
+    // Parse header
+
+    const parts = internals.headerRx.exec(header);
+    if (!parts) {
+        return null;
+    }
+
+    const lastPos = length - 1;
+
+    const result = [];
+    const ranges = parts[1].match(/\d*\-\d*/g);
+
+    // Handle headers with multiple ranges
+
+    for (let range of ranges) {
+        let from;
+        let to;
+        range = range.split('-');
+        if (range[0]) {
+            from = parseInt(range[0], 10);
+        }
+
+        if (range[1]) {
+            to = parseInt(range[1], 10);
+            if (from !== undefined) {      // Can be 0
+                // From-To
+                if (to > lastPos) {
+                    to = lastPos;
+                }
+            }
+            else {
+                // -To
+                from = length - to;
+                to = lastPos;
+            }
+        }
+        else {
+            // From-
+            to = lastPos;
+        }
+
+        if (from > to) {
+            return null;
+        }
+
+        result.push(new internals.Range(from, to));
+    }
+
+    if (result.length === 1) {
+        return result;
+    }
+
+    // Sort and consolidate ranges
+
+    result.sort((a, b) => a.from - b.from);
+
+    const consolidated = [];
+    for (let i = result.length - 1; i > 0; --i) {
+        const current = result[i];
+        const before = result[i - 1];
+        if (current.from <= before.to + 1) {
+            before.to = current.to;
+        }
+        else {
+            consolidated.unshift(current);
+        }
+    }
+
+    consolidated.unshift(result[0]);
+
+    return consolidated;
+};
+
+
+internals.Range = class {
+
+    constructor(from, to) {
+
+        this.from = from;
+        this.to = to;
+    }
+};
+
+
+exports.Clip = class extends Stream.Transform {
+
+    constructor(range) {
+
+        if (!(range instanceof internals.Range)) {
+            Hoek.assert(typeof range === 'object', 'Expected "range" object');
+
+            const from = range.from ?? 0;
+            Hoek.assert(typeof from === 'number', '"range.from" must be a number');
+            Hoek.assert(from === parseInt(from, 10) && from >= 0, '"range.from" must be a positive integer');
+
+            const to = range.to ?? 0;
+            Hoek.assert(typeof to === 'number', '"range.to" must be a number');
+            Hoek.assert(to === parseInt(to, 10) && to >= 0, '"range.to" must be a positive integer');
+
+            Hoek.assert(to >= from, '"range.to" must be greater than or equal to "range.from"');
+
+            range = new internals.Range(from, to);
+        }
+
+        super();
+
+        this._range = range;
+        this._next = 0;
+
+        this._pipes = new Set();
+        this.on('pipe', (pipe) => this._pipes.add(pipe));
+        this.on('unpipe', (pipe) => this._pipes.delete(pipe));
+    }
+
+    _transform(chunk, encoding, done) {
+
+        try {
+            internals.processChunk(this, chunk);
+        }
+        catch (err) {
+            return done(err);
+        }
+
+        return done();
+    }
+
+    _flush(done) {
+
+        this._pipes.clear();
+        done();
+    }
+};
+
+
+internals.processChunk = function (stream, chunk) {
+
+    // Read desired range from a stream
+
+    const pos = stream._next;
+    stream._next = stream._next + chunk.length;
+
+    if (stream._next <= stream._range.from) {           // Before range
+        return;
+    }
+
+    if (pos > stream._range.to) {                       // After range
+        for (const pipe of stream._pipes) {
+            pipe.unpipe(stream);
+        }
+
+        stream._pipes.clear();
+        stream.end();
+        return;
+    }
+
+    // Calculate bounds of chunk to read
+
+    const from = Math.max(0, stream._range.from - pos);
+    const to = Math.min(chunk.length, stream._range.to - pos + 1);
+
+    stream.push(chunk.slice(from, to));
+};
diff --git a/node_modules/@hapi/ammo/package.json b/node_modules/@hapi/ammo/package.json
new file mode 100755
index 0000000..39edfc0
--- /dev/null
+++ b/node_modules/@hapi/ammo/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "@hapi/ammo",
+  "description": "HTTP Range processing utilities",
+  "version": "6.0.1",
+  "repository": "git://github.com/hapijs/ammo",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "keywords": [
+    "http",
+    "range",
+    "utilities"
+  ],
+  "files": [
+    "lib"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@hapi/wreck": "^18.0.1",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/b64/LICENSE.md b/node_modules/@hapi/b64/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/b64/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/b64/README.md b/node_modules/@hapi/b64/README.md
new file mode 100644
index 0000000..b7171d8
--- /dev/null
+++ b/node_modules/@hapi/b64/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/b64
+
+#### Base64 streaming encoder and decoder.
+
+**b64** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/b64/)
+- [Versions status](https://hapi.dev/resources/status/#b64) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/b64/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/b64/lib/decoder.js b/node_modules/@hapi/b64/lib/decoder.js
new file mode 100755
index 0000000..23efe06
--- /dev/null
+++ b/node_modules/@hapi/b64/lib/decoder.js
@@ -0,0 +1,126 @@
+'use strict';
+
+/*
+    Decode functions adapted from:
+    Version 1.0 12/25/99 Copyright (C) 1999 Masanao Izumo <iz@onicos.co.jp>
+    http://www.onicos.com/staff/iz/amuse/javascript/expert/base64.txt
+*/
+
+const Stream = require('stream');
+
+
+const internals = {
+    decodeChars: [
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
+        52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1,
+        -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
+        15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
+        -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
+        41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1
+    ]
+};
+
+
+exports.decode = function (buffer) {
+
+    const decodeChars = internals.decodeChars;
+    const len = buffer.length;
+    const allocated = Math.ceil(len / 4) * 3;
+    const result = Buffer.alloc(allocated);
+
+    let c1;
+    let c2;
+    let c3;
+    let c4;
+    let j = 0;
+
+    for (let i = 0; i < len; ) {
+        do {
+            c1 = decodeChars[buffer[i++] & 0xff];
+        }
+        while (i < len && c1 === -1);
+
+        if (c1 === -1) {
+            break;
+        }
+
+        do {
+            c2 = decodeChars[buffer[i++] & 0xff];
+        }
+        while (i < len && c2 === -1);
+
+        if (c2 === -1) {
+            break;
+        }
+
+        result[j++] = (c1 << 2) | ((c2 & 0x30) >> 4);
+
+        do {
+            c3 = buffer[i++] & 0xff;
+            if (c3 === 61) {                        // =
+                return result.slice(0, j);
+            }
+
+            c3 = decodeChars[c3];
+        }
+        while (i < len && c3 === -1);
+
+        if (c3 === -1) {
+            break;
+        }
+
+        result[j++] = ((c2 & 0x0f) << 4) | ((c3 & 0x3c) >> 2);
+
+        do {
+            c4 = buffer[i++] & 0xff;
+            if (c4 === 61) {                        // =
+                return result.slice(0, j);
+            }
+
+            c4 = decodeChars[c4];
+        }
+        while (i < len && c4 === -1);
+
+        if (c4 !== -1) {
+            result[j++] = ((c3 & 0x03) << 6) | c4;
+        }
+    }
+
+    return (j === allocated ? result : result.slice(0, j));
+};
+
+
+exports.Decoder = class Decoder extends Stream.Transform {
+    constructor() {
+
+        super();
+        this._reminder = null;
+    }
+
+    _transform(chunk, encoding, callback) {
+
+        let part = this._reminder ? Buffer.concat([this._reminder, chunk]) : chunk;
+        const remaining = part.length % 4;
+        if (remaining) {
+            this._reminder = part.slice(part.length - remaining);
+            part = part.slice(0, part.length - remaining);
+        }
+        else {
+            this._reminder = null;
+        }
+
+        this.push(exports.decode(part));
+        return callback();
+    }
+
+    _flush(callback) {
+
+        if (this._reminder) {
+            this.push(exports.decode(this._reminder));
+        }
+
+        return callback();
+    }
+};
diff --git a/node_modules/@hapi/b64/lib/encoder.js b/node_modules/@hapi/b64/lib/encoder.js
new file mode 100755
index 0000000..c32ef6f
--- /dev/null
+++ b/node_modules/@hapi/b64/lib/encoder.js
@@ -0,0 +1,52 @@
+'use strict';
+
+/*
+    Encode functions adapted from:
+    Version 1.0 12/25/99 Copyright (C) 1999 Masanao Izumo <iz@onicos.co.jp>
+    http://www.onicos.com/staff/iz/amuse/javascript/expert/base64.txt
+*/
+
+const Stream = require('stream');
+
+
+const internals = {};
+
+
+exports.encode = function (buffer) {
+
+    return Buffer.from(buffer.toString('base64'));
+};
+
+
+exports.Encoder = class Encoder extends Stream.Transform {
+    constructor() {
+
+        super();
+        this._reminder = null;
+    }
+
+    _transform(chunk, encoding, callback) {
+
+        let part = this._reminder ? Buffer.concat([this._reminder, chunk]) : chunk;
+        const remaining = part.length % 3;
+        if (remaining) {
+            this._reminder = part.slice(part.length - remaining);
+            part = part.slice(0, part.length - remaining);
+        }
+        else {
+            this._reminder = null;
+        }
+
+        this.push(exports.encode(part));
+        return callback();
+    }
+
+    _flush(callback) {
+
+        if (this._reminder) {
+            this.push(exports.encode(this._reminder));
+        }
+
+        return callback();
+    }
+};
diff --git a/node_modules/@hapi/b64/lib/index.js b/node_modules/@hapi/b64/lib/index.js
new file mode 100755
index 0000000..fc5a70d
--- /dev/null
+++ b/node_modules/@hapi/b64/lib/index.js
@@ -0,0 +1,44 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+
+const Decoder = require('./decoder');
+const Encoder = require('./encoder');
+
+
+exports.decode = Decoder.decode;
+
+exports.encode = Encoder.encode;
+
+exports.Decoder = Decoder.Decoder;
+
+exports.Encoder = Encoder.Encoder;
+
+
+// Base64url (RFC 4648) encode
+
+exports.base64urlEncode = function (value, encoding) {
+
+    Hoek.assert(typeof value === 'string' || Buffer.isBuffer(value), 'value must be string or buffer');
+    const buf = (Buffer.isBuffer(value) ? value : Buffer.from(value, encoding || 'binary'));
+    return buf.toString('base64').replace(/\+/g, '-').replace(/\//g, '_').replace(/\=/g, '');
+};
+
+
+// Base64url (RFC 4648) decode
+
+exports.base64urlDecode = function (value, encoding) {
+
+    if (typeof value !== 'string') {
+
+        throw new Error('Value not a string');
+    }
+
+    if (!/^[\w\-]*$/.test(value)) {
+
+        throw new Error('Invalid character');
+    }
+
+    const buf = Buffer.from(value, 'base64');
+    return (encoding === 'buffer' ? buf : buf.toString(encoding || 'binary'));
+};
diff --git a/node_modules/@hapi/b64/package.json b/node_modules/@hapi/b64/package.json
new file mode 100644
index 0000000..2c02e63
--- /dev/null
+++ b/node_modules/@hapi/b64/package.json
@@ -0,0 +1,36 @@
+{
+  "name": "@hapi/b64",
+  "description": "Base64 streaming encoder and decoder",
+  "version": "6.0.1",
+  "repository": "git://github.com/hapijs/b64",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "buffer",
+    "base64",
+    "decode",
+    "encode",
+    "stream"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.0.1",
+    "@hapi/wreck": "^18.0.0"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/boom/LICENSE.md b/node_modules/@hapi/boom/LICENSE.md
new file mode 100755
index 0000000..675e12f
--- /dev/null
+++ b/node_modules/@hapi/boom/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/boom/README.md b/node_modules/@hapi/boom/README.md
new file mode 100755
index 0000000..2f10a7c
--- /dev/null
+++ b/node_modules/@hapi/boom/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/boom
+
+#### HTTP-friendly error objects.
+
+**boom** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/boom/)
+- [Version status](https://hapi.dev/resources/status/#boom) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/boom/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/boom/lib/index.d.ts b/node_modules/@hapi/boom/lib/index.d.ts
new file mode 100755
index 0000000..34132bb
--- /dev/null
+++ b/node_modules/@hapi/boom/lib/index.d.ts
@@ -0,0 +1,549 @@
+/**
+ * An Error object used to return an HTTP response error (4xx, 5xx)
+ */
+export class Boom<Data = any> extends Error {
+
+    /**
+     * Creates a new Boom object using the provided message or Error
+     */
+    constructor(message?: string | Error, options?: Options<Data>);
+
+    /**
+     * Custom error data with additional information specific to the error type
+     */
+    data?: Data;
+
+    /**
+     * isBoom - if true, indicates this is a Boom object instance.
+     */
+    isBoom: boolean;
+
+    /**
+     * Convenience boolean indicating status code >= 500
+     */
+    isServer: boolean;
+
+    /**
+     * The error message
+     */
+    message: string;
+
+    /**
+     * The formatted response
+     */
+    output: Output;
+
+    /**
+     * The constructor used to create the error
+     */
+    typeof: Function;
+
+    /**
+     * Specifies if an error object is a valid boom object
+     *
+     * @param debug - A boolean that, when true, does not hide the original 500 error message. Defaults to false.
+     */
+    reformat(debug?: boolean): string;
+}
+
+
+export interface Options<Data> {
+    /**
+     * The HTTP status code
+     *
+     * @default 500
+     */
+    statusCode?: number;
+
+    /**
+     * Additional error information
+     */
+    data?: Data;
+
+    /**
+     * Constructor reference used to crop the exception call stack output
+     */
+    ctor?: Function;
+
+    /**
+     * Error message string
+     *
+     * @default none
+     */
+    message?: string;
+
+    /**
+     * If false, the err provided is a Boom object, and a statusCode or message are provided, the values are ignored
+     *
+     * @default true
+     */
+    override?: boolean;
+}
+
+
+export interface Decorate<Decoration> {
+
+    /**
+     * An option with extra properties to set on the error object
+     */
+    decorate?: Decoration;
+}
+
+
+export interface Payload {
+    /**
+     * The HTTP status code derived from error.output.statusCode
+     */
+    statusCode: number;
+
+    /**
+     * The HTTP status message derived from statusCode
+     */
+    error: string;
+
+    /**
+     * The error message derived from error.message
+     */
+    message: string;
+
+    /**
+     * Custom properties
+     */
+    [key: string]: unknown;
+}
+
+
+export interface Output {
+    /**
+     * The HTTP status code
+     */
+    statusCode: number;
+
+    /**
+     * An object containing any HTTP headers where each key is a header name and value is the header content
+     */
+    headers: { [header: string]: string | string[] | number | undefined };
+
+    /**
+     * The formatted object used as the response payload (stringified)
+     */
+    payload: Payload;
+}
+
+
+/**
+* Specifies if an object is a valid boom object
+*
+* @param obj - The object to assess
+* @param statusCode - Optional status code
+*
+* @returns Returns a boolean stating if the error object is a valid boom object and it has the provided statusCode (if present)
+*/
+export function isBoom(obj: unknown, statusCode?: number): obj is Boom;
+
+
+/**
+* Specifies if an error object is a valid boom object
+*
+* @param err - The error object to decorate
+* @param options - Options object
+*
+* @returns A decorated boom object
+*/
+export function boomify<Data, Decoration>(err: Error, options?: Options<Data> & Decorate<Decoration>): Boom<Data> & Decoration;
+
+
+// 4xx Errors
+
+/**
+* Returns a 400 Bad Request error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 400 bad request error
+*/
+export function badRequest<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 401 Unauthorized error
+*
+* @param messageOrError - Optional message or Error
+*
+* @returns A 401 Unauthorized error
+*/
+export function unauthorized<Data>(messageOrError?: string | Error | null): Boom<Data>;
+
+
+/**
+* Returns a 401 Unauthorized error
+*
+* @param message - Optional message
+* @param scheme - the authentication scheme name
+* @param attributes - an object of values used to construct the 'WWW-Authenticate' header
+*
+* @returns A 401 Unauthorized error
+*/
+export function unauthorized<Data>(message: '' | null, scheme: string, attributes?: string | unauthorized.Attributes): Boom<Data> & unauthorized.MissingAuth;
+export function unauthorized<Data>(message: string | null, scheme: string, attributes?: string | unauthorized.Attributes): Boom<Data>;
+
+
+export namespace unauthorized {
+
+    interface Attributes {
+        [index: string]: number | string | null | undefined;
+    }
+
+    interface MissingAuth {
+
+        /**
+         * Indicate whether the 401 unauthorized error is due to missing credentials (vs. invalid)
+         */
+        isMissing: boolean;
+    }
+}
+
+
+/**
+* Returns a 401 Unauthorized error
+*
+* @param message - Optional message
+* @param wwwAuthenticate - array of string values used to construct the wwwAuthenticate header
+*
+* @returns A 401 Unauthorized error
+*/
+export function unauthorized<Data>(message: string | null, wwwAuthenticate: string[]): Boom<Data>;
+
+
+/**
+* Returns a 402 Payment Required error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 402 Payment Required error
+*/
+export function paymentRequired<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 403 Forbidden error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 403 Forbidden error
+*/
+export function forbidden<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 404 Not Found error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 404 Not Found error
+*/
+export function notFound<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 405 Method Not Allowed error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+* @param allow - Optional string or array of strings which is used to set the 'Allow' header
+*
+* @returns A 405 Method Not Allowed error
+*/
+export function methodNotAllowed<Data>(messageOrError?: string | Error, data?: Data, allow?: string | string[]): Boom<Data>;
+
+
+/**
+* Returns a 406 Not Acceptable error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 406 Not Acceptable error
+*/
+export function notAcceptable<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 407 Proxy Authentication error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 407 Proxy Authentication error
+*/
+export function proxyAuthRequired<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 408 Request Time-out error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 408 Request Time-out error
+*/
+export function clientTimeout<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 409 Conflict error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 409 Conflict error
+*/
+export function conflict<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 410 Gone error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 410 gone error
+*/
+export function resourceGone<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 411 Length Required error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 411 Length Required error
+*/
+export function lengthRequired<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 412 Precondition Failed error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 412 Precondition Failed error
+*/
+export function preconditionFailed<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 413 Request Entity Too Large error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 413 Request Entity Too Large error
+*/
+export function entityTooLarge<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 414 Request-URI Too Large error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 414 Request-URI Too Large error
+*/
+export function uriTooLong<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 415 Unsupported Media Type error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 415 Unsupported Media Type error
+*/
+export function unsupportedMediaType<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 416 Request Range Not Satisfiable error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 416 Request Range Not Satisfiable error
+*/
+export function rangeNotSatisfiable<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 417 Expectation Failed error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 417 Expectation Failed error
+*/
+export function expectationFailed<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 418 I'm a Teapot error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 418 I'm a Teapot error
+*/
+export function teapot<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 422 Unprocessable Entity error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 422 Unprocessable Entity error
+*/
+export function badData<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 423 Locked error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 423 Locked error
+*/
+export function locked<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 424 Failed Dependency error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 424 Failed Dependency error
+*/
+export function failedDependency<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+/**
+* Returns a 425 Too Early error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 425 Too Early error
+*/
+export function tooEarly<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 428 Precondition Required error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 428 Precondition Required error
+*/
+export function preconditionRequired<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 429 Too Many Requests error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 429 Too Many Requests error
+*/
+export function tooManyRequests<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 451 Unavailable For Legal Reasons error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 451 Unavailable for Legal Reasons error
+*/
+export function illegal<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+// 5xx Errors
+
+/**
+* Returns a internal error (defaults to 500)
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+* @param statusCode - Optional status code override. Defaults to 500.
+*
+* @returns A 500 Internal Server error
+*/
+export function internal<Data>(messageOrError?: string | Error, data?: Data, statusCode?: number): Boom<Data>;
+
+
+/**
+* Returns a 500 Internal Server Error error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 500 Internal Server error
+*/
+export function badImplementation<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 501 Not Implemented error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 501 Not Implemented error
+*/
+export function notImplemented<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 502 Bad Gateway error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 502 Bad Gateway error
+*/
+export function badGateway<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 503 Service Unavailable error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 503 Service Unavailable error
+*/
+export function serverUnavailable<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
+
+
+/**
+* Returns a 504 Gateway Time-out error
+*
+* @param messageOrError - Optional message or Error
+* @param data - Optional additional error data
+*
+* @returns A 504 Gateway Time-out error
+*/
+export function gatewayTimeout<Data>(messageOrError?: string | Error, data?: Data): Boom<Data>;
diff --git a/node_modules/@hapi/boom/lib/index.js b/node_modules/@hapi/boom/lib/index.js
new file mode 100755
index 0000000..709b754
--- /dev/null
+++ b/node_modules/@hapi/boom/lib/index.js
@@ -0,0 +1,464 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {
+    codes: new Map([
+        [100, 'Continue'],
+        [101, 'Switching Protocols'],
+        [102, 'Processing'],
+        [200, 'OK'],
+        [201, 'Created'],
+        [202, 'Accepted'],
+        [203, 'Non-Authoritative Information'],
+        [204, 'No Content'],
+        [205, 'Reset Content'],
+        [206, 'Partial Content'],
+        [207, 'Multi-Status'],
+        [300, 'Multiple Choices'],
+        [301, 'Moved Permanently'],
+        [302, 'Moved Temporarily'],
+        [303, 'See Other'],
+        [304, 'Not Modified'],
+        [305, 'Use Proxy'],
+        [307, 'Temporary Redirect'],
+        [400, 'Bad Request'],
+        [401, 'Unauthorized'],
+        [402, 'Payment Required'],
+        [403, 'Forbidden'],
+        [404, 'Not Found'],
+        [405, 'Method Not Allowed'],
+        [406, 'Not Acceptable'],
+        [407, 'Proxy Authentication Required'],
+        [408, 'Request Time-out'],
+        [409, 'Conflict'],
+        [410, 'Gone'],
+        [411, 'Length Required'],
+        [412, 'Precondition Failed'],
+        [413, 'Request Entity Too Large'],
+        [414, 'Request-URI Too Large'],
+        [415, 'Unsupported Media Type'],
+        [416, 'Requested Range Not Satisfiable'],
+        [417, 'Expectation Failed'],
+        [418, 'I\'m a teapot'],
+        [422, 'Unprocessable Entity'],
+        [423, 'Locked'],
+        [424, 'Failed Dependency'],
+        [425, 'Too Early'],
+        [426, 'Upgrade Required'],
+        [428, 'Precondition Required'],
+        [429, 'Too Many Requests'],
+        [431, 'Request Header Fields Too Large'],
+        [451, 'Unavailable For Legal Reasons'],
+        [500, 'Internal Server Error'],
+        [501, 'Not Implemented'],
+        [502, 'Bad Gateway'],
+        [503, 'Service Unavailable'],
+        [504, 'Gateway Time-out'],
+        [505, 'HTTP Version Not Supported'],
+        [506, 'Variant Also Negotiates'],
+        [507, 'Insufficient Storage'],
+        [509, 'Bandwidth Limit Exceeded'],
+        [510, 'Not Extended'],
+        [511, 'Network Authentication Required']
+    ])
+};
+
+
+exports.Boom = class extends Error {
+
+    constructor(messageOrError, options = {}) {
+
+        if (messageOrError instanceof Error) {
+            return exports.boomify(Hoek.clone(messageOrError), options);
+        }
+
+        const { statusCode = 500, data = null, ctor = exports.Boom } = options;
+        const error = new Error(messageOrError ? messageOrError : undefined);         // Avoids settings null message
+        Error.captureStackTrace(error, ctor);                           // Filter the stack to our external API
+        error.data = data;
+        const boom = internals.initialize(error, statusCode);
+
+        Object.defineProperty(boom, 'typeof', { value: ctor });
+
+        if (options.decorate) {
+            Object.assign(boom, options.decorate);
+        }
+
+        return boom;
+    }
+
+    static [Symbol.hasInstance](instance) {
+
+        if (this === exports.Boom) {
+            return exports.isBoom(instance);
+        }
+
+        // Cannot use 'instanceof' as it creates infinite recursion
+
+        return this.prototype.isPrototypeOf(instance);
+    }
+};
+
+
+exports.isBoom = function (err, statusCode) {
+
+    return err instanceof Error && !!err.isBoom && (!statusCode || err.output.statusCode === statusCode);
+};
+
+
+exports.boomify = function (err, options) {
+
+    Hoek.assert(err instanceof Error, 'Cannot wrap non-Error object');
+
+    options = options || {};
+
+    if (options.data !== undefined) {
+        err.data = options.data;
+    }
+
+    if (options.decorate) {
+        Object.assign(err, options.decorate);
+    }
+
+    if (!err.isBoom) {
+        return internals.initialize(err, options.statusCode ?? 500, options.message);
+    }
+
+    if (options.override === false ||                           // Defaults to true
+        !options.statusCode && !options.message) {
+
+        return err;
+    }
+
+    return internals.initialize(err, options.statusCode ?? err.output.statusCode, options.message);
+};
+
+
+// 4xx Client Errors
+
+exports.badRequest = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 400, data, ctor: exports.badRequest });
+};
+
+
+exports.unauthorized = function (message, scheme, attributes) {          // Or (message, wwwAuthenticate[])
+
+    const err = new exports.Boom(message, { statusCode: 401, ctor: exports.unauthorized });
+
+    // function (message)
+
+    if (!scheme) {
+        return err;
+    }
+
+    // function (message, wwwAuthenticate[])
+
+    if (typeof scheme !== 'string') {
+        err.output.headers['WWW-Authenticate'] = scheme.join(', ');
+        return err;
+    }
+
+    // function (message, scheme, attributes)
+
+    let wwwAuthenticate = `${scheme}`;
+
+    if (attributes ||
+        message) {
+
+        err.output.payload.attributes = {};
+    }
+
+    if (attributes) {
+        if (typeof attributes === 'string') {
+            wwwAuthenticate += ' ' + Hoek.escapeHeaderAttribute(attributes);
+            err.output.payload.attributes = attributes;
+        }
+        else {
+            wwwAuthenticate += ' ' + Object.keys(attributes).map((name) => {
+
+                const value = attributes[name] ?? '';
+
+                err.output.payload.attributes[name] = value;
+                return `${name}="${Hoek.escapeHeaderAttribute(value.toString())}"`;
+            })
+                .join(', ');
+        }
+    }
+
+    if (message) {
+        if (attributes) {
+            wwwAuthenticate += ',';
+        }
+
+        wwwAuthenticate += ` error="${Hoek.escapeHeaderAttribute(message)}"`;
+        err.output.payload.attributes.error = message;
+    }
+    else {
+        err.isMissing = true;
+    }
+
+    err.output.headers['WWW-Authenticate'] = wwwAuthenticate;
+    return err;
+};
+
+
+exports.paymentRequired = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 402, data, ctor: exports.paymentRequired });
+};
+
+
+exports.forbidden = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 403, data, ctor: exports.forbidden });
+};
+
+
+exports.notFound = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 404, data, ctor: exports.notFound });
+};
+
+
+exports.methodNotAllowed = function (messageOrError, data, allow) {
+
+    const err = new exports.Boom(messageOrError, { statusCode: 405, data, ctor: exports.methodNotAllowed });
+
+    if (typeof allow === 'string') {
+        allow = [allow];
+    }
+
+    if (Array.isArray(allow)) {
+        err.output.headers.Allow = allow.join(', ');
+    }
+
+    return err;
+};
+
+
+exports.notAcceptable = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 406, data, ctor: exports.notAcceptable });
+};
+
+
+exports.proxyAuthRequired = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 407, data, ctor: exports.proxyAuthRequired });
+};
+
+
+exports.clientTimeout = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 408, data, ctor: exports.clientTimeout });
+};
+
+
+exports.conflict = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 409, data, ctor: exports.conflict });
+};
+
+
+exports.resourceGone = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 410, data, ctor: exports.resourceGone });
+};
+
+
+exports.lengthRequired = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 411, data, ctor: exports.lengthRequired });
+};
+
+
+exports.preconditionFailed = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 412, data, ctor: exports.preconditionFailed });
+};
+
+
+exports.entityTooLarge = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 413, data, ctor: exports.entityTooLarge });
+};
+
+
+exports.uriTooLong = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 414, data, ctor: exports.uriTooLong });
+};
+
+
+exports.unsupportedMediaType = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 415, data, ctor: exports.unsupportedMediaType });
+};
+
+
+exports.rangeNotSatisfiable = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 416, data, ctor: exports.rangeNotSatisfiable });
+};
+
+
+exports.expectationFailed = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 417, data, ctor: exports.expectationFailed });
+};
+
+
+exports.teapot = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 418, data, ctor: exports.teapot });
+};
+
+
+exports.badData = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 422, data, ctor: exports.badData });
+};
+
+
+exports.locked = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 423, data, ctor: exports.locked });
+};
+
+
+exports.failedDependency = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 424, data, ctor: exports.failedDependency });
+};
+
+exports.tooEarly = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 425, data, ctor: exports.tooEarly });
+};
+
+
+exports.preconditionRequired = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 428, data, ctor: exports.preconditionRequired });
+};
+
+
+exports.tooManyRequests = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 429, data, ctor: exports.tooManyRequests });
+};
+
+
+exports.illegal = function (messageOrError, data) {
+
+    return new exports.Boom(messageOrError, { statusCode: 451, data, ctor: exports.illegal });
+};
+
+
+// 5xx Server Errors
+
+exports.internal = function (message, data, statusCode = 500) {
+
+    return internals.serverError(message, data, statusCode, exports.internal);
+};
+
+
+exports.notImplemented = function (message, data) {
+
+    return internals.serverError(message, data, 501, exports.notImplemented);
+};
+
+
+exports.badGateway = function (message, data) {
+
+    return internals.serverError(message, data, 502, exports.badGateway);
+};
+
+
+exports.serverUnavailable = function (message, data) {
+
+    return internals.serverError(message, data, 503, exports.serverUnavailable);
+};
+
+
+exports.gatewayTimeout = function (message, data) {
+
+    return internals.serverError(message, data, 504, exports.gatewayTimeout);
+};
+
+
+exports.badImplementation = function (message, data) {
+
+    const err = internals.serverError(message, data, 500, exports.badImplementation);
+    err.isDeveloperError = true;
+    return err;
+};
+
+
+internals.initialize = function (err, statusCode, message) {
+
+    const numberCode = parseInt(statusCode, 10);
+    Hoek.assert(!isNaN(numberCode) && numberCode >= 400, 'First argument must be a number (400+):', statusCode);
+
+    err.isBoom = true;
+    err.isServer = numberCode >= 500;
+
+    if (!err.hasOwnProperty('data')) {
+        err.data = null;
+    }
+
+    err.output = {
+        statusCode: numberCode,
+        payload: {},
+        headers: {}
+    };
+
+    Object.defineProperty(err, 'reformat', { value: internals.reformat, configurable: true });
+
+    if (!message &&
+        !err.message) {
+
+        err.reformat();
+        message = err.output.payload.error;
+    }
+
+    if (message) {
+        const props = Object.getOwnPropertyDescriptor(err, 'message') || Object.getOwnPropertyDescriptor(Object.getPrototypeOf(err), 'message');
+        Hoek.assert(!props || props.configurable && !props.get, 'The error is not compatible with boom');
+
+        err.message = message + (err.message ? ': ' + err.message : '');
+        err.output.payload.message = err.message;
+    }
+
+    err.reformat();
+    return err;
+};
+
+
+internals.reformat = function (debug = false) {
+
+    this.output.payload.statusCode = this.output.statusCode;
+    this.output.payload.error = internals.codes.get(this.output.statusCode) || 'Unknown';
+
+    if (this.output.statusCode === 500 && debug !== true) {
+        this.output.payload.message = 'An internal server error occurred';              // Hide actual error from user
+    }
+    else if (this.message) {
+        this.output.payload.message = this.message;
+    }
+};
+
+
+internals.serverError = function (messageOrError, data, statusCode, ctor) {
+
+    if (data instanceof Error &&
+        !data.isBoom) {
+
+        return exports.boomify(data, { statusCode, message: messageOrError });
+    }
+
+    return new exports.Boom(messageOrError, { statusCode, data, ctor });
+};
diff --git a/node_modules/@hapi/boom/package.json b/node_modules/@hapi/boom/package.json
new file mode 100644
index 0000000..3bae608
--- /dev/null
+++ b/node_modules/@hapi/boom/package.json
@@ -0,0 +1,35 @@
+{
+  "name": "@hapi/boom",
+  "description": "HTTP-friendly error objects",
+  "version": "10.0.1",
+  "repository": "git://github.com/hapijs/boom",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "keywords": [
+    "error",
+    "http"
+  ],
+  "files": [
+    "lib"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "9.x.x",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.0",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/bounce/LICENSE.md b/node_modules/@hapi/bounce/LICENSE.md
new file mode 100755
index 0000000..c31ce69
--- /dev/null
+++ b/node_modules/@hapi/bounce/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2017-2022, Project contributors
+Copyright (c) 2017-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/bounce/README.md b/node_modules/@hapi/bounce/README.md
new file mode 100755
index 0000000..c2113a0
--- /dev/null
+++ b/node_modules/@hapi/bounce/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/bounce
+
+#### Selective error catching and rewrite rules.
+
+**bounce** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/bounce/)
+- [Versions status](https://hapi.dev/resources/status/#bounce) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/bounce/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/bounce/lib/index.js b/node_modules/@hapi/bounce/lib/index.js
new file mode 100755
index 0000000..357d850
--- /dev/null
+++ b/node_modules/@hapi/bounce/lib/index.js
@@ -0,0 +1,148 @@
+'use strict';
+
+const Assert = require('assert');
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {
+    system: [
+
+        // JavaScript
+
+        EvalError,
+        RangeError,
+        ReferenceError,
+        SyntaxError,
+        TypeError,
+        URIError,
+
+        // Node
+
+        Assert.AssertionError,
+
+        // Hoek
+
+        Hoek.AssertError
+    ]
+};
+
+
+exports.rethrow = function (err, types, options = {}) {
+
+    return internals.catch(err, types, options, true);
+};
+
+
+exports.ignore = function (err, types, options = {}) {
+
+    return internals.catch(err, types, options, false);
+};
+
+
+internals.catch = function (err, types, options, match) {
+
+    if (internals.match(err, types) !== match) {
+        return;
+    }
+
+    // Error replacement
+
+    if (options.override) {
+        err = options.override;
+    }
+
+    // Error decorations
+
+    if (options.decorate) {
+        Object.assign(err, options.decorate);
+    }
+
+    if (options.return) {
+        return err;
+    }
+
+    throw err;
+};
+
+
+exports.background = async function (operation, action = 'rethrow', types = 'system', options = {}) {
+
+    try {
+        if (typeof operation === 'function') {
+            await operation();
+        }
+        else {
+            await operation;
+        }
+    }
+    catch (err) {
+        return exports[action](err, types, options);
+    }
+};
+
+
+exports.isBoom = function (err) {
+
+    return Boom.isBoom(err);
+};
+
+
+exports.isError = function (err) {
+
+    return err instanceof Error;
+};
+
+
+exports.isSystem = function (err) {
+
+    if (!err) {
+        return false;
+    }
+
+    if (err.isBoom) {
+        return false;
+    }
+
+    for (const system of internals.system) {
+        if (err instanceof system) {
+            return true;
+        }
+    }
+
+    return false;
+};
+
+
+internals.rules = {
+    system: exports.isSystem,
+    boom: exports.isBoom
+};
+
+
+internals.match = function (err, types) {
+
+    if (!types) {
+        return true;
+    }
+
+    types = Array.isArray(types) ? types : [types];
+    for (const type of types) {
+        if (typeof type === 'string') {
+            if (internals.rules[type](err)) {
+                return true;
+            }
+        }
+        else if (typeof type === 'object') {
+            if (Hoek.contain(err, type, { deep: true, part: true })) {
+                return true;
+            }
+        }
+        else if (err instanceof type) {
+            return true;
+        }
+    }
+
+    return false;
+};
diff --git a/node_modules/@hapi/bounce/package.json b/node_modules/@hapi/bounce/package.json
new file mode 100644
index 0000000..55efb47
--- /dev/null
+++ b/node_modules/@hapi/bounce/package.json
@@ -0,0 +1,33 @@
+{
+  "name": "@hapi/bounce",
+  "description": "Selective error catching and rewrite rules",
+  "version": "3.0.2",
+  "repository": "git://github.com/hapijs/bounce",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "error",
+    "catch"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.1.0"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html -L"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/bourne/LICENSE.md b/node_modules/@hapi/bourne/LICENSE.md
new file mode 100755
index 0000000..68de246
--- /dev/null
+++ b/node_modules/@hapi/bourne/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2019-2022, Project contributors
+Copyright (c) 2019-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/bourne/README.md b/node_modules/@hapi/bourne/README.md
new file mode 100755
index 0000000..6fa6a33
--- /dev/null
+++ b/node_modules/@hapi/bourne/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/bourne
+
+#### JSON.parse() drop-in replacement with prototype poisoning protection.
+
+**bourne** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/bourne/)
+- [Version status](https://hapi.dev/resources/status/#bourne) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/bourne/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/bourne/lib/index.d.ts b/node_modules/@hapi/bourne/lib/index.d.ts
new file mode 100644
index 0000000..4ad3038
--- /dev/null
+++ b/node_modules/@hapi/bourne/lib/index.d.ts
@@ -0,0 +1,62 @@
+interface Reviver {
+  (this: any, key: string, value: any): any;
+}
+
+interface ParseOptions {
+  /**
+   * - `'error'` - throw a `SyntaxError` when a `__proto__` key is found. This is the default value.
+   * - `'remove'` - deletes any `__proto__` keys from the result object.
+   * - `'ignore'` - skips all validation (same as calling `JSON.parse()` directly).
+   */
+  protoAction?: 'error' | 'remove' | 'ignore';
+}
+
+/**
+ * Parses a given JSON-formatted text into an object.
+ * @param text the JSON text string.
+ */
+export function parse(text: string): any;
+
+/**
+ * Parses a given JSON-formatted text into an object.
+ * @param text the JSON text string.
+ * @param reviver the `JSON.parse()` optional `reviver` argument.
+ */
+export function parse(text: string, reviver: Reviver): any;
+
+/**
+ * Parses a given JSON-formatted text into an object.
+ * @param text the JSON text string.
+ * @param options optional configuration object.
+ */
+export function parse(text: string, options: ParseOptions): any;
+
+/**
+ * Parses a given JSON-formatted text into an object.
+ * @param text the JSON text string.
+ * @param reviver the `JSON.parse()` optional `reviver` argument.
+ * @param options optional configuration object.
+ */
+export function parse(text: string, reviver: Reviver, options: ParseOptions): any;
+
+interface ScanOptions {
+  /**
+   * - `'error'` - throw a `SyntaxError` when a `__proto__` key is found. This is the default value.
+   * - `'remove'` - deletes any `__proto__` keys from the input `obj`.
+   */
+  protoAction?: 'error' | 'remove';
+}
+
+/**
+ * Scans a given object for prototype properties.
+ * @param obj the object being scanned.
+ * @param options optional configuration object.
+ */
+export function scan(obj: any, options?: ScanOptions): void;
+
+/**
+ * Parses a given JSON-formatted text into an object or `null` if an error is found.
+ * @param text the JSON text string.
+ * @param reviver the `JSON.parse()` optional `reviver` argument.
+ */
+export function safeParse(text: string, reviver?: Reviver) : any | null;
diff --git a/node_modules/@hapi/bourne/lib/index.js b/node_modules/@hapi/bourne/lib/index.js
new file mode 100755
index 0000000..b5da747
--- /dev/null
+++ b/node_modules/@hapi/bourne/lib/index.js
@@ -0,0 +1,87 @@
+'use strict';
+
+
+const internals = {
+    suspectRx: /"(?:_|\\u005[Ff])(?:_|\\u005[Ff])(?:p|\\u0070)(?:r|\\u0072)(?:o|\\u006[Ff])(?:t|\\u0074)(?:o|\\u006[Ff])(?:_|\\u005[Ff])(?:_|\\u005[Ff])"\s*\:/
+};
+
+
+exports.parse = function (text, ...args) {
+
+    // Normalize arguments
+
+    const firstOptions = typeof args[0] === 'object' && args[0];
+    const reviver = args.length > 1 || !firstOptions ? args[0] : undefined;
+    const options = (args.length > 1 && args[1]) || firstOptions || {};
+
+    // Parse normally, allowing exceptions
+
+    const obj = JSON.parse(text, reviver);
+
+    // options.protoAction: 'error' (default) / 'remove' / 'ignore'
+
+    if (options.protoAction === 'ignore') {
+        return obj;
+    }
+
+    // Ignore null and non-objects
+
+    if (!obj ||
+        typeof obj !== 'object') {
+
+        return obj;
+    }
+
+    // Check original string for potential exploit
+
+    if (!text.match(internals.suspectRx)) {
+        return obj;
+    }
+
+    // Scan result for proto keys
+
+    exports.scan(obj, options);
+
+    return obj;
+};
+
+
+exports.scan = function (obj, options = {}) {
+
+    let next = [obj];
+
+    while (next.length) {
+        const nodes = next;
+        next = [];
+
+        for (const node of nodes) {
+            if (Object.prototype.hasOwnProperty.call(node, '__proto__')) {      // Avoid calling node.hasOwnProperty directly
+                if (options.protoAction !== 'remove') {
+                    throw new SyntaxError('Object contains forbidden prototype property');
+                }
+
+                delete node.__proto__;
+            }
+
+            for (const key in node) {
+                const value = node[key];
+                if (value &&
+                    typeof value === 'object') {
+
+                    next.push(node[key]);
+                }
+            }
+        }
+    }
+};
+
+
+exports.safeParse = function (text, reviver) {
+
+    try {
+        return exports.parse(text, reviver);
+    }
+    catch (ignoreError) {
+        return null;
+    }
+};
diff --git a/node_modules/@hapi/bourne/package.json b/node_modules/@hapi/bourne/package.json
new file mode 100644
index 0000000..baf9850
--- /dev/null
+++ b/node_modules/@hapi/bourne/package.json
@@ -0,0 +1,35 @@
+{
+  "name": "@hapi/bourne",
+  "description": "JSON parse with prototype poisoning protection",
+  "version": "3.0.0",
+  "repository": "git://github.com/hapijs/bourne",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "JSON",
+    "parse",
+    "safe",
+    "prototype"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "25.0.0-beta.1",
+    "@types/node": "^17.0.31",
+    "benchmark": "2.x.x",
+    "typescript": "^4.6.3"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/call/LICENSE.md b/node_modules/@hapi/call/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/call/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/call/README.md b/node_modules/@hapi/call/README.md
new file mode 100755
index 0000000..72664fc
--- /dev/null
+++ b/node_modules/@hapi/call/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/call
+
+#### Simple HTTP Router.
+
+**call** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/call/)
+- [Version status](https://hapi.dev/resources/status/#call) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/call/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/call/lib/decode.js b/node_modules/@hapi/call/lib/decode.js
new file mode 100644
index 0000000..06a1236
--- /dev/null
+++ b/node_modules/@hapi/call/lib/decode.js
@@ -0,0 +1,120 @@
+'use strict';
+
+// Adapted from:
+// Copyright (c) 2017-2019 Justin Ridgewell, MIT Licensed, https://github.com/jridgewell/safe-decode-string-component
+// Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>, MIT Licensed, http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
+
+
+const internals = {};
+
+
+exports.decode = function (string) {
+
+    let percentPos = string.indexOf('%');
+    if (percentPos === -1) {
+        return string;
+    }
+
+    let decoded = '';
+    let last = 0;
+    let codepoint = 0;
+    let startOfOctets = percentPos;
+    let state = internals.utf8.accept;
+
+    while (percentPos > -1 &&
+        percentPos < string.length) {
+
+        const high = internals.resolveHex(string[percentPos + 1], 4);
+        const low = internals.resolveHex(string[percentPos + 2], 0);
+        const byte = high | low;
+        const type = internals.utf8.data[byte];
+        state = internals.utf8.data[256 + state + type];
+        codepoint = (codepoint << 6) | (byte & internals.utf8.data[364 + type]);
+
+        if (state === internals.utf8.accept) {
+            decoded += string.slice(last, startOfOctets);
+            decoded += codepoint <= 0xFFFF
+                ? String.fromCharCode(codepoint)
+                : String.fromCharCode(0xD7C0 + (codepoint >> 10), 0xDC00 + (codepoint & 0x3FF));
+
+            codepoint = 0;
+            last = percentPos + 3;
+            percentPos = string.indexOf('%', last);
+            startOfOctets = percentPos;
+            continue;
+        }
+
+        if (state === internals.utf8.reject) {
+            return null;
+        }
+
+        percentPos += 3;
+
+        if (percentPos >= string.length ||
+            string[percentPos] !== '%') {
+
+            return null;
+        }
+    }
+
+    return decoded + string.slice(last);
+};
+
+
+internals.resolveHex = function (char, shift) {
+
+    const i = internals.hex[char];
+    return i === undefined ? 255 : i << shift;
+};
+
+
+internals.hex = {
+    '0': 0, '1': 1, '2': 2, '3': 3, '4': 4,
+    '5': 5, '6': 6, '7': 7, '8': 8, '9': 9,
+    'a': 10, 'A': 10, 'b': 11, 'B': 11, 'c': 12,
+    'C': 12, 'd': 13, 'D': 13, 'e': 14, 'E': 14,
+    'f': 15, 'F': 15
+};
+
+
+internals.utf8 = {
+    accept: 12,
+    reject: 0,
+    data: [
+
+        // Maps bytes to character to a transition
+
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+        5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
+        6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7,
+        10, 9, 9, 9, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
+
+        // Maps a state to a new state when adding a transition
+
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        12, 0, 0, 0, 0, 24, 36, 48, 60, 72, 84, 96,
+        0, 12, 12, 12, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 24, 24, 24, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 24, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 48, 48, 48, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 48, 48, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+
+        // Maps the current transition to a mask that needs to apply to the byte
+
+        0x7F, 0x3F, 0x3F, 0x3F, 0x00, 0x1F, 0x0F, 0x0F, 0x0F, 0x07, 0x07, 0x07
+    ]
+};
diff --git a/node_modules/@hapi/call/lib/index.js b/node_modules/@hapi/call/lib/index.js
new file mode 100755
index 0000000..1f6cca3
--- /dev/null
+++ b/node_modules/@hapi/call/lib/index.js
@@ -0,0 +1,385 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+
+const Decode = require('./decode');
+const Regex = require('./regex');
+const Segment = require('./segment');
+
+
+const internals = {
+    pathRegex: Regex.generate(),
+    defaults: {
+        isCaseSensitive: true
+    }
+};
+
+
+exports.Router = internals.Router = function (options) {
+
+    this.settings = Hoek.applyToDefaults(internals.defaults, options || {});
+
+    this.routes = new Map();                        // Key: HTTP method or * for catch-all, value: sorted array of routes
+    this.ids = new Map();                           // Key: route id, value: record
+    this.vhosts = null;                             // Map where Key: hostname, value: see this.routes
+
+    this.specials = {
+        badRequest: null,
+        notFound: null,
+        options: null
+    };
+};
+
+
+internals.Router.prototype.add = function (config, route) {
+
+    const method = config.method.toLowerCase();
+
+    const vhost = config.vhost || '*';
+    if (vhost !== '*') {
+        this.vhosts = this.vhosts ?? new Map();
+        if (!this.vhosts.has(vhost)) {
+            this.vhosts.set(vhost, new Map());
+        }
+    }
+
+    const table = vhost === '*' ? this.routes : this.vhosts.get(vhost);
+    if (!table.has(method)) {
+        table.set(method, { routes: [], router: new Segment() });
+    }
+
+    const analysis = config.analysis ?? this.analyze(config.path);
+    const record = {
+        path: config.path,
+        route: route || config.path,
+        segments: analysis.segments,
+        params: analysis.params,
+        fingerprint: analysis.fingerprint,
+        settings: this.settings
+    };
+
+    // Add route
+
+    const map = table.get(method);
+    map.router.add(analysis.segments, record);
+    map.routes.push(record);
+    map.routes.sort(internals.sort);
+
+    const last = record.segments[record.segments.length - 1];
+    if (last.empty) {
+        map.router.add(analysis.segments.slice(0, -1), record);
+    }
+
+    if (config.id) {
+        Hoek.assert(!this.ids.has(config.id), 'Route id', config.id, 'for path', config.path, 'conflicts with existing path', this.ids.has(config.id) && this.ids.get(config.id).path);
+        this.ids.set(config.id, record);
+    }
+
+    return record;
+};
+
+
+internals.Router.prototype.special = function (type, route) {
+
+    Hoek.assert(Object.keys(this.specials).indexOf(type) !== -1, 'Unknown special route type:', type);
+
+    this.specials[type] = { route };
+};
+
+
+internals.Router.prototype.route = function (method, path, hostname) {
+
+    const segments = path.length === 1 ? [''] : path.split('/').slice(1);
+
+    const vhost = this.vhosts && hostname && this.vhosts.get(hostname);
+    const route = vhost && this._lookup(path, segments, vhost, method) ||
+        this._lookup(path, segments, this.routes, method) ||
+        method === 'head' && vhost && this._lookup(path, segments, vhost, 'get') ||
+        method === 'head' && this._lookup(path, segments, this.routes, 'get') ||
+        method === 'options' && this.specials.options ||
+        vhost && this._lookup(path, segments, vhost, '*') ||
+        this._lookup(path, segments, this.routes, '*') ||
+        this.specials.notFound || Boom.notFound();
+
+    return route;
+};
+
+
+internals.Router.prototype._lookup = function (path, segments, table, method) {
+
+    const set = table.get(method);
+    if (!set) {
+        return null;
+    }
+
+    const match = set.router.lookup(path, segments, this.settings);
+    if (!match) {
+        return null;
+    }
+
+    const assignments = {};
+    const array = [];
+    for (let i = 0; i < match.array.length; ++i) {
+        const name = match.record.params[i];
+        const value = Decode.decode(match.array[i]);
+        if (value === null) {
+            return this.specials.badRequest ?? Boom.badRequest('Invalid request path');
+        }
+
+        if (assignments[name] !== undefined) {
+            assignments[name] = assignments[name] + '/' + value;
+        }
+        else {
+            assignments[name] = value;
+        }
+
+        if (i + 1 === match.array.length ||                 // Only include the last segment of a multi-segment param
+            name !== match.record.params[i + 1]) {
+
+            array.push(assignments[name]);
+        }
+    }
+
+    return { params: assignments, paramsArray: array, route: match.record.route };
+};
+
+
+internals.Router.prototype.normalize = function (path) {
+
+    if (path &&
+        path.indexOf('%') !== -1) {
+
+        // Uppercase %encoded values
+
+        const uppercase = path.replace(/%[0-9a-fA-F][0-9a-fA-F]/g, (encoded) => encoded.toUpperCase());
+
+        // Decode non-reserved path characters: a-z A-Z 0-9 _!$&'()*+,;=:@-.~
+        // ! (%21) $ (%24) & (%26) ' (%27) ( (%28) ) (%29) * (%2A) + (%2B) , (%2C) - (%2D) . (%2E)
+        // 0-9 (%30-39) : (%3A) ; (%3B) = (%3D)
+        // @ (%40) A-Z (%41-5A) _ (%5F) a-z (%61-7A) ~ (%7E)
+
+        const decoded = uppercase.replace(/%(?:2[146-9A-E]|3[\dABD]|4[\dA-F]|5[\dAF]|6[1-9A-F]|7[\dAE])/g, (encoded) => String.fromCharCode(parseInt(encoded.substring(1), 16)));
+
+        path = decoded;
+    }
+
+    // Normalize path segments
+
+    if (path &&
+        (path.indexOf('/.') !== -1 || path[0] === '.')) {
+
+        const hasLeadingSlash = path[0] === '/';
+        const segments = path.split('/');
+        const normalized = [];
+        let segment;
+
+        for (let i = 0; i < segments.length; ++i) {
+            segment = segments[i];
+            if (segment === '..') {
+                normalized.pop();
+            }
+            else if (segment !== '.') {
+                normalized.push(segment);
+            }
+        }
+
+        if (segment === '.' ||
+            segment === '..') {         // Add trailing slash when needed
+
+            normalized.push('');
+        }
+
+        path = normalized.join('/');
+
+        if (path[0] !== '/' &&
+            hasLeadingSlash) {
+
+            path = '/' + path;
+        }
+    }
+
+    return path;
+};
+
+
+internals.Router.prototype.analyze = function (path) {
+
+    Hoek.assert(internals.pathRegex.validatePath.test(path), 'Invalid path:', path);
+    Hoek.assert(!internals.pathRegex.validatePathEncoded.test(path), 'Path cannot contain encoded non-reserved path characters:', path);
+
+    const pathParts = path.split('/');
+    const segments = [];
+    const params = [];
+    const fingers = [];
+
+    for (let i = 1; i < pathParts.length; ++i) {                            // Skip first empty segment
+        let segment = pathParts[i];
+
+        // Literal
+
+        if (segment.indexOf('{') === -1) {
+            segment = this.settings.isCaseSensitive ? segment : segment.toLowerCase();
+            fingers.push(segment);
+            segments.push({ literal: segment });
+            continue;
+        }
+
+        // Parameter
+
+        const parts = internals.parseParams(segment);
+        if (parts.length === 1) {
+
+            // Simple parameter
+
+            const item = parts[0];
+            Hoek.assert(params.indexOf(item.name) === -1, 'Cannot repeat the same parameter name:', item.name, 'in:', path);
+            params.push(item.name);
+
+            if (item.wildcard) {
+                if (item.count) {
+                    for (let j = 0; j < item.count; ++j) {
+                        fingers.push('?');
+                        segments.push({});
+                        if (j) {
+                            params.push(item.name);
+                        }
+                    }
+                }
+                else {
+                    fingers.push('#');
+                    segments.push({ wildcard: true });
+                }
+            }
+            else {
+                fingers.push('?');
+                segments.push({ empty: item.empty });
+            }
+        }
+        else {
+
+            // Mixed parameter
+
+            const seg = {
+                length: parts.length,
+                first: typeof parts[0] !== 'string',
+                segments: []
+            };
+
+            let finger = '';
+            let regex = '^';
+            for (let j = 0; j < parts.length; ++j) {
+                const part = parts[j];
+                if (typeof part === 'string') {
+                    finger = finger + part;
+                    regex = regex + Hoek.escapeRegex(part);
+                    seg.segments.push(part);
+                }
+                else {
+                    Hoek.assert(params.indexOf(part.name) === -1, 'Cannot repeat the same parameter name:', part.name, 'in:', path);
+                    params.push(part.name);
+
+                    finger = finger + '?';
+                    regex = regex + '(.' + (part.empty ? '*' : '+') + ')';
+                }
+            }
+
+            seg.mixed = new RegExp(regex + '$', !this.settings.isCaseSensitive ? 'i' : '');
+            fingers.push(finger);
+            segments.push(seg);
+        }
+    }
+
+    return {
+        segments,
+        fingerprint: '/' + fingers.join('/'),
+        params
+    };
+};
+
+
+internals.parseParams = function (segment) {
+
+    const parts = [];
+    segment.replace(internals.pathRegex.parseParam, ($0, literal, name, wildcard, count, empty) => {
+
+        if (literal) {
+            parts.push(literal);
+        }
+        else {
+            parts.push({
+                name,
+                wildcard: !!wildcard,
+                count: count && parseInt(count, 10),
+                empty: !!empty
+            });
+        }
+
+        return '';
+    });
+
+    return parts;
+};
+
+
+internals.Router.prototype.table = function (host) {
+
+    const result = [];
+    const collect = (table) => {
+
+        if (!table) {
+            return;
+        }
+
+        for (const map of table.values()) {
+            for (const record of map.routes) {
+                result.push(record.route);
+            }
+        }
+    };
+
+    if (this.vhosts) {
+        const vhosts = host ? [].concat(host) : [...this.vhosts.keys()];
+        for (const vhost of vhosts) {
+            collect(this.vhosts.get(vhost));
+        }
+    }
+
+    collect(this.routes);
+
+    return result;
+};
+
+
+internals.sort = function (a, b) {
+
+    const aFirst = -1;
+    const bFirst = 1;
+
+    const as = a.segments;
+    const bs = b.segments;
+
+    if (as.length !== bs.length) {
+        return as.length > bs.length ? bFirst : aFirst;
+    }
+
+    for (let i = 0; ; ++i) {
+        if (as[i].literal) {
+            if (bs[i].literal) {
+                if (as[i].literal === bs[i].literal) {
+                    continue;
+                }
+
+                return as[i].literal > bs[i].literal ? bFirst : aFirst;
+            }
+
+            return aFirst;
+        }
+
+        if (bs[i].literal) {
+            return bFirst;
+        }
+
+        return as[i].wildcard ? bFirst : aFirst;
+    }
+};
diff --git a/node_modules/@hapi/call/lib/regex.js b/node_modules/@hapi/call/lib/regex.js
new file mode 100755
index 0000000..a97bb1c
--- /dev/null
+++ b/node_modules/@hapi/call/lib/regex.js
@@ -0,0 +1,47 @@
+'use strict';
+
+const internals = {};
+
+
+exports.generate = function () {
+
+    /*
+        /path/{param}/path/{param?}
+        /path/{param*2}/path
+        /path/{param*2}
+        /path/x{param}x
+        /{param*}
+    */
+
+    const empty = '(?:^\\/$)';
+
+    const legalChars = '[\\w\\!\\$&\'\\(\\)\\*\\+\\,;\\=\\:@\\-\\.~]';
+    const encoded = '%[A-F0-9]{2}';
+
+    const literalChar = '(?:' + legalChars + '|' + encoded + ')';
+    const literal = literalChar + '+';
+    const literalOptional = literalChar + '*';
+
+    const midParam = '(?:\\{\\w+(?:\\*[1-9]\\d*)?\\})';                               // {p}, {p*2}
+    const endParam = '(?:\\/(?:\\{\\w+(?:(?:\\*(?:[1-9]\\d*)?)|(?:\\?))?\\})?)?';     // {p}, {p*2}, {p*}, {p?}
+
+    const partialParam = '(?:\\{\\w+\\??\\})';                                        // {p}, {p?}
+    const mixedParam = '(?:(?:' + literal + partialParam + ')+' + literalOptional + ')|(?:' + partialParam + '(?:' + literal + partialParam + ')+' + literalOptional + ')|(?:' + partialParam + literal + ')';
+
+    const segmentContent = '(?:' + literal + '|' + midParam + '|' + mixedParam + ')';
+    const segment = '\\/' + segmentContent;
+    const segments = '(?:' + segment + ')*';
+
+    const path = '(?:^' + segments + endParam + '$)';
+
+    //                1:literal               2:name   3:*  4:count  5:?
+    const parseParam = '(' + literal + ')|(?:\\{(\\w+)(?:(\\*)(\\d+)?)?(\\?)?\\})';
+
+    const expressions = {
+        parseParam: new RegExp(parseParam, 'g'),
+        validatePath: new RegExp(empty + '|' + path),
+        validatePathEncoded: /%(?:2[146-9A-E]|3[\dABD]|4[\dA-F]|5[\dAF]|6[1-9A-F]|7[\dAE])/g
+    };
+
+    return expressions;
+};
diff --git a/node_modules/@hapi/call/lib/segment.js b/node_modules/@hapi/call/lib/segment.js
new file mode 100755
index 0000000..aa5f970
--- /dev/null
+++ b/node_modules/@hapi/call/lib/segment.js
@@ -0,0 +1,246 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports = module.exports = internals.Segment = function () {
+
+    this._edge = null;              // { segment, record }
+    this._fulls = null;             // { path: { segment, record }
+    this._literals = null;          // { literal: { segment, <node> } }
+    this._param = null;             // <node>
+    this._mixed = null;             // [{ segment, <node> }]
+    this._wildcard = null;          // { segment, record }
+};
+
+
+internals.Segment.prototype.add = function (segments, record) {
+
+    /*
+        { literal: 'x' }        -> x
+        { empty: false }        -> {p}
+        { wildcard: true }      -> {p*}
+        { mixed: /regex/ }      -> a{p}b
+    */
+
+    const current = segments[0];
+    const remaining = segments.slice(1);
+    const isEdge = !remaining.length;
+
+    const literals = [];
+    let isLiteral = true;
+    for (let i = 0; i < segments.length && isLiteral; ++i) {
+        isLiteral = segments[i].literal !== undefined;
+        literals.push(segments[i].literal);
+    }
+
+    if (isLiteral) {
+        this._fulls = this._fulls ?? new Map();
+        let literal = '/' + literals.join('/');
+        if (!record.settings.isCaseSensitive) {
+            literal = literal.toLowerCase();
+        }
+
+        Hoek.assert(!this._fulls.has(literal), 'New route', record.path, 'conflicts with existing', this._fulls.get(literal)?.record.path);
+        this._fulls.set(literal, { segment: current, record });
+    }
+    else if (current.literal !== undefined) {               // Can be empty string
+
+        // Literal
+
+        this._literals = this._literals ?? new Map();
+        const currentLiteral = record.settings.isCaseSensitive ? current.literal : current.literal.toLowerCase();
+        if (!this._literals.has(currentLiteral)) {
+            this._literals.set(currentLiteral, new internals.Segment());
+        }
+
+        this._literals.get(currentLiteral).add(remaining, record);
+    }
+    else if (current.wildcard) {
+
+        // Wildcard
+
+        Hoek.assert(!this._wildcard, 'New route', record.path, 'conflicts with existing', this._wildcard?.record.path);
+        Hoek.assert(!this._param || !this._param._wildcard, 'New route', record.path, 'conflicts with existing', this._param?._wildcard?.record.path);
+        this._wildcard = { segment: current, record };
+    }
+    else if (current.mixed) {
+
+        // Mixed
+
+        this._mixed = this._mixed ?? [];
+
+        let mixed = this._mixedLookup(current);
+        if (!mixed) {
+            mixed = { segment: current, node: new internals.Segment() };
+            this._mixed.push(mixed);
+            this._mixed.sort(internals.mixed);
+        }
+
+        if (isEdge) {
+            Hoek.assert(!mixed.node._edge, 'New route', record.path, 'conflicts with existing', mixed.node._edge?.record.path);
+            mixed.node._edge = { segment: current, record };
+        }
+        else {
+            mixed.node.add(remaining, record);
+        }
+    }
+    else {
+
+        // Parameter
+
+        this._param = this._param ?? new internals.Segment();
+
+        if (isEdge) {
+            Hoek.assert(!this._param._edge, 'New route', record.path, 'conflicts with existing', this._param._edge?.record.path);
+            this._param._edge = { segment: current, record };
+        }
+        else {
+            Hoek.assert(!this._wildcard || !remaining[0].wildcard, 'New route', record.path, 'conflicts with existing', this._wildcard?.record.path);
+            this._param.add(remaining, record);
+        }
+    }
+};
+
+
+internals.Segment.prototype._mixedLookup = function (segment) {
+
+    for (let i = 0; i < this._mixed.length; ++i) {
+        if (internals.mixed({ segment }, this._mixed[i]) === 0) {
+            return this._mixed[i];
+        }
+    }
+
+    return null;
+};
+
+
+internals.mixed = function (a, b) {
+
+    const aFirst = -1;
+    const bFirst = 1;
+
+    const as = a.segment;
+    const bs = b.segment;
+
+    if (as.length !== bs.length) {
+        return as.length > bs.length ? aFirst : bFirst;
+    }
+
+    if (as.first !== bs.first) {
+        return as.first ? bFirst : aFirst;
+    }
+
+    for (let i = 0; i < as.segments.length; ++i) {
+        const am = as.segments[i];
+        const bm = bs.segments[i];
+
+        if (am === bm) {
+            continue;
+        }
+
+        if (am.length === bm.length) {
+            return am > bm ? bFirst : aFirst;
+        }
+
+        return am.length < bm.length ? bFirst : aFirst;
+    }
+
+    return 0;
+};
+
+
+internals.Segment.prototype.lookup = function (path, segments, options) {
+
+    let match = null;
+
+    // Literal edge
+
+    if (this._fulls) {
+        match = this._fulls.get(options.isCaseSensitive ? path : path.toLowerCase());
+        if (match) {
+            return { record: match.record, array: [] };
+        }
+    }
+
+    // Literal node
+
+    const current = segments[0];
+    const nextPath = path.slice(current.length + 1);
+    const remainder = segments.length > 1 ? segments.slice(1) : null;
+
+    if (this._literals) {
+        const literal = options.isCaseSensitive ? current : current.toLowerCase();
+        match = this._literals.get(literal);
+        if (match) {
+            const record = internals.deeper(match, nextPath, remainder, [], options);
+            if (record) {
+                return record;
+            }
+        }
+    }
+
+    // Mixed
+
+    if (this._mixed) {
+        for (let i = 0; i < this._mixed.length; ++i) {
+            match = this._mixed[i];
+            const params = current.match(match.segment.mixed);
+            if (params) {
+                const array = [];
+                for (let j = 1; j < params.length; ++j) {
+                    array.push(params[j]);
+                }
+
+                const record = internals.deeper(match.node, nextPath, remainder, array, options);
+                if (record) {
+                    return record;
+                }
+            }
+        }
+    }
+
+    // Param
+
+    if (this._param) {
+        if (current || this._param._edge?.segment.empty) {
+            const record = internals.deeper(this._param, nextPath, remainder, [current], options);
+            if (record) {
+                return record;
+            }
+        }
+    }
+
+    // Wildcard
+
+    if (this._wildcard) {
+        return { record: this._wildcard.record, array: [path.slice(1)] };
+    }
+
+    return null;
+};
+
+
+internals.deeper = function (match, path, segments, array, options) {
+
+    if (!segments) {
+        if (match._edge) {
+            return { record: match._edge.record, array };
+        }
+
+        if (match._wildcard) {
+            return { record: match._wildcard.record, array };
+        }
+    }
+    else {
+        const result = match.lookup(path, segments, options);
+        if (result) {
+            return { record: result.record, array: array.concat(result.array) };
+        }
+    }
+
+    return null;
+};
diff --git a/node_modules/@hapi/call/package.json b/node_modules/@hapi/call/package.json
new file mode 100755
index 0000000..9c8df9b
--- /dev/null
+++ b/node_modules/@hapi/call/package.json
@@ -0,0 +1,33 @@
+{
+  "name": "@hapi/call",
+  "description": "HTTP Router",
+  "version": "9.0.1",
+  "repository": "git://github.com/hapijs/call",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "HTTP",
+    "router"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/catbox-memory/LICENSE.md b/node_modules/@hapi/catbox-memory/LICENSE.md
new file mode 100755
index 0000000..675e12f
--- /dev/null
+++ b/node_modules/@hapi/catbox-memory/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/catbox-memory/README.md b/node_modules/@hapi/catbox-memory/README.md
new file mode 100755
index 0000000..9a060b2
--- /dev/null
+++ b/node_modules/@hapi/catbox-memory/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/catbox-memory
+
+#### Memory adaptor for [catbox](https://github.com/hapijs/catbox).
+
+**catbox-memory** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/catbox-memory/)
+- [Versions status](https://hapi.dev/resources/status/#catbox-memory) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/catbox-memory/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/catbox-memory/lib/index.d.ts b/node_modules/@hapi/catbox-memory/lib/index.d.ts
new file mode 100644
index 0000000..b95eb62
--- /dev/null
+++ b/node_modules/@hapi/catbox-memory/lib/index.d.ts
@@ -0,0 +1,33 @@
+import { ClientApi, ClientOptions } from '@hapi/catbox';
+
+interface Engine<T> extends ClientApi<T> {}
+
+declare class Engine<T> implements ClientApi<T> {
+    constructor(options?: Engine.Options);
+}
+
+declare namespace Engine {
+    interface Options extends ClientOptions {
+        /**
+         * Sets an upper limit on the number of bytes that can be stored in the cache.
+         * Once this limit is reached no additional items will be added to the cache until some expire.
+         * The utilized memory calculation is a rough approximation and must not be relied on.
+         * @default 104857600 (100MB).
+         */
+        maxByteSize?: number;
+        /**
+         * The minimum number of milliseconds in between each cache cleanup.
+         * @default 1000 (1 second)
+         */
+        minCleanupIntervalMsec?: number;
+        /**
+         * by default, buffers stored in the cache with allowMixedContent set to true are copied when they are set but not when they are retrieved.
+         * This means a change to the buffer returned by a get() will change the value in the cache. To prevent this,
+         * set cloneBuffersOnGet to true to always return a copy of the cached buffer.
+         * @default false
+         */
+        cloneBuffersOnGet?: boolean;
+    }
+}
+
+export { Engine };
\ No newline at end of file
diff --git a/node_modules/@hapi/catbox-memory/lib/index.js b/node_modules/@hapi/catbox-memory/lib/index.js
new file mode 100755
index 0000000..7495488
--- /dev/null
+++ b/node_modules/@hapi/catbox-memory/lib/index.js
@@ -0,0 +1,230 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {
+    maxTimer: 2147483647,   // 2 ^ 31 - 1
+    entrySize: 144          // Approximate cache entry size without value: 144 bytes
+};
+
+
+internals.defaults = {
+    maxByteSize: 100 * 1024 * 1024,          // 100MB
+    minCleanupIntervalMsec: 1000,
+    cloneBuffersOnGet: false
+};
+
+
+exports.Engine = class CatboxMemoryEngine {
+
+    constructor(options = {}) {
+
+        Hoek.assert(options.maxByteSize === undefined || options.maxByteSize >= 0, 'Invalid cache maxByteSize value');
+        Hoek.assert(options.allowMixedContent === undefined, 'allowMixedContent no longer supported');
+        Hoek.assert(options.minCleanupIntervalMsec === undefined || options.minCleanupIntervalMsec < internals.maxTimer, 'Invalid cache minCleanupIntervalMsec value');
+        Hoek.assert(options.cloneBuffersOnGet === undefined || typeof options.cloneBuffersOnGet === 'boolean', 'Invalid cloneBuffersOnGet value');
+
+        this.settings = Hoek.applyToDefaults(internals.defaults, options);
+        this.cache = null;
+
+        this._timer = null;
+        this._timerDue = null;
+    }
+
+    start() {
+
+        if (!this.cache) {
+            this.cache = new Map();
+            this.byteSize = 0;
+        }
+    }
+
+    _scheduleCleanup(msec) {
+
+        const cleanup = () => {
+
+            this._timer = null;
+            this._timerDue = null;
+
+            const now = Date.now();
+            let next = Infinity;
+            for (const [, segment] of this.cache) {
+                for (const [id, envelope] of segment) {
+                    const ttl = envelope.stored + envelope.ttl - now;
+                    if (ttl <= 0) {
+                        segment.delete(id);
+                        this.byteSize -= envelope.byteSize;
+                    }
+                    else {
+                        next = Math.min(next, ttl);
+                    }
+                }
+            }
+
+            if (next !== Infinity) {
+                this._scheduleCleanup(next);
+            }
+        };
+
+        const now = Date.now();
+        const timeout = Math.min(Math.max(this.settings.minCleanupIntervalMsec, msec), internals.maxTimer);
+        if (this._timer) {
+            if (this._timerDue - now < msec) {
+                return;
+            }
+
+            clearTimeout(this._timer);
+        }
+
+        this._timerDue = now + timeout;
+        this._timer = setTimeout(cleanup, timeout);
+    }
+
+    stop() {
+
+        clearTimeout(this._timer);
+        this._timer = null;
+        this._timerDue = null;
+
+        this.cache = null;
+        this.byteSize = 0;
+    }
+
+    isReady() {
+
+        return !!this.cache;
+    }
+
+    validateSegmentName(name) {
+
+        if (!name) {
+            throw new Boom.Boom('Empty string');
+        }
+
+        if (name.indexOf('\u0000') !== -1) {
+            throw new Boom.Boom('Includes null character');
+        }
+
+        return null;
+    }
+
+    get(key) {
+
+        if (!this.cache) {
+            throw new Boom.Boom('Connection not started');
+        }
+
+        const segment = this.cache.get(key.segment);
+        if (!segment) {
+            return null;
+        }
+
+        const envelope = segment.get(key.id);
+        if (!envelope) {
+            return null;
+        }
+
+        if (envelope.stored + envelope.ttl < Date.now()) {
+            this.drop(key);
+            return null;
+        }
+
+        let item = null;
+        if (Buffer.isBuffer(envelope.item)) {
+            item = envelope.item;
+            if (this.settings.cloneBuffersOnGet) {
+                const copy = Buffer.alloc(item.length);
+                item.copy(copy);
+                item = copy;
+            }
+        }
+        else {
+            try {
+                item = JSON.parse(envelope.item);
+            }
+            catch (err) {
+                throw new Boom.Boom('Bad value content');
+            }
+        }
+
+        const result = {
+            item,
+            stored: envelope.stored,
+            ttl: envelope.ttl
+        };
+
+        return result;
+    }
+
+    set(key, value, ttl) {
+
+        if (!this.cache) {
+            throw new Boom.Boom('Connection not started');
+        }
+
+        const envelope = new internals.MemoryCacheEntry(key, value, ttl);
+
+        let segment = this.cache.get(key.segment);
+        if (!segment) {
+            segment = new Map();
+            this.cache.set(key.segment, segment);
+        }
+
+        const cachedItem = segment.get(key.id);
+        if (cachedItem) {
+            this.byteSize -= cachedItem.byteSize;       // If the item existed, decrement the byteSize as the value could be different
+        }
+
+        if (this.settings.maxByteSize &&
+            (this.byteSize + envelope.byteSize > this.settings.maxByteSize)) {
+
+            throw new Boom.Boom('Cache size limit reached');
+        }
+
+        this._scheduleCleanup(ttl);
+        segment.set(key.id, envelope);
+        this.byteSize += envelope.byteSize;
+    }
+
+    drop(key) {
+
+        if (!this.cache) {
+            throw new Boom.Boom('Connection not started');
+        }
+
+        const segment = this.cache.get(key.segment);
+        if (segment) {
+            const item = segment.get(key.id);
+            if (item) {
+                this.byteSize -= item.byteSize;
+                segment.delete(key.id);
+            }
+        }
+    }
+};
+
+
+internals.MemoryCacheEntry = class {
+
+    constructor(key, value, ttl) {
+
+        let valueByteSize = 0;
+
+        if (Buffer.isBuffer(value)) {
+            this.item = Buffer.alloc(value.length);
+            value.copy(this.item);                                  // Copy buffer to prevent value from changing while in the cache
+            valueByteSize = this.item.length;
+        }
+        else {
+            this.item = JSON.stringify(value);                      // stringify() to prevent value from changing while in the cache
+            valueByteSize = Buffer.byteLength(this.item);
+        }
+
+        this.stored = Date.now();
+        this.ttl = ttl;
+        this.byteSize = internals.entrySize + valueByteSize + Buffer.byteLength(key.segment) + Buffer.byteLength(key.id);
+        this.timeoutId = null;
+    }
+};
diff --git a/node_modules/@hapi/catbox-memory/package.json b/node_modules/@hapi/catbox-memory/package.json
new file mode 100644
index 0000000..c4e0d7e
--- /dev/null
+++ b/node_modules/@hapi/catbox-memory/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "@hapi/catbox-memory",
+  "description": "Memory adapter for catbox",
+  "version": "6.0.2",
+  "repository": "git://github.com/hapijs/catbox-memory",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "cache",
+    "catbox",
+    "memory"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/catbox": "^12.1.1",
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^16.18.98",
+    "typescript": "^5.4.5"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -L -t 100 -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/catbox/LICENSE.md b/node_modules/@hapi/catbox/LICENSE.md
new file mode 100755
index 0000000..675e12f
--- /dev/null
+++ b/node_modules/@hapi/catbox/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/catbox/README.md b/node_modules/@hapi/catbox/README.md
new file mode 100755
index 0000000..c854453
--- /dev/null
+++ b/node_modules/@hapi/catbox/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/catbox
+
+#### Multi-strategy object caching service.
+
+**catbox** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/catbox/)
+- [Versions status](https://hapi.dev/resources/status/#catbox) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/catbox/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/catbox/lib/client.js b/node_modules/@hapi/catbox/lib/client.js
new file mode 100755
index 0000000..624b7f0
--- /dev/null
+++ b/node_modules/@hapi/catbox/lib/client.js
@@ -0,0 +1,114 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Boom = require('@hapi/boom');
+
+
+const internals = {
+    validate: Symbol('validate')
+};
+
+
+internals.defaults = {
+    partition: 'catbox'
+};
+
+
+module.exports = class {
+
+    constructor(engine, options) {
+
+        Hoek.assert(engine, 'Missing catbox client engine');
+        Hoek.assert((typeof engine === 'object' && typeof engine.start === 'function') || typeof engine === 'function', 'engine must be an engine object or engine prototype (function)');
+        Hoek.assert(typeof engine === 'function' || !options, 'Can only specify options with function engine config');
+
+        const settings = Object.assign({}, internals.defaults, options);
+        Hoek.assert(settings.partition.match(/^[\w\-]+$/), 'Invalid partition name:' + settings.partition);
+
+        this.connection = (typeof engine === 'object' ? engine : new engine(settings));
+    }
+
+    async start() {
+
+        await this.connection.start();
+    }
+
+    async stop() {
+
+        await this.connection.stop();
+    }
+
+    isReady() {
+
+        return this.connection.isReady();
+    }
+
+    validateSegmentName(name) {
+
+        return this.connection.validateSegmentName(name);
+    }
+
+    async get(key) {
+
+        this[internals.validate](key, null);
+
+        if (key === null) {
+            return null;
+        }
+
+        const result = await this.connection.get(key);
+        if (!result ||
+            result.item === undefined ||
+            result.item === null) {
+
+            return null;                                                        // Not found
+        }
+
+        const now = Date.now();
+        const expires = result.stored + result.ttl;
+        const ttl = expires - now;
+        if (ttl <= 0) {
+            return null;                                                        // Expired
+        }
+
+        const cached = {
+            item: result.item,
+            stored: result.stored,
+            ttl
+        };
+
+        return cached;                                                          // Valid
+    }
+
+    async set(key, value, ttl) {
+
+        this[internals.validate](key);
+
+        if (ttl <= 0) {
+            return;                                                             // Not cachable (or bad rules)
+        }
+
+        await this.connection.set(key, value, ttl);
+    }
+
+    async drop(key) {
+
+        this[internals.validate](key);
+
+        await this.connection.drop(key);                                       // Always drop, regardless of caching rules
+    }
+
+    [internals.validate](key, allow = {}) {
+
+        if (!this.isReady()) {
+            throw Boom.internal('Disconnected');                                // Disconnected
+        }
+
+        const isValidKey = (key && typeof key.id === 'string' &&
+                            key.segment && typeof key.segment === 'string');
+
+        if (!isValidKey && key !== allow) {
+            throw Boom.internal('Invalid key');
+        }
+    }
+};
diff --git a/node_modules/@hapi/catbox/lib/index.d.ts b/node_modules/@hapi/catbox/lib/index.d.ts
new file mode 100644
index 0000000..c16ee9a
--- /dev/null
+++ b/node_modules/@hapi/catbox/lib/index.d.ts
@@ -0,0 +1,299 @@
+// TypeScript Version: 4.9
+
+/// <reference types="node" />
+
+import { Podium } from "@hapi/podium";
+
+/**
+ * Client
+ * The Client object provides a low-level cache abstraction. The object is constructed using new Client(engine, options) where:
+ * engine - is an object or a prototype function implementing the cache strategy:
+ *  * function - a prototype function with the signature function(options). catbox will call new func(options).
+ *  * object - a pre instantiated client implementation object. Does not support passing options.
+ * options - the strategy configuration object. Each strategy defines its own configuration options with the following common options:
+ *  * partition - the partition name used to isolate the cached results across multiple clients. The partition name is used as the MongoDB database name,
+ *    the Riak bucket, or as a key prefix in Redis and Memcached. To share the cache across multiple clients, use the same partition name.
+ * @see {@link https://github.com/hapijs/catbox#client}
+ */
+export class Client<T> implements ClientApi<T> {
+    constructor(engine: ClientApi<any>);
+    constructor(engine: EnginePrototype<any>, options?: ClientOptions);
+
+    /** start() - creates a connection to the cache server. Must be called before any other method is available. */
+    start(): Promise<void>;
+    /** stop() - terminates the connection to the cache server. */
+    stop(): Promise<void>;
+    /**
+     * get(key, callback) - retrieve an item from the cache engine if found where:
+     *  * key - a cache key object (see [ICacheKey]).
+     */
+    get(key: CacheKey): Promise<null | CachedObject<T>>;
+    /**
+     * set(key, value, ttl, callback) - store an item in the cache for a specified length of time, where:
+     *  * key - a cache key object (see [ICacheKey]).
+     *  * value - the string or object value to be stored.
+     *  * ttl - a time-to-live value in milliseconds after which the item is automatically removed from the cache (or is marked invalid).
+     */
+    set(key: CacheKey, value: T, ttl: number): Promise<void>;
+    /**
+     * drop(key, callback) - remove an item from cache where:
+     *  * key - a cache key object (see [ICacheKey]).
+     */
+    drop(key: CacheKey): Promise<void>;
+    /** isReady() - returns true if cache engine determines itself as ready, false if it is not ready. */
+    isReady(): boolean;
+    /** validateSegmentName(segment) - returns null if the segment name is valid (see below), otherwise should return an instance of Error with an appropriate message. */
+    validateSegmentName(segment: string): null | Error;
+}
+
+/**
+ * A prototype CatBox engine function
+ */
+export interface EnginePrototype<T> {
+    new(settings: ClientOptions): ClientApi<T>;
+}
+
+/**
+ * Client API
+ * The Client object provides the following methods:
+ * @see {@link https://github.com/hapijs/catbox#api}
+ */
+export interface ClientApi<T> {
+    /** start() - creates a connection to the cache server. Must be called before any other method is available. */
+    start(): Promise<void>;
+    /** stop() - terminates the connection to the cache server. */
+    stop(): void;
+    /**
+     * get(key, callback) - retrieve an item from the cache engine if found where:
+     *  * key - a cache key object (see [ICacheKey]).
+     */
+    get(key: CacheKey): Promise<null | CachedObject<T>>;
+    /**
+     * set(key, value, ttl) - store an item in the cache for a specified length of time, where:
+     *  * key - a cache key object (see [ICacheKey]).
+     *  * value - the string or object value to be stored.
+     *  * ttl - a time-to-live value in milliseconds after which the item is automatically removed from the cache (or is marked invalid).
+     */
+    set(key: CacheKey, value: T, ttl: number): Promise<void>;
+    /**
+     * drop(key) - remove an item from cache where:
+     *  * key - a cache key object (see [ICacheKey]).
+     */
+    drop(key: CacheKey): Promise<void>;
+    /** isReady() - returns true if cache engine determines itself as ready, false if it is not ready. */
+    isReady(): boolean;
+    /** validateSegmentName(segment) - returns null if the segment name is valid (see below), otherwise should return an instance of Error with an appropriate message. */
+    validateSegmentName(segment: string): null | Error;
+}
+
+/**
+ * Any method with a key argument takes an object with the following required properties:
+ */
+export interface CacheKey {
+    /** segment - a caching segment name string. Enables using a single cache server for storing different sets of items with overlapping ids. */
+    segment: string;
+    /** id - a unique item identifier string (per segment). Can be an empty string. */
+    id: string;
+}
+
+/** Cached object contains the following: */
+export interface CachedObject<T> {
+    /** item - the value stored in the cache using set(). */
+    item: T;
+    /** stored - the timestamp when the item was stored in the cache (in milliseconds). */
+    stored: number;
+    /** ttl - the remaining time-to-live (not the original value used when storing the object). */
+    ttl: number;
+}
+
+export interface ClientOptions {
+    /**
+     * this will store items under keys that start with this value.
+     */
+    partition?: string | undefined;
+}
+
+export type PolicyOptionVariants<T> = PolicyOptions<T> | DecoratedPolicyOptions<T>;
+
+export type Id = string | { id: string };
+
+/**
+ * The Policy object provides a convenient cache interface by setting a
+ * global policy which is automatically applied to every storage action.
+ * The object is constructed using new Policy(options, [cache, segment]) where:
+ *  * options - an object with the IPolicyOptions structure
+ *  * cache - a Client instance (which has already been started).
+ *  * segment - required when cache is provided. The segment name used to
+ * isolate cached items within the cache partition.
+ * @see {@link https://github.com/hapijs/catbox#policy}
+ */
+export class Policy<T, O extends PolicyOptionVariants<T>> {
+    constructor(options: O, cache: Client<T>, segment: string);
+    /**
+     *  retrieve an item from the cache. If the item is not
+     * found and the generateFunc method was provided,
+     * a new value is generated, stored in the cache, and returned.
+     * Multiple concurrent requests are queued and processed once. The method arguments are:
+     * @param id the unique item identifier (within the policy segment).
+     * Can be a string or an object with the required 'id' key.
+     */
+    get(id: Id): Promise<O extends DecoratedPolicyOptions<T> ? DecoratedResult<T> : T | null>;
+
+    /**
+     * store an item in the cache where:
+     * @param id - the unique item identifier (within the policy segment).
+     * @param value - the string or object value to be stored.
+     * @param ttl - a time-to-live override value in milliseconds after which the item is automatically
+     * removed from the cache (or is marked invalid).
+     *    This should be set to 0 in order to use the caching rules configured when creating the Policy object.
+     */
+    set(id: Id, value: T, ttl?: number): Promise<void>;
+    /**
+     * remove the item from cache where:
+     * @param id the unique item identifier (within the policy segment).
+     */
+    drop(id: Id): Promise<void>;
+    /**
+     * given a created timestamp in milliseconds, returns the time-to-live left
+     * based on the configured rules.
+     */
+    ttl(created: number): number;
+    /** changes the policy rules after construction (note that items already stored will not be affected) */
+    rules(options: PolicyOptions<T>): void;
+    /**
+     * returns true if cache engine determines itself as ready, false if it is not ready or if
+     * here is no cache engine set.
+     */
+    isReady(): boolean;
+    /** an object with cache statistics */
+    stats: CacheStatisticsObject;
+    /**
+     * a podium event emitter, emitting 'error' events under the 'persist' (emits any cache errors
+     * thrown during the generation of new values as a result of a get() request) and 'generate'
+     * (emits any new value generation errors thrown as a result of a get() request) channels.
+    */
+    events: Podium;
+    /**
+     * a reference to the cache client if set.
+     */
+    client: Client<T>;
+}
+
+export interface DecoratedResult<T> {
+    value: T;
+    cached: PolicyGetCachedOptions<T>;
+    report: PolicyGetReportLog;
+}
+
+export interface PolicyGetCachedOptions<T> {
+    /** item - the cached value. */
+    item: T;
+    /** stored - the timestamp when the item was stored in the cache. */
+    stored: number;
+    /** ttl - the cache ttl value for the record. */
+    ttl: number;
+    /** isStale - true if the item is stale. */
+    isStale: boolean;
+}
+
+/**
+ * @see {@link https://github.com/hapijs/catbox#policy}
+ */
+export interface PolicyOptions<T> {
+    /** expiresIn - relative expiration expressed in the number of milliseconds since the item was saved in the cache. Cannot be used together with expiresAt. */
+    expiresIn?: number | undefined;
+    /** expiresAt - time of day expressed in 24h notation using the 'HH:MM' format, at which point all cache records for the route expire. Uses local time. Cannot be used together with expiresIn. */
+    expiresAt?: string | undefined;
+    /** generateFunc - a function used to generate a new cache item if one is not found in the cache when calling get(). The method's signature is function(id, next) where: */
+    generateFunc?: GenerateFunc<T> | undefined;
+    /**
+     * staleIn - number of milliseconds to mark an item stored in cache as stale and attempt to regenerate it when generateFunc is provided.
+     * Must be less than expiresIn. Alternatively function that returns staleIn value in milliseconds. The function signature is function(stored, ttl) where:
+     *  * stored - the timestamp when the item was stored in the cache (in milliseconds).
+     *  * ttl - the remaining time-to-live (not the original value used when storing the object).
+     */
+    staleIn?: number | ((stored: number, ttl: number) => number) | undefined;
+    /** staleTimeout - number of milliseconds to wait before returning a stale value while generateFunc is generating a fresh value. */
+    staleTimeout?: number | undefined;
+    /**
+     * generateTimeout - number of milliseconds to wait before returning a timeout error when the generateFunc function takes too long to return a value.
+     * When the value is eventually returned, it is stored in the cache for future requests. Required if generateFunc is present.
+     * Set to false to disable timeouts which may cause all get() requests to get stuck forever.
+     */
+    generateTimeout?: number | false | undefined;
+    /** dropOnError - if true, an error or timeout in the generateFunc causes the stale value to be evicted from the cache. Defaults to true. */
+    dropOnError?: boolean | undefined;
+    /** generateOnReadError - if false, an upstream cache read error will stop the get() method from calling the generate function and will instead pass back the cache error. Defaults to true. */
+    generateOnReadError?: boolean | undefined;
+    /** generateIgnoreWriteError - if false, an upstream cache write error will be passed back with the generated value when calling the get() method. Defaults to true. */
+    generateIgnoreWriteError?: boolean | undefined;
+    /**
+     * pendingGenerateTimeout - number of milliseconds while generateFunc call is in progress for a given id, before a subsequent generateFunc call is allowed.
+     * @default 0, no blocking of concurrent generateFunc calls beyond staleTimeout.
+     */
+    pendingGenerateTimeout?: number | undefined;
+}
+
+export interface DecoratedPolicyOptions<T> extends PolicyOptions<T> {
+    /**
+     * @default false
+     */
+    getDecoratedValue: boolean | undefined;
+}
+
+export interface GenerateFuncFlags {
+    ttl: number;
+}
+
+/**
+ * generateFunc
+ * Is used in PolicyOptions
+ * A function used to generate a new cache item if one is not found in the cache when calling get(). The method's signature is function(id)
+ * @param id - the id string or object provided to the get() method.
+ * @param next - the method called when the new item is returned with the signature function(err, value, ttl) where:
+ *      * err - an error condition.
+ *      * value - the new value generated.
+ *      * ttl - the cache ttl value in milliseconds. Set to 0 to skip storing in the cache. Defaults to the cache global policy.
+ * @see {@link https://github.com/hapijs/catbox#policy}
+ */
+export type GenerateFunc<T> = (id: Id, flags: GenerateFuncFlags) => Promise<T>;
+
+/**
+ * An object with logging information about the generation operation containing the following keys (as relevant):
+ */
+export interface PolicyGetReportLog {
+    /** msec - the cache lookup time in milliseconds. */
+    msec: number;
+    /** stored - the timestamp when the item was stored in the cache. */
+    stored: number;
+    /** isStale - true if the item is stale. */
+    isStale: boolean;
+    /** ttl - the cache ttl value for the record. */
+    ttl: number;
+    /** error - lookup error. */
+    error?: Error | undefined;
+}
+
+/**
+ * an object with cache statistics where:
+ */
+export interface CacheStatisticsObject {
+    /** sets - number of cache writes. */
+    sets: number;
+    /** gets - number of cache get() requests. */
+    gets: number;
+    /** hits - number of cache get() requests in which the requested id was found in the cache (can be stale). */
+    hits: number;
+    /** stales - number of cache reads with stale requests (only counts the first request in a queued get() operation). */
+    stales: number;
+    /** generates - number of calls to the generate function. */
+    generates: number;
+    /** errors - cache operations errors. TODO check this */
+    errors: number;
+}
+
+// Definitions adapted from DefinitelyTyped, originally created by:
+// Jason Swearingen <https://github.com/jasonswearingen>
+// AJP <https://github.com/AJamesPhillips>
+// Rodrigo Saboya <https://github.com/saboya>
+// Silas Rech <https://github.com/lenovouser>
diff --git a/node_modules/@hapi/catbox/lib/index.js b/node_modules/@hapi/catbox/lib/index.js
new file mode 100755
index 0000000..948475f
--- /dev/null
+++ b/node_modules/@hapi/catbox/lib/index.js
@@ -0,0 +1,13 @@
+'use strict';
+
+const Client = require('./client');
+const Policy = require('./policy');
+
+
+const internals = {};
+
+
+exports.Client = Client;
+
+
+exports.Policy = exports.policy = Policy;
diff --git a/node_modules/@hapi/catbox/lib/pending.js b/node_modules/@hapi/catbox/lib/pending.js
new file mode 100755
index 0000000..c093dac
--- /dev/null
+++ b/node_modules/@hapi/catbox/lib/pending.js
@@ -0,0 +1,61 @@
+'use strict';
+
+const internals = {};
+
+
+exports = module.exports = class {
+
+    id = null;
+    timeout = null;
+    count = 1;
+    rule = null;
+    resolve = null;
+    reject = null;
+
+    constructor(id, rule) {
+
+        this.id = id;
+        this.rule = rule;
+
+        this.promise = new Promise((resolve, reject) => {
+
+            this.resolve = resolve;
+            this.reject = reject;
+        });
+    }
+
+    join() {
+
+        ++this.count;
+        return this.promise;
+    }
+
+    send(err, value, cached, report) {
+
+        clearTimeout(this.timeout);
+
+        if (err &&
+            !cached) {
+
+            this.reject(err);
+            return;
+        }
+
+        if (!this.rule.getDecoratedValue) {
+            this.resolve(value);
+            return;
+        }
+
+        if (err) {
+            report.error = err;
+        }
+
+        this.resolve({ value, cached, report });
+    }
+
+    setTimeout(fn, timeoutMs) {
+
+        clearTimeout(this.timeout);
+        this.timeout = setTimeout(fn, timeoutMs);
+    }
+};
diff --git a/node_modules/@hapi/catbox/lib/policy.js b/node_modules/@hapi/catbox/lib/policy.js
new file mode 100755
index 0000000..176be9e
--- /dev/null
+++ b/node_modules/@hapi/catbox/lib/policy.js
@@ -0,0 +1,478 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+const Podium = require('@hapi/podium');
+const Validate = require('@hapi/validate');
+
+const Pending = require('./pending');
+
+
+const internals = {
+    day: 24 * 60 * 60 * 1000,
+    events: Podium.validate([
+        { name: 'error', channels: ['generate', 'persist'] }
+    ])
+};
+
+
+internals.schema = Validate.object({
+    expiresIn: Validate.number().integer().min(1),
+    expiresAt: Validate.string().regex(/^\d\d?\:\d\d$/),
+    staleIn: [
+        Validate.number().integer().min(1).when('expiresAt', { is: Validate.required(), then: Validate.number().max(86400000 - 1) }),       // One day - 1 (max is inclusive)
+        Validate.func()
+    ],
+    staleTimeout: Validate.number().integer().min(1),
+    generateFunc: Validate.func(),
+    generateTimeout: Validate.number().integer().min(1).allow(false),
+    generateOnReadError: Validate.boolean(),
+    generateIgnoreWriteError: Validate.boolean(),
+    dropOnError: Validate.boolean(),
+    pendingGenerateTimeout: Validate.number().integer().min(1),
+    getDecoratedValue: Validate.boolean().default(false),
+
+    // Ignored external keys (hapi)
+
+    privacy: Validate.any(),
+    cache: Validate.any(),
+    segment: Validate.any(),
+    shared: Validate.any()
+})
+    .without('expiresIn', 'expiresAt')
+    .with('staleIn', 'generateFunc')
+    .with('generateOnReadError', 'generateFunc')
+    .with('generateIgnoreWriteError', 'generateFunc')
+    .with('dropOnError', 'generateFunc')
+    .and('generateFunc', 'generateTimeout')
+    .and('staleIn', 'staleTimeout');
+
+
+exports = module.exports = internals.Policy = class {
+
+    rule = null;
+    stats = {
+        sets: 0,
+        gets: 0,
+        hits: 0,
+        stales: 0,
+        generates: 0,
+        errors: 0
+    };
+
+    _events = null;
+    _cache = null;
+    _segment = null;
+    _pendings = new Map();                       // id -> Pending
+    _pendingGenerateCall = new Map();            // id -> timer
+
+    constructor(options, cache, segment) {
+
+        this._cache = cache;
+        this.rules(options);
+
+        if (cache) {
+            const nameErr = cache.validateSegmentName(segment);
+            Hoek.assert(nameErr === null, 'Invalid segment name: ' + segment + (nameErr ? ' (' + nameErr.message + ')' : ''));
+
+            this._segment = segment;
+        }
+    }
+
+    get client() {
+
+        return this._cache;
+    }
+
+    get events() {
+
+        if (!this._events) {
+            this._events = new Podium.Podium(internals.events, { validate: false });
+        }
+
+        return this._events;
+    }
+
+    _error(source, error) {
+
+        if (!this._events) {
+            return;
+        }
+
+        this._events.emit({ name: 'error', channel: source }, { source, error });
+    }
+
+    rules(options) {
+
+        this.rule = internals.Policy.compile(options, !!this._cache);
+    }
+
+    async get(key) {     // key: string or { id: 'id' }
+
+        ++this.stats.gets;
+
+        // Check if request is already pending
+
+        if (!key ||
+            typeof key === 'string') {
+
+            key = { id: key, string: true };
+        }
+
+        let pending = this._pendings.get(key.id);
+        if (pending !== undefined) {
+            return pending.join();
+        }
+
+        pending = new Pending(key.id, this.rule);
+        this._pendings.set(key.id, pending);
+
+        try {
+            await this._get(pending, key);
+        }
+        catch (err) {
+            this._send(key, err);                    // Safeguard to ensure that the pending rejects on any processing errors
+        }
+
+        return pending.promise;
+    }
+
+    async _get(pending, key) {
+
+        // Prepare report
+
+        const report = {};
+
+        // Lookup in cache
+
+        const timer = new Hoek.Bench();
+
+        if (this._cache) {
+            try {
+                var cached = await this._cache.get({ segment: this._segment, id: key.id });
+            }
+            catch (err) {
+                report.error = err;
+                ++this.stats.errors;
+                this._error('persist', err);
+            }
+        }
+
+        report.msec = timer.elapsed();
+
+        if (cached) {
+            report.stored = cached.stored;
+            report.ttl = cached.ttl;
+            const staleIn = typeof this.rule.staleIn === 'function' ? this.rule.staleIn(cached.stored, cached.ttl) : this.rule.staleIn;
+            cached.isStale = staleIn ? Date.now() - cached.stored >= staleIn : false;
+            report.isStale = cached.isStale;
+
+            if (cached.isStale) {
+                ++this.stats.stales;
+            }
+        }
+
+        // No generate method
+
+        if (!this.rule.generateFunc ||
+            report.error && !this.rule.generateOnReadError) {
+
+            this._send(key, report.error, cached ? cached.item : null, cached, report);
+            return;
+        }
+
+        // Check if found and fresh
+
+        if (cached &&
+            !cached.isStale) {
+
+            this._send(key, null, cached.item, cached, report);
+            return;
+        }
+
+        // Wait until generated or otherwise resolved
+
+        return Promise.race([
+            pending.promise,
+            this._generate(pending, key, cached, report)
+        ]);
+    }
+
+    _generate(pending, key, cached, report) {
+
+        if (cached) {                                               // Must be stale
+
+            // Set stale timeout
+
+            cached.ttl = cached.ttl - this.rule.staleTimeout;       // Adjust TTL for when the timeout is invoked (staleTimeout must be valid if isStale is true)
+        }
+
+        if (cached &&
+            cached.ttl > 0) {
+
+            pending.setTimeout(() => this._send(key, null, cached.item, cached, report), this.rule.staleTimeout);
+        }
+        else if (this.rule.generateTimeout) {
+
+            // Set item generation timeout (when not in cache)
+
+            pending.setTimeout(() => this._send(key, Boom.serverUnavailable(), null, null, report), this.rule.generateTimeout);
+        }
+
+        // Check if a generate call is already in progress
+
+        if (this._pendingGenerateCall.has(key.id)) {
+            return;
+        }
+
+        // Generate new value
+
+        ++this.stats.generates;                                     // Record generation before call in case it times out
+
+        if (this.rule.pendingGenerateTimeout) {
+            const timeout = setTimeout(() => this._pendingGenerateCall.delete(key.id), this.rule.pendingGenerateTimeout);
+            this._pendingGenerateCall.set(key.id, timeout);
+        }
+
+        return this._callGenerateFunc(key, cached, report);
+    }
+
+    async _callGenerateFunc(key, cached, report) {
+
+        const flags = {};
+
+        try {
+            var value = await this.rule.generateFunc(key.string ? key.id : key, flags);
+        }
+        catch (err) {
+            var generateError = err;
+            this._error('generate', err);
+        }
+
+        const pendingTimeout = this._pendingGenerateCall.get(key.id);
+        if (pendingTimeout) {
+            clearTimeout(pendingTimeout);
+            this._pendingGenerateCall.delete(key.id);
+        }
+
+        // Error (if dropOnError is not set to false) or not cached
+
+        try {
+            if (flags.ttl === 0 ||                                                  // null or undefined means use policy
+                generateError && this.rule.dropOnError) {
+
+                await this.drop(key.id);                                            // Invalidate cache
+            }
+            else if (!generateError) {
+                await this.set(key.id, value, flags.ttl);                           // Replace stale cache copy with late-coming fresh copy
+            }
+        }
+        catch (err) {
+            var persistError = err;
+            this._error('persist', err);
+        }
+
+        const error = generateError || (this.rule.generateIgnoreWriteError ? null : persistError);
+        if (cached &&
+            error &&
+            !this.rule.dropOnError) {
+
+            this._send(key, error, cached.item, cached, report);
+            return;
+        }
+
+        this._send(key, error, value, null, report);                             // Ignored if stale value already returned
+    }
+
+    _send(key, err, value, cached, report) {
+
+        const pending = this._pendings.get(key.id);
+        if (!pending) {
+            return;
+        }
+
+        this._pendings.delete(key.id);
+        pending.send(err, value, cached, report);
+
+        if (report?.isStale !== undefined) {
+            this.stats.hits = this.stats.hits + pending.count;
+        }
+    }
+
+    async set(key, value, ttl) {
+
+        ++this.stats.sets;
+
+        if (!this._cache) {
+            return;
+        }
+
+        try {
+            await this._cache.set({ segment: this._segment, id: internals.id(key) }, value, ttl || internals.Policy.ttl(this.rule));
+        }
+        catch (err) {
+            ++this.stats.errors;
+            throw err;
+        }
+    }
+
+    async drop(key) {
+
+        if (!this._cache) {
+            return;
+        }
+
+        try {
+            await this._cache.drop({ segment: this._segment, id: internals.id(key) });
+            return;
+        }
+        catch (err) {
+            ++this.stats.errors;
+            throw err;
+        }
+    }
+
+    ttl(created) {
+
+        return internals.Policy.ttl(this.rule, created);
+    }
+
+    isReady() {
+
+        if (!this._cache) {
+            return false;
+        }
+
+        return this._cache.connection.isReady();
+    }
+
+    static compile(options, serverSide) {
+
+        /*
+            {
+                expiresIn: 30000,
+                expiresAt: '13:00',
+                generateFunc: (id, flags) => { throw err; } / { return result; } / { flags.ttl = ttl; return result; }
+                generateTimeout: 500,
+                generateOnReadError: true,
+                generateIgnoreWriteError: true,
+                staleIn: 20000,
+                staleTimeout: 500,
+                dropOnError: true,
+                getDecoratedValue: false
+            }
+         */
+
+        const rule = {};
+
+        if (!options ||
+            !Object.keys(options).length) {
+
+            return rule;
+        }
+
+        // Validate rule
+
+        options = Validate.attempt(options, internals.schema, 'Invalid cache policy configuration');
+
+        const hasExpiresIn = options.expiresIn !== undefined && options.expiresIn !== null;
+        const hasExpiresAt = options.expiresAt !== undefined && options.expiresAt !== null;
+
+        Hoek.assert(!hasExpiresIn || !options.staleIn || typeof options.staleIn === 'function' || options.staleIn < options.expiresIn, 'staleIn must be less than expiresIn');
+        Hoek.assert(!options.staleIn || serverSide, 'Cannot use stale options without server-side caching');
+        Hoek.assert(!options.staleTimeout || !hasExpiresIn || options.staleTimeout < options.expiresIn, 'staleTimeout must be less than expiresIn');
+        Hoek.assert(!options.staleTimeout || !hasExpiresIn || typeof options.staleIn === 'function' || options.staleTimeout < options.expiresIn - options.staleIn, 'staleTimeout must be less than the delta between expiresIn and staleIn');
+        Hoek.assert(!options.staleTimeout || !options.pendingGenerateTimeout || options.staleTimeout < options.pendingGenerateTimeout, 'pendingGenerateTimeout must be greater than staleTimeout if specified');
+
+        // Expiration
+
+        if (hasExpiresAt) {
+
+            // expiresAt
+
+            const time = /^(\d\d?):(\d\d)$/.exec(options.expiresAt);
+            rule.expiresAt = {
+                hours: parseInt(time[1], 10),
+                minutes: parseInt(time[2], 10)
+            };
+        }
+        else {
+
+            // expiresIn
+
+            rule.expiresIn = options.expiresIn ?? 0;
+        }
+
+        // generateTimeout
+
+        if (options.generateFunc) {
+            rule.generateFunc = options.generateFunc;
+            rule.generateTimeout = options.generateTimeout;
+
+            // Stale
+
+            if (options.staleIn) {
+                rule.staleIn = options.staleIn;
+                rule.staleTimeout = options.staleTimeout;
+            }
+
+            rule.dropOnError = options.dropOnError !== undefined ? options.dropOnError : true;                                          // Defaults to true
+            rule.pendingGenerateTimeout = options.pendingGenerateTimeout !== undefined ? options.pendingGenerateTimeout : 0;            // Defaults to zero
+        }
+
+        rule.generateOnReadError = options.generateOnReadError !== undefined ? options.generateOnReadError : true;                      // Defaults to true
+        rule.generateIgnoreWriteError = options.generateIgnoreWriteError !== undefined ? options.generateIgnoreWriteError : true;       // Defaults to true
+
+        // Decorations
+
+        rule.getDecoratedValue = options.getDecoratedValue;
+
+        return rule;
+    }
+
+    static ttl(rule, created, now) {
+
+        now = now ?? Date.now();
+        created = created ?? now;
+        const age = now - created;
+
+        if (age < 0) {
+            return 0;                                                                   // Created in the future, assume expired/bad
+        }
+
+        if (rule.expiresIn) {
+            return Math.max(rule.expiresIn - age, 0);
+        }
+
+        if (rule.expiresAt) {
+            if (age > internals.day) {                                                  // If the item was created more than a 24 hours ago
+                return 0;
+            }
+
+            const expiresAt = new Date(created);                                        // Compare expiration time on the same day
+            expiresAt.setHours(rule.expiresAt.hours);
+            expiresAt.setMinutes(rule.expiresAt.minutes);
+            expiresAt.setSeconds(0);
+            expiresAt.setMilliseconds(0);
+            let expires = expiresAt.getTime();
+
+            if (expires <= created) {
+                expires = expires + internals.day;                                     // Move to tomorrow
+            }
+
+            if (now >= expires) {                                                      // Expired
+                return 0;
+            }
+
+            return expires - now;
+        }
+
+        return 0;                                                                       // No rule
+    }
+};
+
+
+internals.id = function (key) {
+
+    return key && typeof key === 'object' ? key.id : key;
+};
diff --git a/node_modules/@hapi/catbox/package.json b/node_modules/@hapi/catbox/package.json
new file mode 100755
index 0000000..dffc84a
--- /dev/null
+++ b/node_modules/@hapi/catbox/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "@hapi/catbox",
+  "description": "Multi-strategy object caching service",
+  "version": "12.1.1",
+  "repository": "git://github.com/hapijs/catbox",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "cache",
+    "generic",
+    "adapter"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/podium": "^5.0.0",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^18.11.9",
+    "typescript": "^4.9.3"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -m 5000 -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/content/LICENSE.md b/node_modules/@hapi/content/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/content/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/content/README.md b/node_modules/@hapi/content/README.md
new file mode 100644
index 0000000..9310ca6
--- /dev/null
+++ b/node_modules/@hapi/content/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/content
+
+#### HTTP Content-* headers parsing.
+
+**content** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/content/)
+- [Versions status](https://hapi.dev/resources/status/#content) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/content/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/content/lib/index.js b/node_modules/@hapi/content/lib/index.js
new file mode 100755
index 0000000..6ae94a4
--- /dev/null
+++ b/node_modules/@hapi/content/lib/index.js
@@ -0,0 +1,171 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+/*
+    RFC 7231 Section 3.1.1.1
+
+    media-type = type "/" subtype *( OWS ";" OWS parameter )
+    type       = token
+    subtype    = token
+    parameter  = token "=" ( token / quoted-string )
+*/
+
+//                             1: type/subtype                                           2: params
+internals.contentTypeRegex = /^([A-Za-z0-9!#$%&'*+.^_`|~-]+\/[A-Za-z0-9!#$%&'*+.^_`|~-]+)([ \t;][^\r\n]*)?$/;
+
+//                                             1: "b"   2: b
+internals.charsetParamRegex = /;\s*charset=(?:"([^"]+)"|([^;"\s]+))/i;
+
+//                                               1: "b"   2: b
+internals.boundaryParamRegex = /;\s*boundary=(?:"([^"]+)"|([^;"\s]+))/i;
+
+
+exports.type = function (header) {
+
+    if (!header) {
+        throw Boom.badRequest('Invalid content-type header');
+    }
+
+    const match = header.match(internals.contentTypeRegex);
+    if (!match) {
+        throw Boom.badRequest('Invalid content-type header');
+    }
+
+    const result = {
+        mime: match[1].toLowerCase()
+    };
+
+    const params = match[2];
+    if (params) {
+        const param = params.match(internals.charsetParamRegex);
+        if (param) {
+            result.charset = (param[1] || param[2]).toLowerCase();
+
+            if (internals.charsetParamRegex.test(params.slice(param.index + param[0].length))) {
+                throw Boom.badRequest('Invalid content-type header: duplicate parameter');
+            }
+        }
+    }
+
+    if (result.mime.indexOf('multipart/') === 0) {
+        if (params) {
+            const param = params.match(internals.boundaryParamRegex);
+            if (param) {
+                result.boundary = param[1] || param[2];
+
+                if (internals.boundaryParamRegex.test(params.slice(param.index + param[0].length))) {
+                    throw Boom.badRequest('Invalid content-type header: duplicate parameter');
+                }
+            }
+        }
+
+        if (!result.boundary) {
+            throw Boom.badRequest('Invalid content-type header: multipart missing boundary');
+        }
+    }
+
+    return result;
+};
+
+
+/*
+    RFC 6266 Section 4.1 (http://tools.ietf.org/html/rfc6266#section-4.1)
+
+    content-disposition = "Content-Disposition" ":" disposition-type *( ";" disposition-parm )
+    disposition-type    = "inline" | "attachment" | token                                           ; case-insensitive
+    disposition-parm    = filename-parm | token [ "*" ] "=" ( token | quoted-string | ext-value)    ; ext-value defined in [RFC5987], Section 3.2
+
+    Content-Disposition header field values with multiple instances of the same parameter name are invalid.
+
+    Note that due to the rules for implied linear whitespace (Section 2.1 of [RFC2616]), OPTIONAL whitespace
+    can appear between words (token or quoted-string) and separator characters.
+
+    Furthermore, note that the format used for ext-value allows specifying a natural language (e.g., "en"); this is of limited use
+    for filenames and is likely to be ignored by recipients.
+*/
+
+
+internals.contentDispositionRegex = /^\s*form-data\s*(?:;\s*(\S.*))?$/i;
+
+//                                        1: name     2: *            3: ext-value                      4: quoted  5: token
+internals.contentDispositionParamRegex = /([^\=\*\s]+)(\*)?\s*\=\s*(?:([^;'"\s]+\'[\w-]*\'[^;\s]+)|(?:\"([^"]*)\")|([^;\s]*))/g;
+
+exports.disposition = function (header) {
+
+    if (!header) {
+        throw Boom.badRequest('Missing content-disposition header');
+    }
+
+    const match = header.match(internals.contentDispositionRegex);
+    if (!match) {
+        throw Boom.badRequest('Invalid content-disposition header format');
+    }
+
+    const parameters = match[1];
+    if (!parameters) {
+        throw Boom.badRequest('Invalid content-disposition header missing parameters');
+    }
+
+    const result = {};
+    const extKeys = new Set();
+    parameters.replace(internals.contentDispositionParamRegex, ($0, $1, $2, $3, $4, $5) => {
+
+        if ($1 === '__proto__') {
+            throw Boom.badRequest('Invalid content-disposition header format includes invalid parameters');
+        }
+
+        if (result[$1] !== undefined) {
+            if ($2 && !extKeys.has($1)) {
+                // ext-value overriding regular value - allowed per RFC 6266 Section 4.3
+            }
+            else if (!$2 && extKeys.has($1)) {
+                // Regular value after ext-value - ignore (keep ext-value)
+                return;
+            }
+            else {
+                throw Boom.badRequest('Invalid content-disposition header format includes invalid parameters');
+            }
+        }
+
+        if ($2) {
+            extKeys.add($1);
+        }
+
+        let value;
+
+        if ($2) {
+            if (!$3) {
+                throw Boom.badRequest('Invalid content-disposition header format includes invalid parameters');
+            }
+
+            try {
+                value = decodeURIComponent($3.slice($3.indexOf('\'', $3.indexOf('\'') + 1) + 1));
+            }
+            catch (err) {
+                throw Boom.badRequest('Invalid content-disposition header format includes invalid parameters');
+            }
+        }
+        else {
+            value = $4 || $5 || '';
+        }
+
+        if ($1 === 'name' &&
+            value === '__proto__') {
+
+            throw Boom.badRequest('Invalid content-disposition header format includes invalid parameters');
+        }
+
+        result[$1] = value;
+    });
+
+    if (!result.name) {
+        throw Boom.badRequest('Invalid content-disposition header missing name parameter');
+    }
+
+    return result;
+};
diff --git a/node_modules/@hapi/content/package.json b/node_modules/@hapi/content/package.json
new file mode 100644
index 0000000..dccd057
--- /dev/null
+++ b/node_modules/@hapi/content/package.json
@@ -0,0 +1,35 @@
+{
+  "name": "@hapi/content",
+  "description": "HTTP Content-* headers parsing",
+  "version": "6.0.2",
+  "repository": "git://github.com/hapijs/content",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "HTTP",
+    "header",
+    "content",
+    "content-type",
+    "content-disposition"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.0"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.0.1"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/cryptiles/LICENSE.md b/node_modules/@hapi/cryptiles/LICENSE.md
new file mode 100755
index 0000000..a066ddd
--- /dev/null
+++ b/node_modules/@hapi/cryptiles/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/cryptiles/README.md b/node_modules/@hapi/cryptiles/README.md
new file mode 100755
index 0000000..d26926b
--- /dev/null
+++ b/node_modules/@hapi/cryptiles/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/cryptiles
+
+#### General purpose crypto utilities.
+
+**cryptiles** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/cryptiles/)
+- [Versions status](https://hapi.dev/resources/status/#cryptiles) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/cryptiles/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/cryptiles/lib/index.d.ts b/node_modules/@hapi/cryptiles/lib/index.d.ts
new file mode 100755
index 0000000..f3199f6
--- /dev/null
+++ b/node_modules/@hapi/cryptiles/lib/index.d.ts
@@ -0,0 +1,54 @@
+/**
+Generate a cryptographically strong pseudo-random data
+
+@param size - Size of the string
+
+@returns A cryptographically strong pseudo-random data
+*/
+
+export function randomString(size: number): string;
+
+
+/**
+Generate a cryptographically strong pseudo-random alphanumeric data
+
+@param size - Size of the string
+
+@returns A cryptographically strong pseudo-random alphanumeric data
+*/
+
+export function randomAlphanumString(size: number): string;
+
+
+/**
+Return a random string of digits
+
+@param size - Size of the digits
+
+@returns A random string of digits
+*/
+
+export function randomDigits(size: number): string;
+
+
+/**
+Generate a buffer of random bits
+
+@param bits - Number of bits
+
+@returns A buffer of random bits
+*/
+
+export function randomBits(bits: number): Buffer;
+
+
+/**
+Generate a buffer of random bits
+
+@param a - Data to compare
+@param b - Data to compare
+
+@returns A boolean comparing a and b
+*/
+
+export function fixedTimeComparison(a: string | Array<any>, b: string | Array<any>): boolean;
diff --git a/node_modules/@hapi/cryptiles/lib/index.js b/node_modules/@hapi/cryptiles/lib/index.js
new file mode 100755
index 0000000..a05f31b
--- /dev/null
+++ b/node_modules/@hapi/cryptiles/lib/index.js
@@ -0,0 +1,96 @@
+'use strict';
+
+const Crypto = require('crypto');
+
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+// Generate a cryptographically strong pseudo-random data
+
+exports.randomString = function (size) {
+
+    const buffer = exports.randomBits((size + 1) * 6);
+    const string = buffer.toString('base64').replace(/\+/g, '-').replace(/\//g, '_').replace(/\=/g, '');
+    return string.slice(0, size);
+};
+
+
+// Generate a cryptographically strong pseudo-random alphanum data
+
+exports.randomAlphanumString = function (size) {
+
+    let result = '';
+
+    while (result.length < size) {
+        const buffer = exports.randomBits((size + 1) * 6);
+        result += buffer.toString('base64').replace(/[^a-zA-Z0-9]/g, '');
+    }
+
+    return result.slice(0, size);
+};
+
+
+// Return a random string of digits
+
+exports.randomDigits = function (size) {
+
+    const digits = [];
+
+    let buffer = internals.random(size * 2);            // Provision twice the amount of bytes needed to increase chance of single pass
+    let pos = 0;
+
+    while (digits.length < size) {
+        if (pos >= buffer.length) {
+            buffer = internals.random(size * 2);
+            pos = 0;
+        }
+
+        if (buffer[pos] < 250) {
+            digits.push(buffer[pos] % 10);
+        }
+
+        ++pos;
+    }
+
+    return digits.join('');
+};
+
+
+// Generate a buffer of random bits
+
+exports.randomBits = function (bits) {
+
+    if (!bits ||
+        bits < 0) {
+
+        throw Boom.internal('Invalid random bits count');
+    }
+
+    const bytes = Math.ceil(bits / 8);
+    return internals.random(bytes);
+};
+
+
+exports.fixedTimeComparison = function (a, b) {
+
+    try {
+        return Crypto.timingSafeEqual(Buffer.from(a), Buffer.from(b));
+    }
+    catch (err) {
+        return false;
+    }
+};
+
+
+internals.random = function (bytes) {
+
+    try {
+        return Crypto.randomBytes(bytes);
+    }
+    catch (err) {
+        throw Boom.internal('Failed generating random bits: ' + err.message);
+    }
+};
diff --git a/node_modules/@hapi/cryptiles/package.json b/node_modules/@hapi/cryptiles/package.json
new file mode 100755
index 0000000..d1a29a9
--- /dev/null
+++ b/node_modules/@hapi/cryptiles/package.json
@@ -0,0 +1,39 @@
+{
+  "name": "@hapi/cryptiles",
+  "description": "General purpose crypto utilities",
+  "version": "6.0.3",
+  "repository": "git://github.com/hapijs/cryptiles",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "engines": {
+    "node": ">=14.0.0"
+  },
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "cryptography",
+    "security",
+    "utilites"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/file/LICENSE.md b/node_modules/@hapi/file/LICENSE.md
new file mode 100644
index 0000000..d6b0ef8
--- /dev/null
+++ b/node_modules/@hapi/file/LICENSE.md
@@ -0,0 +1,9 @@
+Copyright (c) 2019-2022, Project contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+ * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ * The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/file/README.md b/node_modules/@hapi/file/README.md
new file mode 100644
index 0000000..e576f0b
--- /dev/null
+++ b/node_modules/@hapi/file/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/file
+
+#### General purpose file utilities.
+
+**file** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/file/)
+- [Versions status](https://hapi.dev/resources/status/#file) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/file/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/file/lib/index.d.ts b/node_modules/@hapi/file/lib/index.d.ts
new file mode 100755
index 0000000..d33dbd6
--- /dev/null
+++ b/node_modules/@hapi/file/lib/index.d.ts
@@ -0,0 +1,9 @@
+/**
+Generate a random file name within a given path and optional extension.
+
+@param path - The file path within to generate a temporary file.
+@param extension - File extension.
+
+@return The generarted filename.
+*/
+export function uniqueFilename(path: string, extension?: string): string;
diff --git a/node_modules/@hapi/file/lib/index.js b/node_modules/@hapi/file/lib/index.js
new file mode 100755
index 0000000..e00e46a
--- /dev/null
+++ b/node_modules/@hapi/file/lib/index.js
@@ -0,0 +1,22 @@
+'use strict';
+
+const Crypto = require('crypto');
+const Path = require('path');
+
+
+const internals = {};
+
+
+exports.uniqueFilename = function (path, extension) {
+
+    if (extension) {
+        extension = extension[0] !== '.' ? '.' + extension : extension;
+    }
+    else {
+        extension = '';
+    }
+
+    path = Path.resolve(path);
+    const name = [Date.now(), process.pid, Crypto.randomBytes(8).toString('hex')].join('-') + extension;
+    return Path.join(path, name);
+};
diff --git a/node_modules/@hapi/file/package.json b/node_modules/@hapi/file/package.json
new file mode 100644
index 0000000..5bb122d
--- /dev/null
+++ b/node_modules/@hapi/file/package.json
@@ -0,0 +1,33 @@
+{
+  "name": "@hapi/file",
+  "description": "General purpose file utilities",
+  "version": "3.0.0",
+  "repository": "git://github.com/hapijs/file",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "utilities",
+    "file"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.0.1",
+    "@types/node": "^17.0.36",
+    "typescript": "~4.7.2"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/hapi/LICENSE.md b/node_modules/@hapi/hapi/LICENSE.md
new file mode 100755
index 0000000..a5899ce
--- /dev/null
+++ b/node_modules/@hapi/hapi/LICENSE.md
@@ -0,0 +1,13 @@
+Copyright (c) 2011-2022, Project contributors
+Copyright (c) 2011-2020, Sideway Inc
+Copyright (c) 2011-2014, Walmart  
+Copyright (c) 2011, Yahoo Inc.  
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+- The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/hapi/README.md b/node_modules/@hapi/hapi/README.md
new file mode 100755
index 0000000..44925bc
--- /dev/null
+++ b/node_modules/@hapi/hapi/README.md
@@ -0,0 +1,26 @@
+<img src="https://raw.githubusercontent.com/hapijs/assets/master/images/hapi.png" width="400px" />
+
+# @hapi/hapi
+
+#### The Simple, Secure Framework Developers Trust
+
+Build powerful, scalable applications, with minimal overhead and full out-of-the-box functionality - your code, your way.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/)
+- [Version status](https://hapi.dev/resources/status/#hapi) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/resources/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Support](https://hapi.dev/support/)
+
+## Technical Steering Committee (TSC) Members
+
+ - Devin Ivy ([@devinivy](https://github.com/devinivy))
+ - Lloyd Benson ([@lloydbenson](https://github.com/lloydbenson))
+ - Nathan LaFreniere ([@nlf](https://github.com/nlf))
+ - Wyatt Lyon Preul ([@geek](https://github.com/geek))
+ - Nicolas Morel ([@marsup](https://github.com/marsup))
+ - Jonathan Samines ([@jonathansamines](https://github.com/jonathansamines))
diff --git a/node_modules/@hapi/hapi/lib/auth.js b/node_modules/@hapi/hapi/lib/auth.js
new file mode 100755
index 0000000..e3de0fc
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/auth.js
@@ -0,0 +1,571 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+
+const Config = require('./config');
+const Request = require('./request');
+
+
+const internals = {
+    missing: Symbol('missing')
+};
+
+
+exports = module.exports = internals.Auth = class {
+
+    #core = null;
+    #schemes = {};
+    #strategies = {};
+
+    api = {};                   // Do not reassign api or settings, as they are referenced in public()
+    settings = {
+        default: null           // Strategy used as default if route has no auth settings
+    };
+
+    constructor(core) {
+
+        this.#core = core;
+    }
+
+    public(server) {
+
+        return {
+            api: this.api,
+            settings: this.settings,
+            scheme: this.scheme.bind(this),
+            strategy: this._strategy.bind(this, server),
+            default: this.default.bind(this),
+            test: this.test.bind(this),
+            verify: this.verify.bind(this),
+            lookup: this.lookup.bind(this)
+        };
+    }
+
+    scheme(name, scheme) {
+
+        Hoek.assert(name, 'Authentication scheme must have a name');
+        Hoek.assert(!this.#schemes[name], 'Authentication scheme name already exists:', name);
+        Hoek.assert(typeof scheme === 'function', 'scheme must be a function:', name);
+
+        this.#schemes[name] = scheme;
+    }
+
+    _strategy(server, name, scheme, options = {}) {
+
+        Hoek.assert(name, 'Authentication strategy must have a name');
+        Hoek.assert(typeof options === 'object', 'options must be an object');
+        Hoek.assert(!this.#strategies[name], 'Authentication strategy name already exists');
+        Hoek.assert(scheme, 'Authentication strategy', name, 'missing scheme');
+        Hoek.assert(this.#schemes[scheme], 'Authentication strategy', name, 'uses unknown scheme:', scheme);
+
+        server = server._clone();
+        const strategy = this.#schemes[scheme](server, options);
+
+        Hoek.assert(strategy.authenticate, 'Invalid scheme:', name, 'missing authenticate() method');
+        Hoek.assert(typeof strategy.authenticate === 'function', 'Invalid scheme:', name, 'invalid authenticate() method');
+        Hoek.assert(!strategy.payload || typeof strategy.payload === 'function', 'Invalid scheme:', name, 'invalid payload() method');
+        Hoek.assert(!strategy.response || typeof strategy.response === 'function', 'Invalid scheme:', name, 'invalid response() method');
+        strategy.options = strategy.options ?? {};
+        Hoek.assert(strategy.payload || !strategy.options.payload, 'Cannot require payload validation without a payload method');
+
+        this.#strategies[name] = {
+            methods: strategy,
+            realm: server.realm
+        };
+
+        if (strategy.api) {
+            this.api[name] = strategy.api;
+        }
+    }
+
+    default(options) {
+
+        Hoek.assert(!this.settings.default, 'Cannot set default strategy more than once');
+        options = Config.apply('auth', options, 'default strategy');
+
+        this.settings.default = this._setupRoute(Hoek.clone(options));      // Prevent changes to options
+
+        const routes = this.#core.router.table();
+        for (const route of routes) {
+            route.rebuild();
+        }
+    }
+
+    async test(name, request) {
+
+        Hoek.assert(name, 'Missing authentication strategy name');
+        const strategy = this.#strategies[name];
+        Hoek.assert(strategy, 'Unknown authentication strategy:', name);
+
+        const bind = strategy.methods;
+        const realm = strategy.realm;
+        const response = await request._core.toolkit.execute(strategy.methods.authenticate, request, { bind, realm, auth: true });
+
+        if (!response.isAuth) {
+            throw response;
+        }
+
+        if (response.error) {
+            throw response.error;
+        }
+
+        return response.data;
+    }
+
+    async verify(request) {
+
+        const auth = request.auth;
+
+        if (auth.error) {
+            throw auth.error;
+        }
+
+        if (!auth.isAuthenticated) {
+            return;
+        }
+
+        const strategy = this.#strategies[auth.strategy];
+        Hoek.assert(strategy, 'Unknown authentication strategy:', auth.strategy);
+
+        if (!strategy.methods.verify) {
+            return;
+        }
+
+        const bind = strategy.methods;
+        await strategy.methods.verify.call(bind, auth);
+    }
+
+    static testAccess(request, route) {
+
+        const auth = request._core.auth;
+
+        try {
+            return auth._access(request, route);
+        }
+        catch (err) {
+            Bounce.rethrow(err, 'system');
+            return false;
+        }
+    }
+
+    _setupRoute(options, path) {
+
+        if (!options) {
+            return options;         // Preserve the difference between undefined and false
+        }
+
+        if (typeof options === 'string') {
+            options = { strategies: [options] };
+        }
+        else if (options.strategy) {
+            options.strategies = [options.strategy];
+            delete options.strategy;
+        }
+
+        if (path &&
+            !options.strategies) {
+
+            Hoek.assert(this.settings.default, 'Route missing authentication strategy and no default defined:', path);
+            options = Hoek.applyToDefaults(this.settings.default, options);
+        }
+
+        path = path ?? 'default strategy';
+        Hoek.assert(options.strategies?.length, 'Missing authentication strategy:', path);
+
+        options.mode = options.mode ?? 'required';
+
+        if (options.entity !== undefined ||                                             // Backwards compatibility with <= 11.x.x
+            options.scope !== undefined) {
+
+            options.access = [{ entity: options.entity, scope: options.scope }];
+            delete options.entity;
+            delete options.scope;
+        }
+
+        if (options.access) {
+            for (const access of options.access) {
+                access.scope = internals.setupScope(access);
+            }
+        }
+
+        if (options.payload === true) {
+            options.payload = 'required';
+        }
+
+        let hasAuthenticatePayload = false;
+        for (const name of options.strategies) {
+            const strategy = this.#strategies[name];
+            Hoek.assert(strategy, 'Unknown authentication strategy', name, 'in', path);
+
+            Hoek.assert(strategy.methods.payload || options.payload !== 'required', 'Payload validation can only be required when all strategies support it in', path);
+            hasAuthenticatePayload = hasAuthenticatePayload || strategy.methods.payload;
+            Hoek.assert(!strategy.methods.options.payload || options.payload === undefined || options.payload === 'required', 'Cannot set authentication payload to', options.payload, 'when a strategy requires payload validation in', path);
+        }
+
+        Hoek.assert(!options.payload || hasAuthenticatePayload, 'Payload authentication requires at least one strategy with payload support in', path);
+
+        return options;
+    }
+
+    lookup(route) {
+
+        if (route.settings.auth === false) {
+            return false;
+        }
+
+        return route.settings.auth || this.settings.default;
+    }
+
+    _enabled(route, type) {
+
+        const config = this.lookup(route);
+        if (!config) {
+            return false;
+        }
+
+        if (type === 'authenticate') {
+            return true;
+        }
+
+        if (type === 'access') {
+            return !!config.access;
+        }
+
+        for (const name of config.strategies) {
+            const strategy = this.#strategies[name];
+            if (strategy.methods[type]) {
+                return true;
+            }
+        }
+
+        return false;
+    }
+
+    static authenticate(request) {
+
+        const auth = request._core.auth;
+        return auth._authenticate(request);
+    }
+
+    async _authenticate(request) {
+
+        const config = this.lookup(request.route);
+
+        const errors = [];
+        request.auth.mode = config.mode;
+
+        // Injection bypass
+
+        if (request.auth.credentials) {
+            internals.validate(null, { credentials: request.auth.credentials, artifacts: request.auth.artifacts }, request.auth.strategy, config, request, errors);
+            return;
+        }
+
+        // Try each strategy
+
+        for (const name of config.strategies) {
+            const strategy = this.#strategies[name];
+
+            const bind = strategy.methods;
+            const realm = strategy.realm;
+            const response = await request._core.toolkit.execute(strategy.methods.authenticate, request, { bind, realm, auth: true });
+
+            const message = (response.isAuth ? internals.validate(response.error, response.data, name, config, request, errors) : internals.validate(response, null, name, config, request, errors));
+            if (!message) {
+                return;
+            }
+
+            if (message !== internals.missing) {
+                return message;
+            }
+        }
+
+        // No more strategies
+
+        const err = Boom.unauthorized('Missing authentication', errors);
+        if (config.mode === 'required') {
+            throw err;
+        }
+
+        request.auth.isAuthenticated = false;
+        request.auth.credentials = null;
+        request.auth.error = err;
+        request._log(['auth', 'unauthenticated']);
+    }
+
+    static access(request) {
+
+        const auth = request._core.auth;
+        request.auth.isAuthorized = auth._access(request);
+    }
+
+    _access(request, route) {
+
+        const config = this.lookup(route || request.route);
+        if (!config?.access) {
+            return true;
+        }
+
+        const credentials = request.auth.credentials;
+        if (!credentials) {
+            if (config.mode !== 'required') {
+                return false;
+            }
+
+            throw Boom.forbidden('Request is unauthenticated');
+        }
+
+        const requestEntity = (credentials.user ? 'user' : 'app');
+
+        const scopeErrors = [];
+        for (const access of config.access) {
+
+            // Check entity
+
+            const entity = access.entity;
+            if (entity &&
+                entity !== 'any' &&
+                entity !== requestEntity) {
+
+                continue;
+            }
+
+            // Check scope
+
+            let scope = access.scope;
+            if (scope) {
+                if (!credentials.scope) {
+                    scopeErrors.push(scope);
+                    continue;
+                }
+
+                scope = internals.expandScope(request, scope);
+                if (!internals.validateScope(credentials, scope, 'required') ||
+                    !internals.validateScope(credentials, scope, 'selection') ||
+                    !internals.validateScope(credentials, scope, 'forbidden')) {
+
+                    scopeErrors.push(scope);
+                    continue;
+                }
+            }
+
+            return true;
+        }
+
+        // Scope error
+
+        if (scopeErrors.length) {
+            request._log(['auth', 'scope', 'error']);
+            throw Boom.forbidden('Insufficient scope', { got: credentials.scope, need: scopeErrors });
+        }
+
+        // Entity error
+
+        if (requestEntity === 'app') {
+            request._log(['auth', 'entity', 'user', 'error']);
+            throw Boom.forbidden('Application credentials cannot be used on a user endpoint');
+        }
+
+        request._log(['auth', 'entity', 'app', 'error']);
+        throw Boom.forbidden('User credentials cannot be used on an application endpoint');
+    }
+
+    static async payload(request) {
+
+        if (!request.auth.isAuthenticated || !request.auth[Request.symbols.authPayload]) {
+            return;
+        }
+
+        const auth = request._core.auth;
+        const strategy = auth.#strategies[request.auth.strategy];
+        Hoek.assert(strategy, 'Unknown authentication strategy:', request.auth.strategy);
+
+        if (!strategy.methods.payload) {
+            return;
+        }
+
+        const config = auth.lookup(request.route);
+        const setting = config.payload ?? (strategy.methods.options.payload ? 'required' : false);
+        if (!setting) {
+            return;
+        }
+
+        const bind = strategy.methods;
+        const realm = strategy.realm;
+        const response = await request._core.toolkit.execute(strategy.methods.payload, request, { bind, realm });
+
+        if (response.isBoom &&
+            response.isMissing) {
+
+            return setting === 'optional' ? undefined : Boom.unauthorized('Missing payload authentication');
+        }
+
+        return response;
+    }
+
+    static async response(response) {
+
+        const request = response.request;
+        const auth = request._core.auth;
+        if (!request.auth.isAuthenticated) {
+            return;
+        }
+
+        const strategy = auth.#strategies[request.auth.strategy];
+        Hoek.assert(strategy, 'Unknown authentication strategy:', request.auth.strategy);
+
+        if (!strategy.methods.response) {
+            return;
+        }
+
+        const bind = strategy.methods;
+        const realm = strategy.realm;
+        const error = await request._core.toolkit.execute(strategy.methods.response, request, { bind, realm, continue: 'undefined' });
+        if (error) {
+            throw error;
+        }
+    }
+};
+
+
+internals.setupScope = function (access) {
+
+    // No scopes
+
+    if (!access.scope) {
+        return false;
+    }
+
+    // Already setup
+
+    if (!Array.isArray(access.scope)) {
+        return access.scope;
+    }
+
+    const scope = {};
+    for (const value of access.scope) {
+        const prefix = value[0];
+        const type = prefix === '+' ? 'required' : (prefix === '!' ? 'forbidden' : 'selection');
+        const clean = type === 'selection' ? value : value.slice(1);
+        scope[type] = scope[type] ?? [];
+        scope[type].push(clean);
+
+        if ((!scope._hasParameters?.[type]) &&
+            /{([^}]+)}/.test(clean)) {
+
+            scope._hasParameters = scope._hasParameters ?? {};
+            scope._hasParameters[type] = true;
+        }
+    }
+
+    return scope;
+};
+
+
+internals.validate = function (err, result, name, config, request, errors) {                 // err can be Boom, Error, or a valid response object
+
+    result = result ?? {};
+    request.auth.isAuthenticated = !err;
+
+    if (err) {
+
+        // Non-error response
+
+        if (err instanceof Error === false) {
+            request._log(['auth', 'unauthenticated', 'response', name], { statusCode: err.statusCode });
+            return err;
+        }
+
+        // Missing authenticated
+
+        if (err.isMissing) {
+            request._log(['auth', 'unauthenticated', 'missing', name], err);
+            errors.push(err.output.headers['WWW-Authenticate']);
+            return internals.missing;
+        }
+    }
+
+    request.auth.strategy = name;
+    request.auth.credentials = result.credentials;
+    request.auth.artifacts = result.artifacts;
+
+    // Authenticated
+
+    if (!err) {
+        return;
+    }
+
+    // Unauthenticated
+
+    request.auth.error = err;
+
+    if (config.mode === 'try') {
+        request._log(['auth', 'unauthenticated', 'try', name], err);
+        return;
+    }
+
+    request._log(['auth', 'unauthenticated', 'error', name], err);
+    throw err;
+};
+
+
+internals.expandScope = function (request, scope) {
+
+    if (!scope._hasParameters) {
+        return scope;
+    }
+
+    const expanded = {
+        required: internals.expandScopeType(request, scope, 'required'),
+        selection: internals.expandScopeType(request, scope, 'selection'),
+        forbidden: internals.expandScopeType(request, scope, 'forbidden')
+    };
+
+    return expanded;
+};
+
+
+internals.expandScopeType = function (request, scope, type) {
+
+    if (!scope._hasParameters[type]) {
+        return scope[type];
+    }
+
+    const expanded = [];
+    const context = {
+        params: request.params,
+        query: request.query,
+        payload: request.payload,
+        credentials: request.auth.credentials
+    };
+
+    for (const template of scope[type]) {
+        expanded.push(Hoek.reachTemplate(context, template));
+    }
+
+    return expanded;
+};
+
+
+internals.validateScope = function (credentials, scope, type) {
+
+    if (!scope[type]) {
+        return true;
+    }
+
+    const count = typeof credentials.scope === 'string' ?
+        scope[type].indexOf(credentials.scope) !== -1 ? 1 : 0 :
+        Hoek.intersect(scope[type], credentials.scope).length;
+
+    if (type === 'forbidden') {
+        return count === 0;
+    }
+
+    if (type === 'required') {
+        return count === scope.required.length;
+    }
+
+    return !!count;
+};
diff --git a/node_modules/@hapi/hapi/lib/compression.js b/node_modules/@hapi/hapi/lib/compression.js
new file mode 100755
index 0000000..3e4c692
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/compression.js
@@ -0,0 +1,119 @@
+'use strict';
+
+const Zlib = require('zlib');
+
+const Accept = require('@hapi/accept');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {
+    common: ['gzip, deflate', 'deflate, gzip', 'gzip', 'deflate', 'gzip, deflate, br']
+};
+
+
+exports = module.exports = internals.Compression = class {
+
+    decoders = {
+        gzip: (options) => Zlib.createGunzip(options),
+        deflate: (options) => Zlib.createInflate(options)
+    };
+
+    encodings = ['identity', 'gzip', 'deflate'];
+
+    encoders = {
+        identity: null,
+        gzip: (options) => Zlib.createGzip(options),
+        deflate: (options) => Zlib.createDeflate(options)
+    };
+
+    #common = null;
+
+    constructor() {
+
+        this._updateCommons();
+    }
+
+    _updateCommons() {
+
+        this.#common = new Map();
+
+        for (const header of internals.common) {
+            this.#common.set(header, Accept.encoding(header, this.encodings));
+        }
+    }
+
+    addEncoder(encoding, encoder) {
+
+        Hoek.assert(this.encoders[encoding] === undefined, `Cannot override existing encoder for ${encoding}`);
+        Hoek.assert(typeof encoder === 'function', `Invalid encoder function for ${encoding}`);
+        this.encoders[encoding] = encoder;
+        this.encodings.unshift(encoding);
+        this._updateCommons();
+    }
+
+    addDecoder(encoding, decoder) {
+
+        Hoek.assert(this.decoders[encoding] === undefined, `Cannot override existing decoder for ${encoding}`);
+        Hoek.assert(typeof decoder === 'function', `Invalid decoder function for ${encoding}`);
+        this.decoders[encoding] = decoder;
+    }
+
+    accept(request) {
+
+        const header = request.headers['accept-encoding'];
+        if (!header) {
+            return 'identity';
+        }
+
+        const common = this.#common.get(header);
+        if (common) {
+            return common;
+        }
+
+        try {
+            return Accept.encoding(header, this.encodings);
+        }
+        catch (err) {
+            Bounce.rethrow(err, 'system');
+            err.header = header;
+            request._log(['accept-encoding', 'error'], err);
+            return 'identity';
+        }
+    }
+
+    encoding(response, length) {
+
+        if (response.settings.compressed) {
+            response.headers['content-encoding'] = response.settings.compressed;
+            return null;
+        }
+
+        const request = response.request;
+        if (!request._core.settings.compression ||
+            length !== null && length < request._core.settings.compression.minBytes) {
+
+            return null;
+        }
+
+        const mime = request._core.mime.type(response.headers['content-type'] || 'application/octet-stream');
+        if (!mime.compressible) {
+            return null;
+        }
+
+        response.vary('accept-encoding');
+
+        if (response.headers['content-encoding']) {
+            return null;
+        }
+
+        return request.info.acceptEncoding === 'identity' ? null : request.info.acceptEncoding;
+    }
+
+    encoder(request, encoding) {
+
+        const encoder = this.encoders[encoding];
+        Hoek.assert(encoder !== undefined, `Unknown encoding ${encoding}`);
+        return encoder(request.route.settings.compression[encoding]);
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/config.js b/node_modules/@hapi/hapi/lib/config.js
new file mode 100755
index 0000000..2b668f9
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/config.js
@@ -0,0 +1,446 @@
+'use strict';
+
+const Os = require('os');
+
+const Somever = require('@hapi/somever');
+const Validate = require('@hapi/validate');
+
+
+const internals = {};
+
+
+exports.symbol = Symbol('hapi-response');
+
+
+exports.apply = function (type, options, ...message) {
+
+    const result = internals[type].validate(options);
+
+    if (result.error) {
+        throw new Error(`Invalid ${type} options ${message.length ? '(' + message.join(' ') + ')' : ''} ${result.error.annotate()}`);
+    }
+
+    return result.value;
+};
+
+
+exports.enable = function (options) {
+
+    const settings = options ? Object.assign({}, options) : {};         // Shallow cloned
+
+    if (settings.security === true) {
+        settings.security = {};
+    }
+
+    if (settings.cors === true) {
+        settings.cors = {};
+    }
+
+    return settings;
+};
+
+exports.versionMatch = (version, range) => Somever.match(version, range, { includePrerelease: true });
+
+internals.access = Validate.object({
+    entity: Validate.valid('user', 'app', 'any'),
+    scope: [false, Validate.array().items(Validate.string()).single().min(1)]
+});
+
+
+internals.auth = Validate.alternatives([
+    Validate.string(),
+    internals.access.keys({
+        mode: Validate.valid('required', 'optional', 'try'),
+        strategy: Validate.string(),
+        strategies: Validate.array().items(Validate.string()).min(1),
+        access: Validate.array().items(internals.access.min(1)).single().min(1),
+        payload: [
+            Validate.valid('required', 'optional'),
+            Validate.boolean()
+        ]
+    })
+        .without('strategy', 'strategies')
+        .without('access', ['scope', 'entity'])
+]);
+
+
+internals.event = Validate.object({
+    method: Validate.array().items(Validate.function()).single(),
+    options: Validate.object({
+        before: Validate.array().items(Validate.string()).single(),
+        after: Validate.array().items(Validate.string()).single(),
+        bind: Validate.any(),
+        sandbox: Validate.valid('server', 'plugin'),
+        timeout: Validate.number().integer().min(1)
+    })
+        .default({})
+});
+
+
+internals.exts = Validate.array()
+    .items(internals.event.keys({ type: Validate.string().required() })).single();
+
+
+internals.failAction = Validate.alternatives([
+    Validate.valid('error', 'log', 'ignore'),
+    Validate.function()
+])
+    .default('error');
+
+
+internals.routeBase = Validate.object({
+    app: Validate.object().allow(null),
+    auth: internals.auth.allow(false),
+    bind: Validate.object().allow(null),
+    cache: Validate.object({
+        expiresIn: Validate.number(),
+        expiresAt: Validate.string(),
+        privacy: Validate.valid('default', 'public', 'private'),
+        statuses: Validate.array().items(Validate.number().integer().min(200)).min(1).single().default([200, 204]),
+        otherwise: Validate.string().default('no-cache')
+    })
+        .allow(false)
+        .default(),
+    compression: Validate.object()
+        .pattern(/.+/, Validate.object())
+        .default(),
+    cors: Validate.object({
+        origin: Validate.array().min(1).allow('ignore').default(['*']),
+        maxAge: Validate.number().default(86400),
+        headers: Validate.array().items(Validate.string()).default(['Accept', 'Authorization', 'Content-Type', 'If-None-Match']),
+        additionalHeaders: Validate.array().items(Validate.string()).default([]),
+        exposedHeaders: Validate.array().items(Validate.string()).default(['WWW-Authenticate', 'Server-Authorization']),
+        additionalExposedHeaders: Validate.array().items(Validate.string()).default([]),
+        credentials: Validate.boolean().when('origin', { is: 'ignore', then: false }).default(false),
+        preflightStatusCode: Validate.valid(200, 204).default(200)
+    })
+        .allow(false, true)
+        .default(false),
+    ext: Validate.object({
+        onPreAuth: Validate.array().items(internals.event).single(),
+        onCredentials: Validate.array().items(internals.event).single(),
+        onPostAuth: Validate.array().items(internals.event).single(),
+        onPreHandler: Validate.array().items(internals.event).single(),
+        onPostHandler: Validate.array().items(internals.event).single(),
+        onPreResponse: Validate.array().items(internals.event).single(),
+        onPostResponse: Validate.array().items(internals.event).single()
+    })
+        .default({}),
+    files: Validate.object({
+        relativeTo: Validate.string().pattern(/^([\/\.])|([A-Za-z]:\\)|(\\\\)/).default('.')
+    })
+        .default(),
+    json: Validate.object({
+        replacer: Validate.alternatives(Validate.function(), Validate.array()).allow(null).default(null),
+        space: Validate.number().allow(null).default(null),
+        suffix: Validate.string().allow(null).default(null),
+        escape: Validate.boolean().default(false)
+    })
+        .default(),
+    log: Validate.object({
+        collect: Validate.boolean().default(false)
+    })
+        .default(),
+    payload: Validate.object({
+        output: Validate.valid('data', 'stream', 'file').default('data'),
+        parse: Validate.boolean().allow('gunzip').default(true),
+        multipart: Validate.object({
+            output: Validate.valid('data', 'stream', 'file', 'annotated').required()
+        })
+            .default(false)
+            .allow(true, false),
+        allow: Validate.array().items(Validate.string()).single(),
+        override: Validate.string(),
+        protoAction: Validate.valid('error', 'remove', 'ignore').default('error'),
+        maxBytes: Validate.number().integer().positive().default(1024 * 1024),
+        maxParts: Validate.number().integer().positive().default(1000),
+        uploads: Validate.string().default(Os.tmpdir()),
+        failAction: internals.failAction,
+        timeout: Validate.number().integer().positive().allow(false).default(10 * 1000),
+        defaultContentType: Validate.string().default('application/json'),
+        compression: Validate.object()
+            .pattern(/.+/, Validate.object())
+            .default()
+    })
+        .default(),
+    plugins: Validate.object(),
+    response: Validate.object({
+        disconnectStatusCode: Validate.number().integer().min(400).default(499),
+        emptyStatusCode: Validate.valid(200, 204).default(204),
+        failAction: internals.failAction,
+        modify: Validate.boolean(),
+        options: Validate.object(),
+        ranges: Validate.boolean().default(true),
+        sample: Validate.number().min(0).max(100).when('modify', { then: Validate.forbidden() }),
+        schema: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(true, false),
+        status: Validate.object().pattern(/\d\d\d/, Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(true, false))
+    })
+        .default(),
+    security: Validate.object({
+        hsts: Validate.alternatives([
+            Validate.object({
+                maxAge: Validate.number(),
+                includeSubdomains: Validate.boolean(),
+                includeSubDomains: Validate.boolean(),
+                preload: Validate.boolean()
+            }),
+            Validate.boolean(),
+            Validate.number()
+        ])
+            .default(15768000),
+        xframe: Validate.alternatives([
+            Validate.boolean(),
+            Validate.valid('sameorigin', 'deny'),
+            Validate.object({
+                rule: Validate.valid('sameorigin', 'deny', 'allow-from'),
+                source: Validate.string()
+            })
+        ])
+            .default('deny'),
+        xss: Validate.valid('enabled', 'disabled', false).default('disabled'),
+        noOpen: Validate.boolean().default(true),
+        noSniff: Validate.boolean().default(true),
+        referrer: Validate.alternatives([
+            Validate.boolean().valid(false),
+            Validate.valid('', 'no-referrer', 'no-referrer-when-downgrade',
+                'unsafe-url', 'same-origin', 'origin', 'strict-origin',
+                'origin-when-cross-origin', 'strict-origin-when-cross-origin')
+        ])
+            .default(false)
+    })
+        .allow(null, false, true)
+        .default(false),
+    state: Validate.object({
+        parse: Validate.boolean().default(true),
+        failAction: internals.failAction
+    })
+        .default(),
+    timeout: Validate.object({
+        socket: Validate.number().integer().positive().allow(false),
+        server: Validate.number().integer().positive().allow(false).default(false)
+    })
+        .default(),
+    validate: Validate.object({
+        headers: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(null, true),
+        params: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(null, true),
+        query: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(null, false, true),
+        payload: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(null, false, true),
+        state: Validate.alternatives(Validate.object(), Validate.array(), Validate.function()).allow(null, false, true),
+        failAction: internals.failAction,
+        errorFields: Validate.object(),
+        options: Validate.object().default(),
+        validator: Validate.object()
+    })
+        .default()
+});
+
+
+internals.server = Validate.object({
+    address: Validate.string().hostname(),
+    app: Validate.object().allow(null),
+    autoListen: Validate.boolean(),
+    cache: Validate.allow(null),                                 // Validated elsewhere
+    compression: Validate.object({
+        minBytes: Validate.number().min(1).integer().default(1024)
+    })
+        .allow(false)
+        .default(),
+    debug: Validate.object({
+        request: Validate.array().items(Validate.string()).single().allow(false).default(['implementation']),
+        log: Validate.array().items(Validate.string()).single().allow(false)
+    })
+        .allow(false)
+        .default(),
+    host: Validate.string().hostname().allow(null),
+    info: Validate.object({
+        remote: Validate.boolean().default(false)
+    })
+        .default({}),
+    listener: Validate.any(),
+    load: Validate.object({
+        sampleInterval: Validate.number().integer().min(0).default(0)
+    })
+        .unknown()
+        .default(),
+    mime: Validate.object().empty(null).default(),
+    operations: Validate.object({
+        cleanStop: Validate.boolean().default(true)
+    })
+        .default(),
+    plugins: Validate.object(),
+    port: Validate.alternatives([
+        Validate.number().integer().min(0),          // TCP port
+        Validate.string().pattern(/\//),               // Unix domain socket
+        Validate.string().pattern(/^\\\\\.\\pipe\\/)   // Windows named pipe
+    ])
+        .allow(null),
+    query: Validate.object({
+        parser: Validate.function()
+    })
+        .default(),
+    router: Validate.object({
+        isCaseSensitive: Validate.boolean().default(true),
+        stripTrailingSlash: Validate.boolean().default(false)
+    })
+        .default(),
+    routes: internals.routeBase.default(),
+    state: Validate.object(),                                    // Cookie defaults
+    tls: Validate.alternatives([
+        Validate.object().allow(null),
+        Validate.boolean()
+    ]),
+    uri: Validate.string().pattern(/[^/]$/)
+});
+
+
+internals.vhost = Validate.alternatives([
+    Validate.string().hostname(),
+    Validate.array().items(Validate.string().hostname()).min(1)
+]);
+
+
+internals.handler = Validate.alternatives([
+    Validate.function(),
+    Validate.object().length(1)
+]);
+
+
+internals.route = Validate.object({
+    method: Validate.string().pattern(/^[a-zA-Z0-9!#\$%&'\*\+\-\.^_`\|~]+$/).required(),
+    path: Validate.string().required(),
+    rules: Validate.object(),
+    vhost: internals.vhost,
+
+    // Validated in route construction
+
+    handler: Validate.any(),
+    options: Validate.any(),
+    config: Validate.any()               // Backwards compatibility
+})
+    .without('config', 'options');
+
+
+internals.pre = [
+    Validate.function(),
+    Validate.object({
+        method: Validate.alternatives(Validate.string(), Validate.function()).required(),
+        assign: Validate.string(),
+        mode: Validate.valid('serial', 'parallel'),
+        failAction: internals.failAction
+    })
+];
+
+
+internals.routeConfig = internals.routeBase.keys({
+    description: Validate.string(),
+    id: Validate.string(),
+    isInternal: Validate.boolean(),
+    notes: [
+        Validate.string(),
+        Validate.array().items(Validate.string())
+    ],
+    pre: Validate.array().items(...internals.pre.concat(Validate.array().items(...internals.pre).min(1))),
+    tags: [
+        Validate.string(),
+        Validate.array().items(Validate.string())
+    ]
+});
+
+
+internals.cacheConfig = Validate.alternatives([
+    Validate.function(),
+    Validate.object({
+        name: Validate.string().invalid('_default'),
+        shared: Validate.boolean(),
+        provider: [
+            Validate.function(),
+            {
+                constructor: Validate.function().required(),
+                options: Validate.object({
+                    partition: Validate.string().default('hapi-cache')
+                })
+                    .unknown()      // Catbox client validates other keys
+                    .default({})
+            }
+        ],
+        engine: Validate.object()
+    })
+        .xor('provider', 'engine')
+]);
+
+
+internals.cache = Validate.array().items(internals.cacheConfig).min(1).single();
+
+
+internals.cachePolicy = Validate.object({
+    cache: Validate.string().allow(null).allow(''),
+    segment: Validate.string(),
+    shared: Validate.boolean()
+})
+    .unknown();                     // Catbox policy validates other keys
+
+
+internals.method = Validate.object({
+    bind: Validate.object().allow(null),
+    generateKey: Validate.function(),
+    cache: internals.cachePolicy
+});
+
+
+internals.methodObject = Validate.object({
+    name: Validate.string().required(),
+    method: Validate.function().required(),
+    options: Validate.object()
+});
+
+
+internals.register = Validate.object({
+    once: true,
+    routes: Validate.object({
+        prefix: Validate.string().pattern(/^\/.+/),
+        vhost: internals.vhost
+    })
+        .default({})
+});
+
+
+internals.semver = Validate.string();
+
+
+internals.plugin = internals.register.keys({
+    options: Validate.any(),
+    plugin: Validate.object({
+        register: Validate.function().required(),
+        name: Validate.string().when('pkg.name', { is: Validate.exist(), otherwise: Validate.required() }),
+        version: Validate.string(),
+        multiple: Validate.boolean().default(false),
+        dependencies: [
+            Validate.array().items(Validate.string()).single(),
+            Validate.object().pattern(/.+/, internals.semver)
+        ],
+        once: true,
+        requirements: Validate.object({
+            hapi: Validate.string(),
+            node: Validate.string()
+        })
+            .default(),
+        pkg: Validate.object({
+            name: Validate.string(),
+            version: Validate.string().default('0.0.0')
+        })
+            .unknown()
+            .default({})
+    })
+        .unknown()
+})
+    .without('once', 'options')
+    .unknown();
+
+
+internals.rules = Validate.object({
+    validate: Validate.object({
+        schema: Validate.alternatives(Validate.object(), Validate.array()).required(),
+        options: Validate.object()
+            .default({ allowUnknown: true })
+    })
+});
diff --git a/node_modules/@hapi/hapi/lib/core.js b/node_modules/@hapi/hapi/lib/core.js
new file mode 100755
index 0000000..202f6db
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/core.js
@@ -0,0 +1,718 @@
+'use strict';
+
+const Http = require('http');
+const Https = require('https');
+const Os = require('os');
+const Path = require('path');
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Call = require('@hapi/call');
+const Catbox = require('@hapi/catbox');
+const { Engine: CatboxMemory } = require('@hapi/catbox-memory');
+const { Heavy } = require('@hapi/heavy');
+const Hoek = require('@hapi/hoek');
+const { Mimos } = require('@hapi/mimos');
+const Podium = require('@hapi/podium');
+const Statehood = require('@hapi/statehood');
+
+const Auth = require('./auth');
+const Compression = require('./compression');
+const Config = require('./config');
+const Cors = require('./cors');
+const Ext = require('./ext');
+const Methods = require('./methods');
+const Request = require('./request');
+const Response = require('./response');
+const Route = require('./route');
+const Toolkit = require('./toolkit');
+const Validation = require('./validation');
+
+
+const internals = {
+    counter: {
+        min: 10000,
+        max: 99999
+    },
+    events: [
+        { name: 'cachePolicy', spread: true },
+        { name: 'log', channels: ['app', 'internal'], tags: true },
+        { name: 'request', channels: ['app', 'internal', 'error'], tags: true, spread: true },
+        'response',
+        'route',
+        'start',
+        'closing',
+        'stop'
+    ],
+    badRequestResponse: Buffer.from('HTTP/1.1 400 Bad Request\r\n\r\n', 'ascii')
+};
+
+
+exports = module.exports = internals.Core = class {
+
+    actives = new WeakMap();                                                   // Active requests being processed
+    app = {};
+    auth = new Auth(this);
+    caches = new Map();                                                        // Cache clients
+    compression = new Compression();
+    controlled = null;                                                         // Other servers linked to the phases of this server
+    dependencies = [];                                                         // Plugin dependencies
+    events = new Podium.Podium(internals.events);
+    heavy = null;
+    info = null;
+    instances = new Set();
+    listener = null;
+    methods = new Methods(this);                                               // Server methods
+    mime = null;
+    onConnection = null;                                                       // Used to remove event listener on stop
+    phase = 'stopped';                                                         // 'stopped', 'initializing', 'initialized', 'starting', 'started', 'stopping', 'invalid'
+    plugins = {};                                                              // Exposed plugin properties by name
+    registrations = {};                                                        // Tracks plugin for dependency validation { name -> { version } }
+    registring = 0;                                                            // > 0 while register() is waiting for plugin callbacks
+    Request = class extends Request { };
+    Response = class extends Response { };
+    requestCounter = { value: internals.counter.min, min: internals.counter.min, max: internals.counter.max };
+    root = null;
+    router = null;
+    settings = null;
+    sockets = null;                                                            // Track open sockets for graceful shutdown
+    started = false;
+    states = null;
+    toolkit = new Toolkit.Manager();
+    type = null;
+    validator = null;
+
+    extensionsSeq = 0;                                                         // Used to keep absolute order of extensions based on the order added across locations
+    extensions = {
+        server: {
+            onPreStart: new Ext('onPreStart', this),
+            onPostStart: new Ext('onPostStart', this),
+            onPreStop: new Ext('onPreStop', this),
+            onPostStop: new Ext('onPostStop', this)
+        },
+        route: {
+            onRequest: new Ext('onRequest', this),
+            onPreAuth: new Ext('onPreAuth', this),
+            onCredentials: new Ext('onCredentials', this),
+            onPostAuth: new Ext('onPostAuth', this),
+            onPreHandler: new Ext('onPreHandler', this),
+            onPostHandler: new Ext('onPostHandler', this),
+            onPreResponse: new Ext('onPreResponse', this),
+            onPostResponse: new Ext('onPostResponse', this)
+        }
+    };
+
+    decorations = {
+        handler: new Map(),
+        request: new Map(),
+        response: new Map(),
+        server: new Map(),
+        toolkit: new Map(),
+        requestApply: null,
+        public: { handler: [], request: [], response: [], server: [], toolkit: [] }
+    };
+
+    constructor(options) {
+
+        const { settings, type } = internals.setup(options);
+
+        this.settings = settings;
+        this.type = type;
+
+        this.heavy = new Heavy(this.settings.load);
+        this.mime = new Mimos(this.settings.mime);
+        this.router = new Call.Router(this.settings.router);
+        this.states = new Statehood.Definitions(this.settings.state);
+
+        this._debug();
+        this._initializeCache();
+
+        if (this.settings.routes.validate.validator) {
+            this.validator = Validation.validator(this.settings.routes.validate.validator);
+        }
+
+        this.listener = this._createListener();
+        this._initializeListener();
+        this.info = this._info();
+    }
+
+    _debug() {
+
+        const debug = this.settings.debug;
+        if (!debug) {
+            return;
+        }
+
+        // Subscribe to server log events
+
+        const method = (event) => {
+
+            const data = event.error ?? event.data;
+            console.error('Debug:', event.tags.join(', '), data ? '\n    ' + (data.stack ?? (typeof data === 'object' ? Hoek.stringify(data) : data)) : '');
+        };
+
+        if (debug.log) {
+            const filter = debug.log.some((tag) => tag === '*') ? undefined : debug.log;
+            this.events.on({ name: 'log', filter }, method);
+        }
+
+        if (debug.request) {
+            const filter = debug.request.some((tag) => tag === '*') ? undefined : debug.request;
+            this.events.on({ name: 'request', filter }, (request, event) => method(event));
+        }
+    }
+
+    _initializeCache() {
+
+        if (this.settings.cache) {
+            this._createCache(this.settings.cache);
+        }
+
+        if (!this.caches.has('_default')) {
+            this._createCache([{ provider: CatboxMemory }]);        // Defaults to memory-based
+        }
+    }
+
+    _info() {
+
+        const now = Date.now();
+        const protocol = this.type === 'tcp' ? (this.settings.tls ? 'https' : 'http') : this.type;
+        const host = this.settings.host || Os.hostname() || 'localhost';
+        const port = this.settings.port;
+
+        const info = {
+            created: now,
+            started: 0,
+            host,
+            port,
+            protocol,
+            id: Os.hostname() + ':' + process.pid + ':' + now.toString(36),
+            uri: this.settings.uri ?? (protocol + ':' + (this.type === 'tcp' ? '//' + host + (port ? ':' + port : '') : port))
+        };
+
+        return info;
+    }
+
+    _counter() {
+
+        const next = ++this.requestCounter.value;
+
+        if (this.requestCounter.value > this.requestCounter.max) {
+            this.requestCounter.value = this.requestCounter.min;
+        }
+
+        return next - 1;
+    }
+
+    _createCache(configs) {
+
+        Hoek.assert(this.phase !== 'initializing', 'Cannot provision server cache while server is initializing');
+
+        configs = Config.apply('cache', configs);
+
+        const added = [];
+        for (let config of configs) {
+
+            // <function>
+            // { provider: <function> }
+            // { provider: { constructor: <function>, options } }
+            // { engine }
+
+            if (typeof config === 'function') {
+                config = { provider: { constructor: config } };
+            }
+
+            const name = config.name ?? '_default';
+            Hoek.assert(!this.caches.has(name), 'Cannot configure the same cache more than once: ', name === '_default' ? 'default cache' : name);
+
+            let client = null;
+
+            if (config.provider) {
+                let provider = config.provider;
+                if (typeof provider === 'function') {
+                    provider = { constructor: provider };
+                }
+
+                client = new Catbox.Client(provider.constructor, provider.options ?? { partition: 'hapi-cache' });
+            }
+            else {
+                client = new Catbox.Client(config.engine);
+            }
+
+            this.caches.set(name, { client, segments: {}, shared: config.shared ?? false });
+            added.push(client);
+        }
+
+        return added;
+    }
+
+    registerServer(server) {
+
+        if (!this.root) {
+            this.root = server;
+            this._defaultRoutes();
+        }
+
+        this.instances.add(server);
+    }
+
+    async _start() {
+
+        if (this.phase === 'initialized' ||
+            this.phase === 'started') {
+
+            this._validateDeps();
+        }
+
+        if (this.phase === 'started') {
+            return;
+        }
+
+        if (this.phase !== 'stopped' &&
+            this.phase !== 'initialized') {
+
+            throw new Error('Cannot start server while it is in ' + this.phase + ' phase');
+        }
+
+        if (this.phase !== 'initialized') {
+            await this._initialize();
+        }
+
+        this.phase = 'starting';
+        this.started = true;
+        this.info.started = Date.now();
+
+        try {
+            await this._listen();
+        }
+        catch (err) {
+            this.started = false;
+            this.phase = 'invalid';
+            throw err;
+        }
+
+        this.phase = 'started';
+        this.events.emit('start');
+
+        try {
+            if (this.controlled) {
+                await Promise.all(this.controlled.map((control) => control.start()));
+            }
+
+            await this._invoke('onPostStart');
+        }
+        catch (err) {
+            this.phase = 'invalid';
+            throw err;
+        }
+    }
+
+    _listen() {
+
+        return new Promise((resolve, reject) => {
+
+            if (!this.settings.autoListen) {
+                resolve();
+                return;
+            }
+
+            const onError = (err) => {
+
+                reject(err);
+                return;
+            };
+
+            this.listener.once('error', onError);
+
+            const finalize = () => {
+
+                this.listener.removeListener('error', onError);
+                resolve();
+                return;
+            };
+
+            if (this.type !== 'tcp') {
+                this.listener.listen(this.settings.port, finalize);
+            }
+            else {
+                // Default is the unspecified address, :: if IPv6 is available or otherwise the IPv4 address 0.0.0.0
+                const address = this.settings.address || this.settings.host || null;
+                this.listener.listen(this.settings.port, address, finalize);
+            }
+        });
+    }
+
+    async _initialize() {
+
+        if (this.registring) {
+            throw new Error('Cannot start server before plugins finished registration');
+        }
+
+        if (this.phase === 'initialized') {
+            return;
+        }
+
+        if (this.phase !== 'stopped') {
+            throw new Error('Cannot initialize server while it is in ' + this.phase + ' phase');
+        }
+
+        this._validateDeps();
+        this.phase = 'initializing';
+
+        // Start cache
+
+        try {
+            const caches = [];
+            this.caches.forEach((cache) => caches.push(cache.client.start()));
+            await Promise.all(caches);
+            await this._invoke('onPreStart');
+            this.heavy.start();
+            this.phase = 'initialized';
+
+            if (this.controlled) {
+                await Promise.all(this.controlled.map((control) => control.initialize()));
+            }
+        }
+        catch (err) {
+            this.phase = 'invalid';
+            throw err;
+        }
+    }
+
+    _validateDeps() {
+
+        for (const { deps, plugin } of this.dependencies) {
+            for (const dep in deps) {
+                const version = deps[dep];
+                Hoek.assert(this.registrations[dep], 'Plugin', plugin, 'missing dependency', dep);
+                Hoek.assert(version === '*' || Config.versionMatch(this.registrations[dep].version, version), 'Plugin', plugin, 'requires', dep, 'version', version, 'but found', this.registrations[dep].version);
+            }
+        }
+    }
+
+    async _stop(options = {}) {
+
+        options.timeout = options.timeout ?? 5000;          // Default timeout to 5 seconds
+
+        if (['stopped', 'initialized', 'started', 'invalid'].indexOf(this.phase) === -1) {
+            throw new Error('Cannot stop server while in ' + this.phase + ' phase');
+        }
+
+        this.phase = 'stopping';
+
+        try {
+            await this._invoke('onPreStop');
+
+            if (this.started) {
+                this.started = false;
+                this.info.started = 0;
+
+                await this._unlisten(options.timeout);
+            }
+
+            const caches = [];
+            this.caches.forEach((cache) => caches.push(cache.client.stop()));
+            await Promise.all(caches);
+
+            this.events.emit('stop');
+            this.heavy.stop();
+
+            if (this.controlled) {
+                await Promise.all(this.controlled.map((control) => control.stop(options)));
+            }
+
+            await this._invoke('onPostStop');
+            this.phase = 'stopped';
+        }
+        catch (err) {
+            this.phase = 'invalid';
+            throw err;
+        }
+    }
+
+    _unlisten(timeout) {
+
+        let timeoutId = null;
+        if (this.settings.operations.cleanStop) {
+
+            // Set connections timeout
+
+            const destroy = () => {
+
+                for (const connection of this.sockets) {
+                    connection.destroy();
+                }
+
+                this.sockets.clear();
+            };
+
+            timeoutId = setTimeout(destroy, timeout);
+
+            // Tell idle keep-alive connections to close
+
+            for (const connection of this.sockets) {
+                if (!this.actives.has(connection)) {
+                    connection.end();
+                }
+            }
+        }
+
+        // Close connection
+
+        return new Promise((resolve) => {
+
+            this.listener.close(() => {
+
+                if (this.settings.operations.cleanStop) {
+                    this.listener.removeListener(this.settings.tls ? 'secureConnection' : 'connection', this.onConnection);
+                    clearTimeout(timeoutId);
+                }
+
+                this._initializeListener();
+                resolve();
+            });
+
+            this.events.emit('closing');
+        });
+    }
+
+    async _invoke(type) {
+
+        const exts = this.extensions.server[type];
+        if (!exts.nodes) {
+            return;
+        }
+
+        // Execute extensions
+
+        for (const ext of exts.nodes) {
+            const bind = ext.bind ?? ext.realm.settings.bind;
+            const operation = ext.func.call(bind, ext.server, bind);
+            await Toolkit.timed(operation, { timeout: ext.timeout, name: type });
+        }
+    }
+
+    _defaultRoutes() {
+
+        this.router.special('notFound', new Route({ method: '_special', path: '/{p*}', handler: internals.notFound }, this.root, { special: true }));
+        this.router.special('badRequest', new Route({ method: '_special', path: '/{p*}', handler: internals.badRequest }, this.root, { special: true }));
+
+        if (this.settings.routes.cors) {
+            Cors.handler(this.root);
+        }
+    }
+
+    _dispatch(options = {}) {
+
+        return (req, res) => {
+
+            // Create request
+
+            const request = Request.generate(this.root, req, res, options);
+
+            // Track socket request processing state
+
+            if (this.settings.operations.cleanStop &&
+                req.socket) {
+
+                this.actives.set(req.socket, request);
+                const env = { core: this, req };
+                res.on('finish', internals.onFinish.bind(res, env));
+            }
+
+            // Check load
+
+            if (this.settings.load.sampleInterval) {
+                try {
+                    this.heavy.check();
+                }
+                catch (err) {
+                    Bounce.rethrow(err, 'system');
+                    this._log(['load'], this.heavy.load);
+                    request._reply(err);
+                    return;
+                }
+            }
+
+            request._execute();
+        };
+    }
+
+    _createListener() {
+
+        const listener = this.settings.listener ?? (this.settings.tls ? Https.createServer(this.settings.tls) : Http.createServer());
+        listener.on('request', this._dispatch());
+        listener.on('checkContinue', this._dispatch({ expectContinue: true }));
+
+        listener.on('clientError', (err, socket) => {
+
+            this._log(['connection', 'client', 'error'], err);
+
+            if (socket.readable) {
+                const request = this.settings.operations.cleanStop && this.actives.get(socket);
+                if (request) {
+
+                    // If a request is available, it means that the connection and parsing has progressed far enough to have created the request.
+
+                    if (err.code === 'HPE_INVALID_METHOD') {
+
+                        // This parser error is for a pipelined request. Schedule destroy once current request is done.
+
+                        request.raw.res.once('close', () => {
+
+                            if (socket.readable) {
+                                socket.end(internals.badRequestResponse);
+                            }
+                            else {
+                                socket.destroy(err);
+                            }
+                        });
+                        return;
+                    }
+
+                    const error = Boom.badRequest();
+                    error.output.headers = { connection: 'close' };
+                    request._reply(error);
+                }
+                else {
+                    socket.end(internals.badRequestResponse);
+                }
+            }
+            else {
+                socket.destroy(err);
+            }
+        });
+
+        return listener;
+    }
+
+    _initializeListener() {
+
+        this.listener.once('listening', () => {
+
+            // Update the address, port, and uri with active values
+
+            if (this.type === 'tcp') {
+                const address = this.listener.address();
+                this.info.address = address.address;
+                this.info.port = address.port;
+                this.info.uri = this.settings.uri ?? this.info.protocol + '://' + this.info.host + ':' + this.info.port;
+            }
+
+            if (this.settings.operations.cleanStop) {
+                this.sockets = new Set();
+
+                const self = this;
+                const onClose = function () {           // 'this' is bound to the emitter
+
+                    self.sockets.delete(this);
+                };
+
+                this.onConnection = (connection) => {
+
+                    this.sockets.add(connection);
+                    connection.on('close', onClose);
+                };
+
+                this.listener.on(this.settings.tls ? 'secureConnection' : 'connection', this.onConnection);
+            }
+        });
+    }
+
+    _cachePolicy(options, _segment, realm) {
+
+        options = Config.apply('cachePolicy', options);
+
+        const plugin = realm?.plugin;
+        const segment = options.segment ?? _segment ?? (plugin ? `!${plugin}` : '');
+        Hoek.assert(segment, 'Missing cache segment name');
+
+        const cacheName = options.cache ?? '_default';
+        const cache = this.caches.get(cacheName);
+        Hoek.assert(cache, 'Unknown cache', cacheName);
+        Hoek.assert(!cache.segments[segment] || cache.shared || options.shared, 'Cannot provision the same cache segment more than once');
+        cache.segments[segment] = true;
+
+        const policy = new Catbox.Policy(options, cache.client, segment);
+        this.events.emit('cachePolicy', [policy, options.cache, segment]);
+
+        return policy;
+    }
+
+    log(tags, data) {
+
+        return this._log(tags, data, 'app');
+    }
+
+    _log(tags, data, channel = 'internal') {
+
+        if (!this.events.hasListeners('log')) {
+            return;
+        }
+
+        if (!Array.isArray(tags)) {
+            tags = [tags];
+        }
+
+        const timestamp = Date.now();
+        const field = data instanceof Error ? 'error' : 'data';
+
+        let event = { timestamp, tags, [field]: data, channel };
+
+        if (typeof data === 'function') {
+            event = () => ({ timestamp, tags, data: data(), channel });
+        }
+
+        this.events.emit({ name: 'log', tags, channel }, event);
+    }
+};
+
+
+internals.setup = function (options = {}) {
+
+    let settings = Hoek.clone(options, { shallow: ['cache', 'listener', 'routes.bind'] });
+    settings.app = settings.app ?? {};
+    settings.routes = Config.enable(settings.routes);
+    settings = Config.apply('server', settings);
+
+    if (settings.port === undefined) {
+        settings.port = 0;
+    }
+
+    const type = (typeof settings.port === 'string' ? 'socket' : 'tcp');
+    if (type === 'socket') {
+        settings.port = (settings.port.indexOf('/') !== -1 ? Path.resolve(settings.port) : settings.port.toLowerCase());
+    }
+
+    if (settings.autoListen === undefined) {
+        settings.autoListen = true;
+    }
+
+    Hoek.assert(settings.autoListen || !settings.port, 'Cannot specify port when autoListen is false');
+    Hoek.assert(settings.autoListen || !settings.address, 'Cannot specify address when autoListen is false');
+
+    return { settings, type };
+};
+
+
+internals.notFound = function () {
+
+    throw Boom.notFound();
+};
+
+
+internals.badRequest = function () {
+
+    throw Boom.badRequest();
+};
+
+
+internals.onFinish = function (env) {
+
+    const { core, req } = env;
+
+    core.actives.delete(req.socket);
+    if (!core.started) {
+        req.socket.end();
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/cors.js b/node_modules/@hapi/hapi/lib/cors.js
new file mode 100755
index 0000000..6600531
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/cors.js
@@ -0,0 +1,208 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+
+let Route = null;                           // Delayed load due to circular dependency
+
+
+const internals = {};
+
+
+exports.route = function (options) {
+
+    if (!options) {
+        return false;
+    }
+
+    const settings = Hoek.clone(options);
+    settings._headers = settings.headers.concat(settings.additionalHeaders);
+    settings._headersString = settings._headers.join(',');
+    for (let i = 0; i < settings._headers.length; ++i) {
+        settings._headers[i] = settings._headers[i].toLowerCase();
+    }
+
+    if (settings._headers.indexOf('origin') === -1) {
+        settings._headers.push('origin');
+    }
+
+    settings._exposedHeaders = settings.exposedHeaders.concat(settings.additionalExposedHeaders).join(',');
+
+    if (settings.origin === 'ignore') {
+        settings._origin = false;
+    }
+    else if (settings.origin.indexOf('*') !== -1) {
+        Hoek.assert(settings.origin.length === 1, 'Cannot specify cors.origin * together with other values');
+        settings._origin = true;
+    }
+    else {
+        settings._origin = {
+            qualified: [],
+            wildcards: []
+        };
+
+        for (const origin of settings.origin) {
+            if (origin.indexOf('*') !== -1) {
+                settings._origin.wildcards.push(new RegExp('^' + Hoek.escapeRegex(origin).replace(/\\\*/g, '.*').replace(/\\\?/g, '.') + '$'));
+            }
+            else {
+                settings._origin.qualified.push(origin);
+            }
+        }
+    }
+
+    return settings;
+};
+
+
+exports.options = function (route, server) {
+
+    if (route.method === 'options' ||
+        !route.settings.cors) {
+
+        return;
+    }
+
+    exports.handler(server);
+};
+
+
+exports.handler = function (server) {
+
+    Route = Route || require('./route');
+
+    if (server._core.router.specials.options) {
+        return;
+    }
+
+    const definition = {
+        method: '_special',
+        path: '/{p*}',
+        handler: internals.handler,
+        options: {
+            cors: false
+        }
+    };
+
+    const route = new Route(definition, server, { special: true });
+    server._core.router.special('options', route);
+};
+
+
+internals.handler = function (request, h) {
+
+    // Validate CORS preflight request
+
+    const method = request.headers['access-control-request-method'];
+    if (!method) {
+        throw Boom.notFound('CORS error: Missing Access-Control-Request-Method header');
+    }
+
+    // Lookup route
+
+    const route = request.server.match(method, request.path, request.info.hostname);
+    if (!route) {
+        throw Boom.notFound();
+    }
+
+    const settings = route.settings.cors;
+    if (!settings) {
+        return { message: 'CORS is disabled for this route' };
+    }
+
+    // Validate Origin header
+
+    const origin = request.headers.origin;
+
+    if (!origin &&
+        settings._origin !== false) {
+
+        throw Boom.notFound('CORS error: Missing Origin header');
+    }
+
+    if (!exports.matchOrigin(origin, settings)) {
+        return { message: 'CORS error: Origin not allowed' };
+    }
+
+    // Validate allowed headers
+
+    let headers = request.headers['access-control-request-headers'];
+    if (headers) {
+        headers = headers.toLowerCase().split(/\s*,\s*/);
+        if (Hoek.intersect(headers, settings._headers).length !== headers.length) {
+            return { message: 'CORS error: Some headers are not allowed' };
+        }
+    }
+
+    // Reply with the route CORS headers
+
+    const response = h.response();
+    response.code(settings.preflightStatusCode);
+    response._header('access-control-allow-origin', settings._origin ? origin : '*');
+    response._header('access-control-allow-methods', method);
+    response._header('access-control-allow-headers', settings._headersString);
+    response._header('access-control-max-age', settings.maxAge);
+
+    if (settings.credentials) {
+        response._header('access-control-allow-credentials', 'true');
+    }
+
+    if (settings._exposedHeaders) {
+        response._header('access-control-expose-headers', settings._exposedHeaders);
+    }
+
+    return response;
+};
+
+
+exports.headers = function (response) {
+
+    const request = response.request;
+    const settings = request.route.settings.cors;
+
+    if (settings._origin !== false) {
+        response.vary('origin');
+    }
+
+    if ((request.info.cors && !request.info.cors.isOriginMatch) ||                          // After route lookup
+        !exports.matchOrigin(request.headers.origin, request.route.settings.cors)) {        // Response from onRequest
+
+        return;
+    }
+
+    response._header('access-control-allow-origin', settings._origin ? request.headers.origin : '*');
+
+    if (settings.credentials) {
+        response._header('access-control-allow-credentials', 'true');
+    }
+
+    if (settings._exposedHeaders) {
+        response._header('access-control-expose-headers', settings._exposedHeaders, { append: true });
+    }
+};
+
+
+exports.matchOrigin = function (origin, settings) {
+
+    if (settings._origin === true ||
+        settings._origin === false) {
+
+        return true;
+    }
+
+    if (!origin) {
+        return false;
+    }
+
+    if (settings._origin.qualified.indexOf(origin) !== -1) {
+        return true;
+    }
+
+    for (const wildcard of settings._origin.wildcards) {
+        if (origin.match(wildcard)) {
+            return true;
+        }
+    }
+
+    return false;
+};
diff --git a/node_modules/@hapi/hapi/lib/ext.js b/node_modules/@hapi/hapi/lib/ext.js
new file mode 100755
index 0000000..a3caa2f
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/ext.js
@@ -0,0 +1,96 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Topo = require('@hapi/topo');
+
+
+const internals = {};
+
+
+exports = module.exports = internals.Ext = class {
+
+    type = null;
+    nodes = null;
+
+    #core = null;
+    #routes = [];
+    #topo = new Topo.Sorter();
+
+    constructor(type, core) {
+
+        this.#core = core;
+        this.type = type;
+    }
+
+    add(event) {
+
+        const methods = [].concat(event.method);
+        for (const method of methods) {
+            const settings = {
+                before: event.options.before,
+                after: event.options.after,
+                group: event.realm.plugin,
+                sort: this.#core.extensionsSeq++
+            };
+
+            const node = {
+                func: method,                       // Request: function (request, h), Server: function (server)
+                bind: event.options.bind,
+                server: event.server,               // Server event
+                realm: event.realm,
+                timeout: event.options.timeout
+            };
+
+            this.#topo.add(node, settings);
+        }
+
+        this.nodes = this.#topo.nodes;
+
+        // Notify routes
+
+        for (const route of this.#routes) {
+            route.rebuild(event);
+        }
+    }
+
+    merge(others) {
+
+        const merge = [];
+        for (const other of others) {
+            merge.push(other.#topo);
+        }
+
+        this.#topo.merge(merge);
+        this.nodes = this.#topo.nodes.length ? this.#topo.nodes : null;
+    }
+
+    subscribe(route) {
+
+        this.#routes.push(route);
+    }
+
+    static combine(route, type) {
+
+        const ext = new internals.Ext(type, route._core);
+
+        const events = route.settings.ext[type];
+        if (events) {
+            for (let event of events) {
+                event = Object.assign({}, event);       // Shallow cloned
+                Hoek.assert(!event.options.sandbox, 'Cannot specify sandbox option for route extension');
+                event.realm = route.realm;
+                ext.add(event);
+            }
+        }
+
+        const server = route._core.extensions.route[type];
+        const realm = route.realm._extensions[type];
+
+        ext.merge([server, realm]);
+
+        server.subscribe(route);
+        realm.subscribe(route);
+
+        return ext;
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/handler.js b/node_modules/@hapi/hapi/lib/handler.js
new file mode 100755
index 0000000..9ae2610
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/handler.js
@@ -0,0 +1,165 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports.execute = async function (request) {
+
+    // Prerequisites
+
+    if (request._route._prerequisites) {
+        for (const set of request._route._prerequisites) {      // Serial execution of each set
+            const pres = [];
+            for (const item of set) {
+                pres.push(internals.handler(request, item.method, item));
+            }
+
+            const responses = await Promise.all(pres);                          // Parallel execution within sets
+            for (const response of responses) {
+                if (response !== undefined) {
+                    return response;
+                }
+            }
+        }
+    }
+
+    // Handler
+
+    const result = await internals.handler(request, request.route.settings.handler);
+    if (result._takeover ||
+        typeof result === 'symbol') {
+
+        return result;
+    }
+
+    request._setResponse(result);
+};
+
+
+internals.handler = async function (request, method, pre) {
+
+    const bind = request.route.settings.bind;
+    const realm = request.route.realm;
+    let response = await request._core.toolkit.execute(method, request, { bind, realm, continue: 'null' });
+
+    // Handler
+
+    if (!pre) {
+        if (response.isBoom) {
+            request._log(['handler', 'error'], response);
+            throw response;
+        }
+
+        return response;
+    }
+
+    // Pre
+
+    if (response.isBoom) {
+        response.assign = pre.assign;
+        response = await request._core.toolkit.failAction(request, pre.failAction, response, { tags: ['pre', 'error'], retain: true });
+    }
+
+    if (typeof response === 'symbol') {
+        return response;
+    }
+
+    if (pre.assign) {
+        request.pre[pre.assign] = (response.isBoom ? response : response.source);
+        request.preResponses[pre.assign] = response;
+    }
+
+    if (response._takeover) {
+        return response;
+    }
+};
+
+
+exports.defaults = function (method, handler, core) {
+
+    let defaults = null;
+
+    if (typeof handler === 'object') {
+        const type = Object.keys(handler)[0];
+        const serverHandler = core.decorations.handler.get(type);
+
+        Hoek.assert(serverHandler, 'Unknown handler:', type);
+
+        if (serverHandler.defaults) {
+            defaults = (typeof serverHandler.defaults === 'function' ? serverHandler.defaults(method) : serverHandler.defaults);
+        }
+    }
+
+    return defaults ?? {};
+};
+
+
+exports.configure = function (handler, route) {
+
+    if (typeof handler === 'object') {
+        const type = Object.keys(handler)[0];
+        const serverHandler = route._core.decorations.handler.get(type);
+
+        Hoek.assert(serverHandler, 'Unknown handler:', type);
+
+        return serverHandler(route.public, handler[type]);
+    }
+
+    return handler;
+};
+
+
+exports.prerequisitesConfig = function (config) {
+
+    if (!config) {
+        return null;
+    }
+
+    /*
+        [
+            [
+                function (request, h) { },
+                {
+                    method: function (request, h) { }
+                    assign: key1
+                },
+                {
+                    method: function (request, h) { },
+                    assign: key2
+                }
+            ],
+            {
+                method: function (request, h) { },
+                assign: key3
+            }
+        ]
+    */
+
+    const prerequisites = [];
+
+    for (let pres of config) {
+        pres = [].concat(pres);
+
+        const set = [];
+        for (let pre of pres) {
+            if (typeof pre !== 'object') {
+                pre = { method: pre };
+            }
+
+            const item = {
+                method: pre.method,
+                assign: pre.assign,
+                failAction: pre.failAction ?? 'error'
+            };
+
+            set.push(item);
+        }
+
+        prerequisites.push(set);
+    }
+
+    return prerequisites.length ? prerequisites : null;
+};
diff --git a/node_modules/@hapi/hapi/lib/headers.js b/node_modules/@hapi/hapi/lib/headers.js
new file mode 100755
index 0000000..69a528e
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/headers.js
@@ -0,0 +1,177 @@
+'use strict';
+
+
+const Stream = require('stream');
+
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+exports.cache = function (response) {
+
+    const request = response.request;
+    if (response.headers['cache-control']) {
+        return;
+    }
+
+    const settings = request.route.settings.cache;
+    const policy = settings && request._route._cache && (settings._statuses.has(response.statusCode) || (response.statusCode === 304 && settings._statuses.has(200)));
+
+    if (policy ||
+        response.settings.ttl) {
+
+        const ttl = response.settings.ttl !== null ? response.settings.ttl : request._route._cache.ttl();
+        const privacy = request.auth.isAuthenticated || response.headers['set-cookie'] ? 'private' : settings.privacy ?? 'default';
+        response._header('cache-control', 'max-age=' + Math.floor(ttl / 1000) + ', must-revalidate' + (privacy !== 'default' ? ', ' + privacy : ''));
+    }
+    else if (settings) {
+        response._header('cache-control', settings.otherwise);
+    }
+};
+
+
+exports.content = async function (response) {
+
+    const request = response.request;
+    if (response._isPayloadSupported() ||
+        request.method === 'head') {
+
+        await response._marshal();
+
+        if (typeof response._payload.size === 'function') {
+            response._header('content-length', response._payload.size(), { override: false });
+        }
+
+        if (!response._isPayloadSupported()) {
+            response._close();                              // Close unused file streams
+            response._payload = new internals.Empty();      // Set empty stream
+        }
+
+        exports.type(response);
+    }
+    else {
+
+        // Set empty stream
+
+        response._close();                                  // Close unused file streams
+        response._payload = new internals.Empty();
+        delete response.headers['content-length'];
+    }
+};
+
+
+exports.state = async function (response) {
+
+    const request = response.request;
+    const states = [];
+
+    for (const stateName in request._states) {
+        states.push(request._states[stateName]);
+    }
+
+    try {
+        for (const name in request._core.states.cookies) {
+            const autoValue = request._core.states.cookies[name].autoValue;
+            if (!autoValue || name in request._states || name in request.state) {
+                continue;
+            }
+
+            if (typeof autoValue !== 'function') {
+                states.push({ name, value: autoValue });
+                continue;
+            }
+
+            const value = await autoValue(request);
+            states.push({ name, value });
+        }
+
+        if (!states.length) {
+            return;
+        }
+
+        let header = await request._core.states.format(states, request);
+        const existing = response.headers['set-cookie'];
+        if (existing) {
+            header = (Array.isArray(existing) ? existing : [existing]).concat(header);
+        }
+
+        response._header('set-cookie', header);
+    }
+    catch (err) {
+        const error = Boom.boomify(err);
+        request._log(['state', 'response', 'error'], error);
+        request._states = {};                                           // Clear broken state
+        throw error;
+    }
+};
+
+
+exports.type = function (response) {
+
+    const type = response.contentType;
+    if (type !== null && type !== response.headers['content-type']) {
+        response.type(type);
+    }
+};
+
+
+exports.entity = function (response) {
+
+    const request = response.request;
+
+    if (!request._entity) {
+        return;
+    }
+
+    if (request._entity.etag &&
+        !response.headers.etag) {
+
+        response.etag(request._entity.etag, { vary: request._entity.vary });
+    }
+
+    if (request._entity.modified &&
+        !response.headers['last-modified']) {
+
+        response.header('last-modified', request._entity.modified);
+    }
+};
+
+
+exports.unmodified = function (response) {
+
+    const request = response.request;
+    if (response.statusCode === 304) {
+        return;
+    }
+
+    const entity = {
+        etag: response.headers.etag,
+        vary: response.settings.varyEtag,
+        modified: response.headers['last-modified']
+    };
+
+    const etag = request._core.Response.unmodified(request, entity);
+    if (etag) {
+        response.code(304);
+
+        if (etag !== true) {                                // Override etag with incoming weak match
+            response.headers.etag = etag;
+        }
+    }
+};
+
+
+internals.Empty = class extends Stream.Readable {
+
+    _read(/* size */) {
+
+        this.push(null);
+    }
+
+    writeToStream(stream) {
+
+        stream.end();
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/index.d.ts b/node_modules/@hapi/hapi/lib/index.d.ts
new file mode 100644
index 0000000..fcb073f
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/index.d.ts
@@ -0,0 +1 @@
+export * from './types';
diff --git a/node_modules/@hapi/hapi/lib/index.js b/node_modules/@hapi/hapi/lib/index.js
new file mode 100755
index 0000000..b18c38d
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/index.js
@@ -0,0 +1,11 @@
+'use strict';
+
+const Server = require('./server');
+
+
+const internals = {};
+
+
+exports.Server = Server;
+
+exports.server = Server;
diff --git a/node_modules/@hapi/hapi/lib/methods.js b/node_modules/@hapi/hapi/lib/methods.js
new file mode 100755
index 0000000..858e931
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/methods.js
@@ -0,0 +1,126 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+
+const Config = require('./config');
+
+
+const internals = {
+    methodNameRx: /^[_$a-zA-Z][$\w]*(?:\.[_$a-zA-Z][$\w]*)*$/
+};
+
+
+exports = module.exports = internals.Methods = class {
+
+    methods = {};
+
+    #core = null;
+
+    constructor(core) {
+
+        this.#core = core;
+    }
+
+    add(name, method, options, realm) {
+
+        if (typeof name !== 'object') {
+            return this._add(name, method, options, realm);
+        }
+
+        // {} or [{}, {}]
+
+        const items = [].concat(name);
+        for (let item of items) {
+            item = Config.apply('methodObject', item);
+            this._add(item.name, item.method, item.options ?? {}, realm);
+        }
+    }
+
+    _add(name, method, options, realm) {
+
+        Hoek.assert(typeof method === 'function', 'method must be a function');
+        Hoek.assert(typeof name === 'string', 'name must be a string');
+        Hoek.assert(name.match(internals.methodNameRx), 'Invalid name:', name);
+        Hoek.assert(!Hoek.reach(this.methods, name, { functions: false }), 'Server method function name already exists:', name);
+
+        options = Config.apply('method', options, name);
+
+        const settings = Hoek.clone(options, { shallow: ['bind'] });
+        settings.generateKey = settings.generateKey ?? internals.generateKey;
+
+        const bind = settings.bind ?? realm.settings.bind ?? null;
+        const bound = !bind ? method : (...args) => method.apply(bind, args);
+
+        // Not cached
+
+        if (!settings.cache) {
+            return this._assign(name, bound);
+        }
+
+        // Cached
+
+        Hoek.assert(!settings.cache.generateFunc, 'Cannot set generateFunc with method caching:', name);
+        Hoek.assert(settings.cache.generateTimeout !== undefined, 'Method caching requires a timeout value in generateTimeout:', name);
+
+        settings.cache.generateFunc = (id, flags) => bound(...id.args, flags);
+        const cache = this.#core._cachePolicy(settings.cache, '#' + name);
+
+        const func = function (...args) {
+
+            const key = settings.generateKey.apply(bind, args);
+            if (typeof key !== 'string') {
+                return Promise.reject(Boom.badImplementation('Invalid method key when invoking: ' + name, { name, args }));
+            }
+
+            return cache.get({ id: key, args });
+        };
+
+        func.cache = {
+            drop: function (...args) {
+
+                const key = settings.generateKey.apply(bind, args);
+                if (typeof key !== 'string') {
+                    return Promise.reject(Boom.badImplementation('Invalid method key when invoking: ' + name, { name, args }));
+                }
+
+                return cache.drop(key);
+            },
+            stats: cache.stats
+        };
+
+        this._assign(name, func, func);
+    }
+
+    _assign(name, method) {
+
+        const path = name.split('.');
+        let ref = this.methods;
+        for (let i = 0; i < path.length; ++i) {
+            if (!ref[path[i]]) {
+                ref[path[i]] = (i + 1 === path.length ? method : {});
+            }
+
+            ref = ref[path[i]];
+        }
+    }
+};
+
+
+internals.supportedArgs = ['string', 'number', 'boolean'];
+
+
+internals.generateKey = function (...args) {
+
+    let key = '';
+    for (let i = 0; i < args.length; ++i) {
+        const arg = args[i];
+        if (!internals.supportedArgs.includes(typeof arg)) {
+            return null;
+        }
+
+        key = key + (i ? ':' : '') + encodeURIComponent(arg.toString());
+    }
+
+    return key;
+};
diff --git a/node_modules/@hapi/hapi/lib/request.js b/node_modules/@hapi/hapi/lib/request.js
new file mode 100755
index 0000000..2c40cdc
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/request.js
@@ -0,0 +1,768 @@
+'use strict';
+
+const Querystring = require('querystring');
+const Url = require('url');
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+const Podium = require('@hapi/podium');
+
+const Cors = require('./cors');
+const Toolkit = require('./toolkit');
+const Transmit = require('./transmit');
+
+
+const internals = {
+    events: Podium.validate(['finish', { name: 'peek', spread: true }, 'disconnect']),
+    reserved: ['server', 'url', 'query', 'path', 'method', 'mime', 'setUrl', 'setMethod', 'headers', 'id', 'app', 'plugins', 'route', 'auth', 'pre', 'preResponses', 'info', 'isInjected', 'orig', 'params', 'paramsArray', 'payload', 'state', 'response', 'raw', 'domain', 'log', 'logs', 'generateResponse']
+};
+
+
+exports = module.exports = internals.Request = class {
+
+    constructor(server, req, res, options) {
+
+        this._allowInternals = !!options.allowInternals;
+        this._closed = false;                                                                               // true once the response has closed (esp. early) and will not emit any more events
+        this._core = server._core;
+        this._entity = null;                                                                                // Entity information set via h.entity()
+        this._eventContext = { request: this };
+        this._events = null;                                                                                // Assigned an emitter when request.events is accessed
+        this._expectContinue = !!options.expectContinue;
+        this._isInjected = !!options.isInjected;
+        this._isPayloadPending = !!(req.headers['content-length'] || req.headers['transfer-encoding']);     // Changes to false when incoming payload fully processed
+        this._isReplied = false;                                                                            // true when response processing started
+        this._route = this._core.router.specials.notFound.route;                                            // Used prior to routing (only settings are used, not the handler)
+        this._serverTimeoutId = null;
+        this._states = {};
+        this._url = null;
+        this._urlError = null;
+
+        this.app = options.app ? Object.assign({}, options.app) : {};                                       // Place for application-specific state without conflicts with hapi, should not be used by plugins (shallow cloned)
+        this.headers = req.headers;
+        this.logs = [];
+        this.method = req.method.toLowerCase();
+        this.mime = null;
+        this.orig = {};
+        this.params = null;
+        this.paramsArray = null;                                                                            // Array of path parameters in path order
+        this.path = null;
+        this.payload = undefined;
+        this.plugins = options.plugins ? Object.assign({}, options.plugins) : {};                           // Place for plugins to store state without conflicts with hapi, should be namespaced using plugin name (shallow cloned)
+        this.pre = {};                                                                                      // Pre raw values
+        this.preResponses = {};                                                                             // Pre response values
+        this.raw = { req, res };
+        this.response = null;
+        this.route = this._route.public;
+        this.query = null;
+        this.server = server;
+        this.state = null;
+
+        this.info = new internals.Info(this);
+
+        this.auth = {
+            isAuthenticated: false,
+            isAuthorized: false,
+            isInjected: options.auth ? true : false,
+            [internals.Request.symbols.authPayload]: options.auth?.payload ?? true,
+            credentials: options.auth?.credentials ?? null,                                    // Special keys: 'app', 'user', 'scope'
+            artifacts: options.auth?.artifacts ?? null,                                      // Scheme-specific artifacts
+            strategy: options.auth?.strategy ?? null,
+            mode: null,
+            error: null
+        };
+
+        // Parse request url
+
+        this._initializeUrl();
+    }
+
+    static generate(server, req, res, options) {
+
+        const request = new server._core.Request(server, req, res, options);
+
+        // Decorate
+
+        if (server._core.decorations.requestApply) {
+            for (const [property, assignment] of server._core.decorations.requestApply.entries()) {
+                request[property] = assignment(request);
+            }
+        }
+
+        request._listen();
+        return request;
+    }
+
+    get events() {
+
+        if (!this._events) {
+            this._events = new Podium.Podium(internals.events);
+        }
+
+        return this._events;
+    }
+
+    get isInjected() {
+
+        return this._isInjected;
+    }
+
+    get url() {
+
+        if (this._urlError) {
+            return null;
+        }
+
+        if (this._url) {
+            return this._url;
+        }
+
+        return this._parseUrl(this.raw.req.url, this._core.settings.router);
+    }
+
+    _initializeUrl() {
+
+        try {
+            this._setUrl(this.raw.req.url, this._core.settings.router.stripTrailingSlash, { fast: true });
+        }
+        catch (err) {
+            this.path = this.raw.req.url;
+            this.query = {};
+
+            this._urlError = Boom.boomify(err, { statusCode: 400, override: false });
+        }
+    }
+
+    setUrl(url, stripTrailingSlash) {
+
+        Hoek.assert(this.params === null, 'Cannot change request URL after routing');
+
+        if (url instanceof Url.URL) {
+            url = url.href;
+        }
+
+        Hoek.assert(typeof url === 'string', 'Url must be a string or URL object');
+
+        this._setUrl(url, stripTrailingSlash, { fast: false });
+    }
+
+    _setUrl(source, stripTrailingSlash, { fast }) {
+
+        const url = this._parseUrl(source, { stripTrailingSlash, _fast: fast });
+        this.query = this._parseQuery(url.searchParams);
+        this.path = url.pathname;
+    }
+
+    _parseUrl(source, options) {
+
+        if (source[0] === '/') {
+
+            // Relative URL
+
+            if (options._fast) {
+                const url = {
+                    pathname: source,
+                    searchParams: ''
+                };
+
+                const q = source.indexOf('?');
+                const h = source.indexOf('#');
+
+                if (q !== -1 &&
+                    (h === -1 || q < h)) {
+
+                    url.pathname = source.slice(0, q);
+                    const query = h === -1 ? source.slice(q + 1) : source.slice(q + 1, h);
+                    url.searchParams = Querystring.parse(query);
+                }
+                else {
+                    url.pathname = h === -1 ? source : source.slice(0, h);
+                }
+
+                this._normalizePath(url, options);
+                return url;
+            }
+
+            const host = this.info.host || this._formatIpv6Host(this._core.info.host, this._core.info.port);
+
+            this._url = new Url.URL(`${this._core.info.protocol}://${host}${source}`);
+        }
+        else {
+
+            // Absolute URI (proxied)
+
+            this._url = new Url.URL(source);
+            this.info.hostname = this._url.hostname;
+            this.info.host = this._url.host;
+        }
+
+        this._normalizePath(this._url, options);
+        this._urlError = null;
+
+        return this._url;
+    }
+
+    _isBareIpv6(host) {
+
+        // An IPv6 address contains at least two colons.
+
+        return /:[^:]*:/.test(host);
+    }
+
+    _formatIpv6Host(host, port) {
+
+        return this._isBareIpv6(host) ? `[${host}]:${port}` : `${host}:${port}`;
+    }
+
+    _normalizePath(url, options) {
+
+        let path = this._core.router.normalize(url.pathname);
+
+        if (options.stripTrailingSlash &&
+            path.length > 1 &&
+            path[path.length - 1] === '/') {
+
+            path = path.slice(0, -1);
+        }
+
+        url.pathname = path;
+    }
+
+    _parseQuery(searchParams) {
+
+        let query = Object.create(null);
+
+        // Flatten map
+
+        if (searchParams instanceof Url.URLSearchParams) {
+            for (let [key, value] of searchParams) {
+                const entry = query[key];
+                if (entry !== undefined) {
+                    value = [].concat(entry, value);
+                }
+
+                query[key] = value;
+            }
+        }
+        else {
+            query = Object.assign(query, searchParams);
+        }
+
+        // Custom parser
+
+        const parser = this._core.settings.query.parser;
+        if (parser) {
+            query = parser(query);
+            if (!query ||
+                typeof query !== 'object') {
+
+                throw Boom.badImplementation('Parsed query must be an object');
+            }
+        }
+
+        return query;
+    }
+
+    setMethod(method) {
+
+        Hoek.assert(this.params === null, 'Cannot change request method after routing');
+        Hoek.assert(method && typeof method === 'string', 'Missing method');
+
+        this.method = method.toLowerCase();
+    }
+
+    active() {
+
+        return !!this._eventContext.request;
+    }
+
+    async _execute() {
+
+        this.info.acceptEncoding = this._core.compression.accept(this);
+
+        try {
+            await this._onRequest();
+        }
+        catch (err) {
+            Bounce.rethrow(err, 'system');
+            return this._reply(err);
+        }
+
+        this._lookup();
+        this._setTimeouts();
+        await this._lifecycle();
+        this._reply();
+    }
+
+    async _onRequest() {
+
+        // onRequest (can change request method and url)
+
+        if (this._core.extensions.route.onRequest.nodes) {
+            const response = await this._invoke(this._core.extensions.route.onRequest);
+            if (response) {
+                if (!internals.skip(response)) {
+                    throw Boom.badImplementation('onRequest extension methods must return an error, a takeover response, or a continue signal');
+                }
+
+                throw response;
+            }
+        }
+
+        // Validate path
+
+        if (this._urlError) {
+            throw this._urlError;
+        }
+    }
+
+    _listen() {
+
+        if (this._isPayloadPending) {
+            this.raw.req.on('end', internals.event.bind(this.raw.req, this._eventContext, 'end'));
+        }
+
+        this.raw.res.on('close', internals.event.bind(this.raw.res, this._eventContext, 'close'));
+        this.raw.req.on('error', internals.event.bind(this.raw.req, this._eventContext, 'error'));
+        this.raw.req.on('aborted', internals.event.bind(this.raw.req, this._eventContext, 'abort'));
+        this.raw.res.once('close', internals.closed.bind(this.raw.res, this));
+    }
+
+    _lookup() {
+
+        const match = this._core.router.route(this.method, this.path, this.info.hostname);
+        if (!match.route.settings.isInternal ||
+            this._allowInternals) {
+
+            this._route = match.route;
+            this.route = this._route.public;
+        }
+
+        this.params = match.params ?? {};
+        this.paramsArray = match.paramsArray ?? [];
+
+        if (this.route.settings.cors) {
+            this.info.cors = {
+                isOriginMatch: Cors.matchOrigin(this.headers.origin, this.route.settings.cors)
+            };
+        }
+    }
+
+    _setTimeouts() {
+
+        if (this.raw.req.socket &&
+            this.route.settings.timeout.socket !== undefined) {
+
+            this.raw.req.socket.setTimeout(this.route.settings.timeout.socket || 0);    // Value can be false or positive
+        }
+
+        let serverTimeout = this.route.settings.timeout.server;
+        if (!serverTimeout) {
+            return;
+        }
+
+        const elapsed = Date.now() - this.info.received;
+        serverTimeout = Math.floor(serverTimeout - elapsed);            // Calculate the timeout from when the request was constructed
+
+        if (serverTimeout <= 0) {
+            internals.timeoutReply(this, serverTimeout);
+            return;
+        }
+
+        this._serverTimeoutId = setTimeout(internals.timeoutReply, serverTimeout, this, serverTimeout);
+    }
+
+    async _lifecycle() {
+
+        for (const func of this._route._cycle) {
+            if (this._isReplied) {
+                return;
+            }
+
+            try {
+                var response = await (typeof func === 'function' ? func(this) : this._invoke(func));
+            }
+            catch (err) {
+                Bounce.rethrow(err, 'system');
+                response = this._core.Response.wrap(err, this);
+            }
+
+            if (!response ||
+                response === Toolkit.symbols.continue) {                // Continue
+
+                continue;
+            }
+
+            if (!internals.skip(response)) {
+                response = Boom.badImplementation('Lifecycle methods called before the handler can only return an error, a takeover response, or a continue signal');
+            }
+
+            this._setResponse(response);
+            return;
+        }
+    }
+
+    async _invoke(event, options = {}) {
+
+        for (const ext of event.nodes) {
+            const realm = ext.realm;
+            const bind = ext.bind ?? realm.settings.bind;
+            const response = await this._core.toolkit.execute(ext.func, this, { bind, realm, timeout: ext.timeout, name: event.type, ignoreResponse: options.ignoreResponse });
+
+            if (options.ignoreResponse) {
+                if (Boom.isBoom(response)) {
+                    this._log(['ext', 'error'], response);
+                }
+
+                continue;
+            }
+
+            if (response === Toolkit.symbols.continue) {
+                continue;
+            }
+
+            if (internals.skip(response) ||
+                this.response === null) {
+
+                return response;
+            }
+
+            this._setResponse(response);
+        }
+    }
+
+    async _reply(exit) {
+
+        if (this._isReplied) {                                          // Prevent any future responses to this request
+            return;
+        }
+
+        this._isReplied = true;
+
+        if (this._serverTimeoutId) {
+            clearTimeout(this._serverTimeoutId);
+        }
+
+        if (exit) {                                                     // Can be a valid response or error (if returned from an ext, already handled because this.response is also set)
+            this._setResponse(this._core.Response.wrap(exit, this));    // Wrap to ensure any object thrown is always a valid Boom or Response object
+        }
+
+        if (!this._eventContext.request) {
+            this._finalize();
+            return;
+        }
+
+        if (typeof this.response === 'symbol') {                        // close or abandon
+            this._abort();
+            return;
+        }
+
+        await this._postCycle();
+
+        if (!this._eventContext.request ||
+            typeof this.response === 'symbol') {                        // close or abandon
+
+            this._abort();
+            return;
+        }
+
+        await Transmit.send(this);
+        this._finalize();
+    }
+
+    async _postCycle() {
+
+        for (const func of this._route._postCycle) {
+            if (!this._eventContext.request) {
+                return;
+            }
+
+            try {
+                var response = await (typeof func === 'function' ? func(this) : this._invoke(func));
+            }
+            catch (err) {
+                Bounce.rethrow(err, 'system');
+                response = this._core.Response.wrap(err, this);
+            }
+
+            if (response &&
+                response !== Toolkit.symbols.continue) {            // Continue
+
+                this._setResponse(response);
+            }
+        }
+    }
+
+    _abort() {
+
+        if (this.response === Toolkit.symbols.close) {
+            this.raw.res.end();                                     // End the response in case it wasn't already closed
+        }
+
+        this._finalize();
+    }
+
+    _finalize() {
+
+        this._eventContext.request = null;              // Disable req events
+
+        if (this.response._close) {
+            if (this.response.statusCode === 500 &&
+                this.response._error) {
+
+                const tags = this.response._error.isDeveloperError ? ['internal', 'implementation', 'error'] : ['internal', 'error'];
+                this._log(tags, this.response._error, 'error');
+            }
+
+            this.response._close();
+        }
+
+        this.info.completed = Date.now();
+
+        this._core.events.emit('response', this);
+
+        if (this._route._extensions.onPostResponse.nodes) {
+            this._invoke(this._route._extensions.onPostResponse, { ignoreResponse: true });
+        }
+    }
+
+    _setResponse(response) {
+
+        if (this.response &&
+            !this.response.isBoom &&
+            this.response !== response &&
+            this.response.source !== response.source) {
+
+            this.response._close?.();
+        }
+
+        if (this.info.completed) {
+            response._close?.();
+
+            return;
+        }
+
+        this.response = response;
+    }
+
+    _setState(name, value, options) {
+
+        const state = { name, value };
+        if (options) {
+            Hoek.assert(!options.autoValue, 'Cannot set autoValue directly in a response');
+            state.options = Hoek.clone(options);
+        }
+
+        this._states[name] = state;
+    }
+
+    _clearState(name, options = {}) {
+
+        const state = { name };
+
+        state.options = Hoek.clone(options);
+        state.options.ttl = 0;
+
+        this._states[name] = state;
+    }
+
+    _tap() {
+
+        if (!this._events) {
+            return null;
+        }
+
+        if (this._events.hasListeners('peek') ||
+            this._events.hasListeners('finish')) {
+
+            return new this._core.Response.Peek(this._events);
+        }
+
+        return null;
+    }
+
+    log(tags, data) {
+
+        return this._log(tags, data, 'app');
+    }
+
+    _log(tags, data, channel = 'internal') {
+
+        if (!this._core.events.hasListeners('request') &&
+            !this.route.settings.log.collect) {
+
+            return;
+        }
+
+        if (!Array.isArray(tags)) {
+            tags = [tags];
+        }
+
+        const timestamp = Date.now();
+        const field = data instanceof Error ? 'error' : 'data';
+
+        let event = [this, { request: this.info.id, timestamp, tags, [field]: data, channel }];
+        if (typeof data === 'function') {
+            event = () => [this, { request: this.info.id, timestamp, tags, data: data(), channel }];
+        }
+
+        if (this.route.settings.log.collect) {
+            if (typeof data === 'function') {
+                event = event();
+            }
+
+            this.logs.push(event[1]);
+        }
+
+        this._core.events.emit({ name: 'request', channel, tags }, event);
+    }
+
+    generateResponse(source, options) {
+
+        return new this._core.Response(source, this, options);
+    }
+};
+
+
+internals.Request.reserved = internals.reserved;
+
+internals.Request.symbols = {
+    authPayload: Symbol('auth.payload')
+};
+
+internals.Info = class {
+
+    constructor(request) {
+
+        this._request = request;
+
+        const req = request.raw.req;
+        const host = (req.headers.host || req.headers[':authority'] || '').trim();
+        const received = Date.now();
+
+        this.received = received;
+        this.referrer = req.headers.referrer || req.headers.referer || '';
+        this.host = host;
+        this.hostname = /^(.*?)(?::\d+)?$/.exec(host)[1];
+        this.id = `${received}:${request._core.info.id}:${request._core._counter()}`;
+
+        this._remoteAddress = null;
+        this._remotePort = null;
+
+        // Assigned later
+
+        this.acceptEncoding = null;
+        this.cors = null;
+        this.responded = 0;
+        this.completed = 0;
+
+        if (request._core.settings.info.remote) {
+            this.remoteAddress;
+            this.remotePort;
+        }
+    }
+
+    get remoteAddress() {
+
+        if (!this._remoteAddress) {
+            const ipv6Prefix = '::ffff:';
+            const socketAddress = this._request.raw.req.socket.remoteAddress;
+            if (socketAddress && socketAddress.startsWith(ipv6Prefix) && socketAddress.includes('.', ipv6Prefix.length)) {
+                // Normalize IPv4-mapped IPv6 address, e.g. ::ffff:127.0.0.1 -> 127.0.0.1
+                this._remoteAddress = socketAddress.slice(ipv6Prefix.length);
+            }
+            else {
+                this._remoteAddress = socketAddress;
+            }
+        }
+
+        return this._remoteAddress;
+    }
+
+    get remotePort() {
+
+        if (this._remotePort === null) {
+            this._remotePort = this._request.raw.req.socket.remotePort || '';
+        }
+
+        return this._remotePort;
+    }
+
+    toJSON() {
+
+        return {
+            acceptEncoding: this.acceptEncoding,
+            completed: this.completed,
+            cors: this.cors,
+            host: this.host,
+            hostname: this.hostname,
+            id: this.id,
+            received: this.received,
+            referrer: this.referrer,
+            remoteAddress: this.remoteAddress,
+            remotePort: this.remotePort,
+            responded: this.responded
+        };
+    }
+};
+
+
+internals.closed = function (request) {
+
+    request._closed = true;
+};
+
+internals.event = function ({ request }, event, err) {
+
+    if (!request) {
+        return;
+    }
+
+    request._isPayloadPending = false;
+
+    if (event === 'close' &&
+        request.raw.res.writableEnded) {
+
+        return;
+    }
+
+    if (event === 'end') {
+        return;
+    }
+
+    request._log(err ? ['request', 'error'] : ['request', 'error', event], err);
+
+    if (event === 'error') {
+        return;
+    }
+
+    request._eventContext.request = null;
+
+    if (event === 'abort') {
+
+        // Calling _reply() means that the abort is applied immediately, unless the response has already
+        // called _reply(), in which case this call is ignored and the transmit logic is responsible for
+        // handling the abort.
+
+        request._reply(new Boom.Boom('Request aborted', { statusCode: request.route.settings.response.disconnectStatusCode, data: request.response }));
+
+        if (request._events) {
+            request._events.emit('disconnect');
+        }
+    }
+};
+
+
+internals.timeoutReply = function (request, timeout) {
+
+    const elapsed = Date.now() - request.info.received;
+    request._log(['request', 'server', 'timeout', 'error'], { timeout, elapsed });
+    request._reply(Boom.serverUnavailable());
+};
+
+
+internals.skip = function (response) {
+
+    return response.isBoom || response._takeover || typeof response === 'symbol';
+};
diff --git a/node_modules/@hapi/hapi/lib/response.js b/node_modules/@hapi/hapi/lib/response.js
new file mode 100755
index 0000000..2acd832
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/response.js
@@ -0,0 +1,751 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+const Podium = require('@hapi/podium');
+
+const Streams = require('./streams');
+
+
+const internals = {
+    events: Podium.validate(['finish', { name: 'peek', spread: true }]),
+    hopByHop: {
+        connection: true,
+        'keep-alive': true,
+        'proxy-authenticate': true,
+        'proxy-authorization': true,
+        'te': true,
+        'trailer': true,
+        'transfer-encoding': true,
+        'upgrade': true
+    },
+    reserved: ['app', 'headers', 'plugins', 'request', 'source', 'statusCode', 'variety',
+        'settings', 'events', 'code', 'message', 'header', 'vary', 'etag', 'type', 'contentType',
+        'bytes', 'location', 'created', 'compressed', 'replacer', 'space', 'suffix', 'escape',
+        'passThrough', 'redirect', 'temporary', 'permanent', 'rewritable', 'encoding', 'charset',
+        'ttl', 'state', 'unstate', 'takeover']
+};
+
+
+exports = module.exports = internals.Response = class {
+
+    constructor(source, request, options = {}) {
+
+        this.app = {};
+        this.headers = {};                          // Incomplete as some headers are stored in flags
+        this.plugins = {};
+        this.request = request;
+        this.source = null;
+        this.statusCode = null;
+        this.variety = null;
+
+        this.settings = {
+            charset: 'utf-8',                       // '-' required by IANA
+            compressed: null,
+            encoding: 'utf8',
+            message: null,
+            passThrough: true,
+            stringify: null,                        // JSON.stringify options
+            ttl: null,
+            varyEtag: false
+        };
+
+        this._events = null;
+        this._payload = null;                       // Readable stream
+        this._error = options.error ?? null;        // The boom object when created from an error (used for logging)
+        this._contentType = null;                   // Used if no explicit content-type is set and type is known
+        this._takeover = false;
+        this._statusCode = false;                   // true when code() called
+        this._state = this._error ? 'prepare' : 'init'; // One of 'init', 'prepare', 'marshall', 'close'
+
+        this._processors = {
+            marshal: options.marshal,
+            prepare: options.prepare,
+            close: options.close
+        };
+
+        this._setSource(source, options.variety);
+    }
+
+    static wrap(result, request) {
+
+        if (result instanceof request._core.Response ||
+            typeof result === 'symbol') {
+
+            return result;
+        }
+
+        if (result instanceof Error) {
+            return Boom.boomify(result);
+        }
+
+        return new request._core.Response(result, request);
+    }
+
+    _setSource(source, variety) {
+
+        // Method must not set any headers or other properties as source can change later
+
+        this.variety = variety ?? 'plain';
+
+        if (source === null ||
+            source === undefined) {
+
+            source = null;
+        }
+        else if (Buffer.isBuffer(source)) {
+            this.variety = 'buffer';
+            this._contentType = 'application/octet-stream';
+        }
+        else if (Streams.isStream(source)) {
+            this.variety = 'stream';
+            this._contentType = 'application/octet-stream';
+        }
+
+        this.source = source;
+
+        if (this.variety === 'plain' &&
+            this.source !== null) {
+
+            this._contentType = typeof this.source === 'string' ? 'text/html' : 'application/json';
+        }
+    }
+
+    get events() {
+
+        if (!this._events) {
+            this._events = new Podium.Podium(internals.events);
+        }
+
+        return this._events;
+    }
+
+    code(statusCode) {
+
+        Hoek.assert(Number.isSafeInteger(statusCode), 'Status code must be an integer');
+
+        this.statusCode = statusCode;
+        this._statusCode = true;
+
+        return this;
+    }
+
+    message(httpMessage) {
+
+        this.settings.message = httpMessage;
+        return this;
+    }
+
+    header(key, value, options) {
+
+        key = key.toLowerCase();
+        if (key === 'vary') {
+            return this.vary(value);
+        }
+
+        return this._header(key, value, options);
+    }
+
+    _header(key, value, options = {}) {
+
+        const append = options.append ?? false;
+        const separator = options.separator || ',';
+        const override = options.override !== false;
+        const duplicate = options.duplicate !== false;
+
+        if (!append && override ||
+            !this.headers[key]) {
+
+            this.headers[key] = value;
+        }
+        else if (override) {
+            if (key === 'set-cookie') {
+                this.headers[key] = [].concat(this.headers[key], value);
+            }
+            else {
+                const existing = this.headers[key];
+                if (!duplicate) {
+                    const values = existing.split(separator);
+                    for (const v of values) {
+                        if (v === value) {
+                            return this;
+                        }
+                    }
+                }
+
+                this.headers[key] = existing + separator + value;
+            }
+        }
+
+        return this;
+    }
+
+    vary(value) {
+
+        if (value === '*') {
+            this.headers.vary = '*';
+        }
+        else if (!this.headers.vary) {
+            this.headers.vary = value;
+        }
+        else if (this.headers.vary !== '*') {
+            this._header('vary', value, { append: true, duplicate: false });
+        }
+
+        return this;
+    }
+
+    etag(tag, options) {
+
+        const entity = this.request._core.Response.entity(tag, options);
+        this._header('etag', entity.etag);
+        this.settings.varyEtag = entity.vary;
+        return this;
+    }
+
+    static entity(tag, options = {}) {
+
+        Hoek.assert(tag !== '*', 'ETag cannot be *');
+
+        return {
+            etag: (options.weak ? 'W/' : '') + '"' + tag + '"',
+            vary: options.vary !== false && !options.weak,                      // vary defaults to true
+            modified: options.modified
+        };
+    }
+
+    static unmodified(request, entity) {
+
+        if (request.method !== 'get' &&
+            request.method !== 'head') {
+
+            return false;
+        }
+
+        // Strong verifier
+
+        if (entity.etag &&
+            request.headers['if-none-match']) {
+
+            const ifNoneMatch = request.headers['if-none-match'].split(/\s*,\s*/);
+            for (const etag of ifNoneMatch) {
+
+                // Compare tags (https://tools.ietf.org/html/rfc7232#section-2.3.2)
+
+                if (etag === entity.etag) {             // Strong comparison
+                    return true;
+                }
+
+                if (!entity.vary) {
+                    continue;
+                }
+
+                if (etag === `W/${entity.etag}`) {      // Weak comparison
+                    return etag;
+                }
+
+                const etagBase = entity.etag.slice(0, -1);
+                const encoders = request._core.compression.encodings;
+                for (const encoder of encoders) {
+                    if (etag === etagBase + `-${encoder}"`) {
+                        return true;
+                    }
+                }
+            }
+
+            return false;
+        }
+
+        // Weak verifier
+
+        if (!entity.modified) {
+            return false;
+        }
+
+        const ifModifiedSinceHeader = request.headers['if-modified-since'];
+        if (!ifModifiedSinceHeader) {
+            return false;
+        }
+
+        const ifModifiedSince = internals.parseDate(ifModifiedSinceHeader);
+        if (!ifModifiedSince) {
+            return false;
+        }
+
+        const lastModified = internals.parseDate(entity.modified);
+        if (!lastModified) {
+            return false;
+        }
+
+        return ifModifiedSince >= lastModified;
+    }
+
+    type(type) {
+
+        this._header('content-type', type);
+        return this;
+    }
+
+    get contentType() {
+
+        let type = this.headers['content-type'];
+        if (type) {
+            type = type.trim();
+            if (this.settings.charset &&
+                type.match(/^(?:text\/)|(?:application\/(?:json)|(?:javascript))/) &&
+                !type.match(/; *charset=/)) {
+
+                const semi = type[type.length - 1] === ';';
+                return type + (semi ? ' ' : '; ') + 'charset=' + this.settings.charset;
+            }
+
+            return type;
+        }
+
+        if (this._contentType) {
+            const charset = this.settings.charset && this._contentType !== 'application/octet-stream' ? '; charset=' + this.settings.charset : '';
+            return this._contentType + charset;
+        }
+
+        return null;
+    }
+
+    bytes(bytes) {
+
+        this._header('content-length', bytes);
+        return this;
+    }
+
+    location(uri) {
+
+        this._header('location', uri);
+        return this;
+    }
+
+    created(location) {
+
+        Hoek.assert(this.request.method === 'post' ||
+            this.request.method === 'put' ||
+            this.request.method === 'patch', 'Cannot return 201 status codes for ' + this.request.method.toUpperCase());
+
+        this.statusCode = 201;
+        this.location(location);
+        return this;
+    }
+
+    compressed(encoding) {
+
+        Hoek.assert(encoding && typeof encoding === 'string', 'Invalid content-encoding');
+        this.settings.compressed = encoding;
+        return this;
+    }
+
+    replacer(method) {
+
+        this.settings.stringify = this.settings.stringify ?? {};
+        this.settings.stringify.replacer = method;
+        return this;
+    }
+
+    spaces(count) {
+
+        this.settings.stringify = this.settings.stringify ?? {};
+        this.settings.stringify.space = count;
+        return this;
+    }
+
+    suffix(suffix) {
+
+        this.settings.stringify = this.settings.stringify ?? {};
+        this.settings.stringify.suffix = suffix;
+        return this;
+    }
+
+    escape(escape) {
+
+        this.settings.stringify = this.settings.stringify ?? {};
+        this.settings.stringify.escape = escape;
+        return this;
+    }
+
+    passThrough(enabled) {
+
+        this.settings.passThrough = enabled !== false;      // Defaults to true
+        return this;
+    }
+
+    redirect(location) {
+
+        this.statusCode = 302;
+        this.location(location);
+        return this;
+    }
+
+    temporary(isTemporary) {
+
+        Hoek.assert(this.headers.location, 'Cannot set redirection mode without first setting a location');
+
+        this._setTemporary(isTemporary !== false);           // Defaults to true
+        return this;
+    }
+
+    permanent(isPermanent) {
+
+        Hoek.assert(this.headers.location, 'Cannot set redirection mode without first setting a location');
+
+        this._setTemporary(isPermanent === false);           // Defaults to true
+        return this;
+    }
+
+    rewritable(isRewritable) {
+
+        Hoek.assert(this.headers.location, 'Cannot set redirection mode without first setting a location');
+
+        this._setRewritable(isRewritable !== false);         // Defaults to true
+        return this;
+    }
+
+    _isTemporary() {
+
+        return this.statusCode === 302 || this.statusCode === 307;
+    }
+
+    _isRewritable() {
+
+        return this.statusCode === 301 || this.statusCode === 302;
+    }
+
+    _setTemporary(isTemporary) {
+
+        if (isTemporary) {
+            if (this._isRewritable()) {
+                this.statusCode = 302;
+            }
+            else {
+                this.statusCode = 307;
+            }
+        }
+        else {
+            if (this._isRewritable()) {
+                this.statusCode = 301;
+            }
+            else {
+                this.statusCode = 308;
+            }
+        }
+    }
+
+    _setRewritable(isRewritable) {
+
+        if (isRewritable) {
+            if (this._isTemporary()) {
+                this.statusCode = 302;
+            }
+            else {
+                this.statusCode = 301;
+            }
+        }
+        else {
+            if (this._isTemporary()) {
+                this.statusCode = 307;
+            }
+            else {
+                this.statusCode = 308;
+            }
+        }
+    }
+
+    encoding(encoding) {
+
+        this.settings.encoding = encoding;
+        return this;
+    }
+
+    charset(charset) {
+
+        this.settings.charset = charset ?? null;
+        return this;
+    }
+
+    ttl(ttl) {
+
+        this.settings.ttl = ttl;
+        return this;
+    }
+
+    state(name, value, options) {
+
+        this.request._setState(name, value, options);
+        return this;
+    }
+
+    unstate(name, options) {
+
+        this.request._clearState(name, options);
+        return this;
+    }
+
+    takeover() {
+
+        this._takeover = true;
+        return this;
+    }
+
+    _prepare() {
+
+        Hoek.assert(this._state === 'init');
+
+        this._state = 'prepare';
+
+        this._passThrough();
+
+        if (!this._processors.prepare) {
+            return this;
+        }
+
+        try {
+            return this._processors.prepare(this);
+        }
+        catch (err) {
+            throw Boom.boomify(err);
+        }
+    }
+
+    _passThrough() {
+
+        if (this.variety === 'stream' &&
+            this.settings.passThrough) {
+
+            if (this.source.statusCode &&
+                !this.statusCode) {
+
+                this.statusCode = this.source.statusCode;                        // Stream is an HTTP response
+            }
+
+            if (this.source.headers) {
+                let headerKeys = Object.keys(this.source.headers);
+
+                if (headerKeys.length) {
+                    const localHeaders = this.headers;
+                    this.headers = {};
+
+                    const connection = this.source.headers.connection;
+                    const byHop = {};
+                    if (connection) {
+                        connection.split(/\s*,\s*/).forEach((header) => {
+
+                            byHop[header] = true;
+                        });
+                    }
+
+                    for (const key of headerKeys) {
+                        const lower = key.toLowerCase();
+                        if (!internals.hopByHop[lower] &&
+                            !byHop[lower]) {
+
+                            this.header(lower, Hoek.clone(this.source.headers[key]));     // Clone arrays
+                        }
+                    }
+
+                    headerKeys = Object.keys(localHeaders);
+                    for (const key of headerKeys) {
+                        this.header(key, localHeaders[key], { append: key === 'set-cookie' });
+                    }
+                }
+            }
+        }
+
+        this.statusCode = this.statusCode ?? 200;
+    }
+
+    async _marshal() {
+
+        Hoek.assert(this._state === 'prepare');
+
+        this._state = 'marshall';
+
+        // Processor marshal
+
+        let source = this.source;
+
+        if (this._processors.marshal) {
+            try {
+                source = await this._processors.marshal(this);
+            }
+            catch (err) {
+                throw Boom.boomify(err);
+            }
+        }
+
+        // Stream source
+
+        if (Streams.isStream(source)) {
+            this._payload = source;
+            return;
+        }
+
+        // Plain source (non string or null)
+
+        const jsonify = this.variety === 'plain' && source !== null && typeof source !== 'string';
+
+        if (!jsonify &&
+            this.settings.stringify) {
+
+            throw Boom.badImplementation('Cannot set formatting options on non object response');
+        }
+
+        let payload = source;
+
+        if (jsonify) {
+            const options = this.settings.stringify ?? {};
+            const space = options.space ?? this.request.route.settings.json.space;
+            const replacer = options.replacer ?? this.request.route.settings.json.replacer;
+            const suffix = options.suffix ?? this.request.route.settings.json.suffix ?? '';
+            const escape = this.request.route.settings.json.escape;
+
+            try {
+                if (replacer || space) {
+                    payload = JSON.stringify(payload, replacer, space);
+                }
+                else {
+                    payload = JSON.stringify(payload);
+                }
+            }
+            catch (err) {
+                throw Boom.boomify(err);
+            }
+
+            if (suffix) {
+                payload = payload + suffix;
+            }
+
+            if (escape) {
+                payload = Hoek.escapeJson(payload);
+            }
+        }
+
+        this._payload = new internals.Response.Payload(payload, this.settings);
+    }
+
+    _tap() {
+
+        if (!this._events) {
+            return null;
+        }
+
+        if (this._events.hasListeners('peek') ||
+            this._events.hasListeners('finish')) {
+
+            return new internals.Response.Peek(this._events);
+        }
+
+        return null;
+    }
+
+    _close() {
+
+        if (this._state === 'close') {
+            return;
+        }
+
+        this._state = 'close';
+
+        if (this._processors.close) {
+            try {
+                this._processors.close(this);
+            }
+            catch (err) {
+                Bounce.rethrow(err, 'system');
+                this.request._log(['response', 'cleanup', 'error'], err);
+            }
+        }
+
+        const stream = this._payload || this.source;
+        if (Streams.isStream(stream)) {
+            internals.Response.drain(stream);
+        }
+    }
+
+    _isPayloadSupported() {
+
+        return this.request.method !== 'head' && this.statusCode !== 304 && this.statusCode !== 204;
+    }
+
+    static drain(stream) {
+
+        stream.destroy();
+    }
+};
+
+
+internals.Response.reserved = internals.reserved;
+
+
+internals.parseDate = function (string) {
+
+    try {
+        return Date.parse(string);
+    }
+    catch (errIgnore) { }
+};
+
+
+internals.Response.Payload = class extends Stream.Readable {
+
+    constructor(payload, options) {
+
+        super();
+
+        this._data = payload;
+        this._encoding = options.encoding;
+    }
+
+    _read(size) {
+
+        if (this._data) {
+            this.push(this._data, this._encoding);
+        }
+
+        this.push(null);
+    }
+
+    size() {
+
+        if (!this._data) {
+            return 0;
+        }
+
+        return Buffer.isBuffer(this._data) ? this._data.length : Buffer.byteLength(this._data, this._encoding);
+    }
+
+    writeToStream(stream) {
+
+        if (this._data) {
+            stream.write(this._data, this._encoding);
+        }
+
+        stream.end();
+    }
+};
+
+
+internals.Response.Peek = class extends Stream.Transform {
+
+    constructor(podium) {
+
+        super();
+
+        this._podium = podium;
+        this.on('finish', () => podium.emit('finish'));
+    }
+
+    _transform(chunk, encoding, callback) {
+
+        this._podium.emit('peek', [chunk, encoding]);
+        this.push(chunk, encoding);
+        callback();
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/route.js b/node_modules/@hapi/hapi/lib/route.js
new file mode 100755
index 0000000..6491693
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/route.js
@@ -0,0 +1,489 @@
+'use strict';
+
+const Assert = require('assert');
+
+const Bounce = require('@hapi/bounce');
+const Catbox = require('@hapi/catbox');
+const Hoek = require('@hapi/hoek');
+const Subtext = require('@hapi/subtext');
+const Validate = require('@hapi/validate');
+
+const Auth = require('./auth');
+const Config = require('./config');
+const Cors = require('./cors');
+const Ext = require('./ext');
+const Handler = require('./handler');
+const Headers = require('./headers');
+const Security = require('./security');
+const Streams = require('./streams');
+const Validation = require('./validation');
+
+
+const internals = {};
+
+
+exports = module.exports = internals.Route = class {
+
+    constructor(route, server, options = {}) {
+
+        const core = server._core;
+        const realm = server.realm;
+
+        // Routing information
+
+        Config.apply('route', route, route.method, route.path);
+
+        const method = route.method.toLowerCase();
+        Hoek.assert(method !== 'head', 'Cannot set HEAD route:', route.path);
+
+        const path = realm.modifiers.route.prefix ? realm.modifiers.route.prefix + (route.path !== '/' ? route.path : '') : route.path;
+        Hoek.assert(path === '/' || path[path.length - 1] !== '/' || !core.settings.router.stripTrailingSlash, 'Path cannot end with a trailing slash when configured to strip:', route.method, route.path);
+
+        const vhost = realm.modifiers.route.vhost ?? route.vhost;
+
+        // Set identifying members (assert)
+
+        this.method = method;
+        this.path = path;
+
+        // Prepare configuration
+
+        let config = route.options ?? route.config ?? {};
+        if (typeof config === 'function') {
+            config = config.call(realm.settings.bind, server);
+        }
+
+        config = Config.enable(config);     // Shallow clone
+
+        // Verify route level config (as opposed to the merged settings)
+
+        this._assert(method !== 'get' || !config.payload, 'Cannot set payload settings on HEAD or GET request');
+        this._assert(method !== 'get' || !config.validate?.payload, 'Cannot validate HEAD or GET request payload');
+
+        // Rules
+
+        this._assert(!route.rules || !config.rules, 'Route rules can only appear once');                    // XOR
+        const rules = route.rules ?? config.rules;
+        const rulesConfig = internals.rules(rules, { method, path, vhost }, server);
+        delete config.rules;
+
+        // Handler
+
+        this._assert(route.handler || config.handler, 'Missing or undefined handler');
+        this._assert(!!route.handler ^ !!config.handler, 'Handler must only appear once');                  // XOR
+
+        const handler = Config.apply('handler', route.handler ?? config.handler);
+        delete config.handler;
+
+        const handlerDefaults = Handler.defaults(method, handler, core);
+
+        // Apply settings in order: server <- handler <- realm <- route
+
+        const settings = internals.config([core.settings.routes, handlerDefaults, realm.settings, rulesConfig, config]);
+        this.settings = Config.apply('routeConfig', settings, method, path);
+
+
+        // Route members
+
+        this._core = core;
+        this.realm = realm;
+
+        this.settings.vhost = vhost;
+        this.settings.plugins = this.settings.plugins ?? {};            // Route-specific plugins settings, namespaced using plugin name
+        this.settings.app = this.settings.app ?? {};                    // Route-specific application settings
+
+        // Path parsing
+
+        this._special = !!options.special;
+        this._analysis = this._core.router.analyze(this.path);
+        this.params = this._analysis.params;
+        this.fingerprint = this._analysis.fingerprint;
+
+        this.public = {
+            method: this.method,
+            path: this.path,
+            vhost,
+            realm,
+            settings: this.settings,
+            fingerprint: this.fingerprint,
+            auth: {
+                access: (request) => Auth.testAccess(request, this.public)
+            }
+        };
+
+        // Validation
+
+        this._setupValidation();
+
+        // Payload parsing
+
+        if (this.method === 'get') {
+            this.settings.payload = null;
+        }
+        else {
+            this.settings.payload.decoders = this._core.compression.decoders;       // Reference the shared object to keep up to date
+        }
+
+        this._assert(!this.settings.validate.payload || this.settings.payload.parse, 'Route payload must be set to \'parse\' when payload validation enabled');
+        this._assert(!this.settings.validate.state || this.settings.state.parse, 'Route state must be set to \'parse\' when state validation enabled');
+
+        // Authentication configuration
+
+        this.settings.auth = this._special ? false : this._core.auth._setupRoute(this.settings.auth, path);
+
+        // Cache
+
+        if (this.method === 'get' &&
+            typeof this.settings.cache === 'object' &&
+            (this.settings.cache.expiresIn || this.settings.cache.expiresAt)) {
+
+            this.settings.cache._statuses = new Set(this.settings.cache.statuses);
+            this._cache = new Catbox.Policy({ expiresIn: this.settings.cache.expiresIn, expiresAt: this.settings.cache.expiresAt });
+        }
+
+        // CORS
+
+        this.settings.cors = Cors.route(this.settings.cors);
+
+        // Security
+
+        this.settings.security = Security.route(this.settings.security);
+
+        // Handler
+
+        this.settings.handler = Handler.configure(handler, this);
+        this._prerequisites = Handler.prerequisitesConfig(this.settings.pre);
+
+        // Route lifecycle
+
+        this._extensions = {
+            onPreResponse: Ext.combine(this, 'onPreResponse'),
+            onPostResponse: Ext.combine(this, 'onPostResponse')
+        };
+
+        if (this._special) {
+            this._cycle = [internals.drain, Handler.execute];
+            this.rebuild();
+            return;
+        }
+
+        this._extensions.onPreAuth = Ext.combine(this, 'onPreAuth');
+        this._extensions.onCredentials = Ext.combine(this, 'onCredentials');
+        this._extensions.onPostAuth = Ext.combine(this, 'onPostAuth');
+        this._extensions.onPreHandler = Ext.combine(this, 'onPreHandler');
+        this._extensions.onPostHandler = Ext.combine(this, 'onPostHandler');
+
+        this.rebuild();
+    }
+
+    _setupValidation() {
+
+        const validation = this.settings.validate;
+        if (this.method === 'get') {
+            validation.payload = null;
+        }
+
+        this._assert(!validation.params || this.params.length, 'Cannot set path parameters validations without path parameters');
+
+        for (const type of ['headers', 'params', 'query', 'payload', 'state']) {
+            validation[type] = Validation.compile(validation[type], this.settings.validate.validator, this.realm, this._core);
+        }
+
+        if (this.settings.response.schema !== undefined ||
+            this.settings.response.status) {
+
+            this.settings.response._validate = true;
+
+            const rule = this.settings.response.schema;
+            this.settings.response.status = this.settings.response.status ?? {};
+            const statuses = Object.keys(this.settings.response.status);
+
+            if (rule === true &&
+                !statuses.length) {
+
+                this.settings.response._validate = false;
+            }
+            else {
+                this.settings.response.schema = Validation.compile(rule, this.settings.validate.validator, this.realm, this._core);
+                for (const code of statuses) {
+                    this.settings.response.status[code] = Validation.compile(this.settings.response.status[code], this.settings.validate.validator, this.realm, this._core);
+                }
+            }
+        }
+    }
+
+    rebuild(event) {
+
+        if (event) {
+            this._extensions[event.type].add(event);
+        }
+
+        if (this._special) {
+            this._postCycle = this._extensions.onPreResponse.nodes ? [this._extensions.onPreResponse] : [];
+            this._buildMarshalCycle();
+            return;
+        }
+
+        // Build lifecycle array
+
+        this._cycle = [];
+
+        // 'onRequest'
+
+        if (this.settings.state.parse) {
+            this._cycle.push(internals.state);
+        }
+
+        if (this._extensions.onPreAuth.nodes) {
+            this._cycle.push(this._extensions.onPreAuth);
+        }
+
+        if (this._core.auth._enabled(this, 'authenticate')) {
+            this._cycle.push(Auth.authenticate);
+        }
+
+        if (this.method !== 'get') {
+            this._cycle.push(internals.payload);
+
+            if (this._core.auth._enabled(this, 'payload')) {
+                this._cycle.push(Auth.payload);
+            }
+        }
+
+        if (this._core.auth._enabled(this, 'authenticate') &&
+            this._extensions.onCredentials.nodes) {
+
+            this._cycle.push(this._extensions.onCredentials);
+        }
+
+        if (this._core.auth._enabled(this, 'access')) {
+            this._cycle.push(Auth.access);
+        }
+
+        if (this._extensions.onPostAuth.nodes) {
+            this._cycle.push(this._extensions.onPostAuth);
+        }
+
+        if (this.settings.validate.headers) {
+            this._cycle.push(Validation.headers);
+        }
+
+        if (this.settings.validate.params) {
+            this._cycle.push(Validation.params);
+        }
+
+        if (this.settings.validate.query) {
+            this._cycle.push(Validation.query);
+        }
+
+        if (this.settings.validate.payload) {
+            this._cycle.push(Validation.payload);
+        }
+
+        if (this.settings.validate.state) {
+            this._cycle.push(Validation.state);
+        }
+
+        if (this._extensions.onPreHandler.nodes) {
+            this._cycle.push(this._extensions.onPreHandler);
+        }
+
+        this._cycle.push(Handler.execute);
+
+        if (this._extensions.onPostHandler.nodes) {
+            this._cycle.push(this._extensions.onPostHandler);
+        }
+
+        this._postCycle = [];
+
+        if (this.settings.response._validate &&
+            this.settings.response.sample !== 0) {
+
+            this._postCycle.push(Validation.response);
+        }
+
+        if (this._extensions.onPreResponse.nodes) {
+            this._postCycle.push(this._extensions.onPreResponse);
+        }
+
+        this._buildMarshalCycle();
+
+        // onPostResponse
+    }
+
+    _buildMarshalCycle() {
+
+        this._marshalCycle = [Headers.type];
+
+        if (this.settings.cors) {
+            this._marshalCycle.push(Cors.headers);
+        }
+
+        if (this.settings.security) {
+            this._marshalCycle.push(Security.headers);
+        }
+
+        this._marshalCycle.push(Headers.entity);
+
+        if (this.method === 'get' ||
+            this.method === '*') {
+
+            this._marshalCycle.push(Headers.unmodified);
+        }
+
+        this._marshalCycle.push(Headers.cache);
+        this._marshalCycle.push(Headers.state);
+        this._marshalCycle.push(Headers.content);
+
+        if (this._core.auth._enabled(this, 'response')) {
+            this._marshalCycle.push(Auth.response);                            // Must be last in case requires access to headers
+        }
+    }
+
+    _assert(condition, message) {
+
+        if (condition) {
+            return;
+        }
+
+        if (this.method[0] !== '_') {
+            message = `${message}: ${this.method.toUpperCase()} ${this.path}`;
+        }
+
+        throw new Assert.AssertionError({
+            message,
+            actual: false,
+            expected: true,
+            operator: '==',
+            stackStartFunction: this._assert
+        });
+    }
+};
+
+
+internals.state = async function (request) {
+
+    request.state = {};
+
+    const req = request.raw.req;
+    const cookies = req.headers.cookie;
+    if (!cookies) {
+        return;
+    }
+
+    try {
+        var result = await request._core.states.parse(cookies);
+    }
+    catch (err) {
+        Bounce.rethrow(err, 'system');
+        var parseError = err;
+    }
+
+    const { states, failed = [] } = result ?? parseError;
+    request.state = states ?? {};
+
+    // Clear cookies
+
+    for (const item of failed) {
+        if (item.settings.clearInvalid) {
+            request._clearState(item.name);
+        }
+    }
+
+    if (!parseError) {
+        return;
+    }
+
+    parseError.header = cookies;
+
+    return request._core.toolkit.failAction(request, request.route.settings.state.failAction, parseError, { tags: ['state', 'error'] });
+};
+
+
+internals.payload = async function (request) {
+
+    if (request.method === 'get' ||
+        request.method === 'head') {            // When route.method is '*'
+
+        return;
+    }
+
+    if (request.payload !== undefined) {
+        return internals.drain(request);
+    }
+
+    if (request._expectContinue) {
+        request._expectContinue = false;
+        request.raw.res.writeContinue();
+    }
+
+    try {
+        const { payload, mime } = await Subtext.parse(request.raw.req, request._tap(), request.route.settings.payload);
+
+        request._isPayloadPending = !!payload?._readableState;
+        request.mime = mime;
+        request.payload = payload;
+    }
+    catch (err) {
+        Bounce.rethrow(err, 'system');
+
+        await internals.drain(request);
+
+        request.mime = err.mime;
+        request.payload = null;
+
+        return request._core.toolkit.failAction(request, request.route.settings.payload.failAction, err, { tags: ['payload', 'error'] });
+    }
+};
+
+
+internals.drain = async function (request) {
+
+    // Flush out any pending request payload not consumed due to errors
+
+    if (request._expectContinue) {
+        request._isPayloadPending = false;        // If we don't continue, client should not send a payload
+        request._expectContinue = false;
+    }
+
+    if (request._isPayloadPending) {
+        await Streams.drain(request.raw.req);
+        request._isPayloadPending = false;
+    }
+};
+
+
+internals.config = function (chain) {
+
+    if (!chain.length) {
+        return {};
+    }
+
+    let config = chain[0];
+    for (const item of chain) {
+        config = Hoek.applyToDefaults(config, item, { shallow: ['bind', 'validate.headers', 'validate.payload', 'validate.params', 'validate.query', 'validate.state'] });
+    }
+
+    return config;
+};
+
+
+internals.rules = function (rules, info, server) {
+
+    const configs = [];
+
+    let realm = server.realm;
+    while (realm) {
+        if (realm._rules) {
+            const source = !realm._rules.settings.validate ? rules : Validate.attempt(rules, realm._rules.settings.validate.schema, realm._rules.settings.validate.options);
+            const config = realm._rules.processor(source, info);
+            if (config) {
+                configs.unshift(config);
+            }
+        }
+
+        realm = realm.parent;
+    }
+
+    return internals.config(configs);
+};
diff --git a/node_modules/@hapi/hapi/lib/security.js b/node_modules/@hapi/hapi/lib/security.js
new file mode 100755
index 0000000..de87761
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/security.js
@@ -0,0 +1,86 @@
+'use strict';
+
+const internals = {};
+
+
+exports.route = function (settings) {
+
+    if (!settings) {
+        return null;
+    }
+
+    const security = settings;
+    if (security.hsts) {
+        if (security.hsts === true) {
+            security._hsts = 'max-age=15768000';
+        }
+        else if (typeof security.hsts === 'number') {
+            security._hsts = 'max-age=' + security.hsts;
+        }
+        else {
+            security._hsts = 'max-age=' + (security.hsts.maxAge ?? 15768000);
+            if (security.hsts.includeSubdomains || security.hsts.includeSubDomains) {
+                security._hsts = security._hsts + '; includeSubDomains';
+            }
+
+            if (security.hsts.preload) {
+                security._hsts = security._hsts + '; preload';
+            }
+        }
+    }
+
+    if (security.xframe) {
+        if (security.xframe === true) {
+            security._xframe = 'DENY';
+        }
+        else if (typeof security.xframe === 'string') {
+            security._xframe = security.xframe.toUpperCase();
+        }
+        else if (security.xframe.rule === 'allow-from') {
+            if (!security.xframe.source) {
+                security._xframe = 'SAMEORIGIN';
+            }
+            else {
+                security._xframe = 'ALLOW-FROM ' + security.xframe.source;
+            }
+        }
+        else {
+            security._xframe = security.xframe.rule.toUpperCase();
+        }
+    }
+
+    return security;
+};
+
+
+exports.headers = function (response) {
+
+    const security = response.request.route.settings.security;
+
+    if (security._hsts) {
+        response._header('strict-transport-security', security._hsts, { override: false });
+    }
+
+    if (security._xframe) {
+        response._header('x-frame-options', security._xframe, { override: false });
+    }
+
+    if (security.xss === 'enabled') {
+        response._header('x-xss-protection', '1; mode=block', { override: false });
+    }
+    else if (security.xss === 'disabled') {
+        response._header('x-xss-protection', '0', { override: false });
+    }
+
+    if (security.noOpen) {
+        response._header('x-download-options', 'noopen', { override: false });
+    }
+
+    if (security.noSniff) {
+        response._header('x-content-type-options', 'nosniff', { override: false });
+    }
+
+    if (security.referrer !== false) {
+        response._header('referrer-policy', security.referrer, { override: false });
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/server.js b/node_modules/@hapi/hapi/lib/server.js
new file mode 100755
index 0000000..b5c7e10
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/server.js
@@ -0,0 +1,604 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Shot = require('@hapi/shot');
+const Teamwork = require('@hapi/teamwork');
+
+const Config = require('./config');
+const Core = require('./core');
+const Cors = require('./cors');
+const Ext = require('./ext');
+const Package = require('../package.json');
+const Route = require('./route');
+const Toolkit = require('./toolkit');
+const Validation = require('./validation');
+
+
+const internals = {};
+
+
+exports = module.exports = function (options) {
+
+    const core = new Core(options);
+    return new internals.Server(core);
+};
+
+
+internals.Server = class {
+
+    constructor(core, name, parent) {
+
+        this._core = core;
+
+        // Public interface
+
+        this.app = core.app;
+        this.auth = core.auth.public(this);
+        this.decorations = core.decorations.public;
+        this.cache = internals.cache(this);
+        this.events = core.events;
+        this.info = core.info;
+        this.listener = core.listener;
+        this.load = core.heavy.load;
+        this.methods = core.methods.methods;
+        this.mime = core.mime;
+        this.plugins = core.plugins;
+        this.registrations = core.registrations;
+        this.settings = core.settings;
+        this.states = core.states;
+        this.type = core.type;
+        this.version = Package.version;
+
+        this.realm = {
+            _extensions: {
+                onPreAuth: new Ext('onPreAuth', core),
+                onCredentials: new Ext('onCredentials', core),
+                onPostAuth: new Ext('onPostAuth', core),
+                onPreHandler: new Ext('onPreHandler', core),
+                onPostHandler: new Ext('onPostHandler', core),
+                onPreResponse: new Ext('onPreResponse', core),
+                onPostResponse: new Ext('onPostResponse', core)
+            },
+            modifiers: {
+                route: {}
+            },
+            parent: parent ? parent.realm : null,
+            plugin: name,
+            pluginOptions: {},
+            plugins: {},
+            _rules: null,
+            settings: {
+                bind: undefined,
+                files: {
+                    relativeTo: undefined
+                }
+            },
+            validator: null
+        };
+
+        // Decorations
+
+        for (const [property, method] of core.decorations.server.entries()) {
+            this[property] = method;
+        }
+
+        core.registerServer(this);
+    }
+
+    _clone(name) {
+
+        return new internals.Server(this._core, name, this);
+    }
+
+    bind(context) {
+
+        Hoek.assert(typeof context === 'object', 'bind must be an object');
+        this.realm.settings.bind = context;
+    }
+
+    control(server) {
+
+        Hoek.assert(server instanceof internals.Server, 'Can only control Server objects');
+
+        this._core.controlled = this._core.controlled ?? [];
+        this._core.controlled.push(server);
+    }
+
+    decoder(encoding, decoder) {
+
+        return this._core.compression.addDecoder(encoding, decoder);
+    }
+
+    decorate(type, property, method, options = {}) {
+
+        Hoek.assert(this._core.decorations.public[type], 'Unknown decoration type:', type);
+        Hoek.assert(property, 'Missing decoration property name');
+        Hoek.assert(typeof property === 'string' || typeof property === 'symbol', 'Decoration property must be a string or a symbol');
+
+        const propertyName = property.toString();
+        Hoek.assert(propertyName[0] !== '_', 'Property name cannot begin with an underscore:', propertyName);
+
+        const existing = this._core.decorations[type].get(property);
+        if (options.extend) {
+            Hoek.assert(type !== 'handler', 'Cannot extend handler decoration:', propertyName);
+            Hoek.assert(existing, `Cannot extend missing ${type} decoration: ${propertyName}`);
+            Hoek.assert(typeof method === 'function', `Extended ${type} decoration method must be a function: ${propertyName}`);
+
+            method = method(existing);
+        }
+        else {
+            Hoek.assert(existing === undefined, `${type[0].toUpperCase() + type.slice(1)} decoration already defined: ${propertyName}`);
+        }
+
+        if (type === 'handler') {
+
+            // Handler
+
+            Hoek.assert(typeof method === 'function', 'Handler must be a function:', propertyName);
+            Hoek.assert(!method.defaults || typeof method.defaults === 'object' || typeof method.defaults === 'function', 'Handler defaults property must be an object or function');
+            Hoek.assert(!options.extend, 'Cannot extend handler decoration:', propertyName);
+        }
+        else if (type === 'request') {
+
+            // Request
+
+            Hoek.assert(!this._core.Request.reserved.includes(property), 'Cannot override the built-in request interface decoration:', propertyName);
+
+            if (options.apply) {
+                this._core.decorations.requestApply = this._core.decorations.requestApply ?? new Map();
+                this._core.decorations.requestApply.set(property, method);
+            }
+            else {
+                this._core.Request.prototype[property] = method;
+            }
+        }
+        else if (type === 'response') {
+
+            // Response
+
+            Hoek.assert(!this._core.Response.reserved.includes(property), 'Cannot override the built-in response interface decoration:', propertyName);
+            this._core.Response.prototype[property] = method;
+        }
+        else if (type === 'toolkit') {
+
+            // Toolkit
+
+            Hoek.assert(!Toolkit.reserved.includes(property), 'Cannot override the built-in toolkit decoration:', propertyName);
+            this._core.toolkit.decorate(property, method);
+        }
+        else {
+
+            // Server
+
+            if (typeof property === 'string') {
+                Hoek.assert(!Object.getOwnPropertyNames(internals.Server.prototype).includes(property), 'Cannot override the built-in server interface method:', propertyName);
+            }
+            else {
+                Hoek.assert(!Object.getOwnPropertySymbols(internals.Server.prototype).includes(property), 'Cannot override the built-in server interface method:', propertyName);
+            }
+
+            this._core.instances.forEach((server) => {
+
+                server[property] = method;
+            });
+        }
+
+        this._core.decorations[type].set(property, method);
+        this._core.decorations.public[type].push(property);
+    }
+
+    dependency(dependencies, after) {
+
+        Hoek.assert(this.realm.plugin, 'Cannot call dependency() outside of a plugin');
+        Hoek.assert(!after || typeof after === 'function', 'Invalid after method');
+
+        // Normalize to { plugin: version }
+
+        if (typeof dependencies === 'string') {
+            dependencies = { [dependencies]: '*' };
+        }
+        else if (Array.isArray(dependencies)) {
+            const map = {};
+            for (const dependency of dependencies) {
+                map[dependency] = '*';
+            }
+
+            dependencies = map;
+        }
+
+        this._core.dependencies.push({ plugin: this.realm.plugin, deps: dependencies });
+
+        if (after) {
+            this.ext('onPreStart', after, { after: Object.keys(dependencies) });
+        }
+    }
+
+    encoder(encoding, encoder) {
+
+        return this._core.compression.addEncoder(encoding, encoder);
+    }
+
+    event(event) {
+
+        this._core.events.registerEvent(event);
+    }
+
+    expose(key, value, options = {}) {
+
+        Hoek.assert(this.realm.plugin, 'Cannot call expose() outside of a plugin');
+
+        let plugin = this.realm.plugin;
+        if (plugin[0] === '@' &&
+            options.scope !== true) {
+
+            plugin = plugin.replace(/^@([^/]+)\//, ($0, $1) => {
+
+                return !options.scope ? '' : `${$1}__`;
+            });
+        }
+
+        this._core.plugins[plugin] = this._core.plugins[plugin] ?? {};
+
+        if (typeof key === 'string') {
+            this._core.plugins[plugin][key] = value;
+        }
+        else {
+            Hoek.merge(this._core.plugins[plugin], key);
+        }
+    }
+
+    ext(events, method, options) {        // (event, method, options) -OR- (events)
+
+        let promise;
+        if (typeof events === 'string') {
+            if (!method) {
+                const team = new Teamwork.Team();
+                method = (request, h) => {
+
+                    team.attend(request);
+                    return h.continue;
+                };
+
+                promise = team.work;
+            }
+
+            events = { type: events, method, options };
+        }
+
+        events = Config.apply('exts', events);
+        for (const event of events) {
+            this._ext(event);
+        }
+
+        return promise;
+    }
+
+    _ext(event) {
+
+        event = Object.assign({}, event);       // Shallow cloned
+        event.realm = this.realm;
+        const type = event.type;
+
+        if (!this._core.extensions.server[type]) {
+
+            // Realm route extensions
+
+            if (event.options.sandbox === 'plugin') {
+                Hoek.assert(this.realm._extensions[type], 'Unknown event type', type);
+                return this.realm._extensions[type].add(event);
+            }
+
+            // Connection route extensions
+
+            Hoek.assert(this._core.extensions.route[type], 'Unknown event type', type);
+            return this._core.extensions.route[type].add(event);
+        }
+
+        // Server extensions
+
+        Hoek.assert(!event.options.sandbox, 'Cannot specify sandbox option for server extension');
+        Hoek.assert(type !== 'onPreStart' || this._core.phase === 'stopped', 'Cannot add onPreStart (after) extension after the server was initialized');
+
+        event.server = this;
+        this._core.extensions.server[type].add(event);
+    }
+
+    async inject(options) {
+
+        let settings = options;
+        if (typeof settings === 'string') {
+            settings = { url: settings };
+        }
+
+        if (!settings.authority ||
+            settings.auth ||
+            settings.app ||
+            settings.plugins ||
+            settings.allowInternals !== undefined) {        // Can be false
+
+            settings = Object.assign({}, settings);         // options can be reused (shallow cloned)
+            delete settings.auth;
+            delete settings.app;
+            delete settings.plugins;
+            delete settings.allowInternals;
+
+            settings.authority = settings.authority ?? this._core.info.host + ':' + this._core.info.port;
+        }
+
+        Hoek.assert(!options.credentials, 'options.credentials no longer supported (use options.auth)');
+
+        if (options.auth) {
+            Hoek.assert(typeof options.auth === 'object', 'options.auth must be an object');
+            Hoek.assert(options.auth.credentials, 'options.auth.credentials is missing');
+            Hoek.assert(options.auth.strategy, 'options.auth.strategy is missing');
+        }
+
+        const needle = this._core._dispatch({
+            auth: options.auth,
+            allowInternals: options.allowInternals,
+            app: options.app,
+            plugins: options.plugins,
+            isInjected: true
+        });
+
+        const res = await Shot.inject(needle, settings);
+        const custom = res.raw.res[Config.symbol];
+        if (custom) {
+            delete res.raw.res[Config.symbol];
+
+            res.request = custom.request;
+
+            if (custom.error) {
+                throw custom.error;
+            }
+
+            if (custom.result !== undefined) {
+                res.result = custom.result;
+            }
+        }
+
+        if (res.result === undefined) {
+            res.result = res.payload;
+        }
+
+        return res;
+    }
+
+    log(tags, data) {
+
+        return this._core.log(tags, data);
+    }
+
+    lookup(id) {
+
+        Hoek.assert(id && typeof id === 'string', 'Invalid route id:', id);
+
+        const record = this._core.router.ids.get(id);
+        if (!record) {
+            return null;
+        }
+
+        return record.route.public;
+    }
+
+    match(method, path, host) {
+
+        Hoek.assert(method && typeof method === 'string', 'Invalid method:', method);
+        Hoek.assert(path && typeof path === 'string' && path[0] === '/', 'Invalid path:', path);
+        Hoek.assert(!host || typeof host === 'string', 'Invalid host:', host);
+
+        const match = this._core.router.route(method.toLowerCase(), path, host);
+        Hoek.assert(match !== this._core.router.specials.badRequest, 'Invalid path:', path);
+        if (match === this._core.router.specials.notFound) {
+            return null;
+        }
+
+        return match.route.public;
+    }
+
+    method(name, method, options = {}) {
+
+        return this._core.methods.add(name, method, options, this.realm);
+    }
+
+    path(relativeTo) {
+
+        Hoek.assert(relativeTo && typeof relativeTo === 'string', 'relativeTo must be a non-empty string');
+        this.realm.settings.files.relativeTo = relativeTo;
+    }
+
+    async register(plugins, options = {}) {
+
+        if (this.realm.modifiers.route.prefix ||
+            this.realm.modifiers.route.vhost) {
+
+            options = Hoek.clone(options);
+            options.routes = options.routes ?? {};
+
+            options.routes.prefix = (this.realm.modifiers.route.prefix ?? '') + (options.routes.prefix ?? '') || undefined;
+            options.routes.vhost = this.realm.modifiers.route.vhost ?? options.routes.vhost;
+        }
+
+        options = Config.apply('register', options);
+
+        ++this._core.registring;
+
+        try {
+            const items = [].concat(plugins);
+            for (let item of items) {
+
+                /*
+                    { register, ...attributes }
+                    { plugin: { register, ...attributes }, options, once, routes }
+                    { plugin: { plugin: { register, ...attributes } }, options, once, routes }      // Required module
+                */
+
+                if (!item.plugin) {
+                    item = {
+                        plugin: item
+                    };
+                }
+                else if (!item.plugin.register) {
+                    item = {
+                        options: item.options,
+                        once: item.once,
+                        routes: item.routes,
+                        plugin: item.plugin.plugin
+                    };
+                }
+                else if (typeof item === 'function') {
+                    item = Object.assign({}, item);         // Shallow cloned
+                }
+
+                item = Config.apply('plugin', item);
+
+                const name = item.plugin.name ?? item.plugin.pkg.name;
+                const clone = this._clone(name);
+
+                clone.realm.modifiers.route.prefix = item.routes.prefix ?? options.routes.prefix;
+                clone.realm.modifiers.route.vhost = item.routes.vhost ?? options.routes.vhost;
+                clone.realm.pluginOptions = item.options ?? {};
+
+                // Validate requirements
+
+                const requirements = item.plugin.requirements;
+                Hoek.assert(!requirements.node || Config.versionMatch(process.version, requirements.node), 'Plugin', name, 'requires node version', requirements.node, 'but found', process.version);
+                Hoek.assert(!requirements.hapi || Config.versionMatch(this.version, requirements.hapi), 'Plugin', name, 'requires hapi version', requirements.hapi, 'but found', this.version);
+
+                // Protect against multiple registrations
+
+                if (this._core.registrations[name]) {
+                    if (item.plugin.once ||
+                        item.once ||
+                        options.once) {
+
+                        continue;
+                    }
+
+                    Hoek.assert(item.plugin.multiple, 'Plugin', name, 'already registered');
+                }
+                else {
+                    this._core.registrations[name] = {
+                        version: item.plugin.version ?? item.plugin.pkg.version,
+                        name,
+                        options: item.options
+                    };
+                }
+
+                if (item.plugin.dependencies) {
+                    clone.dependency(item.plugin.dependencies);
+                }
+
+                // Register
+
+                await item.plugin.register(clone, item.options ?? {});
+            }
+        }
+        finally {
+            --this._core.registring;
+        }
+
+        return this;
+    }
+
+    route(options) {
+
+        Hoek.assert(typeof options === 'object', 'Invalid route options');
+
+        options = [].concat(options);
+        for (const config of options) {
+            if (Array.isArray(config.method)) {
+                for (const method of config.method) {
+                    const settings = Object.assign({}, config);     // Shallow cloned
+                    settings.method = method;
+                    this._addRoute(settings, this);
+                }
+            }
+            else {
+                this._addRoute(config, this);
+            }
+        }
+    }
+
+    _addRoute(config, server) {
+
+        const route = new Route(config, server);                        // Do no use config beyond this point, use route members
+        const vhosts = [].concat(route.settings.vhost ?? '*');
+
+        for (const vhost of vhosts) {
+            const record = this._core.router.add({ method: route.method, path: route.path, vhost, analysis: route._analysis, id: route.settings.id }, route);
+            route.fingerprint = record.fingerprint;
+            route.params = record.params;
+        }
+
+        this.events.emit('route', route.public);
+        Cors.options(route.public, server);
+    }
+
+    rules(processor, options = {}) {
+
+        Hoek.assert(!this.realm._rules, 'Server realm rules already defined');
+
+        const settings = Config.apply('rules', options);
+        if (settings.validate) {
+            const schema = settings.validate.schema;
+            settings.validate.schema = Validation.compile(schema, null, this.realm, this._core);
+        }
+
+        this.realm._rules = { processor, settings };
+    }
+
+    state(name, options) {
+
+        this.states.add(name, options);
+    }
+
+    table(host) {
+
+        return this._core.router.table(host);
+    }
+
+    validator(validator) {
+
+        Hoek.assert(!this.realm.validator, 'Validator already set');
+
+        this.realm.validator = Validation.validator(validator);
+    }
+
+    start() {
+
+        return this._core._start();
+    }
+
+    initialize() {
+
+        return this._core._initialize();
+    }
+
+    stop(options) {
+
+        return this._core._stop(options);
+    }
+};
+
+
+internals.cache = (plugin) => {
+
+    const policy = function (options, _segment) {
+
+        return this._core._cachePolicy(options, _segment, plugin.realm);
+    };
+
+    policy.provision = async (opts) => {
+
+        const clients = plugin._core._createCache(opts);
+
+        // Start cache
+
+        if (['initialized', 'starting', 'started'].includes(plugin._core.phase)) {
+            await Promise.all(clients.map((client) => client.start()));
+        }
+    };
+
+    return policy;
+};
diff --git a/node_modules/@hapi/hapi/lib/streams.js b/node_modules/@hapi/hapi/lib/streams.js
new file mode 100755
index 0000000..9316b9e
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/streams.js
@@ -0,0 +1,62 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Boom = require('@hapi/boom');
+const Teamwork = require('@hapi/teamwork');
+
+const internals = {
+    team: Symbol('team')
+};
+
+
+exports.isStream = function (stream) {
+
+    const isReadableStream = stream instanceof Stream.Readable;
+
+    if (!isReadableStream &&
+        typeof stream?.pipe === 'function') {
+        throw Boom.badImplementation('Cannot reply with a stream-like object that is not an instance of Stream.Readable');
+    }
+
+    if (!isReadableStream) {
+        return false;
+    }
+
+    if (stream.readableObjectMode) {
+        throw Boom.badImplementation('Cannot reply with stream in object mode');
+    }
+
+    return true;
+};
+
+
+exports.drain = function (stream) {
+
+    const team = new Teamwork.Team();
+    stream[internals.team] = team;
+
+    stream.on('readable', internals.read);
+    stream.on('error', internals.end);
+    stream.on('end', internals.end);
+    stream.on('close', internals.end);
+
+    return team.work;
+};
+
+
+internals.read = function () {
+
+    while (this.read()) { }
+};
+
+
+internals.end = function () {
+
+    this.removeListener('readable', internals.read);
+    this.removeListener('error', internals.end);
+    this.removeListener('end', internals.end);
+    this.removeListener('close', internals.end);
+
+    this[internals.team].attend();
+};
diff --git a/node_modules/@hapi/hapi/lib/toolkit.js b/node_modules/@hapi/hapi/lib/toolkit.js
new file mode 100755
index 0000000..6fdd76d
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/toolkit.js
@@ -0,0 +1,258 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports.reserved = [
+    'abandon',
+    'authenticated',
+    'close',
+    'context',
+    'continue',
+    'entity',
+    'redirect',
+    'realm',
+    'request',
+    'response',
+    'state',
+    'unauthenticated',
+    'unstate'
+];
+
+
+exports.symbols = {
+    abandon: Symbol('abandon'),
+    close: Symbol('close'),
+    continue: Symbol('continue')
+};
+
+
+exports.Manager = class {
+
+    constructor() {
+
+        this._toolkit = internals.toolkit();
+    }
+
+    async execute(method, request, options) {
+
+        const h = new this._toolkit(request, options);
+        const bind = options.bind ?? null;
+
+        try {
+            let operation;
+
+            if (bind) {
+                operation = method.call(bind, request, h);
+            }
+            else if (options.args) {
+                operation = method(request, h, ...options.args);
+            }
+            else {
+                operation = method(request, h);
+            }
+
+            var response = await exports.timed(operation, options);
+        }
+        catch (err) {
+            if (Bounce.isSystem(err)) {
+                response = Boom.badImplementation(err);
+            }
+            else if (!Bounce.isError(err)) {
+                response = Boom.badImplementation('Cannot throw non-error object', err);
+            }
+            else {
+                response = Boom.boomify(err);
+            }
+        }
+
+        // Process response
+
+        if (options.ignoreResponse) {
+            return response;
+        }
+
+        if (response === undefined) {
+            response = Boom.badImplementation(`${method.name} method did not return a value, a promise, or throw an error`);
+        }
+
+        if (options.continue &&
+            response === exports.symbols.continue) {
+
+            if (options.continue === 'undefined') {
+                return;
+            }
+
+            // 'null'
+
+            response = null;
+        }
+
+        if (options.auth &&
+            response instanceof internals.Auth) {
+
+            return response;
+        }
+
+        if (typeof response !== 'symbol') {
+            response = request._core.Response.wrap(response, request);
+            if (!response.isBoom && response._state === 'init') {
+                await response._prepare();
+            }
+        }
+
+        return response;
+    }
+
+    decorate(name, method) {
+
+        this._toolkit.prototype[name] = method;
+    }
+
+    async failAction(request, failAction, err, options) {
+
+        const retain = options.retain ? err : undefined;
+        if (failAction === 'ignore') {
+            return retain;
+        }
+
+        if (failAction === 'log') {
+            request._log(options.tags, err);
+            return retain;
+        }
+
+        if (failAction === 'error') {
+            throw err;
+        }
+
+        return await this.execute(failAction, request, { realm: request.route.realm, args: [options.details ?? err] });
+    }
+};
+
+
+exports.timed = async function (method, options) {
+
+    if (!options.timeout) {
+        return method;
+    }
+
+    const timer = new Promise((resolve, reject) => {
+
+        const handler = () => {
+
+            reject(Boom.internal(`${options.name} timed out`));
+        };
+
+        setTimeout(handler, options.timeout);
+    });
+
+    return await Promise.race([timer, method]);
+};
+
+
+/*
+    const handler = function (request, h) {
+
+        result / h.response(result)         -> result                           // Not allowed before handler
+        h.response(result).takeover()       -> result (respond)
+        h.continue                          -> null                             // Defaults to null only in handler and pre, not allowed in auth
+
+        throw error / h.response(error)     -> error (respond)                  // failAction override in pre
+        <undefined>                         -> badImplementation (respond)
+
+        // Auth only (scheme.payload and scheme.response use the same interface as pre-handler extension methods)
+
+        h.unauthenticated(error, data)      -> error (respond) + data
+        h.authenticated(data )              -> (continue) + data
+    };
+*/
+
+internals.toolkit = function () {
+
+    const Toolkit = class {
+
+        constructor(request, options) {
+
+            this.context = options.bind;
+            this.realm = options.realm;
+            this.request = request;
+
+            this._auth = options.auth;
+        }
+
+        response(result) {
+
+            Hoek.assert(!result || typeof result !== 'object' || typeof result.then !== 'function', 'Cannot wrap a promise');
+            Hoek.assert(result instanceof Error === false, 'Cannot wrap an error');
+            Hoek.assert(typeof result !== 'symbol', 'Cannot wrap a symbol');
+
+            return this.request._core.Response.wrap(result, this.request);
+        }
+
+        redirect(location) {
+
+            return this.response('').redirect(location);
+        }
+
+        entity(options) {
+
+            Hoek.assert(options, 'Entity method missing required options');
+            Hoek.assert(options.etag || options.modified, 'Entity methods missing required options key');
+
+            this.request._entity = options;
+
+            const entity = this.request._core.Response.entity(options.etag, options);
+            if (this.request._core.Response.unmodified(this.request, entity)) {
+                return this.response().code(304).takeover();
+            }
+        }
+
+        state(name, value, options) {
+
+            this.request._setState(name, value, options);
+        }
+
+        unstate(name, options) {
+
+            this.request._clearState(name, options);
+        }
+
+        authenticated(data) {
+
+            Hoek.assert(this._auth, 'Method not supported outside of authentication');
+            Hoek.assert(data?.credentials, 'Authentication data missing credentials information');
+
+            return new internals.Auth(null, data);
+        }
+
+        unauthenticated(error, data) {
+
+            Hoek.assert(this._auth, 'Method not supported outside of authentication');
+            Hoek.assert(!data || data.credentials, 'Authentication data missing credentials information');
+
+            return new internals.Auth(error, data);
+        }
+    };
+
+    Toolkit.prototype.abandon = exports.symbols.abandon;
+    Toolkit.prototype.close = exports.symbols.close;
+    Toolkit.prototype.continue = exports.symbols.continue;
+
+    return Toolkit;
+};
+
+
+internals.Auth = class {
+
+    constructor(error, data) {
+
+        this.isAuth = true;
+        this.error = error;
+        this.data = data;
+    }
+};
diff --git a/node_modules/@hapi/hapi/lib/transmit.js b/node_modules/@hapi/hapi/lib/transmit.js
new file mode 100755
index 0000000..dafd2e3
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/transmit.js
@@ -0,0 +1,388 @@
+'use strict';
+
+const Http = require('http');
+
+const Ammo = require('@hapi/ammo');
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+const Teamwork = require('@hapi/teamwork');
+
+const Config = require('./config');
+
+
+const internals = {};
+
+
+exports.send = async function (request) {
+
+    const response = request.response;
+
+    try {
+        if (response.isBoom) {
+            await internals.fail(request, response);
+            return;
+        }
+
+        await internals.marshal(response);
+        await internals.transmit(response);
+    }
+    catch (err) {
+        Bounce.rethrow(err, 'system');
+        request._setResponse(err);
+        return internals.fail(request, err);
+    }
+};
+
+
+internals.marshal = async function (response) {
+
+    for (const func of response.request._route._marshalCycle) {
+        await func(response);
+    }
+};
+
+
+internals.fail = async function (request, boom) {
+
+    const response = internals.error(request, boom);
+    request.response = response;                                // Not using request._setResponse() to avoid double log
+
+    try {
+        await internals.marshal(response);
+    }
+    catch (err) {
+        Bounce.rethrow(err, 'system');
+
+        // Failed to marshal an error - replace with minimal representation of original error
+
+        const minimal = {
+            statusCode: response.statusCode,
+            error: Http.STATUS_CODES[response.statusCode],
+            message: boom.message
+        };
+
+        response._payload = new request._core.Response.Payload(JSON.stringify(minimal), {});
+    }
+
+    return internals.transmit(response);
+};
+
+
+internals.error = function (request, boom) {
+
+    const error = boom.output;
+    const response = new request._core.Response(error.payload, request, { error: boom });
+    response.code(error.statusCode);
+    response.headers = Hoek.clone(error.headers);               // Prevent source from being modified
+    return response;
+};
+
+
+internals.transmit = function (response) {
+
+    const request = response.request;
+    const length = internals.length(response);
+
+    // Pipes
+
+    const encoding = request._core.compression.encoding(response, length);
+    const ranger = encoding ? null : internals.range(response, length);
+    const compressor = internals.encoding(response, encoding);
+
+    // Connection: close
+
+    const isInjection = request.isInjected;
+    if (!(isInjection || request._core.started) ||
+        request._isPayloadPending && !request.raw.req._readableState.ended) {
+
+        response._header('connection', 'close');
+    }
+
+    // Write headers
+
+    internals.writeHead(response);
+
+    // Injection
+
+    if (isInjection) {
+        request.raw.res[Config.symbol] = { request };
+
+        if (response.variety === 'plain') {
+            request.raw.res[Config.symbol].result = response._isPayloadSupported() ? response.source : null;
+        }
+    }
+
+    // Finalize response stream
+
+    const stream = internals.chain([response._payload, response._tap(), compressor, ranger]);
+    return internals.pipe(request, stream);
+};
+
+
+internals.length = function (response) {
+
+    const request = response.request;
+
+    const header = response.headers['content-length'];
+    if (header === undefined) {
+        return null;
+    }
+
+    let length = header;
+    if (typeof length === 'string') {
+        length = parseInt(header, 10);
+        if (!isFinite(length)) {
+            delete response.headers['content-length'];
+            return null;
+        }
+    }
+
+    // Empty response
+
+    if (length === 0 &&
+        !response._statusCode &&
+        response.statusCode === 200 &&
+        request.route.settings.response.emptyStatusCode !== 200) {
+
+        response.code(204);
+        delete response.headers['content-length'];
+    }
+
+    return length;
+};
+
+
+internals.range = function (response, length) {
+
+    const request = response.request;
+
+    if (!length ||
+        !request.route.settings.response.ranges ||
+        request.method !== 'get' ||
+        response.statusCode !== 200) {
+
+        return null;
+    }
+
+    response._header('accept-ranges', 'bytes');
+
+    if (!request.headers.range) {
+        return null;
+    }
+
+    // Check If-Range
+
+    if (request.headers['if-range'] &&
+        request.headers['if-range'] !== response.headers.etag) {            // Ignoring last-modified date (weak)
+
+        return null;
+    }
+
+    // Parse header
+
+    const ranges = Ammo.header(request.headers.range, length);
+    if (!ranges) {
+        const error = Boom.rangeNotSatisfiable();
+        error.output.headers['content-range'] = 'bytes */' + length;
+        throw error;
+    }
+
+    // Prepare transform
+
+    if (ranges.length !== 1) {                                              // Ignore requests for multiple ranges
+        return null;
+    }
+
+    const range = ranges[0];
+    response.code(206);
+    response.bytes(range.to - range.from + 1);
+    response._header('content-range', 'bytes ' + range.from + '-' + range.to + '/' + length);
+
+    return new Ammo.Clip(range);
+};
+
+
+internals.encoding = function (response, encoding) {
+
+    const request = response.request;
+
+    const header = response.headers['content-encoding'] || encoding;
+    if (header &&
+        response.headers.etag &&
+        response.settings.varyEtag) {
+
+        response.headers.etag = response.headers.etag.slice(0, -1) + '-' + header + '"';
+    }
+
+    if (!encoding ||
+        response.statusCode === 206 ||
+        !response._isPayloadSupported()) {
+
+        return null;
+    }
+
+    delete response.headers['content-length'];
+    response._header('content-encoding', encoding);
+    const compressor = request._core.compression.encoder(request, encoding);
+    if (response.variety === 'stream' &&
+        typeof response._payload.setCompressor === 'function') {
+
+        response._payload.setCompressor(compressor);
+    }
+
+    return compressor;
+};
+
+
+internals.pipe = function (request, stream) {
+
+    const team = new Teamwork.Team();
+
+    // Write payload
+
+    const env = { stream, request, team };
+
+    if (request._closed) {
+
+        // The request has already been aborted - no need to wait or attempt to write.
+
+        internals.end(env, 'aborted');
+        return team.work;
+    }
+
+    const aborted = internals.end.bind(null, env, 'aborted');
+    const close = internals.end.bind(null, env, 'close');
+    const end = internals.end.bind(null, env, null);
+
+    request.raw.req.on('aborted', aborted);
+
+    request.raw.res.on('close', close);
+    request.raw.res.on('error', end);
+    request.raw.res.on('finish', end);
+
+    if (stream.writeToStream) {
+        stream.writeToStream(request.raw.res);
+    }
+    else {
+        stream.on('error', end);
+        stream.on('close', aborted);
+        stream.pipe(request.raw.res);
+    }
+
+    return team.work;
+};
+
+
+internals.end = function (env, event, err) {
+
+    const { request, stream, team } = env;
+
+    if (!team) {                                                        // Used instead of cleaning up emitter listeners
+        return;
+    }
+
+    env.team = null;
+
+    if (request.raw.res.writableEnded) {
+        request.info.responded = Date.now();
+
+        team.attend();
+        return;
+    }
+
+    if (err) {
+        request.raw.res.destroy();
+        request._core.Response.drain(stream);
+    }
+
+    // Update reported response to reflect the error condition
+
+    const origResponse = request.response;
+    const error = err ? Boom.boomify(err) :
+        new Boom.Boom(`Request ${event}`, { statusCode: request.route.settings.response.disconnectStatusCode, data: origResponse });
+
+    request._setResponse(error);
+
+    // Make inject throw a disconnect error
+
+    if (request.raw.res[Config.symbol]) {
+        request.raw.res[Config.symbol].error = event ? error :
+            new Boom.Boom(`Response error`, { statusCode: request.route.settings.response.disconnectStatusCode, data: origResponse });
+    }
+
+    if (event) {
+        request._log(['response', 'error', event]);
+    }
+    else {
+        request._log(['response', 'error'], err);
+    }
+
+    request.raw.res.end();                                          // Triggers injection promise resolve
+    team.attend();
+};
+
+
+internals.writeHead = function (response) {
+
+    const res = response.request.raw.res;
+    const headers = Object.keys(response.headers);
+    let i = 0;
+
+    try {
+        for (; i < headers.length; ++i) {
+            const header = headers[i];
+            const value = response.headers[header];
+            if (value !== undefined) {
+                res.setHeader(header, value);
+            }
+        }
+    }
+    catch (err) {
+        for (--i; i >= 0; --i) {
+            res.removeHeader(headers[i]);       // Undo headers
+        }
+
+        throw Boom.boomify(err);
+    }
+
+    if (response.settings.message) {
+        res.statusMessage = response.settings.message;
+    }
+
+    try {
+        res.writeHead(response.statusCode);
+    }
+    catch (err) {
+        throw Boom.boomify(err);
+    }
+};
+
+
+internals.chain = function (sources) {
+
+    let from = sources[0];
+    for (let i = 1; i < sources.length; ++i) {
+        const to = sources[i];
+        if (to) {
+            from.on('close', internals.destroyPipe.bind(from, to));
+            from.on('error', internals.errorPipe.bind(from, to));
+            from = from.pipe(to);
+        }
+    }
+
+    return from;
+};
+
+
+internals.destroyPipe = function (to) {
+
+    if (!this.readableEnded && !this.errored) {
+        to.destroy();
+    }
+};
+
+internals.errorPipe = function (to, err) {
+
+    to.emit('error', err);
+};
diff --git a/node_modules/@hapi/hapi/lib/types/index.d.ts b/node_modules/@hapi/hapi/lib/types/index.d.ts
new file mode 100644
index 0000000..aa19b22
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/index.d.ts
@@ -0,0 +1,21 @@
+// Definitions adapted from DefinitelyTyped, originally created by:
+// Rafael Souza Fijalkowski <https://github.com/rafaelsouzaf>
+// Justin Simms <https://github.com/jhsimms>
+// Simon Schick <https://github.com/SimonSchick>
+// Rodrigo Saboya <https://github.com/saboya>
+// Silas Rech <https://github.com/lenovouser>
+
+export * from './plugin';
+export * from './response';
+export * from './request';
+export * from './route';
+export * from './server';
+export * from './utils';
+
+// Kept for backwards compatibility only (remove in next major)
+
+export namespace Utils {
+    interface Dictionary<T> {
+        [key: string]: T;
+    }
+}
diff --git a/node_modules/@hapi/hapi/lib/types/plugin.d.ts b/node_modules/@hapi/hapi/lib/types/plugin.d.ts
new file mode 100644
index 0000000..017d25f
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/plugin.d.ts
@@ -0,0 +1,266 @@
+import { RequestRoute } from './request';
+import { RouteOptions } from './route';
+import { Server } from './server';
+import { Lifecycle } from './utils';
+
+/**
+ * one of
+ * a single plugin name string.
+ * an array of plugin name strings.
+ * an object where each key is a plugin name and each matching value is a
+ * {@link https://www.npmjs.com/package/semver version range string} which must match the registered
+ *  plugin version.
+ */
+export type Dependencies = string | string[] | Record<string, string>;
+
+/**
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverregistrations)
+ */
+export interface PluginsListRegistered {
+}
+
+/**
+ * An object of the currently registered plugins where each key is a registered plugin name and the value is an
+ * object containing:
+ * * version - the plugin version.
+ * * name - the plugin name.
+ * * options - (optional) options passed to the plugin during registration.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverregistrations)
+ */
+export interface PluginRegistered {
+    /**
+     * the plugin version.
+     */
+    version: string;
+
+    /**
+     * the plugin name.
+     */
+    name: string;
+
+    /**
+     * options used to register the plugin.
+     */
+    options: object;
+}
+
+export interface PluginsStates {
+}
+
+export interface PluginSpecificConfiguration {
+}
+
+export interface PluginNameVersion {
+    /**
+     * (required) the plugin name string. The name is used as a unique key. Published plugins (e.g. published in the npm
+     * registry) should use the same name as the name field in their 'package.json' file. Names must be
+     * unique within each application.
+     */
+    name: string;
+
+    /**
+     * optional plugin version. The version is only used informatively to enable other plugins to find out the versions loaded. The version should be the same as the one specified in the plugin's
+     * 'package.json' file.
+     */
+    version?: string | undefined;
+}
+
+export interface PluginPackage {
+    /**
+     * Alternatively, the name and version can be included via the pkg property containing the 'package.json' file for the module which already has the name and version included
+     */
+    pkg: PluginNameVersion;
+}
+
+export interface PluginBase<T, D> {
+    /**
+     * (required) the registration function with the signature async function(server, options) where:
+     * * server - the server object with a plugin-specific server.realm.
+     * * options - any options passed to the plugin during registration via server.register().
+     */
+    register: (server: Server, options: T) => void | Promise<void>;
+
+    /** (optional) if true, allows the plugin to be registered multiple times with the same server. Defaults to false. */
+    multiple?: boolean | undefined;
+
+    /** (optional) a string or an array of strings indicating a plugin dependency. Same as setting dependencies via server.dependency(). */
+    dependencies?: Dependencies | undefined;
+
+    /**
+     * Allows defining semver requirements for node and hapi.
+     * @default Allows all.
+     */
+    requirements?: {
+        node?: string | undefined;
+        hapi?: string | undefined;
+    } | undefined;
+
+    /** once - (optional) if true, will only register the plugin once per server. If set, overrides the once option passed to server.register(). Defaults to no override. */
+    once?: boolean | undefined;
+
+    /**
+    * We need to use D within the PluginBase type to be able to infer it later on,
+    * but this property has no concrete existence in the code.
+    *
+    * See https://github.com/Microsoft/TypeScript/wiki/FAQ#why-doesnt-type-inference-work-on-this-interface-interface-foot-- for details.
+    */
+    ___$type_of_plugin_decorations$___?: D;
+}
+
+/**
+ * A plugin that is registered by name and version.
+ */
+export interface NamedPlugin<T, D = void> extends PluginBase<T, D>, PluginNameVersion {}
+
+/**
+ * A plugin that is registered by its package.json file.
+ */
+export interface PackagedPlugin<T, D = void> extends PluginBase<T, D>, PluginPackage {}
+
+
+/**
+ * Plugins provide a way to organize application code by splitting the server logic into smaller components. Each
+ * plugin can manipulate the server through the standard server interface, but with the added ability to sandbox
+ * certain properties. For example, setting a file path in one plugin doesn't affect the file path set
+ * in another plugin.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#plugins)
+ *
+ * The type T is the type of the plugin options.
+ */
+export type Plugin<T, D = void> = NamedPlugin<T, D> | PackagedPlugin<T, D>;
+
+/**
+ * The realm object contains sandboxed server settings specific to each plugin or authentication strategy. When registering a plugin or an authentication scheme, a server object reference is provided
+ * with a new server.realm container specific to that registration. It allows each plugin to maintain its own settings without leaking and affecting other plugins. For example, a plugin can set a
+ * default file path for local resources without breaking other plugins' configured paths. When calling server.bind(), the active realm's settings.bind property is set which is then used by routes
+ * and extensions added at the same level (server root or plugin).
+ *
+ * https://github.com/hapijs/hapi/blob/master/API.md#server.realm
+ */
+export interface ServerRealm {
+    /** when the server object is provided as an argument to the plugin register() method, modifiers provides the registration preferences passed the server.register() method and includes: */
+    modifiers: {
+        /** routes preferences: */
+        route: {
+            /**
+             * the route path prefix used by any calls to server.route() from the server. Note that if a prefix is used and the route path is set to '/', the resulting path will not include
+             * the trailing slash.
+             */
+            prefix: string;
+            /** the route virtual host settings used by any calls to server.route() from the server. */
+            vhost: string;
+        }
+    };
+    /** the realm of the parent server object, or null for the root server. */
+    parent: ServerRealm | null;
+    /** the active plugin name (empty string if at the server root). */
+    plugin: string;
+    /** the plugin options object passed at registration. */
+    pluginOptions: object;
+    /** plugin-specific state to be shared only among activities sharing the same active state. plugins is an object where each key is a plugin name and the value is the plugin state. */
+    plugins: PluginsStates;
+    /** settings overrides */
+    settings: {
+        files: {
+            relativeTo: string;
+        };
+        bind: object;
+    };
+}
+
+/**
+ * Registration options (different from the options passed to the registration function):
+ * * once - if true, subsequent registrations of the same plugin are skipped without error. Cannot be used with plugin options. Defaults to false. If not set to true, an error will be thrown the
+ * second time a plugin is registered on the server.
+ * * routes - modifiers applied to each route added by the plugin:
+ * * * prefix - string added as prefix to any route path (must begin with '/'). If a plugin registers a child plugin the prefix is passed on to the child or is added in front of the child-specific
+ * prefix.
+ * * * vhost - virtual host string (or array of strings) applied to every route. The outer-most vhost overrides the any nested configuration.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverregisterplugins-options)
+ */
+export interface ServerRegisterOptions {
+    /**
+     * if true, subsequent registrations of the same plugin are skipped without error. Cannot be used with plugin options. Defaults to false. If not set to true, an error will be thrown the second
+     * time a plugin is registered on the server.
+     */
+    once?: boolean | undefined;
+    /**
+     * modifiers applied to each route added by the plugin:
+     */
+    routes?: {
+        /**
+         * string added as prefix to any route path (must begin with '/'). If a plugin registers a child plugin the prefix is passed on to the child or is added in front of the child-specific prefix.
+         */
+        prefix: string;
+        /**
+         * virtual host string (or array of strings) applied to every route. The outer-most vhost overrides the any nested configuration.
+         */
+        vhost?: string | string[] | undefined;
+    } | undefined;
+}
+
+export interface ServerRegisterPluginObjectDirect<T, D> extends ServerRegisterOptions {
+    /**
+     * a plugin object.
+     */
+    plugin: Plugin<T, D>;
+    /**
+     * options passed to the plugin during registration.
+     */
+    options?: T | undefined;
+}
+
+export interface ServerRegisterPluginObjectWrapped<T, D> extends ServerRegisterOptions {
+    /**
+     * a plugin object.
+     */
+    plugin: { plugin: Plugin<T, D> };
+    /**
+     * options passed to the plugin during registration.
+     */
+    options?: T | undefined;
+}
+
+/**
+ * An object with the following:
+ * * plugin - a plugin object or a wrapped plugin loaded module.
+ * * options - (optional) options passed to the plugin during registration.
+ * * once - if true, subsequent registrations of the same plugin are skipped without error. Cannot be used with plugin options. Defaults to false. If not set to true, an error will be thrown the
+ * second time a plugin is registered on the server.
+ * * routes - modifiers applied to each route added by the plugin:
+ * * * prefix - string added as prefix to any route path (must begin with '/'). If a plugin registers a child plugin the prefix is passed on to the child or is added in front of the child-specific
+ * prefix.
+ * * * vhost - virtual host string (or array of strings) applied to every route. The outer-most vhost overrides the any nested configuration.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverregisterplugins-options)
+ *
+ * The type parameter T is the type of the plugin configuration options.
+ */
+export type ServerRegisterPluginObject<T, D = void> =
+    ServerRegisterPluginObjectDirect<T, D> |
+    ServerRegisterPluginObjectWrapped<T, D>;
+
+export type ServerRegisterPluginObjectArray<T, U, V, W, X, Y, Z> = (
+    ServerRegisterPluginObject<T> |
+    ServerRegisterPluginObject<U> |
+    ServerRegisterPluginObject<V> |
+    ServerRegisterPluginObject<W> |
+    ServerRegisterPluginObject<X> |
+    ServerRegisterPluginObject<Y> |
+    ServerRegisterPluginObject<Z>
+)[];
+
+/**
+ * The method function can have a defaults object or function property. If the property is set to an object, that object is used as the default route config for routes using this handler.
+ * If the property is set to a function, the function uses the signature function(method) and returns the route default configuration.
+ */
+export interface HandlerDecorationMethod {
+    (route: RequestRoute, options: any): Lifecycle.Method;
+    defaults?: RouteOptions | ((method: any) => RouteOptions) | undefined;
+}
+
+/**
+ * An empty interface to allow typings of custom plugin properties.
+ */
+
+export interface PluginProperties {
+}
diff --git a/node_modules/@hapi/hapi/lib/types/request.d.ts b/node_modules/@hapi/hapi/lib/types/request.d.ts
new file mode 100644
index 0000000..23452c5
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/request.d.ts
@@ -0,0 +1,531 @@
+import * as http from 'http';
+import * as stream from 'stream';
+import * as url from 'url';
+
+import { Boom } from '@hapi/boom';
+import { Podium } from '@hapi/podium';
+
+import { PluginsStates, ServerRealm } from './plugin';
+import { ResponseValue, ResponseObject } from "./response";
+import { RouteRules, RouteSettings } from './route';
+import { Server, ServerAuthSchemeObjectApi } from './server';
+import { HTTP_METHODS, PeekListener } from './utils';
+
+/**
+ * User extensible types user credentials.
+ */
+export interface UserCredentials {
+}
+
+/**
+ * User extensible types app credentials.
+ */
+export interface AppCredentials {
+}
+
+/**
+ * User-extensible type for request.auth credentials.
+ */
+export interface AuthCredentials<
+    AuthUser = UserCredentials,
+    AuthApp = AppCredentials
+> {
+    /**
+     * The application scopes to be granted.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthaccessscope)
+     */
+    scope?: string[] | undefined;
+
+    /**
+     * If set, will only work with routes that set `access.entity` to `user`.
+     */
+    user?: AuthUser
+
+    /**
+     * If set, will only work with routes that set `access.entity` to `app`.
+     */
+    app?: AuthApp;
+}
+
+export interface AuthArtifacts {
+    [key: string]: unknown;
+}
+
+export type AuthMode = 'required' | 'optional' | 'try';
+
+/**
+ * Authentication information:
+ * * artifacts - an artifact object received from the authentication strategy and used in authentication-related actions.
+ * * credentials - the credential object received during the authentication process. The presence of an object does not mean successful authentication.
+ * * error - the authentication error is failed and mode set to 'try'.
+ * * isAuthenticated - true if the request has been successfully authenticated, otherwise false.
+ * * isAuthorized - true is the request has been successfully authorized against the route authentication access configuration. If the route has not access rules defined or if the request failed
+ * authorization, set to false.
+ * * mode - the route authentication mode.
+ * * strategy - the name of the strategy used.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestauth)
+ */
+export interface RequestAuth<
+    AuthUser = UserCredentials,
+    AuthApp = AppCredentials,
+    CredentialsExtra = Record<string, unknown>,
+    ArtifactsExtra = Record<string, unknown>
+> {
+    /** an artifact object received from the authentication strategy and used in authentication-related actions. */
+    artifacts: ArtifactsExtra;
+    /** the credential object received during the authentication process. The presence of an object does not mean successful authentication. */
+    credentials: (
+
+        AuthCredentials<AuthUser, AuthApp> &
+        CredentialsExtra
+    );
+
+    /** the authentication error is failed and mode set to 'try'. */
+    error: Error;
+    /** true if the request has been successfully authenticated, otherwise false. */
+    isAuthenticated: boolean;
+    /**
+     * true is the request has been successfully authorized against the route authentication access configuration. If the route has not access rules defined or if the request failed authorization,
+     * set to false.
+     */
+    isAuthorized: boolean;
+    /** true if the request has been authenticated via the `server.inject()` `auth` option, otherwise `undefined`. */
+    isInjected?: boolean | undefined;
+    /** the route authentication mode. */
+    mode: AuthMode;
+    /** the name of the strategy used. */
+    strategy: string;
+}
+
+
+/**
+ * 'peek' - emitted for each chunk of payload data read from the client connection. The event method signature is function(chunk, encoding).
+ * 'finish' - emitted when the request payload finished reading. The event method signature is function ().
+ * 'disconnect' - emitted when a request errors or aborts unexpectedly.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestevents)
+ */
+export type RequestEventType = 'peek' | 'finish' | 'disconnect';
+
+/**
+ * Access: read only and the public podium interface.
+ * The request.events supports the following events:
+ * * 'peek' - emitted for each chunk of payload data read from the client connection. The event method signature is function(chunk, encoding).
+ * * 'finish' - emitted when the request payload finished reading. The event method signature is function ().
+ * * 'disconnect' - emitted when a request errors or aborts unexpectedly.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestevents)
+ */
+export interface RequestEvents extends Podium {
+    /**
+     * Access: read only and the public podium interface.
+     * The request.events supports the following events:
+     * * 'peek' - emitted for each chunk of payload data read from the client connection. The event method signature is function(chunk, encoding).
+     * * 'finish' - emitted when the request payload finished reading. The event method signature is function ().
+     * * 'disconnect' - emitted when a request errors or aborts unexpectedly.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestevents)
+     */
+    on(criteria: 'peek', listener: PeekListener): this;
+
+    on(criteria: 'finish' | 'disconnect', listener: (data: undefined) => void): this;
+
+    /**
+     * Access: read only and the public podium interface.
+     * The request.events supports the following events:
+     * * 'peek' - emitted for each chunk of payload data read from the client connection. The event method signature is function(chunk, encoding).
+     * * 'finish' - emitted when the request payload finished reading. The event method signature is function ().
+     * * 'disconnect' - emitted when a request errors or aborts unexpectedly.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestevents)
+     */
+    once(criteria: 'peek', listener: PeekListener): this;
+    once(criteria: 'peek'): Promise<Parameters<PeekListener>>;
+
+    once(criteria: 'finish' | 'disconnect', listener: (data: undefined) => void): this;
+}
+
+/**
+ * Request information:
+ * * acceptEncoding - the request preferred encoding.
+ * * cors - if CORS is enabled for the route, contains the following:
+ * * isOriginMatch - true if the request 'Origin' header matches the configured CORS restrictions. Set to false if no 'Origin' header is found or if it does not match. Note that this is only
+ * available after the 'onRequest' extension point as CORS is configured per-route and no routing decisions are made at that point in the request lifecycle.
+ * * host - content of the HTTP 'Host' header (e.g. 'example.com:8080').
+ * * hostname - the hostname part of the 'Host' header (e.g. 'example.com').
+ * * id - a unique request identifier (using the format '{now}:{connection.info.id}:{5 digits counter}').
+ * * received - request reception timestamp.
+ * * referrer - content of the HTTP 'Referrer' (or 'Referer') header.
+ * * remoteAddress - remote client IP address.
+ * * remotePort - remote client port.
+ * * responded - request response timestamp (0 is not responded yet).
+ * Note that the request.info object is not meant to be modified.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestinfo)
+ */
+export interface RequestInfo {
+    /** the request preferred encoding. */
+    acceptEncoding: string;
+    /** if CORS is enabled for the route, contains the following: */
+    cors: {
+        /**
+         * true if the request 'Origin' header matches the configured CORS restrictions. Set to false if no 'Origin' header is found or if it does not match. Note that this is only available after
+         * the 'onRequest' extension point as CORS is configured per-route and no routing decisions are made at that point in the request lifecycle.
+         */
+        isOriginMatch?: boolean | undefined;
+    };
+    /** content of the HTTP 'Host' header (e.g. 'example.com:8080'). */
+    host: string;
+    /** the hostname part of the 'Host' header (e.g. 'example.com'). */
+    hostname: string;
+    /** a unique request identifier (using the format '{now}:{connection.info.id}:{5 digits counter}') */
+    id: string;
+    /** request reception timestamp. */
+    received: number;
+    /** content of the HTTP 'Referrer' (or 'Referer') header. */
+    referrer: string;
+    /** remote client IP address. */
+    remoteAddress: string;
+    /** remote client port. */
+    remotePort: string;
+    /** request response timestamp (0 is not responded yet). */
+    responded: number;
+    /** request processing completion timestamp (0 is still processing). */
+    completed: number;
+}
+
+/**
+ * The request route information object, where:
+ * * method - the route HTTP method.
+ * * path - the route path.
+ * * vhost - the route vhost option if configured.
+ * * realm - the active realm associated with the route.
+ * * settings - the route options object with all defaults applied.
+ * * fingerprint - the route internal normalized string representing the normalized path.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestroute)
+ */
+export interface RequestRoute<Refs extends ReqRef = ReqRefDefaults> {
+    /** the route HTTP method. */
+    method: Exclude<Lowercase<HTTP_METHODS>, 'head'> | '*';
+
+    /** the route path. */
+    path: string;
+
+    /** the route vhost option if configured. */
+    vhost?: string | string[] | undefined;
+
+    /** the active realm associated with the route. */
+    realm: ServerRealm;
+
+    /** the route options object with all defaults applied. */
+    settings: RouteSettings<Refs>;
+
+    /** the route internal normalized string representing the normalized path. */
+    fingerprint: string;
+
+    auth: {
+        /**
+         * Validates a request against the route's authentication access configuration, where:
+         * @param request - the request object.
+         * @return Return value: true if the request would have passed the route's access requirements.
+         * Note that the route's authentication mode and strategies are ignored. The only match is made between the request.auth.credentials scope and entity information and the route access
+         *     configuration. If the route uses dynamic scopes, the scopes are constructed against the request.query, request.params, request.payload, and request.auth.credentials which may or may
+         *     not match between the route and the request's route. If this method is called using a request that has not been authenticated (yet or not at all), it will return false if the route
+         *     requires any authentication.
+         * [See docs](https://hapijs.com/api/17.0.1#-requestrouteauthaccessrequest)
+         */
+        access(request: Request): boolean;
+    };
+}
+
+/**
+ * An object containing the values of params, query, and payload before any validation modifications made. Only set when input validation is performed.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestorig)
+ */
+export interface RequestOrig {
+    params: object;
+    query: object;
+    payload: object;
+}
+
+export interface RequestLog {
+    request: string;
+    timestamp: number;
+    tags: string[];
+    data: string | object;
+    channel: string;
+}
+
+export interface RequestQuery {
+    [key: string]: string | string[] | undefined;
+}
+
+/**
+ * Empty interface to allow for user-defined augmentations.
+ */
+export interface RouteOptionsApp {}
+
+/**
+ *  User-extensible type for application specific state on requests (`request.app`).
+ */
+export interface RequestApplicationState {
+}
+
+export interface InternalRequestDefaults {
+    Server: Server;
+
+    Payload: stream.Readable | Buffer | string | object;
+    Query: RequestQuery;
+    Params: Record<string, string>;
+    Pres: Record<string, any>;
+    Headers: Record<string, string | string[] | undefined>;
+    RequestApp: RequestApplicationState;
+
+    AuthUser: UserCredentials;
+    AuthApp: AppCredentials;
+    AuthApi: ServerAuthSchemeObjectApi;
+    AuthCredentialsExtra: Record<string, unknown>;
+    AuthArtifactsExtra: Record<string, unknown>;
+
+    Rules: RouteRules;
+    Bind: object | null;
+    RouteApp: RouteOptionsApp;
+}
+
+/**
+ * Default request references. Used to give typing to requests,
+ * route handlers, lifecycle methods, auth credentials, etc.
+ * This can be overwritten to whatever is suitable and universal
+ * in your specific app, but whatever references you pass to
+ * server route generic, or lifecycle methods will take precedence
+ * over these.
+ */
+export interface ReqRefDefaults extends InternalRequestDefaults {}
+
+/**
+ * Route request overrides
+ */
+export type ReqRef = Partial<Record<keyof ReqRefDefaults, unknown>>;
+
+/**
+ * Utilities for merging request refs and other things
+ */
+export type MergeType<T, U> = Omit<T, keyof U> & U;
+
+export type MergeRefs<T extends ReqRef> = MergeType<ReqRefDefaults, T>;
+
+/**
+ * The request object is created internally for each incoming request. It is not the same object received from the node
+ * HTTP server callback (which is available via [request.raw.req](https://github.com/hapijs/hapi/blob/master/API.md#request.raw)). The request properties change throughout
+ * the request [lifecycle](https://github.com/hapijs/hapi/blob/master/API.md#request-lifecycle).
+ */
+export interface Request<Refs extends ReqRef = ReqRefDefaults> extends Podium {
+    /**
+     * Application-specific state. Provides a safe place to store application data without potential conflicts with the framework. Should not be used by plugins which should use plugins[name].
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestapp)
+     */
+    app: MergeRefs<Refs>['RequestApp'];
+
+    /**
+     * Authentication information:
+     * * artifacts - an artifact object received from the authentication strategy and used in authentication-related actions.
+     * * credentials - the credential object received during the authentication process. The presence of an object does not mean successful authentication.
+     * * error - the authentication error is failed and mode set to 'try'.
+     * * isAuthenticated - true if the request has been successfully authenticated, otherwise false.
+     * * isAuthorized - true is the request has been successfully authorized against the route authentication access configuration. If the route has not access rules defined or if the request failed
+     * authorization, set to false.
+     * * mode - the route authentication mode.
+     * * strategy - the name of the strategy used.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestauth)
+     */
+    readonly auth: RequestAuth<
+        MergeRefs<Refs>['AuthUser'],
+        MergeRefs<Refs>['AuthApp'],
+        MergeRefs<Refs>['AuthCredentialsExtra'],
+        MergeRefs<Refs>['AuthArtifactsExtra']
+    >;
+
+    /**
+     * Access: read only and the public podium interface.
+     * The request.events supports the following events:
+     * * 'peek' - emitted for each chunk of payload data read from the client connection. The event method signature is function(chunk, encoding).
+     * * 'finish' - emitted when the request payload finished reading. The event method signature is function ().
+     * * 'disconnect' - emitted when a request errors or aborts unexpectedly.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestevents)
+     */
+    events: RequestEvents;
+
+    /**
+     * The raw request headers (references request.raw.req.headers).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestheaders)
+     */
+    readonly headers: MergeRefs<Refs>['Headers'];
+
+    /**
+     * Request information:
+     * * acceptEncoding - the request preferred encoding.
+     * * cors - if CORS is enabled for the route, contains the following:
+     * * isOriginMatch - true if the request 'Origin' header matches the configured CORS restrictions. Set to false if no 'Origin' header is found or if it does not match. Note that this is only
+     * available after the 'onRequest' extension point as CORS is configured per-route and no routing decisions are made at that point in the request lifecycle.
+     * * host - content of the HTTP 'Host' header (e.g. 'example.com:8080').
+     * * hostname - the hostname part of the 'Host' header (e.g. 'example.com').
+     * * id - a unique request identifier (using the format '{now}:{connection.info.id}:{5 digits counter}').
+     * * received - request reception timestamp.
+     * * referrer - content of the HTTP 'Referrer' (or 'Referer') header.
+     * * remoteAddress - remote client IP address.
+     * * remotePort - remote client port.
+     * * responded - request response timestamp (0 is not responded yet).
+     * Note that the request.info object is not meant to be modified.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestinfo)
+     */
+    readonly info: RequestInfo;
+
+    /**
+     * An array containing the logged request events.
+     * Note that this array will be empty if route log.collect is set to false.
+     */
+    readonly logs: RequestLog[];
+
+    /**
+     * The request method in lower case (e.g. 'get', 'post').
+     */
+    readonly method: Lowercase<HTTP_METHODS>;
+
+    /**
+     * The parsed content-type header. Only available when payload parsing enabled and no payload error occurred.
+     */
+    readonly mime: string;
+
+    /**
+     * An object containing the values of params, query, and payload before any validation modifications made. Only set when input validation is performed.
+     */
+    readonly orig: RequestOrig;
+
+    /**
+     * An object where each key is a path parameter name with matching value as described in [Path parameters](https://github.com/hapijs/hapi/blob/master/API.md#path-parameters).
+     */
+    readonly params: MergeRefs<Refs>['Params'];
+
+    /**
+     * An array containing all the path params values in the order they appeared in the path.
+     */
+    readonly paramsArray: keyof MergeRefs<Refs>['Params'] | string[];
+
+    /**
+     * The request URI's pathname component.
+     */
+    readonly path: string;
+
+    /**
+     * The request payload based on the route payload.output and payload.parse settings.
+     * TODO check this typing and add references / links.
+     */
+    readonly payload: MergeRefs<Refs>['Payload'];
+
+    /**
+     * Plugin-specific state. Provides a place to store and pass request-level plugin data. The plugins is an object where each key is a plugin name and the value is the state.
+     */
+    plugins: PluginsStates;
+
+    /**
+     * An object where each key is the name assigned by a route pre-handler methods function. The values are the raw values provided to the continuation function as argument. For the wrapped response
+     * object, use responses.
+     */
+    readonly pre: MergeRefs<Refs>['Pres'];
+
+    /**
+     * Access: read / write (see limitations below).
+     * The response object when set. The object can be modified but must not be assigned another object. To replace the response with another from within an extension point, use reply(response) to
+     * override with a different response.
+     * In case of an aborted request the status code will be set to `disconnectStatusCode`.
+     */
+    response: ResponseObject | Boom;
+
+    /**
+     * Same as pre but represented as the response object created by the pre method.
+     */
+    readonly preResponses: Record<string, unknown>;
+
+    /**
+     * By default the object outputted from node's URL parse() method.
+     */
+    readonly query: MergeRefs<Refs>['Query'];
+
+    /**
+     * An object containing the Node HTTP server objects. Direct interaction with these raw objects is not recommended.
+     * * req - the node request object.
+     * * res - the node response object.
+     */
+    readonly raw: {
+        req: http.IncomingMessage;
+        res: http.ServerResponse;
+    };
+
+    /**
+     * The request route information object and method
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestroute)
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestrouteauthaccessrequest)
+     */
+    readonly route: RequestRoute<Refs>;
+
+    /**
+     * Access: read only and the public server interface.
+     * The server object.
+     */
+    readonly server: MergeRefs<Refs>['Server'];
+
+    /**
+     * An object containing parsed HTTP state information (cookies) where each key is the cookie name and value is the matching cookie content after processing using any registered cookie definition.
+     */
+    readonly state: Record<string, unknown>;
+
+    /**
+     * The parsed request URI.
+     */
+    readonly url: url.URL;
+
+    /**
+     * Returns `true` when the request is active and processing should continue and `false` when the
+     *  request terminated early or completed its lifecycle. Useful when request processing is a
+     * resource-intensive operation and should be terminated early if the request is no longer active
+     * (e.g. client disconnected or aborted early).
+     */
+    active(): boolean;
+
+    /**
+     * Returns a response which you can pass into the reply interface where:
+     * @param source - the value to set as the source of the reply interface, optional.
+     * @param options - options for the method, optional.
+     * @return ResponseObject
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestgenerateresponsesource-options)
+     */
+    /* tslint:disable-next-line:max-line-length */
+    generateResponse(source: string | object | null, options?: { variety?: string | undefined; prepare?: ((response: ResponseObject) => Promise<ResponseObject>) | undefined; marshal?: ((response: ResponseObject) => Promise<ResponseValue>) | undefined; close?: ((response: ResponseObject) => void) | undefined; } | undefined): ResponseObject;
+
+    /**
+     * Logs request-specific events. When called, the server emits a 'request' event which can be used by other listeners or plugins. The arguments are:
+     * @param tags - a string or an array of strings (e.g. ['error', 'database', 'read']) used to identify the event. Tags are used instead of log levels and provide a much more expressive mechanism
+     *     for describing and filtering events.
+     * @param data - (optional) an message string or object with the application data being logged. If data is a function, the function signature is function() and it called once to generate (return
+     *     value) the actual data emitted to the listeners. Any logs generated by the server internally will be emitted only on the 'request-internal' channel and will include the event.internal flag
+     *     set to true.
+     * @return void
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-requestlogtags-data)
+     */
+    log(tags: string | string[], data?: string | object | (() => string | object) | undefined): void;
+
+    /**
+     * Changes the request method before the router begins processing the request where:
+     * @param method - is the request HTTP method (e.g. 'GET').
+     * @return void
+     * Can only be called from an 'onRequest' extension method.
+     * [See docs](https://hapijs.com/api/17.0.1#-requestsetmethodmethod)
+     */
+    setMethod(method: HTTP_METHODS | Lowercase<HTTP_METHODS>): void;
+
+    /**
+     * Changes the request URI before the router begins processing the request where:
+     * Can only be called from an 'onRequest' extension method.
+     * @param url - the new request URI. If url is a string, it is parsed with node's URL parse() method with parseQueryString set to true. url can also be set to an object compatible with node's URL
+     *     parse() method output.
+     * @param stripTrailingSlash - if true, strip the trailing slash from the path. Defaults to false.
+     * @return void
+     * [See docs](https://hapijs.com/api/17.0.1#-requestseturlurl-striptrailingslash)
+     */
+    setUrl(url: string | url.URL, stripTrailingSlash?: boolean | undefined): void;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/response.d.ts b/node_modules/@hapi/hapi/lib/types/response.d.ts
new file mode 100644
index 0000000..f7c1317
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/response.d.ts
@@ -0,0 +1,568 @@
+
+import { Podium } from '@hapi/podium';
+
+import { PluginsStates, ServerRealm } from './plugin';
+import {
+    UserCredentials,
+    AppCredentials,
+    AuthArtifacts,
+    AuthCredentials,
+    ReqRef,
+    ReqRefDefaults,
+    MergeRefs,
+    Request
+} from './request';
+import { PeekListener, Lifecycle, Json } from './utils';
+import { ServerStateCookieOptions } from './server';
+
+/**
+ *  User-extensible type for application specific state on responses (`response.app`).
+ */
+export interface ResponseApplicationState {
+}
+
+/**
+ * Access: read only and the public podium interface.
+ * The response.events object supports the following events:
+ * * 'peek' - emitted for each chunk of data written back to the client connection. The event method signature is function(chunk, encoding).
+ * * 'finish' - emitted when the response finished writing but before the client response connection is ended. The event method signature is function ().
+ * [See docs](https://hapijs.com/api/17.0.1#-responseevents)
+ */
+export interface ResponseEvents extends Podium {
+    /**
+     * 'peek' - emitted for each chunk of data written back to the client connection. The event method signature is function(chunk, encoding).
+     * 'finish' - emitted when the response finished writing but before the client response connection is ended. The event method signature is function ().
+     */
+    on(criteria: 'peek', listener: PeekListener): this;
+
+    on(criteria: 'finish', listener: (data: undefined) => void): this;
+
+    /**
+     * 'peek' - emitted for each chunk of data written back to the client connection. The event method signature is function(chunk, encoding).
+     * 'finish' - emitted when the response finished writing but before the client response connection is ended. The event method signature is function ().
+     */
+    once(criteria: 'peek', listener: PeekListener): this;
+    once(criteria: 'peek'): Promise<Parameters<PeekListener>>;
+
+    once(criteria: 'finish', listener: (data: undefined) => void): this;
+}
+
+/**
+ * Object where:
+ *  * append - if true, the value is appended to any existing header value using separator. Defaults to false.
+ *  * separator - string used as separator when appending to an existing value. Defaults to ','.
+ *  * override - if false, the header value is not set if an existing value present. Defaults to true.
+ *  * duplicate - if false, the header value is not modified if the provided value is already included. Does not apply when append is false or if the name is 'set-cookie'. Defaults to true.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseheadername-value-options)
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#response-object)
+ */
+export interface ResponseObjectHeaderOptions {
+    append?: boolean | undefined;
+    separator?: string | undefined;
+    override?: boolean | undefined;
+    duplicate?: boolean | undefined;
+}
+
+/**
+ * The response object contains the request response value along with various HTTP headers and flags. When a lifecycle
+ * method returns a value, the value is wrapped in a response object along with some default flags (e.g. 200 status
+ * code). In order to customize a response before it is returned, the h.response() method is provided.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#response-object)
+ * TODO, check extending from Podium is correct.  Extending because of "The response object supports the following events" [See docs](https://hapijs.com/api/17.0.1#-responseevents)
+ */
+export interface ResponseObject extends Podium {
+    /**
+     * @default {}.
+     * Application-specific state. Provides a safe place to store application data without potential conflicts with the framework. Should not be used by plugins which should use plugins[name].
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseapp)
+     */
+    app: ResponseApplicationState;
+
+    /**
+     * Access: read only and the public podium interface.
+     * The response.events object supports the following events:
+     * * 'peek' - emitted for each chunk of data written back to the client connection. The event method signature is function(chunk, encoding).
+     * * 'finish' - emitted when the response finished writing but before the client response connection is ended. The event method signature is function ().
+     * [See docs](https://hapijs.com/api/17.0.1#-responseevents)
+     */
+    readonly events: ResponseEvents;
+
+    /**
+     * @default {}.
+     * An object containing the response headers where each key is a header field name and the value is the string header value or array of string.
+     * Note that this is an incomplete list of headers to be included with the response. Additional headers will be added once the response is prepared for transmission.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseheaders)
+     */
+    readonly headers: Record<string, string | string[]>;
+
+    /**
+     * @default {}.
+     * Plugin-specific state. Provides a place to store and pass request-level plugin data. plugins is an object where each key is a plugin name and the value is the state.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseplugins)
+     */
+    plugins: PluginsStates;
+
+    /**
+     * Object containing the response handling flags.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsesettings)
+     */
+    readonly settings: ResponseSettings;
+
+    /**
+     * The raw value returned by the lifecycle method.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsesource)
+     */
+    readonly source: Lifecycle.ReturnValue;
+
+    /**
+     * @default 200.
+     * The HTTP response status code.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsestatuscode)
+     */
+    readonly statusCode: number;
+
+    /**
+     * A string indicating the type of source with available values:
+     * * 'plain' - a plain response such as string, number, null, or simple object.
+     * * 'buffer' - a Buffer.
+     * * 'stream' - a Stream.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsevariety)
+     */
+    readonly variety: 'plain' | 'buffer' | 'stream';
+
+    /**
+     * Sets the HTTP 'Content-Length' header (to avoid chunked transfer encoding) where:
+     * @param length - the header value. Must match the actual payload size.
+     * @return Return value: the current response object.
+     * [See docs](https://hapijs.com/api/17.0.1#-responsebyteslength)
+     */
+    bytes(length: number): ResponseObject;
+
+    /**
+     * Controls the 'Content-Type' HTTP header 'charset' property of the response.
+     *  * When invoked without any parameter, will prevent hapi from applying its default charset normalization to 'utf-8'
+     *  * When 'charset' parameter is provided, will set the 'Content-Type' HTTP header 'charset' property where:
+     * @param charset - the charset property value.
+     * @return Return value: the current response object.
+     * [See docs](https://hapijs.com/api/17.0.1#-responsecharsetcharset)
+     */
+    charset(charset?: string): ResponseObject | undefined;
+
+    /**
+     * Sets the HTTP status code where:
+     * @param statusCode - the HTTP status code (e.g. 200).
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsecodestatuscode)
+     */
+    code(statusCode: number): ResponseObject;
+
+    /**
+     * Sets the HTTP status message where:
+     * @param httpMessage - the HTTP status message (e.g. 'Ok' for status code 200).
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsemessagehttpmessage)
+     */
+    message(httpMessage: string): ResponseObject;
+
+    /**
+     * Sets the HTTP 'content-encoding' header where:
+     * @param encoding - the header value string.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsecompressedencoding)
+     */
+    compressed(encoding: string): ResponseObject;
+
+    /**
+     * Sets the HTTP status code to Created (201) and the HTTP 'Location' header where:
+     * @param uri - an absolute or relative URI used as the 'Location' header value.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsecreateduri)
+     */
+    created(uri: string): ResponseObject;
+
+    /**
+     * Sets the string encoding scheme used to serial data into the HTTP payload where:
+     * @param encoding  the encoding property value (see node Buffer encoding [See docs](https://nodejs.org/api/buffer.html#buffer_buffers_and_character_encodings)).
+     *  * 'ascii' - for 7-bit ASCII data only. This encoding is fast and will strip the high bit if set.
+     *  * 'utf8' - Multibyte encoded Unicode characters. Many web pages and other document formats use UTF-8.
+     *  * 'utf16le' - 2 or 4 bytes, little-endian encoded Unicode characters. Surrogate pairs (U+10000 to U+10FFFF) are supported.
+     *  * 'ucs2' - Alias of 'utf16le'.
+     *  * 'base64' - Base64 encoding. When creating a Buffer from a string, this encoding will also correctly accept "URL and Filename Safe Alphabet" as specified in RFC4648, Section 5.
+     *  * 'latin1' - A way of encoding the Buffer into a one-byte encoded string (as defined by the IANA in RFC1345, page 63, to be the Latin-1 supplement block and C0/C1 control codes).
+     *  * 'binary' - Alias for 'latin1'.
+     *  * 'hex' - Encode each byte as two hexadecimal characters.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseencodingencoding)
+     */
+    encoding(encoding: 'ascii' | 'utf8' | 'utf16le' | 'ucs2' | 'base64' | 'latin1' | 'binary' | 'hex'): ResponseObject;
+
+    /**
+     * Sets the representation entity tag where:
+     * @param tag - the entity tag string without the double-quote.
+     * @param options - (optional) settings where:
+     *  * weak - if true, the tag will be prefixed with the 'W/' weak signifier. Weak tags will fail to match identical tags for the purpose of determining 304 response status. Defaults to false.
+     *  * vary - if true and content encoding is set or applied to the response (e.g 'gzip' or 'deflate'), the encoding name will be automatically added to the tag at transmission time (separated by
+     *     a '-' character). Ignored when weak is true. Defaults to true.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseetagtag-options)
+     */
+    etag(tag: string, options?: {weak: boolean, vary: boolean} | undefined): ResponseObject;
+
+    /**
+     * Sets an HTTP header where:
+     * @param name - the header name.
+     * @param value - the header value.
+     * @param options - (optional) object where:
+     *  * append - if true, the value is appended to any existing header value using separator. Defaults to false.
+     *  * separator - string used as separator when appending to an existing value. Defaults to ','.
+     *  * override - if false, the header value is not set if an existing value present. Defaults to true.
+     *  * duplicate - if false, the header value is not modified if the provided value is already included. Does not apply when append is false or if the name is 'set-cookie'. Defaults to true.
+     *  @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseheadername-value-options)
+     */
+    header(name: string, value: string, options?: ResponseObjectHeaderOptions | undefined): ResponseObject;
+
+    /**
+     * Sets the HTTP 'Location' header where:
+     * @param uri - an absolute or relative URI used as the 'Location' header value.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responselocationuri)
+     */
+    location(uri: string): ResponseObject;
+
+    /**
+     * Sets an HTTP redirection response (302) and decorates the response with additional methods, where:
+     * @param uri - an absolute or relative URI used to redirect the client to another resource.
+     * @return Return value: the current response object.
+     * Decorates the response object with the response.temporary(), response.permanent(), and response.rewritable() methods to easily change the default redirection code (302).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseredirecturi)
+     */
+    redirect(uri: string): ResponseObject;
+
+    /**
+     * Sets the JSON.stringify() replacer argument where:
+     * @param method - the replacer function or array. Defaults to none.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsereplacermethod)
+     */
+    replacer(method: Json.StringifyReplacer): ResponseObject;
+
+    /**
+     * Sets the JSON.stringify() space argument where:
+     * @param count - the number of spaces to indent nested object keys. Defaults to no indentation.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsespacescount)
+     */
+    spaces(count: number): ResponseObject;
+
+    /**
+     * Sets an HTTP cookie where:
+     * @param name - the cookie name.
+     * @param value - the cookie value. If no options.encoding is defined, must be a string. See server.state() for supported encoding values.
+     * @param options - (optional) configuration. If the state was previously registered with the server using server.state(), the specified keys in options are merged with the default server
+     *     definition.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsestatename-value-options)
+     */
+    state(name: string, value: object | string, options?: ServerStateCookieOptions | undefined): ResponseObject;
+
+    /**
+     * Sets a string suffix when the response is process via JSON.stringify() where:
+     * @param suffix - the string suffix.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsesuffixsuffix)
+     */
+    suffix(suffix: string): ResponseObject;
+
+    /**
+     * Overrides the default route cache expiration rule for this response instance where:
+     * @param msec - the time-to-live value in milliseconds.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsettlmsec)
+     */
+    ttl(msec: number): ResponseObject;
+
+    /**
+     * Sets the HTTP 'Content-Type' header where:
+     * @param mimeType - is the mime type.
+     * @return Return value: the current response object.
+     * Should only be used to override the built-in default for each response type.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsetypemimetype)
+     */
+    type(mimeType: string): ResponseObject;
+
+    /**
+     * Clears the HTTP cookie by setting an expired value where:
+     * @param name - the cookie name.
+     * @param options - (optional) configuration for expiring cookie. If the state was previously registered with the server using server.state(), the specified options are merged with the server
+     *     definition.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responseunstatename-options)
+     */
+    unstate(name: string, options?: ServerStateCookieOptions | undefined): ResponseObject;
+
+    /**
+     * Adds the provided header to the list of inputs affected the response generation via the HTTP 'Vary' header where:
+     * @param header - the HTTP request header name.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsevaryheader)
+     */
+    vary(header: string): ResponseObject;
+
+    /**
+     * Marks the response object as a takeover response.
+     * @return Return value: the current response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsetakeover)
+     */
+    takeover(): ResponseObject;
+
+    /**
+     * Sets the status code to 302 or 307 (based on the response.rewritable() setting) where:
+     * @param isTemporary - if false, sets status to permanent. Defaults to true.
+     * @return Return value: the current response object.
+     * Only available after calling the response.redirect() method.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsetemporaryistemporary)
+     */
+    temporary(isTemporary?: boolean): ResponseObject;
+
+    /**
+     * Sets the status code to 301 or 308 (based on the response.rewritable() setting) where:
+     * @param isPermanent - if false, sets status to temporary. Defaults to true.
+     * @return Return value: the current response object.
+     * Only available after calling the response.redirect() method.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsepermanentispermanent)
+     */
+    permanent(isPermanent?: boolean): ResponseObject;
+
+    /**
+     * Sets the status code to 301/302 for rewritable (allows changing the request method from 'POST' to 'GET') or 307/308 for non-rewritable (does not allow changing the request method from 'POST'
+     * to 'GET'). Exact code based on the response.temporary() or response.permanent() setting. Arguments:
+     * @param isRewritable - if false, sets to non-rewritable. Defaults to true.
+     * @return Return value: the current response object.
+     * Only available after calling the response.redirect() method.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responserewritableisrewritable)
+     */
+    rewritable(isRewritable?: boolean): ResponseObject;
+}
+
+/**
+ * Object containing the response handling flags.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-responsesettings)
+ */
+export interface ResponseSettings {
+    /**
+     * Defaults value: true.
+     * If true and source is a Stream, copies the statusCode and headers properties of the stream object to the outbound response.
+     */
+    readonly passThrough: boolean;
+
+    /**
+     * @default null (use route defaults).
+     * Override the route json options used when source value requires stringification.
+     */
+    readonly stringify: Json.StringifyArguments;
+
+    /**
+     * @default null (use route defaults).
+     * If set, overrides the route cache with an expiration value in milliseconds.
+     */
+    readonly ttl: number;
+
+    /**
+     * @default false.
+     * If true, a suffix will be automatically added to the 'ETag' header at transmission time (separated by a '-' character) when the HTTP 'Vary' header is present.
+     */
+    varyEtag: boolean;
+}
+
+/**
+ * See more about Lifecycle
+ * https://github.com/hapijs/hapi/blob/master/API.md#request-lifecycle
+ *
+ */
+
+export type ResponseValue = string | object;
+
+export interface AuthenticationData<
+
+    AuthUser = UserCredentials,
+    AuthApp = AppCredentials,
+    CredentialsExtra = Record<string, unknown>,
+    ArtifactsExtra = AuthArtifacts
+> {
+    credentials: AuthCredentials<AuthUser, AuthApp> & CredentialsExtra;
+    artifacts?: ArtifactsExtra | undefined;
+}
+
+export interface Auth<
+    AuthUser = UserCredentials,
+    AuthApp = AppCredentials,
+    CredentialsExtra = Record<string, unknown>,
+    ArtifactsExtra = AuthArtifacts
+> {
+    readonly isAuth: true;
+    readonly error?: Error | null | undefined;
+    readonly data?: AuthenticationData<AuthUser, AuthApp, CredentialsExtra, ArtifactsExtra> | undefined;
+}
+
+/**
+ * The response toolkit is a collection of properties and utilities passed to every [lifecycle method](https://github.com/hapijs/hapi/blob/master/API.md#lifecycle-methods)
+ * It is somewhat hard to define as it provides both utilities for manipulating responses as well as other information. Since the
+ * toolkit is passed as a function argument, developers can name it whatever they want. For the purpose of this
+ * document the h notation is used. It is named in the spirit of the RethinkDB r method, with h for hapi.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#response-toolkit)
+ */
+export interface ResponseToolkit<Refs extends ReqRef = ReqRefDefaults> {
+    /**
+     * A response symbol. When returned by a lifecycle method, the request lifecycle skips to the finalizing step
+     * without further interaction with the node response stream. It is the developer's responsibility to write
+     * and end the response directly via [request.raw.res](https://github.com/hapijs/hapi/blob/master/API.md#request.raw).
+     */
+    readonly abandon: symbol;
+
+    /**
+     * A response symbol. When returned by a lifecycle method, the request lifecycle skips to the finalizing step after
+     * calling request.raw.res.end()) to close the the node response stream.
+     */
+    readonly close: symbol;
+
+    /**
+     * A response symbol. Provides access to the route or server context set via the route [bind](https://github.com/hapijs/hapi/blob/master/API.md#route.options.bind)
+     * option or [server.bind()](https://github.com/hapijs/hapi/blob/master/API.md#server.bind()).
+     */
+    readonly context: any;
+
+    /**
+     * A response symbol. When returned by a lifecycle method, the request lifecycle continues without changing the response.
+     */
+    readonly continue: symbol;
+
+    /**
+     * The [server realm](https://github.com/hapijs/hapi/blob/master/API.md#server.realm) associated with the matching
+     * route. Defaults to the root server realm in the onRequest step.
+     */
+    readonly realm: ServerRealm;
+
+    /**
+     * Access: read only and public request interface.
+     * The [request] object. This is a duplication of the request lifecycle method argument used by
+     * [toolkit decorations](https://github.com/hapijs/hapi/blob/master/API.md#server.decorate()) to access the current request.
+     */
+    readonly request: Readonly<Request<Refs>>;
+
+    /**
+     * Used by the [authentication] method to pass back valid credentials where:
+     * @param data - an object with:
+     * * credentials - (required) object representing the authenticated entity.
+     * * artifacts - (optional) authentication artifacts object specific to the authentication scheme.
+     * @return Return value: an internal authentication object.
+     */
+    authenticated <
+        AuthUser = MergeRefs<Refs>['AuthUser'],
+        AuthApp  = MergeRefs<Refs>['AuthApp'],
+        CredentialsExtra = MergeRefs<Refs>['AuthCredentialsExtra'],
+        ArtifactsExtra = MergeRefs<Refs>['AuthArtifactsExtra']
+    >(
+        data: (
+            AuthenticationData<
+                AuthUser,
+                AuthApp,
+                CredentialsExtra,
+                ArtifactsExtra
+            >
+        )
+    ): Auth<
+        AuthUser,
+        AuthApp,
+        CredentialsExtra,
+        ArtifactsExtra
+    >;
+
+    /**
+     * Sets the response 'ETag' and 'Last-Modified' headers and checks for any conditional request headers to decide if
+     * the response is going to qualify for an HTTP 304 (Not Modified). If the entity values match the request
+     * conditions, h.entity() returns a response object for the lifecycle method to return as its value which will
+     * set a 304 response. Otherwise, it sets the provided entity headers and returns undefined.
+     * The method arguments are:
+     * @param options - a required configuration object with:
+     * * etag - the ETag string. Required if modified is not present. Defaults to no header.
+     * * modified - the Last-Modified header value. Required if etag is not present. Defaults to no header.
+     * * vary - same as the response.etag() option. Defaults to true.
+     * @return Return value: - a response object if the response is unmodified. - undefined if the response has changed.
+     * If undefined is returned, the developer must return a valid lifecycle method value. If a response is returned,
+     * it should be used as the return value (but may be customize using the response methods).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hentityoptions)
+     */
+    entity(options?: {etag?: string | undefined, modified?: string | undefined, vary?: boolean | undefined} | undefined): ResponseObject;
+
+    /**
+     * Redirects the client to the specified uri. Same as calling h.response().redirect(uri).
+     * @param url
+     * @return Returns a response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hredirecturi)
+     */
+    redirect(uri?: string | undefined): ResponseObject;
+
+    /**
+     * Wraps the provided value and returns a response object which allows customizing the response
+     * (e.g. setting the HTTP status code, custom headers, etc.), where:
+     * @param value - (optional) return value. Defaults to null.
+     * @return Returns a response object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hresponsevalue)
+     */
+    response(value?: ResponseValue | undefined): ResponseObject;
+
+    /**
+     * Sets a response cookie using the same arguments as response.state().
+     * @param name of the cookie
+     * @param value of the cookie
+     * @param (optional) ServerStateCookieOptions object.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hstatename-value-options)
+     */
+    state(name: string, value: string | object, options?: ServerStateCookieOptions | undefined): void;
+
+    /**
+     * Used by the [authentication] method to indicate authentication failed and pass back the credentials received where:
+     * @param error - (required) the authentication error.
+     * @param data - (optional) an object with:
+     * * credentials - (required) object representing the authenticated entity.
+     * * artifacts - (optional) authentication artifacts object specific to the authentication scheme.
+     * @return void.
+     * The method is used to pass both the authentication error and the credentials. For example, if a request included
+     * expired credentials, it allows the method to pass back the user information (combined with a 'try'
+     * authentication mode) for error customization.
+     * There is no difference between throwing the error or passing it with the h.unauthenticated() method is no credentials are passed, but it might still be helpful for code clarity.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hunauthenticatederror-data)
+     */
+    unauthenticated <
+        AuthUser = MergeRefs<Refs>['AuthUser'],
+        AuthApp = MergeRefs<Refs>['AuthApp'],
+        CredentialsExtra = MergeRefs<Refs>['AuthCredentialsExtra'],
+        ArtifactsExtra = MergeRefs<Refs>['AuthArtifactsExtra']
+    >(
+        error: Error,
+        data?: (
+            AuthenticationData<
+                AuthUser,
+                AuthApp,
+                CredentialsExtra,
+                ArtifactsExtra
+            >
+        ) | undefined
+    ): Auth<
+        AuthUser,
+        AuthApp,
+        CredentialsExtra,
+        ArtifactsExtra
+    >;
+
+    /**
+     * Clears a response cookie using the same arguments as
+     * @param name of the cookie
+     * @param options (optional) ServerStateCookieOptions object.
+     * @return void.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-hunstatename-options)
+     */
+    unstate(name: string, options?: ServerStateCookieOptions | undefined): void;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/route.d.ts b/node_modules/@hapi/hapi/lib/types/route.d.ts
new file mode 100644
index 0000000..f85cf00
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/route.d.ts
@@ -0,0 +1,982 @@
+
+import { ObjectSchema, ValidationOptions, SchemaMap, Schema } from 'joi';
+
+import { PluginSpecificConfiguration} from './plugin';
+import { MergeType, ReqRef, ReqRefDefaults, MergeRefs, AuthMode } from './request';
+import { ContentDecoders, ContentEncoders, RouteRequestExtType, RouteExtObject, Server } from './server';
+import { Lifecycle, Json, HTTP_METHODS } from './utils';
+
+/**
+ * Overrides for `InternalRouteOptionType`. Extend this to have
+ * typings for route.options.auth['strategy' || 'scope']
+ *
+ * @example
+ *
+ * interface RoutOptionTypes {
+ *      Strategy: 'jwt' | 'basic' | 'myCustom'
+ *      Scope: 'user' | 'admin' | 'manager-users'
+ * }
+ */
+export interface RouteOptionTypes {
+}
+
+export interface InternalRouteOptionType {
+    Strategy: string;
+    Scope: RouteOptionsAccessScope;
+}
+
+export type RouteOptionsAccessScope = false | string | string[];
+
+export type AccessEntity = 'any' | 'user' | 'app';
+
+export interface RouteOptionsAccessScopeObject {
+    scope: RouteOptionsAccessScope;
+}
+
+export interface RouteOptionsAccessEntityObject {
+    entity: AccessEntity;
+}
+
+export type RouteOptionsAccessObject =
+    RouteOptionsAccessScopeObject
+    | RouteOptionsAccessEntityObject
+    | (RouteOptionsAccessScopeObject & RouteOptionsAccessEntityObject);
+
+/**
+ * Route Authentication Options
+ */
+export interface RouteOptionsAccess {
+    /**
+     * @default none.
+     * An object or array of objects specifying the route access rules. Each rule is evaluated against an incoming request and access is granted if at least one of the rules matches. Each rule object
+     * must include at least one of scope or entity.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthaccess)
+     */
+    access?: RouteOptionsAccessObject | RouteOptionsAccessObject[] | undefined;
+
+    /**
+     * @default false (no scope requirements).
+     * The application scope required to access the route. Value can be a scope string or an array of scope strings. When authenticated, the credentials object scope property must contain at least
+     * one of the scopes defined to access the route. If a scope string begins with a + character, that scope is required. If a scope string begins with a ! character, that scope is forbidden. For
+     * example, the scope ['!a', '+b', 'c', 'd'] means the incoming request credentials' scope must not include 'a', must include 'b', and must include one of 'c' or 'd'. You may also access
+     * properties on the request object (query, params, payload, and credentials) to populate a dynamic scope by using the '{' and '}' characters around the property name, such as 'user-{params.id}'.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthaccessscope)
+     */
+    scope?: MergeType<InternalRouteOptionType, RouteOptionTypes>['Scope'] | undefined;
+
+    /**
+     * @default 'any'.
+     * The required authenticated entity type. If set, must match the entity value of the request authenticated credentials. Available values:
+     * * 'any' - the authentication can be on behalf of a user or application.
+     * * 'user' - the authentication must be on behalf of a user which is identified by the presence of a 'user' attribute in the credentials object returned by the authentication strategy.
+     * * 'app' - the authentication must be on behalf of an application which is identified by the lack of presence of a user attribute in the credentials object returned by the authentication
+     * strategy.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthaccessentity)
+     */
+    entity?: AccessEntity | undefined;
+
+    /**
+     * @default 'required'.
+     * The authentication mode. Available values:
+     * * 'required' - authentication is required.
+     * * 'optional' - authentication is optional - the request must include valid credentials or no credentials at all.
+     * * 'try' - similar to 'optional', any request credentials are attempted authentication, but if the credentials are invalid, the request proceeds regardless of the authentication error.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthmode)
+     */
+    mode?: AuthMode | undefined;
+
+    /**
+     * @default false, unless the scheme requires payload authentication.
+     * If set, the incoming request payload is authenticated after it is processed. Requires a strategy with payload authentication support (e.g. Hawk). Cannot be set to a value other than 'required'
+     * when the scheme sets the authentication options.payload to true. Available values:
+     * * false - no payload authentication.
+     * * 'required' - payload authentication required.
+     * * 'optional' - payload authentication performed only when the client includes payload authentication information (e.g. hash attribute in Hawk).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthpayload)
+     */
+    payload?: false | 'required' | 'optional' | undefined;
+
+    /**
+     * @default the default strategy set via server.auth.default().
+     * An array of string strategy names in the order they should be attempted. Cannot be used together with strategy.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthstrategies)
+     */
+    strategies?: (MergeType<InternalRouteOptionType, RouteOptionTypes>['Strategy'])[] | undefined;
+
+    /**
+     * @default the default strategy set via server.auth.default().
+     * A string strategy names. Cannot be used together with strategies.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsauthstrategy)
+     */
+    strategy?: MergeType<InternalRouteOptionType, RouteOptionTypes>['Strategy'] | undefined;
+}
+
+/**
+ * Values are:
+ * * * 'default' - no privacy flag.
+ * * * 'public' - mark the response as suitable for public caching.
+ * * * 'private' - mark the response as suitable only for private caching.
+ * * expiresIn - relative expiration expressed in the number of milliseconds since the item was saved in the cache. Cannot be used together with expiresAt.
+ * * expiresAt - time of day expressed in 24h notation using the 'HH:MM' format, at which point all cache records for the route expire. Cannot be used together with expiresIn.
+ * * statuses - an array of HTTP response status code numbers (e.g. 200) which are allowed to include a valid caching directive.
+ * * otherwise - a string with the value of the 'Cache-Control' header when caching is disabled.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionscache)
+ */
+export type RouteOptionsCache = {
+    privacy?: 'default' | 'public' | 'private' | undefined;
+    statuses?: number[] | undefined;
+    otherwise?: string | undefined;
+} & (
+    {
+        expiresIn?: number | undefined;
+        expiresAt?: undefined;
+    } | {
+    expiresIn?: undefined;
+    expiresAt?: string | undefined;
+} | {
+    expiresIn?: undefined;
+    expiresAt?: undefined;
+}
+    );
+
+/**
+ * @default false (no CORS headers).
+ * The Cross-Origin Resource Sharing protocol allows browsers to make cross-origin API calls. CORS is required by web applications running inside a browser which are loaded from a different domain
+ * than the API server. To enable, set cors to true, or to an object with the following options:
+ * * origin - an array of allowed origin servers strings ('Access-Control-Allow-Origin'). The array can contain any combination of fully qualified origins along with origin strings containing a
+ * wildcard '*' character, or a single '*' origin string. If set to 'ignore', any incoming Origin header is ignored (present or not) and the 'Access-Control-Allow-Origin' header is set to '*'.
+ * Defaults to any origin ['*'].
+ * * maxAge - number of seconds the browser should cache the CORS response ('Access-Control-Max-Age'). The greater the value, the longer it will take before the browser checks for changes in policy.
+ * Defaults to 86400 (one day).
+ * * headers - a strings array of allowed headers ('Access-Control-Allow-Headers'). Defaults to ['Accept', 'Authorization', 'Content-Type', 'If-None-Match'].
+ * * additionalHeaders - a strings array of additional headers to headers. Use this to keep the default headers in place.
+ * * exposedHeaders - a strings array of exposed headers ('Access-Control-Expose-Headers'). Defaults to ['WWW-Authenticate', 'Server-Authorization'].
+ * * additionalExposedHeaders - a strings array of additional headers to exposedHeaders. Use this to keep the default headers in place.
+ * * credentials - if true, allows user credentials to be sent ('Access-Control-Allow-Credentials'). Defaults to false.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionscors)
+ */
+export interface RouteOptionsCors {
+    /**
+     * an array of allowed origin servers strings ('Access-Control-Allow-Origin'). The array can contain any combination of fully qualified origins along with origin strings containing a wildcard '*'
+     * character, or a single '*' origin string. If set to 'ignore', any incoming Origin header is ignored (present or not) and the 'Access-Control-Allow-Origin' header is set to '*'. Defaults to any
+     * origin ['*'].
+     */
+    origin?: string[] | '*' | 'ignore' | undefined;
+    /**
+     * number of seconds the browser should cache the CORS response ('Access-Control-Max-Age'). The greater the value, the longer it will take before the browser checks for changes in policy.
+     * Defaults to 86400 (one day).
+     */
+    maxAge?: number | undefined;
+    /**
+     * a strings array of allowed headers ('Access-Control-Allow-Headers'). Defaults to ['Accept', 'Authorization', 'Content-Type', 'If-None-Match'].
+     */
+    headers?: string[] | undefined;
+    /**
+     * a strings array of additional headers to headers. Use this to keep the default headers in place.
+     */
+    additionalHeaders?: string[] | undefined;
+    /**
+     * a strings array of exposed headers ('Access-Control-Expose-Headers'). Defaults to ['WWW-Authenticate', 'Server-Authorization'].
+     */
+    exposedHeaders?: string[] | undefined;
+    /**
+     * a strings array of additional headers to exposedHeaders. Use this to keep the default headers in place.
+     */
+    additionalExposedHeaders?: string[] | undefined;
+    /**
+     * if true, allows user credentials to be sent ('Access-Control-Allow-Credentials'). Defaults to false.
+     */
+    credentials?: boolean | undefined;
+    /**
+     * the status code used for CORS preflight responses, either 200 or 204. Defaults to 200.
+     */
+    preflightStatusCode?: 200 | 204;
+}
+
+/**
+ * The value must be one of:
+ * * 'data' - the incoming payload is read fully into memory. If parse is true, the payload is parsed (JSON, form-decoded, multipart) based on the 'Content-Type' header. If parse is false, a raw
+ * Buffer is returned.
+ * * 'stream' - the incoming payload is made available via a Stream.Readable interface. If the payload is 'multipart/form-data' and parse is true, field values are presented as text while files are
+ * provided as streams. File streams from a 'multipart/form-data' upload will also have a hapi property containing the filename and headers properties. Note that payload streams for multipart
+ * payloads are a synthetic interface created on top of the entire multipart content loaded into memory. To avoid loading large multipart payloads into memory, set parse to false and handle the
+ * multipart payload in the handler using a streaming parser (e.g. pez).
+ * * 'file' - the incoming payload is written to temporary file in the directory specified by the uploads settings. If the payload is 'multipart/form-data' and parse is true, field values are
+ * presented as text while files are saved to disk. Note that it is the sole responsibility of the application to clean up the files generated by the framework. This can be done by keeping track of
+ * which files are used (e.g. using the request.app object), and listening to the server 'response' event to perform cleanup. For context [See
+ * docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadoutput)
+ */
+export type PayloadOutput = 'data' | 'stream' | 'file';
+
+/**
+ * Determines how the request payload is processed.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayload)
+ */
+export interface RouteOptionsPayload {
+    /**
+     * @default allows parsing of the following mime types:
+     * * application/json
+     * * application/*+json
+     * * application/octet-stream
+     * * application/x-www-form-urlencoded
+     * * multipart/form-data
+     * * text/*
+     * A string or an array of strings with the allowed mime types for the endpoint. Use this settings to limit the set of allowed mime types. Note that allowing additional mime types not listed
+     * above will not enable them to be parsed, and if parse is true, the request will result in an error response.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadallow)
+     */
+    allow?: string | string[] | undefined;
+
+    /**
+     * @default none.
+     * An object where each key is a content-encoding name and each value is an object with the desired decoder settings. Note that encoder settings are set in compression.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadcompression)
+     */
+    compression?: { [P in keyof ContentDecoders]?: Parameters<ContentDecoders[P]>[0] } | undefined;
+
+    /**
+     * @default 'application/json'.
+     * The default content type if the 'Content-Type' request header is missing.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloaddefaultcontenttype)
+     */
+    defaultContentType?: string | undefined;
+
+    /**
+     * @default 'error' (return a Bad Request (400) error response).
+     * A failAction value which determines how to handle payload parsing errors.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadfailaction)
+     */
+    failAction?: Lifecycle.FailAction | undefined;
+
+    /**
+     * @default 1048576 (1MB).
+     * Limits the size of incoming payloads to the specified byte count. Allowing very large payloads may cause the server to run out of memory.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadmaxbytes)
+     */
+    maxBytes?: number | undefined;
+
+    /**
+     * @default 1000
+     * Limits the number of parts allowed in multipart payloads.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadmaxparts)
+     */
+    maxParts?: number;
+
+    /**
+     * @default none.
+     * Overrides payload processing for multipart requests. Value can be one of:
+     * * false - disable multipart processing.
+     * an object with the following required options:
+     * * output - same as the output option with an additional value option:
+     * * * annotated - wraps each multipart part in an object with the following keys: // TODO type this?
+     * * * * headers - the part headers.
+     * * * * filename - the part file name.
+     * * * * payload - the processed part payload.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadmultipart)
+     */
+    multipart?: boolean | { output: PayloadOutput | 'annotated' };
+
+    /**
+     * @default 'data'.
+     * The processed payload format. The value must be one of:
+     * * 'data' - the incoming payload is read fully into memory. If parse is true, the payload is parsed (JSON, form-decoded, multipart) based on the 'Content-Type' header. If parse is false, a raw
+     * Buffer is returned.
+     * * 'stream' - the incoming payload is made available via a Stream.Readable interface. If the payload is 'multipart/form-data' and parse is true, field values are presented as text while files
+     * are provided as streams. File streams from a 'multipart/form-data' upload will also have a hapi property containing the filename and headers properties. Note that payload streams for multipart
+     * payloads are a synthetic interface created on top of the entire multipart content loaded into memory. To avoid loading large multipart payloads into memory, set parse to false and handle the
+     * multipart payload in the handler using a streaming parser (e.g. pez).
+     * * 'file' - the incoming payload is written to temporary file in the directory specified by the uploads settings. If the payload is 'multipart/form-data' and parse is true, field values are
+     * presented as text while files are saved to disk. Note that it is the sole responsibility of the application to clean up the files generated by the framework. This can be done by keeping track
+     * of which files are used (e.g. using the request.app object), and listening to the server 'response' event to perform cleanup.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadoutput)
+     */
+    output?: PayloadOutput | undefined;
+
+    /**
+     * @default none.
+     * A mime type string overriding the 'Content-Type' header value received.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadoverride)
+     */
+    override?: string | undefined;
+
+    /**
+     * @default true.
+     * Determines if the incoming payload is processed or presented raw. Available values:
+     * * true - if the request 'Content-Type' matches the allowed mime types set by allow (for the whole payload as well as parts), the payload is converted into an object when possible. If the
+     * format is unknown, a Bad Request (400) error response is sent. Any known content encoding is decoded.
+     * * false - the raw payload is returned unmodified.
+     * * 'gunzip' - the raw payload is returned unmodified after any known content encoding is decoded.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadparse)
+     */
+    parse?: boolean | 'gunzip' | undefined;
+
+    /**
+     * @default to 'error'.
+     * Sets handling of incoming payload that may contain a prototype poisoning security attack.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadprotoaction)
+     */
+    protoAction?: 'error' | 'remove' | 'ignore';
+
+    /**
+     * @default to 10000 (10 seconds).
+     * Payload reception timeout in milliseconds. Sets the maximum time allowed for the client to transmit the request payload (body) before giving up and responding with a Request Timeout (408)
+     * error response. Set to false to disable.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloadtimeout)
+     */
+    timeout?: false | number | undefined;
+
+    /**
+     * @default os.tmpdir().
+     * The directory used for writing file uploads.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayloaduploads)
+     */
+    uploads?: string | undefined;
+}
+
+/**
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspre)
+ */
+export type RouteOptionsPreArray<Refs extends ReqRef = ReqRefDefaults> = RouteOptionsPreAllOptions<Refs>[];
+
+/**
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspre)
+ */
+export type RouteOptionsPreAllOptions<Refs extends ReqRef = ReqRefDefaults> = RouteOptionsPreObject<Refs> | RouteOptionsPreObject<Refs>[] | Lifecycle.Method<Refs>;
+
+/**
+ * An object with:
+ * * method - a lifecycle method.
+ * * assign - key name used to assign the response of the method to in request.pre and request.preResponses.
+ * * failAction - A failAction value which determine what to do when a pre-handler method throws an error. If assign is specified and the failAction setting is not 'error', the error will be assigned.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspre)
+ */
+export interface RouteOptionsPreObject<Refs extends ReqRef = ReqRefDefaults> {
+    /**
+     * a lifecycle method.
+     */
+    method: Lifecycle.Method<Refs>;
+    /**
+     * key name used to assign the response of the method to in request.pre and request.preResponses.
+     */
+    assign?: keyof MergeRefs<Refs>['Pres'] | undefined;
+    /**
+     * A failAction value which determine what to do when a pre-handler method throws an error. If assign is specified and the failAction setting is not 'error', the error will be assigned.
+     */
+    failAction?: Lifecycle.FailAction | undefined;
+}
+
+export type ValidationObject = SchemaMap;
+
+/**
+ * * true - any query parameter value allowed (no validation performed). false - no parameter value allowed.
+ * * a joi validation object.
+ * * a validation function using the signature async function(value, options) where:
+ * * * value - the request.* object containing the request parameters.
+ * * * options - options.
+ */
+export type RouteOptionsResponseSchema =
+    boolean
+    | ValidationObject
+    | Schema
+    | ((value: object | Buffer | string, options: ValidationOptions) => Promise<any>);
+
+/**
+ * Processing rules for the outgoing response.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponse)
+ */
+export interface RouteOptionsResponse {
+    /**
+     * @default 204.
+     * The default HTTP status code when the payload is considered empty. Value can be 200 or 204. Note that a 200 status code is converted to a 204 only at the time of response transmission (the
+     * response status code will remain 200 throughout the request lifecycle unless manually set).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponseemptystatuscode)
+     */
+    emptyStatusCode?: 200 | 204 | undefined;
+
+    /**
+     * @default 'error' (return an Internal Server Error (500) error response).
+     * A failAction value which defines what to do when a response fails payload validation.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponsefailaction)
+     */
+    failAction?: Lifecycle.FailAction | undefined;
+
+    /**
+     * @default false.
+     * If true, applies the validation rule changes to the response payload.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponsemodify)
+     */
+    modify?: boolean | undefined;
+
+    /**
+     * @default none.
+     * [joi](https://github.com/hapijs/joi) options object pass to the validation function. Useful to set global options such as stripUnknown or abortEarly (the complete list is available here). If a
+     * custom validation function is defined via schema or status then options can an arbitrary object that will be passed to this function as the second argument.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponseoptions)
+     */
+    options?: ValidationOptions | undefined; // TODO needs validation
+
+    /**
+     * @default true.
+     * If false, payload range support is disabled.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponseranges)
+     */
+    ranges?: boolean | undefined;
+
+    /**
+     * @default 100 (all responses).
+     * The percent of response payloads validated (0 - 100). Set to 0 to disable all validation.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponsesample)
+     */
+    sample?: number | undefined;
+
+    /**
+     * @default true (no validation).
+     * The default response payload validation rules (for all non-error responses) expressed as one of:
+     * * true - any payload allowed (no validation).
+     * * false - no payload allowed.
+     * * a joi validation object. The options along with the request context ({ headers, params, query, payload, app, auth }) are passed to the validation function.
+     * * a validation function using the signature async function(value, options) where:
+     * * * value - the pending response payload.
+     * * * options - The options along with the request context ({ headers, params, query, payload, app, auth }).
+     * * * if the function returns a value and modify is true, the value is used as the new response. If the original response is an error, the return value is used to override the original error
+     * output.payload. If an error is thrown, the error is processed according to failAction.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponseschema)
+     */
+    schema?: RouteOptionsResponseSchema | undefined;
+
+    /**
+     * @default none.
+     * Validation schemas for specific HTTP status codes. Responses (excluding errors) not matching the listed status codes are validated using the default schema.
+     * status is set to an object where each key is a 3 digit HTTP status code and the value has the same definition as schema.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponsestatus)
+     */
+    status?: Record<string, RouteOptionsResponseSchema> | undefined;
+
+    /**
+     * The default HTTP status code used to set a response error when the request is closed or aborted before the
+     * response is fully transmitted.
+     * Value can be any integer greater or equal to 400.
+     * The default value 499 is based on the non-standard nginx "CLIENT CLOSED REQUEST" error.
+     * The value is only used for logging as the request has already ended.
+     * @default 499
+     */
+    disconnectStatusCode?: number | undefined;
+}
+
+/**
+ * @see https://www.w3.org/TR/referrer-policy/
+ */
+export type ReferrerPolicy = '' | 'no-referrer' | 'no-referrer-when-downgrade' | 'unsafe-url' |
+    'same-origin' | 'origin' |  'strict-origin' | 'origin-when-cross-origin' | 'strict-origin-when-cross-origin';
+
+/**
+ * @default false (security headers disabled).
+ * Sets common security headers. To enable, set security to true or to an object with the following options:
+ * * hsts - controls the 'Strict-Transport-Security' header, where:
+ * * * true - the header will be set to max-age=15768000. This is the default value.
+ * * * a number - the maxAge parameter will be set to the provided value.
+ * * * an object with the following fields:
+ * * * * maxAge - the max-age portion of the header, as a number. Default is 15768000.
+ * * * * includeSubDomains - a boolean specifying whether to add the includeSubDomains flag to the header.
+ * * * * preload - a boolean specifying whether to add the 'preload' flag (used to submit domains inclusion in Chrome's HTTP Strict Transport Security (HSTS) preload list) to the header.
+ * * xframe - controls the 'X-Frame-Options' header, where:
+ * * * true - the header will be set to 'DENY'. This is the default value.
+ * * * 'deny' - the headers will be set to 'DENY'.
+ * * * 'sameorigin' - the headers will be set to 'SAMEORIGIN'.
+ * * * an object for specifying the 'allow-from' rule, where:
+ * * * * rule - one of:
+ * * * * * 'deny'
+ * * * * * 'sameorigin'
+ * * * * * 'allow-from'
+ * * * * source - when rule is 'allow-from' this is used to form the rest of the header, otherwise this field is ignored. If rule is 'allow-from' but source is unset, the rule will be automatically
+ * changed to 'sameorigin'.
+ * * xss - controls the 'X-XSS-Protection' header, where:
+ * * * 'disabled' - the header will be set to '0'. This is the default value.
+ * * * 'enabled' - the header will be set to '1; mode=block'.
+ * * * false - the header will be omitted
+ * * noOpen - boolean controlling the 'X-Download-Options' header for Internet Explorer, preventing downloads from executing in your context. Defaults to true setting the header to 'noopen'.
+ * * noSniff - boolean controlling the 'X-Content-Type-Options' header. Defaults to true setting the header to its only and default option, 'nosniff'.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionssecurity)
+ */
+export interface RouteOptionsSecureObject {
+    /**
+     * hsts - controls the 'Strict-Transport-Security' header
+     */
+    hsts?: boolean | number | {
+        /**
+         * the max-age portion of the header, as a number. Default is 15768000.
+         */
+        maxAge?: number;
+        /**
+         * a boolean specifying whether to add the includeSubDomains flag to the header.
+         */
+        includeSubDomains?: boolean;
+        /**
+         * a boolean specifying whether to add the 'preload' flag (used to submit domains inclusion in Chrome's HTTP Strict Transport Security (HSTS) preload list) to the header.
+         */
+        preload?: boolean;
+    } | undefined;
+    /**
+     * controls the 'X-Frame-Options' header
+     */
+    xframe?: true | 'deny' | 'sameorigin' | {
+        /**
+         * an object for specifying the 'allow-from' rule,
+         */
+        rule: 'deny' | 'sameorigin' | 'allow-from';
+        /**
+         * when rule is 'allow-from' this is used to form the rest of the header, otherwise this field is ignored. If rule is 'allow-from' but source is unset, the rule will be automatically changed
+         * to 'sameorigin'.
+         */
+        source: string;
+    } | undefined;
+    /**
+     * controls the 'X-XSS-Protection' header, where:
+     * * 'disabled' - the header will be set to '0'. This is the default value.
+     * * 'enabled' - the header will be set to '1; mode=block'.
+     * * false - the header will be omitted
+     */
+    xss?: 'disabled' | 'enabled' | false | undefined;
+    /**
+     * boolean controlling the 'X-Download-Options' header for Internet Explorer, preventing downloads from executing in your context. Defaults to true setting the header to 'noopen'.
+     */
+    noOpen?: boolean | undefined;
+    /**
+     * boolean controlling the 'X-Content-Type-Options' header. Defaults to true setting the header to its only and default option, 'nosniff'.
+     */
+    noSniff?: boolean | undefined;
+
+    /**
+     * Controls the `Referrer-Policy` header, which has the following possible values.
+     * @default false Header will not be send.
+     */
+    referrer?: false | ReferrerPolicy | undefined;
+}
+
+export type RouteOptionsSecure = boolean | RouteOptionsSecureObject;
+
+/**
+ * @default { headers: true, params: true, query: true, payload: true, failAction: 'error' }.
+ * Request input validation rules for various request components.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidate)
+ */
+export interface RouteOptionsValidate {
+    /**
+     * @default none.
+     * An optional object with error fields copied into every validation error response.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidateerrorfields)
+     */
+    errorFields?: object | undefined;
+
+    /**
+     * @default 'error' (return a Bad Request (400) error response).
+     * A failAction value which determines how to handle failed validations. When set to a function, the err argument includes the type of validation error under err.output.payload.validation.source.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidatefailaction)
+     */
+    failAction?: Lifecycle.FailAction | undefined;
+
+    /**
+     * Validation rules for incoming request headers:
+     * * If a value is returned, the value is used as the new request.headers value and the original value is stored in request.orig.headers. Otherwise, the headers are left unchanged. If an error
+     * is thrown, the error is handled according to failAction. Note that all header field names must be in lowercase to match the headers normalized by node.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidateheaders)
+     * @default true
+     */
+    headers?: RouteOptionsResponseSchema | undefined;
+
+    /**
+     * An options object passed to the joi rules or the custom validation methods. Used for setting global options such as stripUnknown or abortEarly (the complete list is available here).
+     * If a custom validation function (see headers, params, query, or payload above) is defined then options can an arbitrary object that will be passed to this function as the second parameter.
+     * The values of the other inputs (i.e. headers, query, params, payload, app, and auth) are added to the options object under the validation context (accessible in rules as
+     * Joi.ref('$query.key')).
+     * Note that validation is performed in order (i.e. headers, params, query, and payload) and if type casting is used (e.g. converting a string to a number), the value of inputs not yet validated
+     * will reflect the raw, unvalidated and unmodified values. If the validation rules for headers, params, query, and payload are defined at both the server routes level and at the route level, the
+     * individual route settings override the routes defaults (the rules are not merged).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidateparams)
+     * @default true
+     */
+    options?: ValidationOptions | object | undefined;
+
+    /**
+     * Validation rules for incoming request path parameters, after matching the path against the route, extracting any parameters, and storing them in request.params, where:
+     * * true - any path parameter value allowed (no validation performed).
+     * * a joi validation object.
+     * * a validation function using the signature async function(value, options) where:
+     * * * value - the request.params object containing the request path parameters.
+     * * * options - options.
+     * if a value is returned, the value is used as the new request.params value and the original value is stored in request.orig.params. Otherwise, the path parameters are left unchanged. If an
+     * error is thrown, the error is handled according to failAction. Note that failing to match the validation rules to the route path parameters definition will cause all requests to fail.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidateparams)
+     * @default true
+     */
+    params?: RouteOptionsResponseSchema | undefined;
+
+    /**
+     * Validation rules for incoming request payload (request body), where:
+     * * If a value is returned, the value is used as the new request.payload value and the original value is stored in request.orig.payload. Otherwise, the payload is left unchanged. If an error is
+     * thrown, the error is handled according to failAction. Note that validating large payloads and modifying them will cause memory duplication of the payload (since the original is kept), as well
+     * as the significant performance cost of validating large amounts of data.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidatepayload)
+     * @default true
+     */
+    payload?: RouteOptionsResponseSchema | undefined;
+
+    /**
+     * Validation rules for incoming request URI query component (the key-value part of the URI between '?' and '#'). The query is parsed into its individual key-value pairs, decoded, and stored in
+     * request.query prior to validation. Where:
+     * * If a value is returned, the value is used as the new request.query value and the original value is stored in request.orig.query. Otherwise, the query parameters are left unchanged.
+     * If an error
+     * is thrown, the error is handled according to failAction. Note that changes to the query parameters will not be reflected in request.url.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidatequery)
+     * @default true
+     */
+    query?: RouteOptionsResponseSchema | undefined;
+
+    /**
+     * Validation rules for incoming cookies.
+     * The cookie header is parsed and decoded into the request.state prior to validation.
+     * @default true
+     */
+    state?: RouteOptionsResponseSchema | undefined;
+}
+
+export interface CommonRouteProperties<Refs extends ReqRef = ReqRefDefaults> {
+    /**
+     * Application-specific route configuration state. Should not be used by plugins which should use options.plugins[name] instead.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsapp)
+     */
+    app?:  MergeRefs<Refs>['RouteApp'] | undefined;
+
+    /**
+     * @default null.
+     * An object passed back to the provided handler (via this) when called. Ignored if the method is an arrow function.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsbind)
+     */
+    bind?: MergeRefs<Refs>['Bind'] | undefined;
+
+    /**
+     * @default { privacy: 'default', statuses: [200], otherwise: 'no-cache' }.
+     * If the route method is 'GET', the route can be configured to include HTTP caching directives in the response. Caching can be customized using an object with the following options:
+     * privacy - determines the privacy flag included in client-side caching using the 'Cache-Control' header. Values are:
+     * * * 'default' - no privacy flag.
+     * * * 'public' - mark the response as suitable for public caching.
+     * * * 'private' - mark the response as suitable only for private caching.
+     * * expiresIn - relative expiration expressed in the number of milliseconds since the item was saved in the cache. Cannot be used together with expiresAt.
+     * * expiresAt - time of day expressed in 24h notation using the 'HH:MM' format, at which point all cache records for the route expire. Cannot be used together with expiresIn.
+     * * statuses - an array of HTTP response status code numbers (e.g. 200) which are allowed to include a valid caching directive.
+     * * otherwise - a string with the value of the 'Cache-Control' header when caching is disabled.
+     * The default Cache-Control: no-cache header can be disabled by setting cache to false.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionscache)
+     */
+    cache?: false | RouteOptionsCache | undefined;
+
+    /**
+     * An object where each key is a content-encoding name and each value is an object with the desired encoder settings. Note that decoder settings are set in compression.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionscompression)
+     */
+    compression?: { [P in keyof ContentEncoders]?: Parameters<ContentEncoders[P]>[0] } | undefined;
+
+    /**
+     * @default false (no CORS headers).
+     * The Cross-Origin Resource Sharing protocol allows browsers to make cross-origin API calls. CORS is required by web applications running inside a browser which are loaded from a different
+     * domain than the API server. To enable, set cors to true, or to an object with the following options:
+     * * origin - an array of allowed origin servers strings ('Access-Control-Allow-Origin'). The array can contain any combination of fully qualified origins along with origin strings containing a
+     * wildcard '*' character, or a single '*' origin string. If set to 'ignore', any incoming Origin header is ignored (present or not) and the 'Access-Control-Allow-Origin' header is set to '*'.
+     * Defaults to any origin ['*'].
+     * * maxAge - number of seconds the browser should cache the CORS response ('Access-Control-Max-Age'). The greater the value, the longer it will take before the browser checks for changes in
+     * policy. Defaults to 86400 (one day).
+     * * headers - a strings array of allowed headers ('Access-Control-Allow-Headers'). Defaults to ['Accept', 'Authorization', 'Content-Type', 'If-None-Match'].
+     * * additionalHeaders - a strings array of additional headers to headers. Use this to keep the default headers in place.
+     * * exposedHeaders - a strings array of exposed headers ('Access-Control-Expose-Headers'). Defaults to ['WWW-Authenticate', 'Server-Authorization'].
+     * * additionalExposedHeaders - a strings array of additional headers to exposedHeaders. Use this to keep the default headers in place.
+     * * credentials - if true, allows user credentials to be sent ('Access-Control-Allow-Credentials'). Defaults to false.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionscors)
+     */
+    cors?: boolean | RouteOptionsCors | undefined;
+
+    /**
+     * @default none.
+     * Route description used for generating documentation (string).
+     * This setting is not available when setting server route defaults using server.options.routes.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsdescription)
+     */
+    description?: string | undefined;
+
+    /**
+     * @default none.
+     * Route-level request extension points by setting the option to an object with a key for each of the desired extension points ('onRequest' is not allowed), and the value is the same as the
+     * server.ext(events) event argument.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsext)
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#request-lifecycle)
+     */
+    ext?: {
+        [key in RouteRequestExtType]?: RouteExtObject | RouteExtObject[] | undefined;
+    } | undefined;
+
+    /**
+     * @default { relativeTo: '.' }.
+     * Defines the behavior for accessing files:
+     * * relativeTo - determines the folder relative paths are resolved against.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsfiles)
+     */
+    files?: {
+        relativeTo: string;
+    } | undefined;
+
+    /**
+     * @default none.
+     * The route handler function performs the main business logic of the route and sets the response. handler can be assigned:
+     * * a lifecycle method.
+     * * an object with a single property using the name of a handler type registered with the server.handler() method. The matching property value is passed as options to the registered handler
+     * generator. Note: handlers using a fat arrow style function cannot be bound to any bind property. Instead, the bound context is available under h.context.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionshandler)
+     */
+    handler?: Lifecycle.Method<Refs> | object | undefined;
+
+    /**
+     * @default none.
+     * An optional unique identifier used to look up the route using server.lookup(). Cannot be assigned to routes added with an array of methods.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsid)
+     */
+    id?: string | undefined;
+
+    /**
+     * @default false.
+     * If true, the route cannot be accessed through the HTTP listener but only through the server.inject() interface with the allowInternals option set to true. Used for internal routes that should
+     * not be accessible to the outside world.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsisinternal)
+     */
+    isInternal?: boolean | undefined;
+
+    /**
+     * @default none.
+     * Optional arguments passed to JSON.stringify() when converting an object or error response to a string payload or escaping it after stringification. Supports the following:
+     * * replacer - the replacer function or array. Defaults to no action.
+     * * space - number of spaces to indent nested object keys. Defaults to no indentation.
+     * * suffix - string suffix added after conversion to JSON string. Defaults to no suffix.
+     * * escape - calls Hoek.jsonEscape() after conversion to JSON string. Defaults to false.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsjson)
+     */
+    json?: Json.StringifyArguments | undefined;
+
+    /**
+     * @default { collect: false }.
+     * Request logging options:
+     * collect - if true, request-level logs (both internal and application) are collected and accessible via request.logs.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionslog)
+     */
+    log?: {
+        collect: boolean;
+    } | undefined;
+
+    /**
+     * @default none.
+     * Route notes used for generating documentation (string or array of strings).
+     * This setting is not available when setting server route defaults using server.options.routes.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsnotes)
+     */
+    notes?: string | string[] | undefined;
+
+    /**
+     * Determines how the request payload is processed.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspayload)
+     */
+    payload?: RouteOptionsPayload | undefined;
+
+    /**
+     * @default {}.
+     * Plugin-specific configuration. plugins is an object where each key is a plugin name and the value is the plugin configuration.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsplugins)
+     */
+    plugins?: PluginSpecificConfiguration | undefined;
+
+    /**
+     * @default none.
+     * The pre option allows defining methods for performing actions before the handler is called. These methods allow breaking the handler logic into smaller, reusable components that can be shared
+     * across routes, as well as provide a cleaner error handling of prerequisite operations (e.g. load required reference data from a database). pre is assigned an ordered array of methods which
+     * are called serially in order. If the pre array contains another array of methods as one of its elements, those methods are called in parallel. Note that during parallel execution, if any of
+     * the methods error, return a takeover response, or abort signal, the other parallel methods will continue to execute but will be ignored once completed. pre can be assigned a mixed array of:
+     * * an array containing the elements listed below, which are executed in parallel.
+     * * an object with:
+     * * * method - a lifecycle method.
+     * * * assign - key name used to assign the response of the method to in request.pre and request.preResponses.
+     * * * failAction - A failAction value which determine what to do when a pre-handler method throws an error. If assign is specified and the failAction setting is not 'error', the error will be
+     * assigned.
+     * * a method function - same as including an object with a single method key.
+     * Note that pre-handler methods do not behave the same way other lifecycle methods do when a value is returned. Instead of the return value becoming the new response payload, the value is used
+     * to assign the corresponding request.pre and request.preResponses properties. Otherwise, the handling of errors, takeover response response, or abort signal behave the same as any other
+     * lifecycle methods.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionspre)
+     */
+    pre?: RouteOptionsPreArray<Refs> | undefined;
+
+    /**
+     * Processing rules for the outgoing response.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsresponse)
+     */
+    response?: RouteOptionsResponse | undefined;
+
+    /**
+     * @default false (security headers disabled).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionssecurity)
+     */
+    security?: RouteOptionsSecure | undefined;
+
+    /**
+     * @default { parse: true, failAction: 'error' }.
+     * HTTP state management (cookies) allows the server to store information on the client which is sent back to the server with every request (as defined in RFC 6265). state supports the following
+     * options: parse - determines if incoming 'Cookie' headers are parsed and stored in the request.state object. failAction - A failAction value which determines how to handle cookie parsing
+     * errors. Defaults to 'error' (return a Bad Request (400) error response).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsstate)
+     */
+    state?: {
+        parse?: boolean | undefined;
+        failAction?: Lifecycle.FailAction | undefined;
+    } | undefined;
+
+    /**
+     * @default none.
+     * Route tags used for generating documentation (array of strings).
+     * This setting is not available when setting server route defaults using server.options.routes.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionstags)
+     */
+    tags?: string[] | undefined;
+
+    /**
+     * @default { server: false }.
+     * Timeouts for processing durations.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionstimeout)
+     */
+    timeout?: {
+        /**
+         * Response timeout in milliseconds. Sets the maximum time allowed for the server to respond to an incoming request before giving up and responding with a Service Unavailable (503) error
+         * response.
+         */
+        server?: boolean | number | undefined;
+
+        /**
+         * @default none (use node default of 2 minutes).
+         * By default, node sockets automatically timeout after 2 minutes. Use this option to override this behavior. Set to false to disable socket timeouts.
+         */
+        socket?: boolean | number | undefined;
+    } | undefined;
+
+    /**
+     * @default { headers: true, params: true, query: true, payload: true, failAction: 'error' }.
+     * Request input validation rules for various request components.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsvalidate)
+     */
+    validate?: RouteOptionsValidate | undefined;
+}
+
+export interface AccessScopes {
+    forbidden?: string[] | undefined;
+    required?: string[] | undefined;
+    selection?: string[] | undefined;
+}
+
+export interface AccessSetting {
+    entity?: AccessEntity | undefined;
+    scope: AccessScopes | false;
+}
+
+export interface AuthSettings {
+    strategies: string[];
+    mode: AuthMode;
+    access?: AccessSetting[] | undefined;
+}
+
+export interface RouteSettings<Refs extends ReqRef = ReqRefDefaults> extends CommonRouteProperties<Refs> {
+    auth?: AuthSettings | undefined;
+}
+
+/**
+ * Each route can be customized to change the default behavior of the request lifecycle.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#route-options)
+ */
+export interface RouteOptions<Refs extends ReqRef = ReqRefDefaults> extends CommonRouteProperties<Refs> {
+    /**
+     * Route authentication configuration. Value can be:
+     * false to disable authentication if a default strategy is set.
+     * a string with the name of an authentication strategy registered with server.auth.strategy(). The strategy will be set to 'required' mode.
+     * an authentication configuration object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsapp)
+     */
+    auth?: false | string | RouteOptionsAccess | undefined;
+}
+
+export interface HandlerDecorations {}
+
+export interface RouteRules {}
+
+export interface RulesInfo {
+    method: string;
+    path: string;
+    vhost: string;
+}
+
+export interface RulesOptions<Refs extends ReqRef = ReqRefDefaults> {
+    validate: {
+        schema?: ObjectSchema<MergeRefs<Refs>['Rules']> | Record<keyof MergeRefs<Refs>['Rules'], Schema> | undefined;
+        options?: ValidationOptions | undefined;
+    };
+}
+
+export interface RulesProcessor<Refs extends ReqRef = ReqRefDefaults> {
+    (rules: MergeRefs<Refs>['Rules'] | null, info: RulesInfo): Partial<RouteOptions<Refs>> | null;
+}
+
+type RouteDefMethods = Exclude<HTTP_METHODS | Lowercase<HTTP_METHODS>, 'HEAD' | 'head'>;
+
+/**
+ * A route configuration object or an array of configuration objects where each object contains:
+ * * path - (required) the absolute path used to match incoming requests (must begin with '/'). Incoming requests are compared to the configured paths based on the server's router configuration. The
+ * path can include named parameters enclosed in {} which will be matched against literal values in the request as described in Path parameters.
+ * * method - (required) the HTTP method. Typically one of 'GET', 'POST', 'PUT', 'PATCH', 'DELETE', or 'OPTIONS'. Any HTTP method is allowed, except for 'HEAD'. Use '*' to match against any HTTP
+ * method (only when an exact match was not found, and any match with a specific method will be given a higher priority over a wildcard match). Can be assigned an array of methods which has the same
+ * result as adding the same route with different methods manually.
+ * * vhost - (optional) a domain string or an array of domain strings for limiting the route to only requests with a matching host header field. Matching is done against the hostname part of the
+ * header only (excluding the port). Defaults to all hosts.
+ * * handler - (required when handler is not set) the route handler function called to generate the response after successful authentication and validation.
+ * * options - additional route options. The options value can be an object or a function that returns an object using the signature function(server) where server is the server the route is being
+ * added to and this is bound to the current realm's bind option.
+ * * rules - route custom rules object. The object is passed to each rules processor registered with server.rules(). Cannot be used if route.options.rules is defined.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverrouteroute)
+ */
+export interface ServerRoute<Refs extends ReqRef = ReqRefDefaults> {
+    /**
+     * (required) the absolute path used to match incoming requests (must begin with '/'). Incoming requests are compared to the configured paths based on the server's router configuration. The path
+     * can include named parameters enclosed in {} which will be matched against literal values in the request as described in Path parameters. For context [See
+     * docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverrouteroute) For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#path-parameters)
+     */
+    path: string;
+
+    /**
+     * (required) the HTTP method. Typically one of 'GET', 'POST', 'PUT', 'PATCH', 'DELETE', or 'OPTIONS'. Any HTTP method is allowed, except for 'HEAD'. Use '*' to match against any HTTP method
+     * (only when an exact match was not found, and any match with a specific method will be given a higher priority over a wildcard match). Can be assigned an array of methods which has the same
+     * result as adding the same route with different methods manually.
+     */
+    method: RouteDefMethods | RouteDefMethods[] | '*';
+
+    /**
+     * (optional) a domain string or an array of domain strings for limiting the route to only requests with a matching host header field. Matching is done against the hostname part of the header
+     * only (excluding the port). Defaults to all hosts.
+     */
+    vhost?: string | string[] | undefined;
+
+    /**
+     * (required when handler is not set) the route handler function called to generate the response after successful authentication and validation.
+     */
+    handler?: Lifecycle.Method<Refs> | HandlerDecorations | undefined;
+
+    /**
+     * additional route options. The options value can be an object or a function that returns an object using the signature function(server) where server is the server the route is being added to
+     * and this is bound to the current realm's bind option.
+     */
+    options?: RouteOptions<Refs> | ((server: Server) => RouteOptions<Refs>) | undefined;
+
+    /**
+     * route custom rules object. The object is passed to each rules processor registered with server.rules(). Cannot be used if route.options.rules is defined.
+     */
+    rules?: MergeRefs<Refs>['Rules'] | undefined;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/auth.d.ts b/node_modules/@hapi/hapi/lib/types/server/auth.d.ts
new file mode 100644
index 0000000..afc6ba9
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/auth.d.ts
@@ -0,0 +1,201 @@
+import { Server } from './server';
+import {
+    MergeType,
+    ReqRef,
+    ReqRefDefaults,
+    MergeRefs,
+    Request,
+    RequestAuth} from '../request';
+import { ResponseToolkit, AuthenticationData } from '../response';
+import { RouteOptionsAccess, InternalRouteOptionType, RouteOptionTypes} from '../route';
+import { Lifecycle } from '../utils';
+
+/**
+ * The scheme options argument passed to server.auth.strategy() when instantiation a strategy.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthschemename-scheme)
+ */
+export type ServerAuthSchemeOptions = object;
+
+/**
+ * the method implementing the scheme with signature function(server, options) where:
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthschemename-scheme)
+ * @param server - a reference to the server object the scheme is added to.
+ * @param options - (optional) the scheme options argument passed to server.auth.strategy() when instantiation a strategy.
+ */
+export type ServerAuthScheme<
+    // tslint:disable-next-line no-unnecessary-generics
+    Options extends ServerAuthSchemeOptions = ServerAuthSchemeOptions,
+    // tslint:disable-next-line no-unnecessary-generics
+    Refs extends ReqRef = ReqRefDefaults
+> = (server: Server, options?: Options) => ServerAuthSchemeObject<Refs>;
+
+export interface ServerAuthSchemeObjectApi {}
+
+/**
+ * The scheme method must return an object with the following
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#authentication-scheme)
+ */
+
+export interface ServerAuthSchemeObject<Refs extends ReqRef = ReqRefDefaults> {
+    /**
+     * optional object which is exposed via the [server.auth.api](https://github.com/hapijs/hapi/blob/master/API.md#server.auth.api) object.
+     */
+    api?: MergeRefs<Refs>['AuthApi'] | undefined;
+
+    /**
+     * A lifecycle method function called for each incoming request configured with the authentication scheme. The
+     * method is provided with two special toolkit methods for returning an authenticated or an unauthenticated result:
+     * * h.authenticated() - indicate request authenticated successfully.
+     * * h.unauthenticated() - indicate request failed to authenticate.
+     * @param request the request object.
+     * @param h the ResponseToolkit
+     * @return the Lifecycle.ReturnValue
+     */
+    authenticate(request: Request<Refs>, h: ResponseToolkit<Refs>): Lifecycle.ReturnValue<Refs>;
+
+    /**
+     * A lifecycle method to authenticate the request payload.
+     * When the scheme payload() method returns an error with a message, it means payload validation failed due to bad
+     * payload. If the error has no message but includes a scheme name (e.g. Boom.unauthorized(null, 'Custom')),
+     * authentication may still be successful if the route auth.payload configuration is set to 'optional'.
+     * @param request the request object.
+     * @param h the ResponseToolkit
+     * @return the Lifecycle.ReturnValue
+     */
+    payload?(request: Request<Refs>, h: ResponseToolkit<Refs>): Lifecycle.ReturnValue<Refs>;
+
+    /**
+     * A lifecycle method to decorate the response with authentication headers before the response headers or payload is written.
+     * @param request the request object.
+     * @param h the ResponseToolkit
+     * @return the Lifecycle.ReturnValue
+     */
+    response?(request: Request<Refs>, h: ResponseToolkit<Refs>): Lifecycle.ReturnValue<Refs>;
+
+    /**
+     * a method used to verify the authentication credentials provided
+     * are still valid (e.g. not expired or revoked after the initial authentication).
+     * the method throws an `Error` when the credentials passed are no longer valid (e.g. expired or
+     * revoked). Note that the method does not have access to the original request, only to the
+     * credentials and artifacts produced by the `authenticate()` method.
+     */
+    verify?(
+        auth: RequestAuth<
+            MergeRefs<Refs>['AuthUser'],
+            MergeRefs<Refs>['AuthApp'],
+            MergeRefs<Refs>['AuthCredentialsExtra'],
+            MergeRefs<Refs>['AuthArtifactsExtra']
+        >
+    ): Promise<void>;
+
+    /**
+     * An object with the following keys:
+     * * payload
+     */
+    options?: {
+        /**
+         * if true, requires payload validation as part of the scheme and forbids routes from disabling payload auth validation. Defaults to false.
+         */
+        payload?: boolean | undefined;
+    } | undefined;
+}
+
+/**
+ * An authentication configuration object using the same format as the route auth handler options.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthdefaultoptions)
+ */
+
+export interface ServerAuthConfig extends RouteOptionsAccess {
+}
+
+export interface ServerAuth {
+    /**
+     * An object where each key is an authentication strategy name and the value is the exposed strategy API.
+     * Available only when the authentication scheme exposes an API by returning an api key in the object
+     * returned from its implementation function.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthapi)
+     */
+    api: Record<string, ServerAuthSchemeObjectApi>;
+
+    /**
+     * Contains the default authentication configuration is a default strategy was set via
+     * [server.auth.default()](https://github.com/hapijs/hapi/blob/master/API.md#server.auth.default()).
+     */
+    readonly settings: {
+        default: ServerAuthConfig;
+    };
+
+    /**
+     * Sets a default strategy which is applied to every route where:
+     * @param options - one of:
+     * * a string with the default strategy name
+     * * an authentication configuration object using the same format as the route auth handler options.
+     * @return void.
+     * The default does not apply when a route config specifies auth as false, or has an authentication strategy
+     * configured (contains the strategy or strategies authentication settings). Otherwise, the route authentication
+     * config is applied to the defaults.
+     * Note that if the route has authentication configured, the default only applies at the time of adding the route,
+     * not at runtime. This means that calling server.auth.default() after adding a route with some authentication
+     * config will have no impact on the routes added prior. However, the default will apply to routes added
+     * before server.auth.default() is called if those routes lack any authentication config.
+     * The default auth strategy configuration can be accessed via server.auth.settings.default. To obtain the active
+     * authentication configuration of a route, use server.auth.lookup(request.route).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthdefaultoptions)
+     */
+    default(options: string | ServerAuthConfig): void;
+
+    /**
+     * Registers an authentication scheme where:
+     * @param name the scheme name.
+     * @param scheme - the method implementing the scheme with signature function(server, options) where:
+     * * server - a reference to the server object the scheme is added to.
+     * * options - (optional) the scheme options argument passed to server.auth.strategy() when instantiation a strategy.
+     * @return void.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthschemename-scheme)
+     */
+
+    scheme <
+        Refs extends ReqRef = ReqRefDefaults,
+        Options extends object = {}
+    // tslint:disable-next-line no-unnecessary-generics
+    >(name: string, scheme: ServerAuthScheme<Options, Refs>): void;
+
+    /**
+     * Registers an authentication strategy where:
+     * @param name - the strategy name.
+     * @param scheme - the scheme name (must be previously registered using server.auth.scheme()).
+     * @param options - scheme options based on the scheme requirements.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverauthstrategyname-scheme-options)
+     */
+    strategy(
+        name: MergeType<InternalRouteOptionType, RouteOptionTypes>['Strategy'],
+        scheme: string,
+        options?: object
+    ): void;
+
+    /**
+     * Tests a request against an authentication strategy where:
+     * @param strategy - the strategy name registered with server.auth.strategy().
+     * @param request - the request object.
+     * @return an object containing the authentication credentials and artifacts if authentication was successful, otherwise throws an error.
+     * Note that the test() method does not take into account the route authentication configuration. It also does not
+     * perform payload authentication. It is limited to the basic strategy authentication execution. It does not
+     * include verifying scope, entity, or other route properties.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverauthteststrategy-request)
+     */
+    test(strategy: string, request: Request): Promise<AuthenticationData>;
+
+    /**
+     * Verify a request's authentication credentials against an authentication strategy.
+     * Returns nothing if verification was successful, otherwise throws an error.
+     *
+     * Note that the `verify()` method does not take into account the route authentication configuration
+     * or any other information from the request other than the `request.auth` object. It also does not
+     * perform payload authentication. It is limited to verifying that the previously valid credentials
+     * are still valid (e.g. have not been revoked or expired). It does not include verifying scope,
+     * entity, or other route properties.
+     */
+    // tslint:disable-next-line no-unnecessary-generics
+    verify <Refs extends ReqRef = ReqRefDefaults>(request: Request<Refs>): Promise<void>;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/cache.d.ts b/node_modules/@hapi/hapi/lib/types/server/cache.d.ts
new file mode 100644
index 0000000..f2b2860
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/cache.d.ts
@@ -0,0 +1,85 @@
+import { PolicyOptionVariants, Policy, ClientApi, ClientOptions, EnginePrototype, PolicyOptions } from '@hapi/catbox';
+
+export type CachePolicyOptions<T> = PolicyOptionVariants<T> & {
+    /**
+     * @default '_default'
+     */
+    cache?: string | undefined;
+    segment?: string | undefined;
+};
+
+/**
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servercacheoptions)
+ */
+export interface ServerCache {
+    /**
+     * Provisions a cache segment within the server cache facility where:
+     * @param options - [catbox policy](https://github.com/hapijs/catbox#policy) configuration where:
+     * * expiresIn - relative expiration expressed in the number of milliseconds since the item was saved in the cache. Cannot be used together with expiresAt.
+     * * expiresAt - time of day expressed in 24h notation using the 'HH:MM' format, at which point all cache records expire. Uses local time. Cannot be used together with expiresIn.
+     * * generateFunc - a function used to generate a new cache item if one is not found in the cache when calling get(). The method's signature is async function(id, flags) where:
+     * - `id` - the `id` string or object provided to the `get()` method.
+     * - `flags` - an object used to pass back additional flags to the cache where:
+     * - `ttl` - the cache ttl value in milliseconds. Set to `0` to skip storing in the cache. Defaults to the cache global policy.
+     * * staleIn - number of milliseconds to mark an item stored in cache as stale and attempt to regenerate it when generateFunc is provided. Must be less than expiresIn.
+     * * staleTimeout - number of milliseconds to wait before checking if an item is stale.
+     * * generateTimeout - number of milliseconds to wait before returning a timeout error when the generateFunc function takes too long to return a value. When the value is eventually returned, it
+     *     is stored in the cache for future requests. Required if generateFunc is present. Set to false to disable timeouts which may cause all get() requests to get stuck forever.
+     * * generateOnReadError - if false, an upstream cache read error will stop the cache.get() method from calling the generate function and will instead pass back the cache error. Defaults to true.
+     * * generateIgnoreWriteError - if false, an upstream cache write error when calling cache.get() will be passed back with the generated value when calling. Defaults to true.
+     * * dropOnError - if true, an error or timeout in the generateFunc causes the stale value to be evicted from the cache. Defaults to true.
+     * * pendingGenerateTimeout - number of milliseconds while generateFunc call is in progress for a given id, before a subsequent generateFunc call is allowed. Defaults to 0 (no blocking of
+     *     concurrent generateFunc calls beyond staleTimeout).
+     * * cache - the cache name configured in server.cache. Defaults to the default cache.
+     * * segment - string segment name, used to isolate cached items within the cache partition. When called within a plugin, defaults to '!name' where 'name' is the plugin name. When called within a
+     *     server method, defaults to '#name' where 'name' is the server method name. Required when called outside of a plugin.
+     * * shared - if true, allows multiple cache provisions to share the same segment. Default to false.
+     * @return Catbox Policy.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servercacheoptions)
+     */
+    <T, O extends CachePolicyOptions<T> = CachePolicyOptions<T>>(options: O): Policy<T, O>;
+
+    /**
+     * Provisions a server cache as described in server.cache where:
+     * @param options - same as the server cache configuration options.
+     * @return Return value: none.
+     * Note that if the server has been initialized or started, the cache will be automatically started to match the state of any other provisioned server cache.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-servercacheprovisionoptions)
+     */
+    provision(options: ServerOptionsCache): Promise<void>;
+}
+
+export type CacheProvider<T extends ClientOptions = ClientOptions> = EnginePrototype<any> | {
+    constructor: EnginePrototype<any>;
+    options?: T | undefined;
+};
+
+/**
+ * hapi uses catbox for its cache implementation which includes support for common storage solutions (e.g. Redis,
+ * MongoDB, Memcached, Riak, among others). Caching is only utilized if methods and plugins explicitly store their state in the cache.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-cache)
+ */
+export interface ServerOptionsCache extends PolicyOptions<any> {
+    /** catbox engine object. */
+    engine?: ClientApi<any> | undefined;
+
+    /**
+     * a class or a prototype function
+     */
+    provider?: CacheProvider | undefined;
+
+    /**
+     * an identifier used later when provisioning or configuring caching for server methods or plugins. Each cache name must be unique. A single item may omit the name option which defines
+     * the default cache. If every cache includes a name, a default memory cache is provisioned as well.
+     */
+    name?: string | undefined;
+
+    /** if true, allows multiple cache users to share the same segment (e.g. multiple methods using the same cache storage container). Default to false. */
+    shared?: boolean | undefined;
+
+    /** (optional) string used to isolate cached data. Defaults to 'hapi-cache'. */
+    partition?: string | undefined;
+
+    /** other options passed to the catbox strategy used. Other options are only passed to catbox when engine above is a class or function and ignored if engine is a catbox engine object). */
+    [s: string]: any;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/encoders.d.ts b/node_modules/@hapi/hapi/lib/types/server/encoders.d.ts
new file mode 100644
index 0000000..c91fd7d
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/encoders.d.ts
@@ -0,0 +1,19 @@
+import { createDeflate, createGunzip, createGzip, createInflate } from 'zlib';
+
+/**
+ * Available [content encoders](https://github.com/hapijs/hapi/blob/master/API.md#-serverencoderencoding-encoder).
+ */
+export interface ContentEncoders {
+
+    deflate: typeof createDeflate;
+    gzip: typeof createGzip;
+}
+
+/**
+ * Available [content decoders](https://github.com/hapijs/hapi/blob/master/API.md#-serverdecoderencoding-decoder).
+ */
+export interface ContentDecoders {
+
+    deflate: typeof createInflate;
+    gzip: typeof createGunzip;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/events.d.ts b/node_modules/@hapi/hapi/lib/types/server/events.d.ts
new file mode 100644
index 0000000..770cdb0
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/events.d.ts
@@ -0,0 +1,217 @@
+import { Podium } from '@hapi/podium';
+
+import { Request, RequestRoute } from '../request';
+
+/**
+ * an event name string.
+ * an event options object.
+ * a podium emitter object.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servereventevents)
+ */
+export type ServerEventsApplication = string | ServerEventsApplicationObject | Podium;
+
+/**
+ * Object that it will be used in Event
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servereventevents)
+ */
+export interface ServerEventsApplicationObject {
+    /** the event name string (required). */
+    name: string;
+    /** a string or array of strings specifying the event channels available. Defaults to no channel restrictions (event updates can specify a channel or not). */
+    channels?: string | string[] | undefined;
+    /**
+     * if true, the data object passed to server.events.emit() is cloned before it is passed to the listeners (unless an override specified by each listener). Defaults to false (data is passed as-is).
+     */
+    clone?: boolean | undefined;
+    /**
+     * if true, the data object passed to server.event.emit() must be an array and the listener method is called with each array element passed as a separate argument (unless an override specified
+     * by each listener). This should only be used when the emitted data structure is known and predictable. Defaults to false (data is emitted as a single argument regardless of its type).
+     */
+    spread?: boolean | undefined;
+    /**
+     * if true and the criteria object passed to server.event.emit() includes tags, the tags are mapped to an object (where each tag string is the key and the value is true) which is appended to
+     * the arguments list at the end. A configuration override can be set by each listener. Defaults to false.
+     */
+    tags?: boolean | undefined;
+    /**
+     * if true, the same event name can be registered multiple times where the second registration is ignored. Note that if the registration config is changed between registrations, only the first
+     * configuration is used. Defaults to false (a duplicate registration will throw an error).
+     */
+    shared?: boolean | undefined;
+}
+
+/**
+ * A criteria object with the following optional keys (unless noted otherwise):
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servereventsoncriteria-listener)
+ *
+ * The type parameter T is the type of the name of the event.
+ */
+export interface ServerEventCriteria<T> {
+    /** (required) the event name string. */
+    name: T;
+    /**
+     * a string or array of strings specifying the event channels to subscribe to. If the event registration specified a list of allowed channels, the channels array must match the allowed
+     * channels. If channels are specified, event updates without any channel designation will not be included in the subscription. Defaults to no channels filter.
+     */
+    channels?: string | string[] | undefined;
+    /** if true, the data object passed to server.event.emit() is cloned before it is passed to the listener method. Defaults to the event registration option (which defaults to false). */
+    clone?: boolean | undefined;
+    /**
+     * a positive integer indicating the number of times the listener can be called after which the subscription is automatically removed. A count of 1 is the same as calling server.events.once().
+     * Defaults to no limit.
+     */
+    count?: number | undefined;
+    /**
+     * filter - the event tags (if present) to subscribe to which can be one of:
+     * * a tag string.
+     * * an array of tag strings.
+     * * an object with the following:
+     * * * tags - a tag string or array of tag strings.
+     * * * all - if true, all tags must be present for the event update to match the subscription. Defaults to false (at least one matching tag).
+     */
+    filter?: string | string[] | { tags: string | string[] | undefined, all?: boolean | undefined } | undefined;
+    /**
+     * if true, and the data object passed to server.event.emit() is an array, the listener method is called with each array element passed as a separate argument. This should only be used
+     * when the emitted data structure is known and predictable. Defaults to the event registration option (which defaults to false).
+     */
+    spread?: boolean | undefined;
+    /**
+     * if true and the criteria object passed to server.event.emit() includes tags, the tags are mapped to an object (where each tag string is the key and the value is true) which is appended
+     * to the arguments list at the end. Defaults to the event registration option (which defaults to false).
+     */
+    tags?: boolean | undefined;
+}
+
+export interface LogEvent<T = object | string> {
+    /** the event timestamp. */
+    timestamp: string;
+    /** an array of tags identifying the event (e.g. ['error', 'http']) */
+    tags: string[];
+    /** set to 'internal' for internally generated events, otherwise 'app' for events generated by server.log() */
+    channel: 'internal' | 'app';
+    /** the request identifier. */
+    request: string;
+    /** event-specific information. Available when event data was provided and is not an error. Errors are passed via error. */
+    data: T;
+    /** the error object related to the event if applicable. Cannot appear together with data */
+    error: object;
+}
+
+export interface RequestEvent {
+    /** the event timestamp. */
+    timestamp: string;
+    /** an array of tags identifying the event (e.g. ['error', 'http']) */
+    tags: string[];
+    /** set to 'internal' for internally generated events, otherwise 'app' for events generated by server.log() */
+    channel: 'internal' | 'app' | 'error';
+    /** event-specific information. Available when event data was provided and is not an error. Errors are passed via error. */
+    data: object | string;
+    /** the error object related to the event if applicable. Cannot appear together with data */
+    error: object;
+}
+
+export type LogEventHandler = (event: LogEvent, tags: { [key: string]: true }) => void;
+export type RequestEventHandler = (request: Request, event: RequestEvent, tags: { [key: string]: true }) => void;
+export type ResponseEventHandler = (request: Request) => void;
+export type RouteEventHandler = (route: RequestRoute) => void;
+export type StartEventHandler = () => void;
+export type StopEventHandler = () => void;
+
+export interface PodiumEvent<K extends string, T> {
+    emit(criteria: K, listener: (value: T) => void): void;
+
+    on(criteria: K, listener: (value: T) => void): void;
+
+    once(criteria: K, listener: (value: T) => void): void;
+
+    once(criteria: K): Promise<T>;
+
+    removeListener(criteria: K, listener: Podium.Listener): this;
+
+    removeAllListeners(criteria: K): this;
+
+    hasListeners(criteria: K): this;
+}
+
+/**
+ * Access: podium public interface.
+ * The server events emitter. Utilizes the podium with support for event criteria validation, channels, and filters.
+ * Use the following methods to interact with server.events:
+ * [server.event(events)](https://github.com/hapijs/hapi/blob/master/API.md#server.event()) - register application events.
+ * [server.events.emit(criteria, data)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.emit()) - emit server events.
+ * [server.events.on(criteria, listener)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.on()) - subscribe to all events.
+ * [server.events.once(criteria, listener)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.once()) - subscribe to
+ * Other methods include: server.events.removeListener(name, listener), server.events.removeAllListeners(name), and server.events.hasListeners(name).
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+ */
+export interface ServerEvents extends Podium {
+    /**
+     * Subscribe to an event where:
+     * @param criteria - the subscription criteria which must be one of:
+     * * event name string which can be any of the built-in server events
+     * * a custom application event registered with server.event().
+     * * a criteria object
+     * @param listener - the handler method set to receive event updates. The function signature depends on the event argument, and the spread and tags options.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servereventsoncriteria-listener)
+     * See ['log' event](https://github.com/hapijs/hapi/blob/master/API.md#-log-event)
+     * See ['request' event](https://github.com/hapijs/hapi/blob/master/API.md#-request-event)
+     * See ['response' event](https://github.com/hapijs/hapi/blob/master/API.md#-response-event)
+     * See ['route' event](https://github.com/hapijs/hapi/blob/master/API.md#-route-event)
+     * See ['start' event](https://github.com/hapijs/hapi/blob/master/API.md#-start-event)
+     * See ['stop' event](https://github.com/hapijs/hapi/blob/master/API.md#-stop-event)
+     */
+    on(criteria: 'log' | ServerEventCriteria<'log'>, listener: LogEventHandler): this;
+    on(criteria: 'request' | ServerEventCriteria<'request'>, listener: RequestEventHandler): this;
+    on(criteria: 'response' | ServerEventCriteria<'response'>, listener: ResponseEventHandler): this;
+    on(criteria: 'route' | ServerEventCriteria<'route'>, listener: RouteEventHandler): this;
+    on(criteria: 'start' | ServerEventCriteria<'start'>, listener: StartEventHandler): this;
+    on(criteria: 'stop' | ServerEventCriteria<'stop'>, listener: StopEventHandler): this;
+    on(criteria: string | ServerEventCriteria<string>, listener: (value: any) => void): this;
+
+    /**
+     * Same as calling [server.events.on()](https://github.com/hapijs/hapi/blob/master/API.md#server.events.on()) with the count option set to 1.
+     * @param criteria - the subscription criteria which must be one of:
+     * * event name string which can be any of the built-in server events
+     * * a custom application event registered with server.event().
+     * * a criteria object
+     * @param listener - the handler method set to receive event updates. The function signature depends on the event argument, and the spread and tags options.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servereventsoncecriteria-listener)
+     */
+    once(criteria: 'log' | ServerEventCriteria<'log'>, listener: LogEventHandler): this;
+    once(criteria: 'request' | ServerEventCriteria<'request'>, listener: RequestEventHandler): this;
+    once(criteria: 'response' | ServerEventCriteria<'response'>, listener: ResponseEventHandler): this;
+    once(criteria: 'route' | ServerEventCriteria<'route'>, listener: RouteEventHandler): this;
+    once(criteria: 'start' | ServerEventCriteria<'start'>, listener: StartEventHandler): this;
+    once(criteria: 'stop' | ServerEventCriteria<'stop'>, listener: StopEventHandler): this;
+
+    /**
+     * Same as calling server.events.on() with the count option set to 1.
+     * @param criteria - the subscription criteria which must be one of:
+     * * event name string which can be any of the built-in server events
+     * * a custom application event registered with server.event().
+     * * a criteria object
+     * @return Return value: a promise that resolves when the event is emitted.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-servereventsoncecriteria)
+     */
+    once(criteria: string | ServerEventCriteria<string>): Promise<any>;
+
+    /**
+     * The follow method is only mentioned in Hapi API. The doc about that method can be found [here](https://github.com/hapijs/podium/blob/master/API.md#podiumremovelistenername-listener)
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+     */
+    removeListener(name: string, listener: Podium.Listener): this;
+
+    /**
+     * The follow method is only mentioned in Hapi API. The doc about that method can be found [here](https://github.com/hapijs/podium/blob/master/API.md#podiumremovealllistenersname)
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+     */
+    removeAllListeners(name: string): this;
+
+    /**
+     * The follow method is only mentioned in Hapi API. The doc about that method can be found [here](https://github.com/hapijs/podium/blob/master/API.md#podiumhaslistenersname)
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+     */
+    hasListeners(name: string): boolean;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/ext.d.ts b/node_modules/@hapi/hapi/lib/types/server/ext.d.ts
new file mode 100644
index 0000000..3f4133f
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/ext.d.ts
@@ -0,0 +1,152 @@
+import { Server, ServerApplicationState } from './server';
+import { ReqRef, ReqRefDefaults } from '../request';
+import { Lifecycle } from '../utils';
+
+/**
+ * The extension point event name. The available extension points include the request extension points as well as the following server extension points:
+ * 'onPreStart' - called before the connection listeners are started.
+ * 'onPostStart' - called after the connection listeners are started.
+ * 'onPreStop' - called before the connection listeners are stopped.
+ * 'onPostStop' - called after the connection listeners are stopped.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevents)
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#request-lifecycle)
+ */
+export type ServerExtType = 'onPreStart' | 'onPostStart' | 'onPreStop' | 'onPostStop';
+export type RouteRequestExtType = 'onPreAuth'
+    | 'onCredentials'
+    | 'onPostAuth'
+    | 'onPreHandler'
+    | 'onPostHandler'
+    | 'onPreResponse'
+    | 'onPostResponse';
+
+export type ServerRequestExtType =
+    RouteRequestExtType
+    | 'onRequest';
+
+/**
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevents)
+ * Registers an extension function in one of the request lifecycle extension points where:
+ * @param events - an object or array of objects with the following:
+ * * type - (required) the extension point event name. The available extension points include the request extension points as well as the following server extension points:
+ * * * 'onPreStart' - called before the connection listeners are started.
+ * * * 'onPostStart' - called after the connection listeners are started.
+ * * * 'onPreStop' - called before the connection listeners are stopped.
+ * * * 'onPostStop' - called after the connection listeners are stopped.
+ * * method - (required) a function or an array of functions to be executed at a specified point during request processing. The required extension function signature is:
+ * * * server extension points: async function(server) where:
+ * * * * server - the server object.
+ * * * * this - the object provided via options.bind or the current active context set with server.bind().
+ * * * request extension points: a lifecycle method.
+ * * options - (optional) an object with the following:
+ * * * before - a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+ * * * after - a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+ * * * bind - a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+ * * * sandbox - if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level extensions, or
+ *     when adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to.
+ * @return void
+ */
+export interface ServerExtEventsObject<A = ServerApplicationState> {
+    /**
+     * (required) the extension point event name. The available extension points include the request extension points as well as the following server extension points:
+     * * 'onPreStart' - called before the connection listeners are started.
+     * * 'onPostStart' - called after the connection listeners are started.
+     * * 'onPreStop' - called before the connection listeners are stopped.
+     */
+    type: ServerExtType;
+    /**
+     * (required) a function or an array of functions to be executed at a specified point during request processing. The required extension function signature is:
+     * * server extension points: async function(server) where:
+     * * * server - the server object.
+     * * * this - the object provided via options.bind or the current active context set with server.bind().
+     * * request extension points: a lifecycle method.
+     */
+    method: ServerExtPointFunction<A> | ServerExtPointFunction<A>[];
+    options?: ServerExtOptions | undefined;
+}
+
+export interface RouteExtObject<Refs extends ReqRef = ReqRefDefaults> {
+    method: Lifecycle.Method<Refs>;
+    options?: ServerExtOptions | undefined;
+}
+
+/**
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevents)
+ * Registers an extension function in one of the request lifecycle extension points where:
+ * @param events - an object or array of objects with the following:
+ * * type - (required) the extension point event name. The available extension points include the request extension points as well as the following server extension points:
+ * * * 'onPreStart' - called before the connection listeners are started.
+ * * * 'onPostStart' - called after the connection listeners are started.
+ * * * 'onPreStop' - called before the connection listeners are stopped.
+ * * * 'onPostStop' - called after the connection listeners are stopped.
+ * * method - (required) a function or an array of functions to be executed at a specified point during request processing. The required extension function signature is:
+ * * * server extension points: async function(server) where:
+ * * * * server - the server object.
+ * * * * this - the object provided via options.bind or the current active context set with server.bind().
+ * * * request extension points: a lifecycle method.
+ * * options - (optional) an object with the following:
+ * * * before - a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+ * * * after - a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+ * * * bind - a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+ * * * sandbox - if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level extensions, or
+ *     when adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to.
+ * @return void
+ */
+export interface ServerExtEventsRequestObject {
+    /**
+     * (required) the extension point event name. The available extension points include the request extension points as well as the following server extension points:
+     * * 'onPreStart' - called before the connection listeners are started.
+     * * 'onPostStart' - called after the connection listeners are started.
+     * * 'onPreStop' - called before the connection listeners are stopped.
+     * * 'onPostStop' - called after the connection listeners are stopped.
+     */
+    type: ServerRequestExtType;
+    /**
+     * (required) a function or an array of functions to be executed at a specified point during request processing. The required extension function signature is:
+     * * server extension points: async function(server) where:
+     * * * server - the server object.
+     * * * this - the object provided via options.bind or the current active context set with server.bind().
+     * * request extension points: a lifecycle method.
+     */
+    method: Lifecycle.Method | Lifecycle.Method[];
+    /**
+     * (optional) an object with the following:
+     * * before - a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+     * * after - a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+     * * bind - a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+     * * sandbox - if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level extensions,
+     * or when adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to.
+     */
+    options?: ServerExtOptions | undefined;
+}
+
+export type ServerExtPointFunction<A = ServerApplicationState> = (server: Server<A>) => void;
+
+/**
+ * An object with the following:
+ * * before - a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+ * * after - a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+ * * bind - a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+ * * sandbox - if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level extensions, or
+ * when adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to. For context [See
+ * docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevents)
+ */
+export interface ServerExtOptions {
+    /**
+     * a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+     */
+    before?: string | string[] | undefined;
+    /**
+     * a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+     */
+    after?: string | string[] | undefined;
+    /**
+     * a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+     */
+    bind?: object | undefined;
+    /**
+     * if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level extensions, or when
+     * adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to.
+     */
+    sandbox?: 'server' | 'plugin' | undefined;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/index.d.ts b/node_modules/@hapi/hapi/lib/types/server/index.d.ts
new file mode 100644
index 0000000..f1ff8ae
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/index.d.ts
@@ -0,0 +1,11 @@
+export * from './auth';
+export * from './cache';
+export * from './encoders';
+export * from './events';
+export * from './ext';
+export * from './info';
+export * from './inject';
+export * from './methods';
+export * from './options';
+export * from './server';
+export * from './state';
diff --git a/node_modules/@hapi/hapi/lib/types/server/info.d.ts b/node_modules/@hapi/hapi/lib/types/server/info.d.ts
new file mode 100644
index 0000000..70b145c
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/info.d.ts
@@ -0,0 +1,53 @@
+/**
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverinfo)
+ * An object containing information about the server where:
+ */
+export interface ServerInfo {
+    /**
+     * a unique server identifier (using the format '{hostname}:{pid}:{now base36}').
+     */
+    id: string;
+
+    /**
+     * server creation timestamp.
+     */
+    created: number;
+
+    /**
+     * server start timestamp (0 when stopped).
+     */
+    started: number;
+
+    /**
+     * the connection [port](https://github.com/hapijs/hapi/blob/master/API.md#server.options.port) based on the following rules:
+     *  * before the server has been started: the configured port value.
+     *  * after the server has been started: the actual port assigned when no port is configured or was set to 0.
+     */
+    port: number | string;
+
+    /**
+     * The [host](https://github.com/hapijs/hapi/blob/master/API.md#server.options.host) configuration value.
+     */
+    host: string;
+
+    /**
+     * the active IP address the connection was bound to after starting. Set to undefined until the server has been
+     * started or when using a non TCP port (e.g. UNIX domain socket).
+     */
+    address: undefined | string;
+
+    /**
+     *  the protocol used:
+     * * 'http' - HTTP.
+     * * 'https' - HTTPS.
+     * * 'socket' - UNIX domain socket or Windows named pipe.
+     */
+    protocol: 'http' | 'https' | 'socket';
+
+    /**
+     * a string representing the connection (e.g. 'http://example.com:8080' or 'socket:/unix/domain/socket/path'). Contains
+     * the uri value if set, otherwise constructed from the available settings. If no port is configured or is set
+     * to 0, the uri will not include a port component until the server is started.
+     */
+    uri: string;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/inject.d.ts b/node_modules/@hapi/hapi/lib/types/server/inject.d.ts
new file mode 100644
index 0000000..01f0b26
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/inject.d.ts
@@ -0,0 +1,89 @@
+import { RequestOptions as ShotRequestOptions, ResponseObject as ShotResponseObject } from '@hapi/shot';
+import { PluginsStates } from '../plugin';
+import { AuthArtifacts, AuthCredentials, Request, RequestApplicationState } from '../request';
+
+/**
+ * An object with:
+ * * method - (optional) the request HTTP method (e.g. 'POST'). Defaults to 'GET'.
+ * * url - (required) the request URL. If the URI includes an authority (e.g. 'example.com:8080'), it is used to automatically set an HTTP 'Host' header, unless one was specified in headers.
+ * * headers - (optional) an object with optional request headers where each key is the header name and the value is the header content. Defaults to no additions to the default shot headers.
+ * * payload - (optional) an string, buffer or object containing the request payload. In case of an object it will be converted to a string for you. Defaults to no payload. Note that payload
+ * processing defaults to 'application/json' if no 'Content-Type' header provided.
+ * * credentials - (optional) an credentials object containing authentication information. The credentials are used to bypass the default authentication strategies, and are validated directly as if
+ * they were received via an authentication scheme. Defaults to no credentials.
+ * * artifacts - (optional) an artifacts object containing authentication artifact information. The artifacts are used to bypass the default authentication strategies, and are validated directly as
+ * if they were received via an authentication scheme. Ignored if set without credentials. Defaults to no artifacts.
+ * * app - (optional) sets the initial value of request.app, defaults to {}.
+ * * plugins - (optional) sets the initial value of request.plugins, defaults to {}.
+ * * allowInternals - (optional) allows access to routes with config.isInternal set to true. Defaults to false.
+ * * remoteAddress - (optional) sets the remote address for the incoming connection.
+ * * simulate - (optional) an object with options used to simulate client request stream conditions for testing:
+ * * error - if true, emits an 'error' event after payload transmission (if any). Defaults to false.
+ * * close - if true, emits a 'close' event after payload transmission (if any). Defaults to false.
+ * * end - if false, does not end the stream. Defaults to true.
+ * * split - indicates whether the request payload will be split into chunks. Defaults to undefined, meaning payload will not be chunked.
+ * * validate - (optional) if false, the options inputs are not validated. This is recommended for run-time usage of inject() to make it perform faster where input validation can be tested
+ * separately.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverinjectoptions)
+ * For context [Shot module](https://github.com/hapijs/shot)
+ */
+export interface ServerInjectOptions extends ShotRequestOptions {
+    /**
+     * Authentication bypass options.
+     */
+    auth?: {
+        /**
+         * The authentication strategy name matching the provided credentials.
+         */
+        strategy: string;
+        /**
+         * The credentials are used to bypass the default authentication strategies,
+         * and are validated directly as if they were received via an authentication scheme.
+         */
+        credentials: AuthCredentials;
+        /**
+         * The artifacts are used to bypass the default authentication strategies,
+         * and are validated directly as if they were received via an authentication scheme. Defaults to no artifacts.
+         */
+        artifacts?: AuthArtifacts | undefined;
+    } | undefined;
+    /**
+     * sets the initial value of request.app, defaults to {}.
+     */
+    app?: RequestApplicationState | undefined;
+    /**
+     * sets the initial value of request.plugins, defaults to {}.
+     */
+    plugins?: PluginsStates | undefined;
+    /**
+     * allows access to routes with config.isInternal set to true. Defaults to false.
+     */
+    allowInternals?: boolean | undefined;
+}
+
+/**
+ * A response object with the following properties:
+ * * statusCode - the HTTP status code.
+ * * headers - an object containing the headers set.
+ * * payload - the response payload string.
+ * * rawPayload - the raw response payload buffer.
+ * * raw - an object with the injection request and response objects:
+ * * req - the simulated node request object.
+ * * res - the simulated node response object.
+ * * result - the raw handler response (e.g. when not a stream or a view) before it is serialized for transmission. If not available, the value is set to payload. Useful for inspection and reuse of
+ * the internal objects returned (instead of parsing the response string).
+ * * request - the request object.
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverinjectoptions)
+ * For context [Shot module](https://github.com/hapijs/shot)
+ */
+export interface ServerInjectResponse<Result = object> extends ShotResponseObject {
+    /**
+     * the raw handler response (e.g. when not a stream or a view) before it is serialized for transmission. If not available, the value is set to payload. Useful for inspection and reuse of the
+     * internal objects returned (instead of parsing the response string).
+     */
+    result: Result | undefined;
+    /**
+     * the request object.
+     */
+    request: Request;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/methods.d.ts b/node_modules/@hapi/hapi/lib/types/server/methods.d.ts
new file mode 100644
index 0000000..a4cb02b
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/methods.d.ts
@@ -0,0 +1,95 @@
+import { CacheStatisticsObject, PolicyOptions } from "@hapi/catbox";
+
+type AnyMethod = (...args: any[]) => any;
+
+export type CachedServerMethod<T extends AnyMethod> = T & {
+    cache?: {
+        drop(...args: Parameters<T>): Promise<void>;
+        stats: CacheStatisticsObject
+    }
+};
+
+/**
+ * The method function with a signature async function(...args, [flags]) where:
+ * * ...args - the method function arguments (can be any number of arguments or none).
+ * * flags - when caching is enabled, an object used to set optional method result flags:
+ * * * ttl - 0 if result is valid but cannot be cached. Defaults to cache policy.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodname-method-options)
+ */
+export type ServerMethod = AnyMethod;
+
+/**
+ * The same cache configuration used in server.cache().
+ * The generateTimeout option is required.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodname-method-options)
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servercacheoptions)
+ */
+export interface ServerMethodCache extends PolicyOptions<any> {
+    generateTimeout: number | false;
+    cache?: string;
+    segment?: string;
+}
+
+/**
+ * Configuration object:
+ * * bind - a context object passed back to the method function (via this) when called. Defaults to active context (set via server.bind() when the method is registered. Ignored if the method is an
+ * arrow function.
+ * * cache - the same cache configuration used in server.cache(). The generateTimeout option is required.
+ * * generateKey - a function used to generate a unique key (for caching) from the arguments passed to the method function (the flags argument is not passed as input). The server will automatically
+ * generate a unique key if the function's arguments are all of types 'string', 'number', or 'boolean'. However if the method uses other types of arguments, a key generation function must be provided
+ * which takes the same arguments as the function and returns a unique string (or null if no key can be generated). For reference [See
+ * docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodname-method-options)
+ */
+export interface ServerMethodOptions {
+    /**
+     * a context object passed back to the method function (via this) when called. Defaults to active context (set via server.bind() when the method is registered. Ignored if the method is an arrow
+     * function.
+     */
+    bind?: object | undefined;
+    /**
+     * the same cache configuration used in server.cache(). The generateTimeout option is required.
+     */
+    cache?: ServerMethodCache | undefined;
+    /**
+     * a function used to generate a unique key (for caching) from the arguments passed to the method function (the flags argument is not passed as input). The server will automatically generate a
+     * unique key if the function's arguments are all of types 'string', 'number', or 'boolean'. However if the method uses other types of arguments, a key generation function must be provided which
+     * takes the same arguments as the function and returns a unique string (or null if no key can be generated).
+     */
+    generateKey?(...args: any[]): string | null;
+}
+
+/**
+ * An object or an array of objects where each one contains:
+ * * name - the method name.
+ * * method - the method function.
+ * * options - (optional) settings.
+ * For reference [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodmethods)
+ */
+export interface ServerMethodConfigurationObject {
+    /**
+     * the method name.
+     */
+    name: string;
+    /**
+     * the method function.
+     */
+    method: ServerMethod;
+    /**
+     * (optional) settings.
+     */
+    options?: ServerMethodOptions | undefined;
+}
+
+interface BaseServerMethods {
+    [name: string]: (
+        ServerMethod |
+        CachedServerMethod<ServerMethod> |
+        BaseServerMethods
+    );
+}
+
+/**
+ * An empty interface to allow typings of custom server.methods.
+ */
+export interface ServerMethods extends BaseServerMethods {
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/options.d.ts b/node_modules/@hapi/hapi/lib/types/server/options.d.ts
new file mode 100644
index 0000000..5b7c9a7
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/options.d.ts
@@ -0,0 +1,235 @@
+import * as http from 'http';
+import * as https from 'https';
+
+import { MimosOptions } from '@hapi/mimos';
+
+import { PluginSpecificConfiguration } from '../plugin';
+import { RouteOptions } from '../route';
+import { CacheProvider, ServerOptionsCache } from './cache';
+import { SameSitePolicy, ServerStateCookieOptions } from './state';
+
+export interface ServerOptionsCompression {
+    minBytes: number;
+}
+
+/**
+ * Empty interface to allow for custom augmentation.
+ */
+
+export interface ServerOptionsApp {
+}
+
+/**
+ * The server options control the behavior of the server object. Note that the options object is deeply cloned
+ * (with the exception of listener which is shallowly copied) and should not contain any values that are unsafe to perform deep copy on.
+ * All options are optionals.
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-server-options)
+ */
+export interface ServerOptions {
+    /**
+     * @default '0.0.0.0' (all available network interfaces).
+     * Sets the hostname or IP address the server will listen on. If not configured, defaults to host if present, otherwise to all available network interfaces. Set to '127.0.0.1' or 'localhost' to
+     * restrict the server to only those coming from the same host.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsaddress)
+     */
+    address?: string | undefined;
+
+    /**
+     * @default {}.
+     * Provides application-specific configuration which can later be accessed via server.settings.app. The framework does not interact with this object. It is simply a reference made available
+     * anywhere a server reference is provided. Note the difference between server.settings.app which is used to store static configuration values and server.app which is meant for storing run-time
+     * state.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsapp)
+     */
+    app?: ServerOptionsApp | undefined;
+
+    /**
+     * @default true.
+     * Used to disable the automatic initialization of the listener. When false, indicates that the listener will be started manually outside the framework.
+     * Cannot be set to true along with a port value.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsautolisten)
+     */
+    autoListen?: boolean | undefined;
+
+    /**
+     * @default { engine: require('@hapi/catbox-memory' }.
+     * Sets up server-side caching providers. Every server includes a default cache for storing application state. By default, a simple memory-based cache is created which has limited capacity and
+     * capabilities. hapi uses catbox for its cache implementation which includes support for common storage solutions (e.g. Redis, MongoDB, Memcached, Riak, among others). Caching is only utilized
+     * if methods and plugins explicitly store their state in the cache. The server cache configuration only defines the storage container itself. The configuration can be assigned one or more
+     * (array):
+     * * a class or prototype function (usually obtained by calling require() on a catbox strategy such as require('@hapi/catbox-redis')). A new catbox client will be created internally using this
+     * function.
+     * * a configuration object with the following:
+     * * * engine - a class, a prototype function, or a catbox engine object.
+     * * * name - an identifier used later when provisioning or configuring caching for server methods or plugins. Each cache name must be unique. A single item may omit the name option which defines
+     * the default cache. If every cache includes a name, a default memory cache is provisioned as well.
+     * * * shared - if true, allows multiple cache users to share the same segment (e.g. multiple methods using the same cache storage container). Default to false.
+     * * * partition - (optional) string used to isolate cached data. Defaults to 'hapi-cache'.
+     * * * other options passed to the catbox strategy used. Other options are only passed to catbox when engine above is a class or function and ignored if engine is a catbox engine object).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionscache)
+     */
+    cache?: CacheProvider | ServerOptionsCache | ServerOptionsCache[] | undefined;
+
+    /**
+     * @default { minBytes: 1024 }.
+     * Defines server handling of content encoding requests. If false, response content encoding is disabled and no compression is performed by the server.
+     */
+    compression?: boolean | ServerOptionsCompression | undefined;
+
+    /**
+     * @default { request: ['implementation'] }.
+     * Determines which logged events are sent to the console. This should only be used for development and does not affect which events are actually logged internally and recorded. Set to false to
+     * disable all console logging, or to an object with:
+     * * log - a string array of server log tags to be displayed via console.error() when the events are logged via server.log() as well as internally generated server logs. Defaults to no output.
+     * * request - a string array of request log tags to be displayed via console.error() when the events are logged via request.log() as well as internally generated request logs. For example, to
+     * display all errors, set the option to ['error']. To turn off all console debug messages set it to false. To display all request logs, set it to '*'. Defaults to uncaught errors thrown in
+     * external code (these errors are handled automatically and result in an Internal Server Error response) or runtime errors due to developer error. For example, to display all errors, set the log
+     * or request to ['error']. To turn off all output set the log or request to false. To display all server logs, set the log or request to '*'. To disable all debug information, set debug to
+     * false.
+     */
+    debug?: false | {
+        log?: string | string[] | false | undefined;
+        request?: string | string[] | false | undefined;
+    } | undefined;
+
+    /**
+     * @default the operating system hostname and if not available, to 'localhost'.
+     * The public hostname or IP address. Used to set server.info.host and server.info.uri and as address is none provided.
+     */
+    host?: string | undefined;
+
+    info?: {
+        /**
+         * @default false.
+         * If true, the request.info.remoteAddress and request.info.remotePort are populated when the request is received which can consume more resource (but is ok if the information is needed,
+         * especially for aborted requests). When false, the fields are only populated upon demand (but will be undefined if accessed after the request is aborted).
+         */
+        remote?: boolean | undefined;
+    } | undefined;
+
+    /**
+     * @default none.
+     * An optional node HTTP (or HTTPS) http.Server object (or an object with a compatible interface).
+     * If the listener needs to be manually started, set autoListen to false.
+     * If the listener uses TLS, set tls to true.
+     */
+    listener?: http.Server | undefined;
+
+    /**
+     * @default { sampleInterval: 0 }.
+     * Server excessive load handling limits where:
+     * * sampleInterval - the frequency of sampling in milliseconds. When set to 0, the other load options are ignored. Defaults to 0 (no sampling).
+     * * maxHeapUsedBytes - maximum V8 heap size over which incoming requests are rejected with an HTTP Server Timeout (503) response. Defaults to 0 (no limit).
+     * * maxRssBytes - maximum process RSS size over which incoming requests are rejected with an HTTP Server Timeout (503) response. Defaults to 0 (no limit).
+     * * maxEventLoopDelay - maximum event loop delay duration in milliseconds over which incoming requests are rejected with an HTTP Server Timeout (503) response. Defaults to 0 (no limit).
+     */
+    load?: {
+        /** the frequency of sampling in milliseconds. When set to 0, the other load options are ignored. Defaults to 0 (no sampling). */
+        sampleInterval?: number | undefined;
+
+        /** maximum V8 heap size over which incoming requests are rejected with an HTTP Server Timeout (503) response. Defaults to 0 (no limit). */
+        maxHeapUsedBytes?: number | undefined;
+        /**
+         * maximum process RSS size over which incoming requests are rejected with an HTTP Server Timeout (503) response. Defaults to 0 (no limit).
+         */
+        maxRssBytes?: number | undefined;
+        /**
+         * maximum event loop delay duration in milliseconds over which incoming requests are rejected with an HTTP Server Timeout (503) response.
+         * Defaults to 0 (no limit).
+         */
+        maxEventLoopDelay?: number | undefined;
+    } | undefined;
+
+    /**
+     * @default none.
+     * Options passed to the mimos module when generating the mime database used by the server (and accessed via server.mime):
+     * * override - an object hash that is merged into the built in mime information specified here. Each key value pair represents a single mime object. Each override value must contain:
+     * * key - the lower-cased mime-type string (e.g. 'application/javascript').
+     * * value - an object following the specifications outlined here. Additional values include:
+     * * * type - specify the type value of result objects, defaults to key.
+     * * * predicate - method with signature function(mime) when this mime type is found in the database, this function will execute to allows customizations.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsmime)
+     */
+    mime?: MimosOptions | undefined;
+
+    /**
+     * @default { cleanStop: true }
+     * Defines server handling of server operations.
+     */
+    operations?: {
+        /**
+         * @default true
+         * If true, the server keeps track of open connections and properly closes them when the server is stopped.
+         * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsoperations)
+         */
+        cleanStop?: boolean;
+    }
+
+    /**
+     * @default {}.
+     * Plugin-specific configuration which can later be accessed via server.settings.plugins. plugins is an object where each key is a plugin name and the value is the configuration. Note the
+     * difference between server.settings.plugins which is used to store static configuration values and server.plugins which is meant for storing run-time state.
+     */
+    plugins?: PluginSpecificConfiguration | undefined;
+
+    /**
+     * @default 0 (an ephemeral port).
+     * The TCP port the server will listen to. Defaults the next available port when the server is started (and assigned to server.info.port).
+     * If port is a string containing a '/' character, it is used as a UNIX domain socket path. If it starts with '\.\pipe', it is used as a Windows named pipe.
+     */
+    port?: number | string | undefined;
+
+    /**
+     * @default { isCaseSensitive: true, stripTrailingSlash: false }.
+     * Controls how incoming request URIs are matched against the routing table:
+     * * isCaseSensitive - determines whether the paths '/example' and '/EXAMPLE' are considered different resources. Defaults to true.
+     * * stripTrailingSlash - removes trailing slashes on incoming paths. Defaults to false.
+     */
+    router?: {
+        isCaseSensitive?: boolean | undefined;
+        stripTrailingSlash?: boolean | undefined;
+    } | undefined;
+
+    /**
+     * @default none.
+     * A route options object used as the default configuration for every route.
+     */
+    routes?: RouteOptions | undefined;
+
+    /**
+     * Default value:
+     * {
+     *     strictHeader: true,
+     *     ignoreErrors: false,
+     *     isSecure: true,
+     *     isHttpOnly: true,
+     *     isSameSite: 'Strict',
+     *     encoding: 'none'
+     * }
+     * Sets the default configuration for every state (cookie) set explicitly via server.state() or implicitly (without definition) using the state configuration object.
+     */
+    state?: ServerStateCookieOptions | undefined;
+
+    /**
+     * @default none.
+     * Used to create an HTTPS connection. The tls object is passed unchanged to the node HTTPS server as described in the node HTTPS documentation.
+     */
+    tls?: boolean | https.ServerOptions | undefined;
+
+    /**
+     * @default constructed from runtime server information.
+     * The full public URI without the path (e.g. 'http://example.com:8080'). If present, used as the server server.info.uri, otherwise constructed from the server settings.
+     */
+    uri?: string | undefined;
+
+    /**
+     * Query parameter configuration.
+     */
+    query?: {
+        /**
+         * the method must return an object where each key is a parameter and matching value is the parameter value.
+         * If the method throws, the error is used as the response or returned when `request.setUrl` is called.
+         */
+        parser(raw: Record<string, string>): Record<string, any>;
+    } | undefined;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/server/server.d.ts b/node_modules/@hapi/hapi/lib/types/server/server.d.ts
new file mode 100644
index 0000000..4d64710
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/server.d.ts
@@ -0,0 +1,701 @@
+import * as http from 'http';
+import { Stream } from 'stream';
+
+import { Root } from 'joi';
+import { Mimos } from '@hapi/mimos';
+
+import {
+    Dependencies,
+    PluginsListRegistered,
+    Plugin,
+    ServerRealm,
+    ServerRegisterOptions,
+    ServerRegisterPluginObject,
+    ServerRegisterPluginObjectArray,
+    HandlerDecorationMethod,
+    PluginProperties
+} from '../plugin';
+import {
+    ReqRef,
+    ReqRefDefaults,
+    Request,
+    RequestRoute
+} from '../request';
+import { ResponseToolkit } from '../response';
+import {
+    RulesOptions,
+    RulesProcessor,
+    ServerRoute
+} from '../route';
+import { HTTP_METHODS, Lifecycle } from '../utils';
+import { ServerAuth } from './auth';
+import { ServerCache } from './cache';
+import { ContentDecoders, ContentEncoders } from './encoders';
+import { ServerEventsApplication, ServerEvents } from './events';
+import {
+    ServerExtEventsObject,
+    ServerExtEventsRequestObject,
+    ServerExtType,
+    ServerExtPointFunction,
+    ServerExtOptions,
+    ServerRequestExtType
+} from './ext';
+import { ServerInfo } from './info';
+import { ServerInjectOptions, ServerInjectResponse } from './inject';
+import {
+    ServerMethod,
+    ServerMethodOptions,
+    ServerMethodConfigurationObject,
+    ServerMethods
+} from './methods';
+import { ServerOptions } from './options';
+import { ServerState, ServerStateCookieOptions } from './state';
+
+/**
+ * The general case for decorators added via server.decorate.
+ */
+export type DecorationMethod<T> = (this: T, ...args: any[]) => any;
+
+export type DecorateName = string | symbol;
+
+export type DecorationValue = object | any[] | boolean | number | string | symbol | Map<any, any> | Set<any>;
+
+type ReservedRequestKeys = (
+    'server' | 'url' | 'query' | 'path' | 'method' |
+    'mime' | 'setUrl' | 'setMethod' | 'headers' | 'id' |
+    'app' | 'plugins' | 'route' | 'auth' | 'pre' |
+    'preResponses' | 'info' | 'isInjected' | 'orig' |
+    'params' | 'paramsArray' | 'payload' | 'state' |
+    'response' | 'raw' | 'domain' | 'log' | 'logs' |
+    'generateResponse' |
+
+    // Private functions
+    '_allowInternals' | '_closed' | '_core' |
+    '_entity' | '_eventContext' | '_events' | '_expectContinue' |
+    '_isInjected' | '_isPayloadPending' | '_isReplied' |
+    '_route' | '_serverTimeoutId' | '_states' | '_url' |
+    '_urlError' | '_initializeUrl' | '_setUrl' | '_parseUrl' |
+    '_parseQuery'
+
+);
+
+type ReservedToolkitKeys = (
+    'abandon' | 'authenticated' | 'close' | 'context' | 'continue' |
+    'entity' | 'redirect' | 'realm' | 'request' | 'response' |
+    'state' | 'unauthenticated' | 'unstate'
+);
+
+type ReservedServerKeys = (
+    // Public functions
+    'app' | 'auth' | 'cache' | 'decorations' | 'events' | 'info' |
+    'listener' | 'load' | 'methods' | 'mime' | 'plugins' | 'registrations' |
+    'settings' | 'states' | 'type' | 'version' | 'realm' | 'control' | 'decoder' |
+    'bind' | 'control' | 'decoder' | 'decorate' | 'dependency' | 'encoder' |
+    'event' | 'expose' | 'ext' | 'inject' | 'log' | 'lookup' | 'match' | 'method' |
+    'path' | 'register' | 'route' | 'rules' | 'state' | 'table' | 'validator' |
+    'start' | 'initialize' | 'stop' |
+
+    // Private functions
+    '_core' | '_initialize' | '_start' | '_stop' | '_cachePolicy' | '_createCache' |
+    '_clone' | '_ext' | '_addRoute'
+);
+
+type ExceptName<Property, ReservedKeys> = Property extends ReservedKeys ? never : Property;
+
+/**
+ *  User-extensible type for application specific state (`server.app`).
+ */
+export interface ServerApplicationState {
+}
+
+/**
+ * The server object is the main application container. The server manages all incoming requests along with all
+ * the facilities provided by the framework. Each server supports a single connection (e.g. listen to port 80).
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#server)
+ */
+export class Server<A = ServerApplicationState> {
+    /**
+     * Creates a new server object
+     * @param options server configuration object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptions)
+     */
+    constructor(options?: ServerOptions);
+
+    /**
+     * Provides a safe place to store server-specific run-time application data without potential conflicts with
+     * the framework internals. The data can be accessed whenever the server is accessible.
+     * Initialized with an empty object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverapp)
+     */
+    app: A;
+
+    /**
+     * Server Auth: properties and methods
+     */
+    readonly auth: ServerAuth;
+
+    /**
+     * Links another server to the initialize/start/stop state of the current server by calling the
+     * controlled server `initialize()`/`start()`/`stop()` methods whenever the current server methods
+     * are called, where:
+     */
+    control(server: Server): void;
+
+    /**
+     * Provides access to the decorations already applied to various framework interfaces. The object must not be
+     * modified directly, but only through server.decorate.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverdecorations)
+     */
+    readonly decorations: {
+        /**
+         * decorations on the request object.
+         */
+        request: string[],
+        /**
+         * decorations on the response toolkit.
+         */
+        toolkit: string[],
+        /**
+         * decorations on the server object.
+         */
+        server: string[]
+    };
+
+    /**
+     * Register custom application events where:
+     * @param events must be one of:
+     * * an event name string.
+     * * an event options object with the following optional keys (unless noted otherwise):
+     * * * name - the event name string (required).
+     * * * channels - a string or array of strings specifying the event channels available. Defaults to no channel restrictions (event updates can specify a channel or not).
+     * * * clone - if true, the data object passed to server.events.emit() is cloned before it is passed to the listeners (unless an override specified by each listener). Defaults to false (data is
+     *     passed as-is).
+     * * * spread - if true, the data object passed to server.event.emit() must be an array and the listener method is called with each array element passed as a separate argument (unless an override
+     *     specified by each listener). This should only be used when the emitted data structure is known and predictable. Defaults to false (data is emitted as a single argument regardless of its
+     *     type).
+     * * * tags - if true and the criteria object passed to server.event.emit() includes tags, the tags are mapped to an object (where each tag string is the key and the value is true) which is
+     *     appended to the arguments list at the end. A configuration override can be set by each listener. Defaults to false.
+     * * * shared - if true, the same event name can be registered multiple times where the second registration is ignored. Note that if the registration config is changed between registrations, only
+     *     the first configuration is used. Defaults to false (a duplicate registration will throw an error).
+     * * a podium emitter object.
+     * * an array containing any of the above.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+     */
+    event(events: ServerEventsApplication | ServerEventsApplication[]): void;
+
+    /**
+     * Access: podium public interface.
+     * The server events emitter. Utilizes the podium with support for event criteria validation, channels, and filters.
+     * Use the following methods to interact with server.events:
+     * [server.events.emit(criteria, data)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.emit()) - emit server events.
+     * [server.events.on(criteria, listener)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.on()) - subscribe to all events.
+     * [server.events.once(criteria, listener)](https://github.com/hapijs/hapi/blob/master/API.md#server.events.once()) - subscribe to
+     * Other methods include: server.events.removeListener(name, listener), server.events.removeAllListeners(name), and server.events.hasListeners(name).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverevents)
+     */
+    events: ServerEvents;
+
+    /**
+     * An object containing information about the server where:
+     * * id - a unique server identifier (using the format '{hostname}:{pid}:{now base36}').
+     * * created - server creation timestamp.
+     * * started - server start timestamp (0 when stopped).
+     * * port - the connection port based on the following rules:
+     * * host - The host configuration value.
+     * * address - the active IP address the connection was bound to after starting. Set to undefined until the server has been started or when using a non TCP port (e.g. UNIX domain socket).
+     * * protocol - the protocol used:
+     * * 'http' - HTTP.
+     * * 'https' - HTTPS.
+     * * 'socket' - UNIX domain socket or Windows named pipe.
+     * * uri - a string representing the connection (e.g. 'http://example.com:8080' or 'socket:/unix/domain/socket/path'). Contains the uri value if set, otherwise constructed from the available
+     * settings. If no port is configured or is set to 0, the uri will not include a port component until the server is started.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverinfo)
+     */
+    readonly info: ServerInfo;
+
+    /**
+     * Access: read only and listener public interface.
+     * The node HTTP server object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverlistener)
+     */
+    listener: http.Server;
+
+    /**
+     * An object containing the process load metrics (when load.sampleInterval is enabled):
+     * * eventLoopDelay - event loop delay milliseconds.
+     * * heapUsed - V8 heap usage.
+     * * rss - RSS memory usage.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverload)
+     */
+    readonly load: {
+        /**
+         * event loop delay milliseconds.
+         */
+        eventLoopDelay: number;
+
+        /**
+         * V8 heap usage.
+         */
+        heapUsed: number;
+        /**
+         * RSS memory usage.
+         */
+        rss: number;
+    };
+
+    /**
+     * Server methods are functions registered with the server and used throughout the application as a common utility.
+     * Their advantage is in the ability to configure them to use the built-in cache and share across multiple request
+     * handlers without having to create a common module.
+     * sever.methods is an object which provides access to the methods registered via server.method() where each
+     * server method name is an object property.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethods
+     */
+    readonly methods: ServerMethods;
+
+    /**
+     * Provides access to the server MIME database used for setting content-type information. The object must not be
+     * modified directly but only through the [mime](https://github.com/hapijs/hapi/blob/master/API.md#server.options.mime) server setting.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermime)
+     */
+    mime: Mimos;
+
+    /**
+     * An object containing the values exposed by each registered plugin where each key is a plugin name and the values
+     * are the exposed properties by each plugin using server.expose(). Plugins may set the value of
+     * the server.plugins[name] object directly or via the server.expose() method.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverplugins)
+     */
+    plugins: PluginProperties;
+
+    /**
+     * The realm object contains sandboxed server settings specific to each plugin or authentication strategy. When
+     * registering a plugin or an authentication scheme, a server object reference is provided with a new server.realm
+     * container specific to that registration. It allows each plugin to maintain its own settings without leaking
+     * and affecting other plugins.
+     * For example, a plugin can set a default file path for local resources without breaking other plugins' configured
+     * paths. When calling server.bind(), the active realm's settings.bind property is set which is then used by
+     * routes and extensions added at the same level (server root or plugin).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverrealm)
+     */
+    readonly realm: ServerRealm;
+
+    /**
+     * An object of the currently registered plugins where each key is a registered plugin name and the value is
+     * an object containing:
+     * * version - the plugin version.
+     * * name - the plugin name.
+     * * options - (optional) options passed to the plugin during registration.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverregistrations)
+     */
+    readonly registrations: PluginsListRegistered;
+
+    /**
+     * The server configuration object after defaults applied.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serversettings)
+     */
+    readonly settings: ServerOptions;
+
+    /**
+     * The server cookies manager.
+     * Access: read only and statehood public interface.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverstates)
+     */
+    readonly states: ServerState;
+
+    /**
+     * A string indicating the listener type where:
+     * * 'socket' - UNIX domain socket or Windows named pipe.
+     * * 'tcp' - an HTTP listener.
+     */
+    readonly type: 'socket' | 'tcp';
+
+    /**
+     * The hapi module version number.
+     */
+    readonly version: string;
+
+    /**
+     * Sets a global context used as the default bind object when adding a route or an extension where:
+     * @param context - the object used to bind this in lifecycle methods such as the route handler and extension methods. The context is also made available as h.context.
+     * @return Return value: none.
+     * When setting a context inside a plugin, the context is applied only to methods set up by the plugin. Note that the context applies only to routes and extensions added after it has been set.
+     *     Ignored if the method being bound is an arrow function.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverbindcontext)
+     */
+    bind(context: object): void;
+
+    /**
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servercacheoptions)
+     */
+    cache: ServerCache;
+
+    /**
+     * Registers a custom content decoding compressor to extend the built-in support for 'gzip' and 'deflate' where:
+     * @param encoding - the decoder name string.
+     * @param decoder - a function using the signature function(options) where options are the encoding specific options configured in the route payload.compression configuration option, and the
+     *     return value is an object compatible with the output of node's zlib.createGunzip().
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverdecoderencoding-decoder)
+     */
+    decoder<T extends keyof ContentDecoders>(encoding: T, decoder: ContentDecoders[T]): void;
+    decoder(encoding: string, decoder: ((options?: object) => Stream)): void;
+
+    /**
+     * Extends various framework interfaces with custom methods where:
+     * @param type - the interface being decorated. Supported types:
+     * 'handler' - adds a new handler type to be used in routes handlers.
+     * 'request' - adds methods to the Request object.
+     * 'server' - adds methods to the Server object.
+     * 'toolkit' - adds methods to the response toolkit.
+     * @param property - the object decoration key name.
+     * @param method - the extension function or other value.
+     * @param options - (optional) supports the following optional settings:
+     * apply - when the type is 'request', if true, the method function is invoked using the signature function(request) where request is the current request object and the returned value is assigned
+     *     as the decoration. extend - if true, overrides an existing decoration. The method must be a function with the signature function(existing) where: existing - is the previously set
+     *     decoration method value. must return the new decoration function or value. cannot be used to extend handler decorations.
+     * @return void;
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverdecoratetype-property-method-options)
+     */
+    decorate <P extends DecorateName>(type: 'handler', property: P, method: HandlerDecorationMethod, options?: { apply?: boolean | undefined, extend?: never }): void;
+
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, method: (existing: ((...args: any[]) => any)) => (request: Request) => DecorationMethod<Request>, options: {apply: true, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, method: (request: Request) => DecorationMethod<Request>, options: {apply: true, extend?: boolean | undefined}): void;
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, method: DecorationMethod<Request>, options?: {apply?: boolean | undefined, extend?: boolean | undefined}): void;
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, value: (existing: ((...args: any[]) => any)) => (request: Request) => any, options: {apply: true, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, value: (request: Request) => any, options: {apply: true, extend?: boolean | undefined}): void;
+    decorate <P extends DecorateName>(type: 'request', property: ExceptName<P, ReservedRequestKeys>, value: DecorationValue, options?: never): void;
+
+    decorate <P extends DecorateName>(type: 'toolkit', property: ExceptName<P, ReservedToolkitKeys>, method: (existing: ((...args: any[]) => any)) => DecorationMethod<ResponseToolkit>, options: {apply?: boolean | undefined, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'toolkit', property: ExceptName<P, ReservedToolkitKeys>, method: DecorationMethod<ResponseToolkit>, options?: {apply?: boolean | undefined, extend?: boolean | undefined}): void;
+    decorate <P extends DecorateName>(type: 'toolkit', property: ExceptName<P, ReservedToolkitKeys>, value: (existing: ((...args: any[]) => any)) => any, options: {apply?: boolean | undefined, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'toolkit', property: ExceptName<P, ReservedToolkitKeys>, value: DecorationValue, options?: never): void;
+
+    decorate <P extends DecorateName>(type: 'server', property: ExceptName<P, ReservedServerKeys>, method: (existing: ((...args: any[]) => any)) => DecorationMethod<Server>, options: {apply?: boolean | undefined, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'server', property: ExceptName<P, ReservedServerKeys>, method: DecorationMethod<Server>, options?: {apply?: boolean | undefined, extend?: boolean | undefined}): void;
+    decorate <P extends DecorateName>(type: 'server', property: ExceptName<P, ReservedServerKeys>, value: (existing: ((...args: any[]) => any)) => any, options: {apply?: boolean | undefined, extend: true}): void;
+    decorate <P extends DecorateName>(type: 'server', property: ExceptName<P, ReservedServerKeys>, value: DecorationValue, options?: never): void;
+
+    /**
+     * Used within a plugin to declare a required dependency on other plugins where:
+     * @param dependencies - plugins which must be registered in order for this plugin to operate. Plugins listed must be registered before the server is
+     *     initialized or started.
+     * @param after - (optional) a function that is called after all the specified dependencies have been registered and before the server starts. The function is only called if the server is
+     *     initialized or started. The function signature is async function(server) where: server - the server the dependency() method was called on.
+     * @return Return value: none.
+     * The after method is identical to setting a server extension point on 'onPreStart'.
+     * If a circular dependency is detected, an exception is thrown (e.g. two plugins each has an after function to be called after the other).
+     * The method does not provide version dependency which should be implemented using npm peer dependencies.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverdependencydependencies-after)
+     */
+    dependency(dependencies: Dependencies, after?: ((server: Server) => Promise<void>) | undefined): void;
+
+    /**
+     * Registers a custom content encoding compressor to extend the built-in support for 'gzip' and 'deflate' where:
+     * @param encoding - the encoder name string.
+     * @param encoder - a function using the signature function(options) where options are the encoding specific options configured in the route compression option, and the return value is an object
+     *     compatible with the output of node's zlib.createGzip().
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverencoderencoding-encoder)
+     */
+    encoder<T extends keyof ContentEncoders>(encoding: T, encoder: ContentEncoders[T]): void;
+    encoder(encoding: string, encoder: ((options?: object) => Stream)): void;
+
+    /**
+     * Used within a plugin to expose a property via server.plugins[name] where:
+     * @param key - the key assigned (server.plugins[name][key]).
+     * @param value - the value assigned.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverexposekey-value)
+     */
+    expose(key: string, value: any): void;
+
+    /**
+     * Merges an object into to the existing content of server.plugins[name] where:
+     * @param obj - the object merged into the exposed properties container.
+     * @return Return value: none.
+     * Note that all the properties of obj are deeply cloned into server.plugins[name], so avoid using this method
+     * for exposing large objects that may be expensive to clone or singleton objects such as database client
+     * objects. Instead favor server.expose(key, value), which only copies a reference to value.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverexposeobj)
+     */
+    expose(obj: object): void;
+
+    /**
+     * Registers an extension function in one of the request lifecycle extension points where:
+     * @param events - an object or array of objects with the following:
+     * * type - (required) the extension point event name. The available extension points include the request extension points as well as the following server extension points:
+     * * * 'onPreStart' - called before the connection listeners are started.
+     * * * 'onPostStart' - called after the connection listeners are started.
+     * * * 'onPreStop' - called before the connection listeners are stopped.
+     * * * 'onPostStop' - called after the connection listeners are stopped.
+     * * method - (required) a function or an array of functions to be executed at a specified point during request processing. The required extension function signature is:
+     * * * server extension points: async function(server) where:
+     * * * * server - the server object.
+     * * * * this - the object provided via options.bind or the current active context set with server.bind().
+     * * * request extension points: a lifecycle method.
+     * * options - (optional) an object with the following:
+     * * * before - a string or array of strings of plugin names this method must execute before (on the same event). Otherwise, extension methods are executed in the order added.
+     * * * after - a string or array of strings of plugin names this method must execute after (on the same event). Otherwise, extension methods are executed in the order added.
+     * * * bind - a context object passed back to the provided method (via this) when called. Ignored if the method is an arrow function.
+     * * * sandbox - if set to 'plugin' when adding a request extension points the extension is only added to routes defined by the current plugin. Not allowed when configuring route-level
+     *     extensions, or when adding server extensions. Defaults to 'server' which applies to any route added to the server the extension is added to.
+     * @return void
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevents)
+     */
+    ext(events: ServerExtEventsObject<A> | ServerExtEventsObject<A>[] | ServerExtEventsRequestObject | ServerExtEventsRequestObject[]): void;
+
+    /**
+     * Registers a single extension event using the same properties as used in server.ext(events), but passed as arguments.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverextevent-method-options)
+     */
+    ext(event: ServerExtType, method: ServerExtPointFunction<A>, options?: ServerExtOptions | undefined): void;
+    ext(event: ServerRequestExtType, method: Lifecycle.Method, options?: ServerExtOptions | undefined): void;
+
+    /**
+     * Initializes the server (starts the caches, finalizes plugin registration) but does not start listening on the connection port.
+     * @return Return value: none.
+     * Note that if the method fails and throws an error, the server is considered to be in an undefined state and
+     * should be shut down. In most cases it would be impossible to fully recover as the various plugins, caches, and
+     * other event listeners will get confused by repeated attempts to start the server or make assumptions about the
+     * healthy state of the environment. It is recommended to abort the process when the server fails to start properly.
+     * If you must try to resume after an error, call server.stop() first to reset the server state.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverinitialize)
+     */
+    initialize(): Promise<void>;
+
+    /**
+     * Injects a request into the server simulating an incoming HTTP request without making an actual socket connection. Injection is useful for testing purposes as well as for invoking routing logic
+     * internally without the overhead and limitations of the network stack. The method utilizes the shot module for performing injections, with some additional options and response properties:
+     * @param options - can be assigned a string with the requested URI, or an object with:
+     * * method - (optional) the request HTTP method (e.g. 'POST'). Defaults to 'GET'.
+     * * url - (required) the request URL. If the URI includes an authority (e.g. 'example.com:8080'), it is used to automatically set an HTTP 'Host' header, unless one was specified in headers.
+     * * headers - (optional) an object with optional request headers where each key is the header name and the value is the header content. Defaults to no additions to the default shot headers.
+     * * payload - (optional) an string, buffer or object containing the request payload. In case of an object it will be converted to a string for you. Defaults to no payload. Note that payload
+     *     processing defaults to 'application/json' if no 'Content-Type' header provided.
+     * * credentials - (optional) an credentials object containing authentication information. The credentials are used to bypass the default authentication strategies, and are validated directly as
+     *     if they were received via an authentication scheme. Defaults to no credentials.
+     * * artifacts - (optional) an artifacts object containing authentication artifact information. The artifacts are used to bypass the default authentication strategies, and are validated directly
+     *     as if they were received via an authentication scheme. Ignored if set without credentials. Defaults to no artifacts.
+     * * app - (optional) sets the initial value of request.app, defaults to {}.
+     * * plugins - (optional) sets the initial value of request.plugins, defaults to {}.
+     * * allowInternals - (optional) allows access to routes with config.isInternal set to true. Defaults to false.
+     * * remoteAddress - (optional) sets the remote address for the incoming connection.
+     * * simulate - (optional) an object with options used to simulate client request stream conditions for testing:
+     * * error - if true, emits an 'error' event after payload transmission (if any). Defaults to false.
+     * * close - if true, emits a 'close' event after payload transmission (if any). Defaults to false.
+     * * end - if false, does not end the stream. Defaults to true.
+     * * split - indicates whether the request payload will be split into chunks. Defaults to undefined, meaning payload will not be chunked.
+     * * validate - (optional) if false, the options inputs are not validated. This is recommended for run-time usage of inject() to make it perform faster where input validation can be tested
+     *     separately.
+     * @return Return value: a response object with the following properties:
+     * * statusCode - the HTTP status code.
+     * * headers - an object containing the headers set.
+     * * payload - the response payload string.
+     * * rawPayload - the raw response payload buffer.
+     * * raw - an object with the injection request and response objects:
+     * * req - the simulated node request object.
+     * * res - the simulated node response object.
+     * * result - the raw handler response (e.g. when not a stream or a view) before it is serialized for transmission. If not available, the value is set to payload. Useful for inspection and reuse
+     *     of the internal objects returned (instead of parsing the response string).
+     * * request - the request object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverinjectoptions)
+     */
+    inject <Result = object>(options: string | ServerInjectOptions): Promise<ServerInjectResponse<Result>>;
+
+    /**
+     * Logs server events that cannot be associated with a specific request. When called the server emits a 'log' event which can be used by other listeners or plugins to record the information or
+     * output to the console. The arguments are:
+     * @param tags - (required) a string or an array of strings (e.g. ['error', 'database', 'read']) used to identify the event. Tags are used instead of log levels and provide a much more expressive
+     *     mechanism for describing and filtering events. Any logs generated by the server internally include the 'hapi' tag along with event-specific information.
+     * @param data - (optional) an message string or object with the application data being logged. If data is a function, the function signature is function() and it called once to generate (return
+     *     value) the actual data emitted to the listeners. If no listeners match the event, the data function is not invoked.
+     * @param timestamp - (optional) an timestamp expressed in milliseconds. Defaults to Date.now() (now).
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverlogtags-data-timestamp)
+     */
+    log(tags: string | string[], data?: string | object | (() => any) | undefined, timestamp?: number | undefined): void;
+
+    /**
+     * Looks up a route configuration where:
+     * @param id - the route identifier.
+     * @return Return value: the route information if found, otherwise null.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverlookupid)
+     */
+    lookup(id: string): RequestRoute | null;
+
+    /**
+     * Looks up a route configuration where:
+     * @param method - the HTTP method (e.g. 'GET', 'POST').
+     * @param path - the requested path (must begin with '/').
+     * @param host - (optional) hostname (to match against routes with vhost).
+     * @return Return value: the route information if found, otherwise null.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermatchmethod-path-host)
+     */
+    match(method: HTTP_METHODS | Lowercase<HTTP_METHODS>, path: string, host?: string | undefined): RequestRoute | null;
+
+    /**
+     * Registers a server method where:
+     * @param name - a unique method name used to invoke the method via server.methods[name].
+     * @param method - the method function with a signature async function(...args, [flags]) where:
+     * * ...args - the method function arguments (can be any number of arguments or none).
+     * * flags - when caching is enabled, an object used to set optional method result flags:
+     * * * ttl - 0 if result is valid but cannot be cached. Defaults to cache policy.
+     * @param options - (optional) configuration object:
+     * * bind - a context object passed back to the method function (via this) when called. Defaults to active context (set via server.bind() when the method is registered. Ignored if the method is
+     *     an arrow function.
+     * * cache - the same cache configuration used in server.cache(). The generateTimeout option is required.
+     * * generateKey - a function used to generate a unique key (for caching) from the arguments passed to the method function (the flags argument is not passed as input). The server will
+     *     automatically generate a unique key if the function's arguments are all of types 'string', 'number', or 'boolean'. However if the method uses other types of arguments, a key generation
+     *     function must be provided which takes the same arguments as the function and returns a unique string (or null if no key can be generated).
+     * @return Return value: none.
+     * Method names can be nested (e.g. utils.users.get) which will automatically create the full path under server.methods (e.g. accessed via server.methods.utils.users.get).
+     * When configured with caching enabled, server.methods[name].cache is assigned an object with the following properties and methods: - await drop(...args) - a function that can be used to clear
+     *     the cache for a given key. - stats - an object with cache statistics, see catbox for stats documentation.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodname-method-options)
+     */
+    method(name: string, method: ServerMethod, options?: ServerMethodOptions | undefined): void;
+
+    /**
+     * Registers a server method function as described in server.method() using a configuration object where:
+     * @param methods - an object or an array of objects where each one contains:
+     * * name - the method name.
+     * * method - the method function.
+     * * options - (optional) settings.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servermethodmethods)
+     */
+    method(methods: ServerMethodConfigurationObject | ServerMethodConfigurationObject[]): void;
+
+    /**
+     * Sets the path prefix used to locate static resources (files and view templates) when relative paths are used where:
+     * @param relativeTo - the path prefix added to any relative file path starting with '.'.
+     * @return Return value: none.
+     * Note that setting a path within a plugin only applies to resources accessed by plugin methods. If no path is set, the server default route configuration files.relativeTo settings is used. The
+     *     path only applies to routes added after it has been set.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverpathrelativeto)
+     */
+    path(relativeTo: string): void;
+
+    /**
+     * Registers a plugin where:
+     * @param plugins - one or an array of:
+     * * a plugin object.
+     * * an object with the following:
+     * * * plugin - a plugin object.
+     * * * options - (optional) options passed to the plugin during registration.
+     * * * once, routes - (optional) plugin-specific registration options as defined below.
+     * @param options - (optional) registration options (different from the options passed to the registration function):
+     * * once - if true, subsequent registrations of the same plugin are skipped without error. Cannot be used with plugin options. Defaults to false. If not set to true, an error will be thrown the
+     *     second time a plugin is registered on the server.
+     * * routes - modifiers applied to each route added by the plugin:
+     * * * prefix - string added as prefix to any route path (must begin with '/'). If a plugin registers a child plugin the prefix is passed on to the child or is added in front of the
+     *     child-specific prefix.
+     * * * vhost - virtual host string (or array of strings) applied to every route. The outer-most vhost overrides the any nested configuration.
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverregisterplugins-options)
+     */
+    register<T, D>(plugins: Plugin<T, D>, options?: ServerRegisterOptions | undefined): Promise<this & D>;
+    register<T, D>(plugin: ServerRegisterPluginObject<T, D>, options?: ServerRegisterOptions | undefined): Promise<this & D>;
+    register(plugins: Plugin<any>[], options?: ServerRegisterOptions | undefined): Promise<this>;
+    register(plugins: ServerRegisterPluginObject<any>[], options?: ServerRegisterOptions | undefined): Promise<this>;
+    register<T, U, V, W, X, Y, Z>(plugins: ServerRegisterPluginObjectArray<T, U, V, W, X, Y, Z>, options?: ServerRegisterOptions | undefined): Promise<this>;
+
+    /**
+     * Adds a route where:
+     * @param route - a route configuration object or an array of configuration objects where each object contains:
+     * * path - (required) the absolute path used to match incoming requests (must begin with '/'). Incoming requests are compared to the configured paths based on the server's router configuration.
+     *     The path can include named parameters enclosed in {} which will be matched against literal values in the request as described in Path parameters.
+     * * method - (required) the HTTP method. Typically one of 'GET', 'POST', 'PUT', 'PATCH', 'DELETE', or 'OPTIONS'. Any HTTP method is allowed, except for 'HEAD'. Use '*' to match against any HTTP
+     *     method (only when an exact match was not found, and any match with a specific method will be given a higher priority over a wildcard match). Can be assigned an array of methods which has
+     *     the same result as adding the same route with different methods manually.
+     * * vhost - (optional) a domain string or an array of domain strings for limiting the route to only requests with a matching host header field. Matching is done against the hostname part of the
+     *     header only (excluding the port). Defaults to all hosts.
+     * * handler - (required when handler is not set) the route handler function called to generate the response after successful authentication and validation.
+     * * options - additional route options. The options value can be an object or a function that returns an object using the signature function(server) where server is the server the route is being
+     *     added to and this is bound to the current realm's bind option.
+     * * rules - route custom rules object. The object is passed to each rules processor registered with server.rules(). Cannot be used if route.options.rules is defined.
+     * @return Return value: none.
+     * Note that the options object is deeply cloned (with the exception of bind which is shallowly copied) and cannot contain any values that are unsafe to perform deep copy on.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverrouteroute)
+     */
+    route <Refs extends ReqRef = ReqRefDefaults>(route: ServerRoute<Refs> | ServerRoute<Refs>[]): void;
+
+    /**
+     * Defines a route rules processor for converting route rules object into route configuration where:
+     * @param processor - a function using the signature function(rules, info) where:
+     * * rules -
+     * * info - an object with the following properties:
+     * * * method - the route method.
+     * * * path - the route path.
+     * * * vhost - the route virtual host (if any defined).
+     * * returns a route config object.
+     * @param options - optional settings:
+     * * validate - rules object validation:
+     * * * schema - joi schema.
+     * * * options - optional joi validation options. Defaults to { allowUnknown: true }.
+     * Note that the root server and each plugin server instance can only register one rules processor. If a route is added after the rules are configured, it will not include the rules config.
+     *     Routes added by plugins apply the rules to each of the parent realms' rules from the root to the route's realm. This means the processor defined by the plugin override the config generated
+     *     by the root processor if they overlap. The route config overrides the rules config if the overlap.
+     * @return void
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverrulesprocessor-options)
+     */
+    rules <Refs extends ReqRef = ReqRefDefaults>(
+        processor: RulesProcessor<Refs>,
+        options?: RulesOptions<Refs> | undefined
+    ): void;
+
+    /**
+     * Starts the server by listening for incoming requests on the configured port (unless the connection was configured with autoListen set to false).
+     * @return Return value: none.
+     * Note that if the method fails and throws an error, the server is considered to be in an undefined state and should be shut down. In most cases it would be impossible to fully recover as the
+     *     various plugins, caches, and other event listeners will get confused by repeated attempts to start the server or make assumptions about the healthy state of the environment. It is
+     *     recommended to abort the process when the server fails to start properly. If you must try to resume after an error, call server.stop() first to reset the server state. If a started server
+     *     is started again, the second call to server.start() is ignored. No events will be emitted and no extension points invoked.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverstart)
+     */
+    start(): Promise<void>;
+
+    /**
+     * HTTP state management uses client cookies to persist a state across multiple requests.
+     * @param name - the cookie name string.
+     * @param options - are the optional cookie settings
+     * @return Return value: none.
+     * State defaults can be modified via the server default state configuration option.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverstatename-options)
+     */
+    state(name: string, options?: ServerStateCookieOptions | undefined): void;
+
+    /**
+     * Stops the server's listener by refusing to accept any new connections or requests (existing connections will continue until closed or timeout), where:
+     * @param options - (optional) object with:
+     * * timeout - overrides the timeout in millisecond before forcefully terminating a connection. Defaults to 5000 (5 seconds).
+     * @return Return value: none.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-await-serverstopoptions)
+     */
+    stop(options?: {timeout: number} | undefined): Promise<void>;
+
+    /**
+     * Returns a copy of the routing table where:
+     * @param host - (optional) host to filter routes matching a specific virtual host. Defaults to all virtual hosts.
+     * @return Return value: an array of routes where each route contains:
+     * * settings - the route config with defaults applied.
+     * * method - the HTTP method in lower case.
+     * * path - the route path.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-servertablehost)
+     */
+    table(host?: string | string[] | undefined): RequestRoute[];
+
+    /**
+     * Registers a server validation module used to compile raw validation rules into validation schemas for all routes.
+     * The validator is only used when validation rules are not pre-compiled schemas. When a validation rules is a function or schema object, the rule is used as-is and the validator is not used.
+     */
+    validator(joi: Root): void;
+}
+
+/**
+ * Factory function to create a new server object (introduced in v17).
+ */
+export function server<A = ServerApplicationState>(opts?: ServerOptions | undefined): Server<A>;
diff --git a/node_modules/@hapi/hapi/lib/types/server/state.d.ts b/node_modules/@hapi/hapi/lib/types/server/state.d.ts
new file mode 100644
index 0000000..e0c0498
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/server/state.d.ts
@@ -0,0 +1,79 @@
+import { StateOptions, SameSitePolicy } from '@hapi/statehood';
+
+import { Request } from '../request';
+
+export { SameSitePolicy };
+
+/**
+ * Optional cookie settings
+ * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverstatename-options)
+ */
+export interface ServerStateCookieOptions extends StateOptions<Request> {}
+
+/**
+ * A single object or an array of object where each contains:
+ * * name - the cookie name.
+ * * value - the cookie value.
+ * * options - cookie configuration to override the server settings.
+ */
+export interface ServerStateFormat {
+    name: string;
+    value: string;
+    options: ServerStateCookieOptions;
+}
+
+/**
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serverstatename-options)
+ * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-serveroptionsstate)
+ */
+export interface ServerState {
+    /**
+     * The server cookies manager.
+     * Access: read only and statehood public interface.
+     */
+    readonly states: object;
+
+    /**
+     * The server cookies manager settings. The settings are based on the values configured in [server.options.state](https://github.com/hapijs/hapi/blob/master/API.md#server.options.state).
+     */
+    readonly settings: ServerStateCookieOptions;
+
+    /**
+     * An object containing the configuration of each cookie added via [server.state()](https://github.com/hapijs/hapi/blob/master/API.md#server.state()) where each key is the
+     * cookie name and value is the configuration object.
+     */
+    readonly cookies: {
+        [key: string]: ServerStateCookieOptions;
+    };
+
+    /**
+     * An array containing the names of all configured cookies.
+     */
+    readonly names: string[];
+
+    /**
+     * Same as calling [server.state()](https://github.com/hapijs/hapi/blob/master/API.md#server.state()).
+     */
+    add(name: string, options?: ServerStateCookieOptions | undefined): void;
+
+    /**
+     * Formats an HTTP 'Set-Cookie' header based on the server.options.state where:
+     * @param cookies - a single object or an array of object where each contains:
+     * * name - the cookie name.
+     * * value - the cookie value.
+     * * options - cookie configuration to override the server settings.
+     * @return Return value: a header string.
+     * Note that this utility uses the server configuration but does not change the server state. It is provided for manual cookie formatting (e.g. when headers are set manually).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-async-serverstatesformatcookies)
+     */
+    format(cookies: ServerStateFormat | ServerStateFormat[]): Promise<string>;
+
+    /**
+     * Parses an HTTP 'Cookies' header based on the server.options.state where:
+     * @param header - the HTTP header.
+     * @return Return value: an object where each key is a cookie name and value is the parsed cookie.
+     * Note that this utility uses the server configuration but does not change the server state. It is provided for manual cookie parsing (e.g. when server parsing is disabled).
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-async-serverstatesparseheader)
+     */
+    parse(header: string): Promise<Record<string, string>>;
+}
diff --git a/node_modules/@hapi/hapi/lib/types/utils.d.ts b/node_modules/@hapi/hapi/lib/types/utils.d.ts
new file mode 100644
index 0000000..feb342e
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/types/utils.d.ts
@@ -0,0 +1,113 @@
+import * as https from 'https';
+import * as stream from 'stream';
+
+import { Boom } from '@hapi/boom';
+import { ResponseObject as ShotResponseObject } from '@hapi/shot';
+
+import {
+    ReqRef,
+    ReqRefDefaults,
+    MergeRefs,
+    Request} from './request';
+import { ResponseToolkit, Auth } from './response';
+
+/**
+ * All http parser [supported HTTP methods](https://nodejs.org/api/http.html#httpmethods).
+ */
+export type HTTP_METHODS = 'ACL' | 'BIND' | 'CHECKOUT' | 'CONNECT' | 'COPY' | 'DELETE' | 'GET' | 'HEAD' | 'LINK' | 'LOCK' |
+    'M-SEARCH' | 'MERGE' | 'MKACTIVITY' | 'MKCALENDAR' | 'MKCOL' | 'MOVE' | 'NOTIFY' | 'OPTIONS' | 'PATCH' | 'POST' |
+    'PROPFIND' | 'PROPPATCH' | 'PURGE' | 'PUT' | 'REBIND' | 'REPORT' | 'SEARCH' | 'SOURCE' | 'SUBSCRIBE' | 'TRACE' |
+    'UNBIND' | 'UNLINK' | 'UNLOCK' | 'UNSUBSCRIBE';
+
+export type PeekListener = (chunk: string, encoding: string) => void;
+
+export namespace Json {
+    /**
+     * @see {@link https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#The_replacer_parameter}
+     */
+    type StringifyReplacer = ((key: string, value: any) => any) | (string | number)[] | undefined;
+
+    /**
+     * Any value greater than 10 is truncated.
+     */
+    type StringifySpace = number | string;
+
+    /**
+     * For context [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-routeoptionsjson)
+     */
+    interface StringifyArguments {
+        /** the replacer function or array. Defaults to no action. */
+        replacer?: StringifyReplacer | undefined;
+        /** number of spaces to indent nested object keys. Defaults to no indentation. */
+        space?: StringifySpace | undefined;
+        /* string suffix added after conversion to JSON string. Defaults to no suffix. */
+        suffix?: string | undefined;
+        /* calls Hoek.jsonEscape() after conversion to JSON string. Defaults to false. */
+        escape?: boolean | undefined;
+    }
+}
+
+export namespace Lifecycle {
+    /**
+     * Lifecycle methods are the interface between the framework and the application. Many of the request lifecycle steps:
+     * extensions, authentication, handlers, pre-handler methods, and failAction function values are lifecycle methods
+     * provided by the developer and executed by the framework.
+     * Each lifecycle method is a function with the signature await function(request, h, [err]) where:
+     * * request - the request object.
+     * * h - the response toolkit the handler must call to set a response and return control back to the framework.
+     * * err - an error object available only when the method is used as a failAction value.
+     */
+    type Method<
+        Refs extends ReqRef = ReqRefDefaults,
+        R extends ReturnValue<any> = ReturnValue<Refs>
+    > = (
+            this: MergeRefs<Refs>['Bind'],
+            request: Request<Refs>,
+            h: ResponseToolkit<Refs>,
+            err?: Error | undefined
+        ) => R;
+
+    /**
+     * Each lifecycle method must return a value or a promise that resolves into a value. If a lifecycle method returns
+     * without a value or resolves to an undefined value, an Internal Server Error (500) error response is sent.
+     * The return value must be one of:
+     * - Plain value: null, string, number, boolean
+     * - Buffer object
+     * - Error object: plain Error OR a Boom object.
+     * - Stream object
+     * - any object or array
+     * - a toolkit signal:
+     * - a toolkit method response:
+     * - a promise object that resolve to any of the above values
+     * For more info please [See docs](https://github.com/hapijs/hapi/blob/master/API.md#lifecycle-methods)
+     */
+    type ReturnValue<Refs extends ReqRef = ReqRefDefaults> = ReturnValueTypes<Refs> | (Promise<ReturnValueTypes<Refs>>);
+    type ReturnValueTypes<Refs extends ReqRef = ReqRefDefaults> =
+        (null | string | number | boolean) |
+        (Buffer) |
+        (Error | Boom) |
+        (stream.Stream) |
+        (object | object[]) |
+        symbol |
+        Auth<
+            MergeRefs<Refs>['AuthUser'],
+            MergeRefs<Refs>['AuthApp'],
+            MergeRefs<Refs>['AuthCredentialsExtra'],
+            MergeRefs<Refs>['AuthArtifactsExtra']
+        > |
+        ShotResponseObject;
+
+    /**
+     * Various configuration options allows defining how errors are handled. For example, when invalid payload is received or malformed cookie, instead of returning an error, the framework can be
+     * configured to perform another action. When supported the failAction option supports the following values:
+     * * 'error' - return the error object as the response.
+     * * 'log' - report the error but continue processing the request.
+     * * 'ignore' - take no action and continue processing the request.
+     * * a lifecycle method with the signature async function(request, h, err) where:
+     * * * request - the request object.
+     * * * h - the response toolkit.
+     * * * err - the error object.
+     * [See docs](https://github.com/hapijs/hapi/blob/master/API.md#-failaction-configuration)
+     */
+    type FailAction = 'error' | 'log' | 'ignore' | Method;
+}
diff --git a/node_modules/@hapi/hapi/lib/validation.js b/node_modules/@hapi/hapi/lib/validation.js
new file mode 100755
index 0000000..e94bf13
--- /dev/null
+++ b/node_modules/@hapi/hapi/lib/validation.js
@@ -0,0 +1,250 @@
+'use strict';
+
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+const Validate = require('@hapi/validate');
+
+
+const internals = {};
+
+
+exports.validator = function (validator) {
+
+    Hoek.assert(validator, 'Missing validator');
+    Hoek.assert(typeof validator.compile === 'function', 'Invalid validator compile method');
+
+    return validator;
+};
+
+
+exports.compile = function (rule, validator, realm, core) {
+
+    validator = validator ?? internals.validator(realm, core);
+
+    // false - nothing allowed
+
+    if (rule === false) {
+        return Validate.object({}).allow(null);
+    }
+
+    // Custom function
+
+    if (typeof rule === 'function') {
+        return rule;
+    }
+
+    // null, undefined, true - anything allowed
+
+    if (!rule ||                            // false tested above
+        rule === true) {
+
+        return null;
+    }
+
+    // {...} - ... allowed
+
+    if (typeof rule.validate === 'function') {
+        return rule;
+    }
+
+    Hoek.assert(validator, 'Cannot set uncompiled validation rules without configuring a validator');
+    return validator.compile(rule);
+};
+
+
+internals.validator = function (realm, core) {
+
+    while (realm) {
+        if (realm.validator) {
+            return realm.validator;
+        }
+
+        realm = realm.parent;
+    }
+
+    return core.validator;
+};
+
+
+exports.headers = function (request) {
+
+    return internals.input('headers', request);
+};
+
+
+exports.params = function (request) {
+
+    return internals.input('params', request);
+};
+
+
+exports.payload = function (request) {
+
+    if (request.method === 'get' ||
+        request.method === 'head') {                // When route.method is '*'
+
+        return;
+    }
+
+    return internals.input('payload', request);
+};
+
+
+exports.query = function (request) {
+
+    return internals.input('query', request);
+};
+
+
+exports.state = function (request) {
+
+    return internals.input('state', request);
+};
+
+
+internals.input = async function (source, request) {
+
+    const localOptions = {
+        context: {
+            headers: request.headers,
+            params: request.params,
+            query: request.query,
+            payload: request.payload,
+            state: request.state,
+            auth: request.auth,
+            app: {
+                route: request.route.settings.app,
+                request: request.app
+            }
+        }
+    };
+
+    delete localOptions.context[source];
+    Hoek.merge(localOptions, request.route.settings.validate.options);
+
+    try {
+        const schema = request.route.settings.validate[source];
+        const bind = request.route.settings.bind;
+
+        var value = await (typeof schema !== 'function' ? internals.validate(request[source], schema, localOptions) : schema.call(bind, request[source], localOptions));
+        return;
+    }
+    catch (err) {
+        var validationError = err;
+    }
+    finally {
+        request.orig[source] = request[source];
+        if (value !== undefined) {
+            request[source] = value;
+        }
+    }
+
+    if (request.route.settings.validate.failAction === 'ignore') {
+        return;
+    }
+
+    // Prepare error
+
+    const defaultError = validationError.isBoom ? validationError : Boom.badRequest(`Invalid request ${source} input`);
+    const detailedError = Boom.boomify(validationError, { statusCode: 400, override: false, data: { defaultError } });
+    detailedError.output.payload.validation = { source, keys: [] };
+    if (validationError.details) {
+        for (const details of validationError.details) {
+            const path = details.path;
+            detailedError.output.payload.validation.keys.push(Hoek.escapeHtml(path.join('.')));
+        }
+    }
+
+    if (request.route.settings.validate.errorFields) {
+        for (const field in request.route.settings.validate.errorFields) {
+            detailedError.output.payload[field] = request.route.settings.validate.errorFields[field];
+        }
+    }
+
+    return request._core.toolkit.failAction(request, request.route.settings.validate.failAction, defaultError, { details: detailedError, tags: ['validation', 'error', source] });
+};
+
+
+exports.response = async function (request) {
+
+    if (request.route.settings.response.sample) {
+        const currentSample = Math.ceil(Math.random() * 100);
+        if (currentSample > request.route.settings.response.sample) {
+            return;
+        }
+    }
+
+    const response = request.response;
+    const statusCode = response.isBoom ? response.output.statusCode : response.statusCode;
+
+    const statusSchema = request.route.settings.response.status[statusCode];
+    if (statusCode >= 400 &&
+        !statusSchema) {
+
+        return;                 // Do not validate errors by default
+    }
+
+    const schema = statusSchema !== undefined ? statusSchema : request.route.settings.response.schema;
+    if (schema === null) {
+        return;                 // No rules
+    }
+
+    if (!response.isBoom &&
+        request.response.variety !== 'plain') {
+
+        throw Boom.badImplementation('Cannot validate non-object response');
+    }
+
+    const localOptions = {
+        context: {
+            headers: request.headers,
+            params: request.params,
+            query: request.query,
+            payload: request.payload,
+            state: request.state,
+            auth: request.auth,
+            app: {
+                route: request.route.settings.app,
+                request: request.app
+            }
+        }
+    };
+
+    const source = response.isBoom ? response.output.payload : response.source;
+    Hoek.merge(localOptions, request.route.settings.response.options);
+
+    try {
+        let value;
+
+        if (typeof schema !== 'function') {
+            value = await internals.validate(source, schema, localOptions);
+        }
+        else {
+            value = await schema(source, localOptions);
+        }
+
+        if (value !== undefined &&
+            request.route.settings.response.modify) {
+
+            if (response.isBoom) {
+                response.output.payload = value;
+            }
+            else {
+                response.source = value;
+            }
+        }
+    }
+    catch (err) {
+        return request._core.toolkit.failAction(request, request.route.settings.response.failAction, err, { tags: ['validation', 'response', 'error'] });
+    }
+};
+
+
+internals.validate = function (value, schema, options) {
+
+    if (typeof schema.validateAsync === 'function') {
+        return schema.validateAsync(value, options);
+    }
+
+    return schema.validate(value, options);
+};
diff --git a/node_modules/@hapi/hapi/package.json b/node_modules/@hapi/hapi/package.json
new file mode 100755
index 0000000..d27533e
--- /dev/null
+++ b/node_modules/@hapi/hapi/package.json
@@ -0,0 +1,66 @@
+{
+  "name": "@hapi/hapi",
+  "description": "HTTP Server framework",
+  "homepage": "https://hapi.dev",
+  "version": "21.4.9",
+  "repository": "git://github.com/hapijs/hapi",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "engines": {
+    "node": ">=14.15.0"
+  },
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "framework",
+    "http",
+    "api",
+    "web"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/accept": "^6.0.3",
+    "@hapi/ammo": "^6.0.1",
+    "@hapi/boom": "^10.0.1",
+    "@hapi/bounce": "^3.0.2",
+    "@hapi/call": "^9.0.1",
+    "@hapi/catbox": "^12.1.1",
+    "@hapi/catbox-memory": "^6.0.2",
+    "@hapi/heavy": "^8.0.1",
+    "@hapi/hoek": "^11.0.7",
+    "@hapi/mimos": "^7.0.1",
+    "@hapi/podium": "^5.0.2",
+    "@hapi/shot": "^6.0.2",
+    "@hapi/somever": "^4.1.1",
+    "@hapi/statehood": "^8.2.1",
+    "@hapi/subtext": "^8.1.3",
+    "@hapi/teamwork": "^6.0.1",
+    "@hapi/topo": "^6.0.2",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/inert": "^7.1.0",
+    "@hapi/joi-legacy-test": "npm:@hapi/joi@^15.0.0",
+    "@hapi/lab": "^25.3.2",
+    "@hapi/vision": "^7.0.3",
+    "@hapi/wreck": "^18.1.0",
+    "@types/node": "^18.19.130",
+    "handlebars": "^4.7.9",
+    "joi": "^17.13.3",
+    "legacy-readable-stream": "npm:readable-stream@^1.0.34",
+    "typescript": "^5.9.3"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -m 5000 -Y",
+    "test-tap": "lab -a @hapi/code -r tap -o tests.tap -m 5000",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html -m 5000"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/heavy/LICENSE.md b/node_modules/@hapi/heavy/LICENSE.md
new file mode 100755
index 0000000..9306da5
--- /dev/null
+++ b/node_modules/@hapi/heavy/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2013-2022, Project contributors
+Copyright (c) 2013-2020, Sideway Inc
+Copyright (c) 2013-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/heavy/README.md b/node_modules/@hapi/heavy/README.md
new file mode 100755
index 0000000..d3123be
--- /dev/null
+++ b/node_modules/@hapi/heavy/README.md
@@ -0,0 +1,17 @@
+<a href="http://hapijs.com"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/heavy
+
+#### Measure process load.
+
+**heavy** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/heavy/)
+- [Version status](https://hapi.dev/resources/status/#heavy) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/heavy/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/heavy/lib/index.js b/node_modules/@hapi/heavy/lib/index.js
new file mode 100755
index 0000000..e1f702a
--- /dev/null
+++ b/node_modules/@hapi/heavy/lib/index.js
@@ -0,0 +1,131 @@
+'use strict';
+
+const PerfHooks = require('perf_hooks');
+const Boom = require('@hapi/boom');
+const Hoek = require('@hapi/hoek');
+const Validate = require('@hapi/validate');
+
+
+const internals = {};
+
+
+internals.schema = Validate.object({
+    sampleInterval: Validate.number().min(0),
+    maxHeapUsedBytes: Validate.number().min(0),
+    maxEventLoopDelay: Validate.number().min(0),
+    maxEventLoopUtilization: Validate.number().min(0),
+    maxRssBytes: Validate.number().min(0)
+})
+    .unknown();
+
+
+internals.defaults = {
+    sampleInterval: 0,                          // Frequency of load sampling in milliseconds (zero is no sampling)
+    maxHeapUsedBytes: 0,                        // Reject requests when V8 heap is over size in bytes (zero is no max)
+    maxRssBytes: 0,                             // Reject requests when process RSS is over size in bytes (zero is no max)
+    maxEventLoopDelay: 0,                       // Milliseconds of delay after which requests are rejected (zero is no max)
+    maxEventLoopUtilization: 0                  // Max event loop utilization value after which requests are rejected (zero is no max)
+};
+
+
+exports.Heavy = class Heavy {
+
+    constructor(options) {
+
+        options = options || {};
+
+        Validate.assert(options, internals.schema, 'Invalid load monitoring options');
+        this.settings = Hoek.applyToDefaults(internals.defaults, options);
+        Hoek.assert(this.settings.sampleInterval || (!this.settings.maxEventLoopDelay && !this.settings.maxHeapUsedBytes && !this.settings.maxRssBytes && !this.settings.maxEventLoopUtilization), 'Load sample interval must be set to enable load limits');
+
+        this._eventLoopTimer = null;
+        this._eventLoopUtilization = PerfHooks.performance.eventLoopUtilization();
+        this._loadBench = new Hoek.Bench();
+        this.load = {
+            eventLoopDelay: 0,
+            eventLoopUtilization: 0,
+            heapUsed: 0,
+            rss: 0
+        };
+    }
+
+    start() {
+
+        if (!this.settings.sampleInterval) {
+            return;
+        }
+
+        const loopSample = () => {
+
+            this._loadBench.reset();
+            const measure = () => {
+
+                const mem = process.memoryUsage();
+
+                // Retain the same this.load object to keep external references valid
+
+                this._eventLoopUtilization = PerfHooks.performance.eventLoopUtilization(this._eventLoopUtilization);
+
+                this.load.eventLoopDelay = (this._loadBench.elapsed() - this.settings.sampleInterval);
+                this.load.eventLoopUtilization = this._eventLoopUtilization.utilization;
+                this.load.heapUsed = mem.heapUsed;
+                this.load.rss = mem.rss;
+
+                loopSample();
+            };
+
+            this._eventLoopTimer = setTimeout(measure, this.settings.sampleInterval);
+        };
+
+        loopSample();
+    }
+
+    stop() {
+
+        clearTimeout(this._eventLoopTimer);
+        this._eventLoopTimer = null;
+    }
+
+    check() {
+
+        if (!this.settings.sampleInterval) {
+            return;
+        }
+
+        Hoek.assert(this._eventLoopTimer, 'Cannot check load when sampler is not started');
+
+        const elapsed = this._loadBench.elapsed();
+        const load = this.load;
+
+        if (elapsed > this.settings.sampleInterval) {
+            this._eventLoopUtilization = PerfHooks.performance.eventLoopUtilization(this._eventLoopUtilization);
+
+            load.eventLoopDelay = Math.max(load.eventLoopDelay, elapsed - this.settings.sampleInterval);
+            load.eventLoopUtilization = this._eventLoopUtilization.utilization;
+        }
+
+        if (this.settings.maxEventLoopDelay &&
+            load.eventLoopDelay > this.settings.maxEventLoopDelay) {
+
+            throw Boom.serverUnavailable('Server under heavy load (event loop)', load);
+        }
+
+        if (this.settings.maxEventLoopUtilization &&
+            load.eventLoopUtilization > this.settings.maxEventLoopUtilization) {
+
+            throw Boom.serverUnavailable('Server under heavy load (event loop utilization)', load);
+        }
+
+        if (this.settings.maxHeapUsedBytes &&
+            load.heapUsed > this.settings.maxHeapUsedBytes) {
+
+            throw Boom.serverUnavailable('Server under heavy load (heap)', load);
+        }
+
+        if (this.settings.maxRssBytes &&
+            load.rss > this.settings.maxRssBytes) {
+
+            throw Boom.serverUnavailable('Server under heavy load (rss)', load);
+        }
+    }
+};
diff --git a/node_modules/@hapi/heavy/package.json b/node_modules/@hapi/heavy/package.json
new file mode 100755
index 0000000..346eae7
--- /dev/null
+++ b/node_modules/@hapi/heavy/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "@hapi/heavy",
+  "description": "Measure process load",
+  "version": "8.0.1",
+  "repository": "git://github.com/hapijs/heavy",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "process",
+    "load",
+    "measure",
+    "delay",
+    "memory"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2"
+  },
+  "scripts": {
+    "test": "lab -t 100 -a @hapi/code -L",
+    "test-cov-html": "lab -t 100 -a @hapi/code -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/hoek/LICENSE.md b/node_modules/@hapi/hoek/LICENSE.md
new file mode 100755
index 0000000..7eb0337
--- /dev/null
+++ b/node_modules/@hapi/hoek/LICENSE.md
@@ -0,0 +1,13 @@
+Copyright (c) 2011-2022, Project contributors
+Copyright (c) 2011-2020, Sideway Inc
+Copyright (c) 2011-2014, Walmart
+Copyright (c) 2011, Yahoo Inc.
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/hoek/README.md b/node_modules/@hapi/hoek/README.md
new file mode 100755
index 0000000..8771dbf
--- /dev/null
+++ b/node_modules/@hapi/hoek/README.md
@@ -0,0 +1,19 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/hoek
+
+#### Utility methods for the hapi ecosystem.
+
+**hoek** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+This module is not intended to solve every problem for everyone, but rather as a central place to store hapi-specific methods. If you're looking for a general purpose utility module, check out [lodash](https://github.com/lodash/lodash).
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/hoek/)
+- [Version status](https://hapi.dev/resources/status/#hoek) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/hoek/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/hoek/lib/applyToDefaults.d.ts b/node_modules/@hapi/hoek/lib/applyToDefaults.d.ts
new file mode 100644
index 0000000..8236d9a
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/applyToDefaults.d.ts
@@ -0,0 +1,3 @@
+import { applyToDefaults } from "./index";
+
+export = applyToDefaults;
diff --git a/node_modules/@hapi/hoek/lib/applyToDefaults.js b/node_modules/@hapi/hoek/lib/applyToDefaults.js
new file mode 100755
index 0000000..9881247
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/applyToDefaults.js
@@ -0,0 +1,102 @@
+'use strict';
+
+const Assert = require('./assert');
+const Clone = require('./clone');
+const Merge = require('./merge');
+const Reach = require('./reach');
+
+
+const internals = {};
+
+
+module.exports = function (defaults, source, options = {}) {
+
+    Assert(defaults && typeof defaults === 'object', 'Invalid defaults value: must be an object');
+    Assert(!source || source === true || typeof source === 'object', 'Invalid source value: must be true, falsy or an object');
+    Assert(typeof options === 'object', 'Invalid options: must be an object');
+
+    if (!source) {                                                  // If no source, return null
+        return null;
+    }
+
+    if (options.shallow) {
+        return internals.applyToDefaultsWithShallow(defaults, source, options);
+    }
+
+    const copy = Clone(defaults);
+
+    if (source === true) {                                          // If source is set to true, use defaults
+        return copy;
+    }
+
+    const nullOverride = options.nullOverride !== undefined ? options.nullOverride : false;
+    return Merge(copy, source, { nullOverride, mergeArrays: false });
+};
+
+
+internals.applyToDefaultsWithShallow = function (defaults, source, options) {
+
+    const keys = options.shallow;
+    Assert(Array.isArray(keys), 'Invalid keys');
+
+    const seen = new Map();
+    const merge = source === true ? null : new Set();
+
+    for (let key of keys) {
+        key = Array.isArray(key) ? key : key.split('.');            // Pre-split optimization
+
+        const ref = Reach(defaults, key);
+        if (ref &&
+            typeof ref === 'object') {
+
+            seen.set(ref, merge && Reach(source, key) || ref);
+        }
+        else if (merge) {
+            merge.add(key);
+        }
+    }
+
+    const copy = Clone(defaults, {}, seen);
+
+    if (!merge) {
+        return copy;
+    }
+
+    for (const key of merge) {
+        internals.reachCopy(copy, source, key);
+    }
+
+    const nullOverride = options.nullOverride !== undefined ? options.nullOverride : false;
+    return Merge(copy, source, { nullOverride, mergeArrays: false });
+};
+
+
+internals.reachCopy = function (dst, src, path) {
+
+    for (const segment of path) {
+        if (!(segment in src)) {
+            return;
+        }
+
+        const val = src[segment];
+
+        if (typeof val !== 'object' || val === null) {
+            return;
+        }
+
+        src = val;
+    }
+
+    const value = src;
+    let ref = dst;
+    for (let i = 0; i < path.length - 1; ++i) {
+        const segment = path[i];
+        if (typeof ref[segment] !== 'object') {
+            ref[segment] = {};
+        }
+
+        ref = ref[segment];
+    }
+
+    ref[path[path.length - 1]] = value;
+};
diff --git a/node_modules/@hapi/hoek/lib/assert.d.ts b/node_modules/@hapi/hoek/lib/assert.d.ts
new file mode 100644
index 0000000..732b520
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/assert.d.ts
@@ -0,0 +1,3 @@
+import { assert } from "./index";
+
+export = assert;
diff --git a/node_modules/@hapi/hoek/lib/assert.js b/node_modules/@hapi/hoek/lib/assert.js
new file mode 100755
index 0000000..acfe618
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/assert.js
@@ -0,0 +1,30 @@
+'use strict';
+
+const AssertError = require('./assertError');
+const Stringify = require('./stringify');
+
+
+const internals = {};
+
+
+const assert = module.exports = function (condition, ...args) {
+
+    if (condition) {
+        return;
+    }
+
+    if (args.length === 1 &&
+        args[0] instanceof Error) {
+
+        throw args[0];
+    }
+
+    const msgs = args
+        .filter((arg) => arg !== '')
+        .map((arg) => {
+
+            return typeof arg === 'string' ? arg : arg instanceof Error ? arg.message : Stringify(arg);
+        });
+
+    throw new AssertError(msgs.join(' '), assert);
+};
diff --git a/node_modules/@hapi/hoek/lib/assertError.d.ts b/node_modules/@hapi/hoek/lib/assertError.d.ts
new file mode 100644
index 0000000..82f3f5b
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/assertError.d.ts
@@ -0,0 +1,3 @@
+import { AssertError } from "./index";
+
+export = AssertError;
diff --git a/node_modules/@hapi/hoek/lib/assertError.js b/node_modules/@hapi/hoek/lib/assertError.js
new file mode 100755
index 0000000..699c8b0
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/assertError.js
@@ -0,0 +1,18 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = class AssertError extends Error {
+
+    name = 'AssertError';
+
+    constructor(message, ctor) {
+
+        super(message || 'Unknown error');
+
+        if (typeof Error.captureStackTrace === 'function') {            // $lab:coverage:ignore$
+            Error.captureStackTrace(this, ctor);
+        }
+    }
+};
diff --git a/node_modules/@hapi/hoek/lib/bench.d.ts b/node_modules/@hapi/hoek/lib/bench.d.ts
new file mode 100644
index 0000000..1fa3f4d
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/bench.d.ts
@@ -0,0 +1,3 @@
+import { Bench } from "./index";
+
+export = Bench;
diff --git a/node_modules/@hapi/hoek/lib/bench.js b/node_modules/@hapi/hoek/lib/bench.js
new file mode 100755
index 0000000..26ee196
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/bench.js
@@ -0,0 +1,29 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = internals.Bench = class {
+
+    constructor() {
+
+        this.ts = 0;
+        this.reset();
+    }
+
+    reset() {
+
+        this.ts = internals.Bench.now();
+    }
+
+    elapsed() {
+
+        return internals.Bench.now() - this.ts;
+    }
+
+    static now() {
+
+        const ts = process.hrtime();
+        return (ts[0] * 1e3) + (ts[1] / 1e6);
+    }
+};
diff --git a/node_modules/@hapi/hoek/lib/block.d.ts b/node_modules/@hapi/hoek/lib/block.d.ts
new file mode 100644
index 0000000..0385864
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/block.d.ts
@@ -0,0 +1,3 @@
+import { block } from "./index";
+
+export = block;
diff --git a/node_modules/@hapi/hoek/lib/block.js b/node_modules/@hapi/hoek/lib/block.js
new file mode 100755
index 0000000..73fb9a5
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/block.js
@@ -0,0 +1,12 @@
+'use strict';
+
+const Ignore = require('./ignore');
+
+
+const internals = {};
+
+
+module.exports = function () {
+
+    return new Promise(Ignore);
+};
diff --git a/node_modules/@hapi/hoek/lib/clone.d.ts b/node_modules/@hapi/hoek/lib/clone.d.ts
new file mode 100644
index 0000000..6621117
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/clone.d.ts
@@ -0,0 +1,3 @@
+import { clone } from "./index";
+
+export = clone;
diff --git a/node_modules/@hapi/hoek/lib/clone.js b/node_modules/@hapi/hoek/lib/clone.js
new file mode 100755
index 0000000..fec88d7
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/clone.js
@@ -0,0 +1,198 @@
+'use strict';
+
+const Reach = require('./reach');
+const Types = require('./types');
+const Utils = require('./utils');
+
+
+const internals = {
+    needsProtoHack: new Set([Types.set, Types.map, Types.weakSet, Types.weakMap]),
+    structuredCloneExists: typeof structuredClone === 'function'
+};
+
+
+module.exports = internals.clone = function (obj, options = {}, _seen = null) {
+
+    if (typeof obj !== 'object' ||
+        obj === null) {
+
+        return obj;
+    }
+
+    let clone = internals.clone;
+    let seen = _seen;
+
+    if (options.shallow) {
+        if (options.shallow !== true) {
+            return internals.cloneWithShallow(obj, options);
+        }
+
+        clone = (value) => value;
+    }
+    else if (seen) {
+        const lookup = seen.get(obj);
+        if (lookup) {
+            return lookup;
+        }
+    }
+    else {
+        seen = new Map();
+    }
+
+    // Built-in object types
+
+    const baseProto = Types.getInternalProto(obj);
+    switch (baseProto) {
+        case Types.buffer:
+            return Buffer?.from(obj);
+        case Types.date:
+            return new Date(obj.getTime());
+        case Types.regex:
+        case Types.url:
+            return new baseProto.constructor(obj);
+    }
+
+    // Generic objects
+
+    const newObj = internals.base(obj, baseProto, options);
+    if (newObj === obj) {
+        return obj;
+    }
+
+    if (seen) {
+        seen.set(obj, newObj);                              // Set seen, since obj could recurse
+    }
+
+    if (baseProto === Types.set) {
+        for (const value of obj) {
+            newObj.add(clone(value, options, seen));
+        }
+    }
+    else if (baseProto === Types.map) {
+        for (const [key, value] of obj) {
+            newObj.set(key, clone(value, options, seen));
+        }
+    }
+
+    const keys = Utils.keys(obj, options);
+    for (const key of keys) {
+        if (key === '__proto__') {
+            continue;
+        }
+
+        if (baseProto === Types.array &&
+            key === 'length') {
+
+            newObj.length = obj.length;
+            continue;
+        }
+
+        // Can only be covered in node 21+
+        /* $lab:coverage:off$ */
+        if (internals.structuredCloneExists &&
+            baseProto === Types.error &&
+            key === 'stack') {
+
+            continue;       // Already a part of the base object
+        }
+        /* $lab:coverage:on$ */
+
+        const descriptor = Object.getOwnPropertyDescriptor(obj, key);
+        if (descriptor) {
+            if (descriptor.get ||
+                descriptor.set) {
+
+                Object.defineProperty(newObj, key, descriptor);
+            }
+            else if (descriptor.enumerable) {
+                newObj[key] = clone(obj[key], options, seen);
+            }
+            else {
+                Object.defineProperty(newObj, key, { enumerable: false, writable: true, configurable: true, value: clone(obj[key], options, seen) });
+            }
+        }
+        else {
+            Object.defineProperty(newObj, key, {
+                enumerable: true,
+                writable: true,
+                configurable: true,
+                value: clone(obj[key], options, seen)
+            });
+        }
+    }
+
+    return newObj;
+};
+
+
+internals.cloneWithShallow = function (source, options) {
+
+    const keys = options.shallow;
+    options = Object.assign({}, options);
+    options.shallow = false;
+
+    const seen = new Map();
+
+    for (const key of keys) {
+        const ref = Reach(source, key);
+        if (typeof ref === 'object' ||
+            typeof ref === 'function') {
+
+            seen.set(ref, ref);
+        }
+    }
+
+    return internals.clone(source, options, seen);
+};
+
+
+internals.base = function (obj, baseProto, options) {
+
+    if (options.prototype === false) {                  // Defaults to true
+        if (internals.needsProtoHack.has(baseProto)) {
+            return new baseProto.constructor();
+        }
+
+        return baseProto === Types.array ? [] : {};
+    }
+
+    const proto = Object.getPrototypeOf(obj);
+    if (proto &&
+        proto.isImmutable) {
+
+        return obj;
+    }
+
+    if (baseProto === Types.array) {
+        const newObj = [];
+        if (proto !== baseProto) {
+            Object.setPrototypeOf(newObj, proto);
+        }
+
+        return newObj;
+    }
+    // Can only be covered in node 21+
+    /* $lab:coverage:off$ */
+    else if (baseProto === Types.error && internals.structuredCloneExists &&
+        (proto === baseProto || Error.isPrototypeOf(proto.constructor))) {      // Don't match Util.inherit() subclassed errors
+
+        const err = structuredClone(obj);                                       // Needed to copy internal stack state
+        if (Object.getPrototypeOf(err) !== proto) {
+            Object.setPrototypeOf(err, proto);                                  // Fix prototype
+        }
+
+        return err;
+    }
+    /* $lab:coverage:on$ */
+
+    if (internals.needsProtoHack.has(baseProto)) {
+        const newObj = new proto.constructor();
+        if (proto !== baseProto) {
+            Object.setPrototypeOf(newObj, proto);
+        }
+
+        return newObj;
+    }
+
+    return Object.create(proto);
+};
diff --git a/node_modules/@hapi/hoek/lib/contain.d.ts b/node_modules/@hapi/hoek/lib/contain.d.ts
new file mode 100644
index 0000000..03b40c8
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/contain.d.ts
@@ -0,0 +1,3 @@
+import { contain } from "./index";
+
+export = contain;
diff --git a/node_modules/@hapi/hoek/lib/contain.js b/node_modules/@hapi/hoek/lib/contain.js
new file mode 100755
index 0000000..f4d4eee
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/contain.js
@@ -0,0 +1,307 @@
+'use strict';
+
+const Assert = require('./assert');
+const DeepEqual = require('./deepEqual');
+const EscapeRegex = require('./escapeRegex');
+const Utils = require('./utils');
+
+
+const internals = {};
+
+
+module.exports = function (ref, values, options = {}) {        // options: { deep, once, only, part, symbols }
+
+    /*
+        string -> string(s)
+        array -> item(s)
+        object -> key(s)
+        object -> object (key:value)
+    */
+
+    if (typeof values !== 'object') {
+        values = [values];
+    }
+
+    Assert(!Array.isArray(values) || values.length, 'Values array cannot be empty');
+
+    // String
+
+    if (typeof ref === 'string') {
+        return internals.string(ref, values, options);
+    }
+
+    // Array
+
+    if (Array.isArray(ref)) {
+        return internals.array(ref, values, options);
+    }
+
+    // Object
+
+    Assert(typeof ref === 'object', 'Reference must be string or an object');
+    return internals.object(ref, values, options);
+};
+
+
+internals.array = function (ref, values, options) {
+
+    if (!Array.isArray(values)) {
+        values = [values];
+    }
+
+    if (!ref.length) {
+        return false;
+    }
+
+    if (options.only &&
+        options.once &&
+        ref.length !== values.length) {
+
+        return false;
+    }
+
+    let compare;
+
+    // Map values
+
+    const map = new Map();
+    for (const value of values) {
+        if (!options.deep ||
+            !value ||
+            typeof value !== 'object') {
+
+            const existing = map.get(value);
+            if (existing) {
+                ++existing.allowed;
+            }
+            else {
+                map.set(value, { allowed: 1, hits: 0 });
+            }
+        }
+        else {
+            compare = compare ?? internals.compare(options);
+
+            let found = false;
+            for (const [key, existing] of map.entries()) {
+                if (compare(key, value)) {
+                    ++existing.allowed;
+                    found = true;
+                    break;
+                }
+            }
+
+            if (!found) {
+                map.set(value, { allowed: 1, hits: 0 });
+            }
+        }
+    }
+
+    // Lookup values
+
+    let hits = 0;
+    for (const item of ref) {
+        let match;
+        if (!options.deep ||
+            !item ||
+            typeof item !== 'object') {
+
+            match = map.get(item);
+        }
+        else {
+            compare = compare ?? internals.compare(options);
+
+            for (const [key, existing] of map.entries()) {
+                if (compare(key, item)) {
+                    match = existing;
+                    break;
+                }
+            }
+        }
+
+        if (match) {
+            ++match.hits;
+            ++hits;
+
+            if (options.once &&
+                match.hits > match.allowed) {
+
+                return false;
+            }
+        }
+    }
+
+    // Validate results
+
+    if (options.only &&
+        hits !== ref.length) {
+
+        return false;
+    }
+
+    for (const match of map.values()) {
+        if (match.hits === match.allowed) {
+            continue;
+        }
+
+        if (match.hits < match.allowed &&
+            !options.part) {
+
+            return false;
+        }
+    }
+
+    return !!hits;
+};
+
+
+internals.object = function (ref, values, options) {
+
+    Assert(options.once === undefined, 'Cannot use option once with object');
+
+    const keys = Utils.keys(ref, options);
+    if (!keys.length) {
+        return false;
+    }
+
+    // Keys list
+
+    if (Array.isArray(values)) {
+        return internals.array(keys, values, options);
+    }
+
+    // Key value pairs
+
+    const symbols = Object.getOwnPropertySymbols(values).filter((sym) => values.propertyIsEnumerable(sym));
+    const targets = [...Object.keys(values), ...symbols];
+
+    const compare = internals.compare(options);
+    const set = new Set(targets);
+
+    for (const key of keys) {
+        if (!set.has(key)) {
+            if (options.only) {
+                return false;
+            }
+
+            continue;
+        }
+
+        if (!compare(values[key], ref[key])) {
+            return false;
+        }
+
+        set.delete(key);
+    }
+
+    if (set.size) {
+        return options.part ? set.size < targets.length : false;
+    }
+
+    return true;
+};
+
+
+internals.string = function (ref, values, options) {
+
+    // Empty string
+
+    if (ref === '') {
+        return values.length === 1 && values[0] === '' ||               // '' contains ''
+            !options.once && !values.some((v) => v !== '');             // '' contains multiple '' if !once
+    }
+
+    // Map values
+
+    const map = new Map();
+    const patterns = [];
+
+    for (const value of values) {
+        Assert(typeof value === 'string', 'Cannot compare string reference to non-string value');
+
+        if (value) {
+            const existing = map.get(value);
+            if (existing) {
+                ++existing.allowed;
+            }
+            else {
+                map.set(value, { allowed: 1, hits: 0 });
+                patterns.push(EscapeRegex(value));
+            }
+        }
+        else if (options.once ||
+            options.only) {
+
+            return false;
+        }
+    }
+
+    if (!patterns.length) {                     // Non-empty string contains unlimited empty string
+        return true;
+    }
+
+    // Match patterns
+
+    const regex = new RegExp(`(${patterns.join('|')})`, 'g');
+    const leftovers = ref.replace(regex, ($0, $1) => {
+
+        ++map.get($1).hits;
+        return '';                              // Remove from string
+    });
+
+    // Validate results
+
+    if (options.only &&
+        leftovers) {
+
+        return false;
+    }
+
+    let any = false;
+    for (const match of map.values()) {
+        if (match.hits) {
+            any = true;
+        }
+
+        if (match.hits === match.allowed) {
+            continue;
+        }
+
+        if (match.hits < match.allowed &&
+            !options.part) {
+
+            return false;
+        }
+
+        // match.hits > match.allowed
+
+        if (options.once) {
+            return false;
+        }
+    }
+
+    return !!any;
+};
+
+
+internals.compare = function (options) {
+
+    if (!options.deep) {
+        return internals.shallow;
+    }
+
+    const hasOnly = options.only !== undefined;
+    const hasPart = options.part !== undefined;
+
+    const flags = {
+        prototype: hasOnly ? options.only : hasPart ? !options.part : false,
+        part: hasOnly ? !options.only : hasPart ? options.part : false
+    };
+
+    return (a, b) => DeepEqual(a, b, flags);
+};
+
+
+internals.shallow = function (a, b) {
+
+    return a === b;
+};
diff --git a/node_modules/@hapi/hoek/lib/deepEqual.d.ts b/node_modules/@hapi/hoek/lib/deepEqual.d.ts
new file mode 100644
index 0000000..8be0ea6
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/deepEqual.d.ts
@@ -0,0 +1,3 @@
+import { deepEqual } from "./index";
+
+export = deepEqual;
diff --git a/node_modules/@hapi/hoek/lib/deepEqual.js b/node_modules/@hapi/hoek/lib/deepEqual.js
new file mode 100755
index 0000000..a41df5a
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/deepEqual.js
@@ -0,0 +1,317 @@
+'use strict';
+
+const Types = require('./types');
+
+
+const internals = {
+    mismatched: null
+};
+
+
+module.exports = function (obj, ref, options) {
+
+    options = Object.assign({ prototype: true }, options);
+
+    return !!internals.isDeepEqual(obj, ref, options, []);
+};
+
+
+internals.isDeepEqual = function (obj, ref, options, seen) {
+
+    if (obj === ref) {                                                      // Copied from Deep-eql, copyright(c) 2013 Jake Luer, jake@alogicalparadox.com, MIT Licensed, https://github.com/chaijs/deep-eql
+        return obj !== 0 || 1 / obj === 1 / ref;
+    }
+
+    const type = typeof obj;
+
+    if (type !== typeof ref) {
+        return false;
+    }
+
+    if (obj === null ||
+        ref === null) {
+
+        return false;
+    }
+
+    if (type === 'function') {
+        if (!options.deepFunction ||
+            obj.toString() !== ref.toString()) {
+
+            return false;
+        }
+
+        // Continue as object
+    }
+    else if (type !== 'object') {
+        return obj !== obj && ref !== ref;                                  // NaN
+    }
+
+    const instanceType = internals.getSharedType(obj, ref, !!options.prototype);
+    switch (instanceType) {
+        case Types.buffer:
+            return Buffer && Buffer.prototype.equals.call(obj, ref);        // $lab:coverage:ignore$
+        case Types.promise:
+            return obj === ref;
+        case Types.regex:
+        case Types.url:
+            return obj.toString() === ref.toString();
+        case internals.mismatched:
+            return false;
+    }
+
+    for (let i = seen.length - 1; i >= 0; --i) {
+        if (seen[i].isSame(obj, ref)) {
+            return true;                                                    // If previous comparison failed, it would have stopped execution
+        }
+    }
+
+    seen.push(new internals.SeenEntry(obj, ref));
+
+    try {
+        return !!internals.isDeepEqualObj(instanceType, obj, ref, options, seen);
+    }
+    finally {
+        seen.pop();
+    }
+};
+
+
+internals.getSharedType = function (obj, ref, checkPrototype) {
+
+    if (checkPrototype) {
+        if (Object.getPrototypeOf(obj) !== Object.getPrototypeOf(ref)) {
+            return internals.mismatched;
+        }
+
+        return Types.getInternalProto(obj);
+    }
+
+    const type = Types.getInternalProto(obj);
+    if (type !== Types.getInternalProto(ref)) {
+        return internals.mismatched;
+    }
+
+    return type;
+};
+
+
+internals.valueOf = function (obj) {
+
+    const objValueOf = obj.valueOf;
+    if (objValueOf === undefined) {
+        return obj;
+    }
+
+    try {
+        return objValueOf.call(obj);
+    }
+    catch (err) {
+        return err;
+    }
+};
+
+
+internals.hasOwnEnumerableProperty = function (obj, key) {
+
+    return Object.prototype.propertyIsEnumerable.call(obj, key);
+};
+
+
+internals.isSetSimpleEqual = function (obj, ref) {
+
+    for (const entry of Set.prototype.values.call(obj)) {
+        if (!Set.prototype.has.call(ref, entry)) {
+            return false;
+        }
+    }
+
+    return true;
+};
+
+
+internals.isDeepEqualObj = function (instanceType, obj, ref, options, seen) {
+
+    const { isDeepEqual, valueOf, hasOwnEnumerableProperty } = internals;
+    const { keys, getOwnPropertySymbols } = Object;
+
+    if (instanceType === Types.array) {
+        if (options.part) {
+
+            // Check if any index match any other index
+
+            for (const objValue of obj) {
+                for (const refValue of ref) {
+                    if (isDeepEqual(objValue, refValue, options, seen)) {
+                        return true;
+                    }
+                }
+            }
+        }
+        else {
+            if (obj.length !== ref.length) {
+                return false;
+            }
+
+            for (let i = 0; i < obj.length; ++i) {
+                if (!isDeepEqual(obj[i], ref[i], options, seen)) {
+                    return false;
+                }
+            }
+
+            return true;
+        }
+    }
+    else if (instanceType === Types.set) {
+        if (obj.size !== ref.size) {
+            return false;
+        }
+
+        if (!internals.isSetSimpleEqual(obj, ref)) {
+
+            // Check for deep equality
+
+            const ref2 = new Set(Set.prototype.values.call(ref));
+            for (const objEntry of Set.prototype.values.call(obj)) {
+                if (ref2.delete(objEntry)) {
+                    continue;
+                }
+
+                let found = false;
+                for (const refEntry of ref2) {
+                    if (isDeepEqual(objEntry, refEntry, options, seen)) {
+                        ref2.delete(refEntry);
+                        found = true;
+                        break;
+                    }
+                }
+
+                if (!found) {
+                    return false;
+                }
+            }
+        }
+    }
+    else if (instanceType === Types.map) {
+        if (obj.size !== ref.size) {
+            return false;
+        }
+
+        for (const [key, value] of Map.prototype.entries.call(obj)) {
+            if (value === undefined && !Map.prototype.has.call(ref, key)) {
+                return false;
+            }
+
+            if (!isDeepEqual(value, Map.prototype.get.call(ref, key), options, seen)) {
+                return false;
+            }
+        }
+    }
+    else if (instanceType === Types.error) {
+
+        // Always check name and message
+
+        if (obj.name !== ref.name ||
+            obj.message !== ref.message) {
+
+            return false;
+        }
+    }
+
+    // Check .valueOf()
+
+    const valueOfObj = valueOf(obj);
+    const valueOfRef = valueOf(ref);
+    if ((obj !== valueOfObj || ref !== valueOfRef) &&
+        !isDeepEqual(valueOfObj, valueOfRef, options, seen)) {
+
+        return false;
+    }
+
+    // Check properties
+
+    const objKeys = keys(obj);
+    if (!options.part &&
+        objKeys.length !== keys(ref).length &&
+        !options.skip) {
+
+        return false;
+    }
+
+    let skipped = 0;
+    for (const key of objKeys) {
+        if (options.skip &&
+            options.skip.includes(key)) {
+
+            if (ref[key] === undefined) {
+                ++skipped;
+            }
+
+            continue;
+        }
+
+        if (!hasOwnEnumerableProperty(ref, key)) {
+            return false;
+        }
+
+        if (!isDeepEqual(obj[key], ref[key], options, seen)) {
+            return false;
+        }
+    }
+
+    if (!options.part &&
+        objKeys.length - skipped !== keys(ref).length) {
+
+        return false;
+    }
+
+    // Check symbols
+
+    if (options.symbols !== false) {                                // Defaults to true
+        const objSymbols = getOwnPropertySymbols(obj);
+        const refSymbols = new Set(getOwnPropertySymbols(ref));
+
+        for (const key of objSymbols) {
+            if (!options.skip?.includes(key)) {
+
+                if (hasOwnEnumerableProperty(obj, key)) {
+                    if (!hasOwnEnumerableProperty(ref, key)) {
+                        return false;
+                    }
+
+                    if (!isDeepEqual(obj[key], ref[key], options, seen)) {
+                        return false;
+                    }
+                }
+                else if (hasOwnEnumerableProperty(ref, key)) {
+                    return false;
+                }
+            }
+
+            refSymbols.delete(key);
+        }
+
+        for (const key of refSymbols) {
+            if (hasOwnEnumerableProperty(ref, key)) {
+                return false;
+            }
+        }
+    }
+
+    return true;
+};
+
+
+internals.SeenEntry = class {
+
+    constructor(obj, ref) {
+
+        this.obj = obj;
+        this.ref = ref;
+    }
+
+    isSame(obj, ref) {
+
+        return this.obj === obj && this.ref === ref;
+    }
+};
diff --git a/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.d.ts b/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.d.ts
new file mode 100644
index 0000000..78117c8
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.d.ts
@@ -0,0 +1,3 @@
+import { escapeHeaderAttribute } from "./index";
+
+export = escapeHeaderAttribute;
diff --git a/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.js b/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.js
new file mode 100755
index 0000000..a0a4dee
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeHeaderAttribute.js
@@ -0,0 +1,16 @@
+'use strict';
+
+const Assert = require('./assert');
+
+
+const internals = {};
+
+
+module.exports = function (attribute) {
+
+    // Allowed value characters: !#$%&'()*+,-./:;<=>?@[]^_`{|}~ and space, a-z, A-Z, 0-9, \, "
+
+    Assert(/^[ \w\!#\$%&'\(\)\*\+,\-\.\/\:;<\=>\?@\[\]\^`\{\|\}~\"\\]*$/.test(attribute), 'Bad attribute value (' + attribute + ')');
+
+    return attribute.replace(/\\/g, '\\\\').replace(/\"/g, '\\"');                             // Escape quotes and slash
+};
diff --git a/node_modules/@hapi/hoek/lib/escapeHtml.d.ts b/node_modules/@hapi/hoek/lib/escapeHtml.d.ts
new file mode 100644
index 0000000..5113b98
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeHtml.d.ts
@@ -0,0 +1,3 @@
+import { escapeHtml } from "./index";
+
+export = escapeHtml;
diff --git a/node_modules/@hapi/hoek/lib/escapeHtml.js b/node_modules/@hapi/hoek/lib/escapeHtml.js
new file mode 100755
index 0000000..c2dd443
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeHtml.js
@@ -0,0 +1,87 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (input) {
+
+    if (!input) {
+        return '';
+    }
+
+    let escaped = '';
+
+    for (let i = 0; i < input.length; ++i) {
+
+        const charCode = input.charCodeAt(i);
+
+        if (internals.isSafe(charCode)) {
+            escaped += input[i];
+        }
+        else {
+            escaped += internals.escapeHtmlChar(charCode);
+        }
+    }
+
+    return escaped;
+};
+
+
+internals.escapeHtmlChar = function (charCode) {
+
+    const namedEscape = internals.namedHtml.get(charCode);
+    if (namedEscape) {
+        return namedEscape;
+    }
+
+    if (charCode >= 256) {
+        return '&#' + charCode + ';';
+    }
+
+    const hexValue = charCode.toString(16).padStart(2, '0');
+    return `&#x${hexValue};`;
+};
+
+
+internals.isSafe = function (charCode) {
+
+    return internals.safeCharCodes.has(charCode);
+};
+
+
+internals.namedHtml = new Map([
+    [38, '&amp;'],
+    [60, '&lt;'],
+    [62, '&gt;'],
+    [34, '&quot;'],
+    [160, '&nbsp;'],
+    [162, '&cent;'],
+    [163, '&pound;'],
+    [164, '&curren;'],
+    [169, '&copy;'],
+    [174, '&reg;']
+]);
+
+
+internals.safeCharCodes = (function () {
+
+    const safe = new Set();
+
+    for (let i = 32; i < 123; ++i) {
+
+        if ((i >= 97) ||                    // a-z
+            (i >= 65 && i <= 90) ||         // A-Z
+            (i >= 48 && i <= 57) ||         // 0-9
+            i === 32 ||                     // space
+            i === 46 ||                     // .
+            i === 44 ||                     // ,
+            i === 45 ||                     // -
+            i === 58 ||                     // :
+            i === 95) {                     // _
+
+            safe.add(i);
+        }
+    }
+
+    return safe;
+}());
diff --git a/node_modules/@hapi/hoek/lib/escapeJson.d.ts b/node_modules/@hapi/hoek/lib/escapeJson.d.ts
new file mode 100644
index 0000000..bbbd1e7
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeJson.d.ts
@@ -0,0 +1,3 @@
+import { escapeJson } from "./index";
+
+export = escapeJson;
diff --git a/node_modules/@hapi/hoek/lib/escapeJson.js b/node_modules/@hapi/hoek/lib/escapeJson.js
new file mode 100755
index 0000000..243edfb
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeJson.js
@@ -0,0 +1,28 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (input) {
+
+    if (!input) {
+        return '';
+    }
+
+    return input.replace(/[<>&\u2028\u2029]/g, internals.escape);
+};
+
+
+internals.escape = function (char) {
+
+    return internals.replacements.get(char);
+};
+
+
+internals.replacements = new Map([
+    ['<', '\\u003c'],
+    ['>', '\\u003e'],
+    ['&', '\\u0026'],
+    ['\u2028', '\\u2028'],
+    ['\u2029', '\\u2029']
+]);
diff --git a/node_modules/@hapi/hoek/lib/escapeRegex.d.ts b/node_modules/@hapi/hoek/lib/escapeRegex.d.ts
new file mode 100644
index 0000000..2685ccf
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeRegex.d.ts
@@ -0,0 +1,3 @@
+import { escapeRegex } from "./index";
+
+export = escapeRegex;
diff --git a/node_modules/@hapi/hoek/lib/escapeRegex.js b/node_modules/@hapi/hoek/lib/escapeRegex.js
new file mode 100755
index 0000000..3272497
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/escapeRegex.js
@@ -0,0 +1,11 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (string) {
+
+    // Escape ^$.*+-?=!:|\/()[]{},
+
+    return string.replace(/[\^\$\.\*\+\-\?\=\!\:\|\\\/\(\)\[\]\{\}\,]/g, '\\$&');
+};
diff --git a/node_modules/@hapi/hoek/lib/flatten.d.ts b/node_modules/@hapi/hoek/lib/flatten.d.ts
new file mode 100644
index 0000000..53dc4b6
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/flatten.d.ts
@@ -0,0 +1,3 @@
+import { flatten } from "./index";
+
+export = flatten;
diff --git a/node_modules/@hapi/hoek/lib/flatten.js b/node_modules/@hapi/hoek/lib/flatten.js
new file mode 100755
index 0000000..a5ea622
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/flatten.js
@@ -0,0 +1,20 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = internals.flatten = function (array, target) {
+
+    const result = target || [];
+
+    for (const entry of array) {
+        if (Array.isArray(entry)) {
+            internals.flatten(entry, result);
+        }
+        else {
+            result.push(entry);
+        }
+    }
+
+    return result;
+};
diff --git a/node_modules/@hapi/hoek/lib/ignore.d.ts b/node_modules/@hapi/hoek/lib/ignore.d.ts
new file mode 100644
index 0000000..6112ab6
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/ignore.d.ts
@@ -0,0 +1,3 @@
+import { ignore } from "./index";
+
+export = ignore;
diff --git a/node_modules/@hapi/hoek/lib/ignore.js b/node_modules/@hapi/hoek/lib/ignore.js
new file mode 100755
index 0000000..21ad144
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/ignore.js
@@ -0,0 +1,6 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function () { };
diff --git a/node_modules/@hapi/hoek/lib/index.d.ts b/node_modules/@hapi/hoek/lib/index.d.ts
new file mode 100644
index 0000000..00897c3
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/index.d.ts
@@ -0,0 +1,480 @@
+/// <reference types="node" />
+
+
+/**
+ * Performs a deep comparison of the two values including support for circular dependencies, prototype, and enumerable properties.
+ *
+ * @param obj - The value being compared.
+ * @param ref - The reference value used for comparison.
+ * 
+ * @return true when the two values are equal, otherwise false.
+ */
+export function deepEqual(obj: any, ref: any, options?: deepEqual.Options): boolean;
+
+export namespace deepEqual {
+
+    interface Options {
+
+        /**
+         * Compare functions with difference references by comparing their internal code and properties.
+         *
+         * @default false
+         */
+        readonly deepFunction?: boolean;
+
+        /**
+         * Allow partial match.
+         *
+         * @default false
+         */
+        readonly part?: boolean;
+
+        /**
+         * Compare the objects' prototypes.
+         *
+         * @default true
+         */
+        readonly prototype?: boolean;
+
+        /**
+         * List of object keys to ignore different values of.
+         *
+         * @default null
+         */
+        readonly skip?: (string | symbol)[];
+
+        /**
+         * Compare symbol properties.
+         *
+         * @default true
+         */
+        readonly symbols?: boolean;
+    }
+}
+
+
+/**
+ * Clone any value, object, or array.
+ *
+ * @param obj - The value being cloned.
+ * @param options - Optional settings.
+ *
+ * @returns A deep clone of `obj`.
+ */
+export function clone<T>(obj: T, options?: clone.Options): T;
+
+export namespace clone {
+
+    interface Options {
+
+        /**
+         * Clone the object's prototype.
+         *
+         * @default true
+         */
+        readonly prototype?: boolean;
+
+        /**
+         * Include symbol properties.
+         *
+         * @default true
+         */
+        readonly symbols?: boolean;
+
+        /**
+         * Shallow clone the specified keys.
+         *
+         * @default undefined
+         */
+        readonly shallow?: string[] | string[][] | boolean;
+    }
+}
+
+
+/**
+ * Merge all the properties of source into target.
+ *
+ * @param target - The object being modified.
+ * @param source - The object used to copy properties from.
+ * @param options - Optional settings.
+ *
+ * @returns The `target` object.
+ */
+export function merge<T1 extends object, T2 extends object>(target: T1, source: T2, options?: merge.Options): T1 & T2;
+
+export namespace merge {
+
+    interface Options {
+
+        /**
+         * When true, null value from `source` overrides existing value in `target`.
+         *
+         * @default true
+         */
+        readonly nullOverride?: boolean;
+
+        /**
+         * When true, array value from `source` is merged with the existing value in `target`.
+         *
+         * @default true
+         */
+        readonly mergeArrays?: boolean;
+
+        /**
+         * Compare symbol properties.
+         *
+         * @default undefined
+         */
+        readonly symbols?: boolean;
+    }
+}
+
+
+/**
+ * Apply source to a copy of the defaults.
+ *
+ * @param defaults - An object with the default values to use of `options` does not contain the same keys.
+ * @param source - The source used to override the `defaults`.
+ * @param options - Optional settings.
+ *
+ * @returns A copy of `defaults` with `source` keys overriding any conflicts.
+ */
+export function applyToDefaults<T extends object>(defaults: Partial<T>, source: Partial<T> | boolean | null, options?: applyToDefaults.Options): Partial<T>;
+
+export namespace applyToDefaults {
+
+    interface Options {
+
+        /**
+         * When true, null value from `source` overrides existing value in `target`.
+         *
+         * @default true
+         */
+        readonly nullOverride?: boolean;
+
+        /**
+         * Shallow clone the specified keys.
+         *
+         * @default undefined
+         */
+        readonly shallow?: string[] | string[][];
+    }
+}
+
+
+/**
+ * Find the common unique items in two arrays.
+ *
+ * @param array1 - The first array to compare.
+ * @param array2 - The second array to compare.
+ * @param options - Optional settings.
+ *
+ * @return - An array of the common items. If `justFirst` is true, returns the first common item.
+ */
+export function intersect<T1, T2>(array1: intersect.Array<T1>, array2: intersect.Array<T2>, options?: intersect.Options): Array<T1 | T2>;
+export function intersect<T1, T2>(array1: intersect.Array<T1>, array2: intersect.Array<T2>, options?: intersect.Options): T1 | T2;
+
+export namespace intersect {
+
+    type Array<T> = ArrayLike<T> | Set<T> | null;
+
+    interface Options {
+
+        /**
+         * When true, return the first overlapping value.
+         *
+         * @default false
+         */
+        readonly first?: boolean;
+    }
+}
+
+
+/**
+ * Checks if the reference value contains the provided values.
+ *
+ * @param ref - The reference string, array, or object.
+ * @param values - A single or array of values to find within `ref`. If `ref` is an object, `values` can be a key name, an array of key names, or an object with key-value pairs to compare.
+ *
+ * @return true if the value contains the provided values, otherwise false.
+ */
+export function contain(ref: string, values: string | string[], options?: contain.Options): boolean;
+export function contain(ref: any[], values: any, options?: contain.Options): boolean;
+export function contain(ref: object, values: string | string[] | object, options?: Omit<contain.Options, 'once'>): boolean;
+
+export namespace contain {
+
+    interface Options {
+
+        /**
+         * Perform a deep comparison.
+         *
+         * @default false
+         */
+        readonly deep?: boolean;
+
+        /**
+         * Allow only one occurrence of each value.
+         *
+         * @default false
+         */
+        readonly once?: boolean;
+
+        /**
+         * Allow only values explicitly listed.
+         *
+         * @default false
+         */
+        readonly only?: boolean;
+
+        /**
+         * Allow partial match.
+         *
+         * @default false
+         */
+        readonly part?: boolean;
+
+        /**
+         * Include symbol properties.
+         *
+         * @default true
+         */
+        readonly symbols?: boolean;
+    }
+}
+
+
+/**
+ * Flatten an array with sub arrays
+ *
+ * @param array - an array of items or other arrays to flatten.
+ * @param target - if provided, an array to shallow copy the flattened `array` items to
+ *
+ * @return a flat array of the provided values (appended to `target` is provided).
+ */
+export function flatten<T>(array: ArrayLike<T | ReadonlyArray<T>>, target?: ArrayLike<T | ReadonlyArray<T>>): T[];
+
+
+/**
+ * Convert an object key chain string to reference.
+ *
+ * @param obj - the object from which to look up the value.
+ * @param chain - the string path of the requested value. The chain string is split into key names using `options.separator`, or an array containing each individual key name. A chain including negative numbers will work like a negative index on an array.
+ *
+ * @return The value referenced by the chain if found, otherwise undefined. If chain is null, undefined, or false, the object itself will be returned.
+ */
+export function reach(obj: object | null, chain: string | (string | number)[] | false | null | undefined, options?: reach.Options): any;
+
+export namespace reach {
+
+    interface Options {
+
+        /**
+         * String to split chain path on. Defaults to '.'.
+         *
+         * @default false
+         */
+        readonly separator?: string;
+
+        /**
+         * Value to return if the path or value is not present. No default value.
+         *
+         * @default false
+         */
+        readonly default?: any;
+
+        /**
+         * If true, will throw an error on missing member in the chain. Default to false.
+         *
+         * @default false
+         */
+        readonly strict?: boolean;
+
+        /**
+         * If true, allows traversing functions for properties. false will throw an error if a function is part of the chain.
+         *
+         * @default true
+         */
+        readonly functions?: boolean;
+
+        /**
+         * If true, allows traversing Set and Map objects for properties. false will return undefined regardless of the Set or Map passed.
+         *
+         * @default false
+         */
+        readonly iterables?: boolean;
+    }
+}
+
+
+/**
+ * Replace string parameters (using format "{path.to.key}") with their corresponding object key values using `Hoek.reach()`.
+ *
+ * @param obj - the object from which to look up the value.
+ * @param template - the string containing {} enclosed key paths to be replaced.
+ *
+ * @return The template string with the {} enclosed keys replaced with looked-up values.
+ */
+export function reachTemplate(obj: object | null, template: string, options?: reach.Options): string;
+
+
+/**
+ * Throw an error if condition is falsy.
+ *
+ * @param condition - If `condition` is not truthy, an exception is thrown.
+ * @param error - The error thrown if the condition fails.
+ *
+ * @return Does not return a value but throws if the `condition` is falsy.
+ */
+export function assert(condition: any, error: Error): asserts condition;
+
+
+/**
+ * Throw an error if condition is falsy.
+ *
+ * @param condition - If `condition` is not truthy, an exception is thrown.
+ * @param args - Any number of values, concatenated together (space separated) to create the error message.
+ *
+ * @return Does not return a value but throws if the `condition` is falsy.
+ */
+export function assert(condition: any, ...args: any): asserts condition;
+
+
+/**
+ * Assertion Error as thrown from Hoek.assert().
+ */
+export class AssertError extends Error {
+
+    name: 'AssertError';
+}
+
+
+/**
+ * A benchmarking timer, using the internal node clock for maximum accuracy.
+ */
+export class Bench {
+
+    constructor();
+
+    /** The starting timestamp expressed in the number of milliseconds since the epoch. */
+    ts: number;
+
+    /** The time in milliseconds since the object was created. */
+    elapsed(): number;
+
+    /** Reset the `ts` value to now. */
+    reset(): void;
+
+    /** The current time in milliseconds since the epoch. */
+    static now(): number;
+}
+
+
+/**
+ * Escape string for Regex construction by prefixing all reserved characters with a backslash.
+ *
+ * @param string - The string to be escaped.
+ *
+ * @return The escaped string.
+ */
+export function escapeRegex(string: string): string;
+
+
+/**
+ * Escape string for usage as an attribute value in HTTP headers.
+ *
+ * @param attribute - The string to be escaped.
+ *
+ * @return The escaped string. Will throw on invalid characters that are not supported to be escaped.
+ */
+export function escapeHeaderAttribute(attribute: string): string;
+
+
+/**
+ * Escape string for usage in HTML.
+ *
+ * @param string - The string to be escaped.
+ *
+ * @return The escaped string.
+ */
+export function escapeHtml(string: string): string;
+
+
+/**
+ * Escape string for usage in JSON.
+ *
+ * @param string - The string to be escaped.
+ *
+ * @return The escaped string.
+ */
+export function escapeJson(string: string): string;
+
+
+/**
+ * Wraps a function to ensure it can only execute once.
+ *
+ * @param method - The function to be wrapped.
+ *
+ * @return The wrapped function.
+ */
+export function once<T extends Function>(method: T): T;
+
+
+/**
+ * A reusable no-op function.
+ */
+export function ignore(...ignore: any): void;
+
+
+/**
+ * Converts a JavaScript value to a JavaScript Object Notation (JSON) string with protection against thrown errors.
+ *
+ * @param value A JavaScript value, usually an object or array, to be converted.
+ * @param replacer The JSON.stringify() `replacer` argument.
+ * @param space Adds indentation, white space, and line break characters to the return-value JSON text to make it easier to read.
+ *
+ * @return The JSON string. If the operation fails, an error string value is returned (no exception thrown).
+ */
+export function stringify(value: any, replacer?: any, space?: string | number): string;
+
+
+/**
+ * Returns a Promise that resolves after the requested timeout.
+ *
+ * @param timeout - The number of milliseconds to wait before resolving the Promise.
+ * @param returnValue - The value that the Promise will resolve to.
+ *
+ * @return A Promise that resolves with `returnValue`.
+ */
+export function wait<T>(timeout?: number, returnValue?: T): Promise<T>;
+
+
+/**
+ * Returns a Promise that never resolves.
+ */
+export function block(): Promise<void>;
+
+
+/**
+ * Determines if an object is a promise.
+ * 
+ * @param promise - the object tested.
+ * 
+ * @returns true if the object is a promise, otherwise false.
+ */
+export function isPromise(promise: any): boolean;
+
+
+export namespace ts {
+
+    /**
+     * Defines a type that can must be one of T or U but not both.
+     */
+    type XOR<T, U> = (T | U) extends object ? (internals.Without<T, U> & U) | (internals.Without<U, T> & T) : T | U;
+}
+
+
+declare namespace internals {
+
+    type Without<T, U> = { [P in Exclude<keyof T, keyof U>]?: never };
+}
diff --git a/node_modules/@hapi/hoek/lib/index.js b/node_modules/@hapi/hoek/lib/index.js
new file mode 100755
index 0000000..7b4a122
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/index.js
@@ -0,0 +1,45 @@
+'use strict';
+
+exports.applyToDefaults = require('./applyToDefaults');
+
+exports.assert = require('./assert');
+
+exports.AssertError = require('./assertError');
+
+exports.Bench = require('./bench');
+
+exports.block = require('./block');
+
+exports.clone = require('./clone');
+
+exports.contain = require('./contain');
+
+exports.deepEqual = require('./deepEqual');
+
+exports.escapeHeaderAttribute = require('./escapeHeaderAttribute');
+
+exports.escapeHtml = require('./escapeHtml');
+
+exports.escapeJson = require('./escapeJson');
+
+exports.escapeRegex = require('./escapeRegex');
+
+exports.flatten = require('./flatten');
+
+exports.ignore = require('./ignore');
+
+exports.intersect = require('./intersect');
+
+exports.isPromise = require('./isPromise');
+
+exports.merge = require('./merge');
+
+exports.once = require('./once');
+
+exports.reach = require('./reach');
+
+exports.reachTemplate = require('./reachTemplate');
+
+exports.stringify = require('./stringify');
+
+exports.wait = require('./wait');
diff --git a/node_modules/@hapi/hoek/lib/index.mjs b/node_modules/@hapi/hoek/lib/index.mjs
new file mode 100755
index 0000000..7205b2a
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/index.mjs
@@ -0,0 +1,43 @@
+export { default as applyToDefaults } from './applyToDefaults.js';
+
+export { default as assert } from './assert.js';
+
+export { default as Bench } from './bench.js';
+
+export { default as block } from './block.js';
+
+export { default as clone } from './clone.js';
+
+export { default as contain } from './contain.js';
+
+export { default as deepEqual } from './deepEqual.js';
+
+export { default as AssertError } from './assertError.js';
+
+export { default as escapeHeaderAttribute } from './escapeHeaderAttribute.js';
+
+export { default as escapeHtml } from './escapeHtml.js';
+
+export { default as escapeJson } from './escapeJson.js';
+
+export { default as escapeRegex } from './escapeRegex.js';
+
+export { default as flatten } from './flatten.js';
+
+export { default as ignore } from './ignore.js';
+
+export { default as intersect } from './intersect.js';
+
+export { default as isPromise } from './isPromise.js';
+
+export { default as merge } from './merge.js';
+
+export { default as once } from './once.js';
+
+export { default as reach } from './reach.js';
+
+export { default as reachTemplate } from './reachTemplate.js';
+
+export { default as stringify } from './stringify.js';
+
+export { default as wait } from './wait.js';
diff --git a/node_modules/@hapi/hoek/lib/intersect.d.ts b/node_modules/@hapi/hoek/lib/intersect.d.ts
new file mode 100644
index 0000000..eeb8fd1
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/intersect.d.ts
@@ -0,0 +1,3 @@
+import { intersect } from "./index";
+
+export = intersect;
diff --git a/node_modules/@hapi/hoek/lib/intersect.js b/node_modules/@hapi/hoek/lib/intersect.js
new file mode 100755
index 0000000..59e6aaf
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/intersect.js
@@ -0,0 +1,41 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (array1, array2, options = {}) {
+
+    if (!array1 ||
+        !array2) {
+
+        return (options.first ? null : []);
+    }
+
+    const common = [];
+    const hash = (Array.isArray(array1) ? new Set(array1) : array1);
+    const found = new Set();
+    for (const value of array2) {
+        if (internals.has(hash, value) &&
+            !found.has(value)) {
+
+            if (options.first) {
+                return value;
+            }
+
+            common.push(value);
+            found.add(value);
+        }
+    }
+
+    return (options.first ? null : common);
+};
+
+
+internals.has = function (ref, key) {
+
+    if (typeof ref.has === 'function') {
+        return ref.has(key);
+    }
+
+    return ref[key] !== undefined;
+};
diff --git a/node_modules/@hapi/hoek/lib/isPromise.d.ts b/node_modules/@hapi/hoek/lib/isPromise.d.ts
new file mode 100644
index 0000000..e5108fc
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/isPromise.d.ts
@@ -0,0 +1,3 @@
+import { isPromise } from "./index";
+
+export = isPromise;
diff --git a/node_modules/@hapi/hoek/lib/isPromise.js b/node_modules/@hapi/hoek/lib/isPromise.js
new file mode 100755
index 0000000..bb7768d
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/isPromise.js
@@ -0,0 +1,9 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (promise) {
+
+    return typeof promise?.then === 'function';
+};
diff --git a/node_modules/@hapi/hoek/lib/merge.d.ts b/node_modules/@hapi/hoek/lib/merge.d.ts
new file mode 100644
index 0000000..eef7872
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/merge.d.ts
@@ -0,0 +1,3 @@
+import { merge } from "./index";
+
+export = merge;
diff --git a/node_modules/@hapi/hoek/lib/merge.js b/node_modules/@hapi/hoek/lib/merge.js
new file mode 100755
index 0000000..47a1e1e
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/merge.js
@@ -0,0 +1,78 @@
+'use strict';
+
+const Assert = require('./assert');
+const Clone = require('./clone');
+const Utils = require('./utils');
+
+
+const internals = {};
+
+
+module.exports = internals.merge = function (target, source, options) {
+
+    Assert(target && typeof target === 'object', 'Invalid target value: must be an object');
+    Assert(source === null || source === undefined || typeof source === 'object', 'Invalid source value: must be null, undefined, or an object');
+
+    if (!source) {
+        return target;
+    }
+
+    options = Object.assign({ nullOverride: true, mergeArrays: true }, options);
+
+    if (Array.isArray(source)) {
+        Assert(Array.isArray(target), 'Cannot merge array onto an object');
+        if (!options.mergeArrays) {
+            target.length = 0;                                                          // Must not change target assignment
+        }
+
+        for (let i = 0; i < source.length; ++i) {
+            target.push(Clone(source[i], { symbols: options.symbols }));
+        }
+
+        return target;
+    }
+
+    const keys = Utils.keys(source, options);
+    for (let i = 0; i < keys.length; ++i) {
+        const key = keys[i];
+        if (key === '__proto__' ||
+            !Object.prototype.propertyIsEnumerable.call(source, key)) {
+
+            continue;
+        }
+
+        const value = source[key];
+        if (value &&
+            typeof value === 'object') {
+
+            if (target[key] === value) {
+                continue;                                           // Can occur for shallow merges
+            }
+
+            if (!target[key] ||
+                typeof target[key] !== 'object' ||
+                (Array.isArray(target[key]) !== Array.isArray(value)) ||
+                value instanceof Date ||
+                (Buffer && Buffer.isBuffer(value)) ||               // $lab:coverage:ignore$
+                value instanceof RegExp) {
+
+                target[key] = Clone(value, { symbols: options.symbols });
+            }
+            else {
+                internals.merge(target[key], value, options);
+            }
+        }
+        else {
+            if (value !== null &&
+                value !== undefined) {                              // Explicit to preserve empty strings
+
+                target[key] = value;
+            }
+            else if (options.nullOverride) {
+                target[key] = value;
+            }
+        }
+    }
+
+    return target;
+};
diff --git a/node_modules/@hapi/hoek/lib/once.d.ts b/node_modules/@hapi/hoek/lib/once.d.ts
new file mode 100644
index 0000000..8c5be14
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/once.d.ts
@@ -0,0 +1,3 @@
+import { once } from "./index";
+
+export = once;
diff --git a/node_modules/@hapi/hoek/lib/once.js b/node_modules/@hapi/hoek/lib/once.js
new file mode 100755
index 0000000..c825767
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/once.js
@@ -0,0 +1,25 @@
+'use strict';
+
+const internals = {
+    wrapped: Symbol('wrapped')
+};
+
+
+module.exports = function (method) {
+
+    if (method[internals.wrapped]) {
+        return method;
+    }
+
+    let once = false;
+    const wrappedFn = function (...args) {
+
+        if (!once) {
+            once = true;
+            method(...args);
+        }
+    };
+
+    wrappedFn[internals.wrapped] = true;
+    return wrappedFn;
+};
diff --git a/node_modules/@hapi/hoek/lib/reach.d.ts b/node_modules/@hapi/hoek/lib/reach.d.ts
new file mode 100644
index 0000000..e656c93
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/reach.d.ts
@@ -0,0 +1,3 @@
+import { reach } from "./index";
+
+export = reach;
diff --git a/node_modules/@hapi/hoek/lib/reach.js b/node_modules/@hapi/hoek/lib/reach.js
new file mode 100755
index 0000000..53b7c24
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/reach.js
@@ -0,0 +1,76 @@
+'use strict';
+
+const Assert = require('./assert');
+
+
+const internals = {};
+
+
+module.exports = function (obj, chain, options) {
+
+    if (chain === false ||
+        chain === null ||
+        chain === undefined) {
+
+        return obj;
+    }
+
+    options = options || {};
+    if (typeof options === 'string') {
+        options = { separator: options };
+    }
+
+    const isChainArray = Array.isArray(chain);
+
+    Assert(!isChainArray || !options.separator, 'Separator option is not valid for array-based chain');
+
+    const path = isChainArray ? chain : chain.split(options.separator || '.');
+    let ref = obj;
+    for (let i = 0; i < path.length; ++i) {
+        let key = path[i];
+        const type = options.iterables && internals.iterables(ref);
+
+        if (Array.isArray(ref) ||
+            type === 'set') {
+
+            const number = Number(key);
+            if (Number.isInteger(number)) {
+                key = number < 0 ? ref.length + number : number;
+            }
+        }
+
+        if (!ref ||
+            typeof ref === 'function' && options.functions === false ||         // Defaults to true
+            !type && ref[key] === undefined) {
+
+            Assert(!options.strict || i + 1 === path.length, 'Missing segment', key, 'in reach path ', chain);
+            Assert(typeof ref === 'object' || options.functions === true || typeof ref !== 'function', 'Invalid segment', key, 'in reach path ', chain);
+            ref = options.default;
+            break;
+        }
+
+        if (!type) {
+            ref = ref[key];
+        }
+        else if (type === 'set') {
+            ref = [...ref][key];
+        }
+        else {  // type === 'map'
+            ref = ref.get(key);
+        }
+    }
+
+    return ref;
+};
+
+
+internals.iterables = function (ref) {
+
+    if (ref instanceof Set) {
+        return 'set';
+    }
+
+    if (ref instanceof Map) {
+        return 'map';
+    }
+};
diff --git a/node_modules/@hapi/hoek/lib/reachTemplate.d.ts b/node_modules/@hapi/hoek/lib/reachTemplate.d.ts
new file mode 100644
index 0000000..84066c3
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/reachTemplate.d.ts
@@ -0,0 +1,3 @@
+import { reachTemplate } from "./index";
+
+export = reachTemplate;
diff --git a/node_modules/@hapi/hoek/lib/reachTemplate.js b/node_modules/@hapi/hoek/lib/reachTemplate.js
new file mode 100755
index 0000000..4ba304c
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/reachTemplate.js
@@ -0,0 +1,16 @@
+'use strict';
+
+const Reach = require('./reach');
+
+
+const internals = {};
+
+
+module.exports = function (obj, template, options) {
+
+    return template.replace(/{([^{}]+)}/g, ($0, chain) => {
+
+        const value = Reach(obj, chain, options);
+        return value ?? '';
+    });
+};
diff --git a/node_modules/@hapi/hoek/lib/stringify.d.ts b/node_modules/@hapi/hoek/lib/stringify.d.ts
new file mode 100644
index 0000000..ecfaffa
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/stringify.d.ts
@@ -0,0 +1,3 @@
+import { stringify } from "./index";
+
+export = stringify;
diff --git a/node_modules/@hapi/hoek/lib/stringify.js b/node_modules/@hapi/hoek/lib/stringify.js
new file mode 100755
index 0000000..82152cf
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/stringify.js
@@ -0,0 +1,14 @@
+'use strict';
+
+const internals = {};
+
+
+module.exports = function (...args) {
+
+    try {
+        return JSON.stringify(...args);
+    }
+    catch (err) {
+        return '[Cannot display object: ' + err.message + ']';
+    }
+};
diff --git a/node_modules/@hapi/hoek/lib/types.js b/node_modules/@hapi/hoek/lib/types.js
new file mode 100755
index 0000000..056049f
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/types.js
@@ -0,0 +1,57 @@
+'use strict';
+
+const internals = {};
+
+
+exports = module.exports = {
+    array: Array.prototype,
+    buffer: Buffer && Buffer.prototype,             // $lab:coverage:ignore$
+    date: Date.prototype,
+    error: Error.prototype,
+    generic: Object.prototype,
+    map: Map.prototype,
+    promise: Promise.prototype,
+    regex: RegExp.prototype,
+    set: Set.prototype,
+    url: URL.prototype,
+    weakMap: WeakMap.prototype,
+    weakSet: WeakSet.prototype
+};
+
+
+internals.typeMap = new Map([
+    ['[object Error]', exports.error],
+    ['[object Map]', exports.map],
+    ['[object Promise]', exports.promise],
+    ['[object Set]', exports.set],
+    ['[object URL]', exports.url],
+    ['[object WeakMap]', exports.weakMap],
+    ['[object WeakSet]', exports.weakSet]
+]);
+
+
+exports.getInternalProto = function (obj) {
+
+    if (Array.isArray(obj)) {
+        return exports.array;
+    }
+
+    if (Buffer && obj instanceof Buffer) {          // $lab:coverage:ignore$
+        return exports.buffer;
+    }
+
+    if (obj instanceof Date) {
+        return exports.date;
+    }
+
+    if (obj instanceof RegExp) {
+        return exports.regex;
+    }
+
+    if (obj instanceof Error) {
+        return exports.error;
+    }
+
+    const objName = Object.prototype.toString.call(obj);
+    return internals.typeMap.get(objName) || exports.generic;
+};
diff --git a/node_modules/@hapi/hoek/lib/utils.js b/node_modules/@hapi/hoek/lib/utils.js
new file mode 100755
index 0000000..bab1e8c
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/utils.js
@@ -0,0 +1,9 @@
+'use strict';
+
+const internals = {};
+
+
+exports.keys = function (obj, options = {}) {
+
+    return options.symbols !== false ? Reflect.ownKeys(obj) : Object.getOwnPropertyNames(obj);  // Defaults to true
+};
diff --git a/node_modules/@hapi/hoek/lib/wait.d.ts b/node_modules/@hapi/hoek/lib/wait.d.ts
new file mode 100644
index 0000000..be8e73f
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/wait.d.ts
@@ -0,0 +1,3 @@
+import { wait } from "./index";
+
+export = wait;
diff --git a/node_modules/@hapi/hoek/lib/wait.js b/node_modules/@hapi/hoek/lib/wait.js
new file mode 100755
index 0000000..28d344c
--- /dev/null
+++ b/node_modules/@hapi/hoek/lib/wait.js
@@ -0,0 +1,37 @@
+'use strict';
+
+const internals = {
+    maxTimer: 2 ** 31 - 1              // ~25 days
+};
+
+
+module.exports = function (timeout, returnValue, options) {
+
+    if (typeof timeout === 'bigint') {
+        timeout = Number(timeout);
+    }
+
+    if (timeout >= Number.MAX_SAFE_INTEGER) {         // Thousands of years
+        timeout = Infinity;
+    }
+
+    if (typeof timeout !== 'number' && timeout !== undefined) {
+        throw new TypeError('Timeout must be a number or bigint');
+    }
+
+    return new Promise((resolve) => {
+
+        const _setTimeout = options ? options.setTimeout : setTimeout;
+
+        const activate = () => {
+
+            const time = Math.min(timeout, internals.maxTimer);
+            timeout -= time;
+            _setTimeout(() => (timeout > 0 ? activate() : resolve(returnValue)), time);
+        };
+
+        if (timeout !== Infinity) {
+            activate();
+        }
+    });
+};
diff --git a/node_modules/@hapi/hoek/package.json b/node_modules/@hapi/hoek/package.json
new file mode 100755
index 0000000..55ae228
--- /dev/null
+++ b/node_modules/@hapi/hoek/package.json
@@ -0,0 +1,60 @@
+{
+  "name": "@hapi/hoek",
+  "description": "General purpose node utilities",
+  "version": "11.0.7",
+  "repository": "git://github.com/hapijs/hoek",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./lib/index.mjs",
+      "require": "./lib/index.js",
+      "types": "./lib/index.d.ts"
+    },
+    "./applyToDefaults": "./lib/applyToDefaults.js",
+    "./assert": "./lib/assert.js",
+    "./assertError": "./lib/assertError.js",
+    "./bench": "./lib/bench.js",
+    "./block": "./lib/block.js",
+    "./clone": "./lib/clone.js",
+    "./contain": "./lib/contain.js",
+    "./deepEqual": "./lib/deepEqual.js",
+    "./escapeHeaderAttribute": "./lib/escapeHeaderAttribute.js",
+    "./escapeHtml": "./lib/escapeHtml.js",
+    "./escapeJson": "./lib/escapeJson.js",
+    "./escapeRegex": "./lib/escapeRegex.js",
+    "./flatten": "./lib/flatten.js",
+    "./ignore": "./lib/ignore.js",
+    "./intersect": "./lib/intersect.js",
+    "./isPromise": "./lib/isPromise.js",
+    "./merge": "./lib/merge.js",
+    "./once": "./lib/once.js",
+    "./reach": "./lib/reach.js",
+    "./reachTemplate": "./lib/reachTemplate.js",
+    "./stringify": "./lib/stringify.js",
+    "./wait": "./lib/wait.js"
+  },
+  "keywords": [
+    "utilities"
+  ],
+  "files": [
+    "lib"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.0.1",
+    "@types/node": "^17.0.30",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/iron/LICENSE.md b/node_modules/@hapi/iron/LICENSE.md
new file mode 100755
index 0000000..34c247e
--- /dev/null
+++ b/node_modules/@hapi/iron/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/iron/README.md b/node_modules/@hapi/iron/README.md
new file mode 100755
index 0000000..eb8bc23
--- /dev/null
+++ b/node_modules/@hapi/iron/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/iron
+
+#### Encapsulated tokens (encrypted and mac'ed objects).
+
+**iron** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/iron/)
+- [Versions status](https://hapi.dev/resources/status/#iron) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/iron/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/iron/lib/index.d.ts b/node_modules/@hapi/iron/lib/index.d.ts
new file mode 100755
index 0000000..5decba5
--- /dev/null
+++ b/node_modules/@hapi/iron/lib/index.d.ts
@@ -0,0 +1,236 @@
+/**
+Configuration options for built-in algorithms.
+*/
+export interface Algorithms {
+    'aes-128-ctr': {
+        keyBits: number;
+        ivBits: number;
+    };
+
+    'aes-256-cbc': {
+        keyBits: number;
+        ivBits: number;
+    };
+
+    'sha256': {
+        keyBits: number;
+    };
+}
+
+
+/**
+seal() method options.
+*/
+export interface SealOptionsSub {
+
+    /**
+    The length of the salt (random buffer used to ensure that two identical objects will generate a different encrypted result). Defaults to 256.
+    */
+    saltBits: number;
+
+    /**
+    The algorithm used. Defaults to 'aes-256-cbc' for encryption and 'sha256' for integrity.
+    */
+    algorithm: keyof Algorithms;
+
+    /**
+    The number of iterations used to derive a key from the password. Defaults to 1.
+    */
+    iterations: number;
+
+    /**
+    Minimum password size. Defaults to 32.
+    */
+    minPasswordlength: number;
+}
+
+
+/**
+generateKey() method options.
+*/
+export interface GenerateKeyOptions extends Pick<SealOptionsSub, 'algorithm' | 'iterations' | 'minPasswordlength'> {
+
+    saltBits?: number;
+    salt?: string;
+    iv?: Buffer;
+}
+
+
+/**
+Options for customizing the key derivation algorithm used to generate encryption and integrity verification keys as well as the algorithms and salt sizes used.
+*/
+export interface SealOptions {
+
+    /**
+    Encryption step options.
+    */
+    encryption: SealOptionsSub;
+
+    /**
+    Integrity step options.
+    */
+    integrity: SealOptionsSub;
+
+    /**
+    Sealed object lifetime in milliseconds where 0 means forever. Defaults to 0.
+     */
+    ttl: number;
+
+    /**
+    Number of seconds of permitted clock skew for incoming expirations. Defaults to 60 seconds.
+    */
+    timestampSkewSec: number;
+
+    /**
+    Local clock time offset, expressed in number of milliseconds (positive or negative). Defaults to 0.
+    */
+    localtimeOffsetMsec: number;
+}
+
+
+/**
+Generated internal key object.
+*/
+export interface Key {
+    key: Buffer;
+    salt: string;
+    iv: Buffer;
+}
+
+
+/**
+Generated HMAC internal results.
+*/
+export interface HMacResult {
+    digest: string;
+    salt: string;
+}
+
+
+/**
+Password secret string or buffer.
+*/
+type Password = string | Buffer
+
+
+declare namespace password {
+
+    /**
+    Secret object with optional id.
+    */
+    interface Secret {
+        id?: string,
+        secret: Password
+    }
+
+    /**
+    Secret object with optional id and specified password for each encryption and integrity.
+    */
+    interface Specific {
+        id?: string,
+        encryption: Password,
+        integrity: Password
+    }
+
+    /**
+    Key-value pairs hash of password id to value
+    */
+    interface Hash {
+        [id: string]: Password | Secret | Specific;
+    }
+}
+
+
+/**
+The default encryption and integrity settings.
+*/
+export const defaults: SealOptions;
+
+
+/**
+Configuration of each supported algorithm. 
+*/
+export const algorithms: Algorithms;
+
+
+/**
+MAC normalization format version.
+*/
+export const macFormatVersion: string;
+
+
+/**
+MAC normalization prefix.
+*/
+export const macPrefix: string;
+
+
+/**
+Generates a key from the password
+
+@param password - A password string or buffer key
+@param options - Object used to customize the key derivation algorithm
+
+@returns An object with keys: key, salt, iv
+*/
+export function generateKey(password: Password, options: GenerateKeyOptions): Promise<Key>
+
+
+/**
+Encrypt data
+
+@param password - A password string or buffer key
+@param options - Object used to customize the key derivation algorithm
+@param data - String to encrypt
+
+@returns an object with the following keys: encrypted, key
+*/
+export function encrypt(password: Password, options: GenerateKeyOptions, data: string): Promise<{ encrypted: Buffer, key: Key }>
+
+
+/**
+Decrypt data
+
+@param password - A password string or buffer key
+@param options - Object used to customize the key derivation algorithm
+@param data - String to decrypt
+
+@returns the decrypted string
+*/
+export function decrypt(password: Password, options: GenerateKeyOptions, data: string): Promise<string>
+
+
+/**
+Calculates a HMAC digest
+
+@param password - A password string or buffer key
+@param options - Object used to customize the key derivation algorithm
+@param data - String to calculate the HMAC over
+
+@returns An object with the following keys: digest, salt
+*/
+export function hmacWithPassword(password: Password, options: GenerateKeyOptions, data: string): Promise<HMacResult>
+
+
+/**
+Serializes, encrypts, and signs objects into an iron protocol string
+
+@param object - Data being sealed
+@param password - A string, buffer, or object
+@param options - Object used to customize the key derivation algorithm
+
+@returns Iron sealed string
+*/
+export function seal(object: any, password: Password | password.Secret | password.Specific, options: SealOptions): Promise<string>
+
+
+/**
+Verifies, decrypts, and reconstruct an iron protocol string into an object
+
+@param sealed - The iron protocol string generated with seal()
+@param password - A string, buffer, or object
+@param options - Object used to customize the key derivation algorithm
+
+@returns the verified decrypted object
+*/
+export function unseal(sealed: string, password: Password | password.Hash, options?: SealOptions): Promise<any>
diff --git a/node_modules/@hapi/iron/lib/index.js b/node_modules/@hapi/iron/lib/index.js
new file mode 100755
index 0000000..328888d
--- /dev/null
+++ b/node_modules/@hapi/iron/lib/index.js
@@ -0,0 +1,373 @@
+'use strict';
+
+const Crypto = require('crypto');
+
+const B64 = require('@hapi/b64');
+const Boom = require('@hapi/boom');
+const Bourne = require('@hapi/bourne');
+const Cryptiles = require('@hapi/cryptiles');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports.defaults = {
+    encryption: {
+        saltBits: 256,
+        algorithm: 'aes-256-cbc',
+        iterations: 1,
+        minPasswordlength: 32
+    },
+
+    integrity: {
+        saltBits: 256,
+        algorithm: 'sha256',
+        iterations: 1,
+        minPasswordlength: 32
+    },
+
+    ttl: 0,                                             // Milliseconds, 0 means forever
+    timestampSkewSec: 60,                               // Seconds of permitted clock skew for incoming expirations
+    localtimeOffsetMsec: 0                              // Local clock time offset express in a number of milliseconds (positive or negative)
+};
+
+
+// Algorithm configuration
+
+exports.algorithms = {
+    'aes-128-ctr': { keyBits: 128, ivBits: 128 },
+    'aes-256-cbc': { keyBits: 256, ivBits: 128 },
+    'sha256': { keyBits: 256 }
+};
+
+
+// MAC normalization format version
+
+exports.macFormatVersion = '2';                         // Prevent comparison of mac values generated with different normalized string formats
+
+exports.macPrefix = 'Fe26.' + exports.macFormatVersion;
+
+
+// Generate a unique encryption key
+
+/*
+    const options =  {
+        saltBits: 256,                                  // Ignored if salt is set
+        salt: '4d8nr9q384nr9q384nr93q8nruq9348run',
+        algorithm: 'aes-128-ctr',
+        iterations: 10000,
+        iv: 'sdfsdfsdfsdfscdrgercgesrcgsercg',          // Optional
+        minPasswordlength: 32
+    };
+*/
+
+exports.generateKey = async function (password, options) {
+
+    if (!password) {
+        throw new Boom.Boom('Empty password');
+    }
+
+    if (!options ||
+        typeof options !== 'object') {
+
+        throw new Boom.Boom('Bad options');
+    }
+
+    const algorithm = exports.algorithms[options.algorithm];
+    if (!algorithm) {
+        throw new Boom.Boom('Unknown algorithm: ' + options.algorithm);
+    }
+
+    const result = {};
+
+    if (Buffer.isBuffer(password)) {
+        if (password.length < algorithm.keyBits / 8) {
+            throw new Boom.Boom('Key buffer (password) too small');
+        }
+
+        result.key = password;
+        result.salt = '';
+    }
+    else {
+        if (password.length < options.minPasswordlength) {
+            throw new Boom.Boom('Password string too short (min ' + options.minPasswordlength + ' characters required)');
+        }
+
+        let salt = options.salt;
+        if (!salt) {
+            if (!options.saltBits) {
+                throw new Boom.Boom('Missing salt and saltBits options');
+            }
+
+            const randomSalt = Cryptiles.randomBits(options.saltBits);
+            salt = randomSalt.toString('hex');
+        }
+
+        const derivedKey = await internals.pbkdf2(password, salt, options.iterations, algorithm.keyBits / 8, 'sha1');
+
+        result.key = derivedKey;
+        result.salt = salt;
+    }
+
+    if (options.iv) {
+        result.iv = options.iv;
+    }
+    else if (algorithm.ivBits) {
+        result.iv = Cryptiles.randomBits(algorithm.ivBits);
+    }
+
+    return result;
+};
+
+
+// Encrypt data
+// options: see exports.generateKey()
+
+exports.encrypt = async function (password, options, data) {
+
+    const key = await exports.generateKey(password, options);
+    const cipher = Crypto.createCipheriv(options.algorithm, key.key, key.iv);
+    const encrypted = Buffer.concat([cipher.update(data, 'utf8'), cipher.final()]);
+
+    return { encrypted, key };
+};
+
+
+// Decrypt data
+// options: see exports.generateKey()
+
+exports.decrypt = async function (password, options, data) {
+
+    const key = await exports.generateKey(password, options);
+    const decipher = Crypto.createDecipheriv(options.algorithm, key.key, key.iv);
+    let dec = decipher.update(data, null, 'utf8');
+    dec = dec + decipher.final('utf8');
+
+    return dec;
+};
+
+
+// HMAC using a password
+// options: see exports.generateKey()
+
+exports.hmacWithPassword = async function (password, options, data) {
+
+    const key = await exports.generateKey(password, options);
+    const hmac = Crypto.createHmac(options.algorithm, key.key).update(data);
+    const digest = hmac.digest('base64').replace(/\+/g, '-').replace(/\//g, '_').replace(/\=/g, '');
+
+    return {
+        digest,
+        salt: key.salt
+    };
+};
+
+
+// Normalizes a password parameter into a { id, encryption, integrity } object
+// password: string, buffer or object with { id, secret } or { id, encryption, integrity }
+
+internals.normalizePassword = function (password) {
+
+    if (password &&
+        typeof password === 'object' &&
+        !Buffer.isBuffer(password)) {
+
+        return {
+            id: password.id,
+            encryption: password.secret ?? password.encryption,
+            integrity: password.secret ?? password.integrity
+        };
+    }
+
+    return {
+        encryption: password,
+        integrity: password
+    };
+};
+
+
+// Encrypt and HMAC an object
+// password: string, buffer or object with { id, secret } or { id, encryption, integrity }
+// options: see exports.defaults
+
+exports.seal = async function (object, password, options) {
+
+    options = Object.assign({}, options);       // Shallow cloned to prevent changes during async operations
+
+    const now = Date.now() + (options.localtimeOffsetMsec ?? 0);                 // Measure now before any other processing
+
+    // Serialize object
+
+    const objectString = internals.stringify(object);
+
+    // Obtain password
+
+    let passwordId = '';
+    password = internals.normalizePassword(password);
+    if (password.id) {
+        if (!/^\w+$/.test(password.id)) {
+            throw new Boom.Boom('Invalid password id');
+        }
+
+        passwordId = password.id;
+    }
+
+    // Encrypt object string
+
+    const { encrypted, key } = await exports.encrypt(password.encryption, options.encryption, objectString);
+
+    // Base64url the encrypted value
+
+    const encryptedB64 = B64.base64urlEncode(encrypted);
+    const iv = B64.base64urlEncode(key.iv);
+    const expiration = (options.ttl ? now + options.ttl : '');
+    const macBaseString = exports.macPrefix + '*' + passwordId + '*' + key.salt + '*' + iv + '*' + encryptedB64 + '*' + expiration;
+
+    // Mac the combined values
+
+    const mac = await exports.hmacWithPassword(password.integrity, options.integrity, macBaseString);
+
+    // Put it all together
+
+    // prefix*[password-id]*encryption-salt*encryption-iv*encrypted*[expiration]*hmac-salt*hmac
+    // Allowed URI query name/value characters: *-. \d \w
+
+    const sealed = macBaseString + '*' + mac.salt + '*' + mac.digest;
+    return sealed;
+};
+
+
+// Decrypt and validate sealed string
+// password: string, buffer or object with { id: secret } or { id: { encryption, integrity } }
+// options: see exports.defaults
+
+exports.unseal = async function (sealed, password, options) {
+
+    options = Object.assign({}, options);                                       // Shallow cloned to prevent changes during async operations
+
+    const now = Date.now() + (options.localtimeOffsetMsec ?? 0);                // Measure now before any other processing
+
+    // Break string into components
+
+    const parts = sealed.split('*');
+    if (parts.length !== 8) {
+        throw new Boom.Boom('Incorrect number of sealed components');
+    }
+
+    const macPrefix = parts[0];
+    const passwordId = parts[1];
+    const encryptionSalt = parts[2];
+    const encryptionIv = parts[3];
+    const encryptedB64 = parts[4];
+    const expiration = parts[5];
+    const hmacSalt = parts[6];
+    const hmac = parts[7];
+    const macBaseString = macPrefix + '*' + passwordId + '*' + encryptionSalt + '*' + encryptionIv + '*' + encryptedB64 + '*' + expiration;
+
+    // Check prefix
+
+    if (macPrefix !== exports.macPrefix) {
+        throw new Boom.Boom('Wrong mac prefix');
+    }
+
+    // Check expiration
+
+    if (expiration) {
+        if (!expiration.match(/^\d+$/)) {
+            throw new Boom.Boom('Invalid expiration');
+        }
+
+        const exp = parseInt(expiration, 10);
+        if (exp <= (now - (options.timestampSkewSec * 1000))) {
+            throw new Boom.Boom('Expired seal');
+        }
+    }
+
+    // Obtain password
+
+    if (!password) {
+        throw new Boom.Boom('Empty password');
+    }
+
+    if (typeof password === 'object' &&
+        !Buffer.isBuffer(password)) {
+
+        password = password[passwordId || 'default'];
+        if (!password) {
+            throw new Boom.Boom('Cannot find password: ' + passwordId);
+        }
+    }
+
+    password = internals.normalizePassword(password);
+
+    // Check hmac
+
+    const macOptions = Hoek.clone(options.integrity);
+    macOptions.salt = hmacSalt;
+    const mac = await exports.hmacWithPassword(password.integrity, macOptions, macBaseString);
+
+    if (!Cryptiles.fixedTimeComparison(mac.digest, hmac)) {
+        throw new Boom.Boom('Bad hmac value');
+    }
+
+    // Decrypt
+
+    try {
+        var encrypted = B64.base64urlDecode(encryptedB64, 'buffer');
+    }
+    catch (err) {
+        throw Boom.boomify(err);
+    }
+
+    const decryptOptions = Hoek.clone(options.encryption);
+    decryptOptions.salt = encryptionSalt;
+
+    try {
+        decryptOptions.iv = B64.base64urlDecode(encryptionIv, 'buffer');
+    }
+    catch (err) {
+        throw Boom.boomify(err);
+    }
+
+    const decrypted = await exports.decrypt(password.encryption, decryptOptions, encrypted);
+
+    // Parse JSON
+
+    try {
+        return Bourne.parse(decrypted);
+    }
+    catch (err) {
+        throw new Boom.Boom('Failed parsing sealed object JSON: ' + err.message);
+    }
+};
+
+
+internals.stringify = function (object) {
+
+    try {
+        return JSON.stringify(object);
+    }
+    catch (err) {
+        throw new Boom.Boom('Failed to stringify object: ' + err.message);
+    }
+};
+
+
+internals.pbkdf2 = function (...args) {
+
+    return new Promise((resolve, reject) => {
+
+        const next = (err, result) => {
+
+            if (err) {
+                return reject(Boom.boomify(err));
+            }
+
+            resolve(result);
+        };
+
+        args.push(next);
+        Crypto.pbkdf2(...args);
+    });
+};
diff --git a/node_modules/@hapi/iron/package.json b/node_modules/@hapi/iron/package.json
new file mode 100755
index 0000000..267e7e3
--- /dev/null
+++ b/node_modules/@hapi/iron/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "@hapi/iron",
+  "description": "Encapsulated tokens (encrypted and mac'ed objects)",
+  "version": "7.0.1",
+  "repository": "git://github.com/hueniverse/iron",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "authentication",
+    "encryption",
+    "data integrity"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/b64": "^6.0.1",
+    "@hapi/boom": "^10.0.1",
+    "@hapi/bourne": "^3.0.0",
+    "@hapi/cryptiles": "^6.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/mimos/LICENSE.md b/node_modules/@hapi/mimos/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/mimos/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/mimos/README.md b/node_modules/@hapi/mimos/README.md
new file mode 100644
index 0000000..7f7c7eb
--- /dev/null
+++ b/node_modules/@hapi/mimos/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/mimos
+
+#### Mime database interface.
+
+**mimos** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/mimos/)
+- [Versions status](https://hapi.dev/resources/status/#mimos) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/mimos/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/mimos/lib/index.d.ts b/node_modules/@hapi/mimos/lib/index.d.ts
new file mode 100644
index 0000000..2ddf207
--- /dev/null
+++ b/node_modules/@hapi/mimos/lib/index.d.ts
@@ -0,0 +1,134 @@
+// Declare our own interface to mime-db data
+
+declare namespace MimeDb {
+
+    type MimeSource = 'iana' | 'apache' | 'nginx';
+
+    interface MimeEntry {
+
+        /**
+         * String with identifier for the source of the data.
+         */
+        source?: MimeSource;
+
+        /**
+         * Array of strings with possible lowercased file extensions, without the
+         * dot.
+         */
+        extensions?: ReadonlyArray<string>;
+
+        /**
+         * Boolean that indicates if the contents is likely to become smaller if
+         * gzip or similar compression is applied.
+         */
+        compressible?: boolean;
+
+        /**
+         * Charset for type.
+         */
+        charset?: string;
+    }
+}
+
+
+// Helpers
+
+type NoInfer<T> = [T][T extends any ? 0 : never];
+
+
+export class MimosEntry {
+
+    /**
+     * String with the content-type.
+     */
+    type: string;
+
+    /**
+     * String with identifier for the source of the data.
+     */
+    source: MimeDb.MimeSource | 'mime-db' | 'mimos';
+
+    /**
+     * Array of strings with possible lowercased file extensions, without the
+     * dot.
+     */
+    extensions: ReadonlyArray<string>;
+
+    /**
+     * Boolean that indicates if the contents is likely to become smaller if
+     * gzip or similar compression is applied.
+     */
+    compressible: boolean;
+
+    /**
+     * Optional charset for type.
+     */
+    charset?: string;
+
+    private constructor();
+}
+
+export interface MimosDeclaration<P extends object = {}> extends MimeDb.MimeEntry {
+
+    /**
+     * The `type` value of result objects, defaults to `key`.
+     */
+    type?: string;
+
+    /**
+     * Method with signature `function(mime)`.
+     *
+     * When this mime type is found in the database, this function will run.
+     * This allows you make customizations to `mime` based on developer criteria.
+     */
+    predicate?: (mime: MimosEntry & P) => MimosEntry;
+}
+
+export interface MimosOptions<P extends object = {}> {
+
+    /**
+     * An object hash that is merged into the built-in mime information from
+     * {@link https://github.com/jshttp/mime-db}.
+     *
+     * Each key value pair represents a single mime object override.
+     *
+     * Each override entry should follow this schema:
+     *  * The key is the lower-cased correct mime-type. (Ex. "application/javascript").
+     *  * The value should be an object following the structure from
+     *    {@link https://github.com/jshttp/mime-db#data-structure} with additional
+     *    optional values:
+     *     * type - Specify the `type` value of result objects, defaults to `key`.
+     *     * predicate - Method that is called with mime entry on lookup, that
+     *       must return an entry. This allows you make customizations to `mime`
+     *       based on developer criteria.
+     */
+    override?: {
+        [type: string]: MimosDeclaration<P> & P;
+    };
+}
+
+export class Mimos<P extends object = {}> {
+
+    /**
+     * Create a Mimos object for mime lookups.
+     */
+    constructor(options?: MimosOptions<NoInfer<P>>);
+
+    /**
+     * Extract extension from file path and lookup mime information.
+     *
+     * @param path - Path to file
+     *
+     * @return Found mime object, or {} if no match.
+     */
+    path(path: string): (Readonly<MimosEntry & Partial<P>>) | {};
+
+    /**
+     * Lookup mime information.
+     *
+     * @param type - The content-type to find mime information about.
+     *
+     * @return Mime object for provided type.
+    */
+    type(type: string): Readonly<MimosEntry & Partial<P>>;
+}
diff --git a/node_modules/@hapi/mimos/lib/index.js b/node_modules/@hapi/mimos/lib/index.js
new file mode 100755
index 0000000..b3aca80
--- /dev/null
+++ b/node_modules/@hapi/mimos/lib/index.js
@@ -0,0 +1,147 @@
+'use strict';
+
+const Path = require('path');
+
+const Hoek = require('@hapi/hoek');
+const MimeDb = require('mime-db/db.json');          // Load JSON file to prevent loading or executing code
+
+
+const internals = {
+    compressibleRx: /^text\/|\+json$|\+text$|\+xml$/
+};
+
+
+exports.MimosEntry = class {
+
+    constructor(type, mime) {
+
+        this.type = type;
+        this.source = 'mime-db';
+        this.extensions = [];
+        this.compressible = undefined;
+
+        Object.assign(this, mime);
+
+        if (this.compressible === undefined) {
+            this.compressible = internals.compressibleRx.test(type);
+        }
+    }
+};
+
+
+internals.insertEntry = function (type, entry, db) {
+
+    db.byType.set(type, entry);
+    for (const ext of entry.extensions) {
+        db.byExtension.set(ext, entry);
+        if (ext.length > db.maxExtLength) {
+            db.maxExtLength = ext.length;
+        }
+    }
+};
+
+
+internals.compile = function (mimedb) {
+
+    const db = {
+        byType: new Map(),
+        byExtension: new Map(),
+        maxExtLength: 0
+    };
+
+    for (const type in mimedb) {
+        const entry = new exports.MimosEntry(type, mimedb[type]);
+        internals.insertEntry(type, entry, db);
+    }
+
+    return db;
+};
+
+
+internals.getTypePart = function (fulltype) {
+
+    const splitAt = fulltype.indexOf(';');
+    return splitAt === -1 ? fulltype : fulltype.slice(0, splitAt);
+};
+
+
+internals.applyPredicate = function (mime) {
+
+    if (mime.predicate) {
+        return mime.predicate(Hoek.clone(mime));
+    }
+
+    return mime;
+};
+
+
+exports.Mimos = class Mimos {
+
+    #db = internals.base;
+
+    constructor(options = {}) {
+
+        if (options.override) {
+            Hoek.assert(typeof options.override === 'object', 'overrides option must be an object');
+
+            // Shallow clone db
+
+            this.#db = {
+                ...this.#db,
+                byType: new Map(this.#db.byType),
+                byExtension: new Map(this.#db.byExtension)
+            };
+
+            // Apply overrides
+
+            for (const type in options.override) {
+                const override = options.override[type];
+                Hoek.assert(!override.predicate || typeof override.predicate === 'function', 'predicate option must be a function');
+
+                const from = this.#db.byType.get(type);
+                const baseEntry = from ? Hoek.applyToDefaults(from, override) : override;
+
+                const entry = new exports.MimosEntry(type, baseEntry);
+                internals.insertEntry(type, entry, this.#db);
+            }
+        }
+    }
+
+    path(path) {
+
+        const extension = Path.extname(path).slice(1).toLowerCase();
+        const mime = this.#db.byExtension.get(extension) ?? {};
+
+        return internals.applyPredicate(mime);
+    }
+
+    type(type) {
+
+        type = internals.getTypePart(type);
+
+        let mime = this.#db.byType.get(type);
+        if (!mime) {
+            // Retry with more expensive adaptations
+
+            type = type.trim().toLowerCase();
+            mime = this.#db.byType.get(type);
+        }
+
+        if (!mime) {
+            mime = new exports.MimosEntry(type, {
+                source: 'mimos'
+            });
+
+            // Cache the entry
+
+            internals.insertEntry(type, mime, this.#db);
+
+            return mime;
+        }
+
+        return internals.applyPredicate(mime);
+    }
+};
+
+
+internals.base = internals.compile(MimeDb);
diff --git a/node_modules/@hapi/mimos/package.json b/node_modules/@hapi/mimos/package.json
new file mode 100644
index 0000000..b31a22d
--- /dev/null
+++ b/node_modules/@hapi/mimos/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "@hapi/mimos",
+  "description": "Mime database interface",
+  "version": "7.0.1",
+  "repository": "git://github.com/hapijs/mimos",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "mime",
+    "database",
+    "content-type"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "mime-db": "^1.52.0"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.0.1",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -m 5000 -t 100 -L -a @hapi/code -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html -L"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/nigel/LICENSE.md b/node_modules/@hapi/nigel/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/nigel/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/nigel/README.md b/node_modules/@hapi/nigel/README.md
new file mode 100644
index 0000000..fe5dec4
--- /dev/null
+++ b/node_modules/@hapi/nigel/README.md
@@ -0,0 +1,15 @@
+# @hapi/nigel
+
+#### Boyer-Moore-Horspool algorithms
+
+**nigel** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/nigel/)
+- [Versions status](https://hapi.dev/resources/status/#nigel) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/nigel/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/nigel/lib/index.js b/node_modules/@hapi/nigel/lib/index.js
new file mode 100755
index 0000000..8306dd4
--- /dev/null
+++ b/node_modules/@hapi/nigel/lib/index.js
@@ -0,0 +1,184 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Hoek = require('@hapi/hoek');
+const { Vise } = require('@hapi/vise');
+
+
+const internals = {};
+
+
+exports.compile = function (needle) {
+
+    Hoek.assert(needle?.length, 'Missing needle');
+    Hoek.assert(Buffer.isBuffer(needle), 'Needle must be a buffer');
+
+    const profile = {
+        value: needle,
+        lastPos: needle.length - 1,
+        last: needle[needle.length - 1],
+        length: needle.length,
+        badCharShift: Buffer.alloc(256)                  // Lookup table of how many characters can be skipped for each match
+    };
+
+    for (let i = 0; i < 256; ++i) {
+        profile.badCharShift[i] = profile.length;       // Defaults to the full length of the needle
+    }
+
+    const last = profile.length - 1;
+    for (let i = 0; i < last; ++i) {                    // For each character in the needle (skip last since its position is already the default)
+        profile.badCharShift[profile.value[i]] = last - i;
+    }
+
+    return profile;
+};
+
+
+exports.horspool = function (haystack, needle, start) {
+
+    Hoek.assert(haystack, 'Missing haystack');
+
+    needle = (needle.badCharShift ? needle : exports.compile(needle));
+    start = start ?? 0;
+
+    for (let i = start; i <= haystack.length - needle.length;) {       // Has enough room to fit the entire needle
+        const lastChar = haystack.readUInt8(i + needle.lastPos);
+        if (lastChar === needle.last &&
+            internals.startsWith(haystack, needle, i)) {
+
+            return i;
+        }
+
+        i += needle.badCharShift[lastChar];           // Jump to the next possible position based on last character location in needle
+    }
+
+    return -1;
+};
+
+
+internals.startsWith = function (haystack, needle, pos) {
+
+    if (haystack.startsWith) {
+        return haystack.startsWith(needle.value, pos, needle.lastPos);
+    }
+
+    for (let i = 0; i < needle.lastPos; ++i) {
+        if (needle.value[i] !== haystack.readUInt8(pos + i)) {
+            return false;
+        }
+    }
+
+    return true;
+};
+
+
+exports.all = function (haystack, needle, start) {
+
+    needle = exports.compile(needle);
+    start = start ?? 0;
+
+    const matches = [];
+    for (let i = start; i !== -1 && i < haystack.length;) {
+
+        i = exports.horspool(haystack, needle, i);
+        if (i !== -1) {
+            matches.push(i);
+            i += needle.length;
+        }
+    }
+
+    return matches;
+};
+
+
+internals._indexOf = function (haystack, needle) {
+
+    Hoek.assert(haystack, 'Missing haystack');
+
+    for (let i = 0; i <= haystack.length - needle.length; ++i) {       // Has enough room to fit the entire needle
+        if (haystack.startsWith(needle.value, i)) {
+            return i;
+        }
+    }
+
+    return -1;
+};
+
+
+exports.Stream = class extends Stream.Writable {
+
+    constructor(needle) {
+
+        super();
+
+        this.needle(needle);
+        this._haystack = new Vise();
+        this._indexOf = this._needle.length > 2 ? exports.horspool : internals._indexOf;
+
+        this.on('finish', () => {
+
+            // Flush out the remainder
+
+            const chunks = this._haystack.chunks();
+            for (let i = 0; i < chunks.length; ++i) {
+                this.emit('haystack', chunks[i]);
+            }
+        });
+    }
+
+    needle(needle) {
+
+        this._needle = exports.compile(needle);
+    }
+
+    _write(chunk, encoding, next) {
+
+        this._haystack.push(chunk);
+
+        let match = this._indexOf(this._haystack, this._needle);
+        if (match === -1 &&
+            chunk.length >= this._needle.length) {
+
+            this._flush(this._haystack.length - chunk.length);
+        }
+
+        while (match !== -1) {
+            this._flush(match);
+            this._haystack.shift(this._needle.length);
+            this.emit('needle');
+
+            match = this._indexOf(this._haystack, this._needle);
+        }
+
+        if (this._haystack.length) {
+            const notChecked = this._haystack.length - this._needle.length + 1;       // Not enough space for Horspool
+            let i = notChecked;
+            for (; i < this._haystack.length; ++i) {
+                if (this._haystack.startsWith(this._needle.value, i, this._haystack.length - i)) {
+                    break;
+                }
+            }
+
+            this._flush(i);
+        }
+
+        return next();
+    }
+
+    _flush(pos) {
+
+        const chunks = this._haystack.shift(pos);
+        for (let i = 0; i < chunks.length; ++i) {
+            this.emit('haystack', chunks[i]);
+        }
+    }
+
+    flush() {
+
+        const chunks = this._haystack.shift(this._haystack.length);
+        for (let i = 0; i < chunks.length; ++i) {
+            this.emit('haystack', chunks[i]);
+        }
+    }
+};
diff --git a/node_modules/@hapi/nigel/package.json b/node_modules/@hapi/nigel/package.json
new file mode 100755
index 0000000..46af190
--- /dev/null
+++ b/node_modules/@hapi/nigel/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "@hapi/nigel",
+  "description": "Boyer-Moore-Horspool algorithms",
+  "version": "5.0.1",
+  "repository": "git://github.com/hapijs/nigel",
+  "main": "lib/index.js",
+  "engines": {
+    "node": ">=14.0.0"
+  },
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "boyer-moore-horspool",
+    "algorithms",
+    "lookup",
+    "search",
+    "stream"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/vise": "^5.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.0.1",
+    "@hapi/teamwork": "^6.0.0"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/pez/LICENSE.md b/node_modules/@hapi/pez/LICENSE.md
new file mode 100755
index 0000000..7d2cf21
--- /dev/null
+++ b/node_modules/@hapi/pez/LICENSE.md
@@ -0,0 +1,12 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+Copyright (c) 2011-2013 Felix Geisendörfer, Andrew Kelley
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/pez/README.md b/node_modules/@hapi/pez/README.md
new file mode 100755
index 0000000..b7d1f20
--- /dev/null
+++ b/node_modules/@hapi/pez/README.md
@@ -0,0 +1,5 @@
+<a href="http://hapijs.com"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/pez
+
+#### Multipart parser.
diff --git a/node_modules/@hapi/pez/lib/index.js b/node_modules/@hapi/pez/lib/index.js
new file mode 100755
index 0000000..30ceaff
--- /dev/null
+++ b/node_modules/@hapi/pez/lib/index.js
@@ -0,0 +1,374 @@
+'use strict';
+
+const Stream = require('stream');
+
+const B64 = require('@hapi/b64');
+const Boom = require('@hapi/boom');
+const Content = require('@hapi/content');
+const Hoek = require('@hapi/hoek');
+const Nigel = require('@hapi/nigel');
+
+
+const internals = {};
+
+
+/*
+    RFC 2046 (http://tools.ietf.org/html/rfc2046)
+
+    multipart-body = [preamble CRLF]
+                    dash-boundary *( SPACE / HTAB ) CRLF body-part
+                    *( CRLF dash-boundary *( SPACE / HTAB ) CRLF body-part )
+                    CRLF dash-boundary "--" *( SPACE / HTAB )
+                    [CRLF epilogue]
+
+    boundary       = 0*69<bchars> bcharsnospace
+    bchars         = bcharsnospace / " "
+    bcharsnospace  = DIGIT / ALPHA / "'" / "(" / ")" / "+" / "_" / "," / "-" / "." / "/" / ":" / "=" / "?"
+    dash-boundary  = "--" boundary
+
+    preamble       = discard-text
+    epilogue       = discard-text
+    discard-text   = *(*text CRLF) *text
+
+    body-part      = MIME-part-headers [CRLF *OCTET]
+    OCTET          = <any 0-255 octet value>
+
+    SPACE          = 32
+    HTAB           = 9
+    CRLF           = 13 10
+*/
+
+
+internals.state = {
+    preamble: 0,                // Until the first boundary is received
+    boundary: 1,                // After a boundary, waiting for first line with optional linear-whitespace
+    header: 2,                  // Receiving part headers
+    payload: 3,                 // Receiving part payload
+    epilogue: 4
+};
+
+
+internals.defaults = {
+    maxBytes: Infinity,
+    maxParts: Infinity
+};
+
+
+exports.Dispenser = class extends Stream.Writable {
+
+    constructor(options) {
+
+        super({ autoDestroy: false });
+
+        Hoek.assert(options !== null && typeof options === 'object', 'options must be an object');
+        const settings = Hoek.applyToDefaults(internals.defaults, options);
+
+        this._boundary = settings.boundary;
+        this._state = internals.state.preamble;
+        this._held = '';
+
+        this._stream = null;
+        this._headers = {};
+        this._name = '';
+        this._pendingHeader = '';
+        this._error = null;
+        this._bytesCount = 0;
+        this._partsCount = 0;
+        this._maxBytes = settings.maxBytes;
+        this._maxParts = settings.maxParts;
+
+        this._parts = new Nigel.Stream(Buffer.from('--' + settings.boundary));
+        this._lines = new Nigel.Stream(Buffer.from('\r\n'));
+
+        this._parts.on('needle', () => this.#onPartEnd());
+        this._parts.on('haystack', (chunk) => this.#onPart(chunk));
+        this._lines.on('needle', () => this.#onLineEnd());
+        this._lines.on('haystack', (chunk) => this.#onLine(chunk));
+        this.once('finish', () => this._parts.end());
+        this._parts.once('close', () => this._lines.end());
+
+        let piper = null;
+        let finish = (err) => {
+
+            if (piper) {
+                piper.removeListener('data', onReqData);
+                piper.removeListener('error', finish);
+                piper.removeListener('aborted', onReqAborted);
+            }
+
+            if (err) {
+                return this.#abort(err);
+            }
+
+            this.#emit('close');
+        };
+
+        finish = Hoek.once(finish);
+
+        this._lines.once('close', () => {
+
+            if (this._state === internals.state.epilogue) {
+                if (this._held) {
+                    this.#emit('epilogue', this._held);
+                    this._held = '';
+                }
+            }
+            else if (this._state === internals.state.boundary) {
+                if (!this._held) {
+                    this.#abort(Boom.badRequest('Missing end boundary'));
+                }
+                else if (this._held !== '--') {
+                    this.#abort(Boom.badRequest('Only white space allowed after boundary at end'));
+                }
+            }
+            else {
+                this.#abort(Boom.badRequest('Incomplete multipart payload'));
+            }
+
+            setImmediate(finish);                  // Give pending events a chance to fire
+        });
+
+        const onReqAborted = () => {
+
+            finish(Boom.badRequest('Client request aborted'));
+        };
+
+        const onReqData = (data) => {
+
+            this._bytesCount += Buffer.byteLength(data);
+
+            if (this._bytesCount > this._maxBytes) {
+                finish(Boom.entityTooLarge('Maximum size exceeded'));
+            }
+        };
+
+        this.once('pipe', (req) => {
+
+            piper = req;
+            req.on('data', onReqData);
+            req.once('error', finish);
+            req.once('aborted', onReqAborted);
+        });
+    }
+
+    _write(buffer, encoding, next) {
+
+        if (this._error) {
+            return next();
+        }
+
+        this._parts.write(buffer);
+        return next();
+    }
+
+    #emit(...args) {
+
+        if (this._error) {
+            return;
+        }
+
+        this.emit(...args);
+    }
+
+    #abort(err) {
+
+        this.#emit('error', err);
+        this._error = err;
+    }
+
+    #onPartEnd() {
+
+        this._lines.flush();
+
+        if (this._state === internals.state.preamble) {
+            if (this._held) {
+                const last = this._held.length - 1;
+
+                if (this._held[last] !== '\n' ||
+                    this._held[last - 1] !== '\r') {
+
+                    return this.#abort(Boom.badRequest('Preamble missing CRLF terminator'));
+                }
+
+                this.#emit('preamble', this._held.slice(0, -2));
+                this._held = '';
+            }
+
+            this._parts.needle(Buffer.from('\r\n--' + this._boundary));                      // CRLF no longer optional
+        }
+        else {
+            this._partsCount++;
+            if (this._partsCount > this._maxParts) {
+                return this.#abort(Boom.badRequest('Maximum parts exceeded'));
+            }
+        }
+
+        this._state = internals.state.boundary;
+
+        if (this._stream) {
+            this._stream.end();
+            this._stream = null;
+        }
+        else if (this._name) {
+            this.#emit('field', this._name, this._held);
+            this._name = '';
+            this._held = '';
+        }
+    }
+
+    #onPart(chunk) {
+
+        if (this._state === internals.state.preamble) {
+            this._held = this._held + chunk.toString();
+        }
+        else if (this._state === internals.state.payload) {
+            if (this._stream) {
+                this._stream.write(chunk);                                                 // Stream payload
+            }
+            else {
+                this._held = this._held + chunk.toString();
+            }
+        }
+        else {
+            this._lines.write(chunk);                                                       // Look for boundary
+        }
+    }
+
+    #onLineEnd() {
+
+        // Boundary whitespace
+
+        if (this._state === internals.state.boundary) {
+            if (this._held) {
+                this._held = this._held.replace(/[\t ]/g, '');                                // trim() removes new lines
+                if (this._held) {
+                    if (this._held === '--') {
+                        this._state = internals.state.epilogue;
+                        this._held = '';
+
+                        return;
+                    }
+
+                    return this.#abort(Boom.badRequest('Only white space allowed after boundary'));
+                }
+            }
+
+            this._state = internals.state.header;
+
+            return;
+        }
+
+        // Part headers
+
+        if (this._state === internals.state.header) {
+
+            // Header
+
+            if (this._held) {
+
+                // Header continuation
+
+                if (this._held[0] === ' ' ||
+                    this._held[0] === '\t') {
+
+                    if (!this._pendingHeader) {
+                        return this.#abort(Boom.badRequest('Invalid header continuation without valid declaration on previous line'));
+                    }
+
+                    this._pendingHeader = this._pendingHeader + ' ' + this._held.slice(1);                       // Drop tab
+                    this._held = '';
+                    return;
+                }
+
+                // Start of new header
+
+                this.#flushHeader();
+                this._pendingHeader = this._held;
+                this._held = '';
+
+                return;
+            }
+
+            // End of headers
+
+            this.#flushHeader();
+
+            this._state = internals.state.payload;
+
+            let disposition;
+
+            try {
+                disposition = Content.disposition(this._headers['content-disposition']);
+            }
+            catch (err) {
+                return this.#abort(err);
+            }
+
+            if (disposition.filename !== undefined) {
+                const stream = new Stream.PassThrough();
+                const transferEncoding = this._headers['content-transfer-encoding'];
+
+                if (transferEncoding &&
+                    transferEncoding.toLowerCase() === 'base64') {
+
+                    this._stream = new B64.Decoder();
+                    this._stream.pipe(stream);
+                }
+                else {
+                    this._stream = stream;
+                }
+
+                stream.name = disposition.name;
+                stream.filename = disposition.filename;
+                stream.headers = this._headers;
+                this._headers = {};
+                this.#emit('part', stream);
+            }
+            else {
+                this._name = disposition.name;
+            }
+
+            this._lines.flush();
+            return;
+        }
+
+        // Epilogue
+
+        this._held = this._held + '\r\n';                               // Put the new line back
+    }
+
+    #onLine(chunk) {
+
+        if (this._stream) {
+            this._stream.write(chunk);                      // Stream payload
+        }
+        else {
+            this._held = this._held + chunk.toString();                 // Reading header or field
+        }
+    }
+
+    #flushHeader() {
+
+        if (!this._pendingHeader) {
+            return;
+        }
+
+        const sep = this._pendingHeader.indexOf(':');
+
+        if (sep === -1) {
+            return this.#abort(Boom.badRequest('Invalid header missing colon separator'));
+        }
+
+        if (!sep) {
+            return this.#abort(Boom.badRequest('Invalid header missing field name'));
+        }
+
+        const name = this._pendingHeader.slice(0, sep).toLowerCase();
+        if (name === '__proto__') {
+            return this.#abort(Boom.badRequest('Invalid header'));
+        }
+
+        this._headers[name] = this._pendingHeader.slice(sep + 1).trim();
+        this._pendingHeader = '';
+    }
+};
diff --git a/node_modules/@hapi/pez/package.json b/node_modules/@hapi/pez/package.json
new file mode 100644
index 0000000..4ba21cc
--- /dev/null
+++ b/node_modules/@hapi/pez/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "@hapi/pez",
+  "description": "Multipart parser",
+  "version": "6.1.1",
+  "repository": "git://github.com/hapijs/pez",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "HTTP",
+    "multipart",
+    "parser"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/b64": "^6.0.1",
+    "@hapi/boom": "^10.0.1",
+    "@hapi/content": "^6.0.1",
+    "@hapi/hoek": "^11.0.7",
+    "@hapi/nigel": "^5.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.3.2",
+    "@hapi/teamwork": "^6.0.1",
+    "@hapi/wreck": "^18.1.0",
+    "form-data": "^4.0.5"
+  },
+  "scripts": {
+    "test": "lab -t 100 -L -a @hapi/code",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/podium/LICENSE.md b/node_modules/@hapi/podium/LICENSE.md
new file mode 100755
index 0000000..b75208d
--- /dev/null
+++ b/node_modules/@hapi/podium/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2016-2022, Project contributors
+Copyright (c) 2016-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/podium/README.md b/node_modules/@hapi/podium/README.md
new file mode 100755
index 0000000..bd50b81
--- /dev/null
+++ b/node_modules/@hapi/podium/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/podium
+
+#### Event emitter with async features.
+
+**podium** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/podium/)
+- [Version status](https://hapi.dev/resources/status/#podium) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/podium/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/podium/lib/index.d.ts b/node_modules/@hapi/podium/lib/index.d.ts
new file mode 100644
index 0000000..2528128
--- /dev/null
+++ b/node_modules/@hapi/podium/lib/index.d.ts
@@ -0,0 +1,332 @@
+
+type IfUndefinedElse<T, If, Else> = T extends undefined ? If : Else;
+
+type EventNames<Events> = IfUndefinedElse<Events, string, keyof Events>;
+
+type EventListenerParameters<Events> = Events[keyof Events] extends (...args: any) => any
+  ? Parameters<Events[keyof Events]>
+  : never
+;
+
+type EmitData<Events> = IfUndefinedElse<Events, any, EventListenerParameters<Events>>;
+
+type EventListener<Events, TArgs extends unknown[], TContext extends object> = Podium.Listener<
+  TContext,
+  IfUndefinedElse<Events, TArgs, EventListenerParameters<Events>>
+>;
+
+type WithRequiredProperty<Type, Key extends keyof Type> = Type & {
+    [Property in Key]-?: Type[Property];
+};
+
+/**
+ * Node (semi) compatible event emitter with extra features.
+ */
+export class Podium<Events = undefined> {
+    /**
+     * Creates a new podium emitter.
+     *
+     * @param events - If present, the value is passed to podium.registerEvent().
+     * @param options - optional configuration options passed to podium.registerEvent().
+     */
+    constructor(events?: Podium.Event<EventNames<Events>> | Podium.Event<EventNames<Events>>[], options?: Podium.EventSettings);
+
+    /**
+     * Register the specified events and their optional configuration. Events must be registered
+     * before they can be emitted or subscribed to. This is done to detect event name mispelling
+     * and invalid event activities.
+     *
+     * @param events - The event(s) to register.
+     * @param options - optional configuration options.
+     */
+    registerEvent(events: Podium.Event<EventNames<Events>> | Podium.Event<EventNames<Events>>[], options?: Podium.EventSettings): void;
+
+    /**
+     * Emits an event update to all the subscribed listeners.
+
+     * @param criteria - The event update criteria.
+     * @param data - The value emitted to the subscribers.
+     */
+    emit(criteria: Podium.EmitCriteria<EventNames<Events>>, data?: EmitData<Events>): void;
+
+    /**
+     * Emits an event update to all the subscribed listeners and resolves an array of their results.
+
+     * @param criteria - The event update criteria.
+     * @param data - The value emitted to the subscribers.
+     */
+    gauge<T = unknown>(criteria: Podium.EmitCriteria<EventNames<Events>>, data?: EmitData<Events>): Promise<PromiseSettledResult<T>[]>;
+
+    /**
+     * Subscribe a handler to an event.
+     *
+     * @param criteria - The subscription criteria.
+     * @param listener - The handler method set to receive event updates. The function signature
+     *                   depends on the block, spread, and tags options.
+     * @param context - Optional object that binds to the listener handler.
+     *
+     * @returns A reference to the current emitter.
+     */
+    on<TArgs extends any[] = unknown[], Tcontext extends object = this>
+        (criteria: Podium.Criteria<EventNames<Events>>, listener: EventListener<Events, TArgs, Tcontext>, context?: Tcontext): this
+
+    /**
+     * Subscribe a handler to an event. Same as podium.on().
+     *
+     * @param criteria - The subscription criteria.
+     * @param listener - The handler method set to receive event updates. The function signature
+     *                   depends on the block, spread, and tags options.
+     * @param context - Optional object that binds to the listener handler.
+     *
+     * @returns A reference to the current emitter.
+     */
+    addListener<TArgs extends any[] = unknown[], Tcontext extends object = this>
+        (criteria: Podium.Criteria<EventNames<Events>>, listener: EventListener<Events, TArgs, Tcontext>, context?: Tcontext): this;
+
+    /**
+     * Same as podium.on() with the count option set to 1.
+     *
+     * Can also be called without an listener to wait for a single event.
+     *
+     * @param criteria - The subscription criteria.
+     * @param listener - The handler method set to receive event updates. The function signature
+     *                   depends on the block, spread, and tags options.
+     * @param context - Optional object that binds to the listener handler.
+     *
+     * @returns A reference to the current emitter.
+     */
+    once<TArgs extends any[] = unknown[], Tcontext extends object = this>
+        (criteria: Podium.OnceCriteria<EventNames<Events>>, listener: EventListener<Events, TArgs, Tcontext>, context?: Tcontext): this;
+
+    /**
+     * Subscribes to an event by returning a promise that resolves when the event is emitted.
+     *
+     * @param criteria - The subscription criteria.
+     *
+     * @returns Promise with array of emitted parameters.
+     */
+    once<TArgs extends any[] = unknown[], Tcontext extends object = this>(criteria: Podium.OnceCriteria<EventNames<Events>>): Promise<TArgs>;
+
+    /**
+     * Subscribes to an event by returning a promise that resolves when the event is emitted `count` times.
+     *
+     * @param criteria - The subscription criteria.
+     *
+     * @returns Promise with array where each item is an array of emitted arguments.
+     */
+    few<TArgs extends any[] = unknown[], Tcontext extends object = this>(criteria: Podium.FewCriteria<EventNames<Events>>): Promise<TArgs>;
+
+    /**
+     * Removes all listeners subscribed to a given event name matching the provided listener method.
+     *
+     * @param name - The event name string.
+     * @param listener - The function reference provided when subscribed.
+     *
+     * @returns A reference to the current emitter.
+     */
+    off(name: string, listener: Podium.Listener): this;
+
+    /**
+     * Removes all listeners subscribed to a given event name matching the provided listener method.
+     *
+     * @param name - The event name string.
+     * @param listener - The function reference provided when subscribed.
+     *
+     * @returns A reference to the current emitter.
+     */
+    removeListener(name: string, listener: Podium.Listener): this;
+
+    /**
+     * Removes all listeners subscribed to a given event name.
+     *
+     * @param name - The event name string.
+     *
+     * @returns A reference to the current emitter.
+     */
+    removeAllListeners(name: string): this;
+
+    /**
+     * Returns whether an event has any listeners subscribed.
+     *
+     * @param name  the event name string.
+     *
+     * @returns true if the event name has any listeners, otherwise false.
+     */
+    hasListeners(name: string): boolean;
+}
+
+declare namespace Podium {
+
+    type EventName = string | number | symbol
+
+    interface EmitCriteriaInterface<TName extends EventName> {
+
+        /**
+         * Event name.
+         */
+        readonly name: TName;
+
+        /**
+         * Channel name.
+         */
+        readonly channel?: string | undefined;
+
+        /**
+         * The tags to apply.
+         */
+        readonly tags?: string | string[] | { [tag: string]: boolean } | undefined;
+    }
+
+    export type EmitCriteria<TName extends EventName> = EmitCriteriaInterface<TName> | TName
+
+    interface EventOptionsInterface<TName extends EventName> {
+
+        /**
+         * Event name.
+         */
+        readonly name: TName;
+
+        /**
+         * A string or array of strings specifying the event channels available.
+         *
+         * Defaults to no channel restrictions - Event updates can specify a channel or not.
+         */
+        readonly channels?: string | string[] | undefined;
+
+        /**
+         * Set to make podium.emit() clone the data object passed to it, before it is passed to the
+         * listeners (unless an override specified by each listener).
+         *
+         * Defaults to false - Data is passed as-is.
+         */
+        readonly clone?: boolean | undefined;
+
+        /**
+         * Set to require the data object passed to podium.emit() to be an array, and make the
+         * listener method called with each array element passed as a separate argument (unless an
+         * override specified by each listener).
+         *
+         * This should only be used when the emitted data structure is known and predictable.
+         *
+         * Defaults to false - Data is emitted as a single argument regardless of its type.
+         */
+        readonly spread?: boolean | undefined;
+
+        /**
+         * Set to make any tags in the critieria object passed to podium.emit() map to an object
+         * (where each tag string is the key and the value is true) which is appended to the emitted
+         * arguments list at the end.
+         *
+         * A configuration override can be set by each listener.
+         *
+         * Defaults to false.
+         */
+        readonly tags?: boolean | undefined;
+
+        /**
+         * Set to allow the same event name to be registered multiple times, ignoring all but the
+         * first.
+         *
+         * Note that if the registration config is changed between registrations, only the first
+         * configuration is used.
+         *
+         * Defaults to false - A duplicate registration will throw an error.
+         */
+        readonly shared?: boolean | undefined;
+    }
+
+    type EventOptions<TName extends EventName> = EventOptionsInterface<TName> | TName
+
+    type Event<TName extends EventName> = TName | EventOptions<TName>;
+
+    export interface EventSettings {
+
+        /**
+         * If false, events are not validated. This is only allowed when the events
+         * value is returned from Podium.validate().
+         *
+         * Defaults to true
+         */
+        readonly validate?: boolean | undefined;
+    }
+
+    type Listener<TContext extends object = any, TArgs extends any[] = any[]> =
+        (this: TContext, ...args: TArgs) => unknown;
+
+    interface CriteriaFilterOptionsObject {
+
+        /**
+         * A tag string or array of tag strings.
+         */
+        readonly tags?: string | string[] | undefined;
+
+        /**
+         * Require all tags to be present for the event update to match the subscription.
+         *
+         * Default false - Require at least one matching tag.
+         */
+        readonly all?: boolean | undefined;
+    }
+
+    interface CriteriaInterface<TName extends EventName> {
+
+        /**
+         * Event name.
+         */
+        readonly name: TName;
+
+        /**
+         * The event channels to subscribe to.
+         *
+         * If the event registration specified a list of allowed channels, the channels array must
+         * match the allowed channels. If channels are specified, event updates without any channel
+         * designation will not be included in the subscription.
+         *
+         * Defaults to no channels filter.
+         */
+        readonly channels?: string | string[] | undefined;
+
+        /**
+         * Set to clone the data object passed to podium.emit() before it is passed to the listener
+         * method.
+         *
+         * Defaults to the event registration option (which defaults to false).
+         */
+        readonly clone?: boolean | undefined;
+
+        /**
+         * A positive non-zero integer indicating the number of times the listener can be called
+         * after which the subscription is automatically removed.
+         *
+         * Does nothing when calling once(), where it will use the value 1.
+         *
+         * Defaults to no limit.
+         */
+        readonly count?: number | undefined;
+
+        /**
+         * The event tags (if present) to subscribe to.
+         */
+        readonly filter?: string | string[] | CriteriaFilterOptionsObject | undefined;
+
+        /**
+         * Override the value of spread from the event registraiont when the listener is called.
+         *
+         * This should only be used when the emitted data structure is known and predictable.
+         *
+         * Defaults to the event registration option (which defaults to false).
+         */
+        readonly spread?: boolean | undefined;
+
+        /**
+         * Override the value of tags from the event registraiont when the listener is called.
+         *
+         * Defaults to the event registration option (which defaults to false).
+         */
+        readonly tags?: boolean | undefined;
+    }
+
+    export type Criteria<TName extends EventName = string> = CriteriaInterface<TName> | TName
+    export type OnceCriteria<TName extends EventName = string> = Omit<CriteriaInterface<TName>, 'count'> | TName
+    export type FewCriteria<TName extends EventName = string> = WithRequiredProperty<CriteriaInterface<TName>, 'count'>
+}
diff --git a/node_modules/@hapi/podium/lib/index.js b/node_modules/@hapi/podium/lib/index.js
new file mode 100755
index 0000000..284a11c
--- /dev/null
+++ b/node_modules/@hapi/podium/lib/index.js
@@ -0,0 +1,330 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Teamwork = require('@hapi/teamwork');
+const Validate = require('@hapi/validate');
+
+
+const internals = {
+    schema: {
+        base: Validate.object({
+            name: Validate.string().required(),
+            clone: Validate.boolean(),
+            tags: Validate.boolean(),
+            spread: Validate.boolean(),
+            channels: Validate.array().items(Validate.string()).single().unique().min(1).cast('set')
+        })
+    }
+};
+
+
+internals.schema.event = internals.schema.base.keys({
+    shared: Validate.boolean()
+});
+
+
+internals.schema.listener = internals.schema.base.keys({
+    listener: Validate.func().required(),
+    context: Validate.object(),
+    count: Validate.number().integer().min(1),
+    filter: {
+        tags: Validate.array().items(Validate.string()).single().unique().min(1).required(),
+        all: Validate.boolean()
+    }
+});
+
+
+exports.validate = function (events) {
+
+    const normalized = [];
+    events = [].concat(events);
+    for (let event of events) {
+        if (typeof event === 'string') {
+            event = { name: event };
+        }
+
+        normalized.push(Validate.attempt(event, internals.schema.event, 'Invalid event options'));
+    }
+
+    return normalized;
+};
+
+
+exports.Podium = class {
+
+    /** @type {Map<string,internals.EventListener>} */
+    #listeners = new Map();
+
+    constructor(events, options) {
+
+        if (events) {
+            this.registerEvent(events, options);
+        }
+    }
+
+    registerEvent(events, options) {
+
+        events = [].concat(events);
+        for (let event of events) {
+            if (typeof event === 'string') {
+                event = { name: event };
+            }
+
+            if (options?.validate !== false) {                                                       // Defaults to true
+                event = Validate.attempt(event, internals.schema.event, 'Invalid event options');
+            }
+
+            const name = event.name;
+            if (this.#listeners.has(name)) {
+                Hoek.assert(event.shared, `Event ${name} exists`);
+                continue;
+            }
+
+            this.#listeners.set(name, new internals.EventListener(event));
+        }
+    }
+
+    emit(criteria, data) {
+
+        let thrownErr;
+
+        this.#emitToEachListener(criteria, data, ([err]) => {
+
+            thrownErr = thrownErr ?? err;
+        });
+
+        if (thrownErr) {
+            throw thrownErr;
+        }
+    }
+
+    async gauge(criteria, data) {
+
+        const promises = [];
+
+        this.#emitToEachListener(criteria, data, ([err, result]) => {
+
+            promises.push(err ? Promise.reject(err) : result);
+        });
+
+        return await Promise.allSettled(promises);
+    }
+
+    #emitToEachListener(criteria, data, fn) {
+
+        criteria = internals.criteria(criteria);
+
+        const name = criteria.name;
+        Hoek.assert(name, 'Criteria missing event name');
+
+        const event = this.#listeners.get(name);
+        Hoek.assert(event, `Unknown event ${name}`);
+
+        if (!event.handlers) {
+            return;
+        }
+
+        Hoek.assert(!criteria.channel || typeof criteria.channel === 'string', 'Invalid channel name');
+        Hoek.assert(!criteria.channel || !event.flags.channels || event.flags.channels.has(criteria.channel), `Unknown ${criteria.channel} channel`);
+        Hoek.assert(!event.flags.spread || Array.isArray(data) || typeof data === 'function', 'Data must be an array for spread event');
+
+        if (typeof criteria.tags === 'string') {
+            criteria = { ...criteria };
+            criteria.tags = { [criteria.tags]: true };
+        }
+
+        if (criteria.tags &&
+            Array.isArray(criteria.tags)) {
+
+            // Map array to object
+
+            const tags = {};
+            for (const tag of criteria.tags) {
+                tags[tag] = true;
+            }
+
+            criteria = { ...criteria };
+            criteria.tags = tags;
+        }
+
+        let generated = false;
+
+        for (const handler of event.handlers) {
+            if (handler.channels &&
+                !(criteria.channel && handler.channels.has(criteria.channel))) {
+
+                continue;
+            }
+
+            if (handler.filter) {
+                if (!criteria.tags) {
+                    continue;
+                }
+
+                const match = Hoek.intersect(criteria.tags, handler.filter.tags, { first: !handler.filter.all });
+                if (!match ||
+                    handler.filter.all && match.length !== handler.filter.tags.length) {
+
+                    continue;
+                }
+            }
+
+            // Found a listener, now prepare to call it
+
+            if (handler.count) {
+                --handler.count;
+                if (handler.count < 1) {
+                    event.removeListener(handler.listener);
+                }
+            }
+
+            if (!generated &&
+                typeof data === 'function') {
+
+                data = data();
+                generated = true;
+            }
+
+            const update = event.flagged('clone', handler) ? Hoek.clone(data) : data;
+            const args = event.flagged('spread', handler) && Array.isArray(update) ? update.slice(0) : [update];
+
+            if (event.flagged('tags', handler) &&
+                criteria.tags) {
+
+                args.push(criteria.tags);
+            }
+
+            // Call the listener
+
+            try {
+                if (handler.context) {
+                    fn([null, handler.listener.apply(handler.context, args)]);
+                }
+                else {
+                    fn([null, handler.listener(...args)]);
+                }
+            }
+            catch (err) {
+                fn([err, null]);
+            }
+        }
+    }
+
+    addListener(criteria, listener, context) {
+
+        criteria = internals.criteria(criteria);
+        criteria.listener = listener;
+        criteria.context = context;
+
+        if (criteria.filter &&
+            (typeof criteria.filter === 'string' || Array.isArray(criteria.filter))) {
+
+            criteria = { ...criteria };
+            criteria.filter = { tags: criteria.filter };
+        }
+
+        criteria = Validate.attempt(criteria, internals.schema.listener, 'Invalid event listener options');
+
+        const name = criteria.name;
+        const event = this.#listeners.get(name);
+        Hoek.assert(event, `Unknown event ${name}`);
+
+        event.addHandler(criteria);
+
+        return this;
+    }
+
+    on(criteria, listener, context) {
+
+        return this.addListener(criteria, listener, context);
+    }
+
+    once(criteria, listener, context) {
+
+        criteria = { ...internals.criteria(criteria), count: 1 };
+
+        if (listener) {
+            return this.addListener(criteria, listener, context);
+        }
+
+        return new Promise((resolve) => {
+
+            this.addListener(criteria, (...args) => resolve(args));
+        });
+    }
+
+    few(criteria) {
+
+        Hoek.assert(typeof criteria === 'object', 'Criteria must be an object');
+        Hoek.assert(criteria.count, 'Criteria must include a count limit');
+
+        const team = new Teamwork.Team({ meetings: criteria.count });
+        this.addListener(criteria, (...args) => team.attend(args));
+        return team.work;
+    }
+
+    removeListener(name, listener) {
+
+        Hoek.assert(this.#listeners.has(name), `Unknown event ${name}`);
+        Hoek.assert(typeof listener === 'function', 'Listener must be a function');
+
+        this.#listeners.get(name).removeListener(listener);
+        return this;
+    }
+
+    off(name, listener) {
+
+        return this.removeListener(name, listener);
+    }
+
+    removeAllListeners(name) {
+
+        Hoek.assert(this.#listeners.has(name), `Unknown event ${name}`);
+        this.#listeners.get(name).handlers = null;
+        return this;
+    }
+
+    hasListeners(name) {
+
+        Hoek.assert(this.#listeners.has(name), `Unknown event ${name}`);
+        return !!this.#listeners.get(name).handlers;
+    }
+};
+
+
+internals.EventListener = class {
+
+    constructor(flags) {
+
+        this.flags = flags;
+        this.handlers = null;
+    }
+
+    addHandler(handler) {
+
+        Hoek.assert(!handler.channels || !this.flags.channels || Hoek.intersect(this.flags.channels, handler.channels).length === handler.channels.size, `Unknown event channels ${handler.channels && [...handler.channels].join(', ')}`);
+
+        this.handlers = this.handlers ? [...this.handlers, handler] : [handler];     // Don't mutate
+    }
+
+    removeListener(listener) {
+
+        const filtered = this.handlers?.filter((item) => item.listener !== listener);
+        this.handlers = filtered?.length ? filtered : null;
+    }
+
+    flagged(name, handler) {
+
+        return handler[name] ?? this.flags[name] ?? false;
+    }
+};
+
+
+internals.criteria = function (criteria) {
+
+    if (typeof criteria === 'string') {
+        return { name: criteria };
+    }
+
+    return criteria;
+};
diff --git a/node_modules/@hapi/podium/package.json b/node_modules/@hapi/podium/package.json
new file mode 100755
index 0000000..1365c58
--- /dev/null
+++ b/node_modules/@hapi/podium/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "@hapi/podium",
+  "description": "Node compatible event emitter with extra features",
+  "version": "5.0.2",
+  "repository": "git://github.com/hapijs/podium",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "emitter",
+    "event"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/teamwork": "^6.0.0",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -r html -o coverage.html -a @hapi/code -L"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/shot/LICENSE.md b/node_modules/@hapi/shot/LICENSE.md
new file mode 100755
index 0000000..1a04bbf
--- /dev/null
+++ b/node_modules/@hapi/shot/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2012-2021, Sideway Inc, and project contributors
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/shot/README.md b/node_modules/@hapi/shot/README.md
new file mode 100755
index 0000000..2f2381f
--- /dev/null
+++ b/node_modules/@hapi/shot/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/shot
+
+#### Injects a fake HTTP request/response into your node server logic.
+
+**shot** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/shot/)
+- [Versions status](https://hapi.dev/resources/status/#shot) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/shot/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/shot/lib/index.d.ts b/node_modules/@hapi/shot/lib/index.d.ts
new file mode 100644
index 0000000..235c471
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/index.d.ts
@@ -0,0 +1,186 @@
+import { EventEmitter } from 'events';
+import {
+    IncomingHttpHeaders,
+    IncomingMessage,
+    OutgoingHttpHeaders,
+    ServerResponse
+} from 'http';
+import { Readable, Stream } from 'stream';
+import { UrlObject } from 'url';
+
+interface MockSocket extends EventEmitter {
+    readonly remoteAddress: string;
+    end(): void;
+    setTimeout(): void;
+}
+
+export interface InjectedRequest extends Readonly<Readable> {
+    readonly httpVersion: '1.1';
+    readonly method: string;
+    readonly url: string;
+    readonly headers: Readonly<IncomingHttpHeaders>;
+    readonly socket: MockSocket;
+    readonly connection: MockSocket;
+}
+
+export type MaybeInjectedRequest = InjectedRequest | IncomingMessage;
+
+export interface ResponseObject {
+    /**
+     * An object containing the raw request and response objects.
+     */
+    raw: {
+        /**
+         * The simulated request object.
+         */
+        req: InjectedRequest;
+
+        /**
+         * The simulated response object.
+         */
+        res: ServerResponse;
+    };
+
+    /**
+     * An object containing the response headers.
+     */
+    headers: OutgoingHttpHeaders;
+
+    /**
+     * The HTTP status code. If response is aborted before headers are sent, the code is `499`.
+     */
+    statusCode: number;
+
+    /**
+     * The HTTP status message.
+     */
+    statusMessage: string;
+
+    /**
+     * The payload as a UTF-8 encoded string.
+     */
+    payload: string;
+
+    /**
+     * The raw payload as a Buffer.
+     */
+    rawPayload: Buffer;
+
+    /**
+     * An object containing the response trailers
+     */
+    trailers: NodeJS.Dict<string>;
+
+    /**
+     * A boolean which is `true` for aborted, ie. not fully transmitted, responses.
+     */
+    aborted?: true;
+}
+
+type PartialURL = Pick<UrlObject, 'protocol' | 'hostname' | 'port' | 'query'> & { pathname: string };
+
+export interface RequestOptions {
+
+    /**
+     * The request URL.
+     */
+    url: string | PartialURL;
+
+    /**
+     * The HTTP request method.
+     *
+     * @default 'GET'
+     */
+    method?: string;
+
+    /**
+     * The HTTP HOST header value to be used if no header is provided,
+     * and the url does not include an authority component.
+     *
+     * @default 'localhost'
+     */
+    authority?: string;
+
+    /**
+     * The request headers.
+     */
+    headers?: OutgoingHttpHeaders;
+
+    /**
+     * The client remote address.
+     *
+     * @default '127.0.0.1'
+     */
+    remoteAddress?: string;
+
+    /**
+     * A request payload. Can be a string, Buffer, Stream or object that will be stringified.
+     */
+    payload?: string | Buffer | Stream | object;
+
+    /**
+     * an object containing flags to simulate various conditions:
+    */
+    simulate?: {
+
+        /**
+         * indicates whether the request will fire an end event.
+         *
+         * @default true
+         */
+        end?: boolean;
+
+        /**
+         * indicates whether the request payload will be split into chunks.
+         *
+         * @default false
+         */
+        split?: boolean;
+
+        /**
+         * whether the request will emit an error event.
+         * If set to true, the emitted error will have a message of 'Simulated'.
+         *
+         * @default false
+         */
+        error?: boolean;
+
+        /**
+         * whether the request will emit a close event.
+         *
+         * @default true
+         */
+        close?: boolean;
+    };
+
+    /**
+     * Optional flag to validate this options object.
+     *
+     * @default true
+     */
+    validate?: boolean;
+}
+
+type InjectionListener = (req: InjectedRequest, res: ServerResponse) => void;
+
+type MaybeInjectionListener = (req: MaybeInjectedRequest, res: ServerResponse) => void;
+
+/**
+ * Injects a fake request into an HTTP server.
+ *
+ * @param dispatchFunc - Listener function. Similar as you would pass to Http.createServer when making a node HTTP server.
+ * @param options - Request options object or string with request url.
+ *
+ * @return A Promise that resolves with a ResponseObject object
+ */
+export function inject(dispatchFunc: InjectionListener, options: RequestOptions | string): Promise<ResponseObject>;
+export function inject(dispatchFunc: MaybeInjectionListener, options: RequestOptions | string): Promise<ResponseObject>;
+
+/**
+ * Checks if given object is a Shot Request object.
+ *
+ * @param obj - the req or res object to test
+ *
+ * @return true if the object is a shot request, otherwise false.
+ */
+export function isInjection(obj: MaybeInjectedRequest | ServerResponse): boolean;
diff --git a/node_modules/@hapi/shot/lib/index.js b/node_modules/@hapi/shot/lib/index.js
new file mode 100755
index 0000000..53406ba
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/index.js
@@ -0,0 +1,65 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+const Validate = require('@hapi/validate');
+
+const Request = require('./request');
+const Response = require('./response');
+const Symbols = require('./symbols');
+
+
+const internals = {};
+
+
+internals.options = Validate.object().keys({
+    url: Validate.alternatives([
+        Validate.string(),
+        Validate.object().keys({
+            protocol: Validate.string(),
+            hostname: Validate.string(),
+            port: Validate.any(),
+            pathname: Validate.string().required(),
+            query: Validate.any()
+        })
+    ])
+        .required(),
+    headers: Validate.object(),
+    payload: Validate.any(),
+    simulate: {
+        end: Validate.boolean(),
+        split: Validate.boolean(),
+        error: Validate.boolean(),
+        close: Validate.boolean()
+    },
+    authority: Validate.string(),
+    remoteAddress: Validate.string(),
+    method: Validate.string(),
+    validate: Validate.boolean()
+});
+
+
+exports.inject = async function (dispatchFunc, options) {      // eslint-disable-line require-await
+
+    options = (typeof options === 'string' ? { url: options } : options);
+
+    if (options?.validate !== false) {                                                           // Defaults to true
+        Hoek.assert(typeof dispatchFunc === 'function', 'Invalid or missing dispatch function');
+        Validate.assert(options ?? null, internals.options, 'Invalid options:');
+    }
+
+    return new Promise((resolve, reject) => {
+
+        const req = new Request(options);
+        const res = new Response(req, resolve);
+
+        req.prepare()
+            .then(() => dispatchFunc(req, res))
+            .catch(reject);
+    });
+};
+
+
+exports.isInjection = function (obj) {
+
+    return !!obj[Symbols.injection];
+};
diff --git a/node_modules/@hapi/shot/lib/payload.js b/node_modules/@hapi/shot/lib/payload.js
new file mode 100644
index 0000000..9143765
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/payload.js
@@ -0,0 +1,53 @@
+'use strict';
+
+const Events = require('events');
+const Stream = require('stream');
+
+
+const internals = {};
+
+
+exports.encode = function (payload) {
+
+    if (payload instanceof Stream) {
+        return internals.encodeStreamPayload(payload);
+    }
+
+    const headers = Object.create(null);
+
+    if (payload) {
+        if (typeof payload !== 'string' &&
+            !Buffer.isBuffer(payload)) {
+
+            payload = JSON.stringify(payload);
+            headers['content-type'] = 'application/json';
+        }
+
+        // Compute the content-length for the corresponding payload in case none set
+
+        headers['content-length'] = (Buffer.isBuffer(payload) ? payload.length : Buffer.byteLength(payload)).toString();
+    }
+
+    return { payload, headers };
+};
+
+
+internals.encodeStreamPayload = function (stream) {
+
+    const headers = Object.create(null);
+
+    const deferredPayload = (async () => {
+
+        const chunks = [];
+        stream.on('data', (chunk) => chunks.push(Buffer.from(chunk)));
+
+        await Events.once(stream, 'end');
+
+        const payload = Buffer.concat(chunks);
+        headers['content-length'] = headers['content-length'] || payload.length;
+
+        return payload;
+    })();
+
+    return { payload: deferredPayload, headers };
+};
diff --git a/node_modules/@hapi/shot/lib/request.js b/node_modules/@hapi/shot/lib/request.js
new file mode 100755
index 0000000..56ec3b3
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/request.js
@@ -0,0 +1,124 @@
+'use strict';
+
+const Events = require('events');
+const Stream = require('stream');
+const Url = require('url');
+
+const Payload = require('./payload');
+const Symbols = require('./symbols');
+
+
+const internals = {};
+
+
+exports = module.exports = internals.Request = class extends Stream.Readable {
+
+    constructor(options) {
+
+        super({
+            emitClose: options.simulate?.close !== false,
+            autoDestroy: true        // This is the default in node 14+
+        });
+
+        // options: method, url, payload, headers, remoteAddress
+
+        let url = options.url;
+        if (typeof url === 'object') {
+            url = Url.format(url);
+        }
+
+        const uri = Url.parse(url);
+        this.url = uri.path;
+
+        this.httpVersion = '1.1';
+        this.method = (options.method ? options.method.toUpperCase() : 'GET');
+
+        const { payload, headers: baseHeaders } = Payload.encode(options.payload ?? null);
+
+        this.headers = baseHeaders;
+
+        const headers = options.headers ?? {};
+        for (const field of Object.keys(headers)) {
+            this.headers[field.toLowerCase()] = headers[field];
+        }
+
+        this.headers['user-agent'] = this.headers['user-agent'] ?? 'shot';
+
+        const hostHeaderFromUri = function () {
+
+            if (uri.port) {
+                return uri.host;
+            }
+
+            if (uri.protocol) {
+                return uri.hostname + (uri.protocol === 'https:' ? ':443' : ':80');
+            }
+
+            return null;
+        };
+
+        this.headers.host = this.headers.host ?? hostHeaderFromUri() ?? options.authority ?? 'localhost:80';
+
+        // NOTE connection is deprecated in favor of socket as of node v13
+
+        this.socket = this.connection = new internals.MockSocket(options);
+
+        // Use _shot namespace to avoid collision with Node
+
+        this._shot = {
+            payload,
+            simulate: options.simulate ?? {}
+        };
+
+        return this;
+    }
+
+    async prepare() {
+
+        this._shot.payload = await this._shot.payload;
+    }
+
+    _read(size) {
+
+        setImmediate(() => {
+
+            if (this._shot.payload) {
+                if (this._shot.simulate.split) {
+                    this.push(this._shot.payload.slice(0, 1));
+                    this.push(this._shot.payload.slice(1));
+                }
+                else {
+                    this.push(this._shot.payload);
+                }
+            }
+
+            if (this._shot.simulate.error) {
+                this.destroy(new Error('Simulated'));
+            }
+            else if (this._shot.simulate.end !== false) {        // 'end' defaults to true
+                this.push(null);
+            }
+            else {
+                this.destroy();
+            }
+        });
+    }
+};
+
+
+internals.Request.prototype[Symbols.injection] = true;
+
+internals.MockSocket = class MockSocket extends Events.EventEmitter {
+
+    constructor({ remoteAddress }) {
+
+        super();
+
+        this.remoteAddress = remoteAddress ?? '127.0.0.1';
+    }
+
+    // Net.Socket APIs used by hapi
+
+    end() {}
+    setTimeout() {}
+};
diff --git a/node_modules/@hapi/shot/lib/response.js b/node_modules/@hapi/shot/lib/response.js
new file mode 100755
index 0000000..8e07182
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/response.js
@@ -0,0 +1,163 @@
+'use strict';
+
+const Http = require('http');
+const Stream = require('stream');
+
+const Hoek = require('@hapi/hoek');
+
+const Symbols = require('./symbols');
+
+
+const internals = {};
+
+
+exports = module.exports = internals.Response = class extends Http.ServerResponse {
+
+    constructor(req, onEnd) {
+
+        super({ method: req.method, httpVersionMajor: 1, httpVersionMinor: 1 });
+        this._shot = { headers: null, trailers: {}, payloadChunks: [] };
+        this.assignSocket(internals.nullSocket());
+
+        this.socket.on('error', Hoek.ignore);        // The socket can be destroyed with an error
+
+        if (req._shot.simulate.close) {
+            // Ensure premature, manual close is forwarded to res.
+            // In HttpServer the socket closing actually triggers close on both req and res.
+            req.once('close', () => {
+
+                process.nextTick(() => this.destroy());
+            });
+        }
+
+        const finalize = (aborted) => {
+
+            const res = internals.payload(this);
+            res.raw.req = req;
+            if (aborted) {
+                res.aborted = aborted;
+                if (!this.headersSent) {
+                    res.statusCode = 499;
+                }
+            }
+
+            this.removeListener('close', abort);
+
+            req.destroy();
+            process.nextTick(() => onEnd(res));
+        };
+
+        const abort = () => finalize(true);
+
+        this.once('finish', finalize);
+
+        // Add fallback listener that will not be called if 'finish' is emitted first
+
+        this.on('close', abort);
+    }
+
+    writeHead(...args) {
+
+        // Find the headers object if one was provided. If a headers object is present, call setHeader()
+        // on the first valid header, and then break out of the loop and call writeHead(). By calling
+        // setHeader(), Node will materialize a headers object.
+
+        const headers = args[args.length - 1];
+
+        if (typeof headers === 'object' && headers !== null) {
+            const headerNames = Object.keys(headers);
+
+            for (let i = 0; i < headerNames.length; ++i) {
+                const name = headerNames[i];
+
+                try {
+                    this.setHeader(name, headers[name]);
+                    break;
+                }
+                catch (ignoreErr) {} // Let the real writeHead() handle errors.
+            }
+        }
+
+        const result = super.writeHead(...args);
+
+        this._shot.headers = this.getHeaders();
+
+        // Add raw headers
+
+        ['Date', 'Connection', 'Transfer-Encoding'].forEach((name) => {
+
+            const regex = new RegExp('\\r\\n' + name + ': ([^\\r]*)\\r\\n');
+            const field = this._header.match(regex);
+            if (field) {
+                this._shot.headers[name.toLowerCase()] = field[1];
+            }
+        });
+
+        return result;
+    }
+
+    write(data, encoding, callback) {
+
+        super.write(data, encoding, callback);
+        this._shot.payloadChunks.push(Buffer.from(data, encoding));
+        return true;                                                    // Write always returns false when disconnected
+    }
+
+    end(data, encoding, callback) {
+
+        if (data) {
+            this.write(data, encoding);
+        }
+
+        super.end(callback);
+        this.emit('finish');
+    }
+
+    addTrailers(trailers) {
+
+        for (const key in trailers) {
+            this._shot.trailers[key.toLowerCase().trim()] = trailers[key].toString().trim();
+        }
+    }
+};
+
+
+internals.Response.prototype[Symbols.injection] = true;
+
+
+internals.payload = function (response) {
+
+    // Prepare response object
+
+    const res = {
+        raw: {
+            res: response
+        },
+        headers: response._shot.headers,
+        statusCode: response.statusCode,
+        statusMessage: response.statusMessage,
+        trailers: {}
+    };
+
+    // Prepare payload and trailers
+
+    const rawBuffer = Buffer.concat(response._shot.payloadChunks);
+    res.rawPayload = rawBuffer;
+    res.payload = rawBuffer.toString();
+    res.trailers = response._shot.trailers;
+
+    return res;
+};
+
+
+// Throws away all written data to prevent response from buffering payload
+
+internals.nullSocket = function () {
+
+    return new Stream.Writable({
+        write(chunk, encoding, callback) {
+
+            setImmediate(callback);
+        }
+    });
+};
diff --git a/node_modules/@hapi/shot/lib/symbols.js b/node_modules/@hapi/shot/lib/symbols.js
new file mode 100755
index 0000000..10736ce
--- /dev/null
+++ b/node_modules/@hapi/shot/lib/symbols.js
@@ -0,0 +1,6 @@
+'use strict';
+
+const internals = {};
+
+
+exports.injection = Symbol('injection');
diff --git a/node_modules/@hapi/shot/package.json b/node_modules/@hapi/shot/package.json
new file mode 100644
index 0000000..399ad8e
--- /dev/null
+++ b/node_modules/@hapi/shot/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "@hapi/shot",
+  "description": "Injects a fake HTTP request/response into a node HTTP server",
+  "version": "6.0.3",
+  "repository": "git://github.com/hapijs/shot",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "utilities",
+    "http",
+    "debug",
+    "test"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html -L"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/somever/LICENSE.md b/node_modules/@hapi/somever/LICENSE.md
new file mode 100755
index 0000000..6320f97
--- /dev/null
+++ b/node_modules/@hapi/somever/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2018-2022, Project contributors
+Copyright (c) 2018-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/somever/README.md b/node_modules/@hapi/somever/README.md
new file mode 100644
index 0000000..1cc8b24
--- /dev/null
+++ b/node_modules/@hapi/somever/README.md
@@ -0,0 +1,19 @@
+<a href="http://hapijs.com"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/somever
+
+#### Semantic versioning rules parser, compatible with version ranges used in package.json files and the canonical [semver](https://www.npmjs.com/package/semver) module.
+
+**somever** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/module/somever/)
+- [Versions status](https://hapi.dev/resources/status/#somever)
+- [Changelog](https://hapi.dev/family/somever/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
+
+
diff --git a/node_modules/@hapi/somever/lib/index.js b/node_modules/@hapi/somever/lib/index.js
new file mode 100755
index 0000000..a98156a
--- /dev/null
+++ b/node_modules/@hapi/somever/lib/index.js
@@ -0,0 +1,540 @@
+'use strict';
+
+const Bounce = require('@hapi/bounce');
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {
+    maxLength: 256,
+    wildcards: ['x', 'X', '*'],
+    any: Symbol('any')
+};
+
+//                              1:major         2:minor         3:patch          4:prerelease  5:build
+//                              A         aB    C         cD    E         eF     G     gf H    I  ih d b
+internals.versionRx = /^\s*[vV]?(\d+|[xX*])(?:\.(\d+|[xX*])(?:\.(\d+|[xX*])(?:\-?([^+]+))?(?:\+(.+))?)?)?\s*$/;
+
+internals.strict = {
+    tokenRx: /^[-\dA-Za-z]+(?:\.[-\dA-Za-z]+)*$/,
+    numberRx: /^((?:0)|(?:[1-9]\d*))$/
+};
+
+
+exports.version = function (version, options) {
+
+    return new internals.Version(version, options);
+};
+
+
+exports.range = function (range) {
+
+    return new internals.Range(range);
+};
+
+
+exports.match = function (version, range, options) {
+
+    try {
+        return exports.range(range).match(version, options);
+    }
+    catch (err) {
+        Bounce.rethrow(err, 'system');
+        return false;
+    }
+};
+
+
+exports.compare = function (a, b, options = {}) {
+
+    let aFirst = -1;
+    let bFirst = 1;
+
+    a = exports.version(a, options);
+    b = exports.version(b, options);
+
+    // Mark incompatible prereleases
+
+    if (options.range && !options.includePrerelease &&
+        a.prerelease.length &&
+        (a.major !== b.major || a.minor !== b.minor || a.patch !== b.patch || !b.prerelease.length)) {
+
+        aFirst = -2;
+        bFirst = 2;
+    }
+
+    // Compare versions
+
+    for (let i = 0; i < 3; ++i) {
+        const av = a.dots[i];
+        const bv = b.dots[i];
+
+        if (av === bv ||
+            av === internals.any ||                             // Wildcard is equal to everything
+            bv === internals.any) {
+
+            continue;
+        }
+
+        return av - bv < 0 ? aFirst : bFirst;
+    }
+
+    // Compare prerelease
+
+    // With includePrerelease patch wildcard encompasses prereleases, otherwise prerelease < none
+
+    if (!a.prerelease.length && !b.prerelease.length) {
+        return 0;
+    }
+    else if (!b.prerelease.length) {
+        return options.includePrerelease && b.patch === internals.any ? 0 : aFirst;
+    }
+    else if (!a.prerelease.length) {
+        return options.includePrerelease && a.patch === internals.any ? 0 : bFirst;
+    }
+
+    for (let i = 0; ; ++i) {
+        const ai = a.prerelease[i];
+        const bi = b.prerelease[i];
+
+        if (ai === undefined &&
+            bi === undefined) {
+
+            return 0;
+        }
+
+        if (ai === bi) {
+            continue;
+        }
+
+        if (ai === undefined) {
+            return aFirst;
+        }
+
+        if (bi === undefined) {
+            return bFirst;
+        }
+
+        const an = Number.isFinite(ai);
+        const bn = Number.isFinite(bi);
+
+        if (an !== bn) {
+            return an ? aFirst : bFirst;
+        }
+
+        return (ai < bi ? aFirst : bFirst);
+    }
+};
+
+
+internals.Version = class {
+
+    constructor(version, options = {}) {
+
+        Hoek.assert(version, 'Missing version argument');
+
+        if (version instanceof internals.Version) {
+            return version;
+        }
+
+        if (typeof version === 'object') {
+            this._copy(version);
+        }
+        else {
+            this._parse(version, options);
+        }
+
+        this.format();
+    }
+
+    _copy(version) {
+
+        this.major = version.major === undefined ? internals.any : version.major;
+        this.minor = version.minor === undefined ? internals.any : version.minor;
+        this.patch = version.patch === undefined ? internals.any : version.patch;
+        this.prerelease = version.prerelease ?? [];
+        this.build = version.build ?? [];
+    }
+
+    _parse(version, options) {
+
+        Hoek.assert(typeof version === 'string', 'Version argument must be a string');
+        Hoek.assert(version.length <= internals.maxLength, 'Version string too long');
+
+        const match = version.match(internals.versionRx);
+        if (!match) {
+            throw new Error(`Invalid version string format: ${version}`);
+        }
+
+        this.major = internals.Version._number(match[1], 'major', options);
+        this.minor = internals.Version._number(match[2] || 'x', 'minor', options);
+        this.patch = internals.Version._number(match[3] || 'x', 'patch', options);
+
+        this.prerelease = internals.Version._sub(match[4], 'prerelease', options);
+        this.build = internals.Version._sub(match[5], 'build', options);
+    }
+
+    static _number(string, source, options) {
+
+        if (internals.wildcards.includes(string)) {
+            return internals.any;
+        }
+
+        if (options.strict) {
+            Hoek.assert(string.match(internals.strict.numberRx), 'Value must be 0 or a number without a leading zero:', source);
+        }
+
+        const value = parseInt(string, 10);
+        Hoek.assert(value <= Number.MAX_SAFE_INTEGER, 'Value must be positive and less than max safe integer:', source);
+        return value;
+    }
+
+    static _sub(string, source, options) {
+
+        if (!string) {
+            return [];
+        }
+
+        if (options.strict) {
+            Hoek.assert(string.match(internals.strict.tokenRx), 'Value can only contain dot-separated hyphens, digits, a-z or A-Z:', source);
+        }
+
+        const subs = [];
+        const parts = string.split('.');
+        for (const part of parts) {
+            if (!part) {
+                throw new Error(`Invalid empty ${source} segment`);
+            }
+
+            subs.push(part.match(/^\d+$/) ? internals.Version._number(part, source, { strict: options.strict }) : part);
+        }
+
+        return subs;
+    }
+
+    format() {
+
+        this.version = `${internals.dot(this.major)}.${internals.dot(this.minor)}.${internals.dot(this.patch)}${internals.token(this.prerelease, '-')}${internals.token(this.build, '+')}`;
+        this.dots = [this.major, this.minor, this.patch];
+        this.wildcard = this.major === internals.any && this.minor === internals.any && this.patch === internals.any && !this.prerelease.length;
+    }
+
+    toString() {
+
+        return this.version;
+    }
+
+    compare(to, options) {
+
+        return internals.Version.compare(this, to, options);
+    }
+
+    static compare(a, b, options = {}) {
+
+        return exports.compare(a, b, options);
+    }
+};
+
+
+internals.dot = (v) => {
+
+    return (v === internals.any ? 'x' : v);
+};
+
+
+internals.token = (v, prefix) => {
+
+    if (!v.length) {
+        return '';
+    }
+
+    return `${prefix}${v.join('.')}`;
+};
+
+
+internals.Range = class {
+
+    constructor(range, options) {
+
+        this._settings = Object.assign({}, options);    // Shallow cloned
+        this._anything = false;
+        this._or = [];                                  // [and, and, ..., active]
+        this._active = null;
+
+        if (range !== undefined) {
+            this.pattern(range);
+        }
+
+        this._another();
+    }
+
+    _another() {
+
+        if (!this._active ||
+            this._active.rules.length) {
+
+            this._active = { rules: [] };
+            this._or.push(this._active);
+        }
+
+        return this;
+    }
+
+    _rule(operator, version) {
+
+        version = exports.version(version, this._settings);
+
+        const compare = internals.operator(operator);
+        this._active.rules.push({ compare, version, operator });
+
+        return this;
+    }
+
+    get or() {
+
+        return this._another();
+    }
+
+    equal(version) {
+
+        return this._rule('=', version);
+    }
+
+    above(version) {
+
+        return this._rule('>', version);
+    }
+
+    below(version) {
+
+        return this._rule('<', version);
+    }
+
+    between(from, to) {
+
+        this._rule('>=', from);
+        this._rule('<=', to);
+        return this;
+    }
+
+    minor(version) {        // ~1.2.3
+
+        // minor(2.5.7)     ->      2.5.7 <= X < 2.6.0
+        // minor(2.5.x)     ->      2.5.0 <= X < 2.6.0
+        // minor(2.x.x)     ->      2.0.0 <= X < 3.0.0
+
+        version = exports.version(version, this._settings);
+
+        if (version.major === internals.any) {
+            this._rule('=', version);
+            return this;
+        }
+
+        this._rule('>=', version);
+
+        if (version.minor === internals.any) {
+            this._rule('<', { major: version.major + 1, minor: 0, patch: 0, prerelease: [0] });
+        }
+        else {
+            this._rule('<', { major: version.major, minor: version.minor + 1, patch: 0, prerelease: [0] });
+        }
+
+        return this;
+    }
+
+    compatible(version) {       // ^1.2.3
+
+        // compatible(2.5.7)     ->      2.5.7 <= X < 3.0.0
+        // compatible(2.x.x)     ->      2.0.0 <= X < 3.0.0
+        // compatible(0.1.x)     ->      0.1.0 <= X < 0.2.0
+
+        version = exports.version(version, this._settings);
+
+        if (version.major === internals.any) {
+            this._rule('=', version);
+            return this;
+        }
+
+        this._rule('>=', version);
+
+        if (version.major === 0 &&
+            version.minor !== internals.any) {
+
+            if (version.minor === 0) {
+                this._rule('<', { major: 0, minor: 0, patch: version.patch + 1, prerelease: [0] });
+            }
+            else {
+                this._rule('<', { major: 0, minor: version.minor + 1, patch: 0, prerelease: [0] });
+            }
+        }
+        else {
+            this._rule('<', { major: version.major + 1, minor: 0, patch: 0, prerelease: [0] });
+        }
+
+        return this;
+    }
+
+    pattern(range) {
+
+        try {
+            this._pattern(range);
+            return this;
+        }
+        catch (err) {
+            throw new Error(`Invalid range: "${range}" because: ${err.message}`);
+        }
+    }
+
+    _pattern(range) {
+
+        if (range === '') {
+            this._anything = true;
+            return;
+        }
+
+        const normalized = internals.normalize(range);
+        const ors = normalized.split(/\s*\|\|\s*/);
+        for (const condition of ors) {
+            if (!condition) {
+                this._anything = true;
+                return;
+            }
+
+            this._another();
+
+            const ands = condition.split(/\s+/);
+            for (const and of ands) {
+
+                // Hyphen range
+
+                const hyphen = and.indexOf('@');            // Originally " - "
+                if (hyphen !== -1) {
+                    const from = and.slice(0, hyphen);
+                    const to = and.slice(hyphen + 1);
+                    this.between(from, to);
+                    continue;
+                }
+
+                // Prefix
+
+                const parts = and.match(/^(\^|~|<\=|>\=|<|>|\=)?(.+)$/);
+                const operator = parts[1];
+                const version = exports.version(parts[2], this._settings);
+
+                if (version.wildcard) {
+                    this._anything = true;
+                    return;
+                }
+
+                // Tilde
+
+                if (operator === '~') {
+                    this.minor(version);
+                    continue;
+                }
+
+                // Caret
+
+                if (operator === '^') {
+                    this.compatible(version);
+                    continue;
+                }
+
+                // One sided range
+
+                if (operator) {
+                    this._rule(operator, version);
+                    continue;
+                }
+
+                // Version
+
+                this.equal(version);
+            }
+        }
+    }
+
+    match(version, options = {}) {
+
+        version = exports.version(version, this._settings);       // Always parse to validate
+
+        if (this._anything) {
+            return !!options.includePrerelease || !version.prerelease.length;
+        }
+
+        for (const { rules } of this._or) {
+            if (!rules.length) {
+                continue;
+            }
+
+            let matches = 0;
+            let excludes = 0;
+
+            for (const rule of rules) {
+                const compare = version.compare(rule.version, Object.assign(this._settings, options, { range: true }));
+                const exclude = Math.abs(compare) === 2;
+
+                if (rule.compare.includes(compare / (exclude ? 2 : 1))) {
+                    ++matches;
+                    if (exclude) {
+                        ++excludes;
+                    }
+                }
+                else {
+                    break;
+                }
+            }
+
+            if (matches === rules.length &&
+                excludes < matches) {
+
+                return true;
+            }
+        }
+
+        return false;
+    }
+
+    toString() {
+
+        if (this._anything) {
+            return '*';
+        }
+
+        let string = '';
+        for (const { rules } of this._or) {
+            if (!rules.length) {
+                continue;
+            }
+
+            const conditions = [];
+            for (const rule of rules) {
+                conditions.push(`${rule.operator !== '=' ? rule.operator : ''}${rule.version.version}`);
+            }
+
+            string += (string ? '||' : '') + conditions.join(' ');
+        }
+
+        return string;
+    }
+};
+
+
+internals.operator = function (compare) {
+
+    switch (compare) {
+        case '=': return [0];
+        case '>': return [1];
+        case '>=': return [0, 1];
+        case '<': return [-1];
+        case '<=': return [0, -1];
+    }
+};
+
+
+internals.normalize = function (range) {
+
+    return range
+        .replace(/ \- /g, '@')                                                          // Range to excluded symbol
+        .replace(/~>/g, '~')                                                            // Legacy npm operator
+        .replace(/(\^|~|<\=|>\=|<|>|\=)\s*([^\s]+)/g, ($0, $1, $2) => `${$1}${$2}`);    // Space between operator and version
+};
diff --git a/node_modules/@hapi/somever/package.json b/node_modules/@hapi/somever/package.json
new file mode 100644
index 0000000..34bba9f
--- /dev/null
+++ b/node_modules/@hapi/somever/package.json
@@ -0,0 +1,34 @@
+{
+  "name": "@hapi/somever",
+  "description": "Semantic versioning rules parser",
+  "version": "4.1.1",
+  "repository": "git://github.com/hapijs/somever",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "semantic",
+    "version",
+    "semver"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/bounce": "^3.0.1",
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/statehood/LICENSE.md b/node_modules/@hapi/statehood/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/statehood/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/statehood/README.md b/node_modules/@hapi/statehood/README.md
new file mode 100755
index 0000000..2d5d1e9
--- /dev/null
+++ b/node_modules/@hapi/statehood/README.md
@@ -0,0 +1,5 @@
+<a href="http://hapijs.com"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/statehood
+
+#### HTTP State Management Utilities.
diff --git a/node_modules/@hapi/statehood/lib/index.d.ts b/node_modules/@hapi/statehood/lib/index.d.ts
new file mode 100644
index 0000000..2894308
--- /dev/null
+++ b/node_modules/@hapi/statehood/lib/index.d.ts
@@ -0,0 +1,186 @@
+import type { Boom } from '@hapi/boom';
+import { SealOptions, SealOptionsSub } from '@hapi/iron';
+
+export { SealOptions, SealOptionsSub };
+
+export type SameSitePolicy = false | 'None' | 'Lax' | 'Strict';
+
+export interface StateOptions<HapiRequest> {
+  /**
+   * If `false`, allows any cookie value including values in violation of [RFC 6265](https://tools.ietf.org/html/rfc6265).
+   *
+   * @default true
+   */
+  strictHeader?: boolean | undefined;
+
+  /**
+   * If `true`, errors are ignored and treated as missing cookies.
+   */
+  ignoreErrors?: boolean | undefined;
+
+  /**
+   * Sets the `Secure` flag.
+   *
+   * @default true
+   */
+  isSecure?: boolean | undefined;
+
+  /**
+   * Sets the `HttpOnly` flag.
+   *
+   * @default true
+   */
+  isHttpOnly?: boolean | undefined;
+
+  /**
+   * Sets the `SameSite` flag. The value must be one of:
+   *
+   *     - `false`  - no flag.
+   *     - `Strict` - sets the value to `Strict`.
+   *     - `Lax`    - sets the value to `Lax`.
+   *     - `None`   - sets the value to `None`.
+   *
+   *  @default 'Strict'
+   */
+  isSameSite?: SameSitePolicy | undefined;
+
+  /**
+   * Sets the `Partitioned` flag. For more information, please access https://developers.google.com/privacy-sandbox/3pcd/chips
+   */
+  isPartitioned?: boolean | undefined;
+
+  /**
+   * The path scope.
+   *
+   * @default null (no path)
+   */
+  path?: string | null | undefined;
+
+  /**
+   * The domain scope.
+   *
+   * @default null (no domain)
+   */
+  domain?: string | null | undefined;
+
+  /**
+   * Time-to-live in milliseconds.
+   *
+   * @default null (session time-life - cookies are deleted when the browser is closed)
+   */
+  ttl?: number | null | undefined;
+
+  /**
+   * Encoding performs on the provided value before serialization. Options are:
+   *
+   *     - `none` - no encoding. When used, the cookie value must be a string.
+   *     - `base64` - string value is encoded using Base64.
+   *     - `base64json` - object value is JSON-stringified then encoded using Base64.
+   *     - `form` - object value is encoded using the x-www-form-urlencoded method.
+   *     - `iron` - Encrypts and sign the value using iron.
+   *
+   * @default 'none'
+   */
+  encoding?: 'none' | 'base64' | 'base64json' | 'form' | 'iron' | undefined;
+
+  /**
+   * An object used to calculate an HMAC for cookie integrity validation. This does not provide privacy, only a mean
+   * to verify that the cookie value was generated by the server. Redundant when 'iron' encoding is used. Options are:
+   *  - integrity -
+   *  - password -
+   */
+  sign?:
+    | {
+        /**
+         * Algorithm options.
+         */
+        integrity?: SealOptionsSub | undefined;
+
+        /**
+         * Password used for HMAC key generation (must be at least 32 characters long).
+         */
+        password: string;
+      }
+    | undefined;
+
+  /**
+   * Options for 'iron' encoding.
+   */
+  iron?: SealOptions | undefined;
+
+  /**
+   * Password used for 'iron' encoding (must be at least 32 characters long).
+   */
+  password?: string | undefined;
+
+  /**
+   * A function using the signature `async function(definition, request)` used to override a request-specific cookie settings.
+   */
+  contextualize?(
+    /**
+     * A copy of the options to be used for formatting the cookie that can be manipulated by the function to customize
+     * the request cookie header. Note that changing the `definition.contextualize` property will be ignored.
+     */
+    definition: this,
+    /**
+     * The request object.
+     */
+    request: HapiRequest
+  ): void | Promise<void>;
+
+  /**
+   * If true, automatically instruct the client to remove invalid cookies.
+   *
+   * @default false
+   */
+  clearInvalid?: boolean | undefined;
+
+  /**
+   * if present and the cookie was not received from the client or explicitly set by the route handler, the
+   * cookie is automatically added to the response with the provided value. The value can be
+   * a function with signature async function(request) where:
+   */
+  autoValue?(request: HapiRequest): any;
+
+  /**
+   * Used by proxy plugins (e.g. h2o2).
+   */
+  passThrough?: any | undefined;
+}
+
+export interface FormatCookie<HapiRequest> {
+  name: string;
+  value: any;
+  options: StateOptions<HapiRequest>;
+}
+
+export class Definitions<HapiRequest> {
+  constructor(options: StateOptions<HapiRequest>);
+
+  add(name: string, options: StateOptions<HapiRequest>): void;
+
+  parse(cookies: string): Promise<{
+    states: Record<string, string>;
+    failed: {
+      name?: string;
+      value?: string;
+      settings: StateOptions<HapiRequest>;
+      reason: string;
+    }[];
+  }>;
+
+  format(
+    cookies: FormatCookie<HapiRequest> | FormatCookie<HapiRequest>[],
+    context: HapiRequest
+  ): Promise<string[]>;
+
+  passThrough(header: string, fallback: boolean): string | Boom;
+}
+
+export function prepareValue(
+  name: string,
+  value: any,
+  options: StateOptions<any>
+): Promise<string>;
+
+export function exclude(cookies: string, excludes: string[]): string | Boom;
diff --git a/node_modules/@hapi/statehood/lib/index.js b/node_modules/@hapi/statehood/lib/index.js
new file mode 100755
index 0000000..b1c8dd6
--- /dev/null
+++ b/node_modules/@hapi/statehood/lib/index.js
@@ -0,0 +1,555 @@
+'use strict';
+
+const Querystring = require('querystring');
+
+const Boom = require('@hapi/boom');
+const Bounce = require('@hapi/bounce');
+const Bourne = require('@hapi/bourne');
+const Cryptiles = require('@hapi/cryptiles');
+const Hoek = require('@hapi/hoek');
+const Iron = require('@hapi/iron');
+const Validate = require('@hapi/validate');
+
+
+const internals = {
+    macPrefix: 'hapi.signed.cookie.1'
+};
+
+
+internals.schema = Validate.object({
+    strictHeader: Validate.boolean(),
+    ignoreErrors: Validate.boolean(),
+    isSecure: Validate.boolean(),
+    isHttpOnly: Validate.boolean(),
+    isPartitioned: Validate.boolean(),
+    isSameSite: Validate.valid('Strict', 'Lax', 'None', false),
+    path: Validate.string().allow(null),
+    domain: Validate.string().allow(null),
+    ttl: Validate.number().allow(null),
+    encoding: Validate.string().valid('base64json', 'base64', 'form', 'iron', 'none'),
+    sign: Validate.object({
+        password: [Validate.string(), Validate.binary(), Validate.object()],
+        integrity: Validate.object()
+    }),
+    iron: Validate.object(),
+    password: [Validate.string(), Validate.binary(), Validate.object()],
+    contextualize: Validate.function(),
+
+    // Used by hapi
+
+    clearInvalid: Validate.boolean(),
+    autoValue: Validate.any(),
+    passThrough: Validate.boolean()
+});
+
+
+internals.defaults = {
+    strictHeader: true,                             // Require an RFC 6265 compliant header format
+    ignoreErrors: false,
+    isSecure: true,
+    isHttpOnly: true,
+    isPartitioned: false,
+    isSameSite: 'Strict',
+    path: null,
+    domain: null,
+    ttl: null,                                      // MSecs, 0 means remove
+    encoding: 'none'                                // options: 'base64json', 'base64', 'form', 'iron', 'none'
+};
+
+
+// Header format
+
+internals.validateRx = {
+    nameRx: {
+        strict: /^[^\x00-\x20()<>@,;:\\"\/\[\]?={}\x7F]+$/,
+        loose: /^[^=\s]*$/
+    },
+    valueRx: {
+        strict: /^[^\x00-\x20",;\\\x7F]*$/,
+        loose: /^("[^"]*"|[^;]*)$/
+    },
+    domainRx: /^\.?[a-z\d]+(?:-[a-z\d]+)*(?:\.[a-z\d]+(?:-[a-z\d]+)*)*$/,
+    domainLabelLenRx: /^\.?[a-z\d\-]{1,63}(?:\.[a-z\d\-]{1,63})*$/,
+    pathRx: /^\/[^\x00-\x1F;]*$/
+};
+
+//                      1: name         2: value
+internals.pairRx = /^([^=\s]*)\s*=\s*(.*)$/;
+
+
+exports.Definitions = class {
+
+    constructor(options) {
+
+        this.settings = Hoek.applyToDefaults(internals.defaults, options ?? {});
+        Validate.assert(this.settings, internals.schema, 'Invalid state definition defaults');
+
+        this.cookies = {};
+        this.names = [];
+    }
+
+    add(name, options) {
+
+        Hoek.assert(name && typeof name === 'string', 'Invalid name');
+        Hoek.assert(!this.cookies[name], 'State already defined:', name);
+
+        const settings = Hoek.applyToDefaults(this.settings, options ?? {}, { nullOverride: true });
+        Validate.assert(settings, internals.schema, 'Invalid state definition: ' + name);
+
+        this.cookies[name] = settings;
+        this.names.push(name);
+    }
+
+    async parse(cookies) {
+
+        const state = {};
+        const names = [];
+        const verify = internals.parsePairs(cookies, (name, value) => {
+
+            if (name === '__proto__') {
+                throw Boom.badRequest('Invalid cookie header');
+            }
+
+            if (state[name]) {
+                if (!Array.isArray(state[name])) {
+                    state[name] = [state[name]];
+                }
+
+                state[name].push(value);
+            }
+            else {
+                state[name] = value;
+                names.push(name);
+            }
+        });
+
+        // Validate cookie header syntax
+
+        const failed = [];                                                // All errors
+
+        if (verify !== null) {
+            if (!this.settings.ignoreErrors) {
+                throw Boom.badRequest('Invalid cookie header');
+            }
+
+            failed.push({ settings: this.settings, reason: `Header contains unexpected syntax: ${verify}` });
+        }
+
+        // Collect errors
+
+        const errored = [];                                               // Unignored errors
+        const record = (reason, name, value, definition) => {
+
+            const details = {
+                name,
+                value,
+                settings: definition,
+                reason: typeof reason === 'string' ? reason : reason.message
+            };
+
+            failed.push(details);
+            if (!definition.ignoreErrors) {
+                errored.push(details);
+            }
+        };
+
+        // Parse cookies
+
+        const parsed = {};
+        for (const name of names) {
+            const value = state[name];
+            const definition = this.cookies[name] ?? this.settings;
+
+            // Validate cookie
+
+            if (definition.strictHeader) {
+                const reason = internals.validate(name, state);
+                if (reason) {
+                    record(reason, name, value, definition);
+                    continue;
+                }
+            }
+
+            // Check cookie format
+
+            if (definition.encoding === 'none') {
+                parsed[name] = value;
+                continue;
+            }
+
+            // Single value
+
+            if (!Array.isArray(value)) {
+                try {
+                    const unsigned = await internals.unsign(name, value, definition);
+                    const result = await internals.decode(unsigned, definition);
+                    parsed[name] = result;
+                }
+                catch (err) {
+                    Bounce.rethrow(err, 'system');
+                    record(err, name, value, definition);
+                }
+
+                continue;
+            }
+
+            // Array
+
+            const arrayResult = [];
+            for (const arrayValue of value) {
+                try {
+                    const unsigned = await internals.unsign(name, arrayValue, definition);
+                    const result = await internals.decode(unsigned, definition);
+                    arrayResult.push(result);
+                }
+                catch (err) {
+                    Bounce.rethrow(err, 'system');
+                    record(err, name, value, definition);
+                }
+            }
+
+            parsed[name] = arrayResult;
+        }
+
+        if (errored.length) {
+            const error = Boom.badRequest('Invalid cookie value', errored);
+            error.states = parsed;
+            error.failed = failed;
+            throw error;
+        }
+
+        return { states: parsed, failed };
+    }
+
+    async format(cookies, context) {
+
+        if (!cookies ||
+            Array.isArray(cookies) && !cookies.length) {
+
+            return [];
+        }
+
+        if (!Array.isArray(cookies)) {
+            cookies = [cookies];
+        }
+
+        const header = [];
+        for (let i = 0; i < cookies.length; ++i) {
+            const cookie = cookies[i];
+
+            // Apply definition to local configuration
+
+            const base = this.cookies[cookie.name] ?? this.settings;
+            let definition = cookie.options ? Hoek.applyToDefaults(base, cookie.options, { nullOverride: true }) : base;
+
+            // Contextualize definition
+
+            if (definition.contextualize) {
+                if (definition === base) {
+                    definition = Hoek.clone(definition);
+                }
+
+                await definition.contextualize(definition, context);
+            }
+
+            // Validate name
+
+            const nameRx = definition.strictHeader ? internals.validateRx.nameRx.strict : internals.validateRx.nameRx.loose;
+            if (!nameRx.test(cookie.name)) {
+                throw Boom.badImplementation('Invalid cookie name: ' + cookie.name);
+            }
+
+            // Prepare value (encode, sign)
+
+            const value = await exports.prepareValue(cookie.name, cookie.value, definition);
+
+            // Validate prepared value
+
+            const valueRx = definition.strictHeader ? internals.validateRx.valueRx.strict : internals.validateRx.valueRx.loose;
+            if (value &&
+                (typeof value !== 'string' || !value.match(valueRx))) {
+
+                throw Boom.badImplementation('Invalid cookie value: ' + cookie.value);
+            }
+
+            // Construct cookie
+
+            let segment = cookie.name + '=' + (value || '');
+
+            if (definition.ttl !== null &&
+                definition.ttl !== undefined) {            // Can be zero
+
+                const expires = new Date(definition.ttl ? Date.now() + definition.ttl : 0);
+                segment = segment + '; Max-Age=' + Math.floor(definition.ttl / 1000) + '; Expires=' + expires.toUTCString();
+            }
+
+            if (definition.isSecure) {
+                segment = segment + '; Secure';
+            }
+
+            if (definition.isHttpOnly) {
+                segment = segment + '; HttpOnly';
+            }
+
+            if (definition.isSameSite) {
+                segment = `${segment}; SameSite=${definition.isSameSite}`;
+            }
+
+            if (definition.isPartitioned) {
+                if (!definition.isSecure) {
+                    throw Boom.badImplementation('Partitioned cookies must be secure');
+                }
+
+                if (definition.isSameSite !== 'None') {
+                    throw Boom.badImplementation('Partitioned cookies must have SameSite=None');
+                }
+
+                segment = `${segment}; Partitioned`;
+            }
+
+            if (definition.domain) {
+                const domain = definition.domain.toLowerCase();
+                if (!domain.match(internals.validateRx.domainLabelLenRx)) {
+                    throw Boom.badImplementation('Cookie domain too long: ' + definition.domain);
+                }
+
+                if (!domain.match(internals.validateRx.domainRx)) {
+                    throw Boom.badImplementation('Invalid cookie domain: ' + definition.domain);
+                }
+
+                segment = segment + '; Domain=' + domain;
+            }
+
+            if (definition.path) {
+                if (!definition.path.match(internals.validateRx.pathRx)) {
+                    throw Boom.badImplementation('Invalid cookie path: ' + definition.path);
+                }
+
+                segment = segment + '; Path=' + definition.path;
+            }
+
+            header.push(segment);
+        }
+
+        return header;
+    }
+
+    passThrough(header, fallback) {
+
+        if (!this.names.length) {
+            return header;
+        }
+
+        const exclude = [];
+        for (let i = 0; i < this.names.length; ++i) {
+            const name = this.names[i];
+            const definition = this.cookies[name];
+            const passCookie = definition.passThrough !== undefined ? definition.passThrough : fallback;
+            if (!passCookie) {
+                exclude.push(name);
+            }
+        }
+
+        return exports.exclude(header, exclude);
+    }
+};
+
+
+internals.parsePairs = function (cookies, eachPairFn) {
+
+    let index = 0;
+
+    while (index < cookies.length) {
+
+        const eqIndex = cookies.indexOf('=', index);
+
+        if (eqIndex === -1) {
+            return cookies.slice(index);    // E.g. 'a=1;xyz' -> 'xyz'
+        }
+
+        const semiIndex = cookies.indexOf(';', eqIndex);
+        const endOfValueIndex = semiIndex !== -1 ? semiIndex : cookies.length;
+
+        const name = cookies.slice(index, eqIndex).trim();
+        const value = cookies.slice(eqIndex + 1, endOfValueIndex).trim();
+        const unquotedValue = (value.startsWith('"') && value.endsWith('"') && value !== '"') ?
+            value.slice(1, -1) :    // E.g. '"abc"' -> 'abc'
+            value;
+
+        eachPairFn(name, unquotedValue);
+        index = endOfValueIndex + 1;
+    }
+
+    return null;
+};
+
+internals.validate = function (name, state) {
+
+    if (!name.match(internals.validateRx.nameRx.strict)) {
+        return 'Invalid cookie name';
+    }
+
+    const values = [].concat(state[name]);
+    for (let i = 0; i < values.length; ++i) {
+        if (!values[i].match(internals.validateRx.valueRx.strict)) {
+            return 'Invalid cookie value';
+        }
+    }
+
+    return null;
+};
+
+
+internals.unsign = async function (name, value, definition) {
+
+    if (!definition.sign) {
+        return value;
+    }
+
+    const pos = value.lastIndexOf('.');
+    if (pos === -1) {
+        throw Boom.badRequest('Missing signature separator');
+    }
+
+    const unsigned = value.slice(0, pos);
+    const sig = value.slice(pos + 1);
+
+    if (!sig) {
+        throw Boom.badRequest('Missing signature');
+    }
+
+    const sigParts = sig.split('*');
+    if (sigParts.length !== 2) {
+        throw Boom.badRequest('Invalid signature format');
+    }
+
+    const hmacSalt = sigParts[0];
+    const hmac = sigParts[1];
+
+    const macOptions = Hoek.clone(definition.sign.integrity ?? Iron.defaults.integrity);
+    macOptions.salt = hmacSalt;
+    const mac = await Iron.hmacWithPassword(definition.sign.password, macOptions, [internals.macPrefix, name, unsigned].join('\n'));
+    if (!Cryptiles.fixedTimeComparison(mac.digest, hmac)) {
+        throw Boom.badRequest('Invalid hmac value');
+    }
+
+    return unsigned;
+};
+
+
+internals.decode = async function (value, definition) {
+
+    if (!value &&
+        definition.encoding === 'form') {
+
+        return {};
+    }
+
+    Hoek.assert(typeof value === 'string', 'Invalid string');
+
+    // Encodings: 'base64json', 'base64', 'form', 'iron', 'none'
+
+    if (definition.encoding === 'iron') {
+        return await Iron.unseal(value, definition.password, definition.iron ?? Iron.defaults);
+    }
+
+    if (definition.encoding === 'base64json') {
+        const decoded = Buffer.from(value, 'base64').toString('binary');
+        try {
+            return Bourne.parse(decoded);
+        }
+        catch {
+            throw Boom.badRequest('Invalid JSON payload');
+        }
+    }
+
+    if (definition.encoding === 'base64') {
+        return Buffer.from(value, 'base64').toString('binary');
+    }
+
+    // encoding: 'form'
+
+    return Querystring.parse(value);
+};
+
+
+exports.prepareValue = async function (name, value, options) {
+
+    Hoek.assert(options && typeof options === 'object', 'Missing or invalid options');
+
+    try {
+        const encoded = await internals.encode(value, options);
+        const signed = await internals.sign(name, encoded, options.sign);
+        return signed;
+    }
+    catch (err) {
+        throw Boom.badImplementation('Failed to encode cookie (' + name + ') value: ' + err.message);
+    }
+};
+
+
+internals.encode = function (value, options) {
+
+    // Encodings: 'base64json', 'base64', 'form', 'iron', 'none'
+
+    if (value === undefined ||
+        options.encoding === 'none') {
+
+        return value;
+    }
+
+    if (options.encoding === 'iron') {
+        return Iron.seal(value, options.password, options.iron ?? Iron.defaults);
+    }
+
+    if (options.encoding === 'base64') {
+        return Buffer.from(value, 'binary').toString('base64');
+    }
+
+    if (options.encoding === 'base64json') {
+        const stringified = JSON.stringify(value);
+        return Buffer.from(stringified, 'binary').toString('base64');
+    }
+
+    // encoding: 'form'
+
+    return Querystring.stringify(value);
+};
+
+
+internals.sign = async function (name, value, options) {
+
+    if (value === undefined ||
+        !options) {
+
+        return value;
+    }
+
+    const mac = await Iron.hmacWithPassword(options.password, options.integrity ?? Iron.defaults.integrity, [internals.macPrefix, name, value].join('\n'));
+    const signed = value + '.' + mac.salt + '*' + mac.digest;
+    return signed;
+};
+
+
+exports.exclude = function (cookies, excludes) {
+
+    const result = [];
+
+    const chunks = cookies.split(';');
+
+    for (const chunk of chunks) {
+        const match = internals.pairRx.exec(chunk.trim());
+
+        if (!match) {
+            return Boom.badRequest('Invalid cookie header');
+        }
+
+        const [, name, value] = match;
+
+        if (!excludes.includes(name)) {
+            result.push(`${name}=${value}`);
+        }
+    }
+
+    return result.join(';');
+};
diff --git a/node_modules/@hapi/statehood/package.json b/node_modules/@hapi/statehood/package.json
new file mode 100755
index 0000000..9ace89d
--- /dev/null
+++ b/node_modules/@hapi/statehood/package.json
@@ -0,0 +1,41 @@
+{
+  "name": "@hapi/statehood",
+  "description": "HTTP State Management Utilities",
+  "version": "8.2.1",
+  "repository": "git://github.com/hapijs/statehood",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "HTTP",
+    "state",
+    "cookies",
+    "secure"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/bounce": "^3.0.1",
+    "@hapi/bourne": "^3.0.0",
+    "@hapi/cryptiles": "^6.0.1",
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/iron": "^7.0.1",
+    "@hapi/validate": "^2.0.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.1.2"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/subtext/LICENSE.md b/node_modules/@hapi/subtext/LICENSE.md
new file mode 100755
index 0000000..1a35e1f
--- /dev/null
+++ b/node_modules/@hapi/subtext/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2019, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/subtext/README.md b/node_modules/@hapi/subtext/README.md
new file mode 100644
index 0000000..4355451
--- /dev/null
+++ b/node_modules/@hapi/subtext/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/subtext
+
+#### HTTP payload parser.
+
+**subtext** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/subtext/)
+- [Versions status](https://hapi.dev/resources/status/#subtext) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/subtext/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/subtext/lib/index.js b/node_modules/@hapi/subtext/lib/index.js
new file mode 100755
index 0000000..41fa1b3
--- /dev/null
+++ b/node_modules/@hapi/subtext/lib/index.js
@@ -0,0 +1,458 @@
+'use strict';
+
+const Fs = require('fs');
+const Fsp = require('fs/promises');
+const Os = require('os');
+const Querystring = require('querystring');
+const Stream = require('stream');
+const Zlib = require('zlib');
+
+const Boom = require('@hapi/boom');
+const Bourne = require('@hapi/bourne');
+const Content = require('@hapi/content');
+const File = require('@hapi/file');
+const Hoek = require('@hapi/hoek');
+const Pez = require('@hapi/pez');
+const Wreck = require('@hapi/wreck');
+
+
+const internals = {
+    kSubtext: Symbol('subtext'),
+    decoders: {
+        gzip: (options) => Zlib.createGunzip(options),
+        deflate: (options) => Zlib.createInflate(options)
+    }
+};
+
+
+exports.parse = async function (req, tap, options) {
+
+    Hoek.assert(options, 'Missing options');
+    Hoek.assert(options.parse !== undefined, 'Missing parse option setting');
+    Hoek.assert(options.output !== undefined, 'Missing output option setting');
+
+    // Content size
+
+    const contentLength = req.headers['content-length'];
+    if (options.maxBytes !== undefined &&
+        contentLength &&
+        parseInt(contentLength, 10) > options.maxBytes) {
+
+        throw Boom.entityTooLarge('Payload content length greater than maximum allowed: ' + options.maxBytes);
+    }
+
+    // Content type
+
+    const contentType = Content.type(options.override || req.headers['content-type'] || options.defaultContentType || 'application/octet-stream');
+    try {
+        if (options.allow &&
+            options.allow.indexOf(contentType.mime) === -1) {
+
+            throw Boom.unsupportedMediaType();
+        }
+
+        const parsed = { mime: contentType.mime };
+
+        // Parse: true
+
+        if (options.parse === true) {
+            parsed.payload = await internals.parse(req, tap, options, contentType);
+            return parsed;
+        }
+
+        // Parse: false, 'gunzip'
+
+        parsed.payload = await internals.raw(req, tap, options);
+        return parsed;
+    }
+    catch (err) {
+        err.mime = contentType.mime;
+        throw err;
+    }
+};
+
+
+internals.parse = async function (req, tap, options, contentType) {
+
+    const output = options.output;        // Output: 'data', 'stream', 'file'
+    let source = internals.decoder(req, options);
+
+    // Tap request
+
+    if (tap) {
+        [source] = internals.pipe(source, tap);
+    }
+
+    // Multipart
+
+    if (contentType.mime === 'multipart/form-data') {
+        if (options.multipart === false) {                            // Defaults to true
+            throw Boom.unsupportedMediaType();
+        }
+
+        return await internals.multipart(req, options, source, contentType);
+    }
+
+    // Output: 'stream'
+
+    if (output === 'stream') {
+        return source;
+    }
+
+    // Output: 'file'
+
+    if (output === 'file') {
+        const file = await internals.writeFile(req, options, source);
+        return file.item;
+    }
+
+    // Output: 'data'
+
+    const payload = await Wreck.read(source, { timeout: options.timeout, maxBytes: options.maxBytes });
+    return internals.object(options, payload, contentType.mime);
+};
+
+
+internals.decoder = function (source, options) {
+
+    const contentEncoding = source.headers['content-encoding'];
+    const decoders = options.decoders ?? internals.decoders;
+    if (!decoders.hasOwnProperty(contentEncoding)) {
+        return source;
+    }
+
+    const decoderOptions = options.compression?.[contentEncoding] ?? null;
+    const stream = decoders[contentEncoding](decoderOptions);
+
+    const orig = stream.emit;
+    stream.emit = (event, ...args) => {
+
+        if (event === 'error') {
+            args = [Boom.badRequest('Invalid compressed payload', args[0])];
+        }
+
+        return orig.call(stream, event, ...args);
+    };
+
+    [source] = internals.pipe(source, stream);
+
+    return source;
+};
+
+
+internals.raw = async function (req, tap, options) {
+
+    const output = options.output;      // Output: 'data', 'stream', 'file'
+    let source = req;
+
+    // Content-encoding (optional)
+
+    if (options.parse === 'gunzip') {
+        source = internals.decoder(source, options);
+    }
+
+    // Setup source
+
+    if (tap) {
+        [source] = internals.pipe(source, tap);
+    }
+
+    // Output: 'stream'
+
+    if (output === 'stream') {
+        return source;
+    }
+
+    // Output: 'file'
+
+    if (output === 'file') {
+        const file = await internals.writeFile(req, options, source);
+        return file.item;
+    }
+
+    // Output: 'data'
+
+    return await Wreck.read(source, { timeout: options.timeout, maxBytes: options.maxBytes });
+};
+
+
+internals.object = function (options, payload, mime) {
+
+    // Binary
+
+    if (mime === 'application/octet-stream') {
+        return payload.length ? payload : null;
+    }
+
+    // Text
+
+    if (mime.match(/^text\/.+$/)) {
+        return payload.toString('utf8');
+    }
+
+    // JSON
+
+    if (/^application\/(?:.+\+)?json$/.test(mime)) {
+        if (!payload.length) {
+            return null;
+        }
+
+        try {
+            return Bourne.parse(payload.toString('utf8'), { protoAction: options.protoAction });
+        }
+        catch (err) {
+            const error = Boom.badRequest('Invalid request payload JSON format', err);
+            error.raw = payload;
+            throw error;
+        }
+    }
+
+    // Form-encoded
+
+    if (mime === 'application/x-www-form-urlencoded') {
+        const parse = options.querystring ?? Querystring.parse;
+        return payload.length ? parse(payload.toString('utf8')) : {};
+    }
+
+    const error = Boom.unsupportedMediaType();
+    error.raw = payload;
+    throw error;
+};
+
+
+internals.multipart = function (req, options, source, contentType) {
+
+    return new Promise((resolve, reject) => {
+
+        // Set stream timeout
+
+        const clientTimeout = options.timeout;
+        const clientTimeoutId = clientTimeout ? setTimeout(() => reject(Boom.clientTimeout()), clientTimeout) : null;
+
+        // Create parser
+
+        const dispenserOptions = Hoek.applyToDefaults(contentType, {
+            maxBytes: options.maxBytes,
+            maxParts: options.maxParts
+        });
+        const dispenser = new Pez.Dispenser(dispenserOptions);
+
+        const data = {};
+        const pendingFiles = [];
+
+        const onError = (err) => {
+
+            const cleanup = internals.cleanupFiles(pendingFiles);
+            cleanup.catch(Hoek.ignore); // Prevent triggering node's PromiseRejectionHandledWarning
+
+            reject(Boom.badRequest('Invalid multipart payload format', err));
+        };
+
+        dispenser.once('error', onError);
+
+        const set = (name, value) => {
+
+            if (!data.hasOwnProperty(name)) {
+                data[name] = value;
+            }
+            else if (Array.isArray(data[name])) {
+                data[name].push(value);
+            }
+            else {
+                data[name] = [data[name], value];
+            }
+        };
+
+        const finalize = async () => {
+
+            // Clean up
+
+            clearTimeout(clientTimeoutId);
+            dispenser.removeListener('error', onError);
+            dispenser.removeListener('part', onPart);
+            dispenser.removeListener('field', onField);
+            dispenser.removeListener('close', onClose);
+
+            // Wait for files
+
+            try {
+                const files = await Promise.all(pendingFiles);
+                for (const { item, name } of files) {
+                    set(name, item);
+                }
+            }
+            catch (err) {
+                reject(err);
+                return;
+            }
+
+            resolve(data);
+        };
+
+        const output = typeof options.multipart === 'object' ? options.multipart.output : options.output;       // options.multipart can be true or object
+
+        const onPart = (part) => {
+
+            if (output === 'file') {                                                                // Output: 'file'
+                pendingFiles.push(internals.writeFile(req, options, part));
+            }
+            else {
+                internals.part(part, output, set, options);                                         // Output: 'data' / 'stream'
+            }
+        };
+
+        dispenser.on('part', onPart);
+
+        const onField = (name, value) => set(name, value);
+        dispenser.on('field', onField);
+
+        const onClose = () => finalize();
+        dispenser.once('close', onClose);
+
+        source.pipe(dispenser);
+    });
+};
+
+
+internals.writeFile = function (req, options, stream) {
+
+    const promise = new Promise((resolve, reject) => {
+
+        const path = File.uniqueFilename(options.uploads ?? Os.tmpdir());
+        const file = Fs.createWriteStream(path, { flags: 'wx' });
+        const counter = new internals.Counter(options);
+
+        const finalize = (err) => {
+
+            req.removeListener('aborted', onAbort);
+            file.removeListener('close', finalize);
+            file.removeListener('error', finalize);
+
+            if (err) {
+                unpipeStreamToCounter();
+                unpipeCounterToFile();
+
+                file.close();
+                Fs.unlink(path, (/* fsErr */) => reject(err));      // Ignore unlink errors
+                return;
+            }
+
+            const result = {
+                item: {
+                    path,
+                    bytes: counter.bytes
+                }
+            };
+
+            if (stream.name) {                                      // Multipart
+                result.name = stream.name;
+                result.item.filename = stream.filename;
+                result.item.headers = stream.headers;
+            }
+
+            resolve(result);
+        };
+
+        file.once('close', finalize);
+        file.once('error', finalize);
+
+        const onAbort = () => finalize(Boom.badRequest('Client connection aborted'));
+        req.once('aborted', onAbort);
+
+        const [, unpipeStreamToCounter] = internals.pipe(stream, counter);
+        const [, unpipeCounterToFile] = internals.pipe(counter, file);
+    });
+
+    promise.catch(Hoek.ignore);     // Prevent triggering node's PromiseRejectionHandledWarning
+    return promise;
+};
+
+internals.cleanupFiles = async (pendingFiles) => {
+
+    const results = await Promise.allSettled(pendingFiles);
+
+    await Promise.all(results.map(async (result) => {
+
+        if (result.value) {
+            await Fsp.unlink(result.value.item.path);
+        }
+    }));
+};
+
+internals.part = async function (part, output, set, options) {
+
+    const payload = await Wreck.read(part);             // Error handled by dispenser.once('error')
+
+    if (output === 'stream') {                          // Output: 'stream'
+        const item = Wreck.toReadableStream(payload);
+        item.hapi = {
+            filename: part.filename,
+            headers: part.headers
+        };
+
+        return set(part.name, item);
+    }
+
+    const ct = part.headers['content-type'] || '';      // Output: 'data'
+    const mime = ct.split(';')[0].trim().toLowerCase();
+    const annotate = (value) => set(part.name, output === 'annotated' ? { filename: part.filename, headers: part.headers, payload: value } : value);
+
+    if (!mime) {
+        return annotate(payload);
+    }
+
+    if (!payload.length) {
+        return annotate({});
+    }
+
+    try {
+        const object = internals.object(options, payload, mime);
+        annotate(object);
+    }
+    catch (err) {
+        annotate(payload);
+    }
+};
+
+
+internals.pipe = function (from, to) {
+
+    const forwardError = (err) => {
+
+        unpipe();
+        to.emit('error', err);
+    };
+
+    const unpipe = () => {
+
+        from.removeListener('error', forwardError);
+        return from.unpipe(to);
+    };
+
+    from.once('error', forwardError);
+
+    return [from.pipe(to), unpipe];
+};
+
+internals.Counter = class extends Stream.Transform {
+
+    constructor(options) {
+
+        super();
+        this.bytes = 0;
+        this._maxBytes = options.maxBytes;
+    }
+
+    _transform(chunk, encoding, next) {
+
+        this.bytes = this.bytes + chunk.length;
+
+        if (this._maxBytes !== undefined &&
+            this.bytes > this._maxBytes) {
+
+            return next(Boom.entityTooLarge('Payload content length greater than maximum allowed: ' + this._maxBytes));
+        }
+
+        return next(null, chunk);
+    }
+};
diff --git a/node_modules/@hapi/subtext/package.json b/node_modules/@hapi/subtext/package.json
new file mode 100644
index 0000000..28cdd56
--- /dev/null
+++ b/node_modules/@hapi/subtext/package.json
@@ -0,0 +1,42 @@
+{
+  "name": "@hapi/subtext",
+  "description": "HTTP payload parsing",
+  "version": "8.1.3",
+  "repository": "git://github.com/hapijs/subtext",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "http",
+    "payload",
+    "file",
+    "stream",
+    "multipart"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/boom": "^10.0.1",
+    "@hapi/bourne": "^3.0.0",
+    "@hapi/content": "^6.0.2",
+    "@hapi/file": "^3.0.0",
+    "@hapi/hoek": "^11.0.7",
+    "@hapi/pez": "^6.1.1",
+    "@hapi/wreck": "^18.1.1"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.3.2",
+    "form-data": "^4.0.5"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/teamwork/LICENSE.md b/node_modules/@hapi/teamwork/LICENSE.md
new file mode 100755
index 0000000..1e1bda5
--- /dev/null
+++ b/node_modules/@hapi/teamwork/LICENSE.md
@@ -0,0 +1,10 @@
+Copyright (c) 2015-2022, Project contributors
+Copyright (c) 2015-2020, Sideway Inc
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/teamwork/README.md b/node_modules/@hapi/teamwork/README.md
new file mode 100755
index 0000000..a097689
--- /dev/null
+++ b/node_modules/@hapi/teamwork/README.md
@@ -0,0 +1,16 @@
+<a href="http://hapijs.com"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/teamwork
+
+#### Wait for multiple callbacks
+
+**teamwork** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Version status](https://hapi.dev/resources/status/#teamwork) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/teamwork/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/teamwork/lib/index.d.ts b/node_modules/@hapi/teamwork/lib/index.d.ts
new file mode 100755
index 0000000..bac2b26
--- /dev/null
+++ b/node_modules/@hapi/teamwork/lib/index.d.ts
@@ -0,0 +1,95 @@
+/**
+ * Team bridges between callbacks and promises. Used to convert callback-based
+ * interfaces to a promise-based result including support for collecting multiple
+ * callback events into a single promise.
+ */
+export class Team<Results extends any | any[] = void> {
+    /**
+     * Start a new team work.
+     *
+     * @param options Configuration of the team work.
+     */
+    constructor(options?: Team.Options);
+
+    /**
+     * Resulting work when all the meetings are done.
+     */
+    work: Promise<Results>;
+
+    /**
+     * Attend a single meeting.
+     *
+     * @param note An optional note that will be included in the work's results. If an error is provided, the work will be immediately rejected with that error.
+     */
+    attend(note?: Error | Team.ElementOf<Results>): void;
+
+    /**
+     * Wait for the current work to be done and start another team work.
+     *
+     * @param options New configuration of the team work.
+     *
+     * @returns a promise that resolves when the current work is done.
+     */
+    regroup(options?: Team.Options) : Promise<void>;
+}
+
+export namespace Team {
+
+    /**
+     * Configuration of the team work.
+     */
+    export interface Options {
+        /**
+         * Number of meetings this team should attend before delivering work.
+         *
+         * @default 1
+         */
+        readonly meetings?: number | undefined;
+
+        /**
+         * Throws when the team attends more than the expected number of `meetings`,
+         * or if scheduling an empty meeting.
+         *
+         * @default false
+         */
+        readonly strict?: boolean | undefined;
+    }
+
+    type ElementOf<T> = T extends (infer E)[] ? E : T;
+}
+
+
+/**
+ * Events emitter via an async iterator interface.
+ */
+export class Events<T> {
+
+    /**
+     * Returns a standard async iterator interface object.
+     *
+     * @returns async iterator interface object.
+     */
+    iterator(): Events.Iterator<T>;
+
+    /**
+     * Emits an event to be consumed via the iterator.
+     *
+     * @param value
+     */
+    emit(value: T): void;
+
+    /**
+     * Informs the iterator that no new events will be emitted.
+     */
+    end(): void;
+}
+
+export namespace Events {
+
+    class Iterator<T> implements AsyncIterator<T> {
+
+        constructor(events: Events<T>);
+        [Symbol.asyncIterator](): AsyncIterator<T>;
+        next(): Promise<IteratorResult<T>>;
+    }
+}
diff --git a/node_modules/@hapi/teamwork/lib/index.js b/node_modules/@hapi/teamwork/lib/index.js
new file mode 100755
index 0000000..35913e8
--- /dev/null
+++ b/node_modules/@hapi/teamwork/lib/index.js
@@ -0,0 +1,203 @@
+'use strict';
+
+const internals = {};
+
+
+exports.Team = class {
+
+    #meetings = null;
+    #count = null;
+    #notes = null;
+    #done = false;
+    #strict = false;
+
+    constructor(options) {
+
+        this._init(options);
+    }
+
+    static _notes(instance) {
+
+        return instance.#notes;
+    }
+
+    _init(options = {}) {
+
+        this.work = new Promise((resolve, reject) => {
+
+            this._resolve = resolve;
+            this._reject = reject;
+        });
+
+        const meetings = options.meetings ?? 1;
+        const strict = !!options.strict;
+
+        if (!Number.isInteger(meetings) || meetings <= 0) {
+            if (meetings === 0 && !strict) {
+                return this._finalize(null, null);
+            }
+
+            throw new Error('Invalid meetings value');
+        }
+
+        this.#meetings = meetings;
+        this.#count = meetings;
+        this.#notes = [];
+        this.#done = false;
+        this.#strict = strict;
+
+    }
+
+    _finalize(err, note) {
+
+        this.#done = true;
+        this.#notes = null;
+
+        if (err) {
+            this._reject(err);
+        }
+        else {
+            this._resolve(note);
+        }
+    }
+
+    attend(note) {
+
+        if (this.#done) {
+            if (this.#strict) {
+                throw new Error('Unscheduled meeting');
+            }
+
+            // else ignore
+
+            return;
+        }
+
+        if (note instanceof Error) {
+            return this._finalize(note);
+        }
+
+        this.#notes.push(note);
+
+        if (--this.#count) {
+            return;
+        }
+
+        this._finalize(null, this.#meetings === 1 ? this.#notes[0] : this.#notes);
+    }
+
+    async regroup(options) {
+
+        try {
+            await this.work;
+        }
+        catch {}
+
+        this._init(options);
+    }
+};
+
+
+exports.Events = class {
+
+    #iterators = new Set();
+
+    static _iterators(instance) {
+
+        return instance.#iterators;
+    }
+
+    static isIterator(iterator) {
+
+        return iterator instanceof internals.EventsIterator;
+    }
+
+    iterator() {
+
+        const iterator = new internals.EventsIterator(this);
+
+        this.#iterators.add(iterator);
+
+        return iterator;
+    }
+
+    emit(value) {
+
+        for (const iterator of this.#iterators) {
+            iterator._queue({ value, done: false });
+        }
+    }
+
+    end() {
+
+        for (const iterator of this.#iterators) {
+            iterator._queue({ done: true });
+        }
+    }
+
+    _remove(iterator) {
+
+        this.#iterators.delete(iterator);
+    }
+};
+
+
+internals.EventsIterator = class {
+
+    #events;
+
+    #pending = null;
+    #queue = [];
+
+    constructor(events) {
+
+        this.#events = events;
+    }
+
+    [Symbol.asyncIterator]() {
+
+        return this;
+    }
+
+    next() {
+
+        if (this.#queue.length) {
+            return Promise.resolve(this.#queue.shift());
+        }
+
+        if (!this.#events) {
+            return { done: true };
+        }
+
+        this.#pending = new exports.Team();
+        return this.#pending.work;
+    }
+
+    return() {
+
+        this._cleanup();
+
+        return { done: true };
+    }
+
+    _cleanup() {
+
+        this.#events?._remove(this);
+        this.#events = null;
+    }
+
+    _queue(item) {
+
+        if (item.done) {
+            this._cleanup();
+        }
+
+        if (this.#pending) {
+            this.#pending.attend(item);
+            this.#pending = null;
+        }
+        else {
+            this.#queue.push(item);
+        }
+    }
+};
diff --git a/node_modules/@hapi/teamwork/package.json b/node_modules/@hapi/teamwork/package.json
new file mode 100755
index 0000000..facb596
--- /dev/null
+++ b/node_modules/@hapi/teamwork/package.json
@@ -0,0 +1,36 @@
+{
+  "name": "@hapi/teamwork",
+  "description": "Wait for multiple callback",
+  "version": "6.0.1",
+  "repository": "git://github.com/hapijs/teamwork",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "async",
+    "flow control",
+    "callback"
+  ],
+  "types": "lib/index.d.ts",
+  "engines": {
+    "node": ">=14.0.0"
+  },
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "^6.0.0",
+    "@hapi/lab": "^25.0.0",
+    "@types/node": "^17.0.31",
+    "typescript": "^4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/topo/LICENSE.md b/node_modules/@hapi/topo/LICENSE.md
new file mode 100755
index 0000000..675e12f
--- /dev/null
+++ b/node_modules/@hapi/topo/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/topo/README.md b/node_modules/@hapi/topo/README.md
new file mode 100755
index 0000000..118bacb
--- /dev/null
+++ b/node_modules/@hapi/topo/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/topo
+
+#### Topological sorting with grouping support.
+
+**topo** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/topo/)
+- [Version status](https://hapi.dev/resources/status/#topo) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/topo/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/topo/lib/index.d.ts b/node_modules/@hapi/topo/lib/index.d.ts
new file mode 100755
index 0000000..e3367be
--- /dev/null
+++ b/node_modules/@hapi/topo/lib/index.d.ts
@@ -0,0 +1,60 @@
+export class Sorter<T> {
+
+    /**
+     * An array of the topologically sorted nodes. This list is renewed upon each call to topo.add().
+     */
+    nodes: T[];
+
+    /**
+     * Adds a node or list of nodes to be added and topologically sorted
+     * 
+     * @param nodes - A mixed value or array of mixed values to be added as nodes to the topologically sorted list.
+     * @param options - Optional sorting information about the nodes.
+     * 
+     * @returns Returns an array of the topologically sorted nodes.
+     */
+    add(nodes: T | T[], options?: Options): T[];
+
+    /**
+     * Merges another Sorter object into the current object.
+     * 
+     * @param others - The other object or array of objects to be merged into the current one.
+     * 
+     * @returns Returns an array of the topologically sorted nodes.
+     */
+    merge(others: Sorter<T> | Sorter<T>[]): T[];
+
+    /**
+     * Sorts the nodes array (only required if the manual option is used when adding items)
+     */
+    sort(): T[];
+}
+
+
+export interface Options {
+
+    /**
+     * The sorting group the added items belong to
+     */
+    readonly group?: string;
+
+    /**
+     * The group or groups the added items must come before
+     */
+    readonly before?: string | string[];
+
+    /**
+     * The group or groups the added items must come after
+     */
+    readonly after?: string | string[];
+
+    /**
+     * A number used to sort items with equal before/after requirements
+     */
+    readonly sort?: number;
+
+    /**
+     * If true, the array is not sorted automatically until sort() is called
+     */
+    readonly manual?: boolean;
+}
diff --git a/node_modules/@hapi/topo/lib/index.js b/node_modules/@hapi/topo/lib/index.js
new file mode 100755
index 0000000..12fed5c
--- /dev/null
+++ b/node_modules/@hapi/topo/lib/index.js
@@ -0,0 +1,225 @@
+'use strict';
+
+const { assert } = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports.Sorter = class {
+
+    constructor() {
+
+        this._items = [];
+        this.nodes = [];
+    }
+
+    add(nodes, options) {
+
+        options = options ?? {};
+
+        // Validate rules
+
+        const before = [].concat(options.before ?? []);
+        const after = [].concat(options.after ?? []);
+        const group = options.group ?? '?';
+        const sort = options.sort ?? 0;                   // Used for merging only
+
+        assert(!before.includes(group), `Item cannot come before itself: ${group}`);
+        assert(!before.includes('?'), 'Item cannot come before unassociated items');
+        assert(!after.includes(group), `Item cannot come after itself: ${group}`);
+        assert(!after.includes('?'), 'Item cannot come after unassociated items');
+
+        if (!Array.isArray(nodes)) {
+            nodes = [nodes];
+        }
+
+        for (const node of nodes) {
+            const item = {
+                seq: this._items.length,
+                sort,
+                before,
+                after,
+                group,
+                node
+            };
+
+            this._items.push(item);
+        }
+
+        // Insert event
+
+        if (!options.manual) {
+            const valid = this._sort();
+            assert(valid, 'item', group !== '?' ? `added into group ${group}` : '', 'created a dependencies error');
+        }
+
+        return this.nodes;
+    }
+
+    merge(others) {
+
+        if (!Array.isArray(others)) {
+            others = [others];
+        }
+
+        for (const other of others) {
+            if (other) {
+                for (const item of other._items) {
+                    this._items.push(Object.assign({}, item));      // Shallow cloned
+                }
+            }
+        }
+
+        // Sort items
+
+        this._items.sort(internals.mergeSort);
+        for (let i = 0; i < this._items.length; ++i) {
+            this._items[i].seq = i;
+        }
+
+        const valid = this._sort();
+        assert(valid, 'merge created a dependencies error');
+
+        return this.nodes;
+    }
+
+    sort() {
+
+        const valid = this._sort();
+        assert(valid, 'sort created a dependencies error');
+
+        return this.nodes;
+    }
+
+    _sort() {
+
+        // Construct graph
+
+        const graph = {};
+        const graphAfters = Object.create(null);            // A prototype can bungle lookups w/ false positives
+        const groups = Object.create(null);
+
+        for (const item of this._items) {
+            const seq = item.seq;                           // Unique across all items
+            const group = item.group;
+
+            // Determine Groups
+
+            groups[group] = groups[group] ?? [];
+            groups[group].push(seq);
+
+            // Build intermediary graph using 'before'
+
+            graph[seq] = item.before;
+
+            // Build second intermediary graph with 'after'
+
+            for (const after of item.after) {
+                graphAfters[after] = graphAfters[after] ?? [];
+                graphAfters[after].push(seq);
+            }
+        }
+
+        // Expand intermediary graph
+
+        for (const node in graph) {
+            const expandedGroups = [];
+
+            for (const graphNodeItem in graph[node]) {
+                const group = graph[node][graphNodeItem];
+                groups[group] = groups[group] ?? [];
+                expandedGroups.push(...groups[group]);
+            }
+
+            graph[node] = expandedGroups;
+        }
+
+        // Merge intermediary graph using graphAfters into final graph
+
+        for (const group in graphAfters) {
+            if (groups[group]) {
+                for (const node of groups[group]) {
+                    graph[node].push(...graphAfters[group]);
+                }
+            }
+        }
+
+        // Compile ancestors
+
+        const ancestors = {};
+        for (const node in graph) {
+            const children = graph[node];
+            for (const child of children) {
+                ancestors[child] = ancestors[child] ?? [];
+                ancestors[child].push(node);
+            }
+        }
+
+        // Topo sort
+
+        const visited = {};
+        const sorted = [];
+
+        for (let i = 0; i < this._items.length; ++i) {          // Looping through item.seq values out of order
+            let next = i;
+
+            if (ancestors[i]) {
+                next = null;
+                for (let j = 0; j < this._items.length; ++j) {  // As above, these are item.seq values
+                    if (visited[j] === true) {
+                        continue;
+                    }
+
+                    if (!ancestors[j]) {
+                        ancestors[j] = [];
+                    }
+
+                    const shouldSeeCount = ancestors[j].length;
+                    let seenCount = 0;
+                    for (let k = 0; k < shouldSeeCount; ++k) {
+                        if (visited[ancestors[j][k]]) {
+                            ++seenCount;
+                        }
+                    }
+
+                    if (seenCount === shouldSeeCount) {
+                        next = j;
+                        break;
+                    }
+                }
+            }
+
+            if (next !== null) {
+                visited[next] = true;
+                sorted.push(next);
+            }
+        }
+
+        if (sorted.length !== this._items.length) {
+            return false;
+        }
+
+        const seqIndex = {};
+        for (const item of this._items) {
+            seqIndex[item.seq] = item;
+        }
+
+        this._items = [];
+        this.nodes = [];
+
+        for (const value of sorted) {
+            const sortedItem = seqIndex[value];
+            this.nodes.push(sortedItem.node);
+            this._items.push(sortedItem);
+        }
+
+        return true;
+    }
+};
+
+
+internals.mergeSort = (a, b) => {
+
+    return a.sort === b.sort ? 0 : (a.sort < b.sort ? -1 : 1);
+};
diff --git a/node_modules/@hapi/topo/package.json b/node_modules/@hapi/topo/package.json
new file mode 100755
index 0000000..320aa4e
--- /dev/null
+++ b/node_modules/@hapi/topo/package.json
@@ -0,0 +1,37 @@
+{
+  "name": "@hapi/topo",
+  "description": "Topological sorting with grouping support",
+  "version": "6.0.2",
+  "repository": "git://github.com/hapijs/topo",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "topological",
+    "sort",
+    "toposort",
+    "topsort"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2",
+    "@types/node": "^17.0.31",
+    "typescript": "~4.6.4"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L -Y",
+    "test-cov-html": "lab -a @hapi/code -t 100 -L -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/validate/LICENSE.md b/node_modules/@hapi/validate/LICENSE.md
new file mode 100755
index 0000000..b25b924
--- /dev/null
+++ b/node_modules/@hapi/validate/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/validate/README.md b/node_modules/@hapi/validate/README.md
new file mode 100755
index 0000000..278edc0
--- /dev/null
+++ b/node_modules/@hapi/validate/README.md
@@ -0,0 +1,5 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/validate
+
+A fork of the [**joi**](https://github.com/sideway/joi) validation library for internal hapi core needs only. This fork is maintained to keep the hapi framework 100% free of external dependencies. It is not meant to be used outside of hapi core modules. Please use the official [**joi**](https://github.com/sideway/joi) library.
diff --git a/node_modules/@hapi/validate/lib/annotate.js b/node_modules/@hapi/validate/lib/annotate.js
new file mode 100755
index 0000000..dba6d41
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/annotate.js
@@ -0,0 +1,175 @@
+'use strict';
+
+const Clone = require('@hapi/hoek/clone');
+
+const Common = require('./common');
+
+
+const internals = {
+    annotations: Symbol('annotations')
+};
+
+
+exports.error = function (stripColorCodes) {
+
+    if (!this._original ||
+        typeof this._original !== 'object') {
+
+        return this.details[0].message;
+    }
+
+    const redFgEscape = stripColorCodes ? '' : '\u001b[31m';
+    const redBgEscape = stripColorCodes ? '' : '\u001b[41m';
+    const endColor = stripColorCodes ? '' : '\u001b[0m';
+
+    const obj = Clone(this._original);
+
+    for (let i = this.details.length - 1; i >= 0; --i) {        // Reverse order to process deepest child first
+        const pos = i + 1;
+        const error = this.details[i];
+        const path = error.path;
+        let node = obj;
+        for (let j = 0; ; ++j) {
+            const seg = path[j];
+
+            if (Common.isSchema(node)) {
+                node = node.clone();                              // joi schemas are not cloned by hoek, we have to take this extra step
+            }
+
+            if (j + 1 < path.length &&
+                typeof node[seg] !== 'string') {
+
+                node = node[seg];
+            }
+            else {
+                const refAnnotations = node[internals.annotations] || { errors: {}, missing: {} };
+                node[internals.annotations] = refAnnotations;
+
+                const cacheKey = seg || error.context.key;
+
+                if (node[seg] !== undefined) {
+                    refAnnotations.errors[cacheKey] = refAnnotations.errors[cacheKey] || [];
+                    refAnnotations.errors[cacheKey].push(pos);
+                }
+                else {
+                    refAnnotations.missing[cacheKey] = pos;
+                }
+
+                break;
+            }
+        }
+    }
+
+    const replacers = {
+        key: /_\$key\$_([, \d]+)_\$end\$_"/g,
+        missing: /"_\$miss\$_([^|]+)\|(\d+)_\$end\$_": "__missing__"/g,
+        arrayIndex: /\s*"_\$idx\$_([, \d]+)_\$end\$_",?\n(.*)/g,
+        specials: /"\[(NaN|Symbol.*|-?Infinity|function.*|\(.*)]"/g
+    };
+
+    let message = internals.safeStringify(obj, 2)
+        .replace(replacers.key, ($0, $1) => `" ${redFgEscape}[${$1}]${endColor}`)
+        .replace(replacers.missing, ($0, $1, $2) => `${redBgEscape}"${$1}"${endColor}${redFgEscape} [${$2}]: -- missing --${endColor}`)
+        .replace(replacers.arrayIndex, ($0, $1, $2) => `\n${$2} ${redFgEscape}[${$1}]${endColor}`)
+        .replace(replacers.specials, ($0, $1) => $1);
+
+    message = `${message}\n${redFgEscape}`;
+
+    for (let i = 0; i < this.details.length; ++i) {
+        const pos = i + 1;
+        message = `${message}\n[${pos}] ${this.details[i].message}`;
+    }
+
+    message = message + endColor;
+
+    return message;
+};
+
+
+// Inspired by json-stringify-safe
+
+internals.safeStringify = function (obj, spaces) {
+
+    return JSON.stringify(obj, internals.serializer(), spaces);
+};
+
+
+internals.serializer = function () {
+
+    const keys = [];
+    const stack = [];
+
+    const cycleReplacer = (key, value) => {
+
+        if (stack[0] === value) {
+            return '[Circular ~]';
+        }
+
+        return '[Circular ~.' + keys.slice(0, stack.indexOf(value)).join('.') + ']';
+    };
+
+    return function (key, value) {
+
+        if (stack.length > 0) {
+            const thisPos = stack.indexOf(this);
+            if (~thisPos) {
+                stack.length = thisPos + 1;
+                keys.length = thisPos + 1;
+                keys[thisPos] = key;
+            }
+            else {
+                stack.push(this);
+                keys.push(key);
+            }
+
+            if (~stack.indexOf(value)) {
+                value = cycleReplacer.call(this, key, value);
+            }
+        }
+        else {
+            stack.push(value);
+        }
+
+        if (value) {
+            const annotations = value[internals.annotations];
+            if (annotations) {
+                if (Array.isArray(value)) {
+                    const annotated = [];
+
+                    for (let i = 0; i < value.length; ++i) {
+                        if (annotations.errors[i]) {
+                            annotated.push(`_$idx$_${annotations.errors[i].sort().join(', ')}_$end$_`);
+                        }
+
+                        annotated.push(value[i]);
+                    }
+
+                    value = annotated;
+                }
+                else {
+                    for (const errorKey in annotations.errors) {
+                        value[`${errorKey}_$key$_${annotations.errors[errorKey].sort().join(', ')}_$end$_`] = value[errorKey];
+                        value[errorKey] = undefined;
+                    }
+
+                    for (const missingKey in annotations.missing) {
+                        value[`_$miss$_${missingKey}|${annotations.missing[missingKey]}_$end$_`] = '__missing__';
+                    }
+                }
+
+                return value;
+            }
+        }
+
+        if (value === Infinity ||
+            value === -Infinity ||
+            Number.isNaN(value) ||
+            typeof value === 'function' ||
+            typeof value === 'symbol') {
+
+            return '[' + value.toString() + ']';
+        }
+
+        return value;
+    };
+};
diff --git a/node_modules/@hapi/validate/lib/base.js b/node_modules/@hapi/validate/lib/base.js
new file mode 100755
index 0000000..5614ce0
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/base.js
@@ -0,0 +1,754 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+const DeepEqual = require('@hapi/hoek/deepEqual');
+const Merge = require('@hapi/hoek/merge');
+
+const Common = require('./common');
+const Compile = require('./compile');
+const Errors = require('./errors');
+const Extend = require('./extend');
+const Messages = require('./messages');
+const Modify = require('./modify');
+const Ref = require('./ref');
+const Validator = require('./validator');
+const Values = require('./values');
+
+
+const internals = {};
+
+
+internals.Base = class {
+
+    constructor(type) {
+
+        // Naming: public, _private, $_extension, $_mutate{action}
+
+        this.type = type;
+
+        this.$_root = null;
+        this._definition = {};
+        this._ids = new Modify.Ids();
+        this._preferences = null;
+        this._refs = new Ref.Manager();
+        this._cache = null;
+
+        this._valids = null;
+        this._invalids = null;
+
+        this._flags = {};
+        this._rules = [];
+        this._singleRules = new Map();              // The rule options passed for non-multi rules
+
+        this.$_terms = {};                          // Hash of arrays of immutable objects (extended by other types)
+
+        this.$_temp = {                             // Runtime state (not cloned)
+            whens: {}                               // Runtime cache of generated whens
+        };
+    }
+
+    // Rules
+
+    allow(...values) {
+
+        Common.verifyFlat(values, 'allow');
+        return this._values(values, '_valids');
+    }
+
+    cast(to) {
+
+        Assert(to === false || typeof to === 'string', 'Invalid to value');
+        Assert(to === false || this._definition.cast[to], 'Type', this.type, 'does not support casting to', to);
+
+        return this.$_setFlag('cast', to === false ? undefined : to);
+    }
+
+    default(value, options) {
+
+        return this._default('default', value, options);
+    }
+
+    empty(schema) {
+
+        const obj = this.clone();
+
+        if (schema !== undefined) {
+            schema = obj.$_compile(schema, { override: false });
+        }
+
+        return obj.$_setFlag('empty', schema, { clone: false });
+    }
+
+    error(err) {
+
+        Assert(err, 'Missing error');
+        Assert(err instanceof Error || typeof err === 'function', 'Must provide a valid Error object or a function');
+
+        return this.$_setFlag('error', err);
+    }
+
+    failover(value, options) {
+
+        return this._default('failover', value, options);
+    }
+
+    forbidden() {
+
+        return this.presence('forbidden');
+    }
+
+    id(id) {
+
+        if (!id) {
+            return this.$_setFlag('id', undefined);
+        }
+
+        Assert(typeof id === 'string', 'id must be a non-empty string');
+        Assert(/^[^\.]+$/.test(id), 'id cannot contain period character');
+
+        return this.$_setFlag('id', id);
+    }
+
+    invalid(...values) {
+
+        return this._values(values, '_invalids');
+    }
+
+    only(mode = true) {
+
+        Assert(typeof mode === 'boolean', 'Invalid mode:', mode);
+
+        return this.$_setFlag('only', mode);
+    }
+
+    optional() {
+
+        return this.presence('optional');
+    }
+
+    prefs(prefs) {
+
+        Assert(prefs, 'Missing preferences');
+        Assert(prefs.context === undefined, 'Cannot override context');
+
+        Common.checkPreferences(prefs);
+
+        const obj = this.clone();
+        obj._preferences = Common.preferences(obj._preferences, prefs);
+        return obj;
+    }
+
+    presence(mode) {
+
+        Assert(['optional', 'required', 'forbidden'].includes(mode), 'Unknown presence mode', mode);
+
+        return this.$_setFlag('presence', mode);
+    }
+
+    raw(enabled = true) {
+
+        return this.$_setFlag('result', enabled ? 'raw' : undefined);
+    }
+
+    required() {
+
+        return this.presence('required');
+    }
+
+    strict(enabled) {
+
+        const obj = this.clone();
+
+        const convert = enabled === undefined ? false : !enabled;
+        obj._preferences = Common.preferences(obj._preferences, { convert });
+        return obj;
+    }
+
+    strip(enabled = true) {
+
+        return this.$_setFlag('result', enabled ? 'strip' : undefined);
+    }
+
+    valid(...values) {
+
+        Common.verifyFlat(values, 'valid');
+
+        const obj = this.allow(...values);
+        obj.$_setFlag('only', !!obj._valids, { clone: false });
+        return obj;
+    }
+
+    when(condition, options) {
+
+        const obj = this.clone();
+
+        if (!obj.$_terms.whens) {
+            obj.$_terms.whens = [];
+        }
+
+        const when = Compile.when(obj, condition, options);
+        if (!['any', 'link'].includes(obj.type)) {
+            const conditions = when.is ? [when] : when.switch;
+            for (const item of conditions) {
+                Assert(!item.then || item.then.type === 'any' || item.then.type === obj.type, 'Cannot combine', obj.type, 'with', item.then?.type);
+                Assert(!item.otherwise || item.otherwise.type === 'any' || item.otherwise.type === obj.type, 'Cannot combine', obj.type, 'with', item.otherwise?.type);
+
+            }
+        }
+
+        obj.$_terms.whens.push(when);
+        return obj.$_mutateRebuild();
+    }
+
+    // Helpers
+
+    clone() {
+
+        const obj = Object.create(Object.getPrototypeOf(this));
+        return this._assign(obj);
+    }
+
+    concat(source) {
+
+        Assert(Common.isSchema(source), 'Invalid schema object');
+        Assert(this.type === 'any' || source.type === 'any' || source.type === this.type, 'Cannot merge type', this.type, 'with another type:', source.type);
+
+        let obj = this.clone();
+
+        if (this.type === 'any' &&
+            source.type !== 'any') {
+
+            // Change obj to match source type
+
+            const tmpObj = source.clone();
+            for (const key of Object.keys(obj)) {
+                if (key !== 'type') {
+                    tmpObj[key] = obj[key];
+                }
+            }
+
+            obj = tmpObj;
+        }
+
+        obj._ids.concat(source._ids);
+        obj._refs.register(source, Ref.toSibling);
+
+        obj._preferences = obj._preferences ? Common.preferences(obj._preferences, source._preferences) : source._preferences;
+        obj._valids = Values.merge(obj._valids, source._valids, source._invalids);
+        obj._invalids = Values.merge(obj._invalids, source._invalids, source._valids);
+
+        // Remove unique rules present in source
+
+        for (const name of source._singleRules.keys()) {
+            if (obj._singleRules.has(name)) {
+                obj._rules = obj._rules.filter((target) => target.name !== name);
+                obj._singleRules.delete(name);
+            }
+        }
+
+        // Rules
+
+        for (const test of source._rules) {
+            if (!source._definition.rules[test.method].multi) {
+                obj._singleRules.set(test.name, test);
+            }
+
+            obj._rules.push(test);
+        }
+
+        // Flags
+
+        if (obj._flags.empty &&
+            source._flags.empty) {
+
+            obj._flags.empty = obj._flags.empty.concat(source._flags.empty);
+            const flags = Object.assign({}, source._flags);
+            delete flags.empty;
+            Merge(obj._flags, flags);
+        }
+        else if (source._flags.empty) {
+            obj._flags.empty = source._flags.empty;
+            const flags = Object.assign({}, source._flags);
+            delete flags.empty;
+            Merge(obj._flags, flags);
+        }
+        else {
+            Merge(obj._flags, source._flags);
+        }
+
+        // Terms
+
+        for (const key in source.$_terms) {
+            const terms = source.$_terms[key];
+            if (!terms) {
+                if (!obj.$_terms[key]) {
+                    obj.$_terms[key] = terms;
+                }
+
+                continue;
+            }
+
+            if (!obj.$_terms[key]) {
+                obj.$_terms[key] = terms.slice();
+                continue;
+            }
+
+            obj.$_terms[key] = obj.$_terms[key].concat(terms);
+        }
+
+        // Rebuild
+
+        return obj.$_mutateRebuild();
+    }
+
+    validate(value, options) {
+
+        return Validator.entry(value, this, options);
+    }
+
+    validateAsync(value, options) {
+
+        const result = this.validate(value, options);
+        if (result.error) {
+            throw result.error;
+        }
+
+        return result.value;
+    }
+
+    // Extensions
+
+    $_addRule(options) {
+
+        // Normalize rule
+
+        if (typeof options === 'string') {
+            options = { name: options };
+        }
+
+        Assert(options && typeof options === 'object', 'Invalid options');
+        Assert(options.name && typeof options.name === 'string', 'Invalid rule name');
+
+        for (const key in options) {
+            Assert(key[0] !== '_', 'Cannot set private rule properties');
+        }
+
+        const rule = Object.assign({}, options);        // Shallow cloned
+        rule._resolve = [];
+        rule.method = rule.method || rule.name;
+
+        const definition = this._definition.rules[rule.method];
+        const args = rule.args;
+
+        Assert(definition, 'Unknown rule', rule.method);
+
+        // Args
+
+        const obj = this.clone();
+
+        if (args) {
+            Assert(Object.keys(args).length === 1 || Object.keys(args).length === this._definition.rules[rule.name].args.length, 'Invalid rule definition for', this.type, rule.name);
+
+            for (const key in args) {
+                let arg = args[key];
+                if (arg === undefined) {
+                    delete args[key];
+                    continue;
+                }
+
+                if (definition.argsByName) {
+                    const resolver = definition.argsByName.get(key);
+
+                    if (resolver.ref &&
+                        Common.isResolvable(arg)) {
+
+                        rule._resolve.push(key);
+                        obj.$_mutateRegister(arg);
+                    }
+                    else {
+                        if (resolver.normalize) {
+                            arg = resolver.normalize(arg);
+                            args[key] = arg;
+                        }
+
+                        if (resolver.assert) {
+                            const error = Common.validateArg(arg, key, resolver);
+                            Assert(!error, error, 'or reference');
+                        }
+                    }
+                }
+
+                args[key] = arg;
+            }
+        }
+
+        // Unique rules
+
+        if (!definition.multi) {
+            obj._ruleRemove(rule.name);
+            obj._singleRules.set(rule.name, rule);
+        }
+
+        if (definition.priority) {
+            obj._rules.unshift(rule);
+        }
+        else {
+            obj._rules.push(rule);
+        }
+
+        return obj;
+    }
+
+    $_compile(schema, options) {
+
+        return Compile.schema(this.$_root, schema, options);
+    }
+
+    $_createError(code, value, local, state, prefs, options = {}) {
+
+        const flags = options.flags !== false ? this._flags : {};
+        const messages = options.messages ? Messages.merge(this._definition.messages, options.messages) : this._definition.messages;
+        return new Errors.Report(code, value, local, flags, messages, state, prefs);
+    }
+
+    $_getRule(name) {
+
+        return this._singleRules.get(name);
+    }
+
+    $_match(value, state, prefs, overrides) {
+
+        prefs = Object.assign({}, prefs);       // Shallow cloned
+        prefs.abortEarly = true;
+        prefs._externals = false;
+
+        state.snapshot();
+        const result = !Validator.validate(value, this, state, prefs, overrides).errors;
+        state.restore();
+
+        return result;
+    }
+
+    $_modify(options) {
+
+        Common.assertOptions(options, ['each', 'once', 'ref', 'schema']);
+        return Modify.schema(this, options) || this;
+    }
+
+    $_mutateRebuild() {
+
+        this._refs.reset();
+        this._ids.reset();
+
+        const each = (item, { source, name, path, key }) => {
+
+            const family = this._definition[source][name]?.register;
+            if (family !== false) {
+                this.$_mutateRegister(item, { family, key });
+            }
+        };
+
+        this.$_modify({ each });
+
+        if (this._definition.rebuild) {
+            this._definition.rebuild(this);
+        }
+
+        return this;
+    }
+
+    $_mutateRegister(schema, { family, key } = {}) {
+
+        this._refs.register(schema, family);
+        this._ids.register(schema, { key });
+    }
+
+    $_property(name) {
+
+        return this._definition.properties[name];
+    }
+
+    $_reach(path) {
+
+        return this._ids.reach(path);
+    }
+
+    $_rootReferences() {
+
+        return this._refs.roots();
+    }
+
+    $_setFlag(name, value, options = {}) {
+
+        const flag = this._definition.flags[name] || {};
+        if (DeepEqual(value, flag.default)) {
+            value = undefined;
+        }
+
+        if (DeepEqual(value, this._flags[name])) {
+            return this;
+        }
+
+        const obj = options.clone !== false ? this.clone() : this;
+
+        if (value !== undefined) {
+            obj._flags[name] = value;
+            obj.$_mutateRegister(value);
+        }
+        else {
+            delete obj._flags[name];
+        }
+
+        return obj;
+    }
+
+    $_parent(method, ...args) {
+
+        return this[method][Common.symbols.parent].call(this, ...args);
+    }
+
+    $_validate(value, state, prefs) {
+
+        return Validator.validate(value, this, state, prefs);
+    }
+
+    // Internals
+
+    _assign(target) {
+
+        target.type = this.type;
+
+        target.$_root = this.$_root;
+
+        target.$_temp = Object.assign({}, this.$_temp);
+        target.$_temp.whens = {};
+
+        target._ids = this._ids.clone();
+        target._preferences = this._preferences;
+        target._valids = this._valids?.clone();
+        target._invalids = this._invalids?.clone();
+        target._rules = this._rules.slice();
+        target._singleRules = Clone(this._singleRules, { shallow: true });
+        target._refs = this._refs.clone();
+        target._flags = Object.assign({}, this._flags);
+        target._cache = null;
+
+        target.$_terms = {};
+        for (const key in this.$_terms) {
+            target.$_terms[key] = this.$_terms[key] ? this.$_terms[key].slice() : null;
+        }
+
+        // Backwards compatibility
+
+        target.$_super = {};
+        for (const override in this.$_super) {
+            target.$_super[override] = this._super[override].bind(target);
+        }
+
+        return target;
+    }
+
+    _default(flag, value, options = {}) {
+
+        Common.assertOptions(options, 'literal');
+
+        Assert(value !== undefined, 'Missing', flag, 'value');
+        Assert(typeof value === 'function' || !options.literal, 'Only function value supports literal option');
+
+        if (typeof value === 'function' &&
+            options.literal) {
+
+            value = {
+                [Common.symbols.literal]: true,
+                literal: value
+            };
+        }
+
+        const obj = this.$_setFlag(flag, value);
+        return obj;
+    }
+
+    _extend(options) {
+
+        Assert(!options.base, 'Cannot extend type with another base');
+
+        return Extend.type(this, options);
+    }
+
+    _generate(value, state, prefs) {
+
+        if (!this.$_terms.whens) {
+            return { schema: this };
+        }
+
+        // Collect matching whens
+
+        const whens = [];
+        const ids = [];
+        for (let i = 0; i < this.$_terms.whens.length; ++i) {
+            const when = this.$_terms.whens[i];
+
+            if (when.concat) {
+                whens.push(when.concat);
+                ids.push(`${i}.concat`);
+                continue;
+            }
+
+            const input = when.ref ? when.ref.resolve(value, state, prefs) : value;
+            const tests = when.is ? [when] : when.switch;
+            const before = ids.length;
+
+            for (let j = 0; j < tests.length; ++j) {
+                const { is, then, otherwise } = tests[j];
+
+                const baseId = `${i}${when.switch ? '.' + j : ''}`;
+                if (is.$_match(input, state.nest(is, `${baseId}.is`), prefs)) {
+                    if (then) {
+                        const localState = state.localize([...state.path, `${baseId}.then`], state.ancestors, state.schemas);
+                        const { schema: generated, id } = then._generate(value, localState, prefs);
+                        whens.push(generated);
+                        ids.push(`${baseId}.then${id ? `(${id})` : ''}`);
+                        break;
+                    }
+                }
+                else if (otherwise) {
+                    const localState = state.localize([...state.path, `${baseId}.otherwise`], state.ancestors, state.schemas);
+                    const { schema: generated, id } = otherwise._generate(value, localState, prefs);
+                    whens.push(generated);
+                    ids.push(`${baseId}.otherwise${id ? `(${id})` : ''}`);
+                    break;
+                }
+            }
+
+            if (when.break &&
+                ids.length > before) {          // Something matched
+
+                break;
+            }
+        }
+
+        // Check cache
+
+        const id = ids.join(', ');
+
+        if (!id) {
+            return { schema: this };
+        }
+
+        if (this.$_temp.whens[id]) {
+            return { schema: this.$_temp.whens[id], id };
+        }
+
+        // Generate dynamic schema
+
+        let obj = this;                                             // eslint-disable-line consistent-this
+        if (this._definition.generate) {
+            obj = this._definition.generate(this, value, state, prefs);
+        }
+
+        // Apply whens
+
+        for (const when of whens) {
+            obj = obj.concat(when);
+        }
+
+        // Cache result
+
+        this.$_temp.whens[id] = obj;
+        return { schema: obj, id };
+    }
+
+    _ruleRemove(name) {
+
+        if (!this._singleRules.has(name)) {
+            return this;
+        }
+
+        this._singleRules.delete(name);
+
+        const filtered = [];
+        for (let i = 0; i < this._rules.length; ++i) {
+            const test = this._rules[i];
+            if (test.name === name) {
+                continue;
+            }
+
+            filtered.push(test);
+        }
+
+        this._rules = filtered;
+    }
+
+    _values(values, key) {
+
+        Common.verifyFlat(values, key.slice(1, -1));
+
+        const obj = this.clone();
+
+        const override = values[0] === Common.symbols.override;
+        if (override) {
+            values = values.slice(1);
+        }
+
+        if (!obj[key] &&
+            values.length) {
+
+            obj[key] = new Values();
+        }
+        else if (override) {
+            obj[key] = values.length ? new Values() : null;
+            obj.$_mutateRebuild();
+        }
+
+        if (!obj[key]) {
+            return obj;
+        }
+
+        if (override) {
+            obj[key].override();
+        }
+
+        for (const value of values) {
+            Assert(value !== undefined, 'Cannot call allow/valid/invalid with undefined');
+            Assert(value !== Common.symbols.override, 'Override must be the first value');
+
+            const other = key === '_invalids' ? '_valids' : '_invalids';
+            if (obj[other]) {
+                obj[other].remove(value);
+                if (!obj[other].length) {
+                    Assert(key === '_valids' || !obj._flags.only, 'Setting invalid value', value, 'leaves schema rejecting all values due to previous valid rule');
+                    obj[other] = null;
+                }
+            }
+
+            obj[key].add(value, obj._refs);
+        }
+
+        return obj;
+    }
+};
+
+
+internals.Base.prototype[Common.symbols.any] = {
+    version: Common.version,
+    compile: Compile.compile,
+    root: '$_root'
+};
+
+
+internals.Base.prototype.isImmutable = true;                // Prevents Hoek from deep cloning schema objects (must be on prototype)
+
+
+// Aliases
+
+internals.Base.prototype.deny = internals.Base.prototype.invalid;
+internals.Base.prototype.disallow = internals.Base.prototype.invalid;
+internals.Base.prototype.equal = internals.Base.prototype.valid;
+internals.Base.prototype.exist = internals.Base.prototype.required;
+internals.Base.prototype.not = internals.Base.prototype.invalid;
+internals.Base.prototype.options = internals.Base.prototype.prefs;
+internals.Base.prototype.preferences = internals.Base.prototype.prefs;
+
+
+module.exports = new internals.Base();
diff --git a/node_modules/@hapi/validate/lib/common.js b/node_modules/@hapi/validate/lib/common.js
new file mode 100755
index 0000000..e41d482
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/common.js
@@ -0,0 +1,205 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const AssertError = require('@hapi/hoek/assertError');
+
+const Pkg = require('../package.json');
+
+let Messages;
+let Schemas;
+
+
+const internals = {
+    isoDate: /^(?:[-+]\d{2})?(?:\d{4}(?!\d{2}\b))(?:(-?)(?:(?:0[1-9]|1[0-2])(?:\1(?:[12]\d|0[1-9]|3[01]))?|W(?:[0-4]\d|5[0-2])(?:-?[1-7])?|(?:00[1-9]|0[1-9]\d|[12]\d{2}|3(?:[0-5]\d|6[1-6])))(?![T]$|[T][\d]+Z$)(?:[T\s](?:(?:(?:[01]\d|2[0-3])(?:(:?)[0-5]\d)?|24\:?00)(?:[.,]\d+(?!:))?)(?:\2[0-5]\d(?:[.,]\d+)?)?(?:[Z]|(?:[+-])(?:[01]\d|2[0-3])(?::?[0-5]\d)?)?)?)?$/
+};
+
+
+exports.version = Pkg.version;
+
+
+exports.defaults = {
+    abortEarly: true,
+    allowUnknown: false,
+    context: null,
+    convert: true,
+    dateFormat: 'iso',
+    errors: {
+        escapeHtml: false,
+        label: 'path',
+        language: null,
+        render: true,
+        stack: false,
+        wrap: {
+            label: '"',
+            array: '[]'
+        }
+    },
+    messages: {},
+    nonEnumerables: false,
+    noDefaults: false,
+    presence: 'optional',
+    skipFunctions: false,
+    stripUnknown: false
+};
+
+
+exports.symbols = {
+    any: Symbol.for('@hapi/joi/schema'),            // Used to internally identify any-based types (shared with other joi versions)
+    arraySingle: Symbol('arraySingle'),
+    deepDefault: Symbol('deepDefault'),
+    errors: Symbol('errors'),
+    literal: Symbol('literal'),
+    override: Symbol('override'),
+    parent: Symbol('parent'),
+    prefs: Symbol('prefs'),
+    ref: Symbol('ref'),
+    template: Symbol('template'),
+    values: Symbol('values')
+};
+
+
+exports.assertOptions = function (options, keys, name = 'Options') {
+
+    Assert(options && typeof options === 'object' && !Array.isArray(options), 'Options must be of type object');
+    const unknownKeys = Object.keys(options).filter((k) => !keys.includes(k));
+    Assert(unknownKeys.length === 0, `${name} contain unknown keys: ${unknownKeys}`);
+};
+
+
+exports.checkPreferences = function (prefs) {
+
+    Schemas = Schemas || require('./schemas');
+
+    const result = Schemas.preferences.validate(prefs);
+
+    if (result.error) {
+        throw new AssertError([result.error.details[0].message]);
+    }
+};
+
+
+exports.compare = function (a, b, operator) {
+
+    switch (operator) {
+        case '=': return a === b;
+        case '>': return a > b;
+        case '<': return a < b;
+        case '>=': return a >= b;
+        case '<=': return a <= b;
+    }
+};
+
+
+exports.default = function (value, defaultValue) {
+
+    return value === undefined ? defaultValue : value;
+};
+
+
+exports.isIsoDate = function (date) {
+
+    return internals.isoDate.test(date);
+};
+
+
+exports.isNumber = function (value) {
+
+    return typeof value === 'number' && !isNaN(value);
+};
+
+
+exports.isResolvable = function (obj) {
+
+    if (!obj) {
+        return false;
+    }
+
+    return obj[exports.symbols.ref] || obj[exports.symbols.template];
+};
+
+
+exports.isSchema = function (schema, options = {}) {
+
+    const any = schema && schema[exports.symbols.any];
+    if (!any) {
+        return false;
+    }
+
+    return true;
+};
+
+
+exports.limit = function (value) {
+
+    return Number.isSafeInteger(value) && value >= 0;
+};
+
+
+exports.preferences = function (target, source) {
+
+    Messages = Messages || require('./messages');
+
+    target = target || {};
+    source = source || {};
+
+    const merged = Object.assign({}, target, source);
+    if (source.errors &&
+        target.errors) {
+
+        merged.errors = Object.assign({}, target.errors, source.errors);
+        merged.errors.wrap = Object.assign({}, target.errors.wrap, source.errors.wrap);
+    }
+
+    if (source.messages) {
+        merged.messages = Messages.compile(source.messages, target.messages);
+    }
+
+    delete merged[exports.symbols.prefs];
+    return merged;
+};
+
+
+exports.tryWithPath = function (fn, key, options = {}) {
+
+    try {
+        return fn();
+    }
+    catch (err) {
+        if (err.path !== undefined) {
+            err.path = key + '.' + err.path;
+        }
+        else {
+            err.path = key;
+        }
+
+        if (options.append) {
+            err.message = `${err.message} (${err.path})`;
+        }
+
+        throw err;
+    }
+};
+
+
+exports.validateArg = function (value, label, { assert, message }) {
+
+    if (exports.isSchema(assert)) {
+        const result = assert.validate(value);
+        if (!result.error) {
+            return;
+        }
+
+        return result.error.message;
+    }
+    else if (!assert(value)) {
+        return label ? `${label} ${message}` : message;
+    }
+};
+
+
+exports.verifyFlat = function (args, method) {
+
+    for (const arg of args) {
+        Assert(!Array.isArray(arg), 'Method no longer accepts array arguments:', method);
+    }
+};
diff --git a/node_modules/@hapi/validate/lib/compile.js b/node_modules/@hapi/validate/lib/compile.js
new file mode 100755
index 0000000..e9e39d0
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/compile.js
@@ -0,0 +1,233 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Common = require('./common');
+const Ref = require('./ref');
+
+
+const internals = {};
+
+
+exports.schema = function (Joi, config, options = {}) {
+
+    Common.assertOptions(options, ['appendPath', 'override']);
+
+    try {
+        return internals.schema(Joi, config, options);
+    }
+    catch (err) {
+        if (options.appendPath &&
+            err.path !== undefined) {
+
+            err.message = `${err.message} (${err.path})`;
+        }
+
+        throw err;
+    }
+};
+
+
+internals.schema = function (Joi, config, options) {
+
+    Assert(config !== undefined, 'Invalid undefined schema');
+
+    if (Array.isArray(config)) {
+        Assert(config.length, 'Invalid empty array schema');
+
+        if (config.length === 1) {
+            config = config[0];
+        }
+    }
+
+    const valid = (base, ...values) => {
+
+        if (options.override !== false) {
+            return base.valid(Joi.override, ...values);
+        }
+
+        return base.valid(...values);
+    };
+
+    if (internals.simple(config)) {
+        return valid(Joi, config);
+    }
+
+    if (typeof config === 'function') {
+        return Joi.custom(config);
+    }
+
+    Assert(typeof config === 'object', 'Invalid schema content:', typeof config);
+
+    if (Common.isResolvable(config)) {
+        return valid(Joi, config);
+    }
+
+    if (Common.isSchema(config)) {
+        return config;
+    }
+
+    if (Array.isArray(config)) {
+        for (const item of config) {
+            if (!internals.simple(item)) {
+                return Joi.alternatives().try(...config);
+            }
+        }
+
+        return valid(Joi, ...config);
+    }
+
+    if (config instanceof RegExp) {
+        return Joi.string().regex(config);
+    }
+
+    if (config instanceof Date) {
+        return valid(Joi.date(), config);
+    }
+
+    Assert(Object.getPrototypeOf(config) === Object.getPrototypeOf({}), 'Schema can only contain plain objects');
+
+    return Joi.object().keys(config);
+};
+
+
+exports.ref = function (id, options) {
+
+    return Ref.isRef(id) ? id : Ref.create(id, options);
+};
+
+
+exports.compile = function (root, schema) {
+
+    // Compiled by any supported version
+
+    const any = schema && schema[Common.symbols.any];
+    if (any) {
+        Assert(any.version === Common.version, 'Cannot mix different versions of joi schemas:', any.version, Common.version);
+        return schema;
+    }
+
+    // Uncompiled root
+
+    return exports.schema(root, schema, { appendPath: true });          // Will error if schema contains other versions
+};
+
+
+internals.simple = function (value) {
+
+    return value === null || ['boolean', 'string', 'number'].includes(typeof value);
+};
+
+
+exports.when = function (schema, condition, options) {
+
+    if (options === undefined) {
+        Assert(condition && typeof condition === 'object', 'Missing options');
+
+        options = condition;
+        condition = Ref.create('.');
+    }
+
+    if (Array.isArray(options)) {
+        options = { switch: options };
+    }
+
+    Common.assertOptions(options, ['is', 'not', 'then', 'otherwise', 'switch', 'break']);
+
+    // Schema condition
+
+    if (Common.isSchema(condition)) {
+        Assert(options.is === undefined, '"is" can not be used with a schema condition');
+        Assert(options.not === undefined, '"not" can not be used with a schema condition');
+        Assert(options.switch === undefined, '"switch" can not be used with a schema condition');
+
+        return internals.condition(schema, { is: condition, then: options.then, otherwise: options.otherwise, break: options.break });
+    }
+
+    // Single condition
+
+    Assert(Ref.isRef(condition) || typeof condition === 'string', 'Invalid condition:', condition);
+    Assert(options.not === undefined || options.is === undefined, 'Cannot combine "is" with "not"');
+
+    if (options.switch === undefined) {
+        let rule = options;
+        if (options.not !== undefined) {
+            rule = { is: options.not, then: options.otherwise, otherwise: options.then, break: options.break };
+        }
+
+        let is = rule.is !== undefined ? schema.$_compile(rule.is) : schema.$_root.invalid(null, false, 0, '').required();
+        Assert(rule.then !== undefined || rule.otherwise !== undefined, 'options must have at least one of "then", "otherwise", or "switch"');
+        Assert(rule.break === undefined || rule.then === undefined || rule.otherwise === undefined, 'Cannot specify then, otherwise, and break all together');
+
+        if (options.is !== undefined &&
+            !Ref.isRef(options.is) &&
+            !Common.isSchema(options.is)) {
+
+            is = is.required();                     // Only apply required if this wasn't already a schema or a ref
+        }
+
+        return internals.condition(schema, { ref: exports.ref(condition), is, then: rule.then, otherwise: rule.otherwise, break: rule.break });
+    }
+
+    // Switch statement
+
+    Assert(Array.isArray(options.switch), '"switch" must be an array');
+    Assert(options.is === undefined, 'Cannot combine "switch" with "is"');
+    Assert(options.not === undefined, 'Cannot combine "switch" with "not"');
+    Assert(options.then === undefined, 'Cannot combine "switch" with "then"');
+
+    const rule = {
+        ref: exports.ref(condition),
+        switch: [],
+        break: options.break
+    };
+
+    for (let i = 0; i < options.switch.length; ++i) {
+        const test = options.switch[i];
+        const last = i === options.switch.length - 1;
+
+        Common.assertOptions(test, last ? ['is', 'then', 'otherwise'] : ['is', 'then']);
+
+        Assert(test.is !== undefined, 'Switch statement missing "is"');
+        Assert(test.then !== undefined, 'Switch statement missing "then"');
+
+        const item = {
+            is: schema.$_compile(test.is),
+            then: schema.$_compile(test.then)
+        };
+
+        if (!Ref.isRef(test.is) &&
+            !Common.isSchema(test.is)) {
+
+            item.is = item.is.required();           // Only apply required if this wasn't already a schema or a ref
+        }
+
+        if (last) {
+            Assert(options.otherwise === undefined || test.otherwise === undefined, 'Cannot specify "otherwise" inside and outside a "switch"');
+            const otherwise = options.otherwise !== undefined ? options.otherwise : test.otherwise;
+            if (otherwise !== undefined) {
+                Assert(rule.break === undefined, 'Cannot specify both otherwise and break');
+                item.otherwise = schema.$_compile(otherwise);
+            }
+        }
+
+        rule.switch.push(item);
+    }
+
+    return rule;
+};
+
+
+internals.condition = function (schema, condition) {
+
+    for (const key of ['then', 'otherwise']) {
+        if (condition[key] === undefined) {
+            delete condition[key];
+        }
+        else {
+            condition[key] = schema.$_compile(condition[key]);
+        }
+    }
+
+    return condition;
+};
diff --git a/node_modules/@hapi/validate/lib/errors.js b/node_modules/@hapi/validate/lib/errors.js
new file mode 100755
index 0000000..5082d2f
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/errors.js
@@ -0,0 +1,238 @@
+'use strict';
+
+const Annotate = require('./annotate');
+const Common = require('./common');
+const Template = require('./template');
+
+
+const internals = {};
+
+
+exports.Report = class {
+
+    constructor(code, value, local, flags, messages, state, prefs) {
+
+        this.code = code;
+        this.flags = flags;
+        this.messages = messages;
+        this.path = state.path;
+        this.prefs = prefs;
+        this.state = state;
+        this.value = value;
+
+        this.message = null;
+
+        this.local = local || {};
+        this.local.label = exports.label(this.flags, this.state, this.prefs, this.messages);
+
+        if (this.value !== undefined &&
+            !this.local.hasOwnProperty('value')) {
+
+            this.local.value = this.value;
+        }
+
+        if (this.path.length) {
+            const key = this.path[this.path.length - 1];
+            if (typeof key !== 'object') {
+                this.local.key = key;
+            }
+        }
+    }
+
+    toString() {
+
+        if (this.message) {
+            return this.message;
+        }
+
+        const code = this.code;
+
+        if (!this.prefs.errors.render) {
+            return this.code;
+        }
+
+        const template = this._template(this.prefs.messages) ||
+            this._template(this.messages);
+
+        if (template === undefined) {
+            return `Error code "${code}" is not defined, your custom type is missing the correct messages definition`;
+        }
+
+        // Render and cache result
+
+        this.message = template.render(this.value, this.state, this.prefs, this.local, { errors: this.prefs.errors, messages: [this.prefs.messages, this.messages] });
+        if (!this.prefs.errors.label) {
+            this.message = this.message.replace(/^"" /, '').trim();
+        }
+
+        return this.message;
+    }
+
+    _template(messages) {
+
+        return exports.template(this.value, messages, this.code, this.state, this.prefs);
+    }
+};
+
+
+exports.path = function (path) {
+
+    let label = '';
+    for (const segment of path) {
+        if (typeof segment === 'object') {          // Exclude array single path segment
+            continue;
+        }
+
+        if (typeof segment === 'string') {
+            if (label) {
+                label += '.';
+            }
+
+            label += segment;
+        }
+        else {
+            label += `[${segment}]`;
+        }
+    }
+
+    return label;
+};
+
+
+exports.template = function (value, messages, code, state, prefs) {
+
+    if (Template.isTemplate(messages)) {
+        return code !== 'root' ? messages : null;
+    }
+
+    let lang = prefs.errors.language;
+    if (Common.isResolvable(lang)) {
+        lang = lang.resolve(value, state, prefs);
+    }
+
+    if (lang &&
+        messages[lang] &&
+        messages[lang][code] !== undefined) {
+
+        return messages[lang][code];
+    }
+
+    return messages[code];
+};
+
+
+exports.label = function (flags, state, prefs, messages) {
+
+    if (!prefs.errors.label) {
+        return '';
+    }
+
+    let path = state.path;
+    if (prefs.errors.label === 'key' &&
+        state.path.length > 1) {
+
+        path = state.path.slice(-1);
+    }
+
+    const normalized = exports.path(path);
+    if (normalized) {
+        return normalized;
+    }
+
+    return exports.template(null, prefs.messages, 'root', state, prefs) ||
+        exports.template(null, messages, 'root', state, prefs) ||
+        'value';
+};
+
+
+exports.process = function (errors, original, prefs) {
+
+    if (!errors) {
+        return null;
+    }
+
+    const { override, message, details } = exports.details(errors);
+    if (override) {
+        return override;
+    }
+
+    if (prefs.errors.stack) {
+        return new exports.ValidationError(message, details, original);
+    }
+
+    const limit = Error.stackTraceLimit;
+    Error.stackTraceLimit = 0;
+    const validationError = new exports.ValidationError(message, details, original);
+    Error.stackTraceLimit = limit;
+    return validationError;
+};
+
+
+exports.details = function (errors, options = {}) {
+
+    let messages = [];
+    const details = [];
+
+    for (const item of errors) {
+
+        // Override
+
+        if (item instanceof Error) {
+            if (options.override !== false) {
+                return { override: item };
+            }
+
+            const message = item.toString();
+            messages.push(message);
+
+            details.push({
+                message,
+                type: 'override',
+                context: { error: item }
+            });
+
+            continue;
+        }
+
+        // Report
+
+        const message = item.toString();
+        messages.push(message);
+
+        details.push({
+            message,
+            path: item.path.filter((v) => typeof v !== 'object'),
+            type: item.code,
+            context: item.local
+        });
+    }
+
+    if (messages.length > 1) {
+        messages = [...new Set(messages)];
+    }
+
+    return { message: messages.join('. '), details };
+};
+
+
+exports.ValidationError = class extends Error {
+
+    constructor(message, details, original) {
+
+        super(message);
+        this._original = original;
+        this.details = details;
+    }
+
+    static isError(err) {
+
+        return err instanceof exports.ValidationError;
+    }
+};
+
+
+exports.ValidationError.prototype.isJoi = true;
+
+exports.ValidationError.prototype.name = 'ValidationError';
+
+exports.ValidationError.prototype.annotate = Annotate.error;
diff --git a/node_modules/@hapi/validate/lib/extend.js b/node_modules/@hapi/validate/lib/extend.js
new file mode 100755
index 0000000..e337fac
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/extend.js
@@ -0,0 +1,141 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+
+const Common = require('./common');
+const Messages = require('./messages');
+
+
+const internals = {};
+
+
+exports.type = function (from, options) {
+
+    const base = Object.getPrototypeOf(from);
+    const prototype = Clone(base);
+    const schema = from._assign(Object.create(prototype));
+    const def = Object.assign({}, options);                                 // Shallow cloned
+    delete def.base;
+
+    prototype._definition = def;
+
+    const parent = base._definition || {};
+    def.messages = Messages.merge(parent.messages, def.messages);
+    def.properties = Object.assign({}, parent.properties, def.properties);
+
+    // Type
+
+    schema.type = def.type;
+
+    // Flags
+
+    def.flags = Object.assign({}, parent.flags, def.flags);
+
+    // Terms
+
+    const terms = Object.assign({}, parent.terms);
+    if (def.terms) {
+        for (const name in def.terms) {                                     // Only apply own terms
+            const term = def.terms[name];
+            Assert(schema.$_terms[name] === undefined, 'Invalid term override for', def.type, name);
+            schema.$_terms[name] = term.init;
+            terms[name] = term;
+        }
+    }
+
+    def.terms = terms;
+
+    // Constructor arguments
+
+    if (!def.args) {
+        def.args = parent.args;
+    }
+
+    // Coerce
+
+    if (def.coerce) {
+        if (typeof def.coerce === 'function') {
+            def.coerce = { method: def.coerce };
+        }
+
+        if (def.coerce.from &&
+            !Array.isArray(def.coerce.from)) {
+
+            def.coerce = { method: def.coerce.method, from: [].concat(def.coerce.from) };
+        }
+    }
+
+    def.coerce = def.coerce || parent.coerce;
+
+    // Validate
+
+    def.validate = def.validate || parent.validate;
+
+    // Rules
+
+    const rules = Object.assign({}, parent.rules);
+    if (def.rules) {
+        for (const name in def.rules) {
+            const rule = def.rules[name];
+            Assert(typeof rule === 'object', 'Invalid rule definition for', def.type, name);
+
+            const method = rule.method;
+            if (method) {
+                Assert(!prototype[name], 'Rule conflict in', def.type, name);
+                prototype[name] = method;
+            }
+
+            Assert(!rules[name], 'Rule conflict in', def.type, name);
+            rules[name] = rule;
+
+            if (rule.alias) {
+                const aliases = [].concat(rule.alias);
+                for (const alias of aliases) {
+                    prototype[alias] = rule.method;
+                }
+            }
+
+            if (rule.args) {
+                rule.argsByName = new Map();
+                rule.args = rule.args.map((arg) => {
+
+                    if (typeof arg === 'string') {
+                        arg = { name: arg };
+                    }
+
+                    Assert(!rule.argsByName.has(arg.name), 'Duplicated argument name', arg.name);
+
+                    rule.argsByName.set(arg.name, arg);
+                    return arg;
+                });
+            }
+        }
+    }
+
+    def.rules = rules;
+
+    // Overrides
+
+    if (def.overrides) {
+        prototype._super = base;
+        schema.$_super = {};                                                            // Backwards compatibility
+        for (const override in def.overrides) {
+            Assert(base[override], 'Cannot override missing', override);
+            def.overrides[override][Common.symbols.parent] = base[override];
+            schema.$_super[override] = base[override].bind(schema);                     // Backwards compatibility
+        }
+
+        Object.assign(prototype, def.overrides);
+    }
+
+    // Casts
+
+    def.cast = Object.assign({}, parent.cast, def.cast);
+
+    // Rebuild
+
+    def.rebuild = def.rebuild || parent.rebuild;
+
+    return schema;
+};
diff --git a/node_modules/@hapi/validate/lib/index.js b/node_modules/@hapi/validate/lib/index.js
new file mode 100755
index 0000000..e300767
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/index.js
@@ -0,0 +1,166 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+
+const Common = require('./common');
+const Compile = require('./compile');
+const Errors = require('./errors');
+const Ref = require('./ref');
+
+
+const internals = {
+    types: {
+        alternatives: require('./types/alternatives'),
+        any: require('./types/any'),
+        array: require('./types/array'),
+        boolean: require('./types/boolean'),
+        date: require('./types/date'),
+        function: require('./types/function'),
+        link: require('./types/link'),
+        number: require('./types/number'),
+        object: require('./types/object'),
+        string: require('./types/string'),
+        symbol: require('./types/symbol')
+    },
+    aliases: {
+        alt: 'alternatives',
+        bool: 'boolean',
+        func: 'function'
+    }
+};
+
+
+if (Buffer) {                                                           // $lab:coverage:ignore$
+    internals.types.binary = require('./types/binary');
+}
+
+
+internals.root = function () {
+
+    const root = {
+        _types: new Set(Object.keys(internals.types))
+    };
+
+    // Types
+
+    for (const type of root._types) {
+        root[type] = function (...args) {
+
+            Assert(!args.length || ['alternatives', 'link', 'object'].includes(type), 'The', type, 'type does not allow arguments');
+            return internals.generate(this, internals.types[type], args);
+        };
+    }
+
+    // Shortcuts
+
+    for (const method of ['allow', 'custom', 'disallow', 'equal', 'exist', 'forbidden', 'invalid', 'not', 'only', 'optional', 'options', 'prefs', 'preferences', 'required', 'strip', 'valid', 'when']) {
+        root[method] = function (...args) {
+
+            return this.any()[method](...args);
+        };
+    }
+
+    // Methods
+
+    Object.assign(root, internals.methods);
+
+    // Aliases
+
+    for (const alias in internals.aliases) {
+        const target = internals.aliases[alias];
+        root[alias] = root[target];
+    }
+
+    return root;
+};
+
+
+internals.methods = {
+
+    ValidationError: Errors.ValidationError,
+    version: Common.version,
+
+    assert(value, schema, ...args /* [message], [options] */) {
+
+        internals.assert(value, schema, true, args);
+    },
+
+    attempt(value, schema, ...args /* [message], [options] */) {
+
+        return internals.assert(value, schema, false, args);
+    },
+
+    checkPreferences(prefs) {
+
+        Common.checkPreferences(prefs);
+    },
+
+    compile(schema, options) {
+
+        return Compile.compile(this, schema, options);
+    },
+
+    isError: Errors.ValidationError.isError,
+    isRef: Ref.isRef,
+    isSchema: Common.isSchema,
+
+    in(...args) {
+
+        return Ref.in(...args);
+    },
+
+    override: Common.symbols.override,
+
+    ref(...args) {
+
+        return Ref.create(...args);
+    }
+};
+
+
+// Helpers
+
+internals.assert = function (value, schema, annotate, args /* [message], [options] */) {
+
+    const message = args[0] instanceof Error || typeof args[0] === 'string' ? args[0] : null;
+    const options = message ? args[1] : args[0];
+    const result = schema.validate(value, Common.preferences({ errors: { stack: true } }, options || {}));
+
+    let error = result.error;
+    if (!error) {
+        return result.value;
+    }
+
+    if (message instanceof Error) {
+        throw message;
+    }
+
+    const display = annotate && typeof error.annotate === 'function' ? error.annotate() : error.message;
+
+    if (error instanceof Errors.ValidationError === false) {
+        error = Clone(error);
+    }
+
+    error.message = message ? `${message} ${display}` : display;
+    throw error;
+};
+
+
+internals.generate = function (root, schema, args) {
+
+    Assert(root, 'Must be invoked on a Joi instance.');
+
+    schema.$_root = root;
+
+    if (!schema._definition.args ||
+        !args.length) {
+
+        return schema;
+    }
+
+    return schema._definition.args(schema, ...args);
+};
+
+
+module.exports = internals.root();
diff --git a/node_modules/@hapi/validate/lib/messages.js b/node_modules/@hapi/validate/lib/messages.js
new file mode 100755
index 0000000..4648be5
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/messages.js
@@ -0,0 +1,139 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+
+const Template = require('./template');
+
+
+const internals = {};
+
+
+exports.compile = function (messages, target) {
+
+    // Single value string ('plain error message', 'template {error} message')
+
+    if (typeof messages === 'string') {
+        Assert(!target, 'Cannot set single message string');
+        return new Template(messages);
+    }
+
+    // Single value template
+
+    if (Template.isTemplate(messages)) {
+        Assert(!target, 'Cannot set single message template');
+        return messages;
+    }
+
+    // By error code { 'number.min': <string | template> }
+
+    Assert(typeof messages === 'object' && !Array.isArray(messages), 'Invalid message options');
+
+    target = target ? Clone(target) : {};
+
+    for (let code in messages) {
+        const message = messages[code];
+
+        if (code === 'root' ||
+            Template.isTemplate(message)) {
+
+            target[code] = message;
+            continue;
+        }
+
+        if (typeof message === 'string') {
+            target[code] = new Template(message);
+            continue;
+        }
+
+        // By language { english: { 'number.min': <string | template> } }
+
+        Assert(typeof message === 'object' && !Array.isArray(message), 'Invalid message for', code);
+
+        const language = code;
+        target[language] = target[language] || {};
+
+        for (code in message) {
+            const localized = message[code];
+
+            if (code === 'root' ||
+                Template.isTemplate(localized)) {
+
+                target[language][code] = localized;
+                continue;
+            }
+
+            Assert(typeof localized === 'string', 'Invalid message for', code, 'in', language);
+            target[language][code] = new Template(localized);
+        }
+    }
+
+    return target;
+};
+
+
+exports.merge = function (base, extended) {
+
+    if (!base) {
+        return exports.compile(extended);
+    }
+
+    if (!extended) {
+        return base;
+    }
+
+    // Single value string
+
+    if (typeof extended === 'string') {
+        return new Template(extended);
+    }
+
+    // Single value template
+
+    if (Template.isTemplate(extended)) {
+        return extended;
+    }
+
+    // By error code { 'number.min': <string | template> }
+
+    const target = Clone(base);
+
+    for (let code in extended) {
+        const message = extended[code];
+
+        if (code === 'root' ||
+            Template.isTemplate(message)) {
+
+            target[code] = message;
+            continue;
+        }
+
+        if (typeof message === 'string') {
+            target[code] = new Template(message);
+            continue;
+        }
+
+        // By language { english: { 'number.min': <string | template> } }
+
+        Assert(typeof message === 'object' && !Array.isArray(message), 'Invalid message for', code);
+
+        const language = code;
+        target[language] = target[language] || {};
+
+        for (code in message) {
+            const localized = message[code];
+
+            if (code === 'root' ||
+                Template.isTemplate(localized)) {
+
+                target[language][code] = localized;
+                continue;
+            }
+
+            Assert(typeof localized === 'string', 'Invalid message for', code, 'in', language);
+            target[language][code] = new Template(localized);
+        }
+    }
+
+    return target;
+};
diff --git a/node_modules/@hapi/validate/lib/modify.js b/node_modules/@hapi/validate/lib/modify.js
new file mode 100755
index 0000000..41e5c91
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/modify.js
@@ -0,0 +1,199 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Common = require('./common');
+const Ref = require('./ref');
+
+
+const internals = {};
+
+
+exports.Ids = internals.Ids = class {
+
+    constructor() {
+
+        this._byId = new Map();
+        this._byKey = new Map();
+        this._schemaChain = false;
+    }
+
+    clone() {
+
+        const clone = new internals.Ids();
+        clone._byId = new Map(this._byId);
+        clone._byKey = new Map(this._byKey);
+        clone._schemaChain = this._schemaChain;
+        return clone;
+    }
+
+    concat(source) {
+
+        if (source._schemaChain) {
+            this._schemaChain = true;
+        }
+
+        for (const [id, value] of source._byId.entries()) {
+            Assert(!this._byKey.has(id), 'Schema id conflicts with existing key:', id);
+            this._byId.set(id, value);
+        }
+
+        for (const [key, value] of source._byKey.entries()) {
+            Assert(!this._byId.has(key), 'Schema key conflicts with existing id:', key);
+            this._byKey.set(key, value);
+        }
+    }
+
+    reach(path, behind = []) {
+
+        const current = path[0];
+        const node = this._get(current);
+        Assert(node, 'Schema does not contain path', [...behind, ...path].join('.'));
+
+        const forward = path.slice(1);
+        if (!forward.length) {
+            return node.schema;
+        }
+
+        return node.schema._ids.reach(forward, [...behind, current]);
+    }
+
+    register(schema, { key } = {}) {
+
+        if (!schema ||
+            !Common.isSchema(schema)) {
+
+            return;
+        }
+
+        if (schema.$_property('schemaChain') ||
+            schema._ids._schemaChain) {
+
+            this._schemaChain = true;
+        }
+
+        const id = schema._flags.id;
+        if (id) {
+            const existing = this._byId.get(id);
+            Assert(!existing || existing.schema === schema, 'Cannot add different schemas with the same id:', id);
+            Assert(!this._byKey.has(id), 'Schema id conflicts with existing key:', id);
+
+            this._byId.set(id, { schema, id });
+        }
+
+        if (key) {
+            Assert(!this._byKey.has(key), 'Schema already contains key:', key);
+            Assert(!this._byId.has(key), 'Schema key conflicts with existing id:', key);
+
+            this._byKey.set(key, { schema, id: key });
+        }
+    }
+
+    reset() {
+
+        this._byId = new Map();
+        this._byKey = new Map();
+        this._schemaChain = false;
+    }
+
+    _get(id) {
+
+        return this._byId.get(id) || this._byKey.get(id);
+    }
+};
+
+
+exports.schema = function (schema, options) {
+
+    let obj;
+
+    for (const name in schema._flags) {
+        if (name[0] === '_') {
+            continue;
+        }
+
+        const result = internals.scan(schema._flags[name], { source: 'flags', name }, options);
+        if (result !== undefined) {
+            obj = obj || schema.clone();
+            obj._flags[name] = result;
+        }
+    }
+
+    for (let i = 0; i < schema._rules.length; ++i) {
+        const rule = schema._rules[i];
+        const result = internals.scan(rule.args, { source: 'rules', name: rule.name }, options);
+        if (result !== undefined) {
+            obj = obj || schema.clone();
+            const clone = Object.assign({}, rule);
+            clone.args = result;
+            obj._rules[i] = clone;
+
+            const existingUnique = obj._singleRules.get(rule.name);
+            if (existingUnique === rule) {
+                obj._singleRules.set(rule.name, clone);
+            }
+        }
+    }
+
+    for (const name in schema.$_terms) {
+        if (name[0] === '_') {
+            continue;
+        }
+
+        const result = internals.scan(schema.$_terms[name], { source: 'terms', name }, options);
+        if (result !== undefined) {
+            obj = obj || schema.clone();
+            obj.$_terms[name] = result;
+        }
+    }
+
+    return obj;
+};
+
+
+internals.scan = function (item, source, options, _path, _key) {
+
+    const path = _path || [];
+
+    if (item === null ||
+        typeof item !== 'object') {
+
+        return;
+    }
+
+    let clone;
+
+    if (Array.isArray(item)) {
+        for (let i = 0; i < item.length; ++i) {
+            const key = source.name === 'keys' && item[i].key;
+            const result = internals.scan(item[i], source, options, [i, ...path], key);
+            if (result !== undefined) {
+                clone = clone || item.slice();
+                clone[i] = result;
+            }
+        }
+
+        return clone;
+    }
+
+    if (options.schema !== false && Common.isSchema(item) ||
+        options.ref !== false && Ref.isRef(item)) {
+
+        const result = options.each(item, { ...source, path, key: _key });
+        return result;
+    }
+
+    for (const key in item) {
+        if (key[0] === '_') {
+            continue;
+        }
+
+        const result = internals.scan(item[key], source, options, [key, ...path], _key);
+        if (result !== undefined) {
+            clone = clone || Object.assign({}, item);
+            clone[key] = result;
+        }
+    }
+
+    return clone;
+};
diff --git a/node_modules/@hapi/validate/lib/ref.js b/node_modules/@hapi/validate/lib/ref.js
new file mode 100755
index 0000000..a5773bb
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/ref.js
@@ -0,0 +1,344 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+const Reach = require('@hapi/hoek/reach');
+
+const Common = require('./common');
+
+const internals = {
+    symbol: Symbol('ref'),      // Used to internally identify references (shared with other joi versions)
+    defaults: {
+        adjust: null,
+        in: false,
+        iterables: null,
+        map: null,
+        separator: '.',
+        type: 'value'
+    }
+};
+
+
+exports.create = function (key, options = {}) {
+
+    Assert(typeof key === 'string', 'Invalid reference key:', key);
+    Common.assertOptions(options, ['adjust', 'ancestor', 'in', 'iterables', 'map', 'prefix', 'separator']);
+    Assert(!options.prefix || typeof options.prefix === 'object', 'options.prefix must be of type object');
+
+    const ref = Object.assign({}, internals.defaults, options);
+    delete ref.prefix;
+
+    const separator = ref.separator;
+    const context = internals.context(key, separator, options.prefix);
+    ref.type = context.type;
+    key = context.key;
+
+    if (ref.type === 'value') {
+        if (context.root) {
+            Assert(!separator || key[0] !== separator, 'Cannot specify relative path with root prefix');
+            ref.ancestor = 'root';
+            if (!key) {
+                key = null;
+            }
+        }
+
+        if (separator &&
+            separator === key) {
+
+            key = null;
+            ref.ancestor = 0;
+        }
+        else {
+            if (ref.ancestor !== undefined) {
+                Assert(!separator || !key || key[0] !== separator, 'Cannot combine prefix with ancestor option');
+            }
+            else {
+                const [ancestor, slice] = internals.ancestor(key, separator);
+                if (slice) {
+                    key = key.slice(slice);
+                    if (key === '') {
+                        key = null;
+                    }
+                }
+
+                ref.ancestor = ancestor;
+            }
+        }
+    }
+
+    ref.path = separator ? (key === null ? [] : key.split(separator)) : [key];
+
+    return new internals.Ref(ref);
+};
+
+
+exports.in = function (key, options = {}) {
+
+    return exports.create(key, Object.assign({}, options, { in: true }));
+};
+
+
+exports.isRef = function (ref) {
+
+    return ref ? !!ref[Common.symbols.ref] : false;
+};
+
+
+internals.Ref = class {
+
+    constructor(options) {
+
+        Assert(typeof options === 'object', 'Invalid reference construction');
+        Common.assertOptions(options, [
+            'adjust', 'ancestor', 'in', 'iterables', 'map', 'path', 'separator', 'type',    // Copied
+            'depth', 'key', 'root', 'display'                                               // Overridden
+        ]);
+
+        Assert([false, undefined].includes(options.separator) || typeof options.separator === 'string' && options.separator.length === 1, 'Invalid separator');
+        Assert(!options.adjust || typeof options.adjust === 'function', 'options.adjust must be a function');
+        Assert(!options.map || Array.isArray(options.map), 'options.map must be an array');
+        Assert(!options.map || !options.adjust, 'Cannot set both map and adjust options');
+
+        Object.assign(this, internals.defaults, options);
+
+        Assert(this.type === 'value' || this.ancestor === undefined, 'Non-value references cannot reference ancestors');
+
+        if (Array.isArray(this.map)) {
+            this.map = new Map(this.map);
+        }
+
+        this.depth = this.path.length;
+        this.key = this.path.length ? this.path.join(this.separator) : null;
+        this.root = this.path[0];
+
+        this.updateDisplay();
+    }
+
+    resolve(value, state, prefs, local, options = {}) {
+
+        Assert(!this.in || options.in, 'Invalid in() reference usage');
+
+        if (this.type === 'global') {
+            return this._resolve(prefs.context, state, options);
+        }
+
+        if (this.type === 'local') {
+            return this._resolve(local, state, options);
+        }
+
+        if (!this.ancestor) {
+            return this._resolve(value, state, options);
+        }
+
+        if (this.ancestor === 'root') {
+            return this._resolve(state.ancestors[state.ancestors.length - 1], state, options);
+        }
+
+        Assert(this.ancestor <= state.ancestors.length, 'Invalid reference exceeds the schema root:', this.display);
+        return this._resolve(state.ancestors[this.ancestor - 1], state, options);
+    }
+
+    _resolve(target, state, options) {
+
+        let resolved;
+
+        if (this.type === 'value' &&
+            state.mainstay.shadow &&
+            options.shadow !== false) {
+
+            resolved = state.mainstay.shadow.get(this.absolute(state));
+        }
+
+        if (resolved === undefined) {
+            resolved = Reach(target, this.path, { iterables: this.iterables, functions: true });
+        }
+
+        if (this.adjust) {
+            resolved = this.adjust(resolved);
+        }
+
+        if (this.map) {
+            const mapped = this.map.get(resolved);
+            if (mapped !== undefined) {
+                resolved = mapped;
+            }
+        }
+
+        return resolved;
+    }
+
+    toString() {
+
+        return this.display;
+    }
+
+    absolute(state) {
+
+        return [...state.path.slice(0, -this.ancestor), ...this.path];
+    }
+
+    clone() {
+
+        return new internals.Ref(this);
+    }
+
+    updateDisplay() {
+
+        const key = this.key !== null ? this.key : '';
+        if (this.type !== 'value') {
+            this.display = `ref:${this.type}:${key}`;
+            return;
+        }
+
+        if (!this.separator) {
+            this.display = `ref:${key}`;
+            return;
+        }
+
+        if (!this.ancestor) {
+            this.display = `ref:${this.separator}${key}`;
+            return;
+        }
+
+        if (this.ancestor === 'root') {
+            this.display = `ref:root:${key}`;
+            return;
+        }
+
+        if (this.ancestor === 1) {
+            this.display = `ref:${key || '..'}`;
+            return;
+        }
+
+        const lead = new Array(this.ancestor + 1).fill(this.separator).join('');
+        this.display = `ref:${lead}${key || ''}`;
+    }
+};
+
+
+internals.Ref.prototype[Common.symbols.ref] = true;
+
+
+internals.context = function (key, separator, prefix = {}) {
+
+    key = key.trim();
+
+    if (prefix) {
+        const globalp = prefix.global === undefined ? '$' : prefix.global;
+        if (globalp !== separator &&
+            key.startsWith(globalp)) {
+
+            return { key: key.slice(globalp.length), type: 'global' };
+        }
+
+        const local = prefix.local === undefined ? '#' : prefix.local;
+        if (local !== separator &&
+            key.startsWith(local)) {
+
+            return { key: key.slice(local.length), type: 'local' };
+        }
+
+        const root = prefix.root === undefined ? '/' : prefix.root;
+        if (root !== separator &&
+            key.startsWith(root)) {
+
+            return { key: key.slice(root.length), type: 'value', root: true };
+        }
+    }
+
+    return { key, type: 'value' };
+};
+
+
+internals.ancestor = function (key, separator) {
+
+    if (!separator) {
+        return [1, 0];              // 'a_b' -> 1 (parent)
+    }
+
+    if (key[0] !== separator) {     // 'a.b' -> 1 (parent)
+        return [1, 0];
+    }
+
+    if (key[1] !== separator) {     // '.a.b' -> 0 (self)
+        return [0, 1];
+    }
+
+    let i = 2;
+    while (key[i] === separator) {
+        ++i;
+    }
+
+    return [i - 1, i];              // '...a.b.' -> 2 (grandparent)
+};
+
+
+exports.toSibling = 0;
+
+exports.toParent = 1;
+
+
+exports.Manager = class {
+
+    constructor() {
+
+        this.refs = [];                     // 0: [self refs], 1: [parent refs], 2: [grandparent refs], ...
+    }
+
+    register(source, target) {
+
+        if (!source) {
+            return;
+        }
+
+        target = target === undefined ? exports.toParent : target;
+
+        // Array
+
+        if (Array.isArray(source)) {
+            for (const ref of source) {
+                this.register(ref, target);
+            }
+
+            return;
+        }
+
+        // Schema
+
+        if (Common.isSchema(source)) {
+            for (const item of source._refs.refs) {
+                if (item.ancestor - target >= 0) {
+                    this.refs.push({ ancestor: item.ancestor - target, root: item.root });
+                }
+            }
+
+            return;
+        }
+
+        // Reference
+
+        if (exports.isRef(source) &&
+            source.type === 'value' &&
+            source.ancestor - target >= 0) {
+
+            this.refs.push({ ancestor: source.ancestor - target, root: source.root });
+        }
+    }
+
+    clone() {
+
+        const copy = new exports.Manager();
+        copy.refs = Clone(this.refs);
+        return copy;
+    }
+
+    reset() {
+
+        this.refs = [];
+    }
+
+    roots() {
+
+        return this.refs.filter((ref) => !ref.ancestor).map((ref) => ref.root);
+    }
+};
diff --git a/node_modules/@hapi/validate/lib/schemas.js b/node_modules/@hapi/validate/lib/schemas.js
new file mode 100755
index 0000000..eb8ce5f
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/schemas.js
@@ -0,0 +1,49 @@
+'use strict';
+
+const Joi = require('./index');
+
+
+const internals = {};
+
+
+// Preferences
+
+internals.wrap = Joi.string()
+    .min(1)
+    .max(2)
+    .allow(false);
+
+
+exports.preferences = Joi.object({
+    allowUnknown: Joi.boolean(),
+    abortEarly: Joi.boolean(),
+    context: Joi.object(),
+    convert: Joi.boolean(),
+    dateFormat: Joi.valid('date', 'iso', 'string', 'time', 'utc'),
+    errors: {
+        escapeHtml: Joi.boolean(),
+        label: Joi.valid('path', 'key', false),
+        language: [
+            Joi.string(),
+            Joi.object().ref()
+        ],
+        render: Joi.boolean(),
+        stack: Joi.boolean(),
+        wrap: {
+            label: internals.wrap,
+            array: internals.wrap
+        }
+    },
+    messages: Joi.object(),
+    noDefaults: Joi.boolean(),
+    nonEnumerables: Joi.boolean(),
+    presence: Joi.valid('required', 'optional', 'forbidden'),
+    skipFunctions: Joi.boolean(),
+    stripUnknown: Joi.object({
+        arrays: Joi.boolean(),
+        objects: Joi.boolean()
+    })
+        .or('arrays', 'objects')
+        .allow(true, false)
+})
+    .strict();
diff --git a/node_modules/@hapi/validate/lib/state.js b/node_modules/@hapi/validate/lib/state.js
new file mode 100755
index 0000000..c6ba8ee
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/state.js
@@ -0,0 +1,150 @@
+'use strict';
+
+const Clone = require('@hapi/hoek/clone');
+const Reach = require('@hapi/hoek/reach');
+
+const Common = require('./common');
+
+
+const internals = {
+    value: Symbol('value')
+};
+
+
+module.exports = internals.State = class {
+
+    constructor(path, ancestors, state) {
+
+        this.path = path;
+        this.ancestors = ancestors;                 // [parent, ..., root]
+
+        this.mainstay = state.mainstay;
+        this.schemas = state.schemas;               // [current, ..., root]
+    }
+
+    localize(path, ancestors = null, schema = null) {
+
+        const state = new internals.State(path, ancestors, this);
+
+        if (schema &&
+            state.schemas) {
+
+            state.schemas = [internals.schemas(schema), ...state.schemas];
+        }
+
+        return state;
+    }
+
+    nest(schema) {
+
+        const state = new internals.State(this.path, this.ancestors, this);
+        state.schemas = state.schemas && [internals.schemas(schema), ...state.schemas];
+        return state;
+    }
+
+    shadow(value, reason) {
+
+        this.mainstay.shadow = this.mainstay.shadow || new internals.Shadow();
+        this.mainstay.shadow.set(this.path, value, reason);
+    }
+
+    snapshot() {
+
+        if (this.mainstay.shadow) {
+            this._snapshot = Clone(this.mainstay.shadow.node(this.path));
+        }
+    }
+
+    restore() {
+
+        if (this.mainstay.shadow) {
+            this.mainstay.shadow.override(this.path, this._snapshot);
+            this._snapshot = undefined;
+        }
+    }
+};
+
+
+internals.schemas = function (schema) {
+
+    if (Common.isSchema(schema)) {
+        return { schema };
+    }
+
+    return schema;
+};
+
+
+internals.Shadow = class {
+
+    constructor() {
+
+        this._values = null;
+    }
+
+    set(path, value, reason) {
+
+        if (!path.length) {                                     // No need to store root value
+            return;
+        }
+
+        if (reason === 'strip' &&
+            typeof path[path.length - 1] === 'number') {        // Cannot store stripped array values (due to shift)
+
+            return;
+        }
+
+        this._values = this._values || new Map();
+
+        let node = this._values;
+        for (let i = 0; i < path.length; ++i) {
+            const segment = path[i];
+            let next = node.get(segment);
+            if (!next) {
+                next = new Map();
+                node.set(segment, next);
+            }
+
+            node = next;
+        }
+
+        node[internals.value] = value;
+    }
+
+    get(path) {
+
+        const node = this.node(path);
+        if (node) {
+            return node[internals.value];
+        }
+    }
+
+    node(path) {
+
+        if (!this._values) {
+            return;
+        }
+
+        return Reach(this._values, path, { iterables: true });
+    }
+
+    override(path, node) {
+
+        if (!this._values) {
+            return;
+        }
+
+        const parents = path.slice(0, -1);
+        const own = path[path.length - 1];
+        const parent = Reach(this._values, parents, { iterables: true });
+
+        if (node) {
+            parent.set(own, node);
+            return;
+        }
+
+        if (parent) {
+            parent.delete(own);
+        }
+    }
+};
diff --git a/node_modules/@hapi/validate/lib/template.js b/node_modules/@hapi/validate/lib/template.js
new file mode 100755
index 0000000..831c4f1
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/template.js
@@ -0,0 +1,260 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+const EscapeHtml = require('@hapi/hoek/escapeHtml');
+
+const Common = require('./common');
+const Ref = require('./ref');
+
+
+const internals = {
+    symbol: Symbol('template'),
+
+    opens: new Array(1000).join('\u0000'),
+    closes: new Array(1000).join('\u0001'),
+
+    dateFormat: {
+        date: Date.prototype.toDateString,
+        iso: Date.prototype.toISOString,
+        string: Date.prototype.toString,
+        time: Date.prototype.toTimeString,
+        utc: Date.prototype.toUTCString
+    }
+};
+
+
+module.exports = exports = internals.Template = class {
+
+    constructor(source, options) {
+
+        Assert(typeof source === 'string', 'Template source must be a string');
+        Assert(!source.includes('\u0000') && !source.includes('\u0001'), 'Template source cannot contain reserved control characters');
+
+        this.source = source;
+        this.rendered = source;
+
+        this._template = null;
+        this._settings = Clone(options);
+
+        this._parse();
+    }
+
+    _parse() {
+
+        // 'text {raw} {{ref}} \\{{ignore}} {{ignore\\}} {{ignore {{ignore}'
+
+        if (!this.source.includes('{')) {
+            return;
+        }
+
+        // Encode escaped \\{{{{{
+
+        const encoded = internals.encode(this.source);
+
+        // Split on first { in each set
+
+        const parts = internals.split(encoded);
+
+        // Process parts
+
+        const processed = [];
+        const head = parts.shift();
+        if (head) {
+            processed.push(head);
+        }
+
+        for (const part of parts) {
+            const raw = part[0] !== '{';
+            const ender = raw ? '}' : '}}';
+            const end = part.indexOf(ender);
+
+            let variable = part.slice(raw ? 0 : 1, end);
+            const wrapped = variable[0] === ':';
+            if (wrapped) {
+                variable = variable.slice(1);
+            }
+
+            const dynamic = this._ref(internals.decode(variable), { raw, wrapped });
+            processed.push(dynamic);
+
+            const rest = part.slice(end + ender.length);
+            if (rest) {
+                processed.push(internals.decode(rest));
+            }
+        }
+
+        this._template = processed;
+    }
+
+    static date(date, prefs) {
+
+        return internals.dateFormat[prefs.dateFormat].call(date);
+    }
+
+    isDynamic() {
+
+        return !!this._template;
+    }
+
+    static isTemplate(template) {
+
+        return template ? !!template[Common.symbols.template] : false;
+    }
+
+    render(value, state, prefs, local, options = {}) {
+
+        if (!this.isDynamic()) {
+            return this.rendered;
+        }
+
+        const parts = [];
+        for (const part of this._template) {
+            if (typeof part === 'string') {
+                parts.push(part);
+            }
+            else {
+                const rendered = part.ref.resolve(value, state, prefs, local, options);
+                const string = internals.stringify(rendered, prefs, options.errors);
+                const result = (part.raw || options.errors?.escapeHtml === false) ? string : EscapeHtml(string);
+                parts.push(internals.wrap(result, part.wrapped && prefs.errors.wrap.label));
+            }
+        }
+
+        return parts.join('');
+    }
+
+    _ref(content, { raw, wrapped }) {
+
+        const ref = Ref.create(content, this._settings);
+        return { ref, raw, wrapped: wrapped || ref.type === 'local' && ref.key === 'label' };
+    }
+
+    toString() {
+
+        return this.source;
+    }
+};
+
+
+internals.Template.prototype[Common.symbols.template] = true;
+internals.Template.prototype.isImmutable = true;                // Prevents Hoek from deep cloning schema objects
+
+
+internals.encode = function (string) {
+
+    return string
+        .replace(/\\(\{+)/g, ($0, $1) => {
+
+            return internals.opens.slice(0, $1.length);
+        })
+        .replace(/\\(\}+)/g, ($0, $1) => {
+
+            return internals.closes.slice(0, $1.length);
+        });
+};
+
+
+internals.decode = function (string) {
+
+    return string
+        .replace(/\u0000/g, '{')
+        .replace(/\u0001/g, '}');
+};
+
+
+internals.split = function (string) {
+
+    const parts = [];
+    let current = '';
+
+    for (let i = 0; i < string.length; ++i) {
+        const char = string[i];
+
+        if (char === '{') {
+            let next = '';
+            while (i + 1 < string.length &&
+                string[i + 1] === '{') {
+
+                next += '{';
+                ++i;
+            }
+
+            parts.push(current);
+            current = next;
+        }
+        else {
+            current += char;
+        }
+    }
+
+    parts.push(current);
+    return parts;
+};
+
+
+internals.wrap = function (value, ends) {
+
+    if (!ends) {
+        return value;
+    }
+
+    if (ends.length === 1) {
+        return `${ends}${value}${ends}`;
+    }
+
+    return `${ends[0]}${value}${ends[1]}`;
+};
+
+
+internals.stringify = function (value, prefs, options) {
+
+    const type = typeof value;
+
+    if (value === null) {
+        return 'null';
+    }
+
+    if (value === undefined) {
+        return '';
+    }
+
+    if (type === 'string') {
+        return value;
+    }
+
+    if (type === 'number' ||
+        type === 'function' ||
+        type === 'symbol') {
+
+        return value.toString();
+    }
+
+    if (type !== 'object') {
+        return JSON.stringify(value);
+    }
+
+    if (value instanceof Date) {
+        return internals.Template.date(value, prefs);
+    }
+
+    if (value instanceof Map) {
+        const pairs = [];
+        for (const [key, sym] of value.entries()) {
+            pairs.push(`${key.toString()} -> ${sym.toString()}`);
+        }
+
+        value = pairs;
+    }
+
+    if (!Array.isArray(value)) {
+        return value.toString();
+    }
+
+    let partial = '';
+    for (const item of value) {
+        partial = partial + (partial.length ? ', ' : '') + internals.stringify(item, prefs, options);
+    }
+
+    return internals.wrap(partial, prefs.errors.wrap.array);
+};
diff --git a/node_modules/@hapi/validate/lib/types/alternatives.js b/node_modules/@hapi/validate/lib/types/alternatives.js
new file mode 100755
index 0000000..1231d4b
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/alternatives.js
@@ -0,0 +1,296 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+const Compile = require('../compile');
+const Errors = require('../errors');
+const Ref = require('../ref');
+
+
+const internals = {};
+
+
+module.exports = Any._extend({
+
+    type: 'alternatives',
+
+    flags: {
+
+        match: { default: 'any' }                 // 'any', 'one', 'all'
+    },
+
+    terms: {
+
+        matches: { init: [], register: Ref.toSibling }
+    },
+
+    args(schema, ...schemas) {
+
+        if (schemas.length === 1) {
+            if (Array.isArray(schemas[0])) {
+                return schema.try(...schemas[0]);
+            }
+        }
+
+        return schema.try(...schemas);
+    },
+
+    validate(value, helpers) {
+
+        const { schema, error, state, prefs } = helpers;
+
+        // Match all or one
+
+        if (schema._flags.match) {
+            let hits = 0;
+            let matched;
+
+            for (let i = 0; i < schema.$_terms.matches.length; ++i) {
+                const item = schema.$_terms.matches[i];
+                const localState = state.nest(item.schema, `match.${i}`);
+                localState.snapshot();
+
+                const result = item.schema.$_validate(value, localState, prefs);
+                if (!result.errors) {
+                    ++hits;
+                    matched = result.value;
+                }
+                else {
+                    localState.restore();
+                }
+            }
+
+            if (!hits) {
+                return { errors: error('alternatives.any') };
+            }
+
+            if (schema._flags.match === 'one') {
+                return hits === 1 ? { value: matched } : { errors: error('alternatives.one') };
+            }
+
+            return hits === schema.$_terms.matches.length ? { value } : { errors: error('alternatives.all') };
+        }
+
+        // Match any
+
+        const errors = [];
+        for (let i = 0; i < schema.$_terms.matches.length; ++i) {
+            const item = schema.$_terms.matches[i];
+
+            // Try
+
+            if (item.schema) {
+                const localState = state.nest(item.schema, `match.${i}`);
+                localState.snapshot();
+
+                const result = item.schema.$_validate(value, localState, prefs);
+                if (!result.errors) {
+                    return result;
+                }
+
+                localState.restore();
+                errors.push({ schema: item.schema, reports: result.errors });
+                continue;
+            }
+
+            // Conditional
+
+            const input = item.ref ? item.ref.resolve(value, state, prefs) : value;
+            const tests = item.is ? [item] : item.switch;
+
+            for (let j = 0; j < tests.length; ++j) {
+                const test = tests[j];
+                const { is, then, otherwise } = test;
+
+                const id = `match.${i}${item.switch ? '.' + j : ''}`;
+                if (!is.$_match(input, state.nest(is, `${id}.is`), prefs)) {
+                    if (otherwise) {
+                        return otherwise.$_validate(value, state.nest(otherwise, `${id}.otherwise`), prefs);
+                    }
+                }
+                else if (then) {
+                    return then.$_validate(value, state.nest(then, `${id}.then`), prefs);
+                }
+            }
+        }
+
+        return internals.errors(errors, helpers);
+    },
+
+    rules: {
+
+        conditional: {
+            method(condition, options) {
+
+                Assert(!this._flags._endedSwitch, 'Unreachable condition');
+                Assert(!this._flags.match, 'Cannot combine match mode', this._flags.match, 'with conditional rule');
+                Assert(options.break === undefined, 'Cannot use break option with alternatives conditional');
+
+                const obj = this.clone();
+
+                const match = Compile.when(obj, condition, options);
+                const conditions = match.is ? [match] : match.switch;
+                for (const item of conditions) {
+                    if (item.then &&
+                        item.otherwise) {
+
+                        obj.$_setFlag('_endedSwitch', true, { clone: false });
+                        break;
+                    }
+                }
+
+                obj.$_terms.matches.push(match);
+                return obj.$_mutateRebuild();
+            }
+        },
+
+        match: {
+            method(mode) {
+
+                Assert(['any', 'one', 'all'].includes(mode), 'Invalid alternatives match mode', mode);
+
+                if (mode !== 'any') {
+                    for (const match of this.$_terms.matches) {
+                        Assert(match.schema, 'Cannot combine match mode', mode, 'with conditional rules');
+                    }
+                }
+
+                return this.$_setFlag('match', mode);
+            }
+        },
+
+        try: {
+            method(...schemas) {
+
+                Assert(schemas.length, 'Missing alternative schemas');
+                Common.verifyFlat(schemas, 'try');
+
+                Assert(!this._flags._endedSwitch, 'Unreachable condition');
+
+                const obj = this.clone();
+                for (const schema of schemas) {
+                    obj.$_terms.matches.push({ schema: obj.$_compile(schema) });
+                }
+
+                return obj.$_mutateRebuild();
+            }
+        }
+    },
+
+    rebuild(schema) {
+
+        // Flag when an alternative type is an array
+
+        const each = (item) => {
+
+            if (Common.isSchema(item) &&
+                item.type === 'array') {
+
+                schema.$_setFlag('_arrayItems', true, { clone: false });
+            }
+        };
+
+        schema.$_modify({ each });
+    },
+
+    messages: {
+        'alternatives.all': '{{#label}} does not match all of the required types',
+        'alternatives.any': '{{#label}} does not match any of the allowed types',
+        'alternatives.match': '{{#label}} does not match any of the allowed types',
+        'alternatives.one': '{{#label}} matches more than one allowed type',
+        'alternatives.types': '{{#label}} must be one of {{#types}}'
+    }
+});
+
+
+// Helpers
+
+internals.errors = function (failures, { error, state }) {
+
+    // Nothing matched due to type criteria rules
+
+    if (!failures.length) {
+        return { errors: error('alternatives.any') };
+    }
+
+    // Single error
+
+    if (failures.length === 1) {
+        return { errors: failures[0].reports };
+    }
+
+    // Analyze reasons
+
+    const valids = new Set();
+    const complex = [];
+
+    for (const { reports, schema } of failures) {
+
+        // Multiple errors (!abortEarly)
+
+        if (reports.length > 1) {
+            return internals.unmatched(failures, error);
+        }
+
+        // Custom error
+
+        const report = reports[0];
+        if (report instanceof Errors.Report === false) {
+            return internals.unmatched(failures, error);
+        }
+
+        // Internal object or array error
+
+        if (report.state.path.length !== state.path.length) {
+            complex.push({ type: schema.type, report });
+            continue;
+        }
+
+        // Valids
+
+        if (report.code === 'any.only') {
+            for (const valid of report.local.valids) {
+                valids.add(valid);
+            }
+
+            continue;
+        }
+
+        // Base type
+
+        const [type, code] = report.code.split('.');
+        if (code !== 'base') {
+            complex.push({ type: schema.type, report });
+            continue;
+        }
+
+        valids.add(type);
+    }
+
+    // All errors are base types or valids
+
+    if (!complex.length) {
+        return { errors: error('alternatives.types', { types: [...valids] }) };
+    }
+
+    // Single complex error
+
+    if (complex.length === 1) {
+        return { errors: complex[0].report };
+    }
+
+    return internals.unmatched(failures, error);
+};
+
+
+internals.unmatched = function (failures, error) {
+
+    const errors = [];
+    for (const failure of failures) {
+        errors.push(...failure.reports);
+    }
+
+    return { errors: error('alternatives.match', Errors.details(errors, { override: false })) };
+};
diff --git a/node_modules/@hapi/validate/lib/types/any.js b/node_modules/@hapi/validate/lib/types/any.js
new file mode 100755
index 0000000..c364e74
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/any.js
@@ -0,0 +1,86 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Base = require('../base');
+const Common = require('../common');
+
+
+const internals = {};
+
+
+module.exports = Base._extend({
+
+    type: 'any',
+
+    flags: {
+
+        only: { default: false }
+    },
+
+    terms: {
+
+        alterations: { init: null },
+        examples: { init: null },
+        metas: { init: [] },
+        notes: { init: [] },
+        shared: { init: null },
+        tags: { init: [] },
+        whens: { init: null }
+    },
+
+    rules: {
+
+        custom: {
+            method(method, description) {
+
+                Assert(typeof method === 'function', 'Method must be a function');
+                Assert(description === undefined || description && typeof description === 'string', 'Description must be a non-empty string');
+
+                return this.$_addRule({ name: 'custom', args: { method, description } });
+            },
+            validate(value, helpers, { method }) {
+
+                try {
+                    return method(value, helpers);
+                }
+                catch (err) {
+                    return helpers.error('any.custom', { error: err });
+                }
+            },
+            args: ['method', 'description'],
+            multi: true
+        },
+
+        messages: {
+            method(messages) {
+
+                return this.prefs({ messages });
+            }
+        },
+
+        shared: {
+            method(schema) {
+
+                Assert(Common.isSchema(schema) && schema._flags.id, 'Schema must be a schema with an id');
+
+                const obj = this.clone();
+                obj.$_terms.shared = obj.$_terms.shared || [];
+                obj.$_terms.shared.push(schema);
+                obj.$_mutateRegister(schema);
+                return obj;
+            }
+        }
+    },
+
+    messages: {
+        'any.custom': '{{#label}} failed custom validation because {{#error.message}}',
+        'any.default': '{{#label}} threw an error when running default method',
+        'any.failover': '{{#label}} threw an error when running failover method',
+        'any.invalid': '{{#label}} contains an invalid value',
+        'any.only': '{{#label}} must be one of {{#valids}}',
+        'any.ref': '{{#label}} {{#arg}} references {{:#ref}} which {{#reason}}',
+        'any.required': '{{#label}} is required',
+        'any.unknown': '{{#label}} is not allowed'
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/types/array.js b/node_modules/@hapi/validate/lib/types/array.js
new file mode 100755
index 0000000..c91bf0c
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/array.js
@@ -0,0 +1,733 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const DeepEqual = require('@hapi/hoek/deepEqual');
+const Reach = require('@hapi/hoek/reach');
+
+const Any = require('./any');
+const Common = require('../common');
+const Compile = require('../compile');
+
+
+const internals = {};
+
+
+module.exports = Any._extend({
+
+    type: 'array',
+
+    flags: {
+
+        single: { default: false },
+        sparse: { default: false }
+    },
+
+    terms: {
+
+        items: { init: [] },
+        ordered: { init: [] },
+
+        _exclusions: { init: [] },
+        _inclusions: { init: [] },
+        _requireds: { init: [] }
+    },
+
+    coerce: {
+        from: 'object',
+        method(value, { schema, state, prefs }) {
+
+            if (!Array.isArray(value)) {
+                return;
+            }
+
+            const sort = schema.$_getRule('sort');
+            if (!sort) {
+                return;
+            }
+
+            return internals.sort(schema, value, sort.args.options, state, prefs);
+        }
+    },
+
+    validate(value, { schema, error }) {
+
+        if (!Array.isArray(value)) {
+            if (schema._flags.single) {
+                const single = [value];
+                single[Common.symbols.arraySingle] = true;
+                return { value: single };
+            }
+
+            return { errors: error('array.base') };
+        }
+
+        if (!schema.$_getRule('items')) {
+            return;
+        }
+
+        return { value: value.slice() };        // Clone the array so that we don't modify the original
+    },
+
+    rules: {
+
+        has: {
+            method(schema) {
+
+                schema = this.$_compile(schema, { appendPath: true });
+                const obj = this.$_addRule({ name: 'has', args: { schema } });
+                obj.$_mutateRegister(schema);
+                return obj;
+            },
+            validate(value, { state, prefs, error }, { schema: has }) {
+
+                const ancestors = [value, ...state.ancestors];
+                for (let i = 0; i < value.length; ++i) {
+                    const localState = state.localize([...state.path, i], ancestors, has);
+                    if (has.$_match(value[i], localState, prefs)) {
+                        return value;
+                    }
+                }
+
+                return error('array.hasUnknown', null);
+            },
+            multi: true
+        },
+
+        items: {
+            method(...schemas) {
+
+                Common.verifyFlat(schemas, 'items');
+
+                const obj = this.$_addRule('items');
+
+                for (let i = 0; i < schemas.length; ++i) {
+                    const type = Common.tryWithPath(() => this.$_compile(schemas[i]), i, { append: true });
+                    obj.$_terms.items.push(type);
+                }
+
+                return obj.$_mutateRebuild();
+            },
+            validate(value, { schema, error, state, prefs, errorsArray }) {
+
+                const requireds = schema.$_terms._requireds.slice();
+                const ordereds = schema.$_terms.ordered.slice();
+                const inclusions = [...schema.$_terms._inclusions, ...requireds];
+
+                const wasArray = !value[Common.symbols.arraySingle];
+                delete value[Common.symbols.arraySingle];
+
+                const errors = errorsArray();
+
+                let il = value.length;
+                for (let i = 0; i < il; ++i) {
+                    const item = value[i];
+
+                    let errored = false;
+                    let isValid = false;
+
+                    const key = wasArray ? i : new Number(i);       // eslint-disable-line no-new-wrappers
+                    const path = [...state.path, key];
+
+                    // Sparse
+
+                    if (!schema._flags.sparse &&
+                        item === undefined) {
+
+                        errors.push(error('array.sparse', { key, path, pos: i, value: undefined }, state.localize(path)));
+                        if (prefs.abortEarly) {
+                            return errors;
+                        }
+
+                        ordereds.shift();
+                        continue;
+                    }
+
+                    // Exclusions
+
+                    const ancestors = [value, ...state.ancestors];
+
+                    for (const exclusion of schema.$_terms._exclusions) {
+                        if (!exclusion.$_match(item, state.localize(path, ancestors, exclusion), prefs, { presence: 'ignore' })) {
+                            continue;
+                        }
+
+                        errors.push(error('array.excludes', { pos: i, value: item }, state.localize(path)));
+                        if (prefs.abortEarly) {
+                            return errors;
+                        }
+
+                        errored = true;
+                        ordereds.shift();
+                        break;
+                    }
+
+                    if (errored) {
+                        continue;
+                    }
+
+                    // Ordered
+
+                    if (schema.$_terms.ordered.length) {
+                        if (ordereds.length) {
+                            const ordered = ordereds.shift();
+                            const res = ordered.$_validate(item, state.localize(path, ancestors, ordered), prefs);
+                            if (!res.errors) {
+                                if (ordered._flags.result === 'strip') {
+                                    internals.fastSplice(value, i);
+                                    --i;
+                                    --il;
+                                }
+                                else if (!schema._flags.sparse && res.value === undefined) {
+                                    errors.push(error('array.sparse', { key, path, pos: i, value: undefined }, state.localize(path)));
+                                    if (prefs.abortEarly) {
+                                        return errors;
+                                    }
+
+                                    continue;
+                                }
+                                else {
+                                    value[i] = res.value;
+                                }
+                            }
+                            else {
+                                errors.push(...res.errors);
+                                if (prefs.abortEarly) {
+                                    return errors;
+                                }
+                            }
+
+                            continue;
+                        }
+                        else if (!schema.$_terms.items.length) {
+                            errors.push(error('array.orderedLength', { pos: i, limit: schema.$_terms.ordered.length }));
+                            if (prefs.abortEarly) {
+                                return errors;
+                            }
+
+                            break;      // No reason to continue since there are no other rules to validate other than array.orderedLength
+                        }
+                    }
+
+                    // Requireds
+
+                    const requiredChecks = [];
+                    let jl = requireds.length;
+                    for (let j = 0; j < jl; ++j) {
+                        const localState = state.localize(path, ancestors, requireds[j]);
+                        localState.snapshot();
+
+                        const res = requireds[j].$_validate(item, localState, prefs);
+                        requiredChecks[j] = res;
+
+                        if (!res.errors) {
+                            value[i] = res.value;
+                            isValid = true;
+                            internals.fastSplice(requireds, j);
+                            --j;
+                            --jl;
+
+                            if (!schema._flags.sparse &&
+                                res.value === undefined) {
+
+                                errors.push(error('array.sparse', { key, path, pos: i, value: undefined }, state.localize(path)));
+                                if (prefs.abortEarly) {
+                                    return errors;
+                                }
+                            }
+
+                            break;
+                        }
+
+                        localState.restore();
+                    }
+
+                    if (isValid) {
+                        continue;
+                    }
+
+                    // Inclusions
+
+                    const stripUnknown = prefs.stripUnknown && !!prefs.stripUnknown.arrays || false;
+
+                    jl = inclusions.length;
+                    for (const inclusion of inclusions) {
+
+                        // Avoid re-running requireds that already didn't match in the previous loop
+
+                        let res;
+                        const previousCheck = requireds.indexOf(inclusion);
+                        if (previousCheck !== -1) {
+                            res = requiredChecks[previousCheck];
+                        }
+                        else {
+                            const localState = state.localize(path, ancestors, inclusion);
+                            localState.snapshot();
+
+                            res = inclusion.$_validate(item, localState, prefs);
+                            if (!res.errors) {
+                                if (inclusion._flags.result === 'strip') {
+                                    internals.fastSplice(value, i);
+                                    --i;
+                                    --il;
+                                }
+                                else if (!schema._flags.sparse &&
+                                    res.value === undefined) {
+
+                                    errors.push(error('array.sparse', { key, path, pos: i, value: undefined }, state.localize(path)));
+                                    errored = true;
+                                }
+                                else {
+                                    value[i] = res.value;
+                                }
+
+                                isValid = true;
+                                break;
+                            }
+
+                            localState.restore();
+                        }
+
+                        // Return the actual error if only one inclusion defined
+
+                        if (jl === 1) {
+                            if (stripUnknown) {
+                                internals.fastSplice(value, i);
+                                --i;
+                                --il;
+                                isValid = true;
+                                break;
+                            }
+
+                            errors.push(...res.errors);
+                            if (prefs.abortEarly) {
+                                return errors;
+                            }
+
+                            errored = true;
+                            break;
+                        }
+                    }
+
+                    if (errored) {
+                        continue;
+                    }
+
+                    if (schema.$_terms._inclusions.length &&
+                        !isValid) {
+
+                        if (stripUnknown) {
+                            internals.fastSplice(value, i);
+                            --i;
+                            --il;
+                            continue;
+                        }
+
+                        errors.push(error('array.includes', { pos: i, value: item }, state.localize(path)));
+                        if (prefs.abortEarly) {
+                            return errors;
+                        }
+                    }
+                }
+
+                if (requireds.length) {
+                    internals.fillMissedErrors(schema, errors, requireds, value, state, prefs);
+                }
+
+                if (ordereds.length) {
+                    internals.fillOrderedErrors(schema, errors, ordereds, value, state, prefs);
+                }
+
+                return errors.length ? errors : value;
+            },
+
+            priority: true
+        },
+
+        length: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'length', args: { limit }, operator: '=' });
+            },
+            validate(value, helpers, { limit }, { name, operator, args }) {
+
+                if (Common.compare(value.length, limit, operator)) {
+                    return value;
+                }
+
+                return helpers.error('array.' + name, { limit: args.limit, value });
+            },
+            args: [
+                {
+                    name: 'limit',
+                    ref: true,
+                    assert: Common.limit,
+                    message: 'must be a positive integer'
+                }
+            ]
+        },
+
+        max: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'max', method: 'length', args: { limit }, operator: '<=' });
+            }
+        },
+
+        min: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'min', method: 'length', args: { limit }, operator: '>=' });
+            }
+        },
+
+        ordered: {
+            method(...schemas) {
+
+                Common.verifyFlat(schemas, 'ordered');
+
+                const obj = this.$_addRule('items');
+
+                for (let i = 0; i < schemas.length; ++i) {
+                    const type = Common.tryWithPath(() => this.$_compile(schemas[i]), i, { append: true });
+                    internals.validateSingle(type, obj);
+
+                    obj.$_mutateRegister(type);
+                    obj.$_terms.ordered.push(type);
+                }
+
+                return obj.$_mutateRebuild();
+            }
+        },
+
+        single: {
+            method(enabled) {
+
+                const value = enabled === undefined ? true : !!enabled;
+                Assert(!value || !this._flags._arrayItems, 'Cannot specify single rule when array has array items');
+
+                return this.$_setFlag('single', value);
+            }
+        },
+
+        sort: {
+            method(options = {}) {
+
+                Common.assertOptions(options, ['by', 'order']);
+
+                const settings = {
+                    order: options.order || 'ascending'
+                };
+
+                if (options.by) {
+                    settings.by = Compile.ref(options.by, { ancestor: 0 });
+                    Assert(!settings.by.ancestor, 'Cannot sort by ancestor');
+                }
+
+                return this.$_addRule({ name: 'sort', args: { options: settings } });
+            },
+            validate(value, { error, state, prefs, schema }, { options }) {
+
+                const { value: sorted, errors } = internals.sort(schema, value, options, state, prefs);
+                if (errors) {
+                    return errors;
+                }
+
+                for (let i = 0; i < value.length; ++i) {
+                    if (value[i] !== sorted[i]) {
+                        return error('array.sort', { order: options.order, by: options.by ? options.by.key : 'value' });
+                    }
+                }
+
+                return value;
+            },
+            convert: true
+        },
+
+        sparse: {
+            method(enabled) {
+
+                const value = enabled === undefined ? true : !!enabled;
+
+                if (this._flags.sparse === value) {
+                    return this;
+                }
+
+                const obj = value ? this.clone() : this.$_addRule('items');
+                return obj.$_setFlag('sparse', value, { clone: false });
+            }
+        },
+
+        unique: {
+            method(comparator, options = {}) {
+
+                Assert(!comparator || typeof comparator === 'function' || typeof comparator === 'string', 'comparator must be a function or a string');
+                Common.assertOptions(options, ['ignoreUndefined', 'separator']);
+
+                const rule = { name: 'unique', args: { options, comparator } };
+
+                if (comparator) {
+                    if (typeof comparator === 'string') {
+                        const separator = Common.default(options.separator, '.');
+                        rule.path = separator ? comparator.split(separator) : [comparator];
+                    }
+                    else {
+                        rule.comparator = comparator;
+                    }
+                }
+
+                return this.$_addRule(rule);
+            },
+            validate(value, { state, error, schema }, { comparator: raw, options }, { comparator, path }) {
+
+                const found = {
+                    string: Object.create(null),
+                    number: Object.create(null),
+                    undefined: Object.create(null),
+                    boolean: Object.create(null),
+                    object: new Map(),
+                    function: new Map(),
+                    custom: new Map()
+                };
+
+                const compare = comparator || DeepEqual;
+                const ignoreUndefined = options.ignoreUndefined;
+
+                for (let i = 0; i < value.length; ++i) {
+                    const item = path ? Reach(value[i], path) : value[i];
+                    const records = comparator ? found.custom : found[typeof item];
+                    Assert(records, 'Failed to find unique map container for type', typeof item);
+
+                    if (records instanceof Map) {
+                        const entries = records.entries();
+                        let current;
+                        while (!(current = entries.next()).done) {
+                            if (compare(current.value[0], item)) {
+                                const localState = state.localize([...state.path, i], [value, ...state.ancestors]);
+                                const context = {
+                                    pos: i,
+                                    value: value[i],
+                                    dupePos: current.value[1],
+                                    dupeValue: value[current.value[1]]
+                                };
+
+                                if (path) {
+                                    context.path = raw;
+                                }
+
+                                return error('array.unique', context, localState);
+                            }
+                        }
+
+                        records.set(item, i);
+                    }
+                    else {
+                        if ((!ignoreUndefined || item !== undefined) &&
+                            records[item] !== undefined) {
+
+                            const context = {
+                                pos: i,
+                                value: value[i],
+                                dupePos: records[item],
+                                dupeValue: value[records[item]]
+                            };
+
+                            if (path) {
+                                context.path = raw;
+                            }
+
+                            const localState = state.localize([...state.path, i], [value, ...state.ancestors]);
+                            return error('array.unique', context, localState);
+                        }
+
+                        records[item] = i;
+                    }
+                }
+
+                return value;
+            },
+            args: ['comparator', 'options'],
+            multi: true
+        }
+    },
+
+    cast: {
+        set: {
+            from: Array.isArray,
+            to(value, helpers) {
+
+                return new Set(value);
+            }
+        }
+    },
+
+    rebuild(schema) {
+
+        schema.$_terms._inclusions = [];
+        schema.$_terms._exclusions = [];
+        schema.$_terms._requireds = [];
+
+        for (const type of schema.$_terms.items) {
+            internals.validateSingle(type, schema);
+
+            if (type._flags.presence === 'required') {
+                schema.$_terms._requireds.push(type);
+            }
+            else if (type._flags.presence === 'forbidden') {
+                schema.$_terms._exclusions.push(type);
+            }
+            else {
+                schema.$_terms._inclusions.push(type);
+            }
+        }
+
+        for (const type of schema.$_terms.ordered) {
+            internals.validateSingle(type, schema);
+        }
+    },
+
+    messages: {
+        'array.base': '{{#label}} must be an array',
+        'array.excludes': '{{#label}} contains an excluded value',
+        'array.hasUnknown': '{{#label}} does not contain at least one required match',
+        'array.includes': '{{#label}} does not match any of the allowed types',
+        'array.includesRequiredBoth': '{{#label}} does not contain {{#knownMisses}} and {{#unknownMisses}} other required value(s)',
+        'array.includesRequiredKnowns': '{{#label}} does not contain {{#knownMisses}}',
+        'array.includesRequiredUnknowns': '{{#label}} does not contain {{#unknownMisses}} required value(s)',
+        'array.length': '{{#label}} must contain {{#limit}} items',
+        'array.max': '{{#label}} must contain less than or equal to {{#limit}} items',
+        'array.min': '{{#label}} must contain at least {{#limit}} items',
+        'array.orderedLength': '{{#label}} must contain at most {{#limit}} items',
+        'array.sort': '{{#label}} must be sorted in {#order} order by {{#by}}',
+        'array.sort.mismatching': '{{#label}} cannot be sorted due to mismatching types',
+        'array.sort.unsupported': '{{#label}} cannot be sorted due to unsupported type {#type}',
+        'array.sparse': '{{#label}} must not be a sparse array item',
+        'array.unique': '{{#label}} contains a duplicate value'
+    }
+});
+
+
+// Helpers
+
+internals.fillMissedErrors = function (schema, errors, requireds, value, state, prefs) {
+
+    let unknownMisses = 0;
+    for (let i = 0; i < requireds.length; ++i) {
+        ++unknownMisses;
+    }
+
+    errors.push(schema.$_createError('array.includesRequiredUnknowns', value, { unknownMisses }, state, prefs));
+};
+
+
+internals.fillOrderedErrors = function (schema, errors, ordereds, value, state, prefs) {
+
+    const requiredOrdereds = [];
+
+    for (const ordered of ordereds) {
+        if (ordered._flags.presence === 'required') {
+            requiredOrdereds.push(ordered);
+        }
+    }
+
+    if (requiredOrdereds.length) {
+        internals.fillMissedErrors(schema, errors, requiredOrdereds, value, state, prefs);
+    }
+};
+
+
+internals.fastSplice = function (arr, i) {
+
+    let pos = i;
+    while (pos < arr.length) {
+        arr[pos++] = arr[pos];
+    }
+
+    --arr.length;
+};
+
+
+internals.validateSingle = function (type, obj) {
+
+    if (type.type === 'array' ||
+        type._flags._arrayItems) {
+
+        Assert(!obj._flags.single, 'Cannot specify array item with single rule enabled');
+        obj.$_setFlag('_arrayItems', true, { clone: false });
+    }
+};
+
+
+internals.sort = function (schema, value, settings, state, prefs) {
+
+    const order = settings.order === 'ascending' ? 1 : -1;
+    const aFirst = -1 * order;
+    const bFirst = order;
+
+    const sort = (a, b) => {
+
+        let compare = internals.compare(a, b, aFirst, bFirst);
+        if (compare !== null) {
+            return compare;
+        }
+
+        if (settings.by) {
+            a = settings.by.resolve(a, state, prefs);
+            b = settings.by.resolve(b, state, prefs);
+        }
+
+        compare = internals.compare(a, b, aFirst, bFirst);
+        if (compare !== null) {
+            return compare;
+        }
+
+        const type = typeof a;
+        if (type !== typeof b) {
+            throw schema.$_createError('array.sort.mismatching', value, null, state, prefs);
+        }
+
+        if (type !== 'number' &&
+            type !== 'string') {
+
+            throw schema.$_createError('array.sort.unsupported', value, { type }, state, prefs);
+        }
+
+        if (type === 'number') {
+            return (a - b) * order;
+        }
+
+        return a < b ? aFirst : bFirst;
+    };
+
+    try {
+        return { value: value.slice().sort(sort) };
+    }
+    catch (err) {
+        return { errors: err };
+    }
+};
+
+
+internals.compare = function (a, b, aFirst, bFirst) {
+
+    if (a === b) {
+        return 0;
+    }
+
+    if (a === undefined) {
+        return 1;           // Always last regardless of sort order
+    }
+
+    if (b === undefined) {
+        return -1;           // Always last regardless of sort order
+    }
+
+    if (a === null) {
+        return bFirst;
+    }
+
+    if (b === null) {
+        return aFirst;
+    }
+
+    return null;
+};
diff --git a/node_modules/@hapi/validate/lib/types/binary.js b/node_modules/@hapi/validate/lib/types/binary.js
new file mode 100755
index 0000000..7206b26
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/binary.js
@@ -0,0 +1,98 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+
+
+const internals = {};
+
+
+module.exports = Any._extend({
+
+    type: 'binary',
+
+    coerce: {
+        from: 'string',
+        method(value, { schema }) {
+
+            try {
+                return { value: Buffer.from(value, schema._flags.encoding) };
+            }
+            catch (ignoreErr) { }
+        }
+    },
+
+    validate(value, { error }) {
+
+        if (!Buffer.isBuffer(value)) {
+            return { value, errors: error('binary.base') };
+        }
+    },
+
+    rules: {
+        encoding: {
+            method(encoding) {
+
+                Assert(Buffer.isEncoding(encoding), 'Invalid encoding:', encoding);
+
+                return this.$_setFlag('encoding', encoding);
+            }
+        },
+
+        length: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'length', method: 'length', args: { limit }, operator: '=' });
+            },
+            validate(value, helpers, { limit }, { name, operator, args }) {
+
+                if (Common.compare(value.length, limit, operator)) {
+                    return value;
+                }
+
+                return helpers.error('binary.' + name, { limit: args.limit, value });
+            },
+            args: [
+                {
+                    name: 'limit',
+                    ref: true,
+                    assert: Common.limit,
+                    message: 'must be a positive integer'
+                }
+            ]
+        },
+
+        max: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'max', method: 'length', args: { limit }, operator: '<=' });
+            }
+        },
+
+        min: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'min', method: 'length', args: { limit }, operator: '>=' });
+            }
+        }
+    },
+
+    cast: {
+        string: {
+            from: (value) => Buffer.isBuffer(value),
+            to(value, helpers) {
+
+                return value.toString();
+            }
+        }
+    },
+
+    messages: {
+        'binary.base': '{{#label}} must be a buffer or a string',
+        'binary.length': '{{#label}} must be {{#limit}} bytes',
+        'binary.max': '{{#label}} must be less than or equal to {{#limit}} bytes',
+        'binary.min': '{{#label}} must be at least {{#limit}} bytes'
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/types/boolean.js b/node_modules/@hapi/validate/lib/types/boolean.js
new file mode 100755
index 0000000..72183a1
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/boolean.js
@@ -0,0 +1,132 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+const Values = require('../values');
+
+
+const internals = {};
+
+
+internals.isBool = function (value) {
+
+    return typeof value === 'boolean';
+};
+
+
+module.exports = Any._extend({
+
+    type: 'boolean',
+
+    flags: {
+
+        sensitive: { default: false }
+    },
+
+    terms: {
+
+        falsy: {
+            init: null
+        },
+
+        truthy: {
+            init: null
+        }
+    },
+
+    coerce(value, { schema }) {
+
+        if (typeof value === 'boolean') {
+            return;
+        }
+
+        if (typeof value === 'string') {
+            const normalized = schema._flags.sensitive ? value : value.toLowerCase();
+            value = normalized === 'true' ? true : (normalized === 'false' ? false : value);
+        }
+
+        if (typeof value !== 'boolean') {
+            value = schema.$_terms.truthy?.has(value, null, null, !schema._flags.sensitive) ||
+                (schema.$_terms.falsy?.has(value, null, null, !schema._flags.sensitive) ? false : value);
+        }
+
+        return { value };
+    },
+
+    validate(value, { error }) {
+
+        if (typeof value !== 'boolean') {
+            return { value, errors: error('boolean.base') };
+        }
+    },
+
+    rules: {
+        truthy: {
+            method(...values) {
+
+                Common.verifyFlat(values, 'truthy');
+
+                const obj = this.clone();
+                obj.$_terms.truthy = obj.$_terms.truthy || new Values();
+
+                for (let i = 0; i < values.length; ++i) {
+                    const value = values[i];
+
+                    Assert(value !== undefined, 'Cannot call truthy with undefined');
+                    obj.$_terms.truthy.add(value);
+                }
+
+                return obj;
+            }
+        },
+
+        falsy: {
+            method(...values) {
+
+                Common.verifyFlat(values, 'falsy');
+
+                const obj = this.clone();
+                obj.$_terms.falsy = obj.$_terms.falsy || new Values();
+
+                for (let i = 0; i < values.length; ++i) {
+                    const value = values[i];
+
+                    Assert(value !== undefined, 'Cannot call falsy with undefined');
+                    obj.$_terms.falsy.add(value);
+                }
+
+                return obj;
+            }
+        },
+
+        sensitive: {
+            method(enabled = true) {
+
+                return this.$_setFlag('sensitive', enabled);
+            }
+        }
+    },
+
+    cast: {
+        number: {
+            from: internals.isBool,
+            to(value, helpers) {
+
+                return value ? 1 : 0;
+            }
+        },
+        string: {
+            from: internals.isBool,
+            to(value, helpers) {
+
+                return value ? 'true' : 'false';
+            }
+        }
+    },
+
+    messages: {
+        'boolean.base': '{{#label}} must be a boolean'
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/types/date.js b/node_modules/@hapi/validate/lib/types/date.js
new file mode 100755
index 0000000..754d88e
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/date.js
@@ -0,0 +1,227 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+const Template = require('../template');
+
+
+const internals = {};
+
+
+internals.isDate = function (value) {
+
+    return value instanceof Date;
+};
+
+
+module.exports = Any._extend({
+
+    type: 'date',
+
+    coerce: {
+        from: ['number', 'string'],
+        method(value, { schema }) {
+
+            return { value: internals.parse(value, schema._flags.format) || value };
+        }
+    },
+
+    validate(value, { schema, error, prefs }) {
+
+        if (value instanceof Date &&
+            !isNaN(value.getTime())) {
+
+            return;
+        }
+
+        const format = schema._flags.format;
+
+        if (!prefs.convert ||
+            !format ||
+            typeof value !== 'string') {
+
+            return { value, errors: error('date.base') };
+        }
+
+        return { value, errors: error('date.format', { format }) };
+    },
+
+    rules: {
+
+        compare: {
+            method: false,
+            validate(value, helpers, { date }, { name, operator, args }) {
+
+                const to = date === 'now' ? Date.now() : date.getTime();
+                if (Common.compare(value.getTime(), to, operator)) {
+                    return value;
+                }
+
+                return helpers.error('date.' + name, { limit: args.date, value });
+            },
+            args: [
+                {
+                    name: 'date',
+                    ref: true,
+                    normalize: (date) => {
+
+                        return date === 'now' ? date : internals.parse(date);
+                    },
+                    assert: (date) => date !== null,
+                    message: 'must have a valid date format'
+                }
+            ]
+        },
+
+        format: {
+            method(format) {
+
+                Assert(['iso', 'javascript', 'unix'].includes(format), 'Unknown date format', format);
+
+                return this.$_setFlag('format', format);
+            }
+        },
+
+        greater: {
+            method(date) {
+
+                return this.$_addRule({ name: 'greater', method: 'compare', args: { date }, operator: '>' });
+            }
+        },
+
+        iso: {
+            method() {
+
+                return this.format('iso');
+            }
+        },
+
+        less: {
+            method(date) {
+
+                return this.$_addRule({ name: 'less', method: 'compare', args: { date }, operator: '<' });
+            }
+        },
+
+        max: {
+            method(date) {
+
+                return this.$_addRule({ name: 'max', method: 'compare', args: { date }, operator: '<=' });
+            }
+        },
+
+        min: {
+            method(date) {
+
+                return this.$_addRule({ name: 'min', method: 'compare', args: { date }, operator: '>=' });
+            }
+        },
+
+        timestamp: {
+            method(type = 'javascript') {
+
+                Assert(['javascript', 'unix'].includes(type), '"type" must be one of "javascript, unix"');
+
+                return this.format(type);
+            }
+        }
+    },
+
+    cast: {
+        number: {
+            from: internals.isDate,
+            to(value, helpers) {
+
+                return value.getTime();
+            }
+        },
+        string: {
+            from: internals.isDate,
+            to(value, { prefs }) {
+
+                return Template.date(value, prefs);
+            }
+        }
+    },
+
+    messages: {
+        'date.base': '{{#label}} must be a valid date',
+        'date.format': '{{#label}} must be in {{#format}} format',
+        'date.greater': '{{#label}} must be greater than {{:#limit}}',
+        'date.less': '{{#label}} must be less than {{:#limit}}',
+        'date.max': '{{#label}} must be less than or equal to {{:#limit}}',
+        'date.min': '{{#label}} must be greater than or equal to {{:#limit}}'
+    }
+});
+
+
+// Helpers
+
+internals.parse = function (value, format) {
+
+    if (value instanceof Date) {
+        return value;
+    }
+
+    if (typeof value !== 'string' &&
+        (isNaN(value) || !isFinite(value))) {
+
+        return null;
+    }
+
+    if (/^\s*$/.test(value)) {
+        return null;
+    }
+
+    // ISO
+
+    if (format === 'iso') {
+        if (!Common.isIsoDate(value)) {
+            return null;
+        }
+
+        return internals.date(value.toString());
+    }
+
+    // Normalize number string
+
+    const original = value;
+    if (typeof value === 'string' &&
+        /^[+-]?\d+(\.\d+)?$/.test(value)) {
+
+        value = parseFloat(value);
+    }
+
+    // Timestamp
+
+    if (format) {
+        if (format === 'javascript') {
+            return internals.date(1 * value);        // Casting to number
+        }
+
+        if (format === 'unix') {
+            return internals.date(1000 * value);
+        }
+
+        if (typeof original === 'string') {
+            return null;
+        }
+    }
+
+    // Plain
+
+    return internals.date(value);
+};
+
+
+internals.date = function (value) {
+
+    const date = new Date(value);
+    if (!isNaN(date.getTime())) {
+        return date;
+    }
+
+    return null;
+};
diff --git a/node_modules/@hapi/validate/lib/types/function.js b/node_modules/@hapi/validate/lib/types/function.js
new file mode 100755
index 0000000..1dc5d52
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/function.js
@@ -0,0 +1,93 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Keys = require('./keys');
+
+
+const internals = {};
+
+
+module.exports = Keys._extend({
+
+    type: 'function',
+
+    properties: {
+        typeof: 'function'
+    },
+
+    rules: {
+        arity: {
+            method(n) {
+
+                Assert(Number.isSafeInteger(n) && n >= 0, 'n must be a positive integer');
+
+                return this.$_addRule({ name: 'arity', args: { n } });
+            },
+            validate(value, helpers, { n }) {
+
+                if (value.length === n) {
+                    return value;
+                }
+
+                return helpers.error('function.arity', { n });
+            }
+        },
+
+        class: {
+            method() {
+
+                return this.$_addRule('class');
+            },
+            validate(value, helpers) {
+
+                if ((/^\s*class\s/).test(value.toString())) {
+                    return value;
+                }
+
+                return helpers.error('function.class', { value });
+            }
+        },
+
+        minArity: {
+            method(n) {
+
+                Assert(Number.isSafeInteger(n) && n > 0, 'n must be a strict positive integer');
+
+                return this.$_addRule({ name: 'minArity', args: { n } });
+            },
+            validate(value, helpers, { n }) {
+
+                if (value.length >= n) {
+                    return value;
+                }
+
+                return helpers.error('function.minArity', { n });
+            }
+        },
+
+        maxArity: {
+            method(n) {
+
+                Assert(Number.isSafeInteger(n) && n >= 0, 'n must be a positive integer');
+
+                return this.$_addRule({ name: 'maxArity', args: { n } });
+            },
+            validate(value, helpers, { n }) {
+
+                if (value.length <= n) {
+                    return value;
+                }
+
+                return helpers.error('function.maxArity', { n });
+            }
+        }
+    },
+
+    messages: {
+        'function.arity': '{{#label}} must have an arity of {{#n}}',
+        'function.class': '{{#label}} must be a class',
+        'function.maxArity': '{{#label}} must have an arity lesser or equal to {{#n}}',
+        'function.minArity': '{{#label}} must have an arity greater or equal to {{#n}}'
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/types/keys.js b/node_modules/@hapi/validate/lib/types/keys.js
new file mode 100755
index 0000000..8987cd5
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/keys.js
@@ -0,0 +1,956 @@
+'use strict';
+
+const ApplyToDefaults = require('@hapi/hoek/applyToDefaults');
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+const Topo = require('@hapi/topo');
+
+const Any = require('./any');
+const Common = require('../common');
+const Compile = require('../compile');
+const Errors = require('../errors');
+const Ref = require('../ref');
+
+
+const internals = {
+    renameDefaults: {
+        alias: false,                   // Keep old value in place
+        multiple: false,                // Allow renaming multiple keys into the same target
+        override: false                 // Overrides an existing key
+    }
+};
+
+
+module.exports = Any._extend({
+
+    type: '_keys',
+
+    properties: {
+        typeof: 'object'
+    },
+
+    flags: {
+
+        unknown: { default: false }
+    },
+
+    terms: {
+
+        dependencies: { init: null },
+        keys: { init: null },
+        patterns: { init: null },
+        renames: { init: null }
+    },
+
+    args(schema, keys) {
+
+        return schema.keys(keys);
+    },
+
+    validate(value, { schema, error, state, prefs }) {
+
+        if (!value ||
+            typeof value !== schema.$_property('typeof') ||
+            Array.isArray(value)) {
+
+            return { value, errors: error('object.base', { type: schema.$_property('typeof') }) };
+        }
+
+        // Skip if there are no other rules to test
+
+        if (!schema.$_terms.renames &&
+            !schema.$_terms.dependencies &&
+            !schema.$_terms.keys &&                       // null allows any keys
+            !schema.$_terms.patterns) {
+
+            return;
+        }
+
+        // Shallow clone value
+
+        value = internals.clone(value, prefs);
+        const errors = [];
+
+        // Rename keys
+
+        if (schema.$_terms.renames &&
+            !internals.rename(schema, value, state, prefs, errors)) {
+
+            return { value, errors };
+        }
+
+        // Anything allowed
+
+        if (!schema.$_terms.keys &&                       // null allows any keys
+            !schema.$_terms.patterns &&
+            !schema.$_terms.dependencies) {
+
+            return { value, errors };
+        }
+
+        // Defined keys
+
+        const unprocessed = new Set(Object.keys(value));
+
+        if (schema.$_terms.keys) {
+            const ancestors = [value, ...state.ancestors];
+
+            for (const child of schema.$_terms.keys) {
+                const key = child.key;
+                const item = value[key];
+
+                unprocessed.delete(key);
+
+                const localState = state.localize([...state.path, key], ancestors, child);
+                const result = child.schema.$_validate(item, localState, prefs);
+
+                if (result.errors) {
+                    if (prefs.abortEarly) {
+                        return { value, errors: result.errors };
+                    }
+
+                    errors.push(...result.errors);
+                }
+                else if (child.schema._flags.result === 'strip' ||
+                    result.value === undefined && item !== undefined) {
+
+                    delete value[key];
+                }
+                else if (result.value !== undefined) {
+                    value[key] = result.value;
+                }
+            }
+        }
+
+        // Unknown keys
+
+        if (unprocessed.size ||
+            schema._flags._hasPatternMatch) {
+
+            const early = internals.unknown(schema, value, unprocessed, errors, state, prefs);
+            if (early) {
+                return early;
+            }
+        }
+
+        // Validate dependencies
+
+        if (schema.$_terms.dependencies) {
+            for (const dep of schema.$_terms.dependencies) {
+                if (dep.key &&
+                    dep.key.resolve(value, state, prefs, null, { shadow: false }) === undefined) {
+
+                    continue;
+                }
+
+                const failed = internals.dependencies[dep.rel](schema, dep, value, state, prefs);
+                if (failed) {
+                    const report = schema.$_createError(failed.code, value, failed.context, state, prefs);
+                    if (prefs.abortEarly) {
+                        return { value, errors: report };
+                    }
+
+                    errors.push(report);
+                }
+            }
+        }
+
+        return { value, errors };
+    },
+
+    rules: {
+
+        and: {
+            method(...peers /*, [options] */) {
+
+                Common.verifyFlat(peers, 'and');
+
+                return internals.dependency(this, 'and', null, peers);
+            }
+        },
+
+        append: {
+            method(schema) {
+
+                if (schema === null ||
+                    schema === undefined ||
+                    Object.keys(schema).length === 0) {
+
+                    return this;
+                }
+
+                return this.keys(schema);
+            }
+        },
+
+        assert: {
+            method(subject, schema, message) {
+
+                subject = Compile.ref(subject);
+
+                Assert(message === undefined || typeof message === 'string', 'Message must be a string');
+
+                schema = this.$_compile(schema, { appendPath: true });
+
+                const obj = this.$_addRule({ name: 'assert', args: { subject, schema, message } });
+                obj.$_mutateRegister(subject);
+                obj.$_mutateRegister(schema);
+                return obj;
+            },
+            validate(value, { error, prefs, state }, { subject, schema, message }) {
+
+                const about = subject.resolve(value, state, prefs);
+                const path = subject.absolute(state);
+                if (schema.$_match(about, state.localize(path, [value, ...state.ancestors], schema), prefs)) {
+                    return value;
+                }
+
+                return error('object.assert', { subject, message });
+            },
+            args: ['subject', 'schema', 'message'],
+            multi: true
+        },
+
+        instance: {
+            method(constructor, name) {
+
+                Assert(typeof constructor === 'function', 'constructor must be a function');
+
+                name = name || constructor.name;
+
+                return this.$_addRule({ name: 'instance', args: { constructor, name } });
+            },
+            validate(value, helpers, { constructor, name }) {
+
+                if (value instanceof constructor) {
+                    return value;
+                }
+
+                return helpers.error('object.instance', { type: name, value });
+            },
+            args: ['constructor', 'name']
+        },
+
+        keys: {
+            method(schema) {
+
+                Assert(schema === undefined || typeof schema === 'object', 'Object schema must be a valid object');
+                Assert(!Common.isSchema(schema), 'Object schema cannot be a joi schema');
+
+                const obj = this.clone();
+
+                if (!schema) {                                      // Allow all
+                    obj.$_terms.keys = null;
+                }
+                else if (!Object.keys(schema).length) {             // Allow none
+                    obj.$_terms.keys = new internals.Keys();
+                }
+                else {
+                    obj.$_terms.keys = obj.$_terms.keys ? obj.$_terms.keys.filter((child) => !schema.hasOwnProperty(child.key)) : new internals.Keys();
+                    for (const key in schema) {
+                        Common.tryWithPath(() => obj.$_terms.keys.push({ key, schema: this.$_compile(schema[key]) }), key);
+                    }
+                }
+
+                return obj.$_mutateRebuild();
+            }
+        },
+
+        length: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'length', args: { limit }, operator: '=' });
+            },
+            validate(value, helpers, { limit }, { name, operator, args }) {
+
+                if (Common.compare(Object.keys(value).length, limit, operator)) {
+                    return value;
+                }
+
+                return helpers.error('object.' + name, { limit: args.limit, value });
+            },
+            args: [
+                {
+                    name: 'limit',
+                    ref: true,
+                    assert: Common.limit,
+                    message: 'must be a positive integer'
+                }
+            ]
+        },
+
+        max: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'max', method: 'length', args: { limit }, operator: '<=' });
+            }
+        },
+
+        min: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'min', method: 'length', args: { limit }, operator: '>=' });
+            }
+        },
+
+        nand: {
+            method(...peers /*, [options] */) {
+
+                Common.verifyFlat(peers, 'nand');
+
+                return internals.dependency(this, 'nand', null, peers);
+            }
+        },
+
+        or: {
+            method(...peers /*, [options] */) {
+
+                Common.verifyFlat(peers, 'or');
+
+                return internals.dependency(this, 'or', null, peers);
+            }
+        },
+
+        oxor: {
+            method(...peers /*, [options] */) {
+
+                return internals.dependency(this, 'oxor', null, peers);
+            }
+        },
+
+        pattern: {
+            method(pattern, schema, options = {}) {
+
+                const isRegExp = pattern instanceof RegExp;
+                if (!isRegExp) {
+                    pattern = this.$_compile(pattern, { appendPath: true });
+                }
+
+                Assert(schema !== undefined, 'Invalid rule');
+                Common.assertOptions(options, ['fallthrough', 'matches']);
+
+                if (isRegExp) {
+                    Assert(!pattern.flags.includes('g') && !pattern.flags.includes('y'), 'pattern should not use global or sticky mode');
+                }
+
+                schema = this.$_compile(schema, { appendPath: true });
+
+                const obj = this.clone();
+                obj.$_terms.patterns = obj.$_terms.patterns || [];
+                const config = { [isRegExp ? 'regex' : 'schema']: pattern, rule: schema };
+                if (options.matches) {
+                    config.matches = this.$_compile(options.matches);
+                    if (config.matches.type !== 'array') {
+                        config.matches = config.matches.$_root.array().items(config.matches);
+                    }
+
+                    obj.$_mutateRegister(config.matches);
+                    obj.$_setFlag('_hasPatternMatch', true, { clone: false });
+                }
+
+                if (options.fallthrough) {
+                    config.fallthrough = true;
+                }
+
+                obj.$_terms.patterns.push(config);
+                obj.$_mutateRegister(schema);
+                return obj;
+            }
+        },
+
+        ref: {
+            method() {
+
+                return this.$_addRule('ref');
+            },
+            validate(value, helpers) {
+
+                if (Ref.isRef(value)) {
+                    return value;
+                }
+
+                return helpers.error('object.refType', { value });
+            }
+        },
+
+        regex: {
+            method() {
+
+                return this.$_addRule('regex');
+            },
+            validate(value, helpers) {
+
+                if (value instanceof RegExp) {
+                    return value;
+                }
+
+                return helpers.error('object.regex', { value });
+            }
+        },
+
+        rename: {
+            method(from, to, options = {}) {
+
+                Assert(typeof from === 'string' || from instanceof RegExp, 'Rename missing the from argument');
+                Assert(typeof to === 'string', 'Invalid rename to argument');
+                Assert(to !== from, 'Cannot rename key to same name:', from);
+
+                Common.assertOptions(options, ['alias', 'ignoreUndefined', 'override', 'multiple']);
+
+                const obj = this.clone();
+
+                obj.$_terms.renames = obj.$_terms.renames || [];
+                for (const rename of obj.$_terms.renames) {
+                    Assert(rename.from !== from, 'Cannot rename the same key multiple times');
+                }
+
+                obj.$_terms.renames.push({
+                    from,
+                    to,
+                    options: ApplyToDefaults(internals.renameDefaults, options)
+                });
+
+                return obj;
+            }
+        },
+
+        schema: {
+            method(type = 'any') {
+
+                return this.$_addRule({ name: 'schema', args: { type } });
+            },
+            validate(value, helpers, { type }) {
+
+                if (Common.isSchema(value) &&
+                    (type === 'any' || value.type === type)) {
+
+                    return value;
+                }
+
+                return helpers.error('object.schema', { type });
+            }
+        },
+
+        unknown: {
+            method(allow) {
+
+                return this.$_setFlag('unknown', allow !== false);
+            }
+        },
+
+        with: {
+            method(key, peers, options = {}) {
+
+                return internals.dependency(this, 'with', key, peers, options);
+            }
+        },
+
+        without: {
+            method(key, peers, options = {}) {
+
+                return internals.dependency(this, 'without', key, peers, options);
+            }
+        },
+
+        xor: {
+            method(...peers /*, [options] */) {
+
+                Common.verifyFlat(peers, 'xor');
+
+                return internals.dependency(this, 'xor', null, peers);
+            }
+        }
+    },
+
+    overrides: {
+
+        default(value, options) {
+
+            if (value === undefined) {
+                value = Common.symbols.deepDefault;
+            }
+
+            return this.$_parent('default', value, options);
+        }
+    },
+
+    rebuild(schema) {
+
+        if (schema.$_terms.keys) {
+            const topo = new Topo.Sorter();
+            for (const child of schema.$_terms.keys) {
+                Common.tryWithPath(() => topo.add(child, { after: child.schema.$_rootReferences(), group: child.key }), child.key);
+            }
+
+            schema.$_terms.keys = new internals.Keys(...topo.nodes);
+        }
+    },
+
+    messages: {
+        'object.and': '{{#label}} contains {{#present}} without its required peers {{#missing}}',
+        'object.assert': '{{#label}} is invalid because it failed to pass the assertion test',
+        'object.base': '{{#label}} must be of type {{#type}}',
+        'object.instance': '{{#label}} must be an instance of {{:#type}}',
+        'object.length': '{{#label}} must have {{#limit}} keys',
+        'object.max': '{{#label}} must have less than or equal to {{#limit}} keys',
+        'object.min': '{{#label}} must have at least {{#limit}} keys',
+        'object.missing': '{{#label}} must contain at least one of {{#peers}}',
+        'object.nand': '{{:#main}} must not exist simultaneously with {{#peers}}',
+        'object.oxor': '{{#label}} contains a conflict between optional exclusive peers {{#peers}}',
+        'object.pattern.match': '{{#label}} keys failed to match pattern requirements',
+        'object.refType': '{{#label}} must be a Joi reference',
+        'object.regex': '{{#label}} must be a RegExp object',
+        'object.rename.multiple': '{{#label}} cannot rename {{:#from}} because multiple renames are disabled and another key was already renamed to {{:#to}}',
+        'object.rename.override': '{{#label}} cannot rename {{:#from}} because override is disabled and target {{:#to}} exists',
+        'object.schema': '{{#label}} must be a Joi schema of {{#type}} type',
+        'object.unknown': '{{#label}} is not allowed',
+        'object.with': '{{:#main}} missing required peer {{:#peer}}',
+        'object.without': '{{:#main}} conflict with forbidden peer {{:#peer}}',
+        'object.xor': '{{#label}} contains a conflict between exclusive peers {{#peers}}'
+    }
+});
+
+
+// Helpers
+
+internals.clone = function (value, prefs) {
+
+    // Object
+
+    if (typeof value === 'object') {
+        if (prefs.nonEnumerables) {
+            return Clone(value, { shallow: true });
+        }
+
+        const clone = Object.create(Object.getPrototypeOf(value));
+        Object.assign(clone, value);
+        return clone;
+    }
+
+    // Function
+
+    const clone = function (...args) {
+
+        return value.apply(this, args);
+    };
+
+    clone.prototype = Clone(value.prototype);
+    Object.defineProperty(clone, 'name', { value: value.name, writable: false });
+    Object.defineProperty(clone, 'length', { value: value.length, writable: false });
+    Object.assign(clone, value);
+    return clone;
+};
+
+
+internals.dependency = function (schema, rel, key, peers, options) {
+
+    Assert(key === null || typeof key === 'string', rel, 'key must be a strings');
+
+    // Extract options from peers array
+
+    if (!options) {
+        options = peers.length > 1 && typeof peers[peers.length - 1] === 'object' ? peers.pop() : {};
+    }
+
+    Common.assertOptions(options, ['separator']);
+
+    peers = [].concat(peers);
+
+    // Cast peer paths
+
+    const separator = Common.default(options.separator, '.');
+    const paths = [];
+    for (const peer of peers) {
+        Assert(typeof peer === 'string', rel, 'peers must be a string or a reference');
+        paths.push(Compile.ref(peer, { separator, ancestor: 0, prefix: false }));
+    }
+
+    // Cast key
+
+    if (key !== null) {
+        key = Compile.ref(key, { separator, ancestor: 0, prefix: false });
+    }
+
+    // Add rule
+
+    const obj = schema.clone();
+    obj.$_terms.dependencies = obj.$_terms.dependencies || [];
+    obj.$_terms.dependencies.push(new internals.Dependency(rel, key, paths, peers));
+    return obj;
+};
+
+
+internals.dependencies = {
+
+    and(schema, dep, value, state, prefs) {
+
+        const missing = [];
+        const present = [];
+        const count = dep.peers.length;
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) === undefined) {
+                missing.push(peer.key);
+            }
+            else {
+                present.push(peer.key);
+            }
+        }
+
+        if (missing.length !== count &&
+            present.length !== count) {
+
+            return {
+                code: 'object.and',
+                context: {
+                    present,
+                    missing
+                }
+            };
+        }
+    },
+
+    nand(schema, dep, value, state, prefs) {
+
+        const present = [];
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) !== undefined) {
+                present.push(peer.key);
+            }
+        }
+
+        if (present.length !== dep.peers.length) {
+            return;
+        }
+
+        const main = dep.paths[0];
+        const values = dep.paths.slice(1);
+        return {
+            code: 'object.nand',
+            context: {
+                main,
+                peers: values
+            }
+        };
+    },
+
+    or(schema, dep, value, state, prefs) {
+
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) !== undefined) {
+                return;
+            }
+        }
+
+        return {
+            code: 'object.missing',
+            context: {
+                peers: dep.paths
+            }
+        };
+    },
+
+    oxor(schema, dep, value, state, prefs) {
+
+        const present = [];
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) !== undefined) {
+                present.push(peer.key);
+            }
+        }
+
+        if (!present.length ||
+            present.length === 1) {
+
+            return;
+        }
+
+        const context = { peers: dep.paths };
+        context.present = present;
+        return { code: 'object.oxor', context };
+    },
+
+    with(schema, dep, value, state, prefs) {
+
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) === undefined) {
+                return {
+                    code: 'object.with',
+                    context: {
+                        main: dep.key.key,
+                        peer: peer.key
+                    }
+                };
+            }
+        }
+    },
+
+    without(schema, dep, value, state, prefs) {
+
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) !== undefined) {
+                return {
+                    code: 'object.without',
+                    context: {
+                        main: dep.key.key,
+                        peer: peer.key
+                    }
+                };
+            }
+        }
+    },
+
+    xor(schema, dep, value, state, prefs) {
+
+        const present = [];
+        for (const peer of dep.peers) {
+            if (peer.resolve(value, state, prefs, null, { shadow: false }) !== undefined) {
+                present.push(peer.key);
+            }
+        }
+
+        if (present.length === 1) {
+            return;
+        }
+
+        const context = { peers: dep.paths };
+        if (present.length === 0) {
+            return { code: 'object.missing', context };
+        }
+
+        context.present = present;
+        return { code: 'object.xor', context };
+    }
+};
+
+
+internals.rename = function (schema, value, state, prefs, errors) {
+
+    const renamed = {};
+    for (const rename of schema.$_terms.renames) {
+        const matches = [];
+        const pattern = typeof rename.from !== 'string';
+        if (!pattern) {
+            if (Object.prototype.hasOwnProperty.call(value, rename.from) &&
+                (value[rename.from] !== undefined || !rename.options.ignoreUndefined)) {
+
+                matches.push(rename);
+            }
+        }
+        else {
+            for (const from in value) {
+                if (value[from] === undefined &&
+                    rename.options.ignoreUndefined) {
+
+                    continue;
+                }
+
+                if (from === rename.to) {
+                    continue;
+                }
+
+                const match = rename.from.exec(from);
+                if (!match) {
+                    continue;
+                }
+
+                matches.push({ from, to: rename.to, match });
+            }
+        }
+
+        for (const match of matches) {
+            const from = match.from;
+            const to = match.to;
+
+            if (!rename.options.multiple &&
+                renamed[to]) {
+
+                errors.push(schema.$_createError('object.rename.multiple', value, { from, to, pattern }, state, prefs));
+                if (prefs.abortEarly) {
+                    return false;
+                }
+            }
+
+            if (Object.prototype.hasOwnProperty.call(value, to) &&
+                !rename.options.override &&
+                !renamed[to]) {
+
+                errors.push(schema.$_createError('object.rename.override', value, { from, to, pattern }, state, prefs));
+                if (prefs.abortEarly) {
+                    return false;
+                }
+            }
+
+            if (value[from] === undefined) {
+                delete value[to];
+            }
+            else {
+                value[to] = value[from];
+            }
+
+            renamed[to] = true;
+
+            if (!rename.options.alias) {
+                delete value[from];
+            }
+        }
+    }
+
+    return true;
+};
+
+
+internals.unknown = function (schema, value, unprocessed, errors, state, prefs) {
+
+    if (schema.$_terms.patterns) {
+        let hasMatches = false;
+        const matches = schema.$_terms.patterns.map((pattern) => {
+
+            if (pattern.matches) {
+                hasMatches = true;
+                return [];
+            }
+        });
+
+        const ancestors = [value, ...state.ancestors];
+
+        for (const key of unprocessed) {
+            const item = value[key];
+            const path = [...state.path, key];
+
+            for (let i = 0; i < schema.$_terms.patterns.length; ++i) {
+                const pattern = schema.$_terms.patterns[i];
+                if (pattern.regex) {
+                    const match = pattern.regex.test(key);
+                    if (!match) {
+                        continue;
+                    }
+                }
+                else {
+                    if (!pattern.schema.$_match(key, state.nest(pattern.schema, `pattern.${i}`), prefs)) {
+                        continue;
+                    }
+                }
+
+                unprocessed.delete(key);
+
+                const localState = state.localize(path, ancestors, { schema: pattern.rule, key });
+                const result = pattern.rule.$_validate(item, localState, prefs);
+                if (result.errors) {
+                    if (prefs.abortEarly) {
+                        return { value, errors: result.errors };
+                    }
+
+                    errors.push(...result.errors);
+                }
+
+                if (pattern.matches) {
+                    matches[i].push(key);
+                }
+
+                value[key] = result.value;
+                if (!pattern.fallthrough) {
+                    break;
+                }
+            }
+        }
+
+        // Validate pattern matches rules
+
+        if (hasMatches) {
+            for (let i = 0; i < matches.length; ++i) {
+                const match = matches[i];
+                if (!match) {
+                    continue;
+                }
+
+                const stpm = schema.$_terms.patterns[i].matches;
+                const localState = state.localize(state.path, ancestors, stpm);
+                const result = stpm.$_validate(match, localState, prefs);
+                if (result.errors) {
+                    const details = Errors.details(result.errors, { override: false });
+                    details.matches = match;
+                    const report = schema.$_createError('object.pattern.match', value, details, state, prefs);
+                    if (prefs.abortEarly) {
+                        return { value, errors: report };
+                    }
+
+                    errors.push(report);
+                }
+            }
+        }
+    }
+
+    if (!unprocessed.size ||
+        !schema.$_terms.keys && !schema.$_terms.patterns) {     // If no keys or patterns specified, unknown keys allowed
+
+        return;
+    }
+
+    if (prefs.stripUnknown && !schema._flags.unknown ||
+        prefs.skipFunctions) {
+
+        const stripUnknown = prefs.stripUnknown ? (prefs.stripUnknown === true ? true : !!prefs.stripUnknown.objects) : false;
+
+        for (const key of unprocessed) {
+            if (stripUnknown) {
+                delete value[key];
+                unprocessed.delete(key);
+            }
+            else if (typeof value[key] === 'function') {
+                unprocessed.delete(key);
+            }
+        }
+    }
+
+    const forbidUnknown = !Common.default(schema._flags.unknown, prefs.allowUnknown);
+    if (forbidUnknown) {
+        for (const unprocessedKey of unprocessed) {
+            const localState = state.localize([...state.path, unprocessedKey], []);
+            const report = schema.$_createError('object.unknown', value[unprocessedKey], { child: unprocessedKey }, localState, prefs, { flags: false });
+            if (prefs.abortEarly) {
+                return { value, errors: report };
+            }
+
+            errors.push(report);
+        }
+    }
+};
+
+
+internals.Dependency = class {
+
+    constructor(rel, key, peers, paths) {
+
+        this.rel = rel;
+        this.key = key;
+        this.peers = peers;
+        this.paths = paths;
+    }
+};
+
+
+internals.Keys = class extends Array {
+
+    concat(source) {
+
+        const result = this.slice();
+
+        const keys = new Map();
+        for (let i = 0; i < result.length; ++i) {
+            keys.set(result[i].key, i);
+        }
+
+        for (const item of source) {
+            const key = item.key;
+            const pos = keys.get(key);
+            if (pos !== undefined) {
+                result[pos] = { key, schema: result[pos].schema.concat(item.schema) };
+            }
+            else {
+                result.push(item);
+            }
+        }
+
+        return result;
+    }
+};
diff --git a/node_modules/@hapi/validate/lib/types/link.js b/node_modules/@hapi/validate/lib/types/link.js
new file mode 100755
index 0000000..3c2fe75
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/link.js
@@ -0,0 +1,159 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+const Compile = require('../compile');
+const Errors = require('../errors');
+
+
+const internals = {};
+
+
+module.exports = Any._extend({
+
+    type: 'link',
+
+    properties: {
+        schemaChain: true
+    },
+
+    terms: {
+
+        link: { init: null, register: false }
+    },
+
+    args(schema, ref) {
+
+        return schema.ref(ref);
+    },
+
+    validate(value, { schema, state, prefs }) {
+
+        Assert(schema.$_terms.link, 'Uninitialized link schema');
+
+        const linked = internals.generate(schema, value, state, prefs);
+        const ref = schema.$_terms.link[0].ref;
+        return linked.$_validate(value, state.nest(linked, `link:${ref.display}:${linked.type}`), prefs);
+    },
+
+    generate(schema, value, state, prefs) {
+
+        return internals.generate(schema, value, state, prefs);
+    },
+
+    rules: {
+
+        ref: {
+            method(ref) {
+
+                Assert(!this.$_terms.link, 'Cannot reinitialize schema');
+
+                ref = Compile.ref(ref);
+
+                Assert(ref.type === 'value' || ref.type === 'local', 'Invalid reference type:', ref.type);
+                Assert(ref.type === 'local' || ref.ancestor === 'root' || ref.ancestor > 0, 'Link cannot reference itself');
+
+                const obj = this.clone();
+                obj.$_terms.link = [{ ref }];
+                return obj;
+            }
+        },
+
+        relative: {
+            method(enabled = true) {
+
+                return this.$_setFlag('relative', enabled);
+            }
+        }
+    },
+
+    overrides: {
+
+        concat(source) {
+
+            Assert(this.$_terms.link, 'Uninitialized link schema');
+            Assert(Common.isSchema(source), 'Invalid schema object');
+            Assert(source.type !== 'link', 'Cannot merge type link with another link');
+
+            const obj = this.clone();
+
+            if (!obj.$_terms.whens) {
+                obj.$_terms.whens = [];
+            }
+
+            obj.$_terms.whens.push({ concat: source });
+            return obj.$_mutateRebuild();
+        }
+    }
+});
+
+
+// Helpers
+
+internals.generate = function (schema, value, state, prefs) {
+
+    let linked = state.mainstay.links.get(schema);
+    if (linked) {
+        return linked._generate(value, state, prefs).schema;
+    }
+
+    const ref = schema.$_terms.link[0].ref;
+    const { perspective, path } = internals.perspective(ref, state);
+    internals.assert(perspective, 'which is outside of schema boundaries', ref, schema, state, prefs);
+
+    try {
+        linked = path.length ? perspective.$_reach(path) : perspective;
+    }
+    catch (ignoreErr) {
+        internals.assert(false, 'to non-existing schema', ref, schema, state, prefs);
+    }
+
+    internals.assert(linked.type !== 'link', 'which is another link', ref, schema, state, prefs);
+
+    if (!schema._flags.relative) {
+        state.mainstay.links.set(schema, linked);
+    }
+
+    return linked._generate(value, state, prefs).schema;
+};
+
+
+internals.perspective = function (ref, state) {
+
+    if (ref.type === 'local') {
+        for (const { schema, key } of state.schemas) {                              // From parent to root
+            const id = schema._flags.id || key;
+            if (id === ref.path[0]) {
+                return { perspective: schema, path: ref.path.slice(1) };
+            }
+
+            if (schema.$_terms.shared) {
+                for (const shared of schema.$_terms.shared) {
+                    if (shared._flags.id === ref.path[0]) {
+                        return { perspective: shared, path: ref.path.slice(1) };
+                    }
+                }
+            }
+        }
+
+        return { perspective: null, path: null };
+    }
+
+    if (ref.ancestor === 'root') {
+        return { perspective: state.schemas[state.schemas.length - 1].schema, path: ref.path };
+    }
+
+    return { perspective: state.schemas[ref.ancestor]?.schema, path: ref.path };
+};
+
+
+internals.assert = function (condition, message, ref, schema, state, prefs) {
+
+    if (condition) {                // Manual check to avoid generating error message on success
+        return;
+    }
+
+    Assert(false, `"${Errors.label(schema._flags, state, prefs)}" contains link reference "${ref.display}" ${message}`);
+};
diff --git a/node_modules/@hapi/validate/lib/types/number.js b/node_modules/@hapi/validate/lib/types/number.js
new file mode 100755
index 0000000..c8f61f7
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/number.js
@@ -0,0 +1,331 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+const Common = require('../common');
+
+
+const internals = {
+    numberRx: /^\s*[+-]?(?:(?:\d+(?:\.\d*)?)|(?:\.\d+))(?:e([+-]?\d+))?\s*$/i,
+    precisionRx: /(?:\.(\d+))?(?:[eE]([+-]?\d+))?$/
+};
+
+
+module.exports = Any._extend({
+
+    type: 'number',
+
+    flags: {
+
+        unsafe: { default: false }
+    },
+
+    coerce: {
+        from: 'string',
+        method(value, { schema, error }) {
+
+            const matches = value.match(internals.numberRx);
+            if (!matches) {
+                return;
+            }
+
+            value = value.trim();
+            const result = { value: parseFloat(value) };
+
+            if (result.value === 0) {
+                result.value = 0;           // -0
+            }
+
+            if (!schema._flags.unsafe) {
+                if (value.match(/e/i)) {
+                    const constructed = internals.normalizeExponent(`${result.value / Math.pow(10, matches[1])}e${matches[1]}`);
+                    if (constructed !== internals.normalizeExponent(value)) {
+                        result.errors = error('number.unsafe');
+                        return result;
+                    }
+                }
+                else {
+                    const string = result.value.toString();
+                    if (string.match(/e/i)) {
+                        return result;
+                    }
+
+                    if (string !== internals.normalizeDecimal(value)) {
+                        result.errors = error('number.unsafe');
+                        return result;
+                    }
+                }
+            }
+
+            return result;
+        }
+    },
+
+    validate(value, { schema, error, prefs }) {
+
+        if (value === Infinity ||
+            value === -Infinity) {
+
+            return { value, errors: error('number.infinity') };
+        }
+
+        if (!Common.isNumber(value)) {
+            return { value, errors: error('number.base') };
+        }
+
+        const result = { value };
+
+        if (prefs.convert) {
+            const rule = schema.$_getRule('precision');
+            if (rule) {
+                const precision = Math.pow(10, rule.args.limit);                    // This is conceptually equivalent to using toFixed but it should be much faster
+                result.value = Math.round(result.value * precision) / precision;
+            }
+        }
+
+        if (result.value === 0) {
+            result.value = 0;           // -0
+        }
+
+        if (!schema._flags.unsafe &&
+            (value > Number.MAX_SAFE_INTEGER || value < Number.MIN_SAFE_INTEGER)) {
+
+            result.errors = error('number.unsafe');
+        }
+
+        return result;
+    },
+
+    rules: {
+
+        compare: {
+            method: false,
+            validate(value, helpers, { limit }, { name, operator, args }) {
+
+                if (Common.compare(value, limit, operator)) {
+                    return value;
+                }
+
+                return helpers.error('number.' + name, { limit: args.limit, value });
+            },
+            args: [
+                {
+                    name: 'limit',
+                    ref: true,
+                    assert: Common.isNumber,
+                    message: 'must be a number'
+                }
+            ]
+        },
+
+        greater: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'greater', method: 'compare', args: { limit }, operator: '>' });
+            }
+        },
+
+        integer: {
+            method() {
+
+                return this.$_addRule('integer');
+            },
+            validate(value, helpers) {
+
+                if (Math.trunc(value) - value === 0) {
+                    return value;
+                }
+
+                return helpers.error('number.integer');
+            }
+        },
+
+        less: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'less', method: 'compare', args: { limit }, operator: '<' });
+            }
+        },
+
+        max: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'max', method: 'compare', args: { limit }, operator: '<=' });
+            }
+        },
+
+        min: {
+            method(limit) {
+
+                return this.$_addRule({ name: 'min', method: 'compare', args: { limit }, operator: '>=' });
+            }
+        },
+
+        multiple: {
+            method(base) {
+
+                return this.$_addRule({ name: 'multiple', args: { base } });
+            },
+            validate(value, helpers, { base }, options) {
+
+                if (value % base === 0) {
+                    return value;
+                }
+
+                return helpers.error('number.multiple', { multiple: options.args.base, value });
+            },
+            args: [
+                {
+                    name: 'base',
+                    ref: true,
+                    assert: (value) => typeof value === 'number' && isFinite(value) && value > 0,
+                    message: 'must be a positive number'
+                }
+            ],
+            multi: true
+        },
+
+        negative: {
+            method() {
+
+                return this.sign('negative');
+            }
+        },
+
+        port: {
+            method() {
+
+                return this.$_addRule('port');
+            },
+            validate(value, helpers) {
+
+                if (Number.isSafeInteger(value) &&
+                    value >= 0 &&
+                    value <= 65535) {
+
+                    return value;
+                }
+
+                return helpers.error('number.port');
+            }
+        },
+
+        positive: {
+            method() {
+
+                return this.sign('positive');
+            }
+        },
+
+        precision: {
+            method(limit) {
+
+                Assert(Number.isSafeInteger(limit), 'limit must be an integer');
+
+                return this.$_addRule({ name: 'precision', args: { limit } });
+            },
+            validate(value, helpers, { limit }) {
+
+                const places = value.toString().match(internals.precisionRx);
+                const decimals = Math.max((places[1] ? places[1].length : 0) - (places[2] ? parseInt(places[2], 10) : 0), 0);
+                if (decimals <= limit) {
+                    return value;
+                }
+
+                return helpers.error('number.precision', { limit, value });
+            },
+            convert: true
+        },
+
+        sign: {
+            method(sign) {
+
+                Assert(['negative', 'positive'].includes(sign), 'Invalid sign', sign);
+
+                return this.$_addRule({ name: 'sign', args: { sign } });
+            },
+            validate(value, helpers, { sign }) {
+
+                if (sign === 'negative' && value < 0 ||
+                    sign === 'positive' && value > 0) {
+
+                    return value;
+                }
+
+                return helpers.error(`number.${sign}`);
+            }
+        },
+
+        unsafe: {
+            method(enabled = true) {
+
+                Assert(typeof enabled === 'boolean', 'enabled must be a boolean');
+
+                return this.$_setFlag('unsafe', enabled);
+            }
+        }
+    },
+
+    cast: {
+        string: {
+            from: (value) => typeof value === 'number',
+            to(value, helpers) {
+
+                return value.toString();
+            }
+        }
+    },
+
+    messages: {
+        'number.base': '{{#label}} must be a number',
+        'number.greater': '{{#label}} must be greater than {{#limit}}',
+        'number.infinity': '{{#label}} cannot be infinity',
+        'number.integer': '{{#label}} must be an integer',
+        'number.less': '{{#label}} must be less than {{#limit}}',
+        'number.max': '{{#label}} must be less than or equal to {{#limit}}',
+        'number.min': '{{#label}} must be greater than or equal to {{#limit}}',
+        'number.multiple': '{{#label}} must be a multiple of {{#multiple}}',
+        'number.negative': '{{#label}} must be a negative number',
+        'number.port': '{{#label}} must be a valid port',
+        'number.positive': '{{#label}} must be a positive number',
+        'number.precision': '{{#label}} must have no more than {{#limit}} decimal places',
+        'number.unsafe': '{{#label}} must be a safe number'
+    }
+});
+
+
+// Helpers
+
+internals.normalizeExponent = function (str) {
+
+    return str
+        .replace(/E/, 'e')
+        .replace(/\.(\d*[1-9])?0+e/, '.$1e')
+        .replace(/\.e/, 'e')
+        .replace(/e\+/, 'e')
+        .replace(/^\+/, '')
+        .replace(/^(-?)0+([1-9])/, '$1$2');
+};
+
+
+internals.normalizeDecimal = function (str) {
+
+    str = str
+        .replace(/^\+/, '')
+        .replace(/\.0+$/, '')
+        .replace(/^(-?)\.([^\.]*)$/, '$10.$2')
+        .replace(/^(-?)0+([1-9])/, '$1$2');
+
+    if (str.includes('.') &&
+        str.endsWith('0')) {
+
+        str = str.replace(/0+$/, '');
+    }
+
+    if (str === '-0') {
+        return '0';
+    }
+
+    return str;
+};
diff --git a/node_modules/@hapi/validate/lib/types/object.js b/node_modules/@hapi/validate/lib/types/object.js
new file mode 100755
index 0000000..2c26fcc
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/object.js
@@ -0,0 +1,22 @@
+'use strict';
+
+const Keys = require('./keys');
+
+
+const internals = {};
+
+
+module.exports = Keys._extend({
+
+    type: 'object',
+
+    cast: {
+        map: {
+            from: (value) => value && typeof value === 'object',
+            to(value, helpers) {
+
+                return new Map(Object.entries(value));
+            }
+        }
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/types/string.js b/node_modules/@hapi/validate/lib/types/string.js
new file mode 100755
index 0000000..e91cb19
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/string.js
@@ -0,0 +1,732 @@
+'use strict';
+
+const Url = require('url');
+
+const Assert = require('@hapi/hoek/assert');
+const EscapeRegex = require('@hapi/hoek/escapeRegex');
+
+const Any = require('./any');
+const Common = require('../common');
+
+
+const internals = {
+    base64Regex: {
+        // paddingRequired
+        true: {
+            // urlSafe
+            true: /^(?:[\w\-]{2}[\w\-]{2})*(?:[\w\-]{2}==|[\w\-]{3}=)?$/,
+            false: /^(?:[A-Za-z0-9+\/]{2}[A-Za-z0-9+\/]{2})*(?:[A-Za-z0-9+\/]{2}==|[A-Za-z0-9+\/]{3}=)?$/
+        },
+        false: {
+            true: /^(?:[\w\-]{2}[\w\-]{2})*(?:[\w\-]{2}(==)?|[\w\-]{3}=?)?$/,
+            false: /^(?:[A-Za-z0-9+\/]{2}[A-Za-z0-9+\/]{2})*(?:[A-Za-z0-9+\/]{2}(==)?|[A-Za-z0-9+\/]{3}=?)?$/
+        }
+    },
+    dataUriRegex: /^data:[\w+.-]+\/[\w+.-]+;((charset=[\w-]+|base64),)?(.*)$/,
+    hexRegex: /^[a-f0-9]+$/i,
+    isoDurationRegex: /^P(?!$)(\d+Y)?(\d+M)?(\d+W)?(\d+D)?(T(?=\d)(\d+H)?(\d+M)?(\d+S)?)?$/,
+
+    guidBrackets: {
+        '{': '}', '[': ']', '(': ')', '': ''
+    },
+    guidVersions: {
+        uuidv1: '1',
+        uuidv2: '2',
+        uuidv3: '3',
+        uuidv4: '4',
+        uuidv5: '5'
+    },
+    guidSeparators: new Set([undefined, true, false, '-', ':']),
+
+    normalizationForms: ['NFC', 'NFD', 'NFKC', 'NFKD'],
+
+    domainControlRx: /[\x00-\x20@\:\/]/,                                                // Control + space + separators
+    domainSegmentRx: /^[a-zA-Z0-9](?:[a-zA-Z0-9\-]*[a-zA-Z0-9])?$/,
+    finalSegmentAdditionalRx: /[^0-9]/                                                  // Domain segment which is additionally not all-numeric
+};
+
+
+module.exports = Any._extend({
+
+    type: 'string',
+
+    flags: {
+
+        insensitive: { default: false },
+        truncate: { default: false }
+    },
+
+    terms: {
+
+        replacements: { init: null }
+    },
+
+    coerce: {
+        from: 'string',
+        method(value, { schema, state, prefs }) {
+
+            const normalize = schema.$_getRule('normalize');
+            if (normalize) {
+                value = value.normalize(normalize.args.form);
+            }
+
+            const casing = schema.$_getRule('case');
+            if (casing) {
+                value = casing.args.direction === 'upper' ? value.toLocaleUpperCase() : value.toLocaleLowerCase();
+            }
+
+            const trim = schema.$_getRule('trim');
+            if (trim &&
+                trim.args.enabled) {
+
+                value = value.trim();
+            }
+
+            if (schema.$_terms.replacements) {
+                for (const replacement of schema.$_terms.replacements) {
+                    value = value.replace(replacement.pattern, replacement.replacement);
+                }
+            }
+
+            const hex = schema.$_getRule('hex');
+            if (hex &&
+                hex.args.options.byteAligned &&
+                value.length % 2 !== 0) {
+
+                value = `0${value}`;
+            }
+
+            if (schema.$_getRule('isoDate')) {
+                const iso = internals.isoDate(value);
+                if (iso) {
+                    value = iso;
+                }
+            }
+
+            if (schema._flags.truncate) {
+                const rule = schema.$_getRule('max');
+                if (rule) {
+                    let limit = rule.args.limit;
+                    if (Common.isResolvable(limit)) {
+                        limit = limit.resolve(value, state, prefs);
+                        if (!Common.limit(limit)) {
+                            return { value, errors: schema.$_createError('any.ref', limit, { ref: rule.args.limit, arg: 'limit', reason: 'must be a positive integer' }, state, prefs) };
+                        }
+                    }
+
+                    value = value.slice(0, limit);
+                }
+            }
+
+            return { value };
+        }
+    },
+
+    validate(value, { error }) {
+
+        if (typeof value !== 'string') {
+            return { value, errors: error('string.base') };
+        }
+
+        if (value === '') {
+            return { value, errors: error('string.empty') };
+        }
+    },
+
+    rules: {
+
+        alphanum: {
+            method() {
+
+                return this.$_addRule('alphanum');
+            },
+            validate(value, helpers) {
+
+                if (/^[a-zA-Z0-9]+$/.test(value)) {
+                    return value;
+                }
+
+                return helpers.error('string.alphanum');
+            }
+        },
+
+        base64: {
+            method(options = {}) {
+
+                Common.assertOptions(options, ['paddingRequired', 'urlSafe']);
+
+                options = { urlSafe: false, paddingRequired: true, ...options };
+                Assert(typeof options.paddingRequired === 'boolean', 'paddingRequired must be boolean');
+                Assert(typeof options.urlSafe === 'boolean', 'urlSafe must be boolean');
+
+                return this.$_addRule({ name: 'base64', args: { options } });
+            },
+            validate(value, helpers, { options }) {
+
+                const regex = internals.base64Regex[options.paddingRequired][options.urlSafe];
+                if (regex.test(value)) {
+                    return value;
+                }
+
+                return helpers.error('string.base64');
+            }
+        },
+
+        case: {
+            method(direction) {
+
+                Assert(['lower', 'upper'].includes(direction), 'Invalid case:', direction);
+
+                return this.$_addRule({ name: 'case', args: { direction } });
+            },
+            validate(value, helpers, { direction }) {
+
+                if (direction === 'lower' && value === value.toLocaleLowerCase() ||
+                    direction === 'upper' && value === value.toLocaleUpperCase()) {
+
+                    return value;
+                }
+
+                return helpers.error(`string.${direction}case`);
+            },
+            convert: true
+        },
+
+        creditCard: {
+            method() {
+
+                return this.$_addRule('creditCard');
+            },
+            validate(value, helpers) {
+
+                let i = value.length;
+                let sum = 0;
+                let mul = 1;
+
+                while (i--) {
+                    const char = value.charAt(i) * mul;
+                    sum = sum + (char - (char > 9) * 9);
+                    mul = mul ^ 3;
+                }
+
+                if (sum > 0 &&
+                    sum % 10 === 0) {
+
+                    return value;
+                }
+
+                return helpers.error('string.creditCard');
+            }
+        },
+
+        dataUri: {
+            method(options = {}) {
+
+                Common.assertOptions(options, ['paddingRequired']);
+
+                options = { paddingRequired: true, ...options };
+                Assert(typeof options.paddingRequired === 'boolean', 'paddingRequired must be boolean');
+
+                return this.$_addRule({ name: 'dataUri', args: { options } });
+            },
+            validate(value, helpers, { options }) {
+
+                const matches = value.match(internals.dataUriRegex);
+
+                if (matches) {
+                    if (!matches[2]) {
+                        return value;
+                    }
+
+                    if (matches[2] !== 'base64') {
+                        return value;
+                    }
+
+                    const base64regex = internals.base64Regex[options.paddingRequired].false;
+                    if (base64regex.test(matches[3])) {
+                        return value;
+                    }
+                }
+
+                return helpers.error('string.dataUri');
+            }
+        },
+
+        guid: {
+            alias: 'uuid',
+            method(options = {}) {
+
+                Common.assertOptions(options, ['version', 'separator']);
+
+                let versionNumbers = '';
+
+                if (options.version) {
+                    const versions = [].concat(options.version);
+
+                    Assert(versions.length >= 1, 'version must have at least 1 valid version specified');
+                    const set = new Set();
+
+                    for (let i = 0; i < versions.length; ++i) {
+                        const version = versions[i];
+                        Assert(typeof version === 'string', 'version at position ' + i + ' must be a string');
+                        const versionNumber = internals.guidVersions[version.toLowerCase()];
+                        Assert(versionNumber, 'version at position ' + i + ' must be one of ' + Object.keys(internals.guidVersions).join(', '));
+                        Assert(!set.has(versionNumber), 'version at position ' + i + ' must not be a duplicate');
+
+                        versionNumbers += versionNumber;
+                        set.add(versionNumber);
+                    }
+                }
+
+                Assert(internals.guidSeparators.has(options.separator), 'separator must be one of true, false, "-", or ":"');
+                const separator = options.separator === undefined ? '[:-]?' :
+                    options.separator === true ? '[:-]' :
+                        options.separator === false ? '[]?' : `\\${options.separator}`;
+
+                const regex = new RegExp(`^([\\[{\\(]?)[0-9A-F]{8}(${separator})[0-9A-F]{4}\\2?[${versionNumbers || '0-9A-F'}][0-9A-F]{3}\\2?[${versionNumbers ? '89AB' : '0-9A-F'}][0-9A-F]{3}\\2?[0-9A-F]{12}([\\]}\\)]?)$`, 'i');
+
+                return this.$_addRule({ name: 'guid', args: { options }, regex });
+            },
+            validate(value, helpers, args, { regex }) {
+
+                const results = regex.exec(value);
+
+                if (!results) {
+                    return helpers.error('string.guid');
+                }
+
+                // Matching braces
+
+                if (internals.guidBrackets[results[1]] !== results[results.length - 1]) {
+                    return helpers.error('string.guid');
+                }
+
+                return value;
+            }
+        },
+
+        hex: {
+            method(options = {}) {
+
+                Common.assertOptions(options, ['byteAligned']);
+
+                options = { byteAligned: false, ...options };
+                Assert(typeof options.byteAligned === 'boolean', 'byteAligned must be boolean');
+
+                return this.$_addRule({ name: 'hex', args: { options } });
+            },
+            validate(value, helpers, { options }) {
+
+                if (!internals.hexRegex.test(value)) {
+                    return helpers.error('string.hex');
+                }
+
+                if (options.byteAligned &&
+                    value.length % 2 !== 0) {
+
+                    return helpers.error('string.hexAlign');
+                }
+
+                return value;
+            }
+        },
+
+        hostname: {
+            method() {
+
+                return this.$_addRule('hostname');
+            },
+            validate(value, helpers) {
+
+                if (internals.isDomainValid(value) ||
+                    internals.ipRegex.test(value)) {
+
+                    return value;
+                }
+
+                return helpers.error('string.hostname');
+            }
+        },
+
+        insensitive: {
+            method() {
+
+                return this.$_setFlag('insensitive', true);
+            }
+        },
+
+        isoDate: {
+            method() {
+
+                return this.$_addRule('isoDate');
+            },
+            validate(value, { error }) {
+
+                if (internals.isoDate(value)) {
+                    return value;
+                }
+
+                return error('string.isoDate');
+            }
+        },
+
+        isoDuration: {
+            method() {
+
+                return this.$_addRule('isoDuration');
+            },
+            validate(value, helpers) {
+
+                if (internals.isoDurationRegex.test(value)) {
+                    return value;
+                }
+
+                return helpers.error('string.isoDuration');
+            }
+        },
+
+        length: {
+            method(limit, encoding) {
+
+                return internals.length(this, 'length', limit, '=', encoding);
+            },
+            validate(value, helpers, { limit, encoding }, { name, operator, args }) {
+
+                const length = encoding ? Buffer.byteLength(value, encoding) : value.length;
+                if (Common.compare(length, limit, operator)) {
+                    return value;
+                }
+
+                return helpers.error('string.' + name, { limit: args.limit, value, encoding });
+            },
+            args: [
+                {
+                    name: 'limit',
+                    ref: true,
+                    assert: Common.limit,
+                    message: 'must be a positive integer'
+                },
+                'encoding'
+            ]
+        },
+
+        lowercase: {
+            method() {
+
+                return this.case('lower');
+            }
+        },
+
+        max: {
+            method(limit, encoding) {
+
+                return internals.length(this, 'max', limit, '<=', encoding);
+            },
+            args: ['limit', 'encoding']
+        },
+
+        min: {
+            method(limit, encoding) {
+
+                return internals.length(this, 'min', limit, '>=', encoding);
+            },
+            args: ['limit', 'encoding']
+        },
+
+        normalize: {
+            method(form = 'NFC') {
+
+                Assert(internals.normalizationForms.includes(form), 'normalization form must be one of ' + internals.normalizationForms.join(', '));
+
+                return this.$_addRule({ name: 'normalize', args: { form } });
+            },
+            validate(value, { error }, { form }) {
+
+                if (value === value.normalize(form)) {
+                    return value;
+                }
+
+                return error('string.normalize', { value, form });
+            },
+            convert: true
+        },
+
+        pattern: {
+            alias: 'regex',
+            method(regex, options = {}) {
+
+                Assert(regex instanceof RegExp, 'regex must be a RegExp');
+                Assert(!regex.flags.includes('g') && !regex.flags.includes('y'), 'regex should not use global or sticky mode');
+
+                if (typeof options === 'string') {
+                    options = { name: options };
+                }
+
+                Common.assertOptions(options, ['invert', 'name']);
+
+                const errorCode = ['string.pattern', options.invert ? '.invert' : '', options.name ? '.name' : '.base'].join('');
+                return this.$_addRule({ name: 'pattern', args: { regex, options }, errorCode });
+            },
+            validate(value, helpers, { regex, options }, { errorCode }) {
+
+                const patternMatch = regex.test(value);
+
+                if (patternMatch ^ options.invert) {
+                    return value;
+                }
+
+                return helpers.error(errorCode, { name: options.name, regex, value });
+            },
+            args: ['regex', 'options'],
+            multi: true
+        },
+
+        replace: {
+            method(pattern, replacement) {
+
+                if (typeof pattern === 'string') {
+                    pattern = new RegExp(EscapeRegex(pattern), 'g');
+                }
+
+                Assert(pattern instanceof RegExp, 'pattern must be a RegExp');
+                Assert(typeof replacement === 'string', 'replacement must be a String');
+
+                const obj = this.clone();
+
+                if (!obj.$_terms.replacements) {
+                    obj.$_terms.replacements = [];
+                }
+
+                obj.$_terms.replacements.push({ pattern, replacement });
+                return obj;
+            }
+        },
+
+        token: {
+            method() {
+
+                return this.$_addRule('token');
+            },
+            validate(value, helpers) {
+
+                if (/^\w+$/.test(value)) {
+                    return value;
+                }
+
+                return helpers.error('string.token');
+            }
+        },
+
+        trim: {
+            method(enabled = true) {
+
+                Assert(typeof enabled === 'boolean', 'enabled must be a boolean');
+
+                return this.$_addRule({ name: 'trim', args: { enabled } });
+            },
+            validate(value, helpers, { enabled }) {
+
+                if (!enabled ||
+                    value === value.trim()) {
+
+                    return value;
+                }
+
+                return helpers.error('string.trim');
+            },
+            convert: true
+        },
+
+        truncate: {
+            method(enabled = true) {
+
+                Assert(typeof enabled === 'boolean', 'enabled must be a boolean');
+
+                return this.$_setFlag('truncate', enabled);
+            }
+        },
+
+        uppercase: {
+            method() {
+
+                return this.case('upper');
+            }
+        }
+    },
+
+    messages: {
+        'string.alphanum': '{{#label}} must only contain alpha-numeric characters',
+        'string.base': '{{#label}} must be a string',
+        'string.base64': '{{#label}} must be a valid base64 string',
+        'string.creditCard': '{{#label}} must be a credit card',
+        'string.dataUri': '{{#label}} must be a valid dataUri string',
+        'string.empty': '{{#label}} is not allowed to be empty',
+        'string.guid': '{{#label}} must be a valid GUID',
+        'string.hex': '{{#label}} must only contain hexadecimal characters',
+        'string.hexAlign': '{{#label}} hex decoded representation must be byte aligned',
+        'string.hostname': '{{#label}} must be a valid hostname',
+        'string.isoDate': '{{#label}} must be in iso format',
+        'string.isoDuration': '{{#label}} must be a valid ISO 8601 duration',
+        'string.length': '{{#label}} length must be {{#limit}} characters long',
+        'string.lowercase': '{{#label}} must only contain lowercase characters',
+        'string.max': '{{#label}} length must be less than or equal to {{#limit}} characters long',
+        'string.min': '{{#label}} length must be at least {{#limit}} characters long',
+        'string.normalize': '{{#label}} must be unicode normalized in the {{#form}} form',
+        'string.token': '{{#label}} must only contain alpha-numeric and underscore characters',
+        'string.pattern.base': '{{#label}} with value {:.} fails to match the required pattern: {{#regex}}',
+        'string.pattern.name': '{{#label}} with value {:.} fails to match the {{#name}} pattern',
+        'string.pattern.invert.base': '{{#label}} with value {:.} matches the inverted pattern: {{#regex}}',
+        'string.pattern.invert.name': '{{#label}} with value {:.} matches the inverted {{#name}} pattern',
+        'string.trim': '{{#label}} must not have leading or trailing whitespace',
+        'string.uppercase': '{{#label}} must only contain uppercase characters'
+    }
+});
+
+
+// Helpers
+
+internals.isoDate = function (value) {
+
+    if (!Common.isIsoDate(value)) {
+        return null;
+    }
+
+    const date = new Date(value);
+    if (isNaN(date.getTime())) {
+        return null;
+    }
+
+    return date.toISOString();
+};
+
+
+internals.length = function (schema, name, limit, operator, encoding) {
+
+    Assert(!encoding || Buffer.isEncoding(encoding), 'Invalid encoding:', encoding);
+
+    return schema.$_addRule({ name, method: 'length', args: { limit, encoding }, operator });
+};
+
+
+internals.rfc3986 = function () {
+
+    const rfc3986 = {};
+
+    const hexDigit = '\\dA-Fa-f';                                               // HEXDIG = DIGIT / "A" / "B" / "C" / "D" / "E" / "F"
+    const hexDigitOnly = '[' + hexDigit + ']';
+
+    const unreserved = '\\w-\\.~';                                              // unreserved = ALPHA / DIGIT / "-" / "." / "_" / "~"
+    const subDelims = '!\\$&\'\\(\\)\\*\\+,;=';                                 // sub-delims = "!" / "$" / "&" / "'" / "(" / ")" / "*" / "+" / "," / ";" / "="
+    const decOctect = '(?:0{0,2}\\d|0?[1-9]\\d|1\\d\\d|2[0-4]\\d|25[0-5])';     // dec-octet = DIGIT / %x31-39 DIGIT / "1" 2DIGIT / "2" %x30-34 DIGIT / "25" %x30-35  ; 0-9 / 10-99 / 100-199 / 200-249 / 250-255
+
+    rfc3986.ipv4 = '(?:' + decOctect + '\\.){3}' + decOctect;            // IPv4address = dec-octet "." dec-octet "." dec-octet "." dec-octet
+
+    /*
+        h16 = 1*4HEXDIG ; 16 bits of address represented in hexadecimal
+        ls32 = ( h16 ":" h16 ) / IPv4address ; least-significant 32 bits of address
+        IPv6address =                            6( h16 ":" ) ls32
+                    /                       "::" 5( h16 ":" ) ls32
+                    / [               h16 ] "::" 4( h16 ":" ) ls32
+                    / [ *1( h16 ":" ) h16 ] "::" 3( h16 ":" ) ls32
+                    / [ *2( h16 ":" ) h16 ] "::" 2( h16 ":" ) ls32
+                    / [ *3( h16 ":" ) h16 ] "::"    h16 ":"   ls32
+                    / [ *4( h16 ":" ) h16 ] "::"              ls32
+                    / [ *5( h16 ":" ) h16 ] "::"              h16
+                    / [ *6( h16 ":" ) h16 ] "::"
+    */
+
+    const h16 = hexDigitOnly + '{1,4}';
+    const ls32 = '(?:' + h16 + ':' + h16 + '|' + rfc3986.ipv4 + ')';
+    const IPv6SixHex = '(?:' + h16 + ':){6}' + ls32;
+    const IPv6FiveHex = '::(?:' + h16 + ':){5}' + ls32;
+    const IPv6FourHex = '(?:' + h16 + ')?::(?:' + h16 + ':){4}' + ls32;
+    const IPv6ThreeHex = '(?:(?:' + h16 + ':){0,1}' + h16 + ')?::(?:' + h16 + ':){3}' + ls32;
+    const IPv6TwoHex = '(?:(?:' + h16 + ':){0,2}' + h16 + ')?::(?:' + h16 + ':){2}' + ls32;
+    const IPv6OneHex = '(?:(?:' + h16 + ':){0,3}' + h16 + ')?::' + h16 + ':' + ls32;
+    const IPv6NoneHex = '(?:(?:' + h16 + ':){0,4}' + h16 + ')?::' + ls32;
+    const IPv6NoneHex2 = '(?:(?:' + h16 + ':){0,5}' + h16 + ')?::' + h16;
+    const IPv6NoneHex3 = '(?:(?:' + h16 + ':){0,6}' + h16 + ')?::';
+
+    rfc3986.v4Cidr = '(?:\\d|[1-2]\\d|3[0-2])';                                           // IPv4 cidr = DIGIT / %x31-32 DIGIT / "3" %x30-32  ; 0-9 / 10-29 / 30-32
+    rfc3986.v6Cidr = '(?:0{0,2}\\d|0?[1-9]\\d|1[01]\\d|12[0-8])';                         // IPv6 cidr = DIGIT / %x31-39 DIGIT / "1" %x0-1 DIGIT / "12" %x0-8;   0-9 / 10-99 / 100-119 / 120-128
+    rfc3986.ipv6 = '(?:' + IPv6SixHex + '|' + IPv6FiveHex + '|' + IPv6FourHex + '|' + IPv6ThreeHex + '|' + IPv6TwoHex + '|' + IPv6OneHex + '|' + IPv6NoneHex + '|' + IPv6NoneHex2 + '|' + IPv6NoneHex3 + ')';
+    rfc3986.ipvfuture = 'v' + hexDigitOnly + '+\\.[' + unreserved + subDelims + ':]+';      // IPvFuture = "v" 1*HEXDIG "." 1*( unreserved / sub-delims / ":" )
+    return rfc3986;
+};
+
+
+internals.ipRegex = (function () {
+
+    const versions = ['ipv4', 'ipv6', 'ipvfuture'];
+
+    // Regex
+
+    const rfc3986 = internals.rfc3986();
+    const parts = versions.map((version) => {
+
+        const cidrpart = `\\/${version === 'ipv4' ? rfc3986.v4Cidr : rfc3986.v6Cidr}`;
+
+        return `${rfc3986[version]}(?:${cidrpart})?`;
+    });
+
+    const raw = `(?:${parts.join('|')})`;
+    return new RegExp(`^${raw}$`);
+})();
+
+
+internals.isDomainValid = function (domain) {
+
+    if (domain.length > 256) {
+        return false;
+    }
+
+    domain = domain.normalize('NFC');
+
+    if (internals.domainControlRx.test(domain)) {
+        return false;
+    }
+
+    domain = internals.punycode(domain);
+
+    const segments = domain.split('.');
+
+    for (let i = 0; i < segments.length; ++i) {
+        const segment = segments[i];
+
+        if (!segment.length) {
+            return false;
+        }
+
+        if (segment.length > 63) {
+            return false;
+        }
+
+        // Here we're following RFC 1035 and 1123, plus 3696's clarification
+        // that the final segment may contain numbers but not be all-numeric.
+        // Docker containers, for example, are assigned hostnames which are hex
+        // strings (no dots) that may start with a numeric digit.
+
+        if (!internals.domainSegmentRx.test(segment)) {
+            return false;
+        }
+
+        const isFinalSegment = i === segments.length - 1;
+
+        if (isFinalSegment && !internals.finalSegmentAdditionalRx.test(segment)) {
+            return false;
+        }
+    }
+
+    return true;
+};
+
+
+internals.punycode = function (domain) {
+
+    try {
+        return new Url.URL(`http://${domain}`).host;
+    }
+    catch (err) {
+        return domain;
+    }
+};
diff --git a/node_modules/@hapi/validate/lib/types/symbol.js b/node_modules/@hapi/validate/lib/types/symbol.js
new file mode 100755
index 0000000..7cd1a88
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/types/symbol.js
@@ -0,0 +1,90 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+
+const Any = require('./any');
+
+
+const internals = {};
+
+
+internals.Map = class extends Map {
+
+    slice() {
+
+        return new internals.Map(this);
+    }
+};
+
+
+module.exports = Any._extend({
+
+    type: 'symbol',
+
+    terms: {
+
+        map: { init: new internals.Map() }
+    },
+
+    coerce: {
+        method(value, { schema, error }) {
+
+            const lookup = schema.$_terms.map.get(value);
+            if (lookup) {
+                value = lookup;
+            }
+
+            if (!schema._flags.only ||
+                typeof value === 'symbol') {
+
+                return { value };
+            }
+
+            return { value, errors: error('symbol.map', { map: schema.$_terms.map }) };
+        }
+    },
+
+    validate(value, { error }) {
+
+        if (typeof value !== 'symbol') {
+            return { value, errors: error('symbol.base') };
+        }
+    },
+
+    rules: {
+        map: {
+            method(iterable) {
+
+                if (iterable &&
+                    !iterable[Symbol.iterator] &&
+                    typeof iterable === 'object') {
+
+                    iterable = Object.entries(iterable);
+                }
+
+                Assert(iterable && iterable[Symbol.iterator], 'Iterable must be an iterable or object');
+
+                const obj = this.clone();
+
+                const symbols = [];
+                for (const entry of iterable) {
+                    Assert(entry && entry[Symbol.iterator], 'Entry must be an iterable');
+                    const [key, value] = entry;
+
+                    Assert(typeof key !== 'object' && typeof key !== 'function' && typeof key !== 'symbol', 'Key must not be of type object, function, or Symbol');
+                    Assert(typeof value === 'symbol', 'Value must be a Symbol');
+
+                    obj.$_terms.map.set(key, value);
+                    symbols.push(value);
+                }
+
+                return obj.valid(...symbols);
+            }
+        }
+    },
+
+    messages: {
+        'symbol.base': '{{#label}} must be a symbol',
+        'symbol.map': '{{#label}} must be one of {{#map}}'
+    }
+});
diff --git a/node_modules/@hapi/validate/lib/validator.js b/node_modules/@hapi/validate/lib/validator.js
new file mode 100755
index 0000000..13de5d7
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/validator.js
@@ -0,0 +1,422 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const Clone = require('@hapi/hoek/clone');
+
+const Common = require('./common');
+const Errors = require('./errors');
+const State = require('./state');
+
+
+const internals = {
+    result: Symbol('result')
+};
+
+
+exports.entry = function (value, schema, prefs) {
+
+    let settings = Common.defaults;
+    if (prefs) {
+        settings = Common.preferences(Common.defaults, prefs);
+    }
+
+    const result = internals.entry(value, schema, settings);
+    const outcome = { value: result.value };
+
+    if (result.error) {
+        outcome.error = result.error;
+    }
+
+    return outcome;
+};
+
+
+internals.entry = function (value, schema, prefs) {
+
+    // Prepare state
+
+    const links = schema._ids._schemaChain ? new Map() : null;
+    const mainstay = { links };
+    const schemas = schema._ids._schemaChain ? [{ schema }] : null;
+    const state = new State([], [], { mainstay, schemas });
+
+    // Validate value
+
+    const result = exports.validate(value, schema, state, prefs);
+
+    // Process value and errors
+
+    const error = Errors.process(result.errors, value, prefs);
+    return { value: result.value, error, mainstay };
+};
+
+
+exports.validate = function (value, schema, state, prefs, overrides = {}) {
+
+    if (schema.$_terms.whens) {
+        schema = schema._generate(value, state, prefs).schema;
+    }
+
+    // Setup state and settings
+
+    if (schema._preferences) {
+        prefs = internals.prefs(schema, prefs);
+    }
+
+    // Helpers
+
+    const createError = (code, local, localState) => schema.$_createError(code, value, local, localState || state, prefs);
+    const helpers = {
+        original: value,
+        prefs,
+        schema,
+        state,
+        error: createError,
+        errorsArray: internals.errorsArray,
+        message: (messages, local) => schema.$_createError('custom', value, local, state, prefs, { messages })
+    };
+
+    // Type coercion
+
+    const def = schema._definition;
+    if (def.coerce &&
+        value !== undefined &&
+        prefs.convert &&
+        (!def.coerce.from || def.coerce.from.includes(typeof value))) {
+
+        const coerced = def.coerce.method(value, helpers);
+        if (coerced) {
+            if (coerced.errors) {
+                return internals.finalize(coerced.value, [].concat(coerced.errors), helpers);           // Coerce error always aborts early
+            }
+
+            value = coerced.value;
+        }
+    }
+
+    // Empty value
+
+    const empty = schema._flags.empty;
+    if (empty &&
+        empty.$_match(internals.trim(value, schema), state.nest(empty), Common.defaults)) {
+
+        value = undefined;
+    }
+
+    // Presence requirements (required, optional, forbidden)
+
+    const presence = overrides.presence || schema._flags.presence || (schema._flags._endedSwitch ? null : prefs.presence);
+    if (value === undefined) {
+        if (presence === 'forbidden') {
+            return internals.finalize(value, null, helpers);
+        }
+
+        if (presence === 'required') {
+            return internals.finalize(value, [schema.$_createError('any.required', value, null, state, prefs)], helpers);
+        }
+
+        if (presence === 'optional') {
+            if (schema._flags.default !== Common.symbols.deepDefault) {
+                return internals.finalize(value, null, helpers);
+            }
+
+            value = {};
+        }
+    }
+    else if (presence === 'forbidden') {
+        return internals.finalize(value, [schema.$_createError('any.unknown', value, null, state, prefs)], helpers);
+    }
+
+    // Allowed values
+
+    const errors = [];
+
+    if (schema._valids) {
+        const match = schema._valids.get(value, state, prefs, schema._flags.insensitive);
+        if (match) {
+            if (prefs.convert) {
+                value = match.value;
+            }
+
+            return internals.finalize(value, null, helpers);
+        }
+
+        if (schema._flags.only) {
+            const report = schema.$_createError('any.only', value, { valids: schema._valids.values({ display: true }) }, state, prefs);
+            if (prefs.abortEarly) {
+                return internals.finalize(value, [report], helpers);
+            }
+
+            errors.push(report);
+        }
+    }
+
+    // Denied values
+
+    if (schema._invalids) {
+        const match = schema._invalids.get(value, state, prefs, schema._flags.insensitive);
+        if (match) {
+            const report = schema.$_createError('any.invalid', value, { invalids: schema._invalids.values({ display: true }) }, state, prefs);
+            if (prefs.abortEarly) {
+                return internals.finalize(value, [report], helpers);
+            }
+
+            errors.push(report);
+        }
+    }
+
+    // Base type
+
+    if (def.validate) {
+        const base = def.validate(value, helpers);
+        if (base) {
+            value = base.value;
+
+            if (base.errors) {
+                if (!Array.isArray(base.errors)) {
+                    errors.push(base.errors);
+                    return internals.finalize(value, errors, helpers);          // Base error always aborts early
+                }
+
+                if (base.errors.length) {
+                    errors.push(...base.errors);
+                    return internals.finalize(value, errors, helpers);          // Base error always aborts early
+                }
+            }
+        }
+    }
+
+    // Validate tests
+
+    if (!schema._rules.length) {
+        return internals.finalize(value, errors, helpers);
+    }
+
+    return internals.rules(value, errors, helpers);
+};
+
+
+internals.rules = function (value, errors, helpers) {
+
+    const { schema, state, prefs } = helpers;
+
+    for (const rule of schema._rules) {
+        const definition = schema._definition.rules[rule.method];
+
+        // Skip rules that are also applied in coerce step
+
+        if (definition.convert &&
+            prefs.convert) {
+
+            continue;
+        }
+
+        // Resolve references
+
+        let ret;
+        let args = rule.args;
+        if (rule._resolve.length) {
+            args = Object.assign({}, args);                                     // Shallow copy
+            for (const key of rule._resolve) {
+                const resolver = definition.argsByName.get(key);
+
+                const resolved = args[key].resolve(value, state, prefs);
+                const normalized = resolver.normalize ? resolver.normalize(resolved) : resolved;
+
+                const invalid = Common.validateArg(normalized, null, resolver);
+                if (invalid) {
+                    ret = schema.$_createError('any.ref', resolved, { arg: key, ref: args[key], reason: invalid }, state, prefs);
+                    break;
+                }
+
+                args[key] = normalized;
+            }
+        }
+
+        // Test rule
+
+        ret = ret || definition.validate(value, helpers, args, rule);           // Use ret if already set to reference error
+
+        const result = internals.rule(ret, rule);
+        if (result.errors) {
+            if (prefs.abortEarly) {
+                return internals.finalize(value, result.errors, helpers);
+            }
+
+            errors.push(...result.errors);
+        }
+        else {
+            value = result.value;
+        }
+    }
+
+    return internals.finalize(value, errors, helpers);
+};
+
+
+internals.rule = function (ret, rule) {
+
+    if (ret instanceof Errors.Report) {
+        return { errors: [ret], value: null };
+    }
+
+    if (Array.isArray(ret) &&
+        ret[Common.symbols.errors]) {
+
+        return { errors: ret, value: null };
+    }
+
+    return { errors: null, value: ret };
+};
+
+
+internals.finalize = function (value, errors, helpers) {
+
+    errors = errors || [];
+    const { schema, state } = helpers;
+
+    // Failover value
+
+    if (errors.length) {
+        const failover = internals.default('failover', undefined, errors, helpers);
+        if (failover !== undefined) {
+            value = failover;
+            errors = [];
+        }
+    }
+
+    // Error override
+
+    if (errors.length &&
+        schema._flags.error) {
+
+        if (typeof schema._flags.error === 'function') {
+            errors = schema._flags.error(errors);
+            if (!Array.isArray(errors)) {
+                errors = [errors];
+            }
+
+            for (const error of errors) {
+                Assert(error instanceof Error || error instanceof Errors.Report, 'error() must return an Error object');
+            }
+        }
+        else {
+            errors = [schema._flags.error];
+        }
+    }
+
+    // Default
+
+    if (value === undefined) {
+        const defaulted = internals.default('default', value, errors, helpers);
+        value = defaulted;
+    }
+
+    // Cast
+
+    if (schema._flags.cast &&
+        value !== undefined) {
+
+        const caster = schema._definition.cast[schema._flags.cast];
+        if (caster.from(value)) {
+            const casted = caster.to(value, helpers);
+            value = casted;
+        }
+    }
+
+    // Result
+
+    const result = { value, errors: errors.length ? errors : null };
+
+    if (schema._flags.result) {
+        result.value = schema._flags.result === 'strip' ? undefined : /* raw */ helpers.original;
+        state.shadow(value, schema._flags.result);
+    }
+
+    return result;
+};
+
+
+internals.prefs = function (schema, prefs) {
+
+    const isDefaultOptions = prefs === Common.defaults;
+    if (isDefaultOptions &&
+        schema._preferences[Common.symbols.prefs]) {
+
+        return schema._preferences[Common.symbols.prefs];
+    }
+
+    prefs = Common.preferences(prefs, schema._preferences);
+    if (isDefaultOptions) {
+        schema._preferences[Common.symbols.prefs] = prefs;
+    }
+
+    return prefs;
+};
+
+
+internals.default = function (flag, value, errors, helpers) {
+
+    const { schema, state, prefs } = helpers;
+    const source = schema._flags[flag];
+    if (prefs.noDefaults ||
+        source === undefined) {
+
+        return value;
+    }
+
+    if (!source) {
+        return source;
+    }
+
+    if (typeof source === 'function') {
+        const args = source.length ? [Clone(state.ancestors[0]), helpers] : [];
+
+        try {
+            return source(...args);
+        }
+        catch (err) {
+            errors.push(schema.$_createError(`any.${flag}`, null, { error: err }, state, prefs));
+            return;
+        }
+    }
+
+    if (typeof source !== 'object') {
+        return source;
+    }
+
+    if (source[Common.symbols.literal]) {
+        return source.literal;
+    }
+
+    if (Common.isResolvable(source)) {
+        return source.resolve(value, state, prefs);
+    }
+
+    return Clone(source);
+};
+
+
+internals.trim = function (value, schema) {
+
+    if (typeof value !== 'string') {
+        return value;
+    }
+
+    const trim = schema.$_getRule('trim');
+    if (!trim ||
+        !trim.args.enabled) {
+
+        return value;
+    }
+
+    return value.trim();
+};
+
+
+internals.errorsArray = function () {
+
+    const errors = [];
+    errors[Common.symbols.errors] = true;
+    return errors;
+};
diff --git a/node_modules/@hapi/validate/lib/values.js b/node_modules/@hapi/validate/lib/values.js
new file mode 100755
index 0000000..a8f4a31
--- /dev/null
+++ b/node_modules/@hapi/validate/lib/values.js
@@ -0,0 +1,244 @@
+'use strict';
+
+const Assert = require('@hapi/hoek/assert');
+const DeepEqual = require('@hapi/hoek/deepEqual');
+
+const Common = require('./common');
+
+
+const internals = {};
+
+
+module.exports = internals.Values = class {
+
+    constructor(values, refs) {
+
+        this._values = new Set(values);
+        this._refs = new Set(refs);
+        this._lowercase = internals.lowercases(values);
+
+        this._override = false;
+    }
+
+    get length() {
+
+        return this._values.size + this._refs.size;
+    }
+
+    add(value, refs) {
+
+        // Reference
+
+        if (Common.isResolvable(value)) {
+            if (!this._refs.has(value)) {
+                this._refs.add(value);
+
+                if (refs) {                     // Skipped in a merge
+                    refs.register(value);
+                }
+            }
+
+            return;
+        }
+
+        // Value
+
+        if (!this.has(value, null, null, false)) {
+            this._values.add(value);
+
+            if (typeof value === 'string') {
+                this._lowercase.set(value.toLowerCase(), value);
+            }
+        }
+    }
+
+    static merge(target, source, remove) {
+
+        target = target || new internals.Values();
+
+        if (source) {
+            if (source._override) {
+                return source.clone();
+            }
+
+            for (const item of [...source._values, ...source._refs]) {
+                target.add(item);
+            }
+        }
+
+        if (remove) {
+            for (const item of [...remove._values, ...remove._refs]) {
+                target.remove(item);
+            }
+        }
+
+        return target.length ? target : null;
+    }
+
+    remove(value) {
+
+        // Reference
+
+        if (Common.isResolvable(value)) {
+            this._refs.delete(value);
+            return;
+        }
+
+        // Value
+
+        this._values.delete(value);
+
+        if (typeof value === 'string') {
+            this._lowercase.delete(value.toLowerCase());
+        }
+    }
+
+    has(value, state, prefs, insensitive) {
+
+        return !!this.get(value, state, prefs, insensitive);
+    }
+
+    get(value, state, prefs, insensitive) {
+
+        if (!this.length) {
+            return false;
+        }
+
+        // Simple match
+
+        if (this._values.has(value)) {
+            return { value };
+        }
+
+        // Case insensitive string match
+
+        if (typeof value === 'string' &&
+            value &&
+            insensitive) {
+
+            const found = this._lowercase.get(value.toLowerCase());
+            if (found) {
+                return { value: found };
+            }
+        }
+
+        if (!this._refs.size &&
+            typeof value !== 'object') {
+
+            return false;
+        }
+
+        // Objects
+
+        if (typeof value === 'object') {
+            for (const item of this._values) {
+                if (DeepEqual(item, value)) {
+                    return { value: item };
+                }
+            }
+        }
+
+        // References
+
+        if (state) {
+            for (const ref of this._refs) {
+                const resolved = ref.resolve(value, state, prefs, null, { in: true });
+                if (resolved === undefined) {
+                    continue;
+                }
+
+                const items = !ref.in || typeof resolved !== 'object'
+                    ? [resolved]
+                    : Array.isArray(resolved) ? resolved : Object.keys(resolved);
+
+                for (const item of items) {
+                    if (typeof item !== typeof value) {
+                        continue;
+                    }
+
+                    if (insensitive &&
+                        value &&
+                        typeof value === 'string') {
+
+                        if (item.toLowerCase() === value.toLowerCase()) {
+                            return { value: item, ref };
+                        }
+                    }
+                    else {
+                        if (DeepEqual(item, value)) {
+                            return { value: item, ref };
+                        }
+                    }
+                }
+            }
+        }
+
+        return false;
+    }
+
+    override() {
+
+        this._override = true;
+    }
+
+    values(options) {
+
+        if (options &&
+            options.display) {
+
+            const values = [];
+
+            for (const item of [...this._values, ...this._refs]) {
+                if (item !== undefined) {
+                    values.push(item);
+                }
+            }
+
+            return values;
+        }
+
+        return Array.from([...this._values, ...this._refs]);
+    }
+
+    clone() {
+
+        const set = new internals.Values(this._values, this._refs);
+        set._override = this._override;
+        return set;
+    }
+
+    concat(source) {
+
+        Assert(!source._override, 'Cannot concat override set of values');
+
+        const set = new internals.Values([...this._values, ...source._values], [...this._refs, ...source._refs]);
+        set._override = this._override;
+        return set;
+    }
+};
+
+
+internals.Values.prototype[Common.symbols.values] = true;
+
+
+// Aliases
+
+internals.Values.prototype.slice = internals.Values.prototype.clone;
+
+
+// Helpers
+
+internals.lowercases = function (from) {
+
+    const map = new Map();
+
+    if (from) {
+        for (const value of from) {
+            if (typeof value === 'string') {
+                map.set(value.toLowerCase(), value);
+            }
+        }
+    }
+
+    return map;
+};
diff --git a/node_modules/@hapi/validate/package.json b/node_modules/@hapi/validate/package.json
new file mode 100755
index 0000000..fe1f73c
--- /dev/null
+++ b/node_modules/@hapi/validate/package.json
@@ -0,0 +1,30 @@
+{
+  "name": "@hapi/validate",
+  "description": "Object schema validation",
+  "version": "2.0.1",
+  "repository": "git://github.com/hapijs/validate",
+  "main": "lib/index.js",
+  "files": [
+    "lib/**/*"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2",
+    "@hapi/topo": "^6.0.1"
+  },
+  "devDependencies": {
+    "@hapi/bourne": "^3.0.0",
+    "@hapi/code": "^9.0.3",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.1.2"
+  },
+  "scripts": {
+    "test": "lab -t 100 -a @hapi/code -L",
+    "test-cov-html": "lab -r html -o coverage.html -a @hapi/code"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/vise/LICENSE.md b/node_modules/@hapi/vise/LICENSE.md
new file mode 100755
index 0000000..02f7bbd
--- /dev/null
+++ b/node_modules/@hapi/vise/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2014-2022, Project contributors
+Copyright (c) 2014-2020, Sideway Inc
+Copyright (c) 2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/vise/README.md b/node_modules/@hapi/vise/README.md
new file mode 100644
index 0000000..d9b5997
--- /dev/null
+++ b/node_modules/@hapi/vise/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/vise
+
+#### Treat multiple buffers as one.
+
+**vise** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/vise/)
+- [Version status](https://hapi.dev/resources/status/#vise) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/vise/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/vise/lib/index.js b/node_modules/@hapi/vise/lib/index.js
new file mode 100755
index 0000000..dd177b5
--- /dev/null
+++ b/node_modules/@hapi/vise/lib/index.js
@@ -0,0 +1,169 @@
+'use strict';
+
+const Hoek = require('@hapi/hoek');
+
+
+const internals = {};
+
+
+exports.Vise = class Vise {
+
+    constructor(chunks) {
+
+        this.length = 0;
+        this._chunks = [];
+        this._offset = 0;
+
+        if (chunks) {
+            chunks = [].concat(chunks);
+            for (let i = 0; i < chunks.length; ++i) {
+                this.push(chunks[i]);
+            }
+        }
+    }
+
+    push(chunk) {
+
+        Hoek.assert(Buffer.isBuffer(chunk), 'Chunk must be a buffer');
+
+        const item = {
+            data: chunk,
+            length: chunk.length,
+            offset: this.length + this._offset,
+            index: this._chunks.length
+        };
+
+        this._chunks.push(item);
+        this.length += chunk.length;
+    }
+
+    shift(length) {
+
+        if (!length) {
+            return [];
+        }
+
+        const prevOffset = this._offset;
+        const item = this.#chunkAt(length);
+
+        let dropTo = this._chunks.length;
+        this._offset = 0;
+
+        if (item) {
+            dropTo = item.chunk.index;
+            this._offset = item.offset;
+        }
+
+        // Drop lower chunks
+
+        const chunks = [];
+        for (let i = 0; i < dropTo; ++i) {
+            const chunk = this._chunks.shift();
+            if (i === 0 &&
+                prevOffset) {
+
+                chunks.push(chunk.data.slice(prevOffset));
+            }
+            else {
+                chunks.push(chunk.data);
+            }
+        }
+
+        if (this._offset) {
+            chunks.push(item.chunk.data.slice(dropTo ? 0 : prevOffset, this._offset));
+        }
+
+        // Recalculate existing chunks
+
+        this.length = 0;
+        for (let i = 0; i < this._chunks.length; ++i) {
+            const chunk = this._chunks[i];
+            chunk.offset = this.length,
+            chunk.index = i;
+
+            this.length += chunk.length;
+        }
+
+        this.length -= this._offset;
+
+        return chunks;
+    }
+
+    readUInt8(pos) {
+
+        const item = this.#chunkAt(pos);
+        return item ? item.chunk.data[item.offset] : undefined;
+    }
+
+    at(pos) {
+
+        return this.readUInt8(pos);
+    }
+
+    #chunkAt(pos) {
+
+        if (pos < 0) {
+            return null;
+        }
+
+        pos = pos + this._offset;
+
+        for (let i = 0; i < this._chunks.length; ++i) {
+            const chunk = this._chunks[i];
+            const offset = pos - chunk.offset;
+            if (offset < chunk.length) {
+                return { chunk, offset };
+            }
+        }
+
+        return null;
+    }
+
+    chunks() {
+
+        const chunks = [];
+
+        for (let i = 0; i < this._chunks.length; ++i) {
+            const chunk = this._chunks[i];
+            if (i === 0 &&
+                this._offset) {
+
+                chunks.push(chunk.data.slice(this._offset));
+            }
+            else {
+                chunks.push(chunk.data);
+            }
+        }
+
+        return chunks;
+    }
+
+    startsWith(value, pos, length) {
+
+        pos = pos ?? 0;
+
+        length = length ? Math.min(value.length, length) : value.length;
+        if (pos + length > this.length) {                                   // Not enough length to fit value
+            return false;
+        }
+
+        const start = this.#chunkAt(pos);
+        if (!start) {
+            return false;
+        }
+
+        let j = start.chunk.index;
+        for (let i = 0; j < this._chunks.length && i < length; ++j) {
+            const chunk = this._chunks[j];
+
+            let k = (j === start.chunk.index ? start.offset : 0);
+            for (; k < chunk.length && i < length; ++k, ++i) {
+                if (chunk.data[k] !== value[i]) {
+                    return false;
+                }
+            }
+        }
+
+        return true;
+    }
+};
diff --git a/node_modules/@hapi/vise/package.json b/node_modules/@hapi/vise/package.json
new file mode 100755
index 0000000..a06dd13
--- /dev/null
+++ b/node_modules/@hapi/vise/package.json
@@ -0,0 +1,34 @@
+{
+  "name": "@hapi/vise",
+  "description": "Treat multiple buffers as one",
+  "version": "5.0.1",
+  "repository": "git://github.com/hapijs/vise",
+  "main": "lib/index.js",
+  "files": [
+    "lib"
+  ],
+  "keywords": [
+    "buffer",
+    "array",
+    "merge",
+    "combine"
+  ],
+  "eslintConfig": {
+    "extends": [
+      "plugin:@hapi/module"
+    ]
+  },
+  "dependencies": {
+    "@hapi/hoek": "^11.0.2"
+  },
+  "devDependencies": {
+    "@hapi/code": "^9.0.0",
+    "@hapi/eslint-plugin": "*",
+    "@hapi/lab": "^25.0.1"
+  },
+  "scripts": {
+    "test": "lab -a @hapi/code -t 100 -L",
+    "test-cov-html": "lab -a @hapi/code -r html -o coverage.html"
+  },
+  "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@hapi/wreck/LICENSE.md b/node_modules/@hapi/wreck/LICENSE.md
new file mode 100755
index 0000000..675e12f
--- /dev/null
+++ b/node_modules/@hapi/wreck/LICENSE.md
@@ -0,0 +1,11 @@
+Copyright (c) 2012-2022, Project contributors
+Copyright (c) 2012-2020, Sideway Inc
+Copyright (c) 2012-2014, Walmart.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+* The names of any contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS OFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/@hapi/wreck/README.md b/node_modules/@hapi/wreck/README.md
new file mode 100755
index 0000000..b668155
--- /dev/null
+++ b/node_modules/@hapi/wreck/README.md
@@ -0,0 +1,17 @@
+<a href="https://hapi.dev"><img src="https://raw.githubusercontent.com/hapijs/assets/master/images/family.png" width="180px" align="right" /></a>
+
+# @hapi/wreck
+
+#### HTTP client utilities.
+
+**wreck** is part of the **hapi** ecosystem and was designed to work seamlessly with the [hapi web framework](https://hapi.dev) and its other components (but works great on its own or with other frameworks). If you are using a different web framework and find this module useful, check out [hapi](https://hapi.dev) – they work even better together.
+
+### Visit the [hapi.dev](https://hapi.dev) Developer Portal for tutorials, documentation, and support
+
+## Useful resources
+
+- [Documentation and API](https://hapi.dev/family/wreck/)
+- [Versions status](https://hapi.dev/resources/status/#wreck) (builds, dependencies, node versions, licenses, eol)
+- [Changelog](https://hapi.dev/family/wreck/changelog/)
+- [Project policies](https://hapi.dev/policies/)
+- [Free and commercial support options](https://hapi.dev/support/)
diff --git a/node_modules/@hapi/wreck/lib/index.d.ts b/node_modules/@hapi/wreck/lib/index.d.ts
new file mode 100755
index 0000000..7f808be
--- /dev/null
+++ b/node_modules/@hapi/wreck/lib/index.d.ts
@@ -0,0 +1,366 @@
+/// <reference types="node" />
+
+import { EventEmitter } from 'events';
+import * as Http from 'http';
+import * as Https from 'https';
+import * as Stream from 'stream';
+import * as Url from 'url';
+import { LookupFunction } from "node:net"
+
+import { Boom } from '@hapi/boom';
+
+
+/**
+ * An HTTP request client.
+ */
+declare class Client {
+
+    /**
+     * An object containing the node agents used for pooling connections for `http` and `https`.
+     */
+    agents: Client.Agents;
+
+    /**
+     * An event emitter used to deliver events when the `events` option is set.
+     */
+    events?: Client.Events;
+
+    /**
+     * Creates a new client.
+     * 
+     * @param options - the client default options.
+     */
+    constructor(options?: Client.Options);
+
+    /**
+     * Creates a new client using the current client options as defaults and the provided options as override.
+     * 
+     * @param options - the client override options.
+     * 
+     * @returns a new client.
+     */
+    defaults(options: Client.Options): Client;
+
+    /**
+     * Request an HTTP resource.
+     * 
+     * @param method - a string specifying the HTTP request method. Defaults to 'GET'.
+     * @param url - the URI of the requested resource.
+     * @param options - default options override.
+     * 
+     * @returns a promise resolving into an HTTP response object with a 'req' property holding a reference to the HTTP request object.
+     */
+    request(method: string, url: string, options?: Client.request.Options): Promise<Http.IncomingMessage> & { req: Http.ClientRequest };
+
+    /**
+     * Reads a readable stream and returns the parsed payload.
+     * 
+     * @param res - the readable stream.
+     * @param options - default options override.
+     * 
+     * @returns the parsed payload based on the provided options.
+     */
+    read<T = Buffer>(res: Stream.Readable | Http.IncomingMessage, options?: Client.read.Options): Promise<T>;
+
+    /**
+     * Converts a buffer, string, or an array of them into a readable stream.
+     * 
+     * @param payload - a string, buffer, or an array of them.
+     * @param encoding - the payload encoding.
+     * 
+     * @returns a readable stream.
+     */
+    toReadableStream(payload: Client.toReadableStream.Payload, encoding?: string): Stream.Readable;
+
+    /**
+     * Parses the HTTP Cache-Control header.
+     * 
+     * @param field - the header content.
+     * 
+     * @returns an object with the header parameters or null if invalid.
+     */
+    parseCacheControl(field: string): Client.parseCacheControl.Parameters | null;
+
+    /**
+     * Performs an HTTP GET request.
+     * 
+     * @param uri - the resource URI.
+     * @param options - default options override.
+     * 
+     * @returns the received payload Buffer or parsed payload based on the options.
+     */
+    get<T>(uri: string, options?: Client.request.Options & Client.read.Options): Promise<Client.request.Response<T>>;
+
+    /**
+     * Performs an HTTP POST request.
+     *
+     * @param uri - the resource URI.
+     * @param options - default options override.
+     *
+     * @returns the received payload Buffer or parsed payload based on the options.
+     */
+    post<T>(uri: string, options?: Client.request.Options & Client.read.Options): Promise<Client.request.Response<T>>;
+
+    /**
+     * Performs an HTTP PATCH request.
+     *
+     * @param uri - the resource URI.
+     * @param options - default options override.
+     *
+     * @returns the received payload Buffer or parsed payload based on the options.
+     */
+    patch<T>(uri: string, options?: Client.request.Options & Client.read.Options): Promise<Client.request.Response<T>>;
+
+    /**
+     * Performs an HTTP PUT request.
+     *
+     * @param uri - the resource URI.
+     * @param options - default options override.
+     *
+     * @returns the received payload Buffer or parsed payload based on the options.
+     */
+    put<T>(uri: string, options?: Client.request.Options & Client.read.Options): Promise<Client.request.Response<T>>;
+
+    /**
+     * Performs an HTTP DELETE request.
+     *
+     * @param uri - the resource URI.
+     * @param options - default options override.
+     *
+     * @returns the received payload Buffer or parsed payload based on the options.
+     */
+    delete<T>(uri: string, options?: Client.request.Options & Client.read.Options): Promise<Client.request.Response<T>>;
+}
+
+
+declare namespace Client {
+
+    interface Options extends request.Options, read.Options {
+
+        /**
+         * An object containing the node agents used for pooling connections for `http` and `https`.
+         */
+        readonly agents?: Agents;
+
+        /**
+         * Enables events.
+         * 
+         * @default false
+         */
+        readonly events?: boolean;
+    }
+
+    interface Agents {
+
+        /**
+         * The agent used for HTTP requests.
+         */
+        readonly http: Http.Agent;
+
+        /**
+         * The agent used for HTTPS requests.
+         */
+        readonly https: Https.Agent;
+
+        /**
+         * The agent used for HTTPS requests which ignores unauthorized requests.
+         */
+        readonly httpsAllowUnauthorized: Https.Agent;
+    }
+
+    class Events extends EventEmitter {
+
+        on(event: 'preRequest', litener: Events.preRequest): this;
+        once(event: 'preRequest', litener: Events.preRequest): this;
+        addListener(event: 'preRequest', litener: Events.preRequest): this;
+
+        on(event: 'request', listener: Events.request): this;
+        once(event: 'request', listener: Events.request): this;
+        addListener(event: 'request', listener: Events.request): this;
+
+        on(event: 'response', listener: Events.response): this;
+        once(event: 'response', listener: Events.response): this;
+        addListener(event: 'response', listener: Events.response): this;
+    }
+
+    namespace Events {
+
+        type preRequest = (uri: string, options: Client.Options) => void;
+        type request = (req: Http.ClientRequest) => void;
+        type response = (err: Boom | undefined, details: { req: Http.ClientRequest, res: Http.IncomingMessage | undefined, start: number, url: Url.URL }) => void;
+    }
+
+    namespace request {
+
+        interface Options {
+
+            /**
+             * Node HTTP or HTTPS Agent object (false disables agent pooling).
+             */
+            readonly agent?: Http.Agent | Https.Agent | false;
+
+            /**
+             * Custom lookup function. Default: dns.lookup().
+             */
+            readonly lookup?: LookupFunction;
+
+            /**
+             * IP address family to use when resolving host or hostname. Valid values are 4 or 6. When unspecified, both IP v4 and v6 will be used.
+             */
+            readonly family?: number;
+
+            /**
+             * Optional dns.lookup() hints.
+             */
+            readonly hints?: number;
+
+            /**
+             * Fully qualified URL string used as the base URL.
+             */
+            readonly baseUrl?: string;
+
+            /**
+             * A function to call before a redirect is triggered.
+             * 
+             * @param redirectMethod - a string specifying the redirect method.
+             * @param statusCode - HTTP status code of the response that triggered the redirect.
+             * @param location - The redirect location string.
+             * @param resHeaders - An object with the headers received as part of the redirection response.
+             * @param redirectOptions - Options that will be applied to the redirect request. Changes to this object are applied to the redirection request.
+             * @param next - the callback function called to perform the redirection.
+             */
+            readonly beforeRedirect?: (redirectMethod: string, statusCode: number, location: string, resHeaders: Record<string, string>, redirectOptions: Client.request.Options, next: () => void) => void;
+
+            /**
+             * TLS list of TLS ciphers to override node's default.
+             */
+            readonly ciphers?: string;
+
+            /**
+             * An object containing the request headers.
+             */
+            readonly headers?: Record<string, string>;
+
+            /**
+             * Determines how to handle gzipped payloads.
+             * 
+             * @default false
+             */
+            readonly gunzip?: boolean | 'force';
+
+            /**
+             * The request body as a string, Buffer, readable stream, or an object that can be serialized using `JSON.stringify()`.
+             */
+            readonly payload?: Payload;
+
+            /**
+             * Enables redirects on 303 responses (using GET).
+             * 
+             * @default false
+             */
+            readonly redirect303?: boolean;
+
+            /**
+             * Overrides the HTTP method used when following 301 and 302 redirections. Defaults to the original method.
+             */
+            readonly redirectMethod?: string;
+
+            /**
+             * The maximum number of redirects to follow.
+             * 
+             * @default false
+             */
+            readonly redirects?: number | false;
+
+            /**
+             * A function to call when a redirect was triggered.
+             * 
+             * @param statusCode - HTTP status code of the response that triggered the redirect.
+             * @param location - the redirected location string.
+             * @param req - the new ClientRequest object which replaces the one initially returned.
+             */
+            readonly redirected?: (statusCode: number, location: string, req: Http.ClientRequest) => void;
+
+            /**
+             * TLS flag indicating whether the client should reject a response from a server with invalid certificates.
+             */
+            readonly rejectUnauthorized?: boolean;
+
+            /**
+             * TLS flag indicating the SSL method to use, e.g. `SSLv3_method` to force SSL version 3.
+             */
+            readonly secureProtocol?: string;
+
+            /**
+             * A UNIX socket path string for direct server connection.
+             */
+            readonly socketPath?: string;
+
+            /**
+             * Number of milliseconds to wait without receiving a response before aborting the request.
+             * 
+             * @default 0
+             */
+            readonly timeout?: number;
+        }
+
+        type Payload = string | Buffer | Stream.Readable | object;
+
+        interface Response<T = Buffer> {
+
+            res: Http.IncomingMessage;
+            payload: T;
+        }
+    }
+
+    namespace read {
+
+        interface Options {
+
+            /**
+            * Determines how to handle gzipped payloads.
+            *
+            * @default false
+            */
+            readonly gunzip?: boolean | 'force';
+
+            /**
+             * Determines how to parse the payload as JSON.
+             */
+            readonly json?: boolean | 'strict' | 'force';
+
+            /**
+             * The maximum allowed response payload size.
+             * 
+             * @default 0
+             */
+            readonly maxBytes?: number;
+
+            /**
+             * The number of milliseconds to wait while reading data before aborting handling of the response.
+             * 
+             * @default 0
+             */
+            readonly timeout?: number;
+        }
+    }
+
+    namespace toReadableStream {
+
+        type Item = string | Buffer;
+        type Payload = Item | Item[];
+    }
+
+    namespace parseCacheControl {
+
+        interface Parameters {
+
+            'max-age'?: number;
+            [key: string]: string | number | undefined;
+        }
+    }
+}
+
+
+declare const client: Client;
+export = client;
diff --git a/node_modules/@hapi/wreck/lib/index.js b/node_modules/@hapi/wreck/lib/index.js
new file mode 100755
index 0000000..369d951
--- /dev/null
+++ b/node_modules/@hapi/wreck/lib/index.js
@@ -0,0 +1,688 @@
+'use strict';
+
+const Events = require('events');
+const Http = require('http');
+const Https = require('https');
+const Stream = require('stream');
+const Url = require('url');
+const Zlib = require('zlib');
+
+const Boom = require('@hapi/boom');
+const Bourne = require('@hapi/bourne');
+const Hoek = require('@hapi/hoek');
+
+const Payload = require('./payload');
+const Recorder = require('./recorder');
+const Tap = require('./tap');
+
+
+const internals = {
+    jsonRegex: /^application\/([a-z0-9.]*[+-]json|json)$/,
+    shallowOptions: ['agent', 'agents', 'beforeRedirect', 'payload', 'redirected'],
+    httpOptions: ['secureProtocol', 'ciphers', 'lookup', 'family', 'hints'],
+    sensitiveCrossHostHeaders: new Set(['authorization', 'cookie', 'proxy-authorization'])
+};
+
+
+// New instance is exported as module.exports
+
+internals.Client = class {
+
+    constructor(options = {}) {
+
+        Hoek.assert(!options.agents || options.agents.https && options.agents.http && options.agents.httpsAllowUnauthorized, 'Option agents must include "http", "https", and "httpsAllowUnauthorized"');
+
+        this._defaults = Hoek.clone(options, { shallow: internals.shallowOptions });
+
+        this.agents = this._defaults.agents || {
+            https: new Https.Agent({ maxSockets: Infinity }),
+            http: new Http.Agent({ maxSockets: Infinity }),
+            httpsAllowUnauthorized: new Https.Agent({ maxSockets: Infinity, rejectUnauthorized: false })
+        };
+
+        if (this._defaults.events) {
+            this.events = new Events.EventEmitter();
+        }
+    }
+
+    defaults(options) {
+
+        Hoek.assert(options && typeof options === 'object', 'options must be provided to defaults');
+
+        options = Hoek.applyToDefaults(this._defaults, options, { shallow: internals.shallowOptions });
+        return new internals.Client(options);
+    }
+
+    request(method, url, options = {}) {
+
+        try {
+            options = Hoek.applyToDefaults(this._defaults, options, { shallow: internals.shallowOptions });
+
+            Hoek.assert(options.payload === undefined || typeof options.payload === 'string' || typeof options.payload === 'object', 'options.payload must be a string, a Buffer, a Stream, or an Object');
+            Hoek.assert(internals.isNullOrUndefined(options.agent) || typeof options.rejectUnauthorized !== 'boolean', 'options.agent cannot be set to an Agent at the same time as options.rejectUnauthorized is set');
+            Hoek.assert(internals.isNullOrUndefined(options.beforeRedirect) || typeof options.beforeRedirect === 'function', 'options.beforeRedirect must be a function');
+            Hoek.assert(internals.isNullOrUndefined(options.redirected) || typeof options.redirected === 'function', 'options.redirected must be a function');
+            Hoek.assert(options.gunzip === undefined || typeof options.gunzip === 'boolean' || options.gunzip === 'force', 'options.gunzip must be a boolean or "force"');
+        }
+        catch (err) {
+            return Promise.reject(err);
+        }
+
+        if (options.baseUrl) {
+            url = internals.resolveUrl(options.baseUrl, url);
+            delete options.baseUrl;
+        }
+
+        const relay = {};
+        const req = this._request(method, url, options, relay);
+        const promise = new Promise((resolve, reject) => {
+
+            relay.callback = (err, res) => {
+
+                if (err) {
+                    reject(err);
+                    return;
+                }
+
+                resolve(res);
+                return;
+            };
+        });
+
+        promise.req = req;
+        return promise;
+    }
+
+    _request(method, url, options, relay, _trace) {
+
+        const uri = {};
+        if (options.socketPath) {
+            uri.socketPath = options.socketPath;
+
+            const parsedUri = new Url.URL(url, `unix://${options.socketPath}`);
+            internals.applyUrlToOptions(uri, {
+                host: '',                               // host must be empty according to https://tools.ietf.org/html/rfc2616#section-14.23
+                protocol: 'http:',
+                hash: parsedUri.hash,
+                search: parsedUri.search,
+                searchParams: parsedUri.searchParams,
+                pathname: parsedUri.pathname,
+                href: parsedUri.href
+            });
+        }
+        else {
+            uri.setHost = false;
+            const parsedUri = new Url.URL(url);
+            internals.applyUrlToOptions(uri, parsedUri);
+        }
+
+        uri.method = method.toUpperCase();
+        uri.headers = Object.create(null);
+
+        const usedHeaders = new Set();
+        if (options.headers) {
+            for (const [key, value] of Object.entries(options.headers)) {
+                if (value !== undefined) {
+                    uri.headers[key] = value;
+                    usedHeaders.add(key.toLowerCase());
+                }
+            }
+        }
+
+        if (!usedHeaders.has('host')) {
+            uri.headers.host = uri.host;
+        }
+
+        if (options.payload && typeof options.payload === 'object' && !(options.payload instanceof Stream) && !Buffer.isBuffer(options.payload)) {
+            options.payload = JSON.stringify(options.payload);
+            if (!usedHeaders.has('content-type')) {
+                uri.headers['content-type'] = 'application/json';
+            }
+        }
+
+        if (options.gunzip &&
+            !usedHeaders.has('accept-encoding')) {
+
+            uri.headers['accept-encoding'] = 'gzip';
+        }
+
+        const payloadSupported = uri.method !== 'GET' && uri.method !== 'HEAD' && !internals.isNullOrUndefined(options.payload);
+        if (payloadSupported &&
+            (typeof options.payload === 'string' || Buffer.isBuffer(options.payload)) &&
+            !usedHeaders.has('content-length')) {
+
+            uri.headers['content-length'] = Buffer.isBuffer(options.payload) ? options.payload.length : Buffer.byteLength(options.payload);
+        }
+
+        let redirects = options.hasOwnProperty('redirects') ? options.redirects : false;        // Needed to allow 0 as valid value when passed recursively
+
+        _trace = _trace ?? [];
+        _trace.push({ method: uri.method, url });
+
+        const client = uri.protocol === 'https:' ? Https : Http;
+
+        for (const option of internals.httpOptions) {
+            if (options[option] !== undefined) {
+                uri[option] = options[option];
+            }
+        }
+
+        if (options.rejectUnauthorized !== undefined &&
+            uri.protocol === 'https:') {
+
+            uri.agent = options.rejectUnauthorized ? this.agents.https : this.agents.httpsAllowUnauthorized;
+        }
+        else if (options.agent ||
+            options.agent === false) {
+
+            uri.agent = options.agent;
+        }
+        else {
+            uri.agent = uri.protocol === 'https:' ? this.agents.https : this.agents.http;
+        }
+
+        this._emit('preRequest', uri, options);
+
+        const start = Date.now();
+        const req = client.request(uri);
+
+        this._emit('request', req);
+
+        let shadow = null;                                                                      // A copy of the streamed request payload when redirects are enabled
+        let timeoutId;
+
+        const onError = (err) => {
+
+            err.trace = _trace;
+            return finishOnce(Boom.badGateway('Client request error', err));
+        };
+
+        const onAbort = () => {
+
+            if (!req.socket) {
+                // Fake an ECONNRESET error on early abort
+
+                const error = new Error('socket hang up');
+                error.code = 'ECONNRESET';
+                finishOnce(error);
+            }
+        };
+
+        req.once('error', onError);
+
+        const onResponse = (res) => {
+
+            // Pass-through response
+
+            const statusCode = res.statusCode;
+            const redirectMethod = internals.redirectMethod(statusCode, uri.method, options);
+
+            if (redirects === false ||
+                !redirectMethod) {
+
+                return finishOnce(null, res);
+            }
+
+            // Redirection
+
+            res.destroy();
+
+            if (redirects === 0) {
+                return finishOnce(Boom.badGateway('Maximum redirections reached', _trace));
+            }
+
+            let location = res.headers.location;
+            if (!location) {
+                return finishOnce(Boom.badGateway('Received redirection without location', _trace));
+            }
+
+            if (!/^https?:/i.test(location)) {
+                location = new Url.URL(location, uri.href).href;
+            }
+
+            const redirectOptions = Hoek.clone(options, { shallow: internals.shallowOptions });
+            redirectOptions.payload = shadow ?? options.payload;                                    // shadow must be ready at this point if set
+            redirectOptions.redirects = --redirects;
+            if (timeoutId) {
+                clearTimeout(timeoutId);
+                const elapsed = Date.now() - start;
+                redirectOptions.timeout = (redirectOptions.timeout - elapsed).toString();           // stringify to not drop timeout when === 0
+            }
+
+            // When redirecting cross-origin (scheme, host, or port differs), remove sensitive credential headers
+            if (redirectOptions.headers) {
+                const parsedLocation = new URL(location);
+                if (uri.origin !== parsedLocation.origin) {
+                    for (const header of Object.keys(redirectOptions.headers)) {
+                        if (internals.sensitiveCrossHostHeaders.has(header.toLowerCase())) {
+                            delete redirectOptions.headers[header];
+                        }
+                    }
+                }
+            }
+
+            const followRedirect = (err) => {
+
+                if (err) {
+                    err.trace = _trace;
+                    return finishOnce(Boom.badGateway('Invalid redirect', err));
+                }
+
+                const redirectReq = this._request(redirectMethod, location, redirectOptions, { callback: finishOnce }, _trace);
+                if (options.redirected) {
+                    options.redirected(statusCode, location, redirectReq);
+                }
+            };
+
+            if (!options.beforeRedirect) {
+                return followRedirect();
+            }
+
+            return options.beforeRedirect(redirectMethod, statusCode, location, res.headers, redirectOptions, followRedirect);
+        };
+
+        // Register handlers
+
+        const finish = (err, res) => {
+
+            if (err) {
+                req.abort();
+            }
+
+            req.removeListener('response', onResponse);
+            req.removeListener('error', onError);
+            req.removeListener('abort', onAbort);
+            req.on('error', Hoek.ignore);
+
+            clearTimeout(timeoutId);
+
+            this._emit('response', err, { req, res, start, uri });
+
+            return relay.callback(err, res);
+        };
+
+        const finishOnce = Hoek.once(finish);
+
+        req.once('response', onResponse);
+
+        if (options.timeout) {
+            timeoutId = setTimeout(() => finishOnce(Boom.gatewayTimeout('Client request timeout')), options.timeout);
+        }
+
+        req.on('abort', onAbort);
+
+        // Write payload
+
+        if (payloadSupported) {
+            if (options.payload instanceof Stream) {
+                let stream = options.payload;
+
+                if (redirects) {
+                    const collector = new Tap();
+                    collector.once('finish', () => {
+
+                        shadow = collector.collect();
+                    });
+
+                    stream = options.payload.pipe(collector);
+                }
+
+                internals.deferPipeUntilSocketConnects(req, stream);
+                return req;
+            }
+
+            req.write(options.payload);
+        }
+
+        // Finalize request
+
+        req.end();
+        return req;
+    }
+
+    _emit(...args) {
+
+        if (this.events) {
+            this.events.emit(...args);
+        }
+    }
+
+    read(res, options = {}) {
+
+        return new Promise((resolve, reject) => {
+
+            this._read(res, options, (err, payload) => {
+
+                if (err) {
+                    reject(err);
+                    return;
+                }
+
+                resolve(payload);
+                return;
+            });
+        });
+    }
+
+    _read(res, options, callback) {
+
+        options = Hoek.applyToDefaults(this._defaults, options, { shallow: internals.shallowOptions });
+
+        // Finish once
+
+        let clientTimeoutId = null;
+
+        const finish = (err, buffer) => {
+
+            clearTimeout(clientTimeoutId);
+            reader.removeListener('error', onReaderError);
+            reader.removeListener('finish', onReaderFinish);
+            res.removeListener('error', onResError);
+            res.removeListener('close', onResAborted);
+            res.removeListener('aborted', onResAborted);
+            res.on('error', Hoek.ignore);
+
+            if (err) {
+                return callback(err);
+            }
+
+            if (!options.json) {
+                return callback(null, buffer);
+            }
+
+            // Parse JSON
+
+            if (options.json === 'force') {
+                return internals.tryParseBuffer(buffer, callback);
+            }
+
+            // 'strict' or true
+
+            const contentType = res.headers?.['content-type'] ?? '';
+            const mime = contentType.split(';')[0].trim().toLowerCase();
+
+            if (!internals.jsonRegex.test(mime)) {
+                if (options.json === 'strict') {
+                    return callback(Boom.notAcceptable('The content-type is not JSON compatible'));
+                }
+
+                return callback(null, buffer);
+            }
+
+            return internals.tryParseBuffer(buffer, callback);
+        };
+
+        const finishOnce = Hoek.once(finish);
+
+        const clientTimeout = options.timeout;
+        if (clientTimeout &&
+            clientTimeout > 0) {
+
+            clientTimeoutId = setTimeout(() => finishOnce(Boom.clientTimeout()), clientTimeout);
+        }
+
+        // Hander errors
+
+        const onResError = (err) => {
+
+            return finishOnce(err.isBoom ? err : Boom.internal('Payload stream error', err));
+        };
+
+        const onResAborted = () => {
+
+            if (!res.complete) {
+                finishOnce(Boom.internal('Payload stream closed prematurely'));
+            }
+        };
+
+        res.once('error', onResError);
+        res.once('close', onResAborted);
+        res.once('aborted', onResAborted);
+
+        // Read payload
+
+        const reader = new Recorder({ maxBytes: options.maxBytes });
+
+        const onReaderError = (err) => {
+
+            if (res.destroy) {                          // GZip stream has no destroy() method
+                res.destroy();
+            }
+
+            return finishOnce(err);
+        };
+
+        reader.once('error', onReaderError);
+
+        const onReaderFinish = () => {
+
+            return finishOnce(null, reader.collect());
+        };
+
+        reader.once('finish', onReaderFinish);
+
+        if (options.gunzip) {
+            const contentEncoding = options.gunzip === 'force' ?
+                'gzip' :
+                res.headers?.['content-encoding'] ?? '';
+
+            if (/^(x-)?gzip(\s*,\s*identity)?$/.test(contentEncoding)) {
+                const gunzip = Zlib.createGunzip();
+                gunzip.once('error', onReaderError);
+                res.pipe(gunzip).pipe(reader);
+                return;
+            }
+        }
+
+        res.pipe(reader);
+    }
+
+    toReadableStream(payload, encoding) {
+
+        return new Payload(payload, encoding);
+    }
+
+    parseCacheControl(field) {
+
+        /*
+            Cache-Control   = 1#cache-directive
+            cache-directive = token [ "=" ( token / quoted-string ) ]
+            token           = [^\x00-\x20\(\)<>@\,;\:\\"\/\[\]\?\=\{\}\x7F]+
+            quoted-string   = "(?:[^"\\]|\\.)*"
+        */
+
+        //                             1: directive                                        =   2: token                                              3: quoted-string
+        const regex = /(?:^|(?:\s*\,\s*))([^\x00-\x20\(\)<>@\,;\:\\"\/\[\]\?\=\{\}\x7F]+)(?:\=(?:([^\x00-\x20\(\)<>@\,;\:\\"\/\[\]\?\=\{\}\x7F]+)|(?:\"((?:[^"\\]|\\.)*)\")))?/g;
+
+        const header = {};
+        const error = field.replace(regex, ($0, $1, $2, $3) => {
+
+            const value = $2 || $3;
+            header[$1] = value ? value.toLowerCase() : true;
+            return '';
+        });
+
+        if (header['max-age']) {
+            try {
+                const maxAge = parseInt(header['max-age'], 10);
+                if (isNaN(maxAge)) {
+                    return null;
+                }
+
+                header['max-age'] = maxAge;
+            }
+            catch (err) { }
+        }
+
+        return error ? null : header;
+    }
+
+    // Shortcuts
+
+    get(uri, options) {
+
+        return this._shortcut('GET', uri, options);
+    }
+
+    post(uri, options) {
+
+        return this._shortcut('POST', uri, options);
+    }
+
+    patch(uri, options) {
+
+        return this._shortcut('PATCH', uri, options);
+    }
+
+    put(uri, options) {
+
+        return this._shortcut('PUT', uri, options);
+    }
+
+    delete(uri, options) {
+
+        return this._shortcut('DELETE', uri, options);
+    }
+
+    async _shortcut(method, uri, options = {}) {
+
+        const res = await this.request(method, uri, options);
+
+        let payload;
+        try {
+            payload = await this.read(res, options);
+        }
+        catch (err) {
+            err.data = err.data ?? {};
+            err.data.res = res;
+            throw err;
+        }
+
+        if (res.statusCode < 400) {
+            return { res, payload };
+        }
+
+        // Response error
+
+        const data = {
+            isResponseError: true,
+            headers: res.headers,
+            res,
+            payload
+        };
+
+        throw new Boom.Boom(`Response Error: ${res.statusCode} ${res.statusMessage}`, { statusCode: res.statusCode, data });
+    }
+};
+
+
+// baseUrl needs to end in a trailing / if it contains paths that need to be preserved
+
+internals.resolveUrl = function (baseUrl, path) {
+
+    if (!path) {
+        return baseUrl;
+    }
+
+    // Will default to path if it's not a relative URL
+    const url = new Url.URL(path, baseUrl);
+    return Url.format(url);
+};
+
+
+internals.deferPipeUntilSocketConnects = function (req, stream) {
+
+    const onSocket = (socket) => {
+
+        if (!socket.connecting) {
+            return onSocketConnect();
+        }
+
+        socket.once('connect', onSocketConnect);
+    };
+
+    const onSocketConnect = () => {
+
+        stream.pipe(req);
+        stream.removeListener('error', onStreamError);
+    };
+
+    const onStreamError = (err) => {
+
+        req.emit('error', err);
+    };
+
+    req.once('socket', onSocket);
+    stream.on('error', onStreamError);
+};
+
+
+internals.redirectMethod = function (code, method, options) {
+
+    switch (code) {
+        case 301:
+        case 302:
+            return options.redirectMethod || method;
+
+        case 303:
+            if (options.redirect303) {
+                return 'GET';
+            }
+
+            break;
+
+        case 307:
+        case 308:
+            return method;
+    }
+
+    return null;
+};
+
+
+internals.tryParseBuffer = function (buffer, next) {
+
+    if (buffer.length === 0) {
+        return next(null, null);
+    }
+
+    let payload;
+    try {
+        payload = Bourne.parse(buffer.toString());
+    }
+    catch (err) {
+        return next(Boom.badGateway(err.message, { payload: buffer }));
+    }
+
+    return next(null, payload);
+};
+
+
+internals.applyUrlToOptions = (options, url) => {
+
+    options.host = url.host;
+    options.origin = url.origin;
+    options.searchParams = url.searchParams;
+    options.protocol = url.protocol;
+    options.hostname = typeof url.hostname === 'string' && url.hostname.startsWith('[') ? url.hostname.slice(1, -1) : url.hostname;
+    options.hash = url.hash;
+    options.search = url.search;
+    options.pathname = url.pathname;
+    options.path = `${url.pathname}${url.search}`;
+    options.href = url.href;
+    if (url.port !== '') {
+        options.port = Number(url.port);
+    }
+
+    if (url.username || url.password) {
+        options.auth = `${url.username}:${url.password}`;
+        options.username = url.username;
+        options.password = url.password;
+    }
+
+    return options;
+};
+
+internals.isNullOrUndefined = (val) => [null, undefined].includes(val);
+
+module.exports = new internals.Client();
diff --git a/node_modules/@hapi/wreck/lib/payload.js b/node_modules/@hapi/wreck/lib/payload.js
new file mode 100755
index 0000000..44d5dda
--- /dev/null
+++ b/node_modules/@hapi/wreck/lib/payload.js
@@ -0,0 +1,38 @@
+'use strict';
+
+const Stream = require('stream');
+
+
+const internals = {};
+
+
+module.exports = internals.Payload = class extends Stream.Readable {
+
+    constructor(payload, encoding) {
+
+        super();
+
+        const data = [].concat(payload || '');
+        let size = 0;
+        for (let i = 0; i < data.length; ++i) {
+            const chunk = data[i];
+            size = size + chunk.length;
+            data[i] = Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
+        }
+
+        this._data = Buffer.concat(data, size);
+        this._position = 0;
+        this._encoding = encoding || 'utf8';
+    }
+
+    _read(size) {
+
+        const chunk = this._data.slice(this._position, this._position + size);
+        this.push(chunk, this._encoding);
+        this._position = this._position + chunk.length;
+
+        if (this._position >= this._data.length) {
+            this.push(null);
+        }
+    }
+};
diff --git a/node_modules/@hapi/wreck/lib/recorder.js b/node_modules/@hapi/wreck/lib/recorder.js
new file mode 100755
index 0000000..5b67417
--- /dev/null
+++ b/node_modules/@hapi/wreck/lib/recorder.js
@@ -0,0 +1,40 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Boom = require('@hapi/boom');
+
+
+const internals = {};
+
+
+module.exports = internals.Recorder = class extends Stream.Writable {
+
+    constructor(options) {
+
+        super();
+
+        this.settings = options;                // No need to clone since called internally with new object
+        this.buffers = [];
+        this.length = 0;
+    }
+
+    _write(chunk, encoding, next) {
+
+        if (this.settings.maxBytes &&
+            this.length + chunk.length > this.settings.maxBytes) {
+
+            return this.emit('error', Boom.entityTooLarge('Payload content length greater than maximum allowed: ' + this.settings.maxBytes));
+        }
+
+        this.length = this.length + chunk.length;
+        this.buffers.push(chunk);
+        next();
+    }
+
+    collect() {
+
+        const buffer = (this.buffers.length === 0 ? Buffer.alloc(0) : (this.buffers.length === 1 ? this.buffers[0] : Buffer.concat(this.buffers, this.length)));
+        return buffer;
+    }
+};
diff --git a/node_modules/@hapi/wreck/lib/tap.js b/node_modules/@hapi/wreck/lib/tap.js
new file mode 100755
index 0000000..d4932a5
--- /dev/null
+++ b/node_modules/@hapi/wreck/lib/tap.js
@@ -0,0 +1,29 @@
+'use strict';
+
+const Stream = require('stream');
+
+const Payload = require('./payload');
+
+
+const internals = {};
+
+
+module.exports = internals.Tap = class extends Stream.Transform {
+
+    constructor() {
+
+        super();
+        this.buffers = [];
+    }
+
+    _transform(chunk, encoding, next) {
+
+        this.buffers.push(chunk);
+        next(null, chunk);
+    }
+
+    collect() {
+
+        return new Payload(this.buffers);
+    }
+};
diff --git a/node_modules/@hapi/wreck/package.json b/node_modules/@hapi/wreck/package.json
new file mode 100755
index 0000000..e01bbc3
--- /dev/null
+++ b/node_modules/@hapi/wreck/package.json
@@ -0,0 +1,32 @@
+{
+    "name": "@hapi/wreck",
+    "description": "HTTP Client Utilities",
+    "version": "18.1.2",
+    "repository": "git://github.com/hapijs/wreck",
+    "main": "lib/index",
+    "types": "lib/index.d.ts",
+    "keywords": [
+        "utilities",
+        "http",
+        "client"
+    ],
+    "files": [
+        "lib"
+    ],
+    "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/hoek": "^11.0.2"
+    },
+    "devDependencies": {
+        "@hapi/code": "^9.0.3",
+        "@hapi/lab": "^25.1.2",
+        "@types/node": "^17.0.31",
+        "typescript": "~4.6.4"
+    },
+    "scripts": {
+        "test": "lab -t 100 -L -a @hapi/code -m 10000 -Y",
+        "test-cov-html": "lab -r html -o coverage.html -a @hapi/code -m 10000"
+    },
+    "license": "BSD-3-Clause"
+}
diff --git a/node_modules/@ioredis/commands/LICENSE b/node_modules/@ioredis/commands/LICENSE
new file mode 100644
index 0000000..8931fa9
--- /dev/null
+++ b/node_modules/@ioredis/commands/LICENSE
@@ -0,0 +1,23 @@
+The MIT License (MIT)
+
+Copyright (c) 2022 Zihua Li
+Copyright (c) 2015 NodeRedis
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/@ioredis/commands/README.md b/node_modules/@ioredis/commands/README.md
new file mode 100644
index 0000000..2649696
--- /dev/null
+++ b/node_modules/@ioredis/commands/README.md
@@ -0,0 +1,43 @@
+# Redis Commands
+
+This module exports all the commands that Redis supports.
+
+## Install
+
+```shell
+$ npm install @ioredis/commands
+```
+
+## Usage
+
+```js
+const commands = require('@ioredis/commands');
+```
+
+`.list` is an array contains all the lowercased commands:
+
+```js
+commands.list.forEach((command) => {
+  console.log(command);
+});
+```
+
+`.exists()` is used to check if the command exists:
+
+```js
+commands.exists('set') // true
+commands.exists('other-command') // false
+```
+
+`.hasFlag()` is used to check if the command has the flag:
+
+```js
+commands.hasFlag('set', 'readonly') // false
+```
+
+`.getKeyIndexes()` is used to get the indexes of keys in the command arguments:
+
+```js
+commands.getKeyIndexes('set', ['key', 'value']) // [0]
+commands.getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+```
diff --git a/node_modules/@ioredis/commands/built/commands.json b/node_modules/@ioredis/commands/built/commands.json
new file mode 100644
index 0000000..1f0430f
--- /dev/null
+++ b/node_modules/@ioredis/commands/built/commands.json
@@ -0,0 +1,2924 @@
+{
+    "vadd": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vcard": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vdim": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vemb": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vgetattr": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vinfo": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vismember": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vlinks": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vrandmember": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vrange": {
+        "arity": -4,
+        "flags": [
+            "readonly",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vrem": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vsetattr": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "module",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "vsim": {
+        "arity": -4,
+        "flags": [
+            "readonly",
+            "module"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "acl": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "append": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arcount": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ardel": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ardelrange": {
+        "arity": -4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arget": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "argetrange": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "argrep": {
+        "arity": -6,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arinfo": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arinsert": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arlastitems": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "armget": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "armset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arnext": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arop": {
+        "arity": -5,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arring": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arscan": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arseek": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "arset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "asking": {
+        "arity": 1,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "auth": {
+        "arity": -2,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bgrewriteaof": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bgsave": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bitcount": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitfield": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitfield_ro": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 2,
+        "keyStop": -1,
+        "step": 1
+    },
+    "bitpos": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "blmove": {
+        "arity": 6,
+        "flags": [
+            "write",
+            "denyoom",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "blmpop": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "blpop": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "brpop": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "brpoplpush": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "bzmpop": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bzpopmax": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "bzpopmin": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "client": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "cluster": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "command": {
+        "arity": -1,
+        "flags": [
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "config": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "copy": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "dbsize": {
+        "arity": 1,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "debug": {
+        "arity": -2,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "decr": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "decrby": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "del": {
+        "arity": -2,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "discard": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "dump": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "echo": {
+        "arity": 2,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "eval": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "eval_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "evalsha": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "evalsha_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "exec": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "skip_slowlog"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "exists": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "expire": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "expireat": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "expiretime": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "failover": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "fcall": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "fcall_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "flushall": {
+        "arity": -1,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "flushdb": {
+        "arity": -1,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "function": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "geoadd": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geodist": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geohash": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geopos": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadius": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadius_ro": {
+        "arity": -6,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadiusbymember": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadiusbymember_ro": {
+        "arity": -5,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geosearch": {
+        "arity": -7,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geosearchstore": {
+        "arity": -8,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "get": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getbit": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getdel": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getex": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getrange": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getset": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hdel": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hello": {
+        "arity": -1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "hexists": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpire": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpireat": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpiretime": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hget": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetall": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetdel": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetex": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hincrby": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hincrbyfloat": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hkeys": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hmget": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hmset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpersist": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpire": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpireat": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpiretime": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpttl": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hrandfield": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hsetex": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hsetnx": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hstrlen": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "httl": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hvals": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incr": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incrby": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incrbyfloat": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "increx": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "info": {
+        "arity": -1,
+        "flags": [
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "keys": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lastsave": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "latency": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lcs": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "lindex": {
+        "arity": 3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "linsert": {
+        "arity": 5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "llen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lmove": {
+        "arity": 5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "lmpop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lolwut": {
+        "arity": -1,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lpop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpos": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpush": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpushx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lrange": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lrem": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lset": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ltrim": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "memory": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "mget": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "migrate": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 3,
+        "keyStop": 3,
+        "step": 1
+    },
+    "module": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "monitor": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "move": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "mset": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 2
+    },
+    "msetex": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "msetnx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 2
+    },
+    "multi": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "object": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "persist": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpire": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpireat": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpiretime": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pfadd": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pfcount": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "pfdebug": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "admin"
+        ],
+        "keyStart": 2,
+        "keyStop": 2,
+        "step": 1
+    },
+    "pfmerge": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "pfselftest": {
+        "arity": 1,
+        "flags": [
+            "admin"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "ping": {
+        "arity": -1,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "psetex": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "psubscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "psync": {
+        "arity": -3,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "pttl": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "publish": {
+        "arity": 3,
+        "flags": [
+            "pubsub",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "pubsub": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "punsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "quit": {
+        "arity": -1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "randomkey": {
+        "arity": 1,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "readonly": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "readwrite": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "rename": {
+        "arity": 3,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "renamenx": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "replconf": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "replicaof": {
+        "arity": 3,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "reset": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "restore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "restore-asking": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "asking"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "role": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "rpop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "rpoplpush": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "rpush": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "rpushx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sadd": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "save": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "scan": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "scard": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "script": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sdiff": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sdiffstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "select": {
+        "arity": 2,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "set": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setbit": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setex": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setnx": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setrange": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "shutdown": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale",
+            "no_multi",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sinter": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sintercard": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sinterstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sismember": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "slaveof": {
+        "arity": 3,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "slowlog": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "smembers": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "smismember": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "smove": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "sort": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sort_ro": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "spop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "spublish": {
+        "arity": 3,
+        "flags": [
+            "pubsub",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "srandmember": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "srem": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ssubscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "strlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "subscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "substr": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sunion": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sunionstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sunsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "swapdb": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sync": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "time": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "touch": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "ttl": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "type": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "unlink": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "unsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "unwatch": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "wait": {
+        "arity": 3,
+        "flags": [
+            "noscript"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "watch": {
+        "arity": -2,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "xack": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xadd": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xautoclaim": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xclaim": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xdel": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xdelex": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xgroup": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xinfo": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xnack": {
+        "arity": -7,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xpending": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xread": {
+        "arity": -4,
+        "flags": [
+            "readonly",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xreadgroup": {
+        "arity": -7,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xrevrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xsetid": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xtrim": {
+        "arity": -4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zadd": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zcard": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zcount": {
+        "arity": 4,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zdiff": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zdiffstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zincrby": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zinter": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zintercard": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zinterstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zlexcount": {
+        "arity": 4,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zmpop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zmscore": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zpopmax": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zpopmin": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrandmember": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangebylex": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangebyscore": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangestore": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "zrank": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrem": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebylex": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebyrank": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebyscore": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrangebylex": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrangebyscore": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrank": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zscore": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zunion": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zunionstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    }
+}
diff --git a/node_modules/@ioredis/commands/built/index.d.ts b/node_modules/@ioredis/commands/built/index.d.ts
new file mode 100644
index 0000000..94506a2
--- /dev/null
+++ b/node_modules/@ioredis/commands/built/index.d.ts
@@ -0,0 +1,34 @@
+/// <reference types="node" />
+/**
+ * Redis command list
+ *
+ * All commands are lowercased.
+ */
+export declare const list: string[];
+/**
+ * Check if the command exists
+ */
+export declare function exists(commandName: string, options?: {
+    caseInsensitive?: boolean;
+}): boolean;
+/**
+ * Check if the command has the flag
+ *
+ * Some of possible flags: readonly, noscript, loading
+ */
+export declare function hasFlag(commandName: string, flag: string, options?: {
+    nameCaseInsensitive?: boolean;
+}): boolean;
+/**
+ * Get indexes of keys in the command arguments
+ *
+ * @example
+ * ```javascript
+ * getKeyIndexes('set', ['key', 'value']) // [0]
+ * getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+ * ```
+ */
+export declare function getKeyIndexes(commandName: string, args: (string | Buffer | number)[], options?: {
+    parseExternalKey?: boolean;
+    nameCaseInsensitive?: boolean;
+}): number[];
diff --git a/node_modules/@ioredis/commands/built/index.js b/node_modules/@ioredis/commands/built/index.js
new file mode 100644
index 0000000..865410a
--- /dev/null
+++ b/node_modules/@ioredis/commands/built/index.js
@@ -0,0 +1,224 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getKeyIndexes = exports.hasFlag = exports.exists = exports.list = void 0;
+const commands_json_1 = __importDefault(require("./commands.json"));
+/**
+ * Redis command list
+ *
+ * All commands are lowercased.
+ */
+exports.list = Object.keys(commands_json_1.default);
+const flags = {};
+exports.list.forEach((commandName) => {
+    flags[commandName] = commands_json_1.default[commandName].flags.reduce(function (flags, flag) {
+        flags[flag] = true;
+        return flags;
+    }, {});
+});
+/**
+ * Check if the command exists
+ */
+function exists(commandName, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.caseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    return Boolean(commands_json_1.default[commandName]);
+}
+exports.exists = exists;
+/**
+ * Check if the command has the flag
+ *
+ * Some of possible flags: readonly, noscript, loading
+ */
+function hasFlag(commandName, flag, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.nameCaseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    if (!flags[commandName]) {
+        throw new Error("Unknown command " + commandName);
+    }
+    return Boolean(flags[commandName][flag]);
+}
+exports.hasFlag = hasFlag;
+/**
+ * Get indexes of keys in the command arguments
+ *
+ * @example
+ * ```javascript
+ * getKeyIndexes('set', ['key', 'value']) // [0]
+ * getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+ * ```
+ */
+function getKeyIndexes(commandName, args, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.nameCaseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    const command = commands_json_1.default[commandName];
+    if (!command) {
+        throw new Error("Unknown command " + commandName);
+    }
+    if (!Array.isArray(args)) {
+        throw new Error("Expect args to be an array");
+    }
+    const keys = [];
+    const parseExternalKey = Boolean(options && options.parseExternalKey);
+    const takeDynamicKeys = (args, startIndex) => {
+        const keys = [];
+        const keyStop = Number(args[startIndex]);
+        for (let i = 0; i < keyStop; i++) {
+            keys.push(i + startIndex + 1);
+        }
+        return keys;
+    };
+    const takeKeyAfterToken = (args, startIndex, token) => {
+        for (let i = startIndex; i < args.length - 1; i += 1) {
+            if (String(args[i]).toLowerCase() === token.toLowerCase()) {
+                return i + 1;
+            }
+        }
+        return null;
+    };
+    switch (commandName) {
+        case "zunionstore":
+        case "zinterstore":
+        case "zdiffstore":
+            keys.push(0, ...takeDynamicKeys(args, 1));
+            break;
+        case "eval":
+        case "evalsha":
+        case "eval_ro":
+        case "evalsha_ro":
+        case "fcall":
+        case "fcall_ro":
+        case "blmpop":
+        case "bzmpop":
+            keys.push(...takeDynamicKeys(args, 1));
+            break;
+        case "sintercard":
+        case "lmpop":
+        case "zunion":
+        case "zinter":
+        case "zmpop":
+        case "zintercard":
+        case "zdiff": {
+            keys.push(...takeDynamicKeys(args, 0));
+            break;
+        }
+        case "msetex": {
+            const numKeys = Number(args[0]);
+            for (let i = 0; i < numKeys; i++) {
+                keys.push(1 + i * 2);
+            }
+            break;
+        }
+        case "georadius": {
+            keys.push(0);
+            const storeKey = takeKeyAfterToken(args, 5, "STORE");
+            if (storeKey)
+                keys.push(storeKey);
+            const distKey = takeKeyAfterToken(args, 5, "STOREDIST");
+            if (distKey)
+                keys.push(distKey);
+            break;
+        }
+        case "georadiusbymember": {
+            keys.push(0);
+            const storeKey = takeKeyAfterToken(args, 4, "STORE");
+            if (storeKey)
+                keys.push(storeKey);
+            const distKey = takeKeyAfterToken(args, 4, "STOREDIST");
+            if (distKey)
+                keys.push(distKey);
+            break;
+        }
+        case "sort":
+        case "sort_ro":
+            keys.push(0);
+            for (let i = 1; i < args.length - 1; i++) {
+                let arg = args[i];
+                if (typeof arg !== "string") {
+                    continue;
+                }
+                const directive = arg.toUpperCase();
+                if (directive === "GET") {
+                    i += 1;
+                    arg = args[i];
+                    if (arg !== "#") {
+                        if (parseExternalKey) {
+                            keys.push([i, getExternalKeyNameLength(arg)]);
+                        }
+                        else {
+                            keys.push(i);
+                        }
+                    }
+                }
+                else if (directive === "BY") {
+                    i += 1;
+                    if (parseExternalKey) {
+                        keys.push([i, getExternalKeyNameLength(args[i])]);
+                    }
+                    else {
+                        keys.push(i);
+                    }
+                }
+                else if (directive === "STORE") {
+                    i += 1;
+                    keys.push(i);
+                }
+            }
+            break;
+        case "migrate":
+            if (args[2] === "") {
+                for (let i = 5; i < args.length - 1; i++) {
+                    const arg = args[i];
+                    if (typeof arg === "string" && arg.toUpperCase() === "KEYS") {
+                        for (let j = i + 1; j < args.length; j++) {
+                            keys.push(j);
+                        }
+                        break;
+                    }
+                }
+            }
+            else {
+                keys.push(2);
+            }
+            break;
+        case "xreadgroup":
+        case "xread":
+            // Keys are 1st half of the args after STREAMS argument.
+            for (let i = commandName === "xread" ? 0 : 3; i < args.length - 1; i++) {
+                if (String(args[i]).toUpperCase() === "STREAMS") {
+                    for (let j = i + 1; j <= i + (args.length - 1 - i) / 2; j++) {
+                        keys.push(j);
+                    }
+                    break;
+                }
+            }
+            break;
+        default:
+            // Step has to be at least one in this case, otherwise the command does
+            // not contain a key.
+            if (command.step > 0) {
+                const keyStart = command.keyStart - 1;
+                const keyStop = command.keyStop > 0
+                    ? command.keyStop
+                    : args.length + command.keyStop + 1;
+                for (let i = keyStart; i < keyStop; i += command.step) {
+                    keys.push(i);
+                }
+            }
+            break;
+    }
+    return keys;
+}
+exports.getKeyIndexes = getKeyIndexes;
+function getExternalKeyNameLength(key) {
+    if (typeof key !== "string") {
+        key = String(key);
+    }
+    const hashPos = key.indexOf("->");
+    return hashPos === -1 ? key.length : hashPos;
+}
diff --git a/node_modules/@ioredis/commands/package.json b/node_modules/@ioredis/commands/package.json
new file mode 100644
index 0000000..915a359
--- /dev/null
+++ b/node_modules/@ioredis/commands/package.json
@@ -0,0 +1,52 @@
+{
+  "name": "@ioredis/commands",
+  "version": "1.10.0",
+  "description": "Redis commands",
+  "main": "built/index.js",
+  "files": [
+    "built/",
+    "commands.json"
+  ],
+  "scripts": {
+    "pretest": "npm run lint",
+    "test": "mocha",
+    "build": "rm -rf built && tsc",
+    "gen": "node tools/build",
+    "lint": "standard --fix --verbose | snazzy",
+    "release": "release-it"
+  },
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/ioredis/commands.git"
+  },
+  "keywords": [
+    "redis",
+    "commands",
+    "prefix"
+  ],
+  "author": "Zihua Li <i@zihua.li> (http://zihua.li)",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/ioredis/commands/issues"
+  },
+  "homepage": "https://github.com/ioredis/commands",
+  "devDependencies": {
+    "@release-it/conventional-changelog": "^4.2.0",
+    "@semantic-release/changelog": "^6.0.1",
+    "@semantic-release/commit-analyzer": "^9.0.2",
+    "@semantic-release/git": "^10.0.1",
+    "chai": "^4.3.6",
+    "ioredis": "^5.0.6",
+    "mocha": "^9.2.1",
+    "release-it": "^14.12.5",
+    "safe-stable-stringify": "^2.3.1",
+    "semantic-release": "^19.0.2",
+    "snazzy": "^9.0.0",
+    "standard": "^16.0.4",
+    "typescript": "^4.6.2"
+  }
+}
diff --git a/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/README.md b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/README.md
new file mode 100644
index 0000000..febdebf
--- /dev/null
+++ b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/README.md
@@ -0,0 +1 @@
+Platform specific binary for msgpackr-extract on darwin OS with arm64 architecture
\ No newline at end of file
diff --git a/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/index.js b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/index.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/node.napi.glibc.node b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/node.napi.glibc.node
new file mode 100755
index 0000000..21d624c
Binary files /dev/null and b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/node.napi.glibc.node differ
diff --git a/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/package.json b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/package.json
new file mode 100644
index 0000000..bebc3ac
--- /dev/null
+++ b/node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64/package.json
@@ -0,0 +1,17 @@
+{
+  "name": "@msgpackr-extract/msgpackr-extract-darwin-arm64",
+  "version": "3.0.4",
+  "os": [
+    "darwin"
+  ],
+  "cpu": [
+    "arm64"
+  ],
+  "license": "MIT",
+  "author": "Kris Zyp",
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/kriszyp/msgpackr-extract"
+  },
+  "description": "Platform specific binary for msgpackr-extract on darwin OS with arm64 architecture"
+}
\ No newline at end of file
diff --git a/node_modules/bullmq/LICENSE b/node_modules/bullmq/LICENSE
new file mode 100644
index 0000000..19ca8e4
--- /dev/null
+++ b/node_modules/bullmq/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2018 BullForce Labs AB and contributors.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/bullmq/README.md b/node_modules/bullmq/README.md
new file mode 100644
index 0000000..14e72b2
--- /dev/null
+++ b/node_modules/bullmq/README.md
@@ -0,0 +1,297 @@
+<div align="center">
+  <br/>
+  <img src="https://user-images.githubusercontent.com/95200/143832033-32e868df-f3b0-4251-97fb-c64809a43d36.png" width="800" />
+  <br/>
+  <br/>
+  <p>
+    The fastest, most reliable, Redis-based distributed queue for Node. <br/>
+    Carefully written for rock solid stability and atomicity.
+  </p>
+  Read the <a href="https://docs.bullmq.io">documentation</a>
+  <br/>
+  <br/>
+  <p>
+    <a href="https://join.slack.com/t/bullmq/shared_invite/zt-1nbtpk6mv-TItWpF9jf3k4yrCaS0PPZA">
+      <img src="https://img.shields.io/badge/Slack-4A154B"/>
+    </a>    
+    <a href="https://badge.fury.io/js/bullmq">
+      <img src="https://badge.fury.io/js/bullmq.svg"/>
+    </a>
+    <a href="https://coveralls.io/github/taskforcesh/bullmq?branch=master">
+      <img src="https://coveralls.io/repos/github/taskforcesh/bullmq/badge.svg?branch=master"/>
+    </a>
+    <a href="https://github.com/semantic-release/semantic-release">
+      <img src="https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg"/>
+    </a>
+    <a href="https://github.com/sponsors/taskforcesh">
+      <img src="https://img.shields.io/badge/sponsor-30363D?style=flat&logo=GitHub-Sponsors&logoColor=EA4AAA"/>
+    </a>
+  </p>
+  <p>
+    <em><a href="https://x.com/bullmqhq">Follow Us</a> for *important* Bull/BullMQ/BullMQ-Pro news and updates!</em>
+  </p>
+</div>
+
+# 🛠 Tutorials
+
+You can find tutorials and news in this blog: https://blog.taskforce.sh/
+
+# News 🚀
+
+## 🌐 Language agnostic BullMQ
+
+Do you need to work with BullMQ on platforms other than Node.js? If so, check out the [BullMQ Proxy](https://github.com/taskforcesh/bullmq-proxy)
+
+# Official FrontEnd
+
+[<img src="https://taskforce.sh/assets/logo_square.png" width="150" alt="Taskforce.sh, Inc" style="padding: 200px"/>](https://taskforce.sh)
+
+Supercharge your queues with a professional front end:
+
+- Get a complete overview of all your queues.
+- Inspect jobs, search, retry, or promote delayed jobs.
+- Metrics and statistics.
+- and many more features.
+
+Sign up at [Taskforce.sh](https://taskforce.sh)
+
+# 🚀 Sponsors 🚀
+
+<table cellspacing="0" cellpadding="0" border="0">
+  <tr>
+    <td>
+      <a href="https://www.dragonflydb.io/">
+        <img src="https://raw.githubusercontent.com/dragonflydb/dragonfly/main/.github/images/logo-full.svg" width=550 alt="Dragonfly" />
+      </a>
+    </td>
+    <td>
+      Dragonfly is a new Redis™ drop-in replacement that is fully compatible with BullMQ and brings some important advantages over Redis™ such as massive
+      better performance by utilizing all CPU cores available and faster and more memory efficient data structures. Read more <a href="https://www.dragonflydb.io/docs/integrations/bullmq">here</a> on how to use it with BullMQ.
+    </td>
+  </tr>
+</table>
+
+# Used by
+
+Some notable organizations using BullMQ:
+
+<table cellspacing="0" cellpadding="0">
+  <tr>
+    <td valign="center">
+       <a href="https://github.com/microsoft/lage">
+        <img
+          src="https://files.gitbook.com/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F-LUuDmt_xXMfG66Rn1GA%2Fuploads%2FUvwInTAmk7hxAViDwJzU%2Fclipart1565701.png?alt=media"
+          width="150"
+          alt="Microsoft"
+        />
+       </a>
+    </td>
+    <td valign="center">
+       <a href="https://github.com/vendure-ecommerce/vendure">
+        <img
+          src="https://files.gitbook.com/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F-LUuDmt_xXMfG66Rn1GA%2Fuploads%2FvT30DUqsi61gL8edn3R2%2Fwordmark-logo.png?alt=media"
+          width="150"
+          alt="Vendure"
+        />
+       </a>
+    </td>
+    <td valign="center">
+       <a href="https://github.com/datawrapper/datawrapper">
+        <img
+          src="https://files.gitbook.com/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F-LUuDmt_xXMfG66Rn1GA%2Fuploads%2FCJ5XmotpBBsuSgD8CilC%2Fdatawrapper-logo.png?alt=media"
+          width="150"
+          alt="Datawrapper"
+        />
+       </a>
+    </td>
+    <td valign="center">
+      <a href="https://github.com/nestjs/bull/tree/master/packages/bullmq">
+        <img
+          src="https://876297641-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2F-LUuDmt_xXMfG66Rn1GA%2Fuploads%2FfAcGye182utFUtPKdLqJ%2FScreenshot%202022-02-15%20at%2011.32.39.png?alt=media&token=29feb550-f0bc-467d-a290-f700701d7d15"
+          width="150"
+          alt="Nest"
+        />
+        </a>
+    </td>
+    <td valign="center">
+      <a href="https://langfuse.com">
+        <img
+          src="https://langfuse.com/langfuse_logo.svg"
+          width="150"
+          alt="Langfuse"
+        />
+        </a>
+    </td>
+    </tr>
+    <tr>
+      <td valign="center">
+       <a href="https://github.com/teamcurri">
+        <img
+          src="https://user-images.githubusercontent.com/659829/161662129-ae645bc4-c1e9-48ff-997e-4cee281a964a.png"
+          width="150"
+          alt="Curri"
+        />
+      </a>
+    </td>
+      <td valign="center">
+       <a href="https://novu.co">
+        <img
+          src="https://assets.super.so/1e9f5a51-c4c6-4fca-b6e8-25fa0186f139/images/0f550019-16db-4a65-90d1-1bdb7d3c5f20/novu-logo-gradient-light-background2x.png"
+          width="150"
+          alt="Novu"
+        />
+      </a>
+    </td>
+    </td>
+      <td valign="center">
+       <a href="https://www.nocodb.com">
+        <img
+          src="https://github.com/nocodb/nocodb/raw/develop/packages/nc-gui/assets/img/icons/512x512.png"
+          width="50"
+          alt="NoCodeDB"
+        />
+      </a>
+    </td>
+    </td>
+      <td valign="center">
+       <a href="https://infisical.com/">
+         <picture>
+          <source media="(prefers-color-scheme: dark)" srcset="https://mintlify.s3-us-west-1.amazonaws.com/infisical/logo/dark.svg">
+          <img
+          src="https://mintlify.s3-us-west-1.amazonaws.com/infisical/logo/light.svg"
+          width="150"
+          alt="Infisical"
+        />
+          </picture>
+      </a>
+    </td>
+    </tr>
+</table>
+
+# The gist
+
+Install:
+
+```
+$ yarn add bullmq
+```
+
+If you use the node-redis adapter (`createNodeRedisClient`), install `redis` v5 or newer (`redis >= 5.0.0`).
+
+Add jobs to the queue:
+
+```ts
+import { Queue } from 'bullmq';
+
+const queue = new Queue('Paint');
+
+queue.add('cars', { color: 'blue' });
+```
+
+Process the jobs in your workers:
+
+```ts
+import { Worker } from 'bullmq';
+
+const worker = new Worker('Paint', async job => {
+  if (job.name === 'cars') {
+    await paintCar(job.data.color);
+  }
+});
+```
+
+Listen to jobs for completion:
+
+```ts
+import { QueueEvents } from 'bullmq';
+
+const queueEvents = new QueueEvents('Paint');
+
+queueEvents.on('completed', ({ jobId }) => {
+  console.log('done painting');
+});
+
+queueEvents.on(
+  'failed',
+  ({ jobId, failedReason }: { jobId: string; failedReason: string }) => {
+    console.error('error painting', failedReason);
+  },
+);
+```
+
+Adds jobs with parent-child relationship:
+
+```ts
+import { FlowProducer } from 'bullmq';
+
+const flow = new FlowProducer();
+
+const originalTree = await flow.add({
+  name: 'root-job',
+  queueName: 'topQueueName',
+  data: {},
+  children: [
+    {
+      name: 'child-job',
+      data: { idx: 0, foo: 'bar' },
+      queueName: 'childrenQueueName',
+      children: [
+        {
+          name: 'grandchild-job',
+          data: { idx: 1, foo: 'bah' },
+          queueName: 'grandChildrenQueueName',
+        },
+        {
+          name: 'grandchild-job',
+          data: { idx: 2, foo: 'baz' },
+          queueName: 'grandChildrenQueueName',
+        },
+      ],
+    },
+    {
+      name: 'child-job',
+      data: { idx: 3, foo: 'foo' },
+      queueName: 'childrenQueueName',
+    },
+  ],
+});
+```
+
+This is just scratching the surface, check all the features and more in the official <a href="https://docs.bullmq.io">documentation</a>
+
+# Feature Comparison
+
+Since there are a few job queue solutions, here is a table comparing them:
+
+| Feature                    | [BullMQ-Pro](https://bullmq.io/#bullmq-pro) | [BullMQ](https://bullmq.io) |      Bull       |  Kue  | Bee      | Agenda |
+| :------------------------- | :-----------------------------------------: | :-------------------------: | :-------------: | :---: | -------- | ------ |
+| Backend                    |                    redis                    |            redis            |      redis      | redis | redis    | mongo  |
+| Observables                |                      ✓                      |                             |                 |       |          |        |
+| Group Rate Limit           |                      ✓                      |                             |                 |       |          |        |
+| Group Support              |                      ✓                      |                             |                 |       |          |        |
+| Batches Support            |                      ✓                      |                             |                 |       |          |        |
+| Parent/Child Dependencies  |                      ✓                      |              ✓              |                 |       |          |        |
+| Deduplication (Debouncing) |                      ✓                      |              ✓              |        ✓        |       |          |        |
+| Deduplication (Throttling) |                      ✓                      |              ✓              |        ✓        |       |          |        |
+| Priorities                 |                      ✓                      |              ✓              |        ✓        |   ✓   |          | ✓      |
+| Concurrency                |                      ✓                      |              ✓              |        ✓        |   ✓   | ✓        | ✓      |
+| Delayed jobs               |                      ✓                      |              ✓              |        ✓        |   ✓   |          | ✓      |
+| Global events              |                      ✓                      |              ✓              |        ✓        |   ✓   |          |        |
+| Rate Limiter               |                      ✓                      |              ✓              |        ✓        |       |          |        |
+| Pause/Resume               |                      ✓                      |              ✓              |        ✓        |   ✓   |          |        |
+| Sandboxed worker           |                      ✓                      |              ✓              |        ✓        |       |          |        |
+| Repeatable jobs            |                      ✓                      |              ✓              |        ✓        |       |          | ✓      |
+| Atomic ops                 |                      ✓                      |              ✓              |        ✓        |       | ✓        |        |
+| Persistence                |                      ✓                      |              ✓              |        ✓        |   ✓   | ✓        | ✓      |
+| UI                         |                      ✓                      |              ✓              |        ✓        |   ✓   |          | ✓      |
+| Optimized for              |               Jobs / Messages               |       Jobs / Messages       | Jobs / Messages | Jobs  | Messages | Jobs   |
+
+## Contributing
+
+Fork the repo, make some changes, submit a pull-request! Here is the [contributing](https://github.com/taskforcesh/bullmq/blob/master/contributing.md) doc that has more details.
+
+# Thanks
+
+Thanks for all the contributors that made this library possible,
+also a special mention to Leon van Kammen that kindly donated
+his npm bullmq repo.
diff --git a/node_modules/bullmq/dist/cjs/classes/abort-controller.js b/node_modules/bullmq/dist/cjs/classes/abort-controller.js
new file mode 100644
index 0000000..7c12028
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/abort-controller.js
@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AbortController = void 0;
+// Note: this Polyfill is only needed for Node versions < 15.4.0
+const node_abort_controller_1 = require("node-abort-controller");
+let AbortControllerImpl;
+// prefer native AbortController implementation if found
+if (globalThis.AbortController) {
+    AbortControllerImpl =
+        globalThis.AbortController;
+}
+else {
+    AbortControllerImpl = node_abort_controller_1.AbortController;
+}
+class AbortController extends AbortControllerImpl {
+}
+exports.AbortController = AbortController;
diff --git a/node_modules/bullmq/dist/cjs/classes/async-fifo-queue.js b/node_modules/bullmq/dist/cjs/classes/async-fifo-queue.js
new file mode 100644
index 0000000..cce0736
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/async-fifo-queue.js
@@ -0,0 +1,171 @@
+"use strict";
+/**
+ * (c) 2017-2025 BullForce Labs AB, MIT Licensed.
+ * @see LICENSE.md
+ *
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AsyncFifoQueue = void 0;
+class Node {
+    constructor(value) {
+        this.value = undefined;
+        this.next = null;
+        this.value = value;
+    }
+}
+class LinkedList {
+    constructor() {
+        this.length = 0;
+        this.head = null;
+        this.tail = null;
+    }
+    push(value) {
+        const newNode = new Node(value);
+        if (!this.length) {
+            this.head = newNode;
+        }
+        else {
+            this.tail.next = newNode;
+        }
+        this.tail = newNode;
+        this.length += 1;
+        return newNode;
+    }
+    shift() {
+        if (!this.length) {
+            return null;
+        }
+        else {
+            const head = this.head;
+            this.head = this.head.next;
+            this.length -= 1;
+            return head;
+        }
+    }
+}
+/**
+ * AsyncFifoQueue
+ *
+ * A minimal FIFO queue for asynchronous operations. Allows adding asynchronous operations
+ * and consume them in the order they are resolved.
+ */
+class AsyncFifoQueue {
+    constructor(ignoreErrors = false) {
+        this.ignoreErrors = ignoreErrors;
+        /**
+         * A queue of completed promises. As the pending
+         * promises are resolved, they are added to this queue.
+         */
+        this.queue = new LinkedList();
+        /**
+         * A set of pending promises.
+         */
+        this.pending = new Set();
+        this.newPromise();
+    }
+    /**
+     * Adds a promise to the queue. When it resolves, its value is enqueued
+     * and, if a consumer is waiting via {@link fetch}, the next pending
+     * promise is resolved with the value.
+     *
+     * @param promise - The asynchronous operation to add to the queue.
+     */
+    add(promise) {
+        this.pending.add(promise);
+        promise
+            .then(data => {
+            this.pending.delete(promise);
+            if (this.queue.length === 0) {
+                this.resolvePromise(data);
+            }
+            this.queue.push(data);
+        })
+            .catch(err => {
+            // Ignore errors
+            if (this.ignoreErrors) {
+                this.queue.push(undefined);
+            }
+            this.pending.delete(promise);
+            this.rejectPromise(err);
+        });
+    }
+    /**
+     * Waits for all currently pending promises to settle.
+     *
+     * @returns A promise that resolves once every in-flight promise has resolved.
+     */
+    async waitAll() {
+        await Promise.all(this.pending);
+    }
+    /**
+     * Returns the total number of items currently tracked by the queue,
+     * including both pending (in-flight) promises and resolved items that
+     * have not yet been fetched.
+     *
+     * @returns The sum of pending and queued items.
+     */
+    numTotal() {
+        return this.pending.size + this.queue.length;
+    }
+    /**
+     * Returns the number of promises that are still pending (in-flight).
+     *
+     * @returns The number of unresolved promises currently in the queue.
+     */
+    numPending() {
+        return this.pending.size;
+    }
+    /**
+     * Returns the number of items that have already resolved but have not
+     * yet been fetched by a consumer.
+     *
+     * @returns The number of resolved items waiting to be consumed.
+     */
+    numQueued() {
+        return this.queue.length;
+    }
+    resolvePromise(data) {
+        this.resolve(data);
+        this.newPromise();
+    }
+    rejectPromise(err) {
+        this.reject(err);
+        this.newPromise();
+    }
+    newPromise() {
+        this.nextPromise = new Promise((resolve, reject) => {
+            this.resolve = resolve;
+            this.reject = reject;
+        });
+    }
+    async wait() {
+        return this.nextPromise;
+    }
+    /**
+     * Fetches the next resolved item from the queue in FIFO order. If no
+     * items are currently resolved but pending promises exist, it waits
+     * until the next one resolves.
+     *
+     * @returns The next resolved value, or `undefined` if there are no
+     * pending or queued items.
+     */
+    async fetch() {
+        var _a;
+        if (this.pending.size === 0 && this.queue.length === 0) {
+            return;
+        }
+        while (this.queue.length === 0) {
+            try {
+                await this.wait();
+            }
+            catch (err) {
+                // Ignore errors
+                if (!this.ignoreErrors) {
+                    console.error('Unexpected Error in AsyncFifoQueue', err);
+                }
+            }
+        }
+        return (_a = this.queue.shift()) === null || _a === void 0 ? void 0 : _a.value;
+    }
+}
+exports.AsyncFifoQueue = AsyncFifoQueue;
diff --git a/node_modules/bullmq/dist/cjs/classes/backoffs.js b/node_modules/bullmq/dist/cjs/classes/backoffs.js
new file mode 100644
index 0000000..4c83301
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/backoffs.js
@@ -0,0 +1,60 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Backoffs = void 0;
+class Backoffs {
+    static normalize(backoff) {
+        if (Number.isFinite(backoff)) {
+            return {
+                type: 'fixed',
+                delay: backoff,
+            };
+        }
+        else if (backoff) {
+            return backoff;
+        }
+    }
+    static calculate(backoff, attemptsMade, err, job, customStrategy) {
+        if (backoff) {
+            const strategy = lookupStrategy(backoff, customStrategy);
+            return strategy(attemptsMade, backoff.type, err, job);
+        }
+    }
+}
+exports.Backoffs = Backoffs;
+Backoffs.builtinStrategies = {
+    fixed: function (delay, jitter = 0) {
+        return function () {
+            if (jitter > 0) {
+                const minDelay = delay * (1 - jitter);
+                return Math.floor(Math.random() * delay * jitter + minDelay);
+            }
+            else {
+                return delay;
+            }
+        };
+    },
+    exponential: function (delay, jitter = 0) {
+        return function (attemptsMade) {
+            if (jitter > 0) {
+                const maxDelay = Math.round(Math.pow(2, attemptsMade - 1) * delay);
+                const minDelay = maxDelay * (1 - jitter);
+                return Math.floor(Math.random() * maxDelay * jitter + minDelay);
+            }
+            else {
+                return Math.round(Math.pow(2, attemptsMade - 1) * delay);
+            }
+        };
+    },
+};
+function lookupStrategy(backoff, customStrategy) {
+    if (backoff.type in Backoffs.builtinStrategies) {
+        return Backoffs.builtinStrategies[backoff.type](backoff.delay, backoff.jitter);
+    }
+    else if (customStrategy) {
+        return customStrategy;
+    }
+    else {
+        throw new Error(`Unknown backoff strategy ${backoff.type}.
+      If a custom backoff strategy is used, specify it when the queue is created.`);
+    }
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/bun-redis-client.js b/node_modules/bullmq/dist/cjs/classes/bun-redis-client.js
new file mode 100644
index 0000000..f0922db
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/bun-redis-client.js
@@ -0,0 +1,1016 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createBunRedisClient = createBunRedisClient;
+const crypto_1 = require("crypto");
+const events_1 = require("events");
+const stream_1 = require("stream");
+const connection_closed_error_1 = require("./errors/connection-closed-error");
+function normalizeScriptArgs(args) {
+    return args.length === 1 && Array.isArray(args[0]) ? args[0] : args;
+}
+/**
+ * Returns true when the error is one that Bun's Redis client throws because
+ * the underlying TCP connection has been closed or is in the process of being
+ * closed (either intentionally via disconnect()/quit() or unexpectedly).
+ */
+function isBunConnectionClosedError(err) {
+    var _a;
+    const msg = (_a = err === null || err === void 0 ? void 0 : err.message) !== null && _a !== void 0 ? _a : '';
+    return (msg === 'Socket closed unexpectedly' ||
+        msg.startsWith('Connection closed') ||
+        msg === 'Connection is closed.' ||
+        msg === 'Connection has failed');
+}
+function normalizeStringCollection(reply) {
+    if (reply == null) {
+        return [];
+    }
+    if (Array.isArray(reply)) {
+        return reply.map(String);
+    }
+    if (reply instanceof Set) {
+        return Array.from(reply, item => String(item));
+    }
+    return [];
+}
+function createBunRedisClient(client, opts) {
+    return new BunRedisAdapter(client, opts);
+}
+/**
+ * Full wrapper for Bun's RedisClient.
+ *
+ * Key design decisions vs node-redis adapter:
+ * 1. No error noise on close: Bun's close() cleanly terminates pending
+ *    commands without throwing DisconnectsClientError.
+ * 2. EventEmitter bridging: Bun uses `onconnect`/`onclose` callbacks;
+ *    we bridge those into standard EventEmitter events.
+ * 3. Raw command execution: Bun's `send()` is the universal escape hatch
+ *    for commands without convenience methods.
+ */
+class BunRedisAdapter extends events_1.EventEmitter {
+    get status() {
+        if (this.statusOverride) {
+            return this.statusOverride;
+        }
+        if (this.closed) {
+            return 'end';
+        }
+        if (this.raw.connected) {
+            return 'ready';
+        }
+        return this.hasConnected ? 'end' : 'wait';
+    }
+    set status(val) {
+        if (val === 'end') {
+            this.closing = true;
+            this.closed = true;
+            // Do not call raw.close() here – disconnect()/quit() handle closing.
+        }
+        this.statusOverride = val;
+    }
+    get options() {
+        return {};
+    }
+    set options(_val) {
+        // no-op
+    }
+    constructor(raw, opts) {
+        super();
+        this.raw = raw;
+        this.scripts = new Map();
+        // Tracks which script SHAs have been loaded server-side on the current
+        // raw connection. Cleared on (re)connect since SCRIPT cache is per-server
+        // and is also lost across our internal raw-client swap.
+        this.loadedScriptShas = new Set();
+        this.hasConnected = false;
+        this.closed = false;
+        this.closing = false;
+        // Auto-reconnect state
+        this.reconnecting = false;
+        this.reconnectTimer = null;
+        this.reconnectAttempts = 0;
+        this.maxReconnectDelay = 20000; // cap at 20s (matches ioredis default)
+        this.isCluster = false;
+        this._setupCallbacks();
+        // ioredis auto-connects by default. Mimic that behavior unless
+        // lazyConnect is set.
+        if (!(opts === null || opts === void 0 ? void 0 : opts.lazyConnect)) {
+            this.connect().catch(() => {
+                // Connection errors will be emitted via the 'error' event.
+            });
+        }
+    }
+    /**
+     * Wire up Bun's callback-style events into EventEmitter and auto-reconnect.
+     */
+    _setupCallbacks() {
+        // Bridge Bun's callback-style events into EventEmitter.
+        // When connectionName is set (via duplicate()), delay the 'ready'
+        // event until CLIENT SETNAME completes so callers waiting for 'ready'
+        // see the name already applied.
+        this.raw.onconnect = () => {
+            this.hasConnected = true;
+            this.closed = false;
+            this.closing = false;
+            this.reconnecting = false;
+            this.reconnectAttempts = 0;
+            this.statusOverride = undefined;
+            // The server-side SCRIPT cache is gone for this (possibly new) raw
+            // connection. Force re-loading on next use.
+            this.loadedScriptShas.clear();
+            if (this.connectionName) {
+                this.clientSetName(this.connectionName).then(() => this.emit('ready'), () => this.emit('ready'));
+            }
+            else {
+                this.emit('ready');
+            }
+        };
+        this.raw.onclose = (error) => {
+            if (this.closing) {
+                // User-initiated close – no reconnect
+                this.closed = true;
+                this.emit('close');
+                this.emit('end');
+                return;
+            }
+            // Unexpected close – attempt auto-reconnect
+            this.closed = true;
+            this.emit('close');
+            if (error) {
+                this.emit('error', error);
+            }
+            this._scheduleReconnect();
+        };
+    }
+    /**
+     * Schedule a reconnection attempt with exponential backoff.
+     */
+    _scheduleReconnect() {
+        if (this.closing || this.reconnecting) {
+            return;
+        }
+        this.reconnecting = true;
+        this.reconnectAttempts++;
+        // Exponential backoff: min(e^attempts, 20000) ms, floored at 1000ms
+        const delay = Math.max(Math.min(Math.exp(this.reconnectAttempts) * 100, this.maxReconnectDelay), 1000);
+        this.reconnectTimer = setTimeout(async () => {
+            this.reconnectTimer = null;
+            if (this.closing) {
+                this.reconnecting = false;
+                return;
+            }
+            try {
+                // Create a fresh raw client with the same URL
+                const BunRedisClient = this.raw
+                    .constructor;
+                const newRaw = new BunRedisClient(this.raw.url);
+                // Swap the raw client reference
+                this.raw = newRaw;
+                this.closed = false;
+                this.connecting = undefined;
+                // Re-wire callbacks on the new raw client
+                this._setupCallbacks();
+                // Connect – onconnect callback will emit 'ready' and reset state
+                await newRaw.connect();
+            }
+            catch (_err) {
+                // Reconnect failed – schedule another attempt
+                this.reconnecting = false;
+                if (!this.closing) {
+                    this._scheduleReconnect();
+                }
+            }
+        }, delay);
+    }
+    // ---------------------------------------------------------------
+    // Connection lifecycle
+    // ---------------------------------------------------------------
+    async connect() {
+        if (this.raw.connected) {
+            this.hasConnected = true;
+            this.closed = false;
+            this.closing = false;
+            this.statusOverride = undefined;
+            return;
+        }
+        if (!this.connecting) {
+            this.closed = false;
+            this.closing = false;
+            this.statusOverride = undefined;
+            // If the raw client was previously closed, Bun doesn't support
+            // reconnecting on the same instance. Create a fresh raw client.
+            if (this.hasConnected && !this.raw.connected) {
+                const BunRedisClient = this.raw
+                    .constructor;
+                this.raw = new BunRedisClient(this.raw.url);
+                this._setupCallbacks();
+            }
+            this.connecting = this.raw
+                .connect()
+                .then(() => {
+                this.hasConnected = true;
+                this.closed = false;
+                this.closing = false;
+                this.statusOverride = undefined;
+            })
+                .finally(() => {
+                this.connecting = undefined;
+            });
+        }
+        await this.connecting;
+    }
+    _closeRaw() {
+        // Cancel any pending reconnect
+        if (this.reconnectTimer) {
+            clearTimeout(this.reconnectTimer);
+            this.reconnectTimer = null;
+        }
+        this.reconnecting = false;
+        const raw = this.raw;
+        raw.onconnect = () => { };
+        raw.onclose = () => { };
+        raw.onerror = () => { };
+        if (raw.connected) {
+            // Defer close so that Bun's native error is raised outside the
+            // calling test's synchronous scope, preventing it from being
+            // attributed to the test as an unhandled error.
+            setImmediate(() => {
+                try {
+                    if (raw.connected) {
+                        raw.close();
+                    }
+                }
+                catch (_err) {
+                    // swallow
+                }
+            });
+        }
+    }
+    disconnect(reconnect) {
+        if (this.closed && !reconnect) {
+            return;
+        }
+        if (reconnect) {
+            // Close the current raw connection and schedule a reconnect.
+            // Don't set closing=true so the reconnect logic is allowed to fire.
+            this.closed = true;
+            this.statusOverride = undefined;
+            const raw = this.raw;
+            raw.onclose = () => { };
+            if (raw.connected) {
+                setImmediate(() => {
+                    try {
+                        if (raw.connected) {
+                            raw.close();
+                        }
+                    }
+                    catch (_err) {
+                        // swallow
+                    }
+                });
+            }
+            this.emit('close');
+            this._scheduleReconnect();
+        }
+        else {
+            this.closing = true;
+            this.closed = true;
+            this.statusOverride = 'end';
+            this._closeRaw();
+            this.emit('close');
+            this.emit('end');
+        }
+    }
+    async quit() {
+        if (this.closed) {
+            setImmediate(() => {
+                this.emit('end');
+                this.emit('close');
+            });
+            return 'OK';
+        }
+        this.closing = true;
+        this.closed = true;
+        this.statusOverride = 'end';
+        this._closeRaw();
+        // Emit on next tick so callers can register listeners after await quit()
+        setImmediate(() => {
+            this.emit('end');
+            this.emit('close');
+        });
+        return 'OK';
+    }
+    duplicate(...args) {
+        // Bun's duplicate() is async, but IRedisClient.duplicate() is sync.
+        // We create a new RedisClient with the same URL/options instead.
+        // The raw client constructor in Bun doesn't connect until connect() or
+        // first command, so this is safe.
+        const BunRedisClient = this.raw
+            .constructor;
+        const dup = new BunRedisClient(this.raw.url);
+        const adapter = new BunRedisAdapter(dup);
+        // Copy registered scripts to the duplicate
+        for (const [name, script] of this.scripts) {
+            adapter.scripts.set(name, script);
+            adapter[name] = (...a) => adapter.runCommand(name, a);
+        }
+        // Handle connectionName option (ioredis calls CLIENT SETNAME automatically).
+        // Setting connectionName ensures the onconnect handler applies CLIENT
+        // SETNAME before emitting 'ready'.
+        const opts = args[0];
+        if (opts && typeof opts === 'object' && opts.connectionName) {
+            adapter.connectionName = opts.connectionName;
+        }
+        return adapter;
+    }
+    // ---------------------------------------------------------------
+    // Lua script engine
+    // ---------------------------------------------------------------
+    defineCommand(name, definition) {
+        const sha = (0, crypto_1.createHash)('sha1').update(definition.lua).digest('hex');
+        this.scripts.set(name, {
+            sha,
+            lua: definition.lua,
+            numberOfKeys: definition.numberOfKeys,
+        });
+        this[name] = (...args) => this.runCommand(name, args);
+        // Note: We intentionally skip SCRIPT LOAD here. The first EVALSHA call
+        // will get a NOSCRIPT error and fall back to EVAL, which also loads the
+        // script for subsequent calls. This avoids fire-and-forget sendCommand
+        // calls that can trigger spurious unhandled rejection reports in Bun.
+    }
+    async runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}"`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const keys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Build EVALSHA args: sha numkeys key... arg...
+        const evalArgs = [sha, String(keys.length), ...keys, ...argv];
+        const execute = async () => {
+            var _a, _b;
+            try {
+                const result = await this.sendCommand('EVALSHA', evalArgs);
+                this.loadedScriptShas.add(sha);
+                return result;
+            }
+            catch (err) {
+                if ((_b = (_a = err === null || err === void 0 ? void 0 : err.message) === null || _a === void 0 ? void 0 : _a.includes) === null || _b === void 0 ? void 0 : _b.call(_a, 'NOSCRIPT')) {
+                    const evalLuaArgs = [lua, String(keys.length), ...keys, ...argv];
+                    const result = await this.sendCommand('EVAL', evalLuaArgs);
+                    this.loadedScriptShas.add(sha);
+                    return result;
+                }
+                throw err;
+            }
+        };
+        return execute();
+    }
+    /**
+     * Ensure the given scripts are present in the server-side SCRIPT cache so
+     * that subsequent EVALSHA calls (e.g. inside a MULTI/EXEC) won't fail with
+     * NOSCRIPT. Each script is SCRIPT LOAD'd at most once per connection.
+     */
+    async ensureScriptsLoaded(scripts) {
+        const toLoad = [];
+        const seen = new Set();
+        for (const s of scripts) {
+            if (this.loadedScriptShas.has(s.sha) || seen.has(s.sha)) {
+                continue;
+            }
+            seen.add(s.sha);
+            toLoad.push(s);
+        }
+        if (toLoad.length === 0) {
+            return;
+        }
+        await Promise.all(toLoad.map(async (s) => {
+            await this.sendCommand('SCRIPT', ['LOAD', s.lua]);
+            this.loadedScriptShas.add(s.sha);
+        }));
+    }
+    sendCommand(command, args) {
+        // If the connection is already closing/closed, return a rejected promise.
+        if (this.closing || this.closed) {
+            return Promise.reject(new connection_closed_error_1.ConnectionClosedError('Connection is closed'));
+        }
+        // Send directly to the underlying Bun client. Redis protocol guarantees
+        // responses arrive in the same order as requests on a single connection,
+        // so concurrent send() calls are safe and enable implicit pipelining
+        // (multiple commands written to the socket before any response is read).
+        // MULTI/EXEC transactions don't go through this path — they are issued
+        // as a synchronous burst of raw `send()` calls in
+        // `BunRedisTransaction.exec()`, which guarantees the MULTI…EXEC frames
+        // are written contiguously without any other command interleaving.
+        return this.raw.send(command, args).catch((err) => {
+            if (isBunConnectionClosedError(err)) {
+                return Promise.reject(new connection_closed_error_1.ConnectionClosedError(this.closing || this.closed ? 'Connection is closed' : err.message, err));
+            }
+            throw err;
+        });
+    }
+    // ---------------------------------------------------------------
+    // Pipeline / Transaction
+    // ---------------------------------------------------------------
+    multi() {
+        return new BunRedisTransaction(this.raw, this.scripts, true, this);
+    }
+    pipeline() {
+        return new BunRedisTransaction(this.raw, this.scripts, false, this);
+    }
+    // ---------------------------------------------------------------
+    // Hash commands
+    // ---------------------------------------------------------------
+    async hgetall(key) {
+        const result = await this.sendCommand('HGETALL', [key]);
+        if (!result || (Array.isArray(result) && result.length === 0)) {
+            return {};
+        }
+        // RESP3 returns a map, RESP2 returns flat array [field, value, ...]
+        if (Array.isArray(result)) {
+            const obj = {};
+            for (let i = 0; i < result.length; i += 2) {
+                obj[String(result[i])] = String(result[i + 1]);
+            }
+            return obj;
+        }
+        // If it's already an object (RESP3 map)
+        return result;
+    }
+    async hget(key, field) {
+        const result = await this.sendCommand('HGET', [key, field]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async hmget(key, ...fields) {
+        const result = await this.sendCommand('HMGET', [key, ...fields]);
+        return (result || []).map((v) => v !== null && v !== void 0 ? v : null);
+    }
+    async hset(key, dataOrField, ...rest) {
+        let args;
+        if (typeof dataOrField === 'object') {
+            args = [key];
+            for (const [k, v] of Object.entries(dataOrField)) {
+                args.push(k, String(v));
+            }
+        }
+        else {
+            args = [key, dataOrField, String(rest[0])];
+            for (let i = 1; i < rest.length; i += 2) {
+                args.push(String(rest[i]), String(rest[i + 1]));
+            }
+        }
+        return await this.sendCommand('HSET', args);
+    }
+    async hdel(key, ...fields) {
+        return await this.sendCommand('HDEL', [key, ...fields]);
+    }
+    async hexists(key, field) {
+        const result = await this.sendCommand('HEXISTS', [key, field]);
+        // Bun returns boolean for some commands; normalize to 0/1
+        return result === true || result === 1 ? 1 : 0;
+    }
+    // ---------------------------------------------------------------
+    // String commands
+    // ---------------------------------------------------------------
+    async get(key) {
+        const result = await this.sendCommand('GET', [key]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async set(key, value, options) {
+        const args = [key, String(value)];
+        if ((options === null || options === void 0 ? void 0 : options.PX) != null) {
+            args.push('PX', String(options.PX));
+        }
+        else if ((options === null || options === void 0 ? void 0 : options.EX) != null) {
+            args.push('EX', String(options.EX));
+        }
+        return await this.sendCommand('SET', args);
+    }
+    async del(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.sendCommand('DEL', keys);
+    }
+    // ---------------------------------------------------------------
+    // Sorted set commands
+    // ---------------------------------------------------------------
+    async zrange(key, start, end, options) {
+        const args = [key, String(start), String(end)];
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            args.push('WITHSCORES');
+        }
+        const result = await this.sendCommand('ZRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Bun returns WITHSCORES as [[member, score], ...] instead of flat [member, score, ...]
+        if ((options === null || options === void 0 ? void 0 : options.WITHSCORES) && result.length > 0 && Array.isArray(result[0])) {
+            return result.flatMap((pair) => [String(pair[0]), String(pair[1])]);
+        }
+        return result.map(String);
+    }
+    async zrevrange(key, start, end, options) {
+        const args = [key, String(start), String(end)];
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            args.push('WITHSCORES');
+        }
+        // ZREVRANGE is deprecated; use ZRANGE REV
+        args.push('REV');
+        const result = await this.sendCommand('ZRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Bun returns WITHSCORES as [[member, score], ...] instead of flat [member, score, ...]
+        if ((options === null || options === void 0 ? void 0 : options.WITHSCORES) && result.length > 0 && Array.isArray(result[0])) {
+            return result.flatMap((pair) => [String(pair[0]), String(pair[1])]);
+        }
+        return result.map(String);
+    }
+    async zcard(key) {
+        return await this.sendCommand('ZCARD', [key]);
+    }
+    async zscore(key, member) {
+        const score = await this.sendCommand('ZSCORE', [key, member]);
+        return score != null ? String(score) : null;
+    }
+    // ---------------------------------------------------------------
+    // List commands
+    // ---------------------------------------------------------------
+    async lrange(key, start, end) {
+        const result = await this.sendCommand('LRANGE', [
+            key,
+            String(start),
+            String(end),
+        ]);
+        return (result || []).map(String);
+    }
+    async llen(key) {
+        return await this.sendCommand('LLEN', [key]);
+    }
+    async ltrim(key, start, end) {
+        await this.sendCommand('LTRIM', [key, String(start), String(end)]);
+        return 'OK';
+    }
+    async lpos(key, value) {
+        const result = await this.sendCommand('LPOS', [key, value]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    // ---------------------------------------------------------------
+    // Set commands
+    // ---------------------------------------------------------------
+    async smembers(key) {
+        const result = await this.sendCommand('SMEMBERS', [key]);
+        return normalizeStringCollection(result);
+    }
+    // ---------------------------------------------------------------
+    // Stream commands
+    // ---------------------------------------------------------------
+    async xadd(key, id, fields, options) {
+        const args = [key];
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            args.push('MAXLEN');
+            if (options.approximate !== false) {
+                args.push('~');
+            }
+            args.push(String(options.MAXLEN));
+        }
+        args.push(id);
+        for (const [k, v] of Object.entries(fields)) {
+            args.push(k, String(v));
+        }
+        return await this.raw.send('XADD', args);
+    }
+    async xread(streams, options) {
+        const args = [];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            args.push('BLOCK', String(options.BLOCK));
+        }
+        args.push('STREAMS');
+        for (const s of streams) {
+            args.push(s.key);
+        }
+        for (const s of streams) {
+            args.push(s.id);
+        }
+        let result;
+        try {
+            result = await this.sendCommand('XREAD', args);
+        }
+        catch (err) {
+            if (this.closing) {
+                return null;
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        // Normalize to ioredis format: [[streamName, [[id, [field, value, …]], …]], …]
+        // Bun returns a map/object: { streamName: [[id, [field, value, ...]], ...], ... }
+        if (Array.isArray(result)) {
+            // RESP2 nested array format
+            return result.map((stream) => {
+                const streamName = String(stream[0]);
+                const entries = (stream[1] || []).map((entry) => {
+                    const entryId = String(entry[0]);
+                    const fields = (entry[1] || []).map(String);
+                    return [entryId, fields];
+                });
+                return [streamName, entries];
+            });
+        }
+        // Bun returns an object keyed by stream name
+        return Object.entries(result).map(([streamName, rawEntries]) => {
+            const entries = (rawEntries || []).map((entry) => {
+                const entryId = String(entry[0]);
+                const fields = (entry[1] || []).map(String);
+                return [entryId, fields];
+            });
+            return [streamName, entries];
+        });
+    }
+    async xtrim(key, strategy, threshold, options) {
+        const args = [key, strategy];
+        if ((options === null || options === void 0 ? void 0 : options.approximate) !== false) {
+            args.push('~');
+        }
+        args.push(String(threshold));
+        return await this.sendCommand('XTRIM', args);
+    }
+    // ---------------------------------------------------------------
+    // Blocking commands
+    // ---------------------------------------------------------------
+    async bzpopmin(key, timeout) {
+        let result;
+        try {
+            result = await this.sendCommand('BZPOPMIN', [key, String(timeout)]);
+        }
+        catch (err) {
+            if (this.closing) {
+                return null;
+            }
+            throw err;
+        }
+        if (!result || result.length === 0) {
+            return null;
+        }
+        return [String(result[0]), String(result[1]), String(result[2])];
+    }
+    // ---------------------------------------------------------------
+    // Server / admin commands
+    // ---------------------------------------------------------------
+    async info() {
+        return await this.sendCommand('INFO', []);
+    }
+    async clientSetName(name) {
+        return await this.sendCommand('CLIENT', ['SETNAME', name]);
+    }
+    async clientList() {
+        return await this.sendCommand('CLIENT', ['LIST']);
+    }
+    // ---------------------------------------------------------------
+    // Key scanning
+    // ---------------------------------------------------------------
+    async scan(cursor, options) {
+        const args = [String(cursor)];
+        if (options === null || options === void 0 ? void 0 : options.MATCH) {
+            args.push('MATCH', options.MATCH);
+        }
+        if (options === null || options === void 0 ? void 0 : options.COUNT) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        const result = await this.sendCommand('SCAN', args);
+        // SCAN returns [cursor, [key, key, ...]]
+        const keys = result[1];
+        return [String(result[0]), Array.isArray(keys) ? keys.map(String) : []];
+    }
+    scanStream(options) {
+        const adapter = this;
+        let cursor = '0';
+        let started = false;
+        const readable = new stream_1.Readable({
+            objectMode: true,
+            async read() {
+                if (started && cursor === '0') {
+                    readable.push(null); // EOF
+                    return;
+                }
+                started = true;
+                try {
+                    // Loop until we have keys to push or reach end of scan
+                    while (true) {
+                        const [nextCursor, keys] = await adapter.scan(cursor, {
+                            MATCH: options.match,
+                            COUNT: options.count,
+                        });
+                        cursor = nextCursor;
+                        if (keys.length > 0) {
+                            readable.push(keys);
+                            if (cursor === '0') {
+                                readable.push(null); // EOF
+                            }
+                            return;
+                        }
+                        if (cursor === '0') {
+                            readable.push(null); // EOF
+                            return;
+                        }
+                        // No keys but scan not complete — continue scanning
+                    }
+                }
+                catch (err) {
+                    readable.destroy(err);
+                }
+            },
+        });
+        return readable;
+    }
+    // ---------------------------------------------------------------
+    // Extra Redis commands used by BullMQ internals
+    // ---------------------------------------------------------------
+    async keys(pattern) {
+        const result = await this.sendCommand('KEYS', [pattern]);
+        return (result || []).map(String);
+    }
+    async exists(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        const result = await this.sendCommand('EXISTS', keys);
+        // Bun may return boolean for single key
+        if (typeof result === 'boolean') {
+            return result ? 1 : 0;
+        }
+        return result;
+    }
+    async zadd(key, ...args) {
+        // ioredis format: zadd(key, score, member, score, member, ...)
+        const cmdArgs = [key];
+        for (let i = 0; i < args.length; i += 2) {
+            cmdArgs.push(String(args[i]), String(args[i + 1]));
+        }
+        return await this.sendCommand('ZADD', cmdArgs);
+    }
+    async zrem(key, ...members) {
+        return await this.sendCommand('ZREM', [key, ...members]);
+    }
+    async xlen(key) {
+        return await this.sendCommand('XLEN', [key]);
+    }
+    async xrevrange(key, end, start, ...rest) {
+        const args = [key, end, start];
+        if (rest[0] === 'COUNT') {
+            args.push('COUNT', String(rest[1]));
+        }
+        const result = await this.sendCommand('XREVRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Normalize to ioredis format: [[id, [field, value, …]], …]
+        return result.map((msg) => [
+            String(msg[0]),
+            (msg[1] || []).map(String),
+        ]);
+    }
+    async sadd(key, ...members) {
+        return await this.sendCommand('SADD', [key, ...members.map(String)]);
+    }
+    async scard(key) {
+        return await this.sendCommand('SCARD', [key]);
+    }
+    async lpush(key, ...values) {
+        return await this.sendCommand('LPUSH', [key, ...values]);
+    }
+    async rpop(key) {
+        const result = await this.sendCommand('RPOP', [key]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async incr(key) {
+        return await this.sendCommand('INCR', [key]);
+    }
+    async incrby(key, increment) {
+        return await this.sendCommand('INCRBY', [key, String(increment)]);
+    }
+    async flushall() {
+        return await this.sendCommand('FLUSHALL', []);
+    }
+}
+// ---------------------------------------------------------------------------
+// Transaction / Pipeline wrapper
+//
+// Bun doesn't have a native MULTI object. We buffer commands and execute
+// them within a MULTI/EXEC block using send().
+// ---------------------------------------------------------------------------
+class BunRedisTransaction {
+    constructor(raw, scripts, transactional, adapter) {
+        this.raw = raw;
+        this.scripts = scripts;
+        this.transactional = transactional;
+        this.adapter = adapter;
+        this.commands = [];
+        this.transformers = [];
+        // Scripts that need to be SCRIPT LOAD'd before exec() so the EVALSHA
+        // calls queued in this transaction won't NOSCRIPT.
+        this.scriptsToLoad = [];
+    }
+    addCommand(cmd, args, transformer) {
+        this.commands.push({ cmd, args });
+        this.transformers.push(transformer || ((v) => v));
+    }
+    hgetall(key) {
+        this.addCommand('HGETALL', [key], (val) => {
+            if (!val || (Array.isArray(val) && val.length === 0)) {
+                return {};
+            }
+            if (Array.isArray(val)) {
+                const obj = {};
+                for (let i = 0; i < val.length; i += 2) {
+                    obj[String(val[i])] = String(val[i + 1]);
+                }
+                return obj;
+            }
+            return val;
+        });
+        return this;
+    }
+    hset(key, data) {
+        const args = [key];
+        for (const [k, v] of Object.entries(data)) {
+            args.push(k, String(v));
+        }
+        this.addCommand('HSET', args);
+        return this;
+    }
+    hscan(key, cursor, options) {
+        const args = [key, String(cursor)];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        this.addCommand('HSCAN', args, (val) => {
+            // Normalize to ioredis format: [cursor, [field, value, field, value, ...]]
+            if (!val) {
+                return ['0', []];
+            }
+            if (Array.isArray(val)) {
+                return [String(val[0]), normalizeStringCollection(val[1])];
+            }
+            return ['0', []];
+        });
+        return this;
+    }
+    smembers(key) {
+        this.addCommand('SMEMBERS', [key], (val) => normalizeStringCollection(val));
+        return this;
+    }
+    sscan(key, cursor, options) {
+        const args = [key, String(cursor)];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        this.addCommand('SSCAN', args, (val) => {
+            // Normalize to ioredis format: [cursor, [member, member, ...]]
+            if (!val) {
+                return ['0', []];
+            }
+            if (Array.isArray(val)) {
+                return [String(val[0]), normalizeStringCollection(val[1])];
+            }
+            return ['0', []];
+        });
+        return this;
+    }
+    zrange(key, start, end) {
+        this.addCommand('ZRANGE', [key, String(start), String(end)], (val) => Array.isArray(val) ? val.map(String) : []);
+        return this;
+    }
+    lrange(key, start, end) {
+        this.addCommand('LRANGE', [key, String(start), String(end)], (val) => Array.isArray(val) ? val.map(String) : []);
+        return this;
+    }
+    llen(key) {
+        this.addCommand('LLEN', [key]);
+        return this;
+    }
+    del(...keys) {
+        if (keys.length > 0) {
+            this.addCommand('DEL', keys);
+        }
+        return this;
+    }
+    runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}" in transaction`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, numberOfKeys } = script;
+        const cmdKeys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Use EVALSHA for performance. The script is loaded server-side
+        // via SCRIPT LOAD in exec() before any commands are sent.
+        this.scriptsToLoad.push(script);
+        this.addCommand('EVALSHA', [
+            sha,
+            String(cmdKeys.length),
+            ...cmdKeys,
+            ...argv,
+        ]);
+        return this;
+    }
+    async exec() {
+        if (this.commands.length === 0) {
+            return [];
+        }
+        // Make sure any Lua scripts referenced via EVALSHA are loaded on the
+        // server before we send EVALSHA inside the pipeline / MULTI block.
+        if (this.scriptsToLoad.length > 0) {
+            await this.adapter.ensureScriptsLoaded(this.scriptsToLoad);
+        }
+        if (!this.transactional) {
+            // Fire all commands concurrently for implicit pipelining (like ioredis).
+            // This ensures all commands are written to the socket together, preventing
+            // other operations from interleaving between pipeline commands.
+            const settled = await Promise.allSettled(this.commands.map(({ cmd, args }) => this.adapter.sendCommand(cmd, args)));
+            return settled.map((result, i) => {
+                if (result.status === 'rejected') {
+                    return [result.reason, null];
+                }
+                const transformer = this.transformers[i];
+                const value = transformer ? transformer(result.value) : result.value;
+                return [null, value];
+            });
+        }
+        // Execute as a pipelined MULTI/EXEC block. Redis supports multiple
+        // MULTI/EXEC blocks pipelined on the same connection — each MULTI starts
+        // a new transaction context and EXEC commits it, responses arrive in
+        // order. We fire MULTI + all commands + EXEC synchronously (no await
+        // between them) so they're written to the socket buffer as one contiguous
+        // burst with no opportunity for interleaving from other async contexts.
+        //
+        // The MULTI and per-command `send()` calls are intentionally fire-and-
+        // forget for performance, but their returned promises must still have a
+        // rejection handler attached to avoid Bun emitting "unhandled promise
+        // rejection" warnings if the connection drops or Redis returns an error
+        // reply before we reach EXEC. The actual failure is reported through the
+        // awaited EXEC promise (which Redis rejects in the same situations), or
+        // bubbles up via the surrounding `try/catch`.
+        const swallow = (_) => {
+            /* error surfaces via EXEC or the outer try/catch */
+        };
+        try {
+            // Fire MULTI without awaiting — no round-trip needed before commands.
+            this.raw.send('MULTI', []).catch(swallow);
+            // Fire all queued commands synchronously (no awaits).
+            for (const { cmd, args } of this.commands) {
+                this.raw.send(cmd, args).catch(swallow);
+            }
+            // EXEC is the only await — it returns the array of results.
+            const results = await this.raw.send('EXEC', []);
+            if (!results) {
+                return null;
+            }
+            // Normalize to ioredis format: [Error | null, value][]
+            return results.map((result, i) => {
+                if (result instanceof Error) {
+                    return [result, null];
+                }
+                const transformer = this.transformers[i];
+                const value = transformer ? transformer(result) : result;
+                return [null, value];
+            });
+        }
+        catch (err) {
+            // Try to discard the MULTI state on error
+            try {
+                await this.raw.send('DISCARD', []);
+            }
+            catch (_a) {
+                // ignore
+            }
+            throw err;
+        }
+    }
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/child-pool.js b/node_modules/bullmq/dist/cjs/classes/child-pool.js
new file mode 100644
index 0000000..0730619
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/child-pool.js
@@ -0,0 +1,82 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ChildPool = void 0;
+const path = require("path");
+const child_1 = require("./child");
+const CHILD_KILL_TIMEOUT = 30000;
+const supportCJS = () => {
+    return (typeof require === 'function' &&
+        typeof module === 'object' &&
+        typeof module.exports === 'object');
+};
+class ChildPool {
+    constructor({ mainFile = supportCJS()
+        ? path.join(process.cwd(), 'dist/cjs/classes/main.js')
+        : path.join(process.cwd(), 'dist/esm/classes/main.js'), useWorkerThreads, workerForkOptions, workerThreadsOptions, }) {
+        this.retained = {};
+        this.free = {};
+        this.opts = {
+            mainFile,
+            useWorkerThreads,
+            workerForkOptions,
+            workerThreadsOptions,
+        };
+    }
+    async retain(processFile) {
+        let child = this.getFree(processFile).pop();
+        if (child) {
+            this.retained[child.pid] = child;
+            return child;
+        }
+        child = new child_1.Child(this.opts.mainFile, processFile, {
+            useWorkerThreads: this.opts.useWorkerThreads,
+            workerForkOptions: this.opts.workerForkOptions,
+            workerThreadsOptions: this.opts.workerThreadsOptions,
+        });
+        child.on('exit', this.remove.bind(this, child));
+        try {
+            await child.init();
+            // Check status here as well, in case the child exited before we could
+            // retain it.
+            if (child.exitCode !== null || child.signalCode !== null) {
+                throw new Error('Child exited before it could be retained');
+            }
+            this.retained[child.pid] = child;
+            return child;
+        }
+        catch (err) {
+            console.error(err);
+            this.release(child);
+            throw err;
+        }
+    }
+    release(child) {
+        delete this.retained[child.pid];
+        this.getFree(child.processFile).push(child);
+    }
+    remove(child) {
+        delete this.retained[child.pid];
+        const free = this.getFree(child.processFile);
+        const childIndex = free.indexOf(child);
+        if (childIndex > -1) {
+            free.splice(childIndex, 1);
+        }
+    }
+    async kill(child, signal = 'SIGKILL') {
+        this.remove(child);
+        return child.kill(signal, CHILD_KILL_TIMEOUT);
+    }
+    async clean() {
+        const children = Object.values(this.retained).concat(this.getAllFree());
+        this.retained = {};
+        this.free = {};
+        await Promise.all(children.map(c => this.kill(c, 'SIGTERM')));
+    }
+    getFree(id) {
+        return (this.free[id] = this.free[id] || []);
+    }
+    getAllFree() {
+        return Object.values(this.free).reduce((first, second) => first.concat(second), []);
+    }
+}
+exports.ChildPool = ChildPool;
diff --git a/node_modules/bullmq/dist/cjs/classes/child-processor.js b/node_modules/bullmq/dist/cjs/classes/child-processor.js
new file mode 100644
index 0000000..0799101
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/child-processor.js
@@ -0,0 +1,255 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ChildProcessor = void 0;
+const abort_controller_1 = require("./abort-controller");
+const enums_1 = require("../enums");
+const utils_1 = require("../utils");
+var ChildStatus;
+(function (ChildStatus) {
+    ChildStatus[ChildStatus["Idle"] = 0] = "Idle";
+    ChildStatus[ChildStatus["Started"] = 1] = "Started";
+    ChildStatus[ChildStatus["Terminating"] = 2] = "Terminating";
+    ChildStatus[ChildStatus["Errored"] = 3] = "Errored";
+})(ChildStatus || (ChildStatus = {}));
+const RESPONSE_TIMEOUT = process.env.NODE_ENV === 'test' ? 500 : 5000;
+/**
+ * ChildProcessor
+ *
+ * This class acts as the interface between a child process and it parent process
+ * so that jobs can be processed in different processes.
+ *
+ */
+class ChildProcessor {
+    constructor(send, receiver) {
+        this.send = send;
+        this.receiver = receiver;
+    }
+    async init(processorFile) {
+        let processor;
+        try {
+            const { default: processorFn } = await import(processorFile);
+            processor = processorFn;
+            if (processor.default) {
+                // support es2015 module.
+                processor = processor.default;
+            }
+            if (typeof processor !== 'function') {
+                throw new Error('No function is exported in processor file');
+            }
+        }
+        catch (err) {
+            this.status = ChildStatus.Errored;
+            return this.send({
+                cmd: enums_1.ParentCommand.InitFailed,
+                err: (0, utils_1.errorToJSON)(err),
+            });
+        }
+        const origProcessor = processor;
+        processor = function (job, token, signal) {
+            try {
+                return Promise.resolve(origProcessor(job, token, signal));
+            }
+            catch (err) {
+                return Promise.reject(err);
+            }
+        };
+        this.processor = processor;
+        this.status = ChildStatus.Idle;
+        await this.send({
+            cmd: enums_1.ParentCommand.InitCompleted,
+        });
+    }
+    async start(jobJson, token) {
+        if (this.status !== ChildStatus.Idle) {
+            return this.send({
+                cmd: enums_1.ParentCommand.Error,
+                err: (0, utils_1.errorToJSON)(new Error('cannot start a not idling child process')),
+            });
+        }
+        this.status = ChildStatus.Started;
+        this.abortController = new abort_controller_1.AbortController();
+        this.currentJobPromise = (async () => {
+            try {
+                const job = this.wrapJob(jobJson, this.send);
+                const result = await this.processor(job, token, this.abortController.signal);
+                await this.send({
+                    cmd: enums_1.ParentCommand.Completed,
+                    value: typeof result === 'undefined' ? null : result,
+                });
+            }
+            catch (err) {
+                await this.send({
+                    cmd: enums_1.ParentCommand.Failed,
+                    value: (0, utils_1.errorToJSON)(!err.message ? new Error(err) : err),
+                });
+            }
+            finally {
+                this.status = ChildStatus.Idle;
+                this.currentJobPromise = undefined;
+                this.abortController = undefined;
+            }
+        })();
+    }
+    /**
+     * Cancels the currently running job by aborting its signal.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancel(reason) {
+        if (this.abortController) {
+            this.abortController.abort(reason);
+        }
+    }
+    async stop() { }
+    async waitForCurrentJobAndExit() {
+        this.status = ChildStatus.Terminating;
+        try {
+            await this.currentJobPromise;
+        }
+        finally {
+            process.exit(process.exitCode || 0);
+        }
+    }
+    /**
+     * Enhance the given job argument with some functions
+     * that can be called from the sandboxed job processor.
+     *
+     * Note, the `job` argument is a JSON deserialized message
+     * from the main node process to this forked child process,
+     * the functions on the original job object are not in tact.
+     * The wrapped job adds back some of those original functions.
+     */
+    wrapJob(job, send) {
+        const wrappedJob = Object.assign(Object.assign({}, job), { queueQualifiedName: job.queueQualifiedName, data: JSON.parse(job.data || '{}'), opts: job.opts, returnValue: JSON.parse(job.returnvalue || '{}'), 
+            /*
+             * Proxy `updateProgress` function, should works as `progress` function.
+             */
+            async updateProgress(progress) {
+                // Locally store reference to new progress value
+                // so that we can return it from this process synchronously.
+                this.progress = progress;
+                // Send message to update job progress.
+                await send({
+                    cmd: enums_1.ParentCommand.Progress,
+                    value: progress,
+                });
+            }, 
+            /*
+             * Proxy job `log` function.
+             */
+            log: async (row) => {
+                await send({
+                    cmd: enums_1.ParentCommand.Log,
+                    value: row,
+                });
+            }, 
+            /*
+             * Proxy `moveToDelayed` function.
+             */
+            moveToDelayed: async (timestamp, token) => {
+                await send({
+                    cmd: enums_1.ParentCommand.MoveToDelayed,
+                    value: { timestamp, token },
+                });
+            }, 
+            /*
+             * Proxy `moveToWait` function.
+             */
+            moveToWait: async (token) => {
+                await send({
+                    cmd: enums_1.ParentCommand.MoveToWait,
+                    value: { token },
+                });
+            }, 
+            /*
+             * Proxy `moveToWaitingChildren` function.
+             */
+            moveToWaitingChildren: async (token, opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: enums_1.ParentCommand.MoveToWaitingChildren,
+                    value: { token, opts },
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'moveToWaitingChildren');
+            }, 
+            /*
+             * Proxy `updateData` function.
+             */
+            updateData: async (data) => {
+                await send({
+                    cmd: enums_1.ParentCommand.Update,
+                    value: data,
+                });
+                wrappedJob.data = data;
+            }, 
+            /**
+             * Proxy `getChildrenValues` function.
+             */
+            getChildrenValues: async () => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: enums_1.ParentCommand.GetChildrenValues,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getChildrenValues');
+            }, 
+            /**
+             * Proxy `getIgnoredChildrenFailures` function.
+             *
+             * This method sends a request to retrieve the failures of ignored children
+             * and waits for a response from the parent process.
+             *
+             * @returns - A promise that resolves with the ignored children failures.
+             * The exact structure of the returned data depends on the parent process implementation.
+             */
+            getIgnoredChildrenFailures: async () => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: enums_1.ParentCommand.GetIgnoredChildrenFailures,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getIgnoredChildrenFailures');
+            }, 
+            /**
+             * Proxy `getDependenciesCount` function.
+             */
+            getDependenciesCount: async (opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: enums_1.ParentCommand.GetDependenciesCount,
+                    value: opts,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getDependenciesCount');
+            }, 
+            /**
+             * Proxy `getDependencies` function.
+             */
+            getDependencies: async (opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: enums_1.ParentCommand.GetDependencies,
+                    value: opts,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getDependencies');
+            } });
+        return wrappedJob;
+    }
+}
+exports.ChildProcessor = ChildProcessor;
+const waitResponse = async (requestId, receiver, timeout, cmd) => {
+    return new Promise((resolve, reject) => {
+        const listener = (msg) => {
+            if (msg.requestId === requestId) {
+                resolve(msg.value);
+                receiver.off('message', listener);
+            }
+        };
+        receiver.on('message', listener);
+        setTimeout(() => {
+            receiver.off('message', listener);
+            reject(new Error(`TimeoutError: ${cmd} timed out in (${timeout}ms)`));
+        }, timeout);
+    });
+};
diff --git a/node_modules/bullmq/dist/cjs/classes/child.js b/node_modules/bullmq/dist/cjs/classes/child.js
new file mode 100644
index 0000000..2a72496
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/child.js
@@ -0,0 +1,214 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Child = void 0;
+const child_process_1 = require("child_process");
+const net_1 = require("net");
+const worker_threads_1 = require("worker_threads");
+const enums_1 = require("../enums");
+const events_1 = require("events");
+/**
+ * @see https://nodejs.org/api/process.html#process_exit_codes
+ */
+const exitCodesErrors = {
+    1: 'Uncaught Fatal Exception',
+    2: 'Unused',
+    3: 'Internal JavaScript Parse Error',
+    4: 'Internal JavaScript Evaluation Failure',
+    5: 'Fatal Error',
+    6: 'Non-function Internal Exception Handler',
+    7: 'Internal Exception Handler Run-Time Failure',
+    8: 'Unused',
+    9: 'Invalid Argument',
+    10: 'Internal JavaScript Run-Time Failure',
+    12: 'Invalid Debug Argument',
+    13: 'Unfinished Top-Level Await',
+};
+/**
+ * Child class
+ *
+ * This class is used to create a child process or worker thread, and allows using
+ * isolated processes or threads for processing jobs.
+ *
+ */
+class Child extends events_1.EventEmitter {
+    constructor(mainFile, processFile, opts = {
+        useWorkerThreads: false,
+    }) {
+        super();
+        this.mainFile = mainFile;
+        this.processFile = processFile;
+        this.opts = opts;
+        this._exitCode = null;
+        this._signalCode = null;
+        this._killed = false;
+    }
+    get pid() {
+        if (this.childProcess) {
+            return this.childProcess.pid;
+        }
+        else if (this.worker) {
+            // Worker threads pids can become negative when they are terminated
+            // so we need to use the absolute value to index the retained object
+            return Math.abs(this.worker.threadId);
+        }
+        else {
+            throw new Error('No child process or worker thread');
+        }
+    }
+    get exitCode() {
+        return this._exitCode;
+    }
+    get signalCode() {
+        return this._signalCode;
+    }
+    get killed() {
+        if (this.childProcess) {
+            return this.childProcess.killed;
+        }
+        return this._killed;
+    }
+    async init() {
+        const execArgv = await convertExecArgv(process.execArgv);
+        let parent;
+        if (this.opts.useWorkerThreads) {
+            this.worker = parent = new worker_threads_1.Worker(this.mainFile, Object.assign({ execArgv, stdin: true, stdout: true, stderr: true }, (this.opts.workerThreadsOptions
+                ? this.opts.workerThreadsOptions
+                : {})));
+        }
+        else {
+            this.childProcess = parent = (0, child_process_1.fork)(this.mainFile, [], Object.assign({ execArgv, stdio: 'pipe' }, (this.opts.workerForkOptions ? this.opts.workerForkOptions : {})));
+        }
+        parent.on('exit', (exitCode, signalCode) => {
+            this._exitCode = exitCode;
+            // Coerce to null if undefined for backwards compatibility
+            signalCode = typeof signalCode === 'undefined' ? null : signalCode;
+            this._signalCode = signalCode;
+            this._killed = true;
+            this.emit('exit', exitCode, signalCode);
+            // Clean all listeners, we do not expect any more events after "exit"
+            parent.removeAllListeners();
+            this.removeAllListeners();
+        });
+        parent.on('error', (...args) => this.emit('error', ...args));
+        parent.on('message', (...args) => this.emit('message', ...args));
+        parent.on('close', (...args) => this.emit('close', ...args));
+        parent.stdout.pipe(process.stdout);
+        parent.stderr.pipe(process.stderr);
+        await this.initChild();
+    }
+    async send(msg) {
+        return new Promise((resolve, reject) => {
+            if (this.childProcess) {
+                this.childProcess.send(msg, (err) => {
+                    if (err) {
+                        reject(err);
+                    }
+                    else {
+                        resolve();
+                    }
+                });
+            }
+            else if (this.worker) {
+                resolve(this.worker.postMessage(msg));
+            }
+            else {
+                resolve();
+            }
+        });
+    }
+    killProcess(signal = 'SIGKILL') {
+        if (this.childProcess) {
+            this.childProcess.kill(signal);
+        }
+        else if (this.worker) {
+            this.worker.terminate();
+        }
+    }
+    async kill(signal = 'SIGKILL', timeoutMs) {
+        if (this.hasProcessExited()) {
+            return;
+        }
+        const onExit = onExitOnce(this.childProcess || this.worker);
+        this.killProcess(signal);
+        if (timeoutMs !== undefined && (timeoutMs === 0 || isFinite(timeoutMs))) {
+            const timeoutHandle = setTimeout(() => {
+                if (!this.hasProcessExited()) {
+                    this.killProcess('SIGKILL');
+                }
+            }, timeoutMs);
+            await onExit;
+            clearTimeout(timeoutHandle);
+        }
+        await onExit;
+    }
+    async initChild() {
+        const onComplete = new Promise((resolve, reject) => {
+            const onMessageHandler = (msg) => {
+                if (!Object.values(enums_1.ParentCommand).includes(msg.cmd)) {
+                    return;
+                }
+                if (msg.cmd === enums_1.ParentCommand.InitCompleted) {
+                    resolve();
+                }
+                else if (msg.cmd === enums_1.ParentCommand.InitFailed) {
+                    const err = new Error();
+                    err.stack = msg.err.stack;
+                    err.message = msg.err.message;
+                    reject(err);
+                }
+                this.off('message', onMessageHandler);
+                this.off('close', onCloseHandler);
+            };
+            const onCloseHandler = (code, signal) => {
+                if (code > 128) {
+                    code -= 128;
+                }
+                const msg = exitCodesErrors[code] || `Unknown exit code ${code}`;
+                reject(new Error(`Error initializing child: ${msg} and signal ${signal}`));
+                this.off('message', onMessageHandler);
+                this.off('close', onCloseHandler);
+            };
+            this.on('message', onMessageHandler);
+            this.on('close', onCloseHandler);
+        });
+        await this.send({
+            cmd: enums_1.ChildCommand.Init,
+            value: this.processFile,
+        });
+        await onComplete;
+    }
+    hasProcessExited() {
+        return !!(this.exitCode !== null || this.signalCode);
+    }
+}
+exports.Child = Child;
+function onExitOnce(child) {
+    return new Promise(resolve => {
+        child.once('exit', () => resolve());
+    });
+}
+const getFreePort = async () => {
+    return new Promise(resolve => {
+        const server = (0, net_1.createServer)();
+        server.listen(0, () => {
+            const { port } = server.address();
+            server.close(() => resolve(port));
+        });
+    });
+};
+const convertExecArgv = async (execArgv) => {
+    const standard = [];
+    const convertedArgs = [];
+    for (let i = 0; i < execArgv.length; i++) {
+        const arg = execArgv[i];
+        if (arg.indexOf('--inspect') === -1) {
+            standard.push(arg);
+        }
+        else {
+            const argName = arg.split('=')[0];
+            const port = await getFreePort();
+            convertedArgs.push(`${argName}=${port}`);
+        }
+    }
+    return standard.concat(convertedArgs);
+};
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/connection-closed-error.js b/node_modules/bullmq/dist/cjs/classes/errors/connection-closed-error.js
new file mode 100644
index 0000000..533ad97
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/connection-closed-error.js
@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ConnectionClosedError = void 0;
+/**
+ * Thrown by any BullMQ Redis adapter (ioredis, node-redis, Bun, …) when a
+ * command fails because the connection is already closed or was closed
+ * mid-flight.
+ *
+ * Using a single well-known class lets {@link isNotConnectionError} do a
+ * structural `instanceof` check rather than fragile message-substring matching.
+ */
+class ConnectionClosedError extends Error {
+    constructor(message, cause) {
+        super(message !== null && message !== void 0 ? message : 'Connection is closed');
+        this.cause = cause;
+        this.name = 'ConnectionClosedError';
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.ConnectionClosedError = ConnectionClosedError;
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/delayed-error.js b/node_modules/bullmq/dist/cjs/classes/errors/delayed-error.js
new file mode 100644
index 0000000..6a01ffd
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/delayed-error.js
@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DelayedError = exports.DELAYED_ERROR = void 0;
+exports.DELAYED_ERROR = 'bullmq:movedToDelayed';
+/**
+ * DelayedError
+ *
+ * Error to be thrown when job is moved to delayed state
+ * from job in active state.
+ *
+ */
+class DelayedError extends Error {
+    constructor(message = exports.DELAYED_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.DelayedError = DelayedError;
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/index.js b/node_modules/bullmq/dist/cjs/classes/errors/index.js
new file mode 100644
index 0000000..6378ced
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/index.js
@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./connection-closed-error"), exports);
+tslib_1.__exportStar(require("./delayed-error"), exports);
+tslib_1.__exportStar(require("./rate-limit-error"), exports);
+tslib_1.__exportStar(require("./unrecoverable-error"), exports);
+tslib_1.__exportStar(require("./waiting-children-error"), exports);
+tslib_1.__exportStar(require("./waiting-error"), exports);
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/rate-limit-error.js b/node_modules/bullmq/dist/cjs/classes/errors/rate-limit-error.js
new file mode 100644
index 0000000..50ac05e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/rate-limit-error.js
@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RateLimitError = exports.RATE_LIMIT_ERROR = void 0;
+exports.RATE_LIMIT_ERROR = 'bullmq:rateLimitExceeded';
+/**
+ * RateLimitError
+ *
+ * Error to be thrown when queue reaches a rate limit.
+ *
+ */
+class RateLimitError extends Error {
+    constructor(message = exports.RATE_LIMIT_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.RateLimitError = RateLimitError;
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/unrecoverable-error.js b/node_modules/bullmq/dist/cjs/classes/errors/unrecoverable-error.js
new file mode 100644
index 0000000..9ab8ad3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/unrecoverable-error.js
@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UnrecoverableError = exports.UNRECOVERABLE_ERROR = void 0;
+exports.UNRECOVERABLE_ERROR = 'bullmq:unrecoverable';
+/**
+ * UnrecoverableError
+ *
+ * Error to move a job to failed even if the attemptsMade
+ * are lower than the expected limit.
+ *
+ */
+class UnrecoverableError extends Error {
+    constructor(message = exports.UNRECOVERABLE_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.UnrecoverableError = UnrecoverableError;
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/waiting-children-error.js b/node_modules/bullmq/dist/cjs/classes/errors/waiting-children-error.js
new file mode 100644
index 0000000..c301af4
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/waiting-children-error.js
@@ -0,0 +1,19 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WaitingChildrenError = exports.WAITING_CHILDREN_ERROR = void 0;
+exports.WAITING_CHILDREN_ERROR = 'bullmq:movedToWaitingChildren';
+/**
+ * WaitingChildrenError
+ *
+ * Error to be thrown when job is moved to waiting-children state
+ * from job in active state.
+ *
+ */
+class WaitingChildrenError extends Error {
+    constructor(message = exports.WAITING_CHILDREN_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.WaitingChildrenError = WaitingChildrenError;
diff --git a/node_modules/bullmq/dist/cjs/classes/errors/waiting-error.js b/node_modules/bullmq/dist/cjs/classes/errors/waiting-error.js
new file mode 100644
index 0000000..811b4a3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/errors/waiting-error.js
@@ -0,0 +1,18 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WaitingError = exports.WAITING_ERROR = void 0;
+exports.WAITING_ERROR = 'bullmq:movedToWait';
+/**
+ * WaitingError
+ *
+ * Error to be thrown when job is moved to wait or prioritized state
+ * from job in active state.
+ */
+class WaitingError extends Error {
+    constructor(message = exports.WAITING_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
+exports.WaitingError = WaitingError;
diff --git a/node_modules/bullmq/dist/cjs/classes/flow-producer.js b/node_modules/bullmq/dist/cjs/classes/flow-producer.js
new file mode 100644
index 0000000..0d87cdd
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/flow-producer.js
@@ -0,0 +1,398 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FlowProducer = void 0;
+const events_1 = require("events");
+const utils_1 = require("../utils");
+const job_1 = require("./job");
+const queue_keys_1 = require("./queue-keys");
+const redis_connection_1 = require("./redis-connection");
+const enums_1 = require("../enums");
+/**
+ * This class allows to add jobs with dependencies between them in such
+ * a way that it is possible to build complex flows.
+ * Note: A flow is a tree-like structure of jobs that depend on each other.
+ * Whenever the children of a given parent are completed, the parent
+ * will be processed, being able to access the children's result data.
+ * All Jobs can be in different queues, either children or parents,
+ */
+class FlowProducer extends events_1.EventEmitter {
+    constructor(opts = { connection: {} }, Connection = redis_connection_1.RedisConnection) {
+        super();
+        this.opts = opts;
+        this.opts = Object.assign({ prefix: 'bull' }, opts);
+        this.connection = new Connection(opts.connection, {
+            shared: (0, utils_1.isRedisInstance)(opts.connection),
+            blocking: false,
+            skipVersionCheck: opts.skipVersionCheck,
+            skipWaitingForReady: opts.skipWaitingForReady,
+        });
+        this.connection.on('error', (error) => this.emit('error', error));
+        this.connection.on('close', () => {
+            if (!this.closing) {
+                this.emit('ioredis:close');
+            }
+        });
+        this.queueKeys = new queue_keys_1.QueueKeys(opts.prefix);
+        if (opts === null || opts === void 0 ? void 0 : opts.telemetry) {
+            this.telemetry = opts.telemetry;
+        }
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client() {
+        return this.connection.client;
+    }
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    get Job() {
+        return job_1.Job;
+    }
+    waitUntilReady() {
+        return this.client;
+    }
+    /**
+     * Adds a flow.
+     *
+     * This call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flow - an object with a tree-like structure where children jobs
+     * will be processed before their parents.
+     * @param opts - options that will be applied to the flow object.
+     */
+    async add(flow, opts) {
+        var _a;
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const multi = client.multi();
+        const parentOpts = (_a = flow === null || flow === void 0 ? void 0 : flow.opts) === null || _a === void 0 ? void 0 : _a.parent;
+        const parentKey = (0, utils_1.getParentKey)(parentOpts);
+        const parentDependenciesKey = parentKey
+            ? `${parentKey}:dependencies`
+            : undefined;
+        return (0, utils_1.trace)(this.telemetry, enums_1.SpanKind.PRODUCER, flow.queueName, 'addFlow', flow.queueName, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.FlowName]: flow.name,
+            });
+            const jobsTree = await this.addNode({
+                multi,
+                node: flow,
+                queuesOpts: opts === null || opts === void 0 ? void 0 : opts.queuesOptions,
+                parent: {
+                    parentOpts,
+                    parentDependenciesKey,
+                },
+            });
+            const results = (await multi.exec());
+            const [result] = results || [];
+            if (result) {
+                const [err, jobId] = result;
+                if (err) {
+                    throw err;
+                }
+                if (typeof jobId === 'number' && jobId < 0) {
+                    throw this.toFlowError(jobId, parentKey);
+                }
+                if (typeof jobId === 'string') {
+                    jobsTree.job.id = jobId;
+                }
+            }
+            return jobsTree;
+        });
+    }
+    /**
+     * Get a flow.
+     *
+     * @param opts - an object with options for getting a JobNode.
+     */
+    async getFlow(opts) {
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const updatedOpts = Object.assign({
+            depth: 10,
+            maxChildren: 20,
+            prefix: this.opts.prefix,
+        }, opts);
+        const jobsTree = this.getNode(client, updatedOpts);
+        return jobsTree;
+    }
+    /**
+     * Adds multiple flows.
+     *
+     * A flow is a tree-like structure of jobs that depend on each other.
+     * Whenever the children of a given parent are completed, the parent
+     * will be processed, being able to access the children's result data.
+     *
+     * All Jobs can be in different queues, either children or parents,
+     * however this call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flows - an array of objects with a tree-like structure where children jobs
+     * will be processed before their parents.
+     */
+    async addBulk(flows) {
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const multi = client.multi();
+        return (0, utils_1.trace)(this.telemetry, enums_1.SpanKind.PRODUCER, '', 'addBulkFlows', '', async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.BulkCount]: flows.length,
+                [enums_1.TelemetryAttributes.BulkNames]: flows
+                    .map(flow => flow.name)
+                    .join(','),
+            });
+            const jobsTrees = await this.addNodes(multi, flows);
+            const results = (await multi.exec());
+            for (let index = 0; index < jobsTrees.length; ++index) {
+                const result = results === null || results === void 0 ? void 0 : results[index];
+                if (!result) {
+                    continue;
+                }
+                const [err, jobId] = result;
+                if (!err && typeof jobId === 'string') {
+                    jobsTrees[index].job.id = jobId;
+                }
+            }
+            return jobsTrees;
+        });
+    }
+    /**
+     * Add a node (job) of a flow to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param node - the node representing a job to be added to some queue
+     * @param parent - parent data sent to children to create the "links" to their parent
+     * @returns
+     */
+    async addNode({ multi, node, parent, queuesOpts, }) {
+        var _a, _b;
+        const prefix = node.prefix || this.opts.prefix;
+        const queue = this.queueFromNode(node, new queue_keys_1.QueueKeys(prefix), prefix);
+        const queueOpts = queuesOpts && queuesOpts[node.queueName];
+        const jobsOpts = (_a = queueOpts === null || queueOpts === void 0 ? void 0 : queueOpts.defaultJobOptions) !== null && _a !== void 0 ? _a : {};
+        const jobId = ((_b = node.opts) === null || _b === void 0 ? void 0 : _b.jobId) || (0, utils_1.randomUUID)();
+        return (0, utils_1.trace)(this.telemetry, enums_1.SpanKind.PRODUCER, node.queueName, 'addNode', node.queueName, async (span, srcPropagationMetadata) => {
+            var _a, _b;
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobName]: node.name,
+                [enums_1.TelemetryAttributes.JobId]: jobId,
+            });
+            const opts = node.opts;
+            let telemetry = opts === null || opts === void 0 ? void 0 : opts.telemetry;
+            if (srcPropagationMetadata && opts) {
+                const omitContext = (_a = opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext;
+                const telemetryMetadata = ((_b = opts.telemetry) === null || _b === void 0 ? void 0 : _b.metadata) ||
+                    (!omitContext && srcPropagationMetadata);
+                if (telemetryMetadata || omitContext) {
+                    telemetry = {
+                        metadata: telemetryMetadata,
+                        omitContext,
+                    };
+                }
+            }
+            const job = new this.Job(queue, node.name, node.data, Object.assign(Object.assign(Object.assign({}, jobsOpts), opts), { parent: parent === null || parent === void 0 ? void 0 : parent.parentOpts, telemetry }), jobId);
+            const parentKey = (0, utils_1.getParentKey)(parent === null || parent === void 0 ? void 0 : parent.parentOpts);
+            if (node.children && node.children.length > 0) {
+                // Create the parent job, it will be a job in status "waiting-children".
+                const parentId = jobId;
+                const queueKeysParent = new queue_keys_1.QueueKeys(node.prefix || this.opts.prefix);
+                await job.addJob(multi, {
+                    parentDependenciesKey: parent === null || parent === void 0 ? void 0 : parent.parentDependenciesKey,
+                    addToWaitingChildren: true,
+                    parentKey,
+                });
+                const parentDependenciesKey = `${queueKeysParent.toKey(node.queueName, parentId)}:dependencies`;
+                const children = await this.addChildren({
+                    multi,
+                    nodes: node.children,
+                    parent: {
+                        parentOpts: {
+                            id: parentId,
+                            queue: queueKeysParent.getQueueQualifiedName(node.queueName),
+                        },
+                        parentDependenciesKey,
+                    },
+                    queuesOpts,
+                });
+                return { job, children };
+            }
+            else {
+                await job.addJob(multi, {
+                    parentDependenciesKey: parent === null || parent === void 0 ? void 0 : parent.parentDependenciesKey,
+                    parentKey,
+                });
+                return { job };
+            }
+        });
+    }
+    /**
+     * Adds nodes (jobs) of multiple flows to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param nodes - the nodes representing jobs to be added to some queue
+     * @returns
+     */
+    addNodes(multi, nodes) {
+        return Promise.all(nodes.map(node => {
+            var _a;
+            const parentOpts = (_a = node === null || node === void 0 ? void 0 : node.opts) === null || _a === void 0 ? void 0 : _a.parent;
+            const parentKey = (0, utils_1.getParentKey)(parentOpts);
+            const parentDependenciesKey = parentKey
+                ? `${parentKey}:dependencies`
+                : undefined;
+            return this.addNode({
+                multi,
+                node,
+                parent: {
+                    parentOpts,
+                    parentDependenciesKey,
+                },
+            });
+        }));
+    }
+    async getNode(client, node) {
+        const queue = this.queueFromNode(node, new queue_keys_1.QueueKeys(node.prefix), node.prefix);
+        const job = await this.Job.fromId(queue, node.id);
+        if (job) {
+            const { processed = {}, unprocessed = [], failed = [], ignored = {}, } = await job.getDependencies({
+                failed: {
+                    count: node.maxChildren,
+                },
+                processed: {
+                    count: node.maxChildren,
+                },
+                unprocessed: {
+                    count: node.maxChildren,
+                },
+                ignored: {
+                    count: node.maxChildren,
+                },
+            });
+            const processedKeys = Object.keys(processed);
+            const ignoredKeys = Object.keys(ignored);
+            const childrenCount = processedKeys.length +
+                unprocessed.length +
+                ignoredKeys.length +
+                failed.length;
+            const newDepth = node.depth - 1;
+            if (childrenCount > 0 && newDepth) {
+                const children = await this.getChildren(client, [...processedKeys, ...unprocessed, ...failed, ...ignoredKeys], newDepth, node.maxChildren);
+                return { job, children };
+            }
+            else {
+                return { job };
+            }
+        }
+    }
+    addChildren({ multi, nodes, parent, queuesOpts }) {
+        return Promise.all(nodes.map(node => this.addNode({ multi, node, parent, queuesOpts })));
+    }
+    getChildren(client, childrenKeys, depth, maxChildren) {
+        const getChild = (key) => {
+            const [prefix, queueName, id] = key.split(':');
+            return this.getNode(client, {
+                id,
+                queueName,
+                prefix,
+                depth,
+                maxChildren,
+            });
+        };
+        return Promise.all([...childrenKeys.map(getChild)]);
+    }
+    /**
+     * Helper factory method that creates a queue-like object
+     * required to create jobs in any queue.
+     *
+     * @param node - The flow node containing the queue name and other job options.
+     * @param queueKeys - The queue keys helper used to resolve key names.
+     * @param prefix - The Redis key prefix used for the queue.
+     * @returns A queue-like object with the client, keys, and options needed to create jobs.
+     */
+    queueFromNode(node, queueKeys, prefix) {
+        return {
+            client: this.connection.client,
+            name: node.queueName,
+            keys: queueKeys.getKeys(node.queueName),
+            toKey: (type) => queueKeys.toKey(node.queueName, type),
+            opts: { prefix, connection: {} },
+            qualifiedName: queueKeys.getQueueQualifiedName(node.queueName),
+            closing: this.closing,
+            waitUntilReady: async () => this.connection.client,
+            removeListener: this.removeListener.bind(this),
+            emit: this.emit.bind(this),
+            on: this.on.bind(this),
+            redisVersion: this.connection.redisVersion,
+            databaseType: this.connection.databaseType,
+            trace: async () => { },
+        };
+    }
+    /**
+     * Translates numeric addJob Lua error codes returned by root flow exec.
+     *
+     * @param code - Numeric error code returned from Redis.
+     * @param parentKey - Parent key for contextual error messages.
+     */
+    toFlowError(code, parentKey) {
+        let error;
+        switch (code) {
+            case enums_1.ErrorCode.ParentJobNotExist:
+                error = new Error(`Missing key for parent job ${parentKey}. addJob`);
+                break;
+            case enums_1.ErrorCode.ParentJobCannotBeReplaced:
+                error = new Error(`The parent job ${parentKey} cannot be replaced. addJob`);
+                break;
+            default:
+                error = new Error(`Unknown code ${code} error for addJob`);
+        }
+        error.code = code;
+        return error;
+    }
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+    }
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect() {
+        return this.connection.disconnect();
+    }
+}
+exports.FlowProducer = FlowProducer;
diff --git a/node_modules/bullmq/dist/cjs/classes/index.js b/node_modules/bullmq/dist/cjs/classes/index.js
new file mode 100644
index 0000000..0e8243e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/index.js
@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./async-fifo-queue"), exports);
+tslib_1.__exportStar(require("./backoffs"), exports);
+tslib_1.__exportStar(require("./child"), exports);
+tslib_1.__exportStar(require("./child-pool"), exports);
+tslib_1.__exportStar(require("./child-processor"), exports);
+tslib_1.__exportStar(require("./errors"), exports);
+tslib_1.__exportStar(require("./flow-producer"), exports);
+tslib_1.__exportStar(require("./ioredis-client"), exports);
+tslib_1.__exportStar(require("./node-redis-client"), exports);
+tslib_1.__exportStar(require("./bun-redis-client"), exports);
+tslib_1.__exportStar(require("./job"), exports);
+tslib_1.__exportStar(require("./job-scheduler"), exports);
+// export * from './main'; this file must not be exported
+// export * from './main-worker'; this file must not be exported
+tslib_1.__exportStar(require("./lock-manager"), exports);
+tslib_1.__exportStar(require("./queue-base"), exports);
+tslib_1.__exportStar(require("./queue-events"), exports);
+tslib_1.__exportStar(require("./queue-events-producer"), exports);
+tslib_1.__exportStar(require("./queue-getters"), exports);
+tslib_1.__exportStar(require("./queue-keys"), exports);
+tslib_1.__exportStar(require("./queue"), exports);
+tslib_1.__exportStar(require("./redis-connection"), exports);
+tslib_1.__exportStar(require("./repeat"), exports);
+tslib_1.__exportStar(require("./sandbox"), exports);
+tslib_1.__exportStar(require("./scripts"), exports);
+tslib_1.__exportStar(require("./worker"), exports);
diff --git a/node_modules/bullmq/dist/cjs/classes/ioredis-client.js b/node_modules/bullmq/dist/cjs/classes/ioredis-client.js
new file mode 100644
index 0000000..0b467ee
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/ioredis-client.js
@@ -0,0 +1,335 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createIORedisClient = createIORedisClient;
+exports.isIRedisClient = isIRedisClient;
+/**
+ * Per-raw-client cache so repeated calls to `createIORedisClient` with the
+ * same underlying ioredis instance return the same proxy. This preserves
+ * event-listener identity for the BullMQ-facing client.
+ */
+const proxyCache = new WeakMap();
+/**
+ * Wraps an ioredis `Redis` / `Cluster` instance with a `Proxy` so it conforms
+ * to {@link IRedisClient}.
+ *
+ * For backwards compatibility BullMQ continues to accept a raw `IORedis`
+ * instance through tehe `connection` option, even though internally it relies
+ * on the `IRedisClient` adapter interface. The returned proxy:
+ *
+ *   - exposes `runCommand` (Lua script dispatch by name)
+ *   - exposes structured-options variants of `hset`, `set`, `zrange`,
+ *     `zrevrange`, `xadd`, `xread`, `xtrim`, `scan` (backward-compatible:
+ *     they still accept native ioredis varargs if called that way)
+ *   - returns augmented {@link IRedisTransaction}s from `pipeline()` / `multi()`
+ *   - wraps the result of `duplicate()` in a new proxy
+ *
+ * The underlying ioredis instance is **not** mutated. Properties and methods
+ * not in the override table are forwarded to the raw client via the proxy
+ * traps, with `this === target` so EventEmitter / Commander internals work
+ * normally.
+ */
+function createIORedisClient(client) {
+    // If the caller already passed a proxy produced by this function, return
+    // it as-is. Wrapping a proxy in a second proxy would defeat the WeakMap
+    // cache (the inner raw client is no longer reachable from the outer
+    // argument) and break listener-identity / equality checks for callers
+    // that hold on to the original wrapper.
+    if (client.__bullmq_iredis === true) {
+        return client;
+    }
+    const cached = proxyCache.get(client);
+    if (cached) {
+        return cached;
+    }
+    const isCluster = client.isCluster === true;
+    // Cache bound prototype methods so the returned function identity is
+    // stable across accesses (important for `once`/`removeListener` patterns).
+    const boundCache = new Map();
+    // Override table — properties returned by the proxy without touching the
+    // underlying ioredis instance. The arrow functions close over `client`
+    // directly so ioredis internals always see the raw instance as `this`.
+    const overrides = Object.create(null);
+    overrides.__bullmq_iredis = true;
+    overrides.isCluster = isCluster;
+    // Lua script engine.
+    overrides.runCommand = (name, args) => {
+        return client[name](args);
+    };
+    // Pipeline / Multi — wrap the ChainableCommander with structured overrides.
+    overrides.pipeline = (...args) => {
+        return augmentTransaction(client.pipeline(...args));
+    };
+    overrides.multi = (...args) => {
+        return augmentTransaction(client.multi(...args));
+    };
+    // duplicate — wrap the new raw client with a fresh proxy.
+    // ioredis Cluster.duplicate(startupNodes?, options?) expects connection
+    // options under `redisOptions`, while Redis.duplicate(options?) takes them
+    // at the top level. Normalise so callers can always pass `{ connectionName }`.
+    if (typeof client.duplicate === 'function') {
+        overrides.duplicate = (opts) => {
+            var _a;
+            if (isCluster) {
+                const existingRedisOpts = ((_a = client.options) === null || _a === void 0 ? void 0 : _a.redisOptions) || {};
+                const mergedRedisOpts = opts
+                    ? Object.assign(Object.assign({}, existingRedisOpts), opts) : existingRedisOpts;
+                return createIORedisClient(client.duplicate(undefined, {
+                    redisOptions: mergedRedisOpts,
+                }));
+            }
+            return createIORedisClient(client.duplicate(opts));
+        };
+    }
+    // --- Structured → ioredis varargs translations ---
+    // Each override accepts both the IRedisClient structured-options form and
+    // the native ioredis varargs form, dispatching by argument shape.
+    // hset: structured { f1: v1 } → ioredis hset(key, f1, v1, …)
+    overrides.hset = (key, dataOrField, ...rest) => {
+        if (typeof dataOrField === 'string') {
+            return client.hset(key, dataOrField, ...rest);
+        }
+        const args = [key];
+        for (const [f, v] of Object.entries(dataOrField)) {
+            args.push(f, v);
+        }
+        return client.hset(...args);
+    };
+    // set: structured { PX?: n } → ioredis set(key, value, 'PX', n)
+    overrides.set = (key, value, optionsOrModifier, ...rest) => {
+        if (typeof optionsOrModifier === 'string' || optionsOrModifier == null) {
+            return client.set(key, value, ...(optionsOrModifier != null ? [optionsOrModifier, ...rest] : []));
+        }
+        const args = [key, value];
+        if (optionsOrModifier.PX != null) {
+            args.push('PX', optionsOrModifier.PX);
+        }
+        else if (optionsOrModifier.EX != null) {
+            args.push('EX', optionsOrModifier.EX);
+        }
+        return client.set(...args);
+    };
+    // zrange: structured { WITHSCORES? } → ioredis zrange(key, start, end, 'WITHSCORES')
+    overrides.zrange = (key, start, end, optionsOrStr, ...rest) => {
+        if (typeof optionsOrStr === 'string') {
+            return client.zrange(key, start, end, optionsOrStr, ...rest);
+        }
+        if (optionsOrStr === null || optionsOrStr === void 0 ? void 0 : optionsOrStr.WITHSCORES) {
+            return client.zrange(key, start, end, 'WITHSCORES');
+        }
+        return client.zrange(key, start, end);
+    };
+    // zrevrange: structured { WITHSCORES? } → ioredis zrevrange(key, start, end, 'WITHSCORES')
+    overrides.zrevrange = (key, start, end, optionsOrStr, ...rest) => {
+        if (typeof optionsOrStr === 'string') {
+            return client.zrevrange(key, start, end, optionsOrStr, ...rest);
+        }
+        if (optionsOrStr === null || optionsOrStr === void 0 ? void 0 : optionsOrStr.WITHSCORES) {
+            return client.zrevrange(key, start, end, 'WITHSCORES');
+        }
+        return client.zrevrange(key, start, end);
+    };
+    // xadd: structured (key, id, { field: value }, { MAXLEN? }) → ioredis varargs
+    overrides.xadd = (key, idOrModifier, fieldsOrArg, ...rest) => {
+        if (typeof fieldsOrArg === 'string') {
+            return client.xadd(key, idOrModifier, fieldsOrArg, ...rest);
+        }
+        const options = rest[0];
+        const args = [key];
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            args.push('MAXLEN');
+            if (options.approximate !== false) {
+                args.push('~');
+            }
+            args.push(options.MAXLEN);
+        }
+        args.push(idOrModifier);
+        for (const [f, v] of Object.entries(fieldsOrArg)) {
+            args.push(f, v);
+        }
+        return client.xadd(...args);
+    };
+    // xread: structured ([{ key, id }], { BLOCK?, COUNT? }) → ioredis varargs
+    overrides.xread = (streamsOrModifier, ...rest) => {
+        if (typeof streamsOrModifier === 'string') {
+            return client.xread(streamsOrModifier, ...rest);
+        }
+        const options = rest[0];
+        const args = [];
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            args.push('BLOCK', options.BLOCK);
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', options.COUNT);
+        }
+        args.push('STREAMS');
+        for (const s of streamsOrModifier) {
+            args.push(s.key);
+        }
+        for (const s of streamsOrModifier) {
+            args.push(s.id);
+        }
+        return client.xread(...args);
+    };
+    // xtrim: structured (key, 'MAXLEN', threshold, { approximate? })
+    overrides.xtrim = (key, strategy, thresholdOrApprox, ...rest) => {
+        if (typeof thresholdOrApprox === 'string' || rest.length === 0) {
+            return client.xtrim(key, strategy, thresholdOrApprox, ...rest);
+        }
+        const options = rest[0];
+        const args = [key, strategy];
+        if ((options === null || options === void 0 ? void 0 : options.approximate) !== false) {
+            args.push('~');
+        }
+        args.push(thresholdOrApprox);
+        return client.xtrim(...args);
+    };
+    // bzpopmin is not overridden — ioredis already returns
+    // `[key, member, score]`, which matches IRedisClient.
+    // clientSetName / clientList helpers that forward to CLIENT subcommands.
+    overrides.clientSetName = (name) => client.client('SETNAME', name);
+    overrides.clientList = () => client.client('LIST');
+    // scan(cursor, { MATCH?, COUNT? }) — accepts either structured options or
+    // ioredis varargs (used internally by `scanStream`).
+    overrides.scan = (cursor, ...rest) => {
+        if (rest.length === 0 ||
+            typeof rest[0] === 'string' ||
+            typeof rest[0] === 'function') {
+            return client.scan(cursor, ...rest);
+        }
+        const options = rest[0];
+        const args = [cursor];
+        if ((options === null || options === void 0 ? void 0 : options.MATCH) != null) {
+            args.push('MATCH', options.MATCH);
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', options.COUNT);
+        }
+        return client.scan(...args);
+    };
+    const proxy = new Proxy(client, {
+        get(target, prop) {
+            if (prop in overrides) {
+                return overrides[prop];
+            }
+            // Read against the raw target so getters on the prototype (e.g.
+            // ioredis' EventEmitter internals) see `this === target` rather than
+            // the proxy. This avoids infinite recursion through the proxy traps.
+            const value = Reflect.get(target, prop, target);
+            if (typeof value !== 'function') {
+                return value;
+            }
+            // Own properties (including ioredis commands installed via
+            // `defineCommand` and test-time spies set via `obj.method = spy`)
+            // are bound fresh on each access so reassignment is honoured.
+            if (Object.prototype.hasOwnProperty.call(target, prop)) {
+                return value.bind(target);
+            }
+            // Prototype methods (EventEmitter, Commander, ...) are cached so
+            // identity is stable across accesses.
+            const cachedBound = boundCache.get(prop);
+            if (cachedBound !== undefined) {
+                return cachedBound;
+            }
+            const bound = value.bind(target);
+            boundCache.set(prop, bound);
+            return bound;
+        },
+        set(target, prop, value) {
+            // Two assignment paths:
+            //   - Properties present in the override table are reassigned in the
+            //     table itself, so subsequent `get` traps return the new value
+            //     (used by sinon-style spies that stub `runCommand`, `pipeline`,
+            //     etc. on the proxy).
+            //   - All other properties are written through to the raw ioredis
+            //     instance via `Reflect.set`, and any stale bound-method entry is
+            //     invalidated so the next access rebinds the new function.
+            if (prop in overrides) {
+                overrides[prop] = value;
+                return true;
+            }
+            boundCache.delete(prop);
+            return Reflect.set(target, prop, value);
+        },
+        deleteProperty(target, prop) {
+            if (prop in overrides) {
+                return false;
+            }
+            boundCache.delete(prop);
+            return Reflect.deleteProperty(target, prop);
+        },
+        has(target, prop) {
+            return prop in overrides || Reflect.has(target, prop);
+        },
+    });
+    proxyCache.set(client, proxy);
+    return proxy;
+}
+/**
+ * Adds `runCommand` and structured overrides to an ioredis ChainableCommander
+ * so it satisfies {@link IRedisTransaction}.
+ */
+function augmentTransaction(commander) {
+    const transaction = commander;
+    transaction.runCommand = function (name, args) {
+        transaction[name](args);
+        return transaction;
+    };
+    // hset(key, { f1: v1 }) → ioredis pipeline.hset(key, f1, v1, …)
+    const origHset = transaction.hset.bind(transaction);
+    transaction.hset = function (key, data) {
+        const args = [key];
+        for (const [f, v] of Object.entries(data)) {
+            args.push(f, v);
+        }
+        origHset(...args);
+        return transaction;
+    };
+    // hscan(key, cursor, { COUNT? }) → ioredis hscan(key, cursor, 'COUNT', n)
+    const origHscan = transaction.hscan.bind(transaction);
+    transaction.hscan = function (key, cursor, options) {
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            origHscan(key, cursor, 'COUNT', options.COUNT);
+        }
+        else {
+            origHscan(key, cursor);
+        }
+        return transaction;
+    };
+    // sscan(key, cursor, { COUNT? })
+    const origSscan = transaction.sscan.bind(transaction);
+    transaction.sscan = function (key, cursor, options) {
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            origSscan(key, cursor, 'COUNT', options.COUNT);
+        }
+        else {
+            origSscan(key, cursor);
+        }
+        return transaction;
+    };
+    return transaction;
+}
+/**
+ * Check if an object already implements {@link IRedisClient}.
+ */
+function isIRedisClient(obj) {
+    if (!obj || typeof obj !== 'object') {
+        return false;
+    }
+    // Fast path for ioredis instances already wrapped by `createIORedisClient`.
+    if (obj.__bullmq_iredis === true) {
+        return true;
+    }
+    // Fallback structural check for wrapper-based adapters
+    // (node-redis, Bun, or custom IRedisClient implementations).
+    return (typeof obj.runCommand === 'function' &&
+        typeof obj.defineCommand === 'function' &&
+        typeof obj.pipeline === 'function' &&
+        typeof obj.multi === 'function' &&
+        typeof obj.duplicate === 'function' &&
+        typeof obj.scanStream === 'function' &&
+        typeof obj.connect === 'function' &&
+        typeof obj.disconnect === 'function' &&
+        typeof obj.on === 'function' &&
+        typeof obj.status === 'string' &&
+        typeof obj.isCluster === 'boolean');
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/job-scheduler.js b/node_modules/bullmq/dist/cjs/classes/job-scheduler.js
new file mode 100644
index 0000000..bfc0d5a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/job-scheduler.js
@@ -0,0 +1,270 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultRepeatStrategy = exports.JobScheduler = void 0;
+const tslib_1 = require("tslib");
+const cron_parser_1 = require("cron-parser");
+const job_1 = require("./job");
+const queue_base_1 = require("./queue-base");
+const enums_1 = require("../enums");
+const utils_1 = require("../utils");
+class JobScheduler extends queue_base_1.QueueBase {
+    constructor(name, opts, Connection) {
+        super(name, opts, Connection);
+        this.repeatStrategy =
+            (opts.settings && opts.settings.repeatStrategy) || exports.defaultRepeatStrategy;
+    }
+    async upsertJobScheduler(jobSchedulerId, repeatOpts, jobName, jobData, opts, { override, producerId }) {
+        const { every, limit, pattern, offset } = repeatOpts;
+        if (pattern && every) {
+            throw new Error('Both .pattern and .every options are defined for this repeatable job');
+        }
+        if (!pattern && !every) {
+            throw new Error('Either .pattern or .every options must be defined for this repeatable job');
+        }
+        if (repeatOpts.immediately && repeatOpts.startDate) {
+            throw new Error('Both .immediately and .startDate options are defined for this repeatable job');
+        }
+        if (repeatOpts.immediately && repeatOpts.every) {
+            console.warn("Using option immediately with every does not affect the job's schedule. Job will run immediately anyway.");
+        }
+        // Check if we reached the limit of the repeatable job's iterations
+        const iterationCount = repeatOpts.count ? repeatOpts.count + 1 : 1;
+        if (typeof repeatOpts.limit !== 'undefined' &&
+            iterationCount > repeatOpts.limit) {
+            return;
+        }
+        // Check if we reached the end date of the repeatable job
+        let now = Date.now();
+        const { endDate } = repeatOpts;
+        if (endDate && now > new Date(endDate).getTime()) {
+            return;
+        }
+        const prevMillis = opts.prevMillis || 0;
+        now = prevMillis < now ? now : prevMillis;
+        // Check if we have a start date for the repeatable job
+        const { immediately } = repeatOpts, filteredRepeatOpts = tslib_1.__rest(repeatOpts, ["immediately"]);
+        let nextMillis;
+        const newOffset = every && offset ? offset : null;
+        if (pattern) {
+            nextMillis = await this.repeatStrategy(now, repeatOpts, jobName);
+            if (nextMillis < now) {
+                nextMillis = now;
+            }
+        }
+        if (nextMillis || every) {
+            return this.trace(enums_1.SpanKind.PRODUCER, 'add', `${this.name}.${jobName}`, async (span, srcPropagationMetadata) => {
+                var _a, _b;
+                let telemetry = opts.telemetry;
+                if (srcPropagationMetadata) {
+                    const omitContext = (_a = opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext;
+                    const telemetryMetadata = ((_b = opts.telemetry) === null || _b === void 0 ? void 0 : _b.metadata) ||
+                        (!omitContext && srcPropagationMetadata);
+                    if (telemetryMetadata || omitContext) {
+                        telemetry = {
+                            metadata: telemetryMetadata,
+                            omitContext,
+                        };
+                    }
+                }
+                const mergedOpts = this.getNextJobOpts(nextMillis, jobSchedulerId, Object.assign(Object.assign({}, opts), { repeat: filteredRepeatOpts, telemetry }), iterationCount, newOffset);
+                if (override) {
+                    // Clamp nextMillis to now if it's in the past
+                    if (nextMillis < now) {
+                        nextMillis = now;
+                    }
+                    const [jobId, delay] = await this.scripts.addJobScheduler(jobSchedulerId, nextMillis, JSON.stringify(typeof jobData === 'undefined' ? {} : jobData), job_1.Job.optsAsJSON(opts), {
+                        name: jobName,
+                        startDate: repeatOpts.startDate
+                            ? new Date(repeatOpts.startDate).getTime()
+                            : undefined,
+                        endDate: endDate ? new Date(endDate).getTime() : undefined,
+                        tz: repeatOpts.tz,
+                        pattern,
+                        every,
+                        limit,
+                        offset: newOffset,
+                    }, job_1.Job.optsAsJSON(mergedOpts), producerId);
+                    // Ensure delay is a number (Dragonflydb may return it as a string)
+                    const numericDelay = typeof delay === 'string' ? parseInt(delay, 10) : delay;
+                    const job = new this.Job(this, jobName, jobData, Object.assign(Object.assign({}, mergedOpts), { delay: numericDelay }), jobId);
+                    job.id = jobId;
+                    span === null || span === void 0 ? void 0 : span.setAttributes({
+                        [enums_1.TelemetryAttributes.JobSchedulerId]: jobSchedulerId,
+                        [enums_1.TelemetryAttributes.JobId]: job.id,
+                    });
+                    return job;
+                }
+                else {
+                    const jobId = await this.scripts.updateJobSchedulerNextMillis(jobSchedulerId, nextMillis, JSON.stringify(typeof jobData === 'undefined' ? {} : jobData), job_1.Job.optsAsJSON(mergedOpts), producerId);
+                    if (jobId) {
+                        const job = new this.Job(this, jobName, jobData, mergedOpts, jobId);
+                        job.id = jobId;
+                        span === null || span === void 0 ? void 0 : span.setAttributes({
+                            [enums_1.TelemetryAttributes.JobSchedulerId]: jobSchedulerId,
+                            [enums_1.TelemetryAttributes.JobId]: job.id,
+                        });
+                        return job;
+                    }
+                }
+            });
+        }
+    }
+    getNextJobOpts(nextMillis, jobSchedulerId, opts, currentCount, offset) {
+        var _a, _b;
+        //
+        // Generate unique job id for this iteration.
+        //
+        const jobId = this.getSchedulerNextJobId({
+            jobSchedulerId,
+            nextMillis,
+        });
+        const now = Date.now();
+        const delay = nextMillis + offset - now;
+        const mergedOpts = Object.assign(Object.assign({}, opts), { jobId, delay: delay < 0 ? 0 : delay, timestamp: now, prevMillis: nextMillis, repeatJobKey: jobSchedulerId });
+        mergedOpts.repeat = Object.assign(Object.assign({}, opts.repeat), { offset, count: currentCount, startDate: ((_a = opts.repeat) === null || _a === void 0 ? void 0 : _a.startDate)
+                ? new Date(opts.repeat.startDate).getTime()
+                : undefined, endDate: ((_b = opts.repeat) === null || _b === void 0 ? void 0 : _b.endDate)
+                ? new Date(opts.repeat.endDate).getTime()
+                : undefined });
+        return mergedOpts;
+    }
+    async removeJobScheduler(jobSchedulerId) {
+        return this.scripts.removeJobScheduler(jobSchedulerId);
+    }
+    async getSchedulerData(client, key, next) {
+        const jobData = await client.hgetall(this.toKey('repeat:' + key));
+        return this.transformSchedulerData(key, jobData, next);
+    }
+    transformSchedulerData(key, jobData, next) {
+        if (jobData && Object.keys(jobData).length > 0) {
+            const jobSchedulerData = {
+                key,
+                name: jobData.name,
+                next,
+            };
+            if (jobData.ic) {
+                jobSchedulerData.iterationCount = parseInt(jobData.ic);
+            }
+            if (jobData.limit) {
+                jobSchedulerData.limit = parseInt(jobData.limit);
+            }
+            if (jobData.startDate) {
+                jobSchedulerData.startDate = parseInt(jobData.startDate);
+            }
+            if (jobData.endDate) {
+                jobSchedulerData.endDate = parseInt(jobData.endDate);
+            }
+            if (jobData.tz) {
+                jobSchedulerData.tz = jobData.tz;
+            }
+            if (jobData.pattern) {
+                jobSchedulerData.pattern = jobData.pattern;
+            }
+            if (jobData.every) {
+                jobSchedulerData.every = parseInt(jobData.every);
+            }
+            if (jobData.offset) {
+                jobSchedulerData.offset = parseInt(jobData.offset);
+            }
+            if (jobData.data || jobData.opts) {
+                jobSchedulerData.template = this.getTemplateFromJSON(jobData.data, jobData.opts);
+            }
+            return jobSchedulerData;
+        }
+        // TODO: remove this check and keyToData as it is here only to support legacy code
+        if (key.includes(':')) {
+            return this.keyToData(key, next);
+        }
+    }
+    keyToData(key, next) {
+        const data = key.split(':');
+        const pattern = data.slice(4).join(':') || null;
+        return {
+            key,
+            name: data[0],
+            id: data[1] || null,
+            endDate: parseInt(data[2]) || null,
+            tz: data[3] || null,
+            pattern,
+            next,
+        };
+    }
+    /**
+     * Checks if a given id corresponds to a registered job scheduler.
+     *
+     * This is used to disambiguate between new job scheduler ids (which may
+     * contain any number of colon segments) and legacy repeatable job keys
+     * (which always contain 5+ colon segments). Relying purely on segment
+     * count is not safe because a user-provided jobSchedulerId may itself
+     * contain 5+ colon segments, which would otherwise be misclassified as
+     * a legacy repeatable key.
+     *
+     * We cannot use ZSCORE on the shared `repeat` sorted set because legacy
+     * repeatable jobs are stored in the same sorted set and would be reported
+     * as schedulers. Instead, we probe the per-id metadata hash (`repeat:<id>`)
+     * for the `ic` (iteration count) field, which is written exclusively by
+     * `storeJobScheduler` and is never set by the legacy `addRepeatableJob`
+     * flow.
+     */
+    async isJobScheduler(id) {
+        const client = await this.client;
+        const exists = await client.hexists(`${this.keys.repeat}:${id}`, 'ic');
+        return exists === 1;
+    }
+    async getScheduler(id) {
+        const [rawJobData, next] = await this.scripts.getJobScheduler(id);
+        return this.transformSchedulerData(id, rawJobData ? (0, utils_1.array2obj)(rawJobData) : null, next ? parseInt(next) : null);
+    }
+    getTemplateFromJSON(rawData, rawOpts) {
+        const template = {};
+        if (rawData) {
+            template.data = JSON.parse(rawData);
+        }
+        if (rawOpts) {
+            template.opts = job_1.Job.optsFromJSON(rawOpts);
+        }
+        return template;
+    }
+    async getJobSchedulers(start = 0, end = -1, asc = false) {
+        const client = await this.client;
+        const jobSchedulersKey = this.keys.repeat;
+        const result = asc
+            ? await client.zrange(jobSchedulersKey, start, end, { WITHSCORES: true })
+            : await client.zrevrange(jobSchedulersKey, start, end, {
+                WITHSCORES: true,
+            });
+        const jobs = [];
+        for (let i = 0; i < result.length; i += 2) {
+            jobs.push(this.getSchedulerData(client, result[i], parseInt(result[i + 1])));
+        }
+        return Promise.all(jobs);
+    }
+    async getSchedulersCount() {
+        const jobSchedulersKey = this.keys.repeat;
+        const client = await this.client;
+        return client.zcard(jobSchedulersKey);
+    }
+    getSchedulerNextJobId({ nextMillis, jobSchedulerId, }) {
+        return `repeat:${jobSchedulerId}:${nextMillis}`;
+    }
+}
+exports.JobScheduler = JobScheduler;
+const defaultRepeatStrategy = (millis, opts) => {
+    const { pattern } = opts;
+    const dateFromMillis = new Date(millis);
+    const startDate = opts.startDate && new Date(opts.startDate);
+    const currentDate = startDate > dateFromMillis ? startDate : dateFromMillis;
+    const interval = (0, cron_parser_1.parseExpression)(pattern, Object.assign(Object.assign({}, opts), { currentDate }));
+    try {
+        if (opts.immediately) {
+            return new Date().getTime();
+        }
+        else {
+            return interval.next().getTime();
+        }
+    }
+    catch (e) {
+        // Ignore error
+    }
+};
+exports.defaultRepeatStrategy = defaultRepeatStrategy;
diff --git a/node_modules/bullmq/dist/cjs/classes/job.js b/node_modules/bullmq/dist/cjs/classes/job.js
new file mode 100644
index 0000000..d35d1ea
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/job.js
@@ -0,0 +1,1124 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Job = exports.PRIORITY_LIMIT = void 0;
+const tslib_1 = require("tslib");
+const util_1 = require("util");
+const utils_1 = require("../utils");
+const create_scripts_1 = require("../utils/create-scripts");
+const backoffs_1 = require("./backoffs");
+const unrecoverable_error_1 = require("./errors/unrecoverable-error");
+const enums_1 = require("../enums");
+const logger = (0, util_1.debuglog)('bull');
+exports.PRIORITY_LIMIT = 2 ** 21;
+/**
+ * Job
+ *
+ * This class represents a Job in the queue. Normally job are implicitly created when
+ * you add a job to the queue with methods such as Queue.addJob( ... )
+ *
+ * A Job instance is also passed to the Worker's process function.
+ *
+ */
+class Job {
+    constructor(queue, 
+    /**
+     * The name of the Job
+     */
+    name, 
+    /**
+     * The payload for this job.
+     */
+    data, 
+    /**
+     * The options object for this job.
+     */
+    opts = {}, id) {
+        this.queue = queue;
+        this.name = name;
+        this.data = data;
+        this.opts = opts;
+        this.id = id;
+        /**
+         * The progress a job has performed so far.
+         * @defaultValue 0
+         */
+        this.progress = 0;
+        /**
+         * The value returned by the processor when processing this job.
+         * @defaultValue null
+         */
+        this.returnvalue = null;
+        /**
+         * Stacktrace for the error (for failed jobs).
+         * @defaultValue null
+         */
+        this.stacktrace = null;
+        /**
+         * An amount of milliseconds to wait until this job can be processed.
+         * @defaultValue 0
+         */
+        this.delay = 0;
+        /**
+         * Ranges from 0 (highest priority) to 2 097 152 (lowest priority). Note that
+         * using priorities has a slight impact on performance,
+         * so do not use it if not required.
+         * @defaultValue 0
+         */
+        this.priority = 0;
+        /**
+         * Number of attempts when job is moved to active.
+         * @defaultValue 0
+         */
+        this.attemptsStarted = 0;
+        /**
+         * Number of attempts after the job has failed.
+         * @defaultValue 0
+         */
+        this.attemptsMade = 0;
+        /**
+         * Number of times where job has stalled.
+         * @defaultValue 0
+         */
+        this.stalledCounter = 0;
+        const _a = this.opts, { repeatJobKey } = _a, restOpts = tslib_1.__rest(_a, ["repeatJobKey"]);
+        this.opts = Object.assign({
+            attempts: 0,
+        }, restOpts);
+        this.delay = this.opts.delay;
+        this.priority = this.opts.priority || 0;
+        this.repeatJobKey = repeatJobKey;
+        this.timestamp = opts.timestamp ? opts.timestamp : Date.now();
+        this.opts.backoff = backoffs_1.Backoffs.normalize(opts.backoff);
+        this.parentKey = (0, utils_1.getParentKey)(opts.parent);
+        if (opts.parent) {
+            this.parent = { id: opts.parent.id, queueKey: opts.parent.queue };
+            if (opts.failParentOnFailure) {
+                this.parent.fpof = true;
+            }
+            if (opts.removeDependencyOnFailure) {
+                this.parent.rdof = true;
+            }
+            if (opts.ignoreDependencyOnFailure) {
+                this.parent.idof = true;
+            }
+            if (opts.continueParentOnFailure) {
+                this.parent.cpof = true;
+            }
+        }
+        this.debounceId = opts.debounce ? opts.debounce.id : undefined;
+        this.deduplicationId = opts.deduplication
+            ? opts.deduplication.id
+            : this.debounceId;
+        this.toKey = queue.toKey.bind(queue);
+        this.createScripts();
+        this.queueQualifiedName = queue.qualifiedName;
+    }
+    /**
+     * Creates a new job and adds it to the queue.
+     *
+     * @param queue - the queue where to add the job.
+     * @param name - the name of the job.
+     * @param data - the payload of the job.
+     * @param opts - the options bag for this job.
+     * @returns The created Job instance
+     */
+    static async create(queue, name, data, opts) {
+        const client = await queue.client;
+        const job = new this(queue, name, data, opts, opts && opts.jobId);
+        job.id = await job.addJob(client, {
+            parentKey: job.parentKey,
+            parentDependenciesKey: job.parentKey
+                ? `${job.parentKey}:dependencies`
+                : '',
+        });
+        return job;
+    }
+    /**
+     * Creates a bulk of jobs and adds them atomically to the given queue.
+     *
+     * @param queue - the queue where to add the jobs.
+     * @param jobs - an array of jobs to be added to the queue.
+     * @returns The created Job instances
+     */
+    static async createBulk(queue, jobs) {
+        const client = await queue.client;
+        const jobInstances = jobs.map(job => { var _a; return new this(queue, job.name, job.data, job.opts, (_a = job.opts) === null || _a === void 0 ? void 0 : _a.jobId); });
+        const pipeline = client.pipeline();
+        for (const job of jobInstances) {
+            job.addJob(pipeline, {
+                parentKey: job.parentKey,
+                parentDependenciesKey: job.parentKey
+                    ? `${job.parentKey}:dependencies`
+                    : '',
+            });
+        }
+        const results = (await pipeline.exec());
+        for (let index = 0; index < results.length; ++index) {
+            const [err, id] = results[index];
+            if (err) {
+                throw err;
+            }
+            jobInstances[index].id = id;
+        }
+        return jobInstances;
+    }
+    /**
+     * Instantiates a Job from a JobJsonRaw object (coming from a deserialized JSON object)
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param json - the plain object containing the job.
+     * @param jobId - an optional job id (overrides the id coming from the JSON object)
+     * @returns A Job instance reconstructed from the JSON data
+     */
+    static fromJSON(queue, json, jobId) {
+        const data = JSON.parse(json.data || '{}');
+        const opts = Job.optsFromJSON(json.opts);
+        const job = new this(queue, json.name, data, opts, json.id || jobId);
+        job.progress = JSON.parse(json.progress || '0');
+        job.delay = parseInt(json.delay);
+        job.priority = parseInt(json.priority);
+        job.timestamp = parseInt(json.timestamp);
+        if (json.finishedOn) {
+            job.finishedOn = parseInt(json.finishedOn);
+        }
+        if (json.processedOn) {
+            job.processedOn = parseInt(json.processedOn);
+        }
+        if (json.rjk) {
+            job.repeatJobKey = json.rjk;
+        }
+        if (json.deid) {
+            job.debounceId = json.deid;
+            job.deduplicationId = json.deid;
+        }
+        if (json.failedReason) {
+            job.failedReason = json.failedReason;
+        }
+        job.attemptsStarted = parseInt(json.ats || '0');
+        job.attemptsMade = parseInt(json.attemptsMade || json.atm || '0');
+        job.stalledCounter = parseInt(json.stc || '0');
+        if (json.defa) {
+            job.deferredFailure = json.defa;
+        }
+        job.stacktrace = getTraces(json.stacktrace);
+        if (typeof json.returnvalue === 'string') {
+            job.returnvalue = getReturnValue(json.returnvalue);
+        }
+        if (json.parentKey) {
+            job.parentKey = json.parentKey;
+        }
+        else {
+            job.parentKey = undefined;
+        }
+        if (json.parent) {
+            job.parent = JSON.parse(json.parent);
+        }
+        else {
+            job.parent = undefined;
+        }
+        if (json.pb) {
+            job.processedBy = json.pb;
+        }
+        if (json.nrjid) {
+            job.nextRepeatableJobId = json.nrjid;
+        }
+        return job;
+    }
+    createScripts() {
+        this.scripts = (0, create_scripts_1.createScripts)(this.queue);
+    }
+    static optsFromJSON(rawOpts, optsDecode = utils_1.optsDecodeMap) {
+        const opts = JSON.parse(rawOpts || '{}');
+        const optionEntries = Object.entries(opts);
+        const options = {};
+        for (const item of optionEntries) {
+            const [attributeName, value] = item;
+            if (optsDecode[attributeName]) {
+                options[optsDecode[attributeName]] =
+                    value;
+            }
+            else {
+                if (attributeName === 'tm') {
+                    options.telemetry = Object.assign(Object.assign({}, options.telemetry), { metadata: value });
+                }
+                else if (attributeName === 'omc') {
+                    options.telemetry = Object.assign(Object.assign({}, options.telemetry), { omitContext: value });
+                }
+                else {
+                    options[attributeName] = value;
+                }
+            }
+        }
+        return options;
+    }
+    /**
+     * Fetches a Job from the queue given the passed job id.
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param jobId - the job id.
+     * @returns
+     */
+    static async fromId(queue, jobId) {
+        // jobId can be undefined if moveJob returns undefined
+        if (jobId) {
+            const client = await queue.client;
+            const jobData = await client.hgetall(queue.toKey(jobId));
+            return (0, utils_1.isEmpty)(jobData)
+                ? undefined
+                : this.fromJSON(queue, jobData, jobId);
+        }
+    }
+    /**
+     * addJobLog
+     *
+     * @param queue - A minimal queue instance
+     * @param jobId - Job id
+     * @param logRow - String with a row of log data to be logged
+     * @param keepLogs - The optional amount of log entries to preserve
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    static addJobLog(queue, jobId, logRow, keepLogs) {
+        const scripts = queue.scripts;
+        return scripts.addLog(jobId, logRow, keepLogs);
+    }
+    toJSON() {
+        const _a = this, { queue, scripts } = _a, withoutQueueAndScripts = tslib_1.__rest(_a, ["queue", "scripts"]);
+        return withoutQueueAndScripts;
+    }
+    /**
+     * Prepares a job to be serialized for storage in Redis.
+     * @returns
+     */
+    asJSON() {
+        return (0, utils_1.removeUndefinedFields)({
+            id: this.id,
+            name: this.name,
+            data: JSON.stringify(typeof this.data === 'undefined' ? {} : this.data),
+            opts: Job.optsAsJSON(this.opts),
+            parent: this.parent ? Object.assign({}, this.parent) : undefined,
+            parentKey: this.parentKey,
+            progress: this.progress,
+            attemptsMade: this.attemptsMade,
+            attemptsStarted: this.attemptsStarted,
+            stalledCounter: this.stalledCounter,
+            finishedOn: this.finishedOn,
+            processedOn: this.processedOn,
+            timestamp: this.timestamp,
+            failedReason: JSON.stringify(this.failedReason),
+            stacktrace: JSON.stringify(this.stacktrace),
+            debounceId: this.debounceId,
+            deduplicationId: this.deduplicationId,
+            repeatJobKey: this.repeatJobKey,
+            returnvalue: JSON.stringify(this.returnvalue),
+            nrjid: this.nextRepeatableJobId,
+        });
+    }
+    static optsAsJSON(opts = {}, optsEncode = utils_1.optsEncodeMap) {
+        const optionEntries = Object.entries(opts);
+        const options = {};
+        for (const [attributeName, value] of optionEntries) {
+            if (typeof value === 'undefined') {
+                continue;
+            }
+            if (attributeName in optsEncode) {
+                const compressableAttribute = attributeName;
+                const key = optsEncode[compressableAttribute];
+                options[key] = value;
+            }
+            else {
+                // Handle complex compressable fields separately
+                if (attributeName === 'telemetry') {
+                    if (value.metadata !== undefined) {
+                        options.tm = value.metadata;
+                    }
+                    if (value.omitContext !== undefined) {
+                        options.omc = value.omitContext;
+                    }
+                }
+                else {
+                    options[attributeName] = value;
+                }
+            }
+        }
+        return options;
+    }
+    /**
+     * Prepares a job to be passed to Sandbox.
+     * @returns
+     */
+    asJSONSandbox() {
+        return Object.assign(Object.assign({}, this.asJSON()), { queueName: this.queueName, queueQualifiedName: this.queueQualifiedName, prefix: this.prefix });
+    }
+    /**
+     * Updates a job's data
+     *
+     * @param data - the data that will replace the current jobs data.
+     */
+    updateData(data) {
+        this.data = data;
+        return this.scripts.updateData(this, data);
+    }
+    /**
+     * Updates a job's progress
+     *
+     * @param progress - number or object to be saved as progress.
+     */
+    async updateProgress(progress) {
+        this.progress = progress;
+        await this.scripts.updateProgress(this.id, progress);
+        this.queue.emit('progress', this, progress);
+    }
+    /**
+     * Logs one row of log data.
+     *
+     * @param logRow - string with log data to be logged.
+     * @returns The total number of log entries for this job so far.
+     */
+    async log(logRow) {
+        return Job.addJobLog(this.queue, this.id, logRow, this.opts.keepLogs);
+    }
+    /**
+     * Removes child dependency from parent when child is not yet finished
+     *
+     * @returns True if the relationship existed and if it was removed.
+     */
+    async removeChildDependency() {
+        const childDependencyIsRemoved = await this.scripts.removeChildDependency(this.id, this.parentKey);
+        if (childDependencyIsRemoved) {
+            this.parent = undefined;
+            this.parentKey = undefined;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Clears job's logs
+     *
+     * @param keepLogs - the amount of log entries to preserve
+     */
+    async clearLogs(keepLogs) {
+        const client = await this.queue.client;
+        const logsKey = this.toKey(this.id) + ':logs';
+        if (keepLogs) {
+            await client.ltrim(logsKey, -keepLogs, -1);
+        }
+        else {
+            await client.del(logsKey);
+        }
+    }
+    /**
+     * Completely remove the job from the queue.
+     * Note, this call will throw an exception if the job
+     * is being processed when the call is performed.
+     *
+     * @param opts - Options to remove a job
+     */
+    async remove({ removeChildren = true } = {}) {
+        await this.queue.waitUntilReady();
+        const queue = this.queue;
+        const job = this;
+        const removed = await this.scripts.remove(job.id, removeChildren);
+        if (removed) {
+            queue.emit('removed', job);
+        }
+        else {
+            throw new Error(`Job ${this.id} could not be removed because it is locked by another worker`);
+        }
+    }
+    /**
+     * Remove all children from this job that are not yet processed,
+     * in other words that are in any other state than completed, failed or active.
+     *
+     * @remarks
+     *  - Jobs with locks (most likely active) are ignored.
+     *  - This method can be slow if the number of children is large (\> 1000).
+     */
+    async removeUnprocessedChildren() {
+        const jobId = this.id;
+        await this.scripts.removeUnprocessedChildren(jobId);
+    }
+    /**
+     * Extend the lock for this job.
+     *
+     * @param token - unique token for the lock
+     * @param duration - lock duration in milliseconds
+     */
+    extendLock(token, duration) {
+        return this.scripts.extendLock(this.id, token, duration);
+    }
+    /**
+     * Moves a job to the completed queue.
+     * Returned job to be used with Queue.prototype.nextJobFromJobData.
+     *
+     * @param returnValue - The jobs success message.
+     * @param token - Worker token used to acquire completed job.
+     * @param fetchNext - True when wanting to fetch the next job.
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    async moveToCompleted(returnValue, token, fetchNext = true) {
+        return this.queue.trace(enums_1.SpanKind.INTERNAL, 'complete', this.queue.name, async (span) => {
+            this.setSpanJobAttributes(span);
+            await this.queue.waitUntilReady();
+            this.returnvalue = returnValue || void 0;
+            const stringifiedReturnValue = (0, utils_1.tryCatch)(JSON.stringify, JSON, [
+                returnValue,
+            ]);
+            if (stringifiedReturnValue === utils_1.errorObject) {
+                throw utils_1.errorObject.value;
+            }
+            const args = this.scripts.moveToCompletedArgs(this, stringifiedReturnValue, this.opts.removeOnComplete, token, fetchNext);
+            const result = await this.scripts.moveToFinished(this.id, args);
+            this.finishedOn = args[this.scripts.moveToFinishedKeys.length + 1];
+            this.attemptsMade += 1;
+            this.recordJobMetrics('completed');
+            return result;
+        });
+    }
+    /**
+     * Moves a job to the wait or prioritized state.
+     *
+     * @param token - Worker token used to acquire completed job.
+     * @returns Returns pttl.
+     */
+    async moveToWait(token) {
+        const result = await this.scripts.moveJobFromActiveToWait(this.id, token);
+        this.recordJobMetrics('waiting');
+        return result;
+    }
+    async shouldRetryJob(err) {
+        if (this.attemptsMade + 1 < this.opts.attempts &&
+            !this.discarded &&
+            !(err instanceof unrecoverable_error_1.UnrecoverableError || err.name == 'UnrecoverableError')) {
+            const opts = this.queue.opts;
+            const delay = await backoffs_1.Backoffs.calculate(this.opts.backoff, this.attemptsMade + 1, err, this, opts.settings && opts.settings.backoffStrategy);
+            return [delay == -1 ? false : true, delay == -1 ? 0 : delay];
+        }
+        else {
+            return [false, 0];
+        }
+    }
+    /**
+     * Moves a job to the failed queue.
+     *
+     * @param err - the jobs error message.
+     * @param token - token to check job is locked by current worker
+     * @param fetchNext - true when wanting to fetch the next job
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    async moveToFailed(err, token, fetchNext = false) {
+        this.failedReason = err === null || err === void 0 ? void 0 : err.message;
+        // Check if an automatic retry should be performed
+        const [shouldRetry, retryDelay] = await this.shouldRetryJob(err);
+        return this.queue.trace(enums_1.SpanKind.INTERNAL, this.getSpanOperation(shouldRetry, retryDelay), this.queue.name, async (span, dstPropagationMetadata) => {
+            var _a, _b;
+            this.setSpanJobAttributes(span);
+            let tm;
+            if (!((_b = (_a = this.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.omitContext) && dstPropagationMetadata) {
+                tm = dstPropagationMetadata;
+            }
+            let result;
+            this.updateStacktrace(err);
+            const fieldsToUpdate = {
+                failedReason: this.failedReason,
+                stacktrace: JSON.stringify(this.stacktrace),
+                tm,
+            };
+            let finishedOn;
+            if (shouldRetry) {
+                if (retryDelay) {
+                    // Retry with delay
+                    result = await this.scripts.moveToDelayed(this.id, Date.now(), retryDelay, token, { fieldsToUpdate, fetchNext });
+                    this.recordJobMetrics('delayed');
+                }
+                else {
+                    // Retry immediately
+                    result = await this.scripts.retryJob(this.id, this.opts.lifo, token, {
+                        fieldsToUpdate,
+                    });
+                    this.recordJobMetrics('retried');
+                }
+            }
+            else {
+                const args = this.scripts.moveToFailedArgs(this, this.failedReason, this.opts.removeOnFail, token, fetchNext, fieldsToUpdate);
+                result = await this.scripts.moveToFinished(this.id, args);
+                finishedOn = args[this.scripts.moveToFinishedKeys.length + 1];
+                // Only record failed metrics when job is not retrying
+                this.recordJobMetrics('failed');
+            }
+            if (finishedOn && typeof finishedOn === 'number') {
+                this.finishedOn = finishedOn;
+            }
+            if (retryDelay && typeof retryDelay === 'number') {
+                this.delay = retryDelay;
+            }
+            this.attemptsMade += 1;
+            return result;
+        });
+    }
+    getSpanOperation(shouldRetry, retryDelay) {
+        if (shouldRetry) {
+            if (retryDelay) {
+                return 'delay';
+            }
+            return 'retry';
+        }
+        return 'fail';
+    }
+    /**
+     * Records job metrics if a meter is configured in telemetry options.
+     *
+     * @param status - The job status
+     */
+    recordJobMetrics(status) {
+        var _a, _b;
+        const meter = (_b = (_a = this.queue.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.meter;
+        if (!meter) {
+            return;
+        }
+        const attributes = {
+            [enums_1.TelemetryAttributes.QueueName]: this.queue.name,
+            [enums_1.TelemetryAttributes.JobName]: this.name,
+            [enums_1.TelemetryAttributes.JobStatus]: status,
+        };
+        // Record counter metric based on status
+        const statusToCounterName = {
+            completed: enums_1.MetricNames.JobsCompleted,
+            failed: enums_1.MetricNames.JobsFailed,
+            delayed: enums_1.MetricNames.JobsDelayed,
+            retried: enums_1.MetricNames.JobsRetried,
+            waiting: enums_1.MetricNames.JobsWaiting,
+            'waiting-children': enums_1.MetricNames.JobsWaitingChildren,
+        };
+        const counterName = statusToCounterName[status];
+        const counter = meter.createCounter(counterName, {
+            description: `Number of jobs ${status}`,
+            unit: '1',
+        });
+        counter.add(1, attributes);
+        // Record duration histogram if processedOn is available
+        if (this.processedOn) {
+            const duration = Date.now() - this.processedOn;
+            const histogram = meter.createHistogram(enums_1.MetricNames.JobDuration, {
+                description: 'Job processing duration',
+                unit: 'ms',
+            });
+            histogram.record(duration, attributes);
+        }
+    }
+    /**
+     * @returns true if the job has completed.
+     */
+    isCompleted() {
+        return this.isInZSet('completed');
+    }
+    /**
+     * @returns true if the job has failed.
+     */
+    isFailed() {
+        return this.isInZSet('failed');
+    }
+    /**
+     * @returns true if the job is delayed.
+     */
+    isDelayed() {
+        return this.isInZSet('delayed');
+    }
+    /**
+     * @returns true if the job is waiting for children.
+     */
+    isWaitingChildren() {
+        return this.isInZSet('waiting-children');
+    }
+    /**
+     * @returns true of the job is active.
+     */
+    isActive() {
+        return this.isInList('active');
+    }
+    /**
+     * @returns true if the job is waiting.
+     */
+    async isWaiting() {
+        return (await this.isInList('wait')) || (await this.isInList('paused'));
+    }
+    /**
+     * @returns the queue name this job belongs to.
+     */
+    get queueName() {
+        return this.queue.name;
+    }
+    /**
+     * @returns the prefix that is used.
+     */
+    get prefix() {
+        return this.queue.opts.prefix;
+    }
+    /**
+     * Get current state.
+     *
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getState() {
+        return this.scripts.getState(this.id);
+    }
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns void
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    async changeDelay(delay) {
+        await this.scripts.changeDelay(this.id, delay);
+        this.delay = delay;
+    }
+    /**
+     * Change job priority.
+     *
+     * @param opts - options containing priority and lifo values.
+     * @returns void
+     */
+    async changePriority(opts) {
+        await this.scripts.changePriority(this.id, opts.priority, opts.lifo);
+        this.priority = opts.priority || 0;
+    }
+    /**
+     * Get this jobs children result values if any.
+     *
+     * @returns Object mapping children job keys with their values.
+     */
+    async getChildrenValues() {
+        const client = await this.queue.client;
+        const result = (await client.hgetall(this.toKey(`${this.id}:processed`)));
+        if (result) {
+            return (0, utils_1.parseObjectValues)(result);
+        }
+    }
+    /**
+     * Retrieves the failures of child jobs that were explicitly ignored while using ignoreDependencyOnFailure option.
+     * This method is useful for inspecting which child jobs were intentionally ignored when an error occurred.
+     * @see {@link https://docs.bullmq.io/guide/flows/ignore-dependency}
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    async getIgnoredChildrenFailures() {
+        const client = await this.queue.client;
+        return client.hgetall(this.toKey(`${this.id}:failed`));
+    }
+    /**
+     * Get job's children failure values that were ignored if any.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getIgnoredChildrenFailures instead.
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    async getFailedChildrenValues() {
+        const client = await this.queue.client;
+        return client.hgetall(this.toKey(`${this.id}:failed`));
+    }
+    /**
+     * Get children job keys if this job is a parent and has children.
+     * @remarks
+     * Count options before Redis v7.2 works as expected with any quantity of entries
+     * on processed/unprocessed dependencies, since v7.2 you must consider that count
+     * won't have any effect until processed/unprocessed dependencies have a length
+     * greater than 127
+     * @see {@link https://redis.io/docs/management/optimization/memory-optimization/#redis--72}
+     * @see {@link https://docs.bullmq.io/guide/flows#getters}
+     * @returns dependencies separated by processed, unprocessed, ignored and failed.
+     */
+    async getDependencies(opts = {}) {
+        const client = await this.queue.client;
+        const multi = client.pipeline();
+        if (!opts.processed && !opts.unprocessed && !opts.ignored && !opts.failed) {
+            multi.hgetall(this.toKey(`${this.id}:processed`));
+            multi.smembers(this.toKey(`${this.id}:dependencies`));
+            multi.hgetall(this.toKey(`${this.id}:failed`));
+            multi.zrange(this.toKey(`${this.id}:unsuccessful`), 0, -1);
+            const [[err1, processed], [err2, unprocessed], [err3, ignored], [err4, failed],] = (await multi.exec());
+            return {
+                processed: (0, utils_1.parseObjectValues)(processed),
+                unprocessed,
+                failed,
+                ignored,
+            };
+        }
+        else {
+            const defaultOpts = {
+                cursor: 0,
+                count: 20,
+            };
+            const childrenResultOrder = [];
+            if (opts.processed) {
+                childrenResultOrder.push('processed');
+                const processedOpts = Object.assign(Object.assign({}, defaultOpts), opts.processed);
+                multi.hscan(this.toKey(`${this.id}:processed`), processedOpts.cursor, {
+                    COUNT: processedOpts.count,
+                });
+            }
+            if (opts.unprocessed) {
+                childrenResultOrder.push('unprocessed');
+                const unprocessedOpts = Object.assign(Object.assign({}, defaultOpts), opts.unprocessed);
+                multi.sscan(this.toKey(`${this.id}:dependencies`), unprocessedOpts.cursor, { COUNT: unprocessedOpts.count });
+            }
+            if (opts.ignored) {
+                childrenResultOrder.push('ignored');
+                const ignoredOpts = Object.assign(Object.assign({}, defaultOpts), opts.ignored);
+                multi.hscan(this.toKey(`${this.id}:failed`), ignoredOpts.cursor, {
+                    COUNT: ignoredOpts.count,
+                });
+            }
+            let failedCursor;
+            if (opts.failed) {
+                childrenResultOrder.push('failed');
+                const failedOpts = Object.assign(Object.assign({}, defaultOpts), opts.failed);
+                failedCursor = failedOpts.cursor + failedOpts.count;
+                multi.zrange(this.toKey(`${this.id}:unsuccessful`), failedOpts.cursor, failedOpts.count - 1);
+            }
+            const results = (await multi.exec());
+            let processedCursor, processed, unprocessedCursor, unprocessed, failed, ignoredCursor, ignored;
+            childrenResultOrder.forEach((key, index) => {
+                switch (key) {
+                    case 'processed': {
+                        processedCursor = results[index][1][0];
+                        const rawProcessed = results[index][1][1];
+                        const transformedProcessed = {};
+                        for (let ind = 0; ind < rawProcessed.length; ++ind) {
+                            if (ind % 2) {
+                                transformedProcessed[rawProcessed[ind - 1]] = JSON.parse(rawProcessed[ind]);
+                            }
+                        }
+                        processed = transformedProcessed;
+                        break;
+                    }
+                    case 'failed': {
+                        failed = results[index][1];
+                        break;
+                    }
+                    case 'ignored': {
+                        ignoredCursor = results[index][1][0];
+                        const rawIgnored = results[index][1][1];
+                        const transformedIgnored = {};
+                        for (let ind = 0; ind < rawIgnored.length; ++ind) {
+                            if (ind % 2) {
+                                transformedIgnored[rawIgnored[ind - 1]] = rawIgnored[ind];
+                            }
+                        }
+                        ignored = transformedIgnored;
+                        break;
+                    }
+                    case 'unprocessed': {
+                        unprocessedCursor = results[index][1][0];
+                        unprocessed = results[index][1][1];
+                        break;
+                    }
+                }
+            });
+            return Object.assign(Object.assign(Object.assign(Object.assign({}, (processedCursor
+                ? {
+                    processed,
+                    nextProcessedCursor: Number(processedCursor),
+                }
+                : {})), (ignoredCursor
+                ? {
+                    ignored,
+                    nextIgnoredCursor: Number(ignoredCursor),
+                }
+                : {})), (failedCursor
+                ? {
+                    failed,
+                    nextFailedCursor: failedCursor,
+                }
+                : {})), (unprocessedCursor
+                ? { unprocessed, nextUnprocessedCursor: Number(unprocessedCursor) }
+                : {}));
+        }
+    }
+    /**
+     * Get children job counts if this job is a parent and has children.
+     *
+     * @returns dependencies count separated by processed, unprocessed, ignored and failed.
+     */
+    async getDependenciesCount(opts = {}) {
+        const types = [];
+        Object.entries(opts).forEach(([key, value]) => {
+            if (value) {
+                types.push(key);
+            }
+        });
+        const finalTypes = types.length
+            ? types
+            : ['processed', 'unprocessed', 'ignored', 'failed'];
+        const responses = await this.scripts.getDependencyCounts(this.id, finalTypes);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[`${finalTypes[index]}`] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Returns a promise the resolves when the job has completed (containing the return value of the job),
+     * or rejects when the job has failed (containing the failedReason).
+     *
+     * @param queueEvents - Instance of QueueEvents.
+     * @param ttl - Time in milliseconds to wait for job to finish before timing out.
+     */
+    async waitUntilFinished(queueEvents, ttl) {
+        await this.queue.waitUntilReady();
+        const jobId = this.id;
+        return new Promise(async (resolve, reject) => {
+            let timeout;
+            if (ttl) {
+                timeout = setTimeout(() => onFailed(
+                /* eslint-disable max-len */
+                `Job wait ${this.name} timed out before finishing, no finish notification arrived after ${ttl}ms (id=${jobId})`), ttl);
+            }
+            function onCompleted(args) {
+                removeListeners();
+                resolve(args.returnvalue);
+            }
+            function onFailed(args) {
+                removeListeners();
+                reject(new Error(args.failedReason || args));
+            }
+            const completedEvent = `completed:${jobId}`;
+            const failedEvent = `failed:${jobId}`;
+            queueEvents.on(completedEvent, onCompleted);
+            queueEvents.on(failedEvent, onFailed);
+            this.queue.on('closing', onFailed);
+            const removeListeners = () => {
+                clearInterval(timeout);
+                queueEvents.removeListener(completedEvent, onCompleted);
+                queueEvents.removeListener(failedEvent, onFailed);
+                this.queue.removeListener('closing', onFailed);
+            };
+            // Poll once right now to see if the job has already finished. The job may have been completed before we were able
+            // to register the event handlers on the QueueEvents, so we check here to make sure we're not waiting for an event
+            // that has already happened. We block checking the job until the queue events object is actually listening to
+            // Redis so there's no chance that it will miss events.
+            await queueEvents.waitUntilReady();
+            const [status, result] = (await this.scripts.isFinished(jobId, true));
+            const finished = status != 0;
+            if (finished) {
+                if (status == -1 || status == 2) {
+                    onFailed({ failedReason: result });
+                }
+                else {
+                    onCompleted({ returnvalue: getReturnValue(result) });
+                }
+            }
+        });
+    }
+    /**
+     * Moves the job to the delay set.
+     *
+     * @param timestamp - timestamp when the job should be moved back to "wait"
+     * @param token - token to check job is locked by current worker
+     * @returns
+     */
+    async moveToDelayed(timestamp, token) {
+        const now = Date.now();
+        const delay = timestamp - now;
+        const finalDelay = delay > 0 ? delay : 0;
+        await this.scripts.moveToDelayed(this.id, now, finalDelay, token, {
+            skipAttempt: true,
+        });
+        this.delay = finalDelay;
+        this.recordJobMetrics('delayed');
+    }
+    /**
+     * Moves the job to the waiting-children set.
+     *
+     * @param token - Token to check job is locked by current worker
+     * @param opts - The options bag for moving a job to waiting-children.
+     * @returns true if the job was moved
+     */
+    async moveToWaitingChildren(token, opts = {}) {
+        const movedToWaitingChildren = await this.scripts.moveToWaitingChildren(this.id, token, opts);
+        if (movedToWaitingChildren) {
+            this.recordJobMetrics('waiting-children');
+        }
+        return movedToWaitingChildren;
+    }
+    /**
+     * Promotes a delayed job so that it starts to be processed as soon as possible.
+     */
+    async promote() {
+        const jobId = this.id;
+        await this.scripts.promote(jobId);
+        this.delay = 0;
+    }
+    /**
+     * Attempts to retry the job. Only a job that has failed or completed can be retried.
+     *
+     * @param state - completed / failed
+     * @param opts - options to retry a job
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * The queue emits a waiting event when the job is successfully moved.
+     * @throws Will throw an error if the job does not exist, is locked, or is not in the expected state.
+     */
+    async retry(state = 'failed', opts = {}) {
+        await this.scripts.reprocessJob(this, state, opts);
+        this.failedReason = null;
+        this.finishedOn = null;
+        this.processedOn = null;
+        this.returnvalue = null;
+        if (opts.resetAttemptsMade) {
+            this.attemptsMade = 0;
+        }
+        if (opts.resetAttemptsStarted) {
+            this.attemptsStarted = 0;
+        }
+    }
+    /**
+     * Marks a job to not be retried if it fails (even if attempts has been configured)
+     * @deprecated use UnrecoverableError
+     */
+    discard() {
+        this.discarded = true;
+    }
+    async isInZSet(set) {
+        const client = await this.queue.client;
+        const score = await client.zscore(this.queue.toKey(set), this.id);
+        return score !== null;
+    }
+    async isInList(list) {
+        return this.scripts.isJobInList(this.queue.toKey(list), this.id);
+    }
+    /**
+     * Adds the job to Redis.
+     *
+     * @param client - The Redis client to use for adding the job.
+     * @param parentOpts - Options for the parent-child relationship.
+     * @returns The job ID
+     */
+    addJob(client, parentOpts) {
+        const jobData = this.asJSON();
+        this.validateOptions(jobData);
+        return this.scripts.addJob(client, jobData, jobData.opts, this.id, parentOpts);
+    }
+    /**
+     * Removes a deduplication key if job is still the cause of deduplication.
+     * @returns true if the deduplication key was removed.
+     */
+    async removeDeduplicationKey() {
+        if (this.deduplicationId) {
+            const result = await this.scripts.removeDeduplicationKey(this.deduplicationId, this.id);
+            return result > 0;
+        }
+        return false;
+    }
+    validateOptions(jobData) {
+        var _a, _b, _c, _d, _e, _f, _g, _h;
+        const exclusiveOptions = [
+            'removeDependencyOnFailure',
+            'failParentOnFailure',
+            'continueParentOnFailure',
+            'ignoreDependencyOnFailure',
+        ];
+        const exceedLimit = this.opts.sizeLimit &&
+            (0, utils_1.lengthInUtf8Bytes)(jobData.data) > this.opts.sizeLimit;
+        if (exceedLimit) {
+            throw new Error(`The size of job ${this.name} exceeds the limit ${this.opts.sizeLimit} bytes`);
+        }
+        if (this.opts.delay && this.opts.repeat && !((_a = this.opts.repeat) === null || _a === void 0 ? void 0 : _a.count)) {
+            throw new Error(`Delay and repeat options cannot be used together`);
+        }
+        const enabledExclusiveOptions = exclusiveOptions.filter(opt => this.opts[opt]);
+        if (enabledExclusiveOptions.length > 1) {
+            const optionsList = enabledExclusiveOptions.join(', ');
+            throw new Error(`The following options cannot be used together: ${optionsList}`);
+        }
+        if ((_b = this.opts) === null || _b === void 0 ? void 0 : _b.jobId) {
+            if (`${parseInt(this.opts.jobId, 10)}` === ((_c = this.opts) === null || _c === void 0 ? void 0 : _c.jobId)) {
+                throw new Error('Custom Id cannot be integers');
+            }
+            // TODO: replace this check in next breaking check with include(':')
+            // By using split we are still keeping compatibility with old repeatable jobs
+            if (((_d = this.opts) === null || _d === void 0 ? void 0 : _d.jobId.includes(':')) &&
+                ((_f = (_e = this.opts) === null || _e === void 0 ? void 0 : _e.jobId) === null || _f === void 0 ? void 0 : _f.split(':').length) !== 3) {
+                throw new Error('Custom Id cannot contain :');
+            }
+        }
+        if (this.opts.priority) {
+            if (Math.trunc(this.opts.priority) !== this.opts.priority) {
+                throw new Error(`Priority should not be float`);
+            }
+            if (this.opts.priority > exports.PRIORITY_LIMIT) {
+                throw new Error(`Priority should be between 0 and ${exports.PRIORITY_LIMIT}`);
+            }
+        }
+        if (this.opts.deduplication) {
+            if (!((_g = this.opts.deduplication) === null || _g === void 0 ? void 0 : _g.id)) {
+                throw new Error('Deduplication id must be provided');
+            }
+            if (this.parentKey) {
+                throw new Error('Deduplication and parent options cannot be used together');
+            }
+        }
+        // TODO: remove in v6
+        if (this.opts.debounce) {
+            if (!((_h = this.opts.debounce) === null || _h === void 0 ? void 0 : _h.id)) {
+                throw new Error('Debounce id must be provided');
+            }
+            if (this.parentKey) {
+                throw new Error('Debounce and parent options cannot be used together');
+            }
+        }
+        if (typeof this.opts.backoff === 'object' &&
+            typeof this.opts.backoff.jitter === 'number') {
+            if (this.opts.backoff.jitter < 0 || this.opts.backoff.jitter > 1) {
+                throw new Error(`Jitter should be between 0 and 1`);
+            }
+        }
+    }
+    updateStacktrace(err) {
+        this.stacktrace = this.stacktrace || [];
+        if (err === null || err === void 0 ? void 0 : err.stack) {
+            this.stacktrace.push(err.stack);
+            if (this.opts.stackTraceLimit === 0) {
+                this.stacktrace = [];
+            }
+            else if (this.opts.stackTraceLimit) {
+                this.stacktrace = this.stacktrace.slice(-this.opts.stackTraceLimit);
+            }
+        }
+    }
+    setSpanJobAttributes(span) {
+        span === null || span === void 0 ? void 0 : span.setAttributes({
+            [enums_1.TelemetryAttributes.JobName]: this.name,
+            [enums_1.TelemetryAttributes.JobId]: this.id,
+        });
+    }
+}
+exports.Job = Job;
+function getTraces(stacktrace) {
+    if (!stacktrace) {
+        return [];
+    }
+    const traces = (0, utils_1.tryCatch)(JSON.parse, JSON, [stacktrace]);
+    if (traces === utils_1.errorObject || !(traces instanceof Array)) {
+        return [];
+    }
+    else {
+        return traces;
+    }
+}
+function getReturnValue(_value) {
+    const value = (0, utils_1.tryCatch)(JSON.parse, JSON, [_value]);
+    if (value !== utils_1.errorObject) {
+        return value;
+    }
+    else {
+        logger('corrupted returnvalue: ' + _value, value);
+    }
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/lock-manager.js b/node_modules/bullmq/dist/cjs/classes/lock-manager.js
new file mode 100644
index 0000000..931d065
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/lock-manager.js
@@ -0,0 +1,164 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LockManager = void 0;
+const abort_controller_1 = require("./abort-controller");
+const enums_1 = require("../enums");
+/**
+ * Manages lock renewal for BullMQ workers.
+ * It periodically extends locks for active jobs to prevent them from being
+ * considered stalled by other workers.
+ */
+class LockManager {
+    constructor(worker, opts) {
+        this.worker = worker;
+        this.opts = opts;
+        // Maps job ids with their tokens, timestamps, and abort controllers
+        this.trackedJobs = new Map();
+        this.closed = false;
+    }
+    /**
+     * Starts the lock manager timers for lock renewal.
+     */
+    start() {
+        if (this.closed) {
+            return;
+        }
+        // Start lock renewal timer if not disabled
+        if (this.opts.lockRenewTime > 0) {
+            this.startLockExtenderTimer();
+        }
+    }
+    async extendLocks(jobIds) {
+        await this.worker.trace(enums_1.SpanKind.INTERNAL, 'extendLocks', this.worker.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.opts.workerId,
+                [enums_1.TelemetryAttributes.WorkerName]: this.opts.workerName,
+                [enums_1.TelemetryAttributes.WorkerJobsToExtendLocks]: jobIds,
+            });
+            try {
+                const jobTokens = jobIds.map(id => { var _a; return ((_a = this.trackedJobs.get(id)) === null || _a === void 0 ? void 0 : _a.token) || ''; });
+                const erroredJobIds = await this.worker.extendJobLocks(jobIds, jobTokens, this.opts.lockDuration);
+                if (erroredJobIds.length > 0) {
+                    this.worker.emit('lockRenewalFailed', erroredJobIds);
+                    for (const jobId of erroredJobIds) {
+                        this.worker.emit('error', new Error(`could not renew lock for job ${jobId}`));
+                    }
+                }
+                const succeededJobIds = jobIds.filter(id => !erroredJobIds.includes(id));
+                if (succeededJobIds.length > 0) {
+                    this.worker.emit('locksRenewed', {
+                        count: succeededJobIds.length,
+                        jobIds: succeededJobIds,
+                    });
+                }
+            }
+            catch (err) {
+                this.worker.emit('error', err);
+            }
+        });
+    }
+    startLockExtenderTimer() {
+        clearTimeout(this.lockRenewalTimer);
+        if (!this.closed) {
+            this.lockRenewalTimer = setTimeout(async () => {
+                // Get all the jobs whose locks expire in less than 1/2 of the lockRenewTime
+                const now = Date.now();
+                const jobsToExtend = [];
+                for (const jobId of this.trackedJobs.keys()) {
+                    const tracked = this.trackedJobs.get(jobId);
+                    const { ts, token, abortController } = tracked;
+                    if (!ts) {
+                        this.trackedJobs.set(jobId, { token, ts: now, abortController });
+                        continue;
+                    }
+                    if (ts + this.opts.lockRenewTime / 2 < now) {
+                        this.trackedJobs.set(jobId, { token, ts: now, abortController });
+                        jobsToExtend.push(jobId);
+                    }
+                }
+                if (jobsToExtend.length) {
+                    await this.extendLocks(jobsToExtend);
+                }
+                this.startLockExtenderTimer();
+            }, this.opts.lockRenewTime / 2);
+        }
+    }
+    /**
+     * Stops the lock manager and clears all timers.
+     */
+    async close() {
+        if (this.closed) {
+            return;
+        }
+        this.closed = true;
+        if (this.lockRenewalTimer) {
+            clearTimeout(this.lockRenewalTimer);
+            this.lockRenewalTimer = undefined;
+        }
+        this.trackedJobs.clear();
+    }
+    /**
+     * Adds a job to be tracked for lock renewal.
+     * Returns an AbortController if shouldCreateController is true, undefined otherwise.
+     */
+    trackJob(jobId, token, ts, shouldCreateController = false) {
+        const abortController = shouldCreateController
+            ? new abort_controller_1.AbortController()
+            : undefined;
+        if (!this.closed && jobId) {
+            this.trackedJobs.set(jobId, { token, ts, abortController });
+        }
+        return abortController;
+    }
+    /**
+     * Removes a job from lock renewal tracking.
+     */
+    untrackJob(jobId) {
+        this.trackedJobs.delete(jobId);
+    }
+    /**
+     * Gets the number of jobs currently being tracked.
+     */
+    getActiveJobCount() {
+        return this.trackedJobs.size;
+    }
+    /**
+     * Checks if the lock manager is running.
+     */
+    isRunning() {
+        return !this.closed && this.lockRenewalTimer !== undefined;
+    }
+    /**
+     * Cancels a specific job by aborting its signal.
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId, reason) {
+        const tracked = this.trackedJobs.get(jobId);
+        if (tracked === null || tracked === void 0 ? void 0 : tracked.abortController) {
+            tracked.abortController.abort(reason);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Cancels all tracked jobs by aborting their signals.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason) {
+        for (const tracked of this.trackedJobs.values()) {
+            if (tracked.abortController) {
+                tracked.abortController.abort(reason);
+            }
+        }
+    }
+    /**
+     * Gets a list of all tracked job IDs.
+     * @returns Array of job IDs currently being tracked
+     */
+    getTrackedJobIds() {
+        return Array.from(this.trackedJobs.keys());
+    }
+}
+exports.LockManager = LockManager;
diff --git a/node_modules/bullmq/dist/cjs/classes/main-base.js b/node_modules/bullmq/dist/cjs/classes/main-base.js
new file mode 100644
index 0000000..ee21e8e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/main-base.js
@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Wrapper for sandboxing.
+ *
+ */
+const child_processor_1 = require("./child-processor");
+const enums_1 = require("../enums");
+const utils_1 = require("../utils");
+exports.default = (send, receiver) => {
+    const childProcessor = new child_processor_1.ChildProcessor(send, receiver);
+    receiver === null || receiver === void 0 ? void 0 : receiver.on('message', async (msg) => {
+        try {
+            switch (msg.cmd) {
+                case enums_1.ChildCommand.Init:
+                    await childProcessor.init(msg.value);
+                    break;
+                case enums_1.ChildCommand.Start:
+                    await childProcessor.start(msg.job, msg === null || msg === void 0 ? void 0 : msg.token);
+                    break;
+                case enums_1.ChildCommand.Stop:
+                    break;
+                case enums_1.ChildCommand.Cancel:
+                    childProcessor.cancel(msg.value);
+                    break;
+            }
+        }
+        catch (err) {
+            console.error('Error handling child message');
+        }
+    });
+    process.on('SIGTERM', () => childProcessor.waitForCurrentJobAndExit());
+    process.on('SIGINT', () => childProcessor.waitForCurrentJobAndExit());
+    process.on('uncaughtException', async (err) => {
+        if (typeof err !== 'object') {
+            err = new Error((0, utils_1.toString)(err));
+        }
+        await send({
+            cmd: enums_1.ParentCommand.Failed,
+            value: (0, utils_1.errorToJSON)(err),
+        });
+        // An uncaughException leaves this process in a potentially undetermined state so
+        // we must exit
+        process.exit();
+    });
+};
diff --git a/node_modules/bullmq/dist/cjs/classes/main-worker.d.ts b/node_modules/bullmq/dist/cjs/classes/main-worker.d.ts
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/main-worker.d.ts
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/cjs/classes/main-worker.js b/node_modules/bullmq/dist/cjs/classes/main-worker.js
new file mode 100644
index 0000000..d398df7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/main-worker.js
@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Worker Thread wrapper for sandboxing
+ *
+ */
+const worker_threads_1 = require("worker_threads");
+const main_base_1 = require("./main-base");
+(0, main_base_1.default)(async (msg) => worker_threads_1.parentPort.postMessage(msg), worker_threads_1.parentPort);
diff --git a/node_modules/bullmq/dist/cjs/classes/main.d.ts b/node_modules/bullmq/dist/cjs/classes/main.d.ts
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/main.d.ts
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/cjs/classes/main.js b/node_modules/bullmq/dist/cjs/classes/main.js
new file mode 100644
index 0000000..7fb2524
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/main.js
@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Child process wrapper for sandboxing.
+ *
+ */
+const utils_1 = require("../utils");
+const main_base_1 = require("./main-base");
+(0, main_base_1.default)((msg) => (0, utils_1.childSend)(process, msg), process);
diff --git a/node_modules/bullmq/dist/cjs/classes/node-redis-client.js b/node_modules/bullmq/dist/cjs/classes/node-redis-client.js
new file mode 100644
index 0000000..1ffdacd
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/node-redis-client.js
@@ -0,0 +1,771 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createNodeRedisClient = createNodeRedisClient;
+const tslib_1 = require("tslib");
+const crypto_1 = require("crypto");
+const events_1 = require("events");
+const stream_1 = require("stream");
+const connection_closed_error_1 = require("./errors/connection-closed-error");
+function normalizeScriptArgs(args) {
+    return args.length === 1 && Array.isArray(args[0]) ? args[0] : args;
+}
+function isConnectionClosedError(err) {
+    return ((err === null || err === void 0 ? void 0 : err.message) === 'Disconnects client' ||
+        (err === null || err === void 0 ? void 0 : err.message) === 'The client is closed' ||
+        (err === null || err === void 0 ? void 0 : err.message) === 'Connection is closed.');
+}
+function createNodeRedisClient(client) {
+    return new NodeRedisAdapter(client);
+}
+/**
+ * Full wrapper (not augmentation) because node-redis's API is structurally
+ * different from ioredis and cannot be patched in-place.
+ */
+class NodeRedisAdapter extends events_1.EventEmitter {
+    /**
+     * Expose connection status using the vocabulary that
+     * {@link RedisConnection.waitUntilReady} expects:
+     *   'wait'  → not yet connected, call connect()
+     *   'ready' → usable
+     *   'end'   → permanently closed
+     */
+    get status() {
+        if (this.statusOverride) {
+            return this.statusOverride;
+        }
+        if (this.raw.isReady) {
+            return 'ready';
+        }
+        if (this.raw.isOpen) {
+            return 'connect';
+        }
+        // Distinguish "never connected" from "disconnected after use"
+        return this.hasConnected ? 'end' : 'wait';
+    }
+    set status(val) {
+        // Allow RedisConnection to forcibly set 'end'
+        if (val === 'end') {
+            this.destroying = true;
+            if (this.raw.isOpen) {
+                try {
+                    this.raw.quit().catch(() => { });
+                }
+                catch (_a) {
+                    // already closed
+                }
+            }
+        }
+        this.statusOverride = val;
+    }
+    get options() {
+        var _a;
+        return (_a = this.raw.options) !== null && _a !== void 0 ? _a : {};
+    }
+    set options(val) {
+        // no-op – callers sometimes assign
+    }
+    constructor(raw) {
+        super();
+        this.raw = raw;
+        this.scripts = new Map();
+        this.hasConnected = false;
+        this.destroying = false;
+        this.isCluster = false; // TODO: cluster support
+        // Track first connection so status can distinguish 'wait' vs 'end'.
+        // When a connectionName is set (via duplicate()), delay the 'ready'
+        // event until CLIENT SETNAME completes so that callers waiting for
+        // 'ready' (e.g. RedisConnection.waitUntilReady) see the name already
+        // applied.
+        raw.on('ready', () => {
+            this.hasConnected = true;
+            if (this.connectionName) {
+                this.raw.clientSetName(this.connectionName).then(() => this.emit('ready'), () => this.emit('ready'));
+            }
+            else {
+                this.emit('ready');
+            }
+        });
+        raw.on('error', (err) => {
+            // Suppress the expected DisconnectsClientError that node-redis emits
+            // when destroy() is called intentionally (e.g. during close/disconnect).
+            if (this.destroying && isConnectionClosedError(err)) {
+                return;
+            }
+            this.emit('error', err);
+        });
+        raw.on('end', () => this.emit('close'));
+        raw.on('reconnecting', () => this.emit('reconnecting'));
+        // Auto-connect eagerly, like ioredis does in its constructor.
+        // This ensures commands can be issued immediately without an
+        // explicit connect() call. The promise is stored so that
+        // connect() is idempotent and callers can still await it.
+        if (!raw.isOpen) {
+            this.connectPromise = raw.connect().then(() => {
+                this.connectPromise = undefined;
+            }, (err) => {
+                this.connectPromise = undefined;
+                // Don't throw — errors surface via the 'error' event.
+            });
+        }
+    }
+    // ---------------------------------------------------------------
+    // Connection lifecycle
+    // ---------------------------------------------------------------
+    async connect() {
+        if (this.connectPromise) {
+            return this.connectPromise;
+        }
+        if (!this.raw.isOpen) {
+            this.connectPromise = this.raw.connect().then(() => {
+                this.connectPromise = undefined;
+            }, (err) => {
+                this.connectPromise = undefined;
+                throw err;
+            });
+            return this.connectPromise;
+        }
+        if (!this.raw.isReady) {
+            await new Promise((resolve, reject) => {
+                const onReady = () => {
+                    cleanup();
+                    resolve();
+                };
+                const onError = (err) => {
+                    cleanup();
+                    reject(err);
+                };
+                const onEnd = () => {
+                    cleanup();
+                    reject(new Error('Connection ended before ready event'));
+                };
+                const cleanup = () => {
+                    this.off('ready', onReady);
+                    this.off('error', onError);
+                    this.off('end', onEnd);
+                };
+                this.once('ready', onReady);
+                this.once('error', onError);
+                this.once('end', onEnd);
+            });
+        }
+    }
+    disconnect(reconnect = false) {
+        this.destroying = true;
+        if (!reconnect) {
+            this.statusOverride = 'end';
+        }
+        try {
+            if (this.raw.isOpen) {
+                // Use destroy() for immediate teardown. This interrupts any pending
+                // blocking commands (e.g. BZPOPMIN) without waiting for them to
+                // complete. The resulting "Disconnects client" rejections are handled
+                // by BullMQ's isNotConnectionError() checks.
+                this.raw.destroy();
+            }
+        }
+        catch (_a) {
+            // Swallow errors from already-closed connections
+        }
+        this.emit('close');
+        if (reconnect) {
+            this.statusOverride = undefined;
+            this.emit('reconnecting');
+            this.connect()
+                .catch(err => {
+                if (!isConnectionClosedError(err)) {
+                    this.emit('error', err);
+                }
+            })
+                .finally(() => {
+                this.destroying = false;
+            });
+        }
+        else {
+            // Emit both 'close' and 'end' so that all listeners are unblocked.
+            // RedisConnection.close() listens for 'close', RedisConnection.disconnect() listens for 'end'.
+            this.emit('end');
+        }
+    }
+    async quit() {
+        if (this.destroying || this.statusOverride === 'end') {
+            setImmediate(() => {
+                this.emit('end');
+                this.emit('close');
+            });
+            return 'OK';
+        }
+        this.destroying = true;
+        try {
+            if (this.raw.isOpen) {
+                try {
+                    await this.raw.quit();
+                }
+                catch (_a) {
+                    // Swallow errors from already-closing connections
+                }
+            }
+        }
+        catch (_b) {
+            // Swallow errors from already-closing connections
+        }
+        this.statusOverride = 'end';
+        // Emit on next tick so callers can register listeners after await quit()
+        setImmediate(() => {
+            this.emit('end');
+            this.emit('close');
+        });
+        return 'OK';
+    }
+    duplicate(...args) {
+        const dup = this.raw.duplicate();
+        const adapter = new NodeRedisAdapter(dup);
+        // Copy registered scripts to the duplicate
+        for (const [name, script] of this.scripts) {
+            adapter.scripts.set(name, script);
+            adapter[name] = (...args) => adapter.runCommand(name, args);
+        }
+        // Handle connectionName option (ioredis calls CLIENT SETNAME automatically).
+        // Setting connectionName BEFORE auto-connect resolves ensures the
+        // constructor's 'ready' handler applies CLIENT SETNAME before emitting
+        // 'ready', so callers (like RedisConnection.waitUntilReady) see the name
+        // already set when the connection is reported as ready.
+        const opts = args[0];
+        if (opts && typeof opts === 'object' && opts.connectionName) {
+            adapter.connectionName = opts.connectionName;
+        }
+        return adapter;
+    }
+    // ---------------------------------------------------------------
+    // Lua script engine
+    // ---------------------------------------------------------------
+    defineCommand(name, definition) {
+        const sha = (0, crypto_1.createHash)('sha1').update(definition.lua).digest('hex');
+        this.scripts.set(name, {
+            sha,
+            lua: definition.lua,
+            numberOfKeys: definition.numberOfKeys,
+        });
+        // Mimic ioredis behavior: add a callable property on the instance
+        // so that `(client as any)[name]` is defined (used by ScriptLoader cache check)
+        this[name] = (...args) => this.runCommand(name, args);
+        // Pre-load the script into Redis so that EVALSHA in transactions works
+        // immediately. This mirrors what ioredis does under the hood.
+        this.raw.scriptLoad(definition.lua).catch(() => {
+            // Ignore errors here – runCommand has NOSCRIPT fallback for non-tx path
+        });
+    }
+    async runCommand(name, args) {
+        var _a, _b;
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}"`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const keys = commandArgs.slice(0, numberOfKeys).map(String);
+        // Preserve Buffer arguments (e.g. msgpack data) – only stringify non-Buffers.
+        // Convert undefined/null to '' to match ioredis behavior (keeps arg positions).
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        try {
+            return await this.raw.evalSha(sha, { keys, arguments: argv });
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new connection_closed_error_1.ConnectionClosedError(err.message, err);
+            }
+            // NOSCRIPT – fall back to EVAL which also caches the script
+            if ((_b = (_a = err === null || err === void 0 ? void 0 : err.message) === null || _a === void 0 ? void 0 : _a.includes) === null || _b === void 0 ? void 0 : _b.call(_a, 'NOSCRIPT')) {
+                try {
+                    return await this.raw.eval(lua, { keys, arguments: argv });
+                }
+                catch (evalErr) {
+                    if (this.destroying && isConnectionClosedError(evalErr)) {
+                        return null;
+                    }
+                    if (isConnectionClosedError(evalErr)) {
+                        throw new connection_closed_error_1.ConnectionClosedError(evalErr.message, evalErr);
+                    }
+                    throw evalErr;
+                }
+            }
+            throw err;
+        }
+    }
+    // ---------------------------------------------------------------
+    // Pipeline / Transaction
+    // ---------------------------------------------------------------
+    multi() {
+        return new NodeRedisTransaction(this.raw.multi(), this.scripts);
+    }
+    pipeline() {
+        // node-redis doesn't have a separate pipeline concept;
+        // use multi() which behaves similarly for batching.
+        return this.multi();
+    }
+    // ---------------------------------------------------------------
+    // Hash commands
+    // ---------------------------------------------------------------
+    async hgetall(key) {
+        const result = await this.raw.hGetAll(key);
+        return result !== null && result !== void 0 ? result : {};
+    }
+    async hget(key, field) {
+        var _a;
+        return (_a = (await this.raw.hGet(key, field))) !== null && _a !== void 0 ? _a : null;
+    }
+    async hmget(key, ...fields) {
+        const result = await this.raw.hmGet(key, fields);
+        return result.map((v) => v !== null && v !== void 0 ? v : null);
+    }
+    async hset(key, dataOrField, ...rest) {
+        if (typeof dataOrField === 'object') {
+            // Record-based call: hset(key, { field: value, ... })
+            return await this.raw.hSet(key, dataOrField);
+        }
+        // Varargs call (ioredis compat): hset(key, field, value, field, value, ...)
+        const record = {};
+        record[dataOrField] = String(rest[0]);
+        for (let i = 1; i < rest.length; i += 2) {
+            record[String(rest[i])] = String(rest[i + 1]);
+        }
+        return await this.raw.hSet(key, record);
+    }
+    async hdel(key, ...fields) {
+        return await this.raw.hDel(key, fields);
+    }
+    async hexists(key, field) {
+        const exists = await this.raw.hExists(key, field);
+        return exists ? 1 : 0;
+    }
+    // ---------------------------------------------------------------
+    // String commands
+    // ---------------------------------------------------------------
+    async get(key) {
+        var _a;
+        return (_a = (await this.raw.get(key))) !== null && _a !== void 0 ? _a : null;
+    }
+    async set(key, value, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.PX) != null) {
+            opts.PX = options.PX;
+        }
+        else if ((options === null || options === void 0 ? void 0 : options.EX) != null) {
+            opts.EX = options.EX;
+        }
+        return await this.raw.set(key, String(value), opts);
+    }
+    async del(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.raw.del(keys);
+    }
+    // ---------------------------------------------------------------
+    // Sorted set commands
+    // ---------------------------------------------------------------
+    async zrange(key, start, end, options) {
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            // node-redis v5 uses a separate method for WITHSCORES
+            const items = await this.raw.zRangeWithScores(key, start, end);
+            // Flatten to [member, score, member, score, …] like ioredis
+            const flat = [];
+            for (const item of items) {
+                flat.push(item.value, String(item.score));
+            }
+            return flat;
+        }
+        return await this.raw.zRange(key, start, end);
+    }
+    async zrevrange(key, start, end, options) {
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            const items = await this.raw.zRangeWithScores(key, start, end, {
+                REV: true,
+            });
+            const flat = [];
+            for (const item of items) {
+                flat.push(item.value, String(item.score));
+            }
+            return flat;
+        }
+        return await this.raw.zRange(key, start, end, { REV: true });
+    }
+    async zcard(key) {
+        return await this.raw.zCard(key);
+    }
+    async zscore(key, member) {
+        const score = await this.raw.zScore(key, member);
+        return score != null ? String(score) : null;
+    }
+    // ---------------------------------------------------------------
+    // List commands
+    // ---------------------------------------------------------------
+    async lrange(key, start, end) {
+        return await this.raw.lRange(key, start, end);
+    }
+    async llen(key) {
+        return await this.raw.lLen(key);
+    }
+    async ltrim(key, start, end) {
+        await this.raw.lTrim(key, start, end);
+        return 'OK';
+    }
+    async lpos(key, value) {
+        var _a;
+        return (_a = (await this.raw.lPos(key, value))) !== null && _a !== void 0 ? _a : null;
+    }
+    // ---------------------------------------------------------------
+    // Set commands
+    // ---------------------------------------------------------------
+    async smembers(key) {
+        return await this.raw.sMembers(key);
+    }
+    // ---------------------------------------------------------------
+    // Stream commands
+    // ---------------------------------------------------------------
+    async xadd(key, id, fields, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            opts.TRIM = {
+                strategy: 'MAXLEN',
+                threshold: options.MAXLEN,
+                strategyModifier: options.approximate === false ? undefined : '~',
+            };
+        }
+        // node-redis xAdd rejects numeric field values — stringify all values
+        const strFields = {};
+        for (const [k, v] of Object.entries(fields)) {
+            strFields[k] = String(v);
+        }
+        return await this.raw.xAdd(key, id, strFields, opts);
+    }
+    async xread(streams, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            opts.BLOCK = options.BLOCK;
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        const streamArgs = streams.map(s => ({ key: s.key, id: s.id }));
+        let result;
+        try {
+            result = await this.raw.xRead(streamArgs, opts);
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new connection_closed_error_1.ConnectionClosedError(err.message, err);
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        // Normalize to ioredis format: [[streamName, [[id, [field, value, …]], …]], …]
+        return result.map((stream) => [
+            stream.name,
+            stream.messages.map((msg) => [
+                msg.id,
+                Object.entries(msg.message).flat(),
+            ]),
+        ]);
+    }
+    async xtrim(key, strategy, threshold, options) {
+        const strategyModifier = (options === null || options === void 0 ? void 0 : options.approximate) === false ? undefined : '~';
+        return await this.raw.xTrim(key, strategy, threshold, {
+            strategyModifier,
+        });
+    }
+    // ---------------------------------------------------------------
+    // Blocking commands
+    // ---------------------------------------------------------------
+    async bzpopmin(key, timeout) {
+        let result;
+        try {
+            result = await this.raw.bzPopMin(key, timeout);
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new connection_closed_error_1.ConnectionClosedError(err.message, err);
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        return [result.key, result.value, String(result.score)];
+    }
+    // ---------------------------------------------------------------
+    // Server / admin commands
+    // ---------------------------------------------------------------
+    async info() {
+        return await this.raw.info();
+    }
+    async clientSetName(name) {
+        return await this.raw.clientSetName(name);
+    }
+    async clientList() {
+        return await this.raw.sendCommand(['CLIENT', 'LIST']);
+    }
+    // ---------------------------------------------------------------
+    // Key scanning
+    // ---------------------------------------------------------------
+    async scan(cursor, options) {
+        const opts = {};
+        if (options === null || options === void 0 ? void 0 : options.MATCH) {
+            opts.MATCH = options.MATCH;
+        }
+        if (options === null || options === void 0 ? void 0 : options.COUNT) {
+            opts.COUNT = options.COUNT;
+        }
+        const result = await this.raw.scan(String(cursor), opts);
+        return [String(result.cursor), result.keys];
+    }
+    scanStream(options) {
+        const raw = this.raw;
+        const connectPromise = this.connectPromise;
+        const scanOpts = {};
+        if (options.match) {
+            scanOpts.MATCH = options.match;
+        }
+        if (options.count) {
+            scanOpts.COUNT = options.count;
+        }
+        const readable = new stream_1.Readable({
+            objectMode: true,
+            async read() {
+                var _a, e_1, _b, _c;
+                try {
+                    if (connectPromise) {
+                        await connectPromise;
+                    }
+                    try {
+                        for (var _d = true, _e = tslib_1.__asyncValues(raw.scanIterator(scanOpts)), _f; _f = await _e.next(), _a = _f.done, !_a; _d = true) {
+                            _c = _f.value;
+                            _d = false;
+                            const keys = _c;
+                            if (!readable.push(Array.isArray(keys) ? keys : [keys])) {
+                                return; // backpressure
+                            }
+                        }
+                    }
+                    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+                    finally {
+                        try {
+                            if (!_d && !_a && (_b = _e.return)) await _b.call(_e);
+                        }
+                        finally { if (e_1) throw e_1.error; }
+                    }
+                    readable.push(null); // EOF
+                }
+                catch (err) {
+                    readable.destroy(err);
+                }
+            },
+        });
+        return readable;
+    }
+    // ---------------------------------------------------------------
+    // Extra Redis commands (not part of IRedisClient but used by tests
+    // and occasionally by user code that accesses the raw client).
+    // ---------------------------------------------------------------
+    async keys(pattern) {
+        return await this.raw.keys(pattern);
+    }
+    async exists(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.raw.exists(keys);
+    }
+    async zadd(key, ...args) {
+        // ioredis: zadd(key, score, member, score, member, ...)
+        const members = [];
+        for (let i = 0; i < args.length; i += 2) {
+            members.push({ score: Number(args[i]), value: String(args[i + 1]) });
+        }
+        return await this.raw.zAdd(key, members);
+    }
+    async zrem(key, ...members) {
+        return await this.raw.zRem(key, members);
+    }
+    async xlen(key) {
+        return await this.raw.xLen(key);
+    }
+    async xrevrange(key, end, start, ...rest) {
+        const opts = {};
+        // ioredis: xrevrange(key, end, start, 'COUNT', n)
+        if (rest[0] === 'COUNT') {
+            opts.COUNT = Number(rest[1]);
+        }
+        const result = await this.raw.xRevRange(key, end, start, opts);
+        // Normalize to ioredis format: [[id, [field, value, …]], …]
+        return result.map((msg) => [
+            msg.id,
+            Object.entries(msg.message).flat(),
+        ]);
+    }
+    async sadd(key, ...members) {
+        return await this.raw.sAdd(key, members.map(String));
+    }
+    async scard(key) {
+        return await this.raw.sCard(key);
+    }
+    async lpush(key, ...values) {
+        return await this.raw.lPush(key, values);
+    }
+    async rpop(key) {
+        return await this.raw.rPop(key);
+    }
+    async incr(key) {
+        return await this.raw.incr(key);
+    }
+    async incrby(key, increment) {
+        return await this.raw.incrBy(key, increment);
+    }
+    async flushall() {
+        return await this.raw.flushAll();
+    }
+}
+// ---------------------------------------------------------------------------
+// Transaction / Pipeline wrapper
+// ---------------------------------------------------------------------------
+class NodeRedisTransaction {
+    constructor(raw, scripts) {
+        this.raw = raw;
+        this.scripts = scripts;
+        this.transformers = [];
+    }
+    addIdentityTransformer() {
+        this.transformers.push((v) => v);
+    }
+    hgetall(key) {
+        this.raw.hGetAll(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    hset(key, data) {
+        this.raw.hSet(key, data);
+        this.addIdentityTransformer();
+        return this;
+    }
+    hscan(key, cursor, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        this.raw.hScan(key, String(cursor), opts);
+        // Transform node-redis { cursor, entries: [{field, value}] }
+        // to ioredis [cursor, [field, value, field, value, ...]]
+        this.transformers.push((val) => {
+            if (!val) {
+                return ['0', []];
+            }
+            const flat = [];
+            for (const entry of val.entries || []) {
+                flat.push(entry.field, entry.value);
+            }
+            return [String(val.cursor), flat];
+        });
+        return this;
+    }
+    smembers(key) {
+        this.raw.sMembers(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    sscan(key, cursor, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        this.raw.sScan(key, String(cursor), opts);
+        // Transform node-redis { cursor, members: [...] }
+        // to ioredis [cursor, [member, member, ...]]
+        this.transformers.push((val) => {
+            if (!val) {
+                return ['0', []];
+            }
+            return [String(val.cursor), val.members || []];
+        });
+        return this;
+    }
+    zrange(key, start, end) {
+        this.raw.zRange(key, start, end);
+        this.addIdentityTransformer();
+        return this;
+    }
+    lrange(key, start, end) {
+        this.raw.lRange(key, start, end);
+        this.addIdentityTransformer();
+        return this;
+    }
+    llen(key) {
+        this.raw.lLen(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    del(...keys) {
+        if (keys.length > 0) {
+            this.raw.del(keys);
+            this.addIdentityTransformer();
+        }
+        return this;
+    }
+    runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}" in transaction`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const cmdKeys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Use evalSha in pipeline; NOSCRIPT handling happens at exec()-time
+        // node-redis multi supports evalSha
+        this.raw.evalSha(sha, { keys: cmdKeys, arguments: argv });
+        this.addIdentityTransformer();
+        return this;
+    }
+    async exec() {
+        const results = await this.raw.exec();
+        if (!results) {
+            return null;
+        }
+        // node-redis multi.exec() returns values directly (or throws on error).
+        // Normalize to ioredis format: [Error | null, value][]
+        // Apply per-command transformers for format differences (hscan, sscan).
+        return results.map((result, i) => {
+            if (result instanceof Error) {
+                return [result, null];
+            }
+            const transformer = this.transformers[i];
+            const value = transformer ? transformer(result) : result;
+            return [null, value];
+        });
+    }
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/queue-base.js b/node_modules/bullmq/dist/cjs/classes/queue-base.js
new file mode 100644
index 0000000..c87f6cf
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue-base.js
@@ -0,0 +1,162 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueBase = void 0;
+const events_1 = require("events");
+const utils_1 = require("../utils");
+const create_scripts_1 = require("../utils/create-scripts");
+const redis_connection_1 = require("./redis-connection");
+const job_1 = require("./job");
+const queue_keys_1 = require("./queue-keys");
+/**
+ * Base class for all classes that need to interact with queues.
+ * This class is normally not used directly, but extended by the other classes.
+ *
+ */
+class QueueBase extends events_1.EventEmitter {
+    /**
+     *
+     * @param name - The name of the queue.
+     * @param opts - Options for the queue.
+     * @param Connection - An optional "Connection" class used to instantiate a Connection. This is useful for
+     * testing with mockups and/or extending the Connection class and passing an alternate implementation.
+     */
+    constructor(name, opts = { connection: {} }, Connection = redis_connection_1.RedisConnection, hasBlockingConnection = false) {
+        super();
+        this.name = name;
+        this.opts = opts;
+        this.closed = false;
+        this.hasBlockingConnection = false;
+        this.hasBlockingConnection = hasBlockingConnection;
+        this.opts = Object.assign({ prefix: 'bull' }, opts);
+        if (!name) {
+            throw new Error('Queue name must be provided');
+        }
+        if (name.includes(':')) {
+            throw new Error('Queue name cannot contain :');
+        }
+        this.connection = new Connection(opts.connection, {
+            shared: (0, utils_1.isRedisInstance)(opts.connection),
+            blocking: hasBlockingConnection,
+            skipVersionCheck: opts.skipVersionCheck,
+            skipWaitingForReady: opts.skipWaitingForReady,
+        });
+        this.connection.on('error', (error) => this.emit('error', error));
+        this.connection.on('close', () => {
+            if (!this.closing) {
+                this.emit('ioredis:close');
+            }
+        });
+        const queueKeys = new queue_keys_1.QueueKeys(opts.prefix);
+        this.qualifiedName = queueKeys.getQueueQualifiedName(name);
+        this.keys = queueKeys.getKeys(name);
+        this.toKey = (type) => queueKeys.toKey(name, type);
+        this.createScripts();
+    }
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client() {
+        return this.connection.client;
+    }
+    createScripts() {
+        this.scripts = (0, create_scripts_1.createScripts)(this);
+    }
+    /**
+     * Returns the version of the Redis instance the client is connected to,
+     */
+    get redisVersion() {
+        return this.connection.redisVersion;
+    }
+    /**
+     * Returns the database type of the Redis instance the client is connected to,
+     */
+    get databaseType() {
+        return this.connection.databaseType;
+    }
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    get Job() {
+        return job_1.Job;
+    }
+    /**
+     * Emits an event. Normally used by subclasses to emit events.
+     *
+     * @param event - The emitted event.
+     * @param args - The arguments to pass to the event listeners.
+     * @returns True if the event had listeners, false otherwise.
+     */
+    emit(event, ...args) {
+        try {
+            return super.emit(event, ...args);
+        }
+        catch (err) {
+            try {
+                return super.emit('error', err);
+            }
+            catch (err) {
+                // We give up if the error event also throws an exception.
+                console.error(err);
+                return false;
+            }
+        }
+    }
+    waitUntilReady() {
+        return this.client;
+    }
+    base64Name() {
+        return Buffer.from(this.name).toString('base64');
+    }
+    clientName(suffix = '') {
+        const queueNameBase64 = this.base64Name();
+        return `${this.opts.prefix}:${queueNameBase64}${suffix}`;
+    }
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+        this.closed = true;
+    }
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect() {
+        return this.connection.disconnect();
+    }
+    async checkConnectionError(fn, delayInMs = utils_1.DELAY_TIME_5) {
+        try {
+            return await fn();
+        }
+        catch (error) {
+            if ((0, utils_1.isNotConnectionError)(error)) {
+                this.emit('error', error);
+            }
+            if (!this.closing && delayInMs) {
+                await (0, utils_1.delay)(delayInMs);
+            }
+            else {
+                return;
+            }
+        }
+    }
+    /**
+     * Wraps the code with telemetry and provides a span for configuration.
+     *
+     * @param spanKind - kind of the span: Producer, Consumer, Internal
+     * @param operation - operation name (such as add, process, etc)
+     * @param destination - destination name (normally the queue name)
+     * @param callback - code to wrap with telemetry
+     * @param srcPropagationMetadata - The source propagation metadata for telemetry context.
+     * @returns The result of the callback function.
+     */
+    trace(spanKind, operation, destination, callback, srcPropagationMetadata) {
+        return (0, utils_1.trace)(this.opts.telemetry, spanKind, this.name, operation, destination, callback, srcPropagationMetadata);
+    }
+}
+exports.QueueBase = QueueBase;
diff --git a/node_modules/bullmq/dist/cjs/classes/queue-events-producer.js b/node_modules/bullmq/dist/cjs/classes/queue-events-producer.js
new file mode 100644
index 0000000..b1b70d2
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue-events-producer.js
@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueEventsProducer = void 0;
+const tslib_1 = require("tslib");
+const queue_base_1 = require("./queue-base");
+/**
+ * The QueueEventsProducer class is used for publishing custom events.
+ */
+class QueueEventsProducer extends queue_base_1.QueueBase {
+    constructor(name, opts = {
+        connection: {},
+    }, Connection) {
+        super(name, Object.assign({ blockingConnection: false }, opts), Connection);
+        this.opts = opts;
+    }
+    /**
+     * Publish custom event to be processed in QueueEvents.
+     * @param argsObj - Event payload
+     * @param maxEvents - Max quantity of events to be saved
+     */
+    async publishEvent(argsObj, maxEvents = 1000) {
+        const client = await this.client;
+        const key = this.keys.events;
+        const { eventName } = argsObj, restArgs = tslib_1.__rest(argsObj, ["eventName"]);
+        const fields = Object.assign({ event: eventName }, restArgs);
+        await client.xadd(key, '*', fields, {
+            MAXLEN: maxEvents,
+            approximate: true,
+        });
+    }
+    /**
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+    }
+}
+exports.QueueEventsProducer = QueueEventsProducer;
diff --git a/node_modules/bullmq/dist/cjs/classes/queue-events.js b/node_modules/bullmq/dist/cjs/classes/queue-events.js
new file mode 100644
index 0000000..9ca29f2
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue-events.js
@@ -0,0 +1,142 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueEvents = void 0;
+const tslib_1 = require("tslib");
+const utils_1 = require("../utils");
+const queue_base_1 = require("./queue-base");
+const ioredis_client_1 = require("./ioredis-client");
+/**
+ * The QueueEvents class is used for listening to the global events
+ * emitted by a given queue.
+ *
+ * This class requires a dedicated redis connection.
+ *
+ */
+class QueueEvents extends queue_base_1.QueueBase {
+    constructor(name, _a = {
+        connection: {},
+    }, Connection) {
+        var { connection, autorun = true } = _a, opts = tslib_1.__rest(_a, ["connection", "autorun"]);
+        super(name, Object.assign(Object.assign({}, opts), { connection: (0, utils_1.isRedisInstance)(connection)
+                ? ((0, ioredis_client_1.isIRedisClient)(connection)
+                    ? connection
+                    : (0, ioredis_client_1.createIORedisClient)(connection)).duplicate()
+                : connection }), Connection, true);
+        this.running = false;
+        this.blocking = false;
+        this.opts = Object.assign({
+            blockingTimeout: 10000,
+        }, this.opts);
+        if (autorun) {
+            this.run().catch(error => this.emit('error', error));
+        }
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Manually starts running the event consumming loop. This shall be used if you do not
+     * use the default "autorun" option on the constructor.
+     */
+    async run() {
+        if (!this.running) {
+            try {
+                this.running = true;
+                const client = await this.client;
+                // TODO: Planned for deprecation as it really has no use case
+                try {
+                    await client.clientSetName(this.clientName(utils_1.QUEUE_EVENT_SUFFIX));
+                }
+                catch (err) {
+                    if (!utils_1.clientCommandMessageReg.test(err.message) &&
+                        !this.closing) {
+                        throw err;
+                    }
+                }
+                await this.consumeEvents(client);
+            }
+            catch (error) {
+                this.running = false;
+                throw error;
+            }
+        }
+        else {
+            throw new Error('Queue Events is already running.');
+        }
+    }
+    async consumeEvents(client) {
+        const opts = this.opts;
+        const key = this.keys.events;
+        let id = opts.lastEventId || '$';
+        while (!this.closing) {
+            this.blocking = true;
+            // Cast to actual return type, see: https://github.com/DefinitelyTyped/DefinitelyTyped/issues/44301
+            const data = await this.checkConnectionError(() => client.xread([{ key, id }], { BLOCK: opts.blockingTimeout }));
+            this.blocking = false;
+            if (data) {
+                const stream = data[0];
+                const events = stream[1];
+                for (let i = 0; i < events.length; i++) {
+                    id = events[i][0];
+                    const args = (0, utils_1.array2obj)(events[i][1]);
+                    //
+                    // TODO: we may need to have a separate stream for progress data
+                    // to avoid this hack.
+                    switch (args.event) {
+                        case 'progress':
+                            args.data = JSON.parse(args.data);
+                            break;
+                        case 'completed':
+                            args.returnvalue = JSON.parse(args.returnvalue);
+                            break;
+                    }
+                    const { event } = args, restArgs = tslib_1.__rest(args, ["event"]);
+                    if (event === 'drained') {
+                        this.emit(event, id);
+                    }
+                    else {
+                        this.emit(event, restArgs, id);
+                        if (restArgs.jobId) {
+                            this.emit(`${event}:${restArgs.jobId}`, restArgs, id);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Stops consuming events and close the underlying Redis connection if necessary.
+     *
+     * @returns
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = (async () => {
+                try {
+                    // As the connection has been wrongly marked as "shared" by QueueBase,
+                    // we need to forcibly close it here. We should fix QueueBase to avoid this in the future.
+                    const client = await this.client;
+                    client.disconnect();
+                    await this.connection.close(this.blocking);
+                }
+                finally {
+                    this.closed = true;
+                }
+            })();
+        }
+        return this.closing;
+    }
+}
+exports.QueueEvents = QueueEvents;
diff --git a/node_modules/bullmq/dist/cjs/classes/queue-getters.js b/node_modules/bullmq/dist/cjs/classes/queue-getters.js
new file mode 100644
index 0000000..fd15083
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue-getters.js
@@ -0,0 +1,573 @@
+'use strict';
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueGetters = void 0;
+const tslib_1 = require("tslib");
+const queue_base_1 = require("./queue-base");
+const utils_1 = require("../utils");
+const enums_1 = require("../enums");
+/**
+ * Escape a Prometheus label value per the text exposition format.
+ * https://prometheus.io/docs/instrumenting/exposition_formats/
+ *
+ * Backslashes, double quotes, and newlines must be escaped.
+ */
+function escapePrometheusLabelValue(value) {
+    return String(value)
+        .replace(/\\/g, '\\\\')
+        .replace(/"/g, '\\"')
+        .replace(/\n/g, '\\n');
+}
+/**
+ * Provides different getters for different aspects of a queue.
+ */
+class QueueGetters extends queue_base_1.QueueBase {
+    getJob(jobId) {
+        return this.Job.fromId(this, jobId);
+    }
+    commandByType(types, count, callback) {
+        return types.map((type) => {
+            type = type === 'waiting' ? 'wait' : type; // alias
+            const key = this.toKey(type);
+            switch (type) {
+                case 'completed':
+                case 'failed':
+                case 'delayed':
+                case 'prioritized':
+                case 'repeat':
+                case 'waiting-children':
+                    return callback(key, count ? 'zcard' : 'zrange');
+                case 'active':
+                case 'wait':
+                case 'paused':
+                    return callback(key, count ? 'llen' : 'lrange');
+            }
+        });
+    }
+    sanitizeJobTypes(types) {
+        const currentTypes = typeof types === 'string' ? [types] : types;
+        if (Array.isArray(currentTypes) && currentTypes.length > 0) {
+            const sanitizedTypes = [...currentTypes];
+            if (sanitizedTypes.indexOf('waiting') !== -1) {
+                sanitizedTypes.push('paused');
+            }
+            return [...new Set(sanitizedTypes)];
+        }
+        return [
+            'active',
+            'completed',
+            'delayed',
+            'failed',
+            'paused',
+            'prioritized',
+            'waiting',
+            'waiting-children',
+        ];
+    }
+    /**
+      Returns the number of jobs waiting to be processed. This includes jobs that are
+      "waiting" or "delayed" or "prioritized" or "waiting-children".
+    */
+    async count() {
+        const count = await this.getJobCountByTypes('waiting', 'paused', 'delayed', 'prioritized', 'waiting-children');
+        return count;
+    }
+    /**
+     * Returns the time to live for a rate limited key in milliseconds.
+     * @param maxJobs - max jobs to be considered in rate limit state. If not passed
+     * it will return the remaining ttl without considering if max jobs is exceeded.
+     * @returns -2 if the key does not exist.
+     * -1 if the key exists but has no associated expire.
+     * @see {@link https://redis.io/commands/pttl/}
+     */
+    async getRateLimitTtl(maxJobs) {
+        return this.scripts.getRateLimitTtl(maxJobs);
+    }
+    /**
+     * Get jobId that starts debounced state.
+     * @deprecated use getDeduplicationJobId method
+     *
+     * @param id - debounce identifier
+     */
+    async getDebounceJobId(id) {
+        const client = await this.client;
+        return client.get(`${this.keys.de}:${id}`);
+    }
+    /**
+     * Get jobId from deduplicated state.
+     *
+     * @param id - deduplication identifier
+     */
+    async getDeduplicationJobId(id) {
+        const client = await this.client;
+        return client.get(`${this.keys.de}:${id}`);
+    }
+    /**
+     * Get global concurrency value.
+     * Returns null in case no value is set.
+     */
+    async getGlobalConcurrency() {
+        const client = await this.client;
+        const concurrency = await client.hget(this.keys.meta, 'concurrency');
+        if (concurrency) {
+            return Number(concurrency);
+        }
+        return null;
+    }
+    /**
+     * Get global rate limit values.
+     * Returns null in case no value is set.
+     */
+    async getGlobalRateLimit() {
+        const client = await this.client;
+        const [max, duration] = await client.hmget(this.keys.meta, 'max', 'duration');
+        if (max && duration) {
+            return {
+                max: Number(max),
+                duration: Number(duration),
+            };
+        }
+        return null;
+    }
+    /**
+     * Job counts by type
+     *
+     * Queue#getJobCountByTypes('completed') =\> completed count
+     * Queue#getJobCountByTypes('completed', 'failed') =\> completed + failed count
+     * Queue#getJobCountByTypes('completed', 'waiting', 'failed') =\> completed + waiting + failed count
+     */
+    async getJobCountByTypes(...types) {
+        const result = await this.getJobCounts(...types);
+        return Object.values(result).reduce((sum, count) => sum + count, 0);
+    }
+    /**
+     * Returns the job counts for each type specified or every list/set in the queue by default.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    async getJobCounts(...types) {
+        const currentTypes = this.sanitizeJobTypes(types);
+        const responses = await this.scripts.getCounts(currentTypes);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[currentTypes[index]] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Records job counts as gauge metrics for telemetry purposes.
+     * Each job state count is recorded with the queue name and state as attributes.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    async recordJobCountsMetric(...types) {
+        var _a;
+        const counts = await this.getJobCounts(...types);
+        const meter = (_a = this.opts.telemetry) === null || _a === void 0 ? void 0 : _a.meter;
+        if (meter && typeof meter.createGauge === 'function') {
+            const gauge = meter.createGauge(enums_1.MetricNames.QueueJobsCount, {
+                description: 'Number of jobs in the queue by state',
+                unit: '{jobs}',
+            });
+            for (const [state, jobCount] of Object.entries(counts)) {
+                gauge.record(jobCount, {
+                    [enums_1.TelemetryAttributes.QueueName]: this.name,
+                    [enums_1.TelemetryAttributes.QueueJobsState]: state,
+                });
+            }
+        }
+        return counts;
+    }
+    /**
+     * Get current job state.
+     *
+     * @param jobId - job identifier.
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getJobState(jobId) {
+        return this.scripts.getState(jobId);
+    }
+    /**
+     * Get global queue configuration.
+     *
+     * @returns Returns the global queue configuration.
+     */
+    async getMeta() {
+        const client = await this.client;
+        const config = await client.hgetall(this.keys.meta);
+        const { concurrency, max, duration, paused, 'opts.maxLenEvents': maxLenEvents } = config, rest = tslib_1.__rest(config, ["concurrency", "max", "duration", "paused", 'opts.maxLenEvents']);
+        const parsedConfig = rest;
+        if (concurrency) {
+            parsedConfig['concurrency'] = Number(concurrency);
+        }
+        if (maxLenEvents) {
+            parsedConfig['maxLenEvents'] = Number(maxLenEvents);
+        }
+        if (max) {
+            parsedConfig['max'] = Number(max);
+        }
+        if (duration) {
+            parsedConfig['duration'] = Number(duration);
+        }
+        parsedConfig['paused'] = paused === '1';
+        return parsedConfig;
+    }
+    /**
+     * @returns Returns the number of jobs in completed status.
+     */
+    getCompletedCount() {
+        return this.getJobCountByTypes('completed');
+    }
+    /**
+     * Returns the number of jobs in failed status.
+     */
+    getFailedCount() {
+        return this.getJobCountByTypes('failed');
+    }
+    /**
+     * Returns the number of jobs in delayed status.
+     */
+    getDelayedCount() {
+        return this.getJobCountByTypes('delayed');
+    }
+    /**
+     * Returns the number of jobs in active status.
+     */
+    getActiveCount() {
+        return this.getJobCountByTypes('active');
+    }
+    /**
+     * Returns the number of jobs in prioritized status.
+     */
+    getPrioritizedCount() {
+        return this.getJobCountByTypes('prioritized');
+    }
+    /**
+     * Returns the number of jobs per priority.
+     */
+    async getCountsPerPriority(priorities) {
+        const uniquePriorities = [...new Set(priorities)];
+        const responses = await this.scripts.getCountsPerPriority(uniquePriorities);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[`${uniquePriorities[index]}`] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Returns the number of jobs in waiting or paused statuses.
+     */
+    getWaitingCount() {
+        return this.getJobCountByTypes('waiting');
+    }
+    /**
+     * Returns the number of jobs in waiting-children status.
+     */
+    getWaitingChildrenCount() {
+        return this.getJobCountByTypes('waiting-children');
+    }
+    /**
+     * Returns the jobs that are in the "waiting" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaiting(start = 0, end = -1) {
+        return this.getJobs(['waiting'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "waiting-children" status.
+     * I.E. parent jobs that have at least one child that has not completed yet.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaitingChildren(start = 0, end = -1) {
+        return this.getJobs(['waiting-children'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "active" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getActive(start = 0, end = -1) {
+        return this.getJobs(['active'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "delayed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getDelayed(start = 0, end = -1) {
+        return this.getJobs(['delayed'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "prioritized" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getPrioritized(start = 0, end = -1) {
+        return this.getJobs(['prioritized'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "completed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getCompleted(start = 0, end = -1) {
+        return this.getJobs(['completed'], start, end, false);
+    }
+    /**
+     * Returns the jobs that are in the "failed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getFailed(start = 0, end = -1) {
+        return this.getJobs(['failed'], start, end, false);
+    }
+    /**
+     * Returns the qualified job ids and the raw job data (if available) of the
+     * children jobs of the given parent job.
+     * It is possible to get either the already processed children, in this case
+     * an array of qualified job ids and their result values will be returned,
+     * or the pending children, in this case an array of qualified job ids will
+     * be returned.
+     * A qualified job id is a string representing the job id in a given queue,
+     * for example: "bull:myqueue:jobid".
+     *
+     * @param parentId - The id of the parent job
+     * @param type - "processed" | "pending"
+     * @param opts - Options for the query.
+     *
+     * @returns an object with the following shape:
+     * `{ items: { id: string, v?: any, err?: string } [], jobs: JobJsonRaw[], total: number}`
+     */
+    async getDependencies(parentId, type, start, end) {
+        const key = this.toKey(type == 'processed'
+            ? `${parentId}:processed`
+            : `${parentId}:dependencies`);
+        const { items, total, jobs } = await this.scripts.paginate(key, {
+            start,
+            end,
+            fetchJobs: true,
+        });
+        return {
+            items,
+            jobs,
+            total,
+        };
+    }
+    async getRanges(types, start = 0, end = 1, asc = false) {
+        const multiCommands = [];
+        this.commandByType(types, false, (key, command) => {
+            switch (command) {
+                case 'lrange':
+                    multiCommands.push('lrange');
+                    break;
+                case 'zrange':
+                    multiCommands.push('zrange');
+                    break;
+            }
+        });
+        const responses = await this.scripts.getRanges(types, start, end, asc);
+        let results = [];
+        responses.forEach((response, index) => {
+            const result = response || [];
+            if (asc && multiCommands[index] === 'lrange') {
+                results = results.concat(result.reverse());
+            }
+            else {
+                results = results.concat(result);
+            }
+        });
+        return [...new Set(results)];
+    }
+    /**
+     * Returns the jobs that are on the given statuses (note that JobType is synonym for job status)
+     * @param types - the statuses of the jobs to return.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    async getJobs(types, start = 0, end = -1, asc = false) {
+        const currentTypes = this.sanitizeJobTypes(types);
+        const jobIds = await this.getRanges(currentTypes, start, end, asc);
+        return Promise.all(jobIds.map(jobId => this.Job.fromId(this, jobId)));
+    }
+    /**
+     * Returns the logs for a given Job.
+     * @param jobId - the id of the job to get the logs for.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    async getJobLogs(jobId, start = 0, end = -1, asc = true) {
+        const client = await this.client;
+        const multi = client.multi();
+        const logsKey = this.toKey(jobId + ':logs');
+        if (asc) {
+            multi.lrange(logsKey, start, end);
+        }
+        else {
+            multi.lrange(logsKey, -(end + 1), -(start + 1));
+        }
+        multi.llen(logsKey);
+        const result = (await multi.exec());
+        if (!asc) {
+            result[0][1].reverse();
+        }
+        return {
+            logs: result[0][1],
+            count: result[1][1],
+        };
+    }
+    async baseGetClients(matcher) {
+        const client = await this.client;
+        try {
+            if (client.isCluster && typeof client.nodes === 'function') {
+                const clusterNodes = client.nodes();
+                const clientsPerNode = [];
+                for (let nodeIndex = 0; nodeIndex < clusterNodes.length; nodeIndex++) {
+                    const node = clusterNodes[nodeIndex];
+                    const clients = typeof node.clientList === 'function'
+                        ? await node.clientList()
+                        : await node.client('LIST');
+                    const list = this.parseClientList(clients, matcher);
+                    clientsPerNode.push(list);
+                }
+                const clientsFromNodeWithMostConnections = clientsPerNode.reduce((prev, current) => {
+                    return prev.length > current.length ? prev : current;
+                }, []);
+                return clientsFromNodeWithMostConnections;
+            }
+            else {
+                const clients = await client.clientList();
+                const list = this.parseClientList(clients, matcher);
+                return list;
+            }
+        }
+        catch (err) {
+            if (!utils_1.clientCommandMessageReg.test(err.message)) {
+                throw err;
+            }
+            return [{ name: 'GCP does not support client list' }];
+        }
+    }
+    /**
+     * Get the worker list related to the queue. i.e. all the known
+     * workers that are available to process jobs for this queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @returns - Returns an array with workers info.
+     */
+    getWorkers() {
+        const unnamedWorkerClientName = `${this.clientName()}`;
+        const namedWorkerClientName = `${this.clientName()}:w:`;
+        const matcher = (name) => name &&
+            (name === unnamedWorkerClientName ||
+                name.startsWith(namedWorkerClientName));
+        return this.baseGetClients(matcher);
+    }
+    /**
+     * Returns the current count of workers for the queue.
+     *
+     * getWorkersCount(): Promise<number>
+     *
+     */
+    async getWorkersCount() {
+        const workers = await this.getWorkers();
+        return workers.length;
+    }
+    /**
+     * Get queue events list related to the queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @deprecated do not use this method, it will be removed in the future.
+     *
+     * @returns - Returns an array with queue events info.
+     */
+    async getQueueEvents() {
+        const clientName = `${this.clientName()}${utils_1.QUEUE_EVENT_SUFFIX}`;
+        return this.baseGetClients((name) => name === clientName);
+    }
+    /**
+     * Get queue metrics related to the queue.
+     *
+     * This method returns the gathered metrics for the queue.
+     * The metrics are represented as an array of job counts
+     * per unit of time (1 minute).
+     *
+     * @param start - Start point of the metrics, where 0
+     * is the newest point to be returned.
+     * @param end - End point of the metrics, where -1 is the
+     * oldest point to be returned.
+     *
+     * @returns - Returns an object with queue metrics.
+     */
+    async getMetrics(type, start = 0, end = -1) {
+        const [meta, data, count] = await this.scripts.getMetrics(type, start, end);
+        return {
+            meta: {
+                count: parseInt(meta[0] || '0', 10),
+                prevTS: parseInt(meta[1] || '0', 10),
+                prevCount: parseInt(meta[2] || '0', 10),
+            },
+            data: data.map(point => +point || 0),
+            count,
+        };
+    }
+    parseClientList(list, matcher) {
+        const lines = list.split(/\r?\n/);
+        const clients = [];
+        lines.forEach((line) => {
+            const client = {};
+            const keyValues = line.split(' ');
+            keyValues.forEach(function (keyValue) {
+                const index = keyValue.indexOf('=');
+                const key = keyValue.substring(0, index);
+                const value = keyValue.substring(index + 1);
+                client[key] = value;
+            });
+            const name = client['name'];
+            if (matcher(name)) {
+                client['name'] = this.name;
+                client['rawname'] = name;
+                clients.push(client);
+            }
+        });
+        return clients;
+    }
+    /**
+     * Export the metrics for the queue in the Prometheus format.
+     * Automatically exports all the counts returned by getJobCounts().
+     *
+     * @returns - Returns a string with the metrics in the Prometheus format.
+     *
+     * @see {@link https://prometheus.io/docs/instrumenting/exposition_formats/}
+     *
+     **/
+    async exportPrometheusMetrics(globalVariables) {
+        const counts = await this.getJobCounts();
+        const metrics = [];
+        // Match the test's expected HELP text
+        metrics.push('# HELP bullmq_job_count Number of jobs in the queue by state');
+        metrics.push('# TYPE bullmq_job_count gauge');
+        const escapedQueueName = escapePrometheusLabelValue(this.name);
+        const variables = !globalVariables
+            ? ''
+            : Object.keys(globalVariables).reduce((acc, curr) => `${acc}, ${curr}="${escapePrometheusLabelValue(globalVariables[curr])}"`, '');
+        for (const [state, count] of Object.entries(counts)) {
+            metrics.push(`bullmq_job_count{queue="${escapedQueueName}", state="${state}"${variables}} ${count}`);
+        }
+        const [completedMetrics, failedMetrics] = await Promise.all([
+            this.getMetrics('completed'),
+            this.getMetrics('failed'),
+        ]);
+        metrics.push('# HELP bullmq_job_completed_total Total number of completed jobs');
+        metrics.push('# TYPE bullmq_job_completed_total counter');
+        metrics.push(`bullmq_job_completed_total{queue="${escapedQueueName}"${variables}} ${completedMetrics.meta.count}`);
+        metrics.push('# HELP bullmq_job_failed_total Total number of failed jobs');
+        metrics.push('# TYPE bullmq_job_failed_total counter');
+        metrics.push(`bullmq_job_failed_total{queue="${escapedQueueName}"${variables}} ${failedMetrics.meta.count}`);
+        return metrics.join('\n');
+    }
+}
+exports.QueueGetters = QueueGetters;
diff --git a/node_modules/bullmq/dist/cjs/classes/queue-keys.js b/node_modules/bullmq/dist/cjs/classes/queue-keys.js
new file mode 100644
index 0000000..da24f68
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue-keys.js
@@ -0,0 +1,42 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueueKeys = void 0;
+class QueueKeys {
+    constructor(prefix = 'bull') {
+        this.prefix = prefix;
+    }
+    getKeys(name) {
+        const keys = {};
+        [
+            '',
+            'active',
+            'wait',
+            'waiting-children',
+            'paused',
+            'id',
+            'delayed',
+            'prioritized',
+            'stalled-check',
+            'completed',
+            'failed',
+            'stalled',
+            'repeat',
+            'limiter',
+            'meta',
+            'events',
+            'pc', // priority counter key
+            'marker', // marker key
+            'de', // deduplication key
+        ].forEach(key => {
+            keys[key] = this.toKey(name, key);
+        });
+        return keys;
+    }
+    toKey(name, type) {
+        return `${this.getQueueQualifiedName(name)}:${type}`;
+    }
+    getQueueQualifiedName(name) {
+        return `${this.prefix}:${name}`;
+    }
+}
+exports.QueueKeys = QueueKeys;
diff --git a/node_modules/bullmq/dist/cjs/classes/queue.js b/node_modules/bullmq/dist/cjs/classes/queue.js
new file mode 100644
index 0000000..4505222
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/queue.js
@@ -0,0 +1,748 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = void 0;
+const job_1 = require("./job");
+const queue_getters_1 = require("./queue-getters");
+const repeat_1 = require("./repeat");
+const enums_1 = require("../enums");
+const job_scheduler_1 = require("./job-scheduler");
+const version_1 = require("../version");
+const utils_1 = require("../utils");
+/**
+ * Queue
+ *
+ * This class provides methods to add jobs to a queue and some other high-level
+ * administration such as pausing or deleting queues.
+ *
+ * @typeParam DataType - The type of the data that the job will process.
+ * @typeParam ResultType - The type of the result of the job.
+ * @typeParam NameType - The type of the name of the job.
+ *
+ * @example
+ *
+ * ```typescript
+ * import { Queue } from 'bullmq';
+ *
+ * interface MyDataType {
+ *  foo: string;
+ * }
+ *
+ * interface MyResultType {
+ *   bar: string;
+ * }
+ *
+ * const queue = new Queue<MyDataType, MyResultType, "blue" | "brown">('myQueue');
+ * ```
+ */
+class Queue extends queue_getters_1.QueueGetters {
+    constructor(name, opts, Connection) {
+        var _a;
+        super(name, Object.assign({}, opts), Connection);
+        this.token = (0, utils_1.randomUUID)();
+        this.libName = 'bullmq';
+        this.jobsOpts = (_a = opts === null || opts === void 0 ? void 0 : opts.defaultJobOptions) !== null && _a !== void 0 ? _a : {};
+        this.waitUntilReady()
+            .then(client => {
+            if (!this.closing && !(opts === null || opts === void 0 ? void 0 : opts.skipMetasUpdate)) {
+                return client.hset(this.keys.meta, this.metaValues);
+            }
+        })
+            .catch(err => {
+            // We ignore this error to avoid warnings. The error can still
+            // be received by listening to event 'error'
+        });
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Returns this instance current default job options.
+     */
+    get defaultJobOptions() {
+        return Object.assign({}, this.jobsOpts);
+    }
+    get metaValues() {
+        var _a, _b, _c, _d;
+        return {
+            'opts.maxLenEvents': (_d = (_c = (_b = (_a = this.opts) === null || _a === void 0 ? void 0 : _a.streams) === null || _b === void 0 ? void 0 : _b.events) === null || _c === void 0 ? void 0 : _c.maxLen) !== null && _d !== void 0 ? _d : 10000,
+            version: `${this.libName}:${version_1.version}`,
+        };
+    }
+    /**
+     * Get library version.
+     *
+     * @returns the content of the meta.library field.
+     */
+    async getVersion() {
+        const client = await this.client;
+        return await client.hget(this.keys.meta, 'version');
+    }
+    get repeat() {
+        return new Promise(async (resolve) => {
+            if (!this._repeat) {
+                this._repeat = new repeat_1.Repeat(this.name, Object.assign(Object.assign({}, this.opts), { connection: await this.client }));
+                this._repeat.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._repeat);
+        });
+    }
+    get jobScheduler() {
+        return new Promise(async (resolve) => {
+            if (!this._jobScheduler) {
+                this._jobScheduler = new job_scheduler_1.JobScheduler(this.name, Object.assign(Object.assign({}, this.opts), { connection: await this.client }));
+                this._jobScheduler.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._jobScheduler);
+        });
+    }
+    /**
+     * Enable and set global concurrency value.
+     * @param concurrency - Maximum number of simultaneous jobs that the workers can handle.
+     * For instance, setting this value to 1 ensures that no more than one job
+     * is processed at any given time. If this limit is not defined, there will be no
+     * restriction on the number of concurrent jobs.
+     */
+    async setGlobalConcurrency(concurrency) {
+        const client = await this.client;
+        return client.hset(this.keys.meta, { concurrency });
+    }
+    /**
+     * Enable and set rate limit.
+     * @param max - Max number of jobs to process in the time period specified in `duration`
+     * @param duration - Time in milliseconds. During this time, a maximum of `max` jobs will be processed.
+     */
+    async setGlobalRateLimit(max, duration) {
+        const client = await this.client;
+        return client.hset(this.keys.meta, { max, duration });
+    }
+    /**
+     * Remove global concurrency value.
+     */
+    async removeGlobalConcurrency() {
+        const client = await this.client;
+        return client.hdel(this.keys.meta, 'concurrency');
+    }
+    /**
+     * Remove global rate limit values.
+     */
+    async removeGlobalRateLimit() {
+        const client = await this.client;
+        return client.hdel(this.keys.meta, 'max', 'duration');
+    }
+    /**
+     * Adds a new job to the queue.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     */
+    async add(name, data, opts) {
+        return this.trace(enums_1.SpanKind.PRODUCER, 'add', `${this.name}.${name}`, async (span, srcPropagationMetadata) => {
+            var _a;
+            if (srcPropagationMetadata && !((_a = opts === null || opts === void 0 ? void 0 : opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext)) {
+                const telemetry = {
+                    metadata: srcPropagationMetadata,
+                };
+                opts = Object.assign(Object.assign({}, opts), { telemetry });
+            }
+            const job = await this.addJob(name, data, opts);
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobName]: name,
+                [enums_1.TelemetryAttributes.JobId]: job.id,
+            });
+            return job;
+        });
+    }
+    /**
+     * addJob is a telemetry free version of the add method, useful in order to wrap it
+     * with custom telemetry on subclasses.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     *
+     * @returns Job
+     */
+    async addJob(name, data, opts) {
+        if (opts && opts.repeat) {
+            if (opts.repeat.endDate) {
+                if (+new Date(opts.repeat.endDate) < Date.now()) {
+                    throw new Error('End date must be greater than current timestamp');
+                }
+            }
+            return (await this.repeat).updateRepeatableJob(name, data, Object.assign(Object.assign({}, this.jobsOpts), opts), { override: true });
+        }
+        else {
+            const jobId = opts === null || opts === void 0 ? void 0 : opts.jobId;
+            if (jobId == '0' || (jobId === null || jobId === void 0 ? void 0 : jobId.startsWith('0:'))) {
+                throw new Error("JobId cannot be '0' or start with 0:");
+            }
+            const mergedOpts = Object.assign(Object.assign(Object.assign({}, this.jobsOpts), opts), { jobId });
+            const job = await this.Job.create(this, name, data, mergedOpts);
+            this.emit('waiting', job);
+            return job;
+        }
+    }
+    /**
+     * Adds an array of jobs to the queue. This method may be faster than adding
+     * one job at a time in a sequence.
+     *
+     * @param jobs - The array of jobs to add to the queue. Each job is defined by 3
+     * properties, 'name', 'data' and 'opts'. They follow the same signature as 'Queue.add'.
+     */
+    async addBulk(jobs) {
+        return this.trace(enums_1.SpanKind.PRODUCER, 'addBulk', this.name, async (span, srcPropagationMetadata) => {
+            if (span) {
+                span.setAttributes({
+                    [enums_1.TelemetryAttributes.BulkNames]: jobs.map(job => job.name),
+                    [enums_1.TelemetryAttributes.BulkCount]: jobs.length,
+                });
+            }
+            return await this.Job.createBulk(this, jobs.map(job => {
+                var _a, _b, _c, _d, _e, _f;
+                let telemetry = (_a = job.opts) === null || _a === void 0 ? void 0 : _a.telemetry;
+                if (srcPropagationMetadata) {
+                    const omitContext = (_c = (_b = job.opts) === null || _b === void 0 ? void 0 : _b.telemetry) === null || _c === void 0 ? void 0 : _c.omitContext;
+                    const telemetryMetadata = ((_e = (_d = job.opts) === null || _d === void 0 ? void 0 : _d.telemetry) === null || _e === void 0 ? void 0 : _e.metadata) ||
+                        (!omitContext && srcPropagationMetadata);
+                    if (telemetryMetadata || omitContext) {
+                        telemetry = {
+                            metadata: telemetryMetadata,
+                            omitContext,
+                        };
+                    }
+                }
+                const mergedOpts = Object.assign(Object.assign(Object.assign({}, this.jobsOpts), job.opts), { jobId: (_f = job.opts) === null || _f === void 0 ? void 0 : _f.jobId, telemetry });
+                return {
+                    name: job.name,
+                    data: job.data,
+                    opts: mergedOpts,
+                };
+            }));
+        });
+    }
+    /**
+     * Upserts a scheduler.
+     *
+     * A scheduler is a job factory that creates jobs at a given interval.
+     * Upserting a scheduler will create a new job scheduler or update an existing one.
+     * It will also create the first job based on the repeat options and delayed accordingly.
+     *
+     * @param key - Unique key for the repeatable job meta.
+     * @param repeatOpts - Repeat options
+     * @param jobTemplate - Job template. If provided it will be used for all the jobs
+     * created by the scheduler.
+     *
+     * @returns The next job to be scheduled (would normally be in delayed state).
+     */
+    async upsertJobScheduler(jobSchedulerId, repeatOpts, jobTemplate) {
+        var _a, _b;
+        if (repeatOpts.endDate) {
+            if (+new Date(repeatOpts.endDate) < Date.now()) {
+                throw new Error('End date must be greater than current timestamp');
+            }
+        }
+        return (await this.jobScheduler).upsertJobScheduler(jobSchedulerId, repeatOpts, (_a = jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.name) !== null && _a !== void 0 ? _a : jobSchedulerId, (_b = jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.data) !== null && _b !== void 0 ? _b : {}, Object.assign(Object.assign({}, this.jobsOpts), jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.opts), { override: true });
+    }
+    /**
+     * Pauses the processing of this queue globally.
+     *
+     * We use an atomic RENAME operation on the wait queue. Since
+     * we have blocking calls with BRPOPLPUSH on the wait queue, as long as the queue
+     * is renamed to 'paused', no new jobs will be processed (the current ones
+     * will run until finalized).
+     *
+     * Adding jobs requires a LUA script to check first if the paused list exist
+     * and in that case it will add it there instead of the wait list.
+     */
+    async pause() {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'pause', this.name, async () => {
+            await this.scripts.pause(true);
+            this.emit('paused');
+        });
+    }
+    /**
+     * Close the queue instance.
+     *
+     */
+    async close() {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'close', this.name, async () => {
+            if (!this.closing) {
+                if (this._repeat) {
+                    await this._repeat.close();
+                }
+            }
+            await super.close();
+        });
+    }
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     *
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    async rateLimit(expireTimeMs) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'rateLimit', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueRateLimit]: expireTimeMs,
+            });
+            await this.client.then(client => client.set(this.keys.limiter, Number.MAX_SAFE_INTEGER, {
+                PX: expireTimeMs,
+            }));
+        });
+    }
+    /**
+     * Resumes the processing of this queue globally.
+     *
+     * The method reverses the pause operation by resuming the processing of the
+     * queue.
+     */
+    async resume() {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'resume', this.name, async () => {
+            await this.scripts.pause(false);
+            this.emit('resumed');
+        });
+    }
+    /**
+     * Returns true if the queue is currently paused.
+     */
+    async isPaused() {
+        const client = await this.client;
+        const pausedKeyExists = await client.hexists(this.keys.meta, 'paused');
+        return pausedKeyExists === 1;
+    }
+    /**
+     * Returns true if the queue is currently maxed.
+     */
+    isMaxed() {
+        return this.scripts.isMaxed();
+    }
+    /**
+     * Get all repeatable meta jobs.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getJobSchedulers instead.
+     *
+     * @param start - Offset of first job to return.
+     * @param end - Offset of last job to return.
+     * @param asc - Determine the order in which jobs are returned based on their
+     * next execution time.
+     */
+    async getRepeatableJobs(start, end, asc) {
+        return (await this.repeat).getRepeatableJobs(start, end, asc);
+    }
+    /**
+     * Get Job Scheduler by id
+     *
+     * @param id - identifier of scheduler.
+     */
+    async getJobScheduler(id) {
+        return (await this.jobScheduler).getScheduler(id);
+    }
+    /**
+     * Get all Job Schedulers
+     *
+     * @param start - Offset of first scheduler to return.
+     * @param end - Offset of last scheduler to return.
+     * @param asc - Determine the order in which schedulers are returned based on their
+     * next execution time.
+     */
+    async getJobSchedulers(start, end, asc) {
+        return (await this.jobScheduler).getJobSchedulers(start, end, asc);
+    }
+    /**
+     *
+     * Get the number of job schedulers.
+     *
+     * @returns The number of job schedulers.
+     */
+    async getJobSchedulersCount() {
+        return (await this.jobScheduler).getSchedulersCount();
+    }
+    /**
+     * Removes a repeatable job.
+     *
+     * Note: you need to use the exact same repeatOpts when deleting a repeatable job
+     * than when adding it.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @see removeRepeatableByKey
+     *
+     * @param name - Job name
+     * @param repeatOpts - Repeat options
+     * @param jobId - Job id to remove. If not provided, all jobs with the same repeatOpts
+     * @returns
+     */
+    async removeRepeatable(name, repeatOpts, jobId) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'removeRepeatable', `${this.name}.${name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobName]: name,
+                [enums_1.TelemetryAttributes.JobId]: jobId,
+            });
+            const repeat = await this.repeat;
+            const removed = await repeat.removeRepeatable(name, repeatOpts, jobId);
+            return !removed;
+        });
+    }
+    /**
+     *
+     * Removes a job scheduler.
+     *
+     * @param jobSchedulerId - identifier of the job scheduler.
+     *
+     * @returns
+     */
+    async removeJobScheduler(jobSchedulerId) {
+        const jobScheduler = await this.jobScheduler;
+        const removed = await jobScheduler.removeJobScheduler(jobSchedulerId);
+        return !removed;
+    }
+    /**
+     * Removes a debounce key.
+     * @deprecated use removeDeduplicationKey
+     *
+     * @param id - debounce identifier
+     */
+    async removeDebounceKey(id) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'removeDebounceKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobKey]: id,
+            });
+            const client = await this.client;
+            return await client.del(`${this.keys.de}:${id}`);
+        });
+    }
+    /**
+     * Removes a deduplication key.
+     *
+     * @param id - identifier
+     */
+    async removeDeduplicationKey(id) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'removeDeduplicationKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.DeduplicationKey]: id,
+            });
+            const client = await this.client;
+            return client.del(`${this.keys.de}:${id}`);
+        });
+    }
+    /**
+     * Removes rate limit key.
+     */
+    async removeRateLimitKey() {
+        const client = await this.client;
+        return client.del(this.keys.limiter);
+    }
+    /**
+     * Removes a repeatable job by its key. Note that the key is the one used
+     * to store the repeatable job metadata and not one of the job iterations
+     * themselves. You can use "getRepeatableJobs" in order to get the keys.
+     *
+     * @see getRepeatableJobs
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @param repeatJobKey - To the repeatable job.
+     * @returns
+     */
+    async removeRepeatableByKey(key) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'removeRepeatableByKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobKey]: key,
+            });
+            const repeat = await this.repeat;
+            const removed = await repeat.removeRepeatableByKey(key);
+            return !removed;
+        });
+    }
+    /**
+     * Removes the given job from the queue as well as all its
+     * dependencies.
+     *
+     * @param jobId - The id of the job to remove
+     * @param opts - Options to remove a job
+     * @returns 1 if it managed to remove the job or 0 if the job or
+     * any of its dependencies were locked.
+     */
+    async remove(jobId, { removeChildren = true } = {}) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'remove', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobId]: jobId,
+                [enums_1.TelemetryAttributes.JobOptions]: JSON.stringify({
+                    removeChildren,
+                }),
+            });
+            const code = await this.scripts.remove(jobId, removeChildren);
+            if (code === 1) {
+                this.emit('removed', jobId);
+            }
+            return code;
+        });
+    }
+    /**
+     * Updates the given job's progress.
+     *
+     * @param jobId - The id of the job to update
+     * @param progress - Number or object to be saved as progress.
+     */
+    async updateJobProgress(jobId, progress) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'updateJobProgress', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobId]: jobId,
+                [enums_1.TelemetryAttributes.JobProgress]: JSON.stringify(progress),
+            });
+            await this.scripts.updateProgress(jobId, progress);
+            this.emit('progress', jobId, progress);
+        });
+    }
+    /**
+     * Logs one row of job's log data.
+     *
+     * @param jobId - The job id to log against.
+     * @param logRow - String with log data to be logged.
+     * @param keepLogs - Max number of log entries to keep (0 for unlimited).
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    async addJobLog(jobId, logRow, keepLogs) {
+        return job_1.Job.addJobLog(this, jobId, logRow, keepLogs);
+    }
+    /**
+     * Drains the queue, i.e., removes all jobs that are waiting
+     * or delayed, but not active, completed or failed.
+     *
+     * @param delayed - Pass true if it should also clean the
+     * delayed jobs.
+     */
+    async drain(delayed = false) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'drain', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueDrainDelay]: delayed,
+            });
+            await this.scripts.drain(delayed);
+        });
+    }
+    /**
+     * Cleans jobs from a queue. Similar to drain but keeps jobs within a certain
+     * grace period.
+     *
+     * @param grace - The grace period in milliseconds
+     * @param limit - Max number of jobs to clean
+     * @param type - The type of job to clean
+     * Possible values are completed, wait, active, paused, delayed, failed. Defaults to completed.
+     * @returns Id jobs from the deleted records
+     */
+    async clean(grace, limit, type = 'completed') {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'clean', this.name, async (span) => {
+            const maxCount = limit || Infinity;
+            const maxCountPerCall = Math.min(10000, maxCount);
+            const timestamp = Date.now() - grace;
+            let deletedCount = 0;
+            const deletedJobsIds = [];
+            // Normalize 'waiting' to 'wait' for consistency with internal Redis keys
+            const normalizedType = type === 'waiting' ? 'wait' : type;
+            while (deletedCount < maxCount) {
+                const jobsIds = await this.scripts.cleanJobsInSet(normalizedType, timestamp, maxCountPerCall);
+                this.emit('cleaned', jobsIds, normalizedType);
+                deletedCount += jobsIds.length;
+                deletedJobsIds.push(...jobsIds);
+                if (jobsIds.length < maxCountPerCall) {
+                    break;
+                }
+            }
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueGrace]: grace,
+                [enums_1.TelemetryAttributes.JobType]: type,
+                [enums_1.TelemetryAttributes.QueueCleanLimit]: maxCount,
+                [enums_1.TelemetryAttributes.JobIds]: deletedJobsIds,
+            });
+            return deletedJobsIds;
+        });
+    }
+    /**
+     * Completely destroys the queue and all of its contents irreversibly.
+     * This method will *pause* the queue and requires that there are no
+     * active jobs. It is possible to bypass this requirement, i.e. not
+     * having active jobs using the "force" option.
+     *
+     * Note: This operation requires to iterate on all the jobs stored in the queue
+     * and can be slow for very large queues.
+     *
+     * @param opts - Obliterate options.
+     */
+    async obliterate(opts) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'obliterate', this.name, async () => {
+            await this.pause();
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.obliterate(Object.assign({ force: false, count: 1000 }, opts));
+            } while (cursor);
+        });
+    }
+    /**
+     * Retry all the failed or completed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration,
+     *   - state  failed by default or completed.
+     *   - timestamp from which timestamp to start moving jobs to wait status, default Date.now().
+     *
+     * @returns
+     */
+    async retryJobs(opts = {}) {
+        await this.trace(enums_1.SpanKind.PRODUCER, 'retryJobs', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueOptions]: JSON.stringify(opts),
+            });
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.retryJobs(opts.state, opts.count, opts.timestamp);
+            } while (cursor);
+        });
+    }
+    /**
+     * Promote all the delayed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration
+     *
+     * @returns
+     */
+    async promoteJobs(opts = {}) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'promoteJobs', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueOptions]: JSON.stringify(opts),
+            });
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.promoteJobs(opts.count);
+            } while (cursor);
+        });
+    }
+    /**
+     * Trim the event stream to an approximately maxLength.
+     *
+     * @param maxLength - The approximate maximum length, or target length, of the event stream.
+     */
+    async trimEvents(maxLength) {
+        return this.trace(enums_1.SpanKind.INTERNAL, 'trimEvents', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueEventMaxLength]: maxLength,
+            });
+            const client = await this.client;
+            return await client.xtrim(this.keys.events, 'MAXLEN', maxLength, {
+                approximate: true,
+            });
+        });
+    }
+    /**
+     * Delete old priority helper key.
+     */
+    async removeDeprecatedPriorityKey() {
+        const client = await this.client;
+        return client.del(this.toKey('priority'));
+    }
+    /**
+     * Removes orphaned job keys that exist in Redis but are not referenced
+     * in any queue state set.
+     *
+     * Orphaned keys can occur in rare cases when the removal-by-max-age logic
+     * removes sorted-set entries without fully cleaning up the corresponding
+     * job hash data (a regression introduced in v5.66.6 via #3694).
+     * Under normal operation this method is
+     * **not needed** — it is provided only as a one-time migration helper for
+     * users who were affected by that specific bug and want to reclaim the
+     * leaked memory.
+     *
+     * The method uses a Lua script so that every check-and-delete cycle is
+     * atomic (per SCAN iteration). State keys are derived dynamically from
+     * the queue's key map and their Redis TYPE is checked at runtime, so newly
+     * introduced states are picked up automatically.
+     *
+     * @param count - Approximate number of keys to SCAN per iteration (default 1000).
+     * @param limit - Maximum number of orphaned jobs to remove (0 = unlimited).
+     *   When set, the method returns as soon as the limit is reached.
+     *   Users with a very large number of orphans can call this method
+     *   in a loop: `while (await queue.removeOrphanedJobs(1000, 10000)) {}`
+     * @returns The total number of orphaned jobs that were removed.
+     */
+    async removeOrphanedJobs(count = 1000, limit = 0) {
+        const client = await this.client;
+        // Derive infrastructure suffixes dynamically from the queue key map
+        // so any future keys are automatically excluded without code changes.
+        const knownSuffixes = new Set(Object.keys(this.keys));
+        // State key suffixes (excluding '') — passed to the Lua script which
+        // uses TYPE to decide whether a key is a list / zset / set and picks
+        // the right membership command automatically.
+        const stateKeySuffixes = Object.keys(this.keys).filter(s => s !== '');
+        // Known job sub-key suffixes (cleaned up during deletion).
+        const jobSubKeySuffixes = [
+            'logs',
+            'dependencies',
+            'processed',
+            'failed',
+            'unsuccessful',
+            'lock',
+        ];
+        const basePrefix = this.qualifiedName + ':';
+        const scanPattern = basePrefix + '*';
+        let totalRemoved = 0;
+        let cursor = '0';
+        do {
+            const [nextCursor, keys] = await client.scan(cursor, {
+                MATCH: scanPattern,
+                COUNT: count,
+            });
+            cursor = nextCursor;
+            // Extract unique potential job IDs from this batch.
+            const candidateJobIds = new Set();
+            for (const key of keys) {
+                const suffix = key.slice(basePrefix.length);
+                // Skip infrastructure keys (derived from this.keys).
+                if (knownSuffixes.has(suffix)) {
+                    continue;
+                }
+                // Skip sub-keys of infrastructure prefixes (e.g. repeat:xxx, de:xxx).
+                const colonIdx = suffix.indexOf(':');
+                if (colonIdx !== -1) {
+                    const prefixPart = suffix.slice(0, colonIdx);
+                    if (knownSuffixes.has(prefixPart)) {
+                        continue;
+                    }
+                }
+                // Extract the job ID portion (before first colon, or the whole suffix).
+                const jobId = colonIdx === -1 ? suffix : suffix.slice(0, colonIdx);
+                // For sub-keys, only consider known job sub-key suffixes.
+                if (colonIdx !== -1) {
+                    const subKey = suffix.slice(colonIdx + 1);
+                    if (!jobSubKeySuffixes.includes(subKey)) {
+                        continue;
+                    }
+                }
+                candidateJobIds.add(jobId);
+            }
+            if (candidateJobIds.size === 0) {
+                continue;
+            }
+            // Run the Lua script atomically for this batch of candidates.
+            const result = await this.scripts.removeOrphanedJobs([...candidateJobIds], stateKeySuffixes, jobSubKeySuffixes);
+            totalRemoved += result || 0;
+            if (limit > 0 && totalRemoved >= limit) {
+                break;
+            }
+        } while (cursor !== '0');
+        return totalRemoved;
+    }
+}
+exports.Queue = Queue;
diff --git a/node_modules/bullmq/dist/cjs/classes/redis-connection.js b/node_modules/bullmq/dist/cjs/classes/redis-connection.js
new file mode 100644
index 0000000..c666e2b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/redis-connection.js
@@ -0,0 +1,517 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RedisConnection = void 0;
+const tslib_1 = require("tslib");
+const events_1 = require("events");
+const ioredis_1 = require("ioredis");
+// eslint-disable-next-line @typescript-eslint/ban-ts-comment
+// @ts-ignore
+const utils_1 = require("ioredis/built/utils");
+const utils_2 = require("../utils");
+const version_1 = require("../version");
+const scripts = require("../scripts");
+const ioredis_client_1 = require("./ioredis-client");
+const connection_closed_error_1 = require("./errors/connection-closed-error");
+const overrideMessage = [
+    'BullMQ: WARNING! Your redis options maxRetriesPerRequest must be null',
+    'and will be overridden by BullMQ.',
+].join(' ');
+const deprecationMessage = 'BullMQ: Your redis options maxRetriesPerRequest must be null.';
+const clusterReconnectPromise = Symbol('bullmqClusterReconnectPromise');
+const clusterPatchedForBlocking = Symbol('bullmqClusterPatchedForBlocking');
+const clusterOriginalBzpopmin = Symbol('bullmqClusterOriginalBzpopmin');
+const clusterWrappedBzpopmin = Symbol('bullmqClusterWrappedBzpopmin');
+const clusterPatchRefCount = Symbol('bullmqClusterPatchRefCount');
+const clusterClosingRefCount = Symbol('bullmqClusterClosingRefCount');
+// Hard cap on a single cluster reconnect attempt. Without this, a hung
+// `client.connect()` (e.g. ioredis Cluster cannot recover and slot refresh
+// keeps retrying internally) leaves `clusterReconnectPromise` pinned forever
+// and every subsequent bzpopmin call awaits the same dead promise, deadlocking
+// the worker. 30s is comfortably above the default ioredis slotsRefreshTimeout
+// while bounded enough that wedged workers recover within one or two ticks.
+const DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS = 30000;
+class RedisConnection extends events_1.EventEmitter {
+    constructor(opts, extraOptions) {
+        super();
+        this.extraOptions = extraOptions;
+        this.capabilities = {
+            canDoubleTimeout: false,
+            canBlockFor1Ms: true,
+        };
+        this.status = 'initializing';
+        this.dbType = 'redis';
+        this.packageVersion = version_1.version;
+        this.disabledBlockingClusterReconnect = false;
+        // Set extra options defaults
+        this.extraOptions = Object.assign({ shared: false, blocking: true, skipVersionCheck: false, skipWaitingForReady: false, clusterReconnectTimeoutMs: DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS }, extraOptions);
+        if (!(0, utils_2.isRedisInstance)(opts)) {
+            this.checkBlockingOptions(overrideMessage, opts);
+            this.opts = Object.assign({ port: 6379, host: '127.0.0.1', retryStrategy: function (times) {
+                    return Math.max(Math.min(Math.exp(times), 20000), 1000);
+                } }, opts);
+            if (this.extraOptions.blocking) {
+                this.opts.maxRetriesPerRequest = null;
+            }
+        }
+        else {
+            // Wrap raw ioredis instances in the IRedisClient adapter if not already wrapped
+            this._client = (0, ioredis_client_1.isIRedisClient)(opts)
+                ? opts
+                : (0, ioredis_client_1.createIORedisClient)(opts);
+            // Test if the redis instance is using keyPrefix
+            // and if so, throw an error.
+            if (this._client.options.keyPrefix) {
+                throw new Error('BullMQ: ioredis does not support ioredis prefixes, use the prefix option instead.');
+            }
+            if (this._client.isCluster) {
+                this.opts = this._client.options.redisOptions;
+            }
+            else {
+                this.opts = this._client.options;
+            }
+            this.checkBlockingOptions(deprecationMessage, this.opts, true);
+        }
+        this.skipVersionCheck =
+            (extraOptions === null || extraOptions === void 0 ? void 0 : extraOptions.skipVersionCheck) ||
+                !!(this.opts && this.opts.skipVersionCheck);
+        this.handleClientError = (err) => {
+            this.emit('error', err);
+        };
+        this.handleClientClose = () => {
+            this.emit('close');
+        };
+        this.handleClientReady = () => {
+            this.emit('ready');
+        };
+        this.initializing = this.init();
+        this.initializing.catch(err => this.emit('error', err));
+    }
+    checkBlockingOptions(msg, options, throwError = false) {
+        if (this.extraOptions.blocking && options && options.maxRetriesPerRequest) {
+            if (throwError) {
+                throw new Error(msg);
+            }
+            else {
+                console.error(msg);
+            }
+        }
+    }
+    /**
+     * Waits for a redis client to be ready.
+     * @param redis - client
+     */
+    static async waitUntilReady(client) {
+        if (client.status === 'ready') {
+            return;
+        }
+        // ioredis Cluster reports 'connect' as its connected status instead of
+        // 'ready' that standalone Redis uses. Treat it as already connected so we
+        // don't hang waiting for a 'ready' event that will never fire and end up
+        // throwing a spurious "Connection is closed" error during disconnect.
+        if (client.status === 'connect' && (0, utils_2.isRedisCluster)(client)) {
+            return;
+        }
+        if (client.status === 'wait') {
+            return client.connect();
+        }
+        if (client.status === 'end') {
+            throw new connection_closed_error_1.ConnectionClosedError(utils_1.CONNECTION_CLOSED_ERROR_MSG);
+        }
+        let handleReady;
+        let handleEnd;
+        let handleError;
+        try {
+            await new Promise((resolve, reject) => {
+                let lastError;
+                handleError = (err) => {
+                    lastError = err;
+                };
+                handleReady = () => {
+                    resolve();
+                };
+                handleEnd = () => {
+                    if (client.status !== 'end') {
+                        reject(lastError ||
+                            new connection_closed_error_1.ConnectionClosedError(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+                    }
+                    else {
+                        if (lastError) {
+                            reject(lastError);
+                        }
+                        else {
+                            // when custom 'end' status is set we already closed
+                            resolve();
+                        }
+                    }
+                };
+                (0, utils_2.increaseMaxListeners)(client, 3);
+                client.once('ready', handleReady);
+                client.on('end', handleEnd);
+                client.once('error', handleError);
+            });
+        }
+        finally {
+            client.removeListener('end', handleEnd);
+            client.removeListener('error', handleError);
+            client.removeListener('ready', handleReady);
+            (0, utils_2.decreaseMaxListeners)(client, 3);
+        }
+    }
+    get client() {
+        return this.initializing;
+    }
+    loadCommands(packageVersion, providedScripts) {
+        const finalScripts = providedScripts || scripts;
+        for (const property in finalScripts) {
+            // Only define the command if not already defined
+            const commandName = `${finalScripts[property].name}:${packageVersion}`;
+            if (!this._client[commandName]) {
+                this._client.defineCommand(commandName, {
+                    numberOfKeys: finalScripts[property].keys,
+                    lua: finalScripts[property].content,
+                });
+            }
+        }
+    }
+    async init() {
+        if (!this._client) {
+            if (RedisConnection.clientFactory) {
+                this._client = RedisConnection.clientFactory(this.opts);
+            }
+            else {
+                const _a = this.opts, { url } = _a, rest = tslib_1.__rest(_a, ["url"]);
+                const ioredisClient = url ? new ioredis_1.default(url, rest) : new ioredis_1.default(rest);
+                this._client = (0, ioredis_client_1.createIORedisClient)(ioredisClient);
+            }
+        }
+        (0, utils_2.increaseMaxListeners)(this._client, 3);
+        this._client.on('error', this.handleClientError);
+        // ioredis treats connection errors as a different event ('close')
+        this._client.on('close', this.handleClientClose);
+        this._client.on('ready', this.handleClientReady);
+        this.patchBlockingClusterClient();
+        if (!this.extraOptions.skipWaitingForReady) {
+            await RedisConnection.waitUntilReady(this._client);
+        }
+        this.loadCommands(this.packageVersion);
+        if (this._client['status'] !== 'end') {
+            const versionResult = await this.getRedisVersionAndType();
+            this.version = versionResult.version;
+            this.dbType = versionResult.databaseType;
+            if (this.skipVersionCheck !== true && !this.closing) {
+                if ((0, utils_2.isRedisVersionLowerThan)(this.version, RedisConnection.minimumVersion, this.dbType)) {
+                    throw new Error(`Redis version needs to be greater or equal than ${RedisConnection.minimumVersion} ` +
+                        `Current: ${this.version}`);
+                }
+                if ((0, utils_2.isRedisVersionLowerThan)(this.version, RedisConnection.recommendedMinimumVersion, this.dbType)) {
+                    console.warn(`It is highly recommended to use a minimum Redis version of ${RedisConnection.recommendedMinimumVersion}
+             Current: ${this.version}`);
+                }
+            }
+            this.capabilities = {
+                canDoubleTimeout: !(0, utils_2.isRedisVersionLowerThan)(this.version, '6.0.0', this.dbType),
+                canBlockFor1Ms: !(0, utils_2.isRedisVersionLowerThan)(this.version, '7.0.8', this.dbType),
+            };
+            this.status = 'ready';
+        }
+        return this._client;
+    }
+    patchBlockingClusterClient() {
+        var _a;
+        const client = this._client;
+        const blockingClient = client;
+        if (!this.extraOptions.blocking ||
+            !(0, utils_2.isRedisCluster)(client) ||
+            typeof blockingClient.bzpopmin !== 'function') {
+            return;
+        }
+        const reconnectTimeoutMs = (_a = this.extraOptions.clusterReconnectTimeoutMs) !== null && _a !== void 0 ? _a : DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS;
+        blockingClient[clusterPatchRefCount] =
+            (blockingClient[clusterPatchRefCount] || 0) + 1;
+        this.patchedBlockingClusterClient = blockingClient;
+        if (blockingClient[clusterPatchedForBlocking]) {
+            return;
+        }
+        const bzpopmin = blockingClient.bzpopmin;
+        const wrappedBzpopmin = async (...args) => {
+            await RedisConnection.reconnectClusterIfNeeded(blockingClient, reconnectTimeoutMs);
+            try {
+                return await bzpopmin.apply(blockingClient, args);
+            }
+            catch (error) {
+                const commandError = error;
+                if (RedisConnection.shouldReconnectClusterAfterError(blockingClient, commandError)) {
+                    try {
+                        await RedisConnection.reconnectCluster(blockingClient, reconnectTimeoutMs);
+                    }
+                    catch (_a) {
+                        // Preserve the original command failure if best-effort recovery fails.
+                    }
+                }
+                throw commandError;
+            }
+        };
+        blockingClient[clusterOriginalBzpopmin] = bzpopmin;
+        blockingClient[clusterWrappedBzpopmin] = wrappedBzpopmin;
+        blockingClient[clusterPatchedForBlocking] = true;
+        blockingClient.bzpopmin = wrappedBzpopmin;
+    }
+    disableBlockingClusterReconnect() {
+        const client = this.patchedBlockingClusterClient;
+        if (!client || this.disabledBlockingClusterReconnect) {
+            return;
+        }
+        client[clusterClosingRefCount] = (client[clusterClosingRefCount] || 0) + 1;
+        this.disabledBlockingClusterReconnect = true;
+    }
+    releaseBlockingClusterClientPatch() {
+        const client = this.patchedBlockingClusterClient;
+        if (!client) {
+            return;
+        }
+        if (this.disabledBlockingClusterReconnect) {
+            const closingRefCount = (client[clusterClosingRefCount] || 1) - 1;
+            if (closingRefCount > 0) {
+                client[clusterClosingRefCount] = closingRefCount;
+            }
+            else {
+                delete client[clusterClosingRefCount];
+            }
+            this.disabledBlockingClusterReconnect = false;
+        }
+        const patchRefCount = (client[clusterPatchRefCount] || 1) - 1;
+        if (patchRefCount > 0) {
+            client[clusterPatchRefCount] = patchRefCount;
+            this.patchedBlockingClusterClient = undefined;
+            return;
+        }
+        if (client[clusterOriginalBzpopmin] &&
+            client.bzpopmin === client[clusterWrappedBzpopmin]) {
+            client.bzpopmin = client[clusterOriginalBzpopmin];
+        }
+        delete client[clusterPatchRefCount];
+        delete client[clusterClosingRefCount];
+        delete client[clusterOriginalBzpopmin];
+        delete client[clusterWrappedBzpopmin];
+        delete client[clusterPatchedForBlocking];
+        this.patchedBlockingClusterClient = undefined;
+    }
+    static isClusterWithEmptyNodes(client) {
+        return typeof client.nodes === 'function' && client.nodes().length === 0;
+    }
+    static isReconnectingDisabled(client) {
+        const patchRefCount = client[clusterPatchRefCount] || 0;
+        const closingRefCount = client[clusterClosingRefCount] || 0;
+        return (patchRefCount === 0 ||
+            closingRefCount >= patchRefCount ||
+            client.status === 'end' ||
+            client.status === 'closing');
+    }
+    static async reconnectClusterIfNeeded(client, timeoutMs) {
+        if (!RedisConnection.isReconnectingDisabled(client) &&
+            RedisConnection.isClusterWithEmptyNodes(client)) {
+            await RedisConnection.reconnectCluster(client, timeoutMs);
+        }
+    }
+    static shouldReconnectClusterAfterError(client, error) {
+        var _a, _b;
+        if (RedisConnection.isReconnectingDisabled(client)) {
+            return false;
+        }
+        const message = [
+            error.message,
+            (_a = error.cause) === null || _a === void 0 ? void 0 : _a.message,
+            (_b = error.lastNodeError) === null || _b === void 0 ? void 0 : _b.message,
+        ].join(' ');
+        return (RedisConnection.isClusterWithEmptyNodes(client) ||
+            /Command timed out|Failed to refresh slots cache/i.test(message));
+    }
+    static async reconnectCluster(client, timeoutMs) {
+        if (RedisConnection.isReconnectingDisabled(client)) {
+            return;
+        }
+        if (!client[clusterReconnectPromise]) {
+            client[clusterReconnectPromise] =
+                RedisConnection.connectClusterWithTimeout(client, timeoutMs).finally(() => {
+                    client[clusterReconnectPromise] = null;
+                });
+        }
+        await client[clusterReconnectPromise];
+    }
+    // Disconnects and reconnects a cluster client, racing connect() against a
+    // hard cap so a hung reconnect cannot pin `clusterReconnectPromise`
+    // indefinitely. On timeout, the underlying connect() is left running
+    // (ioredis Cluster handles its own retry/state); we simply stop awaiting it.
+    // The next bzpopmin call's `reconnectClusterIfNeeded` check will trigger a
+    // fresh reconnect if the pool is still empty.
+    static async connectClusterWithTimeout(client, timeoutMs) {
+        client.disconnect(false);
+        let timeoutHandle;
+        try {
+            await Promise.race([
+                client.connect(),
+                new Promise((_, reject) => {
+                    var _a;
+                    timeoutHandle = setTimeout(() => {
+                        reject(new connection_closed_error_1.ConnectionClosedError(`BullMQ: cluster reconnect timed out after ${timeoutMs}ms`));
+                    }, timeoutMs);
+                    // Don't keep the event loop alive solely for this timer.
+                    (_a = timeoutHandle.unref) === null || _a === void 0 ? void 0 : _a.call(timeoutHandle);
+                }),
+            ]);
+        }
+        finally {
+            if (timeoutHandle) {
+                clearTimeout(timeoutHandle);
+            }
+        }
+    }
+    async disconnect(wait = true) {
+        const client = await this.client;
+        if (client.status !== 'end') {
+            let _resolve, _reject;
+            if (!wait) {
+                return client.disconnect();
+            }
+            const disconnecting = new Promise((resolve, reject) => {
+                (0, utils_2.increaseMaxListeners)(client, 2);
+                client.once('end', resolve);
+                client.once('error', reject);
+                _resolve = resolve;
+                _reject = reject;
+            });
+            client.disconnect();
+            try {
+                await disconnecting;
+            }
+            finally {
+                (0, utils_2.decreaseMaxListeners)(client, 2);
+                client.removeListener('end', _resolve);
+                client.removeListener('error', _reject);
+            }
+        }
+    }
+    async reconnect() {
+        const client = await this.client;
+        return client.connect();
+    }
+    async close(force = false) {
+        var _a;
+        if (!this.closing) {
+            const status = this.status;
+            this.status = 'closing';
+            this.closing = true;
+            this.disableBlockingClusterReconnect();
+            try {
+                if (status === 'ready') {
+                    // Not sure if we need to wait for this
+                    await this.initializing;
+                }
+                if (!this.extraOptions.shared) {
+                    if (status == 'initializing' || force) {
+                        // If we have not still connected to Redis, we need to disconnect.
+                        this._client.disconnect();
+                        // Suppress any rejection from the in-flight init() so it doesn't
+                        // become an unhandled rejection after we close the connection.
+                        (_a = this.initializing) === null || _a === void 0 ? void 0 : _a.catch(() => { });
+                    }
+                    else {
+                        await this._client.quit();
+                    }
+                    // As IORedis does not update this status properly, we do it ourselves.
+                    this._client['status'] = 'end';
+                }
+            }
+            catch (error) {
+                if ((0, utils_2.isNotConnectionError)(error)) {
+                    throw error;
+                }
+            }
+            finally {
+                this.releaseBlockingClusterClientPatch();
+                this._client.off('error', this.handleClientError);
+                this._client.off('close', this.handleClientClose);
+                this._client.off('ready', this.handleClientReady);
+                (0, utils_2.decreaseMaxListeners)(this._client, 3);
+                this.removeAllListeners();
+                this.status = 'closed';
+            }
+        }
+    }
+    async getRedisVersionAndType() {
+        if (this.skipVersionCheck) {
+            return {
+                version: RedisConnection.minimumVersion,
+                databaseType: 'redis',
+            };
+        }
+        const doc = await this._client.info();
+        const redisPrefix = 'redis_version:';
+        const maxMemoryPolicyPrefix = 'maxmemory_policy:';
+        const lines = doc.split(/\r?\n/);
+        let redisVersion;
+        let databaseType = 'redis';
+        // Detect database type from server info
+        for (let i = 0; i < lines.length; i++) {
+            const line = lines[i];
+            // Check for Dragonfly
+            if (line.includes('dragonfly_version:') ||
+                line.includes('server:Dragonfly')) {
+                databaseType = 'dragonfly';
+                // For Dragonfly, extract version from dragonfly_version field
+                if (line.indexOf('dragonfly_version:') === 0) {
+                    redisVersion = line.substr('dragonfly_version:'.length);
+                }
+            }
+            // Check for Valkey
+            else if (line.includes('valkey_version:') ||
+                line.includes('server:Valkey')) {
+                databaseType = 'valkey';
+                // For Valkey, extract version from valkey_version field
+                if (line.indexOf('valkey_version:') === 0) {
+                    redisVersion = line.substr('valkey_version:'.length);
+                }
+            }
+            // Standard Redis version detection
+            else if (line.indexOf(redisPrefix) === 0) {
+                redisVersion = line.substr(redisPrefix.length);
+                // Keep Redis as default unless we find evidence of other databases above
+                if (databaseType === 'redis') {
+                    databaseType = 'redis';
+                }
+            }
+            if (line.indexOf(maxMemoryPolicyPrefix) === 0) {
+                const maxMemoryPolicy = line.substr(maxMemoryPolicyPrefix.length);
+                if (maxMemoryPolicy !== 'noeviction') {
+                    console.warn(`IMPORTANT! Eviction policy is ${maxMemoryPolicy}. It should be "noeviction"`);
+                }
+            }
+        }
+        // Fallback version detection if specific database version field wasn't found
+        if (!redisVersion) {
+            // Try to find any version field as fallback
+            for (const line of lines) {
+                if (line.includes('version:')) {
+                    const parts = line.split(':');
+                    if (parts.length >= 2) {
+                        redisVersion = parts[1];
+                        break;
+                    }
+                }
+            }
+        }
+        return {
+            version: redisVersion || RedisConnection.minimumVersion,
+            databaseType,
+        };
+    }
+    get redisVersion() {
+        return this.version;
+    }
+    get databaseType() {
+        return this.dbType;
+    }
+}
+exports.RedisConnection = RedisConnection;
+RedisConnection.minimumVersion = '5.0.0';
+RedisConnection.recommendedMinimumVersion = '6.2.0';
diff --git a/node_modules/bullmq/dist/cjs/classes/repeat.js b/node_modules/bullmq/dist/cjs/classes/repeat.js
new file mode 100644
index 0000000..0193bb0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/repeat.js
@@ -0,0 +1,203 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getNextMillis = exports.Repeat = void 0;
+const tslib_1 = require("tslib");
+const cron_parser_1 = require("cron-parser");
+const crypto_1 = require("crypto");
+const queue_base_1 = require("./queue-base");
+class Repeat extends queue_base_1.QueueBase {
+    constructor(name, opts, Connection) {
+        super(name, opts, Connection);
+        this.repeatStrategy =
+            (opts.settings && opts.settings.repeatStrategy) || exports.getNextMillis;
+        this.repeatKeyHashAlgorithm =
+            (opts.settings && opts.settings.repeatKeyHashAlgorithm) || 'md5';
+    }
+    async updateRepeatableJob(name, data, opts, { override }) {
+        var _a, _b;
+        // Backwards compatibility for repeatable jobs for versions <= 3.0.0
+        const repeatOpts = Object.assign({}, opts.repeat);
+        (_a = repeatOpts.pattern) !== null && _a !== void 0 ? _a : (repeatOpts.pattern = repeatOpts.cron);
+        delete repeatOpts.cron;
+        // Check if we reached the limit of the repeatable job's iterations
+        const iterationCount = repeatOpts.count ? repeatOpts.count + 1 : 1;
+        if (typeof repeatOpts.limit !== 'undefined' &&
+            iterationCount > repeatOpts.limit) {
+            return;
+        }
+        // Check if we reached the end date of the repeatable job
+        let now = Date.now();
+        const { endDate } = repeatOpts;
+        if (endDate && now > new Date(endDate).getTime()) {
+            return;
+        }
+        const prevMillis = opts.prevMillis || 0;
+        now = prevMillis < now ? now : prevMillis;
+        const nextMillis = await this.repeatStrategy(now, repeatOpts, name);
+        const { every, pattern } = repeatOpts;
+        const hasImmediately = Boolean((every || pattern) && repeatOpts.immediately);
+        const offset = hasImmediately && every ? now - nextMillis : undefined;
+        if (nextMillis) {
+            // We store the undecorated opts.jobId into the repeat options
+            if (!prevMillis && opts.jobId) {
+                repeatOpts.jobId = opts.jobId;
+            }
+            const legacyRepeatKey = getRepeatConcatOptions(name, repeatOpts);
+            const newRepeatKey = (_b = opts.repeat.key) !== null && _b !== void 0 ? _b : this.hash(legacyRepeatKey);
+            let repeatJobKey;
+            if (override) {
+                repeatJobKey = await this.scripts.addRepeatableJob(newRepeatKey, nextMillis, {
+                    name,
+                    endDate: endDate ? new Date(endDate).getTime() : undefined,
+                    tz: repeatOpts.tz,
+                    pattern,
+                    every,
+                }, legacyRepeatKey);
+            }
+            else {
+                const client = await this.client;
+                repeatJobKey = await this.scripts.updateRepeatableJobMillis(client, newRepeatKey, nextMillis, legacyRepeatKey);
+            }
+            const { immediately } = repeatOpts, filteredRepeatOpts = tslib_1.__rest(repeatOpts, ["immediately"]);
+            return this.createNextJob(name, nextMillis, repeatJobKey, Object.assign(Object.assign({}, opts), { repeat: Object.assign({ offset }, filteredRepeatOpts) }), data, iterationCount, hasImmediately);
+        }
+    }
+    async createNextJob(name, nextMillis, repeatJobKey, opts, data, currentCount, hasImmediately) {
+        //
+        // Generate unique job id for this iteration.
+        //
+        const jobId = this.getRepeatJobKey(name, nextMillis, repeatJobKey, data);
+        const now = Date.now();
+        const delay = nextMillis + (opts.repeat.offset ? opts.repeat.offset : 0) - now;
+        const mergedOpts = Object.assign(Object.assign({}, opts), { jobId, delay: delay < 0 || hasImmediately ? 0 : delay, timestamp: now, prevMillis: nextMillis, repeatJobKey });
+        mergedOpts.repeat = Object.assign(Object.assign({}, opts.repeat), { count: currentCount });
+        return this.Job.create(this, name, data, mergedOpts);
+    }
+    // TODO: remove legacy code in next breaking change
+    getRepeatJobKey(name, nextMillis, repeatJobKey, data) {
+        if (repeatJobKey.split(':').length > 2) {
+            return this.getRepeatJobId({
+                name: name,
+                nextMillis: nextMillis,
+                namespace: this.hash(repeatJobKey),
+                jobId: data === null || data === void 0 ? void 0 : data.id,
+            });
+        }
+        return this.getRepeatDelayedJobId({
+            customKey: repeatJobKey,
+            nextMillis,
+        });
+    }
+    async removeRepeatable(name, repeat, jobId) {
+        var _a;
+        const repeatConcatOptions = getRepeatConcatOptions(name, Object.assign(Object.assign({}, repeat), { jobId }));
+        const repeatJobKey = (_a = repeat.key) !== null && _a !== void 0 ? _a : this.hash(repeatConcatOptions);
+        const legacyRepeatJobId = this.getRepeatJobId({
+            name,
+            nextMillis: '',
+            namespace: this.hash(repeatConcatOptions),
+            jobId: jobId !== null && jobId !== void 0 ? jobId : repeat.jobId,
+            key: repeat.key,
+        });
+        return this.scripts.removeRepeatable(legacyRepeatJobId, repeatConcatOptions, repeatJobKey);
+    }
+    async removeRepeatableByKey(repeatJobKey) {
+        const data = this.keyToData(repeatJobKey);
+        const legacyRepeatJobId = this.getRepeatJobId({
+            name: data.name,
+            nextMillis: '',
+            namespace: this.hash(repeatJobKey),
+            jobId: data.id,
+        });
+        return this.scripts.removeRepeatable(legacyRepeatJobId, '', repeatJobKey);
+    }
+    async getRepeatableData(client, key, next) {
+        const jobData = await client.hgetall(this.toKey('repeat:' + key));
+        if (jobData) {
+            return {
+                key,
+                name: jobData.name,
+                endDate: parseInt(jobData.endDate) || null,
+                tz: jobData.tz || null,
+                pattern: jobData.pattern || null,
+                every: jobData.every || null,
+                next,
+            };
+        }
+        return this.keyToData(key, next);
+    }
+    keyToData(key, next) {
+        const data = key.split(':');
+        const pattern = data.slice(4).join(':') || null;
+        return {
+            key,
+            name: data[0],
+            id: data[1] || null,
+            endDate: parseInt(data[2]) || null,
+            tz: data[3] || null,
+            pattern,
+            next,
+        };
+    }
+    async getRepeatableJobs(start = 0, end = -1, asc = false) {
+        const client = await this.client;
+        const key = this.keys.repeat;
+        const result = asc
+            ? await client.zrange(key, start, end, { WITHSCORES: true })
+            : await client.zrevrange(key, start, end, { WITHSCORES: true });
+        const jobs = [];
+        for (let i = 0; i < result.length; i += 2) {
+            jobs.push(this.getRepeatableData(client, result[i], parseInt(result[i + 1])));
+        }
+        return Promise.all(jobs);
+    }
+    async getRepeatableCount() {
+        const client = await this.client;
+        return client.zcard(this.toKey('repeat'));
+    }
+    hash(str) {
+        return (0, crypto_1.createHash)(this.repeatKeyHashAlgorithm).update(str).digest('hex');
+    }
+    getRepeatDelayedJobId({ nextMillis, customKey, }) {
+        return `repeat:${customKey}:${nextMillis}`;
+    }
+    getRepeatJobId({ name, nextMillis, namespace, jobId, key, }) {
+        const checksum = key !== null && key !== void 0 ? key : this.hash(`${name}${jobId || ''}${namespace}`);
+        return `repeat:${checksum}:${nextMillis}`;
+    }
+}
+exports.Repeat = Repeat;
+function getRepeatConcatOptions(name, repeat) {
+    const endDate = repeat.endDate ? new Date(repeat.endDate).getTime() : '';
+    const tz = repeat.tz || '';
+    const pattern = repeat.pattern;
+    const suffix = (pattern ? pattern : String(repeat.every)) || '';
+    const jobId = repeat.jobId ? repeat.jobId : '';
+    return `${name}:${jobId}:${endDate}:${tz}:${suffix}`;
+}
+const getNextMillis = (millis, opts) => {
+    const pattern = opts.pattern;
+    if (pattern && opts.every) {
+        throw new Error('Both .pattern and .every options are defined for this repeatable job');
+    }
+    if (opts.every) {
+        return (Math.floor(millis / opts.every) * opts.every +
+            (opts.immediately ? 0 : opts.every));
+    }
+    const currentDate = opts.startDate && new Date(opts.startDate) > new Date(millis)
+        ? new Date(opts.startDate)
+        : new Date(millis);
+    const interval = (0, cron_parser_1.parseExpression)(pattern, Object.assign(Object.assign({}, opts), { currentDate }));
+    try {
+        if (opts.immediately) {
+            return new Date().getTime();
+        }
+        else {
+            return interval.next().getTime();
+        }
+    }
+    catch (e) {
+        // Ignore error
+    }
+};
+exports.getNextMillis = getNextMillis;
diff --git a/node_modules/bullmq/dist/cjs/classes/sandbox.js b/node_modules/bullmq/dist/cjs/classes/sandbox.js
new file mode 100644
index 0000000..ee4f01b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/sandbox.js
@@ -0,0 +1,158 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const enums_1 = require("../enums");
+const sandbox = (processFile, childPool) => {
+    return async function process(job, token, signal) {
+        let child;
+        let msgHandler;
+        let exitHandler;
+        let abortHandler;
+        try {
+            const done = new Promise((resolve, reject) => {
+                const initChild = async () => {
+                    try {
+                        exitHandler = (exitCode, signal) => {
+                            reject(new Error('Unexpected exit code: ' + exitCode + ' signal: ' + signal));
+                        };
+                        child = await childPool.retain(processFile);
+                        child.on('exit', exitHandler);
+                        msgHandler = async (msg) => {
+                            var _a, _b, _c, _d, _e;
+                            try {
+                                switch (msg.cmd) {
+                                    case enums_1.ParentCommand.Completed:
+                                        resolve(msg.value);
+                                        break;
+                                    case enums_1.ParentCommand.Failed:
+                                    case enums_1.ParentCommand.Error: {
+                                        const err = new Error();
+                                        Object.assign(err, msg.value);
+                                        reject(err);
+                                        break;
+                                    }
+                                    case enums_1.ParentCommand.Progress:
+                                        await job.updateProgress(msg.value);
+                                        break;
+                                    case enums_1.ParentCommand.Log:
+                                        await job.log(msg.value);
+                                        break;
+                                    case enums_1.ParentCommand.MoveToDelayed:
+                                        await job.moveToDelayed((_a = msg.value) === null || _a === void 0 ? void 0 : _a.timestamp, (_b = msg.value) === null || _b === void 0 ? void 0 : _b.token);
+                                        break;
+                                    case enums_1.ParentCommand.MoveToWait:
+                                        await job.moveToWait((_c = msg.value) === null || _c === void 0 ? void 0 : _c.token);
+                                        break;
+                                    case enums_1.ParentCommand.MoveToWaitingChildren:
+                                        {
+                                            const value = await job.moveToWaitingChildren((_d = msg.value) === null || _d === void 0 ? void 0 : _d.token, (_e = msg.value) === null || _e === void 0 ? void 0 : _e.opts);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: enums_1.ChildCommand.MoveToWaitingChildrenResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case enums_1.ParentCommand.Update:
+                                        await job.updateData(msg.value);
+                                        break;
+                                    case enums_1.ParentCommand.GetChildrenValues:
+                                        {
+                                            const value = await job.getChildrenValues();
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: enums_1.ChildCommand.GetChildrenValuesResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case enums_1.ParentCommand.GetIgnoredChildrenFailures:
+                                        {
+                                            const value = await job.getIgnoredChildrenFailures();
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: enums_1.ChildCommand.GetIgnoredChildrenFailuresResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case enums_1.ParentCommand.GetDependenciesCount:
+                                        {
+                                            const value = await job.getDependenciesCount(msg.value);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: enums_1.ChildCommand.GetDependenciesCountResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case enums_1.ParentCommand.GetDependencies:
+                                        {
+                                            const value = await job.getDependencies(msg.value);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: enums_1.ChildCommand.GetDependenciesResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                }
+                            }
+                            catch (err) {
+                                reject(err);
+                            }
+                        };
+                        child.on('message', msgHandler);
+                        child.send({
+                            cmd: enums_1.ChildCommand.Start,
+                            job: job.asJSONSandbox(),
+                            token,
+                        });
+                        if (signal) {
+                            abortHandler = () => {
+                                try {
+                                    child.send({
+                                        cmd: enums_1.ChildCommand.Cancel,
+                                        value: signal.reason,
+                                    });
+                                }
+                                catch (_a) {
+                                    // Child process may have already exited
+                                }
+                            };
+                            if (signal.aborted) {
+                                abortHandler();
+                            }
+                            else {
+                                signal.addEventListener('abort', abortHandler, { once: true });
+                            }
+                        }
+                    }
+                    catch (error) {
+                        reject(error);
+                    }
+                };
+                initChild();
+            });
+            await done;
+            return done;
+        }
+        finally {
+            // Note: There is a potential race where the signal is aborted between
+            // `await done` and this cleanup. This is safe because:
+            // 1. abortHandler has a try-catch for child process already exited
+            // 2. The listener is added with `once: true`, so it fires at most once
+            // 3. removeEventListener here is defensive cleanup only
+            if (signal && abortHandler) {
+                signal.removeEventListener('abort', abortHandler);
+            }
+            if (child) {
+                child.off('message', msgHandler);
+                child.off('exit', exitHandler);
+                if (child.exitCode === null && child.signalCode === null) {
+                    childPool.release(child);
+                }
+            }
+        }
+    };
+};
+exports.default = sandbox;
diff --git a/node_modules/bullmq/dist/cjs/classes/scripts.js b/node_modules/bullmq/dist/cjs/classes/scripts.js
new file mode 100644
index 0000000..c12c687
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/scripts.js
@@ -0,0 +1,1297 @@
+/**
+ * Includes all the scripts needed by the queue and jobs.
+ */
+'use strict';
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Scripts = void 0;
+exports.raw2NextJobData = raw2NextJobData;
+const msgpackr_1 = require("msgpackr");
+const packer = new msgpackr_1.Packr({
+    useRecords: false,
+    encodeUndefinedAsNil: true,
+});
+const pack = packer.pack;
+const enums_1 = require("../enums");
+const utils_1 = require("../utils");
+const version_1 = require("../version");
+const errors_1 = require("./errors");
+class Scripts {
+    constructor(queue) {
+        this.queue = queue;
+        this.version = version_1.version;
+        const queueKeys = this.queue.keys;
+        this.moveToFinishedKeys = [
+            queueKeys.wait,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.events,
+            queueKeys.stalled,
+            queueKeys.limiter,
+            queueKeys.delayed,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.pc,
+            undefined,
+            undefined,
+            undefined,
+            undefined,
+        ];
+    }
+    /**
+     * Executes a registered Lua script on the given Redis client, resolving the
+     * versioned command name (e.g. `addJob:<packageVersion>`) so the script
+     * belonging to the current BullMQ version is invoked.
+     *
+     * @param client - The Redis client or pipeline/transaction on which to run the command.
+     * @param commandName - The base name of the Lua script (without version suffix).
+     * @param args - Positional arguments forwarded to the Lua script (keys followed by argv).
+     * @returns The raw result produced by the Lua script.
+     *
+     * @private
+     */
+    execCommand(client, commandName, args) {
+        const commandNameWithVersion = `${commandName}:${this.version}`;
+        return client.runCommand(commandNameWithVersion, args);
+    }
+    /**
+     * Checks whether a job with the given id is present in a Redis list
+     * (e.g. the wait or active list). Uses `LPOS` on Redis \>= 6.0.6, and
+     * falls back to a Lua script on older versions.
+     *
+     * @param listKey - The Redis list key to search.
+     * @param jobId - The job id to look up in the list.
+     * @returns `true` if the job is found in the list, `false` otherwise.
+     *
+     * @private
+     */
+    async isJobInList(listKey, jobId) {
+        const client = await this.queue.client;
+        let result;
+        if ((0, utils_1.isRedisVersionLowerThan)(this.queue.redisVersion, '6.0.6', this.queue.databaseType)) {
+            result = await this.execCommand(client, 'isJobInList', [listKey, jobId]);
+        }
+        else {
+            result = await client.lpos(listKey, jobId);
+        }
+        return Number.isInteger(result);
+    }
+    addDelayedJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.delayed,
+            queueKeys.completed,
+            queueKeys.events,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addDelayedJob(client, job, encodedOpts, args) {
+        const argsList = this.addDelayedJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addDelayedJob', argsList);
+    }
+    addPrioritizedJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.prioritized,
+            queueKeys.delayed,
+            queueKeys.completed,
+            queueKeys.active,
+            queueKeys.events,
+            queueKeys.pc,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addPrioritizedJob(client, job, encodedOpts, args) {
+        const argsList = this.addPrioritizedJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addPrioritizedJob', argsList);
+    }
+    addParentJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.delayed,
+            queueKeys['waiting-children'],
+            queueKeys.completed,
+            queueKeys.events,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addParentJob(client, job, encodedOpts, args) {
+        const argsList = this.addParentJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addParentJob', argsList);
+    }
+    addStandardJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.completed,
+            queueKeys.delayed,
+            queueKeys.active,
+            queueKeys.events,
+            queueKeys.marker,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addStandardJob(client, job, encodedOpts, args) {
+        const argsList = this.addStandardJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addStandardJob', argsList);
+    }
+    async addJob(client, job, opts, jobId, parentKeyOpts = {}) {
+        const queueKeys = this.queue.keys;
+        const parent = job.parent;
+        const args = [
+            queueKeys[''],
+            typeof jobId !== 'undefined' ? jobId : '',
+            job.name,
+            job.timestamp,
+            job.parentKey || null,
+            parentKeyOpts.parentDependenciesKey || null,
+            parent,
+            job.repeatJobKey,
+            job.deduplicationId ? `${queueKeys.de}:${job.deduplicationId}` : null,
+        ];
+        let encodedOpts;
+        if (opts.repeat) {
+            const repeat = Object.assign({}, opts.repeat);
+            if (repeat.startDate) {
+                repeat.startDate = +new Date(repeat.startDate);
+            }
+            if (repeat.endDate) {
+                repeat.endDate = +new Date(repeat.endDate);
+            }
+            encodedOpts = pack(Object.assign(Object.assign({}, opts), { repeat }));
+        }
+        else {
+            encodedOpts = pack(opts);
+        }
+        let result;
+        if (parentKeyOpts.addToWaitingChildren) {
+            result = await this.addParentJob(client, job, encodedOpts, args);
+        }
+        else if (typeof opts.delay == 'number' && opts.delay > 0) {
+            result = await this.addDelayedJob(client, job, encodedOpts, args);
+        }
+        else if (opts.priority) {
+            result = await this.addPrioritizedJob(client, job, encodedOpts, args);
+        }
+        else {
+            result = await this.addStandardJob(client, job, encodedOpts, args);
+        }
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                parentKey: parentKeyOpts.parentKey,
+                command: 'addJob',
+            });
+        }
+        return result;
+    }
+    pauseArgs(pause) {
+        let src = 'wait', dst = 'paused';
+        if (!pause) {
+            src = 'paused';
+            dst = 'wait';
+        }
+        const keys = [src, dst, 'meta', 'prioritized'].map((name) => this.queue.toKey(name));
+        keys.push(this.queue.keys.events, this.queue.keys.delayed, this.queue.keys.marker);
+        const args = [pause ? 'paused' : 'resumed'];
+        return keys.concat(args);
+    }
+    async pause(pause) {
+        const client = await this.queue.client;
+        const args = this.pauseArgs(pause);
+        return this.execCommand(client, 'pause', args);
+    }
+    addRepeatableJobArgs(customKey, nextMillis, opts, legacyCustomKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+        ];
+        const args = [
+            nextMillis,
+            pack(opts),
+            legacyCustomKey,
+            customKey,
+            queueKeys[''],
+        ];
+        return keys.concat(args);
+    }
+    /**
+     * Adds (or updates) a repeatable job entry in the repeat zset and stores
+     * its repeat options under the corresponding repeat hash. If a previous
+     * delayed iteration for this repeat key exists, it is cleaned up so the
+     * next iteration can be scheduled separately when the job is created.
+     *
+     * @param customKey - The current repeat key identifying this repeatable job.
+     * @param nextMillis - The timestamp (ms since epoch) for the next run.
+     * @param opts - Repeatable options (cron/every pattern, tz, limit, etc.).
+     * @param legacyCustomKey - The previous/legacy repeat key, used for migration and cleanup.
+     * @returns The repeatable job key that was stored (either `customKey` or,
+     * for backwards-compatible entries, `legacyCustomKey`). The actual delayed
+     * iteration is scheduled later when the job for `nextMillis` is created.
+     *
+     * @private
+     */
+    async addRepeatableJob(customKey, nextMillis, opts, legacyCustomKey) {
+        const client = await this.queue.client;
+        const args = this.addRepeatableJobArgs(customKey, nextMillis, opts, legacyCustomKey);
+        return this.execCommand(client, 'addRepeatableJob', args);
+    }
+    /**
+     * Removes a deduplication key from Redis so that a new job with the same
+     * deduplication id can be enqueued again. The key is only removed if it
+     * currently maps to the provided `jobId`, preventing races between
+     * producers and finishing jobs.
+     *
+     * @param deduplicationId - The deduplication id whose key should be cleared.
+     * @param jobId - The id of the job that currently owns the dedup key.
+     * @returns `1` if the key was removed, `0` otherwise.
+     *
+     * @private
+     */
+    async removeDeduplicationKey(deduplicationId, jobId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [`${queueKeys.de}:${deduplicationId}`];
+        const args = [jobId];
+        return this.execCommand(client, 'removeDeduplicationKey', keys.concat(args));
+    }
+    /**
+     * Registers a job scheduler and enqueues its next delayed iteration.
+     * The scheduler stores the template data/options so subsequent iterations
+     * can be produced automatically based on the repeat options.
+     *
+     * @param jobSchedulerId - The id that uniquely identifies this scheduler.
+     * @param nextMillis - Timestamp (ms since epoch) for the next iteration.
+     * @param templateData - Serialized template data reused for every iteration.
+     * @param templateOpts - Redis-encoded job options applied to every iteration.
+     * @param opts - Repeat options describing the scheduling pattern.
+     * @param delayedJobOpts - Options applied to the next delayed job that is produced.
+     * @param producerId - Optional id of the job that produced this iteration, used to prevent duplicates.
+     * @returns A tuple of `[jobId, delay]`, where `delay` is the computed delay in milliseconds
+     * for the next iteration. When `delay` is `0`, the job is enqueued immediately.
+     * @throws An error resolved from `finishedErrors` when the Lua script returns a negative status code.
+     *
+     * @private
+     */
+    async addJobScheduler(jobSchedulerId, nextMillis, templateData, templateOpts, opts, delayedJobOpts, 
+    // The job id of the job that produced this next iteration
+    producerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.prioritized,
+            queueKeys.marker,
+            queueKeys.id,
+            queueKeys.events,
+            queueKeys.pc,
+            queueKeys.active,
+        ];
+        const args = [
+            nextMillis,
+            pack(opts),
+            jobSchedulerId,
+            templateData,
+            pack(templateOpts),
+            pack(delayedJobOpts),
+            Date.now(),
+            queueKeys[''],
+            producerId ? this.queue.toKey(producerId) : '',
+        ];
+        const result = await this.execCommand(client, 'addJobScheduler', keys.concat(args));
+        if (typeof result === 'number' && result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                command: 'addJobScheduler',
+            });
+        }
+        return result;
+    }
+    async updateRepeatableJobMillis(client, customKey, nextMillis, legacyCustomKey) {
+        const args = [
+            this.queue.keys.repeat,
+            nextMillis,
+            customKey,
+            legacyCustomKey,
+        ];
+        return this.execCommand(client, 'updateRepeatableJobMillis', args);
+    }
+    async updateJobSchedulerNextMillis(jobSchedulerId, nextMillis, templateData, delayedJobOpts, 
+    // The job id of the job that produced this next iteration - TODO: remove in next breaking change
+    producerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.prioritized,
+            queueKeys.marker,
+            queueKeys.id,
+            queueKeys.events,
+            queueKeys.pc,
+            producerId ? this.queue.toKey(producerId) : '',
+            queueKeys.active,
+        ];
+        const args = [
+            nextMillis,
+            jobSchedulerId,
+            templateData,
+            pack(delayedJobOpts),
+            Date.now(),
+            queueKeys[''],
+            producerId,
+        ];
+        return this.execCommand(client, 'updateJobScheduler', keys.concat(args));
+    }
+    removeRepeatableArgs(legacyRepeatJobId, repeatConcatOptions, repeatJobKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.repeat, queueKeys.delayed, queueKeys.events];
+        const args = [
+            legacyRepeatJobId,
+            this.getRepeatConcatOptions(repeatConcatOptions, repeatJobKey),
+            repeatJobKey,
+            queueKeys[''],
+        ];
+        return keys.concat(args);
+    }
+    // TODO: remove this check in next breaking change
+    getRepeatConcatOptions(repeatConcatOptions, repeatJobKey) {
+        if (repeatJobKey && repeatJobKey.split(':').length > 2) {
+            return repeatJobKey;
+        }
+        return repeatConcatOptions;
+    }
+    async removeRepeatable(legacyRepeatJobId, repeatConcatOptions, repeatJobKey) {
+        const client = await this.queue.client;
+        const args = this.removeRepeatableArgs(legacyRepeatJobId, repeatConcatOptions, repeatJobKey);
+        return this.execCommand(client, 'removeRepeatable', args);
+    }
+    async removeJobScheduler(jobSchedulerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.repeat, queueKeys.delayed, queueKeys.events];
+        const args = [jobSchedulerId, queueKeys['']];
+        return this.execCommand(client, 'removeJobScheduler', keys.concat(args));
+    }
+    removeArgs(jobId, removeChildren) {
+        const keys = [jobId, 'repeat'].map(name => this.queue.toKey(name));
+        const args = [jobId, removeChildren ? 1 : 0, this.queue.toKey('')];
+        return keys.concat(args);
+    }
+    async remove(jobId, removeChildren) {
+        const client = await this.queue.client;
+        const args = this.removeArgs(jobId, removeChildren);
+        const result = await this.execCommand(client, 'removeJob', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'removeJob',
+            });
+        }
+        return result;
+    }
+    async removeUnprocessedChildren(jobId) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.toKey(jobId),
+            this.queue.keys.meta,
+            this.queue.toKey(''),
+            jobId,
+        ];
+        await this.execCommand(client, 'removeUnprocessedChildren', args);
+    }
+    async extendLock(jobId, token, duration, client) {
+        client = client || (await this.queue.client);
+        const args = [
+            this.queue.toKey(jobId) + ':lock',
+            this.queue.keys.stalled,
+            token,
+            duration,
+            jobId,
+        ];
+        return this.execCommand(client, 'extendLock', args);
+    }
+    async extendLocks(jobIds, tokens, duration) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.keys.stalled,
+            this.queue.toKey(''),
+            pack(tokens),
+            pack(jobIds),
+            duration,
+        ];
+        return this.execCommand(client, 'extendLocks', args);
+    }
+    async updateData(job, data) {
+        const client = await this.queue.client;
+        const keys = [this.queue.toKey(job.id)];
+        const dataJson = JSON.stringify(data);
+        const result = await this.execCommand(client, 'updateData', keys.concat([dataJson]));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId: job.id,
+                command: 'updateData',
+            });
+        }
+    }
+    async updateProgress(jobId, progress) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(jobId),
+            this.queue.keys.events,
+            this.queue.keys.meta,
+        ];
+        const progressJson = JSON.stringify(progress);
+        const result = await this.execCommand(client, 'updateProgress', keys.concat([jobId, progressJson]));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'updateProgress',
+            });
+        }
+    }
+    async addLog(jobId, logRow, keepLogs) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(jobId),
+            this.queue.toKey(jobId) + ':logs',
+        ];
+        const result = await this.execCommand(client, 'addLog', keys.concat([jobId, logRow, keepLogs ? keepLogs : '']));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'addLog',
+            });
+        }
+        return result;
+    }
+    moveToFinishedArgs(job, val, propVal, shouldRemove, target, token, timestamp, fetchNext = true, fieldsToUpdate) {
+        var _a, _b, _c, _d, _e, _f, _g;
+        const queueKeys = this.queue.keys;
+        const opts = this.queue.opts;
+        const workerKeepJobs = target === 'completed' ? opts.removeOnComplete : opts.removeOnFail;
+        const metricsKey = this.queue.toKey(`metrics:${target}`);
+        const keys = this.moveToFinishedKeys;
+        keys[10] = queueKeys[target];
+        keys[11] = this.queue.toKey((_a = job.id) !== null && _a !== void 0 ? _a : '');
+        keys[12] = metricsKey;
+        keys[13] = this.queue.keys.marker;
+        const keepJobs = this.getKeepJobs(shouldRemove, workerKeepJobs);
+        const args = [
+            job.id,
+            timestamp,
+            propVal,
+            typeof val === 'undefined' ? 'null' : val,
+            target,
+            !fetchNext || this.queue.closing ? 0 : 1,
+            queueKeys[''],
+            pack({
+                token,
+                name: opts.name,
+                keepJobs,
+                limiter: opts.limiter,
+                lockDuration: opts.lockDuration,
+                attempts: job.opts.attempts,
+                maxMetricsSize: ((_b = opts.metrics) === null || _b === void 0 ? void 0 : _b.maxDataPoints)
+                    ? (_c = opts.metrics) === null || _c === void 0 ? void 0 : _c.maxDataPoints
+                    : '',
+                fpof: !!((_d = job.opts) === null || _d === void 0 ? void 0 : _d.failParentOnFailure),
+                cpof: !!((_e = job.opts) === null || _e === void 0 ? void 0 : _e.continueParentOnFailure),
+                idof: !!((_f = job.opts) === null || _f === void 0 ? void 0 : _f.ignoreDependencyOnFailure),
+                rdof: !!((_g = job.opts) === null || _g === void 0 ? void 0 : _g.removeDependencyOnFailure),
+            }),
+            fieldsToUpdate ? pack((0, utils_1.objectToFlatArray)(fieldsToUpdate)) : void 0,
+        ];
+        return keys.concat(args);
+    }
+    getKeepJobs(shouldRemove, workerKeepJobs) {
+        if (typeof shouldRemove === 'undefined') {
+            return workerKeepJobs || { count: shouldRemove ? 0 : -1 };
+        }
+        return typeof shouldRemove === 'object'
+            ? shouldRemove
+            : typeof shouldRemove === 'number'
+                ? { count: shouldRemove }
+                : { count: shouldRemove ? 0 : -1 };
+    }
+    async moveToFinished(jobId, args) {
+        const client = await this.queue.client;
+        const result = await this.execCommand(client, 'moveToFinished', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveToFinished',
+                state: 'active',
+            });
+        }
+        else {
+            if (typeof result !== 'undefined') {
+                return raw2NextJobData(result);
+            }
+        }
+    }
+    drainArgs(delayed) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.delayed,
+            queueKeys.prioritized,
+            queueKeys.repeat,
+        ];
+        const args = [queueKeys[''], delayed ? '1' : '0'];
+        return keys.concat(args);
+    }
+    async drain(delayed) {
+        const client = await this.queue.client;
+        const args = this.drainArgs(delayed);
+        return this.execCommand(client, 'drain', args);
+    }
+    removeChildDependencyArgs(jobId, parentKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys['']];
+        const args = [this.queue.toKey(jobId), parentKey];
+        return keys.concat(args);
+    }
+    async removeChildDependency(jobId, parentKey) {
+        const client = await this.queue.client;
+        const args = this.removeChildDependencyArgs(jobId, parentKey);
+        const result = await this.execCommand(client, 'removeChildDependency', args);
+        switch (result) {
+            case 0:
+                return true;
+            case 1:
+                return false;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId,
+                    parentKey,
+                    command: 'removeChildDependency',
+                });
+        }
+    }
+    getRangesArgs(types, start, end, asc) {
+        const queueKeys = this.queue.keys;
+        const transformedTypes = types.map(type => {
+            return type === 'waiting' ? 'wait' : type;
+        });
+        const keys = [queueKeys['']];
+        const args = [start, end, asc ? '1' : '0', ...transformedTypes];
+        return keys.concat(args);
+    }
+    async getRanges(types, start = 0, end = 1, asc = false) {
+        const client = await this.queue.client;
+        const args = this.getRangesArgs(types, start, end, asc);
+        return await this.execCommand(client, 'getRanges', args);
+    }
+    getCountsArgs(types) {
+        const queueKeys = this.queue.keys;
+        const transformedTypes = types.map(type => {
+            return type === 'waiting' ? 'wait' : type;
+        });
+        const keys = [queueKeys['']];
+        const args = [...transformedTypes];
+        return keys.concat(args);
+    }
+    async getCounts(types) {
+        const client = await this.queue.client;
+        const args = this.getCountsArgs(types);
+        return await this.execCommand(client, 'getCounts', args);
+    }
+    getCountsPerPriorityArgs(priorities) {
+        const keys = [
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+        ];
+        const args = priorities;
+        return keys.concat(args);
+    }
+    async getCountsPerPriority(priorities) {
+        const client = await this.queue.client;
+        const args = this.getCountsPerPriorityArgs(priorities);
+        return await this.execCommand(client, 'getCountsPerPriority', args);
+    }
+    getDependencyCountsArgs(jobId, types) {
+        const keys = [
+            `${jobId}:processed`,
+            `${jobId}:dependencies`,
+            `${jobId}:failed`,
+            `${jobId}:unsuccessful`,
+        ].map(name => {
+            return this.queue.toKey(name);
+        });
+        const args = types;
+        return keys.concat(args);
+    }
+    async getDependencyCounts(jobId, types) {
+        const client = await this.queue.client;
+        const args = this.getDependencyCountsArgs(jobId, types);
+        return await this.execCommand(client, 'getDependencyCounts', args);
+    }
+    moveToCompletedArgs(job, returnvalue, removeOnComplete, token, fetchNext = false) {
+        const timestamp = Date.now();
+        return this.moveToFinishedArgs(job, returnvalue, 'returnvalue', removeOnComplete, 'completed', token, timestamp, fetchNext);
+    }
+    moveToFailedArgs(job, failedReason, removeOnFailed, token, fetchNext = false, fieldsToUpdate) {
+        const timestamp = Date.now();
+        return this.moveToFinishedArgs(job, failedReason, 'failedReason', removeOnFailed, 'failed', token, timestamp, fetchNext, fieldsToUpdate);
+    }
+    async isFinished(jobId, returnValue = false) {
+        const client = await this.queue.client;
+        const keys = ['completed', 'failed', jobId].map((key) => {
+            return this.queue.toKey(key);
+        });
+        return this.execCommand(client, 'isFinished', keys.concat([jobId, returnValue ? '1' : '']));
+    }
+    async getState(jobId) {
+        const client = await this.queue.client;
+        const keys = [
+            'completed',
+            'failed',
+            'delayed',
+            'active',
+            'wait',
+            'paused',
+            'waiting-children',
+            'prioritized',
+        ].map((key) => {
+            return this.queue.toKey(key);
+        });
+        if ((0, utils_1.isRedisVersionLowerThan)(this.queue.redisVersion, '6.0.6', this.queue.databaseType)) {
+            return this.execCommand(client, 'getState', keys.concat([jobId]));
+        }
+        return this.execCommand(client, 'getStateV2', keys.concat([jobId]));
+    }
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param jobId - the ID of the job to change the delay for.
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns delay in milliseconds.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    async changeDelay(jobId, delay) {
+        const client = await this.queue.client;
+        const args = this.changeDelayArgs(jobId, delay);
+        const result = await this.execCommand(client, 'changeDelay', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'changeDelay',
+                state: 'delayed',
+            });
+        }
+    }
+    changeDelayArgs(jobId, delay) {
+        const timestamp = Date.now();
+        const keys = [
+            this.queue.keys.delayed,
+            this.queue.keys.meta,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        return keys.concat([
+            delay,
+            JSON.stringify(timestamp),
+            jobId,
+            this.queue.toKey(jobId),
+        ]);
+    }
+    async changePriority(jobId, priority = 0, lifo = false) {
+        const client = await this.queue.client;
+        const args = this.changePriorityArgs(jobId, priority, lifo);
+        const result = await this.execCommand(client, 'changePriority', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'changePriority',
+            });
+        }
+    }
+    changePriorityArgs(jobId, priority = 0, lifo = false) {
+        const keys = [
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+            this.queue.keys.active,
+            this.queue.keys.pc,
+            this.queue.keys.marker,
+        ];
+        return keys.concat([priority, this.queue.toKey(''), jobId, lifo ? 1 : 0]);
+    }
+    moveToDelayedArgs(jobId, timestamp, token, delay, opts = {}) {
+        const queueKeys = this.queue.keys;
+        const workerOpts = this.queue.opts;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.delayed,
+            this.queue.toKey(jobId),
+            queueKeys.events,
+            queueKeys.meta,
+            queueKeys.stalled,
+            queueKeys.wait,
+            queueKeys.limiter,
+            queueKeys.paused,
+            queueKeys.pc,
+        ];
+        const fetchNext = opts.fetchNext && !this.queue.closing ? 1 : 0;
+        return keys.concat([
+            this.queue.keys[''],
+            timestamp,
+            jobId,
+            token,
+            delay,
+            opts.skipAttempt ? '1' : '0',
+            opts.fieldsToUpdate
+                ? pack((0, utils_1.objectToFlatArray)(opts.fieldsToUpdate))
+                : void 0,
+            fetchNext,
+            fetchNext
+                ? pack({
+                    token,
+                    lockDuration: workerOpts.lockDuration,
+                    limiter: workerOpts.limiter,
+                    name: workerOpts.name,
+                })
+                : void 0,
+        ]);
+    }
+    moveToWaitingChildrenArgs(jobId, token, opts) {
+        const timestamp = Date.now();
+        const childKey = (0, utils_1.getParentKey)(opts.child);
+        const keys = [
+            'active',
+            'waiting-children',
+            jobId,
+            `${jobId}:dependencies`,
+            `${jobId}:unsuccessful`,
+            'stalled',
+            'events',
+        ].map(name => {
+            return this.queue.toKey(name);
+        });
+        return keys.concat([
+            token,
+            childKey !== null && childKey !== void 0 ? childKey : '',
+            JSON.stringify(timestamp),
+            jobId,
+            this.queue.toKey(''),
+        ]);
+    }
+    isMaxedArgs() {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.meta, queueKeys.active];
+        return keys;
+    }
+    async isMaxed() {
+        const client = await this.queue.client;
+        const args = this.isMaxedArgs();
+        return !!(await this.execCommand(client, 'isMaxed', args));
+    }
+    async moveToDelayed(jobId, timestamp, delay, token = '0', opts = {}) {
+        const client = await this.queue.client;
+        const args = this.moveToDelayedArgs(jobId, timestamp, token, delay, opts);
+        const result = await this.execCommand(client, 'moveToDelayed', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveToDelayed',
+                state: 'active',
+            });
+        }
+        else if (typeof result !== 'undefined') {
+            return raw2NextJobData(result);
+        }
+    }
+    /**
+     * Move parent job to waiting-children state.
+     *
+     * @returns true if job is successfully moved, false if there are pending dependencies.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobLockNotExist
+     * This exception is thrown if job lock is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in active state.
+     */
+    async moveToWaitingChildren(jobId, token, opts = {}) {
+        const client = await this.queue.client;
+        const args = this.moveToWaitingChildrenArgs(jobId, token, opts);
+        const result = await this.execCommand(client, 'moveToWaitingChildren', args);
+        switch (result) {
+            case 0:
+                return true;
+            case 1:
+                return false;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId,
+                    command: 'moveToWaitingChildren',
+                    state: 'active',
+                });
+        }
+    }
+    getRateLimitTtlArgs(maxJobs) {
+        const keys = [
+            this.queue.keys.limiter,
+            this.queue.keys.meta,
+        ];
+        return keys.concat([maxJobs !== null && maxJobs !== void 0 ? maxJobs : '0']);
+    }
+    async getRateLimitTtl(maxJobs) {
+        const client = await this.queue.client;
+        const args = this.getRateLimitTtlArgs(maxJobs);
+        return this.execCommand(client, 'getRateLimitTtl', args);
+    }
+    /**
+     * Remove jobs in a specific state.
+     *
+     * @returns Id jobs from the deleted records.
+     */
+    async cleanJobsInSet(set, timestamp, limit = 0) {
+        const client = await this.queue.client;
+        return this.execCommand(client, 'cleanJobsInSet', [
+            this.queue.toKey(set),
+            this.queue.toKey('events'),
+            this.queue.toKey('repeat'),
+            this.queue.toKey(''),
+            timestamp,
+            limit,
+            set,
+        ]);
+    }
+    getJobSchedulerArgs(id) {
+        const keys = [this.queue.keys.repeat];
+        return keys.concat([id]);
+    }
+    async getJobScheduler(id) {
+        const client = await this.queue.client;
+        const args = this.getJobSchedulerArgs(id);
+        return this.execCommand(client, 'getJobScheduler', args);
+    }
+    retryJobArgs(jobId, lifo, token, opts = {}) {
+        const keys = [
+            this.queue.keys.active,
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.toKey(jobId),
+            this.queue.keys.meta,
+            this.queue.keys.events,
+            this.queue.keys.delayed,
+            this.queue.keys.prioritized,
+            this.queue.keys.pc,
+            this.queue.keys.marker,
+            this.queue.keys.stalled,
+        ];
+        const pushCmd = (lifo ? 'R' : 'L') + 'PUSH';
+        return keys.concat([
+            this.queue.toKey(''),
+            Date.now(),
+            pushCmd,
+            jobId,
+            token,
+            opts.fieldsToUpdate
+                ? pack((0, utils_1.objectToFlatArray)(opts.fieldsToUpdate))
+                : void 0,
+        ]);
+    }
+    async retryJob(jobId, lifo, token = '0', opts = {}) {
+        const client = await this.queue.client;
+        const args = this.retryJobArgs(jobId, lifo, token, opts);
+        const result = await this.execCommand(client, 'retryJob', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'retryJob',
+                state: 'active',
+            });
+        }
+    }
+    moveJobsToWaitArgs(state, count, timestamp) {
+        const keys = [
+            this.queue.toKey(''),
+            this.queue.keys.events,
+            this.queue.toKey(state),
+            this.queue.toKey('wait'),
+            this.queue.toKey('paused'),
+            this.queue.keys.meta,
+            this.queue.keys.active,
+            this.queue.keys.marker,
+        ];
+        const args = [count, timestamp, state];
+        return keys.concat(args);
+    }
+    async retryJobs(state = 'failed', count = 1000, timestamp = new Date().getTime()) {
+        const client = await this.queue.client;
+        const args = this.moveJobsToWaitArgs(state, count, timestamp);
+        return this.execCommand(client, 'moveJobsToWait', args);
+    }
+    async promoteJobs(count = 1000) {
+        const client = await this.queue.client;
+        const args = this.moveJobsToWaitArgs('delayed', count, Number.MAX_VALUE);
+        return this.execCommand(client, 'moveJobsToWait', args);
+    }
+    /**
+     * Attempts to reprocess a job
+     *
+     * @param job - The job to reprocess
+     * @param state - The expected job state. If the job is not found
+     * on the provided state, then it's not reprocessed. Supported states: 'failed', 'completed'
+     *
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * @throws Will throw an error with a code property indicating the failure reason:
+     *   - code 0: Job does not exist
+     *   - code -1: Job is currently locked and can't be retried
+     *   - code -2: Job was not found in the expected set
+     */
+    async reprocessJob(job, state, opts = {}) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(job.id),
+            this.queue.keys.events,
+            this.queue.toKey(state),
+            this.queue.keys.wait,
+            this.queue.keys.meta,
+            this.queue.keys.paused,
+            this.queue.keys.active,
+            this.queue.keys.marker,
+        ];
+        const args = [
+            job.id,
+            (job.opts.lifo ? 'R' : 'L') + 'PUSH',
+            state === 'failed' ? 'failedReason' : 'returnvalue',
+            state,
+            opts.resetAttemptsMade ? '1' : '0',
+            opts.resetAttemptsStarted ? '1' : '0',
+        ];
+        const result = await this.execCommand(client, 'reprocessJob', keys.concat(args));
+        switch (result) {
+            case 1:
+                return;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId: job.id,
+                    command: 'reprocessJob',
+                    state,
+                });
+        }
+    }
+    async getMetrics(type, start = 0, end = -1) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(`metrics:${type}`),
+            this.queue.toKey(`metrics:${type}:data`),
+        ];
+        const args = [start, end];
+        const result = await this.execCommand(client, 'getMetrics', keys.concat(args));
+        return result;
+    }
+    async moveToActive(client, token, name) {
+        const opts = this.queue.opts;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.events,
+            queueKeys.stalled,
+            queueKeys.limiter,
+            queueKeys.delayed,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.pc,
+            queueKeys.marker,
+        ];
+        const args = [
+            queueKeys[''],
+            Date.now(),
+            pack({
+                token,
+                lockDuration: opts.lockDuration,
+                limiter: opts.limiter,
+                name,
+            }),
+        ];
+        const result = await this.execCommand(client, 'moveToActive', keys.concat(args));
+        return raw2NextJobData(result);
+    }
+    async promote(jobId) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.delayed,
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+            this.queue.keys.active,
+            this.queue.keys.pc,
+            this.queue.keys.events,
+            this.queue.keys.marker,
+        ];
+        const args = [this.queue.toKey(''), jobId];
+        const code = await this.execCommand(client, 'promote', keys.concat(args));
+        if (code < 0) {
+            throw this.finishedErrors({
+                code,
+                jobId,
+                command: 'promote',
+                state: 'delayed',
+            });
+        }
+    }
+    moveStalledJobsToWaitArgs() {
+        const opts = this.queue.opts;
+        const keys = [
+            this.queue.keys.stalled,
+            this.queue.keys.wait,
+            this.queue.keys.active,
+            this.queue.keys['stalled-check'],
+            this.queue.keys.meta,
+            this.queue.keys.paused,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        const args = [
+            opts.maxStalledCount,
+            this.queue.toKey(''),
+            Date.now(),
+            opts.stalledInterval,
+        ];
+        return keys.concat(args);
+    }
+    /**
+     * Looks for unlocked jobs in the active queue.
+     *
+     * The job was being worked on, but the worker process died and it failed to renew the lock.
+     * We call these jobs 'stalled'. This is the most common case. We resolve these by moving them
+     * back to wait to be re-processed. To prevent jobs from cycling endlessly between active and wait,
+     * (e.g. if the job handler keeps crashing),
+     * we limit the number stalled job recoveries to settings.maxStalledCount.
+     */
+    async moveStalledJobsToWait() {
+        const client = await this.queue.client;
+        const args = this.moveStalledJobsToWaitArgs();
+        return this.execCommand(client, 'moveStalledJobsToWait', args);
+    }
+    /**
+     * Moves a job back from Active to Wait.
+     * This script is used when a job has been manually rate limited and needs
+     * to be moved back to wait from active status.
+     *
+     * @param client - Redis client
+     * @param jobId - Job id
+     * @returns
+     */
+    async moveJobFromActiveToWait(jobId, token = '0') {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.active,
+            this.queue.keys.wait,
+            this.queue.keys.stalled,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.limiter,
+            this.queue.keys.prioritized,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        const args = [jobId, token, this.queue.toKey(jobId)];
+        const result = await this.execCommand(client, 'moveJobFromActiveToWait', keys.concat(args));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveJobFromActiveToWait',
+                state: 'active',
+            });
+        }
+        return result;
+    }
+    async obliterate(opts) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.meta,
+            this.queue.toKey(''),
+        ];
+        const args = [opts.count, opts.force ? 'force' : null];
+        const result = await this.execCommand(client, 'obliterate', keys.concat(args));
+        if (result < 0) {
+            switch (result) {
+                case -1:
+                    throw new Error('Cannot obliterate non-paused queue');
+                case -2:
+                    throw new Error('Cannot obliterate queue with active jobs');
+            }
+        }
+        return result;
+    }
+    /**
+     * Paginate a set or hash keys.
+     * @param opts - options to define the pagination behaviour
+     *
+     */
+    async paginate(key, opts) {
+        const client = await this.queue.client;
+        const keys = [key];
+        const maxIterations = 5;
+        const pageSize = opts.end >= 0 ? opts.end - opts.start + 1 : Infinity;
+        let cursor = '0', offset = 0, items, total, rawJobs, page = [], jobs = [];
+        do {
+            const args = [
+                opts.start + page.length,
+                opts.end,
+                cursor,
+                offset,
+                maxIterations,
+            ];
+            if (opts.fetchJobs) {
+                args.push(1);
+            }
+            [cursor, offset, items, total, rawJobs] = await this.execCommand(client, 'paginate', keys.concat(args));
+            page = page.concat(items);
+            if (rawJobs && rawJobs.length) {
+                jobs = jobs.concat(rawJobs.map(utils_1.array2obj));
+            }
+            // Important to keep this coercive inequality (!=) instead of strict inequality (!==)
+        } while (cursor != '0' && page.length < pageSize);
+        // If we get an array of arrays, it means we are paginating a hash
+        if (page.length && Array.isArray(page[0])) {
+            const result = [];
+            for (let index = 0; index < page.length; index++) {
+                const [id, value] = page[index];
+                try {
+                    result.push({ id, v: JSON.parse(value) });
+                }
+                catch (err) {
+                    result.push({ id, err: err.message });
+                }
+            }
+            return {
+                cursor,
+                items: result,
+                total,
+                jobs,
+            };
+        }
+        else {
+            return {
+                cursor,
+                items: page.map(item => ({ id: item })),
+                total,
+                jobs,
+            };
+        }
+    }
+    finishedErrors({ code, jobId, parentKey, command, state, }) {
+        let error;
+        switch (code) {
+            case enums_1.ErrorCode.JobNotExist:
+                error = new Error(`Missing key for job ${jobId}. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobLockNotExist:
+                error = new Error(`Missing lock for job ${jobId}. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobNotInState:
+                error = new Error(`Job ${jobId} is not in the ${state} state. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobPendingChildren:
+                error = new Error(`Job ${jobId} has pending dependencies. ${command}`);
+                break;
+            case enums_1.ErrorCode.ParentJobNotExist:
+                error = new Error(`Missing key for parent job ${parentKey}. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobLockMismatch:
+                error = new Error(`Lock mismatch for job ${jobId}. Cmd ${command} from ${state}`);
+                break;
+            case enums_1.ErrorCode.ParentJobCannotBeReplaced:
+                error = new Error(`The parent job ${parentKey} cannot be replaced. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobBelongsToJobScheduler:
+                error = new Error(`Job ${jobId} belongs to a job scheduler and cannot be removed directly. ${command}`);
+                break;
+            case enums_1.ErrorCode.JobHasFailedChildren:
+                error = new errors_1.UnrecoverableError(`Cannot complete job ${jobId} because it has at least one failed child. ${command}`);
+                break;
+            case enums_1.ErrorCode.SchedulerJobIdCollision:
+                error = new Error(`Cannot create job scheduler iteration - job ID already exists. ${command}`);
+                break;
+            case enums_1.ErrorCode.SchedulerJobSlotsBusy:
+                error = new Error(`Cannot create job scheduler iteration - current and next time slots already have jobs. ${command}`);
+                break;
+            default:
+                error = new Error(`Unknown code ${code} error for ${jobId}. ${command}`);
+        }
+        // Add the code property to the error object
+        error.code = code;
+        return error;
+    }
+    async removeOrphanedJobs(candidateJobIds, stateKeySuffixes, jobSubKeySuffixes) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.toKey(''),
+            stateKeySuffixes.length,
+            ...stateKeySuffixes,
+            jobSubKeySuffixes.length,
+            ...jobSubKeySuffixes,
+            ...candidateJobIds,
+        ];
+        return this.execCommand(client, 'removeOrphanedJobs', args);
+    }
+}
+exports.Scripts = Scripts;
+function raw2NextJobData(raw) {
+    if (raw) {
+        const result = [null, raw[1], raw[2], raw[3]];
+        if (raw[0]) {
+            result[0] = (0, utils_1.array2obj)(raw[0]);
+        }
+        return result;
+    }
+    return [];
+}
diff --git a/node_modules/bullmq/dist/cjs/classes/worker.js b/node_modules/bullmq/dist/cjs/classes/worker.js
new file mode 100644
index 0000000..00eb02e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/classes/worker.js
@@ -0,0 +1,918 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Worker = void 0;
+const fs = require("fs");
+const url_1 = require("url");
+const path = require("path");
+const abort_controller_1 = require("./abort-controller");
+const utils_1 = require("../utils");
+const queue_base_1 = require("./queue-base");
+const repeat_1 = require("./repeat");
+const child_pool_1 = require("./child-pool");
+const redis_connection_1 = require("./redis-connection");
+const ioredis_client_1 = require("./ioredis-client");
+const sandbox_1 = require("./sandbox");
+const async_fifo_queue_1 = require("./async-fifo-queue");
+const errors_1 = require("./errors");
+const enums_1 = require("../enums");
+const job_scheduler_1 = require("./job-scheduler");
+const lock_manager_1 = require("./lock-manager");
+// 10 seconds is the maximum time a BZPOPMIN can block.
+const maximumBlockTimeout = 10;
+/**
+ *
+ * This class represents a worker that is able to process jobs from the queue.
+ * As soon as the class is instantiated and a connection to Redis is established
+ * it will start processing jobs.
+ *
+ */
+class Worker extends queue_base_1.QueueBase {
+    static RateLimitError() {
+        return new errors_1.RateLimitError();
+    }
+    constructor(name, processor, opts, Connection) {
+        super(name, Object.assign(Object.assign({ drainDelay: 5, concurrency: 1, lockDuration: 30000, maximumRateLimitDelay: 30000, maxStalledCount: 1, stalledInterval: 30000, autorun: true, runRetryDelay: 15000 }, opts), { blockingConnection: true }), Connection);
+        this.abortDelayController = null;
+        this.blockUntil = 0;
+        this.drained = false;
+        this.limitUntil = 0;
+        this.processorAcceptsSignal = false;
+        this.stalledCheckerRunning = false;
+        this.waiting = null;
+        this.running = false;
+        this.mainLoopRunning = null;
+        if (!opts || !opts.connection) {
+            throw new Error('Worker requires a connection');
+        }
+        if (typeof this.opts.maxStalledCount !== 'number' ||
+            this.opts.maxStalledCount < 0) {
+            throw new Error('maxStalledCount must be greater or equal than 0');
+        }
+        if (typeof this.opts.maxStartedAttempts === 'number' &&
+            this.opts.maxStartedAttempts < 0) {
+            throw new Error('maxStartedAttempts must be greater or equal than 0');
+        }
+        if (typeof this.opts.stalledInterval !== 'number' ||
+            this.opts.stalledInterval <= 0) {
+            throw new Error('stalledInterval must be greater than 0');
+        }
+        if (typeof this.opts.drainDelay !== 'number' || this.opts.drainDelay <= 0) {
+            throw new Error('drainDelay must be greater than 0');
+        }
+        this.concurrency = this.opts.concurrency;
+        this.opts.lockRenewTime =
+            this.opts.lockRenewTime || this.opts.lockDuration / 2;
+        this.id = (0, utils_1.randomUUID)();
+        this.createLockManager();
+        if (processor) {
+            if (typeof processor === 'function') {
+                this.processFn = processor;
+                // Check if processor accepts signal parameter (3rd parameter)
+                this.processorAcceptsSignal = processor.length >= 3;
+            }
+            else {
+                // SANDBOXED
+                if (processor instanceof url_1.URL) {
+                    if (!fs.existsSync(processor)) {
+                        throw new Error(`URL ${processor} does not exist in the local file system`);
+                    }
+                    processor = processor.href;
+                }
+                else {
+                    const supportedFileTypes = ['.js', '.ts', '.flow', '.cjs', '.mjs'];
+                    const processorFile = processor +
+                        (supportedFileTypes.includes(path.extname(processor)) ? '' : '.js');
+                    if (!fs.existsSync(processorFile)) {
+                        throw new Error(`File ${processorFile} does not exist`);
+                    }
+                }
+                // Separate paths so that bundling tools can resolve dependencies easier
+                const dirname = path.dirname(module.filename || __filename);
+                const workerThreadsMainFile = path.join(dirname, 'main-worker.js');
+                const spawnProcessMainFile = path.join(dirname, 'main.js');
+                let mainFilePath = this.opts.useWorkerThreads
+                    ? workerThreadsMainFile
+                    : spawnProcessMainFile;
+                try {
+                    fs.statSync(mainFilePath); // would throw if file not exists
+                }
+                catch (_) {
+                    const mainFile = this.opts.useWorkerThreads
+                        ? 'main-worker.js'
+                        : 'main.js';
+                    mainFilePath = path.join(process.cwd(), `dist/cjs/classes/${mainFile}`);
+                    fs.statSync(mainFilePath);
+                }
+                this.childPool = new child_pool_1.ChildPool({
+                    mainFile: mainFilePath,
+                    useWorkerThreads: this.opts.useWorkerThreads,
+                    workerForkOptions: this.opts.workerForkOptions,
+                    workerThreadsOptions: this.opts.workerThreadsOptions,
+                });
+                this.createSandbox(processor);
+                this.processorAcceptsSignal = true;
+            }
+            if (this.opts.autorun) {
+                this.run().catch(error => this.emit('error', error));
+            }
+        }
+        const connectionName = this.clientName() + (this.opts.name ? `:w:${this.opts.name}` : '');
+        this.blockingConnection = new redis_connection_1.RedisConnection((0, utils_1.isRedisInstance)(opts.connection)
+            ? ((0, ioredis_client_1.isIRedisClient)(opts.connection)
+                ? opts.connection
+                : (0, ioredis_client_1.createIORedisClient)(opts.connection)).duplicate({ connectionName })
+            : Object.assign(Object.assign({}, opts.connection), { connectionName }), {
+            shared: false,
+            blocking: true,
+            skipVersionCheck: opts.skipVersionCheck,
+        });
+        this.blockingConnection.on('error', error => this.emit('error', error));
+        this.blockingConnection.on('ready', () => setTimeout(() => this.emit('ready'), 0));
+    }
+    /**
+     * Creates and configures the lock manager for processing jobs.
+     * This method can be overridden in subclasses to customize lock manager behavior.
+     */
+    createLockManager() {
+        this.lockManager = new lock_manager_1.LockManager(this, {
+            lockRenewTime: this.opts.lockRenewTime,
+            lockDuration: this.opts.lockDuration,
+            workerId: this.id,
+            workerName: this.opts.name,
+        });
+    }
+    /**
+     * Creates and configures the sandbox for processing jobs.
+     * This method can be overridden in subclasses to customize sandbox behavior.
+     *
+     * @param processor - The processor file path, URL, or function to be sandboxed
+     */
+    createSandbox(processor) {
+        this.processFn = (0, sandbox_1.default)(processor, this.childPool).bind(this);
+    }
+    /**
+     * Public accessor method for LockManager to extend locks.
+     * This delegates to the protected scripts object.
+     */
+    async extendJobLocks(jobIds, tokens, duration) {
+        return this.scripts.extendLocks(jobIds, tokens, duration);
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    callProcessJob(job, token, signal) {
+        return this.processFn(job, token, signal);
+    }
+    createJob(data, jobId) {
+        return this.Job.fromJSON(this, data, jobId);
+    }
+    /**
+     *
+     * Waits until the worker is ready to start processing jobs.
+     * In general only useful when writing tests.
+     *
+     */
+    async waitUntilReady() {
+        await super.waitUntilReady();
+        return this.blockingConnection.client;
+    }
+    /**
+     * Cancels a specific job currently being processed by this worker.
+     * The job's processor function will receive an abort signal.
+     *
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId, reason) {
+        return this.lockManager.cancelJob(jobId, reason);
+    }
+    /**
+     * Cancels all jobs currently being processed by this worker.
+     * All active job processor functions will receive abort signals.
+     *
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason) {
+        this.lockManager.cancelAllJobs(reason);
+    }
+    set concurrency(concurrency) {
+        if (typeof concurrency !== 'number' ||
+            concurrency < 1 ||
+            !isFinite(concurrency)) {
+            throw new Error('concurrency must be a finite number greater than 0');
+        }
+        this._concurrency = concurrency;
+    }
+    get concurrency() {
+        return this._concurrency;
+    }
+    get repeat() {
+        return new Promise(async (resolve) => {
+            if (!this._repeat) {
+                const connection = await this.client;
+                this._repeat = new repeat_1.Repeat(this.name, Object.assign(Object.assign({}, this.opts), { connection }));
+                this._repeat.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._repeat);
+        });
+    }
+    get jobScheduler() {
+        return new Promise(async (resolve) => {
+            if (!this._jobScheduler) {
+                const connection = await this.client;
+                this._jobScheduler = new job_scheduler_1.JobScheduler(this.name, Object.assign(Object.assign({}, this.opts), { connection }));
+                this._jobScheduler.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._jobScheduler);
+        });
+    }
+    async run() {
+        if (!this.processFn) {
+            throw new Error('No process function is defined.');
+        }
+        if (this.running) {
+            throw new Error('Worker is already running.');
+        }
+        try {
+            this.running = true;
+            if (this.closing || this.paused) {
+                return;
+            }
+            await this.startStalledCheckTimer();
+            if (!this.opts.skipLockRenewal) {
+                this.lockManager.start();
+            }
+            const client = await this.client;
+            const bclient = await this.blockingConnection.client;
+            this.mainLoopRunning = this.mainLoop(client, bclient);
+            // We must await here or finally will be called too early.
+            await this.mainLoopRunning;
+        }
+        finally {
+            this.running = false;
+        }
+    }
+    async waitForRateLimit() {
+        var _a;
+        const limitUntil = this.limitUntil;
+        if (limitUntil > Date.now()) {
+            (_a = this.abortDelayController) === null || _a === void 0 ? void 0 : _a.abort();
+            this.abortDelayController = new abort_controller_1.AbortController();
+            const delay = this.getRateLimitDelay(limitUntil - Date.now());
+            await this.delay(delay, this.abortDelayController);
+            this.drained = false;
+            this.limitUntil = 0;
+        }
+    }
+    /**
+     * This is the main loop in BullMQ. Its goals are to fetch jobs from the queue
+     * as efficiently as possible, providing concurrency and minimal unnecessary calls
+     * to Redis.
+     */
+    async mainLoop(client, bclient) {
+        const asyncFifoQueue = new async_fifo_queue_1.AsyncFifoQueue();
+        let tokenPostfix = 0;
+        while ((!this.closing && !this.paused) || asyncFifoQueue.numTotal() > 0) {
+            /**
+             * This inner loop tries to fetch jobs concurrently, but if we are waiting for a job
+             * to arrive at the queue we should not try to fetch more jobs (as it would be pointless)
+             */
+            while (!this.closing &&
+                !this.paused &&
+                !this.waiting &&
+                asyncFifoQueue.numTotal() < this._concurrency &&
+                !this.isRateLimited()) {
+                const token = `${this.id}:${tokenPostfix++}`;
+                const fetchedJob = this.retryIfFailed(() => this._getNextJob(client, bclient, token, { block: true }), {
+                    delayInMs: this.opts.runRetryDelay,
+                    onlyEmitError: true,
+                });
+                asyncFifoQueue.add(fetchedJob);
+                if (this.waiting && asyncFifoQueue.numTotal() > 1) {
+                    // We are waiting for jobs but we have others that we could start processing already
+                    break;
+                }
+                // We await here so that we fetch jobs in sequence, this is important to avoid unnecessary calls
+                // to Redis in high concurrency scenarios.
+                const job = await fetchedJob;
+                // No more jobs waiting but we have others that could start processing already
+                if (!job && asyncFifoQueue.numTotal() > 1) {
+                    break;
+                }
+                // If there are potential jobs to be processed and blockUntil is set, we should exit to avoid waiting
+                // for processing this job.
+                if (this.blockUntil) {
+                    break;
+                }
+            }
+            // Since there can be undefined jobs in the queue (when a job fails or queue is empty)
+            // we iterate until we find a job.
+            let job;
+            do {
+                job = await asyncFifoQueue.fetch();
+            } while (!job && asyncFifoQueue.numQueued() > 0);
+            if (job) {
+                const token = job.token;
+                asyncFifoQueue.add(this.processJob(job, token, () => asyncFifoQueue.numTotal() <= this._concurrency));
+            }
+            else if (asyncFifoQueue.numQueued() === 0) {
+                await this.waitForRateLimit();
+            }
+        }
+    }
+    /**
+     * Returns a promise that resolves to the next job in queue.
+     * @param token - worker token to be assigned to retrieved job
+     * @returns a Job or undefined if no job was available in the queue.
+     */
+    async getNextJob(token, { block = true } = {}) {
+        var _a, _b;
+        const nextJob = await this._getNextJob(await this.client, await this.blockingConnection.client, token, { block });
+        return this.trace(enums_1.SpanKind.INTERNAL, 'getNextJob', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                [enums_1.TelemetryAttributes.QueueName]: this.name,
+                [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                [enums_1.TelemetryAttributes.WorkerOptions]: JSON.stringify({ block }),
+                [enums_1.TelemetryAttributes.JobId]: nextJob === null || nextJob === void 0 ? void 0 : nextJob.id,
+            });
+            return nextJob;
+        }, (_b = (_a = nextJob === null || nextJob === void 0 ? void 0 : nextJob.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.metadata);
+    }
+    async _getNextJob(client, bclient, token, { block = true } = {}) {
+        if (this.paused) {
+            return;
+        }
+        if (this.closing) {
+            return;
+        }
+        let job;
+        if (this.drained && block && !this.limitUntil && !this.waiting) {
+            this.waiting = this.waitForJob(bclient, this.blockUntil);
+            try {
+                this.blockUntil = await this.waiting;
+                if (this.blockUntil <= 0 || this.blockUntil - Date.now() < 1) {
+                    job = await this.moveToActive(client, token, this.opts.name);
+                }
+            }
+            finally {
+                this.waiting = null;
+            }
+        }
+        else {
+            if (!this.isRateLimited()) {
+                job = await this.moveToActive(client, token, this.opts.name);
+            }
+        }
+        if (job) {
+            this.emit('active', job, 'waiting');
+        }
+        return job;
+    }
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     * @deprecated This method is deprecated and will be removed in v6. Use queue.rateLimit method instead.
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    async rateLimit(expireTimeMs) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'rateLimit', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                [enums_1.TelemetryAttributes.WorkerRateLimit]: expireTimeMs,
+            });
+            await this.client.then(client => client.set(this.keys.limiter, Number.MAX_SAFE_INTEGER, {
+                PX: expireTimeMs,
+            }));
+        });
+    }
+    get minimumBlockTimeout() {
+        return this.blockingConnection.capabilities.canBlockFor1Ms
+            ? /* 1 millisecond is chosen because the granularity of our timestamps are milliseconds.
+      Obviously we can still process much faster than 1 job per millisecond but delays and rate limits
+      will never work with more accuracy than 1ms. */
+                0.001
+            : 0.002;
+    }
+    isRateLimited() {
+        return this.limitUntil > Date.now();
+    }
+    async moveToActive(client, token, name) {
+        const [jobData, id, rateLimitDelay, delayUntil] = await this.scripts.moveToActive(client, token, name);
+        this.updateDelays(rateLimitDelay, delayUntil);
+        return this.nextJobFromJobData(jobData, id, token);
+    }
+    async waitForJob(bclient, blockUntil) {
+        if (this.paused) {
+            return Infinity;
+        }
+        let timeout;
+        try {
+            if (!this.closing && !this.isRateLimited()) {
+                let blockTimeout = this.getBlockTimeout(blockUntil);
+                if (blockTimeout > 0) {
+                    blockTimeout = this.blockingConnection.capabilities.canDoubleTimeout
+                        ? blockTimeout
+                        : Math.ceil(blockTimeout);
+                    // We cannot trust that the blocking connection stays blocking forever
+                    // due to issues in Redis and IORedis, so we will reconnect if we
+                    // don't get a response in the expected time.
+                    timeout = setTimeout(async () => {
+                        bclient.disconnect(!this.closing);
+                    }, blockTimeout * 1000 + 1000);
+                    this.updateDelays(); // reset delays to avoid reusing same values in next iteration
+                    // Markers should only be used for un-blocking, so we will handle them in this
+                    // function only.
+                    const result = await bclient.bzpopmin(this.keys.marker, blockTimeout);
+                    if (result) {
+                        const [, member, score] = result;
+                        if (member) {
+                            const newBlockUntil = parseInt(score);
+                            // Use by pro version as rate limited groups could generate lower blockUntil values
+                            // markers only return delays for delayed jobs
+                            if (blockUntil && newBlockUntil > blockUntil) {
+                                return blockUntil;
+                            }
+                            return newBlockUntil;
+                        }
+                    }
+                }
+                return 0;
+            }
+        }
+        catch (error) {
+            if ((0, utils_1.isNotConnectionError)(error)) {
+                this.emit('error', error);
+            }
+            if (!this.closing) {
+                await this.delay();
+            }
+        }
+        finally {
+            clearTimeout(timeout);
+        }
+        return Infinity;
+    }
+    getBlockTimeout(blockUntil) {
+        const opts = this.opts;
+        // when there are delayed jobs
+        if (blockUntil) {
+            const blockDelay = blockUntil - Date.now();
+            // when we reach the time to get new jobs
+            if (blockDelay <= 0) {
+                return blockDelay;
+            }
+            else if (blockDelay < this.minimumBlockTimeout * 1000) {
+                return this.minimumBlockTimeout;
+            }
+            else {
+                // We restrict the maximum block timeout to 10 second to avoid
+                // blocking the connection for too long in the case of reconnections
+                // reference: https://github.com/taskforcesh/bullmq/issues/1658
+                return Math.min(blockDelay / 1000, maximumBlockTimeout);
+            }
+        }
+        else {
+            return Math.max(opts.drainDelay, this.minimumBlockTimeout);
+        }
+    }
+    getRateLimitDelay(delay) {
+        // We restrict the maximum limit delay to the configured maximumRateLimitDelay
+        // to be able to promote delayed jobs while the queue is rate limited
+        return Math.min(delay, this.opts.maximumRateLimitDelay);
+    }
+    /**
+     *
+     * This function is exposed only for testing purposes.
+     */
+    async delay(milliseconds, abortController) {
+        await (0, utils_1.delay)(milliseconds || utils_1.DELAY_TIME_1, abortController);
+    }
+    updateDelays(limitDelay = 0, delayUntil = 0) {
+        const clampedLimit = Math.max(limitDelay, 0);
+        if (clampedLimit > 0) {
+            this.limitUntil = Date.now() + clampedLimit;
+        }
+        else {
+            this.limitUntil = 0;
+        }
+        this.blockUntil = Math.max(delayUntil, 0) || 0;
+    }
+    async nextJobFromJobData(jobData, jobId, token) {
+        if (!jobData) {
+            if (!this.drained) {
+                this.emit('drained');
+                this.drained = true;
+            }
+        }
+        else {
+            this.drained = false;
+            const job = this.createJob(jobData, jobId);
+            job.token = token;
+            try {
+                await this.retryIfFailed(async () => {
+                    // We need to distinguish between new job schedulers and legacy
+                    // repeatable jobs. Legacy repeatable keys always contain 5+
+                    // colon segments, but a user-provided jobSchedulerId may also
+                    // contain 5+ segments, so we cannot rely on the segment count
+                    // alone (see issue #3828). When the key has 5+ segments we
+                    // probe the per-id scheduler metadata hash (`repeat:<id>` with
+                    // the `ic` field) via `JobScheduler.isJobScheduler()` to confirm
+                    // it really is a scheduler before falling back to the legacy
+                    // repeatable path.
+                    const hasRepeatJobKey = !!job.repeatJobKey;
+                    const hasLegacyKeyShape = hasRepeatJobKey && job.repeatJobKey.split(':').length >= 5;
+                    let isJobScheduler = hasRepeatJobKey && !hasLegacyKeyShape;
+                    if (hasLegacyKeyShape) {
+                        const jobScheduler = await this.jobScheduler;
+                        isJobScheduler = await jobScheduler.isJobScheduler(job.repeatJobKey);
+                    }
+                    if (isJobScheduler) {
+                        const jobScheduler = await this.jobScheduler;
+                        await jobScheduler.upsertJobScheduler(
+                        // Most of these arguments are not really needed
+                        // anymore as we read them from the job scheduler itself
+                        job.repeatJobKey, job.opts.repeat, job.name, job.data, job.opts, { override: false, producerId: job.id });
+                    }
+                    else if (job.opts.repeat) {
+                        const repeat = await this.repeat;
+                        await repeat.updateRepeatableJob(job.name, job.data, job.opts, {
+                            override: false,
+                        });
+                    }
+                }, { delayInMs: this.opts.runRetryDelay });
+            }
+            catch (err) {
+                // Emit error but don't throw to avoid breaking current job completion
+                // Note: This means the next repeatable job will not be scheduled
+                const errorMessage = err instanceof Error ? err.message : String(err);
+                const schedulingError = new Error(`Failed to add repeatable job for next iteration: ${errorMessage}`);
+                this.emit('error', schedulingError);
+                // Return undefined to indicate no next job is available
+                return undefined;
+            }
+            return job;
+        }
+    }
+    async processJob(job, token, fetchNextCallback = () => true) {
+        var _a, _b;
+        const srcPropagationMetadata = (_b = (_a = job.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.metadata;
+        return this.trace(enums_1.SpanKind.CONSUMER, 'process', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                [enums_1.TelemetryAttributes.JobId]: job.id,
+                [enums_1.TelemetryAttributes.JobName]: job.name,
+            });
+            const abortController = this.lockManager.trackJob(job.id, token, job.processedOn, this.processorAcceptsSignal);
+            try {
+                const unrecoverableErrorMessage = this.getUnrecoverableErrorMessage(job);
+                if (unrecoverableErrorMessage) {
+                    const failed = await this.retryIfFailed(() => {
+                        this.lockManager.untrackJob(job.id);
+                        return this.handleFailed(new errors_1.UnrecoverableError(unrecoverableErrorMessage), job, token, fetchNextCallback, span);
+                    }, { delayInMs: this.opts.runRetryDelay, span });
+                    return failed;
+                }
+                const result = await this.callProcessJob(job, token, abortController
+                    ? abortController.signal
+                    : undefined);
+                return await this.retryIfFailed(() => {
+                    this.lockManager.untrackJob(job.id);
+                    return this.handleCompleted(result, job, token, fetchNextCallback, span);
+                }, { delayInMs: this.opts.runRetryDelay, span });
+            }
+            catch (err) {
+                const failed = await this.retryIfFailed(() => {
+                    this.lockManager.untrackJob(job.id);
+                    return this.handleFailed(err, job, token, fetchNextCallback, span);
+                }, { delayInMs: this.opts.runRetryDelay, span, onlyEmitError: true });
+                return failed;
+            }
+            finally {
+                this.lockManager.untrackJob(job.id);
+                const now = Date.now();
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [enums_1.TelemetryAttributes.JobFinishedTimestamp]: now,
+                    [enums_1.TelemetryAttributes.JobAttemptFinishedTimestamp]: job.finishedOn || now,
+                    [enums_1.TelemetryAttributes.JobProcessedTimestamp]: job.processedOn,
+                });
+            }
+        }, srcPropagationMetadata);
+    }
+    getUnrecoverableErrorMessage(job) {
+        if (job.deferredFailure) {
+            return job.deferredFailure;
+        }
+        if (this.opts.maxStartedAttempts &&
+            this.opts.maxStartedAttempts < job.attemptsStarted) {
+            return 'job started more than allowable limit';
+        }
+    }
+    async handleCompleted(result, job, token, fetchNextCallback = () => true, span) {
+        if (!this.connection.closing) {
+            const completed = await job.moveToCompleted(result, token, fetchNextCallback() && !(this.closing || this.paused));
+            this.emit('completed', job, result, 'active');
+            span === null || span === void 0 ? void 0 : span.addEvent('job completed', {
+                [enums_1.TelemetryAttributes.JobResult]: JSON.stringify(result),
+            });
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobAttemptsMade]: job.attemptsMade,
+            });
+            if (Array.isArray(completed)) {
+                const [jobData, jobId, rateLimitDelay, delayUntil] = completed;
+                this.updateDelays(rateLimitDelay, delayUntil);
+                return this.nextJobFromJobData(jobData, jobId, token);
+            }
+        }
+    }
+    async handleFailed(err, job, token, fetchNextCallback = () => true, span) {
+        if (!this.connection.closing) {
+            // Check if the job was manually rate-limited
+            if (err.message === errors_1.RATE_LIMIT_ERROR) {
+                const rateLimitTtl = await this.moveLimitedBackToWait(job, token);
+                this.limitUntil = rateLimitTtl > 0 ? Date.now() + rateLimitTtl : 0;
+                return;
+            }
+            const fetchNext = fetchNextCallback() && !(this.closing || this.paused);
+            if (err instanceof errors_1.DelayedError ||
+                err.name == 'DelayedError' ||
+                err instanceof errors_1.WaitingError ||
+                err.name == 'WaitingError' ||
+                err instanceof errors_1.WaitingChildrenError ||
+                err.name == 'WaitingChildrenError') {
+                if (!fetchNext) {
+                    return;
+                }
+                const client = await this.client;
+                return this.moveToActive(client, token, this.opts.name);
+            }
+            const result = await job.moveToFailed(err, token, fetchNext);
+            this.emit('failed', job, err, 'active');
+            span === null || span === void 0 ? void 0 : span.addEvent('job failed', {
+                [enums_1.TelemetryAttributes.JobFailedReason]: err.message,
+            });
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.JobAttemptsMade]: job.attemptsMade,
+            });
+            // Note: result can be undefined if moveToFailed fails (e.g., lock was lost)
+            if (Array.isArray(result)) {
+                const [jobData, jobId, rateLimitDelay, delayUntil] = result;
+                this.updateDelays(rateLimitDelay, delayUntil);
+                return this.nextJobFromJobData(jobData, jobId, token);
+            }
+        }
+    }
+    /**
+     *
+     * Pauses the processing of this queue only for this worker.
+     */
+    async pause(doNotWaitActive) {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'pause', this.name, async (span) => {
+            var _a;
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                [enums_1.TelemetryAttributes.WorkerDoNotWaitActive]: doNotWaitActive,
+            });
+            if (!this.paused) {
+                this.paused = true;
+                if (!doNotWaitActive) {
+                    await this.whenCurrentJobsFinished();
+                }
+                (_a = this.stalledCheckStopper) === null || _a === void 0 ? void 0 : _a.call(this);
+                this.emit('paused');
+            }
+        });
+    }
+    /**
+     *
+     * Resumes processing of this worker (if paused).
+     */
+    resume() {
+        if (!this.running || this.paused) {
+            this.trace(enums_1.SpanKind.INTERNAL, 'resume', this.name, span => {
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                    [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                });
+                this.paused = false;
+                if (!this.running) {
+                    if (this.processFn) {
+                        this.run();
+                    }
+                }
+                else {
+                    // TODO: await for startStalledCheckTimer in next breaking change, that will convert resume method to async
+                    // Main loop is still running (pause was called with doNotWaitActive=true).
+                    // Restart the stalled checker since pause() stopped it.
+                    void this.startStalledCheckTimer().catch(err => {
+                        this.emit('error', err);
+                    });
+                }
+                this.emit('resumed');
+            }).catch(err => {
+                this.emit('error', err);
+            });
+        }
+    }
+    /**
+     *
+     * Checks if worker is paused.
+     *
+     * @returns true if worker is paused, false otherwise.
+     */
+    isPaused() {
+        return !!this.paused;
+    }
+    /**
+     *
+     * Checks if worker is currently running.
+     *
+     * @returns true if worker is running, false otherwise.
+     */
+    isRunning() {
+        return this.running;
+    }
+    /**
+     *
+     * Closes the worker and related redis connections.
+     *
+     * This method waits for current jobs to finalize before returning.
+     *
+     * @param force - Use force boolean parameter if you do not want to wait for
+     * current jobs to be processed. When using telemetry, be mindful that it can
+     * interfere with the proper closure of spans, potentially preventing them from being exported.
+     *
+     * @returns Promise that resolves when the worker has been closed.
+     */
+    async close(force = false) {
+        if (this.closing) {
+            return this.closing;
+        }
+        this.closing = (async () => {
+            await this.trace(enums_1.SpanKind.INTERNAL, 'close', this.name, async (span) => {
+                var _a, _b;
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                    [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                    [enums_1.TelemetryAttributes.WorkerForceClose]: force,
+                });
+                this.emit('closing', 'closing queue');
+                (_a = this.abortDelayController) === null || _a === void 0 ? void 0 : _a.abort();
+                // Define the async cleanup functions
+                const asyncCleanups = [
+                    () => {
+                        return force || this.whenCurrentJobsFinished(false);
+                    },
+                    () => this.lockManager.close(),
+                    () => { var _a; return (_a = this.childPool) === null || _a === void 0 ? void 0 : _a.clean(); },
+                    () => this.blockingConnection.close(force),
+                    () => this.connection.close(force),
+                ];
+                // Run cleanup functions sequentially and make sure all are run despite any errors
+                for (const cleanup of asyncCleanups) {
+                    try {
+                        await cleanup();
+                    }
+                    catch (err) {
+                        this.emit('error', err);
+                    }
+                }
+                (_b = this.stalledCheckStopper) === null || _b === void 0 ? void 0 : _b.call(this);
+                this.closed = true;
+                this.emit('closed');
+            });
+        })();
+        return await this.closing;
+    }
+    /**
+     *
+     * Manually starts the stalled checker.
+     * The check will run once as soon as this method is called, and
+     * then every opts.stalledInterval milliseconds until the worker is closed.
+     * Note: Normally you do not need to call this method, since the stalled checker
+     * is automatically started when the worker starts processing jobs after
+     * calling run. However if you want to process the jobs manually you need
+     * to call this method to start the stalled checker.
+     *
+     * @see {@link https://docs.bullmq.io/patterns/manually-fetching-jobs}
+     */
+    async startStalledCheckTimer() {
+        if (!this.opts.skipStalledCheck) {
+            if (!this.closing && !this.stalledCheckerRunning) {
+                await this.trace(enums_1.SpanKind.INTERNAL, 'startStalledCheckTimer', this.name, async (span) => {
+                    span === null || span === void 0 ? void 0 : span.setAttributes({
+                        [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                        [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                    });
+                    this.stalledCheckerRunning = true;
+                    this.stalledChecker()
+                        .catch(err => {
+                        this.emit('error', err);
+                    })
+                        .finally(() => {
+                        this.stalledCheckerRunning = false;
+                    });
+                });
+            }
+        }
+    }
+    async stalledChecker() {
+        while (!(this.closing || this.paused)) {
+            await this.checkConnectionError(() => this.moveStalledJobsToWait());
+            await new Promise(resolve => {
+                const timeout = setTimeout(resolve, this.opts.stalledInterval);
+                this.stalledCheckStopper = () => {
+                    clearTimeout(timeout);
+                    resolve();
+                };
+            });
+        }
+    }
+    /**
+     * Returns a promise that resolves when active jobs are cleared
+     *
+     * @returns
+     */
+    async whenCurrentJobsFinished(reconnect = true) {
+        // The blocking connection is dedicated to bzpopmin, so it is safe to
+        // always disconnect it whenever the main loop is running. Waiting for the
+        // actual disconnect ('end' event) is required to avoid a race where the
+        // bzpopmin call is still in flight when the main loop awaits its result.
+        if (this.mainLoopRunning) {
+            await this.blockingConnection.disconnect(true);
+            await this.mainLoopRunning;
+        }
+        else {
+            reconnect = false;
+        }
+        reconnect && (await this.blockingConnection.reconnect());
+    }
+    async retryIfFailed(fn, opts) {
+        var _a;
+        let retry = 0;
+        const maxRetries = opts.maxRetries || Infinity;
+        do {
+            try {
+                return await fn();
+            }
+            catch (err) {
+                (_a = opts.span) === null || _a === void 0 ? void 0 : _a.recordException(err.message);
+                if ((0, utils_1.isNotConnectionError)(err)) {
+                    // Emit error when not paused or closing; optionally swallow (no throw) when opts.onlyEmitError is set.
+                    if (!this.paused && !this.closing) {
+                        this.emit('error', err);
+                    }
+                    if (opts.onlyEmitError) {
+                        return;
+                    }
+                    else {
+                        throw err;
+                    }
+                }
+                else {
+                    if (opts.delayInMs && !this.closing && !this.closed) {
+                        await this.delay(opts.delayInMs, this.abortDelayController);
+                    }
+                    if (retry + 1 >= maxRetries) {
+                        // If we've reached max retries, throw the last error
+                        throw err;
+                    }
+                }
+            }
+        } while (++retry < maxRetries);
+    }
+    async moveStalledJobsToWait() {
+        await this.trace(enums_1.SpanKind.INTERNAL, 'moveStalledJobsToWait', this.name, async (span) => {
+            const stalled = await this.scripts.moveStalledJobsToWait();
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [enums_1.TelemetryAttributes.WorkerId]: this.id,
+                [enums_1.TelemetryAttributes.WorkerName]: this.opts.name,
+                [enums_1.TelemetryAttributes.WorkerStalledJobs]: stalled,
+            });
+            stalled.forEach((jobId) => {
+                span === null || span === void 0 ? void 0 : span.addEvent('job stalled', {
+                    [enums_1.TelemetryAttributes.JobId]: jobId,
+                });
+                this.emit('stalled', jobId, 'active');
+            });
+        });
+    }
+    moveLimitedBackToWait(job, token) {
+        return job.moveToWait(token);
+    }
+}
+exports.Worker = Worker;
diff --git a/node_modules/bullmq/dist/cjs/commands/addDelayedJob-6.lua b/node_modules/bullmq/dist/cjs/commands/addDelayedJob-6.lua
new file mode 100644
index 0000000..00ae938
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addDelayedJob-6.lua
@@ -0,0 +1,108 @@
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+
+    - computes timestamp.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+    
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'delayed'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (use custom instead of one generated automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local delayedKey = KEYS[4]
+
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addDelayedJob"
+--- @include "includes/deduplicateJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, delayedKey, deduplicationKey,
+  eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+    opts, timestamp, parentKey, parentData, repeatJobKey)
+
+addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, KEYS[1], delay)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/cjs/commands/addJobScheduler-11.lua b/node_modules/bullmq/dist/cjs/commands/addJobScheduler-11.lua
new file mode 100644
index 0000000..9dcc1f7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addJobScheduler-11.lua
@@ -0,0 +1,198 @@
+--[[
+  Adds a job scheduler, i.e. a job factory that creates jobs based on a given schedule (repeat options).
+
+    Input:
+      KEYS[1]  'repeat' key
+      KEYS[2]  'delayed' key
+      KEYS[3]  'wait' key
+      KEYS[4]  'paused' key
+      KEYS[5]  'meta' key
+      KEYS[6]  'prioritized' key
+      KEYS[7]  'marker' key
+      KEYS[8]  'id' key
+      KEYS[9]  'events' key
+      KEYS[10] 'pc' priority counter
+      KEYS[11] 'active' key
+      
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] jobs scheduler id
+      ARGV[4] Json stringified template data
+      ARGV[5] mspacked template opts
+      ARGV[6] msgpacked delayed opts
+      ARGV[7] timestamp
+      ARGV[8] prefix key
+      ARGV[9] producer key
+
+      Output:
+        repeatableKey  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local eventsKey = KEYS[9]
+
+local nextMillis = ARGV[1]
+local jobSchedulerId = ARGV[3]
+local templateOpts = cmsgpack.unpack(ARGV[5])
+local now = tonumber(ARGV[7])
+local prefixKey = ARGV[8]
+local jobOpts = cmsgpack.unpack(ARGV[6])
+
+-- Includes
+--- @include "includes/addJobFromScheduler"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/isQueuePaused"
+--- @include "includes/removeJob"
+--- @include "includes/storeJobScheduler"
+--- @include "includes/getJobSchedulerEveryNextMillis"
+
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local templateData = ARGV[4]
+
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+end
+local schedulerOpts = cmsgpack.unpack(ARGV[2])
+
+local every = schedulerOpts['every']
+
+-- For backwards compatibility we also check the offset from the job itself.
+-- could be removed in future major versions.
+local jobOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+local offset = schedulerOpts['offset'] or jobOffset or 0
+local newOffset = offset
+
+local updatedEvery = false
+if every then
+    -- if we changed the 'every' value we need to reset millis to nil
+    local millis = prevMillis
+    if prevMillis then
+        local prevEvery = tonumber(rcall("HGET", schedulerKey, "every"))
+        if prevEvery ~= every then
+            millis = nil
+            updatedEvery = true
+        end
+    end
+
+    local startDate = schedulerOpts['startDate']
+    nextMillis, newOffset = getJobSchedulerEveryNextMillis(millis, every, now, offset, startDate)
+end
+
+local function removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, jobId, metaKey,
+    eventsKey)
+    if rcall("ZSCORE", delayedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", delayedKey, jobId)
+        return true
+    elseif rcall("ZSCORE", prioritizedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", prioritizedKey, jobId)
+        return true
+    else
+        local pausedOrWaitKey = waitKey
+        if isQueuePaused(metaKey) then
+            pausedOrWaitKey = pausedKey
+        end
+
+        if rcall("LREM", pausedOrWaitKey, 1, jobId) > 0 then
+            removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+            return true
+        end
+    end
+
+    return false
+end
+
+local removedPrevJob = false
+if prevMillis then
+    local currentJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    local currentJobKey = schedulerKey .. ":" .. prevMillis
+
+    -- In theory it should always exist the currentJobKey if there is a prevMillis unless something has
+    -- gone really wrong.
+    if rcall("EXISTS", currentJobKey) == 1 then
+        removedPrevJob = removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, currentJobId,
+            metaKey, eventsKey)
+    end
+end
+
+if removedPrevJob then
+    -- The jobs has been removed and we want to replace it, so lets use the same millis.
+    if every and not updatedEvery then
+        nextMillis = prevMillis
+    end
+else
+    -- Special case where no job was removed, and we need to add the next iteration.
+    schedulerOpts['offset'] = newOffset
+end
+
+-- Check for job ID collision with existing jobs (in any state)
+local jobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+local jobKey = prefixKey .. jobId
+
+-- If there's already a job with this ID, in a state 
+-- that is not updatable (active, completed, failed) we must 
+-- handle the collision
+local hasCollision = false
+if rcall("EXISTS", jobKey) == 1 then
+    if every then
+        -- For 'every' case: try next time slot to avoid collision
+        local nextSlotMillis = nextMillis + every
+        local nextSlotJobId = "repeat:" .. jobSchedulerId .. ":" .. nextSlotMillis
+        local nextSlotJobKey = prefixKey .. nextSlotJobId
+
+        if rcall("EXISTS", nextSlotJobKey) == 0 then
+            -- Next slot is free, use it
+            nextMillis = nextSlotMillis
+            jobId = nextSlotJobId
+        else
+            -- Next slot also has a job, return error code
+            return -11 -- SchedulerJobSlotsBusy
+        end
+    else
+        hasCollision = true
+    end
+end
+
+local delay = nextMillis - now
+
+-- Fast Clamp delay to minimum of 0
+if delay < 0 then
+    delay = 0
+end
+
+local nextJobKey = schedulerKey .. ":" .. nextMillis
+
+if not hasCollision or removedPrevJob then
+    -- jobId already calculated above during collision check
+
+    storeJobScheduler(jobSchedulerId, schedulerKey, repeatKey, nextMillis, schedulerOpts, templateData, templateOpts)
+
+    rcall("INCR", KEYS[8])
+
+    addJobFromScheduler(nextJobKey, jobId, jobOpts, waitKey, pausedKey, KEYS[11], metaKey, prioritizedKey, KEYS[10],
+        delayedKey, KEYS[7], eventsKey, schedulerOpts['name'], maxEvents, now, templateData, jobSchedulerId, delay)
+elseif hasCollision then
+    -- For 'pattern' case: return error code
+    return -10 -- SchedulerJobIdCollision
+end
+
+if ARGV[9] ~= "" then
+    rcall("HSET", ARGV[9], "nrjid", jobId)
+end
+
+return {jobId .. "", delay}
diff --git a/node_modules/bullmq/dist/cjs/commands/addLog-2.lua b/node_modules/bullmq/dist/cjs/commands/addLog-2.lua
new file mode 100644
index 0000000..92748de
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addLog-2.lua
@@ -0,0 +1,30 @@
+--[[
+  Add job log
+
+  Input:
+    KEYS[1] job id key
+    KEYS[2] job logs key
+
+    ARGV[1] id
+    ARGV[2] log
+    ARGV[3] keepLogs
+
+  Output:
+    -1 - Missing job.
+]]
+local rcall = redis.call
+
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+  local logCount = rcall("RPUSH", KEYS[2], ARGV[2])
+
+  if ARGV[3] ~= '' then
+    local keepLogs = tonumber(ARGV[3])
+    rcall("LTRIM", KEYS[2], -keepLogs, -1)
+
+    return math.min(keepLogs, logCount)
+  end
+
+  return logCount
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/addParentJob-6.lua b/node_modules/bullmq/dist/cjs/commands/addParentJob-6.lua
new file mode 100644
index 0000000..2735885
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addParentJob-6.lua
@@ -0,0 +1,110 @@
+--[[
+  Adds a parent job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - adds the job to the waiting-children zset
+
+    Input:
+      KEYS[1] 'meta'
+      KEYS[2] 'id'
+      KEYS[3] 'delayed'
+      KEYS[4] 'waiting-children'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[1]
+local idKey = KEYS[2]
+local delayedKey = KEYS[3]
+
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/deduplicateJobWithoutReplace"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationId = opts['de'] and opts['de']['id']
+if deduplicationId then
+    local deduplicationJobId = deduplicateJobWithoutReplace(deduplicationId, opts['de'],
+        jobId, deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationJobId then
+        return deduplicationJobId
+    end
+end
+
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+
+local waitChildrenKey = KEYS[4]
+rcall("ZADD", waitChildrenKey, timestamp, jobId)
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+      "waiting-children", "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/cjs/commands/addPrioritizedJob-9.lua b/node_modules/bullmq/dist/cjs/commands/addPrioritizedJob-9.lua
new file mode 100644
index 0000000..0a7c5f1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addPrioritizedJob-9.lua
@@ -0,0 +1,118 @@
+--[[
+  Adds a prioritized job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - Adds the job to the "added" list so that workers gets notified.
+
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'prioritized'
+      KEYS[5] 'delayed'
+      KEYS[6] 'completed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] 'pc' priority counter
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]] 
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local priorityKey = KEYS[4]
+
+local completedKey = KEYS[6]
+local activeKey = KEYS[7]
+local eventsKey = KEYS[8]
+local priorityCounterKey = KEYS[9]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addJobWithPriority"
+--- @include "includes/deduplicateJob"
+--- @include "includes/storeJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/isQueuePausedOrMaxed"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[5],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+-- Store the job.
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+                                 opts, timestamp, parentKey, parentData,
+                                 repeatJobKey)
+
+-- Add the job to the prioritized set
+local isPausedOrMaxed = isQueuePausedOrMaxed(metaKey, activeKey)
+addJobWithPriority( KEYS[1], priorityKey, priority, jobId, priorityCounterKey, isPausedOrMaxed)
+
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/cjs/commands/addRepeatableJob-2.lua b/node_modules/bullmq/dist/cjs/commands/addRepeatableJob-2.lua
new file mode 100644
index 0000000..9d5e3f5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addRepeatableJob-2.lua
@@ -0,0 +1,84 @@
+--[[
+  Adds a repeatable job
+
+    Input:
+      KEYS[1] 'repeat' key
+      KEYS[2] 'delayed' key
+      
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      ARGV[4] custom key
+      ARGV[5] prefix key
+
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+
+local nextMillis = ARGV[1]
+local legacyCustomKey = ARGV[3]
+local customKey = ARGV[4]
+local prefixKey = ARGV[5]
+
+-- Includes
+--- @include "includes/removeJob"
+
+local function storeRepeatableJob(repeatKey, customKey, nextMillis, rawOpts)
+  rcall("ZADD", repeatKey, nextMillis, customKey)
+  local opts = cmsgpack.unpack(rawOpts)
+
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+
+  rcall("HMSET", repeatKey .. ":" .. customKey, "name", opts['name'],
+    unpack(optionalValues))
+
+  return customKey
+end
+
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local prevMillis = rcall("ZSCORE", repeatKey, customKey)
+if prevMillis then
+  local delayedJobId =  "repeat:" .. customKey .. ":" .. prevMillis
+  local nextDelayedJobId =  repeatKey .. ":" .. customKey .. ":" .. nextMillis
+
+  if rcall("ZSCORE", delayedKey, delayedJobId)
+   and rcall("EXISTS", nextDelayedJobId) ~= 1 then
+    removeJob(delayedJobId, true, prefixKey, true --[[remove debounce key]])
+    rcall("ZREM", delayedKey, delayedJobId)
+  end
+end
+
+-- Keep backwards compatibility with old repeatable jobs (<= 3.0.0)
+if rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+  return storeRepeatableJob(repeatKey, legacyCustomKey, nextMillis, ARGV[2])
+end
+
+return storeRepeatableJob(repeatKey, customKey, nextMillis, ARGV[2])
diff --git a/node_modules/bullmq/dist/cjs/commands/addStandardJob-9.lua b/node_modules/bullmq/dist/cjs/commands/addStandardJob-9.lua
new file mode 100644
index 0000000..db1198a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/addStandardJob-9.lua
@@ -0,0 +1,123 @@
+--[[
+  Adds a job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+
+    - if delayed:
+      - computes timestamp.
+      - adds to delayed zset.
+      - Emits a global event 'delayed' if the job is delayed.
+    - if not delayed
+      - Adds the jobId to the wait/paused list in one of three ways:
+         - LIFO
+         - FIFO
+         - prioritized.
+      - Adds the job to the "added" list so that workers gets notified.
+
+    Input:
+      KEYS[1] 'wait',
+      KEYS[2] 'paused'
+      KEYS[3] 'meta'
+      KEYS[4] 'id'
+      KEYS[5] 'completed'
+      KEYS[6] 'delayed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] marker key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local eventsKey = KEYS[8]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/deduplicateJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", KEYS[4])
+
+local metaKey = KEYS[3]
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, KEYS[5], eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[6],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[1], KEYS[2])
+
+-- LIFO or FIFO
+local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+addJobInTargetList(target, KEYS[9], pushCmd, isPausedOrMaxed, jobId)
+
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/cjs/commands/changeDelay-4.lua b/node_modules/bullmq/dist/cjs/commands/changeDelay-4.lua
new file mode 100644
index 0000000..f0bdb6a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/changeDelay-4.lua
@@ -0,0 +1,55 @@
+--[[
+  Change job delay when it is in delayed set.
+  Input:
+    KEYS[1] delayed key
+    KEYS[2] meta key
+    KEYS[3] marker key
+    KEYS[4] events stream
+
+    ARGV[1] delay
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] job key
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in delayed set.
+
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+--- @include "includes/getDelayedScore"
+--- @include "includes/getOrSetMaxEvents"
+
+if rcall("EXISTS", ARGV[4]) == 1 then
+  local jobId = ARGV[3]
+
+  local delay = tonumber(ARGV[1])
+  local score, delayedTimestamp = getDelayedScore(KEYS[1], ARGV[2], delay)
+
+  local numRemovedElements = rcall("ZREM", KEYS[1], jobId)
+
+  if numRemovedElements < 1 then
+    return -3
+  end
+
+  rcall("HSET", ARGV[4], "delay", delay)
+  rcall("ZADD", KEYS[1], score, jobId)
+
+  local maxEvents = getOrSetMaxEvents(KEYS[2])
+
+  rcall("XADD", KEYS[4], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(KEYS[3], KEYS[1])
+
+  return 0
+else
+  return -1
+end
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/cjs/commands/changePriority-7.lua b/node_modules/bullmq/dist/cjs/commands/changePriority-7.lua
new file mode 100644
index 0000000..50e6219
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/changePriority-7.lua
@@ -0,0 +1,68 @@
+--[[
+  Change job priority
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'active'
+    KEYS[6] 'pc' priority counter
+    KEYS[7] 'marker'
+
+    ARGV[1] priority value
+    ARGV[2] prefix key
+    ARGV[3] job id
+    ARGV[4] lifo
+
+    Output:
+       0  - OK
+      -1  - Missing job
+]]
+local jobId = ARGV[3]
+local jobKey = ARGV[2] .. jobId
+local priority = tonumber(ARGV[1])
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/pushBackJobWithPriority"
+
+local function reAddJobWithNewPriority( prioritizedKey, markerKey, targetKey,
+    priorityCounter, lifo, priority, jobId, isPausedOrMaxed)
+    if priority == 0 then
+        local pushCmd = lifo and 'RPUSH' or 'LPUSH'
+        addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    else
+        if lifo then
+            pushBackJobWithPriority(prioritizedKey, priority, jobId)
+        else
+            addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+                priorityCounter, isPausedOrMaxed)
+        end
+    end
+end
+
+if rcall("EXISTS", jobKey) == 1 then
+    local metaKey = KEYS[3]
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[5], KEYS[1], KEYS[2])
+    local prioritizedKey = KEYS[4]
+    local priorityCounterKey = KEYS[6]
+    local markerKey = KEYS[7]
+
+    -- Re-add with the new priority
+    if rcall("ZREM", prioritizedKey, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    elseif rcall("LREM", target, -1, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    end
+
+    rcall("HSET", jobKey, "priority", priority)
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/cleanJobsInSet-3.lua b/node_modules/bullmq/dist/cjs/commands/cleanJobsInSet-3.lua
new file mode 100644
index 0000000..744748f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/cleanJobsInSet-3.lua
@@ -0,0 +1,59 @@
+--[[
+  Remove jobs from the specific set.
+
+  Input:
+    KEYS[1]  set key,
+    KEYS[2]  events stream key
+    KEYS[3]  repeat key
+
+    ARGV[1]  jobKey prefix
+    ARGV[2]  timestamp
+    ARGV[3]  limit the number of jobs to be removed. 0 is unlimited
+    ARGV[4]  set name, can be any of 'wait', 'active', 'paused', 'delayed', 'completed', or 'failed'
+]]
+local rcall = redis.call
+local repeatKey = KEYS[3]
+local rangeStart = 0
+local rangeEnd = -1
+
+local limit = tonumber(ARGV[3])
+
+-- If we're only deleting _n_ items, avoid retrieving all items
+-- for faster performance
+--
+-- Start from the tail of the list, since that's where oldest elements
+-- are generally added for FIFO lists
+if limit > 0 then
+  rangeStart = -1 - limit + 1
+  rangeEnd = -1
+end
+
+-- Includes
+--- @include "includes/cleanList"
+--- @include "includes/cleanSet"
+
+local result
+if ARGV[4] == "active" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], false --[[ hasFinished ]],
+                      repeatKey)
+elseif ARGV[4] == "delayed" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"processedOn", "timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "prioritized" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "wait" or ARGV[4] == "paused" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], true --[[ hasFinished ]],
+                      repeatKey)
+else
+  rangeEnd = ARGV[2]
+  -- No need to pass repeat key as in that moment job won't be related to a job scheduler
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"finishedOn"}, true  --[[ hasFinished ]])
+end
+
+rcall("XADD", KEYS[2], "*", "event", "cleaned", "count", result[2])
+
+return result[1]
diff --git a/node_modules/bullmq/dist/cjs/commands/drain-5.lua b/node_modules/bullmq/dist/cjs/commands/drain-5.lua
new file mode 100644
index 0000000..738f9d2
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/drain-5.lua
@@ -0,0 +1,41 @@
+--[[
+  Drains the queue, removes all jobs that are waiting
+  or delayed, but not active, completed or failed
+
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'delayed'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'jobschedulers' (repeat)
+
+    ARGV[1]  queue key prefix
+    ARGV[2]  should clean delayed jobs
+]]
+local rcall = redis.call
+local queueBaseKey = ARGV[1]
+
+--- @include "includes/removeListJobs"
+--- @include "includes/removeZSetJobs"
+
+-- We must not remove delayed jobs if they are associated to a job scheduler.
+local scheduledJobs = {}
+local jobSchedulers = rcall("ZRANGE", KEYS[5], 0, -1, "WITHSCORES")
+
+-- For every job scheduler, get the current delayed job id.
+for i = 1, #jobSchedulers, 2 do
+    local jobSchedulerId = jobSchedulers[i]
+    local jobSchedulerMillis = jobSchedulers[i + 1]
+
+    local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. jobSchedulerMillis
+    scheduledJobs[delayedJobId] = true
+end
+
+removeListJobs(KEYS[1], true, queueBaseKey, 0, scheduledJobs) -- wait
+removeListJobs(KEYS[2], true, queueBaseKey, 0, scheduledJobs) -- paused
+
+if ARGV[2] == "1" then
+  removeZSetJobs(KEYS[3], true, queueBaseKey, 0, scheduledJobs) -- delayed
+end
+
+removeZSetJobs(KEYS[4], true, queueBaseKey, 0, scheduledJobs) -- prioritized
diff --git a/node_modules/bullmq/dist/cjs/commands/extendLock-2.lua b/node_modules/bullmq/dist/cjs/commands/extendLock-2.lua
new file mode 100644
index 0000000..37a3e30
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/extendLock-2.lua
@@ -0,0 +1,23 @@
+--[[
+  Extend lock and removes the job from the stalled set.
+
+  Input:
+    KEYS[1] 'lock',
+    KEYS[2] 'stalled'
+
+    ARGV[1]  token
+    ARGV[2]  lock duration in milliseconds
+    ARGV[3]  jobid
+
+  Output:
+    "1" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  --   if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2], "XX") then
+  if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2]) then
+    rcall("SREM", KEYS[2], ARGV[3])
+    return 1
+  end
+end
+return 0
diff --git a/node_modules/bullmq/dist/cjs/commands/extendLocks-1.lua b/node_modules/bullmq/dist/cjs/commands/extendLocks-1.lua
new file mode 100644
index 0000000..bbd5548
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/extendLocks-1.lua
@@ -0,0 +1,48 @@
+--[[
+  Extend locks for multiple jobs and remove them from the stalled set if successful.
+  Return the list of job IDs for which the operation failed.
+
+  KEYS[1] = stalled key
+  
+  ARGV[1] = baseKey
+  ARGV[2] = tokens
+  ARGV[3] = jobIds
+  ARGV[4] = lockDuration (ms)
+
+  Output:
+    An array of failed job IDs. If empty, all succeeded.
+]]
+local rcall = redis.call
+
+local stalledKey = KEYS[1]
+local baseKey = ARGV[1]
+local tokens = cmsgpack.unpack(ARGV[2])
+local jobIds = cmsgpack.unpack(ARGV[3])
+local lockDuration = ARGV[4]
+
+local jobCount = #jobIds
+local failedJobs = {}
+
+for i = 1, jobCount, 1 do
+    local lockKey = baseKey .. jobIds[i] .. ':lock'
+    local jobId = jobIds[i]
+    local token = tokens[i]
+
+    local currentToken = rcall("GET", lockKey)
+    if currentToken then
+        if currentToken == token then
+            local setResult = rcall("SET", lockKey, token, "PX", lockDuration)
+            if setResult then
+                rcall("SREM", stalledKey, jobId)
+            else
+                table.insert(failedJobs, jobId)
+            end
+        else
+            table.insert(failedJobs, jobId)
+        end
+    else
+        table.insert(failedJobs, jobId)
+    end
+end
+
+return failedJobs
diff --git a/node_modules/bullmq/dist/cjs/commands/getCounts-1.lua b/node_modules/bullmq/dist/cjs/commands/getCounts-1.lua
new file mode 100644
index 0000000..0b5886c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getCounts-1.lua
@@ -0,0 +1,36 @@
+--[[
+  Get counts per provided states
+
+    Input:
+      KEYS[1]    'prefix'
+
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local prefix = KEYS[1]
+local results = {}
+
+for i = 1, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        results[#results+1] = count-1
+      else
+        results[#results+1] = 0
+      end
+    else
+      results[#results+1] = rcall("LLEN", stateKey)
+    end
+  elseif ARGV[i] == "active" then
+    results[#results+1] = rcall("LLEN", stateKey)
+  else
+    results[#results+1] = rcall("ZCARD", stateKey)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/cjs/commands/getCountsPerPriority-4.lua b/node_modules/bullmq/dist/cjs/commands/getCountsPerPriority-4.lua
new file mode 100644
index 0000000..fa24ba2
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getCountsPerPriority-4.lua
@@ -0,0 +1,35 @@
+--[[
+  Get counts per provided states
+
+    Input:
+      KEYS[1] wait key
+      KEYS[2] paused key
+      KEYS[3] meta key
+      KEYS[4] prioritized key
+
+      ARGV[1...] priorities
+]]
+local rcall = redis.call
+local results = {}
+local waitKey = KEYS[1]
+local pausedKey = KEYS[2]
+local prioritizedKey = KEYS[4]
+
+-- Includes
+--- @include "includes/isQueuePaused"
+
+for i = 1, #ARGV do
+  local priority = tonumber(ARGV[i])
+  if priority == 0 then
+    if isQueuePaused(KEYS[3]) then
+      results[#results+1] = rcall("LLEN", pausedKey)
+    else
+      results[#results+1] = rcall("LLEN", waitKey)
+    end
+  else
+    results[#results+1] = rcall("ZCOUNT", prioritizedKey,
+      priority * 0x100000000, (priority + 1)  * 0x100000000 - 1)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/cjs/commands/getDependencyCounts-4.lua b/node_modules/bullmq/dist/cjs/commands/getDependencyCounts-4.lua
new file mode 100644
index 0000000..bacc488
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getDependencyCounts-4.lua
@@ -0,0 +1,31 @@
+--[[
+  Get counts per child states
+
+    Input:
+      KEYS[1]    processed key
+      KEYS[2]    unprocessed key
+      KEYS[3]    ignored key
+      KEYS[4]    failed key
+
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local processedKey = KEYS[1]
+local unprocessedKey = KEYS[2]
+local ignoredKey = KEYS[3]
+local failedKey = KEYS[4]
+local results = {}
+
+for i = 1, #ARGV do
+  if ARGV[i] == "processed" then
+    results[#results+1] = rcall("HLEN", processedKey)
+  elseif ARGV[i] == "unprocessed" then
+    results[#results+1] = rcall("SCARD", unprocessedKey)
+  elseif ARGV[i] == "ignored" then
+    results[#results+1] = rcall("HLEN", ignoredKey)
+  else
+    results[#results+1] = rcall("ZCARD", failedKey)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/cjs/commands/getJobScheduler-1.lua b/node_modules/bullmq/dist/cjs/commands/getJobScheduler-1.lua
new file mode 100644
index 0000000..324bdb5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getJobScheduler-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Get job scheduler record.
+
+  Input:
+    KEYS[1] 'repeat' key
+
+    ARGV[1] id
+]]
+
+local rcall = redis.call
+local jobSchedulerKey = KEYS[1] .. ":" .. ARGV[1]
+
+local score = rcall("ZSCORE", KEYS[1], ARGV[1])
+
+if score then
+  return {rcall("HGETALL", jobSchedulerKey), score} -- get job data
+end
+
+return {nil, nil}
diff --git a/node_modules/bullmq/dist/cjs/commands/getMetrics-2.lua b/node_modules/bullmq/dist/cjs/commands/getMetrics-2.lua
new file mode 100644
index 0000000..699255f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getMetrics-2.lua
@@ -0,0 +1,19 @@
+--[[
+  Get metrics
+
+  Input:
+    KEYS[1] 'metrics' key
+    KEYS[2] 'metrics data' key
+
+    ARGV[1] start index
+    ARGV[2] end index
+]]
+local rcall = redis.call;
+local metricsKey = KEYS[1]
+local dataKey = KEYS[2]
+
+local metrics = rcall("HMGET", metricsKey, "count", "prevTS", "prevCount")
+local data = rcall("LRANGE", dataKey, tonumber(ARGV[1]), tonumber(ARGV[2]))
+local numPoints = rcall("LLEN", dataKey)
+
+return {metrics, data, numPoints}
diff --git a/node_modules/bullmq/dist/cjs/commands/getRanges-1.lua b/node_modules/bullmq/dist/cjs/commands/getRanges-1.lua
new file mode 100644
index 0000000..b9ead60
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getRanges-1.lua
@@ -0,0 +1,70 @@
+--[[
+  Get job ids per provided states
+
+    Input:
+      KEYS[1]    'prefix'
+
+      ARGV[1]    start
+      ARGV[2]    end
+      ARGV[3]    asc
+      ARGV[4...] types
+]]
+local rcall = redis.call
+local prefix = KEYS[1]
+local rangeStart = tonumber(ARGV[1])
+local rangeEnd = tonumber(ARGV[2])
+local asc = ARGV[3]
+local results = {}
+
+local function getRangeInList(listKey, asc, rangeStart, rangeEnd, results)
+  if asc == "1" then
+    local modifiedRangeStart
+    local modifiedRangeEnd
+    if rangeStart == -1 then
+      modifiedRangeStart = 0
+    else
+      modifiedRangeStart = -(rangeStart + 1)
+    end
+
+    if rangeEnd == -1 then
+      modifiedRangeEnd = 0
+    else
+      modifiedRangeEnd = -(rangeEnd + 1)
+    end
+
+    results[#results+1] = rcall("LRANGE", listKey,
+      modifiedRangeEnd,
+      modifiedRangeStart)
+  else
+    results[#results+1] = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  end
+end
+
+for i = 4, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+      else
+        results[#results+1] = {}
+      end
+    else
+      getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+    end
+  elseif ARGV[i] == "active" then
+    getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+  else
+    if asc == "1" then
+      results[#results+1] = rcall("ZRANGE", stateKey, rangeStart, rangeEnd)
+    else
+      results[#results+1] = rcall("ZREVRANGE", stateKey, rangeStart, rangeEnd)
+    end
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/cjs/commands/getRateLimitTtl-2.lua b/node_modules/bullmq/dist/cjs/commands/getRateLimitTtl-2.lua
new file mode 100644
index 0000000..755d25f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getRateLimitTtl-2.lua
@@ -0,0 +1,26 @@
+--[[
+  Get rate limit ttl
+
+    Input:
+      KEYS[1] 'limiter'
+      KEYS[2] 'meta'
+
+      ARGV[1] maxJobs
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/getRateLimitTTL"
+
+local rateLimiterKey = KEYS[1]
+if ARGV[1] ~= "0" then
+  return getRateLimitTTL(tonumber(ARGV[1]), rateLimiterKey)
+else
+  local rateLimitMax = rcall("HGET", KEYS[2], "max")
+  if rateLimitMax then
+    return getRateLimitTTL(tonumber(rateLimitMax), rateLimiterKey)
+  end
+
+  return rcall("PTTL", rateLimiterKey)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/getState-8.lua b/node_modules/bullmq/dist/cjs/commands/getState-8.lua
new file mode 100644
index 0000000..f9346f1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getState-8.lua
@@ -0,0 +1,65 @@
+--[[
+  Get a job state
+
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'prioritized'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+
+-- Includes
+--- @include "includes/checkItemInList"
+
+local active_items = rcall("LRANGE", KEYS[4] , 0, -1)
+if checkItemInList(active_items, ARGV[1]) ~= nil then
+  return "active"
+end
+
+local wait_items = rcall("LRANGE", KEYS[5] , 0, -1)
+if checkItemInList(wait_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+
+local paused_items = rcall("LRANGE", KEYS[6] , 0, -1)
+if checkItemInList(paused_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+
+if rcall("ZSCORE", KEYS[7], ARGV[1]) then
+  return "waiting-children"
+end
+
+return "unknown"
diff --git a/node_modules/bullmq/dist/cjs/commands/getStateV2-8.lua b/node_modules/bullmq/dist/cjs/commands/getStateV2-8.lua
new file mode 100644
index 0000000..12eea10
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/getStateV2-8.lua
@@ -0,0 +1,58 @@
+--[[
+  Get a job state
+
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+
+if rcall("LPOS", KEYS[4] , ARGV[1]) then
+  return "active"
+end
+
+if rcall("LPOS", KEYS[5] , ARGV[1]) then
+  return "waiting"
+end
+
+if rcall("LPOS", KEYS[6] , ARGV[1]) then
+  return "waiting"
+end
+
+if rcall("ZSCORE", KEYS[7] , ARGV[1]) then
+  return "waiting-children"
+end
+
+return "unknown"
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addBaseMarkerIfNeeded.lua b/node_modules/bullmq/dist/cjs/commands/includes/addBaseMarkerIfNeeded.lua
new file mode 100644
index 0000000..af10026
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addBaseMarkerIfNeeded.lua
@@ -0,0 +1,9 @@
+--[[
+  Add marker if needed when a job is available.
+]]
+
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addDelayMarkerIfNeeded.lua b/node_modules/bullmq/dist/cjs/commands/includes/addDelayMarkerIfNeeded.lua
new file mode 100644
index 0000000..2f98500
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addDelayMarkerIfNeeded.lua
@@ -0,0 +1,15 @@
+--[[
+  Add delay marker if needed.
+]]
+
+-- Includes
+--- @include "getNextDelayedTimestamp"
+
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addDelayedJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/addDelayedJob.lua
new file mode 100644
index 0000000..c6bc015
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addDelayedJob.lua
@@ -0,0 +1,23 @@
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+
+-- Includes
+--- @include "addDelayMarkerIfNeeded"
+--- @include "getDelayedScore"
+
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addJobFromScheduler.lua b/node_modules/bullmq/dist/cjs/commands/includes/addJobFromScheduler.lua
new file mode 100644
index 0000000..1a9f318
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addJobFromScheduler.lua
@@ -0,0 +1,19 @@
+--[[
+  Add delay marker if needed.
+]]
+
+-- Includes
+--- @include "storeAndEnqueueJob"
+
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addJobInTargetList.lua b/node_modules/bullmq/dist/cjs/commands/includes/addJobInTargetList.lua
new file mode 100644
index 0000000..80f7bc0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addJobInTargetList.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/addJobWithPriority.lua b/node_modules/bullmq/dist/cjs/commands/includes/addJobWithPriority.lua
new file mode 100644
index 0000000..ccf8cf3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/addJobWithPriority.lua
@@ -0,0 +1,14 @@
+--[[
+  Function to add job considering priority.
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+--- @include "getPriorityScore"
+
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/batches.lua b/node_modules/bullmq/dist/cjs/commands/includes/batches.lua
new file mode 100644
index 0000000..b8e6d48
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/batches.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+
+local function batches(n, batchSize)
+  local i = 0
+
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/checkItemInList.lua b/node_modules/bullmq/dist/cjs/commands/includes/checkItemInList.lua
new file mode 100644
index 0000000..b186afb
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/checkItemInList.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to check if an item belongs to a list.
+]]
+
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/cleanList.lua b/node_modules/bullmq/dist/cjs/commands/includes/cleanList.lua
new file mode 100644
index 0000000..bf1557d
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/cleanList.lua
@@ -0,0 +1,49 @@
+--[[
+  Function to clean job list.
+  Returns jobIds and deleted count number.
+]]
+
+-- Includes
+--- @include "getTimestamp"
+--- @include "isJobSchedulerJob"
+--- @include "removeJob"
+
+local function cleanList(listKey, jobKeyPrefix, rangeStart, rangeEnd,
+  timestamp, isWaiting, jobSchedulersKey)
+  local jobs = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  local deleted = {}
+  local deletedCount = 0
+  local jobTS
+  local deletionMarker = ''
+  local jobIdsLen = #jobs
+  for i, job in ipairs(jobs) do
+    if limit > 0 and deletedCount >= limit then
+      break
+    end
+  
+    local jobKey = jobKeyPrefix .. job
+    if (isWaiting or rcall("EXISTS", jobKey .. ":lock") == 0) and
+      not isJobSchedulerJob(job, jobKey, jobSchedulersKey) then
+      -- Find the right timestamp of the job to compare to maxTimestamp:
+      -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+      -- * processedOn represents when the job was last attempted, but it doesn't get populated until
+      --   the job is first tried
+      -- * timestamp is the original job submission time
+      -- Fetch all three of these (in that order) and use the first one that is set so that we'll leave jobs
+      -- that have been active within the grace period:
+      jobTS = getTimestamp(jobKey, {"finishedOn", "processedOn", "timestamp"})
+      if (not jobTS or jobTS <= timestamp) then
+        -- replace the entry with a deletion marker; the actual deletion will
+        -- occur at the end of the script
+        rcall("LSET", listKey, rangeEnd - jobIdsLen + i, deletionMarker)
+        removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]])
+        deletedCount = deletedCount + 1
+        table.insert(deleted, job)
+      end
+    end
+  end
+
+  rcall("LREM", listKey, 0, deletionMarker)
+
+  return {deleted, deletedCount}
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/cleanSet.lua b/node_modules/bullmq/dist/cjs/commands/includes/cleanSet.lua
new file mode 100644
index 0000000..c9d82dc
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/cleanSet.lua
@@ -0,0 +1,58 @@
+--[[
+  Function to clean job set.
+  Returns jobIds and deleted count number.
+]] 
+
+-- Includes
+--- @include "batches"
+--- @include "getJobsInZset"
+--- @include "getTimestamp"
+--- @include "isJobSchedulerJob"
+--- @include "removeJob"
+
+local function cleanSet(
+    setKey,
+    jobKeyPrefix,
+    rangeEnd,
+    timestamp,
+    limit,
+    attributes,
+    isFinished,
+    jobSchedulersKey)
+    local jobs = getJobsInZset(setKey, rangeEnd, limit)
+    local deleted = {}
+    local deletedCount = 0
+    local jobTS
+    for i, job in ipairs(jobs) do
+        if limit > 0 and deletedCount >= limit then
+            break
+        end
+
+        local jobKey = jobKeyPrefix .. job
+        -- Extract a Job Scheduler Id from jobId ("repeat:job-scheduler-id:millis") 
+        -- and check if it is in the scheduled jobs
+        if not (jobSchedulersKey and isJobSchedulerJob(job, jobKey, jobSchedulersKey)) then
+            if isFinished then
+                removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                deletedCount = deletedCount + 1
+                table.insert(deleted, job)
+            else
+                -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+                jobTS = getTimestamp(jobKey, attributes)
+                if (not jobTS or jobTS <= timestamp) then
+                    removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                    deletedCount = deletedCount + 1
+                    table.insert(deleted, job)
+                end
+            end
+        end
+    end
+
+    if (#deleted > 0) then
+        for from, to in batches(#deleted, 7000) do
+            rcall("ZREM", setKey, unpack(deleted, from, to))
+        end
+    end
+
+    return {deleted, deletedCount}
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/collectMetrics.lua b/node_modules/bullmq/dist/cjs/commands/includes/collectMetrics.lua
new file mode 100644
index 0000000..dde876c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/collectMetrics.lua
@@ -0,0 +1,46 @@
+--[[
+  Functions to collect metrics based on a current and previous count of jobs.
+  Granularity is fixed at 1 minute.
+]]
+--- @include "batches"
+local function collectMetrics(metaKey, dataPointsList, maxDataPoints,
+                                 timestamp)
+    -- Increment current count
+    local count = rcall("HINCRBY", metaKey, "count", 1) - 1
+
+    -- Compute how many data points we need to add to the list, N.
+    local prevTS = rcall("HGET", metaKey, "prevTS")
+
+    if not prevTS then
+        -- If prevTS is nil, set it to the current timestamp
+        rcall("HSET", metaKey, "prevTS", timestamp, "prevCount", 0)
+        return
+    end
+
+    local N = math.min(math.floor(timestamp / 60000) - math.floor(prevTS / 60000), tonumber(maxDataPoints))
+
+    if N > 0 then
+        local delta = count - rcall("HGET", metaKey, "prevCount")
+        -- If N > 1, add N-1 zeros to the list
+        if N > 1 then
+            local points = {}
+            points[1] = delta
+            for i = 2, N do
+                points[i] = 0
+            end
+
+            for from, to in batches(#points, 7000) do
+                rcall("LPUSH", dataPointsList, unpack(points, from, to))
+            end
+        else
+            -- LPUSH delta to the list
+            rcall("LPUSH", dataPointsList, delta)
+        end
+
+        -- LTRIM to keep list to its max size
+        rcall("LTRIM", dataPointsList, 0, maxDataPoints - 1)
+
+        -- update prev count with current count
+        rcall("HSET", metaKey, "prevCount", count, "prevTS", timestamp)
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJob.lua
new file mode 100644
index 0000000..664b50a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJob.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--- @include "deduplicateJobWithoutReplace"
+--- @include "removeJobKeys"
+--- @include "setDeduplicationKey"
+--- @include "storeDeduplicatedNextJob"
+
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+
+        return true
+    end
+
+    return false
+end
+
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJobWithoutReplace.lua b/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJobWithoutReplace.lua
new file mode 100644
index 0000000..5dcbdd4
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/deduplicateJobWithoutReplace.lua
@@ -0,0 +1,66 @@
+--[[
+  Function to deduplicate a job.
+]]
+--- @include "setDeduplicationKey"
+--- @include "storeDeduplicatedNextJob"
+
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/destructureJobKey.lua b/node_modules/bullmq/dist/cjs/commands/includes/destructureJobKey.lua
new file mode 100644
index 0000000..e59bb40
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/destructureJobKey.lua
@@ -0,0 +1,12 @@
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/fetchNextJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/fetchNextJob.lua
new file mode 100644
index 0000000..b8c42e3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/fetchNextJob.lua
@@ -0,0 +1,95 @@
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+
+-- Includes
+--- @include "getNextDelayedTimestamp"
+--- @include "getRateLimitTTL"
+--- @include "getTargetQueueList"
+--- @include "moveJobFromPrioritizedToActive"
+--- @include "prepareJobForProcessing"
+--- @include "promoteDelayedJobs"
+
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/filterOutJobsToIgnore.lua b/node_modules/bullmq/dist/cjs/commands/includes/filterOutJobsToIgnore.lua
new file mode 100644
index 0000000..794d3e0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/filterOutJobsToIgnore.lua
@@ -0,0 +1,14 @@
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+  
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/findPage.lua b/node_modules/bullmq/dist/cjs/commands/includes/findPage.lua
new file mode 100644
index 0000000..c11626f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/findPage.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to achieve pagination for a set or hash.
+  This function simulates pagination in the most efficient way possible
+  for a set using sscan or hscan.
+
+  The main limitation is that sets are not order preserving, so the
+  pagination is not stable. This means that if the set is modified
+  between pages, the same element may appear in different pages.
+]] -- Maximum number of elements to be returned by sscan per iteration.
+local maxCount = 100
+
+-- Finds the cursor, and returns the first elements available for the requested page.
+local function findPage(key, command, pageStart, pageSize, cursor, offset,
+                        maxIterations, fetchJobs)
+    local items = {}
+    local jobs = {}
+    local iterations = 0
+
+    repeat
+        -- Iterate over the set using sscan/hscan.
+        local result = rcall(command, key, cursor, "COUNT", maxCount)
+
+        cursor = result[1]
+        local members = result[2]
+        local step = 1
+        if command == "HSCAN" then
+            step = 2
+        end
+        
+        if #members == 0 then
+            -- If the result is empty, we can return the result.
+            return cursor, offset, items, jobs
+        end
+
+        local chunkStart = offset
+        local chunkEnd = offset + #members / step
+
+        local pageEnd = pageStart + pageSize
+
+        if chunkEnd < pageStart then
+            -- If the chunk is before the page, we can skip it.
+            offset = chunkEnd
+        elseif chunkStart > pageEnd then
+            -- If the chunk is after the page, we can return the result.
+            return cursor, offset, items, jobs
+        else
+            -- If the chunk is overlapping the page, we need to add the elements to the result.
+            for i = 1, #members, step do
+                if offset >= pageEnd then
+                    return cursor, offset, items, jobs
+                end
+                if offset >= pageStart then
+                    local index = #items + 1
+                    if fetchJobs ~= nil then
+                        jobs[#jobs+1] = rcall("HGETALL", members[i])
+                    end
+                    if step == 2 then
+                        items[index] = {members[i], members[i + 1]}
+                    else
+                        items[index] = members[i]
+                    end
+                end
+                offset = offset + 1
+            end
+        end
+        iterations = iterations + 1
+    until cursor == "0" or iterations >= maxIterations
+
+    return cursor, offset, items, jobs
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getDelayedScore.lua b/node_modules/bullmq/dist/cjs/commands/includes/getDelayedScore.lua
new file mode 100644
index 0000000..157e53b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getDelayedScore.lua
@@ -0,0 +1,25 @@
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getJobSchedulerEveryNextMillis.lua b/node_modules/bullmq/dist/cjs/commands/includes/getJobSchedulerEveryNextMillis.lua
new file mode 100644
index 0000000..e593a7e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getJobSchedulerEveryNextMillis.lua
@@ -0,0 +1,40 @@
+
+
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getJobsInZset.lua b/node_modules/bullmq/dist/cjs/commands/includes/getJobsInZset.lua
new file mode 100644
index 0000000..6e833d8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getJobsInZset.lua
@@ -0,0 +1,13 @@
+--[[
+  We use ZRANGEBYSCORE to make the case where we're deleting a limited number
+  of items in a sorted set only run a single iteration. If we simply used
+  ZRANGE, we may take a long time traversing through jobs that are within the
+  grace period.
+]]
+local function getJobsInZset(zsetKey, rangeEnd, limit)
+  if limit > 0 then
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd, "LIMIT", 0, limit)
+  else
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd)
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getNextDelayedTimestamp.lua b/node_modules/bullmq/dist/cjs/commands/includes/getNextDelayedTimestamp.lua
new file mode 100644
index 0000000..8f87d93
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getNextDelayedTimestamp.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getOrSetMaxEvents.lua b/node_modules/bullmq/dist/cjs/commands/includes/getOrSetMaxEvents.lua
new file mode 100644
index 0000000..e07291e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getOrSetMaxEvents.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getPriorityScore.lua b/node_modules/bullmq/dist/cjs/commands/includes/getPriorityScore.lua
new file mode 100644
index 0000000..df5aba8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getPriorityScore.lua
@@ -0,0 +1,8 @@
+--[[
+  Function to get priority score.
+]]
+
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getRateLimitTTL.lua b/node_modules/bullmq/dist/cjs/commands/includes/getRateLimitTTL.lua
new file mode 100644
index 0000000..1b8307c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getRateLimitTTL.lua
@@ -0,0 +1,17 @@
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getTargetQueueList.lua b/node_modules/bullmq/dist/cjs/commands/includes/getTargetQueueList.lua
new file mode 100644
index 0000000..a768bce
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getTargetQueueList.lua
@@ -0,0 +1,22 @@
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getTimestamp.lua b/node_modules/bullmq/dist/cjs/commands/includes/getTimestamp.lua
new file mode 100644
index 0000000..6cb70b5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getTimestamp.lua
@@ -0,0 +1,19 @@
+--[[
+  Function to get the latest saved timestamp.
+]]
+
+local function getTimestamp(jobKey, attributes)
+  if #attributes == 1 then
+    return rcall("HGET", jobKey, attributes[1])
+  end
+
+  local jobTs
+  for _, ts in ipairs(rcall("HMGET", jobKey, unpack(attributes))) do
+    if (ts) then
+      jobTs = ts
+      break
+    end
+  end
+
+  return jobTs
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/getZSetItems.lua b/node_modules/bullmq/dist/cjs/commands/includes/getZSetItems.lua
new file mode 100644
index 0000000..7ee2ca3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/getZSetItems.lua
@@ -0,0 +1,7 @@
+--[[
+  Function to get ZSet items.
+]]
+
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/handleDuplicatedJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/handleDuplicatedJob.lua
new file mode 100644
index 0000000..8c2f6bc
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/handleDuplicatedJob.lua
@@ -0,0 +1,26 @@
+--[[
+  Function to handle the case when job is duplicated.
+]]
+
+-- Includes
+--- @include "updateExistingJobsParent"
+
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+
+  return jobId .. "" -- convert to string
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/isJobSchedulerJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/isJobSchedulerJob.lua
new file mode 100644
index 0000000..f58cd93
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/isJobSchedulerJob.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/isLocked.lua b/node_modules/bullmq/dist/cjs/commands/includes/isLocked.lua
new file mode 100644
index 0000000..6fb1b5a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/isLocked.lua
@@ -0,0 +1,34 @@
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+
+  returns:
+    boolean
+]]
+--- @include "destructureJobKey"
+
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/isQueueMaxed.lua b/node_modules/bullmq/dist/cjs/commands/includes/isQueueMaxed.lua
new file mode 100644
index 0000000..d0a81ae
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/isQueueMaxed.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to check if queue is maxed or not.
+]]
+local function isQueueMaxed(queueMetaKey, activeKey)
+  local maxConcurrency = rcall("HGET", queueMetaKey, "concurrency")
+
+  if maxConcurrency then
+    local activeCount = rcall("LLEN", activeKey)
+    if activeCount >= tonumber(maxConcurrency) then
+      return true
+    end
+  end
+
+  return false
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/isQueuePaused.lua b/node_modules/bullmq/dist/cjs/commands/includes/isQueuePaused.lua
new file mode 100644
index 0000000..66d433a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/isQueuePaused.lua
@@ -0,0 +1,7 @@
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/isQueuePausedOrMaxed.lua b/node_modules/bullmq/dist/cjs/commands/includes/isQueuePausedOrMaxed.lua
new file mode 100644
index 0000000..89d8a0f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/isQueuePausedOrMaxed.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveChildFromDependenciesIfNeeded.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveChildFromDependenciesIfNeeded.lua
new file mode 100644
index 0000000..fbb1485
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveChildFromDependenciesIfNeeded.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to recursively move from waitingChildren to failed.
+]]
+
+-- Includes
+--- @include "moveParentToWaitIfNoPendingDependencies"
+--- @include "moveParentToWaitIfNeeded"
+--- @include "moveParentToWait"
+
+local handleChildFailureAndMoveParentToWait = function (parentQueueKey, parentKey, parentId, jobIdKey, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    local parentDelayedKey = parentQueueKey .. ":delayed"
+    local parentWaitingChildrenOrDelayedKey
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentWaitingChildrenKey
+    elseif rcall("ZSCORE", parentDelayedKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentDelayedKey
+      rcall("HSET", parentKey, "delay", 0)
+    end
+
+    if parentWaitingChildrenOrDelayedKey then
+      rcall("ZREM", parentWaitingChildrenOrDelayedKey, parentId)
+      local deferredFailure = "child " .. jobIdKey .. " failed"
+      rcall("HSET", parentKey, "defa", deferredFailure)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    else
+      if not rcall("ZSCORE", parentQueueKey .. ":failed", parentId) then
+        local deferredFailure = "child " .. jobIdKey .. " failed"
+        rcall("HSET", parentKey, "defa", deferredFailure)
+      end
+    end
+  end
+end
+
+local moveChildFromDependenciesIfNeeded = function (rawParentData, childKey, failedReason, timestamp)
+  if rawParentData then
+    local parentData = cjson.decode(rawParentData)
+    local parentKey = parentData['queueKey'] .. ':' .. parentData['id']
+    local parentDependenciesChildrenKey = parentKey .. ":dependencies"
+    if parentData['fpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentUnsuccessfulChildrenKey = parentKey .. ":unsuccessful"
+        rcall("ZADD", parentUnsuccessfulChildrenKey, timestamp, childKey)
+        handleChildFailureAndMoveParentToWait(
+          parentData['queueKey'],
+          parentKey,
+          parentData['id'],
+          childKey,
+          timestamp
+        )
+      end
+    elseif parentData['cpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentFailedChildrenKey = parentKey .. ":failed"
+        rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        moveParentToWaitIfNeeded(parentData['queueKey'], parentKey, parentData['id'], timestamp)
+      end
+    elseif parentData['idof'] or parentData['rdof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        moveParentToWaitIfNoPendingDependencies(parentData['queueKey'], parentDependenciesChildrenKey,
+          parentKey, parentData['id'], timestamp)
+        if parentData['idof'] then
+          local parentFailedChildrenKey = parentKey .. ":failed"
+          rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        end
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveJobFromPrioritizedToActive.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveJobFromPrioritizedToActive.lua
new file mode 100644
index 0000000..fd6dd04
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveJobFromPrioritizedToActive.lua
@@ -0,0 +1,13 @@
+--[[
+  Function to move job from prioritized state to active.
+]]
+
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveJobToWait.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveJobToWait.lua
new file mode 100644
index 0000000..8aa3531
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveJobToWait.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to move job to wait to be picked up by a waiting worker.
+]]
+
+-- Includes
+--- @include "addJobInTargetList"
+--- @include "getTargetQueueList"
+
+local function moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey,
+  jobId, pushCmd)
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+  addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+
+  rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId", jobId, 'prev', 'active')
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWait.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWait.lua
new file mode 100644
index 0000000..a7b232c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWait.lua
@@ -0,0 +1,45 @@
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+
+-- Includes
+--- @include "addDelayMarkerIfNeeded"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "isQueuePausedOrMaxed"
+--- @include "getTargetQueueList"
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNeeded.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNeeded.lua
new file mode 100644
index 0000000..7425359
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNeeded.lua
@@ -0,0 +1,14 @@
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--- @include "moveParentToWait"
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNoPendingDependencies.lua b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNoPendingDependencies.lua
new file mode 100644
index 0000000..423160c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/moveParentToWaitIfNoPendingDependencies.lua
@@ -0,0 +1,13 @@
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--- @include "moveParentToWaitIfNeeded"
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/prepareJobForProcessing.lua b/node_modules/bullmq/dist/cjs/commands/includes/prepareJobForProcessing.lua
new file mode 100644
index 0000000..71b96df
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/prepareJobForProcessing.lua
@@ -0,0 +1,49 @@
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+
+  local optionalValues = {}
+
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+
+  addBaseMarkerIfNeeded(markerKey, false)
+
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/promoteDelayedJobs.lua b/node_modules/bullmq/dist/cjs/commands/includes/promoteDelayedJobs.lua
new file mode 100644
index 0000000..0b9fe59
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/promoteDelayedJobs.lua
@@ -0,0 +1,44 @@
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+
+     Events:
+      'waiting'
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "getPriorityScore"
+
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/pushBackJobWithPriority.lua b/node_modules/bullmq/dist/cjs/commands/includes/pushBackJobWithPriority.lua
new file mode 100644
index 0000000..5d5a292
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/pushBackJobWithPriority.lua
@@ -0,0 +1,9 @@
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua
new file mode 100644
index 0000000..8fc6409
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua
@@ -0,0 +1,23 @@
+--[[
+  Function to remove deduplication key if needed
+  when a job is moved to completed or failed states.
+]]
+
+local function removeDeduplicationKeyIfNeededOnFinalization(prefixKey,
+  deduplicationId, jobId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local pttl = rcall("PTTL", deduplicationKey)
+
+    if pttl == 0 then
+      return rcall("DEL", deduplicationKey)
+    end
+
+    if pttl == -1 then
+      local currentJobId = rcall('GET', deduplicationKey)
+      if currentJobId and currentJobId == jobId then
+        return rcall("DEL", deduplicationKey)
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua
new file mode 100644
index 0000000..bf8e720
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJob.lua
new file mode 100644
index 0000000..7a80911
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJob.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to remove job.
+]]
+
+-- Includes
+--- @include "removeDeduplicationKeyIfNeededOnRemoval"
+--- @include "removeJobKeys"
+--- @include "removeParentDependencyKey"
+
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobFromAnyState.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobFromAnyState.lua
new file mode 100644
index 0000000..85acc29
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobFromAnyState.lua
@@ -0,0 +1,35 @@
+--[[
+  Function to remove from any state.
+
+  returns:
+    prev state
+]]
+
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+
+  return "unknown"
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobKeys.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobKeys.lua
new file mode 100644
index 0000000..453d0de
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobKeys.lua
@@ -0,0 +1,8 @@
+--[[
+  Function to remove job keys.
+]]
+
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobWithChildren.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobWithChildren.lua
new file mode 100644
index 0000000..b2bf725
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobWithChildren.lua
@@ -0,0 +1,96 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+
+    Events:
+      'removed'
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "destructureJobKey"
+--- @include "getOrSetMaxEvents"
+--- @include "isJobSchedulerJob"
+--- @include "removeDeduplicationKeyIfNeededOnRemoval"
+--- @include "removeJobFromAnyState"
+--- @include "removeJobKeys"
+--- @include "removeParentDependencyKey"
+--- @include "isLocked"
+
+local removeJobChildren
+local removeJobWithChildren
+
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobs.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobs.lua
new file mode 100644
index 0000000..58b67ab
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobs.lua
@@ -0,0 +1,13 @@
+--[[
+  Functions to remove jobs.
+]]
+
+-- Includes
+--- @include "removeJob"
+
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxAge.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxAge.lua
new file mode 100644
index 0000000..a3aba06
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxAge.lua
@@ -0,0 +1,24 @@
+--[[
+  Functions to remove jobs by max age.
+]]
+
+-- Includes
+--- @include "batches"
+--- @include "removeJob"
+
+local function removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+  local start = timestamp - maxAge * 1000
+  local jobIds = rcall("ZREVRANGEBYSCORE", targetSet, start, "-inf", "LIMIT", 0, maxLimit)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  if #jobIds > 0 then
+    if #jobIds < maxLimit then
+      rcall("ZREMRANGEBYSCORE", targetSet, "-inf", start)
+    else
+      for from, to in batches(#jobIds, 7000) do
+        rcall("ZREM", targetSet, unpack(jobIds, from, to))
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxCount.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxCount.lua
new file mode 100644
index 0000000..af52c61
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeJobsByMaxCount.lua
@@ -0,0 +1,15 @@
+--[[
+  Functions to remove jobs by max count.
+]]
+
+-- Includes
+--- @include "removeJob"
+
+local function removeJobsByMaxCount(maxCount, targetSet, prefix)
+  local start = maxCount
+  local jobIds = rcall("ZREVRANGE", targetSet, start, -1)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  rcall("ZREMRANGEBYRANK", targetSet, 0, -(maxCount + 1))
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeListJobs.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeListJobs.lua
new file mode 100644
index 0000000..f6dca68
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeListJobs.lua
@@ -0,0 +1,23 @@
+--[[
+  Functions to remove jobs.
+]]
+
+-- Includes
+--- @include "filterOutJobsToIgnore"
+--- @include "removeJobs"
+
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeLock.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeLock.lua
new file mode 100644
index 0000000..d7335f6
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeLock.lua
@@ -0,0 +1,19 @@
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeParentDependencyKey.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeParentDependencyKey.lua
new file mode 100644
index 0000000..29ab15a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeParentDependencyKey.lua
@@ -0,0 +1,90 @@
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+
+-- Includes
+--- @include "addJobInTargetList"
+--- @include "destructureJobKey"
+--- @include "getTargetQueueList"
+--- @include "removeJobKeys"
+
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/removeZSetJobs.lua b/node_modules/bullmq/dist/cjs/commands/includes/removeZSetJobs.lua
new file mode 100644
index 0000000..399627f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/removeZSetJobs.lua
@@ -0,0 +1,21 @@
+-- Includes
+--- @include "batches"
+--- @include "filterOutJobsToIgnore"
+--- @include "getZSetItems"
+--- @include "removeJobs"  
+
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/requeueDeduplicatedJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/requeueDeduplicatedJob.lua
new file mode 100644
index 0000000..7700c6f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/requeueDeduplicatedJob.lua
@@ -0,0 +1,65 @@
+--[[
+  Function to create a new job from stored dedup-next data
+  when a deduplicated job with keepLastIfActive finishes.
+  At most one next job is created per deduplication ID.
+  Multiple triggers while active overwrite the dedup-next data,
+  so only the latest data is used.
+]]
+
+-- Includes
+--- @include "getOrSetMaxEvents"
+--- @include "setDeduplicationKey"
+--- @include "storeAndEnqueueJob"
+
+local function requeueDeduplicatedJob(prefix, deduplicationId, eventStreamKey,
+    metaKey, activeKey, waitKey, pausedKey, markerKey, prioritizedKey,
+    priorityCounterKey, delayedKey, timestamp)
+  local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+  if rcall("EXISTS", deduplicationNextKey) == 1 then
+    local nextData = rcall("HMGET", deduplicationNextKey,
+        "name", "data", "opts", "pk", "pd", "pdk", "rjk", "jid")
+
+    -- Always increment the counter to keep it monotonic
+    local nextId = rcall("INCR", prefix .. "id") .. ""
+    local storedJobId = nextData[8] -- index 8 = "jid" (8th field in the HMGET call above)
+    local newJobId
+    if storedJobId then
+      newJobId = storedJobId
+    else
+      newJobId = nextId
+    end
+    local newJobIdKey = prefix .. newJobId
+    local newOpts = cjson.decode(nextData[3])
+    local deduplicationKey = prefix .. "de:" .. deduplicationId
+
+    local parentKey = nextData[4] or nil
+    local parentData = nextData[5] or nil
+    local parentDependenciesKey = nextData[6] or nil
+    local repeatJobKey = nextData[7] or nil
+
+    -- Set dedup key for the new job (without TTL when keepLastIfActive,
+    -- so the key outlives the job's active duration)
+    local deOpts = newOpts['de']
+    if deOpts and deOpts['keepLastIfActive'] then
+      rcall('SET', deduplicationKey, newJobId)
+    else
+      setDeduplicationKey(deduplicationKey, newJobId, deOpts)
+    end
+
+    -- Store and enqueue using the shared helper (handles priority/lifo/delayed)
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    storeAndEnqueueJob(eventStreamKey, newJobIdKey, newJobId, nextData[1], nextData[2],
+        newOpts, timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+        waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+        priorityCounterKey, delayedKey, markerKey)
+
+    -- Register as child dependency if the job has a parent
+    if parentDependenciesKey then
+      rcall("SADD", parentDependenciesKey, newJobIdKey)
+    end
+
+    -- Only delete the dedup-next hash after the job is fully created,
+    -- so that if any step above errors, the data is not permanently lost.
+    rcall("DEL", deduplicationNextKey)
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/setDeduplicationKey.lua b/node_modules/bullmq/dist/cjs/commands/includes/setDeduplicationKey.lua
new file mode 100644
index 0000000..d792cae
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/setDeduplicationKey.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/storeAndEnqueueJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/storeAndEnqueueJob.lua
new file mode 100644
index 0000000..5666e81
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/storeAndEnqueueJob.lua
@@ -0,0 +1,42 @@
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+
+  Returns delay, priority from storeJob.
+]]
+
+-- Includes
+--- @include "addDelayedJob"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "getTargetQueueList"
+--- @include "storeJob"
+
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+
+  return delay, priority
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/storeDeduplicatedNextJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/storeDeduplicatedNextJob.lua
new file mode 100644
index 0000000..ec8bfcc
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/storeDeduplicatedNextJob.lua
@@ -0,0 +1,58 @@
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--- @include "checkItemInList"
+
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/storeJob.lua b/node_modules/bullmq/dist/cjs/commands/includes/storeJob.lua
new file mode 100644
index 0000000..cab3fa1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/storeJob.lua
@@ -0,0 +1,36 @@
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+
+    return delay, priority
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/storeJobScheduler.lua b/node_modules/bullmq/dist/cjs/commands/includes/storeJobScheduler.lua
new file mode 100644
index 0000000..6f5c10d
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/storeJobScheduler.lua
@@ -0,0 +1,66 @@
+--[[
+  Function to store a job scheduler
+]]
+local function storeJobScheduler(schedulerId, schedulerKey, repeatKey, nextMillis, opts,
+  templateData, templateOpts)
+  rcall("ZADD", repeatKey, nextMillis, schedulerId)
+
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+
+  if opts['limit'] then
+    table.insert(optionalValues, "limit")
+    table.insert(optionalValues, opts['limit'])
+  end
+
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+
+  if opts['startDate'] then
+    table.insert(optionalValues, "startDate")
+    table.insert(optionalValues, opts['startDate'])
+  end
+
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+
+  if opts['offset'] then
+    table.insert(optionalValues, "offset")
+    table.insert(optionalValues, opts['offset'])
+  else
+    local offset = rcall("HGET", schedulerKey, "offset")
+    if offset then
+      table.insert(optionalValues, "offset")
+      table.insert(optionalValues, tonumber(offset))
+    end
+  end
+
+  local jsonTemplateOpts = cjson.encode(templateOpts)
+  if jsonTemplateOpts and jsonTemplateOpts ~= '{}' then
+    table.insert(optionalValues, "opts")
+    table.insert(optionalValues, jsonTemplateOpts)
+  end
+
+  if templateData and templateData ~= '{}' then
+    table.insert(optionalValues, "data")
+    table.insert(optionalValues, templateData)
+  end
+
+  table.insert(optionalValues, "ic")
+  table.insert(optionalValues, rcall("HGET", schedulerKey, "ic") or 1)
+
+  rcall("DEL", schedulerKey) -- remove all attributes and then re-insert new ones
+  rcall("HMSET", schedulerKey, "name", opts['name'], unpack(optionalValues))
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/trimEvents.lua b/node_modules/bullmq/dist/cjs/commands/includes/trimEvents.lua
new file mode 100644
index 0000000..df3c58f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/trimEvents.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to trim events, default 10000.
+]]
+
+-- Includes
+--- @include "getOrSetMaxEvents"
+
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/updateExistingJobsParent.lua b/node_modules/bullmq/dist/cjs/commands/includes/updateExistingJobsParent.lua
new file mode 100644
index 0000000..35921e0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/updateExistingJobsParent.lua
@@ -0,0 +1,27 @@
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+
+-- Includes
+--- @include "updateParentDepsIfNeeded"
+
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/updateJobFields.lua b/node_modules/bullmq/dist/cjs/commands/includes/updateJobFields.lua
new file mode 100644
index 0000000..8b378a4
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/updateJobFields.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/includes/updateParentDepsIfNeeded.lua b/node_modules/bullmq/dist/cjs/commands/includes/updateParentDepsIfNeeded.lua
new file mode 100644
index 0000000..80c0594
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/includes/updateParentDepsIfNeeded.lua
@@ -0,0 +1,13 @@
+--[[
+  Validate and move or add dependencies to parent.
+]]
+
+-- Includes
+--- @include "moveParentToWaitIfNoPendingDependencies"
+
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/isFinished-3.lua b/node_modules/bullmq/dist/cjs/commands/isFinished-3.lua
new file mode 100644
index 0000000..85b074a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/isFinished-3.lua
@@ -0,0 +1,48 @@
+--[[
+  Checks if a job is finished (.i.e. is in the completed or failed set)
+
+  Input: 
+    KEYS[1] completed key
+    KEYS[2] failed key
+    KEYS[3] job key
+
+    ARGV[1] job id
+    ARGV[2] return value?
+  Output:
+    0 - Not finished.
+    1 - Completed.
+    2 - Failed.
+   -1 - Missing job. 
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[3]) ~= 1 then
+  if ARGV[2] == "1" then
+
+    return {-1,"Missing key for job " .. KEYS[3] .. ". isFinished"}
+  end  
+  return -1
+end
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local returnValue = rcall("HGET", KEYS[3], "returnvalue")
+
+    return {1,returnValue}
+  end
+  return 1
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local failedReason = rcall("HGET", KEYS[3], "failedReason")
+
+    return {2,failedReason}
+  end
+  return 2
+end
+
+if ARGV[2] == "1" then
+  return {0}
+end
+
+return 0
diff --git a/node_modules/bullmq/dist/cjs/commands/isJobInList-1.lua b/node_modules/bullmq/dist/cjs/commands/isJobInList-1.lua
new file mode 100644
index 0000000..f0ccc7a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/isJobInList-1.lua
@@ -0,0 +1,16 @@
+--[[
+  Checks if job is in a given list.
+
+  Input:
+    KEYS[1]
+    ARGV[1]
+
+  Output:
+    1 if element found in the list.
+]]
+
+-- Includes
+--- @include "includes/checkItemInList"
+
+local items = redis.call("LRANGE", KEYS[1] , 0, -1)
+return checkItemInList(items, ARGV[1])
diff --git a/node_modules/bullmq/dist/cjs/commands/isMaxed-2.lua b/node_modules/bullmq/dist/cjs/commands/isMaxed-2.lua
new file mode 100644
index 0000000..b01e791
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/isMaxed-2.lua
@@ -0,0 +1,17 @@
+--[[
+  Checks if queue is maxed.
+
+  Input:
+    KEYS[1] meta key
+    KEYS[2] active key
+
+  Output:
+    1 if element found in the list.
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/isQueueMaxed"
+
+return isQueueMaxed(KEYS[1], KEYS[2])
diff --git a/node_modules/bullmq/dist/cjs/commands/moveJobFromActiveToWait-9.lua b/node_modules/bullmq/dist/cjs/commands/moveJobFromActiveToWait-9.lua
new file mode 100644
index 0000000..2077c4b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveJobFromActiveToWait-9.lua
@@ -0,0 +1,67 @@
+--[[
+  Function to move job from active state to wait.
+  Input:
+    KEYS[1]  active key
+    KEYS[2]  wait key
+    
+    KEYS[3]  stalled key
+    KEYS[4]  paused key
+    KEYS[5]  meta key
+    KEYS[6]  limiter key
+    KEYS[7]  prioritized key
+    KEYS[8]  marker key
+    KEYS[9]  event key
+
+    ARGV[1] job id
+    ARGV[2] lock token
+    ARGV[3] job id key
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/pushBackJobWithPriority"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/removeLock"
+
+local jobId = ARGV[1]
+local token = ARGV[2]
+local jobKey = ARGV[3]
+
+if rcall("EXISTS", jobKey) == 0 then
+  return -1
+end
+
+local errorCode = removeLock(jobKey, KEYS[3], token, jobId)
+if errorCode < 0 then
+  return errorCode
+end
+
+local metaKey = KEYS[5]
+local removed = rcall("LREM", KEYS[1], 1, jobId)
+if removed > 0 then
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[1], KEYS[2], KEYS[4])
+
+  local priority = tonumber(rcall("HGET", ARGV[3], "priority")) or 0
+
+  if priority > 0 then
+    pushBackJobWithPriority(KEYS[7], priority, jobId)
+  else
+    addJobInTargetList(target, KEYS[8], "RPUSH", isPausedOrMaxed, jobId)
+  end
+
+  local maxEvents = getOrSetMaxEvents(metaKey)
+
+  -- Emit waiting event
+  rcall("XADD", KEYS[9], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", jobId, "prev", "active")
+end
+
+local pttl = rcall("PTTL", KEYS[6])
+
+if pttl > 0 then
+  return pttl
+else
+  return 0
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/moveJobsToWait-8.lua b/node_modules/bullmq/dist/cjs/commands/moveJobsToWait-8.lua
new file mode 100644
index 0000000..15e99c6
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveJobsToWait-8.lua
@@ -0,0 +1,73 @@
+--[[
+  Move completed, failed or delayed jobs to wait.
+
+  Note: Does not support jobs with priorities.
+
+  Input:
+    KEYS[1] base key
+    KEYS[2] events stream
+    KEYS[3] state key (failed, completed, delayed)
+    KEYS[4] 'wait'
+    KEYS[5] 'paused'
+    KEYS[6] 'meta'
+    KEYS[7] 'active'
+    KEYS[8] 'marker'
+
+    ARGV[1] count
+    ARGV[2] timestamp
+    ARGV[3] prev state
+
+  Output:
+    1  means the operation is not completed
+    0  means the operation is completed
+]]
+local maxCount = tonumber(ARGV[1])
+local timestamp = tonumber(ARGV[2])
+
+local rcall = redis.call;
+
+-- Includes
+--- @include "includes/addBaseMarkerIfNeeded"
+--- @include "includes/batches"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+
+local metaKey = KEYS[6]
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[4], KEYS[5])
+
+local jobs = rcall('ZRANGEBYSCORE', KEYS[3], 0, timestamp, 'LIMIT', 0, maxCount)
+if (#jobs > 0) then
+
+    if ARGV[3] == "failed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "failedReason")
+        end
+    elseif ARGV[3] == "completed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "returnvalue")
+        end
+    end
+
+    local maxEvents = getOrSetMaxEvents(metaKey)
+
+    for i, key in ipairs(jobs) do
+        -- Emit waiting event
+        rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event",
+              "waiting", "jobId", key, "prev", ARGV[3]);
+    end
+
+    for from, to in batches(#jobs, 7000) do
+        rcall("ZREM", KEYS[3], unpack(jobs, from, to))
+        rcall("LPUSH", target, unpack(jobs, from, to))
+    end
+
+    addBaseMarkerIfNeeded(KEYS[8], isPausedOrMaxed)
+end
+
+maxCount = maxCount - #jobs
+
+if (maxCount <= 0) then return 1 end
+
+return 0
diff --git a/node_modules/bullmq/dist/cjs/commands/moveStalledJobsToWait-8.lua b/node_modules/bullmq/dist/cjs/commands/moveStalledJobsToWait-8.lua
new file mode 100644
index 0000000..e7e4a65
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveStalledJobsToWait-8.lua
@@ -0,0 +1,113 @@
+--[[
+  Move stalled jobs to wait.
+
+    Input:
+      KEYS[1] 'stalled' (SET)
+      KEYS[2] 'wait',   (LIST)
+      KEYS[3] 'active', (LIST)
+      KEYS[4] 'stalled-check', (KEY)
+      KEYS[5] 'meta', (KEY)
+      KEYS[6] 'paused', (LIST)
+      KEYS[7] 'marker'
+      KEYS[8] 'event stream' (STREAM)
+
+      ARGV[1]  Max stalled job count
+      ARGV[2]  queue.toKey('')
+      ARGV[3]  timestamp
+      ARGV[4]  max check time
+
+    Events:
+      'stalled' with stalled job id.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/batches"
+--- @include "includes/moveJobToWait"
+--- @include "includes/trimEvents"
+
+local stalledKey = KEYS[1]
+local waitKey = KEYS[2]
+local activeKey = KEYS[3]
+local stalledCheckKey = KEYS[4]
+local metaKey = KEYS[5]
+local pausedKey = KEYS[6]
+local markerKey = KEYS[7]
+local eventStreamKey = KEYS[8]
+local maxStalledJobCount = tonumber(ARGV[1])
+local queueKeyPrefix = ARGV[2]
+local timestamp = ARGV[3]
+local maxCheckTime = ARGV[4]
+
+if rcall("EXISTS", stalledCheckKey) == 1 then
+    return {}
+end
+
+rcall("SET", stalledCheckKey, timestamp, "PX", maxCheckTime)
+
+-- Trim events before emitting them to avoid trimming events emitted in this script
+trimEvents(metaKey, eventStreamKey)
+
+-- Move all stalled jobs to wait
+local stalling = rcall('SMEMBERS', stalledKey)
+local stalled = {}
+if (#stalling > 0) then
+    rcall('DEL', stalledKey)
+
+    -- Remove from active list
+    for i, jobId in ipairs(stalling) do
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            -- If the jobId is a delay marker ID we just remove it.
+            rcall("LREM", activeKey, 1, jobId)
+        else
+            local jobKey = queueKeyPrefix .. jobId
+
+            -- Check that the lock is also missing, then we can handle this job as really stalled.
+            if (rcall("EXISTS", jobKey .. ":lock") == 0) then
+                --  Remove from the active queue.
+                local removed = rcall("LREM", activeKey, 1, jobId)
+
+                if (removed > 0) then
+                    -- If this job has been stalled too many times, such as if it crashes the worker, then fail it.
+                    local stalledCount = rcall("HINCRBY", jobKey, "stc", 1)
+                    
+                    -- Check if this is a repeatable job by looking at job options
+                    local jobOpts = rcall("HGET", jobKey, "opts")
+                    local isRepeatableJob = false
+                    if jobOpts then
+                        local opts = cjson.decode(jobOpts)
+                        if opts and opts["repeat"] then
+                            isRepeatableJob = true
+                        end
+                    end
+                    
+                    -- Only fail job if it exceeds stall limit AND is not a repeatable job
+                    if stalledCount > maxStalledJobCount and not isRepeatableJob then
+                        local failedReason = "job stalled more than allowable limit"
+                        rcall("HSET", jobKey, "defa", failedReason)
+                    end
+                    
+                    moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey, jobId,
+                        "RPUSH")
+
+                    -- Emit the stalled event
+                    rcall("XADD", eventStreamKey, "*", "event", "stalled", "jobId", jobId)
+                    table.insert(stalled, jobId)
+                end
+            end
+        end
+    end
+end
+
+-- Mark potentially stalled jobs
+local active = rcall('LRANGE', activeKey, 0, -1)
+
+if (#active > 0) then
+    for from, to in batches(#active, 7000) do
+        rcall('SADD', stalledKey, unpack(active, from, to))
+    end
+end
+
+return stalled
diff --git a/node_modules/bullmq/dist/cjs/commands/moveToActive-11.lua b/node_modules/bullmq/dist/cjs/commands/moveToActive-11.lua
new file mode 100644
index 0000000..3eaa2f1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveToActive-11.lua
@@ -0,0 +1,97 @@
+--[[
+  Move next job to be processed to active, lock it and fetch its data. The job
+  may be delayed, in that case we need to move it to the delayed set instead.
+
+  This operation guarantees that the worker owns the job during the lock
+  expiration time. The worker is responsible of keeping the lock fresh
+  so that no other worker picks this job again.
+
+  Input:
+    KEYS[1] wait key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] stream events key
+    KEYS[5] stalled key
+
+    -- Rate limiting
+    KEYS[6] rate limiter key
+    KEYS[7] delayed key
+
+    -- Delayed jobs
+    KEYS[8] paused key
+    KEYS[9] meta key
+    KEYS[10] pc priority counter
+
+    -- Marker
+    KEYS[11] marker key
+
+    -- Arguments
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] opts
+
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+    opts - name - worker name
+]]
+local rcall = redis.call
+local waitKey = KEYS[1]
+local activeKey = KEYS[2]
+local eventStreamKey = KEYS[4]
+local rateLimiterKey = KEYS[6]
+local delayedKey = KEYS[7]
+local opts = cmsgpack.unpack(ARGV[3])
+
+-- Includes
+--- @include "includes/getNextDelayedTimestamp"
+--- @include "includes/getRateLimitTTL"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/moveJobFromPrioritizedToActive"
+--- @include "includes/prepareJobForProcessing"
+--- @include "includes/promoteDelayedJobs"
+
+local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration = getTargetQueueList(KEYS[9],
+    activeKey, waitKey, KEYS[8])
+
+-- Check if there are delayed jobs that we can move to wait.
+local markerKey = KEYS[11]
+promoteDelayedJobs(delayedKey, markerKey, target, KEYS[3], eventStreamKey, ARGV[1],
+                   ARGV[2], KEYS[10], isPausedOrMaxed)
+
+local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+
+-- Check if we are rate limited first.
+if expireTime > 0 then return {0, 0, expireTime, 0} end
+
+-- paused or maxed queue
+if isPausedOrMaxed then return {0, 0, 0, 0} end
+
+local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+
+-- no job ID, try non-blocking move from wait to active
+local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+
+-- Markers in waitlist DEPRECATED in v5: Will be completely removed in v6.
+if jobId and string.sub(jobId, 1, 2) == "0:" then
+    rcall("LREM", activeKey, 1, jobId)
+    jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+end
+
+if jobId then
+    return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                   maxJobs, limiterDuration, markerKey, opts)
+else
+    jobId = moveJobFromPrioritizedToActive(KEYS[3], activeKey, KEYS[10])
+    if jobId then
+        return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                       maxJobs, limiterDuration, markerKey, opts)
+    end
+end
+
+-- Return the timestamp for the next delayed job if any.
+local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+if nextTimestamp ~= nil then return {0, 0, 0, nextTimestamp} end
+
+return {0, 0, 0, 0}
diff --git a/node_modules/bullmq/dist/cjs/commands/moveToDelayed-12.lua b/node_modules/bullmq/dist/cjs/commands/moveToDelayed-12.lua
new file mode 100644
index 0000000..6e21448
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveToDelayed-12.lua
@@ -0,0 +1,97 @@
+--[[
+  Moves job from active to delayed set.
+
+  Input:
+    KEYS[1] marker key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] delayed key
+    KEYS[5] job key
+    KEYS[6] events stream
+    KEYS[7] meta key
+    KEYS[8] stalled key
+    KEYS[9] wait key
+    KEYS[10] rate limiter key
+    KEYS[11] paused key
+    KEYS[12] pc priority counter
+
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] queue token
+    ARGV[5] delay value
+    ARGV[6] skip attempt
+    ARGV[7] optional job fields to update
+    ARGV[8] fetch next?
+    ARGV[9] opts
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in active set.
+
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+--- @include "includes/fetchNextJob"
+--- @include "includes/getDelayedScore"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/removeLock"
+--- @include "includes/updateJobFields"
+
+local jobKey = KEYS[5]
+local markerKey = KEYS[1]
+local metaKey = KEYS[7]
+local token = ARGV[4] 
+if rcall("EXISTS", jobKey) == 1 then
+    local errorCode = removeLock(jobKey, KEYS[8], token, ARGV[3])
+    if errorCode < 0 then
+        return errorCode
+    end
+
+    updateJobFields(jobKey, ARGV[7])
+    
+    local delayedKey = KEYS[4]
+    local jobId = ARGV[3]
+    local delay = tonumber(ARGV[5])
+
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if numRemovedElements < 1 then return -3 end
+
+    local score, delayedTimestamp = getDelayedScore(delayedKey, ARGV[2], delay)
+
+    if ARGV[6] == "0" then
+        rcall("HINCRBY", jobKey, "atm", 1)
+    end
+
+    rcall("HSET", jobKey, "delay", ARGV[5])
+
+    local maxEvents = getOrSetMaxEvents(metaKey)
+
+    rcall("ZADD", delayedKey, score, jobId)
+    rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+          "jobId", jobId, "delay", delayedTimestamp)
+
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[8] == "1") then
+        local opts = cmsgpack.unpack(ARGV[9])
+        local result = fetchNextJob(KEYS[9], KEYS[2], KEYS[3], KEYS[6],
+            KEYS[10], KEYS[4], KEYS[11], metaKey, KEYS[12], markerKey,
+            ARGV[1], ARGV[2], opts)
+        if result and type(result[1]) == "table" then
+            return result
+        end
+    end
+
+    -- Check if we need to push a marker job to wake up sleeping workers.
+    addDelayMarkerIfNeeded(markerKey, delayedKey)
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/moveToFinished-14.lua b/node_modules/bullmq/dist/cjs/commands/moveToFinished-14.lua
new file mode 100644
index 0000000..8cb324a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveToFinished-14.lua
@@ -0,0 +1,239 @@
+--[[
+  Move job from active to a finished status (completed or failed)
+  A job can only be moved to completed if it was active.
+  The job must be locked before it can be moved to a finished status,
+  and the lock must be released in this script.
+
+    Input:
+      KEYS[1] wait key
+      KEYS[2] active key
+      KEYS[3] prioritized key
+      KEYS[4] event stream key
+      KEYS[5] stalled key
+
+      -- Rate limiting
+      KEYS[6] rate limiter key
+      KEYS[7] delayed key
+
+      KEYS[8] paused key
+      KEYS[9] meta key
+      KEYS[10] pc priority counter
+
+      KEYS[11] completed/failed key
+      KEYS[12] jobId key
+      KEYS[13] metrics key
+      KEYS[14] marker key
+
+      ARGV[1]  jobId
+      ARGV[2]  timestamp
+      ARGV[3]  msg property returnvalue / failedReason
+      ARGV[4]  return value / failed reason
+      ARGV[5]  target (completed/failed)
+      ARGV[6]  fetch next?
+      ARGV[7]  keys prefix
+      ARGV[8]  opts
+      ARGV[9]  job fields to update
+
+      opts - token - lock token
+      opts - keepJobs
+      opts - lockDuration - lock duration in milliseconds
+      opts - attempts max attempts
+      opts - maxMetricsSize
+      opts - fpof - fail parent on fail
+      opts - cpof - continue parent on fail
+      opts - idof - ignore dependency on fail
+      opts - rdof - remove dependency on fail
+      opts - name - worker name
+
+    Output:
+      0 OK
+      -1 Missing key.
+      -2 Missing lock.
+      -3 Job not in active set
+      -4 Job has pending children
+      -6 Lock is not owned by this client
+      -9 Job has failed children
+
+    Events:
+      'completed/failed'
+]]
+local rcall = redis.call
+
+--- Includes
+--- @include "includes/collectMetrics"
+--- @include "includes/fetchNextJob"
+--- @include "includes/moveChildFromDependenciesIfNeeded"
+--- @include "includes/removeDeduplicationKeyIfNeededOnFinalization"
+--- @include "includes/removeJobKeys"
+--- @include "includes/removeJobsByMaxAge"
+--- @include "includes/removeJobsByMaxCount"
+--- @include "includes/removeLock"
+--- @include "includes/removeParentDependencyKey"
+--- @include "includes/requeueDeduplicatedJob"
+--- @include "includes/trimEvents"
+--- @include "includes/updateParentDepsIfNeeded"
+--- @include "includes/updateJobFields"
+
+local jobIdKey = KEYS[12]
+if rcall("EXISTS", jobIdKey) == 1 then -- Make sure job exists
+    -- Make sure it does not have pending dependencies
+    -- It must happen before removing lock
+    if ARGV[5] == "completed" then
+        if rcall("SCARD", jobIdKey .. ":dependencies") ~= 0 then
+            return -4
+        end
+
+        if rcall("ZCARD", jobIdKey .. ":unsuccessful") ~= 0 then
+            return -9
+        end
+    end
+
+    local opts = cmsgpack.unpack(ARGV[8])
+
+    local token = opts['token']
+
+    local errorCode = removeLock(jobIdKey, KEYS[5], token, ARGV[1])
+    if errorCode < 0 then
+        return errorCode
+    end
+
+    updateJobFields(jobIdKey, ARGV[9]);
+
+    local attempts = opts['attempts']
+    local maxMetricsSize = opts['maxMetricsSize']
+    local maxCount = opts['keepJobs']['count']
+    local maxAge = opts['keepJobs']['age']
+    local maxLimit = opts['keepJobs']['limit'] or 1000
+
+    local jobAttributes = rcall("HMGET", jobIdKey, "parentKey", "parent", "deid")
+    local parentKey = jobAttributes[1] or ""
+    local parentId = ""
+    local parentQueueKey = ""
+    if jobAttributes[2] then -- TODO: need to revisit this logic if it's still needed
+        local jsonDecodedParent = cjson.decode(jobAttributes[2])
+        parentId = jsonDecodedParent['id']
+        parentQueueKey = jsonDecodedParent['queueKey']
+    end
+
+    local jobId = ARGV[1]
+    local timestamp = ARGV[2]
+
+    -- Remove from active list (if not active we shall return error)
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+
+    if (numRemovedElements < 1) then
+        return -3
+    end
+
+    local eventStreamKey = KEYS[4]
+    local metaKey = KEYS[9]
+    -- Trim events before emitting them to avoid trimming events emitted in this script
+    trimEvents(metaKey, eventStreamKey)
+
+    local prefix = ARGV[7]
+
+    removeDeduplicationKeyIfNeededOnFinalization(prefix, jobAttributes[3], jobId)
+
+    -- Check if there is requeue data for this dedup ID (keepLastIfActive mode)
+    if jobAttributes[3] then
+      requeueDeduplicatedJob(prefix, jobAttributes[3], eventStreamKey,
+          metaKey, KEYS[2], KEYS[1], KEYS[8], KEYS[14], KEYS[3], KEYS[10],
+          KEYS[7], timestamp)
+    end
+
+    -- If job has a parent we need to
+    -- 1) remove this job id from parents dependencies
+    -- 2) move the job Id to parent "processed" set
+    -- 3) push the results into parent "results" list
+    -- 4) if parent's dependencies is empty, then move parent to "wait/paused". Note it may be a different queue!.
+    if parentId == "" and parentKey ~= "" then
+        parentId = getJobIdFromKey(parentKey)
+        parentQueueKey = getJobKeyPrefix(parentKey, ":" .. parentId)
+    end
+
+    if parentId ~= "" then
+        if ARGV[5] == "completed" then
+            local dependenciesSet = parentKey .. ":dependencies"
+            if rcall("SREM", dependenciesSet, jobIdKey) == 1 then
+                updateParentDepsIfNeeded(parentKey, parentQueueKey, dependenciesSet, parentId, jobIdKey, ARGV[4],
+                    timestamp)
+            end
+        else
+            moveChildFromDependenciesIfNeeded(jobAttributes[2], jobIdKey, ARGV[4], timestamp)
+        end
+    end
+
+    local attemptsMade = rcall("HINCRBY", jobIdKey, "atm", 1)
+
+    -- Remove job?
+    if maxCount ~= 0 then
+        local targetSet = KEYS[11]
+        -- Add to complete/failed set
+        rcall("ZADD", targetSet, timestamp, jobId)
+        rcall("HSET", jobIdKey, ARGV[3], ARGV[4], "finishedOn", timestamp)
+        -- "returnvalue" / "failedReason" and "finishedOn"
+
+        if ARGV[5] == "failed" then
+            rcall("HDEL", jobIdKey, "defa")
+        end
+
+        -- Remove old jobs?
+        if maxAge ~= nil then
+            removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+        end
+
+        if maxCount ~= nil and maxCount > 0 then
+            removeJobsByMaxCount(maxCount, targetSet, prefix)
+        end
+    else
+        removeJobKeys(jobIdKey)
+        if parentKey ~= "" then
+            -- TODO: when a child is removed when finished, result or failure in parent
+            -- must not be deleted, those value references should be deleted when the parent
+            -- is deleted
+            removeParentDependencyKey(jobIdKey, false, parentKey, jobAttributes[3])
+        end
+    end
+
+    rcall("XADD", eventStreamKey, "*", "event", ARGV[5], "jobId", jobId, ARGV[3], ARGV[4], "prev", "active")
+
+    if ARGV[5] == "failed" then
+        if tonumber(attemptsMade) >= tonumber(attempts) then
+            rcall("XADD", eventStreamKey, "*", "event", "retries-exhausted", "jobId", jobId, "attemptsMade",
+                attemptsMade)
+        end
+    end
+
+    -- Collect metrics
+    if maxMetricsSize ~= "" then
+        collectMetrics(KEYS[13], KEYS[13] .. ':data', maxMetricsSize, timestamp)
+    end
+
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[6] == "1") then
+        local result = fetchNextJob(KEYS[1], KEYS[2], KEYS[3], eventStreamKey,
+            KEYS[6], KEYS[7], KEYS[8], metaKey, KEYS[10], KEYS[14], prefix,
+            timestamp, opts)
+        if result then
+            return result
+        end
+    end
+
+    local waitLen = rcall("LLEN", KEYS[1])
+    if waitLen == 0 then
+        local activeLen = rcall("LLEN", KEYS[2])
+
+        if activeLen == 0 then
+            local prioritizedLen = rcall("ZCARD", KEYS[3])
+
+            if prioritizedLen == 0 then
+                rcall("XADD", eventStreamKey, "*", "event", "drained")
+            end
+        end
+    end
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/moveToWaitingChildren-7.lua b/node_modules/bullmq/dist/cjs/commands/moveToWaitingChildren-7.lua
new file mode 100644
index 0000000..117668e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/moveToWaitingChildren-7.lua
@@ -0,0 +1,95 @@
+--[[
+  Moves job from active to waiting children set.
+
+  Input:
+    KEYS[1] active key
+    KEYS[2] wait-children key
+    KEYS[3] job key
+    KEYS[4] job dependencies key
+    KEYS[5] job unsuccessful key
+    KEYS[6] stalled key
+    KEYS[7] events key
+
+    ARGV[1] token
+    ARGV[2] child key
+    ARGV[3] timestamp
+    ARGV[4] jobId
+    ARGV[5] prefix
+
+  Output:
+    0 - OK
+    1 - There are not pending dependencies.
+   -1 - Missing job.
+   -2 - Missing lock
+   -3 - Job not in active set
+   -9 - Job has failed children
+]]
+local rcall = redis.call
+local activeKey = KEYS[1]
+local waitingChildrenKey = KEYS[2]
+local jobKey = KEYS[3]
+local jobDependenciesKey = KEYS[4]
+local jobUnsuccessfulKey = KEYS[5]
+local stalledKey = KEYS[6]
+local eventStreamKey = KEYS[7]
+local token = ARGV[1]
+local timestamp = ARGV[3]
+local jobId = ARGV[4]
+
+--- Includes
+--- @include "includes/removeLock"
+
+local function removeJobFromActive(activeKey, stalledKey, jobKey, jobId,
+    token)
+  local errorCode = removeLock(jobKey, stalledKey, token, jobId)
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  local numRemovedElements = rcall("LREM", activeKey, -1, jobId)
+
+  if numRemovedElements < 1 then
+    return -3
+  end
+
+  return 0
+end
+
+local function moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+    jobKey, jobId, timestamp, token)
+  local errorCode = removeJobFromActive(activeKey, stalledKey, jobKey, jobId, token)
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  local score = tonumber(timestamp)
+
+  rcall("ZADD", waitingChildrenKey, score, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting-children", "jobId", jobId, 'prev', 'active')
+
+  return 0
+end
+
+if rcall("EXISTS", jobKey) == 1 then
+  if rcall("ZCARD", jobUnsuccessfulKey) ~= 0 then
+    return -9
+  else
+    if ARGV[2] ~= "" then
+      if rcall("SISMEMBER", jobDependenciesKey, ARGV[2]) ~= 0 then
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+  
+      return 1
+    else
+      if rcall("SCARD", jobDependenciesKey) ~= 0 then 
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+  
+      return 1
+    end    
+  end
+end
+
+return -1
diff --git a/node_modules/bullmq/dist/cjs/commands/obliterate-2.lua b/node_modules/bullmq/dist/cjs/commands/obliterate-2.lua
new file mode 100644
index 0000000..aaa6ebf
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/obliterate-2.lua
@@ -0,0 +1,119 @@
+--[[
+  Completely obliterates a queue and all of its contents
+  This command completely destroys a queue including all of its jobs, current or past 
+  leaving no trace of its existence. Since this script needs to iterate to find all the job
+  keys, consider that this call may be slow for very large queues.
+
+  The queue needs to be "paused" or it will return an error
+  If the queue has currently active jobs then the script by default will return error,
+  however this behaviour can be overridden using the 'force' option.
+  
+  Input:
+    KEYS[1] meta
+    KEYS[2] base
+
+    ARGV[1] count
+    ARGV[2] force
+]]
+
+local maxCount = tonumber(ARGV[1])
+local baseKey = KEYS[2]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/removeJobs"
+--- @include "includes/removeListJobs"
+--- @include "includes/removeZSetJobs"
+
+local function removeLockKeys(keys)
+  for i, key in ipairs(keys) do
+    rcall("DEL", baseKey .. key .. ':lock')
+  end
+end
+
+-- 1) Check if paused, if not return with error.
+if rcall("HEXISTS", KEYS[1], "paused") ~= 1 then
+  return -1 -- Error, NotPaused
+end
+
+-- 2) Check if there are active jobs, if there are and not "force" return error.
+local activeKey = baseKey .. 'active'
+local activeJobs = getListItems(activeKey, maxCount)
+if (#activeJobs > 0) then
+  if(ARGV[2] == "") then 
+    return -2 -- Error, ExistActiveJobs
+  end
+end
+
+removeLockKeys(activeJobs)
+maxCount = removeJobs(activeJobs, true, baseKey, maxCount)
+rcall("LTRIM", activeKey, #activeJobs, -1)
+if(maxCount <= 0) then
+  return 1
+end
+
+local delayedKey = baseKey .. 'delayed'
+maxCount = removeZSetJobs(delayedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local repeatKey = baseKey .. 'repeat'
+local repeatJobsIds = getZSetItems(repeatKey, maxCount)
+for i, key in ipairs(repeatJobsIds) do
+  local jobKey = repeatKey .. ":" .. key
+  rcall("DEL", jobKey)
+end
+if(#repeatJobsIds > 0) then
+  for from, to in batches(#repeatJobsIds, 7000) do
+    rcall("ZREM", repeatKey, unpack(repeatJobsIds, from, to))
+  end
+end
+maxCount = maxCount - #repeatJobsIds
+if(maxCount <= 0) then
+  return 1
+end
+
+local completedKey = baseKey .. 'completed'
+maxCount = removeZSetJobs(completedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local pausedKey = baseKey .. 'paused'
+maxCount = removeListJobs(pausedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local prioritizedKey = baseKey .. 'prioritized'
+maxCount = removeZSetJobs(prioritizedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local failedKey = baseKey .. 'failed'
+maxCount = removeZSetJobs(failedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+if(maxCount > 0) then
+  rcall("DEL",
+    baseKey .. 'events',
+    baseKey .. 'delay',
+    baseKey .. 'stalled-check',
+    baseKey .. 'stalled',
+    baseKey .. 'id',
+    baseKey .. 'pc',
+    baseKey .. 'marker',
+    baseKey .. 'meta',
+    baseKey .. 'metrics:completed',
+    baseKey .. 'metrics:completed:data',
+    baseKey .. 'metrics:failed',
+    baseKey .. 'metrics:failed:data')
+  return 0
+else
+  return 1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/paginate-1.lua b/node_modules/bullmq/dist/cjs/commands/paginate-1.lua
new file mode 100644
index 0000000..25560f8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/paginate-1.lua
@@ -0,0 +1,49 @@
+--[[
+    Paginate a set or hash
+
+    Input:
+      KEYS[1] key pointing to the set or hash to be paginated.
+    
+      ARGV[1]  page start offset
+      ARGV[2]  page end offset (-1 for all the elements)
+      ARGV[3]  cursor
+      ARGV[4]  offset
+      ARGV[5]  max iterations
+      ARGV[6]  fetch jobs?
+      
+    Output:
+      [cursor, offset, items, numItems]
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/findPage"
+
+local key = KEYS[1]
+local scanCommand = "SSCAN"
+local countCommand = "SCARD"
+local type = rcall("TYPE", key)["ok"]
+
+if type == "none" then
+    return {0, 0, {}, 0}
+elseif type == "hash" then
+    scanCommand = "HSCAN"
+    countCommand = "HLEN"
+elseif type ~= "set" then
+    return
+        redis.error_reply("Pagination is only supported for sets and hashes.")
+end
+
+local numItems = rcall(countCommand, key)
+local startOffset = tonumber(ARGV[1])
+local endOffset = tonumber(ARGV[2])
+if endOffset == -1 then 
+  endOffset = numItems
+end
+local pageSize = (endOffset - startOffset) + 1
+
+local cursor, offset, items, jobs = findPage(key, scanCommand, startOffset,
+                                       pageSize, ARGV[3], tonumber(ARGV[4]),
+                                       tonumber(ARGV[5]), ARGV[6])
+
+return {cursor, offset, items, numItems, jobs}
diff --git a/node_modules/bullmq/dist/cjs/commands/pause-7.lua b/node_modules/bullmq/dist/cjs/commands/pause-7.lua
new file mode 100644
index 0000000..0ecf23c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/pause-7.lua
@@ -0,0 +1,42 @@
+--[[
+  Pauses or resumes a queue globally.
+
+  Input:
+    KEYS[1] 'wait' or 'paused'
+    KEYS[2] 'paused' or 'wait'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] events stream key
+    KEYS[6] 'delayed'
+    KEYS[7] 'marker'
+
+    ARGV[1] 'paused' or 'resumed'
+
+  Event:
+    publish paused or resumed event.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+
+local markerKey = KEYS[7]
+local hasJobs = rcall("EXISTS", KEYS[1]) == 1
+--TODO: check this logic to be reused when changing a delay
+if hasJobs then rcall("RENAME", KEYS[1], KEYS[2]) end
+
+if ARGV[1] == "paused" then
+    rcall("HSET", KEYS[3], "paused", 1)
+    rcall("DEL", markerKey)
+else
+    rcall("HDEL", KEYS[3], "paused")
+
+    if hasJobs or rcall("ZCARD", KEYS[4]) > 0 then
+        -- Add marker if there are waiting or priority jobs
+        rcall("ZADD", markerKey, 0, "0")
+    else
+        addDelayMarkerIfNeeded(markerKey, KEYS[6])
+    end
+end
+
+rcall("XADD", KEYS[5], "*", "event", ARGV[1]);
diff --git a/node_modules/bullmq/dist/cjs/commands/promote-9.lua b/node_modules/bullmq/dist/cjs/commands/promote-9.lua
new file mode 100644
index 0000000..e6f03a7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/promote-9.lua
@@ -0,0 +1,61 @@
+--[[
+  Promotes a job that is currently "delayed" to the "waiting" state
+
+    Input:
+      KEYS[1] 'delayed'
+      KEYS[2] 'wait'
+      KEYS[3] 'paused'
+      KEYS[4] 'meta'
+      KEYS[5] 'prioritized'
+      KEYS[6] 'active'
+      KEYS[7] 'pc' priority counter
+      KEYS[8] 'event stream'
+      KEYS[9] 'marker'
+
+      ARGV[1]  queue.toKey('')
+      ARGV[2]  jobId
+
+    Output:
+       0 - OK
+      -3 - Job not in delayed zset.
+
+    Events:
+      'waiting'
+]]
+local rcall = redis.call
+local jobId = ARGV[2]
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getTargetQueueList"
+
+if rcall("ZREM", KEYS[1], jobId) == 1 then
+    local jobKey = ARGV[1] .. jobId
+    local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+    local metaKey = KEYS[4]
+    local markerKey = KEYS[9]
+
+    -- Remove delayed "marker" from the wait list if there is any.
+    -- Since we are adding a job we do not need the marker anymore.
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[6], KEYS[2], KEYS[3])
+    local marker = rcall("LINDEX", target, 0)
+    if marker and string.sub(marker, 1, 2) == "0:" then rcall("LPOP", target) end
+
+    if priority == 0 then
+        -- LIFO or FIFO
+        addJobInTargetList(target, markerKey, "LPUSH", isPausedOrMaxed, jobId)
+    else
+        addJobWithPriority(markerKey, KEYS[5], priority, jobId, KEYS[7], isPausedOrMaxed)
+    end
+
+    rcall("XADD", KEYS[8], "*", "event", "waiting", "jobId", jobId, "prev",
+          "delayed");
+
+    rcall("HSET", jobKey, "delay", 0)
+
+    return 0
+else
+    return -3
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/releaseLock-1.lua b/node_modules/bullmq/dist/cjs/commands/releaseLock-1.lua
new file mode 100644
index 0000000..1de8fac
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/releaseLock-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Release lock
+
+    Input:
+      KEYS[1] 'lock',
+    
+      ARGV[1]  token
+      ARGV[2]  lock duration in milliseconds
+      
+    Output:
+      "OK" if lock extended successfully.
+]]
+local rcall = redis.call
+
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  return rcall("DEL", KEYS[1])
+else
+  return 0
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/removeChildDependency-1.lua b/node_modules/bullmq/dist/cjs/commands/removeChildDependency-1.lua
new file mode 100644
index 0000000..5caa9aa
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeChildDependency-1.lua
@@ -0,0 +1,34 @@
+--[[
+  Break parent-child dependency by removing
+  child reference from parent
+
+  Input:
+    KEYS[1] 'key' prefix,
+
+    ARGV[1] job key
+    ARGV[2] parent key
+
+    Output:
+       0  - OK
+       1  - There is not relationship.
+      -1  - Missing job key
+      -5  - Missing parent key
+]]
+local rcall = redis.call
+local jobKey = ARGV[1]
+local parentKey = ARGV[2]
+
+-- Includes
+--- @include "includes/removeParentDependencyKey"
+
+if rcall("EXISTS", jobKey) ~= 1 then return -1 end
+
+if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+if removeParentDependencyKey(jobKey, false, parentKey, KEYS[1], nil) then
+  rcall("HDEL", jobKey, "parentKey", "parent")
+
+  return 0
+else
+  return 1
+end
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/cjs/commands/removeDeduplicationKey-1.lua b/node_modules/bullmq/dist/cjs/commands/removeDeduplicationKey-1.lua
new file mode 100644
index 0000000..243c11c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeDeduplicationKey-1.lua
@@ -0,0 +1,22 @@
+--[[
+  Remove deduplication key if it matches the job id.
+
+  Input:
+    KEYS[1] deduplication key
+
+    ARGV[1] job id
+
+  Output:
+    0 - false
+    1 - true
+]]
+local rcall = redis.call
+local deduplicationKey = KEYS[1]
+local jobId = ARGV[1]
+
+local currentJobId = rcall('GET', deduplicationKey)
+if currentJobId and currentJobId == jobId then
+  return rcall("DEL", deduplicationKey)
+end
+
+return 0
diff --git a/node_modules/bullmq/dist/cjs/commands/removeJob-2.lua b/node_modules/bullmq/dist/cjs/commands/removeJob-2.lua
new file mode 100644
index 0000000..ba7d683
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeJob-2.lua
@@ -0,0 +1,44 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] repeat key
+
+      ARGV[1] jobId
+      ARGV[2] remove children
+      ARGV[3] queue prefix
+
+    Events:
+      'removed'
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/isJobSchedulerJob"
+--- @include "includes/isLocked"
+--- @include "includes/removeJobWithChildren"
+
+local jobId = ARGV[1]
+local shouldRemoveChildren = ARGV[2]
+local prefix = ARGV[3]
+local jobKey = KEYS[1]
+local repeatKey = KEYS[2]
+
+if isJobSchedulerJob(jobId, jobKey, repeatKey) then
+    return -8
+end
+
+if not isLocked(prefix, jobId, shouldRemoveChildren) then
+    local options = {
+        removeChildren = shouldRemoveChildren == "1",
+        ignoreProcessed = false,
+        ignoreLocked = false
+    }
+
+    removeJobWithChildren(prefix, jobId, nil, options)
+    return 1
+end
+return 0
diff --git a/node_modules/bullmq/dist/cjs/commands/removeJobScheduler-3.lua b/node_modules/bullmq/dist/cjs/commands/removeJobScheduler-3.lua
new file mode 100644
index 0000000..921e351
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeJobScheduler-3.lua
@@ -0,0 +1,43 @@
+
+--[[
+  Removes a job scheduler and its next scheduled job.
+  Input:
+    KEYS[1] job schedulers key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+
+    ARGV[1] job scheduler id
+    ARGV[2] prefix key
+
+  Output:
+    0 - OK
+    1 - Missing repeat job
+
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/removeJobKeys"
+
+local jobSchedulerId = ARGV[1]
+local prefix = ARGV[2]
+
+local millis = rcall("ZSCORE", KEYS[1], jobSchedulerId)
+
+if millis then
+  -- Delete next programmed job.
+  local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], delayedJobId) == 1) then
+    removeJobKeys(prefix .. delayedJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", delayedJobId, "prev", "delayed")
+  end
+end
+
+if(rcall("ZREM", KEYS[1], jobSchedulerId) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. jobSchedulerId)
+  return 0
+end
+
+return 1
diff --git a/node_modules/bullmq/dist/cjs/commands/removeOrphanedJobs-1.lua b/node_modules/bullmq/dist/cjs/commands/removeOrphanedJobs-1.lua
new file mode 100644
index 0000000..5d89e62
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeOrphanedJobs-1.lua
@@ -0,0 +1,77 @@
+--[[
+  Removes orphaned job keys that exist in Redis but are not referenced
+  in any queue state set. Checks each candidate atomically.
+
+  Input:
+    KEYS[1]  base prefix key including trailing colon (e.g. bull:queueName:)
+
+    ARGV[1]  number of state key suffixes
+    ARGV[2 .. 1+N]  state key suffixes (e.g. active, wait, completed, ...)
+    ARGV[2+N]  number of job sub-key suffixes
+    ARGV[3+N .. 2+N+M]  job sub-key suffixes (e.g. logs, dependencies, ...)
+    ARGV[3+N+M .. end]  candidate job IDs to check
+
+  Output:
+    number of removed jobs
+]]
+local rcall = redis.call
+local basePrefix = KEYS[1]
+
+-- Parse state key suffixes and cache their full key names + types.
+local stateKeyCount = tonumber(ARGV[1])
+local stateKeys = {}
+local stateKeyTypes = {}
+for i = 1, stateKeyCount do
+  local fullKey = basePrefix .. ARGV[1 + i]
+  stateKeys[i] = fullKey
+  stateKeyTypes[i] = rcall('TYPE', fullKey)['ok']
+end
+
+-- Parse job sub-key suffixes.
+local subKeyCountIdx = 2 + stateKeyCount
+local subKeyCount = tonumber(ARGV[subKeyCountIdx])
+local subKeySuffixes = {}
+for i = 1, subKeyCount do
+  subKeySuffixes[i] = ARGV[subKeyCountIdx + i]
+end
+
+-- Process candidate job IDs.
+local candidateStart = subKeyCountIdx + subKeyCount + 1
+local removedCount = 0
+
+for c = candidateStart, #ARGV do
+  local jobId = ARGV[c]
+  local found = false
+
+  for i = 1, stateKeyCount do
+    local kt = stateKeyTypes[i]
+    if kt == 'list' then
+      if rcall('LPOS', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'zset' then
+      if rcall('ZSCORE', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'set' then
+      if rcall('SISMEMBER', stateKeys[i], jobId) == 1 then
+        found = true
+        break
+      end
+    end
+  end
+
+  if not found then
+    local jobKey = basePrefix .. jobId
+    local keysToDelete = { jobKey }
+    for _, suffix in ipairs(subKeySuffixes) do
+      keysToDelete[#keysToDelete + 1] = jobKey .. ':' .. suffix
+    end
+    rcall('DEL', unpack(keysToDelete))
+    removedCount = removedCount + 1
+  end
+end
+
+return removedCount
diff --git a/node_modules/bullmq/dist/cjs/commands/removeRepeatable-3.lua b/node_modules/bullmq/dist/cjs/commands/removeRepeatable-3.lua
new file mode 100644
index 0000000..34f8ce0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeRepeatable-3.lua
@@ -0,0 +1,58 @@
+
+--[[
+  Removes a repeatable job
+  Input:
+    KEYS[1] repeat jobs key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+
+    ARGV[1] old repeat job id
+    ARGV[2] options concat
+    ARGV[3] repeat job key
+    ARGV[4] prefix key
+
+  Output:
+    0 - OK
+    1 - Missing repeat job
+
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+local millis = rcall("ZSCORE", KEYS[1], ARGV[2])
+
+-- Includes
+--- @include "includes/removeJobKeys"
+
+-- legacy removal TODO: remove in next breaking change
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = ARGV[1] .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed");
+  end
+end
+
+if(rcall("ZREM", KEYS[1], ARGV[2]) == 1) then
+  return 0
+end
+
+-- new removal
+millis = rcall("ZSCORE", KEYS[1], ARGV[3])
+
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = "repeat:" .. ARGV[3] .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed")
+  end
+end
+
+if(rcall("ZREM", KEYS[1], ARGV[3]) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. ARGV[3])
+  return 0
+end
+
+return 1
diff --git a/node_modules/bullmq/dist/cjs/commands/removeUnprocessedChildren-2.lua b/node_modules/bullmq/dist/cjs/commands/removeUnprocessedChildren-2.lua
new file mode 100644
index 0000000..c3ee2b0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/removeUnprocessedChildren-2.lua
@@ -0,0 +1,31 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] meta key
+      
+      ARGV[1] prefix
+      ARGV[2] jobId
+
+    Events:
+      'removed' for every children removed
+]]
+
+-- Includes
+--- @include "includes/removeJobWithChildren"
+
+local prefix = ARGV[1]
+local jobId = ARGV[2]
+
+local jobKey = KEYS[1]
+local metaKey = KEYS[2]
+
+local options = {
+  removeChildren = "1",
+  ignoreProcessed = true,
+  ignoreLocked = true
+}
+
+removeJobChildren(prefix, jobKey, options) 
diff --git a/node_modules/bullmq/dist/cjs/commands/reprocessJob-8.lua b/node_modules/bullmq/dist/cjs/commands/reprocessJob-8.lua
new file mode 100644
index 0000000..583c54e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/reprocessJob-8.lua
@@ -0,0 +1,77 @@
+--[[
+  Attempts to reprocess a job
+
+  Input:
+    KEYS[1] job key
+    KEYS[2] events stream
+    KEYS[3] job state
+    KEYS[4] wait key
+    KEYS[5] meta
+    KEYS[6] paused key
+    KEYS[7] active key
+    KEYS[8] marker key
+
+    ARGV[1] job.id
+    ARGV[2] (job.opts.lifo ? 'R' : 'L') + 'PUSH'
+    ARGV[3] propVal - failedReason/returnvalue
+    ARGV[4] prev state - failed/completed
+    ARGV[5] reset attemptsMade - "1" or "0"
+    ARGV[6] reset attemptsStarted - "1" or "0"
+
+  Output:
+     1 means the operation was a success
+    -1 means the job does not exist
+    -3 means the job was not found in the expected set.
+]]
+local rcall = redis.call;
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+
+local jobKey = KEYS[1]
+if rcall("EXISTS", jobKey) == 1 then
+  local jobId = ARGV[1]
+  if (rcall("ZREM", KEYS[3], jobId) == 1) then
+    local attributesToRemove = {}
+
+    if ARGV[5] == "1" then
+      table.insert(attributesToRemove, "atm")
+    end
+
+    if ARGV[6] == "1" then
+      table.insert(attributesToRemove, "ats")
+    end
+
+    rcall("HDEL", jobKey, "finishedOn", "processedOn", ARGV[3], unpack(attributesToRemove))
+
+    local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[7], KEYS[4], KEYS[6])
+    addJobInTargetList(target, KEYS[8], ARGV[2], isPausedOrMaxed, jobId)
+
+    local parentKey = rcall("HGET", jobKey, "parentKey")
+
+    if parentKey and rcall("EXISTS", parentKey) == 1 then
+      if ARGV[4] == "failed" then
+        if rcall("ZREM", parentKey .. ":unsuccessful", jobKey) == 1 or
+          rcall("ZREM", parentKey .. ":failed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      else
+        if rcall("HDEL", parentKey .. ":processed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      end
+    end
+
+    local maxEvents = getOrSetMaxEvents(KEYS[5])
+    -- Emit waiting event
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId, "prev", ARGV[4]);
+    return 1
+  else
+    return -3
+  end
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/retryJob-11.lua b/node_modules/bullmq/dist/cjs/commands/retryJob-11.lua
new file mode 100644
index 0000000..6382168
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/retryJob-11.lua
@@ -0,0 +1,88 @@
+--[[
+  Retries a failed job by moving it back to the wait queue.
+
+    Input:
+      KEYS[1]  'active',
+      KEYS[2]  'wait'
+      KEYS[3]  'paused'
+      KEYS[4]  job key
+      KEYS[5]  'meta'
+      KEYS[6]  events stream
+      KEYS[7]  delayed key
+      KEYS[8]  prioritized key
+      KEYS[9]  'pc' priority counter
+      KEYS[10] 'marker'
+      KEYS[11] 'stalled'
+
+      ARGV[1]  key prefix
+      ARGV[2]  timestamp
+      ARGV[3]  pushCmd
+      ARGV[4]  jobId
+      ARGV[5]  token
+      ARGV[6]  optional job fields to update
+
+    Events:
+      'waiting'
+
+    Output:
+     0  - OK
+     -1 - Missing key
+     -2 - Missing lock
+     -3 - Job not in active set
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/isQueuePausedOrMaxed"
+--- @include "includes/promoteDelayedJobs"
+--- @include "includes/removeLock"
+--- @include "includes/updateJobFields"
+
+local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[1], KEYS[2], KEYS[3])
+local markerKey = KEYS[10]
+
+-- Check if there are delayed jobs that we can move to wait.
+-- test example: when there are delayed jobs between retries
+promoteDelayedJobs(KEYS[7], markerKey, target, KEYS[8], KEYS[6], ARGV[1], ARGV[2], KEYS[9], isPausedOrMaxed)
+
+local jobKey = KEYS[4]
+
+if rcall("EXISTS", jobKey) == 1 then
+  local errorCode = removeLock(jobKey, KEYS[11], ARGV[5], ARGV[4]) 
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  updateJobFields(jobKey, ARGV[6])
+
+  local numRemovedElements = rcall("LREM", KEYS[1], -1, ARGV[4])
+  if (numRemovedElements < 1) then return -3 end
+
+  local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+
+  --need to re-evaluate after removing job from active
+  isPausedOrMaxed = isQueuePausedOrMaxed(KEYS[5], KEYS[1])
+
+  -- Standard or priority add
+  if priority == 0 then
+    addJobInTargetList(target, markerKey, ARGV[3], isPausedOrMaxed, ARGV[4])
+  else
+    addJobWithPriority(markerKey, KEYS[8], priority, ARGV[4], KEYS[9], isPausedOrMaxed)
+  end
+
+  rcall("HINCRBY", jobKey, "atm", 1)
+
+  local maxEvents = getOrSetMaxEvents(KEYS[5])
+
+  -- Emit waiting event
+  rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", ARGV[4], "prev", "active")
+
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/saveStacktrace-1.lua b/node_modules/bullmq/dist/cjs/commands/saveStacktrace-1.lua
new file mode 100644
index 0000000..52c91b6
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/saveStacktrace-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Save stacktrace and failedReason.
+  Input:
+    KEYS[1] job key
+    ARGV[1]  stacktrace
+    ARGV[2]  failedReason
+  Output:
+     0 - OK
+    -1 - Missing key
+]]
+local rcall = redis.call
+
+if rcall("EXISTS", KEYS[1]) == 1 then
+  rcall("HMSET", KEYS[1], "stacktrace", ARGV[1], "failedReason", ARGV[2])
+
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/updateData-1.lua b/node_modules/bullmq/dist/cjs/commands/updateData-1.lua
new file mode 100644
index 0000000..7e57bf8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/updateData-1.lua
@@ -0,0 +1,20 @@
+--[[
+  Update job data
+
+  Input:
+    KEYS[1] Job id key
+
+    ARGV[1] data
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+]]
+local rcall = redis.call
+
+if rcall("EXISTS",KEYS[1]) == 1 then -- // Make sure job exists
+  rcall("HSET", KEYS[1], "data", ARGV[1])
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/updateJobScheduler-12.lua b/node_modules/bullmq/dist/cjs/commands/updateJobScheduler-12.lua
new file mode 100644
index 0000000..1a5e87a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/updateJobScheduler-12.lua
@@ -0,0 +1,126 @@
+--[[
+  Updates a job scheduler and adds next delayed job
+
+  Input:
+    KEYS[1]  'repeat' key
+    KEYS[2]  'delayed'
+    KEYS[3]  'wait' key
+    KEYS[4]  'paused' key
+    KEYS[5]  'meta'
+    KEYS[6]  'prioritized' key
+    KEYS[7]  'marker',
+    KEYS[8]  'id'
+    KEYS[9]  events stream key
+    KEYS[10] 'pc' priority counter
+    KEYS[11] producer key
+    KEYS[12] 'active' key
+
+    ARGV[1] next milliseconds
+    ARGV[2] jobs scheduler id
+    ARGV[3] Json stringified delayed data
+    ARGV[4] msgpacked delayed opts
+    ARGV[5] timestamp
+    ARGV[6] prefix key
+    ARGV[7] producer id
+
+    Output:
+      next delayed job id  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local nextMillis = tonumber(ARGV[1])
+local jobSchedulerId = ARGV[2]
+local timestamp = tonumber(ARGV[5])
+local prefixKey = ARGV[6]
+local producerId = ARGV[7]
+local jobOpts = cmsgpack.unpack(ARGV[4])
+
+-- Includes
+--- @include "includes/addJobFromScheduler"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getJobSchedulerEveryNextMillis"
+
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+
+-- Validate that scheduler exists.
+-- If it does not exist we should not iterate anymore.
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+
+    local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+    local schedulerAttributes = rcall("HMGET", schedulerKey, "name", "data", "every", "startDate", "offset")
+
+    local every = tonumber(schedulerAttributes[3])
+    local now = tonumber(timestamp)
+
+    -- If every is not found in scheduler attributes, try to get it from job options
+    if not every and jobOpts['repeat'] and jobOpts['repeat']['every'] then
+        every = tonumber(jobOpts['repeat']['every'])
+    end
+
+    if every then
+        local startDate = schedulerAttributes[4]
+        local jobOptsOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+        local offset = schedulerAttributes[5] or jobOptsOffset or 0
+        local newOffset
+
+        nextMillis, newOffset = getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+
+        if not offset then
+            rcall("HSET", schedulerKey, "offset", newOffset)
+            jobOpts['repeat']['offset'] = newOffset
+        end
+    end
+
+    local nextDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+    local nextDelayedJobKey = schedulerKey .. ":" .. nextMillis
+
+    local currentDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+
+    if producerId == currentDelayedJobId then
+        local eventsKey = KEYS[9]
+        local maxEvents = getOrSetMaxEvents(metaKey)
+
+        if rcall("EXISTS", nextDelayedJobKey) ~= 1 then
+
+            rcall("ZADD", repeatKey, nextMillis, jobSchedulerId)
+            rcall("HINCRBY", schedulerKey, "ic", 1)
+
+            rcall("INCR", KEYS[8])
+
+            -- TODO: remove this workaround in next breaking change,
+            -- all job-schedulers must save job data
+            local templateData = schedulerAttributes[2] or ARGV[3]
+
+            if templateData and templateData ~= '{}' then
+                rcall("HSET", schedulerKey, "data", templateData)
+            end
+
+            local delay = nextMillis - now
+
+            -- Fast Clamp delay to minimum of 0
+            if delay < 0 then
+                delay = 0
+            end
+
+            jobOpts["delay"] = delay
+
+            addJobFromScheduler(nextDelayedJobKey, nextDelayedJobId, jobOpts, waitKey, pausedKey, KEYS[12], metaKey,
+                prioritizedKey, KEYS[10], delayedKey, KEYS[7], eventsKey, schedulerAttributes[1], maxEvents, ARGV[5],
+                templateData or '{}', jobSchedulerId, delay)
+
+            -- TODO: remove this workaround in next breaking change
+            if KEYS[11] ~= "" then
+                rcall("HSET", KEYS[11], "nrjid", nextDelayedJobId)
+            end
+
+            return nextDelayedJobId .. "" -- convert to string
+        else
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "duplicated", "jobId", nextDelayedJobId)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/updateProgress-3.lua b/node_modules/bullmq/dist/cjs/commands/updateProgress-3.lua
new file mode 100644
index 0000000..185f6b7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/updateProgress-3.lua
@@ -0,0 +1,33 @@
+--[[
+  Update job progress
+
+  Input:
+    KEYS[1] Job id key
+    KEYS[2] event stream key
+    KEYS[3] meta key
+
+    ARGV[1] id
+    ARGV[2] progress
+
+  Output:
+     0 - OK
+    -1 - Missing job.
+
+  Event:
+    progress(jobId, progress)
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/getOrSetMaxEvents"
+
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+    local maxEvents = getOrSetMaxEvents(KEYS[3])
+
+    rcall("HSET", KEYS[1], "progress", ARGV[2])
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "progress",
+          "jobId", ARGV[1], "data", ARGV[2]);
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/cjs/commands/updateRepeatableJobMillis-1.lua b/node_modules/bullmq/dist/cjs/commands/updateRepeatableJobMillis-1.lua
new file mode 100644
index 0000000..b6104ff
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/commands/updateRepeatableJobMillis-1.lua
@@ -0,0 +1,28 @@
+--[[
+  Adds a repeatable job
+
+    Input:
+      KEYS[1] 'repeat' key
+
+      ARGV[1] next milliseconds
+      ARGV[2] custom key
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local nextMillis = ARGV[1]
+local customKey = ARGV[2]
+local legacyCustomKey = ARGV[3]
+
+if rcall("ZSCORE", repeatKey, customKey) then
+    rcall("ZADD", repeatKey, nextMillis, customKey)
+    return customKey
+elseif rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+    rcall("ZADD", repeatKey, nextMillis, legacyCustomKey)
+    return legacyCustomKey
+end
+
+return ''
diff --git a/node_modules/bullmq/dist/cjs/enums/child-command.js b/node_modules/bullmq/dist/cjs/enums/child-command.js
new file mode 100644
index 0000000..8f99947
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/child-command.js
@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ChildCommand = void 0;
+var ChildCommand;
+(function (ChildCommand) {
+    ChildCommand[ChildCommand["Init"] = 0] = "Init";
+    ChildCommand[ChildCommand["Start"] = 1] = "Start";
+    ChildCommand[ChildCommand["Stop"] = 2] = "Stop";
+    ChildCommand[ChildCommand["GetChildrenValuesResponse"] = 3] = "GetChildrenValuesResponse";
+    ChildCommand[ChildCommand["GetIgnoredChildrenFailuresResponse"] = 4] = "GetIgnoredChildrenFailuresResponse";
+    ChildCommand[ChildCommand["GetDependenciesCountResponse"] = 5] = "GetDependenciesCountResponse";
+    ChildCommand[ChildCommand["MoveToWaitingChildrenResponse"] = 6] = "MoveToWaitingChildrenResponse";
+    ChildCommand[ChildCommand["Cancel"] = 7] = "Cancel";
+    ChildCommand[ChildCommand["GetDependenciesResponse"] = 8] = "GetDependenciesResponse";
+})(ChildCommand || (exports.ChildCommand = ChildCommand = {}));
diff --git a/node_modules/bullmq/dist/cjs/enums/error-code.js b/node_modules/bullmq/dist/cjs/enums/error-code.js
new file mode 100644
index 0000000..c2bf33b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/error-code.js
@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ErrorCode = void 0;
+var ErrorCode;
+(function (ErrorCode) {
+    ErrorCode[ErrorCode["JobNotExist"] = -1] = "JobNotExist";
+    ErrorCode[ErrorCode["JobLockNotExist"] = -2] = "JobLockNotExist";
+    ErrorCode[ErrorCode["JobNotInState"] = -3] = "JobNotInState";
+    ErrorCode[ErrorCode["JobPendingChildren"] = -4] = "JobPendingChildren";
+    ErrorCode[ErrorCode["ParentJobNotExist"] = -5] = "ParentJobNotExist";
+    ErrorCode[ErrorCode["JobLockMismatch"] = -6] = "JobLockMismatch";
+    ErrorCode[ErrorCode["ParentJobCannotBeReplaced"] = -7] = "ParentJobCannotBeReplaced";
+    ErrorCode[ErrorCode["JobBelongsToJobScheduler"] = -8] = "JobBelongsToJobScheduler";
+    ErrorCode[ErrorCode["JobHasFailedChildren"] = -9] = "JobHasFailedChildren";
+    ErrorCode[ErrorCode["SchedulerJobIdCollision"] = -10] = "SchedulerJobIdCollision";
+    ErrorCode[ErrorCode["SchedulerJobSlotsBusy"] = -11] = "SchedulerJobSlotsBusy";
+})(ErrorCode || (exports.ErrorCode = ErrorCode = {}));
diff --git a/node_modules/bullmq/dist/cjs/enums/index.js b/node_modules/bullmq/dist/cjs/enums/index.js
new file mode 100644
index 0000000..a10426f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/index.js
@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./child-command"), exports);
+tslib_1.__exportStar(require("./error-code"), exports);
+tslib_1.__exportStar(require("./parent-command"), exports);
+tslib_1.__exportStar(require("./metrics-time"), exports);
+tslib_1.__exportStar(require("./telemetry-attributes"), exports);
diff --git a/node_modules/bullmq/dist/cjs/enums/metrics-time.js b/node_modules/bullmq/dist/cjs/enums/metrics-time.js
new file mode 100644
index 0000000..32bcd80
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/metrics-time.js
@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MetricsTime = void 0;
+var MetricsTime;
+(function (MetricsTime) {
+    MetricsTime[MetricsTime["ONE_MINUTE"] = 1] = "ONE_MINUTE";
+    MetricsTime[MetricsTime["FIVE_MINUTES"] = 5] = "FIVE_MINUTES";
+    MetricsTime[MetricsTime["FIFTEEN_MINUTES"] = 15] = "FIFTEEN_MINUTES";
+    MetricsTime[MetricsTime["THIRTY_MINUTES"] = 30] = "THIRTY_MINUTES";
+    MetricsTime[MetricsTime["ONE_HOUR"] = 60] = "ONE_HOUR";
+    MetricsTime[MetricsTime["ONE_WEEK"] = 10080] = "ONE_WEEK";
+    MetricsTime[MetricsTime["TWO_WEEKS"] = 20160] = "TWO_WEEKS";
+    MetricsTime[MetricsTime["ONE_MONTH"] = 80640] = "ONE_MONTH";
+})(MetricsTime || (exports.MetricsTime = MetricsTime = {}));
diff --git a/node_modules/bullmq/dist/cjs/enums/parent-command.js b/node_modules/bullmq/dist/cjs/enums/parent-command.js
new file mode 100644
index 0000000..95fd739
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/parent-command.js
@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ParentCommand = void 0;
+var ParentCommand;
+(function (ParentCommand) {
+    ParentCommand[ParentCommand["Completed"] = 0] = "Completed";
+    ParentCommand[ParentCommand["Error"] = 1] = "Error";
+    ParentCommand[ParentCommand["Failed"] = 2] = "Failed";
+    ParentCommand[ParentCommand["InitFailed"] = 3] = "InitFailed";
+    ParentCommand[ParentCommand["InitCompleted"] = 4] = "InitCompleted";
+    ParentCommand[ParentCommand["Log"] = 5] = "Log";
+    ParentCommand[ParentCommand["MoveToDelayed"] = 6] = "MoveToDelayed";
+    ParentCommand[ParentCommand["MoveToWait"] = 7] = "MoveToWait";
+    ParentCommand[ParentCommand["Progress"] = 8] = "Progress";
+    ParentCommand[ParentCommand["Update"] = 9] = "Update";
+    ParentCommand[ParentCommand["GetChildrenValues"] = 10] = "GetChildrenValues";
+    ParentCommand[ParentCommand["GetIgnoredChildrenFailures"] = 11] = "GetIgnoredChildrenFailures";
+    ParentCommand[ParentCommand["GetDependenciesCount"] = 12] = "GetDependenciesCount";
+    ParentCommand[ParentCommand["MoveToWaitingChildren"] = 13] = "MoveToWaitingChildren";
+    ParentCommand[ParentCommand["GetDependencies"] = 14] = "GetDependencies";
+})(ParentCommand || (exports.ParentCommand = ParentCommand = {}));
diff --git a/node_modules/bullmq/dist/cjs/enums/telemetry-attributes.js b/node_modules/bullmq/dist/cjs/enums/telemetry-attributes.js
new file mode 100644
index 0000000..8d520c1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/enums/telemetry-attributes.js
@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SpanKind = exports.MetricNames = exports.TelemetryAttributes = void 0;
+var TelemetryAttributes;
+(function (TelemetryAttributes) {
+    TelemetryAttributes["QueueName"] = "bullmq.queue.name";
+    TelemetryAttributes["QueueOperation"] = "bullmq.queue.operation";
+    TelemetryAttributes["BulkCount"] = "bullmq.job.bulk.count";
+    TelemetryAttributes["BulkNames"] = "bullmq.job.bulk.names";
+    TelemetryAttributes["JobName"] = "bullmq.job.name";
+    TelemetryAttributes["JobId"] = "bullmq.job.id";
+    TelemetryAttributes["JobKey"] = "bullmq.job.key";
+    TelemetryAttributes["JobIds"] = "bullmq.job.ids";
+    TelemetryAttributes["JobAttemptsMade"] = "bullmq.job.attempts.made";
+    TelemetryAttributes["DeduplicationKey"] = "bullmq.job.deduplication.key";
+    TelemetryAttributes["JobOptions"] = "bullmq.job.options";
+    TelemetryAttributes["JobProgress"] = "bullmq.job.progress";
+    TelemetryAttributes["QueueDrainDelay"] = "bullmq.queue.drain.delay";
+    TelemetryAttributes["QueueGrace"] = "bullmq.queue.grace";
+    TelemetryAttributes["QueueCleanLimit"] = "bullmq.queue.clean.limit";
+    TelemetryAttributes["QueueRateLimit"] = "bullmq.queue.rate.limit";
+    TelemetryAttributes["JobType"] = "bullmq.job.type";
+    TelemetryAttributes["QueueOptions"] = "bullmq.queue.options";
+    TelemetryAttributes["QueueEventMaxLength"] = "bullmq.queue.event.max.length";
+    TelemetryAttributes["QueueJobsState"] = "bullmq.queue.jobs.state";
+    TelemetryAttributes["WorkerOptions"] = "bullmq.worker.options";
+    TelemetryAttributes["WorkerName"] = "bullmq.worker.name";
+    TelemetryAttributes["WorkerId"] = "bullmq.worker.id";
+    TelemetryAttributes["WorkerRateLimit"] = "bullmq.worker.rate.limit";
+    TelemetryAttributes["WorkerDoNotWaitActive"] = "bullmq.worker.do.not.wait.active";
+    TelemetryAttributes["WorkerForceClose"] = "bullmq.worker.force.close";
+    TelemetryAttributes["WorkerStalledJobs"] = "bullmq.worker.stalled.jobs";
+    TelemetryAttributes["WorkerFailedJobs"] = "bullmq.worker.failed.jobs";
+    TelemetryAttributes["WorkerJobsToExtendLocks"] = "bullmq.worker.jobs.to.extend.locks";
+    /**
+     * @deprecated Use JobAttemptFinishedTimestamp instead. Will be removed in a future version.
+     */
+    TelemetryAttributes["JobFinishedTimestamp"] = "bullmq.job.finished.timestamp";
+    TelemetryAttributes["JobAttemptFinishedTimestamp"] = "bullmq.job.attempt_finished_timestamp";
+    TelemetryAttributes["JobProcessedTimestamp"] = "bullmq.job.processed.timestamp";
+    TelemetryAttributes["JobResult"] = "bullmq.job.result";
+    TelemetryAttributes["JobFailedReason"] = "bullmq.job.failed.reason";
+    TelemetryAttributes["FlowName"] = "bullmq.flow.name";
+    TelemetryAttributes["JobSchedulerId"] = "bullmq.job.scheduler.id";
+    TelemetryAttributes["JobStatus"] = "bullmq.job.status";
+})(TelemetryAttributes || (exports.TelemetryAttributes = TelemetryAttributes = {}));
+/**
+ * Standard metric names for BullMQ telemetry
+ */
+var MetricNames;
+(function (MetricNames) {
+    MetricNames["QueueJobsCount"] = "bullmq.queue.jobs";
+    MetricNames["JobsCompleted"] = "bullmq.jobs.completed";
+    MetricNames["JobsFailed"] = "bullmq.jobs.failed";
+    MetricNames["JobsDelayed"] = "bullmq.jobs.delayed";
+    MetricNames["JobsRetried"] = "bullmq.jobs.retried";
+    MetricNames["JobsWaiting"] = "bullmq.jobs.waiting";
+    MetricNames["JobsWaitingChildren"] = "bullmq.jobs.waiting_children";
+    MetricNames["JobDuration"] = "bullmq.job.duration";
+})(MetricNames || (exports.MetricNames = MetricNames = {}));
+var SpanKind;
+(function (SpanKind) {
+    SpanKind[SpanKind["INTERNAL"] = 0] = "INTERNAL";
+    SpanKind[SpanKind["SERVER"] = 1] = "SERVER";
+    SpanKind[SpanKind["CLIENT"] = 2] = "CLIENT";
+    SpanKind[SpanKind["PRODUCER"] = 3] = "PRODUCER";
+    SpanKind[SpanKind["CONSUMER"] = 4] = "CONSUMER";
+})(SpanKind || (exports.SpanKind = SpanKind = {}));
diff --git a/node_modules/bullmq/dist/cjs/index.js b/node_modules/bullmq/dist/cjs/index.js
new file mode 100644
index 0000000..72958a0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/index.js
@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./classes"), exports);
+tslib_1.__exportStar(require("./enums"), exports);
+tslib_1.__exportStar(require("./interfaces"), exports);
+tslib_1.__exportStar(require("./types"), exports);
+tslib_1.__exportStar(require("./utils"), exports);
+// to prevent circular references
+tslib_1.__exportStar(require("./types/processor"), exports);
+tslib_1.__exportStar(require("./utils/create-scripts"), exports);
diff --git a/node_modules/bullmq/dist/cjs/interfaces/advanced-options.js b/node_modules/bullmq/dist/cjs/interfaces/advanced-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/advanced-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/backoff-options.js b/node_modules/bullmq/dist/cjs/interfaces/backoff-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/backoff-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/base-job-options.js b/node_modules/bullmq/dist/cjs/interfaces/base-job-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/base-job-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/child-message.js b/node_modules/bullmq/dist/cjs/interfaces/child-message.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/child-message.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/connection.js b/node_modules/bullmq/dist/cjs/interfaces/connection.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/connection.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/flow-job.js b/node_modules/bullmq/dist/cjs/interfaces/flow-job.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/flow-job.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/index.js b/node_modules/bullmq/dist/cjs/interfaces/index.js
new file mode 100644
index 0000000..b19bfb0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/index.js
@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./advanced-options"), exports);
+tslib_1.__exportStar(require("./backoff-options"), exports);
+tslib_1.__exportStar(require("./base-job-options"), exports);
+tslib_1.__exportStar(require("./child-message"), exports);
+tslib_1.__exportStar(require("./connection"), exports);
+tslib_1.__exportStar(require("./flow-job"), exports);
+tslib_1.__exportStar(require("./ioredis-events"), exports);
+tslib_1.__exportStar(require("./job-json"), exports);
+tslib_1.__exportStar(require("./job-scheduler-json"), exports);
+tslib_1.__exportStar(require("./lock-manager-worker-context"), exports);
+tslib_1.__exportStar(require("./metrics-options"), exports);
+tslib_1.__exportStar(require("./metrics"), exports);
+tslib_1.__exportStar(require("./minimal-job"), exports);
+tslib_1.__exportStar(require("./minimal-queue"), exports);
+tslib_1.__exportStar(require("./parent-message"), exports);
+tslib_1.__exportStar(require("./parent"), exports);
+tslib_1.__exportStar(require("./parent-options"), exports);
+tslib_1.__exportStar(require("./queue-meta"), exports);
+tslib_1.__exportStar(require("./queue-options"), exports);
+tslib_1.__exportStar(require("./rate-limiter-options"), exports);
+tslib_1.__exportStar(require("./redis-client"), exports);
+tslib_1.__exportStar(require("./redis-options"), exports);
+tslib_1.__exportStar(require("./redis-streams"), exports);
+tslib_1.__exportStar(require("./repeatable-job"), exports);
+tslib_1.__exportStar(require("./repeatable-options"), exports);
+tslib_1.__exportStar(require("./repeat-options"), exports);
+tslib_1.__exportStar(require("./retry-options"), exports);
+tslib_1.__exportStar(require("./script-queue-context"), exports);
+tslib_1.__exportStar(require("./sandboxed-job-processor"), exports);
+tslib_1.__exportStar(require("./sandboxed-job"), exports);
+tslib_1.__exportStar(require("./sandboxed-options"), exports);
+tslib_1.__exportStar(require("./worker-options"), exports);
+tslib_1.__exportStar(require("./telemetry"), exports);
+tslib_1.__exportStar(require("./receiver"), exports);
diff --git a/node_modules/bullmq/dist/cjs/interfaces/ioredis-events.js b/node_modules/bullmq/dist/cjs/interfaces/ioredis-events.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/ioredis-events.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/job-json.js b/node_modules/bullmq/dist/cjs/interfaces/job-json.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/job-json.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/job-scheduler-json.js b/node_modules/bullmq/dist/cjs/interfaces/job-scheduler-json.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/job-scheduler-json.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/lock-manager-worker-context.js b/node_modules/bullmq/dist/cjs/interfaces/lock-manager-worker-context.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/lock-manager-worker-context.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/metrics-options.js b/node_modules/bullmq/dist/cjs/interfaces/metrics-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/metrics-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/metrics.js b/node_modules/bullmq/dist/cjs/interfaces/metrics.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/metrics.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/minimal-job.js b/node_modules/bullmq/dist/cjs/interfaces/minimal-job.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/minimal-job.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/minimal-queue.js b/node_modules/bullmq/dist/cjs/interfaces/minimal-queue.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/minimal-queue.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/parent-message.js b/node_modules/bullmq/dist/cjs/interfaces/parent-message.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/parent-message.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/parent-options.js b/node_modules/bullmq/dist/cjs/interfaces/parent-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/parent-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/parent.js b/node_modules/bullmq/dist/cjs/interfaces/parent.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/parent.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/queue-meta.js b/node_modules/bullmq/dist/cjs/interfaces/queue-meta.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/queue-meta.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/queue-options.js b/node_modules/bullmq/dist/cjs/interfaces/queue-options.js
new file mode 100644
index 0000000..89527a1
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/queue-options.js
@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ClientType = void 0;
+var ClientType;
+(function (ClientType) {
+    ClientType["blocking"] = "blocking";
+    ClientType["normal"] = "normal";
+})(ClientType || (exports.ClientType = ClientType = {}));
diff --git a/node_modules/bullmq/dist/cjs/interfaces/rate-limiter-options.js b/node_modules/bullmq/dist/cjs/interfaces/rate-limiter-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/rate-limiter-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/receiver.js b/node_modules/bullmq/dist/cjs/interfaces/receiver.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/receiver.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/redis-client.js b/node_modules/bullmq/dist/cjs/interfaces/redis-client.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/redis-client.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/redis-options.js b/node_modules/bullmq/dist/cjs/interfaces/redis-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/redis-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/redis-streams.js b/node_modules/bullmq/dist/cjs/interfaces/redis-streams.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/redis-streams.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/repeat-options.js b/node_modules/bullmq/dist/cjs/interfaces/repeat-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/repeat-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/repeatable-job.js b/node_modules/bullmq/dist/cjs/interfaces/repeatable-job.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/repeatable-job.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/repeatable-options.js b/node_modules/bullmq/dist/cjs/interfaces/repeatable-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/repeatable-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/retry-options.js b/node_modules/bullmq/dist/cjs/interfaces/retry-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/retry-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job-processor.js b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job-processor.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job-processor.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job.js b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-job.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/sandboxed-options.js b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/sandboxed-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/script-queue-context.js b/node_modules/bullmq/dist/cjs/interfaces/script-queue-context.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/script-queue-context.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/telemetry.js b/node_modules/bullmq/dist/cjs/interfaces/telemetry.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/telemetry.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/interfaces/worker-options.js b/node_modules/bullmq/dist/cjs/interfaces/worker-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/interfaces/worker-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/scripts/addDelayedJob-6.js b/node_modules/bullmq/dist/cjs/scripts/addDelayedJob-6.js
new file mode 100644
index 0000000..d1e1d93
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addDelayedJob-6.js
@@ -0,0 +1,579 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addDelayedJob = void 0;
+const content = `--[[
+  Adds a delayed job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - computes timestamp.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'delayed'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (use custom instead of one generated automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local delayedKey = KEYS[4]
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local opts = cmsgpack.unpack(ARGV[3])
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, delayedKey, deduplicationKey,
+  eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+    opts, timestamp, parentKey, parentData, repeatJobKey)
+addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, KEYS[1], delay)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+exports.addDelayedJob = {
+    name: 'addDelayedJob',
+    content,
+    keys: 6,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addJobScheduler-11.js b/node_modules/bullmq/dist/cjs/scripts/addJobScheduler-11.js
new file mode 100644
index 0000000..b5522cb
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addJobScheduler-11.js
@@ -0,0 +1,595 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addJobScheduler = void 0;
+const content = `--[[
+  Adds a job scheduler, i.e. a job factory that creates jobs based on a given schedule (repeat options).
+    Input:
+      KEYS[1]  'repeat' key
+      KEYS[2]  'delayed' key
+      KEYS[3]  'wait' key
+      KEYS[4]  'paused' key
+      KEYS[5]  'meta' key
+      KEYS[6]  'prioritized' key
+      KEYS[7]  'marker' key
+      KEYS[8]  'id' key
+      KEYS[9]  'events' key
+      KEYS[10] 'pc' priority counter
+      KEYS[11] 'active' key
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] jobs scheduler id
+      ARGV[4] Json stringified template data
+      ARGV[5] mspacked template opts
+      ARGV[6] msgpacked delayed opts
+      ARGV[7] timestamp
+      ARGV[8] prefix key
+      ARGV[9] producer key
+      Output:
+        repeatableKey  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local eventsKey = KEYS[9]
+local nextMillis = ARGV[1]
+local jobSchedulerId = ARGV[3]
+local templateOpts = cmsgpack.unpack(ARGV[5])
+local now = tonumber(ARGV[7])
+local prefixKey = ARGV[8]
+local jobOpts = cmsgpack.unpack(ARGV[6])
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+--[[
+  Function to store a job scheduler
+]]
+local function storeJobScheduler(schedulerId, schedulerKey, repeatKey, nextMillis, opts,
+  templateData, templateOpts)
+  rcall("ZADD", repeatKey, nextMillis, schedulerId)
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+  if opts['limit'] then
+    table.insert(optionalValues, "limit")
+    table.insert(optionalValues, opts['limit'])
+  end
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+  if opts['startDate'] then
+    table.insert(optionalValues, "startDate")
+    table.insert(optionalValues, opts['startDate'])
+  end
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+  if opts['offset'] then
+    table.insert(optionalValues, "offset")
+    table.insert(optionalValues, opts['offset'])
+  else
+    local offset = rcall("HGET", schedulerKey, "offset")
+    if offset then
+      table.insert(optionalValues, "offset")
+      table.insert(optionalValues, tonumber(offset))
+    end
+  end
+  local jsonTemplateOpts = cjson.encode(templateOpts)
+  if jsonTemplateOpts and jsonTemplateOpts ~= '{}' then
+    table.insert(optionalValues, "opts")
+    table.insert(optionalValues, jsonTemplateOpts)
+  end
+  if templateData and templateData ~= '{}' then
+    table.insert(optionalValues, "data")
+    table.insert(optionalValues, templateData)
+  end
+  table.insert(optionalValues, "ic")
+  table.insert(optionalValues, rcall("HGET", schedulerKey, "ic") or 1)
+  rcall("DEL", schedulerKey) -- remove all attributes and then re-insert new ones
+  rcall("HMSET", schedulerKey, "name", opts['name'], unpack(optionalValues))
+end
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+local maxEvents = getOrSetMaxEvents(metaKey)
+local templateData = ARGV[4]
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+end
+local schedulerOpts = cmsgpack.unpack(ARGV[2])
+local every = schedulerOpts['every']
+-- For backwards compatibility we also check the offset from the job itself.
+-- could be removed in future major versions.
+local jobOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+local offset = schedulerOpts['offset'] or jobOffset or 0
+local newOffset = offset
+local updatedEvery = false
+if every then
+    -- if we changed the 'every' value we need to reset millis to nil
+    local millis = prevMillis
+    if prevMillis then
+        local prevEvery = tonumber(rcall("HGET", schedulerKey, "every"))
+        if prevEvery ~= every then
+            millis = nil
+            updatedEvery = true
+        end
+    end
+    local startDate = schedulerOpts['startDate']
+    nextMillis, newOffset = getJobSchedulerEveryNextMillis(millis, every, now, offset, startDate)
+end
+local function removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, jobId, metaKey,
+    eventsKey)
+    if rcall("ZSCORE", delayedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", delayedKey, jobId)
+        return true
+    elseif rcall("ZSCORE", prioritizedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", prioritizedKey, jobId)
+        return true
+    else
+        local pausedOrWaitKey = waitKey
+        if isQueuePaused(metaKey) then
+            pausedOrWaitKey = pausedKey
+        end
+        if rcall("LREM", pausedOrWaitKey, 1, jobId) > 0 then
+            removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+            return true
+        end
+    end
+    return false
+end
+local removedPrevJob = false
+if prevMillis then
+    local currentJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    local currentJobKey = schedulerKey .. ":" .. prevMillis
+    -- In theory it should always exist the currentJobKey if there is a prevMillis unless something has
+    -- gone really wrong.
+    if rcall("EXISTS", currentJobKey) == 1 then
+        removedPrevJob = removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, currentJobId,
+            metaKey, eventsKey)
+    end
+end
+if removedPrevJob then
+    -- The jobs has been removed and we want to replace it, so lets use the same millis.
+    if every and not updatedEvery then
+        nextMillis = prevMillis
+    end
+else
+    -- Special case where no job was removed, and we need to add the next iteration.
+    schedulerOpts['offset'] = newOffset
+end
+-- Check for job ID collision with existing jobs (in any state)
+local jobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+local jobKey = prefixKey .. jobId
+-- If there's already a job with this ID, in a state 
+-- that is not updatable (active, completed, failed) we must 
+-- handle the collision
+local hasCollision = false
+if rcall("EXISTS", jobKey) == 1 then
+    if every then
+        -- For 'every' case: try next time slot to avoid collision
+        local nextSlotMillis = nextMillis + every
+        local nextSlotJobId = "repeat:" .. jobSchedulerId .. ":" .. nextSlotMillis
+        local nextSlotJobKey = prefixKey .. nextSlotJobId
+        if rcall("EXISTS", nextSlotJobKey) == 0 then
+            -- Next slot is free, use it
+            nextMillis = nextSlotMillis
+            jobId = nextSlotJobId
+        else
+            -- Next slot also has a job, return error code
+            return -11 -- SchedulerJobSlotsBusy
+        end
+    else
+        hasCollision = true
+    end
+end
+local delay = nextMillis - now
+-- Fast Clamp delay to minimum of 0
+if delay < 0 then
+    delay = 0
+end
+local nextJobKey = schedulerKey .. ":" .. nextMillis
+if not hasCollision or removedPrevJob then
+    -- jobId already calculated above during collision check
+    storeJobScheduler(jobSchedulerId, schedulerKey, repeatKey, nextMillis, schedulerOpts, templateData, templateOpts)
+    rcall("INCR", KEYS[8])
+    addJobFromScheduler(nextJobKey, jobId, jobOpts, waitKey, pausedKey, KEYS[11], metaKey, prioritizedKey, KEYS[10],
+        delayedKey, KEYS[7], eventsKey, schedulerOpts['name'], maxEvents, now, templateData, jobSchedulerId, delay)
+elseif hasCollision then
+    -- For 'pattern' case: return error code
+    return -10 -- SchedulerJobIdCollision
+end
+if ARGV[9] ~= "" then
+    rcall("HSET", ARGV[9], "nrjid", jobId)
+end
+return {jobId .. "", delay}
+`;
+exports.addJobScheduler = {
+    name: 'addJobScheduler',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addLog-2.js b/node_modules/bullmq/dist/cjs/scripts/addLog-2.js
new file mode 100644
index 0000000..0910d91
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addLog-2.js
@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addLog = void 0;
+const content = `--[[
+  Add job log
+  Input:
+    KEYS[1] job id key
+    KEYS[2] job logs key
+    ARGV[1] id
+    ARGV[2] log
+    ARGV[3] keepLogs
+  Output:
+    -1 - Missing job.
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+  local logCount = rcall("RPUSH", KEYS[2], ARGV[2])
+  if ARGV[3] ~= '' then
+    local keepLogs = tonumber(ARGV[3])
+    rcall("LTRIM", KEYS[2], -keepLogs, -1)
+    return math.min(keepLogs, logCount)
+  end
+  return logCount
+else
+  return -1
+end
+`;
+exports.addLog = {
+    name: 'addLog',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addParentJob-6.js b/node_modules/bullmq/dist/cjs/scripts/addParentJob-6.js
new file mode 100644
index 0000000..97189da
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addParentJob-6.js
@@ -0,0 +1,476 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addParentJob = void 0;
+const content = `--[[
+  Adds a parent job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - adds the job to the waiting-children zset
+    Input:
+      KEYS[1] 'meta'
+      KEYS[2] 'id'
+      KEYS[3] 'delayed'
+      KEYS[4] 'waiting-children'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[1]
+local idKey = KEYS[2]
+local delayedKey = KEYS[3]
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationId = opts['de'] and opts['de']['id']
+if deduplicationId then
+    local deduplicationJobId = deduplicateJobWithoutReplace(deduplicationId, opts['de'],
+        jobId, deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationJobId then
+        return deduplicationJobId
+    end
+end
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+local waitChildrenKey = KEYS[4]
+rcall("ZADD", waitChildrenKey, timestamp, jobId)
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+      "waiting-children", "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+exports.addParentJob = {
+    name: 'addParentJob',
+    content,
+    keys: 6,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addPrioritizedJob-9.js b/node_modules/bullmq/dist/cjs/scripts/addPrioritizedJob-9.js
new file mode 100644
index 0000000..06d4f2c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addPrioritizedJob-9.js
@@ -0,0 +1,549 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addPrioritizedJob = void 0;
+const content = `--[[
+  Adds a prioritized job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - Adds the job to the "added" list so that workers gets notified.
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'prioritized'
+      KEYS[5] 'delayed'
+      KEYS[6] 'completed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] 'pc' priority counter
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]] 
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local priorityKey = KEYS[4]
+local completedKey = KEYS[6]
+local activeKey = KEYS[7]
+local eventsKey = KEYS[8]
+local priorityCounterKey = KEYS[9]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[5],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+-- Store the job.
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+                                 opts, timestamp, parentKey, parentData,
+                                 repeatJobKey)
+-- Add the job to the prioritized set
+local isPausedOrMaxed = isQueuePausedOrMaxed(metaKey, activeKey)
+addJobWithPriority( KEYS[1], priorityKey, priority, jobId, priorityCounterKey, isPausedOrMaxed)
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+exports.addPrioritizedJob = {
+    name: 'addPrioritizedJob',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addRepeatableJob-2.js b/node_modules/bullmq/dist/cjs/scripts/addRepeatableJob-2.js
new file mode 100644
index 0000000..271b031
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addRepeatableJob-2.js
@@ -0,0 +1,237 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addRepeatableJob = void 0;
+const content = `--[[
+  Adds a repeatable job
+    Input:
+      KEYS[1] 'repeat' key
+      KEYS[2] 'delayed' key
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      ARGV[4] custom key
+      ARGV[5] prefix key
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local nextMillis = ARGV[1]
+local legacyCustomKey = ARGV[3]
+local customKey = ARGV[4]
+local prefixKey = ARGV[5]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function storeRepeatableJob(repeatKey, customKey, nextMillis, rawOpts)
+  rcall("ZADD", repeatKey, nextMillis, customKey)
+  local opts = cmsgpack.unpack(rawOpts)
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+  rcall("HMSET", repeatKey .. ":" .. customKey, "name", opts['name'],
+    unpack(optionalValues))
+  return customKey
+end
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local prevMillis = rcall("ZSCORE", repeatKey, customKey)
+if prevMillis then
+  local delayedJobId =  "repeat:" .. customKey .. ":" .. prevMillis
+  local nextDelayedJobId =  repeatKey .. ":" .. customKey .. ":" .. nextMillis
+  if rcall("ZSCORE", delayedKey, delayedJobId)
+   and rcall("EXISTS", nextDelayedJobId) ~= 1 then
+    removeJob(delayedJobId, true, prefixKey, true --[[remove debounce key]])
+    rcall("ZREM", delayedKey, delayedJobId)
+  end
+end
+-- Keep backwards compatibility with old repeatable jobs (<= 3.0.0)
+if rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+  return storeRepeatableJob(repeatKey, legacyCustomKey, nextMillis, ARGV[2])
+end
+return storeRepeatableJob(repeatKey, customKey, nextMillis, ARGV[2])
+`;
+exports.addRepeatableJob = {
+    name: 'addRepeatableJob',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/addStandardJob-9.js b/node_modules/bullmq/dist/cjs/scripts/addStandardJob-9.js
new file mode 100644
index 0000000..191e9b4
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/addStandardJob-9.js
@@ -0,0 +1,553 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addStandardJob = void 0;
+const content = `--[[
+  Adds a job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - if delayed:
+      - computes timestamp.
+      - adds to delayed zset.
+      - Emits a global event 'delayed' if the job is delayed.
+    - if not delayed
+      - Adds the jobId to the wait/paused list in one of three ways:
+         - LIFO
+         - FIFO
+         - prioritized.
+      - Adds the job to the "added" list so that workers gets notified.
+    Input:
+      KEYS[1] 'wait',
+      KEYS[2] 'paused'
+      KEYS[3] 'meta'
+      KEYS[4] 'id'
+      KEYS[5] 'completed'
+      KEYS[6] 'delayed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] marker key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local eventsKey = KEYS[8]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", KEYS[4])
+local metaKey = KEYS[3]
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, KEYS[5], eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[6],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[1], KEYS[2])
+-- LIFO or FIFO
+local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+addJobInTargetList(target, KEYS[9], pushCmd, isPausedOrMaxed, jobId)
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+exports.addStandardJob = {
+    name: 'addStandardJob',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/changeDelay-4.js b/node_modules/bullmq/dist/cjs/scripts/changeDelay-4.js
new file mode 100644
index 0000000..a3e701b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/changeDelay-4.js
@@ -0,0 +1,106 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.changeDelay = void 0;
+const content = `--[[
+  Change job delay when it is in delayed set.
+  Input:
+    KEYS[1] delayed key
+    KEYS[2] meta key
+    KEYS[3] marker key
+    KEYS[4] events stream
+    ARGV[1] delay
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] job key
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in delayed set.
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+if rcall("EXISTS", ARGV[4]) == 1 then
+  local jobId = ARGV[3]
+  local delay = tonumber(ARGV[1])
+  local score, delayedTimestamp = getDelayedScore(KEYS[1], ARGV[2], delay)
+  local numRemovedElements = rcall("ZREM", KEYS[1], jobId)
+  if numRemovedElements < 1 then
+    return -3
+  end
+  rcall("HSET", ARGV[4], "delay", delay)
+  rcall("ZADD", KEYS[1], score, jobId)
+  local maxEvents = getOrSetMaxEvents(KEYS[2])
+  rcall("XADD", KEYS[4], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(KEYS[3], KEYS[1])
+  return 0
+else
+  return -1
+end`;
+exports.changeDelay = {
+    name: 'changeDelay',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/changePriority-7.js b/node_modules/bullmq/dist/cjs/scripts/changePriority-7.js
new file mode 100644
index 0000000..52942cd
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/changePriority-7.js
@@ -0,0 +1,127 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.changePriority = void 0;
+const content = `--[[
+  Change job priority
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'active'
+    KEYS[6] 'pc' priority counter
+    KEYS[7] 'marker'
+    ARGV[1] priority value
+    ARGV[2] prefix key
+    ARGV[3] job id
+    ARGV[4] lifo
+    Output:
+       0  - OK
+      -1  - Missing job
+]]
+local jobId = ARGV[3]
+local jobKey = ARGV[2] .. jobId
+local priority = tonumber(ARGV[1])
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
+local function reAddJobWithNewPriority( prioritizedKey, markerKey, targetKey,
+    priorityCounter, lifo, priority, jobId, isPausedOrMaxed)
+    if priority == 0 then
+        local pushCmd = lifo and 'RPUSH' or 'LPUSH'
+        addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    else
+        if lifo then
+            pushBackJobWithPriority(prioritizedKey, priority, jobId)
+        else
+            addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+                priorityCounter, isPausedOrMaxed)
+        end
+    end
+end
+if rcall("EXISTS", jobKey) == 1 then
+    local metaKey = KEYS[3]
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[5], KEYS[1], KEYS[2])
+    local prioritizedKey = KEYS[4]
+    local priorityCounterKey = KEYS[6]
+    local markerKey = KEYS[7]
+    -- Re-add with the new priority
+    if rcall("ZREM", prioritizedKey, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    elseif rcall("LREM", target, -1, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    end
+    rcall("HSET", jobKey, "priority", priority)
+    return 0
+else
+    return -1
+end
+`;
+exports.changePriority = {
+    name: 'changePriority',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/cleanJobsInSet-3.js b/node_modules/bullmq/dist/cjs/scripts/cleanJobsInSet-3.js
new file mode 100644
index 0000000..be35f75
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/cleanJobsInSet-3.js
@@ -0,0 +1,368 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cleanJobsInSet = void 0;
+const content = `--[[
+  Remove jobs from the specific set.
+  Input:
+    KEYS[1]  set key,
+    KEYS[2]  events stream key
+    KEYS[3]  repeat key
+    ARGV[1]  jobKey prefix
+    ARGV[2]  timestamp
+    ARGV[3]  limit the number of jobs to be removed. 0 is unlimited
+    ARGV[4]  set name, can be any of 'wait', 'active', 'paused', 'delayed', 'completed', or 'failed'
+]]
+local rcall = redis.call
+local repeatKey = KEYS[3]
+local rangeStart = 0
+local rangeEnd = -1
+local limit = tonumber(ARGV[3])
+-- If we're only deleting _n_ items, avoid retrieving all items
+-- for faster performance
+--
+-- Start from the tail of the list, since that's where oldest elements
+-- are generally added for FIFO lists
+if limit > 0 then
+  rangeStart = -1 - limit + 1
+  rangeEnd = -1
+end
+-- Includes
+--[[
+  Function to clean job list.
+  Returns jobIds and deleted count number.
+]]
+-- Includes
+--[[
+  Function to get the latest saved timestamp.
+]]
+local function getTimestamp(jobKey, attributes)
+  if #attributes == 1 then
+    return rcall("HGET", jobKey, attributes[1])
+  end
+  local jobTs
+  for _, ts in ipairs(rcall("HMGET", jobKey, unpack(attributes))) do
+    if (ts) then
+      jobTs = ts
+      break
+    end
+  end
+  return jobTs
+end
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function cleanList(listKey, jobKeyPrefix, rangeStart, rangeEnd,
+  timestamp, isWaiting, jobSchedulersKey)
+  local jobs = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  local deleted = {}
+  local deletedCount = 0
+  local jobTS
+  local deletionMarker = ''
+  local jobIdsLen = #jobs
+  for i, job in ipairs(jobs) do
+    if limit > 0 and deletedCount >= limit then
+      break
+    end
+    local jobKey = jobKeyPrefix .. job
+    if (isWaiting or rcall("EXISTS", jobKey .. ":lock") == 0) and
+      not isJobSchedulerJob(job, jobKey, jobSchedulersKey) then
+      -- Find the right timestamp of the job to compare to maxTimestamp:
+      -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+      -- * processedOn represents when the job was last attempted, but it doesn't get populated until
+      --   the job is first tried
+      -- * timestamp is the original job submission time
+      -- Fetch all three of these (in that order) and use the first one that is set so that we'll leave jobs
+      -- that have been active within the grace period:
+      jobTS = getTimestamp(jobKey, {"finishedOn", "processedOn", "timestamp"})
+      if (not jobTS or jobTS <= timestamp) then
+        -- replace the entry with a deletion marker; the actual deletion will
+        -- occur at the end of the script
+        rcall("LSET", listKey, rangeEnd - jobIdsLen + i, deletionMarker)
+        removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]])
+        deletedCount = deletedCount + 1
+        table.insert(deleted, job)
+      end
+    end
+  end
+  rcall("LREM", listKey, 0, deletionMarker)
+  return {deleted, deletedCount}
+end
+--[[
+  Function to clean job set.
+  Returns jobIds and deleted count number.
+]] 
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  We use ZRANGEBYSCORE to make the case where we're deleting a limited number
+  of items in a sorted set only run a single iteration. If we simply used
+  ZRANGE, we may take a long time traversing through jobs that are within the
+  grace period.
+]]
+local function getJobsInZset(zsetKey, rangeEnd, limit)
+  if limit > 0 then
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd, "LIMIT", 0, limit)
+  else
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd)
+  end
+end
+local function cleanSet(
+    setKey,
+    jobKeyPrefix,
+    rangeEnd,
+    timestamp,
+    limit,
+    attributes,
+    isFinished,
+    jobSchedulersKey)
+    local jobs = getJobsInZset(setKey, rangeEnd, limit)
+    local deleted = {}
+    local deletedCount = 0
+    local jobTS
+    for i, job in ipairs(jobs) do
+        if limit > 0 and deletedCount >= limit then
+            break
+        end
+        local jobKey = jobKeyPrefix .. job
+        -- Extract a Job Scheduler Id from jobId ("repeat:job-scheduler-id:millis") 
+        -- and check if it is in the scheduled jobs
+        if not (jobSchedulersKey and isJobSchedulerJob(job, jobKey, jobSchedulersKey)) then
+            if isFinished then
+                removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                deletedCount = deletedCount + 1
+                table.insert(deleted, job)
+            else
+                -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+                jobTS = getTimestamp(jobKey, attributes)
+                if (not jobTS or jobTS <= timestamp) then
+                    removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                    deletedCount = deletedCount + 1
+                    table.insert(deleted, job)
+                end
+            end
+        end
+    end
+    if (#deleted > 0) then
+        for from, to in batches(#deleted, 7000) do
+            rcall("ZREM", setKey, unpack(deleted, from, to))
+        end
+    end
+    return {deleted, deletedCount}
+end
+local result
+if ARGV[4] == "active" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], false --[[ hasFinished ]],
+                      repeatKey)
+elseif ARGV[4] == "delayed" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"processedOn", "timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "prioritized" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "wait" or ARGV[4] == "paused" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], true --[[ hasFinished ]],
+                      repeatKey)
+else
+  rangeEnd = ARGV[2]
+  -- No need to pass repeat key as in that moment job won't be related to a job scheduler
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"finishedOn"}, true  --[[ hasFinished ]])
+end
+rcall("XADD", KEYS[2], "*", "event", "cleaned", "count", result[2])
+return result[1]
+`;
+exports.cleanJobsInSet = {
+    name: 'cleanJobsInSet',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/drain-5.js b/node_modules/bullmq/dist/cjs/scripts/drain-5.js
new file mode 100644
index 0000000..9f988d0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/drain-5.js
@@ -0,0 +1,274 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.drain = void 0;
+const content = `--[[
+  Drains the queue, removes all jobs that are waiting
+  or delayed, but not active, completed or failed
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'delayed'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'jobschedulers' (repeat)
+    ARGV[1]  queue key prefix
+    ARGV[2]  should clean delayed jobs
+]]
+local rcall = redis.call
+local queueBaseKey = ARGV[1]
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get ZSet items.
+]]
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
+-- We must not remove delayed jobs if they are associated to a job scheduler.
+local scheduledJobs = {}
+local jobSchedulers = rcall("ZRANGE", KEYS[5], 0, -1, "WITHSCORES")
+-- For every job scheduler, get the current delayed job id.
+for i = 1, #jobSchedulers, 2 do
+    local jobSchedulerId = jobSchedulers[i]
+    local jobSchedulerMillis = jobSchedulers[i + 1]
+    local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. jobSchedulerMillis
+    scheduledJobs[delayedJobId] = true
+end
+removeListJobs(KEYS[1], true, queueBaseKey, 0, scheduledJobs) -- wait
+removeListJobs(KEYS[2], true, queueBaseKey, 0, scheduledJobs) -- paused
+if ARGV[2] == "1" then
+  removeZSetJobs(KEYS[3], true, queueBaseKey, 0, scheduledJobs) -- delayed
+end
+removeZSetJobs(KEYS[4], true, queueBaseKey, 0, scheduledJobs) -- prioritized
+`;
+exports.drain = {
+    name: 'drain',
+    content,
+    keys: 5,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/extendLock-2.js b/node_modules/bullmq/dist/cjs/scripts/extendLock-2.js
new file mode 100644
index 0000000..2e7ac6f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/extendLock-2.js
@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.extendLock = void 0;
+const content = `--[[
+  Extend lock and removes the job from the stalled set.
+  Input:
+    KEYS[1] 'lock',
+    KEYS[2] 'stalled'
+    ARGV[1]  token
+    ARGV[2]  lock duration in milliseconds
+    ARGV[3]  jobid
+  Output:
+    "1" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  --   if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2], "XX") then
+  if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2]) then
+    rcall("SREM", KEYS[2], ARGV[3])
+    return 1
+  end
+end
+return 0
+`;
+exports.extendLock = {
+    name: 'extendLock',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/extendLocks-1.js b/node_modules/bullmq/dist/cjs/scripts/extendLocks-1.js
new file mode 100644
index 0000000..8128f97
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/extendLocks-1.js
@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.extendLocks = void 0;
+const content = `--[[
+  Extend locks for multiple jobs and remove them from the stalled set if successful.
+  Return the list of job IDs for which the operation failed.
+  KEYS[1] = stalled key
+  ARGV[1] = baseKey
+  ARGV[2] = tokens
+  ARGV[3] = jobIds
+  ARGV[4] = lockDuration (ms)
+  Output:
+    An array of failed job IDs. If empty, all succeeded.
+]]
+local rcall = redis.call
+local stalledKey = KEYS[1]
+local baseKey = ARGV[1]
+local tokens = cmsgpack.unpack(ARGV[2])
+local jobIds = cmsgpack.unpack(ARGV[3])
+local lockDuration = ARGV[4]
+local jobCount = #jobIds
+local failedJobs = {}
+for i = 1, jobCount, 1 do
+    local lockKey = baseKey .. jobIds[i] .. ':lock'
+    local jobId = jobIds[i]
+    local token = tokens[i]
+    local currentToken = rcall("GET", lockKey)
+    if currentToken then
+        if currentToken == token then
+            local setResult = rcall("SET", lockKey, token, "PX", lockDuration)
+            if setResult then
+                rcall("SREM", stalledKey, jobId)
+            else
+                table.insert(failedJobs, jobId)
+            end
+        else
+            table.insert(failedJobs, jobId)
+        end
+    else
+        table.insert(failedJobs, jobId)
+    end
+end
+return failedJobs
+`;
+exports.extendLocks = {
+    name: 'extendLocks',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getCounts-1.js b/node_modules/bullmq/dist/cjs/scripts/getCounts-1.js
new file mode 100644
index 0000000..04a0add
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getCounts-1.js
@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCounts = void 0;
+const content = `--[[
+  Get counts per provided states
+    Input:
+      KEYS[1]    'prefix'
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local prefix = KEYS[1]
+local results = {}
+for i = 1, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        results[#results+1] = count-1
+      else
+        results[#results+1] = 0
+      end
+    else
+      results[#results+1] = rcall("LLEN", stateKey)
+    end
+  elseif ARGV[i] == "active" then
+    results[#results+1] = rcall("LLEN", stateKey)
+  else
+    results[#results+1] = rcall("ZCARD", stateKey)
+  end
+end
+return results
+`;
+exports.getCounts = {
+    name: 'getCounts',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getCountsPerPriority-4.js b/node_modules/bullmq/dist/cjs/scripts/getCountsPerPriority-4.js
new file mode 100644
index 0000000..178d108
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getCountsPerPriority-4.js
@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCountsPerPriority = void 0;
+const content = `--[[
+  Get counts per provided states
+    Input:
+      KEYS[1] wait key
+      KEYS[2] paused key
+      KEYS[3] meta key
+      KEYS[4] prioritized key
+      ARGV[1...] priorities
+]]
+local rcall = redis.call
+local results = {}
+local waitKey = KEYS[1]
+local pausedKey = KEYS[2]
+local prioritizedKey = KEYS[4]
+-- Includes
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
+for i = 1, #ARGV do
+  local priority = tonumber(ARGV[i])
+  if priority == 0 then
+    if isQueuePaused(KEYS[3]) then
+      results[#results+1] = rcall("LLEN", pausedKey)
+    else
+      results[#results+1] = rcall("LLEN", waitKey)
+    end
+  else
+    results[#results+1] = rcall("ZCOUNT", prioritizedKey,
+      priority * 0x100000000, (priority + 1)  * 0x100000000 - 1)
+  end
+end
+return results
+`;
+exports.getCountsPerPriority = {
+    name: 'getCountsPerPriority',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getDependencyCounts-4.js b/node_modules/bullmq/dist/cjs/scripts/getDependencyCounts-4.js
new file mode 100644
index 0000000..feacc6a
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getDependencyCounts-4.js
@@ -0,0 +1,36 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDependencyCounts = void 0;
+const content = `--[[
+  Get counts per child states
+    Input:
+      KEYS[1]    processed key
+      KEYS[2]    unprocessed key
+      KEYS[3]    ignored key
+      KEYS[4]    failed key
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local processedKey = KEYS[1]
+local unprocessedKey = KEYS[2]
+local ignoredKey = KEYS[3]
+local failedKey = KEYS[4]
+local results = {}
+for i = 1, #ARGV do
+  if ARGV[i] == "processed" then
+    results[#results+1] = rcall("HLEN", processedKey)
+  elseif ARGV[i] == "unprocessed" then
+    results[#results+1] = rcall("SCARD", unprocessedKey)
+  elseif ARGV[i] == "ignored" then
+    results[#results+1] = rcall("HLEN", ignoredKey)
+  else
+    results[#results+1] = rcall("ZCARD", failedKey)
+  end
+end
+return results
+`;
+exports.getDependencyCounts = {
+    name: 'getDependencyCounts',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getJobScheduler-1.js b/node_modules/bullmq/dist/cjs/scripts/getJobScheduler-1.js
new file mode 100644
index 0000000..f2ed798
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getJobScheduler-1.js
@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getJobScheduler = void 0;
+const content = `--[[
+  Get job scheduler record.
+  Input:
+    KEYS[1] 'repeat' key
+    ARGV[1] id
+]]
+local rcall = redis.call
+local jobSchedulerKey = KEYS[1] .. ":" .. ARGV[1]
+local score = rcall("ZSCORE", KEYS[1], ARGV[1])
+if score then
+  return {rcall("HGETALL", jobSchedulerKey), score} -- get job data
+end
+return {nil, nil}
+`;
+exports.getJobScheduler = {
+    name: 'getJobScheduler',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getMetrics-2.js b/node_modules/bullmq/dist/cjs/scripts/getMetrics-2.js
new file mode 100644
index 0000000..14a4155
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getMetrics-2.js
@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getMetrics = void 0;
+const content = `--[[
+  Get metrics
+  Input:
+    KEYS[1] 'metrics' key
+    KEYS[2] 'metrics data' key
+    ARGV[1] start index
+    ARGV[2] end index
+]]
+local rcall = redis.call;
+local metricsKey = KEYS[1]
+local dataKey = KEYS[2]
+local metrics = rcall("HMGET", metricsKey, "count", "prevTS", "prevCount")
+local data = rcall("LRANGE", dataKey, tonumber(ARGV[1]), tonumber(ARGV[2]))
+local numPoints = rcall("LLEN", dataKey)
+return {metrics, data, numPoints}
+`;
+exports.getMetrics = {
+    name: 'getMetrics',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getRanges-1.js b/node_modules/bullmq/dist/cjs/scripts/getRanges-1.js
new file mode 100644
index 0000000..f8352ac
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getRanges-1.js
@@ -0,0 +1,72 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRanges = void 0;
+const content = `--[[
+  Get job ids per provided states
+    Input:
+      KEYS[1]    'prefix'
+      ARGV[1]    start
+      ARGV[2]    end
+      ARGV[3]    asc
+      ARGV[4...] types
+]]
+local rcall = redis.call
+local prefix = KEYS[1]
+local rangeStart = tonumber(ARGV[1])
+local rangeEnd = tonumber(ARGV[2])
+local asc = ARGV[3]
+local results = {}
+local function getRangeInList(listKey, asc, rangeStart, rangeEnd, results)
+  if asc == "1" then
+    local modifiedRangeStart
+    local modifiedRangeEnd
+    if rangeStart == -1 then
+      modifiedRangeStart = 0
+    else
+      modifiedRangeStart = -(rangeStart + 1)
+    end
+    if rangeEnd == -1 then
+      modifiedRangeEnd = 0
+    else
+      modifiedRangeEnd = -(rangeEnd + 1)
+    end
+    results[#results+1] = rcall("LRANGE", listKey,
+      modifiedRangeEnd,
+      modifiedRangeStart)
+  else
+    results[#results+1] = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  end
+end
+for i = 4, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+      else
+        results[#results+1] = {}
+      end
+    else
+      getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+    end
+  elseif ARGV[i] == "active" then
+    getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+  else
+    if asc == "1" then
+      results[#results+1] = rcall("ZRANGE", stateKey, rangeStart, rangeEnd)
+    else
+      results[#results+1] = rcall("ZREVRANGE", stateKey, rangeStart, rangeEnd)
+    end
+  end
+end
+return results
+`;
+exports.getRanges = {
+    name: 'getRanges',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getRateLimitTtl-2.js b/node_modules/bullmq/dist/cjs/scripts/getRateLimitTtl-2.js
new file mode 100644
index 0000000..62292c3
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getRateLimitTtl-2.js
@@ -0,0 +1,43 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getRateLimitTtl = void 0;
+const content = `--[[
+  Get rate limit ttl
+    Input:
+      KEYS[1] 'limiter'
+      KEYS[2] 'meta'
+      ARGV[1] maxJobs
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+local rateLimiterKey = KEYS[1]
+if ARGV[1] ~= "0" then
+  return getRateLimitTTL(tonumber(ARGV[1]), rateLimiterKey)
+else
+  local rateLimitMax = rcall("HGET", KEYS[2], "max")
+  if rateLimitMax then
+    return getRateLimitTTL(tonumber(rateLimitMax), rateLimiterKey)
+  end
+  return rcall("PTTL", rateLimiterKey)
+end
+`;
+exports.getRateLimitTtl = {
+    name: 'getRateLimitTtl',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getState-8.js b/node_modules/bullmq/dist/cjs/scripts/getState-8.js
new file mode 100644
index 0000000..ab4a002
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getState-8.js
@@ -0,0 +1,72 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getState = void 0;
+const content = `--[[
+  Get a job state
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'prioritized'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+-- Includes
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local active_items = rcall("LRANGE", KEYS[4] , 0, -1)
+if checkItemInList(active_items, ARGV[1]) ~= nil then
+  return "active"
+end
+local wait_items = rcall("LRANGE", KEYS[5] , 0, -1)
+if checkItemInList(wait_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+local paused_items = rcall("LRANGE", KEYS[6] , 0, -1)
+if checkItemInList(paused_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+if rcall("ZSCORE", KEYS[7], ARGV[1]) then
+  return "waiting-children"
+end
+return "unknown"
+`;
+exports.getState = {
+    name: 'getState',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/getStateV2-8.js b/node_modules/bullmq/dist/cjs/scripts/getStateV2-8.js
new file mode 100644
index 0000000..f2df2fc
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/getStateV2-8.js
@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getStateV2 = void 0;
+const content = `--[[
+  Get a job state
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+if rcall("LPOS", KEYS[4] , ARGV[1]) then
+  return "active"
+end
+if rcall("LPOS", KEYS[5] , ARGV[1]) then
+  return "waiting"
+end
+if rcall("LPOS", KEYS[6] , ARGV[1]) then
+  return "waiting"
+end
+if rcall("ZSCORE", KEYS[7] , ARGV[1]) then
+  return "waiting-children"
+end
+return "unknown"
+`;
+exports.getStateV2 = {
+    name: 'getStateV2',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/index.js b/node_modules/bullmq/dist/cjs/scripts/index.js
new file mode 100644
index 0000000..6050259
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/index.js
@@ -0,0 +1,54 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./addDelayedJob-6"), exports);
+tslib_1.__exportStar(require("./addJobScheduler-11"), exports);
+tslib_1.__exportStar(require("./addLog-2"), exports);
+tslib_1.__exportStar(require("./addParentJob-6"), exports);
+tslib_1.__exportStar(require("./addPrioritizedJob-9"), exports);
+tslib_1.__exportStar(require("./addRepeatableJob-2"), exports);
+tslib_1.__exportStar(require("./addStandardJob-9"), exports);
+tslib_1.__exportStar(require("./changeDelay-4"), exports);
+tslib_1.__exportStar(require("./changePriority-7"), exports);
+tslib_1.__exportStar(require("./cleanJobsInSet-3"), exports);
+tslib_1.__exportStar(require("./drain-5"), exports);
+tslib_1.__exportStar(require("./extendLock-2"), exports);
+tslib_1.__exportStar(require("./extendLocks-1"), exports);
+tslib_1.__exportStar(require("./getCounts-1"), exports);
+tslib_1.__exportStar(require("./getCountsPerPriority-4"), exports);
+tslib_1.__exportStar(require("./getDependencyCounts-4"), exports);
+tslib_1.__exportStar(require("./getJobScheduler-1"), exports);
+tslib_1.__exportStar(require("./getMetrics-2"), exports);
+tslib_1.__exportStar(require("./getRanges-1"), exports);
+tslib_1.__exportStar(require("./getRateLimitTtl-2"), exports);
+tslib_1.__exportStar(require("./getState-8"), exports);
+tslib_1.__exportStar(require("./getStateV2-8"), exports);
+tslib_1.__exportStar(require("./isFinished-3"), exports);
+tslib_1.__exportStar(require("./isJobInList-1"), exports);
+tslib_1.__exportStar(require("./isMaxed-2"), exports);
+tslib_1.__exportStar(require("./moveJobFromActiveToWait-9"), exports);
+tslib_1.__exportStar(require("./moveJobsToWait-8"), exports);
+tslib_1.__exportStar(require("./moveStalledJobsToWait-8"), exports);
+tslib_1.__exportStar(require("./moveToActive-11"), exports);
+tslib_1.__exportStar(require("./moveToDelayed-12"), exports);
+tslib_1.__exportStar(require("./moveToFinished-14"), exports);
+tslib_1.__exportStar(require("./moveToWaitingChildren-7"), exports);
+tslib_1.__exportStar(require("./obliterate-2"), exports);
+tslib_1.__exportStar(require("./paginate-1"), exports);
+tslib_1.__exportStar(require("./pause-7"), exports);
+tslib_1.__exportStar(require("./promote-9"), exports);
+tslib_1.__exportStar(require("./releaseLock-1"), exports);
+tslib_1.__exportStar(require("./removeChildDependency-1"), exports);
+tslib_1.__exportStar(require("./removeDeduplicationKey-1"), exports);
+tslib_1.__exportStar(require("./removeJob-2"), exports);
+tslib_1.__exportStar(require("./removeJobScheduler-3"), exports);
+tslib_1.__exportStar(require("./removeOrphanedJobs-1"), exports);
+tslib_1.__exportStar(require("./removeRepeatable-3"), exports);
+tslib_1.__exportStar(require("./removeUnprocessedChildren-2"), exports);
+tslib_1.__exportStar(require("./reprocessJob-8"), exports);
+tslib_1.__exportStar(require("./retryJob-11"), exports);
+tslib_1.__exportStar(require("./saveStacktrace-1"), exports);
+tslib_1.__exportStar(require("./updateData-1"), exports);
+tslib_1.__exportStar(require("./updateJobScheduler-12"), exports);
+tslib_1.__exportStar(require("./updateProgress-3"), exports);
+tslib_1.__exportStar(require("./updateRepeatableJobMillis-1"), exports);
diff --git a/node_modules/bullmq/dist/cjs/scripts/isFinished-3.js b/node_modules/bullmq/dist/cjs/scripts/isFinished-3.js
new file mode 100644
index 0000000..a031b2c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/isFinished-3.js
@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isFinished = void 0;
+const content = `--[[
+  Checks if a job is finished (.i.e. is in the completed or failed set)
+  Input: 
+    KEYS[1] completed key
+    KEYS[2] failed key
+    KEYS[3] job key
+    ARGV[1] job id
+    ARGV[2] return value?
+  Output:
+    0 - Not finished.
+    1 - Completed.
+    2 - Failed.
+   -1 - Missing job. 
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[3]) ~= 1 then
+  if ARGV[2] == "1" then
+    return {-1,"Missing key for job " .. KEYS[3] .. ". isFinished"}
+  end  
+  return -1
+end
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local returnValue = rcall("HGET", KEYS[3], "returnvalue")
+    return {1,returnValue}
+  end
+  return 1
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local failedReason = rcall("HGET", KEYS[3], "failedReason")
+    return {2,failedReason}
+  end
+  return 2
+end
+if ARGV[2] == "1" then
+  return {0}
+end
+return 0
+`;
+exports.isFinished = {
+    name: 'isFinished',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/isJobInList-1.js b/node_modules/bullmq/dist/cjs/scripts/isJobInList-1.js
new file mode 100644
index 0000000..3a2140c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/isJobInList-1.js
@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isJobInList = void 0;
+const content = `--[[
+  Checks if job is in a given list.
+  Input:
+    KEYS[1]
+    ARGV[1]
+  Output:
+    1 if element found in the list.
+]]
+-- Includes
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local items = redis.call("LRANGE", KEYS[1] , 0, -1)
+return checkItemInList(items, ARGV[1])
+`;
+exports.isJobInList = {
+    name: 'isJobInList',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/isMaxed-2.js b/node_modules/bullmq/dist/cjs/scripts/isMaxed-2.js
new file mode 100644
index 0000000..b7daeb0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/isMaxed-2.js
@@ -0,0 +1,33 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isMaxed = void 0;
+const content = `--[[
+  Checks if queue is maxed.
+  Input:
+    KEYS[1] meta key
+    KEYS[2] active key
+  Output:
+    1 if element found in the list.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to check if queue is maxed or not.
+]]
+local function isQueueMaxed(queueMetaKey, activeKey)
+  local maxConcurrency = rcall("HGET", queueMetaKey, "concurrency")
+  if maxConcurrency then
+    local activeCount = rcall("LLEN", activeKey)
+    if activeCount >= tonumber(maxConcurrency) then
+      return true
+    end
+  end
+  return false
+end
+return isQueueMaxed(KEYS[1], KEYS[2])
+`;
+exports.isMaxed = {
+    name: 'isMaxed',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveJobFromActiveToWait-9.js b/node_modules/bullmq/dist/cjs/scripts/moveJobFromActiveToWait-9.js
new file mode 100644
index 0000000..30bc14b
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveJobFromActiveToWait-9.js
@@ -0,0 +1,133 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveJobFromActiveToWait = void 0;
+const content = `--[[
+  Function to move job from active state to wait.
+  Input:
+    KEYS[1]  active key
+    KEYS[2]  wait key
+    KEYS[3]  stalled key
+    KEYS[4]  paused key
+    KEYS[5]  meta key
+    KEYS[6]  limiter key
+    KEYS[7]  prioritized key
+    KEYS[8]  marker key
+    KEYS[9]  event key
+    ARGV[1] job id
+    ARGV[2] lock token
+    ARGV[3] job id key
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+local jobId = ARGV[1]
+local token = ARGV[2]
+local jobKey = ARGV[3]
+if rcall("EXISTS", jobKey) == 0 then
+  return -1
+end
+local errorCode = removeLock(jobKey, KEYS[3], token, jobId)
+if errorCode < 0 then
+  return errorCode
+end
+local metaKey = KEYS[5]
+local removed = rcall("LREM", KEYS[1], 1, jobId)
+if removed > 0 then
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[1], KEYS[2], KEYS[4])
+  local priority = tonumber(rcall("HGET", ARGV[3], "priority")) or 0
+  if priority > 0 then
+    pushBackJobWithPriority(KEYS[7], priority, jobId)
+  else
+    addJobInTargetList(target, KEYS[8], "RPUSH", isPausedOrMaxed, jobId)
+  end
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  -- Emit waiting event
+  rcall("XADD", KEYS[9], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", jobId, "prev", "active")
+end
+local pttl = rcall("PTTL", KEYS[6])
+if pttl > 0 then
+  return pttl
+else
+  return 0
+end
+`;
+exports.moveJobFromActiveToWait = {
+    name: 'moveJobFromActiveToWait',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveJobsToWait-8.js b/node_modules/bullmq/dist/cjs/scripts/moveJobsToWait-8.js
new file mode 100644
index 0000000..94580e6
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveJobsToWait-8.js
@@ -0,0 +1,117 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveJobsToWait = void 0;
+const content = `--[[
+  Move completed, failed or delayed jobs to wait.
+  Note: Does not support jobs with priorities.
+  Input:
+    KEYS[1] base key
+    KEYS[2] events stream
+    KEYS[3] state key (failed, completed, delayed)
+    KEYS[4] 'wait'
+    KEYS[5] 'paused'
+    KEYS[6] 'meta'
+    KEYS[7] 'active'
+    KEYS[8] 'marker'
+    ARGV[1] count
+    ARGV[2] timestamp
+    ARGV[3] prev state
+  Output:
+    1  means the operation is not completed
+    0  means the operation is completed
+]]
+local maxCount = tonumber(ARGV[1])
+local timestamp = tonumber(ARGV[2])
+local rcall = redis.call;
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local metaKey = KEYS[6]
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[4], KEYS[5])
+local jobs = rcall('ZRANGEBYSCORE', KEYS[3], 0, timestamp, 'LIMIT', 0, maxCount)
+if (#jobs > 0) then
+    if ARGV[3] == "failed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "failedReason")
+        end
+    elseif ARGV[3] == "completed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "returnvalue")
+        end
+    end
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    for i, key in ipairs(jobs) do
+        -- Emit waiting event
+        rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event",
+              "waiting", "jobId", key, "prev", ARGV[3]);
+    end
+    for from, to in batches(#jobs, 7000) do
+        rcall("ZREM", KEYS[3], unpack(jobs, from, to))
+        rcall("LPUSH", target, unpack(jobs, from, to))
+    end
+    addBaseMarkerIfNeeded(KEYS[8], isPausedOrMaxed)
+end
+maxCount = maxCount - #jobs
+if (maxCount <= 0) then return 1 end
+return 0
+`;
+exports.moveJobsToWait = {
+    name: 'moveJobsToWait',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveStalledJobsToWait-8.js b/node_modules/bullmq/dist/cjs/scripts/moveStalledJobsToWait-8.js
new file mode 100644
index 0000000..fce4401
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveStalledJobsToWait-8.js
@@ -0,0 +1,184 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveStalledJobsToWait = void 0;
+const content = `--[[
+  Move stalled jobs to wait.
+    Input:
+      KEYS[1] 'stalled' (SET)
+      KEYS[2] 'wait',   (LIST)
+      KEYS[3] 'active', (LIST)
+      KEYS[4] 'stalled-check', (KEY)
+      KEYS[5] 'meta', (KEY)
+      KEYS[6] 'paused', (LIST)
+      KEYS[7] 'marker'
+      KEYS[8] 'event stream' (STREAM)
+      ARGV[1]  Max stalled job count
+      ARGV[2]  queue.toKey('')
+      ARGV[3]  timestamp
+      ARGV[4]  max check time
+    Events:
+      'stalled' with stalled job id.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to move job to wait to be picked up by a waiting worker.
+]]
+-- Includes
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey,
+  jobId, pushCmd)
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+  addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId", jobId, 'prev', 'active')
+end
+--[[
+  Function to trim events, default 10000.
+]]
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
+local stalledKey = KEYS[1]
+local waitKey = KEYS[2]
+local activeKey = KEYS[3]
+local stalledCheckKey = KEYS[4]
+local metaKey = KEYS[5]
+local pausedKey = KEYS[6]
+local markerKey = KEYS[7]
+local eventStreamKey = KEYS[8]
+local maxStalledJobCount = tonumber(ARGV[1])
+local queueKeyPrefix = ARGV[2]
+local timestamp = ARGV[3]
+local maxCheckTime = ARGV[4]
+if rcall("EXISTS", stalledCheckKey) == 1 then
+    return {}
+end
+rcall("SET", stalledCheckKey, timestamp, "PX", maxCheckTime)
+-- Trim events before emitting them to avoid trimming events emitted in this script
+trimEvents(metaKey, eventStreamKey)
+-- Move all stalled jobs to wait
+local stalling = rcall('SMEMBERS', stalledKey)
+local stalled = {}
+if (#stalling > 0) then
+    rcall('DEL', stalledKey)
+    -- Remove from active list
+    for i, jobId in ipairs(stalling) do
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            -- If the jobId is a delay marker ID we just remove it.
+            rcall("LREM", activeKey, 1, jobId)
+        else
+            local jobKey = queueKeyPrefix .. jobId
+            -- Check that the lock is also missing, then we can handle this job as really stalled.
+            if (rcall("EXISTS", jobKey .. ":lock") == 0) then
+                --  Remove from the active queue.
+                local removed = rcall("LREM", activeKey, 1, jobId)
+                if (removed > 0) then
+                    -- If this job has been stalled too many times, such as if it crashes the worker, then fail it.
+                    local stalledCount = rcall("HINCRBY", jobKey, "stc", 1)
+                    -- Check if this is a repeatable job by looking at job options
+                    local jobOpts = rcall("HGET", jobKey, "opts")
+                    local isRepeatableJob = false
+                    if jobOpts then
+                        local opts = cjson.decode(jobOpts)
+                        if opts and opts["repeat"] then
+                            isRepeatableJob = true
+                        end
+                    end
+                    -- Only fail job if it exceeds stall limit AND is not a repeatable job
+                    if stalledCount > maxStalledJobCount and not isRepeatableJob then
+                        local failedReason = "job stalled more than allowable limit"
+                        rcall("HSET", jobKey, "defa", failedReason)
+                    end
+                    moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey, jobId,
+                        "RPUSH")
+                    -- Emit the stalled event
+                    rcall("XADD", eventStreamKey, "*", "event", "stalled", "jobId", jobId)
+                    table.insert(stalled, jobId)
+                end
+            end
+        end
+    end
+end
+-- Mark potentially stalled jobs
+local active = rcall('LRANGE', activeKey, 0, -1)
+if (#active > 0) then
+    for from, to in batches(#active, 7000) do
+        rcall('SADD', stalledKey, unpack(active, from, to))
+    end
+end
+return stalled
+`;
+exports.moveStalledJobsToWait = {
+    name: 'moveStalledJobsToWait',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveToActive-11.js b/node_modules/bullmq/dist/cjs/scripts/moveToActive-11.js
new file mode 100644
index 0000000..ba5950f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveToActive-11.js
@@ -0,0 +1,243 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveToActive = void 0;
+const content = `--[[
+  Move next job to be processed to active, lock it and fetch its data. The job
+  may be delayed, in that case we need to move it to the delayed set instead.
+  This operation guarantees that the worker owns the job during the lock
+  expiration time. The worker is responsible of keeping the lock fresh
+  so that no other worker picks this job again.
+  Input:
+    KEYS[1] wait key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] stream events key
+    KEYS[5] stalled key
+    -- Rate limiting
+    KEYS[6] rate limiter key
+    KEYS[7] delayed key
+    -- Delayed jobs
+    KEYS[8] paused key
+    KEYS[9] meta key
+    KEYS[10] pc priority counter
+    -- Marker
+    KEYS[11] marker key
+    -- Arguments
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] opts
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+    opts - name - worker name
+]]
+local rcall = redis.call
+local waitKey = KEYS[1]
+local activeKey = KEYS[2]
+local eventStreamKey = KEYS[4]
+local rateLimiterKey = KEYS[6]
+local delayedKey = KEYS[7]
+local opts = cmsgpack.unpack(ARGV[3])
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration = getTargetQueueList(KEYS[9],
+    activeKey, waitKey, KEYS[8])
+-- Check if there are delayed jobs that we can move to wait.
+local markerKey = KEYS[11]
+promoteDelayedJobs(delayedKey, markerKey, target, KEYS[3], eventStreamKey, ARGV[1],
+                   ARGV[2], KEYS[10], isPausedOrMaxed)
+local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+-- Check if we are rate limited first.
+if expireTime > 0 then return {0, 0, expireTime, 0} end
+-- paused or maxed queue
+if isPausedOrMaxed then return {0, 0, 0, 0} end
+local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+-- no job ID, try non-blocking move from wait to active
+local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+-- Markers in waitlist DEPRECATED in v5: Will be completely removed in v6.
+if jobId and string.sub(jobId, 1, 2) == "0:" then
+    rcall("LREM", activeKey, 1, jobId)
+    jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+end
+if jobId then
+    return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                   maxJobs, limiterDuration, markerKey, opts)
+else
+    jobId = moveJobFromPrioritizedToActive(KEYS[3], activeKey, KEYS[10])
+    if jobId then
+        return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                       maxJobs, limiterDuration, markerKey, opts)
+    end
+end
+-- Return the timestamp for the next delayed job if any.
+local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+if nextTimestamp ~= nil then return {0, 0, 0, nextTimestamp} end
+return {0, 0, 0, 0}
+`;
+exports.moveToActive = {
+    name: 'moveToActive',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveToDelayed-12.js b/node_modules/bullmq/dist/cjs/scripts/moveToDelayed-12.js
new file mode 100644
index 0000000..d5cb701
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveToDelayed-12.js
@@ -0,0 +1,398 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveToDelayed = void 0;
+const content = `--[[
+  Moves job from active to delayed set.
+  Input:
+    KEYS[1] marker key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] delayed key
+    KEYS[5] job key
+    KEYS[6] events stream
+    KEYS[7] meta key
+    KEYS[8] stalled key
+    KEYS[9] wait key
+    KEYS[10] rate limiter key
+    KEYS[11] paused key
+    KEYS[12] pc priority counter
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] queue token
+    ARGV[5] delay value
+    ARGV[6] skip attempt
+    ARGV[7] optional job fields to update
+    ARGV[8] fetch next?
+    ARGV[9] opts
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in active set.
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+-- Includes
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local jobKey = KEYS[5]
+local markerKey = KEYS[1]
+local metaKey = KEYS[7]
+local token = ARGV[4] 
+if rcall("EXISTS", jobKey) == 1 then
+    local errorCode = removeLock(jobKey, KEYS[8], token, ARGV[3])
+    if errorCode < 0 then
+        return errorCode
+    end
+    updateJobFields(jobKey, ARGV[7])
+    local delayedKey = KEYS[4]
+    local jobId = ARGV[3]
+    local delay = tonumber(ARGV[5])
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if numRemovedElements < 1 then return -3 end
+    local score, delayedTimestamp = getDelayedScore(delayedKey, ARGV[2], delay)
+    if ARGV[6] == "0" then
+        rcall("HINCRBY", jobKey, "atm", 1)
+    end
+    rcall("HSET", jobKey, "delay", ARGV[5])
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    rcall("ZADD", delayedKey, score, jobId)
+    rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+          "jobId", jobId, "delay", delayedTimestamp)
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[8] == "1") then
+        local opts = cmsgpack.unpack(ARGV[9])
+        local result = fetchNextJob(KEYS[9], KEYS[2], KEYS[3], KEYS[6],
+            KEYS[10], KEYS[4], KEYS[11], metaKey, KEYS[12], markerKey,
+            ARGV[1], ARGV[2], opts)
+        if result and type(result[1]) == "table" then
+            return result
+        end
+    end
+    -- Check if we need to push a marker job to wake up sleeping workers.
+    addDelayMarkerIfNeeded(markerKey, delayedKey)
+    return 0
+else
+    return -1
+end
+`;
+exports.moveToDelayed = {
+    name: 'moveToDelayed',
+    content,
+    keys: 12,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveToFinished-14.js b/node_modules/bullmq/dist/cjs/scripts/moveToFinished-14.js
new file mode 100644
index 0000000..eb0161d
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveToFinished-14.js
@@ -0,0 +1,1044 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveToFinished = void 0;
+const content = `--[[
+  Move job from active to a finished status (completed or failed)
+  A job can only be moved to completed if it was active.
+  The job must be locked before it can be moved to a finished status,
+  and the lock must be released in this script.
+    Input:
+      KEYS[1] wait key
+      KEYS[2] active key
+      KEYS[3] prioritized key
+      KEYS[4] event stream key
+      KEYS[5] stalled key
+      -- Rate limiting
+      KEYS[6] rate limiter key
+      KEYS[7] delayed key
+      KEYS[8] paused key
+      KEYS[9] meta key
+      KEYS[10] pc priority counter
+      KEYS[11] completed/failed key
+      KEYS[12] jobId key
+      KEYS[13] metrics key
+      KEYS[14] marker key
+      ARGV[1]  jobId
+      ARGV[2]  timestamp
+      ARGV[3]  msg property returnvalue / failedReason
+      ARGV[4]  return value / failed reason
+      ARGV[5]  target (completed/failed)
+      ARGV[6]  fetch next?
+      ARGV[7]  keys prefix
+      ARGV[8]  opts
+      ARGV[9]  job fields to update
+      opts - token - lock token
+      opts - keepJobs
+      opts - lockDuration - lock duration in milliseconds
+      opts - attempts max attempts
+      opts - maxMetricsSize
+      opts - fpof - fail parent on fail
+      opts - cpof - continue parent on fail
+      opts - idof - ignore dependency on fail
+      opts - rdof - remove dependency on fail
+      opts - name - worker name
+    Output:
+      0 OK
+      -1 Missing key.
+      -2 Missing lock.
+      -3 Job not in active set
+      -4 Job has pending children
+      -6 Lock is not owned by this client
+      -9 Job has failed children
+    Events:
+      'completed/failed'
+]]
+local rcall = redis.call
+--- Includes
+--[[
+  Functions to collect metrics based on a current and previous count of jobs.
+  Granularity is fixed at 1 minute.
+]]
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+local function collectMetrics(metaKey, dataPointsList, maxDataPoints,
+                                 timestamp)
+    -- Increment current count
+    local count = rcall("HINCRBY", metaKey, "count", 1) - 1
+    -- Compute how many data points we need to add to the list, N.
+    local prevTS = rcall("HGET", metaKey, "prevTS")
+    if not prevTS then
+        -- If prevTS is nil, set it to the current timestamp
+        rcall("HSET", metaKey, "prevTS", timestamp, "prevCount", 0)
+        return
+    end
+    local N = math.min(math.floor(timestamp / 60000) - math.floor(prevTS / 60000), tonumber(maxDataPoints))
+    if N > 0 then
+        local delta = count - rcall("HGET", metaKey, "prevCount")
+        -- If N > 1, add N-1 zeros to the list
+        if N > 1 then
+            local points = {}
+            points[1] = delta
+            for i = 2, N do
+                points[i] = 0
+            end
+            for from, to in batches(#points, 7000) do
+                rcall("LPUSH", dataPointsList, unpack(points, from, to))
+            end
+        else
+            -- LPUSH delta to the list
+            rcall("LPUSH", dataPointsList, delta)
+        end
+        -- LTRIM to keep list to its max size
+        rcall("LTRIM", dataPointsList, 0, maxDataPoints - 1)
+        -- update prev count with current count
+        rcall("HSET", metaKey, "prevCount", count, "prevTS", timestamp)
+    end
+end
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
+--[[
+  Function to recursively move from waitingChildren to failed.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local handleChildFailureAndMoveParentToWait = function (parentQueueKey, parentKey, parentId, jobIdKey, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    local parentDelayedKey = parentQueueKey .. ":delayed"
+    local parentWaitingChildrenOrDelayedKey
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentWaitingChildrenKey
+    elseif rcall("ZSCORE", parentDelayedKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentDelayedKey
+      rcall("HSET", parentKey, "delay", 0)
+    end
+    if parentWaitingChildrenOrDelayedKey then
+      rcall("ZREM", parentWaitingChildrenOrDelayedKey, parentId)
+      local deferredFailure = "child " .. jobIdKey .. " failed"
+      rcall("HSET", parentKey, "defa", deferredFailure)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    else
+      if not rcall("ZSCORE", parentQueueKey .. ":failed", parentId) then
+        local deferredFailure = "child " .. jobIdKey .. " failed"
+        rcall("HSET", parentKey, "defa", deferredFailure)
+      end
+    end
+  end
+end
+local moveChildFromDependenciesIfNeeded = function (rawParentData, childKey, failedReason, timestamp)
+  if rawParentData then
+    local parentData = cjson.decode(rawParentData)
+    local parentKey = parentData['queueKey'] .. ':' .. parentData['id']
+    local parentDependenciesChildrenKey = parentKey .. ":dependencies"
+    if parentData['fpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentUnsuccessfulChildrenKey = parentKey .. ":unsuccessful"
+        rcall("ZADD", parentUnsuccessfulChildrenKey, timestamp, childKey)
+        handleChildFailureAndMoveParentToWait(
+          parentData['queueKey'],
+          parentKey,
+          parentData['id'],
+          childKey,
+          timestamp
+        )
+      end
+    elseif parentData['cpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentFailedChildrenKey = parentKey .. ":failed"
+        rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        moveParentToWaitIfNeeded(parentData['queueKey'], parentKey, parentData['id'], timestamp)
+      end
+    elseif parentData['idof'] or parentData['rdof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        moveParentToWaitIfNoPendingDependencies(parentData['queueKey'], parentDependenciesChildrenKey,
+          parentKey, parentData['id'], timestamp)
+        if parentData['idof'] then
+          local parentFailedChildrenKey = parentKey .. ":failed"
+          rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        end
+      end
+    end
+  end
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is moved to completed or failed states.
+]]
+local function removeDeduplicationKeyIfNeededOnFinalization(prefixKey,
+  deduplicationId, jobId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local pttl = rcall("PTTL", deduplicationKey)
+    if pttl == 0 then
+      return rcall("DEL", deduplicationKey)
+    end
+    if pttl == -1 then
+      local currentJobId = rcall('GET', deduplicationKey)
+      if currentJobId and currentJobId == jobId then
+        return rcall("DEL", deduplicationKey)
+      end
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Functions to remove jobs by max age.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+  local start = timestamp - maxAge * 1000
+  local jobIds = rcall("ZREVRANGEBYSCORE", targetSet, start, "-inf", "LIMIT", 0, maxLimit)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  if #jobIds > 0 then
+    if #jobIds < maxLimit then
+      rcall("ZREMRANGEBYSCORE", targetSet, "-inf", start)
+    else
+      for from, to in batches(#jobIds, 7000) do
+        rcall("ZREM", targetSet, unpack(jobIds, from, to))
+      end
+    end
+  end
+end
+--[[
+  Functions to remove jobs by max count.
+]]
+-- Includes
+local function removeJobsByMaxCount(maxCount, targetSet, prefix)
+  local start = maxCount
+  local jobIds = rcall("ZREVRANGE", targetSet, start, -1)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  rcall("ZREMRANGEBYRANK", targetSet, 0, -(maxCount + 1))
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to create a new job from stored dedup-next data
+  when a deduplicated job with keepLastIfActive finishes.
+  At most one next job is created per deduplication ID.
+  Multiple triggers while active overwrite the dedup-next data,
+  so only the latest data is used.
+]]
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function requeueDeduplicatedJob(prefix, deduplicationId, eventStreamKey,
+    metaKey, activeKey, waitKey, pausedKey, markerKey, prioritizedKey,
+    priorityCounterKey, delayedKey, timestamp)
+  local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+  if rcall("EXISTS", deduplicationNextKey) == 1 then
+    local nextData = rcall("HMGET", deduplicationNextKey,
+        "name", "data", "opts", "pk", "pd", "pdk", "rjk", "jid")
+    -- Always increment the counter to keep it monotonic
+    local nextId = rcall("INCR", prefix .. "id") .. ""
+    local storedJobId = nextData[8] -- index 8 = "jid" (8th field in the HMGET call above)
+    local newJobId
+    if storedJobId then
+      newJobId = storedJobId
+    else
+      newJobId = nextId
+    end
+    local newJobIdKey = prefix .. newJobId
+    local newOpts = cjson.decode(nextData[3])
+    local deduplicationKey = prefix .. "de:" .. deduplicationId
+    local parentKey = nextData[4] or nil
+    local parentData = nextData[5] or nil
+    local parentDependenciesKey = nextData[6] or nil
+    local repeatJobKey = nextData[7] or nil
+    -- Set dedup key for the new job (without TTL when keepLastIfActive,
+    -- so the key outlives the job's active duration)
+    local deOpts = newOpts['de']
+    if deOpts and deOpts['keepLastIfActive'] then
+      rcall('SET', deduplicationKey, newJobId)
+    else
+      setDeduplicationKey(deduplicationKey, newJobId, deOpts)
+    end
+    -- Store and enqueue using the shared helper (handles priority/lifo/delayed)
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    storeAndEnqueueJob(eventStreamKey, newJobIdKey, newJobId, nextData[1], nextData[2],
+        newOpts, timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+        waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+        priorityCounterKey, delayedKey, markerKey)
+    -- Register as child dependency if the job has a parent
+    if parentDependenciesKey then
+      rcall("SADD", parentDependenciesKey, newJobIdKey)
+    end
+    -- Only delete the dedup-next hash after the job is fully created,
+    -- so that if any step above errors, the data is not permanently lost.
+    rcall("DEL", deduplicationNextKey)
+  end
+end
+--[[
+  Function to trim events, default 10000.
+]]
+-- Includes
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local jobIdKey = KEYS[12]
+if rcall("EXISTS", jobIdKey) == 1 then -- Make sure job exists
+    -- Make sure it does not have pending dependencies
+    -- It must happen before removing lock
+    if ARGV[5] == "completed" then
+        if rcall("SCARD", jobIdKey .. ":dependencies") ~= 0 then
+            return -4
+        end
+        if rcall("ZCARD", jobIdKey .. ":unsuccessful") ~= 0 then
+            return -9
+        end
+    end
+    local opts = cmsgpack.unpack(ARGV[8])
+    local token = opts['token']
+    local errorCode = removeLock(jobIdKey, KEYS[5], token, ARGV[1])
+    if errorCode < 0 then
+        return errorCode
+    end
+    updateJobFields(jobIdKey, ARGV[9]);
+    local attempts = opts['attempts']
+    local maxMetricsSize = opts['maxMetricsSize']
+    local maxCount = opts['keepJobs']['count']
+    local maxAge = opts['keepJobs']['age']
+    local maxLimit = opts['keepJobs']['limit'] or 1000
+    local jobAttributes = rcall("HMGET", jobIdKey, "parentKey", "parent", "deid")
+    local parentKey = jobAttributes[1] or ""
+    local parentId = ""
+    local parentQueueKey = ""
+    if jobAttributes[2] then -- TODO: need to revisit this logic if it's still needed
+        local jsonDecodedParent = cjson.decode(jobAttributes[2])
+        parentId = jsonDecodedParent['id']
+        parentQueueKey = jsonDecodedParent['queueKey']
+    end
+    local jobId = ARGV[1]
+    local timestamp = ARGV[2]
+    -- Remove from active list (if not active we shall return error)
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if (numRemovedElements < 1) then
+        return -3
+    end
+    local eventStreamKey = KEYS[4]
+    local metaKey = KEYS[9]
+    -- Trim events before emitting them to avoid trimming events emitted in this script
+    trimEvents(metaKey, eventStreamKey)
+    local prefix = ARGV[7]
+    removeDeduplicationKeyIfNeededOnFinalization(prefix, jobAttributes[3], jobId)
+    -- Check if there is requeue data for this dedup ID (keepLastIfActive mode)
+    if jobAttributes[3] then
+      requeueDeduplicatedJob(prefix, jobAttributes[3], eventStreamKey,
+          metaKey, KEYS[2], KEYS[1], KEYS[8], KEYS[14], KEYS[3], KEYS[10],
+          KEYS[7], timestamp)
+    end
+    -- If job has a parent we need to
+    -- 1) remove this job id from parents dependencies
+    -- 2) move the job Id to parent "processed" set
+    -- 3) push the results into parent "results" list
+    -- 4) if parent's dependencies is empty, then move parent to "wait/paused". Note it may be a different queue!.
+    if parentId == "" and parentKey ~= "" then
+        parentId = getJobIdFromKey(parentKey)
+        parentQueueKey = getJobKeyPrefix(parentKey, ":" .. parentId)
+    end
+    if parentId ~= "" then
+        if ARGV[5] == "completed" then
+            local dependenciesSet = parentKey .. ":dependencies"
+            if rcall("SREM", dependenciesSet, jobIdKey) == 1 then
+                updateParentDepsIfNeeded(parentKey, parentQueueKey, dependenciesSet, parentId, jobIdKey, ARGV[4],
+                    timestamp)
+            end
+        else
+            moveChildFromDependenciesIfNeeded(jobAttributes[2], jobIdKey, ARGV[4], timestamp)
+        end
+    end
+    local attemptsMade = rcall("HINCRBY", jobIdKey, "atm", 1)
+    -- Remove job?
+    if maxCount ~= 0 then
+        local targetSet = KEYS[11]
+        -- Add to complete/failed set
+        rcall("ZADD", targetSet, timestamp, jobId)
+        rcall("HSET", jobIdKey, ARGV[3], ARGV[4], "finishedOn", timestamp)
+        -- "returnvalue" / "failedReason" and "finishedOn"
+        if ARGV[5] == "failed" then
+            rcall("HDEL", jobIdKey, "defa")
+        end
+        -- Remove old jobs?
+        if maxAge ~= nil then
+            removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+        end
+        if maxCount ~= nil and maxCount > 0 then
+            removeJobsByMaxCount(maxCount, targetSet, prefix)
+        end
+    else
+        removeJobKeys(jobIdKey)
+        if parentKey ~= "" then
+            -- TODO: when a child is removed when finished, result or failure in parent
+            -- must not be deleted, those value references should be deleted when the parent
+            -- is deleted
+            removeParentDependencyKey(jobIdKey, false, parentKey, jobAttributes[3])
+        end
+    end
+    rcall("XADD", eventStreamKey, "*", "event", ARGV[5], "jobId", jobId, ARGV[3], ARGV[4], "prev", "active")
+    if ARGV[5] == "failed" then
+        if tonumber(attemptsMade) >= tonumber(attempts) then
+            rcall("XADD", eventStreamKey, "*", "event", "retries-exhausted", "jobId", jobId, "attemptsMade",
+                attemptsMade)
+        end
+    end
+    -- Collect metrics
+    if maxMetricsSize ~= "" then
+        collectMetrics(KEYS[13], KEYS[13] .. ':data', maxMetricsSize, timestamp)
+    end
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[6] == "1") then
+        local result = fetchNextJob(KEYS[1], KEYS[2], KEYS[3], eventStreamKey,
+            KEYS[6], KEYS[7], KEYS[8], metaKey, KEYS[10], KEYS[14], prefix,
+            timestamp, opts)
+        if result then
+            return result
+        end
+    end
+    local waitLen = rcall("LLEN", KEYS[1])
+    if waitLen == 0 then
+        local activeLen = rcall("LLEN", KEYS[2])
+        if activeLen == 0 then
+            local prioritizedLen = rcall("ZCARD", KEYS[3])
+            if prioritizedLen == 0 then
+                rcall("XADD", eventStreamKey, "*", "event", "drained")
+            end
+        end
+    end
+    return 0
+else
+    return -1
+end
+`;
+exports.moveToFinished = {
+    name: 'moveToFinished',
+    content,
+    keys: 14,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/moveToWaitingChildren-7.js b/node_modules/bullmq/dist/cjs/scripts/moveToWaitingChildren-7.js
new file mode 100644
index 0000000..c7d9d3f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/moveToWaitingChildren-7.js
@@ -0,0 +1,106 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.moveToWaitingChildren = void 0;
+const content = `--[[
+  Moves job from active to waiting children set.
+  Input:
+    KEYS[1] active key
+    KEYS[2] wait-children key
+    KEYS[3] job key
+    KEYS[4] job dependencies key
+    KEYS[5] job unsuccessful key
+    KEYS[6] stalled key
+    KEYS[7] events key
+    ARGV[1] token
+    ARGV[2] child key
+    ARGV[3] timestamp
+    ARGV[4] jobId
+    ARGV[5] prefix
+  Output:
+    0 - OK
+    1 - There are not pending dependencies.
+   -1 - Missing job.
+   -2 - Missing lock
+   -3 - Job not in active set
+   -9 - Job has failed children
+]]
+local rcall = redis.call
+local activeKey = KEYS[1]
+local waitingChildrenKey = KEYS[2]
+local jobKey = KEYS[3]
+local jobDependenciesKey = KEYS[4]
+local jobUnsuccessfulKey = KEYS[5]
+local stalledKey = KEYS[6]
+local eventStreamKey = KEYS[7]
+local token = ARGV[1]
+local timestamp = ARGV[3]
+local jobId = ARGV[4]
+--- Includes
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+local function removeJobFromActive(activeKey, stalledKey, jobKey, jobId,
+    token)
+  local errorCode = removeLock(jobKey, stalledKey, token, jobId)
+  if errorCode < 0 then
+    return errorCode
+  end
+  local numRemovedElements = rcall("LREM", activeKey, -1, jobId)
+  if numRemovedElements < 1 then
+    return -3
+  end
+  return 0
+end
+local function moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+    jobKey, jobId, timestamp, token)
+  local errorCode = removeJobFromActive(activeKey, stalledKey, jobKey, jobId, token)
+  if errorCode < 0 then
+    return errorCode
+  end
+  local score = tonumber(timestamp)
+  rcall("ZADD", waitingChildrenKey, score, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting-children", "jobId", jobId, 'prev', 'active')
+  return 0
+end
+if rcall("EXISTS", jobKey) == 1 then
+  if rcall("ZCARD", jobUnsuccessfulKey) ~= 0 then
+    return -9
+  else
+    if ARGV[2] ~= "" then
+      if rcall("SISMEMBER", jobDependenciesKey, ARGV[2]) ~= 0 then
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+      return 1
+    else
+      if rcall("SCARD", jobDependenciesKey) ~= 0 then 
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+      return 1
+    end    
+  end
+end
+return -1
+`;
+exports.moveToWaitingChildren = {
+    name: 'moveToWaitingChildren',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/obliterate-2.js b/node_modules/bullmq/dist/cjs/scripts/obliterate-2.js
new file mode 100644
index 0000000..691c7c7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/obliterate-2.js
@@ -0,0 +1,343 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.obliterate = void 0;
+const content = `--[[
+  Completely obliterates a queue and all of its contents
+  This command completely destroys a queue including all of its jobs, current or past 
+  leaving no trace of its existence. Since this script needs to iterate to find all the job
+  keys, consider that this call may be slow for very large queues.
+  The queue needs to be "paused" or it will return an error
+  If the queue has currently active jobs then the script by default will return error,
+  however this behaviour can be overridden using the 'force' option.
+  Input:
+    KEYS[1] meta
+    KEYS[2] base
+    ARGV[1] count
+    ARGV[2] force
+]]
+local maxCount = tonumber(ARGV[1])
+local baseKey = KEYS[2]
+local rcall = redis.call
+-- Includes
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get ZSet items.
+]]
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
+local function removeLockKeys(keys)
+  for i, key in ipairs(keys) do
+    rcall("DEL", baseKey .. key .. ':lock')
+  end
+end
+-- 1) Check if paused, if not return with error.
+if rcall("HEXISTS", KEYS[1], "paused") ~= 1 then
+  return -1 -- Error, NotPaused
+end
+-- 2) Check if there are active jobs, if there are and not "force" return error.
+local activeKey = baseKey .. 'active'
+local activeJobs = getListItems(activeKey, maxCount)
+if (#activeJobs > 0) then
+  if(ARGV[2] == "") then 
+    return -2 -- Error, ExistActiveJobs
+  end
+end
+removeLockKeys(activeJobs)
+maxCount = removeJobs(activeJobs, true, baseKey, maxCount)
+rcall("LTRIM", activeKey, #activeJobs, -1)
+if(maxCount <= 0) then
+  return 1
+end
+local delayedKey = baseKey .. 'delayed'
+maxCount = removeZSetJobs(delayedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local repeatKey = baseKey .. 'repeat'
+local repeatJobsIds = getZSetItems(repeatKey, maxCount)
+for i, key in ipairs(repeatJobsIds) do
+  local jobKey = repeatKey .. ":" .. key
+  rcall("DEL", jobKey)
+end
+if(#repeatJobsIds > 0) then
+  for from, to in batches(#repeatJobsIds, 7000) do
+    rcall("ZREM", repeatKey, unpack(repeatJobsIds, from, to))
+  end
+end
+maxCount = maxCount - #repeatJobsIds
+if(maxCount <= 0) then
+  return 1
+end
+local completedKey = baseKey .. 'completed'
+maxCount = removeZSetJobs(completedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local pausedKey = baseKey .. 'paused'
+maxCount = removeListJobs(pausedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local prioritizedKey = baseKey .. 'prioritized'
+maxCount = removeZSetJobs(prioritizedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local failedKey = baseKey .. 'failed'
+maxCount = removeZSetJobs(failedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+if(maxCount > 0) then
+  rcall("DEL",
+    baseKey .. 'events',
+    baseKey .. 'delay',
+    baseKey .. 'stalled-check',
+    baseKey .. 'stalled',
+    baseKey .. 'id',
+    baseKey .. 'pc',
+    baseKey .. 'marker',
+    baseKey .. 'meta',
+    baseKey .. 'metrics:completed',
+    baseKey .. 'metrics:completed:data',
+    baseKey .. 'metrics:failed',
+    baseKey .. 'metrics:failed:data')
+  return 0
+else
+  return 1
+end
+`;
+exports.obliterate = {
+    name: 'obliterate',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/paginate-1.js b/node_modules/bullmq/dist/cjs/scripts/paginate-1.js
new file mode 100644
index 0000000..5fdb114
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/paginate-1.js
@@ -0,0 +1,109 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.paginate = void 0;
+const content = `--[[
+    Paginate a set or hash
+    Input:
+      KEYS[1] key pointing to the set or hash to be paginated.
+      ARGV[1]  page start offset
+      ARGV[2]  page end offset (-1 for all the elements)
+      ARGV[3]  cursor
+      ARGV[4]  offset
+      ARGV[5]  max iterations
+      ARGV[6]  fetch jobs?
+    Output:
+      [cursor, offset, items, numItems]
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to achieve pagination for a set or hash.
+  This function simulates pagination in the most efficient way possible
+  for a set using sscan or hscan.
+  The main limitation is that sets are not order preserving, so the
+  pagination is not stable. This means that if the set is modified
+  between pages, the same element may appear in different pages.
+]] -- Maximum number of elements to be returned by sscan per iteration.
+local maxCount = 100
+-- Finds the cursor, and returns the first elements available for the requested page.
+local function findPage(key, command, pageStart, pageSize, cursor, offset,
+                        maxIterations, fetchJobs)
+    local items = {}
+    local jobs = {}
+    local iterations = 0
+    repeat
+        -- Iterate over the set using sscan/hscan.
+        local result = rcall(command, key, cursor, "COUNT", maxCount)
+        cursor = result[1]
+        local members = result[2]
+        local step = 1
+        if command == "HSCAN" then
+            step = 2
+        end
+        if #members == 0 then
+            -- If the result is empty, we can return the result.
+            return cursor, offset, items, jobs
+        end
+        local chunkStart = offset
+        local chunkEnd = offset + #members / step
+        local pageEnd = pageStart + pageSize
+        if chunkEnd < pageStart then
+            -- If the chunk is before the page, we can skip it.
+            offset = chunkEnd
+        elseif chunkStart > pageEnd then
+            -- If the chunk is after the page, we can return the result.
+            return cursor, offset, items, jobs
+        else
+            -- If the chunk is overlapping the page, we need to add the elements to the result.
+            for i = 1, #members, step do
+                if offset >= pageEnd then
+                    return cursor, offset, items, jobs
+                end
+                if offset >= pageStart then
+                    local index = #items + 1
+                    if fetchJobs ~= nil then
+                        jobs[#jobs+1] = rcall("HGETALL", members[i])
+                    end
+                    if step == 2 then
+                        items[index] = {members[i], members[i + 1]}
+                    else
+                        items[index] = members[i]
+                    end
+                end
+                offset = offset + 1
+            end
+        end
+        iterations = iterations + 1
+    until cursor == "0" or iterations >= maxIterations
+    return cursor, offset, items, jobs
+end
+local key = KEYS[1]
+local scanCommand = "SSCAN"
+local countCommand = "SCARD"
+local type = rcall("TYPE", key)["ok"]
+if type == "none" then
+    return {0, 0, {}, 0}
+elseif type == "hash" then
+    scanCommand = "HSCAN"
+    countCommand = "HLEN"
+elseif type ~= "set" then
+    return
+        redis.error_reply("Pagination is only supported for sets and hashes.")
+end
+local numItems = rcall(countCommand, key)
+local startOffset = tonumber(ARGV[1])
+local endOffset = tonumber(ARGV[2])
+if endOffset == -1 then 
+  endOffset = numItems
+end
+local pageSize = (endOffset - startOffset) + 1
+local cursor, offset, items, jobs = findPage(key, scanCommand, startOffset,
+                                       pageSize, ARGV[3], tonumber(ARGV[4]),
+                                       tonumber(ARGV[5]), ARGV[6])
+return {cursor, offset, items, numItems, jobs}
+`;
+exports.paginate = {
+    name: 'paginate',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/pause-7.js b/node_modules/bullmq/dist/cjs/scripts/pause-7.js
new file mode 100644
index 0000000..842d688
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/pause-7.js
@@ -0,0 +1,66 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.pause = void 0;
+const content = `--[[
+  Pauses or resumes a queue globally.
+  Input:
+    KEYS[1] 'wait' or 'paused'
+    KEYS[2] 'paused' or 'wait'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] events stream key
+    KEYS[6] 'delayed'
+    KEYS[7] 'marker'
+    ARGV[1] 'paused' or 'resumed'
+  Event:
+    publish paused or resumed event.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+local markerKey = KEYS[7]
+local hasJobs = rcall("EXISTS", KEYS[1]) == 1
+--TODO: check this logic to be reused when changing a delay
+if hasJobs then rcall("RENAME", KEYS[1], KEYS[2]) end
+if ARGV[1] == "paused" then
+    rcall("HSET", KEYS[3], "paused", 1)
+    rcall("DEL", markerKey)
+else
+    rcall("HDEL", KEYS[3], "paused")
+    if hasJobs or rcall("ZCARD", KEYS[4]) > 0 then
+        -- Add marker if there are waiting or priority jobs
+        rcall("ZADD", markerKey, 0, "0")
+    else
+        addDelayMarkerIfNeeded(markerKey, KEYS[6])
+    end
+end
+rcall("XADD", KEYS[5], "*", "event", ARGV[1]);
+`;
+exports.pause = {
+    name: 'pause',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/promote-9.js b/node_modules/bullmq/dist/cjs/scripts/promote-9.js
new file mode 100644
index 0000000..30ecbb6
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/promote-9.js
@@ -0,0 +1,109 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.promote = void 0;
+const content = `--[[
+  Promotes a job that is currently "delayed" to the "waiting" state
+    Input:
+      KEYS[1] 'delayed'
+      KEYS[2] 'wait'
+      KEYS[3] 'paused'
+      KEYS[4] 'meta'
+      KEYS[5] 'prioritized'
+      KEYS[6] 'active'
+      KEYS[7] 'pc' priority counter
+      KEYS[8] 'event stream'
+      KEYS[9] 'marker'
+      ARGV[1]  queue.toKey('')
+      ARGV[2]  jobId
+    Output:
+       0 - OK
+      -3 - Job not in delayed zset.
+    Events:
+      'waiting'
+]]
+local rcall = redis.call
+local jobId = ARGV[2]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+if rcall("ZREM", KEYS[1], jobId) == 1 then
+    local jobKey = ARGV[1] .. jobId
+    local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+    local metaKey = KEYS[4]
+    local markerKey = KEYS[9]
+    -- Remove delayed "marker" from the wait list if there is any.
+    -- Since we are adding a job we do not need the marker anymore.
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[6], KEYS[2], KEYS[3])
+    local marker = rcall("LINDEX", target, 0)
+    if marker and string.sub(marker, 1, 2) == "0:" then rcall("LPOP", target) end
+    if priority == 0 then
+        -- LIFO or FIFO
+        addJobInTargetList(target, markerKey, "LPUSH", isPausedOrMaxed, jobId)
+    else
+        addJobWithPriority(markerKey, KEYS[5], priority, jobId, KEYS[7], isPausedOrMaxed)
+    end
+    rcall("XADD", KEYS[8], "*", "event", "waiting", "jobId", jobId, "prev",
+          "delayed");
+    rcall("HSET", jobKey, "delay", 0)
+    return 0
+else
+    return -3
+end
+`;
+exports.promote = {
+    name: 'promote',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/releaseLock-1.js b/node_modules/bullmq/dist/cjs/scripts/releaseLock-1.js
new file mode 100644
index 0000000..1ba1145
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/releaseLock-1.js
@@ -0,0 +1,24 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.releaseLock = void 0;
+const content = `--[[
+  Release lock
+    Input:
+      KEYS[1] 'lock',
+      ARGV[1]  token
+      ARGV[2]  lock duration in milliseconds
+    Output:
+      "OK" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  return rcall("DEL", KEYS[1])
+else
+  return 0
+end
+`;
+exports.releaseLock = {
+    name: 'releaseLock',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeChildDependency-1.js b/node_modules/bullmq/dist/cjs/scripts/removeChildDependency-1.js
new file mode 100644
index 0000000..0643df7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeChildDependency-1.js
@@ -0,0 +1,164 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeChildDependency = void 0;
+const content = `--[[
+  Break parent-child dependency by removing
+  child reference from parent
+  Input:
+    KEYS[1] 'key' prefix,
+    ARGV[1] job key
+    ARGV[2] parent key
+    Output:
+       0  - OK
+       1  - There is not relationship.
+      -1  - Missing job key
+      -5  - Missing parent key
+]]
+local rcall = redis.call
+local jobKey = ARGV[1]
+local parentKey = ARGV[2]
+-- Includes
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+if rcall("EXISTS", jobKey) ~= 1 then return -1 end
+if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+if removeParentDependencyKey(jobKey, false, parentKey, KEYS[1], nil) then
+  rcall("HDEL", jobKey, "parentKey", "parent")
+  return 0
+else
+  return 1
+end`;
+exports.removeChildDependency = {
+    name: 'removeChildDependency',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeDeduplicationKey-1.js b/node_modules/bullmq/dist/cjs/scripts/removeDeduplicationKey-1.js
new file mode 100644
index 0000000..3645863
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeDeduplicationKey-1.js
@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeDeduplicationKey = void 0;
+const content = `--[[
+  Remove deduplication key if it matches the job id.
+  Input:
+    KEYS[1] deduplication key
+    ARGV[1] job id
+  Output:
+    0 - false
+    1 - true
+]]
+local rcall = redis.call
+local deduplicationKey = KEYS[1]
+local jobId = ARGV[1]
+local currentJobId = rcall('GET', deduplicationKey)
+if currentJobId and currentJobId == jobId then
+  return rcall("DEL", deduplicationKey)
+end
+return 0
+`;
+exports.removeDeduplicationKey = {
+    name: 'removeDeduplicationKey',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeJob-2.js b/node_modules/bullmq/dist/cjs/scripts/removeJob-2.js
new file mode 100644
index 0000000..14d80d8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeJob-2.js
@@ -0,0 +1,351 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeJob = void 0;
+const content = `--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] repeat key
+      ARGV[1] jobId
+      ARGV[2] remove children
+      ARGV[3] queue prefix
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+  returns:
+    boolean
+]]
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove from any state.
+  returns:
+    prev state
+]]
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+  return "unknown"
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local removeJobChildren
+local removeJobWithChildren
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
+local jobId = ARGV[1]
+local shouldRemoveChildren = ARGV[2]
+local prefix = ARGV[3]
+local jobKey = KEYS[1]
+local repeatKey = KEYS[2]
+if isJobSchedulerJob(jobId, jobKey, repeatKey) then
+    return -8
+end
+if not isLocked(prefix, jobId, shouldRemoveChildren) then
+    local options = {
+        removeChildren = shouldRemoveChildren == "1",
+        ignoreProcessed = false,
+        ignoreLocked = false
+    }
+    removeJobWithChildren(prefix, jobId, nil, options)
+    return 1
+end
+return 0
+`;
+exports.removeJob = {
+    name: 'removeJob',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeJobScheduler-3.js b/node_modules/bullmq/dist/cjs/scripts/removeJobScheduler-3.js
new file mode 100644
index 0000000..cef5b31
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeJobScheduler-3.js
@@ -0,0 +1,48 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeJobScheduler = void 0;
+const content = `--[[
+  Removes a job scheduler and its next scheduled job.
+  Input:
+    KEYS[1] job schedulers key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+    ARGV[1] job scheduler id
+    ARGV[2] prefix key
+  Output:
+    0 - OK
+    1 - Missing repeat job
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local jobSchedulerId = ARGV[1]
+local prefix = ARGV[2]
+local millis = rcall("ZSCORE", KEYS[1], jobSchedulerId)
+if millis then
+  -- Delete next programmed job.
+  local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], delayedJobId) == 1) then
+    removeJobKeys(prefix .. delayedJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", delayedJobId, "prev", "delayed")
+  end
+end
+if(rcall("ZREM", KEYS[1], jobSchedulerId) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. jobSchedulerId)
+  return 0
+end
+return 1
+`;
+exports.removeJobScheduler = {
+    name: 'removeJobScheduler',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeOrphanedJobs-1.js b/node_modules/bullmq/dist/cjs/scripts/removeOrphanedJobs-1.js
new file mode 100644
index 0000000..c15be1e
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeOrphanedJobs-1.js
@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeOrphanedJobs = void 0;
+const content = `--[[
+  Removes orphaned job keys that exist in Redis but are not referenced
+  in any queue state set. Checks each candidate atomically.
+  Input:
+    KEYS[1]  base prefix key including trailing colon (e.g. bull:queueName:)
+    ARGV[1]  number of state key suffixes
+    ARGV[2 .. 1+N]  state key suffixes (e.g. active, wait, completed, ...)
+    ARGV[2+N]  number of job sub-key suffixes
+    ARGV[3+N .. 2+N+M]  job sub-key suffixes (e.g. logs, dependencies, ...)
+    ARGV[3+N+M .. end]  candidate job IDs to check
+  Output:
+    number of removed jobs
+]]
+local rcall = redis.call
+local basePrefix = KEYS[1]
+-- Parse state key suffixes and cache their full key names + types.
+local stateKeyCount = tonumber(ARGV[1])
+local stateKeys = {}
+local stateKeyTypes = {}
+for i = 1, stateKeyCount do
+  local fullKey = basePrefix .. ARGV[1 + i]
+  stateKeys[i] = fullKey
+  stateKeyTypes[i] = rcall('TYPE', fullKey)['ok']
+end
+-- Parse job sub-key suffixes.
+local subKeyCountIdx = 2 + stateKeyCount
+local subKeyCount = tonumber(ARGV[subKeyCountIdx])
+local subKeySuffixes = {}
+for i = 1, subKeyCount do
+  subKeySuffixes[i] = ARGV[subKeyCountIdx + i]
+end
+-- Process candidate job IDs.
+local candidateStart = subKeyCountIdx + subKeyCount + 1
+local removedCount = 0
+for c = candidateStart, #ARGV do
+  local jobId = ARGV[c]
+  local found = false
+  for i = 1, stateKeyCount do
+    local kt = stateKeyTypes[i]
+    if kt == 'list' then
+      if rcall('LPOS', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'zset' then
+      if rcall('ZSCORE', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'set' then
+      if rcall('SISMEMBER', stateKeys[i], jobId) == 1 then
+        found = true
+        break
+      end
+    end
+  end
+  if not found then
+    local jobKey = basePrefix .. jobId
+    local keysToDelete = { jobKey }
+    for _, suffix in ipairs(subKeySuffixes) do
+      keysToDelete[#keysToDelete + 1] = jobKey .. ':' .. suffix
+    end
+    rcall('DEL', unpack(keysToDelete))
+    removedCount = removedCount + 1
+  end
+end
+return removedCount
+`;
+exports.removeOrphanedJobs = {
+    name: 'removeOrphanedJobs',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeRepeatable-3.js b/node_modules/bullmq/dist/cjs/scripts/removeRepeatable-3.js
new file mode 100644
index 0000000..d53eb3f
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeRepeatable-3.js
@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeRepeatable = void 0;
+const content = `--[[
+  Removes a repeatable job
+  Input:
+    KEYS[1] repeat jobs key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+    ARGV[1] old repeat job id
+    ARGV[2] options concat
+    ARGV[3] repeat job key
+    ARGV[4] prefix key
+  Output:
+    0 - OK
+    1 - Missing repeat job
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+local millis = rcall("ZSCORE", KEYS[1], ARGV[2])
+-- Includes
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+-- legacy removal TODO: remove in next breaking change
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = ARGV[1] .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed");
+  end
+end
+if(rcall("ZREM", KEYS[1], ARGV[2]) == 1) then
+  return 0
+end
+-- new removal
+millis = rcall("ZSCORE", KEYS[1], ARGV[3])
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = "repeat:" .. ARGV[3] .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed")
+  end
+end
+if(rcall("ZREM", KEYS[1], ARGV[3]) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. ARGV[3])
+  return 0
+end
+return 1
+`;
+exports.removeRepeatable = {
+    name: 'removeRepeatable',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/removeUnprocessedChildren-2.js b/node_modules/bullmq/dist/cjs/scripts/removeUnprocessedChildren-2.js
new file mode 100644
index 0000000..73599cd
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/removeUnprocessedChildren-2.js
@@ -0,0 +1,341 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.removeUnprocessedChildren = void 0;
+const content = `--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] meta key
+      ARGV[1] prefix
+      ARGV[2] jobId
+    Events:
+      'removed' for every children removed
+]]
+-- Includes
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove from any state.
+  returns:
+    prev state
+]]
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+  return "unknown"
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+  returns:
+    boolean
+]]
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
+local removeJobChildren
+local removeJobWithChildren
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
+local prefix = ARGV[1]
+local jobId = ARGV[2]
+local jobKey = KEYS[1]
+local metaKey = KEYS[2]
+local options = {
+  removeChildren = "1",
+  ignoreProcessed = true,
+  ignoreLocked = true
+}
+removeJobChildren(prefix, jobKey, options) 
+`;
+exports.removeUnprocessedChildren = {
+    name: 'removeUnprocessedChildren',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/reprocessJob-8.js b/node_modules/bullmq/dist/cjs/scripts/reprocessJob-8.js
new file mode 100644
index 0000000..49547eb
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/reprocessJob-8.js
@@ -0,0 +1,118 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reprocessJob = void 0;
+const content = `--[[
+  Attempts to reprocess a job
+  Input:
+    KEYS[1] job key
+    KEYS[2] events stream
+    KEYS[3] job state
+    KEYS[4] wait key
+    KEYS[5] meta
+    KEYS[6] paused key
+    KEYS[7] active key
+    KEYS[8] marker key
+    ARGV[1] job.id
+    ARGV[2] (job.opts.lifo ? 'R' : 'L') + 'PUSH'
+    ARGV[3] propVal - failedReason/returnvalue
+    ARGV[4] prev state - failed/completed
+    ARGV[5] reset attemptsMade - "1" or "0"
+    ARGV[6] reset attemptsStarted - "1" or "0"
+  Output:
+     1 means the operation was a success
+    -1 means the job does not exist
+    -3 means the job was not found in the expected set.
+]]
+local rcall = redis.call;
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local jobKey = KEYS[1]
+if rcall("EXISTS", jobKey) == 1 then
+  local jobId = ARGV[1]
+  if (rcall("ZREM", KEYS[3], jobId) == 1) then
+    local attributesToRemove = {}
+    if ARGV[5] == "1" then
+      table.insert(attributesToRemove, "atm")
+    end
+    if ARGV[6] == "1" then
+      table.insert(attributesToRemove, "ats")
+    end
+    rcall("HDEL", jobKey, "finishedOn", "processedOn", ARGV[3], unpack(attributesToRemove))
+    local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[7], KEYS[4], KEYS[6])
+    addJobInTargetList(target, KEYS[8], ARGV[2], isPausedOrMaxed, jobId)
+    local parentKey = rcall("HGET", jobKey, "parentKey")
+    if parentKey and rcall("EXISTS", parentKey) == 1 then
+      if ARGV[4] == "failed" then
+        if rcall("ZREM", parentKey .. ":unsuccessful", jobKey) == 1 or
+          rcall("ZREM", parentKey .. ":failed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      else
+        if rcall("HDEL", parentKey .. ":processed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      end
+    end
+    local maxEvents = getOrSetMaxEvents(KEYS[5])
+    -- Emit waiting event
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId, "prev", ARGV[4]);
+    return 1
+  else
+    return -3
+  end
+else
+  return -1
+end
+`;
+exports.reprocessJob = {
+    name: 'reprocessJob',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/retryJob-11.js b/node_modules/bullmq/dist/cjs/scripts/retryJob-11.js
new file mode 100644
index 0000000..0275861
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/retryJob-11.js
@@ -0,0 +1,213 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.retryJob = void 0;
+const content = `--[[
+  Retries a failed job by moving it back to the wait queue.
+    Input:
+      KEYS[1]  'active',
+      KEYS[2]  'wait'
+      KEYS[3]  'paused'
+      KEYS[4]  job key
+      KEYS[5]  'meta'
+      KEYS[6]  events stream
+      KEYS[7]  delayed key
+      KEYS[8]  prioritized key
+      KEYS[9]  'pc' priority counter
+      KEYS[10] 'marker'
+      KEYS[11] 'stalled'
+      ARGV[1]  key prefix
+      ARGV[2]  timestamp
+      ARGV[3]  pushCmd
+      ARGV[4]  jobId
+      ARGV[5]  token
+      ARGV[6]  optional job fields to update
+    Events:
+      'waiting'
+    Output:
+     0  - OK
+     -1 - Missing key
+     -2 - Missing lock
+     -3 - Job not in active set
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[1], KEYS[2], KEYS[3])
+local markerKey = KEYS[10]
+-- Check if there are delayed jobs that we can move to wait.
+-- test example: when there are delayed jobs between retries
+promoteDelayedJobs(KEYS[7], markerKey, target, KEYS[8], KEYS[6], ARGV[1], ARGV[2], KEYS[9], isPausedOrMaxed)
+local jobKey = KEYS[4]
+if rcall("EXISTS", jobKey) == 1 then
+  local errorCode = removeLock(jobKey, KEYS[11], ARGV[5], ARGV[4]) 
+  if errorCode < 0 then
+    return errorCode
+  end
+  updateJobFields(jobKey, ARGV[6])
+  local numRemovedElements = rcall("LREM", KEYS[1], -1, ARGV[4])
+  if (numRemovedElements < 1) then return -3 end
+  local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+  --need to re-evaluate after removing job from active
+  isPausedOrMaxed = isQueuePausedOrMaxed(KEYS[5], KEYS[1])
+  -- Standard or priority add
+  if priority == 0 then
+    addJobInTargetList(target, markerKey, ARGV[3], isPausedOrMaxed, ARGV[4])
+  else
+    addJobWithPriority(markerKey, KEYS[8], priority, ARGV[4], KEYS[9], isPausedOrMaxed)
+  end
+  rcall("HINCRBY", jobKey, "atm", 1)
+  local maxEvents = getOrSetMaxEvents(KEYS[5])
+  -- Emit waiting event
+  rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", ARGV[4], "prev", "active")
+  return 0
+else
+  return -1
+end
+`;
+exports.retryJob = {
+    name: 'retryJob',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/saveStacktrace-1.js b/node_modules/bullmq/dist/cjs/scripts/saveStacktrace-1.js
new file mode 100644
index 0000000..551ca66
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/saveStacktrace-1.js
@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.saveStacktrace = void 0;
+const content = `--[[
+  Save stacktrace and failedReason.
+  Input:
+    KEYS[1] job key
+    ARGV[1]  stacktrace
+    ARGV[2]  failedReason
+  Output:
+     0 - OK
+    -1 - Missing key
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[1]) == 1 then
+  rcall("HMSET", KEYS[1], "stacktrace", ARGV[1], "failedReason", ARGV[2])
+  return 0
+else
+  return -1
+end
+`;
+exports.saveStacktrace = {
+    name: 'saveStacktrace',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/updateData-1.js b/node_modules/bullmq/dist/cjs/scripts/updateData-1.js
new file mode 100644
index 0000000..9024bd7
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/updateData-1.js
@@ -0,0 +1,25 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.updateData = void 0;
+const content = `--[[
+  Update job data
+  Input:
+    KEYS[1] Job id key
+    ARGV[1] data
+  Output:
+    0 - OK
+   -1 - Missing job.
+]]
+local rcall = redis.call
+if rcall("EXISTS",KEYS[1]) == 1 then -- // Make sure job exists
+  rcall("HSET", KEYS[1], "data", ARGV[1])
+  return 0
+else
+  return -1
+end
+`;
+exports.updateData = {
+    name: 'updateData',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/updateJobScheduler-12.js b/node_modules/bullmq/dist/cjs/scripts/updateJobScheduler-12.js
new file mode 100644
index 0000000..cabdf11
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/updateJobScheduler-12.js
@@ -0,0 +1,343 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.updateJobScheduler = void 0;
+const content = `--[[
+  Updates a job scheduler and adds next delayed job
+  Input:
+    KEYS[1]  'repeat' key
+    KEYS[2]  'delayed'
+    KEYS[3]  'wait' key
+    KEYS[4]  'paused' key
+    KEYS[5]  'meta'
+    KEYS[6]  'prioritized' key
+    KEYS[7]  'marker',
+    KEYS[8]  'id'
+    KEYS[9]  events stream key
+    KEYS[10] 'pc' priority counter
+    KEYS[11] producer key
+    KEYS[12] 'active' key
+    ARGV[1] next milliseconds
+    ARGV[2] jobs scheduler id
+    ARGV[3] Json stringified delayed data
+    ARGV[4] msgpacked delayed opts
+    ARGV[5] timestamp
+    ARGV[6] prefix key
+    ARGV[7] producer id
+    Output:
+      next delayed job id  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local nextMillis = tonumber(ARGV[1])
+local jobSchedulerId = ARGV[2]
+local timestamp = tonumber(ARGV[5])
+local prefixKey = ARGV[6]
+local producerId = ARGV[7]
+local jobOpts = cmsgpack.unpack(ARGV[4])
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+-- Validate that scheduler exists.
+-- If it does not exist we should not iterate anymore.
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+    local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+    local schedulerAttributes = rcall("HMGET", schedulerKey, "name", "data", "every", "startDate", "offset")
+    local every = tonumber(schedulerAttributes[3])
+    local now = tonumber(timestamp)
+    -- If every is not found in scheduler attributes, try to get it from job options
+    if not every and jobOpts['repeat'] and jobOpts['repeat']['every'] then
+        every = tonumber(jobOpts['repeat']['every'])
+    end
+    if every then
+        local startDate = schedulerAttributes[4]
+        local jobOptsOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+        local offset = schedulerAttributes[5] or jobOptsOffset or 0
+        local newOffset
+        nextMillis, newOffset = getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+        if not offset then
+            rcall("HSET", schedulerKey, "offset", newOffset)
+            jobOpts['repeat']['offset'] = newOffset
+        end
+    end
+    local nextDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+    local nextDelayedJobKey = schedulerKey .. ":" .. nextMillis
+    local currentDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    if producerId == currentDelayedJobId then
+        local eventsKey = KEYS[9]
+        local maxEvents = getOrSetMaxEvents(metaKey)
+        if rcall("EXISTS", nextDelayedJobKey) ~= 1 then
+            rcall("ZADD", repeatKey, nextMillis, jobSchedulerId)
+            rcall("HINCRBY", schedulerKey, "ic", 1)
+            rcall("INCR", KEYS[8])
+            -- TODO: remove this workaround in next breaking change,
+            -- all job-schedulers must save job data
+            local templateData = schedulerAttributes[2] or ARGV[3]
+            if templateData and templateData ~= '{}' then
+                rcall("HSET", schedulerKey, "data", templateData)
+            end
+            local delay = nextMillis - now
+            -- Fast Clamp delay to minimum of 0
+            if delay < 0 then
+                delay = 0
+            end
+            jobOpts["delay"] = delay
+            addJobFromScheduler(nextDelayedJobKey, nextDelayedJobId, jobOpts, waitKey, pausedKey, KEYS[12], metaKey,
+                prioritizedKey, KEYS[10], delayedKey, KEYS[7], eventsKey, schedulerAttributes[1], maxEvents, ARGV[5],
+                templateData or '{}', jobSchedulerId, delay)
+            -- TODO: remove this workaround in next breaking change
+            if KEYS[11] ~= "" then
+                rcall("HSET", KEYS[11], "nrjid", nextDelayedJobId)
+            end
+            return nextDelayedJobId .. "" -- convert to string
+        else
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "duplicated", "jobId", nextDelayedJobId)
+        end
+    end
+end
+`;
+exports.updateJobScheduler = {
+    name: 'updateJobScheduler',
+    content,
+    keys: 12,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/updateProgress-3.js b/node_modules/bullmq/dist/cjs/scripts/updateProgress-3.js
new file mode 100644
index 0000000..0eb247c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/updateProgress-3.js
@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.updateProgress = void 0;
+const content = `--[[
+  Update job progress
+  Input:
+    KEYS[1] Job id key
+    KEYS[2] event stream key
+    KEYS[3] meta key
+    ARGV[1] id
+    ARGV[2] progress
+  Output:
+     0 - OK
+    -1 - Missing job.
+  Event:
+    progress(jobId, progress)
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+    local maxEvents = getOrSetMaxEvents(KEYS[3])
+    rcall("HSET", KEYS[1], "progress", ARGV[2])
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "progress",
+          "jobId", ARGV[1], "data", ARGV[2]);
+    return 0
+else
+    return -1
+end
+`;
+exports.updateProgress = {
+    name: 'updateProgress',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/cjs/scripts/updateRepeatableJobMillis-1.js b/node_modules/bullmq/dist/cjs/scripts/updateRepeatableJobMillis-1.js
new file mode 100644
index 0000000..2b5430c
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/scripts/updateRepeatableJobMillis-1.js
@@ -0,0 +1,32 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.updateRepeatableJobMillis = void 0;
+const content = `--[[
+  Adds a repeatable job
+    Input:
+      KEYS[1] 'repeat' key
+      ARGV[1] next milliseconds
+      ARGV[2] custom key
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local nextMillis = ARGV[1]
+local customKey = ARGV[2]
+local legacyCustomKey = ARGV[3]
+if rcall("ZSCORE", repeatKey, customKey) then
+    rcall("ZADD", repeatKey, nextMillis, customKey)
+    return customKey
+elseif rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+    rcall("ZADD", repeatKey, nextMillis, legacyCustomKey)
+    return legacyCustomKey
+end
+return ''
+`;
+exports.updateRepeatableJobMillis = {
+    name: 'updateRepeatableJobMillis',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/cjs/tsconfig-cjs.tsbuildinfo b/node_modules/bullmq/dist/cjs/tsconfig-cjs.tsbuildinfo
new file mode 100644
index 0000000..e3877c8
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/tsconfig-cjs.tsbuildinfo
@@ -0,0 +1 @@
+{"fileNames":["../../node_modules/typescript/lib/lib.es5.d.ts","../../node_modules/typescript/lib/lib.es2015.d.ts","../../node_modules/typescript/lib/lib.es2016.d.ts","../../node_modules/typescript/lib/lib.es2017.d.ts","../../node_modules/typescript/lib/lib.es2018.d.ts","../../node_modules/typescript/lib/lib.es2019.d.ts","../../node_modules/typescript/lib/lib.es2020.d.ts","../../node_modules/typescript/lib/lib.es2021.d.ts","../../node_modules/typescript/lib/lib.es2022.d.ts","../../node_modules/typescript/lib/lib.es2023.d.ts","../../node_modules/typescript/lib/lib.es2024.d.ts","../../node_modules/typescript/lib/lib.esnext.d.ts","../../node_modules/typescript/lib/lib.dom.d.ts","../../node_modules/typescript/lib/lib.es2015.core.d.ts","../../node_modules/typescript/lib/lib.es2015.collection.d.ts","../../node_modules/typescript/lib/lib.es2015.generator.d.ts","../../node_modules/typescript/lib/lib.es2015.iterable.d.ts","../../node_modules/typescript/lib/lib.es2015.promise.d.ts","../../node_modules/typescript/lib/lib.es2015.proxy.d.ts","../../node_modules/typescript/lib/lib.es2015.reflect.d.ts","../../node_modules/typescript/lib/lib.es2015.symbol.d.ts","../../node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts","../../node_modules/typescript/lib/lib.es2016.array.include.d.ts","../../node_modules/typescript/lib/lib.es2016.intl.d.ts","../../node_modules/typescript/lib/lib.es2017.arraybuffer.d.ts","../../node_modules/typescript/lib/lib.es2017.date.d.ts","../../node_modules/typescript/lib/lib.es2017.object.d.ts","../../node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2017.string.d.ts","../../node_modules/typescript/lib/lib.es2017.intl.d.ts","../../node_modules/typescript/lib/lib.es2017.typedarrays.d.ts","../../node_modules/typescript/lib/lib.es2018.asyncgenerator.d.ts","../../node_modules/typescript/lib/lib.es2018.asynciterable.d.ts","../../node_modules/typescript/lib/lib.es2018.intl.d.ts","../../node_modules/typescript/lib/lib.es2018.promise.d.ts","../../node_modules/typescript/lib/lib.es2018.regexp.d.ts","../../node_modules/typescript/lib/lib.es2019.array.d.ts","../../node_modules/typescript/lib/lib.es2019.object.d.ts","../../node_modules/typescript/lib/lib.es2019.string.d.ts","../../node_modules/typescript/lib/lib.es2019.symbol.d.ts","../../node_modules/typescript/lib/lib.es2019.intl.d.ts","../../node_modules/typescript/lib/lib.es2020.bigint.d.ts","../../node_modules/typescript/lib/lib.es2020.date.d.ts","../../node_modules/typescript/lib/lib.es2020.promise.d.ts","../../node_modules/typescript/lib/lib.es2020.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2020.string.d.ts","../../node_modules/typescript/lib/lib.es2020.symbol.wellknown.d.ts","../../node_modules/typescript/lib/lib.es2020.intl.d.ts","../../node_modules/typescript/lib/lib.es2020.number.d.ts","../../node_modules/typescript/lib/lib.es2021.promise.d.ts","../../node_modules/typescript/lib/lib.es2021.string.d.ts","../../node_modules/typescript/lib/lib.es2021.weakref.d.ts","../../node_modules/typescript/lib/lib.es2021.intl.d.ts","../../node_modules/typescript/lib/lib.es2022.array.d.ts","../../node_modules/typescript/lib/lib.es2022.error.d.ts","../../node_modules/typescript/lib/lib.es2022.intl.d.ts","../../node_modules/typescript/lib/lib.es2022.object.d.ts","../../node_modules/typescript/lib/lib.es2022.string.d.ts","../../node_modules/typescript/lib/lib.es2022.regexp.d.ts","../../node_modules/typescript/lib/lib.es2023.array.d.ts","../../node_modules/typescript/lib/lib.es2023.collection.d.ts","../../node_modules/typescript/lib/lib.es2023.intl.d.ts","../../node_modules/typescript/lib/lib.es2024.arraybuffer.d.ts","../../node_modules/typescript/lib/lib.es2024.collection.d.ts","../../node_modules/typescript/lib/lib.es2024.object.d.ts","../../node_modules/typescript/lib/lib.es2024.promise.d.ts","../../node_modules/typescript/lib/lib.es2024.regexp.d.ts","../../node_modules/typescript/lib/lib.es2024.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2024.string.d.ts","../../node_modules/typescript/lib/lib.esnext.array.d.ts","../../node_modules/typescript/lib/lib.esnext.collection.d.ts","../../node_modules/typescript/lib/lib.esnext.intl.d.ts","../../node_modules/typescript/lib/lib.esnext.disposable.d.ts","../../node_modules/typescript/lib/lib.esnext.promise.d.ts","../../node_modules/typescript/lib/lib.esnext.decorators.d.ts","../../node_modules/typescript/lib/lib.esnext.iterator.d.ts","../../node_modules/typescript/lib/lib.esnext.float16.d.ts","../../node_modules/typescript/lib/lib.esnext.error.d.ts","../../node_modules/typescript/lib/lib.esnext.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.decorators.d.ts","../../node_modules/typescript/lib/lib.decorators.legacy.d.ts","../../node_modules/tslib/tslib.d.ts","../../src/classes/async-fifo-queue.ts","../../src/interfaces/backoff-options.ts","../../src/types/keep-jobs.ts","../../src/interfaces/parent-options.ts","../../node_modules/cron-parser/types/common.d.ts","../../node_modules/cron-parser/types/index.d.ts","../../src/interfaces/repeat-options.ts","../../src/interfaces/base-job-options.ts","../../src/types/deduplication-options.ts","../../src/types/job-options.ts","../../src/types/job-progress.ts","../../src/interfaces/parent.ts","../../src/interfaces/job-json.ts","../../src/types/job-json-sandbox.ts","../../src/interfaces/minimal-job.ts","../../src/types/backoff-strategy.ts","../../src/classes/backoffs.ts","../../src/enums/child-command.ts","../../src/enums/error-code.ts","../../src/enums/parent-command.ts","../../src/enums/metrics-time.ts","../../src/enums/telemetry-attributes.ts","../../src/enums/index.ts","../../src/types/repeat-strategy.ts","../../src/interfaces/advanced-options.ts","../../src/interfaces/child-message.ts","../../src/interfaces/redis-client.ts","../../src/interfaces/connection.ts","../../src/types/database-type.ts","../../src/types/finished-status.ts","../../src/types/job-scheduler-template-options.ts","../../src/types/job-type.ts","../../src/types/index.ts","../../node_modules/@types/node/compatibility/iterators.d.ts","../../node_modules/@types/node/globals.typedarray.d.ts","../../node_modules/@types/node/buffer.buffer.d.ts","../../node_modules/@types/node/globals.d.ts","../../node_modules/@types/node/web-globals/abortcontroller.d.ts","../../node_modules/@types/node/web-globals/crypto.d.ts","../../node_modules/@types/node/web-globals/domexception.d.ts","../../node_modules/@types/node/web-globals/events.d.ts","../../node_modules/buffer/index.d.ts","../../node_modules/undici-types/utility.d.ts","../../node_modules/undici-types/header.d.ts","../../node_modules/undici-types/readable.d.ts","../../node_modules/undici-types/fetch.d.ts","../../node_modules/undici-types/formdata.d.ts","../../node_modules/undici-types/connector.d.ts","../../node_modules/undici-types/client-stats.d.ts","../../node_modules/undici-types/client.d.ts","../../node_modules/undici-types/errors.d.ts","../../node_modules/undici-types/dispatcher.d.ts","../../node_modules/undici-types/global-dispatcher.d.ts","../../node_modules/undici-types/global-origin.d.ts","../../node_modules/undici-types/pool-stats.d.ts","../../node_modules/undici-types/pool.d.ts","../../node_modules/undici-types/handlers.d.ts","../../node_modules/undici-types/balanced-pool.d.ts","../../node_modules/undici-types/h2c-client.d.ts","../../node_modules/undici-types/agent.d.ts","../../node_modules/undici-types/mock-interceptor.d.ts","../../node_modules/undici-types/mock-call-history.d.ts","../../node_modules/undici-types/mock-agent.d.ts","../../node_modules/undici-types/mock-client.d.ts","../../node_modules/undici-types/mock-pool.d.ts","../../node_modules/undici-types/snapshot-agent.d.ts","../../node_modules/undici-types/mock-errors.d.ts","../../node_modules/undici-types/proxy-agent.d.ts","../../node_modules/undici-types/env-http-proxy-agent.d.ts","../../node_modules/undici-types/retry-handler.d.ts","../../node_modules/undici-types/retry-agent.d.ts","../../node_modules/undici-types/api.d.ts","../../node_modules/undici-types/cache-interceptor.d.ts","../../node_modules/undici-types/interceptors.d.ts","../../node_modules/undici-types/util.d.ts","../../node_modules/undici-types/cookies.d.ts","../../node_modules/undici-types/patch.d.ts","../../node_modules/undici-types/websocket.d.ts","../../node_modules/undici-types/eventsource.d.ts","../../node_modules/undici-types/diagnostics-channel.d.ts","../../node_modules/undici-types/content-type.d.ts","../../node_modules/undici-types/cache.d.ts","../../node_modules/undici-types/index.d.ts","../../node_modules/@types/node/web-globals/fetch.d.ts","../../node_modules/@types/node/web-globals/navigator.d.ts","../../node_modules/@types/node/web-globals/storage.d.ts","../../node_modules/@types/node/web-globals/streams.d.ts","../../node_modules/@types/node/assert.d.ts","../../node_modules/@types/node/assert/strict.d.ts","../../node_modules/@types/node/async_hooks.d.ts","../../node_modules/@types/node/buffer.d.ts","../../node_modules/@types/node/child_process.d.ts","../../node_modules/@types/node/cluster.d.ts","../../node_modules/@types/node/console.d.ts","../../node_modules/@types/node/constants.d.ts","../../node_modules/@types/node/crypto.d.ts","../../node_modules/@types/node/dgram.d.ts","../../node_modules/@types/node/diagnostics_channel.d.ts","../../node_modules/@types/node/dns.d.ts","../../node_modules/@types/node/dns/promises.d.ts","../../node_modules/@types/node/domain.d.ts","../../node_modules/@types/node/events.d.ts","../../node_modules/@types/node/fs.d.ts","../../node_modules/@types/node/fs/promises.d.ts","../../node_modules/@types/node/http.d.ts","../../node_modules/@types/node/http2.d.ts","../../node_modules/@types/node/https.d.ts","../../node_modules/@types/node/inspector.d.ts","../../node_modules/@types/node/inspector.generated.d.ts","../../node_modules/@types/node/module.d.ts","../../node_modules/@types/node/net.d.ts","../../node_modules/@types/node/os.d.ts","../../node_modules/@types/node/path.d.ts","../../node_modules/@types/node/perf_hooks.d.ts","../../node_modules/@types/node/process.d.ts","../../node_modules/@types/node/punycode.d.ts","../../node_modules/@types/node/querystring.d.ts","../../node_modules/@types/node/readline.d.ts","../../node_modules/@types/node/readline/promises.d.ts","../../node_modules/@types/node/repl.d.ts","../../node_modules/@types/node/sea.d.ts","../../node_modules/@types/node/sqlite.d.ts","../../node_modules/@types/node/stream.d.ts","../../node_modules/@types/node/stream/promises.d.ts","../../node_modules/@types/node/stream/consumers.d.ts","../../node_modules/@types/node/stream/web.d.ts","../../node_modules/@types/node/string_decoder.d.ts","../../node_modules/@types/node/test.d.ts","../../node_modules/@types/node/timers.d.ts","../../node_modules/@types/node/timers/promises.d.ts","../../node_modules/@types/node/tls.d.ts","../../node_modules/@types/node/trace_events.d.ts","../../node_modules/@types/node/tty.d.ts","../../node_modules/@types/node/url.d.ts","../../node_modules/@types/node/util.d.ts","../../node_modules/@types/node/v8.d.ts","../../node_modules/@types/node/vm.d.ts","../../node_modules/@types/node/wasi.d.ts","../../node_modules/@types/node/worker_threads.d.ts","../../node_modules/@types/node/zlib.d.ts","../../node_modules/@types/node/index.d.ts","../../node_modules/ioredis/built/types.d.ts","../../node_modules/ioredis/built/Command.d.ts","../../node_modules/ioredis/built/ScanStream.d.ts","../../node_modules/ioredis/built/utils/RedisCommander.d.ts","../../node_modules/ioredis/built/transaction.d.ts","../../node_modules/ioredis/built/utils/Commander.d.ts","../../node_modules/ioredis/built/connectors/AbstractConnector.d.ts","../../node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts","../../node_modules/ioredis/built/connectors/StandaloneConnector.d.ts","../../node_modules/ioredis/built/redis/RedisOptions.d.ts","../../node_modules/ioredis/built/cluster/util.d.ts","../../node_modules/ioredis/built/cluster/ClusterOptions.d.ts","../../node_modules/ioredis/built/cluster/index.d.ts","../../node_modules/denque/index.d.ts","../../node_modules/ioredis/built/SubscriptionSet.d.ts","../../node_modules/ioredis/built/DataHandler.d.ts","../../node_modules/ioredis/built/Redis.d.ts","../../node_modules/ioredis/built/Pipeline.d.ts","../../node_modules/ioredis/built/index.d.ts","../../src/interfaces/redis-options.ts","../../src/interfaces/telemetry.ts","../../src/interfaces/queue-options.ts","../../src/interfaces/flow-job.ts","../../src/interfaces/ioredis-events.ts","../../src/interfaces/job-scheduler-json.ts","../../src/interfaces/lock-manager-worker-context.ts","../../src/interfaces/metrics-options.ts","../../src/interfaces/metrics.ts","../../src/classes/queue-keys.ts","../../src/interfaces/script-queue-context.ts","../../src/interfaces/minimal-queue.ts","../../src/interfaces/parent-message.ts","../../src/interfaces/queue-meta.ts","../../src/interfaces/rate-limiter-options.ts","../../src/interfaces/redis-streams.ts","../../src/interfaces/repeatable-job.ts","../../src/interfaces/repeatable-options.ts","../../src/interfaces/retry-options.ts","../../src/interfaces/sandboxed-job.ts","../../src/interfaces/sandboxed-job-processor.ts","../../src/interfaces/sandboxed-options.ts","../../src/interfaces/worker-options.ts","../../src/interfaces/receiver.ts","../../src/interfaces/index.ts","../../src/classes/child.ts","../../src/classes/child-pool.ts","../../node_modules/node-abort-controller/index.d.ts","../../src/classes/abort-controller.ts","../../node_modules/@types/lodash/common/common.d.ts","../../node_modules/@types/lodash/common/array.d.ts","../../node_modules/@types/lodash/common/collection.d.ts","../../node_modules/@types/lodash/common/date.d.ts","../../node_modules/@types/lodash/common/function.d.ts","../../node_modules/@types/lodash/common/lang.d.ts","../../node_modules/@types/lodash/common/math.d.ts","../../node_modules/@types/lodash/common/number.d.ts","../../node_modules/@types/lodash/common/object.d.ts","../../node_modules/@types/lodash/common/seq.d.ts","../../node_modules/@types/lodash/common/string.d.ts","../../node_modules/@types/lodash/common/util.d.ts","../../node_modules/@types/lodash/index.d.ts","../../node_modules/@types/lodash.defaults/index.d.ts","../../node_modules/@types/lodash.isarguments/index.d.ts","../../node_modules/ioredis/built/utils/lodash.d.ts","../../node_modules/ioredis/built/utils/debug.d.ts","../../node_modules/ioredis/built/utils/index.d.ts","../../src/classes/errors/connection-closed-error.ts","../../node_modules/@types/semver/functions/inc.d.ts","../../node_modules/@types/semver/classes/semver.d.ts","../../node_modules/@types/semver/functions/parse.d.ts","../../node_modules/@types/semver/functions/valid.d.ts","../../node_modules/@types/semver/functions/clean.d.ts","../../node_modules/@types/semver/functions/diff.d.ts","../../node_modules/@types/semver/functions/major.d.ts","../../node_modules/@types/semver/functions/minor.d.ts","../../node_modules/@types/semver/functions/patch.d.ts","../../node_modules/@types/semver/functions/prerelease.d.ts","../../node_modules/@types/semver/functions/compare.d.ts","../../node_modules/@types/semver/functions/rcompare.d.ts","../../node_modules/@types/semver/functions/compare-loose.d.ts","../../node_modules/@types/semver/functions/compare-build.d.ts","../../node_modules/@types/semver/functions/sort.d.ts","../../node_modules/@types/semver/functions/rsort.d.ts","../../node_modules/@types/semver/functions/gt.d.ts","../../node_modules/@types/semver/functions/lt.d.ts","../../node_modules/@types/semver/functions/eq.d.ts","../../node_modules/@types/semver/functions/neq.d.ts","../../node_modules/@types/semver/functions/gte.d.ts","../../node_modules/@types/semver/functions/lte.d.ts","../../node_modules/@types/semver/functions/cmp.d.ts","../../node_modules/@types/semver/functions/coerce.d.ts","../../node_modules/@types/semver/classes/comparator.d.ts","../../node_modules/@types/semver/classes/range.d.ts","../../node_modules/@types/semver/functions/satisfies.d.ts","../../node_modules/@types/semver/ranges/max-satisfying.d.ts","../../node_modules/@types/semver/ranges/min-satisfying.d.ts","../../node_modules/@types/semver/ranges/to-comparators.d.ts","../../node_modules/@types/semver/ranges/min-version.d.ts","../../node_modules/@types/semver/ranges/valid.d.ts","../../node_modules/@types/semver/ranges/outside.d.ts","../../node_modules/@types/semver/ranges/gtr.d.ts","../../node_modules/@types/semver/ranges/ltr.d.ts","../../node_modules/@types/semver/ranges/intersects.d.ts","../../node_modules/@types/semver/ranges/simplify.d.ts","../../node_modules/@types/semver/ranges/subset.d.ts","../../node_modules/@types/semver/internals/identifiers.d.ts","../../node_modules/@types/semver/index.d.ts","../../src/utils/index.ts","../../src/classes/child-processor.ts","../../src/classes/errors/delayed-error.ts","../../src/classes/errors/rate-limit-error.ts","../../src/classes/errors/unrecoverable-error.ts","../../src/classes/errors/waiting-children-error.ts","../../src/classes/errors/waiting-error.ts","../../src/classes/errors/index.ts","../../node_modules/msgpackr/index.d.cts","../../src/version.ts","../../src/classes/scripts.ts","../../src/utils/create-scripts.ts","../../src/scripts/addDelayedJob-6.ts","../../src/scripts/addJobScheduler-11.ts","../../src/scripts/addLog-2.ts","../../src/scripts/addParentJob-6.ts","../../src/scripts/addPrioritizedJob-9.ts","../../src/scripts/addRepeatableJob-2.ts","../../src/scripts/addStandardJob-9.ts","../../src/scripts/changeDelay-4.ts","../../src/scripts/changePriority-7.ts","../../src/scripts/cleanJobsInSet-3.ts","../../src/scripts/drain-5.ts","../../src/scripts/extendLock-2.ts","../../src/scripts/extendLocks-1.ts","../../src/scripts/getCounts-1.ts","../../src/scripts/getCountsPerPriority-4.ts","../../src/scripts/getDependencyCounts-4.ts","../../src/scripts/getJobScheduler-1.ts","../../src/scripts/getMetrics-2.ts","../../src/scripts/getRanges-1.ts","../../src/scripts/getRateLimitTtl-2.ts","../../src/scripts/getState-8.ts","../../src/scripts/getStateV2-8.ts","../../src/scripts/isFinished-3.ts","../../src/scripts/isJobInList-1.ts","../../src/scripts/isMaxed-2.ts","../../src/scripts/moveJobFromActiveToWait-9.ts","../../src/scripts/moveJobsToWait-8.ts","../../src/scripts/moveStalledJobsToWait-8.ts","../../src/scripts/moveToActive-11.ts","../../src/scripts/moveToDelayed-12.ts","../../src/scripts/moveToFinished-14.ts","../../src/scripts/moveToWaitingChildren-7.ts","../../src/scripts/obliterate-2.ts","../../src/scripts/paginate-1.ts","../../src/scripts/pause-7.ts","../../src/scripts/promote-9.ts","../../src/scripts/releaseLock-1.ts","../../src/scripts/removeChildDependency-1.ts","../../src/scripts/removeDeduplicationKey-1.ts","../../src/scripts/removeJob-2.ts","../../src/scripts/removeJobScheduler-3.ts","../../src/scripts/removeOrphanedJobs-1.ts","../../src/scripts/removeRepeatable-3.ts","../../src/scripts/removeUnprocessedChildren-2.ts","../../src/scripts/reprocessJob-8.ts","../../src/scripts/retryJob-11.ts","../../src/scripts/saveStacktrace-1.ts","../../src/scripts/updateData-1.ts","../../src/scripts/updateJobScheduler-12.ts","../../src/scripts/updateProgress-3.ts","../../src/scripts/updateRepeatableJobMillis-1.ts","../../src/scripts/index.ts","../../src/classes/ioredis-client.ts","../../src/classes/redis-connection.ts","../../src/classes/queue-base.ts","../../src/classes/queue-events.ts","../../src/classes/job.ts","../../src/classes/flow-producer.ts","../../src/classes/node-redis-client.ts","../../src/classes/bun-redis-client.ts","../../src/classes/job-scheduler.ts","../../src/classes/lock-manager.ts","../../src/classes/queue-events-producer.ts","../../src/classes/queue-getters.ts","../../src/classes/repeat.ts","../../src/classes/queue.ts","../../src/classes/sandbox.ts","../../src/types/processor.ts","../../src/classes/worker.ts","../../src/classes/index.ts","../../src/index.ts","../../src/classes/main-base.ts","../../src/classes/main-worker.ts","../../src/classes/main.ts","../../src/types/net.d.ts"],"fileIdsList":[[118,173,190,191,193,287,420],[118,173,190,191,193,275,277,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,276,277,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,285,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,285,286,420],[118,170,171,173,190,191,193,420],[118,172,173,190,191,193,420],[173,190,191,193,420],[118,173,178,190,191,193,208,420],[118,173,174,179,184,190,191,193,205,216,420],[118,173,174,175,184,190,191,193,420],[118,173,190,191,193,420],[118,173,176,190,191,193,217,420],[118,173,177,178,185,190,191,193,194,420],[118,173,178,190,191,193,205,213,420],[118,173,179,181,184,190,191,193,420],[118,172,173,180,190,191,193,420],[118,173,181,182,190,191,193,420],[118,173,183,184,190,191,193,420],[118,172,173,184,190,191,193,420],[118,173,184,185,186,190,191,193,205,216,420],[118,173,184,185,186,190,191,193,200,205,208,420],[118,165,173,181,184,187,190,191,193,205,216,420],[118,173,184,185,187,188,190,191,193,205,213,216,420],[118,173,187,189,190,191,193,205,213,216,420],[116,117,118,119,120,121,122,123,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,420],[118,173,184,190,191,193,420],[118,173,190,191,192,193,216,420],[118,173,181,184,190,191,193,205,420],[118,173,190,191,193,194,420],[118,173,190,191,193,195,420],[118,172,173,190,191,193,196,420],[118,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,420],[118,173,190,191,193,198,420],[118,173,190,191,193,199,420],[118,173,184,190,191,193,200,201,420],[118,173,190,191,193,200,202,217,219,420],[118,173,185,190,191,193,420],[118,173,184,190,191,193,205,206,208,420],[118,173,190,191,193,207,208,420],[118,173,190,191,193,205,206,420],[118,173,190,191,193,208,420],[118,173,190,191,193,209,420],[118,170,173,190,191,193,205,210,216,420],[118,173,184,190,191,193,211,212,420],[118,173,190,191,193,211,212,420],[118,173,190,191,193,214,420],[118,173,190,191,193,215,420],[118,173,187,190,191,193,199,216,420],[118,173,178,190,191,193,217,420],[118,173,190,191,193,205,218,420],[118,173,190,191,192,193,219,420],[118,173,190,191,193,220,420],[118,173,178,190,191,193,420],[118,165,173,190,191,193,420],[118,173,190,191,193,221,420],[118,165,173,184,186,190,191,193,196,205,208,216,218,219,221,420],[118,173,190,191,193,205,222,420],[118,173,190,191,193,295,333,420],[118,173,190,191,193,295,318,333,420],[118,173,190,191,193,294,333,420],[118,173,190,191,193,333,420],[118,173,190,191,193,295,420],[118,173,190,191,193,295,319,333,420],[118,173,190,191,193,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,420],[118,173,190,191,193,319,333,420],[87,118,173,190,191,193,420],[118,173,190,191,193,223,224,420],[118,173,184,190,191,193,223,224,240,241,420],[118,173,190,191,193,225,229,239,243,420],[118,173,184,190,191,193,223,224,225,226,228,229,236,239,240,242,420],[118,173,190,191,193,205,223,420],[118,173,190,191,193,225,420],[118,173,181,190,191,193,223,229,236,237,420],[118,173,184,190,191,193,223,224,225,226,228,229,237,238,243,420],[118,173,181,190,191,193,223,420],[118,173,190,191,193,224,420],[118,173,190,191,193,230,420],[118,173,190,191,193,232,420],[118,173,184,190,191,193,213,223,224,230,232,233,238,420],[118,173,190,191,193,236,420],[118,173,190,191,193,213,223,224,230,420],[118,173,190,191,193,224,225,226,227,230,234,235,236,237,238,239,243,244,420],[118,173,190,191,193,229,231,234,235,420],[118,173,190,191,193,227,420],[118,173,190,191,193,213,223,420],[118,173,190,191,193,224,225,227,420],[118,173,190,191,193,223,224,290,291,420],[118,173,190,191,193,288,289,420],[118,173,190,191,193,205,420],[118,131,134,137,138,173,190,191,193,216,420],[118,134,173,190,191,193,205,216,420],[118,134,138,173,190,191,193,216,420],[118,128,173,190,191,193,420],[118,132,173,190,191,193,420],[118,130,131,134,173,190,191,193,216,420],[118,173,190,191,193,213,420],[118,173,190,191,193,223,420],[118,128,173,190,191,193,223,420],[118,130,134,173,190,191,193,216,420],[118,125,126,127,129,133,173,184,190,191,193,205,216,420],[118,134,142,150,173,190,191,193,420],[118,126,132,173,190,191,193,420],[118,134,159,160,173,190,191,193,420],[118,126,129,134,173,190,191,193,208,216,223,420],[118,134,173,190,191,193,420],[118,125,173,190,191,193,420],[118,128,129,130,132,133,134,135,136,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,160,161,162,163,164,173,190,191,193,420],[118,134,152,155,173,181,190,191,193,420],[118,134,142,143,144,173,190,191,193,420],[118,132,134,143,145,173,190,191,193,420],[118,133,173,190,191,193,420],[118,126,128,134,173,190,191,193,420],[118,134,138,143,145,173,190,191,193,420],[118,138,173,190,191,193,420],[118,132,134,137,173,190,191,193,216,420],[118,126,130,134,142,173,190,191,193,420],[118,134,152,173,190,191,193,420],[118,145,173,190,191,193,420],[118,128,134,159,173,190,191,193,208,221,223,420],[82,118,173,190,191,193,273,420],[82,118,173,190,191,193,420],[82,84,97,98,118,173,190,191,193,420],[82,109,118,173,178,184,190,191,193,205,293,420],[82,118,173,190,191,193,195,270,271,420],[82,105,115,118,173,190,191,193,270,274,334,420],[82,105,118,173,174,184,190,191,193,221,270,420],[82,118,173,190,191,193,293,336,337,338,339,340,420],[82,105,118,173,184,190,191,193,255,270,334,399,402,420],[82,83,99,118,173,190,191,193,255,271,272,335,341,344,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,414,420],[82,109,118,173,190,191,193,245,420],[82,88,105,115,118,173,190,191,193,270,334,399,400,402,420],[82,99,105,115,118,173,190,191,193,217,270,334,338,344,345,401,420],[82,105,118,173,190,191,193,270,274,420],[82,105,118,173,190,191,193,270,334,335,420],[82,118,173,190,191,193,221,417,420],[82,118,173,190,191,193,334,417,420],[82,105,111,118,173,184,190,191,193,255,270,334,344,345,399,402,420],[82,118,173,190,191,193,270,399,400,420],[82,115,118,173,190,191,193,270,334,398,399,400,420],[82,105,109,115,118,173,190,191,193,270,334,400,402,420],[82,105,115,118,173,190,191,193,270,334,343,399,402,406,409,410,420],[82,109,115,118,173,184,190,191,193,245,270,292,293,334,343,397,398,420],[82,88,115,118,173,178,190,191,193,270,399,400,402,420],[82,105,118,173,190,191,193,270,271,272,402,420],[82,105,115,118,173,190,191,193,270,334,341,342,343,420],[82,83,105,115,118,173,185,190,191,193,195,216,270,272,274,334,341,398,399,400,402,406,407,410,412,413,420],[82,100,101,102,103,104,118,173,190,191,193,420],[82,105,115,118,173,190,191,193,270,334,345,413,415,420],[82,98,106,118,173,190,191,193,420],[82,84,85,86,89,118,173,190,191,193,420],[82,102,118,173,190,191,193,420],[82,109,118,173,184,190,191,193,420],[82,115,118,173,190,191,193,248,420],[82,84,86,89,90,94,95,97,107,108,109,110,118,173,190,191,193,246,247,248,249,250,251,252,253,254,256,257,258,259,260,261,262,263,264,265,266,267,268,269,420],[82,92,93,94,118,173,190,191,193,420],[82,115,118,173,190,191,193,420],[82,105,118,173,190,191,193,247,420],[82,86,92,93,94,95,96,118,173,190,191,193,420],[82,104,110,118,173,190,191,193,247,256,420],[82,95,100,118,173,190,191,193,420],[82,92,118,173,190,191,193,420],[82,90,107,118,173,190,191,193,246,247,420],[82,118,173,190,191,193,205,420],[82,88,118,173,190,191,193,420],[82,118,173,190,191,193,265,420],[82,97,115,118,173,190,191,193,420],[82,118,173,174,190,191,193,221,420],[82,110,111,118,173,190,191,193,248,255,420],[82,105,118,173,190,191,193,420],[82,85,107,118,173,190,191,193,247,248,253,260,267,420],[82,118,173,190,191,193,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,420],[82,97,118,173,190,191,193,420],[82,85,91,92,93,96,98,106,111,112,113,114,118,173,190,191,193,420],[82,95,118,173,190,191,193,420],[82,90,91,118,173,190,191,193,420],[82,112,118,173,190,191,193,420],[118,173,190,191,193],[82,118,173,190,191,193,402,420],[82,89,118,173,190,191,193,420],[82,118,173,190,191,193,270,344,420],[82,105,115,118,173,178,184,190,191,193,245,270,274,292,293,333,420]],"fileInfos":[{"version":"c430d44666289dae81f30fa7b2edebf186ecc91a2d4c71266ea6ae76388792e1","affectsGlobalScope":true,"impliedFormat":1},{"version":"45b7ab580deca34ae9729e97c13cfd999df04416a79116c3bfb483804f85ded4","impliedFormat":1},{"version":"3facaf05f0c5fc569c5649dd359892c98a85557e3e0c847964caeb67076f4d75","impliedFormat":1},{"version":"e44bb8bbac7f10ecc786703fe0a6a4b952189f908707980ba8f3c8975a760962","impliedFormat":1},{"version":"5e1c4c362065a6b95ff952c0eab010f04dcd2c3494e813b493ecfd4fcb9fc0d8","impliedFormat":1},{"version":"68d73b4a11549f9c0b7d352d10e91e5dca8faa3322bfb77b661839c42b1ddec7","impliedFormat":1},{"version":"5efce4fc3c29ea84e8928f97adec086e3dc876365e0982cc8479a07954a3efd4","impliedFormat":1},{"version":"feecb1be483ed332fad555aff858affd90a48ab19ba7272ee084704eb7167569","impliedFormat":1},{"version":"ee7bad0c15b58988daa84371e0b89d313b762ab83cb5b31b8a2d1162e8eb41c2","impliedFormat":1},{"version":"27bdc30a0e32783366a5abeda841bc22757c1797de8681bbe81fbc735eeb1c10","impliedFormat":1},{"version":"8fd575e12870e9944c7e1d62e1f5a73fcf23dd8d3a321f2a2c74c20d022283fe","impliedFormat":1},{"version":"2ab096661c711e4a81cc464fa1e6feb929a54f5340b46b0a07ac6bbf857471f0","impliedFormat":1},{"version":"080941d9f9ff9307f7e27a83bcd888b7c8270716c39af943532438932ec1d0b9","affectsGlobalScope":true,"impliedFormat":1},{"version":"c57796738e7f83dbc4b8e65132f11a377649c00dd3eee333f672b8f0a6bea671","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc2df20b1bcdc8c2d34af4926e2c3ab15ffe1160a63e58b7e09833f616efff44","affectsGlobalScope":true,"impliedFormat":1},{"version":"515d0b7b9bea2e31ea4ec968e9edd2c39d3eebf4a2d5cbd04e88639819ae3b71","affectsGlobalScope":true,"impliedFormat":1},{"version":"0559b1f683ac7505ae451f9a96ce4c3c92bdc71411651ca6ddb0e88baaaad6a3","affectsGlobalScope":true,"impliedFormat":1},{"version":"0dc1e7ceda9b8b9b455c3a2d67b0412feab00bd2f66656cd8850e8831b08b537","affectsGlobalScope":true,"impliedFormat":1},{"version":"ce691fb9e5c64efb9547083e4a34091bcbe5bdb41027e310ebba8f7d96a98671","affectsGlobalScope":true,"impliedFormat":1},{"version":"8d697a2a929a5fcb38b7a65594020fcef05ec1630804a33748829c5ff53640d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ff2a353abf8a80ee399af572debb8faab2d33ad38c4b4474cff7f26e7653b8d","affectsGlobalScope":true,"impliedFormat":1},{"version":"fb0f136d372979348d59b3f5020b4cdb81b5504192b1cacff5d1fbba29378aa1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d15bea3d62cbbdb9797079416b8ac375ae99162a7fba5de2c6c505446486ac0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"68d18b664c9d32a7336a70235958b8997ebc1c3b8505f4f1ae2b7e7753b87618","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb3d66c8327153d8fa7dd03f9c58d351107fe824c79e9b56b462935176cdf12a","affectsGlobalScope":true,"impliedFormat":1},{"version":"38f0219c9e23c915ef9790ab1d680440d95419ad264816fa15009a8851e79119","affectsGlobalScope":true,"impliedFormat":1},{"version":"69ab18c3b76cd9b1be3d188eaf8bba06112ebbe2f47f6c322b5105a6fbc45a2e","affectsGlobalScope":true,"impliedFormat":1},{"version":"a680117f487a4d2f30ea46f1b4b7f58bef1480456e18ba53ee85c2746eeca012","affectsGlobalScope":true,"impliedFormat":1},{"version":"2f11ff796926e0832f9ae148008138ad583bd181899ab7dd768a2666700b1893","affectsGlobalScope":true,"impliedFormat":1},{"version":"4de680d5bb41c17f7f68e0419412ca23c98d5749dcaaea1896172f06435891fc","affectsGlobalScope":true,"impliedFormat":1},{"version":"954296b30da6d508a104a3a0b5d96b76495c709785c1d11610908e63481ee667","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac9538681b19688c8eae65811b329d3744af679e0bdfa5d842d0e32524c73e1c","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a969edff4bd52585473d24995c5ef223f6652d6ef46193309b3921d65dd4376","affectsGlobalScope":true,"impliedFormat":1},{"version":"9e9fbd7030c440b33d021da145d3232984c8bb7916f277e8ffd3dc2e3eae2bdb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811ec78f7fefcabbda4bfa93b3eb67d9ae166ef95f9bff989d964061cbf81a0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"717937616a17072082152a2ef351cb51f98802fb4b2fdabd32399843875974ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7e7d9b7b50e5f22c915b525acc5a49a7a6584cf8f62d0569e557c5cfc4b2ac2","affectsGlobalScope":true,"impliedFormat":1},{"version":"71c37f4c9543f31dfced6c7840e068c5a5aacb7b89111a4364b1d5276b852557","affectsGlobalScope":true,"impliedFormat":1},{"version":"576711e016cf4f1804676043e6a0a5414252560eb57de9faceee34d79798c850","affectsGlobalScope":true,"impliedFormat":1},{"version":"89c1b1281ba7b8a96efc676b11b264de7a8374c5ea1e6617f11880a13fc56dc6","affectsGlobalScope":true,"impliedFormat":1},{"version":"74f7fa2d027d5b33eb0471c8e82a6c87216223181ec31247c357a3e8e2fddc5b","affectsGlobalScope":true,"impliedFormat":1},{"version":"d6d7ae4d1f1f3772e2a3cde568ed08991a8ae34a080ff1151af28b7f798e22ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"063600664504610fe3e99b717a1223f8b1900087fab0b4cad1496a114744f8df","affectsGlobalScope":true,"impliedFormat":1},{"version":"934019d7e3c81950f9a8426d093458b65d5aff2c7c1511233c0fd5b941e608ab","affectsGlobalScope":true,"impliedFormat":1},{"version":"52ada8e0b6e0482b728070b7639ee42e83a9b1c22d205992756fe020fd9f4a47","affectsGlobalScope":true,"impliedFormat":1},{"version":"3bdefe1bfd4d6dee0e26f928f93ccc128f1b64d5d501ff4a8cf3c6371200e5e6","affectsGlobalScope":true,"impliedFormat":1},{"version":"59fb2c069260b4ba00b5643b907ef5d5341b167e7d1dbf58dfd895658bda2867","affectsGlobalScope":true,"impliedFormat":1},{"version":"639e512c0dfc3fad96a84caad71b8834d66329a1f28dc95e3946c9b58176c73a","affectsGlobalScope":true,"impliedFormat":1},{"version":"368af93f74c9c932edd84c58883e736c9e3d53cec1fe24c0b0ff451f529ceab1","affectsGlobalScope":true,"impliedFormat":1},{"version":"af3dd424cf267428f30ccfc376f47a2c0114546b55c44d8c0f1d57d841e28d74","affectsGlobalScope":true,"impliedFormat":1},{"version":"995c005ab91a498455ea8dfb63aa9f83fa2ea793c3d8aa344be4a1678d06d399","affectsGlobalScope":true,"impliedFormat":1},{"version":"959d36cddf5e7d572a65045b876f2956c973a586da58e5d26cde519184fd9b8a","affectsGlobalScope":true,"impliedFormat":1},{"version":"965f36eae237dd74e6cca203a43e9ca801ce38824ead814728a2807b1910117d","affectsGlobalScope":true,"impliedFormat":1},{"version":"3925a6c820dcb1a06506c90b1577db1fdbf7705d65b62b99dce4be75c637e26b","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a3d63ef2b853447ec4f749d3f368ce642264246e02911fcb1590d8c161b8005","affectsGlobalScope":true,"impliedFormat":1},{"version":"8cdf8847677ac7d20486e54dd3fcf09eda95812ac8ace44b4418da1bbbab6eb8","affectsGlobalScope":true,"impliedFormat":1},{"version":"8444af78980e3b20b49324f4a16ba35024fef3ee069a0eb67616ea6ca821c47a","affectsGlobalScope":true,"impliedFormat":1},{"version":"3287d9d085fbd618c3971944b65b4be57859f5415f495b33a6adc994edd2f004","affectsGlobalScope":true,"impliedFormat":1},{"version":"b4b67b1a91182421f5df999988c690f14d813b9850b40acd06ed44691f6727ad","affectsGlobalScope":true,"impliedFormat":1},{"version":"df83c2a6c73228b625b0beb6669c7ee2a09c914637e2d35170723ad49c0f5cd4","affectsGlobalScope":true,"impliedFormat":1},{"version":"436aaf437562f276ec2ddbee2f2cdedac7664c1e4c1d2c36839ddd582eeb3d0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e3c06ea092138bf9fa5e874a1fdbc9d54805d074bee1de31b99a11e2fec239d","affectsGlobalScope":true,"impliedFormat":1},{"version":"87dc0f382502f5bbce5129bdc0aea21e19a3abbc19259e0b43ae038a9fc4e326","affectsGlobalScope":true,"impliedFormat":1},{"version":"b1cb28af0c891c8c96b2d6b7be76bd394fddcfdb4709a20ba05a7c1605eea0f9","affectsGlobalScope":true,"impliedFormat":1},{"version":"2fef54945a13095fdb9b84f705f2b5994597640c46afeb2ce78352fab4cb3279","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac77cb3e8c6d3565793eb90a8373ee8033146315a3dbead3bde8db5eaf5e5ec6","affectsGlobalScope":true,"impliedFormat":1},{"version":"56e4ed5aab5f5920980066a9409bfaf53e6d21d3f8d020c17e4de584d29600ad","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ece9f17b3866cc077099c73f4983bddbcb1dc7ddb943227f1ec070f529dedd1","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a6282c8827e4b9a95f4bf4f5c205673ada31b982f50572d27103df8ceb8013c","affectsGlobalScope":true,"impliedFormat":1},{"version":"1c9319a09485199c1f7b0498f2988d6d2249793ef67edda49d1e584746be9032","affectsGlobalScope":true,"impliedFormat":1},{"version":"e3a2a0cee0f03ffdde24d89660eba2685bfbdeae955a6c67e8c4c9fd28928eeb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811c71eee4aa0ac5f7adf713323a5c41b0cf6c4e17367a34fbce379e12bbf0a4","affectsGlobalScope":true,"impliedFormat":1},{"version":"51ad4c928303041605b4d7ae32e0c1ee387d43a24cd6f1ebf4a2699e1076d4fa","affectsGlobalScope":true,"impliedFormat":1},{"version":"60037901da1a425516449b9a20073aa03386cce92f7a1fd902d7602be3a7c2e9","affectsGlobalScope":true,"impliedFormat":1},{"version":"d4b1d2c51d058fc21ec2629fff7a76249dec2e36e12960ea056e3ef89174080f","affectsGlobalScope":true,"impliedFormat":1},{"version":"22adec94ef7047a6c9d1af3cb96be87a335908bf9ef386ae9fd50eeb37f44c47","affectsGlobalScope":true,"impliedFormat":1},{"version":"196cb558a13d4533a5163286f30b0509ce0210e4b316c56c38d4c0fd2fb38405","affectsGlobalScope":true,"impliedFormat":1},{"version":"73f78680d4c08509933daf80947902f6ff41b6230f94dd002ae372620adb0f60","affectsGlobalScope":true,"impliedFormat":1},{"version":"c5239f5c01bcfa9cd32f37c496cf19c61d69d37e48be9de612b541aac915805b","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e7f8264d0fb4c5339605a15daadb037bf238c10b654bb3eee14208f860a32ea","affectsGlobalScope":true,"impliedFormat":1},{"version":"782dec38049b92d4e85c1585fbea5474a219c6984a35b004963b00beb1aab538","affectsGlobalScope":true,"impliedFormat":1},{"version":"a6a5253138c5432c68a1510c70fe78a644fe2e632111ba778e1978010d6edfec","impliedFormat":1},{"version":"a41fc7f4704765806bfa20f0acd3c8ac57af34638fe6148a515fca8a05be073c","impliedFormat":1},{"version":"6ef6cf8f028d21b89738f36438cee654b5630a87c76be151fdad6c27f9ccff85","impliedFormat":1},{"version":"0be20bd89cca16c8c18e6af0ba7231fb21df0dca5b1c67bb5f9f52408e465296","impliedFormat":1},{"version":"63cdc0b726eaa947772cc97fb0e3bb501b940c036f386a936ce0ed6aaeec7ca7","impliedFormat":1},{"version":"827eb54656695635a6e25543f711f0fe86d1083e5e1c0e84f394ffc122bd3ad7","impliedFormat":1},{"version":"2309cee540edc190aa607149b673b437cb8807f4e8d921bf7f5a50e6aa8d609c","impliedFormat":1},{"version":"2616fbd4b71fd263c5625dafefa6fec836071914837003c8faa07d33c46dea89","impliedFormat":1},{"version":"39c48f007bea01f604f50ac8cf438c48424b13e5cdd187549aff1385ca473a25","impliedFormat":1},{"version":"bb22651f9f46d8b8f0e0415243643415886ff0ca4a59c0b21b7a581d261a8dca","impliedFormat":1},{"version":"b193dc5805aede1a621e2c130607a4f172563ee4bf11da61e2e4e3df59cc2fba","impliedFormat":1},{"version":"c5d73bf762b7b0e75fcdf691e21e31c9db9913931b200b9990f07f49ab2edff3","impliedFormat":1},{"version":"91122c81bb86f3472740b47d5fb2ec4010f8abb682abf6e1a053342a0ec609df","impliedFormat":1},{"version":"0acaee6de37286ef7ee7d4e51dcb01ca872c4f6b7392d55495e6b470d1f7bbba","impliedFormat":1},{"version":"42d324cacb819773415a5077b81e093c3000c91ae47b31e62bfff04604d79842","impliedFormat":1},{"version":"36e761faa09e1c765dc929eb608b318dc959e67c26764cd37a85c7869a5f3ba3","impliedFormat":1},{"version":"ccc6fd2d44c269c7d5b99aff0ed973114c3434334589da7f1e3127db9abe28f4","impliedFormat":1},{"version":"83fbac197e7b42f905b0833c7a74ca4359a8a98cabbe4dbfe2a2f175a05af849","impliedFormat":1},{"version":"566bb653cd3aad2d59b0c4e9d2c8aa41bfe297377c425d0098e94e745c16fe36","impliedFormat":1},{"version":"977fa2f1d8cea69406720a82e1ac191e8421ccfc768175cdb0f7ac47d3282cf2","impliedFormat":1},{"version":"98f6a7588acfcf281dcaa9cc50ff4ea0f9e6fc5874d4cf96e3839bfc8008003e","impliedFormat":1},{"version":"20e9212218f6e8c82a25166d510f3a5c7b2d0adcba728acb469d8babad4a4f70","impliedFormat":1},{"version":"9d7391c5875a7ff0d24a1b4fef350faf86a569b5d66413d1efc954fb148b595c","impliedFormat":1},{"version":"a66ad696f2785dd00374b8dee6fab5c58c049c0efe24b3c214fbe6aec3f53d6e","impliedFormat":1},{"version":"cf1dafd0562c7a211d40932255c73735fc15fbe461848ae00958af75ad92d705","impliedFormat":1},{"version":"dbd95702afd718f8b35cb5d75b5793c744100e007a80c46806bee1859083c53b","impliedFormat":1},{"version":"809920bc999ca3d69783e074e650e6a582aafe5f07cc68cc5888c2b4cb94026e","impliedFormat":1},{"version":"062968f9118f55e5c8785d95c16f74c37cab1ecca590b536962f07fb75e0fe96","impliedFormat":1},{"version":"b6d87975ea33867db5f18d3b0de37dff0aa3a723638129026a118cc9bda87e3d","impliedFormat":1},{"version":"ea4eadfe3d8b0447ecea1cbbf7aad70423cca9350bc9103a1d80cebc37e6bdb3","impliedFormat":1},{"version":"3b7809fa9a7523a0734b16e314843f3f643afef715368d65385f8b92a5e51676","impliedFormat":1},{"version":"e1e25f85d561bc507b0e6ddfb26bbe609e9f5320ee23a62b4d456805e34df098","impliedFormat":1},{"version":"6507c9036037259dbcfe27e50bfaf27f76185657061cc7af3123654b8aff8303","impliedFormat":1},{"version":"de79263f32ea34b3f9282b19251626eeb3a3aef8d96491b731a3c0fb5cca2e77","impliedFormat":1},{"version":"d153a11543fd884b596587ccd97aebbeed950b26933ee000f94009f1ab142848","affectsGlobalScope":true,"impliedFormat":1},{"version":"378281aa35786c27d5811af7e6bcaa492eebd0c7013d48137c35bbc69a2b9751","affectsGlobalScope":true,"impliedFormat":1},{"version":"3af97acf03cc97de58a3a4bc91f8f616408099bc4233f6d0852e72a8ffb91ac9","affectsGlobalScope":true,"impliedFormat":1},{"version":"1b2dd1cbeb0cc6ae20795958ba5950395ebb2849b7c8326853dd15530c77ab0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"1db0b7dca579049ca4193d034d835f6bfe73096c73663e5ef9a0b5779939f3d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"387a023d363f755eb63450a66c28b14cdd7bc30a104565e2dbf0a8988bb4a56c","affectsGlobalScope":true,"impliedFormat":1},{"version":"9798340ffb0d067d69b1ae5b32faa17ab31b82466a3fc00d8f2f2df0c8554aaa","affectsGlobalScope":true,"impliedFormat":1},{"version":"f26b11d8d8e4b8028f1c7d618b22274c892e4b0ef5b3678a8ccbad85419aef43","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e9c23ba78aabc2e0a27033f18737a6df754067731e69dc5f52823957d60a4b6","impliedFormat":1},{"version":"cdcf9ea426ad970f96ac930cd176d5c69c6c24eebd9fc580e1572d6c6a88f62c","impliedFormat":1},{"version":"23cd712e2ce083d68afe69224587438e5914b457b8acf87073c22494d706a3d0","impliedFormat":1},{"version":"487b694c3de27ddf4ad107d4007ad304d29effccf9800c8ae23c2093638d906a","impliedFormat":1},{"version":"3a80bc85f38526ca3b08007ee80712e7bb0601df178b23fbf0bf87036fce40ce","impliedFormat":1},{"version":"ccf4552357ce3c159ef75f0f0114e80401702228f1898bdc9402214c9499e8c0","impliedFormat":1},{"version":"c6fd2c5a395f2432786c9cb8deb870b9b0e8ff7e22c029954fabdd692bff6195","impliedFormat":1},{"version":"68834d631c8838c715f225509cfc3927913b9cc7a4870460b5b60c8dbdb99baf","impliedFormat":1},{"version":"2931540c47ee0ff8a62860e61782eb17b155615db61e36986e54645ec67f67c2","impliedFormat":1},{"version":"ccab02f3920fc75c01174c47fcf67882a11daf16baf9e81701d0a94636e94556","impliedFormat":1},{"version":"f6faf5f74e4c4cc309a6c6a6c4da02dbb840be5d3e92905a23dcd7b2b0bd1986","impliedFormat":1},{"version":"ea6bc8de8b59f90a7a3960005fd01988f98fd0784e14bc6922dde2e93305ec7d","impliedFormat":1},{"version":"36107995674b29284a115e21a0618c4c2751b32a8766dd4cb3ba740308b16d59","impliedFormat":1},{"version":"914a0ae30d96d71915fc519ccb4efbf2b62c0ddfb3a3fc6129151076bc01dc60","impliedFormat":1},{"version":"33e981bf6376e939f99bd7f89abec757c64897d33c005036b9a10d9587d80187","impliedFormat":1},{"version":"7fd1b31fd35876b0aa650811c25ec2c97a3c6387e5473eb18004bed86cdd76b6","impliedFormat":1},{"version":"b41767d372275c154c7ea6c9d5449d9a741b8ce080f640155cc88ba1763e35b3","impliedFormat":1},{"version":"3bacf516d686d08682751a3bd2519ea3b8041a164bfb4f1d35728993e70a2426","impliedFormat":1},{"version":"7fb266686238369442bd1719bc0d7edd0199da4fb8540354e1ff7f16669b4323","impliedFormat":1},{"version":"0a60a292b89ca7218b8616f78e5bbd1c96b87e048849469cccb4355e98af959a","impliedFormat":1},{"version":"0b6e25234b4eec6ed96ab138d96eb70b135690d7dd01f3dd8a8ab291c35a683a","impliedFormat":1},{"version":"9666f2f84b985b62400d2e5ab0adae9ff44de9b2a34803c2c5bd3c8325b17dc0","impliedFormat":1},{"version":"40cd35c95e9cf22cfa5bd84e96408b6fcbca55295f4ff822390abb11afbc3dca","impliedFormat":1},{"version":"b1616b8959bf557feb16369c6124a97a0e74ed6f49d1df73bb4b9ddf68acf3f3","impliedFormat":1},{"version":"5b03a034c72146b61573aab280f295b015b9168470f2df05f6080a2122f9b4df","impliedFormat":1},{"version":"40b463c6766ca1b689bfcc46d26b5e295954f32ad43e37ee6953c0a677e4ae2b","impliedFormat":1},{"version":"249b9cab7f5d628b71308c7d9bb0a808b50b091e640ba3ed6e2d0516f4a8d91d","impliedFormat":1},{"version":"80aae6afc67faa5ac0b32b5b8bc8cc9f7fa299cff15cf09cc2e11fd28c6ae29e","impliedFormat":1},{"version":"f473cd2288991ff3221165dcf73cd5d24da30391f87e85b3dd4d0450c787a391","impliedFormat":1},{"version":"499e5b055a5aba1e1998f7311a6c441a369831c70905cc565ceac93c28083d53","impliedFormat":1},{"version":"54c3e2371e3d016469ad959697fd257e5621e16296fa67082c2575d0bf8eced0","impliedFormat":1},{"version":"beb8233b2c220cfa0feea31fbe9218d89fa02faa81ef744be8dce5acb89bb1fd","impliedFormat":1},{"version":"c183b931b68ad184bc8e8372bf663f3d33304772fb482f29fb91b3c391031f3e","impliedFormat":1},{"version":"5d0375ca7310efb77e3ef18d068d53784faf62705e0ad04569597ae0e755c401","impliedFormat":1},{"version":"59af37caec41ecf7b2e76059c9672a49e682c1a2aa6f9d7dc78878f53aa284d6","impliedFormat":1},{"version":"addf417b9eb3f938fddf8d81e96393a165e4be0d4a8b6402292f9c634b1cb00d","impliedFormat":1},{"version":"48cc3ec153b50985fb95153258a710782b25975b10dd4ac8a4f3920632d10790","impliedFormat":1},{"version":"adf27937dba6af9f08a68c5b1d3fce0ca7d4b960c57e6d6c844e7d1a8e53adae","impliedFormat":1},{"version":"e1528ca65ac90f6fa0e4a247eb656b4263c470bb22d9033e466463e13395e599","impliedFormat":1},{"version":"2e85db9e6fd73cfa3d7f28e0ab6b55417ea18931423bd47b409a96e4a169e8e6","impliedFormat":1},{"version":"c46e079fe54c76f95c67fb89081b3e399da2c7d109e7dca8e4b58d83e332e605","impliedFormat":1},{"version":"866078923a56d026e39243b4392e282c1c63159723996fa89243140e1388a98d","impliedFormat":1},{"version":"f724236417941ea77ec8d38c6b7021f5fb7f8521c7f8c1538e87661f2c6a0774","affectsGlobalScope":true,"impliedFormat":1},{"version":"1cf059eaf468efcc649f8cf6075d3cb98e9a35a0fe9c44419ec3d2f5428d7123","affectsGlobalScope":true,"impliedFormat":1},{"version":"e7721c4f69f93c91360c26a0a84ee885997d748237ef78ef665b153e622b36c1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d97fb21da858fb18b8ae72c314e9743fd52f73ebe2764e12af1db32fc03f853f","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ea15fd99b2e34cb25fe8346c955000bb70c8b423ae4377a972ef46bfb37f595","impliedFormat":1},{"version":"7cf69dd5502c41644c9e5106210b5da7144800670cbe861f66726fa209e231c4","impliedFormat":1},{"version":"72c1f5e0a28e473026074817561d1bc9647909cf253c8d56c41d1df8d95b85f7","impliedFormat":1},{"version":"f9b4137a0d285bd77dba2e6e895530112264310ae47e07bf311feae428fb8b61","affectsGlobalScope":true,"impliedFormat":1},{"version":"c06b2652ffeb89afd0f1c52c165ced77032f9cd09bc481153fbd6b5504c69494","impliedFormat":1},{"version":"51aecd2df90a3cffea1eb4696b33b2d78594ea2aa2138e6b9471ec4841c6c2ee","impliedFormat":1},{"version":"9d8f9e63e29a3396285620908e7f14d874d066caea747dc4b2c378f0599166b4","affectsGlobalScope":true,"impliedFormat":1},{"version":"5524481e56c48ff486f42926778c0a3cce1cc85dc46683b92b1271865bcf015a","impliedFormat":1},{"version":"612422d5ba6b4a5c4537f423e9199645468ad80a689801da63ab7edb43f7b835","impliedFormat":1},{"version":"db9ada976f9e52e13f7ae8b9a320f4b67b87685938c5879187d8864b2fbe97f3","impliedFormat":1},{"version":"9f39e70a354d0fba29ac3cdf6eca00b7f9e96f64b2b2780c432e8ea27f133743","impliedFormat":1},{"version":"0dace96cc0f7bc6d0ee2044921bdf19fe42d16284dbcc8ae200800d1c9579335","impliedFormat":1},{"version":"a2e2bbde231b65c53c764c12313897ffdfb6c49183dd31823ee2405f2f7b5378","impliedFormat":1},{"version":"ad1cc0ed328f3f708771272021be61ab146b32ecf2b78f3224959ff1e2cd2a5c","impliedFormat":1},{"version":"c64e1888baaa3253ca4405b455e4bf44f76357868a1bd0a52998ade9a092ad78","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc8c6f5322961b56d9906601b20798725df60baeab45ec014fba9f795d5596fd","impliedFormat":1},{"version":"0904660ae854e6d41f6ff25356db1d654436c6305b0f0aa89d1532df0253486e","impliedFormat":1},{"version":"060d305fe4494d8cb2b99d620928d369d1ee55c1645f5e729a2aca07d0f108cb","impliedFormat":1},{"version":"a016b2a26863dd6acb1f18c4ff37363c2b51e27ca7b3374dc6342aff1ddead2d","impliedFormat":1},{"version":"0c50296ee73dae94efc3f0da4936b1146ca6ce2217acfabb44c19c9a33fa30e5","impliedFormat":1},{"version":"bbf42f98a5819f4f06e18c8b669a994afe9a17fe520ae3454a195e6eabf7700d","impliedFormat":1},{"version":"0e5974dfff7a97181c7c376545f126b20acf2f1341db7d3fccea4977bf3ce19c","impliedFormat":1},{"version":"c7f977ea78a1b060a30554c1c4ec0e2269c6e305a349ca2ada14931ac27ecc0b","affectsGlobalScope":true,"impliedFormat":1},{"version":"3806cdd6b48ba01a9198134e62a384ec217a98f316d4baef74dd46d62c947a63","impliedFormat":1},{"version":"ff65b8a8bd380c6d129becc35de02f7c29ad7ce03300331ca91311fb4044d1a9","impliedFormat":1},{"version":"04bf1aa481d1adfb16d93d76e44ce71c51c8ef68039d849926551199489637f6","impliedFormat":1},{"version":"2c9adcc85574b002c9a6311ff2141055769e0071856ec979d92ff989042b1f1b","affectsGlobalScope":true,"impliedFormat":1},{"version":"b8bf3fe89ec8baa335f6370b9fa36308e1bc7a72e2eb2dad1e94f31e27fa28b5","affectsGlobalScope":true,"impliedFormat":1},{"version":"a58a15da4c5ba3df60c910a043281256fa52d36a0fcdef9b9100c646282e88dd","impliedFormat":1},{"version":"b36beffbf8acdc3ebc58c8bb4b75574b31a2169869c70fc03f82895b93950a12","impliedFormat":1},{"version":"de263f0089aefbfd73c89562fb7254a7468b1f33b61839aafc3f035d60766cb4","impliedFormat":1},{"version":"77fbe5eecb6fac4b6242bbf6eebfc43e98ce5ccba8fa44e0ef6a95c945ff4d98","impliedFormat":1},{"version":"8c81fd4a110490c43d7c578e8c6f69b3af01717189196899a6a44f93daa57a3a","impliedFormat":1},{"version":"5fb39858b2459864b139950a09adae4f38dad87c25bf572ce414f10e4bd7baab","impliedFormat":1},{"version":"35390d6fa94bdb432c5d0bcb6547bdd11406c2692a6b90b9e47be2105ea19bd6","impliedFormat":1},{"version":"3910dab597c40e173bf0e0d419d3ce9682c54ebf6ae84849f9b829b1451a17ec","impliedFormat":1},{"version":"37ba7b45141a45ce6e80e66f2a96c8a5ab1bcef0fc2d0f56bb58df96ec67e972","impliedFormat":1},{"version":"45650f47bfb376c8a8ed39d4bcda5902ab899a3150029684ee4c10676d9fbaee","impliedFormat":1},{"version":"486c074a5c0f2254345c0d1c9540380f5463999e42d7e1a159305ea823d3c4b1","affectsGlobalScope":true,"impliedFormat":1},{"version":"c119835edf36415081dfd9ed15fc0cd37aaa28d232be029ad073f15f3d88c323","impliedFormat":1},{"version":"8e7c3bed5f19ade8f911677ddc83052e2283e25b0a8654cd89db9079d4b323c7","impliedFormat":1},{"version":"9705cd157ffbb91c5cab48bdd2de5a437a372e63f870f8a8472e72ff634d47c1","affectsGlobalScope":true,"impliedFormat":1},{"version":"ae86f30d5d10e4f75ce8dcb6e1bd3a12ecec3d071a21e8f462c5c85c678efb41","impliedFormat":1},{"version":"ccf3afaeebbeee4ca9092101e99fd6abd681116b6e5ec23e381bbb1e1f32262c","impliedFormat":1},{"version":"e03460fe72b259f6d25ad029f085e4bedc3f90477da4401d8fbc1efa9793230e","impliedFormat":1},{"version":"4286a3a6619514fca656089aee160bb6f2e77f4dd53dc5a96b26a0b4fc778055","impliedFormat":1},{"version":"ab7818a9d57a9297b90e456fc68b77f84d74395a9210a3cfa9d87db33aff8b14","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb08062718a5470cd864c1fae0eb5b3a3adc5bcd05dcf87608d6f60b65eca3f4","affectsGlobalScope":true,"impliedFormat":1},{"version":"3a815b7d1aebc0646b91548eab2fc19dada09ff255d04c71ced00bbd3058c8eb","impliedFormat":1},{"version":"255d948f87f24ffd57bcb2fdf95792fd418a2e1f712a98cf2cce88744d75085c","impliedFormat":1},{"version":"0d5b085f36e6dc55bc6332ecb9c733be3a534958c238fb8d8d18d4a2b6f2a15a","impliedFormat":1},{"version":"836b36913830645ac3b28fe33731aac3fdb3524ee8adbb4cdab9a5c189f41943","affectsGlobalScope":true,"impliedFormat":1},{"version":"bfd3b3c21a56104693183942e221c1896ee23bcb8f8d91ab0b941f7b32985411","impliedFormat":1},{"version":"d7e9ab1b0996639047c61c1e62f85c620e4382206b3abb430d9a21fb7bc23c77","impliedFormat":1},{"version":"332680a9475bd631519399f9796c59502aa499aa6f6771734eec82fa40c6d654","impliedFormat":1},{"version":"191bee6605de2b5210f29f22df04f5b5e6bdcc1f6e21fb07091d40eeeb75fd72","impliedFormat":1},{"version":"d83f3c0362467589b3a65d3a83088c068099c665a39061bf9b477f16708fa0f9","impliedFormat":1},{"version":"180e527dbc1f5ae2bbb79d0a3db1ada49258783d7e6299559e0f2ed663b4afec","impliedFormat":1},{"version":"29994a97447d10d003957bcc0c9355c272d8cf0f97143eb1ade331676e860945","impliedFormat":1},{"version":"f4260022f7af38e533d364ea62eb7ae01b0a32050033d7f6772073e1dc908025","impliedFormat":1},{"version":"9cddf06f2bc6753a8628670a737754b5c7e93e2cfe982a300a0b43cf98a7d032","impliedFormat":1},{"version":"3f8e68bd94e82fe4362553aa03030fcf94c381716ce3599d242535b0d9953e49","impliedFormat":1},{"version":"63e628515ec7017458620e1624c594c9bd76382f606890c8eebf2532bcab3b7c","impliedFormat":1},{"version":"355d5e2ba58012bc059e347a70aa8b72d18d82f0c3491e9660adaf852648f032","impliedFormat":1},{"version":"311cc121259b3e0c3c08304fc25b525aa02ba0f9bf55b3e7c60b0dbb7422014e","impliedFormat":1},{"version":"74c269b43d39e5ece20b2cca49c14e64c05b01e46407200d7558301d0fcaabf4","impliedFormat":1},{"version":"ec09bd95866efe38cd00ebb79dfa7a26563d600fa4a30db0f7c6d68f8f6d2b06","impliedFormat":1},{"version":"482d0ac70d56aa79941be30da6df28e926a007f835eed70cf7b5f3135368d1f6","impliedFormat":1},{"version":"7dd19397d5a090c9f8cd762bae67bd0ad6f782abe422594fb71168fb578673b0","impliedFormat":1},{"version":"84cbf6204ada0ee2f80493e55e45befa079954788718efd6dcc103183104e3c0","impliedFormat":1},{"version":"ed849d616865076f44a41c87f27698f7cdf230290c44bafc71d7c2bc6919b202","impliedFormat":1},{"version":"9a0a0af04065ddfecc29d2b090659fce57f46f64c7a04a9ba63835ef2b2d0efa","impliedFormat":1},{"version":"10297d22a9209a718b9883a384db19249b206a0897e95f2b9afeed3144601cb0","impliedFormat":1},{"version":"034b8b5912823744c986986f24432bf3fa7bfa671e69316b672f3f2db5166ce4","impliedFormat":1},{"version":"34d206f6ba993e601dade2791944bdf742ab0f7a8caccc661106c87438f4f904","impliedFormat":1},{"version":"05ca49cc7ba9111f6c816ecfadb9305fffeb579840961ee8286cc89749f06ebd","impliedFormat":1},{"version":"18d5c81f25ae9be5baa2ecb340668ecb56fa14460fc471c52500ccc5b2e24e32","impliedFormat":1},{"version":"ed4c414e4781c12c1d680119905b6391bfe3287a1cf26ea2cf533220dddac510","impliedFormat":1},{"version":"6179a7b83ef2b6e7ffc2747ba324d56355659d51ea5773a7c25c89e3e8ea1849","impliedFormat":1},{"version":"d4168568cd8ce2b8a4e362611fc82b6ac1758f74e79ea100e82039d9d550f0ec","impliedFormat":1},{"version":"04ec120196f2b788653193889370c58343c179f499967e1908cbc407b87d68d7","impliedFormat":1},{"version":"62210fd56b12ec7b2ddc5a2ebe56abcf2b1fb05c0c4f51d9aeffd994a85d5f1d","impliedFormat":1},{"version":"f7998261fd81a556bafae297c82a31bae1af46d293de755af038c01e3007dcf6","impliedFormat":1},{"version":"025fdbf28ecb823e5191eb9993b8b5179e53fbf22b17765355ba7114bf29acaa","impliedFormat":1},{"version":"18b6211f0de3042f984758a9d4c719736c23354e92ff869cae1d2681c9104ad0","impliedFormat":1},{"version":"12a98121bca01d5fd4cf6d67048878b1bffe5d38fb195c85e74a51cf2cf70822","impliedFormat":1},{"version":"220b9396b64d8cff5bb88db5bafdb41dcff9f40c064cfed3652d847a6b08b365","impliedFormat":1},{"version":"5a36a348fefad1e719c190a600f5716c3cb93eb5a5077dd27692e4dfb09ff5b3","impliedFormat":1},{"version":"77157a714f4008941d3f84856a84a04c4b8e53cb7062dc7592abe160c1eaf0ef","impliedFormat":1},{"version":"7e17eae5baab498513ab454b75ae0df07b27666df008dc50b79d31be84d22100","impliedFormat":1},{"version":"0ad9cf7f2e2189c474f272c7e8560d27abd2490c7a5bd8c04fd532b9b2dd166a","impliedFormat":1},{"version":"51ae708e531826c9dfbebc488e6f72a3be31d4a86ad652fc0e5042273e0936c6","impliedFormat":1},{"version":"5dcf56b534a8bb475bae0453e959f9d40162f56c4527b5c9ac4901daa5036bca","impliedFormat":1},{"version":"7beada3828cd93039812cd0c8978d97426f4029d3e475fdcf6fceb841cdae0c2","impliedFormat":1},{"version":"61f8dd81e6f0a57662ddfc907ca205240b85ecd047a63cb000ba9c5a76dcff36","impliedFormat":1},{"version":"bf81e0f19182be474f132d0fd66ca46238ca040e388621a82f3139a1bad0a7db","impliedFormat":1},{"version":"2973b28649d29f20ebfb0ac7e5a7d8044a4e3eaf080653b8d0ba9524a84bf1c9","impliedFormat":1},{"version":"07cb8ea313859ec39e37872b9ecd1f3826a0ef081b43f2b0a9b23d3a156ffa9a","impliedFormat":1},{"version":"3d5868008597d21f68cf7b6ab6f99550c1735b2525c5b091a8df543d7194e976","impliedFormat":1},{"version":"f2fae972cc358dfb228d58b15b57a6eef77045209794d6c8a964da9e9809e18b","impliedFormat":1},{"version":"597b9bd9363840016d7e8c6839cccd22f85079484bae7e444e80cf24645529af","impliedFormat":1},{"version":"f45ffd8db490369cc7a991ce346f9534050ac8095ae9af49318385c53915a8d8","impliedFormat":1},{"version":"e2d67d003bab544d97b441f9dedc46726bd2506f501b08ab083429933d31e325","impliedFormat":1},{"version":"0e6387b87925a10ba52cd0de685a4f7e2d9dd402dbac560dce8934e8e34007d0","impliedFormat":1},{"version":"75977e8522e9d2dc4a9487830eb4be61a522637c33fdb1619c1155402198848a","impliedFormat":1},{"version":"380b919bfa0516118edaf25b99e45f855e7bc3fd75ce4163a1cfe4a666388804","impliedFormat":1},{"version":"40de86ced5175a6ffe84a52abe6ac59ac0efbc604a5975a8c6476c3ddc682ff1","impliedFormat":1},{"version":"fcf79300e5257a23ed3bacaa6861d7c645139c6f7ece134d15e6669447e5e6db","impliedFormat":1},{"version":"187119ff4f9553676a884e296089e131e8cc01691c546273b1d0089c3533ce42","impliedFormat":1},{"version":"aa2c18a1b5a086bbcaae10a4efba409cc95ba7287d8cf8f2591b53704fea3dea","impliedFormat":1},{"version":"5a0b15210129310cee9fa6af9200714bb4b12af4a04d890e15f34dbea1cf1852","impliedFormat":1},{"version":"0244119dbcbcf34faf3ffdae72dab1e9bc2bc9efc3c477b2240ffa94af3bca56","impliedFormat":1},{"version":"00baffbe8a2f2e4875367479489b5d43b5fc1429ecb4a4cc98cfc3009095f52a","impliedFormat":1},{"version":"a873c50d3e47c21aa09fbe1e2023d9a44efb07cc0cb8c72f418bf301b0771fd3","impliedFormat":1},{"version":"7c14ccd2eaa82619fffc1bfa877eb68a012e9fb723d07ee98db451fadb618906","impliedFormat":1},{"version":"49c36529ee09ea9ce19525af5bb84985ea8e782cb7ee8c493d9e36d027a3d019","impliedFormat":1},{"version":"df996e25faa505f85aeb294d15ebe61b399cf1d1e49959cdfaf2cc0815c203f9","impliedFormat":1},{"version":"4f6a12044ee6f458db11964153830abbc499e73d065c51c329ec97407f4b13dd","impliedFormat":1},{"version":"3bb333e76b1dcd71659141edf96729b29f44e097758a8c52e13cf1bf598b796e","impliedFormat":1},{"version":"13acd4da80b02df72a792435b3b214dac8512efbc23ad5b9254ffb75171ae2c4","impliedFormat":1},{"version":"6565567ac1892fc1e2734a943bcc64611cfcb3cb30afd3c4ceced5a4f54c1d5e","impliedFormat":1},{"version":"cc28c612c491edf3d36e7fb6c08edea08af6f9574721c7b57fd4a4aed09c60e5","impliedFormat":1},{"version":"c46dbc4af1d024550c4b2234397e45f263c9fe71d0867bfd27e4833b1dd21d0c","impliedFormat":1},{"version":"4a57d7a83ba8670a30f7cafbecd8594c6ed953011991da16b5d08def4bcef0b6","impliedFormat":1},{"version":"ce6a3f09b8db73a7e9701aca91a04b4fabaf77436dd35b24482f9ee816016b17","impliedFormat":1},{"version":"20e086e5b64fdd52396de67761cc0e94693494deadb731264aac122adf08de3f","impliedFormat":1},{"version":"6e78f75403b3ec65efb41c70d392aeda94360f11cedc9fb2c039c9ea23b30962","impliedFormat":1},{"version":"c863198dae89420f3c552b5a03da6ed6d0acfa3807a64772b895db624b0de707","impliedFormat":1},{"version":"8b03a5e327d7db67112ebbc93b4f744133eda2c1743dbb0a990c61a8007823ef","impliedFormat":1},{"version":"42fad1f540271e35ca37cecda12c4ce2eef27f0f5cf0f8dd761d723c744d3159","impliedFormat":1},{"version":"ff3743a5de32bee10906aff63d1de726f6a7fd6ee2da4b8229054dfa69de2c34","impliedFormat":1},{"version":"83acd370f7f84f203e71ebba33ba61b7f1291ca027d7f9a662c6307d74e4ac22","impliedFormat":1},{"version":"1445cec898f90bdd18b2949b9590b3c012f5b7e1804e6e329fb0fe053946d5ec","impliedFormat":1},{"version":"0e5318ec2275d8da858b541920d9306650ae6ac8012f0e872fe66eb50321a669","impliedFormat":1},{"version":"cf530297c3fb3a92ec9591dd4fa229d58b5981e45fe6702a0bd2bea53a5e59be","impliedFormat":1},{"version":"c1f6f7d08d42148ddfe164d36d7aba91f467dbcb3caa715966ff95f55048b3a4","impliedFormat":1},{"version":"eefd2bbc8edb14c3bd1246794e5c070a80f9b8f3730bd42efb80df3cc50b9039","impliedFormat":1},{"version":"0c1ee27b8f6a00097c2d6d91a21ee4d096ab52c1e28350f6362542b55380059a","impliedFormat":1},{"version":"7677d5b0db9e020d3017720f853ba18f415219fb3a9597343b1b1012cfd699f7","impliedFormat":1},{"version":"bc1c6bc119c1784b1a2be6d9c47addec0d83ef0d52c8fbe1f14a51b4dfffc675","impliedFormat":1},{"version":"52cf2ce99c2a23de70225e252e9822a22b4e0adb82643ab0b710858810e00bf1","impliedFormat":1},{"version":"770625067bb27a20b9826255a8d47b6b5b0a2d3dfcbd21f89904c731f671ba77","impliedFormat":1},{"version":"d1ed6765f4d7906a05968fb5cd6d1db8afa14dbe512a4884e8ea5c0f5e142c80","impliedFormat":1},{"version":"799c0f1b07c092626cf1efd71d459997635911bb5f7fc1196efe449bba87e965","impliedFormat":1},{"version":"2a184e4462b9914a30b1b5c41cf80c6d3428f17b20d3afb711fff3f0644001fd","impliedFormat":1},{"version":"9eabde32a3aa5d80de34af2c2206cdc3ee094c6504a8d0c2d6d20c7c179503cc","impliedFormat":1},{"version":"397c8051b6cfcb48aa22656f0faca2553c5f56187262135162ee79d2b2f6c966","impliedFormat":1},{"version":"a8ead142e0c87dcd5dc130eba1f8eeed506b08952d905c47621dc2f583b1bff9","impliedFormat":1},{"version":"a02f10ea5f73130efca046429254a4e3c06b5475baecc8f7b99a0014731be8b3","impliedFormat":1},{"version":"c2576a4083232b0e2d9bd06875dd43d371dee2e090325a9eac0133fd5650c1cb","impliedFormat":1},{"version":"4c9a0564bb317349de6a24eb4efea8bb79898fa72ad63a1809165f5bd42970dd","impliedFormat":1},{"version":"f40ac11d8859092d20f953aae14ba967282c3bb056431a37fced1866ec7a2681","impliedFormat":1},{"version":"cc11e9e79d4746cc59e0e17473a59d6f104692fd0eeea1bdb2e206eabed83b03","impliedFormat":1},{"version":"b444a410d34fb5e98aa5ee2b381362044f4884652e8bc8a11c8fe14bbd85518e","impliedFormat":1},{"version":"c35808c1f5e16d2c571aa65067e3cb95afeff843b259ecfa2fc107a9519b5392","impliedFormat":1},{"version":"14d5dc055143e941c8743c6a21fa459f961cbc3deedf1bfe47b11587ca4b3ef5","impliedFormat":1},{"version":"a3ad4e1fc542751005267d50a6298e6765928c0c3a8dce1572f2ba6ca518661c","impliedFormat":1},{"version":"f237e7c97a3a89f4591afd49ecb3bd8d14f51a1c4adc8fcae3430febedff5eb6","impliedFormat":1},{"version":"3ffdfbec93b7aed71082af62b8c3e0cc71261cc68d796665faa1e91604fbae8f","impliedFormat":1},{"version":"662201f943ed45b1ad600d03a90dffe20841e725203ced8b708c91fcd7f9379a","impliedFormat":1},{"version":"c9ef74c64ed051ea5b958621e7fb853fe3b56e8787c1587aefc6ea988b3c7e79","impliedFormat":1},{"version":"2462ccfac5f3375794b861abaa81da380f1bbd9401de59ffa43119a0b644253d","impliedFormat":1},{"version":"34baf65cfee92f110d6653322e2120c2d368ee64b3c7981dff08ed105c4f19b0","impliedFormat":1},{"version":"a56fe175741cc8841835eb72e61fa5a34adcbc249ede0e3494c229f0750f6b85","impliedFormat":1},{"version":"d874ba87864aa538141818812bec237197f60927b599d319fd7d194a23c64917","impliedFormat":1},{"version":"1b4d98d3e3b722f305ce6ce672cb30fe7e44157dcbf00b0f7f0b0efc3ab16c61","impliedFormat":1},{"version":"f0e219869f98ed9fe70f7d831fc26d38ad9a2a12e1e2e2bfa6e9e685760d88a0","impliedFormat":1},{"version":"bbd65da9d6a799fd52ecf273b5dfd4eb434d44a9c4540664111139c68eb9d54d","impliedFormat":1},{"version":"b605c4ee56f9b9c93f53f059bec285407df6e0c0d417ec6b2aa7463ce340d02c","impliedFormat":1},{"version":"babe255ed6c3a93e012e697d14370ed282a3b20255376f3e1aeee43fe12aab0c","impliedFormat":1},{"version":"f35722210ab8d5645918fe52ad883ec3a61bf85e5ed37a189a9ed5935c5b8425","impliedFormat":1},{"version":"7dc695c4ab01309d1d1b43201700560054feadddf8d0bbfc79d981bff03c1db0","impliedFormat":1},{"version":"af80584f66d422baa23aafe39589ee742e866a303ea54aa2b479a8024a7684a0","impliedFormat":1},{"version":"8ed574be6a8f202fc621f4b81f1f1253a9dec72d9e2c7b6535620257fcb2984f","impliedFormat":1},{"version":"8c3e8a4ae5efd117a60207b13d21ba3e3c9c9e77ccd620c03de3bdae9ece7231","impliedFormat":1},{"version":"1d8bc0fada96ea58a0a0b128c9a26f91e58903ba32f8fa9c35f175d7fb6bc38e","impliedFormat":1},{"version":"85f526ba4fb0ec268599096da4352f8178f97e24959193eaae6f384e2dde1d04","impliedFormat":1},{"version":"64171e426181b2f8b43ccb191ebdd6427b6e1611b2505a278060672908b37126","impliedFormat":1},{"version":"ed4582b2568119f1e8ccdff8cef912119b3dc07a09218434579f63f17990ba46","impliedFormat":1},{"version":"ee73e3dd792e6437fad678fdf5f6715529c1f4ccc3010ac96ae9400bc62fa556","impliedFormat":1},{"version":"7daa8048eb0b031f385a99f639076eeeb8211b499c6bf09c560672ead98f143e","impliedFormat":1},{"version":"b188b15413384fb9fa6d03ac7c3a24bce1e7d230b6e8fcad3992e0d953f4e41e","impliedFormat":1},{"version":"a68015b850c6819ca84ea29d4a5946247fda5fba8cd481aa6e845155621c802c","impliedFormat":1},{"version":"236ace7f6bdf60eca3e55afdf5e82860b00a62265ce8ea986bd387927e9dc949","impliedFormat":1},{"version":"53a4e0faf9abf27ae4b06554e7eafefeed64e1acba4d993eb020d289236c0570","impliedFormat":1},{"version":"886729bb5188edf238061d4fb6442ac91255d1420d8d0bfe0d9b3e8fa5bf98be","impliedFormat":1},{"version":"ba0ce4e4d02a6e9177c451a5d8437e26f5f64d9e82be943b72df13261e0c5021","impliedFormat":1},{"version":"e8044d5fe7306aeea7b7df33c42a5417eab0b3b57d9c10df784b04e7249ddaf2","impliedFormat":1},{"version":"aa491c1fee3d6f14f630288da6049102e1567899856de9a5d4a6422a7a8f9394","impliedFormat":1},{"version":"ddbac00ef73dd35f18cda2d7be979fc0d525d9a649ceb46a5e3fc71cd8534864","impliedFormat":1},{"version":"832c1c68b9edb37fbdfb6f30a65e07cf758d4711bd69fa11f3f83a17f9c6233a","impliedFormat":1},{"version":"6982bf8b3ab115017a3cb48f33ccede2d53e951c529f789bf529c0fedcae517a","impliedFormat":1},{"version":"aac0b175e8fa90d7e6ab56b2013e89a01c683e437015cd52023eb63ed52c2185","impliedFormat":1},{"version":"f54d5f97995333e3b73fc8d19629a1cdc1b7edfc9c10e6c465d366b673b444be","impliedFormat":1},{"version":"35fcca2df2e48f0510642fabbfd9446e700f09c09620b27670649dee4b3e1c4a","impliedFormat":1},{"version":"f129258ce9c8439429fe19246b6522b58cb67d1a21e986554204e37cc7f35d73","impliedFormat":1},{"version":"b8f7a87aba95613a5cae44301563887a34b2c19aba24446b00a11a82b81fe413","impliedFormat":1},{"version":"57a0710c49b5bc1fd0260d5e99ba34f100fc5d5322c00901aef96781da97ae50","impliedFormat":1},{"version":"e80657786b074103dfcc95f833a45d0bdb3a4058c7405ed60b8d4797a0a66ee9","impliedFormat":1},{"version":"440d82272e1c87fe0709d83c52a6e64ed7fa5dc3743bc37372826977d5282c92","impliedFormat":1},{"version":"4ba14cfbb20fef8d718fa73305f50558a2fb04949664d6f1349f82661f8d7ffc","impliedFormat":1},{"version":"a8767b783ebfead72452d19b90784c8f22668c6bc1941db9c11cfe5e72162af9","impliedFormat":1},{"version":"aad8a2671b3e29516b183ea34cbfa4c8e80f63311d8df5677d8a0226b32ed980","impliedFormat":1},{"version":"775a7bc9dec138a8647726421b58d8f742f5b90fdf95b2acc4a7d5cc9b545dee","impliedFormat":1},{"version":"a392a7fafb606dd79d9c82db30d3e6f835ee01fee12ff058e908672334530613","impliedFormat":1},{"version":"e60b9c02836d9effc04ccdf8e1c40aeca19724d34f8063f76c6dd40e991b0838","impliedFormat":1},{"version":"d498db28ff568620c0710e2bd9895009e3326a4b33edcc5b6be765a3d8fba6ee","impliedFormat":1},{"version":"af897e8f575f2f5f7d650b0c6e8fc7f92e39945d170ca8be955150695b90d00f","impliedFormat":1},{"version":"ae7fdb2faeb45ad9c7691af8c3fad49435d9b377b1a718282050f4f6967dc5bd","impliedFormat":1},{"version":"2f2bbd8d308a580f954419f195757972dee8a2ac0a376a629b4473bdaf3746fc","impliedFormat":1},{"version":"e44f9b239aef341ae64c219dd361273218064cadd9076242aeee0fc75c13f225","impliedFormat":1},{"version":"1a5f975ec5f0e1a531c51782d5da0cbd699e25d8c9991e825dd00584ff1cecb5","impliedFormat":1},{"version":"cdc77dbdb04c12b1abd13a47e75d3b7c9d0de42a8fdecc6ec318251c6b49d7cf","impliedFormat":1},{"version":"333d4fb35e1300f17b8316a035ed836c5bca4a271b0383b4275996cf0929e1d9","impliedFormat":1},{"version":"7241f4177b20ede40b8ff952e8bfa9b0d8973050e1db3cc50798fb594f4e6805","impliedFormat":1},{"version":"e0bb926495c06e701c8aaa26c9fd9ea5ab04b535dde1ab4ff99d454954c45700","impliedFormat":1},{"version":"2d9f658e20d59c55dae09395c73c1c56926a39e14ea556029c451c747eeb5b8a","impliedFormat":1},{"version":"f9b1f5b04ffa657a2420dfe0664b8c080ed00cd84f23704a6b1b6ec8525f23a1","impliedFormat":1},{"version":"19d5f4ce91ed33dae7b9c18df734b2b7825691c7a8c5438c445e0797bc6a1485","impliedFormat":1},{"version":"a2841d852710b9596075e165b4cdd383448d6c43a0437e6518d31a8d3a521733","impliedFormat":1},{"version":"737062b8839911044e85d2be16f6013c01a5ff2345069176ff2a600494fca02b","impliedFormat":1},{"version":"d83ca342498e2c3443a21d5b8ed160446ce7d5afb42e02b0da5c4994996cfe6f","impliedFormat":1},{"version":"2fb2c3019715a3ac0cc9d381142c466d11f9c6d54ccb71a58d73a0044a3a04d3","impliedFormat":1},{"version":"ae3b0777431e411e681ac0347c9ff6dda2da6f7a7a8359b64f6b3d7d0c33cb1e","impliedFormat":1},{"version":"aed05375d7a53f27eb036276777c5618359e595348af0d3530bd59d41a974189","impliedFormat":1},{"version":"58323ecda861d08bedf98939ba7a967688bf12ce39be4ced179b94f864051635","impliedFormat":1},{"version":"6ce72d1fdae32c311dfc3b0d4b25139c17b5a467a817be69fe3b6689536918df","impliedFormat":1},{"version":"f6f9d4940ad1b9c126d07c0517fe4c71f9ec46d9364430f1a8f66f6fdccdaa38","impliedFormat":1},{"version":"1952f54a10ea4ea2a129b5caefe7d3cedd6c5dea3a4169b41a171008359ab78d","impliedFormat":1},{"version":"34b552c9e34df8de70e42ad227c8003d7bddc521925e1ec643d39836a32e42e1","impliedFormat":1},{"version":"f91c4c67452a212bcbb28fc19eabdc616ca24f81a41efe3536155f4de19d43eb","impliedFormat":1},{"version":"6005ad5c10b6ad91881808de1c03ab3f1d2c243ff351b3b35587e4372019ded5","impliedFormat":1},{"version":"98503d3c43ad1b34e6eda3a1a727263e5279ba0129c11fd0c89adc732703ec1b","impliedFormat":1},{"version":"b850c960fc1a46ebf26b7fa15c40270b0785c070c9f320904cf277f421b50612","impliedFormat":1},{"version":"258c21439970d3edcdf0d31c98013f633cceb3ba08ac7a5b45d22e42ef5f5934","impliedFormat":1},{"version":"00ea79a108b4abce16587fee415751555e3da6bcfdcfc16a1a2ba68948d5dbb4","impliedFormat":1},{"version":"d31e0021c6788b9b006b31db70930d3cfea21884342fa57f7fd634c7200e4606","impliedFormat":1},{"version":"4fefb841027894b9dbabab8e580229a2c6802bb3ffc60dd7b4393cecddcd62f0","impliedFormat":1},{"version":"7d4c658a774d1d9ceff6a49babf97d2a55ff575f29dc3c2171c5de71c9e76f2f","impliedFormat":1},{"version":"a3625bee02789cf44368f9628420e126fdf9c627544a73d47478ee5a963170df","impliedFormat":1},{"version":"ca5bb29bd25b95c356df601e183613bfd3b0464770880fda599fcfda2f131587","impliedFormat":1},{"version":"e228183f46a8b5b39e13f1836af3b9eb9726aee379e17da8b7a67ad7a208051e","impliedFormat":1},{"version":"3de594351d881d4fab3d0c711b513247e4717a743659d7a1259e707057fb585d","impliedFormat":1},{"version":"b591e1dd728774fdf3d47d61905610f5c5ee51c09bbcc56454378ab623d2a604","impliedFormat":1},{"version":"144b834595e9ef5736fb0388a180a91a0a33eb6d45e18b3eabb1004c6572e22d","impliedFormat":1},{"version":"58d10a220bee327f643270a8c7178a943d21f75cd468b0357a343b8b9085c994","impliedFormat":1},{"version":"a647418f3dd8876fc82d912172fb4cb8d66ae93f2955cca303794274f63ed5ad","impliedFormat":1},{"version":"6053f0e35f0bb6d7544f722e6625b735741c2b5519c05a1658c0dea679092366","impliedFormat":1},{"version":"5fed764f77b0e6ff239a48beae1a5810a8c596260fcde388815885a338447a13","impliedFormat":1},{"version":"850cfe238b3ca58e090f4a25d999987ace75cbdf33e5a0f05aa02b941fe9b8b6","impliedFormat":1},{"version":"47d03b60fdf2375390816bf74afcf733e5e045597764263cf86c49cef58235f9","impliedFormat":1}],"root":[[83,86],[89,115],[246,272],274,293,[334,341],[343,420]],"options":{"allowSyntheticDefaultImports":false,"declaration":false,"declarationDir":"../..","emitDecoratorMetadata":true,"esModuleInterop":false,"experimentalDecorators":true,"importHelpers":true,"jsx":1,"module":100,"outDir":"./","sourceMap":false,"strict":true,"strictNullChecks":false,"target":4,"useDefineForClassFields":false},"referencedMap":[[288,1],[289,1],[276,2],[277,3],[275,4],[278,5],[279,6],[280,7],[281,8],[282,9],[283,10],[284,11],[285,12],[286,13],[287,14],[170,15],[171,15],[172,16],[118,17],[173,18],[174,19],[175,20],[116,21],[176,22],[177,23],[178,24],[179,25],[180,26],[181,27],[182,27],[183,28],[184,29],[185,30],[186,31],[119,21],[117,21],[187,32],[188,33],[189,34],[223,35],[190,36],[191,21],[192,37],[193,38],[194,39],[195,40],[196,41],[197,42],[198,43],[199,44],[200,45],[201,45],[202,46],[203,21],[204,47],[205,48],[207,49],[206,50],[208,51],[209,52],[210,53],[211,54],[212,55],[213,24],[214,56],[215,57],[216,58],[217,59],[218,60],[219,61],[220,62],[120,21],[121,63],[122,21],[123,21],[166,64],[167,65],[168,21],[169,51],[221,66],[222,67],[318,68],[319,69],[295,70],[298,71],[316,68],[317,68],[307,68],[306,72],[304,68],[299,68],[312,68],[310,68],[314,68],[294,68],[311,68],[315,68],[300,68],[301,68],[313,68],[296,68],[302,68],[303,68],[305,68],[309,68],[320,73],[308,68],[297,68],[333,74],[332,21],[327,73],[329,75],[328,73],[321,73],[322,73],[324,73],[326,73],[330,75],[331,75],[323,75],[325,75],[124,21],[87,21],[88,76],[240,21],[225,77],[242,78],[244,79],[243,80],[226,81],[241,82],[238,83],[239,84],[237,85],[230,86],[231,87],[233,88],[234,89],[232,90],[235,91],[245,92],[236,93],[228,94],[224,95],[229,96],[227,77],[291,21],[292,97],[290,98],[342,99],[273,21],[82,21],[80,21],[81,21],[13,21],[15,21],[14,21],[2,21],[16,21],[17,21],[18,21],[19,21],[20,21],[21,21],[22,21],[23,21],[3,21],[24,21],[25,21],[4,21],[26,21],[30,21],[27,21],[28,21],[29,21],[31,21],[32,21],[33,21],[5,21],[34,21],[35,21],[36,21],[37,21],[6,21],[41,21],[38,21],[39,21],[40,21],[42,21],[7,21],[43,21],[48,21],[49,21],[44,21],[45,21],[46,21],[47,21],[8,21],[53,21],[50,21],[51,21],[52,21],[54,21],[9,21],[55,21],[56,21],[57,21],[59,21],[58,21],[60,21],[61,21],[10,21],[62,21],[63,21],[64,21],[11,21],[65,21],[66,21],[67,21],[68,21],[69,21],[1,21],[70,21],[71,21],[12,21],[75,21],[73,21],[78,21],[77,21],[72,21],[76,21],[74,21],[79,21],[142,100],[154,101],[140,102],[155,99],[164,103],[131,104],[132,105],[130,106],[163,107],[158,108],[162,109],[134,110],[151,111],[133,112],[161,113],[128,114],[129,108],[135,115],[136,21],[141,109],[139,115],[126,116],[165,117],[156,118],[145,119],[144,115],[146,120],[149,121],[143,122],[147,123],[159,107],[137,124],[138,125],[150,126],[127,99],[153,127],[152,115],[148,128],[157,21],[125,21],[160,129],[274,130],[83,131],[99,132],[405,133],[272,134],[335,135],[271,136],[293,131],[336,131],[341,137],[337,131],[338,131],[339,131],[340,131],[403,138],[415,139],[398,140],[406,141],[402,142],[407,143],[417,144],[418,145],[419,146],[404,133],[400,147],[408,148],[401,149],[409,150],[255,131],[411,151],[399,152],[410,153],[412,154],[344,155],[414,156],[100,131],[101,131],[105,157],[103,131],[102,131],[104,131],[416,158],[107,159],[84,131],[90,160],[108,161],[110,162],[249,163],[270,164],[250,131],[95,165],[251,166],[252,167],[253,131],[254,131],[97,168],[257,169],[258,170],[86,131],[94,171],[259,131],[248,172],[260,131],[269,131],[109,173],[246,140],[261,131],[89,174],[262,131],[263,131],[264,131],[266,175],[265,176],[267,177],[256,178],[247,179],[268,180],[346,131],[347,131],[348,131],[349,131],[350,131],[351,131],[352,131],[353,131],[354,131],[355,131],[356,131],[357,131],[358,131],[359,131],[360,131],[361,131],[362,131],[363,131],[364,131],[365,131],[366,131],[367,131],[397,181],[368,131],[369,131],[370,131],[371,131],[372,131],[373,131],[374,131],[375,131],[376,131],[377,131],[378,131],[379,131],[380,131],[381,131],[382,131],[383,131],[384,131],[385,131],[386,131],[387,131],[388,131],[389,131],[390,131],[391,131],[392,131],[393,131],[394,131],[395,131],[396,131],[98,182],[111,131],[91,131],[112,131],[115,183],[96,184],[92,185],[93,131],[113,171],[114,186],[85,131],[420,187],[413,188],[106,189],[345,190],[334,191],[343,131]],"version":"5.9.3"}
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/cjs/types/backoff-strategy.js b/node_modules/bullmq/dist/cjs/types/backoff-strategy.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/backoff-strategy.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/database-type.js b/node_modules/bullmq/dist/cjs/types/database-type.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/database-type.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/deduplication-options.js b/node_modules/bullmq/dist/cjs/types/deduplication-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/deduplication-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/finished-status.js b/node_modules/bullmq/dist/cjs/types/finished-status.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/finished-status.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/index.js b/node_modules/bullmq/dist/cjs/types/index.js
new file mode 100644
index 0000000..231d0cc
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/index.js
@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const tslib_1 = require("tslib");
+tslib_1.__exportStar(require("./backoff-strategy"), exports);
+tslib_1.__exportStar(require("./database-type"), exports);
+tslib_1.__exportStar(require("./deduplication-options"), exports);
+tslib_1.__exportStar(require("./finished-status"), exports);
+tslib_1.__exportStar(require("./job-json-sandbox"), exports);
+tslib_1.__exportStar(require("./job-options"), exports);
+tslib_1.__exportStar(require("./job-scheduler-template-options"), exports);
+tslib_1.__exportStar(require("./job-type"), exports);
+tslib_1.__exportStar(require("./job-progress"), exports);
+tslib_1.__exportStar(require("./repeat-strategy"), exports);
+tslib_1.__exportStar(require("./keep-jobs"), exports);
diff --git a/node_modules/bullmq/dist/cjs/types/job-json-sandbox.js b/node_modules/bullmq/dist/cjs/types/job-json-sandbox.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/job-json-sandbox.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/job-options.js b/node_modules/bullmq/dist/cjs/types/job-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/job-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/job-progress.js b/node_modules/bullmq/dist/cjs/types/job-progress.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/job-progress.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/job-scheduler-template-options.js b/node_modules/bullmq/dist/cjs/types/job-scheduler-template-options.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/job-scheduler-template-options.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/job-type.js b/node_modules/bullmq/dist/cjs/types/job-type.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/job-type.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/keep-jobs.js b/node_modules/bullmq/dist/cjs/types/keep-jobs.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/keep-jobs.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/processor.js b/node_modules/bullmq/dist/cjs/types/processor.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/processor.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/types/repeat-strategy.js b/node_modules/bullmq/dist/cjs/types/repeat-strategy.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/types/repeat-strategy.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/dist/cjs/utils/create-scripts.js b/node_modules/bullmq/dist/cjs/utils/create-scripts.js
new file mode 100644
index 0000000..37b1cac
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/utils/create-scripts.js
@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createScripts = void 0;
+const scripts_1 = require("../classes/scripts");
+/*
+ * Factory method to create a Scripts object.
+ */
+const createScripts = (queue) => {
+    return new scripts_1.Scripts({
+        keys: queue.keys,
+        client: queue.client,
+        get redisVersion() {
+            return queue.redisVersion;
+        },
+        toKey: queue.toKey,
+        opts: queue.opts,
+        closing: queue.closing,
+        databaseType: queue.databaseType,
+    });
+};
+exports.createScripts = createScripts;
diff --git a/node_modules/bullmq/dist/cjs/utils/index.js b/node_modules/bullmq/dist/cjs/utils/index.js
new file mode 100644
index 0000000..54ffb32
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/utils/index.js
@@ -0,0 +1,341 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QUEUE_EVENT_SUFFIX = exports.toString = exports.errorToJSON = exports.parseObjectValues = exports.isRedisVersionLowerThan = exports.childSend = exports.asyncSend = exports.DELAY_TIME_1 = exports.DELAY_TIME_5 = exports.clientCommandMessageReg = exports.optsEncodeMap = exports.optsDecodeMap = exports.errorObject = void 0;
+exports.tryCatch = tryCatch;
+exports.lengthInUtf8Bytes = lengthInUtf8Bytes;
+exports.isEmpty = isEmpty;
+exports.array2obj = array2obj;
+exports.objectToFlatArray = objectToFlatArray;
+exports.delay = delay;
+exports.increaseMaxListeners = increaseMaxListeners;
+exports.invertObject = invertObject;
+exports.isRedisInstance = isRedisInstance;
+exports.isRedisCluster = isRedisCluster;
+exports.decreaseMaxListeners = decreaseMaxListeners;
+exports.removeAllQueueData = removeAllQueueData;
+exports.getParentKey = getParentKey;
+exports.isNotConnectionError = isNotConnectionError;
+exports.removeUndefinedFields = removeUndefinedFields;
+exports.trace = trace;
+exports.randomUUID = randomUUID;
+const crypto_1 = require("crypto");
+// eslint-disable-next-line @typescript-eslint/ban-ts-comment
+// @ts-ignore
+const utils_1 = require("ioredis/built/utils");
+const connection_closed_error_1 = require("../classes/errors/connection-closed-error");
+const semver = require("semver");
+const enums_1 = require("../enums");
+exports.errorObject = { value: null };
+function tryCatch(fn, ctx, args) {
+    try {
+        return fn.apply(ctx, args);
+    }
+    catch (e) {
+        exports.errorObject.value = e;
+        return exports.errorObject;
+    }
+}
+/**
+ * Returns the size of a string in UTF-8 bytes (handles multi-byte characters correctly).
+ * @see https://stackoverflow.com/a/23318053/1347170
+ * @param str - The string to measure.
+ * @returns The byte length of the string when encoded as UTF-8.
+ */
+function lengthInUtf8Bytes(str) {
+    return Buffer.byteLength(str, 'utf8');
+}
+function isEmpty(obj) {
+    for (const key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key)) {
+            return false;
+        }
+    }
+    return true;
+}
+function array2obj(arr) {
+    const obj = {};
+    for (let i = 0; i < arr.length; i += 2) {
+        obj[arr[i]] = arr[i + 1];
+    }
+    return obj;
+}
+function objectToFlatArray(obj) {
+    const arr = [];
+    for (const key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key) &&
+            obj[key] !== undefined) {
+            arr[arr.length] = key;
+            arr[arr.length] = obj[key];
+        }
+    }
+    return arr;
+}
+function delay(ms, abortController) {
+    return new Promise(resolve => {
+        // eslint-disable-next-line prefer-const
+        let timeout;
+        const callback = () => {
+            abortController === null || abortController === void 0 ? void 0 : abortController.signal.removeEventListener('abort', callback);
+            clearTimeout(timeout);
+            resolve();
+        };
+        timeout = setTimeout(callback, ms);
+        abortController === null || abortController === void 0 ? void 0 : abortController.signal.addEventListener('abort', callback);
+    });
+}
+function increaseMaxListeners(emitter, count) {
+    const maxListeners = emitter.getMaxListeners();
+    emitter.setMaxListeners(maxListeners + count);
+}
+function invertObject(obj) {
+    return Object.entries(obj).reduce((result, [key, value]) => {
+        result[value] = key;
+        return result;
+    }, {});
+}
+exports.optsDecodeMap = {
+    de: 'deduplication',
+    fpof: 'failParentOnFailure',
+    cpof: 'continueParentOnFailure',
+    idof: 'ignoreDependencyOnFailure',
+    kl: 'keepLogs',
+    rdof: 'removeDependencyOnFailure',
+};
+exports.optsEncodeMap = Object.assign(Object.assign({}, invertObject(exports.optsDecodeMap)), { 
+    /*/ Legacy for backwards compatibility */ debounce: 'de' });
+function isRedisInstance(obj) {
+    if (!obj) {
+        return false;
+    }
+    const redisApi = ['connect', 'disconnect', 'duplicate'];
+    return redisApi.every(name => typeof obj[name] === 'function');
+}
+function isRedisCluster(obj) {
+    return isRedisInstance(obj) && !!obj.isCluster;
+}
+function decreaseMaxListeners(emitter, count) {
+    increaseMaxListeners(emitter, -count);
+}
+async function removeAllQueueData(client, queueName, prefix = process.env.BULLMQ_TEST_PREFIX || 'bull') {
+    if (client.isCluster) {
+        // scanStream is not cluster-safe across all key slots.
+        // Applies to adapter clients and raw ioredis Cluster clients alike.
+        // @see https://github.com/luin/ioredis/issues/175
+        return false;
+    }
+    const pattern = `${prefix}:${queueName}:*`;
+    const pendingOperations = [];
+    await new Promise((resolve, reject) => {
+        const stream = client.scanStream({
+            match: pattern,
+        });
+        stream.on('data', (keys) => {
+            if (keys.length) {
+                const pipeline = client.pipeline();
+                keys.forEach(key => {
+                    pipeline.del(key);
+                });
+                const execPromise = pipeline.exec().catch(error => {
+                    reject(error);
+                    throw error;
+                });
+                pendingOperations.push(execPromise);
+            }
+        });
+        stream.on('end', () => resolve());
+        stream.on('error', error => reject(error));
+    });
+    // Wait for all pipeline operations to complete before closing the connection
+    await Promise.all(pendingOperations);
+    // Handle connection close with better error handling for Dragonfly
+    try {
+        await client.quit();
+    }
+    catch (error) {
+        if (isNotConnectionError(error)) {
+            throw error;
+        }
+    }
+}
+function getParentKey(opts) {
+    if (opts) {
+        return `${opts.queue}:${opts.id}`;
+    }
+}
+exports.clientCommandMessageReg = /ERR unknown command ['`]\s*client\s*['`]/;
+exports.DELAY_TIME_5 = 5000;
+exports.DELAY_TIME_1 = 100;
+function isNotConnectionError(error) {
+    if (error instanceof connection_closed_error_1.ConnectionClosedError) {
+        return false;
+    }
+    const { code, message: errorMessage } = error;
+    return (errorMessage !== utils_1.CONNECTION_CLOSED_ERROR_MSG &&
+        !errorMessage.includes('ECONNREFUSED') &&
+        code !== 'ECONNREFUSED');
+}
+const asyncSend = (proc, msg) => {
+    return new Promise((resolve, reject) => {
+        if (typeof proc.send === 'function') {
+            proc.send(msg, (err) => {
+                if (err) {
+                    reject(err);
+                }
+                else {
+                    resolve();
+                }
+            });
+        }
+        else if (typeof proc.postMessage === 'function') {
+            resolve(proc.postMessage(msg));
+        }
+        else {
+            resolve();
+        }
+    });
+};
+exports.asyncSend = asyncSend;
+const childSend = (proc, msg) => (0, exports.asyncSend)(proc, msg);
+exports.childSend = childSend;
+const isRedisVersionLowerThan = (currentVersion, minimumVersion, currentDatabaseType, desiredDatabaseType = 'redis') => {
+    if (currentDatabaseType === desiredDatabaseType) {
+        const version = semver.valid(semver.coerce(currentVersion));
+        return semver.lt(version, minimumVersion);
+    }
+    return false;
+};
+exports.isRedisVersionLowerThan = isRedisVersionLowerThan;
+const parseObjectValues = (obj) => {
+    const accumulator = {};
+    for (const value of Object.entries(obj)) {
+        accumulator[value[0]] = JSON.parse(value[1]);
+    }
+    return accumulator;
+};
+exports.parseObjectValues = parseObjectValues;
+const getCircularReplacer = (rootReference) => {
+    const references = new WeakSet();
+    references.add(rootReference);
+    return (_, value) => {
+        if (typeof value === 'object' && value !== null) {
+            if (references.has(value)) {
+                return '[Circular]';
+            }
+            references.add(value);
+        }
+        return value;
+    };
+};
+const errorToJSON = (value) => {
+    const error = {};
+    Object.getOwnPropertyNames(value).forEach(function (propName) {
+        error[propName] = value[propName];
+    });
+    return JSON.parse(JSON.stringify(error, getCircularReplacer(value)));
+};
+exports.errorToJSON = errorToJSON;
+const INFINITY = 1 / 0;
+const toString = (value) => {
+    if (value == null) {
+        return '';
+    }
+    // Exit early for strings to avoid a performance hit in some environments.
+    if (typeof value === 'string') {
+        return value;
+    }
+    if (Array.isArray(value)) {
+        // Recursively convert values (susceptible to call stack limits).
+        return `${value.map(other => (other == null ? other : (0, exports.toString)(other)))}`;
+    }
+    if (typeof value == 'symbol' ||
+        Object.prototype.toString.call(value) == '[object Symbol]') {
+        return value.toString();
+    }
+    const result = `${value}`;
+    return result === '0' && 1 / value === -INFINITY ? '-0' : result;
+};
+exports.toString = toString;
+exports.QUEUE_EVENT_SUFFIX = ':qe';
+function removeUndefinedFields(obj) {
+    const newObj = {};
+    for (const key in obj) {
+        if (obj[key] !== undefined) {
+            newObj[key] = obj[key];
+        }
+    }
+    return newObj;
+}
+/**
+ * Wraps the code with telemetry and provides a span for configuration.
+ *
+ * @param telemetry - telemetry configuration. If undefined, the callback will be executed without telemetry.
+ * @param spanKind - kind of the span: Producer, Consumer, Internal
+ * @param queueName - queue name
+ * @param operation - operation name (such as add, process, etc)
+ * @param destination - destination name (normally the queue name)
+ * @param callback - code to wrap with telemetry
+ * @param srcPropagationMetadata -
+ * @returns
+ */
+async function trace(telemetry, spanKind, queueName, operation, destination, callback, srcPropagationMetadata) {
+    if (!telemetry) {
+        return callback();
+    }
+    else {
+        const { tracer, contextManager } = telemetry;
+        const currentContext = contextManager.active();
+        let parentContext;
+        if (srcPropagationMetadata) {
+            parentContext = contextManager.fromMetadata(currentContext, srcPropagationMetadata);
+        }
+        const spanName = destination ? `${operation} ${destination}` : operation;
+        const span = tracer.startSpan(spanName, {
+            kind: spanKind,
+        }, parentContext);
+        try {
+            span.setAttributes({
+                [enums_1.TelemetryAttributes.QueueName]: queueName,
+                [enums_1.TelemetryAttributes.QueueOperation]: operation,
+            });
+            let messageContext;
+            let dstPropagationMetadata;
+            if (spanKind === enums_1.SpanKind.CONSUMER && parentContext) {
+                messageContext = span.setSpanOnContext(parentContext);
+            }
+            else {
+                messageContext = span.setSpanOnContext(currentContext);
+            }
+            if (callback.length == 2) {
+                dstPropagationMetadata = contextManager.getMetadata(messageContext);
+            }
+            return await contextManager.with(messageContext, () => callback(span, dstPropagationMetadata));
+        }
+        catch (err) {
+            span.recordException(err);
+            throw err;
+        }
+        finally {
+            span.end();
+        }
+    }
+}
+/**
+ * randomUUID helper to generate a UUID v4 using native crypto dependency.
+ */
+function randomUUID() {
+    if (typeof crypto_1.randomUUID === 'function') {
+        return (0, crypto_1.randomUUID)();
+    }
+    const bytes = (0, crypto_1.randomBytes)(16);
+    // Set version to 4 (bits 4-7 of the 7th byte)
+    bytes[6] = (bytes[6] & 0x0f) | 0x40;
+    // Set variant to RFC 4122 (bits 6-7 of the 9th byte)
+    bytes[8] = (bytes[8] & 0x3f) | 0x80;
+    return [
+        bytes.toString('hex', 0, 4),
+        bytes.toString('hex', 4, 6),
+        bytes.toString('hex', 6, 8),
+        bytes.toString('hex', 8, 10),
+        bytes.toString('hex', 10, 16),
+    ].join('-');
+}
diff --git a/node_modules/bullmq/dist/cjs/version.js b/node_modules/bullmq/dist/cjs/version.js
new file mode 100644
index 0000000..dc7a0e0
--- /dev/null
+++ b/node_modules/bullmq/dist/cjs/version.js
@@ -0,0 +1,4 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.version = void 0;
+exports.version = '5.77.6';
diff --git a/node_modules/bullmq/dist/esm/classes/abort-controller.d.ts b/node_modules/bullmq/dist/esm/classes/abort-controller.d.ts
new file mode 100644
index 0000000..304cc1b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/abort-controller.d.ts
@@ -0,0 +1,5 @@
+import { AbortController as AbortControllerPolyfill } from 'node-abort-controller';
+declare let AbortControllerImpl: typeof AbortControllerPolyfill;
+export declare class AbortController extends AbortControllerImpl {
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/abort-controller.js b/node_modules/bullmq/dist/esm/classes/abort-controller.js
new file mode 100644
index 0000000..b6f3340
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/abort-controller.js
@@ -0,0 +1,13 @@
+// Note: this Polyfill is only needed for Node versions < 15.4.0
+import { AbortController as AbortControllerPolyfill } from 'node-abort-controller';
+let AbortControllerImpl;
+// prefer native AbortController implementation if found
+if (globalThis.AbortController) {
+    AbortControllerImpl =
+        globalThis.AbortController;
+}
+else {
+    AbortControllerImpl = AbortControllerPolyfill;
+}
+export class AbortController extends AbortControllerImpl {
+}
diff --git a/node_modules/bullmq/dist/esm/classes/async-fifo-queue.d.ts b/node_modules/bullmq/dist/esm/classes/async-fifo-queue.d.ts
new file mode 100644
index 0000000..d7bd091
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/async-fifo-queue.d.ts
@@ -0,0 +1,80 @@
+/**
+ * (c) 2017-2025 BullForce Labs AB, MIT Licensed.
+ * @see LICENSE.md
+ *
+ */
+/**
+ * AsyncFifoQueue
+ *
+ * A minimal FIFO queue for asynchronous operations. Allows adding asynchronous operations
+ * and consume them in the order they are resolved.
+ */
+export declare class AsyncFifoQueue<T> {
+    private ignoreErrors;
+    /**
+     * A queue of completed promises. As the pending
+     * promises are resolved, they are added to this queue.
+     */
+    private queue;
+    /**
+     * A set of pending promises.
+     */
+    private pending;
+    /**
+     * The next promise to be resolved. As soon as a pending promise
+     * is resolved, this promise is resolved with the result of the
+     * pending promise.
+     */
+    private nextPromise;
+    private resolve;
+    private reject;
+    constructor(ignoreErrors?: boolean);
+    /**
+     * Adds a promise to the queue. When it resolves, its value is enqueued
+     * and, if a consumer is waiting via {@link fetch}, the next pending
+     * promise is resolved with the value.
+     *
+     * @param promise - The asynchronous operation to add to the queue.
+     */
+    add(promise: Promise<T>): void;
+    /**
+     * Waits for all currently pending promises to settle.
+     *
+     * @returns A promise that resolves once every in-flight promise has resolved.
+     */
+    waitAll(): Promise<void>;
+    /**
+     * Returns the total number of items currently tracked by the queue,
+     * including both pending (in-flight) promises and resolved items that
+     * have not yet been fetched.
+     *
+     * @returns The sum of pending and queued items.
+     */
+    numTotal(): number;
+    /**
+     * Returns the number of promises that are still pending (in-flight).
+     *
+     * @returns The number of unresolved promises currently in the queue.
+     */
+    numPending(): number;
+    /**
+     * Returns the number of items that have already resolved but have not
+     * yet been fetched by a consumer.
+     *
+     * @returns The number of resolved items waiting to be consumed.
+     */
+    numQueued(): number;
+    private resolvePromise;
+    private rejectPromise;
+    private newPromise;
+    private wait;
+    /**
+     * Fetches the next resolved item from the queue in FIFO order. If no
+     * items are currently resolved but pending promises exist, it waits
+     * until the next one resolves.
+     *
+     * @returns The next resolved value, or `undefined` if there are no
+     * pending or queued items.
+     */
+    fetch(): Promise<T | void>;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/async-fifo-queue.js b/node_modules/bullmq/dist/esm/classes/async-fifo-queue.js
new file mode 100644
index 0000000..fda5aa3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/async-fifo-queue.js
@@ -0,0 +1,167 @@
+/**
+ * (c) 2017-2025 BullForce Labs AB, MIT Licensed.
+ * @see LICENSE.md
+ *
+ */
+class Node {
+    constructor(value) {
+        this.value = undefined;
+        this.next = null;
+        this.value = value;
+    }
+}
+class LinkedList {
+    constructor() {
+        this.length = 0;
+        this.head = null;
+        this.tail = null;
+    }
+    push(value) {
+        const newNode = new Node(value);
+        if (!this.length) {
+            this.head = newNode;
+        }
+        else {
+            this.tail.next = newNode;
+        }
+        this.tail = newNode;
+        this.length += 1;
+        return newNode;
+    }
+    shift() {
+        if (!this.length) {
+            return null;
+        }
+        else {
+            const head = this.head;
+            this.head = this.head.next;
+            this.length -= 1;
+            return head;
+        }
+    }
+}
+/**
+ * AsyncFifoQueue
+ *
+ * A minimal FIFO queue for asynchronous operations. Allows adding asynchronous operations
+ * and consume them in the order they are resolved.
+ */
+export class AsyncFifoQueue {
+    constructor(ignoreErrors = false) {
+        this.ignoreErrors = ignoreErrors;
+        /**
+         * A queue of completed promises. As the pending
+         * promises are resolved, they are added to this queue.
+         */
+        this.queue = new LinkedList();
+        /**
+         * A set of pending promises.
+         */
+        this.pending = new Set();
+        this.newPromise();
+    }
+    /**
+     * Adds a promise to the queue. When it resolves, its value is enqueued
+     * and, if a consumer is waiting via {@link fetch}, the next pending
+     * promise is resolved with the value.
+     *
+     * @param promise - The asynchronous operation to add to the queue.
+     */
+    add(promise) {
+        this.pending.add(promise);
+        promise
+            .then(data => {
+            this.pending.delete(promise);
+            if (this.queue.length === 0) {
+                this.resolvePromise(data);
+            }
+            this.queue.push(data);
+        })
+            .catch(err => {
+            // Ignore errors
+            if (this.ignoreErrors) {
+                this.queue.push(undefined);
+            }
+            this.pending.delete(promise);
+            this.rejectPromise(err);
+        });
+    }
+    /**
+     * Waits for all currently pending promises to settle.
+     *
+     * @returns A promise that resolves once every in-flight promise has resolved.
+     */
+    async waitAll() {
+        await Promise.all(this.pending);
+    }
+    /**
+     * Returns the total number of items currently tracked by the queue,
+     * including both pending (in-flight) promises and resolved items that
+     * have not yet been fetched.
+     *
+     * @returns The sum of pending and queued items.
+     */
+    numTotal() {
+        return this.pending.size + this.queue.length;
+    }
+    /**
+     * Returns the number of promises that are still pending (in-flight).
+     *
+     * @returns The number of unresolved promises currently in the queue.
+     */
+    numPending() {
+        return this.pending.size;
+    }
+    /**
+     * Returns the number of items that have already resolved but have not
+     * yet been fetched by a consumer.
+     *
+     * @returns The number of resolved items waiting to be consumed.
+     */
+    numQueued() {
+        return this.queue.length;
+    }
+    resolvePromise(data) {
+        this.resolve(data);
+        this.newPromise();
+    }
+    rejectPromise(err) {
+        this.reject(err);
+        this.newPromise();
+    }
+    newPromise() {
+        this.nextPromise = new Promise((resolve, reject) => {
+            this.resolve = resolve;
+            this.reject = reject;
+        });
+    }
+    async wait() {
+        return this.nextPromise;
+    }
+    /**
+     * Fetches the next resolved item from the queue in FIFO order. If no
+     * items are currently resolved but pending promises exist, it waits
+     * until the next one resolves.
+     *
+     * @returns The next resolved value, or `undefined` if there are no
+     * pending or queued items.
+     */
+    async fetch() {
+        var _a;
+        if (this.pending.size === 0 && this.queue.length === 0) {
+            return;
+        }
+        while (this.queue.length === 0) {
+            try {
+                await this.wait();
+            }
+            catch (err) {
+                // Ignore errors
+                if (!this.ignoreErrors) {
+                    console.error('Unexpected Error in AsyncFifoQueue', err);
+                }
+            }
+        }
+        return (_a = this.queue.shift()) === null || _a === void 0 ? void 0 : _a.value;
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/backoffs.d.ts b/node_modules/bullmq/dist/esm/classes/backoffs.d.ts
new file mode 100644
index 0000000..5ba3d5f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/backoffs.d.ts
@@ -0,0 +1,11 @@
+import { BackoffOptions } from '../interfaces/backoff-options';
+import { MinimalJob } from '../interfaces/minimal-job';
+import { BackoffStrategy } from '../types/backoff-strategy';
+export interface BuiltInStrategies {
+    [index: string]: (delay: number, jitter?: number) => BackoffStrategy;
+}
+export declare class Backoffs {
+    static builtinStrategies: BuiltInStrategies;
+    static normalize(backoff: number | BackoffOptions): BackoffOptions | undefined;
+    static calculate(backoff: BackoffOptions, attemptsMade: number, err: Error, job: MinimalJob, customStrategy?: BackoffStrategy): Promise<number> | number | undefined;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/backoffs.js b/node_modules/bullmq/dist/esm/classes/backoffs.js
new file mode 100644
index 0000000..dbd2138
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/backoffs.js
@@ -0,0 +1,56 @@
+export class Backoffs {
+    static normalize(backoff) {
+        if (Number.isFinite(backoff)) {
+            return {
+                type: 'fixed',
+                delay: backoff,
+            };
+        }
+        else if (backoff) {
+            return backoff;
+        }
+    }
+    static calculate(backoff, attemptsMade, err, job, customStrategy) {
+        if (backoff) {
+            const strategy = lookupStrategy(backoff, customStrategy);
+            return strategy(attemptsMade, backoff.type, err, job);
+        }
+    }
+}
+Backoffs.builtinStrategies = {
+    fixed: function (delay, jitter = 0) {
+        return function () {
+            if (jitter > 0) {
+                const minDelay = delay * (1 - jitter);
+                return Math.floor(Math.random() * delay * jitter + minDelay);
+            }
+            else {
+                return delay;
+            }
+        };
+    },
+    exponential: function (delay, jitter = 0) {
+        return function (attemptsMade) {
+            if (jitter > 0) {
+                const maxDelay = Math.round(Math.pow(2, attemptsMade - 1) * delay);
+                const minDelay = maxDelay * (1 - jitter);
+                return Math.floor(Math.random() * maxDelay * jitter + minDelay);
+            }
+            else {
+                return Math.round(Math.pow(2, attemptsMade - 1) * delay);
+            }
+        };
+    },
+};
+function lookupStrategy(backoff, customStrategy) {
+    if (backoff.type in Backoffs.builtinStrategies) {
+        return Backoffs.builtinStrategies[backoff.type](backoff.delay, backoff.jitter);
+    }
+    else if (customStrategy) {
+        return customStrategy;
+    }
+    else {
+        throw new Error(`Unknown backoff strategy ${backoff.type}.
+      If a custom backoff strategy is used, specify it when the queue is created.`);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/bun-redis-client.d.ts b/node_modules/bullmq/dist/esm/classes/bun-redis-client.d.ts
new file mode 100644
index 0000000..d69a0bf
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/bun-redis-client.d.ts
@@ -0,0 +1,18 @@
+import { IRedisClient } from '../interfaces/redis-client';
+export type RedisCommandArgument = string | Buffer;
+export interface BunRedisRawClient {
+    connected: boolean;
+    url?: string;
+    onconnect?: () => void;
+    onclose?: (error?: Error) => void;
+    onerror?: (error?: Error) => void;
+    connect(): Promise<void>;
+    close(): void;
+    send<T = any>(command: string, args: RedisCommandArgument[]): Promise<T>;
+    get(key: string): Promise<string | null | undefined>;
+    smembers(key: string): Promise<unknown[] | null | undefined>;
+    incr(key: string): Promise<number>;
+}
+export declare function createBunRedisClient<TClient extends BunRedisRawClient>(client: TClient, opts?: {
+    lazyConnect?: boolean;
+}): IRedisClient;
diff --git a/node_modules/bullmq/dist/esm/classes/bun-redis-client.js b/node_modules/bullmq/dist/esm/classes/bun-redis-client.js
new file mode 100644
index 0000000..a6245f8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/bun-redis-client.js
@@ -0,0 +1,1013 @@
+import { createHash } from 'crypto';
+import { EventEmitter } from 'events';
+import { Readable } from 'stream';
+import { ConnectionClosedError } from './errors/connection-closed-error';
+function normalizeScriptArgs(args) {
+    return args.length === 1 && Array.isArray(args[0]) ? args[0] : args;
+}
+/**
+ * Returns true when the error is one that Bun's Redis client throws because
+ * the underlying TCP connection has been closed or is in the process of being
+ * closed (either intentionally via disconnect()/quit() or unexpectedly).
+ */
+function isBunConnectionClosedError(err) {
+    var _a;
+    const msg = (_a = err === null || err === void 0 ? void 0 : err.message) !== null && _a !== void 0 ? _a : '';
+    return (msg === 'Socket closed unexpectedly' ||
+        msg.startsWith('Connection closed') ||
+        msg === 'Connection is closed.' ||
+        msg === 'Connection has failed');
+}
+function normalizeStringCollection(reply) {
+    if (reply == null) {
+        return [];
+    }
+    if (Array.isArray(reply)) {
+        return reply.map(String);
+    }
+    if (reply instanceof Set) {
+        return Array.from(reply, item => String(item));
+    }
+    return [];
+}
+export function createBunRedisClient(client, opts) {
+    return new BunRedisAdapter(client, opts);
+}
+/**
+ * Full wrapper for Bun's RedisClient.
+ *
+ * Key design decisions vs node-redis adapter:
+ * 1. No error noise on close: Bun's close() cleanly terminates pending
+ *    commands without throwing DisconnectsClientError.
+ * 2. EventEmitter bridging: Bun uses `onconnect`/`onclose` callbacks;
+ *    we bridge those into standard EventEmitter events.
+ * 3. Raw command execution: Bun's `send()` is the universal escape hatch
+ *    for commands without convenience methods.
+ */
+class BunRedisAdapter extends EventEmitter {
+    get status() {
+        if (this.statusOverride) {
+            return this.statusOverride;
+        }
+        if (this.closed) {
+            return 'end';
+        }
+        if (this.raw.connected) {
+            return 'ready';
+        }
+        return this.hasConnected ? 'end' : 'wait';
+    }
+    set status(val) {
+        if (val === 'end') {
+            this.closing = true;
+            this.closed = true;
+            // Do not call raw.close() here – disconnect()/quit() handle closing.
+        }
+        this.statusOverride = val;
+    }
+    get options() {
+        return {};
+    }
+    set options(_val) {
+        // no-op
+    }
+    constructor(raw, opts) {
+        super();
+        this.raw = raw;
+        this.scripts = new Map();
+        // Tracks which script SHAs have been loaded server-side on the current
+        // raw connection. Cleared on (re)connect since SCRIPT cache is per-server
+        // and is also lost across our internal raw-client swap.
+        this.loadedScriptShas = new Set();
+        this.hasConnected = false;
+        this.closed = false;
+        this.closing = false;
+        // Auto-reconnect state
+        this.reconnecting = false;
+        this.reconnectTimer = null;
+        this.reconnectAttempts = 0;
+        this.maxReconnectDelay = 20000; // cap at 20s (matches ioredis default)
+        this.isCluster = false;
+        this._setupCallbacks();
+        // ioredis auto-connects by default. Mimic that behavior unless
+        // lazyConnect is set.
+        if (!(opts === null || opts === void 0 ? void 0 : opts.lazyConnect)) {
+            this.connect().catch(() => {
+                // Connection errors will be emitted via the 'error' event.
+            });
+        }
+    }
+    /**
+     * Wire up Bun's callback-style events into EventEmitter and auto-reconnect.
+     */
+    _setupCallbacks() {
+        // Bridge Bun's callback-style events into EventEmitter.
+        // When connectionName is set (via duplicate()), delay the 'ready'
+        // event until CLIENT SETNAME completes so callers waiting for 'ready'
+        // see the name already applied.
+        this.raw.onconnect = () => {
+            this.hasConnected = true;
+            this.closed = false;
+            this.closing = false;
+            this.reconnecting = false;
+            this.reconnectAttempts = 0;
+            this.statusOverride = undefined;
+            // The server-side SCRIPT cache is gone for this (possibly new) raw
+            // connection. Force re-loading on next use.
+            this.loadedScriptShas.clear();
+            if (this.connectionName) {
+                this.clientSetName(this.connectionName).then(() => this.emit('ready'), () => this.emit('ready'));
+            }
+            else {
+                this.emit('ready');
+            }
+        };
+        this.raw.onclose = (error) => {
+            if (this.closing) {
+                // User-initiated close – no reconnect
+                this.closed = true;
+                this.emit('close');
+                this.emit('end');
+                return;
+            }
+            // Unexpected close – attempt auto-reconnect
+            this.closed = true;
+            this.emit('close');
+            if (error) {
+                this.emit('error', error);
+            }
+            this._scheduleReconnect();
+        };
+    }
+    /**
+     * Schedule a reconnection attempt with exponential backoff.
+     */
+    _scheduleReconnect() {
+        if (this.closing || this.reconnecting) {
+            return;
+        }
+        this.reconnecting = true;
+        this.reconnectAttempts++;
+        // Exponential backoff: min(e^attempts, 20000) ms, floored at 1000ms
+        const delay = Math.max(Math.min(Math.exp(this.reconnectAttempts) * 100, this.maxReconnectDelay), 1000);
+        this.reconnectTimer = setTimeout(async () => {
+            this.reconnectTimer = null;
+            if (this.closing) {
+                this.reconnecting = false;
+                return;
+            }
+            try {
+                // Create a fresh raw client with the same URL
+                const BunRedisClient = this.raw
+                    .constructor;
+                const newRaw = new BunRedisClient(this.raw.url);
+                // Swap the raw client reference
+                this.raw = newRaw;
+                this.closed = false;
+                this.connecting = undefined;
+                // Re-wire callbacks on the new raw client
+                this._setupCallbacks();
+                // Connect – onconnect callback will emit 'ready' and reset state
+                await newRaw.connect();
+            }
+            catch (_err) {
+                // Reconnect failed – schedule another attempt
+                this.reconnecting = false;
+                if (!this.closing) {
+                    this._scheduleReconnect();
+                }
+            }
+        }, delay);
+    }
+    // ---------------------------------------------------------------
+    // Connection lifecycle
+    // ---------------------------------------------------------------
+    async connect() {
+        if (this.raw.connected) {
+            this.hasConnected = true;
+            this.closed = false;
+            this.closing = false;
+            this.statusOverride = undefined;
+            return;
+        }
+        if (!this.connecting) {
+            this.closed = false;
+            this.closing = false;
+            this.statusOverride = undefined;
+            // If the raw client was previously closed, Bun doesn't support
+            // reconnecting on the same instance. Create a fresh raw client.
+            if (this.hasConnected && !this.raw.connected) {
+                const BunRedisClient = this.raw
+                    .constructor;
+                this.raw = new BunRedisClient(this.raw.url);
+                this._setupCallbacks();
+            }
+            this.connecting = this.raw
+                .connect()
+                .then(() => {
+                this.hasConnected = true;
+                this.closed = false;
+                this.closing = false;
+                this.statusOverride = undefined;
+            })
+                .finally(() => {
+                this.connecting = undefined;
+            });
+        }
+        await this.connecting;
+    }
+    _closeRaw() {
+        // Cancel any pending reconnect
+        if (this.reconnectTimer) {
+            clearTimeout(this.reconnectTimer);
+            this.reconnectTimer = null;
+        }
+        this.reconnecting = false;
+        const raw = this.raw;
+        raw.onconnect = () => { };
+        raw.onclose = () => { };
+        raw.onerror = () => { };
+        if (raw.connected) {
+            // Defer close so that Bun's native error is raised outside the
+            // calling test's synchronous scope, preventing it from being
+            // attributed to the test as an unhandled error.
+            setImmediate(() => {
+                try {
+                    if (raw.connected) {
+                        raw.close();
+                    }
+                }
+                catch (_err) {
+                    // swallow
+                }
+            });
+        }
+    }
+    disconnect(reconnect) {
+        if (this.closed && !reconnect) {
+            return;
+        }
+        if (reconnect) {
+            // Close the current raw connection and schedule a reconnect.
+            // Don't set closing=true so the reconnect logic is allowed to fire.
+            this.closed = true;
+            this.statusOverride = undefined;
+            const raw = this.raw;
+            raw.onclose = () => { };
+            if (raw.connected) {
+                setImmediate(() => {
+                    try {
+                        if (raw.connected) {
+                            raw.close();
+                        }
+                    }
+                    catch (_err) {
+                        // swallow
+                    }
+                });
+            }
+            this.emit('close');
+            this._scheduleReconnect();
+        }
+        else {
+            this.closing = true;
+            this.closed = true;
+            this.statusOverride = 'end';
+            this._closeRaw();
+            this.emit('close');
+            this.emit('end');
+        }
+    }
+    async quit() {
+        if (this.closed) {
+            setImmediate(() => {
+                this.emit('end');
+                this.emit('close');
+            });
+            return 'OK';
+        }
+        this.closing = true;
+        this.closed = true;
+        this.statusOverride = 'end';
+        this._closeRaw();
+        // Emit on next tick so callers can register listeners after await quit()
+        setImmediate(() => {
+            this.emit('end');
+            this.emit('close');
+        });
+        return 'OK';
+    }
+    duplicate(...args) {
+        // Bun's duplicate() is async, but IRedisClient.duplicate() is sync.
+        // We create a new RedisClient with the same URL/options instead.
+        // The raw client constructor in Bun doesn't connect until connect() or
+        // first command, so this is safe.
+        const BunRedisClient = this.raw
+            .constructor;
+        const dup = new BunRedisClient(this.raw.url);
+        const adapter = new BunRedisAdapter(dup);
+        // Copy registered scripts to the duplicate
+        for (const [name, script] of this.scripts) {
+            adapter.scripts.set(name, script);
+            adapter[name] = (...a) => adapter.runCommand(name, a);
+        }
+        // Handle connectionName option (ioredis calls CLIENT SETNAME automatically).
+        // Setting connectionName ensures the onconnect handler applies CLIENT
+        // SETNAME before emitting 'ready'.
+        const opts = args[0];
+        if (opts && typeof opts === 'object' && opts.connectionName) {
+            adapter.connectionName = opts.connectionName;
+        }
+        return adapter;
+    }
+    // ---------------------------------------------------------------
+    // Lua script engine
+    // ---------------------------------------------------------------
+    defineCommand(name, definition) {
+        const sha = createHash('sha1').update(definition.lua).digest('hex');
+        this.scripts.set(name, {
+            sha,
+            lua: definition.lua,
+            numberOfKeys: definition.numberOfKeys,
+        });
+        this[name] = (...args) => this.runCommand(name, args);
+        // Note: We intentionally skip SCRIPT LOAD here. The first EVALSHA call
+        // will get a NOSCRIPT error and fall back to EVAL, which also loads the
+        // script for subsequent calls. This avoids fire-and-forget sendCommand
+        // calls that can trigger spurious unhandled rejection reports in Bun.
+    }
+    async runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}"`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const keys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Build EVALSHA args: sha numkeys key... arg...
+        const evalArgs = [sha, String(keys.length), ...keys, ...argv];
+        const execute = async () => {
+            var _a, _b;
+            try {
+                const result = await this.sendCommand('EVALSHA', evalArgs);
+                this.loadedScriptShas.add(sha);
+                return result;
+            }
+            catch (err) {
+                if ((_b = (_a = err === null || err === void 0 ? void 0 : err.message) === null || _a === void 0 ? void 0 : _a.includes) === null || _b === void 0 ? void 0 : _b.call(_a, 'NOSCRIPT')) {
+                    const evalLuaArgs = [lua, String(keys.length), ...keys, ...argv];
+                    const result = await this.sendCommand('EVAL', evalLuaArgs);
+                    this.loadedScriptShas.add(sha);
+                    return result;
+                }
+                throw err;
+            }
+        };
+        return execute();
+    }
+    /**
+     * Ensure the given scripts are present in the server-side SCRIPT cache so
+     * that subsequent EVALSHA calls (e.g. inside a MULTI/EXEC) won't fail with
+     * NOSCRIPT. Each script is SCRIPT LOAD'd at most once per connection.
+     */
+    async ensureScriptsLoaded(scripts) {
+        const toLoad = [];
+        const seen = new Set();
+        for (const s of scripts) {
+            if (this.loadedScriptShas.has(s.sha) || seen.has(s.sha)) {
+                continue;
+            }
+            seen.add(s.sha);
+            toLoad.push(s);
+        }
+        if (toLoad.length === 0) {
+            return;
+        }
+        await Promise.all(toLoad.map(async (s) => {
+            await this.sendCommand('SCRIPT', ['LOAD', s.lua]);
+            this.loadedScriptShas.add(s.sha);
+        }));
+    }
+    sendCommand(command, args) {
+        // If the connection is already closing/closed, return a rejected promise.
+        if (this.closing || this.closed) {
+            return Promise.reject(new ConnectionClosedError('Connection is closed'));
+        }
+        // Send directly to the underlying Bun client. Redis protocol guarantees
+        // responses arrive in the same order as requests on a single connection,
+        // so concurrent send() calls are safe and enable implicit pipelining
+        // (multiple commands written to the socket before any response is read).
+        // MULTI/EXEC transactions don't go through this path — they are issued
+        // as a synchronous burst of raw `send()` calls in
+        // `BunRedisTransaction.exec()`, which guarantees the MULTI…EXEC frames
+        // are written contiguously without any other command interleaving.
+        return this.raw.send(command, args).catch((err) => {
+            if (isBunConnectionClosedError(err)) {
+                return Promise.reject(new ConnectionClosedError(this.closing || this.closed ? 'Connection is closed' : err.message, err));
+            }
+            throw err;
+        });
+    }
+    // ---------------------------------------------------------------
+    // Pipeline / Transaction
+    // ---------------------------------------------------------------
+    multi() {
+        return new BunRedisTransaction(this.raw, this.scripts, true, this);
+    }
+    pipeline() {
+        return new BunRedisTransaction(this.raw, this.scripts, false, this);
+    }
+    // ---------------------------------------------------------------
+    // Hash commands
+    // ---------------------------------------------------------------
+    async hgetall(key) {
+        const result = await this.sendCommand('HGETALL', [key]);
+        if (!result || (Array.isArray(result) && result.length === 0)) {
+            return {};
+        }
+        // RESP3 returns a map, RESP2 returns flat array [field, value, ...]
+        if (Array.isArray(result)) {
+            const obj = {};
+            for (let i = 0; i < result.length; i += 2) {
+                obj[String(result[i])] = String(result[i + 1]);
+            }
+            return obj;
+        }
+        // If it's already an object (RESP3 map)
+        return result;
+    }
+    async hget(key, field) {
+        const result = await this.sendCommand('HGET', [key, field]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async hmget(key, ...fields) {
+        const result = await this.sendCommand('HMGET', [key, ...fields]);
+        return (result || []).map((v) => v !== null && v !== void 0 ? v : null);
+    }
+    async hset(key, dataOrField, ...rest) {
+        let args;
+        if (typeof dataOrField === 'object') {
+            args = [key];
+            for (const [k, v] of Object.entries(dataOrField)) {
+                args.push(k, String(v));
+            }
+        }
+        else {
+            args = [key, dataOrField, String(rest[0])];
+            for (let i = 1; i < rest.length; i += 2) {
+                args.push(String(rest[i]), String(rest[i + 1]));
+            }
+        }
+        return await this.sendCommand('HSET', args);
+    }
+    async hdel(key, ...fields) {
+        return await this.sendCommand('HDEL', [key, ...fields]);
+    }
+    async hexists(key, field) {
+        const result = await this.sendCommand('HEXISTS', [key, field]);
+        // Bun returns boolean for some commands; normalize to 0/1
+        return result === true || result === 1 ? 1 : 0;
+    }
+    // ---------------------------------------------------------------
+    // String commands
+    // ---------------------------------------------------------------
+    async get(key) {
+        const result = await this.sendCommand('GET', [key]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async set(key, value, options) {
+        const args = [key, String(value)];
+        if ((options === null || options === void 0 ? void 0 : options.PX) != null) {
+            args.push('PX', String(options.PX));
+        }
+        else if ((options === null || options === void 0 ? void 0 : options.EX) != null) {
+            args.push('EX', String(options.EX));
+        }
+        return await this.sendCommand('SET', args);
+    }
+    async del(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.sendCommand('DEL', keys);
+    }
+    // ---------------------------------------------------------------
+    // Sorted set commands
+    // ---------------------------------------------------------------
+    async zrange(key, start, end, options) {
+        const args = [key, String(start), String(end)];
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            args.push('WITHSCORES');
+        }
+        const result = await this.sendCommand('ZRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Bun returns WITHSCORES as [[member, score], ...] instead of flat [member, score, ...]
+        if ((options === null || options === void 0 ? void 0 : options.WITHSCORES) && result.length > 0 && Array.isArray(result[0])) {
+            return result.flatMap((pair) => [String(pair[0]), String(pair[1])]);
+        }
+        return result.map(String);
+    }
+    async zrevrange(key, start, end, options) {
+        const args = [key, String(start), String(end)];
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            args.push('WITHSCORES');
+        }
+        // ZREVRANGE is deprecated; use ZRANGE REV
+        args.push('REV');
+        const result = await this.sendCommand('ZRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Bun returns WITHSCORES as [[member, score], ...] instead of flat [member, score, ...]
+        if ((options === null || options === void 0 ? void 0 : options.WITHSCORES) && result.length > 0 && Array.isArray(result[0])) {
+            return result.flatMap((pair) => [String(pair[0]), String(pair[1])]);
+        }
+        return result.map(String);
+    }
+    async zcard(key) {
+        return await this.sendCommand('ZCARD', [key]);
+    }
+    async zscore(key, member) {
+        const score = await this.sendCommand('ZSCORE', [key, member]);
+        return score != null ? String(score) : null;
+    }
+    // ---------------------------------------------------------------
+    // List commands
+    // ---------------------------------------------------------------
+    async lrange(key, start, end) {
+        const result = await this.sendCommand('LRANGE', [
+            key,
+            String(start),
+            String(end),
+        ]);
+        return (result || []).map(String);
+    }
+    async llen(key) {
+        return await this.sendCommand('LLEN', [key]);
+    }
+    async ltrim(key, start, end) {
+        await this.sendCommand('LTRIM', [key, String(start), String(end)]);
+        return 'OK';
+    }
+    async lpos(key, value) {
+        const result = await this.sendCommand('LPOS', [key, value]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    // ---------------------------------------------------------------
+    // Set commands
+    // ---------------------------------------------------------------
+    async smembers(key) {
+        const result = await this.sendCommand('SMEMBERS', [key]);
+        return normalizeStringCollection(result);
+    }
+    // ---------------------------------------------------------------
+    // Stream commands
+    // ---------------------------------------------------------------
+    async xadd(key, id, fields, options) {
+        const args = [key];
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            args.push('MAXLEN');
+            if (options.approximate !== false) {
+                args.push('~');
+            }
+            args.push(String(options.MAXLEN));
+        }
+        args.push(id);
+        for (const [k, v] of Object.entries(fields)) {
+            args.push(k, String(v));
+        }
+        return await this.raw.send('XADD', args);
+    }
+    async xread(streams, options) {
+        const args = [];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            args.push('BLOCK', String(options.BLOCK));
+        }
+        args.push('STREAMS');
+        for (const s of streams) {
+            args.push(s.key);
+        }
+        for (const s of streams) {
+            args.push(s.id);
+        }
+        let result;
+        try {
+            result = await this.sendCommand('XREAD', args);
+        }
+        catch (err) {
+            if (this.closing) {
+                return null;
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        // Normalize to ioredis format: [[streamName, [[id, [field, value, …]], …]], …]
+        // Bun returns a map/object: { streamName: [[id, [field, value, ...]], ...], ... }
+        if (Array.isArray(result)) {
+            // RESP2 nested array format
+            return result.map((stream) => {
+                const streamName = String(stream[0]);
+                const entries = (stream[1] || []).map((entry) => {
+                    const entryId = String(entry[0]);
+                    const fields = (entry[1] || []).map(String);
+                    return [entryId, fields];
+                });
+                return [streamName, entries];
+            });
+        }
+        // Bun returns an object keyed by stream name
+        return Object.entries(result).map(([streamName, rawEntries]) => {
+            const entries = (rawEntries || []).map((entry) => {
+                const entryId = String(entry[0]);
+                const fields = (entry[1] || []).map(String);
+                return [entryId, fields];
+            });
+            return [streamName, entries];
+        });
+    }
+    async xtrim(key, strategy, threshold, options) {
+        const args = [key, strategy];
+        if ((options === null || options === void 0 ? void 0 : options.approximate) !== false) {
+            args.push('~');
+        }
+        args.push(String(threshold));
+        return await this.sendCommand('XTRIM', args);
+    }
+    // ---------------------------------------------------------------
+    // Blocking commands
+    // ---------------------------------------------------------------
+    async bzpopmin(key, timeout) {
+        let result;
+        try {
+            result = await this.sendCommand('BZPOPMIN', [key, String(timeout)]);
+        }
+        catch (err) {
+            if (this.closing) {
+                return null;
+            }
+            throw err;
+        }
+        if (!result || result.length === 0) {
+            return null;
+        }
+        return [String(result[0]), String(result[1]), String(result[2])];
+    }
+    // ---------------------------------------------------------------
+    // Server / admin commands
+    // ---------------------------------------------------------------
+    async info() {
+        return await this.sendCommand('INFO', []);
+    }
+    async clientSetName(name) {
+        return await this.sendCommand('CLIENT', ['SETNAME', name]);
+    }
+    async clientList() {
+        return await this.sendCommand('CLIENT', ['LIST']);
+    }
+    // ---------------------------------------------------------------
+    // Key scanning
+    // ---------------------------------------------------------------
+    async scan(cursor, options) {
+        const args = [String(cursor)];
+        if (options === null || options === void 0 ? void 0 : options.MATCH) {
+            args.push('MATCH', options.MATCH);
+        }
+        if (options === null || options === void 0 ? void 0 : options.COUNT) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        const result = await this.sendCommand('SCAN', args);
+        // SCAN returns [cursor, [key, key, ...]]
+        const keys = result[1];
+        return [String(result[0]), Array.isArray(keys) ? keys.map(String) : []];
+    }
+    scanStream(options) {
+        const adapter = this;
+        let cursor = '0';
+        let started = false;
+        const readable = new Readable({
+            objectMode: true,
+            async read() {
+                if (started && cursor === '0') {
+                    readable.push(null); // EOF
+                    return;
+                }
+                started = true;
+                try {
+                    // Loop until we have keys to push or reach end of scan
+                    while (true) {
+                        const [nextCursor, keys] = await adapter.scan(cursor, {
+                            MATCH: options.match,
+                            COUNT: options.count,
+                        });
+                        cursor = nextCursor;
+                        if (keys.length > 0) {
+                            readable.push(keys);
+                            if (cursor === '0') {
+                                readable.push(null); // EOF
+                            }
+                            return;
+                        }
+                        if (cursor === '0') {
+                            readable.push(null); // EOF
+                            return;
+                        }
+                        // No keys but scan not complete — continue scanning
+                    }
+                }
+                catch (err) {
+                    readable.destroy(err);
+                }
+            },
+        });
+        return readable;
+    }
+    // ---------------------------------------------------------------
+    // Extra Redis commands used by BullMQ internals
+    // ---------------------------------------------------------------
+    async keys(pattern) {
+        const result = await this.sendCommand('KEYS', [pattern]);
+        return (result || []).map(String);
+    }
+    async exists(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        const result = await this.sendCommand('EXISTS', keys);
+        // Bun may return boolean for single key
+        if (typeof result === 'boolean') {
+            return result ? 1 : 0;
+        }
+        return result;
+    }
+    async zadd(key, ...args) {
+        // ioredis format: zadd(key, score, member, score, member, ...)
+        const cmdArgs = [key];
+        for (let i = 0; i < args.length; i += 2) {
+            cmdArgs.push(String(args[i]), String(args[i + 1]));
+        }
+        return await this.sendCommand('ZADD', cmdArgs);
+    }
+    async zrem(key, ...members) {
+        return await this.sendCommand('ZREM', [key, ...members]);
+    }
+    async xlen(key) {
+        return await this.sendCommand('XLEN', [key]);
+    }
+    async xrevrange(key, end, start, ...rest) {
+        const args = [key, end, start];
+        if (rest[0] === 'COUNT') {
+            args.push('COUNT', String(rest[1]));
+        }
+        const result = await this.sendCommand('XREVRANGE', args);
+        if (!result) {
+            return [];
+        }
+        // Normalize to ioredis format: [[id, [field, value, …]], …]
+        return result.map((msg) => [
+            String(msg[0]),
+            (msg[1] || []).map(String),
+        ]);
+    }
+    async sadd(key, ...members) {
+        return await this.sendCommand('SADD', [key, ...members.map(String)]);
+    }
+    async scard(key) {
+        return await this.sendCommand('SCARD', [key]);
+    }
+    async lpush(key, ...values) {
+        return await this.sendCommand('LPUSH', [key, ...values]);
+    }
+    async rpop(key) {
+        const result = await this.sendCommand('RPOP', [key]);
+        return result !== null && result !== void 0 ? result : null;
+    }
+    async incr(key) {
+        return await this.sendCommand('INCR', [key]);
+    }
+    async incrby(key, increment) {
+        return await this.sendCommand('INCRBY', [key, String(increment)]);
+    }
+    async flushall() {
+        return await this.sendCommand('FLUSHALL', []);
+    }
+}
+// ---------------------------------------------------------------------------
+// Transaction / Pipeline wrapper
+//
+// Bun doesn't have a native MULTI object. We buffer commands and execute
+// them within a MULTI/EXEC block using send().
+// ---------------------------------------------------------------------------
+class BunRedisTransaction {
+    constructor(raw, scripts, transactional, adapter) {
+        this.raw = raw;
+        this.scripts = scripts;
+        this.transactional = transactional;
+        this.adapter = adapter;
+        this.commands = [];
+        this.transformers = [];
+        // Scripts that need to be SCRIPT LOAD'd before exec() so the EVALSHA
+        // calls queued in this transaction won't NOSCRIPT.
+        this.scriptsToLoad = [];
+    }
+    addCommand(cmd, args, transformer) {
+        this.commands.push({ cmd, args });
+        this.transformers.push(transformer || ((v) => v));
+    }
+    hgetall(key) {
+        this.addCommand('HGETALL', [key], (val) => {
+            if (!val || (Array.isArray(val) && val.length === 0)) {
+                return {};
+            }
+            if (Array.isArray(val)) {
+                const obj = {};
+                for (let i = 0; i < val.length; i += 2) {
+                    obj[String(val[i])] = String(val[i + 1]);
+                }
+                return obj;
+            }
+            return val;
+        });
+        return this;
+    }
+    hset(key, data) {
+        const args = [key];
+        for (const [k, v] of Object.entries(data)) {
+            args.push(k, String(v));
+        }
+        this.addCommand('HSET', args);
+        return this;
+    }
+    hscan(key, cursor, options) {
+        const args = [key, String(cursor)];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        this.addCommand('HSCAN', args, (val) => {
+            // Normalize to ioredis format: [cursor, [field, value, field, value, ...]]
+            if (!val) {
+                return ['0', []];
+            }
+            if (Array.isArray(val)) {
+                return [String(val[0]), normalizeStringCollection(val[1])];
+            }
+            return ['0', []];
+        });
+        return this;
+    }
+    smembers(key) {
+        this.addCommand('SMEMBERS', [key], (val) => normalizeStringCollection(val));
+        return this;
+    }
+    sscan(key, cursor, options) {
+        const args = [key, String(cursor)];
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', String(options.COUNT));
+        }
+        this.addCommand('SSCAN', args, (val) => {
+            // Normalize to ioredis format: [cursor, [member, member, ...]]
+            if (!val) {
+                return ['0', []];
+            }
+            if (Array.isArray(val)) {
+                return [String(val[0]), normalizeStringCollection(val[1])];
+            }
+            return ['0', []];
+        });
+        return this;
+    }
+    zrange(key, start, end) {
+        this.addCommand('ZRANGE', [key, String(start), String(end)], (val) => Array.isArray(val) ? val.map(String) : []);
+        return this;
+    }
+    lrange(key, start, end) {
+        this.addCommand('LRANGE', [key, String(start), String(end)], (val) => Array.isArray(val) ? val.map(String) : []);
+        return this;
+    }
+    llen(key) {
+        this.addCommand('LLEN', [key]);
+        return this;
+    }
+    del(...keys) {
+        if (keys.length > 0) {
+            this.addCommand('DEL', keys);
+        }
+        return this;
+    }
+    runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}" in transaction`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, numberOfKeys } = script;
+        const cmdKeys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Use EVALSHA for performance. The script is loaded server-side
+        // via SCRIPT LOAD in exec() before any commands are sent.
+        this.scriptsToLoad.push(script);
+        this.addCommand('EVALSHA', [
+            sha,
+            String(cmdKeys.length),
+            ...cmdKeys,
+            ...argv,
+        ]);
+        return this;
+    }
+    async exec() {
+        if (this.commands.length === 0) {
+            return [];
+        }
+        // Make sure any Lua scripts referenced via EVALSHA are loaded on the
+        // server before we send EVALSHA inside the pipeline / MULTI block.
+        if (this.scriptsToLoad.length > 0) {
+            await this.adapter.ensureScriptsLoaded(this.scriptsToLoad);
+        }
+        if (!this.transactional) {
+            // Fire all commands concurrently for implicit pipelining (like ioredis).
+            // This ensures all commands are written to the socket together, preventing
+            // other operations from interleaving between pipeline commands.
+            const settled = await Promise.allSettled(this.commands.map(({ cmd, args }) => this.adapter.sendCommand(cmd, args)));
+            return settled.map((result, i) => {
+                if (result.status === 'rejected') {
+                    return [result.reason, null];
+                }
+                const transformer = this.transformers[i];
+                const value = transformer ? transformer(result.value) : result.value;
+                return [null, value];
+            });
+        }
+        // Execute as a pipelined MULTI/EXEC block. Redis supports multiple
+        // MULTI/EXEC blocks pipelined on the same connection — each MULTI starts
+        // a new transaction context and EXEC commits it, responses arrive in
+        // order. We fire MULTI + all commands + EXEC synchronously (no await
+        // between them) so they're written to the socket buffer as one contiguous
+        // burst with no opportunity for interleaving from other async contexts.
+        //
+        // The MULTI and per-command `send()` calls are intentionally fire-and-
+        // forget for performance, but their returned promises must still have a
+        // rejection handler attached to avoid Bun emitting "unhandled promise
+        // rejection" warnings if the connection drops or Redis returns an error
+        // reply before we reach EXEC. The actual failure is reported through the
+        // awaited EXEC promise (which Redis rejects in the same situations), or
+        // bubbles up via the surrounding `try/catch`.
+        const swallow = (_) => {
+            /* error surfaces via EXEC or the outer try/catch */
+        };
+        try {
+            // Fire MULTI without awaiting — no round-trip needed before commands.
+            this.raw.send('MULTI', []).catch(swallow);
+            // Fire all queued commands synchronously (no awaits).
+            for (const { cmd, args } of this.commands) {
+                this.raw.send(cmd, args).catch(swallow);
+            }
+            // EXEC is the only await — it returns the array of results.
+            const results = await this.raw.send('EXEC', []);
+            if (!results) {
+                return null;
+            }
+            // Normalize to ioredis format: [Error | null, value][]
+            return results.map((result, i) => {
+                if (result instanceof Error) {
+                    return [result, null];
+                }
+                const transformer = this.transformers[i];
+                const value = transformer ? transformer(result) : result;
+                return [null, value];
+            });
+        }
+        catch (err) {
+            // Try to discard the MULTI state on error
+            try {
+                await this.raw.send('DISCARD', []);
+            }
+            catch (_a) {
+                // ignore
+            }
+            throw err;
+        }
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/child-pool.d.ts b/node_modules/bullmq/dist/esm/classes/child-pool.d.ts
new file mode 100644
index 0000000..4581e66
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child-pool.d.ts
@@ -0,0 +1,23 @@
+import { Child } from './child';
+import { SandboxedOptions } from '../interfaces';
+interface ChildPoolOpts extends SandboxedOptions {
+    mainFile?: string;
+}
+export declare class ChildPool {
+    retained: {
+        [key: number]: Child;
+    };
+    free: {
+        [key: string]: Child[];
+    };
+    private opts;
+    constructor({ mainFile, useWorkerThreads, workerForkOptions, workerThreadsOptions, }: ChildPoolOpts);
+    retain(processFile: string): Promise<Child>;
+    release(child: Child): void;
+    remove(child: Child): void;
+    kill(child: Child, signal?: 'SIGTERM' | 'SIGKILL'): Promise<void>;
+    clean(): Promise<void>;
+    getFree(id: string): Child[];
+    getAllFree(): Child[];
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/child-pool.js b/node_modules/bullmq/dist/esm/classes/child-pool.js
new file mode 100644
index 0000000..165a888
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child-pool.js
@@ -0,0 +1,78 @@
+import * as path from 'path';
+import { Child } from './child';
+const CHILD_KILL_TIMEOUT = 30000;
+const supportCJS = () => {
+    return (typeof require === 'function' &&
+        typeof module === 'object' &&
+        typeof module.exports === 'object');
+};
+export class ChildPool {
+    constructor({ mainFile = supportCJS()
+        ? path.join(process.cwd(), 'dist/cjs/classes/main.js')
+        : path.join(process.cwd(), 'dist/esm/classes/main.js'), useWorkerThreads, workerForkOptions, workerThreadsOptions, }) {
+        this.retained = {};
+        this.free = {};
+        this.opts = {
+            mainFile,
+            useWorkerThreads,
+            workerForkOptions,
+            workerThreadsOptions,
+        };
+    }
+    async retain(processFile) {
+        let child = this.getFree(processFile).pop();
+        if (child) {
+            this.retained[child.pid] = child;
+            return child;
+        }
+        child = new Child(this.opts.mainFile, processFile, {
+            useWorkerThreads: this.opts.useWorkerThreads,
+            workerForkOptions: this.opts.workerForkOptions,
+            workerThreadsOptions: this.opts.workerThreadsOptions,
+        });
+        child.on('exit', this.remove.bind(this, child));
+        try {
+            await child.init();
+            // Check status here as well, in case the child exited before we could
+            // retain it.
+            if (child.exitCode !== null || child.signalCode !== null) {
+                throw new Error('Child exited before it could be retained');
+            }
+            this.retained[child.pid] = child;
+            return child;
+        }
+        catch (err) {
+            console.error(err);
+            this.release(child);
+            throw err;
+        }
+    }
+    release(child) {
+        delete this.retained[child.pid];
+        this.getFree(child.processFile).push(child);
+    }
+    remove(child) {
+        delete this.retained[child.pid];
+        const free = this.getFree(child.processFile);
+        const childIndex = free.indexOf(child);
+        if (childIndex > -1) {
+            free.splice(childIndex, 1);
+        }
+    }
+    async kill(child, signal = 'SIGKILL') {
+        this.remove(child);
+        return child.kill(signal, CHILD_KILL_TIMEOUT);
+    }
+    async clean() {
+        const children = Object.values(this.retained).concat(this.getAllFree());
+        this.retained = {};
+        this.free = {};
+        await Promise.all(children.map(c => this.kill(c, 'SIGTERM')));
+    }
+    getFree(id) {
+        return (this.free[id] = this.free[id] || []);
+    }
+    getAllFree() {
+        return Object.values(this.free).reduce((first, second) => first.concat(second), []);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/child-processor.d.ts b/node_modules/bullmq/dist/esm/classes/child-processor.d.ts
new file mode 100644
index 0000000..125adb8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child-processor.d.ts
@@ -0,0 +1,44 @@
+import { Receiver, SandboxedJob } from '../interfaces';
+import { JobJsonSandbox } from '../types';
+declare enum ChildStatus {
+    Idle = 0,
+    Started = 1,
+    Terminating = 2,
+    Errored = 3
+}
+/**
+ * ChildProcessor
+ *
+ * This class acts as the interface between a child process and it parent process
+ * so that jobs can be processed in different processes.
+ *
+ */
+export declare class ChildProcessor {
+    private send;
+    private receiver;
+    status?: ChildStatus;
+    processor: any;
+    currentJobPromise: Promise<unknown> | undefined;
+    private abortController?;
+    constructor(send: (msg: any) => Promise<void>, receiver: Receiver);
+    init(processorFile: string): Promise<void>;
+    start(jobJson: JobJsonSandbox, token?: string): Promise<void>;
+    /**
+     * Cancels the currently running job by aborting its signal.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancel(reason?: string): void;
+    stop(): Promise<void>;
+    waitForCurrentJobAndExit(): Promise<void>;
+    /**
+     * Enhance the given job argument with some functions
+     * that can be called from the sandboxed job processor.
+     *
+     * Note, the `job` argument is a JSON deserialized message
+     * from the main node process to this forked child process,
+     * the functions on the original job object are not in tact.
+     * The wrapped job adds back some of those original functions.
+     */
+    protected wrapJob(job: JobJsonSandbox, send: (msg: any) => Promise<void>): SandboxedJob;
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/child-processor.js b/node_modules/bullmq/dist/esm/classes/child-processor.js
new file mode 100644
index 0000000..b22a45f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child-processor.js
@@ -0,0 +1,251 @@
+import { AbortController } from './abort-controller';
+import { ParentCommand } from '../enums';
+import { errorToJSON } from '../utils';
+var ChildStatus;
+(function (ChildStatus) {
+    ChildStatus[ChildStatus["Idle"] = 0] = "Idle";
+    ChildStatus[ChildStatus["Started"] = 1] = "Started";
+    ChildStatus[ChildStatus["Terminating"] = 2] = "Terminating";
+    ChildStatus[ChildStatus["Errored"] = 3] = "Errored";
+})(ChildStatus || (ChildStatus = {}));
+const RESPONSE_TIMEOUT = process.env.NODE_ENV === 'test' ? 500 : 5000;
+/**
+ * ChildProcessor
+ *
+ * This class acts as the interface between a child process and it parent process
+ * so that jobs can be processed in different processes.
+ *
+ */
+export class ChildProcessor {
+    constructor(send, receiver) {
+        this.send = send;
+        this.receiver = receiver;
+    }
+    async init(processorFile) {
+        let processor;
+        try {
+            const { default: processorFn } = await import(processorFile);
+            processor = processorFn;
+            if (processor.default) {
+                // support es2015 module.
+                processor = processor.default;
+            }
+            if (typeof processor !== 'function') {
+                throw new Error('No function is exported in processor file');
+            }
+        }
+        catch (err) {
+            this.status = ChildStatus.Errored;
+            return this.send({
+                cmd: ParentCommand.InitFailed,
+                err: errorToJSON(err),
+            });
+        }
+        const origProcessor = processor;
+        processor = function (job, token, signal) {
+            try {
+                return Promise.resolve(origProcessor(job, token, signal));
+            }
+            catch (err) {
+                return Promise.reject(err);
+            }
+        };
+        this.processor = processor;
+        this.status = ChildStatus.Idle;
+        await this.send({
+            cmd: ParentCommand.InitCompleted,
+        });
+    }
+    async start(jobJson, token) {
+        if (this.status !== ChildStatus.Idle) {
+            return this.send({
+                cmd: ParentCommand.Error,
+                err: errorToJSON(new Error('cannot start a not idling child process')),
+            });
+        }
+        this.status = ChildStatus.Started;
+        this.abortController = new AbortController();
+        this.currentJobPromise = (async () => {
+            try {
+                const job = this.wrapJob(jobJson, this.send);
+                const result = await this.processor(job, token, this.abortController.signal);
+                await this.send({
+                    cmd: ParentCommand.Completed,
+                    value: typeof result === 'undefined' ? null : result,
+                });
+            }
+            catch (err) {
+                await this.send({
+                    cmd: ParentCommand.Failed,
+                    value: errorToJSON(!err.message ? new Error(err) : err),
+                });
+            }
+            finally {
+                this.status = ChildStatus.Idle;
+                this.currentJobPromise = undefined;
+                this.abortController = undefined;
+            }
+        })();
+    }
+    /**
+     * Cancels the currently running job by aborting its signal.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancel(reason) {
+        if (this.abortController) {
+            this.abortController.abort(reason);
+        }
+    }
+    async stop() { }
+    async waitForCurrentJobAndExit() {
+        this.status = ChildStatus.Terminating;
+        try {
+            await this.currentJobPromise;
+        }
+        finally {
+            process.exit(process.exitCode || 0);
+        }
+    }
+    /**
+     * Enhance the given job argument with some functions
+     * that can be called from the sandboxed job processor.
+     *
+     * Note, the `job` argument is a JSON deserialized message
+     * from the main node process to this forked child process,
+     * the functions on the original job object are not in tact.
+     * The wrapped job adds back some of those original functions.
+     */
+    wrapJob(job, send) {
+        const wrappedJob = Object.assign(Object.assign({}, job), { queueQualifiedName: job.queueQualifiedName, data: JSON.parse(job.data || '{}'), opts: job.opts, returnValue: JSON.parse(job.returnvalue || '{}'), 
+            /*
+             * Proxy `updateProgress` function, should works as `progress` function.
+             */
+            async updateProgress(progress) {
+                // Locally store reference to new progress value
+                // so that we can return it from this process synchronously.
+                this.progress = progress;
+                // Send message to update job progress.
+                await send({
+                    cmd: ParentCommand.Progress,
+                    value: progress,
+                });
+            }, 
+            /*
+             * Proxy job `log` function.
+             */
+            log: async (row) => {
+                await send({
+                    cmd: ParentCommand.Log,
+                    value: row,
+                });
+            }, 
+            /*
+             * Proxy `moveToDelayed` function.
+             */
+            moveToDelayed: async (timestamp, token) => {
+                await send({
+                    cmd: ParentCommand.MoveToDelayed,
+                    value: { timestamp, token },
+                });
+            }, 
+            /*
+             * Proxy `moveToWait` function.
+             */
+            moveToWait: async (token) => {
+                await send({
+                    cmd: ParentCommand.MoveToWait,
+                    value: { token },
+                });
+            }, 
+            /*
+             * Proxy `moveToWaitingChildren` function.
+             */
+            moveToWaitingChildren: async (token, opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: ParentCommand.MoveToWaitingChildren,
+                    value: { token, opts },
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'moveToWaitingChildren');
+            }, 
+            /*
+             * Proxy `updateData` function.
+             */
+            updateData: async (data) => {
+                await send({
+                    cmd: ParentCommand.Update,
+                    value: data,
+                });
+                wrappedJob.data = data;
+            }, 
+            /**
+             * Proxy `getChildrenValues` function.
+             */
+            getChildrenValues: async () => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: ParentCommand.GetChildrenValues,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getChildrenValues');
+            }, 
+            /**
+             * Proxy `getIgnoredChildrenFailures` function.
+             *
+             * This method sends a request to retrieve the failures of ignored children
+             * and waits for a response from the parent process.
+             *
+             * @returns - A promise that resolves with the ignored children failures.
+             * The exact structure of the returned data depends on the parent process implementation.
+             */
+            getIgnoredChildrenFailures: async () => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: ParentCommand.GetIgnoredChildrenFailures,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getIgnoredChildrenFailures');
+            }, 
+            /**
+             * Proxy `getDependenciesCount` function.
+             */
+            getDependenciesCount: async (opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: ParentCommand.GetDependenciesCount,
+                    value: opts,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getDependenciesCount');
+            }, 
+            /**
+             * Proxy `getDependencies` function.
+             */
+            getDependencies: async (opts) => {
+                const requestId = Math.random().toString(36).substring(2, 15);
+                await send({
+                    requestId,
+                    cmd: ParentCommand.GetDependencies,
+                    value: opts,
+                });
+                return waitResponse(requestId, this.receiver, RESPONSE_TIMEOUT, 'getDependencies');
+            } });
+        return wrappedJob;
+    }
+}
+const waitResponse = async (requestId, receiver, timeout, cmd) => {
+    return new Promise((resolve, reject) => {
+        const listener = (msg) => {
+            if (msg.requestId === requestId) {
+                resolve(msg.value);
+                receiver.off('message', listener);
+            }
+        };
+        receiver.on('message', listener);
+        setTimeout(() => {
+            receiver.off('message', listener);
+            reject(new Error(`TimeoutError: ${cmd} timed out in (${timeout}ms)`));
+        }, timeout);
+    });
+};
diff --git a/node_modules/bullmq/dist/esm/classes/child.d.ts b/node_modules/bullmq/dist/esm/classes/child.d.ts
new file mode 100644
index 0000000..edfd552
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child.d.ts
@@ -0,0 +1,32 @@
+import { ChildProcess } from 'child_process';
+import { Worker } from 'worker_threads';
+import { SandboxedOptions } from '../interfaces';
+import { EventEmitter } from 'events';
+/**
+ * Child class
+ *
+ * This class is used to create a child process or worker thread, and allows using
+ * isolated processes or threads for processing jobs.
+ *
+ */
+export declare class Child extends EventEmitter {
+    private mainFile;
+    processFile: string;
+    private opts;
+    childProcess: ChildProcess;
+    worker: Worker;
+    private _exitCode;
+    private _signalCode;
+    private _killed;
+    constructor(mainFile: string, processFile: string, opts?: SandboxedOptions);
+    get pid(): number;
+    get exitCode(): number;
+    get signalCode(): number;
+    get killed(): boolean;
+    init(): Promise<void>;
+    send(msg: any): Promise<void>;
+    private killProcess;
+    kill(signal?: 'SIGTERM' | 'SIGKILL', timeoutMs?: number): Promise<void>;
+    private initChild;
+    hasProcessExited(): boolean;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/child.js b/node_modules/bullmq/dist/esm/classes/child.js
new file mode 100644
index 0000000..1f83f40
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/child.js
@@ -0,0 +1,210 @@
+import { fork } from 'child_process';
+import { createServer } from 'net';
+import { Worker } from 'worker_threads';
+import { ChildCommand, ParentCommand } from '../enums';
+import { EventEmitter } from 'events';
+/**
+ * @see https://nodejs.org/api/process.html#process_exit_codes
+ */
+const exitCodesErrors = {
+    1: 'Uncaught Fatal Exception',
+    2: 'Unused',
+    3: 'Internal JavaScript Parse Error',
+    4: 'Internal JavaScript Evaluation Failure',
+    5: 'Fatal Error',
+    6: 'Non-function Internal Exception Handler',
+    7: 'Internal Exception Handler Run-Time Failure',
+    8: 'Unused',
+    9: 'Invalid Argument',
+    10: 'Internal JavaScript Run-Time Failure',
+    12: 'Invalid Debug Argument',
+    13: 'Unfinished Top-Level Await',
+};
+/**
+ * Child class
+ *
+ * This class is used to create a child process or worker thread, and allows using
+ * isolated processes or threads for processing jobs.
+ *
+ */
+export class Child extends EventEmitter {
+    constructor(mainFile, processFile, opts = {
+        useWorkerThreads: false,
+    }) {
+        super();
+        this.mainFile = mainFile;
+        this.processFile = processFile;
+        this.opts = opts;
+        this._exitCode = null;
+        this._signalCode = null;
+        this._killed = false;
+    }
+    get pid() {
+        if (this.childProcess) {
+            return this.childProcess.pid;
+        }
+        else if (this.worker) {
+            // Worker threads pids can become negative when they are terminated
+            // so we need to use the absolute value to index the retained object
+            return Math.abs(this.worker.threadId);
+        }
+        else {
+            throw new Error('No child process or worker thread');
+        }
+    }
+    get exitCode() {
+        return this._exitCode;
+    }
+    get signalCode() {
+        return this._signalCode;
+    }
+    get killed() {
+        if (this.childProcess) {
+            return this.childProcess.killed;
+        }
+        return this._killed;
+    }
+    async init() {
+        const execArgv = await convertExecArgv(process.execArgv);
+        let parent;
+        if (this.opts.useWorkerThreads) {
+            this.worker = parent = new Worker(this.mainFile, Object.assign({ execArgv, stdin: true, stdout: true, stderr: true }, (this.opts.workerThreadsOptions
+                ? this.opts.workerThreadsOptions
+                : {})));
+        }
+        else {
+            this.childProcess = parent = fork(this.mainFile, [], Object.assign({ execArgv, stdio: 'pipe' }, (this.opts.workerForkOptions ? this.opts.workerForkOptions : {})));
+        }
+        parent.on('exit', (exitCode, signalCode) => {
+            this._exitCode = exitCode;
+            // Coerce to null if undefined for backwards compatibility
+            signalCode = typeof signalCode === 'undefined' ? null : signalCode;
+            this._signalCode = signalCode;
+            this._killed = true;
+            this.emit('exit', exitCode, signalCode);
+            // Clean all listeners, we do not expect any more events after "exit"
+            parent.removeAllListeners();
+            this.removeAllListeners();
+        });
+        parent.on('error', (...args) => this.emit('error', ...args));
+        parent.on('message', (...args) => this.emit('message', ...args));
+        parent.on('close', (...args) => this.emit('close', ...args));
+        parent.stdout.pipe(process.stdout);
+        parent.stderr.pipe(process.stderr);
+        await this.initChild();
+    }
+    async send(msg) {
+        return new Promise((resolve, reject) => {
+            if (this.childProcess) {
+                this.childProcess.send(msg, (err) => {
+                    if (err) {
+                        reject(err);
+                    }
+                    else {
+                        resolve();
+                    }
+                });
+            }
+            else if (this.worker) {
+                resolve(this.worker.postMessage(msg));
+            }
+            else {
+                resolve();
+            }
+        });
+    }
+    killProcess(signal = 'SIGKILL') {
+        if (this.childProcess) {
+            this.childProcess.kill(signal);
+        }
+        else if (this.worker) {
+            this.worker.terminate();
+        }
+    }
+    async kill(signal = 'SIGKILL', timeoutMs) {
+        if (this.hasProcessExited()) {
+            return;
+        }
+        const onExit = onExitOnce(this.childProcess || this.worker);
+        this.killProcess(signal);
+        if (timeoutMs !== undefined && (timeoutMs === 0 || isFinite(timeoutMs))) {
+            const timeoutHandle = setTimeout(() => {
+                if (!this.hasProcessExited()) {
+                    this.killProcess('SIGKILL');
+                }
+            }, timeoutMs);
+            await onExit;
+            clearTimeout(timeoutHandle);
+        }
+        await onExit;
+    }
+    async initChild() {
+        const onComplete = new Promise((resolve, reject) => {
+            const onMessageHandler = (msg) => {
+                if (!Object.values(ParentCommand).includes(msg.cmd)) {
+                    return;
+                }
+                if (msg.cmd === ParentCommand.InitCompleted) {
+                    resolve();
+                }
+                else if (msg.cmd === ParentCommand.InitFailed) {
+                    const err = new Error();
+                    err.stack = msg.err.stack;
+                    err.message = msg.err.message;
+                    reject(err);
+                }
+                this.off('message', onMessageHandler);
+                this.off('close', onCloseHandler);
+            };
+            const onCloseHandler = (code, signal) => {
+                if (code > 128) {
+                    code -= 128;
+                }
+                const msg = exitCodesErrors[code] || `Unknown exit code ${code}`;
+                reject(new Error(`Error initializing child: ${msg} and signal ${signal}`));
+                this.off('message', onMessageHandler);
+                this.off('close', onCloseHandler);
+            };
+            this.on('message', onMessageHandler);
+            this.on('close', onCloseHandler);
+        });
+        await this.send({
+            cmd: ChildCommand.Init,
+            value: this.processFile,
+        });
+        await onComplete;
+    }
+    hasProcessExited() {
+        return !!(this.exitCode !== null || this.signalCode);
+    }
+}
+function onExitOnce(child) {
+    return new Promise(resolve => {
+        child.once('exit', () => resolve());
+    });
+}
+const getFreePort = async () => {
+    return new Promise(resolve => {
+        const server = createServer();
+        server.listen(0, () => {
+            const { port } = server.address();
+            server.close(() => resolve(port));
+        });
+    });
+};
+const convertExecArgv = async (execArgv) => {
+    const standard = [];
+    const convertedArgs = [];
+    for (let i = 0; i < execArgv.length; i++) {
+        const arg = execArgv[i];
+        if (arg.indexOf('--inspect') === -1) {
+            standard.push(arg);
+        }
+        else {
+            const argName = arg.split('=')[0];
+            const port = await getFreePort();
+            convertedArgs.push(`${argName}=${port}`);
+        }
+    }
+    return standard.concat(convertedArgs);
+};
diff --git a/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.d.ts
new file mode 100644
index 0000000..d5c514e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.d.ts
@@ -0,0 +1,12 @@
+/**
+ * Thrown by any BullMQ Redis adapter (ioredis, node-redis, Bun, …) when a
+ * command fails because the connection is already closed or was closed
+ * mid-flight.
+ *
+ * Using a single well-known class lets {@link isNotConnectionError} do a
+ * structural `instanceof` check rather than fragile message-substring matching.
+ */
+export declare class ConnectionClosedError extends Error {
+    readonly cause?: unknown;
+    constructor(message?: string, cause?: unknown);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.js b/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.js
new file mode 100644
index 0000000..8fc3a0c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/connection-closed-error.js
@@ -0,0 +1,16 @@
+/**
+ * Thrown by any BullMQ Redis adapter (ioredis, node-redis, Bun, …) when a
+ * command fails because the connection is already closed or was closed
+ * mid-flight.
+ *
+ * Using a single well-known class lets {@link isNotConnectionError} do a
+ * structural `instanceof` check rather than fragile message-substring matching.
+ */
+export class ConnectionClosedError extends Error {
+    constructor(message, cause) {
+        super(message !== null && message !== void 0 ? message : 'Connection is closed');
+        this.cause = cause;
+        this.name = 'ConnectionClosedError';
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/delayed-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/delayed-error.d.ts
new file mode 100644
index 0000000..cce4a4f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/delayed-error.d.ts
@@ -0,0 +1,11 @@
+export declare const DELAYED_ERROR = "bullmq:movedToDelayed";
+/**
+ * DelayedError
+ *
+ * Error to be thrown when job is moved to delayed state
+ * from job in active state.
+ *
+ */
+export declare class DelayedError extends Error {
+    constructor(message?: string);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/delayed-error.js b/node_modules/bullmq/dist/esm/classes/errors/delayed-error.js
new file mode 100644
index 0000000..d7bb10e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/delayed-error.js
@@ -0,0 +1,15 @@
+export const DELAYED_ERROR = 'bullmq:movedToDelayed';
+/**
+ * DelayedError
+ *
+ * Error to be thrown when job is moved to delayed state
+ * from job in active state.
+ *
+ */
+export class DelayedError extends Error {
+    constructor(message = DELAYED_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/index.d.ts b/node_modules/bullmq/dist/esm/classes/errors/index.d.ts
new file mode 100644
index 0000000..47d99e1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/index.d.ts
@@ -0,0 +1,6 @@
+export * from './connection-closed-error';
+export * from './delayed-error';
+export * from './rate-limit-error';
+export * from './unrecoverable-error';
+export * from './waiting-children-error';
+export * from './waiting-error';
diff --git a/node_modules/bullmq/dist/esm/classes/errors/index.js b/node_modules/bullmq/dist/esm/classes/errors/index.js
new file mode 100644
index 0000000..47d99e1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/index.js
@@ -0,0 +1,6 @@
+export * from './connection-closed-error';
+export * from './delayed-error';
+export * from './rate-limit-error';
+export * from './unrecoverable-error';
+export * from './waiting-children-error';
+export * from './waiting-error';
diff --git a/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.d.ts
new file mode 100644
index 0000000..f9a44ca
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.d.ts
@@ -0,0 +1,10 @@
+export declare const RATE_LIMIT_ERROR = "bullmq:rateLimitExceeded";
+/**
+ * RateLimitError
+ *
+ * Error to be thrown when queue reaches a rate limit.
+ *
+ */
+export declare class RateLimitError extends Error {
+    constructor(message?: string);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.js b/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.js
new file mode 100644
index 0000000..a4a7da8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/rate-limit-error.js
@@ -0,0 +1,14 @@
+export const RATE_LIMIT_ERROR = 'bullmq:rateLimitExceeded';
+/**
+ * RateLimitError
+ *
+ * Error to be thrown when queue reaches a rate limit.
+ *
+ */
+export class RateLimitError extends Error {
+    constructor(message = RATE_LIMIT_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.d.ts
new file mode 100644
index 0000000..8cf9e0f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.d.ts
@@ -0,0 +1,11 @@
+export declare const UNRECOVERABLE_ERROR = "bullmq:unrecoverable";
+/**
+ * UnrecoverableError
+ *
+ * Error to move a job to failed even if the attemptsMade
+ * are lower than the expected limit.
+ *
+ */
+export declare class UnrecoverableError extends Error {
+    constructor(message?: string);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.js b/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.js
new file mode 100644
index 0000000..128024d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/unrecoverable-error.js
@@ -0,0 +1,15 @@
+export const UNRECOVERABLE_ERROR = 'bullmq:unrecoverable';
+/**
+ * UnrecoverableError
+ *
+ * Error to move a job to failed even if the attemptsMade
+ * are lower than the expected limit.
+ *
+ */
+export class UnrecoverableError extends Error {
+    constructor(message = UNRECOVERABLE_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.d.ts
new file mode 100644
index 0000000..1b0ff27
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.d.ts
@@ -0,0 +1,11 @@
+export declare const WAITING_CHILDREN_ERROR = "bullmq:movedToWaitingChildren";
+/**
+ * WaitingChildrenError
+ *
+ * Error to be thrown when job is moved to waiting-children state
+ * from job in active state.
+ *
+ */
+export declare class WaitingChildrenError extends Error {
+    constructor(message?: string);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.js b/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.js
new file mode 100644
index 0000000..0fb3a45
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/waiting-children-error.js
@@ -0,0 +1,15 @@
+export const WAITING_CHILDREN_ERROR = 'bullmq:movedToWaitingChildren';
+/**
+ * WaitingChildrenError
+ *
+ * Error to be thrown when job is moved to waiting-children state
+ * from job in active state.
+ *
+ */
+export class WaitingChildrenError extends Error {
+    constructor(message = WAITING_CHILDREN_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/waiting-error.d.ts b/node_modules/bullmq/dist/esm/classes/errors/waiting-error.d.ts
new file mode 100644
index 0000000..5028245
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/waiting-error.d.ts
@@ -0,0 +1,10 @@
+export declare const WAITING_ERROR = "bullmq:movedToWait";
+/**
+ * WaitingError
+ *
+ * Error to be thrown when job is moved to wait or prioritized state
+ * from job in active state.
+ */
+export declare class WaitingError extends Error {
+    constructor(message?: string);
+}
diff --git a/node_modules/bullmq/dist/esm/classes/errors/waiting-error.js b/node_modules/bullmq/dist/esm/classes/errors/waiting-error.js
new file mode 100644
index 0000000..73c7bfc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/errors/waiting-error.js
@@ -0,0 +1,14 @@
+export const WAITING_ERROR = 'bullmq:movedToWait';
+/**
+ * WaitingError
+ *
+ * Error to be thrown when job is moved to wait or prioritized state
+ * from job in active state.
+ */
+export class WaitingError extends Error {
+    constructor(message = WAITING_ERROR) {
+        super(message);
+        this.name = this.constructor.name;
+        Object.setPrototypeOf(this, new.target.prototype);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/flow-producer.d.ts b/node_modules/bullmq/dist/esm/classes/flow-producer.d.ts
new file mode 100644
index 0000000..1f622c9
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/flow-producer.d.ts
@@ -0,0 +1,179 @@
+import { EventEmitter } from 'events';
+import { FlowJob, FlowQueuesOpts, FlowOpts, IoredisListener, IRedisTransaction, ParentOptions, QueueBaseOptions, RedisClient, Tracer, ContextManager } from '../interfaces';
+import { Job } from './job';
+import { KeysMap, QueueKeys } from './queue-keys';
+import { RedisConnection } from './redis-connection';
+export interface AddNodeOpts {
+    multi: IRedisTransaction;
+    node: FlowJob;
+    parent?: {
+        parentOpts: ParentOptions;
+        parentDependenciesKey: string;
+    };
+    /**
+     * Queues options that will be applied in each node depending on queue name presence.
+     */
+    queuesOpts?: FlowQueuesOpts;
+}
+export interface AddChildrenOpts {
+    multi: IRedisTransaction;
+    nodes: FlowJob[];
+    parent: {
+        parentOpts: ParentOptions;
+        parentDependenciesKey: string;
+    };
+    queuesOpts?: FlowQueuesOpts;
+}
+export interface NodeOpts {
+    /**
+     * Root job queue name.
+     */
+    queueName: string;
+    /**
+     * Prefix included in job key.
+     */
+    prefix?: string;
+    /**
+     * Root job id.
+     */
+    id: string;
+    /**
+     * Maximum depth or levels to visit in the tree.
+     */
+    depth?: number;
+    /**
+     * Maximum quantity of children per type (processed, unprocessed).
+     */
+    maxChildren?: number;
+}
+export interface JobNode {
+    job: Job;
+    children?: JobNode[];
+}
+export interface FlowProducerListener extends IoredisListener {
+    /**
+     * Listen to 'error' event.
+     *
+     * This event is triggered when an error is throw.
+     */
+    error: (failedReason: Error) => void;
+}
+/**
+ * This class allows to add jobs with dependencies between them in such
+ * a way that it is possible to build complex flows.
+ * Note: A flow is a tree-like structure of jobs that depend on each other.
+ * Whenever the children of a given parent are completed, the parent
+ * will be processed, being able to access the children's result data.
+ * All Jobs can be in different queues, either children or parents,
+ */
+export declare class FlowProducer extends EventEmitter {
+    opts: QueueBaseOptions;
+    toKey: (name: string, type: string) => string;
+    keys: KeysMap;
+    closing: Promise<void> | undefined;
+    queueKeys: QueueKeys;
+    protected connection: RedisConnection;
+    protected telemetry: {
+        tracer: Tracer | undefined;
+        contextManager: ContextManager | undefined;
+    };
+    constructor(opts?: QueueBaseOptions, Connection?: typeof RedisConnection);
+    emit<U extends keyof FlowProducerListener>(event: U, ...args: Parameters<FlowProducerListener[U]>): boolean;
+    off<U extends keyof FlowProducerListener>(eventName: U, listener: FlowProducerListener[U]): this;
+    on<U extends keyof FlowProducerListener>(event: U, listener: FlowProducerListener[U]): this;
+    once<U extends keyof FlowProducerListener>(event: U, listener: FlowProducerListener[U]): this;
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client(): Promise<RedisClient>;
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    protected get Job(): typeof Job;
+    waitUntilReady(): Promise<RedisClient>;
+    /**
+     * Adds a flow.
+     *
+     * This call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flow - an object with a tree-like structure where children jobs
+     * will be processed before their parents.
+     * @param opts - options that will be applied to the flow object.
+     */
+    add(flow: FlowJob, opts?: FlowOpts): Promise<JobNode>;
+    /**
+     * Get a flow.
+     *
+     * @param opts - an object with options for getting a JobNode.
+     */
+    getFlow(opts: NodeOpts): Promise<JobNode>;
+    /**
+     * Adds multiple flows.
+     *
+     * A flow is a tree-like structure of jobs that depend on each other.
+     * Whenever the children of a given parent are completed, the parent
+     * will be processed, being able to access the children's result data.
+     *
+     * All Jobs can be in different queues, either children or parents,
+     * however this call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flows - an array of objects with a tree-like structure where children jobs
+     * will be processed before their parents.
+     */
+    addBulk(flows: FlowJob[]): Promise<JobNode[]>;
+    /**
+     * Add a node (job) of a flow to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param node - the node representing a job to be added to some queue
+     * @param parent - parent data sent to children to create the "links" to their parent
+     * @returns
+     */
+    protected addNode({ multi, node, parent, queuesOpts, }: AddNodeOpts): Promise<JobNode>;
+    /**
+     * Adds nodes (jobs) of multiple flows to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param nodes - the nodes representing jobs to be added to some queue
+     * @returns
+     */
+    protected addNodes(multi: IRedisTransaction, nodes: FlowJob[]): Promise<JobNode[]>;
+    private getNode;
+    private addChildren;
+    private getChildren;
+    /**
+     * Helper factory method that creates a queue-like object
+     * required to create jobs in any queue.
+     *
+     * @param node - The flow node containing the queue name and other job options.
+     * @param queueKeys - The queue keys helper used to resolve key names.
+     * @param prefix - The Redis key prefix used for the queue.
+     * @returns A queue-like object with the client, keys, and options needed to create jobs.
+     */
+    private queueFromNode;
+    /**
+     * Translates numeric addJob Lua error codes returned by root flow exec.
+     *
+     * @param code - Numeric error code returned from Redis.
+     * @param parentKey - Parent key for contextual error messages.
+     */
+    private toFlowError;
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    close(): Promise<void>;
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect(): Promise<void>;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/flow-producer.js b/node_modules/bullmq/dist/esm/classes/flow-producer.js
new file mode 100644
index 0000000..7a0a7d4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/flow-producer.js
@@ -0,0 +1,394 @@
+import { EventEmitter } from 'events';
+import { getParentKey, isRedisInstance, randomUUID, trace } from '../utils';
+import { Job } from './job';
+import { QueueKeys } from './queue-keys';
+import { RedisConnection } from './redis-connection';
+import { ErrorCode, SpanKind, TelemetryAttributes } from '../enums';
+/**
+ * This class allows to add jobs with dependencies between them in such
+ * a way that it is possible to build complex flows.
+ * Note: A flow is a tree-like structure of jobs that depend on each other.
+ * Whenever the children of a given parent are completed, the parent
+ * will be processed, being able to access the children's result data.
+ * All Jobs can be in different queues, either children or parents,
+ */
+export class FlowProducer extends EventEmitter {
+    constructor(opts = { connection: {} }, Connection = RedisConnection) {
+        super();
+        this.opts = opts;
+        this.opts = Object.assign({ prefix: 'bull' }, opts);
+        this.connection = new Connection(opts.connection, {
+            shared: isRedisInstance(opts.connection),
+            blocking: false,
+            skipVersionCheck: opts.skipVersionCheck,
+            skipWaitingForReady: opts.skipWaitingForReady,
+        });
+        this.connection.on('error', (error) => this.emit('error', error));
+        this.connection.on('close', () => {
+            if (!this.closing) {
+                this.emit('ioredis:close');
+            }
+        });
+        this.queueKeys = new QueueKeys(opts.prefix);
+        if (opts === null || opts === void 0 ? void 0 : opts.telemetry) {
+            this.telemetry = opts.telemetry;
+        }
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client() {
+        return this.connection.client;
+    }
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    get Job() {
+        return Job;
+    }
+    waitUntilReady() {
+        return this.client;
+    }
+    /**
+     * Adds a flow.
+     *
+     * This call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flow - an object with a tree-like structure where children jobs
+     * will be processed before their parents.
+     * @param opts - options that will be applied to the flow object.
+     */
+    async add(flow, opts) {
+        var _a;
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const multi = client.multi();
+        const parentOpts = (_a = flow === null || flow === void 0 ? void 0 : flow.opts) === null || _a === void 0 ? void 0 : _a.parent;
+        const parentKey = getParentKey(parentOpts);
+        const parentDependenciesKey = parentKey
+            ? `${parentKey}:dependencies`
+            : undefined;
+        return trace(this.telemetry, SpanKind.PRODUCER, flow.queueName, 'addFlow', flow.queueName, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.FlowName]: flow.name,
+            });
+            const jobsTree = await this.addNode({
+                multi,
+                node: flow,
+                queuesOpts: opts === null || opts === void 0 ? void 0 : opts.queuesOptions,
+                parent: {
+                    parentOpts,
+                    parentDependenciesKey,
+                },
+            });
+            const results = (await multi.exec());
+            const [result] = results || [];
+            if (result) {
+                const [err, jobId] = result;
+                if (err) {
+                    throw err;
+                }
+                if (typeof jobId === 'number' && jobId < 0) {
+                    throw this.toFlowError(jobId, parentKey);
+                }
+                if (typeof jobId === 'string') {
+                    jobsTree.job.id = jobId;
+                }
+            }
+            return jobsTree;
+        });
+    }
+    /**
+     * Get a flow.
+     *
+     * @param opts - an object with options for getting a JobNode.
+     */
+    async getFlow(opts) {
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const updatedOpts = Object.assign({
+            depth: 10,
+            maxChildren: 20,
+            prefix: this.opts.prefix,
+        }, opts);
+        const jobsTree = this.getNode(client, updatedOpts);
+        return jobsTree;
+    }
+    /**
+     * Adds multiple flows.
+     *
+     * A flow is a tree-like structure of jobs that depend on each other.
+     * Whenever the children of a given parent are completed, the parent
+     * will be processed, being able to access the children's result data.
+     *
+     * All Jobs can be in different queues, either children or parents,
+     * however this call would be atomic, either it fails and no jobs will
+     * be added to the queues, or it succeeds and all jobs will be added.
+     *
+     * @param flows - an array of objects with a tree-like structure where children jobs
+     * will be processed before their parents.
+     */
+    async addBulk(flows) {
+        if (this.closing) {
+            return;
+        }
+        const client = await this.connection.client;
+        const multi = client.multi();
+        return trace(this.telemetry, SpanKind.PRODUCER, '', 'addBulkFlows', '', async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.BulkCount]: flows.length,
+                [TelemetryAttributes.BulkNames]: flows
+                    .map(flow => flow.name)
+                    .join(','),
+            });
+            const jobsTrees = await this.addNodes(multi, flows);
+            const results = (await multi.exec());
+            for (let index = 0; index < jobsTrees.length; ++index) {
+                const result = results === null || results === void 0 ? void 0 : results[index];
+                if (!result) {
+                    continue;
+                }
+                const [err, jobId] = result;
+                if (!err && typeof jobId === 'string') {
+                    jobsTrees[index].job.id = jobId;
+                }
+            }
+            return jobsTrees;
+        });
+    }
+    /**
+     * Add a node (job) of a flow to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param node - the node representing a job to be added to some queue
+     * @param parent - parent data sent to children to create the "links" to their parent
+     * @returns
+     */
+    async addNode({ multi, node, parent, queuesOpts, }) {
+        var _a, _b;
+        const prefix = node.prefix || this.opts.prefix;
+        const queue = this.queueFromNode(node, new QueueKeys(prefix), prefix);
+        const queueOpts = queuesOpts && queuesOpts[node.queueName];
+        const jobsOpts = (_a = queueOpts === null || queueOpts === void 0 ? void 0 : queueOpts.defaultJobOptions) !== null && _a !== void 0 ? _a : {};
+        const jobId = ((_b = node.opts) === null || _b === void 0 ? void 0 : _b.jobId) || randomUUID();
+        return trace(this.telemetry, SpanKind.PRODUCER, node.queueName, 'addNode', node.queueName, async (span, srcPropagationMetadata) => {
+            var _a, _b;
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobName]: node.name,
+                [TelemetryAttributes.JobId]: jobId,
+            });
+            const opts = node.opts;
+            let telemetry = opts === null || opts === void 0 ? void 0 : opts.telemetry;
+            if (srcPropagationMetadata && opts) {
+                const omitContext = (_a = opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext;
+                const telemetryMetadata = ((_b = opts.telemetry) === null || _b === void 0 ? void 0 : _b.metadata) ||
+                    (!omitContext && srcPropagationMetadata);
+                if (telemetryMetadata || omitContext) {
+                    telemetry = {
+                        metadata: telemetryMetadata,
+                        omitContext,
+                    };
+                }
+            }
+            const job = new this.Job(queue, node.name, node.data, Object.assign(Object.assign(Object.assign({}, jobsOpts), opts), { parent: parent === null || parent === void 0 ? void 0 : parent.parentOpts, telemetry }), jobId);
+            const parentKey = getParentKey(parent === null || parent === void 0 ? void 0 : parent.parentOpts);
+            if (node.children && node.children.length > 0) {
+                // Create the parent job, it will be a job in status "waiting-children".
+                const parentId = jobId;
+                const queueKeysParent = new QueueKeys(node.prefix || this.opts.prefix);
+                await job.addJob(multi, {
+                    parentDependenciesKey: parent === null || parent === void 0 ? void 0 : parent.parentDependenciesKey,
+                    addToWaitingChildren: true,
+                    parentKey,
+                });
+                const parentDependenciesKey = `${queueKeysParent.toKey(node.queueName, parentId)}:dependencies`;
+                const children = await this.addChildren({
+                    multi,
+                    nodes: node.children,
+                    parent: {
+                        parentOpts: {
+                            id: parentId,
+                            queue: queueKeysParent.getQueueQualifiedName(node.queueName),
+                        },
+                        parentDependenciesKey,
+                    },
+                    queuesOpts,
+                });
+                return { job, children };
+            }
+            else {
+                await job.addJob(multi, {
+                    parentDependenciesKey: parent === null || parent === void 0 ? void 0 : parent.parentDependenciesKey,
+                    parentKey,
+                });
+                return { job };
+            }
+        });
+    }
+    /**
+     * Adds nodes (jobs) of multiple flows to the queue. This method will recursively
+     * add all its children as well. Note that a given job can potentially be
+     * a parent and a child job at the same time depending on where it is located
+     * in the tree hierarchy.
+     *
+     * @param multi - IRedisTransaction
+     * @param nodes - the nodes representing jobs to be added to some queue
+     * @returns
+     */
+    addNodes(multi, nodes) {
+        return Promise.all(nodes.map(node => {
+            var _a;
+            const parentOpts = (_a = node === null || node === void 0 ? void 0 : node.opts) === null || _a === void 0 ? void 0 : _a.parent;
+            const parentKey = getParentKey(parentOpts);
+            const parentDependenciesKey = parentKey
+                ? `${parentKey}:dependencies`
+                : undefined;
+            return this.addNode({
+                multi,
+                node,
+                parent: {
+                    parentOpts,
+                    parentDependenciesKey,
+                },
+            });
+        }));
+    }
+    async getNode(client, node) {
+        const queue = this.queueFromNode(node, new QueueKeys(node.prefix), node.prefix);
+        const job = await this.Job.fromId(queue, node.id);
+        if (job) {
+            const { processed = {}, unprocessed = [], failed = [], ignored = {}, } = await job.getDependencies({
+                failed: {
+                    count: node.maxChildren,
+                },
+                processed: {
+                    count: node.maxChildren,
+                },
+                unprocessed: {
+                    count: node.maxChildren,
+                },
+                ignored: {
+                    count: node.maxChildren,
+                },
+            });
+            const processedKeys = Object.keys(processed);
+            const ignoredKeys = Object.keys(ignored);
+            const childrenCount = processedKeys.length +
+                unprocessed.length +
+                ignoredKeys.length +
+                failed.length;
+            const newDepth = node.depth - 1;
+            if (childrenCount > 0 && newDepth) {
+                const children = await this.getChildren(client, [...processedKeys, ...unprocessed, ...failed, ...ignoredKeys], newDepth, node.maxChildren);
+                return { job, children };
+            }
+            else {
+                return { job };
+            }
+        }
+    }
+    addChildren({ multi, nodes, parent, queuesOpts }) {
+        return Promise.all(nodes.map(node => this.addNode({ multi, node, parent, queuesOpts })));
+    }
+    getChildren(client, childrenKeys, depth, maxChildren) {
+        const getChild = (key) => {
+            const [prefix, queueName, id] = key.split(':');
+            return this.getNode(client, {
+                id,
+                queueName,
+                prefix,
+                depth,
+                maxChildren,
+            });
+        };
+        return Promise.all([...childrenKeys.map(getChild)]);
+    }
+    /**
+     * Helper factory method that creates a queue-like object
+     * required to create jobs in any queue.
+     *
+     * @param node - The flow node containing the queue name and other job options.
+     * @param queueKeys - The queue keys helper used to resolve key names.
+     * @param prefix - The Redis key prefix used for the queue.
+     * @returns A queue-like object with the client, keys, and options needed to create jobs.
+     */
+    queueFromNode(node, queueKeys, prefix) {
+        return {
+            client: this.connection.client,
+            name: node.queueName,
+            keys: queueKeys.getKeys(node.queueName),
+            toKey: (type) => queueKeys.toKey(node.queueName, type),
+            opts: { prefix, connection: {} },
+            qualifiedName: queueKeys.getQueueQualifiedName(node.queueName),
+            closing: this.closing,
+            waitUntilReady: async () => this.connection.client,
+            removeListener: this.removeListener.bind(this),
+            emit: this.emit.bind(this),
+            on: this.on.bind(this),
+            redisVersion: this.connection.redisVersion,
+            databaseType: this.connection.databaseType,
+            trace: async () => { },
+        };
+    }
+    /**
+     * Translates numeric addJob Lua error codes returned by root flow exec.
+     *
+     * @param code - Numeric error code returned from Redis.
+     * @param parentKey - Parent key for contextual error messages.
+     */
+    toFlowError(code, parentKey) {
+        let error;
+        switch (code) {
+            case ErrorCode.ParentJobNotExist:
+                error = new Error(`Missing key for parent job ${parentKey}. addJob`);
+                break;
+            case ErrorCode.ParentJobCannotBeReplaced:
+                error = new Error(`The parent job ${parentKey} cannot be replaced. addJob`);
+                break;
+            default:
+                error = new Error(`Unknown code ${code} error for addJob`);
+        }
+        error.code = code;
+        return error;
+    }
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+    }
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect() {
+        return this.connection.disconnect();
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/index.d.ts b/node_modules/bullmq/dist/esm/classes/index.d.ts
new file mode 100644
index 0000000..a0e9c18
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/index.d.ts
@@ -0,0 +1,24 @@
+export * from './async-fifo-queue';
+export * from './backoffs';
+export * from './child';
+export * from './child-pool';
+export * from './child-processor';
+export * from './errors';
+export * from './flow-producer';
+export * from './ioredis-client';
+export * from './node-redis-client';
+export * from './bun-redis-client';
+export * from './job';
+export * from './job-scheduler';
+export * from './lock-manager';
+export * from './queue-base';
+export * from './queue-events';
+export * from './queue-events-producer';
+export * from './queue-getters';
+export * from './queue-keys';
+export * from './queue';
+export * from './redis-connection';
+export * from './repeat';
+export * from './sandbox';
+export * from './scripts';
+export * from './worker';
diff --git a/node_modules/bullmq/dist/esm/classes/index.js b/node_modules/bullmq/dist/esm/classes/index.js
new file mode 100644
index 0000000..ae30e75
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/index.js
@@ -0,0 +1,26 @@
+export * from './async-fifo-queue';
+export * from './backoffs';
+export * from './child';
+export * from './child-pool';
+export * from './child-processor';
+export * from './errors';
+export * from './flow-producer';
+export * from './ioredis-client';
+export * from './node-redis-client';
+export * from './bun-redis-client';
+export * from './job';
+export * from './job-scheduler';
+// export * from './main'; this file must not be exported
+// export * from './main-worker'; this file must not be exported
+export * from './lock-manager';
+export * from './queue-base';
+export * from './queue-events';
+export * from './queue-events-producer';
+export * from './queue-getters';
+export * from './queue-keys';
+export * from './queue';
+export * from './redis-connection';
+export * from './repeat';
+export * from './sandbox';
+export * from './scripts';
+export * from './worker';
diff --git a/node_modules/bullmq/dist/esm/classes/ioredis-client.d.ts b/node_modules/bullmq/dist/esm/classes/ioredis-client.d.ts
new file mode 100644
index 0000000..630fa9b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/ioredis-client.d.ts
@@ -0,0 +1,27 @@
+import { Cluster, Redis } from 'ioredis';
+import { IRedisClient } from '../interfaces/redis-client';
+/**
+ * Wraps an ioredis `Redis` / `Cluster` instance with a `Proxy` so it conforms
+ * to {@link IRedisClient}.
+ *
+ * For backwards compatibility BullMQ continues to accept a raw `IORedis`
+ * instance through tehe `connection` option, even though internally it relies
+ * on the `IRedisClient` adapter interface. The returned proxy:
+ *
+ *   - exposes `runCommand` (Lua script dispatch by name)
+ *   - exposes structured-options variants of `hset`, `set`, `zrange`,
+ *     `zrevrange`, `xadd`, `xread`, `xtrim`, `scan` (backward-compatible:
+ *     they still accept native ioredis varargs if called that way)
+ *   - returns augmented {@link IRedisTransaction}s from `pipeline()` / `multi()`
+ *   - wraps the result of `duplicate()` in a new proxy
+ *
+ * The underlying ioredis instance is **not** mutated. Properties and methods
+ * not in the override table are forwarded to the raw client via the proxy
+ * traps, with `this === target` so EventEmitter / Commander internals work
+ * normally.
+ */
+export declare function createIORedisClient<TClient extends Redis | Cluster>(client: TClient): TClient & IRedisClient;
+/**
+ * Check if an object already implements {@link IRedisClient}.
+ */
+export declare function isIRedisClient(obj: any): obj is IRedisClient;
diff --git a/node_modules/bullmq/dist/esm/classes/ioredis-client.js b/node_modules/bullmq/dist/esm/classes/ioredis-client.js
new file mode 100644
index 0000000..ceebd5e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/ioredis-client.js
@@ -0,0 +1,331 @@
+/**
+ * Per-raw-client cache so repeated calls to `createIORedisClient` with the
+ * same underlying ioredis instance return the same proxy. This preserves
+ * event-listener identity for the BullMQ-facing client.
+ */
+const proxyCache = new WeakMap();
+/**
+ * Wraps an ioredis `Redis` / `Cluster` instance with a `Proxy` so it conforms
+ * to {@link IRedisClient}.
+ *
+ * For backwards compatibility BullMQ continues to accept a raw `IORedis`
+ * instance through tehe `connection` option, even though internally it relies
+ * on the `IRedisClient` adapter interface. The returned proxy:
+ *
+ *   - exposes `runCommand` (Lua script dispatch by name)
+ *   - exposes structured-options variants of `hset`, `set`, `zrange`,
+ *     `zrevrange`, `xadd`, `xread`, `xtrim`, `scan` (backward-compatible:
+ *     they still accept native ioredis varargs if called that way)
+ *   - returns augmented {@link IRedisTransaction}s from `pipeline()` / `multi()`
+ *   - wraps the result of `duplicate()` in a new proxy
+ *
+ * The underlying ioredis instance is **not** mutated. Properties and methods
+ * not in the override table are forwarded to the raw client via the proxy
+ * traps, with `this === target` so EventEmitter / Commander internals work
+ * normally.
+ */
+export function createIORedisClient(client) {
+    // If the caller already passed a proxy produced by this function, return
+    // it as-is. Wrapping a proxy in a second proxy would defeat the WeakMap
+    // cache (the inner raw client is no longer reachable from the outer
+    // argument) and break listener-identity / equality checks for callers
+    // that hold on to the original wrapper.
+    if (client.__bullmq_iredis === true) {
+        return client;
+    }
+    const cached = proxyCache.get(client);
+    if (cached) {
+        return cached;
+    }
+    const isCluster = client.isCluster === true;
+    // Cache bound prototype methods so the returned function identity is
+    // stable across accesses (important for `once`/`removeListener` patterns).
+    const boundCache = new Map();
+    // Override table — properties returned by the proxy without touching the
+    // underlying ioredis instance. The arrow functions close over `client`
+    // directly so ioredis internals always see the raw instance as `this`.
+    const overrides = Object.create(null);
+    overrides.__bullmq_iredis = true;
+    overrides.isCluster = isCluster;
+    // Lua script engine.
+    overrides.runCommand = (name, args) => {
+        return client[name](args);
+    };
+    // Pipeline / Multi — wrap the ChainableCommander with structured overrides.
+    overrides.pipeline = (...args) => {
+        return augmentTransaction(client.pipeline(...args));
+    };
+    overrides.multi = (...args) => {
+        return augmentTransaction(client.multi(...args));
+    };
+    // duplicate — wrap the new raw client with a fresh proxy.
+    // ioredis Cluster.duplicate(startupNodes?, options?) expects connection
+    // options under `redisOptions`, while Redis.duplicate(options?) takes them
+    // at the top level. Normalise so callers can always pass `{ connectionName }`.
+    if (typeof client.duplicate === 'function') {
+        overrides.duplicate = (opts) => {
+            var _a;
+            if (isCluster) {
+                const existingRedisOpts = ((_a = client.options) === null || _a === void 0 ? void 0 : _a.redisOptions) || {};
+                const mergedRedisOpts = opts
+                    ? Object.assign(Object.assign({}, existingRedisOpts), opts) : existingRedisOpts;
+                return createIORedisClient(client.duplicate(undefined, {
+                    redisOptions: mergedRedisOpts,
+                }));
+            }
+            return createIORedisClient(client.duplicate(opts));
+        };
+    }
+    // --- Structured → ioredis varargs translations ---
+    // Each override accepts both the IRedisClient structured-options form and
+    // the native ioredis varargs form, dispatching by argument shape.
+    // hset: structured { f1: v1 } → ioredis hset(key, f1, v1, …)
+    overrides.hset = (key, dataOrField, ...rest) => {
+        if (typeof dataOrField === 'string') {
+            return client.hset(key, dataOrField, ...rest);
+        }
+        const args = [key];
+        for (const [f, v] of Object.entries(dataOrField)) {
+            args.push(f, v);
+        }
+        return client.hset(...args);
+    };
+    // set: structured { PX?: n } → ioredis set(key, value, 'PX', n)
+    overrides.set = (key, value, optionsOrModifier, ...rest) => {
+        if (typeof optionsOrModifier === 'string' || optionsOrModifier == null) {
+            return client.set(key, value, ...(optionsOrModifier != null ? [optionsOrModifier, ...rest] : []));
+        }
+        const args = [key, value];
+        if (optionsOrModifier.PX != null) {
+            args.push('PX', optionsOrModifier.PX);
+        }
+        else if (optionsOrModifier.EX != null) {
+            args.push('EX', optionsOrModifier.EX);
+        }
+        return client.set(...args);
+    };
+    // zrange: structured { WITHSCORES? } → ioredis zrange(key, start, end, 'WITHSCORES')
+    overrides.zrange = (key, start, end, optionsOrStr, ...rest) => {
+        if (typeof optionsOrStr === 'string') {
+            return client.zrange(key, start, end, optionsOrStr, ...rest);
+        }
+        if (optionsOrStr === null || optionsOrStr === void 0 ? void 0 : optionsOrStr.WITHSCORES) {
+            return client.zrange(key, start, end, 'WITHSCORES');
+        }
+        return client.zrange(key, start, end);
+    };
+    // zrevrange: structured { WITHSCORES? } → ioredis zrevrange(key, start, end, 'WITHSCORES')
+    overrides.zrevrange = (key, start, end, optionsOrStr, ...rest) => {
+        if (typeof optionsOrStr === 'string') {
+            return client.zrevrange(key, start, end, optionsOrStr, ...rest);
+        }
+        if (optionsOrStr === null || optionsOrStr === void 0 ? void 0 : optionsOrStr.WITHSCORES) {
+            return client.zrevrange(key, start, end, 'WITHSCORES');
+        }
+        return client.zrevrange(key, start, end);
+    };
+    // xadd: structured (key, id, { field: value }, { MAXLEN? }) → ioredis varargs
+    overrides.xadd = (key, idOrModifier, fieldsOrArg, ...rest) => {
+        if (typeof fieldsOrArg === 'string') {
+            return client.xadd(key, idOrModifier, fieldsOrArg, ...rest);
+        }
+        const options = rest[0];
+        const args = [key];
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            args.push('MAXLEN');
+            if (options.approximate !== false) {
+                args.push('~');
+            }
+            args.push(options.MAXLEN);
+        }
+        args.push(idOrModifier);
+        for (const [f, v] of Object.entries(fieldsOrArg)) {
+            args.push(f, v);
+        }
+        return client.xadd(...args);
+    };
+    // xread: structured ([{ key, id }], { BLOCK?, COUNT? }) → ioredis varargs
+    overrides.xread = (streamsOrModifier, ...rest) => {
+        if (typeof streamsOrModifier === 'string') {
+            return client.xread(streamsOrModifier, ...rest);
+        }
+        const options = rest[0];
+        const args = [];
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            args.push('BLOCK', options.BLOCK);
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', options.COUNT);
+        }
+        args.push('STREAMS');
+        for (const s of streamsOrModifier) {
+            args.push(s.key);
+        }
+        for (const s of streamsOrModifier) {
+            args.push(s.id);
+        }
+        return client.xread(...args);
+    };
+    // xtrim: structured (key, 'MAXLEN', threshold, { approximate? })
+    overrides.xtrim = (key, strategy, thresholdOrApprox, ...rest) => {
+        if (typeof thresholdOrApprox === 'string' || rest.length === 0) {
+            return client.xtrim(key, strategy, thresholdOrApprox, ...rest);
+        }
+        const options = rest[0];
+        const args = [key, strategy];
+        if ((options === null || options === void 0 ? void 0 : options.approximate) !== false) {
+            args.push('~');
+        }
+        args.push(thresholdOrApprox);
+        return client.xtrim(...args);
+    };
+    // bzpopmin is not overridden — ioredis already returns
+    // `[key, member, score]`, which matches IRedisClient.
+    // clientSetName / clientList helpers that forward to CLIENT subcommands.
+    overrides.clientSetName = (name) => client.client('SETNAME', name);
+    overrides.clientList = () => client.client('LIST');
+    // scan(cursor, { MATCH?, COUNT? }) — accepts either structured options or
+    // ioredis varargs (used internally by `scanStream`).
+    overrides.scan = (cursor, ...rest) => {
+        if (rest.length === 0 ||
+            typeof rest[0] === 'string' ||
+            typeof rest[0] === 'function') {
+            return client.scan(cursor, ...rest);
+        }
+        const options = rest[0];
+        const args = [cursor];
+        if ((options === null || options === void 0 ? void 0 : options.MATCH) != null) {
+            args.push('MATCH', options.MATCH);
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            args.push('COUNT', options.COUNT);
+        }
+        return client.scan(...args);
+    };
+    const proxy = new Proxy(client, {
+        get(target, prop) {
+            if (prop in overrides) {
+                return overrides[prop];
+            }
+            // Read against the raw target so getters on the prototype (e.g.
+            // ioredis' EventEmitter internals) see `this === target` rather than
+            // the proxy. This avoids infinite recursion through the proxy traps.
+            const value = Reflect.get(target, prop, target);
+            if (typeof value !== 'function') {
+                return value;
+            }
+            // Own properties (including ioredis commands installed via
+            // `defineCommand` and test-time spies set via `obj.method = spy`)
+            // are bound fresh on each access so reassignment is honoured.
+            if (Object.prototype.hasOwnProperty.call(target, prop)) {
+                return value.bind(target);
+            }
+            // Prototype methods (EventEmitter, Commander, ...) are cached so
+            // identity is stable across accesses.
+            const cachedBound = boundCache.get(prop);
+            if (cachedBound !== undefined) {
+                return cachedBound;
+            }
+            const bound = value.bind(target);
+            boundCache.set(prop, bound);
+            return bound;
+        },
+        set(target, prop, value) {
+            // Two assignment paths:
+            //   - Properties present in the override table are reassigned in the
+            //     table itself, so subsequent `get` traps return the new value
+            //     (used by sinon-style spies that stub `runCommand`, `pipeline`,
+            //     etc. on the proxy).
+            //   - All other properties are written through to the raw ioredis
+            //     instance via `Reflect.set`, and any stale bound-method entry is
+            //     invalidated so the next access rebinds the new function.
+            if (prop in overrides) {
+                overrides[prop] = value;
+                return true;
+            }
+            boundCache.delete(prop);
+            return Reflect.set(target, prop, value);
+        },
+        deleteProperty(target, prop) {
+            if (prop in overrides) {
+                return false;
+            }
+            boundCache.delete(prop);
+            return Reflect.deleteProperty(target, prop);
+        },
+        has(target, prop) {
+            return prop in overrides || Reflect.has(target, prop);
+        },
+    });
+    proxyCache.set(client, proxy);
+    return proxy;
+}
+/**
+ * Adds `runCommand` and structured overrides to an ioredis ChainableCommander
+ * so it satisfies {@link IRedisTransaction}.
+ */
+function augmentTransaction(commander) {
+    const transaction = commander;
+    transaction.runCommand = function (name, args) {
+        transaction[name](args);
+        return transaction;
+    };
+    // hset(key, { f1: v1 }) → ioredis pipeline.hset(key, f1, v1, …)
+    const origHset = transaction.hset.bind(transaction);
+    transaction.hset = function (key, data) {
+        const args = [key];
+        for (const [f, v] of Object.entries(data)) {
+            args.push(f, v);
+        }
+        origHset(...args);
+        return transaction;
+    };
+    // hscan(key, cursor, { COUNT? }) → ioredis hscan(key, cursor, 'COUNT', n)
+    const origHscan = transaction.hscan.bind(transaction);
+    transaction.hscan = function (key, cursor, options) {
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            origHscan(key, cursor, 'COUNT', options.COUNT);
+        }
+        else {
+            origHscan(key, cursor);
+        }
+        return transaction;
+    };
+    // sscan(key, cursor, { COUNT? })
+    const origSscan = transaction.sscan.bind(transaction);
+    transaction.sscan = function (key, cursor, options) {
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            origSscan(key, cursor, 'COUNT', options.COUNT);
+        }
+        else {
+            origSscan(key, cursor);
+        }
+        return transaction;
+    };
+    return transaction;
+}
+/**
+ * Check if an object already implements {@link IRedisClient}.
+ */
+export function isIRedisClient(obj) {
+    if (!obj || typeof obj !== 'object') {
+        return false;
+    }
+    // Fast path for ioredis instances already wrapped by `createIORedisClient`.
+    if (obj.__bullmq_iredis === true) {
+        return true;
+    }
+    // Fallback structural check for wrapper-based adapters
+    // (node-redis, Bun, or custom IRedisClient implementations).
+    return (typeof obj.runCommand === 'function' &&
+        typeof obj.defineCommand === 'function' &&
+        typeof obj.pipeline === 'function' &&
+        typeof obj.multi === 'function' &&
+        typeof obj.duplicate === 'function' &&
+        typeof obj.scanStream === 'function' &&
+        typeof obj.connect === 'function' &&
+        typeof obj.disconnect === 'function' &&
+        typeof obj.on === 'function' &&
+        typeof obj.status === 'string' &&
+        typeof obj.isCluster === 'boolean');
+}
diff --git a/node_modules/bullmq/dist/esm/classes/job-scheduler.d.ts b/node_modules/bullmq/dist/esm/classes/job-scheduler.d.ts
new file mode 100644
index 0000000..31f5730
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/job-scheduler.d.ts
@@ -0,0 +1,42 @@
+import { JobSchedulerJson, RepeatBaseOptions, RepeatOptions } from '../interfaces';
+import { JobSchedulerTemplateOptions } from '../types';
+import { Job } from './job';
+import { QueueBase } from './queue-base';
+import { RedisConnection } from './redis-connection';
+export declare class JobScheduler extends QueueBase {
+    private repeatStrategy;
+    constructor(name: string, opts: RepeatBaseOptions, Connection?: typeof RedisConnection);
+    upsertJobScheduler<T = any, R = any, N extends string = string>(jobSchedulerId: string, repeatOpts: Omit<RepeatOptions, 'key' | 'prevMillis'>, jobName: N, jobData: T, opts: JobSchedulerTemplateOptions, { override, producerId }: {
+        override: boolean;
+        producerId?: string;
+    }): Promise<Job<T, R, N> | undefined>;
+    private getNextJobOpts;
+    removeJobScheduler(jobSchedulerId: string): Promise<number>;
+    private getSchedulerData;
+    private transformSchedulerData;
+    private keyToData;
+    /**
+     * Checks if a given id corresponds to a registered job scheduler.
+     *
+     * This is used to disambiguate between new job scheduler ids (which may
+     * contain any number of colon segments) and legacy repeatable job keys
+     * (which always contain 5+ colon segments). Relying purely on segment
+     * count is not safe because a user-provided jobSchedulerId may itself
+     * contain 5+ colon segments, which would otherwise be misclassified as
+     * a legacy repeatable key.
+     *
+     * We cannot use ZSCORE on the shared `repeat` sorted set because legacy
+     * repeatable jobs are stored in the same sorted set and would be reported
+     * as schedulers. Instead, we probe the per-id metadata hash (`repeat:<id>`)
+     * for the `ic` (iteration count) field, which is written exclusively by
+     * `storeJobScheduler` and is never set by the legacy `addRepeatableJob`
+     * flow.
+     */
+    isJobScheduler(id: string): Promise<boolean>;
+    getScheduler<D = any>(id: string): Promise<JobSchedulerJson<D> | undefined>;
+    private getTemplateFromJSON;
+    getJobSchedulers<D = any>(start?: number, end?: number, asc?: boolean): Promise<JobSchedulerJson<D>[]>;
+    getSchedulersCount(): Promise<number>;
+    private getSchedulerNextJobId;
+}
+export declare const defaultRepeatStrategy: (millis: number, opts: RepeatOptions) => number | undefined;
diff --git a/node_modules/bullmq/dist/esm/classes/job-scheduler.js b/node_modules/bullmq/dist/esm/classes/job-scheduler.js
new file mode 100644
index 0000000..1b37787
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/job-scheduler.js
@@ -0,0 +1,265 @@
+import { __rest } from "tslib";
+import { parseExpression } from 'cron-parser';
+import { Job } from './job';
+import { QueueBase } from './queue-base';
+import { SpanKind, TelemetryAttributes } from '../enums';
+import { array2obj } from '../utils';
+export class JobScheduler extends QueueBase {
+    constructor(name, opts, Connection) {
+        super(name, opts, Connection);
+        this.repeatStrategy =
+            (opts.settings && opts.settings.repeatStrategy) || defaultRepeatStrategy;
+    }
+    async upsertJobScheduler(jobSchedulerId, repeatOpts, jobName, jobData, opts, { override, producerId }) {
+        const { every, limit, pattern, offset } = repeatOpts;
+        if (pattern && every) {
+            throw new Error('Both .pattern and .every options are defined for this repeatable job');
+        }
+        if (!pattern && !every) {
+            throw new Error('Either .pattern or .every options must be defined for this repeatable job');
+        }
+        if (repeatOpts.immediately && repeatOpts.startDate) {
+            throw new Error('Both .immediately and .startDate options are defined for this repeatable job');
+        }
+        if (repeatOpts.immediately && repeatOpts.every) {
+            console.warn("Using option immediately with every does not affect the job's schedule. Job will run immediately anyway.");
+        }
+        // Check if we reached the limit of the repeatable job's iterations
+        const iterationCount = repeatOpts.count ? repeatOpts.count + 1 : 1;
+        if (typeof repeatOpts.limit !== 'undefined' &&
+            iterationCount > repeatOpts.limit) {
+            return;
+        }
+        // Check if we reached the end date of the repeatable job
+        let now = Date.now();
+        const { endDate } = repeatOpts;
+        if (endDate && now > new Date(endDate).getTime()) {
+            return;
+        }
+        const prevMillis = opts.prevMillis || 0;
+        now = prevMillis < now ? now : prevMillis;
+        // Check if we have a start date for the repeatable job
+        const { immediately } = repeatOpts, filteredRepeatOpts = __rest(repeatOpts, ["immediately"]);
+        let nextMillis;
+        const newOffset = every && offset ? offset : null;
+        if (pattern) {
+            nextMillis = await this.repeatStrategy(now, repeatOpts, jobName);
+            if (nextMillis < now) {
+                nextMillis = now;
+            }
+        }
+        if (nextMillis || every) {
+            return this.trace(SpanKind.PRODUCER, 'add', `${this.name}.${jobName}`, async (span, srcPropagationMetadata) => {
+                var _a, _b;
+                let telemetry = opts.telemetry;
+                if (srcPropagationMetadata) {
+                    const omitContext = (_a = opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext;
+                    const telemetryMetadata = ((_b = opts.telemetry) === null || _b === void 0 ? void 0 : _b.metadata) ||
+                        (!omitContext && srcPropagationMetadata);
+                    if (telemetryMetadata || omitContext) {
+                        telemetry = {
+                            metadata: telemetryMetadata,
+                            omitContext,
+                        };
+                    }
+                }
+                const mergedOpts = this.getNextJobOpts(nextMillis, jobSchedulerId, Object.assign(Object.assign({}, opts), { repeat: filteredRepeatOpts, telemetry }), iterationCount, newOffset);
+                if (override) {
+                    // Clamp nextMillis to now if it's in the past
+                    if (nextMillis < now) {
+                        nextMillis = now;
+                    }
+                    const [jobId, delay] = await this.scripts.addJobScheduler(jobSchedulerId, nextMillis, JSON.stringify(typeof jobData === 'undefined' ? {} : jobData), Job.optsAsJSON(opts), {
+                        name: jobName,
+                        startDate: repeatOpts.startDate
+                            ? new Date(repeatOpts.startDate).getTime()
+                            : undefined,
+                        endDate: endDate ? new Date(endDate).getTime() : undefined,
+                        tz: repeatOpts.tz,
+                        pattern,
+                        every,
+                        limit,
+                        offset: newOffset,
+                    }, Job.optsAsJSON(mergedOpts), producerId);
+                    // Ensure delay is a number (Dragonflydb may return it as a string)
+                    const numericDelay = typeof delay === 'string' ? parseInt(delay, 10) : delay;
+                    const job = new this.Job(this, jobName, jobData, Object.assign(Object.assign({}, mergedOpts), { delay: numericDelay }), jobId);
+                    job.id = jobId;
+                    span === null || span === void 0 ? void 0 : span.setAttributes({
+                        [TelemetryAttributes.JobSchedulerId]: jobSchedulerId,
+                        [TelemetryAttributes.JobId]: job.id,
+                    });
+                    return job;
+                }
+                else {
+                    const jobId = await this.scripts.updateJobSchedulerNextMillis(jobSchedulerId, nextMillis, JSON.stringify(typeof jobData === 'undefined' ? {} : jobData), Job.optsAsJSON(mergedOpts), producerId);
+                    if (jobId) {
+                        const job = new this.Job(this, jobName, jobData, mergedOpts, jobId);
+                        job.id = jobId;
+                        span === null || span === void 0 ? void 0 : span.setAttributes({
+                            [TelemetryAttributes.JobSchedulerId]: jobSchedulerId,
+                            [TelemetryAttributes.JobId]: job.id,
+                        });
+                        return job;
+                    }
+                }
+            });
+        }
+    }
+    getNextJobOpts(nextMillis, jobSchedulerId, opts, currentCount, offset) {
+        var _a, _b;
+        //
+        // Generate unique job id for this iteration.
+        //
+        const jobId = this.getSchedulerNextJobId({
+            jobSchedulerId,
+            nextMillis,
+        });
+        const now = Date.now();
+        const delay = nextMillis + offset - now;
+        const mergedOpts = Object.assign(Object.assign({}, opts), { jobId, delay: delay < 0 ? 0 : delay, timestamp: now, prevMillis: nextMillis, repeatJobKey: jobSchedulerId });
+        mergedOpts.repeat = Object.assign(Object.assign({}, opts.repeat), { offset, count: currentCount, startDate: ((_a = opts.repeat) === null || _a === void 0 ? void 0 : _a.startDate)
+                ? new Date(opts.repeat.startDate).getTime()
+                : undefined, endDate: ((_b = opts.repeat) === null || _b === void 0 ? void 0 : _b.endDate)
+                ? new Date(opts.repeat.endDate).getTime()
+                : undefined });
+        return mergedOpts;
+    }
+    async removeJobScheduler(jobSchedulerId) {
+        return this.scripts.removeJobScheduler(jobSchedulerId);
+    }
+    async getSchedulerData(client, key, next) {
+        const jobData = await client.hgetall(this.toKey('repeat:' + key));
+        return this.transformSchedulerData(key, jobData, next);
+    }
+    transformSchedulerData(key, jobData, next) {
+        if (jobData && Object.keys(jobData).length > 0) {
+            const jobSchedulerData = {
+                key,
+                name: jobData.name,
+                next,
+            };
+            if (jobData.ic) {
+                jobSchedulerData.iterationCount = parseInt(jobData.ic);
+            }
+            if (jobData.limit) {
+                jobSchedulerData.limit = parseInt(jobData.limit);
+            }
+            if (jobData.startDate) {
+                jobSchedulerData.startDate = parseInt(jobData.startDate);
+            }
+            if (jobData.endDate) {
+                jobSchedulerData.endDate = parseInt(jobData.endDate);
+            }
+            if (jobData.tz) {
+                jobSchedulerData.tz = jobData.tz;
+            }
+            if (jobData.pattern) {
+                jobSchedulerData.pattern = jobData.pattern;
+            }
+            if (jobData.every) {
+                jobSchedulerData.every = parseInt(jobData.every);
+            }
+            if (jobData.offset) {
+                jobSchedulerData.offset = parseInt(jobData.offset);
+            }
+            if (jobData.data || jobData.opts) {
+                jobSchedulerData.template = this.getTemplateFromJSON(jobData.data, jobData.opts);
+            }
+            return jobSchedulerData;
+        }
+        // TODO: remove this check and keyToData as it is here only to support legacy code
+        if (key.includes(':')) {
+            return this.keyToData(key, next);
+        }
+    }
+    keyToData(key, next) {
+        const data = key.split(':');
+        const pattern = data.slice(4).join(':') || null;
+        return {
+            key,
+            name: data[0],
+            id: data[1] || null,
+            endDate: parseInt(data[2]) || null,
+            tz: data[3] || null,
+            pattern,
+            next,
+        };
+    }
+    /**
+     * Checks if a given id corresponds to a registered job scheduler.
+     *
+     * This is used to disambiguate between new job scheduler ids (which may
+     * contain any number of colon segments) and legacy repeatable job keys
+     * (which always contain 5+ colon segments). Relying purely on segment
+     * count is not safe because a user-provided jobSchedulerId may itself
+     * contain 5+ colon segments, which would otherwise be misclassified as
+     * a legacy repeatable key.
+     *
+     * We cannot use ZSCORE on the shared `repeat` sorted set because legacy
+     * repeatable jobs are stored in the same sorted set and would be reported
+     * as schedulers. Instead, we probe the per-id metadata hash (`repeat:<id>`)
+     * for the `ic` (iteration count) field, which is written exclusively by
+     * `storeJobScheduler` and is never set by the legacy `addRepeatableJob`
+     * flow.
+     */
+    async isJobScheduler(id) {
+        const client = await this.client;
+        const exists = await client.hexists(`${this.keys.repeat}:${id}`, 'ic');
+        return exists === 1;
+    }
+    async getScheduler(id) {
+        const [rawJobData, next] = await this.scripts.getJobScheduler(id);
+        return this.transformSchedulerData(id, rawJobData ? array2obj(rawJobData) : null, next ? parseInt(next) : null);
+    }
+    getTemplateFromJSON(rawData, rawOpts) {
+        const template = {};
+        if (rawData) {
+            template.data = JSON.parse(rawData);
+        }
+        if (rawOpts) {
+            template.opts = Job.optsFromJSON(rawOpts);
+        }
+        return template;
+    }
+    async getJobSchedulers(start = 0, end = -1, asc = false) {
+        const client = await this.client;
+        const jobSchedulersKey = this.keys.repeat;
+        const result = asc
+            ? await client.zrange(jobSchedulersKey, start, end, { WITHSCORES: true })
+            : await client.zrevrange(jobSchedulersKey, start, end, {
+                WITHSCORES: true,
+            });
+        const jobs = [];
+        for (let i = 0; i < result.length; i += 2) {
+            jobs.push(this.getSchedulerData(client, result[i], parseInt(result[i + 1])));
+        }
+        return Promise.all(jobs);
+    }
+    async getSchedulersCount() {
+        const jobSchedulersKey = this.keys.repeat;
+        const client = await this.client;
+        return client.zcard(jobSchedulersKey);
+    }
+    getSchedulerNextJobId({ nextMillis, jobSchedulerId, }) {
+        return `repeat:${jobSchedulerId}:${nextMillis}`;
+    }
+}
+export const defaultRepeatStrategy = (millis, opts) => {
+    const { pattern } = opts;
+    const dateFromMillis = new Date(millis);
+    const startDate = opts.startDate && new Date(opts.startDate);
+    const currentDate = startDate > dateFromMillis ? startDate : dateFromMillis;
+    const interval = parseExpression(pattern, Object.assign(Object.assign({}, opts), { currentDate }));
+    try {
+        if (opts.immediately) {
+            return new Date().getTime();
+        }
+        else {
+            return interval.next().getTime();
+        }
+    }
+    catch (e) {
+        // Ignore error
+    }
+};
diff --git a/node_modules/bullmq/dist/esm/classes/job.d.ts b/node_modules/bullmq/dist/esm/classes/job.d.ts
new file mode 100644
index 0000000..f352184
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/job.d.ts
@@ -0,0 +1,496 @@
+import { BulkJobOptions, DependenciesOpts, IRedisTransaction, JobJson, JobJsonRaw, MinimalJob, MinimalQueue, MoveToWaitingChildrenOpts, ParentKeys, ParentKeyOpts, RedisClient, RetryOptions } from '../interfaces';
+import { FinishedStatus, JobsOptions, JobState, JobJsonSandbox, RedisJobOptions, JobProgress } from '../types';
+import { Scripts } from './scripts';
+import type { QueueEvents } from './queue-events';
+export declare const PRIORITY_LIMIT: number;
+/**
+ * Job
+ *
+ * This class represents a Job in the queue. Normally job are implicitly created when
+ * you add a job to the queue with methods such as Queue.addJob( ... )
+ *
+ * A Job instance is also passed to the Worker's process function.
+ *
+ */
+export declare class Job<DataType = any, ReturnType = any, NameType extends string = string> implements MinimalJob<DataType, ReturnType, NameType> {
+    protected queue: MinimalQueue;
+    /**
+     * The name of the Job
+     */
+    name: NameType;
+    /**
+     * The payload for this job.
+     */
+    data: DataType;
+    /**
+     * The options object for this job.
+     */
+    opts: JobsOptions;
+    id?: string;
+    /**
+     * It includes the prefix, the namespace separator :, and queue name.
+     * @see {@link https://www.gnu.org/software/gawk/manual/html_node/Qualified-Names.html}
+     */
+    readonly queueQualifiedName: string;
+    /**
+     * The progress a job has performed so far.
+     * @defaultValue 0
+     */
+    progress: JobProgress;
+    /**
+     * The value returned by the processor when processing this job.
+     * @defaultValue null
+     */
+    returnvalue: ReturnType;
+    /**
+     * Stacktrace for the error (for failed jobs).
+     * @defaultValue null
+     */
+    stacktrace: string[] | null;
+    /**
+     * An amount of milliseconds to wait until this job can be processed.
+     * @defaultValue 0
+     */
+    delay: number;
+    /**
+     * Ranges from 0 (highest priority) to 2 097 152 (lowest priority). Note that
+     * using priorities has a slight impact on performance,
+     * so do not use it if not required.
+     * @defaultValue 0
+     */
+    priority: number;
+    /**
+     * Timestamp when the job was created (unless overridden with job options).
+     */
+    timestamp: number;
+    /**
+     * Number of attempts when job is moved to active.
+     * @defaultValue 0
+     */
+    attemptsStarted: number;
+    /**
+     * Number of attempts after the job has failed.
+     * @defaultValue 0
+     */
+    attemptsMade: number;
+    /**
+     * Number of times where job has stalled.
+     * @defaultValue 0
+     */
+    stalledCounter: number;
+    /**
+     * Reason for failing.
+     */
+    failedReason: string;
+    /**
+     * Deferred failure. Stores a failed message and marks this job to be failed directly
+     * as soon as the job is picked up by a worker, and using this string as the failed reason.
+     */
+    deferredFailure: string;
+    /**
+     * Timestamp for when the job finished (completed or failed).
+     */
+    finishedOn?: number;
+    /**
+     * Timestamp for when the job was processed.
+     */
+    processedOn?: number;
+    /**
+     * Fully qualified key (including the queue prefix) pointing to the parent of this job.
+     */
+    parentKey?: string;
+    /**
+     * Object that contains parentId (id) and parent queueKey.
+     */
+    parent?: ParentKeys;
+    /**
+     * Debounce identifier.
+     * @deprecated use deduplicationId
+     */
+    debounceId?: string;
+    /**
+     * Deduplication identifier.
+     */
+    deduplicationId?: string;
+    /**
+     * Base repeat job key.
+     */
+    repeatJobKey?: string;
+    /**
+     * Produced next repetable job Id.
+     *
+     */
+    nextRepeatableJobId?: string;
+    /**
+     * The token used for locking this job.
+     */
+    token?: string;
+    /**
+     * The worker name that is processing or processed this job.
+     */
+    processedBy?: string;
+    protected toKey: (type: string) => string;
+    /**
+     * @deprecated use UnrecoverableError
+     */
+    protected discarded: boolean;
+    protected scripts: Scripts;
+    constructor(queue: MinimalQueue, 
+    /**
+     * The name of the Job
+     */
+    name: NameType, 
+    /**
+     * The payload for this job.
+     */
+    data: DataType, 
+    /**
+     * The options object for this job.
+     */
+    opts?: JobsOptions, id?: string);
+    /**
+     * Creates a new job and adds it to the queue.
+     *
+     * @param queue - the queue where to add the job.
+     * @param name - the name of the job.
+     * @param data - the payload of the job.
+     * @param opts - the options bag for this job.
+     * @returns The created Job instance
+     */
+    static create<T = any, R = any, N extends string = string>(queue: MinimalQueue, name: N, data: T, opts?: JobsOptions): Promise<Job<T, R, N>>;
+    /**
+     * Creates a bulk of jobs and adds them atomically to the given queue.
+     *
+     * @param queue - the queue where to add the jobs.
+     * @param jobs - an array of jobs to be added to the queue.
+     * @returns The created Job instances
+     */
+    static createBulk<T = any, R = any, N extends string = string>(queue: MinimalQueue, jobs: {
+        name: N;
+        data: T;
+        opts?: BulkJobOptions;
+    }[]): Promise<Job<T, R, N>[]>;
+    /**
+     * Instantiates a Job from a JobJsonRaw object (coming from a deserialized JSON object)
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param json - the plain object containing the job.
+     * @param jobId - an optional job id (overrides the id coming from the JSON object)
+     * @returns A Job instance reconstructed from the JSON data
+     */
+    static fromJSON<T = any, R = any, N extends string = string>(queue: MinimalQueue, json: JobJsonRaw, jobId?: string): Job<T, R, N>;
+    protected createScripts(): void;
+    static optsFromJSON(rawOpts?: string, optsDecode?: Record<string, string>): JobsOptions;
+    /**
+     * Fetches a Job from the queue given the passed job id.
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param jobId - the job id.
+     * @returns
+     */
+    static fromId<T = any, R = any, N extends string = string>(queue: MinimalQueue, jobId: string): Promise<Job<T, R, N> | undefined>;
+    /**
+     * addJobLog
+     *
+     * @param queue - A minimal queue instance
+     * @param jobId - Job id
+     * @param logRow - String with a row of log data to be logged
+     * @param keepLogs - The optional amount of log entries to preserve
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    static addJobLog(queue: MinimalQueue, jobId: string, logRow: string, keepLogs?: number): Promise<number>;
+    toJSON(): Omit<this, "toJSON" | "scripts" | "prefix" | "queueName" | "moveToWaitingChildren" | "getChildrenValues" | "getIgnoredChildrenFailures" | "getDependenciesCount" | "getDependencies" | "addJob" | "removeDeduplicationKey" | "removeUnprocessedChildren" | "extendLock" | "updateData" | "updateProgress" | "removeChildDependency" | "getState" | "changeDelay" | "changePriority" | "moveToDelayed" | "promote" | "discard" | "queue" | "asJSON" | "asJSONSandbox" | "log" | "clearLogs" | "remove" | "moveToCompleted" | "moveToWait" | "moveToFailed" | "isCompleted" | "isFailed" | "isDelayed" | "isWaitingChildren" | "isActive" | "isWaiting" | "getFailedChildrenValues" | "waitUntilFinished" | "retry">;
+    /**
+     * Prepares a job to be serialized for storage in Redis.
+     * @returns
+     */
+    asJSON(): JobJson;
+    static optsAsJSON(opts?: JobsOptions, optsEncode?: Record<string, string>): RedisJobOptions;
+    /**
+     * Prepares a job to be passed to Sandbox.
+     * @returns
+     */
+    asJSONSandbox(): JobJsonSandbox;
+    /**
+     * Updates a job's data
+     *
+     * @param data - the data that will replace the current jobs data.
+     */
+    updateData(data: DataType): Promise<void>;
+    /**
+     * Updates a job's progress
+     *
+     * @param progress - number or object to be saved as progress.
+     */
+    updateProgress(progress: JobProgress): Promise<void>;
+    /**
+     * Logs one row of log data.
+     *
+     * @param logRow - string with log data to be logged.
+     * @returns The total number of log entries for this job so far.
+     */
+    log(logRow: string): Promise<number>;
+    /**
+     * Removes child dependency from parent when child is not yet finished
+     *
+     * @returns True if the relationship existed and if it was removed.
+     */
+    removeChildDependency(): Promise<boolean>;
+    /**
+     * Clears job's logs
+     *
+     * @param keepLogs - the amount of log entries to preserve
+     */
+    clearLogs(keepLogs?: number): Promise<void>;
+    /**
+     * Completely remove the job from the queue.
+     * Note, this call will throw an exception if the job
+     * is being processed when the call is performed.
+     *
+     * @param opts - Options to remove a job
+     */
+    remove({ removeChildren }?: {
+        removeChildren?: boolean;
+    }): Promise<void>;
+    /**
+     * Remove all children from this job that are not yet processed,
+     * in other words that are in any other state than completed, failed or active.
+     *
+     * @remarks
+     *  - Jobs with locks (most likely active) are ignored.
+     *  - This method can be slow if the number of children is large (\> 1000).
+     */
+    removeUnprocessedChildren(): Promise<void>;
+    /**
+     * Extend the lock for this job.
+     *
+     * @param token - unique token for the lock
+     * @param duration - lock duration in milliseconds
+     */
+    extendLock(token: string, duration: number): Promise<number>;
+    /**
+     * Moves a job to the completed queue.
+     * Returned job to be used with Queue.prototype.nextJobFromJobData.
+     *
+     * @param returnValue - The jobs success message.
+     * @param token - Worker token used to acquire completed job.
+     * @param fetchNext - True when wanting to fetch the next job.
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    moveToCompleted(returnValue: ReturnType, token: string, fetchNext?: boolean): Promise<void | any[]>;
+    /**
+     * Moves a job to the wait or prioritized state.
+     *
+     * @param token - Worker token used to acquire completed job.
+     * @returns Returns pttl.
+     */
+    moveToWait(token?: string): Promise<number>;
+    private shouldRetryJob;
+    /**
+     * Moves a job to the failed queue.
+     *
+     * @param err - the jobs error message.
+     * @param token - token to check job is locked by current worker
+     * @param fetchNext - true when wanting to fetch the next job
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    moveToFailed<E extends Error>(err: E, token: string, fetchNext?: boolean): Promise<void | any[]>;
+    private getSpanOperation;
+    /**
+     * Records job metrics if a meter is configured in telemetry options.
+     *
+     * @param status - The job status
+     */
+    private recordJobMetrics;
+    /**
+     * @returns true if the job has completed.
+     */
+    isCompleted(): Promise<boolean>;
+    /**
+     * @returns true if the job has failed.
+     */
+    isFailed(): Promise<boolean>;
+    /**
+     * @returns true if the job is delayed.
+     */
+    isDelayed(): Promise<boolean>;
+    /**
+     * @returns true if the job is waiting for children.
+     */
+    isWaitingChildren(): Promise<boolean>;
+    /**
+     * @returns true of the job is active.
+     */
+    isActive(): Promise<boolean>;
+    /**
+     * @returns true if the job is waiting.
+     */
+    isWaiting(): Promise<boolean>;
+    /**
+     * @returns the queue name this job belongs to.
+     */
+    get queueName(): string;
+    /**
+     * @returns the prefix that is used.
+     */
+    get prefix(): string;
+    /**
+     * Get current state.
+     *
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getState(): Promise<JobState | 'unknown'>;
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns void
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    changeDelay(delay: number): Promise<void>;
+    /**
+     * Change job priority.
+     *
+     * @param opts - options containing priority and lifo values.
+     * @returns void
+     */
+    changePriority(opts: {
+        priority?: number;
+        lifo?: boolean;
+    }): Promise<void>;
+    /**
+     * Get this jobs children result values if any.
+     *
+     * @returns Object mapping children job keys with their values.
+     */
+    getChildrenValues<CT = any>(): Promise<{
+        [jobKey: string]: CT;
+    }>;
+    /**
+     * Retrieves the failures of child jobs that were explicitly ignored while using ignoreDependencyOnFailure option.
+     * This method is useful for inspecting which child jobs were intentionally ignored when an error occurred.
+     * @see {@link https://docs.bullmq.io/guide/flows/ignore-dependency}
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    getIgnoredChildrenFailures(): Promise<{
+        [jobKey: string]: string;
+    }>;
+    /**
+     * Get job's children failure values that were ignored if any.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getIgnoredChildrenFailures instead.
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    getFailedChildrenValues(): Promise<{
+        [jobKey: string]: string;
+    }>;
+    /**
+     * Get children job keys if this job is a parent and has children.
+     * @remarks
+     * Count options before Redis v7.2 works as expected with any quantity of entries
+     * on processed/unprocessed dependencies, since v7.2 you must consider that count
+     * won't have any effect until processed/unprocessed dependencies have a length
+     * greater than 127
+     * @see {@link https://redis.io/docs/management/optimization/memory-optimization/#redis--72}
+     * @see {@link https://docs.bullmq.io/guide/flows#getters}
+     * @returns dependencies separated by processed, unprocessed, ignored and failed.
+     */
+    getDependencies(opts?: DependenciesOpts): Promise<{
+        nextFailedCursor?: number;
+        failed?: string[];
+        nextIgnoredCursor?: number;
+        ignored?: Record<string, any>;
+        nextProcessedCursor?: number;
+        processed?: Record<string, any>;
+        nextUnprocessedCursor?: number;
+        unprocessed?: string[];
+    }>;
+    /**
+     * Get children job counts if this job is a parent and has children.
+     *
+     * @returns dependencies count separated by processed, unprocessed, ignored and failed.
+     */
+    getDependenciesCount(opts?: {
+        failed?: boolean;
+        ignored?: boolean;
+        processed?: boolean;
+        unprocessed?: boolean;
+    }): Promise<{
+        failed?: number;
+        ignored?: number;
+        processed?: number;
+        unprocessed?: number;
+    }>;
+    /**
+     * Returns a promise the resolves when the job has completed (containing the return value of the job),
+     * or rejects when the job has failed (containing the failedReason).
+     *
+     * @param queueEvents - Instance of QueueEvents.
+     * @param ttl - Time in milliseconds to wait for job to finish before timing out.
+     */
+    waitUntilFinished(queueEvents: QueueEvents, ttl?: number): Promise<ReturnType>;
+    /**
+     * Moves the job to the delay set.
+     *
+     * @param timestamp - timestamp when the job should be moved back to "wait"
+     * @param token - token to check job is locked by current worker
+     * @returns
+     */
+    moveToDelayed(timestamp: number, token?: string): Promise<void>;
+    /**
+     * Moves the job to the waiting-children set.
+     *
+     * @param token - Token to check job is locked by current worker
+     * @param opts - The options bag for moving a job to waiting-children.
+     * @returns true if the job was moved
+     */
+    moveToWaitingChildren(token: string, opts?: MoveToWaitingChildrenOpts): Promise<boolean>;
+    /**
+     * Promotes a delayed job so that it starts to be processed as soon as possible.
+     */
+    promote(): Promise<void>;
+    /**
+     * Attempts to retry the job. Only a job that has failed or completed can be retried.
+     *
+     * @param state - completed / failed
+     * @param opts - options to retry a job
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * The queue emits a waiting event when the job is successfully moved.
+     * @throws Will throw an error if the job does not exist, is locked, or is not in the expected state.
+     */
+    retry(state?: FinishedStatus, opts?: RetryOptions): Promise<void>;
+    /**
+     * Marks a job to not be retried if it fails (even if attempts has been configured)
+     * @deprecated use UnrecoverableError
+     */
+    discard(): void;
+    private isInZSet;
+    private isInList;
+    /**
+     * Adds the job to Redis.
+     *
+     * @param client - The Redis client to use for adding the job.
+     * @param parentOpts - Options for the parent-child relationship.
+     * @returns The job ID
+     */
+    addJob(client: RedisClient | IRedisTransaction, parentOpts?: ParentKeyOpts): Promise<string>;
+    /**
+     * Removes a deduplication key if job is still the cause of deduplication.
+     * @returns true if the deduplication key was removed.
+     */
+    removeDeduplicationKey(): Promise<boolean>;
+    protected validateOptions(jobData: JobJson): void;
+    protected updateStacktrace(err: Error): void;
+    private setSpanJobAttributes;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/job.js b/node_modules/bullmq/dist/esm/classes/job.js
new file mode 100644
index 0000000..432e175
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/job.js
@@ -0,0 +1,1120 @@
+import { __rest } from "tslib";
+import { debuglog } from 'util';
+import { errorObject, isEmpty, getParentKey, lengthInUtf8Bytes, optsDecodeMap, optsEncodeMap, parseObjectValues, tryCatch, removeUndefinedFields, } from '../utils';
+import { createScripts } from '../utils/create-scripts';
+import { Backoffs } from './backoffs';
+import { UnrecoverableError } from './errors/unrecoverable-error';
+import { SpanKind, TelemetryAttributes, MetricNames } from '../enums';
+const logger = debuglog('bull');
+export const PRIORITY_LIMIT = 2 ** 21;
+/**
+ * Job
+ *
+ * This class represents a Job in the queue. Normally job are implicitly created when
+ * you add a job to the queue with methods such as Queue.addJob( ... )
+ *
+ * A Job instance is also passed to the Worker's process function.
+ *
+ */
+export class Job {
+    constructor(queue, 
+    /**
+     * The name of the Job
+     */
+    name, 
+    /**
+     * The payload for this job.
+     */
+    data, 
+    /**
+     * The options object for this job.
+     */
+    opts = {}, id) {
+        this.queue = queue;
+        this.name = name;
+        this.data = data;
+        this.opts = opts;
+        this.id = id;
+        /**
+         * The progress a job has performed so far.
+         * @defaultValue 0
+         */
+        this.progress = 0;
+        /**
+         * The value returned by the processor when processing this job.
+         * @defaultValue null
+         */
+        this.returnvalue = null;
+        /**
+         * Stacktrace for the error (for failed jobs).
+         * @defaultValue null
+         */
+        this.stacktrace = null;
+        /**
+         * An amount of milliseconds to wait until this job can be processed.
+         * @defaultValue 0
+         */
+        this.delay = 0;
+        /**
+         * Ranges from 0 (highest priority) to 2 097 152 (lowest priority). Note that
+         * using priorities has a slight impact on performance,
+         * so do not use it if not required.
+         * @defaultValue 0
+         */
+        this.priority = 0;
+        /**
+         * Number of attempts when job is moved to active.
+         * @defaultValue 0
+         */
+        this.attemptsStarted = 0;
+        /**
+         * Number of attempts after the job has failed.
+         * @defaultValue 0
+         */
+        this.attemptsMade = 0;
+        /**
+         * Number of times where job has stalled.
+         * @defaultValue 0
+         */
+        this.stalledCounter = 0;
+        const _a = this.opts, { repeatJobKey } = _a, restOpts = __rest(_a, ["repeatJobKey"]);
+        this.opts = Object.assign({
+            attempts: 0,
+        }, restOpts);
+        this.delay = this.opts.delay;
+        this.priority = this.opts.priority || 0;
+        this.repeatJobKey = repeatJobKey;
+        this.timestamp = opts.timestamp ? opts.timestamp : Date.now();
+        this.opts.backoff = Backoffs.normalize(opts.backoff);
+        this.parentKey = getParentKey(opts.parent);
+        if (opts.parent) {
+            this.parent = { id: opts.parent.id, queueKey: opts.parent.queue };
+            if (opts.failParentOnFailure) {
+                this.parent.fpof = true;
+            }
+            if (opts.removeDependencyOnFailure) {
+                this.parent.rdof = true;
+            }
+            if (opts.ignoreDependencyOnFailure) {
+                this.parent.idof = true;
+            }
+            if (opts.continueParentOnFailure) {
+                this.parent.cpof = true;
+            }
+        }
+        this.debounceId = opts.debounce ? opts.debounce.id : undefined;
+        this.deduplicationId = opts.deduplication
+            ? opts.deduplication.id
+            : this.debounceId;
+        this.toKey = queue.toKey.bind(queue);
+        this.createScripts();
+        this.queueQualifiedName = queue.qualifiedName;
+    }
+    /**
+     * Creates a new job and adds it to the queue.
+     *
+     * @param queue - the queue where to add the job.
+     * @param name - the name of the job.
+     * @param data - the payload of the job.
+     * @param opts - the options bag for this job.
+     * @returns The created Job instance
+     */
+    static async create(queue, name, data, opts) {
+        const client = await queue.client;
+        const job = new this(queue, name, data, opts, opts && opts.jobId);
+        job.id = await job.addJob(client, {
+            parentKey: job.parentKey,
+            parentDependenciesKey: job.parentKey
+                ? `${job.parentKey}:dependencies`
+                : '',
+        });
+        return job;
+    }
+    /**
+     * Creates a bulk of jobs and adds them atomically to the given queue.
+     *
+     * @param queue - the queue where to add the jobs.
+     * @param jobs - an array of jobs to be added to the queue.
+     * @returns The created Job instances
+     */
+    static async createBulk(queue, jobs) {
+        const client = await queue.client;
+        const jobInstances = jobs.map(job => { var _a; return new this(queue, job.name, job.data, job.opts, (_a = job.opts) === null || _a === void 0 ? void 0 : _a.jobId); });
+        const pipeline = client.pipeline();
+        for (const job of jobInstances) {
+            job.addJob(pipeline, {
+                parentKey: job.parentKey,
+                parentDependenciesKey: job.parentKey
+                    ? `${job.parentKey}:dependencies`
+                    : '',
+            });
+        }
+        const results = (await pipeline.exec());
+        for (let index = 0; index < results.length; ++index) {
+            const [err, id] = results[index];
+            if (err) {
+                throw err;
+            }
+            jobInstances[index].id = id;
+        }
+        return jobInstances;
+    }
+    /**
+     * Instantiates a Job from a JobJsonRaw object (coming from a deserialized JSON object)
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param json - the plain object containing the job.
+     * @param jobId - an optional job id (overrides the id coming from the JSON object)
+     * @returns A Job instance reconstructed from the JSON data
+     */
+    static fromJSON(queue, json, jobId) {
+        const data = JSON.parse(json.data || '{}');
+        const opts = Job.optsFromJSON(json.opts);
+        const job = new this(queue, json.name, data, opts, json.id || jobId);
+        job.progress = JSON.parse(json.progress || '0');
+        job.delay = parseInt(json.delay);
+        job.priority = parseInt(json.priority);
+        job.timestamp = parseInt(json.timestamp);
+        if (json.finishedOn) {
+            job.finishedOn = parseInt(json.finishedOn);
+        }
+        if (json.processedOn) {
+            job.processedOn = parseInt(json.processedOn);
+        }
+        if (json.rjk) {
+            job.repeatJobKey = json.rjk;
+        }
+        if (json.deid) {
+            job.debounceId = json.deid;
+            job.deduplicationId = json.deid;
+        }
+        if (json.failedReason) {
+            job.failedReason = json.failedReason;
+        }
+        job.attemptsStarted = parseInt(json.ats || '0');
+        job.attemptsMade = parseInt(json.attemptsMade || json.atm || '0');
+        job.stalledCounter = parseInt(json.stc || '0');
+        if (json.defa) {
+            job.deferredFailure = json.defa;
+        }
+        job.stacktrace = getTraces(json.stacktrace);
+        if (typeof json.returnvalue === 'string') {
+            job.returnvalue = getReturnValue(json.returnvalue);
+        }
+        if (json.parentKey) {
+            job.parentKey = json.parentKey;
+        }
+        else {
+            job.parentKey = undefined;
+        }
+        if (json.parent) {
+            job.parent = JSON.parse(json.parent);
+        }
+        else {
+            job.parent = undefined;
+        }
+        if (json.pb) {
+            job.processedBy = json.pb;
+        }
+        if (json.nrjid) {
+            job.nextRepeatableJobId = json.nrjid;
+        }
+        return job;
+    }
+    createScripts() {
+        this.scripts = createScripts(this.queue);
+    }
+    static optsFromJSON(rawOpts, optsDecode = optsDecodeMap) {
+        const opts = JSON.parse(rawOpts || '{}');
+        const optionEntries = Object.entries(opts);
+        const options = {};
+        for (const item of optionEntries) {
+            const [attributeName, value] = item;
+            if (optsDecode[attributeName]) {
+                options[optsDecode[attributeName]] =
+                    value;
+            }
+            else {
+                if (attributeName === 'tm') {
+                    options.telemetry = Object.assign(Object.assign({}, options.telemetry), { metadata: value });
+                }
+                else if (attributeName === 'omc') {
+                    options.telemetry = Object.assign(Object.assign({}, options.telemetry), { omitContext: value });
+                }
+                else {
+                    options[attributeName] = value;
+                }
+            }
+        }
+        return options;
+    }
+    /**
+     * Fetches a Job from the queue given the passed job id.
+     *
+     * @param queue - the queue where the job belongs to.
+     * @param jobId - the job id.
+     * @returns
+     */
+    static async fromId(queue, jobId) {
+        // jobId can be undefined if moveJob returns undefined
+        if (jobId) {
+            const client = await queue.client;
+            const jobData = await client.hgetall(queue.toKey(jobId));
+            return isEmpty(jobData)
+                ? undefined
+                : this.fromJSON(queue, jobData, jobId);
+        }
+    }
+    /**
+     * addJobLog
+     *
+     * @param queue - A minimal queue instance
+     * @param jobId - Job id
+     * @param logRow - String with a row of log data to be logged
+     * @param keepLogs - The optional amount of log entries to preserve
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    static addJobLog(queue, jobId, logRow, keepLogs) {
+        const scripts = queue.scripts;
+        return scripts.addLog(jobId, logRow, keepLogs);
+    }
+    toJSON() {
+        const _a = this, { queue, scripts } = _a, withoutQueueAndScripts = __rest(_a, ["queue", "scripts"]);
+        return withoutQueueAndScripts;
+    }
+    /**
+     * Prepares a job to be serialized for storage in Redis.
+     * @returns
+     */
+    asJSON() {
+        return removeUndefinedFields({
+            id: this.id,
+            name: this.name,
+            data: JSON.stringify(typeof this.data === 'undefined' ? {} : this.data),
+            opts: Job.optsAsJSON(this.opts),
+            parent: this.parent ? Object.assign({}, this.parent) : undefined,
+            parentKey: this.parentKey,
+            progress: this.progress,
+            attemptsMade: this.attemptsMade,
+            attemptsStarted: this.attemptsStarted,
+            stalledCounter: this.stalledCounter,
+            finishedOn: this.finishedOn,
+            processedOn: this.processedOn,
+            timestamp: this.timestamp,
+            failedReason: JSON.stringify(this.failedReason),
+            stacktrace: JSON.stringify(this.stacktrace),
+            debounceId: this.debounceId,
+            deduplicationId: this.deduplicationId,
+            repeatJobKey: this.repeatJobKey,
+            returnvalue: JSON.stringify(this.returnvalue),
+            nrjid: this.nextRepeatableJobId,
+        });
+    }
+    static optsAsJSON(opts = {}, optsEncode = optsEncodeMap) {
+        const optionEntries = Object.entries(opts);
+        const options = {};
+        for (const [attributeName, value] of optionEntries) {
+            if (typeof value === 'undefined') {
+                continue;
+            }
+            if (attributeName in optsEncode) {
+                const compressableAttribute = attributeName;
+                const key = optsEncode[compressableAttribute];
+                options[key] = value;
+            }
+            else {
+                // Handle complex compressable fields separately
+                if (attributeName === 'telemetry') {
+                    if (value.metadata !== undefined) {
+                        options.tm = value.metadata;
+                    }
+                    if (value.omitContext !== undefined) {
+                        options.omc = value.omitContext;
+                    }
+                }
+                else {
+                    options[attributeName] = value;
+                }
+            }
+        }
+        return options;
+    }
+    /**
+     * Prepares a job to be passed to Sandbox.
+     * @returns
+     */
+    asJSONSandbox() {
+        return Object.assign(Object.assign({}, this.asJSON()), { queueName: this.queueName, queueQualifiedName: this.queueQualifiedName, prefix: this.prefix });
+    }
+    /**
+     * Updates a job's data
+     *
+     * @param data - the data that will replace the current jobs data.
+     */
+    updateData(data) {
+        this.data = data;
+        return this.scripts.updateData(this, data);
+    }
+    /**
+     * Updates a job's progress
+     *
+     * @param progress - number or object to be saved as progress.
+     */
+    async updateProgress(progress) {
+        this.progress = progress;
+        await this.scripts.updateProgress(this.id, progress);
+        this.queue.emit('progress', this, progress);
+    }
+    /**
+     * Logs one row of log data.
+     *
+     * @param logRow - string with log data to be logged.
+     * @returns The total number of log entries for this job so far.
+     */
+    async log(logRow) {
+        return Job.addJobLog(this.queue, this.id, logRow, this.opts.keepLogs);
+    }
+    /**
+     * Removes child dependency from parent when child is not yet finished
+     *
+     * @returns True if the relationship existed and if it was removed.
+     */
+    async removeChildDependency() {
+        const childDependencyIsRemoved = await this.scripts.removeChildDependency(this.id, this.parentKey);
+        if (childDependencyIsRemoved) {
+            this.parent = undefined;
+            this.parentKey = undefined;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Clears job's logs
+     *
+     * @param keepLogs - the amount of log entries to preserve
+     */
+    async clearLogs(keepLogs) {
+        const client = await this.queue.client;
+        const logsKey = this.toKey(this.id) + ':logs';
+        if (keepLogs) {
+            await client.ltrim(logsKey, -keepLogs, -1);
+        }
+        else {
+            await client.del(logsKey);
+        }
+    }
+    /**
+     * Completely remove the job from the queue.
+     * Note, this call will throw an exception if the job
+     * is being processed when the call is performed.
+     *
+     * @param opts - Options to remove a job
+     */
+    async remove({ removeChildren = true } = {}) {
+        await this.queue.waitUntilReady();
+        const queue = this.queue;
+        const job = this;
+        const removed = await this.scripts.remove(job.id, removeChildren);
+        if (removed) {
+            queue.emit('removed', job);
+        }
+        else {
+            throw new Error(`Job ${this.id} could not be removed because it is locked by another worker`);
+        }
+    }
+    /**
+     * Remove all children from this job that are not yet processed,
+     * in other words that are in any other state than completed, failed or active.
+     *
+     * @remarks
+     *  - Jobs with locks (most likely active) are ignored.
+     *  - This method can be slow if the number of children is large (\> 1000).
+     */
+    async removeUnprocessedChildren() {
+        const jobId = this.id;
+        await this.scripts.removeUnprocessedChildren(jobId);
+    }
+    /**
+     * Extend the lock for this job.
+     *
+     * @param token - unique token for the lock
+     * @param duration - lock duration in milliseconds
+     */
+    extendLock(token, duration) {
+        return this.scripts.extendLock(this.id, token, duration);
+    }
+    /**
+     * Moves a job to the completed queue.
+     * Returned job to be used with Queue.prototype.nextJobFromJobData.
+     *
+     * @param returnValue - The jobs success message.
+     * @param token - Worker token used to acquire completed job.
+     * @param fetchNext - True when wanting to fetch the next job.
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    async moveToCompleted(returnValue, token, fetchNext = true) {
+        return this.queue.trace(SpanKind.INTERNAL, 'complete', this.queue.name, async (span) => {
+            this.setSpanJobAttributes(span);
+            await this.queue.waitUntilReady();
+            this.returnvalue = returnValue || void 0;
+            const stringifiedReturnValue = tryCatch(JSON.stringify, JSON, [
+                returnValue,
+            ]);
+            if (stringifiedReturnValue === errorObject) {
+                throw errorObject.value;
+            }
+            const args = this.scripts.moveToCompletedArgs(this, stringifiedReturnValue, this.opts.removeOnComplete, token, fetchNext);
+            const result = await this.scripts.moveToFinished(this.id, args);
+            this.finishedOn = args[this.scripts.moveToFinishedKeys.length + 1];
+            this.attemptsMade += 1;
+            this.recordJobMetrics('completed');
+            return result;
+        });
+    }
+    /**
+     * Moves a job to the wait or prioritized state.
+     *
+     * @param token - Worker token used to acquire completed job.
+     * @returns Returns pttl.
+     */
+    async moveToWait(token) {
+        const result = await this.scripts.moveJobFromActiveToWait(this.id, token);
+        this.recordJobMetrics('waiting');
+        return result;
+    }
+    async shouldRetryJob(err) {
+        if (this.attemptsMade + 1 < this.opts.attempts &&
+            !this.discarded &&
+            !(err instanceof UnrecoverableError || err.name == 'UnrecoverableError')) {
+            const opts = this.queue.opts;
+            const delay = await Backoffs.calculate(this.opts.backoff, this.attemptsMade + 1, err, this, opts.settings && opts.settings.backoffStrategy);
+            return [delay == -1 ? false : true, delay == -1 ? 0 : delay];
+        }
+        else {
+            return [false, 0];
+        }
+    }
+    /**
+     * Moves a job to the failed queue.
+     *
+     * @param err - the jobs error message.
+     * @param token - token to check job is locked by current worker
+     * @param fetchNext - true when wanting to fetch the next job
+     * @returns Returns the jobData of the next job in the waiting queue or void.
+     */
+    async moveToFailed(err, token, fetchNext = false) {
+        this.failedReason = err === null || err === void 0 ? void 0 : err.message;
+        // Check if an automatic retry should be performed
+        const [shouldRetry, retryDelay] = await this.shouldRetryJob(err);
+        return this.queue.trace(SpanKind.INTERNAL, this.getSpanOperation(shouldRetry, retryDelay), this.queue.name, async (span, dstPropagationMetadata) => {
+            var _a, _b;
+            this.setSpanJobAttributes(span);
+            let tm;
+            if (!((_b = (_a = this.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.omitContext) && dstPropagationMetadata) {
+                tm = dstPropagationMetadata;
+            }
+            let result;
+            this.updateStacktrace(err);
+            const fieldsToUpdate = {
+                failedReason: this.failedReason,
+                stacktrace: JSON.stringify(this.stacktrace),
+                tm,
+            };
+            let finishedOn;
+            if (shouldRetry) {
+                if (retryDelay) {
+                    // Retry with delay
+                    result = await this.scripts.moveToDelayed(this.id, Date.now(), retryDelay, token, { fieldsToUpdate, fetchNext });
+                    this.recordJobMetrics('delayed');
+                }
+                else {
+                    // Retry immediately
+                    result = await this.scripts.retryJob(this.id, this.opts.lifo, token, {
+                        fieldsToUpdate,
+                    });
+                    this.recordJobMetrics('retried');
+                }
+            }
+            else {
+                const args = this.scripts.moveToFailedArgs(this, this.failedReason, this.opts.removeOnFail, token, fetchNext, fieldsToUpdate);
+                result = await this.scripts.moveToFinished(this.id, args);
+                finishedOn = args[this.scripts.moveToFinishedKeys.length + 1];
+                // Only record failed metrics when job is not retrying
+                this.recordJobMetrics('failed');
+            }
+            if (finishedOn && typeof finishedOn === 'number') {
+                this.finishedOn = finishedOn;
+            }
+            if (retryDelay && typeof retryDelay === 'number') {
+                this.delay = retryDelay;
+            }
+            this.attemptsMade += 1;
+            return result;
+        });
+    }
+    getSpanOperation(shouldRetry, retryDelay) {
+        if (shouldRetry) {
+            if (retryDelay) {
+                return 'delay';
+            }
+            return 'retry';
+        }
+        return 'fail';
+    }
+    /**
+     * Records job metrics if a meter is configured in telemetry options.
+     *
+     * @param status - The job status
+     */
+    recordJobMetrics(status) {
+        var _a, _b;
+        const meter = (_b = (_a = this.queue.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.meter;
+        if (!meter) {
+            return;
+        }
+        const attributes = {
+            [TelemetryAttributes.QueueName]: this.queue.name,
+            [TelemetryAttributes.JobName]: this.name,
+            [TelemetryAttributes.JobStatus]: status,
+        };
+        // Record counter metric based on status
+        const statusToCounterName = {
+            completed: MetricNames.JobsCompleted,
+            failed: MetricNames.JobsFailed,
+            delayed: MetricNames.JobsDelayed,
+            retried: MetricNames.JobsRetried,
+            waiting: MetricNames.JobsWaiting,
+            'waiting-children': MetricNames.JobsWaitingChildren,
+        };
+        const counterName = statusToCounterName[status];
+        const counter = meter.createCounter(counterName, {
+            description: `Number of jobs ${status}`,
+            unit: '1',
+        });
+        counter.add(1, attributes);
+        // Record duration histogram if processedOn is available
+        if (this.processedOn) {
+            const duration = Date.now() - this.processedOn;
+            const histogram = meter.createHistogram(MetricNames.JobDuration, {
+                description: 'Job processing duration',
+                unit: 'ms',
+            });
+            histogram.record(duration, attributes);
+        }
+    }
+    /**
+     * @returns true if the job has completed.
+     */
+    isCompleted() {
+        return this.isInZSet('completed');
+    }
+    /**
+     * @returns true if the job has failed.
+     */
+    isFailed() {
+        return this.isInZSet('failed');
+    }
+    /**
+     * @returns true if the job is delayed.
+     */
+    isDelayed() {
+        return this.isInZSet('delayed');
+    }
+    /**
+     * @returns true if the job is waiting for children.
+     */
+    isWaitingChildren() {
+        return this.isInZSet('waiting-children');
+    }
+    /**
+     * @returns true of the job is active.
+     */
+    isActive() {
+        return this.isInList('active');
+    }
+    /**
+     * @returns true if the job is waiting.
+     */
+    async isWaiting() {
+        return (await this.isInList('wait')) || (await this.isInList('paused'));
+    }
+    /**
+     * @returns the queue name this job belongs to.
+     */
+    get queueName() {
+        return this.queue.name;
+    }
+    /**
+     * @returns the prefix that is used.
+     */
+    get prefix() {
+        return this.queue.opts.prefix;
+    }
+    /**
+     * Get current state.
+     *
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getState() {
+        return this.scripts.getState(this.id);
+    }
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns void
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    async changeDelay(delay) {
+        await this.scripts.changeDelay(this.id, delay);
+        this.delay = delay;
+    }
+    /**
+     * Change job priority.
+     *
+     * @param opts - options containing priority and lifo values.
+     * @returns void
+     */
+    async changePriority(opts) {
+        await this.scripts.changePriority(this.id, opts.priority, opts.lifo);
+        this.priority = opts.priority || 0;
+    }
+    /**
+     * Get this jobs children result values if any.
+     *
+     * @returns Object mapping children job keys with their values.
+     */
+    async getChildrenValues() {
+        const client = await this.queue.client;
+        const result = (await client.hgetall(this.toKey(`${this.id}:processed`)));
+        if (result) {
+            return parseObjectValues(result);
+        }
+    }
+    /**
+     * Retrieves the failures of child jobs that were explicitly ignored while using ignoreDependencyOnFailure option.
+     * This method is useful for inspecting which child jobs were intentionally ignored when an error occurred.
+     * @see {@link https://docs.bullmq.io/guide/flows/ignore-dependency}
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    async getIgnoredChildrenFailures() {
+        const client = await this.queue.client;
+        return client.hgetall(this.toKey(`${this.id}:failed`));
+    }
+    /**
+     * Get job's children failure values that were ignored if any.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getIgnoredChildrenFailures instead.
+     *
+     * @returns Object mapping children job keys with their failure values.
+     */
+    async getFailedChildrenValues() {
+        const client = await this.queue.client;
+        return client.hgetall(this.toKey(`${this.id}:failed`));
+    }
+    /**
+     * Get children job keys if this job is a parent and has children.
+     * @remarks
+     * Count options before Redis v7.2 works as expected with any quantity of entries
+     * on processed/unprocessed dependencies, since v7.2 you must consider that count
+     * won't have any effect until processed/unprocessed dependencies have a length
+     * greater than 127
+     * @see {@link https://redis.io/docs/management/optimization/memory-optimization/#redis--72}
+     * @see {@link https://docs.bullmq.io/guide/flows#getters}
+     * @returns dependencies separated by processed, unprocessed, ignored and failed.
+     */
+    async getDependencies(opts = {}) {
+        const client = await this.queue.client;
+        const multi = client.pipeline();
+        if (!opts.processed && !opts.unprocessed && !opts.ignored && !opts.failed) {
+            multi.hgetall(this.toKey(`${this.id}:processed`));
+            multi.smembers(this.toKey(`${this.id}:dependencies`));
+            multi.hgetall(this.toKey(`${this.id}:failed`));
+            multi.zrange(this.toKey(`${this.id}:unsuccessful`), 0, -1);
+            const [[err1, processed], [err2, unprocessed], [err3, ignored], [err4, failed],] = (await multi.exec());
+            return {
+                processed: parseObjectValues(processed),
+                unprocessed,
+                failed,
+                ignored,
+            };
+        }
+        else {
+            const defaultOpts = {
+                cursor: 0,
+                count: 20,
+            };
+            const childrenResultOrder = [];
+            if (opts.processed) {
+                childrenResultOrder.push('processed');
+                const processedOpts = Object.assign(Object.assign({}, defaultOpts), opts.processed);
+                multi.hscan(this.toKey(`${this.id}:processed`), processedOpts.cursor, {
+                    COUNT: processedOpts.count,
+                });
+            }
+            if (opts.unprocessed) {
+                childrenResultOrder.push('unprocessed');
+                const unprocessedOpts = Object.assign(Object.assign({}, defaultOpts), opts.unprocessed);
+                multi.sscan(this.toKey(`${this.id}:dependencies`), unprocessedOpts.cursor, { COUNT: unprocessedOpts.count });
+            }
+            if (opts.ignored) {
+                childrenResultOrder.push('ignored');
+                const ignoredOpts = Object.assign(Object.assign({}, defaultOpts), opts.ignored);
+                multi.hscan(this.toKey(`${this.id}:failed`), ignoredOpts.cursor, {
+                    COUNT: ignoredOpts.count,
+                });
+            }
+            let failedCursor;
+            if (opts.failed) {
+                childrenResultOrder.push('failed');
+                const failedOpts = Object.assign(Object.assign({}, defaultOpts), opts.failed);
+                failedCursor = failedOpts.cursor + failedOpts.count;
+                multi.zrange(this.toKey(`${this.id}:unsuccessful`), failedOpts.cursor, failedOpts.count - 1);
+            }
+            const results = (await multi.exec());
+            let processedCursor, processed, unprocessedCursor, unprocessed, failed, ignoredCursor, ignored;
+            childrenResultOrder.forEach((key, index) => {
+                switch (key) {
+                    case 'processed': {
+                        processedCursor = results[index][1][0];
+                        const rawProcessed = results[index][1][1];
+                        const transformedProcessed = {};
+                        for (let ind = 0; ind < rawProcessed.length; ++ind) {
+                            if (ind % 2) {
+                                transformedProcessed[rawProcessed[ind - 1]] = JSON.parse(rawProcessed[ind]);
+                            }
+                        }
+                        processed = transformedProcessed;
+                        break;
+                    }
+                    case 'failed': {
+                        failed = results[index][1];
+                        break;
+                    }
+                    case 'ignored': {
+                        ignoredCursor = results[index][1][0];
+                        const rawIgnored = results[index][1][1];
+                        const transformedIgnored = {};
+                        for (let ind = 0; ind < rawIgnored.length; ++ind) {
+                            if (ind % 2) {
+                                transformedIgnored[rawIgnored[ind - 1]] = rawIgnored[ind];
+                            }
+                        }
+                        ignored = transformedIgnored;
+                        break;
+                    }
+                    case 'unprocessed': {
+                        unprocessedCursor = results[index][1][0];
+                        unprocessed = results[index][1][1];
+                        break;
+                    }
+                }
+            });
+            return Object.assign(Object.assign(Object.assign(Object.assign({}, (processedCursor
+                ? {
+                    processed,
+                    nextProcessedCursor: Number(processedCursor),
+                }
+                : {})), (ignoredCursor
+                ? {
+                    ignored,
+                    nextIgnoredCursor: Number(ignoredCursor),
+                }
+                : {})), (failedCursor
+                ? {
+                    failed,
+                    nextFailedCursor: failedCursor,
+                }
+                : {})), (unprocessedCursor
+                ? { unprocessed, nextUnprocessedCursor: Number(unprocessedCursor) }
+                : {}));
+        }
+    }
+    /**
+     * Get children job counts if this job is a parent and has children.
+     *
+     * @returns dependencies count separated by processed, unprocessed, ignored and failed.
+     */
+    async getDependenciesCount(opts = {}) {
+        const types = [];
+        Object.entries(opts).forEach(([key, value]) => {
+            if (value) {
+                types.push(key);
+            }
+        });
+        const finalTypes = types.length
+            ? types
+            : ['processed', 'unprocessed', 'ignored', 'failed'];
+        const responses = await this.scripts.getDependencyCounts(this.id, finalTypes);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[`${finalTypes[index]}`] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Returns a promise the resolves when the job has completed (containing the return value of the job),
+     * or rejects when the job has failed (containing the failedReason).
+     *
+     * @param queueEvents - Instance of QueueEvents.
+     * @param ttl - Time in milliseconds to wait for job to finish before timing out.
+     */
+    async waitUntilFinished(queueEvents, ttl) {
+        await this.queue.waitUntilReady();
+        const jobId = this.id;
+        return new Promise(async (resolve, reject) => {
+            let timeout;
+            if (ttl) {
+                timeout = setTimeout(() => onFailed(
+                /* eslint-disable max-len */
+                `Job wait ${this.name} timed out before finishing, no finish notification arrived after ${ttl}ms (id=${jobId})`), ttl);
+            }
+            function onCompleted(args) {
+                removeListeners();
+                resolve(args.returnvalue);
+            }
+            function onFailed(args) {
+                removeListeners();
+                reject(new Error(args.failedReason || args));
+            }
+            const completedEvent = `completed:${jobId}`;
+            const failedEvent = `failed:${jobId}`;
+            queueEvents.on(completedEvent, onCompleted);
+            queueEvents.on(failedEvent, onFailed);
+            this.queue.on('closing', onFailed);
+            const removeListeners = () => {
+                clearInterval(timeout);
+                queueEvents.removeListener(completedEvent, onCompleted);
+                queueEvents.removeListener(failedEvent, onFailed);
+                this.queue.removeListener('closing', onFailed);
+            };
+            // Poll once right now to see if the job has already finished. The job may have been completed before we were able
+            // to register the event handlers on the QueueEvents, so we check here to make sure we're not waiting for an event
+            // that has already happened. We block checking the job until the queue events object is actually listening to
+            // Redis so there's no chance that it will miss events.
+            await queueEvents.waitUntilReady();
+            const [status, result] = (await this.scripts.isFinished(jobId, true));
+            const finished = status != 0;
+            if (finished) {
+                if (status == -1 || status == 2) {
+                    onFailed({ failedReason: result });
+                }
+                else {
+                    onCompleted({ returnvalue: getReturnValue(result) });
+                }
+            }
+        });
+    }
+    /**
+     * Moves the job to the delay set.
+     *
+     * @param timestamp - timestamp when the job should be moved back to "wait"
+     * @param token - token to check job is locked by current worker
+     * @returns
+     */
+    async moveToDelayed(timestamp, token) {
+        const now = Date.now();
+        const delay = timestamp - now;
+        const finalDelay = delay > 0 ? delay : 0;
+        await this.scripts.moveToDelayed(this.id, now, finalDelay, token, {
+            skipAttempt: true,
+        });
+        this.delay = finalDelay;
+        this.recordJobMetrics('delayed');
+    }
+    /**
+     * Moves the job to the waiting-children set.
+     *
+     * @param token - Token to check job is locked by current worker
+     * @param opts - The options bag for moving a job to waiting-children.
+     * @returns true if the job was moved
+     */
+    async moveToWaitingChildren(token, opts = {}) {
+        const movedToWaitingChildren = await this.scripts.moveToWaitingChildren(this.id, token, opts);
+        if (movedToWaitingChildren) {
+            this.recordJobMetrics('waiting-children');
+        }
+        return movedToWaitingChildren;
+    }
+    /**
+     * Promotes a delayed job so that it starts to be processed as soon as possible.
+     */
+    async promote() {
+        const jobId = this.id;
+        await this.scripts.promote(jobId);
+        this.delay = 0;
+    }
+    /**
+     * Attempts to retry the job. Only a job that has failed or completed can be retried.
+     *
+     * @param state - completed / failed
+     * @param opts - options to retry a job
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * The queue emits a waiting event when the job is successfully moved.
+     * @throws Will throw an error if the job does not exist, is locked, or is not in the expected state.
+     */
+    async retry(state = 'failed', opts = {}) {
+        await this.scripts.reprocessJob(this, state, opts);
+        this.failedReason = null;
+        this.finishedOn = null;
+        this.processedOn = null;
+        this.returnvalue = null;
+        if (opts.resetAttemptsMade) {
+            this.attemptsMade = 0;
+        }
+        if (opts.resetAttemptsStarted) {
+            this.attemptsStarted = 0;
+        }
+    }
+    /**
+     * Marks a job to not be retried if it fails (even if attempts has been configured)
+     * @deprecated use UnrecoverableError
+     */
+    discard() {
+        this.discarded = true;
+    }
+    async isInZSet(set) {
+        const client = await this.queue.client;
+        const score = await client.zscore(this.queue.toKey(set), this.id);
+        return score !== null;
+    }
+    async isInList(list) {
+        return this.scripts.isJobInList(this.queue.toKey(list), this.id);
+    }
+    /**
+     * Adds the job to Redis.
+     *
+     * @param client - The Redis client to use for adding the job.
+     * @param parentOpts - Options for the parent-child relationship.
+     * @returns The job ID
+     */
+    addJob(client, parentOpts) {
+        const jobData = this.asJSON();
+        this.validateOptions(jobData);
+        return this.scripts.addJob(client, jobData, jobData.opts, this.id, parentOpts);
+    }
+    /**
+     * Removes a deduplication key if job is still the cause of deduplication.
+     * @returns true if the deduplication key was removed.
+     */
+    async removeDeduplicationKey() {
+        if (this.deduplicationId) {
+            const result = await this.scripts.removeDeduplicationKey(this.deduplicationId, this.id);
+            return result > 0;
+        }
+        return false;
+    }
+    validateOptions(jobData) {
+        var _a, _b, _c, _d, _e, _f, _g, _h;
+        const exclusiveOptions = [
+            'removeDependencyOnFailure',
+            'failParentOnFailure',
+            'continueParentOnFailure',
+            'ignoreDependencyOnFailure',
+        ];
+        const exceedLimit = this.opts.sizeLimit &&
+            lengthInUtf8Bytes(jobData.data) > this.opts.sizeLimit;
+        if (exceedLimit) {
+            throw new Error(`The size of job ${this.name} exceeds the limit ${this.opts.sizeLimit} bytes`);
+        }
+        if (this.opts.delay && this.opts.repeat && !((_a = this.opts.repeat) === null || _a === void 0 ? void 0 : _a.count)) {
+            throw new Error(`Delay and repeat options cannot be used together`);
+        }
+        const enabledExclusiveOptions = exclusiveOptions.filter(opt => this.opts[opt]);
+        if (enabledExclusiveOptions.length > 1) {
+            const optionsList = enabledExclusiveOptions.join(', ');
+            throw new Error(`The following options cannot be used together: ${optionsList}`);
+        }
+        if ((_b = this.opts) === null || _b === void 0 ? void 0 : _b.jobId) {
+            if (`${parseInt(this.opts.jobId, 10)}` === ((_c = this.opts) === null || _c === void 0 ? void 0 : _c.jobId)) {
+                throw new Error('Custom Id cannot be integers');
+            }
+            // TODO: replace this check in next breaking check with include(':')
+            // By using split we are still keeping compatibility with old repeatable jobs
+            if (((_d = this.opts) === null || _d === void 0 ? void 0 : _d.jobId.includes(':')) &&
+                ((_f = (_e = this.opts) === null || _e === void 0 ? void 0 : _e.jobId) === null || _f === void 0 ? void 0 : _f.split(':').length) !== 3) {
+                throw new Error('Custom Id cannot contain :');
+            }
+        }
+        if (this.opts.priority) {
+            if (Math.trunc(this.opts.priority) !== this.opts.priority) {
+                throw new Error(`Priority should not be float`);
+            }
+            if (this.opts.priority > PRIORITY_LIMIT) {
+                throw new Error(`Priority should be between 0 and ${PRIORITY_LIMIT}`);
+            }
+        }
+        if (this.opts.deduplication) {
+            if (!((_g = this.opts.deduplication) === null || _g === void 0 ? void 0 : _g.id)) {
+                throw new Error('Deduplication id must be provided');
+            }
+            if (this.parentKey) {
+                throw new Error('Deduplication and parent options cannot be used together');
+            }
+        }
+        // TODO: remove in v6
+        if (this.opts.debounce) {
+            if (!((_h = this.opts.debounce) === null || _h === void 0 ? void 0 : _h.id)) {
+                throw new Error('Debounce id must be provided');
+            }
+            if (this.parentKey) {
+                throw new Error('Debounce and parent options cannot be used together');
+            }
+        }
+        if (typeof this.opts.backoff === 'object' &&
+            typeof this.opts.backoff.jitter === 'number') {
+            if (this.opts.backoff.jitter < 0 || this.opts.backoff.jitter > 1) {
+                throw new Error(`Jitter should be between 0 and 1`);
+            }
+        }
+    }
+    updateStacktrace(err) {
+        this.stacktrace = this.stacktrace || [];
+        if (err === null || err === void 0 ? void 0 : err.stack) {
+            this.stacktrace.push(err.stack);
+            if (this.opts.stackTraceLimit === 0) {
+                this.stacktrace = [];
+            }
+            else if (this.opts.stackTraceLimit) {
+                this.stacktrace = this.stacktrace.slice(-this.opts.stackTraceLimit);
+            }
+        }
+    }
+    setSpanJobAttributes(span) {
+        span === null || span === void 0 ? void 0 : span.setAttributes({
+            [TelemetryAttributes.JobName]: this.name,
+            [TelemetryAttributes.JobId]: this.id,
+        });
+    }
+}
+function getTraces(stacktrace) {
+    if (!stacktrace) {
+        return [];
+    }
+    const traces = tryCatch(JSON.parse, JSON, [stacktrace]);
+    if (traces === errorObject || !(traces instanceof Array)) {
+        return [];
+    }
+    else {
+        return traces;
+    }
+}
+function getReturnValue(_value) {
+    const value = tryCatch(JSON.parse, JSON, [_value]);
+    if (value !== errorObject) {
+        return value;
+    }
+    else {
+        logger('corrupted returnvalue: ' + _value, value);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/lock-manager.d.ts b/node_modules/bullmq/dist/esm/classes/lock-manager.d.ts
new file mode 100644
index 0000000..624b852
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/lock-manager.d.ts
@@ -0,0 +1,69 @@
+import { AbortController } from './abort-controller';
+import { LockManagerWorkerContext } from '../interfaces';
+export interface LockManagerOptions {
+    lockRenewTime: number;
+    lockDuration: number;
+    workerId: string;
+    workerName?: string;
+}
+/**
+ * Manages lock renewal for BullMQ workers.
+ * It periodically extends locks for active jobs to prevent them from being
+ * considered stalled by other workers.
+ */
+export declare class LockManager {
+    protected worker: LockManagerWorkerContext;
+    protected opts: LockManagerOptions;
+    protected lockRenewalTimer?: NodeJS.Timeout;
+    protected trackedJobs: Map<string, {
+        token: string;
+        ts: number;
+        abortController?: AbortController;
+    }>;
+    protected closed: boolean;
+    constructor(worker: LockManagerWorkerContext, opts: LockManagerOptions);
+    /**
+     * Starts the lock manager timers for lock renewal.
+     */
+    start(): void;
+    protected extendLocks(jobIds: string[]): Promise<void>;
+    private startLockExtenderTimer;
+    /**
+     * Stops the lock manager and clears all timers.
+     */
+    close(): Promise<void>;
+    /**
+     * Adds a job to be tracked for lock renewal.
+     * Returns an AbortController if shouldCreateController is true, undefined otherwise.
+     */
+    trackJob(jobId: string, token: string, ts: number, shouldCreateController?: boolean): AbortController | undefined;
+    /**
+     * Removes a job from lock renewal tracking.
+     */
+    untrackJob(jobId: string): void;
+    /**
+     * Gets the number of jobs currently being tracked.
+     */
+    getActiveJobCount(): number;
+    /**
+     * Checks if the lock manager is running.
+     */
+    isRunning(): boolean;
+    /**
+     * Cancels a specific job by aborting its signal.
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId: string, reason?: string): boolean;
+    /**
+     * Cancels all tracked jobs by aborting their signals.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason?: string): void;
+    /**
+     * Gets a list of all tracked job IDs.
+     * @returns Array of job IDs currently being tracked
+     */
+    getTrackedJobIds(): string[];
+}
diff --git a/node_modules/bullmq/dist/esm/classes/lock-manager.js b/node_modules/bullmq/dist/esm/classes/lock-manager.js
new file mode 100644
index 0000000..f73728f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/lock-manager.js
@@ -0,0 +1,160 @@
+import { AbortController } from './abort-controller';
+import { SpanKind, TelemetryAttributes } from '../enums';
+/**
+ * Manages lock renewal for BullMQ workers.
+ * It periodically extends locks for active jobs to prevent them from being
+ * considered stalled by other workers.
+ */
+export class LockManager {
+    constructor(worker, opts) {
+        this.worker = worker;
+        this.opts = opts;
+        // Maps job ids with their tokens, timestamps, and abort controllers
+        this.trackedJobs = new Map();
+        this.closed = false;
+    }
+    /**
+     * Starts the lock manager timers for lock renewal.
+     */
+    start() {
+        if (this.closed) {
+            return;
+        }
+        // Start lock renewal timer if not disabled
+        if (this.opts.lockRenewTime > 0) {
+            this.startLockExtenderTimer();
+        }
+    }
+    async extendLocks(jobIds) {
+        await this.worker.trace(SpanKind.INTERNAL, 'extendLocks', this.worker.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.opts.workerId,
+                [TelemetryAttributes.WorkerName]: this.opts.workerName,
+                [TelemetryAttributes.WorkerJobsToExtendLocks]: jobIds,
+            });
+            try {
+                const jobTokens = jobIds.map(id => { var _a; return ((_a = this.trackedJobs.get(id)) === null || _a === void 0 ? void 0 : _a.token) || ''; });
+                const erroredJobIds = await this.worker.extendJobLocks(jobIds, jobTokens, this.opts.lockDuration);
+                if (erroredJobIds.length > 0) {
+                    this.worker.emit('lockRenewalFailed', erroredJobIds);
+                    for (const jobId of erroredJobIds) {
+                        this.worker.emit('error', new Error(`could not renew lock for job ${jobId}`));
+                    }
+                }
+                const succeededJobIds = jobIds.filter(id => !erroredJobIds.includes(id));
+                if (succeededJobIds.length > 0) {
+                    this.worker.emit('locksRenewed', {
+                        count: succeededJobIds.length,
+                        jobIds: succeededJobIds,
+                    });
+                }
+            }
+            catch (err) {
+                this.worker.emit('error', err);
+            }
+        });
+    }
+    startLockExtenderTimer() {
+        clearTimeout(this.lockRenewalTimer);
+        if (!this.closed) {
+            this.lockRenewalTimer = setTimeout(async () => {
+                // Get all the jobs whose locks expire in less than 1/2 of the lockRenewTime
+                const now = Date.now();
+                const jobsToExtend = [];
+                for (const jobId of this.trackedJobs.keys()) {
+                    const tracked = this.trackedJobs.get(jobId);
+                    const { ts, token, abortController } = tracked;
+                    if (!ts) {
+                        this.trackedJobs.set(jobId, { token, ts: now, abortController });
+                        continue;
+                    }
+                    if (ts + this.opts.lockRenewTime / 2 < now) {
+                        this.trackedJobs.set(jobId, { token, ts: now, abortController });
+                        jobsToExtend.push(jobId);
+                    }
+                }
+                if (jobsToExtend.length) {
+                    await this.extendLocks(jobsToExtend);
+                }
+                this.startLockExtenderTimer();
+            }, this.opts.lockRenewTime / 2);
+        }
+    }
+    /**
+     * Stops the lock manager and clears all timers.
+     */
+    async close() {
+        if (this.closed) {
+            return;
+        }
+        this.closed = true;
+        if (this.lockRenewalTimer) {
+            clearTimeout(this.lockRenewalTimer);
+            this.lockRenewalTimer = undefined;
+        }
+        this.trackedJobs.clear();
+    }
+    /**
+     * Adds a job to be tracked for lock renewal.
+     * Returns an AbortController if shouldCreateController is true, undefined otherwise.
+     */
+    trackJob(jobId, token, ts, shouldCreateController = false) {
+        const abortController = shouldCreateController
+            ? new AbortController()
+            : undefined;
+        if (!this.closed && jobId) {
+            this.trackedJobs.set(jobId, { token, ts, abortController });
+        }
+        return abortController;
+    }
+    /**
+     * Removes a job from lock renewal tracking.
+     */
+    untrackJob(jobId) {
+        this.trackedJobs.delete(jobId);
+    }
+    /**
+     * Gets the number of jobs currently being tracked.
+     */
+    getActiveJobCount() {
+        return this.trackedJobs.size;
+    }
+    /**
+     * Checks if the lock manager is running.
+     */
+    isRunning() {
+        return !this.closed && this.lockRenewalTimer !== undefined;
+    }
+    /**
+     * Cancels a specific job by aborting its signal.
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId, reason) {
+        const tracked = this.trackedJobs.get(jobId);
+        if (tracked === null || tracked === void 0 ? void 0 : tracked.abortController) {
+            tracked.abortController.abort(reason);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Cancels all tracked jobs by aborting their signals.
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason) {
+        for (const tracked of this.trackedJobs.values()) {
+            if (tracked.abortController) {
+                tracked.abortController.abort(reason);
+            }
+        }
+    }
+    /**
+     * Gets a list of all tracked job IDs.
+     * @returns Array of job IDs currently being tracked
+     */
+    getTrackedJobIds() {
+        return Array.from(this.trackedJobs.keys());
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/main-base.d.ts b/node_modules/bullmq/dist/esm/classes/main-base.d.ts
new file mode 100644
index 0000000..088213a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main-base.d.ts
@@ -0,0 +1,3 @@
+import { Receiver } from '../interfaces';
+declare const _default: (send: (msg: any) => Promise<void>, receiver: Receiver) => void;
+export default _default;
diff --git a/node_modules/bullmq/dist/esm/classes/main-base.js b/node_modules/bullmq/dist/esm/classes/main-base.js
new file mode 100644
index 0000000..24a5a2e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main-base.js
@@ -0,0 +1,44 @@
+/**
+ * Wrapper for sandboxing.
+ *
+ */
+import { ChildProcessor } from './child-processor';
+import { ParentCommand, ChildCommand } from '../enums';
+import { errorToJSON, toString } from '../utils';
+export default (send, receiver) => {
+    const childProcessor = new ChildProcessor(send, receiver);
+    receiver === null || receiver === void 0 ? void 0 : receiver.on('message', async (msg) => {
+        try {
+            switch (msg.cmd) {
+                case ChildCommand.Init:
+                    await childProcessor.init(msg.value);
+                    break;
+                case ChildCommand.Start:
+                    await childProcessor.start(msg.job, msg === null || msg === void 0 ? void 0 : msg.token);
+                    break;
+                case ChildCommand.Stop:
+                    break;
+                case ChildCommand.Cancel:
+                    childProcessor.cancel(msg.value);
+                    break;
+            }
+        }
+        catch (err) {
+            console.error('Error handling child message');
+        }
+    });
+    process.on('SIGTERM', () => childProcessor.waitForCurrentJobAndExit());
+    process.on('SIGINT', () => childProcessor.waitForCurrentJobAndExit());
+    process.on('uncaughtException', async (err) => {
+        if (typeof err !== 'object') {
+            err = new Error(toString(err));
+        }
+        await send({
+            cmd: ParentCommand.Failed,
+            value: errorToJSON(err),
+        });
+        // An uncaughException leaves this process in a potentially undetermined state so
+        // we must exit
+        process.exit();
+    });
+};
diff --git a/node_modules/bullmq/dist/esm/classes/main-worker.d.ts b/node_modules/bullmq/dist/esm/classes/main-worker.d.ts
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main-worker.d.ts
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/main-worker.js b/node_modules/bullmq/dist/esm/classes/main-worker.js
new file mode 100644
index 0000000..d6e7b75
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main-worker.js
@@ -0,0 +1,7 @@
+/**
+ * Worker Thread wrapper for sandboxing
+ *
+ */
+import { parentPort } from 'worker_threads';
+import mainBase from './main-base';
+mainBase(async (msg) => parentPort.postMessage(msg), parentPort);
diff --git a/node_modules/bullmq/dist/esm/classes/main.d.ts b/node_modules/bullmq/dist/esm/classes/main.d.ts
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main.d.ts
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/main.js b/node_modules/bullmq/dist/esm/classes/main.js
new file mode 100644
index 0000000..a50bab2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/main.js
@@ -0,0 +1,7 @@
+/**
+ * Child process wrapper for sandboxing.
+ *
+ */
+import { childSend } from '../utils';
+import mainBase from './main-base';
+mainBase((msg) => childSend(process, msg), process);
diff --git a/node_modules/bullmq/dist/esm/classes/node-redis-client.d.ts b/node_modules/bullmq/dist/esm/classes/node-redis-client.d.ts
new file mode 100644
index 0000000..d30d285
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/node-redis-client.d.ts
@@ -0,0 +1,96 @@
+import { IRedisClient } from '../interfaces/redis-client';
+export type NodeRedisCommandArgument = string | Buffer;
+export interface NodeRedisRawTransaction {
+    hGetAll(key: string): this;
+    hSet(key: string, data: Record<string, string | number>): this;
+    hScan(key: string, cursor: string, options?: Record<string, unknown>): this;
+    sMembers(key: string): this;
+    sScan(key: string, cursor: string, options?: Record<string, unknown>): this;
+    zRange(key: string, start: number, end: number): this;
+    lRange(key: string, start: number, end: number): this;
+    lLen(key: string): this;
+    del(keys: string[]): this;
+    evalSha(sha: string, options: {
+        keys: string[];
+        arguments: NodeRedisCommandArgument[];
+    }): this;
+    exec(): Promise<unknown[] | null>;
+}
+export interface NodeRedisRawClient {
+    isReady: boolean;
+    isOpen: boolean;
+    options?: Record<string, unknown>;
+    on(event: string, listener: (...args: any[]) => void): this;
+    connect(): Promise<unknown>;
+    close?(): Promise<void>;
+    destroy(): void | Promise<void>;
+    quit(): Promise<unknown>;
+    duplicate(): NodeRedisRawClient;
+    scriptLoad(lua: string): Promise<unknown>;
+    evalSha<T = unknown>(sha: string, options: {
+        keys: string[];
+        arguments: NodeRedisCommandArgument[];
+    }): Promise<T>;
+    eval<T = unknown>(lua: string, options: {
+        keys: string[];
+        arguments: NodeRedisCommandArgument[];
+    }): Promise<T>;
+    multi(): NodeRedisRawTransaction;
+    hGetAll(key: string): Promise<Record<string, string>>;
+    hGet(key: string, field: string): Promise<string | null | undefined>;
+    hmGet(key: string, fields: string[]): Promise<(string | null | undefined)[]>;
+    hSet(key: string, data: Record<string, string | number>): Promise<number>;
+    hDel(key: string, fields: string[]): Promise<number>;
+    hExists(key: string, field: string): Promise<boolean>;
+    get(key: string): Promise<string | null | undefined>;
+    set(key: string, value: string, options?: Record<string, unknown>): Promise<string | null>;
+    del(keys: string[]): Promise<number>;
+    zRange(key: string, start: number, end: number, options?: Record<string, unknown>): Promise<string[]>;
+    zRangeWithScores?(key: string, start: number, end: number, options?: Record<string, unknown>): Promise<{
+        value: string;
+        score: number;
+    }[]>;
+    zCard(key: string): Promise<number>;
+    zScore(key: string, member: string): Promise<number | string | null>;
+    zAdd(key: string, members: {
+        score: number;
+        value: string;
+    }[]): Promise<number>;
+    zRem(key: string, members: string[]): Promise<number>;
+    lRange(key: string, start: number, end: number): Promise<string[]>;
+    lLen(key: string): Promise<number>;
+    lTrim(key: string, start: number, end: number): Promise<unknown>;
+    lPos(key: string, value: string): Promise<number | null | undefined>;
+    lPush(key: string, values: string[]): Promise<number>;
+    rPop(key: string): Promise<string | null>;
+    sMembers(key: string): Promise<string[]>;
+    sAdd(key: string, members: string[]): Promise<number>;
+    sCard(key: string): Promise<number>;
+    xAdd(key: string, id: string, fields: Record<string, string>, options?: Record<string, unknown>): Promise<string>;
+    xRead(streams: {
+        key: string;
+        id: string;
+    }[], options?: Record<string, unknown>): Promise<any>;
+    xTrim(key: string, strategy: 'MAXLEN', threshold: number, options?: Record<string, unknown>): Promise<number>;
+    xLen(key: string): Promise<number>;
+    xRevRange(key: string, end: string, start: string, options?: Record<string, unknown>): Promise<any[]>;
+    bzPopMin(key: string, timeout: number): Promise<{
+        key: string;
+        value: string;
+        score: number | string;
+    } | null>;
+    info(): Promise<string>;
+    clientSetName(name: string): Promise<unknown>;
+    sendCommand(args: string[]): Promise<string>;
+    scan(cursor: string, options?: Record<string, unknown>): Promise<{
+        cursor: number | string;
+        keys: string[];
+    }>;
+    scanIterator(options?: Record<string, unknown>): AsyncIterable<string | string[]>;
+    keys(pattern: string): Promise<string[]>;
+    exists(keys: string[]): Promise<number>;
+    incr(key: string): Promise<number>;
+    incrBy(key: string, increment: number): Promise<number>;
+    flushAll(): Promise<string>;
+}
+export declare function createNodeRedisClient<TClient extends NodeRedisRawClient>(client: TClient): IRedisClient;
diff --git a/node_modules/bullmq/dist/esm/classes/node-redis-client.js b/node_modules/bullmq/dist/esm/classes/node-redis-client.js
new file mode 100644
index 0000000..c2ba943
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/node-redis-client.js
@@ -0,0 +1,768 @@
+import { __asyncValues } from "tslib";
+import { createHash } from 'crypto';
+import { EventEmitter } from 'events';
+import { Readable } from 'stream';
+import { ConnectionClosedError } from './errors/connection-closed-error';
+function normalizeScriptArgs(args) {
+    return args.length === 1 && Array.isArray(args[0]) ? args[0] : args;
+}
+function isConnectionClosedError(err) {
+    return ((err === null || err === void 0 ? void 0 : err.message) === 'Disconnects client' ||
+        (err === null || err === void 0 ? void 0 : err.message) === 'The client is closed' ||
+        (err === null || err === void 0 ? void 0 : err.message) === 'Connection is closed.');
+}
+export function createNodeRedisClient(client) {
+    return new NodeRedisAdapter(client);
+}
+/**
+ * Full wrapper (not augmentation) because node-redis's API is structurally
+ * different from ioredis and cannot be patched in-place.
+ */
+class NodeRedisAdapter extends EventEmitter {
+    /**
+     * Expose connection status using the vocabulary that
+     * {@link RedisConnection.waitUntilReady} expects:
+     *   'wait'  → not yet connected, call connect()
+     *   'ready' → usable
+     *   'end'   → permanently closed
+     */
+    get status() {
+        if (this.statusOverride) {
+            return this.statusOverride;
+        }
+        if (this.raw.isReady) {
+            return 'ready';
+        }
+        if (this.raw.isOpen) {
+            return 'connect';
+        }
+        // Distinguish "never connected" from "disconnected after use"
+        return this.hasConnected ? 'end' : 'wait';
+    }
+    set status(val) {
+        // Allow RedisConnection to forcibly set 'end'
+        if (val === 'end') {
+            this.destroying = true;
+            if (this.raw.isOpen) {
+                try {
+                    this.raw.quit().catch(() => { });
+                }
+                catch (_a) {
+                    // already closed
+                }
+            }
+        }
+        this.statusOverride = val;
+    }
+    get options() {
+        var _a;
+        return (_a = this.raw.options) !== null && _a !== void 0 ? _a : {};
+    }
+    set options(val) {
+        // no-op – callers sometimes assign
+    }
+    constructor(raw) {
+        super();
+        this.raw = raw;
+        this.scripts = new Map();
+        this.hasConnected = false;
+        this.destroying = false;
+        this.isCluster = false; // TODO: cluster support
+        // Track first connection so status can distinguish 'wait' vs 'end'.
+        // When a connectionName is set (via duplicate()), delay the 'ready'
+        // event until CLIENT SETNAME completes so that callers waiting for
+        // 'ready' (e.g. RedisConnection.waitUntilReady) see the name already
+        // applied.
+        raw.on('ready', () => {
+            this.hasConnected = true;
+            if (this.connectionName) {
+                this.raw.clientSetName(this.connectionName).then(() => this.emit('ready'), () => this.emit('ready'));
+            }
+            else {
+                this.emit('ready');
+            }
+        });
+        raw.on('error', (err) => {
+            // Suppress the expected DisconnectsClientError that node-redis emits
+            // when destroy() is called intentionally (e.g. during close/disconnect).
+            if (this.destroying && isConnectionClosedError(err)) {
+                return;
+            }
+            this.emit('error', err);
+        });
+        raw.on('end', () => this.emit('close'));
+        raw.on('reconnecting', () => this.emit('reconnecting'));
+        // Auto-connect eagerly, like ioredis does in its constructor.
+        // This ensures commands can be issued immediately without an
+        // explicit connect() call. The promise is stored so that
+        // connect() is idempotent and callers can still await it.
+        if (!raw.isOpen) {
+            this.connectPromise = raw.connect().then(() => {
+                this.connectPromise = undefined;
+            }, (err) => {
+                this.connectPromise = undefined;
+                // Don't throw — errors surface via the 'error' event.
+            });
+        }
+    }
+    // ---------------------------------------------------------------
+    // Connection lifecycle
+    // ---------------------------------------------------------------
+    async connect() {
+        if (this.connectPromise) {
+            return this.connectPromise;
+        }
+        if (!this.raw.isOpen) {
+            this.connectPromise = this.raw.connect().then(() => {
+                this.connectPromise = undefined;
+            }, (err) => {
+                this.connectPromise = undefined;
+                throw err;
+            });
+            return this.connectPromise;
+        }
+        if (!this.raw.isReady) {
+            await new Promise((resolve, reject) => {
+                const onReady = () => {
+                    cleanup();
+                    resolve();
+                };
+                const onError = (err) => {
+                    cleanup();
+                    reject(err);
+                };
+                const onEnd = () => {
+                    cleanup();
+                    reject(new Error('Connection ended before ready event'));
+                };
+                const cleanup = () => {
+                    this.off('ready', onReady);
+                    this.off('error', onError);
+                    this.off('end', onEnd);
+                };
+                this.once('ready', onReady);
+                this.once('error', onError);
+                this.once('end', onEnd);
+            });
+        }
+    }
+    disconnect(reconnect = false) {
+        this.destroying = true;
+        if (!reconnect) {
+            this.statusOverride = 'end';
+        }
+        try {
+            if (this.raw.isOpen) {
+                // Use destroy() for immediate teardown. This interrupts any pending
+                // blocking commands (e.g. BZPOPMIN) without waiting for them to
+                // complete. The resulting "Disconnects client" rejections are handled
+                // by BullMQ's isNotConnectionError() checks.
+                this.raw.destroy();
+            }
+        }
+        catch (_a) {
+            // Swallow errors from already-closed connections
+        }
+        this.emit('close');
+        if (reconnect) {
+            this.statusOverride = undefined;
+            this.emit('reconnecting');
+            this.connect()
+                .catch(err => {
+                if (!isConnectionClosedError(err)) {
+                    this.emit('error', err);
+                }
+            })
+                .finally(() => {
+                this.destroying = false;
+            });
+        }
+        else {
+            // Emit both 'close' and 'end' so that all listeners are unblocked.
+            // RedisConnection.close() listens for 'close', RedisConnection.disconnect() listens for 'end'.
+            this.emit('end');
+        }
+    }
+    async quit() {
+        if (this.destroying || this.statusOverride === 'end') {
+            setImmediate(() => {
+                this.emit('end');
+                this.emit('close');
+            });
+            return 'OK';
+        }
+        this.destroying = true;
+        try {
+            if (this.raw.isOpen) {
+                try {
+                    await this.raw.quit();
+                }
+                catch (_a) {
+                    // Swallow errors from already-closing connections
+                }
+            }
+        }
+        catch (_b) {
+            // Swallow errors from already-closing connections
+        }
+        this.statusOverride = 'end';
+        // Emit on next tick so callers can register listeners after await quit()
+        setImmediate(() => {
+            this.emit('end');
+            this.emit('close');
+        });
+        return 'OK';
+    }
+    duplicate(...args) {
+        const dup = this.raw.duplicate();
+        const adapter = new NodeRedisAdapter(dup);
+        // Copy registered scripts to the duplicate
+        for (const [name, script] of this.scripts) {
+            adapter.scripts.set(name, script);
+            adapter[name] = (...args) => adapter.runCommand(name, args);
+        }
+        // Handle connectionName option (ioredis calls CLIENT SETNAME automatically).
+        // Setting connectionName BEFORE auto-connect resolves ensures the
+        // constructor's 'ready' handler applies CLIENT SETNAME before emitting
+        // 'ready', so callers (like RedisConnection.waitUntilReady) see the name
+        // already set when the connection is reported as ready.
+        const opts = args[0];
+        if (opts && typeof opts === 'object' && opts.connectionName) {
+            adapter.connectionName = opts.connectionName;
+        }
+        return adapter;
+    }
+    // ---------------------------------------------------------------
+    // Lua script engine
+    // ---------------------------------------------------------------
+    defineCommand(name, definition) {
+        const sha = createHash('sha1').update(definition.lua).digest('hex');
+        this.scripts.set(name, {
+            sha,
+            lua: definition.lua,
+            numberOfKeys: definition.numberOfKeys,
+        });
+        // Mimic ioredis behavior: add a callable property on the instance
+        // so that `(client as any)[name]` is defined (used by ScriptLoader cache check)
+        this[name] = (...args) => this.runCommand(name, args);
+        // Pre-load the script into Redis so that EVALSHA in transactions works
+        // immediately. This mirrors what ioredis does under the hood.
+        this.raw.scriptLoad(definition.lua).catch(() => {
+            // Ignore errors here – runCommand has NOSCRIPT fallback for non-tx path
+        });
+    }
+    async runCommand(name, args) {
+        var _a, _b;
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}"`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const keys = commandArgs.slice(0, numberOfKeys).map(String);
+        // Preserve Buffer arguments (e.g. msgpack data) – only stringify non-Buffers.
+        // Convert undefined/null to '' to match ioredis behavior (keeps arg positions).
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        try {
+            return await this.raw.evalSha(sha, { keys, arguments: argv });
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new ConnectionClosedError(err.message, err);
+            }
+            // NOSCRIPT – fall back to EVAL which also caches the script
+            if ((_b = (_a = err === null || err === void 0 ? void 0 : err.message) === null || _a === void 0 ? void 0 : _a.includes) === null || _b === void 0 ? void 0 : _b.call(_a, 'NOSCRIPT')) {
+                try {
+                    return await this.raw.eval(lua, { keys, arguments: argv });
+                }
+                catch (evalErr) {
+                    if (this.destroying && isConnectionClosedError(evalErr)) {
+                        return null;
+                    }
+                    if (isConnectionClosedError(evalErr)) {
+                        throw new ConnectionClosedError(evalErr.message, evalErr);
+                    }
+                    throw evalErr;
+                }
+            }
+            throw err;
+        }
+    }
+    // ---------------------------------------------------------------
+    // Pipeline / Transaction
+    // ---------------------------------------------------------------
+    multi() {
+        return new NodeRedisTransaction(this.raw.multi(), this.scripts);
+    }
+    pipeline() {
+        // node-redis doesn't have a separate pipeline concept;
+        // use multi() which behaves similarly for batching.
+        return this.multi();
+    }
+    // ---------------------------------------------------------------
+    // Hash commands
+    // ---------------------------------------------------------------
+    async hgetall(key) {
+        const result = await this.raw.hGetAll(key);
+        return result !== null && result !== void 0 ? result : {};
+    }
+    async hget(key, field) {
+        var _a;
+        return (_a = (await this.raw.hGet(key, field))) !== null && _a !== void 0 ? _a : null;
+    }
+    async hmget(key, ...fields) {
+        const result = await this.raw.hmGet(key, fields);
+        return result.map((v) => v !== null && v !== void 0 ? v : null);
+    }
+    async hset(key, dataOrField, ...rest) {
+        if (typeof dataOrField === 'object') {
+            // Record-based call: hset(key, { field: value, ... })
+            return await this.raw.hSet(key, dataOrField);
+        }
+        // Varargs call (ioredis compat): hset(key, field, value, field, value, ...)
+        const record = {};
+        record[dataOrField] = String(rest[0]);
+        for (let i = 1; i < rest.length; i += 2) {
+            record[String(rest[i])] = String(rest[i + 1]);
+        }
+        return await this.raw.hSet(key, record);
+    }
+    async hdel(key, ...fields) {
+        return await this.raw.hDel(key, fields);
+    }
+    async hexists(key, field) {
+        const exists = await this.raw.hExists(key, field);
+        return exists ? 1 : 0;
+    }
+    // ---------------------------------------------------------------
+    // String commands
+    // ---------------------------------------------------------------
+    async get(key) {
+        var _a;
+        return (_a = (await this.raw.get(key))) !== null && _a !== void 0 ? _a : null;
+    }
+    async set(key, value, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.PX) != null) {
+            opts.PX = options.PX;
+        }
+        else if ((options === null || options === void 0 ? void 0 : options.EX) != null) {
+            opts.EX = options.EX;
+        }
+        return await this.raw.set(key, String(value), opts);
+    }
+    async del(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.raw.del(keys);
+    }
+    // ---------------------------------------------------------------
+    // Sorted set commands
+    // ---------------------------------------------------------------
+    async zrange(key, start, end, options) {
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            // node-redis v5 uses a separate method for WITHSCORES
+            const items = await this.raw.zRangeWithScores(key, start, end);
+            // Flatten to [member, score, member, score, …] like ioredis
+            const flat = [];
+            for (const item of items) {
+                flat.push(item.value, String(item.score));
+            }
+            return flat;
+        }
+        return await this.raw.zRange(key, start, end);
+    }
+    async zrevrange(key, start, end, options) {
+        if (options === null || options === void 0 ? void 0 : options.WITHSCORES) {
+            const items = await this.raw.zRangeWithScores(key, start, end, {
+                REV: true,
+            });
+            const flat = [];
+            for (const item of items) {
+                flat.push(item.value, String(item.score));
+            }
+            return flat;
+        }
+        return await this.raw.zRange(key, start, end, { REV: true });
+    }
+    async zcard(key) {
+        return await this.raw.zCard(key);
+    }
+    async zscore(key, member) {
+        const score = await this.raw.zScore(key, member);
+        return score != null ? String(score) : null;
+    }
+    // ---------------------------------------------------------------
+    // List commands
+    // ---------------------------------------------------------------
+    async lrange(key, start, end) {
+        return await this.raw.lRange(key, start, end);
+    }
+    async llen(key) {
+        return await this.raw.lLen(key);
+    }
+    async ltrim(key, start, end) {
+        await this.raw.lTrim(key, start, end);
+        return 'OK';
+    }
+    async lpos(key, value) {
+        var _a;
+        return (_a = (await this.raw.lPos(key, value))) !== null && _a !== void 0 ? _a : null;
+    }
+    // ---------------------------------------------------------------
+    // Set commands
+    // ---------------------------------------------------------------
+    async smembers(key) {
+        return await this.raw.sMembers(key);
+    }
+    // ---------------------------------------------------------------
+    // Stream commands
+    // ---------------------------------------------------------------
+    async xadd(key, id, fields, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.MAXLEN) != null) {
+            opts.TRIM = {
+                strategy: 'MAXLEN',
+                threshold: options.MAXLEN,
+                strategyModifier: options.approximate === false ? undefined : '~',
+            };
+        }
+        // node-redis xAdd rejects numeric field values — stringify all values
+        const strFields = {};
+        for (const [k, v] of Object.entries(fields)) {
+            strFields[k] = String(v);
+        }
+        return await this.raw.xAdd(key, id, strFields, opts);
+    }
+    async xread(streams, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.BLOCK) != null) {
+            opts.BLOCK = options.BLOCK;
+        }
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        const streamArgs = streams.map(s => ({ key: s.key, id: s.id }));
+        let result;
+        try {
+            result = await this.raw.xRead(streamArgs, opts);
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new ConnectionClosedError(err.message, err);
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        // Normalize to ioredis format: [[streamName, [[id, [field, value, …]], …]], …]
+        return result.map((stream) => [
+            stream.name,
+            stream.messages.map((msg) => [
+                msg.id,
+                Object.entries(msg.message).flat(),
+            ]),
+        ]);
+    }
+    async xtrim(key, strategy, threshold, options) {
+        const strategyModifier = (options === null || options === void 0 ? void 0 : options.approximate) === false ? undefined : '~';
+        return await this.raw.xTrim(key, strategy, threshold, {
+            strategyModifier,
+        });
+    }
+    // ---------------------------------------------------------------
+    // Blocking commands
+    // ---------------------------------------------------------------
+    async bzpopmin(key, timeout) {
+        let result;
+        try {
+            result = await this.raw.bzPopMin(key, timeout);
+        }
+        catch (err) {
+            if (this.destroying && isConnectionClosedError(err)) {
+                return null;
+            }
+            if (isConnectionClosedError(err)) {
+                throw new ConnectionClosedError(err.message, err);
+            }
+            throw err;
+        }
+        if (!result) {
+            return null;
+        }
+        return [result.key, result.value, String(result.score)];
+    }
+    // ---------------------------------------------------------------
+    // Server / admin commands
+    // ---------------------------------------------------------------
+    async info() {
+        return await this.raw.info();
+    }
+    async clientSetName(name) {
+        return await this.raw.clientSetName(name);
+    }
+    async clientList() {
+        return await this.raw.sendCommand(['CLIENT', 'LIST']);
+    }
+    // ---------------------------------------------------------------
+    // Key scanning
+    // ---------------------------------------------------------------
+    async scan(cursor, options) {
+        const opts = {};
+        if (options === null || options === void 0 ? void 0 : options.MATCH) {
+            opts.MATCH = options.MATCH;
+        }
+        if (options === null || options === void 0 ? void 0 : options.COUNT) {
+            opts.COUNT = options.COUNT;
+        }
+        const result = await this.raw.scan(String(cursor), opts);
+        return [String(result.cursor), result.keys];
+    }
+    scanStream(options) {
+        const raw = this.raw;
+        const connectPromise = this.connectPromise;
+        const scanOpts = {};
+        if (options.match) {
+            scanOpts.MATCH = options.match;
+        }
+        if (options.count) {
+            scanOpts.COUNT = options.count;
+        }
+        const readable = new Readable({
+            objectMode: true,
+            async read() {
+                var _a, e_1, _b, _c;
+                try {
+                    if (connectPromise) {
+                        await connectPromise;
+                    }
+                    try {
+                        for (var _d = true, _e = __asyncValues(raw.scanIterator(scanOpts)), _f; _f = await _e.next(), _a = _f.done, !_a; _d = true) {
+                            _c = _f.value;
+                            _d = false;
+                            const keys = _c;
+                            if (!readable.push(Array.isArray(keys) ? keys : [keys])) {
+                                return; // backpressure
+                            }
+                        }
+                    }
+                    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+                    finally {
+                        try {
+                            if (!_d && !_a && (_b = _e.return)) await _b.call(_e);
+                        }
+                        finally { if (e_1) throw e_1.error; }
+                    }
+                    readable.push(null); // EOF
+                }
+                catch (err) {
+                    readable.destroy(err);
+                }
+            },
+        });
+        return readable;
+    }
+    // ---------------------------------------------------------------
+    // Extra Redis commands (not part of IRedisClient but used by tests
+    // and occasionally by user code that accesses the raw client).
+    // ---------------------------------------------------------------
+    async keys(pattern) {
+        return await this.raw.keys(pattern);
+    }
+    async exists(...keys) {
+        if (keys.length === 0) {
+            return 0;
+        }
+        return await this.raw.exists(keys);
+    }
+    async zadd(key, ...args) {
+        // ioredis: zadd(key, score, member, score, member, ...)
+        const members = [];
+        for (let i = 0; i < args.length; i += 2) {
+            members.push({ score: Number(args[i]), value: String(args[i + 1]) });
+        }
+        return await this.raw.zAdd(key, members);
+    }
+    async zrem(key, ...members) {
+        return await this.raw.zRem(key, members);
+    }
+    async xlen(key) {
+        return await this.raw.xLen(key);
+    }
+    async xrevrange(key, end, start, ...rest) {
+        const opts = {};
+        // ioredis: xrevrange(key, end, start, 'COUNT', n)
+        if (rest[0] === 'COUNT') {
+            opts.COUNT = Number(rest[1]);
+        }
+        const result = await this.raw.xRevRange(key, end, start, opts);
+        // Normalize to ioredis format: [[id, [field, value, …]], …]
+        return result.map((msg) => [
+            msg.id,
+            Object.entries(msg.message).flat(),
+        ]);
+    }
+    async sadd(key, ...members) {
+        return await this.raw.sAdd(key, members.map(String));
+    }
+    async scard(key) {
+        return await this.raw.sCard(key);
+    }
+    async lpush(key, ...values) {
+        return await this.raw.lPush(key, values);
+    }
+    async rpop(key) {
+        return await this.raw.rPop(key);
+    }
+    async incr(key) {
+        return await this.raw.incr(key);
+    }
+    async incrby(key, increment) {
+        return await this.raw.incrBy(key, increment);
+    }
+    async flushall() {
+        return await this.raw.flushAll();
+    }
+}
+// ---------------------------------------------------------------------------
+// Transaction / Pipeline wrapper
+// ---------------------------------------------------------------------------
+class NodeRedisTransaction {
+    constructor(raw, scripts) {
+        this.raw = raw;
+        this.scripts = scripts;
+        this.transformers = [];
+    }
+    addIdentityTransformer() {
+        this.transformers.push((v) => v);
+    }
+    hgetall(key) {
+        this.raw.hGetAll(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    hset(key, data) {
+        this.raw.hSet(key, data);
+        this.addIdentityTransformer();
+        return this;
+    }
+    hscan(key, cursor, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        this.raw.hScan(key, String(cursor), opts);
+        // Transform node-redis { cursor, entries: [{field, value}] }
+        // to ioredis [cursor, [field, value, field, value, ...]]
+        this.transformers.push((val) => {
+            if (!val) {
+                return ['0', []];
+            }
+            const flat = [];
+            for (const entry of val.entries || []) {
+                flat.push(entry.field, entry.value);
+            }
+            return [String(val.cursor), flat];
+        });
+        return this;
+    }
+    smembers(key) {
+        this.raw.sMembers(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    sscan(key, cursor, options) {
+        const opts = {};
+        if ((options === null || options === void 0 ? void 0 : options.COUNT) != null) {
+            opts.COUNT = options.COUNT;
+        }
+        this.raw.sScan(key, String(cursor), opts);
+        // Transform node-redis { cursor, members: [...] }
+        // to ioredis [cursor, [member, member, ...]]
+        this.transformers.push((val) => {
+            if (!val) {
+                return ['0', []];
+            }
+            return [String(val.cursor), val.members || []];
+        });
+        return this;
+    }
+    zrange(key, start, end) {
+        this.raw.zRange(key, start, end);
+        this.addIdentityTransformer();
+        return this;
+    }
+    lrange(key, start, end) {
+        this.raw.lRange(key, start, end);
+        this.addIdentityTransformer();
+        return this;
+    }
+    llen(key) {
+        this.raw.lLen(key);
+        this.addIdentityTransformer();
+        return this;
+    }
+    del(...keys) {
+        if (keys.length > 0) {
+            this.raw.del(keys);
+            this.addIdentityTransformer();
+        }
+        return this;
+    }
+    runCommand(name, args) {
+        const script = this.scripts.get(name);
+        if (!script) {
+            throw new Error(`BullMQ: unknown command "${name}" in transaction`);
+        }
+        const commandArgs = normalizeScriptArgs(args);
+        const { sha, lua, numberOfKeys } = script;
+        const cmdKeys = commandArgs.slice(0, numberOfKeys).map(String);
+        const argv = commandArgs.slice(numberOfKeys).map((a) => {
+            if (Buffer.isBuffer(a)) {
+                return a;
+            }
+            if (a === undefined || a === null) {
+                return '';
+            }
+            return String(a);
+        });
+        // Use evalSha in pipeline; NOSCRIPT handling happens at exec()-time
+        // node-redis multi supports evalSha
+        this.raw.evalSha(sha, { keys: cmdKeys, arguments: argv });
+        this.addIdentityTransformer();
+        return this;
+    }
+    async exec() {
+        const results = await this.raw.exec();
+        if (!results) {
+            return null;
+        }
+        // node-redis multi.exec() returns values directly (or throws on error).
+        // Normalize to ioredis format: [Error | null, value][]
+        // Apply per-command transformers for format differences (hscan, sscan).
+        return results.map((result, i) => {
+            if (result instanceof Error) {
+                return [result, null];
+            }
+            const transformer = this.transformers[i];
+            const value = transformer ? transformer(result) : result;
+            return [null, value];
+        });
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-base.d.ts b/node_modules/bullmq/dist/esm/classes/queue-base.d.ts
new file mode 100644
index 0000000..1348ee8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-base.d.ts
@@ -0,0 +1,83 @@
+import { EventEmitter } from 'events';
+import { MinimalQueue, QueueBaseOptions, RedisClient, Span } from '../interfaces';
+import { RedisConnection } from './redis-connection';
+import { Job } from './job';
+import { KeysMap } from './queue-keys';
+import { Scripts } from './scripts';
+import { SpanKind } from '../enums';
+import { DatabaseType } from '../types/database-type';
+/**
+ * Base class for all classes that need to interact with queues.
+ * This class is normally not used directly, but extended by the other classes.
+ *
+ */
+export declare class QueueBase extends EventEmitter implements MinimalQueue {
+    readonly name: string;
+    opts: QueueBaseOptions;
+    toKey: (type: string) => string;
+    keys: KeysMap;
+    closing: Promise<void> | undefined;
+    protected closed: boolean;
+    protected hasBlockingConnection: boolean;
+    protected scripts: Scripts;
+    protected connection: RedisConnection;
+    readonly qualifiedName: string;
+    /**
+     *
+     * @param name - The name of the queue.
+     * @param opts - Options for the queue.
+     * @param Connection - An optional "Connection" class used to instantiate a Connection. This is useful for
+     * testing with mockups and/or extending the Connection class and passing an alternate implementation.
+     */
+    constructor(name: string, opts?: QueueBaseOptions, Connection?: typeof RedisConnection, hasBlockingConnection?: boolean);
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client(): Promise<RedisClient>;
+    protected createScripts(): void;
+    /**
+     * Returns the version of the Redis instance the client is connected to,
+     */
+    get redisVersion(): string;
+    /**
+     * Returns the database type of the Redis instance the client is connected to,
+     */
+    get databaseType(): DatabaseType;
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    protected get Job(): typeof Job;
+    /**
+     * Emits an event. Normally used by subclasses to emit events.
+     *
+     * @param event - The emitted event.
+     * @param args - The arguments to pass to the event listeners.
+     * @returns True if the event had listeners, false otherwise.
+     */
+    emit(event: string | symbol, ...args: any[]): boolean;
+    waitUntilReady(): Promise<RedisClient>;
+    protected base64Name(): string;
+    protected clientName(suffix?: string): string;
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    close(): Promise<void>;
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect(): Promise<void>;
+    protected checkConnectionError<T>(fn: () => Promise<T>, delayInMs?: number): Promise<T | undefined>;
+    /**
+     * Wraps the code with telemetry and provides a span for configuration.
+     *
+     * @param spanKind - kind of the span: Producer, Consumer, Internal
+     * @param operation - operation name (such as add, process, etc)
+     * @param destination - destination name (normally the queue name)
+     * @param callback - code to wrap with telemetry
+     * @param srcPropagationMetadata - The source propagation metadata for telemetry context.
+     * @returns The result of the callback function.
+     */
+    trace<T>(spanKind: SpanKind, operation: string, destination: string, callback: (span?: Span, dstPropagationMetadata?: string) => Promise<T> | T, srcPropagationMetadata?: string): Promise<T | Promise<T>>;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-base.js b/node_modules/bullmq/dist/esm/classes/queue-base.js
new file mode 100644
index 0000000..21ee295
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-base.js
@@ -0,0 +1,158 @@
+import { EventEmitter } from 'events';
+import { delay, DELAY_TIME_5, isNotConnectionError, isRedisInstance, trace, } from '../utils';
+import { createScripts } from '../utils/create-scripts';
+import { RedisConnection } from './redis-connection';
+import { Job } from './job';
+import { QueueKeys } from './queue-keys';
+/**
+ * Base class for all classes that need to interact with queues.
+ * This class is normally not used directly, but extended by the other classes.
+ *
+ */
+export class QueueBase extends EventEmitter {
+    /**
+     *
+     * @param name - The name of the queue.
+     * @param opts - Options for the queue.
+     * @param Connection - An optional "Connection" class used to instantiate a Connection. This is useful for
+     * testing with mockups and/or extending the Connection class and passing an alternate implementation.
+     */
+    constructor(name, opts = { connection: {} }, Connection = RedisConnection, hasBlockingConnection = false) {
+        super();
+        this.name = name;
+        this.opts = opts;
+        this.closed = false;
+        this.hasBlockingConnection = false;
+        this.hasBlockingConnection = hasBlockingConnection;
+        this.opts = Object.assign({ prefix: 'bull' }, opts);
+        if (!name) {
+            throw new Error('Queue name must be provided');
+        }
+        if (name.includes(':')) {
+            throw new Error('Queue name cannot contain :');
+        }
+        this.connection = new Connection(opts.connection, {
+            shared: isRedisInstance(opts.connection),
+            blocking: hasBlockingConnection,
+            skipVersionCheck: opts.skipVersionCheck,
+            skipWaitingForReady: opts.skipWaitingForReady,
+        });
+        this.connection.on('error', (error) => this.emit('error', error));
+        this.connection.on('close', () => {
+            if (!this.closing) {
+                this.emit('ioredis:close');
+            }
+        });
+        const queueKeys = new QueueKeys(opts.prefix);
+        this.qualifiedName = queueKeys.getQueueQualifiedName(name);
+        this.keys = queueKeys.getKeys(name);
+        this.toKey = (type) => queueKeys.toKey(name, type);
+        this.createScripts();
+    }
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client() {
+        return this.connection.client;
+    }
+    createScripts() {
+        this.scripts = createScripts(this);
+    }
+    /**
+     * Returns the version of the Redis instance the client is connected to,
+     */
+    get redisVersion() {
+        return this.connection.redisVersion;
+    }
+    /**
+     * Returns the database type of the Redis instance the client is connected to,
+     */
+    get databaseType() {
+        return this.connection.databaseType;
+    }
+    /**
+     * Helper to easily extend Job class calls.
+     */
+    get Job() {
+        return Job;
+    }
+    /**
+     * Emits an event. Normally used by subclasses to emit events.
+     *
+     * @param event - The emitted event.
+     * @param args - The arguments to pass to the event listeners.
+     * @returns True if the event had listeners, false otherwise.
+     */
+    emit(event, ...args) {
+        try {
+            return super.emit(event, ...args);
+        }
+        catch (err) {
+            try {
+                return super.emit('error', err);
+            }
+            catch (err) {
+                // We give up if the error event also throws an exception.
+                console.error(err);
+                return false;
+            }
+        }
+    }
+    waitUntilReady() {
+        return this.client;
+    }
+    base64Name() {
+        return Buffer.from(this.name).toString('base64');
+    }
+    clientName(suffix = '') {
+        const queueNameBase64 = this.base64Name();
+        return `${this.opts.prefix}:${queueNameBase64}${suffix}`;
+    }
+    /**
+     *
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+        this.closed = true;
+    }
+    /**
+     *
+     * Force disconnects a connection.
+     */
+    disconnect() {
+        return this.connection.disconnect();
+    }
+    async checkConnectionError(fn, delayInMs = DELAY_TIME_5) {
+        try {
+            return await fn();
+        }
+        catch (error) {
+            if (isNotConnectionError(error)) {
+                this.emit('error', error);
+            }
+            if (!this.closing && delayInMs) {
+                await delay(delayInMs);
+            }
+            else {
+                return;
+            }
+        }
+    }
+    /**
+     * Wraps the code with telemetry and provides a span for configuration.
+     *
+     * @param spanKind - kind of the span: Producer, Consumer, Internal
+     * @param operation - operation name (such as add, process, etc)
+     * @param destination - destination name (normally the queue name)
+     * @param callback - code to wrap with telemetry
+     * @param srcPropagationMetadata - The source propagation metadata for telemetry context.
+     * @returns The result of the callback function.
+     */
+    trace(spanKind, operation, destination, callback, srcPropagationMetadata) {
+        return trace(this.opts.telemetry, spanKind, this.name, operation, destination, callback, srcPropagationMetadata);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-events-producer.d.ts b/node_modules/bullmq/dist/esm/classes/queue-events-producer.d.ts
new file mode 100644
index 0000000..9ce8eeb
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-events-producer.d.ts
@@ -0,0 +1,21 @@
+import { QueueEventsProducerOptions } from '../interfaces';
+import { QueueBase } from './queue-base';
+import { RedisConnection } from './redis-connection';
+/**
+ * The QueueEventsProducer class is used for publishing custom events.
+ */
+export declare class QueueEventsProducer extends QueueBase {
+    constructor(name: string, opts?: QueueEventsProducerOptions, Connection?: typeof RedisConnection);
+    /**
+     * Publish custom event to be processed in QueueEvents.
+     * @param argsObj - Event payload
+     * @param maxEvents - Max quantity of events to be saved
+     */
+    publishEvent<T extends {
+        eventName: string;
+    }>(argsObj: T, maxEvents?: number): Promise<void>;
+    /**
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    close(): Promise<void>;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-events-producer.js b/node_modules/bullmq/dist/esm/classes/queue-events-producer.js
new file mode 100644
index 0000000..e19f39e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-events-producer.js
@@ -0,0 +1,37 @@
+import { __rest } from "tslib";
+import { QueueBase } from './queue-base';
+/**
+ * The QueueEventsProducer class is used for publishing custom events.
+ */
+export class QueueEventsProducer extends QueueBase {
+    constructor(name, opts = {
+        connection: {},
+    }, Connection) {
+        super(name, Object.assign({ blockingConnection: false }, opts), Connection);
+        this.opts = opts;
+    }
+    /**
+     * Publish custom event to be processed in QueueEvents.
+     * @param argsObj - Event payload
+     * @param maxEvents - Max quantity of events to be saved
+     */
+    async publishEvent(argsObj, maxEvents = 1000) {
+        const client = await this.client;
+        const key = this.keys.events;
+        const { eventName } = argsObj, restArgs = __rest(argsObj, ["eventName"]);
+        const fields = Object.assign({ event: eventName }, restArgs);
+        await client.xadd(key, '*', fields, {
+            MAXLEN: maxEvents,
+            approximate: true,
+        });
+    }
+    /**
+     * Closes the connection and returns a promise that resolves when the connection is closed.
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = this.connection.close();
+        }
+        await this.closing;
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-events.d.ts b/node_modules/bullmq/dist/esm/classes/queue-events.d.ts
new file mode 100644
index 0000000..e6cd8ef
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-events.d.ts
@@ -0,0 +1,293 @@
+import { JobProgress } from '../types';
+import { IoredisListener, QueueEventsOptions } from '../interfaces';
+import { QueueBase } from './queue-base';
+import { RedisConnection } from './redis-connection';
+export interface QueueEventsListener extends IoredisListener {
+    /**
+     * Listen to 'active' event.
+     *
+     * This event is triggered when a job enters the 'active' state, meaning it is being processed.
+     *
+     * @param args - An object containing details about the job that became active.
+     *   - `jobId`: The unique identifier of the job that entered the active state.
+     *   - `prev`: The previous state of the job before it became active (e.g., 'waiting'), if applicable.
+     *
+     * @param id - The identifier of the event.
+     */
+    active: (args: {
+        jobId: string;
+        prev?: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'added' event.
+     *
+     * This event is triggered when a job is created and added to the queue.
+     *
+     * @param args - An object containing details about the newly added job.
+     *   - `jobId` - The unique identifier of the job that was added.
+     *   - `name` - The name of the job, typically indicating its type or purpose.
+     * @param id - The identifier of the event.
+     */
+    added: (args: {
+        jobId: string;
+        name: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'cleaned' event.
+     *
+     * This event is triggered when jobs are cleaned (e.g., removed) from the queue, typically via a cleanup method.
+     *
+     * @param args - An object containing the count of cleaned jobs.
+     *   - `count` - The number of jobs that were cleaned, represented as a string due to Redis serialization.
+     * @param id - The identifier of the event.
+     */
+    cleaned: (args: {
+        count: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'completed' event.
+     *
+     * This event is triggered when a job has successfully completed its execution.
+     *
+     * @param args - An object containing details about the completed job.
+     *   - `jobId` - The unique identifier of the job that completed.
+     *   - `returnvalue` - The return value of the job, serialized as a string.
+     *   - `prev` - The previous state of the job before completion (e.g., 'active'), if applicable.
+     * @param id - The identifier of the event.
+     */
+    completed: (args: {
+        jobId: string;
+        returnvalue: string;
+        prev?: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'debounced' event.
+     *
+     * @deprecated Use the 'deduplicated' event instead.
+     *
+     * This event is triggered when a job is debounced because a job with the same debounceId still exists.
+     *
+     * @param args - An object containing details about the debounced job.
+     *   - `jobId` - The unique identifier of the job that was debounced.
+     *   - `debounceId` - The identifier used to debounce the job, preventing duplicate processing.
+     * @param id - The identifier of the event.
+     */
+    debounced: (args: {
+        jobId: string;
+        debounceId: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'deduplicated' event.
+     *
+     * This event is triggered when a job is not added to the queue because a job with the same deduplicationId
+     * already exists.
+     *
+     * @param args - An object containing details about the deduplicated job.
+     *  - `jobId` - The unique identifier of the job that was attempted to be added.
+     *  - `deduplicationId` - The deduplication identifier that caused the job to be deduplicated.
+     *  - `deduplicatedJobId` - The unique identifier of the existing job that caused the deduplication.
+     * @param id - The identifier of the event.
+     */
+    deduplicated: (args: {
+        jobId: string;
+        deduplicationId: string;
+        deduplicatedJobId: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'delayed' event.
+     *
+     * This event is triggered when a job is scheduled with a delay before it becomes active.
+     *
+     * @param args - An object containing details about the delayed job.
+     *  - `jobId` - The unique identifier of the job that was delayed.
+     *  - `delay` - The delay duration in milliseconds before the job becomes active.
+     * @param id - The identifier of the event.
+     */
+    delayed: (args: {
+        jobId: string;
+        delay: number;
+    }, id: string) => void;
+    /**
+     * Listen to 'drained' event.
+     *
+     * This event is triggered when the queue has drained its waiting list, meaning there are no jobs
+     * in the 'waiting' state.
+     * Note that there could still be delayed jobs waiting their timers to expire
+     * and this event will still be triggered as long as the waiting list has emptied.
+     *
+     * @param id - The identifier of the event.
+     */
+    drained: (id: string) => void;
+    /**
+     * Listen to 'duplicated' event.
+     *
+     * This event is triggered when a job is not created because a job with the same identifier already exists.
+     *
+     * @param args - An object containing the job identifier.
+     *  - `jobId` - The unique identifier of the job that was attempted to be added.
+     * @param id - The identifier of the event.
+     */
+    duplicated: (args: {
+        jobId: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'error' event.
+     *
+     * This event is triggered when an error in the Redis backend is thrown.
+     *
+     * @param args - The error that was thrown.
+     */
+    error: (args: Error) => void;
+    /**
+     * Listen to 'failed' event.
+     *
+     * This event is triggered when a job fails by throwing an exception during execution.
+     *
+     * @param args - An object containing details about the failed job.
+     *  - `jobId` - The unique identifier of the job that failed.
+     *  - `failedReason` - The reason or message describing why the job failed.
+     *  - `prev` - The previous state of the job before failure (e.g., 'active'), if applicable.
+     * @param id - The identifier of the event.
+     */
+    failed: (args: {
+        jobId: string;
+        failedReason: string;
+        prev?: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'paused' event.
+     *
+     * This event is triggered when the queue is paused, halting the processing of new jobs.
+     *
+     * @param args - An empty object (no additional data provided).
+     * @param id - The identifier of the event.
+     */
+    paused: (args: object, id: string) => void;
+    /**
+     * Listen to 'progress' event.
+     *
+     * This event is triggered when a job updates its progress via the `Job#updateProgress()` method, allowing
+     * progress or custom data to be communicated externally.
+     *
+     * @param args - An object containing the job identifier and progress data.
+     *  - `jobId` - The unique identifier of the job reporting progress.
+     *  - `data` - The progress data, which can be a number (e.g., percentage) or an object with custom data.
+     * @param id - The identifier of the event.
+     */
+    progress: (args: {
+        jobId: string;
+        data: JobProgress;
+    }, id: string) => void;
+    /**
+     * Listen to 'removed' event.
+     *
+     * This event is triggered when a job is manually removed from the queue.
+     *
+     * @param args - An object containing details about the removed job.
+     *  - `jobId` - The unique identifier of the job that was removed.
+     *  - `prev` - The previous state of the job before removal (e.g., 'active' or 'waiting').
+     * @param id - The identifier of the event.
+     */
+    removed: (args: {
+        jobId: string;
+        prev: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'resumed' event.
+     *
+     * This event is triggered when the queue is resumed, allowing job processing to continue.
+     *
+     * @param args - An empty object (no additional data provided).
+     * @param id - The identifier of the event.
+     */
+    resumed: (args: object, id: string) => void;
+    /**
+     * Listen to 'retries-exhausted' event.
+     *
+     * This event is triggered when a job has exhausted its maximum retry attempts after repeated failures.
+     *
+     * @param args - An object containing details about the job that exhausted retries.
+     *  - `jobId` - The unique identifier of the job that exhausted its retries.
+     *  - `attemptsMade` - The number of retry attempts made, represented as a string
+     * (due to Redis serialization).
+     * @param id - The identifier of the event.
+     */
+    'retries-exhausted': (args: {
+        jobId: string;
+        attemptsMade: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'stalled' event.
+     *
+     * This event is triggered when a job moves from 'active' back to 'waiting' or
+     * 'failed' because the processor could not renew its lock, indicating a
+     * potential processing issue.
+     *
+     * @param args - An object containing the job identifier.
+     *  - `jobId` - The unique identifier of the job that stalled.
+     * @param id - The identifier of the event.
+     */
+    stalled: (args: {
+        jobId: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'waiting' event.
+     *
+     * This event is triggered when a job enters the 'waiting' state, indicating it is queued and
+     * awaiting processing.
+     *
+     * @param args - An object containing details about the job in the waiting state.
+     *  - `jobId` - The unique identifier of the job that is waiting.
+     *  - `prev` - The previous state of the job before entering 'waiting' (e.g., 'stalled'),
+     * if applicable.
+     * @param id - The identifier of the event.
+     */
+    waiting: (args: {
+        jobId: string;
+        prev?: string;
+    }, id: string) => void;
+    /**
+     * Listen to 'waiting-children' event.
+     *
+     * This event is triggered when a job enters the 'waiting-children' state, indicating it is
+     * waiting for its child jobs to complete.
+     *
+     * @param args - An object containing the job identifier.
+     *  - `jobId` - The unique identifier of the job waiting for its children.
+     * @param id - The identifier of the event.
+     */
+    'waiting-children': (args: {
+        jobId: string;
+    }, id: string) => void;
+}
+type CustomParameters<T> = T extends (...args: infer Args) => void ? Args : never;
+type KeyOf<T extends object> = Extract<keyof T, string>;
+/**
+ * The QueueEvents class is used for listening to the global events
+ * emitted by a given queue.
+ *
+ * This class requires a dedicated redis connection.
+ *
+ */
+export declare class QueueEvents extends QueueBase {
+    private running;
+    private blocking;
+    constructor(name: string, { connection, autorun, ...opts }?: QueueEventsOptions, Connection?: typeof RedisConnection);
+    emit<QEL extends QueueEventsListener = QueueEventsListener, U extends KeyOf<QEL> = KeyOf<QEL>>(event: U, ...args: CustomParameters<QEL[U]>): boolean;
+    off<QEL extends QueueEventsListener = QueueEventsListener, U extends KeyOf<QEL> = KeyOf<QEL>>(eventName: U, listener: QEL[U]): this;
+    on<QEL extends QueueEventsListener = QueueEventsListener, U extends KeyOf<QEL> = KeyOf<QEL>>(event: U, listener: QEL[U]): this;
+    once<QEL extends QueueEventsListener = QueueEventsListener, U extends KeyOf<QEL> = KeyOf<QEL>>(event: U, listener: QEL[U]): this;
+    /**
+     * Manually starts running the event consumming loop. This shall be used if you do not
+     * use the default "autorun" option on the constructor.
+     */
+    run(): Promise<void>;
+    private consumeEvents;
+    /**
+     * Stops consuming events and close the underlying Redis connection if necessary.
+     *
+     * @returns
+     */
+    close(): Promise<void>;
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/queue-events.js b/node_modules/bullmq/dist/esm/classes/queue-events.js
new file mode 100644
index 0000000..a1e15b9
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-events.js
@@ -0,0 +1,138 @@
+import { __rest } from "tslib";
+import { array2obj, clientCommandMessageReg, isRedisInstance, QUEUE_EVENT_SUFFIX, } from '../utils';
+import { QueueBase } from './queue-base';
+import { createIORedisClient, isIRedisClient } from './ioredis-client';
+/**
+ * The QueueEvents class is used for listening to the global events
+ * emitted by a given queue.
+ *
+ * This class requires a dedicated redis connection.
+ *
+ */
+export class QueueEvents extends QueueBase {
+    constructor(name, _a = {
+        connection: {},
+    }, Connection) {
+        var { connection, autorun = true } = _a, opts = __rest(_a, ["connection", "autorun"]);
+        super(name, Object.assign(Object.assign({}, opts), { connection: isRedisInstance(connection)
+                ? (isIRedisClient(connection)
+                    ? connection
+                    : createIORedisClient(connection)).duplicate()
+                : connection }), Connection, true);
+        this.running = false;
+        this.blocking = false;
+        this.opts = Object.assign({
+            blockingTimeout: 10000,
+        }, this.opts);
+        if (autorun) {
+            this.run().catch(error => this.emit('error', error));
+        }
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Manually starts running the event consumming loop. This shall be used if you do not
+     * use the default "autorun" option on the constructor.
+     */
+    async run() {
+        if (!this.running) {
+            try {
+                this.running = true;
+                const client = await this.client;
+                // TODO: Planned for deprecation as it really has no use case
+                try {
+                    await client.clientSetName(this.clientName(QUEUE_EVENT_SUFFIX));
+                }
+                catch (err) {
+                    if (!clientCommandMessageReg.test(err.message) &&
+                        !this.closing) {
+                        throw err;
+                    }
+                }
+                await this.consumeEvents(client);
+            }
+            catch (error) {
+                this.running = false;
+                throw error;
+            }
+        }
+        else {
+            throw new Error('Queue Events is already running.');
+        }
+    }
+    async consumeEvents(client) {
+        const opts = this.opts;
+        const key = this.keys.events;
+        let id = opts.lastEventId || '$';
+        while (!this.closing) {
+            this.blocking = true;
+            // Cast to actual return type, see: https://github.com/DefinitelyTyped/DefinitelyTyped/issues/44301
+            const data = await this.checkConnectionError(() => client.xread([{ key, id }], { BLOCK: opts.blockingTimeout }));
+            this.blocking = false;
+            if (data) {
+                const stream = data[0];
+                const events = stream[1];
+                for (let i = 0; i < events.length; i++) {
+                    id = events[i][0];
+                    const args = array2obj(events[i][1]);
+                    //
+                    // TODO: we may need to have a separate stream for progress data
+                    // to avoid this hack.
+                    switch (args.event) {
+                        case 'progress':
+                            args.data = JSON.parse(args.data);
+                            break;
+                        case 'completed':
+                            args.returnvalue = JSON.parse(args.returnvalue);
+                            break;
+                    }
+                    const { event } = args, restArgs = __rest(args, ["event"]);
+                    if (event === 'drained') {
+                        this.emit(event, id);
+                    }
+                    else {
+                        this.emit(event, restArgs, id);
+                        if (restArgs.jobId) {
+                            this.emit(`${event}:${restArgs.jobId}`, restArgs, id);
+                        }
+                    }
+                }
+            }
+        }
+    }
+    /**
+     * Stops consuming events and close the underlying Redis connection if necessary.
+     *
+     * @returns
+     */
+    async close() {
+        if (!this.closing) {
+            this.closing = (async () => {
+                try {
+                    // As the connection has been wrongly marked as "shared" by QueueBase,
+                    // we need to forcibly close it here. We should fix QueueBase to avoid this in the future.
+                    const client = await this.client;
+                    client.disconnect();
+                    await this.connection.close(this.blocking);
+                }
+                finally {
+                    this.closed = true;
+                }
+            })();
+        }
+        return this.closing;
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-getters.d.ts b/node_modules/bullmq/dist/esm/classes/queue-getters.d.ts
new file mode 100644
index 0000000..06b570f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-getters.d.ts
@@ -0,0 +1,269 @@
+import { QueueBase } from './queue-base';
+import { Job } from './job';
+import { JobState, JobType } from '../types';
+import { JobJsonRaw, Metrics, QueueMeta } from '../interfaces';
+/**
+ * Provides different getters for different aspects of a queue.
+ */
+export declare class QueueGetters<JobBase extends Job = Job> extends QueueBase {
+    getJob(jobId: string): Promise<JobBase | undefined>;
+    private commandByType;
+    private sanitizeJobTypes;
+    /**
+      Returns the number of jobs waiting to be processed. This includes jobs that are
+      "waiting" or "delayed" or "prioritized" or "waiting-children".
+    */
+    count(): Promise<number>;
+    /**
+     * Returns the time to live for a rate limited key in milliseconds.
+     * @param maxJobs - max jobs to be considered in rate limit state. If not passed
+     * it will return the remaining ttl without considering if max jobs is exceeded.
+     * @returns -2 if the key does not exist.
+     * -1 if the key exists but has no associated expire.
+     * @see {@link https://redis.io/commands/pttl/}
+     */
+    getRateLimitTtl(maxJobs?: number): Promise<number>;
+    /**
+     * Get jobId that starts debounced state.
+     * @deprecated use getDeduplicationJobId method
+     *
+     * @param id - debounce identifier
+     */
+    getDebounceJobId(id: string): Promise<string | null>;
+    /**
+     * Get jobId from deduplicated state.
+     *
+     * @param id - deduplication identifier
+     */
+    getDeduplicationJobId(id: string): Promise<string | null>;
+    /**
+     * Get global concurrency value.
+     * Returns null in case no value is set.
+     */
+    getGlobalConcurrency(): Promise<number | null>;
+    /**
+     * Get global rate limit values.
+     * Returns null in case no value is set.
+     */
+    getGlobalRateLimit(): Promise<{
+        max: number;
+        duration: number;
+    } | null>;
+    /**
+     * Job counts by type
+     *
+     * Queue#getJobCountByTypes('completed') =\> completed count
+     * Queue#getJobCountByTypes('completed', 'failed') =\> completed + failed count
+     * Queue#getJobCountByTypes('completed', 'waiting', 'failed') =\> completed + waiting + failed count
+     */
+    getJobCountByTypes(...types: JobType[]): Promise<number>;
+    /**
+     * Returns the job counts for each type specified or every list/set in the queue by default.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    getJobCounts(...types: JobType[]): Promise<{
+        [index: string]: number;
+    }>;
+    /**
+     * Records job counts as gauge metrics for telemetry purposes.
+     * Each job state count is recorded with the queue name and state as attributes.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    recordJobCountsMetric(...types: JobType[]): Promise<{
+        [index: string]: number;
+    }>;
+    /**
+     * Get current job state.
+     *
+     * @param jobId - job identifier.
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getJobState(jobId: string): Promise<JobState | 'unknown'>;
+    /**
+     * Get global queue configuration.
+     *
+     * @returns Returns the global queue configuration.
+     */
+    getMeta(): Promise<QueueMeta>;
+    /**
+     * @returns Returns the number of jobs in completed status.
+     */
+    getCompletedCount(): Promise<number>;
+    /**
+     * Returns the number of jobs in failed status.
+     */
+    getFailedCount(): Promise<number>;
+    /**
+     * Returns the number of jobs in delayed status.
+     */
+    getDelayedCount(): Promise<number>;
+    /**
+     * Returns the number of jobs in active status.
+     */
+    getActiveCount(): Promise<number>;
+    /**
+     * Returns the number of jobs in prioritized status.
+     */
+    getPrioritizedCount(): Promise<number>;
+    /**
+     * Returns the number of jobs per priority.
+     */
+    getCountsPerPriority(priorities: number[]): Promise<{
+        [index: string]: number;
+    }>;
+    /**
+     * Returns the number of jobs in waiting or paused statuses.
+     */
+    getWaitingCount(): Promise<number>;
+    /**
+     * Returns the number of jobs in waiting-children status.
+     */
+    getWaitingChildrenCount(): Promise<number>;
+    /**
+     * Returns the jobs that are in the "waiting" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaiting(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "waiting-children" status.
+     * I.E. parent jobs that have at least one child that has not completed yet.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaitingChildren(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "active" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getActive(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "delayed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getDelayed(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "prioritized" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getPrioritized(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "completed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getCompleted(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the jobs that are in the "failed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getFailed(start?: number, end?: number): Promise<JobBase[]>;
+    /**
+     * Returns the qualified job ids and the raw job data (if available) of the
+     * children jobs of the given parent job.
+     * It is possible to get either the already processed children, in this case
+     * an array of qualified job ids and their result values will be returned,
+     * or the pending children, in this case an array of qualified job ids will
+     * be returned.
+     * A qualified job id is a string representing the job id in a given queue,
+     * for example: "bull:myqueue:jobid".
+     *
+     * @param parentId - The id of the parent job
+     * @param type - "processed" | "pending"
+     * @param opts - Options for the query.
+     *
+     * @returns an object with the following shape:
+     * `{ items: { id: string, v?: any, err?: string } [], jobs: JobJsonRaw[], total: number}`
+     */
+    getDependencies(parentId: string, type: 'processed' | 'pending', start: number, end: number): Promise<{
+        items: {
+            id: string;
+            v?: any;
+            err?: string;
+        }[];
+        jobs: JobJsonRaw[];
+        total: number;
+    }>;
+    getRanges(types: JobType[], start?: number, end?: number, asc?: boolean): Promise<string[]>;
+    /**
+     * Returns the jobs that are on the given statuses (note that JobType is synonym for job status)
+     * @param types - the statuses of the jobs to return.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    getJobs(types?: JobType[] | JobType, start?: number, end?: number, asc?: boolean): Promise<JobBase[]>;
+    /**
+     * Returns the logs for a given Job.
+     * @param jobId - the id of the job to get the logs for.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    getJobLogs(jobId: string, start?: number, end?: number, asc?: boolean): Promise<{
+        logs: string[];
+        count: number;
+    }>;
+    private baseGetClients;
+    /**
+     * Get the worker list related to the queue. i.e. all the known
+     * workers that are available to process jobs for this queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @returns - Returns an array with workers info.
+     */
+    getWorkers(): Promise<{
+        [index: string]: string;
+    }[]>;
+    /**
+     * Returns the current count of workers for the queue.
+     *
+     * getWorkersCount(): Promise<number>
+     *
+     */
+    getWorkersCount(): Promise<number>;
+    /**
+     * Get queue events list related to the queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @deprecated do not use this method, it will be removed in the future.
+     *
+     * @returns - Returns an array with queue events info.
+     */
+    getQueueEvents(): Promise<{
+        [index: string]: string;
+    }[]>;
+    /**
+     * Get queue metrics related to the queue.
+     *
+     * This method returns the gathered metrics for the queue.
+     * The metrics are represented as an array of job counts
+     * per unit of time (1 minute).
+     *
+     * @param start - Start point of the metrics, where 0
+     * is the newest point to be returned.
+     * @param end - End point of the metrics, where -1 is the
+     * oldest point to be returned.
+     *
+     * @returns - Returns an object with queue metrics.
+     */
+    getMetrics(type: 'completed' | 'failed', start?: number, end?: number): Promise<Metrics>;
+    private parseClientList;
+    /**
+     * Export the metrics for the queue in the Prometheus format.
+     * Automatically exports all the counts returned by getJobCounts().
+     *
+     * @returns - Returns a string with the metrics in the Prometheus format.
+     *
+     * @see {@link https://prometheus.io/docs/instrumenting/exposition_formats/}
+     *
+     **/
+    exportPrometheusMetrics(globalVariables?: Record<string, string>): Promise<string>;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-getters.js b/node_modules/bullmq/dist/esm/classes/queue-getters.js
new file mode 100644
index 0000000..da34bc8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-getters.js
@@ -0,0 +1,570 @@
+'use strict';
+import { __rest } from "tslib";
+import { QueueBase } from './queue-base';
+import { clientCommandMessageReg, QUEUE_EVENT_SUFFIX } from '../utils';
+import { MetricNames, TelemetryAttributes } from '../enums';
+/**
+ * Escape a Prometheus label value per the text exposition format.
+ * https://prometheus.io/docs/instrumenting/exposition_formats/
+ *
+ * Backslashes, double quotes, and newlines must be escaped.
+ */
+function escapePrometheusLabelValue(value) {
+    return String(value)
+        .replace(/\\/g, '\\\\')
+        .replace(/"/g, '\\"')
+        .replace(/\n/g, '\\n');
+}
+/**
+ * Provides different getters for different aspects of a queue.
+ */
+export class QueueGetters extends QueueBase {
+    getJob(jobId) {
+        return this.Job.fromId(this, jobId);
+    }
+    commandByType(types, count, callback) {
+        return types.map((type) => {
+            type = type === 'waiting' ? 'wait' : type; // alias
+            const key = this.toKey(type);
+            switch (type) {
+                case 'completed':
+                case 'failed':
+                case 'delayed':
+                case 'prioritized':
+                case 'repeat':
+                case 'waiting-children':
+                    return callback(key, count ? 'zcard' : 'zrange');
+                case 'active':
+                case 'wait':
+                case 'paused':
+                    return callback(key, count ? 'llen' : 'lrange');
+            }
+        });
+    }
+    sanitizeJobTypes(types) {
+        const currentTypes = typeof types === 'string' ? [types] : types;
+        if (Array.isArray(currentTypes) && currentTypes.length > 0) {
+            const sanitizedTypes = [...currentTypes];
+            if (sanitizedTypes.indexOf('waiting') !== -1) {
+                sanitizedTypes.push('paused');
+            }
+            return [...new Set(sanitizedTypes)];
+        }
+        return [
+            'active',
+            'completed',
+            'delayed',
+            'failed',
+            'paused',
+            'prioritized',
+            'waiting',
+            'waiting-children',
+        ];
+    }
+    /**
+      Returns the number of jobs waiting to be processed. This includes jobs that are
+      "waiting" or "delayed" or "prioritized" or "waiting-children".
+    */
+    async count() {
+        const count = await this.getJobCountByTypes('waiting', 'paused', 'delayed', 'prioritized', 'waiting-children');
+        return count;
+    }
+    /**
+     * Returns the time to live for a rate limited key in milliseconds.
+     * @param maxJobs - max jobs to be considered in rate limit state. If not passed
+     * it will return the remaining ttl without considering if max jobs is exceeded.
+     * @returns -2 if the key does not exist.
+     * -1 if the key exists but has no associated expire.
+     * @see {@link https://redis.io/commands/pttl/}
+     */
+    async getRateLimitTtl(maxJobs) {
+        return this.scripts.getRateLimitTtl(maxJobs);
+    }
+    /**
+     * Get jobId that starts debounced state.
+     * @deprecated use getDeduplicationJobId method
+     *
+     * @param id - debounce identifier
+     */
+    async getDebounceJobId(id) {
+        const client = await this.client;
+        return client.get(`${this.keys.de}:${id}`);
+    }
+    /**
+     * Get jobId from deduplicated state.
+     *
+     * @param id - deduplication identifier
+     */
+    async getDeduplicationJobId(id) {
+        const client = await this.client;
+        return client.get(`${this.keys.de}:${id}`);
+    }
+    /**
+     * Get global concurrency value.
+     * Returns null in case no value is set.
+     */
+    async getGlobalConcurrency() {
+        const client = await this.client;
+        const concurrency = await client.hget(this.keys.meta, 'concurrency');
+        if (concurrency) {
+            return Number(concurrency);
+        }
+        return null;
+    }
+    /**
+     * Get global rate limit values.
+     * Returns null in case no value is set.
+     */
+    async getGlobalRateLimit() {
+        const client = await this.client;
+        const [max, duration] = await client.hmget(this.keys.meta, 'max', 'duration');
+        if (max && duration) {
+            return {
+                max: Number(max),
+                duration: Number(duration),
+            };
+        }
+        return null;
+    }
+    /**
+     * Job counts by type
+     *
+     * Queue#getJobCountByTypes('completed') =\> completed count
+     * Queue#getJobCountByTypes('completed', 'failed') =\> completed + failed count
+     * Queue#getJobCountByTypes('completed', 'waiting', 'failed') =\> completed + waiting + failed count
+     */
+    async getJobCountByTypes(...types) {
+        const result = await this.getJobCounts(...types);
+        return Object.values(result).reduce((sum, count) => sum + count, 0);
+    }
+    /**
+     * Returns the job counts for each type specified or every list/set in the queue by default.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    async getJobCounts(...types) {
+        const currentTypes = this.sanitizeJobTypes(types);
+        const responses = await this.scripts.getCounts(currentTypes);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[currentTypes[index]] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Records job counts as gauge metrics for telemetry purposes.
+     * Each job state count is recorded with the queue name and state as attributes.
+     * @param types - the types of jobs to count. If not specified, it will return the counts for all types.
+     * @returns An object, key (type) and value (count)
+     */
+    async recordJobCountsMetric(...types) {
+        var _a;
+        const counts = await this.getJobCounts(...types);
+        const meter = (_a = this.opts.telemetry) === null || _a === void 0 ? void 0 : _a.meter;
+        if (meter && typeof meter.createGauge === 'function') {
+            const gauge = meter.createGauge(MetricNames.QueueJobsCount, {
+                description: 'Number of jobs in the queue by state',
+                unit: '{jobs}',
+            });
+            for (const [state, jobCount] of Object.entries(counts)) {
+                gauge.record(jobCount, {
+                    [TelemetryAttributes.QueueName]: this.name,
+                    [TelemetryAttributes.QueueJobsState]: state,
+                });
+            }
+        }
+        return counts;
+    }
+    /**
+     * Get current job state.
+     *
+     * @param jobId - job identifier.
+     * @returns Returns one of these values:
+     * 'completed', 'failed', 'delayed', 'active', 'waiting', 'waiting-children', 'unknown'.
+     */
+    getJobState(jobId) {
+        return this.scripts.getState(jobId);
+    }
+    /**
+     * Get global queue configuration.
+     *
+     * @returns Returns the global queue configuration.
+     */
+    async getMeta() {
+        const client = await this.client;
+        const config = await client.hgetall(this.keys.meta);
+        const { concurrency, max, duration, paused, 'opts.maxLenEvents': maxLenEvents } = config, rest = __rest(config, ["concurrency", "max", "duration", "paused", 'opts.maxLenEvents']);
+        const parsedConfig = rest;
+        if (concurrency) {
+            parsedConfig['concurrency'] = Number(concurrency);
+        }
+        if (maxLenEvents) {
+            parsedConfig['maxLenEvents'] = Number(maxLenEvents);
+        }
+        if (max) {
+            parsedConfig['max'] = Number(max);
+        }
+        if (duration) {
+            parsedConfig['duration'] = Number(duration);
+        }
+        parsedConfig['paused'] = paused === '1';
+        return parsedConfig;
+    }
+    /**
+     * @returns Returns the number of jobs in completed status.
+     */
+    getCompletedCount() {
+        return this.getJobCountByTypes('completed');
+    }
+    /**
+     * Returns the number of jobs in failed status.
+     */
+    getFailedCount() {
+        return this.getJobCountByTypes('failed');
+    }
+    /**
+     * Returns the number of jobs in delayed status.
+     */
+    getDelayedCount() {
+        return this.getJobCountByTypes('delayed');
+    }
+    /**
+     * Returns the number of jobs in active status.
+     */
+    getActiveCount() {
+        return this.getJobCountByTypes('active');
+    }
+    /**
+     * Returns the number of jobs in prioritized status.
+     */
+    getPrioritizedCount() {
+        return this.getJobCountByTypes('prioritized');
+    }
+    /**
+     * Returns the number of jobs per priority.
+     */
+    async getCountsPerPriority(priorities) {
+        const uniquePriorities = [...new Set(priorities)];
+        const responses = await this.scripts.getCountsPerPriority(uniquePriorities);
+        const counts = {};
+        responses.forEach((res, index) => {
+            counts[`${uniquePriorities[index]}`] = res || 0;
+        });
+        return counts;
+    }
+    /**
+     * Returns the number of jobs in waiting or paused statuses.
+     */
+    getWaitingCount() {
+        return this.getJobCountByTypes('waiting');
+    }
+    /**
+     * Returns the number of jobs in waiting-children status.
+     */
+    getWaitingChildrenCount() {
+        return this.getJobCountByTypes('waiting-children');
+    }
+    /**
+     * Returns the jobs that are in the "waiting" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaiting(start = 0, end = -1) {
+        return this.getJobs(['waiting'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "waiting-children" status.
+     * I.E. parent jobs that have at least one child that has not completed yet.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getWaitingChildren(start = 0, end = -1) {
+        return this.getJobs(['waiting-children'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "active" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getActive(start = 0, end = -1) {
+        return this.getJobs(['active'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "delayed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getDelayed(start = 0, end = -1) {
+        return this.getJobs(['delayed'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "prioritized" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getPrioritized(start = 0, end = -1) {
+        return this.getJobs(['prioritized'], start, end, true);
+    }
+    /**
+     * Returns the jobs that are in the "completed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getCompleted(start = 0, end = -1) {
+        return this.getJobs(['completed'], start, end, false);
+    }
+    /**
+     * Returns the jobs that are in the "failed" status.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     */
+    getFailed(start = 0, end = -1) {
+        return this.getJobs(['failed'], start, end, false);
+    }
+    /**
+     * Returns the qualified job ids and the raw job data (if available) of the
+     * children jobs of the given parent job.
+     * It is possible to get either the already processed children, in this case
+     * an array of qualified job ids and their result values will be returned,
+     * or the pending children, in this case an array of qualified job ids will
+     * be returned.
+     * A qualified job id is a string representing the job id in a given queue,
+     * for example: "bull:myqueue:jobid".
+     *
+     * @param parentId - The id of the parent job
+     * @param type - "processed" | "pending"
+     * @param opts - Options for the query.
+     *
+     * @returns an object with the following shape:
+     * `{ items: { id: string, v?: any, err?: string } [], jobs: JobJsonRaw[], total: number}`
+     */
+    async getDependencies(parentId, type, start, end) {
+        const key = this.toKey(type == 'processed'
+            ? `${parentId}:processed`
+            : `${parentId}:dependencies`);
+        const { items, total, jobs } = await this.scripts.paginate(key, {
+            start,
+            end,
+            fetchJobs: true,
+        });
+        return {
+            items,
+            jobs,
+            total,
+        };
+    }
+    async getRanges(types, start = 0, end = 1, asc = false) {
+        const multiCommands = [];
+        this.commandByType(types, false, (key, command) => {
+            switch (command) {
+                case 'lrange':
+                    multiCommands.push('lrange');
+                    break;
+                case 'zrange':
+                    multiCommands.push('zrange');
+                    break;
+            }
+        });
+        const responses = await this.scripts.getRanges(types, start, end, asc);
+        let results = [];
+        responses.forEach((response, index) => {
+            const result = response || [];
+            if (asc && multiCommands[index] === 'lrange') {
+                results = results.concat(result.reverse());
+            }
+            else {
+                results = results.concat(result);
+            }
+        });
+        return [...new Set(results)];
+    }
+    /**
+     * Returns the jobs that are on the given statuses (note that JobType is synonym for job status)
+     * @param types - the statuses of the jobs to return.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    async getJobs(types, start = 0, end = -1, asc = false) {
+        const currentTypes = this.sanitizeJobTypes(types);
+        const jobIds = await this.getRanges(currentTypes, start, end, asc);
+        return Promise.all(jobIds.map(jobId => this.Job.fromId(this, jobId)));
+    }
+    /**
+     * Returns the logs for a given Job.
+     * @param jobId - the id of the job to get the logs for.
+     * @param start - zero based index from where to start returning jobs.
+     * @param end - zero based index where to stop returning jobs.
+     * @param asc - if true, the jobs will be returned in ascending order.
+     */
+    async getJobLogs(jobId, start = 0, end = -1, asc = true) {
+        const client = await this.client;
+        const multi = client.multi();
+        const logsKey = this.toKey(jobId + ':logs');
+        if (asc) {
+            multi.lrange(logsKey, start, end);
+        }
+        else {
+            multi.lrange(logsKey, -(end + 1), -(start + 1));
+        }
+        multi.llen(logsKey);
+        const result = (await multi.exec());
+        if (!asc) {
+            result[0][1].reverse();
+        }
+        return {
+            logs: result[0][1],
+            count: result[1][1],
+        };
+    }
+    async baseGetClients(matcher) {
+        const client = await this.client;
+        try {
+            if (client.isCluster && typeof client.nodes === 'function') {
+                const clusterNodes = client.nodes();
+                const clientsPerNode = [];
+                for (let nodeIndex = 0; nodeIndex < clusterNodes.length; nodeIndex++) {
+                    const node = clusterNodes[nodeIndex];
+                    const clients = typeof node.clientList === 'function'
+                        ? await node.clientList()
+                        : await node.client('LIST');
+                    const list = this.parseClientList(clients, matcher);
+                    clientsPerNode.push(list);
+                }
+                const clientsFromNodeWithMostConnections = clientsPerNode.reduce((prev, current) => {
+                    return prev.length > current.length ? prev : current;
+                }, []);
+                return clientsFromNodeWithMostConnections;
+            }
+            else {
+                const clients = await client.clientList();
+                const list = this.parseClientList(clients, matcher);
+                return list;
+            }
+        }
+        catch (err) {
+            if (!clientCommandMessageReg.test(err.message)) {
+                throw err;
+            }
+            return [{ name: 'GCP does not support client list' }];
+        }
+    }
+    /**
+     * Get the worker list related to the queue. i.e. all the known
+     * workers that are available to process jobs for this queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @returns - Returns an array with workers info.
+     */
+    getWorkers() {
+        const unnamedWorkerClientName = `${this.clientName()}`;
+        const namedWorkerClientName = `${this.clientName()}:w:`;
+        const matcher = (name) => name &&
+            (name === unnamedWorkerClientName ||
+                name.startsWith(namedWorkerClientName));
+        return this.baseGetClients(matcher);
+    }
+    /**
+     * Returns the current count of workers for the queue.
+     *
+     * getWorkersCount(): Promise<number>
+     *
+     */
+    async getWorkersCount() {
+        const workers = await this.getWorkers();
+        return workers.length;
+    }
+    /**
+     * Get queue events list related to the queue.
+     * Note: GCP does not support SETNAME, so this call will not work
+     *
+     * @deprecated do not use this method, it will be removed in the future.
+     *
+     * @returns - Returns an array with queue events info.
+     */
+    async getQueueEvents() {
+        const clientName = `${this.clientName()}${QUEUE_EVENT_SUFFIX}`;
+        return this.baseGetClients((name) => name === clientName);
+    }
+    /**
+     * Get queue metrics related to the queue.
+     *
+     * This method returns the gathered metrics for the queue.
+     * The metrics are represented as an array of job counts
+     * per unit of time (1 minute).
+     *
+     * @param start - Start point of the metrics, where 0
+     * is the newest point to be returned.
+     * @param end - End point of the metrics, where -1 is the
+     * oldest point to be returned.
+     *
+     * @returns - Returns an object with queue metrics.
+     */
+    async getMetrics(type, start = 0, end = -1) {
+        const [meta, data, count] = await this.scripts.getMetrics(type, start, end);
+        return {
+            meta: {
+                count: parseInt(meta[0] || '0', 10),
+                prevTS: parseInt(meta[1] || '0', 10),
+                prevCount: parseInt(meta[2] || '0', 10),
+            },
+            data: data.map(point => +point || 0),
+            count,
+        };
+    }
+    parseClientList(list, matcher) {
+        const lines = list.split(/\r?\n/);
+        const clients = [];
+        lines.forEach((line) => {
+            const client = {};
+            const keyValues = line.split(' ');
+            keyValues.forEach(function (keyValue) {
+                const index = keyValue.indexOf('=');
+                const key = keyValue.substring(0, index);
+                const value = keyValue.substring(index + 1);
+                client[key] = value;
+            });
+            const name = client['name'];
+            if (matcher(name)) {
+                client['name'] = this.name;
+                client['rawname'] = name;
+                clients.push(client);
+            }
+        });
+        return clients;
+    }
+    /**
+     * Export the metrics for the queue in the Prometheus format.
+     * Automatically exports all the counts returned by getJobCounts().
+     *
+     * @returns - Returns a string with the metrics in the Prometheus format.
+     *
+     * @see {@link https://prometheus.io/docs/instrumenting/exposition_formats/}
+     *
+     **/
+    async exportPrometheusMetrics(globalVariables) {
+        const counts = await this.getJobCounts();
+        const metrics = [];
+        // Match the test's expected HELP text
+        metrics.push('# HELP bullmq_job_count Number of jobs in the queue by state');
+        metrics.push('# TYPE bullmq_job_count gauge');
+        const escapedQueueName = escapePrometheusLabelValue(this.name);
+        const variables = !globalVariables
+            ? ''
+            : Object.keys(globalVariables).reduce((acc, curr) => `${acc}, ${curr}="${escapePrometheusLabelValue(globalVariables[curr])}"`, '');
+        for (const [state, count] of Object.entries(counts)) {
+            metrics.push(`bullmq_job_count{queue="${escapedQueueName}", state="${state}"${variables}} ${count}`);
+        }
+        const [completedMetrics, failedMetrics] = await Promise.all([
+            this.getMetrics('completed'),
+            this.getMetrics('failed'),
+        ]);
+        metrics.push('# HELP bullmq_job_completed_total Total number of completed jobs');
+        metrics.push('# TYPE bullmq_job_completed_total counter');
+        metrics.push(`bullmq_job_completed_total{queue="${escapedQueueName}"${variables}} ${completedMetrics.meta.count}`);
+        metrics.push('# HELP bullmq_job_failed_total Total number of failed jobs');
+        metrics.push('# TYPE bullmq_job_failed_total counter');
+        metrics.push(`bullmq_job_failed_total{queue="${escapedQueueName}"${variables}} ${failedMetrics.meta.count}`);
+        return metrics.join('\n');
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-keys.d.ts b/node_modules/bullmq/dist/esm/classes/queue-keys.d.ts
new file mode 100644
index 0000000..90297b5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-keys.d.ts
@@ -0,0 +1,10 @@
+export type KeysMap = {
+    [index in string]: string;
+};
+export declare class QueueKeys {
+    readonly prefix: string;
+    constructor(prefix?: string);
+    getKeys(name: string): KeysMap;
+    toKey(name: string, type: string): string;
+    getQueueQualifiedName(name: string): string;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue-keys.js b/node_modules/bullmq/dist/esm/classes/queue-keys.js
new file mode 100644
index 0000000..1e2ed27
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue-keys.js
@@ -0,0 +1,38 @@
+export class QueueKeys {
+    constructor(prefix = 'bull') {
+        this.prefix = prefix;
+    }
+    getKeys(name) {
+        const keys = {};
+        [
+            '',
+            'active',
+            'wait',
+            'waiting-children',
+            'paused',
+            'id',
+            'delayed',
+            'prioritized',
+            'stalled-check',
+            'completed',
+            'failed',
+            'stalled',
+            'repeat',
+            'limiter',
+            'meta',
+            'events',
+            'pc', // priority counter key
+            'marker', // marker key
+            'de', // deduplication key
+        ].forEach(key => {
+            keys[key] = this.toKey(name, key);
+        });
+        return keys;
+    }
+    toKey(name, type) {
+        return `${this.getQueueQualifiedName(name)}:${type}`;
+    }
+    getQueueQualifiedName(name) {
+        return `${this.prefix}:${name}`;
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/queue.d.ts b/node_modules/bullmq/dist/esm/classes/queue.d.ts
new file mode 100644
index 0000000..7c169c3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue.d.ts
@@ -0,0 +1,446 @@
+import { BaseJobOptions, BulkJobOptions, IoredisListener, JobSchedulerJson, QueueOptions, RepeatableJob, RepeatOptions } from '../interfaces';
+import { FinishedStatus, JobsOptions, JobSchedulerTemplateOptions, JobProgress } from '../types';
+import { Job } from './job';
+import { QueueGetters } from './queue-getters';
+import { Repeat } from './repeat';
+import { RedisConnection } from './redis-connection';
+import { JobScheduler } from './job-scheduler';
+export interface ObliterateOpts {
+    /**
+     * Use force = true to force obliteration even with active jobs in the queue
+     * @defaultValue false
+     */
+    force?: boolean;
+    /**
+     * Use count with the maximum number of deleted keys per iteration
+     * @defaultValue 1000
+     */
+    count?: number;
+}
+export interface QueueListener<JobBase extends Job = Job> extends IoredisListener {
+    /**
+     * Listen to 'cleaned' event.
+     *
+     * This event is triggered when the queue calls clean method.
+     */
+    cleaned: (jobs: string[], type: string) => void;
+    /**
+     * Listen to 'error' event.
+     *
+     * This event is triggered when an error is thrown.
+     */
+    error: (err: Error) => void;
+    /**
+     * Listen to 'paused' event.
+     *
+     * This event is triggered when the queue is paused.
+     */
+    paused: () => void;
+    /**
+     * Listen to 'progress' event.
+     *
+     * This event is triggered when the job updates its progress.
+     */
+    progress: (jobId: string, progress: JobProgress) => void;
+    /**
+     * Listen to 'removed' event.
+     *
+     * This event is triggered when a job is removed.
+     */
+    removed: (jobId: string) => void;
+    /**
+     * Listen to 'resumed' event.
+     *
+     * This event is triggered when the queue is resumed.
+     */
+    resumed: () => void;
+    /**
+     * Listen to 'waiting' event.
+     *
+     * This event is triggered when the queue creates a new job.
+     */
+    waiting: (job: JobBase) => void;
+}
+/**
+ * IsAny<T> A type helper to determine if a given type `T` is `any`.
+ * This works by using `any` type with the intersection
+ * operator (`&`). If `T` is `any`, then `1 & T` resolves to `any`, and since `0`
+ * is assignable to `any`, the conditional type returns `true`.
+ */
+type IsAny<T> = 0 extends 1 & T ? true : false;
+type JobBase<T, ResultType, NameType extends string> = IsAny<T> extends true ? Job<T, ResultType, NameType> : T extends Job<any, any, any> ? T : Job<T, ResultType, NameType>;
+type ExtractDataType<DataTypeOrJob, Default> = DataTypeOrJob extends Job<infer D, any, any> ? D : Default;
+type ExtractResultType<DataTypeOrJob, Default> = DataTypeOrJob extends Job<any, infer R, any> ? R : Default;
+type ExtractNameType<DataTypeOrJob, Default extends string> = DataTypeOrJob extends Job<any, any, infer N> ? N : Default;
+/**
+ * Queue
+ *
+ * This class provides methods to add jobs to a queue and some other high-level
+ * administration such as pausing or deleting queues.
+ *
+ * @typeParam DataType - The type of the data that the job will process.
+ * @typeParam ResultType - The type of the result of the job.
+ * @typeParam NameType - The type of the name of the job.
+ *
+ * @example
+ *
+ * ```typescript
+ * import { Queue } from 'bullmq';
+ *
+ * interface MyDataType {
+ *  foo: string;
+ * }
+ *
+ * interface MyResultType {
+ *   bar: string;
+ * }
+ *
+ * const queue = new Queue<MyDataType, MyResultType, "blue" | "brown">('myQueue');
+ * ```
+ */
+export declare class Queue<DataTypeOrJob = any, DefaultResultType = any, DefaultNameType extends string = string, DataType = ExtractDataType<DataTypeOrJob, DataTypeOrJob>, ResultType = ExtractResultType<DataTypeOrJob, DefaultResultType>, NameType extends string = ExtractNameType<DataTypeOrJob, DefaultNameType>> extends QueueGetters<JobBase<DataTypeOrJob, ResultType, NameType>> {
+    token: string;
+    jobsOpts: BaseJobOptions;
+    opts: QueueOptions;
+    protected libName: string;
+    protected _repeat?: Repeat;
+    protected _jobScheduler?: JobScheduler;
+    constructor(name: string, opts?: QueueOptions, Connection?: typeof RedisConnection);
+    emit<U extends keyof QueueListener<JobBase<DataType, ResultType, NameType>>>(event: U, ...args: Parameters<QueueListener<JobBase<DataType, ResultType, NameType>>[U]>): boolean;
+    off<U extends keyof QueueListener<JobBase<DataType, ResultType, NameType>>>(eventName: U, listener: QueueListener<JobBase<DataType, ResultType, NameType>>[U]): this;
+    on<U extends keyof QueueListener<JobBase<DataType, ResultType, NameType>>>(event: U, listener: QueueListener<JobBase<DataType, ResultType, NameType>>[U]): this;
+    once<U extends keyof QueueListener<JobBase<DataType, ResultType, NameType>>>(event: U, listener: QueueListener<JobBase<DataType, ResultType, NameType>>[U]): this;
+    /**
+     * Returns this instance current default job options.
+     */
+    get defaultJobOptions(): JobsOptions;
+    get metaValues(): Record<string, string | number>;
+    /**
+     * Get library version.
+     *
+     * @returns the content of the meta.library field.
+     */
+    getVersion(): Promise<string>;
+    get repeat(): Promise<Repeat>;
+    get jobScheduler(): Promise<JobScheduler>;
+    /**
+     * Enable and set global concurrency value.
+     * @param concurrency - Maximum number of simultaneous jobs that the workers can handle.
+     * For instance, setting this value to 1 ensures that no more than one job
+     * is processed at any given time. If this limit is not defined, there will be no
+     * restriction on the number of concurrent jobs.
+     */
+    setGlobalConcurrency(concurrency: number): Promise<number>;
+    /**
+     * Enable and set rate limit.
+     * @param max - Max number of jobs to process in the time period specified in `duration`
+     * @param duration - Time in milliseconds. During this time, a maximum of `max` jobs will be processed.
+     */
+    setGlobalRateLimit(max: number, duration: number): Promise<number>;
+    /**
+     * Remove global concurrency value.
+     */
+    removeGlobalConcurrency(): Promise<number>;
+    /**
+     * Remove global rate limit values.
+     */
+    removeGlobalRateLimit(): Promise<number>;
+    /**
+     * Adds a new job to the queue.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     */
+    add(name: NameType, data: DataType, opts?: JobsOptions): Promise<Job<DataType, ResultType, NameType>>;
+    /**
+     * addJob is a telemetry free version of the add method, useful in order to wrap it
+     * with custom telemetry on subclasses.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     *
+     * @returns Job
+     */
+    protected addJob(name: NameType, data: DataType, opts?: JobsOptions): Promise<Job<DataType, ResultType, NameType>>;
+    /**
+     * Adds an array of jobs to the queue. This method may be faster than adding
+     * one job at a time in a sequence.
+     *
+     * @param jobs - The array of jobs to add to the queue. Each job is defined by 3
+     * properties, 'name', 'data' and 'opts'. They follow the same signature as 'Queue.add'.
+     */
+    addBulk(jobs: {
+        name: NameType;
+        data: DataType;
+        opts?: BulkJobOptions;
+    }[]): Promise<Job<DataType, ResultType, NameType>[]>;
+    /**
+     * Upserts a scheduler.
+     *
+     * A scheduler is a job factory that creates jobs at a given interval.
+     * Upserting a scheduler will create a new job scheduler or update an existing one.
+     * It will also create the first job based on the repeat options and delayed accordingly.
+     *
+     * @param key - Unique key for the repeatable job meta.
+     * @param repeatOpts - Repeat options
+     * @param jobTemplate - Job template. If provided it will be used for all the jobs
+     * created by the scheduler.
+     *
+     * @returns The next job to be scheduled (would normally be in delayed state).
+     */
+    upsertJobScheduler(jobSchedulerId: NameType, repeatOpts: Omit<RepeatOptions, 'key'>, jobTemplate?: {
+        name?: NameType;
+        data?: DataType;
+        opts?: JobSchedulerTemplateOptions;
+    }): Promise<Job<DataType, ResultType, NameType>>;
+    /**
+     * Pauses the processing of this queue globally.
+     *
+     * We use an atomic RENAME operation on the wait queue. Since
+     * we have blocking calls with BRPOPLPUSH on the wait queue, as long as the queue
+     * is renamed to 'paused', no new jobs will be processed (the current ones
+     * will run until finalized).
+     *
+     * Adding jobs requires a LUA script to check first if the paused list exist
+     * and in that case it will add it there instead of the wait list.
+     */
+    pause(): Promise<void>;
+    /**
+     * Close the queue instance.
+     *
+     */
+    close(): Promise<void>;
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     *
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    rateLimit(expireTimeMs: number): Promise<void>;
+    /**
+     * Resumes the processing of this queue globally.
+     *
+     * The method reverses the pause operation by resuming the processing of the
+     * queue.
+     */
+    resume(): Promise<void>;
+    /**
+     * Returns true if the queue is currently paused.
+     */
+    isPaused(): Promise<boolean>;
+    /**
+     * Returns true if the queue is currently maxed.
+     */
+    isMaxed(): Promise<boolean>;
+    /**
+     * Get all repeatable meta jobs.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getJobSchedulers instead.
+     *
+     * @param start - Offset of first job to return.
+     * @param end - Offset of last job to return.
+     * @param asc - Determine the order in which jobs are returned based on their
+     * next execution time.
+     */
+    getRepeatableJobs(start?: number, end?: number, asc?: boolean): Promise<RepeatableJob[]>;
+    /**
+     * Get Job Scheduler by id
+     *
+     * @param id - identifier of scheduler.
+     */
+    getJobScheduler(id: string): Promise<JobSchedulerJson<DataType> | undefined>;
+    /**
+     * Get all Job Schedulers
+     *
+     * @param start - Offset of first scheduler to return.
+     * @param end - Offset of last scheduler to return.
+     * @param asc - Determine the order in which schedulers are returned based on their
+     * next execution time.
+     */
+    getJobSchedulers(start?: number, end?: number, asc?: boolean): Promise<JobSchedulerJson<DataType>[]>;
+    /**
+     *
+     * Get the number of job schedulers.
+     *
+     * @returns The number of job schedulers.
+     */
+    getJobSchedulersCount(): Promise<number>;
+    /**
+     * Removes a repeatable job.
+     *
+     * Note: you need to use the exact same repeatOpts when deleting a repeatable job
+     * than when adding it.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @see removeRepeatableByKey
+     *
+     * @param name - Job name
+     * @param repeatOpts - Repeat options
+     * @param jobId - Job id to remove. If not provided, all jobs with the same repeatOpts
+     * @returns
+     */
+    removeRepeatable(name: NameType, repeatOpts: RepeatOptions, jobId?: string): Promise<boolean>;
+    /**
+     *
+     * Removes a job scheduler.
+     *
+     * @param jobSchedulerId - identifier of the job scheduler.
+     *
+     * @returns
+     */
+    removeJobScheduler(jobSchedulerId: string): Promise<boolean>;
+    /**
+     * Removes a debounce key.
+     * @deprecated use removeDeduplicationKey
+     *
+     * @param id - debounce identifier
+     */
+    removeDebounceKey(id: string): Promise<number>;
+    /**
+     * Removes a deduplication key.
+     *
+     * @param id - identifier
+     */
+    removeDeduplicationKey(id: string): Promise<number>;
+    /**
+     * Removes rate limit key.
+     */
+    removeRateLimitKey(): Promise<number>;
+    /**
+     * Removes a repeatable job by its key. Note that the key is the one used
+     * to store the repeatable job metadata and not one of the job iterations
+     * themselves. You can use "getRepeatableJobs" in order to get the keys.
+     *
+     * @see getRepeatableJobs
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @param repeatJobKey - To the repeatable job.
+     * @returns
+     */
+    removeRepeatableByKey(key: string): Promise<boolean>;
+    /**
+     * Removes the given job from the queue as well as all its
+     * dependencies.
+     *
+     * @param jobId - The id of the job to remove
+     * @param opts - Options to remove a job
+     * @returns 1 if it managed to remove the job or 0 if the job or
+     * any of its dependencies were locked.
+     */
+    remove(jobId: string, { removeChildren }?: {
+        removeChildren?: boolean;
+    }): Promise<number>;
+    /**
+     * Updates the given job's progress.
+     *
+     * @param jobId - The id of the job to update
+     * @param progress - Number or object to be saved as progress.
+     */
+    updateJobProgress(jobId: string, progress: JobProgress): Promise<void>;
+    /**
+     * Logs one row of job's log data.
+     *
+     * @param jobId - The job id to log against.
+     * @param logRow - String with log data to be logged.
+     * @param keepLogs - Max number of log entries to keep (0 for unlimited).
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    addJobLog(jobId: string, logRow: string, keepLogs?: number): Promise<number>;
+    /**
+     * Drains the queue, i.e., removes all jobs that are waiting
+     * or delayed, but not active, completed or failed.
+     *
+     * @param delayed - Pass true if it should also clean the
+     * delayed jobs.
+     */
+    drain(delayed?: boolean): Promise<void>;
+    /**
+     * Cleans jobs from a queue. Similar to drain but keeps jobs within a certain
+     * grace period.
+     *
+     * @param grace - The grace period in milliseconds
+     * @param limit - Max number of jobs to clean
+     * @param type - The type of job to clean
+     * Possible values are completed, wait, active, paused, delayed, failed. Defaults to completed.
+     * @returns Id jobs from the deleted records
+     */
+    clean(grace: number, limit: number, type?: 'completed' | 'wait' | 'waiting' | 'active' | 'paused' | 'prioritized' | 'delayed' | 'failed'): Promise<string[]>;
+    /**
+     * Completely destroys the queue and all of its contents irreversibly.
+     * This method will *pause* the queue and requires that there are no
+     * active jobs. It is possible to bypass this requirement, i.e. not
+     * having active jobs using the "force" option.
+     *
+     * Note: This operation requires to iterate on all the jobs stored in the queue
+     * and can be slow for very large queues.
+     *
+     * @param opts - Obliterate options.
+     */
+    obliterate(opts?: ObliterateOpts): Promise<void>;
+    /**
+     * Retry all the failed or completed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration,
+     *   - state  failed by default or completed.
+     *   - timestamp from which timestamp to start moving jobs to wait status, default Date.now().
+     *
+     * @returns
+     */
+    retryJobs(opts?: {
+        count?: number;
+        state?: FinishedStatus;
+        timestamp?: number;
+    }): Promise<void>;
+    /**
+     * Promote all the delayed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration
+     *
+     * @returns
+     */
+    promoteJobs(opts?: {
+        count?: number;
+    }): Promise<void>;
+    /**
+     * Trim the event stream to an approximately maxLength.
+     *
+     * @param maxLength - The approximate maximum length, or target length, of the event stream.
+     */
+    trimEvents(maxLength: number): Promise<number>;
+    /**
+     * Delete old priority helper key.
+     */
+    removeDeprecatedPriorityKey(): Promise<number>;
+    /**
+     * Removes orphaned job keys that exist in Redis but are not referenced
+     * in any queue state set.
+     *
+     * Orphaned keys can occur in rare cases when the removal-by-max-age logic
+     * removes sorted-set entries without fully cleaning up the corresponding
+     * job hash data (a regression introduced in v5.66.6 via #3694).
+     * Under normal operation this method is
+     * **not needed** — it is provided only as a one-time migration helper for
+     * users who were affected by that specific bug and want to reclaim the
+     * leaked memory.
+     *
+     * The method uses a Lua script so that every check-and-delete cycle is
+     * atomic (per SCAN iteration). State keys are derived dynamically from
+     * the queue's key map and their Redis TYPE is checked at runtime, so newly
+     * introduced states are picked up automatically.
+     *
+     * @param count - Approximate number of keys to SCAN per iteration (default 1000).
+     * @param limit - Maximum number of orphaned jobs to remove (0 = unlimited).
+     *   When set, the method returns as soon as the limit is reached.
+     *   Users with a very large number of orphans can call this method
+     *   in a loop: `while (await queue.removeOrphanedJobs(1000, 10000)) {}`
+     * @returns The total number of orphaned jobs that were removed.
+     */
+    removeOrphanedJobs(count?: number, limit?: number): Promise<number>;
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/queue.js b/node_modules/bullmq/dist/esm/classes/queue.js
new file mode 100644
index 0000000..417ef79
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/queue.js
@@ -0,0 +1,744 @@
+import { Job } from './job';
+import { QueueGetters } from './queue-getters';
+import { Repeat } from './repeat';
+import { SpanKind, TelemetryAttributes } from '../enums';
+import { JobScheduler } from './job-scheduler';
+import { version } from '../version';
+import { randomUUID } from '../utils';
+/**
+ * Queue
+ *
+ * This class provides methods to add jobs to a queue and some other high-level
+ * administration such as pausing or deleting queues.
+ *
+ * @typeParam DataType - The type of the data that the job will process.
+ * @typeParam ResultType - The type of the result of the job.
+ * @typeParam NameType - The type of the name of the job.
+ *
+ * @example
+ *
+ * ```typescript
+ * import { Queue } from 'bullmq';
+ *
+ * interface MyDataType {
+ *  foo: string;
+ * }
+ *
+ * interface MyResultType {
+ *   bar: string;
+ * }
+ *
+ * const queue = new Queue<MyDataType, MyResultType, "blue" | "brown">('myQueue');
+ * ```
+ */
+export class Queue extends QueueGetters {
+    constructor(name, opts, Connection) {
+        var _a;
+        super(name, Object.assign({}, opts), Connection);
+        this.token = randomUUID();
+        this.libName = 'bullmq';
+        this.jobsOpts = (_a = opts === null || opts === void 0 ? void 0 : opts.defaultJobOptions) !== null && _a !== void 0 ? _a : {};
+        this.waitUntilReady()
+            .then(client => {
+            if (!this.closing && !(opts === null || opts === void 0 ? void 0 : opts.skipMetasUpdate)) {
+                return client.hset(this.keys.meta, this.metaValues);
+            }
+        })
+            .catch(err => {
+            // We ignore this error to avoid warnings. The error can still
+            // be received by listening to event 'error'
+        });
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    /**
+     * Returns this instance current default job options.
+     */
+    get defaultJobOptions() {
+        return Object.assign({}, this.jobsOpts);
+    }
+    get metaValues() {
+        var _a, _b, _c, _d;
+        return {
+            'opts.maxLenEvents': (_d = (_c = (_b = (_a = this.opts) === null || _a === void 0 ? void 0 : _a.streams) === null || _b === void 0 ? void 0 : _b.events) === null || _c === void 0 ? void 0 : _c.maxLen) !== null && _d !== void 0 ? _d : 10000,
+            version: `${this.libName}:${version}`,
+        };
+    }
+    /**
+     * Get library version.
+     *
+     * @returns the content of the meta.library field.
+     */
+    async getVersion() {
+        const client = await this.client;
+        return await client.hget(this.keys.meta, 'version');
+    }
+    get repeat() {
+        return new Promise(async (resolve) => {
+            if (!this._repeat) {
+                this._repeat = new Repeat(this.name, Object.assign(Object.assign({}, this.opts), { connection: await this.client }));
+                this._repeat.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._repeat);
+        });
+    }
+    get jobScheduler() {
+        return new Promise(async (resolve) => {
+            if (!this._jobScheduler) {
+                this._jobScheduler = new JobScheduler(this.name, Object.assign(Object.assign({}, this.opts), { connection: await this.client }));
+                this._jobScheduler.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._jobScheduler);
+        });
+    }
+    /**
+     * Enable and set global concurrency value.
+     * @param concurrency - Maximum number of simultaneous jobs that the workers can handle.
+     * For instance, setting this value to 1 ensures that no more than one job
+     * is processed at any given time. If this limit is not defined, there will be no
+     * restriction on the number of concurrent jobs.
+     */
+    async setGlobalConcurrency(concurrency) {
+        const client = await this.client;
+        return client.hset(this.keys.meta, { concurrency });
+    }
+    /**
+     * Enable and set rate limit.
+     * @param max - Max number of jobs to process in the time period specified in `duration`
+     * @param duration - Time in milliseconds. During this time, a maximum of `max` jobs will be processed.
+     */
+    async setGlobalRateLimit(max, duration) {
+        const client = await this.client;
+        return client.hset(this.keys.meta, { max, duration });
+    }
+    /**
+     * Remove global concurrency value.
+     */
+    async removeGlobalConcurrency() {
+        const client = await this.client;
+        return client.hdel(this.keys.meta, 'concurrency');
+    }
+    /**
+     * Remove global rate limit values.
+     */
+    async removeGlobalRateLimit() {
+        const client = await this.client;
+        return client.hdel(this.keys.meta, 'max', 'duration');
+    }
+    /**
+     * Adds a new job to the queue.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     */
+    async add(name, data, opts) {
+        return this.trace(SpanKind.PRODUCER, 'add', `${this.name}.${name}`, async (span, srcPropagationMetadata) => {
+            var _a;
+            if (srcPropagationMetadata && !((_a = opts === null || opts === void 0 ? void 0 : opts.telemetry) === null || _a === void 0 ? void 0 : _a.omitContext)) {
+                const telemetry = {
+                    metadata: srcPropagationMetadata,
+                };
+                opts = Object.assign(Object.assign({}, opts), { telemetry });
+            }
+            const job = await this.addJob(name, data, opts);
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobName]: name,
+                [TelemetryAttributes.JobId]: job.id,
+            });
+            return job;
+        });
+    }
+    /**
+     * addJob is a telemetry free version of the add method, useful in order to wrap it
+     * with custom telemetry on subclasses.
+     *
+     * @param name - Name of the job to be added to the queue.
+     * @param data - Arbitrary data to append to the job.
+     * @param opts - Job options that affects how the job is going to be processed.
+     *
+     * @returns Job
+     */
+    async addJob(name, data, opts) {
+        if (opts && opts.repeat) {
+            if (opts.repeat.endDate) {
+                if (+new Date(opts.repeat.endDate) < Date.now()) {
+                    throw new Error('End date must be greater than current timestamp');
+                }
+            }
+            return (await this.repeat).updateRepeatableJob(name, data, Object.assign(Object.assign({}, this.jobsOpts), opts), { override: true });
+        }
+        else {
+            const jobId = opts === null || opts === void 0 ? void 0 : opts.jobId;
+            if (jobId == '0' || (jobId === null || jobId === void 0 ? void 0 : jobId.startsWith('0:'))) {
+                throw new Error("JobId cannot be '0' or start with 0:");
+            }
+            const mergedOpts = Object.assign(Object.assign(Object.assign({}, this.jobsOpts), opts), { jobId });
+            const job = await this.Job.create(this, name, data, mergedOpts);
+            this.emit('waiting', job);
+            return job;
+        }
+    }
+    /**
+     * Adds an array of jobs to the queue. This method may be faster than adding
+     * one job at a time in a sequence.
+     *
+     * @param jobs - The array of jobs to add to the queue. Each job is defined by 3
+     * properties, 'name', 'data' and 'opts'. They follow the same signature as 'Queue.add'.
+     */
+    async addBulk(jobs) {
+        return this.trace(SpanKind.PRODUCER, 'addBulk', this.name, async (span, srcPropagationMetadata) => {
+            if (span) {
+                span.setAttributes({
+                    [TelemetryAttributes.BulkNames]: jobs.map(job => job.name),
+                    [TelemetryAttributes.BulkCount]: jobs.length,
+                });
+            }
+            return await this.Job.createBulk(this, jobs.map(job => {
+                var _a, _b, _c, _d, _e, _f;
+                let telemetry = (_a = job.opts) === null || _a === void 0 ? void 0 : _a.telemetry;
+                if (srcPropagationMetadata) {
+                    const omitContext = (_c = (_b = job.opts) === null || _b === void 0 ? void 0 : _b.telemetry) === null || _c === void 0 ? void 0 : _c.omitContext;
+                    const telemetryMetadata = ((_e = (_d = job.opts) === null || _d === void 0 ? void 0 : _d.telemetry) === null || _e === void 0 ? void 0 : _e.metadata) ||
+                        (!omitContext && srcPropagationMetadata);
+                    if (telemetryMetadata || omitContext) {
+                        telemetry = {
+                            metadata: telemetryMetadata,
+                            omitContext,
+                        };
+                    }
+                }
+                const mergedOpts = Object.assign(Object.assign(Object.assign({}, this.jobsOpts), job.opts), { jobId: (_f = job.opts) === null || _f === void 0 ? void 0 : _f.jobId, telemetry });
+                return {
+                    name: job.name,
+                    data: job.data,
+                    opts: mergedOpts,
+                };
+            }));
+        });
+    }
+    /**
+     * Upserts a scheduler.
+     *
+     * A scheduler is a job factory that creates jobs at a given interval.
+     * Upserting a scheduler will create a new job scheduler or update an existing one.
+     * It will also create the first job based on the repeat options and delayed accordingly.
+     *
+     * @param key - Unique key for the repeatable job meta.
+     * @param repeatOpts - Repeat options
+     * @param jobTemplate - Job template. If provided it will be used for all the jobs
+     * created by the scheduler.
+     *
+     * @returns The next job to be scheduled (would normally be in delayed state).
+     */
+    async upsertJobScheduler(jobSchedulerId, repeatOpts, jobTemplate) {
+        var _a, _b;
+        if (repeatOpts.endDate) {
+            if (+new Date(repeatOpts.endDate) < Date.now()) {
+                throw new Error('End date must be greater than current timestamp');
+            }
+        }
+        return (await this.jobScheduler).upsertJobScheduler(jobSchedulerId, repeatOpts, (_a = jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.name) !== null && _a !== void 0 ? _a : jobSchedulerId, (_b = jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.data) !== null && _b !== void 0 ? _b : {}, Object.assign(Object.assign({}, this.jobsOpts), jobTemplate === null || jobTemplate === void 0 ? void 0 : jobTemplate.opts), { override: true });
+    }
+    /**
+     * Pauses the processing of this queue globally.
+     *
+     * We use an atomic RENAME operation on the wait queue. Since
+     * we have blocking calls with BRPOPLPUSH on the wait queue, as long as the queue
+     * is renamed to 'paused', no new jobs will be processed (the current ones
+     * will run until finalized).
+     *
+     * Adding jobs requires a LUA script to check first if the paused list exist
+     * and in that case it will add it there instead of the wait list.
+     */
+    async pause() {
+        await this.trace(SpanKind.INTERNAL, 'pause', this.name, async () => {
+            await this.scripts.pause(true);
+            this.emit('paused');
+        });
+    }
+    /**
+     * Close the queue instance.
+     *
+     */
+    async close() {
+        await this.trace(SpanKind.INTERNAL, 'close', this.name, async () => {
+            if (!this.closing) {
+                if (this._repeat) {
+                    await this._repeat.close();
+                }
+            }
+            await super.close();
+        });
+    }
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     *
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    async rateLimit(expireTimeMs) {
+        await this.trace(SpanKind.INTERNAL, 'rateLimit', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueRateLimit]: expireTimeMs,
+            });
+            await this.client.then(client => client.set(this.keys.limiter, Number.MAX_SAFE_INTEGER, {
+                PX: expireTimeMs,
+            }));
+        });
+    }
+    /**
+     * Resumes the processing of this queue globally.
+     *
+     * The method reverses the pause operation by resuming the processing of the
+     * queue.
+     */
+    async resume() {
+        await this.trace(SpanKind.INTERNAL, 'resume', this.name, async () => {
+            await this.scripts.pause(false);
+            this.emit('resumed');
+        });
+    }
+    /**
+     * Returns true if the queue is currently paused.
+     */
+    async isPaused() {
+        const client = await this.client;
+        const pausedKeyExists = await client.hexists(this.keys.meta, 'paused');
+        return pausedKeyExists === 1;
+    }
+    /**
+     * Returns true if the queue is currently maxed.
+     */
+    isMaxed() {
+        return this.scripts.isMaxed();
+    }
+    /**
+     * Get all repeatable meta jobs.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use getJobSchedulers instead.
+     *
+     * @param start - Offset of first job to return.
+     * @param end - Offset of last job to return.
+     * @param asc - Determine the order in which jobs are returned based on their
+     * next execution time.
+     */
+    async getRepeatableJobs(start, end, asc) {
+        return (await this.repeat).getRepeatableJobs(start, end, asc);
+    }
+    /**
+     * Get Job Scheduler by id
+     *
+     * @param id - identifier of scheduler.
+     */
+    async getJobScheduler(id) {
+        return (await this.jobScheduler).getScheduler(id);
+    }
+    /**
+     * Get all Job Schedulers
+     *
+     * @param start - Offset of first scheduler to return.
+     * @param end - Offset of last scheduler to return.
+     * @param asc - Determine the order in which schedulers are returned based on their
+     * next execution time.
+     */
+    async getJobSchedulers(start, end, asc) {
+        return (await this.jobScheduler).getJobSchedulers(start, end, asc);
+    }
+    /**
+     *
+     * Get the number of job schedulers.
+     *
+     * @returns The number of job schedulers.
+     */
+    async getJobSchedulersCount() {
+        return (await this.jobScheduler).getSchedulersCount();
+    }
+    /**
+     * Removes a repeatable job.
+     *
+     * Note: you need to use the exact same repeatOpts when deleting a repeatable job
+     * than when adding it.
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @see removeRepeatableByKey
+     *
+     * @param name - Job name
+     * @param repeatOpts - Repeat options
+     * @param jobId - Job id to remove. If not provided, all jobs with the same repeatOpts
+     * @returns
+     */
+    async removeRepeatable(name, repeatOpts, jobId) {
+        return this.trace(SpanKind.INTERNAL, 'removeRepeatable', `${this.name}.${name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobName]: name,
+                [TelemetryAttributes.JobId]: jobId,
+            });
+            const repeat = await this.repeat;
+            const removed = await repeat.removeRepeatable(name, repeatOpts, jobId);
+            return !removed;
+        });
+    }
+    /**
+     *
+     * Removes a job scheduler.
+     *
+     * @param jobSchedulerId - identifier of the job scheduler.
+     *
+     * @returns
+     */
+    async removeJobScheduler(jobSchedulerId) {
+        const jobScheduler = await this.jobScheduler;
+        const removed = await jobScheduler.removeJobScheduler(jobSchedulerId);
+        return !removed;
+    }
+    /**
+     * Removes a debounce key.
+     * @deprecated use removeDeduplicationKey
+     *
+     * @param id - debounce identifier
+     */
+    async removeDebounceKey(id) {
+        return this.trace(SpanKind.INTERNAL, 'removeDebounceKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobKey]: id,
+            });
+            const client = await this.client;
+            return await client.del(`${this.keys.de}:${id}`);
+        });
+    }
+    /**
+     * Removes a deduplication key.
+     *
+     * @param id - identifier
+     */
+    async removeDeduplicationKey(id) {
+        return this.trace(SpanKind.INTERNAL, 'removeDeduplicationKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.DeduplicationKey]: id,
+            });
+            const client = await this.client;
+            return client.del(`${this.keys.de}:${id}`);
+        });
+    }
+    /**
+     * Removes rate limit key.
+     */
+    async removeRateLimitKey() {
+        const client = await this.client;
+        return client.del(this.keys.limiter);
+    }
+    /**
+     * Removes a repeatable job by its key. Note that the key is the one used
+     * to store the repeatable job metadata and not one of the job iterations
+     * themselves. You can use "getRepeatableJobs" in order to get the keys.
+     *
+     * @see getRepeatableJobs
+     *
+     * @deprecated This method is deprecated and will be removed in v6. Use removeJobScheduler instead.
+     *
+     * @param repeatJobKey - To the repeatable job.
+     * @returns
+     */
+    async removeRepeatableByKey(key) {
+        return this.trace(SpanKind.INTERNAL, 'removeRepeatableByKey', `${this.name}`, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobKey]: key,
+            });
+            const repeat = await this.repeat;
+            const removed = await repeat.removeRepeatableByKey(key);
+            return !removed;
+        });
+    }
+    /**
+     * Removes the given job from the queue as well as all its
+     * dependencies.
+     *
+     * @param jobId - The id of the job to remove
+     * @param opts - Options to remove a job
+     * @returns 1 if it managed to remove the job or 0 if the job or
+     * any of its dependencies were locked.
+     */
+    async remove(jobId, { removeChildren = true } = {}) {
+        return this.trace(SpanKind.INTERNAL, 'remove', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobId]: jobId,
+                [TelemetryAttributes.JobOptions]: JSON.stringify({
+                    removeChildren,
+                }),
+            });
+            const code = await this.scripts.remove(jobId, removeChildren);
+            if (code === 1) {
+                this.emit('removed', jobId);
+            }
+            return code;
+        });
+    }
+    /**
+     * Updates the given job's progress.
+     *
+     * @param jobId - The id of the job to update
+     * @param progress - Number or object to be saved as progress.
+     */
+    async updateJobProgress(jobId, progress) {
+        await this.trace(SpanKind.INTERNAL, 'updateJobProgress', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobId]: jobId,
+                [TelemetryAttributes.JobProgress]: JSON.stringify(progress),
+            });
+            await this.scripts.updateProgress(jobId, progress);
+            this.emit('progress', jobId, progress);
+        });
+    }
+    /**
+     * Logs one row of job's log data.
+     *
+     * @param jobId - The job id to log against.
+     * @param logRow - String with log data to be logged.
+     * @param keepLogs - Max number of log entries to keep (0 for unlimited).
+     *
+     * @returns The total number of log entries for this job so far.
+     */
+    async addJobLog(jobId, logRow, keepLogs) {
+        return Job.addJobLog(this, jobId, logRow, keepLogs);
+    }
+    /**
+     * Drains the queue, i.e., removes all jobs that are waiting
+     * or delayed, but not active, completed or failed.
+     *
+     * @param delayed - Pass true if it should also clean the
+     * delayed jobs.
+     */
+    async drain(delayed = false) {
+        await this.trace(SpanKind.INTERNAL, 'drain', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueDrainDelay]: delayed,
+            });
+            await this.scripts.drain(delayed);
+        });
+    }
+    /**
+     * Cleans jobs from a queue. Similar to drain but keeps jobs within a certain
+     * grace period.
+     *
+     * @param grace - The grace period in milliseconds
+     * @param limit - Max number of jobs to clean
+     * @param type - The type of job to clean
+     * Possible values are completed, wait, active, paused, delayed, failed. Defaults to completed.
+     * @returns Id jobs from the deleted records
+     */
+    async clean(grace, limit, type = 'completed') {
+        return this.trace(SpanKind.INTERNAL, 'clean', this.name, async (span) => {
+            const maxCount = limit || Infinity;
+            const maxCountPerCall = Math.min(10000, maxCount);
+            const timestamp = Date.now() - grace;
+            let deletedCount = 0;
+            const deletedJobsIds = [];
+            // Normalize 'waiting' to 'wait' for consistency with internal Redis keys
+            const normalizedType = type === 'waiting' ? 'wait' : type;
+            while (deletedCount < maxCount) {
+                const jobsIds = await this.scripts.cleanJobsInSet(normalizedType, timestamp, maxCountPerCall);
+                this.emit('cleaned', jobsIds, normalizedType);
+                deletedCount += jobsIds.length;
+                deletedJobsIds.push(...jobsIds);
+                if (jobsIds.length < maxCountPerCall) {
+                    break;
+                }
+            }
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueGrace]: grace,
+                [TelemetryAttributes.JobType]: type,
+                [TelemetryAttributes.QueueCleanLimit]: maxCount,
+                [TelemetryAttributes.JobIds]: deletedJobsIds,
+            });
+            return deletedJobsIds;
+        });
+    }
+    /**
+     * Completely destroys the queue and all of its contents irreversibly.
+     * This method will *pause* the queue and requires that there are no
+     * active jobs. It is possible to bypass this requirement, i.e. not
+     * having active jobs using the "force" option.
+     *
+     * Note: This operation requires to iterate on all the jobs stored in the queue
+     * and can be slow for very large queues.
+     *
+     * @param opts - Obliterate options.
+     */
+    async obliterate(opts) {
+        await this.trace(SpanKind.INTERNAL, 'obliterate', this.name, async () => {
+            await this.pause();
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.obliterate(Object.assign({ force: false, count: 1000 }, opts));
+            } while (cursor);
+        });
+    }
+    /**
+     * Retry all the failed or completed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration,
+     *   - state  failed by default or completed.
+     *   - timestamp from which timestamp to start moving jobs to wait status, default Date.now().
+     *
+     * @returns
+     */
+    async retryJobs(opts = {}) {
+        await this.trace(SpanKind.PRODUCER, 'retryJobs', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueOptions]: JSON.stringify(opts),
+            });
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.retryJobs(opts.state, opts.count, opts.timestamp);
+            } while (cursor);
+        });
+    }
+    /**
+     * Promote all the delayed jobs.
+     *
+     * @param opts - An object with the following properties:
+     *   - count  number to limit how many jobs will be moved to wait status per iteration
+     *
+     * @returns
+     */
+    async promoteJobs(opts = {}) {
+        await this.trace(SpanKind.INTERNAL, 'promoteJobs', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueOptions]: JSON.stringify(opts),
+            });
+            let cursor = 0;
+            do {
+                cursor = await this.scripts.promoteJobs(opts.count);
+            } while (cursor);
+        });
+    }
+    /**
+     * Trim the event stream to an approximately maxLength.
+     *
+     * @param maxLength - The approximate maximum length, or target length, of the event stream.
+     */
+    async trimEvents(maxLength) {
+        return this.trace(SpanKind.INTERNAL, 'trimEvents', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.QueueEventMaxLength]: maxLength,
+            });
+            const client = await this.client;
+            return await client.xtrim(this.keys.events, 'MAXLEN', maxLength, {
+                approximate: true,
+            });
+        });
+    }
+    /**
+     * Delete old priority helper key.
+     */
+    async removeDeprecatedPriorityKey() {
+        const client = await this.client;
+        return client.del(this.toKey('priority'));
+    }
+    /**
+     * Removes orphaned job keys that exist in Redis but are not referenced
+     * in any queue state set.
+     *
+     * Orphaned keys can occur in rare cases when the removal-by-max-age logic
+     * removes sorted-set entries without fully cleaning up the corresponding
+     * job hash data (a regression introduced in v5.66.6 via #3694).
+     * Under normal operation this method is
+     * **not needed** — it is provided only as a one-time migration helper for
+     * users who were affected by that specific bug and want to reclaim the
+     * leaked memory.
+     *
+     * The method uses a Lua script so that every check-and-delete cycle is
+     * atomic (per SCAN iteration). State keys are derived dynamically from
+     * the queue's key map and their Redis TYPE is checked at runtime, so newly
+     * introduced states are picked up automatically.
+     *
+     * @param count - Approximate number of keys to SCAN per iteration (default 1000).
+     * @param limit - Maximum number of orphaned jobs to remove (0 = unlimited).
+     *   When set, the method returns as soon as the limit is reached.
+     *   Users with a very large number of orphans can call this method
+     *   in a loop: `while (await queue.removeOrphanedJobs(1000, 10000)) {}`
+     * @returns The total number of orphaned jobs that were removed.
+     */
+    async removeOrphanedJobs(count = 1000, limit = 0) {
+        const client = await this.client;
+        // Derive infrastructure suffixes dynamically from the queue key map
+        // so any future keys are automatically excluded without code changes.
+        const knownSuffixes = new Set(Object.keys(this.keys));
+        // State key suffixes (excluding '') — passed to the Lua script which
+        // uses TYPE to decide whether a key is a list / zset / set and picks
+        // the right membership command automatically.
+        const stateKeySuffixes = Object.keys(this.keys).filter(s => s !== '');
+        // Known job sub-key suffixes (cleaned up during deletion).
+        const jobSubKeySuffixes = [
+            'logs',
+            'dependencies',
+            'processed',
+            'failed',
+            'unsuccessful',
+            'lock',
+        ];
+        const basePrefix = this.qualifiedName + ':';
+        const scanPattern = basePrefix + '*';
+        let totalRemoved = 0;
+        let cursor = '0';
+        do {
+            const [nextCursor, keys] = await client.scan(cursor, {
+                MATCH: scanPattern,
+                COUNT: count,
+            });
+            cursor = nextCursor;
+            // Extract unique potential job IDs from this batch.
+            const candidateJobIds = new Set();
+            for (const key of keys) {
+                const suffix = key.slice(basePrefix.length);
+                // Skip infrastructure keys (derived from this.keys).
+                if (knownSuffixes.has(suffix)) {
+                    continue;
+                }
+                // Skip sub-keys of infrastructure prefixes (e.g. repeat:xxx, de:xxx).
+                const colonIdx = suffix.indexOf(':');
+                if (colonIdx !== -1) {
+                    const prefixPart = suffix.slice(0, colonIdx);
+                    if (knownSuffixes.has(prefixPart)) {
+                        continue;
+                    }
+                }
+                // Extract the job ID portion (before first colon, or the whole suffix).
+                const jobId = colonIdx === -1 ? suffix : suffix.slice(0, colonIdx);
+                // For sub-keys, only consider known job sub-key suffixes.
+                if (colonIdx !== -1) {
+                    const subKey = suffix.slice(colonIdx + 1);
+                    if (!jobSubKeySuffixes.includes(subKey)) {
+                        continue;
+                    }
+                }
+                candidateJobIds.add(jobId);
+            }
+            if (candidateJobIds.size === 0) {
+                continue;
+            }
+            // Run the Lua script atomically for this batch of candidates.
+            const result = await this.scripts.removeOrphanedJobs([...candidateJobIds], stateKeySuffixes, jobSubKeySuffixes);
+            totalRemoved += result || 0;
+            if (limit > 0 && totalRemoved >= limit) {
+                break;
+            }
+        } while (cursor !== '0');
+        return totalRemoved;
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/classes/redis-connection.d.ts b/node_modules/bullmq/dist/esm/classes/redis-connection.d.ts
new file mode 100644
index 0000000..ec9219a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/redis-connection.d.ts
@@ -0,0 +1,88 @@
+import { EventEmitter } from 'events';
+import { ConnectionOptions, RedisOptions, RedisClient } from '../interfaces';
+import { IRedisClient } from '../interfaces/redis-client';
+import { DatabaseType } from '../types';
+interface RedisCapabilities {
+    canDoubleTimeout: boolean;
+    canBlockFor1Ms: boolean;
+}
+export interface RawCommand {
+    content: string;
+    name: string;
+    keys: number;
+}
+export declare class RedisConnection extends EventEmitter {
+    private readonly extraOptions?;
+    static minimumVersion: string;
+    static recommendedMinimumVersion: string;
+    /**
+     * Optional factory that creates an {@link IRedisClient} from raw options.
+     *
+     * When set, {@link RedisConnection} will call this factory instead of
+     * creating an ioredis client internally.  This allows swapping the Redis
+     * driver (e.g. node-redis, Bun built-in) without changing consumer code.
+     *
+     * The factory receives the merged {@link RedisOptions} and must return
+     * an **already-augmented** {@link IRedisClient} (e.g. via
+     * `createNodeRedisClient`).
+     *
+     * @example
+     * ```ts
+     * import { createClient } from 'redis';
+     * import { RedisConnection, createNodeRedisClient } from 'bullmq';
+     *
+     * RedisConnection.clientFactory = (opts) => {
+     *   const raw = createClient({ url: `redis://${opts.host ?? '127.0.0.1'}:${opts.port ?? 6379}` });
+     *   return createNodeRedisClient(raw);
+     * };
+     * ```
+     */
+    static clientFactory?: (opts: RedisOptions) => IRedisClient;
+    closing: boolean;
+    capabilities: RedisCapabilities;
+    status: 'initializing' | 'ready' | 'closing' | 'closed';
+    private dbType;
+    protected _client: RedisClient;
+    private readonly opts;
+    private readonly initializing;
+    private version;
+    protected packageVersion: string;
+    private skipVersionCheck;
+    private handleClientError;
+    private handleClientClose;
+    private handleClientReady;
+    private patchedBlockingClusterClient?;
+    private disabledBlockingClusterReconnect;
+    constructor(opts: ConnectionOptions, extraOptions?: {
+        shared?: boolean;
+        blocking?: boolean;
+        skipVersionCheck?: boolean;
+        skipWaitingForReady?: boolean;
+        clusterReconnectTimeoutMs?: number;
+    });
+    private checkBlockingOptions;
+    /**
+     * Waits for a redis client to be ready.
+     * @param redis - client
+     */
+    static waitUntilReady(client: RedisClient): Promise<void>;
+    get client(): Promise<RedisClient>;
+    protected loadCommands(packageVersion: string, providedScripts?: Record<string, RawCommand>): void;
+    private init;
+    private patchBlockingClusterClient;
+    private disableBlockingClusterReconnect;
+    private releaseBlockingClusterClientPatch;
+    private static isClusterWithEmptyNodes;
+    private static isReconnectingDisabled;
+    private static reconnectClusterIfNeeded;
+    private static shouldReconnectClusterAfterError;
+    private static reconnectCluster;
+    private static connectClusterWithTimeout;
+    disconnect(wait?: boolean): Promise<void>;
+    reconnect(): Promise<void>;
+    close(force?: boolean): Promise<void>;
+    private getRedisVersionAndType;
+    get redisVersion(): string;
+    get databaseType(): DatabaseType;
+}
+export {};
diff --git a/node_modules/bullmq/dist/esm/classes/redis-connection.js b/node_modules/bullmq/dist/esm/classes/redis-connection.js
new file mode 100644
index 0000000..41968a4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/redis-connection.js
@@ -0,0 +1,513 @@
+import { __rest } from "tslib";
+import { EventEmitter } from 'events';
+import { default as IORedis } from 'ioredis';
+// eslint-disable-next-line @typescript-eslint/ban-ts-comment
+// @ts-ignore
+import { CONNECTION_CLOSED_ERROR_MSG } from 'ioredis/built/utils';
+import { decreaseMaxListeners, increaseMaxListeners, isNotConnectionError, isRedisCluster, isRedisInstance, isRedisVersionLowerThan, } from '../utils';
+import { version as packageVersion } from '../version';
+import * as scripts from '../scripts';
+import { createIORedisClient, isIRedisClient } from './ioredis-client';
+import { ConnectionClosedError } from './errors/connection-closed-error';
+const overrideMessage = [
+    'BullMQ: WARNING! Your redis options maxRetriesPerRequest must be null',
+    'and will be overridden by BullMQ.',
+].join(' ');
+const deprecationMessage = 'BullMQ: Your redis options maxRetriesPerRequest must be null.';
+const clusterReconnectPromise = Symbol('bullmqClusterReconnectPromise');
+const clusterPatchedForBlocking = Symbol('bullmqClusterPatchedForBlocking');
+const clusterOriginalBzpopmin = Symbol('bullmqClusterOriginalBzpopmin');
+const clusterWrappedBzpopmin = Symbol('bullmqClusterWrappedBzpopmin');
+const clusterPatchRefCount = Symbol('bullmqClusterPatchRefCount');
+const clusterClosingRefCount = Symbol('bullmqClusterClosingRefCount');
+// Hard cap on a single cluster reconnect attempt. Without this, a hung
+// `client.connect()` (e.g. ioredis Cluster cannot recover and slot refresh
+// keeps retrying internally) leaves `clusterReconnectPromise` pinned forever
+// and every subsequent bzpopmin call awaits the same dead promise, deadlocking
+// the worker. 30s is comfortably above the default ioredis slotsRefreshTimeout
+// while bounded enough that wedged workers recover within one or two ticks.
+const DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS = 30000;
+export class RedisConnection extends EventEmitter {
+    constructor(opts, extraOptions) {
+        super();
+        this.extraOptions = extraOptions;
+        this.capabilities = {
+            canDoubleTimeout: false,
+            canBlockFor1Ms: true,
+        };
+        this.status = 'initializing';
+        this.dbType = 'redis';
+        this.packageVersion = packageVersion;
+        this.disabledBlockingClusterReconnect = false;
+        // Set extra options defaults
+        this.extraOptions = Object.assign({ shared: false, blocking: true, skipVersionCheck: false, skipWaitingForReady: false, clusterReconnectTimeoutMs: DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS }, extraOptions);
+        if (!isRedisInstance(opts)) {
+            this.checkBlockingOptions(overrideMessage, opts);
+            this.opts = Object.assign({ port: 6379, host: '127.0.0.1', retryStrategy: function (times) {
+                    return Math.max(Math.min(Math.exp(times), 20000), 1000);
+                } }, opts);
+            if (this.extraOptions.blocking) {
+                this.opts.maxRetriesPerRequest = null;
+            }
+        }
+        else {
+            // Wrap raw ioredis instances in the IRedisClient adapter if not already wrapped
+            this._client = isIRedisClient(opts)
+                ? opts
+                : createIORedisClient(opts);
+            // Test if the redis instance is using keyPrefix
+            // and if so, throw an error.
+            if (this._client.options.keyPrefix) {
+                throw new Error('BullMQ: ioredis does not support ioredis prefixes, use the prefix option instead.');
+            }
+            if (this._client.isCluster) {
+                this.opts = this._client.options.redisOptions;
+            }
+            else {
+                this.opts = this._client.options;
+            }
+            this.checkBlockingOptions(deprecationMessage, this.opts, true);
+        }
+        this.skipVersionCheck =
+            (extraOptions === null || extraOptions === void 0 ? void 0 : extraOptions.skipVersionCheck) ||
+                !!(this.opts && this.opts.skipVersionCheck);
+        this.handleClientError = (err) => {
+            this.emit('error', err);
+        };
+        this.handleClientClose = () => {
+            this.emit('close');
+        };
+        this.handleClientReady = () => {
+            this.emit('ready');
+        };
+        this.initializing = this.init();
+        this.initializing.catch(err => this.emit('error', err));
+    }
+    checkBlockingOptions(msg, options, throwError = false) {
+        if (this.extraOptions.blocking && options && options.maxRetriesPerRequest) {
+            if (throwError) {
+                throw new Error(msg);
+            }
+            else {
+                console.error(msg);
+            }
+        }
+    }
+    /**
+     * Waits for a redis client to be ready.
+     * @param redis - client
+     */
+    static async waitUntilReady(client) {
+        if (client.status === 'ready') {
+            return;
+        }
+        // ioredis Cluster reports 'connect' as its connected status instead of
+        // 'ready' that standalone Redis uses. Treat it as already connected so we
+        // don't hang waiting for a 'ready' event that will never fire and end up
+        // throwing a spurious "Connection is closed" error during disconnect.
+        if (client.status === 'connect' && isRedisCluster(client)) {
+            return;
+        }
+        if (client.status === 'wait') {
+            return client.connect();
+        }
+        if (client.status === 'end') {
+            throw new ConnectionClosedError(CONNECTION_CLOSED_ERROR_MSG);
+        }
+        let handleReady;
+        let handleEnd;
+        let handleError;
+        try {
+            await new Promise((resolve, reject) => {
+                let lastError;
+                handleError = (err) => {
+                    lastError = err;
+                };
+                handleReady = () => {
+                    resolve();
+                };
+                handleEnd = () => {
+                    if (client.status !== 'end') {
+                        reject(lastError ||
+                            new ConnectionClosedError(CONNECTION_CLOSED_ERROR_MSG));
+                    }
+                    else {
+                        if (lastError) {
+                            reject(lastError);
+                        }
+                        else {
+                            // when custom 'end' status is set we already closed
+                            resolve();
+                        }
+                    }
+                };
+                increaseMaxListeners(client, 3);
+                client.once('ready', handleReady);
+                client.on('end', handleEnd);
+                client.once('error', handleError);
+            });
+        }
+        finally {
+            client.removeListener('end', handleEnd);
+            client.removeListener('error', handleError);
+            client.removeListener('ready', handleReady);
+            decreaseMaxListeners(client, 3);
+        }
+    }
+    get client() {
+        return this.initializing;
+    }
+    loadCommands(packageVersion, providedScripts) {
+        const finalScripts = providedScripts || scripts;
+        for (const property in finalScripts) {
+            // Only define the command if not already defined
+            const commandName = `${finalScripts[property].name}:${packageVersion}`;
+            if (!this._client[commandName]) {
+                this._client.defineCommand(commandName, {
+                    numberOfKeys: finalScripts[property].keys,
+                    lua: finalScripts[property].content,
+                });
+            }
+        }
+    }
+    async init() {
+        if (!this._client) {
+            if (RedisConnection.clientFactory) {
+                this._client = RedisConnection.clientFactory(this.opts);
+            }
+            else {
+                const _a = this.opts, { url } = _a, rest = __rest(_a, ["url"]);
+                const ioredisClient = url ? new IORedis(url, rest) : new IORedis(rest);
+                this._client = createIORedisClient(ioredisClient);
+            }
+        }
+        increaseMaxListeners(this._client, 3);
+        this._client.on('error', this.handleClientError);
+        // ioredis treats connection errors as a different event ('close')
+        this._client.on('close', this.handleClientClose);
+        this._client.on('ready', this.handleClientReady);
+        this.patchBlockingClusterClient();
+        if (!this.extraOptions.skipWaitingForReady) {
+            await RedisConnection.waitUntilReady(this._client);
+        }
+        this.loadCommands(this.packageVersion);
+        if (this._client['status'] !== 'end') {
+            const versionResult = await this.getRedisVersionAndType();
+            this.version = versionResult.version;
+            this.dbType = versionResult.databaseType;
+            if (this.skipVersionCheck !== true && !this.closing) {
+                if (isRedisVersionLowerThan(this.version, RedisConnection.minimumVersion, this.dbType)) {
+                    throw new Error(`Redis version needs to be greater or equal than ${RedisConnection.minimumVersion} ` +
+                        `Current: ${this.version}`);
+                }
+                if (isRedisVersionLowerThan(this.version, RedisConnection.recommendedMinimumVersion, this.dbType)) {
+                    console.warn(`It is highly recommended to use a minimum Redis version of ${RedisConnection.recommendedMinimumVersion}
+             Current: ${this.version}`);
+                }
+            }
+            this.capabilities = {
+                canDoubleTimeout: !isRedisVersionLowerThan(this.version, '6.0.0', this.dbType),
+                canBlockFor1Ms: !isRedisVersionLowerThan(this.version, '7.0.8', this.dbType),
+            };
+            this.status = 'ready';
+        }
+        return this._client;
+    }
+    patchBlockingClusterClient() {
+        var _a;
+        const client = this._client;
+        const blockingClient = client;
+        if (!this.extraOptions.blocking ||
+            !isRedisCluster(client) ||
+            typeof blockingClient.bzpopmin !== 'function') {
+            return;
+        }
+        const reconnectTimeoutMs = (_a = this.extraOptions.clusterReconnectTimeoutMs) !== null && _a !== void 0 ? _a : DEFAULT_CLUSTER_RECONNECT_TIMEOUT_MS;
+        blockingClient[clusterPatchRefCount] =
+            (blockingClient[clusterPatchRefCount] || 0) + 1;
+        this.patchedBlockingClusterClient = blockingClient;
+        if (blockingClient[clusterPatchedForBlocking]) {
+            return;
+        }
+        const bzpopmin = blockingClient.bzpopmin;
+        const wrappedBzpopmin = async (...args) => {
+            await RedisConnection.reconnectClusterIfNeeded(blockingClient, reconnectTimeoutMs);
+            try {
+                return await bzpopmin.apply(blockingClient, args);
+            }
+            catch (error) {
+                const commandError = error;
+                if (RedisConnection.shouldReconnectClusterAfterError(blockingClient, commandError)) {
+                    try {
+                        await RedisConnection.reconnectCluster(blockingClient, reconnectTimeoutMs);
+                    }
+                    catch (_a) {
+                        // Preserve the original command failure if best-effort recovery fails.
+                    }
+                }
+                throw commandError;
+            }
+        };
+        blockingClient[clusterOriginalBzpopmin] = bzpopmin;
+        blockingClient[clusterWrappedBzpopmin] = wrappedBzpopmin;
+        blockingClient[clusterPatchedForBlocking] = true;
+        blockingClient.bzpopmin = wrappedBzpopmin;
+    }
+    disableBlockingClusterReconnect() {
+        const client = this.patchedBlockingClusterClient;
+        if (!client || this.disabledBlockingClusterReconnect) {
+            return;
+        }
+        client[clusterClosingRefCount] = (client[clusterClosingRefCount] || 0) + 1;
+        this.disabledBlockingClusterReconnect = true;
+    }
+    releaseBlockingClusterClientPatch() {
+        const client = this.patchedBlockingClusterClient;
+        if (!client) {
+            return;
+        }
+        if (this.disabledBlockingClusterReconnect) {
+            const closingRefCount = (client[clusterClosingRefCount] || 1) - 1;
+            if (closingRefCount > 0) {
+                client[clusterClosingRefCount] = closingRefCount;
+            }
+            else {
+                delete client[clusterClosingRefCount];
+            }
+            this.disabledBlockingClusterReconnect = false;
+        }
+        const patchRefCount = (client[clusterPatchRefCount] || 1) - 1;
+        if (patchRefCount > 0) {
+            client[clusterPatchRefCount] = patchRefCount;
+            this.patchedBlockingClusterClient = undefined;
+            return;
+        }
+        if (client[clusterOriginalBzpopmin] &&
+            client.bzpopmin === client[clusterWrappedBzpopmin]) {
+            client.bzpopmin = client[clusterOriginalBzpopmin];
+        }
+        delete client[clusterPatchRefCount];
+        delete client[clusterClosingRefCount];
+        delete client[clusterOriginalBzpopmin];
+        delete client[clusterWrappedBzpopmin];
+        delete client[clusterPatchedForBlocking];
+        this.patchedBlockingClusterClient = undefined;
+    }
+    static isClusterWithEmptyNodes(client) {
+        return typeof client.nodes === 'function' && client.nodes().length === 0;
+    }
+    static isReconnectingDisabled(client) {
+        const patchRefCount = client[clusterPatchRefCount] || 0;
+        const closingRefCount = client[clusterClosingRefCount] || 0;
+        return (patchRefCount === 0 ||
+            closingRefCount >= patchRefCount ||
+            client.status === 'end' ||
+            client.status === 'closing');
+    }
+    static async reconnectClusterIfNeeded(client, timeoutMs) {
+        if (!RedisConnection.isReconnectingDisabled(client) &&
+            RedisConnection.isClusterWithEmptyNodes(client)) {
+            await RedisConnection.reconnectCluster(client, timeoutMs);
+        }
+    }
+    static shouldReconnectClusterAfterError(client, error) {
+        var _a, _b;
+        if (RedisConnection.isReconnectingDisabled(client)) {
+            return false;
+        }
+        const message = [
+            error.message,
+            (_a = error.cause) === null || _a === void 0 ? void 0 : _a.message,
+            (_b = error.lastNodeError) === null || _b === void 0 ? void 0 : _b.message,
+        ].join(' ');
+        return (RedisConnection.isClusterWithEmptyNodes(client) ||
+            /Command timed out|Failed to refresh slots cache/i.test(message));
+    }
+    static async reconnectCluster(client, timeoutMs) {
+        if (RedisConnection.isReconnectingDisabled(client)) {
+            return;
+        }
+        if (!client[clusterReconnectPromise]) {
+            client[clusterReconnectPromise] =
+                RedisConnection.connectClusterWithTimeout(client, timeoutMs).finally(() => {
+                    client[clusterReconnectPromise] = null;
+                });
+        }
+        await client[clusterReconnectPromise];
+    }
+    // Disconnects and reconnects a cluster client, racing connect() against a
+    // hard cap so a hung reconnect cannot pin `clusterReconnectPromise`
+    // indefinitely. On timeout, the underlying connect() is left running
+    // (ioredis Cluster handles its own retry/state); we simply stop awaiting it.
+    // The next bzpopmin call's `reconnectClusterIfNeeded` check will trigger a
+    // fresh reconnect if the pool is still empty.
+    static async connectClusterWithTimeout(client, timeoutMs) {
+        client.disconnect(false);
+        let timeoutHandle;
+        try {
+            await Promise.race([
+                client.connect(),
+                new Promise((_, reject) => {
+                    var _a;
+                    timeoutHandle = setTimeout(() => {
+                        reject(new ConnectionClosedError(`BullMQ: cluster reconnect timed out after ${timeoutMs}ms`));
+                    }, timeoutMs);
+                    // Don't keep the event loop alive solely for this timer.
+                    (_a = timeoutHandle.unref) === null || _a === void 0 ? void 0 : _a.call(timeoutHandle);
+                }),
+            ]);
+        }
+        finally {
+            if (timeoutHandle) {
+                clearTimeout(timeoutHandle);
+            }
+        }
+    }
+    async disconnect(wait = true) {
+        const client = await this.client;
+        if (client.status !== 'end') {
+            let _resolve, _reject;
+            if (!wait) {
+                return client.disconnect();
+            }
+            const disconnecting = new Promise((resolve, reject) => {
+                increaseMaxListeners(client, 2);
+                client.once('end', resolve);
+                client.once('error', reject);
+                _resolve = resolve;
+                _reject = reject;
+            });
+            client.disconnect();
+            try {
+                await disconnecting;
+            }
+            finally {
+                decreaseMaxListeners(client, 2);
+                client.removeListener('end', _resolve);
+                client.removeListener('error', _reject);
+            }
+        }
+    }
+    async reconnect() {
+        const client = await this.client;
+        return client.connect();
+    }
+    async close(force = false) {
+        var _a;
+        if (!this.closing) {
+            const status = this.status;
+            this.status = 'closing';
+            this.closing = true;
+            this.disableBlockingClusterReconnect();
+            try {
+                if (status === 'ready') {
+                    // Not sure if we need to wait for this
+                    await this.initializing;
+                }
+                if (!this.extraOptions.shared) {
+                    if (status == 'initializing' || force) {
+                        // If we have not still connected to Redis, we need to disconnect.
+                        this._client.disconnect();
+                        // Suppress any rejection from the in-flight init() so it doesn't
+                        // become an unhandled rejection after we close the connection.
+                        (_a = this.initializing) === null || _a === void 0 ? void 0 : _a.catch(() => { });
+                    }
+                    else {
+                        await this._client.quit();
+                    }
+                    // As IORedis does not update this status properly, we do it ourselves.
+                    this._client['status'] = 'end';
+                }
+            }
+            catch (error) {
+                if (isNotConnectionError(error)) {
+                    throw error;
+                }
+            }
+            finally {
+                this.releaseBlockingClusterClientPatch();
+                this._client.off('error', this.handleClientError);
+                this._client.off('close', this.handleClientClose);
+                this._client.off('ready', this.handleClientReady);
+                decreaseMaxListeners(this._client, 3);
+                this.removeAllListeners();
+                this.status = 'closed';
+            }
+        }
+    }
+    async getRedisVersionAndType() {
+        if (this.skipVersionCheck) {
+            return {
+                version: RedisConnection.minimumVersion,
+                databaseType: 'redis',
+            };
+        }
+        const doc = await this._client.info();
+        const redisPrefix = 'redis_version:';
+        const maxMemoryPolicyPrefix = 'maxmemory_policy:';
+        const lines = doc.split(/\r?\n/);
+        let redisVersion;
+        let databaseType = 'redis';
+        // Detect database type from server info
+        for (let i = 0; i < lines.length; i++) {
+            const line = lines[i];
+            // Check for Dragonfly
+            if (line.includes('dragonfly_version:') ||
+                line.includes('server:Dragonfly')) {
+                databaseType = 'dragonfly';
+                // For Dragonfly, extract version from dragonfly_version field
+                if (line.indexOf('dragonfly_version:') === 0) {
+                    redisVersion = line.substr('dragonfly_version:'.length);
+                }
+            }
+            // Check for Valkey
+            else if (line.includes('valkey_version:') ||
+                line.includes('server:Valkey')) {
+                databaseType = 'valkey';
+                // For Valkey, extract version from valkey_version field
+                if (line.indexOf('valkey_version:') === 0) {
+                    redisVersion = line.substr('valkey_version:'.length);
+                }
+            }
+            // Standard Redis version detection
+            else if (line.indexOf(redisPrefix) === 0) {
+                redisVersion = line.substr(redisPrefix.length);
+                // Keep Redis as default unless we find evidence of other databases above
+                if (databaseType === 'redis') {
+                    databaseType = 'redis';
+                }
+            }
+            if (line.indexOf(maxMemoryPolicyPrefix) === 0) {
+                const maxMemoryPolicy = line.substr(maxMemoryPolicyPrefix.length);
+                if (maxMemoryPolicy !== 'noeviction') {
+                    console.warn(`IMPORTANT! Eviction policy is ${maxMemoryPolicy}. It should be "noeviction"`);
+                }
+            }
+        }
+        // Fallback version detection if specific database version field wasn't found
+        if (!redisVersion) {
+            // Try to find any version field as fallback
+            for (const line of lines) {
+                if (line.includes('version:')) {
+                    const parts = line.split(':');
+                    if (parts.length >= 2) {
+                        redisVersion = parts[1];
+                        break;
+                    }
+                }
+            }
+        }
+        return {
+            version: redisVersion || RedisConnection.minimumVersion,
+            databaseType,
+        };
+    }
+    get redisVersion() {
+        return this.version;
+    }
+    get databaseType() {
+        return this.dbType;
+    }
+}
+RedisConnection.minimumVersion = '5.0.0';
+RedisConnection.recommendedMinimumVersion = '6.2.0';
diff --git a/node_modules/bullmq/dist/esm/classes/repeat.d.ts b/node_modules/bullmq/dist/esm/classes/repeat.d.ts
new file mode 100644
index 0000000..00e6e12
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/repeat.d.ts
@@ -0,0 +1,25 @@
+import { RepeatBaseOptions, RepeatableJob, RepeatOptions } from '../interfaces';
+import { JobsOptions } from '../types';
+import { Job } from './job';
+import { QueueBase } from './queue-base';
+import { RedisConnection } from './redis-connection';
+export declare class Repeat extends QueueBase {
+    private repeatStrategy;
+    private repeatKeyHashAlgorithm;
+    constructor(name: string, opts: RepeatBaseOptions, Connection?: typeof RedisConnection);
+    updateRepeatableJob<T = any, R = any, N extends string = string>(name: N, data: T, opts: JobsOptions, { override }: {
+        override: boolean;
+    }): Promise<Job<T, R, N> | undefined>;
+    private createNextJob;
+    getRepeatJobKey<T = any, N extends string = string>(name: N, nextMillis: number, repeatJobKey: string, data: T): string;
+    removeRepeatable(name: string, repeat: RepeatOptions, jobId?: string): Promise<number>;
+    removeRepeatableByKey(repeatJobKey: string): Promise<number>;
+    private getRepeatableData;
+    private keyToData;
+    getRepeatableJobs(start?: number, end?: number, asc?: boolean): Promise<RepeatableJob[]>;
+    getRepeatableCount(): Promise<number>;
+    private hash;
+    private getRepeatDelayedJobId;
+    private getRepeatJobId;
+}
+export declare const getNextMillis: (millis: number, opts: RepeatOptions) => number | undefined;
diff --git a/node_modules/bullmq/dist/esm/classes/repeat.js b/node_modules/bullmq/dist/esm/classes/repeat.js
new file mode 100644
index 0000000..b91a740
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/repeat.js
@@ -0,0 +1,198 @@
+import { __rest } from "tslib";
+import { parseExpression } from 'cron-parser';
+import { createHash } from 'crypto';
+import { QueueBase } from './queue-base';
+export class Repeat extends QueueBase {
+    constructor(name, opts, Connection) {
+        super(name, opts, Connection);
+        this.repeatStrategy =
+            (opts.settings && opts.settings.repeatStrategy) || getNextMillis;
+        this.repeatKeyHashAlgorithm =
+            (opts.settings && opts.settings.repeatKeyHashAlgorithm) || 'md5';
+    }
+    async updateRepeatableJob(name, data, opts, { override }) {
+        var _a, _b;
+        // Backwards compatibility for repeatable jobs for versions <= 3.0.0
+        const repeatOpts = Object.assign({}, opts.repeat);
+        (_a = repeatOpts.pattern) !== null && _a !== void 0 ? _a : (repeatOpts.pattern = repeatOpts.cron);
+        delete repeatOpts.cron;
+        // Check if we reached the limit of the repeatable job's iterations
+        const iterationCount = repeatOpts.count ? repeatOpts.count + 1 : 1;
+        if (typeof repeatOpts.limit !== 'undefined' &&
+            iterationCount > repeatOpts.limit) {
+            return;
+        }
+        // Check if we reached the end date of the repeatable job
+        let now = Date.now();
+        const { endDate } = repeatOpts;
+        if (endDate && now > new Date(endDate).getTime()) {
+            return;
+        }
+        const prevMillis = opts.prevMillis || 0;
+        now = prevMillis < now ? now : prevMillis;
+        const nextMillis = await this.repeatStrategy(now, repeatOpts, name);
+        const { every, pattern } = repeatOpts;
+        const hasImmediately = Boolean((every || pattern) && repeatOpts.immediately);
+        const offset = hasImmediately && every ? now - nextMillis : undefined;
+        if (nextMillis) {
+            // We store the undecorated opts.jobId into the repeat options
+            if (!prevMillis && opts.jobId) {
+                repeatOpts.jobId = opts.jobId;
+            }
+            const legacyRepeatKey = getRepeatConcatOptions(name, repeatOpts);
+            const newRepeatKey = (_b = opts.repeat.key) !== null && _b !== void 0 ? _b : this.hash(legacyRepeatKey);
+            let repeatJobKey;
+            if (override) {
+                repeatJobKey = await this.scripts.addRepeatableJob(newRepeatKey, nextMillis, {
+                    name,
+                    endDate: endDate ? new Date(endDate).getTime() : undefined,
+                    tz: repeatOpts.tz,
+                    pattern,
+                    every,
+                }, legacyRepeatKey);
+            }
+            else {
+                const client = await this.client;
+                repeatJobKey = await this.scripts.updateRepeatableJobMillis(client, newRepeatKey, nextMillis, legacyRepeatKey);
+            }
+            const { immediately } = repeatOpts, filteredRepeatOpts = __rest(repeatOpts, ["immediately"]);
+            return this.createNextJob(name, nextMillis, repeatJobKey, Object.assign(Object.assign({}, opts), { repeat: Object.assign({ offset }, filteredRepeatOpts) }), data, iterationCount, hasImmediately);
+        }
+    }
+    async createNextJob(name, nextMillis, repeatJobKey, opts, data, currentCount, hasImmediately) {
+        //
+        // Generate unique job id for this iteration.
+        //
+        const jobId = this.getRepeatJobKey(name, nextMillis, repeatJobKey, data);
+        const now = Date.now();
+        const delay = nextMillis + (opts.repeat.offset ? opts.repeat.offset : 0) - now;
+        const mergedOpts = Object.assign(Object.assign({}, opts), { jobId, delay: delay < 0 || hasImmediately ? 0 : delay, timestamp: now, prevMillis: nextMillis, repeatJobKey });
+        mergedOpts.repeat = Object.assign(Object.assign({}, opts.repeat), { count: currentCount });
+        return this.Job.create(this, name, data, mergedOpts);
+    }
+    // TODO: remove legacy code in next breaking change
+    getRepeatJobKey(name, nextMillis, repeatJobKey, data) {
+        if (repeatJobKey.split(':').length > 2) {
+            return this.getRepeatJobId({
+                name: name,
+                nextMillis: nextMillis,
+                namespace: this.hash(repeatJobKey),
+                jobId: data === null || data === void 0 ? void 0 : data.id,
+            });
+        }
+        return this.getRepeatDelayedJobId({
+            customKey: repeatJobKey,
+            nextMillis,
+        });
+    }
+    async removeRepeatable(name, repeat, jobId) {
+        var _a;
+        const repeatConcatOptions = getRepeatConcatOptions(name, Object.assign(Object.assign({}, repeat), { jobId }));
+        const repeatJobKey = (_a = repeat.key) !== null && _a !== void 0 ? _a : this.hash(repeatConcatOptions);
+        const legacyRepeatJobId = this.getRepeatJobId({
+            name,
+            nextMillis: '',
+            namespace: this.hash(repeatConcatOptions),
+            jobId: jobId !== null && jobId !== void 0 ? jobId : repeat.jobId,
+            key: repeat.key,
+        });
+        return this.scripts.removeRepeatable(legacyRepeatJobId, repeatConcatOptions, repeatJobKey);
+    }
+    async removeRepeatableByKey(repeatJobKey) {
+        const data = this.keyToData(repeatJobKey);
+        const legacyRepeatJobId = this.getRepeatJobId({
+            name: data.name,
+            nextMillis: '',
+            namespace: this.hash(repeatJobKey),
+            jobId: data.id,
+        });
+        return this.scripts.removeRepeatable(legacyRepeatJobId, '', repeatJobKey);
+    }
+    async getRepeatableData(client, key, next) {
+        const jobData = await client.hgetall(this.toKey('repeat:' + key));
+        if (jobData) {
+            return {
+                key,
+                name: jobData.name,
+                endDate: parseInt(jobData.endDate) || null,
+                tz: jobData.tz || null,
+                pattern: jobData.pattern || null,
+                every: jobData.every || null,
+                next,
+            };
+        }
+        return this.keyToData(key, next);
+    }
+    keyToData(key, next) {
+        const data = key.split(':');
+        const pattern = data.slice(4).join(':') || null;
+        return {
+            key,
+            name: data[0],
+            id: data[1] || null,
+            endDate: parseInt(data[2]) || null,
+            tz: data[3] || null,
+            pattern,
+            next,
+        };
+    }
+    async getRepeatableJobs(start = 0, end = -1, asc = false) {
+        const client = await this.client;
+        const key = this.keys.repeat;
+        const result = asc
+            ? await client.zrange(key, start, end, { WITHSCORES: true })
+            : await client.zrevrange(key, start, end, { WITHSCORES: true });
+        const jobs = [];
+        for (let i = 0; i < result.length; i += 2) {
+            jobs.push(this.getRepeatableData(client, result[i], parseInt(result[i + 1])));
+        }
+        return Promise.all(jobs);
+    }
+    async getRepeatableCount() {
+        const client = await this.client;
+        return client.zcard(this.toKey('repeat'));
+    }
+    hash(str) {
+        return createHash(this.repeatKeyHashAlgorithm).update(str).digest('hex');
+    }
+    getRepeatDelayedJobId({ nextMillis, customKey, }) {
+        return `repeat:${customKey}:${nextMillis}`;
+    }
+    getRepeatJobId({ name, nextMillis, namespace, jobId, key, }) {
+        const checksum = key !== null && key !== void 0 ? key : this.hash(`${name}${jobId || ''}${namespace}`);
+        return `repeat:${checksum}:${nextMillis}`;
+    }
+}
+function getRepeatConcatOptions(name, repeat) {
+    const endDate = repeat.endDate ? new Date(repeat.endDate).getTime() : '';
+    const tz = repeat.tz || '';
+    const pattern = repeat.pattern;
+    const suffix = (pattern ? pattern : String(repeat.every)) || '';
+    const jobId = repeat.jobId ? repeat.jobId : '';
+    return `${name}:${jobId}:${endDate}:${tz}:${suffix}`;
+}
+export const getNextMillis = (millis, opts) => {
+    const pattern = opts.pattern;
+    if (pattern && opts.every) {
+        throw new Error('Both .pattern and .every options are defined for this repeatable job');
+    }
+    if (opts.every) {
+        return (Math.floor(millis / opts.every) * opts.every +
+            (opts.immediately ? 0 : opts.every));
+    }
+    const currentDate = opts.startDate && new Date(opts.startDate) > new Date(millis)
+        ? new Date(opts.startDate)
+        : new Date(millis);
+    const interval = parseExpression(pattern, Object.assign(Object.assign({}, opts), { currentDate }));
+    try {
+        if (opts.immediately) {
+            return new Date().getTime();
+        }
+        else {
+            return interval.next().getTime();
+        }
+    }
+    catch (e) {
+        // Ignore error
+    }
+};
diff --git a/node_modules/bullmq/dist/esm/classes/sandbox.d.ts b/node_modules/bullmq/dist/esm/classes/sandbox.d.ts
new file mode 100644
index 0000000..52076a8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/sandbox.d.ts
@@ -0,0 +1,4 @@
+import { ChildPool } from './child-pool';
+import { Job } from './job';
+declare const sandbox: <T, R, N extends string>(processFile: any, childPool: ChildPool) => (job: Job<T, R, N>, token?: string, signal?: AbortSignal) => Promise<R>;
+export default sandbox;
diff --git a/node_modules/bullmq/dist/esm/classes/sandbox.js b/node_modules/bullmq/dist/esm/classes/sandbox.js
new file mode 100644
index 0000000..dbcd718
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/sandbox.js
@@ -0,0 +1,156 @@
+import { ChildCommand, ParentCommand } from '../enums';
+const sandbox = (processFile, childPool) => {
+    return async function process(job, token, signal) {
+        let child;
+        let msgHandler;
+        let exitHandler;
+        let abortHandler;
+        try {
+            const done = new Promise((resolve, reject) => {
+                const initChild = async () => {
+                    try {
+                        exitHandler = (exitCode, signal) => {
+                            reject(new Error('Unexpected exit code: ' + exitCode + ' signal: ' + signal));
+                        };
+                        child = await childPool.retain(processFile);
+                        child.on('exit', exitHandler);
+                        msgHandler = async (msg) => {
+                            var _a, _b, _c, _d, _e;
+                            try {
+                                switch (msg.cmd) {
+                                    case ParentCommand.Completed:
+                                        resolve(msg.value);
+                                        break;
+                                    case ParentCommand.Failed:
+                                    case ParentCommand.Error: {
+                                        const err = new Error();
+                                        Object.assign(err, msg.value);
+                                        reject(err);
+                                        break;
+                                    }
+                                    case ParentCommand.Progress:
+                                        await job.updateProgress(msg.value);
+                                        break;
+                                    case ParentCommand.Log:
+                                        await job.log(msg.value);
+                                        break;
+                                    case ParentCommand.MoveToDelayed:
+                                        await job.moveToDelayed((_a = msg.value) === null || _a === void 0 ? void 0 : _a.timestamp, (_b = msg.value) === null || _b === void 0 ? void 0 : _b.token);
+                                        break;
+                                    case ParentCommand.MoveToWait:
+                                        await job.moveToWait((_c = msg.value) === null || _c === void 0 ? void 0 : _c.token);
+                                        break;
+                                    case ParentCommand.MoveToWaitingChildren:
+                                        {
+                                            const value = await job.moveToWaitingChildren((_d = msg.value) === null || _d === void 0 ? void 0 : _d.token, (_e = msg.value) === null || _e === void 0 ? void 0 : _e.opts);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: ChildCommand.MoveToWaitingChildrenResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case ParentCommand.Update:
+                                        await job.updateData(msg.value);
+                                        break;
+                                    case ParentCommand.GetChildrenValues:
+                                        {
+                                            const value = await job.getChildrenValues();
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: ChildCommand.GetChildrenValuesResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case ParentCommand.GetIgnoredChildrenFailures:
+                                        {
+                                            const value = await job.getIgnoredChildrenFailures();
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: ChildCommand.GetIgnoredChildrenFailuresResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case ParentCommand.GetDependenciesCount:
+                                        {
+                                            const value = await job.getDependenciesCount(msg.value);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: ChildCommand.GetDependenciesCountResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                    case ParentCommand.GetDependencies:
+                                        {
+                                            const value = await job.getDependencies(msg.value);
+                                            child.send({
+                                                requestId: msg.requestId,
+                                                cmd: ChildCommand.GetDependenciesResponse,
+                                                value,
+                                            });
+                                        }
+                                        break;
+                                }
+                            }
+                            catch (err) {
+                                reject(err);
+                            }
+                        };
+                        child.on('message', msgHandler);
+                        child.send({
+                            cmd: ChildCommand.Start,
+                            job: job.asJSONSandbox(),
+                            token,
+                        });
+                        if (signal) {
+                            abortHandler = () => {
+                                try {
+                                    child.send({
+                                        cmd: ChildCommand.Cancel,
+                                        value: signal.reason,
+                                    });
+                                }
+                                catch (_a) {
+                                    // Child process may have already exited
+                                }
+                            };
+                            if (signal.aborted) {
+                                abortHandler();
+                            }
+                            else {
+                                signal.addEventListener('abort', abortHandler, { once: true });
+                            }
+                        }
+                    }
+                    catch (error) {
+                        reject(error);
+                    }
+                };
+                initChild();
+            });
+            await done;
+            return done;
+        }
+        finally {
+            // Note: There is a potential race where the signal is aborted between
+            // `await done` and this cleanup. This is safe because:
+            // 1. abortHandler has a try-catch for child process already exited
+            // 2. The listener is added with `once: true`, so it fires at most once
+            // 3. removeEventListener here is defensive cleanup only
+            if (signal && abortHandler) {
+                signal.removeEventListener('abort', abortHandler);
+            }
+            if (child) {
+                child.off('message', msgHandler);
+                child.off('exit', exitHandler);
+                if (child.exitCode === null && child.signalCode === null) {
+                    childPool.release(child);
+                }
+            }
+        }
+    };
+};
+export default sandbox;
diff --git a/node_modules/bullmq/dist/esm/classes/scripts.d.ts b/node_modules/bullmq/dist/esm/classes/scripts.d.ts
new file mode 100644
index 0000000..7d0e025
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/scripts.d.ts
@@ -0,0 +1,253 @@
+/**
+ * Includes all the scripts needed by the queue and jobs.
+ */
+import { JobJson, JobJsonRaw, MinimalJob, MoveToWaitingChildrenOpts, ParentKeyOpts, RedisClient, MoveToDelayedOpts, RepeatableOptions, RetryJobOpts, RetryOptions, ScriptQueueContext } from '../interfaces';
+import { JobsOptions, JobState, JobType, FinishedStatus, FinishedPropValAttribute, KeepJobs, RedisJobOptions, JobProgress } from '../types';
+import { IRedisTransaction } from '../interfaces';
+export type JobData = [JobJsonRaw | number, string?];
+export declare class Scripts {
+    protected queue: ScriptQueueContext;
+    protected version: string;
+    moveToFinishedKeys: (string | undefined)[];
+    constructor(queue: ScriptQueueContext);
+    /**
+     * Executes a registered Lua script on the given Redis client, resolving the
+     * versioned command name (e.g. `addJob:<packageVersion>`) so the script
+     * belonging to the current BullMQ version is invoked.
+     *
+     * @param client - The Redis client or pipeline/transaction on which to run the command.
+     * @param commandName - The base name of the Lua script (without version suffix).
+     * @param args - Positional arguments forwarded to the Lua script (keys followed by argv).
+     * @returns The raw result produced by the Lua script.
+     *
+     * @private
+     */
+    execCommand(client: RedisClient | IRedisTransaction, commandName: string, args: any[]): any;
+    /**
+     * Checks whether a job with the given id is present in a Redis list
+     * (e.g. the wait or active list). Uses `LPOS` on Redis \>= 6.0.6, and
+     * falls back to a Lua script on older versions.
+     *
+     * @param listKey - The Redis list key to search.
+     * @param jobId - The job id to look up in the list.
+     * @returns `true` if the job is found in the list, `false` otherwise.
+     *
+     * @private
+     */
+    isJobInList(listKey: string, jobId: string): Promise<boolean>;
+    protected addDelayedJobArgs(job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): (string | Buffer)[];
+    protected addDelayedJob(client: RedisClient | IRedisTransaction, job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): Promise<string | number>;
+    protected addPrioritizedJobArgs(job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): (string | Buffer)[];
+    protected addPrioritizedJob(client: RedisClient | IRedisTransaction, job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): Promise<string | number>;
+    protected addParentJobArgs(job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): (string | Buffer)[];
+    protected addParentJob(client: RedisClient | IRedisTransaction, job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): Promise<string | number>;
+    protected addStandardJobArgs(job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): (string | Buffer)[];
+    protected addStandardJob(client: RedisClient | IRedisTransaction, job: JobJson, encodedOpts: any, args: (string | number | Record<string, any>)[]): Promise<string | number>;
+    addJob(client: RedisClient | IRedisTransaction, job: JobJson, opts: RedisJobOptions, jobId: string, parentKeyOpts?: ParentKeyOpts): Promise<string>;
+    protected pauseArgs(pause: boolean): (string | number)[];
+    pause(pause: boolean): Promise<void>;
+    protected addRepeatableJobArgs(customKey: string, nextMillis: number, opts: RepeatableOptions, legacyCustomKey: string): (string | number | Buffer)[];
+    /**
+     * Adds (or updates) a repeatable job entry in the repeat zset and stores
+     * its repeat options under the corresponding repeat hash. If a previous
+     * delayed iteration for this repeat key exists, it is cleaned up so the
+     * next iteration can be scheduled separately when the job is created.
+     *
+     * @param customKey - The current repeat key identifying this repeatable job.
+     * @param nextMillis - The timestamp (ms since epoch) for the next run.
+     * @param opts - Repeatable options (cron/every pattern, tz, limit, etc.).
+     * @param legacyCustomKey - The previous/legacy repeat key, used for migration and cleanup.
+     * @returns The repeatable job key that was stored (either `customKey` or,
+     * for backwards-compatible entries, `legacyCustomKey`). The actual delayed
+     * iteration is scheduled later when the job for `nextMillis` is created.
+     *
+     * @private
+     */
+    addRepeatableJob(customKey: string, nextMillis: number, opts: RepeatableOptions, legacyCustomKey: string): Promise<string>;
+    /**
+     * Removes a deduplication key from Redis so that a new job with the same
+     * deduplication id can be enqueued again. The key is only removed if it
+     * currently maps to the provided `jobId`, preventing races between
+     * producers and finishing jobs.
+     *
+     * @param deduplicationId - The deduplication id whose key should be cleared.
+     * @param jobId - The id of the job that currently owns the dedup key.
+     * @returns `1` if the key was removed, `0` otherwise.
+     *
+     * @private
+     */
+    removeDeduplicationKey(deduplicationId: string, jobId: string): Promise<number>;
+    /**
+     * Registers a job scheduler and enqueues its next delayed iteration.
+     * The scheduler stores the template data/options so subsequent iterations
+     * can be produced automatically based on the repeat options.
+     *
+     * @param jobSchedulerId - The id that uniquely identifies this scheduler.
+     * @param nextMillis - Timestamp (ms since epoch) for the next iteration.
+     * @param templateData - Serialized template data reused for every iteration.
+     * @param templateOpts - Redis-encoded job options applied to every iteration.
+     * @param opts - Repeat options describing the scheduling pattern.
+     * @param delayedJobOpts - Options applied to the next delayed job that is produced.
+     * @param producerId - Optional id of the job that produced this iteration, used to prevent duplicates.
+     * @returns A tuple of `[jobId, delay]`, where `delay` is the computed delay in milliseconds
+     * for the next iteration. When `delay` is `0`, the job is enqueued immediately.
+     * @throws An error resolved from `finishedErrors` when the Lua script returns a negative status code.
+     *
+     * @private
+     */
+    addJobScheduler(jobSchedulerId: string, nextMillis: number, templateData: string, templateOpts: RedisJobOptions, opts: RepeatableOptions, delayedJobOpts: JobsOptions, producerId?: string): Promise<[string, number]>;
+    updateRepeatableJobMillis(client: RedisClient, customKey: string, nextMillis: number, legacyCustomKey: string): Promise<string>;
+    updateJobSchedulerNextMillis(jobSchedulerId: string, nextMillis: number, templateData: string, delayedJobOpts: JobsOptions, producerId?: string): Promise<string | null>;
+    private removeRepeatableArgs;
+    getRepeatConcatOptions(repeatConcatOptions: string, repeatJobKey: string): string;
+    removeRepeatable(legacyRepeatJobId: string, repeatConcatOptions: string, repeatJobKey: string): Promise<number>;
+    removeJobScheduler(jobSchedulerId: string): Promise<number>;
+    protected removeArgs(jobId: string, removeChildren: boolean): (string | number)[];
+    remove(jobId: string, removeChildren: boolean): Promise<number>;
+    removeUnprocessedChildren(jobId: string): Promise<void>;
+    extendLock(jobId: string, token: string, duration: number, client?: RedisClient | IRedisTransaction): Promise<number>;
+    extendLocks(jobIds: string[], tokens: string[], duration: number): Promise<string[]>;
+    updateData<T = any, R = any, N extends string = string>(job: MinimalJob<T, R, N>, data: T): Promise<void>;
+    updateProgress(jobId: string, progress: JobProgress): Promise<void>;
+    addLog(jobId: string, logRow: string, keepLogs?: number): Promise<number>;
+    protected moveToFinishedArgs<T = any, R = any, N extends string = string>(job: MinimalJob<T, R, N>, val: any, propVal: FinishedPropValAttribute, shouldRemove: undefined | boolean | number | KeepJobs, target: FinishedStatus, token: string, timestamp: number, fetchNext?: boolean, fieldsToUpdate?: Record<string, any>): (string | number | boolean | Buffer)[];
+    protected getKeepJobs(shouldRemove: undefined | boolean | number | KeepJobs, workerKeepJobs: undefined | KeepJobs): KeepJobs;
+    moveToFinished(jobId: string, args: (string | number | boolean | Buffer)[]): Promise<any[]>;
+    private drainArgs;
+    drain(delayed: boolean): Promise<void>;
+    private removeChildDependencyArgs;
+    removeChildDependency(jobId: string, parentKey: string): Promise<boolean>;
+    private getRangesArgs;
+    getRanges(types: JobType[], start?: number, end?: number, asc?: boolean): Promise<[string][]>;
+    private getCountsArgs;
+    getCounts(types: JobType[]): Promise<number[]>;
+    protected getCountsPerPriorityArgs(priorities: number[]): (string | number)[];
+    getCountsPerPriority(priorities: number[]): Promise<number[]>;
+    protected getDependencyCountsArgs(jobId: string, types: string[]): (string | number)[];
+    getDependencyCounts(jobId: string, types: string[]): Promise<number[]>;
+    moveToCompletedArgs<T = any, R = any, N extends string = string>(job: MinimalJob<T, R, N>, returnvalue: R, removeOnComplete: boolean | number | KeepJobs, token: string, fetchNext?: boolean): (string | number | boolean | Buffer)[];
+    moveToFailedArgs<T = any, R = any, N extends string = string>(job: MinimalJob<T, R, N>, failedReason: string, removeOnFailed: boolean | number | KeepJobs, token: string, fetchNext?: boolean, fieldsToUpdate?: Record<string, any>): (string | number | boolean | Buffer)[];
+    isFinished(jobId: string, returnValue?: boolean): Promise<number | [number, string]>;
+    getState(jobId: string): Promise<JobState | 'unknown'>;
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param jobId - the ID of the job to change the delay for.
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns delay in milliseconds.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    changeDelay(jobId: string, delay: number): Promise<void>;
+    private changeDelayArgs;
+    changePriority(jobId: string, priority?: number, lifo?: boolean): Promise<void>;
+    protected changePriorityArgs(jobId: string, priority?: number, lifo?: boolean): (string | number)[];
+    moveToDelayedArgs(jobId: string, timestamp: number, token: string, delay: number, opts?: MoveToDelayedOpts): (string | number | Buffer)[];
+    moveToWaitingChildrenArgs(jobId: string, token: string, opts?: MoveToWaitingChildrenOpts): (string | number)[];
+    isMaxedArgs(): string[];
+    isMaxed(): Promise<boolean>;
+    moveToDelayed(jobId: string, timestamp: number, delay: number, token?: string, opts?: MoveToDelayedOpts): Promise<void | any[]>;
+    /**
+     * Move parent job to waiting-children state.
+     *
+     * @returns true if job is successfully moved, false if there are pending dependencies.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobLockNotExist
+     * This exception is thrown if job lock is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in active state.
+     */
+    moveToWaitingChildren(jobId: string, token: string, opts?: MoveToWaitingChildrenOpts): Promise<boolean>;
+    getRateLimitTtlArgs(maxJobs?: number): (string | number)[];
+    getRateLimitTtl(maxJobs?: number): Promise<number>;
+    /**
+     * Remove jobs in a specific state.
+     *
+     * @returns Id jobs from the deleted records.
+     */
+    cleanJobsInSet(set: string, timestamp: number, limit?: number): Promise<string[]>;
+    getJobSchedulerArgs(id: string): string[];
+    getJobScheduler(id: string): Promise<[any, string | null]>;
+    retryJobArgs(jobId: string, lifo: boolean, token: string, opts?: MoveToDelayedOpts): (string | number | Buffer)[];
+    retryJob(jobId: string, lifo: boolean, token?: string, opts?: RetryJobOpts): Promise<void>;
+    protected moveJobsToWaitArgs(state: FinishedStatus | 'delayed', count: number, timestamp: number): (string | number)[];
+    retryJobs(state?: FinishedStatus, count?: number, timestamp?: number): Promise<number>;
+    promoteJobs(count?: number): Promise<number>;
+    /**
+     * Attempts to reprocess a job
+     *
+     * @param job - The job to reprocess
+     * @param state - The expected job state. If the job is not found
+     * on the provided state, then it's not reprocessed. Supported states: 'failed', 'completed'
+     *
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * @throws Will throw an error with a code property indicating the failure reason:
+     *   - code 0: Job does not exist
+     *   - code -1: Job is currently locked and can't be retried
+     *   - code -2: Job was not found in the expected set
+     */
+    reprocessJob<T = any, R = any, N extends string = string>(job: MinimalJob<T, R, N>, state: 'failed' | 'completed', opts?: RetryOptions): Promise<void>;
+    getMetrics(type: 'completed' | 'failed', start?: number, end?: number): Promise<[string[], string[], number]>;
+    moveToActive(client: RedisClient, token: string, name?: string): Promise<any[]>;
+    promote(jobId: string): Promise<void>;
+    protected moveStalledJobsToWaitArgs(): (string | number)[];
+    /**
+     * Looks for unlocked jobs in the active queue.
+     *
+     * The job was being worked on, but the worker process died and it failed to renew the lock.
+     * We call these jobs 'stalled'. This is the most common case. We resolve these by moving them
+     * back to wait to be re-processed. To prevent jobs from cycling endlessly between active and wait,
+     * (e.g. if the job handler keeps crashing),
+     * we limit the number stalled job recoveries to settings.maxStalledCount.
+     */
+    moveStalledJobsToWait(): Promise<string[]>;
+    /**
+     * Moves a job back from Active to Wait.
+     * This script is used when a job has been manually rate limited and needs
+     * to be moved back to wait from active status.
+     *
+     * @param client - Redis client
+     * @param jobId - Job id
+     * @returns
+     */
+    moveJobFromActiveToWait(jobId: string, token?: string): Promise<any>;
+    obliterate(opts: {
+        force: boolean;
+        count: number;
+    }): Promise<number>;
+    /**
+     * Paginate a set or hash keys.
+     * @param opts - options to define the pagination behaviour
+     *
+     */
+    paginate(key: string, opts: {
+        start: number;
+        end: number;
+        fetchJobs?: boolean;
+    }): Promise<{
+        cursor: string;
+        items: {
+            id: string;
+            v?: any;
+            err?: string;
+        }[];
+        total: number;
+        jobs?: JobJsonRaw[];
+    }>;
+    finishedErrors({ code, jobId, parentKey, command, state, }: {
+        code: number;
+        jobId?: string;
+        parentKey?: string;
+        command: string;
+        state?: string;
+    }): Error;
+    removeOrphanedJobs(candidateJobIds: string[], stateKeySuffixes: string[], jobSubKeySuffixes: string[]): Promise<number>;
+}
+export declare function raw2NextJobData(raw: any[]): any[];
diff --git a/node_modules/bullmq/dist/esm/classes/scripts.js b/node_modules/bullmq/dist/esm/classes/scripts.js
new file mode 100644
index 0000000..fe641e2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/scripts.js
@@ -0,0 +1,1293 @@
+/**
+ * Includes all the scripts needed by the queue and jobs.
+ */
+'use strict';
+import { Packr } from 'msgpackr';
+const packer = new Packr({
+    useRecords: false,
+    encodeUndefinedAsNil: true,
+});
+const pack = packer.pack;
+import { ErrorCode } from '../enums';
+import { array2obj, getParentKey, isRedisVersionLowerThan, objectToFlatArray, } from '../utils';
+import { version as packageVersion } from '../version';
+import { UnrecoverableError } from './errors';
+export class Scripts {
+    constructor(queue) {
+        this.queue = queue;
+        this.version = packageVersion;
+        const queueKeys = this.queue.keys;
+        this.moveToFinishedKeys = [
+            queueKeys.wait,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.events,
+            queueKeys.stalled,
+            queueKeys.limiter,
+            queueKeys.delayed,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.pc,
+            undefined,
+            undefined,
+            undefined,
+            undefined,
+        ];
+    }
+    /**
+     * Executes a registered Lua script on the given Redis client, resolving the
+     * versioned command name (e.g. `addJob:<packageVersion>`) so the script
+     * belonging to the current BullMQ version is invoked.
+     *
+     * @param client - The Redis client or pipeline/transaction on which to run the command.
+     * @param commandName - The base name of the Lua script (without version suffix).
+     * @param args - Positional arguments forwarded to the Lua script (keys followed by argv).
+     * @returns The raw result produced by the Lua script.
+     *
+     * @private
+     */
+    execCommand(client, commandName, args) {
+        const commandNameWithVersion = `${commandName}:${this.version}`;
+        return client.runCommand(commandNameWithVersion, args);
+    }
+    /**
+     * Checks whether a job with the given id is present in a Redis list
+     * (e.g. the wait or active list). Uses `LPOS` on Redis \>= 6.0.6, and
+     * falls back to a Lua script on older versions.
+     *
+     * @param listKey - The Redis list key to search.
+     * @param jobId - The job id to look up in the list.
+     * @returns `true` if the job is found in the list, `false` otherwise.
+     *
+     * @private
+     */
+    async isJobInList(listKey, jobId) {
+        const client = await this.queue.client;
+        let result;
+        if (isRedisVersionLowerThan(this.queue.redisVersion, '6.0.6', this.queue.databaseType)) {
+            result = await this.execCommand(client, 'isJobInList', [listKey, jobId]);
+        }
+        else {
+            result = await client.lpos(listKey, jobId);
+        }
+        return Number.isInteger(result);
+    }
+    addDelayedJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.delayed,
+            queueKeys.completed,
+            queueKeys.events,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addDelayedJob(client, job, encodedOpts, args) {
+        const argsList = this.addDelayedJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addDelayedJob', argsList);
+    }
+    addPrioritizedJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.prioritized,
+            queueKeys.delayed,
+            queueKeys.completed,
+            queueKeys.active,
+            queueKeys.events,
+            queueKeys.pc,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addPrioritizedJob(client, job, encodedOpts, args) {
+        const argsList = this.addPrioritizedJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addPrioritizedJob', argsList);
+    }
+    addParentJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.delayed,
+            queueKeys['waiting-children'],
+            queueKeys.completed,
+            queueKeys.events,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addParentJob(client, job, encodedOpts, args) {
+        const argsList = this.addParentJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addParentJob', argsList);
+    }
+    addStandardJobArgs(job, encodedOpts, args) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.id,
+            queueKeys.completed,
+            queueKeys.delayed,
+            queueKeys.active,
+            queueKeys.events,
+            queueKeys.marker,
+        ];
+        keys.push(pack(args), job.data, encodedOpts);
+        return keys;
+    }
+    addStandardJob(client, job, encodedOpts, args) {
+        const argsList = this.addStandardJobArgs(job, encodedOpts, args);
+        return this.execCommand(client, 'addStandardJob', argsList);
+    }
+    async addJob(client, job, opts, jobId, parentKeyOpts = {}) {
+        const queueKeys = this.queue.keys;
+        const parent = job.parent;
+        const args = [
+            queueKeys[''],
+            typeof jobId !== 'undefined' ? jobId : '',
+            job.name,
+            job.timestamp,
+            job.parentKey || null,
+            parentKeyOpts.parentDependenciesKey || null,
+            parent,
+            job.repeatJobKey,
+            job.deduplicationId ? `${queueKeys.de}:${job.deduplicationId}` : null,
+        ];
+        let encodedOpts;
+        if (opts.repeat) {
+            const repeat = Object.assign({}, opts.repeat);
+            if (repeat.startDate) {
+                repeat.startDate = +new Date(repeat.startDate);
+            }
+            if (repeat.endDate) {
+                repeat.endDate = +new Date(repeat.endDate);
+            }
+            encodedOpts = pack(Object.assign(Object.assign({}, opts), { repeat }));
+        }
+        else {
+            encodedOpts = pack(opts);
+        }
+        let result;
+        if (parentKeyOpts.addToWaitingChildren) {
+            result = await this.addParentJob(client, job, encodedOpts, args);
+        }
+        else if (typeof opts.delay == 'number' && opts.delay > 0) {
+            result = await this.addDelayedJob(client, job, encodedOpts, args);
+        }
+        else if (opts.priority) {
+            result = await this.addPrioritizedJob(client, job, encodedOpts, args);
+        }
+        else {
+            result = await this.addStandardJob(client, job, encodedOpts, args);
+        }
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                parentKey: parentKeyOpts.parentKey,
+                command: 'addJob',
+            });
+        }
+        return result;
+    }
+    pauseArgs(pause) {
+        let src = 'wait', dst = 'paused';
+        if (!pause) {
+            src = 'paused';
+            dst = 'wait';
+        }
+        const keys = [src, dst, 'meta', 'prioritized'].map((name) => this.queue.toKey(name));
+        keys.push(this.queue.keys.events, this.queue.keys.delayed, this.queue.keys.marker);
+        const args = [pause ? 'paused' : 'resumed'];
+        return keys.concat(args);
+    }
+    async pause(pause) {
+        const client = await this.queue.client;
+        const args = this.pauseArgs(pause);
+        return this.execCommand(client, 'pause', args);
+    }
+    addRepeatableJobArgs(customKey, nextMillis, opts, legacyCustomKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+        ];
+        const args = [
+            nextMillis,
+            pack(opts),
+            legacyCustomKey,
+            customKey,
+            queueKeys[''],
+        ];
+        return keys.concat(args);
+    }
+    /**
+     * Adds (or updates) a repeatable job entry in the repeat zset and stores
+     * its repeat options under the corresponding repeat hash. If a previous
+     * delayed iteration for this repeat key exists, it is cleaned up so the
+     * next iteration can be scheduled separately when the job is created.
+     *
+     * @param customKey - The current repeat key identifying this repeatable job.
+     * @param nextMillis - The timestamp (ms since epoch) for the next run.
+     * @param opts - Repeatable options (cron/every pattern, tz, limit, etc.).
+     * @param legacyCustomKey - The previous/legacy repeat key, used for migration and cleanup.
+     * @returns The repeatable job key that was stored (either `customKey` or,
+     * for backwards-compatible entries, `legacyCustomKey`). The actual delayed
+     * iteration is scheduled later when the job for `nextMillis` is created.
+     *
+     * @private
+     */
+    async addRepeatableJob(customKey, nextMillis, opts, legacyCustomKey) {
+        const client = await this.queue.client;
+        const args = this.addRepeatableJobArgs(customKey, nextMillis, opts, legacyCustomKey);
+        return this.execCommand(client, 'addRepeatableJob', args);
+    }
+    /**
+     * Removes a deduplication key from Redis so that a new job with the same
+     * deduplication id can be enqueued again. The key is only removed if it
+     * currently maps to the provided `jobId`, preventing races between
+     * producers and finishing jobs.
+     *
+     * @param deduplicationId - The deduplication id whose key should be cleared.
+     * @param jobId - The id of the job that currently owns the dedup key.
+     * @returns `1` if the key was removed, `0` otherwise.
+     *
+     * @private
+     */
+    async removeDeduplicationKey(deduplicationId, jobId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [`${queueKeys.de}:${deduplicationId}`];
+        const args = [jobId];
+        return this.execCommand(client, 'removeDeduplicationKey', keys.concat(args));
+    }
+    /**
+     * Registers a job scheduler and enqueues its next delayed iteration.
+     * The scheduler stores the template data/options so subsequent iterations
+     * can be produced automatically based on the repeat options.
+     *
+     * @param jobSchedulerId - The id that uniquely identifies this scheduler.
+     * @param nextMillis - Timestamp (ms since epoch) for the next iteration.
+     * @param templateData - Serialized template data reused for every iteration.
+     * @param templateOpts - Redis-encoded job options applied to every iteration.
+     * @param opts - Repeat options describing the scheduling pattern.
+     * @param delayedJobOpts - Options applied to the next delayed job that is produced.
+     * @param producerId - Optional id of the job that produced this iteration, used to prevent duplicates.
+     * @returns A tuple of `[jobId, delay]`, where `delay` is the computed delay in milliseconds
+     * for the next iteration. When `delay` is `0`, the job is enqueued immediately.
+     * @throws An error resolved from `finishedErrors` when the Lua script returns a negative status code.
+     *
+     * @private
+     */
+    async addJobScheduler(jobSchedulerId, nextMillis, templateData, templateOpts, opts, delayedJobOpts, 
+    // The job id of the job that produced this next iteration
+    producerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.prioritized,
+            queueKeys.marker,
+            queueKeys.id,
+            queueKeys.events,
+            queueKeys.pc,
+            queueKeys.active,
+        ];
+        const args = [
+            nextMillis,
+            pack(opts),
+            jobSchedulerId,
+            templateData,
+            pack(templateOpts),
+            pack(delayedJobOpts),
+            Date.now(),
+            queueKeys[''],
+            producerId ? this.queue.toKey(producerId) : '',
+        ];
+        const result = await this.execCommand(client, 'addJobScheduler', keys.concat(args));
+        if (typeof result === 'number' && result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                command: 'addJobScheduler',
+            });
+        }
+        return result;
+    }
+    async updateRepeatableJobMillis(client, customKey, nextMillis, legacyCustomKey) {
+        const args = [
+            this.queue.keys.repeat,
+            nextMillis,
+            customKey,
+            legacyCustomKey,
+        ];
+        return this.execCommand(client, 'updateRepeatableJobMillis', args);
+    }
+    async updateJobSchedulerNextMillis(jobSchedulerId, nextMillis, templateData, delayedJobOpts, 
+    // The job id of the job that produced this next iteration - TODO: remove in next breaking change
+    producerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.repeat,
+            queueKeys.delayed,
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.prioritized,
+            queueKeys.marker,
+            queueKeys.id,
+            queueKeys.events,
+            queueKeys.pc,
+            producerId ? this.queue.toKey(producerId) : '',
+            queueKeys.active,
+        ];
+        const args = [
+            nextMillis,
+            jobSchedulerId,
+            templateData,
+            pack(delayedJobOpts),
+            Date.now(),
+            queueKeys[''],
+            producerId,
+        ];
+        return this.execCommand(client, 'updateJobScheduler', keys.concat(args));
+    }
+    removeRepeatableArgs(legacyRepeatJobId, repeatConcatOptions, repeatJobKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.repeat, queueKeys.delayed, queueKeys.events];
+        const args = [
+            legacyRepeatJobId,
+            this.getRepeatConcatOptions(repeatConcatOptions, repeatJobKey),
+            repeatJobKey,
+            queueKeys[''],
+        ];
+        return keys.concat(args);
+    }
+    // TODO: remove this check in next breaking change
+    getRepeatConcatOptions(repeatConcatOptions, repeatJobKey) {
+        if (repeatJobKey && repeatJobKey.split(':').length > 2) {
+            return repeatJobKey;
+        }
+        return repeatConcatOptions;
+    }
+    async removeRepeatable(legacyRepeatJobId, repeatConcatOptions, repeatJobKey) {
+        const client = await this.queue.client;
+        const args = this.removeRepeatableArgs(legacyRepeatJobId, repeatConcatOptions, repeatJobKey);
+        return this.execCommand(client, 'removeRepeatable', args);
+    }
+    async removeJobScheduler(jobSchedulerId) {
+        const client = await this.queue.client;
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.repeat, queueKeys.delayed, queueKeys.events];
+        const args = [jobSchedulerId, queueKeys['']];
+        return this.execCommand(client, 'removeJobScheduler', keys.concat(args));
+    }
+    removeArgs(jobId, removeChildren) {
+        const keys = [jobId, 'repeat'].map(name => this.queue.toKey(name));
+        const args = [jobId, removeChildren ? 1 : 0, this.queue.toKey('')];
+        return keys.concat(args);
+    }
+    async remove(jobId, removeChildren) {
+        const client = await this.queue.client;
+        const args = this.removeArgs(jobId, removeChildren);
+        const result = await this.execCommand(client, 'removeJob', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'removeJob',
+            });
+        }
+        return result;
+    }
+    async removeUnprocessedChildren(jobId) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.toKey(jobId),
+            this.queue.keys.meta,
+            this.queue.toKey(''),
+            jobId,
+        ];
+        await this.execCommand(client, 'removeUnprocessedChildren', args);
+    }
+    async extendLock(jobId, token, duration, client) {
+        client = client || (await this.queue.client);
+        const args = [
+            this.queue.toKey(jobId) + ':lock',
+            this.queue.keys.stalled,
+            token,
+            duration,
+            jobId,
+        ];
+        return this.execCommand(client, 'extendLock', args);
+    }
+    async extendLocks(jobIds, tokens, duration) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.keys.stalled,
+            this.queue.toKey(''),
+            pack(tokens),
+            pack(jobIds),
+            duration,
+        ];
+        return this.execCommand(client, 'extendLocks', args);
+    }
+    async updateData(job, data) {
+        const client = await this.queue.client;
+        const keys = [this.queue.toKey(job.id)];
+        const dataJson = JSON.stringify(data);
+        const result = await this.execCommand(client, 'updateData', keys.concat([dataJson]));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId: job.id,
+                command: 'updateData',
+            });
+        }
+    }
+    async updateProgress(jobId, progress) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(jobId),
+            this.queue.keys.events,
+            this.queue.keys.meta,
+        ];
+        const progressJson = JSON.stringify(progress);
+        const result = await this.execCommand(client, 'updateProgress', keys.concat([jobId, progressJson]));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'updateProgress',
+            });
+        }
+    }
+    async addLog(jobId, logRow, keepLogs) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(jobId),
+            this.queue.toKey(jobId) + ':logs',
+        ];
+        const result = await this.execCommand(client, 'addLog', keys.concat([jobId, logRow, keepLogs ? keepLogs : '']));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'addLog',
+            });
+        }
+        return result;
+    }
+    moveToFinishedArgs(job, val, propVal, shouldRemove, target, token, timestamp, fetchNext = true, fieldsToUpdate) {
+        var _a, _b, _c, _d, _e, _f, _g;
+        const queueKeys = this.queue.keys;
+        const opts = this.queue.opts;
+        const workerKeepJobs = target === 'completed' ? opts.removeOnComplete : opts.removeOnFail;
+        const metricsKey = this.queue.toKey(`metrics:${target}`);
+        const keys = this.moveToFinishedKeys;
+        keys[10] = queueKeys[target];
+        keys[11] = this.queue.toKey((_a = job.id) !== null && _a !== void 0 ? _a : '');
+        keys[12] = metricsKey;
+        keys[13] = this.queue.keys.marker;
+        const keepJobs = this.getKeepJobs(shouldRemove, workerKeepJobs);
+        const args = [
+            job.id,
+            timestamp,
+            propVal,
+            typeof val === 'undefined' ? 'null' : val,
+            target,
+            !fetchNext || this.queue.closing ? 0 : 1,
+            queueKeys[''],
+            pack({
+                token,
+                name: opts.name,
+                keepJobs,
+                limiter: opts.limiter,
+                lockDuration: opts.lockDuration,
+                attempts: job.opts.attempts,
+                maxMetricsSize: ((_b = opts.metrics) === null || _b === void 0 ? void 0 : _b.maxDataPoints)
+                    ? (_c = opts.metrics) === null || _c === void 0 ? void 0 : _c.maxDataPoints
+                    : '',
+                fpof: !!((_d = job.opts) === null || _d === void 0 ? void 0 : _d.failParentOnFailure),
+                cpof: !!((_e = job.opts) === null || _e === void 0 ? void 0 : _e.continueParentOnFailure),
+                idof: !!((_f = job.opts) === null || _f === void 0 ? void 0 : _f.ignoreDependencyOnFailure),
+                rdof: !!((_g = job.opts) === null || _g === void 0 ? void 0 : _g.removeDependencyOnFailure),
+            }),
+            fieldsToUpdate ? pack(objectToFlatArray(fieldsToUpdate)) : void 0,
+        ];
+        return keys.concat(args);
+    }
+    getKeepJobs(shouldRemove, workerKeepJobs) {
+        if (typeof shouldRemove === 'undefined') {
+            return workerKeepJobs || { count: shouldRemove ? 0 : -1 };
+        }
+        return typeof shouldRemove === 'object'
+            ? shouldRemove
+            : typeof shouldRemove === 'number'
+                ? { count: shouldRemove }
+                : { count: shouldRemove ? 0 : -1 };
+    }
+    async moveToFinished(jobId, args) {
+        const client = await this.queue.client;
+        const result = await this.execCommand(client, 'moveToFinished', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveToFinished',
+                state: 'active',
+            });
+        }
+        else {
+            if (typeof result !== 'undefined') {
+                return raw2NextJobData(result);
+            }
+        }
+    }
+    drainArgs(delayed) {
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.paused,
+            queueKeys.delayed,
+            queueKeys.prioritized,
+            queueKeys.repeat,
+        ];
+        const args = [queueKeys[''], delayed ? '1' : '0'];
+        return keys.concat(args);
+    }
+    async drain(delayed) {
+        const client = await this.queue.client;
+        const args = this.drainArgs(delayed);
+        return this.execCommand(client, 'drain', args);
+    }
+    removeChildDependencyArgs(jobId, parentKey) {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys['']];
+        const args = [this.queue.toKey(jobId), parentKey];
+        return keys.concat(args);
+    }
+    async removeChildDependency(jobId, parentKey) {
+        const client = await this.queue.client;
+        const args = this.removeChildDependencyArgs(jobId, parentKey);
+        const result = await this.execCommand(client, 'removeChildDependency', args);
+        switch (result) {
+            case 0:
+                return true;
+            case 1:
+                return false;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId,
+                    parentKey,
+                    command: 'removeChildDependency',
+                });
+        }
+    }
+    getRangesArgs(types, start, end, asc) {
+        const queueKeys = this.queue.keys;
+        const transformedTypes = types.map(type => {
+            return type === 'waiting' ? 'wait' : type;
+        });
+        const keys = [queueKeys['']];
+        const args = [start, end, asc ? '1' : '0', ...transformedTypes];
+        return keys.concat(args);
+    }
+    async getRanges(types, start = 0, end = 1, asc = false) {
+        const client = await this.queue.client;
+        const args = this.getRangesArgs(types, start, end, asc);
+        return await this.execCommand(client, 'getRanges', args);
+    }
+    getCountsArgs(types) {
+        const queueKeys = this.queue.keys;
+        const transformedTypes = types.map(type => {
+            return type === 'waiting' ? 'wait' : type;
+        });
+        const keys = [queueKeys['']];
+        const args = [...transformedTypes];
+        return keys.concat(args);
+    }
+    async getCounts(types) {
+        const client = await this.queue.client;
+        const args = this.getCountsArgs(types);
+        return await this.execCommand(client, 'getCounts', args);
+    }
+    getCountsPerPriorityArgs(priorities) {
+        const keys = [
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+        ];
+        const args = priorities;
+        return keys.concat(args);
+    }
+    async getCountsPerPriority(priorities) {
+        const client = await this.queue.client;
+        const args = this.getCountsPerPriorityArgs(priorities);
+        return await this.execCommand(client, 'getCountsPerPriority', args);
+    }
+    getDependencyCountsArgs(jobId, types) {
+        const keys = [
+            `${jobId}:processed`,
+            `${jobId}:dependencies`,
+            `${jobId}:failed`,
+            `${jobId}:unsuccessful`,
+        ].map(name => {
+            return this.queue.toKey(name);
+        });
+        const args = types;
+        return keys.concat(args);
+    }
+    async getDependencyCounts(jobId, types) {
+        const client = await this.queue.client;
+        const args = this.getDependencyCountsArgs(jobId, types);
+        return await this.execCommand(client, 'getDependencyCounts', args);
+    }
+    moveToCompletedArgs(job, returnvalue, removeOnComplete, token, fetchNext = false) {
+        const timestamp = Date.now();
+        return this.moveToFinishedArgs(job, returnvalue, 'returnvalue', removeOnComplete, 'completed', token, timestamp, fetchNext);
+    }
+    moveToFailedArgs(job, failedReason, removeOnFailed, token, fetchNext = false, fieldsToUpdate) {
+        const timestamp = Date.now();
+        return this.moveToFinishedArgs(job, failedReason, 'failedReason', removeOnFailed, 'failed', token, timestamp, fetchNext, fieldsToUpdate);
+    }
+    async isFinished(jobId, returnValue = false) {
+        const client = await this.queue.client;
+        const keys = ['completed', 'failed', jobId].map((key) => {
+            return this.queue.toKey(key);
+        });
+        return this.execCommand(client, 'isFinished', keys.concat([jobId, returnValue ? '1' : '']));
+    }
+    async getState(jobId) {
+        const client = await this.queue.client;
+        const keys = [
+            'completed',
+            'failed',
+            'delayed',
+            'active',
+            'wait',
+            'paused',
+            'waiting-children',
+            'prioritized',
+        ].map((key) => {
+            return this.queue.toKey(key);
+        });
+        if (isRedisVersionLowerThan(this.queue.redisVersion, '6.0.6', this.queue.databaseType)) {
+            return this.execCommand(client, 'getState', keys.concat([jobId]));
+        }
+        return this.execCommand(client, 'getStateV2', keys.concat([jobId]));
+    }
+    /**
+     * Change delay of a delayed job.
+     *
+     * Reschedules a delayed job by setting a new delay from the current time.
+     * For example, calling changeDelay(5000) will reschedule the job to execute
+     * 5000 milliseconds (5 seconds) from now, regardless of the original delay.
+     *
+     * @param jobId - the ID of the job to change the delay for.
+     * @param delay - milliseconds from now when the job should be processed.
+     * @returns delay in milliseconds.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in delayed state.
+     */
+    async changeDelay(jobId, delay) {
+        const client = await this.queue.client;
+        const args = this.changeDelayArgs(jobId, delay);
+        const result = await this.execCommand(client, 'changeDelay', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'changeDelay',
+                state: 'delayed',
+            });
+        }
+    }
+    changeDelayArgs(jobId, delay) {
+        const timestamp = Date.now();
+        const keys = [
+            this.queue.keys.delayed,
+            this.queue.keys.meta,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        return keys.concat([
+            delay,
+            JSON.stringify(timestamp),
+            jobId,
+            this.queue.toKey(jobId),
+        ]);
+    }
+    async changePriority(jobId, priority = 0, lifo = false) {
+        const client = await this.queue.client;
+        const args = this.changePriorityArgs(jobId, priority, lifo);
+        const result = await this.execCommand(client, 'changePriority', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'changePriority',
+            });
+        }
+    }
+    changePriorityArgs(jobId, priority = 0, lifo = false) {
+        const keys = [
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+            this.queue.keys.active,
+            this.queue.keys.pc,
+            this.queue.keys.marker,
+        ];
+        return keys.concat([priority, this.queue.toKey(''), jobId, lifo ? 1 : 0]);
+    }
+    moveToDelayedArgs(jobId, timestamp, token, delay, opts = {}) {
+        const queueKeys = this.queue.keys;
+        const workerOpts = this.queue.opts;
+        const keys = [
+            queueKeys.marker,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.delayed,
+            this.queue.toKey(jobId),
+            queueKeys.events,
+            queueKeys.meta,
+            queueKeys.stalled,
+            queueKeys.wait,
+            queueKeys.limiter,
+            queueKeys.paused,
+            queueKeys.pc,
+        ];
+        const fetchNext = opts.fetchNext && !this.queue.closing ? 1 : 0;
+        return keys.concat([
+            this.queue.keys[''],
+            timestamp,
+            jobId,
+            token,
+            delay,
+            opts.skipAttempt ? '1' : '0',
+            opts.fieldsToUpdate
+                ? pack(objectToFlatArray(opts.fieldsToUpdate))
+                : void 0,
+            fetchNext,
+            fetchNext
+                ? pack({
+                    token,
+                    lockDuration: workerOpts.lockDuration,
+                    limiter: workerOpts.limiter,
+                    name: workerOpts.name,
+                })
+                : void 0,
+        ]);
+    }
+    moveToWaitingChildrenArgs(jobId, token, opts) {
+        const timestamp = Date.now();
+        const childKey = getParentKey(opts.child);
+        const keys = [
+            'active',
+            'waiting-children',
+            jobId,
+            `${jobId}:dependencies`,
+            `${jobId}:unsuccessful`,
+            'stalled',
+            'events',
+        ].map(name => {
+            return this.queue.toKey(name);
+        });
+        return keys.concat([
+            token,
+            childKey !== null && childKey !== void 0 ? childKey : '',
+            JSON.stringify(timestamp),
+            jobId,
+            this.queue.toKey(''),
+        ]);
+    }
+    isMaxedArgs() {
+        const queueKeys = this.queue.keys;
+        const keys = [queueKeys.meta, queueKeys.active];
+        return keys;
+    }
+    async isMaxed() {
+        const client = await this.queue.client;
+        const args = this.isMaxedArgs();
+        return !!(await this.execCommand(client, 'isMaxed', args));
+    }
+    async moveToDelayed(jobId, timestamp, delay, token = '0', opts = {}) {
+        const client = await this.queue.client;
+        const args = this.moveToDelayedArgs(jobId, timestamp, token, delay, opts);
+        const result = await this.execCommand(client, 'moveToDelayed', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveToDelayed',
+                state: 'active',
+            });
+        }
+        else if (typeof result !== 'undefined') {
+            return raw2NextJobData(result);
+        }
+    }
+    /**
+     * Move parent job to waiting-children state.
+     *
+     * @returns true if job is successfully moved, false if there are pending dependencies.
+     * @throws JobNotExist
+     * This exception is thrown if jobId is missing.
+     * @throws JobLockNotExist
+     * This exception is thrown if job lock is missing.
+     * @throws JobNotInState
+     * This exception is thrown if job is not in active state.
+     */
+    async moveToWaitingChildren(jobId, token, opts = {}) {
+        const client = await this.queue.client;
+        const args = this.moveToWaitingChildrenArgs(jobId, token, opts);
+        const result = await this.execCommand(client, 'moveToWaitingChildren', args);
+        switch (result) {
+            case 0:
+                return true;
+            case 1:
+                return false;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId,
+                    command: 'moveToWaitingChildren',
+                    state: 'active',
+                });
+        }
+    }
+    getRateLimitTtlArgs(maxJobs) {
+        const keys = [
+            this.queue.keys.limiter,
+            this.queue.keys.meta,
+        ];
+        return keys.concat([maxJobs !== null && maxJobs !== void 0 ? maxJobs : '0']);
+    }
+    async getRateLimitTtl(maxJobs) {
+        const client = await this.queue.client;
+        const args = this.getRateLimitTtlArgs(maxJobs);
+        return this.execCommand(client, 'getRateLimitTtl', args);
+    }
+    /**
+     * Remove jobs in a specific state.
+     *
+     * @returns Id jobs from the deleted records.
+     */
+    async cleanJobsInSet(set, timestamp, limit = 0) {
+        const client = await this.queue.client;
+        return this.execCommand(client, 'cleanJobsInSet', [
+            this.queue.toKey(set),
+            this.queue.toKey('events'),
+            this.queue.toKey('repeat'),
+            this.queue.toKey(''),
+            timestamp,
+            limit,
+            set,
+        ]);
+    }
+    getJobSchedulerArgs(id) {
+        const keys = [this.queue.keys.repeat];
+        return keys.concat([id]);
+    }
+    async getJobScheduler(id) {
+        const client = await this.queue.client;
+        const args = this.getJobSchedulerArgs(id);
+        return this.execCommand(client, 'getJobScheduler', args);
+    }
+    retryJobArgs(jobId, lifo, token, opts = {}) {
+        const keys = [
+            this.queue.keys.active,
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.toKey(jobId),
+            this.queue.keys.meta,
+            this.queue.keys.events,
+            this.queue.keys.delayed,
+            this.queue.keys.prioritized,
+            this.queue.keys.pc,
+            this.queue.keys.marker,
+            this.queue.keys.stalled,
+        ];
+        const pushCmd = (lifo ? 'R' : 'L') + 'PUSH';
+        return keys.concat([
+            this.queue.toKey(''),
+            Date.now(),
+            pushCmd,
+            jobId,
+            token,
+            opts.fieldsToUpdate
+                ? pack(objectToFlatArray(opts.fieldsToUpdate))
+                : void 0,
+        ]);
+    }
+    async retryJob(jobId, lifo, token = '0', opts = {}) {
+        const client = await this.queue.client;
+        const args = this.retryJobArgs(jobId, lifo, token, opts);
+        const result = await this.execCommand(client, 'retryJob', args);
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'retryJob',
+                state: 'active',
+            });
+        }
+    }
+    moveJobsToWaitArgs(state, count, timestamp) {
+        const keys = [
+            this.queue.toKey(''),
+            this.queue.keys.events,
+            this.queue.toKey(state),
+            this.queue.toKey('wait'),
+            this.queue.toKey('paused'),
+            this.queue.keys.meta,
+            this.queue.keys.active,
+            this.queue.keys.marker,
+        ];
+        const args = [count, timestamp, state];
+        return keys.concat(args);
+    }
+    async retryJobs(state = 'failed', count = 1000, timestamp = new Date().getTime()) {
+        const client = await this.queue.client;
+        const args = this.moveJobsToWaitArgs(state, count, timestamp);
+        return this.execCommand(client, 'moveJobsToWait', args);
+    }
+    async promoteJobs(count = 1000) {
+        const client = await this.queue.client;
+        const args = this.moveJobsToWaitArgs('delayed', count, Number.MAX_VALUE);
+        return this.execCommand(client, 'moveJobsToWait', args);
+    }
+    /**
+     * Attempts to reprocess a job
+     *
+     * @param job - The job to reprocess
+     * @param state - The expected job state. If the job is not found
+     * on the provided state, then it's not reprocessed. Supported states: 'failed', 'completed'
+     *
+     * @returns A promise that resolves when the job has been successfully moved to the wait queue.
+     * @throws Will throw an error with a code property indicating the failure reason:
+     *   - code 0: Job does not exist
+     *   - code -1: Job is currently locked and can't be retried
+     *   - code -2: Job was not found in the expected set
+     */
+    async reprocessJob(job, state, opts = {}) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(job.id),
+            this.queue.keys.events,
+            this.queue.toKey(state),
+            this.queue.keys.wait,
+            this.queue.keys.meta,
+            this.queue.keys.paused,
+            this.queue.keys.active,
+            this.queue.keys.marker,
+        ];
+        const args = [
+            job.id,
+            (job.opts.lifo ? 'R' : 'L') + 'PUSH',
+            state === 'failed' ? 'failedReason' : 'returnvalue',
+            state,
+            opts.resetAttemptsMade ? '1' : '0',
+            opts.resetAttemptsStarted ? '1' : '0',
+        ];
+        const result = await this.execCommand(client, 'reprocessJob', keys.concat(args));
+        switch (result) {
+            case 1:
+                return;
+            default:
+                throw this.finishedErrors({
+                    code: result,
+                    jobId: job.id,
+                    command: 'reprocessJob',
+                    state,
+                });
+        }
+    }
+    async getMetrics(type, start = 0, end = -1) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.toKey(`metrics:${type}`),
+            this.queue.toKey(`metrics:${type}:data`),
+        ];
+        const args = [start, end];
+        const result = await this.execCommand(client, 'getMetrics', keys.concat(args));
+        return result;
+    }
+    async moveToActive(client, token, name) {
+        const opts = this.queue.opts;
+        const queueKeys = this.queue.keys;
+        const keys = [
+            queueKeys.wait,
+            queueKeys.active,
+            queueKeys.prioritized,
+            queueKeys.events,
+            queueKeys.stalled,
+            queueKeys.limiter,
+            queueKeys.delayed,
+            queueKeys.paused,
+            queueKeys.meta,
+            queueKeys.pc,
+            queueKeys.marker,
+        ];
+        const args = [
+            queueKeys[''],
+            Date.now(),
+            pack({
+                token,
+                lockDuration: opts.lockDuration,
+                limiter: opts.limiter,
+                name,
+            }),
+        ];
+        const result = await this.execCommand(client, 'moveToActive', keys.concat(args));
+        return raw2NextJobData(result);
+    }
+    async promote(jobId) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.delayed,
+            this.queue.keys.wait,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.prioritized,
+            this.queue.keys.active,
+            this.queue.keys.pc,
+            this.queue.keys.events,
+            this.queue.keys.marker,
+        ];
+        const args = [this.queue.toKey(''), jobId];
+        const code = await this.execCommand(client, 'promote', keys.concat(args));
+        if (code < 0) {
+            throw this.finishedErrors({
+                code,
+                jobId,
+                command: 'promote',
+                state: 'delayed',
+            });
+        }
+    }
+    moveStalledJobsToWaitArgs() {
+        const opts = this.queue.opts;
+        const keys = [
+            this.queue.keys.stalled,
+            this.queue.keys.wait,
+            this.queue.keys.active,
+            this.queue.keys['stalled-check'],
+            this.queue.keys.meta,
+            this.queue.keys.paused,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        const args = [
+            opts.maxStalledCount,
+            this.queue.toKey(''),
+            Date.now(),
+            opts.stalledInterval,
+        ];
+        return keys.concat(args);
+    }
+    /**
+     * Looks for unlocked jobs in the active queue.
+     *
+     * The job was being worked on, but the worker process died and it failed to renew the lock.
+     * We call these jobs 'stalled'. This is the most common case. We resolve these by moving them
+     * back to wait to be re-processed. To prevent jobs from cycling endlessly between active and wait,
+     * (e.g. if the job handler keeps crashing),
+     * we limit the number stalled job recoveries to settings.maxStalledCount.
+     */
+    async moveStalledJobsToWait() {
+        const client = await this.queue.client;
+        const args = this.moveStalledJobsToWaitArgs();
+        return this.execCommand(client, 'moveStalledJobsToWait', args);
+    }
+    /**
+     * Moves a job back from Active to Wait.
+     * This script is used when a job has been manually rate limited and needs
+     * to be moved back to wait from active status.
+     *
+     * @param client - Redis client
+     * @param jobId - Job id
+     * @returns
+     */
+    async moveJobFromActiveToWait(jobId, token = '0') {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.active,
+            this.queue.keys.wait,
+            this.queue.keys.stalled,
+            this.queue.keys.paused,
+            this.queue.keys.meta,
+            this.queue.keys.limiter,
+            this.queue.keys.prioritized,
+            this.queue.keys.marker,
+            this.queue.keys.events,
+        ];
+        const args = [jobId, token, this.queue.toKey(jobId)];
+        const result = await this.execCommand(client, 'moveJobFromActiveToWait', keys.concat(args));
+        if (result < 0) {
+            throw this.finishedErrors({
+                code: result,
+                jobId,
+                command: 'moveJobFromActiveToWait',
+                state: 'active',
+            });
+        }
+        return result;
+    }
+    async obliterate(opts) {
+        const client = await this.queue.client;
+        const keys = [
+            this.queue.keys.meta,
+            this.queue.toKey(''),
+        ];
+        const args = [opts.count, opts.force ? 'force' : null];
+        const result = await this.execCommand(client, 'obliterate', keys.concat(args));
+        if (result < 0) {
+            switch (result) {
+                case -1:
+                    throw new Error('Cannot obliterate non-paused queue');
+                case -2:
+                    throw new Error('Cannot obliterate queue with active jobs');
+            }
+        }
+        return result;
+    }
+    /**
+     * Paginate a set or hash keys.
+     * @param opts - options to define the pagination behaviour
+     *
+     */
+    async paginate(key, opts) {
+        const client = await this.queue.client;
+        const keys = [key];
+        const maxIterations = 5;
+        const pageSize = opts.end >= 0 ? opts.end - opts.start + 1 : Infinity;
+        let cursor = '0', offset = 0, items, total, rawJobs, page = [], jobs = [];
+        do {
+            const args = [
+                opts.start + page.length,
+                opts.end,
+                cursor,
+                offset,
+                maxIterations,
+            ];
+            if (opts.fetchJobs) {
+                args.push(1);
+            }
+            [cursor, offset, items, total, rawJobs] = await this.execCommand(client, 'paginate', keys.concat(args));
+            page = page.concat(items);
+            if (rawJobs && rawJobs.length) {
+                jobs = jobs.concat(rawJobs.map(array2obj));
+            }
+            // Important to keep this coercive inequality (!=) instead of strict inequality (!==)
+        } while (cursor != '0' && page.length < pageSize);
+        // If we get an array of arrays, it means we are paginating a hash
+        if (page.length && Array.isArray(page[0])) {
+            const result = [];
+            for (let index = 0; index < page.length; index++) {
+                const [id, value] = page[index];
+                try {
+                    result.push({ id, v: JSON.parse(value) });
+                }
+                catch (err) {
+                    result.push({ id, err: err.message });
+                }
+            }
+            return {
+                cursor,
+                items: result,
+                total,
+                jobs,
+            };
+        }
+        else {
+            return {
+                cursor,
+                items: page.map(item => ({ id: item })),
+                total,
+                jobs,
+            };
+        }
+    }
+    finishedErrors({ code, jobId, parentKey, command, state, }) {
+        let error;
+        switch (code) {
+            case ErrorCode.JobNotExist:
+                error = new Error(`Missing key for job ${jobId}. ${command}`);
+                break;
+            case ErrorCode.JobLockNotExist:
+                error = new Error(`Missing lock for job ${jobId}. ${command}`);
+                break;
+            case ErrorCode.JobNotInState:
+                error = new Error(`Job ${jobId} is not in the ${state} state. ${command}`);
+                break;
+            case ErrorCode.JobPendingChildren:
+                error = new Error(`Job ${jobId} has pending dependencies. ${command}`);
+                break;
+            case ErrorCode.ParentJobNotExist:
+                error = new Error(`Missing key for parent job ${parentKey}. ${command}`);
+                break;
+            case ErrorCode.JobLockMismatch:
+                error = new Error(`Lock mismatch for job ${jobId}. Cmd ${command} from ${state}`);
+                break;
+            case ErrorCode.ParentJobCannotBeReplaced:
+                error = new Error(`The parent job ${parentKey} cannot be replaced. ${command}`);
+                break;
+            case ErrorCode.JobBelongsToJobScheduler:
+                error = new Error(`Job ${jobId} belongs to a job scheduler and cannot be removed directly. ${command}`);
+                break;
+            case ErrorCode.JobHasFailedChildren:
+                error = new UnrecoverableError(`Cannot complete job ${jobId} because it has at least one failed child. ${command}`);
+                break;
+            case ErrorCode.SchedulerJobIdCollision:
+                error = new Error(`Cannot create job scheduler iteration - job ID already exists. ${command}`);
+                break;
+            case ErrorCode.SchedulerJobSlotsBusy:
+                error = new Error(`Cannot create job scheduler iteration - current and next time slots already have jobs. ${command}`);
+                break;
+            default:
+                error = new Error(`Unknown code ${code} error for ${jobId}. ${command}`);
+        }
+        // Add the code property to the error object
+        error.code = code;
+        return error;
+    }
+    async removeOrphanedJobs(candidateJobIds, stateKeySuffixes, jobSubKeySuffixes) {
+        const client = await this.queue.client;
+        const args = [
+            this.queue.toKey(''),
+            stateKeySuffixes.length,
+            ...stateKeySuffixes,
+            jobSubKeySuffixes.length,
+            ...jobSubKeySuffixes,
+            ...candidateJobIds,
+        ];
+        return this.execCommand(client, 'removeOrphanedJobs', args);
+    }
+}
+export function raw2NextJobData(raw) {
+    if (raw) {
+        const result = [null, raw[1], raw[2], raw[3]];
+        if (raw[0]) {
+            result[0] = array2obj(raw[0]);
+        }
+        return result;
+    }
+    return [];
+}
diff --git a/node_modules/bullmq/dist/esm/classes/worker.d.ts b/node_modules/bullmq/dist/esm/classes/worker.d.ts
new file mode 100644
index 0000000..fa3d91f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/worker.d.ts
@@ -0,0 +1,287 @@
+import { URL } from 'url';
+import { AbortController } from './abort-controller';
+import { GetNextJobOptions, IoredisListener, JobJsonRaw, RedisClient, Span, WorkerOptions } from '../interfaces';
+import { JobProgress } from '../types';
+import { Processor } from '../types/processor';
+import { QueueBase } from './queue-base';
+import { Repeat } from './repeat';
+import { Job } from './job';
+import { RedisConnection } from './redis-connection';
+import { JobScheduler } from './job-scheduler';
+import { LockManager } from './lock-manager';
+export interface WorkerListener<DataType = any, ResultType = any, NameType extends string = string> extends IoredisListener {
+    /**
+     * Listen to 'active' event.
+     *
+     * This event is triggered when a job enters the 'active' state.
+     */
+    active: (job: Job<DataType, ResultType, NameType>, prev: string) => void;
+    /**
+     * Listen to 'closed' event.
+     *
+     * This event is triggered when the worker is closed.
+     */
+    closed: () => void;
+    /**
+     * Listen to 'closing' event.
+     *
+     * This event is triggered when the worker is closing.
+     */
+    closing: (msg: string) => void;
+    /**
+     * Listen to 'completed' event.
+     *
+     * This event is triggered when a job has successfully completed.
+     */
+    completed: (job: Job<DataType, ResultType, NameType>, result: ResultType, prev: string) => void;
+    /**
+     * Listen to 'drained' event.
+     *
+     * This event is triggered when the queue has drained the waiting list.
+     * Note that there could still be delayed jobs waiting their timers to expire
+     * and this event will still be triggered as long as the waiting list has emptied.
+     */
+    drained: () => void;
+    /**
+     * Listen to 'error' event.
+     *
+     * This event is triggered when an error is throw.
+     */
+    error: (failedReason: Error) => void;
+    /**
+     * Listen to 'failed' event.
+     *
+     * This event is triggered when a job has thrown an exception.
+     * Note: job parameter could be received as undefined when an stalled job
+     * reaches the stalled limit and it is deleted by the removeOnFail option.
+     */
+    failed: (job: Job<DataType, ResultType, NameType> | undefined, error: Error, prev: string) => void;
+    /**
+     * Listen to 'paused' event.
+     *
+     * This event is triggered when the queue is paused.
+     */
+    paused: () => void;
+    /**
+     * Listen to 'progress' event.
+     *
+     * This event is triggered when a job updates it progress, i.e. the
+     * Job##updateProgress() method is called. This is useful to notify
+     * progress or any other data from within a processor to the rest of the
+     * world.
+     */
+    progress: (job: Job<DataType, ResultType, NameType>, progress: JobProgress) => void;
+    /**
+     * Listen to 'ready' event.
+     *
+     * This event is triggered when blockingConnection is ready.
+     */
+    ready: () => void;
+    /**
+     * Listen to 'resumed' event.
+     *
+     * This event is triggered when the queue is resumed.
+     */
+    resumed: () => void;
+    /**
+     * Listen to 'stalled' event.
+     *
+     * This event is triggered when a job has stalled and
+     * has been moved back to the wait list.
+     */
+    stalled: (jobId: string, prev: string) => void;
+    /**
+     * Listen to 'lockRenewalFailed' event.
+     *
+     * This event is triggered when lock renewal fails for one or more jobs.
+     */
+    lockRenewalFailed: (jobIds: string[]) => void;
+    /**
+     * Listen to 'locksRenewed' event.
+     *
+     * This event is triggered when locks are successfully renewed.
+     */
+    locksRenewed: (data: {
+        count: number;
+        jobIds: string[];
+    }) => void;
+}
+/**
+ *
+ * This class represents a worker that is able to process jobs from the queue.
+ * As soon as the class is instantiated and a connection to Redis is established
+ * it will start processing jobs.
+ *
+ */
+export declare class Worker<DataType = any, ResultType = any, NameType extends string = string> extends QueueBase {
+    readonly opts: WorkerOptions;
+    readonly id: string;
+    private abortDelayController;
+    private blockingConnection;
+    private blockUntil;
+    private _concurrency;
+    private childPool;
+    private drained;
+    private limitUntil;
+    protected lockManager: LockManager;
+    private processorAcceptsSignal;
+    private stalledCheckerRunning;
+    private stalledCheckStopper?;
+    private waiting;
+    private _repeat;
+    protected _jobScheduler: JobScheduler;
+    protected paused: boolean;
+    protected processFn: Processor<DataType, ResultType, NameType>;
+    protected running: boolean;
+    protected mainLoopRunning: Promise<void> | null;
+    static RateLimitError(): Error;
+    constructor(name: string, processor?: string | URL | null | Processor<DataType, ResultType, NameType>, opts?: WorkerOptions, Connection?: typeof RedisConnection);
+    /**
+     * Creates and configures the lock manager for processing jobs.
+     * This method can be overridden in subclasses to customize lock manager behavior.
+     */
+    protected createLockManager(): void;
+    /**
+     * Creates and configures the sandbox for processing jobs.
+     * This method can be overridden in subclasses to customize sandbox behavior.
+     *
+     * @param processor - The processor file path, URL, or function to be sandboxed
+     */
+    protected createSandbox(processor: string | URL | null | Processor<DataType, ResultType, NameType>): void;
+    /**
+     * Public accessor method for LockManager to extend locks.
+     * This delegates to the protected scripts object.
+     */
+    extendJobLocks(jobIds: string[], tokens: string[], duration: number): Promise<string[]>;
+    emit<U extends keyof WorkerListener<DataType, ResultType, NameType>>(event: U, ...args: Parameters<WorkerListener<DataType, ResultType, NameType>[U]>): boolean;
+    off<U extends keyof WorkerListener<DataType, ResultType, NameType>>(eventName: U, listener: WorkerListener<DataType, ResultType, NameType>[U]): this;
+    on<U extends keyof WorkerListener<DataType, ResultType, NameType>>(event: U, listener: WorkerListener<DataType, ResultType, NameType>[U]): this;
+    once<U extends keyof WorkerListener<DataType, ResultType, NameType>>(event: U, listener: WorkerListener<DataType, ResultType, NameType>[U]): this;
+    protected callProcessJob(job: Job<DataType, ResultType, NameType>, token: string, signal?: AbortSignal): Promise<ResultType>;
+    protected createJob(data: JobJsonRaw, jobId: string): Job<DataType, ResultType, NameType>;
+    /**
+     *
+     * Waits until the worker is ready to start processing jobs.
+     * In general only useful when writing tests.
+     *
+     */
+    waitUntilReady(): Promise<RedisClient>;
+    /**
+     * Cancels a specific job currently being processed by this worker.
+     * The job's processor function will receive an abort signal.
+     *
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId: string, reason?: string): boolean;
+    /**
+     * Cancels all jobs currently being processed by this worker.
+     * All active job processor functions will receive abort signals.
+     *
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason?: string): void;
+    set concurrency(concurrency: number);
+    get concurrency(): number;
+    get repeat(): Promise<Repeat>;
+    get jobScheduler(): Promise<JobScheduler>;
+    run(): Promise<void>;
+    private waitForRateLimit;
+    /**
+     * This is the main loop in BullMQ. Its goals are to fetch jobs from the queue
+     * as efficiently as possible, providing concurrency and minimal unnecessary calls
+     * to Redis.
+     */
+    private mainLoop;
+    /**
+     * Returns a promise that resolves to the next job in queue.
+     * @param token - worker token to be assigned to retrieved job
+     * @returns a Job or undefined if no job was available in the queue.
+     */
+    getNextJob(token: string, { block }?: GetNextJobOptions): Promise<Job<DataType, ResultType, NameType>>;
+    private _getNextJob;
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     * @deprecated This method is deprecated and will be removed in v6. Use queue.rateLimit method instead.
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    rateLimit(expireTimeMs: number): Promise<void>;
+    get minimumBlockTimeout(): number;
+    private isRateLimited;
+    protected moveToActive(client: RedisClient, token: string, name?: string): Promise<Job<DataType, ResultType, NameType>>;
+    private waitForJob;
+    protected getBlockTimeout(blockUntil: number): number;
+    protected getRateLimitDelay(delay: number): number;
+    /**
+     *
+     * This function is exposed only for testing purposes.
+     */
+    delay(milliseconds?: number, abortController?: AbortController): Promise<void>;
+    private updateDelays;
+    protected nextJobFromJobData(jobData?: JobJsonRaw, jobId?: string, token?: string): Promise<Job<DataType, ResultType, NameType>>;
+    processJob(job: Job<DataType, ResultType, NameType>, token: string, fetchNextCallback?: () => boolean): Promise<void | Job<DataType, ResultType, NameType>>;
+    private getUnrecoverableErrorMessage;
+    protected handleCompleted(result: ResultType, job: Job<DataType, ResultType, NameType>, token: string, fetchNextCallback?: () => boolean, span?: Span): Promise<Job<DataType, ResultType, NameType>>;
+    protected handleFailed(err: Error, job: Job<DataType, ResultType, NameType>, token: string, fetchNextCallback?: () => boolean, span?: Span): Promise<Job<DataType, ResultType, NameType>>;
+    /**
+     *
+     * Pauses the processing of this queue only for this worker.
+     */
+    pause(doNotWaitActive?: boolean): Promise<void>;
+    /**
+     *
+     * Resumes processing of this worker (if paused).
+     */
+    resume(): void;
+    /**
+     *
+     * Checks if worker is paused.
+     *
+     * @returns true if worker is paused, false otherwise.
+     */
+    isPaused(): boolean;
+    /**
+     *
+     * Checks if worker is currently running.
+     *
+     * @returns true if worker is running, false otherwise.
+     */
+    isRunning(): boolean;
+    /**
+     *
+     * Closes the worker and related redis connections.
+     *
+     * This method waits for current jobs to finalize before returning.
+     *
+     * @param force - Use force boolean parameter if you do not want to wait for
+     * current jobs to be processed. When using telemetry, be mindful that it can
+     * interfere with the proper closure of spans, potentially preventing them from being exported.
+     *
+     * @returns Promise that resolves when the worker has been closed.
+     */
+    close(force?: boolean): Promise<void>;
+    /**
+     *
+     * Manually starts the stalled checker.
+     * The check will run once as soon as this method is called, and
+     * then every opts.stalledInterval milliseconds until the worker is closed.
+     * Note: Normally you do not need to call this method, since the stalled checker
+     * is automatically started when the worker starts processing jobs after
+     * calling run. However if you want to process the jobs manually you need
+     * to call this method to start the stalled checker.
+     *
+     * @see {@link https://docs.bullmq.io/patterns/manually-fetching-jobs}
+     */
+    startStalledCheckTimer(): Promise<void>;
+    private stalledChecker;
+    /**
+     * Returns a promise that resolves when active jobs are cleared
+     *
+     * @returns
+     */
+    private whenCurrentJobsFinished;
+    private retryIfFailed;
+    private moveStalledJobsToWait;
+    private moveLimitedBackToWait;
+}
diff --git a/node_modules/bullmq/dist/esm/classes/worker.js b/node_modules/bullmq/dist/esm/classes/worker.js
new file mode 100644
index 0000000..b70e2db
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/classes/worker.js
@@ -0,0 +1,914 @@
+import * as fs from 'fs';
+import { URL } from 'url';
+import * as path from 'path';
+import { AbortController } from './abort-controller';
+import { delay, DELAY_TIME_1, isNotConnectionError, isRedisInstance, randomUUID, } from '../utils';
+import { QueueBase } from './queue-base';
+import { Repeat } from './repeat';
+import { ChildPool } from './child-pool';
+import { RedisConnection } from './redis-connection';
+import { createIORedisClient, isIRedisClient } from './ioredis-client';
+import sandbox from './sandbox';
+import { AsyncFifoQueue } from './async-fifo-queue';
+import { DelayedError, RateLimitError, RATE_LIMIT_ERROR, WaitingChildrenError, WaitingError, UnrecoverableError, } from './errors';
+import { SpanKind, TelemetryAttributes } from '../enums';
+import { JobScheduler } from './job-scheduler';
+import { LockManager } from './lock-manager';
+// 10 seconds is the maximum time a BZPOPMIN can block.
+const maximumBlockTimeout = 10;
+/**
+ *
+ * This class represents a worker that is able to process jobs from the queue.
+ * As soon as the class is instantiated and a connection to Redis is established
+ * it will start processing jobs.
+ *
+ */
+export class Worker extends QueueBase {
+    static RateLimitError() {
+        return new RateLimitError();
+    }
+    constructor(name, processor, opts, Connection) {
+        super(name, Object.assign(Object.assign({ drainDelay: 5, concurrency: 1, lockDuration: 30000, maximumRateLimitDelay: 30000, maxStalledCount: 1, stalledInterval: 30000, autorun: true, runRetryDelay: 15000 }, opts), { blockingConnection: true }), Connection);
+        this.abortDelayController = null;
+        this.blockUntil = 0;
+        this.drained = false;
+        this.limitUntil = 0;
+        this.processorAcceptsSignal = false;
+        this.stalledCheckerRunning = false;
+        this.waiting = null;
+        this.running = false;
+        this.mainLoopRunning = null;
+        if (!opts || !opts.connection) {
+            throw new Error('Worker requires a connection');
+        }
+        if (typeof this.opts.maxStalledCount !== 'number' ||
+            this.opts.maxStalledCount < 0) {
+            throw new Error('maxStalledCount must be greater or equal than 0');
+        }
+        if (typeof this.opts.maxStartedAttempts === 'number' &&
+            this.opts.maxStartedAttempts < 0) {
+            throw new Error('maxStartedAttempts must be greater or equal than 0');
+        }
+        if (typeof this.opts.stalledInterval !== 'number' ||
+            this.opts.stalledInterval <= 0) {
+            throw new Error('stalledInterval must be greater than 0');
+        }
+        if (typeof this.opts.drainDelay !== 'number' || this.opts.drainDelay <= 0) {
+            throw new Error('drainDelay must be greater than 0');
+        }
+        this.concurrency = this.opts.concurrency;
+        this.opts.lockRenewTime =
+            this.opts.lockRenewTime || this.opts.lockDuration / 2;
+        this.id = randomUUID();
+        this.createLockManager();
+        if (processor) {
+            if (typeof processor === 'function') {
+                this.processFn = processor;
+                // Check if processor accepts signal parameter (3rd parameter)
+                this.processorAcceptsSignal = processor.length >= 3;
+            }
+            else {
+                // SANDBOXED
+                if (processor instanceof URL) {
+                    if (!fs.existsSync(processor)) {
+                        throw new Error(`URL ${processor} does not exist in the local file system`);
+                    }
+                    processor = processor.href;
+                }
+                else {
+                    const supportedFileTypes = ['.js', '.ts', '.flow', '.cjs', '.mjs'];
+                    const processorFile = processor +
+                        (supportedFileTypes.includes(path.extname(processor)) ? '' : '.js');
+                    if (!fs.existsSync(processorFile)) {
+                        throw new Error(`File ${processorFile} does not exist`);
+                    }
+                }
+                // Separate paths so that bundling tools can resolve dependencies easier
+                const dirname = path.dirname(module.filename || __filename);
+                const workerThreadsMainFile = path.join(dirname, 'main-worker.js');
+                const spawnProcessMainFile = path.join(dirname, 'main.js');
+                let mainFilePath = this.opts.useWorkerThreads
+                    ? workerThreadsMainFile
+                    : spawnProcessMainFile;
+                try {
+                    fs.statSync(mainFilePath); // would throw if file not exists
+                }
+                catch (_) {
+                    const mainFile = this.opts.useWorkerThreads
+                        ? 'main-worker.js'
+                        : 'main.js';
+                    mainFilePath = path.join(process.cwd(), `dist/cjs/classes/${mainFile}`);
+                    fs.statSync(mainFilePath);
+                }
+                this.childPool = new ChildPool({
+                    mainFile: mainFilePath,
+                    useWorkerThreads: this.opts.useWorkerThreads,
+                    workerForkOptions: this.opts.workerForkOptions,
+                    workerThreadsOptions: this.opts.workerThreadsOptions,
+                });
+                this.createSandbox(processor);
+                this.processorAcceptsSignal = true;
+            }
+            if (this.opts.autorun) {
+                this.run().catch(error => this.emit('error', error));
+            }
+        }
+        const connectionName = this.clientName() + (this.opts.name ? `:w:${this.opts.name}` : '');
+        this.blockingConnection = new RedisConnection(isRedisInstance(opts.connection)
+            ? (isIRedisClient(opts.connection)
+                ? opts.connection
+                : createIORedisClient(opts.connection)).duplicate({ connectionName })
+            : Object.assign(Object.assign({}, opts.connection), { connectionName }), {
+            shared: false,
+            blocking: true,
+            skipVersionCheck: opts.skipVersionCheck,
+        });
+        this.blockingConnection.on('error', error => this.emit('error', error));
+        this.blockingConnection.on('ready', () => setTimeout(() => this.emit('ready'), 0));
+    }
+    /**
+     * Creates and configures the lock manager for processing jobs.
+     * This method can be overridden in subclasses to customize lock manager behavior.
+     */
+    createLockManager() {
+        this.lockManager = new LockManager(this, {
+            lockRenewTime: this.opts.lockRenewTime,
+            lockDuration: this.opts.lockDuration,
+            workerId: this.id,
+            workerName: this.opts.name,
+        });
+    }
+    /**
+     * Creates and configures the sandbox for processing jobs.
+     * This method can be overridden in subclasses to customize sandbox behavior.
+     *
+     * @param processor - The processor file path, URL, or function to be sandboxed
+     */
+    createSandbox(processor) {
+        this.processFn = sandbox(processor, this.childPool).bind(this);
+    }
+    /**
+     * Public accessor method for LockManager to extend locks.
+     * This delegates to the protected scripts object.
+     */
+    async extendJobLocks(jobIds, tokens, duration) {
+        return this.scripts.extendLocks(jobIds, tokens, duration);
+    }
+    emit(event, ...args) {
+        return super.emit(event, ...args);
+    }
+    off(eventName, listener) {
+        super.off(eventName, listener);
+        return this;
+    }
+    on(event, listener) {
+        super.on(event, listener);
+        return this;
+    }
+    once(event, listener) {
+        super.once(event, listener);
+        return this;
+    }
+    callProcessJob(job, token, signal) {
+        return this.processFn(job, token, signal);
+    }
+    createJob(data, jobId) {
+        return this.Job.fromJSON(this, data, jobId);
+    }
+    /**
+     *
+     * Waits until the worker is ready to start processing jobs.
+     * In general only useful when writing tests.
+     *
+     */
+    async waitUntilReady() {
+        await super.waitUntilReady();
+        return this.blockingConnection.client;
+    }
+    /**
+     * Cancels a specific job currently being processed by this worker.
+     * The job's processor function will receive an abort signal.
+     *
+     * @param jobId - The ID of the job to cancel
+     * @param reason - Optional reason for the cancellation
+     * @returns true if the job was found and cancelled, false otherwise
+     */
+    cancelJob(jobId, reason) {
+        return this.lockManager.cancelJob(jobId, reason);
+    }
+    /**
+     * Cancels all jobs currently being processed by this worker.
+     * All active job processor functions will receive abort signals.
+     *
+     * @param reason - Optional reason for the cancellation
+     */
+    cancelAllJobs(reason) {
+        this.lockManager.cancelAllJobs(reason);
+    }
+    set concurrency(concurrency) {
+        if (typeof concurrency !== 'number' ||
+            concurrency < 1 ||
+            !isFinite(concurrency)) {
+            throw new Error('concurrency must be a finite number greater than 0');
+        }
+        this._concurrency = concurrency;
+    }
+    get concurrency() {
+        return this._concurrency;
+    }
+    get repeat() {
+        return new Promise(async (resolve) => {
+            if (!this._repeat) {
+                const connection = await this.client;
+                this._repeat = new Repeat(this.name, Object.assign(Object.assign({}, this.opts), { connection }));
+                this._repeat.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._repeat);
+        });
+    }
+    get jobScheduler() {
+        return new Promise(async (resolve) => {
+            if (!this._jobScheduler) {
+                const connection = await this.client;
+                this._jobScheduler = new JobScheduler(this.name, Object.assign(Object.assign({}, this.opts), { connection }));
+                this._jobScheduler.on('error', this.emit.bind(this, 'error'));
+            }
+            resolve(this._jobScheduler);
+        });
+    }
+    async run() {
+        if (!this.processFn) {
+            throw new Error('No process function is defined.');
+        }
+        if (this.running) {
+            throw new Error('Worker is already running.');
+        }
+        try {
+            this.running = true;
+            if (this.closing || this.paused) {
+                return;
+            }
+            await this.startStalledCheckTimer();
+            if (!this.opts.skipLockRenewal) {
+                this.lockManager.start();
+            }
+            const client = await this.client;
+            const bclient = await this.blockingConnection.client;
+            this.mainLoopRunning = this.mainLoop(client, bclient);
+            // We must await here or finally will be called too early.
+            await this.mainLoopRunning;
+        }
+        finally {
+            this.running = false;
+        }
+    }
+    async waitForRateLimit() {
+        var _a;
+        const limitUntil = this.limitUntil;
+        if (limitUntil > Date.now()) {
+            (_a = this.abortDelayController) === null || _a === void 0 ? void 0 : _a.abort();
+            this.abortDelayController = new AbortController();
+            const delay = this.getRateLimitDelay(limitUntil - Date.now());
+            await this.delay(delay, this.abortDelayController);
+            this.drained = false;
+            this.limitUntil = 0;
+        }
+    }
+    /**
+     * This is the main loop in BullMQ. Its goals are to fetch jobs from the queue
+     * as efficiently as possible, providing concurrency and minimal unnecessary calls
+     * to Redis.
+     */
+    async mainLoop(client, bclient) {
+        const asyncFifoQueue = new AsyncFifoQueue();
+        let tokenPostfix = 0;
+        while ((!this.closing && !this.paused) || asyncFifoQueue.numTotal() > 0) {
+            /**
+             * This inner loop tries to fetch jobs concurrently, but if we are waiting for a job
+             * to arrive at the queue we should not try to fetch more jobs (as it would be pointless)
+             */
+            while (!this.closing &&
+                !this.paused &&
+                !this.waiting &&
+                asyncFifoQueue.numTotal() < this._concurrency &&
+                !this.isRateLimited()) {
+                const token = `${this.id}:${tokenPostfix++}`;
+                const fetchedJob = this.retryIfFailed(() => this._getNextJob(client, bclient, token, { block: true }), {
+                    delayInMs: this.opts.runRetryDelay,
+                    onlyEmitError: true,
+                });
+                asyncFifoQueue.add(fetchedJob);
+                if (this.waiting && asyncFifoQueue.numTotal() > 1) {
+                    // We are waiting for jobs but we have others that we could start processing already
+                    break;
+                }
+                // We await here so that we fetch jobs in sequence, this is important to avoid unnecessary calls
+                // to Redis in high concurrency scenarios.
+                const job = await fetchedJob;
+                // No more jobs waiting but we have others that could start processing already
+                if (!job && asyncFifoQueue.numTotal() > 1) {
+                    break;
+                }
+                // If there are potential jobs to be processed and blockUntil is set, we should exit to avoid waiting
+                // for processing this job.
+                if (this.blockUntil) {
+                    break;
+                }
+            }
+            // Since there can be undefined jobs in the queue (when a job fails or queue is empty)
+            // we iterate until we find a job.
+            let job;
+            do {
+                job = await asyncFifoQueue.fetch();
+            } while (!job && asyncFifoQueue.numQueued() > 0);
+            if (job) {
+                const token = job.token;
+                asyncFifoQueue.add(this.processJob(job, token, () => asyncFifoQueue.numTotal() <= this._concurrency));
+            }
+            else if (asyncFifoQueue.numQueued() === 0) {
+                await this.waitForRateLimit();
+            }
+        }
+    }
+    /**
+     * Returns a promise that resolves to the next job in queue.
+     * @param token - worker token to be assigned to retrieved job
+     * @returns a Job or undefined if no job was available in the queue.
+     */
+    async getNextJob(token, { block = true } = {}) {
+        var _a, _b;
+        const nextJob = await this._getNextJob(await this.client, await this.blockingConnection.client, token, { block });
+        return this.trace(SpanKind.INTERNAL, 'getNextJob', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.id,
+                [TelemetryAttributes.QueueName]: this.name,
+                [TelemetryAttributes.WorkerName]: this.opts.name,
+                [TelemetryAttributes.WorkerOptions]: JSON.stringify({ block }),
+                [TelemetryAttributes.JobId]: nextJob === null || nextJob === void 0 ? void 0 : nextJob.id,
+            });
+            return nextJob;
+        }, (_b = (_a = nextJob === null || nextJob === void 0 ? void 0 : nextJob.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.metadata);
+    }
+    async _getNextJob(client, bclient, token, { block = true } = {}) {
+        if (this.paused) {
+            return;
+        }
+        if (this.closing) {
+            return;
+        }
+        let job;
+        if (this.drained && block && !this.limitUntil && !this.waiting) {
+            this.waiting = this.waitForJob(bclient, this.blockUntil);
+            try {
+                this.blockUntil = await this.waiting;
+                if (this.blockUntil <= 0 || this.blockUntil - Date.now() < 1) {
+                    job = await this.moveToActive(client, token, this.opts.name);
+                }
+            }
+            finally {
+                this.waiting = null;
+            }
+        }
+        else {
+            if (!this.isRateLimited()) {
+                job = await this.moveToActive(client, token, this.opts.name);
+            }
+        }
+        if (job) {
+            this.emit('active', job, 'waiting');
+        }
+        return job;
+    }
+    /**
+     * Overrides the rate limit to be active for the next jobs.
+     * @deprecated This method is deprecated and will be removed in v6. Use queue.rateLimit method instead.
+     * @param expireTimeMs - expire time in ms of this rate limit.
+     */
+    async rateLimit(expireTimeMs) {
+        await this.trace(SpanKind.INTERNAL, 'rateLimit', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.id,
+                [TelemetryAttributes.WorkerRateLimit]: expireTimeMs,
+            });
+            await this.client.then(client => client.set(this.keys.limiter, Number.MAX_SAFE_INTEGER, {
+                PX: expireTimeMs,
+            }));
+        });
+    }
+    get minimumBlockTimeout() {
+        return this.blockingConnection.capabilities.canBlockFor1Ms
+            ? /* 1 millisecond is chosen because the granularity of our timestamps are milliseconds.
+      Obviously we can still process much faster than 1 job per millisecond but delays and rate limits
+      will never work with more accuracy than 1ms. */
+                0.001
+            : 0.002;
+    }
+    isRateLimited() {
+        return this.limitUntil > Date.now();
+    }
+    async moveToActive(client, token, name) {
+        const [jobData, id, rateLimitDelay, delayUntil] = await this.scripts.moveToActive(client, token, name);
+        this.updateDelays(rateLimitDelay, delayUntil);
+        return this.nextJobFromJobData(jobData, id, token);
+    }
+    async waitForJob(bclient, blockUntil) {
+        if (this.paused) {
+            return Infinity;
+        }
+        let timeout;
+        try {
+            if (!this.closing && !this.isRateLimited()) {
+                let blockTimeout = this.getBlockTimeout(blockUntil);
+                if (blockTimeout > 0) {
+                    blockTimeout = this.blockingConnection.capabilities.canDoubleTimeout
+                        ? blockTimeout
+                        : Math.ceil(blockTimeout);
+                    // We cannot trust that the blocking connection stays blocking forever
+                    // due to issues in Redis and IORedis, so we will reconnect if we
+                    // don't get a response in the expected time.
+                    timeout = setTimeout(async () => {
+                        bclient.disconnect(!this.closing);
+                    }, blockTimeout * 1000 + 1000);
+                    this.updateDelays(); // reset delays to avoid reusing same values in next iteration
+                    // Markers should only be used for un-blocking, so we will handle them in this
+                    // function only.
+                    const result = await bclient.bzpopmin(this.keys.marker, blockTimeout);
+                    if (result) {
+                        const [, member, score] = result;
+                        if (member) {
+                            const newBlockUntil = parseInt(score);
+                            // Use by pro version as rate limited groups could generate lower blockUntil values
+                            // markers only return delays for delayed jobs
+                            if (blockUntil && newBlockUntil > blockUntil) {
+                                return blockUntil;
+                            }
+                            return newBlockUntil;
+                        }
+                    }
+                }
+                return 0;
+            }
+        }
+        catch (error) {
+            if (isNotConnectionError(error)) {
+                this.emit('error', error);
+            }
+            if (!this.closing) {
+                await this.delay();
+            }
+        }
+        finally {
+            clearTimeout(timeout);
+        }
+        return Infinity;
+    }
+    getBlockTimeout(blockUntil) {
+        const opts = this.opts;
+        // when there are delayed jobs
+        if (blockUntil) {
+            const blockDelay = blockUntil - Date.now();
+            // when we reach the time to get new jobs
+            if (blockDelay <= 0) {
+                return blockDelay;
+            }
+            else if (blockDelay < this.minimumBlockTimeout * 1000) {
+                return this.minimumBlockTimeout;
+            }
+            else {
+                // We restrict the maximum block timeout to 10 second to avoid
+                // blocking the connection for too long in the case of reconnections
+                // reference: https://github.com/taskforcesh/bullmq/issues/1658
+                return Math.min(blockDelay / 1000, maximumBlockTimeout);
+            }
+        }
+        else {
+            return Math.max(opts.drainDelay, this.minimumBlockTimeout);
+        }
+    }
+    getRateLimitDelay(delay) {
+        // We restrict the maximum limit delay to the configured maximumRateLimitDelay
+        // to be able to promote delayed jobs while the queue is rate limited
+        return Math.min(delay, this.opts.maximumRateLimitDelay);
+    }
+    /**
+     *
+     * This function is exposed only for testing purposes.
+     */
+    async delay(milliseconds, abortController) {
+        await delay(milliseconds || DELAY_TIME_1, abortController);
+    }
+    updateDelays(limitDelay = 0, delayUntil = 0) {
+        const clampedLimit = Math.max(limitDelay, 0);
+        if (clampedLimit > 0) {
+            this.limitUntil = Date.now() + clampedLimit;
+        }
+        else {
+            this.limitUntil = 0;
+        }
+        this.blockUntil = Math.max(delayUntil, 0) || 0;
+    }
+    async nextJobFromJobData(jobData, jobId, token) {
+        if (!jobData) {
+            if (!this.drained) {
+                this.emit('drained');
+                this.drained = true;
+            }
+        }
+        else {
+            this.drained = false;
+            const job = this.createJob(jobData, jobId);
+            job.token = token;
+            try {
+                await this.retryIfFailed(async () => {
+                    // We need to distinguish between new job schedulers and legacy
+                    // repeatable jobs. Legacy repeatable keys always contain 5+
+                    // colon segments, but a user-provided jobSchedulerId may also
+                    // contain 5+ segments, so we cannot rely on the segment count
+                    // alone (see issue #3828). When the key has 5+ segments we
+                    // probe the per-id scheduler metadata hash (`repeat:<id>` with
+                    // the `ic` field) via `JobScheduler.isJobScheduler()` to confirm
+                    // it really is a scheduler before falling back to the legacy
+                    // repeatable path.
+                    const hasRepeatJobKey = !!job.repeatJobKey;
+                    const hasLegacyKeyShape = hasRepeatJobKey && job.repeatJobKey.split(':').length >= 5;
+                    let isJobScheduler = hasRepeatJobKey && !hasLegacyKeyShape;
+                    if (hasLegacyKeyShape) {
+                        const jobScheduler = await this.jobScheduler;
+                        isJobScheduler = await jobScheduler.isJobScheduler(job.repeatJobKey);
+                    }
+                    if (isJobScheduler) {
+                        const jobScheduler = await this.jobScheduler;
+                        await jobScheduler.upsertJobScheduler(
+                        // Most of these arguments are not really needed
+                        // anymore as we read them from the job scheduler itself
+                        job.repeatJobKey, job.opts.repeat, job.name, job.data, job.opts, { override: false, producerId: job.id });
+                    }
+                    else if (job.opts.repeat) {
+                        const repeat = await this.repeat;
+                        await repeat.updateRepeatableJob(job.name, job.data, job.opts, {
+                            override: false,
+                        });
+                    }
+                }, { delayInMs: this.opts.runRetryDelay });
+            }
+            catch (err) {
+                // Emit error but don't throw to avoid breaking current job completion
+                // Note: This means the next repeatable job will not be scheduled
+                const errorMessage = err instanceof Error ? err.message : String(err);
+                const schedulingError = new Error(`Failed to add repeatable job for next iteration: ${errorMessage}`);
+                this.emit('error', schedulingError);
+                // Return undefined to indicate no next job is available
+                return undefined;
+            }
+            return job;
+        }
+    }
+    async processJob(job, token, fetchNextCallback = () => true) {
+        var _a, _b;
+        const srcPropagationMetadata = (_b = (_a = job.opts) === null || _a === void 0 ? void 0 : _a.telemetry) === null || _b === void 0 ? void 0 : _b.metadata;
+        return this.trace(SpanKind.CONSUMER, 'process', this.name, async (span) => {
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.id,
+                [TelemetryAttributes.WorkerName]: this.opts.name,
+                [TelemetryAttributes.JobId]: job.id,
+                [TelemetryAttributes.JobName]: job.name,
+            });
+            const abortController = this.lockManager.trackJob(job.id, token, job.processedOn, this.processorAcceptsSignal);
+            try {
+                const unrecoverableErrorMessage = this.getUnrecoverableErrorMessage(job);
+                if (unrecoverableErrorMessage) {
+                    const failed = await this.retryIfFailed(() => {
+                        this.lockManager.untrackJob(job.id);
+                        return this.handleFailed(new UnrecoverableError(unrecoverableErrorMessage), job, token, fetchNextCallback, span);
+                    }, { delayInMs: this.opts.runRetryDelay, span });
+                    return failed;
+                }
+                const result = await this.callProcessJob(job, token, abortController
+                    ? abortController.signal
+                    : undefined);
+                return await this.retryIfFailed(() => {
+                    this.lockManager.untrackJob(job.id);
+                    return this.handleCompleted(result, job, token, fetchNextCallback, span);
+                }, { delayInMs: this.opts.runRetryDelay, span });
+            }
+            catch (err) {
+                const failed = await this.retryIfFailed(() => {
+                    this.lockManager.untrackJob(job.id);
+                    return this.handleFailed(err, job, token, fetchNextCallback, span);
+                }, { delayInMs: this.opts.runRetryDelay, span, onlyEmitError: true });
+                return failed;
+            }
+            finally {
+                this.lockManager.untrackJob(job.id);
+                const now = Date.now();
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [TelemetryAttributes.JobFinishedTimestamp]: now,
+                    [TelemetryAttributes.JobAttemptFinishedTimestamp]: job.finishedOn || now,
+                    [TelemetryAttributes.JobProcessedTimestamp]: job.processedOn,
+                });
+            }
+        }, srcPropagationMetadata);
+    }
+    getUnrecoverableErrorMessage(job) {
+        if (job.deferredFailure) {
+            return job.deferredFailure;
+        }
+        if (this.opts.maxStartedAttempts &&
+            this.opts.maxStartedAttempts < job.attemptsStarted) {
+            return 'job started more than allowable limit';
+        }
+    }
+    async handleCompleted(result, job, token, fetchNextCallback = () => true, span) {
+        if (!this.connection.closing) {
+            const completed = await job.moveToCompleted(result, token, fetchNextCallback() && !(this.closing || this.paused));
+            this.emit('completed', job, result, 'active');
+            span === null || span === void 0 ? void 0 : span.addEvent('job completed', {
+                [TelemetryAttributes.JobResult]: JSON.stringify(result),
+            });
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobAttemptsMade]: job.attemptsMade,
+            });
+            if (Array.isArray(completed)) {
+                const [jobData, jobId, rateLimitDelay, delayUntil] = completed;
+                this.updateDelays(rateLimitDelay, delayUntil);
+                return this.nextJobFromJobData(jobData, jobId, token);
+            }
+        }
+    }
+    async handleFailed(err, job, token, fetchNextCallback = () => true, span) {
+        if (!this.connection.closing) {
+            // Check if the job was manually rate-limited
+            if (err.message === RATE_LIMIT_ERROR) {
+                const rateLimitTtl = await this.moveLimitedBackToWait(job, token);
+                this.limitUntil = rateLimitTtl > 0 ? Date.now() + rateLimitTtl : 0;
+                return;
+            }
+            const fetchNext = fetchNextCallback() && !(this.closing || this.paused);
+            if (err instanceof DelayedError ||
+                err.name == 'DelayedError' ||
+                err instanceof WaitingError ||
+                err.name == 'WaitingError' ||
+                err instanceof WaitingChildrenError ||
+                err.name == 'WaitingChildrenError') {
+                if (!fetchNext) {
+                    return;
+                }
+                const client = await this.client;
+                return this.moveToActive(client, token, this.opts.name);
+            }
+            const result = await job.moveToFailed(err, token, fetchNext);
+            this.emit('failed', job, err, 'active');
+            span === null || span === void 0 ? void 0 : span.addEvent('job failed', {
+                [TelemetryAttributes.JobFailedReason]: err.message,
+            });
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.JobAttemptsMade]: job.attemptsMade,
+            });
+            // Note: result can be undefined if moveToFailed fails (e.g., lock was lost)
+            if (Array.isArray(result)) {
+                const [jobData, jobId, rateLimitDelay, delayUntil] = result;
+                this.updateDelays(rateLimitDelay, delayUntil);
+                return this.nextJobFromJobData(jobData, jobId, token);
+            }
+        }
+    }
+    /**
+     *
+     * Pauses the processing of this queue only for this worker.
+     */
+    async pause(doNotWaitActive) {
+        await this.trace(SpanKind.INTERNAL, 'pause', this.name, async (span) => {
+            var _a;
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.id,
+                [TelemetryAttributes.WorkerName]: this.opts.name,
+                [TelemetryAttributes.WorkerDoNotWaitActive]: doNotWaitActive,
+            });
+            if (!this.paused) {
+                this.paused = true;
+                if (!doNotWaitActive) {
+                    await this.whenCurrentJobsFinished();
+                }
+                (_a = this.stalledCheckStopper) === null || _a === void 0 ? void 0 : _a.call(this);
+                this.emit('paused');
+            }
+        });
+    }
+    /**
+     *
+     * Resumes processing of this worker (if paused).
+     */
+    resume() {
+        if (!this.running || this.paused) {
+            this.trace(SpanKind.INTERNAL, 'resume', this.name, span => {
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [TelemetryAttributes.WorkerId]: this.id,
+                    [TelemetryAttributes.WorkerName]: this.opts.name,
+                });
+                this.paused = false;
+                if (!this.running) {
+                    if (this.processFn) {
+                        this.run();
+                    }
+                }
+                else {
+                    // TODO: await for startStalledCheckTimer in next breaking change, that will convert resume method to async
+                    // Main loop is still running (pause was called with doNotWaitActive=true).
+                    // Restart the stalled checker since pause() stopped it.
+                    void this.startStalledCheckTimer().catch(err => {
+                        this.emit('error', err);
+                    });
+                }
+                this.emit('resumed');
+            }).catch(err => {
+                this.emit('error', err);
+            });
+        }
+    }
+    /**
+     *
+     * Checks if worker is paused.
+     *
+     * @returns true if worker is paused, false otherwise.
+     */
+    isPaused() {
+        return !!this.paused;
+    }
+    /**
+     *
+     * Checks if worker is currently running.
+     *
+     * @returns true if worker is running, false otherwise.
+     */
+    isRunning() {
+        return this.running;
+    }
+    /**
+     *
+     * Closes the worker and related redis connections.
+     *
+     * This method waits for current jobs to finalize before returning.
+     *
+     * @param force - Use force boolean parameter if you do not want to wait for
+     * current jobs to be processed. When using telemetry, be mindful that it can
+     * interfere with the proper closure of spans, potentially preventing them from being exported.
+     *
+     * @returns Promise that resolves when the worker has been closed.
+     */
+    async close(force = false) {
+        if (this.closing) {
+            return this.closing;
+        }
+        this.closing = (async () => {
+            await this.trace(SpanKind.INTERNAL, 'close', this.name, async (span) => {
+                var _a, _b;
+                span === null || span === void 0 ? void 0 : span.setAttributes({
+                    [TelemetryAttributes.WorkerId]: this.id,
+                    [TelemetryAttributes.WorkerName]: this.opts.name,
+                    [TelemetryAttributes.WorkerForceClose]: force,
+                });
+                this.emit('closing', 'closing queue');
+                (_a = this.abortDelayController) === null || _a === void 0 ? void 0 : _a.abort();
+                // Define the async cleanup functions
+                const asyncCleanups = [
+                    () => {
+                        return force || this.whenCurrentJobsFinished(false);
+                    },
+                    () => this.lockManager.close(),
+                    () => { var _a; return (_a = this.childPool) === null || _a === void 0 ? void 0 : _a.clean(); },
+                    () => this.blockingConnection.close(force),
+                    () => this.connection.close(force),
+                ];
+                // Run cleanup functions sequentially and make sure all are run despite any errors
+                for (const cleanup of asyncCleanups) {
+                    try {
+                        await cleanup();
+                    }
+                    catch (err) {
+                        this.emit('error', err);
+                    }
+                }
+                (_b = this.stalledCheckStopper) === null || _b === void 0 ? void 0 : _b.call(this);
+                this.closed = true;
+                this.emit('closed');
+            });
+        })();
+        return await this.closing;
+    }
+    /**
+     *
+     * Manually starts the stalled checker.
+     * The check will run once as soon as this method is called, and
+     * then every opts.stalledInterval milliseconds until the worker is closed.
+     * Note: Normally you do not need to call this method, since the stalled checker
+     * is automatically started when the worker starts processing jobs after
+     * calling run. However if you want to process the jobs manually you need
+     * to call this method to start the stalled checker.
+     *
+     * @see {@link https://docs.bullmq.io/patterns/manually-fetching-jobs}
+     */
+    async startStalledCheckTimer() {
+        if (!this.opts.skipStalledCheck) {
+            if (!this.closing && !this.stalledCheckerRunning) {
+                await this.trace(SpanKind.INTERNAL, 'startStalledCheckTimer', this.name, async (span) => {
+                    span === null || span === void 0 ? void 0 : span.setAttributes({
+                        [TelemetryAttributes.WorkerId]: this.id,
+                        [TelemetryAttributes.WorkerName]: this.opts.name,
+                    });
+                    this.stalledCheckerRunning = true;
+                    this.stalledChecker()
+                        .catch(err => {
+                        this.emit('error', err);
+                    })
+                        .finally(() => {
+                        this.stalledCheckerRunning = false;
+                    });
+                });
+            }
+        }
+    }
+    async stalledChecker() {
+        while (!(this.closing || this.paused)) {
+            await this.checkConnectionError(() => this.moveStalledJobsToWait());
+            await new Promise(resolve => {
+                const timeout = setTimeout(resolve, this.opts.stalledInterval);
+                this.stalledCheckStopper = () => {
+                    clearTimeout(timeout);
+                    resolve();
+                };
+            });
+        }
+    }
+    /**
+     * Returns a promise that resolves when active jobs are cleared
+     *
+     * @returns
+     */
+    async whenCurrentJobsFinished(reconnect = true) {
+        // The blocking connection is dedicated to bzpopmin, so it is safe to
+        // always disconnect it whenever the main loop is running. Waiting for the
+        // actual disconnect ('end' event) is required to avoid a race where the
+        // bzpopmin call is still in flight when the main loop awaits its result.
+        if (this.mainLoopRunning) {
+            await this.blockingConnection.disconnect(true);
+            await this.mainLoopRunning;
+        }
+        else {
+            reconnect = false;
+        }
+        reconnect && (await this.blockingConnection.reconnect());
+    }
+    async retryIfFailed(fn, opts) {
+        var _a;
+        let retry = 0;
+        const maxRetries = opts.maxRetries || Infinity;
+        do {
+            try {
+                return await fn();
+            }
+            catch (err) {
+                (_a = opts.span) === null || _a === void 0 ? void 0 : _a.recordException(err.message);
+                if (isNotConnectionError(err)) {
+                    // Emit error when not paused or closing; optionally swallow (no throw) when opts.onlyEmitError is set.
+                    if (!this.paused && !this.closing) {
+                        this.emit('error', err);
+                    }
+                    if (opts.onlyEmitError) {
+                        return;
+                    }
+                    else {
+                        throw err;
+                    }
+                }
+                else {
+                    if (opts.delayInMs && !this.closing && !this.closed) {
+                        await this.delay(opts.delayInMs, this.abortDelayController);
+                    }
+                    if (retry + 1 >= maxRetries) {
+                        // If we've reached max retries, throw the last error
+                        throw err;
+                    }
+                }
+            }
+        } while (++retry < maxRetries);
+    }
+    async moveStalledJobsToWait() {
+        await this.trace(SpanKind.INTERNAL, 'moveStalledJobsToWait', this.name, async (span) => {
+            const stalled = await this.scripts.moveStalledJobsToWait();
+            span === null || span === void 0 ? void 0 : span.setAttributes({
+                [TelemetryAttributes.WorkerId]: this.id,
+                [TelemetryAttributes.WorkerName]: this.opts.name,
+                [TelemetryAttributes.WorkerStalledJobs]: stalled,
+            });
+            stalled.forEach((jobId) => {
+                span === null || span === void 0 ? void 0 : span.addEvent('job stalled', {
+                    [TelemetryAttributes.JobId]: jobId,
+                });
+                this.emit('stalled', jobId, 'active');
+            });
+        });
+    }
+    moveLimitedBackToWait(job, token) {
+        return job.moveToWait(token);
+    }
+}
diff --git a/node_modules/bullmq/dist/esm/commands/addDelayedJob-6.lua b/node_modules/bullmq/dist/esm/commands/addDelayedJob-6.lua
new file mode 100644
index 0000000..00ae938
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addDelayedJob-6.lua
@@ -0,0 +1,108 @@
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+
+    - computes timestamp.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+    
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'delayed'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (use custom instead of one generated automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local delayedKey = KEYS[4]
+
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addDelayedJob"
+--- @include "includes/deduplicateJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, delayedKey, deduplicationKey,
+  eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+    opts, timestamp, parentKey, parentData, repeatJobKey)
+
+addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, KEYS[1], delay)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/esm/commands/addJobScheduler-11.lua b/node_modules/bullmq/dist/esm/commands/addJobScheduler-11.lua
new file mode 100644
index 0000000..9dcc1f7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addJobScheduler-11.lua
@@ -0,0 +1,198 @@
+--[[
+  Adds a job scheduler, i.e. a job factory that creates jobs based on a given schedule (repeat options).
+
+    Input:
+      KEYS[1]  'repeat' key
+      KEYS[2]  'delayed' key
+      KEYS[3]  'wait' key
+      KEYS[4]  'paused' key
+      KEYS[5]  'meta' key
+      KEYS[6]  'prioritized' key
+      KEYS[7]  'marker' key
+      KEYS[8]  'id' key
+      KEYS[9]  'events' key
+      KEYS[10] 'pc' priority counter
+      KEYS[11] 'active' key
+      
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] jobs scheduler id
+      ARGV[4] Json stringified template data
+      ARGV[5] mspacked template opts
+      ARGV[6] msgpacked delayed opts
+      ARGV[7] timestamp
+      ARGV[8] prefix key
+      ARGV[9] producer key
+
+      Output:
+        repeatableKey  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local eventsKey = KEYS[9]
+
+local nextMillis = ARGV[1]
+local jobSchedulerId = ARGV[3]
+local templateOpts = cmsgpack.unpack(ARGV[5])
+local now = tonumber(ARGV[7])
+local prefixKey = ARGV[8]
+local jobOpts = cmsgpack.unpack(ARGV[6])
+
+-- Includes
+--- @include "includes/addJobFromScheduler"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/isQueuePaused"
+--- @include "includes/removeJob"
+--- @include "includes/storeJobScheduler"
+--- @include "includes/getJobSchedulerEveryNextMillis"
+
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local templateData = ARGV[4]
+
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+end
+local schedulerOpts = cmsgpack.unpack(ARGV[2])
+
+local every = schedulerOpts['every']
+
+-- For backwards compatibility we also check the offset from the job itself.
+-- could be removed in future major versions.
+local jobOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+local offset = schedulerOpts['offset'] or jobOffset or 0
+local newOffset = offset
+
+local updatedEvery = false
+if every then
+    -- if we changed the 'every' value we need to reset millis to nil
+    local millis = prevMillis
+    if prevMillis then
+        local prevEvery = tonumber(rcall("HGET", schedulerKey, "every"))
+        if prevEvery ~= every then
+            millis = nil
+            updatedEvery = true
+        end
+    end
+
+    local startDate = schedulerOpts['startDate']
+    nextMillis, newOffset = getJobSchedulerEveryNextMillis(millis, every, now, offset, startDate)
+end
+
+local function removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, jobId, metaKey,
+    eventsKey)
+    if rcall("ZSCORE", delayedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", delayedKey, jobId)
+        return true
+    elseif rcall("ZSCORE", prioritizedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", prioritizedKey, jobId)
+        return true
+    else
+        local pausedOrWaitKey = waitKey
+        if isQueuePaused(metaKey) then
+            pausedOrWaitKey = pausedKey
+        end
+
+        if rcall("LREM", pausedOrWaitKey, 1, jobId) > 0 then
+            removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+            return true
+        end
+    end
+
+    return false
+end
+
+local removedPrevJob = false
+if prevMillis then
+    local currentJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    local currentJobKey = schedulerKey .. ":" .. prevMillis
+
+    -- In theory it should always exist the currentJobKey if there is a prevMillis unless something has
+    -- gone really wrong.
+    if rcall("EXISTS", currentJobKey) == 1 then
+        removedPrevJob = removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, currentJobId,
+            metaKey, eventsKey)
+    end
+end
+
+if removedPrevJob then
+    -- The jobs has been removed and we want to replace it, so lets use the same millis.
+    if every and not updatedEvery then
+        nextMillis = prevMillis
+    end
+else
+    -- Special case where no job was removed, and we need to add the next iteration.
+    schedulerOpts['offset'] = newOffset
+end
+
+-- Check for job ID collision with existing jobs (in any state)
+local jobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+local jobKey = prefixKey .. jobId
+
+-- If there's already a job with this ID, in a state 
+-- that is not updatable (active, completed, failed) we must 
+-- handle the collision
+local hasCollision = false
+if rcall("EXISTS", jobKey) == 1 then
+    if every then
+        -- For 'every' case: try next time slot to avoid collision
+        local nextSlotMillis = nextMillis + every
+        local nextSlotJobId = "repeat:" .. jobSchedulerId .. ":" .. nextSlotMillis
+        local nextSlotJobKey = prefixKey .. nextSlotJobId
+
+        if rcall("EXISTS", nextSlotJobKey) == 0 then
+            -- Next slot is free, use it
+            nextMillis = nextSlotMillis
+            jobId = nextSlotJobId
+        else
+            -- Next slot also has a job, return error code
+            return -11 -- SchedulerJobSlotsBusy
+        end
+    else
+        hasCollision = true
+    end
+end
+
+local delay = nextMillis - now
+
+-- Fast Clamp delay to minimum of 0
+if delay < 0 then
+    delay = 0
+end
+
+local nextJobKey = schedulerKey .. ":" .. nextMillis
+
+if not hasCollision or removedPrevJob then
+    -- jobId already calculated above during collision check
+
+    storeJobScheduler(jobSchedulerId, schedulerKey, repeatKey, nextMillis, schedulerOpts, templateData, templateOpts)
+
+    rcall("INCR", KEYS[8])
+
+    addJobFromScheduler(nextJobKey, jobId, jobOpts, waitKey, pausedKey, KEYS[11], metaKey, prioritizedKey, KEYS[10],
+        delayedKey, KEYS[7], eventsKey, schedulerOpts['name'], maxEvents, now, templateData, jobSchedulerId, delay)
+elseif hasCollision then
+    -- For 'pattern' case: return error code
+    return -10 -- SchedulerJobIdCollision
+end
+
+if ARGV[9] ~= "" then
+    rcall("HSET", ARGV[9], "nrjid", jobId)
+end
+
+return {jobId .. "", delay}
diff --git a/node_modules/bullmq/dist/esm/commands/addLog-2.lua b/node_modules/bullmq/dist/esm/commands/addLog-2.lua
new file mode 100644
index 0000000..92748de
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addLog-2.lua
@@ -0,0 +1,30 @@
+--[[
+  Add job log
+
+  Input:
+    KEYS[1] job id key
+    KEYS[2] job logs key
+
+    ARGV[1] id
+    ARGV[2] log
+    ARGV[3] keepLogs
+
+  Output:
+    -1 - Missing job.
+]]
+local rcall = redis.call
+
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+  local logCount = rcall("RPUSH", KEYS[2], ARGV[2])
+
+  if ARGV[3] ~= '' then
+    local keepLogs = tonumber(ARGV[3])
+    rcall("LTRIM", KEYS[2], -keepLogs, -1)
+
+    return math.min(keepLogs, logCount)
+  end
+
+  return logCount
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/addParentJob-6.lua b/node_modules/bullmq/dist/esm/commands/addParentJob-6.lua
new file mode 100644
index 0000000..2735885
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addParentJob-6.lua
@@ -0,0 +1,110 @@
+--[[
+  Adds a parent job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - adds the job to the waiting-children zset
+
+    Input:
+      KEYS[1] 'meta'
+      KEYS[2] 'id'
+      KEYS[3] 'delayed'
+      KEYS[4] 'waiting-children'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[1]
+local idKey = KEYS[2]
+local delayedKey = KEYS[3]
+
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/deduplicateJobWithoutReplace"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationId = opts['de'] and opts['de']['id']
+if deduplicationId then
+    local deduplicationJobId = deduplicateJobWithoutReplace(deduplicationId, opts['de'],
+        jobId, deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationJobId then
+        return deduplicationJobId
+    end
+end
+
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+
+local waitChildrenKey = KEYS[4]
+rcall("ZADD", waitChildrenKey, timestamp, jobId)
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+      "waiting-children", "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/esm/commands/addPrioritizedJob-9.lua b/node_modules/bullmq/dist/esm/commands/addPrioritizedJob-9.lua
new file mode 100644
index 0000000..0a7c5f1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addPrioritizedJob-9.lua
@@ -0,0 +1,118 @@
+--[[
+  Adds a prioritized job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - Adds the job to the "added" list so that workers gets notified.
+
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'prioritized'
+      KEYS[5] 'delayed'
+      KEYS[6] 'completed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] 'pc' priority counter
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]] 
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local priorityKey = KEYS[4]
+
+local completedKey = KEYS[6]
+local activeKey = KEYS[7]
+local eventsKey = KEYS[8]
+local priorityCounterKey = KEYS[9]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addJobWithPriority"
+--- @include "includes/deduplicateJob"
+--- @include "includes/storeJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/isQueuePausedOrMaxed"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", idKey)
+
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[5],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+-- Store the job.
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+                                 opts, timestamp, parentKey, parentData,
+                                 repeatJobKey)
+
+-- Add the job to the prioritized set
+local isPausedOrMaxed = isQueuePausedOrMaxed(metaKey, activeKey)
+addJobWithPriority( KEYS[1], priorityKey, priority, jobId, priorityCounterKey, isPausedOrMaxed)
+
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/esm/commands/addRepeatableJob-2.lua b/node_modules/bullmq/dist/esm/commands/addRepeatableJob-2.lua
new file mode 100644
index 0000000..9d5e3f5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addRepeatableJob-2.lua
@@ -0,0 +1,84 @@
+--[[
+  Adds a repeatable job
+
+    Input:
+      KEYS[1] 'repeat' key
+      KEYS[2] 'delayed' key
+      
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      ARGV[4] custom key
+      ARGV[5] prefix key
+
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+
+local nextMillis = ARGV[1]
+local legacyCustomKey = ARGV[3]
+local customKey = ARGV[4]
+local prefixKey = ARGV[5]
+
+-- Includes
+--- @include "includes/removeJob"
+
+local function storeRepeatableJob(repeatKey, customKey, nextMillis, rawOpts)
+  rcall("ZADD", repeatKey, nextMillis, customKey)
+  local opts = cmsgpack.unpack(rawOpts)
+
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+
+  rcall("HMSET", repeatKey .. ":" .. customKey, "name", opts['name'],
+    unpack(optionalValues))
+
+  return customKey
+end
+
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local prevMillis = rcall("ZSCORE", repeatKey, customKey)
+if prevMillis then
+  local delayedJobId =  "repeat:" .. customKey .. ":" .. prevMillis
+  local nextDelayedJobId =  repeatKey .. ":" .. customKey .. ":" .. nextMillis
+
+  if rcall("ZSCORE", delayedKey, delayedJobId)
+   and rcall("EXISTS", nextDelayedJobId) ~= 1 then
+    removeJob(delayedJobId, true, prefixKey, true --[[remove debounce key]])
+    rcall("ZREM", delayedKey, delayedJobId)
+  end
+end
+
+-- Keep backwards compatibility with old repeatable jobs (<= 3.0.0)
+if rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+  return storeRepeatableJob(repeatKey, legacyCustomKey, nextMillis, ARGV[2])
+end
+
+return storeRepeatableJob(repeatKey, customKey, nextMillis, ARGV[2])
diff --git a/node_modules/bullmq/dist/esm/commands/addStandardJob-9.lua b/node_modules/bullmq/dist/esm/commands/addStandardJob-9.lua
new file mode 100644
index 0000000..db1198a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/addStandardJob-9.lua
@@ -0,0 +1,123 @@
+--[[
+  Adds a job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+
+    - if delayed:
+      - computes timestamp.
+      - adds to delayed zset.
+      - Emits a global event 'delayed' if the job is delayed.
+    - if not delayed
+      - Adds the jobId to the wait/paused list in one of three ways:
+         - LIFO
+         - FIFO
+         - prioritized.
+      - Adds the job to the "added" list so that workers gets notified.
+
+    Input:
+      KEYS[1] 'wait',
+      KEYS[2] 'paused'
+      KEYS[3] 'meta'
+      KEYS[4] 'id'
+      KEYS[5] 'completed'
+      KEYS[6] 'delayed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] marker key
+
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local eventsKey = KEYS[8]
+
+local jobId
+local jobIdKey
+local rcall = redis.call
+
+local args = cmsgpack.unpack(ARGV[1])
+
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/deduplicateJob"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/handleDuplicatedJob"
+--- @include "includes/storeJob"
+
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+    parentData = cjson.encode(parent)
+end
+
+local jobCounter = rcall("INCR", KEYS[4])
+
+local metaKey = KEYS[3]
+local maxEvents = getOrSetMaxEvents(metaKey)
+
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, KEYS[5], eventsKey,
+            maxEvents, timestamp)
+    end
+end
+
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[6],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[1], KEYS[2])
+
+-- LIFO or FIFO
+local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+addJobInTargetList(target, KEYS[9], pushCmd, isPausedOrMaxed, jobId)
+
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+
+return jobId .. "" -- convert to string
diff --git a/node_modules/bullmq/dist/esm/commands/changeDelay-4.lua b/node_modules/bullmq/dist/esm/commands/changeDelay-4.lua
new file mode 100644
index 0000000..f0bdb6a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/changeDelay-4.lua
@@ -0,0 +1,55 @@
+--[[
+  Change job delay when it is in delayed set.
+  Input:
+    KEYS[1] delayed key
+    KEYS[2] meta key
+    KEYS[3] marker key
+    KEYS[4] events stream
+
+    ARGV[1] delay
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] job key
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in delayed set.
+
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+--- @include "includes/getDelayedScore"
+--- @include "includes/getOrSetMaxEvents"
+
+if rcall("EXISTS", ARGV[4]) == 1 then
+  local jobId = ARGV[3]
+
+  local delay = tonumber(ARGV[1])
+  local score, delayedTimestamp = getDelayedScore(KEYS[1], ARGV[2], delay)
+
+  local numRemovedElements = rcall("ZREM", KEYS[1], jobId)
+
+  if numRemovedElements < 1 then
+    return -3
+  end
+
+  rcall("HSET", ARGV[4], "delay", delay)
+  rcall("ZADD", KEYS[1], score, jobId)
+
+  local maxEvents = getOrSetMaxEvents(KEYS[2])
+
+  rcall("XADD", KEYS[4], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(KEYS[3], KEYS[1])
+
+  return 0
+else
+  return -1
+end
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/esm/commands/changePriority-7.lua b/node_modules/bullmq/dist/esm/commands/changePriority-7.lua
new file mode 100644
index 0000000..50e6219
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/changePriority-7.lua
@@ -0,0 +1,68 @@
+--[[
+  Change job priority
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'active'
+    KEYS[6] 'pc' priority counter
+    KEYS[7] 'marker'
+
+    ARGV[1] priority value
+    ARGV[2] prefix key
+    ARGV[3] job id
+    ARGV[4] lifo
+
+    Output:
+       0  - OK
+      -1  - Missing job
+]]
+local jobId = ARGV[3]
+local jobKey = ARGV[2] .. jobId
+local priority = tonumber(ARGV[1])
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/pushBackJobWithPriority"
+
+local function reAddJobWithNewPriority( prioritizedKey, markerKey, targetKey,
+    priorityCounter, lifo, priority, jobId, isPausedOrMaxed)
+    if priority == 0 then
+        local pushCmd = lifo and 'RPUSH' or 'LPUSH'
+        addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    else
+        if lifo then
+            pushBackJobWithPriority(prioritizedKey, priority, jobId)
+        else
+            addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+                priorityCounter, isPausedOrMaxed)
+        end
+    end
+end
+
+if rcall("EXISTS", jobKey) == 1 then
+    local metaKey = KEYS[3]
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[5], KEYS[1], KEYS[2])
+    local prioritizedKey = KEYS[4]
+    local priorityCounterKey = KEYS[6]
+    local markerKey = KEYS[7]
+
+    -- Re-add with the new priority
+    if rcall("ZREM", prioritizedKey, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    elseif rcall("LREM", target, -1, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    end
+
+    rcall("HSET", jobKey, "priority", priority)
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/cleanJobsInSet-3.lua b/node_modules/bullmq/dist/esm/commands/cleanJobsInSet-3.lua
new file mode 100644
index 0000000..744748f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/cleanJobsInSet-3.lua
@@ -0,0 +1,59 @@
+--[[
+  Remove jobs from the specific set.
+
+  Input:
+    KEYS[1]  set key,
+    KEYS[2]  events stream key
+    KEYS[3]  repeat key
+
+    ARGV[1]  jobKey prefix
+    ARGV[2]  timestamp
+    ARGV[3]  limit the number of jobs to be removed. 0 is unlimited
+    ARGV[4]  set name, can be any of 'wait', 'active', 'paused', 'delayed', 'completed', or 'failed'
+]]
+local rcall = redis.call
+local repeatKey = KEYS[3]
+local rangeStart = 0
+local rangeEnd = -1
+
+local limit = tonumber(ARGV[3])
+
+-- If we're only deleting _n_ items, avoid retrieving all items
+-- for faster performance
+--
+-- Start from the tail of the list, since that's where oldest elements
+-- are generally added for FIFO lists
+if limit > 0 then
+  rangeStart = -1 - limit + 1
+  rangeEnd = -1
+end
+
+-- Includes
+--- @include "includes/cleanList"
+--- @include "includes/cleanSet"
+
+local result
+if ARGV[4] == "active" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], false --[[ hasFinished ]],
+                      repeatKey)
+elseif ARGV[4] == "delayed" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"processedOn", "timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "prioritized" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "wait" or ARGV[4] == "paused" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], true --[[ hasFinished ]],
+                      repeatKey)
+else
+  rangeEnd = ARGV[2]
+  -- No need to pass repeat key as in that moment job won't be related to a job scheduler
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"finishedOn"}, true  --[[ hasFinished ]])
+end
+
+rcall("XADD", KEYS[2], "*", "event", "cleaned", "count", result[2])
+
+return result[1]
diff --git a/node_modules/bullmq/dist/esm/commands/drain-5.lua b/node_modules/bullmq/dist/esm/commands/drain-5.lua
new file mode 100644
index 0000000..738f9d2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/drain-5.lua
@@ -0,0 +1,41 @@
+--[[
+  Drains the queue, removes all jobs that are waiting
+  or delayed, but not active, completed or failed
+
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'delayed'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'jobschedulers' (repeat)
+
+    ARGV[1]  queue key prefix
+    ARGV[2]  should clean delayed jobs
+]]
+local rcall = redis.call
+local queueBaseKey = ARGV[1]
+
+--- @include "includes/removeListJobs"
+--- @include "includes/removeZSetJobs"
+
+-- We must not remove delayed jobs if they are associated to a job scheduler.
+local scheduledJobs = {}
+local jobSchedulers = rcall("ZRANGE", KEYS[5], 0, -1, "WITHSCORES")
+
+-- For every job scheduler, get the current delayed job id.
+for i = 1, #jobSchedulers, 2 do
+    local jobSchedulerId = jobSchedulers[i]
+    local jobSchedulerMillis = jobSchedulers[i + 1]
+
+    local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. jobSchedulerMillis
+    scheduledJobs[delayedJobId] = true
+end
+
+removeListJobs(KEYS[1], true, queueBaseKey, 0, scheduledJobs) -- wait
+removeListJobs(KEYS[2], true, queueBaseKey, 0, scheduledJobs) -- paused
+
+if ARGV[2] == "1" then
+  removeZSetJobs(KEYS[3], true, queueBaseKey, 0, scheduledJobs) -- delayed
+end
+
+removeZSetJobs(KEYS[4], true, queueBaseKey, 0, scheduledJobs) -- prioritized
diff --git a/node_modules/bullmq/dist/esm/commands/extendLock-2.lua b/node_modules/bullmq/dist/esm/commands/extendLock-2.lua
new file mode 100644
index 0000000..37a3e30
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/extendLock-2.lua
@@ -0,0 +1,23 @@
+--[[
+  Extend lock and removes the job from the stalled set.
+
+  Input:
+    KEYS[1] 'lock',
+    KEYS[2] 'stalled'
+
+    ARGV[1]  token
+    ARGV[2]  lock duration in milliseconds
+    ARGV[3]  jobid
+
+  Output:
+    "1" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  --   if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2], "XX") then
+  if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2]) then
+    rcall("SREM", KEYS[2], ARGV[3])
+    return 1
+  end
+end
+return 0
diff --git a/node_modules/bullmq/dist/esm/commands/extendLocks-1.lua b/node_modules/bullmq/dist/esm/commands/extendLocks-1.lua
new file mode 100644
index 0000000..bbd5548
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/extendLocks-1.lua
@@ -0,0 +1,48 @@
+--[[
+  Extend locks for multiple jobs and remove them from the stalled set if successful.
+  Return the list of job IDs for which the operation failed.
+
+  KEYS[1] = stalled key
+  
+  ARGV[1] = baseKey
+  ARGV[2] = tokens
+  ARGV[3] = jobIds
+  ARGV[4] = lockDuration (ms)
+
+  Output:
+    An array of failed job IDs. If empty, all succeeded.
+]]
+local rcall = redis.call
+
+local stalledKey = KEYS[1]
+local baseKey = ARGV[1]
+local tokens = cmsgpack.unpack(ARGV[2])
+local jobIds = cmsgpack.unpack(ARGV[3])
+local lockDuration = ARGV[4]
+
+local jobCount = #jobIds
+local failedJobs = {}
+
+for i = 1, jobCount, 1 do
+    local lockKey = baseKey .. jobIds[i] .. ':lock'
+    local jobId = jobIds[i]
+    local token = tokens[i]
+
+    local currentToken = rcall("GET", lockKey)
+    if currentToken then
+        if currentToken == token then
+            local setResult = rcall("SET", lockKey, token, "PX", lockDuration)
+            if setResult then
+                rcall("SREM", stalledKey, jobId)
+            else
+                table.insert(failedJobs, jobId)
+            end
+        else
+            table.insert(failedJobs, jobId)
+        end
+    else
+        table.insert(failedJobs, jobId)
+    end
+end
+
+return failedJobs
diff --git a/node_modules/bullmq/dist/esm/commands/getCounts-1.lua b/node_modules/bullmq/dist/esm/commands/getCounts-1.lua
new file mode 100644
index 0000000..0b5886c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getCounts-1.lua
@@ -0,0 +1,36 @@
+--[[
+  Get counts per provided states
+
+    Input:
+      KEYS[1]    'prefix'
+
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local prefix = KEYS[1]
+local results = {}
+
+for i = 1, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        results[#results+1] = count-1
+      else
+        results[#results+1] = 0
+      end
+    else
+      results[#results+1] = rcall("LLEN", stateKey)
+    end
+  elseif ARGV[i] == "active" then
+    results[#results+1] = rcall("LLEN", stateKey)
+  else
+    results[#results+1] = rcall("ZCARD", stateKey)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/esm/commands/getCountsPerPriority-4.lua b/node_modules/bullmq/dist/esm/commands/getCountsPerPriority-4.lua
new file mode 100644
index 0000000..fa24ba2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getCountsPerPriority-4.lua
@@ -0,0 +1,35 @@
+--[[
+  Get counts per provided states
+
+    Input:
+      KEYS[1] wait key
+      KEYS[2] paused key
+      KEYS[3] meta key
+      KEYS[4] prioritized key
+
+      ARGV[1...] priorities
+]]
+local rcall = redis.call
+local results = {}
+local waitKey = KEYS[1]
+local pausedKey = KEYS[2]
+local prioritizedKey = KEYS[4]
+
+-- Includes
+--- @include "includes/isQueuePaused"
+
+for i = 1, #ARGV do
+  local priority = tonumber(ARGV[i])
+  if priority == 0 then
+    if isQueuePaused(KEYS[3]) then
+      results[#results+1] = rcall("LLEN", pausedKey)
+    else
+      results[#results+1] = rcall("LLEN", waitKey)
+    end
+  else
+    results[#results+1] = rcall("ZCOUNT", prioritizedKey,
+      priority * 0x100000000, (priority + 1)  * 0x100000000 - 1)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/esm/commands/getDependencyCounts-4.lua b/node_modules/bullmq/dist/esm/commands/getDependencyCounts-4.lua
new file mode 100644
index 0000000..bacc488
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getDependencyCounts-4.lua
@@ -0,0 +1,31 @@
+--[[
+  Get counts per child states
+
+    Input:
+      KEYS[1]    processed key
+      KEYS[2]    unprocessed key
+      KEYS[3]    ignored key
+      KEYS[4]    failed key
+
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local processedKey = KEYS[1]
+local unprocessedKey = KEYS[2]
+local ignoredKey = KEYS[3]
+local failedKey = KEYS[4]
+local results = {}
+
+for i = 1, #ARGV do
+  if ARGV[i] == "processed" then
+    results[#results+1] = rcall("HLEN", processedKey)
+  elseif ARGV[i] == "unprocessed" then
+    results[#results+1] = rcall("SCARD", unprocessedKey)
+  elseif ARGV[i] == "ignored" then
+    results[#results+1] = rcall("HLEN", ignoredKey)
+  else
+    results[#results+1] = rcall("ZCARD", failedKey)
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/esm/commands/getJobScheduler-1.lua b/node_modules/bullmq/dist/esm/commands/getJobScheduler-1.lua
new file mode 100644
index 0000000..324bdb5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getJobScheduler-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Get job scheduler record.
+
+  Input:
+    KEYS[1] 'repeat' key
+
+    ARGV[1] id
+]]
+
+local rcall = redis.call
+local jobSchedulerKey = KEYS[1] .. ":" .. ARGV[1]
+
+local score = rcall("ZSCORE", KEYS[1], ARGV[1])
+
+if score then
+  return {rcall("HGETALL", jobSchedulerKey), score} -- get job data
+end
+
+return {nil, nil}
diff --git a/node_modules/bullmq/dist/esm/commands/getMetrics-2.lua b/node_modules/bullmq/dist/esm/commands/getMetrics-2.lua
new file mode 100644
index 0000000..699255f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getMetrics-2.lua
@@ -0,0 +1,19 @@
+--[[
+  Get metrics
+
+  Input:
+    KEYS[1] 'metrics' key
+    KEYS[2] 'metrics data' key
+
+    ARGV[1] start index
+    ARGV[2] end index
+]]
+local rcall = redis.call;
+local metricsKey = KEYS[1]
+local dataKey = KEYS[2]
+
+local metrics = rcall("HMGET", metricsKey, "count", "prevTS", "prevCount")
+local data = rcall("LRANGE", dataKey, tonumber(ARGV[1]), tonumber(ARGV[2]))
+local numPoints = rcall("LLEN", dataKey)
+
+return {metrics, data, numPoints}
diff --git a/node_modules/bullmq/dist/esm/commands/getRanges-1.lua b/node_modules/bullmq/dist/esm/commands/getRanges-1.lua
new file mode 100644
index 0000000..b9ead60
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getRanges-1.lua
@@ -0,0 +1,70 @@
+--[[
+  Get job ids per provided states
+
+    Input:
+      KEYS[1]    'prefix'
+
+      ARGV[1]    start
+      ARGV[2]    end
+      ARGV[3]    asc
+      ARGV[4...] types
+]]
+local rcall = redis.call
+local prefix = KEYS[1]
+local rangeStart = tonumber(ARGV[1])
+local rangeEnd = tonumber(ARGV[2])
+local asc = ARGV[3]
+local results = {}
+
+local function getRangeInList(listKey, asc, rangeStart, rangeEnd, results)
+  if asc == "1" then
+    local modifiedRangeStart
+    local modifiedRangeEnd
+    if rangeStart == -1 then
+      modifiedRangeStart = 0
+    else
+      modifiedRangeStart = -(rangeStart + 1)
+    end
+
+    if rangeEnd == -1 then
+      modifiedRangeEnd = 0
+    else
+      modifiedRangeEnd = -(rangeEnd + 1)
+    end
+
+    results[#results+1] = rcall("LRANGE", listKey,
+      modifiedRangeEnd,
+      modifiedRangeStart)
+  else
+    results[#results+1] = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  end
+end
+
+for i = 4, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+      else
+        results[#results+1] = {}
+      end
+    else
+      getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+    end
+  elseif ARGV[i] == "active" then
+    getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+  else
+    if asc == "1" then
+      results[#results+1] = rcall("ZRANGE", stateKey, rangeStart, rangeEnd)
+    else
+      results[#results+1] = rcall("ZREVRANGE", stateKey, rangeStart, rangeEnd)
+    end
+  end
+end
+
+return results
diff --git a/node_modules/bullmq/dist/esm/commands/getRateLimitTtl-2.lua b/node_modules/bullmq/dist/esm/commands/getRateLimitTtl-2.lua
new file mode 100644
index 0000000..755d25f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getRateLimitTtl-2.lua
@@ -0,0 +1,26 @@
+--[[
+  Get rate limit ttl
+
+    Input:
+      KEYS[1] 'limiter'
+      KEYS[2] 'meta'
+
+      ARGV[1] maxJobs
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/getRateLimitTTL"
+
+local rateLimiterKey = KEYS[1]
+if ARGV[1] ~= "0" then
+  return getRateLimitTTL(tonumber(ARGV[1]), rateLimiterKey)
+else
+  local rateLimitMax = rcall("HGET", KEYS[2], "max")
+  if rateLimitMax then
+    return getRateLimitTTL(tonumber(rateLimitMax), rateLimiterKey)
+  end
+
+  return rcall("PTTL", rateLimiterKey)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/getState-8.lua b/node_modules/bullmq/dist/esm/commands/getState-8.lua
new file mode 100644
index 0000000..f9346f1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getState-8.lua
@@ -0,0 +1,65 @@
+--[[
+  Get a job state
+
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'prioritized'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+
+-- Includes
+--- @include "includes/checkItemInList"
+
+local active_items = rcall("LRANGE", KEYS[4] , 0, -1)
+if checkItemInList(active_items, ARGV[1]) ~= nil then
+  return "active"
+end
+
+local wait_items = rcall("LRANGE", KEYS[5] , 0, -1)
+if checkItemInList(wait_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+
+local paused_items = rcall("LRANGE", KEYS[6] , 0, -1)
+if checkItemInList(paused_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+
+if rcall("ZSCORE", KEYS[7], ARGV[1]) then
+  return "waiting-children"
+end
+
+return "unknown"
diff --git a/node_modules/bullmq/dist/esm/commands/getStateV2-8.lua b/node_modules/bullmq/dist/esm/commands/getStateV2-8.lua
new file mode 100644
index 0000000..12eea10
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/getStateV2-8.lua
@@ -0,0 +1,58 @@
+--[[
+  Get a job state
+
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+
+if rcall("LPOS", KEYS[4] , ARGV[1]) then
+  return "active"
+end
+
+if rcall("LPOS", KEYS[5] , ARGV[1]) then
+  return "waiting"
+end
+
+if rcall("LPOS", KEYS[6] , ARGV[1]) then
+  return "waiting"
+end
+
+if rcall("ZSCORE", KEYS[7] , ARGV[1]) then
+  return "waiting-children"
+end
+
+return "unknown"
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addBaseMarkerIfNeeded.lua b/node_modules/bullmq/dist/esm/commands/includes/addBaseMarkerIfNeeded.lua
new file mode 100644
index 0000000..af10026
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addBaseMarkerIfNeeded.lua
@@ -0,0 +1,9 @@
+--[[
+  Add marker if needed when a job is available.
+]]
+
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addDelayMarkerIfNeeded.lua b/node_modules/bullmq/dist/esm/commands/includes/addDelayMarkerIfNeeded.lua
new file mode 100644
index 0000000..2f98500
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addDelayMarkerIfNeeded.lua
@@ -0,0 +1,15 @@
+--[[
+  Add delay marker if needed.
+]]
+
+-- Includes
+--- @include "getNextDelayedTimestamp"
+
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addDelayedJob.lua b/node_modules/bullmq/dist/esm/commands/includes/addDelayedJob.lua
new file mode 100644
index 0000000..c6bc015
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addDelayedJob.lua
@@ -0,0 +1,23 @@
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+
+-- Includes
+--- @include "addDelayMarkerIfNeeded"
+--- @include "getDelayedScore"
+
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addJobFromScheduler.lua b/node_modules/bullmq/dist/esm/commands/includes/addJobFromScheduler.lua
new file mode 100644
index 0000000..1a9f318
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addJobFromScheduler.lua
@@ -0,0 +1,19 @@
+--[[
+  Add delay marker if needed.
+]]
+
+-- Includes
+--- @include "storeAndEnqueueJob"
+
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addJobInTargetList.lua b/node_modules/bullmq/dist/esm/commands/includes/addJobInTargetList.lua
new file mode 100644
index 0000000..80f7bc0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addJobInTargetList.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/addJobWithPriority.lua b/node_modules/bullmq/dist/esm/commands/includes/addJobWithPriority.lua
new file mode 100644
index 0000000..ccf8cf3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/addJobWithPriority.lua
@@ -0,0 +1,14 @@
+--[[
+  Function to add job considering priority.
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+--- @include "getPriorityScore"
+
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/batches.lua b/node_modules/bullmq/dist/esm/commands/includes/batches.lua
new file mode 100644
index 0000000..b8e6d48
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/batches.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+
+local function batches(n, batchSize)
+  local i = 0
+
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/checkItemInList.lua b/node_modules/bullmq/dist/esm/commands/includes/checkItemInList.lua
new file mode 100644
index 0000000..b186afb
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/checkItemInList.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to check if an item belongs to a list.
+]]
+
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/cleanList.lua b/node_modules/bullmq/dist/esm/commands/includes/cleanList.lua
new file mode 100644
index 0000000..bf1557d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/cleanList.lua
@@ -0,0 +1,49 @@
+--[[
+  Function to clean job list.
+  Returns jobIds and deleted count number.
+]]
+
+-- Includes
+--- @include "getTimestamp"
+--- @include "isJobSchedulerJob"
+--- @include "removeJob"
+
+local function cleanList(listKey, jobKeyPrefix, rangeStart, rangeEnd,
+  timestamp, isWaiting, jobSchedulersKey)
+  local jobs = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  local deleted = {}
+  local deletedCount = 0
+  local jobTS
+  local deletionMarker = ''
+  local jobIdsLen = #jobs
+  for i, job in ipairs(jobs) do
+    if limit > 0 and deletedCount >= limit then
+      break
+    end
+  
+    local jobKey = jobKeyPrefix .. job
+    if (isWaiting or rcall("EXISTS", jobKey .. ":lock") == 0) and
+      not isJobSchedulerJob(job, jobKey, jobSchedulersKey) then
+      -- Find the right timestamp of the job to compare to maxTimestamp:
+      -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+      -- * processedOn represents when the job was last attempted, but it doesn't get populated until
+      --   the job is first tried
+      -- * timestamp is the original job submission time
+      -- Fetch all three of these (in that order) and use the first one that is set so that we'll leave jobs
+      -- that have been active within the grace period:
+      jobTS = getTimestamp(jobKey, {"finishedOn", "processedOn", "timestamp"})
+      if (not jobTS or jobTS <= timestamp) then
+        -- replace the entry with a deletion marker; the actual deletion will
+        -- occur at the end of the script
+        rcall("LSET", listKey, rangeEnd - jobIdsLen + i, deletionMarker)
+        removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]])
+        deletedCount = deletedCount + 1
+        table.insert(deleted, job)
+      end
+    end
+  end
+
+  rcall("LREM", listKey, 0, deletionMarker)
+
+  return {deleted, deletedCount}
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/cleanSet.lua b/node_modules/bullmq/dist/esm/commands/includes/cleanSet.lua
new file mode 100644
index 0000000..c9d82dc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/cleanSet.lua
@@ -0,0 +1,58 @@
+--[[
+  Function to clean job set.
+  Returns jobIds and deleted count number.
+]] 
+
+-- Includes
+--- @include "batches"
+--- @include "getJobsInZset"
+--- @include "getTimestamp"
+--- @include "isJobSchedulerJob"
+--- @include "removeJob"
+
+local function cleanSet(
+    setKey,
+    jobKeyPrefix,
+    rangeEnd,
+    timestamp,
+    limit,
+    attributes,
+    isFinished,
+    jobSchedulersKey)
+    local jobs = getJobsInZset(setKey, rangeEnd, limit)
+    local deleted = {}
+    local deletedCount = 0
+    local jobTS
+    for i, job in ipairs(jobs) do
+        if limit > 0 and deletedCount >= limit then
+            break
+        end
+
+        local jobKey = jobKeyPrefix .. job
+        -- Extract a Job Scheduler Id from jobId ("repeat:job-scheduler-id:millis") 
+        -- and check if it is in the scheduled jobs
+        if not (jobSchedulersKey and isJobSchedulerJob(job, jobKey, jobSchedulersKey)) then
+            if isFinished then
+                removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                deletedCount = deletedCount + 1
+                table.insert(deleted, job)
+            else
+                -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+                jobTS = getTimestamp(jobKey, attributes)
+                if (not jobTS or jobTS <= timestamp) then
+                    removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                    deletedCount = deletedCount + 1
+                    table.insert(deleted, job)
+                end
+            end
+        end
+    end
+
+    if (#deleted > 0) then
+        for from, to in batches(#deleted, 7000) do
+            rcall("ZREM", setKey, unpack(deleted, from, to))
+        end
+    end
+
+    return {deleted, deletedCount}
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/collectMetrics.lua b/node_modules/bullmq/dist/esm/commands/includes/collectMetrics.lua
new file mode 100644
index 0000000..dde876c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/collectMetrics.lua
@@ -0,0 +1,46 @@
+--[[
+  Functions to collect metrics based on a current and previous count of jobs.
+  Granularity is fixed at 1 minute.
+]]
+--- @include "batches"
+local function collectMetrics(metaKey, dataPointsList, maxDataPoints,
+                                 timestamp)
+    -- Increment current count
+    local count = rcall("HINCRBY", metaKey, "count", 1) - 1
+
+    -- Compute how many data points we need to add to the list, N.
+    local prevTS = rcall("HGET", metaKey, "prevTS")
+
+    if not prevTS then
+        -- If prevTS is nil, set it to the current timestamp
+        rcall("HSET", metaKey, "prevTS", timestamp, "prevCount", 0)
+        return
+    end
+
+    local N = math.min(math.floor(timestamp / 60000) - math.floor(prevTS / 60000), tonumber(maxDataPoints))
+
+    if N > 0 then
+        local delta = count - rcall("HGET", metaKey, "prevCount")
+        -- If N > 1, add N-1 zeros to the list
+        if N > 1 then
+            local points = {}
+            points[1] = delta
+            for i = 2, N do
+                points[i] = 0
+            end
+
+            for from, to in batches(#points, 7000) do
+                rcall("LPUSH", dataPointsList, unpack(points, from, to))
+            end
+        else
+            -- LPUSH delta to the list
+            rcall("LPUSH", dataPointsList, delta)
+        end
+
+        -- LTRIM to keep list to its max size
+        rcall("LTRIM", dataPointsList, 0, maxDataPoints - 1)
+
+        -- update prev count with current count
+        rcall("HSET", metaKey, "prevCount", count, "prevTS", timestamp)
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/deduplicateJob.lua b/node_modules/bullmq/dist/esm/commands/includes/deduplicateJob.lua
new file mode 100644
index 0000000..664b50a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/deduplicateJob.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--- @include "deduplicateJobWithoutReplace"
+--- @include "removeJobKeys"
+--- @include "setDeduplicationKey"
+--- @include "storeDeduplicatedNextJob"
+
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+
+        return true
+    end
+
+    return false
+end
+
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/deduplicateJobWithoutReplace.lua b/node_modules/bullmq/dist/esm/commands/includes/deduplicateJobWithoutReplace.lua
new file mode 100644
index 0000000..5dcbdd4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/deduplicateJobWithoutReplace.lua
@@ -0,0 +1,66 @@
+--[[
+  Function to deduplicate a job.
+]]
+--- @include "setDeduplicationKey"
+--- @include "storeDeduplicatedNextJob"
+
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/destructureJobKey.lua b/node_modules/bullmq/dist/esm/commands/includes/destructureJobKey.lua
new file mode 100644
index 0000000..e59bb40
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/destructureJobKey.lua
@@ -0,0 +1,12 @@
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/fetchNextJob.lua b/node_modules/bullmq/dist/esm/commands/includes/fetchNextJob.lua
new file mode 100644
index 0000000..b8c42e3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/fetchNextJob.lua
@@ -0,0 +1,95 @@
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+
+-- Includes
+--- @include "getNextDelayedTimestamp"
+--- @include "getRateLimitTTL"
+--- @include "getTargetQueueList"
+--- @include "moveJobFromPrioritizedToActive"
+--- @include "prepareJobForProcessing"
+--- @include "promoteDelayedJobs"
+
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/filterOutJobsToIgnore.lua b/node_modules/bullmq/dist/esm/commands/includes/filterOutJobsToIgnore.lua
new file mode 100644
index 0000000..794d3e0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/filterOutJobsToIgnore.lua
@@ -0,0 +1,14 @@
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+  
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/esm/commands/includes/findPage.lua b/node_modules/bullmq/dist/esm/commands/includes/findPage.lua
new file mode 100644
index 0000000..c11626f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/findPage.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to achieve pagination for a set or hash.
+  This function simulates pagination in the most efficient way possible
+  for a set using sscan or hscan.
+
+  The main limitation is that sets are not order preserving, so the
+  pagination is not stable. This means that if the set is modified
+  between pages, the same element may appear in different pages.
+]] -- Maximum number of elements to be returned by sscan per iteration.
+local maxCount = 100
+
+-- Finds the cursor, and returns the first elements available for the requested page.
+local function findPage(key, command, pageStart, pageSize, cursor, offset,
+                        maxIterations, fetchJobs)
+    local items = {}
+    local jobs = {}
+    local iterations = 0
+
+    repeat
+        -- Iterate over the set using sscan/hscan.
+        local result = rcall(command, key, cursor, "COUNT", maxCount)
+
+        cursor = result[1]
+        local members = result[2]
+        local step = 1
+        if command == "HSCAN" then
+            step = 2
+        end
+        
+        if #members == 0 then
+            -- If the result is empty, we can return the result.
+            return cursor, offset, items, jobs
+        end
+
+        local chunkStart = offset
+        local chunkEnd = offset + #members / step
+
+        local pageEnd = pageStart + pageSize
+
+        if chunkEnd < pageStart then
+            -- If the chunk is before the page, we can skip it.
+            offset = chunkEnd
+        elseif chunkStart > pageEnd then
+            -- If the chunk is after the page, we can return the result.
+            return cursor, offset, items, jobs
+        else
+            -- If the chunk is overlapping the page, we need to add the elements to the result.
+            for i = 1, #members, step do
+                if offset >= pageEnd then
+                    return cursor, offset, items, jobs
+                end
+                if offset >= pageStart then
+                    local index = #items + 1
+                    if fetchJobs ~= nil then
+                        jobs[#jobs+1] = rcall("HGETALL", members[i])
+                    end
+                    if step == 2 then
+                        items[index] = {members[i], members[i + 1]}
+                    else
+                        items[index] = members[i]
+                    end
+                end
+                offset = offset + 1
+            end
+        end
+        iterations = iterations + 1
+    until cursor == "0" or iterations >= maxIterations
+
+    return cursor, offset, items, jobs
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getDelayedScore.lua b/node_modules/bullmq/dist/esm/commands/includes/getDelayedScore.lua
new file mode 100644
index 0000000..157e53b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getDelayedScore.lua
@@ -0,0 +1,25 @@
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getJobSchedulerEveryNextMillis.lua b/node_modules/bullmq/dist/esm/commands/includes/getJobSchedulerEveryNextMillis.lua
new file mode 100644
index 0000000..e593a7e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getJobSchedulerEveryNextMillis.lua
@@ -0,0 +1,40 @@
+
+
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getJobsInZset.lua b/node_modules/bullmq/dist/esm/commands/includes/getJobsInZset.lua
new file mode 100644
index 0000000..6e833d8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getJobsInZset.lua
@@ -0,0 +1,13 @@
+--[[
+  We use ZRANGEBYSCORE to make the case where we're deleting a limited number
+  of items in a sorted set only run a single iteration. If we simply used
+  ZRANGE, we may take a long time traversing through jobs that are within the
+  grace period.
+]]
+local function getJobsInZset(zsetKey, rangeEnd, limit)
+  if limit > 0 then
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd, "LIMIT", 0, limit)
+  else
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd)
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getNextDelayedTimestamp.lua b/node_modules/bullmq/dist/esm/commands/includes/getNextDelayedTimestamp.lua
new file mode 100644
index 0000000..8f87d93
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getNextDelayedTimestamp.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getOrSetMaxEvents.lua b/node_modules/bullmq/dist/esm/commands/includes/getOrSetMaxEvents.lua
new file mode 100644
index 0000000..e07291e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getOrSetMaxEvents.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getPriorityScore.lua b/node_modules/bullmq/dist/esm/commands/includes/getPriorityScore.lua
new file mode 100644
index 0000000..df5aba8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getPriorityScore.lua
@@ -0,0 +1,8 @@
+--[[
+  Function to get priority score.
+]]
+
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getRateLimitTTL.lua b/node_modules/bullmq/dist/esm/commands/includes/getRateLimitTTL.lua
new file mode 100644
index 0000000..1b8307c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getRateLimitTTL.lua
@@ -0,0 +1,17 @@
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getTargetQueueList.lua b/node_modules/bullmq/dist/esm/commands/includes/getTargetQueueList.lua
new file mode 100644
index 0000000..a768bce
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getTargetQueueList.lua
@@ -0,0 +1,22 @@
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getTimestamp.lua b/node_modules/bullmq/dist/esm/commands/includes/getTimestamp.lua
new file mode 100644
index 0000000..6cb70b5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getTimestamp.lua
@@ -0,0 +1,19 @@
+--[[
+  Function to get the latest saved timestamp.
+]]
+
+local function getTimestamp(jobKey, attributes)
+  if #attributes == 1 then
+    return rcall("HGET", jobKey, attributes[1])
+  end
+
+  local jobTs
+  for _, ts in ipairs(rcall("HMGET", jobKey, unpack(attributes))) do
+    if (ts) then
+      jobTs = ts
+      break
+    end
+  end
+
+  return jobTs
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/getZSetItems.lua b/node_modules/bullmq/dist/esm/commands/includes/getZSetItems.lua
new file mode 100644
index 0000000..7ee2ca3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/getZSetItems.lua
@@ -0,0 +1,7 @@
+--[[
+  Function to get ZSet items.
+]]
+
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/handleDuplicatedJob.lua b/node_modules/bullmq/dist/esm/commands/includes/handleDuplicatedJob.lua
new file mode 100644
index 0000000..8c2f6bc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/handleDuplicatedJob.lua
@@ -0,0 +1,26 @@
+--[[
+  Function to handle the case when job is duplicated.
+]]
+
+-- Includes
+--- @include "updateExistingJobsParent"
+
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+
+  return jobId .. "" -- convert to string
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/isJobSchedulerJob.lua b/node_modules/bullmq/dist/esm/commands/includes/isJobSchedulerJob.lua
new file mode 100644
index 0000000..f58cd93
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/isJobSchedulerJob.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/isLocked.lua b/node_modules/bullmq/dist/esm/commands/includes/isLocked.lua
new file mode 100644
index 0000000..6fb1b5a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/isLocked.lua
@@ -0,0 +1,34 @@
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+
+  returns:
+    boolean
+]]
+--- @include "destructureJobKey"
+
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/isQueueMaxed.lua b/node_modules/bullmq/dist/esm/commands/includes/isQueueMaxed.lua
new file mode 100644
index 0000000..d0a81ae
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/isQueueMaxed.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to check if queue is maxed or not.
+]]
+local function isQueueMaxed(queueMetaKey, activeKey)
+  local maxConcurrency = rcall("HGET", queueMetaKey, "concurrency")
+
+  if maxConcurrency then
+    local activeCount = rcall("LLEN", activeKey)
+    if activeCount >= tonumber(maxConcurrency) then
+      return true
+    end
+  end
+
+  return false
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/isQueuePaused.lua b/node_modules/bullmq/dist/esm/commands/includes/isQueuePaused.lua
new file mode 100644
index 0000000..66d433a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/isQueuePaused.lua
@@ -0,0 +1,7 @@
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/isQueuePausedOrMaxed.lua b/node_modules/bullmq/dist/esm/commands/includes/isQueuePausedOrMaxed.lua
new file mode 100644
index 0000000..89d8a0f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/isQueuePausedOrMaxed.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveChildFromDependenciesIfNeeded.lua b/node_modules/bullmq/dist/esm/commands/includes/moveChildFromDependenciesIfNeeded.lua
new file mode 100644
index 0000000..fbb1485
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveChildFromDependenciesIfNeeded.lua
@@ -0,0 +1,70 @@
+--[[
+  Function to recursively move from waitingChildren to failed.
+]]
+
+-- Includes
+--- @include "moveParentToWaitIfNoPendingDependencies"
+--- @include "moveParentToWaitIfNeeded"
+--- @include "moveParentToWait"
+
+local handleChildFailureAndMoveParentToWait = function (parentQueueKey, parentKey, parentId, jobIdKey, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    local parentDelayedKey = parentQueueKey .. ":delayed"
+    local parentWaitingChildrenOrDelayedKey
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentWaitingChildrenKey
+    elseif rcall("ZSCORE", parentDelayedKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentDelayedKey
+      rcall("HSET", parentKey, "delay", 0)
+    end
+
+    if parentWaitingChildrenOrDelayedKey then
+      rcall("ZREM", parentWaitingChildrenOrDelayedKey, parentId)
+      local deferredFailure = "child " .. jobIdKey .. " failed"
+      rcall("HSET", parentKey, "defa", deferredFailure)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    else
+      if not rcall("ZSCORE", parentQueueKey .. ":failed", parentId) then
+        local deferredFailure = "child " .. jobIdKey .. " failed"
+        rcall("HSET", parentKey, "defa", deferredFailure)
+      end
+    end
+  end
+end
+
+local moveChildFromDependenciesIfNeeded = function (rawParentData, childKey, failedReason, timestamp)
+  if rawParentData then
+    local parentData = cjson.decode(rawParentData)
+    local parentKey = parentData['queueKey'] .. ':' .. parentData['id']
+    local parentDependenciesChildrenKey = parentKey .. ":dependencies"
+    if parentData['fpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentUnsuccessfulChildrenKey = parentKey .. ":unsuccessful"
+        rcall("ZADD", parentUnsuccessfulChildrenKey, timestamp, childKey)
+        handleChildFailureAndMoveParentToWait(
+          parentData['queueKey'],
+          parentKey,
+          parentData['id'],
+          childKey,
+          timestamp
+        )
+      end
+    elseif parentData['cpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentFailedChildrenKey = parentKey .. ":failed"
+        rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        moveParentToWaitIfNeeded(parentData['queueKey'], parentKey, parentData['id'], timestamp)
+      end
+    elseif parentData['idof'] or parentData['rdof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        moveParentToWaitIfNoPendingDependencies(parentData['queueKey'], parentDependenciesChildrenKey,
+          parentKey, parentData['id'], timestamp)
+        if parentData['idof'] then
+          local parentFailedChildrenKey = parentKey .. ":failed"
+          rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        end
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveJobFromPrioritizedToActive.lua b/node_modules/bullmq/dist/esm/commands/includes/moveJobFromPrioritizedToActive.lua
new file mode 100644
index 0000000..fd6dd04
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveJobFromPrioritizedToActive.lua
@@ -0,0 +1,13 @@
+--[[
+  Function to move job from prioritized state to active.
+]]
+
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveJobToWait.lua b/node_modules/bullmq/dist/esm/commands/includes/moveJobToWait.lua
new file mode 100644
index 0000000..8aa3531
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveJobToWait.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to move job to wait to be picked up by a waiting worker.
+]]
+
+-- Includes
+--- @include "addJobInTargetList"
+--- @include "getTargetQueueList"
+
+local function moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey,
+  jobId, pushCmd)
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+  addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+
+  rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId", jobId, 'prev', 'active')
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveParentToWait.lua b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWait.lua
new file mode 100644
index 0000000..a7b232c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWait.lua
@@ -0,0 +1,45 @@
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+
+-- Includes
+--- @include "addDelayMarkerIfNeeded"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "isQueuePausedOrMaxed"
+--- @include "getTargetQueueList"
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNeeded.lua b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNeeded.lua
new file mode 100644
index 0000000..7425359
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNeeded.lua
@@ -0,0 +1,14 @@
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--- @include "moveParentToWait"
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNoPendingDependencies.lua b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNoPendingDependencies.lua
new file mode 100644
index 0000000..423160c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/moveParentToWaitIfNoPendingDependencies.lua
@@ -0,0 +1,13 @@
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--- @include "moveParentToWaitIfNeeded"
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/prepareJobForProcessing.lua b/node_modules/bullmq/dist/esm/commands/includes/prepareJobForProcessing.lua
new file mode 100644
index 0000000..71b96df
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/prepareJobForProcessing.lua
@@ -0,0 +1,49 @@
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+
+  local optionalValues = {}
+
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+
+  addBaseMarkerIfNeeded(markerKey, false)
+
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/promoteDelayedJobs.lua b/node_modules/bullmq/dist/esm/commands/includes/promoteDelayedJobs.lua
new file mode 100644
index 0000000..0b9fe59
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/promoteDelayedJobs.lua
@@ -0,0 +1,44 @@
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+
+     Events:
+      'waiting'
+]]
+
+-- Includes
+--- @include "addBaseMarkerIfNeeded"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "getPriorityScore"
+
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/pushBackJobWithPriority.lua b/node_modules/bullmq/dist/esm/commands/includes/pushBackJobWithPriority.lua
new file mode 100644
index 0000000..5d5a292
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/pushBackJobWithPriority.lua
@@ -0,0 +1,9 @@
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua b/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua
new file mode 100644
index 0000000..8fc6409
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnFinalization.lua
@@ -0,0 +1,23 @@
+--[[
+  Function to remove deduplication key if needed
+  when a job is moved to completed or failed states.
+]]
+
+local function removeDeduplicationKeyIfNeededOnFinalization(prefixKey,
+  deduplicationId, jobId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local pttl = rcall("PTTL", deduplicationKey)
+
+    if pttl == 0 then
+      return rcall("DEL", deduplicationKey)
+    end
+
+    if pttl == -1 then
+      local currentJobId = rcall('GET', deduplicationKey)
+      if currentJobId and currentJobId == jobId then
+        return rcall("DEL", deduplicationKey)
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua b/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua
new file mode 100644
index 0000000..bf8e720
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeDeduplicationKeyIfNeededOnRemoval.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJob.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJob.lua
new file mode 100644
index 0000000..7a80911
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJob.lua
@@ -0,0 +1,18 @@
+--[[
+  Function to remove job.
+]]
+
+-- Includes
+--- @include "removeDeduplicationKeyIfNeededOnRemoval"
+--- @include "removeJobKeys"
+--- @include "removeParentDependencyKey"
+
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobFromAnyState.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobFromAnyState.lua
new file mode 100644
index 0000000..85acc29
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobFromAnyState.lua
@@ -0,0 +1,35 @@
+--[[
+  Function to remove from any state.
+
+  returns:
+    prev state
+]]
+
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+
+  return "unknown"
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobKeys.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobKeys.lua
new file mode 100644
index 0000000..453d0de
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobKeys.lua
@@ -0,0 +1,8 @@
+--[[
+  Function to remove job keys.
+]]
+
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobWithChildren.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobWithChildren.lua
new file mode 100644
index 0000000..b2bf725
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobWithChildren.lua
@@ -0,0 +1,96 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+
+    Events:
+      'removed'
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "destructureJobKey"
+--- @include "getOrSetMaxEvents"
+--- @include "isJobSchedulerJob"
+--- @include "removeDeduplicationKeyIfNeededOnRemoval"
+--- @include "removeJobFromAnyState"
+--- @include "removeJobKeys"
+--- @include "removeParentDependencyKey"
+--- @include "isLocked"
+
+local removeJobChildren
+local removeJobWithChildren
+
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobs.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobs.lua
new file mode 100644
index 0000000..58b67ab
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobs.lua
@@ -0,0 +1,13 @@
+--[[
+  Functions to remove jobs.
+]]
+
+-- Includes
+--- @include "removeJob"
+
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxAge.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxAge.lua
new file mode 100644
index 0000000..a3aba06
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxAge.lua
@@ -0,0 +1,24 @@
+--[[
+  Functions to remove jobs by max age.
+]]
+
+-- Includes
+--- @include "batches"
+--- @include "removeJob"
+
+local function removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+  local start = timestamp - maxAge * 1000
+  local jobIds = rcall("ZREVRANGEBYSCORE", targetSet, start, "-inf", "LIMIT", 0, maxLimit)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  if #jobIds > 0 then
+    if #jobIds < maxLimit then
+      rcall("ZREMRANGEBYSCORE", targetSet, "-inf", start)
+    else
+      for from, to in batches(#jobIds, 7000) do
+        rcall("ZREM", targetSet, unpack(jobIds, from, to))
+      end
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxCount.lua b/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxCount.lua
new file mode 100644
index 0000000..af52c61
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeJobsByMaxCount.lua
@@ -0,0 +1,15 @@
+--[[
+  Functions to remove jobs by max count.
+]]
+
+-- Includes
+--- @include "removeJob"
+
+local function removeJobsByMaxCount(maxCount, targetSet, prefix)
+  local start = maxCount
+  local jobIds = rcall("ZREVRANGE", targetSet, start, -1)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  rcall("ZREMRANGEBYRANK", targetSet, 0, -(maxCount + 1))
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeListJobs.lua b/node_modules/bullmq/dist/esm/commands/includes/removeListJobs.lua
new file mode 100644
index 0000000..f6dca68
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeListJobs.lua
@@ -0,0 +1,23 @@
+--[[
+  Functions to remove jobs.
+]]
+
+-- Includes
+--- @include "filterOutJobsToIgnore"
+--- @include "removeJobs"
+
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeLock.lua b/node_modules/bullmq/dist/esm/commands/includes/removeLock.lua
new file mode 100644
index 0000000..d7335f6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeLock.lua
@@ -0,0 +1,19 @@
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeParentDependencyKey.lua b/node_modules/bullmq/dist/esm/commands/includes/removeParentDependencyKey.lua
new file mode 100644
index 0000000..29ab15a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeParentDependencyKey.lua
@@ -0,0 +1,90 @@
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+
+-- Includes
+--- @include "addJobInTargetList"
+--- @include "destructureJobKey"
+--- @include "getTargetQueueList"
+--- @include "removeJobKeys"
+
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/removeZSetJobs.lua b/node_modules/bullmq/dist/esm/commands/includes/removeZSetJobs.lua
new file mode 100644
index 0000000..399627f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/removeZSetJobs.lua
@@ -0,0 +1,21 @@
+-- Includes
+--- @include "batches"
+--- @include "filterOutJobsToIgnore"
+--- @include "getZSetItems"
+--- @include "removeJobs"  
+
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/requeueDeduplicatedJob.lua b/node_modules/bullmq/dist/esm/commands/includes/requeueDeduplicatedJob.lua
new file mode 100644
index 0000000..7700c6f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/requeueDeduplicatedJob.lua
@@ -0,0 +1,65 @@
+--[[
+  Function to create a new job from stored dedup-next data
+  when a deduplicated job with keepLastIfActive finishes.
+  At most one next job is created per deduplication ID.
+  Multiple triggers while active overwrite the dedup-next data,
+  so only the latest data is used.
+]]
+
+-- Includes
+--- @include "getOrSetMaxEvents"
+--- @include "setDeduplicationKey"
+--- @include "storeAndEnqueueJob"
+
+local function requeueDeduplicatedJob(prefix, deduplicationId, eventStreamKey,
+    metaKey, activeKey, waitKey, pausedKey, markerKey, prioritizedKey,
+    priorityCounterKey, delayedKey, timestamp)
+  local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+  if rcall("EXISTS", deduplicationNextKey) == 1 then
+    local nextData = rcall("HMGET", deduplicationNextKey,
+        "name", "data", "opts", "pk", "pd", "pdk", "rjk", "jid")
+
+    -- Always increment the counter to keep it monotonic
+    local nextId = rcall("INCR", prefix .. "id") .. ""
+    local storedJobId = nextData[8] -- index 8 = "jid" (8th field in the HMGET call above)
+    local newJobId
+    if storedJobId then
+      newJobId = storedJobId
+    else
+      newJobId = nextId
+    end
+    local newJobIdKey = prefix .. newJobId
+    local newOpts = cjson.decode(nextData[3])
+    local deduplicationKey = prefix .. "de:" .. deduplicationId
+
+    local parentKey = nextData[4] or nil
+    local parentData = nextData[5] or nil
+    local parentDependenciesKey = nextData[6] or nil
+    local repeatJobKey = nextData[7] or nil
+
+    -- Set dedup key for the new job (without TTL when keepLastIfActive,
+    -- so the key outlives the job's active duration)
+    local deOpts = newOpts['de']
+    if deOpts and deOpts['keepLastIfActive'] then
+      rcall('SET', deduplicationKey, newJobId)
+    else
+      setDeduplicationKey(deduplicationKey, newJobId, deOpts)
+    end
+
+    -- Store and enqueue using the shared helper (handles priority/lifo/delayed)
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    storeAndEnqueueJob(eventStreamKey, newJobIdKey, newJobId, nextData[1], nextData[2],
+        newOpts, timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+        waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+        priorityCounterKey, delayedKey, markerKey)
+
+    -- Register as child dependency if the job has a parent
+    if parentDependenciesKey then
+      rcall("SADD", parentDependenciesKey, newJobIdKey)
+    end
+
+    -- Only delete the dedup-next hash after the job is fully created,
+    -- so that if any step above errors, the data is not permanently lost.
+    rcall("DEL", deduplicationNextKey)
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/setDeduplicationKey.lua b/node_modules/bullmq/dist/esm/commands/includes/setDeduplicationKey.lua
new file mode 100644
index 0000000..d792cae
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/setDeduplicationKey.lua
@@ -0,0 +1,12 @@
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/storeAndEnqueueJob.lua b/node_modules/bullmq/dist/esm/commands/includes/storeAndEnqueueJob.lua
new file mode 100644
index 0000000..5666e81
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/storeAndEnqueueJob.lua
@@ -0,0 +1,42 @@
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+
+  Returns delay, priority from storeJob.
+]]
+
+-- Includes
+--- @include "addDelayedJob"
+--- @include "addJobInTargetList"
+--- @include "addJobWithPriority"
+--- @include "getTargetQueueList"
+--- @include "storeJob"
+
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+
+  return delay, priority
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/storeDeduplicatedNextJob.lua b/node_modules/bullmq/dist/esm/commands/includes/storeDeduplicatedNextJob.lua
new file mode 100644
index 0000000..ec8bfcc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/storeDeduplicatedNextJob.lua
@@ -0,0 +1,58 @@
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--- @include "checkItemInList"
+
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/storeJob.lua b/node_modules/bullmq/dist/esm/commands/includes/storeJob.lua
new file mode 100644
index 0000000..cab3fa1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/storeJob.lua
@@ -0,0 +1,36 @@
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+
+    return delay, priority
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/storeJobScheduler.lua b/node_modules/bullmq/dist/esm/commands/includes/storeJobScheduler.lua
new file mode 100644
index 0000000..6f5c10d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/storeJobScheduler.lua
@@ -0,0 +1,66 @@
+--[[
+  Function to store a job scheduler
+]]
+local function storeJobScheduler(schedulerId, schedulerKey, repeatKey, nextMillis, opts,
+  templateData, templateOpts)
+  rcall("ZADD", repeatKey, nextMillis, schedulerId)
+
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+
+  if opts['limit'] then
+    table.insert(optionalValues, "limit")
+    table.insert(optionalValues, opts['limit'])
+  end
+
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+
+  if opts['startDate'] then
+    table.insert(optionalValues, "startDate")
+    table.insert(optionalValues, opts['startDate'])
+  end
+
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+
+  if opts['offset'] then
+    table.insert(optionalValues, "offset")
+    table.insert(optionalValues, opts['offset'])
+  else
+    local offset = rcall("HGET", schedulerKey, "offset")
+    if offset then
+      table.insert(optionalValues, "offset")
+      table.insert(optionalValues, tonumber(offset))
+    end
+  end
+
+  local jsonTemplateOpts = cjson.encode(templateOpts)
+  if jsonTemplateOpts and jsonTemplateOpts ~= '{}' then
+    table.insert(optionalValues, "opts")
+    table.insert(optionalValues, jsonTemplateOpts)
+  end
+
+  if templateData and templateData ~= '{}' then
+    table.insert(optionalValues, "data")
+    table.insert(optionalValues, templateData)
+  end
+
+  table.insert(optionalValues, "ic")
+  table.insert(optionalValues, rcall("HGET", schedulerKey, "ic") or 1)
+
+  rcall("DEL", schedulerKey) -- remove all attributes and then re-insert new ones
+  rcall("HMSET", schedulerKey, "name", opts['name'], unpack(optionalValues))
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/trimEvents.lua b/node_modules/bullmq/dist/esm/commands/includes/trimEvents.lua
new file mode 100644
index 0000000..df3c58f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/trimEvents.lua
@@ -0,0 +1,15 @@
+--[[
+  Function to trim events, default 10000.
+]]
+
+-- Includes
+--- @include "getOrSetMaxEvents"
+
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/updateExistingJobsParent.lua b/node_modules/bullmq/dist/esm/commands/includes/updateExistingJobsParent.lua
new file mode 100644
index 0000000..35921e0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/updateExistingJobsParent.lua
@@ -0,0 +1,27 @@
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+
+-- Includes
+--- @include "updateParentDepsIfNeeded"
+
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/updateJobFields.lua b/node_modules/bullmq/dist/esm/commands/includes/updateJobFields.lua
new file mode 100644
index 0000000..8b378a4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/updateJobFields.lua
@@ -0,0 +1,11 @@
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/includes/updateParentDepsIfNeeded.lua b/node_modules/bullmq/dist/esm/commands/includes/updateParentDepsIfNeeded.lua
new file mode 100644
index 0000000..80c0594
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/includes/updateParentDepsIfNeeded.lua
@@ -0,0 +1,13 @@
+--[[
+  Validate and move or add dependencies to parent.
+]]
+
+-- Includes
+--- @include "moveParentToWaitIfNoPendingDependencies"
+
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
diff --git a/node_modules/bullmq/dist/esm/commands/isFinished-3.lua b/node_modules/bullmq/dist/esm/commands/isFinished-3.lua
new file mode 100644
index 0000000..85b074a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/isFinished-3.lua
@@ -0,0 +1,48 @@
+--[[
+  Checks if a job is finished (.i.e. is in the completed or failed set)
+
+  Input: 
+    KEYS[1] completed key
+    KEYS[2] failed key
+    KEYS[3] job key
+
+    ARGV[1] job id
+    ARGV[2] return value?
+  Output:
+    0 - Not finished.
+    1 - Completed.
+    2 - Failed.
+   -1 - Missing job. 
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[3]) ~= 1 then
+  if ARGV[2] == "1" then
+
+    return {-1,"Missing key for job " .. KEYS[3] .. ". isFinished"}
+  end  
+  return -1
+end
+
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local returnValue = rcall("HGET", KEYS[3], "returnvalue")
+
+    return {1,returnValue}
+  end
+  return 1
+end
+
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local failedReason = rcall("HGET", KEYS[3], "failedReason")
+
+    return {2,failedReason}
+  end
+  return 2
+end
+
+if ARGV[2] == "1" then
+  return {0}
+end
+
+return 0
diff --git a/node_modules/bullmq/dist/esm/commands/isJobInList-1.lua b/node_modules/bullmq/dist/esm/commands/isJobInList-1.lua
new file mode 100644
index 0000000..f0ccc7a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/isJobInList-1.lua
@@ -0,0 +1,16 @@
+--[[
+  Checks if job is in a given list.
+
+  Input:
+    KEYS[1]
+    ARGV[1]
+
+  Output:
+    1 if element found in the list.
+]]
+
+-- Includes
+--- @include "includes/checkItemInList"
+
+local items = redis.call("LRANGE", KEYS[1] , 0, -1)
+return checkItemInList(items, ARGV[1])
diff --git a/node_modules/bullmq/dist/esm/commands/isMaxed-2.lua b/node_modules/bullmq/dist/esm/commands/isMaxed-2.lua
new file mode 100644
index 0000000..b01e791
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/isMaxed-2.lua
@@ -0,0 +1,17 @@
+--[[
+  Checks if queue is maxed.
+
+  Input:
+    KEYS[1] meta key
+    KEYS[2] active key
+
+  Output:
+    1 if element found in the list.
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/isQueueMaxed"
+
+return isQueueMaxed(KEYS[1], KEYS[2])
diff --git a/node_modules/bullmq/dist/esm/commands/moveJobFromActiveToWait-9.lua b/node_modules/bullmq/dist/esm/commands/moveJobFromActiveToWait-9.lua
new file mode 100644
index 0000000..2077c4b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveJobFromActiveToWait-9.lua
@@ -0,0 +1,67 @@
+--[[
+  Function to move job from active state to wait.
+  Input:
+    KEYS[1]  active key
+    KEYS[2]  wait key
+    
+    KEYS[3]  stalled key
+    KEYS[4]  paused key
+    KEYS[5]  meta key
+    KEYS[6]  limiter key
+    KEYS[7]  prioritized key
+    KEYS[8]  marker key
+    KEYS[9]  event key
+
+    ARGV[1] job id
+    ARGV[2] lock token
+    ARGV[3] job id key
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/pushBackJobWithPriority"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/removeLock"
+
+local jobId = ARGV[1]
+local token = ARGV[2]
+local jobKey = ARGV[3]
+
+if rcall("EXISTS", jobKey) == 0 then
+  return -1
+end
+
+local errorCode = removeLock(jobKey, KEYS[3], token, jobId)
+if errorCode < 0 then
+  return errorCode
+end
+
+local metaKey = KEYS[5]
+local removed = rcall("LREM", KEYS[1], 1, jobId)
+if removed > 0 then
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[1], KEYS[2], KEYS[4])
+
+  local priority = tonumber(rcall("HGET", ARGV[3], "priority")) or 0
+
+  if priority > 0 then
+    pushBackJobWithPriority(KEYS[7], priority, jobId)
+  else
+    addJobInTargetList(target, KEYS[8], "RPUSH", isPausedOrMaxed, jobId)
+  end
+
+  local maxEvents = getOrSetMaxEvents(metaKey)
+
+  -- Emit waiting event
+  rcall("XADD", KEYS[9], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", jobId, "prev", "active")
+end
+
+local pttl = rcall("PTTL", KEYS[6])
+
+if pttl > 0 then
+  return pttl
+else
+  return 0
+end
diff --git a/node_modules/bullmq/dist/esm/commands/moveJobsToWait-8.lua b/node_modules/bullmq/dist/esm/commands/moveJobsToWait-8.lua
new file mode 100644
index 0000000..15e99c6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveJobsToWait-8.lua
@@ -0,0 +1,73 @@
+--[[
+  Move completed, failed or delayed jobs to wait.
+
+  Note: Does not support jobs with priorities.
+
+  Input:
+    KEYS[1] base key
+    KEYS[2] events stream
+    KEYS[3] state key (failed, completed, delayed)
+    KEYS[4] 'wait'
+    KEYS[5] 'paused'
+    KEYS[6] 'meta'
+    KEYS[7] 'active'
+    KEYS[8] 'marker'
+
+    ARGV[1] count
+    ARGV[2] timestamp
+    ARGV[3] prev state
+
+  Output:
+    1  means the operation is not completed
+    0  means the operation is completed
+]]
+local maxCount = tonumber(ARGV[1])
+local timestamp = tonumber(ARGV[2])
+
+local rcall = redis.call;
+
+-- Includes
+--- @include "includes/addBaseMarkerIfNeeded"
+--- @include "includes/batches"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+
+local metaKey = KEYS[6]
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[4], KEYS[5])
+
+local jobs = rcall('ZRANGEBYSCORE', KEYS[3], 0, timestamp, 'LIMIT', 0, maxCount)
+if (#jobs > 0) then
+
+    if ARGV[3] == "failed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "failedReason")
+        end
+    elseif ARGV[3] == "completed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "returnvalue")
+        end
+    end
+
+    local maxEvents = getOrSetMaxEvents(metaKey)
+
+    for i, key in ipairs(jobs) do
+        -- Emit waiting event
+        rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event",
+              "waiting", "jobId", key, "prev", ARGV[3]);
+    end
+
+    for from, to in batches(#jobs, 7000) do
+        rcall("ZREM", KEYS[3], unpack(jobs, from, to))
+        rcall("LPUSH", target, unpack(jobs, from, to))
+    end
+
+    addBaseMarkerIfNeeded(KEYS[8], isPausedOrMaxed)
+end
+
+maxCount = maxCount - #jobs
+
+if (maxCount <= 0) then return 1 end
+
+return 0
diff --git a/node_modules/bullmq/dist/esm/commands/moveStalledJobsToWait-8.lua b/node_modules/bullmq/dist/esm/commands/moveStalledJobsToWait-8.lua
new file mode 100644
index 0000000..e7e4a65
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveStalledJobsToWait-8.lua
@@ -0,0 +1,113 @@
+--[[
+  Move stalled jobs to wait.
+
+    Input:
+      KEYS[1] 'stalled' (SET)
+      KEYS[2] 'wait',   (LIST)
+      KEYS[3] 'active', (LIST)
+      KEYS[4] 'stalled-check', (KEY)
+      KEYS[5] 'meta', (KEY)
+      KEYS[6] 'paused', (LIST)
+      KEYS[7] 'marker'
+      KEYS[8] 'event stream' (STREAM)
+
+      ARGV[1]  Max stalled job count
+      ARGV[2]  queue.toKey('')
+      ARGV[3]  timestamp
+      ARGV[4]  max check time
+
+    Events:
+      'stalled' with stalled job id.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/batches"
+--- @include "includes/moveJobToWait"
+--- @include "includes/trimEvents"
+
+local stalledKey = KEYS[1]
+local waitKey = KEYS[2]
+local activeKey = KEYS[3]
+local stalledCheckKey = KEYS[4]
+local metaKey = KEYS[5]
+local pausedKey = KEYS[6]
+local markerKey = KEYS[7]
+local eventStreamKey = KEYS[8]
+local maxStalledJobCount = tonumber(ARGV[1])
+local queueKeyPrefix = ARGV[2]
+local timestamp = ARGV[3]
+local maxCheckTime = ARGV[4]
+
+if rcall("EXISTS", stalledCheckKey) == 1 then
+    return {}
+end
+
+rcall("SET", stalledCheckKey, timestamp, "PX", maxCheckTime)
+
+-- Trim events before emitting them to avoid trimming events emitted in this script
+trimEvents(metaKey, eventStreamKey)
+
+-- Move all stalled jobs to wait
+local stalling = rcall('SMEMBERS', stalledKey)
+local stalled = {}
+if (#stalling > 0) then
+    rcall('DEL', stalledKey)
+
+    -- Remove from active list
+    for i, jobId in ipairs(stalling) do
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            -- If the jobId is a delay marker ID we just remove it.
+            rcall("LREM", activeKey, 1, jobId)
+        else
+            local jobKey = queueKeyPrefix .. jobId
+
+            -- Check that the lock is also missing, then we can handle this job as really stalled.
+            if (rcall("EXISTS", jobKey .. ":lock") == 0) then
+                --  Remove from the active queue.
+                local removed = rcall("LREM", activeKey, 1, jobId)
+
+                if (removed > 0) then
+                    -- If this job has been stalled too many times, such as if it crashes the worker, then fail it.
+                    local stalledCount = rcall("HINCRBY", jobKey, "stc", 1)
+                    
+                    -- Check if this is a repeatable job by looking at job options
+                    local jobOpts = rcall("HGET", jobKey, "opts")
+                    local isRepeatableJob = false
+                    if jobOpts then
+                        local opts = cjson.decode(jobOpts)
+                        if opts and opts["repeat"] then
+                            isRepeatableJob = true
+                        end
+                    end
+                    
+                    -- Only fail job if it exceeds stall limit AND is not a repeatable job
+                    if stalledCount > maxStalledJobCount and not isRepeatableJob then
+                        local failedReason = "job stalled more than allowable limit"
+                        rcall("HSET", jobKey, "defa", failedReason)
+                    end
+                    
+                    moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey, jobId,
+                        "RPUSH")
+
+                    -- Emit the stalled event
+                    rcall("XADD", eventStreamKey, "*", "event", "stalled", "jobId", jobId)
+                    table.insert(stalled, jobId)
+                end
+            end
+        end
+    end
+end
+
+-- Mark potentially stalled jobs
+local active = rcall('LRANGE', activeKey, 0, -1)
+
+if (#active > 0) then
+    for from, to in batches(#active, 7000) do
+        rcall('SADD', stalledKey, unpack(active, from, to))
+    end
+end
+
+return stalled
diff --git a/node_modules/bullmq/dist/esm/commands/moveToActive-11.lua b/node_modules/bullmq/dist/esm/commands/moveToActive-11.lua
new file mode 100644
index 0000000..3eaa2f1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveToActive-11.lua
@@ -0,0 +1,97 @@
+--[[
+  Move next job to be processed to active, lock it and fetch its data. The job
+  may be delayed, in that case we need to move it to the delayed set instead.
+
+  This operation guarantees that the worker owns the job during the lock
+  expiration time. The worker is responsible of keeping the lock fresh
+  so that no other worker picks this job again.
+
+  Input:
+    KEYS[1] wait key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] stream events key
+    KEYS[5] stalled key
+
+    -- Rate limiting
+    KEYS[6] rate limiter key
+    KEYS[7] delayed key
+
+    -- Delayed jobs
+    KEYS[8] paused key
+    KEYS[9] meta key
+    KEYS[10] pc priority counter
+
+    -- Marker
+    KEYS[11] marker key
+
+    -- Arguments
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] opts
+
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+    opts - name - worker name
+]]
+local rcall = redis.call
+local waitKey = KEYS[1]
+local activeKey = KEYS[2]
+local eventStreamKey = KEYS[4]
+local rateLimiterKey = KEYS[6]
+local delayedKey = KEYS[7]
+local opts = cmsgpack.unpack(ARGV[3])
+
+-- Includes
+--- @include "includes/getNextDelayedTimestamp"
+--- @include "includes/getRateLimitTTL"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/moveJobFromPrioritizedToActive"
+--- @include "includes/prepareJobForProcessing"
+--- @include "includes/promoteDelayedJobs"
+
+local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration = getTargetQueueList(KEYS[9],
+    activeKey, waitKey, KEYS[8])
+
+-- Check if there are delayed jobs that we can move to wait.
+local markerKey = KEYS[11]
+promoteDelayedJobs(delayedKey, markerKey, target, KEYS[3], eventStreamKey, ARGV[1],
+                   ARGV[2], KEYS[10], isPausedOrMaxed)
+
+local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+
+-- Check if we are rate limited first.
+if expireTime > 0 then return {0, 0, expireTime, 0} end
+
+-- paused or maxed queue
+if isPausedOrMaxed then return {0, 0, 0, 0} end
+
+local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+
+-- no job ID, try non-blocking move from wait to active
+local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+
+-- Markers in waitlist DEPRECATED in v5: Will be completely removed in v6.
+if jobId and string.sub(jobId, 1, 2) == "0:" then
+    rcall("LREM", activeKey, 1, jobId)
+    jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+end
+
+if jobId then
+    return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                   maxJobs, limiterDuration, markerKey, opts)
+else
+    jobId = moveJobFromPrioritizedToActive(KEYS[3], activeKey, KEYS[10])
+    if jobId then
+        return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                       maxJobs, limiterDuration, markerKey, opts)
+    end
+end
+
+-- Return the timestamp for the next delayed job if any.
+local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+if nextTimestamp ~= nil then return {0, 0, 0, nextTimestamp} end
+
+return {0, 0, 0, 0}
diff --git a/node_modules/bullmq/dist/esm/commands/moveToDelayed-12.lua b/node_modules/bullmq/dist/esm/commands/moveToDelayed-12.lua
new file mode 100644
index 0000000..6e21448
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveToDelayed-12.lua
@@ -0,0 +1,97 @@
+--[[
+  Moves job from active to delayed set.
+
+  Input:
+    KEYS[1] marker key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] delayed key
+    KEYS[5] job key
+    KEYS[6] events stream
+    KEYS[7] meta key
+    KEYS[8] stalled key
+    KEYS[9] wait key
+    KEYS[10] rate limiter key
+    KEYS[11] paused key
+    KEYS[12] pc priority counter
+
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] queue token
+    ARGV[5] delay value
+    ARGV[6] skip attempt
+    ARGV[7] optional job fields to update
+    ARGV[8] fetch next?
+    ARGV[9] opts
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in active set.
+
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+--- @include "includes/fetchNextJob"
+--- @include "includes/getDelayedScore"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/removeLock"
+--- @include "includes/updateJobFields"
+
+local jobKey = KEYS[5]
+local markerKey = KEYS[1]
+local metaKey = KEYS[7]
+local token = ARGV[4] 
+if rcall("EXISTS", jobKey) == 1 then
+    local errorCode = removeLock(jobKey, KEYS[8], token, ARGV[3])
+    if errorCode < 0 then
+        return errorCode
+    end
+
+    updateJobFields(jobKey, ARGV[7])
+    
+    local delayedKey = KEYS[4]
+    local jobId = ARGV[3]
+    local delay = tonumber(ARGV[5])
+
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if numRemovedElements < 1 then return -3 end
+
+    local score, delayedTimestamp = getDelayedScore(delayedKey, ARGV[2], delay)
+
+    if ARGV[6] == "0" then
+        rcall("HINCRBY", jobKey, "atm", 1)
+    end
+
+    rcall("HSET", jobKey, "delay", ARGV[5])
+
+    local maxEvents = getOrSetMaxEvents(metaKey)
+
+    rcall("ZADD", delayedKey, score, jobId)
+    rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+          "jobId", jobId, "delay", delayedTimestamp)
+
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[8] == "1") then
+        local opts = cmsgpack.unpack(ARGV[9])
+        local result = fetchNextJob(KEYS[9], KEYS[2], KEYS[3], KEYS[6],
+            KEYS[10], KEYS[4], KEYS[11], metaKey, KEYS[12], markerKey,
+            ARGV[1], ARGV[2], opts)
+        if result and type(result[1]) == "table" then
+            return result
+        end
+    end
+
+    -- Check if we need to push a marker job to wake up sleeping workers.
+    addDelayMarkerIfNeeded(markerKey, delayedKey)
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/moveToFinished-14.lua b/node_modules/bullmq/dist/esm/commands/moveToFinished-14.lua
new file mode 100644
index 0000000..8cb324a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveToFinished-14.lua
@@ -0,0 +1,239 @@
+--[[
+  Move job from active to a finished status (completed or failed)
+  A job can only be moved to completed if it was active.
+  The job must be locked before it can be moved to a finished status,
+  and the lock must be released in this script.
+
+    Input:
+      KEYS[1] wait key
+      KEYS[2] active key
+      KEYS[3] prioritized key
+      KEYS[4] event stream key
+      KEYS[5] stalled key
+
+      -- Rate limiting
+      KEYS[6] rate limiter key
+      KEYS[7] delayed key
+
+      KEYS[8] paused key
+      KEYS[9] meta key
+      KEYS[10] pc priority counter
+
+      KEYS[11] completed/failed key
+      KEYS[12] jobId key
+      KEYS[13] metrics key
+      KEYS[14] marker key
+
+      ARGV[1]  jobId
+      ARGV[2]  timestamp
+      ARGV[3]  msg property returnvalue / failedReason
+      ARGV[4]  return value / failed reason
+      ARGV[5]  target (completed/failed)
+      ARGV[6]  fetch next?
+      ARGV[7]  keys prefix
+      ARGV[8]  opts
+      ARGV[9]  job fields to update
+
+      opts - token - lock token
+      opts - keepJobs
+      opts - lockDuration - lock duration in milliseconds
+      opts - attempts max attempts
+      opts - maxMetricsSize
+      opts - fpof - fail parent on fail
+      opts - cpof - continue parent on fail
+      opts - idof - ignore dependency on fail
+      opts - rdof - remove dependency on fail
+      opts - name - worker name
+
+    Output:
+      0 OK
+      -1 Missing key.
+      -2 Missing lock.
+      -3 Job not in active set
+      -4 Job has pending children
+      -6 Lock is not owned by this client
+      -9 Job has failed children
+
+    Events:
+      'completed/failed'
+]]
+local rcall = redis.call
+
+--- Includes
+--- @include "includes/collectMetrics"
+--- @include "includes/fetchNextJob"
+--- @include "includes/moveChildFromDependenciesIfNeeded"
+--- @include "includes/removeDeduplicationKeyIfNeededOnFinalization"
+--- @include "includes/removeJobKeys"
+--- @include "includes/removeJobsByMaxAge"
+--- @include "includes/removeJobsByMaxCount"
+--- @include "includes/removeLock"
+--- @include "includes/removeParentDependencyKey"
+--- @include "includes/requeueDeduplicatedJob"
+--- @include "includes/trimEvents"
+--- @include "includes/updateParentDepsIfNeeded"
+--- @include "includes/updateJobFields"
+
+local jobIdKey = KEYS[12]
+if rcall("EXISTS", jobIdKey) == 1 then -- Make sure job exists
+    -- Make sure it does not have pending dependencies
+    -- It must happen before removing lock
+    if ARGV[5] == "completed" then
+        if rcall("SCARD", jobIdKey .. ":dependencies") ~= 0 then
+            return -4
+        end
+
+        if rcall("ZCARD", jobIdKey .. ":unsuccessful") ~= 0 then
+            return -9
+        end
+    end
+
+    local opts = cmsgpack.unpack(ARGV[8])
+
+    local token = opts['token']
+
+    local errorCode = removeLock(jobIdKey, KEYS[5], token, ARGV[1])
+    if errorCode < 0 then
+        return errorCode
+    end
+
+    updateJobFields(jobIdKey, ARGV[9]);
+
+    local attempts = opts['attempts']
+    local maxMetricsSize = opts['maxMetricsSize']
+    local maxCount = opts['keepJobs']['count']
+    local maxAge = opts['keepJobs']['age']
+    local maxLimit = opts['keepJobs']['limit'] or 1000
+
+    local jobAttributes = rcall("HMGET", jobIdKey, "parentKey", "parent", "deid")
+    local parentKey = jobAttributes[1] or ""
+    local parentId = ""
+    local parentQueueKey = ""
+    if jobAttributes[2] then -- TODO: need to revisit this logic if it's still needed
+        local jsonDecodedParent = cjson.decode(jobAttributes[2])
+        parentId = jsonDecodedParent['id']
+        parentQueueKey = jsonDecodedParent['queueKey']
+    end
+
+    local jobId = ARGV[1]
+    local timestamp = ARGV[2]
+
+    -- Remove from active list (if not active we shall return error)
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+
+    if (numRemovedElements < 1) then
+        return -3
+    end
+
+    local eventStreamKey = KEYS[4]
+    local metaKey = KEYS[9]
+    -- Trim events before emitting them to avoid trimming events emitted in this script
+    trimEvents(metaKey, eventStreamKey)
+
+    local prefix = ARGV[7]
+
+    removeDeduplicationKeyIfNeededOnFinalization(prefix, jobAttributes[3], jobId)
+
+    -- Check if there is requeue data for this dedup ID (keepLastIfActive mode)
+    if jobAttributes[3] then
+      requeueDeduplicatedJob(prefix, jobAttributes[3], eventStreamKey,
+          metaKey, KEYS[2], KEYS[1], KEYS[8], KEYS[14], KEYS[3], KEYS[10],
+          KEYS[7], timestamp)
+    end
+
+    -- If job has a parent we need to
+    -- 1) remove this job id from parents dependencies
+    -- 2) move the job Id to parent "processed" set
+    -- 3) push the results into parent "results" list
+    -- 4) if parent's dependencies is empty, then move parent to "wait/paused". Note it may be a different queue!.
+    if parentId == "" and parentKey ~= "" then
+        parentId = getJobIdFromKey(parentKey)
+        parentQueueKey = getJobKeyPrefix(parentKey, ":" .. parentId)
+    end
+
+    if parentId ~= "" then
+        if ARGV[5] == "completed" then
+            local dependenciesSet = parentKey .. ":dependencies"
+            if rcall("SREM", dependenciesSet, jobIdKey) == 1 then
+                updateParentDepsIfNeeded(parentKey, parentQueueKey, dependenciesSet, parentId, jobIdKey, ARGV[4],
+                    timestamp)
+            end
+        else
+            moveChildFromDependenciesIfNeeded(jobAttributes[2], jobIdKey, ARGV[4], timestamp)
+        end
+    end
+
+    local attemptsMade = rcall("HINCRBY", jobIdKey, "atm", 1)
+
+    -- Remove job?
+    if maxCount ~= 0 then
+        local targetSet = KEYS[11]
+        -- Add to complete/failed set
+        rcall("ZADD", targetSet, timestamp, jobId)
+        rcall("HSET", jobIdKey, ARGV[3], ARGV[4], "finishedOn", timestamp)
+        -- "returnvalue" / "failedReason" and "finishedOn"
+
+        if ARGV[5] == "failed" then
+            rcall("HDEL", jobIdKey, "defa")
+        end
+
+        -- Remove old jobs?
+        if maxAge ~= nil then
+            removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+        end
+
+        if maxCount ~= nil and maxCount > 0 then
+            removeJobsByMaxCount(maxCount, targetSet, prefix)
+        end
+    else
+        removeJobKeys(jobIdKey)
+        if parentKey ~= "" then
+            -- TODO: when a child is removed when finished, result or failure in parent
+            -- must not be deleted, those value references should be deleted when the parent
+            -- is deleted
+            removeParentDependencyKey(jobIdKey, false, parentKey, jobAttributes[3])
+        end
+    end
+
+    rcall("XADD", eventStreamKey, "*", "event", ARGV[5], "jobId", jobId, ARGV[3], ARGV[4], "prev", "active")
+
+    if ARGV[5] == "failed" then
+        if tonumber(attemptsMade) >= tonumber(attempts) then
+            rcall("XADD", eventStreamKey, "*", "event", "retries-exhausted", "jobId", jobId, "attemptsMade",
+                attemptsMade)
+        end
+    end
+
+    -- Collect metrics
+    if maxMetricsSize ~= "" then
+        collectMetrics(KEYS[13], KEYS[13] .. ':data', maxMetricsSize, timestamp)
+    end
+
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[6] == "1") then
+        local result = fetchNextJob(KEYS[1], KEYS[2], KEYS[3], eventStreamKey,
+            KEYS[6], KEYS[7], KEYS[8], metaKey, KEYS[10], KEYS[14], prefix,
+            timestamp, opts)
+        if result then
+            return result
+        end
+    end
+
+    local waitLen = rcall("LLEN", KEYS[1])
+    if waitLen == 0 then
+        local activeLen = rcall("LLEN", KEYS[2])
+
+        if activeLen == 0 then
+            local prioritizedLen = rcall("ZCARD", KEYS[3])
+
+            if prioritizedLen == 0 then
+                rcall("XADD", eventStreamKey, "*", "event", "drained")
+            end
+        end
+    end
+
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/moveToWaitingChildren-7.lua b/node_modules/bullmq/dist/esm/commands/moveToWaitingChildren-7.lua
new file mode 100644
index 0000000..117668e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/moveToWaitingChildren-7.lua
@@ -0,0 +1,95 @@
+--[[
+  Moves job from active to waiting children set.
+
+  Input:
+    KEYS[1] active key
+    KEYS[2] wait-children key
+    KEYS[3] job key
+    KEYS[4] job dependencies key
+    KEYS[5] job unsuccessful key
+    KEYS[6] stalled key
+    KEYS[7] events key
+
+    ARGV[1] token
+    ARGV[2] child key
+    ARGV[3] timestamp
+    ARGV[4] jobId
+    ARGV[5] prefix
+
+  Output:
+    0 - OK
+    1 - There are not pending dependencies.
+   -1 - Missing job.
+   -2 - Missing lock
+   -3 - Job not in active set
+   -9 - Job has failed children
+]]
+local rcall = redis.call
+local activeKey = KEYS[1]
+local waitingChildrenKey = KEYS[2]
+local jobKey = KEYS[3]
+local jobDependenciesKey = KEYS[4]
+local jobUnsuccessfulKey = KEYS[5]
+local stalledKey = KEYS[6]
+local eventStreamKey = KEYS[7]
+local token = ARGV[1]
+local timestamp = ARGV[3]
+local jobId = ARGV[4]
+
+--- Includes
+--- @include "includes/removeLock"
+
+local function removeJobFromActive(activeKey, stalledKey, jobKey, jobId,
+    token)
+  local errorCode = removeLock(jobKey, stalledKey, token, jobId)
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  local numRemovedElements = rcall("LREM", activeKey, -1, jobId)
+
+  if numRemovedElements < 1 then
+    return -3
+  end
+
+  return 0
+end
+
+local function moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+    jobKey, jobId, timestamp, token)
+  local errorCode = removeJobFromActive(activeKey, stalledKey, jobKey, jobId, token)
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  local score = tonumber(timestamp)
+
+  rcall("ZADD", waitingChildrenKey, score, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting-children", "jobId", jobId, 'prev', 'active')
+
+  return 0
+end
+
+if rcall("EXISTS", jobKey) == 1 then
+  if rcall("ZCARD", jobUnsuccessfulKey) ~= 0 then
+    return -9
+  else
+    if ARGV[2] ~= "" then
+      if rcall("SISMEMBER", jobDependenciesKey, ARGV[2]) ~= 0 then
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+  
+      return 1
+    else
+      if rcall("SCARD", jobDependenciesKey) ~= 0 then 
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+  
+      return 1
+    end    
+  end
+end
+
+return -1
diff --git a/node_modules/bullmq/dist/esm/commands/obliterate-2.lua b/node_modules/bullmq/dist/esm/commands/obliterate-2.lua
new file mode 100644
index 0000000..aaa6ebf
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/obliterate-2.lua
@@ -0,0 +1,119 @@
+--[[
+  Completely obliterates a queue and all of its contents
+  This command completely destroys a queue including all of its jobs, current or past 
+  leaving no trace of its existence. Since this script needs to iterate to find all the job
+  keys, consider that this call may be slow for very large queues.
+
+  The queue needs to be "paused" or it will return an error
+  If the queue has currently active jobs then the script by default will return error,
+  however this behaviour can be overridden using the 'force' option.
+  
+  Input:
+    KEYS[1] meta
+    KEYS[2] base
+
+    ARGV[1] count
+    ARGV[2] force
+]]
+
+local maxCount = tonumber(ARGV[1])
+local baseKey = KEYS[2]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/removeJobs"
+--- @include "includes/removeListJobs"
+--- @include "includes/removeZSetJobs"
+
+local function removeLockKeys(keys)
+  for i, key in ipairs(keys) do
+    rcall("DEL", baseKey .. key .. ':lock')
+  end
+end
+
+-- 1) Check if paused, if not return with error.
+if rcall("HEXISTS", KEYS[1], "paused") ~= 1 then
+  return -1 -- Error, NotPaused
+end
+
+-- 2) Check if there are active jobs, if there are and not "force" return error.
+local activeKey = baseKey .. 'active'
+local activeJobs = getListItems(activeKey, maxCount)
+if (#activeJobs > 0) then
+  if(ARGV[2] == "") then 
+    return -2 -- Error, ExistActiveJobs
+  end
+end
+
+removeLockKeys(activeJobs)
+maxCount = removeJobs(activeJobs, true, baseKey, maxCount)
+rcall("LTRIM", activeKey, #activeJobs, -1)
+if(maxCount <= 0) then
+  return 1
+end
+
+local delayedKey = baseKey .. 'delayed'
+maxCount = removeZSetJobs(delayedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local repeatKey = baseKey .. 'repeat'
+local repeatJobsIds = getZSetItems(repeatKey, maxCount)
+for i, key in ipairs(repeatJobsIds) do
+  local jobKey = repeatKey .. ":" .. key
+  rcall("DEL", jobKey)
+end
+if(#repeatJobsIds > 0) then
+  for from, to in batches(#repeatJobsIds, 7000) do
+    rcall("ZREM", repeatKey, unpack(repeatJobsIds, from, to))
+  end
+end
+maxCount = maxCount - #repeatJobsIds
+if(maxCount <= 0) then
+  return 1
+end
+
+local completedKey = baseKey .. 'completed'
+maxCount = removeZSetJobs(completedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local pausedKey = baseKey .. 'paused'
+maxCount = removeListJobs(pausedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local prioritizedKey = baseKey .. 'prioritized'
+maxCount = removeZSetJobs(prioritizedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+local failedKey = baseKey .. 'failed'
+maxCount = removeZSetJobs(failedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+
+if(maxCount > 0) then
+  rcall("DEL",
+    baseKey .. 'events',
+    baseKey .. 'delay',
+    baseKey .. 'stalled-check',
+    baseKey .. 'stalled',
+    baseKey .. 'id',
+    baseKey .. 'pc',
+    baseKey .. 'marker',
+    baseKey .. 'meta',
+    baseKey .. 'metrics:completed',
+    baseKey .. 'metrics:completed:data',
+    baseKey .. 'metrics:failed',
+    baseKey .. 'metrics:failed:data')
+  return 0
+else
+  return 1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/paginate-1.lua b/node_modules/bullmq/dist/esm/commands/paginate-1.lua
new file mode 100644
index 0000000..25560f8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/paginate-1.lua
@@ -0,0 +1,49 @@
+--[[
+    Paginate a set or hash
+
+    Input:
+      KEYS[1] key pointing to the set or hash to be paginated.
+    
+      ARGV[1]  page start offset
+      ARGV[2]  page end offset (-1 for all the elements)
+      ARGV[3]  cursor
+      ARGV[4]  offset
+      ARGV[5]  max iterations
+      ARGV[6]  fetch jobs?
+      
+    Output:
+      [cursor, offset, items, numItems]
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/findPage"
+
+local key = KEYS[1]
+local scanCommand = "SSCAN"
+local countCommand = "SCARD"
+local type = rcall("TYPE", key)["ok"]
+
+if type == "none" then
+    return {0, 0, {}, 0}
+elseif type == "hash" then
+    scanCommand = "HSCAN"
+    countCommand = "HLEN"
+elseif type ~= "set" then
+    return
+        redis.error_reply("Pagination is only supported for sets and hashes.")
+end
+
+local numItems = rcall(countCommand, key)
+local startOffset = tonumber(ARGV[1])
+local endOffset = tonumber(ARGV[2])
+if endOffset == -1 then 
+  endOffset = numItems
+end
+local pageSize = (endOffset - startOffset) + 1
+
+local cursor, offset, items, jobs = findPage(key, scanCommand, startOffset,
+                                       pageSize, ARGV[3], tonumber(ARGV[4]),
+                                       tonumber(ARGV[5]), ARGV[6])
+
+return {cursor, offset, items, numItems, jobs}
diff --git a/node_modules/bullmq/dist/esm/commands/pause-7.lua b/node_modules/bullmq/dist/esm/commands/pause-7.lua
new file mode 100644
index 0000000..0ecf23c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/pause-7.lua
@@ -0,0 +1,42 @@
+--[[
+  Pauses or resumes a queue globally.
+
+  Input:
+    KEYS[1] 'wait' or 'paused'
+    KEYS[2] 'paused' or 'wait'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] events stream key
+    KEYS[6] 'delayed'
+    KEYS[7] 'marker'
+
+    ARGV[1] 'paused' or 'resumed'
+
+  Event:
+    publish paused or resumed event.
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addDelayMarkerIfNeeded"
+
+local markerKey = KEYS[7]
+local hasJobs = rcall("EXISTS", KEYS[1]) == 1
+--TODO: check this logic to be reused when changing a delay
+if hasJobs then rcall("RENAME", KEYS[1], KEYS[2]) end
+
+if ARGV[1] == "paused" then
+    rcall("HSET", KEYS[3], "paused", 1)
+    rcall("DEL", markerKey)
+else
+    rcall("HDEL", KEYS[3], "paused")
+
+    if hasJobs or rcall("ZCARD", KEYS[4]) > 0 then
+        -- Add marker if there are waiting or priority jobs
+        rcall("ZADD", markerKey, 0, "0")
+    else
+        addDelayMarkerIfNeeded(markerKey, KEYS[6])
+    end
+end
+
+rcall("XADD", KEYS[5], "*", "event", ARGV[1]);
diff --git a/node_modules/bullmq/dist/esm/commands/promote-9.lua b/node_modules/bullmq/dist/esm/commands/promote-9.lua
new file mode 100644
index 0000000..e6f03a7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/promote-9.lua
@@ -0,0 +1,61 @@
+--[[
+  Promotes a job that is currently "delayed" to the "waiting" state
+
+    Input:
+      KEYS[1] 'delayed'
+      KEYS[2] 'wait'
+      KEYS[3] 'paused'
+      KEYS[4] 'meta'
+      KEYS[5] 'prioritized'
+      KEYS[6] 'active'
+      KEYS[7] 'pc' priority counter
+      KEYS[8] 'event stream'
+      KEYS[9] 'marker'
+
+      ARGV[1]  queue.toKey('')
+      ARGV[2]  jobId
+
+    Output:
+       0 - OK
+      -3 - Job not in delayed zset.
+
+    Events:
+      'waiting'
+]]
+local rcall = redis.call
+local jobId = ARGV[2]
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getTargetQueueList"
+
+if rcall("ZREM", KEYS[1], jobId) == 1 then
+    local jobKey = ARGV[1] .. jobId
+    local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+    local metaKey = KEYS[4]
+    local markerKey = KEYS[9]
+
+    -- Remove delayed "marker" from the wait list if there is any.
+    -- Since we are adding a job we do not need the marker anymore.
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[6], KEYS[2], KEYS[3])
+    local marker = rcall("LINDEX", target, 0)
+    if marker and string.sub(marker, 1, 2) == "0:" then rcall("LPOP", target) end
+
+    if priority == 0 then
+        -- LIFO or FIFO
+        addJobInTargetList(target, markerKey, "LPUSH", isPausedOrMaxed, jobId)
+    else
+        addJobWithPriority(markerKey, KEYS[5], priority, jobId, KEYS[7], isPausedOrMaxed)
+    end
+
+    rcall("XADD", KEYS[8], "*", "event", "waiting", "jobId", jobId, "prev",
+          "delayed");
+
+    rcall("HSET", jobKey, "delay", 0)
+
+    return 0
+else
+    return -3
+end
diff --git a/node_modules/bullmq/dist/esm/commands/releaseLock-1.lua b/node_modules/bullmq/dist/esm/commands/releaseLock-1.lua
new file mode 100644
index 0000000..1de8fac
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/releaseLock-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Release lock
+
+    Input:
+      KEYS[1] 'lock',
+    
+      ARGV[1]  token
+      ARGV[2]  lock duration in milliseconds
+      
+    Output:
+      "OK" if lock extended successfully.
+]]
+local rcall = redis.call
+
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  return rcall("DEL", KEYS[1])
+else
+  return 0
+end
diff --git a/node_modules/bullmq/dist/esm/commands/removeChildDependency-1.lua b/node_modules/bullmq/dist/esm/commands/removeChildDependency-1.lua
new file mode 100644
index 0000000..5caa9aa
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeChildDependency-1.lua
@@ -0,0 +1,34 @@
+--[[
+  Break parent-child dependency by removing
+  child reference from parent
+
+  Input:
+    KEYS[1] 'key' prefix,
+
+    ARGV[1] job key
+    ARGV[2] parent key
+
+    Output:
+       0  - OK
+       1  - There is not relationship.
+      -1  - Missing job key
+      -5  - Missing parent key
+]]
+local rcall = redis.call
+local jobKey = ARGV[1]
+local parentKey = ARGV[2]
+
+-- Includes
+--- @include "includes/removeParentDependencyKey"
+
+if rcall("EXISTS", jobKey) ~= 1 then return -1 end
+
+if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+
+if removeParentDependencyKey(jobKey, false, parentKey, KEYS[1], nil) then
+  rcall("HDEL", jobKey, "parentKey", "parent")
+
+  return 0
+else
+  return 1
+end
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/esm/commands/removeDeduplicationKey-1.lua b/node_modules/bullmq/dist/esm/commands/removeDeduplicationKey-1.lua
new file mode 100644
index 0000000..243c11c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeDeduplicationKey-1.lua
@@ -0,0 +1,22 @@
+--[[
+  Remove deduplication key if it matches the job id.
+
+  Input:
+    KEYS[1] deduplication key
+
+    ARGV[1] job id
+
+  Output:
+    0 - false
+    1 - true
+]]
+local rcall = redis.call
+local deduplicationKey = KEYS[1]
+local jobId = ARGV[1]
+
+local currentJobId = rcall('GET', deduplicationKey)
+if currentJobId and currentJobId == jobId then
+  return rcall("DEL", deduplicationKey)
+end
+
+return 0
diff --git a/node_modules/bullmq/dist/esm/commands/removeJob-2.lua b/node_modules/bullmq/dist/esm/commands/removeJob-2.lua
new file mode 100644
index 0000000..ba7d683
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeJob-2.lua
@@ -0,0 +1,44 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] repeat key
+
+      ARGV[1] jobId
+      ARGV[2] remove children
+      ARGV[3] queue prefix
+
+    Events:
+      'removed'
+]]
+
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/isJobSchedulerJob"
+--- @include "includes/isLocked"
+--- @include "includes/removeJobWithChildren"
+
+local jobId = ARGV[1]
+local shouldRemoveChildren = ARGV[2]
+local prefix = ARGV[3]
+local jobKey = KEYS[1]
+local repeatKey = KEYS[2]
+
+if isJobSchedulerJob(jobId, jobKey, repeatKey) then
+    return -8
+end
+
+if not isLocked(prefix, jobId, shouldRemoveChildren) then
+    local options = {
+        removeChildren = shouldRemoveChildren == "1",
+        ignoreProcessed = false,
+        ignoreLocked = false
+    }
+
+    removeJobWithChildren(prefix, jobId, nil, options)
+    return 1
+end
+return 0
diff --git a/node_modules/bullmq/dist/esm/commands/removeJobScheduler-3.lua b/node_modules/bullmq/dist/esm/commands/removeJobScheduler-3.lua
new file mode 100644
index 0000000..921e351
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeJobScheduler-3.lua
@@ -0,0 +1,43 @@
+
+--[[
+  Removes a job scheduler and its next scheduled job.
+  Input:
+    KEYS[1] job schedulers key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+
+    ARGV[1] job scheduler id
+    ARGV[2] prefix key
+
+  Output:
+    0 - OK
+    1 - Missing repeat job
+
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/removeJobKeys"
+
+local jobSchedulerId = ARGV[1]
+local prefix = ARGV[2]
+
+local millis = rcall("ZSCORE", KEYS[1], jobSchedulerId)
+
+if millis then
+  -- Delete next programmed job.
+  local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], delayedJobId) == 1) then
+    removeJobKeys(prefix .. delayedJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", delayedJobId, "prev", "delayed")
+  end
+end
+
+if(rcall("ZREM", KEYS[1], jobSchedulerId) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. jobSchedulerId)
+  return 0
+end
+
+return 1
diff --git a/node_modules/bullmq/dist/esm/commands/removeOrphanedJobs-1.lua b/node_modules/bullmq/dist/esm/commands/removeOrphanedJobs-1.lua
new file mode 100644
index 0000000..5d89e62
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeOrphanedJobs-1.lua
@@ -0,0 +1,77 @@
+--[[
+  Removes orphaned job keys that exist in Redis but are not referenced
+  in any queue state set. Checks each candidate atomically.
+
+  Input:
+    KEYS[1]  base prefix key including trailing colon (e.g. bull:queueName:)
+
+    ARGV[1]  number of state key suffixes
+    ARGV[2 .. 1+N]  state key suffixes (e.g. active, wait, completed, ...)
+    ARGV[2+N]  number of job sub-key suffixes
+    ARGV[3+N .. 2+N+M]  job sub-key suffixes (e.g. logs, dependencies, ...)
+    ARGV[3+N+M .. end]  candidate job IDs to check
+
+  Output:
+    number of removed jobs
+]]
+local rcall = redis.call
+local basePrefix = KEYS[1]
+
+-- Parse state key suffixes and cache their full key names + types.
+local stateKeyCount = tonumber(ARGV[1])
+local stateKeys = {}
+local stateKeyTypes = {}
+for i = 1, stateKeyCount do
+  local fullKey = basePrefix .. ARGV[1 + i]
+  stateKeys[i] = fullKey
+  stateKeyTypes[i] = rcall('TYPE', fullKey)['ok']
+end
+
+-- Parse job sub-key suffixes.
+local subKeyCountIdx = 2 + stateKeyCount
+local subKeyCount = tonumber(ARGV[subKeyCountIdx])
+local subKeySuffixes = {}
+for i = 1, subKeyCount do
+  subKeySuffixes[i] = ARGV[subKeyCountIdx + i]
+end
+
+-- Process candidate job IDs.
+local candidateStart = subKeyCountIdx + subKeyCount + 1
+local removedCount = 0
+
+for c = candidateStart, #ARGV do
+  local jobId = ARGV[c]
+  local found = false
+
+  for i = 1, stateKeyCount do
+    local kt = stateKeyTypes[i]
+    if kt == 'list' then
+      if rcall('LPOS', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'zset' then
+      if rcall('ZSCORE', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'set' then
+      if rcall('SISMEMBER', stateKeys[i], jobId) == 1 then
+        found = true
+        break
+      end
+    end
+  end
+
+  if not found then
+    local jobKey = basePrefix .. jobId
+    local keysToDelete = { jobKey }
+    for _, suffix in ipairs(subKeySuffixes) do
+      keysToDelete[#keysToDelete + 1] = jobKey .. ':' .. suffix
+    end
+    rcall('DEL', unpack(keysToDelete))
+    removedCount = removedCount + 1
+  end
+end
+
+return removedCount
diff --git a/node_modules/bullmq/dist/esm/commands/removeRepeatable-3.lua b/node_modules/bullmq/dist/esm/commands/removeRepeatable-3.lua
new file mode 100644
index 0000000..34f8ce0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeRepeatable-3.lua
@@ -0,0 +1,58 @@
+
+--[[
+  Removes a repeatable job
+  Input:
+    KEYS[1] repeat jobs key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+
+    ARGV[1] old repeat job id
+    ARGV[2] options concat
+    ARGV[3] repeat job key
+    ARGV[4] prefix key
+
+  Output:
+    0 - OK
+    1 - Missing repeat job
+
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+local millis = rcall("ZSCORE", KEYS[1], ARGV[2])
+
+-- Includes
+--- @include "includes/removeJobKeys"
+
+-- legacy removal TODO: remove in next breaking change
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = ARGV[1] .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed");
+  end
+end
+
+if(rcall("ZREM", KEYS[1], ARGV[2]) == 1) then
+  return 0
+end
+
+-- new removal
+millis = rcall("ZSCORE", KEYS[1], ARGV[3])
+
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = "repeat:" .. ARGV[3] .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed")
+  end
+end
+
+if(rcall("ZREM", KEYS[1], ARGV[3]) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. ARGV[3])
+  return 0
+end
+
+return 1
diff --git a/node_modules/bullmq/dist/esm/commands/removeUnprocessedChildren-2.lua b/node_modules/bullmq/dist/esm/commands/removeUnprocessedChildren-2.lua
new file mode 100644
index 0000000..c3ee2b0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/removeUnprocessedChildren-2.lua
@@ -0,0 +1,31 @@
+--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] meta key
+      
+      ARGV[1] prefix
+      ARGV[2] jobId
+
+    Events:
+      'removed' for every children removed
+]]
+
+-- Includes
+--- @include "includes/removeJobWithChildren"
+
+local prefix = ARGV[1]
+local jobId = ARGV[2]
+
+local jobKey = KEYS[1]
+local metaKey = KEYS[2]
+
+local options = {
+  removeChildren = "1",
+  ignoreProcessed = true,
+  ignoreLocked = true
+}
+
+removeJobChildren(prefix, jobKey, options) 
diff --git a/node_modules/bullmq/dist/esm/commands/reprocessJob-8.lua b/node_modules/bullmq/dist/esm/commands/reprocessJob-8.lua
new file mode 100644
index 0000000..583c54e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/reprocessJob-8.lua
@@ -0,0 +1,77 @@
+--[[
+  Attempts to reprocess a job
+
+  Input:
+    KEYS[1] job key
+    KEYS[2] events stream
+    KEYS[3] job state
+    KEYS[4] wait key
+    KEYS[5] meta
+    KEYS[6] paused key
+    KEYS[7] active key
+    KEYS[8] marker key
+
+    ARGV[1] job.id
+    ARGV[2] (job.opts.lifo ? 'R' : 'L') + 'PUSH'
+    ARGV[3] propVal - failedReason/returnvalue
+    ARGV[4] prev state - failed/completed
+    ARGV[5] reset attemptsMade - "1" or "0"
+    ARGV[6] reset attemptsStarted - "1" or "0"
+
+  Output:
+     1 means the operation was a success
+    -1 means the job does not exist
+    -3 means the job was not found in the expected set.
+]]
+local rcall = redis.call;
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+
+local jobKey = KEYS[1]
+if rcall("EXISTS", jobKey) == 1 then
+  local jobId = ARGV[1]
+  if (rcall("ZREM", KEYS[3], jobId) == 1) then
+    local attributesToRemove = {}
+
+    if ARGV[5] == "1" then
+      table.insert(attributesToRemove, "atm")
+    end
+
+    if ARGV[6] == "1" then
+      table.insert(attributesToRemove, "ats")
+    end
+
+    rcall("HDEL", jobKey, "finishedOn", "processedOn", ARGV[3], unpack(attributesToRemove))
+
+    local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[7], KEYS[4], KEYS[6])
+    addJobInTargetList(target, KEYS[8], ARGV[2], isPausedOrMaxed, jobId)
+
+    local parentKey = rcall("HGET", jobKey, "parentKey")
+
+    if parentKey and rcall("EXISTS", parentKey) == 1 then
+      if ARGV[4] == "failed" then
+        if rcall("ZREM", parentKey .. ":unsuccessful", jobKey) == 1 or
+          rcall("ZREM", parentKey .. ":failed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      else
+        if rcall("HDEL", parentKey .. ":processed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      end
+    end
+
+    local maxEvents = getOrSetMaxEvents(KEYS[5])
+    -- Emit waiting event
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId, "prev", ARGV[4]);
+    return 1
+  else
+    return -3
+  end
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/retryJob-11.lua b/node_modules/bullmq/dist/esm/commands/retryJob-11.lua
new file mode 100644
index 0000000..6382168
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/retryJob-11.lua
@@ -0,0 +1,88 @@
+--[[
+  Retries a failed job by moving it back to the wait queue.
+
+    Input:
+      KEYS[1]  'active',
+      KEYS[2]  'wait'
+      KEYS[3]  'paused'
+      KEYS[4]  job key
+      KEYS[5]  'meta'
+      KEYS[6]  events stream
+      KEYS[7]  delayed key
+      KEYS[8]  prioritized key
+      KEYS[9]  'pc' priority counter
+      KEYS[10] 'marker'
+      KEYS[11] 'stalled'
+
+      ARGV[1]  key prefix
+      ARGV[2]  timestamp
+      ARGV[3]  pushCmd
+      ARGV[4]  jobId
+      ARGV[5]  token
+      ARGV[6]  optional job fields to update
+
+    Events:
+      'waiting'
+
+    Output:
+     0  - OK
+     -1 - Missing key
+     -2 - Missing lock
+     -3 - Job not in active set
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/addJobInTargetList"
+--- @include "includes/addJobWithPriority"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getTargetQueueList"
+--- @include "includes/isQueuePausedOrMaxed"
+--- @include "includes/promoteDelayedJobs"
+--- @include "includes/removeLock"
+--- @include "includes/updateJobFields"
+
+local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[1], KEYS[2], KEYS[3])
+local markerKey = KEYS[10]
+
+-- Check if there are delayed jobs that we can move to wait.
+-- test example: when there are delayed jobs between retries
+promoteDelayedJobs(KEYS[7], markerKey, target, KEYS[8], KEYS[6], ARGV[1], ARGV[2], KEYS[9], isPausedOrMaxed)
+
+local jobKey = KEYS[4]
+
+if rcall("EXISTS", jobKey) == 1 then
+  local errorCode = removeLock(jobKey, KEYS[11], ARGV[5], ARGV[4]) 
+  if errorCode < 0 then
+    return errorCode
+  end
+
+  updateJobFields(jobKey, ARGV[6])
+
+  local numRemovedElements = rcall("LREM", KEYS[1], -1, ARGV[4])
+  if (numRemovedElements < 1) then return -3 end
+
+  local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+
+  --need to re-evaluate after removing job from active
+  isPausedOrMaxed = isQueuePausedOrMaxed(KEYS[5], KEYS[1])
+
+  -- Standard or priority add
+  if priority == 0 then
+    addJobInTargetList(target, markerKey, ARGV[3], isPausedOrMaxed, ARGV[4])
+  else
+    addJobWithPriority(markerKey, KEYS[8], priority, ARGV[4], KEYS[9], isPausedOrMaxed)
+  end
+
+  rcall("HINCRBY", jobKey, "atm", 1)
+
+  local maxEvents = getOrSetMaxEvents(KEYS[5])
+
+  -- Emit waiting event
+  rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", ARGV[4], "prev", "active")
+
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/saveStacktrace-1.lua b/node_modules/bullmq/dist/esm/commands/saveStacktrace-1.lua
new file mode 100644
index 0000000..52c91b6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/saveStacktrace-1.lua
@@ -0,0 +1,19 @@
+--[[
+  Save stacktrace and failedReason.
+  Input:
+    KEYS[1] job key
+    ARGV[1]  stacktrace
+    ARGV[2]  failedReason
+  Output:
+     0 - OK
+    -1 - Missing key
+]]
+local rcall = redis.call
+
+if rcall("EXISTS", KEYS[1]) == 1 then
+  rcall("HMSET", KEYS[1], "stacktrace", ARGV[1], "failedReason", ARGV[2])
+
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/updateData-1.lua b/node_modules/bullmq/dist/esm/commands/updateData-1.lua
new file mode 100644
index 0000000..7e57bf8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/updateData-1.lua
@@ -0,0 +1,20 @@
+--[[
+  Update job data
+
+  Input:
+    KEYS[1] Job id key
+
+    ARGV[1] data
+
+  Output:
+    0 - OK
+   -1 - Missing job.
+]]
+local rcall = redis.call
+
+if rcall("EXISTS",KEYS[1]) == 1 then -- // Make sure job exists
+  rcall("HSET", KEYS[1], "data", ARGV[1])
+  return 0
+else
+  return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/updateJobScheduler-12.lua b/node_modules/bullmq/dist/esm/commands/updateJobScheduler-12.lua
new file mode 100644
index 0000000..1a5e87a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/updateJobScheduler-12.lua
@@ -0,0 +1,126 @@
+--[[
+  Updates a job scheduler and adds next delayed job
+
+  Input:
+    KEYS[1]  'repeat' key
+    KEYS[2]  'delayed'
+    KEYS[3]  'wait' key
+    KEYS[4]  'paused' key
+    KEYS[5]  'meta'
+    KEYS[6]  'prioritized' key
+    KEYS[7]  'marker',
+    KEYS[8]  'id'
+    KEYS[9]  events stream key
+    KEYS[10] 'pc' priority counter
+    KEYS[11] producer key
+    KEYS[12] 'active' key
+
+    ARGV[1] next milliseconds
+    ARGV[2] jobs scheduler id
+    ARGV[3] Json stringified delayed data
+    ARGV[4] msgpacked delayed opts
+    ARGV[5] timestamp
+    ARGV[6] prefix key
+    ARGV[7] producer id
+
+    Output:
+      next delayed job id  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local nextMillis = tonumber(ARGV[1])
+local jobSchedulerId = ARGV[2]
+local timestamp = tonumber(ARGV[5])
+local prefixKey = ARGV[6]
+local producerId = ARGV[7]
+local jobOpts = cmsgpack.unpack(ARGV[4])
+
+-- Includes
+--- @include "includes/addJobFromScheduler"
+--- @include "includes/getOrSetMaxEvents"
+--- @include "includes/getJobSchedulerEveryNextMillis"
+
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+
+-- Validate that scheduler exists.
+-- If it does not exist we should not iterate anymore.
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+
+    local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+    local schedulerAttributes = rcall("HMGET", schedulerKey, "name", "data", "every", "startDate", "offset")
+
+    local every = tonumber(schedulerAttributes[3])
+    local now = tonumber(timestamp)
+
+    -- If every is not found in scheduler attributes, try to get it from job options
+    if not every and jobOpts['repeat'] and jobOpts['repeat']['every'] then
+        every = tonumber(jobOpts['repeat']['every'])
+    end
+
+    if every then
+        local startDate = schedulerAttributes[4]
+        local jobOptsOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+        local offset = schedulerAttributes[5] or jobOptsOffset or 0
+        local newOffset
+
+        nextMillis, newOffset = getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+
+        if not offset then
+            rcall("HSET", schedulerKey, "offset", newOffset)
+            jobOpts['repeat']['offset'] = newOffset
+        end
+    end
+
+    local nextDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+    local nextDelayedJobKey = schedulerKey .. ":" .. nextMillis
+
+    local currentDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+
+    if producerId == currentDelayedJobId then
+        local eventsKey = KEYS[9]
+        local maxEvents = getOrSetMaxEvents(metaKey)
+
+        if rcall("EXISTS", nextDelayedJobKey) ~= 1 then
+
+            rcall("ZADD", repeatKey, nextMillis, jobSchedulerId)
+            rcall("HINCRBY", schedulerKey, "ic", 1)
+
+            rcall("INCR", KEYS[8])
+
+            -- TODO: remove this workaround in next breaking change,
+            -- all job-schedulers must save job data
+            local templateData = schedulerAttributes[2] or ARGV[3]
+
+            if templateData and templateData ~= '{}' then
+                rcall("HSET", schedulerKey, "data", templateData)
+            end
+
+            local delay = nextMillis - now
+
+            -- Fast Clamp delay to minimum of 0
+            if delay < 0 then
+                delay = 0
+            end
+
+            jobOpts["delay"] = delay
+
+            addJobFromScheduler(nextDelayedJobKey, nextDelayedJobId, jobOpts, waitKey, pausedKey, KEYS[12], metaKey,
+                prioritizedKey, KEYS[10], delayedKey, KEYS[7], eventsKey, schedulerAttributes[1], maxEvents, ARGV[5],
+                templateData or '{}', jobSchedulerId, delay)
+
+            -- TODO: remove this workaround in next breaking change
+            if KEYS[11] ~= "" then
+                rcall("HSET", KEYS[11], "nrjid", nextDelayedJobId)
+            end
+
+            return nextDelayedJobId .. "" -- convert to string
+        else
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "duplicated", "jobId", nextDelayedJobId)
+        end
+    end
+end
diff --git a/node_modules/bullmq/dist/esm/commands/updateProgress-3.lua b/node_modules/bullmq/dist/esm/commands/updateProgress-3.lua
new file mode 100644
index 0000000..185f6b7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/updateProgress-3.lua
@@ -0,0 +1,33 @@
+--[[
+  Update job progress
+
+  Input:
+    KEYS[1] Job id key
+    KEYS[2] event stream key
+    KEYS[3] meta key
+
+    ARGV[1] id
+    ARGV[2] progress
+
+  Output:
+     0 - OK
+    -1 - Missing job.
+
+  Event:
+    progress(jobId, progress)
+]]
+local rcall = redis.call
+
+-- Includes
+--- @include "includes/getOrSetMaxEvents"
+
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+    local maxEvents = getOrSetMaxEvents(KEYS[3])
+
+    rcall("HSET", KEYS[1], "progress", ARGV[2])
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "progress",
+          "jobId", ARGV[1], "data", ARGV[2]);
+    return 0
+else
+    return -1
+end
diff --git a/node_modules/bullmq/dist/esm/commands/updateRepeatableJobMillis-1.lua b/node_modules/bullmq/dist/esm/commands/updateRepeatableJobMillis-1.lua
new file mode 100644
index 0000000..b6104ff
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/commands/updateRepeatableJobMillis-1.lua
@@ -0,0 +1,28 @@
+--[[
+  Adds a repeatable job
+
+    Input:
+      KEYS[1] 'repeat' key
+
+      ARGV[1] next milliseconds
+      ARGV[2] custom key
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local nextMillis = ARGV[1]
+local customKey = ARGV[2]
+local legacyCustomKey = ARGV[3]
+
+if rcall("ZSCORE", repeatKey, customKey) then
+    rcall("ZADD", repeatKey, nextMillis, customKey)
+    return customKey
+elseif rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+    rcall("ZADD", repeatKey, nextMillis, legacyCustomKey)
+    return legacyCustomKey
+end
+
+return ''
diff --git a/node_modules/bullmq/dist/esm/enums/child-command.d.ts b/node_modules/bullmq/dist/esm/enums/child-command.d.ts
new file mode 100644
index 0000000..785cfb6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/child-command.d.ts
@@ -0,0 +1,11 @@
+export declare enum ChildCommand {
+    Init = 0,
+    Start = 1,
+    Stop = 2,
+    GetChildrenValuesResponse = 3,
+    GetIgnoredChildrenFailuresResponse = 4,
+    GetDependenciesCountResponse = 5,
+    MoveToWaitingChildrenResponse = 6,
+    Cancel = 7,
+    GetDependenciesResponse = 8
+}
diff --git a/node_modules/bullmq/dist/esm/enums/child-command.js b/node_modules/bullmq/dist/esm/enums/child-command.js
new file mode 100644
index 0000000..9de380e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/child-command.js
@@ -0,0 +1,12 @@
+export var ChildCommand;
+(function (ChildCommand) {
+    ChildCommand[ChildCommand["Init"] = 0] = "Init";
+    ChildCommand[ChildCommand["Start"] = 1] = "Start";
+    ChildCommand[ChildCommand["Stop"] = 2] = "Stop";
+    ChildCommand[ChildCommand["GetChildrenValuesResponse"] = 3] = "GetChildrenValuesResponse";
+    ChildCommand[ChildCommand["GetIgnoredChildrenFailuresResponse"] = 4] = "GetIgnoredChildrenFailuresResponse";
+    ChildCommand[ChildCommand["GetDependenciesCountResponse"] = 5] = "GetDependenciesCountResponse";
+    ChildCommand[ChildCommand["MoveToWaitingChildrenResponse"] = 6] = "MoveToWaitingChildrenResponse";
+    ChildCommand[ChildCommand["Cancel"] = 7] = "Cancel";
+    ChildCommand[ChildCommand["GetDependenciesResponse"] = 8] = "GetDependenciesResponse";
+})(ChildCommand || (ChildCommand = {}));
diff --git a/node_modules/bullmq/dist/esm/enums/error-code.d.ts b/node_modules/bullmq/dist/esm/enums/error-code.d.ts
new file mode 100644
index 0000000..8d979d2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/error-code.d.ts
@@ -0,0 +1,13 @@
+export declare enum ErrorCode {
+    JobNotExist = -1,
+    JobLockNotExist = -2,
+    JobNotInState = -3,
+    JobPendingChildren = -4,
+    ParentJobNotExist = -5,
+    JobLockMismatch = -6,
+    ParentJobCannotBeReplaced = -7,
+    JobBelongsToJobScheduler = -8,
+    JobHasFailedChildren = -9,
+    SchedulerJobIdCollision = -10,
+    SchedulerJobSlotsBusy = -11
+}
diff --git a/node_modules/bullmq/dist/esm/enums/error-code.js b/node_modules/bullmq/dist/esm/enums/error-code.js
new file mode 100644
index 0000000..4dc06fe
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/error-code.js
@@ -0,0 +1,14 @@
+export var ErrorCode;
+(function (ErrorCode) {
+    ErrorCode[ErrorCode["JobNotExist"] = -1] = "JobNotExist";
+    ErrorCode[ErrorCode["JobLockNotExist"] = -2] = "JobLockNotExist";
+    ErrorCode[ErrorCode["JobNotInState"] = -3] = "JobNotInState";
+    ErrorCode[ErrorCode["JobPendingChildren"] = -4] = "JobPendingChildren";
+    ErrorCode[ErrorCode["ParentJobNotExist"] = -5] = "ParentJobNotExist";
+    ErrorCode[ErrorCode["JobLockMismatch"] = -6] = "JobLockMismatch";
+    ErrorCode[ErrorCode["ParentJobCannotBeReplaced"] = -7] = "ParentJobCannotBeReplaced";
+    ErrorCode[ErrorCode["JobBelongsToJobScheduler"] = -8] = "JobBelongsToJobScheduler";
+    ErrorCode[ErrorCode["JobHasFailedChildren"] = -9] = "JobHasFailedChildren";
+    ErrorCode[ErrorCode["SchedulerJobIdCollision"] = -10] = "SchedulerJobIdCollision";
+    ErrorCode[ErrorCode["SchedulerJobSlotsBusy"] = -11] = "SchedulerJobSlotsBusy";
+})(ErrorCode || (ErrorCode = {}));
diff --git a/node_modules/bullmq/dist/esm/enums/index.d.ts b/node_modules/bullmq/dist/esm/enums/index.d.ts
new file mode 100644
index 0000000..3cab38d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/index.d.ts
@@ -0,0 +1,5 @@
+export * from './child-command';
+export * from './error-code';
+export * from './parent-command';
+export * from './metrics-time';
+export * from './telemetry-attributes';
diff --git a/node_modules/bullmq/dist/esm/enums/index.js b/node_modules/bullmq/dist/esm/enums/index.js
new file mode 100644
index 0000000..3cab38d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/index.js
@@ -0,0 +1,5 @@
+export * from './child-command';
+export * from './error-code';
+export * from './parent-command';
+export * from './metrics-time';
+export * from './telemetry-attributes';
diff --git a/node_modules/bullmq/dist/esm/enums/metrics-time.d.ts b/node_modules/bullmq/dist/esm/enums/metrics-time.d.ts
new file mode 100644
index 0000000..661d971
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/metrics-time.d.ts
@@ -0,0 +1,10 @@
+export declare enum MetricsTime {
+    ONE_MINUTE = 1,
+    FIVE_MINUTES = 5,
+    FIFTEEN_MINUTES = 15,
+    THIRTY_MINUTES = 30,
+    ONE_HOUR = 60,
+    ONE_WEEK = 10080,
+    TWO_WEEKS = 20160,
+    ONE_MONTH = 80640
+}
diff --git a/node_modules/bullmq/dist/esm/enums/metrics-time.js b/node_modules/bullmq/dist/esm/enums/metrics-time.js
new file mode 100644
index 0000000..f0d417e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/metrics-time.js
@@ -0,0 +1,11 @@
+export var MetricsTime;
+(function (MetricsTime) {
+    MetricsTime[MetricsTime["ONE_MINUTE"] = 1] = "ONE_MINUTE";
+    MetricsTime[MetricsTime["FIVE_MINUTES"] = 5] = "FIVE_MINUTES";
+    MetricsTime[MetricsTime["FIFTEEN_MINUTES"] = 15] = "FIFTEEN_MINUTES";
+    MetricsTime[MetricsTime["THIRTY_MINUTES"] = 30] = "THIRTY_MINUTES";
+    MetricsTime[MetricsTime["ONE_HOUR"] = 60] = "ONE_HOUR";
+    MetricsTime[MetricsTime["ONE_WEEK"] = 10080] = "ONE_WEEK";
+    MetricsTime[MetricsTime["TWO_WEEKS"] = 20160] = "TWO_WEEKS";
+    MetricsTime[MetricsTime["ONE_MONTH"] = 80640] = "ONE_MONTH";
+})(MetricsTime || (MetricsTime = {}));
diff --git a/node_modules/bullmq/dist/esm/enums/parent-command.d.ts b/node_modules/bullmq/dist/esm/enums/parent-command.d.ts
new file mode 100644
index 0000000..a722a94
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/parent-command.d.ts
@@ -0,0 +1,17 @@
+export declare enum ParentCommand {
+    Completed = 0,
+    Error = 1,
+    Failed = 2,
+    InitFailed = 3,
+    InitCompleted = 4,
+    Log = 5,
+    MoveToDelayed = 6,
+    MoveToWait = 7,
+    Progress = 8,
+    Update = 9,
+    GetChildrenValues = 10,
+    GetIgnoredChildrenFailures = 11,
+    GetDependenciesCount = 12,
+    MoveToWaitingChildren = 13,
+    GetDependencies = 14
+}
diff --git a/node_modules/bullmq/dist/esm/enums/parent-command.js b/node_modules/bullmq/dist/esm/enums/parent-command.js
new file mode 100644
index 0000000..61de192
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/parent-command.js
@@ -0,0 +1,18 @@
+export var ParentCommand;
+(function (ParentCommand) {
+    ParentCommand[ParentCommand["Completed"] = 0] = "Completed";
+    ParentCommand[ParentCommand["Error"] = 1] = "Error";
+    ParentCommand[ParentCommand["Failed"] = 2] = "Failed";
+    ParentCommand[ParentCommand["InitFailed"] = 3] = "InitFailed";
+    ParentCommand[ParentCommand["InitCompleted"] = 4] = "InitCompleted";
+    ParentCommand[ParentCommand["Log"] = 5] = "Log";
+    ParentCommand[ParentCommand["MoveToDelayed"] = 6] = "MoveToDelayed";
+    ParentCommand[ParentCommand["MoveToWait"] = 7] = "MoveToWait";
+    ParentCommand[ParentCommand["Progress"] = 8] = "Progress";
+    ParentCommand[ParentCommand["Update"] = 9] = "Update";
+    ParentCommand[ParentCommand["GetChildrenValues"] = 10] = "GetChildrenValues";
+    ParentCommand[ParentCommand["GetIgnoredChildrenFailures"] = 11] = "GetIgnoredChildrenFailures";
+    ParentCommand[ParentCommand["GetDependenciesCount"] = 12] = "GetDependenciesCount";
+    ParentCommand[ParentCommand["MoveToWaitingChildren"] = 13] = "MoveToWaitingChildren";
+    ParentCommand[ParentCommand["GetDependencies"] = 14] = "GetDependencies";
+})(ParentCommand || (ParentCommand = {}));
diff --git a/node_modules/bullmq/dist/esm/enums/telemetry-attributes.d.ts b/node_modules/bullmq/dist/esm/enums/telemetry-attributes.d.ts
new file mode 100644
index 0000000..17e4b80
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/telemetry-attributes.d.ts
@@ -0,0 +1,62 @@
+export declare enum TelemetryAttributes {
+    QueueName = "bullmq.queue.name",
+    QueueOperation = "bullmq.queue.operation",
+    BulkCount = "bullmq.job.bulk.count",
+    BulkNames = "bullmq.job.bulk.names",
+    JobName = "bullmq.job.name",
+    JobId = "bullmq.job.id",
+    JobKey = "bullmq.job.key",
+    JobIds = "bullmq.job.ids",
+    JobAttemptsMade = "bullmq.job.attempts.made",
+    DeduplicationKey = "bullmq.job.deduplication.key",
+    JobOptions = "bullmq.job.options",
+    JobProgress = "bullmq.job.progress",
+    QueueDrainDelay = "bullmq.queue.drain.delay",
+    QueueGrace = "bullmq.queue.grace",
+    QueueCleanLimit = "bullmq.queue.clean.limit",
+    QueueRateLimit = "bullmq.queue.rate.limit",
+    JobType = "bullmq.job.type",
+    QueueOptions = "bullmq.queue.options",
+    QueueEventMaxLength = "bullmq.queue.event.max.length",
+    QueueJobsState = "bullmq.queue.jobs.state",
+    WorkerOptions = "bullmq.worker.options",
+    WorkerName = "bullmq.worker.name",
+    WorkerId = "bullmq.worker.id",
+    WorkerRateLimit = "bullmq.worker.rate.limit",
+    WorkerDoNotWaitActive = "bullmq.worker.do.not.wait.active",
+    WorkerForceClose = "bullmq.worker.force.close",
+    WorkerStalledJobs = "bullmq.worker.stalled.jobs",
+    WorkerFailedJobs = "bullmq.worker.failed.jobs",
+    WorkerJobsToExtendLocks = "bullmq.worker.jobs.to.extend.locks",
+    /**
+     * @deprecated Use JobAttemptFinishedTimestamp instead. Will be removed in a future version.
+     */
+    JobFinishedTimestamp = "bullmq.job.finished.timestamp",
+    JobAttemptFinishedTimestamp = "bullmq.job.attempt_finished_timestamp",
+    JobProcessedTimestamp = "bullmq.job.processed.timestamp",
+    JobResult = "bullmq.job.result",
+    JobFailedReason = "bullmq.job.failed.reason",
+    FlowName = "bullmq.flow.name",
+    JobSchedulerId = "bullmq.job.scheduler.id",
+    JobStatus = "bullmq.job.status"
+}
+/**
+ * Standard metric names for BullMQ telemetry
+ */
+export declare enum MetricNames {
+    QueueJobsCount = "bullmq.queue.jobs",
+    JobsCompleted = "bullmq.jobs.completed",
+    JobsFailed = "bullmq.jobs.failed",
+    JobsDelayed = "bullmq.jobs.delayed",
+    JobsRetried = "bullmq.jobs.retried",
+    JobsWaiting = "bullmq.jobs.waiting",
+    JobsWaitingChildren = "bullmq.jobs.waiting_children",
+    JobDuration = "bullmq.job.duration"
+}
+export declare enum SpanKind {
+    INTERNAL = 0,
+    SERVER = 1,
+    CLIENT = 2,
+    PRODUCER = 3,
+    CONSUMER = 4
+}
diff --git a/node_modules/bullmq/dist/esm/enums/telemetry-attributes.js b/node_modules/bullmq/dist/esm/enums/telemetry-attributes.js
new file mode 100644
index 0000000..6741749
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/enums/telemetry-attributes.js
@@ -0,0 +1,65 @@
+export var TelemetryAttributes;
+(function (TelemetryAttributes) {
+    TelemetryAttributes["QueueName"] = "bullmq.queue.name";
+    TelemetryAttributes["QueueOperation"] = "bullmq.queue.operation";
+    TelemetryAttributes["BulkCount"] = "bullmq.job.bulk.count";
+    TelemetryAttributes["BulkNames"] = "bullmq.job.bulk.names";
+    TelemetryAttributes["JobName"] = "bullmq.job.name";
+    TelemetryAttributes["JobId"] = "bullmq.job.id";
+    TelemetryAttributes["JobKey"] = "bullmq.job.key";
+    TelemetryAttributes["JobIds"] = "bullmq.job.ids";
+    TelemetryAttributes["JobAttemptsMade"] = "bullmq.job.attempts.made";
+    TelemetryAttributes["DeduplicationKey"] = "bullmq.job.deduplication.key";
+    TelemetryAttributes["JobOptions"] = "bullmq.job.options";
+    TelemetryAttributes["JobProgress"] = "bullmq.job.progress";
+    TelemetryAttributes["QueueDrainDelay"] = "bullmq.queue.drain.delay";
+    TelemetryAttributes["QueueGrace"] = "bullmq.queue.grace";
+    TelemetryAttributes["QueueCleanLimit"] = "bullmq.queue.clean.limit";
+    TelemetryAttributes["QueueRateLimit"] = "bullmq.queue.rate.limit";
+    TelemetryAttributes["JobType"] = "bullmq.job.type";
+    TelemetryAttributes["QueueOptions"] = "bullmq.queue.options";
+    TelemetryAttributes["QueueEventMaxLength"] = "bullmq.queue.event.max.length";
+    TelemetryAttributes["QueueJobsState"] = "bullmq.queue.jobs.state";
+    TelemetryAttributes["WorkerOptions"] = "bullmq.worker.options";
+    TelemetryAttributes["WorkerName"] = "bullmq.worker.name";
+    TelemetryAttributes["WorkerId"] = "bullmq.worker.id";
+    TelemetryAttributes["WorkerRateLimit"] = "bullmq.worker.rate.limit";
+    TelemetryAttributes["WorkerDoNotWaitActive"] = "bullmq.worker.do.not.wait.active";
+    TelemetryAttributes["WorkerForceClose"] = "bullmq.worker.force.close";
+    TelemetryAttributes["WorkerStalledJobs"] = "bullmq.worker.stalled.jobs";
+    TelemetryAttributes["WorkerFailedJobs"] = "bullmq.worker.failed.jobs";
+    TelemetryAttributes["WorkerJobsToExtendLocks"] = "bullmq.worker.jobs.to.extend.locks";
+    /**
+     * @deprecated Use JobAttemptFinishedTimestamp instead. Will be removed in a future version.
+     */
+    TelemetryAttributes["JobFinishedTimestamp"] = "bullmq.job.finished.timestamp";
+    TelemetryAttributes["JobAttemptFinishedTimestamp"] = "bullmq.job.attempt_finished_timestamp";
+    TelemetryAttributes["JobProcessedTimestamp"] = "bullmq.job.processed.timestamp";
+    TelemetryAttributes["JobResult"] = "bullmq.job.result";
+    TelemetryAttributes["JobFailedReason"] = "bullmq.job.failed.reason";
+    TelemetryAttributes["FlowName"] = "bullmq.flow.name";
+    TelemetryAttributes["JobSchedulerId"] = "bullmq.job.scheduler.id";
+    TelemetryAttributes["JobStatus"] = "bullmq.job.status";
+})(TelemetryAttributes || (TelemetryAttributes = {}));
+/**
+ * Standard metric names for BullMQ telemetry
+ */
+export var MetricNames;
+(function (MetricNames) {
+    MetricNames["QueueJobsCount"] = "bullmq.queue.jobs";
+    MetricNames["JobsCompleted"] = "bullmq.jobs.completed";
+    MetricNames["JobsFailed"] = "bullmq.jobs.failed";
+    MetricNames["JobsDelayed"] = "bullmq.jobs.delayed";
+    MetricNames["JobsRetried"] = "bullmq.jobs.retried";
+    MetricNames["JobsWaiting"] = "bullmq.jobs.waiting";
+    MetricNames["JobsWaitingChildren"] = "bullmq.jobs.waiting_children";
+    MetricNames["JobDuration"] = "bullmq.job.duration";
+})(MetricNames || (MetricNames = {}));
+export var SpanKind;
+(function (SpanKind) {
+    SpanKind[SpanKind["INTERNAL"] = 0] = "INTERNAL";
+    SpanKind[SpanKind["SERVER"] = 1] = "SERVER";
+    SpanKind[SpanKind["CLIENT"] = 2] = "CLIENT";
+    SpanKind[SpanKind["PRODUCER"] = 3] = "PRODUCER";
+    SpanKind[SpanKind["CONSUMER"] = 4] = "CONSUMER";
+})(SpanKind || (SpanKind = {}));
diff --git a/node_modules/bullmq/dist/esm/index.d.ts b/node_modules/bullmq/dist/esm/index.d.ts
new file mode 100644
index 0000000..c7dbb68
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/index.d.ts
@@ -0,0 +1,7 @@
+export * from './classes';
+export * from './enums';
+export * from './interfaces';
+export * from './types';
+export * from './utils';
+export * from './types/processor';
+export * from './utils/create-scripts';
diff --git a/node_modules/bullmq/dist/esm/index.js b/node_modules/bullmq/dist/esm/index.js
new file mode 100644
index 0000000..b8198f4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/index.js
@@ -0,0 +1,8 @@
+export * from './classes';
+export * from './enums';
+export * from './interfaces';
+export * from './types';
+export * from './utils';
+// to prevent circular references
+export * from './types/processor';
+export * from './utils/create-scripts';
diff --git a/node_modules/bullmq/dist/esm/interfaces/advanced-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/advanced-options.d.ts
new file mode 100644
index 0000000..d5bc82e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/advanced-options.d.ts
@@ -0,0 +1,19 @@
+import { BackoffStrategy } from '../types/backoff-strategy';
+import { RepeatStrategy } from '../types/repeat-strategy';
+export interface AdvancedRepeatOptions {
+    /**
+     * A custom cron strategy.
+     */
+    repeatStrategy?: RepeatStrategy;
+    /**
+     * A hash algorithm to be used when trying to create the job redis key.
+     * Default - md5
+     */
+    repeatKeyHashAlgorithm?: string;
+}
+export interface AdvancedOptions extends AdvancedRepeatOptions {
+    /**
+     * A custom backoff strategy.
+     */
+    backoffStrategy?: BackoffStrategy;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/advanced-options.js b/node_modules/bullmq/dist/esm/interfaces/advanced-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/advanced-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/backoff-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/backoff-options.d.ts
new file mode 100644
index 0000000..bb116b2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/backoff-options.d.ts
@@ -0,0 +1,20 @@
+/**
+ * Settings for backing off failed jobs.
+ *
+ * @see {@link https://docs.bullmq.io/guide/retrying-failing-jobs}
+ */
+export interface BackoffOptions {
+    /**
+     * Name of the backoff strategy.
+     */
+    type: 'fixed' | 'exponential' | (string & {});
+    /**
+     * Delay in milliseconds.
+     */
+    delay?: number;
+    /**
+     * Percentage of jitter usage.
+     * @defaultValue 0
+     */
+    jitter?: number;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/backoff-options.js b/node_modules/bullmq/dist/esm/interfaces/backoff-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/backoff-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/base-job-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/base-job-options.d.ts
new file mode 100644
index 0000000..a3b3a7d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/base-job-options.d.ts
@@ -0,0 +1,104 @@
+import { BackoffOptions } from './backoff-options';
+import { KeepJobs } from '../types/keep-jobs';
+import { ParentOptions } from './parent-options';
+import { RepeatOptions } from './repeat-options';
+export interface DefaultJobOptions {
+    /**
+     * Timestamp when the job was created.
+     * @defaultValue Date.now()
+     */
+    timestamp?: number;
+    /**
+     * Ranges from 0 (highest priority) to 2 097 152 (lowest priority). Note that
+     * using priorities has a slight impact on performance,
+     * so do not use it if not required.
+     * @defaultValue 0
+     */
+    priority?: number;
+    /**
+     * An amount of milliseconds to wait until this job can be processed.
+     * Note that for accurate delays, worker and producers
+     * should have their clocks synchronized.
+     * @defaultValue 0
+     */
+    delay?: number;
+    /**
+     * The total number of attempts to try the job until it completes.
+     * @defaultValue 1
+     */
+    attempts?: number;
+    /**
+     * Backoff setting for automatic retries if the job fails
+     */
+    backoff?: number | BackoffOptions;
+    /**
+     * If true, adds the job to the right of the queue instead of the left (default false)
+     *
+     * @see {@link https://docs.bullmq.io/guide/jobs/lifo}
+     */
+    lifo?: boolean;
+    /**
+     * If true, removes the job when it successfully completes
+     * When given a number, it specifies the maximum amount of
+     * jobs to keep, or you can provide an object specifying max
+     * age and/or count to keep. It overrides whatever setting is used in the worker.
+     * Default behavior is to keep the job in the completed set.
+     *
+     * When using `age` or `count`, the eviction is evaluated on a
+     * best-effort basis every time a job finishes; BullMQ does not run a
+     * background timer, so aged jobs are only removed once another job
+     * completes after their expiration.
+     */
+    removeOnComplete?: boolean | number | KeepJobs;
+    /**
+     * If true, removes the job when it fails after all attempts.
+     * When given a number, it specifies the maximum amount of
+     * jobs to keep, or you can provide an object specifying max
+     * age and/or count to keep. It overrides whatever setting is used in the worker.
+     * Default behavior is to keep the job in the failed set.
+     *
+     * When using `age` or `count`, the eviction is evaluated on a
+     * best-effort basis every time a job fails; BullMQ does not run a
+     * background timer, so aged jobs are only removed once another job
+     * fails after their expiration.
+     */
+    removeOnFail?: boolean | number | KeepJobs;
+    /**
+     * Maximum amount of log entries that will be preserved
+     */
+    keepLogs?: number;
+    /**
+     * Limits the amount of stack trace lines that will be recorded in the stacktrace.
+     */
+    stackTraceLimit?: number;
+    /**
+     * Limits the size in bytes of the job's data payload (as a JSON serialized string).
+     */
+    sizeLimit?: number;
+}
+export interface BaseJobOptions extends DefaultJobOptions {
+    /**
+     * Repeat this job, for example based on a `cron` schedule.
+     */
+    repeat?: RepeatOptions;
+    /**
+     * Internal property used by repeatable jobs to save base repeat job key.
+     */
+    repeatJobKey?: string;
+    /**
+     * Override the job ID - by default, the job ID is a unique
+     * integer, but you can use this setting to override it.
+     * If you use this option, it is up to you to ensure the
+     * jobId is unique. If you attempt to add a job with an id that
+     * already exists, it will not be added.
+     */
+    jobId?: string;
+    /**
+     * Parent options
+     */
+    parent?: ParentOptions;
+    /**
+     * Internal property used by repeatable jobs.
+     */
+    prevMillis?: number;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/base-job-options.js b/node_modules/bullmq/dist/esm/interfaces/base-job-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/base-job-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/child-message.d.ts b/node_modules/bullmq/dist/esm/interfaces/child-message.d.ts
new file mode 100644
index 0000000..fa33287
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/child-message.d.ts
@@ -0,0 +1,7 @@
+import { ParentCommand } from '../enums/parent-command';
+export interface ChildMessage {
+    cmd: ParentCommand;
+    requestId?: string;
+    value?: any;
+    err?: Record<string, any>;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/child-message.js b/node_modules/bullmq/dist/esm/interfaces/child-message.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/child-message.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/connection.d.ts b/node_modules/bullmq/dist/esm/interfaces/connection.d.ts
new file mode 100644
index 0000000..6068dee
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/connection.d.ts
@@ -0,0 +1,7 @@
+import { EventEmitter } from 'events';
+import { IRedisClient } from './redis-client';
+export type RedisClient = IRedisClient;
+export interface IConnection extends EventEmitter {
+    waitUntilReady(): Promise<boolean>;
+    client: Promise<RedisClient>;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/connection.js b/node_modules/bullmq/dist/esm/interfaces/connection.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/connection.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/flow-job.d.ts b/node_modules/bullmq/dist/esm/interfaces/flow-job.d.ts
new file mode 100644
index 0000000..f4f1e50
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/flow-job.d.ts
@@ -0,0 +1,22 @@
+import { DeduplicationOptions, JobsOptions } from '../types';
+import { QueueOptions } from './queue-options';
+export interface FlowJobBase<T> {
+    name: string;
+    queueName: string;
+    data?: any;
+    prefix?: string;
+    opts?: Omit<T, 'repeat'>;
+    children?: FlowChildJob[];
+}
+export type FlowChildJob = FlowJobBase<Omit<JobsOptions, 'debounce' | 'deduplication' | 'parent'>>;
+export type FlowJob = FlowJobBase<Omit<JobsOptions, 'debounce' | 'deduplication'> & {
+    debounce?: Omit<DeduplicationOptions, 'replace'>;
+    deduplication?: Omit<DeduplicationOptions, 'replace'>;
+}>;
+export type FlowQueuesOpts = Record<string, Omit<QueueOptions, 'connection' | 'prefix'>>;
+export interface FlowOpts {
+    /**
+     * Map of options for Queue classes.
+     */
+    queuesOptions: FlowQueuesOpts;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/flow-job.js b/node_modules/bullmq/dist/esm/interfaces/flow-job.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/flow-job.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/index.d.ts b/node_modules/bullmq/dist/esm/interfaces/index.d.ts
new file mode 100644
index 0000000..4b8a2d4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/index.d.ts
@@ -0,0 +1,34 @@
+export * from './advanced-options';
+export * from './backoff-options';
+export * from './base-job-options';
+export * from './child-message';
+export * from './connection';
+export * from './flow-job';
+export * from './ioredis-events';
+export * from './job-json';
+export * from './job-scheduler-json';
+export * from './lock-manager-worker-context';
+export * from './metrics-options';
+export * from './metrics';
+export * from './minimal-job';
+export * from './minimal-queue';
+export * from './parent-message';
+export * from './parent';
+export * from './parent-options';
+export * from './queue-meta';
+export * from './queue-options';
+export * from './rate-limiter-options';
+export * from './redis-client';
+export * from './redis-options';
+export * from './redis-streams';
+export * from './repeatable-job';
+export * from './repeatable-options';
+export * from './repeat-options';
+export * from './retry-options';
+export * from './script-queue-context';
+export * from './sandboxed-job-processor';
+export * from './sandboxed-job';
+export * from './sandboxed-options';
+export * from './worker-options';
+export * from './telemetry';
+export * from './receiver';
diff --git a/node_modules/bullmq/dist/esm/interfaces/index.js b/node_modules/bullmq/dist/esm/interfaces/index.js
new file mode 100644
index 0000000..4b8a2d4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/index.js
@@ -0,0 +1,34 @@
+export * from './advanced-options';
+export * from './backoff-options';
+export * from './base-job-options';
+export * from './child-message';
+export * from './connection';
+export * from './flow-job';
+export * from './ioredis-events';
+export * from './job-json';
+export * from './job-scheduler-json';
+export * from './lock-manager-worker-context';
+export * from './metrics-options';
+export * from './metrics';
+export * from './minimal-job';
+export * from './minimal-queue';
+export * from './parent-message';
+export * from './parent';
+export * from './parent-options';
+export * from './queue-meta';
+export * from './queue-options';
+export * from './rate-limiter-options';
+export * from './redis-client';
+export * from './redis-options';
+export * from './redis-streams';
+export * from './repeatable-job';
+export * from './repeatable-options';
+export * from './repeat-options';
+export * from './retry-options';
+export * from './script-queue-context';
+export * from './sandboxed-job-processor';
+export * from './sandboxed-job';
+export * from './sandboxed-options';
+export * from './worker-options';
+export * from './telemetry';
+export * from './receiver';
diff --git a/node_modules/bullmq/dist/esm/interfaces/ioredis-events.d.ts b/node_modules/bullmq/dist/esm/interfaces/ioredis-events.d.ts
new file mode 100644
index 0000000..71fd419
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/ioredis-events.d.ts
@@ -0,0 +1,8 @@
+export interface IoredisListener {
+    /**
+     * Listen to 'ioredis:close' event.
+     *
+     * This event is triggered when ioredis is closed.
+     */
+    'ioredis:close': () => void;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/ioredis-events.js b/node_modules/bullmq/dist/esm/interfaces/ioredis-events.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/ioredis-events.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/job-json.d.ts b/node_modules/bullmq/dist/esm/interfaces/job-json.d.ts
new file mode 100644
index 0000000..9942a36
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/job-json.d.ts
@@ -0,0 +1,52 @@
+import { JobProgress } from '../types/job-progress';
+import { RedisJobOptions } from '../types/job-options';
+import { ParentKeys } from './parent';
+export interface JobJson {
+    id: string;
+    name: string;
+    data: string;
+    opts: RedisJobOptions;
+    progress: JobProgress;
+    attemptsMade: number;
+    attemptsStarted: number;
+    finishedOn?: number;
+    processedOn?: number;
+    timestamp: number;
+    failedReason: string;
+    stacktrace: string;
+    returnvalue: string;
+    parent?: ParentKeys;
+    parentKey?: string;
+    repeatJobKey?: string;
+    nextRepeatableJobKey?: string;
+    debounceId?: string;
+    deduplicationId?: string;
+    processedBy?: string;
+    stalledCounter: number;
+}
+export interface JobJsonRaw {
+    id: string;
+    name: string;
+    data: string;
+    delay: string;
+    opts: string;
+    progress: string;
+    attemptsMade?: string;
+    finishedOn?: string;
+    processedOn?: string;
+    priority: string;
+    timestamp: string;
+    failedReason: string;
+    stacktrace?: string;
+    returnvalue: string;
+    parentKey?: string;
+    parent?: string;
+    deid?: string;
+    rjk?: string;
+    nrjid?: string;
+    atm?: string;
+    defa?: string;
+    stc?: string;
+    ats?: string;
+    pb?: string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/job-json.js b/node_modules/bullmq/dist/esm/interfaces/job-json.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/job-json.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.d.ts b/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.d.ts
new file mode 100644
index 0000000..244171a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.d.ts
@@ -0,0 +1,20 @@
+import { JobSchedulerTemplateOptions } from '../types';
+export interface JobSchedulerTemplateJson<D = any> {
+    data?: D;
+    opts?: JobSchedulerTemplateOptions;
+}
+export interface JobSchedulerJson<D = any> {
+    key: string;
+    name: string;
+    id?: string | null;
+    iterationCount?: number;
+    limit?: number;
+    startDate?: number;
+    endDate?: number;
+    tz?: string;
+    pattern?: string;
+    every?: number;
+    next?: number;
+    offset?: number;
+    template?: JobSchedulerTemplateJson<D>;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.js b/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/job-scheduler-json.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.d.ts b/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.d.ts
new file mode 100644
index 0000000..5c19d17
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.d.ts
@@ -0,0 +1,24 @@
+import { SpanKind } from '../enums';
+import { Span } from './telemetry';
+/**
+ * Minimal interface that LockManager needs from Worker.
+ * This allows LockManager to access worker methods without inheriting from QueueBase.
+ */
+export interface LockManagerWorkerContext {
+    /**
+     * Extends locks for multiple jobs.
+     */
+    extendJobLocks(jobIds: string[], tokens: string[], duration: number): Promise<string[]>;
+    /**
+     * Emits events to worker listeners.
+     */
+    emit(event: string | symbol, ...args: any[]): boolean;
+    /**
+     * Wraps code with telemetry tracing.
+     */
+    trace<T>(spanKind: SpanKind, operation: string, destination: string, callback: (span?: Span) => Promise<T> | T): Promise<T> | T;
+    /**
+     * Queue name for telemetry.
+     */
+    name: string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.js b/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/lock-manager-worker-context.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/metrics-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/metrics-options.d.ts
new file mode 100644
index 0000000..aa88531
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/metrics-options.d.ts
@@ -0,0 +1,13 @@
+/**
+ * Options for configuring metrics collection on a queue.
+ *
+ * @see {@link https://docs.bullmq.io/guide/metrics}
+ */
+export interface MetricsOptions {
+    /**
+     * Maximum number of data points to keep for the metrics.
+     * Each data point represents the number of finished jobs (completed or failed)
+     * collected over a one-minute granularity window.
+     */
+    maxDataPoints?: number;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/metrics-options.js b/node_modules/bullmq/dist/esm/interfaces/metrics-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/metrics-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/metrics.d.ts b/node_modules/bullmq/dist/esm/interfaces/metrics.d.ts
new file mode 100644
index 0000000..d2e7729
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/metrics.d.ts
@@ -0,0 +1,9 @@
+export interface Metrics {
+    meta: {
+        count: number;
+        prevTS: number;
+        prevCount: number;
+    };
+    data: number[];
+    count: number;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/metrics.js b/node_modules/bullmq/dist/esm/interfaces/metrics.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/metrics.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/minimal-job.d.ts b/node_modules/bullmq/dist/esm/interfaces/minimal-job.d.ts
new file mode 100644
index 0000000..8d32323
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/minimal-job.d.ts
@@ -0,0 +1,155 @@
+import { JobsOptions } from '../types/job-options';
+import { JobProgress } from '../types/job-progress';
+import { JobJsonSandbox } from '../types/job-json-sandbox';
+import { JobJson } from './job-json';
+import { ParentKeys } from './parent';
+import { ParentOptions } from './parent-options';
+export type BulkJobOptions = Omit<JobsOptions, 'repeat'>;
+export interface MoveToDelayedOpts {
+    skipAttempt?: boolean;
+    fieldsToUpdate?: Record<string, any>;
+    fetchNext?: boolean;
+}
+export interface RetryJobOpts {
+    fieldsToUpdate?: Record<string, any>;
+}
+export interface MoveToWaitingChildrenOpts {
+    child?: ParentOptions;
+}
+export interface DependencyOpts {
+    /**
+     * Cursor value to be passed for pagination
+     */
+    cursor?: number;
+    /**
+     * Max quantity of jobs to be retrieved
+     */
+    count?: number;
+}
+export interface DependenciesOpts {
+    /**
+     * Options for failed child pagination
+     */
+    failed?: DependencyOpts;
+    /**
+     * Options for ignored child pagination
+     */
+    ignored?: DependencyOpts;
+    /**
+     * Options for processed child pagination
+     */
+    processed?: DependencyOpts;
+    /**
+     * Options for unprocessed child pagination
+     */
+    unprocessed?: DependencyOpts;
+}
+/**
+ * MinimalJob
+ */
+export interface MinimalJob<DataType = any, ReturnType = any, NameType extends string = string> {
+    /**
+     * The name of the Job
+     */
+    name: NameType;
+    /**
+     * The payload for this job.
+     */
+    data: DataType;
+    /**
+     * The options object for this job.
+     */
+    opts: JobsOptions;
+    id?: string;
+    /**
+     * The progress a job has performed so far.
+     * @defaultValue 0
+     */
+    progress: JobProgress;
+    /**
+     * The value returned by the processor when processing this job.
+     * @defaultValue null
+     */
+    returnvalue: ReturnType;
+    /**
+     * Stacktrace for the error (for failed jobs).
+     * @defaultValue null
+     */
+    stacktrace: string[] | null;
+    /**
+     * An amount of milliseconds to wait until this job can be processed.
+     * @defaultValue 0
+     */
+    delay: number;
+    /**
+     * Timestamp when the job was created (unless overridden with job options).
+     */
+    timestamp: number;
+    /**
+     * Number of attempts after the job has failed.
+     * @defaultValue 0
+     */
+    attemptsMade: number;
+    /**
+     * Reason for failing.
+     */
+    failedReason: string;
+    /**
+     * Timestamp for when the job finished (completed or failed).
+     */
+    finishedOn?: number;
+    /**
+     * Timestamp for when the job was processed.
+     */
+    processedOn?: number;
+    /**
+     * Fully qualified key (including the queue prefix) pointing to the parent of this job.
+     */
+    parentKey?: string;
+    /**
+     * Object that contains parentId (id) and parent queueKey.
+     */
+    parent?: ParentKeys;
+    /**
+     * Base repeat job key.
+     */
+    repeatJobKey?: string;
+    /**
+     * Prepares a job to be serialized for storage in Redis.
+     * @returns
+     */
+    asJSON(): JobJson;
+    /**
+     * Prepares a job to be passed to Sandbox.
+     * @returns
+     */
+    asJSONSandbox(): JobJsonSandbox;
+    /**
+     * Updates a job's data
+     *
+     * @param data - the data that will replace the current jobs data.
+     */
+    updateData(data: DataType): Promise<void>;
+    /**
+     * Updates a job's progress
+     *
+     * @param progress - number or object to be saved as progress.
+     */
+    updateProgress(progress: JobProgress): Promise<void>;
+    /**
+     * Logs one row of log data.
+     *
+     * @param logRow - string with log data to be logged.
+     */
+    log(logRow: string): Promise<number>;
+    get queueName(): string;
+    /**
+     * @returns the prefix that is used.
+     */
+    get prefix(): string;
+    /**
+     * @returns it includes the prefix, the namespace separator :, and queue name.
+     * @see https://www.gnu.org/software/gawk/manual/html_node/Qualified-Names.html
+     */
+    get queueQualifiedName(): string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/minimal-job.js b/node_modules/bullmq/dist/esm/interfaces/minimal-job.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/minimal-job.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/minimal-queue.d.ts b/node_modules/bullmq/dist/esm/interfaces/minimal-queue.d.ts
new file mode 100644
index 0000000..b5ce071
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/minimal-queue.d.ts
@@ -0,0 +1,30 @@
+import { RedisClient } from './connection';
+import { Span } from './telemetry';
+import { SpanKind } from '../enums/telemetry-attributes';
+import { ScriptQueueContext } from './script-queue-context';
+export interface MinimalQueue extends ScriptQueueContext {
+    readonly name: string;
+    readonly qualifiedName: string;
+    /**
+     * Emits an event. Normally used by subclasses to emit events.
+     *
+     * @param event - The emitted event.
+     * @param args -
+     * @returns
+     */
+    emit(event: string | symbol, ...args: any[]): boolean;
+    on(event: string | symbol, listener: (...args: any[]) => void): this;
+    removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+    waitUntilReady(): Promise<RedisClient>;
+    /**
+     * Wraps the code with telemetry and provides a span for configuration.
+     *
+     * @param spanKind - kind of the span: Producer, Consumer, Internal
+     * @param operation - operation name (such as add, process, etc)
+     * @param destination - destination name (normally the queue name)
+     * @param callback - code to wrap with telemetry
+     * @param srcPropagationMetadata -
+     * @returns
+     */
+    trace<T>(spanKind: SpanKind, operation: string, destination: string, callback: (span?: Span, dstPropagationMetadata?: string) => Promise<T> | T, srcPropagationMetadata?: string): Promise<T | Promise<T>>;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/minimal-queue.js b/node_modules/bullmq/dist/esm/interfaces/minimal-queue.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/minimal-queue.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent-message.d.ts b/node_modules/bullmq/dist/esm/interfaces/parent-message.d.ts
new file mode 100644
index 0000000..7a6142f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent-message.d.ts
@@ -0,0 +1,8 @@
+import { ChildCommand } from '../enums/child-command';
+import { JobJson } from './job-json';
+export interface ParentMessage {
+    cmd: ChildCommand;
+    value?: any;
+    err?: Error;
+    job?: JobJson;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent-message.js b/node_modules/bullmq/dist/esm/interfaces/parent-message.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent-message.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/parent-options.d.ts
new file mode 100644
index 0000000..77e5a54
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent-options.d.ts
@@ -0,0 +1,11 @@
+export interface ParentOptions {
+    /**
+     * Parent identifier.
+     */
+    id: string;
+    /**
+     * It includes the prefix, the namespace separator :, and queue name.
+     * @see {@link https://www.gnu.org/software/gawk/manual/html_node/Qualified-Names.html}
+     */
+    queue: string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent-options.js b/node_modules/bullmq/dist/esm/interfaces/parent-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent.d.ts b/node_modules/bullmq/dist/esm/interfaces/parent.d.ts
new file mode 100644
index 0000000..a106861
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent.d.ts
@@ -0,0 +1,49 @@
+import { JobsOptions } from '../types/job-options';
+/**
+ * Describes the parent for a Job.
+ */
+export interface Parent<T> {
+    /** Parent job name. */
+    name: string;
+    /** Prefix for the parent queue's keys. */
+    prefix?: string;
+    /** Name of the parent queue. */
+    queue?: string;
+    /** Parent job data. */
+    data?: T;
+    /** Job options for the parent. */
+    opts?: JobsOptions;
+}
+/**
+ * Redis-stored parent reference keys used internally by BullMQ.
+ */
+export interface ParentKeys {
+    /** Parent job id. */
+    id?: string;
+    /** Qualified parent queue key prefix/name (for example, `${prefix}:${queueName}`). */
+    queueKey: string;
+    /** failParentOnFailure - if true, parent fails when child fails. */
+    fpof?: boolean;
+    /** removeDependencyOnFailure - if true, removes the child from parent's dependencies on failure. */
+    rdof?: boolean;
+    /** ignoreDependencyOnFailure - if true, moves the child job key to failed dependencies on failure. */
+    idof?: boolean;
+    /** continueParentOnFailure - if true, parent starts processing when any child fails. */
+    cpof?: boolean;
+}
+/**
+ * Options used internally for parent/child relationship management when creating jobs
+ * (including associating a child with its parent, or creating a parent that starts in
+ * the `waiting-children` state).
+ */
+export type ParentKeyOpts = {
+    /**
+     * If true, the newly-created parent job will be placed into the parent queue's
+     * `waiting-children` state (waiting for children to complete) instead of `wait`.
+     */
+    addToWaitingChildren?: boolean;
+    /** Redis key holding the parent's dependencies set. */
+    parentDependenciesKey?: string;
+    /** Fully-qualified Redis key of the parent job. */
+    parentKey?: string;
+};
diff --git a/node_modules/bullmq/dist/esm/interfaces/parent.js b/node_modules/bullmq/dist/esm/interfaces/parent.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/parent.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/queue-meta.d.ts b/node_modules/bullmq/dist/esm/interfaces/queue-meta.d.ts
new file mode 100644
index 0000000..1bfd99f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/queue-meta.d.ts
@@ -0,0 +1,46 @@
+/**
+ * Publicly relevant metadata fields for a Queue, read from the queue's
+ * Redis `meta` key.
+ *
+ * This interface documents the subset of meta-hash fields that BullMQ
+ * exposes to consumers (e.g. via `Queue.getQueueOpts`, `Queue.getRateLimit`,
+ * `Queue.isPaused`); the underlying hash also stores internal fields
+ * (e.g. metrics counters) that are not part of this type.
+ */
+export interface QueueMeta {
+    /**
+     * Maximum number of jobs that can be processed concurrently across all
+     * workers attached to this queue. Set via `Queue.setGlobalConcurrency`.
+     */
+    concurrency?: number;
+    /**
+     * Maximum number of jobs allowed in the rate-limit window of `duration`
+     * milliseconds. Set via `Queue.setGlobalRateLimit`.
+     */
+    max?: number;
+    /**
+     * Length of the rate-limit window in milliseconds, paired with `max`.
+     * Set via `Queue.setGlobalRateLimit`.
+     */
+    duration?: number;
+    /**
+     * Maximum length of the queue's events stream. Older events are evicted
+     * in FIFO order once the stream grows beyond this size.
+     *
+     * Note: `maxLenEvents` is not a guaranteed upper bound. BullMQ relies on
+     * Redis's `XTRIM` "fast trim" (`MAXLEN ~ N`), which is a best-effort
+     * cap — the stream may retain noticeably more events than this value at
+     * any given moment.
+     */
+    maxLenEvents?: number;
+    /**
+     * True when the queue has been paused. While paused, workers will not
+     * pick up new jobs.
+     */
+    paused?: boolean;
+    /**
+     * BullMQ version that produced this queue's data, used for compatibility
+     * checks across upgrades.
+     */
+    version?: string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/queue-meta.js b/node_modules/bullmq/dist/esm/interfaces/queue-meta.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/queue-meta.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/queue-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/queue-options.d.ts
new file mode 100644
index 0000000..f0886d6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/queue-options.d.ts
@@ -0,0 +1,106 @@
+import { AdvancedRepeatOptions } from './advanced-options';
+import { DefaultJobOptions } from './base-job-options';
+import { ConnectionOptions } from './redis-options';
+import { Telemetry } from './telemetry';
+export declare enum ClientType {
+    blocking = "blocking",
+    normal = "normal"
+}
+/**
+ * Base Queue options
+ */
+export interface QueueBaseOptions {
+    /**
+     * Options for connecting to a Redis instance.
+     */
+    connection: ConnectionOptions;
+    /**
+     * Denotes commands should retry indefinitely.
+     * @deprecated not in use anymore.
+     */
+    blockingConnection?: boolean;
+    /**
+     * Prefix for all queue keys.
+     */
+    prefix?: string;
+    /**
+     * Avoid version validation to be greater or equal than v5.0.0.
+     * @defaultValue false
+     */
+    skipVersionCheck?: boolean;
+    /**
+     * Telemetry client
+     */
+    telemetry?: Telemetry;
+    /**
+     * Skip waiting for connection ready.
+     *
+     * In some instances if you want the queue to fail fast if the connection is
+     * not ready you can set this to true. This could be useful for testing and when
+     * adding jobs via HTTP endpoints for example.
+     *
+     */
+    skipWaitingForReady?: boolean;
+}
+/**
+ * Options for the Queue class.
+ */
+export interface QueueOptions extends QueueBaseOptions {
+    defaultJobOptions?: DefaultJobOptions;
+    /**
+     * Options for the streams used internally in BullMQ.
+     */
+    streams?: {
+        /**
+         * Options for the events stream.
+         */
+        events: {
+            /**
+             * Max approximated length for streams. Default is 10 000 events.
+             */
+            maxLen: number;
+        };
+    };
+    /**
+     * Skip Meta update.
+     *
+     * If true, the queue will not update the metadata of the queue.
+     * Useful for read-only systems that do should not update the metadata.
+     *
+     * @defaultValue false
+     */
+    skipMetasUpdate?: boolean;
+    /**
+     * Advanced options for the repeatable jobs.
+     */
+    settings?: AdvancedRepeatOptions;
+}
+/**
+ * Options for the Repeat class.
+ */
+export interface RepeatBaseOptions extends QueueBaseOptions {
+    settings?: AdvancedRepeatOptions;
+}
+/**
+ * Options for QueueEvents
+ */
+export interface QueueEventsOptions extends Omit<QueueBaseOptions, 'telemetry'> {
+    /**
+     * Condition to start listening to events at instance creation.
+     */
+    autorun?: boolean;
+    /**
+     * Last event Id. If provided it is possible to continue
+     * consuming events from a known Id instead of from the last
+     * produced event.
+     */
+    lastEventId?: string;
+    /**
+     * Timeout for the blocking XREAD call to the events stream.
+     */
+    blockingTimeout?: number;
+}
+/**
+ * Options for QueueEventsProducer
+ */
+export type QueueEventsProducerOptions = Omit<QueueBaseOptions, 'telemetry'>;
diff --git a/node_modules/bullmq/dist/esm/interfaces/queue-options.js b/node_modules/bullmq/dist/esm/interfaces/queue-options.js
new file mode 100644
index 0000000..c3bb438
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/queue-options.js
@@ -0,0 +1,5 @@
+export var ClientType;
+(function (ClientType) {
+    ClientType["blocking"] = "blocking";
+    ClientType["normal"] = "normal";
+})(ClientType || (ClientType = {}));
diff --git a/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.d.ts
new file mode 100644
index 0000000..fda7ea5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.d.ts
@@ -0,0 +1,12 @@
+export interface RateLimiterOptions {
+    /**
+     * Max number of jobs to process in the time period
+     * specified in `duration`.
+     */
+    max: number;
+    /**
+     * Time in milliseconds. During this time, a maximum
+     * of `max` jobs will be processed.
+     */
+    duration: number;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.js b/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/rate-limiter-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/receiver.d.ts b/node_modules/bullmq/dist/esm/interfaces/receiver.d.ts
new file mode 100644
index 0000000..abaf36a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/receiver.d.ts
@@ -0,0 +1,4 @@
+export interface Receiver {
+    on: (evt: 'message', cb: (msg: any) => void) => void;
+    off: (evt: 'message', cb: (msg: any) => void) => void;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/receiver.js b/node_modules/bullmq/dist/esm/interfaces/receiver.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/receiver.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-client.d.ts b/node_modules/bullmq/dist/esm/interfaces/redis-client.d.ts
new file mode 100644
index 0000000..629a584
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-client.d.ts
@@ -0,0 +1,181 @@
+import { Readable } from 'stream';
+/**
+ * Redis client interface for BullMQ.
+ *
+ * Abstracts the underlying Redis client library (ioredis, node-redis, Bun
+ * built-in Redis, etc.) while keeping Redis semantics.  Only the Redis
+ * commands that BullMQ actually uses are declared here.
+ *
+ * Method signatures use **structured options objects** instead of ioredis-style
+ * varargs so that every adapter (ioredis, node-redis, Bun, …) can map the
+ * call to its native API without parsing positional string tokens.
+ *
+ * The reference implementation for ioredis lives in
+ * `src/classes/ioredis-client.ts`.
+ */
+export interface IRedisClient {
+    /**
+     * Current connection status.
+     * Adapters must expose at least the values `'ready'`, `'wait'`, and
+     * `'end'` so that {@link RedisConnection.waitUntilReady} works correctly.
+     */
+    status: string;
+    /** Whether this client is connected to a Redis Cluster. */
+    readonly isCluster: boolean;
+    /** Client configuration options (shape is adapter-specific). */
+    options: Record<string, any>;
+    connect(): Promise<void>;
+    disconnect(reconnect?: boolean): void;
+    quit(): Promise<string>;
+    /** Create a duplicate connection with optional overrides. */
+    duplicate(...args: any[]): IRedisClient;
+    on(event: string, listener: (...args: any[]) => void): this;
+    once(event: string, listener: (...args: any[]) => void): this;
+    removeListener(event: string, listener: (...args: any[]) => void): this;
+    off(event: string, listener: (...args: any[]) => void): this;
+    emit(event: string | symbol, ...args: any[]): boolean;
+    setMaxListeners(n: number): this;
+    getMaxListeners(): number;
+    removeAllListeners(event?: string | symbol): this;
+    /**
+     * Register a Lua script as a named command so it can later be invoked via
+     * {@link runCommand}.
+     *
+     * @param name       - Command name that will be callable via runCommand.
+     * @param definition - Script definition.
+     *   - `numberOfKeys` – number of KEYS[] arguments the script expects.
+     *   - `lua`          – Lua source code.
+     *   - `readOnly`     – (optional) hint that the script only reads data;
+     *                       some adapters (e.g. ioredis) use this to route the
+     *                       call to a replica in read-only mode.
+     */
+    defineCommand(name: string, definition: {
+        numberOfKeys: number;
+        lua: string;
+        readOnly?: boolean;
+    }): void;
+    /**
+     * Execute a previously registered Lua script command by name.
+     *
+     * @param name - The command name passed to {@link defineCommand}.
+     * @param args - Arguments forwarded to the script (KEYS first, then ARGV).
+     * @returns A `Promise<any>` whose resolved value matches the return value of
+     *   the Lua script.  BullMQ scripts return integers, strings, or arrays of
+     *   strings/integers.  Callers in {@link Scripts.execCommand} cast the result
+     *   to the expected concrete type after the call.
+     */
+    runCommand(name: string, args: any[]): Promise<any>;
+    multi(): IRedisTransaction;
+    pipeline(): IRedisTransaction;
+    hgetall(key: string): Promise<Record<string, string>>;
+    hget(key: string, field: string): Promise<string | null>;
+    hmget(key: string, ...fields: string[]): Promise<(string | null)[]>;
+    /** SET one or more hash fields from a field→value map. */
+    hset(key: string, data: Record<string, string | number>): Promise<number>;
+    hdel(key: string, ...fields: string[]): Promise<number>;
+    hexists(key: string, field: string): Promise<number>;
+    get(key: string): Promise<string | null>;
+    set(key: string, value: string | number, options?: {
+        PX?: number;
+        EX?: number;
+    }): Promise<string | null>;
+    del(...keys: string[]): Promise<number>;
+    zrange(key: string, start: number, end: number, options?: {
+        WITHSCORES?: boolean;
+    }): Promise<string[]>;
+    zrevrange(key: string, start: number, end: number, options?: {
+        WITHSCORES?: boolean;
+    }): Promise<string[]>;
+    zcard(key: string): Promise<number>;
+    zscore(key: string, member: string): Promise<string | null>;
+    lrange(key: string, start: number, end: number): Promise<string[]>;
+    llen(key: string): Promise<number>;
+    ltrim(key: string, start: number, end: number): Promise<string>;
+    lpos(key: string, value: string): Promise<number | null>;
+    smembers(key: string): Promise<string[]>;
+    /**
+     * Append an entry to a stream.
+     *
+     * @param key    - Stream key
+     * @param id     - Entry ID (typically `'*'` for auto-generated)
+     * @param fields - Field-value pairs for the stream entry
+     * @param options - Optional MAXLEN trimming parameters
+     */
+    xadd(key: string, id: string, fields: Record<string, string | number>, options?: {
+        MAXLEN?: number;
+        approximate?: boolean;
+    }): Promise<string>;
+    /**
+     * Read from one or more streams.
+     *
+     * @param streams - Array of stream/id pairs to read from
+     * @param options - Optional BLOCK timeout and COUNT
+     */
+    xread(streams: {
+        key: string;
+        id: string;
+    }[], options?: {
+        BLOCK?: number;
+        COUNT?: number;
+    }): Promise<any>;
+    /**
+     * Trim a stream.
+     *
+     * @param key       - Stream key
+     * @param strategy  - Trim strategy (e.g. `'MAXLEN'`)
+     * @param threshold - Maximum stream length
+     * @param options   - Optional approximate trimming
+     */
+    xtrim(key: string, strategy: 'MAXLEN', threshold: number, options?: {
+        approximate?: boolean;
+    }): Promise<number>;
+    /**
+     * Block until an element is available in the given sorted set, or the
+     * timeout expires.
+     *
+     * The return shape mirrors ioredis' native `bzpopmin`:
+     * `[key, member, score]` on success, or `null` on timeout. Adapters for
+     * other clients (node-redis, bun) MUST convert their native return value
+     * to this tuple form. This avoids mutating the shape of `bzpopmin` on
+     * shared ioredis instances, which would be a breaking change for code
+     * that uses the same client outside of BullMQ.
+     */
+    bzpopmin(key: string, timeout: number): Promise<[key: string, member: string, score: string] | null>;
+    info(): Promise<string>;
+    clientSetName(name: string): Promise<any>;
+    clientList(): Promise<string>;
+    scan(cursor: string | number, options: {
+        MATCH?: string;
+        COUNT?: number;
+    }): Promise<[string, string[]]>;
+    scanStream(options: {
+        match: string;
+        count?: number;
+    }): Readable;
+    /** Return connections for each cluster node (only when isCluster). */
+    nodes?(): IRedisClient[];
+}
+/**
+ * Redis pipeline or transaction (MULTI).
+ *
+ * Commands are queued and executed together via {@link exec}.
+ * Only the subset of commands BullMQ uses inside pipelines is declared.
+ */
+export interface IRedisTransaction {
+    hgetall(key: string): this;
+    hset(key: string, data: Record<string, string | number>): this;
+    hscan(key: string, cursor: string | number, options?: {
+        COUNT?: number;
+    }): this;
+    smembers(key: string): this;
+    sscan(key: string, cursor: string | number, options?: {
+        COUNT?: number;
+    }): this;
+    zrange(key: string, start: number, end: number): this;
+    lrange(key: string, start: number, end: number): this;
+    llen(key: string): this;
+    del(...keys: string[]): this;
+    runCommand(name: string, args: any[]): this;
+    /** Execute all queued commands. */
+    exec(): Promise<[Error | null, any][] | null>;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-client.js b/node_modules/bullmq/dist/esm/interfaces/redis-client.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-client.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/redis-options.d.ts
new file mode 100644
index 0000000..b147282
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-options.d.ts
@@ -0,0 +1,9 @@
+import type * as IORedis from 'ioredis';
+import { IRedisClient } from './redis-client';
+export interface BaseOptions {
+    skipVersionCheck?: boolean;
+    url?: string;
+}
+export type RedisOptions = IORedis.RedisOptions & BaseOptions;
+export type ClusterOptions = IORedis.ClusterOptions & BaseOptions;
+export type ConnectionOptions = RedisOptions | ClusterOptions | IORedis.Redis | IRedisClient | IORedis.Cluster;
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-options.js b/node_modules/bullmq/dist/esm/interfaces/redis-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-streams.d.ts b/node_modules/bullmq/dist/esm/interfaces/redis-streams.d.ts
new file mode 100644
index 0000000..e68e786
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-streams.d.ts
@@ -0,0 +1,4 @@
+export type StreamName = string;
+export type EntryId = string;
+export type EntryRaw = [EntryId, string[]];
+export type StreamReadRaw = [StreamName, EntryRaw[]][] | null | undefined;
diff --git a/node_modules/bullmq/dist/esm/interfaces/redis-streams.js b/node_modules/bullmq/dist/esm/interfaces/redis-streams.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/redis-streams.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeat-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/repeat-options.d.ts
new file mode 100644
index 0000000..c87919d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeat-options.d.ts
@@ -0,0 +1,50 @@
+import { ParserOptions } from 'cron-parser';
+/**
+ * Settings for repeatable jobs
+ *
+ * @see {@link https://docs.bullmq.io/guide/jobs/repeatable}
+ */
+export interface RepeatOptions extends Omit<ParserOptions, 'iterator'> {
+    /**
+     * A repeat pattern
+     */
+    pattern?: string;
+    /**
+     * Custom repeatable key. This is the key that holds the "metadata"
+     * of a given repeatable job. This key is normally auto-generated but
+     * it is sometimes useful to specify a custom key for easier retrieval
+     * of repeatable jobs.
+     */
+    key?: string;
+    /**
+     * Number of times the job should repeat at max.
+     */
+    limit?: number;
+    /**
+     * Repeat after this amount of milliseconds
+     * (`pattern` setting cannot be used together with this setting.)
+     */
+    every?: number;
+    /**
+     * Repeated job should start right now
+     * ( work only with cron settings)
+     */
+    immediately?: boolean;
+    /**
+     * The start value for the repeat iteration count.
+     */
+    count?: number;
+    /**
+     * Offset in milliseconds to affect the next iteration time
+     * */
+    offset?: number;
+    /**
+     * Internal property to store the previous time the job was executed.
+     */
+    prevMillis?: number;
+    /**
+     * Internal property to store the job id
+     * @deprecated not in use anymore
+     */
+    jobId?: string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeat-options.js b/node_modules/bullmq/dist/esm/interfaces/repeat-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeat-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeatable-job.d.ts b/node_modules/bullmq/dist/esm/interfaces/repeatable-job.d.ts
new file mode 100644
index 0000000..211dae5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeatable-job.d.ts
@@ -0,0 +1,10 @@
+export type RepeatableJob = {
+    key: string;
+    name: string;
+    id?: string | null;
+    endDate: number | null;
+    tz: string | null;
+    pattern: string | null;
+    every?: string | null;
+    next?: number;
+};
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeatable-job.js b/node_modules/bullmq/dist/esm/interfaces/repeatable-job.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeatable-job.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeatable-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/repeatable-options.d.ts
new file mode 100644
index 0000000..fb718d0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeatable-options.d.ts
@@ -0,0 +1,10 @@
+export type RepeatableOptions = {
+    name: string;
+    startDate?: number;
+    endDate?: number;
+    tz?: string;
+    limit?: number;
+    pattern?: string;
+    every?: number;
+    offset?: number;
+};
diff --git a/node_modules/bullmq/dist/esm/interfaces/repeatable-options.js b/node_modules/bullmq/dist/esm/interfaces/repeatable-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/repeatable-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/retry-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/retry-options.d.ts
new file mode 100644
index 0000000..8e8f819
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/retry-options.d.ts
@@ -0,0 +1,13 @@
+/**
+ * Retry method options
+ */
+export interface RetryOptions {
+    /**
+     * Attempts made counter is reset to zero when retrying the job.
+     */
+    resetAttemptsMade?: boolean;
+    /**
+     * Attempts started counter is reset to zero when retrying the job.
+     */
+    resetAttemptsStarted?: boolean;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/retry-options.js b/node_modules/bullmq/dist/esm/interfaces/retry-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/retry-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.d.ts b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.d.ts
new file mode 100644
index 0000000..7eb71e2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.d.ts
@@ -0,0 +1,5 @@
+import { SandboxedJob } from './sandboxed-job';
+/**
+ * @see {@link https://docs.bullmq.io/guide/workers/sandboxed-processors}
+ */
+export type SandboxedJobProcessor<T = any, R = any> = ((job: SandboxedJob<T, R>) => R | PromiseLike<R>) | ((job: SandboxedJob<T, R>, callback: (error: unknown, result: R) => void) => void);
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.js b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job-processor.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.d.ts b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.d.ts
new file mode 100644
index 0000000..655dfb9
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.d.ts
@@ -0,0 +1,34 @@
+import { JobJsonSandbox, JobProgress, JobsOptions } from '../types';
+import { MoveToWaitingChildrenOpts } from './minimal-job';
+/**
+ * @see {@link https://docs.bullmq.io/guide/workers/sandboxed-processors}
+ */
+export interface SandboxedJob<T = any, R = any> extends Omit<JobJsonSandbox, 'data' | 'opts' | 'returnvalue'> {
+    data: T;
+    opts: JobsOptions;
+    queueQualifiedName: string;
+    moveToDelayed: (timestamp: number, token?: string) => Promise<void>;
+    moveToWait: (token?: string) => Promise<void>;
+    moveToWaitingChildren: (token?: string, opts?: MoveToWaitingChildrenOpts) => Promise<boolean>;
+    log: (row: string) => void;
+    updateData: (data: T) => Promise<void>;
+    updateProgress: (value: JobProgress) => Promise<void>;
+    getChildrenValues: <CT = any>() => Promise<{
+        [jobKey: string]: CT;
+    }>;
+    getIgnoredChildrenFailures: () => Promise<{
+        [jobKey: string]: string;
+    }>;
+    getDependenciesCount: (opts?: {
+        failed?: boolean;
+        ignored?: boolean;
+        processed?: boolean;
+        unprocessed?: boolean;
+    }) => Promise<{
+        failed?: number;
+        ignored?: number;
+        processed?: number;
+        unprocessed?: number;
+    }>;
+    returnValue: R;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.js b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-job.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.d.ts
new file mode 100644
index 0000000..a26c266
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.d.ts
@@ -0,0 +1,26 @@
+import { ForkOptions } from 'child_process';
+import { WorkerOptions as WorkerThreadsOptions } from 'worker_threads';
+export interface SandboxedOptions {
+    /**
+     * Use Worker Threads instead of Child Processes.
+     * Note: This option can only be used when specifying
+     * a file for the processor argument.
+     *
+     * @defaultValue false
+     */
+    useWorkerThreads?: boolean;
+    /**
+     * Support passing Worker Fork Options.
+     * Note: This option can only be used when specifying
+     * a file for the processor argument and useWorkerThreads is passed as false (default value).
+     * @see {@link https://nodejs.org/api/child_process.html#child_processforkmodulepath-args-options}
+     */
+    workerForkOptions?: ForkOptions;
+    /**
+     * Support passing Worker Threads Options.
+     * Note: This option can only be used when specifying
+     * a file for the processor argument and useWorkerThreads is passed as true.
+     * @see {@link https://nodejs.org/api/worker_threads.html#new-workerfilename-options}
+     */
+    workerThreadsOptions?: WorkerThreadsOptions;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.js b/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/sandboxed-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/script-queue-context.d.ts b/node_modules/bullmq/dist/esm/interfaces/script-queue-context.d.ts
new file mode 100644
index 0000000..50d8649
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/script-queue-context.d.ts
@@ -0,0 +1,22 @@
+import { RedisClient } from './connection';
+import { QueueBaseOptions } from './queue-options';
+import { KeysMap } from '../classes/queue-keys';
+import { DatabaseType } from '../types/database-type';
+export interface ScriptQueueContext {
+    opts: QueueBaseOptions;
+    toKey: (type: string) => string;
+    keys: KeysMap;
+    closing: Promise<void> | undefined;
+    /**
+     * Returns a promise that resolves to a redis client. Normally used only by subclasses.
+     */
+    get client(): Promise<RedisClient>;
+    /**
+     * Returns the database type of the Redis instance the client is connected to,
+     */
+    get databaseType(): DatabaseType;
+    /**
+     * Returns the version of the Redis instance the client is connected to,
+     */
+    get redisVersion(): string;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/script-queue-context.js b/node_modules/bullmq/dist/esm/interfaces/script-queue-context.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/script-queue-context.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/telemetry.d.ts b/node_modules/bullmq/dist/esm/interfaces/telemetry.d.ts
new file mode 100644
index 0000000..9de2004
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/telemetry.d.ts
@@ -0,0 +1,254 @@
+import { SpanKind } from '../enums';
+/**
+ * Telemetry interface
+ *
+ * This interface allows third-party libraries to integrate their own telemetry
+ * system. The interface is heavily inspired by OpenTelemetry but it's not
+ * limited to it.
+ *
+ */
+export interface Telemetry<Context = any> {
+    /**
+     * Tracer instance
+     *
+     * The tracer is responsible for creating spans and propagating the context
+     * across the application.
+     */
+    tracer: Tracer<Context>;
+    /**
+     * Context manager instance
+     *
+     * The context manager is responsible for managing the context and propagating
+     * it across the application.
+     */
+    contextManager: ContextManager;
+    /**
+     * Meter instance (optional)
+     *
+     * The meter is responsible for creating and managing metrics instruments
+     * such as counters, histograms, etc.
+     */
+    meter?: Meter;
+}
+/**
+ * Meter interface
+ *
+ * The meter is responsible for creating metric instruments.
+ */
+export interface Meter {
+    /**
+     * Creates a new Counter metric instrument.
+     *
+     * @param name - the name of the counter
+     * @param options - optional configuration for the counter
+     * @returns a Counter instance
+     */
+    createCounter(name: string, options?: MetricOptions): Counter;
+    /**
+     * Creates a new Histogram metric instrument.
+     *
+     * @param name - the name of the histogram
+     * @param options - optional configuration for the histogram
+     * @returns a Histogram instance
+     */
+    createHistogram(name: string, options?: MetricOptions): Histogram;
+    /**
+     * Creates a new Gauge metric instrument.
+     *
+     * A gauge is a metric that represents a single numerical value that can
+     * arbitrarily go up and down. Gauges are typically used for measured values
+     * like queue sizes.
+     *
+     * @param name - the name of the gauge
+     * @param options - optional configuration for the gauge
+     * @returns a Gauge instance
+     */
+    createGauge?(name: string, options?: MetricOptions): Gauge;
+}
+/**
+ * Options for creating metric instruments
+ */
+export interface MetricOptions {
+    /**
+     * Human-readable description of the metric
+     */
+    description?: string;
+    /**
+     * Unit of measurement for the metric (e.g., 'ms', 'bytes', '1')
+     */
+    unit?: string;
+}
+/**
+ * Counter metric interface
+ *
+ * A counter is a cumulative metric that represents a single monotonically
+ * increasing value. Counters are typically used to count requests, completed
+ * tasks, errors, etc.
+ */
+export interface Counter {
+    /**
+     * Adds a value to the counter.
+     *
+     * @param value - the value to add (must be non-negative)
+     * @param attributes - optional attributes to associate with this measurement
+     */
+    add(value: number, attributes?: Attributes): void;
+}
+/**
+ * Histogram metric interface
+ *
+ * A histogram is a metric that samples observations and counts them in
+ * configurable buckets. Typically used for measuring durations or sizes.
+ */
+export interface Histogram {
+    /**
+     * Records a value in the histogram.
+     *
+     * @param value - the value to record
+     * @param attributes - optional attributes to associate with this measurement
+     */
+    record(value: number, attributes?: Attributes): void;
+}
+/**
+ * Gauge metric interface
+ *
+ * A gauge is a synchronous instrument which can be used to record
+ * non-additive value(s) (e.g. the current queue size) when changes occur.
+ */
+export interface Gauge {
+    /**
+     * Records a value for the gauge.
+     *
+     * @param value - the value to record
+     * @param attributes - optional attributes to associate with this measurement
+     */
+    record(value: number, attributes?: Attributes): void;
+}
+/**
+ * Context manager interface
+ *
+ * The context manager is responsible for managing the context and propagating
+ * it across the application.
+ */
+export interface ContextManager<Context = any> {
+    /**
+     * Creates a new context and sets it as active for the fn passed as last argument
+     *
+     * @param context - the context to set as active
+     * @param fn - the function to execute with the context
+     */
+    with<A extends (...args: any[]) => any>(context: Context, fn: A): ReturnType<A>;
+    /**
+     * Returns the active context
+     */
+    active(): Context;
+    /**
+     * Returns a serialized version of the current context. The metadata
+     * is the mechanism used to propagate the context across a distributed
+     * application.
+     *
+     * @param context - the current context
+     */
+    getMetadata(context: Context): string;
+    /**
+     * Creates a new context from a serialized version effectively
+     * linking the new context to the parent context.
+     *
+     * @param activeContext - the current active context
+     * @param metadata - the serialized version of the context
+     */
+    fromMetadata(activeContext: Context, metadata: string): Context;
+}
+/**
+ * Tracer interface
+ *
+ */
+export interface Tracer<Context = any> {
+    /**
+     * startSpan creates a new Span with the given name and options on an optional
+     * context. If the context is not provided, the current active context should be
+     * used.
+     *
+     * @param name - span name
+     * @param options - span options
+     * @param context - optional context
+     * @returns - the created span
+     */
+    startSpan(name: string, options?: SpanOptions, context?: Context): Span;
+}
+export interface SpanOptions {
+    kind: SpanKind;
+}
+/**
+ * Span interface
+ */
+export interface Span<Context = any> {
+    /**
+     * setSpanOnContext sets the span on the context. This is useful when you want
+     * to propagate the span across the application.
+     *
+     * @param ctx - context to set the span on
+     * @returns - the context with the span set on it
+     */
+    setSpanOnContext(ctx: Context): Context;
+    /**
+     * setAttribute sets an attribute on the span.
+     *
+     * @param key - attribute key
+     * @param value - attribute value
+     */
+    setAttribute(key: string, value: AttributeValue): void;
+    /**
+     * setAttributes sets multiple attributes on the span.
+     *
+     * @param attributes - attributes to set
+     */
+    setAttributes(attributes: Attributes): void;
+    /**
+     * addEvent adds an event to the span.
+     *
+     * @param name - event name
+     * @param attributes - event attributes
+     */
+    addEvent(name: string, attributes?: Attributes): void;
+    /**
+     * recordException records an exception on the span.
+     *
+     * @param exception - exception to record
+     * @param time - time to record the exception
+     */
+    recordException(exception: Exception, time?: Time): void;
+    /**
+     * end ends the span.
+     *
+     * Note: spans must be ended so that they can be exported.
+     */
+    end(): void;
+}
+export interface Attributes {
+    [attribute: string]: AttributeValue | undefined;
+}
+export type AttributeValue = string | number | boolean | Array<null | undefined | string> | Array<null | undefined | number> | Array<null | undefined | boolean>;
+export type Exception = string | ExceptionType;
+export type ExceptionType = CodeException | MessageException | NameException;
+interface CodeException {
+    code: string | number;
+    name?: string;
+    message?: string;
+    stack?: string;
+}
+interface MessageException {
+    code?: string | number;
+    name?: string;
+    message: string;
+    stack?: string;
+}
+interface NameException {
+    code?: string | number;
+    name: string;
+    message?: string;
+    stack?: string;
+}
+export type Time = HighResolutionTime | number | Date;
+type HighResolutionTime = [number, number];
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/telemetry.js b/node_modules/bullmq/dist/esm/interfaces/telemetry.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/telemetry.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/interfaces/worker-options.d.ts b/node_modules/bullmq/dist/esm/interfaces/worker-options.d.ts
new file mode 100644
index 0000000..063d1a7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/worker-options.d.ts
@@ -0,0 +1,151 @@
+import { AdvancedOptions } from './advanced-options';
+import { QueueBaseOptions } from './queue-options';
+import { RateLimiterOptions } from './rate-limiter-options';
+import { MetricsOptions } from './metrics-options';
+import { KeepJobs } from '../types/keep-jobs';
+import { Telemetry } from './telemetry';
+import { SandboxedOptions } from './sandboxed-options';
+export interface WorkerOptions extends QueueBaseOptions, SandboxedOptions {
+    /**
+     * Optional worker name. The name will be stored on every job
+     * processed by this worker instance, and can be used to monitor
+     * which worker is processing or has processed a given job.
+     */
+    name?: string;
+    /**
+     * Condition to start processor at instance creation.
+     *
+     * @defaultValue true
+     */
+    autorun?: boolean;
+    /**
+     * Amount of jobs that a single worker is allowed to work on
+     * in parallel.
+     *
+     * @defaultValue 1
+     * @see {@link https://docs.bullmq.io/guide/workers/concurrency}
+     */
+    concurrency?: number;
+    /**
+     * Enable rate limiter
+     * @see {@link https://docs.bullmq.io/guide/rate-limiting}
+     */
+    limiter?: RateLimiterOptions;
+    /**
+     * Enable collect metrics.
+     * @see {@link https://docs.bullmq.io/guide/metrics}
+     */
+    metrics?: MetricsOptions;
+    /**
+     * Maximum time in milliseconds where the job is idle while being rate limited.
+     * While workers are idle because of a rate limiter, they won't fetch new jobs to process
+     * and delayed jobs won't be promoted.
+     * @defaultValue 30000
+     */
+    maximumRateLimitDelay?: number;
+    /**
+     * Defines the maximum number of times a job is allowed to start processing,
+     * regardless of whether it completes or fails. Each time a worker picks up the job
+     * and begins processing it, the attemptsStarted counter is incremented.
+     * If this counter reaches maxStartedAttempts, the job will be moved to the failed state with an UnrecoverableError.
+     * @defaultValue undefined
+     */
+    maxStartedAttempts?: number;
+    /**
+     * Amount of times a job can be recovered from a stalled state
+     * to the `wait` state. If this is exceeded, the job is moved
+     * to `failed`.
+     *
+     * @defaultValue 1
+     */
+    maxStalledCount?: number;
+    /**
+     * Number of milliseconds between stallness checks.
+     *
+     * @defaultValue 30000
+     */
+    stalledInterval?: number;
+    /**
+     * You can provide an object specifying max
+     * age and/or count to keep.
+     * Default behavior is to keep the job in the completed set.
+     *
+     * Eviction is evaluated on a best-effort basis when a job finishes,
+     * so aged jobs are only removed once another job completes after
+     * their expiration.
+     */
+    removeOnComplete?: KeepJobs;
+    /**
+     * You can provide an object specifying max
+     * age and/or count to keep.
+     * Default behavior is to keep the job in the failed set.
+     *
+     * Eviction is evaluated on a best-effort basis when a job fails, so
+     * aged jobs are only removed once another job fails after their
+     * expiration.
+     */
+    removeOnFail?: KeepJobs;
+    /**
+     *  Skip stalled check for this worker. Note that other workers could still
+     *  perform stalled checks and move jobs back to wait for jobs being processed
+     *  by this worker.
+     *
+     *  @defaultValue false
+     */
+    skipStalledCheck?: boolean;
+    /**
+     *  Skip lock renewal for this worker. If set to true, the lock will expire
+     *  after lockDuration and moved back to the wait queue (if the stalled check is
+     *  not disabled)
+     *
+     *  @defaultValue false
+     */
+    skipLockRenewal?: boolean;
+    /**
+     * Number of seconds to long poll for jobs when the queue is empty.
+     *
+     * @defaultValue 5
+     */
+    drainDelay?: number;
+    /**
+     * Duration of the lock for the job in milliseconds. The lock represents that
+     * a worker is processing the job. If the lock is lost, the job will be eventually
+     * be picked up by the stalled checker and move back to wait so that another worker
+     * can process it again.
+     *
+     * @defaultValue 30000
+     */
+    lockDuration?: number;
+    /**
+     * The time in milliseconds before the lock is automatically renewed.
+     *
+     * It is not recommended to modify this value, which is by default set to
+     * half the lockDuration value, which is optimal for most use cases.
+     */
+    lockRenewTime?: number;
+    /**
+     * This is an internal option that should not be modified.
+     *
+     * @defaultValue 15000
+     */
+    runRetryDelay?: number;
+    /**
+     * More advanced options.
+     */
+    settings?: AdvancedOptions;
+    /**
+     * Use Worker Threads instead of Child Processes.
+     * Note: This option can only be used when specifying
+     * a file for the processor argument.
+     *
+     * @defaultValue false
+     */
+    useWorkerThreads?: boolean;
+    /**
+     * Telemetry Addon
+     */
+    telemetry?: Telemetry;
+}
+export interface GetNextJobOptions {
+    block?: boolean;
+}
diff --git a/node_modules/bullmq/dist/esm/interfaces/worker-options.js b/node_modules/bullmq/dist/esm/interfaces/worker-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/interfaces/worker-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.d.ts b/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.d.ts
new file mode 100644
index 0000000..27310ab
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.d.ts
@@ -0,0 +1,5 @@
+export declare const addDelayedJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.js b/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.js
new file mode 100644
index 0000000..be5860f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addDelayedJob-6.js
@@ -0,0 +1,576 @@
+const content = `--[[
+  Adds a delayed job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - computes timestamp.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'delayed'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (use custom instead of one generated automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local delayedKey = KEYS[4]
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local opts = cmsgpack.unpack(ARGV[3])
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, delayedKey, deduplicationKey,
+  eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+    opts, timestamp, parentKey, parentData, repeatJobKey)
+addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, KEYS[1], delay)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+export const addDelayedJob = {
+    name: 'addDelayedJob',
+    content,
+    keys: 6,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.d.ts b/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.d.ts
new file mode 100644
index 0000000..e312108
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.d.ts
@@ -0,0 +1,5 @@
+export declare const addJobScheduler: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.js b/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.js
new file mode 100644
index 0000000..375204c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addJobScheduler-11.js
@@ -0,0 +1,592 @@
+const content = `--[[
+  Adds a job scheduler, i.e. a job factory that creates jobs based on a given schedule (repeat options).
+    Input:
+      KEYS[1]  'repeat' key
+      KEYS[2]  'delayed' key
+      KEYS[3]  'wait' key
+      KEYS[4]  'paused' key
+      KEYS[5]  'meta' key
+      KEYS[6]  'prioritized' key
+      KEYS[7]  'marker' key
+      KEYS[8]  'id' key
+      KEYS[9]  'events' key
+      KEYS[10] 'pc' priority counter
+      KEYS[11] 'active' key
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] jobs scheduler id
+      ARGV[4] Json stringified template data
+      ARGV[5] mspacked template opts
+      ARGV[6] msgpacked delayed opts
+      ARGV[7] timestamp
+      ARGV[8] prefix key
+      ARGV[9] producer key
+      Output:
+        repeatableKey  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local eventsKey = KEYS[9]
+local nextMillis = ARGV[1]
+local jobSchedulerId = ARGV[3]
+local templateOpts = cmsgpack.unpack(ARGV[5])
+local now = tonumber(ARGV[7])
+local prefixKey = ARGV[8]
+local jobOpts = cmsgpack.unpack(ARGV[6])
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+--[[
+  Function to store a job scheduler
+]]
+local function storeJobScheduler(schedulerId, schedulerKey, repeatKey, nextMillis, opts,
+  templateData, templateOpts)
+  rcall("ZADD", repeatKey, nextMillis, schedulerId)
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+  if opts['limit'] then
+    table.insert(optionalValues, "limit")
+    table.insert(optionalValues, opts['limit'])
+  end
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+  if opts['startDate'] then
+    table.insert(optionalValues, "startDate")
+    table.insert(optionalValues, opts['startDate'])
+  end
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+  if opts['offset'] then
+    table.insert(optionalValues, "offset")
+    table.insert(optionalValues, opts['offset'])
+  else
+    local offset = rcall("HGET", schedulerKey, "offset")
+    if offset then
+      table.insert(optionalValues, "offset")
+      table.insert(optionalValues, tonumber(offset))
+    end
+  end
+  local jsonTemplateOpts = cjson.encode(templateOpts)
+  if jsonTemplateOpts and jsonTemplateOpts ~= '{}' then
+    table.insert(optionalValues, "opts")
+    table.insert(optionalValues, jsonTemplateOpts)
+  end
+  if templateData and templateData ~= '{}' then
+    table.insert(optionalValues, "data")
+    table.insert(optionalValues, templateData)
+  end
+  table.insert(optionalValues, "ic")
+  table.insert(optionalValues, rcall("HGET", schedulerKey, "ic") or 1)
+  rcall("DEL", schedulerKey) -- remove all attributes and then re-insert new ones
+  rcall("HMSET", schedulerKey, "name", opts['name'], unpack(optionalValues))
+end
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+local maxEvents = getOrSetMaxEvents(metaKey)
+local templateData = ARGV[4]
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+end
+local schedulerOpts = cmsgpack.unpack(ARGV[2])
+local every = schedulerOpts['every']
+-- For backwards compatibility we also check the offset from the job itself.
+-- could be removed in future major versions.
+local jobOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+local offset = schedulerOpts['offset'] or jobOffset or 0
+local newOffset = offset
+local updatedEvery = false
+if every then
+    -- if we changed the 'every' value we need to reset millis to nil
+    local millis = prevMillis
+    if prevMillis then
+        local prevEvery = tonumber(rcall("HGET", schedulerKey, "every"))
+        if prevEvery ~= every then
+            millis = nil
+            updatedEvery = true
+        end
+    end
+    local startDate = schedulerOpts['startDate']
+    nextMillis, newOffset = getJobSchedulerEveryNextMillis(millis, every, now, offset, startDate)
+end
+local function removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, jobId, metaKey,
+    eventsKey)
+    if rcall("ZSCORE", delayedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", delayedKey, jobId)
+        return true
+    elseif rcall("ZSCORE", prioritizedKey, jobId) then
+        removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+        rcall("ZREM", prioritizedKey, jobId)
+        return true
+    else
+        local pausedOrWaitKey = waitKey
+        if isQueuePaused(metaKey) then
+            pausedOrWaitKey = pausedKey
+        end
+        if rcall("LREM", pausedOrWaitKey, 1, jobId) > 0 then
+            removeJob(jobId, true, prefixKey, true --[[remove debounce key]] )
+            return true
+        end
+    end
+    return false
+end
+local removedPrevJob = false
+if prevMillis then
+    local currentJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    local currentJobKey = schedulerKey .. ":" .. prevMillis
+    -- In theory it should always exist the currentJobKey if there is a prevMillis unless something has
+    -- gone really wrong.
+    if rcall("EXISTS", currentJobKey) == 1 then
+        removedPrevJob = removeJobFromScheduler(prefixKey, delayedKey, prioritizedKey, waitKey, pausedKey, currentJobId,
+            metaKey, eventsKey)
+    end
+end
+if removedPrevJob then
+    -- The jobs has been removed and we want to replace it, so lets use the same millis.
+    if every and not updatedEvery then
+        nextMillis = prevMillis
+    end
+else
+    -- Special case where no job was removed, and we need to add the next iteration.
+    schedulerOpts['offset'] = newOffset
+end
+-- Check for job ID collision with existing jobs (in any state)
+local jobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+local jobKey = prefixKey .. jobId
+-- If there's already a job with this ID, in a state 
+-- that is not updatable (active, completed, failed) we must 
+-- handle the collision
+local hasCollision = false
+if rcall("EXISTS", jobKey) == 1 then
+    if every then
+        -- For 'every' case: try next time slot to avoid collision
+        local nextSlotMillis = nextMillis + every
+        local nextSlotJobId = "repeat:" .. jobSchedulerId .. ":" .. nextSlotMillis
+        local nextSlotJobKey = prefixKey .. nextSlotJobId
+        if rcall("EXISTS", nextSlotJobKey) == 0 then
+            -- Next slot is free, use it
+            nextMillis = nextSlotMillis
+            jobId = nextSlotJobId
+        else
+            -- Next slot also has a job, return error code
+            return -11 -- SchedulerJobSlotsBusy
+        end
+    else
+        hasCollision = true
+    end
+end
+local delay = nextMillis - now
+-- Fast Clamp delay to minimum of 0
+if delay < 0 then
+    delay = 0
+end
+local nextJobKey = schedulerKey .. ":" .. nextMillis
+if not hasCollision or removedPrevJob then
+    -- jobId already calculated above during collision check
+    storeJobScheduler(jobSchedulerId, schedulerKey, repeatKey, nextMillis, schedulerOpts, templateData, templateOpts)
+    rcall("INCR", KEYS[8])
+    addJobFromScheduler(nextJobKey, jobId, jobOpts, waitKey, pausedKey, KEYS[11], metaKey, prioritizedKey, KEYS[10],
+        delayedKey, KEYS[7], eventsKey, schedulerOpts['name'], maxEvents, now, templateData, jobSchedulerId, delay)
+elseif hasCollision then
+    -- For 'pattern' case: return error code
+    return -10 -- SchedulerJobIdCollision
+end
+if ARGV[9] ~= "" then
+    rcall("HSET", ARGV[9], "nrjid", jobId)
+end
+return {jobId .. "", delay}
+`;
+export const addJobScheduler = {
+    name: 'addJobScheduler',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addLog-2.d.ts b/node_modules/bullmq/dist/esm/scripts/addLog-2.d.ts
new file mode 100644
index 0000000..aec3371
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addLog-2.d.ts
@@ -0,0 +1,5 @@
+export declare const addLog: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addLog-2.js b/node_modules/bullmq/dist/esm/scripts/addLog-2.js
new file mode 100644
index 0000000..e7b2d3e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addLog-2.js
@@ -0,0 +1,29 @@
+const content = `--[[
+  Add job log
+  Input:
+    KEYS[1] job id key
+    KEYS[2] job logs key
+    ARGV[1] id
+    ARGV[2] log
+    ARGV[3] keepLogs
+  Output:
+    -1 - Missing job.
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+  local logCount = rcall("RPUSH", KEYS[2], ARGV[2])
+  if ARGV[3] ~= '' then
+    local keepLogs = tonumber(ARGV[3])
+    rcall("LTRIM", KEYS[2], -keepLogs, -1)
+    return math.min(keepLogs, logCount)
+  end
+  return logCount
+else
+  return -1
+end
+`;
+export const addLog = {
+    name: 'addLog',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addParentJob-6.d.ts b/node_modules/bullmq/dist/esm/scripts/addParentJob-6.d.ts
new file mode 100644
index 0000000..3224183
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addParentJob-6.d.ts
@@ -0,0 +1,5 @@
+export declare const addParentJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addParentJob-6.js b/node_modules/bullmq/dist/esm/scripts/addParentJob-6.js
new file mode 100644
index 0000000..74f4787
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addParentJob-6.js
@@ -0,0 +1,473 @@
+const content = `--[[
+  Adds a parent job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - adds the job to the waiting-children zset
+    Input:
+      KEYS[1] 'meta'
+      KEYS[2] 'id'
+      KEYS[3] 'delayed'
+      KEYS[4] 'waiting-children'
+      KEYS[5] 'completed'
+      KEYS[6] events stream key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local metaKey = KEYS[1]
+local idKey = KEYS[2]
+local delayedKey = KEYS[3]
+local completedKey = KEYS[5]
+local eventsKey = KEYS[6]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationId = opts['de'] and opts['de']['id']
+if deduplicationId then
+    local deduplicationJobId = deduplicateJobWithoutReplace(deduplicationId, opts['de'],
+        jobId, deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationJobId then
+        return deduplicationJobId
+    end
+end
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+local waitChildrenKey = KEYS[4]
+rcall("ZADD", waitChildrenKey, timestamp, jobId)
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+      "waiting-children", "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+export const addParentJob = {
+    name: 'addParentJob',
+    content,
+    keys: 6,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.d.ts b/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.d.ts
new file mode 100644
index 0000000..764235c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.d.ts
@@ -0,0 +1,5 @@
+export declare const addPrioritizedJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.js b/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.js
new file mode 100644
index 0000000..053700e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addPrioritizedJob-9.js
@@ -0,0 +1,546 @@
+const content = `--[[
+  Adds a prioritized job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - Adds the job to the "added" list so that workers gets notified.
+    Input:
+      KEYS[1] 'marker',
+      KEYS[2] 'meta'
+      KEYS[3] 'id'
+      KEYS[4] 'prioritized'
+      KEYS[5] 'delayed'
+      KEYS[6] 'completed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] 'pc' priority counter
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]] 
+local metaKey = KEYS[2]
+local idKey = KEYS[3]
+local priorityKey = KEYS[4]
+local completedKey = KEYS[6]
+local activeKey = KEYS[7]
+local eventsKey = KEYS[8]
+local priorityCounterKey = KEYS[9]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", idKey)
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, completedKey, eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[5],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+-- Store the job.
+local delay, priority = storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2],
+                                 opts, timestamp, parentKey, parentData,
+                                 repeatJobKey)
+-- Add the job to the prioritized set
+local isPausedOrMaxed = isQueuePausedOrMaxed(metaKey, activeKey)
+addJobWithPriority( KEYS[1], priorityKey, priority, jobId, priorityCounterKey, isPausedOrMaxed)
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+export const addPrioritizedJob = {
+    name: 'addPrioritizedJob',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.d.ts b/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.d.ts
new file mode 100644
index 0000000..db36b91
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.d.ts
@@ -0,0 +1,5 @@
+export declare const addRepeatableJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.js b/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.js
new file mode 100644
index 0000000..b88fce4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addRepeatableJob-2.js
@@ -0,0 +1,234 @@
+const content = `--[[
+  Adds a repeatable job
+    Input:
+      KEYS[1] 'repeat' key
+      KEYS[2] 'delayed' key
+      ARGV[1] next milliseconds
+      ARGV[2] msgpacked options
+            [1]  name
+            [2]  tz?
+            [3]  pattern?
+            [4]  endDate?
+            [5]  every?
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      ARGV[4] custom key
+      ARGV[5] prefix key
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local nextMillis = ARGV[1]
+local legacyCustomKey = ARGV[3]
+local customKey = ARGV[4]
+local prefixKey = ARGV[5]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function storeRepeatableJob(repeatKey, customKey, nextMillis, rawOpts)
+  rcall("ZADD", repeatKey, nextMillis, customKey)
+  local opts = cmsgpack.unpack(rawOpts)
+  local optionalValues = {}
+  if opts['tz'] then
+    table.insert(optionalValues, "tz")
+    table.insert(optionalValues, opts['tz'])
+  end
+  if opts['pattern'] then
+    table.insert(optionalValues, "pattern")
+    table.insert(optionalValues, opts['pattern'])
+  end
+  if opts['endDate'] then
+    table.insert(optionalValues, "endDate")
+    table.insert(optionalValues, opts['endDate'])
+  end
+  if opts['every'] then
+    table.insert(optionalValues, "every")
+    table.insert(optionalValues, opts['every'])
+  end
+  rcall("HMSET", repeatKey .. ":" .. customKey, "name", opts['name'],
+    unpack(optionalValues))
+  return customKey
+end
+-- If we are overriding a repeatable job we must delete the delayed job for
+-- the next iteration.
+local prevMillis = rcall("ZSCORE", repeatKey, customKey)
+if prevMillis then
+  local delayedJobId =  "repeat:" .. customKey .. ":" .. prevMillis
+  local nextDelayedJobId =  repeatKey .. ":" .. customKey .. ":" .. nextMillis
+  if rcall("ZSCORE", delayedKey, delayedJobId)
+   and rcall("EXISTS", nextDelayedJobId) ~= 1 then
+    removeJob(delayedJobId, true, prefixKey, true --[[remove debounce key]])
+    rcall("ZREM", delayedKey, delayedJobId)
+  end
+end
+-- Keep backwards compatibility with old repeatable jobs (<= 3.0.0)
+if rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+  return storeRepeatableJob(repeatKey, legacyCustomKey, nextMillis, ARGV[2])
+end
+return storeRepeatableJob(repeatKey, customKey, nextMillis, ARGV[2])
+`;
+export const addRepeatableJob = {
+    name: 'addRepeatableJob',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.d.ts b/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.d.ts
new file mode 100644
index 0000000..0d983a5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.d.ts
@@ -0,0 +1,5 @@
+export declare const addStandardJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.js b/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.js
new file mode 100644
index 0000000..4db24f1
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/addStandardJob-9.js
@@ -0,0 +1,550 @@
+const content = `--[[
+  Adds a job to the queue by doing the following:
+    - Increases the job counter if needed.
+    - Creates a new job key with the job data.
+    - if delayed:
+      - computes timestamp.
+      - adds to delayed zset.
+      - Emits a global event 'delayed' if the job is delayed.
+    - if not delayed
+      - Adds the jobId to the wait/paused list in one of three ways:
+         - LIFO
+         - FIFO
+         - prioritized.
+      - Adds the job to the "added" list so that workers gets notified.
+    Input:
+      KEYS[1] 'wait',
+      KEYS[2] 'paused'
+      KEYS[3] 'meta'
+      KEYS[4] 'id'
+      KEYS[5] 'completed'
+      KEYS[6] 'delayed'
+      KEYS[7] 'active'
+      KEYS[8] events stream key
+      KEYS[9] marker key
+      ARGV[1] msgpacked arguments array
+            [1]  key prefix,
+            [2]  custom id (will not generate one automatically)
+            [3]  name
+            [4]  timestamp
+            [5]  parentKey?
+            [6]  parent dependencies key.
+            [7]  parent? {id, queueKey}
+            [8]  repeat job key
+            [9] deduplication key
+      ARGV[2] Json stringified job data
+      ARGV[3] msgpacked options
+      Output:
+        jobId  - OK
+        -5     - Missing parent key
+]]
+local eventsKey = KEYS[8]
+local jobId
+local jobIdKey
+local rcall = redis.call
+local args = cmsgpack.unpack(ARGV[1])
+local data = ARGV[2]
+local opts = cmsgpack.unpack(ARGV[3])
+local parentKey = args[5]
+local parent = args[7]
+local repeatJobKey = args[8]
+local deduplicationKey = args[9]
+local parentData
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to debounce a job.
+]]
+-- Includes
+--[[
+  Function to deduplicate a job.
+]]
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Function to store a deduplicated next job if the existing job is active
+  and keepLastIfActive is set. When the active job finishes, the stored
+  proto-job is used to create a real job in the queue.
+  Returns true if the proto-job was stored, false otherwise.
+]]
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local function storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    if deduplicationOpts['keepLastIfActive'] and currentDebounceJobId then
+        local activeKey = prefix .. "active"
+        local activeItems = rcall('LRANGE', activeKey, 0, -1)
+        if checkItemInList(activeItems, currentDebounceJobId) then
+            local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+            local fields = {'name', jobName, 'data', jobData, 'opts', cjson.encode(fullOpts),
+                'jid', jobId}
+            if parentKey then
+                fields[#fields+1] = 'pk'
+                fields[#fields+1] = parentKey
+            end
+            if parentData then
+                fields[#fields+1] = 'pd'
+                fields[#fields+1] = parentData
+            end
+            if parentDependenciesKey then
+                fields[#fields+1] = 'pdk'
+                fields[#fields+1] = parentDependenciesKey
+            end
+            if repeatJobKey then
+                fields[#fields+1] = 'rjk'
+                fields[#fields+1] = repeatJobKey
+            end
+            rcall('DEL', deduplicationNextKey)
+            rcall('HSET', deduplicationNextKey, unpack(fields))
+            -- Ensure the dedup key does not expire while the job is active,
+            -- so subsequent adds always hit the dedup path and never bypass
+            -- the active-check because of a TTL expiry.
+            local deduplicationKey = prefix .. "de:" .. deduplicationId
+            rcall('PERSIST', deduplicationKey)
+            -- TODO remove debounced event in next breaking change
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+                currentDebounceJobId, "debounceId", deduplicationId)
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+            return true
+        end
+    end
+    return false
+end
+local function deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts, jobId, deduplicationKey,
+    eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+    parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local ttl = deduplicationOpts['ttl']
+    local deduplicationKeyExists
+    if ttl and ttl > 0 then
+        if deduplicationOpts['extend'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                    deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                    parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+                    return currentDebounceJobId
+                end
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, currentDebounceJobId)
+                else
+                    setDeduplicationKey(deduplicationKey, currentDebounceJobId, deduplicationOpts)
+                end
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced",
+                    "jobId", currentDebounceJobId, "debounceId", deduplicationId)
+                rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+                    currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+                return currentDebounceJobId
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            if deduplicationOpts['keepLastIfActive'] then
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+            else
+                deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'PX', ttl, 'NX')
+            end
+        end
+    else
+        deduplicationKeyExists = not rcall('SET', deduplicationKey, jobId, 'NX')
+    end
+    if deduplicationKeyExists then
+        local currentDebounceJobId = rcall('GET', deduplicationKey)
+        if storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+            deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+            parentKey, parentData, parentDependenciesKey, repeatJobKey) then
+            return currentDebounceJobId
+        end
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            currentDebounceJobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            currentDebounceJobId, "deduplicationId", deduplicationId, "deduplicatedJobId", jobId)
+        return currentDebounceJobId
+    end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents, currentDeduplicatedJobId,
+    jobId, deduplicationId, prefix)
+    if rcall("ZREM", delayedKey, currentDeduplicatedJobId) > 0 then
+        removeJobKeys(prefix .. currentDeduplicatedJobId)
+        rcall("XADD", eventsKey, "*", "event", "removed", "jobId", currentDeduplicatedJobId,
+            "prev", "delayed")
+        -- TODO remove debounced event in next breaking change
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "debounced", "jobId",
+            jobId, "debounceId", deduplicationId)
+        rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "deduplicated", "jobId",
+            jobId, "deduplicationId", deduplicationId, "deduplicatedJobId", currentDeduplicatedJobId)
+        return true
+    end
+    return false
+end
+local function deduplicateJob(deduplicationOpts, jobId, delayedKey, deduplicationKey, eventsKey, maxEvents,
+    prefix, jobName, jobData, fullOpts, parentKey, parentData, parentDependenciesKey, repeatJobKey)
+    local deduplicationId = deduplicationOpts and deduplicationOpts['id']
+    if deduplicationId then
+        if deduplicationOpts['replace'] then
+            local currentDebounceJobId = rcall('GET', deduplicationKey)
+            if currentDebounceJobId then
+                local isRemoved = removeDelayedJob(delayedKey, deduplicationKey, eventsKey, maxEvents,
+                    currentDebounceJobId, jobId, deduplicationId, prefix)
+                if isRemoved then
+                    if deduplicationOpts['keepLastIfActive'] then
+                        rcall('SET', deduplicationKey, jobId)
+                    else
+                        local ttl = deduplicationOpts['ttl']
+                        if not deduplicationOpts['extend'] and ttl and ttl > 0 then
+                            rcall('SET', deduplicationKey, jobId, 'KEEPTTL')
+                        else
+                            setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                        end
+                    end
+                    return
+                else
+                    storeDeduplicatedNextJob(deduplicationOpts, currentDebounceJobId, prefix,
+                        deduplicationId, jobName, jobData, fullOpts, eventsKey, maxEvents, jobId,
+                        parentKey, parentData, parentDependenciesKey, repeatJobKey)
+                    return currentDebounceJobId
+                end
+            else
+                if deduplicationOpts['keepLastIfActive'] then
+                    rcall('SET', deduplicationKey, jobId)
+                else
+                    setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+                end
+                return
+            end
+        else
+            return deduplicateJobWithoutReplace(deduplicationId, deduplicationOpts,
+                jobId, deduplicationKey, eventsKey, maxEvents, prefix, jobName, jobData, fullOpts,
+                parentKey, parentData, parentDependenciesKey, repeatJobKey)
+        end
+    end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to handle the case when job is duplicated.
+]]
+-- Includes
+--[[
+    This function is used to update the parent's dependencies if the job
+    is already completed and about to be ignored. The parent must get its
+    dependencies updated to avoid the parent job being stuck forever in 
+    the waiting-children state.
+]]
+-- Includes
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+local function updateExistingJobsParent(parentKey, parent, parentData,
+                                        parentDependenciesKey, completedKey,
+                                        jobIdKey, jobId, timestamp)
+    if parentKey ~= nil then
+        if rcall("ZSCORE", completedKey, jobId) then
+            local returnvalue = rcall("HGET", jobIdKey, "returnvalue")
+            updateParentDepsIfNeeded(parentKey, parent['queueKey'],
+                                     parentDependenciesKey, parent['id'],
+                                     jobIdKey, returnvalue, timestamp)
+        else
+            if parentDependenciesKey ~= nil then
+                rcall("SADD", parentDependenciesKey, jobIdKey)
+            end
+        end
+        rcall("HMSET", jobIdKey, "parentKey", parentKey, "parent", parentData)
+    end
+end
+local function handleDuplicatedJob(jobKey, jobId, currentParentKey, currentParent,
+  parentData, parentDependenciesKey, completedKey, eventsKey, maxEvents, timestamp)
+  local existedParentKey = rcall("HGET", jobKey, "parentKey")
+  if not existedParentKey or existedParentKey == currentParentKey then
+    updateExistingJobsParent(currentParentKey, currentParent, parentData,
+      parentDependenciesKey, completedKey, jobKey,
+      jobId, timestamp)
+  else
+    if currentParentKey ~= nil and currentParentKey ~= existedParentKey
+      and (rcall("EXISTS", existedParentKey) == 1) then
+      return -7
+    end
+  end
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event",
+    "duplicated", "jobId", jobId)
+  return jobId .. "" -- convert to string
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+if parentKey ~= nil then
+    if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+    parentData = cjson.encode(parent)
+end
+local jobCounter = rcall("INCR", KEYS[4])
+local metaKey = KEYS[3]
+local maxEvents = getOrSetMaxEvents(metaKey)
+local parentDependenciesKey = args[6]
+local timestamp = args[4]
+if args[2] == "" then
+    jobId = jobCounter
+    jobIdKey = args[1] .. jobId
+else
+    jobId = args[2]
+    jobIdKey = args[1] .. jobId
+    if rcall("EXISTS", jobIdKey) == 1 then
+        return handleDuplicatedJob(jobIdKey, jobId, parentKey, parent,
+            parentData, parentDependenciesKey, KEYS[5], eventsKey,
+            maxEvents, timestamp)
+    end
+end
+local deduplicationJobId = deduplicateJob(opts['de'], jobId, KEYS[6],
+  deduplicationKey, eventsKey, maxEvents, args[1], args[3], ARGV[2], opts,
+  parentKey, parentData, parentDependenciesKey, repeatJobKey)
+if deduplicationJobId then
+  return deduplicationJobId
+end
+-- Store the job.
+storeJob(eventsKey, jobIdKey, jobId, args[3], ARGV[2], opts, timestamp,
+         parentKey, parentData, repeatJobKey)
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[1], KEYS[2])
+-- LIFO or FIFO
+local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+addJobInTargetList(target, KEYS[9], pushCmd, isPausedOrMaxed, jobId)
+-- Emit waiting event
+rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId)
+-- Check if this job is a child of another job, if so add it to the parents dependencies
+if parentDependenciesKey ~= nil then
+    rcall("SADD", parentDependenciesKey, jobIdKey)
+end
+return jobId .. "" -- convert to string
+`;
+export const addStandardJob = {
+    name: 'addStandardJob',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/changeDelay-4.d.ts b/node_modules/bullmq/dist/esm/scripts/changeDelay-4.d.ts
new file mode 100644
index 0000000..5eb2040
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/changeDelay-4.d.ts
@@ -0,0 +1,5 @@
+export declare const changeDelay: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/changeDelay-4.js b/node_modules/bullmq/dist/esm/scripts/changeDelay-4.js
new file mode 100644
index 0000000..3c03e29
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/changeDelay-4.js
@@ -0,0 +1,103 @@
+const content = `--[[
+  Change job delay when it is in delayed set.
+  Input:
+    KEYS[1] delayed key
+    KEYS[2] meta key
+    KEYS[3] marker key
+    KEYS[4] events stream
+    ARGV[1] delay
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] job key
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in delayed set.
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+if rcall("EXISTS", ARGV[4]) == 1 then
+  local jobId = ARGV[3]
+  local delay = tonumber(ARGV[1])
+  local score, delayedTimestamp = getDelayedScore(KEYS[1], ARGV[2], delay)
+  local numRemovedElements = rcall("ZREM", KEYS[1], jobId)
+  if numRemovedElements < 1 then
+    return -3
+  end
+  rcall("HSET", ARGV[4], "delay", delay)
+  rcall("ZADD", KEYS[1], score, jobId)
+  local maxEvents = getOrSetMaxEvents(KEYS[2])
+  rcall("XADD", KEYS[4], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(KEYS[3], KEYS[1])
+  return 0
+else
+  return -1
+end`;
+export const changeDelay = {
+    name: 'changeDelay',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/changePriority-7.d.ts b/node_modules/bullmq/dist/esm/scripts/changePriority-7.d.ts
new file mode 100644
index 0000000..85f8a19
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/changePriority-7.d.ts
@@ -0,0 +1,5 @@
+export declare const changePriority: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/changePriority-7.js b/node_modules/bullmq/dist/esm/scripts/changePriority-7.js
new file mode 100644
index 0000000..20e0c91
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/changePriority-7.js
@@ -0,0 +1,124 @@
+const content = `--[[
+  Change job priority
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'active'
+    KEYS[6] 'pc' priority counter
+    KEYS[7] 'marker'
+    ARGV[1] priority value
+    ARGV[2] prefix key
+    ARGV[3] job id
+    ARGV[4] lifo
+    Output:
+       0  - OK
+      -1  - Missing job
+]]
+local jobId = ARGV[3]
+local jobKey = ARGV[2] .. jobId
+local priority = tonumber(ARGV[1])
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
+local function reAddJobWithNewPriority( prioritizedKey, markerKey, targetKey,
+    priorityCounter, lifo, priority, jobId, isPausedOrMaxed)
+    if priority == 0 then
+        local pushCmd = lifo and 'RPUSH' or 'LPUSH'
+        addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    else
+        if lifo then
+            pushBackJobWithPriority(prioritizedKey, priority, jobId)
+        else
+            addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+                priorityCounter, isPausedOrMaxed)
+        end
+    end
+end
+if rcall("EXISTS", jobKey) == 1 then
+    local metaKey = KEYS[3]
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[5], KEYS[1], KEYS[2])
+    local prioritizedKey = KEYS[4]
+    local priorityCounterKey = KEYS[6]
+    local markerKey = KEYS[7]
+    -- Re-add with the new priority
+    if rcall("ZREM", prioritizedKey, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    elseif rcall("LREM", target, -1, jobId) > 0 then
+        reAddJobWithNewPriority( prioritizedKey, markerKey, target,
+            priorityCounterKey, ARGV[4] == '1', priority, jobId, isPausedOrMaxed)
+    end
+    rcall("HSET", jobKey, "priority", priority)
+    return 0
+else
+    return -1
+end
+`;
+export const changePriority = {
+    name: 'changePriority',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.d.ts b/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.d.ts
new file mode 100644
index 0000000..466dd7e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.d.ts
@@ -0,0 +1,5 @@
+export declare const cleanJobsInSet: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.js b/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.js
new file mode 100644
index 0000000..e672efe
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/cleanJobsInSet-3.js
@@ -0,0 +1,365 @@
+const content = `--[[
+  Remove jobs from the specific set.
+  Input:
+    KEYS[1]  set key,
+    KEYS[2]  events stream key
+    KEYS[3]  repeat key
+    ARGV[1]  jobKey prefix
+    ARGV[2]  timestamp
+    ARGV[3]  limit the number of jobs to be removed. 0 is unlimited
+    ARGV[4]  set name, can be any of 'wait', 'active', 'paused', 'delayed', 'completed', or 'failed'
+]]
+local rcall = redis.call
+local repeatKey = KEYS[3]
+local rangeStart = 0
+local rangeEnd = -1
+local limit = tonumber(ARGV[3])
+-- If we're only deleting _n_ items, avoid retrieving all items
+-- for faster performance
+--
+-- Start from the tail of the list, since that's where oldest elements
+-- are generally added for FIFO lists
+if limit > 0 then
+  rangeStart = -1 - limit + 1
+  rangeEnd = -1
+end
+-- Includes
+--[[
+  Function to clean job list.
+  Returns jobIds and deleted count number.
+]]
+-- Includes
+--[[
+  Function to get the latest saved timestamp.
+]]
+local function getTimestamp(jobKey, attributes)
+  if #attributes == 1 then
+    return rcall("HGET", jobKey, attributes[1])
+  end
+  local jobTs
+  for _, ts in ipairs(rcall("HMGET", jobKey, unpack(attributes))) do
+    if (ts) then
+      jobTs = ts
+      break
+    end
+  end
+  return jobTs
+end
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function cleanList(listKey, jobKeyPrefix, rangeStart, rangeEnd,
+  timestamp, isWaiting, jobSchedulersKey)
+  local jobs = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  local deleted = {}
+  local deletedCount = 0
+  local jobTS
+  local deletionMarker = ''
+  local jobIdsLen = #jobs
+  for i, job in ipairs(jobs) do
+    if limit > 0 and deletedCount >= limit then
+      break
+    end
+    local jobKey = jobKeyPrefix .. job
+    if (isWaiting or rcall("EXISTS", jobKey .. ":lock") == 0) and
+      not isJobSchedulerJob(job, jobKey, jobSchedulersKey) then
+      -- Find the right timestamp of the job to compare to maxTimestamp:
+      -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+      -- * processedOn represents when the job was last attempted, but it doesn't get populated until
+      --   the job is first tried
+      -- * timestamp is the original job submission time
+      -- Fetch all three of these (in that order) and use the first one that is set so that we'll leave jobs
+      -- that have been active within the grace period:
+      jobTS = getTimestamp(jobKey, {"finishedOn", "processedOn", "timestamp"})
+      if (not jobTS or jobTS <= timestamp) then
+        -- replace the entry with a deletion marker; the actual deletion will
+        -- occur at the end of the script
+        rcall("LSET", listKey, rangeEnd - jobIdsLen + i, deletionMarker)
+        removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]])
+        deletedCount = deletedCount + 1
+        table.insert(deleted, job)
+      end
+    end
+  end
+  rcall("LREM", listKey, 0, deletionMarker)
+  return {deleted, deletedCount}
+end
+--[[
+  Function to clean job set.
+  Returns jobIds and deleted count number.
+]] 
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  We use ZRANGEBYSCORE to make the case where we're deleting a limited number
+  of items in a sorted set only run a single iteration. If we simply used
+  ZRANGE, we may take a long time traversing through jobs that are within the
+  grace period.
+]]
+local function getJobsInZset(zsetKey, rangeEnd, limit)
+  if limit > 0 then
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd, "LIMIT", 0, limit)
+  else
+    return rcall("ZRANGEBYSCORE", zsetKey, 0, rangeEnd)
+  end
+end
+local function cleanSet(
+    setKey,
+    jobKeyPrefix,
+    rangeEnd,
+    timestamp,
+    limit,
+    attributes,
+    isFinished,
+    jobSchedulersKey)
+    local jobs = getJobsInZset(setKey, rangeEnd, limit)
+    local deleted = {}
+    local deletedCount = 0
+    local jobTS
+    for i, job in ipairs(jobs) do
+        if limit > 0 and deletedCount >= limit then
+            break
+        end
+        local jobKey = jobKeyPrefix .. job
+        -- Extract a Job Scheduler Id from jobId ("repeat:job-scheduler-id:millis") 
+        -- and check if it is in the scheduled jobs
+        if not (jobSchedulersKey and isJobSchedulerJob(job, jobKey, jobSchedulersKey)) then
+            if isFinished then
+                removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                deletedCount = deletedCount + 1
+                table.insert(deleted, job)
+            else
+                -- * finishedOn says when the job was completed, but it isn't set unless the job has actually completed
+                jobTS = getTimestamp(jobKey, attributes)
+                if (not jobTS or jobTS <= timestamp) then
+                    removeJob(job, true, jobKeyPrefix, true --[[remove debounce key]] )
+                    deletedCount = deletedCount + 1
+                    table.insert(deleted, job)
+                end
+            end
+        end
+    end
+    if (#deleted > 0) then
+        for from, to in batches(#deleted, 7000) do
+            rcall("ZREM", setKey, unpack(deleted, from, to))
+        end
+    end
+    return {deleted, deletedCount}
+end
+local result
+if ARGV[4] == "active" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], false --[[ hasFinished ]],
+                      repeatKey)
+elseif ARGV[4] == "delayed" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"processedOn", "timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "prioritized" then
+  rangeEnd = "+inf"
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"timestamp"}, false  --[[ hasFinished ]], repeatKey)
+elseif ARGV[4] == "wait" or ARGV[4] == "paused" then
+  result = cleanList(KEYS[1], ARGV[1], rangeStart, rangeEnd, ARGV[2], true --[[ hasFinished ]],
+                      repeatKey)
+else
+  rangeEnd = ARGV[2]
+  -- No need to pass repeat key as in that moment job won't be related to a job scheduler
+  result = cleanSet(KEYS[1], ARGV[1], rangeEnd, ARGV[2], limit,
+                    {"finishedOn"}, true  --[[ hasFinished ]])
+end
+rcall("XADD", KEYS[2], "*", "event", "cleaned", "count", result[2])
+return result[1]
+`;
+export const cleanJobsInSet = {
+    name: 'cleanJobsInSet',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/drain-5.d.ts b/node_modules/bullmq/dist/esm/scripts/drain-5.d.ts
new file mode 100644
index 0000000..afc8634
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/drain-5.d.ts
@@ -0,0 +1,5 @@
+export declare const drain: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/drain-5.js b/node_modules/bullmq/dist/esm/scripts/drain-5.js
new file mode 100644
index 0000000..d833b7b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/drain-5.js
@@ -0,0 +1,271 @@
+const content = `--[[
+  Drains the queue, removes all jobs that are waiting
+  or delayed, but not active, completed or failed
+  Input:
+    KEYS[1] 'wait',
+    KEYS[2] 'paused'
+    KEYS[3] 'delayed'
+    KEYS[4] 'prioritized'
+    KEYS[5] 'jobschedulers' (repeat)
+    ARGV[1]  queue key prefix
+    ARGV[2]  should clean delayed jobs
+]]
+local rcall = redis.call
+local queueBaseKey = ARGV[1]
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get ZSet items.
+]]
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
+-- We must not remove delayed jobs if they are associated to a job scheduler.
+local scheduledJobs = {}
+local jobSchedulers = rcall("ZRANGE", KEYS[5], 0, -1, "WITHSCORES")
+-- For every job scheduler, get the current delayed job id.
+for i = 1, #jobSchedulers, 2 do
+    local jobSchedulerId = jobSchedulers[i]
+    local jobSchedulerMillis = jobSchedulers[i + 1]
+    local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. jobSchedulerMillis
+    scheduledJobs[delayedJobId] = true
+end
+removeListJobs(KEYS[1], true, queueBaseKey, 0, scheduledJobs) -- wait
+removeListJobs(KEYS[2], true, queueBaseKey, 0, scheduledJobs) -- paused
+if ARGV[2] == "1" then
+  removeZSetJobs(KEYS[3], true, queueBaseKey, 0, scheduledJobs) -- delayed
+end
+removeZSetJobs(KEYS[4], true, queueBaseKey, 0, scheduledJobs) -- prioritized
+`;
+export const drain = {
+    name: 'drain',
+    content,
+    keys: 5,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/extendLock-2.d.ts b/node_modules/bullmq/dist/esm/scripts/extendLock-2.d.ts
new file mode 100644
index 0000000..4416c99
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/extendLock-2.d.ts
@@ -0,0 +1,5 @@
+export declare const extendLock: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/extendLock-2.js b/node_modules/bullmq/dist/esm/scripts/extendLock-2.js
new file mode 100644
index 0000000..beaf576
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/extendLock-2.js
@@ -0,0 +1,26 @@
+const content = `--[[
+  Extend lock and removes the job from the stalled set.
+  Input:
+    KEYS[1] 'lock',
+    KEYS[2] 'stalled'
+    ARGV[1]  token
+    ARGV[2]  lock duration in milliseconds
+    ARGV[3]  jobid
+  Output:
+    "1" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  --   if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2], "XX") then
+  if rcall("SET", KEYS[1], ARGV[1], "PX", ARGV[2]) then
+    rcall("SREM", KEYS[2], ARGV[3])
+    return 1
+  end
+end
+return 0
+`;
+export const extendLock = {
+    name: 'extendLock',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/extendLocks-1.d.ts b/node_modules/bullmq/dist/esm/scripts/extendLocks-1.d.ts
new file mode 100644
index 0000000..728add8
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/extendLocks-1.d.ts
@@ -0,0 +1,5 @@
+export declare const extendLocks: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/extendLocks-1.js b/node_modules/bullmq/dist/esm/scripts/extendLocks-1.js
new file mode 100644
index 0000000..39584d3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/extendLocks-1.js
@@ -0,0 +1,46 @@
+const content = `--[[
+  Extend locks for multiple jobs and remove them from the stalled set if successful.
+  Return the list of job IDs for which the operation failed.
+  KEYS[1] = stalled key
+  ARGV[1] = baseKey
+  ARGV[2] = tokens
+  ARGV[3] = jobIds
+  ARGV[4] = lockDuration (ms)
+  Output:
+    An array of failed job IDs. If empty, all succeeded.
+]]
+local rcall = redis.call
+local stalledKey = KEYS[1]
+local baseKey = ARGV[1]
+local tokens = cmsgpack.unpack(ARGV[2])
+local jobIds = cmsgpack.unpack(ARGV[3])
+local lockDuration = ARGV[4]
+local jobCount = #jobIds
+local failedJobs = {}
+for i = 1, jobCount, 1 do
+    local lockKey = baseKey .. jobIds[i] .. ':lock'
+    local jobId = jobIds[i]
+    local token = tokens[i]
+    local currentToken = rcall("GET", lockKey)
+    if currentToken then
+        if currentToken == token then
+            local setResult = rcall("SET", lockKey, token, "PX", lockDuration)
+            if setResult then
+                rcall("SREM", stalledKey, jobId)
+            else
+                table.insert(failedJobs, jobId)
+            end
+        else
+            table.insert(failedJobs, jobId)
+        end
+    else
+        table.insert(failedJobs, jobId)
+    end
+end
+return failedJobs
+`;
+export const extendLocks = {
+    name: 'extendLocks',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getCounts-1.d.ts b/node_modules/bullmq/dist/esm/scripts/getCounts-1.d.ts
new file mode 100644
index 0000000..d50bde2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getCounts-1.d.ts
@@ -0,0 +1,5 @@
+export declare const getCounts: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getCounts-1.js b/node_modules/bullmq/dist/esm/scripts/getCounts-1.js
new file mode 100644
index 0000000..1358bc5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getCounts-1.js
@@ -0,0 +1,38 @@
+const content = `--[[
+  Get counts per provided states
+    Input:
+      KEYS[1]    'prefix'
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local prefix = KEYS[1]
+local results = {}
+for i = 1, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        results[#results+1] = count-1
+      else
+        results[#results+1] = 0
+      end
+    else
+      results[#results+1] = rcall("LLEN", stateKey)
+    end
+  elseif ARGV[i] == "active" then
+    results[#results+1] = rcall("LLEN", stateKey)
+  else
+    results[#results+1] = rcall("ZCARD", stateKey)
+  end
+end
+return results
+`;
+export const getCounts = {
+    name: 'getCounts',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.d.ts b/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.d.ts
new file mode 100644
index 0000000..5ad1ada
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.d.ts
@@ -0,0 +1,5 @@
+export declare const getCountsPerPriority: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.js b/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.js
new file mode 100644
index 0000000..01458bc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getCountsPerPriority-4.js
@@ -0,0 +1,42 @@
+const content = `--[[
+  Get counts per provided states
+    Input:
+      KEYS[1] wait key
+      KEYS[2] paused key
+      KEYS[3] meta key
+      KEYS[4] prioritized key
+      ARGV[1...] priorities
+]]
+local rcall = redis.call
+local results = {}
+local waitKey = KEYS[1]
+local pausedKey = KEYS[2]
+local prioritizedKey = KEYS[4]
+-- Includes
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePaused(queueMetaKey)
+  return rcall("HEXISTS", queueMetaKey, "paused") == 1
+end
+for i = 1, #ARGV do
+  local priority = tonumber(ARGV[i])
+  if priority == 0 then
+    if isQueuePaused(KEYS[3]) then
+      results[#results+1] = rcall("LLEN", pausedKey)
+    else
+      results[#results+1] = rcall("LLEN", waitKey)
+    end
+  else
+    results[#results+1] = rcall("ZCOUNT", prioritizedKey,
+      priority * 0x100000000, (priority + 1)  * 0x100000000 - 1)
+  end
+end
+return results
+`;
+export const getCountsPerPriority = {
+    name: 'getCountsPerPriority',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.d.ts b/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.d.ts
new file mode 100644
index 0000000..7114dff
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.d.ts
@@ -0,0 +1,5 @@
+export declare const getDependencyCounts: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.js b/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.js
new file mode 100644
index 0000000..b698994
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getDependencyCounts-4.js
@@ -0,0 +1,33 @@
+const content = `--[[
+  Get counts per child states
+    Input:
+      KEYS[1]    processed key
+      KEYS[2]    unprocessed key
+      KEYS[3]    ignored key
+      KEYS[4]    failed key
+      ARGV[1...] types
+]]
+local rcall = redis.call;
+local processedKey = KEYS[1]
+local unprocessedKey = KEYS[2]
+local ignoredKey = KEYS[3]
+local failedKey = KEYS[4]
+local results = {}
+for i = 1, #ARGV do
+  if ARGV[i] == "processed" then
+    results[#results+1] = rcall("HLEN", processedKey)
+  elseif ARGV[i] == "unprocessed" then
+    results[#results+1] = rcall("SCARD", unprocessedKey)
+  elseif ARGV[i] == "ignored" then
+    results[#results+1] = rcall("HLEN", ignoredKey)
+  else
+    results[#results+1] = rcall("ZCARD", failedKey)
+  end
+end
+return results
+`;
+export const getDependencyCounts = {
+    name: 'getDependencyCounts',
+    content,
+    keys: 4,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.d.ts b/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.d.ts
new file mode 100644
index 0000000..40d24c6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.d.ts
@@ -0,0 +1,5 @@
+export declare const getJobScheduler: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.js b/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.js
new file mode 100644
index 0000000..0eba7d5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getJobScheduler-1.js
@@ -0,0 +1,19 @@
+const content = `--[[
+  Get job scheduler record.
+  Input:
+    KEYS[1] 'repeat' key
+    ARGV[1] id
+]]
+local rcall = redis.call
+local jobSchedulerKey = KEYS[1] .. ":" .. ARGV[1]
+local score = rcall("ZSCORE", KEYS[1], ARGV[1])
+if score then
+  return {rcall("HGETALL", jobSchedulerKey), score} -- get job data
+end
+return {nil, nil}
+`;
+export const getJobScheduler = {
+    name: 'getJobScheduler',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getMetrics-2.d.ts b/node_modules/bullmq/dist/esm/scripts/getMetrics-2.d.ts
new file mode 100644
index 0000000..e5e9714
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getMetrics-2.d.ts
@@ -0,0 +1,5 @@
+export declare const getMetrics: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getMetrics-2.js b/node_modules/bullmq/dist/esm/scripts/getMetrics-2.js
new file mode 100644
index 0000000..3e39faf
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getMetrics-2.js
@@ -0,0 +1,21 @@
+const content = `--[[
+  Get metrics
+  Input:
+    KEYS[1] 'metrics' key
+    KEYS[2] 'metrics data' key
+    ARGV[1] start index
+    ARGV[2] end index
+]]
+local rcall = redis.call;
+local metricsKey = KEYS[1]
+local dataKey = KEYS[2]
+local metrics = rcall("HMGET", metricsKey, "count", "prevTS", "prevCount")
+local data = rcall("LRANGE", dataKey, tonumber(ARGV[1]), tonumber(ARGV[2]))
+local numPoints = rcall("LLEN", dataKey)
+return {metrics, data, numPoints}
+`;
+export const getMetrics = {
+    name: 'getMetrics',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getRanges-1.d.ts b/node_modules/bullmq/dist/esm/scripts/getRanges-1.d.ts
new file mode 100644
index 0000000..599f71a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getRanges-1.d.ts
@@ -0,0 +1,5 @@
+export declare const getRanges: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getRanges-1.js b/node_modules/bullmq/dist/esm/scripts/getRanges-1.js
new file mode 100644
index 0000000..39ba909
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getRanges-1.js
@@ -0,0 +1,69 @@
+const content = `--[[
+  Get job ids per provided states
+    Input:
+      KEYS[1]    'prefix'
+      ARGV[1]    start
+      ARGV[2]    end
+      ARGV[3]    asc
+      ARGV[4...] types
+]]
+local rcall = redis.call
+local prefix = KEYS[1]
+local rangeStart = tonumber(ARGV[1])
+local rangeEnd = tonumber(ARGV[2])
+local asc = ARGV[3]
+local results = {}
+local function getRangeInList(listKey, asc, rangeStart, rangeEnd, results)
+  if asc == "1" then
+    local modifiedRangeStart
+    local modifiedRangeEnd
+    if rangeStart == -1 then
+      modifiedRangeStart = 0
+    else
+      modifiedRangeStart = -(rangeStart + 1)
+    end
+    if rangeEnd == -1 then
+      modifiedRangeEnd = 0
+    else
+      modifiedRangeEnd = -(rangeEnd + 1)
+    end
+    results[#results+1] = rcall("LRANGE", listKey,
+      modifiedRangeEnd,
+      modifiedRangeStart)
+  else
+    results[#results+1] = rcall("LRANGE", listKey, rangeStart, rangeEnd)
+  end
+end
+for i = 4, #ARGV do
+  local stateKey = prefix .. ARGV[i]
+  if ARGV[i] == "wait" or ARGV[i] == "paused" then
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local marker = rcall("LINDEX", stateKey, -1)
+    if marker and string.sub(marker, 1, 2) == "0:" then
+      local count = rcall("LLEN", stateKey)
+      if count > 1 then
+        rcall("RPOP", stateKey)
+        getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+      else
+        results[#results+1] = {}
+      end
+    else
+      getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+    end
+  elseif ARGV[i] == "active" then
+    getRangeInList(stateKey, asc, rangeStart, rangeEnd, results)
+  else
+    if asc == "1" then
+      results[#results+1] = rcall("ZRANGE", stateKey, rangeStart, rangeEnd)
+    else
+      results[#results+1] = rcall("ZREVRANGE", stateKey, rangeStart, rangeEnd)
+    end
+  end
+end
+return results
+`;
+export const getRanges = {
+    name: 'getRanges',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.d.ts b/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.d.ts
new file mode 100644
index 0000000..812aff7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.d.ts
@@ -0,0 +1,5 @@
+export declare const getRateLimitTtl: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.js b/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.js
new file mode 100644
index 0000000..a34e8ed
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getRateLimitTtl-2.js
@@ -0,0 +1,40 @@
+const content = `--[[
+  Get rate limit ttl
+    Input:
+      KEYS[1] 'limiter'
+      KEYS[2] 'meta'
+      ARGV[1] maxJobs
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+local rateLimiterKey = KEYS[1]
+if ARGV[1] ~= "0" then
+  return getRateLimitTTL(tonumber(ARGV[1]), rateLimiterKey)
+else
+  local rateLimitMax = rcall("HGET", KEYS[2], "max")
+  if rateLimitMax then
+    return getRateLimitTTL(tonumber(rateLimitMax), rateLimiterKey)
+  end
+  return rcall("PTTL", rateLimiterKey)
+end
+`;
+export const getRateLimitTtl = {
+    name: 'getRateLimitTtl',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getState-8.d.ts b/node_modules/bullmq/dist/esm/scripts/getState-8.d.ts
new file mode 100644
index 0000000..be9e69a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getState-8.d.ts
@@ -0,0 +1,5 @@
+export declare const getState: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getState-8.js b/node_modules/bullmq/dist/esm/scripts/getState-8.js
new file mode 100644
index 0000000..38edf56
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getState-8.js
@@ -0,0 +1,69 @@
+const content = `--[[
+  Get a job state
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'prioritized'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+-- Includes
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local active_items = rcall("LRANGE", KEYS[4] , 0, -1)
+if checkItemInList(active_items, ARGV[1]) ~= nil then
+  return "active"
+end
+local wait_items = rcall("LRANGE", KEYS[5] , 0, -1)
+if checkItemInList(wait_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+local paused_items = rcall("LRANGE", KEYS[6] , 0, -1)
+if checkItemInList(paused_items, ARGV[1]) ~= nil then
+  return "waiting"
+end
+if rcall("ZSCORE", KEYS[7], ARGV[1]) then
+  return "waiting-children"
+end
+return "unknown"
+`;
+export const getState = {
+    name: 'getState',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getStateV2-8.d.ts b/node_modules/bullmq/dist/esm/scripts/getStateV2-8.d.ts
new file mode 100644
index 0000000..409c5e7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getStateV2-8.d.ts
@@ -0,0 +1,5 @@
+export declare const getStateV2: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/getStateV2-8.js b/node_modules/bullmq/dist/esm/scripts/getStateV2-8.js
new file mode 100644
index 0000000..633bc1d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/getStateV2-8.js
@@ -0,0 +1,53 @@
+const content = `--[[
+  Get a job state
+  Input: 
+    KEYS[1] 'completed' key,
+    KEYS[2] 'failed' key
+    KEYS[3] 'delayed' key
+    KEYS[4] 'active' key
+    KEYS[5] 'wait' key
+    KEYS[6] 'paused' key
+    KEYS[7] 'waiting-children' key
+    KEYS[8] 'prioritized' key
+    ARGV[1] job id
+  Output:
+    'completed'
+    'failed'
+    'delayed'
+    'active'
+    'waiting'
+    'waiting-children'
+    'unknown'
+]]
+local rcall = redis.call
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  return "completed"
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  return "failed"
+end
+if rcall("ZSCORE", KEYS[3], ARGV[1]) then
+  return "delayed"
+end
+if rcall("ZSCORE", KEYS[8], ARGV[1]) then
+  return "prioritized"
+end
+if rcall("LPOS", KEYS[4] , ARGV[1]) then
+  return "active"
+end
+if rcall("LPOS", KEYS[5] , ARGV[1]) then
+  return "waiting"
+end
+if rcall("LPOS", KEYS[6] , ARGV[1]) then
+  return "waiting"
+end
+if rcall("ZSCORE", KEYS[7] , ARGV[1]) then
+  return "waiting-children"
+end
+return "unknown"
+`;
+export const getStateV2 = {
+    name: 'getStateV2',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/index.d.ts b/node_modules/bullmq/dist/esm/scripts/index.d.ts
new file mode 100644
index 0000000..0da7bd2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/index.d.ts
@@ -0,0 +1,51 @@
+export * from './addDelayedJob-6';
+export * from './addJobScheduler-11';
+export * from './addLog-2';
+export * from './addParentJob-6';
+export * from './addPrioritizedJob-9';
+export * from './addRepeatableJob-2';
+export * from './addStandardJob-9';
+export * from './changeDelay-4';
+export * from './changePriority-7';
+export * from './cleanJobsInSet-3';
+export * from './drain-5';
+export * from './extendLock-2';
+export * from './extendLocks-1';
+export * from './getCounts-1';
+export * from './getCountsPerPriority-4';
+export * from './getDependencyCounts-4';
+export * from './getJobScheduler-1';
+export * from './getMetrics-2';
+export * from './getRanges-1';
+export * from './getRateLimitTtl-2';
+export * from './getState-8';
+export * from './getStateV2-8';
+export * from './isFinished-3';
+export * from './isJobInList-1';
+export * from './isMaxed-2';
+export * from './moveJobFromActiveToWait-9';
+export * from './moveJobsToWait-8';
+export * from './moveStalledJobsToWait-8';
+export * from './moveToActive-11';
+export * from './moveToDelayed-12';
+export * from './moveToFinished-14';
+export * from './moveToWaitingChildren-7';
+export * from './obliterate-2';
+export * from './paginate-1';
+export * from './pause-7';
+export * from './promote-9';
+export * from './releaseLock-1';
+export * from './removeChildDependency-1';
+export * from './removeDeduplicationKey-1';
+export * from './removeJob-2';
+export * from './removeJobScheduler-3';
+export * from './removeOrphanedJobs-1';
+export * from './removeRepeatable-3';
+export * from './removeUnprocessedChildren-2';
+export * from './reprocessJob-8';
+export * from './retryJob-11';
+export * from './saveStacktrace-1';
+export * from './updateData-1';
+export * from './updateJobScheduler-12';
+export * from './updateProgress-3';
+export * from './updateRepeatableJobMillis-1';
diff --git a/node_modules/bullmq/dist/esm/scripts/index.js b/node_modules/bullmq/dist/esm/scripts/index.js
new file mode 100644
index 0000000..0da7bd2
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/index.js
@@ -0,0 +1,51 @@
+export * from './addDelayedJob-6';
+export * from './addJobScheduler-11';
+export * from './addLog-2';
+export * from './addParentJob-6';
+export * from './addPrioritizedJob-9';
+export * from './addRepeatableJob-2';
+export * from './addStandardJob-9';
+export * from './changeDelay-4';
+export * from './changePriority-7';
+export * from './cleanJobsInSet-3';
+export * from './drain-5';
+export * from './extendLock-2';
+export * from './extendLocks-1';
+export * from './getCounts-1';
+export * from './getCountsPerPriority-4';
+export * from './getDependencyCounts-4';
+export * from './getJobScheduler-1';
+export * from './getMetrics-2';
+export * from './getRanges-1';
+export * from './getRateLimitTtl-2';
+export * from './getState-8';
+export * from './getStateV2-8';
+export * from './isFinished-3';
+export * from './isJobInList-1';
+export * from './isMaxed-2';
+export * from './moveJobFromActiveToWait-9';
+export * from './moveJobsToWait-8';
+export * from './moveStalledJobsToWait-8';
+export * from './moveToActive-11';
+export * from './moveToDelayed-12';
+export * from './moveToFinished-14';
+export * from './moveToWaitingChildren-7';
+export * from './obliterate-2';
+export * from './paginate-1';
+export * from './pause-7';
+export * from './promote-9';
+export * from './releaseLock-1';
+export * from './removeChildDependency-1';
+export * from './removeDeduplicationKey-1';
+export * from './removeJob-2';
+export * from './removeJobScheduler-3';
+export * from './removeOrphanedJobs-1';
+export * from './removeRepeatable-3';
+export * from './removeUnprocessedChildren-2';
+export * from './reprocessJob-8';
+export * from './retryJob-11';
+export * from './saveStacktrace-1';
+export * from './updateData-1';
+export * from './updateJobScheduler-12';
+export * from './updateProgress-3';
+export * from './updateRepeatableJobMillis-1';
diff --git a/node_modules/bullmq/dist/esm/scripts/isFinished-3.d.ts b/node_modules/bullmq/dist/esm/scripts/isFinished-3.d.ts
new file mode 100644
index 0000000..5eab057
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isFinished-3.d.ts
@@ -0,0 +1,5 @@
+export declare const isFinished: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/isFinished-3.js b/node_modules/bullmq/dist/esm/scripts/isFinished-3.js
new file mode 100644
index 0000000..b198d61
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isFinished-3.js
@@ -0,0 +1,45 @@
+const content = `--[[
+  Checks if a job is finished (.i.e. is in the completed or failed set)
+  Input: 
+    KEYS[1] completed key
+    KEYS[2] failed key
+    KEYS[3] job key
+    ARGV[1] job id
+    ARGV[2] return value?
+  Output:
+    0 - Not finished.
+    1 - Completed.
+    2 - Failed.
+   -1 - Missing job. 
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[3]) ~= 1 then
+  if ARGV[2] == "1" then
+    return {-1,"Missing key for job " .. KEYS[3] .. ". isFinished"}
+  end  
+  return -1
+end
+if rcall("ZSCORE", KEYS[1], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local returnValue = rcall("HGET", KEYS[3], "returnvalue")
+    return {1,returnValue}
+  end
+  return 1
+end
+if rcall("ZSCORE", KEYS[2], ARGV[1]) then
+  if ARGV[2] == "1" then
+    local failedReason = rcall("HGET", KEYS[3], "failedReason")
+    return {2,failedReason}
+  end
+  return 2
+end
+if ARGV[2] == "1" then
+  return {0}
+end
+return 0
+`;
+export const isFinished = {
+    name: 'isFinished',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/isJobInList-1.d.ts b/node_modules/bullmq/dist/esm/scripts/isJobInList-1.d.ts
new file mode 100644
index 0000000..97e50cf
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isJobInList-1.d.ts
@@ -0,0 +1,5 @@
+export declare const isJobInList: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/isJobInList-1.js b/node_modules/bullmq/dist/esm/scripts/isJobInList-1.js
new file mode 100644
index 0000000..ed0dffb
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isJobInList-1.js
@@ -0,0 +1,28 @@
+const content = `--[[
+  Checks if job is in a given list.
+  Input:
+    KEYS[1]
+    ARGV[1]
+  Output:
+    1 if element found in the list.
+]]
+-- Includes
+--[[
+  Function to check if an item belongs to a list.
+]]
+local function checkItemInList(list, item)
+  for _, v in pairs(list) do
+    if v == item then
+      return 1
+    end
+  end
+  return nil
+end
+local items = redis.call("LRANGE", KEYS[1] , 0, -1)
+return checkItemInList(items, ARGV[1])
+`;
+export const isJobInList = {
+    name: 'isJobInList',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/isMaxed-2.d.ts b/node_modules/bullmq/dist/esm/scripts/isMaxed-2.d.ts
new file mode 100644
index 0000000..4a60269
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isMaxed-2.d.ts
@@ -0,0 +1,5 @@
+export declare const isMaxed: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/isMaxed-2.js b/node_modules/bullmq/dist/esm/scripts/isMaxed-2.js
new file mode 100644
index 0000000..67558e6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/isMaxed-2.js
@@ -0,0 +1,30 @@
+const content = `--[[
+  Checks if queue is maxed.
+  Input:
+    KEYS[1] meta key
+    KEYS[2] active key
+  Output:
+    1 if element found in the list.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to check if queue is maxed or not.
+]]
+local function isQueueMaxed(queueMetaKey, activeKey)
+  local maxConcurrency = rcall("HGET", queueMetaKey, "concurrency")
+  if maxConcurrency then
+    local activeCount = rcall("LLEN", activeKey)
+    if activeCount >= tonumber(maxConcurrency) then
+      return true
+    end
+  end
+  return false
+end
+return isQueueMaxed(KEYS[1], KEYS[2])
+`;
+export const isMaxed = {
+    name: 'isMaxed',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.d.ts b/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.d.ts
new file mode 100644
index 0000000..5131738
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.d.ts
@@ -0,0 +1,5 @@
+export declare const moveJobFromActiveToWait: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.js b/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.js
new file mode 100644
index 0000000..293dbe5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveJobFromActiveToWait-9.js
@@ -0,0 +1,130 @@
+const content = `--[[
+  Function to move job from active state to wait.
+  Input:
+    KEYS[1]  active key
+    KEYS[2]  wait key
+    KEYS[3]  stalled key
+    KEYS[4]  paused key
+    KEYS[5]  meta key
+    KEYS[6]  limiter key
+    KEYS[7]  prioritized key
+    KEYS[8]  marker key
+    KEYS[9]  event key
+    ARGV[1] job id
+    ARGV[2] lock token
+    ARGV[3] job id key
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to push back job considering priority in front of same prioritized jobs.
+]]
+local function pushBackJobWithPriority(prioritizedKey, priority, jobId)
+  -- in order to put it at front of same prioritized jobs
+  -- we consider prioritized counter as 0
+  local score = priority * 0x100000000
+  rcall("ZADD", prioritizedKey, score, jobId)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+local jobId = ARGV[1]
+local token = ARGV[2]
+local jobKey = ARGV[3]
+if rcall("EXISTS", jobKey) == 0 then
+  return -1
+end
+local errorCode = removeLock(jobKey, KEYS[3], token, jobId)
+if errorCode < 0 then
+  return errorCode
+end
+local metaKey = KEYS[5]
+local removed = rcall("LREM", KEYS[1], 1, jobId)
+if removed > 0 then
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[1], KEYS[2], KEYS[4])
+  local priority = tonumber(rcall("HGET", ARGV[3], "priority")) or 0
+  if priority > 0 then
+    pushBackJobWithPriority(KEYS[7], priority, jobId)
+  else
+    addJobInTargetList(target, KEYS[8], "RPUSH", isPausedOrMaxed, jobId)
+  end
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  -- Emit waiting event
+  rcall("XADD", KEYS[9], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", jobId, "prev", "active")
+end
+local pttl = rcall("PTTL", KEYS[6])
+if pttl > 0 then
+  return pttl
+else
+  return 0
+end
+`;
+export const moveJobFromActiveToWait = {
+    name: 'moveJobFromActiveToWait',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.d.ts b/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.d.ts
new file mode 100644
index 0000000..b49ad52
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.d.ts
@@ -0,0 +1,5 @@
+export declare const moveJobsToWait: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.js b/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.js
new file mode 100644
index 0000000..cf67992
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveJobsToWait-8.js
@@ -0,0 +1,114 @@
+const content = `--[[
+  Move completed, failed or delayed jobs to wait.
+  Note: Does not support jobs with priorities.
+  Input:
+    KEYS[1] base key
+    KEYS[2] events stream
+    KEYS[3] state key (failed, completed, delayed)
+    KEYS[4] 'wait'
+    KEYS[5] 'paused'
+    KEYS[6] 'meta'
+    KEYS[7] 'active'
+    KEYS[8] 'marker'
+    ARGV[1] count
+    ARGV[2] timestamp
+    ARGV[3] prev state
+  Output:
+    1  means the operation is not completed
+    0  means the operation is completed
+]]
+local maxCount = tonumber(ARGV[1])
+local timestamp = tonumber(ARGV[2])
+local rcall = redis.call;
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local metaKey = KEYS[6]
+local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[7], KEYS[4], KEYS[5])
+local jobs = rcall('ZRANGEBYSCORE', KEYS[3], 0, timestamp, 'LIMIT', 0, maxCount)
+if (#jobs > 0) then
+    if ARGV[3] == "failed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "failedReason")
+        end
+    elseif ARGV[3] == "completed" then
+        for i, key in ipairs(jobs) do
+            local jobKey = KEYS[1] .. key
+            rcall("HDEL", jobKey, "finishedOn", "processedOn", "returnvalue")
+        end
+    end
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    for i, key in ipairs(jobs) do
+        -- Emit waiting event
+        rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event",
+              "waiting", "jobId", key, "prev", ARGV[3]);
+    end
+    for from, to in batches(#jobs, 7000) do
+        rcall("ZREM", KEYS[3], unpack(jobs, from, to))
+        rcall("LPUSH", target, unpack(jobs, from, to))
+    end
+    addBaseMarkerIfNeeded(KEYS[8], isPausedOrMaxed)
+end
+maxCount = maxCount - #jobs
+if (maxCount <= 0) then return 1 end
+return 0
+`;
+export const moveJobsToWait = {
+    name: 'moveJobsToWait',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.d.ts b/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.d.ts
new file mode 100644
index 0000000..092571a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.d.ts
@@ -0,0 +1,5 @@
+export declare const moveStalledJobsToWait: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.js b/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.js
new file mode 100644
index 0000000..2bb851c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveStalledJobsToWait-8.js
@@ -0,0 +1,181 @@
+const content = `--[[
+  Move stalled jobs to wait.
+    Input:
+      KEYS[1] 'stalled' (SET)
+      KEYS[2] 'wait',   (LIST)
+      KEYS[3] 'active', (LIST)
+      KEYS[4] 'stalled-check', (KEY)
+      KEYS[5] 'meta', (KEY)
+      KEYS[6] 'paused', (LIST)
+      KEYS[7] 'marker'
+      KEYS[8] 'event stream' (STREAM)
+      ARGV[1]  Max stalled job count
+      ARGV[2]  queue.toKey('')
+      ARGV[3]  timestamp
+      ARGV[4]  max check time
+    Events:
+      'stalled' with stalled job id.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to move job to wait to be picked up by a waiting worker.
+]]
+-- Includes
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey,
+  jobId, pushCmd)
+  local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+  addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId", jobId, 'prev', 'active')
+end
+--[[
+  Function to trim events, default 10000.
+]]
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
+local stalledKey = KEYS[1]
+local waitKey = KEYS[2]
+local activeKey = KEYS[3]
+local stalledCheckKey = KEYS[4]
+local metaKey = KEYS[5]
+local pausedKey = KEYS[6]
+local markerKey = KEYS[7]
+local eventStreamKey = KEYS[8]
+local maxStalledJobCount = tonumber(ARGV[1])
+local queueKeyPrefix = ARGV[2]
+local timestamp = ARGV[3]
+local maxCheckTime = ARGV[4]
+if rcall("EXISTS", stalledCheckKey) == 1 then
+    return {}
+end
+rcall("SET", stalledCheckKey, timestamp, "PX", maxCheckTime)
+-- Trim events before emitting them to avoid trimming events emitted in this script
+trimEvents(metaKey, eventStreamKey)
+-- Move all stalled jobs to wait
+local stalling = rcall('SMEMBERS', stalledKey)
+local stalled = {}
+if (#stalling > 0) then
+    rcall('DEL', stalledKey)
+    -- Remove from active list
+    for i, jobId in ipairs(stalling) do
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            -- If the jobId is a delay marker ID we just remove it.
+            rcall("LREM", activeKey, 1, jobId)
+        else
+            local jobKey = queueKeyPrefix .. jobId
+            -- Check that the lock is also missing, then we can handle this job as really stalled.
+            if (rcall("EXISTS", jobKey .. ":lock") == 0) then
+                --  Remove from the active queue.
+                local removed = rcall("LREM", activeKey, 1, jobId)
+                if (removed > 0) then
+                    -- If this job has been stalled too many times, such as if it crashes the worker, then fail it.
+                    local stalledCount = rcall("HINCRBY", jobKey, "stc", 1)
+                    -- Check if this is a repeatable job by looking at job options
+                    local jobOpts = rcall("HGET", jobKey, "opts")
+                    local isRepeatableJob = false
+                    if jobOpts then
+                        local opts = cjson.decode(jobOpts)
+                        if opts and opts["repeat"] then
+                            isRepeatableJob = true
+                        end
+                    end
+                    -- Only fail job if it exceeds stall limit AND is not a repeatable job
+                    if stalledCount > maxStalledJobCount and not isRepeatableJob then
+                        local failedReason = "job stalled more than allowable limit"
+                        rcall("HSET", jobKey, "defa", failedReason)
+                    end
+                    moveJobToWait(metaKey, activeKey, waitKey, pausedKey, markerKey, eventStreamKey, jobId,
+                        "RPUSH")
+                    -- Emit the stalled event
+                    rcall("XADD", eventStreamKey, "*", "event", "stalled", "jobId", jobId)
+                    table.insert(stalled, jobId)
+                end
+            end
+        end
+    end
+end
+-- Mark potentially stalled jobs
+local active = rcall('LRANGE', activeKey, 0, -1)
+if (#active > 0) then
+    for from, to in batches(#active, 7000) do
+        rcall('SADD', stalledKey, unpack(active, from, to))
+    end
+end
+return stalled
+`;
+export const moveStalledJobsToWait = {
+    name: 'moveStalledJobsToWait',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToActive-11.d.ts b/node_modules/bullmq/dist/esm/scripts/moveToActive-11.d.ts
new file mode 100644
index 0000000..837b00d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToActive-11.d.ts
@@ -0,0 +1,5 @@
+export declare const moveToActive: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToActive-11.js b/node_modules/bullmq/dist/esm/scripts/moveToActive-11.js
new file mode 100644
index 0000000..a70c3d4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToActive-11.js
@@ -0,0 +1,240 @@
+const content = `--[[
+  Move next job to be processed to active, lock it and fetch its data. The job
+  may be delayed, in that case we need to move it to the delayed set instead.
+  This operation guarantees that the worker owns the job during the lock
+  expiration time. The worker is responsible of keeping the lock fresh
+  so that no other worker picks this job again.
+  Input:
+    KEYS[1] wait key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] stream events key
+    KEYS[5] stalled key
+    -- Rate limiting
+    KEYS[6] rate limiter key
+    KEYS[7] delayed key
+    -- Delayed jobs
+    KEYS[8] paused key
+    KEYS[9] meta key
+    KEYS[10] pc priority counter
+    -- Marker
+    KEYS[11] marker key
+    -- Arguments
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] opts
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+    opts - name - worker name
+]]
+local rcall = redis.call
+local waitKey = KEYS[1]
+local activeKey = KEYS[2]
+local eventStreamKey = KEYS[4]
+local rateLimiterKey = KEYS[6]
+local delayedKey = KEYS[7]
+local opts = cmsgpack.unpack(ARGV[3])
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration = getTargetQueueList(KEYS[9],
+    activeKey, waitKey, KEYS[8])
+-- Check if there are delayed jobs that we can move to wait.
+local markerKey = KEYS[11]
+promoteDelayedJobs(delayedKey, markerKey, target, KEYS[3], eventStreamKey, ARGV[1],
+                   ARGV[2], KEYS[10], isPausedOrMaxed)
+local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+-- Check if we are rate limited first.
+if expireTime > 0 then return {0, 0, expireTime, 0} end
+-- paused or maxed queue
+if isPausedOrMaxed then return {0, 0, 0, 0} end
+local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+-- no job ID, try non-blocking move from wait to active
+local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+-- Markers in waitlist DEPRECATED in v5: Will be completely removed in v6.
+if jobId and string.sub(jobId, 1, 2) == "0:" then
+    rcall("LREM", activeKey, 1, jobId)
+    jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+end
+if jobId then
+    return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                   maxJobs, limiterDuration, markerKey, opts)
+else
+    jobId = moveJobFromPrioritizedToActive(KEYS[3], activeKey, KEYS[10])
+    if jobId then
+        return prepareJobForProcessing(ARGV[1], rateLimiterKey, eventStreamKey, jobId, ARGV[2],
+                                       maxJobs, limiterDuration, markerKey, opts)
+    end
+end
+-- Return the timestamp for the next delayed job if any.
+local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+if nextTimestamp ~= nil then return {0, 0, 0, nextTimestamp} end
+return {0, 0, 0, 0}
+`;
+export const moveToActive = {
+    name: 'moveToActive',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.d.ts b/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.d.ts
new file mode 100644
index 0000000..f0ab47d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.d.ts
@@ -0,0 +1,5 @@
+export declare const moveToDelayed: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.js b/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.js
new file mode 100644
index 0000000..b2e67bd
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToDelayed-12.js
@@ -0,0 +1,395 @@
+const content = `--[[
+  Moves job from active to delayed set.
+  Input:
+    KEYS[1] marker key
+    KEYS[2] active key
+    KEYS[3] prioritized key
+    KEYS[4] delayed key
+    KEYS[5] job key
+    KEYS[6] events stream
+    KEYS[7] meta key
+    KEYS[8] stalled key
+    KEYS[9] wait key
+    KEYS[10] rate limiter key
+    KEYS[11] paused key
+    KEYS[12] pc priority counter
+    ARGV[1] key prefix
+    ARGV[2] timestamp
+    ARGV[3] the id of the job
+    ARGV[4] queue token
+    ARGV[5] delay value
+    ARGV[6] skip attempt
+    ARGV[7] optional job fields to update
+    ARGV[8] fetch next?
+    ARGV[9] opts
+  Output:
+    0 - OK
+   -1 - Missing job.
+   -3 - Job not in active set.
+  Events:
+    - delayed key.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+-- Includes
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local jobKey = KEYS[5]
+local markerKey = KEYS[1]
+local metaKey = KEYS[7]
+local token = ARGV[4] 
+if rcall("EXISTS", jobKey) == 1 then
+    local errorCode = removeLock(jobKey, KEYS[8], token, ARGV[3])
+    if errorCode < 0 then
+        return errorCode
+    end
+    updateJobFields(jobKey, ARGV[7])
+    local delayedKey = KEYS[4]
+    local jobId = ARGV[3]
+    local delay = tonumber(ARGV[5])
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if numRemovedElements < 1 then return -3 end
+    local score, delayedTimestamp = getDelayedScore(delayedKey, ARGV[2], delay)
+    if ARGV[6] == "0" then
+        rcall("HINCRBY", jobKey, "atm", 1)
+    end
+    rcall("HSET", jobKey, "delay", ARGV[5])
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    rcall("ZADD", delayedKey, score, jobId)
+    rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+          "jobId", jobId, "delay", delayedTimestamp)
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[8] == "1") then
+        local opts = cmsgpack.unpack(ARGV[9])
+        local result = fetchNextJob(KEYS[9], KEYS[2], KEYS[3], KEYS[6],
+            KEYS[10], KEYS[4], KEYS[11], metaKey, KEYS[12], markerKey,
+            ARGV[1], ARGV[2], opts)
+        if result and type(result[1]) == "table" then
+            return result
+        end
+    end
+    -- Check if we need to push a marker job to wake up sleeping workers.
+    addDelayMarkerIfNeeded(markerKey, delayedKey)
+    return 0
+else
+    return -1
+end
+`;
+export const moveToDelayed = {
+    name: 'moveToDelayed',
+    content,
+    keys: 12,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.d.ts b/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.d.ts
new file mode 100644
index 0000000..95ccf35
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.d.ts
@@ -0,0 +1,5 @@
+export declare const moveToFinished: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.js b/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.js
new file mode 100644
index 0000000..cf5f648
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToFinished-14.js
@@ -0,0 +1,1041 @@
+const content = `--[[
+  Move job from active to a finished status (completed or failed)
+  A job can only be moved to completed if it was active.
+  The job must be locked before it can be moved to a finished status,
+  and the lock must be released in this script.
+    Input:
+      KEYS[1] wait key
+      KEYS[2] active key
+      KEYS[3] prioritized key
+      KEYS[4] event stream key
+      KEYS[5] stalled key
+      -- Rate limiting
+      KEYS[6] rate limiter key
+      KEYS[7] delayed key
+      KEYS[8] paused key
+      KEYS[9] meta key
+      KEYS[10] pc priority counter
+      KEYS[11] completed/failed key
+      KEYS[12] jobId key
+      KEYS[13] metrics key
+      KEYS[14] marker key
+      ARGV[1]  jobId
+      ARGV[2]  timestamp
+      ARGV[3]  msg property returnvalue / failedReason
+      ARGV[4]  return value / failed reason
+      ARGV[5]  target (completed/failed)
+      ARGV[6]  fetch next?
+      ARGV[7]  keys prefix
+      ARGV[8]  opts
+      ARGV[9]  job fields to update
+      opts - token - lock token
+      opts - keepJobs
+      opts - lockDuration - lock duration in milliseconds
+      opts - attempts max attempts
+      opts - maxMetricsSize
+      opts - fpof - fail parent on fail
+      opts - cpof - continue parent on fail
+      opts - idof - ignore dependency on fail
+      opts - rdof - remove dependency on fail
+      opts - name - worker name
+    Output:
+      0 OK
+      -1 Missing key.
+      -2 Missing lock.
+      -3 Job not in active set
+      -4 Job has pending children
+      -6 Lock is not owned by this client
+      -9 Job has failed children
+    Events:
+      'completed/failed'
+]]
+local rcall = redis.call
+--- Includes
+--[[
+  Functions to collect metrics based on a current and previous count of jobs.
+  Granularity is fixed at 1 minute.
+]]
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+local function collectMetrics(metaKey, dataPointsList, maxDataPoints,
+                                 timestamp)
+    -- Increment current count
+    local count = rcall("HINCRBY", metaKey, "count", 1) - 1
+    -- Compute how many data points we need to add to the list, N.
+    local prevTS = rcall("HGET", metaKey, "prevTS")
+    if not prevTS then
+        -- If prevTS is nil, set it to the current timestamp
+        rcall("HSET", metaKey, "prevTS", timestamp, "prevCount", 0)
+        return
+    end
+    local N = math.min(math.floor(timestamp / 60000) - math.floor(prevTS / 60000), tonumber(maxDataPoints))
+    if N > 0 then
+        local delta = count - rcall("HGET", metaKey, "prevCount")
+        -- If N > 1, add N-1 zeros to the list
+        if N > 1 then
+            local points = {}
+            points[1] = delta
+            for i = 2, N do
+                points[i] = 0
+            end
+            for from, to in batches(#points, 7000) do
+                rcall("LPUSH", dataPointsList, unpack(points, from, to))
+            end
+        else
+            -- LPUSH delta to the list
+            rcall("LPUSH", dataPointsList, delta)
+        end
+        -- LTRIM to keep list to its max size
+        rcall("LTRIM", dataPointsList, 0, maxDataPoints - 1)
+        -- update prev count with current count
+        rcall("HSET", metaKey, "prevCount", count, "prevTS", timestamp)
+    end
+end
+--[[
+  Function to fetch the next job to process.
+  Tries to get the next job to avoid an extra roundtrip if the queue is
+  not closing and not rate limited.
+  Input:
+    waitKey - wait list key
+    activeKey - active list key
+    prioritizedKey - prioritized sorted set key
+    eventStreamKey - event stream key
+    rateLimiterKey - rate limiter key
+    delayedKey - delayed sorted set key
+    pausedKey - paused list key
+    metaKey - meta hash key
+    pcKey - priority counter key
+    markerKey - marker key
+    prefix - keys prefix
+    timestamp - current timestamp
+    opts - options table:
+      token (required) - lock token used when locking jobs
+      lockDuration (required) - lock duration for acquired jobs
+      limiter (optional) - rate limiter options table (e.g. { max = number })
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+--[[
+  Function to get current rate limit ttl.
+]]
+local function getRateLimitTTL(maxJobs, rateLimiterKey)
+  if maxJobs and maxJobs <= tonumber(rcall("GET", rateLimiterKey) or 0) then
+    local pttl = rcall("PTTL", rateLimiterKey)
+    if pttl == 0 then
+      rcall("DEL", rateLimiterKey)
+    end
+    if pttl > 0 then
+      return pttl
+    end
+  end
+  return 0
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to move job from prioritized state to active.
+]]
+local function moveJobFromPrioritizedToActive(priorityKey, activeKey, priorityCounterKey)
+  local prioritizedJob = rcall("ZPOPMIN", priorityKey)
+  if #prioritizedJob > 0 then
+    rcall("LPUSH", activeKey, prioritizedJob[1])
+    return prioritizedJob[1]
+  else
+    rcall("DEL", priorityCounterKey)
+  end
+end
+--[[
+  Function to move job from wait state to active.
+  Input:
+    opts - token - lock token
+    opts - lockDuration
+    opts - limiter
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function prepareJobForProcessing(keyPrefix, rateLimiterKey, eventStreamKey,
+    jobId, processedOn, maxJobs, limiterDuration, markerKey, opts)
+  local jobKey = keyPrefix .. jobId
+  -- Check if we need to perform rate limiting.
+  if maxJobs then
+    local jobCounter = tonumber(rcall("INCR", rateLimiterKey))
+    if jobCounter == 1 then
+      local integerDuration = math.floor(math.abs(limiterDuration))
+      rcall("PEXPIRE", rateLimiterKey, integerDuration)
+    end
+  end
+  -- get a lock
+  if opts['token'] ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    rcall("SET", lockKey, opts['token'], "PX", opts['lockDuration'])
+  end
+  local optionalValues = {}
+  if opts['name'] then
+    -- Set "processedBy" field to the worker name
+    table.insert(optionalValues, "pb")
+    table.insert(optionalValues, opts['name'])
+  end
+  rcall("XADD", eventStreamKey, "*", "event", "active", "jobId", jobId, "prev", "waiting")
+  rcall("HMSET", jobKey, "processedOn", processedOn, unpack(optionalValues))
+  rcall("HINCRBY", jobKey, "ats", 1)
+  addBaseMarkerIfNeeded(markerKey, false)
+  -- rate limit delay must be 0 in this case to prevent adding more delay
+  -- when job that is moved to active needs to be processed
+  return {rcall("HGETALL", jobKey), jobId, 0, 0} -- get job data
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function fetchNextJob(waitKey, activeKey, prioritizedKey, eventStreamKey,
+    rateLimiterKey, delayedKey, pausedKey, metaKey, pcKey, markerKey, prefix,
+    timestamp, opts)
+    local target, isPausedOrMaxed, rateLimitMax, rateLimitDuration =
+        getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    -- Check if there are delayed jobs that can be promoted
+    promoteDelayedJobs(delayedKey, markerKey, target, prioritizedKey,
+        eventStreamKey, prefix, timestamp, pcKey, isPausedOrMaxed)
+    local maxJobs = tonumber(rateLimitMax or (opts['limiter'] and opts['limiter']['max']))
+    -- Check if we are rate limited first.
+    local expireTime = getRateLimitTTL(maxJobs, rateLimiterKey)
+    if expireTime > 0 then
+        return {0, 0, expireTime, 0}
+    end
+    -- paused or maxed queue
+    if isPausedOrMaxed then
+        return {0, 0, 0, 0}
+    end
+    local limiterDuration = (opts['limiter'] and opts['limiter']['duration']) or rateLimitDuration
+    local jobId = rcall("RPOPLPUSH", waitKey, activeKey)
+    if jobId then
+        -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+        if string.sub(jobId, 1, 2) == "0:" then
+            rcall("LREM", activeKey, 1, jobId)
+            -- If jobId is special ID 0:delay (delay greater than 0), then there is no job to process
+            -- but if ID is 0:0, then there is at least 1 prioritized job to process
+            if jobId == "0:0" then
+                jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+                return prepareJobForProcessing(prefix, rateLimiterKey,
+                    eventStreamKey, jobId, timestamp, maxJobs,
+                    limiterDuration, markerKey, opts)
+            end
+        else
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    else
+        jobId = moveJobFromPrioritizedToActive(prioritizedKey, activeKey, pcKey)
+        if jobId then
+            return prepareJobForProcessing(prefix, rateLimiterKey,
+                eventStreamKey, jobId, timestamp, maxJobs,
+                limiterDuration, markerKey, opts)
+        end
+    end
+    -- Return the timestamp for the next delayed job if any.
+    local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+    if nextTimestamp ~= nil then
+        -- The result is guaranteed to be positive, since the
+        -- ZRANGEBYSCORE command would have return a job otherwise.
+        return {0, 0, 0, nextTimestamp}
+    end
+end
+--[[
+  Function to recursively move from waitingChildren to failed.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized)
+  if no pending dependencies.
+]]
+-- Includes
+--[[
+  Validate and move parent to a wait status (waiting, delayed or prioritized) if needed.
+]]
+-- Includes
+--[[
+  Move parent to a wait status (wait, prioritized or delayed)
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+local function moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    local parentWaitKey = parentQueueKey .. ":wait"
+    local parentPausedKey = parentQueueKey .. ":paused"
+    local parentActiveKey = parentQueueKey .. ":active"
+    local parentMetaKey = parentQueueKey .. ":meta"
+    local parentMarkerKey = parentQueueKey .. ":marker"
+    local jobAttributes = rcall("HMGET", parentKey, "priority", "delay")
+    local priority = tonumber(jobAttributes[1]) or 0
+    local delay = tonumber(jobAttributes[2]) or 0
+    if delay > 0 then
+        local delayedTimestamp = tonumber(timestamp) + delay
+        local score = delayedTimestamp * 0x1000
+        local parentDelayedKey = parentQueueKey .. ":delayed"
+        rcall("ZADD", parentDelayedKey, score, parentId)
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "delayed", "jobId", parentId, "delay",
+            delayedTimestamp)
+        addDelayMarkerIfNeeded(parentMarkerKey, parentDelayedKey)
+    else
+        if priority == 0 then
+            local parentTarget, isParentPausedOrMaxed = getTargetQueueList(parentMetaKey, parentActiveKey,
+                parentWaitKey, parentPausedKey)
+            addJobInTargetList(parentTarget, parentMarkerKey, "RPUSH", isParentPausedOrMaxed, parentId)
+        else
+            local isPausedOrMaxed = isQueuePausedOrMaxed(parentMetaKey, parentActiveKey)
+            addJobWithPriority(parentMarkerKey, parentQueueKey .. ":prioritized", priority, parentId,
+                parentQueueKey .. ":pc", isPausedOrMaxed)
+        end
+        rcall("XADD", parentQueueKey .. ":events", "*", "event", "waiting", "jobId", parentId, "prev",
+            "waiting-children")
+    end
+end
+local function moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then    
+      rcall("ZREM", parentWaitingChildrenKey, parentId)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    end
+  end
+end
+local function moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey,
+  parentId, timestamp)
+  local doNotHavePendingDependencies = rcall("SCARD", parentDependenciesKey) == 0
+  if doNotHavePendingDependencies then
+    moveParentToWaitIfNeeded(parentQueueKey, parentKey, parentId, timestamp)
+  end
+end
+local handleChildFailureAndMoveParentToWait = function (parentQueueKey, parentKey, parentId, jobIdKey, timestamp)
+  if rcall("EXISTS", parentKey) == 1 then
+    local parentWaitingChildrenKey = parentQueueKey .. ":waiting-children"
+    local parentDelayedKey = parentQueueKey .. ":delayed"
+    local parentWaitingChildrenOrDelayedKey
+    if rcall("ZSCORE", parentWaitingChildrenKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentWaitingChildrenKey
+    elseif rcall("ZSCORE", parentDelayedKey, parentId) then
+      parentWaitingChildrenOrDelayedKey = parentDelayedKey
+      rcall("HSET", parentKey, "delay", 0)
+    end
+    if parentWaitingChildrenOrDelayedKey then
+      rcall("ZREM", parentWaitingChildrenOrDelayedKey, parentId)
+      local deferredFailure = "child " .. jobIdKey .. " failed"
+      rcall("HSET", parentKey, "defa", deferredFailure)
+      moveParentToWait(parentQueueKey, parentKey, parentId, timestamp)
+    else
+      if not rcall("ZSCORE", parentQueueKey .. ":failed", parentId) then
+        local deferredFailure = "child " .. jobIdKey .. " failed"
+        rcall("HSET", parentKey, "defa", deferredFailure)
+      end
+    end
+  end
+end
+local moveChildFromDependenciesIfNeeded = function (rawParentData, childKey, failedReason, timestamp)
+  if rawParentData then
+    local parentData = cjson.decode(rawParentData)
+    local parentKey = parentData['queueKey'] .. ':' .. parentData['id']
+    local parentDependenciesChildrenKey = parentKey .. ":dependencies"
+    if parentData['fpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentUnsuccessfulChildrenKey = parentKey .. ":unsuccessful"
+        rcall("ZADD", parentUnsuccessfulChildrenKey, timestamp, childKey)
+        handleChildFailureAndMoveParentToWait(
+          parentData['queueKey'],
+          parentKey,
+          parentData['id'],
+          childKey,
+          timestamp
+        )
+      end
+    elseif parentData['cpof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        local parentFailedChildrenKey = parentKey .. ":failed"
+        rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        moveParentToWaitIfNeeded(parentData['queueKey'], parentKey, parentData['id'], timestamp)
+      end
+    elseif parentData['idof'] or parentData['rdof'] then
+      if rcall("SREM", parentDependenciesChildrenKey, childKey) == 1 then
+        moveParentToWaitIfNoPendingDependencies(parentData['queueKey'], parentDependenciesChildrenKey,
+          parentKey, parentData['id'], timestamp)
+        if parentData['idof'] then
+          local parentFailedChildrenKey = parentKey .. ":failed"
+          rcall("HSET", parentFailedChildrenKey, childKey, failedReason)
+        end
+      end
+    end
+  end
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is moved to completed or failed states.
+]]
+local function removeDeduplicationKeyIfNeededOnFinalization(prefixKey,
+  deduplicationId, jobId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local pttl = rcall("PTTL", deduplicationKey)
+    if pttl == 0 then
+      return rcall("DEL", deduplicationKey)
+    end
+    if pttl == -1 then
+      local currentJobId = rcall('GET', deduplicationKey)
+      if currentJobId and currentJobId == jobId then
+        return rcall("DEL", deduplicationKey)
+      end
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Functions to remove jobs by max age.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+  local start = timestamp - maxAge * 1000
+  local jobIds = rcall("ZREVRANGEBYSCORE", targetSet, start, "-inf", "LIMIT", 0, maxLimit)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  if #jobIds > 0 then
+    if #jobIds < maxLimit then
+      rcall("ZREMRANGEBYSCORE", targetSet, "-inf", start)
+    else
+      for from, to in batches(#jobIds, 7000) do
+        rcall("ZREM", targetSet, unpack(jobIds, from, to))
+      end
+    end
+  end
+end
+--[[
+  Functions to remove jobs by max count.
+]]
+-- Includes
+local function removeJobsByMaxCount(maxCount, targetSet, prefix)
+  local start = maxCount
+  local jobIds = rcall("ZREVRANGE", targetSet, start, -1)
+  for i, jobId in ipairs(jobIds) do
+    removeJob(jobId, false, prefix, false --[[remove debounce key]])
+  end
+  rcall("ZREMRANGEBYRANK", targetSet, 0, -(maxCount + 1))
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to create a new job from stored dedup-next data
+  when a deduplicated job with keepLastIfActive finishes.
+  At most one next job is created per deduplication ID.
+  Multiple triggers while active overwrite the dedup-next data,
+  so only the latest data is used.
+]]
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to set the deduplication key for a job.
+  Uses TTL from deduplication opts if provided.
+]]
+local function setDeduplicationKey(deduplicationKey, jobId, deduplicationOpts)
+    local ttl = deduplicationOpts and deduplicationOpts['ttl']
+    if ttl and ttl > 0 then
+        rcall('SET', deduplicationKey, jobId, 'PX', ttl)
+    else
+        rcall('SET', deduplicationKey, jobId)
+    end
+end
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function requeueDeduplicatedJob(prefix, deduplicationId, eventStreamKey,
+    metaKey, activeKey, waitKey, pausedKey, markerKey, prioritizedKey,
+    priorityCounterKey, delayedKey, timestamp)
+  local deduplicationNextKey = prefix .. "dn:" .. deduplicationId
+  if rcall("EXISTS", deduplicationNextKey) == 1 then
+    local nextData = rcall("HMGET", deduplicationNextKey,
+        "name", "data", "opts", "pk", "pd", "pdk", "rjk", "jid")
+    -- Always increment the counter to keep it monotonic
+    local nextId = rcall("INCR", prefix .. "id") .. ""
+    local storedJobId = nextData[8] -- index 8 = "jid" (8th field in the HMGET call above)
+    local newJobId
+    if storedJobId then
+      newJobId = storedJobId
+    else
+      newJobId = nextId
+    end
+    local newJobIdKey = prefix .. newJobId
+    local newOpts = cjson.decode(nextData[3])
+    local deduplicationKey = prefix .. "de:" .. deduplicationId
+    local parentKey = nextData[4] or nil
+    local parentData = nextData[5] or nil
+    local parentDependenciesKey = nextData[6] or nil
+    local repeatJobKey = nextData[7] or nil
+    -- Set dedup key for the new job (without TTL when keepLastIfActive,
+    -- so the key outlives the job's active duration)
+    local deOpts = newOpts['de']
+    if deOpts and deOpts['keepLastIfActive'] then
+      rcall('SET', deduplicationKey, newJobId)
+    else
+      setDeduplicationKey(deduplicationKey, newJobId, deOpts)
+    end
+    -- Store and enqueue using the shared helper (handles priority/lifo/delayed)
+    local maxEvents = getOrSetMaxEvents(metaKey)
+    storeAndEnqueueJob(eventStreamKey, newJobIdKey, newJobId, nextData[1], nextData[2],
+        newOpts, timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+        waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+        priorityCounterKey, delayedKey, markerKey)
+    -- Register as child dependency if the job has a parent
+    if parentDependenciesKey then
+      rcall("SADD", parentDependenciesKey, newJobIdKey)
+    end
+    -- Only delete the dedup-next hash after the job is fully created,
+    -- so that if any step above errors, the data is not permanently lost.
+    rcall("DEL", deduplicationNextKey)
+  end
+end
+--[[
+  Function to trim events, default 10000.
+]]
+-- Includes
+local function trimEvents(metaKey, eventStreamKey)
+  local maxEvents = getOrSetMaxEvents(metaKey)
+  if maxEvents then
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", maxEvents)
+  else
+    rcall("XTRIM", eventStreamKey, "MAXLEN", "~", 10000)
+  end
+end
+--[[
+  Validate and move or add dependencies to parent.
+]]
+-- Includes
+local function updateParentDepsIfNeeded(parentKey, parentQueueKey, parentDependenciesKey,
+  parentId, jobIdKey, returnvalue, timestamp )
+  local processedSet = parentKey .. ":processed"
+  rcall("HSET", processedSet, jobIdKey, returnvalue)
+  moveParentToWaitIfNoPendingDependencies(parentQueueKey, parentDependenciesKey, parentKey, parentId, timestamp)
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local jobIdKey = KEYS[12]
+if rcall("EXISTS", jobIdKey) == 1 then -- Make sure job exists
+    -- Make sure it does not have pending dependencies
+    -- It must happen before removing lock
+    if ARGV[5] == "completed" then
+        if rcall("SCARD", jobIdKey .. ":dependencies") ~= 0 then
+            return -4
+        end
+        if rcall("ZCARD", jobIdKey .. ":unsuccessful") ~= 0 then
+            return -9
+        end
+    end
+    local opts = cmsgpack.unpack(ARGV[8])
+    local token = opts['token']
+    local errorCode = removeLock(jobIdKey, KEYS[5], token, ARGV[1])
+    if errorCode < 0 then
+        return errorCode
+    end
+    updateJobFields(jobIdKey, ARGV[9]);
+    local attempts = opts['attempts']
+    local maxMetricsSize = opts['maxMetricsSize']
+    local maxCount = opts['keepJobs']['count']
+    local maxAge = opts['keepJobs']['age']
+    local maxLimit = opts['keepJobs']['limit'] or 1000
+    local jobAttributes = rcall("HMGET", jobIdKey, "parentKey", "parent", "deid")
+    local parentKey = jobAttributes[1] or ""
+    local parentId = ""
+    local parentQueueKey = ""
+    if jobAttributes[2] then -- TODO: need to revisit this logic if it's still needed
+        local jsonDecodedParent = cjson.decode(jobAttributes[2])
+        parentId = jsonDecodedParent['id']
+        parentQueueKey = jsonDecodedParent['queueKey']
+    end
+    local jobId = ARGV[1]
+    local timestamp = ARGV[2]
+    -- Remove from active list (if not active we shall return error)
+    local numRemovedElements = rcall("LREM", KEYS[2], -1, jobId)
+    if (numRemovedElements < 1) then
+        return -3
+    end
+    local eventStreamKey = KEYS[4]
+    local metaKey = KEYS[9]
+    -- Trim events before emitting them to avoid trimming events emitted in this script
+    trimEvents(metaKey, eventStreamKey)
+    local prefix = ARGV[7]
+    removeDeduplicationKeyIfNeededOnFinalization(prefix, jobAttributes[3], jobId)
+    -- Check if there is requeue data for this dedup ID (keepLastIfActive mode)
+    if jobAttributes[3] then
+      requeueDeduplicatedJob(prefix, jobAttributes[3], eventStreamKey,
+          metaKey, KEYS[2], KEYS[1], KEYS[8], KEYS[14], KEYS[3], KEYS[10],
+          KEYS[7], timestamp)
+    end
+    -- If job has a parent we need to
+    -- 1) remove this job id from parents dependencies
+    -- 2) move the job Id to parent "processed" set
+    -- 3) push the results into parent "results" list
+    -- 4) if parent's dependencies is empty, then move parent to "wait/paused". Note it may be a different queue!.
+    if parentId == "" and parentKey ~= "" then
+        parentId = getJobIdFromKey(parentKey)
+        parentQueueKey = getJobKeyPrefix(parentKey, ":" .. parentId)
+    end
+    if parentId ~= "" then
+        if ARGV[5] == "completed" then
+            local dependenciesSet = parentKey .. ":dependencies"
+            if rcall("SREM", dependenciesSet, jobIdKey) == 1 then
+                updateParentDepsIfNeeded(parentKey, parentQueueKey, dependenciesSet, parentId, jobIdKey, ARGV[4],
+                    timestamp)
+            end
+        else
+            moveChildFromDependenciesIfNeeded(jobAttributes[2], jobIdKey, ARGV[4], timestamp)
+        end
+    end
+    local attemptsMade = rcall("HINCRBY", jobIdKey, "atm", 1)
+    -- Remove job?
+    if maxCount ~= 0 then
+        local targetSet = KEYS[11]
+        -- Add to complete/failed set
+        rcall("ZADD", targetSet, timestamp, jobId)
+        rcall("HSET", jobIdKey, ARGV[3], ARGV[4], "finishedOn", timestamp)
+        -- "returnvalue" / "failedReason" and "finishedOn"
+        if ARGV[5] == "failed" then
+            rcall("HDEL", jobIdKey, "defa")
+        end
+        -- Remove old jobs?
+        if maxAge ~= nil then
+            removeJobsByMaxAge(timestamp, maxAge, targetSet, prefix, maxLimit)
+        end
+        if maxCount ~= nil and maxCount > 0 then
+            removeJobsByMaxCount(maxCount, targetSet, prefix)
+        end
+    else
+        removeJobKeys(jobIdKey)
+        if parentKey ~= "" then
+            -- TODO: when a child is removed when finished, result or failure in parent
+            -- must not be deleted, those value references should be deleted when the parent
+            -- is deleted
+            removeParentDependencyKey(jobIdKey, false, parentKey, jobAttributes[3])
+        end
+    end
+    rcall("XADD", eventStreamKey, "*", "event", ARGV[5], "jobId", jobId, ARGV[3], ARGV[4], "prev", "active")
+    if ARGV[5] == "failed" then
+        if tonumber(attemptsMade) >= tonumber(attempts) then
+            rcall("XADD", eventStreamKey, "*", "event", "retries-exhausted", "jobId", jobId, "attemptsMade",
+                attemptsMade)
+        end
+    end
+    -- Collect metrics
+    if maxMetricsSize ~= "" then
+        collectMetrics(KEYS[13], KEYS[13] .. ':data', maxMetricsSize, timestamp)
+    end
+    -- Try to get next job to avoid an extra roundtrip if the queue is not closing,
+    -- and not rate limited.
+    if (ARGV[6] == "1") then
+        local result = fetchNextJob(KEYS[1], KEYS[2], KEYS[3], eventStreamKey,
+            KEYS[6], KEYS[7], KEYS[8], metaKey, KEYS[10], KEYS[14], prefix,
+            timestamp, opts)
+        if result then
+            return result
+        end
+    end
+    local waitLen = rcall("LLEN", KEYS[1])
+    if waitLen == 0 then
+        local activeLen = rcall("LLEN", KEYS[2])
+        if activeLen == 0 then
+            local prioritizedLen = rcall("ZCARD", KEYS[3])
+            if prioritizedLen == 0 then
+                rcall("XADD", eventStreamKey, "*", "event", "drained")
+            end
+        end
+    end
+    return 0
+else
+    return -1
+end
+`;
+export const moveToFinished = {
+    name: 'moveToFinished',
+    content,
+    keys: 14,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.d.ts b/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.d.ts
new file mode 100644
index 0000000..1eecfe4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.d.ts
@@ -0,0 +1,5 @@
+export declare const moveToWaitingChildren: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.js b/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.js
new file mode 100644
index 0000000..fc10f7a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/moveToWaitingChildren-7.js
@@ -0,0 +1,103 @@
+const content = `--[[
+  Moves job from active to waiting children set.
+  Input:
+    KEYS[1] active key
+    KEYS[2] wait-children key
+    KEYS[3] job key
+    KEYS[4] job dependencies key
+    KEYS[5] job unsuccessful key
+    KEYS[6] stalled key
+    KEYS[7] events key
+    ARGV[1] token
+    ARGV[2] child key
+    ARGV[3] timestamp
+    ARGV[4] jobId
+    ARGV[5] prefix
+  Output:
+    0 - OK
+    1 - There are not pending dependencies.
+   -1 - Missing job.
+   -2 - Missing lock
+   -3 - Job not in active set
+   -9 - Job has failed children
+]]
+local rcall = redis.call
+local activeKey = KEYS[1]
+local waitingChildrenKey = KEYS[2]
+local jobKey = KEYS[3]
+local jobDependenciesKey = KEYS[4]
+local jobUnsuccessfulKey = KEYS[5]
+local stalledKey = KEYS[6]
+local eventStreamKey = KEYS[7]
+local token = ARGV[1]
+local timestamp = ARGV[3]
+local jobId = ARGV[4]
+--- Includes
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+local function removeJobFromActive(activeKey, stalledKey, jobKey, jobId,
+    token)
+  local errorCode = removeLock(jobKey, stalledKey, token, jobId)
+  if errorCode < 0 then
+    return errorCode
+  end
+  local numRemovedElements = rcall("LREM", activeKey, -1, jobId)
+  if numRemovedElements < 1 then
+    return -3
+  end
+  return 0
+end
+local function moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+    jobKey, jobId, timestamp, token)
+  local errorCode = removeJobFromActive(activeKey, stalledKey, jobKey, jobId, token)
+  if errorCode < 0 then
+    return errorCode
+  end
+  local score = tonumber(timestamp)
+  rcall("ZADD", waitingChildrenKey, score, jobId)
+  rcall("XADD", eventStreamKey, "*", "event", "waiting-children", "jobId", jobId, 'prev', 'active')
+  return 0
+end
+if rcall("EXISTS", jobKey) == 1 then
+  if rcall("ZCARD", jobUnsuccessfulKey) ~= 0 then
+    return -9
+  else
+    if ARGV[2] ~= "" then
+      if rcall("SISMEMBER", jobDependenciesKey, ARGV[2]) ~= 0 then
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+      return 1
+    else
+      if rcall("SCARD", jobDependenciesKey) ~= 0 then 
+        return moveToWaitingChildren(activeKey, waitingChildrenKey, stalledKey, eventStreamKey,
+          jobKey, jobId, timestamp, token)
+      end
+      return 1
+    end    
+  end
+end
+return -1
+`;
+export const moveToWaitingChildren = {
+    name: 'moveToWaitingChildren',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/obliterate-2.d.ts b/node_modules/bullmq/dist/esm/scripts/obliterate-2.d.ts
new file mode 100644
index 0000000..0ef40ba
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/obliterate-2.d.ts
@@ -0,0 +1,5 @@
+export declare const obliterate: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/obliterate-2.js b/node_modules/bullmq/dist/esm/scripts/obliterate-2.js
new file mode 100644
index 0000000..05daa78
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/obliterate-2.js
@@ -0,0 +1,340 @@
+const content = `--[[
+  Completely obliterates a queue and all of its contents
+  This command completely destroys a queue including all of its jobs, current or past 
+  leaving no trace of its existence. Since this script needs to iterate to find all the job
+  keys, consider that this call may be slow for very large queues.
+  The queue needs to be "paused" or it will return an error
+  If the queue has currently active jobs then the script by default will return error,
+  however this behaviour can be overridden using the 'force' option.
+  Input:
+    KEYS[1] meta
+    KEYS[2] base
+    ARGV[1] count
+    ARGV[2] force
+]]
+local maxCount = tonumber(ARGV[1])
+local baseKey = KEYS[2]
+local rcall = redis.call
+-- Includes
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to remove job.
+]]
+-- Includes
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local function removeJob(jobId, hard, baseKey, shouldRemoveDeduplicationKey)
+  local jobKey = baseKey .. jobId
+  removeParentDependencyKey(jobKey, hard, nil, baseKey)
+  if shouldRemoveDeduplicationKey then
+    local deduplicationId = rcall("HGET", jobKey, "deid")
+    removeDeduplicationKeyIfNeededOnRemoval(baseKey, jobId, deduplicationId)
+  end
+  removeJobKeys(jobKey)
+end
+local function removeJobs(keys, hard, baseKey, max)
+  for i, key in ipairs(keys) do
+    removeJob(key, hard, baseKey, true --[[remove debounce key]])
+  end
+  return max - #keys
+end
+--[[
+  Functions to remove jobs.
+]]
+-- Includes
+--[[
+  Function to filter out jobs to ignore from a table.
+]]
+local function filterOutJobsToIgnore(jobs, jobsToIgnore)
+  local filteredJobs = {}
+  for i = 1, #jobs do
+    if not jobsToIgnore[jobs[i]] then
+      table.insert(filteredJobs, jobs[i])
+    end
+  end
+  return filteredJobs
+end
+local function getListItems(keyName, max)
+  return rcall('LRANGE', keyName, 0, max - 1)
+end
+local function removeListJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getListItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  rcall("LTRIM", keyName, #jobs, -1)
+  return count
+end
+-- Includes
+--[[
+  Function to loop in batches.
+  Just a bit of warning, some commands as ZREM
+  could receive a maximum of 7000 parameters per call.
+]]
+local function batches(n, batchSize)
+  local i = 0
+  return function()
+    local from = i * batchSize + 1
+    i = i + 1
+    if (from <= n) then
+      local to = math.min(from + batchSize - 1, n)
+      return from, to
+    end
+  end
+end
+--[[
+  Function to get ZSet items.
+]]
+local function getZSetItems(keyName, max)
+  return rcall('ZRANGE', keyName, 0, max - 1)
+end
+local function removeZSetJobs(keyName, hard, baseKey, max, jobsToIgnore)
+  local jobs = getZSetItems(keyName, max)
+  if jobsToIgnore then
+    jobs = filterOutJobsToIgnore(jobs, jobsToIgnore)
+  end
+  local count = removeJobs(jobs, hard, baseKey, max)
+  if(#jobs > 0) then
+    for from, to in batches(#jobs, 7000) do
+      rcall("ZREM", keyName, unpack(jobs, from, to))
+    end
+  end
+  return count
+end
+local function removeLockKeys(keys)
+  for i, key in ipairs(keys) do
+    rcall("DEL", baseKey .. key .. ':lock')
+  end
+end
+-- 1) Check if paused, if not return with error.
+if rcall("HEXISTS", KEYS[1], "paused") ~= 1 then
+  return -1 -- Error, NotPaused
+end
+-- 2) Check if there are active jobs, if there are and not "force" return error.
+local activeKey = baseKey .. 'active'
+local activeJobs = getListItems(activeKey, maxCount)
+if (#activeJobs > 0) then
+  if(ARGV[2] == "") then 
+    return -2 -- Error, ExistActiveJobs
+  end
+end
+removeLockKeys(activeJobs)
+maxCount = removeJobs(activeJobs, true, baseKey, maxCount)
+rcall("LTRIM", activeKey, #activeJobs, -1)
+if(maxCount <= 0) then
+  return 1
+end
+local delayedKey = baseKey .. 'delayed'
+maxCount = removeZSetJobs(delayedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local repeatKey = baseKey .. 'repeat'
+local repeatJobsIds = getZSetItems(repeatKey, maxCount)
+for i, key in ipairs(repeatJobsIds) do
+  local jobKey = repeatKey .. ":" .. key
+  rcall("DEL", jobKey)
+end
+if(#repeatJobsIds > 0) then
+  for from, to in batches(#repeatJobsIds, 7000) do
+    rcall("ZREM", repeatKey, unpack(repeatJobsIds, from, to))
+  end
+end
+maxCount = maxCount - #repeatJobsIds
+if(maxCount <= 0) then
+  return 1
+end
+local completedKey = baseKey .. 'completed'
+maxCount = removeZSetJobs(completedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local pausedKey = baseKey .. 'paused'
+maxCount = removeListJobs(pausedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local prioritizedKey = baseKey .. 'prioritized'
+maxCount = removeZSetJobs(prioritizedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+local failedKey = baseKey .. 'failed'
+maxCount = removeZSetJobs(failedKey, true, baseKey, maxCount)
+if(maxCount <= 0) then
+  return 1
+end
+if(maxCount > 0) then
+  rcall("DEL",
+    baseKey .. 'events',
+    baseKey .. 'delay',
+    baseKey .. 'stalled-check',
+    baseKey .. 'stalled',
+    baseKey .. 'id',
+    baseKey .. 'pc',
+    baseKey .. 'marker',
+    baseKey .. 'meta',
+    baseKey .. 'metrics:completed',
+    baseKey .. 'metrics:completed:data',
+    baseKey .. 'metrics:failed',
+    baseKey .. 'metrics:failed:data')
+  return 0
+else
+  return 1
+end
+`;
+export const obliterate = {
+    name: 'obliterate',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/paginate-1.d.ts b/node_modules/bullmq/dist/esm/scripts/paginate-1.d.ts
new file mode 100644
index 0000000..a0d1457
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/paginate-1.d.ts
@@ -0,0 +1,5 @@
+export declare const paginate: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/paginate-1.js b/node_modules/bullmq/dist/esm/scripts/paginate-1.js
new file mode 100644
index 0000000..f14274c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/paginate-1.js
@@ -0,0 +1,106 @@
+const content = `--[[
+    Paginate a set or hash
+    Input:
+      KEYS[1] key pointing to the set or hash to be paginated.
+      ARGV[1]  page start offset
+      ARGV[2]  page end offset (-1 for all the elements)
+      ARGV[3]  cursor
+      ARGV[4]  offset
+      ARGV[5]  max iterations
+      ARGV[6]  fetch jobs?
+    Output:
+      [cursor, offset, items, numItems]
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to achieve pagination for a set or hash.
+  This function simulates pagination in the most efficient way possible
+  for a set using sscan or hscan.
+  The main limitation is that sets are not order preserving, so the
+  pagination is not stable. This means that if the set is modified
+  between pages, the same element may appear in different pages.
+]] -- Maximum number of elements to be returned by sscan per iteration.
+local maxCount = 100
+-- Finds the cursor, and returns the first elements available for the requested page.
+local function findPage(key, command, pageStart, pageSize, cursor, offset,
+                        maxIterations, fetchJobs)
+    local items = {}
+    local jobs = {}
+    local iterations = 0
+    repeat
+        -- Iterate over the set using sscan/hscan.
+        local result = rcall(command, key, cursor, "COUNT", maxCount)
+        cursor = result[1]
+        local members = result[2]
+        local step = 1
+        if command == "HSCAN" then
+            step = 2
+        end
+        if #members == 0 then
+            -- If the result is empty, we can return the result.
+            return cursor, offset, items, jobs
+        end
+        local chunkStart = offset
+        local chunkEnd = offset + #members / step
+        local pageEnd = pageStart + pageSize
+        if chunkEnd < pageStart then
+            -- If the chunk is before the page, we can skip it.
+            offset = chunkEnd
+        elseif chunkStart > pageEnd then
+            -- If the chunk is after the page, we can return the result.
+            return cursor, offset, items, jobs
+        else
+            -- If the chunk is overlapping the page, we need to add the elements to the result.
+            for i = 1, #members, step do
+                if offset >= pageEnd then
+                    return cursor, offset, items, jobs
+                end
+                if offset >= pageStart then
+                    local index = #items + 1
+                    if fetchJobs ~= nil then
+                        jobs[#jobs+1] = rcall("HGETALL", members[i])
+                    end
+                    if step == 2 then
+                        items[index] = {members[i], members[i + 1]}
+                    else
+                        items[index] = members[i]
+                    end
+                end
+                offset = offset + 1
+            end
+        end
+        iterations = iterations + 1
+    until cursor == "0" or iterations >= maxIterations
+    return cursor, offset, items, jobs
+end
+local key = KEYS[1]
+local scanCommand = "SSCAN"
+local countCommand = "SCARD"
+local type = rcall("TYPE", key)["ok"]
+if type == "none" then
+    return {0, 0, {}, 0}
+elseif type == "hash" then
+    scanCommand = "HSCAN"
+    countCommand = "HLEN"
+elseif type ~= "set" then
+    return
+        redis.error_reply("Pagination is only supported for sets and hashes.")
+end
+local numItems = rcall(countCommand, key)
+local startOffset = tonumber(ARGV[1])
+local endOffset = tonumber(ARGV[2])
+if endOffset == -1 then 
+  endOffset = numItems
+end
+local pageSize = (endOffset - startOffset) + 1
+local cursor, offset, items, jobs = findPage(key, scanCommand, startOffset,
+                                       pageSize, ARGV[3], tonumber(ARGV[4]),
+                                       tonumber(ARGV[5]), ARGV[6])
+return {cursor, offset, items, numItems, jobs}
+`;
+export const paginate = {
+    name: 'paginate',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/pause-7.d.ts b/node_modules/bullmq/dist/esm/scripts/pause-7.d.ts
new file mode 100644
index 0000000..b2a1ccf
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/pause-7.d.ts
@@ -0,0 +1,5 @@
+export declare const pause: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/pause-7.js b/node_modules/bullmq/dist/esm/scripts/pause-7.js
new file mode 100644
index 0000000..04205fc
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/pause-7.js
@@ -0,0 +1,63 @@
+const content = `--[[
+  Pauses or resumes a queue globally.
+  Input:
+    KEYS[1] 'wait' or 'paused'
+    KEYS[2] 'paused' or 'wait'
+    KEYS[3] 'meta'
+    KEYS[4] 'prioritized'
+    KEYS[5] events stream key
+    KEYS[6] 'delayed'
+    KEYS[7] 'marker'
+    ARGV[1] 'paused' or 'resumed'
+  Event:
+    publish paused or resumed event.
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+local markerKey = KEYS[7]
+local hasJobs = rcall("EXISTS", KEYS[1]) == 1
+--TODO: check this logic to be reused when changing a delay
+if hasJobs then rcall("RENAME", KEYS[1], KEYS[2]) end
+if ARGV[1] == "paused" then
+    rcall("HSET", KEYS[3], "paused", 1)
+    rcall("DEL", markerKey)
+else
+    rcall("HDEL", KEYS[3], "paused")
+    if hasJobs or rcall("ZCARD", KEYS[4]) > 0 then
+        -- Add marker if there are waiting or priority jobs
+        rcall("ZADD", markerKey, 0, "0")
+    else
+        addDelayMarkerIfNeeded(markerKey, KEYS[6])
+    end
+end
+rcall("XADD", KEYS[5], "*", "event", ARGV[1]);
+`;
+export const pause = {
+    name: 'pause',
+    content,
+    keys: 7,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/promote-9.d.ts b/node_modules/bullmq/dist/esm/scripts/promote-9.d.ts
new file mode 100644
index 0000000..07b8cca
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/promote-9.d.ts
@@ -0,0 +1,5 @@
+export declare const promote: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/promote-9.js b/node_modules/bullmq/dist/esm/scripts/promote-9.js
new file mode 100644
index 0000000..5bdd988
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/promote-9.js
@@ -0,0 +1,106 @@
+const content = `--[[
+  Promotes a job that is currently "delayed" to the "waiting" state
+    Input:
+      KEYS[1] 'delayed'
+      KEYS[2] 'wait'
+      KEYS[3] 'paused'
+      KEYS[4] 'meta'
+      KEYS[5] 'prioritized'
+      KEYS[6] 'active'
+      KEYS[7] 'pc' priority counter
+      KEYS[8] 'event stream'
+      KEYS[9] 'marker'
+      ARGV[1]  queue.toKey('')
+      ARGV[2]  jobId
+    Output:
+       0 - OK
+      -3 - Job not in delayed zset.
+    Events:
+      'waiting'
+]]
+local rcall = redis.call
+local jobId = ARGV[2]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+if rcall("ZREM", KEYS[1], jobId) == 1 then
+    local jobKey = ARGV[1] .. jobId
+    local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+    local metaKey = KEYS[4]
+    local markerKey = KEYS[9]
+    -- Remove delayed "marker" from the wait list if there is any.
+    -- Since we are adding a job we do not need the marker anymore.
+    -- Markers in waitlist DEPRECATED in v5: Remove in v6.
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, KEYS[6], KEYS[2], KEYS[3])
+    local marker = rcall("LINDEX", target, 0)
+    if marker and string.sub(marker, 1, 2) == "0:" then rcall("LPOP", target) end
+    if priority == 0 then
+        -- LIFO or FIFO
+        addJobInTargetList(target, markerKey, "LPUSH", isPausedOrMaxed, jobId)
+    else
+        addJobWithPriority(markerKey, KEYS[5], priority, jobId, KEYS[7], isPausedOrMaxed)
+    end
+    rcall("XADD", KEYS[8], "*", "event", "waiting", "jobId", jobId, "prev",
+          "delayed");
+    rcall("HSET", jobKey, "delay", 0)
+    return 0
+else
+    return -3
+end
+`;
+export const promote = {
+    name: 'promote',
+    content,
+    keys: 9,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/releaseLock-1.d.ts b/node_modules/bullmq/dist/esm/scripts/releaseLock-1.d.ts
new file mode 100644
index 0000000..fe816aa
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/releaseLock-1.d.ts
@@ -0,0 +1,5 @@
+export declare const releaseLock: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/releaseLock-1.js b/node_modules/bullmq/dist/esm/scripts/releaseLock-1.js
new file mode 100644
index 0000000..bb7f955
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/releaseLock-1.js
@@ -0,0 +1,21 @@
+const content = `--[[
+  Release lock
+    Input:
+      KEYS[1] 'lock',
+      ARGV[1]  token
+      ARGV[2]  lock duration in milliseconds
+    Output:
+      "OK" if lock extended successfully.
+]]
+local rcall = redis.call
+if rcall("GET", KEYS[1]) == ARGV[1] then
+  return rcall("DEL", KEYS[1])
+else
+  return 0
+end
+`;
+export const releaseLock = {
+    name: 'releaseLock',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.d.ts b/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.d.ts
new file mode 100644
index 0000000..2fd03a0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.d.ts
@@ -0,0 +1,5 @@
+export declare const removeChildDependency: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.js b/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.js
new file mode 100644
index 0000000..815469b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeChildDependency-1.js
@@ -0,0 +1,161 @@
+const content = `--[[
+  Break parent-child dependency by removing
+  child reference from parent
+  Input:
+    KEYS[1] 'key' prefix,
+    ARGV[1] job key
+    ARGV[2] parent key
+    Output:
+       0  - OK
+       1  - There is not relationship.
+      -1  - Missing job key
+      -5  - Missing parent key
+]]
+local rcall = redis.call
+local jobKey = ARGV[1]
+local parentKey = ARGV[2]
+-- Includes
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+if rcall("EXISTS", jobKey) ~= 1 then return -1 end
+if rcall("EXISTS", parentKey) ~= 1 then return -5 end
+if removeParentDependencyKey(jobKey, false, parentKey, KEYS[1], nil) then
+  rcall("HDEL", jobKey, "parentKey", "parent")
+  return 0
+else
+  return 1
+end`;
+export const removeChildDependency = {
+    name: 'removeChildDependency',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.d.ts b/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.d.ts
new file mode 100644
index 0000000..f4ab10e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.d.ts
@@ -0,0 +1,5 @@
+export declare const removeDeduplicationKey: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.js b/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.js
new file mode 100644
index 0000000..9119e3c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeDeduplicationKey-1.js
@@ -0,0 +1,23 @@
+const content = `--[[
+  Remove deduplication key if it matches the job id.
+  Input:
+    KEYS[1] deduplication key
+    ARGV[1] job id
+  Output:
+    0 - false
+    1 - true
+]]
+local rcall = redis.call
+local deduplicationKey = KEYS[1]
+local jobId = ARGV[1]
+local currentJobId = rcall('GET', deduplicationKey)
+if currentJobId and currentJobId == jobId then
+  return rcall("DEL", deduplicationKey)
+end
+return 0
+`;
+export const removeDeduplicationKey = {
+    name: 'removeDeduplicationKey',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeJob-2.d.ts b/node_modules/bullmq/dist/esm/scripts/removeJob-2.d.ts
new file mode 100644
index 0000000..745be9a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeJob-2.d.ts
@@ -0,0 +1,5 @@
+export declare const removeJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeJob-2.js b/node_modules/bullmq/dist/esm/scripts/removeJob-2.js
new file mode 100644
index 0000000..4ea5c94
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeJob-2.js
@@ -0,0 +1,348 @@
+const content = `--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] repeat key
+      ARGV[1] jobId
+      ARGV[2] remove children
+      ARGV[3] queue prefix
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+  returns:
+    boolean
+]]
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove from any state.
+  returns:
+    prev state
+]]
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+  return "unknown"
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+local removeJobChildren
+local removeJobWithChildren
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
+local jobId = ARGV[1]
+local shouldRemoveChildren = ARGV[2]
+local prefix = ARGV[3]
+local jobKey = KEYS[1]
+local repeatKey = KEYS[2]
+if isJobSchedulerJob(jobId, jobKey, repeatKey) then
+    return -8
+end
+if not isLocked(prefix, jobId, shouldRemoveChildren) then
+    local options = {
+        removeChildren = shouldRemoveChildren == "1",
+        ignoreProcessed = false,
+        ignoreLocked = false
+    }
+    removeJobWithChildren(prefix, jobId, nil, options)
+    return 1
+end
+return 0
+`;
+export const removeJob = {
+    name: 'removeJob',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.d.ts b/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.d.ts
new file mode 100644
index 0000000..536e875
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.d.ts
@@ -0,0 +1,5 @@
+export declare const removeJobScheduler: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.js b/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.js
new file mode 100644
index 0000000..e967cb4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeJobScheduler-3.js
@@ -0,0 +1,45 @@
+const content = `--[[
+  Removes a job scheduler and its next scheduled job.
+  Input:
+    KEYS[1] job schedulers key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+    ARGV[1] job scheduler id
+    ARGV[2] prefix key
+  Output:
+    0 - OK
+    1 - Missing repeat job
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+local jobSchedulerId = ARGV[1]
+local prefix = ARGV[2]
+local millis = rcall("ZSCORE", KEYS[1], jobSchedulerId)
+if millis then
+  -- Delete next programmed job.
+  local delayedJobId = "repeat:" .. jobSchedulerId .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], delayedJobId) == 1) then
+    removeJobKeys(prefix .. delayedJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", delayedJobId, "prev", "delayed")
+  end
+end
+if(rcall("ZREM", KEYS[1], jobSchedulerId) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. jobSchedulerId)
+  return 0
+end
+return 1
+`;
+export const removeJobScheduler = {
+    name: 'removeJobScheduler',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.d.ts b/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.d.ts
new file mode 100644
index 0000000..9848409
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.d.ts
@@ -0,0 +1,5 @@
+export declare const removeOrphanedJobs: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.js b/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.js
new file mode 100644
index 0000000..d754421
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeOrphanedJobs-1.js
@@ -0,0 +1,73 @@
+const content = `--[[
+  Removes orphaned job keys that exist in Redis but are not referenced
+  in any queue state set. Checks each candidate atomically.
+  Input:
+    KEYS[1]  base prefix key including trailing colon (e.g. bull:queueName:)
+    ARGV[1]  number of state key suffixes
+    ARGV[2 .. 1+N]  state key suffixes (e.g. active, wait, completed, ...)
+    ARGV[2+N]  number of job sub-key suffixes
+    ARGV[3+N .. 2+N+M]  job sub-key suffixes (e.g. logs, dependencies, ...)
+    ARGV[3+N+M .. end]  candidate job IDs to check
+  Output:
+    number of removed jobs
+]]
+local rcall = redis.call
+local basePrefix = KEYS[1]
+-- Parse state key suffixes and cache their full key names + types.
+local stateKeyCount = tonumber(ARGV[1])
+local stateKeys = {}
+local stateKeyTypes = {}
+for i = 1, stateKeyCount do
+  local fullKey = basePrefix .. ARGV[1 + i]
+  stateKeys[i] = fullKey
+  stateKeyTypes[i] = rcall('TYPE', fullKey)['ok']
+end
+-- Parse job sub-key suffixes.
+local subKeyCountIdx = 2 + stateKeyCount
+local subKeyCount = tonumber(ARGV[subKeyCountIdx])
+local subKeySuffixes = {}
+for i = 1, subKeyCount do
+  subKeySuffixes[i] = ARGV[subKeyCountIdx + i]
+end
+-- Process candidate job IDs.
+local candidateStart = subKeyCountIdx + subKeyCount + 1
+local removedCount = 0
+for c = candidateStart, #ARGV do
+  local jobId = ARGV[c]
+  local found = false
+  for i = 1, stateKeyCount do
+    local kt = stateKeyTypes[i]
+    if kt == 'list' then
+      if rcall('LPOS', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'zset' then
+      if rcall('ZSCORE', stateKeys[i], jobId) then
+        found = true
+        break
+      end
+    elseif kt == 'set' then
+      if rcall('SISMEMBER', stateKeys[i], jobId) == 1 then
+        found = true
+        break
+      end
+    end
+  end
+  if not found then
+    local jobKey = basePrefix .. jobId
+    local keysToDelete = { jobKey }
+    for _, suffix in ipairs(subKeySuffixes) do
+      keysToDelete[#keysToDelete + 1] = jobKey .. ':' .. suffix
+    end
+    rcall('DEL', unpack(keysToDelete))
+    removedCount = removedCount + 1
+  end
+end
+return removedCount
+`;
+export const removeOrphanedJobs = {
+    name: 'removeOrphanedJobs',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.d.ts b/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.d.ts
new file mode 100644
index 0000000..3cdb39d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.d.ts
@@ -0,0 +1,5 @@
+export declare const removeRepeatable: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.js b/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.js
new file mode 100644
index 0000000..767eaff
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeRepeatable-3.js
@@ -0,0 +1,59 @@
+const content = `--[[
+  Removes a repeatable job
+  Input:
+    KEYS[1] repeat jobs key
+    KEYS[2] delayed jobs key
+    KEYS[3] events key
+    ARGV[1] old repeat job id
+    ARGV[2] options concat
+    ARGV[3] repeat job key
+    ARGV[4] prefix key
+  Output:
+    0 - OK
+    1 - Missing repeat job
+  Events:
+    'removed'
+]]
+local rcall = redis.call
+local millis = rcall("ZSCORE", KEYS[1], ARGV[2])
+-- Includes
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+-- legacy removal TODO: remove in next breaking change
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = ARGV[1] .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed");
+  end
+end
+if(rcall("ZREM", KEYS[1], ARGV[2]) == 1) then
+  return 0
+end
+-- new removal
+millis = rcall("ZSCORE", KEYS[1], ARGV[3])
+if millis then
+  -- Delete next programmed job.
+  local repeatJobId = "repeat:" .. ARGV[3] .. ":" .. millis
+  if(rcall("ZREM", KEYS[2], repeatJobId) == 1) then
+    removeJobKeys(ARGV[4] .. repeatJobId)
+    rcall("XADD", KEYS[3], "*", "event", "removed", "jobId", repeatJobId, "prev", "delayed")
+  end
+end
+if(rcall("ZREM", KEYS[1], ARGV[3]) == 1) then
+  rcall("DEL", KEYS[1] .. ":" .. ARGV[3])
+  return 0
+end
+return 1
+`;
+export const removeRepeatable = {
+    name: 'removeRepeatable',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.d.ts b/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.d.ts
new file mode 100644
index 0000000..71fb8a3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.d.ts
@@ -0,0 +1,5 @@
+export declare const removeUnprocessedChildren: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.js b/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.js
new file mode 100644
index 0000000..95fe50e
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/removeUnprocessedChildren-2.js
@@ -0,0 +1,338 @@
+const content = `--[[
+    Remove a job from all the statuses it may be in as well as all its data.
+    In order to be able to remove a job, it cannot be active.
+    Input:
+      KEYS[1] jobKey
+      KEYS[2] meta key
+      ARGV[1] prefix
+      ARGV[2] jobId
+    Events:
+      'removed' for every children removed
+]]
+-- Includes
+--[[
+    Remove a job from all the statuses it may be in as well as all its data,
+    including its children. Active children can be ignored.
+    Events:
+      'removed'
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Functions to destructure job key.
+  Just a bit of warning, these functions may be a bit slow and affect performance significantly.
+]]
+local getJobIdFromKey = function (jobKey)
+  return string.match(jobKey, ".*:(.*)")
+end
+local getJobKeyPrefix = function (jobKey, jobId)
+  return string.sub(jobKey, 0, #jobKey - #jobId)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check if the job belongs to a job scheduler and
+  current delayed job matches with jobId
+]]
+local function isJobSchedulerJob(jobId, jobKey, jobSchedulersKey)
+  local repeatJobKey = rcall("HGET", jobKey, "rjk")
+  if repeatJobKey  then
+    local prevMillis = rcall("ZSCORE", jobSchedulersKey, repeatJobKey)
+    if prevMillis then
+      local currentDelayedJobId = "repeat:" .. repeatJobKey .. ":" .. prevMillis
+      return jobId == currentDelayedJobId
+    end
+  end
+  return false
+end
+--[[
+  Function to remove deduplication key if needed
+  when a job is being removed.
+]]
+local function removeDeduplicationKeyIfNeededOnRemoval(prefixKey,
+  jobId, deduplicationId)
+  if deduplicationId then
+    local deduplicationKey = prefixKey .. "de:" .. deduplicationId
+    local currentJobId = rcall('GET', deduplicationKey)
+    if currentJobId and currentJobId == jobId then
+      rcall("DEL", deduplicationKey)
+      -- Also clean up any pending dedup-next data for this dedup ID
+      rcall("DEL", prefixKey .. "dn:" .. deduplicationId)
+      return 1
+    end
+  end
+end
+--[[
+  Function to remove from any state.
+  returns:
+    prev state
+]]
+local function removeJobFromAnyState( prefix, jobId)
+  -- We start with the ZSCORE checks, since they have O(1) complexity
+  if rcall("ZSCORE", prefix .. "completed", jobId) then
+    rcall("ZREM", prefix .. "completed", jobId)
+    return "completed"
+  elseif rcall("ZSCORE", prefix .. "waiting-children", jobId) then
+    rcall("ZREM", prefix .. "waiting-children", jobId)
+    return "waiting-children"
+  elseif rcall("ZSCORE", prefix .. "delayed", jobId) then
+    rcall("ZREM", prefix .. "delayed", jobId)
+    return "delayed"
+  elseif rcall("ZSCORE", prefix .. "failed", jobId) then
+    rcall("ZREM", prefix .. "failed", jobId)
+    return "failed"
+  elseif rcall("ZSCORE", prefix .. "prioritized", jobId) then
+    rcall("ZREM", prefix .. "prioritized", jobId)
+    return "prioritized"
+  -- We remove only 1 element from the list, since we assume they are not added multiple times
+  elseif rcall("LREM", prefix .. "wait", 1, jobId) == 1 then
+    return "wait"
+  elseif rcall("LREM", prefix .. "paused", 1, jobId) == 1 then
+    return "paused"
+  elseif rcall("LREM", prefix .. "active", 1, jobId) == 1 then
+    return "active"
+  end
+  return "unknown"
+end
+--[[
+  Function to remove job keys.
+]]
+local function removeJobKeys(jobKey)
+  return rcall("DEL", jobKey, jobKey .. ':logs', jobKey .. ':dependencies',
+    jobKey .. ':processed', jobKey .. ':failed', jobKey .. ':unsuccessful')
+end
+--[[
+  Check if this job has a parent. If so we will just remove it from
+  the parent child list, but if it is the last child we should move the parent to "wait/paused"
+  which requires code from "moveToFinished"
+]]
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local function _moveParentToWait(parentPrefix, parentId, emitEvent)
+  local parentTarget, isPausedOrMaxed = getTargetQueueList(parentPrefix .. "meta", parentPrefix .. "active",
+    parentPrefix .. "wait", parentPrefix .. "paused")
+  addJobInTargetList(parentTarget, parentPrefix .. "marker", "RPUSH", isPausedOrMaxed, parentId)
+  if emitEvent then
+    local parentEventStream = parentPrefix .. "events"
+    rcall("XADD", parentEventStream, "*", "event", "waiting", "jobId", parentId, "prev", "waiting-children")
+  end
+end
+local function removeParentDependencyKey(jobKey, hard, parentKey, baseKey, debounceId)
+  if parentKey then
+    local parentDependenciesKey = parentKey .. ":dependencies"
+    local result = rcall("SREM", parentDependenciesKey, jobKey)
+    if result > 0 then
+      local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+      if pendingDependencies == 0 then
+        local parentId = getJobIdFromKey(parentKey)
+        local parentPrefix = getJobKeyPrefix(parentKey, parentId)
+        local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+        if numRemovedElements == 1 then
+          if hard then -- remove parent in same queue
+            if parentPrefix == baseKey then
+              removeParentDependencyKey(parentKey, hard, nil, baseKey, nil)
+              removeJobKeys(parentKey)
+              if debounceId then
+                rcall("DEL", parentPrefix .. "de:" .. debounceId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId)
+            end
+          else
+            _moveParentToWait(parentPrefix, parentId, true)
+          end
+        end
+      end
+      return true
+    end
+  else
+    local parentAttributes = rcall("HMGET", jobKey, "parentKey", "deid")
+    local missedParentKey = parentAttributes[1]
+    if( (type(missedParentKey) == "string") and missedParentKey ~= ""
+      and (rcall("EXISTS", missedParentKey) == 1)) then
+      local parentDependenciesKey = missedParentKey .. ":dependencies"
+      local result = rcall("SREM", parentDependenciesKey, jobKey)
+      if result > 0 then
+        local pendingDependencies = rcall("SCARD", parentDependenciesKey)
+        if pendingDependencies == 0 then
+          local parentId = getJobIdFromKey(missedParentKey)
+          local parentPrefix = getJobKeyPrefix(missedParentKey, parentId)
+          local numRemovedElements = rcall("ZREM", parentPrefix .. "waiting-children", parentId)
+          if numRemovedElements == 1 then
+            if hard then
+              if parentPrefix == baseKey then
+                removeParentDependencyKey(missedParentKey, hard, nil, baseKey, nil)
+                removeJobKeys(missedParentKey)
+                if parentAttributes[2] then
+                  rcall("DEL", parentPrefix .. "de:" .. parentAttributes[2])
+                end
+              else
+                _moveParentToWait(parentPrefix, parentId)
+              end
+            else
+              _moveParentToWait(parentPrefix, parentId, true)
+            end
+          end
+        end
+        return true
+      end
+    end
+  end
+  return false
+end
+--[[
+  Function to recursively check if there are no locks
+  on the jobs to be removed.
+  returns:
+    boolean
+]]
+local function isLocked( prefix, jobId, removeChildren)
+  local jobKey = prefix .. jobId;
+  -- Check if this job is locked
+  local lockKey = jobKey .. ':lock'
+  local lock = rcall("GET", lockKey)
+  if not lock then
+    if removeChildren == "1" then
+      local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+      if (#dependencies > 0) then
+        for i, childJobKey in ipairs(dependencies) do
+          -- We need to get the jobId for this job.
+          local childJobId = getJobIdFromKey(childJobKey)
+          local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+          local result = isLocked( childJobPrefix, childJobId, removeChildren )
+          if result then
+            return true
+          end
+        end
+      end
+    end
+    return false
+  end
+  return true
+end
+local removeJobChildren
+local removeJobWithChildren
+removeJobChildren = function(prefix, jobKey, options)
+    -- Check if this job has children
+    -- If so, we are going to try to remove the children recursively in a depth-first way
+    -- because if some job is locked, we must exit with an error.
+    if not options.ignoreProcessed then
+        local processed = rcall("HGETALL", jobKey .. ":processed")
+        if #processed > 0 then
+            for i = 1, #processed, 2 do
+                local childJobId = getJobIdFromKey(processed[i])
+                local childJobPrefix = getJobKeyPrefix(processed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local failed = rcall("HGETALL", jobKey .. ":failed")
+        if #failed > 0 then
+            for i = 1, #failed, 2 do
+                local childJobId = getJobIdFromKey(failed[i])
+                local childJobPrefix = getJobKeyPrefix(failed[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+        local unsuccessful = rcall("ZRANGE", jobKey .. ":unsuccessful", 0, -1)
+        if #unsuccessful > 0 then
+            for i = 1, #unsuccessful, 1 do
+                local childJobId = getJobIdFromKey(unsuccessful[i])
+                local childJobPrefix = getJobKeyPrefix(unsuccessful[i], childJobId)
+                removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+            end
+        end
+    end
+    local dependencies = rcall("SMEMBERS", jobKey .. ":dependencies")
+    if #dependencies > 0 then
+        for i, childJobKey in ipairs(dependencies) do
+            local childJobId = getJobIdFromKey(childJobKey)
+            local childJobPrefix = getJobKeyPrefix(childJobKey, childJobId)
+            removeJobWithChildren(childJobPrefix, childJobId, jobKey, options)
+        end
+    end
+end
+removeJobWithChildren = function(prefix, jobId, parentKey, options)
+    local jobKey = prefix .. jobId
+    if options.ignoreLocked then
+        if isLocked(prefix, jobId) then
+            return
+        end
+    end
+    -- Check if job is in the failed zset
+    local failedSet = prefix .. "failed"
+    if not (options.ignoreProcessed and rcall("ZSCORE", failedSet, jobId)) then
+        removeParentDependencyKey(jobKey, false, parentKey, nil)
+        if options.removeChildren then
+            removeJobChildren(prefix, jobKey, options)
+        end
+        local prev = removeJobFromAnyState(prefix, jobId)
+        local deduplicationId = rcall("HGET", jobKey, "deid")
+        removeDeduplicationKeyIfNeededOnRemoval(prefix, jobId, deduplicationId)
+        if removeJobKeys(jobKey) > 0 then
+            local metaKey = prefix .. "meta"
+            local maxEvents = getOrSetMaxEvents(metaKey)
+            rcall("XADD", prefix .. "events", "MAXLEN", "~", maxEvents, "*", "event", "removed",
+                "jobId", jobId, "prev", prev)
+        end
+    end
+end
+local prefix = ARGV[1]
+local jobId = ARGV[2]
+local jobKey = KEYS[1]
+local metaKey = KEYS[2]
+local options = {
+  removeChildren = "1",
+  ignoreProcessed = true,
+  ignoreLocked = true
+}
+removeJobChildren(prefix, jobKey, options) 
+`;
+export const removeUnprocessedChildren = {
+    name: 'removeUnprocessedChildren',
+    content,
+    keys: 2,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.d.ts b/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.d.ts
new file mode 100644
index 0000000..e0902e4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.d.ts
@@ -0,0 +1,5 @@
+export declare const reprocessJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.js b/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.js
new file mode 100644
index 0000000..fd5cbf0
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/reprocessJob-8.js
@@ -0,0 +1,115 @@
+const content = `--[[
+  Attempts to reprocess a job
+  Input:
+    KEYS[1] job key
+    KEYS[2] events stream
+    KEYS[3] job state
+    KEYS[4] wait key
+    KEYS[5] meta
+    KEYS[6] paused key
+    KEYS[7] active key
+    KEYS[8] marker key
+    ARGV[1] job.id
+    ARGV[2] (job.opts.lifo ? 'R' : 'L') + 'PUSH'
+    ARGV[3] propVal - failedReason/returnvalue
+    ARGV[4] prev state - failed/completed
+    ARGV[5] reset attemptsMade - "1" or "0"
+    ARGV[6] reset attemptsStarted - "1" or "0"
+  Output:
+     1 means the operation was a success
+    -1 means the job does not exist
+    -3 means the job was not found in the expected set.
+]]
+local rcall = redis.call;
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+local jobKey = KEYS[1]
+if rcall("EXISTS", jobKey) == 1 then
+  local jobId = ARGV[1]
+  if (rcall("ZREM", KEYS[3], jobId) == 1) then
+    local attributesToRemove = {}
+    if ARGV[5] == "1" then
+      table.insert(attributesToRemove, "atm")
+    end
+    if ARGV[6] == "1" then
+      table.insert(attributesToRemove, "ats")
+    end
+    rcall("HDEL", jobKey, "finishedOn", "processedOn", ARGV[3], unpack(attributesToRemove))
+    local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[7], KEYS[4], KEYS[6])
+    addJobInTargetList(target, KEYS[8], ARGV[2], isPausedOrMaxed, jobId)
+    local parentKey = rcall("HGET", jobKey, "parentKey")
+    if parentKey and rcall("EXISTS", parentKey) == 1 then
+      if ARGV[4] == "failed" then
+        if rcall("ZREM", parentKey .. ":unsuccessful", jobKey) == 1 or
+          rcall("ZREM", parentKey .. ":failed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      else
+        if rcall("HDEL", parentKey .. ":processed", jobKey) == 1 then
+          rcall("SADD", parentKey .. ":dependencies", jobKey)
+        end
+      end
+    end
+    local maxEvents = getOrSetMaxEvents(KEYS[5])
+    -- Emit waiting event
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+      "jobId", jobId, "prev", ARGV[4]);
+    return 1
+  else
+    return -3
+  end
+else
+  return -1
+end
+`;
+export const reprocessJob = {
+    name: 'reprocessJob',
+    content,
+    keys: 8,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/retryJob-11.d.ts b/node_modules/bullmq/dist/esm/scripts/retryJob-11.d.ts
new file mode 100644
index 0000000..dcefaf5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/retryJob-11.d.ts
@@ -0,0 +1,5 @@
+export declare const retryJob: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/retryJob-11.js b/node_modules/bullmq/dist/esm/scripts/retryJob-11.js
new file mode 100644
index 0000000..5a5f97f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/retryJob-11.js
@@ -0,0 +1,210 @@
+const content = `--[[
+  Retries a failed job by moving it back to the wait queue.
+    Input:
+      KEYS[1]  'active',
+      KEYS[2]  'wait'
+      KEYS[3]  'paused'
+      KEYS[4]  job key
+      KEYS[5]  'meta'
+      KEYS[6]  events stream
+      KEYS[7]  delayed key
+      KEYS[8]  prioritized key
+      KEYS[9]  'pc' priority counter
+      KEYS[10] 'marker'
+      KEYS[11] 'stalled'
+      ARGV[1]  key prefix
+      ARGV[2]  timestamp
+      ARGV[3]  pushCmd
+      ARGV[4]  jobId
+      ARGV[5]  token
+      ARGV[6]  optional job fields to update
+    Events:
+      'waiting'
+    Output:
+     0  - OK
+     -1 - Missing key
+     -2 - Missing lock
+     -3 - Job not in active set
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to check if queue is paused or maxed
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function isQueuePausedOrMaxed(queueMetaKey, activeKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency")
+  if queueAttributes[1] then
+    return true
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      return activeCount >= tonumber(queueAttributes[2])
+    end
+  end
+  return false
+end
+--[[
+  Updates the delay set, by moving delayed jobs that should
+  be processed now to "wait".
+     Events:
+      'waiting'
+]]
+-- Includes
+-- Try to get as much as 1000 jobs at once
+local function promoteDelayedJobs(delayedKey, markerKey, targetKey, prioritizedKey,
+                                  eventStreamKey, prefix, timestamp, priorityCounterKey, isPaused)
+    local jobs = rcall("ZRANGEBYSCORE", delayedKey, 0, (timestamp + 1) * 0x1000 - 1, "LIMIT", 0, 1000)
+    if (#jobs > 0) then
+        rcall("ZREM", delayedKey, unpack(jobs))
+        for _, jobId in ipairs(jobs) do
+            local jobKey = prefix .. jobId
+            local priority =
+                tonumber(rcall("HGET", jobKey, "priority")) or 0
+            if priority == 0 then
+                -- LIFO or FIFO
+                rcall("LPUSH", targetKey, jobId)
+            else
+                local score = getPriorityScore(priority, priorityCounterKey)
+                rcall("ZADD", prioritizedKey, score, jobId)
+            end
+            -- Emit waiting event
+            rcall("XADD", eventStreamKey, "*", "event", "waiting", "jobId",
+                  jobId, "prev", "delayed")
+            rcall("HSET", jobKey, "delay", 0)
+        end
+        addBaseMarkerIfNeeded(markerKey, isPaused)
+    end
+end
+local function removeLock(jobKey, stalledKey, token, jobId)
+  if token ~= "0" then
+    local lockKey = jobKey .. ':lock'
+    local lockToken = rcall("GET", lockKey)
+    if lockToken == token then
+      rcall("DEL", lockKey)
+      rcall("SREM", stalledKey, jobId)
+    else
+      if lockToken then
+        -- Lock exists but token does not match
+        return -6
+      else
+        -- Lock is missing completely
+        return -2
+      end
+    end
+  end
+  return 0
+end
+--[[
+  Function to update a bunch of fields in a job.
+]]
+local function updateJobFields(jobKey, msgpackedFields)
+  if msgpackedFields and #msgpackedFields > 0 then
+    local fieldsToUpdate = cmsgpack.unpack(msgpackedFields)
+    if fieldsToUpdate then
+      rcall("HMSET", jobKey, unpack(fieldsToUpdate))
+    end
+  end
+end
+local target, isPausedOrMaxed = getTargetQueueList(KEYS[5], KEYS[1], KEYS[2], KEYS[3])
+local markerKey = KEYS[10]
+-- Check if there are delayed jobs that we can move to wait.
+-- test example: when there are delayed jobs between retries
+promoteDelayedJobs(KEYS[7], markerKey, target, KEYS[8], KEYS[6], ARGV[1], ARGV[2], KEYS[9], isPausedOrMaxed)
+local jobKey = KEYS[4]
+if rcall("EXISTS", jobKey) == 1 then
+  local errorCode = removeLock(jobKey, KEYS[11], ARGV[5], ARGV[4]) 
+  if errorCode < 0 then
+    return errorCode
+  end
+  updateJobFields(jobKey, ARGV[6])
+  local numRemovedElements = rcall("LREM", KEYS[1], -1, ARGV[4])
+  if (numRemovedElements < 1) then return -3 end
+  local priority = tonumber(rcall("HGET", jobKey, "priority")) or 0
+  --need to re-evaluate after removing job from active
+  isPausedOrMaxed = isQueuePausedOrMaxed(KEYS[5], KEYS[1])
+  -- Standard or priority add
+  if priority == 0 then
+    addJobInTargetList(target, markerKey, ARGV[3], isPausedOrMaxed, ARGV[4])
+  else
+    addJobWithPriority(markerKey, KEYS[8], priority, ARGV[4], KEYS[9], isPausedOrMaxed)
+  end
+  rcall("HINCRBY", jobKey, "atm", 1)
+  local maxEvents = getOrSetMaxEvents(KEYS[5])
+  -- Emit waiting event
+  rcall("XADD", KEYS[6], "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+    "jobId", ARGV[4], "prev", "active")
+  return 0
+else
+  return -1
+end
+`;
+export const retryJob = {
+    name: 'retryJob',
+    content,
+    keys: 11,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.d.ts b/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.d.ts
new file mode 100644
index 0000000..982262b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.d.ts
@@ -0,0 +1,5 @@
+export declare const saveStacktrace: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.js b/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.js
new file mode 100644
index 0000000..bf67095
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/saveStacktrace-1.js
@@ -0,0 +1,23 @@
+const content = `--[[
+  Save stacktrace and failedReason.
+  Input:
+    KEYS[1] job key
+    ARGV[1]  stacktrace
+    ARGV[2]  failedReason
+  Output:
+     0 - OK
+    -1 - Missing key
+]]
+local rcall = redis.call
+if rcall("EXISTS", KEYS[1]) == 1 then
+  rcall("HMSET", KEYS[1], "stacktrace", ARGV[1], "failedReason", ARGV[2])
+  return 0
+else
+  return -1
+end
+`;
+export const saveStacktrace = {
+    name: 'saveStacktrace',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateData-1.d.ts b/node_modules/bullmq/dist/esm/scripts/updateData-1.d.ts
new file mode 100644
index 0000000..f9e5c24
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateData-1.d.ts
@@ -0,0 +1,5 @@
+export declare const updateData: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateData-1.js b/node_modules/bullmq/dist/esm/scripts/updateData-1.js
new file mode 100644
index 0000000..46b3e52
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateData-1.js
@@ -0,0 +1,22 @@
+const content = `--[[
+  Update job data
+  Input:
+    KEYS[1] Job id key
+    ARGV[1] data
+  Output:
+    0 - OK
+   -1 - Missing job.
+]]
+local rcall = redis.call
+if rcall("EXISTS",KEYS[1]) == 1 then -- // Make sure job exists
+  rcall("HSET", KEYS[1], "data", ARGV[1])
+  return 0
+else
+  return -1
+end
+`;
+export const updateData = {
+    name: 'updateData',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.d.ts b/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.d.ts
new file mode 100644
index 0000000..9eef920
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.d.ts
@@ -0,0 +1,5 @@
+export declare const updateJobScheduler: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.js b/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.js
new file mode 100644
index 0000000..9b63056
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateJobScheduler-12.js
@@ -0,0 +1,340 @@
+const content = `--[[
+  Updates a job scheduler and adds next delayed job
+  Input:
+    KEYS[1]  'repeat' key
+    KEYS[2]  'delayed'
+    KEYS[3]  'wait' key
+    KEYS[4]  'paused' key
+    KEYS[5]  'meta'
+    KEYS[6]  'prioritized' key
+    KEYS[7]  'marker',
+    KEYS[8]  'id'
+    KEYS[9]  events stream key
+    KEYS[10] 'pc' priority counter
+    KEYS[11] producer key
+    KEYS[12] 'active' key
+    ARGV[1] next milliseconds
+    ARGV[2] jobs scheduler id
+    ARGV[3] Json stringified delayed data
+    ARGV[4] msgpacked delayed opts
+    ARGV[5] timestamp
+    ARGV[6] prefix key
+    ARGV[7] producer id
+    Output:
+      next delayed job id  - OK
+]] local rcall = redis.call
+local repeatKey = KEYS[1]
+local delayedKey = KEYS[2]
+local waitKey = KEYS[3]
+local pausedKey = KEYS[4]
+local metaKey = KEYS[5]
+local prioritizedKey = KEYS[6]
+local nextMillis = tonumber(ARGV[1])
+local jobSchedulerId = ARGV[2]
+local timestamp = tonumber(ARGV[5])
+local prefixKey = ARGV[6]
+local producerId = ARGV[7]
+local jobOpts = cmsgpack.unpack(ARGV[4])
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Shared helper to store a job and enqueue it into the appropriate list/set.
+  Handles delayed, prioritized, and standard (LIFO/FIFO) jobs.
+  Emits the appropriate event after enqueuing ("delayed" or "waiting").
+  Returns delay, priority from storeJob.
+]]
+-- Includes
+--[[
+  Adds a delayed job to the queue by doing the following:
+    - Creates a new job key with the job data.
+    - adds to delayed zset.
+    - Emits a global event 'delayed' if the job is delayed.
+]]
+-- Includes
+--[[
+  Add delay marker if needed.
+]]
+-- Includes
+--[[
+  Function to return the next delayed job timestamp.
+]]
+local function getNextDelayedTimestamp(delayedKey)
+  local result = rcall("ZRANGE", delayedKey, 0, 0, "WITHSCORES")
+  if #result then
+    local nextTimestamp = tonumber(result[2])
+    if nextTimestamp ~= nil then
+      return nextTimestamp / 0x1000
+    end
+  end
+end
+local function addDelayMarkerIfNeeded(markerKey, delayedKey)
+  local nextTimestamp = getNextDelayedTimestamp(delayedKey)
+  if nextTimestamp ~= nil then
+    -- Replace the score of the marker with the newest known
+    -- next timestamp.
+    rcall("ZADD", markerKey, nextTimestamp, "1")
+  end
+end
+--[[
+  Bake in the job id first 12 bits into the timestamp
+  to guarantee correct execution order of delayed jobs
+  (up to 4096 jobs per given timestamp or 4096 jobs apart per timestamp)
+  WARNING: Jobs that are so far apart that they wrap around will cause FIFO to fail
+]]
+local function getDelayedScore(delayedKey, timestamp, delay)
+  local delayedTimestamp = (delay > 0 and (tonumber(timestamp) + delay)) or tonumber(timestamp)
+  local minScore = delayedTimestamp * 0x1000
+  local maxScore = (delayedTimestamp + 1 ) * 0x1000 - 1
+  local result = rcall("ZREVRANGEBYSCORE", delayedKey, maxScore,
+    minScore, "WITHSCORES","LIMIT", 0, 1)
+  if #result then
+    local currentMaxScore = tonumber(result[2])
+    if currentMaxScore ~= nil then
+      if currentMaxScore >= maxScore then
+        return maxScore, delayedTimestamp
+      else
+        return currentMaxScore + 1, delayedTimestamp
+      end
+    end
+  end
+  return minScore, delayedTimestamp
+end
+local function addDelayedJob(jobId, delayedKey, eventsKey, timestamp,
+  maxEvents, markerKey, delay)
+  local score, delayedTimestamp = getDelayedScore(delayedKey, timestamp, tonumber(delay))
+  rcall("ZADD", delayedKey, score, jobId)
+  rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "delayed",
+    "jobId", jobId, "delay", delayedTimestamp)
+  -- mark that a delayed job is available
+  addDelayMarkerIfNeeded(markerKey, delayedKey)
+end
+--[[
+  Function to add job in target list and add marker if needed.
+]]
+-- Includes
+--[[
+  Add marker if needed when a job is available.
+]]
+local function addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+  if not isPausedOrMaxed then
+    rcall("ZADD", markerKey, 0, "0")
+  end  
+end
+local function addJobInTargetList(targetKey, markerKey, pushCmd, isPausedOrMaxed, jobId)
+  rcall(pushCmd, targetKey, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to add job considering priority.
+]]
+-- Includes
+--[[
+  Function to get priority score.
+]]
+local function getPriorityScore(priority, priorityCounterKey)
+  local prioCounter = rcall("INCR", priorityCounterKey)
+  return priority * 0x100000000 + prioCounter % 0x100000000
+end
+local function addJobWithPriority(markerKey, prioritizedKey, priority, jobId, priorityCounterKey,
+  isPausedOrMaxed)
+  local score = getPriorityScore(priority, priorityCounterKey)
+  rcall("ZADD", prioritizedKey, score, jobId)
+  addBaseMarkerIfNeeded(markerKey, isPausedOrMaxed)
+end
+--[[
+  Function to check for the meta.paused key to decide if we are paused or not
+  (since an empty list and !EXISTS are not really the same).
+]]
+local function getTargetQueueList(queueMetaKey, activeKey, waitKey, pausedKey)
+  local queueAttributes = rcall("HMGET", queueMetaKey, "paused", "concurrency", "max", "duration")
+  if queueAttributes[1] then
+    return pausedKey, true, queueAttributes[3], queueAttributes[4]
+  else
+    if queueAttributes[2] then
+      local activeCount = rcall("LLEN", activeKey)
+      if activeCount >= tonumber(queueAttributes[2]) then
+        return waitKey, true, queueAttributes[3], queueAttributes[4]
+      else
+        return waitKey, false, queueAttributes[3], queueAttributes[4]
+      end
+    end
+  end
+  return waitKey, false, queueAttributes[3], queueAttributes[4]
+end
+--[[
+  Function to store a job
+]]
+local function storeJob(eventsKey, jobIdKey, jobId, name, data, opts, timestamp,
+                        parentKey, parentData, repeatJobKey)
+    local jsonOpts = cjson.encode(opts)
+    local delay = opts['delay'] or 0
+    local priority = opts['priority'] or 0
+    local debounceId = opts['de'] and opts['de']['id']
+    local optionalValues = {}
+    if parentKey ~= nil then
+        table.insert(optionalValues, "parentKey")
+        table.insert(optionalValues, parentKey)
+        table.insert(optionalValues, "parent")
+        table.insert(optionalValues, parentData)
+    end
+    if repeatJobKey then
+        table.insert(optionalValues, "rjk")
+        table.insert(optionalValues, repeatJobKey)
+    end
+    if debounceId then
+        table.insert(optionalValues, "deid")
+        table.insert(optionalValues, debounceId)
+    end
+    rcall("HMSET", jobIdKey, "name", name, "data", data, "opts", jsonOpts,
+          "timestamp", timestamp, "delay", delay, "priority", priority,
+          unpack(optionalValues))
+    rcall("XADD", eventsKey, "*", "event", "added", "jobId", jobId, "name", name)
+    return delay, priority
+end
+local function storeAndEnqueueJob(eventsKey, jobIdKey, jobId, name, data, opts,
+    timestamp, parentKey, parentData, repeatJobKey, maxEvents,
+    waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+    priorityCounterKey, delayedKey, markerKey)
+  local delay, priority = storeJob(eventsKey, jobIdKey, jobId, name, data,
+      opts, timestamp, parentKey, parentData, repeatJobKey)
+  if delay ~= 0 and delayedKey then
+    addDelayedJob(jobId, delayedKey, eventsKey, timestamp, maxEvents, markerKey, delay)
+  else
+    local target, isPausedOrMaxed = getTargetQueueList(metaKey, activeKey, waitKey, pausedKey)
+    if priority > 0 then
+      addJobWithPriority(markerKey, prioritizedKey, priority, jobId,
+          priorityCounterKey, isPausedOrMaxed)
+    else
+      local pushCmd = opts['lifo'] and 'RPUSH' or 'LPUSH'
+      addJobInTargetList(target, markerKey, pushCmd, isPausedOrMaxed, jobId)
+    end
+    rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "waiting",
+        "jobId", jobId)
+  end
+  return delay, priority
+end
+local function addJobFromScheduler(jobKey, jobId, opts, waitKey, pausedKey, activeKey, metaKey, 
+  prioritizedKey, priorityCounter, delayedKey, markerKey, eventsKey, name, maxEvents, timestamp,
+  data, jobSchedulerId, repeatDelay)
+  opts['delay'] = repeatDelay
+  opts['jobId'] = jobId
+  storeAndEnqueueJob(eventsKey, jobKey, jobId, name, data, opts,
+      timestamp, nil, nil, jobSchedulerId, maxEvents,
+      waitKey, pausedKey, activeKey, metaKey, prioritizedKey,
+      priorityCounter, delayedKey, markerKey)
+end
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+local function getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+    local nextMillis
+    if not prevMillis then
+        if startDate then
+            -- Assuming startDate is passed as milliseconds from JavaScript
+            nextMillis = tonumber(startDate)
+            nextMillis = nextMillis > now and nextMillis or now
+        else
+            nextMillis = now
+            -- For the first iteration with no startDate and an explicit
+            -- offset, align nextMillis to the next offset slot strictly
+            -- after now. Without this the user-supplied offset is
+            -- recorded but ignored, and the first job fires at now
+            -- instead of the next aligned timestamp (issue #3705).
+            if offset and offset > 0 then
+                local aligned = math.floor(nextMillis / every) * every + offset
+                if aligned <= nextMillis then
+                    aligned = aligned + every
+                end
+                nextMillis = aligned
+            end
+        end
+    else
+        nextMillis = prevMillis + every
+        -- check if we may have missed some iterations
+        if nextMillis < now then
+            nextMillis = math.floor(now / every) * every + every + (offset or 0)
+        end
+    end
+    if not offset or offset == 0 then
+        local timeSlot = math.floor(nextMillis / every) * every;
+        offset = nextMillis - timeSlot;
+    end
+    -- Return a tuple nextMillis, offset
+    return math.floor(nextMillis), math.floor(offset)
+end
+local prevMillis = rcall("ZSCORE", repeatKey, jobSchedulerId)
+-- Validate that scheduler exists.
+-- If it does not exist we should not iterate anymore.
+if prevMillis then
+    prevMillis = tonumber(prevMillis)
+    local schedulerKey = repeatKey .. ":" .. jobSchedulerId
+    local schedulerAttributes = rcall("HMGET", schedulerKey, "name", "data", "every", "startDate", "offset")
+    local every = tonumber(schedulerAttributes[3])
+    local now = tonumber(timestamp)
+    -- If every is not found in scheduler attributes, try to get it from job options
+    if not every and jobOpts['repeat'] and jobOpts['repeat']['every'] then
+        every = tonumber(jobOpts['repeat']['every'])
+    end
+    if every then
+        local startDate = schedulerAttributes[4]
+        local jobOptsOffset = jobOpts['repeat'] and jobOpts['repeat']['offset'] or 0
+        local offset = schedulerAttributes[5] or jobOptsOffset or 0
+        local newOffset
+        nextMillis, newOffset = getJobSchedulerEveryNextMillis(prevMillis, every, now, offset, startDate)
+        if not offset then
+            rcall("HSET", schedulerKey, "offset", newOffset)
+            jobOpts['repeat']['offset'] = newOffset
+        end
+    end
+    local nextDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. nextMillis
+    local nextDelayedJobKey = schedulerKey .. ":" .. nextMillis
+    local currentDelayedJobId = "repeat:" .. jobSchedulerId .. ":" .. prevMillis
+    if producerId == currentDelayedJobId then
+        local eventsKey = KEYS[9]
+        local maxEvents = getOrSetMaxEvents(metaKey)
+        if rcall("EXISTS", nextDelayedJobKey) ~= 1 then
+            rcall("ZADD", repeatKey, nextMillis, jobSchedulerId)
+            rcall("HINCRBY", schedulerKey, "ic", 1)
+            rcall("INCR", KEYS[8])
+            -- TODO: remove this workaround in next breaking change,
+            -- all job-schedulers must save job data
+            local templateData = schedulerAttributes[2] or ARGV[3]
+            if templateData and templateData ~= '{}' then
+                rcall("HSET", schedulerKey, "data", templateData)
+            end
+            local delay = nextMillis - now
+            -- Fast Clamp delay to minimum of 0
+            if delay < 0 then
+                delay = 0
+            end
+            jobOpts["delay"] = delay
+            addJobFromScheduler(nextDelayedJobKey, nextDelayedJobId, jobOpts, waitKey, pausedKey, KEYS[12], metaKey,
+                prioritizedKey, KEYS[10], delayedKey, KEYS[7], eventsKey, schedulerAttributes[1], maxEvents, ARGV[5],
+                templateData or '{}', jobSchedulerId, delay)
+            -- TODO: remove this workaround in next breaking change
+            if KEYS[11] ~= "" then
+                rcall("HSET", KEYS[11], "nrjid", nextDelayedJobId)
+            end
+            return nextDelayedJobId .. "" -- convert to string
+        else
+            rcall("XADD", eventsKey, "MAXLEN", "~", maxEvents, "*", "event", "duplicated", "jobId", nextDelayedJobId)
+        end
+    end
+end
+`;
+export const updateJobScheduler = {
+    name: 'updateJobScheduler',
+    content,
+    keys: 12,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateProgress-3.d.ts b/node_modules/bullmq/dist/esm/scripts/updateProgress-3.d.ts
new file mode 100644
index 0000000..74afa14
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateProgress-3.d.ts
@@ -0,0 +1,5 @@
+export declare const updateProgress: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateProgress-3.js b/node_modules/bullmq/dist/esm/scripts/updateProgress-3.js
new file mode 100644
index 0000000..f7c9402
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateProgress-3.js
@@ -0,0 +1,42 @@
+const content = `--[[
+  Update job progress
+  Input:
+    KEYS[1] Job id key
+    KEYS[2] event stream key
+    KEYS[3] meta key
+    ARGV[1] id
+    ARGV[2] progress
+  Output:
+     0 - OK
+    -1 - Missing job.
+  Event:
+    progress(jobId, progress)
+]]
+local rcall = redis.call
+-- Includes
+--[[
+  Function to get max events value or set by default 10000.
+]]
+local function getOrSetMaxEvents(metaKey)
+  local maxEvents = rcall("HGET", metaKey, "opts.maxLenEvents")
+  if not maxEvents then
+    maxEvents = 10000
+    rcall("HSET", metaKey, "opts.maxLenEvents", maxEvents)
+  end
+  return maxEvents
+end
+if rcall("EXISTS", KEYS[1]) == 1 then -- // Make sure job exists
+    local maxEvents = getOrSetMaxEvents(KEYS[3])
+    rcall("HSET", KEYS[1], "progress", ARGV[2])
+    rcall("XADD", KEYS[2], "MAXLEN", "~", maxEvents, "*", "event", "progress",
+          "jobId", ARGV[1], "data", ARGV[2]);
+    return 0
+else
+    return -1
+end
+`;
+export const updateProgress = {
+    name: 'updateProgress',
+    content,
+    keys: 3,
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.d.ts b/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.d.ts
new file mode 100644
index 0000000..197f14c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.d.ts
@@ -0,0 +1,5 @@
+export declare const updateRepeatableJobMillis: {
+    name: string;
+    content: string;
+    keys: number;
+};
diff --git a/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.js b/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.js
new file mode 100644
index 0000000..5d324fe
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/scripts/updateRepeatableJobMillis-1.js
@@ -0,0 +1,29 @@
+const content = `--[[
+  Adds a repeatable job
+    Input:
+      KEYS[1] 'repeat' key
+      ARGV[1] next milliseconds
+      ARGV[2] custom key
+      ARGV[3] legacy custom key TODO: remove this logic in next breaking change
+      Output:
+        repeatableKey  - OK
+]]
+local rcall = redis.call
+local repeatKey = KEYS[1]
+local nextMillis = ARGV[1]
+local customKey = ARGV[2]
+local legacyCustomKey = ARGV[3]
+if rcall("ZSCORE", repeatKey, customKey) then
+    rcall("ZADD", repeatKey, nextMillis, customKey)
+    return customKey
+elseif rcall("ZSCORE", repeatKey, legacyCustomKey) ~= false then
+    rcall("ZADD", repeatKey, nextMillis, legacyCustomKey)
+    return legacyCustomKey
+end
+return ''
+`;
+export const updateRepeatableJobMillis = {
+    name: 'updateRepeatableJobMillis',
+    content,
+    keys: 1,
+};
diff --git a/node_modules/bullmq/dist/esm/tsconfig.tsbuildinfo b/node_modules/bullmq/dist/esm/tsconfig.tsbuildinfo
new file mode 100644
index 0000000..070f21a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/tsconfig.tsbuildinfo
@@ -0,0 +1 @@
+{"fileNames":["../../node_modules/typescript/lib/lib.es5.d.ts","../../node_modules/typescript/lib/lib.es2015.d.ts","../../node_modules/typescript/lib/lib.es2016.d.ts","../../node_modules/typescript/lib/lib.es2017.d.ts","../../node_modules/typescript/lib/lib.es2018.d.ts","../../node_modules/typescript/lib/lib.es2019.d.ts","../../node_modules/typescript/lib/lib.es2020.d.ts","../../node_modules/typescript/lib/lib.es2021.d.ts","../../node_modules/typescript/lib/lib.es2022.d.ts","../../node_modules/typescript/lib/lib.es2023.d.ts","../../node_modules/typescript/lib/lib.es2024.d.ts","../../node_modules/typescript/lib/lib.esnext.d.ts","../../node_modules/typescript/lib/lib.dom.d.ts","../../node_modules/typescript/lib/lib.es2015.core.d.ts","../../node_modules/typescript/lib/lib.es2015.collection.d.ts","../../node_modules/typescript/lib/lib.es2015.generator.d.ts","../../node_modules/typescript/lib/lib.es2015.iterable.d.ts","../../node_modules/typescript/lib/lib.es2015.promise.d.ts","../../node_modules/typescript/lib/lib.es2015.proxy.d.ts","../../node_modules/typescript/lib/lib.es2015.reflect.d.ts","../../node_modules/typescript/lib/lib.es2015.symbol.d.ts","../../node_modules/typescript/lib/lib.es2015.symbol.wellknown.d.ts","../../node_modules/typescript/lib/lib.es2016.array.include.d.ts","../../node_modules/typescript/lib/lib.es2016.intl.d.ts","../../node_modules/typescript/lib/lib.es2017.arraybuffer.d.ts","../../node_modules/typescript/lib/lib.es2017.date.d.ts","../../node_modules/typescript/lib/lib.es2017.object.d.ts","../../node_modules/typescript/lib/lib.es2017.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2017.string.d.ts","../../node_modules/typescript/lib/lib.es2017.intl.d.ts","../../node_modules/typescript/lib/lib.es2017.typedarrays.d.ts","../../node_modules/typescript/lib/lib.es2018.asyncgenerator.d.ts","../../node_modules/typescript/lib/lib.es2018.asynciterable.d.ts","../../node_modules/typescript/lib/lib.es2018.intl.d.ts","../../node_modules/typescript/lib/lib.es2018.promise.d.ts","../../node_modules/typescript/lib/lib.es2018.regexp.d.ts","../../node_modules/typescript/lib/lib.es2019.array.d.ts","../../node_modules/typescript/lib/lib.es2019.object.d.ts","../../node_modules/typescript/lib/lib.es2019.string.d.ts","../../node_modules/typescript/lib/lib.es2019.symbol.d.ts","../../node_modules/typescript/lib/lib.es2019.intl.d.ts","../../node_modules/typescript/lib/lib.es2020.bigint.d.ts","../../node_modules/typescript/lib/lib.es2020.date.d.ts","../../node_modules/typescript/lib/lib.es2020.promise.d.ts","../../node_modules/typescript/lib/lib.es2020.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2020.string.d.ts","../../node_modules/typescript/lib/lib.es2020.symbol.wellknown.d.ts","../../node_modules/typescript/lib/lib.es2020.intl.d.ts","../../node_modules/typescript/lib/lib.es2020.number.d.ts","../../node_modules/typescript/lib/lib.es2021.promise.d.ts","../../node_modules/typescript/lib/lib.es2021.string.d.ts","../../node_modules/typescript/lib/lib.es2021.weakref.d.ts","../../node_modules/typescript/lib/lib.es2021.intl.d.ts","../../node_modules/typescript/lib/lib.es2022.array.d.ts","../../node_modules/typescript/lib/lib.es2022.error.d.ts","../../node_modules/typescript/lib/lib.es2022.intl.d.ts","../../node_modules/typescript/lib/lib.es2022.object.d.ts","../../node_modules/typescript/lib/lib.es2022.string.d.ts","../../node_modules/typescript/lib/lib.es2022.regexp.d.ts","../../node_modules/typescript/lib/lib.es2023.array.d.ts","../../node_modules/typescript/lib/lib.es2023.collection.d.ts","../../node_modules/typescript/lib/lib.es2023.intl.d.ts","../../node_modules/typescript/lib/lib.es2024.arraybuffer.d.ts","../../node_modules/typescript/lib/lib.es2024.collection.d.ts","../../node_modules/typescript/lib/lib.es2024.object.d.ts","../../node_modules/typescript/lib/lib.es2024.promise.d.ts","../../node_modules/typescript/lib/lib.es2024.regexp.d.ts","../../node_modules/typescript/lib/lib.es2024.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.es2024.string.d.ts","../../node_modules/typescript/lib/lib.esnext.array.d.ts","../../node_modules/typescript/lib/lib.esnext.collection.d.ts","../../node_modules/typescript/lib/lib.esnext.intl.d.ts","../../node_modules/typescript/lib/lib.esnext.disposable.d.ts","../../node_modules/typescript/lib/lib.esnext.promise.d.ts","../../node_modules/typescript/lib/lib.esnext.decorators.d.ts","../../node_modules/typescript/lib/lib.esnext.iterator.d.ts","../../node_modules/typescript/lib/lib.esnext.float16.d.ts","../../node_modules/typescript/lib/lib.esnext.error.d.ts","../../node_modules/typescript/lib/lib.esnext.sharedmemory.d.ts","../../node_modules/typescript/lib/lib.decorators.d.ts","../../node_modules/typescript/lib/lib.decorators.legacy.d.ts","../../node_modules/tslib/tslib.d.ts","../../src/classes/async-fifo-queue.ts","../../src/interfaces/backoff-options.ts","../../src/types/keep-jobs.ts","../../src/interfaces/parent-options.ts","../../node_modules/cron-parser/types/common.d.ts","../../node_modules/cron-parser/types/index.d.ts","../../src/interfaces/repeat-options.ts","../../src/interfaces/base-job-options.ts","../../src/types/deduplication-options.ts","../../src/types/job-options.ts","../../src/types/job-progress.ts","../../src/interfaces/parent.ts","../../src/interfaces/job-json.ts","../../src/types/job-json-sandbox.ts","../../src/interfaces/minimal-job.ts","../../src/types/backoff-strategy.ts","../../src/classes/backoffs.ts","../../src/enums/child-command.ts","../../src/enums/error-code.ts","../../src/enums/parent-command.ts","../../src/enums/metrics-time.ts","../../src/enums/telemetry-attributes.ts","../../src/enums/index.ts","../../src/types/repeat-strategy.ts","../../src/interfaces/advanced-options.ts","../../src/interfaces/child-message.ts","../../src/interfaces/redis-client.ts","../../src/interfaces/connection.ts","../../src/types/database-type.ts","../../src/types/finished-status.ts","../../src/types/job-scheduler-template-options.ts","../../src/types/job-type.ts","../../src/types/index.ts","../../node_modules/@types/node/compatibility/iterators.d.ts","../../node_modules/@types/node/globals.typedarray.d.ts","../../node_modules/@types/node/buffer.buffer.d.ts","../../node_modules/@types/node/globals.d.ts","../../node_modules/@types/node/web-globals/abortcontroller.d.ts","../../node_modules/@types/node/web-globals/crypto.d.ts","../../node_modules/@types/node/web-globals/domexception.d.ts","../../node_modules/@types/node/web-globals/events.d.ts","../../node_modules/buffer/index.d.ts","../../node_modules/undici-types/utility.d.ts","../../node_modules/undici-types/header.d.ts","../../node_modules/undici-types/readable.d.ts","../../node_modules/undici-types/fetch.d.ts","../../node_modules/undici-types/formdata.d.ts","../../node_modules/undici-types/connector.d.ts","../../node_modules/undici-types/client-stats.d.ts","../../node_modules/undici-types/client.d.ts","../../node_modules/undici-types/errors.d.ts","../../node_modules/undici-types/dispatcher.d.ts","../../node_modules/undici-types/global-dispatcher.d.ts","../../node_modules/undici-types/global-origin.d.ts","../../node_modules/undici-types/pool-stats.d.ts","../../node_modules/undici-types/pool.d.ts","../../node_modules/undici-types/handlers.d.ts","../../node_modules/undici-types/balanced-pool.d.ts","../../node_modules/undici-types/h2c-client.d.ts","../../node_modules/undici-types/agent.d.ts","../../node_modules/undici-types/mock-interceptor.d.ts","../../node_modules/undici-types/mock-call-history.d.ts","../../node_modules/undici-types/mock-agent.d.ts","../../node_modules/undici-types/mock-client.d.ts","../../node_modules/undici-types/mock-pool.d.ts","../../node_modules/undici-types/snapshot-agent.d.ts","../../node_modules/undici-types/mock-errors.d.ts","../../node_modules/undici-types/proxy-agent.d.ts","../../node_modules/undici-types/env-http-proxy-agent.d.ts","../../node_modules/undici-types/retry-handler.d.ts","../../node_modules/undici-types/retry-agent.d.ts","../../node_modules/undici-types/api.d.ts","../../node_modules/undici-types/cache-interceptor.d.ts","../../node_modules/undici-types/interceptors.d.ts","../../node_modules/undici-types/util.d.ts","../../node_modules/undici-types/cookies.d.ts","../../node_modules/undici-types/patch.d.ts","../../node_modules/undici-types/websocket.d.ts","../../node_modules/undici-types/eventsource.d.ts","../../node_modules/undici-types/diagnostics-channel.d.ts","../../node_modules/undici-types/content-type.d.ts","../../node_modules/undici-types/cache.d.ts","../../node_modules/undici-types/index.d.ts","../../node_modules/@types/node/web-globals/fetch.d.ts","../../node_modules/@types/node/web-globals/navigator.d.ts","../../node_modules/@types/node/web-globals/storage.d.ts","../../node_modules/@types/node/web-globals/streams.d.ts","../../node_modules/@types/node/assert.d.ts","../../node_modules/@types/node/assert/strict.d.ts","../../node_modules/@types/node/async_hooks.d.ts","../../node_modules/@types/node/buffer.d.ts","../../node_modules/@types/node/child_process.d.ts","../../node_modules/@types/node/cluster.d.ts","../../node_modules/@types/node/console.d.ts","../../node_modules/@types/node/constants.d.ts","../../node_modules/@types/node/crypto.d.ts","../../node_modules/@types/node/dgram.d.ts","../../node_modules/@types/node/diagnostics_channel.d.ts","../../node_modules/@types/node/dns.d.ts","../../node_modules/@types/node/dns/promises.d.ts","../../node_modules/@types/node/domain.d.ts","../../node_modules/@types/node/events.d.ts","../../node_modules/@types/node/fs.d.ts","../../node_modules/@types/node/fs/promises.d.ts","../../node_modules/@types/node/http.d.ts","../../node_modules/@types/node/http2.d.ts","../../node_modules/@types/node/https.d.ts","../../node_modules/@types/node/inspector.d.ts","../../node_modules/@types/node/inspector.generated.d.ts","../../node_modules/@types/node/module.d.ts","../../node_modules/@types/node/net.d.ts","../../node_modules/@types/node/os.d.ts","../../node_modules/@types/node/path.d.ts","../../node_modules/@types/node/perf_hooks.d.ts","../../node_modules/@types/node/process.d.ts","../../node_modules/@types/node/punycode.d.ts","../../node_modules/@types/node/querystring.d.ts","../../node_modules/@types/node/readline.d.ts","../../node_modules/@types/node/readline/promises.d.ts","../../node_modules/@types/node/repl.d.ts","../../node_modules/@types/node/sea.d.ts","../../node_modules/@types/node/sqlite.d.ts","../../node_modules/@types/node/stream.d.ts","../../node_modules/@types/node/stream/promises.d.ts","../../node_modules/@types/node/stream/consumers.d.ts","../../node_modules/@types/node/stream/web.d.ts","../../node_modules/@types/node/string_decoder.d.ts","../../node_modules/@types/node/test.d.ts","../../node_modules/@types/node/timers.d.ts","../../node_modules/@types/node/timers/promises.d.ts","../../node_modules/@types/node/tls.d.ts","../../node_modules/@types/node/trace_events.d.ts","../../node_modules/@types/node/tty.d.ts","../../node_modules/@types/node/url.d.ts","../../node_modules/@types/node/util.d.ts","../../node_modules/@types/node/v8.d.ts","../../node_modules/@types/node/vm.d.ts","../../node_modules/@types/node/wasi.d.ts","../../node_modules/@types/node/worker_threads.d.ts","../../node_modules/@types/node/zlib.d.ts","../../node_modules/@types/node/index.d.ts","../../node_modules/ioredis/built/types.d.ts","../../node_modules/ioredis/built/Command.d.ts","../../node_modules/ioredis/built/ScanStream.d.ts","../../node_modules/ioredis/built/utils/RedisCommander.d.ts","../../node_modules/ioredis/built/transaction.d.ts","../../node_modules/ioredis/built/utils/Commander.d.ts","../../node_modules/ioredis/built/connectors/AbstractConnector.d.ts","../../node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts","../../node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts","../../node_modules/ioredis/built/connectors/StandaloneConnector.d.ts","../../node_modules/ioredis/built/redis/RedisOptions.d.ts","../../node_modules/ioredis/built/cluster/util.d.ts","../../node_modules/ioredis/built/cluster/ClusterOptions.d.ts","../../node_modules/ioredis/built/cluster/index.d.ts","../../node_modules/denque/index.d.ts","../../node_modules/ioredis/built/SubscriptionSet.d.ts","../../node_modules/ioredis/built/DataHandler.d.ts","../../node_modules/ioredis/built/Redis.d.ts","../../node_modules/ioredis/built/Pipeline.d.ts","../../node_modules/ioredis/built/index.d.ts","../../src/interfaces/redis-options.ts","../../src/interfaces/telemetry.ts","../../src/interfaces/queue-options.ts","../../src/interfaces/flow-job.ts","../../src/interfaces/ioredis-events.ts","../../src/interfaces/job-scheduler-json.ts","../../src/interfaces/lock-manager-worker-context.ts","../../src/interfaces/metrics-options.ts","../../src/interfaces/metrics.ts","../../src/classes/queue-keys.ts","../../src/interfaces/script-queue-context.ts","../../src/interfaces/minimal-queue.ts","../../src/interfaces/parent-message.ts","../../src/interfaces/queue-meta.ts","../../src/interfaces/rate-limiter-options.ts","../../src/interfaces/redis-streams.ts","../../src/interfaces/repeatable-job.ts","../../src/interfaces/repeatable-options.ts","../../src/interfaces/retry-options.ts","../../src/interfaces/sandboxed-job.ts","../../src/interfaces/sandboxed-job-processor.ts","../../src/interfaces/sandboxed-options.ts","../../src/interfaces/worker-options.ts","../../src/interfaces/receiver.ts","../../src/interfaces/index.ts","../../src/classes/child.ts","../../src/classes/child-pool.ts","../../node_modules/node-abort-controller/index.d.ts","../../src/classes/abort-controller.ts","../../node_modules/@types/lodash/common/common.d.ts","../../node_modules/@types/lodash/common/array.d.ts","../../node_modules/@types/lodash/common/collection.d.ts","../../node_modules/@types/lodash/common/date.d.ts","../../node_modules/@types/lodash/common/function.d.ts","../../node_modules/@types/lodash/common/lang.d.ts","../../node_modules/@types/lodash/common/math.d.ts","../../node_modules/@types/lodash/common/number.d.ts","../../node_modules/@types/lodash/common/object.d.ts","../../node_modules/@types/lodash/common/seq.d.ts","../../node_modules/@types/lodash/common/string.d.ts","../../node_modules/@types/lodash/common/util.d.ts","../../node_modules/@types/lodash/index.d.ts","../../node_modules/@types/lodash.defaults/index.d.ts","../../node_modules/@types/lodash.isarguments/index.d.ts","../../node_modules/ioredis/built/utils/lodash.d.ts","../../node_modules/ioredis/built/utils/debug.d.ts","../../node_modules/ioredis/built/utils/index.d.ts","../../src/classes/errors/connection-closed-error.ts","../../node_modules/@types/semver/functions/inc.d.ts","../../node_modules/@types/semver/classes/semver.d.ts","../../node_modules/@types/semver/functions/parse.d.ts","../../node_modules/@types/semver/functions/valid.d.ts","../../node_modules/@types/semver/functions/clean.d.ts","../../node_modules/@types/semver/functions/diff.d.ts","../../node_modules/@types/semver/functions/major.d.ts","../../node_modules/@types/semver/functions/minor.d.ts","../../node_modules/@types/semver/functions/patch.d.ts","../../node_modules/@types/semver/functions/prerelease.d.ts","../../node_modules/@types/semver/functions/compare.d.ts","../../node_modules/@types/semver/functions/rcompare.d.ts","../../node_modules/@types/semver/functions/compare-loose.d.ts","../../node_modules/@types/semver/functions/compare-build.d.ts","../../node_modules/@types/semver/functions/sort.d.ts","../../node_modules/@types/semver/functions/rsort.d.ts","../../node_modules/@types/semver/functions/gt.d.ts","../../node_modules/@types/semver/functions/lt.d.ts","../../node_modules/@types/semver/functions/eq.d.ts","../../node_modules/@types/semver/functions/neq.d.ts","../../node_modules/@types/semver/functions/gte.d.ts","../../node_modules/@types/semver/functions/lte.d.ts","../../node_modules/@types/semver/functions/cmp.d.ts","../../node_modules/@types/semver/functions/coerce.d.ts","../../node_modules/@types/semver/classes/comparator.d.ts","../../node_modules/@types/semver/classes/range.d.ts","../../node_modules/@types/semver/functions/satisfies.d.ts","../../node_modules/@types/semver/ranges/max-satisfying.d.ts","../../node_modules/@types/semver/ranges/min-satisfying.d.ts","../../node_modules/@types/semver/ranges/to-comparators.d.ts","../../node_modules/@types/semver/ranges/min-version.d.ts","../../node_modules/@types/semver/ranges/valid.d.ts","../../node_modules/@types/semver/ranges/outside.d.ts","../../node_modules/@types/semver/ranges/gtr.d.ts","../../node_modules/@types/semver/ranges/ltr.d.ts","../../node_modules/@types/semver/ranges/intersects.d.ts","../../node_modules/@types/semver/ranges/simplify.d.ts","../../node_modules/@types/semver/ranges/subset.d.ts","../../node_modules/@types/semver/internals/identifiers.d.ts","../../node_modules/@types/semver/index.d.ts","../../src/utils/index.ts","../../src/classes/child-processor.ts","../../src/classes/errors/delayed-error.ts","../../src/classes/errors/rate-limit-error.ts","../../src/classes/errors/unrecoverable-error.ts","../../src/classes/errors/waiting-children-error.ts","../../src/classes/errors/waiting-error.ts","../../src/classes/errors/index.ts","../../node_modules/msgpackr/index.d.ts","../../src/version.ts","../../src/classes/scripts.ts","../../src/utils/create-scripts.ts","../../src/scripts/addDelayedJob-6.ts","../../src/scripts/addJobScheduler-11.ts","../../src/scripts/addLog-2.ts","../../src/scripts/addParentJob-6.ts","../../src/scripts/addPrioritizedJob-9.ts","../../src/scripts/addRepeatableJob-2.ts","../../src/scripts/addStandardJob-9.ts","../../src/scripts/changeDelay-4.ts","../../src/scripts/changePriority-7.ts","../../src/scripts/cleanJobsInSet-3.ts","../../src/scripts/drain-5.ts","../../src/scripts/extendLock-2.ts","../../src/scripts/extendLocks-1.ts","../../src/scripts/getCounts-1.ts","../../src/scripts/getCountsPerPriority-4.ts","../../src/scripts/getDependencyCounts-4.ts","../../src/scripts/getJobScheduler-1.ts","../../src/scripts/getMetrics-2.ts","../../src/scripts/getRanges-1.ts","../../src/scripts/getRateLimitTtl-2.ts","../../src/scripts/getState-8.ts","../../src/scripts/getStateV2-8.ts","../../src/scripts/isFinished-3.ts","../../src/scripts/isJobInList-1.ts","../../src/scripts/isMaxed-2.ts","../../src/scripts/moveJobFromActiveToWait-9.ts","../../src/scripts/moveJobsToWait-8.ts","../../src/scripts/moveStalledJobsToWait-8.ts","../../src/scripts/moveToActive-11.ts","../../src/scripts/moveToDelayed-12.ts","../../src/scripts/moveToFinished-14.ts","../../src/scripts/moveToWaitingChildren-7.ts","../../src/scripts/obliterate-2.ts","../../src/scripts/paginate-1.ts","../../src/scripts/pause-7.ts","../../src/scripts/promote-9.ts","../../src/scripts/releaseLock-1.ts","../../src/scripts/removeChildDependency-1.ts","../../src/scripts/removeDeduplicationKey-1.ts","../../src/scripts/removeJob-2.ts","../../src/scripts/removeJobScheduler-3.ts","../../src/scripts/removeOrphanedJobs-1.ts","../../src/scripts/removeRepeatable-3.ts","../../src/scripts/removeUnprocessedChildren-2.ts","../../src/scripts/reprocessJob-8.ts","../../src/scripts/retryJob-11.ts","../../src/scripts/saveStacktrace-1.ts","../../src/scripts/updateData-1.ts","../../src/scripts/updateJobScheduler-12.ts","../../src/scripts/updateProgress-3.ts","../../src/scripts/updateRepeatableJobMillis-1.ts","../../src/scripts/index.ts","../../src/classes/ioredis-client.ts","../../src/classes/redis-connection.ts","../../src/classes/queue-base.ts","../../src/classes/queue-events.ts","../../src/classes/job.ts","../../src/classes/flow-producer.ts","../../src/classes/node-redis-client.ts","../../src/classes/bun-redis-client.ts","../../src/classes/job-scheduler.ts","../../src/classes/lock-manager.ts","../../src/classes/queue-events-producer.ts","../../src/classes/queue-getters.ts","../../src/classes/repeat.ts","../../src/classes/queue.ts","../../src/classes/sandbox.ts","../../src/types/processor.ts","../../src/classes/worker.ts","../../src/classes/index.ts","../../src/index.ts","../../src/classes/main-base.ts","../../src/classes/main-worker.ts","../../src/classes/main.ts","../../src/types/net.d.ts"],"fileIdsList":[[118,173,190,191,193,287,420],[118,173,190,191,193,275,277,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,276,277,278,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,279,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,280,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,281,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,282,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,283,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,284,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,285,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,286,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,285,287,420],[118,173,190,191,193,275,276,277,278,279,280,281,282,283,284,285,286,420],[118,170,171,173,190,191,193,420],[118,172,173,190,191,193,420],[173,190,191,193,420],[118,173,178,190,191,193,208,420],[118,173,174,179,184,190,191,193,205,216,420],[118,173,174,175,184,190,191,193,420],[118,173,190,191,193,420],[118,173,176,190,191,193,217,420],[118,173,177,178,185,190,191,193,194,420],[118,173,178,190,191,193,205,213,420],[118,173,179,181,184,190,191,193,420],[118,172,173,180,190,191,193,420],[118,173,181,182,190,191,193,420],[118,173,183,184,190,191,193,420],[118,172,173,184,190,191,193,420],[118,173,184,185,186,190,191,193,205,216,420],[118,173,184,185,186,190,191,193,200,205,208,420],[118,165,173,181,184,187,190,191,193,205,216,420],[118,173,184,185,187,188,190,191,193,205,213,216,420],[118,173,187,189,190,191,193,205,213,216,420],[116,117,118,119,120,121,122,123,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,420],[118,173,184,190,191,193,420],[118,173,190,191,192,193,216,420],[118,173,181,184,190,191,193,205,420],[118,173,190,191,193,194,420],[118,173,190,191,193,195,420],[118,172,173,190,191,193,196,420],[118,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,420],[118,173,190,191,193,198,420],[118,173,190,191,193,199,420],[118,173,184,190,191,193,200,201,420],[118,173,190,191,193,200,202,217,219,420],[118,173,185,190,191,193,420],[118,173,184,190,191,193,205,206,208,420],[118,173,190,191,193,207,208,420],[118,173,190,191,193,205,206,420],[118,173,190,191,193,208,420],[118,173,190,191,193,209,420],[118,170,173,190,191,193,205,210,216,420],[118,173,184,190,191,193,211,212,420],[118,173,190,191,193,211,212,420],[118,173,190,191,193,214,420],[118,173,190,191,193,215,420],[118,173,187,190,191,193,199,216,420],[118,173,178,190,191,193,217,420],[118,173,190,191,193,205,218,420],[118,173,190,191,192,193,219,420],[118,173,190,191,193,220,420],[118,173,178,190,191,193,420],[118,165,173,190,191,193,420],[118,173,190,191,193,221,420],[118,165,173,184,186,190,191,193,196,205,208,216,218,219,221,420],[118,173,190,191,193,205,222,420],[118,173,190,191,193,295,333,420],[118,173,190,191,193,295,318,333,420],[118,173,190,191,193,294,333,420],[118,173,190,191,193,333,420],[118,173,190,191,193,295,420],[118,173,190,191,193,295,319,333,420],[118,173,190,191,193,294,295,296,297,298,299,300,301,302,303,304,305,306,307,308,309,310,311,312,313,314,315,316,317,318,319,320,321,322,323,324,325,326,327,328,329,330,331,332,420],[118,173,190,191,193,319,333,420],[87,118,173,190,191,193,420],[118,173,190,191,193,223,224,420],[118,173,184,190,191,193,223,224,240,241,420],[118,173,190,191,193,225,229,239,243,420],[118,173,184,190,191,193,223,224,225,226,228,229,236,239,240,242,420],[118,173,190,191,193,205,223,420],[118,173,190,191,193,225,420],[118,173,181,190,191,193,223,229,236,237,420],[118,173,184,190,191,193,223,224,225,226,228,229,237,238,243,420],[118,173,181,190,191,193,223,420],[118,173,190,191,193,224,420],[118,173,190,191,193,230,420],[118,173,190,191,193,232,420],[118,173,184,190,191,193,213,223,224,230,232,233,238,420],[118,173,190,191,193,236,420],[118,173,190,191,193,213,223,224,230,420],[118,173,190,191,193,224,225,226,227,230,234,235,236,237,238,239,243,244,420],[118,173,190,191,193,229,231,234,235,420],[118,173,190,191,193,227,420],[118,173,190,191,193,213,223,420],[118,173,190,191,193,224,225,227,420],[118,173,190,191,193,223,224,290,291,420],[118,173,190,191,193,288,289,420],[118,173,190,191,193,205,420],[118,131,134,137,138,173,190,191,193,216,420],[118,134,173,190,191,193,205,216,420],[118,134,138,173,190,191,193,216,420],[118,128,173,190,191,193,420],[118,132,173,190,191,193,420],[118,130,131,134,173,190,191,193,216,420],[118,173,190,191,193,213,420],[118,173,190,191,193,223,420],[118,128,173,190,191,193,223,420],[118,130,134,173,190,191,193,216,420],[118,125,126,127,129,133,173,184,190,191,193,205,216,420],[118,134,142,150,173,190,191,193,420],[118,126,132,173,190,191,193,420],[118,134,159,160,173,190,191,193,420],[118,126,129,134,173,190,191,193,208,216,223,420],[118,134,173,190,191,193,420],[118,125,173,190,191,193,420],[118,128,129,130,132,133,134,135,136,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,160,161,162,163,164,173,190,191,193,420],[118,134,152,155,173,181,190,191,193,420],[118,134,142,143,144,173,190,191,193,420],[118,132,134,143,145,173,190,191,193,420],[118,133,173,190,191,193,420],[118,126,128,134,173,190,191,193,420],[118,134,138,143,145,173,190,191,193,420],[118,138,173,190,191,193,420],[118,132,134,137,173,190,191,193,216,420],[118,126,130,134,142,173,190,191,193,420],[118,134,152,173,190,191,193,420],[118,145,173,190,191,193,420],[118,128,134,159,173,190,191,193,208,221,223,420],[82,118,173,190,191,193,273,420],[82,118,173,190,191,193,420],[82,84,97,98,118,173,190,191,193,420],[82,109,118,173,178,184,190,191,193,205,293,420],[82,118,173,190,191,193,195,270,271,420],[82,105,115,118,173,190,191,193,270,274,334,420],[82,105,118,173,174,184,190,191,193,221,270,420],[82,118,173,190,191,193,293,336,337,338,339,340,420],[82,105,118,173,184,190,191,193,255,270,334,399,402,420],[82,83,99,118,173,190,191,193,255,271,272,335,341,344,398,399,400,401,402,403,404,405,406,407,408,409,410,411,412,414,420],[82,109,118,173,190,191,193,245,420],[82,88,105,115,118,173,190,191,193,270,334,399,400,402,420],[82,99,105,115,118,173,190,191,193,217,270,334,338,344,345,401,420],[82,105,118,173,190,191,193,270,274,420],[82,105,118,173,190,191,193,270,334,335,420],[82,118,173,190,191,193,221,417,420],[82,118,173,190,191,193,334,417,420],[82,105,111,118,173,184,190,191,193,255,270,334,344,345,399,402,420],[82,118,173,190,191,193,270,399,400,420],[82,115,118,173,190,191,193,270,334,398,399,400,420],[82,105,109,115,118,173,190,191,193,270,334,400,402,420],[82,105,115,118,173,190,191,193,270,334,343,399,402,406,409,410,420],[82,109,115,118,173,184,190,191,193,245,270,292,293,334,343,397,398,420],[82,88,115,118,173,178,190,191,193,270,399,400,402,420],[82,105,118,173,190,191,193,270,271,272,402,420],[82,105,115,118,173,190,191,193,270,334,341,342,343,420],[82,83,105,115,118,173,185,190,191,193,195,216,270,272,274,334,341,398,399,400,402,406,407,410,412,413,420],[82,100,101,102,103,104,118,173,190,191,193,420],[82,105,115,118,173,190,191,193,270,334,345,413,415,420],[82,98,106,118,173,190,191,193,420],[82,84,85,86,89,118,173,190,191,193,420],[82,102,118,173,190,191,193,420],[82,109,118,173,184,190,191,193,420],[82,115,118,173,190,191,193,248,420],[82,84,86,89,90,94,95,97,107,108,109,110,118,173,190,191,193,246,247,248,249,250,251,252,253,254,256,257,258,259,260,261,262,263,264,265,266,267,268,269,420],[82,92,93,94,118,173,190,191,193,420],[82,115,118,173,190,191,193,420],[82,105,118,173,190,191,193,247,420],[82,86,92,93,94,95,96,118,173,190,191,193,420],[82,104,110,118,173,190,191,193,247,256,420],[82,95,100,118,173,190,191,193,420],[82,92,118,173,190,191,193,420],[82,90,107,118,173,190,191,193,246,247,420],[82,118,173,190,191,193,205,420],[82,88,118,173,190,191,193,420],[82,118,173,190,191,193,265,420],[82,97,115,118,173,190,191,193,420],[82,118,173,174,190,191,193,221,420],[82,110,111,118,173,190,191,193,248,255,420],[82,105,118,173,190,191,193,420],[82,85,107,118,173,190,191,193,247,248,253,260,267,420],[82,118,173,190,191,193,346,347,348,349,350,351,352,353,354,355,356,357,358,359,360,361,362,363,364,365,366,367,368,369,370,371,372,373,374,375,376,377,378,379,380,381,382,383,384,385,386,387,388,389,390,391,392,393,394,395,396,420],[82,97,118,173,190,191,193,420],[82,85,91,92,93,96,98,106,111,112,113,114,118,173,190,191,193,420],[82,95,118,173,190,191,193,420],[82,90,91,118,173,190,191,193,420],[82,112,118,173,190,191,193,420],[118,173,190,191,193],[82,118,173,190,191,193,402,420],[82,89,118,173,190,191,193,420],[82,118,173,190,191,193,270,344,420],[82,105,115,118,173,178,184,190,191,193,245,270,274,292,293,333,420]],"fileInfos":[{"version":"c430d44666289dae81f30fa7b2edebf186ecc91a2d4c71266ea6ae76388792e1","affectsGlobalScope":true,"impliedFormat":1},{"version":"45b7ab580deca34ae9729e97c13cfd999df04416a79116c3bfb483804f85ded4","impliedFormat":1},{"version":"3facaf05f0c5fc569c5649dd359892c98a85557e3e0c847964caeb67076f4d75","impliedFormat":1},{"version":"e44bb8bbac7f10ecc786703fe0a6a4b952189f908707980ba8f3c8975a760962","impliedFormat":1},{"version":"5e1c4c362065a6b95ff952c0eab010f04dcd2c3494e813b493ecfd4fcb9fc0d8","impliedFormat":1},{"version":"68d73b4a11549f9c0b7d352d10e91e5dca8faa3322bfb77b661839c42b1ddec7","impliedFormat":1},{"version":"5efce4fc3c29ea84e8928f97adec086e3dc876365e0982cc8479a07954a3efd4","impliedFormat":1},{"version":"feecb1be483ed332fad555aff858affd90a48ab19ba7272ee084704eb7167569","impliedFormat":1},{"version":"ee7bad0c15b58988daa84371e0b89d313b762ab83cb5b31b8a2d1162e8eb41c2","impliedFormat":1},{"version":"27bdc30a0e32783366a5abeda841bc22757c1797de8681bbe81fbc735eeb1c10","impliedFormat":1},{"version":"8fd575e12870e9944c7e1d62e1f5a73fcf23dd8d3a321f2a2c74c20d022283fe","impliedFormat":1},{"version":"2ab096661c711e4a81cc464fa1e6feb929a54f5340b46b0a07ac6bbf857471f0","impliedFormat":1},{"version":"080941d9f9ff9307f7e27a83bcd888b7c8270716c39af943532438932ec1d0b9","affectsGlobalScope":true,"impliedFormat":1},{"version":"c57796738e7f83dbc4b8e65132f11a377649c00dd3eee333f672b8f0a6bea671","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc2df20b1bcdc8c2d34af4926e2c3ab15ffe1160a63e58b7e09833f616efff44","affectsGlobalScope":true,"impliedFormat":1},{"version":"515d0b7b9bea2e31ea4ec968e9edd2c39d3eebf4a2d5cbd04e88639819ae3b71","affectsGlobalScope":true,"impliedFormat":1},{"version":"0559b1f683ac7505ae451f9a96ce4c3c92bdc71411651ca6ddb0e88baaaad6a3","affectsGlobalScope":true,"impliedFormat":1},{"version":"0dc1e7ceda9b8b9b455c3a2d67b0412feab00bd2f66656cd8850e8831b08b537","affectsGlobalScope":true,"impliedFormat":1},{"version":"ce691fb9e5c64efb9547083e4a34091bcbe5bdb41027e310ebba8f7d96a98671","affectsGlobalScope":true,"impliedFormat":1},{"version":"8d697a2a929a5fcb38b7a65594020fcef05ec1630804a33748829c5ff53640d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ff2a353abf8a80ee399af572debb8faab2d33ad38c4b4474cff7f26e7653b8d","affectsGlobalScope":true,"impliedFormat":1},{"version":"fb0f136d372979348d59b3f5020b4cdb81b5504192b1cacff5d1fbba29378aa1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d15bea3d62cbbdb9797079416b8ac375ae99162a7fba5de2c6c505446486ac0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"68d18b664c9d32a7336a70235958b8997ebc1c3b8505f4f1ae2b7e7753b87618","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb3d66c8327153d8fa7dd03f9c58d351107fe824c79e9b56b462935176cdf12a","affectsGlobalScope":true,"impliedFormat":1},{"version":"38f0219c9e23c915ef9790ab1d680440d95419ad264816fa15009a8851e79119","affectsGlobalScope":true,"impliedFormat":1},{"version":"69ab18c3b76cd9b1be3d188eaf8bba06112ebbe2f47f6c322b5105a6fbc45a2e","affectsGlobalScope":true,"impliedFormat":1},{"version":"a680117f487a4d2f30ea46f1b4b7f58bef1480456e18ba53ee85c2746eeca012","affectsGlobalScope":true,"impliedFormat":1},{"version":"2f11ff796926e0832f9ae148008138ad583bd181899ab7dd768a2666700b1893","affectsGlobalScope":true,"impliedFormat":1},{"version":"4de680d5bb41c17f7f68e0419412ca23c98d5749dcaaea1896172f06435891fc","affectsGlobalScope":true,"impliedFormat":1},{"version":"954296b30da6d508a104a3a0b5d96b76495c709785c1d11610908e63481ee667","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac9538681b19688c8eae65811b329d3744af679e0bdfa5d842d0e32524c73e1c","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a969edff4bd52585473d24995c5ef223f6652d6ef46193309b3921d65dd4376","affectsGlobalScope":true,"impliedFormat":1},{"version":"9e9fbd7030c440b33d021da145d3232984c8bb7916f277e8ffd3dc2e3eae2bdb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811ec78f7fefcabbda4bfa93b3eb67d9ae166ef95f9bff989d964061cbf81a0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"717937616a17072082152a2ef351cb51f98802fb4b2fdabd32399843875974ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"d7e7d9b7b50e5f22c915b525acc5a49a7a6584cf8f62d0569e557c5cfc4b2ac2","affectsGlobalScope":true,"impliedFormat":1},{"version":"71c37f4c9543f31dfced6c7840e068c5a5aacb7b89111a4364b1d5276b852557","affectsGlobalScope":true,"impliedFormat":1},{"version":"576711e016cf4f1804676043e6a0a5414252560eb57de9faceee34d79798c850","affectsGlobalScope":true,"impliedFormat":1},{"version":"89c1b1281ba7b8a96efc676b11b264de7a8374c5ea1e6617f11880a13fc56dc6","affectsGlobalScope":true,"impliedFormat":1},{"version":"74f7fa2d027d5b33eb0471c8e82a6c87216223181ec31247c357a3e8e2fddc5b","affectsGlobalScope":true,"impliedFormat":1},{"version":"d6d7ae4d1f1f3772e2a3cde568ed08991a8ae34a080ff1151af28b7f798e22ca","affectsGlobalScope":true,"impliedFormat":1},{"version":"063600664504610fe3e99b717a1223f8b1900087fab0b4cad1496a114744f8df","affectsGlobalScope":true,"impliedFormat":1},{"version":"934019d7e3c81950f9a8426d093458b65d5aff2c7c1511233c0fd5b941e608ab","affectsGlobalScope":true,"impliedFormat":1},{"version":"52ada8e0b6e0482b728070b7639ee42e83a9b1c22d205992756fe020fd9f4a47","affectsGlobalScope":true,"impliedFormat":1},{"version":"3bdefe1bfd4d6dee0e26f928f93ccc128f1b64d5d501ff4a8cf3c6371200e5e6","affectsGlobalScope":true,"impliedFormat":1},{"version":"59fb2c069260b4ba00b5643b907ef5d5341b167e7d1dbf58dfd895658bda2867","affectsGlobalScope":true,"impliedFormat":1},{"version":"639e512c0dfc3fad96a84caad71b8834d66329a1f28dc95e3946c9b58176c73a","affectsGlobalScope":true,"impliedFormat":1},{"version":"368af93f74c9c932edd84c58883e736c9e3d53cec1fe24c0b0ff451f529ceab1","affectsGlobalScope":true,"impliedFormat":1},{"version":"af3dd424cf267428f30ccfc376f47a2c0114546b55c44d8c0f1d57d841e28d74","affectsGlobalScope":true,"impliedFormat":1},{"version":"995c005ab91a498455ea8dfb63aa9f83fa2ea793c3d8aa344be4a1678d06d399","affectsGlobalScope":true,"impliedFormat":1},{"version":"959d36cddf5e7d572a65045b876f2956c973a586da58e5d26cde519184fd9b8a","affectsGlobalScope":true,"impliedFormat":1},{"version":"965f36eae237dd74e6cca203a43e9ca801ce38824ead814728a2807b1910117d","affectsGlobalScope":true,"impliedFormat":1},{"version":"3925a6c820dcb1a06506c90b1577db1fdbf7705d65b62b99dce4be75c637e26b","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a3d63ef2b853447ec4f749d3f368ce642264246e02911fcb1590d8c161b8005","affectsGlobalScope":true,"impliedFormat":1},{"version":"8cdf8847677ac7d20486e54dd3fcf09eda95812ac8ace44b4418da1bbbab6eb8","affectsGlobalScope":true,"impliedFormat":1},{"version":"8444af78980e3b20b49324f4a16ba35024fef3ee069a0eb67616ea6ca821c47a","affectsGlobalScope":true,"impliedFormat":1},{"version":"3287d9d085fbd618c3971944b65b4be57859f5415f495b33a6adc994edd2f004","affectsGlobalScope":true,"impliedFormat":1},{"version":"b4b67b1a91182421f5df999988c690f14d813b9850b40acd06ed44691f6727ad","affectsGlobalScope":true,"impliedFormat":1},{"version":"df83c2a6c73228b625b0beb6669c7ee2a09c914637e2d35170723ad49c0f5cd4","affectsGlobalScope":true,"impliedFormat":1},{"version":"436aaf437562f276ec2ddbee2f2cdedac7664c1e4c1d2c36839ddd582eeb3d0a","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e3c06ea092138bf9fa5e874a1fdbc9d54805d074bee1de31b99a11e2fec239d","affectsGlobalScope":true,"impliedFormat":1},{"version":"87dc0f382502f5bbce5129bdc0aea21e19a3abbc19259e0b43ae038a9fc4e326","affectsGlobalScope":true,"impliedFormat":1},{"version":"b1cb28af0c891c8c96b2d6b7be76bd394fddcfdb4709a20ba05a7c1605eea0f9","affectsGlobalScope":true,"impliedFormat":1},{"version":"2fef54945a13095fdb9b84f705f2b5994597640c46afeb2ce78352fab4cb3279","affectsGlobalScope":true,"impliedFormat":1},{"version":"ac77cb3e8c6d3565793eb90a8373ee8033146315a3dbead3bde8db5eaf5e5ec6","affectsGlobalScope":true,"impliedFormat":1},{"version":"56e4ed5aab5f5920980066a9409bfaf53e6d21d3f8d020c17e4de584d29600ad","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ece9f17b3866cc077099c73f4983bddbcb1dc7ddb943227f1ec070f529dedd1","affectsGlobalScope":true,"impliedFormat":1},{"version":"0a6282c8827e4b9a95f4bf4f5c205673ada31b982f50572d27103df8ceb8013c","affectsGlobalScope":true,"impliedFormat":1},{"version":"1c9319a09485199c1f7b0498f2988d6d2249793ef67edda49d1e584746be9032","affectsGlobalScope":true,"impliedFormat":1},{"version":"e3a2a0cee0f03ffdde24d89660eba2685bfbdeae955a6c67e8c4c9fd28928eeb","affectsGlobalScope":true,"impliedFormat":1},{"version":"811c71eee4aa0ac5f7adf713323a5c41b0cf6c4e17367a34fbce379e12bbf0a4","affectsGlobalScope":true,"impliedFormat":1},{"version":"51ad4c928303041605b4d7ae32e0c1ee387d43a24cd6f1ebf4a2699e1076d4fa","affectsGlobalScope":true,"impliedFormat":1},{"version":"60037901da1a425516449b9a20073aa03386cce92f7a1fd902d7602be3a7c2e9","affectsGlobalScope":true,"impliedFormat":1},{"version":"d4b1d2c51d058fc21ec2629fff7a76249dec2e36e12960ea056e3ef89174080f","affectsGlobalScope":true,"impliedFormat":1},{"version":"22adec94ef7047a6c9d1af3cb96be87a335908bf9ef386ae9fd50eeb37f44c47","affectsGlobalScope":true,"impliedFormat":1},{"version":"196cb558a13d4533a5163286f30b0509ce0210e4b316c56c38d4c0fd2fb38405","affectsGlobalScope":true,"impliedFormat":1},{"version":"73f78680d4c08509933daf80947902f6ff41b6230f94dd002ae372620adb0f60","affectsGlobalScope":true,"impliedFormat":1},{"version":"c5239f5c01bcfa9cd32f37c496cf19c61d69d37e48be9de612b541aac915805b","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e7f8264d0fb4c5339605a15daadb037bf238c10b654bb3eee14208f860a32ea","affectsGlobalScope":true,"impliedFormat":1},{"version":"782dec38049b92d4e85c1585fbea5474a219c6984a35b004963b00beb1aab538","affectsGlobalScope":true,"impliedFormat":1},{"version":"a6a5253138c5432c68a1510c70fe78a644fe2e632111ba778e1978010d6edfec","impliedFormat":1},{"version":"a41fc7f4704765806bfa20f0acd3c8ac57af34638fe6148a515fca8a05be073c","signature":"663266b8782a8b327a5196efa1b3627805e3e4fc712d6a4380f5e6571e45a813"},{"version":"6ef6cf8f028d21b89738f36438cee654b5630a87c76be151fdad6c27f9ccff85","signature":"5aa42b32993e161aaf93d992300494377d38c8883e15fde44d5c7949313058af"},{"version":"0be20bd89cca16c8c18e6af0ba7231fb21df0dca5b1c67bb5f9f52408e465296","signature":"b75dd83280bdfd4880c04cadd7f5edf6b23305850e436b1e5b92c3847090d031"},{"version":"63cdc0b726eaa947772cc97fb0e3bb501b940c036f386a936ce0ed6aaeec7ca7","signature":"eae784573a5c4c55c65b86accb356b21b5f597c3484c1bd344e647bc92ebe572"},{"version":"827eb54656695635a6e25543f711f0fe86d1083e5e1c0e84f394ffc122bd3ad7","impliedFormat":1},{"version":"2309cee540edc190aa607149b673b437cb8807f4e8d921bf7f5a50e6aa8d609c","impliedFormat":1},{"version":"2616fbd4b71fd263c5625dafefa6fec836071914837003c8faa07d33c46dea89","signature":"901de16fbacf42f8cbe7fb2e3dc7d33cd91548a54459438fdface0b30a6a29cd"},{"version":"39c48f007bea01f604f50ac8cf438c48424b13e5cdd187549aff1385ca473a25","signature":"c4a8a08d13b2aba4fb5e798f7d2d5691192d4383cf7c0686845d80a167fc5f42"},{"version":"bb22651f9f46d8b8f0e0415243643415886ff0ca4a59c0b21b7a581d261a8dca","signature":"243248596db650ce6f8907cbb3a8076a5ab6888a39c37debc11a81c2f9f9d247"},{"version":"b193dc5805aede1a621e2c130607a4f172563ee4bf11da61e2e4e3df59cc2fba","signature":"1460f16c4b7fc66d2dde3ce1a4ab97d480c27fb84a4e429355a21e76cd471e19"},"c5d73bf762b7b0e75fcdf691e21e31c9db9913931b200b9990f07f49ab2edff3",{"version":"91122c81bb86f3472740b47d5fb2ec4010f8abb682abf6e1a053342a0ec609df","signature":"de38157a9f1be75a02ea8358be48a4d50ba31785fedd6a4f9ce7387d77ac9a22"},{"version":"0acaee6de37286ef7ee7d4e51dcb01ca872c4f6b7392d55495e6b470d1f7bbba","signature":"76a5f88a99d386a1ea9209a9f8f33a3f2c2f17bc445a4078950a49c0624bae3d"},{"version":"42d324cacb819773415a5077b81e093c3000c91ae47b31e62bfff04604d79842","signature":"65357b3849688962f59c625718650ad31ff59e6c23f244b4086f0d96558405d6"},{"version":"36e761faa09e1c765dc929eb608b318dc959e67c26764cd37a85c7869a5f3ba3","signature":"3f2fed2d0130ee5356cc1cb8782d7c974d37eccce4f1de871f7744ce61463eb4"},{"version":"ccc6fd2d44c269c7d5b99aff0ed973114c3434334589da7f1e3127db9abe28f4","signature":"471486ab7c5c95c3df63c0fbebe6871b9535eedff8b582557dfd66fcbf946d5b"},{"version":"83fbac197e7b42f905b0833c7a74ca4359a8a98cabbe4dbfe2a2f175a05af849","signature":"45e82f28a80d855bab2355d5e46cc8edd7f2679fc5bfb0905dcf01ce59a5c347"},{"version":"566bb653cd3aad2d59b0c4e9d2c8aa41bfe297377c425d0098e94e745c16fe36","signature":"b8a122e51c2ee902b44d86ff806011d216af54be75844a4d3c366d80776a4d33"},{"version":"977fa2f1d8cea69406720a82e1ac191e8421ccfc768175cdb0f7ac47d3282cf2","signature":"0850c98ca2cccae6ce2aad363f6eb370c401fbc279a64607fff90c0f87973a91"},{"version":"98f6a7588acfcf281dcaa9cc50ff4ea0f9e6fc5874d4cf96e3839bfc8008003e","signature":"806bed2ed4bf1c6ebb74a391531e98d361a0e23a31601fddb33dd90e31436b6d"},{"version":"20e9212218f6e8c82a25166d510f3a5c7b2d0adcba728acb469d8babad4a4f70","signature":"d0f62192ec787f1592a5b86760a44350d1c925883a573eadc12d60862890dffe"},{"version":"9d7391c5875a7ff0d24a1b4fef350faf86a569b5d66413d1efc954fb148b595c","signature":"4ef34562ac49a16a1681d51d6e8ece677657782cf1a464e010224cbbe0bb071f"},"a66ad696f2785dd00374b8dee6fab5c58c049c0efe24b3c214fbe6aec3f53d6e",{"version":"cf1dafd0562c7a211d40932255c73735fc15fbe461848ae00958af75ad92d705","signature":"48f7cd72c6f8ec5b2f70f50a8d4e6f47494e0d228015efb50c36fc6eab33c7ff"},{"version":"dbd95702afd718f8b35cb5d75b5793c744100e007a80c46806bee1859083c53b","signature":"a8aa7a344599265ef9c2aba0433a805227b2c9b0e743106fab4d6f0c6966f536"},{"version":"809920bc999ca3d69783e074e650e6a582aafe5f07cc68cc5888c2b4cb94026e","signature":"9b92a4d989efc3eeefdca5f95f10267504abc7748ecff400b533cdf54dcdbd68"},{"version":"062968f9118f55e5c8785d95c16f74c37cab1ecca590b536962f07fb75e0fe96","signature":"16e6feb2ea29757a0cdd16c8fe2bdf059a612a5474ea30019ae60d9fe309442a"},{"version":"b6d87975ea33867db5f18d3b0de37dff0aa3a723638129026a118cc9bda87e3d","signature":"2f45dc6e152333f5d28bb660e4543bfd41412b5af16b9a6331b7fd0b4982885e"},"ea4eadfe3d8b0447ecea1cbbf7aad70423cca9350bc9103a1d80cebc37e6bdb3",{"version":"3b7809fa9a7523a0734b16e314843f3f643afef715368d65385f8b92a5e51676","signature":"b88645280562793af76ab59052d87e4846ac5ef19af054c729fbb87c73481a59"},{"version":"e1e25f85d561bc507b0e6ddfb26bbe609e9f5320ee23a62b4d456805e34df098","signature":"a1f43b06dd37b1f6c5c7821881960dfe55038b468eafb324ad90ce5e9b448d2a"},{"version":"6507c9036037259dbcfe27e50bfaf27f76185657061cc7af3123654b8aff8303","signature":"15b142d522e96e1962bd54c75560f6994cc8fe9a1640a36de2268fdb95e58fb5"},"de79263f32ea34b3f9282b19251626eeb3a3aef8d96491b731a3c0fb5cca2e77",{"version":"d153a11543fd884b596587ccd97aebbeed950b26933ee000f94009f1ab142848","affectsGlobalScope":true,"impliedFormat":1},{"version":"378281aa35786c27d5811af7e6bcaa492eebd0c7013d48137c35bbc69a2b9751","affectsGlobalScope":true,"impliedFormat":1},{"version":"3af97acf03cc97de58a3a4bc91f8f616408099bc4233f6d0852e72a8ffb91ac9","affectsGlobalScope":true,"impliedFormat":1},{"version":"1b2dd1cbeb0cc6ae20795958ba5950395ebb2849b7c8326853dd15530c77ab0c","affectsGlobalScope":true,"impliedFormat":1},{"version":"1db0b7dca579049ca4193d034d835f6bfe73096c73663e5ef9a0b5779939f3d0","affectsGlobalScope":true,"impliedFormat":1},{"version":"387a023d363f755eb63450a66c28b14cdd7bc30a104565e2dbf0a8988bb4a56c","affectsGlobalScope":true,"impliedFormat":1},{"version":"9798340ffb0d067d69b1ae5b32faa17ab31b82466a3fc00d8f2f2df0c8554aaa","affectsGlobalScope":true,"impliedFormat":1},{"version":"f26b11d8d8e4b8028f1c7d618b22274c892e4b0ef5b3678a8ccbad85419aef43","affectsGlobalScope":true,"impliedFormat":1},{"version":"8e9c23ba78aabc2e0a27033f18737a6df754067731e69dc5f52823957d60a4b6","impliedFormat":1},{"version":"cdcf9ea426ad970f96ac930cd176d5c69c6c24eebd9fc580e1572d6c6a88f62c","impliedFormat":1},{"version":"23cd712e2ce083d68afe69224587438e5914b457b8acf87073c22494d706a3d0","impliedFormat":1},{"version":"487b694c3de27ddf4ad107d4007ad304d29effccf9800c8ae23c2093638d906a","impliedFormat":1},{"version":"3a80bc85f38526ca3b08007ee80712e7bb0601df178b23fbf0bf87036fce40ce","impliedFormat":1},{"version":"ccf4552357ce3c159ef75f0f0114e80401702228f1898bdc9402214c9499e8c0","impliedFormat":1},{"version":"c6fd2c5a395f2432786c9cb8deb870b9b0e8ff7e22c029954fabdd692bff6195","impliedFormat":1},{"version":"68834d631c8838c715f225509cfc3927913b9cc7a4870460b5b60c8dbdb99baf","impliedFormat":1},{"version":"2931540c47ee0ff8a62860e61782eb17b155615db61e36986e54645ec67f67c2","impliedFormat":1},{"version":"ccab02f3920fc75c01174c47fcf67882a11daf16baf9e81701d0a94636e94556","impliedFormat":1},{"version":"f6faf5f74e4c4cc309a6c6a6c4da02dbb840be5d3e92905a23dcd7b2b0bd1986","impliedFormat":1},{"version":"ea6bc8de8b59f90a7a3960005fd01988f98fd0784e14bc6922dde2e93305ec7d","impliedFormat":1},{"version":"36107995674b29284a115e21a0618c4c2751b32a8766dd4cb3ba740308b16d59","impliedFormat":1},{"version":"914a0ae30d96d71915fc519ccb4efbf2b62c0ddfb3a3fc6129151076bc01dc60","impliedFormat":1},{"version":"33e981bf6376e939f99bd7f89abec757c64897d33c005036b9a10d9587d80187","impliedFormat":1},{"version":"7fd1b31fd35876b0aa650811c25ec2c97a3c6387e5473eb18004bed86cdd76b6","impliedFormat":1},{"version":"b41767d372275c154c7ea6c9d5449d9a741b8ce080f640155cc88ba1763e35b3","impliedFormat":1},{"version":"3bacf516d686d08682751a3bd2519ea3b8041a164bfb4f1d35728993e70a2426","impliedFormat":1},{"version":"7fb266686238369442bd1719bc0d7edd0199da4fb8540354e1ff7f16669b4323","impliedFormat":1},{"version":"0a60a292b89ca7218b8616f78e5bbd1c96b87e048849469cccb4355e98af959a","impliedFormat":1},{"version":"0b6e25234b4eec6ed96ab138d96eb70b135690d7dd01f3dd8a8ab291c35a683a","impliedFormat":1},{"version":"9666f2f84b985b62400d2e5ab0adae9ff44de9b2a34803c2c5bd3c8325b17dc0","impliedFormat":1},{"version":"40cd35c95e9cf22cfa5bd84e96408b6fcbca55295f4ff822390abb11afbc3dca","impliedFormat":1},{"version":"b1616b8959bf557feb16369c6124a97a0e74ed6f49d1df73bb4b9ddf68acf3f3","impliedFormat":1},{"version":"5b03a034c72146b61573aab280f295b015b9168470f2df05f6080a2122f9b4df","impliedFormat":1},{"version":"40b463c6766ca1b689bfcc46d26b5e295954f32ad43e37ee6953c0a677e4ae2b","impliedFormat":1},{"version":"249b9cab7f5d628b71308c7d9bb0a808b50b091e640ba3ed6e2d0516f4a8d91d","impliedFormat":1},{"version":"80aae6afc67faa5ac0b32b5b8bc8cc9f7fa299cff15cf09cc2e11fd28c6ae29e","impliedFormat":1},{"version":"f473cd2288991ff3221165dcf73cd5d24da30391f87e85b3dd4d0450c787a391","impliedFormat":1},{"version":"499e5b055a5aba1e1998f7311a6c441a369831c70905cc565ceac93c28083d53","impliedFormat":1},{"version":"54c3e2371e3d016469ad959697fd257e5621e16296fa67082c2575d0bf8eced0","impliedFormat":1},{"version":"beb8233b2c220cfa0feea31fbe9218d89fa02faa81ef744be8dce5acb89bb1fd","impliedFormat":1},{"version":"c183b931b68ad184bc8e8372bf663f3d33304772fb482f29fb91b3c391031f3e","impliedFormat":1},{"version":"5d0375ca7310efb77e3ef18d068d53784faf62705e0ad04569597ae0e755c401","impliedFormat":1},{"version":"59af37caec41ecf7b2e76059c9672a49e682c1a2aa6f9d7dc78878f53aa284d6","impliedFormat":1},{"version":"addf417b9eb3f938fddf8d81e96393a165e4be0d4a8b6402292f9c634b1cb00d","impliedFormat":1},{"version":"48cc3ec153b50985fb95153258a710782b25975b10dd4ac8a4f3920632d10790","impliedFormat":1},{"version":"adf27937dba6af9f08a68c5b1d3fce0ca7d4b960c57e6d6c844e7d1a8e53adae","impliedFormat":1},{"version":"e1528ca65ac90f6fa0e4a247eb656b4263c470bb22d9033e466463e13395e599","impliedFormat":1},{"version":"2e85db9e6fd73cfa3d7f28e0ab6b55417ea18931423bd47b409a96e4a169e8e6","impliedFormat":1},{"version":"c46e079fe54c76f95c67fb89081b3e399da2c7d109e7dca8e4b58d83e332e605","impliedFormat":1},{"version":"866078923a56d026e39243b4392e282c1c63159723996fa89243140e1388a98d","impliedFormat":1},{"version":"f724236417941ea77ec8d38c6b7021f5fb7f8521c7f8c1538e87661f2c6a0774","affectsGlobalScope":true,"impliedFormat":1},{"version":"1cf059eaf468efcc649f8cf6075d3cb98e9a35a0fe9c44419ec3d2f5428d7123","affectsGlobalScope":true,"impliedFormat":1},{"version":"e7721c4f69f93c91360c26a0a84ee885997d748237ef78ef665b153e622b36c1","affectsGlobalScope":true,"impliedFormat":1},{"version":"d97fb21da858fb18b8ae72c314e9743fd52f73ebe2764e12af1db32fc03f853f","affectsGlobalScope":true,"impliedFormat":1},{"version":"4ea15fd99b2e34cb25fe8346c955000bb70c8b423ae4377a972ef46bfb37f595","impliedFormat":1},{"version":"7cf69dd5502c41644c9e5106210b5da7144800670cbe861f66726fa209e231c4","impliedFormat":1},{"version":"72c1f5e0a28e473026074817561d1bc9647909cf253c8d56c41d1df8d95b85f7","impliedFormat":1},{"version":"f9b4137a0d285bd77dba2e6e895530112264310ae47e07bf311feae428fb8b61","affectsGlobalScope":true,"impliedFormat":1},{"version":"c06b2652ffeb89afd0f1c52c165ced77032f9cd09bc481153fbd6b5504c69494","impliedFormat":1},{"version":"51aecd2df90a3cffea1eb4696b33b2d78594ea2aa2138e6b9471ec4841c6c2ee","impliedFormat":1},{"version":"9d8f9e63e29a3396285620908e7f14d874d066caea747dc4b2c378f0599166b4","affectsGlobalScope":true,"impliedFormat":1},{"version":"5524481e56c48ff486f42926778c0a3cce1cc85dc46683b92b1271865bcf015a","impliedFormat":1},{"version":"612422d5ba6b4a5c4537f423e9199645468ad80a689801da63ab7edb43f7b835","impliedFormat":1},{"version":"db9ada976f9e52e13f7ae8b9a320f4b67b87685938c5879187d8864b2fbe97f3","impliedFormat":1},{"version":"9f39e70a354d0fba29ac3cdf6eca00b7f9e96f64b2b2780c432e8ea27f133743","impliedFormat":1},{"version":"0dace96cc0f7bc6d0ee2044921bdf19fe42d16284dbcc8ae200800d1c9579335","impliedFormat":1},{"version":"a2e2bbde231b65c53c764c12313897ffdfb6c49183dd31823ee2405f2f7b5378","impliedFormat":1},{"version":"ad1cc0ed328f3f708771272021be61ab146b32ecf2b78f3224959ff1e2cd2a5c","impliedFormat":1},{"version":"c64e1888baaa3253ca4405b455e4bf44f76357868a1bd0a52998ade9a092ad78","affectsGlobalScope":true,"impliedFormat":1},{"version":"dc8c6f5322961b56d9906601b20798725df60baeab45ec014fba9f795d5596fd","impliedFormat":1},{"version":"0904660ae854e6d41f6ff25356db1d654436c6305b0f0aa89d1532df0253486e","impliedFormat":1},{"version":"060d305fe4494d8cb2b99d620928d369d1ee55c1645f5e729a2aca07d0f108cb","impliedFormat":1},{"version":"a016b2a26863dd6acb1f18c4ff37363c2b51e27ca7b3374dc6342aff1ddead2d","impliedFormat":1},{"version":"0c50296ee73dae94efc3f0da4936b1146ca6ce2217acfabb44c19c9a33fa30e5","impliedFormat":1},{"version":"bbf42f98a5819f4f06e18c8b669a994afe9a17fe520ae3454a195e6eabf7700d","impliedFormat":1},{"version":"0e5974dfff7a97181c7c376545f126b20acf2f1341db7d3fccea4977bf3ce19c","impliedFormat":1},{"version":"c7f977ea78a1b060a30554c1c4ec0e2269c6e305a349ca2ada14931ac27ecc0b","affectsGlobalScope":true,"impliedFormat":1},{"version":"3806cdd6b48ba01a9198134e62a384ec217a98f316d4baef74dd46d62c947a63","impliedFormat":1},{"version":"ff65b8a8bd380c6d129becc35de02f7c29ad7ce03300331ca91311fb4044d1a9","impliedFormat":1},{"version":"04bf1aa481d1adfb16d93d76e44ce71c51c8ef68039d849926551199489637f6","impliedFormat":1},{"version":"2c9adcc85574b002c9a6311ff2141055769e0071856ec979d92ff989042b1f1b","affectsGlobalScope":true,"impliedFormat":1},{"version":"b8bf3fe89ec8baa335f6370b9fa36308e1bc7a72e2eb2dad1e94f31e27fa28b5","affectsGlobalScope":true,"impliedFormat":1},{"version":"a58a15da4c5ba3df60c910a043281256fa52d36a0fcdef9b9100c646282e88dd","impliedFormat":1},{"version":"b36beffbf8acdc3ebc58c8bb4b75574b31a2169869c70fc03f82895b93950a12","impliedFormat":1},{"version":"de263f0089aefbfd73c89562fb7254a7468b1f33b61839aafc3f035d60766cb4","impliedFormat":1},{"version":"77fbe5eecb6fac4b6242bbf6eebfc43e98ce5ccba8fa44e0ef6a95c945ff4d98","impliedFormat":1},{"version":"8c81fd4a110490c43d7c578e8c6f69b3af01717189196899a6a44f93daa57a3a","impliedFormat":1},{"version":"5fb39858b2459864b139950a09adae4f38dad87c25bf572ce414f10e4bd7baab","impliedFormat":1},{"version":"35390d6fa94bdb432c5d0bcb6547bdd11406c2692a6b90b9e47be2105ea19bd6","impliedFormat":1},{"version":"3910dab597c40e173bf0e0d419d3ce9682c54ebf6ae84849f9b829b1451a17ec","impliedFormat":1},{"version":"37ba7b45141a45ce6e80e66f2a96c8a5ab1bcef0fc2d0f56bb58df96ec67e972","impliedFormat":1},{"version":"45650f47bfb376c8a8ed39d4bcda5902ab899a3150029684ee4c10676d9fbaee","impliedFormat":1},{"version":"486c074a5c0f2254345c0d1c9540380f5463999e42d7e1a159305ea823d3c4b1","affectsGlobalScope":true,"impliedFormat":1},{"version":"c119835edf36415081dfd9ed15fc0cd37aaa28d232be029ad073f15f3d88c323","impliedFormat":1},{"version":"8e7c3bed5f19ade8f911677ddc83052e2283e25b0a8654cd89db9079d4b323c7","impliedFormat":1},{"version":"9705cd157ffbb91c5cab48bdd2de5a437a372e63f870f8a8472e72ff634d47c1","affectsGlobalScope":true,"impliedFormat":1},{"version":"ae86f30d5d10e4f75ce8dcb6e1bd3a12ecec3d071a21e8f462c5c85c678efb41","impliedFormat":1},{"version":"ccf3afaeebbeee4ca9092101e99fd6abd681116b6e5ec23e381bbb1e1f32262c","impliedFormat":1},{"version":"e03460fe72b259f6d25ad029f085e4bedc3f90477da4401d8fbc1efa9793230e","impliedFormat":1},{"version":"4286a3a6619514fca656089aee160bb6f2e77f4dd53dc5a96b26a0b4fc778055","impliedFormat":1},{"version":"ab7818a9d57a9297b90e456fc68b77f84d74395a9210a3cfa9d87db33aff8b14","affectsGlobalScope":true,"impliedFormat":1},{"version":"eb08062718a5470cd864c1fae0eb5b3a3adc5bcd05dcf87608d6f60b65eca3f4","affectsGlobalScope":true,"impliedFormat":1},{"version":"3a815b7d1aebc0646b91548eab2fc19dada09ff255d04c71ced00bbd3058c8eb","impliedFormat":1},{"version":"255d948f87f24ffd57bcb2fdf95792fd418a2e1f712a98cf2cce88744d75085c","impliedFormat":1},{"version":"0d5b085f36e6dc55bc6332ecb9c733be3a534958c238fb8d8d18d4a2b6f2a15a","impliedFormat":1},{"version":"836b36913830645ac3b28fe33731aac3fdb3524ee8adbb4cdab9a5c189f41943","affectsGlobalScope":true,"impliedFormat":1},{"version":"bfd3b3c21a56104693183942e221c1896ee23bcb8f8d91ab0b941f7b32985411","impliedFormat":1},{"version":"d7e9ab1b0996639047c61c1e62f85c620e4382206b3abb430d9a21fb7bc23c77","impliedFormat":1},{"version":"332680a9475bd631519399f9796c59502aa499aa6f6771734eec82fa40c6d654","impliedFormat":1},{"version":"191bee6605de2b5210f29f22df04f5b5e6bdcc1f6e21fb07091d40eeeb75fd72","impliedFormat":1},{"version":"d83f3c0362467589b3a65d3a83088c068099c665a39061bf9b477f16708fa0f9","impliedFormat":1},{"version":"180e527dbc1f5ae2bbb79d0a3db1ada49258783d7e6299559e0f2ed663b4afec","impliedFormat":1},{"version":"29994a97447d10d003957bcc0c9355c272d8cf0f97143eb1ade331676e860945","impliedFormat":1},{"version":"f4260022f7af38e533d364ea62eb7ae01b0a32050033d7f6772073e1dc908025","impliedFormat":1},{"version":"9cddf06f2bc6753a8628670a737754b5c7e93e2cfe982a300a0b43cf98a7d032","impliedFormat":1},{"version":"3f8e68bd94e82fe4362553aa03030fcf94c381716ce3599d242535b0d9953e49","impliedFormat":1},{"version":"63e628515ec7017458620e1624c594c9bd76382f606890c8eebf2532bcab3b7c","impliedFormat":1},{"version":"355d5e2ba58012bc059e347a70aa8b72d18d82f0c3491e9660adaf852648f032","impliedFormat":1},{"version":"311cc121259b3e0c3c08304fc25b525aa02ba0f9bf55b3e7c60b0dbb7422014e","impliedFormat":1},{"version":"74c269b43d39e5ece20b2cca49c14e64c05b01e46407200d7558301d0fcaabf4","impliedFormat":1},{"version":"ec09bd95866efe38cd00ebb79dfa7a26563d600fa4a30db0f7c6d68f8f6d2b06","impliedFormat":1},{"version":"482d0ac70d56aa79941be30da6df28e926a007f835eed70cf7b5f3135368d1f6","impliedFormat":1},{"version":"7dd19397d5a090c9f8cd762bae67bd0ad6f782abe422594fb71168fb578673b0","impliedFormat":1},{"version":"84cbf6204ada0ee2f80493e55e45befa079954788718efd6dcc103183104e3c0","impliedFormat":1},{"version":"ed849d616865076f44a41c87f27698f7cdf230290c44bafc71d7c2bc6919b202","impliedFormat":1},{"version":"9a0a0af04065ddfecc29d2b090659fce57f46f64c7a04a9ba63835ef2b2d0efa","impliedFormat":1},{"version":"10297d22a9209a718b9883a384db19249b206a0897e95f2b9afeed3144601cb0","impliedFormat":1},{"version":"034b8b5912823744c986986f24432bf3fa7bfa671e69316b672f3f2db5166ce4","impliedFormat":1},{"version":"34d206f6ba993e601dade2791944bdf742ab0f7a8caccc661106c87438f4f904","impliedFormat":1},{"version":"05ca49cc7ba9111f6c816ecfadb9305fffeb579840961ee8286cc89749f06ebd","impliedFormat":1},{"version":"18d5c81f25ae9be5baa2ecb340668ecb56fa14460fc471c52500ccc5b2e24e32","signature":"14bad5bea17b4e0f2495b5dac89a936e139338e2c87716bffd3c281ae7a9fec6"},{"version":"ed4c414e4781c12c1d680119905b6391bfe3287a1cf26ea2cf533220dddac510","signature":"f226f29f5594bd479f27648f42423ffa1a1460cafc7b1ba04bd013b28cba710f"},{"version":"6179a7b83ef2b6e7ffc2747ba324d56355659d51ea5773a7c25c89e3e8ea1849","signature":"63f859a315e9711f383d06b7a2b940804e51078d85e896980816f46f1b6021a8"},{"version":"d4168568cd8ce2b8a4e362611fc82b6ac1758f74e79ea100e82039d9d550f0ec","signature":"f8da2a3bec435c09f9a10d9f150949bf0ebb0c3508f074887dbb2d3e33ce302b"},{"version":"04ec120196f2b788653193889370c58343c179f499967e1908cbc407b87d68d7","signature":"397b46c6a95826d26714b5481addc606de72d8229b092e236f0d78a9e7226d29"},{"version":"62210fd56b12ec7b2ddc5a2ebe56abcf2b1fb05c0c4f51d9aeffd994a85d5f1d","signature":"5f47fb5b000c03fdcae71e6e017261898a37f0892532cb713ce95c8950462d80"},{"version":"f7998261fd81a556bafae297c82a31bae1af46d293de755af038c01e3007dcf6","signature":"8142d5eaa44b4dbb68dbe87b5f05b148c5a74a6fa7abd3cb3aa80a7ed4a05150"},{"version":"025fdbf28ecb823e5191eb9993b8b5179e53fbf22b17765355ba7114bf29acaa","signature":"6c66369276512eac5b53eaca735d7472b5ffca417977c3976a66b84059f2af2b"},{"version":"18b6211f0de3042f984758a9d4c719736c23354e92ff869cae1d2681c9104ad0","signature":"225deff02f4d1c91e2d6c71dec9f18feae510aa729a9774024f30278f4c6b8fe"},{"version":"12a98121bca01d5fd4cf6d67048878b1bffe5d38fb195c85e74a51cf2cf70822","signature":"6c24f6dcbb3bf8235bf8da995a7290ffbd9d557a760cf2deb380ce91a989b765"},{"version":"220b9396b64d8cff5bb88db5bafdb41dcff9f40c064cfed3652d847a6b08b365","signature":"e48415a5a97a5e6c22cc4fdcb3172805ce68a1d41d0a056d71bff9ced2186d43"},{"version":"5a36a348fefad1e719c190a600f5716c3cb93eb5a5077dd27692e4dfb09ff5b3","signature":"adec507ee458a691b72254991a7903a10c052019d8cdc7ffe359d9f373e7401f"},{"version":"77157a714f4008941d3f84856a84a04c4b8e53cb7062dc7592abe160c1eaf0ef","signature":"9b74326515d17f03809cfbea6de789772ff7d0c759a08a59bfa5242bda98d35b"},{"version":"7e17eae5baab498513ab454b75ae0df07b27666df008dc50b79d31be84d22100","signature":"09788d0d992a6d2471f35019ab68b39105c44ebf17f2051cf3e228a39e91885a"},{"version":"0ad9cf7f2e2189c474f272c7e8560d27abd2490c7a5bd8c04fd532b9b2dd166a","signature":"0ea47413eaffe144782a44058205c31130b382dee0e2f66b62b5188eac57039e"},{"version":"51ae708e531826c9dfbebc488e6f72a3be31d4a86ad652fc0e5042273e0936c6","signature":"c0591738dbfe11a36959f16ab40bc98b2a430c4565770ef6257574546079d791"},{"version":"5dcf56b534a8bb475bae0453e959f9d40162f56c4527b5c9ac4901daa5036bca","signature":"3cf3dc0f53d71795cd7c461346e9aa3c713f8a5138015776aa6d4b8ff9e0cb26"},{"version":"7beada3828cd93039812cd0c8978d97426f4029d3e475fdcf6fceb841cdae0c2","signature":"ca73451ec7771379b6b1271dcda0d0b2146da80b329136a09ad692529a073965"},{"version":"61f8dd81e6f0a57662ddfc907ca205240b85ecd047a63cb000ba9c5a76dcff36","signature":"fad74233657c4e0346822942ac3716a20b16fb053ca00c1260a08a81cc76df89"},{"version":"bf81e0f19182be474f132d0fd66ca46238ca040e388621a82f3139a1bad0a7db","signature":"43f0a7dead8b25e1c101a060ea31d6df548a9303c58aa7498d0285fd4ecaac1c"},{"version":"2973b28649d29f20ebfb0ac7e5a7d8044a4e3eaf080653b8d0ba9524a84bf1c9","signature":"fced7c59acecb0ac631505fcbc5a1ce0c6420e2494a256321e9359093efb7a1f"},{"version":"07cb8ea313859ec39e37872b9ecd1f3826a0ef081b43f2b0a9b23d3a156ffa9a","signature":"8c42fbcae55a41f9c48f644ff9743fab827a9d38f5a6bd486f17c6460f8a099b"},{"version":"3d5868008597d21f68cf7b6ab6f99550c1735b2525c5b091a8df543d7194e976","signature":"793c2b5a225ca7569320b2f9f3a43cc20a08e83fbd6587f5c24c7a05feaee6d0"},{"version":"f2fae972cc358dfb228d58b15b57a6eef77045209794d6c8a964da9e9809e18b","signature":"cf841c4bfb05b4b1d3826773ff77a47bb0dc17c665a4dbff7d6c4a6d9042d50c"},"597b9bd9363840016d7e8c6839cccd22f85079484bae7e444e80cf24645529af",{"version":"f45ffd8db490369cc7a991ce346f9534050ac8095ae9af49318385c53915a8d8","signature":"bd15222c3f016a97d7062a0018f7fe0d130be508ca276b43dcafa8c9032a3ea4"},{"version":"e2d67d003bab544d97b441f9dedc46726bd2506f501b08ab083429933d31e325","signature":"4f5f11b73282262904f4c1bc5ffb76631b40ac8b54ae01bde274cb9242d6cb2f"},{"version":"0e6387b87925a10ba52cd0de685a4f7e2d9dd402dbac560dce8934e8e34007d0","impliedFormat":1},{"version":"75977e8522e9d2dc4a9487830eb4be61a522637c33fdb1619c1155402198848a","signature":"77515d8e0ceb4f4bae7d0c9aafe9fd764a5f25601569ecbac3240cacfe136f14"},{"version":"380b919bfa0516118edaf25b99e45f855e7bc3fd75ce4163a1cfe4a666388804","impliedFormat":1},{"version":"40de86ced5175a6ffe84a52abe6ac59ac0efbc604a5975a8c6476c3ddc682ff1","impliedFormat":1},{"version":"fcf79300e5257a23ed3bacaa6861d7c645139c6f7ece134d15e6669447e5e6db","impliedFormat":1},{"version":"187119ff4f9553676a884e296089e131e8cc01691c546273b1d0089c3533ce42","impliedFormat":1},{"version":"aa2c18a1b5a086bbcaae10a4efba409cc95ba7287d8cf8f2591b53704fea3dea","impliedFormat":1},{"version":"5a0b15210129310cee9fa6af9200714bb4b12af4a04d890e15f34dbea1cf1852","impliedFormat":1},{"version":"0244119dbcbcf34faf3ffdae72dab1e9bc2bc9efc3c477b2240ffa94af3bca56","impliedFormat":1},{"version":"00baffbe8a2f2e4875367479489b5d43b5fc1429ecb4a4cc98cfc3009095f52a","impliedFormat":1},{"version":"a873c50d3e47c21aa09fbe1e2023d9a44efb07cc0cb8c72f418bf301b0771fd3","impliedFormat":1},{"version":"7c14ccd2eaa82619fffc1bfa877eb68a012e9fb723d07ee98db451fadb618906","impliedFormat":1},{"version":"49c36529ee09ea9ce19525af5bb84985ea8e782cb7ee8c493d9e36d027a3d019","impliedFormat":1},{"version":"df996e25faa505f85aeb294d15ebe61b399cf1d1e49959cdfaf2cc0815c203f9","impliedFormat":1},{"version":"4f6a12044ee6f458db11964153830abbc499e73d065c51c329ec97407f4b13dd","impliedFormat":1},{"version":"3bb333e76b1dcd71659141edf96729b29f44e097758a8c52e13cf1bf598b796e","impliedFormat":1},{"version":"13acd4da80b02df72a792435b3b214dac8512efbc23ad5b9254ffb75171ae2c4","impliedFormat":1},{"version":"6565567ac1892fc1e2734a943bcc64611cfcb3cb30afd3c4ceced5a4f54c1d5e","impliedFormat":1},{"version":"cc28c612c491edf3d36e7fb6c08edea08af6f9574721c7b57fd4a4aed09c60e5","impliedFormat":1},{"version":"c46dbc4af1d024550c4b2234397e45f263c9fe71d0867bfd27e4833b1dd21d0c","impliedFormat":1},{"version":"4a57d7a83ba8670a30f7cafbecd8594c6ed953011991da16b5d08def4bcef0b6","signature":"3f8f36996bff2e0d4f6bb2b11e1a684489b511032473180f44d0b23f38a53800"},{"version":"ce6a3f09b8db73a7e9701aca91a04b4fabaf77436dd35b24482f9ee816016b17","impliedFormat":1},{"version":"20e086e5b64fdd52396de67761cc0e94693494deadb731264aac122adf08de3f","impliedFormat":1},{"version":"6e78f75403b3ec65efb41c70d392aeda94360f11cedc9fb2c039c9ea23b30962","impliedFormat":1},{"version":"c863198dae89420f3c552b5a03da6ed6d0acfa3807a64772b895db624b0de707","impliedFormat":1},{"version":"8b03a5e327d7db67112ebbc93b4f744133eda2c1743dbb0a990c61a8007823ef","impliedFormat":1},{"version":"42fad1f540271e35ca37cecda12c4ce2eef27f0f5cf0f8dd761d723c744d3159","impliedFormat":1},{"version":"ff3743a5de32bee10906aff63d1de726f6a7fd6ee2da4b8229054dfa69de2c34","impliedFormat":1},{"version":"83acd370f7f84f203e71ebba33ba61b7f1291ca027d7f9a662c6307d74e4ac22","impliedFormat":1},{"version":"1445cec898f90bdd18b2949b9590b3c012f5b7e1804e6e329fb0fe053946d5ec","impliedFormat":1},{"version":"0e5318ec2275d8da858b541920d9306650ae6ac8012f0e872fe66eb50321a669","impliedFormat":1},{"version":"cf530297c3fb3a92ec9591dd4fa229d58b5981e45fe6702a0bd2bea53a5e59be","impliedFormat":1},{"version":"c1f6f7d08d42148ddfe164d36d7aba91f467dbcb3caa715966ff95f55048b3a4","impliedFormat":1},{"version":"eefd2bbc8edb14c3bd1246794e5c070a80f9b8f3730bd42efb80df3cc50b9039","impliedFormat":1},{"version":"0c1ee27b8f6a00097c2d6d91a21ee4d096ab52c1e28350f6362542b55380059a","impliedFormat":1},{"version":"7677d5b0db9e020d3017720f853ba18f415219fb3a9597343b1b1012cfd699f7","impliedFormat":1},{"version":"bc1c6bc119c1784b1a2be6d9c47addec0d83ef0d52c8fbe1f14a51b4dfffc675","impliedFormat":1},{"version":"52cf2ce99c2a23de70225e252e9822a22b4e0adb82643ab0b710858810e00bf1","impliedFormat":1},{"version":"770625067bb27a20b9826255a8d47b6b5b0a2d3dfcbd21f89904c731f671ba77","impliedFormat":1},{"version":"d1ed6765f4d7906a05968fb5cd6d1db8afa14dbe512a4884e8ea5c0f5e142c80","impliedFormat":1},{"version":"799c0f1b07c092626cf1efd71d459997635911bb5f7fc1196efe449bba87e965","impliedFormat":1},{"version":"2a184e4462b9914a30b1b5c41cf80c6d3428f17b20d3afb711fff3f0644001fd","impliedFormat":1},{"version":"9eabde32a3aa5d80de34af2c2206cdc3ee094c6504a8d0c2d6d20c7c179503cc","impliedFormat":1},{"version":"397c8051b6cfcb48aa22656f0faca2553c5f56187262135162ee79d2b2f6c966","impliedFormat":1},{"version":"a8ead142e0c87dcd5dc130eba1f8eeed506b08952d905c47621dc2f583b1bff9","impliedFormat":1},{"version":"a02f10ea5f73130efca046429254a4e3c06b5475baecc8f7b99a0014731be8b3","impliedFormat":1},{"version":"c2576a4083232b0e2d9bd06875dd43d371dee2e090325a9eac0133fd5650c1cb","impliedFormat":1},{"version":"4c9a0564bb317349de6a24eb4efea8bb79898fa72ad63a1809165f5bd42970dd","impliedFormat":1},{"version":"f40ac11d8859092d20f953aae14ba967282c3bb056431a37fced1866ec7a2681","impliedFormat":1},{"version":"cc11e9e79d4746cc59e0e17473a59d6f104692fd0eeea1bdb2e206eabed83b03","impliedFormat":1},{"version":"b444a410d34fb5e98aa5ee2b381362044f4884652e8bc8a11c8fe14bbd85518e","impliedFormat":1},{"version":"c35808c1f5e16d2c571aa65067e3cb95afeff843b259ecfa2fc107a9519b5392","impliedFormat":1},{"version":"14d5dc055143e941c8743c6a21fa459f961cbc3deedf1bfe47b11587ca4b3ef5","impliedFormat":1},{"version":"a3ad4e1fc542751005267d50a6298e6765928c0c3a8dce1572f2ba6ca518661c","impliedFormat":1},{"version":"f237e7c97a3a89f4591afd49ecb3bd8d14f51a1c4adc8fcae3430febedff5eb6","impliedFormat":1},{"version":"3ffdfbec93b7aed71082af62b8c3e0cc71261cc68d796665faa1e91604fbae8f","impliedFormat":1},{"version":"662201f943ed45b1ad600d03a90dffe20841e725203ced8b708c91fcd7f9379a","impliedFormat":1},{"version":"c9ef74c64ed051ea5b958621e7fb853fe3b56e8787c1587aefc6ea988b3c7e79","impliedFormat":1},{"version":"2462ccfac5f3375794b861abaa81da380f1bbd9401de59ffa43119a0b644253d","impliedFormat":1},{"version":"34baf65cfee92f110d6653322e2120c2d368ee64b3c7981dff08ed105c4f19b0","impliedFormat":1},{"version":"a56fe175741cc8841835eb72e61fa5a34adcbc249ede0e3494c229f0750f6b85","impliedFormat":1},{"version":"d874ba87864aa538141818812bec237197f60927b599d319fd7d194a23c64917","signature":"2093f341c5cba3058c29f9344e59ecfa22dc6559c7eb9f00497a108e09301a55"},{"version":"1b4d98d3e3b722f305ce6ce672cb30fe7e44157dcbf00b0f7f0b0efc3ab16c61","signature":"9e6dcb736749cc84304b38c5a1101b299659dbc3871bab5d1544ee8f8dc73e5b"},{"version":"f0e219869f98ed9fe70f7d831fc26d38ad9a2a12e1e2e2bfa6e9e685760d88a0","signature":"4e4559e8e4ea7d87f914014074559e515de78308bacc733a7ea76f795de178a3"},{"version":"bbd65da9d6a799fd52ecf273b5dfd4eb434d44a9c4540664111139c68eb9d54d","signature":"13ecb31795209aa56b1837b9d46cc5494da392f594132bc5b3a56c067e12ea1c"},{"version":"b605c4ee56f9b9c93f53f059bec285407df6e0c0d417ec6b2aa7463ce340d02c","signature":"e34a28e978cf430e062c91d03987f2b42360b33e6207738b40494acd4a97004b"},{"version":"babe255ed6c3a93e012e697d14370ed282a3b20255376f3e1aeee43fe12aab0c","signature":"5cc10d0295e594c961bd020cc76845097928f550fa3d58468114e5225054f76c"},{"version":"f35722210ab8d5645918fe52ad883ec3a61bf85e5ed37a189a9ed5935c5b8425","signature":"99c4cd704c85c3b9a215977d1d10ad34f1c6bbc5784e0ddaaf6fe8090030eaf3"},"7dc695c4ab01309d1d1b43201700560054feadddf8d0bbfc79d981bff03c1db0",{"version":"af80584f66d422baa23aafe39589ee742e866a303ea54aa2b479a8024a7684a0","impliedFormat":99},{"version":"8ed574be6a8f202fc621f4b81f1f1253a9dec72d9e2c7b6535620257fcb2984f","signature":"dce8180b37696c4d66a5487d7e5113ab082b90459718bdbafd1dad1d75237435"},{"version":"8c3e8a4ae5efd117a60207b13d21ba3e3c9c9e77ccd620c03de3bdae9ece7231","signature":"ab0db8d8a821582e3f49739e5267466d964b64f4aeea5ba379ac7759c7adc531"},{"version":"1d8bc0fada96ea58a0a0b128c9a26f91e58903ba32f8fa9c35f175d7fb6bc38e","signature":"15aba6a4199ce9e4f3c1ec397a468f6aaaeba973649ca4f1c016225b46a5feaf"},{"version":"85f526ba4fb0ec268599096da4352f8178f97e24959193eaae6f384e2dde1d04","signature":"176d164a71b7e42bfbb7b87bb457728a6f4f8ebc2f1386ba10358c21b80ac6b3"},{"version":"64171e426181b2f8b43ccb191ebdd6427b6e1611b2505a278060672908b37126","signature":"9787b621a14f75e2a8beba6d318e75af00586745ca2b8b66fb3f2edaae5b0e9e"},{"version":"ed4582b2568119f1e8ccdff8cef912119b3dc07a09218434579f63f17990ba46","signature":"dd0b7333537f5cb89e10e7b19f927b28c11849b09542daef1f5d023b96f83776"},{"version":"ee73e3dd792e6437fad678fdf5f6715529c1f4ccc3010ac96ae9400bc62fa556","signature":"9f251dd23b2e8054aac7c9ce06aec62234f971770455cf7ac9ea61d13a0a9e7c"},{"version":"7daa8048eb0b031f385a99f639076eeeb8211b499c6bf09c560672ead98f143e","signature":"579fba019a5e9caf42e88d7b10c230df0d7a31fcfd89df1c8f62faac969f941b"},{"version":"b188b15413384fb9fa6d03ac7c3a24bce1e7d230b6e8fcad3992e0d953f4e41e","signature":"6851a377170b200006a9b54eaab6f571f9b17771000ba1984dfa5253f8866b89"},{"version":"a68015b850c6819ca84ea29d4a5946247fda5fba8cd481aa6e845155621c802c","signature":"1dddf3c7864daff2fd99f85588079b51364289fe70af34a4161ef296c18726da"},{"version":"236ace7f6bdf60eca3e55afdf5e82860b00a62265ce8ea986bd387927e9dc949","signature":"5e53425c12122c8eed4e68d63a588f8934ede60998c675f3fb560c38db9b0db5"},{"version":"53a4e0faf9abf27ae4b06554e7eafefeed64e1acba4d993eb020d289236c0570","signature":"f476942a86546971adc1d4bbfd61ebedf8ca33c79fae1bfb0f163e9cac68b958"},{"version":"886729bb5188edf238061d4fb6442ac91255d1420d8d0bfe0d9b3e8fa5bf98be","signature":"f71b01c27cbe950aaa065e686af643e4c5b7c90ae6ded7962bf93673b6a8b223"},{"version":"ba0ce4e4d02a6e9177c451a5d8437e26f5f64d9e82be943b72df13261e0c5021","signature":"1841a2248669736447751ce979d4318af9247ffeac2ebea0886e26a9b25a441e"},{"version":"e8044d5fe7306aeea7b7df33c42a5417eab0b3b57d9c10df784b04e7249ddaf2","signature":"d09ab17b2953596c84fe3529fefde695ee236123728eff8bf6d492726cebb884"},{"version":"aa491c1fee3d6f14f630288da6049102e1567899856de9a5d4a6422a7a8f9394","signature":"672eeb0065e00748f6baa23c898fc607eadd2ff93092dc951d1c56a6d658491d"},{"version":"ddbac00ef73dd35f18cda2d7be979fc0d525d9a649ceb46a5e3fc71cd8534864","signature":"f032c631db239175a83344071f70205230478deac7f7ed68434ffa01e7335a5d"},{"version":"832c1c68b9edb37fbdfb6f30a65e07cf758d4711bd69fa11f3f83a17f9c6233a","signature":"656daca5613edf0a29f933bede6aa64fee1dae7225535ae0bb839f5a6485a440"},{"version":"6982bf8b3ab115017a3cb48f33ccede2d53e951c529f789bf529c0fedcae517a","signature":"7461b3546a2c4f94f6543055d204941e5655406d88d54c40610b30db45aee0d9"},{"version":"aac0b175e8fa90d7e6ab56b2013e89a01c683e437015cd52023eb63ed52c2185","signature":"826dd0d2d4c0be260d9cf7af58065546f573d6808232af90ce9403d13f0cd008"},{"version":"f54d5f97995333e3b73fc8d19629a1cdc1b7edfc9c10e6c465d366b673b444be","signature":"fa327025d6c21f3eaeb8a8ace7ad03e433ae851d2daccead08d86c4c1337ff13"},{"version":"35fcca2df2e48f0510642fabbfd9446e700f09c09620b27670649dee4b3e1c4a","signature":"2afc601b8dbb55f5b2115397b86ba967e1baab2dc49b086e92332e15ea8fdec7"},{"version":"f129258ce9c8439429fe19246b6522b58cb67d1a21e986554204e37cc7f35d73","signature":"9fa6cd3f04e975e1abcbc11bbd73974ccd8c2d32905625a0cb15e5ee3c125601"},{"version":"b8f7a87aba95613a5cae44301563887a34b2c19aba24446b00a11a82b81fe413","signature":"193c244240a23ea51c448ee0f36e487f79c878041fbe16beb484efb216bdf26b"},{"version":"57a0710c49b5bc1fd0260d5e99ba34f100fc5d5322c00901aef96781da97ae50","signature":"0ad625884919fd79071b2ac13a16766c4beab2bce9403813466bba21998b3fd0"},{"version":"e80657786b074103dfcc95f833a45d0bdb3a4058c7405ed60b8d4797a0a66ee9","signature":"81abdcacdd604aca64febe79cd01fdf7da87ffc4d3d8023dedc3d807d1845b61"},{"version":"440d82272e1c87fe0709d83c52a6e64ed7fa5dc3743bc37372826977d5282c92","signature":"e9c3b57fb0a98322d5b29630da10685e8e6122e2a9abebf1572485a9d709fe37"},{"version":"4ba14cfbb20fef8d718fa73305f50558a2fb04949664d6f1349f82661f8d7ffc","signature":"856dfa77951ecc8e7e05ea3476e5bfb949643bb027aeb6fde3acb6d3c7936f7a"},{"version":"a8767b783ebfead72452d19b90784c8f22668c6bc1941db9c11cfe5e72162af9","signature":"7f9e863e7a89fc3e701e55062e88a789b88bcd8b21d8d91ab26cc68c7828c1f0"},{"version":"aad8a2671b3e29516b183ea34cbfa4c8e80f63311d8df5677d8a0226b32ed980","signature":"d01a2c7e0a0db396dbd5d33a340a2525ca8ccdc921ebb5f67089042bae21b117"},{"version":"775a7bc9dec138a8647726421b58d8f742f5b90fdf95b2acc4a7d5cc9b545dee","signature":"f00b6e55fc48e4aef40f51462fe1fff20d5015053b951d82aac13a749d6e51b5"},{"version":"a392a7fafb606dd79d9c82db30d3e6f835ee01fee12ff058e908672334530613","signature":"6a475d279bf59dad092e57ef74d3b2d395857ff5538b6db6acb8796f28a60270"},{"version":"e60b9c02836d9effc04ccdf8e1c40aeca19724d34f8063f76c6dd40e991b0838","signature":"6ab7ca9cbd92e8ad021b507900374f35459c327b977806c698b75a1550300f23"},{"version":"d498db28ff568620c0710e2bd9895009e3326a4b33edcc5b6be765a3d8fba6ee","signature":"f668997f545dd0a656b86b71147731d99ec6b6dccb7cce886001b076c60275fa"},{"version":"af897e8f575f2f5f7d650b0c6e8fc7f92e39945d170ca8be955150695b90d00f","signature":"2db03d901da2f53eeb8aafdbb077b3ae631b1bb4f0fde07d027fd599e16423ea"},{"version":"ae7fdb2faeb45ad9c7691af8c3fad49435d9b377b1a718282050f4f6967dc5bd","signature":"b189a1779523269bb6fb3315beb0050f63ae63e404d9fcb8efb63089a45ee636"},{"version":"2f2bbd8d308a580f954419f195757972dee8a2ac0a376a629b4473bdaf3746fc","signature":"d8348ab9c4560759c65bcf1241accf7c751ac7045872734defcde20dfc001686"},{"version":"e44f9b239aef341ae64c219dd361273218064cadd9076242aeee0fc75c13f225","signature":"e03f632680b081ae9ccca2c9eb574c71e93c198680509875f808d55158204ac8"},{"version":"1a5f975ec5f0e1a531c51782d5da0cbd699e25d8c9991e825dd00584ff1cecb5","signature":"416522a036f968e5cc1e1c91f340b96b18e7fd61f11abe019cb6acd4656ed44b"},{"version":"cdc77dbdb04c12b1abd13a47e75d3b7c9d0de42a8fdecc6ec318251c6b49d7cf","signature":"00d00c5e6c810632838f4ec87bf6bc560414a9250a7c909386931f70248ca3a6"},{"version":"333d4fb35e1300f17b8316a035ed836c5bca4a271b0383b4275996cf0929e1d9","signature":"e2b6a16a4577bbc6c1fabdc1428f7d53893ba984e1bc4c61c54ab3534b52d0e5"},{"version":"7241f4177b20ede40b8ff952e8bfa9b0d8973050e1db3cc50798fb594f4e6805","signature":"918c3f6b8294fdd64169b5fdf972e46a7e036f2c51e154857604f433c6f2822e"},{"version":"e0bb926495c06e701c8aaa26c9fd9ea5ab04b535dde1ab4ff99d454954c45700","signature":"94b0db8ed1f88c852ceb18f197cc7b600d2d42cac4ede04f26d5b52a71669aef"},{"version":"2d9f658e20d59c55dae09395c73c1c56926a39e14ea556029c451c747eeb5b8a","signature":"0102a7dd4777c95f65ee01e611a157585d814464d91c7f77f620a0e369a1dc5d"},{"version":"f9b1f5b04ffa657a2420dfe0664b8c080ed00cd84f23704a6b1b6ec8525f23a1","signature":"c6fcd8ae1bd3057acbc9b2076aa4ae3b711f566a570f4e0a3fb4377014574fc2"},{"version":"19d5f4ce91ed33dae7b9c18df734b2b7825691c7a8c5438c445e0797bc6a1485","signature":"e54306474a4e10fae6f47561ed1cc6f00dbbdc54471ed42cc502d83d3add0100"},{"version":"a2841d852710b9596075e165b4cdd383448d6c43a0437e6518d31a8d3a521733","signature":"0ec7f5381148479f6214bd62f8e19f217cb00c5ac1f83a8801c2a9278e9df67f"},{"version":"737062b8839911044e85d2be16f6013c01a5ff2345069176ff2a600494fca02b","signature":"986239f9410d2945c20d6dd1a32dc908297b0566165a2ef8ec8cfa16764047cd"},{"version":"d83ca342498e2c3443a21d5b8ed160446ce7d5afb42e02b0da5c4994996cfe6f","signature":"b9fabf86d204796a50c2e54aa6271b60bfa29fc9b90261187ca36f15faeb9892"},{"version":"2fb2c3019715a3ac0cc9d381142c466d11f9c6d54ccb71a58d73a0044a3a04d3","signature":"47c83d32f10b141c6c547dae0e5a804e2700ce4f07226ce3ef0d87a007752e44"},{"version":"ae3b0777431e411e681ac0347c9ff6dda2da6f7a7a8359b64f6b3d7d0c33cb1e","signature":"5cb8e3bc45cbdc199a6dc03b5be2b3acc44ec8e096ff09dad5eb7ff9a0a0e29d"},{"version":"aed05375d7a53f27eb036276777c5618359e595348af0d3530bd59d41a974189","signature":"4f6895a478dec68805a747920ead623e5f327806a5aa116f0fecb66f4e2af5cd"},{"version":"58323ecda861d08bedf98939ba7a967688bf12ce39be4ced179b94f864051635","signature":"bd4e5e239f942af97617f9405e9fac6253b66d18fe02abff2d37f4988e8c1fdb"},{"version":"6ce72d1fdae32c311dfc3b0d4b25139c17b5a467a817be69fe3b6689536918df","signature":"85173eee61174f33862fd287dfef777e595a4d3a495360bc5a5ca7c8b0b19818"},"f6f9d4940ad1b9c126d07c0517fe4c71f9ec46d9364430f1a8f66f6fdccdaa38",{"version":"1952f54a10ea4ea2a129b5caefe7d3cedd6c5dea3a4169b41a171008359ab78d","signature":"e17369650fdfac36437e8559b86b2d6172d090594696976082903ba856a2a979"},{"version":"34b552c9e34df8de70e42ad227c8003d7bddc521925e1ec643d39836a32e42e1","signature":"f6e9e0411de308207892802c52be06bf25df281ace623cbf7870583e28b3f12b"},{"version":"f91c4c67452a212bcbb28fc19eabdc616ca24f81a41efe3536155f4de19d43eb","signature":"307067699cff7c3c8a77d9e69aef5291f0141cfbbbeb0954804589e6701238cc"},{"version":"6005ad5c10b6ad91881808de1c03ab3f1d2c243ff351b3b35587e4372019ded5","signature":"4c8070d4ac9fe0026ceae0b0981cb4dcb3cd92b094ef72c78f9ffe04d09a1df2"},{"version":"98503d3c43ad1b34e6eda3a1a727263e5279ba0129c11fd0c89adc732703ec1b","signature":"e58ec6f129b33de21aa444c87a6e538effe82b5f2a7d07c101fc258e2e66f73d"},{"version":"b850c960fc1a46ebf26b7fa15c40270b0785c070c9f320904cf277f421b50612","signature":"e3e78772154f790f8b0a6eaeaba5b4c816567d9d30f9c8655ed29cb9438e5455"},{"version":"258c21439970d3edcdf0d31c98013f633cceb3ba08ac7a5b45d22e42ef5f5934","signature":"252278de90265646666b5511aa063e1d36020e3759e75fd5d81a1eacecef1229"},{"version":"00ea79a108b4abce16587fee415751555e3da6bcfdcfc16a1a2ba68948d5dbb4","signature":"8a95a499afe7cd2aa6161b68aa3f7599e9ae7d12697171384f540e268d846746"},{"version":"d31e0021c6788b9b006b31db70930d3cfea21884342fa57f7fd634c7200e4606","signature":"2967840927e96b345f7b8250ad35e7436aae73c77d9767a2b43f2606ab107cf3"},{"version":"4fefb841027894b9dbabab8e580229a2c6802bb3ffc60dd7b4393cecddcd62f0","signature":"b07d72a408bfcf125c24cfba3db38207687711b800b98ab417e5ada59438c554"},{"version":"7d4c658a774d1d9ceff6a49babf97d2a55ff575f29dc3c2171c5de71c9e76f2f","signature":"ef5aa9871f3b8dac96d4ef93e22eec539527d739c6a7e0c7fa7101fa343bfd77"},{"version":"a3625bee02789cf44368f9628420e126fdf9c627544a73d47478ee5a963170df","signature":"47507ff33fbe83627bdf11136400594a249e8012508425bb2846b7268f966f00"},{"version":"ca5bb29bd25b95c356df601e183613bfd3b0464770880fda599fcfda2f131587","signature":"4a1a0f21b3c4fc0d217392d82445a34fcc8c9ed6f79fdc4d14b8353e3c74eaf3"},{"version":"e228183f46a8b5b39e13f1836af3b9eb9726aee379e17da8b7a67ad7a208051e","signature":"e041d566f765b48ddf66ffd085fb120951cf28e92d129751351e72f8c96d99fa"},{"version":"3de594351d881d4fab3d0c711b513247e4717a743659d7a1259e707057fb585d","signature":"5a59c1315ed5ca8f899fc6527f23a15dc9a38107175a5fffd473db25bcd1fd4a"},{"version":"b591e1dd728774fdf3d47d61905610f5c5ee51c09bbcc56454378ab623d2a604","signature":"20a5515b81a828fc10b066aa5f88a5eb68323d23b8a10d8e9dc7edb6ebdd2bd7"},{"version":"144b834595e9ef5736fb0388a180a91a0a33eb6d45e18b3eabb1004c6572e22d","signature":"f2c24a1e4bc555e203dab5b749b718b1cdf73ecf57d8a8872ff163cbc03b1a68"},{"version":"58d10a220bee327f643270a8c7178a943d21f75cd468b0357a343b8b9085c994","signature":"0dcea4e3a40e7408ec9a6aeacb721ce8289fc99d5f2be600146a472d6d1590b8"},{"version":"a647418f3dd8876fc82d912172fb4cb8d66ae93f2955cca303794274f63ed5ad","signature":"a1ca7f7788853a2ff3670bf1112a92fa503686b10d58339318fec5862bd209a6"},{"version":"6053f0e35f0bb6d7544f722e6625b735741c2b5519c05a1658c0dea679092366","signature":"a32ba2409ac4ce9e71701525146a7b842d96b47891cbdeb6585063fd5d8e7141"},{"version":"5fed764f77b0e6ff239a48beae1a5810a8c596260fcde388815885a338447a13","signature":"8e609bb71c20b858c77f0e9f90bb1319db8477b13f9f965f1a1e18524bf50881"},{"version":"850cfe238b3ca58e090f4a25d999987ace75cbdf33e5a0f05aa02b941fe9b8b6","signature":"8e609bb71c20b858c77f0e9f90bb1319db8477b13f9f965f1a1e18524bf50881"},"47d03b60fdf2375390816bf74afcf733e5e045597764263cf86c49cef58235f9"],"root":[[83,86],[89,115],[246,272],274,293,[334,341],[343,420]],"options":{"allowSyntheticDefaultImports":false,"declaration":true,"emitDecoratorMetadata":true,"esModuleInterop":false,"experimentalDecorators":true,"importHelpers":true,"jsx":1,"module":6,"outDir":"./","sourceMap":false,"strict":true,"strictNullChecks":false,"target":4,"useDefineForClassFields":false},"referencedMap":[[288,1],[289,1],[276,2],[277,3],[275,4],[278,5],[279,6],[280,7],[281,8],[282,9],[283,10],[284,11],[285,12],[286,13],[287,14],[170,15],[171,15],[172,16],[118,17],[173,18],[174,19],[175,20],[116,21],[176,22],[177,23],[178,24],[179,25],[180,26],[181,27],[182,27],[183,28],[184,29],[185,30],[186,31],[119,21],[117,21],[187,32],[188,33],[189,34],[223,35],[190,36],[191,21],[192,37],[193,38],[194,39],[195,40],[196,41],[197,42],[198,43],[199,44],[200,45],[201,45],[202,46],[203,21],[204,47],[205,48],[207,49],[206,50],[208,51],[209,52],[210,53],[211,54],[212,55],[213,24],[214,56],[215,57],[216,58],[217,59],[218,60],[219,61],[220,62],[120,21],[121,63],[122,21],[123,21],[166,64],[167,65],[168,21],[169,51],[221,66],[222,67],[318,68],[319,69],[295,70],[298,71],[316,68],[317,68],[307,68],[306,72],[304,68],[299,68],[312,68],[310,68],[314,68],[294,68],[311,68],[315,68],[300,68],[301,68],[313,68],[296,68],[302,68],[303,68],[305,68],[309,68],[320,73],[308,68],[297,68],[333,74],[332,21],[327,73],[329,75],[328,73],[321,73],[322,73],[324,73],[326,73],[330,75],[331,75],[323,75],[325,75],[124,21],[87,21],[88,76],[240,21],[225,77],[242,78],[244,79],[243,80],[226,81],[241,82],[238,83],[239,84],[237,85],[230,86],[231,87],[233,88],[234,89],[232,90],[235,91],[245,92],[236,93],[228,94],[224,95],[229,96],[227,77],[291,21],[292,97],[290,98],[342,99],[273,21],[82,21],[80,21],[81,21],[13,21],[15,21],[14,21],[2,21],[16,21],[17,21],[18,21],[19,21],[20,21],[21,21],[22,21],[23,21],[3,21],[24,21],[25,21],[4,21],[26,21],[30,21],[27,21],[28,21],[29,21],[31,21],[32,21],[33,21],[5,21],[34,21],[35,21],[36,21],[37,21],[6,21],[41,21],[38,21],[39,21],[40,21],[42,21],[7,21],[43,21],[48,21],[49,21],[44,21],[45,21],[46,21],[47,21],[8,21],[53,21],[50,21],[51,21],[52,21],[54,21],[9,21],[55,21],[56,21],[57,21],[59,21],[58,21],[60,21],[61,21],[10,21],[62,21],[63,21],[64,21],[11,21],[65,21],[66,21],[67,21],[68,21],[69,21],[1,21],[70,21],[71,21],[12,21],[75,21],[73,21],[78,21],[77,21],[72,21],[76,21],[74,21],[79,21],[142,100],[154,101],[140,102],[155,99],[164,103],[131,104],[132,105],[130,106],[163,107],[158,108],[162,109],[134,110],[151,111],[133,112],[161,113],[128,114],[129,108],[135,115],[136,21],[141,109],[139,115],[126,116],[165,117],[156,118],[145,119],[144,115],[146,120],[149,121],[143,122],[147,123],[159,107],[137,124],[138,125],[150,126],[127,99],[153,127],[152,115],[148,128],[157,21],[125,21],[160,129],[274,130],[83,131],[99,132],[405,133],[272,134],[335,135],[271,136],[293,131],[336,131],[341,137],[337,131],[338,131],[339,131],[340,131],[403,138],[415,139],[398,140],[406,141],[402,142],[407,143],[417,144],[418,145],[419,146],[404,133],[400,147],[408,148],[401,149],[409,150],[255,131],[411,151],[399,152],[410,153],[412,154],[344,155],[414,156],[100,131],[101,131],[105,157],[103,131],[102,131],[104,131],[416,158],[107,159],[84,131],[90,160],[108,161],[110,162],[249,163],[270,164],[250,131],[95,165],[251,166],[252,167],[253,131],[254,131],[97,168],[257,169],[258,170],[86,131],[94,171],[259,131],[248,172],[260,131],[269,131],[109,173],[246,140],[261,131],[89,174],[262,131],[263,131],[264,131],[266,175],[265,176],[267,177],[256,178],[247,179],[268,180],[346,131],[347,131],[348,131],[349,131],[350,131],[351,131],[352,131],[353,131],[354,131],[355,131],[356,131],[357,131],[358,131],[359,131],[360,131],[361,131],[362,131],[363,131],[364,131],[365,131],[366,131],[367,131],[397,181],[368,131],[369,131],[370,131],[371,131],[372,131],[373,131],[374,131],[375,131],[376,131],[377,131],[378,131],[379,131],[380,131],[381,131],[382,131],[383,131],[384,131],[385,131],[386,131],[387,131],[388,131],[389,131],[390,131],[391,131],[392,131],[393,131],[394,131],[395,131],[396,131],[98,182],[111,131],[91,131],[112,131],[115,183],[96,184],[92,185],[93,131],[113,171],[114,186],[85,131],[420,187],[413,188],[106,189],[345,190],[334,191],[343,131]],"version":"5.9.3"}
\ No newline at end of file
diff --git a/node_modules/bullmq/dist/esm/types/backoff-strategy.d.ts b/node_modules/bullmq/dist/esm/types/backoff-strategy.d.ts
new file mode 100644
index 0000000..795ec5a
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/backoff-strategy.d.ts
@@ -0,0 +1,2 @@
+import { MinimalJob } from '../interfaces/minimal-job';
+export type BackoffStrategy = (attemptsMade: number, type?: string, err?: Error, job?: MinimalJob) => Promise<number> | number;
diff --git a/node_modules/bullmq/dist/esm/types/backoff-strategy.js b/node_modules/bullmq/dist/esm/types/backoff-strategy.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/backoff-strategy.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/database-type.d.ts b/node_modules/bullmq/dist/esm/types/database-type.d.ts
new file mode 100644
index 0000000..b3a4740
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/database-type.d.ts
@@ -0,0 +1 @@
+export type DatabaseType = 'redis' | 'valkey' | 'dragonfly';
diff --git a/node_modules/bullmq/dist/esm/types/database-type.js b/node_modules/bullmq/dist/esm/types/database-type.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/database-type.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/deduplication-options.d.ts b/node_modules/bullmq/dist/esm/types/deduplication-options.d.ts
new file mode 100644
index 0000000..06fa3a6
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/deduplication-options.d.ts
@@ -0,0 +1,38 @@
+/**
+ * Deduplication options
+ */
+export type DeduplicationOptions = {
+    /**
+     * Identifier
+     */
+    id: string;
+} & {
+    /**
+     * ttl in milliseconds
+     */
+    ttl?: number;
+    /**
+     * Extend ttl value
+     */
+    extend?: boolean;
+    /**
+     * replace job record while it's in delayed state
+     */
+    replace?: boolean;
+    /**
+     * If true, when a job with the same deduplication ID is currently
+     * active (being processed), the new job's data will be stored and
+     * a new job will be created automatically when the active one
+     * finishes (completes or fails). If multiple jobs are added while
+     * the active job is running, only the latest data is kept.
+     *
+     * This guarantees that at most 2 jobs per deduplication ID exist
+     * at any time: 1 active and 1 waiting, preventing parallel
+     * execution of jobs with the same deduplication ID.
+     *
+     * Note: when this option is set, `ttl` is ignored. The dedup key
+     * is kept alive without expiry for the job's entire lifecycle
+     * and cleaned up on completion or failure.
+     */
+    keepLastIfActive?: boolean;
+};
diff --git a/node_modules/bullmq/dist/esm/types/deduplication-options.js b/node_modules/bullmq/dist/esm/types/deduplication-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/deduplication-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/finished-status.d.ts b/node_modules/bullmq/dist/esm/types/finished-status.d.ts
new file mode 100644
index 0000000..a4a7635
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/finished-status.d.ts
@@ -0,0 +1,2 @@
+export type FinishedStatus = 'completed' | 'failed';
+export type FinishedPropValAttribute = 'returnvalue' | 'failedReason';
diff --git a/node_modules/bullmq/dist/esm/types/finished-status.js b/node_modules/bullmq/dist/esm/types/finished-status.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/finished-status.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/index.d.ts b/node_modules/bullmq/dist/esm/types/index.d.ts
new file mode 100644
index 0000000..48124f4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/index.d.ts
@@ -0,0 +1,11 @@
+export * from './backoff-strategy';
+export * from './database-type';
+export * from './deduplication-options';
+export * from './finished-status';
+export * from './job-json-sandbox';
+export * from './job-options';
+export * from './job-scheduler-template-options';
+export * from './job-type';
+export * from './job-progress';
+export * from './repeat-strategy';
+export * from './keep-jobs';
diff --git a/node_modules/bullmq/dist/esm/types/index.js b/node_modules/bullmq/dist/esm/types/index.js
new file mode 100644
index 0000000..48124f4
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/index.js
@@ -0,0 +1,11 @@
+export * from './backoff-strategy';
+export * from './database-type';
+export * from './deduplication-options';
+export * from './finished-status';
+export * from './job-json-sandbox';
+export * from './job-options';
+export * from './job-scheduler-template-options';
+export * from './job-type';
+export * from './job-progress';
+export * from './repeat-strategy';
+export * from './keep-jobs';
diff --git a/node_modules/bullmq/dist/esm/types/job-json-sandbox.d.ts b/node_modules/bullmq/dist/esm/types/job-json-sandbox.d.ts
new file mode 100644
index 0000000..0f81603
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-json-sandbox.d.ts
@@ -0,0 +1,6 @@
+import { JobJson } from '../interfaces/job-json';
+export type JobJsonSandbox = JobJson & {
+    queueName: string;
+    queueQualifiedName: string;
+    prefix: string;
+};
diff --git a/node_modules/bullmq/dist/esm/types/job-json-sandbox.js b/node_modules/bullmq/dist/esm/types/job-json-sandbox.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-json-sandbox.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/job-options.d.ts b/node_modules/bullmq/dist/esm/types/job-options.d.ts
new file mode 100644
index 0000000..d1612b3
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-options.d.ts
@@ -0,0 +1,92 @@
+import { BaseJobOptions } from '../interfaces/base-job-options';
+import { DeduplicationOptions } from './deduplication-options';
+/**
+ * These options will be stored in Redis with smaller
+ * keys for compactness.
+ */
+export type CompressableJobOptions = {
+    /**
+     * Debounce options.
+     * @deprecated use deduplication option
+     */
+    debounce?: DeduplicationOptions;
+    /**
+     * Deduplication options.
+     */
+    deduplication?: DeduplicationOptions;
+    /**
+     * If true, moves parent to failed if any of its children fail.
+     */
+    failParentOnFailure?: boolean;
+    /**
+     * If true, starts processing parent job as soon as any
+     * of its children fail.
+     *
+     */
+    continueParentOnFailure?: boolean;
+    /**
+     * If true, moves the jobId from its parent dependencies to failed dependencies when it fails after all attempts.
+     */
+    ignoreDependencyOnFailure?: boolean;
+    /**
+     * If true, removes the job from its parent dependencies when it fails after all attempts.
+     */
+    removeDependencyOnFailure?: boolean;
+    /**
+     * Telemetry options
+     */
+    telemetry?: {
+        /**
+         * Metadata, used for context propagation.
+         */
+        metadata?: string;
+        /**
+         * If `true` telemetry will omit the context propagation
+         * @defaultValue false
+         */
+        omitContext?: boolean;
+    };
+};
+export type JobsOptions = BaseJobOptions & CompressableJobOptions;
+/**
+ * These fields are the ones stored in Redis with smaller keys for compactness.
+ */
+export type RedisJobOptions = BaseJobOptions & {
+    /**
+     * Debounce identifier.
+     */
+    deid?: string;
+    /**
+     * If true, moves parent to failed.
+     */
+    fpof?: boolean;
+    /**
+     * If true, starts processing parent job as soon as any
+     * of its children fail.
+     */
+    cpof?: boolean;
+    /**
+     * If true, moves the jobId from its parent dependencies to failed dependencies when it fails after all attempts.
+     */
+    idof?: boolean;
+    /**
+     * Maximum amount of log entries that will be preserved
+     */
+    kl?: number;
+    /**
+     * If true, removes the job from its parent dependencies when it fails after all attempts.
+     */
+    rdof?: boolean;
+    /**
+     * TelemetryMetadata, provide for context propagation.
+     */
+    tm?: string;
+    /**
+     * Omit Context Propagation
+     */
+    omc?: boolean;
+    /**
+     * Deduplication options.
+     */
+    de?: DeduplicationOptions;
+};
diff --git a/node_modules/bullmq/dist/esm/types/job-options.js b/node_modules/bullmq/dist/esm/types/job-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/job-progress.d.ts b/node_modules/bullmq/dist/esm/types/job-progress.d.ts
new file mode 100644
index 0000000..a2918b7
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-progress.d.ts
@@ -0,0 +1 @@
+export type JobProgress = string | boolean | number | object;
diff --git a/node_modules/bullmq/dist/esm/types/job-progress.js b/node_modules/bullmq/dist/esm/types/job-progress.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-progress.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.d.ts b/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.d.ts
new file mode 100644
index 0000000..426a009
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.d.ts
@@ -0,0 +1,2 @@
+import { JobsOptions } from './job-options';
+export type JobSchedulerTemplateOptions = Omit<JobsOptions, 'jobId' | 'repeat' | 'delay' | 'deduplication' | 'debounce'>;
diff --git a/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.js b/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-scheduler-template-options.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/job-type.d.ts b/node_modules/bullmq/dist/esm/types/job-type.d.ts
new file mode 100644
index 0000000..636cae5
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-type.d.ts
@@ -0,0 +1,3 @@
+import { FinishedStatus } from './finished-status';
+export type JobState = FinishedStatus | 'active' | 'delayed' | 'prioritized' | 'waiting' | 'waiting-children';
+export type JobType = JobState | 'paused' | 'repeat' | 'wait';
diff --git a/node_modules/bullmq/dist/esm/types/job-type.js b/node_modules/bullmq/dist/esm/types/job-type.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/job-type.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/keep-jobs.d.ts b/node_modules/bullmq/dist/esm/types/keep-jobs.d.ts
new file mode 100644
index 0000000..d72948b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/keep-jobs.d.ts
@@ -0,0 +1,37 @@
+/**
+ * KeepJobs
+ *
+ * Specify which jobs to keep after finishing. If both age and count are
+ * specified, then the jobs kept will be the ones that satisfies both
+ * properties.
+ *
+ * Note that the removal logic is evaluated on a best-effort basis every
+ * time a job transitions to the completed/failed set. BullMQ does not
+ * run a background timer to evict aged jobs, so a job is only removed
+ * once a subsequent job of the same kind (completed or failed) is
+ * processed after its age has expired. If no further jobs are
+ * processed, previously finished jobs will remain in the set even
+ * though their age threshold has been exceeded.
+ */
+export type KeepJobs = {
+    /**
+     * Maximum count of jobs to be kept.
+     */
+    count: number;
+} | {
+    /**
+     * Maximum age in seconds for job to be kept. The cleanup is only
+     * evaluated when a new job of the same kind (completed or failed)
+     * finishes, so a job will only be removed after another job
+     * finishes past its expiration time.
+     */
+    age: number;
+    /**
+     * Maximum count of jobs to be kept.
+     */
+    count?: number;
+    /**
+     * Maximum quantity of jobs to be removed.
+     */
+    limit?: number;
+};
diff --git a/node_modules/bullmq/dist/esm/types/keep-jobs.js b/node_modules/bullmq/dist/esm/types/keep-jobs.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/keep-jobs.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/processor.d.ts b/node_modules/bullmq/dist/esm/types/processor.d.ts
new file mode 100644
index 0000000..5c26f9d
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/processor.d.ts
@@ -0,0 +1,5 @@
+import { Job } from '../classes/job';
+/**
+ * An async function that receives `Job`s and handles them.
+ */
+export type Processor<T = any, R = any, N extends string = string> = (job: Job<T, R, N>, token?: string, signal?: AbortSignal) => Promise<R>;
diff --git a/node_modules/bullmq/dist/esm/types/processor.js b/node_modules/bullmq/dist/esm/types/processor.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/processor.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/types/repeat-strategy.d.ts b/node_modules/bullmq/dist/esm/types/repeat-strategy.d.ts
new file mode 100644
index 0000000..f0bbba9
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/repeat-strategy.d.ts
@@ -0,0 +1,2 @@
+import { RepeatOptions } from '../interfaces/repeat-options';
+export type RepeatStrategy = (millis: number, opts: RepeatOptions, name?: string) => number | undefined | Promise<number | undefined>;
diff --git a/node_modules/bullmq/dist/esm/types/repeat-strategy.js b/node_modules/bullmq/dist/esm/types/repeat-strategy.js
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/types/repeat-strategy.js
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/bullmq/dist/esm/utils/create-scripts.d.ts b/node_modules/bullmq/dist/esm/utils/create-scripts.d.ts
new file mode 100644
index 0000000..dd185dd
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/utils/create-scripts.d.ts
@@ -0,0 +1,3 @@
+import { MinimalQueue } from '../interfaces';
+import { Scripts } from '../classes/scripts';
+export declare const createScripts: (queue: MinimalQueue) => Scripts;
diff --git a/node_modules/bullmq/dist/esm/utils/create-scripts.js b/node_modules/bullmq/dist/esm/utils/create-scripts.js
new file mode 100644
index 0000000..681b89b
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/utils/create-scripts.js
@@ -0,0 +1,17 @@
+import { Scripts } from '../classes/scripts';
+/*
+ * Factory method to create a Scripts object.
+ */
+export const createScripts = (queue) => {
+    return new Scripts({
+        keys: queue.keys,
+        client: queue.client,
+        get redisVersion() {
+            return queue.redisVersion;
+        },
+        toKey: queue.toKey,
+        opts: queue.opts,
+        closing: queue.closing,
+        databaseType: queue.databaseType,
+    });
+};
diff --git a/node_modules/bullmq/dist/esm/utils/index.d.ts b/node_modules/bullmq/dist/esm/utils/index.d.ts
new file mode 100644
index 0000000..8891e2f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/utils/index.d.ts
@@ -0,0 +1,113 @@
+import { Cluster, Redis } from 'ioredis';
+import { AbortController } from '../classes/abort-controller';
+import { ChildMessage, ContextManager, IRedisClient, ParentOptions, Span, Tracer } from '../interfaces';
+import { SpanKind } from '../enums';
+import { DatabaseType } from '../types';
+export declare const errorObject: {
+    [index: string]: any;
+};
+export declare function tryCatch(fn: (...args: any) => any, ctx: any, args: any[]): any;
+/**
+ * Returns the size of a string in UTF-8 bytes (handles multi-byte characters correctly).
+ * @see https://stackoverflow.com/a/23318053/1347170
+ * @param str - The string to measure.
+ * @returns The byte length of the string when encoded as UTF-8.
+ */
+export declare function lengthInUtf8Bytes(str: string): number;
+export declare function isEmpty(obj: object): boolean;
+export declare function array2obj(arr: string[]): Record<string, string>;
+export declare function objectToFlatArray(obj: Record<string, any>): string[];
+export declare function delay(ms: number, abortController?: AbortController): Promise<void>;
+export declare function increaseMaxListeners(emitter: {
+    getMaxListeners(): number;
+    setMaxListeners(n: number): any;
+}, count: number): void;
+type Invert<T extends Record<PropertyKey, PropertyKey>> = {
+    [V in T[keyof T]]: {
+        [K in keyof T]: T[K] extends V ? K : never;
+    }[keyof T];
+};
+export declare function invertObject<T extends Record<PropertyKey, PropertyKey>>(obj: T): Invert<T>;
+export declare const optsDecodeMap: {
+    readonly de: "deduplication";
+    readonly fpof: "failParentOnFailure";
+    readonly cpof: "continueParentOnFailure";
+    readonly idof: "ignoreDependencyOnFailure";
+    readonly kl: "keepLogs";
+    readonly rdof: "removeDependencyOnFailure";
+};
+export declare const optsEncodeMap: {
+    readonly debounce: "de";
+    readonly keepLogs: "kl";
+    readonly deduplication: "de";
+    readonly failParentOnFailure: "fpof";
+    readonly continueParentOnFailure: "cpof";
+    readonly ignoreDependencyOnFailure: "idof";
+    readonly removeDependencyOnFailure: "rdof";
+};
+export declare function isRedisInstance(obj: any): obj is IRedisClient | Redis | Cluster;
+export declare function isRedisCluster(obj: unknown): obj is IRedisClient & {
+    isCluster: true;
+};
+export declare function decreaseMaxListeners(emitter: {
+    getMaxListeners(): number;
+    setMaxListeners(n: number): any;
+}, count: number): void;
+type RemoveAllQueueDataPipeline = {
+    del(...keys: string[]): any;
+    exec(): Promise<any>;
+};
+type RemoveAllQueueDataClient = {
+    scanStream(options: {
+        match: string;
+        count?: number;
+    }): {
+        on(event: 'data', listener: (keys: string[]) => void): any;
+        on(event: 'end', listener: () => void): any;
+        on(event: 'error', listener: (error: Error) => void): any;
+    };
+    pipeline(): RemoveAllQueueDataPipeline;
+    quit(): Promise<any>;
+    isCluster?: boolean;
+};
+export declare function removeAllQueueData(client: RemoveAllQueueDataClient, queueName: string, prefix?: string): Promise<void | boolean>;
+export declare function getParentKey(opts: ParentOptions): string | undefined;
+export declare const clientCommandMessageReg: RegExp;
+export declare const DELAY_TIME_5 = 5000;
+export declare const DELAY_TIME_1 = 100;
+export declare function isNotConnectionError(error: Error): boolean;
+interface procSendLike {
+    send?(message: any, callback?: (error: Error | null) => void): boolean;
+    postMessage?(message: any): void;
+}
+export declare const asyncSend: <T extends procSendLike>(proc: T, msg: any) => Promise<void>;
+export declare const childSend: (proc: NodeJS.Process, msg: ChildMessage) => Promise<void>;
+export declare const isRedisVersionLowerThan: (currentVersion: string, minimumVersion: string, currentDatabaseType: DatabaseType, desiredDatabaseType?: DatabaseType) => boolean;
+export declare const parseObjectValues: (obj: {
+    [key: string]: string;
+}) => Record<string, any>;
+export declare const errorToJSON: (value: any) => Record<string, any>;
+export declare const toString: (value: any) => string;
+export declare const QUEUE_EVENT_SUFFIX = ":qe";
+export declare function removeUndefinedFields<T extends Record<string, any>>(obj: Record<string, any>): T;
+/**
+ * Wraps the code with telemetry and provides a span for configuration.
+ *
+ * @param telemetry - telemetry configuration. If undefined, the callback will be executed without telemetry.
+ * @param spanKind - kind of the span: Producer, Consumer, Internal
+ * @param queueName - queue name
+ * @param operation - operation name (such as add, process, etc)
+ * @param destination - destination name (normally the queue name)
+ * @param callback - code to wrap with telemetry
+ * @param srcPropagationMetadata -
+ * @returns
+ */
+export declare function trace<T>(telemetry: {
+    tracer: Tracer;
+    contextManager: ContextManager;
+} | undefined, spanKind: SpanKind, queueName: string, operation: string, destination: string, callback: (span?: Span, dstPropagationMetadata?: string) => Promise<T> | T, srcPropagationMetadata?: string): Promise<T>;
+/**
+ * randomUUID helper to generate a UUID v4 using native crypto dependency.
+ */
+export declare function randomUUID(): string;
+export {};
diff --git a/node_modules/bullmq/dist/esm/utils/index.js b/node_modules/bullmq/dist/esm/utils/index.js
new file mode 100644
index 0000000..0b1c2bb
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/utils/index.js
@@ -0,0 +1,315 @@
+import { randomBytes, randomUUID as cryptoRandomUUID } from 'crypto';
+// eslint-disable-next-line @typescript-eslint/ban-ts-comment
+// @ts-ignore
+import { CONNECTION_CLOSED_ERROR_MSG } from 'ioredis/built/utils';
+import { ConnectionClosedError } from '../classes/errors/connection-closed-error';
+import * as semver from 'semver';
+import { SpanKind, TelemetryAttributes } from '../enums';
+export const errorObject = { value: null };
+export function tryCatch(fn, ctx, args) {
+    try {
+        return fn.apply(ctx, args);
+    }
+    catch (e) {
+        errorObject.value = e;
+        return errorObject;
+    }
+}
+/**
+ * Returns the size of a string in UTF-8 bytes (handles multi-byte characters correctly).
+ * @see https://stackoverflow.com/a/23318053/1347170
+ * @param str - The string to measure.
+ * @returns The byte length of the string when encoded as UTF-8.
+ */
+export function lengthInUtf8Bytes(str) {
+    return Buffer.byteLength(str, 'utf8');
+}
+export function isEmpty(obj) {
+    for (const key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key)) {
+            return false;
+        }
+    }
+    return true;
+}
+export function array2obj(arr) {
+    const obj = {};
+    for (let i = 0; i < arr.length; i += 2) {
+        obj[arr[i]] = arr[i + 1];
+    }
+    return obj;
+}
+export function objectToFlatArray(obj) {
+    const arr = [];
+    for (const key in obj) {
+        if (Object.prototype.hasOwnProperty.call(obj, key) &&
+            obj[key] !== undefined) {
+            arr[arr.length] = key;
+            arr[arr.length] = obj[key];
+        }
+    }
+    return arr;
+}
+export function delay(ms, abortController) {
+    return new Promise(resolve => {
+        // eslint-disable-next-line prefer-const
+        let timeout;
+        const callback = () => {
+            abortController === null || abortController === void 0 ? void 0 : abortController.signal.removeEventListener('abort', callback);
+            clearTimeout(timeout);
+            resolve();
+        };
+        timeout = setTimeout(callback, ms);
+        abortController === null || abortController === void 0 ? void 0 : abortController.signal.addEventListener('abort', callback);
+    });
+}
+export function increaseMaxListeners(emitter, count) {
+    const maxListeners = emitter.getMaxListeners();
+    emitter.setMaxListeners(maxListeners + count);
+}
+export function invertObject(obj) {
+    return Object.entries(obj).reduce((result, [key, value]) => {
+        result[value] = key;
+        return result;
+    }, {});
+}
+export const optsDecodeMap = {
+    de: 'deduplication',
+    fpof: 'failParentOnFailure',
+    cpof: 'continueParentOnFailure',
+    idof: 'ignoreDependencyOnFailure',
+    kl: 'keepLogs',
+    rdof: 'removeDependencyOnFailure',
+};
+export const optsEncodeMap = Object.assign(Object.assign({}, invertObject(optsDecodeMap)), { 
+    /*/ Legacy for backwards compatibility */ debounce: 'de' });
+export function isRedisInstance(obj) {
+    if (!obj) {
+        return false;
+    }
+    const redisApi = ['connect', 'disconnect', 'duplicate'];
+    return redisApi.every(name => typeof obj[name] === 'function');
+}
+export function isRedisCluster(obj) {
+    return isRedisInstance(obj) && !!obj.isCluster;
+}
+export function decreaseMaxListeners(emitter, count) {
+    increaseMaxListeners(emitter, -count);
+}
+export async function removeAllQueueData(client, queueName, prefix = process.env.BULLMQ_TEST_PREFIX || 'bull') {
+    if (client.isCluster) {
+        // scanStream is not cluster-safe across all key slots.
+        // Applies to adapter clients and raw ioredis Cluster clients alike.
+        // @see https://github.com/luin/ioredis/issues/175
+        return false;
+    }
+    const pattern = `${prefix}:${queueName}:*`;
+    const pendingOperations = [];
+    await new Promise((resolve, reject) => {
+        const stream = client.scanStream({
+            match: pattern,
+        });
+        stream.on('data', (keys) => {
+            if (keys.length) {
+                const pipeline = client.pipeline();
+                keys.forEach(key => {
+                    pipeline.del(key);
+                });
+                const execPromise = pipeline.exec().catch(error => {
+                    reject(error);
+                    throw error;
+                });
+                pendingOperations.push(execPromise);
+            }
+        });
+        stream.on('end', () => resolve());
+        stream.on('error', error => reject(error));
+    });
+    // Wait for all pipeline operations to complete before closing the connection
+    await Promise.all(pendingOperations);
+    // Handle connection close with better error handling for Dragonfly
+    try {
+        await client.quit();
+    }
+    catch (error) {
+        if (isNotConnectionError(error)) {
+            throw error;
+        }
+    }
+}
+export function getParentKey(opts) {
+    if (opts) {
+        return `${opts.queue}:${opts.id}`;
+    }
+}
+export const clientCommandMessageReg = /ERR unknown command ['`]\s*client\s*['`]/;
+export const DELAY_TIME_5 = 5000;
+export const DELAY_TIME_1 = 100;
+export function isNotConnectionError(error) {
+    if (error instanceof ConnectionClosedError) {
+        return false;
+    }
+    const { code, message: errorMessage } = error;
+    return (errorMessage !== CONNECTION_CLOSED_ERROR_MSG &&
+        !errorMessage.includes('ECONNREFUSED') &&
+        code !== 'ECONNREFUSED');
+}
+export const asyncSend = (proc, msg) => {
+    return new Promise((resolve, reject) => {
+        if (typeof proc.send === 'function') {
+            proc.send(msg, (err) => {
+                if (err) {
+                    reject(err);
+                }
+                else {
+                    resolve();
+                }
+            });
+        }
+        else if (typeof proc.postMessage === 'function') {
+            resolve(proc.postMessage(msg));
+        }
+        else {
+            resolve();
+        }
+    });
+};
+export const childSend = (proc, msg) => asyncSend(proc, msg);
+export const isRedisVersionLowerThan = (currentVersion, minimumVersion, currentDatabaseType, desiredDatabaseType = 'redis') => {
+    if (currentDatabaseType === desiredDatabaseType) {
+        const version = semver.valid(semver.coerce(currentVersion));
+        return semver.lt(version, minimumVersion);
+    }
+    return false;
+};
+export const parseObjectValues = (obj) => {
+    const accumulator = {};
+    for (const value of Object.entries(obj)) {
+        accumulator[value[0]] = JSON.parse(value[1]);
+    }
+    return accumulator;
+};
+const getCircularReplacer = (rootReference) => {
+    const references = new WeakSet();
+    references.add(rootReference);
+    return (_, value) => {
+        if (typeof value === 'object' && value !== null) {
+            if (references.has(value)) {
+                return '[Circular]';
+            }
+            references.add(value);
+        }
+        return value;
+    };
+};
+export const errorToJSON = (value) => {
+    const error = {};
+    Object.getOwnPropertyNames(value).forEach(function (propName) {
+        error[propName] = value[propName];
+    });
+    return JSON.parse(JSON.stringify(error, getCircularReplacer(value)));
+};
+const INFINITY = 1 / 0;
+export const toString = (value) => {
+    if (value == null) {
+        return '';
+    }
+    // Exit early for strings to avoid a performance hit in some environments.
+    if (typeof value === 'string') {
+        return value;
+    }
+    if (Array.isArray(value)) {
+        // Recursively convert values (susceptible to call stack limits).
+        return `${value.map(other => (other == null ? other : toString(other)))}`;
+    }
+    if (typeof value == 'symbol' ||
+        Object.prototype.toString.call(value) == '[object Symbol]') {
+        return value.toString();
+    }
+    const result = `${value}`;
+    return result === '0' && 1 / value === -INFINITY ? '-0' : result;
+};
+export const QUEUE_EVENT_SUFFIX = ':qe';
+export function removeUndefinedFields(obj) {
+    const newObj = {};
+    for (const key in obj) {
+        if (obj[key] !== undefined) {
+            newObj[key] = obj[key];
+        }
+    }
+    return newObj;
+}
+/**
+ * Wraps the code with telemetry and provides a span for configuration.
+ *
+ * @param telemetry - telemetry configuration. If undefined, the callback will be executed without telemetry.
+ * @param spanKind - kind of the span: Producer, Consumer, Internal
+ * @param queueName - queue name
+ * @param operation - operation name (such as add, process, etc)
+ * @param destination - destination name (normally the queue name)
+ * @param callback - code to wrap with telemetry
+ * @param srcPropagationMetadata -
+ * @returns
+ */
+export async function trace(telemetry, spanKind, queueName, operation, destination, callback, srcPropagationMetadata) {
+    if (!telemetry) {
+        return callback();
+    }
+    else {
+        const { tracer, contextManager } = telemetry;
+        const currentContext = contextManager.active();
+        let parentContext;
+        if (srcPropagationMetadata) {
+            parentContext = contextManager.fromMetadata(currentContext, srcPropagationMetadata);
+        }
+        const spanName = destination ? `${operation} ${destination}` : operation;
+        const span = tracer.startSpan(spanName, {
+            kind: spanKind,
+        }, parentContext);
+        try {
+            span.setAttributes({
+                [TelemetryAttributes.QueueName]: queueName,
+                [TelemetryAttributes.QueueOperation]: operation,
+            });
+            let messageContext;
+            let dstPropagationMetadata;
+            if (spanKind === SpanKind.CONSUMER && parentContext) {
+                messageContext = span.setSpanOnContext(parentContext);
+            }
+            else {
+                messageContext = span.setSpanOnContext(currentContext);
+            }
+            if (callback.length == 2) {
+                dstPropagationMetadata = contextManager.getMetadata(messageContext);
+            }
+            return await contextManager.with(messageContext, () => callback(span, dstPropagationMetadata));
+        }
+        catch (err) {
+            span.recordException(err);
+            throw err;
+        }
+        finally {
+            span.end();
+        }
+    }
+}
+/**
+ * randomUUID helper to generate a UUID v4 using native crypto dependency.
+ */
+export function randomUUID() {
+    if (typeof cryptoRandomUUID === 'function') {
+        return cryptoRandomUUID();
+    }
+    const bytes = randomBytes(16);
+    // Set version to 4 (bits 4-7 of the 7th byte)
+    bytes[6] = (bytes[6] & 0x0f) | 0x40;
+    // Set variant to RFC 4122 (bits 6-7 of the 9th byte)
+    bytes[8] = (bytes[8] & 0x3f) | 0x80;
+    return [
+        bytes.toString('hex', 0, 4),
+        bytes.toString('hex', 4, 6),
+        bytes.toString('hex', 6, 8),
+        bytes.toString('hex', 8, 10),
+        bytes.toString('hex', 10, 16),
+    ].join('-');
+}
diff --git a/node_modules/bullmq/dist/esm/version.d.ts b/node_modules/bullmq/dist/esm/version.d.ts
new file mode 100644
index 0000000..ac6486f
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/version.d.ts
@@ -0,0 +1 @@
+export declare const version = "5.77.6";
diff --git a/node_modules/bullmq/dist/esm/version.js b/node_modules/bullmq/dist/esm/version.js
new file mode 100644
index 0000000..c216159
--- /dev/null
+++ b/node_modules/bullmq/dist/esm/version.js
@@ -0,0 +1 @@
+export const version = '5.77.6';
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/LICENSE b/node_modules/bullmq/node_modules/@ioredis/commands/LICENSE
new file mode 100644
index 0000000..8931fa9
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/LICENSE
@@ -0,0 +1,23 @@
+The MIT License (MIT)
+
+Copyright (c) 2022 Zihua Li
+Copyright (c) 2015 NodeRedis
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/README.md b/node_modules/bullmq/node_modules/@ioredis/commands/README.md
new file mode 100644
index 0000000..2649696
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/README.md
@@ -0,0 +1,43 @@
+# Redis Commands
+
+This module exports all the commands that Redis supports.
+
+## Install
+
+```shell
+$ npm install @ioredis/commands
+```
+
+## Usage
+
+```js
+const commands = require('@ioredis/commands');
+```
+
+`.list` is an array contains all the lowercased commands:
+
+```js
+commands.list.forEach((command) => {
+  console.log(command);
+});
+```
+
+`.exists()` is used to check if the command exists:
+
+```js
+commands.exists('set') // true
+commands.exists('other-command') // false
+```
+
+`.hasFlag()` is used to check if the command has the flag:
+
+```js
+commands.hasFlag('set', 'readonly') // false
+```
+
+`.getKeyIndexes()` is used to get the indexes of keys in the command arguments:
+
+```js
+commands.getKeyIndexes('set', ['key', 'value']) // [0]
+commands.getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+```
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/built/commands.json b/node_modules/bullmq/node_modules/@ioredis/commands/built/commands.json
new file mode 100644
index 0000000..4004701
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/built/commands.json
@@ -0,0 +1,2578 @@
+{
+    "acl": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "append": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "asking": {
+        "arity": 1,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "auth": {
+        "arity": -2,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bgrewriteaof": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bgsave": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bitcount": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitfield": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitfield_ro": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "bitop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 2,
+        "keyStop": -1,
+        "step": 1
+    },
+    "bitpos": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "blmove": {
+        "arity": 6,
+        "flags": [
+            "write",
+            "denyoom",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "blmpop": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "blpop": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "brpop": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "brpoplpush": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "noscript",
+            "blocking"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "bzmpop": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "bzpopmax": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "bzpopmin": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "noscript",
+            "blocking",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -2,
+        "step": 1
+    },
+    "client": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "cluster": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "command": {
+        "arity": -1,
+        "flags": [
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "config": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "copy": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "dbsize": {
+        "arity": 1,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "debug": {
+        "arity": -2,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "decr": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "decrby": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "del": {
+        "arity": -2,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "discard": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "dump": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "echo": {
+        "arity": 2,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "eval": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "eval_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "evalsha": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "evalsha_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "exec": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "skip_slowlog"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "exists": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "expire": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "expireat": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "expiretime": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "failover": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "fcall": {
+        "arity": -3,
+        "flags": [
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "fcall_ro": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "noscript",
+            "stale",
+            "skip_monitor",
+            "no_mandatory_keys",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "flushall": {
+        "arity": -1,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "flushdb": {
+        "arity": -1,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "function": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "geoadd": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geodist": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geohash": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geopos": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadius": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadius_ro": {
+        "arity": -6,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadiusbymember": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "georadiusbymember_ro": {
+        "arity": -5,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geosearch": {
+        "arity": -7,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "geosearchstore": {
+        "arity": -8,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "get": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getbit": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getdel": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getex": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getrange": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "getset": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hdel": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hello": {
+        "arity": -1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "hexists": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpire": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpireat": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hexpiretime": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hget": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetall": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetdel": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hgetex": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hincrby": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hincrbyfloat": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hkeys": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hmget": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hmset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpersist": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpire": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpireat": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpexpiretime": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hpttl": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hrandfield": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hset": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hsetex": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hsetnx": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hstrlen": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "httl": {
+        "arity": -5,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "hvals": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incr": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incrby": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "incrbyfloat": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "info": {
+        "arity": -1,
+        "flags": [
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "keys": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lastsave": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "latency": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lcs": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "lindex": {
+        "arity": 3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "linsert": {
+        "arity": 5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "llen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lmove": {
+        "arity": 5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "lmpop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lolwut": {
+        "arity": -1,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "lpop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpos": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpush": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lpushx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lrange": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lrem": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "lset": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ltrim": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "memory": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "mget": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "migrate": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 3,
+        "keyStop": 3,
+        "step": 1
+    },
+    "module": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "monitor": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "move": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "mset": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 2
+    },
+    "msetnx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 2
+    },
+    "multi": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "object": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "persist": {
+        "arity": 2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpire": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpireat": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pexpiretime": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pfadd": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "pfcount": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "pfdebug": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "admin"
+        ],
+        "keyStart": 2,
+        "keyStop": 2,
+        "step": 1
+    },
+    "pfmerge": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "pfselftest": {
+        "arity": 1,
+        "flags": [
+            "admin"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "ping": {
+        "arity": -1,
+        "flags": [
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "psetex": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "psubscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "psync": {
+        "arity": -3,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "pttl": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "publish": {
+        "arity": 3,
+        "flags": [
+            "pubsub",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "pubsub": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "punsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "quit": {
+        "arity": -1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "randomkey": {
+        "arity": 1,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "readonly": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "readwrite": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "rename": {
+        "arity": 3,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "renamenx": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "replconf": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "replicaof": {
+        "arity": 3,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "reset": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "no_auth",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "restore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "restore-asking": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "asking"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "role": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "rpop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "rpoplpush": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "rpush": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "rpushx": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sadd": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "save": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "scan": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "scard": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "script": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sdiff": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sdiffstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "select": {
+        "arity": 2,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "set": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setbit": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setex": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setnx": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "setrange": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "shutdown": {
+        "arity": -1,
+        "flags": [
+            "admin",
+            "noscript",
+            "loading",
+            "stale",
+            "no_multi",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sinter": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sintercard": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sinterstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sismember": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "slaveof": {
+        "arity": 3,
+        "flags": [
+            "admin",
+            "noscript",
+            "stale",
+            "no_async_loading"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "slowlog": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "smembers": {
+        "arity": 2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "smismember": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "smove": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "sort": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sort_ro": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "spop": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "spublish": {
+        "arity": 3,
+        "flags": [
+            "pubsub",
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "srandmember": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "srem": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "ssubscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "strlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "subscribe": {
+        "arity": -2,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "substr": {
+        "arity": 4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "sunion": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sunionstore": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "sunsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "swapdb": {
+        "arity": 3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "sync": {
+        "arity": 1,
+        "flags": [
+            "admin",
+            "noscript",
+            "no_async_loading",
+            "no_multi"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "time": {
+        "arity": 1,
+        "flags": [
+            "loading",
+            "stale",
+            "fast"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "touch": {
+        "arity": -2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "ttl": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "type": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "unlink": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "unsubscribe": {
+        "arity": -1,
+        "flags": [
+            "pubsub",
+            "noscript",
+            "loading",
+            "stale"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "unwatch": {
+        "arity": 1,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "wait": {
+        "arity": 3,
+        "flags": [
+            "noscript"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "watch": {
+        "arity": -2,
+        "flags": [
+            "noscript",
+            "loading",
+            "stale",
+            "fast",
+            "allow_busy"
+        ],
+        "keyStart": 1,
+        "keyStop": -1,
+        "step": 1
+    },
+    "xack": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xadd": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xautoclaim": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xclaim": {
+        "arity": -6,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xdel": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xdelex": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xgroup": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xinfo": {
+        "arity": -2,
+        "flags": [],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xlen": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xpending": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xread": {
+        "arity": -4,
+        "flags": [
+            "readonly",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xreadgroup": {
+        "arity": -7,
+        "flags": [
+            "write",
+            "blocking",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "xrevrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xsetid": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "xtrim": {
+        "arity": -4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zadd": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zcard": {
+        "arity": 2,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zcount": {
+        "arity": 4,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zdiff": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zdiffstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zincrby": {
+        "arity": 4,
+        "flags": [
+            "write",
+            "denyoom",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zinter": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zintercard": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zinterstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zlexcount": {
+        "arity": 4,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zmpop": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zmscore": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zpopmax": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zpopmin": {
+        "arity": -2,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrandmember": {
+        "arity": -2,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangebylex": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangebyscore": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrangestore": {
+        "arity": -5,
+        "flags": [
+            "write",
+            "denyoom"
+        ],
+        "keyStart": 1,
+        "keyStop": 2,
+        "step": 1
+    },
+    "zrank": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrem": {
+        "arity": -3,
+        "flags": [
+            "write",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebylex": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebyrank": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zremrangebyscore": {
+        "arity": 4,
+        "flags": [
+            "write"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrange": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrangebylex": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrangebyscore": {
+        "arity": -4,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zrevrank": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zscan": {
+        "arity": -3,
+        "flags": [
+            "readonly"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zscore": {
+        "arity": 3,
+        "flags": [
+            "readonly",
+            "fast"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    },
+    "zunion": {
+        "arity": -3,
+        "flags": [
+            "readonly",
+            "movablekeys"
+        ],
+        "keyStart": 0,
+        "keyStop": 0,
+        "step": 0
+    },
+    "zunionstore": {
+        "arity": -4,
+        "flags": [
+            "write",
+            "denyoom",
+            "movablekeys"
+        ],
+        "keyStart": 1,
+        "keyStop": 1,
+        "step": 1
+    }
+}
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/built/index.d.ts b/node_modules/bullmq/node_modules/@ioredis/commands/built/index.d.ts
new file mode 100644
index 0000000..94506a2
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/built/index.d.ts
@@ -0,0 +1,34 @@
+/// <reference types="node" />
+/**
+ * Redis command list
+ *
+ * All commands are lowercased.
+ */
+export declare const list: string[];
+/**
+ * Check if the command exists
+ */
+export declare function exists(commandName: string, options?: {
+    caseInsensitive?: boolean;
+}): boolean;
+/**
+ * Check if the command has the flag
+ *
+ * Some of possible flags: readonly, noscript, loading
+ */
+export declare function hasFlag(commandName: string, flag: string, options?: {
+    nameCaseInsensitive?: boolean;
+}): boolean;
+/**
+ * Get indexes of keys in the command arguments
+ *
+ * @example
+ * ```javascript
+ * getKeyIndexes('set', ['key', 'value']) // [0]
+ * getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+ * ```
+ */
+export declare function getKeyIndexes(commandName: string, args: (string | Buffer | number)[], options?: {
+    parseExternalKey?: boolean;
+    nameCaseInsensitive?: boolean;
+}): number[];
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/built/index.js b/node_modules/bullmq/node_modules/@ioredis/commands/built/index.js
new file mode 100644
index 0000000..c0e9b2f
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/built/index.js
@@ -0,0 +1,217 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getKeyIndexes = exports.hasFlag = exports.exists = exports.list = void 0;
+const commands_json_1 = __importDefault(require("./commands.json"));
+/**
+ * Redis command list
+ *
+ * All commands are lowercased.
+ */
+exports.list = Object.keys(commands_json_1.default);
+const flags = {};
+exports.list.forEach((commandName) => {
+    flags[commandName] = commands_json_1.default[commandName].flags.reduce(function (flags, flag) {
+        flags[flag] = true;
+        return flags;
+    }, {});
+});
+/**
+ * Check if the command exists
+ */
+function exists(commandName, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.caseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    return Boolean(commands_json_1.default[commandName]);
+}
+exports.exists = exists;
+/**
+ * Check if the command has the flag
+ *
+ * Some of possible flags: readonly, noscript, loading
+ */
+function hasFlag(commandName, flag, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.nameCaseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    if (!flags[commandName]) {
+        throw new Error("Unknown command " + commandName);
+    }
+    return Boolean(flags[commandName][flag]);
+}
+exports.hasFlag = hasFlag;
+/**
+ * Get indexes of keys in the command arguments
+ *
+ * @example
+ * ```javascript
+ * getKeyIndexes('set', ['key', 'value']) // [0]
+ * getKeyIndexes('mget', ['key1', 'key2']) // [0, 1]
+ * ```
+ */
+function getKeyIndexes(commandName, args, options) {
+    commandName = (options === null || options === void 0 ? void 0 : options.nameCaseInsensitive)
+        ? String(commandName).toLowerCase()
+        : commandName;
+    const command = commands_json_1.default[commandName];
+    if (!command) {
+        throw new Error("Unknown command " + commandName);
+    }
+    if (!Array.isArray(args)) {
+        throw new Error("Expect args to be an array");
+    }
+    const keys = [];
+    const parseExternalKey = Boolean(options && options.parseExternalKey);
+    const takeDynamicKeys = (args, startIndex) => {
+        const keys = [];
+        const keyStop = Number(args[startIndex]);
+        for (let i = 0; i < keyStop; i++) {
+            keys.push(i + startIndex + 1);
+        }
+        return keys;
+    };
+    const takeKeyAfterToken = (args, startIndex, token) => {
+        for (let i = startIndex; i < args.length - 1; i += 1) {
+            if (String(args[i]).toLowerCase() === token.toLowerCase()) {
+                return i + 1;
+            }
+        }
+        return null;
+    };
+    switch (commandName) {
+        case "zunionstore":
+        case "zinterstore":
+        case "zdiffstore":
+            keys.push(0, ...takeDynamicKeys(args, 1));
+            break;
+        case "eval":
+        case "evalsha":
+        case "eval_ro":
+        case "evalsha_ro":
+        case "fcall":
+        case "fcall_ro":
+        case "blmpop":
+        case "bzmpop":
+            keys.push(...takeDynamicKeys(args, 1));
+            break;
+        case "sintercard":
+        case "lmpop":
+        case "zunion":
+        case "zinter":
+        case "zmpop":
+        case "zintercard":
+        case "zdiff": {
+            keys.push(...takeDynamicKeys(args, 0));
+            break;
+        }
+        case "georadius": {
+            keys.push(0);
+            const storeKey = takeKeyAfterToken(args, 5, "STORE");
+            if (storeKey)
+                keys.push(storeKey);
+            const distKey = takeKeyAfterToken(args, 5, "STOREDIST");
+            if (distKey)
+                keys.push(distKey);
+            break;
+        }
+        case "georadiusbymember": {
+            keys.push(0);
+            const storeKey = takeKeyAfterToken(args, 4, "STORE");
+            if (storeKey)
+                keys.push(storeKey);
+            const distKey = takeKeyAfterToken(args, 4, "STOREDIST");
+            if (distKey)
+                keys.push(distKey);
+            break;
+        }
+        case "sort":
+        case "sort_ro":
+            keys.push(0);
+            for (let i = 1; i < args.length - 1; i++) {
+                let arg = args[i];
+                if (typeof arg !== "string") {
+                    continue;
+                }
+                const directive = arg.toUpperCase();
+                if (directive === "GET") {
+                    i += 1;
+                    arg = args[i];
+                    if (arg !== "#") {
+                        if (parseExternalKey) {
+                            keys.push([i, getExternalKeyNameLength(arg)]);
+                        }
+                        else {
+                            keys.push(i);
+                        }
+                    }
+                }
+                else if (directive === "BY") {
+                    i += 1;
+                    if (parseExternalKey) {
+                        keys.push([i, getExternalKeyNameLength(args[i])]);
+                    }
+                    else {
+                        keys.push(i);
+                    }
+                }
+                else if (directive === "STORE") {
+                    i += 1;
+                    keys.push(i);
+                }
+            }
+            break;
+        case "migrate":
+            if (args[2] === "") {
+                for (let i = 5; i < args.length - 1; i++) {
+                    const arg = args[i];
+                    if (typeof arg === "string" && arg.toUpperCase() === "KEYS") {
+                        for (let j = i + 1; j < args.length; j++) {
+                            keys.push(j);
+                        }
+                        break;
+                    }
+                }
+            }
+            else {
+                keys.push(2);
+            }
+            break;
+        case "xreadgroup":
+        case "xread":
+            // Keys are 1st half of the args after STREAMS argument.
+            for (let i = commandName === "xread" ? 0 : 3; i < args.length - 1; i++) {
+                if (String(args[i]).toUpperCase() === "STREAMS") {
+                    for (let j = i + 1; j <= i + (args.length - 1 - i) / 2; j++) {
+                        keys.push(j);
+                    }
+                    break;
+                }
+            }
+            break;
+        default:
+            // Step has to be at least one in this case, otherwise the command does
+            // not contain a key.
+            if (command.step > 0) {
+                const keyStart = command.keyStart - 1;
+                const keyStop = command.keyStop > 0
+                    ? command.keyStop
+                    : args.length + command.keyStop + 1;
+                for (let i = keyStart; i < keyStop; i += command.step) {
+                    keys.push(i);
+                }
+            }
+            break;
+    }
+    return keys;
+}
+exports.getKeyIndexes = getKeyIndexes;
+function getExternalKeyNameLength(key) {
+    if (typeof key !== "string") {
+        key = String(key);
+    }
+    const hashPos = key.indexOf("->");
+    return hashPos === -1 ? key.length : hashPos;
+}
diff --git a/node_modules/bullmq/node_modules/@ioredis/commands/package.json b/node_modules/bullmq/node_modules/@ioredis/commands/package.json
new file mode 100644
index 0000000..c60e19a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/@ioredis/commands/package.json
@@ -0,0 +1,52 @@
+{
+  "name": "@ioredis/commands",
+  "version": "1.5.1",
+  "description": "Redis commands",
+  "main": "built/index.js",
+  "files": [
+    "built/",
+    "commands.json"
+  ],
+  "scripts": {
+    "pretest": "npm run lint",
+    "test": "mocha",
+    "build": "rm -rf built && tsc",
+    "gen": "node tools/build",
+    "lint": "standard --fix --verbose | snazzy",
+    "release": "release-it"
+  },
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/ioredis/commands.git"
+  },
+  "keywords": [
+    "redis",
+    "commands",
+    "prefix"
+  ],
+  "author": "Zihua Li <i@zihua.li> (http://zihua.li)",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/ioredis/commands/issues"
+  },
+  "homepage": "https://github.com/ioredis/commands",
+  "devDependencies": {
+    "@release-it/conventional-changelog": "^4.2.0",
+    "@semantic-release/changelog": "^6.0.1",
+    "@semantic-release/commit-analyzer": "^9.0.2",
+    "@semantic-release/git": "^10.0.1",
+    "chai": "^4.3.6",
+    "ioredis": "^5.0.6",
+    "mocha": "^9.2.1",
+    "release-it": "^14.12.5",
+    "safe-stable-stringify": "^2.3.1",
+    "semantic-release": "^19.0.2",
+    "snazzy": "^9.0.0",
+    "standard": "^16.0.4",
+    "typescript": "^4.6.2"
+  }
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/LICENSE b/node_modules/bullmq/node_modules/ioredis/LICENSE
new file mode 100644
index 0000000..1d4bd28
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-2022 Zihua Li
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/bullmq/node_modules/ioredis/README.md b/node_modules/bullmq/node_modules/ioredis/README.md
new file mode 100644
index 0000000..2b33d38
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/README.md
@@ -0,0 +1,1498 @@
+[![ioredis](https://cdn.jsdelivr.net/gh/redis/ioredis@b5e8c74/logo.svg)](https://github.com/redis/ioredis)
+
+[![Build Status](https://github.com/redis/ioredis/actions/workflows/release.yml/badge.svg?branch=main)](https://github.com/redis/ioredis/actions/workflows/release.yml?query=branch%3Amain)
+[![Coverage Status](https://coveralls.io/repos/github/luin/ioredis/badge.svg?branch=main)](https://coveralls.io/github/luin/ioredis?branch=main)
+[![Commitizen friendly](https://img.shields.io/badge/commitizen-friendly-brightgreen.svg)](http://commitizen.github.io/cz-cli/)
+[![semantic-release](https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg)](https://github.com/semantic-release/semantic-release)
+
+[![Discord](https://img.shields.io/discord/697882427875393627.svg?style=social&logo=discord)](https://discord.gg/redis)
+[![Twitch](https://img.shields.io/twitch/status/redisinc?style=social)](https://www.twitch.tv/redisinc)
+[![YouTube](https://img.shields.io/youtube/channel/views/UCD78lHSwYqMlyetR0_P4Vig?style=social)](https://www.youtube.com/redisinc)
+[![Twitter](https://img.shields.io/twitter/follow/redisinc?style=social)](https://twitter.com/redisinc)
+
+A robust, performance-focused and full-featured [Redis](http://redis.io) client for [Node.js](https://nodejs.org).
+
+Supports Redis >= 2.6.12. Completely compatible with Redis 7.x.
+
+ioredis is a stable project and maintenance is done on a best-effort basis for relevant issues (contributions to ioredis will still be evaluated, reviewed, and merged when they benefit the project). For new projects, node-redis is the recommended client library. [node-redis](https://github.com/redis/node-redis) is the open-source (MIT license) Redis JavaScript client library redesigned from the ground up and actively maintained. [node-redis](https://github.com/redis/node-redis) supports new (hash-field expiration) and future commands and the capabilities available in Redis Stack and Redis 8 (search, JSON, time-series, probabilistic data structures).
+
+# Features
+
+ioredis is a robust, full-featured Redis client that is
+used in the world's biggest online commerce company [Alibaba](http://www.alibaba.com/) and many other awesome companies.
+
+0. Full-featured. It supports [Cluster](http://redis.io/topics/cluster-tutorial), [Sentinel](https://redis.io/docs/latest/operate/oss_and_stack/management/sentinel/), [Streams](https://redis.io/topics/streams-intro), [Pipelining](http://redis.io/topics/pipelining), and of course [Lua scripting](http://redis.io/commands/eval), [Redis Functions](https://redis.io/topics/functions-intro), [Pub/Sub](http://redis.io/topics/pubsub) (with the support of binary messages).
+1. High performance 🚀.
+2. Delightful API 😄. It works with Node callbacks and Native promises.
+3. Transformation of command arguments and replies.
+4. Transparent key prefixing.
+5. Abstraction for Lua scripting, allowing you to [define custom commands](https://github.com/redis/ioredis#lua-scripting).
+6. Supports [binary data](https://github.com/redis/ioredis#handle-binary-data).
+7. Supports [TLS](https://github.com/redis/ioredis#tls-options) 🔒.
+8. Supports offline queue and ready checking.
+9. Supports ES6 types, such as `Map` and `Set`.
+10. Supports GEO commands 📍.
+11. Supports Redis ACL.
+12. Sophisticated error handling strategy.
+13. Supports NAT mapping.
+14. Supports autopipelining.
+
+**100% written in TypeScript and official declarations are provided:**
+
+<img width="837" src="resources/ts-screenshot.png" alt="TypeScript Screenshot" />
+
+# Versions
+
+| Version        | Branch | Node.js Version | Redis Version   |
+| -------------- | ------ | --------------- | --------------- |
+| 5.x.x (latest) | main   | >= 12           | 2.6.12 ~ latest |
+| 4.x.x          | v4     | >= 8            | 2.6.12 ~ 7      |
+
+Refer to [CHANGELOG.md](CHANGELOG.md) for features and bug fixes introduced in v5.
+
+🚀 [Upgrading from v4 to v5](https://github.com/redis/ioredis/wiki/Upgrading-from-v4-to-v5)
+
+# Links
+
+- [API Documentation](https://redis.github.io/ioredis/) ([Redis](https://redis.github.io/ioredis/classes/Redis.html), [Cluster](https://redis.github.io/ioredis/classes/Cluster.html))
+- [Changelog](CHANGELOG.md)
+
+<hr>
+
+# Quick Start
+
+## Install
+
+```shell
+npm install ioredis
+```
+
+In a TypeScript project, you may want to add TypeScript declarations for Node.js:
+
+```shell
+npm install --save-dev @types/node
+```
+
+## Basic Usage
+
+```javascript
+// Import ioredis.
+// You can also use `import { Redis } from "ioredis"`
+// if your project is a TypeScript project,
+// Note that `import Redis from "ioredis"` is still supported,
+// but will be deprecated in the next major version.
+const Redis = require("ioredis");
+
+// Create a Redis instance.
+// By default, it will connect to localhost:6379.
+// We are going to cover how to specify connection options soon.
+const redis = new Redis();
+
+redis.set("mykey", "value"); // Returns a promise which resolves to "OK" when the command succeeds.
+
+// ioredis supports the node.js callback style
+redis.get("mykey", (err, result) => {
+  if (err) {
+    console.error(err);
+  } else {
+    console.log(result); // Prints "value"
+  }
+});
+
+// Or ioredis returns a promise if the last argument isn't a function
+redis.get("mykey").then((result) => {
+  console.log(result); // Prints "value"
+});
+
+redis.zadd("sortedSet", 1, "one", 2, "dos", 4, "quatro", 3, "three");
+redis.zrange("sortedSet", 0, 2, "WITHSCORES").then((elements) => {
+  // ["one", "1", "dos", "2", "three", "3"] as if the command was `redis> ZRANGE sortedSet 0 2 WITHSCORES`
+  console.log(elements);
+});
+
+// All arguments are passed directly to the redis server,
+// so technically ioredis supports all Redis commands.
+// The format is: redis[SOME_REDIS_COMMAND_IN_LOWERCASE](ARGUMENTS_ARE_JOINED_INTO_COMMAND_STRING)
+// so the following statement is equivalent to the CLI: `redis> SET mykey hello EX 10`
+redis.set("mykey", "hello", "EX", 10);
+```
+
+See the `examples/` folder for more examples. For example:
+
+- [TTL](examples/ttl.js)
+- [Strings](examples/string.js)
+- [Hashes](examples/hash.js)
+- [Lists](examples/list.js)
+- [Sets](examples/set.js)
+- [Sorted Sets](examples/zset.js)
+- [Streams](examples/stream.js)
+- [Redis Modules](examples/module.js) e.g. RedisJSON
+
+All Redis commands are supported. See [the documentation](https://redis.github.io/ioredis/classes/Redis.html) for details.
+
+## Connect to Redis
+
+When a new `Redis` instance is created,
+a connection to Redis will be created at the same time.
+You can specify which Redis to connect to by:
+
+```javascript
+new Redis(); // Connect to 127.0.0.1:6379
+new Redis(6380); // 127.0.0.1:6380
+new Redis(6379, "192.168.1.1"); // 192.168.1.1:6379
+new Redis("/tmp/redis.sock");
+new Redis({
+  port: 6379, // Redis port
+  host: "127.0.0.1", // Redis host
+  username: "default", // needs Redis >= 6
+  password: "my-top-secret",
+  db: 0, // Defaults to 0
+});
+```
+
+You can also specify connection options as a [`redis://` URL](http://www.iana.org/assignments/uri-schemes/prov/redis) or [`rediss://` URL](https://www.iana.org/assignments/uri-schemes/prov/rediss) when using [TLS encryption](#tls-options):
+
+```javascript
+// Connect to 127.0.0.1:6380, db 4, using password "authpassword":
+new Redis("redis://:authpassword@127.0.0.1:6380/4");
+
+// Username can also be passed via URI.
+new Redis("redis://username:authpassword@127.0.0.1:6380/4");
+```
+
+See [API Documentation](https://redis.github.io/ioredis/index.html#RedisOptions) for all available options.
+
+## Pub/Sub
+
+Redis provides several commands for developers to implement the [Publish–subscribe pattern](https://en.wikipedia.org/wiki/Publish%E2%80%93subscribe_pattern). There are two roles in this pattern: publisher and subscriber. Publishers are not programmed to send their messages to specific subscribers. Rather, published messages are characterized into channels, without knowledge of what (if any) subscribers there may be.
+
+By leveraging Node.js's built-in events module, ioredis makes pub/sub very straightforward to use. Below is a simple example that consists of two files, one is publisher.js that publishes messages to a channel, the other is subscriber.js that listens for messages on specific channels.
+
+```javascript
+// publisher.js
+
+const Redis = require("ioredis");
+const redis = new Redis();
+
+setInterval(() => {
+  const message = { foo: Math.random() };
+  // Publish to my-channel-1 or my-channel-2 randomly.
+  const channel = `my-channel-${1 + Math.round(Math.random())}`;
+
+  // Message can be either a string or a buffer
+  redis.publish(channel, JSON.stringify(message));
+  console.log("Published %s to %s", message, channel);
+}, 1000);
+```
+
+```javascript
+// subscriber.js
+
+const Redis = require("ioredis");
+const redis = new Redis();
+
+redis.subscribe("my-channel-1", "my-channel-2", (err, count) => {
+  if (err) {
+    // Just like other commands, subscribe() can fail for some reasons,
+    // ex network issues.
+    console.error("Failed to subscribe: %s", err.message);
+  } else {
+    // `count` represents the number of channels this client are currently subscribed to.
+    console.log(
+      `Subscribed successfully! This client is currently subscribed to ${count} channels.`
+    );
+  }
+});
+
+redis.on("message", (channel, message) => {
+  console.log(`Received ${message} from ${channel}`);
+});
+
+// There's also an event called 'messageBuffer', which is the same as 'message' except
+// it returns buffers instead of strings.
+// It's useful when the messages are binary data.
+redis.on("messageBuffer", (channel, message) => {
+  // Both `channel` and `message` are buffers.
+  console.log(channel, message);
+});
+```
+
+It's worth noticing that a connection (aka a `Redis` instance) can't play both roles at the same time. More specifically, when a client issues `subscribe()` or `psubscribe()`, it enters the "subscriber" mode. From that point, only commands that modify the subscription set are valid. Namely, they are: `subscribe`, `psubscribe`, `unsubscribe`, `punsubscribe`, `ping`, and `quit`. When the subscription set is empty (via `unsubscribe`/`punsubscribe`), the connection is put back into the regular mode.
+
+If you want to do pub/sub in the same file/process, you should create a separate connection:
+
+```javascript
+const Redis = require("ioredis");
+const sub = new Redis();
+const pub = new Redis();
+
+sub.subscribe(/* ... */); // From now, `sub` enters the subscriber mode.
+sub.on("message" /* ... */);
+
+setInterval(() => {
+  // `pub` can be used to publish messages, or send other regular commands (e.g. `hgetall`)
+  // because it's not in the subscriber mode.
+  pub.publish(/* ... */);
+}, 1000);
+```
+
+`PSUBSCRIBE` is also supported in a similar way when you want to subscribe all channels whose name matches a pattern:
+
+```javascript
+redis.psubscribe("pat?ern", (err, count) => {});
+
+// Event names are "pmessage"/"pmessageBuffer" instead of "message/messageBuffer".
+redis.on("pmessage", (pattern, channel, message) => {});
+redis.on("pmessageBuffer", (pattern, channel, message) => {});
+```
+
+## Streams
+
+Redis v5 introduces a new data type called streams. It doubles as a communication channel for building streaming architectures and as a log-like data structure for persisting data. With ioredis, the usage can be pretty straightforward. Say we have a producer publishes messages to a stream with `redis.xadd("mystream", "*", "randomValue", Math.random())` (You may find the [official documentation of Streams](https://redis.io/topics/streams-intro) as a starter to understand the parameters used), to consume the messages, we'll have a consumer with the following code:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis();
+
+const processMessage = (message) => {
+  console.log("Id: %s. Data: %O", message[0], message[1]);
+};
+
+async function listenForMessage(lastId = "$") {
+  // `results` is an array, each element of which corresponds to a key.
+  // Because we only listen to one key (mystream) here, `results` only contains
+  // a single element. See more: https://redis.io/commands/xread#return-value
+  const results = await redis.xread("BLOCK", 0, "STREAMS", "mystream", lastId);
+  const [key, messages] = results[0]; // `key` equals to "mystream"
+
+  messages.forEach(processMessage);
+
+  // Pass the last id of the results to the next round.
+  await listenForMessage(messages[messages.length - 1][0]);
+}
+
+listenForMessage();
+```
+
+## Expiration
+
+Redis can set a timeout to expire your key, after the timeout has expired the key will be automatically deleted. (You can find the [official Expire documentation](https://redis.io/commands/expire/) to understand better the different parameters you can use), to set your key to expire in 60 seconds, we will have the following code:
+
+```javascript
+redis.set("key", "data", "EX", 60);
+// Equivalent to redis command "SET key data EX 60", because on ioredis set method,
+// all arguments are passed directly to the redis server.
+```
+
+## Handle Binary Data
+
+Binary data support is out of the box. Pass buffers to send binary data:
+
+```javascript
+redis.set("foo", Buffer.from([0x62, 0x75, 0x66]));
+```
+
+Every command that returns a [bulk string](https://redis.io/docs/reference/protocol-spec/#resp-bulk-strings)
+has a variant command with a `Buffer` suffix. The variant command returns a buffer instead of a UTF-8 string:
+
+```javascript
+const result = await redis.getBuffer("foo");
+// result is `<Buffer 62 75 66>`
+```
+
+It's worth noticing that you don't need the `Buffer` suffix variant in order to **send** binary data. That means
+in most case you should just use `redis.set()` instead of `redis.setBuffer()` unless you want to get the old value
+with the `GET` parameter:
+
+```javascript
+const result = await redis.setBuffer("foo", "new value", "GET");
+// result is `<Buffer 62 75 66>` as `GET` indicates returning the old value.
+```
+
+## Pipelining
+
+If you want to send a batch of commands (e.g. > 5), you can use pipelining to queue
+the commands in memory and then send them to Redis all at once. This way the performance improves by 50%~300% (See [benchmark section](#benchmarks)).
+
+`redis.pipeline()` creates a `Pipeline` instance. You can call any Redis
+commands on it just like the `Redis` instance. The commands are queued in memory
+and flushed to Redis by calling the `exec` method:
+
+```javascript
+const pipeline = redis.pipeline();
+pipeline.set("foo", "bar");
+pipeline.del("cc");
+pipeline.exec((err, results) => {
+  // `err` is always null, and `results` is an array of responses
+  // corresponding to the sequence of queued commands.
+  // Each response follows the format `[err, result]`.
+});
+
+// You can even chain the commands:
+redis
+  .pipeline()
+  .set("foo", "bar")
+  .del("cc")
+  .exec((err, results) => {});
+
+// `exec` also returns a Promise:
+const promise = redis.pipeline().set("foo", "bar").get("foo").exec();
+promise.then((result) => {
+  // result === [[null, 'OK'], [null, 'bar']]
+});
+```
+
+Each chained command can also have a callback, which will be invoked when the command
+gets a reply:
+
+```javascript
+redis
+  .pipeline()
+  .set("foo", "bar")
+  .get("foo", (err, result) => {
+    // result === 'bar'
+  })
+  .exec((err, result) => {
+    // result[1][1] === 'bar'
+  });
+```
+
+In addition to adding commands to the `pipeline` queue individually, you can also pass an array of commands and arguments to the constructor:
+
+```javascript
+redis
+  .pipeline([
+    ["set", "foo", "bar"],
+    ["get", "foo"],
+  ])
+  .exec(() => {
+    /* ... */
+  });
+```
+
+`#length` property shows how many commands in the pipeline:
+
+```javascript
+const length = redis.pipeline().set("foo", "bar").get("foo").length;
+// length === 2
+```
+
+## Transaction
+
+Most of the time, the transaction commands `multi` & `exec` are used together with pipeline.
+Therefore, when `multi` is called, a `Pipeline` instance is created automatically by default,
+so you can use `multi` just like `pipeline`:
+
+```javascript
+redis
+  .multi()
+  .set("foo", "bar")
+  .get("foo")
+  .exec((err, results) => {
+    // results === [[null, 'OK'], [null, 'bar']]
+  });
+```
+
+If there's a syntax error in the transaction's command chain (e.g. wrong number of arguments, wrong command name, etc),
+then none of the commands would be executed, and an error is returned:
+
+```javascript
+redis
+  .multi()
+  .set("foo")
+  .set("foo", "new value")
+  .exec((err, results) => {
+    // err:
+    //  { [ReplyError: EXECABORT Transaction discarded because of previous errors.]
+    //    name: 'ReplyError',
+    //    message: 'EXECABORT Transaction discarded because of previous errors.',
+    //    command: { name: 'exec', args: [] },
+    //    previousErrors:
+    //     [ { [ReplyError: ERR wrong number of arguments for 'set' command]
+    //         name: 'ReplyError',
+    //         message: 'ERR wrong number of arguments for \'set\' command',
+    //         command: [Object] } ] }
+  });
+```
+
+In terms of the interface, `multi` differs from `pipeline` in that when specifying a callback
+to each chained command, the queueing state is passed to the callback instead of the result of the command:
+
+```javascript
+redis
+  .multi()
+  .set("foo", "bar", (err, result) => {
+    // result === 'QUEUED'
+  })
+  .exec(/* ... */);
+```
+
+If you want to use transaction without pipeline, pass `{ pipeline: false }` to `multi`,
+and every command will be sent to Redis immediately without waiting for an `exec` invocation:
+
+```javascript
+redis.multi({ pipeline: false });
+redis.set("foo", "bar");
+redis.get("foo");
+redis.exec((err, result) => {
+  // result === [[null, 'OK'], [null, 'bar']]
+});
+```
+
+The constructor of `multi` also accepts a batch of commands:
+
+```javascript
+redis
+  .multi([
+    ["set", "foo", "bar"],
+    ["get", "foo"],
+  ])
+  .exec(() => {
+    /* ... */
+  });
+```
+
+Inline transactions are supported by pipeline, which means you can group a subset of commands
+in the pipeline into a transaction:
+
+```javascript
+redis
+  .pipeline()
+  .get("foo")
+  .multi()
+  .set("foo", "bar")
+  .get("foo")
+  .exec()
+  .get("foo")
+  .exec();
+```
+
+## Lua Scripting
+
+ioredis supports all of the scripting commands such as `EVAL`, `EVALSHA` and `SCRIPT`.
+However, it's tedious to use in real world scenarios since developers have to take
+care of script caching and to detect when to use `EVAL` and when to use `EVALSHA`.
+ioredis exposes a `defineCommand` method to make scripting much easier to use:
+
+```javascript
+const redis = new Redis();
+
+// This will define a command myecho:
+redis.defineCommand("myecho", {
+  numberOfKeys: 2,
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Now `myecho` can be used just like any other ordinary command,
+// and ioredis will try to use `EVALSHA` internally when possible for better performance.
+redis.myecho("k1", "k2", "a1", "a2", (err, result) => {
+  // result === ['k1', 'k2', 'a1', 'a2']
+});
+
+// `myechoBuffer` is also defined automatically to return buffers instead of strings:
+redis.myechoBuffer("k1", "k2", "a1", "a2", (err, result) => {
+  // result[0] equals to Buffer.from('k1');
+});
+
+// And of course it works with pipeline:
+redis.pipeline().set("foo", "bar").myecho("k1", "k2", "a1", "a2").exec();
+```
+
+### Dynamic Keys
+
+If the number of keys can't be determined when defining a command, you can
+omit the `numberOfKeys` property and pass the number of keys as the first argument
+when you call the command:
+
+```javascript
+redis.defineCommand("echoDynamicKeyNumber", {
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Now you have to pass the number of keys as the first argument every time
+// you invoke the `echoDynamicKeyNumber` command:
+redis.echoDynamicKeyNumber(2, "k1", "k2", "a1", "a2", (err, result) => {
+  // result === ['k1', 'k2', 'a1', 'a2']
+});
+```
+
+### As Constructor Options
+
+Besides `defineCommand()`, you can also define custom commands with the `scripts` constructor option:
+
+```javascript
+const redis = new Redis({
+  scripts: {
+    myecho: {
+      numberOfKeys: 2,
+      lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+    },
+  },
+});
+```
+
+### TypeScript Usages
+
+You can refer to [the example](examples/typescript/scripts.ts) for how to declare your custom commands.
+
+## Transparent Key Prefixing
+
+This feature allows you to specify a string that will automatically be prepended
+to all the keys in a command, which makes it easier to manage your key
+namespaces.
+
+**Warning** This feature won't apply to commands like [KEYS](http://redis.io/commands/KEYS) and [SCAN](http://redis.io/commands/scan) that take patterns rather than actual keys([#239](https://github.com/redis/ioredis/issues/239)),
+and this feature also won't apply to the replies of commands even if they are key names ([#325](https://github.com/redis/ioredis/issues/325)).
+
+```javascript
+const fooRedis = new Redis({ keyPrefix: "foo:" });
+fooRedis.set("bar", "baz"); // Actually sends SET foo:bar baz
+
+fooRedis.defineCommand("myecho", {
+  numberOfKeys: 2,
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Works well with pipelining/transaction
+fooRedis
+  .pipeline()
+  // Sends SORT foo:list BY foo:weight_*->fieldname
+  .sort("list", "BY", "weight_*->fieldname")
+  // Supports custom commands
+  // Sends EVALSHA xxx foo:k1 foo:k2 a1 a2
+  .myecho("k1", "k2", "a1", "a2")
+  .exec();
+```
+
+## Transforming Arguments & Replies
+
+Most Redis commands take one or more Strings as arguments,
+and replies are sent back as a single String or an Array of Strings. However, sometimes
+you may want something different. For instance, it would be more convenient if the `HGETALL`
+command returns a hash (e.g. `{ key: val1, key2: v2 }`) rather than an array of key values (e.g. `[key1, val1, key2, val2]`).
+
+ioredis has a flexible system for transforming arguments and replies. There are two types
+of transformers, argument transformer and reply transformer:
+
+```javascript
+const Redis = require("ioredis");
+
+// Here's the built-in argument transformer converting
+// hmset('key', { k1: 'v1', k2: 'v2' })
+// or
+// hmset('key', new Map([['k1', 'v1'], ['k2', 'v2']]))
+// into
+// hmset('key', 'k1', 'v1', 'k2', 'v2')
+Redis.Command.setArgumentTransformer("hmset", (args) => {
+  if (args.length === 2) {
+    if (args[1] instanceof Map) {
+      // utils is a internal module of ioredis
+      return [args[0], ...utils.convertMapToArray(args[1])];
+    }
+    if (typeof args[1] === "object" && args[1] !== null) {
+      return [args[0], ...utils.convertObjectToArray(args[1])];
+    }
+  }
+  return args;
+});
+
+// Here's the built-in reply transformer converting the HGETALL reply
+// ['k1', 'v1', 'k2', 'v2']
+// into
+// { k1: 'v1', 'k2': 'v2' }
+Redis.Command.setReplyTransformer("hgetall", (result) => {
+  if (Array.isArray(result)) {
+    const obj = {};
+    for (let i = 0; i < result.length; i += 2) {
+      obj[result[i]] = result[i + 1];
+    }
+    return obj;
+  }
+  return result;
+});
+```
+
+There are three built-in transformers, two argument transformers for `hmset` & `mset` and
+a reply transformer for `hgetall`. Transformers for `hmset` and `hgetall` were mentioned
+above, and the transformer for `mset` is similar to the one for `hmset`:
+
+```javascript
+redis.mset({ k1: "v1", k2: "v2" });
+redis.get("k1", (err, result) => {
+  // result === 'v1';
+});
+
+redis.mset(
+  new Map([
+    ["k3", "v3"],
+    ["k4", "v4"],
+  ])
+);
+redis.get("k3", (err, result) => {
+  // result === 'v3';
+});
+```
+
+Another useful example of a reply transformer is one that changes `hgetall` to return array of arrays instead of objects which avoids an unwanted conversation of hash keys to strings when dealing with binary hash keys:
+
+```javascript
+Redis.Command.setReplyTransformer("hgetall", (result) => {
+  const arr = [];
+  for (let i = 0; i < result.length; i += 2) {
+    arr.push([result[i], result[i + 1]]);
+  }
+  return arr;
+});
+redis.hset("h1", Buffer.from([0x01]), Buffer.from([0x02]));
+redis.hset("h1", Buffer.from([0x03]), Buffer.from([0x04]));
+redis.hgetallBuffer("h1", (err, result) => {
+  // result === [ [ <Buffer 01>, <Buffer 02> ], [ <Buffer 03>, <Buffer 04> ] ];
+});
+```
+
+## Monitor
+
+Redis supports the MONITOR command,
+which lets you see all commands received by the Redis server across all client connections,
+including from other client libraries and other computers.
+
+The `monitor` method returns a monitor instance.
+After you send the MONITOR command, no other commands are valid on that connection. ioredis will emit a monitor event for every new monitor message that comes across.
+The callback for the monitor event takes a timestamp from the Redis server and an array of command arguments.
+
+Here is a simple example:
+
+```javascript
+redis.monitor((err, monitor) => {
+  monitor.on("monitor", (time, args, source, database) => {});
+});
+```
+
+Here is another example illustrating an `async` function and `monitor.disconnect()`:
+
+```javascript
+async () => {
+  const monitor = await redis.monitor();
+  monitor.on("monitor", console.log);
+  // Any other tasks
+  monitor.disconnect();
+};
+```
+
+## Streamify Scanning
+
+Redis 2.8 added the `SCAN` command to incrementally iterate through the keys in the database. It's different from `KEYS` in that
+`SCAN` only returns a small number of elements each call, so it can be used in production without the downside
+of blocking the server for a long time. However, it requires recording the cursor on the client side each time
+the `SCAN` command is called in order to iterate through all the keys correctly. Since it's a relatively common use case, ioredis
+provides a streaming interface for the `SCAN` command to make things much easier. A readable stream can be created by calling `scanStream`:
+
+```javascript
+const redis = new Redis();
+// Create a readable stream (object mode)
+const stream = redis.scanStream();
+stream.on("data", (resultKeys) => {
+  // `resultKeys` is an array of strings representing key names.
+  // Note that resultKeys may contain 0 keys, and that it will sometimes
+  // contain duplicates due to SCAN's implementation in Redis.
+  for (let i = 0; i < resultKeys.length; i++) {
+    console.log(resultKeys[i]);
+  }
+});
+stream.on("end", () => {
+  console.log("all keys have been visited");
+});
+```
+
+`scanStream` accepts an option, with which you can specify the `MATCH` pattern, the `TYPE` filter, and the `COUNT` argument:
+
+```javascript
+const stream = redis.scanStream({
+  // only returns keys following the pattern of `user:*`
+  match: "user:*",
+  // only return objects that match a given type,
+  // (requires Redis >= 6.0)
+  type: "zset",
+  // returns approximately 100 elements per call
+  count: 100,
+});
+```
+
+Just like other commands, `scanStream` has a binary version `scanBufferStream`, which returns an array of buffers. It's useful when
+the key names are not utf8 strings.
+
+There are also `hscanStream`, `zscanStream` and `sscanStream` to iterate through elements in a hash, zset and set. The interface of each is
+similar to `scanStream` except the first argument is the key name:
+
+```javascript
+const stream = redis.zscanStream("myhash", {
+  match: "age:??",
+});
+```
+The `hscanStream` also accepts the `noValues` option to specify whether Redis should return only the keys in the hash table without their corresponding values.
+```javascript
+const stream = redis.hscanStream("myhash", {
+  match: "age:??",
+  noValues: true,
+});
+```
+You can learn more from the [Redis documentation](http://redis.io/commands/scan).
+
+**Useful Tips**
+It's pretty common that doing an async task in the `data` handler. We'd like the scanning process to be paused until the async task to be finished. `Stream#pause()` and `Stream#resume()` do the trick. For example if we want to migrate data in Redis to MySQL:
+
+```javascript
+const stream = redis.scanStream();
+stream.on("data", (resultKeys) => {
+  // Pause the stream from scanning more keys until we've migrated the current keys.
+  stream.pause();
+
+  Promise.all(resultKeys.map(migrateKeyToMySQL)).then(() => {
+    // Resume the stream here.
+    stream.resume();
+  });
+});
+
+stream.on("end", () => {
+  console.log("done migration");
+});
+```
+
+## Auto-reconnect
+
+By default, ioredis will try to reconnect when the connection to Redis is lost
+except when the connection is closed manually by `redis.disconnect()` or `redis.quit()`.
+
+It's very flexible to control how long to wait to reconnect after disconnection
+using the `retryStrategy` option:
+
+```javascript
+const redis = new Redis({
+  // This is the default value of `retryStrategy`
+  retryStrategy(times) {
+    const delay = Math.min(times * 50, 2000);
+    return delay;
+  },
+});
+```
+
+`retryStrategy` is a function that will be called when the connection is lost.
+The argument `times` means this is the nth reconnection being made and
+the return value represents how long (in ms) to wait to reconnect. When the
+return value isn't a number, ioredis will stop trying to reconnect, and the connection
+will be lost forever if the user doesn't call `redis.connect()` manually.
+
+When reconnected, the client will auto subscribe to channels that the previous connection subscribed to.
+This behavior can be disabled by setting the `autoResubscribe` option to `false`.
+
+And if the previous connection has some unfulfilled commands (most likely blocking commands such as `brpop` and `blpop`),
+the client will resend them when reconnected. This behavior can be disabled by setting the `autoResendUnfulfilledCommands` option to `false`.
+
+By default, all pending commands will be flushed with an error every 20 retry attempts. That makes sure commands won't wait forever when the connection is down. You can change this behavior by setting `maxRetriesPerRequest`:
+
+```javascript
+const redis = new Redis({
+  maxRetriesPerRequest: 1,
+});
+```
+
+Set maxRetriesPerRequest to `null` to disable this behavior, and every command will wait forever until the connection is alive again (which is the default behavior before ioredis v4).
+
+### Blocking Command Timeout
+
+ioredis can apply a client-side timeout to blocking commands (such as `blpop`, `brpop`, `bzpopmin`, `bzmpop`, `blmpop`, `xread`, `xreadgroup`, etc.). This protects against scenarios where the TCP connection becomes a zombie (e.g., due to a silent network failure like a Docker network disconnect) and Redis never replies.
+
+This feature is **opt-in**. It is **disabled by default** and is only enabled
+when `blockingTimeout` is set to a positive number of milliseconds. If
+`blockingTimeout` is omitted, `0`, or negative (for example `-1`), ioredis
+does not arm any client-side timeouts for blocking commands and their
+behavior matches Redis exactly.
+
+```javascript
+const redis = new Redis({
+  blockingTimeout: 30000, // Enable blocking timeout protection
+});
+```
+
+When enabled:
+- For commands with a finite timeout (e.g., `blpop("key", 5)`), ioredis sets a client-side deadline based on the command's timeout plus a small grace period (`blockingTimeoutGrace`, default 100ms). If no reply arrives before the deadline, the command resolves with `null`—the same value Redis returns when a blocking command times out normally.
+- For commands that block forever (e.g., `timeout = 0` or `BLOCK 0`), the `blockingTimeout` value is used as a safety net.
+
+### Reconnect on Error
+
+Besides auto-reconnect when the connection is closed, ioredis supports reconnecting on certain Redis errors using the `reconnectOnError` option. Here's an example that will reconnect when receiving `READONLY` error:
+
+```javascript
+const redis = new Redis({
+  reconnectOnError(err) {
+    const targetError = "READONLY";
+    if (err.message.includes(targetError)) {
+      // Only reconnect when the error contains "READONLY"
+      return true; // or `return 1;`
+    }
+  },
+});
+```
+
+This feature is useful when using Amazon ElastiCache instances with Auto-failover disabled. On these instances, test your `reconnectOnError` handler by manually promoting the replica node to the primary role using the AWS console. The following writes fail with the error `READONLY`. Using `reconnectOnError`, we can force the connection to reconnect on this error in order to connect to the new master. Furthermore, if the `reconnectOnError` returns `2`, ioredis will resend the failed command after reconnecting.
+
+On ElastiCache instances with Auto-failover enabled, `reconnectOnError` does not execute. Instead of returning a Redis error, AWS closes all connections to the master endpoint until the new primary node is ready. ioredis reconnects via `retryStrategy` instead of `reconnectOnError` after about a minute. On ElastiCache instances with Auto-failover enabled, test failover events with the `Failover primary` option in the AWS console.
+
+## Connection Events
+
+The Redis instance will emit some events about the state of the connection to the Redis server.
+
+| Event        | Description                                                                                                                                                                                                                                     |
+| :----------- | :---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| connect      | emits when a connection is established to the Redis server.                                                                                                                                                                                     |
+| ready        | If `enableReadyCheck` is `true`, client will emit `ready` when the server reports that it is ready to receive commands (e.g. finish loading data from disk).<br>Otherwise, `ready` will be emitted immediately right after the `connect` event. |
+| error        | emits when an error occurs while connecting.<br>However, ioredis emits all `error` events silently (only emits when there's at least one listener) so that your application won't crash if you're not listening to the `error` event.<br>When `redis.connect()` is explicitly called the error will also be rejected from the returned promise, in addition to emitting it. If `redis.connect()` is not called explicitly and `lazyConnect` is true, ioredis will try to connect automatically on the first command and emit the `error` event silently.                                                      |
+| close        | emits when an established Redis server connection has closed.                                                                                                                                                                                   |
+| reconnecting | emits after `close` when a reconnection will be made. The argument of the event is the time (in ms) before reconnecting.                                                                                                                        |
+| end          | emits after `close` when no more reconnections will be made, or the connection is failed to establish.                                                                                                                                          |
+| wait         | emits when `lazyConnect` is set and will wait for the first command to be called before connecting.                                                                                                                                             |
+
+You can also check out the `Redis#status` property to get the current connection status.
+
+Besides the above connection events, there are several other custom events:
+
+| Event  | Description                                                         |
+| :----- | :------------------------------------------------------------------ |
+| select | emits when the database changed. The argument is the new db number. |
+
+## Offline Queue
+
+When a command can't be processed by Redis (being sent before the `ready` event), by default, it's added to the offline queue and will be
+executed when it can be processed. You can disable this feature by setting the `enableOfflineQueue`
+option to `false`:
+
+```javascript
+const redis = new Redis({ enableOfflineQueue: false });
+```
+
+## TLS Options
+
+Redis doesn't support TLS natively, however if the redis server you want to connect to is hosted behind a TLS proxy (e.g. [stunnel](https://www.stunnel.org/)) or is offered by a PaaS service that supports TLS connection (e.g. [Redis.com](https://redis.com/)), you can set the `tls` option:
+
+```javascript
+const redis = new Redis({
+  host: "localhost",
+  tls: {
+    // Refer to `tls.connect()` section in
+    // https://nodejs.org/api/tls.html
+    // for all supported options
+    ca: fs.readFileSync("cert.pem"),
+  },
+});
+```
+
+Alternatively, specify the connection through a [`rediss://` URL](https://www.iana.org/assignments/uri-schemes/prov/rediss).
+
+```javascript
+const redis = new Redis("rediss://redis.my-service.com");
+```
+
+If you do not want to use a connection string, you can also specify an empty `tls: {}` object:
+
+```javascript
+const redis = new Redis({
+  host: "redis.my-service.com",
+  tls: {},
+});
+```
+
+### TLS Profiles
+
+> **Warning**
+> TLS profiles described in this section are going to be deprecated in the next major version. Please provide TLS options explicitly.
+
+To make it easier to configure we provide a few pre-configured TLS profiles that can be specified by setting the `tls` option to the profile's name or specifying a `tls.profile` option in case you need to customize some values of the profile.
+
+Profiles:
+
+- `RedisCloudFixed`: Contains the CA for [Redis.com](https://redis.com/) Cloud fixed subscriptions
+- `RedisCloudFlexible`: Contains the CA for [Redis.com](https://redis.com/) Cloud flexible subscriptions
+
+```javascript
+const redis = new Redis({
+  host: "localhost",
+  tls: "RedisCloudFixed",
+});
+
+const redisWithClientCertificate = new Redis({
+  host: "localhost",
+  tls: {
+    profile: "RedisCloudFixed",
+    key: "123",
+  },
+});
+```
+
+<hr>
+
+## Sentinel
+
+ioredis supports Sentinel out of the box. It works transparently as all features that work when
+you connect to a single node also work when you connect to a sentinel group. Make sure to run Redis >= 2.8.12 if you want to use this feature. Sentinels have a default port of 26379.
+
+To connect using Sentinel, use:
+
+```javascript
+const redis = new Redis({
+  sentinels: [
+    { host: "localhost", port: 26379 },
+    { host: "localhost", port: 26380 },
+  ],
+  name: "mymaster",
+});
+
+redis.set("foo", "bar");
+```
+
+The arguments passed to the constructor are different from the ones you use to connect to a single node, where:
+
+- `name` identifies a group of Redis instances composed of a master and one or more slaves (`mymaster` in the example);
+- `sentinelPassword` (optional) password for Sentinel instances.
+- `sentinels` are a list of sentinels to connect to. The list does not need to enumerate all your sentinel instances, but a few so that if one is down the client will try the next one.
+- `role` (optional) with a value of `slave` will return a random slave from the Sentinel group.
+- `preferredSlaves` (optional) can be used to prefer a particular slave or set of slaves based on priority. It accepts a function or array.
+- `enableTLSForSentinelMode` (optional) set to true if connecting to sentinel instances that are encrypted
+
+ioredis **guarantees** that the node you connected to is always a master even after a failover. When a failover happens, instead of trying to reconnect to the failed node (which will be demoted to slave when it's available again), ioredis will ask sentinels for the new master node and connect to it. All commands sent during the failover are queued and will be executed when the new connection is established so that none of the commands will be lost.
+
+It's possible to connect to a slave instead of a master by specifying the option `role` with the value of `slave` and ioredis will try to connect to a random slave of the specified master, with the guarantee that the connected node is always a slave. If the current node is promoted to master due to a failover, ioredis will disconnect from it and ask the sentinels for another slave node to connect to.
+
+If you specify the option `preferredSlaves` along with `role: 'slave'` ioredis will attempt to use this value when selecting the slave from the pool of available slaves. The value of `preferredSlaves` should either be a function that accepts an array of available slaves and returns a single result, or an array of slave values priorities by the lowest `prio` value first with a default value of `1`.
+
+```javascript
+// available slaves format
+const availableSlaves = [{ ip: "127.0.0.1", port: "31231", flags: "slave" }];
+
+// preferredSlaves array format
+let preferredSlaves = [
+  { ip: "127.0.0.1", port: "31231", prio: 1 },
+  { ip: "127.0.0.1", port: "31232", prio: 2 },
+];
+
+// preferredSlaves function format
+preferredSlaves = function (availableSlaves) {
+  for (let i = 0; i < availableSlaves.length; i++) {
+    const slave = availableSlaves[i];
+    if (slave.ip === "127.0.0.1") {
+      if (slave.port === "31234") {
+        return slave;
+      }
+    }
+  }
+  // if no preferred slaves are available a random one is used
+  return false;
+};
+
+const redis = new Redis({
+  sentinels: [
+    { host: "127.0.0.1", port: 26379 },
+    { host: "127.0.0.1", port: 26380 },
+  ],
+  name: "mymaster",
+  role: "slave",
+  preferredSlaves: preferredSlaves,
+});
+```
+
+Besides the `retryStrategy` option, there's also a `sentinelRetryStrategy` in Sentinel mode which will be invoked when all the sentinel nodes are unreachable during connecting. If `sentinelRetryStrategy` returns a valid delay time, ioredis will try to reconnect from scratch. The default value of `sentinelRetryStrategy` is:
+
+```javascript
+function (times) {
+  const delay = Math.min(times * 10, 1000);
+  return delay;
+}
+```
+
+## Cluster
+
+Redis Cluster provides a way to run a Redis installation where data is automatically sharded across multiple Redis nodes.
+You can connect to a Redis Cluster like this:
+
+```javascript
+const Redis = require("ioredis");
+
+const cluster = new Redis.Cluster([
+  {
+    port: 6380,
+    host: "127.0.0.1",
+  },
+  {
+    port: 6381,
+    host: "127.0.0.1",
+  },
+]);
+
+cluster.set("foo", "bar");
+cluster.get("foo", (err, res) => {
+  // res === 'bar'
+});
+```
+
+`Cluster` constructor accepts two arguments, where:
+
+0.  The first argument is a list of nodes of the cluster you want to connect to.
+    Just like Sentinel, the list does not need to enumerate all your cluster nodes,
+    but a few so that if one is unreachable the client will try the next one, and the client will discover other nodes automatically when at least one node is connected.
+1.  The second argument is the options, where:
+
+    - `clusterRetryStrategy`: When none of the startup nodes are reachable, `clusterRetryStrategy` will be invoked. When a number is returned,
+      ioredis will try to reconnect to the startup nodes from scratch after the specified delay (in ms). Otherwise, an error of "None of startup nodes is available" will be returned.
+      The default value of this option is:
+
+      ```javascript
+      function (times) {
+        const delay = Math.min(100 + times * 2, 2000);
+        return delay;
+      }
+      ```
+
+      It's possible to modify the `startupNodes` property in order to switch to another set of nodes here:
+
+      ```javascript
+      function (times) {
+        this.startupNodes = [{ port: 6790, host: '127.0.0.1' }];
+        return Math.min(100 + times * 2, 2000);
+      }
+      ```
+
+    - `dnsLookup`: Alternative DNS lookup function (`dns.lookup()` is used by default). It may be useful to override this in special cases, such as when AWS ElastiCache used with TLS enabled.
+    - `enableOfflineQueue`: Similar to the `enableOfflineQueue` option of `Redis` class.
+    - `enableReadyCheck`: When enabled, "ready" event will only be emitted when `CLUSTER INFO` command
+      reporting the cluster is ready for handling commands. Otherwise, it will be emitted immediately after "connect" is emitted.
+    - `scaleReads`: Config where to send the read queries. See below for more details.
+    - `maxRedirections`: When a cluster related error (e.g. `MOVED`, `ASK` and `CLUSTERDOWN` etc.) is received, the client will redirect the
+      command to another node. This option limits the max redirections allowed when sending a command. The default value is `16`.
+    - `retryDelayOnFailover`: If the target node is disconnected when sending a command,
+      ioredis will retry after the specified delay. The default value is `100`. You should make sure `retryDelayOnFailover * maxRedirections > cluster-node-timeout`
+      to insure that no command will fail during a failover.
+    - `retryDelayOnClusterDown`: When a cluster is down, all commands will be rejected with the error of `CLUSTERDOWN`. If this option is a number (by default, it is `100`), the client
+      will resend the commands after the specified time (in ms).
+    - `retryDelayOnTryAgain`: If this option is a number (by default, it is `100`), the client
+      will resend the commands rejected with `TRYAGAIN` error after the specified time (in ms).
+    - `retryDelayOnMoved`: By default, this value is `0` (in ms), which means when a `MOVED` error is received, the client will resend
+      the command instantly to the node returned together with the `MOVED` error. However, sometimes it takes time for a cluster to become
+      state stabilized after a failover, so adding a delay before resending can prevent a ping pong effect.
+    - `redisOptions`: Default options passed to the constructor of `Redis` when connecting to a node.
+    - `slotsRefreshTimeout`: Milliseconds before a timeout occurs while refreshing slots from the cluster (default `1000`).
+    - `slotsRefreshInterval`: Milliseconds between every automatic slots refresh (by default, it is disabled).
+
+### Read-Write Splitting
+
+A typical redis cluster contains three or more masters and several slaves for each master. It's possible to scale out redis cluster by sending read queries to slaves and write queries to masters by setting the `scaleReads` option.
+
+`scaleReads` is "master" by default, which means ioredis will never send any queries to slaves. There are other three available options:
+
+1. "all": Send write queries to masters and read queries to masters or slaves randomly.
+2. "slave": Send write queries to masters and read queries to slaves.
+3. a custom `function(nodes, command): node`: Will choose the custom function to select to which node to send read queries (write queries keep being sent to master). The first node in `nodes` is always the master serving the relevant slots. If the function returns an array of nodes, a random node of that list will be selected.
+
+For example:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    /* nodes */
+  ],
+  {
+    scaleReads: "slave",
+  }
+);
+cluster.set("foo", "bar"); // This query will be sent to one of the masters.
+cluster.get("foo", (err, res) => {
+  // This query will be sent to one of the slaves.
+});
+```
+
+**NB** In the code snippet above, the `res` may not be equal to "bar" because of the lag of replication between the master and slaves.
+
+### Running Commands to Multiple Nodes
+
+Every command will be sent to exactly one node. For commands containing keys, (e.g. `GET`, `SET` and `HGETALL`), ioredis sends them to the node that serving the keys, and for other commands not containing keys, (e.g. `INFO`, `KEYS` and `FLUSHDB`), ioredis sends them to a random node.
+
+Sometimes you may want to send a command to multiple nodes (masters or slaves) of the cluster, you can get the nodes via `Cluster#nodes()` method.
+
+`Cluster#nodes()` accepts a parameter role, which can be "master", "slave" and "all" (default), and returns an array of `Redis` instance. For example:
+
+```javascript
+// Send `FLUSHDB` command to all slaves:
+const slaves = cluster.nodes("slave");
+Promise.all(slaves.map((node) => node.flushdb()));
+
+// Get keys of all the masters:
+const masters = cluster.nodes("master");
+Promise.all(
+  masters
+    .map((node) => node.keys())
+    .then((keys) => {
+      // keys: [['key1', 'key2'], ['key3', 'key4']]
+    })
+);
+```
+
+### NAT Mapping
+
+Sometimes the cluster is hosted within a internal network that can only be accessed via a NAT (Network Address Translation) instance. See [Accessing ElastiCache from outside AWS](https://docs.aws.amazon.com/AmazonElastiCache/latest/red-ug/accessing-elasticache.html) as an example.
+
+You can specify nat mapping rules via `natMap` option:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "203.0.113.73",
+      port: 30001,
+    },
+  ],
+  {
+    natMap: {
+      "10.0.1.230:30001": { host: "203.0.113.73", port: 30001 },
+      "10.0.1.231:30001": { host: "203.0.113.73", port: 30002 },
+      "10.0.1.232:30001": { host: "203.0.113.73", port: 30003 },
+    },
+  }
+);
+```
+
+Or you can specify this parameter through function:
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "203.0.113.73",
+      port: 30001,
+    },
+  ],
+  {
+    natMap: (key) => {
+      if(key.includes('30001')) {
+        return { host: "203.0.113.73", port: 30001 };
+      }
+
+      return null;
+    },
+  }
+);
+```
+
+This option is also useful when the cluster is running inside a Docker container.
+Also it works for Clusters in cloud infrastructure where cluster nodes connected through dedicated subnet.
+
+Specifying through may be useful if you don't know concrete internal host and know only node port.
+
+### Transaction and Pipeline in Cluster Mode
+
+Almost all features that are supported by `Redis` are also supported by `Redis.Cluster`, e.g. custom commands, transaction and pipeline.
+However there are some differences when using transaction and pipeline in Cluster mode:
+
+0. All keys in a pipeline should belong to slots served by the same node, since ioredis sends all commands in a pipeline to the same node.
+1. You can't use `multi` without pipeline (aka `cluster.multi({ pipeline: false })`). This is because when you call `cluster.multi({ pipeline: false })`, ioredis doesn't know which node the `multi` command should be sent to.
+
+When any commands in a pipeline receives a `MOVED` or `ASK` error, ioredis will resend the whole pipeline to the specified node automatically if all of the following conditions are satisfied:
+
+0. All errors received in the pipeline are the same. For example, we won't resend the pipeline if we got two `MOVED` errors pointing to different nodes.
+1. All commands executed successfully are readonly commands. This makes sure that resending the pipeline won't have side effects.
+
+### Pub/Sub
+
+Pub/Sub in cluster mode works exactly as the same as in standalone mode. Internally, when a node of the cluster receives a message, it will broadcast the message to the other nodes. ioredis makes sure that each message will only be received once by strictly subscribing one node at the same time.
+
+```javascript
+const nodes = [
+  /* nodes */
+];
+const pub = new Redis.Cluster(nodes);
+const sub = new Redis.Cluster(nodes);
+sub.on("message", (channel, message) => {
+  console.log(channel, message);
+});
+
+sub.subscribe("news", () => {
+  pub.publish("news", "highlights");
+});
+```
+
+### Sharded Pub/Sub
+
+For sharded Pub/Sub, use the `spublish` and `ssubscribe` commands instead of the traditional `publish` and `subscribe`. With the old commands, the Redis cluster handles message propagation behind the scenes, allowing you to publish or subscribe to any node without considering sharding. However, this approach has scalability limitations that are addressed with sharded Pub/Sub. Here’s what you need to know:
+
+1. Instead of a single subscriber connection, there is now one subscriber connection per shard. Because of the potential overhead, you can enable or disable the use of the cluster subscriber group with the `shardedSubscribers` option. By default, this option is set to `false`, meaning sharded subscriptions are disabled. You should enable this option when establishing your cluster connection before using `ssubscribe`.
+2. All channel names that you pass to a single `ssubscribe` need to map to the same hash slot. You can call `ssubscribe` multiple times on the same cluster client instance to subscribe to channels across slots. The cluster's subscriber group takes care of forwarding the `ssubscribe` command to the shard that is responsible for the channels.
+
+The following basic example shows you how to use sharded Pub/Sub:
+
+```javascript
+const cluster: Cluster = new Cluster([{host: host, port: port}], {shardedSubscribers: true});
+
+//Register the callback
+cluster.on("smessage", (channel, message) => {
+    console.log(message);
+});
+
+
+//Subscribe to the channels on the same slot
+cluster.ssubscribe("channel{my}:1", "channel{my}:2").then( ( count: number ) => {
+    console.log(count);
+}).catch( (err) => {
+    console.log(err);
+});
+
+//Publish a message
+cluster.spublish("channel{my}:1", "This is a test message to my first channel.").then((value: number) => {
+    console.log("Published a message to channel{my}:1");
+});
+```
+
+
+### Events
+
+| Event        | Description                                                                                                                                                                                                |
+| :----------- | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| connect      | emits when a connection is established to the Redis server.                                                                                                                                                |
+| ready        | emits when `CLUSTER INFO` reporting the cluster is able to receive commands (if `enableReadyCheck` is `true`) or immediately after `connect` event (if `enableReadyCheck` is false).                       |
+| error        | emits when an error occurs while connecting with a property of `lastNodeError` representing the last node error received. This event is emitted silently (only emitting if there's at least one listener). |
+| close        | emits when an established Redis server connection has closed.                                                                                                                                              |
+| reconnecting | emits after `close` when a reconnection will be made. The argument of the event is the time (in ms) before reconnecting.                                                                                   |
+| end          | emits after `close` when no more reconnections will be made.                                                                                                                                               |
+| +node        | emits when a new node is connected.                                                                                                                                                                        |
+| -node        | emits when a node is disconnected.                                                                                                                                                                         |
+| node error   | emits when an error occurs when connecting to a node. The second argument indicates the address of the node.                                                                                               |
+
+### Password
+
+Setting the `password` option to access password-protected clusters:
+
+```javascript
+const Redis = require("ioredis");
+const cluster = new Redis.Cluster(nodes, {
+  redisOptions: {
+    password: "your-cluster-password",
+  },
+});
+```
+
+If some of nodes in the cluster using a different password, you should specify them in the first parameter:
+
+```javascript
+const Redis = require("ioredis");
+const cluster = new Redis.Cluster(
+  [
+    // Use password "password-for-30001" for 30001
+    { port: 30001, password: "password-for-30001" },
+    // Don't use password when accessing 30002
+    { port: 30002, password: null },
+    // Other nodes will use "fallback-password"
+  ],
+  {
+    redisOptions: {
+      password: "fallback-password",
+    },
+  }
+);
+```
+
+### Special Note: Aws Elasticache Clusters with TLS
+
+AWS ElastiCache for Redis (Clustered Mode) supports TLS encryption. If you use
+this, you may encounter errors with invalid certificates. To resolve this
+issue, construct the `Cluster` with the `dnsLookup` option as follows:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "clustercfg.myCluster.abcdefg.xyz.cache.amazonaws.com",
+      port: 6379,
+    },
+  ],
+  {
+    dnsLookup: (address, callback) => callback(null, address),
+    redisOptions: {
+      tls: {},
+    },
+  }
+);
+```
+
+<hr>
+
+## Autopipelining
+
+In standard mode, when you issue multiple commands, ioredis sends them to the server one by one. As described in Redis pipeline documentation, this is a suboptimal use of the network link, especially when such link is not very performant.
+
+The TCP and network overhead negatively affects performance. Commands are stuck in the send queue until the previous ones are correctly delivered to the server. This is a problem known as Head-Of-Line blocking (HOL).
+
+ioredis supports a feature called “auto pipelining”. It can be enabled by setting the option `enableAutoPipelining` to `true`. No other code change is necessary.
+
+In auto pipelining mode, all commands issued during an event loop are enqueued in a pipeline automatically managed by ioredis. At the end of the iteration, the pipeline is executed and thus all commands are sent to the server at the same time.
+
+This feature can dramatically improve throughput and avoids HOL blocking. In our benchmarks, the improvement was between 35% and 50%.
+
+While an automatic pipeline is executing, all new commands will be enqueued in a new pipeline which will be executed as soon as the previous finishes.
+
+When using Redis Cluster, one pipeline per node is created. Commands are assigned to pipelines according to which node serves the slot.
+
+A pipeline will thus contain commands using different slots but that ultimately are assigned to the same node.
+
+Note that the same slot limitation within a single command still holds, as it is a Redis limitation.
+
+### Example of Automatic Pipeline Enqueuing
+
+This sample code uses ioredis with automatic pipeline enabled.
+
+```javascript
+const Redis = require("./built");
+const http = require("http");
+
+const db = new Redis({ enableAutoPipelining: true });
+
+const server = http.createServer((request, response) => {
+  const key = new URL(request.url, "https://localhost:3000/").searchParams.get(
+    "key"
+  );
+
+  db.get(key, (err, value) => {
+    response.writeHead(200, { "Content-Type": "text/plain" });
+    response.end(value);
+  });
+});
+
+server.listen(3000);
+```
+
+When Node receives requests, it schedules them to be processed in one or more iterations of the events loop.
+
+All commands issued by requests processing during one iteration of the loop will be wrapped in a pipeline automatically created by ioredis.
+
+In the example above, the pipeline will have the following contents:
+
+```
+GET key1
+GET key2
+GET key3
+...
+GET keyN
+```
+
+When all events in the current loop have been processed, the pipeline is executed and thus all commands are sent to the server at the same time.
+
+While waiting for pipeline response from Redis, Node will still be able to process requests. All commands issued by request handler will be enqueued in a new automatically created pipeline. This pipeline will not be sent to the server yet.
+
+As soon as a previous automatic pipeline has received all responses from the server, the new pipeline is immediately sent without waiting for the events loop iteration to finish.
+
+This approach increases the utilization of the network link, reduces the TCP overhead and idle times and therefore improves throughput.
+
+### Benchmarks
+
+Here's some of the results of our tests for a single node.
+
+Each iteration of the test runs 1000 random commands on the server.
+
+|                           | Samples | Result        | Tolerance |
+| ------------------------- | ------- | ------------- | --------- |
+| default                   | 1000    | 174.62 op/sec | ± 0.45 %  |
+| enableAutoPipelining=true | 1500    | 233.33 op/sec | ± 0.88 %  |
+
+And here's the same test for a cluster of 3 masters and 3 replicas:
+
+|                           | Samples | Result        | Tolerance |
+| ------------------------- | ------- | ------------- | --------- |
+| default                   | 1000    | 164.05 op/sec | ± 0.42 %  |
+| enableAutoPipelining=true | 3000    | 235.31 op/sec | ± 0.94 %  |
+
+# Error Handling
+
+All the errors returned by the Redis server are instances of `ReplyError`, which can be accessed via `Redis`:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis();
+// This command causes a reply error since the SET command requires two arguments.
+redis.set("foo", (err) => {
+  err instanceof Redis.ReplyError;
+});
+```
+
+This is the error stack of the `ReplyError`:
+
+```
+ReplyError: ERR wrong number of arguments for 'set' command
+    at ReplyParser._parseResult (/app/node_modules/ioredis/lib/parsers/javascript.js:60:14)
+    at ReplyParser.execute (/app/node_modules/ioredis/lib/parsers/javascript.js:178:20)
+    at Socket.<anonymous> (/app/node_modules/ioredis/lib/redis/event_handler.js:99:22)
+    at Socket.emit (events.js:97:17)
+    at readableAddChunk (_stream_readable.js:143:16)
+    at Socket.Readable.push (_stream_readable.js:106:10)
+    at TCP.onread (net.js:509:20)
+```
+
+By default, the error stack doesn't make any sense because the whole stack happens in the ioredis
+module itself, not in your code. So it's not easy to find out where the error happens in your code.
+ioredis provides an option `showFriendlyErrorStack` to solve the problem. When you enable
+`showFriendlyErrorStack`, ioredis will optimize the error stack for you:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis({ showFriendlyErrorStack: true });
+redis.set("foo");
+```
+
+And the output will be:
+
+```
+ReplyError: ERR wrong number of arguments for 'set' command
+    at Object.<anonymous> (/app/index.js:3:7)
+    at Module._compile (module.js:446:26)
+    at Object.Module._extensions..js (module.js:464:10)
+    at Module.load (module.js:341:32)
+    at Function.Module._load (module.js:296:12)
+    at Function.Module.runMain (module.js:487:10)
+    at startup (node.js:111:16)
+    at node.js:799:3
+```
+
+This time the stack tells you that the error happens on the third line in your code. Pretty sweet!
+However, it would decrease the performance significantly to optimize the error stack. So by
+default, this option is disabled and can only be used for debugging purposes. You **shouldn't** use this feature in a production environment.
+
+# Running tests
+
+Start a Redis server on 127.0.0.1:6379, and then:
+
+```shell
+npm test
+```
+
+`FLUSH ALL` will be invoked after each test, so make sure there's no valuable data in it before running tests.
+
+If your testing environment does not let you spin up a Redis server [ioredis-mock](https://github.com/stipsan/ioredis-mock) is a drop-in replacement you can use in your tests. It aims to behave identically to ioredis connected to a Redis server so that your integration tests is easier to write and of better quality.
+
+# Debug
+
+You can set the `DEBUG` env to `ioredis:*` to print debug info:
+
+```shell
+$ DEBUG=ioredis:* node app.js
+```
+
+# Join in!
+
+I'm happy to receive bug reports, fixes, documentation enhancements, and any other improvements.
+
+And since I'm not a native English speaker, if you find any grammar mistakes in the documentation, please also let me know. :)
+
+# Contributors
+
+This project exists thanks to all the people who contribute:
+
+<a href="https://github.com/redis/ioredis/graphs/contributors"><img src="https://opencollective.com/ioredis/contributors.svg?width=890&showBtn=false" /></a>
+
+# License
+
+MIT
+
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fluin%2Fioredis.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2Fluin%2Fioredis?ref=badge_large)
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Command.d.ts b/node_modules/bullmq/node_modules/ioredis/built/Command.d.ts
new file mode 100644
index 0000000..1121bb8
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Command.d.ts
@@ -0,0 +1,165 @@
+/// <reference types="node" />
+import { Callback, Respondable, CommandParameter } from "./types";
+export declare type ArgumentType = string | Buffer | number | (string | Buffer | number | any[])[];
+interface CommandOptions {
+    /**
+     * Set the encoding of the reply, by default buffer will be returned.
+     */
+    replyEncoding?: BufferEncoding | null;
+    errorStack?: Error;
+    keyPrefix?: string;
+    /**
+     * Force the command to be readOnly so it will also execute on slaves
+     */
+    readOnly?: boolean;
+}
+declare type ArgumentTransformer = (args: any[]) => any[];
+declare type ReplyTransformer = (reply: any) => any;
+export interface CommandNameFlags {
+    VALID_IN_SUBSCRIBER_MODE: [
+        "subscribe",
+        "psubscribe",
+        "unsubscribe",
+        "punsubscribe",
+        "ssubscribe",
+        "sunsubscribe",
+        "ping",
+        "quit"
+    ];
+    VALID_IN_MONITOR_MODE: ["monitor", "auth"];
+    ENTER_SUBSCRIBER_MODE: ["subscribe", "psubscribe", "ssubscribe"];
+    EXIT_SUBSCRIBER_MODE: ["unsubscribe", "punsubscribe", "sunsubscribe"];
+    WILL_DISCONNECT: ["quit"];
+    HANDSHAKE_COMMANDS: ["auth", "select", "client", "readonly", "info"];
+    IGNORE_RECONNECT_ON_ERROR: ["client"];
+    BLOCKING_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+        "bzmpop",
+        "blmpop",
+        "xread",
+        "xreadgroup"
+    ];
+    LAST_ARG_TIMEOUT_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax"
+    ];
+    FIRST_ARG_TIMEOUT_COMMANDS: ["bzmpop", "blmpop"];
+    BLOCK_OPTION_COMMANDS: ["xread", "xreadgroup"];
+}
+/**
+ * Command instance
+ *
+ * It's rare that you need to create a Command instance yourself.
+ *
+ * ```js
+ * var infoCommand = new Command('info', null, function (err, result) {
+ *   console.log('result', result);
+ * });
+ *
+ * redis.sendCommand(infoCommand);
+ *
+ * // When no callback provided, Command instance will have a `promise` property,
+ * // which will resolve/reject with the result of the command.
+ * var getCommand = new Command('get', ['foo']);
+ * getCommand.promise.then(function (result) {
+ *   console.log('result', result);
+ * });
+ * ```
+ */
+export default class Command implements Respondable {
+    name: string;
+    static FLAGS: {
+        [key in keyof CommandNameFlags]: CommandNameFlags[key];
+    };
+    private static flagMap?;
+    private static _transformer;
+    /**
+     * Check whether the command has the flag
+     */
+    static checkFlag<T extends keyof CommandNameFlags>(flagName: T, commandName: string): commandName is CommandNameFlags[T][number];
+    static setArgumentTransformer(name: string, func: ArgumentTransformer): void;
+    static setReplyTransformer(name: string, func: ReplyTransformer): void;
+    private static getFlagMap;
+    ignore?: boolean;
+    isReadOnly?: boolean;
+    args: CommandParameter[];
+    inTransaction: boolean;
+    pipelineIndex?: number;
+    isResolved: boolean;
+    reject: (err: Error) => void;
+    resolve: (result: any) => void;
+    promise: Promise<any>;
+    private replyEncoding;
+    private errorStack;
+    private bufferMode;
+    private callback;
+    private transformed;
+    private _commandTimeoutTimer?;
+    private _blockingTimeoutTimer?;
+    private _blockingDeadline?;
+    private slot?;
+    private keys?;
+    /**
+     * Creates an instance of Command.
+     * @param name Command name
+     * @param args An array of command arguments
+     * @param options
+     * @param callback The callback that handles the response.
+     * If omit, the response will be handled via Promise
+     */
+    constructor(name: string, args?: Array<ArgumentType>, options?: CommandOptions, callback?: Callback);
+    getSlot(): number;
+    getKeys(): Array<string | Buffer>;
+    /**
+     * Convert command to writable buffer or string
+     */
+    toWritable(_socket: object): string | Buffer;
+    stringifyArguments(): void;
+    /**
+     * Convert buffer/buffer[] to string/string[],
+     * and apply reply transformer.
+     */
+    transformReply(result: Buffer | Buffer[]): string | string[] | Buffer | Buffer[];
+    /**
+     * Set the wait time before terminating the attempt to execute a command
+     * and generating an error.
+     */
+    setTimeout(ms: number): void;
+    /**
+     * Set a timeout for blocking commands.
+     * When the timeout expires, the command resolves with null (matching Redis behavior).
+     * This handles the case of undetectable network failures (e.g., docker network disconnect)
+     * where the TCP connection becomes a zombie and no close event fires.
+     */
+    setBlockingTimeout(ms: number): void;
+    /**
+     * Extract the blocking timeout from the command arguments.
+     *
+     * @returns The timeout in seconds, null for indefinite blocking (timeout of 0),
+     *          or undefined if this is not a blocking command
+     */
+    extractBlockingTimeout(): number | null | undefined;
+    /**
+     * Clear the command and blocking timers
+     */
+    private _clearTimers;
+    private initPromise;
+    /**
+     * Iterate through the command arguments that are considered keys.
+     */
+    private _iterateKeys;
+    /**
+     * Convert the value from buffer to the target encoding.
+     */
+    private _convertValue;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Command.js b/node_modules/bullmq/node_modules/ioredis/built/Command.js
new file mode 100644
index 0000000..5069820
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Command.js
@@ -0,0 +1,449 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const calculateSlot = require("cluster-key-slot");
+const standard_as_callback_1 = require("standard-as-callback");
+const utils_1 = require("./utils");
+const argumentParsers_1 = require("./utils/argumentParsers");
+/**
+ * Command instance
+ *
+ * It's rare that you need to create a Command instance yourself.
+ *
+ * ```js
+ * var infoCommand = new Command('info', null, function (err, result) {
+ *   console.log('result', result);
+ * });
+ *
+ * redis.sendCommand(infoCommand);
+ *
+ * // When no callback provided, Command instance will have a `promise` property,
+ * // which will resolve/reject with the result of the command.
+ * var getCommand = new Command('get', ['foo']);
+ * getCommand.promise.then(function (result) {
+ *   console.log('result', result);
+ * });
+ * ```
+ */
+class Command {
+    /**
+     * Creates an instance of Command.
+     * @param name Command name
+     * @param args An array of command arguments
+     * @param options
+     * @param callback The callback that handles the response.
+     * If omit, the response will be handled via Promise
+     */
+    constructor(name, args = [], options = {}, callback) {
+        this.name = name;
+        this.inTransaction = false;
+        this.isResolved = false;
+        this.transformed = false;
+        this.replyEncoding = options.replyEncoding;
+        this.errorStack = options.errorStack;
+        this.args = args.flat();
+        this.callback = callback;
+        this.initPromise();
+        if (options.keyPrefix) {
+            // @ts-expect-error
+            const isBufferKeyPrefix = options.keyPrefix instanceof Buffer;
+            // @ts-expect-error
+            let keyPrefixBuffer = isBufferKeyPrefix
+                ? options.keyPrefix
+                : null;
+            this._iterateKeys((key) => {
+                if (key instanceof Buffer) {
+                    if (keyPrefixBuffer === null) {
+                        keyPrefixBuffer = Buffer.from(options.keyPrefix);
+                    }
+                    return Buffer.concat([keyPrefixBuffer, key]);
+                }
+                else if (isBufferKeyPrefix) {
+                    // @ts-expect-error
+                    return Buffer.concat([options.keyPrefix, Buffer.from(String(key))]);
+                }
+                return options.keyPrefix + key;
+            });
+        }
+        if (options.readOnly) {
+            this.isReadOnly = true;
+        }
+    }
+    /**
+     * Check whether the command has the flag
+     */
+    static checkFlag(flagName, commandName) {
+        commandName = commandName.toLowerCase();
+        return !!this.getFlagMap()[flagName][commandName];
+    }
+    static setArgumentTransformer(name, func) {
+        this._transformer.argument[name] = func;
+    }
+    static setReplyTransformer(name, func) {
+        this._transformer.reply[name] = func;
+    }
+    static getFlagMap() {
+        if (!this.flagMap) {
+            this.flagMap = Object.keys(Command.FLAGS).reduce((map, flagName) => {
+                map[flagName] = {};
+                Command.FLAGS[flagName].forEach((commandName) => {
+                    map[flagName][commandName] = true;
+                });
+                return map;
+            }, {});
+        }
+        return this.flagMap;
+    }
+    getSlot() {
+        if (typeof this.slot === "undefined") {
+            const key = this.getKeys()[0];
+            this.slot = key == null ? null : calculateSlot(key);
+        }
+        return this.slot;
+    }
+    getKeys() {
+        return this._iterateKeys();
+    }
+    /**
+     * Convert command to writable buffer or string
+     */
+    toWritable(_socket) {
+        let result;
+        const commandStr = "*" +
+            (this.args.length + 1) +
+            "\r\n$" +
+            Buffer.byteLength(this.name) +
+            "\r\n" +
+            this.name +
+            "\r\n";
+        if (this.bufferMode) {
+            const buffers = new MixedBuffers();
+            buffers.push(commandStr);
+            for (let i = 0; i < this.args.length; ++i) {
+                const arg = this.args[i];
+                if (arg instanceof Buffer) {
+                    if (arg.length === 0) {
+                        buffers.push("$0\r\n\r\n");
+                    }
+                    else {
+                        buffers.push("$" + arg.length + "\r\n");
+                        buffers.push(arg);
+                        buffers.push("\r\n");
+                    }
+                }
+                else {
+                    buffers.push("$" +
+                        Buffer.byteLength(arg) +
+                        "\r\n" +
+                        arg +
+                        "\r\n");
+                }
+            }
+            result = buffers.toBuffer();
+        }
+        else {
+            result = commandStr;
+            for (let i = 0; i < this.args.length; ++i) {
+                const arg = this.args[i];
+                result +=
+                    "$" +
+                        Buffer.byteLength(arg) +
+                        "\r\n" +
+                        arg +
+                        "\r\n";
+            }
+        }
+        return result;
+    }
+    stringifyArguments() {
+        for (let i = 0; i < this.args.length; ++i) {
+            const arg = this.args[i];
+            if (typeof arg === "string") {
+                // buffers and strings don't need any transformation
+            }
+            else if (arg instanceof Buffer) {
+                this.bufferMode = true;
+            }
+            else {
+                this.args[i] = (0, utils_1.toArg)(arg);
+            }
+        }
+    }
+    /**
+     * Convert buffer/buffer[] to string/string[],
+     * and apply reply transformer.
+     */
+    transformReply(result) {
+        if (this.replyEncoding) {
+            result = (0, utils_1.convertBufferToString)(result, this.replyEncoding);
+        }
+        const transformer = Command._transformer.reply[this.name];
+        if (transformer) {
+            result = transformer(result);
+        }
+        return result;
+    }
+    /**
+     * Set the wait time before terminating the attempt to execute a command
+     * and generating an error.
+     */
+    setTimeout(ms) {
+        if (!this._commandTimeoutTimer) {
+            this._commandTimeoutTimer = setTimeout(() => {
+                if (!this.isResolved) {
+                    this.reject(new Error("Command timed out"));
+                }
+            }, ms);
+        }
+    }
+    /**
+     * Set a timeout for blocking commands.
+     * When the timeout expires, the command resolves with null (matching Redis behavior).
+     * This handles the case of undetectable network failures (e.g., docker network disconnect)
+     * where the TCP connection becomes a zombie and no close event fires.
+     */
+    setBlockingTimeout(ms) {
+        if (ms <= 0) {
+            return;
+        }
+        // Clear existing timer if any (can happen when command moves from offline to command queue)
+        if (this._blockingTimeoutTimer) {
+            clearTimeout(this._blockingTimeoutTimer);
+            this._blockingTimeoutTimer = undefined;
+        }
+        const now = Date.now();
+        // First call: establish absolute deadline
+        if (this._blockingDeadline === undefined) {
+            this._blockingDeadline = now + ms;
+        }
+        // Check if we've already exceeded the deadline
+        const remaining = this._blockingDeadline - now;
+        if (remaining <= 0) {
+            // Resolve with null to indicate timeout (same as Redis behavior)
+            this.resolve(null);
+            return;
+        }
+        this._blockingTimeoutTimer = setTimeout(() => {
+            if (this.isResolved) {
+                this._blockingTimeoutTimer = undefined;
+                return;
+            }
+            this._blockingTimeoutTimer = undefined;
+            // Timeout expired - resolve with null (same as Redis behavior when blocking command times out)
+            this.resolve(null);
+        }, remaining);
+    }
+    /**
+     * Extract the blocking timeout from the command arguments.
+     *
+     * @returns The timeout in seconds, null for indefinite blocking (timeout of 0),
+     *          or undefined if this is not a blocking command
+     */
+    extractBlockingTimeout() {
+        const args = this.args;
+        if (!args || args.length === 0) {
+            return undefined;
+        }
+        const name = this.name.toLowerCase();
+        if (Command.checkFlag("LAST_ARG_TIMEOUT_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseSecondsArgument)(args[args.length - 1]);
+        }
+        if (Command.checkFlag("FIRST_ARG_TIMEOUT_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseSecondsArgument)(args[0]);
+        }
+        if (Command.checkFlag("BLOCK_OPTION_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseBlockOption)(args);
+        }
+        return undefined;
+    }
+    /**
+     * Clear the command and blocking timers
+     */
+    _clearTimers() {
+        const existingTimer = this._commandTimeoutTimer;
+        if (existingTimer) {
+            clearTimeout(existingTimer);
+            delete this._commandTimeoutTimer;
+        }
+        const blockingTimer = this._blockingTimeoutTimer;
+        if (blockingTimer) {
+            clearTimeout(blockingTimer);
+            delete this._blockingTimeoutTimer;
+        }
+    }
+    initPromise() {
+        const promise = new Promise((resolve, reject) => {
+            if (!this.transformed) {
+                this.transformed = true;
+                const transformer = Command._transformer.argument[this.name];
+                if (transformer) {
+                    this.args = transformer(this.args);
+                }
+                this.stringifyArguments();
+            }
+            this.resolve = this._convertValue(resolve);
+            this.reject = (err) => {
+                this._clearTimers();
+                if (this.errorStack) {
+                    reject((0, utils_1.optimizeErrorStack)(err, this.errorStack.stack, __dirname));
+                }
+                else {
+                    reject(err);
+                }
+            };
+        });
+        this.promise = (0, standard_as_callback_1.default)(promise, this.callback);
+    }
+    /**
+     * Iterate through the command arguments that are considered keys.
+     */
+    _iterateKeys(transform = (key) => key) {
+        if (typeof this.keys === "undefined") {
+            this.keys = [];
+            if ((0, commands_1.exists)(this.name, { caseInsensitive: true })) {
+                // @ts-expect-error
+                const keyIndexes = (0, commands_1.getKeyIndexes)(this.name, this.args, {
+                    nameCaseInsensitive: true,
+                });
+                for (const index of keyIndexes) {
+                    this.args[index] = transform(this.args[index]);
+                    this.keys.push(this.args[index]);
+                }
+            }
+        }
+        return this.keys;
+    }
+    /**
+     * Convert the value from buffer to the target encoding.
+     */
+    _convertValue(resolve) {
+        return (value) => {
+            try {
+                this._clearTimers();
+                resolve(this.transformReply(value));
+                this.isResolved = true;
+            }
+            catch (err) {
+                this.reject(err);
+            }
+            return this.promise;
+        };
+    }
+}
+exports.default = Command;
+Command.FLAGS = {
+    VALID_IN_SUBSCRIBER_MODE: [
+        "subscribe",
+        "psubscribe",
+        "unsubscribe",
+        "punsubscribe",
+        "ssubscribe",
+        "sunsubscribe",
+        "ping",
+        "quit",
+    ],
+    VALID_IN_MONITOR_MODE: ["monitor", "auth"],
+    ENTER_SUBSCRIBER_MODE: ["subscribe", "psubscribe", "ssubscribe"],
+    EXIT_SUBSCRIBER_MODE: ["unsubscribe", "punsubscribe", "sunsubscribe"],
+    WILL_DISCONNECT: ["quit"],
+    HANDSHAKE_COMMANDS: ["auth", "select", "client", "readonly", "info"],
+    IGNORE_RECONNECT_ON_ERROR: ["client"],
+    BLOCKING_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+        "bzmpop",
+        "blmpop",
+        "xread",
+        "xreadgroup",
+    ],
+    LAST_ARG_TIMEOUT_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+    ],
+    FIRST_ARG_TIMEOUT_COMMANDS: ["bzmpop", "blmpop"],
+    BLOCK_OPTION_COMMANDS: ["xread", "xreadgroup"],
+};
+Command._transformer = {
+    argument: {},
+    reply: {},
+};
+const msetArgumentTransformer = function (args) {
+    if (args.length === 1) {
+        if (args[0] instanceof Map) {
+            return (0, utils_1.convertMapToArray)(args[0]);
+        }
+        if (typeof args[0] === "object" && args[0] !== null) {
+            return (0, utils_1.convertObjectToArray)(args[0]);
+        }
+    }
+    return args;
+};
+const hsetArgumentTransformer = function (args) {
+    if (args.length === 2) {
+        if (args[1] instanceof Map) {
+            return [args[0]].concat((0, utils_1.convertMapToArray)(args[1]));
+        }
+        if (typeof args[1] === "object" && args[1] !== null) {
+            return [args[0]].concat((0, utils_1.convertObjectToArray)(args[1]));
+        }
+    }
+    return args;
+};
+Command.setArgumentTransformer("mset", msetArgumentTransformer);
+Command.setArgumentTransformer("msetnx", msetArgumentTransformer);
+Command.setArgumentTransformer("hset", hsetArgumentTransformer);
+Command.setArgumentTransformer("hmset", hsetArgumentTransformer);
+Command.setReplyTransformer("hgetall", function (result) {
+    if (Array.isArray(result)) {
+        const obj = {};
+        for (let i = 0; i < result.length; i += 2) {
+            const key = result[i];
+            const value = result[i + 1];
+            if (key in obj) {
+                // can only be truthy if the property is special somehow, like '__proto__' or 'constructor'
+                // https://github.com/luin/ioredis/issues/1267
+                Object.defineProperty(obj, key, {
+                    value,
+                    configurable: true,
+                    enumerable: true,
+                    writable: true,
+                });
+            }
+            else {
+                obj[key] = value;
+            }
+        }
+        return obj;
+    }
+    return result;
+});
+class MixedBuffers {
+    constructor() {
+        this.length = 0;
+        this.items = [];
+    }
+    push(x) {
+        this.length += Buffer.byteLength(x);
+        this.items.push(x);
+    }
+    toBuffer() {
+        const result = Buffer.allocUnsafe(this.length);
+        let offset = 0;
+        for (const item of this.items) {
+            const length = Buffer.byteLength(item);
+            Buffer.isBuffer(item)
+                ? item.copy(result, offset)
+                : result.write(item, offset, length);
+            offset += length;
+        }
+        return result;
+    }
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/DataHandler.d.ts b/node_modules/bullmq/node_modules/ioredis/built/DataHandler.d.ts
new file mode 100644
index 0000000..93e97d9
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/DataHandler.d.ts
@@ -0,0 +1,37 @@
+/// <reference types="node" />
+import { NetStream, CommandItem } from "./types";
+import Deque = require("denque");
+import { EventEmitter } from "events";
+import SubscriptionSet from "./SubscriptionSet";
+export interface Condition {
+    select: number;
+    auth?: string | [string, string];
+    subscriber: false | SubscriptionSet;
+}
+export declare type FlushQueueOptions = {
+    offlineQueue?: boolean;
+    commandQueue?: boolean;
+};
+export interface DataHandledable extends EventEmitter {
+    stream: NetStream;
+    status: string;
+    condition: Condition | null;
+    commandQueue: Deque<CommandItem>;
+    disconnect(reconnect: boolean): void;
+    recoverFromFatalError(commandError: Error, err: Error, options: FlushQueueOptions): void;
+    handleReconnection(err: Error, item: CommandItem): void;
+}
+interface ParserOptions {
+    stringNumbers: boolean;
+}
+export default class DataHandler {
+    private redis;
+    constructor(redis: DataHandledable, parserOptions: ParserOptions);
+    private returnFatalError;
+    private returnError;
+    private returnReply;
+    private handleSubscriberReply;
+    private handleMonitorReply;
+    private shiftCommand;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/DataHandler.js b/node_modules/bullmq/node_modules/ioredis/built/DataHandler.js
new file mode 100644
index 0000000..7f95466
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/DataHandler.js
@@ -0,0 +1,224 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const Command_1 = require("./Command");
+const utils_1 = require("./utils");
+const RedisParser = require("redis-parser");
+const SubscriptionSet_1 = require("./SubscriptionSet");
+const debug = (0, utils_1.Debug)("dataHandler");
+class DataHandler {
+    constructor(redis, parserOptions) {
+        this.redis = redis;
+        const parser = new RedisParser({
+            stringNumbers: parserOptions.stringNumbers,
+            returnBuffers: true,
+            returnError: (err) => {
+                this.returnError(err);
+            },
+            returnFatalError: (err) => {
+                this.returnFatalError(err);
+            },
+            returnReply: (reply) => {
+                this.returnReply(reply);
+            },
+        });
+        // prependListener ensures the parser receives and processes data before socket timeout checks are performed
+        redis.stream.prependListener("data", (data) => {
+            parser.execute(data);
+        });
+        // prependListener() doesn't enable flowing mode automatically - we need to resume the stream manually
+        redis.stream.resume();
+    }
+    returnFatalError(err) {
+        err.message += ". Please report this.";
+        this.redis.recoverFromFatalError(err, err, { offlineQueue: false });
+    }
+    returnError(err) {
+        const item = this.shiftCommand(err);
+        if (!item) {
+            return;
+        }
+        err.command = {
+            name: item.command.name,
+            args: item.command.args,
+        };
+        if (item.command.name == "ssubscribe" && err.message.includes("MOVED")) {
+            this.redis.emit("moved");
+            return;
+        }
+        this.redis.handleReconnection(err, item);
+    }
+    returnReply(reply) {
+        if (this.handleMonitorReply(reply)) {
+            return;
+        }
+        if (this.handleSubscriberReply(reply)) {
+            return;
+        }
+        const item = this.shiftCommand(reply);
+        if (!item) {
+            return;
+        }
+        if (Command_1.default.checkFlag("ENTER_SUBSCRIBER_MODE", item.command.name)) {
+            this.redis.condition.subscriber = new SubscriptionSet_1.default();
+            this.redis.condition.subscriber.add(item.command.name, reply[1].toString());
+            if (!fillSubCommand(item.command, reply[2])) {
+                this.redis.commandQueue.unshift(item);
+            }
+        }
+        else if (Command_1.default.checkFlag("EXIT_SUBSCRIBER_MODE", item.command.name)) {
+            if (!fillUnsubCommand(item.command, reply[2])) {
+                this.redis.commandQueue.unshift(item);
+            }
+        }
+        else {
+            item.command.resolve(reply);
+        }
+    }
+    handleSubscriberReply(reply) {
+        if (!this.redis.condition.subscriber) {
+            return false;
+        }
+        const replyType = Array.isArray(reply) ? reply[0].toString() : null;
+        debug('receive reply "%s" in subscriber mode', replyType);
+        switch (replyType) {
+            case "message":
+                if (this.redis.listeners("message").length > 0) {
+                    // Check if there're listeners to avoid unnecessary `toString()`.
+                    this.redis.emit("message", reply[1].toString(), reply[2] ? reply[2].toString() : "");
+                }
+                this.redis.emit("messageBuffer", reply[1], reply[2]);
+                break;
+            case "pmessage": {
+                const pattern = reply[1].toString();
+                if (this.redis.listeners("pmessage").length > 0) {
+                    this.redis.emit("pmessage", pattern, reply[2].toString(), reply[3].toString());
+                }
+                this.redis.emit("pmessageBuffer", pattern, reply[2], reply[3]);
+                break;
+            }
+            case "smessage": {
+                if (this.redis.listeners("smessage").length > 0) {
+                    this.redis.emit("smessage", reply[1].toString(), reply[2] ? reply[2].toString() : "");
+                }
+                this.redis.emit("smessageBuffer", reply[1], reply[2]);
+                break;
+            }
+            case "ssubscribe":
+            case "subscribe":
+            case "psubscribe": {
+                const channel = reply[1].toString();
+                this.redis.condition.subscriber.add(replyType, channel);
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                if (!fillSubCommand(item.command, reply[2])) {
+                    this.redis.commandQueue.unshift(item);
+                }
+                break;
+            }
+            case "sunsubscribe":
+            case "unsubscribe":
+            case "punsubscribe": {
+                const channel = reply[1] ? reply[1].toString() : null;
+                if (channel) {
+                    this.redis.condition.subscriber.del(replyType, channel);
+                }
+                const count = reply[2];
+                if (Number(count) === 0) {
+                    this.redis.condition.subscriber = false;
+                }
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                if (!fillUnsubCommand(item.command, count)) {
+                    this.redis.commandQueue.unshift(item);
+                }
+                break;
+            }
+            default: {
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                item.command.resolve(reply);
+            }
+        }
+        return true;
+    }
+    handleMonitorReply(reply) {
+        if (this.redis.status !== "monitoring") {
+            return false;
+        }
+        const replyStr = reply.toString();
+        if (replyStr === "OK") {
+            // Valid commands in the monitoring mode are AUTH and MONITOR,
+            // both of which always reply with 'OK'.
+            // So if we got an 'OK', we can make certain that
+            // the reply is made to AUTH & MONITOR.
+            return false;
+        }
+        // Since commands sent in the monitoring mode will trigger an exception,
+        // any replies we received in the monitoring mode should consider to be
+        // realtime monitor data instead of result of commands.
+        const len = replyStr.indexOf(" ");
+        const timestamp = replyStr.slice(0, len);
+        const argIndex = replyStr.indexOf('"');
+        const args = replyStr
+            .slice(argIndex + 1, -1)
+            .split('" "')
+            .map((elem) => elem.replace(/\\"/g, '"'));
+        const dbAndSource = replyStr.slice(len + 2, argIndex - 2).split(" ");
+        this.redis.emit("monitor", timestamp, args, dbAndSource[1], dbAndSource[0]);
+        return true;
+    }
+    shiftCommand(reply) {
+        const item = this.redis.commandQueue.shift();
+        if (!item) {
+            const message = "Command queue state error. If you can reproduce this, please report it.";
+            const error = new Error(message +
+                (reply instanceof Error
+                    ? ` Last error: ${reply.message}`
+                    : ` Last reply: ${reply.toString()}`));
+            this.redis.emit("error", error);
+            return null;
+        }
+        return item;
+    }
+}
+exports.default = DataHandler;
+const remainingRepliesMap = new WeakMap();
+function fillSubCommand(command, count) {
+    let remainingReplies = remainingRepliesMap.has(command)
+        ? remainingRepliesMap.get(command)
+        : command.args.length;
+    remainingReplies -= 1;
+    if (remainingReplies <= 0) {
+        command.resolve(count);
+        remainingRepliesMap.delete(command);
+        return true;
+    }
+    remainingRepliesMap.set(command, remainingReplies);
+    return false;
+}
+function fillUnsubCommand(command, count) {
+    let remainingReplies = remainingRepliesMap.has(command)
+        ? remainingRepliesMap.get(command)
+        : command.args.length;
+    if (remainingReplies === 0) {
+        if (Number(count) === 0) {
+            remainingRepliesMap.delete(command);
+            command.resolve(count);
+            return true;
+        }
+        return false;
+    }
+    remainingReplies -= 1;
+    if (remainingReplies <= 0) {
+        command.resolve(count);
+        return true;
+    }
+    remainingRepliesMap.set(command, remainingReplies);
+    return false;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Pipeline.d.ts b/node_modules/bullmq/node_modules/ioredis/built/Pipeline.d.ts
new file mode 100644
index 0000000..8503d72
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Pipeline.d.ts
@@ -0,0 +1,31 @@
+import Redis from "./Redis";
+import Cluster from "./cluster";
+import Command from "./Command";
+import Commander from "./utils/Commander";
+declare class Pipeline extends Commander<{
+    type: "pipeline";
+}> {
+    redis: Redis | Cluster;
+    isCluster: boolean;
+    isPipeline: boolean;
+    leftRedirections: {
+        value?: number;
+    };
+    promise: Promise<unknown>;
+    resolve: (result: unknown) => void;
+    reject: (error: Error) => void;
+    private replyPending;
+    private _queue;
+    private _result;
+    private _transactions;
+    private _shaToScript;
+    private preferKey;
+    constructor(redis: Redis | Cluster);
+    fillResult(value: unknown[], position: number): void;
+    sendCommand(command: Command): unknown;
+    addBatch(commands: any): this;
+}
+export default Pipeline;
+interface Pipeline {
+    length: number;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Pipeline.js b/node_modules/bullmq/node_modules/ioredis/built/Pipeline.js
new file mode 100644
index 0000000..c1c4566
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Pipeline.js
@@ -0,0 +1,342 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const calculateSlot = require("cluster-key-slot");
+const commands_1 = require("@ioredis/commands");
+const standard_as_callback_1 = require("standard-as-callback");
+const util_1 = require("util");
+const Command_1 = require("./Command");
+const utils_1 = require("./utils");
+const Commander_1 = require("./utils/Commander");
+/*
+  This function derives from the cluster-key-slot implementation.
+  Instead of checking that all keys have the same slot, it checks that all slots are served by the same set of nodes.
+  If this is satisfied, it returns the first key's slot.
+*/
+function generateMultiWithNodes(redis, keys) {
+    const slot = calculateSlot(keys[0]);
+    const target = redis._groupsBySlot[slot];
+    for (let i = 1; i < keys.length; i++) {
+        if (redis._groupsBySlot[calculateSlot(keys[i])] !== target) {
+            return -1;
+        }
+    }
+    return slot;
+}
+class Pipeline extends Commander_1.default {
+    constructor(redis) {
+        super();
+        this.redis = redis;
+        this.isPipeline = true;
+        this.replyPending = 0;
+        this._queue = [];
+        this._result = [];
+        this._transactions = 0;
+        this._shaToScript = {};
+        this.isCluster =
+            this.redis.constructor.name === "Cluster" || this.redis.isCluster;
+        this.options = redis.options;
+        Object.keys(redis.scriptsSet).forEach((name) => {
+            const script = redis.scriptsSet[name];
+            this._shaToScript[script.sha] = script;
+            this[name] = redis[name];
+            this[name + "Buffer"] = redis[name + "Buffer"];
+        });
+        redis.addedBuiltinSet.forEach((name) => {
+            this[name] = redis[name];
+            this[name + "Buffer"] = redis[name + "Buffer"];
+        });
+        this.promise = new Promise((resolve, reject) => {
+            this.resolve = resolve;
+            this.reject = reject;
+        });
+        const _this = this;
+        Object.defineProperty(this, "length", {
+            get: function () {
+                return _this._queue.length;
+            },
+        });
+    }
+    fillResult(value, position) {
+        if (this._queue[position].name === "exec" && Array.isArray(value[1])) {
+            const execLength = value[1].length;
+            for (let i = 0; i < execLength; i++) {
+                if (value[1][i] instanceof Error) {
+                    continue;
+                }
+                const cmd = this._queue[position - (execLength - i)];
+                try {
+                    value[1][i] = cmd.transformReply(value[1][i]);
+                }
+                catch (err) {
+                    value[1][i] = err;
+                }
+            }
+        }
+        this._result[position] = value;
+        if (--this.replyPending) {
+            return;
+        }
+        if (this.isCluster) {
+            let retriable = true;
+            let commonError;
+            for (let i = 0; i < this._result.length; ++i) {
+                const error = this._result[i][0];
+                const command = this._queue[i];
+                if (error) {
+                    if (command.name === "exec" &&
+                        error.message ===
+                            "EXECABORT Transaction discarded because of previous errors.") {
+                        continue;
+                    }
+                    if (!commonError) {
+                        commonError = {
+                            name: error.name,
+                            message: error.message,
+                        };
+                    }
+                    else if (commonError.name !== error.name ||
+                        commonError.message !== error.message) {
+                        retriable = false;
+                        break;
+                    }
+                }
+                else if (!command.inTransaction) {
+                    const isReadOnly = (0, commands_1.exists)(command.name, { caseInsensitive: true }) &&
+                        (0, commands_1.hasFlag)(command.name, "readonly", { nameCaseInsensitive: true });
+                    if (!isReadOnly) {
+                        retriable = false;
+                        break;
+                    }
+                }
+            }
+            if (commonError && retriable) {
+                const _this = this;
+                const errv = commonError.message.split(" ");
+                const queue = this._queue;
+                let inTransaction = false;
+                this._queue = [];
+                for (let i = 0; i < queue.length; ++i) {
+                    if (errv[0] === "ASK" &&
+                        !inTransaction &&
+                        queue[i].name !== "asking" &&
+                        (!queue[i - 1] || queue[i - 1].name !== "asking")) {
+                        const asking = new Command_1.default("asking");
+                        asking.ignore = true;
+                        this.sendCommand(asking);
+                    }
+                    queue[i].initPromise();
+                    this.sendCommand(queue[i]);
+                    inTransaction = queue[i].inTransaction;
+                }
+                let matched = true;
+                if (typeof this.leftRedirections === "undefined") {
+                    this.leftRedirections = {};
+                }
+                const exec = function () {
+                    _this.exec();
+                };
+                const cluster = this.redis;
+                cluster.handleError(commonError, this.leftRedirections, {
+                    moved: function (_slot, key) {
+                        _this.preferKey = key;
+                        if (cluster.slots[errv[1]]) {
+                            if (cluster.slots[errv[1]][0] !== key) {
+                                cluster.slots[errv[1]] = [key];
+                            }
+                        }
+                        else {
+                            cluster.slots[errv[1]] = [key];
+                        }
+                        cluster._groupsBySlot[errv[1]] =
+                            cluster._groupsIds[cluster.slots[errv[1]].join(";")];
+                        cluster.refreshSlotsCache();
+                        _this.exec();
+                    },
+                    ask: function (_slot, key) {
+                        _this.preferKey = key;
+                        _this.exec();
+                    },
+                    tryagain: exec,
+                    clusterDown: exec,
+                    connectionClosed: exec,
+                    maxRedirections: () => {
+                        matched = false;
+                    },
+                    defaults: () => {
+                        matched = false;
+                    },
+                });
+                if (matched) {
+                    return;
+                }
+            }
+        }
+        let ignoredCount = 0;
+        for (let i = 0; i < this._queue.length - ignoredCount; ++i) {
+            if (this._queue[i + ignoredCount].ignore) {
+                ignoredCount += 1;
+            }
+            this._result[i] = this._result[i + ignoredCount];
+        }
+        this.resolve(this._result.slice(0, this._result.length - ignoredCount));
+    }
+    sendCommand(command) {
+        if (this._transactions > 0) {
+            command.inTransaction = true;
+        }
+        const position = this._queue.length;
+        command.pipelineIndex = position;
+        command.promise
+            .then((result) => {
+            this.fillResult([null, result], position);
+        })
+            .catch((error) => {
+            this.fillResult([error], position);
+        });
+        this._queue.push(command);
+        return this;
+    }
+    addBatch(commands) {
+        let command, commandName, args;
+        for (let i = 0; i < commands.length; ++i) {
+            command = commands[i];
+            commandName = command[0];
+            args = command.slice(1);
+            this[commandName].apply(this, args);
+        }
+        return this;
+    }
+}
+exports.default = Pipeline;
+// @ts-expect-error
+const multi = Pipeline.prototype.multi;
+// @ts-expect-error
+Pipeline.prototype.multi = function () {
+    this._transactions += 1;
+    return multi.apply(this, arguments);
+};
+// @ts-expect-error
+const execBuffer = Pipeline.prototype.execBuffer;
+// @ts-expect-error
+Pipeline.prototype.execBuffer = (0, util_1.deprecate)(function () {
+    if (this._transactions > 0) {
+        this._transactions -= 1;
+    }
+    return execBuffer.apply(this, arguments);
+}, "Pipeline#execBuffer: Use Pipeline#exec instead");
+// NOTE: To avoid an unhandled promise rejection, this will unconditionally always return this.promise,
+// which always has the rejection handled by standard-as-callback
+// adding the provided rejection callback.
+//
+// If a different promise instance were returned, that promise would cause its own unhandled promise rejection
+// errors, even if that promise unconditionally resolved to **the resolved value of** this.promise.
+Pipeline.prototype.exec = function (callback) {
+    // Wait for the cluster to be connected, since we need nodes information before continuing
+    if (this.isCluster && !this.redis.slots.length) {
+        if (this.redis.status === "wait")
+            this.redis.connect().catch(utils_1.noop);
+        if (callback && !this.nodeifiedPromise) {
+            this.nodeifiedPromise = true;
+            (0, standard_as_callback_1.default)(this.promise, callback);
+        }
+        this.redis.delayUntilReady((err) => {
+            if (err) {
+                this.reject(err);
+                return;
+            }
+            this.exec(callback);
+        });
+        return this.promise;
+    }
+    if (this._transactions > 0) {
+        this._transactions -= 1;
+        return execBuffer.apply(this, arguments);
+    }
+    if (!this.nodeifiedPromise) {
+        this.nodeifiedPromise = true;
+        (0, standard_as_callback_1.default)(this.promise, callback);
+    }
+    if (!this._queue.length) {
+        this.resolve([]);
+    }
+    let pipelineSlot;
+    if (this.isCluster) {
+        // List of the first key for each command
+        const sampleKeys = [];
+        for (let i = 0; i < this._queue.length; i++) {
+            const keys = this._queue[i].getKeys();
+            if (keys.length) {
+                sampleKeys.push(keys[0]);
+            }
+            // For each command, check that the keys belong to the same slot
+            if (keys.length && calculateSlot.generateMulti(keys) < 0) {
+                this.reject(new Error("All the keys in a pipeline command should belong to the same slot"));
+                return this.promise;
+            }
+        }
+        if (sampleKeys.length) {
+            pipelineSlot = generateMultiWithNodes(this.redis, sampleKeys);
+            if (pipelineSlot < 0) {
+                this.reject(new Error("All keys in the pipeline should belong to the same slots allocation group"));
+                return this.promise;
+            }
+        }
+        else {
+            // Send the pipeline to a random node
+            pipelineSlot = (Math.random() * 16384) | 0;
+        }
+    }
+    const _this = this;
+    execPipeline();
+    return this.promise;
+    function execPipeline() {
+        let writePending = (_this.replyPending = _this._queue.length);
+        let node;
+        if (_this.isCluster) {
+            node = {
+                slot: pipelineSlot,
+                redis: _this.redis.connectionPool.nodes.all[_this.preferKey],
+            };
+        }
+        let data = "";
+        let buffers;
+        const stream = {
+            isPipeline: true,
+            destination: _this.isCluster ? node : { redis: _this.redis },
+            write(writable) {
+                if (typeof writable !== "string") {
+                    if (!buffers) {
+                        buffers = [];
+                    }
+                    if (data) {
+                        buffers.push(Buffer.from(data, "utf8"));
+                        data = "";
+                    }
+                    buffers.push(writable);
+                }
+                else {
+                    data += writable;
+                }
+                if (!--writePending) {
+                    if (buffers) {
+                        if (data) {
+                            buffers.push(Buffer.from(data, "utf8"));
+                        }
+                        stream.destination.redis.stream.write(Buffer.concat(buffers));
+                    }
+                    else {
+                        stream.destination.redis.stream.write(data);
+                    }
+                    // Reset writePending for resending
+                    writePending = _this._queue.length;
+                    data = "";
+                    buffers = undefined;
+                }
+            },
+        };
+        for (let i = 0; i < _this._queue.length; ++i) {
+            _this.redis.sendCommand(_this._queue[i], stream, node);
+        }
+        return _this.promise;
+    }
+};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Redis.d.ts b/node_modules/bullmq/node_modules/ioredis/built/Redis.d.ts
new file mode 100644
index 0000000..5cc73b0
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Redis.d.ts
@@ -0,0 +1,232 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import Cluster from "./cluster";
+import Command from "./Command";
+import { DataHandledable, FlushQueueOptions, Condition } from "./DataHandler";
+import { RedisOptions } from "./redis/RedisOptions";
+import ScanStream from "./ScanStream";
+import { Transaction } from "./transaction";
+import { Callback, CommandItem, NetStream, ScanStreamOptions, WriteableStream } from "./types";
+import Commander from "./utils/Commander";
+import Deque = require("denque");
+declare type RedisStatus = "wait" | "reconnecting" | "connecting" | "connect" | "ready" | "close" | "end";
+/**
+ * This is the major component of ioredis.
+ * Use it to connect to a standalone Redis server or Sentinels.
+ *
+ * ```typescript
+ * const redis = new Redis(); // Default port is 6379
+ * async function main() {
+ *   redis.set("foo", "bar");
+ *   redis.get("foo", (err, result) => {
+ *     // `result` should be "bar"
+ *     console.log(err, result);
+ *   });
+ *   // Or use Promise
+ *   const result = await redis.get("foo");
+ * }
+ * ```
+ */
+declare class Redis extends Commander implements DataHandledable {
+    static Cluster: typeof Cluster;
+    static Command: typeof Command;
+    /**
+     * Default options
+     */
+    private static defaultOptions;
+    /**
+     * Create a Redis instance.
+     * This is the same as `new Redis()` but is included for compatibility with node-redis.
+     */
+    static createClient(...args: ConstructorParameters<typeof Redis>): Redis;
+    options: RedisOptions;
+    status: RedisStatus;
+    /**
+     * @ignore
+     */
+    stream: NetStream;
+    /**
+     * @ignore
+     */
+    isCluster: boolean;
+    /**
+     * @ignore
+     */
+    condition: Condition | null;
+    /**
+     * @ignore
+     */
+    commandQueue: Deque<CommandItem>;
+    private connector;
+    private reconnectTimeout;
+    private offlineQueue;
+    private connectionEpoch;
+    private retryAttempts;
+    private manuallyClosing;
+    private socketTimeoutTimer;
+    private _autoPipelines;
+    private _runningAutoPipelines;
+    constructor(port: number, host: string, options: RedisOptions);
+    constructor(path: string, options: RedisOptions);
+    constructor(port: number, options: RedisOptions);
+    constructor(port: number, host: string);
+    constructor(options: RedisOptions);
+    constructor(port: number);
+    constructor(path: string);
+    constructor();
+    get autoPipelineQueueSize(): number;
+    /**
+     * Create a connection to Redis.
+     * This method will be invoked automatically when creating a new Redis instance
+     * unless `lazyConnect: true` is passed.
+     *
+     * When calling this method manually, a Promise is returned, which will
+     * be resolved when the connection status is ready. The promise can reject
+     * if the connection fails, times out, or if Redis is already connecting/connected.
+     */
+    connect(callback?: Callback<void>): Promise<void>;
+    /**
+     * Disconnect from Redis.
+     *
+     * This method closes the connection immediately,
+     * and may lose some pending replies that haven't written to client.
+     * If you want to wait for the pending replies, use Redis#quit instead.
+     */
+    disconnect(reconnect?: boolean): void;
+    /**
+     * Disconnect from Redis.
+     *
+     * @deprecated
+     */
+    end(): void;
+    /**
+     * Create a new instance with the same options as the current one.
+     *
+     * @example
+     * ```js
+     * var redis = new Redis(6380);
+     * var anotherRedis = redis.duplicate();
+     * ```
+     */
+    duplicate(override?: Partial<RedisOptions>): Redis;
+    /**
+     * Mode of the connection.
+     *
+     * One of `"normal"`, `"subscriber"`, or `"monitor"`. When the connection is
+     * not in `"normal"` mode, certain commands are not allowed.
+     */
+    get mode(): "normal" | "subscriber" | "monitor";
+    /**
+     * Listen for all requests received by the server in real time.
+     *
+     * This command will create a new connection to Redis and send a
+     * MONITOR command via the new connection in order to avoid disturbing
+     * the current connection.
+     *
+     * @param callback The callback function. If omit, a promise will be returned.
+     * @example
+     * ```js
+     * var redis = new Redis();
+     * redis.monitor(function (err, monitor) {
+     *   // Entering monitoring mode.
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     *
+     * // supports promise as well as other commands
+     * redis.monitor().then(function (monitor) {
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     * ```
+     */
+    monitor(callback?: Callback<Redis>): Promise<Redis>;
+    /**
+     * Send a command to Redis
+     *
+     * This method is used internally and in most cases you should not
+     * use it directly. If you need to send a command that is not supported
+     * by the library, you can use the `call` method:
+     *
+     * ```js
+     * const redis = new Redis();
+     *
+     * redis.call('set', 'foo', 'bar');
+     * // or
+     * redis.call(['set', 'foo', 'bar']);
+     * ```
+     *
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream): unknown;
+    private getBlockingTimeoutInMs;
+    private getConfiguredBlockingTimeout;
+    private setSocketTimeout;
+    scanStream(options?: ScanStreamOptions): ScanStream;
+    scanBufferStream(options?: ScanStreamOptions): ScanStream;
+    sscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    sscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    /**
+     * Emit only when there's at least one listener.
+     *
+     * @ignore
+     */
+    silentEmit(eventName: string, arg?: unknown): boolean;
+    /**
+     * @ignore
+     */
+    recoverFromFatalError(_commandError: Error, err: Error, options: FlushQueueOptions): void;
+    /**
+     * @ignore
+     */
+    handleReconnection(err: Error, item: CommandItem): void;
+    /**
+     * Get description of the connection. Used for debugging.
+     */
+    private _getDescription;
+    private resetCommandQueue;
+    private resetOfflineQueue;
+    private parseOptions;
+    /**
+     * Change instance's status
+     */
+    private setStatus;
+    private createScanStream;
+    /**
+     * Flush offline queue and command queue with error.
+     *
+     * @param error The error object to send to the commands
+     * @param options options
+     */
+    private flushQueue;
+    /**
+     * Check whether Redis has finished loading the persistent data and is able to
+     * process commands.
+     */
+    private _readyCheck;
+}
+interface Redis extends EventEmitter {
+    on(event: "message", cb: (channel: string, message: string) => void): this;
+    once(event: "message", cb: (channel: string, message: string) => void): this;
+    on(event: "messageBuffer", cb: (channel: Buffer, message: Buffer) => void): this;
+    once(event: "messageBuffer", cb: (channel: Buffer, message: Buffer) => void): this;
+    on(event: "pmessage", cb: (pattern: string, channel: string, message: string) => void): this;
+    once(event: "pmessage", cb: (pattern: string, channel: string, message: string) => void): this;
+    on(event: "pmessageBuffer", cb: (pattern: string, channel: Buffer, message: Buffer) => void): this;
+    once(event: "pmessageBuffer", cb: (pattern: string, channel: Buffer, message: Buffer) => void): this;
+    on(event: "error", cb: (error: Error) => void): this;
+    once(event: "error", cb: (error: Error) => void): this;
+    on(event: RedisStatus, cb: () => void): this;
+    once(event: RedisStatus, cb: () => void): this;
+    on(event: string | symbol, listener: (...args: any[]) => void): this;
+    once(event: string | symbol, listener: (...args: any[]) => void): this;
+}
+interface Redis extends Transaction {
+}
+export default Redis;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Redis.js b/node_modules/bullmq/node_modules/ioredis/built/Redis.js
new file mode 100644
index 0000000..6c9bdfd
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Redis.js
@@ -0,0 +1,745 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const events_1 = require("events");
+const standard_as_callback_1 = require("standard-as-callback");
+const cluster_1 = require("./cluster");
+const Command_1 = require("./Command");
+const connectors_1 = require("./connectors");
+const SentinelConnector_1 = require("./connectors/SentinelConnector");
+const eventHandler = require("./redis/event_handler");
+const RedisOptions_1 = require("./redis/RedisOptions");
+const ScanStream_1 = require("./ScanStream");
+const transaction_1 = require("./transaction");
+const utils_1 = require("./utils");
+const applyMixin_1 = require("./utils/applyMixin");
+const Commander_1 = require("./utils/Commander");
+const lodash_1 = require("./utils/lodash");
+const Deque = require("denque");
+const debug = (0, utils_1.Debug)("redis");
+/**
+ * This is the major component of ioredis.
+ * Use it to connect to a standalone Redis server or Sentinels.
+ *
+ * ```typescript
+ * const redis = new Redis(); // Default port is 6379
+ * async function main() {
+ *   redis.set("foo", "bar");
+ *   redis.get("foo", (err, result) => {
+ *     // `result` should be "bar"
+ *     console.log(err, result);
+ *   });
+ *   // Or use Promise
+ *   const result = await redis.get("foo");
+ * }
+ * ```
+ */
+class Redis extends Commander_1.default {
+    constructor(arg1, arg2, arg3) {
+        super();
+        this.status = "wait";
+        /**
+         * @ignore
+         */
+        this.isCluster = false;
+        this.reconnectTimeout = null;
+        this.connectionEpoch = 0;
+        this.retryAttempts = 0;
+        this.manuallyClosing = false;
+        // Prepare autopipelines structures
+        this._autoPipelines = new Map();
+        this._runningAutoPipelines = new Set();
+        this.parseOptions(arg1, arg2, arg3);
+        events_1.EventEmitter.call(this);
+        this.resetCommandQueue();
+        this.resetOfflineQueue();
+        if (this.options.Connector) {
+            this.connector = new this.options.Connector(this.options);
+        }
+        else if (this.options.sentinels) {
+            const sentinelConnector = new SentinelConnector_1.default(this.options);
+            sentinelConnector.emitter = this;
+            this.connector = sentinelConnector;
+        }
+        else {
+            this.connector = new connectors_1.StandaloneConnector(this.options);
+        }
+        if (this.options.scripts) {
+            Object.entries(this.options.scripts).forEach(([name, definition]) => {
+                this.defineCommand(name, definition);
+            });
+        }
+        // end(or wait) -> connecting -> connect -> ready -> end
+        if (this.options.lazyConnect) {
+            this.setStatus("wait");
+        }
+        else {
+            this.connect().catch(lodash_1.noop);
+        }
+    }
+    /**
+     * Create a Redis instance.
+     * This is the same as `new Redis()` but is included for compatibility with node-redis.
+     */
+    static createClient(...args) {
+        return new Redis(...args);
+    }
+    get autoPipelineQueueSize() {
+        let queued = 0;
+        for (const pipeline of this._autoPipelines.values()) {
+            queued += pipeline.length;
+        }
+        return queued;
+    }
+    /**
+     * Create a connection to Redis.
+     * This method will be invoked automatically when creating a new Redis instance
+     * unless `lazyConnect: true` is passed.
+     *
+     * When calling this method manually, a Promise is returned, which will
+     * be resolved when the connection status is ready. The promise can reject
+     * if the connection fails, times out, or if Redis is already connecting/connected.
+     */
+    connect(callback) {
+        const promise = new Promise((resolve, reject) => {
+            if (this.status === "connecting" ||
+                this.status === "connect" ||
+                this.status === "ready") {
+                reject(new Error("Redis is already connecting/connected"));
+                return;
+            }
+            this.connectionEpoch += 1;
+            this.setStatus("connecting");
+            const { options } = this;
+            this.condition = {
+                select: options.db,
+                auth: options.username
+                    ? [options.username, options.password]
+                    : options.password,
+                subscriber: false,
+            };
+            const _this = this;
+            (0, standard_as_callback_1.default)(this.connector.connect(function (type, err) {
+                _this.silentEmit(type, err);
+            }), function (err, stream) {
+                if (err) {
+                    _this.flushQueue(err);
+                    _this.silentEmit("error", err);
+                    reject(err);
+                    _this.setStatus("end");
+                    return;
+                }
+                let CONNECT_EVENT = options.tls ? "secureConnect" : "connect";
+                if ("sentinels" in options &&
+                    options.sentinels &&
+                    !options.enableTLSForSentinelMode) {
+                    CONNECT_EVENT = "connect";
+                }
+                _this.stream = stream;
+                if (options.noDelay) {
+                    stream.setNoDelay(true);
+                }
+                // Node ignores setKeepAlive before connect, therefore we wait for the event:
+                // https://github.com/nodejs/node/issues/31663
+                if (typeof options.keepAlive === "number") {
+                    if (stream.connecting) {
+                        stream.once(CONNECT_EVENT, () => {
+                            stream.setKeepAlive(true, options.keepAlive);
+                        });
+                    }
+                    else {
+                        stream.setKeepAlive(true, options.keepAlive);
+                    }
+                }
+                if (stream.connecting) {
+                    stream.once(CONNECT_EVENT, eventHandler.connectHandler(_this));
+                    if (options.connectTimeout) {
+                        /*
+                         * Typically, Socket#setTimeout(0) will clear the timer
+                         * set before. However, in some platforms (Electron 3.x~4.x),
+                         * the timer will not be cleared. So we introduce a variable here.
+                         *
+                         * See https://github.com/electron/electron/issues/14915
+                         */
+                        let connectTimeoutCleared = false;
+                        stream.setTimeout(options.connectTimeout, function () {
+                            if (connectTimeoutCleared) {
+                                return;
+                            }
+                            stream.setTimeout(0);
+                            stream.destroy();
+                            const err = new Error("connect ETIMEDOUT");
+                            // @ts-expect-error
+                            err.errorno = "ETIMEDOUT";
+                            // @ts-expect-error
+                            err.code = "ETIMEDOUT";
+                            // @ts-expect-error
+                            err.syscall = "connect";
+                            eventHandler.errorHandler(_this)(err);
+                        });
+                        stream.once(CONNECT_EVENT, function () {
+                            connectTimeoutCleared = true;
+                            stream.setTimeout(0);
+                        });
+                    }
+                }
+                else if (stream.destroyed) {
+                    const firstError = _this.connector.firstError;
+                    if (firstError) {
+                        process.nextTick(() => {
+                            eventHandler.errorHandler(_this)(firstError);
+                        });
+                    }
+                    process.nextTick(eventHandler.closeHandler(_this));
+                }
+                else {
+                    process.nextTick(eventHandler.connectHandler(_this));
+                }
+                if (!stream.destroyed) {
+                    stream.once("error", eventHandler.errorHandler(_this));
+                    stream.once("close", eventHandler.closeHandler(_this));
+                }
+                const connectionReadyHandler = function () {
+                    _this.removeListener("close", connectionCloseHandler);
+                    resolve();
+                };
+                var connectionCloseHandler = function () {
+                    _this.removeListener("ready", connectionReadyHandler);
+                    reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+                };
+                _this.once("ready", connectionReadyHandler);
+                _this.once("close", connectionCloseHandler);
+            });
+        });
+        return (0, standard_as_callback_1.default)(promise, callback);
+    }
+    /**
+     * Disconnect from Redis.
+     *
+     * This method closes the connection immediately,
+     * and may lose some pending replies that haven't written to client.
+     * If you want to wait for the pending replies, use Redis#quit instead.
+     */
+    disconnect(reconnect = false) {
+        if (!reconnect) {
+            this.manuallyClosing = true;
+        }
+        if (this.reconnectTimeout && !reconnect) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+        }
+        if (this.status === "wait") {
+            eventHandler.closeHandler(this)();
+        }
+        else {
+            this.connector.disconnect();
+        }
+    }
+    /**
+     * Disconnect from Redis.
+     *
+     * @deprecated
+     */
+    end() {
+        this.disconnect();
+    }
+    /**
+     * Create a new instance with the same options as the current one.
+     *
+     * @example
+     * ```js
+     * var redis = new Redis(6380);
+     * var anotherRedis = redis.duplicate();
+     * ```
+     */
+    duplicate(override) {
+        return new Redis({ ...this.options, ...override });
+    }
+    /**
+     * Mode of the connection.
+     *
+     * One of `"normal"`, `"subscriber"`, or `"monitor"`. When the connection is
+     * not in `"normal"` mode, certain commands are not allowed.
+     */
+    get mode() {
+        var _a;
+        return this.options.monitor
+            ? "monitor"
+            : ((_a = this.condition) === null || _a === void 0 ? void 0 : _a.subscriber)
+                ? "subscriber"
+                : "normal";
+    }
+    /**
+     * Listen for all requests received by the server in real time.
+     *
+     * This command will create a new connection to Redis and send a
+     * MONITOR command via the new connection in order to avoid disturbing
+     * the current connection.
+     *
+     * @param callback The callback function. If omit, a promise will be returned.
+     * @example
+     * ```js
+     * var redis = new Redis();
+     * redis.monitor(function (err, monitor) {
+     *   // Entering monitoring mode.
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     *
+     * // supports promise as well as other commands
+     * redis.monitor().then(function (monitor) {
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     * ```
+     */
+    monitor(callback) {
+        const monitorInstance = this.duplicate({
+            monitor: true,
+            lazyConnect: false,
+        });
+        return (0, standard_as_callback_1.default)(new Promise(function (resolve, reject) {
+            monitorInstance.once("error", reject);
+            monitorInstance.once("monitoring", function () {
+                resolve(monitorInstance);
+            });
+        }), callback);
+    }
+    /**
+     * Send a command to Redis
+     *
+     * This method is used internally and in most cases you should not
+     * use it directly. If you need to send a command that is not supported
+     * by the library, you can use the `call` method:
+     *
+     * ```js
+     * const redis = new Redis();
+     *
+     * redis.call('set', 'foo', 'bar');
+     * // or
+     * redis.call(['set', 'foo', 'bar']);
+     * ```
+     *
+     * @ignore
+     */
+    sendCommand(command, stream) {
+        var _a, _b;
+        if (this.status === "wait") {
+            this.connect().catch(lodash_1.noop);
+        }
+        if (this.status === "end") {
+            command.reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+            return command.promise;
+        }
+        if (((_a = this.condition) === null || _a === void 0 ? void 0 : _a.subscriber) &&
+            !Command_1.default.checkFlag("VALID_IN_SUBSCRIBER_MODE", command.name)) {
+            command.reject(new Error("Connection in subscriber mode, only subscriber commands may be used"));
+            return command.promise;
+        }
+        if (typeof this.options.commandTimeout === "number") {
+            command.setTimeout(this.options.commandTimeout);
+        }
+        const blockingTimeout = this.getBlockingTimeoutInMs(command);
+        let writable = this.status === "ready" ||
+            (!stream &&
+                this.status === "connect" &&
+                (0, commands_1.exists)(command.name, { caseInsensitive: true }) &&
+                ((0, commands_1.hasFlag)(command.name, "loading", { nameCaseInsensitive: true }) ||
+                    Command_1.default.checkFlag("HANDSHAKE_COMMANDS", command.name)));
+        if (!this.stream) {
+            writable = false;
+        }
+        else if (!this.stream.writable) {
+            writable = false;
+            // @ts-expect-error
+        }
+        else if (this.stream._writableState && this.stream._writableState.ended) {
+            // TODO: We should be able to remove this as the PR has already been merged.
+            // https://github.com/iojs/io.js/pull/1217
+            writable = false;
+        }
+        if (!writable) {
+            if (!this.options.enableOfflineQueue) {
+                command.reject(new Error("Stream isn't writeable and enableOfflineQueue options is false"));
+                return command.promise;
+            }
+            if (command.name === "quit" && this.offlineQueue.length === 0) {
+                this.disconnect();
+                command.resolve(Buffer.from("OK"));
+                return command.promise;
+            }
+            // @ts-expect-error
+            if (debug.enabled) {
+                debug("queue command[%s]: %d -> %s(%o)", this._getDescription(), this.condition.select, command.name, command.args);
+            }
+            this.offlineQueue.push({
+                command: command,
+                stream: stream,
+                select: this.condition.select,
+            });
+            // For blocking commands in the offline queue, arm a client-side timeout
+            // only when blockingTimeout is configured. Without this option, queued
+            // blocking commands may wait indefinitely on a dead connection.
+            if (Command_1.default.checkFlag("BLOCKING_COMMANDS", command.name)) {
+                const offlineTimeout = this.getConfiguredBlockingTimeout();
+                if (offlineTimeout !== undefined) {
+                    command.setBlockingTimeout(offlineTimeout);
+                }
+            }
+        }
+        else {
+            // @ts-expect-error
+            if (debug.enabled) {
+                debug("write command[%s]: %d -> %s(%o)", this._getDescription(), (_b = this.condition) === null || _b === void 0 ? void 0 : _b.select, command.name, command.args);
+            }
+            if (stream) {
+                if ("isPipeline" in stream && stream.isPipeline) {
+                    stream.write(command.toWritable(stream.destination.redis.stream));
+                }
+                else {
+                    stream.write(command.toWritable(stream));
+                }
+            }
+            else {
+                this.stream.write(command.toWritable(this.stream));
+            }
+            this.commandQueue.push({
+                command: command,
+                stream: stream,
+                select: this.condition.select,
+            });
+            if (blockingTimeout !== undefined) {
+                command.setBlockingTimeout(blockingTimeout);
+            }
+            if (Command_1.default.checkFlag("WILL_DISCONNECT", command.name)) {
+                this.manuallyClosing = true;
+            }
+            if (this.options.socketTimeout !== undefined && this.socketTimeoutTimer === undefined) {
+                this.setSocketTimeout();
+            }
+        }
+        if (command.name === "select" && (0, utils_1.isInt)(command.args[0])) {
+            const db = parseInt(command.args[0], 10);
+            if (this.condition.select !== db) {
+                this.condition.select = db;
+                this.emit("select", db);
+                debug("switch to db [%d]", this.condition.select);
+            }
+        }
+        return command.promise;
+    }
+    getBlockingTimeoutInMs(command) {
+        var _a;
+        if (!Command_1.default.checkFlag("BLOCKING_COMMANDS", command.name)) {
+            return undefined;
+        }
+        // Feature is opt-in: only enabled when blockingTimeout is set to a positive number
+        const configuredTimeout = this.getConfiguredBlockingTimeout();
+        if (configuredTimeout === undefined) {
+            return undefined;
+        }
+        const timeout = command.extractBlockingTimeout();
+        if (typeof timeout === "number") {
+            if (timeout > 0) {
+                // Finite timeout from command args - add grace period
+                return timeout + ((_a = this.options.blockingTimeoutGrace) !== null && _a !== void 0 ? _a : RedisOptions_1.DEFAULT_REDIS_OPTIONS.blockingTimeoutGrace);
+            }
+            // Command has timeout=0 (block forever), use blockingTimeout option as safety net
+            return configuredTimeout;
+        }
+        if (timeout === null) {
+            // No BLOCK option found (e.g., XREAD without BLOCK), use blockingTimeout as safety net
+            return configuredTimeout;
+        }
+        return undefined;
+    }
+    getConfiguredBlockingTimeout() {
+        if (typeof this.options.blockingTimeout === "number" &&
+            this.options.blockingTimeout > 0) {
+            return this.options.blockingTimeout;
+        }
+        return undefined;
+    }
+    setSocketTimeout() {
+        this.socketTimeoutTimer = setTimeout(() => {
+            this.stream.destroy(new Error(`Socket timeout. Expecting data, but didn't receive any in ${this.options.socketTimeout}ms.`));
+            this.socketTimeoutTimer = undefined;
+        }, this.options.socketTimeout);
+        // this handler must run after the "data" handler in "DataHandler"
+        // so that `this.commandQueue.length` will be updated
+        this.stream.once("data", () => {
+            clearTimeout(this.socketTimeoutTimer);
+            this.socketTimeoutTimer = undefined;
+            if (this.commandQueue.length === 0)
+                return;
+            this.setSocketTimeout();
+        });
+    }
+    scanStream(options) {
+        return this.createScanStream("scan", { options });
+    }
+    scanBufferStream(options) {
+        return this.createScanStream("scanBuffer", { options });
+    }
+    sscanStream(key, options) {
+        return this.createScanStream("sscan", { key, options });
+    }
+    sscanBufferStream(key, options) {
+        return this.createScanStream("sscanBuffer", { key, options });
+    }
+    hscanStream(key, options) {
+        return this.createScanStream("hscan", { key, options });
+    }
+    hscanBufferStream(key, options) {
+        return this.createScanStream("hscanBuffer", { key, options });
+    }
+    zscanStream(key, options) {
+        return this.createScanStream("zscan", { key, options });
+    }
+    zscanBufferStream(key, options) {
+        return this.createScanStream("zscanBuffer", { key, options });
+    }
+    /**
+     * Emit only when there's at least one listener.
+     *
+     * @ignore
+     */
+    silentEmit(eventName, arg) {
+        let error;
+        if (eventName === "error") {
+            error = arg;
+            if (this.status === "end") {
+                return;
+            }
+            if (this.manuallyClosing) {
+                // ignore connection related errors when manually disconnecting
+                if (error instanceof Error &&
+                    (error.message === utils_1.CONNECTION_CLOSED_ERROR_MSG ||
+                        // @ts-expect-error
+                        error.syscall === "connect" ||
+                        // @ts-expect-error
+                        error.syscall === "read")) {
+                    return;
+                }
+            }
+        }
+        if (this.listeners(eventName).length > 0) {
+            return this.emit.apply(this, arguments);
+        }
+        if (error && error instanceof Error) {
+            console.error("[ioredis] Unhandled error event:", error.stack);
+        }
+        return false;
+    }
+    /**
+     * @ignore
+     */
+    recoverFromFatalError(_commandError, err, options) {
+        this.flushQueue(err, options);
+        this.silentEmit("error", err);
+        this.disconnect(true);
+    }
+    /**
+     * @ignore
+     */
+    handleReconnection(err, item) {
+        var _a;
+        let needReconnect = false;
+        if (this.options.reconnectOnError &&
+            !Command_1.default.checkFlag("IGNORE_RECONNECT_ON_ERROR", item.command.name)) {
+            needReconnect = this.options.reconnectOnError(err);
+        }
+        switch (needReconnect) {
+            case 1:
+            case true:
+                if (this.status !== "reconnecting") {
+                    this.disconnect(true);
+                }
+                item.command.reject(err);
+                break;
+            case 2:
+                if (this.status !== "reconnecting") {
+                    this.disconnect(true);
+                }
+                if (((_a = this.condition) === null || _a === void 0 ? void 0 : _a.select) !== item.select &&
+                    item.command.name !== "select") {
+                    this.select(item.select);
+                }
+                // TODO
+                // @ts-expect-error
+                this.sendCommand(item.command);
+                break;
+            default:
+                item.command.reject(err);
+        }
+    }
+    /**
+     * Get description of the connection. Used for debugging.
+     */
+    _getDescription() {
+        let description;
+        if ("path" in this.options && this.options.path) {
+            description = this.options.path;
+        }
+        else if (this.stream &&
+            this.stream.remoteAddress &&
+            this.stream.remotePort) {
+            description = this.stream.remoteAddress + ":" + this.stream.remotePort;
+        }
+        else if ("host" in this.options && this.options.host) {
+            description = this.options.host + ":" + this.options.port;
+        }
+        else {
+            // Unexpected
+            description = "";
+        }
+        if (this.options.connectionName) {
+            description += ` (${this.options.connectionName})`;
+        }
+        return description;
+    }
+    resetCommandQueue() {
+        this.commandQueue = new Deque();
+    }
+    resetOfflineQueue() {
+        this.offlineQueue = new Deque();
+    }
+    parseOptions(...args) {
+        const options = {};
+        let isTls = false;
+        for (let i = 0; i < args.length; ++i) {
+            const arg = args[i];
+            if (arg === null || typeof arg === "undefined") {
+                continue;
+            }
+            if (typeof arg === "object") {
+                (0, lodash_1.defaults)(options, arg);
+            }
+            else if (typeof arg === "string") {
+                (0, lodash_1.defaults)(options, (0, utils_1.parseURL)(arg));
+                if (arg.startsWith("rediss://")) {
+                    isTls = true;
+                }
+            }
+            else if (typeof arg === "number") {
+                options.port = arg;
+            }
+            else {
+                throw new Error("Invalid argument " + arg);
+            }
+        }
+        if (isTls) {
+            (0, lodash_1.defaults)(options, { tls: true });
+        }
+        (0, lodash_1.defaults)(options, Redis.defaultOptions);
+        if (typeof options.port === "string") {
+            options.port = parseInt(options.port, 10);
+        }
+        if (typeof options.db === "string") {
+            options.db = parseInt(options.db, 10);
+        }
+        // @ts-expect-error
+        this.options = (0, utils_1.resolveTLSProfile)(options);
+    }
+    /**
+     * Change instance's status
+     */
+    setStatus(status, arg) {
+        // @ts-expect-error
+        if (debug.enabled) {
+            debug("status[%s]: %s -> %s", this._getDescription(), this.status || "[empty]", status);
+        }
+        this.status = status;
+        process.nextTick(this.emit.bind(this, status, arg));
+    }
+    createScanStream(command, { key, options = {} }) {
+        return new ScanStream_1.default({
+            objectMode: true,
+            key: key,
+            redis: this,
+            command: command,
+            ...options,
+        });
+    }
+    /**
+     * Flush offline queue and command queue with error.
+     *
+     * @param error The error object to send to the commands
+     * @param options options
+     */
+    flushQueue(error, options) {
+        options = (0, lodash_1.defaults)({}, options, {
+            offlineQueue: true,
+            commandQueue: true,
+        });
+        let item;
+        if (options.offlineQueue) {
+            while ((item = this.offlineQueue.shift())) {
+                item.command.reject(error);
+            }
+        }
+        if (options.commandQueue) {
+            if (this.commandQueue.length > 0) {
+                if (this.stream) {
+                    this.stream.removeAllListeners("data");
+                }
+                while ((item = this.commandQueue.shift())) {
+                    item.command.reject(error);
+                }
+            }
+        }
+    }
+    /**
+     * Check whether Redis has finished loading the persistent data and is able to
+     * process commands.
+     */
+    _readyCheck(callback) {
+        const _this = this;
+        this.info(function (err, res) {
+            if (err) {
+                if (err.message && err.message.includes("NOPERM")) {
+                    console.warn(`Skipping the ready check because INFO command fails: "${err.message}". You can disable ready check with "enableReadyCheck". More: https://github.com/luin/ioredis/wiki/Disable-ready-check.`);
+                    return callback(null, {});
+                }
+                return callback(err);
+            }
+            if (typeof res !== "string") {
+                return callback(null, res);
+            }
+            const info = {};
+            const lines = res.split("\r\n");
+            for (let i = 0; i < lines.length; ++i) {
+                const [fieldName, ...fieldValueParts] = lines[i].split(":");
+                const fieldValue = fieldValueParts.join(":");
+                if (fieldValue) {
+                    info[fieldName] = fieldValue;
+                }
+            }
+            if (!info.loading || info.loading === "0") {
+                callback(null, info);
+            }
+            else {
+                const loadingEtaMs = (info.loading_eta_seconds || 1) * 1000;
+                const retryTime = _this.options.maxLoadingRetryTime &&
+                    _this.options.maxLoadingRetryTime < loadingEtaMs
+                    ? _this.options.maxLoadingRetryTime
+                    : loadingEtaMs;
+                debug("Redis server still loading, trying again in " + retryTime + "ms");
+                setTimeout(function () {
+                    _this._readyCheck(callback);
+                }, retryTime);
+            }
+        }).catch(lodash_1.noop);
+    }
+}
+Redis.Cluster = cluster_1.default;
+Redis.Command = Command_1.default;
+/**
+ * Default options
+ */
+Redis.defaultOptions = RedisOptions_1.DEFAULT_REDIS_OPTIONS;
+(0, applyMixin_1.default)(Redis, events_1.EventEmitter);
+(0, transaction_1.addTransactionSupport)(Redis.prototype);
+exports.default = Redis;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/ScanStream.d.ts b/node_modules/bullmq/node_modules/ioredis/built/ScanStream.d.ts
new file mode 100644
index 0000000..38c3803
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/ScanStream.d.ts
@@ -0,0 +1,23 @@
+/// <reference types="node" />
+import { Readable, ReadableOptions } from "stream";
+interface Options extends ReadableOptions {
+    key?: string;
+    match?: string;
+    type?: string;
+    command: string;
+    redis: any;
+    count?: string | number;
+    noValues?: boolean;
+}
+/**
+ * Convenient class to convert the process of scanning keys to a readable stream.
+ */
+export default class ScanStream extends Readable {
+    private opt;
+    private _redisCursor;
+    private _redisDrained;
+    constructor(opt: Options);
+    _read(): void;
+    close(): void;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/ScanStream.js b/node_modules/bullmq/node_modules/ioredis/built/ScanStream.js
new file mode 100644
index 0000000..3abecaf
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/ScanStream.js
@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const stream_1 = require("stream");
+/**
+ * Convenient class to convert the process of scanning keys to a readable stream.
+ */
+class ScanStream extends stream_1.Readable {
+    constructor(opt) {
+        super(opt);
+        this.opt = opt;
+        this._redisCursor = "0";
+        this._redisDrained = false;
+    }
+    _read() {
+        if (this._redisDrained) {
+            this.push(null);
+            return;
+        }
+        const args = [this._redisCursor];
+        if (this.opt.key) {
+            args.unshift(this.opt.key);
+        }
+        if (this.opt.match) {
+            args.push("MATCH", this.opt.match);
+        }
+        if (this.opt.type) {
+            args.push("TYPE", this.opt.type);
+        }
+        if (this.opt.count) {
+            args.push("COUNT", String(this.opt.count));
+        }
+        if (this.opt.noValues) {
+            args.push("NOVALUES");
+        }
+        this.opt.redis[this.opt.command](args, (err, res) => {
+            if (err) {
+                this.emit("error", err);
+                return;
+            }
+            this._redisCursor = res[0] instanceof Buffer ? res[0].toString() : res[0];
+            if (this._redisCursor === "0") {
+                this._redisDrained = true;
+            }
+            this.push(res[1]);
+        });
+    }
+    close() {
+        this._redisDrained = true;
+    }
+}
+exports.default = ScanStream;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Script.d.ts b/node_modules/bullmq/node_modules/ioredis/built/Script.d.ts
new file mode 100644
index 0000000..b17f4d8
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Script.d.ts
@@ -0,0 +1,11 @@
+import { Callback } from "./types";
+export default class Script {
+    private lua;
+    private numberOfKeys;
+    private keyPrefix;
+    private readOnly;
+    private sha;
+    private Command;
+    constructor(lua: string, numberOfKeys?: number | null, keyPrefix?: string, readOnly?: boolean);
+    execute(container: any, args: any[], options: any, callback?: Callback): any;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/Script.js b/node_modules/bullmq/node_modules/ioredis/built/Script.js
new file mode 100644
index 0000000..34ea485
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/Script.js
@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const crypto_1 = require("crypto");
+const Command_1 = require("./Command");
+const standard_as_callback_1 = require("standard-as-callback");
+class Script {
+    constructor(lua, numberOfKeys = null, keyPrefix = "", readOnly = false) {
+        this.lua = lua;
+        this.numberOfKeys = numberOfKeys;
+        this.keyPrefix = keyPrefix;
+        this.readOnly = readOnly;
+        this.sha = (0, crypto_1.createHash)("sha1").update(lua).digest("hex");
+        const sha = this.sha;
+        const socketHasScriptLoaded = new WeakSet();
+        this.Command = class CustomScriptCommand extends Command_1.default {
+            toWritable(socket) {
+                const origReject = this.reject;
+                this.reject = (err) => {
+                    if (err.message.indexOf("NOSCRIPT") !== -1) {
+                        socketHasScriptLoaded.delete(socket);
+                    }
+                    origReject.call(this, err);
+                };
+                if (!socketHasScriptLoaded.has(socket)) {
+                    socketHasScriptLoaded.add(socket);
+                    this.name = "eval";
+                    this.args[0] = lua;
+                }
+                else if (this.name === "eval") {
+                    this.name = "evalsha";
+                    this.args[0] = sha;
+                }
+                return super.toWritable(socket);
+            }
+        };
+    }
+    execute(container, args, options, callback) {
+        if (typeof this.numberOfKeys === "number") {
+            args.unshift(this.numberOfKeys);
+        }
+        if (this.keyPrefix) {
+            options.keyPrefix = this.keyPrefix;
+        }
+        if (this.readOnly) {
+            options.readOnly = true;
+        }
+        const evalsha = new this.Command("evalsha", [this.sha, ...args], options);
+        evalsha.promise = evalsha.promise.catch((err) => {
+            if (err.message.indexOf("NOSCRIPT") === -1) {
+                throw err;
+            }
+            // Resend the same custom evalsha command that gets transformed
+            // to an eval in case it's not loaded yet on the connection.
+            const resend = new this.Command("evalsha", [this.sha, ...args], options);
+            const client = container.isPipeline ? container.redis : container;
+            return client.sendCommand(resend);
+        });
+        (0, standard_as_callback_1.default)(evalsha.promise, callback);
+        return container.sendCommand(evalsha);
+    }
+}
+exports.default = Script;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.d.ts b/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.d.ts
new file mode 100644
index 0000000..2b5c7cc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.d.ts
@@ -0,0 +1,14 @@
+import { CommandNameFlags } from "./Command";
+declare type AddSet = CommandNameFlags["ENTER_SUBSCRIBER_MODE"][number];
+declare type DelSet = CommandNameFlags["EXIT_SUBSCRIBER_MODE"][number];
+/**
+ * Tiny class to simplify dealing with subscription set
+ */
+export default class SubscriptionSet {
+    private set;
+    add(set: AddSet, channel: string): void;
+    del(set: DelSet, channel: string): void;
+    channels(set: AddSet | DelSet): string[];
+    isEmpty(): boolean;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.js b/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.js
new file mode 100644
index 0000000..df39e61
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/SubscriptionSet.js
@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Tiny class to simplify dealing with subscription set
+ */
+class SubscriptionSet {
+    constructor() {
+        this.set = {
+            subscribe: {},
+            psubscribe: {},
+            ssubscribe: {},
+        };
+    }
+    add(set, channel) {
+        this.set[mapSet(set)][channel] = true;
+    }
+    del(set, channel) {
+        delete this.set[mapSet(set)][channel];
+    }
+    channels(set) {
+        return Object.keys(this.set[mapSet(set)]);
+    }
+    isEmpty() {
+        return (this.channels("subscribe").length === 0 &&
+            this.channels("psubscribe").length === 0 &&
+            this.channels("ssubscribe").length === 0);
+    }
+}
+exports.default = SubscriptionSet;
+function mapSet(set) {
+    if (set === "unsubscribe") {
+        return "subscribe";
+    }
+    if (set === "punsubscribe") {
+        return "psubscribe";
+    }
+    if (set === "sunsubscribe") {
+        return "ssubscribe";
+    }
+    return set;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.d.ts b/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.d.ts
new file mode 100644
index 0000000..64505fc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.d.ts
@@ -0,0 +1,8 @@
+/// <reference types="node" />
+import { ArgumentType } from "./Command";
+export declare const kExec: unique symbol;
+export declare const kCallbacks: unique symbol;
+export declare const notAllowedAutoPipelineCommands: string[];
+export declare function shouldUseAutoPipelining(client: any, functionName: string, commandName: string): boolean;
+export declare function getFirstValueInFlattenedArray(args: ArgumentType[]): string | Buffer | number | null | undefined;
+export declare function executeWithAutoPipelining(client: any, functionName: string, commandName: string, args: ArgumentType[], callback: any): Promise<unknown>;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.js b/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.js
new file mode 100644
index 0000000..b3d416a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/autoPipelining.js
@@ -0,0 +1,167 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.executeWithAutoPipelining = exports.getFirstValueInFlattenedArray = exports.shouldUseAutoPipelining = exports.notAllowedAutoPipelineCommands = exports.kCallbacks = exports.kExec = void 0;
+const lodash_1 = require("./utils/lodash");
+const calculateSlot = require("cluster-key-slot");
+const standard_as_callback_1 = require("standard-as-callback");
+const commands_1 = require("@ioredis/commands");
+exports.kExec = Symbol("exec");
+exports.kCallbacks = Symbol("callbacks");
+exports.notAllowedAutoPipelineCommands = [
+    "auth",
+    "info",
+    "script",
+    "quit",
+    "cluster",
+    "pipeline",
+    "multi",
+    "subscribe",
+    "psubscribe",
+    "unsubscribe",
+    "unpsubscribe",
+    "select",
+    "client",
+];
+function executeAutoPipeline(client, slotKey) {
+    /*
+      If a pipeline is already executing, keep queueing up commands
+      since ioredis won't serve two pipelines at the same time
+    */
+    if (client._runningAutoPipelines.has(slotKey)) {
+        return;
+    }
+    if (!client._autoPipelines.has(slotKey)) {
+        /*
+          Rare edge case. Somehow, something has deleted this running autopipeline in an immediate
+          call to executeAutoPipeline.
+         
+          Maybe the callback in the pipeline.exec is sometimes called in the same tick,
+          e.g. if redis is disconnected?
+        */
+        return;
+    }
+    client._runningAutoPipelines.add(slotKey);
+    // Get the pipeline and immediately delete it so that new commands are queued on a new pipeline
+    const pipeline = client._autoPipelines.get(slotKey);
+    client._autoPipelines.delete(slotKey);
+    const callbacks = pipeline[exports.kCallbacks];
+    // Stop keeping a reference to callbacks immediately after the callbacks stop being used.
+    // This allows the GC to reclaim objects referenced by callbacks, especially with 16384 slots
+    // in Redis.Cluster
+    pipeline[exports.kCallbacks] = null;
+    // Perform the call
+    pipeline.exec(function (err, results) {
+        client._runningAutoPipelines.delete(slotKey);
+        /*
+          Invoke all callback in nextTick so the stack is cleared
+          and callbacks can throw errors without affecting other callbacks.
+        */
+        if (err) {
+            for (let i = 0; i < callbacks.length; i++) {
+                process.nextTick(callbacks[i], err);
+            }
+        }
+        else {
+            for (let i = 0; i < callbacks.length; i++) {
+                process.nextTick(callbacks[i], ...results[i]);
+            }
+        }
+        // If there is another pipeline on the same node, immediately execute it without waiting for nextTick
+        if (client._autoPipelines.has(slotKey)) {
+            executeAutoPipeline(client, slotKey);
+        }
+    });
+}
+function shouldUseAutoPipelining(client, functionName, commandName) {
+    return (functionName &&
+        client.options.enableAutoPipelining &&
+        !client.isPipeline &&
+        !exports.notAllowedAutoPipelineCommands.includes(commandName) &&
+        !client.options.autoPipeliningIgnoredCommands.includes(commandName));
+}
+exports.shouldUseAutoPipelining = shouldUseAutoPipelining;
+function getFirstValueInFlattenedArray(args) {
+    for (let i = 0; i < args.length; i++) {
+        const arg = args[i];
+        if (typeof arg === "string") {
+            return arg;
+        }
+        else if (Array.isArray(arg) || (0, lodash_1.isArguments)(arg)) {
+            if (arg.length === 0) {
+                continue;
+            }
+            return arg[0];
+        }
+        const flattened = [arg].flat();
+        if (flattened.length > 0) {
+            return flattened[0];
+        }
+    }
+    return undefined;
+}
+exports.getFirstValueInFlattenedArray = getFirstValueInFlattenedArray;
+function executeWithAutoPipelining(client, functionName, commandName, args, callback) {
+    // On cluster mode let's wait for slots to be available
+    if (client.isCluster && !client.slots.length) {
+        if (client.status === "wait")
+            client.connect().catch(lodash_1.noop);
+        return (0, standard_as_callback_1.default)(new Promise(function (resolve, reject) {
+            client.delayUntilReady((err) => {
+                if (err) {
+                    reject(err);
+                    return;
+                }
+                executeWithAutoPipelining(client, functionName, commandName, args, null).then(resolve, reject);
+            });
+        }), callback);
+    }
+    // If we have slot information, we can improve routing by grouping slots served by the same subset of nodes
+    // Note that the first value in args may be a (possibly empty) array.
+    // ioredis will only flatten one level of the array, in the Command constructor.
+    const prefix = client.options.keyPrefix || "";
+    let slotKey = client.isCluster
+        ? client.slots[calculateSlot(`${prefix}${getFirstValueInFlattenedArray(args)}`)].join(",")
+        : "main";
+    // When scaleReads is enabled, separate read and write commands into different pipelines
+    // so they can be routed to replicas and masters respectively
+    if (client.isCluster && client.options.scaleReads !== "master") {
+        const isReadOnly = (0, commands_1.exists)(commandName) && (0, commands_1.hasFlag)(commandName, "readonly");
+        slotKey += isReadOnly ? ":read" : ":write";
+    }
+    if (!client._autoPipelines.has(slotKey)) {
+        const pipeline = client.pipeline();
+        pipeline[exports.kExec] = false;
+        pipeline[exports.kCallbacks] = [];
+        client._autoPipelines.set(slotKey, pipeline);
+    }
+    const pipeline = client._autoPipelines.get(slotKey);
+    /*
+      Mark the pipeline as scheduled.
+      The symbol will make sure that the pipeline is only scheduled once per tick.
+      New commands are appended to an already scheduled pipeline.
+    */
+    if (!pipeline[exports.kExec]) {
+        pipeline[exports.kExec] = true;
+        /*
+          Deferring with setImmediate so we have a chance to capture multiple
+          commands that can be scheduled by I/O events already in the event loop queue.
+        */
+        setImmediate(executeAutoPipeline, client, slotKey);
+    }
+    // Create the promise which will execute the command in the pipeline.
+    const autoPipelinePromise = new Promise(function (resolve, reject) {
+        pipeline[exports.kCallbacks].push(function (err, value) {
+            if (err) {
+                reject(err);
+                return;
+            }
+            resolve(value);
+        });
+        if (functionName === "call") {
+            args.unshift(commandName);
+        }
+        pipeline[functionName](...args);
+    });
+    return (0, standard_as_callback_1.default)(autoPipelinePromise, callback);
+}
+exports.executeWithAutoPipelining = executeWithAutoPipelining;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.d.ts
new file mode 100644
index 0000000..80c7e2c
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.d.ts
@@ -0,0 +1,172 @@
+/// <reference types="node" />
+import { SrvRecord } from "dns";
+import { RedisOptions } from "../redis/RedisOptions";
+import { CommanderOptions } from "../utils/Commander";
+import { NodeRole } from "./util";
+export declare type DNSResolveSrvFunction = (hostname: string, callback: (err: NodeJS.ErrnoException | null | undefined, records?: SrvRecord[]) => void) => void;
+export declare type DNSLookupFunction = (hostname: string, callback: (err: NodeJS.ErrnoException | null | undefined, address: string, family?: number) => void) => void;
+export declare type NatMapFunction = (key: string) => {
+    host: string;
+    port: number;
+} | null;
+export declare type NatMap = {
+    [key: string]: {
+        host: string;
+        port: number;
+    };
+} | NatMapFunction;
+/**
+ * Options for Cluster constructor
+ */
+export interface ClusterOptions extends CommanderOptions {
+    /**
+     * See "Quick Start" section.
+     *
+     * @default (times) => Math.min(100 + times * 2, 2000)
+     */
+    clusterRetryStrategy?: ((times: number, reason?: Error) => number | void | null) | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default true
+     */
+    enableOfflineQueue?: boolean | undefined;
+    /**
+     * When enabled, ioredis only emits "ready" event when `CLUSTER INFO`
+     * command reporting the cluster is ready for handling commands.
+     *
+     * @default true
+     */
+    enableReadyCheck?: boolean | undefined;
+    /**
+     * Scale reads to the node with the specified role.
+     *
+     * @default "master"
+     */
+    scaleReads?: NodeRole | Function | undefined;
+    /**
+     * When a MOVED or ASK error is received, client will redirect the
+     * command to another node.
+     * This option limits the max redirections allowed to send a command.
+     *
+     * @default 16
+     */
+    maxRedirections?: number | undefined;
+    /**
+     * When an error is received when sending a command (e.g.
+     * "Connection is closed." when the target Redis node is down), client will retry
+     * if `retryDelayOnFailover` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnFailover?: number | undefined;
+    /**
+     * When a CLUSTERDOWN error is received, client will retry
+     * if `retryDelayOnClusterDown` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnClusterDown?: number | undefined;
+    /**
+     * When a TRYAGAIN error is received, client will retry
+     * if `retryDelayOnTryAgain` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnTryAgain?: number | undefined;
+    /**
+     * By default, this value is 0, which means when a `MOVED` error is received,
+     * the client will resend the command instantly to the node returned together with
+     * the `MOVED` error. However, sometimes it takes time for a cluster to become
+     * state stabilized after a failover, so adding a delay before resending can
+     * prevent a ping pong effect.
+     *
+     * @default 0
+     */
+    retryDelayOnMoved?: number | undefined;
+    /**
+     * The milliseconds before a timeout occurs while refreshing
+     * slots from the cluster.
+     *
+     * @default 1000
+     */
+    slotsRefreshTimeout?: number | undefined;
+    /**
+     * The milliseconds between every automatic slots refresh.
+     *
+     * @default 5000
+     */
+    slotsRefreshInterval?: number | undefined;
+    /**
+     * Use sharded subscribers instead of a single subscriber.
+     *
+     * If sharded subscribers are used, then one additional subscriber connection per master node
+     * is established. If you don't plan to use SPUBLISH/SSUBSCRIBE, then this should be disabled.
+     *
+     * @default false
+     */
+    shardedSubscribers?: boolean | undefined;
+    /**
+     * Passed to the constructor of `Redis`
+     *
+     * @default null
+     */
+    redisOptions?: Omit<RedisOptions, "port" | "host" | "path" | "sentinels" | "retryStrategy" | "enableOfflineQueue" | "readOnly"> | undefined;
+    /**
+     * By default, When a new Cluster instance is created,
+     * it will connect to the Redis cluster automatically.
+     * If you want to keep the instance disconnected until the first command is called,
+     * set this option to `true`.
+     *
+     * @default false
+     */
+    lazyConnect?: boolean | undefined;
+    /**
+     * Discover nodes using SRV records
+     *
+     * @default false
+     */
+    useSRVRecords?: boolean | undefined;
+    /**
+     * SRV records will be resolved via this function.
+     *
+     * You may provide a custom `resolveSrv` function when you want to customize
+     * the cache behavior of the default function.
+     *
+     * @default require('dns').resolveSrv
+     */
+    resolveSrv?: DNSResolveSrvFunction | undefined;
+    /**
+     * Hostnames will be resolved to IP addresses via this function.
+     * This is needed when the addresses of startup nodes are hostnames instead
+     * of IPs.
+     *
+     * You may provide a custom `lookup` function when you want to customize
+     * the cache behavior of the default function.
+     *
+     * @default require('dns').lookup
+     */
+    dnsLookup?: DNSLookupFunction | undefined;
+    natMap?: NatMap | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default false
+     */
+    enableAutoPipelining?: boolean | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default []
+     */
+    autoPipeliningIgnoredCommands?: string[] | undefined;
+    /**
+     * Custom LUA commands
+     */
+    scripts?: Record<string, {
+        lua: string;
+        numberOfKeys?: number;
+        readOnly?: boolean;
+    }> | undefined;
+}
+export declare const DEFAULT_CLUSTER_OPTIONS: ClusterOptions;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.js
new file mode 100644
index 0000000..8c3e2e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterOptions.js
@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_CLUSTER_OPTIONS = void 0;
+const dns_1 = require("dns");
+exports.DEFAULT_CLUSTER_OPTIONS = {
+    clusterRetryStrategy: (times) => Math.min(100 + times * 2, 2000),
+    enableOfflineQueue: true,
+    enableReadyCheck: true,
+    scaleReads: "master",
+    maxRedirections: 16,
+    retryDelayOnMoved: 0,
+    retryDelayOnFailover: 100,
+    retryDelayOnClusterDown: 100,
+    retryDelayOnTryAgain: 100,
+    slotsRefreshTimeout: 1000,
+    useSRVRecords: false,
+    resolveSrv: dns_1.resolveSrv,
+    dnsLookup: dns_1.lookup,
+    enableAutoPipelining: false,
+    autoPipeliningIgnoredCommands: [],
+    shardedSubscribers: false,
+};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts
new file mode 100644
index 0000000..93a221a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts
@@ -0,0 +1,29 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import ConnectionPool from "./ConnectionPool";
+export default class ClusterSubscriber {
+    private connectionPool;
+    private emitter;
+    private isSharded;
+    private started;
+    private subscriber;
+    private lastActiveSubscriber;
+    private slotRange;
+    constructor(connectionPool: ConnectionPool, emitter: EventEmitter, isSharded?: boolean);
+    getInstance(): any;
+    /**
+     * Associate this subscriber to a specific slot range.
+     *
+     * Returns the range or an empty array if the slot range couldn't be associated.
+     *
+     * BTW: This is more for debugging and testing purposes.
+     *
+     * @param range
+     */
+    associateSlotRange(range: number[]): number[];
+    start(): void;
+    stop(): void;
+    isStarted(): boolean;
+    private onSubscriberEnd;
+    private selectSubscriber;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.js
new file mode 100644
index 0000000..ceb02cd
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriber.js
@@ -0,0 +1,223 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const util_1 = require("./util");
+const utils_1 = require("../utils");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:subscriber");
+class ClusterSubscriber {
+    constructor(connectionPool, emitter, isSharded = false) {
+        this.connectionPool = connectionPool;
+        this.emitter = emitter;
+        this.isSharded = isSharded;
+        this.started = false;
+        //There is only one connection for the entire pool
+        this.subscriber = null;
+        //The slot range for which this subscriber is responsible
+        this.slotRange = [];
+        this.onSubscriberEnd = () => {
+            if (!this.started) {
+                debug("subscriber has disconnected, but ClusterSubscriber is not started, so not reconnecting.");
+                return;
+            }
+            // If the subscriber closes whilst it's still the active connection,
+            // we might as well try to connecting to a new node if possible to
+            // minimise the number of missed publishes.
+            debug("subscriber has disconnected, selecting a new one...");
+            this.selectSubscriber();
+        };
+        // If the current node we're using as the subscriber disappears
+        // from the node pool for some reason, we will select a new one
+        // to connect to.
+        // Note that this event is only triggered if the connection to
+        // the node has been used; cluster subscriptions are setup with
+        // lazyConnect = true. It's possible for the subscriber node to
+        // disappear without this method being called!
+        // See https://github.com/luin/ioredis/pull/1589
+        this.connectionPool.on("-node", (_, key) => {
+            if (!this.started || !this.subscriber) {
+                return;
+            }
+            if ((0, util_1.getNodeKey)(this.subscriber.options) === key) {
+                debug("subscriber has left, selecting a new one...");
+                this.selectSubscriber();
+            }
+        });
+        this.connectionPool.on("+node", () => {
+            if (!this.started || this.subscriber) {
+                return;
+            }
+            debug("a new node is discovered and there is no subscriber, selecting a new one...");
+            this.selectSubscriber();
+        });
+    }
+    getInstance() {
+        return this.subscriber;
+    }
+    /**
+     * Associate this subscriber to a specific slot range.
+     *
+     * Returns the range or an empty array if the slot range couldn't be associated.
+     *
+     * BTW: This is more for debugging and testing purposes.
+     *
+     * @param range
+     */
+    associateSlotRange(range) {
+        if (this.isSharded) {
+            this.slotRange = range;
+        }
+        return this.slotRange;
+    }
+    start() {
+        this.started = true;
+        this.selectSubscriber();
+        debug("started");
+    }
+    stop() {
+        this.started = false;
+        if (this.subscriber) {
+            this.subscriber.disconnect();
+            this.subscriber = null;
+        }
+    }
+    isStarted() {
+        return this.started;
+    }
+    selectSubscriber() {
+        const lastActiveSubscriber = this.lastActiveSubscriber;
+        // Disconnect the previous subscriber even if there
+        // will not be a new one.
+        if (lastActiveSubscriber) {
+            lastActiveSubscriber.off("end", this.onSubscriberEnd);
+            lastActiveSubscriber.disconnect();
+        }
+        if (this.subscriber) {
+            this.subscriber.off("end", this.onSubscriberEnd);
+            this.subscriber.disconnect();
+        }
+        const sampleNode = (0, utils_1.sample)(this.connectionPool.getNodes());
+        if (!sampleNode) {
+            debug("selecting subscriber failed since there is no node discovered in the cluster yet");
+            this.subscriber = null;
+            return;
+        }
+        const { options } = sampleNode;
+        debug("selected a subscriber %s:%s", options.host, options.port);
+        /*
+         * Create a specialized Redis connection for the subscription.
+         * Note that auto reconnection is enabled here.
+         *
+         * `enableReadyCheck` is also enabled because although subscription is allowed
+         * while redis is loading data from the disk, we can check if the password
+         * provided for the subscriber is correct, and if not, the current subscriber
+         * will be disconnected and a new subscriber will be selected.
+         */
+        let connectionPrefix = "subscriber";
+        if (this.isSharded)
+            connectionPrefix = "ssubscriber";
+        this.subscriber = new Redis_1.default({
+            port: options.port,
+            host: options.host,
+            username: options.username,
+            password: options.password,
+            enableReadyCheck: true,
+            connectionName: (0, util_1.getConnectionName)(connectionPrefix, options.connectionName),
+            lazyConnect: true,
+            tls: options.tls,
+            // Don't try to reconnect the subscriber connection. If the connection fails
+            // we will get an end event (handled below), at which point we'll pick a new
+            // node from the pool and try to connect to that as the subscriber connection.
+            retryStrategy: null,
+        });
+        // Ignore the errors since they're handled in the connection pool.
+        this.subscriber.on("error", utils_1.noop);
+        this.subscriber.on("moved", () => {
+            this.emitter.emit("forceRefresh");
+        });
+        // The node we lost connection to may not come back up in a
+        // reasonable amount of time (e.g. a slave that's taken down
+        // for maintainence), we could potentially miss many published
+        // messages so we should reconnect as quickly as possible, to
+        // a different node if needed.
+        this.subscriber.once("end", this.onSubscriberEnd);
+        // Re-subscribe previous channels
+        const previousChannels = { subscribe: [], psubscribe: [], ssubscribe: [] };
+        if (lastActiveSubscriber) {
+            const condition = lastActiveSubscriber.condition || lastActiveSubscriber.prevCondition;
+            if (condition && condition.subscriber) {
+                previousChannels.subscribe = condition.subscriber.channels("subscribe");
+                previousChannels.psubscribe =
+                    condition.subscriber.channels("psubscribe");
+                previousChannels.ssubscribe =
+                    condition.subscriber.channels("ssubscribe");
+            }
+        }
+        if (previousChannels.subscribe.length ||
+            previousChannels.psubscribe.length ||
+            previousChannels.ssubscribe.length) {
+            let pending = 0;
+            for (const type of ["subscribe", "psubscribe", "ssubscribe"]) {
+                const channels = previousChannels[type];
+                if (channels.length == 0) {
+                    continue;
+                }
+                debug("%s %d channels", type, channels.length);
+                if (type === "ssubscribe") {
+                    for (const channel of channels) {
+                        pending += 1;
+                        this.subscriber[type](channel)
+                            .then(() => {
+                            if (!--pending) {
+                                this.lastActiveSubscriber = this.subscriber;
+                            }
+                        })
+                            .catch(() => {
+                            // TODO: should probably disconnect the subscriber and try again.
+                            debug("failed to ssubscribe to channel: %s", channel);
+                        });
+                    }
+                }
+                else {
+                    pending += 1;
+                    this.subscriber[type](channels)
+                        .then(() => {
+                        if (!--pending) {
+                            this.lastActiveSubscriber = this.subscriber;
+                        }
+                    })
+                        .catch(() => {
+                        // TODO: should probably disconnect the subscriber and try again.
+                        debug("failed to %s %d channels", type, channels.length);
+                    });
+                }
+            }
+        }
+        else {
+            this.lastActiveSubscriber = this.subscriber;
+        }
+        for (const event of [
+            "message",
+            "messageBuffer",
+        ]) {
+            this.subscriber.on(event, (arg1, arg2) => {
+                this.emitter.emit(event, arg1, arg2);
+            });
+        }
+        for (const event of ["pmessage", "pmessageBuffer"]) {
+            this.subscriber.on(event, (arg1, arg2, arg3) => {
+                this.emitter.emit(event, arg1, arg2, arg3);
+            });
+        }
+        if (this.isSharded == true) {
+            for (const event of [
+                "smessage",
+                "smessageBuffer",
+            ]) {
+                this.subscriber.on(event, (arg1, arg2) => {
+                    this.emitter.emit(event, arg1, arg2);
+                });
+            }
+        }
+    }
+}
+exports.default = ClusterSubscriber;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts
new file mode 100644
index 0000000..496b96d
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts
@@ -0,0 +1,108 @@
+/// <reference types="node" />
+import * as EventEmitter from "events";
+import ShardedSubscriber from "./ShardedSubscriber";
+import { ClusterOptions } from "./ClusterOptions";
+/**
+ * Redis distinguishes between "normal" and sharded PubSub. When using the normal PubSub feature,
+ * exactly one subscriber exists per cluster instance because the Redis cluster bus forwards
+ * messages between shards. Sharded PubSub removes this limitation by making each shard
+ * responsible for its own messages.
+ *
+ * This class coordinates one ShardedSubscriber per master node in the cluster, providing
+ * sharded PubSub support while keeping the public API backward compatible.
+ */
+export default class ClusterSubscriberGroup {
+    private readonly subscriberGroupEmitter;
+    private readonly options;
+    private shardedSubscribers;
+    private clusterSlots;
+    private subscriberToSlotsIndex;
+    private channels;
+    private failedAttemptsByNode;
+    private isResetting;
+    private pendingReset;
+    private static readonly MAX_RETRY_ATTEMPTS;
+    private static readonly MAX_BACKOFF_MS;
+    private static readonly BASE_BACKOFF_MS;
+    /**
+     * Register callbacks
+     *
+     * @param cluster
+     */
+    constructor(subscriberGroupEmitter: EventEmitter, options: ClusterOptions);
+    /**
+     * Get the responsible subscriber.
+     *
+     * @param slot
+     */
+    getResponsibleSubscriber(slot: number): ShardedSubscriber | undefined;
+    /**
+     * Adds a channel for which this subscriber group is responsible
+     *
+     * @param channels
+     */
+    addChannels(channels: (string | Buffer)[]): number;
+    /**
+     * Removes channels for which the subscriber group is responsible by optionally unsubscribing
+     * @param channels
+     */
+    removeChannels(channels: (string | Buffer)[]): number;
+    /**
+     * Disconnect all subscribers and clear some of the internal state.
+     */
+    stop(): void;
+    /**
+     * Start all not yet started subscribers
+     */
+    start(): Promise<any[]>;
+    /**
+     * Resets the subscriber group by disconnecting all subscribers that are no longer needed and connecting new ones.
+     */
+    reset(clusterSlots: string[][], clusterNodes: any[]): Promise<void>;
+    /**
+     * Refreshes the subscriber-related slot ranges
+     *
+     * Returns false if no refresh was needed
+     *
+     * @param targetSlots
+     */
+    private _refreshSlots;
+    /**
+     * Resubscribes to the previous channels
+     *
+     * @private
+     */
+    private _resubscribe;
+    /**
+     * Deep equality of the cluster slots objects
+     *
+     * @param other
+     * @private
+     */
+    private _slotsAreEqual;
+    /**
+     * Checks if any subscribers are in an unhealthy state.
+     *
+     * A subscriber is considered unhealthy if:
+     * - It exists but is not started (failed/disconnected)
+     * - It's missing entirely for a node that should have one
+     *
+     * @returns true if any subscribers need to be recreated
+     */
+    private hasUnhealthySubscribers;
+    /**
+     * Handles failed subscriber connections by emitting an event to refresh the slots cache
+     * after a backoff period.
+     *
+     * @param error
+     * @param nodeKey
+     */
+    private handleSubscriberConnectFailed;
+    /**
+     * Handles successful subscriber connections by resetting the failed attempts counter.
+     *
+     * @param nodeKey
+     */
+    private handleSubscriberConnectSucceeded;
+    private shouldStartSubscriber;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js
new file mode 100644
index 0000000..8f524a8
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js
@@ -0,0 +1,373 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const util_1 = require("./util");
+const calculateSlot = require("cluster-key-slot");
+const ShardedSubscriber_1 = require("./ShardedSubscriber");
+const debug = (0, utils_1.Debug)("cluster:subscriberGroup");
+/**
+ * Redis distinguishes between "normal" and sharded PubSub. When using the normal PubSub feature,
+ * exactly one subscriber exists per cluster instance because the Redis cluster bus forwards
+ * messages between shards. Sharded PubSub removes this limitation by making each shard
+ * responsible for its own messages.
+ *
+ * This class coordinates one ShardedSubscriber per master node in the cluster, providing
+ * sharded PubSub support while keeping the public API backward compatible.
+ */
+class ClusterSubscriberGroup {
+    /**
+     * Register callbacks
+     *
+     * @param cluster
+     */
+    constructor(subscriberGroupEmitter, options) {
+        this.subscriberGroupEmitter = subscriberGroupEmitter;
+        this.options = options;
+        this.shardedSubscribers = new Map();
+        this.clusterSlots = [];
+        // Simple [min, max] slot ranges aren't enough because you can migrate single slots
+        this.subscriberToSlotsIndex = new Map();
+        this.channels = new Map();
+        this.failedAttemptsByNode = new Map();
+        // Only latest pending reset kept; throttled by refreshSlotsCache's isRefreshing + backoff delay
+        this.isResetting = false;
+        this.pendingReset = null;
+        /**
+         * Handles failed subscriber connections by emitting an event to refresh the slots cache
+         * after a backoff period.
+         *
+         * @param error
+         * @param nodeKey
+         */
+        this.handleSubscriberConnectFailed = (error, nodeKey) => {
+            const currentAttempts = this.failedAttemptsByNode.get(nodeKey) || 0;
+            const failedAttempts = currentAttempts + 1;
+            this.failedAttemptsByNode.set(nodeKey, failedAttempts);
+            const attempts = Math.min(failedAttempts, ClusterSubscriberGroup.MAX_RETRY_ATTEMPTS);
+            const backoff = Math.min(ClusterSubscriberGroup.BASE_BACKOFF_MS * 2 ** attempts, ClusterSubscriberGroup.MAX_BACKOFF_MS);
+            const jitter = Math.floor((Math.random() - 0.5) * (backoff * 0.5));
+            const delay = Math.max(0, backoff + jitter);
+            debug("Failed to connect subscriber for %s. Refreshing slots in %dms", nodeKey, delay);
+            this.subscriberGroupEmitter.emit("subscriberConnectFailed", {
+                delay,
+                error,
+            });
+        };
+        /**
+         * Handles successful subscriber connections by resetting the failed attempts counter.
+         *
+         * @param nodeKey
+         */
+        this.handleSubscriberConnectSucceeded = (nodeKey) => {
+            this.failedAttemptsByNode.delete(nodeKey);
+        };
+    }
+    /**
+     * Get the responsible subscriber.
+     *
+     * @param slot
+     */
+    getResponsibleSubscriber(slot) {
+        const nodeKey = this.clusterSlots[slot][0];
+        const sub = this.shardedSubscribers.get(nodeKey);
+        if (sub && sub.subscriberStatus === "idle") {
+            sub
+                .start()
+                .then(() => {
+                this.handleSubscriberConnectSucceeded(sub.getNodeKey());
+            })
+                .catch((err) => {
+                this.handleSubscriberConnectFailed(err, sub.getNodeKey());
+            });
+        }
+        return sub;
+    }
+    /**
+     * Adds a channel for which this subscriber group is responsible
+     *
+     * @param channels
+     */
+    addChannels(channels) {
+        const slot = calculateSlot(channels[0]);
+        // Check if the all channels belong to the same slot and otherwise reject the operation
+        for (const c of channels) {
+            if (calculateSlot(c) !== slot) {
+                return -1;
+            }
+        }
+        const currChannels = this.channels.get(slot);
+        if (!currChannels) {
+            this.channels.set(slot, channels);
+        }
+        else {
+            this.channels.set(slot, currChannels.concat(channels));
+        }
+        return Array.from(this.channels.values()).reduce((sum, array) => sum + array.length, 0);
+    }
+    /**
+     * Removes channels for which the subscriber group is responsible by optionally unsubscribing
+     * @param channels
+     */
+    removeChannels(channels) {
+        const slot = calculateSlot(channels[0]);
+        // Check if the all channels belong to the same slot and otherwise reject the operation
+        for (const c of channels) {
+            if (calculateSlot(c) !== slot) {
+                return -1;
+            }
+        }
+        const slotChannels = this.channels.get(slot);
+        if (slotChannels) {
+            const updatedChannels = slotChannels.filter((c) => !channels.includes(c));
+            this.channels.set(slot, updatedChannels);
+        }
+        return Array.from(this.channels.values()).reduce((sum, array) => sum + array.length, 0);
+    }
+    /**
+     * Disconnect all subscribers and clear some of the internal state.
+     */
+    stop() {
+        for (const s of this.shardedSubscribers.values()) {
+            s.stop();
+        }
+        // Clear subscriber instances and pending operations.
+        // Channels are preserved for resubscription on reconnect.
+        this.pendingReset = null;
+        this.shardedSubscribers.clear();
+        this.subscriberToSlotsIndex.clear();
+    }
+    /**
+     * Start all not yet started subscribers
+     */
+    start() {
+        const startPromises = [];
+        for (const s of this.shardedSubscribers.values()) {
+            if (this.shouldStartSubscriber(s)) {
+                startPromises.push(s
+                    .start()
+                    .then(() => {
+                    this.handleSubscriberConnectSucceeded(s.getNodeKey());
+                })
+                    .catch((err) => {
+                    this.handleSubscriberConnectFailed(err, s.getNodeKey());
+                }));
+                this.subscriberGroupEmitter.emit("+subscriber");
+            }
+        }
+        return Promise.all(startPromises);
+    }
+    /**
+     * Resets the subscriber group by disconnecting all subscribers that are no longer needed and connecting new ones.
+     */
+    async reset(clusterSlots, clusterNodes) {
+        if (this.isResetting) {
+            this.pendingReset = { slots: clusterSlots, nodes: clusterNodes };
+            return;
+        }
+        this.isResetting = true;
+        try {
+            const hasTopologyChanged = this._refreshSlots(clusterSlots);
+            const hasFailedSubscribers = this.hasUnhealthySubscribers();
+            if (!hasTopologyChanged && !hasFailedSubscribers) {
+                debug("No topology change detected or failed subscribers. Skipping reset.");
+                return;
+            }
+            // For each of the sharded subscribers
+            for (const [nodeKey, shardedSubscriber] of this.shardedSubscribers) {
+                if (
+                // If the subscriber is still responsible for a slot range and is healthy then keep it
+                this.subscriberToSlotsIndex.has(nodeKey) &&
+                    shardedSubscriber.isHealthy()) {
+                    debug("Skipping deleting subscriber for %s", nodeKey);
+                    continue;
+                }
+                debug("Removing subscriber for %s", nodeKey);
+                // Otherwise stop the subscriber and remove it
+                shardedSubscriber.stop();
+                this.shardedSubscribers.delete(nodeKey);
+                this.subscriberGroupEmitter.emit("-subscriber");
+            }
+            const startPromises = [];
+            // For each node in slots cache
+            for (const [nodeKey, _] of this.subscriberToSlotsIndex) {
+                const existingSubscriber = this.shardedSubscribers.get(nodeKey);
+                // If we already have a subscriber for this node, only ensure it is healthy
+                // when it now owns slots with active channel subscriptions.
+                if (existingSubscriber && existingSubscriber.isHealthy()) {
+                    debug("Skipping creating new subscriber for %s", nodeKey);
+                    if (!existingSubscriber.isStarted() &&
+                        this.shouldStartSubscriber(existingSubscriber)) {
+                        startPromises.push(existingSubscriber
+                            .start()
+                            .then(() => {
+                            this.handleSubscriberConnectSucceeded(nodeKey);
+                        })
+                            .catch((error) => {
+                            this.handleSubscriberConnectFailed(error, nodeKey);
+                        }));
+                    }
+                    continue;
+                }
+                // If we have an existing subscriber but it is not healthy, stop it
+                if (existingSubscriber && !existingSubscriber.isHealthy()) {
+                    debug("Replacing subscriber for %s", nodeKey);
+                    existingSubscriber.stop();
+                    this.shardedSubscribers.delete(nodeKey);
+                    this.subscriberGroupEmitter.emit("-subscriber");
+                }
+                debug("Creating new subscriber for %s", nodeKey);
+                // Otherwise create a new subscriber
+                const redis = clusterNodes.find((node) => {
+                    return (0, util_1.getNodeKey)(node.options) === nodeKey;
+                });
+                if (!redis) {
+                    debug("Failed to find node for key %s", nodeKey);
+                    continue;
+                }
+                const sub = new ShardedSubscriber_1.default(this.subscriberGroupEmitter, redis.options, this.options.redisOptions);
+                this.shardedSubscribers.set(nodeKey, sub);
+                if (this.shouldStartSubscriber(sub)) {
+                    startPromises.push(sub
+                        .start()
+                        .then(() => {
+                        this.handleSubscriberConnectSucceeded(nodeKey);
+                    })
+                        .catch((error) => {
+                        this.handleSubscriberConnectFailed(error, nodeKey);
+                    }));
+                }
+                this.subscriberGroupEmitter.emit("+subscriber");
+            }
+            // It's vital to await the start promises before resubscribing
+            // Otherwise we might try to resubscribe to a subscriber that is not yet connected
+            // This can cause a race condition
+            await Promise.all(startPromises);
+            this._resubscribe();
+            this.subscriberGroupEmitter.emit("subscribersReady");
+        }
+        finally {
+            this.isResetting = false;
+            if (this.pendingReset) {
+                const { slots, nodes } = this.pendingReset;
+                this.pendingReset = null;
+                await this.reset(slots, nodes);
+            }
+        }
+    }
+    /**
+     * Refreshes the subscriber-related slot ranges
+     *
+     * Returns false if no refresh was needed
+     *
+     * @param targetSlots
+     */
+    _refreshSlots(targetSlots) {
+        //If there was an actual change, then reassign the slot ranges
+        // Also rebuild if subscriberToSlotsIndex is empty (e.g., after stop() was called)
+        if (this._slotsAreEqual(targetSlots) && this.subscriberToSlotsIndex.size > 0) {
+            debug("Nothing to refresh because the new cluster map is equal to the previous one.");
+            return false;
+        }
+        debug("Refreshing the slots of the subscriber group.");
+        //Rebuild the slots index
+        this.subscriberToSlotsIndex = new Map();
+        for (let slot = 0; slot < targetSlots.length; slot++) {
+            const node = targetSlots[slot][0];
+            if (!this.subscriberToSlotsIndex.has(node)) {
+                this.subscriberToSlotsIndex.set(node, []);
+            }
+            this.subscriberToSlotsIndex.get(node).push(Number(slot));
+        }
+        //Update the cached slots map
+        this.clusterSlots = JSON.parse(JSON.stringify(targetSlots));
+        return true;
+    }
+    /**
+     * Resubscribes to the previous channels
+     *
+     * @private
+     */
+    _resubscribe() {
+        if (this.shardedSubscribers) {
+            this.shardedSubscribers.forEach((s, nodeKey) => {
+                const subscriberSlots = this.subscriberToSlotsIndex.get(nodeKey);
+                if (subscriberSlots) {
+                    //Resubscribe on the underlying connection
+                    subscriberSlots.forEach((ss) => {
+                        //Might return null if being disconnected
+                        const redis = s.getInstance();
+                        const channels = this.channels.get(ss);
+                        if (channels && channels.length > 0) {
+                            if (!redis || redis.status === "end") {
+                                return;
+                            }
+                            if (redis.status === "ready") {
+                                redis.ssubscribe(...channels).catch((err) => {
+                                    // TODO: Should we emit an error event here?
+                                    debug("Failed to ssubscribe on node %s: %s", nodeKey, err);
+                                });
+                            }
+                            else {
+                                redis.once("ready", () => {
+                                    redis.ssubscribe(...channels).catch((err) => {
+                                        // TODO: Should we emit an error event here?
+                                        debug("Failed to ssubscribe on node %s: %s", nodeKey, err);
+                                    });
+                                });
+                            }
+                        }
+                    });
+                }
+            });
+        }
+    }
+    /**
+     * Deep equality of the cluster slots objects
+     *
+     * @param other
+     * @private
+     */
+    _slotsAreEqual(other) {
+        if (this.clusterSlots === undefined) {
+            return false;
+        }
+        else {
+            return JSON.stringify(this.clusterSlots) === JSON.stringify(other);
+        }
+    }
+    /**
+     * Checks if any subscribers are in an unhealthy state.
+     *
+     * A subscriber is considered unhealthy if:
+     * - It exists but is not started (failed/disconnected)
+     * - It's missing entirely for a node that should have one
+     *
+     * @returns true if any subscribers need to be recreated
+     */
+    hasUnhealthySubscribers() {
+        const hasFailedSubscribers = Array.from(this.shardedSubscribers.values()).some((sub) => !sub.isHealthy());
+        const hasMissingSubscribers = Array.from(this.subscriberToSlotsIndex.keys()).some((nodeKey) => !this.shardedSubscribers.has(nodeKey));
+        return hasFailedSubscribers || hasMissingSubscribers;
+    }
+    shouldStartSubscriber(sub) {
+        if (sub.isStarted()) {
+            return false;
+        }
+        if (!sub.isLazyConnect()) {
+            return true;
+        }
+        const subscriberSlots = this.subscriberToSlotsIndex.get(sub.getNodeKey());
+        if (!subscriberSlots) {
+            return false;
+        }
+        return subscriberSlots.some((slot) => {
+            const channels = this.channels.get(slot);
+            return Boolean(channels && channels.length > 0);
+        });
+    }
+}
+exports.default = ClusterSubscriberGroup;
+// Retry strategy
+ClusterSubscriberGroup.MAX_RETRY_ATTEMPTS = 10;
+ClusterSubscriberGroup.MAX_BACKOFF_MS = 2000;
+ClusterSubscriberGroup.BASE_BACKOFF_MS = 100;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.d.ts
new file mode 100644
index 0000000..0de5d7a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.d.ts
@@ -0,0 +1,37 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import { RedisOptions, NodeKey, NodeRole } from "./util";
+import Redis from "../Redis";
+export default class ConnectionPool extends EventEmitter {
+    private redisOptions;
+    private nodes;
+    private specifiedOptions;
+    constructor(redisOptions: any);
+    getNodes(role?: NodeRole): Redis[];
+    getInstanceByKey(key: NodeKey): Redis;
+    getSampleInstance(role: NodeRole): Redis;
+    /**
+     * Add a master node to the pool
+     * @param node
+     */
+    addMasterNode(node: RedisOptions): boolean;
+    /**
+     * Creates a Redis connection instance from the node options
+     * @param node
+     * @param readOnly
+     */
+    createRedisFromOptions(node: RedisOptions, readOnly: boolean): Redis;
+    /**
+     * Find or create a connection to the node
+     */
+    findOrCreate(node: RedisOptions, readOnly?: boolean): Redis;
+    /**
+     * Reset the pool with a set of nodes.
+     * The old node will be removed.
+     */
+    reset(nodes: RedisOptions[]): void;
+    /**
+     * Remove a node from the pool.
+     */
+    private removeNode;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.js
new file mode 100644
index 0000000..4fef1b8
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ConnectionPool.js
@@ -0,0 +1,154 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const events_1 = require("events");
+const utils_1 = require("../utils");
+const util_1 = require("./util");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:connectionPool");
+class ConnectionPool extends events_1.EventEmitter {
+    constructor(redisOptions) {
+        super();
+        this.redisOptions = redisOptions;
+        // master + slave = all
+        this.nodes = {
+            all: {},
+            master: {},
+            slave: {},
+        };
+        this.specifiedOptions = {};
+    }
+    getNodes(role = "all") {
+        const nodes = this.nodes[role];
+        return Object.keys(nodes).map((key) => nodes[key]);
+    }
+    getInstanceByKey(key) {
+        return this.nodes.all[key];
+    }
+    getSampleInstance(role) {
+        const keys = Object.keys(this.nodes[role]);
+        const sampleKey = (0, utils_1.sample)(keys);
+        return this.nodes[role][sampleKey];
+    }
+    /**
+     * Add a master node to the pool
+     * @param node
+     */
+    addMasterNode(node) {
+        const key = (0, util_1.getNodeKey)(node.options);
+        const redis = this.createRedisFromOptions(node, node.options.readOnly);
+        //Master nodes aren't read-only
+        if (!node.options.readOnly) {
+            this.nodes.all[key] = redis;
+            this.nodes.master[key] = redis;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Creates a Redis connection instance from the node options
+     * @param node
+     * @param readOnly
+     */
+    createRedisFromOptions(node, readOnly) {
+        const redis = new Redis_1.default((0, utils_1.defaults)({
+            // Never try to reconnect when a node is lose,
+            // instead, waiting for a `MOVED` error and
+            // fetch the slots again.
+            retryStrategy: null,
+            // Offline queue should be enabled so that
+            // we don't need to wait for the `ready` event
+            // before sending commands to the node.
+            enableOfflineQueue: true,
+            readOnly: readOnly,
+        }, node, this.redisOptions, { lazyConnect: true }));
+        return redis;
+    }
+    /**
+     * Find or create a connection to the node
+     */
+    findOrCreate(node, readOnly = false) {
+        const key = (0, util_1.getNodeKey)(node);
+        readOnly = Boolean(readOnly);
+        if (this.specifiedOptions[key]) {
+            Object.assign(node, this.specifiedOptions[key]);
+        }
+        else {
+            this.specifiedOptions[key] = node;
+        }
+        let redis;
+        if (this.nodes.all[key]) {
+            redis = this.nodes.all[key];
+            if (redis.options.readOnly !== readOnly) {
+                redis.options.readOnly = readOnly;
+                debug("Change role of %s to %s", key, readOnly ? "slave" : "master");
+                redis[readOnly ? "readonly" : "readwrite"]().catch(utils_1.noop);
+                if (readOnly) {
+                    delete this.nodes.master[key];
+                    this.nodes.slave[key] = redis;
+                }
+                else {
+                    delete this.nodes.slave[key];
+                    this.nodes.master[key] = redis;
+                }
+            }
+        }
+        else {
+            debug("Connecting to %s as %s", key, readOnly ? "slave" : "master");
+            redis = this.createRedisFromOptions(node, readOnly);
+            this.nodes.all[key] = redis;
+            this.nodes[readOnly ? "slave" : "master"][key] = redis;
+            redis.once("end", () => {
+                this.removeNode(key);
+                this.emit("-node", redis, key);
+                if (!Object.keys(this.nodes.all).length) {
+                    this.emit("drain");
+                }
+            });
+            this.emit("+node", redis, key);
+            redis.on("error", function (error) {
+                this.emit("nodeError", error, key);
+            });
+        }
+        return redis;
+    }
+    /**
+     * Reset the pool with a set of nodes.
+     * The old node will be removed.
+     */
+    reset(nodes) {
+        debug("Reset with %O", nodes);
+        const newNodes = {};
+        nodes.forEach((node) => {
+            const key = (0, util_1.getNodeKey)(node);
+            // Don't override the existing (master) node
+            // when the current one is slave.
+            if (!(node.readOnly && newNodes[key])) {
+                newNodes[key] = node;
+            }
+        });
+        Object.keys(this.nodes.all).forEach((key) => {
+            if (!newNodes[key]) {
+                debug("Disconnect %s because the node does not hold any slot", key);
+                this.nodes.all[key].disconnect();
+                this.removeNode(key);
+            }
+        });
+        Object.keys(newNodes).forEach((key) => {
+            const node = newNodes[key];
+            this.findOrCreate(node, node.readOnly);
+        });
+    }
+    /**
+     * Remove a node from the pool.
+     */
+    removeNode(key) {
+        const { nodes } = this;
+        if (nodes.all[key]) {
+            debug("Remove %s from the pool", key);
+            delete nodes.all[key];
+        }
+        delete nodes.master[key];
+        delete nodes.slave[key];
+    }
+}
+exports.default = ConnectionPool;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.d.ts
new file mode 100644
index 0000000..2d64896
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.d.ts
@@ -0,0 +1,20 @@
+export interface DelayQueueOptions {
+    callback?: Function;
+    timeout: number;
+}
+/**
+ * Queue that runs items after specified duration
+ */
+export default class DelayQueue {
+    private queues;
+    private timeouts;
+    /**
+     * Add a new item to the queue
+     *
+     * @param bucket bucket name
+     * @param item function that will run later
+     * @param options
+     */
+    push(bucket: string, item: Function, options: DelayQueueOptions): void;
+    private execute;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.js
new file mode 100644
index 0000000..e17df51
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/DelayQueue.js
@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const Deque = require("denque");
+const debug = (0, utils_1.Debug)("delayqueue");
+/**
+ * Queue that runs items after specified duration
+ */
+class DelayQueue {
+    constructor() {
+        this.queues = {};
+        this.timeouts = {};
+    }
+    /**
+     * Add a new item to the queue
+     *
+     * @param bucket bucket name
+     * @param item function that will run later
+     * @param options
+     */
+    push(bucket, item, options) {
+        const callback = options.callback || process.nextTick;
+        if (!this.queues[bucket]) {
+            this.queues[bucket] = new Deque();
+        }
+        const queue = this.queues[bucket];
+        queue.push(item);
+        if (!this.timeouts[bucket]) {
+            this.timeouts[bucket] = setTimeout(() => {
+                callback(() => {
+                    this.timeouts[bucket] = null;
+                    this.execute(bucket);
+                });
+            }, options.timeout);
+        }
+    }
+    execute(bucket) {
+        const queue = this.queues[bucket];
+        if (!queue) {
+            return;
+        }
+        const { length } = queue;
+        if (!length) {
+            return;
+        }
+        debug("send %d commands in %s queue", length, bucket);
+        this.queues[bucket] = null;
+        while (queue.length > 0) {
+            queue.shift()();
+        }
+    }
+}
+exports.default = DelayQueue;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts
new file mode 100644
index 0000000..921bcdb
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts
@@ -0,0 +1,36 @@
+/// <reference types="node" />
+import EventEmitter = require("events");
+import { RedisOptions } from "./util";
+import Redis from "../Redis";
+import { ClusterOptions } from "./ClusterOptions";
+declare const SubscriberStatus: {
+    readonly IDLE: "idle";
+    readonly STARTING: "starting";
+    readonly CONNECTED: "connected";
+    readonly STOPPING: "stopping";
+    readonly ENDED: "ended";
+};
+declare type SubscriberStatus = typeof SubscriberStatus[keyof typeof SubscriberStatus];
+export default class ShardedSubscriber {
+    private readonly emitter;
+    private readonly nodeKey;
+    private status;
+    private instance;
+    private connectPromise;
+    private lazyConnect;
+    private readonly messageListeners;
+    constructor(emitter: EventEmitter, options: RedisOptions, redisOptions?: ClusterOptions["redisOptions"]);
+    start(): Promise<void>;
+    stop(): void;
+    isStarted(): boolean;
+    get subscriberStatus(): SubscriberStatus;
+    isHealthy(): boolean;
+    getInstance(): Redis | null;
+    getNodeKey(): string;
+    isLazyConnect(): boolean;
+    private onEnd;
+    private onError;
+    private onMoved;
+    private updateStatus;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.js
new file mode 100644
index 0000000..163fb63
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/ShardedSubscriber.js
@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const util_1 = require("./util");
+const utils_1 = require("../utils");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:subscriberGroup:shardedSubscriber");
+const SubscriberStatus = {
+    IDLE: "idle",
+    STARTING: "starting",
+    CONNECTED: "connected",
+    STOPPING: "stopping",
+    ENDED: "ended",
+};
+const ALLOWED_STATUS_UPDATES = {
+    [SubscriberStatus.IDLE]: [
+        SubscriberStatus.STARTING,
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.STARTING]: [
+        SubscriberStatus.CONNECTED,
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.CONNECTED]: [
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.STOPPING]: [SubscriberStatus.ENDED],
+    [SubscriberStatus.ENDED]: [],
+};
+class ShardedSubscriber {
+    constructor(emitter, options, redisOptions) {
+        var _a;
+        this.emitter = emitter;
+        this.status = SubscriberStatus.IDLE;
+        this.instance = null;
+        this.connectPromise = null;
+        // Store listener references for cleanup
+        this.messageListeners = new Map();
+        this.onEnd = () => {
+            this.updateStatus(SubscriberStatus.ENDED);
+            this.emitter.emit("-node", this.instance, this.nodeKey);
+        };
+        this.onError = (error) => {
+            this.emitter.emit("nodeError", error, this.nodeKey);
+        };
+        this.onMoved = () => {
+            this.emitter.emit("moved");
+        };
+        this.instance = new Redis_1.default((0, utils_1.defaults)({
+            enableReadyCheck: false,
+            enableOfflineQueue: true,
+            connectionName: (0, util_1.getConnectionName)("ssubscriber", options.connectionName),
+            /**
+             * Disable auto reconnection for subscribers.
+             * The ClusterSubscriberGroup will handle the reconnection.
+             */
+            retryStrategy: null,
+            lazyConnect: true,
+        }, options, redisOptions));
+        this.lazyConnect = (_a = redisOptions === null || redisOptions === void 0 ? void 0 : redisOptions.lazyConnect) !== null && _a !== void 0 ? _a : true;
+        this.nodeKey = (0, util_1.getNodeKey)(options);
+        // Register listeners
+        this.instance.on("end", this.onEnd);
+        this.instance.on("error", this.onError);
+        this.instance.on("moved", this.onMoved);
+        for (const event of ["smessage", "smessageBuffer"]) {
+            const listener = (...args) => {
+                this.emitter.emit(event, ...args);
+            };
+            this.messageListeners.set(event, listener);
+            this.instance.on(event, listener);
+        }
+    }
+    async start() {
+        if (this.connectPromise) {
+            return this.connectPromise;
+        }
+        if (this.status === SubscriberStatus.STARTING ||
+            this.status === SubscriberStatus.CONNECTED) {
+            return;
+        }
+        if (this.status === SubscriberStatus.ENDED || !this.instance) {
+            throw new Error(`Sharded subscriber ${this.nodeKey} cannot be restarted once ended.`);
+        }
+        this.updateStatus(SubscriberStatus.STARTING);
+        this.connectPromise = this.instance.connect();
+        try {
+            await this.connectPromise;
+            this.updateStatus(SubscriberStatus.CONNECTED);
+        }
+        catch (err) {
+            this.updateStatus(SubscriberStatus.ENDED);
+            throw err;
+        }
+        finally {
+            this.connectPromise = null;
+        }
+    }
+    stop() {
+        this.updateStatus(SubscriberStatus.STOPPING);
+        if (this.instance) {
+            this.instance.disconnect();
+            this.instance.removeAllListeners();
+            this.messageListeners.clear();
+            this.instance = null;
+        }
+        this.updateStatus(SubscriberStatus.ENDED);
+        debug("stopped %s", this.nodeKey);
+    }
+    isStarted() {
+        return [
+            SubscriberStatus.CONNECTED,
+            SubscriberStatus.STARTING,
+        ].includes(this.status);
+    }
+    get subscriberStatus() {
+        return this.status;
+    }
+    isHealthy() {
+        return ((this.status === SubscriberStatus.IDLE ||
+            this.status === SubscriberStatus.CONNECTED ||
+            this.status === SubscriberStatus.STARTING) &&
+            this.instance !== null);
+    }
+    getInstance() {
+        return this.instance;
+    }
+    getNodeKey() {
+        return this.nodeKey;
+    }
+    isLazyConnect() {
+        return this.lazyConnect;
+    }
+    updateStatus(nextStatus) {
+        if (this.status === nextStatus) {
+            return;
+        }
+        if (!ALLOWED_STATUS_UPDATES[this.status].includes(nextStatus)) {
+            debug("Invalid status transition for %s: %s -> %s", this.nodeKey, this.status, nextStatus);
+            return;
+        }
+        this.status = nextStatus;
+    }
+}
+exports.default = ShardedSubscriber;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/index.d.ts
new file mode 100644
index 0000000..3f5e1b4
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/index.d.ts
@@ -0,0 +1,163 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import Command from "../Command";
+import Redis from "../Redis";
+import ScanStream from "../ScanStream";
+import { Transaction } from "../transaction";
+import { Callback, ScanStreamOptions, WriteableStream } from "../types";
+import Commander from "../utils/Commander";
+import { ClusterOptions } from "./ClusterOptions";
+import { NodeKey, NodeRole } from "./util";
+export declare type ClusterNode = string | number | {
+    host?: string | undefined;
+    port?: number | undefined;
+};
+declare type ClusterStatus = "end" | "close" | "wait" | "connecting" | "connect" | "ready" | "reconnecting" | "disconnecting";
+/**
+ * Client for the official Redis Cluster
+ */
+declare class Cluster extends Commander {
+    options: ClusterOptions;
+    slots: NodeKey[][];
+    status: ClusterStatus;
+    /**
+     * @ignore
+     */
+    _groupsIds: {
+        [key: string]: number;
+    };
+    /**
+     * @ignore
+     */
+    _groupsBySlot: number[];
+    /**
+     * @ignore
+     */
+    isCluster: boolean;
+    private startupNodes;
+    private connectionPool;
+    private manuallyClosing;
+    private retryAttempts;
+    private delayQueue;
+    private offlineQueue;
+    private subscriber;
+    private shardedSubscribers;
+    private slotsTimer;
+    private reconnectTimeout;
+    private isRefreshing;
+    private _refreshSlotsCacheCallbacks;
+    private _autoPipelines;
+    private _runningAutoPipelines;
+    private _readyDelayedCallbacks;
+    private subscriberGroupEmitter;
+    /**
+     * Every time Cluster#connect() is called, this value will be
+     * auto-incrementing. The purpose of this value is used for
+     * discarding previous connect attampts when creating a new
+     * connection.
+     */
+    private connectionEpoch;
+    /**
+     * Creates an instance of Cluster.
+     */
+    constructor(startupNodes: ClusterNode[], options?: ClusterOptions);
+    /**
+     * Connect to a cluster
+     */
+    connect(): Promise<void>;
+    /**
+     * Disconnect from every node in the cluster.
+     */
+    disconnect(reconnect?: boolean): void;
+    /**
+     * Quit the cluster gracefully.
+     */
+    quit(callback?: Callback<"OK">): Promise<"OK">;
+    /**
+     * Create a new instance with the same startup nodes and options as the current one.
+     *
+     * @example
+     * ```js
+     * var cluster = new Redis.Cluster([{ host: "127.0.0.1", port: "30001" }]);
+     * var anotherCluster = cluster.duplicate();
+     * ```
+     */
+    duplicate(overrideStartupNodes?: any[], overrideOptions?: {}): Cluster;
+    /**
+     * Get nodes with the specified role
+     */
+    nodes(role?: NodeRole): Redis[];
+    /**
+     * This is needed in order not to install a listener for each auto pipeline
+     *
+     * @ignore
+     */
+    delayUntilReady(callback: Callback): void;
+    /**
+     * Get the number of commands queued in automatic pipelines.
+     *
+     * This is not available (and returns 0) until the cluster is connected and slots information have been received.
+     */
+    get autoPipelineQueueSize(): number;
+    /**
+     * Refresh the slot cache
+     *
+     * @ignore
+     */
+    refreshSlotsCache(callback?: Callback<void>): void;
+    /**
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream, node?: any): unknown;
+    sscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    sscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    /**
+     * @ignore
+     */
+    handleError(error: Error, ttl: {
+        value?: any;
+    }, handlers: any): void;
+    private resetOfflineQueue;
+    private clearNodesRefreshInterval;
+    private resetNodesRefreshInterval;
+    /**
+     * Change cluster instance's status
+     */
+    private setStatus;
+    /**
+     * Called when closed to check whether a reconnection should be made
+     */
+    private handleCloseEvent;
+    /**
+     * Flush offline queue with error.
+     */
+    private flushQueue;
+    private executeOfflineCommands;
+    private natMapper;
+    private getInfoFromNode;
+    private invokeReadyDelayedCallbacks;
+    /**
+     * Check whether Cluster is able to process commands
+     */
+    private readyCheck;
+    private resolveSrv;
+    private dnsLookup;
+    /**
+     * Normalize startup nodes, and resolving hostnames to IPs.
+     *
+     * This process happens every time when #connect() is called since
+     * #startupNodes and DNS records may chanage.
+     */
+    private resolveStartupNodeHostnames;
+    private createScanStream;
+    private createShardedSubscriberGroup;
+}
+interface Cluster extends EventEmitter {
+}
+interface Cluster extends Transaction {
+}
+export default Cluster;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/index.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/index.js
new file mode 100644
index 0000000..1c8d57b
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/index.js
@@ -0,0 +1,937 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const events_1 = require("events");
+const redis_errors_1 = require("redis-errors");
+const standard_as_callback_1 = require("standard-as-callback");
+const Command_1 = require("../Command");
+const ClusterAllFailedError_1 = require("../errors/ClusterAllFailedError");
+const Redis_1 = require("../Redis");
+const ScanStream_1 = require("../ScanStream");
+const transaction_1 = require("../transaction");
+const utils_1 = require("../utils");
+const applyMixin_1 = require("../utils/applyMixin");
+const Commander_1 = require("../utils/Commander");
+const ClusterOptions_1 = require("./ClusterOptions");
+const ClusterSubscriber_1 = require("./ClusterSubscriber");
+const ConnectionPool_1 = require("./ConnectionPool");
+const DelayQueue_1 = require("./DelayQueue");
+const util_1 = require("./util");
+const Deque = require("denque");
+const ClusterSubscriberGroup_1 = require("./ClusterSubscriberGroup");
+const debug = (0, utils_1.Debug)("cluster");
+const REJECT_OVERWRITTEN_COMMANDS = new WeakSet();
+/**
+ * Client for the official Redis Cluster
+ */
+class Cluster extends Commander_1.default {
+    /**
+     * Creates an instance of Cluster.
+     */
+    //TODO: Add an option that enables or disables sharded PubSub
+    constructor(startupNodes, options = {}) {
+        super();
+        this.slots = [];
+        /**
+         * @ignore
+         */
+        this._groupsIds = {};
+        /**
+         * @ignore
+         */
+        this._groupsBySlot = Array(16384);
+        /**
+         * @ignore
+         */
+        this.isCluster = true;
+        this.retryAttempts = 0;
+        this.delayQueue = new DelayQueue_1.default();
+        this.offlineQueue = new Deque();
+        this.isRefreshing = false;
+        this._refreshSlotsCacheCallbacks = [];
+        this._autoPipelines = new Map();
+        this._runningAutoPipelines = new Set();
+        this._readyDelayedCallbacks = [];
+        /**
+         * Every time Cluster#connect() is called, this value will be
+         * auto-incrementing. The purpose of this value is used for
+         * discarding previous connect attampts when creating a new
+         * connection.
+         */
+        this.connectionEpoch = 0;
+        events_1.EventEmitter.call(this);
+        this.startupNodes = startupNodes;
+        this.options = (0, utils_1.defaults)({}, options, ClusterOptions_1.DEFAULT_CLUSTER_OPTIONS, this.options);
+        if (this.options.shardedSubscribers) {
+            this.createShardedSubscriberGroup();
+        }
+        if (this.options.redisOptions &&
+            this.options.redisOptions.keyPrefix &&
+            !this.options.keyPrefix) {
+            this.options.keyPrefix = this.options.redisOptions.keyPrefix;
+        }
+        // validate options
+        if (typeof this.options.scaleReads !== "function" &&
+            ["all", "master", "slave"].indexOf(this.options.scaleReads) === -1) {
+            throw new Error('Invalid option scaleReads "' +
+                this.options.scaleReads +
+                '". Expected "all", "master", "slave" or a custom function');
+        }
+        this.connectionPool = new ConnectionPool_1.default(this.options.redisOptions);
+        this.connectionPool.on("-node", (redis, key) => {
+            this.emit("-node", redis);
+        });
+        this.connectionPool.on("+node", (redis) => {
+            this.emit("+node", redis);
+        });
+        this.connectionPool.on("drain", () => {
+            this.setStatus("close");
+        });
+        this.connectionPool.on("nodeError", (error, key) => {
+            this.emit("node error", error, key);
+        });
+        this.subscriber = new ClusterSubscriber_1.default(this.connectionPool, this);
+        if (this.options.scripts) {
+            Object.entries(this.options.scripts).forEach(([name, definition]) => {
+                this.defineCommand(name, definition);
+            });
+        }
+        if (this.options.lazyConnect) {
+            this.setStatus("wait");
+        }
+        else {
+            this.connect().catch((err) => {
+                debug("connecting failed: %s", err);
+            });
+        }
+    }
+    /**
+     * Connect to a cluster
+     */
+    connect() {
+        return new Promise((resolve, reject) => {
+            if (this.status === "connecting" ||
+                this.status === "connect" ||
+                this.status === "ready") {
+                reject(new Error("Redis is already connecting/connected"));
+                return;
+            }
+            const epoch = ++this.connectionEpoch;
+            this.setStatus("connecting");
+            this.resolveStartupNodeHostnames()
+                .then((nodes) => {
+                if (this.connectionEpoch !== epoch) {
+                    debug("discard connecting after resolving startup nodes because epoch not match: %d != %d", epoch, this.connectionEpoch);
+                    reject(new redis_errors_1.RedisError("Connection is discarded because a new connection is made"));
+                    return;
+                }
+                if (this.status !== "connecting") {
+                    debug("discard connecting after resolving startup nodes because the status changed to %s", this.status);
+                    reject(new redis_errors_1.RedisError("Connection is aborted"));
+                    return;
+                }
+                this.connectionPool.reset(nodes);
+                if (this.options.shardedSubscribers) {
+                    this.shardedSubscribers
+                        .reset(this.slots, this.connectionPool.getNodes("all"))
+                        .catch((err) => {
+                        // TODO should we emit an error event here?
+                        debug("Error while starting subscribers: %s", err);
+                    });
+                }
+                const readyHandler = () => {
+                    this.setStatus("ready");
+                    this.retryAttempts = 0;
+                    this.executeOfflineCommands();
+                    this.resetNodesRefreshInterval();
+                    resolve();
+                };
+                let closeListener = undefined;
+                const refreshListener = () => {
+                    this.invokeReadyDelayedCallbacks(undefined);
+                    this.removeListener("close", closeListener);
+                    this.manuallyClosing = false;
+                    this.setStatus("connect");
+                    if (this.options.enableReadyCheck) {
+                        this.readyCheck((err, fail) => {
+                            if (err || fail) {
+                                debug("Ready check failed (%s). Reconnecting...", err || fail);
+                                if (this.status === "connect") {
+                                    this.disconnect(true);
+                                }
+                            }
+                            else {
+                                readyHandler();
+                            }
+                        });
+                    }
+                    else {
+                        readyHandler();
+                    }
+                };
+                closeListener = () => {
+                    const error = new Error("None of startup nodes is available");
+                    this.removeListener("refresh", refreshListener);
+                    this.invokeReadyDelayedCallbacks(error);
+                    reject(error);
+                };
+                this.once("refresh", refreshListener);
+                this.once("close", closeListener);
+                this.once("close", this.handleCloseEvent.bind(this));
+                this.refreshSlotsCache((err) => {
+                    if (err && err.message === ClusterAllFailedError_1.default.defaultMessage) {
+                        Redis_1.default.prototype.silentEmit.call(this, "error", err);
+                        this.connectionPool.reset([]);
+                    }
+                });
+                this.subscriber.start();
+                if (this.options.shardedSubscribers) {
+                    this.shardedSubscribers.start().catch((err) => {
+                        // TODO should we emit an error event here?
+                        debug("Error while starting subscribers: %s", err);
+                    });
+                }
+            })
+                .catch((err) => {
+                this.setStatus("close");
+                this.handleCloseEvent(err);
+                this.invokeReadyDelayedCallbacks(err);
+                reject(err);
+            });
+        });
+    }
+    /**
+     * Disconnect from every node in the cluster.
+     */
+    disconnect(reconnect = false) {
+        const status = this.status;
+        this.setStatus("disconnecting");
+        if (!reconnect) {
+            this.manuallyClosing = true;
+        }
+        if (this.reconnectTimeout && !reconnect) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+            debug("Canceled reconnecting attempts");
+        }
+        this.clearNodesRefreshInterval();
+        this.subscriber.stop();
+        if (this.options.shardedSubscribers) {
+            this.shardedSubscribers.stop();
+        }
+        if (status === "wait") {
+            this.setStatus("close");
+            this.handleCloseEvent();
+        }
+        else {
+            this.connectionPool.reset([]);
+        }
+    }
+    /**
+     * Quit the cluster gracefully.
+     */
+    quit(callback) {
+        const status = this.status;
+        this.setStatus("disconnecting");
+        this.manuallyClosing = true;
+        if (this.reconnectTimeout) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+        }
+        this.clearNodesRefreshInterval();
+        this.subscriber.stop();
+        if (this.options.shardedSubscribers) {
+            this.shardedSubscribers.stop();
+        }
+        if (status === "wait") {
+            const ret = (0, standard_as_callback_1.default)(Promise.resolve("OK"), callback);
+            // use setImmediate to make sure "close" event
+            // being emitted after quit() is returned
+            setImmediate(function () {
+                this.setStatus("close");
+                this.handleCloseEvent();
+            }.bind(this));
+            return ret;
+        }
+        return (0, standard_as_callback_1.default)(Promise.all(this.nodes().map((node) => node.quit().catch((err) => {
+            // Ignore the error caused by disconnecting since
+            // we're disconnecting...
+            if (err.message === utils_1.CONNECTION_CLOSED_ERROR_MSG) {
+                return "OK";
+            }
+            throw err;
+        }))).then(() => "OK"), callback);
+    }
+    /**
+     * Create a new instance with the same startup nodes and options as the current one.
+     *
+     * @example
+     * ```js
+     * var cluster = new Redis.Cluster([{ host: "127.0.0.1", port: "30001" }]);
+     * var anotherCluster = cluster.duplicate();
+     * ```
+     */
+    duplicate(overrideStartupNodes = [], overrideOptions = {}) {
+        const startupNodes = overrideStartupNodes.length > 0
+            ? overrideStartupNodes
+            : this.startupNodes.slice(0);
+        const options = Object.assign({}, this.options, overrideOptions);
+        return new Cluster(startupNodes, options);
+    }
+    /**
+     * Get nodes with the specified role
+     */
+    nodes(role = "all") {
+        if (role !== "all" && role !== "master" && role !== "slave") {
+            throw new Error('Invalid role "' + role + '". Expected "all", "master" or "slave"');
+        }
+        return this.connectionPool.getNodes(role);
+    }
+    /**
+     * This is needed in order not to install a listener for each auto pipeline
+     *
+     * @ignore
+     */
+    delayUntilReady(callback) {
+        this._readyDelayedCallbacks.push(callback);
+    }
+    /**
+     * Get the number of commands queued in automatic pipelines.
+     *
+     * This is not available (and returns 0) until the cluster is connected and slots information have been received.
+     */
+    get autoPipelineQueueSize() {
+        let queued = 0;
+        for (const pipeline of this._autoPipelines.values()) {
+            queued += pipeline.length;
+        }
+        return queued;
+    }
+    /**
+     * Refresh the slot cache
+     *
+     * @ignore
+     */
+    refreshSlotsCache(callback) {
+        if (callback) {
+            this._refreshSlotsCacheCallbacks.push(callback);
+        }
+        if (this.isRefreshing) {
+            return;
+        }
+        this.isRefreshing = true;
+        const _this = this;
+        const wrapper = (error) => {
+            this.isRefreshing = false;
+            for (const callback of this._refreshSlotsCacheCallbacks) {
+                callback(error);
+            }
+            this._refreshSlotsCacheCallbacks = [];
+        };
+        const nodes = (0, utils_1.shuffle)(this.connectionPool.getNodes());
+        let lastNodeError = null;
+        function tryNode(index) {
+            if (index === nodes.length) {
+                const error = new ClusterAllFailedError_1.default(ClusterAllFailedError_1.default.defaultMessage, lastNodeError);
+                return wrapper(error);
+            }
+            const node = nodes[index];
+            const key = `${node.options.host}:${node.options.port}`;
+            debug("getting slot cache from %s", key);
+            _this.getInfoFromNode(node, function (err) {
+                switch (_this.status) {
+                    case "close":
+                    case "end":
+                        return wrapper(new Error("Cluster is disconnected."));
+                    case "disconnecting":
+                        return wrapper(new Error("Cluster is disconnecting."));
+                }
+                if (err) {
+                    _this.emit("node error", err, key);
+                    lastNodeError = err;
+                    tryNode(index + 1);
+                }
+                else {
+                    _this.emit("refresh");
+                    wrapper();
+                }
+            });
+        }
+        tryNode(0);
+    }
+    /**
+     * @ignore
+     */
+    sendCommand(command, stream, node) {
+        if (this.status === "wait") {
+            this.connect().catch(utils_1.noop);
+        }
+        if (this.status === "end") {
+            command.reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+            return command.promise;
+        }
+        let to = this.options.scaleReads;
+        if (to !== "master") {
+            const isCommandReadOnly = command.isReadOnly ||
+                ((0, commands_1.exists)(command.name) && (0, commands_1.hasFlag)(command.name, "readonly"));
+            if (!isCommandReadOnly) {
+                to = "master";
+            }
+        }
+        let targetSlot = node ? node.slot : command.getSlot();
+        const ttl = {};
+        const _this = this;
+        if (!node && !REJECT_OVERWRITTEN_COMMANDS.has(command)) {
+            REJECT_OVERWRITTEN_COMMANDS.add(command);
+            const reject = command.reject;
+            command.reject = function (err) {
+                const partialTry = tryConnection.bind(null, true);
+                _this.handleError(err, ttl, {
+                    moved: function (slot, key) {
+                        debug("command %s is moved to %s", command.name, key);
+                        targetSlot = Number(slot);
+                        if (_this.slots[slot]) {
+                            _this.slots[slot][0] = key;
+                        }
+                        else {
+                            _this.slots[slot] = [key];
+                        }
+                        _this._groupsBySlot[slot] =
+                            _this._groupsIds[_this.slots[slot].join(";")];
+                        _this.connectionPool.findOrCreate(_this.natMapper(key));
+                        tryConnection();
+                        debug("refreshing slot caches... (triggered by MOVED error)");
+                        _this.refreshSlotsCache();
+                    },
+                    ask: function (slot, key) {
+                        debug("command %s is required to ask %s:%s", command.name, key);
+                        const mapped = _this.natMapper(key);
+                        _this.connectionPool.findOrCreate(mapped);
+                        tryConnection(false, `${mapped.host}:${mapped.port}`);
+                    },
+                    tryagain: partialTry,
+                    clusterDown: partialTry,
+                    connectionClosed: partialTry,
+                    maxRedirections: function (redirectionError) {
+                        reject.call(command, redirectionError);
+                    },
+                    defaults: function () {
+                        reject.call(command, err);
+                    },
+                });
+            };
+        }
+        tryConnection();
+        function tryConnection(random, asking) {
+            if (_this.status === "end") {
+                command.reject(new redis_errors_1.AbortError("Cluster is ended."));
+                return;
+            }
+            let redis;
+            if (_this.status === "ready" || command.name === "cluster") {
+                if (node && node.redis) {
+                    redis = node.redis;
+                }
+                else if (Command_1.default.checkFlag("ENTER_SUBSCRIBER_MODE", command.name) ||
+                    Command_1.default.checkFlag("EXIT_SUBSCRIBER_MODE", command.name)) {
+                    if (_this.options.shardedSubscribers &&
+                        (command.name == "ssubscribe" || command.name == "sunsubscribe")) {
+                        const sub = _this.shardedSubscribers.getResponsibleSubscriber(targetSlot);
+                        if (!sub) {
+                            command.reject(new redis_errors_1.AbortError(`No sharded subscriber for slot: ${targetSlot}`));
+                            return;
+                        }
+                        let status = -1;
+                        if (command.name == "ssubscribe") {
+                            status = _this.shardedSubscribers.addChannels(command.getKeys());
+                        }
+                        if (command.name == "sunsubscribe") {
+                            status = _this.shardedSubscribers.removeChannels(command.getKeys());
+                        }
+                        if (status !== -1) {
+                            redis = sub.getInstance();
+                        }
+                        else {
+                            command.reject(new redis_errors_1.AbortError("Possible CROSSSLOT error: All channels must hash to the same slot"));
+                        }
+                    }
+                    else {
+                        redis = _this.subscriber.getInstance();
+                    }
+                    if (!redis) {
+                        command.reject(new redis_errors_1.AbortError("No subscriber for the cluster"));
+                        return;
+                    }
+                }
+                else {
+                    if (!random) {
+                        if (typeof targetSlot === "number" && _this.slots[targetSlot]) {
+                            const nodeKeys = _this.slots[targetSlot];
+                            if (typeof to === "function") {
+                                const nodes = nodeKeys.map(function (key) {
+                                    return _this.connectionPool.getInstanceByKey(key);
+                                });
+                                redis = to(nodes, command);
+                                if (Array.isArray(redis)) {
+                                    redis = (0, utils_1.sample)(redis);
+                                }
+                                if (!redis) {
+                                    redis = nodes[0];
+                                }
+                            }
+                            else {
+                                let key;
+                                if (to === "all") {
+                                    key = (0, utils_1.sample)(nodeKeys);
+                                }
+                                else if (to === "slave" && nodeKeys.length > 1) {
+                                    key = (0, utils_1.sample)(nodeKeys, 1);
+                                }
+                                else {
+                                    key = nodeKeys[0];
+                                }
+                                redis = _this.connectionPool.getInstanceByKey(key);
+                            }
+                        }
+                        if (asking) {
+                            redis = _this.connectionPool.getInstanceByKey(asking);
+                            redis.asking();
+                        }
+                    }
+                    if (!redis) {
+                        redis =
+                            (typeof to === "function"
+                                ? null
+                                : _this.connectionPool.getSampleInstance(to)) ||
+                                _this.connectionPool.getSampleInstance("all");
+                    }
+                }
+                if (node && !node.redis) {
+                    node.redis = redis;
+                }
+            }
+            if (redis) {
+                redis.sendCommand(command, stream);
+            }
+            else if (_this.options.enableOfflineQueue) {
+                _this.offlineQueue.push({
+                    command: command,
+                    stream: stream,
+                    node: node,
+                });
+            }
+            else {
+                command.reject(new Error("Cluster isn't ready and enableOfflineQueue options is false"));
+            }
+        }
+        return command.promise;
+    }
+    sscanStream(key, options) {
+        return this.createScanStream("sscan", { key, options });
+    }
+    sscanBufferStream(key, options) {
+        return this.createScanStream("sscanBuffer", { key, options });
+    }
+    hscanStream(key, options) {
+        return this.createScanStream("hscan", { key, options });
+    }
+    hscanBufferStream(key, options) {
+        return this.createScanStream("hscanBuffer", { key, options });
+    }
+    zscanStream(key, options) {
+        return this.createScanStream("zscan", { key, options });
+    }
+    zscanBufferStream(key, options) {
+        return this.createScanStream("zscanBuffer", { key, options });
+    }
+    /**
+     * @ignore
+     */
+    handleError(error, ttl, handlers) {
+        if (typeof ttl.value === "undefined") {
+            ttl.value = this.options.maxRedirections;
+        }
+        else {
+            ttl.value -= 1;
+        }
+        if (ttl.value <= 0) {
+            handlers.maxRedirections(new Error("Too many Cluster redirections. Last error: " + error));
+            return;
+        }
+        const errv = error.message.split(" ");
+        if (errv[0] === "MOVED") {
+            const timeout = this.options.retryDelayOnMoved;
+            if (timeout && typeof timeout === "number") {
+                this.delayQueue.push("moved", handlers.moved.bind(null, errv[1], errv[2]), { timeout });
+            }
+            else {
+                handlers.moved(errv[1], errv[2]);
+            }
+        }
+        else if (errv[0] === "ASK") {
+            handlers.ask(errv[1], errv[2]);
+        }
+        else if (errv[0] === "TRYAGAIN") {
+            this.delayQueue.push("tryagain", handlers.tryagain, {
+                timeout: this.options.retryDelayOnTryAgain,
+            });
+        }
+        else if (errv[0] === "CLUSTERDOWN" &&
+            this.options.retryDelayOnClusterDown > 0) {
+            this.delayQueue.push("clusterdown", handlers.connectionClosed, {
+                timeout: this.options.retryDelayOnClusterDown,
+                callback: this.refreshSlotsCache.bind(this),
+            });
+        }
+        else if (error.message === utils_1.CONNECTION_CLOSED_ERROR_MSG &&
+            this.options.retryDelayOnFailover > 0 &&
+            this.status === "ready") {
+            this.delayQueue.push("failover", handlers.connectionClosed, {
+                timeout: this.options.retryDelayOnFailover,
+                callback: this.refreshSlotsCache.bind(this),
+            });
+        }
+        else {
+            handlers.defaults();
+        }
+    }
+    resetOfflineQueue() {
+        this.offlineQueue = new Deque();
+    }
+    clearNodesRefreshInterval() {
+        if (this.slotsTimer) {
+            clearTimeout(this.slotsTimer);
+            this.slotsTimer = null;
+        }
+    }
+    resetNodesRefreshInterval() {
+        if (this.slotsTimer || !this.options.slotsRefreshInterval) {
+            return;
+        }
+        const nextRound = () => {
+            this.slotsTimer = setTimeout(() => {
+                debug('refreshing slot caches... (triggered by "slotsRefreshInterval" option)');
+                this.refreshSlotsCache(() => {
+                    nextRound();
+                });
+            }, this.options.slotsRefreshInterval);
+        };
+        nextRound();
+    }
+    /**
+     * Change cluster instance's status
+     */
+    setStatus(status) {
+        debug("status: %s -> %s", this.status || "[empty]", status);
+        this.status = status;
+        process.nextTick(() => {
+            this.emit(status);
+        });
+    }
+    /**
+     * Called when closed to check whether a reconnection should be made
+     */
+    handleCloseEvent(reason) {
+        var _a;
+        if (reason) {
+            debug("closed because %s", reason);
+        }
+        let retryDelay;
+        if (!this.manuallyClosing &&
+            typeof this.options.clusterRetryStrategy === "function") {
+            retryDelay = this.options.clusterRetryStrategy.call(this, ++this.retryAttempts, reason);
+        }
+        if (typeof retryDelay === "number") {
+            this.setStatus("reconnecting");
+            this.reconnectTimeout = setTimeout(() => {
+                this.reconnectTimeout = null;
+                debug("Cluster is disconnected. Retrying after %dms", retryDelay);
+                this.connect().catch(function (err) {
+                    debug("Got error %s when reconnecting. Ignoring...", err);
+                });
+            }, retryDelay);
+        }
+        else {
+            if (this.options.shardedSubscribers) {
+                (_a = this.subscriberGroupEmitter) === null || _a === void 0 ? void 0 : _a.removeAllListeners();
+            }
+            this.setStatus("end");
+            this.flushQueue(new Error("None of startup nodes is available"));
+        }
+    }
+    /**
+     * Flush offline queue with error.
+     */
+    flushQueue(error) {
+        let item;
+        while ((item = this.offlineQueue.shift())) {
+            item.command.reject(error);
+        }
+    }
+    executeOfflineCommands() {
+        if (this.offlineQueue.length) {
+            debug("send %d commands in offline queue", this.offlineQueue.length);
+            const offlineQueue = this.offlineQueue;
+            this.resetOfflineQueue();
+            let item;
+            while ((item = offlineQueue.shift())) {
+                this.sendCommand(item.command, item.stream, item.node);
+            }
+        }
+    }
+    natMapper(nodeKey) {
+        const key = typeof nodeKey === "string"
+            ? nodeKey
+            : `${nodeKey.host}:${nodeKey.port}`;
+        let mapped = null;
+        if (this.options.natMap && typeof this.options.natMap === "function") {
+            mapped = this.options.natMap(key);
+        }
+        else if (this.options.natMap && typeof this.options.natMap === "object") {
+            mapped = this.options.natMap[key];
+        }
+        if (mapped) {
+            debug("NAT mapping %s -> %O", key, mapped);
+            return Object.assign({}, mapped);
+        }
+        return typeof nodeKey === "string"
+            ? (0, util_1.nodeKeyToRedisOptions)(nodeKey)
+            : nodeKey;
+    }
+    getInfoFromNode(redis, callback) {
+        if (!redis) {
+            return callback(new Error("Node is disconnected"));
+        }
+        // Use a duplication of the connection to avoid
+        // timeouts when the connection is in the blocking
+        // mode (e.g. waiting for BLPOP).
+        const duplicatedConnection = redis.duplicate({
+            enableOfflineQueue: true,
+            enableReadyCheck: false,
+            retryStrategy: null,
+            connectionName: (0, util_1.getConnectionName)("refresher", this.options.redisOptions && this.options.redisOptions.connectionName),
+        });
+        // Ignore error events since we will handle
+        // exceptions for the CLUSTER SLOTS command.
+        duplicatedConnection.on("error", utils_1.noop);
+        duplicatedConnection.cluster("SLOTS", (0, utils_1.timeout)((err, result) => {
+            duplicatedConnection.disconnect();
+            if (err) {
+                debug("error encountered running CLUSTER.SLOTS: %s", err);
+                return callback(err);
+            }
+            if (this.status === "disconnecting" ||
+                this.status === "close" ||
+                this.status === "end") {
+                debug("ignore CLUSTER.SLOTS results (count: %d) since cluster status is %s", result.length, this.status);
+                callback();
+                return;
+            }
+            const nodes = [];
+            debug("cluster slots result count: %d", result.length);
+            for (let i = 0; i < result.length; ++i) {
+                const items = result[i];
+                const slotRangeStart = items[0];
+                const slotRangeEnd = items[1];
+                const keys = [];
+                for (let j = 2; j < items.length; j++) {
+                    if (!items[j][0]) {
+                        continue;
+                    }
+                    const node = this.natMapper({
+                        host: items[j][0],
+                        port: items[j][1],
+                    });
+                    node.readOnly = j !== 2;
+                    nodes.push(node);
+                    keys.push(node.host + ":" + node.port);
+                }
+                debug("cluster slots result [%d]: slots %d~%d served by %s", i, slotRangeStart, slotRangeEnd, keys);
+                for (let slot = slotRangeStart; slot <= slotRangeEnd; slot++) {
+                    this.slots[slot] = keys;
+                }
+            }
+            // Assign to each node keys a numeric value to make autopipeline comparison faster.
+            this._groupsIds = Object.create(null);
+            let j = 0;
+            for (let i = 0; i < 16384; i++) {
+                const target = (this.slots[i] || []).join(";");
+                if (!target.length) {
+                    this._groupsBySlot[i] = undefined;
+                    continue;
+                }
+                if (!this._groupsIds[target]) {
+                    this._groupsIds[target] = ++j;
+                }
+                this._groupsBySlot[i] = this._groupsIds[target];
+            }
+            this.connectionPool.reset(nodes);
+            if (this.options.shardedSubscribers) {
+                this.shardedSubscribers
+                    .reset(this.slots, this.connectionPool.getNodes("all"))
+                    .catch((err) => {
+                    // TODO should we emit an error event here?
+                    debug("Error while starting subscribers: %s", err);
+                });
+            }
+            callback();
+        }, this.options.slotsRefreshTimeout));
+    }
+    invokeReadyDelayedCallbacks(err) {
+        for (const c of this._readyDelayedCallbacks) {
+            process.nextTick(c, err);
+        }
+        this._readyDelayedCallbacks = [];
+    }
+    /**
+     * Check whether Cluster is able to process commands
+     */
+    readyCheck(callback) {
+        this.cluster("INFO", (err, res) => {
+            if (err) {
+                return callback(err);
+            }
+            if (typeof res !== "string") {
+                return callback();
+            }
+            let state;
+            const lines = res.split("\r\n");
+            for (let i = 0; i < lines.length; ++i) {
+                const parts = lines[i].split(":");
+                if (parts[0] === "cluster_state") {
+                    state = parts[1];
+                    break;
+                }
+            }
+            if (state === "fail") {
+                debug("cluster state not ok (%s)", state);
+                callback(null, state);
+            }
+            else {
+                callback();
+            }
+        });
+    }
+    resolveSrv(hostname) {
+        return new Promise((resolve, reject) => {
+            this.options.resolveSrv(hostname, (err, records) => {
+                if (err) {
+                    return reject(err);
+                }
+                const self = this, groupedRecords = (0, util_1.groupSrvRecords)(records), sortedKeys = Object.keys(groupedRecords).sort((a, b) => parseInt(a) - parseInt(b));
+                function tryFirstOne(err) {
+                    if (!sortedKeys.length) {
+                        return reject(err);
+                    }
+                    const key = sortedKeys[0], group = groupedRecords[key], record = (0, util_1.weightSrvRecords)(group);
+                    if (!group.records.length) {
+                        sortedKeys.shift();
+                    }
+                    self.dnsLookup(record.name).then((host) => resolve({
+                        host,
+                        port: record.port,
+                    }), tryFirstOne);
+                }
+                tryFirstOne();
+            });
+        });
+    }
+    dnsLookup(hostname) {
+        return new Promise((resolve, reject) => {
+            this.options.dnsLookup(hostname, (err, address) => {
+                if (err) {
+                    debug("failed to resolve hostname %s to IP: %s", hostname, err.message);
+                    reject(err);
+                }
+                else {
+                    debug("resolved hostname %s to IP %s", hostname, address);
+                    resolve(address);
+                }
+            });
+        });
+    }
+    /**
+     * Normalize startup nodes, and resolving hostnames to IPs.
+     *
+     * This process happens every time when #connect() is called since
+     * #startupNodes and DNS records may chanage.
+     */
+    async resolveStartupNodeHostnames() {
+        if (!Array.isArray(this.startupNodes) || this.startupNodes.length === 0) {
+            throw new Error("`startupNodes` should contain at least one node.");
+        }
+        const startupNodes = (0, util_1.normalizeNodeOptions)(this.startupNodes);
+        const hostnames = (0, util_1.getUniqueHostnamesFromOptions)(startupNodes);
+        if (hostnames.length === 0) {
+            return startupNodes;
+        }
+        const configs = await Promise.all(hostnames.map((this.options.useSRVRecords ? this.resolveSrv : this.dnsLookup).bind(this)));
+        const hostnameToConfig = (0, utils_1.zipMap)(hostnames, configs);
+        return startupNodes.map((node) => {
+            const config = hostnameToConfig.get(node.host);
+            if (!config) {
+                return node;
+            }
+            if (this.options.useSRVRecords) {
+                return Object.assign({}, node, config);
+            }
+            return Object.assign({}, node, { host: config });
+        });
+    }
+    createScanStream(command, { key, options = {} }) {
+        return new ScanStream_1.default({
+            objectMode: true,
+            key: key,
+            redis: this,
+            command: command,
+            ...options,
+        });
+    }
+    createShardedSubscriberGroup() {
+        this.subscriberGroupEmitter = new events_1.EventEmitter();
+        this.shardedSubscribers = new ClusterSubscriberGroup_1.default(this.subscriberGroupEmitter, this.options);
+        // Error handler used only for sharded-subscriber-triggered slots cache refreshes.
+        // Normal (non-subscriber) connections are created with lazyConnect: true and can
+        // become zombied. For sharded subscribers, a ClusterAllFailedError means
+        // we have lost all nodes from the subscriber perspective and must tear down.
+        const refreshSlotsCacheCallback = (err) => {
+            // Disconnect only when refreshing the slots cache fails with ClusterAllFailedError
+            if (err instanceof ClusterAllFailedError_1.default) {
+                this.disconnect(true);
+            }
+        };
+        this.subscriberGroupEmitter.on("-node", (redis, nodeKey) => {
+            this.emit("-node", redis, nodeKey);
+            this.refreshSlotsCache(refreshSlotsCacheCallback);
+        });
+        this.subscriberGroupEmitter.on("subscriberConnectFailed", ({ delay, error }) => {
+            this.emit("error", error);
+            setTimeout(() => {
+                this.refreshSlotsCache(refreshSlotsCacheCallback);
+            }, delay);
+        });
+        this.subscriberGroupEmitter.on("moved", () => {
+            this.refreshSlotsCache(refreshSlotsCacheCallback);
+        });
+        this.subscriberGroupEmitter.on("-subscriber", () => {
+            this.emit("-subscriber");
+        });
+        this.subscriberGroupEmitter.on("+subscriber", () => {
+            this.emit("+subscriber");
+        });
+        this.subscriberGroupEmitter.on("nodeError", (error, nodeKey) => {
+            this.emit("nodeError", error, nodeKey);
+        });
+        this.subscriberGroupEmitter.on("subscribersReady", () => {
+            this.emit("subscribersReady");
+        });
+        for (const event of ["smessage", "smessageBuffer"]) {
+            this.subscriberGroupEmitter.on(event, (arg1, arg2, arg3) => {
+                this.emit(event, arg1, arg2, arg3);
+            });
+        }
+    }
+}
+(0, applyMixin_1.default)(Cluster, events_1.EventEmitter);
+(0, transaction_1.addTransactionSupport)(Cluster.prototype);
+exports.default = Cluster;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/util.d.ts b/node_modules/bullmq/node_modules/ioredis/built/cluster/util.d.ts
new file mode 100644
index 0000000..d8629c3
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/util.d.ts
@@ -0,0 +1,25 @@
+/// <reference types="node" />
+import { SrvRecord } from "dns";
+export declare type NodeKey = string;
+export declare type NodeRole = "master" | "slave" | "all";
+export interface RedisOptions {
+    port: number;
+    host: string;
+    username?: string | undefined;
+    password?: string | undefined;
+    [key: string]: any;
+}
+export interface SrvRecordsGroup {
+    totalWeight: number;
+    records: SrvRecord[];
+}
+export interface GroupedSrvRecords {
+    [key: number]: SrvRecordsGroup;
+}
+export declare function getNodeKey(node: RedisOptions): NodeKey;
+export declare function nodeKeyToRedisOptions(nodeKey: NodeKey): RedisOptions;
+export declare function normalizeNodeOptions(nodes: Array<string | number | object>): RedisOptions[];
+export declare function getUniqueHostnamesFromOptions(nodes: RedisOptions[]): string[];
+export declare function groupSrvRecords(records: SrvRecord[]): GroupedSrvRecords;
+export declare function weightSrvRecords(recordsGroup: SrvRecordsGroup): SrvRecord;
+export declare function getConnectionName(component: any, nodeConnectionName: any): string;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/cluster/util.js b/node_modules/bullmq/node_modules/ioredis/built/cluster/util.js
new file mode 100644
index 0000000..e3a779b
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/cluster/util.js
@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConnectionName = exports.weightSrvRecords = exports.groupSrvRecords = exports.getUniqueHostnamesFromOptions = exports.normalizeNodeOptions = exports.nodeKeyToRedisOptions = exports.getNodeKey = void 0;
+const utils_1 = require("../utils");
+const net_1 = require("net");
+function getNodeKey(node) {
+    node.port = node.port || 6379;
+    node.host = node.host || "127.0.0.1";
+    return node.host + ":" + node.port;
+}
+exports.getNodeKey = getNodeKey;
+function nodeKeyToRedisOptions(nodeKey) {
+    const portIndex = nodeKey.lastIndexOf(":");
+    if (portIndex === -1) {
+        throw new Error(`Invalid node key ${nodeKey}`);
+    }
+    return {
+        host: nodeKey.slice(0, portIndex),
+        port: Number(nodeKey.slice(portIndex + 1)),
+    };
+}
+exports.nodeKeyToRedisOptions = nodeKeyToRedisOptions;
+function normalizeNodeOptions(nodes) {
+    return nodes.map((node) => {
+        const options = {};
+        if (typeof node === "object") {
+            Object.assign(options, node);
+        }
+        else if (typeof node === "string") {
+            Object.assign(options, (0, utils_1.parseURL)(node));
+        }
+        else if (typeof node === "number") {
+            options.port = node;
+        }
+        else {
+            throw new Error("Invalid argument " + node);
+        }
+        if (typeof options.port === "string") {
+            options.port = parseInt(options.port, 10);
+        }
+        // Cluster mode only support db 0
+        delete options.db;
+        if (!options.port) {
+            options.port = 6379;
+        }
+        if (!options.host) {
+            options.host = "127.0.0.1";
+        }
+        return (0, utils_1.resolveTLSProfile)(options);
+    });
+}
+exports.normalizeNodeOptions = normalizeNodeOptions;
+function getUniqueHostnamesFromOptions(nodes) {
+    const uniqueHostsMap = {};
+    nodes.forEach((node) => {
+        uniqueHostsMap[node.host] = true;
+    });
+    return Object.keys(uniqueHostsMap).filter((host) => !(0, net_1.isIP)(host));
+}
+exports.getUniqueHostnamesFromOptions = getUniqueHostnamesFromOptions;
+function groupSrvRecords(records) {
+    const recordsByPriority = {};
+    for (const record of records) {
+        if (!recordsByPriority.hasOwnProperty(record.priority)) {
+            recordsByPriority[record.priority] = {
+                totalWeight: record.weight,
+                records: [record],
+            };
+        }
+        else {
+            recordsByPriority[record.priority].totalWeight += record.weight;
+            recordsByPriority[record.priority].records.push(record);
+        }
+    }
+    return recordsByPriority;
+}
+exports.groupSrvRecords = groupSrvRecords;
+function weightSrvRecords(recordsGroup) {
+    if (recordsGroup.records.length === 1) {
+        recordsGroup.totalWeight = 0;
+        return recordsGroup.records.shift();
+    }
+    // + `recordsGroup.records.length` to support `weight` 0
+    const random = Math.floor(Math.random() * (recordsGroup.totalWeight + recordsGroup.records.length));
+    let total = 0;
+    for (const [i, record] of recordsGroup.records.entries()) {
+        total += 1 + record.weight;
+        if (total > random) {
+            recordsGroup.totalWeight -= record.weight;
+            recordsGroup.records.splice(i, 1);
+            return record;
+        }
+    }
+}
+exports.weightSrvRecords = weightSrvRecords;
+function getConnectionName(component, nodeConnectionName) {
+    const prefix = `ioredis-cluster(${component})`;
+    return nodeConnectionName ? `${prefix}:${nodeConnectionName}` : prefix;
+}
+exports.getConnectionName = getConnectionName;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.d.ts
new file mode 100644
index 0000000..14bdbaa
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.d.ts
@@ -0,0 +1,12 @@
+import { NetStream } from "../types";
+export declare type ErrorEmitter = (type: string, err: Error) => void;
+export default abstract class AbstractConnector {
+    firstError?: Error;
+    protected connecting: boolean;
+    protected stream: NetStream;
+    private disconnectTimeout;
+    constructor(disconnectTimeout: number);
+    check(info: any): boolean;
+    disconnect(): void;
+    abstract connect(_: ErrorEmitter): Promise<NetStream>;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.js
new file mode 100644
index 0000000..2e2151d
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/AbstractConnector.js
@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const debug = (0, utils_1.Debug)("AbstractConnector");
+class AbstractConnector {
+    constructor(disconnectTimeout) {
+        this.connecting = false;
+        this.disconnectTimeout = disconnectTimeout;
+    }
+    check(info) {
+        return true;
+    }
+    disconnect() {
+        this.connecting = false;
+        if (this.stream) {
+            const stream = this.stream; // Make sure callbacks refer to the same instance
+            const timeout = setTimeout(() => {
+                debug("stream %s:%s still open, destroying it", stream.remoteAddress, stream.remotePort);
+                stream.destroy();
+            }, this.disconnectTimeout);
+            stream.on("close", () => clearTimeout(timeout));
+            stream.end();
+        }
+    }
+}
+exports.default = AbstractConnector;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts
new file mode 100644
index 0000000..2f332ae
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts
@@ -0,0 +1,5 @@
+import AbstractConnector from "./AbstractConnector";
+interface ConnectorConstructor {
+    new (options: unknown): AbstractConnector;
+}
+export default ConnectorConstructor;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/ConnectorConstructor.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts
new file mode 100644
index 0000000..abd44e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts
@@ -0,0 +1,11 @@
+import SentinelConnector from "./index";
+import { Sentinel } from "./types";
+export declare class FailoverDetector {
+    private connector;
+    private sentinels;
+    private isDisconnected;
+    constructor(connector: SentinelConnector, sentinels: Sentinel[]);
+    cleanup(): void;
+    subscribe(): Promise<void>;
+    private disconnect;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js
new file mode 100644
index 0000000..8db28d0
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js
@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FailoverDetector = void 0;
+const utils_1 = require("../../utils");
+const debug = (0, utils_1.Debug)("FailoverDetector");
+const CHANNEL_NAME = "+switch-master";
+class FailoverDetector {
+    // sentinels can't be used for regular commands after this
+    constructor(connector, sentinels) {
+        this.isDisconnected = false;
+        this.connector = connector;
+        this.sentinels = sentinels;
+    }
+    cleanup() {
+        this.isDisconnected = true;
+        for (const sentinel of this.sentinels) {
+            sentinel.client.disconnect();
+        }
+    }
+    async subscribe() {
+        debug("Starting FailoverDetector");
+        const promises = [];
+        for (const sentinel of this.sentinels) {
+            const promise = sentinel.client.subscribe(CHANNEL_NAME).catch((err) => {
+                debug("Failed to subscribe to failover messages on sentinel %s:%s (%s)", sentinel.address.host || "127.0.0.1", sentinel.address.port || 26739, err.message);
+            });
+            promises.push(promise);
+            sentinel.client.on("message", (channel) => {
+                if (!this.isDisconnected && channel === CHANNEL_NAME) {
+                    this.disconnect();
+                }
+            });
+        }
+        await Promise.all(promises);
+    }
+    disconnect() {
+        // Avoid disconnecting more than once per failover.
+        // A new FailoverDetector will be created after reconnecting.
+        this.isDisconnected = true;
+        debug("Failover detected, disconnecting");
+        // Will call this.cleanup()
+        this.connector.disconnect();
+    }
+}
+exports.FailoverDetector = FailoverDetector;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts
new file mode 100644
index 0000000..fbe5f34
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts
@@ -0,0 +1,13 @@
+import { SentinelAddress } from "./types";
+export default class SentinelIterator implements Iterator<Partial<SentinelAddress>> {
+    private cursor;
+    private sentinels;
+    constructor(sentinels: Array<Partial<SentinelAddress>>);
+    next(): {
+        done: boolean;
+        value: Partial<SentinelAddress>;
+    };
+    reset(moveCurrentEndpointToFirst: boolean): void;
+    add(sentinel: SentinelAddress): boolean;
+    toString(): string;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js
new file mode 100644
index 0000000..3399bae
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js
@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function isSentinelEql(a, b) {
+    return ((a.host || "127.0.0.1") === (b.host || "127.0.0.1") &&
+        (a.port || 26379) === (b.port || 26379));
+}
+class SentinelIterator {
+    constructor(sentinels) {
+        this.cursor = 0;
+        this.sentinels = sentinels.slice(0);
+    }
+    next() {
+        const done = this.cursor >= this.sentinels.length;
+        return { done, value: done ? undefined : this.sentinels[this.cursor++] };
+    }
+    reset(moveCurrentEndpointToFirst) {
+        if (moveCurrentEndpointToFirst &&
+            this.sentinels.length > 1 &&
+            this.cursor !== 1) {
+            this.sentinels.unshift(...this.sentinels.splice(this.cursor - 1));
+        }
+        this.cursor = 0;
+    }
+    add(sentinel) {
+        for (let i = 0; i < this.sentinels.length; i++) {
+            if (isSentinelEql(sentinel, this.sentinels[i])) {
+                return false;
+            }
+        }
+        this.sentinels.push(sentinel);
+        return true;
+    }
+    toString() {
+        return `${JSON.stringify(this.sentinels)} @${this.cursor}`;
+    }
+}
+exports.default = SentinelIterator;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts
new file mode 100644
index 0000000..66660e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts
@@ -0,0 +1,72 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import { NatMap } from "../../cluster/ClusterOptions";
+import { ConnectionOptions } from "tls";
+import SentinelIterator from "./SentinelIterator";
+import { SentinelAddress } from "./types";
+import AbstractConnector, { ErrorEmitter } from "../AbstractConnector";
+import { NetStream } from "../../types";
+interface AddressFromResponse {
+    port: string;
+    ip: string;
+    flags?: string | undefined;
+}
+declare type PreferredSlaves = ((slaves: AddressFromResponse[]) => AddressFromResponse | null) | Array<{
+    port: string;
+    ip: string;
+    prio?: number | undefined;
+}> | {
+    port: string;
+    ip: string;
+    prio?: number | undefined;
+};
+export { SentinelAddress, SentinelIterator };
+export interface SentinelConnectionOptions {
+    /**
+     * Master group name of the Sentinel
+     */
+    name?: string | undefined;
+    /**
+     * @default "master"
+     */
+    role?: "master" | "slave" | undefined;
+    tls?: ConnectionOptions | undefined;
+    sentinelUsername?: string | undefined;
+    sentinelPassword?: string | undefined;
+    sentinels?: Array<Partial<SentinelAddress>> | undefined;
+    sentinelRetryStrategy?: ((retryAttempts: number) => number | void | null) | undefined;
+    sentinelReconnectStrategy?: ((retryAttempts: number) => number | void | null) | undefined;
+    preferredSlaves?: PreferredSlaves | undefined;
+    connectTimeout?: number | undefined;
+    disconnectTimeout?: number | undefined;
+    sentinelCommandTimeout?: number | undefined;
+    enableTLSForSentinelMode?: boolean | undefined;
+    sentinelTLS?: ConnectionOptions | undefined;
+    natMap?: NatMap | undefined;
+    updateSentinels?: boolean | undefined;
+    /**
+     * @default 10
+     */
+    sentinelMaxConnections?: number | undefined;
+    failoverDetector?: boolean | undefined;
+}
+export default class SentinelConnector extends AbstractConnector {
+    protected options: SentinelConnectionOptions;
+    emitter: EventEmitter | null;
+    protected sentinelIterator: SentinelIterator;
+    private retryAttempts;
+    private failoverDetector;
+    constructor(options: SentinelConnectionOptions);
+    check(info: {
+        role?: string;
+    }): boolean;
+    disconnect(): void;
+    connect(eventEmitter: ErrorEmitter): Promise<NetStream>;
+    private updateSentinels;
+    private resolveMaster;
+    private resolveSlave;
+    private sentinelNatResolve;
+    private connectToSentinel;
+    private resolve;
+    private initFailoverDetector;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.js
new file mode 100644
index 0000000..5cb4b48
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/index.js
@@ -0,0 +1,305 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SentinelIterator = void 0;
+const net_1 = require("net");
+const utils_1 = require("../../utils");
+const tls_1 = require("tls");
+const SentinelIterator_1 = require("./SentinelIterator");
+exports.SentinelIterator = SentinelIterator_1.default;
+const AbstractConnector_1 = require("../AbstractConnector");
+const Redis_1 = require("../../Redis");
+const FailoverDetector_1 = require("./FailoverDetector");
+const debug = (0, utils_1.Debug)("SentinelConnector");
+class SentinelConnector extends AbstractConnector_1.default {
+    constructor(options) {
+        super(options.disconnectTimeout);
+        this.options = options;
+        this.emitter = null;
+        this.failoverDetector = null;
+        if (!this.options.sentinels.length) {
+            throw new Error("Requires at least one sentinel to connect to.");
+        }
+        if (!this.options.name) {
+            throw new Error("Requires the name of master.");
+        }
+        this.sentinelIterator = new SentinelIterator_1.default(this.options.sentinels);
+    }
+    check(info) {
+        const roleMatches = !info.role || this.options.role === info.role;
+        if (!roleMatches) {
+            debug("role invalid, expected %s, but got %s", this.options.role, info.role);
+            // Start from the next item.
+            // Note that `reset` will move the cursor to the previous element,
+            // so we advance two steps here.
+            this.sentinelIterator.next();
+            this.sentinelIterator.next();
+            this.sentinelIterator.reset(true);
+        }
+        return roleMatches;
+    }
+    disconnect() {
+        super.disconnect();
+        if (this.failoverDetector) {
+            this.failoverDetector.cleanup();
+        }
+    }
+    connect(eventEmitter) {
+        this.connecting = true;
+        this.retryAttempts = 0;
+        let lastError;
+        const connectToNext = async () => {
+            const endpoint = this.sentinelIterator.next();
+            if (endpoint.done) {
+                this.sentinelIterator.reset(false);
+                const retryDelay = typeof this.options.sentinelRetryStrategy === "function"
+                    ? this.options.sentinelRetryStrategy(++this.retryAttempts)
+                    : null;
+                let errorMsg = typeof retryDelay !== "number"
+                    ? "All sentinels are unreachable and retry is disabled."
+                    : `All sentinels are unreachable. Retrying from scratch after ${retryDelay}ms.`;
+                if (lastError) {
+                    errorMsg += ` Last error: ${lastError.message}`;
+                }
+                debug(errorMsg);
+                const error = new Error(errorMsg);
+                if (typeof retryDelay === "number") {
+                    eventEmitter("error", error);
+                    await new Promise((resolve) => setTimeout(resolve, retryDelay));
+                    return connectToNext();
+                }
+                else {
+                    throw error;
+                }
+            }
+            let resolved = null;
+            let err = null;
+            try {
+                resolved = await this.resolve(endpoint.value);
+            }
+            catch (error) {
+                err = error;
+            }
+            if (!this.connecting) {
+                throw new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG);
+            }
+            const endpointAddress = endpoint.value.host + ":" + endpoint.value.port;
+            if (resolved) {
+                debug("resolved: %s:%s from sentinel %s", resolved.host, resolved.port, endpointAddress);
+                if (this.options.enableTLSForSentinelMode && this.options.tls) {
+                    Object.assign(resolved, this.options.tls);
+                    this.stream = (0, tls_1.connect)(resolved);
+                    this.stream.once("secureConnect", this.initFailoverDetector.bind(this));
+                }
+                else {
+                    this.stream = (0, net_1.createConnection)(resolved);
+                    this.stream.once("connect", this.initFailoverDetector.bind(this));
+                }
+                this.stream.once("error", (err) => {
+                    this.firstError = err;
+                });
+                return this.stream;
+            }
+            else {
+                const errorMsg = err
+                    ? "failed to connect to sentinel " +
+                        endpointAddress +
+                        " because " +
+                        err.message
+                    : "connected to sentinel " +
+                        endpointAddress +
+                        " successfully, but got an invalid reply: " +
+                        resolved;
+                debug(errorMsg);
+                eventEmitter("sentinelError", new Error(errorMsg));
+                if (err) {
+                    lastError = err;
+                }
+                return connectToNext();
+            }
+        };
+        return connectToNext();
+    }
+    async updateSentinels(client) {
+        if (!this.options.updateSentinels) {
+            return;
+        }
+        const result = await client.sentinel("sentinels", this.options.name);
+        if (!Array.isArray(result)) {
+            return;
+        }
+        result
+            .map(utils_1.packObject)
+            .forEach((sentinel) => {
+            const flags = sentinel.flags ? sentinel.flags.split(",") : [];
+            if (flags.indexOf("disconnected") === -1 &&
+                sentinel.ip &&
+                sentinel.port) {
+                const endpoint = this.sentinelNatResolve(addressResponseToAddress(sentinel));
+                if (this.sentinelIterator.add(endpoint)) {
+                    debug("adding sentinel %s:%s", endpoint.host, endpoint.port);
+                }
+            }
+        });
+        debug("Updated internal sentinels: %s", this.sentinelIterator);
+    }
+    async resolveMaster(client) {
+        const result = await client.sentinel("get-master-addr-by-name", this.options.name);
+        await this.updateSentinels(client);
+        return this.sentinelNatResolve(Array.isArray(result)
+            ? { host: result[0], port: Number(result[1]) }
+            : null);
+    }
+    async resolveSlave(client) {
+        const result = await client.sentinel("slaves", this.options.name);
+        if (!Array.isArray(result)) {
+            return null;
+        }
+        const availableSlaves = result
+            .map(utils_1.packObject)
+            .filter((slave) => slave.flags && !slave.flags.match(/(disconnected|s_down|o_down)/));
+        return this.sentinelNatResolve(selectPreferredSentinel(availableSlaves, this.options.preferredSlaves));
+    }
+    sentinelNatResolve(item) {
+        if (!item || !this.options.natMap)
+            return item;
+        const key = `${item.host}:${item.port}`;
+        let result = item;
+        if (typeof this.options.natMap === "function") {
+            result = this.options.natMap(key) || item;
+        }
+        else if (typeof this.options.natMap === "object") {
+            result = this.options.natMap[key] || item;
+        }
+        return result;
+    }
+    connectToSentinel(endpoint, options) {
+        const redis = new Redis_1.default({
+            port: endpoint.port || 26379,
+            host: endpoint.host,
+            username: this.options.sentinelUsername || null,
+            password: this.options.sentinelPassword || null,
+            family: endpoint.family ||
+                // @ts-expect-error
+                ("path" in this.options && this.options.path
+                    ? undefined
+                    : // @ts-expect-error
+                        this.options.family),
+            tls: this.options.sentinelTLS,
+            retryStrategy: null,
+            enableReadyCheck: false,
+            connectTimeout: this.options.connectTimeout,
+            commandTimeout: this.options.sentinelCommandTimeout,
+            ...options,
+        });
+        // @ts-expect-error
+        return redis;
+    }
+    async resolve(endpoint) {
+        const client = this.connectToSentinel(endpoint);
+        // ignore the errors since resolve* methods will handle them
+        client.on("error", noop);
+        try {
+            if (this.options.role === "slave") {
+                return await this.resolveSlave(client);
+            }
+            else {
+                return await this.resolveMaster(client);
+            }
+        }
+        finally {
+            client.disconnect();
+        }
+    }
+    async initFailoverDetector() {
+        var _a;
+        if (!this.options.failoverDetector) {
+            return;
+        }
+        // Move the current sentinel to the first position
+        this.sentinelIterator.reset(true);
+        const sentinels = [];
+        // In case of a large amount of sentinels, limit the number of concurrent connections
+        while (sentinels.length < this.options.sentinelMaxConnections) {
+            const { done, value } = this.sentinelIterator.next();
+            if (done) {
+                break;
+            }
+            const client = this.connectToSentinel(value, {
+                lazyConnect: true,
+                retryStrategy: this.options.sentinelReconnectStrategy,
+            });
+            client.on("reconnecting", () => {
+                var _a;
+                // Tests listen to this event
+                (_a = this.emitter) === null || _a === void 0 ? void 0 : _a.emit("sentinelReconnecting");
+            });
+            sentinels.push({ address: value, client });
+        }
+        this.sentinelIterator.reset(false);
+        if (this.failoverDetector) {
+            // Clean up previous detector
+            this.failoverDetector.cleanup();
+        }
+        this.failoverDetector = new FailoverDetector_1.FailoverDetector(this, sentinels);
+        await this.failoverDetector.subscribe();
+        // Tests listen to this event
+        (_a = this.emitter) === null || _a === void 0 ? void 0 : _a.emit("failoverSubscribed");
+    }
+}
+exports.default = SentinelConnector;
+function selectPreferredSentinel(availableSlaves, preferredSlaves) {
+    if (availableSlaves.length === 0) {
+        return null;
+    }
+    let selectedSlave;
+    if (typeof preferredSlaves === "function") {
+        selectedSlave = preferredSlaves(availableSlaves);
+    }
+    else if (preferredSlaves !== null && typeof preferredSlaves === "object") {
+        const preferredSlavesArray = Array.isArray(preferredSlaves)
+            ? preferredSlaves
+            : [preferredSlaves];
+        // sort by priority
+        preferredSlavesArray.sort((a, b) => {
+            // default the priority to 1
+            if (!a.prio) {
+                a.prio = 1;
+            }
+            if (!b.prio) {
+                b.prio = 1;
+            }
+            // lowest priority first
+            if (a.prio < b.prio) {
+                return -1;
+            }
+            if (a.prio > b.prio) {
+                return 1;
+            }
+            return 0;
+        });
+        // loop over preferred slaves and return the first match
+        for (let p = 0; p < preferredSlavesArray.length; p++) {
+            for (let a = 0; a < availableSlaves.length; a++) {
+                const slave = availableSlaves[a];
+                if (slave.ip === preferredSlavesArray[p].ip) {
+                    if (slave.port === preferredSlavesArray[p].port) {
+                        selectedSlave = slave;
+                        break;
+                    }
+                }
+            }
+            if (selectedSlave) {
+                break;
+            }
+        }
+    }
+    // if none of the preferred slaves are available, a random available slave is returned
+    if (!selectedSlave) {
+        selectedSlave = (0, utils_1.sample)(availableSlaves);
+    }
+    return addressResponseToAddress(selectedSlave);
+}
+function addressResponseToAddress(input) {
+    return { host: input.ip, port: Number(input.port) };
+}
+function noop() { }
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts
new file mode 100644
index 0000000..4734cdc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts
@@ -0,0 +1,21 @@
+import { RedisOptions } from "../../redis/RedisOptions";
+export interface SentinelAddress {
+    port: number;
+    host: string;
+    family?: number;
+}
+export interface RedisClient {
+    options: RedisOptions;
+    sentinel(subcommand: "sentinels", name: string): Promise<string[]>;
+    sentinel(subcommand: "get-master-addr-by-name", name: string): Promise<string[]>;
+    sentinel(subcommand: "slaves", name: string): Promise<string[]>;
+    subscribe(...channelNames: string[]): Promise<number>;
+    on(event: "message", callback: (channel: string, message: string) => void): void;
+    on(event: "error", callback: (error: Error) => void): void;
+    on(event: "reconnecting", callback: () => void): void;
+    disconnect(): void;
+}
+export interface Sentinel {
+    address: Partial<SentinelAddress>;
+    client: RedisClient;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/SentinelConnector/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts
new file mode 100644
index 0000000..45fb552
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts
@@ -0,0 +1,17 @@
+/// <reference types="node" />
+import { IpcNetConnectOpts, TcpNetConnectOpts } from "net";
+import { ConnectionOptions } from "tls";
+import { NetStream } from "../types";
+import AbstractConnector, { ErrorEmitter } from "./AbstractConnector";
+declare type TcpOptions = Pick<TcpNetConnectOpts, "port" | "host" | "family">;
+declare type IpcOptions = Pick<IpcNetConnectOpts, "path">;
+export declare type StandaloneConnectionOptions = Partial<TcpOptions & IpcOptions> & {
+    disconnectTimeout?: number | undefined;
+    tls?: ConnectionOptions | undefined;
+};
+export default class StandaloneConnector extends AbstractConnector {
+    protected options: StandaloneConnectionOptions;
+    constructor(options: StandaloneConnectionOptions);
+    connect(_: ErrorEmitter): Promise<NetStream>;
+}
+export {};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.js
new file mode 100644
index 0000000..d17c91a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/StandaloneConnector.js
@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const net_1 = require("net");
+const tls_1 = require("tls");
+const utils_1 = require("../utils");
+const AbstractConnector_1 = require("./AbstractConnector");
+class StandaloneConnector extends AbstractConnector_1.default {
+    constructor(options) {
+        super(options.disconnectTimeout);
+        this.options = options;
+    }
+    connect(_) {
+        const { options } = this;
+        this.connecting = true;
+        let connectionOptions;
+        if ("path" in options && options.path) {
+            connectionOptions = {
+                path: options.path,
+            };
+        }
+        else {
+            connectionOptions = {};
+            if ("port" in options && options.port != null) {
+                connectionOptions.port = options.port;
+            }
+            if ("host" in options && options.host != null) {
+                connectionOptions.host = options.host;
+            }
+            if ("family" in options && options.family != null) {
+                connectionOptions.family = options.family;
+            }
+        }
+        if (options.tls) {
+            Object.assign(connectionOptions, options.tls);
+        }
+        // TODO:
+        // We use native Promise here since other Promise
+        // implementation may use different schedulers that
+        // cause issue when the stream is resolved in the
+        // next tick.
+        // Should use the provided promise in the next major
+        // version and do not connect before resolved.
+        return new Promise((resolve, reject) => {
+            process.nextTick(() => {
+                if (!this.connecting) {
+                    reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+                    return;
+                }
+                try {
+                    if (options.tls) {
+                        this.stream = (0, tls_1.connect)(connectionOptions);
+                    }
+                    else {
+                        this.stream = (0, net_1.createConnection)(connectionOptions);
+                    }
+                }
+                catch (err) {
+                    reject(err);
+                    return;
+                }
+                this.stream.once("error", (err) => {
+                    this.firstError = err;
+                });
+                resolve(this.stream);
+            });
+        });
+    }
+}
+exports.default = StandaloneConnector;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/connectors/index.d.ts
new file mode 100644
index 0000000..fa74d6f
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/index.d.ts
@@ -0,0 +1,3 @@
+import StandaloneConnector from "./StandaloneConnector";
+import SentinelConnector from "./SentinelConnector";
+export { StandaloneConnector, SentinelConnector };
diff --git a/node_modules/bullmq/node_modules/ioredis/built/connectors/index.js b/node_modules/bullmq/node_modules/ioredis/built/connectors/index.js
new file mode 100644
index 0000000..49a03a2
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/connectors/index.js
@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SentinelConnector = exports.StandaloneConnector = void 0;
+const StandaloneConnector_1 = require("./StandaloneConnector");
+exports.StandaloneConnector = StandaloneConnector_1.default;
+const SentinelConnector_1 = require("./SentinelConnector");
+exports.SentinelConnector = SentinelConnector_1.default;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.d.ts b/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.d.ts
new file mode 100644
index 0000000..7547966
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.d.ts
@@ -0,0 +1,9 @@
+declare const TLSProfiles: {
+    readonly RedisCloudFixed: {
+        readonly ca: "-----BEGIN CERTIFICATE-----\nMIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP\nJnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz\nrmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E\nQwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2\nBDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3\nTMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp\n4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w\nMB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w\nDQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta\nlbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6\nSu8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ\nuFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k\nBpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp\nZ4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx\nCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w\nKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN\nMTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG\nA1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy\nbWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA\nA4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv\nTq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4\nVuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym\nhjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W\nP0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN\nr0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw\nhhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s\nUzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u\nP1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9\nMjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT\nt5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID\nAQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy\nLnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw\nAYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G\nA1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4\nL2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB\nhjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr\nAP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW\nvcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw\n7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+\nXoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc\nAUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1\njQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh\n/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z\nzDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli\niF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43\niqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo\n616pxqo=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV\nBAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz\nTGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y\naXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC\nVVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz\nMS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw\nggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1\nG5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY\nDm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl\npp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT\nULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag\n54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ\nxeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC\nJpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K\n2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3\nStsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI\nSIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B\ncS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL\nyzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T\nAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg\nz5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu\nrYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3\n3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+\nhSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ\nD0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj\nTY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l\nFXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj\nmcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf\nybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji\nn8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F\nUhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM\nMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv\nYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y\nNTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu\nIG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy\nMDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf\n8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD\nBVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg\nofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK\ndZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh\ncounQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu\njE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG\nCCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW\nBBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj\nmove4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw\nMi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1\ncmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w\nK6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD\nVR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC\nAQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/\n3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY\n0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX\ny+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3\n15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5\nZgKnO/Fx2hBgTxhOTMYaD312kg==\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G\nA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp\nZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4\nMTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG\nA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\nhvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8\nRgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT\ngHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm\nKPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd\nQQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ\nXriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw\nDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o\nLkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU\nRUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp\njjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK\n6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX\nmcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs\nMx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH\nWD9f\n-----END CERTIFICATE-----";
+    };
+    readonly RedisCloudFlexible: {
+        readonly ca: "-----BEGIN CERTIFICATE-----\nMIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP\nJnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz\nrmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E\nQwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2\nBDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3\nTMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp\n4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w\nMB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w\nDQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta\nlbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6\nSu8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ\nuFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k\nBpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp\nZ4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx\nCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w\nKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN\nMTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG\nA1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy\nbWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA\nA4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv\nTq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4\nVuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym\nhjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W\nP0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN\nr0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw\nhhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s\nUzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u\nP1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9\nMjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT\nt5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID\nAQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy\nLnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw\nAYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G\nA1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4\nL2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB\nhjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr\nAP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW\nvcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw\n7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+\nXoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc\nAUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1\njQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh\n/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z\nzDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli\niF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43\niqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo\n616pxqo=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV\nBAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz\nTGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y\naXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC\nVVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz\nMS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw\nggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1\nG5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY\nDm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl\npp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT\nULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag\n54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ\nxeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC\nJpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K\n2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3\nStsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI\nSIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B\ncS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL\nyzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T\nAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg\nz5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu\nrYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3\n3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+\nhSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ\nD0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj\nTY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l\nFXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj\nmcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf\nybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji\nn8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F\nUhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM\nMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv\nYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y\nNTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu\nIG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy\nMDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf\n8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD\nBVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg\nofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK\ndZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh\ncounQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu\njE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG\nCCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW\nBBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj\nmove4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw\nMi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1\ncmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w\nK6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD\nVR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC\nAQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/\n3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY\n0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX\ny+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3\n15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5\nZgKnO/Fx2hBgTxhOTMYaD312kg==\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G\nA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp\nZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4\nMTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG\nA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\nhvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8\nRgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT\ngHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm\nKPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd\nQQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ\nXriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw\nDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o\nLkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU\nRUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp\njjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK\n6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX\nmcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs\nMx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH\nWD9f\n-----END CERTIFICATE-----";
+    };
+};
+export default TLSProfiles;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.js b/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.js
new file mode 100644
index 0000000..f90760d
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/constants/TLSProfiles.js
@@ -0,0 +1,149 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * TLS settings for Redis Cloud. Updated on 2022-08-19.
+ */
+const RedisCloudCA = `-----BEGIN CERTIFICATE-----
+MIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV
+BAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1
+dGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV
+BAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1
+dGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP
+JnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz
+rmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E
+QwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2
+BDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3
+TMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp
+4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w
+MB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w
+DQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta
+lbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6
+Su8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ
+uFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k
+BpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp
+Z4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=
+-----END CERTIFICATE-----
+-----BEGIN CERTIFICATE-----
+MIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx
+CzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w
+KwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN
+MTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG
+A1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy
+bWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA
+A4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv
+Tq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4
+VuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym
+hjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W
+P0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN
+r0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw
+hhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s
+UzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u
+P1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9
+MjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT
+t5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID
+AQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy
+LnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw
+AYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G
+A1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4
+L2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB
+hjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr
+AP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW
+vcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw
+7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+
+XoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc
+AUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1
+jQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh
+/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z
+zDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli
+iF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43
+iqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo
+616pxqo=
+-----END CERTIFICATE-----
+-----BEGIN CERTIFICATE-----
+MIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV
+BAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz
+TGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y
+aXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC
+VVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz
+MS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw
+ggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1
+G5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY
+Dm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl
+pp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT
+ULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag
+54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ
+xeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC
+JpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K
+2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3
+StsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI
+SIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B
+cS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL
+yzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T
+AQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg
+z5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu
+rYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3
+3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+
+hSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ
+D0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj
+TY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l
+FXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj
+mcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf
+ybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji
+n8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F
+UhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h
+-----END CERTIFICATE-----
+
+-----BEGIN CERTIFICATE-----
+MIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM
+MSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv
+YmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y
+NTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu
+IG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy
+MDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf
+8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD
+BVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg
+ofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK
+dZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh
+counQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu
+jE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG
+CCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW
+BBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj
+move4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw
+Mi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1
+cmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w
+K6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD
+VR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC
+AQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/
+3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY
+0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX
+y+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3
+15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5
+ZgKnO/Fx2hBgTxhOTMYaD312kg==
+-----END CERTIFICATE-----
+
+-----BEGIN CERTIFICATE-----
+MIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G
+A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp
+Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4
+MTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG
+A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8
+RgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT
+gHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm
+KPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd
+QQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ
+XriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw
+DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o
+LkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU
+RUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp
+jjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK
+6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX
+mcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs
+Mx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH
+WD9f
+-----END CERTIFICATE-----`;
+const TLSProfiles = {
+    RedisCloudFixed: { ca: RedisCloudCA },
+    RedisCloudFlexible: { ca: RedisCloudCA },
+};
+exports.default = TLSProfiles;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts b/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts
new file mode 100644
index 0000000..870640f
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts
@@ -0,0 +1,7 @@
+import { RedisError } from "redis-errors";
+export default class ClusterAllFailedError extends RedisError {
+    lastNodeError: RedisError;
+    static defaultMessage: string;
+    constructor(message: any, lastNodeError: RedisError);
+    get name(): string;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.js b/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.js
new file mode 100644
index 0000000..c223f16
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/ClusterAllFailedError.js
@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const redis_errors_1 = require("redis-errors");
+class ClusterAllFailedError extends redis_errors_1.RedisError {
+    constructor(message, lastNodeError) {
+        super(message);
+        this.lastNodeError = lastNodeError;
+        Error.captureStackTrace(this, this.constructor);
+    }
+    get name() {
+        return this.constructor.name;
+    }
+}
+exports.default = ClusterAllFailedError;
+ClusterAllFailedError.defaultMessage = "Failed to refresh slots cache.";
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts b/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts
new file mode 100644
index 0000000..9c4b4e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts
@@ -0,0 +1,5 @@
+import { AbortError } from "redis-errors";
+export default class MaxRetriesPerRequestError extends AbortError {
+    constructor(maxRetriesPerRequest: number);
+    get name(): string;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js b/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js
new file mode 100644
index 0000000..d8c8e1d
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js
@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const redis_errors_1 = require("redis-errors");
+class MaxRetriesPerRequestError extends redis_errors_1.AbortError {
+    constructor(maxRetriesPerRequest) {
+        const message = `Reached the max retries per request limit (which is ${maxRetriesPerRequest}). Refer to "maxRetriesPerRequest" option for details.`;
+        super(message);
+        Error.captureStackTrace(this, this.constructor);
+    }
+    get name() {
+        return this.constructor.name;
+    }
+}
+exports.default = MaxRetriesPerRequestError;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/errors/index.d.ts
new file mode 100644
index 0000000..6d25308
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/index.d.ts
@@ -0,0 +1,2 @@
+import MaxRetriesPerRequestError from "./MaxRetriesPerRequestError";
+export { MaxRetriesPerRequestError };
diff --git a/node_modules/bullmq/node_modules/ioredis/built/errors/index.js b/node_modules/bullmq/node_modules/ioredis/built/errors/index.js
new file mode 100644
index 0000000..02b72a9
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/errors/index.js
@@ -0,0 +1,5 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MaxRetriesPerRequestError = void 0;
+const MaxRetriesPerRequestError_1 = require("./MaxRetriesPerRequestError");
+exports.MaxRetriesPerRequestError = MaxRetriesPerRequestError_1.default;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/index.d.ts
new file mode 100644
index 0000000..d98fa59
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/index.d.ts
@@ -0,0 +1,43 @@
+export { default } from "./Redis";
+export { default as Redis } from "./Redis";
+export { default as Cluster } from "./cluster";
+/**
+ * @ignore
+ */
+export { default as Command } from "./Command";
+/**
+ * @ignore
+ */
+export { default as RedisCommander, Result, ClientContext, } from "./utils/RedisCommander";
+/**
+ * @ignore
+ */
+export { default as ScanStream } from "./ScanStream";
+/**
+ * @ignore
+ */
+export { default as Pipeline } from "./Pipeline";
+/**
+ * @ignore
+ */
+export { default as AbstractConnector } from "./connectors/AbstractConnector";
+/**
+ * @ignore
+ */
+export { default as SentinelConnector, SentinelIterator, } from "./connectors/SentinelConnector";
+/**
+ * @ignore
+ */
+export { Callback } from "./types";
+export { SentinelAddress, SentinelConnectionOptions, } from "./connectors/SentinelConnector";
+export { StandaloneConnectionOptions } from "./connectors/StandaloneConnector";
+export { RedisOptions, CommonRedisOptions } from "./redis/RedisOptions";
+export { ClusterNode } from "./cluster";
+export { ClusterOptions, DNSLookupFunction, DNSResolveSrvFunction, NatMap, } from "./cluster/ClusterOptions";
+export { NodeRole } from "./cluster/util";
+export type { RedisKey, RedisValue, ChainableCommander, } from "./utils/RedisCommander";
+export declare const ReplyError: any;
+/**
+ * @ignore
+ */
+export declare function print(err: Error | null, reply?: any): void;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/index.js b/node_modules/bullmq/node_modules/ioredis/built/index.js
new file mode 100644
index 0000000..24a1895
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/index.js
@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.print = exports.ReplyError = exports.SentinelIterator = exports.SentinelConnector = exports.AbstractConnector = exports.Pipeline = exports.ScanStream = exports.Command = exports.Cluster = exports.Redis = exports.default = void 0;
+exports = module.exports = require("./Redis").default;
+var Redis_1 = require("./Redis");
+Object.defineProperty(exports, "default", { enumerable: true, get: function () { return Redis_1.default; } });
+var Redis_2 = require("./Redis");
+Object.defineProperty(exports, "Redis", { enumerable: true, get: function () { return Redis_2.default; } });
+var cluster_1 = require("./cluster");
+Object.defineProperty(exports, "Cluster", { enumerable: true, get: function () { return cluster_1.default; } });
+/**
+ * @ignore
+ */
+var Command_1 = require("./Command");
+Object.defineProperty(exports, "Command", { enumerable: true, get: function () { return Command_1.default; } });
+/**
+ * @ignore
+ */
+var ScanStream_1 = require("./ScanStream");
+Object.defineProperty(exports, "ScanStream", { enumerable: true, get: function () { return ScanStream_1.default; } });
+/**
+ * @ignore
+ */
+var Pipeline_1 = require("./Pipeline");
+Object.defineProperty(exports, "Pipeline", { enumerable: true, get: function () { return Pipeline_1.default; } });
+/**
+ * @ignore
+ */
+var AbstractConnector_1 = require("./connectors/AbstractConnector");
+Object.defineProperty(exports, "AbstractConnector", { enumerable: true, get: function () { return AbstractConnector_1.default; } });
+/**
+ * @ignore
+ */
+var SentinelConnector_1 = require("./connectors/SentinelConnector");
+Object.defineProperty(exports, "SentinelConnector", { enumerable: true, get: function () { return SentinelConnector_1.default; } });
+Object.defineProperty(exports, "SentinelIterator", { enumerable: true, get: function () { return SentinelConnector_1.SentinelIterator; } });
+// No TS typings
+exports.ReplyError = require("redis-errors").ReplyError;
+/**
+ * @ignore
+ */
+Object.defineProperty(exports, "Promise", {
+    get() {
+        console.warn("ioredis v5 does not support plugging third-party Promise library anymore. Native Promise will be used.");
+        return Promise;
+    },
+    set(_lib) {
+        console.warn("ioredis v5 does not support plugging third-party Promise library anymore. Native Promise will be used.");
+    },
+});
+/**
+ * @ignore
+ */
+function print(err, reply) {
+    if (err) {
+        console.log("Error: " + err);
+    }
+    else {
+        console.log("Reply: " + reply);
+    }
+}
+exports.print = print;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.d.ts b/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.d.ts
new file mode 100644
index 0000000..6242728
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.d.ts
@@ -0,0 +1,197 @@
+import { CommanderOptions } from "../utils/Commander";
+import ConnectorConstructor from "../connectors/ConnectorConstructor";
+import { SentinelConnectionOptions } from "../connectors/SentinelConnector";
+import { StandaloneConnectionOptions } from "../connectors/StandaloneConnector";
+export declare type ReconnectOnError = (err: Error) => boolean | 1 | 2;
+export interface CommonRedisOptions extends CommanderOptions {
+    Connector?: ConnectorConstructor | undefined;
+    retryStrategy?: ((times: number) => number | void | null) | undefined;
+    /**
+     * If a command does not return a reply within a set number of milliseconds,
+     * a "Command timed out" error will be thrown.
+     */
+    commandTimeout?: number | undefined;
+    /**
+     * Enables client-side timeout protection for blocking commands when set
+     * to a positive number. If `blockingTimeout` is undefined, `0`, or
+     * negative (e.g. `-1`), the protection is disabled and no client-side
+     * timers are installed for blocking commands.
+     */
+    blockingTimeout?: number | undefined;
+    /**
+     * Grace period (ms) added to blocking command timeouts. Only used when
+     * `blockingTimeout` is a positive number. Defaults to 100ms.
+     */
+    blockingTimeoutGrace?: number | undefined;
+    /**
+     * If the socket does not receive data within a set number of milliseconds:
+     * 1. the socket is considered "dead" and will be destroyed
+     * 2. the client will reject any running commands (altought they might have been processed by the server)
+     * 3. the reconnect strategy will kick in (depending on the configuration)
+     */
+    socketTimeout?: number | undefined;
+    /**
+     * Enable/disable keep-alive functionality.
+     * @link https://nodejs.org/api/net.html#socketsetkeepaliveenable-initialdelay
+     * @default 0
+     */
+    keepAlive?: number | undefined;
+    /**
+     * Enable/disable the use of Nagle's algorithm.
+     * @link https://nodejs.org/api/net.html#socketsetnodelaynodelay
+     * @default true
+     */
+    noDelay?: boolean | undefined;
+    /**
+     * Set the name of the connection to make it easier to identity the connection
+     * in client list.
+     * @link https://redis.io/commands/client-setname
+     */
+    connectionName?: string | undefined;
+    /**
+     * If true, skips setting library info via CLIENT SETINFO.
+     * @link https://redis.io/docs/latest/commands/client-setinfo/
+     * @default false
+     */
+    disableClientInfo?: boolean | undefined;
+    /**
+     * Tag to append to the library name in CLIENT SETINFO (ioredis(tag)).
+     * @link https://redis.io/docs/latest/commands/client-setinfo/
+     * @default undefined
+     */
+    clientInfoTag?: string | undefined;
+    /**
+     * If set, client will send AUTH command with the value of this option as the first argument when connected.
+     * This is supported since Redis 6.
+     */
+    username?: string | undefined;
+    /**
+     * If set, client will send AUTH command with the value of this option when connected.
+     */
+    password?: string | undefined;
+    /**
+     * Database index to use.
+     *
+     * @default 0
+     */
+    db?: number | undefined;
+    /**
+     * When the client reconnects, channels subscribed in the previous connection will be
+     * resubscribed automatically if `autoResubscribe` is `true`.
+     * @default true
+     */
+    autoResubscribe?: boolean | undefined;
+    /**
+     * Whether or not to resend unfulfilled commands on reconnect.
+     * Unfulfilled commands are most likely to be blocking commands such as `brpop` or `blpop`.
+     * @default true
+     */
+    autoResendUnfulfilledCommands?: boolean | undefined;
+    /**
+     * Whether or not to reconnect on certain Redis errors.
+     * This options by default is `null`, which means it should never reconnect on Redis errors.
+     * You can pass a function that accepts an Redis error, and returns:
+     * - `true` or `1` to trigger a reconnection.
+     * - `false` or `0` to not reconnect.
+     * - `2` to reconnect and resend the failed command (who triggered the error) after reconnection.
+     * @example
+     * ```js
+     * const redis = new Redis({
+     *   reconnectOnError(err) {
+     *     const targetError = "READONLY";
+     *     if (err.message.includes(targetError)) {
+     *       // Only reconnect when the error contains "READONLY"
+     *       return true; // or `return 1;`
+     *     }
+     *   },
+     * });
+     * ```
+     * @default null
+     */
+    reconnectOnError?: ReconnectOnError | null | undefined;
+    /**
+     * @default false
+     */
+    readOnly?: boolean | undefined;
+    /**
+     * When enabled, numbers returned by Redis will be converted to JavaScript strings instead of numbers.
+     * This is necessary if you want to handle big numbers (above `Number.MAX_SAFE_INTEGER` === 2^53).
+     * @default false
+     */
+    stringNumbers?: boolean | undefined;
+    /**
+     * How long the client will wait before killing a socket due to inactivity during initial connection.
+     * @default 10000
+     */
+    connectTimeout?: number | undefined;
+    /**
+     * This option is used internally when you call `redis.monitor()` to tell Redis
+     * to enter the monitor mode when the connection is established.
+     *
+     * @default false
+     */
+    monitor?: boolean | undefined;
+    /**
+     * The commands that don't get a reply due to the connection to the server is lost are
+     * put into a queue and will be resent on reconnect (if allowed by the `retryStrategy` option).
+     * This option is used to configure how many reconnection attempts should be allowed before
+     * the queue is flushed with a `MaxRetriesPerRequestError` error.
+     * Set this options to `null` instead of a number to let commands wait forever
+     * until the connection is alive again.
+     *
+     * @default 20
+     */
+    maxRetriesPerRequest?: number | null | undefined;
+    /**
+     * @default 10000
+     */
+    maxLoadingRetryTime?: number | undefined;
+    /**
+     * @default false
+     */
+    enableAutoPipelining?: boolean | undefined;
+    /**
+     * @default []
+     */
+    autoPipeliningIgnoredCommands?: string[] | undefined;
+    offlineQueue?: boolean | undefined;
+    commandQueue?: boolean | undefined;
+    /**
+     *
+     * By default, if the connection to Redis server has not been established, commands are added to a queue
+     * and are executed once the connection is "ready" (when `enableReadyCheck` is true, "ready" means
+     * the Redis server has loaded the database from disk, otherwise means the connection to the Redis
+     * server has been established). If this option is false, when execute the command when the connection
+     * isn't ready, an error will be returned.
+     *
+     * @default true
+     */
+    enableOfflineQueue?: boolean | undefined;
+    /**
+     * The client will sent an INFO command to check whether the server is still loading data from the disk (
+     * which happens when the server is just launched) when the connection is established, and only wait until
+     * the loading process is finished before emitting the `ready` event.
+     *
+     * @default true
+     */
+    enableReadyCheck?: boolean | undefined;
+    /**
+     * When a Redis instance is initialized, a connection to the server is immediately established. Set this to
+     * true will delay the connection to the server until the first command is sent or `redis.connect()` is called
+     * explicitly. When `redis.connect()` is called explicitly, a Promise is returned, which will be resolved
+     * when the connection is ready or rejected when it fails. The rejection should be handled by the user.
+     *
+     * @default false
+     */
+    lazyConnect?: boolean | undefined;
+    /**
+     * @default undefined
+     */
+    scripts?: Record<string, {
+        lua: string;
+        numberOfKeys?: number | undefined;
+        readOnly?: boolean | undefined;
+    }> | undefined;
+}
+export declare type RedisOptions = CommonRedisOptions & SentinelConnectionOptions & StandaloneConnectionOptions;
+export declare const DEFAULT_REDIS_OPTIONS: RedisOptions;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.js b/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.js
new file mode 100644
index 0000000..99ee7dc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/redis/RedisOptions.js
@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_REDIS_OPTIONS = void 0;
+exports.DEFAULT_REDIS_OPTIONS = {
+    // Connection
+    port: 6379,
+    host: "localhost",
+    family: 0,
+    connectTimeout: 10000,
+    disconnectTimeout: 2000,
+    retryStrategy: function (times) {
+        return Math.min(times * 50, 2000);
+    },
+    keepAlive: 0,
+    noDelay: true,
+    connectionName: null,
+    disableClientInfo: false,
+    clientInfoTag: undefined,
+    // Sentinel
+    sentinels: null,
+    name: null,
+    role: "master",
+    sentinelRetryStrategy: function (times) {
+        return Math.min(times * 10, 1000);
+    },
+    sentinelReconnectStrategy: function () {
+        // This strategy only applies when sentinels are used for detecting
+        // a failover, not during initial master resolution.
+        // The deployment can still function when some of the sentinels are down
+        // for a long period of time, so we may not want to attempt reconnection
+        // very often. Therefore the default interval is fairly long (1 minute).
+        return 60000;
+    },
+    natMap: null,
+    enableTLSForSentinelMode: false,
+    updateSentinels: true,
+    failoverDetector: false,
+    // Status
+    username: null,
+    password: null,
+    db: 0,
+    // Others
+    enableOfflineQueue: true,
+    enableReadyCheck: true,
+    autoResubscribe: true,
+    autoResendUnfulfilledCommands: true,
+    lazyConnect: false,
+    keyPrefix: "",
+    reconnectOnError: null,
+    readOnly: false,
+    stringNumbers: false,
+    maxRetriesPerRequest: 20,
+    maxLoadingRetryTime: 10000,
+    enableAutoPipelining: false,
+    autoPipeliningIgnoredCommands: [],
+    sentinelMaxConnections: 10,
+    blockingTimeoutGrace: 100,
+};
diff --git a/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.d.ts b/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.d.ts
new file mode 100644
index 0000000..1ce79dd
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.d.ts
@@ -0,0 +1,4 @@
+export declare function connectHandler(self: any): () => void;
+export declare function closeHandler(self: any): () => void;
+export declare function errorHandler(self: any): (error: any) => void;
+export declare function readyHandler(self: any): () => void;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.js b/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.js
new file mode 100644
index 0000000..ba8b1dc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/redis/event_handler.js
@@ -0,0 +1,315 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.readyHandler = exports.errorHandler = exports.closeHandler = exports.connectHandler = void 0;
+const redis_errors_1 = require("redis-errors");
+const Command_1 = require("../Command");
+const errors_1 = require("../errors");
+const utils_1 = require("../utils");
+const DataHandler_1 = require("../DataHandler");
+const debug = (0, utils_1.Debug)("connection");
+function connectHandler(self) {
+    return function () {
+        var _a;
+        self.setStatus("connect");
+        self.resetCommandQueue();
+        // AUTH command should be processed before any other commands
+        let flushed = false;
+        const { connectionEpoch } = self;
+        if (self.condition.auth) {
+            self.auth(self.condition.auth, function (err) {
+                if (connectionEpoch !== self.connectionEpoch) {
+                    return;
+                }
+                if (err) {
+                    if (err.message.indexOf("no password is set") !== -1) {
+                        console.warn("[WARN] Redis server does not require a password, but a password was supplied.");
+                    }
+                    else if (err.message.indexOf("without any password configured for the default user") !== -1) {
+                        console.warn("[WARN] This Redis server's `default` user does not require a password, but a password was supplied");
+                    }
+                    else if (err.message.indexOf("wrong number of arguments for 'auth' command") !== -1) {
+                        console.warn(`[ERROR] The server returned "wrong number of arguments for 'auth' command". You are probably passing both username and password to Redis version 5 or below. You should only pass the 'password' option for Redis version 5 and under.`);
+                    }
+                    else {
+                        flushed = true;
+                        self.recoverFromFatalError(err, err);
+                    }
+                }
+            });
+        }
+        if (self.condition.select) {
+            self.select(self.condition.select).catch((err) => {
+                // If the node is in cluster mode, select is disallowed.
+                // In this case, reconnect won't help.
+                self.silentEmit("error", err);
+            });
+        }
+        /*
+          No need to keep the reference of DataHandler here
+          because we don't need to do the cleanup.
+          `Stream#end()` will remove all listeners for us.
+        */
+        new DataHandler_1.default(self, {
+            stringNumbers: self.options.stringNumbers,
+        });
+        const clientCommandPromises = [];
+        if (self.options.connectionName) {
+            debug("set the connection name [%s]", self.options.connectionName);
+            clientCommandPromises.push(self.client("setname", self.options.connectionName).catch(utils_1.noop));
+        }
+        if (!self.options.disableClientInfo) {
+            debug("set the client info");
+            clientCommandPromises.push((0, utils_1.getPackageMeta)()
+                .then((packageMeta) => {
+                return self
+                    .client("SETINFO", "LIB-VER", packageMeta.version)
+                    .catch(utils_1.noop);
+            })
+                .catch(utils_1.noop));
+            clientCommandPromises.push(self
+                .client("SETINFO", "LIB-NAME", ((_a = self.options) === null || _a === void 0 ? void 0 : _a.clientInfoTag)
+                ? `ioredis(${self.options.clientInfoTag})`
+                : "ioredis")
+                .catch(utils_1.noop));
+        }
+        Promise.all(clientCommandPromises)
+            .catch(utils_1.noop)
+            .finally(() => {
+            if (!self.options.enableReadyCheck) {
+                exports.readyHandler(self)();
+            }
+            if (self.options.enableReadyCheck) {
+                self._readyCheck(function (err, info) {
+                    if (connectionEpoch !== self.connectionEpoch) {
+                        return;
+                    }
+                    if (err) {
+                        if (!flushed) {
+                            self.recoverFromFatalError(new Error("Ready check failed: " + err.message), err);
+                        }
+                    }
+                    else {
+                        if (self.connector.check(info)) {
+                            exports.readyHandler(self)();
+                        }
+                        else {
+                            self.disconnect(true);
+                        }
+                    }
+                });
+            }
+        });
+    };
+}
+exports.connectHandler = connectHandler;
+function abortError(command) {
+    const err = new redis_errors_1.AbortError("Command aborted due to connection close");
+    err.command = {
+        name: command.name,
+        args: command.args,
+    };
+    return err;
+}
+// If a contiguous set of pipeline commands starts from index zero then they
+// can be safely reattempted. If however we have a chain of pipelined commands
+// starting at index 1 or more it means we received a partial response before
+// the connection close and those pipelined commands must be aborted. For
+// example, if the queue looks like this: [2, 3, 4, 0, 1, 2] then after
+// aborting and purging we'll have a queue that looks like this: [0, 1, 2]
+function abortIncompletePipelines(commandQueue) {
+    var _a;
+    let expectedIndex = 0;
+    for (let i = 0; i < commandQueue.length;) {
+        const command = (_a = commandQueue.peekAt(i)) === null || _a === void 0 ? void 0 : _a.command;
+        const pipelineIndex = command.pipelineIndex;
+        if (pipelineIndex === undefined || pipelineIndex === 0) {
+            expectedIndex = 0;
+        }
+        if (pipelineIndex !== undefined && pipelineIndex !== expectedIndex++) {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+            continue;
+        }
+        i++;
+    }
+}
+// If only a partial transaction result was received before connection close,
+// we have to abort any transaction fragments that may have ended up in the
+// offline queue
+function abortTransactionFragments(commandQueue) {
+    var _a;
+    for (let i = 0; i < commandQueue.length;) {
+        const command = (_a = commandQueue.peekAt(i)) === null || _a === void 0 ? void 0 : _a.command;
+        if (command.name === "multi") {
+            break;
+        }
+        if (command.name === "exec") {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+            break;
+        }
+        if (command.inTransaction) {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+        }
+        else {
+            i++;
+        }
+    }
+}
+function closeHandler(self) {
+    return function () {
+        const prevStatus = self.status;
+        self.setStatus("close");
+        if (self.commandQueue.length) {
+            abortIncompletePipelines(self.commandQueue);
+        }
+        if (self.offlineQueue.length) {
+            abortTransactionFragments(self.offlineQueue);
+        }
+        if (prevStatus === "ready") {
+            if (!self.prevCondition) {
+                self.prevCondition = self.condition;
+            }
+            if (self.commandQueue.length) {
+                self.prevCommandQueue = self.commandQueue;
+            }
+        }
+        if (self.manuallyClosing) {
+            self.manuallyClosing = false;
+            debug("skip reconnecting since the connection is manually closed.");
+            return close();
+        }
+        if (typeof self.options.retryStrategy !== "function") {
+            debug("skip reconnecting because `retryStrategy` is not a function");
+            return close();
+        }
+        const retryDelay = self.options.retryStrategy(++self.retryAttempts);
+        if (typeof retryDelay !== "number") {
+            debug("skip reconnecting because `retryStrategy` doesn't return a number");
+            return close();
+        }
+        debug("reconnect in %sms", retryDelay);
+        self.setStatus("reconnecting", retryDelay);
+        self.reconnectTimeout = setTimeout(function () {
+            self.reconnectTimeout = null;
+            self.connect().catch(utils_1.noop);
+        }, retryDelay);
+        const { maxRetriesPerRequest } = self.options;
+        if (typeof maxRetriesPerRequest === "number") {
+            if (maxRetriesPerRequest < 0) {
+                debug("maxRetriesPerRequest is negative, ignoring...");
+            }
+            else {
+                const remainder = self.retryAttempts % (maxRetriesPerRequest + 1);
+                if (remainder === 0) {
+                    debug("reach maxRetriesPerRequest limitation, flushing command queue...");
+                    self.flushQueue(new errors_1.MaxRetriesPerRequestError(maxRetriesPerRequest));
+                }
+            }
+        }
+    };
+    function close() {
+        self.setStatus("end");
+        self.flushQueue(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+    }
+}
+exports.closeHandler = closeHandler;
+function errorHandler(self) {
+    return function (error) {
+        debug("error: %s", error);
+        self.silentEmit("error", error);
+    };
+}
+exports.errorHandler = errorHandler;
+function readyHandler(self) {
+    return function () {
+        self.setStatus("ready");
+        self.retryAttempts = 0;
+        if (self.options.monitor) {
+            self.call("monitor").then(() => self.setStatus("monitoring"), (error) => self.emit("error", error));
+            const { sendCommand } = self;
+            self.sendCommand = function (command) {
+                if (Command_1.default.checkFlag("VALID_IN_MONITOR_MODE", command.name)) {
+                    return sendCommand.call(self, command);
+                }
+                command.reject(new Error("Connection is in monitoring mode, can't process commands."));
+                return command.promise;
+            };
+            self.once("close", function () {
+                delete self.sendCommand;
+            });
+            return;
+        }
+        const finalSelect = self.prevCondition
+            ? self.prevCondition.select
+            : self.condition.select;
+        if (self.options.readOnly) {
+            debug("set the connection to readonly mode");
+            self.readonly().catch(utils_1.noop);
+        }
+        if (self.prevCondition) {
+            const condition = self.prevCondition;
+            self.prevCondition = null;
+            if (condition.subscriber && self.options.autoResubscribe) {
+                // We re-select the previous db first since
+                // `SELECT` command is not valid in sub mode.
+                if (self.condition.select !== finalSelect) {
+                    debug("connect to db [%d]", finalSelect);
+                    self.select(finalSelect);
+                }
+                const subscribeChannels = condition.subscriber.channels("subscribe");
+                if (subscribeChannels.length) {
+                    debug("subscribe %d channels", subscribeChannels.length);
+                    self.subscribe(subscribeChannels);
+                }
+                const psubscribeChannels = condition.subscriber.channels("psubscribe");
+                if (psubscribeChannels.length) {
+                    debug("psubscribe %d channels", psubscribeChannels.length);
+                    self.psubscribe(psubscribeChannels);
+                }
+                const ssubscribeChannels = condition.subscriber.channels("ssubscribe");
+                if (ssubscribeChannels.length) {
+                    debug("ssubscribe %s", ssubscribeChannels.length);
+                    for (const channel of ssubscribeChannels) {
+                        self.ssubscribe(channel);
+                    }
+                }
+            }
+        }
+        if (self.prevCommandQueue) {
+            if (self.options.autoResendUnfulfilledCommands) {
+                debug("resend %d unfulfilled commands", self.prevCommandQueue.length);
+                while (self.prevCommandQueue.length > 0) {
+                    const item = self.prevCommandQueue.shift();
+                    if (item.select !== self.condition.select &&
+                        item.command.name !== "select") {
+                        self.select(item.select);
+                    }
+                    self.sendCommand(item.command, item.stream);
+                }
+            }
+            else {
+                self.prevCommandQueue = null;
+            }
+        }
+        if (self.offlineQueue.length) {
+            debug("send %d commands in offline queue", self.offlineQueue.length);
+            const offlineQueue = self.offlineQueue;
+            self.resetOfflineQueue();
+            while (offlineQueue.length > 0) {
+                const item = offlineQueue.shift();
+                if (item.select !== self.condition.select &&
+                    item.command.name !== "select") {
+                    self.select(item.select);
+                }
+                self.sendCommand(item.command, item.stream);
+            }
+        }
+        if (self.condition.select !== finalSelect) {
+            debug("connect to db [%d]", finalSelect);
+            self.select(finalSelect);
+        }
+    };
+}
+exports.readyHandler = readyHandler;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/transaction.d.ts b/node_modules/bullmq/node_modules/ioredis/built/transaction.d.ts
new file mode 100644
index 0000000..d499f25
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/transaction.d.ts
@@ -0,0 +1,13 @@
+import { ChainableCommander } from "./utils/RedisCommander";
+export interface Transaction {
+    pipeline(commands?: unknown[][]): ChainableCommander;
+    multi(options: {
+        pipeline: false;
+    }): Promise<"OK">;
+    multi(): ChainableCommander;
+    multi(options: {
+        pipeline: true;
+    }): ChainableCommander;
+    multi(commands?: unknown[][]): ChainableCommander;
+}
+export declare function addTransactionSupport(redis: any): void;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/transaction.js b/node_modules/bullmq/node_modules/ioredis/built/transaction.js
new file mode 100644
index 0000000..468fa8f
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/transaction.js
@@ -0,0 +1,93 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addTransactionSupport = void 0;
+const utils_1 = require("./utils");
+const standard_as_callback_1 = require("standard-as-callback");
+const Pipeline_1 = require("./Pipeline");
+function addTransactionSupport(redis) {
+    redis.pipeline = function (commands) {
+        const pipeline = new Pipeline_1.default(this);
+        if (Array.isArray(commands)) {
+            pipeline.addBatch(commands);
+        }
+        return pipeline;
+    };
+    const { multi } = redis;
+    redis.multi = function (commands, options) {
+        if (typeof options === "undefined" && !Array.isArray(commands)) {
+            options = commands;
+            commands = null;
+        }
+        if (options && options.pipeline === false) {
+            return multi.call(this);
+        }
+        const pipeline = new Pipeline_1.default(this);
+        // @ts-expect-error
+        pipeline.multi();
+        if (Array.isArray(commands)) {
+            pipeline.addBatch(commands);
+        }
+        const exec = pipeline.exec;
+        pipeline.exec = function (callback) {
+            // Wait for the cluster to be connected, since we need nodes information before continuing
+            if (this.isCluster && !this.redis.slots.length) {
+                if (this.redis.status === "wait")
+                    this.redis.connect().catch(utils_1.noop);
+                return (0, standard_as_callback_1.default)(new Promise((resolve, reject) => {
+                    this.redis.delayUntilReady((err) => {
+                        if (err) {
+                            reject(err);
+                            return;
+                        }
+                        this.exec(pipeline).then(resolve, reject);
+                    });
+                }), callback);
+            }
+            if (this._transactions > 0) {
+                exec.call(pipeline);
+            }
+            // Returns directly when the pipeline
+            // has been called multiple times (retries).
+            if (this.nodeifiedPromise) {
+                return exec.call(pipeline);
+            }
+            const promise = exec.call(pipeline);
+            return (0, standard_as_callback_1.default)(promise.then(function (result) {
+                const execResult = result[result.length - 1];
+                if (typeof execResult === "undefined") {
+                    throw new Error("Pipeline cannot be used to send any commands when the `exec()` has been called on it.");
+                }
+                if (execResult[0]) {
+                    execResult[0].previousErrors = [];
+                    for (let i = 0; i < result.length - 1; ++i) {
+                        if (result[i][0]) {
+                            execResult[0].previousErrors.push(result[i][0]);
+                        }
+                    }
+                    throw execResult[0];
+                }
+                return (0, utils_1.wrapMultiResult)(execResult[1]);
+            }), callback);
+        };
+        // @ts-expect-error
+        const { execBuffer } = pipeline;
+        // @ts-expect-error
+        pipeline.execBuffer = function (callback) {
+            if (this._transactions > 0) {
+                execBuffer.call(pipeline);
+            }
+            return pipeline.exec(callback);
+        };
+        return pipeline;
+    };
+    const { exec } = redis;
+    redis.exec = function (callback) {
+        return (0, standard_as_callback_1.default)(exec.call(this).then(function (results) {
+            if (Array.isArray(results)) {
+                results = (0, utils_1.wrapMultiResult)(results);
+            }
+            return results;
+        }), callback);
+    };
+}
+exports.addTransactionSupport = addTransactionSupport;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/types.d.ts b/node_modules/bullmq/node_modules/ioredis/built/types.d.ts
new file mode 100644
index 0000000..e6d95a9
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/types.d.ts
@@ -0,0 +1,33 @@
+/// <reference types="node" />
+import { Socket } from "net";
+import { TLSSocket } from "tls";
+export declare type Callback<T = any> = (err?: Error | null, result?: T) => void;
+export declare type NetStream = Socket | TLSSocket;
+export declare type CommandParameter = string | Buffer | number | any[];
+export interface Respondable {
+    name: string;
+    args: CommandParameter[];
+    resolve(result: any): void;
+    reject(error: Error): void;
+}
+export interface PipelineWriteableStream {
+    isPipeline: true;
+    write(data: string | Buffer): unknown;
+    destination: {
+        redis: {
+            stream: NetStream;
+        };
+    };
+}
+export declare type WriteableStream = NetStream | PipelineWriteableStream;
+export interface CommandItem {
+    command: Respondable;
+    stream: WriteableStream;
+    select: number;
+}
+export interface ScanStreamOptions {
+    match?: string;
+    type?: string;
+    count?: number;
+    noValues?: boolean;
+}
diff --git a/node_modules/bullmq/node_modules/ioredis/built/types.js b/node_modules/bullmq/node_modules/ioredis/built/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.d.ts
new file mode 100644
index 0000000..cbee525
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.d.ts
@@ -0,0 +1,50 @@
+import Command from "../Command";
+import { WriteableStream } from "../types";
+import RedisCommander, { ClientContext } from "./RedisCommander";
+export interface CommanderOptions {
+    keyPrefix?: string | undefined;
+    showFriendlyErrorStack?: boolean | undefined;
+}
+declare class Commander<Context extends ClientContext = {
+    type: "default";
+}> {
+    options: CommanderOptions;
+    /**
+     * @ignore
+     */
+    scriptsSet: {};
+    /**
+     * @ignore
+     */
+    addedBuiltinSet: Set<string>;
+    /**
+     * Return supported builtin commands
+     */
+    getBuiltinCommands(): string[];
+    /**
+     * Create a builtin command
+     */
+    createBuiltinCommand(commandName: string): {
+        string: any;
+        buffer: any;
+    };
+    /**
+     * Create add builtin command
+     */
+    addBuiltinCommand(commandName: string): void;
+    /**
+     * Define a custom command using lua script
+     */
+    defineCommand(name: string, definition: {
+        lua: string;
+        numberOfKeys?: number;
+        readOnly?: boolean;
+    }): void;
+    /**
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream, node?: unknown): unknown;
+}
+interface Commander<Context> extends RedisCommander<Context> {
+}
+export default Commander;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.js b/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.js
new file mode 100644
index 0000000..31a9155
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/Commander.js
@@ -0,0 +1,117 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const autoPipelining_1 = require("../autoPipelining");
+const Command_1 = require("../Command");
+const Script_1 = require("../Script");
+// eslint-disable-next-line @typescript-eslint/no-unused-vars
+class Commander {
+    constructor() {
+        this.options = {};
+        /**
+         * @ignore
+         */
+        this.scriptsSet = {};
+        /**
+         * @ignore
+         */
+        this.addedBuiltinSet = new Set();
+    }
+    /**
+     * Return supported builtin commands
+     */
+    getBuiltinCommands() {
+        return commands.slice(0);
+    }
+    /**
+     * Create a builtin command
+     */
+    createBuiltinCommand(commandName) {
+        return {
+            string: generateFunction(null, commandName, "utf8"),
+            buffer: generateFunction(null, commandName, null),
+        };
+    }
+    /**
+     * Create add builtin command
+     */
+    addBuiltinCommand(commandName) {
+        this.addedBuiltinSet.add(commandName);
+        this[commandName] = generateFunction(commandName, commandName, "utf8");
+        this[commandName + "Buffer"] = generateFunction(commandName + "Buffer", commandName, null);
+    }
+    /**
+     * Define a custom command using lua script
+     */
+    defineCommand(name, definition) {
+        const script = new Script_1.default(definition.lua, definition.numberOfKeys, this.options.keyPrefix, definition.readOnly);
+        this.scriptsSet[name] = script;
+        this[name] = generateScriptingFunction(name, name, script, "utf8");
+        this[name + "Buffer"] = generateScriptingFunction(name + "Buffer", name, script, null);
+    }
+    /**
+     * @ignore
+     */
+    sendCommand(command, stream, node) {
+        throw new Error('"sendCommand" is not implemented');
+    }
+}
+const commands = commands_1.list.filter((command) => command !== "monitor");
+commands.push("sentinel");
+commands.forEach(function (commandName) {
+    Commander.prototype[commandName] = generateFunction(commandName, commandName, "utf8");
+    Commander.prototype[commandName + "Buffer"] = generateFunction(commandName + "Buffer", commandName, null);
+});
+Commander.prototype.call = generateFunction("call", "utf8");
+Commander.prototype.callBuffer = generateFunction("callBuffer", null);
+// @ts-expect-error
+Commander.prototype.send_command = Commander.prototype.call;
+function generateFunction(functionName, _commandName, _encoding) {
+    if (typeof _encoding === "undefined") {
+        _encoding = _commandName;
+        _commandName = null;
+    }
+    return function (...args) {
+        const commandName = (_commandName || args.shift());
+        let callback = args[args.length - 1];
+        if (typeof callback === "function") {
+            args.pop();
+        }
+        else {
+            callback = undefined;
+        }
+        const options = {
+            errorStack: this.options.showFriendlyErrorStack ? new Error() : undefined,
+            keyPrefix: this.options.keyPrefix,
+            replyEncoding: _encoding,
+        };
+        // No auto pipeline, use regular command sending
+        if (!(0, autoPipelining_1.shouldUseAutoPipelining)(this, functionName, commandName)) {
+            return this.sendCommand(
+            // @ts-expect-error
+            new Command_1.default(commandName, args, options, callback));
+        }
+        // Create a new pipeline and make sure it's scheduled
+        return (0, autoPipelining_1.executeWithAutoPipelining)(this, functionName, commandName, 
+        // @ts-expect-error
+        args, callback);
+    };
+}
+function generateScriptingFunction(functionName, commandName, script, encoding) {
+    return function (...args) {
+        const callback = typeof args[args.length - 1] === "function" ? args.pop() : undefined;
+        const options = {
+            replyEncoding: encoding,
+        };
+        if (this.options.showFriendlyErrorStack) {
+            options.errorStack = new Error();
+        }
+        // No auto pipeline, use regular command sending
+        if (!(0, autoPipelining_1.shouldUseAutoPipelining)(this, functionName, commandName)) {
+            return script.execute(this, args, options, callback);
+        }
+        // Create a new pipeline and make sure it's scheduled
+        return (0, autoPipelining_1.executeWithAutoPipelining)(this, functionName, commandName, args, callback);
+    };
+}
+exports.default = Commander;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.d.ts
new file mode 100644
index 0000000..4074af3
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.d.ts
@@ -0,0 +1,8950 @@
+/**
+ * This file is generated by @ioredis/interface-generator.
+ * Don't edit it manually. Instead, run `npm run generate` to update
+ * this file.
+ */
+/// <reference types="node" />
+import { Callback } from "../types";
+export declare type RedisKey = string | Buffer;
+export declare type RedisValue = string | Buffer | number;
+export interface ResultTypes<Result, Context> {
+    default: Promise<Result>;
+    pipeline: ChainableCommander;
+}
+export interface ChainableCommander extends RedisCommander<{
+    type: "pipeline";
+}> {
+    length: number;
+}
+export declare type ClientContext = {
+    type: keyof ResultTypes<unknown, unknown>;
+};
+export declare type Result<T, Context extends ClientContext> = ResultTypes<T, Context>[Context["type"]];
+interface RedisCommander<Context extends ClientContext = {
+    type: "default";
+}> {
+    /**
+     * Call arbitrary commands.
+     *
+     * `redis.call('set', 'foo', 'bar')` is the same as `redis.set('foo', 'bar')`,
+     * so the only case you need to use this method is when the command is not
+     * supported by ioredis.
+     *
+     * ```ts
+     * redis.call('set', 'foo', 'bar');
+     * redis.call('get', 'foo', (err, value) => {
+     *   // value === 'bar'
+     * });
+     * ```
+     */
+    call(command: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    call(command: string, args: (string | Buffer | number)[], callback?: Callback<unknown>): Result<unknown, Context>;
+    call(...args: [
+        command: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    call(...args: [command: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    callBuffer(command: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    callBuffer(command: string, args: (string | Buffer | number)[], callback?: Callback<unknown>): Result<unknown, Context>;
+    callBuffer(...args: [
+        command: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    callBuffer(...args: [command: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    /**
+     * List the ACL categories or the commands inside a category
+     * - _group_: server
+     * - _complexity_: O(1) since the categories and commands are a fixed set.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "CAT", callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "CAT", categoryname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Remove the specified ACL users and the associated rules
+     * - _group_: server
+     * - _complexity_: O(1) amortized time considering the typical user.
+     * - _since_: 6.0.0
+     */
+    acl(...args: [
+        subcommand: "DELUSER",
+        ...usernames: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    acl(...args: [subcommand: "DELUSER", ...usernames: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Returns whether the user can execute the given command without executing the command.
+     * - _group_: server
+     * - _complexity_: O(1).
+     * - _since_: 7.0.0
+     */
+    acl(subcommand: "DRYRUN", username: string | Buffer, command: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "DRYRUN", username: string | Buffer, command: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    acl(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    aclBuffer(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    acl(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    aclBuffer(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    /**
+     * Generate a pseudorandom secure password to use for ACL users
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "GENPASS", callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "GENPASS", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    acl(subcommand: "GENPASS", bits: number | string, callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "GENPASS", bits: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Get the rules for a specific ACL user
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of password, command and pattern rules that the user has.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "GETUSER", username: string | Buffer, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    aclBuffer(subcommand: "GETUSER", username: string | Buffer, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the current ACL rules in ACL config file format
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LIST", callback?: Callback<string[]>): Result<string[], Context>;
+    aclBuffer(subcommand: "LIST", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Reload the ACLs from the configured ACL file
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LOAD", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * List latest events denied because of ACLs in place
+     * - _group_: server
+     * - _complexity_: O(N) with N being the number of entries shown.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LOG", callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "LOG", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "LOG", reset: "RESET", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Save the current ACL rules in the configured ACL file
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "SAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Modify or create the rules for a specific ACL user
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of rules provided.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "SETUSER", username: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    acl(...args: [
+        subcommand: "SETUSER",
+        username: string | Buffer,
+        ...rules: (string | Buffer)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    acl(...args: [
+        subcommand: "SETUSER",
+        username: string | Buffer,
+        ...rules: (string | Buffer)[]
+    ]): Result<"OK", Context>;
+    /**
+     * List the username of all the configured ACL rules
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "USERS", callback?: Callback<string[]>): Result<string[], Context>;
+    aclBuffer(subcommand: "USERS", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return the name of the user associated to the current connection
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "WHOAMI", callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "WHOAMI", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Append a value to a key
+     * - _group_: string
+     * - _complexity_: O(1). The amortized time complexity is O(1) assuming the appended value is small and the already present value is of any size, since the dynamic string library used by Redis will double the free space available on every reallocation.
+     * - _since_: 2.0.0
+     */
+    append(key: RedisKey, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Sent by cluster clients after an -ASK redirect
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    asking(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Authenticate to the server
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of passwords defined for the user
+     * - _since_: 1.0.0
+     */
+    auth(password: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    auth(username: string | Buffer, password: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Asynchronously rewrite the append-only file
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    bgrewriteaof(callback?: Callback<string>): Result<string, Context>;
+    bgrewriteaofBuffer(callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Asynchronously save the dataset to disk
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    bgsave(callback?: Callback<"OK">): Result<"OK", Context>;
+    bgsave(schedule: "SCHEDULE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Count set bits in a string
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.6.0
+     */
+    bitcount(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, byte: "BYTE", callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, bit: "BIT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Perform arbitrary bitfield integer operations on strings
+     * - _group_: bitmap
+     * - _complexity_: O(1) for each subcommand specified
+     * - _since_: 3.2.0
+     */
+    bitfield(key: RedisKey, encodingOffsetToken: "GET", encoding: string | Buffer, offset: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", wrap: "WRAP", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", wrap: "WRAP", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", sat: "SAT", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", sat: "SAT", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", fail: "FAIL", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", fail: "FAIL", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Perform arbitrary bitfield integer operations on strings. Read-only variant of BITFIELD
+     * - _group_: bitmap
+     * - _complexity_: O(1) for each subcommand specified
+     * - _since_: 6.0.0
+     */
+    bitfield_ro(...args: [
+        key: RedisKey,
+        encodingOffsetToken: "GET",
+        ...encodingOffsets: (string | Buffer | number)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    bitfield_ro(...args: [
+        key: RedisKey,
+        encodingOffsetToken: "GET",
+        ...encodingOffsets: (string | Buffer | number)[]
+    ]): Result<unknown[], Context>;
+    /**
+     * Perform bitwise operations between strings
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.6.0
+     */
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    bitop(...args: [operation: string | Buffer, destkey: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Find first bit set or clear in a string
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.8.7
+     */
+    bitpos(key: RedisKey, bit: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, byte: "BYTE", callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, bit1: "BIT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it; or block until one is available
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    blmove(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Pop elements from a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the number of provided keys and M is the number of elements returned.
+     * - _since_: 7.0.0
+     */
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    /**
+     * Remove and get the first element in a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of provided keys.
+     * - _since_: 2.0.0
+     */
+    blpop(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [...keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    /**
+     * Remove and get the last element in a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of provided keys.
+     * - _since_: 2.0.0
+     */
+    brpop(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [...keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it; or block until one is available
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    brpoplpush(source: RedisKey, destination: RedisKey, timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    brpoplpushBuffer(source: RedisKey, destination: RedisKey, timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Remove and return members with scores in a sorted set or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 7.0.0
+     */
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    /**
+     * Remove and return the member with the highest score from one or more sorted sets, or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 5.0.0
+     */
+    bzpopmax(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    /**
+     * Remove and return the member with the lowest score from one or more sorted sets, or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 5.0.0
+     */
+    bzpopmin(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    /**
+     * Instruct the server about tracking or not keys in the next request
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    client(subcommand: "CACHING", yes: "YES", callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "CACHING", no: "NO", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get the current connection name
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.6.9
+     */
+    client(subcommand: "GETNAME", callback?: Callback<string | null>): Result<string | null, Context>;
+    clientBuffer(subcommand: "GETNAME", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get tracking notifications redirection client ID if any
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    client(subcommand: "GETREDIR", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Returns the client ID for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "ID", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns information about the current client connection.
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "INFO", callback?: Callback<string>): Result<string, Context>;
+    clientBuffer(subcommand: "INFO", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Kill the connection of a client
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of client connections
+     * - _since_: 2.4.0
+     */
+    client(...args: [
+        subcommand: "KILL",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [subcommand: "KILL", ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Get the list of client connections
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of client connections
+     * - _since_: 2.4.0
+     */
+    client(subcommand: "LIST", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", normal: "NORMAL", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        normal: "NORMAL",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        normal: "NORMAL",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", master: "MASTER", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        master: "MASTER",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        master: "MASTER",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", replica: "REPLICA", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        replica: "REPLICA",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        replica: "REPLICA",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", pubsub: "PUBSUB", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        pubsub: "PUBSUB",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        pubsub: "PUBSUB",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Set client eviction mode for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    client(subcommand: "NO-EVICT", on: "ON", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "NO-EVICT", off: "OFF", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Stop processing commands from clients for some time
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.9.50
+     */
+    client(subcommand: "PAUSE", timeout: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "PAUSE", timeout: number | string, write: "WRITE", callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "PAUSE", timeout: number | string, all: "ALL", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Instruct the server whether to reply to commands
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    client(subcommand: "REPLY", on: "ON", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "REPLY", off: "OFF", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "REPLY", skip: "SKIP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set the current connection name
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.6.9
+     */
+    client(subcommand: "SETNAME", connectionName: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Enable or disable server assisted client side caching support
+     * - _group_: connection
+     * - _complexity_: O(1). Some options may introduce additional complexity.
+     * - _since_: 6.0.0
+     */
+    client(...args: [
+        subcommand: "TRACKING",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [subcommand: "TRACKING", ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Return information about server assisted client side caching for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "TRACKINGINFO", callback?: Callback<string>): Result<string, Context>;
+    clientBuffer(subcommand: "TRACKINGINFO", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Unblock a client blocked in a blocking command from a different connection
+     * - _group_: connection
+     * - _complexity_: O(log N) where N is the number of client connections
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "UNBLOCK", clientId: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "UNBLOCK", clientId: number | string, timeout: "TIMEOUT", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "UNBLOCK", clientId: number | string, error: "ERROR", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Resume processing of clients that were paused
+     * - _group_: connection
+     * - _complexity_: O(N) Where N is the number of paused clients
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "UNPAUSE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Assign new hash slots to receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of hash slot arguments
+     * - _since_: 3.0.0
+     */
+    cluster(...args: [
+        subcommand: "ADDSLOTS",
+        ...slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "ADDSLOTS",
+        slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "ADDSLOTS", ...slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "ADDSLOTS", slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Assign new hash slots to receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of the slots between the start slot and end slot arguments.
+     * - _since_: 7.0.0
+     */
+    cluster(...args: [
+        subcommand: "ADDSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "ADDSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[]
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Advance the cluster config epoch
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "BUMPEPOCH", callback?: Callback<"BUMPED" | "STILL">): Result<"BUMPED" | "STILL", Context>;
+    /**
+     * Return the number of failure reports active for a given node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of failure reports
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "COUNT-FAILURE-REPORTS", nodeId: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the number of local keys in the specified hash slot
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "COUNTKEYSINSLOT", slot: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set hash slots as unbound in receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of hash slot arguments
+     * - _since_: 3.0.0
+     */
+    cluster(...args: [
+        subcommand: "DELSLOTS",
+        ...slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "DELSLOTS",
+        slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "DELSLOTS", ...slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "DELSLOTS", slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Set hash slots as unbound in receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of the slots between the start slot and end slot arguments.
+     * - _since_: 7.0.0
+     */
+    cluster(...args: [
+        subcommand: "DELSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "DELSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[]
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Forces a replica to perform a manual failover of its master.
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FAILOVER", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "FAILOVER", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "FAILOVER", takeover: "TAKEOVER", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Delete a node's own slots information
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FLUSHSLOTS", callback?: Callback<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [
+            host: string,
+            port: number,
+            nodeId: string,
+            info: unknown[]
+        ][]
+    ][]>): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Remove a node from the nodes table
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FORGET", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return local key names in the specified hash slot
+     * - _group_: cluster
+     * - _complexity_: O(log(N)) where N is the number of requested keys
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "GETKEYSINSLOT", slot: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    cluster(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Provides info about Redis Cluster node state
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "INFO", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Returns the hash slot of the specified key
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of bytes in the key
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "KEYSLOT", key: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns a list of all TCP links to and from peer nodes in cluster
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 7.0.0
+     */
+    cluster(subcommand: "LINKS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Force a node cluster to handshake with another node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "MEET", ip: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return the node id
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "MYID", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Get Cluster config for the node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "NODES", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List replica nodes of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    cluster(subcommand: "REPLICAS", nodeId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Reconfigure a node as a replica of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "REPLICATE", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Reset a Redis Cluster node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of known nodes. The command may execute a FLUSHALL as a side effect.
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "RESET", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "RESET", hard: "HARD", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "RESET", soft: "SOFT", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Forces the node to save cluster state on disk
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SAVECONFIG", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the configuration epoch in a new node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SET-CONFIG-EPOCH", configEpoch: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Bind a hash slot to a specific node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "IMPORTING", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "MIGRATING", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "NODE", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, stable: "STABLE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get array of cluster slots to node mappings
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of cluster nodes
+     * - _since_: 7.0.0
+     */
+    cluster(subcommand: "SHARDS", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List replica nodes of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SLAVES", nodeId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get array of Cluster slot to node mappings
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SLOTS", callback?: Callback<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [
+            host: string,
+            port: number,
+            nodeId: string,
+            info: unknown[]
+        ][]
+    ][]>): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Get total number of Redis commands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "COUNT", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get array of specific Redis command documentation
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands to look up
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "DOCS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(...args: [
+        subcommand: "DOCS",
+        ...commandNames: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    command(...args: [subcommand: "DOCS", ...commandNames: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Extract keys given a full Redis command
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of arguments to the command
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "GETKEYS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Extract keys and access flags given a full Redis command
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of arguments to the command
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "GETKEYSANDFLAGS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    command(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get array of specific Redis command details, or all when no argument is given.
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands to look up
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "INFO", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(...args: [
+        subcommand: "INFO",
+        ...commandNames: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    command(...args: [subcommand: "INFO", ...commandNames: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Get an array of Redis command names
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of Redis commands
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "LIST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", moduleNameToken: "MODULE", moduleName: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", categoryToken: "ACLCAT", category: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", patternToken: "PATTERN", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the values of configuration parameters
+     * - _group_: server
+     * - _complexity_: O(N) when N is the number of configuration parameters provided
+     * - _since_: 2.0.0
+     */
+    config(...args: [
+        subcommand: "GET",
+        ...parameters: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    config(...args: [subcommand: "GET", ...parameters: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    config(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Reset the stats returned by INFO
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    config(subcommand: "RESETSTAT", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Rewrite the configuration file with the in memory configuration
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.0
+     */
+    config(subcommand: "REWRITE", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set configuration parameters to the given values
+     * - _group_: server
+     * - _complexity_: O(N) when N is the number of configuration parameters provided
+     * - _since_: 2.0.0
+     */
+    config(...args: [
+        subcommand: "SET",
+        ...parameterValues: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    config(...args: [
+        subcommand: "SET",
+        ...parameterValues: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Copy a key
+     * - _group_: generic
+     * - _complexity_: O(N) worst case for collections, where N is the number of nested items. O(1) for string values.
+     * - _since_: 6.2.0
+     */
+    copy(source: RedisKey, destination: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, replace: "REPLACE", callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, destinationDbToken: "DB", destinationDb: number | string, callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, destinationDbToken: "DB", destinationDb: number | string, replace: "REPLACE", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the number of keys in the selected database
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    dbsize(callback?: Callback<number>): Result<number, Context>;
+    /**
+     * A container for debugging commands
+     * - _group_: server
+     * - _complexity_: Depends on subcommand.
+     * - _since_: 1.0.0
+     */
+    debug(subcommand: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    debug(...args: [
+        subcommand: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    debug(...args: [subcommand: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    /**
+     * Decrement the integer value of a key by one
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    decr(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Decrement the integer value of a key by the given number
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    decrby(key: RedisKey, decrement: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Delete a key
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys that will be removed. When a key to remove holds a value other than a string, the individual complexity for this key is O(M) where M is the number of elements in the list, set, sorted set or hash. Removing a single key that holds a string value is O(1).
+     * - _since_: 1.0.0
+     */
+    del(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    del(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    del(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    del(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Discard all commands issued after MULTI
+     * - _group_: transactions
+     * - _complexity_: O(N), when N is the number of queued commands
+     * - _since_: 2.0.0
+     */
+    discard(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return a serialized version of the value stored at the specified key.
+     * - _group_: generic
+     * - _complexity_: O(1) to access the key and additional O(N*M) to serialize it, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1).
+     * - _since_: 2.6.0
+     */
+    dump(key: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    dumpBuffer(key: RedisKey, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Echo the given string
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    echo(message: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    echoBuffer(message: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Execute a Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 2.6.0
+     */
+    eval(script: string | Buffer, numkeys: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a read-only Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 7.0.0
+     */
+    eval_ro(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval_ro(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 2.6.0
+     */
+    evalsha(sha1: string | Buffer, numkeys: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    evalsha(...args: [sha1: string | Buffer, numkeys: number | string, keys: RedisKey[]]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a read-only Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 7.0.0
+     */
+    evalsha_ro(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha_ro(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute all commands issued after MULTI
+     * - _group_: transactions
+     * - _complexity_: Depends on commands in the transaction
+     * - _since_: 1.2.0
+     */
+    exec(callback?: Callback<[error: Error | null, result: unknown][] | null>): Promise<[error: Error | null, result: unknown][] | null>;
+    /**
+     * Determine if a key exists
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys to check.
+     * - _since_: 1.0.0
+     */
+    exists(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    exists(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    exists(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    exists(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Set a key's time to live in seconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    expire(key: RedisKey, seconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the expiration for a key as a UNIX timestamp
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    expireat(key: RedisKey, unixTimeSeconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the expiration Unix timestamp for a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    expiretime(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Start a coordinated failover between this server and one of its replicas.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    failover(callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Invoke a function
+     * - _group_: scripting
+     * - _complexity_: Depends on the function that is executed.
+     * - _since_: 7.0.0
+     */
+    fcall(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    fcall(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Invoke a read-only function
+     * - _group_: scripting
+     * - _complexity_: Depends on the function that is executed.
+     * - _since_: 7.0.0
+     */
+    fcall_ro(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    fcall_ro(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Remove all keys from all databases
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of keys in all databases
+     * - _since_: 1.0.0
+     */
+    flushall(callback?: Callback<"OK">): Result<"OK", Context>;
+    flushall(async: "ASYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    flushall(sync: "SYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Remove all keys from the current database
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of keys in the selected database
+     * - _since_: 1.0.0
+     */
+    flushdb(callback?: Callback<"OK">): Result<"OK", Context>;
+    flushdb(async: "ASYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    flushdb(sync: "SYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Delete a function by name
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "DELETE", libraryName: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "DELETE", libraryName: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Dump all functions into a serialized binary payload
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "DUMP", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "DUMP", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Deleting all functions
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions deleted
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "FLUSH", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Kill the function currently in execution.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "KILL", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "KILL", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * List information about all the functions
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "LIST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", withcode: "WITHCODE", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", libraryNamePatternToken: "LIBRARYNAME", libraryNamePattern: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", libraryNamePatternToken: "LIBRARYNAME", libraryNamePattern: string | Buffer, withcode: "WITHCODE", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Create a function with the given arguments (name, code, description)
+     * - _group_: scripting
+     * - _complexity_: O(1) (considering compilation time is redundant)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "LOAD", functionCode: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "LOAD", functionCode: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "LOAD", replace: "REPLACE", functionCode: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "LOAD", replace: "REPLACE", functionCode: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Restore all the functions on the given payload
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions on the payload
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, flush: "FLUSH", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, flush: "FLUSH", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, append: "APPEND", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, append: "APPEND", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Return information about the function currently running (name, description, duration)
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "STATS", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Add one or more geospatial items in the geospatial index represented using a sorted set
+     * - _group_: geo
+     * - _complexity_: O(log(N)) for each item added, where N is the number of elements in the sorted set.
+     * - _since_: 3.2.0
+     */
+    geoadd(...args: [
+        key: RedisKey,
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    /**
+     * Returns the distance between two members of a geospatial index
+     * - _group_: geo
+     * - _complexity_: O(log(N))
+     * - _since_: 3.2.0
+     */
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, m: "M", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, m: "M", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, km: "KM", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, km: "KM", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, ft: "FT", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, ft: "FT", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, mi: "MI", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, mi: "MI", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Returns members of a geospatial index as standard geohash strings
+     * - _group_: geo
+     * - _complexity_: O(log(N)) for each member requested, where N is the number of elements in the sorted set.
+     * - _since_: 3.2.0
+     */
+    geohash(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    geohashBuffer(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    geohash(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    geohashBuffer(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    geohash(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<string[], Context>;
+    geohashBuffer(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<Buffer[], Context>;
+    geohash(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<string[], Context>;
+    geohashBuffer(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<Buffer[], Context>;
+    /**
+     * Returns longitude and latitude of members of a geospatial index
+     * - _group_: geo
+     * - _complexity_: O(N) where N is the number of members requested.
+     * - _since_: 3.2.0
+     */
+    geopos(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<([longitude: string, latitude: string] | null)[]>
+    ]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<([longitude: string, latitude: string] | null)[]>
+    ]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.0
+     */
+    georadius(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    georadius(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    /**
+     * A read-only variant for GEORADIUS
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.10
+     */
+    georadius_ro(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadius_ro(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.0
+     */
+    georadiusbymember(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadiusbymember(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * A read-only variant for GEORADIUSBYMEMBER
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.10
+     */
+    georadiusbymember_ro(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadiusbymember_ro(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle.
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape
+     * - _since_: 6.2.0
+     */
+    geosearch(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    geosearch(...args: [key: RedisKey, ...args: RedisValue[]]): Result<unknown[], Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle, and store the result in another key.
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape
+     * - _since_: 6.2.0
+     */
+    geosearchstore(...args: [
+        destination: RedisKey,
+        source: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geosearchstore(...args: [destination: RedisKey, source: RedisKey, ...args: RedisValue[]]): Result<number, Context>;
+    /**
+     * Get the value of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    get(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Returns the bit value at offset in the string value stored at key
+     * - _group_: bitmap
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    getbit(key: RedisKey, offset: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the value of a key and delete the key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    getdel(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getdelBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get the value of a key and optionally set its expiration
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    getex(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, secondsToken: "EX", seconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, secondsToken: "EX", seconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, persist: "PERSIST", callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, persist: "PERSIST", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get a substring of the string stored at a key
+     * - _group_: string
+     * - _complexity_: O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.
+     * - _since_: 2.4.0
+     */
+    getrange(key: RedisKey, start: number | string, end: number | string, callback?: Callback<string>): Result<string, Context>;
+    getrangeBuffer(key: RedisKey, start: number | string, end: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Set the string value of a key and return its old value
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    getset(key: RedisKey, value: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    getsetBuffer(key: RedisKey, value: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Delete one or more hash fields
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields to be removed.
+     * - _since_: 2.0.0
+     */
+    hdel(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    hdel(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Handshake with Redis
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    hello(callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, clientnameToken: "SETNAME", clientname: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, usernamePasswordToken: "AUTH", username: string | Buffer, password: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, usernamePasswordToken: "AUTH", username: string | Buffer, password: string | Buffer, clientnameToken: "SETNAME", clientname: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Determine if a hash field exists
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hexists(key: RedisKey, field: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set expiry for hash field using relative time to expire (seconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpire(...args: [key: RedisKey, seconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using an absolute Unix timestamp (seconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the expiration time of a hash field as a Unix timestamp, in seconds.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpiretime(...args: [key: RedisKey, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpiretime(...args: [key: RedisKey, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get the value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hget(key: RedisKey, field: string | Buffer, callback?: Callback<string | null>): Result<string | null, Context>;
+    hgetBuffer(key: RedisKey, field: string | Buffer, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get all the fields and values in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hgetall(key: RedisKey, callback?: Callback<Record<string, string>>): Result<Record<string, string>, Context>;
+    hgetallBuffer(key: RedisKey, callback?: Callback<Record<string, Buffer>>): Result<Record<string, Buffer>, Context>;
+    /**
+     * Returns the value of a field and deletes it from the hash.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 8.0.0
+     */
+    hgetdel(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetdelBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetdel(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetdelBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Get the value of one or more fields of a given hash key, and optionally set their expiration.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 8.0.0
+     */
+    hgetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Increment the integer value of a hash field by the given number
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hincrby(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the float value of a hash field by the given amount
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    hincrbyfloat(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<string>): Result<string, Context>;
+    hincrbyfloatBuffer(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Get all the fields in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hkeys(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    hkeysBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get the number of fields in a hash
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the values of all the given hash fields
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being requested.
+     * - _since_: 2.0.0
+     */
+    hmget(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    hmgetBuffer(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    hmget(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hmgetBuffer(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Set multiple hash fields to multiple values
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being set.
+     * - _since_: 2.0.0
+     */
+    hmset(key: RedisKey, object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    hmset(key: RedisKey, map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    hmset(...args: [
+        key: RedisKey,
+        ...fieldValues: (string | Buffer | number)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    hmset(...args: [key: RedisKey, ...fieldValues: (string | Buffer | number)[]]): Result<"OK", Context>;
+    /**
+     * Removes the expiration time for each specified field
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpersist(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpersist(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using relative time to expire (milliseconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using an absolute Unix timestamp (milliseconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the expiration time of a hash field as a Unix timestamp, in msec.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpiretime(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpiretime(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the TTL in milliseconds of a hash field.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpttl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpttl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get one or multiple random fields from a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields returned
+     * - _since_: 6.2.0
+     */
+    hrandfield(key: RedisKey, callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    hrandfield(key: RedisKey, count: number | string, callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    hrandfield(key: RedisKey, count: number | string, withvalues: "WITHVALUES", callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, count: number | string, withvalues: "WITHVALUES", callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    /**
+     * Incrementally iterate hash fields and associated values
+     * - _group_: hash
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    hscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Set the string value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1) for each field/value pair added, so O(N) to add N field/value pairs when the command is called with multiple field/value pairs.
+     * - _since_: 2.0.0
+     */
+    hset(key: RedisKey, object: object, callback?: Callback<number>): Result<number, Context>;
+    hset(key: RedisKey, map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<number>): Result<number, Context>;
+    hset(...args: [
+        key: RedisKey,
+        ...fieldValues: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    hset(...args: [key: RedisKey, ...fieldValues: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Set the value of one or more fields of a given hash key, and optionally set their expiration.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being set.
+     * - _since_: 8.0.0
+     */
+    hsetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Set the value of a hash field, only if the field does not exist
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hsetnx(key: RedisKey, field: string | Buffer, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the length of the value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    hstrlen(key: RedisKey, field: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns the TTL in seconds of a hash field.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    httl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    httl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get all the values in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hvals(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    hvalsBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Increment the integer value of a key by one
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    incr(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the integer value of a key by the given amount
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    incrby(key: RedisKey, increment: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the float value of a key by the given amount
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    incrbyfloat(key: RedisKey, increment: number | string, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Get information and statistics about the server
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    info(callback?: Callback<string>): Result<string, Context>;
+    info(...args: [...sections: (string | Buffer)[], callback: Callback<string>]): Result<string, Context>;
+    info(...args: [...sections: (string | Buffer)[]]): Result<string, Context>;
+    /**
+     * Find all keys matching the given pattern
+     * - _group_: generic
+     * - _complexity_: O(N) with N being the number of keys in the database, under the assumption that the key names in the database and the given pattern have limited length.
+     * - _since_: 1.0.0
+     */
+    keys(pattern: string, callback?: Callback<string[]>): Result<string[], Context>;
+    keysBuffer(pattern: string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get the UNIX time stamp of the last successful save to disk
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    lastsave(callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return a human readable latency analysis report.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "DOCTOR", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Return a latency graph for the event.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "GRAPH", event: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Show helpful text about the different subcommands.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return the cumulative distribution of latencies of a subset of commands or all.
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands with latency information being retrieved.
+     * - _since_: 7.0.0
+     */
+    latency(subcommand: "HISTOGRAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    latency(...args: [
+        subcommand: "HISTOGRAM",
+        ...commands: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    latency(...args: [subcommand: "HISTOGRAM", ...commands: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Return timestamp-latency samples for the event.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "HISTORY", event: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return the latest latency samples for all events.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "LATEST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Reset latency data for one or more events.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "RESET", callback?: Callback<number>): Result<number, Context>;
+    latency(...args: [
+        subcommand: "RESET",
+        ...events: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    latency(...args: [subcommand: "RESET", ...events: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Find longest common substring
+     * - _group_: string
+     * - _complexity_: O(N*M) where N and M are the lengths of s1 and s2, respectively
+     * - _since_: 7.0.0
+     */
+    lcs(key1: RedisKey, key2: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, lenToken: "MINMATCHLEN", len: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, lenToken: "MINMATCHLEN", len: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", lenToken: "MINMATCHLEN", len: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", lenToken: "MINMATCHLEN", len: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", lenToken: "MINMATCHLEN", len1: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", lenToken: "MINMATCHLEN", len1: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", lenToken: "MINMATCHLEN", len1: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", lenToken: "MINMATCHLEN", len1: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get an element from a list by its index
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to traverse to get to the element at index. This makes asking for the first or the last element of the list O(1).
+     * - _since_: 1.0.0
+     */
+    lindex(key: RedisKey, index: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    lindexBuffer(key: RedisKey, index: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Insert an element before or after another element in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to traverse before seeing the value pivot. This means that inserting somewhere on the left end on the list (head) can be considered O(1) and inserting somewhere on the right end (tail) is O(N).
+     * - _since_: 2.2.0
+     */
+    linsert(key: RedisKey, before: "BEFORE", pivot: string | Buffer | number, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    linsert(key: RedisKey, after: "AFTER", pivot: string | Buffer | number, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the length of a list
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    llen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    lmove(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Pop elements from a list
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the number of provided keys and M is the number of elements returned.
+     * - _since_: 7.0.0
+     */
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, ...keys: RedisKey[], left: "LEFT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, ...keys: RedisKey[], left: "LEFT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, keys: RedisKey[], left: "LEFT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, keys: RedisKey[], left: "LEFT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, ...keys: RedisKey[], right: "RIGHT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, ...keys: RedisKey[], right: "RIGHT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, keys: RedisKey[], right: "RIGHT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, keys: RedisKey[], right: "RIGHT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    /**
+     * Display some computer art and the Redis version
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 5.0.0
+     */
+    lolwut(callback?: Callback<string>): Result<string, Context>;
+    lolwut(versionToken: "VERSION", version: number | string, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Remove and get the first elements in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 1.0.0
+     */
+    lpop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    lpopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    lpop(key: RedisKey, count: number | string, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    lpopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Return the index of matching elements on a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements in the list, for the average case. When searching for elements near the head or the tail of the list, or when the MAXLEN option is provided, the command may run in constant time.
+     * - _since_: 6.0.6
+     */
+    lpos(key: RedisKey, element: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, lenToken: "MAXLEN", len: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, numMatchesToken: "COUNT", numMatches: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, numMatchesToken: "COUNT", numMatches: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, numMatchesToken: "COUNT", numMatches: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, numMatchesToken: "COUNT", numMatches: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    /**
+     * Prepend one or multiple elements to a list
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    lpush(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    lpush(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Prepend an element to a list, only if the list exists
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 2.2.0
+     */
+    lpushx(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    lpushx(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Get a range of elements from a list
+     * - _group_: list
+     * - _complexity_: O(S+N) where S is the distance of start offset from HEAD for small lists, from nearest end (HEAD or TAIL) for large lists; and N is the number of elements in the specified range.
+     * - _since_: 1.0.0
+     */
+    lrange(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    lrangeBuffer(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove elements from a list
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the length of the list and M is the number of elements removed.
+     * - _since_: 1.0.0
+     */
+    lrem(key: RedisKey, count: number | string, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the value of an element in a list by its index
+     * - _group_: list
+     * - _complexity_: O(N) where N is the length of the list. Setting either the first or the last element of the list is O(1).
+     * - _since_: 1.0.0
+     */
+    lset(key: RedisKey, index: number | string, element: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Trim a list to the specified range
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to be removed by the operation.
+     * - _since_: 1.0.0
+     */
+    ltrim(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Outputs memory problems report
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "DOCTOR", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show allocator internal stats
+     * - _group_: server
+     * - _complexity_: Depends on how much memory is allocated, could be slow
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "MALLOC-STATS", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Ask the allocator to release memory
+     * - _group_: server
+     * - _complexity_: Depends on how much memory is allocated, could be slow
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "PURGE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Show memory usage details
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "STATS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Estimate the memory usage of a key
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of samples.
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "USAGE", key: RedisKey, callback?: Callback<number | null>): Result<number | null, Context>;
+    memory(subcommand: "USAGE", key: RedisKey, countToken: "SAMPLES", count: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Get the values of all the given keys
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to retrieve.
+     * - _since_: 1.0.0
+     */
+    mget(...args: [...keys: RedisKey[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [...keys: RedisKey[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    mget(...args: [keys: RedisKey[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [keys: RedisKey[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    mget(...args: [...keys: RedisKey[]]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [...keys: RedisKey[]]): Result<(Buffer | null)[], Context>;
+    mget(...args: [keys: RedisKey[]]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [keys: RedisKey[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Atomically transfer a key from a Redis instance to another one.
+     * - _group_: generic
+     * - _complexity_: This command actually executes a DUMP+DEL in the source instance, and a RESTORE in the target instance. See the pages of these commands for time complexity. Also an O(N) data transfer between the two instances is performed.
+     * - _since_: 2.6.0
+     */
+    migrate(...args: [
+        host: string | Buffer,
+        port: number | string,
+        ...args: RedisValue[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    migrate(...args: [
+        host: string | Buffer,
+        port: number | string,
+        ...args: RedisValue[]
+    ]): Result<"OK", Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    module(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List all modules loaded by the server
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of loaded modules.
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "LIST", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Load a module
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "LOAD", path: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOAD",
+        path: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOAD",
+        path: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Load a module with extended parameters
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    module(subcommand: "LOADEX", path: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        argsToken: "ARGS",
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        argsToken: "ARGS",
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...configs: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...configs: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Unload a module
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "UNLOAD", name: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Move a key to another database
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    move(key: RedisKey, db: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set multiple keys to multiple values
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to set.
+     * - _since_: 1.0.1
+     */
+    mset(object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    mset(map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    mset(...args: [
+        ...keyValues: (RedisKey | string | Buffer | number)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    mset(...args: [...keyValues: (RedisKey | string | Buffer | number)[]]): Result<"OK", Context>;
+    /**
+     * Set multiple keys to multiple values, only if none of the keys exist
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to set.
+     * - _since_: 1.0.1
+     */
+    msetnx(object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    msetnx(map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    msetnx(...args: [
+        ...keyValues: (RedisKey | string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    msetnx(...args: [...keyValues: (RedisKey | string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Inspect the internal encoding of a Redis object
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "ENCODING", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the logarithmic access frequency counter of a Redis object
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    object(subcommand: "FREQ", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    object(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the time since a Redis object was last accessed
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "IDLETIME", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the number of references to the value of the key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "REFCOUNT", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Remove the expiration from a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    persist(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set a key's time to live in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pexpire(key: RedisKey, milliseconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the expiration for a key as a UNIX timestamp specified in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the expiration Unix timestamp for a key in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    pexpiretime(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Adds the specified elements to the specified HyperLogLog.
+     * - _group_: hyperloglog
+     * - _complexity_: O(1) to add every element.
+     * - _since_: 2.8.9
+     */
+    pfadd(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    pfadd(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    pfadd(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).
+     * - _group_: hyperloglog
+     * - _complexity_: O(1) with a very small average constant time when called with a single key. O(N) with N being the number of keys, and much bigger constant times, when called with multiple keys.
+     * - _since_: 2.8.9
+     */
+    pfcount(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    pfcount(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    pfcount(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    pfcount(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Internal commands for debugging HyperLogLog values
+     * - _group_: hyperloglog
+     * - _complexity_: N/A
+     * - _since_: 2.8.9
+     */
+    pfdebug(subcommand: string | Buffer, key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Merge N different HyperLogLogs into a single one.
+     * - _group_: hyperloglog
+     * - _complexity_: O(N) to merge N HyperLogLogs, but with high constant times.
+     * - _since_: 2.8.9
+     */
+    pfmerge(...args: [
+        destkey: RedisKey,
+        ...sourcekeys: RedisKey[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    pfmerge(...args: [
+        destkey: RedisKey,
+        sourcekeys: RedisKey[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    pfmerge(...args: [destkey: RedisKey, ...sourcekeys: RedisKey[]]): Result<"OK", Context>;
+    pfmerge(...args: [destkey: RedisKey, sourcekeys: RedisKey[]]): Result<"OK", Context>;
+    /**
+     * An internal command for testing HyperLogLog values
+     * - _group_: hyperloglog
+     * - _complexity_: N/A
+     * - _since_: 2.8.9
+     */
+    pfselftest(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Ping the server
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    ping(callback?: Callback<"PONG">): Result<"PONG", Context>;
+    ping(message: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    pingBuffer(message: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Set the value and expiration in milliseconds of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    psetex(key: RedisKey, milliseconds: number | string, value: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Listen for messages published to channels matching the given patterns
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of patterns the client is already subscribed to.
+     * - _since_: 2.0.0
+     */
+    psubscribe(...args: [...patterns: string[], callback: Callback<unknown>]): Result<unknown, Context>;
+    psubscribe(...args: [...patterns: string[]]): Result<unknown, Context>;
+    /**
+     * Internal command used for replication
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 2.8.0
+     */
+    psync(replicationid: string | Buffer | number, offset: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the time to live for a key in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pttl(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Post a message to a channel
+     * - _group_: pubsub
+     * - _complexity_: O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
+     * - _since_: 2.0.0
+     */
+    publish(channel: string | Buffer, message: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * List active channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of active channels, and assuming constant time pattern matching (relatively short channels and patterns)
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "CHANNELS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(subcommand: "CHANNELS", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: pubsub
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    pubsub(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of unique patterns pattern subscriptions
+     * - _group_: pubsub
+     * - _complexity_: O(1)
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "NUMPAT", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of subscribers for channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) for the NUMSUB subcommand, where N is the number of requested channels
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "NUMSUB", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(...args: [
+        subcommand: "NUMSUB",
+        ...channels: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    pubsub(...args: [subcommand: "NUMSUB", ...channels: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * List active shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of active shard channels, and assuming constant time pattern matching (relatively short shard channels).
+     * - _since_: 7.0.0
+     */
+    pubsub(subcommand: "SHARDCHANNELS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(subcommand: "SHARDCHANNELS", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of subscribers for shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) for the SHARDNUMSUB subcommand, where N is the number of requested shard channels
+     * - _since_: 7.0.0
+     */
+    pubsub(subcommand: "SHARDNUMSUB", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(...args: [
+        subcommand: "SHARDNUMSUB",
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    pubsub(...args: [subcommand: "SHARDNUMSUB", ...shardchannels: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Stop listening for messages posted to channels matching the given patterns
+     * - _group_: pubsub
+     * - _complexity_: O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).
+     * - _since_: 2.0.0
+     */
+    punsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    punsubscribe(...args: [...patterns: string[], callback: Callback<unknown>]): Result<unknown, Context>;
+    punsubscribe(...args: [...patterns: string[]]): Result<unknown, Context>;
+    /**
+     * Close the connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    quit(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return a random key from the keyspace
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    randomkey(callback?: Callback<string | null>): Result<string | null, Context>;
+    randomkeyBuffer(callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Enables read queries for a connection to a cluster replica node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    readonly(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Disables read queries for a connection to a cluster replica node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    readwrite(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Rename a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    rename(key: RedisKey, newkey: RedisKey, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Rename a key, only if the new key does not exist
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    renamenx(key: RedisKey, newkey: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * An internal command for configuring the replication stream
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    replconf(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Make the server a replica of another instance, or promote it as master.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    replicaof(host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Reset the connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    reset(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Create a key using the provided serialized value, previously obtained using DUMP.
+     * - _group_: generic
+     * - _complexity_: O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).
+     * - _since_: 2.6.0
+     */
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * An internal command for migrating keys in a cluster
+     * - _group_: server
+     * - _complexity_: O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).
+     * - _since_: 3.0.0
+     */
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the role of the instance in the context of replication
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.12
+     */
+    role(callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Remove and get the last elements in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 1.0.0
+     */
+    rpop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    rpopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    rpop(key: RedisKey, count: number | string, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    rpopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Remove the last element in a list, prepend it to another list and return it
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    rpoplpush(source: RedisKey, destination: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    rpoplpushBuffer(source: RedisKey, destination: RedisKey, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Append one or multiple elements to a list
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    rpush(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    rpush(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Append an element to a list, only if the list exists
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 2.2.0
+     */
+    rpushx(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    rpushx(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Add one or more members to a set
+     * - _group_: set
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    sadd(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sadd(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sadd(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    sadd(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Synchronously save the dataset to disk
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of keys in all databases
+     * - _since_: 1.0.0
+     */
+    save(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Incrementally iterate the keys space
+     * - _group_: generic
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection.
+     * - _since_: 2.8.0
+     */
+    scan(cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Get the number of members in a set
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    scard(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the debug mode for executed scripts.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    script(subcommand: "DEBUG", yes: "YES", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "DEBUG", sync: "SYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "DEBUG", no: "NO", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Check existence of scripts in the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the number of scripts to check (so checking a single script is an O(1) operation).
+     * - _since_: 2.6.0
+     */
+    script(...args: [
+        subcommand: "EXISTS",
+        ...sha1s: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    script(...args: [subcommand: "EXISTS", ...sha1s: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Remove all the scripts from the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the number of scripts in cache
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "FLUSH", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    script(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Kill the script currently in execution.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "KILL", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Load the specified Lua script into the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the length in bytes of the script body.
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "LOAD", script: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Subtract multiple sets
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sdiff(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sdiffBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sdiff(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sdiffBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sdiff(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sdiffBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sdiff(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sdiffBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Subtract multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sdiffstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sdiffstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sdiffstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sdiffstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Change the selected database for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    select(index: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the string value of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    set(key: RedisKey, value: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Sets or clears the bit at offset in the string value stored at key
+     * - _group_: bitmap
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    setbit(key: RedisKey, offset: number | string, value: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the value and expiration of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    setex(key: RedisKey, seconds: number | string, value: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the value of a key, only if the key does not exist
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    setnx(key: RedisKey, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Overwrite part of a string at key starting at the specified offset
+     * - _group_: string
+     * - _complexity_: O(1), not counting the time taken to copy the new string in place. Usually, this string is very small so the amortized complexity is O(1). Otherwise, complexity is O(M) with M being the length of the value argument.
+     * - _since_: 2.2.0
+     */
+    setrange(key: RedisKey, offset: number | string, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Synchronously save the dataset to disk and then shut down the server
+     * - _group_: server
+     * - _complexity_: O(N) when saving, where N is the total number of keys in all databases when saving data, otherwise O(1)
+     * - _since_: 1.0.0
+     */
+    shutdown(callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Intersect multiple sets
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 1.0.0
+     */
+    sinter(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sinterBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sinter(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sinterBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sinter(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sinterBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sinter(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sinterBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Intersect multiple sets and return the cardinality of the result
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 7.0.0
+     */
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<number, Context>;
+    sintercard(...args: [numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    /**
+     * Intersect multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 1.0.0
+     */
+    sinterstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sinterstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sinterstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sinterstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Determine if a given value is a member of a set
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    sismember(key: RedisKey, member: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Make the server a replica of another instance, or promote it as master.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    slaveof(host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get the slow log's entries
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of entries returned
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "GET", callback?: Callback<unknown>): Result<unknown, Context>;
+    slowlog(subcommand: "GET", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    slowlog(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the slow log's length
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "LEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Clear all entries from the slow log
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of entries in the slowlog
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "RESET", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get all the members in a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the set cardinality.
+     * - _since_: 1.0.0
+     */
+    smembers(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    smembersBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Returns the membership associated with the given elements for a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the number of elements being checked for membership
+     * - _since_: 6.2.0
+     */
+    smismember(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number[]>
+    ]): Result<number[], Context>;
+    smismember(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number[]>
+    ]): Result<number[], Context>;
+    smismember(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number[], Context>;
+    smismember(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number[], Context>;
+    /**
+     * Move a member from one set to another
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    smove(source: RedisKey, destination: RedisKey, member: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Sort the elements in a list, set or sorted set
+     * - _group_: generic
+     * - _complexity_: O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is O(N).
+     * - _since_: 1.0.0
+     */
+    sort(...args: [key: RedisKey, ...args: RedisValue[], callback: Callback<unknown>]): Result<unknown, Context>;
+    sort(...args: [key: RedisKey, ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Sort the elements in a list, set or sorted set. Read-only variant of SORT.
+     * - _group_: generic
+     * - _complexity_: O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is O(N).
+     * - _since_: 7.0.0
+     */
+    sort_ro(key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [key: RedisKey, patternToken: "GET", ...patterns: string[]]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    /**
+     * Remove and return one or multiple random members from a set
+     * - _group_: set
+     * - _complexity_: Without the count argument O(1), otherwise O(N) where N is the value of the passed count.
+     * - _since_: 1.0.0
+     */
+    spop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    spopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    spop(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    spopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Post a message to a shard channel
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients subscribed to the receiving shard channel.
+     * - _since_: 7.0.0
+     */
+    spublish(shardchannel: string | Buffer, message: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get one or multiple random members from a set
+     * - _group_: set
+     * - _complexity_: Without the count argument O(1), otherwise O(N) where N is the absolute value of the passed count.
+     * - _since_: 1.0.0
+     */
+    srandmember(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    srandmemberBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    srandmember(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    srandmemberBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove one or more members from a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the number of members to be removed.
+     * - _since_: 1.0.0
+     */
+    srem(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    srem(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    srem(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    srem(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Incrementally iterate Set elements
+     * - _group_: set
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    sscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Listen for messages published to the given shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of shard channels to subscribe to.
+     * - _since_: 7.0.0
+     */
+    ssubscribe(...args: [
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    ssubscribe(...args: [...shardchannels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Get the length of the value stored in a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    strlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Listen for messages published to the given channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of channels to subscribe to.
+     * - _since_: 2.0.0
+     */
+    subscribe(...args: [...channels: (string | Buffer)[], callback: Callback<unknown>]): Result<unknown, Context>;
+    subscribe(...args: [...channels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Get a substring of the string stored at a key
+     * - _group_: string
+     * - _complexity_: O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.
+     * - _since_: 1.0.0
+     */
+    substr(key: RedisKey, start: number | string, end: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Add multiple sets
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sunion(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sunionBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sunion(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sunionBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sunion(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sunionBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sunion(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sunionBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Add multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sunionstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sunionstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sunionstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sunionstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Stop listening for messages posted to the given shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients already subscribed to a shard channel.
+     * - _since_: 7.0.0
+     */
+    sunsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    sunsubscribe(...args: [
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sunsubscribe(...args: [...shardchannels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Swaps two Redis databases
+     * - _group_: server
+     * - _complexity_: O(N) where N is the count of clients watching or blocking on keys from both databases.
+     * - _since_: 4.0.0
+     */
+    swapdb(index1: number | string, index2: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Internal command used for replication
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 1.0.0
+     */
+    sync(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the current server time
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    time(callback?: Callback<number[]>): Result<number[], Context>;
+    /**
+     * Alters the last access time of a key(s). Returns the number of existing keys specified.
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys that will be touched.
+     * - _since_: 3.2.1
+     */
+    touch(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    touch(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    touch(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    touch(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Get the time to live for a key in seconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    ttl(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Determine the type stored at key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    type(key: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Delete a key asynchronously in another thread. Otherwise it is just as DEL, but non blocking.
+     * - _group_: generic
+     * - _complexity_: O(1) for each key removed regardless of its size. Then the command does O(N) work in a different thread in order to reclaim memory, where N is the number of allocations the deleted objects where composed of.
+     * - _since_: 4.0.0
+     */
+    unlink(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    unlink(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    unlink(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    unlink(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Stop listening for messages posted to the given channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients already subscribed to a channel.
+     * - _since_: 2.0.0
+     */
+    unsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    unsubscribe(...args: [...channels: (string | Buffer)[], callback: Callback<unknown>]): Result<unknown, Context>;
+    unsubscribe(...args: [...channels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Forget about all watched keys
+     * - _group_: transactions
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    unwatch(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Wait for the synchronous replication of all the write commands sent in the context of the current connection
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    wait(numreplicas: number | string, timeout: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Watch the given keys to determine execution of the MULTI/EXEC block
+     * - _group_: transactions
+     * - _complexity_: O(1) for every key.
+     * - _since_: 2.2.0
+     */
+    watch(...args: [...keys: RedisKey[], callback: Callback<"OK">]): Result<"OK", Context>;
+    watch(...args: [keys: RedisKey[], callback: Callback<"OK">]): Result<"OK", Context>;
+    watch(...args: [...keys: RedisKey[]]): Result<"OK", Context>;
+    watch(...args: [keys: RedisKey[]]): Result<"OK", Context>;
+    /**
+     * Marks a pending message as correctly processed, effectively removing it from the pending entries list of the consumer group. Return value of the command is the number of messages successfully acknowledged, that is, the IDs we were actually able to resolve in the PEL.
+     * - _group_: stream
+     * - _complexity_: O(1) for each message ID processed.
+     * - _since_: 5.0.0
+     */
+    xack(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    xack(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    /**
+     * Appends a new entry to a stream
+     * - _group_: stream
+     * - _complexity_: O(1) when adding a new entry, O(N) when trimming where N being the number of entries evicted.
+     * - _since_: 5.0.0
+     */
+    xadd(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    xaddBuffer(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    xadd(...args: [key: RedisKey, ...args: RedisValue[]]): Result<string | null, Context>;
+    xaddBuffer(...args: [key: RedisKey, ...args: RedisValue[]]): Result<Buffer | null, Context>;
+    /**
+     * Changes (or acquires) ownership of messages in a consumer group, as if the messages were delivered to the specified consumer.
+     * - _group_: stream
+     * - _complexity_: O(1) if COUNT is small.
+     * - _since_: 6.2.0
+     */
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, justid: "JUSTID", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, justid: "JUSTID", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Changes (or acquires) ownership of a message in a consumer group, as if the message was delivered to the specified consumer.
+     * - _group_: stream
+     * - _complexity_: O(log N) with N being the number of messages in the PEL of the consumer group.
+     * - _since_: 5.0.0
+     */
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    /**
+     * Removes the specified entries from the stream. Returns the number of items actually deleted, that may be different from the number of IDs passed in case certain IDs do not exist.
+     * - _group_: stream
+     * - _complexity_: O(1) for each single item to delete in the stream, regardless of the stream size.
+     * - _since_: 5.0.0
+     */
+    xdel(...args: [
+        key: RedisKey,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    xdel(...args: [key: RedisKey, ...ids: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Deletes one or multiple entries from the stream.
+     * - _group_: stream
+     * - _complexity_: O(1) for each single item to delete in the stream, regardless of the stream size.
+     * - _since_: 8.2.0
+     */
+    xdelex(...args: [
+        key: RedisKey,
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        keepref: "KEEPREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        keepref: "KEEPREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        delref: "DELREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        delref: "DELREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        acked: "ACKED",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        acked: "ACKED",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Create a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, mkstream: "MKSTREAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, mkstream: "MKSTREAM", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", mkstream: "MKSTREAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", mkstream: "MKSTREAM", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Create a consumer in a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    xgroup(subcommand: "CREATECONSUMER", key: RedisKey, groupname: string | Buffer, consumername: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Delete a consumer from a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "DELCONSUMER", key: RedisKey, groupname: string | Buffer, consumername: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Destroy a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(N) where N is the number of entries in the group's pending entries list (PEL).
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "DESTROY", key: RedisKey, groupname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set a consumer group to an arbitrary last delivered ID value.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, newId: "$", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, newId: "$", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the consumers in a consumer group
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "CONSUMERS", key: RedisKey, groupname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the consumer groups of a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "GROUPS", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get information about a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "STREAM", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    xinfo(subcommand: "STREAM", key: RedisKey, fullToken: "FULL", callback?: Callback<unknown>): Result<unknown, Context>;
+    xinfo(subcommand: "STREAM", key: RedisKey, fullToken: "FULL", countToken: "COUNT", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the number of entries in a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return information and entries from a stream consumer group pending entries list, that are messages fetched but never acknowledged.
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements returned, so asking for a small fixed number of entries per call is O(1). O(M), where M is the total number of entries scanned when used with the IDLE filter. When the command returns just the summary and the list of consumers is small, it runs in O(1) time; otherwise, an additional O(N) time for iterating every consumer.
+     * - _since_: 5.0.0
+     */
+    xpending(key: RedisKey, group: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, start: string | Buffer | number, end: string | Buffer | number, count: number | string, consumer: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, minIdleTimeToken: "IDLE", minIdleTime: number | string, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, minIdleTimeToken: "IDLE", minIdleTime: number | string, start: string | Buffer | number, end: string | Buffer | number, count: number | string, consumer: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return a range of elements in a stream, with IDs matching the specified IDs interval
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements being returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).
+     * - _since_: 5.0.0
+     */
+    xrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    xrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    /**
+     * Return never seen elements in multiple streams, with IDs greater than the ones reported by the caller for each stream. Can block.
+     * - _group_: stream
+     * - _complexity_: For each stream mentioned: O(N) with N being the number of elements being returned, it means that XREAD-ing with a fixed COUNT is O(1). Note that when the BLOCK option is used, XADD will pay O(M) time in order to serve the M clients blocked on the stream getting new data.
+     * - _since_: 5.0.0
+     */
+    xread(...args: [
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [streamsToken: "STREAMS", ...args: RedisValue[]]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [streamsToken: "STREAMS", ...args: RedisValue[]]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    /**
+     * Return new entries from a stream using a consumer group, or access the history of the pending entries for a given consumer. Can block.
+     * - _group_: stream
+     * - _complexity_: For each stream mentioned: O(M) with M being the number of elements returned. If M is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1). On the other side when XREADGROUP blocks, XADD will pay the O(N) time in order to serve the N clients blocked on the stream getting new data.
+     * - _since_: 5.0.0
+     */
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    /**
+     * Return a range of elements in a stream, with IDs matching the specified IDs interval, in reverse order (from greater to smaller IDs) compared to XRANGE
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).
+     * - _since_: 5.0.0
+     */
+    xrevrange(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrevrangeBuffer(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    xrevrange(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrevrangeBuffer(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    /**
+     * An internal command for replicating stream values
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xsetid(key: RedisKey, lastId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, maxDeletedEntryIdToken: "MAXDELETEDID", maxDeletedEntryId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, entriesAddedToken: "ENTRIESADDED", entriesAdded: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, entriesAddedToken: "ENTRIESADDED", entriesAdded: number | string, maxDeletedEntryIdToken: "MAXDELETEDID", maxDeletedEntryId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Deletes messages from the beginning of a stream.
+     * - _group_: stream
+     * - _complexity_: O(N), with N being the number of evicted entries. Constant times are very small however, since entries are organized in macro nodes containing multiple entries that can be released with a single deallocation.
+     * - _since_: 5.0.0
+     */
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Add one or more members to a sorted set, or update its score if it already exists
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) for each item added, where N is the number of elements in the sorted set.
+     * - _since_: 1.2.0
+     */
+    zadd(...args: [
+        key: RedisKey,
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [key: RedisKey, ...scoreMembers: (string | Buffer | number)[]]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    /**
+     * Get the number of members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    zcard(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Count the members in a sorted set with scores within the given values
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 2.0.0
+     */
+    zcount(key: RedisKey, min: number | string, max: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Subtract multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.
+     * - _since_: 6.2.0
+     */
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zdiffBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zdiff(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zdiffBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Subtract multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.
+     * - _since_: 6.2.0
+     */
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zdiffstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Increment the score of a member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) where N is the number of elements in the sorted set.
+     * - _since_: 1.2.0
+     */
+    zincrby(key: RedisKey, increment: number | string, member: string | Buffer | number, callback?: Callback<string>): Result<string, Context>;
+    zincrbyBuffer(key: RedisKey, increment: number | string, member: string | Buffer | number, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Intersect multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.
+     * - _since_: 6.2.0
+     */
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Intersect multiple sorted sets and return the cardinality of the result
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K) worst case with N being the smallest input sorted set, K being the number of input sorted sets.
+     * - _since_: 7.0.0
+     */
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<number, Context>;
+    zintercard(...args: [numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    /**
+     * Intersect multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.
+     * - _since_: 2.0.0
+     */
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zinterstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    /**
+     * Count the number of members in a sorted set between a given lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 2.8.9
+     */
+    zlexcount(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove and return members with scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 7.0.0
+     */
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, ...keys: RedisKey[], min: "MIN"]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, keys: RedisKey[], min: "MIN"]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, ...keys: RedisKey[], max: "MAX"]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, keys: RedisKey[], max: "MAX"]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    /**
+     * Get the score associated with the given members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(N) where N is the number of members being requested.
+     * - _since_: 6.2.0
+     */
+    zmscore(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Remove and return members with the highest scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 5.0.0
+     */
+    zpopmax(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopmaxBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zpopmax(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopmaxBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove and return members with the lowest scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 5.0.0
+     */
+    zpopmin(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopminBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zpopmin(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopminBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get one or multiple random elements from a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 6.2.0
+     */
+    zrandmember(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    zrandmemberBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    zrandmember(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrandmemberBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrandmember(key: RedisKey, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrandmemberBuffer(key: RedisKey, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.
+     * - _since_: 1.2.0
+     */
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.8.9
+     */
+    zrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebylexBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebylexBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by score
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 1.0.5
+     */
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Store a range of members from sorted set into another key
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements stored into the destination key.
+     * - _since_: 6.2.0
+     */
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Determine the index of a member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N))
+     * - _since_: 2.0.0
+     */
+    zrank(key: RedisKey, member: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Remove one or more members from a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.
+     * - _since_: 1.2.0
+     */
+    zrem(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zrem(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zrem(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    zrem(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set between the given lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 2.8.9
+     */
+    zremrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set within the given indexes
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 2.0.0
+     */
+    zremrangebyrank(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set within the given scores
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 1.2.0
+     */
+    zremrangebyscore(key: RedisKey, min: number | string, max: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return a range of members in a sorted set, by index, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.
+     * - _since_: 1.2.0
+     */
+    zrevrange(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangeBuffer(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrange(key: RedisKey, start: number | string, stop: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangeBuffer(key: RedisKey, start: number | string, stop: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.8.9
+     */
+    zrevrangebylex(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebylexBuffer(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebylex(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebylexBuffer(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by score, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.2.0
+     */
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Determine the index of a member in a sorted set, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N))
+     * - _since_: 2.0.0
+     */
+    zrevrank(key: RedisKey, member: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Incrementally iterate sorted sets elements and associated scores
+     * - _group_: sorted-set
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    zscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Get the score associated with the given member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    zscore(key: RedisKey, member: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    zscoreBuffer(key: RedisKey, member: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Add multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(N)+O(M*log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.
+     * - _since_: 6.2.0
+     */
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Add multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(N)+O(M log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.
+     * - _since_: 2.0.0
+     */
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zunionstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+}
+export default RedisCommander;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.js b/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.js
new file mode 100644
index 0000000..c7431fc
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/RedisCommander.js
@@ -0,0 +1,7 @@
+"use strict";
+/**
+ * This file is generated by @ioredis/interface-generator.
+ * Don't edit it manually. Instead, run `npm run generate` to update
+ * this file.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.d.ts
new file mode 100644
index 0000000..cf5cdb4
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.d.ts
@@ -0,0 +1,3 @@
+declare type Constructor = new (...args: any[]) => void;
+declare function applyMixin(derivedConstructor: Constructor, mixinConstructor: Constructor): void;
+export default applyMixin;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.js b/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.js
new file mode 100644
index 0000000..0b2d5b9
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/applyMixin.js
@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function applyMixin(derivedConstructor, mixinConstructor) {
+    Object.getOwnPropertyNames(mixinConstructor.prototype).forEach((name) => {
+        Object.defineProperty(derivedConstructor.prototype, name, Object.getOwnPropertyDescriptor(mixinConstructor.prototype, name));
+    });
+}
+exports.default = applyMixin;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.d.ts
new file mode 100644
index 0000000..c451e14
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.d.ts
@@ -0,0 +1,14 @@
+import { CommandParameter } from "../types";
+/**
+ * Parses a command parameter as seconds and converts to milliseconds.
+ * @param arg - The command parameter representing seconds
+ * @returns The value in milliseconds, 0 if value is <= 0, or undefined if parsing fails
+ */
+export declare const parseSecondsArgument: (arg: CommandParameter | undefined) => number | undefined;
+/**
+ * Parses the BLOCK option from Redis command arguments (e.g., XREAD, XREADGROUP).
+ * @param args - Array of command parameters to search for the BLOCK option
+ * @returns The block duration in milliseconds, 0 if duration is <= 0,
+ *          null if BLOCK option is not found, or undefined if BLOCK is found but duration is invalid
+ */
+export declare const parseBlockOption: (args: CommandParameter[]) => number | null | undefined;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.js b/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.js
new file mode 100644
index 0000000..7a80605
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/argumentParsers.js
@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseBlockOption = exports.parseSecondsArgument = void 0;
+/**
+ * Parses a command parameter to a number.
+ * @param arg - The command parameter to parse (number, string, or Buffer)
+ * @returns The parsed number, or undefined if parsing fails or arg is undefined
+ */
+const parseNumberArgument = (arg) => {
+    if (typeof arg === "number") {
+        return arg;
+    }
+    if (Buffer.isBuffer(arg)) {
+        return parseNumberArgument(arg.toString());
+    }
+    if (typeof arg === "string") {
+        const value = Number(arg);
+        return Number.isFinite(value) ? value : undefined;
+    }
+    return undefined;
+};
+/**
+ * Parses a command parameter to a string.
+ * @param arg - The command parameter to parse (string or Buffer)
+ * @returns The parsed string, or undefined if arg is not a string/Buffer or is undefined
+ */
+const parseStringArgument = (arg) => {
+    if (typeof arg === "string") {
+        return arg;
+    }
+    if (Buffer.isBuffer(arg)) {
+        return arg.toString();
+    }
+    return undefined;
+};
+/**
+ * Parses a command parameter as seconds and converts to milliseconds.
+ * @param arg - The command parameter representing seconds
+ * @returns The value in milliseconds, 0 if value is <= 0, or undefined if parsing fails
+ */
+const parseSecondsArgument = (arg) => {
+    const value = parseNumberArgument(arg);
+    if (value === undefined) {
+        return undefined;
+    }
+    if (value <= 0) {
+        return 0;
+    }
+    return value * 1000;
+};
+exports.parseSecondsArgument = parseSecondsArgument;
+/**
+ * Parses the BLOCK option from Redis command arguments (e.g., XREAD, XREADGROUP).
+ * @param args - Array of command parameters to search for the BLOCK option
+ * @returns The block duration in milliseconds, 0 if duration is <= 0,
+ *          null if BLOCK option is not found, or undefined if BLOCK is found but duration is invalid
+ */
+const parseBlockOption = (args) => {
+    for (let i = 0; i < args.length; i++) {
+        const token = parseStringArgument(args[i]);
+        if (token && token.toLowerCase() === "block") {
+            const duration = parseNumberArgument(args[i + 1]);
+            if (duration === undefined) {
+                return undefined;
+            }
+            if (duration <= 0) {
+                return 0;
+            }
+            return duration;
+        }
+    }
+    return null;
+};
+exports.parseBlockOption = parseBlockOption;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/debug.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/debug.d.ts
new file mode 100644
index 0000000..e73b378
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/debug.d.ts
@@ -0,0 +1,16 @@
+declare const MAX_ARGUMENT_LENGTH = 200;
+/**
+ * helper function that tried to get a string value for
+ * arbitrary "debug" arg
+ */
+declare function getStringValue(v: any): string | void;
+/**
+ * helper function that redacts a string representation of a "debug" arg
+ */
+declare function genRedactedString(str: string, maxLen: number): string;
+/**
+ * a wrapper for the `debug` module, used to generate
+ * "debug functions" that trim the values in their output
+ */
+export default function genDebugFunction(namespace: string): (...args: any[]) => void;
+export { MAX_ARGUMENT_LENGTH, getStringValue, genRedactedString };
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/debug.js b/node_modules/bullmq/node_modules/ioredis/built/utils/debug.js
new file mode 100644
index 0000000..6613511
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/debug.js
@@ -0,0 +1,95 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.genRedactedString = exports.getStringValue = exports.MAX_ARGUMENT_LENGTH = void 0;
+const debug_1 = require("debug");
+const MAX_ARGUMENT_LENGTH = 200;
+exports.MAX_ARGUMENT_LENGTH = MAX_ARGUMENT_LENGTH;
+const NAMESPACE_PREFIX = "ioredis";
+/**
+ * helper function that tried to get a string value for
+ * arbitrary "debug" arg
+ */
+function getStringValue(v) {
+    if (v === null) {
+        return;
+    }
+    switch (typeof v) {
+        case "boolean":
+            return;
+        case "number":
+            return;
+        case "object":
+            if (Buffer.isBuffer(v)) {
+                return v.toString("hex");
+            }
+            if (Array.isArray(v)) {
+                return v.join(",");
+            }
+            try {
+                return JSON.stringify(v);
+            }
+            catch (e) {
+                return;
+            }
+        case "string":
+            return v;
+    }
+}
+exports.getStringValue = getStringValue;
+/**
+ * helper function that redacts a string representation of a "debug" arg
+ */
+function genRedactedString(str, maxLen) {
+    const { length } = str;
+    return length <= maxLen
+        ? str
+        : str.slice(0, maxLen) + ' ... <REDACTED full-length="' + length + '">';
+}
+exports.genRedactedString = genRedactedString;
+/**
+ * a wrapper for the `debug` module, used to generate
+ * "debug functions" that trim the values in their output
+ */
+function genDebugFunction(namespace) {
+    const fn = (0, debug_1.default)(`${NAMESPACE_PREFIX}:${namespace}`);
+    function wrappedDebug(...args) {
+        if (!fn.enabled) {
+            return; // no-op
+        }
+        // we skip the first arg because that is the message
+        for (let i = 1; i < args.length; i++) {
+            const str = getStringValue(args[i]);
+            if (typeof str === "string" && str.length > MAX_ARGUMENT_LENGTH) {
+                args[i] = genRedactedString(str, MAX_ARGUMENT_LENGTH);
+            }
+        }
+        return fn.apply(null, args);
+    }
+    Object.defineProperties(wrappedDebug, {
+        namespace: {
+            get() {
+                return fn.namespace;
+            },
+        },
+        enabled: {
+            get() {
+                return fn.enabled;
+            },
+        },
+        destroy: {
+            get() {
+                return fn.destroy;
+            },
+        },
+        log: {
+            get() {
+                return fn.log;
+            },
+            set(l) {
+                fn.log = l;
+            },
+        },
+    });
+    return wrappedDebug;
+}
+exports.default = genDebugFunction;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/index.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/index.d.ts
new file mode 100644
index 0000000..8c0772e
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/index.d.ts
@@ -0,0 +1,124 @@
+/// <reference types="node" />
+import { defaults, noop } from "./lodash";
+import { Callback } from "../types";
+import Debug from "./debug";
+/**
+ * Convert a buffer to string, supports buffer array
+ *
+ * @example
+ * ```js
+ * const input = [Buffer.from('foo'), [Buffer.from('bar')]]
+ * const res = convertBufferToString(input, 'utf8')
+ * expect(res).to.eql(['foo', ['bar']])
+ * ```
+ */
+export declare function convertBufferToString(value: any, encoding?: BufferEncoding): any;
+/**
+ * Convert a list of results to node-style
+ *
+ * @example
+ * ```js
+ * const input = ['a', 'b', new Error('c'), 'd']
+ * const output = exports.wrapMultiResult(input)
+ * expect(output).to.eql([[null, 'a'], [null, 'b'], [new Error('c')], [null, 'd'])
+ * ```
+ */
+export declare function wrapMultiResult(arr: unknown[] | null): unknown[][] | null;
+/**
+ * Detect if the argument is a int
+ * @example
+ * ```js
+ * > isInt('123')
+ * true
+ * > isInt('123.3')
+ * false
+ * > isInt('1x')
+ * false
+ * > isInt(123)
+ * true
+ * > isInt(true)
+ * false
+ * ```
+ */
+export declare function isInt(value: any): value is string;
+/**
+ * Pack an array to an Object
+ *
+ * @example
+ * ```js
+ * > packObject(['a', 'b', 'c', 'd'])
+ * { a: 'b', c: 'd' }
+ * ```
+ */
+export declare function packObject(array: any[]): Record<string, any>;
+/**
+ * Return a callback with timeout
+ */
+export declare function timeout<T>(callback: Callback<T>, timeout: number): Callback<T>;
+/**
+ * Convert an object to an array
+ * @example
+ * ```js
+ * > convertObjectToArray({ a: '1' })
+ * ['a', '1']
+ * ```
+ */
+export declare function convertObjectToArray<T>(obj: Record<string, T>): (string | T)[];
+/**
+ * Convert a map to an array
+ * @example
+ * ```js
+ * > convertMapToArray(new Map([[1, '2']]))
+ * [1, '2']
+ * ```
+ */
+export declare function convertMapToArray<K, V>(map: Map<K, V>): (K | V)[];
+/**
+ * Convert a non-string arg to a string
+ */
+export declare function toArg(arg: any): string;
+/**
+ * Optimize error stack
+ *
+ * @param error actually error
+ * @param friendlyStack the stack that more meaningful
+ * @param filterPath only show stacks with the specified path
+ */
+export declare function optimizeErrorStack(error: Error, friendlyStack: string, filterPath: string): Error;
+/**
+ * Parse the redis protocol url
+ */
+export declare function parseURL(url: string): Record<string, unknown>;
+interface TLSOptions {
+    port: number;
+    host: string;
+    [key: string]: any;
+}
+/**
+ * Resolve TLS profile shortcut in connection options
+ */
+export declare function resolveTLSProfile(options: TLSOptions): TLSOptions;
+/**
+ * Get a random element from `array`
+ */
+export declare function sample<T>(array: T[], from?: number): T;
+/**
+ * Shuffle the array using the Fisher-Yates Shuffle.
+ * This method will mutate the original array.
+ */
+export declare function shuffle<T>(array: T[]): T[];
+/**
+ * Error message for connection being disconnected
+ */
+export declare const CONNECTION_CLOSED_ERROR_MSG = "Connection is closed.";
+export declare function zipMap<K, V>(keys: K[], values: V[]): Map<K, V>;
+/**
+ * Retrieves cached package metadata from package.json.
+ *
+ * @internal
+ * @returns {Promise<{version: string} | null>} Package metadata or null if unavailable
+ */
+export declare function getPackageMeta(): Promise<{
+    version: string;
+}>;
+export { Debug, defaults, noop };
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/index.js b/node_modules/bullmq/node_modules/ioredis/built/utils/index.js
new file mode 100644
index 0000000..cabc98a
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/index.js
@@ -0,0 +1,332 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.noop = exports.defaults = exports.Debug = exports.getPackageMeta = exports.zipMap = exports.CONNECTION_CLOSED_ERROR_MSG = exports.shuffle = exports.sample = exports.resolveTLSProfile = exports.parseURL = exports.optimizeErrorStack = exports.toArg = exports.convertMapToArray = exports.convertObjectToArray = exports.timeout = exports.packObject = exports.isInt = exports.wrapMultiResult = exports.convertBufferToString = void 0;
+const fs_1 = require("fs");
+const path_1 = require("path");
+const url_1 = require("url");
+const lodash_1 = require("./lodash");
+Object.defineProperty(exports, "defaults", { enumerable: true, get: function () { return lodash_1.defaults; } });
+Object.defineProperty(exports, "noop", { enumerable: true, get: function () { return lodash_1.noop; } });
+const debug_1 = require("./debug");
+exports.Debug = debug_1.default;
+const TLSProfiles_1 = require("../constants/TLSProfiles");
+/**
+ * Convert a buffer to string, supports buffer array
+ *
+ * @example
+ * ```js
+ * const input = [Buffer.from('foo'), [Buffer.from('bar')]]
+ * const res = convertBufferToString(input, 'utf8')
+ * expect(res).to.eql(['foo', ['bar']])
+ * ```
+ */
+function convertBufferToString(value, encoding) {
+    if (value instanceof Buffer) {
+        return value.toString(encoding);
+    }
+    if (Array.isArray(value)) {
+        const length = value.length;
+        const res = Array(length);
+        for (let i = 0; i < length; ++i) {
+            res[i] =
+                value[i] instanceof Buffer && encoding === "utf8"
+                    ? value[i].toString()
+                    : convertBufferToString(value[i], encoding);
+        }
+        return res;
+    }
+    return value;
+}
+exports.convertBufferToString = convertBufferToString;
+/**
+ * Convert a list of results to node-style
+ *
+ * @example
+ * ```js
+ * const input = ['a', 'b', new Error('c'), 'd']
+ * const output = exports.wrapMultiResult(input)
+ * expect(output).to.eql([[null, 'a'], [null, 'b'], [new Error('c')], [null, 'd'])
+ * ```
+ */
+function wrapMultiResult(arr) {
+    // When using WATCH/EXEC transactions, the EXEC will return
+    // a null instead of an array
+    if (!arr) {
+        return null;
+    }
+    const result = [];
+    const length = arr.length;
+    for (let i = 0; i < length; ++i) {
+        const item = arr[i];
+        if (item instanceof Error) {
+            result.push([item]);
+        }
+        else {
+            result.push([null, item]);
+        }
+    }
+    return result;
+}
+exports.wrapMultiResult = wrapMultiResult;
+/**
+ * Detect if the argument is a int
+ * @example
+ * ```js
+ * > isInt('123')
+ * true
+ * > isInt('123.3')
+ * false
+ * > isInt('1x')
+ * false
+ * > isInt(123)
+ * true
+ * > isInt(true)
+ * false
+ * ```
+ */
+function isInt(value) {
+    const x = parseFloat(value);
+    return !isNaN(value) && (x | 0) === x;
+}
+exports.isInt = isInt;
+/**
+ * Pack an array to an Object
+ *
+ * @example
+ * ```js
+ * > packObject(['a', 'b', 'c', 'd'])
+ * { a: 'b', c: 'd' }
+ * ```
+ */
+function packObject(array) {
+    const result = {};
+    const length = array.length;
+    for (let i = 1; i < length; i += 2) {
+        result[array[i - 1]] = array[i];
+    }
+    return result;
+}
+exports.packObject = packObject;
+/**
+ * Return a callback with timeout
+ */
+function timeout(callback, timeout) {
+    let timer = null;
+    const run = function () {
+        if (timer) {
+            clearTimeout(timer);
+            timer = null;
+            callback.apply(this, arguments);
+        }
+    };
+    timer = setTimeout(run, timeout, new Error("timeout"));
+    return run;
+}
+exports.timeout = timeout;
+/**
+ * Convert an object to an array
+ * @example
+ * ```js
+ * > convertObjectToArray({ a: '1' })
+ * ['a', '1']
+ * ```
+ */
+function convertObjectToArray(obj) {
+    const result = [];
+    const keys = Object.keys(obj); // Object.entries requires node 7+
+    for (let i = 0, l = keys.length; i < l; i++) {
+        result.push(keys[i], obj[keys[i]]);
+    }
+    return result;
+}
+exports.convertObjectToArray = convertObjectToArray;
+/**
+ * Convert a map to an array
+ * @example
+ * ```js
+ * > convertMapToArray(new Map([[1, '2']]))
+ * [1, '2']
+ * ```
+ */
+function convertMapToArray(map) {
+    const result = [];
+    let pos = 0;
+    map.forEach(function (value, key) {
+        result[pos] = key;
+        result[pos + 1] = value;
+        pos += 2;
+    });
+    return result;
+}
+exports.convertMapToArray = convertMapToArray;
+/**
+ * Convert a non-string arg to a string
+ */
+function toArg(arg) {
+    if (arg === null || typeof arg === "undefined") {
+        return "";
+    }
+    return String(arg);
+}
+exports.toArg = toArg;
+/**
+ * Optimize error stack
+ *
+ * @param error actually error
+ * @param friendlyStack the stack that more meaningful
+ * @param filterPath only show stacks with the specified path
+ */
+function optimizeErrorStack(error, friendlyStack, filterPath) {
+    const stacks = friendlyStack.split("\n");
+    let lines = "";
+    let i;
+    for (i = 1; i < stacks.length; ++i) {
+        if (stacks[i].indexOf(filterPath) === -1) {
+            break;
+        }
+    }
+    for (let j = i; j < stacks.length; ++j) {
+        lines += "\n" + stacks[j];
+    }
+    if (error.stack) {
+        const pos = error.stack.indexOf("\n");
+        error.stack = error.stack.slice(0, pos) + lines;
+    }
+    return error;
+}
+exports.optimizeErrorStack = optimizeErrorStack;
+/**
+ * Parse the redis protocol url
+ */
+function parseURL(url) {
+    if (isInt(url)) {
+        return { port: url };
+    }
+    let parsed = (0, url_1.parse)(url, true, true);
+    if (!parsed.slashes && url[0] !== "/") {
+        url = "//" + url;
+        parsed = (0, url_1.parse)(url, true, true);
+    }
+    const options = parsed.query || {};
+    const result = {};
+    if (parsed.auth) {
+        const index = parsed.auth.indexOf(":");
+        result.username = index === -1 ? parsed.auth : parsed.auth.slice(0, index);
+        result.password = index === -1 ? "" : parsed.auth.slice(index + 1);
+    }
+    if (parsed.pathname) {
+        if (parsed.protocol === "redis:" || parsed.protocol === "rediss:") {
+            if (parsed.pathname.length > 1) {
+                result.db = parsed.pathname.slice(1);
+            }
+        }
+        else {
+            result.path = parsed.pathname;
+        }
+    }
+    if (parsed.host) {
+        result.host = parsed.hostname;
+    }
+    if (parsed.port) {
+        result.port = parsed.port;
+    }
+    if (typeof options.family === "string") {
+        const intFamily = Number.parseInt(options.family, 10);
+        if (!Number.isNaN(intFamily)) {
+            result.family = intFamily;
+        }
+    }
+    (0, lodash_1.defaults)(result, options);
+    return result;
+}
+exports.parseURL = parseURL;
+/**
+ * Resolve TLS profile shortcut in connection options
+ */
+function resolveTLSProfile(options) {
+    let tls = options === null || options === void 0 ? void 0 : options.tls;
+    if (typeof tls === "string")
+        tls = { profile: tls };
+    const profile = TLSProfiles_1.default[tls === null || tls === void 0 ? void 0 : tls.profile];
+    if (profile) {
+        tls = Object.assign({}, profile, tls);
+        delete tls.profile;
+        options = Object.assign({}, options, { tls });
+    }
+    return options;
+}
+exports.resolveTLSProfile = resolveTLSProfile;
+/**
+ * Get a random element from `array`
+ */
+function sample(array, from = 0) {
+    const length = array.length;
+    if (from >= length) {
+        return null;
+    }
+    return array[from + Math.floor(Math.random() * (length - from))];
+}
+exports.sample = sample;
+/**
+ * Shuffle the array using the Fisher-Yates Shuffle.
+ * This method will mutate the original array.
+ */
+function shuffle(array) {
+    let counter = array.length;
+    // While there are elements in the array
+    while (counter > 0) {
+        // Pick a random index
+        const index = Math.floor(Math.random() * counter);
+        // Decrease counter by 1
+        counter--;
+        // And swap the last element with it
+        [array[counter], array[index]] = [array[index], array[counter]];
+    }
+    return array;
+}
+exports.shuffle = shuffle;
+/**
+ * Error message for connection being disconnected
+ */
+exports.CONNECTION_CLOSED_ERROR_MSG = "Connection is closed.";
+function zipMap(keys, values) {
+    const map = new Map();
+    keys.forEach((key, index) => {
+        map.set(key, values[index]);
+    });
+    return map;
+}
+exports.zipMap = zipMap;
+/**
+ * Memoized package metadata to avoid repeated file system reads.
+ *
+ * @internal
+ */
+let cachedPackageMeta = null;
+/**
+ * Retrieves cached package metadata from package.json.
+ *
+ * @internal
+ * @returns {Promise<{version: string} | null>} Package metadata or null if unavailable
+ */
+async function getPackageMeta() {
+    if (cachedPackageMeta) {
+        return cachedPackageMeta;
+    }
+    try {
+        const filePath = (0, path_1.resolve)(__dirname, "..", "..", "package.json");
+        const data = await fs_1.promises.readFile(filePath, "utf8");
+        const parsed = JSON.parse(data);
+        cachedPackageMeta = {
+            version: parsed.version,
+        };
+        return cachedPackageMeta;
+    }
+    catch (err) {
+        cachedPackageMeta = {
+            version: "error-fetching-version",
+        };
+        return cachedPackageMeta;
+    }
+}
+exports.getPackageMeta = getPackageMeta;
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.d.ts b/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.d.ts
new file mode 100644
index 0000000..683e214
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.d.ts
@@ -0,0 +1,4 @@
+import defaults = require("lodash.defaults");
+import isArguments = require("lodash.isarguments");
+export declare function noop(): void;
+export { defaults, isArguments };
diff --git a/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.js b/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.js
new file mode 100644
index 0000000..5f5eccd
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/built/utils/lodash.js
@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isArguments = exports.defaults = exports.noop = void 0;
+const defaults = require("lodash.defaults");
+exports.defaults = defaults;
+const isArguments = require("lodash.isarguments");
+exports.isArguments = isArguments;
+function noop() { }
+exports.noop = noop;
diff --git a/node_modules/bullmq/node_modules/ioredis/package.json b/node_modules/bullmq/node_modules/ioredis/package.json
new file mode 100644
index 0000000..84d530f
--- /dev/null
+++ b/node_modules/bullmq/node_modules/ioredis/package.json
@@ -0,0 +1,102 @@
+{
+  "name": "ioredis",
+  "version": "5.10.1",
+  "description": "A robust, performance-focused and full-featured Redis client for Node.js.",
+  "main": "./built/index.js",
+  "types": "./built/index.d.ts",
+  "files": [
+    "built/"
+  ],
+  "scripts": {
+    "docker:setup": "docker compose -f test/docker-compose.yml up -d --wait",
+    "docker:teardown": "docker compose -f test/docker-compose.yml down --volumes --remove-orphans",
+    "test:tsd": "npm run build && tsd",
+    "test:js": "TS_NODE_TRANSPILE_ONLY=true NODE_ENV=test mocha --no-experimental-strip-types \"test/helpers/*.ts\" \"test/unit/**/*.ts\" \"test/functional/**/*.ts\"",
+    "test:cov": "nyc npm run test:js",
+    "test:cluster": "TS_NODE_TRANSPILE_ONLY=true NODE_ENV=test mocha --no-experimental-strip-types \"test/cluster/**/*.ts\"",
+    "test": "npm run test:js && npm run test:tsd",
+    "lint": "eslint --ext .js,.ts ./lib",
+    "docs": "npx typedoc --logLevel Error --excludeExternals --excludeProtected --excludePrivate --readme none lib/index.ts",
+    "format": "prettier --write \"{,!(node_modules)/**/}*.{js,ts}\"",
+    "format-check": "prettier --check \"{,!(node_modules)/**/}*.{js,ts}\"",
+    "build": "rm -rf built && tsc",
+    "prepublishOnly": "npm run build",
+    "semantic-release": "semantic-release"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/luin/ioredis.git"
+  },
+  "keywords": [
+    "redis",
+    "cluster",
+    "sentinel",
+    "pipelining"
+  ],
+  "tsd": {
+    "directory": "test/typing"
+  },
+  "author": "Zihua Li <i@zihua.li> (http://zihua.li)",
+  "license": "MIT",
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/ioredis"
+  },
+  "dependencies": {
+    "@ioredis/commands": "1.5.1",
+    "cluster-key-slot": "^1.1.0",
+    "debug": "^4.3.4",
+    "denque": "^2.1.0",
+    "lodash.defaults": "^4.2.0",
+    "lodash.isarguments": "^3.1.0",
+    "redis-errors": "^1.2.0",
+    "redis-parser": "^3.0.0",
+    "standard-as-callback": "^2.1.0"
+  },
+  "devDependencies": {
+    "@ioredis/interface-generator": "^1.3.0",
+    "@semantic-release/changelog": "^6.0.1",
+    "@semantic-release/commit-analyzer": "^9.0.2",
+    "@semantic-release/git": "^10.0.1",
+    "@types/chai": "^4.3.0",
+    "@types/chai-as-promised": "^7.1.5",
+    "@types/debug": "^4.1.5",
+    "@types/lodash.defaults": "^4.2.7",
+    "@types/lodash.isarguments": "^3.1.7",
+    "@types/mocha": "^9.1.0",
+    "@types/node": "^14.18.12",
+    "@types/redis-errors": "^1.2.1",
+    "@types/sinon": "^10.0.11",
+    "@typescript-eslint/eslint-plugin": "^5.48.1",
+    "@typescript-eslint/parser": "^5.48.1",
+    "chai": "^4.3.6",
+    "chai-as-promised": "^7.1.1",
+    "eslint": "^8.31.0",
+    "eslint-config-prettier": "^8.6.0",
+    "mocha": "^9.2.1",
+    "nyc": "^15.1.0",
+    "prettier": "^2.6.1",
+    "semantic-release": "^19.0.2",
+    "server-destroy": "^1.0.1",
+    "sinon": "^13.0.1",
+    "ts-node": "^10.4.0",
+    "tsd": "^0.19.1",
+    "typedoc": "^0.22.18",
+    "typescript": "^4.6.3",
+    "uuid": "^9.0.0"
+  },
+  "nyc": {
+    "reporter": [
+      "lcov"
+    ]
+  },
+  "engines": {
+    "node": ">=12.22.0"
+  },
+  "mocha": {
+    "exit": true,
+    "timeout": 8000,
+    "recursive": true,
+    "require": "ts-node/register"
+  }
+}
diff --git a/node_modules/bullmq/package.json b/node_modules/bullmq/package.json
new file mode 100644
index 0000000..ec8435c
--- /dev/null
+++ b/node_modules/bullmq/package.json
@@ -0,0 +1,203 @@
+{
+  "name": "bullmq",
+  "version": "5.77.6",
+  "description": "Queue for messages and jobs based on Redis",
+  "homepage": "https://bullmq.io/",
+  "main": "./dist/cjs/index.js",
+  "module": "./dist/esm/index.js",
+  "types": "./dist/esm/index.d.ts",
+  "source": "./src/index.ts",
+  "author": "Taskforce.sh Inc.",
+  "license": "MIT",
+  "keywords": [
+    "bull",
+    "bullmq",
+    "queues",
+    "jobs",
+    "redis"
+  ],
+  "files": [
+    "dist"
+  ],
+  "engines": {
+    "node": ">=12.22.0"
+  },
+  "scripts": {
+    "build": "npm run clean:dist && npm run pretest && npm run tsc:all && npm run copy:main:type && npm run clean:temp:files && npm run copy:lua && npm run copy:includes:lua",
+    "circular:references": "madge --circular --extensions ts ./src",
+    "clean:dist": "rimraf dist",
+    "clean:scripts": "rimraf rawScripts src/scripts",
+    "clean:temp:files": "rimraf dist/cjs/bullmq.d.ts dist/esm/bullmq.d.ts dist/tsdoc-metadata.json",
+    "copy:includes:lua": "cpx \"./src/commands/includes/*.lua\" ./dist/cjs/commands/includes && cpx \"./src/commands/includes/*.lua\" ./dist/esm/commands/includes",
+    "copy:lua": "cpx \"./src/commands/*.lua\" ./dist/cjs/commands && cpx \"./src/commands/*.lua\" ./dist/esm/commands",
+    "copy:lua:python": "cpx \"./rawScripts/*.lua\" ./python/bullmq/commands",
+    "copy:lua:elixir": "cpx \"./rawScripts/*.lua\" ./elixir/priv/scripts",
+    "copy:lua:php": "cpx \"./rawScripts/*.lua\" ./php/src/commands",
+    "copy:main:type": "cpx \"./dist/esm/classes/main.d.ts\" ./dist/cjs/classes && cpx \"./dist/esm/classes/main-worker.d.ts\" ./dist/cjs/classes",
+    "coverage": "vitest run --no-file-parallelism --coverage --config vitest.coverage.config.ts",
+    "docs": "typedoc --excludeExternals --excludeProtected --excludePrivate --readme none src/index.ts",
+    "docs:json": "typedoc --excludeExternals --excludeProtected --excludePrivate --readme none src/index.ts --json ./apiVersions/v5.json --name v5",
+    "dc:up": "docker-compose -f docker-compose.yml up -d",
+    "dc:down": "docker-compose -f docker-compose.yml down",
+    "dry-run": "npm publish --dry-run",
+    "eslint:fix": "./node_modules/.bin/eslint . --fix",
+    "generate:raw:scripts": "ts-node --project tsconfig-cjs.json scripts/generateRawScripts.ts",
+    "lint": "./node_modules/.bin/eslint .",
+    "lint:staged": "lint-staged",
+    "prepublishOnly": "npm run build",
+    "prepare": "husky",
+    "pretest": "npm run clean:scripts && npm run generate:raw:scripts && npm run transform:commands && npm run circular:references",
+    "prettier": "prettier **/*.ts --write",
+    "pretty:quick": "pretty-quick --staged",
+    "semantic-release": "semantic-release",
+    "semantic-release:debug": "semantic-release --no-ci --dry-run --debug",
+    "semantic-release-prepare": "ts-node tools/semantic-release-prepare",
+    "test": "vitest run --no-file-parallelism",
+    "test:smoke": "vitest run --no-file-parallelism --bail=1 tests/async_fifo_queue.test.ts tests/script_loader.test.ts tests/scripts.test.ts tests/child-pool.test.ts tests/bulk.test.ts tests/queue.test.ts",
+    "test:vitest": "vitest run --no-file-parallelism",
+    "test:vitest:watch": "vitest",
+    "test:vitest:ui": "vitest --ui",
+    "test:ioredis": "vitest run --no-file-parallelism --config vitest.ioredis.config.ts",
+    "test:node-redis": "vitest run --no-file-parallelism --config vitest.node-redis.config.ts",
+    "test:adapter-conformance": "vitest run --no-file-parallelism --config vitest.adapter-conformance.config.ts",
+    "test:bun": "bun node_modules/vitest/dist/cli.js run --no-file-parallelism --config vitest.bun.config.ts",
+    "test:bun:smoke": "bun test --timeout 20000 tests/bun-redis.test.ts tests/bun-adapter-suite.test.ts",
+    "test:watch": "vitest --watch",
+    "transform:commands": "node ./scripts/commandTransform.js ./rawScripts ./src/scripts",
+    "tsc": "tsc",
+    "tsc:all": "tsc && tsc -p tsconfig-cjs.json"
+  },
+  "dependencies": {
+    "cron-parser": "4.9.0",
+    "ioredis": "5.10.1",
+    "msgpackr": "2.0.1",
+    "node-abort-controller": "3.1.1",
+    "semver": "7.8.0",
+    "tslib": "2.8.1"
+  },
+  "peerDependencies": {
+    "redis": ">=5.0.0"
+  },
+  "peerDependenciesMeta": {
+    "redis": {
+      "optional": true
+    }
+  },
+  "devDependencies": {
+    "@commitlint/cli": "21.0.1",
+    "@commitlint/config-conventional": "21.0.1",
+    "@semantic-release/changelog": "6.0.3",
+    "@semantic-release/commit-analyzer": "13.0.1",
+    "@semantic-release/exec": "7.1.0",
+    "@semantic-release/git": "10.0.1",
+    "@semantic-release/github": "12.0.8",
+    "@semantic-release/npm": "13.1.5",
+    "@semantic-release/release-notes-generator": "14.1.1",
+    "@types/lodash.defaults": "4.2.9",
+    "@types/lodash.isarguments": "3.1.9",
+    "@types/msgpack": "0.0.34",
+    "@types/node": "24.12.4",
+    "@types/semver": "7.7.1",
+    "@types/sinon": "21.0.1",
+    "@typescript-eslint/eslint-plugin": "8.59.3",
+    "@typescript-eslint/parser": "8.59.3",
+    "@vitest/coverage-v8": "4.1.6",
+    "coveralls-next": "6.0.1",
+    "cpx2": "8.0.2",
+    "eslint": "9.39.4",
+    "eslint-config-prettier": "8.10.2",
+    "eslint-plugin-prettier": "4.2.5",
+    "eslint-plugin-promise": "7.3.0",
+    "eslint-plugin-tsdoc": "0.5.2",
+    "fast-glob": "3.3.3",
+    "globals": "17.6.0",
+    "husky": "9.1.7",
+    "lint-staged": "16.4.0",
+    "madge": "8.0.0",
+    "minimatch": "10.2.5",
+    "moment": "2.30.1",
+    "prettier": "3.8.3",
+    "pretty-quick": "4.2.2",
+    "progress": "2.0.3",
+    "redis": "5.7.0",
+    "rimraf": "6.1.3",
+    "rrule": "2.8.1",
+    "semantic-release": "25.0.3",
+    "sinon": "21.1.2",
+    "test-console": "2.0.0",
+    "ts-node": "10.9.2",
+    "typedoc": "0.28.19",
+    "typescript": "5.9.3",
+    "vitest": "4.1.6"
+  },
+  "commitlint": {
+    "extends": [
+      "@commitlint/config-conventional"
+    ]
+  },
+  "lint-staged": {
+    "*.{js,ts}": "npm run eslint:fix"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/taskforcesh/bullmq.git"
+  },
+  "release": {
+    "plugins": [
+      [
+        "@semantic-release/commit-analyzer",
+        {
+          "releaseRules": [
+            {
+              "message": "*\\[python\\]*",
+              "release": false
+            },
+            {
+              "message": "*\\[elixir\\]*",
+              "release": false
+            },
+            {
+              "message": "*\\[php\\]*",
+              "release": false
+            }
+          ]
+        }
+      ],
+      [
+        "@semantic-release/release-notes-generator",
+        {
+          "preset": "angular",
+          "presetConfig": {
+            "ignoreCommits": "(\\[python\\]|\\[elixir\\]|\\[php\\])"
+          }
+        }
+      ],
+      [
+        "@semantic-release/changelog",
+        {
+          "changelogFile": "docs/gitbook/changelog.md"
+        }
+      ],
+      [
+        "@semantic-release/exec",
+        {
+          "prepareCmd": "node scripts/updateVersion.js ${nextRelease.version} && yarn build"
+        }
+      ],
+      [
+        "@semantic-release/npm",
+        {
+          "npmPublish": true,
+          "provenance": true
+        }
+      ],
+      "@semantic-release/github"
+    ]
+  },
+  "packageManager": "yarn@1.22.22",
+  "resolutions": {
+    "brace-expansion": ">=1.1.13",
+    "picomatch": ">=2.3.2",
+    "yaml": ">=2.8.3"
+  }
+}
diff --git a/node_modules/cluster-key-slot/.eslintrc b/node_modules/cluster-key-slot/.eslintrc
new file mode 100644
index 0000000..3ee8296
--- /dev/null
+++ b/node_modules/cluster-key-slot/.eslintrc
@@ -0,0 +1,16 @@
+{
+  "extends": "airbnb-base/legacy",
+  "parserOptions":{
+    "ecmaFeatures": {
+      "experimentalObjectRestSpread": true
+    }
+  },
+  "rules": {
+    "max-len": 0,
+    "no-plusplus": 0,
+    "no-bitwise": 0,
+    "no-param-reassign": 0,
+    "no-undef": 0
+  },
+  "globals": {}
+}
diff --git a/node_modules/cluster-key-slot/LICENSE b/node_modules/cluster-key-slot/LICENSE
new file mode 100644
index 0000000..fd22a2d
--- /dev/null
+++ b/node_modules/cluster-key-slot/LICENSE
@@ -0,0 +1,13 @@
+Copyright (c) 2018 Mike Diarmid (Salakar) <mike.diarmid@gmail.com>
+
+Licensed under the Apache License, Version 2.0 (the "License");
+you may not use this library 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.
diff --git a/node_modules/cluster-key-slot/README.md b/node_modules/cluster-key-slot/README.md
new file mode 100644
index 0000000..440f7b1
--- /dev/null
+++ b/node_modules/cluster-key-slot/README.md
@@ -0,0 +1,61 @@
+[![Coverage Status](https://coveralls.io/repos/github/Salakar/cluster-key-slot/badge.svg?branch=master)](https://coveralls.io/github/Salakar/cluster-key-slot?branch=master)
+![Downloads](https://img.shields.io/npm/dt/cluster-key-slot.svg)
+[![npm version](https://img.shields.io/npm/v/cluster-key-slot.svg)](https://www.npmjs.com/package/cluster-key-slot)
+[![dependencies](https://img.shields.io/david/Salakar/cluster-key-slot.svg)](https://david-dm.org/Salakar/cluster-key-slot)
+[![License](https://img.shields.io/npm/l/cluster-key-slot.svg)](/LICENSE)
+<a href="https://twitter.com/mikediarmid"><img src="https://img.shields.io/twitter/follow/mikediarmid.svg?style=social&label=Follow" alt="Follow on Twitter"></a>
+
+# Redis Key Slot Calculator
+
+A high performance redis cluster key slot calculator for node redis clients e.g. [node_redis](https://github.com/NodeRedis/node_redis), [ioredis](https://github.com/luin/ioredis) and [redis-clustr](https://github.com/gosquared/redis-clustr/).
+
+This also handles key tags such as `somekey{actualTag}`.
+
+## Install
+
+Install with [NPM](https://npmjs.org/):
+
+```
+npm install cluster-key-slot --save
+```
+
+## Usage
+
+```js
+const calculateSlot = require('cluster-key-slot');
+const calculateMultipleSlots = require('cluster-key-slot').generateMulti;
+
+// ...
+
+// a single slot number
+const slot = calculateSlot('test:key:{butOnlyThis}redis');
+// Buffer is also supported
+const anotherSlot = calculateSlot(Buffer.from([0x7b, 0x7d, 0x2a]));
+
+// multiple keys - multi returns a single key slot number, returns -1 if any
+// of the keys does not match the base slot number (base is defaulted to first keys slot)
+// This is useful to quickly determine a singe slot for multi keys operations.
+const slotForRedisMulti = calculateMultipleSlots([
+  'test:key:{butOnlyThis}redis',
+  'something:key45:{butOnlyThis}hello',
+  'example:key46:{butOnlyThis}foobar',
+]);
+```
+
+## Benchmarks
+
+`OLD` in these benchmarks refers to the `ioredis` crc calc and many of the other calculators that use `Buffer`.
+
+```text
+node -v                                                                                                                                                                                                ✔  16.38G RAM  10:29:07
+v10.15.3
+
+NEW tags x 721,445 ops/sec ±0.44% (90 runs sampled)
+OLD tags x 566,777 ops/sec ±0.97% (96 runs sampled)
+NEW without tags x 2,054,845 ops/sec ±1.77% (92 runs sampled)
+OLD without tags x 865,839 ops/sec ±0.43% (96 runs sampled)
+NEW without tags singular x 6,354,097 ops/sec ±1.25% (94 runs sampled)
+OLD without tags singular x 4,012,250 ops/sec ±0.96% (94 runs sampled)
+NEW tags (Buffer) x 552,346 ops/sec ±1.35% (92 runs sampled)
+```
+
diff --git a/node_modules/cluster-key-slot/lib/index.js b/node_modules/cluster-key-slot/lib/index.js
new file mode 100644
index 0000000..7928c77
--- /dev/null
+++ b/node_modules/cluster-key-slot/lib/index.js
@@ -0,0 +1,166 @@
+/*
+ * Copyright 2001-2010 Georges Menie (www.menie.org)
+ * Copyright 2010 Salvatore Sanfilippo (adapted to Redis coding style)
+ * Copyright 2015 Zihua Li (http://zihua.li) (ported to JavaScript)
+ * Copyright 2016 Mike Diarmid (http://github.com/salakar) (re-write for performance, ~700% perf inc)
+ * All rights reserved.
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *     * Redistributions of source code must retain the above copyright
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright
+ *       notice, this list of conditions and the following disclaimer in the
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of the University of California, Berkeley nor the
+ *       names of its contributors may be used to endorse or promote products
+ *       derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
+ * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
+ * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/* CRC16 implementation according to CCITT standards.
+ *
+ * Note by @antirez: this is actually the XMODEM CRC 16 algorithm, using the
+ * following parameters:
+ *
+ * Name                       : "XMODEM", also known as "ZMODEM", "CRC-16/ACORN"
+ * Width                      : 16 bit
+ * Poly                       : 1021 (That is actually x^16 + x^12 + x^5 + 1)
+ * Initialization             : 0000
+ * Reflect Input byte         : False
+ * Reflect Output CRC         : False
+ * Xor constant to output CRC : 0000
+ * Output for "123456789"     : 31C3
+ */
+
+var lookup = [
+  0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7,
+  0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef,
+  0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6,
+  0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, 0xf3ff, 0xe3de,
+  0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485,
+  0xa56a, 0xb54b, 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d,
+  0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,
+  0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc,
+  0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823,
+  0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b,
+  0x5af5, 0x4ad4, 0x7ab7, 0x6a96, 0x1a71, 0x0a50, 0x3a33, 0x2a12,
+  0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a,
+  0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41,
+  0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,
+  0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70,
+  0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, 0x9f59, 0x8f78,
+  0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f,
+  0x1080, 0x00a1, 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067,
+  0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e,
+  0x02b1, 0x1290, 0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256,
+  0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,
+  0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,
+  0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e, 0xc71d, 0xd73c,
+  0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634,
+  0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, 0xb98a, 0xa9ab,
+  0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3,
+  0xcb7d, 0xdb5c, 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a,
+  0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,
+  0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9,
+  0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1,
+  0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8,
+  0x6e17, 0x7e36, 0x4e55, 0x5e74, 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0
+];
+
+/**
+ * Convert a string to a UTF8 array - faster than via buffer
+ * @param str
+ * @returns {Array}
+ */
+var toUTF8Array = function toUTF8Array(str) {
+  var char;
+  var i = 0;
+  var p = 0;
+  var utf8 = [];
+  var len = str.length;
+
+  for (; i < len; i++) {
+    char = str.charCodeAt(i);
+    if (char < 128) {
+      utf8[p++] = char;
+    } else if (char < 2048) {
+      utf8[p++] = (char >> 6) | 192;
+      utf8[p++] = (char & 63) | 128;
+    } else if (
+        ((char & 0xFC00) === 0xD800) && (i + 1) < str.length &&
+        ((str.charCodeAt(i + 1) & 0xFC00) === 0xDC00)) {
+      char = 0x10000 + ((char & 0x03FF) << 10) + (str.charCodeAt(++i) & 0x03FF);
+      utf8[p++] = (char >> 18) | 240;
+      utf8[p++] = ((char >> 12) & 63) | 128;
+      utf8[p++] = ((char >> 6) & 63) | 128;
+      utf8[p++] = (char & 63) | 128;
+    } else {
+      utf8[p++] = (char >> 12) | 224;
+      utf8[p++] = ((char >> 6) & 63) | 128;
+      utf8[p++] = (char & 63) | 128;
+    }
+  }
+
+  return utf8;
+};
+
+/**
+ * Convert a string into a redis slot hash.
+ * @param str
+ * @returns {number}
+ */
+var generate = module.exports = function generate(str) {
+  var char;
+  var i = 0;
+  var start = -1;
+  var result = 0;
+  var resultHash = 0;
+  var utf8 = typeof str === 'string' ? toUTF8Array(str) : str;
+  var len = utf8.length;
+
+  while (i < len) {
+    char = utf8[i++];
+    if (start === -1) {
+      if (char === 0x7B) {
+        start = i;
+      }
+    } else if (char !== 0x7D) {
+      resultHash = lookup[(char ^ (resultHash >> 8)) & 0xFF] ^ (resultHash << 8);
+    } else if (i - 1 !== start) {
+      return resultHash & 0x3FFF;
+    }
+
+    result = lookup[(char ^ (result >> 8)) & 0xFF] ^ (result << 8);
+  }
+
+  return result & 0x3FFF;
+};
+
+/**
+ * Convert an array of multiple strings into a redis slot hash.
+ * Returns -1 if one of the keys is not for the same slot as the others
+ * @param keys
+ * @returns {number}
+ */
+module.exports.generateMulti = function generateMulti(keys) {
+  var i = 1;
+  var len = keys.length;
+  var base = generate(keys[0]);
+
+  while (i < len) {
+    if (generate(keys[i++]) !== base) return -1;
+  }
+
+  return base;
+};
diff --git a/node_modules/cluster-key-slot/package.json b/node_modules/cluster-key-slot/package.json
new file mode 100644
index 0000000..653edfb
--- /dev/null
+++ b/node_modules/cluster-key-slot/package.json
@@ -0,0 +1,55 @@
+{
+  "name": "cluster-key-slot",
+  "version": "1.1.1",
+  "description": "Generates CRC hashes for strings - for use by node redis clients to determine key slots.",
+  "main": "lib/index.js",
+  "scripts": {
+    "benchmark": "node ./benchmark",
+    "posttest": "eslint ./lib && npm run coveralls",
+    "coveralls": "cat ./coverage/lcov.info | coveralls",
+    "test": "node ./node_modules/istanbul/lib/cli.js cover --preserve-comments ./node_modules/mocha/bin/_mocha -- -R spec",
+    "coverage:check": "node ./node_modules/istanbul/lib/cli.js check-coverage --branch 100 --statement 100"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/Salakar/cluster-key-slot.git"
+  },
+  "keywords": [
+    "redis",
+    "hash",
+    "crc",
+    "slot",
+    "calc",
+    "javascript",
+    "node",
+    "node_redis",
+    "ioredis"
+  ],
+  "engines": {
+    "node": ">=0.10.0"
+  },
+  "devDependencies": {
+    "benchmark": "^2.1.0",
+    "codeclimate-test-reporter": "^0.3.1",
+    "coveralls": "^2.11.9",
+    "eslint": "^3.5.0",
+    "eslint-config-airbnb-base": "^7.1.0",
+    "eslint-plugin-import": "^1.8.0",
+    "istanbul": "^0.4.0",
+    "mocha": "^3.0.2"
+  },
+  "author": {
+    "name": "Mike Diarmid",
+    "email": "mike.diarmid@gmail.com",
+    "url": "http://github.com/Salakar/"
+  },
+  "license": "Apache-2.0",
+  "bugs": {
+    "url": "https://github.com/Salakar/cluster-key-slot/issues"
+  },
+  "homepage": "https://github.com/Salakar/cluster-key-slot#readme",
+  "directories": {
+    "test": "test",
+    "lib": "lib"
+  }
+}
diff --git a/node_modules/complex.js/LICENSE b/node_modules/complex.js/LICENSE
new file mode 100644
index 0000000..8741015
--- /dev/null
+++ b/node_modules/complex.js/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Robert Eisele
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/complex.js/README.md b/node_modules/complex.js/README.md
new file mode 100644
index 0000000..8e3e2ec
--- /dev/null
+++ b/node_modules/complex.js/README.md
@@ -0,0 +1,373 @@
+# Complex.js - ℂ in JavaScript
+
+[![NPM Package](https://img.shields.io/npm/v/complex.js.svg?style=flat)](https://npmjs.org/package/complex.js "View this project on npm")
+[![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT)
+
+Complex.js is a well tested JavaScript library to work with [complex number arithmetic](https://raw.org/book/analysis/complex-numbers/) in JavaScript. It implements every elementary complex number manipulation function and the API is intentionally similar to [Fraction.js](https://github.com/rawify/Fraction.js). Furthermore, it's the basis of [Polynomial.js](https://github.com/rawify/Polynomial.js) and [Math.js](https://github.com/josdejong/mathjs).
+
+
+## Examples
+
+
+```js
+let Complex = require('complex.js');
+
+let c = new Complex("99.3+8i");
+c.mul({re: 3, im: 9}).div(4.9).sub(3, 2);
+```
+
+A classical use case for complex numbers is solving quadratic equations `ax² + bx + c = 0` for all `a, b, c ∈ ℝ`:
+
+```js
+
+function quadraticRoot(a, b, c) {
+  let sqrt = Complex(b * b - 4 * a * c).sqrt()
+  let x1 = Complex(-b).add(sqrt).div(2 * a)
+  let x2 = Complex(-b).sub(sqrt).div(2 * a)
+  return {x1, x2}
+}
+
+// quadraticRoot(1, 4, 5) -> -2 ± i
+```
+
+For cubic roots have a look at [RootFinder](https://github.com/rawify/RootFinder.js) which uses Complex.js.
+
+## Parser
+
+
+Any function (see below) as well as the constructor of the *Complex* class parses its input like this.
+
+You can pass either Objects, Doubles or Strings.
+
+### Objects
+
+```javascript
+new Complex({re: real, im: imaginary});
+new Complex({arg: angle, abs: radius});
+new Complex({phi: angle, r: radius});
+new Complex([real, imaginary]); // Vector/Array syntax
+```
+If there are other attributes on the passed object, they're not getting preserved and have to be merged manually.
+
+**Note:** Object attributes have to be of type Number to avoid undefined behavior.
+
+### Doubles
+
+```javascript
+new Complex(55.4);
+```
+
+### Strings
+
+```javascript
+new Complex("123.45");
+new Complex("15+3i");
+new Complex("i");
+```
+
+### Two arguments
+
+```javascript
+new Complex(3, 2); // 3+2i
+```
+
+## Attributes
+
+
+Every complex number object exposes its real and imaginary part as attribute `re` and `im`:
+
+```javascript
+let c = new Complex(3, 2);
+
+console.log("Real part:", c.re); // 3
+console.log("Imaginary part:", c.im); // 2
+```
+
+## Functions
+
+
+Complex sign()
+---
+Returns the complex sign, defined as the complex number normalized by it's absolute value
+
+Complex add(n)
+---
+Adds another complex number
+
+Complex sub(n)
+---
+Subtracts another complex number
+
+Complex mul(n)
+---
+Multiplies the number with another complex number
+
+Complex div(n)
+---
+Divides the number by another complex number
+
+Complex pow(exp)
+---
+Returns the number raised to the complex exponent (Note: `Complex.ZERO.pow(0) = Complex.ONE` by convention)
+
+Complex sqrt()
+---
+Returns the complex square root of the number
+
+Complex exp(n)
+---
+Returns `e^n` with complex exponent `n`.
+
+Complex log()
+---
+Returns the natural logarithm (base `E`) of the actual complex number
+
+_Note:_ The logarithm to a different base can be calculated with `z.log().div(Math.log(base))`.
+
+double abs()
+---
+Calculates the magnitude of the complex number
+
+double arg()
+---
+Calculates the angle of the complex number
+
+Complex inverse()
+---
+Calculates the multiplicative inverse of the complex number (1 / z)
+
+Complex conjugate()
+---
+Calculates the conjugate of the complex number (multiplies the imaginary part with -1)
+
+Complex neg()
+---
+Negates the number (multiplies both the real and imaginary part with -1) in order to get the additive inverse
+
+Complex floor([places=0])
+---
+Floors the complex number parts towards zero
+
+Complex ceil([places=0])
+---
+Ceils the complex number parts off zero
+
+Complex round([places=0])
+---
+Rounds the complex number parts
+
+boolean equals(n)
+---
+Checks if both numbers are exactly the same, if both numbers are infinite they
+are considered **not** equal.
+
+boolean isNaN()
+---
+Checks if the given number is not a number
+
+boolean isFinite()
+---
+Checks if the given number is finite
+
+Complex clone()
+---
+Returns a new Complex instance with the same real and imaginary properties
+
+Array toVector()
+---
+Returns a Vector of the actual complex number with two components
+
+String toString()
+---
+Returns a string representation of the actual number. As of v1.9.0 the output is a bit more human readable
+
+```javascript
+new Complex(1, 2).toString(); // 1 + 2i
+new Complex(0, 1).toString(); // i
+new Complex(9, 0).toString(); // 9
+new Complex(1, 1).toString(); // 1 + i
+```
+
+double valueOf()
+---
+Returns the real part of the number if imaginary part is zero. Otherwise `null`
+
+
+## Trigonometric functions
+
+The following trigonometric functions are defined on Complex.js:
+
+| Trig | Arcus | Hyperbolic | Area-Hyperbolic |
+|------|-------|------------|------------------|
+| sin()  | asin()  | sinh()       | asinh()            |
+| cos()  | acos()  | cosh()       | acosh()            |
+| tan()  | atan()  | tanh()       | atanh()            |
+| cot()  | acot()  | coth()       | acoth()            |
+| sec()  | asec()  | sech()       | asech()            |
+| csc()  | acsc()  | csch()       | acsch()            |
+
+**Notes on branches & ranges.** Inverse trig on ℂ needs a branch choice. For `acot` there are two real-axis conventions:
+
+* **(Chosen) Textbook range (0, π) on ℝ.**
+  Gives familiar real values (`acot(1)=π/4`, `acot(0)=π/2`, `acot(-1)=3π/4`). With the principal complex branch this **necessarily causes a π jump across the negative real axis** (e.g., near `-1±i0` → `-π/4`, but on `-1` → `3π/4`).
+  **We implement this with `atan2(1, x)`** to select the correct quadrant and handle `x=0`.
+
+* **Alternative range (−π/2, π/2] on ℝ.**
+  Makes `acot(-1) = -π/4` and can avoid that specific jump **only if the entire complex branch is changed to match**. Using plain `atan(1/x)` silently adopts this convention, changes real outputs, is undefined at `x=0`, and still wouldn’t resolve the complex behavior without a broader policy change.
+
+We therefore prefer predictable, textbook real values and robust quadrant handling—hence `atan2(1, x)`-accepting the implied branch cut on ℝ⁻ by design.
+
+
+## Geometric Equivalence
+
+
+Complex numbers can also be seen as a vector in the 2D space. Here is a simple overview of basic operations and how to implement them with complex.js:
+
+New vector
+---
+```js
+let v1 = new Complex(1, 0);
+let v2 = new Complex(1, 1);
+```
+
+Scale vector
+---
+```js
+scale(v1, factor):= v1.mul(factor)
+```
+
+Vector norm
+---
+```js
+norm(v):= v.abs()
+```
+
+Translate vector
+---
+```js
+translate(v1, v2):= v1.add(v2)
+```
+
+Rotate vector around center
+---
+```js
+rotate(v, angle):= v.mul({abs: 1, arg: angle})
+```
+
+Rotate vector around a point
+---
+```js
+rotate(v, p, angle):= v.sub(p).mul({abs: 1, arg: angle}).add(p)
+```
+
+Distance to another vector
+---
+```js
+distance(v1, v2):= v1.sub(v2).abs()
+```
+
+## Constants
+
+
+Complex.ZERO
+---
+A complex zero value (south pole on the Riemann Sphere)
+
+Complex.ONE
+---
+A complex one instance
+
+Complex.INFINITY
+---
+A complex infinity value (north pole on the Riemann Sphere)
+
+Complex.NAN
+---
+A complex NaN value (not on the Riemann Sphere)
+
+Complex.I
+---
+An imaginary number i instance
+
+Complex.PI
+---
+A complex PI instance
+
+Complex.E
+---
+A complex euler number instance
+
+Complex.EPSILON
+---
+A small epsilon value used for `equals()` comparison in order to circumvent double imprecision.
+
+
+## Installation
+
+You can install `Complex.js` via npm:
+
+```bash
+npm install complex.js
+```
+
+Or with yarn:
+
+```bash
+yarn add complex.js
+```
+
+Alternatively, download or clone the repository:
+
+```bash
+git clone https://github.com/rawify/Complex.js
+```
+
+## Usage
+
+Include the `complex.min.js` file in your project:
+
+```html
+<script src="path/to/complex.min.js"></script>
+<script>
+    console.log(Complex("4+3i"));
+</script>
+```
+
+Or in a Node.js project:
+
+```javascript
+const Complex = require('complex.js');
+```
+
+or 
+
+```javascript
+import Complex from 'complex.js';
+```
+
+
+## Coding Style
+
+As every library I publish, Complex.js is also built to be as small as possible after compressing it with Google Closure Compiler in advanced mode. Thus the coding style orientates a little on maxing-out the compression rate. Please make sure you keep this style if you plan to extend the library.
+
+## Building the library
+
+After cloning the Git repository run:
+
+```
+npm install
+npm run build
+```
+
+## Run a test
+
+Testing the source against the shipped test suite is as easy as
+
+```
+npm run test
+```
+
+## Copyright and Licensing
+
+Copyright (c) 2025, [Robert Eisele](https://raw.org/)
+Licensed under the MIT license.
diff --git a/node_modules/complex.js/complex.d.ts b/node_modules/complex.js/complex.d.ts
new file mode 100644
index 0000000..37003f1
--- /dev/null
+++ b/node_modules/complex.js/complex.d.ts
@@ -0,0 +1,323 @@
+type AValue =
+  | Complex
+  | { im: number; re: number }
+  | { abs: number; arg: number }
+  | { r: number; phi: number }
+  | [number, number]
+  | string
+  | number
+  | null
+  | undefined;
+type BValue = number | undefined;
+
+export function Complex(a: AValue, b?: BValue): Complex;
+
+export default Complex;
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * var c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+export class Complex {
+  re: number;
+  im: number;
+
+  constructor(a: AValue, b?: BValue);
+
+  /**
+   * Calculates the sign of a complex number, which is a normalized complex
+   *
+   */
+  sign(): Complex;
+  /**
+   * Adds two complex numbers
+   *
+   */
+  add(a: AValue, b?: BValue): Complex;
+  /**
+   * Subtracts two complex numbers
+   *
+   */
+  sub(a: AValue, b?: BValue): Complex;
+  /**
+   * Multiplies two complex numbers
+   *
+   */
+  mul(a: AValue, b?: BValue): Complex;
+  /**
+   * Divides two complex numbers
+   *
+   */
+  div(a: AValue, b?: BValue): Complex;
+  /**
+   * Calculate the power of two complex numbers
+   *
+   */
+  pow(a: AValue, b?: BValue): Complex;
+  /**
+   * Calculate the complex square root
+   *
+   */
+  sqrt(): Complex;
+  /**
+   * Calculate the complex exponent
+   *
+   */
+  exp(): Complex;
+  /**
+   * Calculate the complex exponent and subtracts one.
+   *
+   * This may be more accurate than `Complex(x).exp().sub(1)` if
+   * `x` is small.
+   *
+   */
+  expm1(): Complex;
+  /**
+   * Calculate the natural log
+   *
+   */
+  log(): Complex;
+  /**
+   * Calculate the magnitude of the complex number
+   *
+   */
+  abs(): number;
+  /**
+   * Calculate the angle of the complex number
+   *
+   */
+  arg(): number;
+  /**
+   * Calculate the sine of the complex number
+   *
+   */
+  sin(): Complex;
+  /**
+   * Calculate the cosine
+   *
+   */
+  cos(): Complex;
+  /**
+   * Calculate the tangent
+   *
+   */
+  tan(): Complex;
+  /**
+   * Calculate the cotangent
+   *
+   */
+  cot(): Complex;
+  /**
+   * Calculate the secant
+   *
+   */
+  sec(): Complex;
+  /**
+   * Calculate the cosecans
+   *
+   */
+  csc(): Complex;
+  /**
+   * Calculate the complex arcus sinus
+   *
+   */
+  asin(): Complex;
+  /**
+   * Calculate the complex arcus cosinus
+   *
+   */
+  acos(): Complex;
+  /**
+   * Calculate the complex arcus tangent
+   *
+   */
+  atan(): Complex;
+  /**
+   * Calculate the complex arcus cotangent
+   *
+   */
+  acot(): Complex;
+  /**
+   * Calculate the complex arcus secant
+   *
+   */
+  asec(): Complex;
+  /**
+   * Calculate the complex arcus cosecans
+   *
+   */
+  acsc(): Complex;
+  /**
+   * Calculate the complex sinh
+   *
+   */
+  sinh(): Complex;
+  /**
+   * Calculate the complex cosh
+   *
+   */
+  cosh(): Complex;
+  /**
+   * Calculate the complex tanh
+   *
+   */
+  tanh(): Complex;
+  /**
+   * Calculate the complex coth
+   *
+   */
+  coth(): Complex;
+  /**
+   * Calculate the complex coth
+   *
+   */
+  csch(): Complex;
+  /**
+   * Calculate the complex sech
+   *
+   */
+  sech(): Complex;
+  /**
+   * Calculate the complex asinh
+   *
+   */
+  asinh(): Complex;
+  /**
+   * Calculate the complex acosh
+   *
+   */
+  acosh(): Complex;
+  /**
+   * Calculate the complex atanh
+   *
+   */
+  atanh(): Complex;
+  /**
+   * Calculate the complex acoth
+   *
+   */
+  acoth(): Complex;
+  /**
+   * Calculate the complex acsch
+   *
+   */
+  acsch(): Complex;
+  /**
+   * Calculate the complex asech
+   *
+   */
+  asech(): Complex;
+  /**
+   * Calculate the complex inverse 1/z
+   *
+   */
+  inverse(): Complex;
+  /**
+   * Returns the complex conjugate
+   *
+   */
+  conjugate(): Complex;
+  /**
+   * Gets the negated complex number
+   *
+   */
+  neg(): Complex;
+  /**
+   * Ceils the actual complex number
+   *
+   */
+  ceil(places: number): Complex;
+  /**
+   * Floors the actual complex number
+   *
+   */
+  floor(places: number): Complex;
+  /**
+   * Ceils the actual complex number
+   *
+   */
+  round(places: number): Complex;
+  /**
+   * Compares two complex numbers
+   *
+   * **Note:** new Complex(Infinity).equals(Infinity) === false
+   *
+   */
+  equals(a: AValue, b?: BValue): boolean;
+  /**
+   * Clones the actual object
+   *
+   */
+  clone(): Complex;
+  /**
+   * Gets a string of the actual complex number
+   *
+   */
+  toString(): string;
+  /**
+   * Returns the actual number as a vector
+   *
+   */
+  toVector(): number[];
+  /**
+   * Returns the actual real value of the current object
+   *
+   * @returns {number|null}
+   */
+  valueOf(): number | null;
+  /**
+   * Determines whether a complex number is not on the Riemann sphere.
+   *
+   */
+  isNaN(): boolean;
+  /**
+   * Determines whether or not a complex number is at the zero pole of the
+   * Riemann sphere.
+   *
+   */
+  isZero(): boolean;
+  /**
+   * Determines whether a complex number is not at the infinity pole of the
+   * Riemann sphere.
+   *
+   */
+  isFinite(): boolean;
+  /**
+   * Determines whether or not a complex number is at the infinity pole of the
+   * Riemann sphere.
+   *
+   */
+  isInfinite(): boolean;
+
+  static ZERO: Complex;
+  static ONE: Complex;
+  static I: Complex;
+  static PI: Complex;
+  static E: Complex;
+  static INFINITY: Complex;
+  static NAN: Complex;
+  static EPSILON: number;
+}
diff --git a/node_modules/complex.js/dist/complex.js b/node_modules/complex.js/dist/complex.js
new file mode 100644
index 0000000..11ff7ec
--- /dev/null
+++ b/node_modules/complex.js/dist/complex.js
@@ -0,0 +1,1476 @@
+'use strict';
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * const c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+
+
+const cosh = Math.cosh || function (x) {
+  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;
+};
+
+const sinh = Math.sinh || function (x) {
+  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;
+};
+
+/**
+ * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).
+ *
+ * @param {number} x
+ * @returns {number} cos(x) - 1
+ */
+const cosm1 = x => {
+  // cos(x) - 1 = − 2sin^2(x / 2)
+  const s = Math.sin(0.5 * x);
+  return -2 * s * s;
+};
+
+const hypot = function (x, y) {
+
+  x = Math.abs(x);
+  y = Math.abs(y);
+
+  // Ensure `x` is the larger value
+  if (x < y) [x, y] = [y, x];
+
+  // If both are below the threshold, use straightforward Pythagoras
+  if (x < 1e8) return Math.sqrt(x * x + y * y);
+
+  // For larger values, scale to avoid overflow
+  y /= x;
+  return x * Math.sqrt(1 + y * y);
+};
+
+const parser_exit = function () {
+  throw SyntaxError('Invalid Param');
+};
+
+/**
+ * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows
+ *
+ * @param {number} a
+ * @param {number} b
+ * @returns {number}
+ */
+function logHypot(a, b) {
+
+  const _a = Math.abs(a);
+  const _b = Math.abs(b);
+
+  if (a === 0) {
+    return Math.log(_b);
+  }
+
+  if (b === 0) {
+    return Math.log(_a);
+  }
+
+  if (_a < 3000 && _b < 3000) {
+    return Math.log(a * a + b * b) * 0.5;
+  }
+
+  /* I got 4 ideas to compute this property without overflow:
+   *
+   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate
+   *
+   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)
+
+   Math.log(a * a + b * b) / 2
+
+   *
+   *
+   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
+
+   const fn = function(a, b) {
+   a = Math.abs(a);
+   b = Math.abs(b);
+   let t = Math.min(a, b);
+   a = Math.max(a, b);
+   t = t / a;
+
+   return Math.log(a) + Math.log(1 + t * t) / 2;
+   };
+
+   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)
+
+   Math.log(a / Math.cos(Math.atan2(b, a)))
+
+   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)
+
+   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))
+
+   */
+
+  a = a * 0.5;
+  b = b * 0.5;
+
+  return 0.5 * Math.log(a * a + b * b) + Math.LN2;
+}
+
+const P = { 're': 0, 'im': 0 };
+const parse = function (a, b) {
+
+  const z = P;
+
+  if (a === undefined || a === null) {
+    z['re'] =
+      z['im'] = 0;
+  } else if (b !== undefined) {
+    z['re'] = a;
+    z['im'] = b;
+  } else
+    switch (typeof a) {
+
+      case 'object':
+
+        if ('im' in a && 're' in a) {
+          z['re'] = a['re'];
+          z['im'] = a['im'];
+        } else if ('abs' in a && 'arg' in a) {
+          if (!isFinite(a['abs']) && isFinite(a['arg'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['abs'] * Math.cos(a['arg']);
+          z['im'] = a['abs'] * Math.sin(a['arg']);
+        } else if ('r' in a && 'phi' in a) {
+          if (!isFinite(a['r']) && isFinite(a['phi'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['r'] * Math.cos(a['phi']);
+          z['im'] = a['r'] * Math.sin(a['phi']);
+        } else if (a.length === 2) { // Quick array check
+          z['re'] = a[0];
+          z['im'] = a[1];
+        } else {
+          parser_exit();
+        }
+        break;
+
+      case 'string':
+
+        z['im'] = /* void */
+          z['re'] = 0;
+
+        const tokens = a.replace(/_/g, '')
+          .match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
+        let plus = 1;
+        let minus = 0;
+
+        if (tokens === null) {
+          parser_exit();
+        }
+
+        for (let i = 0; i < tokens.length; i++) {
+
+          const c = tokens[i];
+
+          if (c === ' ' || c === '\t' || c === '\n') {
+            /* void */
+          } else if (c === '+') {
+            plus++;
+          } else if (c === '-') {
+            minus++;
+          } else if (c === 'i' || c === 'I') {
+
+            if (plus + minus === 0) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);
+              i++;
+            } else {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');
+            }
+            plus = minus = 0;
+
+          } else {
+
+            if (plus + minus === 0 || isNaN(c)) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);
+              i++;
+            } else {
+              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);
+            }
+            plus = minus = 0;
+          }
+        }
+
+        // Still something on the stack
+        if (plus + minus > 0) {
+          parser_exit();
+        }
+        break;
+
+      case 'number':
+        z['im'] = 0;
+        z['re'] = a;
+        break;
+
+      default:
+        parser_exit();
+    }
+
+  if (isNaN(z['re']) || isNaN(z['im'])) {
+    // If a calculation is NaN, we treat it as NaN and don't throw
+    //parser_exit();
+  }
+
+  return z;
+};
+
+/**
+ * @constructor
+ * @returns {Complex}
+ */
+function Complex(a, b) {
+
+  if (!(this instanceof Complex)) {
+    return new Complex(a, b);
+  }
+
+  const z = parse(a, b);
+
+  this['re'] = z['re'];
+  this['im'] = z['im'];
+}
+
+Complex.prototype = {
+
+  're': 0,
+  'im': 0,
+
+  /**
+   * Calculates the sign of a complex number, which is a normalized complex
+   *
+   * @returns {Complex}
+   */
+  'sign': function () {
+
+    const abs = hypot(this['re'], this['im']);
+
+    return new Complex(
+      this['re'] / abs,
+      this['im'] / abs);
+  },
+
+  /**
+   * Adds two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'add': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity + Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity + z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] + z['re'],
+      this['im'] + z['im']);
+  },
+
+  /**
+   * Subtracts two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'sub': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity - Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity - z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] - z['re'],
+      this['im'] - z['im']);
+  },
+
+  /**
+   * Multiplies two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'mul': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // Infinity * 0 = NaN
+    if (tInfin && zIsZero || zInfin && tIsZero) {
+      return Complex['NAN'];
+    }
+
+    // Infinity * z = Infinity { where z != 0 }
+    if (tInfin || zInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // Shortcut for real values
+    if (z['im'] === 0 && this['im'] === 0) {
+      return new Complex(this['re'] * z['re'], 0);
+    }
+
+    return new Complex(
+      this['re'] * z['re'] - this['im'] * z['im'],
+      this['re'] * z['im'] + this['im'] * z['re']);
+  },
+
+  /**
+   * Divides two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'div': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // 0 / 0 = NaN and Infinity / Infinity = NaN
+    if (tIsZero && zIsZero || tInfin && zInfin) {
+      return Complex['NAN'];
+    }
+
+    // Infinity / 0 = Infinity
+    if (zIsZero || tInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // 0 / Infinity = 0
+    if (tIsZero || zInfin) {
+      return Complex['ZERO'];
+    }
+
+    if (0 === z['im']) {
+      // Divisor is real
+      return new Complex(this['re'] / z['re'], this['im'] / z['re']);
+    }
+
+    if (Math.abs(z['re']) < Math.abs(z['im'])) {
+
+      const x = z['re'] / z['im'];
+      const t = z['re'] * x + z['im'];
+
+      return new Complex(
+        (this['re'] * x + this['im']) / t,
+        (this['im'] * x - this['re']) / t);
+
+    } else {
+
+      const x = z['im'] / z['re'];
+      const t = z['im'] * x + z['re'];
+
+      return new Complex(
+        (this['re'] + this['im'] * x) / t,
+        (this['im'] - this['re'] * x) / t);
+    }
+  },
+
+  /**
+   * Calculate the power of two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'pow': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    if (zIsZero) {
+      return Complex['ONE'];
+    }
+
+    // If the exponent is real
+    if (z['im'] === 0) {
+
+      if (this['im'] === 0 && this['re'] > 0) {
+
+        return new Complex(Math.pow(this['re'], z['re']), 0);
+
+      } else if (this['re'] === 0) { // If base is fully imaginary
+
+        switch ((z['re'] % 4 + 4) % 4) {
+          case 0:
+            return new Complex(Math.pow(this['im'], z['re']), 0);
+          case 1:
+            return new Complex(0, Math.pow(this['im'], z['re']));
+          case 2:
+            return new Complex(-Math.pow(this['im'], z['re']), 0);
+          case 3:
+            return new Complex(0, -Math.pow(this['im'], z['re']));
+        }
+      }
+    }
+
+    /* I couldn't find a good formula, so here is a derivation and optimization
+     *
+     * z_1^z_2 = (a + bi)^(c + di)
+     *         = exp((c + di) * log(a + bi)
+     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))
+     * =>...
+     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     *
+     * =>...
+     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     *
+     * =>
+     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))
+     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))
+     *
+     */
+
+    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero
+      return Complex['ZERO'];
+    }
+
+    const arg = Math.atan2(this['im'], this['re']);
+    const loh = logHypot(this['re'], this['im']);
+
+    let re = Math.exp(z['re'] * loh - z['im'] * arg);
+    let im = z['im'] * loh + z['re'] * arg;
+    return new Complex(
+      re * Math.cos(im),
+      re * Math.sin(im));
+  },
+
+  /**
+   * Calculate the complex square root
+   *
+   * @returns {Complex}
+   */
+  'sqrt': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      // Real number case
+      if (a >= 0) {
+        return new Complex(Math.sqrt(a), 0);
+      } else {
+        return new Complex(0, Math.sqrt(-a));
+      }
+    }
+
+    const r = hypot(a, b);
+
+    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)
+    let im = Math.abs(b) / (2 * re);
+
+    if (a >= 0) {
+      return new Complex(re, b < 0 ? -im : im);
+    } else {
+      return new Complex(im, b < 0 ? -re : re);
+    }
+  },
+
+  /**
+   * Calculate the complex exponent
+   *
+   * @returns {Complex}
+   */
+  'exp': function () {
+
+    const er = Math.exp(this['re']);
+
+    if (this['im'] === 0) {
+      return new Complex(er, 0);
+    }
+    return new Complex(
+      er * Math.cos(this['im']),
+      er * Math.sin(this['im']));
+  },
+
+  /**
+   * Calculate the complex exponent and subtracts one.
+   *
+   * This may be more accurate than `Complex(x).exp().sub(1)` if
+   * `x` is small.
+   *
+   * @returns {Complex}
+   */
+  'expm1': function () {
+
+    /**
+     * exp(a + i*b) - 1
+     = exp(a) * (cos(b) + j*sin(b)) - 1
+     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
+     */
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.expm1(a) * Math.cos(b) + cosm1(b),
+      Math.exp(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the natural log
+   *
+   * @returns {Complex}
+   */
+  'log': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0 && a > 0) {
+      return new Complex(Math.log(a), 0);
+    }
+
+    return new Complex(
+      logHypot(a, b),
+      Math.atan2(b, a));
+  },
+
+  /**
+   * Calculate the magnitude of the complex number
+   *
+   * @returns {number}
+   */
+  'abs': function () {
+
+    return hypot(this['re'], this['im']);
+  },
+
+  /**
+   * Calculate the angle of the complex number
+   *
+   * @returns {number}
+   */
+  'arg': function () {
+
+    return Math.atan2(this['im'], this['re']);
+  },
+
+  /**
+   * Calculate the sine of the complex number
+   *
+   * @returns {Complex}
+   */
+  'sin': function () {
+
+    // sin(z) = ( e^iz - e^-iz ) / 2i 
+    //        = sin(a)cosh(b) + i cos(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.sin(a) * cosh(b),
+      Math.cos(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the cosine
+   *
+   * @returns {Complex}
+   */
+  'cos': function () {
+
+    // cos(z) = ( e^iz + e^-iz ) / 2 
+    //        = cos(a)cosh(b) - i sin(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.cos(a) * cosh(b),
+      -Math.sin(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the tangent
+   *
+   * @returns {Complex}
+   */
+  'tan': function () {
+
+    // tan(z) = sin(z) / cos(z) 
+    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )
+    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )
+    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) + cosh(b);
+
+    return new Complex(
+      Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cotangent
+   *
+   * @returns {Complex}
+   */
+  'cot': function () {
+
+    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) - cosh(b);
+
+    return new Complex(
+      -Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the secant
+   *
+   * @returns {Complex}
+   */
+  'sec': function () {
+
+    // sec(c) = 2 / (e^(ci) + e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.cos(a) * cosh(b) / d,
+      Math.sin(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cosecans
+   *
+   * @returns {Complex}
+   */
+  'csc': function () {
+
+    // csc(c) = 2i / (e^(ci) - e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.sin(a) * cosh(b) / d,
+      -Math.cos(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the complex arcus sinus
+   *
+   * @returns {Complex}
+   */
+  'asin': function () {
+
+    // asin(c) = -i * log(ci + sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(t2['im'], -t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cosinus
+   *
+   * @returns {Complex}
+   */
+  'acos': function () {
+
+    // acos(c) = i * log(c - i * sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(Math.PI / 2 - t2['im'], t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus tangent
+   *
+   * @returns {Complex}
+   */
+  'atan': function () {
+
+    // atan(c) = i / 2 log((i + x) / (i - x))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0) {
+
+      if (b === 1) {
+        return new Complex(0, Infinity);
+      }
+
+      if (b === -1) {
+        return new Complex(0, -Infinity);
+      }
+    }
+
+    const d = a * a + (1.0 - b) * (1.0 - b);
+
+    const t1 = new Complex(
+      (1 - b * b - a * a) / d,
+      -2 * a / d).log();
+
+    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cotangent
+   *
+   * @returns {Complex}
+   */
+  'acot': function () {
+
+    // acot(c) = i / 2 log((c - i) / (c + i))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      return new Complex(Math.atan2(1, a), 0);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).atan()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).atan();
+  },
+
+  /**
+   * Calculate the complex arcus secant
+   *
+   * @returns {Complex}
+   */
+  'asec': function () {
+
+    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(0, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).acos()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).acos();
+  },
+
+  /**
+   * Calculate the complex arcus cosecans
+   *
+   * @returns {Complex}
+   */
+  'acsc': function () {
+
+    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(Math.PI / 2, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).asin()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).asin();
+  },
+
+  /**
+   * Calculate the complex sinh
+   *
+   * @returns {Complex}
+   */
+  'sinh': function () {
+
+    // sinh(c) = (e^c - e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      sinh(a) * Math.cos(b),
+      cosh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex cosh
+   *
+   * @returns {Complex}
+   */
+  'cosh': function () {
+
+    // cosh(c) = (e^c + e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      cosh(a) * Math.cos(b),
+      sinh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex tanh
+   *
+   * @returns {Complex}
+   */
+  'tanh': function () {
+
+    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) + Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex coth
+   *
+   * @returns {Complex}
+   */
+  'coth': function () {
+
+    // coth(c) = (e^c + e^-c) / (e^c - e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) - Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      -Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex csch
+   *
+   * @returns {Complex}
+   */
+  'csch': function () {
+
+    // csch(c) = 2 / (e^c - e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) - cosh(2 * a);
+
+    return new Complex(
+      -2 * sinh(a) * Math.cos(b) / d,
+      2 * cosh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex sech
+   *
+   * @returns {Complex}
+   */
+  'sech': function () {
+
+    // sech(c) = 2 / (e^c + e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) + cosh(2 * a);
+
+    return new Complex(
+      2 * cosh(a) * Math.cos(b) / d,
+      -2 * sinh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex asinh
+   *
+   * @returns {Complex}
+   */
+  'asinh': function () {
+
+    // asinh(z) = log(z + sqrt(z^2 + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a
+      const x = Math.abs(a);
+      const r = Math.log(x + Math.sqrt(x * x + 1));
+
+      return new Complex(a < 0 ? -r : r, 0);
+    }
+
+    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)
+    const re2 = a * a - b * b + 1;
+    const im2 = 2 * a * b;
+
+    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)
+
+    return new Complex(a + t['re'], b + t['im'])['log']();
+  },
+
+  /**
+   * Calculate the complex acosh
+   *
+   * @returns {Complex}
+   */
+  'acosh': function () {
+
+    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a is real
+      if (a > 1) {
+        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1
+        return new Complex(
+          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);
+      }
+
+      if (a < -1) {
+        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1
+        const t = Math.sqrt(a * a - 1);
+        return new Complex(Math.log(-a + t), Math.PI);
+      }
+
+      // -1 <= a <= 1 : purely imaginary
+      // acosh(a) = i * acos(a)
+      return new Complex(0, Math.acos(a));
+    }
+
+    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)
+    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)
+
+    return new Complex(
+      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],
+      b + t1['re'] * t2['im'] + t1['im'] * t2['re']
+    )['log']();
+  },
+
+  /**
+   * Calculate the complex atanh
+   *
+   * @returns {Complex}
+   */
+  'atanh': function () {
+
+    // atanh(z) = log((1 + z) / (1 - z)) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      if (a === 1) {
+        // limit x -> 1^- atanh(x) = +Infinity
+        return new Complex(Infinity, 0);
+      }
+
+      if (a === -1) {
+        // limit x -> -1^+ atanh(x) = -Infinity
+        return new Complex(-Infinity, 0);
+      }
+
+      if (-1 < a && a < 1) {
+        // Purely real
+        return new Complex(
+          0.5 * Math.log((1 + a) / (1 - a)),
+          0
+        );
+      }
+
+      if (a > 1) {
+        // Our branch: Im(atanh(a)) = -π/2 for a > 1
+        const t = (a + 1) / (a - 1); // > 0
+        return new Complex(
+          0.5 * Math.log(t),
+          -Math.PI / 2
+        );
+      }
+
+      // a < -1: Im(atanh(a)) = +π/2
+      const t = (1 + a) / (1 - a); // < 0
+      return new Complex(
+        0.5 * Math.log(-t), // log((1 - a)/(1 + a))
+        Math.PI / 2
+      );
+    }
+
+    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.
+    const oneMinus = 1 - a;
+    const onePlus = 1 + a;
+    const d = oneMinus * oneMinus + b * b; // |1 - z|^2
+
+    if (d === 0) {
+      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.
+      // If we ever get here, just propagate infinities consistently:
+      return new Complex(
+        (a !== -1) ? (a / 0) : 0,
+        (b !== 0) ? (b / 0) : 0
+      );
+    }
+
+    // (1 + z) / (1 - z) with a single complex division
+    const xr = (onePlus * oneMinus - b * b) / d;
+    const xi = (b * oneMinus + onePlus * b) / d;
+
+    // 0.5 * log(xr + i xi)
+    return new Complex(
+      logHypot(xr, xi) / 2,
+      Math.atan2(xi, xr) / 2
+    );
+  },
+
+  /**
+   * Calculate the complex acoth
+   *
+   * @returns {Complex}
+   */
+  'acoth': function () {
+
+    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    // z = 0 -> acoth(0) = i * π / 2  (log((1+0)/(1-0))/2 = log(-1)/2)
+    if (a === 0 && b === 0) {
+      return new Complex(0, Math.PI / 2);
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['atanh']();
+    }
+
+    // Fallback for weird infinities/NaNs: mirror other functions' style
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0
+    )['atanh']();
+  },
+
+  /**
+   * Calculate the complex acsch
+   *
+   * @returns {Complex}
+   */
+  'acsch': function () {
+
+    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a real
+      if (a === 0) {
+        // acsch(0) -> +/- Infinity, we keep your previous behavior
+        return new Complex(Infinity, 0);
+      }
+
+      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))
+      const inv = 1 / a;
+      return new Complex(
+        Math.log(inv + Math.sqrt(inv * inv + 1)),
+        0
+      );
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1/z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['asinh']();
+    }
+
+    // Handle 0 + 0i or infinities in the same spirit as your existing code
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['asinh']();
+  },
+
+  /**
+   * Calculate the complex asech
+   *
+   * @returns {Complex}
+   */
+  'asech': function () {
+
+    // asech(z) = acosh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (this['isZero']()) {
+      // asech(0) = acosh(∞) -> ∞
+      return Complex['INFINITY'];
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['acosh']();
+    }
+
+    // Fallback for weird infinities/NaNs
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['acosh']();
+  },
+
+  /**
+   * Calculate the complex inverse 1/z
+   *
+   * @returns {Complex}
+   */
+  'inverse': function () {
+
+    // 1 / 0 = Infinity and 1 / Infinity = 0
+    if (this['isZero']()) {
+      return Complex['INFINITY'];
+    }
+
+    if (this['isInfinite']()) {
+      return Complex['ZERO'];
+    }
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const d = a * a + b * b;
+
+    return new Complex(a / d, -b / d);
+  },
+
+  /**
+   * Returns the complex conjugate
+   *
+   * @returns {Complex}
+   */
+  'conjugate': function () {
+
+    return new Complex(this['re'], -this['im']);
+  },
+
+  /**
+   * Gets the negated complex number
+   *
+   * @returns {Complex}
+   */
+  'neg': function () {
+
+    return new Complex(-this['re'], -this['im']);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'ceil': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.ceil(this['re'] * places) / places,
+      Math.ceil(this['im'] * places) / places);
+  },
+
+  /**
+   * Floors the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'floor': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.floor(this['re'] * places) / places,
+      Math.floor(this['im'] * places) / places);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'round': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.round(this['re'] * places) / places,
+      Math.round(this['im'] * places) / places);
+  },
+
+  /**
+   * Compares two complex numbers
+   *
+   * **Note:** new Complex(Infinity).equals(Infinity) === false
+   *
+   * @returns {boolean}
+   */
+  'equals': function (a, b) {
+
+    const z = parse(a, b);
+
+    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
+      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * @returns {Complex}
+   */
+  'clone': function () {
+
+    return new Complex(this['re'], this['im']);
+  },
+
+  /**
+   * Gets a string of the actual complex number
+   *
+   * @returns {string}
+   */
+  'toString': function () {
+
+    let a = this['re'];
+    let b = this['im'];
+    let ret = "";
+
+    if (this['isNaN']()) {
+      return 'NaN';
+    }
+
+    if (this['isInfinite']()) {
+      return 'Infinity';
+    }
+
+    if (Math.abs(a) < Complex['EPSILON']) {
+      a = 0;
+    }
+
+    if (Math.abs(b) < Complex['EPSILON']) {
+      b = 0;
+    }
+
+    // If is real number
+    if (b === 0) {
+      return ret + a;
+    }
+
+    if (a !== 0) {
+      ret += a;
+      ret += " ";
+      if (b < 0) {
+        b = -b;
+        ret += "-";
+      } else {
+        ret += "+";
+      }
+      ret += " ";
+    } else if (b < 0) {
+      b = -b;
+      ret += "-";
+    }
+
+    if (1 !== b) { // b is the absolute imaginary part
+      ret += b;
+    }
+    return ret + "i";
+  },
+
+  /**
+   * Returns the actual number as a vector
+   *
+   * @returns {Array}
+   */
+  'toVector': function () {
+
+    return [this['re'], this['im']];
+  },
+
+  /**
+   * Returns the actual real value of the current object
+   *
+   * @returns {number|null}
+   */
+  'valueOf': function () {
+
+    if (this['im'] === 0) {
+      return this['re'];
+    }
+    return null;
+  },
+
+  /**
+   * Determines whether a complex number is not on the Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isNaN': function () {
+    return isNaN(this['re']) || isNaN(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the zero pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isZero': function () {
+    return this['im'] === 0 && this['re'] === 0;
+  },
+
+  /**
+   * Determines whether a complex number is not at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isFinite': function () {
+    return isFinite(this['re']) && isFinite(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isInfinite': function () {
+    return !this['isFinite']();
+  }
+};
+
+Complex['ZERO'] = new Complex(0, 0);
+Complex['ONE'] = new Complex(1, 0);
+Complex['I'] = new Complex(0, 1);
+Complex['PI'] = new Complex(Math.PI, 0);
+Complex['E'] = new Complex(Math.E, 0);
+Complex['INFINITY'] = new Complex(Infinity, Infinity);
+Complex['NAN'] = new Complex(NaN, NaN);
+Complex['EPSILON'] = 1e-15;
+
+Object.defineProperty(Complex, "__esModule", { 'value': true });
+Complex['default'] = Complex;
+Complex['Complex'] = Complex;
+module['exports'] = Complex;
diff --git a/node_modules/complex.js/dist/complex.min.js b/node_modules/complex.js/dist/complex.min.js
new file mode 100644
index 0000000..37c9da1
--- /dev/null
+++ b/node_modules/complex.js/dist/complex.min.js
@@ -0,0 +1,27 @@
+/*
+Complex.js v2.4.3 11/13/2025
+https://raw.org/article/complex-numbers-in-javascript/
+
+Copyright (c) 2025, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+'use strict';(function(q){function l(a,b){if(a===void 0||a===null)f.re=f.im=0;else if(b!==void 0)f.re=a,f.im=b;else switch(typeof a){case "object":if("im"in a&&"re"in a)f.re=a.re,f.im=a.im;else if("abs"in a&&"arg"in a){if(!isFinite(a.abs)&&isFinite(a.arg))return c.INFINITY;f.re=a.abs*Math.cos(a.arg);f.im=a.abs*Math.sin(a.arg)}else if("r"in a&&"phi"in a){if(!isFinite(a.r)&&isFinite(a.phi))return c.INFINITY;f.re=a.r*Math.cos(a.phi);f.im=a.r*Math.sin(a.phi)}else a.length===2?(f.re=a[0],f.im=a[1]):m();
+break;case "string":f.im=f.re=0;a=a.replace(/_/g,"").match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);b=1;let d=0;a===null&&m();for(let e=0;e<a.length;e++){const g=a[e];g!==" "&&g!=="\t"&&g!=="\n"&&(g==="+"?b++:g==="-"?d++:(g==="i"||g==="I"?(b+d===0&&m(),a[e+1]===" "||isNaN(a[e+1])?f.im+=parseFloat((d%2?"-":"")+"1"):(f.im+=parseFloat((d%2?"-":"")+a[e+1]),e++)):((b+d===0||isNaN(g))&&m(),a[e+1]==="i"||a[e+1]==="I"?(f.im+=parseFloat((d%2?"-":"")+g),e++):f.re+=parseFloat((d%2?"-":"")+g)),b=d=0))}b+d>0&&
+m();break;case "number":f.im=0;f.re=a;break;default:m()}return f}function m(){throw SyntaxError("Invalid Param");}function n(a,b){a=Math.abs(a);b=Math.abs(b);a<b&&([a,b]=[b,a]);if(a<1E8)return Math.sqrt(a*a+b*b);b/=a;return a*Math.sqrt(1+b*b)}function p(a,b){const d=Math.abs(a),e=Math.abs(b);if(a===0)return Math.log(e);if(b===0)return Math.log(d);if(d<3E3&&e<3E3)return Math.log(a*a+b*b)*.5;a*=.5;b*=.5;return.5*Math.log(a*a+b*b)+Math.LN2}function c(a,b){if(!(this instanceof c))return new c(a,b);a=
+l(a,b);this.re=a.re;this.im=a.im}const h=Math.cosh||function(a){return Math.abs(a)<1E-9?1-a:(Math.exp(a)+Math.exp(-a))*.5},k=Math.sinh||function(a){return Math.abs(a)<1E-9?a:(Math.exp(a)-Math.exp(-a))*.5},f={re:0,im:0};c.prototype={re:0,im:0,sign:function(){const a=n(this.re,this.im);return new c(this.re/a,this.im/a)},add:function(a,b){a=l(a,b);b=this.isInfinite();const d=!(isFinite(a.re)&&isFinite(a.im));return b||d?b&&d?c.NAN:c.INFINITY:new c(this.re+a.re,this.im+a.im)},sub:function(a,b){a=l(a,
+b);b=this.isInfinite();const d=!(isFinite(a.re)&&isFinite(a.im));return b||d?b&&d?c.NAN:c.INFINITY:new c(this.re-a.re,this.im-a.im)},mul:function(a,b){a=l(a,b);b=this.isInfinite();const d=!(isFinite(a.re)&&isFinite(a.im)),e=this.re===0&&this.im===0,g=a.re===0&&a.im===0;return b&&g||d&&e?c.NAN:b||d?c.INFINITY:a.im===0&&this.im===0?new c(this.re*a.re,0):new c(this.re*a.re-this.im*a.im,this.re*a.im+this.im*a.re)},div:function(a,b){a=l(a,b);b=this.isInfinite();const d=!(isFinite(a.re)&&isFinite(a.im)),
+e=this.re===0&&this.im===0,g=a.re===0&&a.im===0;if(e&&g||b&&d)return c.NAN;if(g||b)return c.INFINITY;if(e||d)return c.ZERO;if(0===a.im)return new c(this.re/a.re,this.im/a.re);if(Math.abs(a.re)<Math.abs(a.im))return b=a.re/a.im,a=a.re*b+a.im,new c((this.re*b+this.im)/a,(this.im*b-this.re)/a);b=a.im/a.re;a=a.im*b+a.re;return new c((this.re+this.im*b)/a,(this.im-this.re*b)/a)},pow:function(a,b){a=l(a,b);b=this.re===0&&this.im===0;if(a.re===0&&a.im===0)return c.ONE;if(a.im===0){if(this.im===0&&this.re>
+0)return new c(Math.pow(this.re,a.re),0);if(this.re===0)switch((a.re%4+4)%4){case 0:return new c(Math.pow(this.im,a.re),0);case 1:return new c(0,Math.pow(this.im,a.re));case 2:return new c(-Math.pow(this.im,a.re),0);case 3:return new c(0,-Math.pow(this.im,a.re))}}if(b&&a.re>0)return c.ZERO;const d=Math.atan2(this.im,this.re),e=p(this.re,this.im);b=Math.exp(a.re*e-a.im*d);a=a.im*e+a.re*d;return new c(b*Math.cos(a),b*Math.sin(a))},sqrt:function(){const a=this.re,b=this.im;if(b===0)return a>=0?new c(Math.sqrt(a),
+0):new c(0,Math.sqrt(-a));var d=n(a,b);d=Math.sqrt(.5*(d+Math.abs(a)));let e=Math.abs(b)/(2*d);return a>=0?new c(d,b<0?-e:e):new c(e,b<0?-d:d)},exp:function(){const a=Math.exp(this.re);return this.im===0?new c(a,0):new c(a*Math.cos(this.im),a*Math.sin(this.im))},expm1:function(){const a=this.re,b=this.im,d=Math.sin(.5*b);return new c(Math.expm1(a)*Math.cos(b)+-2*d*d,Math.exp(a)*Math.sin(b))},log:function(){const a=this.re,b=this.im;return b===0&&a>0?new c(Math.log(a),0):new c(p(a,b),Math.atan2(b,
+a))},abs:function(){return n(this.re,this.im)},arg:function(){return Math.atan2(this.im,this.re)},sin:function(){const a=this.re,b=this.im;return new c(Math.sin(a)*h(b),Math.cos(a)*k(b))},cos:function(){const a=this.re,b=this.im;return new c(Math.cos(a)*h(b),-Math.sin(a)*k(b))},tan:function(){const a=2*this.re,b=2*this.im,d=Math.cos(a)+h(b);return new c(Math.sin(a)/d,k(b)/d)},cot:function(){const a=2*this.re,b=2*this.im,d=Math.cos(a)-h(b);return new c(-Math.sin(a)/d,k(b)/d)},sec:function(){const a=
+this.re,b=this.im,d=.5*h(2*b)+.5*Math.cos(2*a);return new c(Math.cos(a)*h(b)/d,Math.sin(a)*k(b)/d)},csc:function(){const a=this.re,b=this.im,d=.5*h(2*b)-.5*Math.cos(2*a);return new c(Math.sin(a)*h(b)/d,-Math.cos(a)*k(b)/d)},asin:function(){var a=this.re;const b=this.im,d=(new c(b*b-a*a+1,-2*a*b)).sqrt();a=(new c(d.re-b,d.im+a)).log();return new c(a.im,-a.re)},acos:function(){var a=this.re;const b=this.im,d=(new c(b*b-a*a+1,-2*a*b)).sqrt();a=(new c(d.re-b,d.im+a)).log();return new c(Math.PI/2-a.im,
+a.re)},atan:function(){var a=this.re;const b=this.im;if(a===0){if(b===1)return new c(0,Infinity);if(b===-1)return new c(0,-Infinity)}const d=a*a+(1-b)*(1-b);a=(new c((1-b*b-a*a)/d,-2*a/d)).log();return new c(-.5*a.im,.5*a.re)},acot:function(){const a=this.re,b=this.im;if(b===0)return new c(Math.atan2(1,a),0);const d=a*a+b*b;return d!==0?(new c(a/d,-b/d)).atan():(new c(a!==0?a/0:0,b!==0?-b/0:0)).atan()},asec:function(){const a=this.re,b=this.im;if(a===0&&b===0)return new c(0,Infinity);const d=a*a+
+b*b;return d!==0?(new c(a/d,-b/d)).acos():(new c(a!==0?a/0:0,b!==0?-b/0:0)).acos()},acsc:function(){const a=this.re,b=this.im;if(a===0&&b===0)return new c(Math.PI/2,Infinity);const d=a*a+b*b;return d!==0?(new c(a/d,-b/d)).asin():(new c(a!==0?a/0:0,b!==0?-b/0:0)).asin()},sinh:function(){const a=this.re,b=this.im;return new c(k(a)*Math.cos(b),h(a)*Math.sin(b))},cosh:function(){const a=this.re,b=this.im;return new c(h(a)*Math.cos(b),k(a)*Math.sin(b))},tanh:function(){const a=2*this.re,b=2*this.im,d=
+h(a)+Math.cos(b);return new c(k(a)/d,Math.sin(b)/d)},coth:function(){const a=2*this.re,b=2*this.im,d=h(a)-Math.cos(b);return new c(k(a)/d,-Math.sin(b)/d)},csch:function(){const a=this.re,b=this.im,d=Math.cos(2*b)-h(2*a);return new c(-2*k(a)*Math.cos(b)/d,2*h(a)*Math.sin(b)/d)},sech:function(){const a=this.re,b=this.im,d=Math.cos(2*b)+h(2*a);return new c(2*h(a)*Math.cos(b)/d,-2*k(a)*Math.sin(b)/d)},asinh:function(){const a=this.re;var b=this.im;if(b===0){if(a===0)return new c(0,0);b=Math.abs(a);b=
+Math.log(b+Math.sqrt(b*b+1));return new c(a<0?-b:b,0)}const d=(new c(a*a-b*b+1,2*a*b)).sqrt();return(new c(a+d.re,b+d.im)).log()},acosh:function(){const a=this.re,b=this.im;if(b===0)return a>1?new c(Math.log(a+Math.sqrt(a-1)*Math.sqrt(a+1)),0):a<-1?new c(Math.log(-a+Math.sqrt(a*a-1)),Math.PI):new c(0,Math.acos(a));const d=(new c(a-1,b)).sqrt(),e=(new c(a+1,b)).sqrt();return(new c(a+d.re*e.re-d.im*e.im,b+d.re*e.im+d.im*e.re)).log()},atanh:function(){var a=this.re,b=this.im;if(b===0)return a===0?new c(0,
+0):a===1?new c(Infinity,0):a===-1?new c(-Infinity,0):-1<a&&a<1?new c(.5*Math.log((1+a)/(1-a)),0):a>1?new c(.5*Math.log((a+1)/(a-1)),-Math.PI/2):new c(.5*Math.log(-((1+a)/(1-a))),Math.PI/2);const d=1-a,e=1+a,g=d*d+b*b;if(g===0)return new c(a!==-1?a/0:0,b!==0?b/0:0);a=(e*d-b*b)/g;b=(b*d+e*b)/g;return new c(p(a,b)/2,Math.atan2(b,a)/2)},acoth:function(){const a=this.re,b=this.im;if(a===0&&b===0)return new c(0,Math.PI/2);const d=a*a+b*b;return d!==0?(new c(a/d,-b/d)).atanh():(new c(a!==0?a/0:0,b!==0?-b/
+0:0)).atanh()},acsch:function(){var a=this.re;const b=this.im;if(b===0){if(a===0)return new c(Infinity,0);a=1/a;return new c(Math.log(a+Math.sqrt(a*a+1)),0)}const d=a*a+b*b;return d!==0?(new c(a/d,-b/d)).asinh():(new c(a!==0?a/0:0,b!==0?-b/0:0)).asinh()},asech:function(){const a=this.re,b=this.im;if(this.isZero())return c.INFINITY;const d=a*a+b*b;return d!==0?(new c(a/d,-b/d)).acosh():(new c(a!==0?a/0:0,b!==0?-b/0:0)).acosh()},inverse:function(){if(this.isZero())return c.INFINITY;if(this.isInfinite())return c.ZERO;
+const a=this.re,b=this.im,d=a*a+b*b;return new c(a/d,-b/d)},conjugate:function(){return new c(this.re,-this.im)},neg:function(){return new c(-this.re,-this.im)},ceil:function(a){a=Math.pow(10,a||0);return new c(Math.ceil(this.re*a)/a,Math.ceil(this.im*a)/a)},floor:function(a){a=Math.pow(10,a||0);return new c(Math.floor(this.re*a)/a,Math.floor(this.im*a)/a)},round:function(a){a=Math.pow(10,a||0);return new c(Math.round(this.re*a)/a,Math.round(this.im*a)/a)},equals:function(a,b){a=l(a,b);return Math.abs(a.re-
+this.re)<=c.EPSILON&&Math.abs(a.im-this.im)<=c.EPSILON},clone:function(){return new c(this.re,this.im)},toString:function(){let a=this.re,b=this.im,d="";if(this.isNaN())return"NaN";if(this.isInfinite())return"Infinity";Math.abs(a)<c.EPSILON&&(a=0);Math.abs(b)<c.EPSILON&&(b=0);if(b===0)return d+a;a!==0?(d=d+a+" ",b<0?(b=-b,d+="-"):d+="+",d+=" "):b<0&&(b=-b,d+="-");1!==b&&(d+=b);return d+"i"},toVector:function(){return[this.re,this.im]},valueOf:function(){return this.im===0?this.re:null},isNaN:function(){return isNaN(this.re)||
+isNaN(this.im)},isZero:function(){return this.im===0&&this.re===0},isFinite:function(){return isFinite(this.re)&&isFinite(this.im)},isInfinite:function(){return!this.isFinite()}};c.ZERO=new c(0,0);c.ONE=new c(1,0);c.I=new c(0,1);c.PI=new c(Math.PI,0);c.E=new c(Math.E,0);c.INFINITY=new c(Infinity,Infinity);c.NAN=new c(NaN,NaN);c.EPSILON=1E-15;typeof define==="function"&&define.amd?define([],function(){return c}):typeof exports==="object"?(Object.defineProperty(c,"__esModule",{value:!0}),c["default"]=
+c,c.Complex=c,module.exports=c):q.Complex=c})(this);
diff --git a/node_modules/complex.js/dist/complex.mjs b/node_modules/complex.js/dist/complex.mjs
new file mode 100644
index 0000000..19e3d0d
--- /dev/null
+++ b/node_modules/complex.js/dist/complex.mjs
@@ -0,0 +1,1474 @@
+'use strict';
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * const c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+
+
+const cosh = Math.cosh || function (x) {
+  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;
+};
+
+const sinh = Math.sinh || function (x) {
+  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;
+};
+
+/**
+ * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).
+ *
+ * @param {number} x
+ * @returns {number} cos(x) - 1
+ */
+const cosm1 = x => {
+  // cos(x) - 1 = − 2sin^2(x / 2)
+  const s = Math.sin(0.5 * x);
+  return -2 * s * s;
+};
+
+const hypot = function (x, y) {
+
+  x = Math.abs(x);
+  y = Math.abs(y);
+
+  // Ensure `x` is the larger value
+  if (x < y) [x, y] = [y, x];
+
+  // If both are below the threshold, use straightforward Pythagoras
+  if (x < 1e8) return Math.sqrt(x * x + y * y);
+
+  // For larger values, scale to avoid overflow
+  y /= x;
+  return x * Math.sqrt(1 + y * y);
+};
+
+const parser_exit = function () {
+  throw SyntaxError('Invalid Param');
+};
+
+/**
+ * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows
+ *
+ * @param {number} a
+ * @param {number} b
+ * @returns {number}
+ */
+function logHypot(a, b) {
+
+  const _a = Math.abs(a);
+  const _b = Math.abs(b);
+
+  if (a === 0) {
+    return Math.log(_b);
+  }
+
+  if (b === 0) {
+    return Math.log(_a);
+  }
+
+  if (_a < 3000 && _b < 3000) {
+    return Math.log(a * a + b * b) * 0.5;
+  }
+
+  /* I got 4 ideas to compute this property without overflow:
+   *
+   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate
+   *
+   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)
+
+   Math.log(a * a + b * b) / 2
+
+   *
+   *
+   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
+
+   const fn = function(a, b) {
+   a = Math.abs(a);
+   b = Math.abs(b);
+   let t = Math.min(a, b);
+   a = Math.max(a, b);
+   t = t / a;
+
+   return Math.log(a) + Math.log(1 + t * t) / 2;
+   };
+
+   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)
+
+   Math.log(a / Math.cos(Math.atan2(b, a)))
+
+   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)
+
+   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))
+
+   */
+
+  a = a * 0.5;
+  b = b * 0.5;
+
+  return 0.5 * Math.log(a * a + b * b) + Math.LN2;
+}
+
+const P = { 're': 0, 'im': 0 };
+const parse = function (a, b) {
+
+  const z = P;
+
+  if (a === undefined || a === null) {
+    z['re'] =
+      z['im'] = 0;
+  } else if (b !== undefined) {
+    z['re'] = a;
+    z['im'] = b;
+  } else
+    switch (typeof a) {
+
+      case 'object':
+
+        if ('im' in a && 're' in a) {
+          z['re'] = a['re'];
+          z['im'] = a['im'];
+        } else if ('abs' in a && 'arg' in a) {
+          if (!isFinite(a['abs']) && isFinite(a['arg'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['abs'] * Math.cos(a['arg']);
+          z['im'] = a['abs'] * Math.sin(a['arg']);
+        } else if ('r' in a && 'phi' in a) {
+          if (!isFinite(a['r']) && isFinite(a['phi'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['r'] * Math.cos(a['phi']);
+          z['im'] = a['r'] * Math.sin(a['phi']);
+        } else if (a.length === 2) { // Quick array check
+          z['re'] = a[0];
+          z['im'] = a[1];
+        } else {
+          parser_exit();
+        }
+        break;
+
+      case 'string':
+
+        z['im'] = /* void */
+          z['re'] = 0;
+
+        const tokens = a.replace(/_/g, '')
+          .match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
+        let plus = 1;
+        let minus = 0;
+
+        if (tokens === null) {
+          parser_exit();
+        }
+
+        for (let i = 0; i < tokens.length; i++) {
+
+          const c = tokens[i];
+
+          if (c === ' ' || c === '\t' || c === '\n') {
+            /* void */
+          } else if (c === '+') {
+            plus++;
+          } else if (c === '-') {
+            minus++;
+          } else if (c === 'i' || c === 'I') {
+
+            if (plus + minus === 0) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);
+              i++;
+            } else {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');
+            }
+            plus = minus = 0;
+
+          } else {
+
+            if (plus + minus === 0 || isNaN(c)) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);
+              i++;
+            } else {
+              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);
+            }
+            plus = minus = 0;
+          }
+        }
+
+        // Still something on the stack
+        if (plus + minus > 0) {
+          parser_exit();
+        }
+        break;
+
+      case 'number':
+        z['im'] = 0;
+        z['re'] = a;
+        break;
+
+      default:
+        parser_exit();
+    }
+
+  if (isNaN(z['re']) || isNaN(z['im'])) {
+    // If a calculation is NaN, we treat it as NaN and don't throw
+    //parser_exit();
+  }
+
+  return z;
+};
+
+/**
+ * @constructor
+ * @returns {Complex}
+ */
+function Complex(a, b) {
+
+  if (!(this instanceof Complex)) {
+    return new Complex(a, b);
+  }
+
+  const z = parse(a, b);
+
+  this['re'] = z['re'];
+  this['im'] = z['im'];
+}
+
+Complex.prototype = {
+
+  're': 0,
+  'im': 0,
+
+  /**
+   * Calculates the sign of a complex number, which is a normalized complex
+   *
+   * @returns {Complex}
+   */
+  'sign': function () {
+
+    const abs = hypot(this['re'], this['im']);
+
+    return new Complex(
+      this['re'] / abs,
+      this['im'] / abs);
+  },
+
+  /**
+   * Adds two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'add': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity + Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity + z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] + z['re'],
+      this['im'] + z['im']);
+  },
+
+  /**
+   * Subtracts two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'sub': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity - Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity - z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] - z['re'],
+      this['im'] - z['im']);
+  },
+
+  /**
+   * Multiplies two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'mul': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // Infinity * 0 = NaN
+    if (tInfin && zIsZero || zInfin && tIsZero) {
+      return Complex['NAN'];
+    }
+
+    // Infinity * z = Infinity { where z != 0 }
+    if (tInfin || zInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // Shortcut for real values
+    if (z['im'] === 0 && this['im'] === 0) {
+      return new Complex(this['re'] * z['re'], 0);
+    }
+
+    return new Complex(
+      this['re'] * z['re'] - this['im'] * z['im'],
+      this['re'] * z['im'] + this['im'] * z['re']);
+  },
+
+  /**
+   * Divides two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'div': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // 0 / 0 = NaN and Infinity / Infinity = NaN
+    if (tIsZero && zIsZero || tInfin && zInfin) {
+      return Complex['NAN'];
+    }
+
+    // Infinity / 0 = Infinity
+    if (zIsZero || tInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // 0 / Infinity = 0
+    if (tIsZero || zInfin) {
+      return Complex['ZERO'];
+    }
+
+    if (0 === z['im']) {
+      // Divisor is real
+      return new Complex(this['re'] / z['re'], this['im'] / z['re']);
+    }
+
+    if (Math.abs(z['re']) < Math.abs(z['im'])) {
+
+      const x = z['re'] / z['im'];
+      const t = z['re'] * x + z['im'];
+
+      return new Complex(
+        (this['re'] * x + this['im']) / t,
+        (this['im'] * x - this['re']) / t);
+
+    } else {
+
+      const x = z['im'] / z['re'];
+      const t = z['im'] * x + z['re'];
+
+      return new Complex(
+        (this['re'] + this['im'] * x) / t,
+        (this['im'] - this['re'] * x) / t);
+    }
+  },
+
+  /**
+   * Calculate the power of two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'pow': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    if (zIsZero) {
+      return Complex['ONE'];
+    }
+
+    // If the exponent is real
+    if (z['im'] === 0) {
+
+      if (this['im'] === 0 && this['re'] > 0) {
+
+        return new Complex(Math.pow(this['re'], z['re']), 0);
+
+      } else if (this['re'] === 0) { // If base is fully imaginary
+
+        switch ((z['re'] % 4 + 4) % 4) {
+          case 0:
+            return new Complex(Math.pow(this['im'], z['re']), 0);
+          case 1:
+            return new Complex(0, Math.pow(this['im'], z['re']));
+          case 2:
+            return new Complex(-Math.pow(this['im'], z['re']), 0);
+          case 3:
+            return new Complex(0, -Math.pow(this['im'], z['re']));
+        }
+      }
+    }
+
+    /* I couldn't find a good formula, so here is a derivation and optimization
+     *
+     * z_1^z_2 = (a + bi)^(c + di)
+     *         = exp((c + di) * log(a + bi)
+     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))
+     * =>...
+     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     *
+     * =>...
+     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     *
+     * =>
+     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))
+     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))
+     *
+     */
+
+    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero
+      return Complex['ZERO'];
+    }
+
+    const arg = Math.atan2(this['im'], this['re']);
+    const loh = logHypot(this['re'], this['im']);
+
+    let re = Math.exp(z['re'] * loh - z['im'] * arg);
+    let im = z['im'] * loh + z['re'] * arg;
+    return new Complex(
+      re * Math.cos(im),
+      re * Math.sin(im));
+  },
+
+  /**
+   * Calculate the complex square root
+   *
+   * @returns {Complex}
+   */
+  'sqrt': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      // Real number case
+      if (a >= 0) {
+        return new Complex(Math.sqrt(a), 0);
+      } else {
+        return new Complex(0, Math.sqrt(-a));
+      }
+    }
+
+    const r = hypot(a, b);
+
+    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)
+    let im = Math.abs(b) / (2 * re);
+
+    if (a >= 0) {
+      return new Complex(re, b < 0 ? -im : im);
+    } else {
+      return new Complex(im, b < 0 ? -re : re);
+    }
+  },
+
+  /**
+   * Calculate the complex exponent
+   *
+   * @returns {Complex}
+   */
+  'exp': function () {
+
+    const er = Math.exp(this['re']);
+
+    if (this['im'] === 0) {
+      return new Complex(er, 0);
+    }
+    return new Complex(
+      er * Math.cos(this['im']),
+      er * Math.sin(this['im']));
+  },
+
+  /**
+   * Calculate the complex exponent and subtracts one.
+   *
+   * This may be more accurate than `Complex(x).exp().sub(1)` if
+   * `x` is small.
+   *
+   * @returns {Complex}
+   */
+  'expm1': function () {
+
+    /**
+     * exp(a + i*b) - 1
+     = exp(a) * (cos(b) + j*sin(b)) - 1
+     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
+     */
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.expm1(a) * Math.cos(b) + cosm1(b),
+      Math.exp(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the natural log
+   *
+   * @returns {Complex}
+   */
+  'log': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0 && a > 0) {
+      return new Complex(Math.log(a), 0);
+    }
+
+    return new Complex(
+      logHypot(a, b),
+      Math.atan2(b, a));
+  },
+
+  /**
+   * Calculate the magnitude of the complex number
+   *
+   * @returns {number}
+   */
+  'abs': function () {
+
+    return hypot(this['re'], this['im']);
+  },
+
+  /**
+   * Calculate the angle of the complex number
+   *
+   * @returns {number}
+   */
+  'arg': function () {
+
+    return Math.atan2(this['im'], this['re']);
+  },
+
+  /**
+   * Calculate the sine of the complex number
+   *
+   * @returns {Complex}
+   */
+  'sin': function () {
+
+    // sin(z) = ( e^iz - e^-iz ) / 2i 
+    //        = sin(a)cosh(b) + i cos(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.sin(a) * cosh(b),
+      Math.cos(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the cosine
+   *
+   * @returns {Complex}
+   */
+  'cos': function () {
+
+    // cos(z) = ( e^iz + e^-iz ) / 2 
+    //        = cos(a)cosh(b) - i sin(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.cos(a) * cosh(b),
+      -Math.sin(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the tangent
+   *
+   * @returns {Complex}
+   */
+  'tan': function () {
+
+    // tan(z) = sin(z) / cos(z) 
+    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )
+    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )
+    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) + cosh(b);
+
+    return new Complex(
+      Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cotangent
+   *
+   * @returns {Complex}
+   */
+  'cot': function () {
+
+    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) - cosh(b);
+
+    return new Complex(
+      -Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the secant
+   *
+   * @returns {Complex}
+   */
+  'sec': function () {
+
+    // sec(c) = 2 / (e^(ci) + e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.cos(a) * cosh(b) / d,
+      Math.sin(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cosecans
+   *
+   * @returns {Complex}
+   */
+  'csc': function () {
+
+    // csc(c) = 2i / (e^(ci) - e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.sin(a) * cosh(b) / d,
+      -Math.cos(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the complex arcus sinus
+   *
+   * @returns {Complex}
+   */
+  'asin': function () {
+
+    // asin(c) = -i * log(ci + sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(t2['im'], -t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cosinus
+   *
+   * @returns {Complex}
+   */
+  'acos': function () {
+
+    // acos(c) = i * log(c - i * sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(Math.PI / 2 - t2['im'], t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus tangent
+   *
+   * @returns {Complex}
+   */
+  'atan': function () {
+
+    // atan(c) = i / 2 log((i + x) / (i - x))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0) {
+
+      if (b === 1) {
+        return new Complex(0, Infinity);
+      }
+
+      if (b === -1) {
+        return new Complex(0, -Infinity);
+      }
+    }
+
+    const d = a * a + (1.0 - b) * (1.0 - b);
+
+    const t1 = new Complex(
+      (1 - b * b - a * a) / d,
+      -2 * a / d).log();
+
+    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cotangent
+   *
+   * @returns {Complex}
+   */
+  'acot': function () {
+
+    // acot(c) = i / 2 log((c - i) / (c + i))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      return new Complex(Math.atan2(1, a), 0);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).atan()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).atan();
+  },
+
+  /**
+   * Calculate the complex arcus secant
+   *
+   * @returns {Complex}
+   */
+  'asec': function () {
+
+    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(0, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).acos()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).acos();
+  },
+
+  /**
+   * Calculate the complex arcus cosecans
+   *
+   * @returns {Complex}
+   */
+  'acsc': function () {
+
+    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(Math.PI / 2, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).asin()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).asin();
+  },
+
+  /**
+   * Calculate the complex sinh
+   *
+   * @returns {Complex}
+   */
+  'sinh': function () {
+
+    // sinh(c) = (e^c - e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      sinh(a) * Math.cos(b),
+      cosh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex cosh
+   *
+   * @returns {Complex}
+   */
+  'cosh': function () {
+
+    // cosh(c) = (e^c + e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      cosh(a) * Math.cos(b),
+      sinh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex tanh
+   *
+   * @returns {Complex}
+   */
+  'tanh': function () {
+
+    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) + Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex coth
+   *
+   * @returns {Complex}
+   */
+  'coth': function () {
+
+    // coth(c) = (e^c + e^-c) / (e^c - e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) - Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      -Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex csch
+   *
+   * @returns {Complex}
+   */
+  'csch': function () {
+
+    // csch(c) = 2 / (e^c - e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) - cosh(2 * a);
+
+    return new Complex(
+      -2 * sinh(a) * Math.cos(b) / d,
+      2 * cosh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex sech
+   *
+   * @returns {Complex}
+   */
+  'sech': function () {
+
+    // sech(c) = 2 / (e^c + e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) + cosh(2 * a);
+
+    return new Complex(
+      2 * cosh(a) * Math.cos(b) / d,
+      -2 * sinh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex asinh
+   *
+   * @returns {Complex}
+   */
+  'asinh': function () {
+
+    // asinh(z) = log(z + sqrt(z^2 + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a
+      const x = Math.abs(a);
+      const r = Math.log(x + Math.sqrt(x * x + 1));
+
+      return new Complex(a < 0 ? -r : r, 0);
+    }
+
+    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)
+    const re2 = a * a - b * b + 1;
+    const im2 = 2 * a * b;
+
+    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)
+
+    return new Complex(a + t['re'], b + t['im'])['log']();
+  },
+
+  /**
+   * Calculate the complex acosh
+   *
+   * @returns {Complex}
+   */
+  'acosh': function () {
+
+    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a is real
+      if (a > 1) {
+        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1
+        return new Complex(
+          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);
+      }
+
+      if (a < -1) {
+        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1
+        const t = Math.sqrt(a * a - 1);
+        return new Complex(Math.log(-a + t), Math.PI);
+      }
+
+      // -1 <= a <= 1 : purely imaginary
+      // acosh(a) = i * acos(a)
+      return new Complex(0, Math.acos(a));
+    }
+
+    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)
+    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)
+
+    return new Complex(
+      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],
+      b + t1['re'] * t2['im'] + t1['im'] * t2['re']
+    )['log']();
+  },
+
+  /**
+   * Calculate the complex atanh
+   *
+   * @returns {Complex}
+   */
+  'atanh': function () {
+
+    // atanh(z) = log((1 + z) / (1 - z)) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      if (a === 1) {
+        // limit x -> 1^- atanh(x) = +Infinity
+        return new Complex(Infinity, 0);
+      }
+
+      if (a === -1) {
+        // limit x -> -1^+ atanh(x) = -Infinity
+        return new Complex(-Infinity, 0);
+      }
+
+      if (-1 < a && a < 1) {
+        // Purely real
+        return new Complex(
+          0.5 * Math.log((1 + a) / (1 - a)),
+          0
+        );
+      }
+
+      if (a > 1) {
+        // Our branch: Im(atanh(a)) = -π/2 for a > 1
+        const t = (a + 1) / (a - 1); // > 0
+        return new Complex(
+          0.5 * Math.log(t),
+          -Math.PI / 2
+        );
+      }
+
+      // a < -1: Im(atanh(a)) = +π/2
+      const t = (1 + a) / (1 - a); // < 0
+      return new Complex(
+        0.5 * Math.log(-t), // log((1 - a)/(1 + a))
+        Math.PI / 2
+      );
+    }
+
+    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.
+    const oneMinus = 1 - a;
+    const onePlus = 1 + a;
+    const d = oneMinus * oneMinus + b * b; // |1 - z|^2
+
+    if (d === 0) {
+      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.
+      // If we ever get here, just propagate infinities consistently:
+      return new Complex(
+        (a !== -1) ? (a / 0) : 0,
+        (b !== 0) ? (b / 0) : 0
+      );
+    }
+
+    // (1 + z) / (1 - z) with a single complex division
+    const xr = (onePlus * oneMinus - b * b) / d;
+    const xi = (b * oneMinus + onePlus * b) / d;
+
+    // 0.5 * log(xr + i xi)
+    return new Complex(
+      logHypot(xr, xi) / 2,
+      Math.atan2(xi, xr) / 2
+    );
+  },
+
+  /**
+   * Calculate the complex acoth
+   *
+   * @returns {Complex}
+   */
+  'acoth': function () {
+
+    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    // z = 0 -> acoth(0) = i * π / 2  (log((1+0)/(1-0))/2 = log(-1)/2)
+    if (a === 0 && b === 0) {
+      return new Complex(0, Math.PI / 2);
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['atanh']();
+    }
+
+    // Fallback for weird infinities/NaNs: mirror other functions' style
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0
+    )['atanh']();
+  },
+
+  /**
+   * Calculate the complex acsch
+   *
+   * @returns {Complex}
+   */
+  'acsch': function () {
+
+    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a real
+      if (a === 0) {
+        // acsch(0) -> +/- Infinity, we keep your previous behavior
+        return new Complex(Infinity, 0);
+      }
+
+      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))
+      const inv = 1 / a;
+      return new Complex(
+        Math.log(inv + Math.sqrt(inv * inv + 1)),
+        0
+      );
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1/z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['asinh']();
+    }
+
+    // Handle 0 + 0i or infinities in the same spirit as your existing code
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['asinh']();
+  },
+
+  /**
+   * Calculate the complex asech
+   *
+   * @returns {Complex}
+   */
+  'asech': function () {
+
+    // asech(z) = acosh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (this['isZero']()) {
+      // asech(0) = acosh(∞) -> ∞
+      return Complex['INFINITY'];
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['acosh']();
+    }
+
+    // Fallback for weird infinities/NaNs
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['acosh']();
+  },
+
+  /**
+   * Calculate the complex inverse 1/z
+   *
+   * @returns {Complex}
+   */
+  'inverse': function () {
+
+    // 1 / 0 = Infinity and 1 / Infinity = 0
+    if (this['isZero']()) {
+      return Complex['INFINITY'];
+    }
+
+    if (this['isInfinite']()) {
+      return Complex['ZERO'];
+    }
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const d = a * a + b * b;
+
+    return new Complex(a / d, -b / d);
+  },
+
+  /**
+   * Returns the complex conjugate
+   *
+   * @returns {Complex}
+   */
+  'conjugate': function () {
+
+    return new Complex(this['re'], -this['im']);
+  },
+
+  /**
+   * Gets the negated complex number
+   *
+   * @returns {Complex}
+   */
+  'neg': function () {
+
+    return new Complex(-this['re'], -this['im']);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'ceil': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.ceil(this['re'] * places) / places,
+      Math.ceil(this['im'] * places) / places);
+  },
+
+  /**
+   * Floors the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'floor': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.floor(this['re'] * places) / places,
+      Math.floor(this['im'] * places) / places);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'round': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.round(this['re'] * places) / places,
+      Math.round(this['im'] * places) / places);
+  },
+
+  /**
+   * Compares two complex numbers
+   *
+   * **Note:** new Complex(Infinity).equals(Infinity) === false
+   *
+   * @returns {boolean}
+   */
+  'equals': function (a, b) {
+
+    const z = parse(a, b);
+
+    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
+      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * @returns {Complex}
+   */
+  'clone': function () {
+
+    return new Complex(this['re'], this['im']);
+  },
+
+  /**
+   * Gets a string of the actual complex number
+   *
+   * @returns {string}
+   */
+  'toString': function () {
+
+    let a = this['re'];
+    let b = this['im'];
+    let ret = "";
+
+    if (this['isNaN']()) {
+      return 'NaN';
+    }
+
+    if (this['isInfinite']()) {
+      return 'Infinity';
+    }
+
+    if (Math.abs(a) < Complex['EPSILON']) {
+      a = 0;
+    }
+
+    if (Math.abs(b) < Complex['EPSILON']) {
+      b = 0;
+    }
+
+    // If is real number
+    if (b === 0) {
+      return ret + a;
+    }
+
+    if (a !== 0) {
+      ret += a;
+      ret += " ";
+      if (b < 0) {
+        b = -b;
+        ret += "-";
+      } else {
+        ret += "+";
+      }
+      ret += " ";
+    } else if (b < 0) {
+      b = -b;
+      ret += "-";
+    }
+
+    if (1 !== b) { // b is the absolute imaginary part
+      ret += b;
+    }
+    return ret + "i";
+  },
+
+  /**
+   * Returns the actual number as a vector
+   *
+   * @returns {Array}
+   */
+  'toVector': function () {
+
+    return [this['re'], this['im']];
+  },
+
+  /**
+   * Returns the actual real value of the current object
+   *
+   * @returns {number|null}
+   */
+  'valueOf': function () {
+
+    if (this['im'] === 0) {
+      return this['re'];
+    }
+    return null;
+  },
+
+  /**
+   * Determines whether a complex number is not on the Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isNaN': function () {
+    return isNaN(this['re']) || isNaN(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the zero pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isZero': function () {
+    return this['im'] === 0 && this['re'] === 0;
+  },
+
+  /**
+   * Determines whether a complex number is not at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isFinite': function () {
+    return isFinite(this['re']) && isFinite(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isInfinite': function () {
+    return !this['isFinite']();
+  }
+};
+
+Complex['ZERO'] = new Complex(0, 0);
+Complex['ONE'] = new Complex(1, 0);
+Complex['I'] = new Complex(0, 1);
+Complex['PI'] = new Complex(Math.PI, 0);
+Complex['E'] = new Complex(Math.E, 0);
+Complex['INFINITY'] = new Complex(Infinity, Infinity);
+Complex['NAN'] = new Complex(NaN, NaN);
+Complex['EPSILON'] = 1e-15;
+export {
+  Complex as default, Complex
+};
diff --git a/node_modules/complex.js/examples/gamma.js b/node_modules/complex.js/examples/gamma.js
new file mode 100644
index 0000000..1cc739d
--- /dev/null
+++ b/node_modules/complex.js/examples/gamma.js
@@ -0,0 +1,33 @@
+/*
+ * A gamma function implementation based on Lanczos Approximation
+ * https://en.wikipedia.org/wiki/Lanczos_approximation
+ */
+
+var Complex = require('complex.js');
+
+var P = [
+  Complex(0.99999999999980993),
+  Complex(676.5203681218851), Complex(-1259.1392167224028), Complex(771.32342877765313),
+  Complex(-176.61502916214059), Complex(12.507343278686905), Complex(-0.13857109526572012),
+  Complex(9.9843695780195716e-6), Complex(1.5056327351493116e-7)
+];
+
+var SQRT2PI = Complex(Math.sqrt(2 * Math.PI));
+
+function gamma(z) {
+
+  z = z.sub(1);
+
+  var x = P[0];
+  var t = z.add(7.5);
+  for (var i = 1; i < P.length; i++) {
+    x = x.add(P[i].div(z.add(i)));
+  }
+  return SQRT2PI.mul(t.pow(z.add(0.5))).mul(t.neg().exp()).mul(x);
+}
+
+var fac = 1;
+for (var i = 1; i <= 10; i++) {
+  console.log(fac, gamma(Complex(i)));
+  fac *= i;
+}
diff --git a/node_modules/complex.js/package.json b/node_modules/complex.js/package.json
new file mode 100644
index 0000000..0f19826
--- /dev/null
+++ b/node_modules/complex.js/package.json
@@ -0,0 +1,60 @@
+{
+    "name": "complex.js",
+    "title": "Complex.js",
+    "version": "2.4.3",
+    "homepage": "https://raw.org/article/complex-numbers-in-javascript/",
+    "bugs": "https://github.com/rawify/Complex.js/issues",
+    "description": "The RAW complex numbers library",
+    "keywords": [
+        "complex numbers",
+        "math",
+        "complex",
+        "number",
+        "calculus",
+        "parser",
+        "arithmetic"
+    ],
+    "private": false,
+    "main": "./dist/complex.js",
+    "module": "./dist/complex.mjs",
+    "types": "./complex.d.ts",
+    "browser": "./dist/complex.min.js",
+    "unpkg": "./dist/complex.min.js",
+    "readmeFilename": "README.md",
+    "exports": {
+        ".": {
+            "types": "./complex.d.ts",
+            "require": "./dist/complex.js",
+            "import": "./dist/complex.mjs"
+        }
+    },
+    "repository": {
+        "type": "git",
+        "url": "git@github.com:rawify/Complex.js.git"
+    },
+    "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+    },
+    "author": {
+        "name": "Robert Eisele",
+        "email": "robert@raw.org",
+        "url": "https://raw.org/"
+    },
+    "license": "MIT",
+    "engines": {
+        "node": "*"
+    },
+    "directories": {
+        "example": "examples",
+        "test": "tests"
+    },
+    "scripts": {
+        "build": "crude-build Complex",
+        "test": "mocha tests/*.js"
+    },
+    "devDependencies": {
+        "crude-build": "^0.1.2",
+        "mocha": "*"
+    }
+}
diff --git a/node_modules/complex.js/src/complex.js b/node_modules/complex.js/src/complex.js
new file mode 100644
index 0000000..fbc1913
--- /dev/null
+++ b/node_modules/complex.js/src/complex.js
@@ -0,0 +1,1477 @@
+/**
+ * @license Complex.js v2.4.3 11/13/2025
+ * https://raw.org/article/complex-numbers-in-javascript/
+ *
+ * Copyright (c) 2025, Robert Eisele (https://raw.org/)
+ * Licensed under the MIT license.
+ **/
+
+/**
+ *
+ * This class allows the manipulation of complex numbers.
+ * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.
+ *
+ * Object form
+ * { re: <real>, im: <imaginary> }
+ * { arg: <angle>, abs: <radius> }
+ * { phi: <angle>, r: <radius> }
+ *
+ * Array / Vector form
+ * [ real, imaginary ]
+ *
+ * Double form
+ * 99.3 - Single double value
+ *
+ * String form
+ * '23.1337' - Simple real number
+ * '15+3i' - a simple complex number
+ * '3-i' - a simple complex number
+ *
+ * Example:
+ *
+ * const c = new Complex('99.3+8i');
+ * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);
+ *
+ */
+
+
+const cosh = Math.cosh || function (x) {
+  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;
+};
+
+const sinh = Math.sinh || function (x) {
+  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;
+};
+
+/**
+ * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).
+ *
+ * @param {number} x
+ * @returns {number} cos(x) - 1
+ */
+const cosm1 = x => {
+  // cos(x) - 1 = − 2sin^2(x / 2)
+  const s = Math.sin(0.5 * x);
+  return -2 * s * s;
+};
+
+const hypot = function (x, y) {
+
+  x = Math.abs(x);
+  y = Math.abs(y);
+
+  // Ensure `x` is the larger value
+  if (x < y) [x, y] = [y, x];
+
+  // If both are below the threshold, use straightforward Pythagoras
+  if (x < 1e8) return Math.sqrt(x * x + y * y);
+
+  // For larger values, scale to avoid overflow
+  y /= x;
+  return x * Math.sqrt(1 + y * y);
+};
+
+const parser_exit = function () {
+  throw SyntaxError('Invalid Param');
+};
+
+/**
+ * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows
+ *
+ * @param {number} a
+ * @param {number} b
+ * @returns {number}
+ */
+function logHypot(a, b) {
+
+  const _a = Math.abs(a);
+  const _b = Math.abs(b);
+
+  if (a === 0) {
+    return Math.log(_b);
+  }
+
+  if (b === 0) {
+    return Math.log(_a);
+  }
+
+  if (_a < 3000 && _b < 3000) {
+    return Math.log(a * a + b * b) * 0.5;
+  }
+
+  /* I got 4 ideas to compute this property without overflow:
+   *
+   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate
+   *
+   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)
+
+   Math.log(a * a + b * b) / 2
+
+   *
+   *
+   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)
+
+   const fn = function(a, b) {
+   a = Math.abs(a);
+   b = Math.abs(b);
+   let t = Math.min(a, b);
+   a = Math.max(a, b);
+   t = t / a;
+
+   return Math.log(a) + Math.log(1 + t * t) / 2;
+   };
+
+   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)
+
+   Math.log(a / Math.cos(Math.atan2(b, a)))
+
+   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)
+
+   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))
+
+   */
+
+  a = a * 0.5;
+  b = b * 0.5;
+
+  return 0.5 * Math.log(a * a + b * b) + Math.LN2;
+}
+
+const P = { 're': 0, 'im': 0 };
+const parse = function (a, b) {
+
+  const z = P;
+
+  if (a === undefined || a === null) {
+    z['re'] =
+      z['im'] = 0;
+  } else if (b !== undefined) {
+    z['re'] = a;
+    z['im'] = b;
+  } else
+    switch (typeof a) {
+
+      case 'object':
+
+        if ('im' in a && 're' in a) {
+          z['re'] = a['re'];
+          z['im'] = a['im'];
+        } else if ('abs' in a && 'arg' in a) {
+          if (!isFinite(a['abs']) && isFinite(a['arg'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['abs'] * Math.cos(a['arg']);
+          z['im'] = a['abs'] * Math.sin(a['arg']);
+        } else if ('r' in a && 'phi' in a) {
+          if (!isFinite(a['r']) && isFinite(a['phi'])) {
+            return Complex['INFINITY'];
+          }
+          z['re'] = a['r'] * Math.cos(a['phi']);
+          z['im'] = a['r'] * Math.sin(a['phi']);
+        } else if (a.length === 2) { // Quick array check
+          z['re'] = a[0];
+          z['im'] = a[1];
+        } else {
+          parser_exit();
+        }
+        break;
+
+      case 'string':
+
+        z['im'] = /* void */
+        z['re'] = 0;
+
+        const tokens = a.replace(/_/g, '')
+          .match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);
+        let plus = 1;
+        let minus = 0;
+
+        if (tokens === null) {
+          parser_exit();
+        }
+
+        for (let i = 0; i < tokens.length; i++) {
+
+          const c = tokens[i];
+
+          if (c === ' ' || c === '\t' || c === '\n') {
+            /* void */
+          } else if (c === '+') {
+            plus++;
+          } else if (c === '-') {
+            minus++;
+          } else if (c === 'i' || c === 'I') {
+
+            if (plus + minus === 0) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);
+              i++;
+            } else {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');
+            }
+            plus = minus = 0;
+
+          } else {
+
+            if (plus + minus === 0 || isNaN(c)) {
+              parser_exit();
+            }
+
+            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {
+              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);
+              i++;
+            } else {
+              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);
+            }
+            plus = minus = 0;
+          }
+        }
+
+        // Still something on the stack
+        if (plus + minus > 0) {
+          parser_exit();
+        }
+        break;
+
+      case 'number':
+        z['im'] = 0;
+        z['re'] = a;
+        break;
+
+      default:
+        parser_exit();
+    }
+
+  if (isNaN(z['re']) || isNaN(z['im'])) {
+    // If a calculation is NaN, we treat it as NaN and don't throw
+    //parser_exit();
+  }
+
+  return z;
+};
+
+/**
+ * @constructor
+ * @returns {Complex}
+ */
+function Complex(a, b) {
+
+  if (!(this instanceof Complex)) {
+    return new Complex(a, b);
+  }
+
+  const z = parse(a, b);
+
+  this['re'] = z['re'];
+  this['im'] = z['im'];
+}
+
+Complex.prototype = {
+
+  're': 0,
+  'im': 0,
+
+  /**
+   * Calculates the sign of a complex number, which is a normalized complex
+   *
+   * @returns {Complex}
+   */
+  'sign': function () {
+
+    const abs = hypot(this['re'], this['im']);
+
+    return new Complex(
+      this['re'] / abs,
+      this['im'] / abs);
+  },
+
+  /**
+   * Adds two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'add': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity + Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity + z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] + z['re'],
+      this['im'] + z['im']);
+  },
+
+  /**
+   * Subtracts two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'sub': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+
+    if (tInfin || zInfin) {
+
+      if (tInfin && zInfin) {
+        // Infinity - Infinity = NaN
+        return Complex['NAN'];
+      }
+      // Infinity - z = Infinity { where z != Infinity }
+      return Complex['INFINITY'];
+    }
+
+    return new Complex(
+      this['re'] - z['re'],
+      this['im'] - z['im']);
+  },
+
+  /**
+   * Multiplies two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'mul': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // Infinity * 0 = NaN
+    if (tInfin && zIsZero || zInfin && tIsZero) {
+      return Complex['NAN'];
+    }
+
+    // Infinity * z = Infinity { where z != 0 }
+    if (tInfin || zInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // Shortcut for real values
+    if (z['im'] === 0 && this['im'] === 0) {
+      return new Complex(this['re'] * z['re'], 0);
+    }
+
+    return new Complex(
+      this['re'] * z['re'] - this['im'] * z['im'],
+      this['re'] * z['im'] + this['im'] * z['re']);
+  },
+
+  /**
+   * Divides two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'div': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tInfin = this['isInfinite']();
+    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    // 0 / 0 = NaN and Infinity / Infinity = NaN
+    if (tIsZero && zIsZero || tInfin && zInfin) {
+      return Complex['NAN'];
+    }
+
+    // Infinity / 0 = Infinity
+    if (zIsZero || tInfin) {
+      return Complex['INFINITY'];
+    }
+
+    // 0 / Infinity = 0
+    if (tIsZero || zInfin) {
+      return Complex['ZERO'];
+    }
+
+    if (0 === z['im']) {
+      // Divisor is real
+      return new Complex(this['re'] / z['re'], this['im'] / z['re']);
+    }
+
+    if (Math.abs(z['re']) < Math.abs(z['im'])) {
+
+      const x = z['re'] / z['im'];
+      const t = z['re'] * x + z['im'];
+
+      return new Complex(
+        (this['re'] * x + this['im']) / t,
+        (this['im'] * x - this['re']) / t);
+
+    } else {
+
+      const x = z['im'] / z['re'];
+      const t = z['im'] * x + z['re'];
+
+      return new Complex(
+        (this['re'] + this['im'] * x) / t,
+        (this['im'] - this['re'] * x) / t);
+    }
+  },
+
+  /**
+   * Calculate the power of two complex numbers
+   *
+   * @returns {Complex}
+   */
+  'pow': function (a, b) {
+
+    const z = parse(a, b);
+
+    const tIsZero = this['re'] === 0 && this['im'] === 0;
+    const zIsZero = z['re'] === 0 && z['im'] === 0;
+
+    if (zIsZero) {
+      return Complex['ONE'];
+    }
+
+    // If the exponent is real
+    if (z['im'] === 0) {
+
+      if (this['im'] === 0 && this['re'] > 0) {
+
+        return new Complex(Math.pow(this['re'], z['re']), 0);
+
+      } else if (this['re'] === 0) { // If base is fully imaginary
+
+        switch ((z['re'] % 4 + 4) % 4) {
+          case 0:
+            return new Complex(Math.pow(this['im'], z['re']), 0);
+          case 1:
+            return new Complex(0, Math.pow(this['im'], z['re']));
+          case 2:
+            return new Complex(-Math.pow(this['im'], z['re']), 0);
+          case 3:
+            return new Complex(0, -Math.pow(this['im'], z['re']));
+        }
+      }
+    }
+
+    /* I couldn't find a good formula, so here is a derivation and optimization
+     *
+     * z_1^z_2 = (a + bi)^(c + di)
+     *         = exp((c + di) * log(a + bi)
+     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))
+     * =>...
+     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))
+     *
+     * =>...
+     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))
+     *
+     * =>
+     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))
+     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))
+     *
+     */
+
+    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero
+      return Complex['ZERO'];
+    }
+
+    const arg = Math.atan2(this['im'], this['re']);
+    const loh = logHypot(this['re'], this['im']);
+
+    let re = Math.exp(z['re'] * loh - z['im'] * arg);
+    let im = z['im'] * loh + z['re'] * arg;
+    return new Complex(
+      re * Math.cos(im),
+      re * Math.sin(im));
+  },
+
+  /**
+   * Calculate the complex square root
+   *
+   * @returns {Complex}
+   */
+  'sqrt': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      // Real number case
+      if (a >= 0) {
+        return new Complex(Math.sqrt(a), 0);
+      } else {
+        return new Complex(0, Math.sqrt(-a));
+      }
+    }
+
+    const r = hypot(a, b);
+
+    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)
+    let im = Math.abs(b) / (2 * re);
+
+    if (a >= 0) {
+      return new Complex(re, b < 0 ? -im : im);
+    } else {
+      return new Complex(im, b < 0 ? -re : re);
+    }
+  },
+
+  /**
+   * Calculate the complex exponent
+   *
+   * @returns {Complex}
+   */
+  'exp': function () {
+
+    const er = Math.exp(this['re']);
+
+    if (this['im'] === 0) {
+      return new Complex(er, 0);
+    }
+    return new Complex(
+      er * Math.cos(this['im']),
+      er * Math.sin(this['im']));
+  },
+
+  /**
+   * Calculate the complex exponent and subtracts one.
+   *
+   * This may be more accurate than `Complex(x).exp().sub(1)` if
+   * `x` is small.
+   *
+   * @returns {Complex}
+   */
+  'expm1': function () {
+
+    /**
+     * exp(a + i*b) - 1
+     = exp(a) * (cos(b) + j*sin(b)) - 1
+     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)
+     */
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.expm1(a) * Math.cos(b) + cosm1(b),
+      Math.exp(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the natural log
+   *
+   * @returns {Complex}
+   */
+  'log': function () {
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0 && a > 0) {
+      return new Complex(Math.log(a), 0);
+    }
+
+    return new Complex(
+      logHypot(a, b),
+      Math.atan2(b, a));
+  },
+
+  /**
+   * Calculate the magnitude of the complex number
+   *
+   * @returns {number}
+   */
+  'abs': function () {
+
+    return hypot(this['re'], this['im']);
+  },
+
+  /**
+   * Calculate the angle of the complex number
+   *
+   * @returns {number}
+   */
+  'arg': function () {
+
+    return Math.atan2(this['im'], this['re']);
+  },
+
+  /**
+   * Calculate the sine of the complex number
+   *
+   * @returns {Complex}
+   */
+  'sin': function () {
+
+    // sin(z) = ( e^iz - e^-iz ) / 2i 
+    //        = sin(a)cosh(b) + i cos(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.sin(a) * cosh(b),
+      Math.cos(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the cosine
+   *
+   * @returns {Complex}
+   */
+  'cos': function () {
+
+    // cos(z) = ( e^iz + e^-iz ) / 2 
+    //        = cos(a)cosh(b) - i sin(a)sinh(b)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      Math.cos(a) * cosh(b),
+      -Math.sin(a) * sinh(b));
+  },
+
+  /**
+   * Calculate the tangent
+   *
+   * @returns {Complex}
+   */
+  'tan': function () {
+
+    // tan(z) = sin(z) / cos(z) 
+    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )
+    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )
+    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) + cosh(b);
+
+    return new Complex(
+      Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cotangent
+   *
+   * @returns {Complex}
+   */
+  'cot': function () {
+
+    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = Math.cos(a) - cosh(b);
+
+    return new Complex(
+      -Math.sin(a) / d,
+      sinh(b) / d);
+  },
+
+  /**
+   * Calculate the secant
+   *
+   * @returns {Complex}
+   */
+  'sec': function () {
+
+    // sec(c) = 2 / (e^(ci) + e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.cos(a) * cosh(b) / d,
+      Math.sin(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the cosecans
+   *
+   * @returns {Complex}
+   */
+  'csc': function () {
+
+    // csc(c) = 2i / (e^(ci) - e^(-ci))
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);
+
+    return new Complex(
+      Math.sin(a) * cosh(b) / d,
+      -Math.cos(a) * sinh(b) / d);
+  },
+
+  /**
+   * Calculate the complex arcus sinus
+   *
+   * @returns {Complex}
+   */
+  'asin': function () {
+
+    // asin(c) = -i * log(ci + sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(t2['im'], -t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cosinus
+   *
+   * @returns {Complex}
+   */
+  'acos': function () {
+
+    // acos(c) = i * log(c - i * sqrt(1 - c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const t1 = new Complex(
+      b * b - a * a + 1,
+      -2 * a * b)['sqrt']();
+
+    const t2 = new Complex(
+      t1['re'] - b,
+      t1['im'] + a)['log']();
+
+    return new Complex(Math.PI / 2 - t2['im'], t2['re']);
+  },
+
+  /**
+   * Calculate the complex arcus tangent
+   *
+   * @returns {Complex}
+   */
+  'atan': function () {
+
+    // atan(c) = i / 2 log((i + x) / (i - x))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0) {
+
+      if (b === 1) {
+        return new Complex(0, Infinity);
+      }
+
+      if (b === -1) {
+        return new Complex(0, -Infinity);
+      }
+    }
+
+    const d = a * a + (1.0 - b) * (1.0 - b);
+
+    const t1 = new Complex(
+      (1 - b * b - a * a) / d,
+      -2 * a / d).log();
+
+    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);
+  },
+
+  /**
+   * Calculate the complex arcus cotangent
+   *
+   * @returns {Complex}
+   */
+  'acot': function () {
+
+    // acot(c) = i / 2 log((c - i) / (c + i))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+      return new Complex(Math.atan2(1, a), 0);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).atan()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).atan();
+  },
+
+  /**
+   * Calculate the complex arcus secant
+   *
+   * @returns {Complex}
+   */
+  'asec': function () {
+
+    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(0, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).acos()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).acos();
+  },
+
+  /**
+   * Calculate the complex arcus cosecans
+   *
+   * @returns {Complex}
+   */
+  'acsc': function () {
+
+    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (a === 0 && b === 0) {
+      return new Complex(Math.PI / 2, Infinity);
+    }
+
+    const d = a * a + b * b;
+    return (d !== 0)
+      ? new Complex(
+        a / d,
+        -b / d).asin()
+      : new Complex(
+        (a !== 0) ? a / 0 : 0,
+        (b !== 0) ? -b / 0 : 0).asin();
+  },
+
+  /**
+   * Calculate the complex sinh
+   *
+   * @returns {Complex}
+   */
+  'sinh': function () {
+
+    // sinh(c) = (e^c - e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      sinh(a) * Math.cos(b),
+      cosh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex cosh
+   *
+   * @returns {Complex}
+   */
+  'cosh': function () {
+
+    // cosh(c) = (e^c + e^-c) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    return new Complex(
+      cosh(a) * Math.cos(b),
+      sinh(a) * Math.sin(b));
+  },
+
+  /**
+   * Calculate the complex tanh
+   *
+   * @returns {Complex}
+   */
+  'tanh': function () {
+
+    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) + Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex coth
+   *
+   * @returns {Complex}
+   */
+  'coth': function () {
+
+    // coth(c) = (e^c + e^-c) / (e^c - e^-c)
+
+    const a = 2 * this['re'];
+    const b = 2 * this['im'];
+    const d = cosh(a) - Math.cos(b);
+
+    return new Complex(
+      sinh(a) / d,
+      -Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex csch
+   *
+   * @returns {Complex}
+   */
+  'csch': function () {
+
+    // csch(c) = 2 / (e^c - e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) - cosh(2 * a);
+
+    return new Complex(
+      -2 * sinh(a) * Math.cos(b) / d,
+      2 * cosh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex sech
+   *
+   * @returns {Complex}
+   */
+  'sech': function () {
+
+    // sech(c) = 2 / (e^c + e^-c)
+
+    const a = this['re'];
+    const b = this['im'];
+    const d = Math.cos(2 * b) + cosh(2 * a);
+
+    return new Complex(
+      2 * cosh(a) * Math.cos(b) / d,
+      -2 * sinh(a) * Math.sin(b) / d);
+  },
+
+  /**
+   * Calculate the complex asinh
+   *
+   * @returns {Complex}
+   */
+  'asinh': function () {
+
+    // asinh(z) = log(z + sqrt(z^2 + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      // Use |a| to keep asinh(-a) = -asinh(a) and avoid cancellation for large -a
+      const x = Math.abs(a);
+      const r = Math.log(x + Math.sqrt(x * x + 1));
+
+      return new Complex(a < 0 ? -r : r, 0);
+    }
+
+    // z^2 + 1 = (a^2 - b^2 + 1) + i (2ab)
+    const re2 = a * a - b * b + 1;
+    const im2 = 2 * a * b;
+
+    const t = new Complex(re2, im2)['sqrt'](); // sqrt(z^2 + 1)
+
+    return new Complex(a + t['re'], b + t['im'])['log']();
+  },
+
+  /**
+   * Calculate the complex acosh
+   *
+   * @returns {Complex}
+   */
+  'acosh': function () {
+
+    // acosh(z)= log(z + sqrt(z^2 - 1)) = log(z + sqrt(z - 1) * sqrt(z + 1))
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a is real
+      if (a > 1) {
+        // acosh(a) = log(a + sqrt(a - 1) * sqrt(a + 1)),  a > 1
+        return new Complex(
+          Math.log(a + Math.sqrt(a - 1) * Math.sqrt(a + 1)), 0);
+      }
+
+      if (a < -1) {
+        // acosh(a) = log(-a + sqrt(a^2 - 1)) + i*pi,  a < -1
+        const t = Math.sqrt(a * a - 1);
+        return new Complex(Math.log(-a + t), Math.PI);
+      }
+
+      // -1 <= a <= 1 : purely imaginary
+      // acosh(a) = i * acos(a)
+      return new Complex(0, Math.acos(a));
+    }
+
+    const t1 = new Complex(a - 1, b)['sqrt'](); // sqrt(z - 1)
+    const t2 = new Complex(a + 1, b)['sqrt'](); // sqrt(z + 1)
+
+    return new Complex(
+      a + t1['re'] * t2['re'] - t1['im'] * t2['im'],
+      b + t1['re'] * t2['im'] + t1['im'] * t2['re']
+    )['log']();
+  },
+
+  /**
+   * Calculate the complex atanh
+   *
+   * @returns {Complex}
+   */
+  'atanh': function () {
+
+    // atanh(z) = log((1 + z) / (1 - z)) / 2
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      if (a === 0) {
+        return new Complex(0, 0);
+      }
+
+      if (a === 1) {
+        // limit x -> 1^- atanh(x) = +Infinity
+        return new Complex(Infinity, 0);
+      }
+
+      if (a === -1) {
+        // limit x -> -1^+ atanh(x) = -Infinity
+        return new Complex(-Infinity, 0);
+      }
+
+      if (-1 < a && a < 1) {
+        // Purely real
+        return new Complex(
+          0.5 * Math.log((1 + a) / (1 - a)),
+          0
+        );
+      }
+
+      if (a > 1) {
+        // Our branch: Im(atanh(a)) = -π/2 for a > 1
+        const t = (a + 1) / (a - 1); // > 0
+        return new Complex(
+          0.5 * Math.log(t),
+          -Math.PI / 2
+        );
+      }
+
+      // a < -1: Im(atanh(a)) = +π/2
+      const t = (1 + a) / (1 - a); // < 0
+      return new Complex(
+        0.5 * Math.log(-t), // log((1 - a)/(1 + a))
+        Math.PI / 2
+      );
+    }
+
+    // Use atanh(z) = 0.5 * Log((1+z)/(1-z)) with principal Log.
+    const oneMinus = 1 - a;
+    const onePlus = 1 + a;
+    const d = oneMinus * oneMinus + b * b; // |1 - z|^2
+
+    if (d === 0) {
+      // (1 - z) == 0 for finite z only at z = 1+0i, already handled above.
+      // If we ever get here, just propagate infinities consistently:
+      return new Complex(
+        (a !== -1) ? (a / 0) : 0,
+        (b !== 0) ? (b / 0) : 0
+      );
+    }
+
+    // (1 + z) / (1 - z) with a single complex division
+    const xr = (onePlus * oneMinus - b * b) / d;
+    const xi = (b * oneMinus + onePlus * b) / d;
+
+    // 0.5 * log(xr + i xi)
+    return new Complex(
+      logHypot(xr, xi) / 2,
+      Math.atan2(xi, xr) / 2
+    );
+  },
+
+  /**
+   * Calculate the complex acoth
+   *
+   * @returns {Complex}
+   */
+  'acoth': function () {
+
+    // acoth(z) = log((z + 1) / (z - 1)) / 2 = atanh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    // z = 0 -> acoth(0) = i * π / 2  (log((1+0)/(1-0))/2 = log(-1)/2)
+    if (a === 0 && b === 0) {
+      return new Complex(0, Math.PI / 2);
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['atanh']();
+    }
+
+    // Fallback for weird infinities/NaNs: mirror other functions' style
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0
+    )['atanh']();
+  },
+
+  /**
+   * Calculate the complex acsch
+   *
+   * @returns {Complex}
+   */
+  'acsch': function () {
+
+    // acsch(c) = log((1+sqrt(1+c^2))/c) = = asinh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (b === 0) {
+
+      // z = a real
+      if (a === 0) {
+        // acsch(0) -> +/- Infinity, we keep your previous behavior
+        return new Complex(Infinity, 0);
+      }
+
+      // acsch(a) = asinh(1/a) = log(1/a + sqrt(1/a^2 + 1))
+      const inv = 1 / a;
+      return new Complex(
+        Math.log(inv + Math.sqrt(inv * inv + 1)),
+        0
+      );
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1/z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['asinh']();
+    }
+
+    // Handle 0 + 0i or infinities in the same spirit as your existing code
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['asinh']();
+  },
+
+  /**
+   * Calculate the complex asech
+   *
+   * @returns {Complex}
+   */
+  'asech': function () {
+
+    // asech(z) = acosh(1 / z)
+
+    const a = this['re'];
+    const b = this['im'];
+
+    if (this['isZero']()) {
+      // asech(0) = acosh(∞) -> ∞
+      return Complex['INFINITY'];
+    }
+
+    const d = a * a + b * b;
+
+    if (d !== 0) {
+      // 1 / z = (a - i b) / (a^2 + b^2)
+      return new Complex(a / d, -b / d)['acosh']();
+    }
+
+    // Fallback for weird infinities/NaNs
+    return new Complex(
+      (a !== 0) ? a / 0 : 0,
+      (b !== 0) ? -b / 0 : 0)['acosh']();
+  },
+
+  /**
+   * Calculate the complex inverse 1/z
+   *
+   * @returns {Complex}
+   */
+  'inverse': function () {
+
+    // 1 / 0 = Infinity and 1 / Infinity = 0
+    if (this['isZero']()) {
+      return Complex['INFINITY'];
+    }
+
+    if (this['isInfinite']()) {
+      return Complex['ZERO'];
+    }
+
+    const a = this['re'];
+    const b = this['im'];
+
+    const d = a * a + b * b;
+
+    return new Complex(a / d, -b / d);
+  },
+
+  /**
+   * Returns the complex conjugate
+   *
+   * @returns {Complex}
+   */
+  'conjugate': function () {
+
+    return new Complex(this['re'], -this['im']);
+  },
+
+  /**
+   * Gets the negated complex number
+   *
+   * @returns {Complex}
+   */
+  'neg': function () {
+
+    return new Complex(-this['re'], -this['im']);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'ceil': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.ceil(this['re'] * places) / places,
+      Math.ceil(this['im'] * places) / places);
+  },
+
+  /**
+   * Floors the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'floor': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.floor(this['re'] * places) / places,
+      Math.floor(this['im'] * places) / places);
+  },
+
+  /**
+   * Ceils the actual complex number
+   *
+   * @returns {Complex}
+   */
+  'round': function (places) {
+
+    places = Math.pow(10, places || 0);
+
+    return new Complex(
+      Math.round(this['re'] * places) / places,
+      Math.round(this['im'] * places) / places);
+  },
+
+  /**
+   * Compares two complex numbers
+   *
+   * **Note:** new Complex(Infinity).equals(Infinity) === false
+   *
+   * @returns {boolean}
+   */
+  'equals': function (a, b) {
+
+    const z = parse(a, b);
+
+    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&
+      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * @returns {Complex}
+   */
+  'clone': function () {
+
+    return new Complex(this['re'], this['im']);
+  },
+
+  /**
+   * Gets a string of the actual complex number
+   *
+   * @returns {string}
+   */
+  'toString': function () {
+
+    let a = this['re'];
+    let b = this['im'];
+    let ret = "";
+
+    if (this['isNaN']()) {
+      return 'NaN';
+    }
+
+    if (this['isInfinite']()) {
+      return 'Infinity';
+    }
+
+    if (Math.abs(a) < Complex['EPSILON']) {
+      a = 0;
+    }
+
+    if (Math.abs(b) < Complex['EPSILON']) {
+      b = 0;
+    }
+
+    // If is real number
+    if (b === 0) {
+      return ret + a;
+    }
+
+    if (a !== 0) {
+      ret += a;
+      ret += " ";
+      if (b < 0) {
+        b = -b;
+        ret += "-";
+      } else {
+        ret += "+";
+      }
+      ret += " ";
+    } else if (b < 0) {
+      b = -b;
+      ret += "-";
+    }
+
+    if (1 !== b) { // b is the absolute imaginary part
+      ret += b;
+    }
+    return ret + "i";
+  },
+
+  /**
+   * Returns the actual number as a vector
+   *
+   * @returns {Array}
+   */
+  'toVector': function () {
+
+    return [this['re'], this['im']];
+  },
+
+  /**
+   * Returns the actual real value of the current object
+   *
+   * @returns {number|null}
+   */
+  'valueOf': function () {
+
+    if (this['im'] === 0) {
+      return this['re'];
+    }
+    return null;
+  },
+
+  /**
+   * Determines whether a complex number is not on the Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isNaN': function () {
+    return isNaN(this['re']) || isNaN(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the zero pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isZero': function () {
+    return this['im'] === 0 && this['re'] === 0;
+  },
+
+  /**
+   * Determines whether a complex number is not at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isFinite': function () {
+    return isFinite(this['re']) && isFinite(this['im']);
+  },
+
+  /**
+   * Determines whether or not a complex number is at the infinity pole of the
+   * Riemann sphere.
+   *
+   * @returns {boolean}
+   */
+  'isInfinite': function () {
+    return !this['isFinite']();
+  }
+};
+
+Complex['ZERO'] = new Complex(0, 0);
+Complex['ONE'] = new Complex(1, 0);
+Complex['I'] = new Complex(0, 1);
+Complex['PI'] = new Complex(Math.PI, 0);
+Complex['E'] = new Complex(Math.E, 0);
+Complex['INFINITY'] = new Complex(Infinity, Infinity);
+Complex['NAN'] = new Complex(NaN, NaN);
+Complex['EPSILON'] = 1e-15;
diff --git a/node_modules/complex.js/tests/complex.test.js b/node_modules/complex.js/tests/complex.test.js
new file mode 100644
index 0000000..f7ffbea
--- /dev/null
+++ b/node_modules/complex.js/tests/complex.test.js
@@ -0,0 +1,1089 @@
+
+var Complex = require("complex.js");
+var assert = require("assert");
+
+var functionTests = [{
+  set: Complex.I,
+  fn: "mul",
+  param: Complex(Math.PI).exp(),
+  expect: "23.140692632779267i"
+}, {
+  set: new Complex(1, 4),
+  fn: "mul",
+  param: 3,
+  expect: "3 + 12i"
+}, {
+  set: "4 + 3i",
+  fn: "add",
+  param: "-3 - 2i",
+  expect: "1 + i"
+}, {
+  set: "3i",
+  fn: "add",
+  param: "-2i",
+  expect: "i"
+}, {
+  set: "4",
+  fn: "add",
+  param: "-3",
+  expect: "1"
+}, {
+  set: 9,
+  fn: "sqrt",
+  expect: "3"
+}, {
+  set: -9,
+  fn: "sqrt",
+  expect: "3i"
+}, {
+  set: "-36",
+  fn: "sqrt",
+  expect: "6i"
+}, {
+  set: "36i",
+  fn: "sqrt",
+  expect: "4.242640687119285 + 4.242640687119286i"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: "i",
+  expect: "Infinity"
+}, {
+  set: "-36i",
+  fn: "sqrt",
+  expect: "4.242640687119285 - 4.242640687119286i"
+}, {
+  set: "4 + 2i",
+  fn: "div",
+  param: "0",
+  expect: "Infinity"
+}, {
+  set: "0",
+  fn: "div",
+  param: Infinity,
+  expect: "0"
+}, {
+  set: -Infinity,
+  fn: "div",
+  param: 0,
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "div",
+  param: Infinity,
+  expect: "NaN"
+}, {
+  set: 0,
+  fn: "div",
+  param: 0,
+  expect: "NaN"
+}, {
+  set: "4 + 2i",
+  fn: "div",
+  param: "1 + i",
+  expect: "3 - i"
+}, {
+  set: "25",
+  fn: "div",
+  param: "3 - 4i",
+  expect: "3 + 4i"
+}, {
+  set: "3 - 2i",
+  fn: "div",
+  param: "i",
+  expect: "-2 - 3i"
+}, {
+  set: "4i",
+  fn: "mul",
+  param: "-5i",
+  expect: "20"
+}, {
+  set: "3 - 6i",
+  fn: "mul",
+  param: "i",
+  expect: "6 + 3i"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: 0,
+  expect: "NaN"
+}, {
+  set: "3 + 4i",
+  fn: "add",
+  param: "5 - 7i",
+  expect: "8 - 3i"
+}, {
+  set: Infinity,
+  fn: "add",
+  param: Infinity,
+  expect: "NaN"
+}, {
+  set: -Infinity,
+  fn: "sub",
+  param: -Infinity,
+  expect: "NaN"
+}, {
+  set: "6i",
+  fn: "div",
+  param: "3 - 12i",
+  expect: "-0.47058823529411764 + 0.11764705882352941i"
+}, {
+  set: "36 + 36i",
+  fn: "sqrt",
+  expect: "6.59210468080686 + 2.730539163373364i"
+}, {
+  set: "36 - 36i",
+  fn: "sqrt",
+  expect: "6.59210468080686 - 2.730539163373364i"
+}, {
+  set: "-36 + 36i",
+  fn: "sqrt",
+  expect: "2.730539163373364 + 6.59210468080686i"
+}, {
+  set: "-36 - 36i",
+  fn: "sqrt",
+  expect: "2.730539163373364 - 6.59210468080686i"
+}, {
+  set: "0",
+  fn: "sqrt",
+  expect: "0"
+}, {
+  set: Math.E,
+  fn: "log",
+  expect: "1"
+}, {
+  set: 0,
+  fn: "log",
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "mul",
+  param: 3,
+  expect: "Infinity"
+}, {
+  set: "-1",
+  fn: "log",
+  expect: Math.PI + "i"
+}, {
+  set: "i",
+  fn: "log",
+  expect: (Math.PI / 2) + "i"
+}, {
+  set: "3 + 2i",
+  fn: "log",
+  expect: Math.log(13) / 2 + " + " + Math.atan2(2, 3) + "i"
+}, {
+  set: "3 - 2i",
+  fn: "log",
+  expect: Math.log(13) / 2 + " - " + Math.atan2(2, 3) + "i"
+}, {
+  set: 1,
+  fn: "exp",
+  expect: "" + Math.E
+}, {
+  set: "i",
+  fn: "exp",
+  expect: Math.cos(1) + " + " + Math.sin(1) + "i"
+}, {
+  set: "i",
+  fn: "mul",
+  param: "i",
+  expect: "-1"
+}, {
+  set: "3 + 2i",
+  fn: "exp",
+  expect: "-8.358532650935372 + 18.263727040666765i"
+}, {
+  set: "3 - 2i",
+  fn: "exp",
+  expect: "-8.358532650935372 - 18.263727040666765i"
+}, {
+  set: "3 - 2i",
+  fn: "expm1",
+  expect: "-9.358532650935372 - 18.263727040666765i"
+}, {
+  set: "0",
+  fn: "expm1",
+  expect: "0"
+}, {
+  set: "1e-6",
+  fn: "expm1",
+  expect: "0.0000010000005000001665"
+}, {
+  set: "1e-5 + 5i",
+  fn: "expm1",
+  expect: "-0.7163349779007357 - 0.9589338639538314i"
+}, {
+  set: "1.2e-7 - 2e-6i",
+  fn: "expm1",
+  expect: "1.1999800719976027e-7 - 0.000002000000239998681i"
+}, {
+  set: "3",
+  fn: "pow",
+  param: "3",
+  expect: "27"
+}, {
+  set: -2,
+  fn: "pow",
+  param: 1.5,
+  expect: "-2.82842712474619i"
+}, {
+  set: -8,
+  fn: "pow",
+  param: 1 / 3,
+  expect: "1 + 1.732050807568877i"
+}, {
+  set: -25,
+  fn: "sqrt",
+  expect: "5i"
+}, {
+  set: -25,
+  fn: "pow",
+  param: 0.5,
+  expect: "5i"
+}, {
+  set: "0",
+  fn: "pow",
+  param: "1+i",
+  expect: "0"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "0",
+  expect: "1"
+}, {
+  set: "87",
+  fn: "pow",
+  param: "3",
+  expect: "658503"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "1",
+  expect: "i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "2",
+  expect: "-1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "3",
+  expect: "-i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "4",
+  expect: "1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: "5",
+  expect: "i"
+}, {
+  set: 7,
+  fn: "pow",
+  param: 2,
+  expect: '49'
+}, {
+  set: 0,
+  fn: "pow",
+  param: 2,
+  expect: '0'
+}, {
+  set: "3i",
+  fn: "pow",
+  param: "3i",
+  expect: "-0.008876640735623678 - 0.0013801328997494863i"
+}, {
+  set: { re: 3, im: 4 },
+  fn: "abs",
+  expect: "5"
+}, {
+  set: { re: 10, im: 24 },
+  fn: "abs",
+  expect: "26"
+}, {
+  set: "+++++--+1 + 4i",
+  fn: "mul",
+  param: "3 + 2i",
+  expect: "-5 + 14i"
+}, {
+  set: "4 + 16i",
+  fn: "div",
+  param: "4.0000",
+  expect: "1 + 4i"
+}, {
+  set: { re: -7.1, im: 2.5 },
+  fn: "neg",
+  expect: "7.1 - 2.5i"
+}, {
+  set: { re: 1, im: 1 },
+  fn: "div",
+  param: { re: 3, im: 4 },
+  expect: 7 / 25 + " - " + 1 / 25 + "i"
+}, {
+  set: new Complex(-7.1, 2.5),
+  fn: "neg",
+  expect: "7.1 - 2.5i"
+}, {
+  set: { re: 1, im: 1 },
+  fn: "arg",
+  expect: "" + Math.PI / 4
+}, {
+  set: { re: -1, im: -1 },
+  fn: "arg",
+  expect: "" + -3 * Math.PI / 4
+}, {
+  set: { re: 0, im: 1 },
+  fn: "arg",
+  expect: "" + Math.PI / 2
+}, {
+  set: { re: 1, im: 0.5 * Math.sqrt(4 / 3) },
+  fn: "arg",
+  expect: "" + Math.PI / 6
+}, {
+  set: "3 + 4i",
+  fn: "conjugate",
+  expect: "3 - 4i"
+}, {
+  set: { re: 99, im: 50 },
+  fn: "conjugate",
+  expect: "99 - 50i"
+}, {
+  set: { re: 0, im: 0 },
+  fn: "conjugate",
+  expect: "0"
+}, {
+  set: { re: 1, im: 23 },
+  fn: "conjugate",
+  expect: "1 - 23i"
+}, {
+  set: "2 + 8i",
+  fn: "div",
+  param: new Complex(1, 2),
+  expect: "3.6 + 0.8i"
+}, {
+  set: "2 + 8i",
+  fn: "div",
+  param: "2 + 8i",
+  expect: "1"
+}, {
+  set: -Infinity,
+  fn: "div",
+  param: 3,
+  expect: "Infinity"
+}, {
+  set: "3+4i",
+  fn: "add",
+  param: "5 - i",
+  expect: "8 + 3i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "add",
+  param: "4 + 6i",
+  expect: "5 + 8i"
+}, {
+  set: { re: 5, im: 8 },
+  fn: "sub",
+  param: "4 + 6i",
+  expect: "1 + 2i"
+}, {
+  set: "3 + 4i",
+  fn: "sub",
+  param: "2 - 5i",
+  expect: "1 + 9i"
+}, {
+  set: "1 + 2i",
+  fn: "pow",
+  param: "2",
+  expect: "-2.999999999999999 + 4.000000000000001i"
+}, {
+  set: "1 + 2i",
+  fn: "pow",
+  param: "1 + 2i",
+  expect: "-0.22251715680177267 + 0.10070913113607541i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "pow",
+  param: new Complex(3, 4),
+  expect: "0.1290095940744669 + 0.03392409290517001i"
+}, {
+  fn: "abs",
+  set: new Complex(3, 4),
+  expect: "5"
+}, {
+  param: 2,
+  fn: "pow",
+  set: new Complex(1, 2),
+  expect: "-2.999999999999999 + 4.000000000000001i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 7,
+  expect: "-i"
+}, {
+  set: "2+3i",
+  fn: "mul",
+  param: "4+5i",
+  expect: "-7 + 22i"
+}, {
+  set: "3 + 4i",
+  fn: "mul",
+  param: "2 - 5i",
+  expect: "26 - 7i"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 4,
+  expect: "1"
+}, {
+  set: "i",
+  fn: "pow",
+  param: 5,
+  expect: "i"
+}, {
+  set: "0-0i",
+  fn: "pow",
+  param: 2,
+  expect: "0"
+}, {
+  set: "0-0i",
+  fn: "pow",
+  param: 0,
+  expect: "1"
+}, {
+  set: "1 + 4i",
+  fn: "sqrt",
+  expect: "1.600485180440241 + 1.2496210676876531i"
+}, {
+  set: { re: -3, im: 4 },
+  fn: "sqrt",
+  expect: "1 + 2i"
+}, {
+  set: { re: 3, im: -4 },
+  fn: "sqrt",
+  expect: "2 - i"
+}, {
+  set: { re: -3, im: -4 },
+  fn: "sqrt",
+  expect: "1 - 2i"
+}, {
+  set: [-2, 0],
+  fn: "pow",
+  param: 2,
+  expect: "4"
+}, {
+  set: { abs: 1, arg: 0 },
+  fn: "equals",
+  param: { re: 1, im: 0 },
+  expect: "true"
+}, {
+  set: -Complex.E.pow(2),
+  fn: "log",
+  expect: "2 + 3.141592653589793i"
+}, {
+  set: "4 + 3i",
+  fn: "log",
+  expect: "1.6094379124341003 + 0.6435011087932844i"
+}, {
+  set: "4 + 3i",
+  fn: "exp",
+  expect: "-54.051758861078156 + 7.704891372731154i"
+}, {
+  set: "1-2i",
+  fn: "sqrt",
+  expect: "1.272019649514069 - 0.7861513777574233i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "sin",
+  expect: "3.165778513216168 + 1.9596010414216063i"
+}, {
+  set: "i",
+  fn: "cos",
+  expect: "1.5430806348152437"
+}, {
+  set: "i",
+  fn: "acos",
+  expect: "1.5707963267948966 - 0.8813735870195428i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "cos",
+  expect: "2.0327230070196656 - 3.0518977991518i"
+}, {
+  set: { re: 1, im: 2 },
+  fn: "tan",
+  expect: "0.03381282607989669 + 1.0147936161466335i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "sinh",
+  expect: "-1.1634403637032504 + 0.21775955162215221i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "cosh",
+  expect: "-1.5276382501165433 + 0.1658444019189788i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "tanh",
+  expect: "0.7680176472869112 - 0.059168539566050726i"
+}, {
+  set: { re: 1, im: 3 },
+  fn: "inverse",
+  expect: "0.1 - 0.3i"
+}, {
+  set: "3+4i",
+  fn: "inverse",
+  expect: "0.12 - 0.16i" // 3/25 - (4/25)i
+}, {
+  set: { re: 0.5, im: -0.5 },
+  fn: "inverse",
+  expect: "1 + i"
+}, {
+  set: "1 + i",
+  fn: "inverse",
+  expect: "0.5 - 0.5i"
+}, {
+  set: "0",
+  fn: "inverse",
+  expect: "Infinity"
+}, {
+  set: Infinity,
+  fn: "inverse",
+  expect: "0"
+}, {
+  set: Complex['EPSILON'],
+  fn: "equals",
+  param: 1e-16,
+  expect: "true"
+}, {
+  set: 0,
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: 5,
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: 5,
+  fn: "equals",
+  param: 5,
+  expect: "true"
+}, {
+  set: "10i",
+  fn: "equals",
+  param: "10i",
+  expect: "true"
+}, {
+  set: "2 + 3i",
+  fn: "equals",
+  param: "2 + 3i",
+  expect: "true"
+}, {
+  set: "2 + 3i",
+  fn: "equals",
+  param: "5i",
+  expect: "false"
+}, {
+  set: "2 + 3i",
+  fn: "round",
+  param: "0",
+  expect: "2 + 3i"
+}, {
+  set: "2.5 + 3.5i",
+  fn: "round",
+  param: "1",
+  expect: "2.5 + 3.5i"
+}, {
+  set: "2.5 + 3.5i",
+  fn: "sign",
+  param: null,
+  expect: "0.5812381937190965 + 0.813733471206735i"
+}, {
+  set: "10 + 24i",
+  fn: "sign",
+  param: null,
+  expect: "0.38461538461538464 + 0.9230769230769231i"
+}, {
+  set: "1e3i",
+  fn: "add",
+  param: "3e-3 + 1e2i",
+  expect: "0.003 + 1100i"
+}, {
+  set: "3.14-4i",
+  fn: "coth",
+  expect: "0.9994481238383576 + 0.0037048958915019857i"
+}, {
+  set: "8i-31",
+  fn: "cot",
+  expect: "1.6636768291213935e-7 - 1.0000001515864902i"
+}, {
+  set: Complex(1, 1).sub(0, 1), // Distance
+  fn: "abs",
+  expect: "1"
+}, {
+  set: Complex(1, 1), // Rotate around center
+  fn: "mul",
+  param: { abs: 1, arg: Math.PI / 2 },
+  expect: "-0.9999999999999999 + i"
+}, {
+  set: Complex(1, 1).sub(0, 1).mul({ abs: 1, arg: Math.PI / 2 }), // Rotate around another point
+  fn: "add",
+  param: "i",
+  expect: "2i"
+}, {
+  set: Complex(0, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940457 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(0, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940454 + 1.5707963266948965i"
+}, {
+  set: Complex(1, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948957i"
+}, {
+  set: Complex(1, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(1, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}, {
+  set: Complex(-1, 10000000000),
+  fn: "log",
+  param: null,
+  expect: "23.025850929940454 + 1.5707963268948968i"
+}, {
+  set: Complex(-1, 1000000000000000),
+  fn: "log",
+  param: null,
+  expect: "34.538776394910684 + 1.5707963267948977i"
+}, {
+  set: Complex(-1, 100000000000000000),
+  fn: "log",
+  param: null,
+  expect: "39.14394658089878 + 1.5707963267948968i"
+}, {
+  set: Complex(-1, 10000000000000000000),
+  fn: "log",
+  param: null,
+  expect: "43.74911676688687 + 1.5707963267948966i"
+}, {
+  set: Complex(-1, 1e+30),
+  fn: "log",
+  param: null,
+  expect: "69.07755278982137 + 1.5707963267948966i"
+}];
+
+var constructorTests = [{
+  set: null,
+  expect: "0"
+}, {
+  set: undefined,
+  expect: "0"
+}, {
+  set: "foo",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: {},
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: " + i",
+  expect: "i"
+}, {
+  set: "3+4i",
+  expect: "3 + 4i"
+}, {
+  set: "i",
+  expect: "i"
+}, {
+  set: "3",
+  expect: "3"
+}, {
+  set: [9, 8],
+  expect: "9 + 8i"
+}, {
+  set: "2.3",
+  expect: "2.3"
+}, {
+  set: "2.3",
+  expect: "2.3"
+}, {
+  set: "0",
+  expect: "0"
+}, {
+  set: "-0",
+  expect: "0"
+}, {
+  set: { re: -0, im: 0 },
+  expect: "0"
+}, {
+  set: { re: 0, im: -0 },
+  expect: "0"
+}, {
+  set: Infinity,
+  expect: "Infinity"
+}, {
+  set: -Infinity,
+  expect: "Infinity"
+}, {
+  set: { re: Infinity, im: 0 },
+  expect: "Infinity"
+}, {
+  set: { re: -Infinity, im: 0 },
+  expect: "Infinity"
+}, {
+  set: { re: 0, im: Infinity },
+  expect: "Infinity"
+}, {
+  set: { re: 0, im: -Infinity },
+  expect: "Infinity"
+}, {
+  set: " + 7  - i  +  3i   -  +  +  +  + 43  +  2i  -  i4  +  -  33  +  65 - 1	",
+  expect: "-5"
+}, {
+  set: " + 7  - i  +  3i   -  +  +  +  + 43  +  2i  -  i4  +  -  33  +  65 - 1	 + ",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "-3x + 4",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "- + 7",
+  expect: "-7"
+}, {
+  set: "4 5i",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "-",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: "2.2e-1-3.2e-1i",
+  expect: "0.22 - 0.32i"
+}, {
+  set: "2.2.",
+  error: "SyntaxError: Invalid Param"
+}, {
+  set: { r: 0, phi: 4 },
+  expect: "0"
+}, {
+  set: { r: 1, phi: 1 },
+  expect: "0.5403023058681398 + 0.8414709848078965i"
+}, {
+  set: { r: Infinity, phi: 0 },
+  expect: "Infinity"
+}, {
+  set: { r: Infinity, phi: 2 },
+  expect: "Infinity"
+}, {
+  set: { r: Infinity, phi: Infinity },
+  expect: "NaN"
+}, {
+  set: { r: Infinity, phi: NaN },
+  expect: "NaN"
+}, {
+  set: "1000_000i",
+  expect: "1000000i"
+}
+];
+
+for (let i = 0, len = constructorTests.length; i < len; ++i) {
+  if (constructorTests[i].set != null && constructorTests[i].set.hasOwnProperty('r')) {
+    constructorTests.push({
+      set: {
+        abs: constructorTests[i].set.r,
+        arg: constructorTests[i].set.phi,
+      },
+      expect: constructorTests[i].expect
+    })
+  }
+}
+
+
+function stringify(value) {
+  return JSON.stringify(value, function replacer(key, val) {
+    if (typeof val === "number") {
+      return val.toString();
+    }
+    return val;
+  })
+}
+
+function describeTest(test) {
+  var ctor = "new Complex(" + (test.set !== undefined ? stringify(test.set) : "") + ")";
+
+  var fnCall = test.fn == null
+    ? ""
+    : "." + test.fn + "(" + (test.param !== undefined ? stringify(test.param) : "") + ")";
+
+  var expectedResult = test.expect == null
+    ? ""
+    : " === " + stringify(test.expect);
+
+  var error = test.error == null
+    ? ""
+    : " should throw " + test.error;
+
+  return ctor + fnCall + expectedResult + error;
+}
+
+describe("Complex functions", function () {
+
+  for (var i = 0; i < functionTests.length; i++) {
+
+    (function (test) {
+
+      it(describeTest(test), function () {
+        if (test.error) {
+          try {
+            new Complex(test.set)[test.fn](test.param);
+          } catch (e) {
+            assert.strictEqual(e.toString(), test.error.toString());
+          }
+        } else {
+          assert.strictEqual(new Complex(test.set)[test.fn](test.param).toString(), test.expect);
+        }
+      });
+    })(functionTests[i]);
+  }
+});
+
+describe("Complex constructor", function () {
+
+  for (var i = 0; i < constructorTests.length; i++) {
+
+    (function (test) {
+      it(describeTest(test), function () {
+        if (test.error) {
+          try {
+            new Complex(test.set);
+          } catch (e) {
+            assert.strictEqual(e.toString(), test.error.toString());
+          }
+        } else {
+          assert.strictEqual(new Complex(test.set).toString(), test.expect);
+        }
+      });
+    })(constructorTests[i]);
+  }
+});
+
+describe("Complex Details", function () {
+
+  it("should work with different params", function () {
+    assert.strictEqual(Complex(1, -1).toString(), "1 - i");
+    assert.strictEqual(Complex(0, 0).toString(), "0");
+    assert.strictEqual(Complex(0, 2).toString(), "2i");
+    assert.strictEqual(Complex.I.toString(), "i");
+    assert.strictEqual(Complex(0, -2).toString(), "-2i");
+    assert.strictEqual(Complex({ re: 0, im: -2 }).toString(), "-2i");
+  });
+
+  it("Complex Combinations", function () {
+
+    var zero = Complex(0, 0), one = Complex(1, 1), two = Complex(2, 2);
+
+    assert.strictEqual(zero.toString(), "0");
+    assert.strictEqual(one.toString(), "1 + i");
+    assert(one.neg().equals(Complex(-1, -1)));
+    assert(one.conjugate().equals(Complex(1, -1)));
+    assert.strictEqual(one.abs(), Math.SQRT2);
+    assert.strictEqual(one.arg(), Math.PI / 4);
+    assert.strictEqual(one.add(one).toString(), two.toString());
+    assert.strictEqual(one.sub(one).toString(), zero.toString());
+    assert.strictEqual(one.mul(2).toString(), two.toString());
+    assert.strictEqual(one.mul(one).toString(), Complex(0, 2).toString());
+    assert.strictEqual(one.div(2).toString(), "0.5 + 0.5i");
+    assert.strictEqual(one.div(one).toString(), "1");
+    assert.strictEqual(one.div(0).toString(), "Infinity");
+    assert.strictEqual(one.exp().toString(), "1.4686939399158851 + 2.2873552871788423i");
+    assert.strictEqual(one.log().toString(), "0.34657359027997264 + 0.7853981633974483i");
+    assert.strictEqual(one.pow(one).toString(), "0.2739572538301211 + 0.5837007587586147i");
+    assert.strictEqual(one.pow(zero).toString(), "1");
+    assert.strictEqual(one.sqrt().toString(), "1.09868411346781 + 0.45508986056222733i");
+    assert.strictEqual(one.sin().toString(), "1.2984575814159773 + 0.6349639147847361i");
+    assert.strictEqual(one.cos().toString(), "0.8337300251311491 - 0.9888977057628651i");
+    assert.strictEqual(one.tan().toString(), "0.27175258531951174 + 1.0839233273386948i");
+    assert.strictEqual(one.asin().toString(), "0.6662394324925153 + 1.0612750619050355i");
+    assert.strictEqual(one.acos().toString(), "0.9045568943023813 - 1.0612750619050355i");
+    assert.strictEqual(one.atan().toString(), "1.0172219678978514 + 0.40235947810852507i");
+
+    var t = Complex(3, 4);
+    assert.strictEqual(t.asinh().toString(), "2.29991404087927 + 0.9176168533514786i");
+
+    assert.strictEqual(t.abs(), 5);
+
+    assert.strictEqual(Complex("5i + 3").log().exp().toString(), "3 + 5i")
+    assert.strictEqual(Complex("-2i - 1").log().exp().toString(), "-1 - 2i")
+  });
+
+  it("should calculate distributed conjugate", function () {
+
+    var c1 = Complex(7, 3);
+    var c2 = Complex(1, 2);
+
+    var r1 = c1.add(c2).conjugate();
+    var r2 = c1.conjugate().add(c2.conjugate());
+
+    assert.strictEqual(r1.toString(), r2.toString());
+  });
+
+  it("should be raised to power of 6", function () {
+    var c1 = Complex(2, 2);
+
+    var t = c1.pow(6);
+
+    assert.strictEqual(t.toString(), "-9.405287417451663e-14 - 511.9999999999995i");
+  });
+
+  it("should handle inverse trig fns", function () {
+
+    var values = [
+      new Complex(2.3, 1.4),
+      new Complex(-2.3, 1.4),
+      new Complex(-2.3, -1.4),
+      new Complex(2.3, -1.4)];
+
+    var fns = ['sin', 'cos', 'tan'];
+
+    for (var i = 0; i < values.length; i++) {
+
+      for (var j = 0; j < 3; j++) {
+
+        var a = values[i]['a' + fns[j]]()[fns[j]]();
+
+        var res = values[i];
+
+        assert(Math.abs(a.re - res.re) < 1e-12 && Math.abs(a.im - res.im) < 1e-12);
+      }
+    }
+  });
+
+  it('should handle get real part', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).re, Math.SQRT2 / 2);
+  });
+
+  it('should handle get complex part', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).im, 0.7071067811865475);
+  });
+
+  it('should calculate the acosh correctly', function () {
+    assert.strictEqual(Complex({ re: 0.451, im: 0 }).acosh().im, 1.1029108863861707);
+  });
+
+  it('should handle sum', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).add({ abs: 1, arg: Math.PI / 2 }).abs(), Math.SQRT2);
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).add({ abs: 1, arg: Math.PI / 2 }).arg(), Math.PI / 4);
+  });
+
+  it('should handle conjugate', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: Math.PI / 4 }).conjugate().toString(), Complex({ abs: 1, arg: -Math.PI / 4 }).toString());
+  });
+
+  it('should handle substract', function () {
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).sub({ abs: 1, arg: Math.PI / 2 }).abs().toString(), "1.414213562373095");
+    assert.strictEqual(Complex({ abs: 1, arg: 0 }).sub({ abs: 1, arg: Math.PI / 2 }).arg().toString(), "-0.7853981633974484");
+  });
+
+  it('should handle arg for the first quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: 1 }).arg(), Math.PI / 4);
+  });
+
+  it('should handle arg for the second quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: 1 }).arg(), 3 * Math.PI / 4);
+  });
+
+  it('should handle arg for the third quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: -1 }).arg(), -3 * Math.PI / 4);
+  });
+
+  it('should handle arg for the fourth quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: -1 }).arg(), -Math.PI / 4);
+  });
+
+  it('should handle arg for the fourth and first quadrant', function () {
+    assert.strictEqual(Complex({ re: 1, im: 0 }).arg(), 0);
+  });
+
+  it('should handle arg for first and second quadrant', function () {
+    assert.strictEqual(Complex({ re: 0, im: 1 }).arg(), Math.PI / 2);
+  });
+
+  it('should handle arg for the second and third quadrant', function () {
+    assert.strictEqual(Complex({ re: -1, im: 0 }).arg(), Math.PI);
+  });
+
+  it('should handle arg for the third and fourth quadrant', function () {
+    assert.strictEqual(Complex({ re: 0, im: -1 }).arg(), -Math.PI / 2);
+  });
+
+  it("should eat its own dog food", function () {
+
+    var a = Complex(1, -5).toString();
+    var b = Complex(a).toString();
+    var c = Complex(b).mul(a);
+
+    assert.strictEqual(c.toString(), '-24 - 10i');
+  });
+
+  it("should calculate the absolute value of i", function () {
+
+    var a = Complex("i").sign().inverse().mul("i");
+
+    assert.strictEqual(a.toString(), '1');
+  });
+
+  it('should take the natural logarithm', function () {
+    var n = Complex(Math.E * Math.E).log().div("i").mul(-Math.PI * 2, 1);
+
+    assert.strictEqual(n.toString(), '2 + ' + 4 * Math.PI + "i");
+  });
+
+  it('should follow exp rules', function () {
+
+    var a = Math.random() * 10;
+    var b = Math.random() * 10;
+
+    var t1 = Complex({ re: a, im: b }).exp();
+    var t2 = Complex(a).exp().mul(Complex.I.mul(b).exp());
+    var t3 = Complex(a).exp().mul(Complex({ re: 0, im: b }).exp());
+
+    assert.strictEqual(t1.toString(), t2.toString());
+    assert.strictEqual(t2.toString(), t3.toString());
+  });
+
+});
diff --git a/node_modules/cron-parser/LICENSE b/node_modules/cron-parser/LICENSE
new file mode 100644
index 0000000..958d42e
--- /dev/null
+++ b/node_modules/cron-parser/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2016 Harri Siirak
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/cron-parser/README.md b/node_modules/cron-parser/README.md
new file mode 100644
index 0000000..6c2aada
--- /dev/null
+++ b/node_modules/cron-parser/README.md
@@ -0,0 +1,175 @@
+cron-parser
+================
+
+[![Build Status](https://github.com/harrisiirak/cron-parser/actions/workflows/push.yml/badge.svg?branch=master)](https://github.com/harrisiirak/cron-parser/actions/workflows/push.yml)
+[![NPM version](https://badge.fury.io/js/cron-parser.png)](http://badge.fury.io/js/cron-parser)
+
+Node.js library for parsing and manipulating crontab instructions. It includes support for timezones and DST transitions.
+
+__Compatibility__  
+Node >= 12.0.0
+TypeScript >= 4.2
+
+Setup
+========
+```bash
+npm install cron-parser
+```
+
+Supported format
+========
+
+```
+*    *    *    *    *    *
+┬    ┬    ┬    ┬    ┬    ┬
+│    │    │    │    │    |
+│    │    │    │    │    └ day of week (0 - 7, 1L - 7L) (0 or 7 is Sun)
+│    │    │    │    └───── month (1 - 12)
+│    │    │    └────────── day of month (1 - 31, L)
+│    │    └─────────────── hour (0 - 23)
+│    └──────────────────── minute (0 - 59)
+└───────────────────────── second (0 - 59, optional)
+```
+
+Supports mixed use of ranges and range increments (W character not supported currently). See tests for examples.
+
+Usage
+========
+
+Simple expression.
+
+```javascript
+var parser = require('cron-parser');
+
+try {
+  var interval = parser.parseExpression('*/2 * * * *');
+
+  console.log('Date: ', interval.next().toString()); // Sat Dec 29 2012 00:42:00 GMT+0200 (EET)
+  console.log('Date: ', interval.next().toString()); // Sat Dec 29 2012 00:44:00 GMT+0200 (EET)
+
+  console.log('Date: ', interval.prev().toString()); // Sat Dec 29 2012 00:42:00 GMT+0200 (EET)
+  console.log('Date: ', interval.prev().toString()); // Sat Dec 29 2012 00:40:00 GMT+0200 (EET)
+} catch (err) {
+  console.log('Error: ' + err.message);
+}
+
+```
+
+Iteration with limited timespan. Also returns ES6 compatible iterator (when iterator flag is set to true).
+
+```javascript
+var parser = require('cron-parser');
+
+var options = {
+  currentDate: new Date('Wed, 26 Dec 2012 12:38:53 UTC'),
+  endDate: new Date('Wed, 26 Dec 2012 14:40:00 UTC'),
+  iterator: true
+};
+
+try {
+  var interval = parser.parseExpression('*/22 * * * *', options);
+
+  while (true) {
+    try {
+      var obj = interval.next();
+      console.log('value:', obj.value.toString(), 'done:', obj.done);
+    } catch (e) {
+      break;
+    }
+  }
+
+  // value: Wed Dec 26 2012 14:44:00 GMT+0200 (EET) done: false
+  // value: Wed Dec 26 2012 15:00:00 GMT+0200 (EET) done: false
+  // value: Wed Dec 26 2012 15:22:00 GMT+0200 (EET) done: false
+  // value: Wed Dec 26 2012 15:44:00 GMT+0200 (EET) done: false
+  // value: Wed Dec 26 2012 16:00:00 GMT+0200 (EET) done: false
+  // value: Wed Dec 26 2012 16:22:00 GMT+0200 (EET) done: true
+} catch (err) {
+  console.log('Error: ' + err.message);
+}
+
+```
+
+Timezone support
+
+```javascript
+var parser = require('cron-parser');
+
+var options = {
+  currentDate: '2016-03-27 00:00:01',
+  tz: 'Europe/Athens'
+};
+
+try {
+  var interval = parser.parseExpression('0 * * * *', options);
+
+  console.log('Date: ', interval.next().toString()); // Date:  Sun Mar 27 2016 01:00:00 GMT+0200
+  console.log('Date: ', interval.next().toString()); // Date:  Sun Mar 27 2016 02:00:00 GMT+0200
+  console.log('Date: ', interval.next().toString()); // Date:  Sun Mar 27 2016 04:00:00 GMT+0300 (Notice DST transition)
+} catch (err) {
+  console.log('Error: ' + err.message);
+}
+```
+
+Manipulation 
+
+```javascript
+var parser = require('cron-parser');
+
+var interval = parser.parseExpression('0 7 * * 0-4');
+var fields = JSON.parse(JSON.stringify(interval.fields)); // Fields is immutable
+fields.hour = [8];
+fields.minute = [29];
+fields.dayOfWeek = [1,3,4,5,6,7];
+var modifiedInterval = parser.fieldsToExpression(fields);
+var cronString = modifiedInterval.stringify();
+console.log(cronString); // "29 8 * * 1,3-7"
+```
+
+Options
+========
+
+* *currentDate* - Start date of the iteration
+* *endDate* - End date of the iteration
+
+`currentDate` and `endDate` accept `string`, `integer` and `Date` as input.
+
+In case of using `string` as input, not every string format accepted
+by the `Date` constructor will work correctly. 
+The supported formats are: 
+- [`ISO8601`](https://moment.github.io/luxon/#/parsing?id=iso-8601)
+- [`HTTP and RFC2822`](https://moment.github.io/luxon/#/parsing?id=http-and-rfc2822)
+- [`SQL`](https://moment.github.io/luxon/#/parsing?id=sql) 
+
+The reason being that those are the formats accepted by the
+[`luxon`](https://moment.github.io/luxon/) library which is being used to handle dates.
+
+Using `Date` as an input can be problematic specially when using the `tz` option. The issue being that, when creating a new `Date` object without
+any timezone information, it will be created in the timezone of the system that is running the code. This (most of times) won't be what the user
+will be expecting. Using one of the supported `string` formats will solve the issue(see timezone example).
+
+* *iterator* - Return ES6 compatible iterator object 
+* *utc* - Enable UTC
+* *tz* - Timezone string. It won't be used in case `utc` is enabled
+
+Last weekday of the month
+=========================
+
+This library supports parsing the range `0L - 7L` in the `weekday` position of
+the cron expression, where the `L` means "last occurrence of this weekday for
+the month in progress".
+
+For example, the following expression will run on the last monday of the month
+at midnight:
+
+```
+0 0 0 * * 1L
+```
+
+The library also supports combining `L` expressions with other weekday
+expressions. For example, the following cron will run every Monday as well
+as the last Wednesday of the month:
+
+```
+0 0 0 * * 1,3L
+```
diff --git a/node_modules/cron-parser/lib/date.js b/node_modules/cron-parser/lib/date.js
new file mode 100644
index 0000000..c54e3a5
--- /dev/null
+++ b/node_modules/cron-parser/lib/date.js
@@ -0,0 +1,252 @@
+'use strict';
+
+var luxon = require('luxon');
+
+CronDate.prototype.addYear = function() {
+  this._date = this._date.plus({ years: 1 });
+};
+
+CronDate.prototype.addMonth = function() {
+  this._date = this._date.plus({ months: 1 }).startOf('month');
+};
+
+CronDate.prototype.addDay = function() {
+  this._date = this._date.plus({ days: 1 }).startOf('day');
+};
+
+CronDate.prototype.addHour = function() {
+  var prev = this._date;
+  this._date = this._date.plus({ hours: 1 }).startOf('hour');
+  if (this._date <= prev) {
+    this._date = this._date.plus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.addMinute = function() {
+  var prev = this._date;
+  this._date = this._date.plus({ minutes: 1 }).startOf('minute');
+  if (this._date < prev) {
+    this._date = this._date.plus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.addSecond = function() {
+  var prev = this._date;
+  this._date = this._date.plus({ seconds: 1 }).startOf('second');
+  if (this._date < prev) {
+    this._date = this._date.plus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.subtractYear = function() {
+  this._date = this._date.minus({ years: 1 });
+};
+
+CronDate.prototype.subtractMonth = function() {
+  this._date = this._date
+    .minus({ months: 1 })
+    .endOf('month')
+    .startOf('second');
+};
+
+CronDate.prototype.subtractDay = function() {
+  this._date = this._date
+    .minus({ days: 1 })
+    .endOf('day')
+    .startOf('second');
+};
+
+CronDate.prototype.subtractHour = function() {
+  var prev = this._date;
+  this._date = this._date
+    .minus({ hours: 1 })
+    .endOf('hour')
+    .startOf('second');
+  if (this._date >= prev) {
+    this._date = this._date.minus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.subtractMinute = function() {
+  var prev = this._date;
+  this._date = this._date.minus({ minutes: 1 })
+    .endOf('minute')
+    .startOf('second');
+  if (this._date > prev) {
+    this._date = this._date.minus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.subtractSecond = function() {
+  var prev = this._date;
+  this._date = this._date
+    .minus({ seconds: 1 })
+    .startOf('second');
+  if (this._date > prev) {
+    this._date = this._date.minus({ hours: 1 });
+  }
+};
+
+CronDate.prototype.getDate = function() {
+  return this._date.day;
+};
+
+CronDate.prototype.getFullYear = function() {
+  return this._date.year;
+};
+
+CronDate.prototype.getDay = function() {
+  var weekday = this._date.weekday;
+  return weekday == 7 ? 0 : weekday;
+};
+
+CronDate.prototype.getMonth = function() {
+  return this._date.month - 1;
+};
+
+CronDate.prototype.getHours = function() {
+  return this._date.hour;
+};
+
+CronDate.prototype.getMinutes = function() {
+  return this._date.minute;
+};
+
+CronDate.prototype.getSeconds = function() {
+  return this._date.second;
+};
+
+CronDate.prototype.getMilliseconds = function() {
+  return this._date.millisecond;
+};
+
+CronDate.prototype.getTime = function() {
+  return this._date.valueOf();
+};
+
+CronDate.prototype.getUTCDate = function() {
+  return this._getUTC().day;
+};
+
+CronDate.prototype.getUTCFullYear = function() {
+  return this._getUTC().year;
+};
+
+CronDate.prototype.getUTCDay = function() {
+  var weekday = this._getUTC().weekday;
+  return weekday == 7 ? 0 : weekday;
+};
+
+CronDate.prototype.getUTCMonth = function() {
+  return this._getUTC().month - 1;
+};
+
+CronDate.prototype.getUTCHours = function() {
+  return this._getUTC().hour;
+};
+
+CronDate.prototype.getUTCMinutes = function() {
+  return this._getUTC().minute;
+};
+
+CronDate.prototype.getUTCSeconds = function() {
+  return this._getUTC().second;
+};
+
+CronDate.prototype.toISOString = function() {
+  return this._date.toUTC().toISO();
+};
+
+CronDate.prototype.toJSON = function() {
+  return this._date.toJSON();
+};
+
+CronDate.prototype.setDate = function(d) {
+  this._date = this._date.set({ day: d });
+};
+
+CronDate.prototype.setFullYear = function(y) {
+  this._date = this._date.set({ year: y });
+};
+
+CronDate.prototype.setDay = function(d) {
+  this._date = this._date.set({ weekday: d });
+};
+
+CronDate.prototype.setMonth = function(m) {
+  this._date = this._date.set({ month: m + 1 });
+};
+
+CronDate.prototype.setHours = function(h) {
+  this._date = this._date.set({ hour: h });
+};
+
+CronDate.prototype.setMinutes = function(m) {
+  this._date = this._date.set({ minute: m });
+};
+
+CronDate.prototype.setSeconds = function(s) {
+  this._date = this._date.set({ second: s });
+};
+
+CronDate.prototype.setMilliseconds = function(s) {
+  this._date = this._date.set({ millisecond: s });
+};
+
+CronDate.prototype._getUTC = function() {
+  return this._date.toUTC();
+};
+
+CronDate.prototype.toString = function() {
+  return this.toDate().toString();
+};
+
+CronDate.prototype.toDate = function() {
+  return this._date.toJSDate();
+};
+
+CronDate.prototype.isLastDayOfMonth = function() {
+  //next day
+  var newDate = this._date.plus({ days: 1 }).startOf('day');
+  return this._date.month !== newDate.month;
+};
+
+/**
+ * Returns true when the current weekday is the last occurrence of this weekday
+ * for the present month.
+ */
+CronDate.prototype.isLastWeekdayOfMonth = function() {
+  // Check this by adding 7 days to the current date and seeing if it's
+  // a different month
+  var newDate = this._date.plus({ days: 7 }).startOf('day');
+  return this._date.month !== newDate.month;
+};
+
+function CronDate (timestamp, tz) {
+  var dateOpts = { zone: tz };
+  if (!timestamp) {
+    this._date = luxon.DateTime.local();
+  } else if (timestamp instanceof CronDate) {
+    this._date = timestamp._date;
+  } else if (timestamp instanceof Date) {
+    this._date = luxon.DateTime.fromJSDate(timestamp, dateOpts);
+  } else if (typeof timestamp === 'number') {
+    this._date = luxon.DateTime.fromMillis(timestamp, dateOpts);
+  } else if (typeof timestamp === 'string') {
+    this._date = luxon.DateTime.fromISO(timestamp, dateOpts);
+    this._date.isValid || (this._date = luxon.DateTime.fromRFC2822(timestamp, dateOpts));
+    this._date.isValid || (this._date = luxon.DateTime.fromSQL(timestamp, dateOpts));
+    // RFC2822-like format without the required timezone offset (used in tests)
+    this._date.isValid || (this._date = luxon.DateTime.fromFormat(timestamp, 'EEE, d MMM yyyy HH:mm:ss', dateOpts));
+  }
+
+  if (!this._date || !this._date.isValid) {
+    throw new Error('CronDate: unhandled timestamp: ' + JSON.stringify(timestamp));
+  }
+  
+  if (tz && tz !== this._date.zoneName) {
+    this._date = this._date.setZone(tz);
+  }
+}
+
+module.exports = CronDate;
diff --git a/node_modules/cron-parser/lib/expression.js b/node_modules/cron-parser/lib/expression.js
new file mode 100644
index 0000000..0a56853
--- /dev/null
+++ b/node_modules/cron-parser/lib/expression.js
@@ -0,0 +1,1002 @@
+'use strict';
+
+// Load Date class extensions
+var CronDate = require('./date');
+
+var stringifyField = require('./field_stringify');
+
+/**
+ * Cron iteration loop safety limit
+ */
+var LOOP_LIMIT = 10000;
+
+/**
+ * Construct a new expression parser
+ *
+ * Options:
+ *   currentDate: iterator start date
+ *   endDate: iterator end date
+ *
+ * @constructor
+ * @private
+ * @param {Object} fields  Expression fields parsed values
+ * @param {Object} options Parser options
+ */
+function CronExpression (fields, options) {
+  this._options = options;
+  this._utc = options.utc || false;
+  this._tz = this._utc ? 'UTC' : options.tz;
+  this._currentDate = new CronDate(options.currentDate, this._tz);
+  this._startDate = options.startDate ? new CronDate(options.startDate, this._tz) : null;
+  this._endDate = options.endDate ? new CronDate(options.endDate, this._tz) : null;
+  this._isIterator = options.iterator || false;
+  this._hasIterated = false;
+  this._nthDayOfWeek = options.nthDayOfWeek || 0;
+  this.fields = CronExpression._freezeFields(fields);
+}
+
+/**
+ * Field mappings
+ * @type {Array}
+ */
+CronExpression.map = [ 'second', 'minute', 'hour', 'dayOfMonth', 'month', 'dayOfWeek' ];
+
+/**
+ * Prefined intervals
+ * @type {Object}
+ */
+CronExpression.predefined = {
+  '@yearly': '0 0 1 1 *',
+  '@monthly': '0 0 1 * *',
+  '@weekly': '0 0 * * 0',
+  '@daily': '0 0 * * *',
+  '@hourly': '0 * * * *'
+};
+
+/**
+ * Fields constraints
+ * @type {Array}
+ */
+CronExpression.constraints = [
+  { min: 0, max: 59, chars: [] }, // Second
+  { min: 0, max: 59, chars: [] }, // Minute
+  { min: 0, max: 23, chars: [] }, // Hour
+  { min: 1, max: 31, chars: ['L'] }, // Day of month
+  { min: 1, max: 12, chars: [] }, // Month
+  { min: 0, max: 7, chars: ['L'] }, // Day of week
+];
+
+/**
+ * Days in month
+ * @type {number[]}
+ */
+CronExpression.daysInMonth = [
+  31,
+  29,
+  31,
+  30,
+  31,
+  30,
+  31,
+  31,
+  30,
+  31,
+  30,
+  31
+];
+
+/**
+ * Field aliases
+ * @type {Object}
+ */
+CronExpression.aliases = {
+  month: {
+    jan: 1,
+    feb: 2,
+    mar: 3,
+    apr: 4,
+    may: 5,
+    jun: 6,
+    jul: 7,
+    aug: 8,
+    sep: 9,
+    oct: 10,
+    nov: 11,
+    dec: 12
+  },
+
+  dayOfWeek: {
+    sun: 0,
+    mon: 1,
+    tue: 2,
+    wed: 3,
+    thu: 4,
+    fri: 5,
+    sat: 6
+  }
+};
+
+/**
+ * Field defaults
+ * @type {Array}
+ */
+CronExpression.parseDefaults = [ '0', '*', '*', '*', '*', '*' ];
+
+CronExpression.standardValidCharacters = /^[,*\d/-]+$/;
+CronExpression.dayOfWeekValidCharacters = /^[?,*\dL#/-]+$/;
+CronExpression.dayOfMonthValidCharacters = /^[?,*\dL/-]+$/;
+CronExpression.validCharacters = {
+  second: CronExpression.standardValidCharacters,
+  minute: CronExpression.standardValidCharacters,
+  hour: CronExpression.standardValidCharacters,
+  dayOfMonth: CronExpression.dayOfMonthValidCharacters,
+  month: CronExpression.standardValidCharacters,
+  dayOfWeek: CronExpression.dayOfWeekValidCharacters,
+};
+
+CronExpression._isValidConstraintChar = function _isValidConstraintChar(constraints, value) {
+  if (typeof value !== 'string') {
+    return false;
+  }
+
+  return constraints.chars.some(function(char) {
+    return value.indexOf(char) > -1;
+  });
+};
+
+/**
+ * Parse input interval
+ *
+ * @param {String} field Field symbolic name
+ * @param {String} value Field value
+ * @param {Array} constraints Range upper and lower constraints
+ * @return {Array} Sequence of sorted values
+ * @private
+ */
+CronExpression._parseField = function _parseField (field, value, constraints) {
+  // Replace aliases
+  switch (field) {
+    case 'month':
+    case 'dayOfWeek':
+      var aliases = CronExpression.aliases[field];
+
+      value = value.replace(/[a-z]{3}/gi, function(match) {
+        match = match.toLowerCase();
+
+        if (typeof aliases[match] !== 'undefined') {
+          return aliases[match];
+        } else {
+          throw new Error('Validation error, cannot resolve alias "' + match + '"');
+        }
+      });
+      break;
+  }
+
+  // Check for valid characters.
+  if (!(CronExpression.validCharacters[field].test(value))) {
+    throw new Error('Invalid characters, got value: ' + value);
+  }
+
+  // Replace '*' and '?'
+  if (value.indexOf('*') !== -1) {
+    value = value.replace(/\*/g, constraints.min + '-' + constraints.max);
+  } else if (value.indexOf('?') !== -1) {
+    value = value.replace(/\?/g, constraints.min + '-' + constraints.max);
+  }
+
+  //
+  // Inline parsing functions
+  //
+  // Parser path:
+  //  - parseSequence
+  //    - parseRepeat
+  //      - parseRange
+
+  /**
+   * Parse sequence
+   *
+   * @param {String} val
+   * @return {Array}
+   * @private
+   */
+  function parseSequence (val) {
+    var stack = [];
+
+    function handleResult (result) {
+      if (result instanceof Array) { // Make sequence linear
+        for (var i = 0, c = result.length; i < c; i++) {
+          var value = result[i];
+
+          if (CronExpression._isValidConstraintChar(constraints, value)) {
+            stack.push(value);
+            continue;
+          }
+          // Check constraints
+          if (typeof value !== 'number' || Number.isNaN(value) || value < constraints.min || value > constraints.max) {
+            throw new Error(
+                'Constraint error, got value ' + value + ' expected range ' +
+                constraints.min + '-' + constraints.max
+            );
+          }
+
+          stack.push(value);
+        }
+      } else { // Scalar value
+
+        if (CronExpression._isValidConstraintChar(constraints, result)) {
+          stack.push(result);
+          return;
+        }
+
+        var numResult = +result;
+
+        // Check constraints
+        if (Number.isNaN(numResult) || numResult < constraints.min || numResult > constraints.max) {
+          throw new Error(
+            'Constraint error, got value ' + result + ' expected range ' +
+            constraints.min + '-' + constraints.max
+          );
+        }
+
+        if (field === 'dayOfWeek') {
+          numResult = numResult % 7;
+        }
+
+        stack.push(numResult);
+      }
+    }
+
+    var atoms = val.split(',');
+    if (!atoms.every(function (atom) {
+      return atom.length > 0;
+    })) {
+      throw new Error('Invalid list value format');
+    }
+
+    if (atoms.length > 1) {
+      for (var i = 0, c = atoms.length; i < c; i++) {
+        handleResult(parseRepeat(atoms[i]));
+      }
+    } else {
+      handleResult(parseRepeat(val));
+    }
+
+    stack.sort(CronExpression._sortCompareFn);
+
+    return stack;
+  }
+
+  /**
+   * Parse repetition interval
+   *
+   * @param {String} val
+   * @return {Array}
+   */
+  function parseRepeat (val) {
+    var repeatInterval = 1;
+    var atoms = val.split('/');
+
+    if (atoms.length > 2) {
+      throw new Error('Invalid repeat: ' + val);
+    }
+
+    if (atoms.length > 1) {
+      if (atoms[0] == +atoms[0]) {
+        atoms = [atoms[0] + '-' + constraints.max, atoms[1]];
+      }
+      return parseRange(atoms[0], atoms[atoms.length - 1]);
+    }
+
+    return parseRange(val, repeatInterval);
+  }
+
+  /**
+   * Parse range
+   *
+   * @param {String} val
+   * @param {Number} repeatInterval Repetition interval
+   * @return {Array}
+   * @private
+   */
+  function parseRange (val, repeatInterval) {
+    var stack = [];
+    var atoms = val.split('-');
+
+    if (atoms.length > 1 ) {
+      // Invalid range, return value
+      if (atoms.length < 2) {
+        return +val;
+      }
+
+      if (!atoms[0].length) {
+        if (!atoms[1].length) {
+          throw new Error('Invalid range: ' + val);
+        }
+
+        return +val;
+      }
+
+      // Validate range
+      var min = +atoms[0];
+      var max = +atoms[1];
+
+      if (Number.isNaN(min) || Number.isNaN(max) ||
+          min < constraints.min || max > constraints.max) {
+        throw new Error(
+          'Constraint error, got range ' +
+          min + '-' + max +
+          ' expected range ' +
+          constraints.min + '-' + constraints.max
+        );
+      } else if (min > max) {
+        throw new Error('Invalid range: ' + val);
+      }
+
+      // Create range
+      var repeatIndex = +repeatInterval;
+
+      if (Number.isNaN(repeatIndex) || repeatIndex <= 0) {
+        throw new Error('Constraint error, cannot repeat at every ' + repeatIndex + ' time.');
+      }
+
+      // JS DOW is in range of 0-6 (SUN-SAT) but we also support 7 in the expression
+      // Handle case when range contains 7 instead of 0 and translate this value to 0
+      if (field === 'dayOfWeek' && max % 7 === 0) {
+        stack.push(0);
+      }
+
+      for (var index = min, count = max; index <= count; index++) {
+        var exists = stack.indexOf(index) !== -1;
+        if (!exists && repeatIndex > 0 && (repeatIndex % repeatInterval) === 0) {
+          repeatIndex = 1;
+          stack.push(index);
+        } else {
+          repeatIndex++;
+        }
+      }
+      return stack;
+    }
+
+    return Number.isNaN(+val) ? val : +val;
+  }
+
+  return parseSequence(value);
+};
+
+CronExpression._sortCompareFn = function(a, b) {
+  var aIsNumber = typeof a === 'number';
+  var bIsNumber = typeof b === 'number';
+
+  if (aIsNumber && bIsNumber) {
+    return a - b;
+  }
+
+  if (!aIsNumber && bIsNumber) {
+    return 1;
+  }
+
+  if (aIsNumber && !bIsNumber) {
+    return -1;
+  }
+
+  return a.localeCompare(b);
+};
+
+CronExpression._handleMaxDaysInMonth = function(mappedFields) {
+  // Filter out any day of month value that is larger than given month expects
+  if (mappedFields.month.length === 1) {
+    var daysInMonth = CronExpression.daysInMonth[mappedFields.month[0] - 1];
+
+    if (mappedFields.dayOfMonth[0] > daysInMonth) {
+      throw new Error('Invalid explicit day of month definition');
+    }
+
+    return mappedFields.dayOfMonth
+      .filter(function(dayOfMonth) {
+        return dayOfMonth === 'L' ? true : dayOfMonth <= daysInMonth;
+      })
+      .sort(CronExpression._sortCompareFn);
+  }
+};
+
+CronExpression._freezeFields = function(fields) {
+  for (var i = 0, c = CronExpression.map.length; i < c; ++i) {
+    var field = CronExpression.map[i]; // Field name
+    var value = fields[field];
+    fields[field] = Object.freeze(value);
+  }
+  return Object.freeze(fields);
+};
+
+CronExpression.prototype._applyTimezoneShift = function(currentDate, dateMathVerb, method) {
+  if ((method === 'Month') || (method === 'Day')) {
+    var prevTime = currentDate.getTime();
+    currentDate[dateMathVerb + method]();
+    var currTime = currentDate.getTime();
+    if (prevTime === currTime) {
+      // Jumped into a not existent date due to a DST transition
+      if ((currentDate.getMinutes() === 0) &&
+          (currentDate.getSeconds() === 0)) {
+        currentDate.addHour();
+      } else if ((currentDate.getMinutes() === 59) &&
+                 (currentDate.getSeconds() === 59)) {
+        currentDate.subtractHour();
+      }
+    }
+  } else {
+    var previousHour = currentDate.getHours();
+    currentDate[dateMathVerb + method]();
+    var currentHour = currentDate.getHours();
+    var diff = currentHour - previousHour;
+    if (diff === 2) {
+        // Starting DST
+        if (this.fields.hour.length !== 24) {
+          // Hour is specified
+          this._dstStart = currentHour;
+        }
+      } else if ((diff === 0) &&
+                 (currentDate.getMinutes() === 0) &&
+                 (currentDate.getSeconds() === 0)) {
+        // Ending DST
+        if (this.fields.hour.length !== 24) {
+          // Hour is specified
+          this._dstEnd = currentHour;
+        }
+      }
+  }
+};
+
+
+/**
+ * Find next or previous matching schedule date
+ *
+ * @return {CronDate}
+ * @private
+ */
+CronExpression.prototype._findSchedule = function _findSchedule (reverse) {
+
+  /**
+   * Match field value
+   *
+   * @param {String} value
+   * @param {Array} sequence
+   * @return {Boolean}
+   * @private
+   */
+  function matchSchedule (value, sequence) {
+    for (var i = 0, c = sequence.length; i < c; i++) {
+      if (sequence[i] >= value) {
+        return sequence[i] === value;
+      }
+    }
+
+    return sequence[0] === value;
+  }
+
+  /**
+   * Helps determine if the provided date is the correct nth occurence of the
+   * desired day of week.
+   *
+   * @param {CronDate} date
+   * @param {Number} nthDayOfWeek
+   * @return {Boolean}
+   * @private
+   */
+  function isNthDayMatch(date, nthDayOfWeek) {
+    if (nthDayOfWeek < 6) {
+      if (
+        date.getDate() < 8 &&
+        nthDayOfWeek === 1 // First occurence has to happen in first 7 days of the month
+      ) {
+        return true;
+      }
+
+      var offset = date.getDate() % 7 ? 1 : 0; // Math is off by 1 when dayOfWeek isn't divisible by 7
+      var adjustedDate = date.getDate() - (date.getDate() % 7); // find the first occurance
+      var occurrence = Math.floor(adjustedDate / 7) + offset;
+
+      return occurrence === nthDayOfWeek;
+    }
+
+    return false;
+  }
+
+  /**
+   * Helper function that checks if 'L' is in the array
+   *
+   * @param {Array} expressions
+   */
+  function isLInExpressions(expressions) {
+    return expressions.length > 0 && expressions.some(function(expression) {
+      return typeof expression === 'string' && expression.indexOf('L') >= 0;
+    });
+  }
+
+
+  // Whether to use backwards directionality when searching
+  reverse = reverse || false;
+  var dateMathVerb = reverse ? 'subtract' : 'add';
+
+  var currentDate = new CronDate(this._currentDate, this._tz);
+  var startDate = this._startDate;
+  var endDate = this._endDate;
+
+  // Find matching schedule
+  var startTimestamp = currentDate.getTime();
+  var stepCount = 0;
+
+  function isLastWeekdayOfMonthMatch(expressions) {
+    return expressions.some(function(expression) {
+      // There might be multiple expressions and not all of them will contain
+      // the "L".
+      if (!isLInExpressions([expression])) {
+        return false;
+      }
+
+      // The first character represents the weekday
+      var weekday = Number.parseInt(expression[0]) % 7;
+
+      if (Number.isNaN(weekday)) {
+        throw new Error('Invalid last weekday of the month expression: ' + expression);
+      }
+
+      return currentDate.getDay() === weekday && currentDate.isLastWeekdayOfMonth();
+    });
+  }
+
+  while (stepCount < LOOP_LIMIT) {
+    stepCount++;
+
+    // Validate timespan
+    if (reverse) {
+      if (startDate && (currentDate.getTime() - startDate.getTime() < 0)) {
+        throw new Error('Out of the timespan range');
+      }
+    } else {
+      if (endDate && (endDate.getTime() - currentDate.getTime()) < 0) {
+        throw new Error('Out of the timespan range');
+      }
+    }
+
+    // Day of month and week matching:
+    //
+    // "The day of a command's execution can be specified by two fields --
+    // day of month, and day of week.  If  both	 fields	 are  restricted  (ie,
+    // aren't  *),  the command will be run when either field matches the cur-
+    // rent time.  For example, "30 4 1,15 * 5" would cause a command to be
+    // run at 4:30 am on the  1st and 15th of each month, plus every Friday."
+    //
+    // http://unixhelp.ed.ac.uk/CGI/man-cgi?crontab+5
+    //
+
+    var dayOfMonthMatch = matchSchedule(currentDate.getDate(), this.fields.dayOfMonth);
+    if (isLInExpressions(this.fields.dayOfMonth)) {
+      dayOfMonthMatch = dayOfMonthMatch || currentDate.isLastDayOfMonth();
+    }
+    var dayOfWeekMatch = matchSchedule(currentDate.getDay(), this.fields.dayOfWeek);
+    if (isLInExpressions(this.fields.dayOfWeek)) {
+      dayOfWeekMatch = dayOfWeekMatch || isLastWeekdayOfMonthMatch(this.fields.dayOfWeek);
+    }
+    var isDayOfMonthWildcardMatch = this.fields.dayOfMonth.length >= CronExpression.daysInMonth[currentDate.getMonth()];
+    var isDayOfWeekWildcardMatch = this.fields.dayOfWeek.length === CronExpression.constraints[5].max - CronExpression.constraints[5].min + 1;
+    var currentHour = currentDate.getHours();
+
+    // Add or subtract day if select day not match with month (according to calendar)
+    if (!dayOfMonthMatch && (!dayOfWeekMatch || isDayOfWeekWildcardMatch)) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Day');
+      continue;
+    }
+
+    // Add or subtract day if not day of month is set (and no match) and day of week is wildcard
+    if (!isDayOfMonthWildcardMatch && isDayOfWeekWildcardMatch && !dayOfMonthMatch) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Day');
+      continue;
+    }
+
+    // Add or subtract day if not day of week is set (and no match) and day of month is wildcard
+    if (isDayOfMonthWildcardMatch && !isDayOfWeekWildcardMatch && !dayOfWeekMatch) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Day');
+      continue;
+    }
+
+    // Add or subtract day if day of week & nthDayOfWeek are set (and no match)
+    if (
+      this._nthDayOfWeek > 0 &&
+      !isNthDayMatch(currentDate, this._nthDayOfWeek)
+    ) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Day');
+      continue;
+    }
+
+    // Match month
+    if (!matchSchedule(currentDate.getMonth() + 1, this.fields.month)) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Month');
+      continue;
+    }
+
+    // Match hour
+    if (!matchSchedule(currentHour, this.fields.hour)) {
+      if (this._dstStart !== currentHour) {
+        this._dstStart = null;
+        this._applyTimezoneShift(currentDate, dateMathVerb, 'Hour');
+        continue;
+      } else if (!matchSchedule(currentHour - 1, this.fields.hour)) {
+        currentDate[dateMathVerb + 'Hour']();
+        continue;
+      }
+    } else if (this._dstEnd === currentHour) {
+      if (!reverse) {
+        this._dstEnd = null;
+        this._applyTimezoneShift(currentDate, 'add', 'Hour');
+        continue;
+      }
+    }
+
+    // Match minute
+    if (!matchSchedule(currentDate.getMinutes(), this.fields.minute)) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Minute');
+      continue;
+    }
+
+    // Match second
+    if (!matchSchedule(currentDate.getSeconds(), this.fields.second)) {
+      this._applyTimezoneShift(currentDate, dateMathVerb, 'Second');
+      continue;
+    }
+
+    // Increase a second in case in the first iteration the currentDate was not
+    // modified
+    if (startTimestamp === currentDate.getTime()) {
+      if ((dateMathVerb === 'add') || (currentDate.getMilliseconds() === 0)) {
+        this._applyTimezoneShift(currentDate, dateMathVerb, 'Second');
+      } else {
+        currentDate.setMilliseconds(0);
+      }
+
+      continue;
+    }
+
+    break;
+  }
+
+  if (stepCount >= LOOP_LIMIT) {
+    throw new Error('Invalid expression, loop limit exceeded');
+  }
+
+  this._currentDate = new CronDate(currentDate, this._tz);
+  this._hasIterated = true;
+
+  return currentDate;
+};
+
+/**
+ * Find next suitable date
+ *
+ * @public
+ * @return {CronDate|Object}
+ */
+CronExpression.prototype.next = function next () {
+  var schedule = this._findSchedule();
+
+  // Try to return ES6 compatible iterator
+  if (this._isIterator) {
+    return {
+      value: schedule,
+      done: !this.hasNext()
+    };
+  }
+
+  return schedule;
+};
+
+/**
+ * Find previous suitable date
+ *
+ * @public
+ * @return {CronDate|Object}
+ */
+CronExpression.prototype.prev = function prev () {
+  var schedule = this._findSchedule(true);
+
+  // Try to return ES6 compatible iterator
+  if (this._isIterator) {
+    return {
+      value: schedule,
+      done: !this.hasPrev()
+    };
+  }
+
+  return schedule;
+};
+
+/**
+ * Check if next suitable date exists
+ *
+ * @public
+ * @return {Boolean}
+ */
+CronExpression.prototype.hasNext = function() {
+  var current = this._currentDate;
+  var hasIterated = this._hasIterated;
+
+  try {
+    this._findSchedule();
+    return true;
+  } catch (err) {
+    return false;
+  } finally {
+    this._currentDate = current;
+    this._hasIterated = hasIterated;
+  }
+};
+
+/**
+ * Check if previous suitable date exists
+ *
+ * @public
+ * @return {Boolean}
+ */
+CronExpression.prototype.hasPrev = function() {
+  var current = this._currentDate;
+  var hasIterated = this._hasIterated;
+
+  try {
+    this._findSchedule(true);
+    return true;
+  } catch (err) {
+    return false;
+  } finally {
+    this._currentDate = current;
+    this._hasIterated = hasIterated;
+  }
+};
+
+/**
+ * Iterate over expression iterator
+ *
+ * @public
+ * @param {Number} steps Numbers of steps to iterate
+ * @param {Function} callback Optional callback
+ * @return {Array} Array of the iterated results
+ */
+CronExpression.prototype.iterate = function iterate (steps, callback) {
+  var dates = [];
+
+  if (steps >= 0) {
+    for (var i = 0, c = steps; i < c; i++) {
+      try {
+        var item = this.next();
+        dates.push(item);
+
+        // Fire the callback
+        if (callback) {
+          callback(item, i);
+        }
+      } catch (err) {
+        break;
+      }
+    }
+  } else {
+    for (var i = 0, c = steps; i > c; i--) {
+      try {
+        var item = this.prev();
+        dates.push(item);
+
+        // Fire the callback
+        if (callback) {
+          callback(item, i);
+        }
+      } catch (err) {
+        break;
+      }
+    }
+  }
+
+  return dates;
+};
+
+/**
+ * Reset expression iterator state
+ *
+ * @public
+ */
+CronExpression.prototype.reset = function reset (newDate) {
+  this._currentDate = new CronDate(newDate || this._options.currentDate);
+};
+
+/**
+ * Stringify the expression
+ *
+ * @public
+ * @param {Boolean} [includeSeconds] Should stringify seconds
+ * @return {String}
+ */
+CronExpression.prototype.stringify = function stringify(includeSeconds) {
+  var resultArr = [];
+  for (var i = includeSeconds ? 0 : 1, c = CronExpression.map.length; i < c; ++i) {
+    var field = CronExpression.map[i];
+    var value = this.fields[field];
+    var constraint = CronExpression.constraints[i];
+
+    if (field === 'dayOfMonth' && this.fields.month.length === 1) {
+      constraint = { min: 1, max: CronExpression.daysInMonth[this.fields.month[0] - 1] };
+    } else if (field === 'dayOfWeek') {
+      // Prefer 0-6 range when serializing day of week field
+      constraint = { min: 0, max: 6 };
+      value = value[value.length - 1] === 7 ? value.slice(0, -1) : value;
+    }
+
+    resultArr.push(stringifyField(value, constraint.min, constraint.max));
+  }
+  return resultArr.join(' ');
+};
+
+/**
+ * Parse input expression (async)
+ *
+ * @public
+ * @param {String} expression Input expression
+ * @param {Object} [options] Parsing options
+ */
+CronExpression.parse = function parse(expression, options) {
+  var self = this;
+  if (typeof options === 'function') {
+    options = {};
+  }
+
+  function parse (expression, options) {
+    if (!options) {
+      options = {};
+    }
+
+    if (typeof options.currentDate === 'undefined') {
+      options.currentDate = new CronDate(undefined, self._tz);
+    }
+
+    // Is input expression predefined?
+    if (CronExpression.predefined[expression]) {
+      expression = CronExpression.predefined[expression];
+    }
+
+    // Split fields
+    var fields = [];
+    var atoms = (expression + '').trim().split(/\s+/);
+
+    if (atoms.length > 6) {
+      throw new Error('Invalid cron expression');
+    }
+
+    // Resolve fields
+    var start = (CronExpression.map.length - atoms.length);
+    for (var i = 0, c = CronExpression.map.length; i < c; ++i) {
+      var field = CronExpression.map[i]; // Field name
+      var value = atoms[atoms.length > c ? i : i - start]; // Field value
+
+      if (i < start || !value) { // Use default value
+        fields.push(CronExpression._parseField(
+          field,
+          CronExpression.parseDefaults[i],
+          CronExpression.constraints[i]
+          )
+        );
+      } else {
+        var val = field === 'dayOfWeek' ? parseNthDay(value) : value;
+
+        fields.push(CronExpression._parseField(
+          field,
+          val,
+          CronExpression.constraints[i]
+          )
+        );
+      }
+    }
+
+    var mappedFields = {};
+    for (var i = 0, c = CronExpression.map.length; i < c; i++) {
+      var key = CronExpression.map[i];
+      mappedFields[key] = fields[i];
+    }
+
+    var dayOfMonth = CronExpression._handleMaxDaysInMonth(mappedFields);
+    mappedFields.dayOfMonth = dayOfMonth || mappedFields.dayOfMonth;
+    return new CronExpression(mappedFields, options);
+
+    /**
+     * Parses out the # special character for the dayOfWeek field & adds it to options.
+     *
+     * @param {String} val
+     * @return {String}
+     * @private
+     */
+    function parseNthDay(val) {
+      var atoms = val.split('#');
+      if (atoms.length > 1) {
+        var nthValue = +atoms[atoms.length - 1];
+        if(/,/.test(val)) {
+          throw new Error('Constraint error, invalid dayOfWeek `#` and `,` '
+            + 'special characters are incompatible');
+        }
+        if(/\//.test(val)) {
+          throw new Error('Constraint error, invalid dayOfWeek `#` and `/` '
+            + 'special characters are incompatible');
+        }
+        if(/-/.test(val)) {
+          throw new Error('Constraint error, invalid dayOfWeek `#` and `-` '
+            + 'special characters are incompatible');
+        }
+        if (atoms.length > 2 || Number.isNaN(nthValue) || (nthValue < 1 || nthValue > 5)) {
+          throw new Error('Constraint error, invalid dayOfWeek occurrence number (#)');
+        }
+
+        options.nthDayOfWeek = nthValue;
+        return atoms[0];
+      }
+      return val;
+    }
+  }
+
+  return parse(expression, options);
+};
+
+/**
+ * Convert cron fields back to Cron Expression
+ *
+ * @public
+ * @param {Object} fields Input fields
+ * @param {Object} [options] Parsing options
+ * @return {Object}
+ */
+CronExpression.fieldsToExpression = function fieldsToExpression(fields, options) {
+  function validateConstraints (field, values, constraints) {
+    if (!values) {
+      throw new Error('Validation error, Field ' + field + ' is missing');
+    }
+    if (values.length === 0) {
+      throw new Error('Validation error, Field ' + field + ' contains no values');
+    }
+    for (var i = 0, c = values.length; i < c; i++) {
+      var value = values[i];
+
+      if (CronExpression._isValidConstraintChar(constraints, value)) {
+        continue;
+      }
+
+      // Check constraints
+      if (typeof value !== 'number' || Number.isNaN(value) || value < constraints.min || value > constraints.max) {
+        throw new Error(
+          'Constraint error, got value ' + value + ' expected range ' +
+          constraints.min + '-' + constraints.max
+        );
+      }
+    }
+  }
+
+  var mappedFields = {};
+  for (var i = 0, c = CronExpression.map.length; i < c; ++i) {
+    var field = CronExpression.map[i]; // Field name
+    var values = fields[field];
+    validateConstraints(
+      field,
+      values,
+      CronExpression.constraints[i]
+    );
+    var copy = [];
+    var j = -1;
+    while (++j < values.length) {
+      copy[j] = values[j];
+    }
+    values = copy.sort(CronExpression._sortCompareFn)
+      .filter(function(item, pos, ary) {
+        return !pos || item !== ary[pos - 1];
+      });
+    if (values.length !== copy.length) {
+      throw new Error('Validation error, Field ' + field + ' contains duplicate values');
+    }
+    mappedFields[field] = values;
+  }
+  var dayOfMonth = CronExpression._handleMaxDaysInMonth(mappedFields);
+  mappedFields.dayOfMonth = dayOfMonth || mappedFields.dayOfMonth;
+  return new CronExpression(mappedFields, options || {});
+};
+
+module.exports = CronExpression;
diff --git a/node_modules/cron-parser/lib/field_compactor.js b/node_modules/cron-parser/lib/field_compactor.js
new file mode 100644
index 0000000..f9aeb80
--- /dev/null
+++ b/node_modules/cron-parser/lib/field_compactor.js
@@ -0,0 +1,70 @@
+'use strict';
+
+function buildRange(item) {
+  return {
+    start: item,
+    count: 1
+  };
+}
+
+function completeRangeWithItem(range, item) {
+  range.end = item;
+  range.step = item - range.start;
+  range.count = 2;
+}
+
+function finalizeCurrentRange(results, currentRange, currentItemRange) {
+  if (currentRange) {
+    // Two elements do not form a range so split them into 2 single elements
+    if (currentRange.count === 2) {
+      results.push(buildRange(currentRange.start));
+      results.push(buildRange(currentRange.end));
+    } else {
+      results.push(currentRange);
+    }
+  }
+  if (currentItemRange) {
+    results.push(currentItemRange);
+  }
+}
+
+function compactField(arr) {
+  var results = [];
+  var currentRange = undefined;
+
+  for (var i = 0; i < arr.length; i++) {
+    var currentItem = arr[i];
+    if (typeof currentItem !== 'number') {
+      // String elements can't form a range
+      finalizeCurrentRange(results, currentRange, buildRange(currentItem));
+      currentRange = undefined;
+    } else if (!currentRange) {
+      // Start a new range
+      currentRange = buildRange(currentItem);
+    } else if (currentRange.count === 1) {
+      // Guess that the current item starts a range
+      completeRangeWithItem(currentRange, currentItem);
+    } else {
+      if (currentRange.step === currentItem - currentRange.end) {
+        // We found another item that matches the current range
+        currentRange.count++;
+        currentRange.end = currentItem;
+      } else if (currentRange.count === 2) { // The current range can't be continued
+        // Break the first item of the current range into a single element, and try to start a new range with the second item
+        results.push(buildRange(currentRange.start));
+        currentRange = buildRange(currentRange.end);
+        completeRangeWithItem(currentRange, currentItem);
+      } else {
+        // Persist the current range and start a new one with current item
+        finalizeCurrentRange(results, currentRange);
+        currentRange = buildRange(currentItem);
+      }
+    }
+  }
+
+  finalizeCurrentRange(results, currentRange);
+
+  return results;
+}
+
+module.exports = compactField;
diff --git a/node_modules/cron-parser/lib/field_stringify.js b/node_modules/cron-parser/lib/field_stringify.js
new file mode 100644
index 0000000..9a8c4d7
--- /dev/null
+++ b/node_modules/cron-parser/lib/field_stringify.js
@@ -0,0 +1,58 @@
+'use strict';
+
+var compactField = require('./field_compactor');
+
+function stringifyField(arr, min, max) {
+  var ranges = compactField(arr);
+  if (ranges.length === 1) {
+    var singleRange = ranges[0];
+    var step = singleRange.step;
+    if (step === 1 && singleRange.start === min && singleRange.end === max) {
+      return '*';
+    }
+    if (step !== 1 && singleRange.start === min && singleRange.end === max - step + 1) {
+      return '*/' + step;
+    }
+  }
+
+  var result = [];
+  for (var i = 0, l = ranges.length; i < l; ++i) {
+    var range = ranges[i];
+    if (range.count === 1) {
+      result.push(range.start);
+      continue;
+    }
+
+    var step = range.step;
+    if (range.step === 1) {
+      result.push(range.start + '-' + range.end);
+      continue;
+    }
+
+    var multiplier = range.start == 0 ? range.count - 1 : range.count;
+    if (range.step * multiplier > range.end) {
+      result = result.concat(
+         Array
+          .from({ length: range.end - range.start + 1 })
+          .map(function (_, index) {
+            var value = range.start + index;
+            if ((value - range.start) % range.step === 0) {
+              return value;
+            }
+            return null;
+          })
+          .filter(function (value) {
+            return value != null;
+          })
+      );
+    } else if (range.end === max - range.step + 1) {
+      result.push(range.start + '/' + range.step);
+    } else {
+      result.push(range.start + '-' + range.end + '/' + range.step);
+    }
+  }
+
+  return result.join(',');
+}
+
+module.exports = stringifyField;
diff --git a/node_modules/cron-parser/lib/parser.js b/node_modules/cron-parser/lib/parser.js
new file mode 100644
index 0000000..362a416
--- /dev/null
+++ b/node_modules/cron-parser/lib/parser.js
@@ -0,0 +1,116 @@
+'use strict';
+
+var CronExpression = require('./expression');
+
+function CronParser() {}
+
+/**
+ * Parse crontab entry
+ *
+ * @private
+ * @param {String} entry Crontab file entry/line
+ */
+CronParser._parseEntry = function _parseEntry (entry) {
+  var atoms = entry.split(' ');
+
+  if (atoms.length === 6) {
+    return {
+      interval: CronExpression.parse(entry)
+    };
+  } else if (atoms.length > 6) {
+    return {
+      interval: CronExpression.parse(
+        atoms.slice(0, 6).join(' ')
+      ),
+      command: atoms.slice(6, atoms.length)
+    };
+  } else {
+    throw new Error('Invalid entry: ' + entry);
+  }
+};
+
+/**
+ * Wrapper for CronExpression.parser method
+ *
+ * @public
+ * @param {String} expression Input expression
+ * @param {Object} [options] Parsing options
+ * @return {Object}
+ */
+CronParser.parseExpression = function parseExpression (expression, options) {
+  return CronExpression.parse(expression, options);
+};
+
+/**
+ * Wrapper for CronExpression.fieldsToExpression method
+ *
+ * @public
+ * @param {Object} fields Input fields
+ * @param {Object} [options] Parsing options
+ * @return {Object}
+ */
+CronParser.fieldsToExpression = function fieldsToExpression (fields, options) {
+  return CronExpression.fieldsToExpression(fields, options);
+};
+
+/**
+ * Parse content string
+ *
+ * @public
+ * @param {String} data Crontab content
+ * @return {Object}
+ */
+CronParser.parseString = function parseString (data) {
+  var blocks = data.split('\n');
+
+  var response = {
+    variables: {},
+    expressions: [],
+    errors: {}
+  };
+
+  for (var i = 0, c = blocks.length; i < c; i++) {
+    var block = blocks[i];
+    var matches = null;
+    var entry = block.trim(); // Remove surrounding spaces
+
+    if (entry.length > 0) {
+      if (entry.match(/^#/)) { // Comment
+        continue;
+      } else if ((matches = entry.match(/^(.*)=(.*)$/))) { // Variable
+        response.variables[matches[1]] = matches[2];
+      } else { // Expression?
+        var result = null;
+
+        try {
+          result = CronParser._parseEntry('0 ' + entry);
+          response.expressions.push(result.interval);
+        } catch (err) {
+          response.errors[entry] = err;
+        }
+      }
+    }
+  }
+
+  return response;
+};
+
+/**
+ * Parse crontab file
+ *
+ * @public
+ * @param {String} filePath Path to file
+ * @param {Function} callback
+ */
+CronParser.parseFile = function parseFile (filePath, callback) {
+  require('fs').readFile(filePath, function(err, data) {
+    if (err) {
+      callback(err);
+      return;
+    }
+
+    return callback(null, CronParser.parseString(data.toString()));
+  });
+};
+
+module.exports = CronParser;
diff --git a/node_modules/cron-parser/package.json b/node_modules/cron-parser/package.json
new file mode 100644
index 0000000..c855343
--- /dev/null
+++ b/node_modules/cron-parser/package.json
@@ -0,0 +1,91 @@
+{
+  "name": "cron-parser",
+  "version": "4.9.0",
+  "description": "Node.js library for parsing crontab instructions",
+  "main": "lib/parser.js",
+  "types": "types/index.d.ts",
+  "typesVersions": {
+    "<4.1": {
+      "*": [
+        "types/ts3/*"
+      ]
+    }
+  },
+  "directories": {
+    "test": "test"
+  },
+  "scripts": {
+    "test:tsd": "tsd",
+    "test:unit": "TZ=UTC tap ./test/*.js",
+    "test:cover": "TZ=UTC tap --coverage-report=html ./test/*.js",
+    "lint": "eslint .",
+    "lint:fix": "eslint --fix .",
+    "test": "npm run lint && npm run test:unit && npm run test:tsd"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/harrisiirak/cron-parser.git"
+  },
+  "keywords": [
+    "cron",
+    "crontab",
+    "parser"
+  ],
+  "author": "Harri Siirak",
+  "contributors": [
+    "Nicholas Clawson",
+    "Daniel Prentis <daniel@salsitasoft.com>",
+    "Renault John Lecoultre",
+    "Richard Astbury <richard.astbury@gmail.com>",
+    "Meaglin Wasabi <Meaglin.wasabi@gmail.com>",
+    "Mike Kusold <hello@mikekusold.com>",
+    "Alex Kit <alex.kit@atmajs.com>",
+    "Santiago Gimeno <santiago.gimeno@gmail.com>",
+    "Daniel <darc.tec@gmail.com>",
+    "Christian Steininger <christian.steininger.cs@gmail.com>",
+    "Mykola Piskovyi <m.piskovyi@gmail.com>",
+    "Brian Vaughn <brian.david.vaughn@gmail.com>",
+    "Nicholas Clawson <nickclaw@gmail.com>",
+    "Yasuhiroki <yasuhiroki.duck@gmail.com>",
+    "Nicholas Clawson <nickclaw@gmail.com>",
+    "Brendan Warkentin <faazshift@gmail.com>",
+    "Charlie Fish <fishcharlie.code@gmail.com>",
+    "Ian Graves <ian+diskimage@iangrav.es>",
+    "Andy Thompson <me@andytson.com>",
+    "Regev Brody <regevbr@gmail.com>"
+  ],
+  "license": "MIT",
+  "dependencies": {
+    "luxon": "^3.2.1"
+  },
+  "devDependencies": {
+    "eslint": "^8.27.0",
+    "sinon": "^15.0.1",
+    "tap": "^16.3.3",
+    "tsd": "^0.26.0"
+  },
+  "engines": {
+    "node": ">=12.0.0"
+  },
+  "browser": {
+    "fs": false
+  },
+  "tap": {
+    "check-coverage": false
+  },
+  "tsd": {
+    "directory": "test",
+    "compilerOptions": {
+      "lib": [
+        "es2017",
+        "dom"
+      ]
+    }
+  },
+  "files": [
+    "lib",
+    "types",
+    "LICENSE",
+    "README.md"
+  ]
+}
diff --git a/node_modules/cron-parser/types/common.d.ts b/node_modules/cron-parser/types/common.d.ts
new file mode 100644
index 0000000..a937304
--- /dev/null
+++ b/node_modules/cron-parser/types/common.d.ts
@@ -0,0 +1,131 @@
+export type DateType = Date | number | string
+
+export interface CronDate {
+    addYear(): void
+
+    addMonth(): void
+
+    addDay(): void
+
+    addHour(): void
+
+    addMinute(): void
+
+    addSecond(): void
+
+    subtractYear(): void
+
+    subtractMonth(): void
+
+    subtractDay(): void
+
+    subtractHour(): void
+
+    subtractMinute(): void
+
+    subtractSecond(): void
+
+    getDate(): number
+
+    getFullYear(): number
+
+    getDay(): number
+
+    getMonth(): number
+
+    getHours(): number
+
+    getMinutes(): number
+
+    getSeconds(): number
+
+    getMilliseconds(): number
+
+    getTime(): number
+
+    getUTCDate(): number
+
+    getUTCFullYear(): number
+
+    getUTCDay(): number
+
+    getUTCMonth(): number
+
+    getUTCHours(): number
+
+    getUTCMinutes(): number
+
+    getUTCSeconds(): number
+
+    toISOString(): string
+
+    toJSON(): string
+
+    setDate(d: number): void
+
+    setFullYear(y: number): void
+
+    setDay(d: number): void
+
+    setMonth(m: number): void
+
+    setHours(h: number): void
+
+    setMinutes(m: number): void
+
+    setSeconds(s: number): void
+
+    setMilliseconds(s: number): void
+
+    getTime(): number
+
+    toString(): string
+
+    toDate(): Date
+
+    isLastDayOfMonth(): boolean
+}
+
+export interface ParserOptions<IsIterable extends boolean = false> {
+    currentDate?: DateType
+    startDate?: DateType
+    endDate?: DateType
+    utc?: boolean
+    tz?: string
+    nthDayOfWeek?: number
+    iterator?: IsIterable
+}
+
+type IteratorResultOrCronDate<IsIterable extends boolean> = IsIterable extends true
+    ? IteratorResult<CronDate, CronDate>
+    : CronDate;
+
+export interface ICronExpression<CronFields, IsIterable extends boolean> {
+    readonly fields: CronFields;
+
+    /** Find next suitable date */
+    next(): IteratorResultOrCronDate<IsIterable>
+
+    /** Find previous suitable date */
+    prev(): IteratorResultOrCronDate<IsIterable>
+
+    /** Check if next suitable date exists */
+    hasNext(): boolean
+
+    /** Check if previous suitable date exists */
+    hasPrev(): boolean
+
+    /** Iterate over expression iterator */
+    iterate(steps: number, callback?: (item: IteratorResultOrCronDate<IsIterable>, i: number) => void): IteratorResultOrCronDate<IsIterable>[]
+
+    /** Reset expression iterator state */
+    reset(resetDate?: string | number | Date): void
+
+    stringify(includeSeconds?: boolean): string
+}
+
+export interface IStringResult<CronFields> {
+    variables: Record<string, string>,
+    expressions: ICronExpression<CronFields, false>[],
+    errors: Record<string, any>,
+}
diff --git a/node_modules/cron-parser/types/index.d.ts b/node_modules/cron-parser/types/index.d.ts
new file mode 100644
index 0000000..c771c48
--- /dev/null
+++ b/node_modules/cron-parser/types/index.d.ts
@@ -0,0 +1,45 @@
+import {
+    CronDate,
+    DateType,
+    ICronExpression,
+    IStringResult,
+    ParserOptions,
+} from './common';
+
+type BuildRangeTuple<Current extends [...number[]], Count extends number> =
+    Current["length"] extends Count
+        ? Current
+        : BuildRangeTuple<[number, ...Current], Count>
+type RangeTuple<Count extends number> = BuildRangeTuple<[], Count>
+type BuildRange<Current extends number, End extends number, Accu extends [...number[]]> =
+    Accu["length"] extends End
+        ? Current
+        : BuildRange<Current | Accu["length"], End, [number, ...Accu]>
+type Range<StartInclusive extends number, EndExclusive extends number> = BuildRange<StartInclusive, EndExclusive, RangeTuple<StartInclusive>>
+
+export type SixtyRange = Range<0, 30> | Range<30, 60>; // Typescript restriction on recursion depth
+export type HourRange = Range<0, 24>;
+export type DayOfTheMonthRange = Range<1, 32> | 'L';
+export type MonthRange = Range<1, 13>;
+export type DayOfTheWeekRange = Range<0, 8>;
+
+export type CronFields = {
+    readonly second: readonly SixtyRange[];
+    readonly minute: readonly SixtyRange[];
+    readonly hour: readonly HourRange[];
+    readonly dayOfMonth: readonly DayOfTheMonthRange[];
+    readonly month: readonly MonthRange[];
+    readonly dayOfWeek: readonly DayOfTheWeekRange[];
+}
+
+export {ParserOptions, CronDate, DateType}
+export type CronExpression<IsIterable extends boolean = false> = ICronExpression<CronFields, IsIterable>
+export type StringResult = IStringResult<CronFields>
+
+export function parseExpression<IsIterable extends boolean = false>(expression: string, options?: ParserOptions<IsIterable>): CronExpression<IsIterable>;
+
+export function fieldsToExpression<IsIterable extends boolean = false>(fields: CronFields, options?: ParserOptions<IsIterable>): CronExpression<IsIterable>;
+
+export function parseFile(filePath: string, callback: (err: any, data: StringResult) => any): void;
+
+export function parseString(data: string): StringResult;
diff --git a/node_modules/cron-parser/types/ts3/index.d.ts b/node_modules/cron-parser/types/ts3/index.d.ts
new file mode 100644
index 0000000..cd80088
--- /dev/null
+++ b/node_modules/cron-parser/types/ts3/index.d.ts
@@ -0,0 +1,28 @@
+import {
+    CronDate,
+    DateType,
+    ICronExpression,
+    IStringResult,
+    ParserOptions,
+} from '../common';
+
+export type CronFields = {
+    readonly second: readonly number[];
+    readonly minute: readonly number[];
+    readonly hour: readonly number[];
+    readonly dayOfMonth: readonly (number | 'L')[];
+    readonly month: readonly number[];
+    readonly dayOfWeek: readonly number[];
+}
+
+export {ParserOptions, CronDate, DateType}
+export type CronExpression<IsIterable extends boolean = false> = ICronExpression<CronFields, IsIterable>
+export type StringResult = IStringResult<CronFields>
+
+export function parseExpression<IsIterable extends boolean = false>(expression: string, options?: ParserOptions<IsIterable>): CronExpression<IsIterable>;
+
+export function fieldsToExpression<IsIterable extends boolean = false>(fields: CronFields, options?: ParserOptions<IsIterable>): CronExpression<IsIterable>;
+
+export function parseFile(filePath: string, callback: (err: any, data: StringResult) => any): void;
+
+export function parseString(data: string): StringResult;
diff --git a/node_modules/debug/LICENSE b/node_modules/debug/LICENSE
new file mode 100644
index 0000000..1a9820e
--- /dev/null
+++ b/node_modules/debug/LICENSE
@@ -0,0 +1,20 @@
+(The MIT License)
+
+Copyright (c) 2014-2017 TJ Holowaychuk <tj@vision-media.ca>
+Copyright (c) 2018-2021 Josh Junon
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software
+and associated documentation files (the 'Software'), to deal in the Software without restriction,
+including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial
+portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
+LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/debug/README.md b/node_modules/debug/README.md
new file mode 100644
index 0000000..9ebdfbf
--- /dev/null
+++ b/node_modules/debug/README.md
@@ -0,0 +1,481 @@
+# debug
+[![OpenCollective](https://opencollective.com/debug/backers/badge.svg)](#backers)
+[![OpenCollective](https://opencollective.com/debug/sponsors/badge.svg)](#sponsors)
+
+<img width="647" src="https://user-images.githubusercontent.com/71256/29091486-fa38524c-7c37-11e7-895f-e7ec8e1039b6.png">
+
+A tiny JavaScript debugging utility modelled after Node.js core's debugging
+technique. Works in Node.js and web browsers.
+
+## Installation
+
+```bash
+$ npm install debug
+```
+
+## Usage
+
+`debug` exposes a function; simply pass this function the name of your module, and it will return a decorated version of `console.error` for you to pass debug statements to. This will allow you to toggle the debug output for different parts of your module as well as the module as a whole.
+
+Example [_app.js_](./examples/node/app.js):
+
+```js
+var debug = require('debug')('http')
+  , http = require('http')
+  , name = 'My App';
+
+// fake app
+
+debug('booting %o', name);
+
+http.createServer(function(req, res){
+  debug(req.method + ' ' + req.url);
+  res.end('hello\n');
+}).listen(3000, function(){
+  debug('listening');
+});
+
+// fake worker of some kind
+
+require('./worker');
+```
+
+Example [_worker.js_](./examples/node/worker.js):
+
+```js
+var a = require('debug')('worker:a')
+  , b = require('debug')('worker:b');
+
+function work() {
+  a('doing lots of uninteresting work');
+  setTimeout(work, Math.random() * 1000);
+}
+
+work();
+
+function workb() {
+  b('doing some work');
+  setTimeout(workb, Math.random() * 2000);
+}
+
+workb();
+```
+
+The `DEBUG` environment variable is then used to enable these based on space or
+comma-delimited names.
+
+Here are some examples:
+
+<img width="647" alt="screen shot 2017-08-08 at 12 53 04 pm" src="https://user-images.githubusercontent.com/71256/29091703-a6302cdc-7c38-11e7-8304-7c0b3bc600cd.png">
+<img width="647" alt="screen shot 2017-08-08 at 12 53 38 pm" src="https://user-images.githubusercontent.com/71256/29091700-a62a6888-7c38-11e7-800b-db911291ca2b.png">
+<img width="647" alt="screen shot 2017-08-08 at 12 53 25 pm" src="https://user-images.githubusercontent.com/71256/29091701-a62ea114-7c38-11e7-826a-2692bedca740.png">
+
+#### Windows command prompt notes
+
+##### CMD
+
+On Windows the environment variable is set using the `set` command.
+
+```cmd
+set DEBUG=*,-not_this
+```
+
+Example:
+
+```cmd
+set DEBUG=* & node app.js
+```
+
+##### PowerShell (VS Code default)
+
+PowerShell uses different syntax to set environment variables.
+
+```cmd
+$env:DEBUG = "*,-not_this"
+```
+
+Example:
+
+```cmd
+$env:DEBUG='app';node app.js
+```
+
+Then, run the program to be debugged as usual.
+
+npm script example:
+```js
+  "windowsDebug": "@powershell -Command $env:DEBUG='*';node app.js",
+```
+
+## Namespace Colors
+
+Every debug instance has a color generated for it based on its namespace name.
+This helps when visually parsing the debug output to identify which debug instance
+a debug line belongs to.
+
+#### Node.js
+
+In Node.js, colors are enabled when stderr is a TTY. You also _should_ install
+the [`supports-color`](https://npmjs.org/supports-color) module alongside debug,
+otherwise debug will only use a small handful of basic colors.
+
+<img width="521" src="https://user-images.githubusercontent.com/71256/29092181-47f6a9e6-7c3a-11e7-9a14-1928d8a711cd.png">
+
+#### Web Browser
+
+Colors are also enabled on "Web Inspectors" that understand the `%c` formatting
+option. These are WebKit web inspectors, Firefox ([since version
+31](https://hacks.mozilla.org/2014/05/editable-box-model-multiple-selection-sublime-text-keys-much-more-firefox-developer-tools-episode-31/))
+and the Firebug plugin for Firefox (any version).
+
+<img width="524" src="https://user-images.githubusercontent.com/71256/29092033-b65f9f2e-7c39-11e7-8e32-f6f0d8e865c1.png">
+
+
+## Millisecond diff
+
+When actively developing an application it can be useful to see when the time spent between one `debug()` call and the next. Suppose for example you invoke `debug()` before requesting a resource, and after as well, the "+NNNms" will show you how much time was spent between calls.
+
+<img width="647" src="https://user-images.githubusercontent.com/71256/29091486-fa38524c-7c37-11e7-895f-e7ec8e1039b6.png">
+
+When stdout is not a TTY, `Date#toISOString()` is used, making it more useful for logging the debug information as shown below:
+
+<img width="647" src="https://user-images.githubusercontent.com/71256/29091956-6bd78372-7c39-11e7-8c55-c948396d6edd.png">
+
+
+## Conventions
+
+If you're using this in one or more of your libraries, you _should_ use the name of your library so that developers may toggle debugging as desired without guessing names. If you have more than one debuggers you _should_ prefix them with your library name and use ":" to separate features. For example "bodyParser" from Connect would then be "connect:bodyParser".  If you append a "*" to the end of your name, it will always be enabled regardless of the setting of the DEBUG environment variable.  You can then use it for normal output as well as debug output.
+
+## Wildcards
+
+The `*` character may be used as a wildcard. Suppose for example your library has
+debuggers named "connect:bodyParser", "connect:compress", "connect:session",
+instead of listing all three with
+`DEBUG=connect:bodyParser,connect:compress,connect:session`, you may simply do
+`DEBUG=connect:*`, or to run everything using this module simply use `DEBUG=*`.
+
+You can also exclude specific debuggers by prefixing them with a "-" character.
+For example, `DEBUG=*,-connect:*` would include all debuggers except those
+starting with "connect:".
+
+## Environment Variables
+
+When running through Node.js, you can set a few environment variables that will
+change the behavior of the debug logging:
+
+| Name      | Purpose                                         |
+|-----------|-------------------------------------------------|
+| `DEBUG`   | Enables/disables specific debugging namespaces. |
+| `DEBUG_HIDE_DATE` | Hide date from debug output (non-TTY).  |
+| `DEBUG_COLORS`| Whether or not to use colors in the debug output. |
+| `DEBUG_DEPTH` | Object inspection depth.                    |
+| `DEBUG_SHOW_HIDDEN` | Shows hidden properties on inspected objects. |
+
+
+__Note:__ The environment variables beginning with `DEBUG_` end up being
+converted into an Options object that gets used with `%o`/`%O` formatters.
+See the Node.js documentation for
+[`util.inspect()`](https://nodejs.org/api/util.html#util_util_inspect_object_options)
+for the complete list.
+
+## Formatters
+
+Debug uses [printf-style](https://wikipedia.org/wiki/Printf_format_string) formatting.
+Below are the officially supported formatters:
+
+| Formatter | Representation |
+|-----------|----------------|
+| `%O`      | Pretty-print an Object on multiple lines. |
+| `%o`      | Pretty-print an Object all on a single line. |
+| `%s`      | String. |
+| `%d`      | Number (both integer and float). |
+| `%j`      | JSON. Replaced with the string '[Circular]' if the argument contains circular references. |
+| `%%`      | Single percent sign ('%'). This does not consume an argument. |
+
+
+### Custom formatters
+
+You can add custom formatters by extending the `debug.formatters` object.
+For example, if you wanted to add support for rendering a Buffer as hex with
+`%h`, you could do something like:
+
+```js
+const createDebug = require('debug')
+createDebug.formatters.h = (v) => {
+  return v.toString('hex')
+}
+
+// …elsewhere
+const debug = createDebug('foo')
+debug('this is hex: %h', new Buffer('hello world'))
+//   foo this is hex: 68656c6c6f20776f726c6421 +0ms
+```
+
+
+## Browser Support
+
+You can build a browser-ready script using [browserify](https://github.com/substack/node-browserify),
+or just use the [browserify-as-a-service](https://wzrd.in/) [build](https://wzrd.in/standalone/debug@latest),
+if you don't want to build it yourself.
+
+Debug's enable state is currently persisted by `localStorage`.
+Consider the situation shown below where you have `worker:a` and `worker:b`,
+and wish to debug both. You can enable this using `localStorage.debug`:
+
+```js
+localStorage.debug = 'worker:*'
+```
+
+And then refresh the page.
+
+```js
+a = debug('worker:a');
+b = debug('worker:b');
+
+setInterval(function(){
+  a('doing some work');
+}, 1000);
+
+setInterval(function(){
+  b('doing some work');
+}, 1200);
+```
+
+In Chromium-based web browsers (e.g. Brave, Chrome, and Electron), the JavaScript console will—by default—only show messages logged by `debug` if the "Verbose" log level is _enabled_.
+
+<img width="647" src="https://user-images.githubusercontent.com/7143133/152083257-29034707-c42c-4959-8add-3cee850e6fcf.png">
+
+## Output streams
+
+  By default `debug` will log to stderr, however this can be configured per-namespace by overriding the `log` method:
+
+Example [_stdout.js_](./examples/node/stdout.js):
+
+```js
+var debug = require('debug');
+var error = debug('app:error');
+
+// by default stderr is used
+error('goes to stderr!');
+
+var log = debug('app:log');
+// set this namespace to log via console.log
+log.log = console.log.bind(console); // don't forget to bind to console!
+log('goes to stdout');
+error('still goes to stderr!');
+
+// set all output to go via console.info
+// overrides all per-namespace log settings
+debug.log = console.info.bind(console);
+error('now goes to stdout via console.info');
+log('still goes to stdout, but via console.info now');
+```
+
+## Extend
+You can simply extend debugger 
+```js
+const log = require('debug')('auth');
+
+//creates new debug instance with extended namespace
+const logSign = log.extend('sign');
+const logLogin = log.extend('login');
+
+log('hello'); // auth hello
+logSign('hello'); //auth:sign hello
+logLogin('hello'); //auth:login hello
+```
+
+## Set dynamically
+
+You can also enable debug dynamically by calling the `enable()` method :
+
+```js
+let debug = require('debug');
+
+console.log(1, debug.enabled('test'));
+
+debug.enable('test');
+console.log(2, debug.enabled('test'));
+
+debug.disable();
+console.log(3, debug.enabled('test'));
+
+```
+
+print :   
+```
+1 false
+2 true
+3 false
+```
+
+Usage :  
+`enable(namespaces)`  
+`namespaces` can include modes separated by a colon and wildcards.
+   
+Note that calling `enable()` completely overrides previously set DEBUG variable : 
+
+```
+$ DEBUG=foo node -e 'var dbg = require("debug"); dbg.enable("bar"); console.log(dbg.enabled("foo"))'
+=> false
+```
+
+`disable()`
+
+Will disable all namespaces. The functions returns the namespaces currently
+enabled (and skipped). This can be useful if you want to disable debugging
+temporarily without knowing what was enabled to begin with.
+
+For example:
+
+```js
+let debug = require('debug');
+debug.enable('foo:*,-foo:bar');
+let namespaces = debug.disable();
+debug.enable(namespaces);
+```
+
+Note: There is no guarantee that the string will be identical to the initial
+enable string, but semantically they will be identical.
+
+## Checking whether a debug target is enabled
+
+After you've created a debug instance, you can determine whether or not it is
+enabled by checking the `enabled` property:
+
+```javascript
+const debug = require('debug')('http');
+
+if (debug.enabled) {
+  // do stuff...
+}
+```
+
+You can also manually toggle this property to force the debug instance to be
+enabled or disabled.
+
+## Usage in child processes
+
+Due to the way `debug` detects if the output is a TTY or not, colors are not shown in child processes when `stderr` is piped. A solution is to pass the `DEBUG_COLORS=1` environment variable to the child process.  
+For example:
+
+```javascript
+worker = fork(WORKER_WRAP_PATH, [workerPath], {
+  stdio: [
+    /* stdin: */ 0,
+    /* stdout: */ 'pipe',
+    /* stderr: */ 'pipe',
+    'ipc',
+  ],
+  env: Object.assign({}, process.env, {
+    DEBUG_COLORS: 1 // without this settings, colors won't be shown
+  }),
+});
+
+worker.stderr.pipe(process.stderr, { end: false });
+```
+
+
+## Authors
+
+ - TJ Holowaychuk
+ - Nathan Rajlich
+ - Andrew Rhyne
+ - Josh Junon
+
+## Backers
+
+Support us with a monthly donation and help us continue our activities. [[Become a backer](https://opencollective.com/debug#backer)]
+
+<a href="https://opencollective.com/debug/backer/0/website" target="_blank"><img src="https://opencollective.com/debug/backer/0/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/1/website" target="_blank"><img src="https://opencollective.com/debug/backer/1/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/2/website" target="_blank"><img src="https://opencollective.com/debug/backer/2/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/3/website" target="_blank"><img src="https://opencollective.com/debug/backer/3/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/4/website" target="_blank"><img src="https://opencollective.com/debug/backer/4/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/5/website" target="_blank"><img src="https://opencollective.com/debug/backer/5/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/6/website" target="_blank"><img src="https://opencollective.com/debug/backer/6/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/7/website" target="_blank"><img src="https://opencollective.com/debug/backer/7/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/8/website" target="_blank"><img src="https://opencollective.com/debug/backer/8/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/9/website" target="_blank"><img src="https://opencollective.com/debug/backer/9/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/10/website" target="_blank"><img src="https://opencollective.com/debug/backer/10/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/11/website" target="_blank"><img src="https://opencollective.com/debug/backer/11/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/12/website" target="_blank"><img src="https://opencollective.com/debug/backer/12/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/13/website" target="_blank"><img src="https://opencollective.com/debug/backer/13/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/14/website" target="_blank"><img src="https://opencollective.com/debug/backer/14/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/15/website" target="_blank"><img src="https://opencollective.com/debug/backer/15/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/16/website" target="_blank"><img src="https://opencollective.com/debug/backer/16/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/17/website" target="_blank"><img src="https://opencollective.com/debug/backer/17/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/18/website" target="_blank"><img src="https://opencollective.com/debug/backer/18/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/19/website" target="_blank"><img src="https://opencollective.com/debug/backer/19/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/20/website" target="_blank"><img src="https://opencollective.com/debug/backer/20/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/21/website" target="_blank"><img src="https://opencollective.com/debug/backer/21/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/22/website" target="_blank"><img src="https://opencollective.com/debug/backer/22/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/23/website" target="_blank"><img src="https://opencollective.com/debug/backer/23/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/24/website" target="_blank"><img src="https://opencollective.com/debug/backer/24/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/25/website" target="_blank"><img src="https://opencollective.com/debug/backer/25/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/26/website" target="_blank"><img src="https://opencollective.com/debug/backer/26/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/27/website" target="_blank"><img src="https://opencollective.com/debug/backer/27/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/28/website" target="_blank"><img src="https://opencollective.com/debug/backer/28/avatar.svg"></a>
+<a href="https://opencollective.com/debug/backer/29/website" target="_blank"><img src="https://opencollective.com/debug/backer/29/avatar.svg"></a>
+
+
+## Sponsors
+
+Become a sponsor and get your logo on our README on Github with a link to your site. [[Become a sponsor](https://opencollective.com/debug#sponsor)]
+
+<a href="https://opencollective.com/debug/sponsor/0/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/0/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/1/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/1/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/2/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/2/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/3/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/3/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/4/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/4/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/5/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/5/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/6/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/6/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/7/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/7/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/8/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/8/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/9/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/9/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/10/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/10/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/11/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/11/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/12/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/12/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/13/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/13/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/14/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/14/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/15/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/15/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/16/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/16/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/17/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/17/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/18/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/18/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/19/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/19/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/20/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/20/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/21/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/21/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/22/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/22/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/23/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/23/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/24/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/24/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/25/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/25/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/26/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/26/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/27/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/27/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/28/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/28/avatar.svg"></a>
+<a href="https://opencollective.com/debug/sponsor/29/website" target="_blank"><img src="https://opencollective.com/debug/sponsor/29/avatar.svg"></a>
+
+## License
+
+(The MIT License)
+
+Copyright (c) 2014-2017 TJ Holowaychuk &lt;tj@vision-media.ca&gt;
+Copyright (c) 2018-2021 Josh Junon
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/debug/package.json b/node_modules/debug/package.json
new file mode 100644
index 0000000..ee8abb5
--- /dev/null
+++ b/node_modules/debug/package.json
@@ -0,0 +1,64 @@
+{
+  "name": "debug",
+  "version": "4.4.3",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/debug-js/debug.git"
+  },
+  "description": "Lightweight debugging utility for Node.js and the browser",
+  "keywords": [
+    "debug",
+    "log",
+    "debugger"
+  ],
+  "files": [
+    "src",
+    "LICENSE",
+    "README.md"
+  ],
+  "author": "Josh Junon (https://github.com/qix-)",
+  "contributors": [
+    "TJ Holowaychuk <tj@vision-media.ca>",
+    "Nathan Rajlich <nathan@tootallnate.net> (http://n8.io)",
+    "Andrew Rhyne <rhyneandrew@gmail.com>"
+  ],
+  "license": "MIT",
+  "scripts": {
+    "lint": "xo",
+    "test": "npm run test:node && npm run test:browser && npm run lint",
+    "test:node": "mocha test.js test.node.js",
+    "test:browser": "karma start --single-run",
+    "test:coverage": "cat ./coverage/lcov.info | coveralls"
+  },
+  "dependencies": {
+    "ms": "^2.1.3"
+  },
+  "devDependencies": {
+    "brfs": "^2.0.1",
+    "browserify": "^16.2.3",
+    "coveralls": "^3.0.2",
+    "karma": "^3.1.4",
+    "karma-browserify": "^6.0.0",
+    "karma-chrome-launcher": "^2.2.0",
+    "karma-mocha": "^1.3.0",
+    "mocha": "^5.2.0",
+    "mocha-lcov-reporter": "^1.2.0",
+    "sinon": "^14.0.0",
+    "xo": "^0.23.0"
+  },
+  "peerDependenciesMeta": {
+    "supports-color": {
+      "optional": true
+    }
+  },
+  "main": "./src/index.js",
+  "browser": "./src/browser.js",
+  "engines": {
+    "node": ">=6.0"
+  },
+  "xo": {
+    "rules": {
+      "import/extensions": "off"
+    }
+  }
+}
diff --git a/node_modules/debug/src/browser.js b/node_modules/debug/src/browser.js
new file mode 100644
index 0000000..5993451
--- /dev/null
+++ b/node_modules/debug/src/browser.js
@@ -0,0 +1,272 @@
+/* eslint-env browser */
+
+/**
+ * This is the web browser implementation of `debug()`.
+ */
+
+exports.formatArgs = formatArgs;
+exports.save = save;
+exports.load = load;
+exports.useColors = useColors;
+exports.storage = localstorage();
+exports.destroy = (() => {
+	let warned = false;
+
+	return () => {
+		if (!warned) {
+			warned = true;
+			console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');
+		}
+	};
+})();
+
+/**
+ * Colors.
+ */
+
+exports.colors = [
+	'#0000CC',
+	'#0000FF',
+	'#0033CC',
+	'#0033FF',
+	'#0066CC',
+	'#0066FF',
+	'#0099CC',
+	'#0099FF',
+	'#00CC00',
+	'#00CC33',
+	'#00CC66',
+	'#00CC99',
+	'#00CCCC',
+	'#00CCFF',
+	'#3300CC',
+	'#3300FF',
+	'#3333CC',
+	'#3333FF',
+	'#3366CC',
+	'#3366FF',
+	'#3399CC',
+	'#3399FF',
+	'#33CC00',
+	'#33CC33',
+	'#33CC66',
+	'#33CC99',
+	'#33CCCC',
+	'#33CCFF',
+	'#6600CC',
+	'#6600FF',
+	'#6633CC',
+	'#6633FF',
+	'#66CC00',
+	'#66CC33',
+	'#9900CC',
+	'#9900FF',
+	'#9933CC',
+	'#9933FF',
+	'#99CC00',
+	'#99CC33',
+	'#CC0000',
+	'#CC0033',
+	'#CC0066',
+	'#CC0099',
+	'#CC00CC',
+	'#CC00FF',
+	'#CC3300',
+	'#CC3333',
+	'#CC3366',
+	'#CC3399',
+	'#CC33CC',
+	'#CC33FF',
+	'#CC6600',
+	'#CC6633',
+	'#CC9900',
+	'#CC9933',
+	'#CCCC00',
+	'#CCCC33',
+	'#FF0000',
+	'#FF0033',
+	'#FF0066',
+	'#FF0099',
+	'#FF00CC',
+	'#FF00FF',
+	'#FF3300',
+	'#FF3333',
+	'#FF3366',
+	'#FF3399',
+	'#FF33CC',
+	'#FF33FF',
+	'#FF6600',
+	'#FF6633',
+	'#FF9900',
+	'#FF9933',
+	'#FFCC00',
+	'#FFCC33'
+];
+
+/**
+ * Currently only WebKit-based Web Inspectors, Firefox >= v31,
+ * and the Firebug extension (any Firefox version) are known
+ * to support "%c" CSS customizations.
+ *
+ * TODO: add a `localStorage` variable to explicitly enable/disable colors
+ */
+
+// eslint-disable-next-line complexity
+function useColors() {
+	// NB: In an Electron preload script, document will be defined but not fully
+	// initialized. Since we know we're in Chrome, we'll just detect this case
+	// explicitly
+	if (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {
+		return true;
+	}
+
+	// Internet Explorer and Edge do not support colors.
+	if (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/)) {
+		return false;
+	}
+
+	let m;
+
+	// Is webkit? http://stackoverflow.com/a/16459606/376773
+	// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632
+	// eslint-disable-next-line no-return-assign
+	return (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||
+		// Is firebug? http://stackoverflow.com/a/398120/376773
+		(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||
+		// Is firefox >= v31?
+		// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages
+		(typeof navigator !== 'undefined' && navigator.userAgent && (m = navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)) && parseInt(m[1], 10) >= 31) ||
+		// Double check webkit in userAgent just in case we are in a worker
+		(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/));
+}
+
+/**
+ * Colorize log arguments if enabled.
+ *
+ * @api public
+ */
+
+function formatArgs(args) {
+	args[0] = (this.useColors ? '%c' : '') +
+		this.namespace +
+		(this.useColors ? ' %c' : ' ') +
+		args[0] +
+		(this.useColors ? '%c ' : ' ') +
+		'+' + module.exports.humanize(this.diff);
+
+	if (!this.useColors) {
+		return;
+	}
+
+	const c = 'color: ' + this.color;
+	args.splice(1, 0, c, 'color: inherit');
+
+	// The final "%c" is somewhat tricky, because there could be other
+	// arguments passed either before or after the %c, so we need to
+	// figure out the correct index to insert the CSS into
+	let index = 0;
+	let lastC = 0;
+	args[0].replace(/%[a-zA-Z%]/g, match => {
+		if (match === '%%') {
+			return;
+		}
+		index++;
+		if (match === '%c') {
+			// We only are interested in the *last* %c
+			// (the user may have provided their own)
+			lastC = index;
+		}
+	});
+
+	args.splice(lastC, 0, c);
+}
+
+/**
+ * Invokes `console.debug()` when available.
+ * No-op when `console.debug` is not a "function".
+ * If `console.debug` is not available, falls back
+ * to `console.log`.
+ *
+ * @api public
+ */
+exports.log = console.debug || console.log || (() => {});
+
+/**
+ * Save `namespaces`.
+ *
+ * @param {String} namespaces
+ * @api private
+ */
+function save(namespaces) {
+	try {
+		if (namespaces) {
+			exports.storage.setItem('debug', namespaces);
+		} else {
+			exports.storage.removeItem('debug');
+		}
+	} catch (error) {
+		// Swallow
+		// XXX (@Qix-) should we be logging these?
+	}
+}
+
+/**
+ * Load `namespaces`.
+ *
+ * @return {String} returns the previously persisted debug modes
+ * @api private
+ */
+function load() {
+	let r;
+	try {
+		r = exports.storage.getItem('debug') || exports.storage.getItem('DEBUG') ;
+	} catch (error) {
+		// Swallow
+		// XXX (@Qix-) should we be logging these?
+	}
+
+	// If debug isn't set in LS, and we're in Electron, try to load $DEBUG
+	if (!r && typeof process !== 'undefined' && 'env' in process) {
+		r = process.env.DEBUG;
+	}
+
+	return r;
+}
+
+/**
+ * Localstorage attempts to return the localstorage.
+ *
+ * This is necessary because safari throws
+ * when a user disables cookies/localstorage
+ * and you attempt to access it.
+ *
+ * @return {LocalStorage}
+ * @api private
+ */
+
+function localstorage() {
+	try {
+		// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context
+		// The Browser also has localStorage in the global context.
+		return localStorage;
+	} catch (error) {
+		// Swallow
+		// XXX (@Qix-) should we be logging these?
+	}
+}
+
+module.exports = require('./common')(exports);
+
+const {formatters} = module.exports;
+
+/**
+ * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.
+ */
+
+formatters.j = function (v) {
+	try {
+		return JSON.stringify(v);
+	} catch (error) {
+		return '[UnexpectedJSONParseError]: ' + error.message;
+	}
+};
diff --git a/node_modules/debug/src/common.js b/node_modules/debug/src/common.js
new file mode 100644
index 0000000..141cb57
--- /dev/null
+++ b/node_modules/debug/src/common.js
@@ -0,0 +1,292 @@
+
+/**
+ * This is the common logic for both the Node.js and web browser
+ * implementations of `debug()`.
+ */
+
+function setup(env) {
+	createDebug.debug = createDebug;
+	createDebug.default = createDebug;
+	createDebug.coerce = coerce;
+	createDebug.disable = disable;
+	createDebug.enable = enable;
+	createDebug.enabled = enabled;
+	createDebug.humanize = require('ms');
+	createDebug.destroy = destroy;
+
+	Object.keys(env).forEach(key => {
+		createDebug[key] = env[key];
+	});
+
+	/**
+	* The currently active debug mode names, and names to skip.
+	*/
+
+	createDebug.names = [];
+	createDebug.skips = [];
+
+	/**
+	* Map of special "%n" handling functions, for the debug "format" argument.
+	*
+	* Valid key names are a single, lower or upper-case letter, i.e. "n" and "N".
+	*/
+	createDebug.formatters = {};
+
+	/**
+	* Selects a color for a debug namespace
+	* @param {String} namespace The namespace string for the debug instance to be colored
+	* @return {Number|String} An ANSI color code for the given namespace
+	* @api private
+	*/
+	function selectColor(namespace) {
+		let hash = 0;
+
+		for (let i = 0; i < namespace.length; i++) {
+			hash = ((hash << 5) - hash) + namespace.charCodeAt(i);
+			hash |= 0; // Convert to 32bit integer
+		}
+
+		return createDebug.colors[Math.abs(hash) % createDebug.colors.length];
+	}
+	createDebug.selectColor = selectColor;
+
+	/**
+	* Create a debugger with the given `namespace`.
+	*
+	* @param {String} namespace
+	* @return {Function}
+	* @api public
+	*/
+	function createDebug(namespace) {
+		let prevTime;
+		let enableOverride = null;
+		let namespacesCache;
+		let enabledCache;
+
+		function debug(...args) {
+			// Disabled?
+			if (!debug.enabled) {
+				return;
+			}
+
+			const self = debug;
+
+			// Set `diff` timestamp
+			const curr = Number(new Date());
+			const ms = curr - (prevTime || curr);
+			self.diff = ms;
+			self.prev = prevTime;
+			self.curr = curr;
+			prevTime = curr;
+
+			args[0] = createDebug.coerce(args[0]);
+
+			if (typeof args[0] !== 'string') {
+				// Anything else let's inspect with %O
+				args.unshift('%O');
+			}
+
+			// Apply any `formatters` transformations
+			let index = 0;
+			args[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {
+				// If we encounter an escaped % then don't increase the array index
+				if (match === '%%') {
+					return '%';
+				}
+				index++;
+				const formatter = createDebug.formatters[format];
+				if (typeof formatter === 'function') {
+					const val = args[index];
+					match = formatter.call(self, val);
+
+					// Now we need to remove `args[index]` since it's inlined in the `format`
+					args.splice(index, 1);
+					index--;
+				}
+				return match;
+			});
+
+			// Apply env-specific formatting (colors, etc.)
+			createDebug.formatArgs.call(self, args);
+
+			const logFn = self.log || createDebug.log;
+			logFn.apply(self, args);
+		}
+
+		debug.namespace = namespace;
+		debug.useColors = createDebug.useColors();
+		debug.color = createDebug.selectColor(namespace);
+		debug.extend = extend;
+		debug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.
+
+		Object.defineProperty(debug, 'enabled', {
+			enumerable: true,
+			configurable: false,
+			get: () => {
+				if (enableOverride !== null) {
+					return enableOverride;
+				}
+				if (namespacesCache !== createDebug.namespaces) {
+					namespacesCache = createDebug.namespaces;
+					enabledCache = createDebug.enabled(namespace);
+				}
+
+				return enabledCache;
+			},
+			set: v => {
+				enableOverride = v;
+			}
+		});
+
+		// Env-specific initialization logic for debug instances
+		if (typeof createDebug.init === 'function') {
+			createDebug.init(debug);
+		}
+
+		return debug;
+	}
+
+	function extend(namespace, delimiter) {
+		const newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);
+		newDebug.log = this.log;
+		return newDebug;
+	}
+
+	/**
+	* Enables a debug mode by namespaces. This can include modes
+	* separated by a colon and wildcards.
+	*
+	* @param {String} namespaces
+	* @api public
+	*/
+	function enable(namespaces) {
+		createDebug.save(namespaces);
+		createDebug.namespaces = namespaces;
+
+		createDebug.names = [];
+		createDebug.skips = [];
+
+		const split = (typeof namespaces === 'string' ? namespaces : '')
+			.trim()
+			.replace(/\s+/g, ',')
+			.split(',')
+			.filter(Boolean);
+
+		for (const ns of split) {
+			if (ns[0] === '-') {
+				createDebug.skips.push(ns.slice(1));
+			} else {
+				createDebug.names.push(ns);
+			}
+		}
+	}
+
+	/**
+	 * Checks if the given string matches a namespace template, honoring
+	 * asterisks as wildcards.
+	 *
+	 * @param {String} search
+	 * @param {String} template
+	 * @return {Boolean}
+	 */
+	function matchesTemplate(search, template) {
+		let searchIndex = 0;
+		let templateIndex = 0;
+		let starIndex = -1;
+		let matchIndex = 0;
+
+		while (searchIndex < search.length) {
+			if (templateIndex < template.length && (template[templateIndex] === search[searchIndex] || template[templateIndex] === '*')) {
+				// Match character or proceed with wildcard
+				if (template[templateIndex] === '*') {
+					starIndex = templateIndex;
+					matchIndex = searchIndex;
+					templateIndex++; // Skip the '*'
+				} else {
+					searchIndex++;
+					templateIndex++;
+				}
+			} else if (starIndex !== -1) { // eslint-disable-line no-negated-condition
+				// Backtrack to the last '*' and try to match more characters
+				templateIndex = starIndex + 1;
+				matchIndex++;
+				searchIndex = matchIndex;
+			} else {
+				return false; // No match
+			}
+		}
+
+		// Handle trailing '*' in template
+		while (templateIndex < template.length && template[templateIndex] === '*') {
+			templateIndex++;
+		}
+
+		return templateIndex === template.length;
+	}
+
+	/**
+	* Disable debug output.
+	*
+	* @return {String} namespaces
+	* @api public
+	*/
+	function disable() {
+		const namespaces = [
+			...createDebug.names,
+			...createDebug.skips.map(namespace => '-' + namespace)
+		].join(',');
+		createDebug.enable('');
+		return namespaces;
+	}
+
+	/**
+	* Returns true if the given mode name is enabled, false otherwise.
+	*
+	* @param {String} name
+	* @return {Boolean}
+	* @api public
+	*/
+	function enabled(name) {
+		for (const skip of createDebug.skips) {
+			if (matchesTemplate(name, skip)) {
+				return false;
+			}
+		}
+
+		for (const ns of createDebug.names) {
+			if (matchesTemplate(name, ns)) {
+				return true;
+			}
+		}
+
+		return false;
+	}
+
+	/**
+	* Coerce `val`.
+	*
+	* @param {Mixed} val
+	* @return {Mixed}
+	* @api private
+	*/
+	function coerce(val) {
+		if (val instanceof Error) {
+			return val.stack || val.message;
+		}
+		return val;
+	}
+
+	/**
+	* XXX DO NOT USE. This is a temporary stub function.
+	* XXX It WILL be removed in the next major release.
+	*/
+	function destroy() {
+		console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');
+	}
+
+	createDebug.enable(createDebug.load());
+
+	return createDebug;
+}
+
+module.exports = setup;
diff --git a/node_modules/debug/src/index.js b/node_modules/debug/src/index.js
new file mode 100644
index 0000000..bf4c57f
--- /dev/null
+++ b/node_modules/debug/src/index.js
@@ -0,0 +1,10 @@
+/**
+ * Detect Electron renderer / nwjs process, which is node, but we should
+ * treat as a browser.
+ */
+
+if (typeof process === 'undefined' || process.type === 'renderer' || process.browser === true || process.__nwjs) {
+	module.exports = require('./browser.js');
+} else {
+	module.exports = require('./node.js');
+}
diff --git a/node_modules/debug/src/node.js b/node_modules/debug/src/node.js
new file mode 100644
index 0000000..715560a
--- /dev/null
+++ b/node_modules/debug/src/node.js
@@ -0,0 +1,263 @@
+/**
+ * Module dependencies.
+ */
+
+const tty = require('tty');
+const util = require('util');
+
+/**
+ * This is the Node.js implementation of `debug()`.
+ */
+
+exports.init = init;
+exports.log = log;
+exports.formatArgs = formatArgs;
+exports.save = save;
+exports.load = load;
+exports.useColors = useColors;
+exports.destroy = util.deprecate(
+	() => {},
+	'Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.'
+);
+
+/**
+ * Colors.
+ */
+
+exports.colors = [6, 2, 3, 4, 5, 1];
+
+try {
+	// Optional dependency (as in, doesn't need to be installed, NOT like optionalDependencies in package.json)
+	// eslint-disable-next-line import/no-extraneous-dependencies
+	const supportsColor = require('supports-color');
+
+	if (supportsColor && (supportsColor.stderr || supportsColor).level >= 2) {
+		exports.colors = [
+			20,
+			21,
+			26,
+			27,
+			32,
+			33,
+			38,
+			39,
+			40,
+			41,
+			42,
+			43,
+			44,
+			45,
+			56,
+			57,
+			62,
+			63,
+			68,
+			69,
+			74,
+			75,
+			76,
+			77,
+			78,
+			79,
+			80,
+			81,
+			92,
+			93,
+			98,
+			99,
+			112,
+			113,
+			128,
+			129,
+			134,
+			135,
+			148,
+			149,
+			160,
+			161,
+			162,
+			163,
+			164,
+			165,
+			166,
+			167,
+			168,
+			169,
+			170,
+			171,
+			172,
+			173,
+			178,
+			179,
+			184,
+			185,
+			196,
+			197,
+			198,
+			199,
+			200,
+			201,
+			202,
+			203,
+			204,
+			205,
+			206,
+			207,
+			208,
+			209,
+			214,
+			215,
+			220,
+			221
+		];
+	}
+} catch (error) {
+	// Swallow - we only care if `supports-color` is available; it doesn't have to be.
+}
+
+/**
+ * Build up the default `inspectOpts` object from the environment variables.
+ *
+ *   $ DEBUG_COLORS=no DEBUG_DEPTH=10 DEBUG_SHOW_HIDDEN=enabled node script.js
+ */
+
+exports.inspectOpts = Object.keys(process.env).filter(key => {
+	return /^debug_/i.test(key);
+}).reduce((obj, key) => {
+	// Camel-case
+	const prop = key
+		.substring(6)
+		.toLowerCase()
+		.replace(/_([a-z])/g, (_, k) => {
+			return k.toUpperCase();
+		});
+
+	// Coerce string value into JS value
+	let val = process.env[key];
+	if (/^(yes|on|true|enabled)$/i.test(val)) {
+		val = true;
+	} else if (/^(no|off|false|disabled)$/i.test(val)) {
+		val = false;
+	} else if (val === 'null') {
+		val = null;
+	} else {
+		val = Number(val);
+	}
+
+	obj[prop] = val;
+	return obj;
+}, {});
+
+/**
+ * Is stdout a TTY? Colored output is enabled when `true`.
+ */
+
+function useColors() {
+	return 'colors' in exports.inspectOpts ?
+		Boolean(exports.inspectOpts.colors) :
+		tty.isatty(process.stderr.fd);
+}
+
+/**
+ * Adds ANSI color escape codes if enabled.
+ *
+ * @api public
+ */
+
+function formatArgs(args) {
+	const {namespace: name, useColors} = this;
+
+	if (useColors) {
+		const c = this.color;
+		const colorCode = '\u001B[3' + (c < 8 ? c : '8;5;' + c);
+		const prefix = `  ${colorCode};1m${name} \u001B[0m`;
+
+		args[0] = prefix + args[0].split('\n').join('\n' + prefix);
+		args.push(colorCode + 'm+' + module.exports.humanize(this.diff) + '\u001B[0m');
+	} else {
+		args[0] = getDate() + name + ' ' + args[0];
+	}
+}
+
+function getDate() {
+	if (exports.inspectOpts.hideDate) {
+		return '';
+	}
+	return new Date().toISOString() + ' ';
+}
+
+/**
+ * Invokes `util.formatWithOptions()` with the specified arguments and writes to stderr.
+ */
+
+function log(...args) {
+	return process.stderr.write(util.formatWithOptions(exports.inspectOpts, ...args) + '\n');
+}
+
+/**
+ * Save `namespaces`.
+ *
+ * @param {String} namespaces
+ * @api private
+ */
+function save(namespaces) {
+	if (namespaces) {
+		process.env.DEBUG = namespaces;
+	} else {
+		// If you set a process.env field to null or undefined, it gets cast to the
+		// string 'null' or 'undefined'. Just delete instead.
+		delete process.env.DEBUG;
+	}
+}
+
+/**
+ * Load `namespaces`.
+ *
+ * @return {String} returns the previously persisted debug modes
+ * @api private
+ */
+
+function load() {
+	return process.env.DEBUG;
+}
+
+/**
+ * Init logic for `debug` instances.
+ *
+ * Create a new `inspectOpts` object in case `useColors` is set
+ * differently for a particular `debug` instance.
+ */
+
+function init(debug) {
+	debug.inspectOpts = {};
+
+	const keys = Object.keys(exports.inspectOpts);
+	for (let i = 0; i < keys.length; i++) {
+		debug.inspectOpts[keys[i]] = exports.inspectOpts[keys[i]];
+	}
+}
+
+module.exports = require('./common')(exports);
+
+const {formatters} = module.exports;
+
+/**
+ * Map %o to `util.inspect()`, all on a single line.
+ */
+
+formatters.o = function (v) {
+	this.inspectOpts.colors = this.useColors;
+	return util.inspect(v, this.inspectOpts)
+		.split('\n')
+		.map(str => str.trim())
+		.join(' ');
+};
+
+/**
+ * Map %O to `util.inspect()`, allowing multiple lines if needed.
+ */
+
+formatters.O = function (v) {
+	this.inspectOpts.colors = this.useColors;
+	return util.inspect(v, this.inspectOpts);
+};
diff --git a/node_modules/decimal.js/LICENCE.md b/node_modules/decimal.js/LICENCE.md
new file mode 100644
index 0000000..57740b9
--- /dev/null
+++ b/node_modules/decimal.js/LICENCE.md
@@ -0,0 +1,23 @@
+The MIT Licence.
+
+Copyright (c) 2025 Michael Mclaughlin
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/decimal.js/README.md b/node_modules/decimal.js/README.md
new file mode 100644
index 0000000..f75c0a5
--- /dev/null
+++ b/node_modules/decimal.js/README.md
@@ -0,0 +1,246 @@
+![decimal.js](https://raw.githubusercontent.com/MikeMcl/decimal.js/gh-pages/decimaljs.png)
+
+An arbitrary-precision Decimal type for JavaScript.
+
+[![npm version](https://img.shields.io/npm/v/decimal.js.svg)](https://www.npmjs.com/package/decimal.js)
+[![npm downloads](https://img.shields.io/npm/dw/decimal.js)](https://www.npmjs.com/package/decimal.js)
+[![CDNJS](https://img.shields.io/cdnjs/v/decimal.js.svg)](https://cdnjs.com/libraries/decimal.js)
+[![](https://data.jsdelivr.com/v1/package/npm/decimal.js/badge)](https://www.jsdelivr.com/package/npm/decimal.js)
+
+<br>
+
+## Features
+
+  - Integers and floats
+  - Simple but full-featured API
+  - Replicates many of the methods of JavaScript's `Number.prototype` and `Math` objects
+  - Also handles hexadecimal, binary and octal values
+  - Faster, smaller, and perhaps easier to use than JavaScript versions of Java's BigDecimal
+  - No dependencies
+  - Wide platform compatibility: uses JavaScript 1.5 (ECMAScript 3) features only
+  - Comprehensive [documentation](https://mikemcl.github.io/decimal.js/) and test set
+  - Used under the hood by [math.js](https://github.com/josdejong/mathjs)
+  - Includes a TypeScript declaration file: *decimal.d.ts*
+
+![API](https://raw.githubusercontent.com/MikeMcl/decimal.js/gh-pages/API.png)
+
+The library is similar to [bignumber.js](https://github.com/MikeMcl/bignumber.js/), but here
+precision is specified in terms of significant digits rather than decimal places, and all
+calculations are rounded to the precision (similar to Python's decimal module) rather than just
+those involving division.
+
+This library also adds the trigonometric functions, among others, and supports non-integer powers,
+which makes it a significantly larger library than *bignumber.js* and the even smaller
+[big.js](https://github.com/MikeMcl/big.js/).
+
+For a lighter version of this library without the trigonometric functions see
+[decimal.js-light](https://github.com/MikeMcl/decimal.js-light/).
+
+## Load
+
+The library is the single JavaScript file *decimal.js* or ES module *decimal.mjs*.
+
+Browser:
+
+```html
+<script src='path/to/decimal.js'></script>
+
+<script type="module">
+  import Decimal from './path/to/decimal.mjs';
+  ...
+</script>
+```
+
+[Node.js](https://nodejs.org):
+
+```bash
+npm install decimal.js
+```
+```js
+const Decimal = require('decimal.js');
+
+import Decimal from 'decimal.js';
+
+import {Decimal} from 'decimal.js';
+```
+
+## Use
+
+*In all examples below, semicolons and `toString` calls are not shown.
+If a commented-out value is in quotes it means `toString` has been called on the preceding expression.*
+
+The library exports a single constructor function, `Decimal`, which expects a single argument that is a number, string or Decimal instance.
+
+```js
+x = new Decimal(123.4567)
+y = new Decimal('123456.7e-3')
+z = new Decimal(x)
+x.equals(y) && y.equals(z) && x.equals(z)        // true
+```
+
+If using values with more than a few digits, it is recommended to pass strings rather than numbers to avoid a potential loss of precision.
+
+```js
+// Precision loss from using numeric literals with more than 15 significant digits.
+new Decimal(1.0000000000000001)         // '1'
+new Decimal(88259496234518.57)          // '88259496234518.56'
+new Decimal(99999999999999999999)       // '100000000000000000000'
+
+// Precision loss from using numeric literals outside the range of Number values.
+new Decimal(2e+308)                     // 'Infinity'
+new Decimal(1e-324)                     // '0'
+
+// Precision loss from the unexpected result of arithmetic with Number values.
+new Decimal(0.7 + 0.1)                  // '0.7999999999999999'
+```
+
+As with JavaScript numbers, strings can contain underscores as separators to improve readability.
+
+```js
+x = new Decimal('2_147_483_647')
+```
+
+String values in binary, hexadecimal or octal notation are also accepted if the appropriate prefix is included.
+
+```js
+x = new Decimal('0xff.f')            // '255.9375'
+y = new Decimal('0b10101100')        // '172'
+z = x.plus(y)                        // '427.9375'
+
+z.toBinary()                         // '0b110101011.1111'
+z.toBinary(13)                       // '0b1.101010111111p+8'
+
+// Using binary exponential notation to create a Decimal with the value of `Number.MAX_VALUE`.
+x = new Decimal('0b1.1111111111111111111111111111111111111111111111111111p+1023')
+// '1.7976931348623157081e+308'
+```
+
+Decimal instances are immutable in the sense that they are not changed by their methods.
+
+```js
+0.3 - 0.1                     // 0.19999999999999998
+x = new Decimal(0.3)
+x.minus(0.1)                  // '0.2'
+x                             // '0.3'
+```
+
+The methods that return a Decimal can be chained.
+
+```js
+x.dividedBy(y).plus(z).times(9).floor()
+x.times('1.23456780123456789e+9').plus(9876.5432321).dividedBy('4444562598.111772').ceil()
+```
+
+Many method names have a shorter alias.
+
+```js
+x.squareRoot().dividedBy(y).toPower(3).equals(x.sqrt().div(y).pow(3))     // true
+x.comparedTo(y.modulo(z).negated() === x.cmp(y.mod(z).neg())              // true
+```
+
+Most of the methods of JavaScript's `Number.prototype` and `Math` objects are replicated.
+
+```js
+x = new Decimal(255.5)
+x.toExponential(5)                       // '2.55500e+2'
+x.toFixed(5)                             // '255.50000'
+x.toPrecision(5)                         // '255.50'
+
+Decimal.sqrt('6.98372465832e+9823')      // '8.3568682281821340204e+4911'
+Decimal.pow(2, 0.0979843)                // '1.0702770511687781839'
+
+// Using `toFixed()` to avoid exponential notation:
+x = new Decimal('0.0000001')
+x.toString()                             // '1e-7'
+x.toFixed()                              // '0.0000001'
+```
+
+And there are `isNaN` and `isFinite` methods, as `NaN` and `Infinity` are valid `Decimal` values.
+
+```js
+x = new Decimal(NaN)                                           // 'NaN'
+y = new Decimal(Infinity)                                      // 'Infinity'
+x.isNaN() && !y.isNaN() && !x.isFinite() && !y.isFinite()      // true
+```
+
+There is also a `toFraction` method with an optional *maximum denominator* argument.
+
+```js
+z = new Decimal(355)
+pi = z.dividedBy(113)        // '3.1415929204'
+pi.toFraction()              // [ '7853982301', '2500000000' ]
+pi.toFraction(1000)          // [ '355', '113' ]
+```
+
+All calculations are rounded according to the number of significant digits and rounding mode specified
+by the `precision` and `rounding` properties of the Decimal constructor.
+
+For advanced usage, multiple Decimal constructors can be created, each with their own independent
+configuration which applies to all Decimal numbers created from it.
+
+```js
+// Set the precision and rounding of the default Decimal constructor
+Decimal.set({ precision: 5, rounding: 4 })
+
+// Create another Decimal constructor, optionally passing in a configuration object
+Dec = Decimal.clone({ precision: 9, rounding: 1 })
+
+x = new Decimal(5)
+y = new Dec(5)
+
+x.div(3)                           // '1.6667'
+y.div(3)                           // '1.66666666'
+```
+
+The value of a Decimal is stored in a floating point format in terms of its digits, exponent and sign, but these properties should be considered read-only.
+
+```js
+x = new Decimal(-12345.67);
+x.d                            // [ 12345, 6700000 ]    digits (base 10000000)
+x.e                            // 4                     exponent (base 10)
+x.s                            // -1                    sign
+```
+
+For further information see the [API](http://mikemcl.github.io/decimal.js/) reference in the *doc* directory.
+
+## Test
+
+To run the tests using Node.js from the root directory:
+
+```bash
+npm test
+```
+
+Each separate test module can also be executed individually, for example:
+
+```bash
+node test/modules/toFraction
+```
+
+To run the tests in a browser, open *test/test.html*.
+
+## Minify
+
+Two minification examples:
+
+Using [uglify-js](https://github.com/mishoo/UglifyJS) to minify the *decimal.js* file:
+
+```bash
+npm install uglify-js -g
+uglifyjs decimal.js --source-map url=decimal.min.js.map -c -m -o decimal.min.js
+```
+
+Using [terser](https://github.com/terser/terser) to minify the ES module version, *decimal.mjs*:
+
+```bash
+npm install terser -g
+terser decimal.mjs --source-map url=decimal.min.mjs.map -c -m --toplevel -o decimal.min.mjs
+```
+
+```js
+import Decimal from './decimal.min.mjs';
+```
+
+## Licence
+
+[The MIT Licence](LICENCE.md)
diff --git a/node_modules/decimal.js/decimal.d.ts b/node_modules/decimal.js/decimal.d.ts
new file mode 100644
index 0000000..e0db32e
--- /dev/null
+++ b/node_modules/decimal.js/decimal.d.ts
@@ -0,0 +1,301 @@
+// Type definitions for decimal.js >=7.0.0
+// Project: https://github.com/MikeMcl/decimal.js
+// Definitions by: Michael Mclaughlin <https://github.com/MikeMcl>
+// Definitions: https://github.com/MikeMcl/decimal.js
+//
+// Documentation: http://mikemcl.github.io/decimal.js/
+//
+// Exports:
+//
+//   class     Decimal (default export)
+//   type      Decimal.Constructor
+//   type      Decimal.Instance
+//   type      Decimal.Modulo
+//   type      Decimal.Rounding
+//   type      Decimal.Value
+//   interface Decimal.Config
+//
+// Example (alternative syntax commented-out):
+//
+//   import {Decimal} from "decimal.js"
+//   //import Decimal from "decimal.js"
+//
+//   let r: Decimal.Rounding = Decimal.ROUND_UP;
+//   let c: Decimal.Configuration = {precision: 4, rounding: r};
+//   Decimal.set(c);
+//   let v: Decimal.Value = '12345.6789';
+//   let d: Decimal = new Decimal(v);
+//   //let d: Decimal.Instance = new Decimal(v);
+//
+// The use of compiler option `--strictNullChecks` is recommended.
+
+export default Decimal;
+
+export namespace Decimal {
+  export type Constructor = typeof Decimal;
+  export type Instance = Decimal;
+  export type Rounding = 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8;
+  export type Modulo = Rounding | 9;
+  export type Value = string | number | bigint | Decimal;
+
+  // http://mikemcl.github.io/decimal.js/#constructor-properties
+  export interface Config {
+    precision?: number;
+    rounding?: Rounding;
+    toExpNeg?: number;
+    toExpPos?: number;
+    minE?: number;
+    maxE?: number;
+    crypto?: boolean;
+    modulo?: Modulo;
+    defaults?: boolean;
+  }
+}
+
+export declare class Decimal {
+  readonly d: number[];
+  readonly e: number;
+  readonly s: number;
+
+  constructor(n: Decimal.Value);
+
+  absoluteValue(): Decimal;
+  abs(): Decimal;
+
+  ceil(): Decimal;
+
+  clampedTo(min: Decimal.Value, max: Decimal.Value): Decimal;
+  clamp(min: Decimal.Value, max: Decimal.Value): Decimal;
+
+  comparedTo(n: Decimal.Value): number;
+  cmp(n: Decimal.Value): number;
+
+  cosine(): Decimal;
+  cos(): Decimal;
+
+  cubeRoot(): Decimal;
+  cbrt(): Decimal;
+
+  decimalPlaces(): number;
+  dp(): number;
+
+  dividedBy(n: Decimal.Value): Decimal;
+  div(n: Decimal.Value): Decimal;
+
+  dividedToIntegerBy(n: Decimal.Value): Decimal;
+  divToInt(n: Decimal.Value): Decimal;
+
+  equals(n: Decimal.Value): boolean;
+  eq(n: Decimal.Value): boolean;
+
+  floor(): Decimal;
+
+  greaterThan(n: Decimal.Value): boolean;
+  gt(n: Decimal.Value): boolean;
+
+  greaterThanOrEqualTo(n: Decimal.Value): boolean;
+  gte(n: Decimal.Value): boolean;
+
+  hyperbolicCosine(): Decimal;
+  cosh(): Decimal;
+
+  hyperbolicSine(): Decimal;
+  sinh(): Decimal;
+
+  hyperbolicTangent(): Decimal;
+  tanh(): Decimal;
+
+  inverseCosine(): Decimal;
+  acos(): Decimal;
+
+  inverseHyperbolicCosine(): Decimal;
+  acosh(): Decimal;
+
+  inverseHyperbolicSine(): Decimal;
+  asinh(): Decimal;
+
+  inverseHyperbolicTangent(): Decimal;
+  atanh(): Decimal;
+
+  inverseSine(): Decimal;
+  asin(): Decimal;
+
+  inverseTangent(): Decimal;
+  atan(): Decimal;
+
+  isFinite(): boolean;
+
+  isInteger(): boolean;
+  isInt(): boolean;
+
+  isNaN(): boolean;
+
+  isNegative(): boolean;
+  isNeg(): boolean;
+
+  isPositive(): boolean;
+  isPos(): boolean;
+
+  isZero(): boolean;
+
+  lessThan(n: Decimal.Value): boolean;
+  lt(n: Decimal.Value): boolean;
+
+  lessThanOrEqualTo(n: Decimal.Value): boolean;
+  lte(n: Decimal.Value): boolean;
+
+  logarithm(n?: Decimal.Value): Decimal;
+  log(n?: Decimal.Value): Decimal;
+
+  minus(n: Decimal.Value): Decimal;
+  sub(n: Decimal.Value): Decimal;
+
+  modulo(n: Decimal.Value): Decimal;
+  mod(n: Decimal.Value): Decimal;
+
+  naturalExponential(): Decimal;
+  exp(): Decimal;
+
+  naturalLogarithm(): Decimal;
+  ln(): Decimal;
+
+  negated(): Decimal;
+  neg(): Decimal;
+
+  plus(n: Decimal.Value): Decimal;
+  add(n: Decimal.Value): Decimal;
+
+  precision(includeZeros?: boolean): number;
+  sd(includeZeros?: boolean): number;
+
+  round(): Decimal;
+
+  sine() : Decimal;
+  sin() : Decimal;
+
+  squareRoot(): Decimal;
+  sqrt(): Decimal;
+
+  tangent() : Decimal;
+  tan() : Decimal;
+
+  times(n: Decimal.Value): Decimal;
+  mul(n: Decimal.Value) : Decimal;
+
+  toBinary(significantDigits?: number): string;
+  toBinary(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toDecimalPlaces(decimalPlaces?: number): Decimal;
+  toDecimalPlaces(decimalPlaces: number, rounding: Decimal.Rounding): Decimal;
+  toDP(decimalPlaces?: number): Decimal;
+  toDP(decimalPlaces: number, rounding: Decimal.Rounding): Decimal;
+
+  toExponential(decimalPlaces?: number): string;
+  toExponential(decimalPlaces: number, rounding: Decimal.Rounding): string;
+
+  toFixed(decimalPlaces?: number): string;
+  toFixed(decimalPlaces: number, rounding: Decimal.Rounding): string;
+
+  toFraction(max_denominator?: Decimal.Value): Decimal[];
+
+  toHexadecimal(significantDigits?: number): string;
+  toHexadecimal(significantDigits: number, rounding: Decimal.Rounding): string;
+  toHex(significantDigits?: number): string;
+  toHex(significantDigits: number, rounding?: Decimal.Rounding): string;
+
+  toJSON(): string;
+
+  toNearest(n: Decimal.Value, rounding?: Decimal.Rounding): Decimal;
+
+  toNumber(): number;
+
+  toOctal(significantDigits?: number): string;
+  toOctal(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toPower(n: Decimal.Value): Decimal;
+  pow(n: Decimal.Value): Decimal;
+
+  toPrecision(significantDigits?: number): string;
+  toPrecision(significantDigits: number, rounding: Decimal.Rounding): string;
+
+  toSignificantDigits(significantDigits?: number): Decimal;
+  toSignificantDigits(significantDigits: number, rounding: Decimal.Rounding): Decimal;
+  toSD(significantDigits?: number): Decimal;
+  toSD(significantDigits: number, rounding: Decimal.Rounding): Decimal;
+
+  toString(): string;
+
+  truncated(): Decimal;
+  trunc(): Decimal;
+
+  valueOf(): string;
+
+  static abs(n: Decimal.Value): Decimal;
+  static acos(n: Decimal.Value): Decimal;
+  static acosh(n: Decimal.Value): Decimal;
+  static add(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static asin(n: Decimal.Value): Decimal;
+  static asinh(n: Decimal.Value): Decimal;
+  static atan(n: Decimal.Value): Decimal;
+  static atanh(n: Decimal.Value): Decimal;
+  static atan2(y: Decimal.Value, x: Decimal.Value): Decimal;
+  static cbrt(n: Decimal.Value): Decimal;
+  static ceil(n: Decimal.Value): Decimal;
+  static clamp(n: Decimal.Value, min: Decimal.Value, max: Decimal.Value): Decimal;
+  static clone(object?: Decimal.Config): Decimal.Constructor;
+  static config(object: Decimal.Config): Decimal.Constructor;
+  static cos(n: Decimal.Value): Decimal;
+  static cosh(n: Decimal.Value): Decimal;
+  static div(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static exp(n: Decimal.Value): Decimal;
+  static floor(n: Decimal.Value): Decimal;
+  static hypot(...n: Decimal.Value[]): Decimal;
+  static isDecimal(object: any): object is Decimal;
+  static ln(n: Decimal.Value): Decimal;
+  static log(n: Decimal.Value, base?: Decimal.Value): Decimal;
+  static log2(n: Decimal.Value): Decimal;
+  static log10(n: Decimal.Value): Decimal;
+  static max(...n: Decimal.Value[]): Decimal;
+  static min(...n: Decimal.Value[]): Decimal;
+  static mod(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static mul(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static noConflict(): Decimal.Constructor;   // Browser only
+  static pow(base: Decimal.Value, exponent: Decimal.Value): Decimal;
+  static random(significantDigits?: number): Decimal;
+  static round(n: Decimal.Value): Decimal;
+  static set(object: Decimal.Config): Decimal.Constructor;
+  static sign(n: Decimal.Value): number;
+  static sin(n: Decimal.Value): Decimal;
+  static sinh(n: Decimal.Value): Decimal;
+  static sqrt(n: Decimal.Value): Decimal;
+  static sub(x: Decimal.Value, y: Decimal.Value): Decimal;
+  static sum(...n: Decimal.Value[]): Decimal;
+  static tan(n: Decimal.Value): Decimal;
+  static tanh(n: Decimal.Value): Decimal;
+  static trunc(n: Decimal.Value): Decimal;
+
+  static readonly default?: Decimal.Constructor;
+  static readonly Decimal?: Decimal.Constructor;
+
+  static readonly precision: number;
+  static readonly rounding: Decimal.Rounding;
+  static readonly toExpNeg: number;
+  static readonly toExpPos: number;
+  static readonly minE: number;
+  static readonly maxE: number;
+  static readonly crypto: boolean;
+  static readonly modulo: Decimal.Modulo;
+
+  static readonly ROUND_UP: 0;
+  static readonly ROUND_DOWN: 1;
+  static readonly ROUND_CEIL: 2;
+  static readonly ROUND_FLOOR: 3;
+  static readonly ROUND_HALF_UP: 4;
+  static readonly ROUND_HALF_DOWN: 5;
+  static readonly ROUND_HALF_EVEN: 6;
+  static readonly ROUND_HALF_CEIL: 7;
+  static readonly ROUND_HALF_FLOOR: 8;
+  static readonly EUCLID: 9;
+}
+
+export declare function Decimal(n: Decimal.Value): Decimal;
diff --git a/node_modules/decimal.js/decimal.js b/node_modules/decimal.js/decimal.js
new file mode 100644
index 0000000..23295c6
--- /dev/null
+++ b/node_modules/decimal.js/decimal.js
@@ -0,0 +1,4951 @@
+;(function (globalScope) {
+  'use strict';
+
+
+  /*!
+   *  decimal.js v10.6.0
+   *  An arbitrary-precision Decimal type for JavaScript.
+   *  https://github.com/MikeMcl/decimal.js
+   *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+   *  MIT Licence
+   */
+
+
+  // -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //
+
+
+    // The maximum exponent magnitude.
+    // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.
+  var EXP_LIMIT = 9e15,                      // 0 to 9e15
+
+    // The limit on the value of `precision`, and on the value of the first argument to
+    // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.
+    MAX_DIGITS = 1e9,                        // 0 to 1e9
+
+    // Base conversion alphabet.
+    NUMERALS = '0123456789abcdef',
+
+    // The natural logarithm of 10 (1025 digits).
+    LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',
+
+    // Pi (1025 digits).
+    PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',
+
+
+    // The initial configuration properties of the Decimal constructor.
+    DEFAULTS = {
+
+      // These values must be integers within the stated ranges (inclusive).
+      // Most of these values can be changed at run-time using the `Decimal.config` method.
+
+      // The maximum number of significant digits of the result of a calculation or base conversion.
+      // E.g. `Decimal.config({ precision: 20 });`
+      precision: 20,                         // 1 to MAX_DIGITS
+
+      // The rounding mode used when rounding to `precision`.
+      //
+      // ROUND_UP         0 Away from zero.
+      // ROUND_DOWN       1 Towards zero.
+      // ROUND_CEIL       2 Towards +Infinity.
+      // ROUND_FLOOR      3 Towards -Infinity.
+      // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+      // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+      // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+      // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+      // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+      //
+      // E.g.
+      // `Decimal.rounding = 4;`
+      // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+      rounding: 4,                           // 0 to 8
+
+      // The modulo mode used when calculating the modulus: a mod n.
+      // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+      // The remainder (r) is calculated as: r = a - n * q.
+      //
+      // UP         0 The remainder is positive if the dividend is negative, else is negative.
+      // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+      // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+      // HALF_EVEN  6 The IEEE 754 remainder function.
+      // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+      //
+      // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+      // division (9) are commonly used for the modulus operation. The other rounding modes can also
+      // be used, but they may not give useful results.
+      modulo: 1,                             // 0 to 9
+
+      // The exponent value at and beneath which `toString` returns exponential notation.
+      // JavaScript numbers: -7
+      toExpNeg: -7,                          // 0 to -EXP_LIMIT
+
+      // The exponent value at and above which `toString` returns exponential notation.
+      // JavaScript numbers: 21
+      toExpPos:  21,                         // 0 to EXP_LIMIT
+
+      // The minimum exponent value, beneath which underflow to zero occurs.
+      // JavaScript numbers: -324  (5e-324)
+      minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT
+
+      // The maximum exponent value, above which overflow to Infinity occurs.
+      // JavaScript numbers: 308  (1.7976931348623157e+308)
+      maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT
+
+      // Whether to use cryptographically-secure random number generation, if available.
+      crypto: false                          // true/false
+    },
+
+
+  // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //
+
+
+    Decimal, inexact, noConflict, quadrant,
+    external = true,
+
+    decimalError = '[DecimalError] ',
+    invalidArgument = decimalError + 'Invalid argument: ',
+    precisionLimitExceeded = decimalError + 'Precision limit exceeded',
+    cryptoUnavailable = decimalError + 'crypto unavailable',
+    tag = '[object Decimal]',
+
+    mathfloor = Math.floor,
+    mathpow = Math.pow,
+
+    isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,
+    isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,
+    isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,
+    isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
+
+    BASE = 1e7,
+    LOG_BASE = 7,
+    MAX_SAFE_INTEGER = 9007199254740991,
+
+    LN10_PRECISION = LN10.length - 1,
+    PI_PRECISION = PI.length - 1,
+
+    // Decimal.prototype object
+    P = { toStringTag: tag };
+
+
+  // Decimal prototype methods
+
+
+  /*
+   *  absoluteValue             abs
+   *  ceil
+   *  clampedTo                 clamp
+   *  comparedTo                cmp
+   *  cosine                    cos
+   *  cubeRoot                  cbrt
+   *  decimalPlaces             dp
+   *  dividedBy                 div
+   *  dividedToIntegerBy        divToInt
+   *  equals                    eq
+   *  floor
+   *  greaterThan               gt
+   *  greaterThanOrEqualTo      gte
+   *  hyperbolicCosine          cosh
+   *  hyperbolicSine            sinh
+   *  hyperbolicTangent         tanh
+   *  inverseCosine             acos
+   *  inverseHyperbolicCosine   acosh
+   *  inverseHyperbolicSine     asinh
+   *  inverseHyperbolicTangent  atanh
+   *  inverseSine               asin
+   *  inverseTangent            atan
+   *  isFinite
+   *  isInteger                 isInt
+   *  isNaN
+   *  isNegative                isNeg
+   *  isPositive                isPos
+   *  isZero
+   *  lessThan                  lt
+   *  lessThanOrEqualTo         lte
+   *  logarithm                 log
+   *  [maximum]                 [max]
+   *  [minimum]                 [min]
+   *  minus                     sub
+   *  modulo                    mod
+   *  naturalExponential        exp
+   *  naturalLogarithm          ln
+   *  negated                   neg
+   *  plus                      add
+   *  precision                 sd
+   *  round
+   *  sine                      sin
+   *  squareRoot                sqrt
+   *  tangent                   tan
+   *  times                     mul
+   *  toBinary
+   *  toDecimalPlaces           toDP
+   *  toExponential
+   *  toFixed
+   *  toFraction
+   *  toHexadecimal             toHex
+   *  toNearest
+   *  toNumber
+   *  toOctal
+   *  toPower                   pow
+   *  toPrecision
+   *  toSignificantDigits       toSD
+   *  toString
+   *  truncated                 trunc
+   *  valueOf                   toJSON
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the absolute value of this Decimal.
+   *
+   */
+  P.absoluteValue = P.abs = function () {
+    var x = new this.constructor(this);
+    if (x.s < 0) x.s = 1;
+    return finalise(x);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+   * direction of positive Infinity.
+   *
+   */
+  P.ceil = function () {
+    return finalise(new this.constructor(this), this.e + 1, 2);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal clamped to the range
+   * delineated by `min` and `max`.
+   *
+   * min {number|string|bigint|Decimal}
+   * max {number|string|bigint|Decimal}
+   *
+   */
+  P.clampedTo = P.clamp = function (min, max) {
+    var k,
+      x = this,
+      Ctor = x.constructor;
+    min = new Ctor(min);
+    max = new Ctor(max);
+    if (!min.s || !max.s) return new Ctor(NaN);
+    if (min.gt(max)) throw Error(invalidArgument + max);
+    k = x.cmp(min);
+    return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);
+  };
+
+
+  /*
+   * Return
+   *   1    if the value of this Decimal is greater than the value of `y`,
+   *  -1    if the value of this Decimal is less than the value of `y`,
+   *   0    if they have the same value,
+   *   NaN  if the value of either Decimal is NaN.
+   *
+   */
+  P.comparedTo = P.cmp = function (y) {
+    var i, j, xdL, ydL,
+      x = this,
+      xd = x.d,
+      yd = (y = new x.constructor(y)).d,
+      xs = x.s,
+      ys = y.s;
+
+    // Either NaN or ±Infinity?
+    if (!xd || !yd) {
+      return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
+    }
+
+    // Either zero?
+    if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;
+
+    // Signs differ?
+    if (xs !== ys) return xs;
+
+    // Compare exponents.
+    if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;
+
+    xdL = xd.length;
+    ydL = yd.length;
+
+    // Compare digit by digit.
+    for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
+      if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
+    }
+
+    // Compare lengths.
+    return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * cos(0)         = 1
+   * cos(-0)        = 1
+   * cos(Infinity)  = NaN
+   * cos(-Infinity) = NaN
+   * cos(NaN)       = NaN
+   *
+   */
+  P.cosine = P.cos = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.d) return new Ctor(NaN);
+
+    // cos(0) = cos(-0) = 1
+    if (!x.d[0]) return new Ctor(1);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+    Ctor.rounding = 1;
+
+    x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   *
+   * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   *  cbrt(0)  =  0
+   *  cbrt(-0) = -0
+   *  cbrt(1)  =  1
+   *  cbrt(-1) = -1
+   *  cbrt(N)  =  N
+   *  cbrt(-I) = -I
+   *  cbrt(I)  =  I
+   *
+   * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))
+   *
+   */
+  P.cubeRoot = P.cbrt = function () {
+    var e, m, n, r, rep, s, sd, t, t3, t3plusx,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+    external = false;
+
+    // Initial estimate.
+    s = x.s * mathpow(x.s * x, 1 / 3);
+
+     // Math.cbrt underflow/overflow?
+     // Pass x to Math.pow as integer, then adjust the exponent of the result.
+    if (!s || Math.abs(s) == 1 / 0) {
+      n = digitsToString(x.d);
+      e = x.e;
+
+      // Adjust n exponent so it is a multiple of 3 away from x exponent.
+      if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');
+      s = mathpow(n, 1 / 3);
+
+      // Rarely, e may be one less than the result exponent value.
+      e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
+
+      if (s == 1 / 0) {
+        n = '5e' + e;
+      } else {
+        n = s.toExponential();
+        n = n.slice(0, n.indexOf('e') + 1) + e;
+      }
+
+      r = new Ctor(n);
+      r.s = x.s;
+    } else {
+      r = new Ctor(s.toString());
+    }
+
+    sd = (e = Ctor.precision) + 3;
+
+    // Halley's method.
+    // TODO? Compare Newton's method.
+    for (;;) {
+      t = r;
+      t3 = t.times(t).times(t);
+      t3plusx = t3.plus(x);
+      r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
+
+      // TODO? Replace with for-loop and checkRoundingDigits.
+      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+        n = n.slice(sd - 3, sd + 1);
+
+        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999
+        // , i.e. approaching a rounding boundary, continue the iteration.
+        if (n == '9999' || !rep && n == '4999') {
+
+          // On the first iteration only, check to see if rounding up gives the exact result as the
+          // nines may infinitely repeat.
+          if (!rep) {
+            finalise(t, e + 1, 0);
+
+            if (t.times(t).times(t).eq(x)) {
+              r = t;
+              break;
+            }
+          }
+
+          sd += 4;
+          rep = 1;
+        } else {
+
+          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+          // If not, then there are further digits and m will be truthy.
+          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+            // Truncate to the first rounding digit.
+            finalise(r, e + 1, 1);
+            m = !r.times(r).times(r).eq(x);
+          }
+
+          break;
+        }
+      }
+    }
+
+    external = true;
+
+    return finalise(r, e, Ctor.rounding, m);
+  };
+
+
+  /*
+   * Return the number of decimal places of the value of this Decimal.
+   *
+   */
+  P.decimalPlaces = P.dp = function () {
+    var w,
+      d = this.d,
+      n = NaN;
+
+    if (d) {
+      w = d.length - 1;
+      n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
+
+      // Subtract the number of trailing zeros of the last word.
+      w = d[w];
+      if (w) for (; w % 10 == 0; w /= 10) n--;
+      if (n < 0) n = 0;
+    }
+
+    return n;
+  };
+
+
+  /*
+   *  n / 0 = I
+   *  n / N = N
+   *  n / I = 0
+   *  0 / n = 0
+   *  0 / 0 = N
+   *  0 / N = N
+   *  0 / I = 0
+   *  N / n = N
+   *  N / 0 = N
+   *  N / N = N
+   *  N / I = N
+   *  I / n = I
+   *  I / 0 = I
+   *  I / N = N
+   *  I / I = N
+   *
+   * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.dividedBy = P.div = function (y) {
+    return divide(this, new this.constructor(y));
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the integer part of dividing the value of this Decimal
+   * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.dividedToIntegerBy = P.divToInt = function (y) {
+    var x = this,
+      Ctor = x.constructor;
+    return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.
+   *
+   */
+  P.equals = P.eq = function (y) {
+    return this.cmp(y) === 0;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+   * direction of negative Infinity.
+   *
+   */
+  P.floor = function () {
+    return finalise(new this.constructor(this), this.e + 1, 3);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is greater than the value of `y`, otherwise return
+   * false.
+   *
+   */
+  P.greaterThan = P.gt = function (y) {
+    return this.cmp(y) > 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is greater than or equal to the value of `y`,
+   * otherwise return false.
+   *
+   */
+  P.greaterThanOrEqualTo = P.gte = function (y) {
+    var k = this.cmp(y);
+    return k == 1 || k === 0;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [1, Infinity]
+   *
+   * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...
+   *
+   * cosh(0)         = 1
+   * cosh(-0)        = 1
+   * cosh(Infinity)  = Infinity
+   * cosh(-Infinity) = Infinity
+   * cosh(NaN)       = NaN
+   *
+   *  x        time taken (ms)   result
+   * 1000      9                 9.8503555700852349694e+433
+   * 10000     25                4.4034091128314607936e+4342
+   * 100000    171               1.4033316802130615897e+43429
+   * 1000000   3817              1.5166076984010437725e+434294
+   * 10000000  abandoned after 2 minute wait
+   *
+   * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))
+   *
+   */
+  P.hyperbolicCosine = P.cosh = function () {
+    var k, n, pr, rm, len,
+      x = this,
+      Ctor = x.constructor,
+      one = new Ctor(1);
+
+    if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);
+    if (x.isZero()) return one;
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+    Ctor.rounding = 1;
+    len = x.d.length;
+
+    // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1
+    // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))
+
+    // Estimate the optimum number of times to use the argument reduction.
+    // TODO? Estimation reused from cosine() and may not be optimal here.
+    if (len < 32) {
+      k = Math.ceil(len / 3);
+      n = (1 / tinyPow(4, k)).toString();
+    } else {
+      k = 16;
+      n = '2.3283064365386962890625e-10';
+    }
+
+    x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
+
+    // Reverse argument reduction
+    var cosh2_x,
+      i = k,
+      d8 = new Ctor(8);
+    for (; i--;) {
+      cosh2_x = x.times(x);
+      x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
+    }
+
+    return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...
+   *
+   * sinh(0)         = 0
+   * sinh(-0)        = -0
+   * sinh(Infinity)  = Infinity
+   * sinh(-Infinity) = -Infinity
+   * sinh(NaN)       = NaN
+   *
+   * x        time taken (ms)
+   * 10       2 ms
+   * 100      5 ms
+   * 1000     14 ms
+   * 10000    82 ms
+   * 100000   886 ms            1.4033316802130615897e+43429
+   * 200000   2613 ms
+   * 300000   5407 ms
+   * 400000   8824 ms
+   * 500000   13026 ms          8.7080643612718084129e+217146
+   * 1000000  48543 ms
+   *
+   * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))
+   *
+   */
+  P.hyperbolicSine = P.sinh = function () {
+    var k, pr, rm, len,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+    Ctor.rounding = 1;
+    len = x.d.length;
+
+    if (len < 3) {
+      x = taylorSeries(Ctor, 2, x, x, true);
+    } else {
+
+      // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))
+      // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))
+      // 3 multiplications and 1 addition
+
+      // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))
+      // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))
+      // 4 multiplications and 2 additions
+
+      // Estimate the optimum number of times to use the argument reduction.
+      k = 1.4 * Math.sqrt(len);
+      k = k > 16 ? 16 : k | 0;
+
+      x = x.times(1 / tinyPow(5, k));
+      x = taylorSeries(Ctor, 2, x, x, true);
+
+      // Reverse argument reduction
+      var sinh2_x,
+        d5 = new Ctor(5),
+        d16 = new Ctor(16),
+        d20 = new Ctor(20);
+      for (; k--;) {
+        sinh2_x = x.times(x);
+        x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
+      }
+    }
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(x, pr, rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * tanh(x) = sinh(x) / cosh(x)
+   *
+   * tanh(0)         = 0
+   * tanh(-0)        = -0
+   * tanh(Infinity)  = 1
+   * tanh(-Infinity) = -1
+   * tanh(NaN)       = NaN
+   *
+   */
+  P.hyperbolicTangent = P.tanh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(x.s);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 7;
+    Ctor.rounding = 1;
+
+    return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of
+   * this Decimal.
+   *
+   * Domain: [-1, 1]
+   * Range: [0, pi]
+   *
+   * acos(x) = pi/2 - asin(x)
+   *
+   * acos(0)       = pi/2
+   * acos(-0)      = pi/2
+   * acos(1)       = 0
+   * acos(-1)      = pi
+   * acos(1/2)     = pi/3
+   * acos(-1/2)    = 2*pi/3
+   * acos(|x| > 1) = NaN
+   * acos(NaN)     = NaN
+   *
+   */
+  P.inverseCosine = P.acos = function () {
+    var x = this,
+      Ctor = x.constructor,
+      k = x.abs().cmp(1),
+      pr = Ctor.precision,
+      rm = Ctor.rounding;
+
+    if (k !== -1) {
+      return k === 0
+        // |x| is 1
+        ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)
+        // |x| > 1 or x is NaN
+        : new Ctor(NaN);
+    }
+
+    if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);
+
+    // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3
+
+    Ctor.precision = pr + 6;
+    Ctor.rounding = 1;
+
+    // See https://github.com/MikeMcl/decimal.js/pull/217
+    x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().atan();
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.times(2);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the
+   * value of this Decimal.
+   *
+   * Domain: [1, Infinity]
+   * Range: [0, Infinity]
+   *
+   * acosh(x) = ln(x + sqrt(x^2 - 1))
+   *
+   * acosh(x < 1)     = NaN
+   * acosh(NaN)       = NaN
+   * acosh(Infinity)  = Infinity
+   * acosh(-Infinity) = NaN
+   * acosh(0)         = NaN
+   * acosh(-0)        = NaN
+   * acosh(1)         = 0
+   * acosh(-1)        = NaN
+   *
+   */
+  P.inverseHyperbolicCosine = P.acosh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);
+    if (!x.isFinite()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
+    Ctor.rounding = 1;
+    external = false;
+
+    x = x.times(x).minus(1).sqrt().plus(x);
+
+    external = true;
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.ln();
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value
+   * of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * asinh(x) = ln(x + sqrt(x^2 + 1))
+   *
+   * asinh(NaN)       = NaN
+   * asinh(Infinity)  = Infinity
+   * asinh(-Infinity) = -Infinity
+   * asinh(0)         = 0
+   * asinh(-0)        = -0
+   *
+   */
+  P.inverseHyperbolicSine = P.asinh = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
+    Ctor.rounding = 1;
+    external = false;
+
+    x = x.times(x).plus(1).sqrt().plus(x);
+
+    external = true;
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.ln();
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the
+   * value of this Decimal.
+   *
+   * Domain: [-1, 1]
+   * Range: [-Infinity, Infinity]
+   *
+   * atanh(x) = 0.5 * ln((1 + x) / (1 - x))
+   *
+   * atanh(|x| > 1)   = NaN
+   * atanh(NaN)       = NaN
+   * atanh(Infinity)  = NaN
+   * atanh(-Infinity) = NaN
+   * atanh(0)         = 0
+   * atanh(-0)        = -0
+   * atanh(1)         = Infinity
+   * atanh(-1)        = -Infinity
+   *
+   */
+  P.inverseHyperbolicTangent = P.atanh = function () {
+    var pr, rm, wpr, xsd,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    xsd = x.sd();
+
+    if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);
+
+    Ctor.precision = wpr = xsd - x.e;
+
+    x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
+
+    Ctor.precision = pr + 4;
+    Ctor.rounding = 1;
+
+    x = x.ln();
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.times(0.5);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this
+   * Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi/2, pi/2]
+   *
+   * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))
+   *
+   * asin(0)       = 0
+   * asin(-0)      = -0
+   * asin(1/2)     = pi/6
+   * asin(-1/2)    = -pi/6
+   * asin(1)       = pi/2
+   * asin(-1)      = -pi/2
+   * asin(|x| > 1) = NaN
+   * asin(NaN)     = NaN
+   *
+   * TODO? Compare performance of Taylor series.
+   *
+   */
+  P.inverseSine = P.asin = function () {
+    var halfPi, k,
+      pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (x.isZero()) return new Ctor(x);
+
+    k = x.abs().cmp(1);
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    if (k !== -1) {
+
+      // |x| is 1
+      if (k === 0) {
+        halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+        halfPi.s = x.s;
+        return halfPi;
+      }
+
+      // |x| > 1 or x is NaN
+      return new Ctor(NaN);
+    }
+
+    // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6
+
+    Ctor.precision = pr + 6;
+    Ctor.rounding = 1;
+
+    x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return x.times(2);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value
+   * of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi/2, pi/2]
+   *
+   * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+   *
+   * atan(0)         = 0
+   * atan(-0)        = -0
+   * atan(1)         = pi/4
+   * atan(-1)        = -pi/4
+   * atan(Infinity)  = pi/2
+   * atan(-Infinity) = -pi/2
+   * atan(NaN)       = NaN
+   *
+   */
+  P.inverseTangent = P.atan = function () {
+    var i, j, k, n, px, t, r, wpr, x2,
+      x = this,
+      Ctor = x.constructor,
+      pr = Ctor.precision,
+      rm = Ctor.rounding;
+
+    if (!x.isFinite()) {
+      if (!x.s) return new Ctor(NaN);
+      if (pr + 4 <= PI_PRECISION) {
+        r = getPi(Ctor, pr + 4, rm).times(0.5);
+        r.s = x.s;
+        return r;
+      }
+    } else if (x.isZero()) {
+      return new Ctor(x);
+    } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
+      r = getPi(Ctor, pr + 4, rm).times(0.25);
+      r.s = x.s;
+      return r;
+    }
+
+    Ctor.precision = wpr = pr + 10;
+    Ctor.rounding = 1;
+
+    // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);
+
+    // Argument reduction
+    // Ensure |x| < 0.42
+    // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))
+
+    k = Math.min(28, wpr / LOG_BASE + 2 | 0);
+
+    for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));
+
+    external = false;
+
+    j = Math.ceil(wpr / LOG_BASE);
+    n = 1;
+    x2 = x.times(x);
+    r = new Ctor(x);
+    px = x;
+
+    // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+    for (; i !== -1;) {
+      px = px.times(x2);
+      t = r.minus(px.div(n += 2));
+
+      px = px.times(x2);
+      r = t.plus(px.div(n += 2));
+
+      if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);
+    }
+
+    if (k) r = r.times(2 << (k - 1));
+
+    external = true;
+
+    return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is a finite number, otherwise return false.
+   *
+   */
+  P.isFinite = function () {
+    return !!this.d;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is an integer, otherwise return false.
+   *
+   */
+  P.isInteger = P.isInt = function () {
+    return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is NaN, otherwise return false.
+   *
+   */
+  P.isNaN = function () {
+    return !this.s;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is negative, otherwise return false.
+   *
+   */
+  P.isNegative = P.isNeg = function () {
+    return this.s < 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is positive, otherwise return false.
+   *
+   */
+  P.isPositive = P.isPos = function () {
+    return this.s > 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is 0 or -0, otherwise return false.
+   *
+   */
+  P.isZero = function () {
+    return !!this.d && this.d[0] === 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is less than `y`, otherwise return false.
+   *
+   */
+  P.lessThan = P.lt = function (y) {
+    return this.cmp(y) < 0;
+  };
+
+
+  /*
+   * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.
+   *
+   */
+  P.lessThanOrEqualTo = P.lte = function (y) {
+    return this.cmp(y) < 1;
+  };
+
+
+  /*
+   * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * If no base is specified, return log[10](arg).
+   *
+   * log[base](arg) = ln(arg) / ln(base)
+   *
+   * The result will always be correctly rounded if the base of the log is 10, and 'almost always'
+   * otherwise:
+   *
+   * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen
+   * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error
+   * between the result and the correctly rounded result will be one ulp (unit in the last place).
+   *
+   * log[-b](a)       = NaN
+   * log[0](a)        = NaN
+   * log[1](a)        = NaN
+   * log[NaN](a)      = NaN
+   * log[Infinity](a) = NaN
+   * log[b](0)        = -Infinity
+   * log[b](-0)       = -Infinity
+   * log[b](-a)       = NaN
+   * log[b](1)        = 0
+   * log[b](Infinity) = Infinity
+   * log[b](NaN)      = NaN
+   *
+   * [base] {number|string|bigint|Decimal} The base of the logarithm.
+   *
+   */
+  P.logarithm = P.log = function (base) {
+    var isBase10, d, denominator, k, inf, num, sd, r,
+      arg = this,
+      Ctor = arg.constructor,
+      pr = Ctor.precision,
+      rm = Ctor.rounding,
+      guard = 5;
+
+    // Default base is 10.
+    if (base == null) {
+      base = new Ctor(10);
+      isBase10 = true;
+    } else {
+      base = new Ctor(base);
+      d = base.d;
+
+      // Return NaN if base is negative, or non-finite, or is 0 or 1.
+      if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);
+
+      isBase10 = base.eq(10);
+    }
+
+    d = arg.d;
+
+    // Is arg negative, non-finite, 0 or 1?
+    if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
+      return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
+    }
+
+    // The result will have a non-terminating decimal expansion if base is 10 and arg is not an
+    // integer power of 10.
+    if (isBase10) {
+      if (d.length > 1) {
+        inf = true;
+      } else {
+        for (k = d[0]; k % 10 === 0;) k /= 10;
+        inf = k !== 1;
+      }
+    }
+
+    external = false;
+    sd = pr + guard;
+    num = naturalLogarithm(arg, sd);
+    denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+
+    // The result will have 5 rounding digits.
+    r = divide(num, denominator, sd, 1);
+
+    // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,
+    // calculate 10 further digits.
+    //
+    // If the result is known to have an infinite decimal expansion, repeat this until it is clear
+    // that the result is above or below the boundary. Otherwise, if after calculating the 10
+    // further digits, the last 14 are nines, round up and assume the result is exact.
+    // Also assume the result is exact if the last 14 are zero.
+    //
+    // Example of a result that will be incorrectly rounded:
+    // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...
+    // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it
+    // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so
+    // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal
+    // place is still 2.6.
+    if (checkRoundingDigits(r.d, k = pr, rm)) {
+
+      do {
+        sd += 10;
+        num = naturalLogarithm(arg, sd);
+        denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+        r = divide(num, denominator, sd, 1);
+
+        if (!inf) {
+
+          // Check for 14 nines from the 2nd rounding digit, as the first may be 4.
+          if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
+            r = finalise(r, pr + 1, 0);
+          }
+
+          break;
+        }
+      } while (checkRoundingDigits(r.d, k += 10, rm));
+    }
+
+    external = true;
+
+    return finalise(r, pr, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+  P.max = function () {
+    Array.prototype.push.call(arguments, this);
+    return maxOrMin(this.constructor, arguments, -1);
+  };
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+  P.min = function () {
+    Array.prototype.push.call(arguments, this);
+    return maxOrMin(this.constructor, arguments, 1);
+  };
+   */
+
+
+  /*
+   *  n - 0 = n
+   *  n - N = N
+   *  n - I = -I
+   *  0 - n = -n
+   *  0 - 0 = 0
+   *  0 - N = N
+   *  0 - I = -I
+   *  N - n = N
+   *  N - 0 = N
+   *  N - N = N
+   *  N - I = N
+   *  I - n = I
+   *  I - 0 = I
+   *  I - N = N
+   *  I - I = N
+   *
+   * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.minus = P.sub = function (y) {
+    var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // If either is not finite...
+    if (!x.d || !y.d) {
+
+      // Return NaN if either is NaN.
+      if (!x.s || !y.s) y = new Ctor(NaN);
+
+      // Return y negated if x is finite and y is ±Infinity.
+      else if (x.d) y.s = -y.s;
+
+      // Return x if y is finite and x is ±Infinity.
+      // Return x if both are ±Infinity with different signs.
+      // Return NaN if both are ±Infinity with the same sign.
+      else y = new Ctor(y.d || x.s !== y.s ? x : NaN);
+
+      return y;
+    }
+
+    // If signs differ...
+    if (x.s != y.s) {
+      y.s = -y.s;
+      return x.plus(y);
+    }
+
+    xd = x.d;
+    yd = y.d;
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    // If either is zero...
+    if (!xd[0] || !yd[0]) {
+
+      // Return y negated if x is zero and y is non-zero.
+      if (yd[0]) y.s = -y.s;
+
+      // Return x if y is zero and x is non-zero.
+      else if (xd[0]) y = new Ctor(x);
+
+      // Return zero if both are zero.
+      // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.
+      else return new Ctor(rm === 3 ? -0 : 0);
+
+      return external ? finalise(y, pr, rm) : y;
+    }
+
+    // x and y are finite, non-zero numbers with the same sign.
+
+    // Calculate base 1e7 exponents.
+    e = mathfloor(y.e / LOG_BASE);
+    xe = mathfloor(x.e / LOG_BASE);
+
+    xd = xd.slice();
+    k = xe - e;
+
+    // If base 1e7 exponents differ...
+    if (k) {
+      xLTy = k < 0;
+
+      if (xLTy) {
+        d = xd;
+        k = -k;
+        len = yd.length;
+      } else {
+        d = yd;
+        e = xe;
+        len = xd.length;
+      }
+
+      // Numbers with massively different exponents would result in a very high number of
+      // zeros needing to be prepended, but this can be avoided while still ensuring correct
+      // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.
+      i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
+
+      if (k > i) {
+        k = i;
+        d.length = 1;
+      }
+
+      // Prepend zeros to equalise exponents.
+      d.reverse();
+      for (i = k; i--;) d.push(0);
+      d.reverse();
+
+    // Base 1e7 exponents equal.
+    } else {
+
+      // Check digits to determine which is the bigger number.
+
+      i = xd.length;
+      len = yd.length;
+      xLTy = i < len;
+      if (xLTy) len = i;
+
+      for (i = 0; i < len; i++) {
+        if (xd[i] != yd[i]) {
+          xLTy = xd[i] < yd[i];
+          break;
+        }
+      }
+
+      k = 0;
+    }
+
+    if (xLTy) {
+      d = xd;
+      xd = yd;
+      yd = d;
+      y.s = -y.s;
+    }
+
+    len = xd.length;
+
+    // Append zeros to `xd` if shorter.
+    // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.
+    for (i = yd.length - len; i > 0; --i) xd[len++] = 0;
+
+    // Subtract yd from xd.
+    for (i = yd.length; i > k;) {
+
+      if (xd[--i] < yd[i]) {
+        for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;
+        --xd[j];
+        xd[i] += BASE;
+      }
+
+      xd[i] -= yd[i];
+    }
+
+    // Remove trailing zeros.
+    for (; xd[--len] === 0;) xd.pop();
+
+    // Remove leading zeros and adjust exponent accordingly.
+    for (; xd[0] === 0; xd.shift()) --e;
+
+    // Zero?
+    if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);
+
+    y.d = xd;
+    y.e = getBase10Exponent(xd, e);
+
+    return external ? finalise(y, pr, rm) : y;
+  };
+
+
+  /*
+   *   n % 0 =  N
+   *   n % N =  N
+   *   n % I =  n
+   *   0 % n =  0
+   *  -0 % n = -0
+   *   0 % 0 =  N
+   *   0 % N =  N
+   *   0 % I =  0
+   *   N % n =  N
+   *   N % 0 =  N
+   *   N % N =  N
+   *   N % I =  N
+   *   I % n =  N
+   *   I % 0 =  N
+   *   I % N =  N
+   *   I % I =  N
+   *
+   * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * The result depends on the modulo mode.
+   *
+   */
+  P.modulo = P.mod = function (y) {
+    var q,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.
+    if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);
+
+    // Return x if y is ±Infinity or x is ±0.
+    if (!y.d || x.d && !x.d[0]) {
+      return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
+    }
+
+    // Prevent rounding of intermediate calculations.
+    external = false;
+
+    if (Ctor.modulo == 9) {
+
+      // Euclidian division: q = sign(y) * floor(x / abs(y))
+      // result = x - q * y    where  0 <= result < abs(y)
+      q = divide(x, y.abs(), 0, 3, 1);
+      q.s *= y.s;
+    } else {
+      q = divide(x, y, 0, Ctor.modulo, 1);
+    }
+
+    q = q.times(y);
+
+    external = true;
+
+    return x.minus(q);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of the value of this Decimal,
+   * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.naturalExponential = P.exp = function () {
+    return naturalExponential(this);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,
+   * rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   */
+  P.naturalLogarithm = P.ln = function () {
+    return naturalLogarithm(this);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by
+   * -1.
+   *
+   */
+  P.negated = P.neg = function () {
+    var x = new this.constructor(this);
+    x.s = -x.s;
+    return finalise(x);
+  };
+
+
+  /*
+   *  n + 0 = n
+   *  n + N = N
+   *  n + I = I
+   *  0 + n = n
+   *  0 + 0 = 0
+   *  0 + N = N
+   *  0 + I = I
+   *  N + n = N
+   *  N + 0 = N
+   *  N + N = N
+   *  N + I = N
+   *  I + n = I
+   *  I + 0 = I
+   *  I + N = N
+   *  I + I = I
+   *
+   * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   */
+  P.plus = P.add = function (y) {
+    var carry, d, e, i, k, len, pr, rm, xd, yd,
+      x = this,
+      Ctor = x.constructor;
+
+    y = new Ctor(y);
+
+    // If either is not finite...
+    if (!x.d || !y.d) {
+
+      // Return NaN if either is NaN.
+      if (!x.s || !y.s) y = new Ctor(NaN);
+
+      // Return x if y is finite and x is ±Infinity.
+      // Return x if both are ±Infinity with the same sign.
+      // Return NaN if both are ±Infinity with different signs.
+      // Return y if x is finite and y is ±Infinity.
+      else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);
+
+      return y;
+    }
+
+     // If signs differ...
+    if (x.s != y.s) {
+      y.s = -y.s;
+      return x.minus(y);
+    }
+
+    xd = x.d;
+    yd = y.d;
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    // If either is zero...
+    if (!xd[0] || !yd[0]) {
+
+      // Return x if y is zero.
+      // Return y if y is non-zero.
+      if (!yd[0]) y = new Ctor(x);
+
+      return external ? finalise(y, pr, rm) : y;
+    }
+
+    // x and y are finite, non-zero numbers with the same sign.
+
+    // Calculate base 1e7 exponents.
+    k = mathfloor(x.e / LOG_BASE);
+    e = mathfloor(y.e / LOG_BASE);
+
+    xd = xd.slice();
+    i = k - e;
+
+    // If base 1e7 exponents differ...
+    if (i) {
+
+      if (i < 0) {
+        d = xd;
+        i = -i;
+        len = yd.length;
+      } else {
+        d = yd;
+        e = k;
+        len = xd.length;
+      }
+
+      // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.
+      k = Math.ceil(pr / LOG_BASE);
+      len = k > len ? k + 1 : len + 1;
+
+      if (i > len) {
+        i = len;
+        d.length = 1;
+      }
+
+      // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.
+      d.reverse();
+      for (; i--;) d.push(0);
+      d.reverse();
+    }
+
+    len = xd.length;
+    i = yd.length;
+
+    // If yd is longer than xd, swap xd and yd so xd points to the longer array.
+    if (len - i < 0) {
+      i = len;
+      d = yd;
+      yd = xd;
+      xd = d;
+    }
+
+    // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.
+    for (carry = 0; i;) {
+      carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
+      xd[i] %= BASE;
+    }
+
+    if (carry) {
+      xd.unshift(carry);
+      ++e;
+    }
+
+    // Remove trailing zeros.
+    // No need to check for zero, as +x + +y != 0 && -x + -y != 0
+    for (len = xd.length; xd[--len] == 0;) xd.pop();
+
+    y.d = xd;
+    y.e = getBase10Exponent(xd, e);
+
+    return external ? finalise(y, pr, rm) : y;
+  };
+
+
+  /*
+   * Return the number of significant digits of the value of this Decimal.
+   *
+   * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
+   *
+   */
+  P.precision = P.sd = function (z) {
+    var k,
+      x = this;
+
+    if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);
+
+    if (x.d) {
+      k = getPrecision(x.d);
+      if (z && x.e + 1 > k) k = x.e + 1;
+    } else {
+      k = NaN;
+    }
+
+    return k;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using
+   * rounding mode `rounding`.
+   *
+   */
+  P.round = function () {
+    var x = this,
+      Ctor = x.constructor;
+
+    return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the sine of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-1, 1]
+   *
+   * sin(x) = x - x^3/3! + x^5/5! - ...
+   *
+   * sin(0)         = 0
+   * sin(-0)        = -0
+   * sin(Infinity)  = NaN
+   * sin(-Infinity) = NaN
+   * sin(NaN)       = NaN
+   *
+   */
+  P.sine = P.sin = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+    Ctor.rounding = 1;
+
+    x = sine(Ctor, toLessThanHalfPi(Ctor, x));
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   *  sqrt(-n) =  N
+   *  sqrt(N)  =  N
+   *  sqrt(-I) =  N
+   *  sqrt(I)  =  I
+   *  sqrt(0)  =  0
+   *  sqrt(-0) = -0
+   *
+   */
+  P.squareRoot = P.sqrt = function () {
+    var m, n, sd, r, rep, t,
+      x = this,
+      d = x.d,
+      e = x.e,
+      s = x.s,
+      Ctor = x.constructor;
+
+    // Negative/NaN/Infinity/zero?
+    if (s !== 1 || !d || !d[0]) {
+      return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
+    }
+
+    external = false;
+
+    // Initial estimate.
+    s = Math.sqrt(+x);
+
+    // Math.sqrt underflow/overflow?
+    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.
+    if (s == 0 || s == 1 / 0) {
+      n = digitsToString(d);
+
+      if ((n.length + e) % 2 == 0) n += '0';
+      s = Math.sqrt(n);
+      e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
+
+      if (s == 1 / 0) {
+        n = '5e' + e;
+      } else {
+        n = s.toExponential();
+        n = n.slice(0, n.indexOf('e') + 1) + e;
+      }
+
+      r = new Ctor(n);
+    } else {
+      r = new Ctor(s.toString());
+    }
+
+    sd = (e = Ctor.precision) + 3;
+
+    // Newton-Raphson iteration.
+    for (;;) {
+      t = r;
+      r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
+
+      // TODO? Replace with for-loop and checkRoundingDigits.
+      if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+        n = n.slice(sd - 3, sd + 1);
+
+        // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or
+        // 4999, i.e. approaching a rounding boundary, continue the iteration.
+        if (n == '9999' || !rep && n == '4999') {
+
+          // On the first iteration only, check to see if rounding up gives the exact result as the
+          // nines may infinitely repeat.
+          if (!rep) {
+            finalise(t, e + 1, 0);
+
+            if (t.times(t).eq(x)) {
+              r = t;
+              break;
+            }
+          }
+
+          sd += 4;
+          rep = 1;
+        } else {
+
+          // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+          // If not, then there are further digits and m will be truthy.
+          if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+            // Truncate to the first rounding digit.
+            finalise(r, e + 1, 1);
+            m = !r.times(r).eq(x);
+          }
+
+          break;
+        }
+      }
+    }
+
+    external = true;
+
+    return finalise(r, e, Ctor.rounding, m);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-Infinity, Infinity]
+   *
+   * tan(0)         = 0
+   * tan(-0)        = -0
+   * tan(Infinity)  = NaN
+   * tan(-Infinity) = NaN
+   * tan(NaN)       = NaN
+   *
+   */
+  P.tangent = P.tan = function () {
+    var pr, rm,
+      x = this,
+      Ctor = x.constructor;
+
+    if (!x.isFinite()) return new Ctor(NaN);
+    if (x.isZero()) return new Ctor(x);
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+    Ctor.precision = pr + 10;
+    Ctor.rounding = 1;
+
+    x = x.sin();
+    x.s = 1;
+    x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
+
+    Ctor.precision = pr;
+    Ctor.rounding = rm;
+
+    return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
+  };
+
+
+  /*
+   *  n * 0 = 0
+   *  n * N = N
+   *  n * I = I
+   *  0 * n = 0
+   *  0 * 0 = 0
+   *  0 * N = N
+   *  0 * I = N
+   *  N * n = N
+   *  N * 0 = N
+   *  N * N = N
+   *  N * I = N
+   *  I * n = I
+   *  I * 0 = N
+   *  I * N = N
+   *  I * I = I
+   *
+   * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   */
+  P.times = P.mul = function (y) {
+    var carry, e, i, k, r, rL, t, xdL, ydL,
+      x = this,
+      Ctor = x.constructor,
+      xd = x.d,
+      yd = (y = new Ctor(y)).d;
+
+    y.s *= x.s;
+
+     // If either is NaN, ±Infinity or ±0...
+    if (!xd || !xd[0] || !yd || !yd[0]) {
+
+      return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd
+
+        // Return NaN if either is NaN.
+        // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
+        ? NaN
+
+        // Return ±Infinity if either is ±Infinity.
+        // Return ±0 if either is ±0.
+        : !xd || !yd ? y.s / 0 : y.s * 0);
+    }
+
+    e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
+    xdL = xd.length;
+    ydL = yd.length;
+
+    // Ensure xd points to the longer array.
+    if (xdL < ydL) {
+      r = xd;
+      xd = yd;
+      yd = r;
+      rL = xdL;
+      xdL = ydL;
+      ydL = rL;
+    }
+
+    // Initialise the result array with zeros.
+    r = [];
+    rL = xdL + ydL;
+    for (i = rL; i--;) r.push(0);
+
+    // Multiply!
+    for (i = ydL; --i >= 0;) {
+      carry = 0;
+      for (k = xdL + i; k > i;) {
+        t = r[k] + yd[i] * xd[k - i - 1] + carry;
+        r[k--] = t % BASE | 0;
+        carry = t / BASE | 0;
+      }
+
+      r[k] = (r[k] + carry) % BASE | 0;
+    }
+
+    // Remove trailing zeros.
+    for (; !r[--rL];) r.pop();
+
+    if (carry) ++e;
+    else r.shift();
+
+    y.d = r;
+    y.e = getBase10Exponent(r, e);
+
+    return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 2, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toBinary = function (sd, rm) {
+    return toStringBinary(this, 2, sd, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`
+   * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.
+   *
+   * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toDecimalPlaces = P.toDP = function (dp, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    x = new Ctor(x);
+    if (dp === void 0) return x;
+
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    return finalise(x, dp + x.e + 1, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in exponential notation rounded to
+   * `dp` fixed decimal places using rounding mode `rounding`.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toExponential = function (dp, rm) {
+    var str,
+      x = this,
+      Ctor = x.constructor;
+
+    if (dp === void 0) {
+      str = finiteToString(x, true);
+    } else {
+      checkInt32(dp, 0, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      x = finalise(new Ctor(x), dp + 1, rm);
+      str = finiteToString(x, true, dp + 1);
+    }
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in normal (fixed-point) notation to
+   * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is
+   * omitted.
+   *
+   * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.
+   *
+   * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.
+   * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.
+   * (-0).toFixed(3) is '0.000'.
+   * (-0.5).toFixed(0) is '-0'.
+   *
+   */
+  P.toFixed = function (dp, rm) {
+    var str, y,
+      x = this,
+      Ctor = x.constructor;
+
+    if (dp === void 0) {
+      str = finiteToString(x);
+    } else {
+      checkInt32(dp, 0, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      y = finalise(new Ctor(x), dp + x.e + 1, rm);
+      str = finiteToString(y, false, dp + y.e + 1);
+    }
+
+    // To determine whether to add the minus sign look at the value before it was rounded,
+    // i.e. look at `x` rather than `y`.
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return an array representing the value of this Decimal as a simple fraction with an integer
+   * numerator and an integer denominator.
+   *
+   * The denominator will be a positive non-zero value less than or equal to the specified maximum
+   * denominator. If a maximum denominator is not specified, the denominator will be the lowest
+   * value necessary to represent the number exactly.
+   *
+   * [maxD] {number|string|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.
+   *
+   */
+  P.toFraction = function (maxD) {
+    var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,
+      x = this,
+      xd = x.d,
+      Ctor = x.constructor;
+
+    if (!xd) return new Ctor(x);
+
+    n1 = d0 = new Ctor(1);
+    d1 = n0 = new Ctor(0);
+
+    d = new Ctor(d1);
+    e = d.e = getPrecision(xd) - x.e - 1;
+    k = e % LOG_BASE;
+    d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
+
+    if (maxD == null) {
+
+      // d is 10**e, the minimum max-denominator needed.
+      maxD = e > 0 ? d : n1;
+    } else {
+      n = new Ctor(maxD);
+      if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);
+      maxD = n.gt(d) ? (e > 0 ? d : n1) : n;
+    }
+
+    external = false;
+    n = new Ctor(digitsToString(xd));
+    pr = Ctor.precision;
+    Ctor.precision = e = xd.length * LOG_BASE * 2;
+
+    for (;;)  {
+      q = divide(n, d, 0, 1, 1);
+      d2 = d0.plus(q.times(d1));
+      if (d2.cmp(maxD) == 1) break;
+      d0 = d1;
+      d1 = d2;
+      d2 = n1;
+      n1 = n0.plus(q.times(d2));
+      n0 = d2;
+      d2 = d;
+      d = n.minus(q.times(d2));
+      n = d2;
+    }
+
+    d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
+    n0 = n0.plus(d2.times(n1));
+    d0 = d0.plus(d2.times(d1));
+    n0.s = n1.s = x.s;
+
+    // Determine which fraction is closer to x, n0/d0 or n1/d1?
+    r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1
+        ? [n1, d1] : [n0, d0];
+
+    Ctor.precision = pr;
+    external = true;
+
+    return r;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 16, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toHexadecimal = P.toHex = function (sd, rm) {
+    return toStringBinary(this, 16, sd, rm);
+  };
+
+
+  /*
+   * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding
+   * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.
+   *
+   * The return value will always have the same sign as this Decimal, unless either this Decimal
+   * or `y` is NaN, in which case the return value will be also be NaN.
+   *
+   * The return value is not affected by the value of `precision`.
+   *
+   * y {number|string|bigint|Decimal} The magnitude to round to a multiple of.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * 'toNearest() rounding mode not an integer: {rm}'
+   * 'toNearest() rounding mode out of range: {rm}'
+   *
+   */
+  P.toNearest = function (y, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    x = new Ctor(x);
+
+    if (y == null) {
+
+      // If x is not finite, return x.
+      if (!x.d) return x;
+
+      y = new Ctor(1);
+      rm = Ctor.rounding;
+    } else {
+      y = new Ctor(y);
+      if (rm === void 0) {
+        rm = Ctor.rounding;
+      } else {
+        checkInt32(rm, 0, 8);
+      }
+
+      // If x is not finite, return x if y is not NaN, else NaN.
+      if (!x.d) return y.s ? x : y;
+
+      // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.
+      if (!y.d) {
+        if (y.s) y.s = x.s;
+        return y;
+      }
+    }
+
+    // If y is not zero, calculate the nearest multiple of y to x.
+    if (y.d[0]) {
+      external = false;
+      x = divide(x, y, 0, rm, 1).times(y);
+      external = true;
+      finalise(x);
+
+    // If y is zero, return zero with the sign of x.
+    } else {
+      y.s = x.s;
+      x = y;
+    }
+
+    return x;
+  };
+
+
+  /*
+   * Return the value of this Decimal converted to a number primitive.
+   * Zero keeps its sign.
+   *
+   */
+  P.toNumber = function () {
+    return +this;
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal in base 8, round to `sd` significant
+   * digits using rounding mode `rm`.
+   *
+   * If the optional `sd` argument is present then return binary exponential notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toOctal = function (sd, rm) {
+    return toStringBinary(this, 8, sd, rm);
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded
+   * to `precision` significant digits using rounding mode `rounding`.
+   *
+   * ECMAScript compliant.
+   *
+   *   pow(x, NaN)                           = NaN
+   *   pow(x, ±0)                            = 1
+
+   *   pow(NaN, non-zero)                    = NaN
+   *   pow(abs(x) > 1, +Infinity)            = +Infinity
+   *   pow(abs(x) > 1, -Infinity)            = +0
+   *   pow(abs(x) == 1, ±Infinity)           = NaN
+   *   pow(abs(x) < 1, +Infinity)            = +0
+   *   pow(abs(x) < 1, -Infinity)            = +Infinity
+   *   pow(+Infinity, y > 0)                 = +Infinity
+   *   pow(+Infinity, y < 0)                 = +0
+   *   pow(-Infinity, odd integer > 0)       = -Infinity
+   *   pow(-Infinity, even integer > 0)      = +Infinity
+   *   pow(-Infinity, odd integer < 0)       = -0
+   *   pow(-Infinity, even integer < 0)      = +0
+   *   pow(+0, y > 0)                        = +0
+   *   pow(+0, y < 0)                        = +Infinity
+   *   pow(-0, odd integer > 0)              = -0
+   *   pow(-0, even integer > 0)             = +0
+   *   pow(-0, odd integer < 0)              = -Infinity
+   *   pow(-0, even integer < 0)             = +Infinity
+   *   pow(finite x < 0, finite non-integer) = NaN
+   *
+   * For non-integer or very large exponents pow(x, y) is calculated using
+   *
+   *   x^y = exp(y*ln(x))
+   *
+   * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the
+   * probability of an incorrectly rounded result
+   * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14
+   * i.e. 1 in 250,000,000,000,000
+   *
+   * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).
+   *
+   * y {number|string|bigint|Decimal} The power to which to raise this Decimal.
+   *
+   */
+  P.toPower = P.pow = function (y) {
+    var e, k, pr, r, rm, s,
+      x = this,
+      Ctor = x.constructor,
+      yn = +(y = new Ctor(y));
+
+    // Either ±Infinity, NaN or ±0?
+    if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));
+
+    x = new Ctor(x);
+
+    if (x.eq(1)) return x;
+
+    pr = Ctor.precision;
+    rm = Ctor.rounding;
+
+    if (y.eq(1)) return finalise(x, pr, rm);
+
+    // y exponent
+    e = mathfloor(y.e / LOG_BASE);
+
+    // If y is a small integer use the 'exponentiation by squaring' algorithm.
+    if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
+      r = intPow(Ctor, x, k, pr);
+      return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
+    }
+
+    s = x.s;
+
+    // if x is negative
+    if (s < 0) {
+
+      // if y is not an integer
+      if (e < y.d.length - 1) return new Ctor(NaN);
+
+      // Result is positive if x is negative and the last digit of integer y is even.
+      if ((y.d[e] & 1) == 0) s = 1;
+
+      // if x.eq(-1)
+      if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
+        x.s = s;
+        return x;
+      }
+    }
+
+    // Estimate result exponent.
+    // x^y = 10^e,  where e = y * log10(x)
+    // log10(x) = log10(x_significand) + x_exponent
+    // log10(x_significand) = ln(x_significand) / ln(10)
+    k = mathpow(+x, yn);
+    e = k == 0 || !isFinite(k)
+      ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))
+      : new Ctor(k + '').e;
+
+    // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.
+
+    // Overflow/underflow?
+    if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);
+
+    external = false;
+    Ctor.rounding = x.s = 1;
+
+    // Estimate the extra guard digits needed to ensure five correct rounding digits from
+    // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):
+    // new Decimal(2.32456).pow('2087987436534566.46411')
+    // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815
+    k = Math.min(12, (e + '').length);
+
+    // r = x^y = exp(y*ln(x))
+    r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
+
+    // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)
+    if (r.d) {
+
+      // Truncate to the required precision plus five rounding digits.
+      r = finalise(r, pr + 5, 1);
+
+      // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate
+      // the result.
+      if (checkRoundingDigits(r.d, pr, rm)) {
+        e = pr + 10;
+
+        // Truncate to the increased precision plus five rounding digits.
+        r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
+
+        // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).
+        if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
+          r = finalise(r, pr + 1, 0);
+        }
+      }
+    }
+
+    r.s = s;
+    external = true;
+    Ctor.rounding = rm;
+
+    return finalise(r, pr, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal rounded to `sd` significant digits
+   * using rounding mode `rounding`.
+   *
+   * Return exponential notation if `sd` is less than the number of digits necessary to represent
+   * the integer part of the value in normal notation.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   */
+  P.toPrecision = function (sd, rm) {
+    var str,
+      x = this,
+      Ctor = x.constructor;
+
+    if (sd === void 0) {
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+    } else {
+      checkInt32(sd, 1, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+
+      x = finalise(new Ctor(x), sd, rm);
+      str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
+    }
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`
+   * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if
+   * omitted.
+   *
+   * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+   *
+   * 'toSD() digits out of range: {sd}'
+   * 'toSD() digits not an integer: {sd}'
+   * 'toSD() rounding mode not an integer: {rm}'
+   * 'toSD() rounding mode out of range: {rm}'
+   *
+   */
+  P.toSignificantDigits = P.toSD = function (sd, rm) {
+    var x = this,
+      Ctor = x.constructor;
+
+    if (sd === void 0) {
+      sd = Ctor.precision;
+      rm = Ctor.rounding;
+    } else {
+      checkInt32(sd, 1, MAX_DIGITS);
+
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+    }
+
+    return finalise(new Ctor(x), sd, rm);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal.
+   *
+   * Return exponential notation if this Decimal has a positive exponent equal to or greater than
+   * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.
+   *
+   */
+  P.toString = function () {
+    var x = this,
+      Ctor = x.constructor,
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+    return x.isNeg() && !x.isZero() ? '-' + str : str;
+  };
+
+
+  /*
+   * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.
+   *
+   */
+  P.truncated = P.trunc = function () {
+    return finalise(new this.constructor(this), this.e + 1, 1);
+  };
+
+
+  /*
+   * Return a string representing the value of this Decimal.
+   * Unlike `toString`, negative zero will include the minus sign.
+   *
+   */
+  P.valueOf = P.toJSON = function () {
+    var x = this,
+      Ctor = x.constructor,
+      str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+    return x.isNeg() ? '-' + str : str;
+  };
+
+
+  // Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.
+
+
+  /*
+   *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,
+   *                           finiteToString, naturalExponential, naturalLogarithm
+   *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,
+   *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random
+   *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm
+   *  convertBase              toStringBinary, parseOther
+   *  cos                      P.cos
+   *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,
+   *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,
+   *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,
+   *                           taylorSeries, atan2, parseOther
+   *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,
+   *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,
+   *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,
+   *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,
+   *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,
+   *                           P.truncated, divide, getLn10, getPi, naturalExponential,
+   *                           naturalLogarithm, ceil, floor, round, trunc
+   *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,
+   *                           toStringBinary
+   *  getBase10Exponent        P.minus, P.plus, P.times, parseOther
+   *  getLn10                  P.logarithm, naturalLogarithm
+   *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2
+   *  getPrecision             P.precision, P.toFraction
+   *  getZeroString            digitsToString, finiteToString
+   *  intPow                   P.toPower, parseOther
+   *  isOdd                    toLessThanHalfPi
+   *  maxOrMin                 max, min
+   *  naturalExponential       P.naturalExponential, P.toPower
+   *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,
+   *                           P.toPower, naturalExponential
+   *  nonFiniteToString        finiteToString, toStringBinary
+   *  parseDecimal             Decimal
+   *  parseOther               Decimal
+   *  sin                      P.sin
+   *  taylorSeries             P.cosh, P.sinh, cos, sin
+   *  toLessThanHalfPi         P.cos, P.sin
+   *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal
+   *  truncate                 intPow
+   *
+   *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,
+   *                           naturalLogarithm, config, parseOther, random, Decimal
+   */
+
+
+  function digitsToString(d) {
+    var i, k, ws,
+      indexOfLastWord = d.length - 1,
+      str = '',
+      w = d[0];
+
+    if (indexOfLastWord > 0) {
+      str += w;
+      for (i = 1; i < indexOfLastWord; i++) {
+        ws = d[i] + '';
+        k = LOG_BASE - ws.length;
+        if (k) str += getZeroString(k);
+        str += ws;
+      }
+
+      w = d[i];
+      ws = w + '';
+      k = LOG_BASE - ws.length;
+      if (k) str += getZeroString(k);
+    } else if (w === 0) {
+      return '0';
+    }
+
+    // Remove trailing zeros of last w.
+    for (; w % 10 === 0;) w /= 10;
+
+    return str + w;
+  }
+
+
+  function checkInt32(i, min, max) {
+    if (i !== ~~i || i < min || i > max) {
+      throw Error(invalidArgument + i);
+    }
+  }
+
+
+  /*
+   * Check 5 rounding digits if `repeating` is null, 4 otherwise.
+   * `repeating == null` if caller is `log` or `pow`,
+   * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.
+   */
+  function checkRoundingDigits(d, i, rm, repeating) {
+    var di, k, r, rd;
+
+    // Get the length of the first word of the array d.
+    for (k = d[0]; k >= 10; k /= 10) --i;
+
+    // Is the rounding digit in the first word of d?
+    if (--i < 0) {
+      i += LOG_BASE;
+      di = 0;
+    } else {
+      di = Math.ceil((i + 1) / LOG_BASE);
+      i %= LOG_BASE;
+    }
+
+    // i is the index (0 - 6) of the rounding digit.
+    // E.g. if within the word 3487563 the first rounding digit is 5,
+    // then i = 4, k = 1000, rd = 3487563 % 1000 = 563
+    k = mathpow(10, LOG_BASE - i);
+    rd = d[di] % k | 0;
+
+    if (repeating == null) {
+      if (i < 3) {
+        if (i == 0) rd = rd / 100 | 0;
+        else if (i == 1) rd = rd / 10 | 0;
+        r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;
+      } else {
+        r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&
+          (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||
+            (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
+      }
+    } else {
+      if (i < 4) {
+        if (i == 0) rd = rd / 1000 | 0;
+        else if (i == 1) rd = rd / 100 | 0;
+        else if (i == 2) rd = rd / 10 | 0;
+        r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
+      } else {
+        r = ((repeating || rm < 4) && rd + 1 == k ||
+        (!repeating && rm > 3) && rd + 1 == k / 2) &&
+          (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;
+      }
+    }
+
+    return r;
+  }
+
+
+  // Convert string of `baseIn` to an array of numbers of `baseOut`.
+  // Eg. convertBase('255', 10, 16) returns [15, 15].
+  // Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
+  function convertBase(str, baseIn, baseOut) {
+    var j,
+      arr = [0],
+      arrL,
+      i = 0,
+      strL = str.length;
+
+    for (; i < strL;) {
+      for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;
+      arr[0] += NUMERALS.indexOf(str.charAt(i++));
+      for (j = 0; j < arr.length; j++) {
+        if (arr[j] > baseOut - 1) {
+          if (arr[j + 1] === void 0) arr[j + 1] = 0;
+          arr[j + 1] += arr[j] / baseOut | 0;
+          arr[j] %= baseOut;
+        }
+      }
+    }
+
+    return arr.reverse();
+  }
+
+
+  /*
+   * cos(x) = 1 - x^2/2! + x^4/4! - ...
+   * |x| < pi/2
+   *
+   */
+  function cosine(Ctor, x) {
+    var k, len, y;
+
+    if (x.isZero()) return x;
+
+    // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1
+    // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1
+
+    // Estimate the optimum number of times to use the argument reduction.
+    len = x.d.length;
+    if (len < 32) {
+      k = Math.ceil(len / 3);
+      y = (1 / tinyPow(4, k)).toString();
+    } else {
+      k = 16;
+      y = '2.3283064365386962890625e-10';
+    }
+
+    Ctor.precision += k;
+
+    x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
+
+    // Reverse argument reduction
+    for (var i = k; i--;) {
+      var cos2x = x.times(x);
+      x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
+    }
+
+    Ctor.precision -= k;
+
+    return x;
+  }
+
+
+  /*
+   * Perform division in the specified base.
+   */
+  var divide = (function () {
+
+    // Assumes non-zero x and k, and hence non-zero result.
+    function multiplyInteger(x, k, base) {
+      var temp,
+        carry = 0,
+        i = x.length;
+
+      for (x = x.slice(); i--;) {
+        temp = x[i] * k + carry;
+        x[i] = temp % base | 0;
+        carry = temp / base | 0;
+      }
+
+      if (carry) x.unshift(carry);
+
+      return x;
+    }
+
+    function compare(a, b, aL, bL) {
+      var i, r;
+
+      if (aL != bL) {
+        r = aL > bL ? 1 : -1;
+      } else {
+        for (i = r = 0; i < aL; i++) {
+          if (a[i] != b[i]) {
+            r = a[i] > b[i] ? 1 : -1;
+            break;
+          }
+        }
+      }
+
+      return r;
+    }
+
+    function subtract(a, b, aL, base) {
+      var i = 0;
+
+      // Subtract b from a.
+      for (; aL--;) {
+        a[aL] -= i;
+        i = a[aL] < b[aL] ? 1 : 0;
+        a[aL] = i * base + a[aL] - b[aL];
+      }
+
+      // Remove leading zeros.
+      for (; !a[0] && a.length > 1;) a.shift();
+    }
+
+    return function (x, y, pr, rm, dp, base) {
+      var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,
+        yL, yz,
+        Ctor = x.constructor,
+        sign = x.s == y.s ? 1 : -1,
+        xd = x.d,
+        yd = y.d;
+
+      // Either NaN, Infinity or 0?
+      if (!xd || !xd[0] || !yd || !yd[0]) {
+
+        return new Ctor(// Return NaN if either NaN, or both Infinity or 0.
+          !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :
+
+          // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+          xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);
+      }
+
+      if (base) {
+        logBase = 1;
+        e = x.e - y.e;
+      } else {
+        base = BASE;
+        logBase = LOG_BASE;
+        e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
+      }
+
+      yL = yd.length;
+      xL = xd.length;
+      q = new Ctor(sign);
+      qd = q.d = [];
+
+      // Result exponent may be one less than e.
+      // The digit array of a Decimal from toStringBinary may have trailing zeros.
+      for (i = 0; yd[i] == (xd[i] || 0); i++);
+
+      if (yd[i] > (xd[i] || 0)) e--;
+
+      if (pr == null) {
+        sd = pr = Ctor.precision;
+        rm = Ctor.rounding;
+      } else if (dp) {
+        sd = pr + (x.e - y.e) + 1;
+      } else {
+        sd = pr;
+      }
+
+      if (sd < 0) {
+        qd.push(1);
+        more = true;
+      } else {
+
+        // Convert precision in number of base 10 digits to base 1e7 digits.
+        sd = sd / logBase + 2 | 0;
+        i = 0;
+
+        // divisor < 1e7
+        if (yL == 1) {
+          k = 0;
+          yd = yd[0];
+          sd++;
+
+          // k is the carry.
+          for (; (i < xL || k) && sd--; i++) {
+            t = k * base + (xd[i] || 0);
+            qd[i] = t / yd | 0;
+            k = t % yd | 0;
+          }
+
+          more = k || i < xL;
+
+        // divisor >= 1e7
+        } else {
+
+          // Normalise xd and yd so highest order digit of yd is >= base/2
+          k = base / (yd[0] + 1) | 0;
+
+          if (k > 1) {
+            yd = multiplyInteger(yd, k, base);
+            xd = multiplyInteger(xd, k, base);
+            yL = yd.length;
+            xL = xd.length;
+          }
+
+          xi = yL;
+          rem = xd.slice(0, yL);
+          remL = rem.length;
+
+          // Add zeros to make remainder as long as divisor.
+          for (; remL < yL;) rem[remL++] = 0;
+
+          yz = yd.slice();
+          yz.unshift(0);
+          yd0 = yd[0];
+
+          if (yd[1] >= base / 2) ++yd0;
+
+          do {
+            k = 0;
+
+            // Compare divisor and remainder.
+            cmp = compare(yd, rem, yL, remL);
+
+            // If divisor < remainder.
+            if (cmp < 0) {
+
+              // Calculate trial digit, k.
+              rem0 = rem[0];
+              if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
+
+              // k will be how many times the divisor goes into the current remainder.
+              k = rem0 / yd0 | 0;
+
+              //  Algorithm:
+              //  1. product = divisor * trial digit (k)
+              //  2. if product > remainder: product -= divisor, k--
+              //  3. remainder -= product
+              //  4. if product was < remainder at 2:
+              //    5. compare new remainder and divisor
+              //    6. If remainder > divisor: remainder -= divisor, k++
+
+              if (k > 1) {
+                if (k >= base) k = base - 1;
+
+                // product = divisor * trial digit.
+                prod = multiplyInteger(yd, k, base);
+                prodL = prod.length;
+                remL = rem.length;
+
+                // Compare product and remainder.
+                cmp = compare(prod, rem, prodL, remL);
+
+                // product > remainder.
+                if (cmp == 1) {
+                  k--;
+
+                  // Subtract divisor from product.
+                  subtract(prod, yL < prodL ? yz : yd, prodL, base);
+                }
+              } else {
+
+                // cmp is -1.
+                // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1
+                // to avoid it. If k is 1 there is a need to compare yd and rem again below.
+                if (k == 0) cmp = k = 1;
+                prod = yd.slice();
+              }
+
+              prodL = prod.length;
+              if (prodL < remL) prod.unshift(0);
+
+              // Subtract product from remainder.
+              subtract(rem, prod, remL, base);
+
+              // If product was < previous remainder.
+              if (cmp == -1) {
+                remL = rem.length;
+
+                // Compare divisor and new remainder.
+                cmp = compare(yd, rem, yL, remL);
+
+                // If divisor < new remainder, subtract divisor from remainder.
+                if (cmp < 1) {
+                  k++;
+
+                  // Subtract divisor from remainder.
+                  subtract(rem, yL < remL ? yz : yd, remL, base);
+                }
+              }
+
+              remL = rem.length;
+            } else if (cmp === 0) {
+              k++;
+              rem = [0];
+            }    // if cmp === 1, k will be 0
+
+            // Add the next digit, k, to the result array.
+            qd[i++] = k;
+
+            // Update the remainder.
+            if (cmp && rem[0]) {
+              rem[remL++] = xd[xi] || 0;
+            } else {
+              rem = [xd[xi]];
+              remL = 1;
+            }
+
+          } while ((xi++ < xL || rem[0] !== void 0) && sd--);
+
+          more = rem[0] !== void 0;
+        }
+
+        // Leading zero?
+        if (!qd[0]) qd.shift();
+      }
+
+      // logBase is 1 when divide is being used for base conversion.
+      if (logBase == 1) {
+        q.e = e;
+        inexact = more;
+      } else {
+
+        // To calculate q.e, first get the number of digits of qd[0].
+        for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;
+        q.e = i + e * logBase - 1;
+
+        finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
+      }
+
+      return q;
+    };
+  })();
+
+
+  /*
+   * Round `x` to `sd` significant digits using rounding mode `rm`.
+   * Check for over/under-flow.
+   */
+   function finalise(x, sd, rm, isTruncated) {
+    var digits, i, j, k, rd, roundUp, w, xd, xdi,
+      Ctor = x.constructor;
+
+    // Don't round if sd is null or undefined.
+    out: if (sd != null) {
+      xd = x.d;
+
+      // Infinity/NaN.
+      if (!xd) return x;
+
+      // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.
+      // w: the word of xd containing rd, a base 1e7 number.
+      // xdi: the index of w within xd.
+      // digits: the number of digits of w.
+      // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if
+      // they had leading zeros)
+      // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).
+
+      // Get the length of the first word of the digits array xd.
+      for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;
+      i = sd - digits;
+
+      // Is the rounding digit in the first word of xd?
+      if (i < 0) {
+        i += LOG_BASE;
+        j = sd;
+        w = xd[xdi = 0];
+
+        // Get the rounding digit at index j of w.
+        rd = w / mathpow(10, digits - j - 1) % 10 | 0;
+      } else {
+        xdi = Math.ceil((i + 1) / LOG_BASE);
+        k = xd.length;
+        if (xdi >= k) {
+          if (isTruncated) {
+
+            // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.
+            for (; k++ <= xdi;) xd.push(0);
+            w = rd = 0;
+            digits = 1;
+            i %= LOG_BASE;
+            j = i - LOG_BASE + 1;
+          } else {
+            break out;
+          }
+        } else {
+          w = k = xd[xdi];
+
+          // Get the number of digits of w.
+          for (digits = 1; k >= 10; k /= 10) digits++;
+
+          // Get the index of rd within w.
+          i %= LOG_BASE;
+
+          // Get the index of rd within w, adjusted for leading zeros.
+          // The number of leading zeros of w is given by LOG_BASE - digits.
+          j = i - LOG_BASE + digits;
+
+          // Get the rounding digit at index j of w.
+          rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
+        }
+      }
+
+      // Are there any non-zero digits after the rounding digit?
+      isTruncated = isTruncated || sd < 0 ||
+        xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
+
+      // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right
+      // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression
+      // will give 714.
+
+      roundUp = rm < 4
+        ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
+        : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&
+
+          // Check whether the digit to the left of the rounding digit is odd.
+          ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||
+            rm == (x.s < 0 ? 8 : 7));
+
+      if (sd < 1 || !xd[0]) {
+        xd.length = 0;
+        if (roundUp) {
+
+          // Convert sd to decimal places.
+          sd -= x.e + 1;
+
+          // 1, 0.1, 0.01, 0.001, 0.0001 etc.
+          xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
+          x.e = -sd || 0;
+        } else {
+
+          // Zero.
+          xd[0] = x.e = 0;
+        }
+
+        return x;
+      }
+
+      // Remove excess digits.
+      if (i == 0) {
+        xd.length = xdi;
+        k = 1;
+        xdi--;
+      } else {
+        xd.length = xdi + 1;
+        k = mathpow(10, LOG_BASE - i);
+
+        // E.g. 56700 becomes 56000 if 7 is the rounding digit.
+        // j > 0 means i > number of leading zeros of w.
+        xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
+      }
+
+      if (roundUp) {
+        for (;;) {
+
+          // Is the digit to be rounded up in the first word of xd?
+          if (xdi == 0) {
+
+            // i will be the length of xd[0] before k is added.
+            for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;
+            j = xd[0] += k;
+            for (k = 1; j >= 10; j /= 10) k++;
+
+            // if i != k the length has increased.
+            if (i != k) {
+              x.e++;
+              if (xd[0] == BASE) xd[0] = 1;
+            }
+
+            break;
+          } else {
+            xd[xdi] += k;
+            if (xd[xdi] != BASE) break;
+            xd[xdi--] = 0;
+            k = 1;
+          }
+        }
+      }
+
+      // Remove trailing zeros.
+      for (i = xd.length; xd[--i] === 0;) xd.pop();
+    }
+
+    if (external) {
+
+      // Overflow?
+      if (x.e > Ctor.maxE) {
+
+        // Infinity.
+        x.d = null;
+        x.e = NaN;
+
+      // Underflow?
+      } else if (x.e < Ctor.minE) {
+
+        // Zero.
+        x.e = 0;
+        x.d = [0];
+        // Ctor.underflow = true;
+      } // else Ctor.underflow = false;
+    }
+
+    return x;
+  }
+
+
+  function finiteToString(x, isExp, sd) {
+    if (!x.isFinite()) return nonFiniteToString(x);
+    var k,
+      e = x.e,
+      str = digitsToString(x.d),
+      len = str.length;
+
+    if (isExp) {
+      if (sd && (k = sd - len) > 0) {
+        str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);
+      } else if (len > 1) {
+        str = str.charAt(0) + '.' + str.slice(1);
+      }
+
+      str = str + (x.e < 0 ? 'e' : 'e+') + x.e;
+    } else if (e < 0) {
+      str = '0.' + getZeroString(-e - 1) + str;
+      if (sd && (k = sd - len) > 0) str += getZeroString(k);
+    } else if (e >= len) {
+      str += getZeroString(e + 1 - len);
+      if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);
+    } else {
+      if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);
+      if (sd && (k = sd - len) > 0) {
+        if (e + 1 === len) str += '.';
+        str += getZeroString(k);
+      }
+    }
+
+    return str;
+  }
+
+
+  // Calculate the base 10 exponent from the base 1e7 exponent.
+  function getBase10Exponent(digits, e) {
+    var w = digits[0];
+
+    // Add the number of digits of the first word of the digits array.
+    for ( e *= LOG_BASE; w >= 10; w /= 10) e++;
+    return e;
+  }
+
+
+  function getLn10(Ctor, sd, pr) {
+    if (sd > LN10_PRECISION) {
+
+      // Reset global state in case the exception is caught.
+      external = true;
+      if (pr) Ctor.precision = pr;
+      throw Error(precisionLimitExceeded);
+    }
+    return finalise(new Ctor(LN10), sd, 1, true);
+  }
+
+
+  function getPi(Ctor, sd, rm) {
+    if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);
+    return finalise(new Ctor(PI), sd, rm, true);
+  }
+
+
+  function getPrecision(digits) {
+    var w = digits.length - 1,
+      len = w * LOG_BASE + 1;
+
+    w = digits[w];
+
+    // If non-zero...
+    if (w) {
+
+      // Subtract the number of trailing zeros of the last word.
+      for (; w % 10 == 0; w /= 10) len--;
+
+      // Add the number of digits of the first word.
+      for (w = digits[0]; w >= 10; w /= 10) len++;
+    }
+
+    return len;
+  }
+
+
+  function getZeroString(k) {
+    var zs = '';
+    for (; k--;) zs += '0';
+    return zs;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an
+   * integer of type number.
+   *
+   * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.
+   *
+   */
+  function intPow(Ctor, x, n, pr) {
+    var isTruncated,
+      r = new Ctor(1),
+
+      // Max n of 9007199254740991 takes 53 loop iterations.
+      // Maximum digits array length; leaves [28, 34] guard digits.
+      k = Math.ceil(pr / LOG_BASE + 4);
+
+    external = false;
+
+    for (;;) {
+      if (n % 2) {
+        r = r.times(x);
+        if (truncate(r.d, k)) isTruncated = true;
+      }
+
+      n = mathfloor(n / 2);
+      if (n === 0) {
+
+        // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.
+        n = r.d.length - 1;
+        if (isTruncated && r.d[n] === 0) ++r.d[n];
+        break;
+      }
+
+      x = x.times(x);
+      truncate(x.d, k);
+    }
+
+    external = true;
+
+    return r;
+  }
+
+
+  function isOdd(n) {
+    return n.d[n.d.length - 1] & 1;
+  }
+
+
+  /*
+   * Handle `max` (`n` is -1) and `min` (`n` is 1).
+   */
+  function maxOrMin(Ctor, args, n) {
+    var k, y,
+      x = new Ctor(args[0]),
+      i = 0;
+
+    for (; ++i < args.length;) {
+      y = new Ctor(args[i]);
+
+      // NaN?
+      if (!y.s) {
+        x = y;
+        break;
+      }
+
+      k = x.cmp(y);
+
+      if (k === n || k === 0 && x.s === n) {
+        x = y;
+      }
+    }
+
+    return x;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant
+   * digits.
+   *
+   * Taylor/Maclaurin series.
+   *
+   * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...
+   *
+   * Argument reduction:
+   *   Repeat x = x / 32, k += 5, until |x| < 0.1
+   *   exp(x) = exp(x / 2^k)^(2^k)
+   *
+   * Previously, the argument was initially reduced by
+   * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)
+   * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was
+   * found to be slower than just dividing repeatedly by 32 as above.
+   *
+   * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000
+   * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000
+   * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)
+   *
+   *  exp(Infinity)  = Infinity
+   *  exp(-Infinity) = 0
+   *  exp(NaN)       = NaN
+   *  exp(±0)        = 1
+   *
+   *  exp(x) is non-terminating for any finite, non-zero x.
+   *
+   *  The result will always be correctly rounded.
+   *
+   */
+  function naturalExponential(x, sd) {
+    var denominator, guard, j, pow, sum, t, wpr,
+      rep = 0,
+      i = 0,
+      k = 0,
+      Ctor = x.constructor,
+      rm = Ctor.rounding,
+      pr = Ctor.precision;
+
+    // 0/NaN/Infinity?
+    if (!x.d || !x.d[0] || x.e > 17) {
+
+      return new Ctor(x.d
+        ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0
+        : x.s ? x.s < 0 ? 0 : x : 0 / 0);
+    }
+
+    if (sd == null) {
+      external = false;
+      wpr = pr;
+    } else {
+      wpr = sd;
+    }
+
+    t = new Ctor(0.03125);
+
+    // while abs(x) >= 0.1
+    while (x.e > -2) {
+
+      // x = x / 2^5
+      x = x.times(t);
+      k += 5;
+    }
+
+    // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision
+    // necessary to ensure the first 4 rounding digits are correct.
+    guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
+    wpr += guard;
+    denominator = pow = sum = new Ctor(1);
+    Ctor.precision = wpr;
+
+    for (;;) {
+      pow = finalise(pow.times(x), wpr, 1);
+      denominator = denominator.times(++i);
+      t = sum.plus(divide(pow, denominator, wpr, 1));
+
+      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+        j = k;
+        while (j--) sum = finalise(sum.times(sum), wpr, 1);
+
+        // Check to see if the first 4 rounding digits are [49]999.
+        // If so, repeat the summation with a higher precision, otherwise
+        // e.g. with precision: 18, rounding: 1
+        // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)
+        // `wpr - guard` is the index of first rounding digit.
+        if (sd == null) {
+
+          if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+            Ctor.precision = wpr += 10;
+            denominator = pow = t = new Ctor(1);
+            i = 0;
+            rep++;
+          } else {
+            return finalise(sum, Ctor.precision = pr, rm, external = true);
+          }
+        } else {
+          Ctor.precision = pr;
+          return sum;
+        }
+      }
+
+      sum = t;
+    }
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant
+   * digits.
+   *
+   *  ln(-n)        = NaN
+   *  ln(0)         = -Infinity
+   *  ln(-0)        = -Infinity
+   *  ln(1)         = 0
+   *  ln(Infinity)  = Infinity
+   *  ln(-Infinity) = NaN
+   *  ln(NaN)       = NaN
+   *
+   *  ln(n) (n != 1) is non-terminating.
+   *
+   */
+  function naturalLogarithm(y, sd) {
+    var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,
+      n = 1,
+      guard = 10,
+      x = y,
+      xd = x.d,
+      Ctor = x.constructor,
+      rm = Ctor.rounding,
+      pr = Ctor.precision;
+
+    // Is x negative or Infinity, NaN, 0 or 1?
+    if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
+      return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
+    }
+
+    if (sd == null) {
+      external = false;
+      wpr = pr;
+    } else {
+      wpr = sd;
+    }
+
+    Ctor.precision = wpr += guard;
+    c = digitsToString(xd);
+    c0 = c.charAt(0);
+
+    if (Math.abs(e = x.e) < 1.5e15) {
+
+      // Argument reduction.
+      // The series converges faster the closer the argument is to 1, so using
+      // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b
+      // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,
+      // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can
+      // later be divided by this number, then separate out the power of 10 using
+      // ln(a*10^b) = ln(a) + b*ln(10).
+
+      // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).
+      //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {
+      // max n is 6 (gives 0.7 - 1.3)
+      while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
+        x = x.times(y);
+        c = digitsToString(x.d);
+        c0 = c.charAt(0);
+        n++;
+      }
+
+      e = x.e;
+
+      if (c0 > 1) {
+        x = new Ctor('0.' + c);
+        e++;
+      } else {
+        x = new Ctor(c0 + '.' + c.slice(1));
+      }
+    } else {
+
+      // The argument reduction method above may result in overflow if the argument y is a massive
+      // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this
+      // function using ln(x*10^e) = ln(x) + e*ln(10).
+      t = getLn10(Ctor, wpr + 2, pr).times(e + '');
+      x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);
+      Ctor.precision = pr;
+
+      return sd == null ? finalise(x, pr, rm, external = true) : x;
+    }
+
+    // x1 is x reduced to a value near 1.
+    x1 = x;
+
+    // Taylor series.
+    // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)
+    // where x = (y - 1)/(y + 1)    (|x| < 1)
+    sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
+    x2 = finalise(x.times(x), wpr, 1);
+    denominator = 3;
+
+    for (;;) {
+      numerator = finalise(numerator.times(x2), wpr, 1);
+      t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));
+
+      if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+        sum = sum.times(2);
+
+        // Reverse the argument reduction. Check that e is not 0 because, besides preventing an
+        // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.
+        if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));
+        sum = divide(sum, new Ctor(n), wpr, 1);
+
+        // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has
+        // been repeated previously) and the first 4 rounding digits 9999?
+        // If so, restart the summation with a higher precision, otherwise
+        // e.g. with precision: 12, rounding: 1
+        // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.
+        // `wpr - guard` is the index of first rounding digit.
+        if (sd == null) {
+          if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+            Ctor.precision = wpr += guard;
+            t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
+            x2 = finalise(x.times(x), wpr, 1);
+            denominator = rep = 1;
+          } else {
+            return finalise(sum, Ctor.precision = pr, rm, external = true);
+          }
+        } else {
+          Ctor.precision = pr;
+          return sum;
+        }
+      }
+
+      sum = t;
+      denominator += 2;
+    }
+  }
+
+
+  // ±Infinity, NaN.
+  function nonFiniteToString(x) {
+    // Unsigned.
+    return String(x.s * x.s / 0);
+  }
+
+
+  /*
+   * Parse the value of a new Decimal `x` from string `str`.
+   */
+  function parseDecimal(x, str) {
+    var e, i, len;
+
+    // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.
+
+    // Decimal point?
+    if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+    // Exponential form?
+    if ((i = str.search(/e/i)) > 0) {
+
+      // Determine exponent.
+      if (e < 0) e = i;
+      e += +str.slice(i + 1);
+      str = str.substring(0, i);
+    } else if (e < 0) {
+
+      // Integer.
+      e = str.length;
+    }
+
+    // Determine leading zeros.
+    for (i = 0; str.charCodeAt(i) === 48; i++);
+
+    // Determine trailing zeros.
+    for (len = str.length; str.charCodeAt(len - 1) === 48; --len);
+    str = str.slice(i, len);
+
+    if (str) {
+      len -= i;
+      x.e = e = e - i - 1;
+      x.d = [];
+
+      // Transform base
+
+      // e is the base 10 exponent.
+      // i is where to slice str to get the first word of the digits array.
+      i = (e + 1) % LOG_BASE;
+      if (e < 0) i += LOG_BASE;
+
+      if (i < len) {
+        if (i) x.d.push(+str.slice(0, i));
+        for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));
+        str = str.slice(i);
+        i = LOG_BASE - str.length;
+      } else {
+        i -= len;
+      }
+
+      for (; i--;) str += '0';
+      x.d.push(+str);
+
+      if (external) {
+
+        // Overflow?
+        if (x.e > x.constructor.maxE) {
+
+          // Infinity.
+          x.d = null;
+          x.e = NaN;
+
+        // Underflow?
+        } else if (x.e < x.constructor.minE) {
+
+          // Zero.
+          x.e = 0;
+          x.d = [0];
+          // x.constructor.underflow = true;
+        } // else x.constructor.underflow = false;
+      }
+    } else {
+
+      // Zero.
+      x.e = 0;
+      x.d = [0];
+    }
+
+    return x;
+  }
+
+
+  /*
+   * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.
+   */
+  function parseOther(x, str) {
+    var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
+
+    if (str.indexOf('_') > -1) {
+      str = str.replace(/(\d)_(?=\d)/g, '$1');
+      if (isDecimal.test(str)) return parseDecimal(x, str);
+    } else if (str === 'Infinity' || str === 'NaN') {
+      if (!+str) x.s = NaN;
+      x.e = NaN;
+      x.d = null;
+      return x;
+    }
+
+    if (isHex.test(str))  {
+      base = 16;
+      str = str.toLowerCase();
+    } else if (isBinary.test(str))  {
+      base = 2;
+    } else if (isOctal.test(str))  {
+      base = 8;
+    } else {
+      throw Error(invalidArgument + str);
+    }
+
+    // Is there a binary exponent part?
+    i = str.search(/p/i);
+
+    if (i > 0) {
+      p = +str.slice(i + 1);
+      str = str.substring(2, i);
+    } else {
+      str = str.slice(2);
+    }
+
+    // Convert `str` as an integer then divide the result by `base` raised to a power such that the
+    // fraction part will be restored.
+    i = str.indexOf('.');
+    isFloat = i >= 0;
+    Ctor = x.constructor;
+
+    if (isFloat) {
+      str = str.replace('.', '');
+      len = str.length;
+      i = len - i;
+
+      // log[10](16) = 1.2041... , log[10](88) = 1.9444....
+      divisor = intPow(Ctor, new Ctor(base), i, i * 2);
+    }
+
+    xd = convertBase(str, base, BASE);
+    xe = xd.length - 1;
+
+    // Remove trailing zeros.
+    for (i = xe; xd[i] === 0; --i) xd.pop();
+    if (i < 0) return new Ctor(x.s * 0);
+    x.e = getBase10Exponent(xd, xe);
+    x.d = xd;
+    external = false;
+
+    // At what precision to perform the division to ensure exact conversion?
+    // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)
+    // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412
+    // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.
+    // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount
+    // Therefore using 4 * the number of digits of str will always be enough.
+    if (isFloat) x = divide(x, divisor, len * 4);
+
+    // Multiply by the binary exponent part if present.
+    if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
+    external = true;
+
+    return x;
+  }
+
+
+  /*
+   * sin(x) = x - x^3/3! + x^5/5! - ...
+   * |x| < pi/2
+   *
+   */
+  function sine(Ctor, x) {
+    var k,
+      len = x.d.length;
+
+    if (len < 3) {
+      return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);
+    }
+
+    // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)
+    // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)
+    // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))
+
+    // Estimate the optimum number of times to use the argument reduction.
+    k = 1.4 * Math.sqrt(len);
+    k = k > 16 ? 16 : k | 0;
+
+    x = x.times(1 / tinyPow(5, k));
+    x = taylorSeries(Ctor, 2, x, x);
+
+    // Reverse argument reduction
+    var sin2_x,
+      d5 = new Ctor(5),
+      d16 = new Ctor(16),
+      d20 = new Ctor(20);
+    for (; k--;) {
+      sin2_x = x.times(x);
+      x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
+    }
+
+    return x;
+  }
+
+
+  // Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.
+  function taylorSeries(Ctor, n, x, y, isHyperbolic) {
+    var j, t, u, x2,
+      i = 1,
+      pr = Ctor.precision,
+      k = Math.ceil(pr / LOG_BASE);
+
+    external = false;
+    x2 = x.times(x);
+    u = new Ctor(y);
+
+    for (;;) {
+      t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
+      u = isHyperbolic ? y.plus(t) : y.minus(t);
+      y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
+      t = u.plus(y);
+
+      if (t.d[k] !== void 0) {
+        for (j = k; t.d[j] === u.d[j] && j--;);
+        if (j == -1) break;
+      }
+
+      j = u;
+      u = y;
+      y = t;
+      t = j;
+      i++;
+    }
+
+    external = true;
+    t.d.length = k + 1;
+
+    return t;
+  }
+
+
+  // Exponent e must be positive and non-zero.
+  function tinyPow(b, e) {
+    var n = b;
+    while (--e) n *= b;
+    return n;
+  }
+
+
+  // Return the absolute value of `x` reduced to less than or equal to half pi.
+  function toLessThanHalfPi(Ctor, x) {
+    var t,
+      isNeg = x.s < 0,
+      pi = getPi(Ctor, Ctor.precision, 1),
+      halfPi = pi.times(0.5);
+
+    x = x.abs();
+
+    if (x.lte(halfPi)) {
+      quadrant = isNeg ? 4 : 1;
+      return x;
+    }
+
+    t = x.divToInt(pi);
+
+    if (t.isZero()) {
+      quadrant = isNeg ? 3 : 2;
+    } else {
+      x = x.minus(t.times(pi));
+
+      // 0 <= x < pi
+      if (x.lte(halfPi)) {
+        quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);
+        return x;
+      }
+
+      quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);
+    }
+
+    return x.minus(pi).abs();
+  }
+
+
+  /*
+   * Return the value of Decimal `x` as a string in base `baseOut`.
+   *
+   * If the optional `sd` argument is present include a binary exponent suffix.
+   */
+  function toStringBinary(x, baseOut, sd, rm) {
+    var base, e, i, k, len, roundUp, str, xd, y,
+      Ctor = x.constructor,
+      isExp = sd !== void 0;
+
+    if (isExp) {
+      checkInt32(sd, 1, MAX_DIGITS);
+      if (rm === void 0) rm = Ctor.rounding;
+      else checkInt32(rm, 0, 8);
+    } else {
+      sd = Ctor.precision;
+      rm = Ctor.rounding;
+    }
+
+    if (!x.isFinite()) {
+      str = nonFiniteToString(x);
+    } else {
+      str = finiteToString(x);
+      i = str.indexOf('.');
+
+      // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:
+      // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))
+      // minBinaryExponent = floor(decimalExponent * log[2](10))
+      // log[2](10) = 3.321928094887362347870319429489390175864
+
+      if (isExp) {
+        base = 2;
+        if (baseOut == 16) {
+          sd = sd * 4 - 3;
+        } else if (baseOut == 8) {
+          sd = sd * 3 - 2;
+        }
+      } else {
+        base = baseOut;
+      }
+
+      // Convert the number as an integer then divide the result by its base raised to a power such
+      // that the fraction part will be restored.
+
+      // Non-integer.
+      if (i >= 0) {
+        str = str.replace('.', '');
+        y = new Ctor(1);
+        y.e = str.length - i;
+        y.d = convertBase(finiteToString(y), 10, base);
+        y.e = y.d.length;
+      }
+
+      xd = convertBase(str, 10, base);
+      e = len = xd.length;
+
+      // Remove trailing zeros.
+      for (; xd[--len] == 0;) xd.pop();
+
+      if (!xd[0]) {
+        str = isExp ? '0p+0' : '0';
+      } else {
+        if (i < 0) {
+          e--;
+        } else {
+          x = new Ctor(x);
+          x.d = xd;
+          x.e = e;
+          x = divide(x, y, sd, rm, 0, base);
+          xd = x.d;
+          e = x.e;
+          roundUp = inexact;
+        }
+
+        // The rounding digit, i.e. the digit after the digit that may be rounded up.
+        i = xd[sd];
+        k = base / 2;
+        roundUp = roundUp || xd[sd + 1] !== void 0;
+
+        roundUp = rm < 4
+          ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))
+          : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||
+            rm === (x.s < 0 ? 8 : 7));
+
+        xd.length = sd;
+
+        if (roundUp) {
+
+          // Rounding up may mean the previous digit has to be rounded up and so on.
+          for (; ++xd[--sd] > base - 1;) {
+            xd[sd] = 0;
+            if (!sd) {
+              ++e;
+              xd.unshift(1);
+            }
+          }
+        }
+
+        // Determine trailing zeros.
+        for (len = xd.length; !xd[len - 1]; --len);
+
+        // E.g. [4, 11, 15] becomes 4bf.
+        for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);
+
+        // Add binary exponent suffix?
+        if (isExp) {
+          if (len > 1) {
+            if (baseOut == 16 || baseOut == 8) {
+              i = baseOut == 16 ? 4 : 3;
+              for (--len; len % i; len++) str += '0';
+              xd = convertBase(str, base, baseOut);
+              for (len = xd.length; !xd[len - 1]; --len);
+
+              // xd[0] will always be be 1
+              for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);
+            } else {
+              str = str.charAt(0) + '.' + str.slice(1);
+            }
+          }
+
+          str =  str + (e < 0 ? 'p' : 'p+') + e;
+        } else if (e < 0) {
+          for (; ++e;) str = '0' + str;
+          str = '0.' + str;
+        } else {
+          if (++e > len) for (e -= len; e-- ;) str += '0';
+          else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);
+        }
+      }
+
+      str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;
+    }
+
+    return x.s < 0 ? '-' + str : str;
+  }
+
+
+  // Does not strip trailing zeros.
+  function truncate(arr, len) {
+    if (arr.length > len) {
+      arr.length = len;
+      return true;
+    }
+  }
+
+
+  // Decimal methods
+
+
+  /*
+   *  abs
+   *  acos
+   *  acosh
+   *  add
+   *  asin
+   *  asinh
+   *  atan
+   *  atanh
+   *  atan2
+   *  cbrt
+   *  ceil
+   *  clamp
+   *  clone
+   *  config
+   *  cos
+   *  cosh
+   *  div
+   *  exp
+   *  floor
+   *  hypot
+   *  ln
+   *  log
+   *  log2
+   *  log10
+   *  max
+   *  min
+   *  mod
+   *  mul
+   *  pow
+   *  random
+   *  round
+   *  set
+   *  sign
+   *  sin
+   *  sinh
+   *  sqrt
+   *  sub
+   *  sum
+   *  tan
+   *  tanh
+   *  trunc
+   */
+
+
+  /*
+   * Return a new Decimal whose value is the absolute value of `x`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function abs(x) {
+    return new this(x).abs();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arccosine in radians of `x`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function acos(x) {
+    return new this(x).acos();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function acosh(x) {
+    return new this(x).acosh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   * y {number|string|bigint|Decimal}
+   *
+   */
+  function add(x, y) {
+    return new this(x).plus(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function asin(x) {
+    return new this(x).asin();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function asinh(x) {
+    return new this(x).asinh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function atan(x) {
+    return new this(x).atan();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to
+   * `precision` significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function atanh(x) {
+    return new this(x).atanh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi
+   * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * Domain: [-Infinity, Infinity]
+   * Range: [-pi, pi]
+   *
+   * y {number|string|bigint|Decimal} The y-coordinate.
+   * x {number|string|bigint|Decimal} The x-coordinate.
+   *
+   * atan2(±0, -0)               = ±pi
+   * atan2(±0, +0)               = ±0
+   * atan2(±0, -x)               = ±pi for x > 0
+   * atan2(±0, x)                = ±0 for x > 0
+   * atan2(-y, ±0)               = -pi/2 for y > 0
+   * atan2(y, ±0)                = pi/2 for y > 0
+   * atan2(±y, -Infinity)        = ±pi for finite y > 0
+   * atan2(±y, +Infinity)        = ±0 for finite y > 0
+   * atan2(±Infinity, x)         = ±pi/2 for finite x
+   * atan2(±Infinity, -Infinity) = ±3*pi/4
+   * atan2(±Infinity, +Infinity) = ±pi/4
+   * atan2(NaN, x) = NaN
+   * atan2(y, NaN) = NaN
+   *
+   */
+  function atan2(y, x) {
+    y = new this(y);
+    x = new this(x);
+    var r,
+      pr = this.precision,
+      rm = this.rounding,
+      wpr = pr + 4;
+
+    // Either NaN
+    if (!y.s || !x.s) {
+      r = new this(NaN);
+
+    // Both ±Infinity
+    } else if (!y.d && !x.d) {
+      r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
+      r.s = y.s;
+
+    // x is ±Infinity or y is ±0
+    } else if (!x.d || y.isZero()) {
+      r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
+      r.s = y.s;
+
+    // y is ±Infinity or x is ±0
+    } else if (!y.d || x.isZero()) {
+      r = getPi(this, wpr, 1).times(0.5);
+      r.s = y.s;
+
+    // Both non-zero and finite
+    } else if (x.s < 0) {
+      this.precision = wpr;
+      this.rounding = 1;
+      r = this.atan(divide(y, x, wpr, 1));
+      x = getPi(this, wpr, 1);
+      this.precision = pr;
+      this.rounding = rm;
+      r = y.s < 0 ? r.minus(x) : r.plus(x);
+    } else {
+      r = this.atan(divide(y, x, wpr, 1));
+    }
+
+    return r;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function cbrt(x) {
+    return new this(x).cbrt();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function ceil(x) {
+    return finalise(x = new this(x), x.e + 1, 2);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.
+   *
+   * x {number|string|bigint|Decimal}
+   * min {number|string|bigint|Decimal}
+   * max {number|string|bigint|Decimal}
+   *
+   */
+  function clamp(x, min, max) {
+    return new this(x).clamp(min, max);
+  }
+
+
+  /*
+   * Configure global settings for a Decimal constructor.
+   *
+   * `obj` is an object with one or more of the following properties,
+   *
+   *   precision  {number}
+   *   rounding   {number}
+   *   toExpNeg   {number}
+   *   toExpPos   {number}
+   *   maxE       {number}
+   *   minE       {number}
+   *   modulo     {number}
+   *   crypto     {boolean|number}
+   *   defaults   {true}
+   *
+   * E.g. Decimal.config({ precision: 20, rounding: 4 })
+   *
+   */
+  function config(obj) {
+    if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');
+    var i, p, v,
+      useDefaults = obj.defaults === true,
+      ps = [
+        'precision', 1, MAX_DIGITS,
+        'rounding', 0, 8,
+        'toExpNeg', -EXP_LIMIT, 0,
+        'toExpPos', 0, EXP_LIMIT,
+        'maxE', 0, EXP_LIMIT,
+        'minE', -EXP_LIMIT, 0,
+        'modulo', 0, 9
+      ];
+
+    for (i = 0; i < ps.length; i += 3) {
+      if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];
+      if ((v = obj[p]) !== void 0) {
+        if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;
+        else throw Error(invalidArgument + p + ': ' + v);
+      }
+    }
+
+    if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];
+    if ((v = obj[p]) !== void 0) {
+      if (v === true || v === false || v === 0 || v === 1) {
+        if (v) {
+          if (typeof crypto != 'undefined' && crypto &&
+            (crypto.getRandomValues || crypto.randomBytes)) {
+            this[p] = true;
+          } else {
+            throw Error(cryptoUnavailable);
+          }
+        } else {
+          this[p] = false;
+        }
+      } else {
+        throw Error(invalidArgument + p + ': ' + v);
+      }
+    }
+
+    return this;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function cos(x) {
+    return new this(x).cos();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function cosh(x) {
+    return new this(x).cosh();
+  }
+
+
+  /*
+   * Create and return a Decimal constructor with the same configuration properties as this Decimal
+   * constructor.
+   *
+   */
+  function clone(obj) {
+    var i, p, ps;
+
+    /*
+     * The Decimal constructor and exported function.
+     * Return a new Decimal instance.
+     *
+     * v {number|string|bigint|Decimal} A numeric value.
+     *
+     */
+    function Decimal(v) {
+      var e, i, t,
+        x = this;
+
+      // Decimal called without new.
+      if (!(x instanceof Decimal)) return new Decimal(v);
+
+      // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor
+      // which points to Object.
+      x.constructor = Decimal;
+
+      if (isDecimalInstance(v)) {
+        x.s = v.s;
+
+        if (external) {
+          if (!v.d || v.e > Decimal.maxE) {
+
+            // Infinity.
+            x.e = NaN;
+            x.d = null;
+          } else if (v.e < Decimal.minE) {
+
+            // Zero.
+            x.e = 0;
+            x.d = [0];
+          } else {
+            x.e = v.e;
+            x.d = v.d.slice();
+          }
+        } else {
+          x.e = v.e;
+          x.d = v.d ? v.d.slice() : v.d;
+        }
+
+        return;
+      }
+
+      t = typeof v;
+
+      if (t === 'number') {
+        if (v === 0) {
+          x.s = 1 / v < 0 ? -1 : 1;
+          x.e = 0;
+          x.d = [0];
+          return;
+        }
+
+        if (v < 0) {
+          v = -v;
+          x.s = -1;
+        } else {
+          x.s = 1;
+        }
+
+        // Fast path for small integers.
+        if (v === ~~v && v < 1e7) {
+          for (e = 0, i = v; i >= 10; i /= 10) e++;
+
+          if (external) {
+            if (e > Decimal.maxE) {
+              x.e = NaN;
+              x.d = null;
+            } else if (e < Decimal.minE) {
+              x.e = 0;
+              x.d = [0];
+            } else {
+              x.e = e;
+              x.d = [v];
+            }
+          } else {
+            x.e = e;
+            x.d = [v];
+          }
+
+          return;
+        }
+
+        // Infinity or NaN?
+        if (v * 0 !== 0) {
+          if (!v) x.s = NaN;
+          x.e = NaN;
+          x.d = null;
+          return;
+        }
+
+        return parseDecimal(x, v.toString());
+      }
+
+      if (t === 'string') {
+        if ((i = v.charCodeAt(0)) === 45) {  // minus sign
+          v = v.slice(1);
+          x.s = -1;
+        } else {
+          if (i === 43) v = v.slice(1);  // plus sign
+          x.s = 1;
+        }
+
+        return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
+      }
+
+      if (t === 'bigint') {
+        if (v < 0) {
+          v = -v;
+          x.s = -1;
+        } else {
+          x.s = 1;
+        }
+
+        return parseDecimal(x, v.toString());
+      }
+
+      throw Error(invalidArgument + v);
+    }
+
+    Decimal.prototype = P;
+
+    Decimal.ROUND_UP = 0;
+    Decimal.ROUND_DOWN = 1;
+    Decimal.ROUND_CEIL = 2;
+    Decimal.ROUND_FLOOR = 3;
+    Decimal.ROUND_HALF_UP = 4;
+    Decimal.ROUND_HALF_DOWN = 5;
+    Decimal.ROUND_HALF_EVEN = 6;
+    Decimal.ROUND_HALF_CEIL = 7;
+    Decimal.ROUND_HALF_FLOOR = 8;
+    Decimal.EUCLID = 9;
+
+    Decimal.config = Decimal.set = config;
+    Decimal.clone = clone;
+    Decimal.isDecimal = isDecimalInstance;
+
+    Decimal.abs = abs;
+    Decimal.acos = acos;
+    Decimal.acosh = acosh;        // ES6
+    Decimal.add = add;
+    Decimal.asin = asin;
+    Decimal.asinh = asinh;        // ES6
+    Decimal.atan = atan;
+    Decimal.atanh = atanh;        // ES6
+    Decimal.atan2 = atan2;
+    Decimal.cbrt = cbrt;          // ES6
+    Decimal.ceil = ceil;
+    Decimal.clamp = clamp;
+    Decimal.cos = cos;
+    Decimal.cosh = cosh;          // ES6
+    Decimal.div = div;
+    Decimal.exp = exp;
+    Decimal.floor = floor;
+    Decimal.hypot = hypot;        // ES6
+    Decimal.ln = ln;
+    Decimal.log = log;
+    Decimal.log10 = log10;        // ES6
+    Decimal.log2 = log2;          // ES6
+    Decimal.max = max;
+    Decimal.min = min;
+    Decimal.mod = mod;
+    Decimal.mul = mul;
+    Decimal.pow = pow;
+    Decimal.random = random;
+    Decimal.round = round;
+    Decimal.sign = sign;          // ES6
+    Decimal.sin = sin;
+    Decimal.sinh = sinh;          // ES6
+    Decimal.sqrt = sqrt;
+    Decimal.sub = sub;
+    Decimal.sum = sum;
+    Decimal.tan = tan;
+    Decimal.tanh = tanh;          // ES6
+    Decimal.trunc = trunc;        // ES6
+
+    if (obj === void 0) obj = {};
+    if (obj) {
+      if (obj.defaults !== true) {
+        ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];
+        for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];
+      }
+    }
+
+    Decimal.config(obj);
+
+    return Decimal;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   * y {number|string|bigint|Decimal}
+   *
+   */
+  function div(x, y) {
+    return new this(x).div(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} The power to which to raise the base of the natural log.
+   *
+   */
+  function exp(x) {
+    return new this(x).exp();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function floor(x) {
+    return finalise(x = new this(x), x.e + 1, 3);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,
+   * rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+   */
+  function hypot() {
+    var i, n,
+      t = new this(0);
+
+    external = false;
+
+    for (i = 0; i < arguments.length;) {
+      n = new this(arguments[i++]);
+      if (!n.d) {
+        if (n.s) {
+          external = true;
+          return new this(1 / 0);
+        }
+        t = n;
+      } else if (t.d) {
+        t = t.plus(n.times(n));
+      }
+    }
+
+    external = true;
+
+    return t.sqrt();
+  }
+
+
+  /*
+   * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),
+   * otherwise return false.
+   *
+   */
+  function isDecimalInstance(obj) {
+    return obj instanceof Decimal || obj && obj.toStringTag === tag || false;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function ln(x) {
+    return new this(x).ln();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base
+   * is specified, rounded to `precision` significant digits using rounding mode `rounding`.
+   *
+   * log[y](x)
+   *
+   * x {number|string|bigint|Decimal} The argument of the logarithm.
+   * y {number|string|bigint|Decimal} The base of the logarithm.
+   *
+   */
+  function log(x, y) {
+    return new this(x).log(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function log2(x) {
+    return new this(x).log(2);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function log10(x) {
+    return new this(x).log(10);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the maximum of the arguments.
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+   */
+  function max() {
+    return maxOrMin(this, arguments, -1);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the minimum of the arguments.
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+   */
+  function min() {
+    return maxOrMin(this, arguments, 1);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   * y {number|string|bigint|Decimal}
+   *
+   */
+  function mod(x, y) {
+    return new this(x).mod(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   * y {number|string|bigint|Decimal}
+   *
+   */
+  function mul(x, y) {
+    return new this(x).mul(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} The base.
+   * y {number|string|bigint|Decimal} The exponent.
+   *
+   */
+  function pow(x, y) {
+    return new this(x).pow(y);
+  }
+
+
+  /*
+   * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with
+   * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros
+   * are produced).
+   *
+   * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.
+   *
+   */
+  function random(sd) {
+    var d, e, k, n,
+      i = 0,
+      r = new this(1),
+      rd = [];
+
+    if (sd === void 0) sd = this.precision;
+    else checkInt32(sd, 1, MAX_DIGITS);
+
+    k = Math.ceil(sd / LOG_BASE);
+
+    if (!this.crypto) {
+      for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;
+
+    // Browsers supporting crypto.getRandomValues.
+    } else if (crypto.getRandomValues) {
+      d = crypto.getRandomValues(new Uint32Array(k));
+
+      for (; i < k;) {
+        n = d[i];
+
+        // 0 <= n < 4294967296
+        // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).
+        if (n >= 4.29e9) {
+          d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
+        } else {
+
+          // 0 <= n <= 4289999999
+          // 0 <= (n % 1e7) <= 9999999
+          rd[i++] = n % 1e7;
+        }
+      }
+
+    // Node.js supporting crypto.randomBytes.
+    } else if (crypto.randomBytes) {
+
+      // buffer
+      d = crypto.randomBytes(k *= 4);
+
+      for (; i < k;) {
+
+        // 0 <= n < 2147483648
+        n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);
+
+        // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).
+        if (n >= 2.14e9) {
+          crypto.randomBytes(4).copy(d, i);
+        } else {
+
+          // 0 <= n <= 2139999999
+          // 0 <= (n % 1e7) <= 9999999
+          rd.push(n % 1e7);
+          i += 4;
+        }
+      }
+
+      i = k / 4;
+    } else {
+      throw Error(cryptoUnavailable);
+    }
+
+    k = rd[--i];
+    sd %= LOG_BASE;
+
+    // Convert trailing digits to zeros according to sd.
+    if (k && sd) {
+      n = mathpow(10, LOG_BASE - sd);
+      rd[i] = (k / n | 0) * n;
+    }
+
+    // Remove trailing words which are zero.
+    for (; rd[i] === 0; i--) rd.pop();
+
+    // Zero?
+    if (i < 0) {
+      e = 0;
+      rd = [0];
+    } else {
+      e = -1;
+
+      // Remove leading words which are zero and adjust exponent accordingly.
+      for (; rd[0] === 0; e -= LOG_BASE) rd.shift();
+
+      // Count the digits of the first word of rd to determine leading zeros.
+      for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;
+
+      // Adjust the exponent for leading zeros of the first word of rd.
+      if (k < LOG_BASE) e -= LOG_BASE - k;
+    }
+
+    r.e = e;
+    r.d = rd;
+
+    return r;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.
+   *
+   * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function round(x) {
+    return finalise(x = new this(x), x.e + 1, this.rounding);
+  }
+
+
+  /*
+   * Return
+   *   1    if x > 0,
+   *  -1    if x < 0,
+   *   0    if x is 0,
+   *  -0    if x is -0,
+   *   NaN  otherwise
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function sign(x) {
+    x = new this(x);
+    return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function sin(x) {
+    return new this(x).sin();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function sinh(x) {
+    return new this(x).sinh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function sqrt(x) {
+    return new this(x).sqrt();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits
+   * using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal}
+   * y {number|string|bigint|Decimal}
+   *
+   */
+  function sub(x, y) {
+    return new this(x).sub(y);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * Only the result is rounded, not the intermediate calculations.
+   *
+   * arguments {number|string|bigint|Decimal}
+   *
+   */
+  function sum() {
+    var i = 0,
+      args = arguments,
+      x = new this(args[i]);
+
+    external = false;
+    for (; x.s && ++i < args.length;) x = x.plus(args[i]);
+    external = true;
+
+    return finalise(x, this.precision, this.rounding);
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant
+   * digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function tan(x) {
+    return new this(x).tan();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`
+   * significant digits using rounding mode `rounding`.
+   *
+   * x {number|string|bigint|Decimal} A value in radians.
+   *
+   */
+  function tanh(x) {
+    return new this(x).tanh();
+  }
+
+
+  /*
+   * Return a new Decimal whose value is `x` truncated to an integer.
+   *
+   * x {number|string|bigint|Decimal}
+   *
+   */
+  function trunc(x) {
+    return finalise(x = new this(x), x.e + 1, 1);
+  }
+
+
+  // Create and configure initial Decimal constructor.
+  Decimal = clone(DEFAULTS);
+  Decimal.prototype.constructor = Decimal;
+  Decimal['default'] = Decimal.Decimal = Decimal;
+
+  // Create the internal constants from their string values.
+  LN10 = new Decimal(LN10);
+  PI = new Decimal(PI);
+
+
+  // Export.
+
+
+  // AMD.
+  if (typeof define == 'function' && define.amd) {
+    define(function () {
+      return Decimal;
+    });
+
+  // Node and other environments that support module.exports.
+  } else if (typeof module != 'undefined' && module.exports) {
+    if (typeof Symbol == 'function' && typeof Symbol.iterator == 'symbol') {
+      P[Symbol['for']('nodejs.util.inspect.custom')] = P.toString;
+      P[Symbol.toStringTag] = 'Decimal';
+    }
+
+    module.exports = Decimal;
+
+  // Browser.
+  } else {
+    if (!globalScope) {
+      globalScope = typeof self != 'undefined' && self && self.self == self ? self : window;
+    }
+
+    noConflict = globalScope.Decimal;
+    Decimal.noConflict = function () {
+      globalScope.Decimal = noConflict;
+      return Decimal;
+    };
+
+    globalScope.Decimal = Decimal;
+  }
+})(this);
diff --git a/node_modules/decimal.js/decimal.mjs b/node_modules/decimal.js/decimal.mjs
new file mode 100644
index 0000000..71ed02e
--- /dev/null
+++ b/node_modules/decimal.js/decimal.mjs
@@ -0,0 +1,4914 @@
+/*!
+ *  decimal.js v10.6.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+
+
+// -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //
+
+
+  // The maximum exponent magnitude.
+  // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.
+var EXP_LIMIT = 9e15,                      // 0 to 9e15
+
+  // The limit on the value of `precision`, and on the value of the first argument to
+  // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.
+  MAX_DIGITS = 1e9,                        // 0 to 1e9
+
+  // Base conversion alphabet.
+  NUMERALS = '0123456789abcdef',
+
+  // The natural logarithm of 10 (1025 digits).
+  LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',
+
+  // Pi (1025 digits).
+  PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',
+
+
+  // The initial configuration properties of the Decimal constructor.
+  DEFAULTS = {
+
+    // These values must be integers within the stated ranges (inclusive).
+    // Most of these values can be changed at run-time using the `Decimal.config` method.
+
+    // The maximum number of significant digits of the result of a calculation or base conversion.
+    // E.g. `Decimal.config({ precision: 20 });`
+    precision: 20,                         // 1 to MAX_DIGITS
+
+    // The rounding mode used when rounding to `precision`.
+    //
+    // ROUND_UP         0 Away from zero.
+    // ROUND_DOWN       1 Towards zero.
+    // ROUND_CEIL       2 Towards +Infinity.
+    // ROUND_FLOOR      3 Towards -Infinity.
+    // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.
+    // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.
+    // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.
+    // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.
+    // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
+    //
+    // E.g.
+    // `Decimal.rounding = 4;`
+    // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
+    rounding: 4,                           // 0 to 8
+
+    // The modulo mode used when calculating the modulus: a mod n.
+    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
+    // The remainder (r) is calculated as: r = a - n * q.
+    //
+    // UP         0 The remainder is positive if the dividend is negative, else is negative.
+    // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).
+    // FLOOR      3 The remainder has the same sign as the divisor (Python %).
+    // HALF_EVEN  6 The IEEE 754 remainder function.
+    // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
+    //
+    // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
+    // division (9) are commonly used for the modulus operation. The other rounding modes can also
+    // be used, but they may not give useful results.
+    modulo: 1,                             // 0 to 9
+
+    // The exponent value at and beneath which `toString` returns exponential notation.
+    // JavaScript numbers: -7
+    toExpNeg: -7,                          // 0 to -EXP_LIMIT
+
+    // The exponent value at and above which `toString` returns exponential notation.
+    // JavaScript numbers: 21
+    toExpPos:  21,                         // 0 to EXP_LIMIT
+
+    // The minimum exponent value, beneath which underflow to zero occurs.
+    // JavaScript numbers: -324  (5e-324)
+    minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT
+
+    // The maximum exponent value, above which overflow to Infinity occurs.
+    // JavaScript numbers: 308  (1.7976931348623157e+308)
+    maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT
+
+    // Whether to use cryptographically-secure random number generation, if available.
+    crypto: false                          // true/false
+  },
+
+
+// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //
+
+
+  inexact, quadrant,
+  external = true,
+
+  decimalError = '[DecimalError] ',
+  invalidArgument = decimalError + 'Invalid argument: ',
+  precisionLimitExceeded = decimalError + 'Precision limit exceeded',
+  cryptoUnavailable = decimalError + 'crypto unavailable',
+  tag = '[object Decimal]',
+
+  mathfloor = Math.floor,
+  mathpow = Math.pow,
+
+  isBinary = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,
+  isHex = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,
+  isOctal = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,
+  isDecimal = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
+
+  BASE = 1e7,
+  LOG_BASE = 7,
+  MAX_SAFE_INTEGER = 9007199254740991,
+
+  LN10_PRECISION = LN10.length - 1,
+  PI_PRECISION = PI.length - 1,
+
+  // Decimal.prototype object
+  P = { toStringTag: tag };
+
+
+// Decimal prototype methods
+
+
+/*
+ *  absoluteValue             abs
+ *  ceil
+ *  clampedTo                 clamp
+ *  comparedTo                cmp
+ *  cosine                    cos
+ *  cubeRoot                  cbrt
+ *  decimalPlaces             dp
+ *  dividedBy                 div
+ *  dividedToIntegerBy        divToInt
+ *  equals                    eq
+ *  floor
+ *  greaterThan               gt
+ *  greaterThanOrEqualTo      gte
+ *  hyperbolicCosine          cosh
+ *  hyperbolicSine            sinh
+ *  hyperbolicTangent         tanh
+ *  inverseCosine             acos
+ *  inverseHyperbolicCosine   acosh
+ *  inverseHyperbolicSine     asinh
+ *  inverseHyperbolicTangent  atanh
+ *  inverseSine               asin
+ *  inverseTangent            atan
+ *  isFinite
+ *  isInteger                 isInt
+ *  isNaN
+ *  isNegative                isNeg
+ *  isPositive                isPos
+ *  isZero
+ *  lessThan                  lt
+ *  lessThanOrEqualTo         lte
+ *  logarithm                 log
+ *  [maximum]                 [max]
+ *  [minimum]                 [min]
+ *  minus                     sub
+ *  modulo                    mod
+ *  naturalExponential        exp
+ *  naturalLogarithm          ln
+ *  negated                   neg
+ *  plus                      add
+ *  precision                 sd
+ *  round
+ *  sine                      sin
+ *  squareRoot                sqrt
+ *  tangent                   tan
+ *  times                     mul
+ *  toBinary
+ *  toDecimalPlaces           toDP
+ *  toExponential
+ *  toFixed
+ *  toFraction
+ *  toHexadecimal             toHex
+ *  toNearest
+ *  toNumber
+ *  toOctal
+ *  toPower                   pow
+ *  toPrecision
+ *  toSignificantDigits       toSD
+ *  toString
+ *  truncated                 trunc
+ *  valueOf                   toJSON
+ */
+
+
+/*
+ * Return a new Decimal whose value is the absolute value of this Decimal.
+ *
+ */
+P.absoluteValue = P.abs = function () {
+  var x = new this.constructor(this);
+  if (x.s < 0) x.s = 1;
+  return finalise(x);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+ * direction of positive Infinity.
+ *
+ */
+P.ceil = function () {
+  return finalise(new this.constructor(this), this.e + 1, 2);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal clamped to the range
+ * delineated by `min` and `max`.
+ *
+ * min {number|string|bigint|Decimal}
+ * max {number|string|bigint|Decimal}
+ *
+ */
+P.clampedTo = P.clamp = function (min, max) {
+  var k,
+    x = this,
+    Ctor = x.constructor;
+  min = new Ctor(min);
+  max = new Ctor(max);
+  if (!min.s || !max.s) return new Ctor(NaN);
+  if (min.gt(max)) throw Error(invalidArgument + max);
+  k = x.cmp(min);
+  return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);
+};
+
+
+/*
+ * Return
+ *   1    if the value of this Decimal is greater than the value of `y`,
+ *  -1    if the value of this Decimal is less than the value of `y`,
+ *   0    if they have the same value,
+ *   NaN  if the value of either Decimal is NaN.
+ *
+ */
+P.comparedTo = P.cmp = function (y) {
+  var i, j, xdL, ydL,
+    x = this,
+    xd = x.d,
+    yd = (y = new x.constructor(y)).d,
+    xs = x.s,
+    ys = y.s;
+
+  // Either NaN or ±Infinity?
+  if (!xd || !yd) {
+    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;
+  }
+
+  // Either zero?
+  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;
+
+  // Signs differ?
+  if (xs !== ys) return xs;
+
+  // Compare exponents.
+  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;
+
+  xdL = xd.length;
+  ydL = yd.length;
+
+  // Compare digit by digit.
+  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {
+    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;
+  }
+
+  // Compare lengths.
+  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;
+};
+
+
+/*
+ * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * cos(0)         = 1
+ * cos(-0)        = 1
+ * cos(Infinity)  = NaN
+ * cos(-Infinity) = NaN
+ * cos(NaN)       = NaN
+ *
+ */
+P.cosine = P.cos = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.d) return new Ctor(NaN);
+
+  // cos(0) = cos(-0) = 1
+  if (!x.d[0]) return new Ctor(1);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+  Ctor.rounding = 1;
+
+  x = cosine(Ctor, toLessThanHalfPi(Ctor, x));
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ *
+ * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ *  cbrt(0)  =  0
+ *  cbrt(-0) = -0
+ *  cbrt(1)  =  1
+ *  cbrt(-1) = -1
+ *  cbrt(N)  =  N
+ *  cbrt(-I) = -I
+ *  cbrt(I)  =  I
+ *
+ * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))
+ *
+ */
+P.cubeRoot = P.cbrt = function () {
+  var e, m, n, r, rep, s, sd, t, t3, t3plusx,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+  external = false;
+
+  // Initial estimate.
+  s = x.s * mathpow(x.s * x, 1 / 3);
+
+   // Math.cbrt underflow/overflow?
+   // Pass x to Math.pow as integer, then adjust the exponent of the result.
+  if (!s || Math.abs(s) == 1 / 0) {
+    n = digitsToString(x.d);
+    e = x.e;
+
+    // Adjust n exponent so it is a multiple of 3 away from x exponent.
+    if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');
+    s = mathpow(n, 1 / 3);
+
+    // Rarely, e may be one less than the result exponent value.
+    e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));
+
+    if (s == 1 / 0) {
+      n = '5e' + e;
+    } else {
+      n = s.toExponential();
+      n = n.slice(0, n.indexOf('e') + 1) + e;
+    }
+
+    r = new Ctor(n);
+    r.s = x.s;
+  } else {
+    r = new Ctor(s.toString());
+  }
+
+  sd = (e = Ctor.precision) + 3;
+
+  // Halley's method.
+  // TODO? Compare Newton's method.
+  for (;;) {
+    t = r;
+    t3 = t.times(t).times(t);
+    t3plusx = t3.plus(x);
+    r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);
+
+    // TODO? Replace with for-loop and checkRoundingDigits.
+    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+      n = n.slice(sd - 3, sd + 1);
+
+      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999
+      // , i.e. approaching a rounding boundary, continue the iteration.
+      if (n == '9999' || !rep && n == '4999') {
+
+        // On the first iteration only, check to see if rounding up gives the exact result as the
+        // nines may infinitely repeat.
+        if (!rep) {
+          finalise(t, e + 1, 0);
+
+          if (t.times(t).times(t).eq(x)) {
+            r = t;
+            break;
+          }
+        }
+
+        sd += 4;
+        rep = 1;
+      } else {
+
+        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+        // If not, then there are further digits and m will be truthy.
+        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+          // Truncate to the first rounding digit.
+          finalise(r, e + 1, 1);
+          m = !r.times(r).times(r).eq(x);
+        }
+
+        break;
+      }
+    }
+  }
+
+  external = true;
+
+  return finalise(r, e, Ctor.rounding, m);
+};
+
+
+/*
+ * Return the number of decimal places of the value of this Decimal.
+ *
+ */
+P.decimalPlaces = P.dp = function () {
+  var w,
+    d = this.d,
+    n = NaN;
+
+  if (d) {
+    w = d.length - 1;
+    n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;
+
+    // Subtract the number of trailing zeros of the last word.
+    w = d[w];
+    if (w) for (; w % 10 == 0; w /= 10) n--;
+    if (n < 0) n = 0;
+  }
+
+  return n;
+};
+
+
+/*
+ *  n / 0 = I
+ *  n / N = N
+ *  n / I = 0
+ *  0 / n = 0
+ *  0 / 0 = N
+ *  0 / N = N
+ *  0 / I = 0
+ *  N / n = N
+ *  N / 0 = N
+ *  N / N = N
+ *  N / I = N
+ *  I / n = I
+ *  I / 0 = I
+ *  I / N = N
+ *  I / I = N
+ *
+ * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.dividedBy = P.div = function (y) {
+  return divide(this, new this.constructor(y));
+};
+
+
+/*
+ * Return a new Decimal whose value is the integer part of dividing the value of this Decimal
+ * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.dividedToIntegerBy = P.divToInt = function (y) {
+  var x = this,
+    Ctor = x.constructor;
+  return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);
+};
+
+
+/*
+ * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.
+ *
+ */
+P.equals = P.eq = function (y) {
+  return this.cmp(y) === 0;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the
+ * direction of negative Infinity.
+ *
+ */
+P.floor = function () {
+  return finalise(new this.constructor(this), this.e + 1, 3);
+};
+
+
+/*
+ * Return true if the value of this Decimal is greater than the value of `y`, otherwise return
+ * false.
+ *
+ */
+P.greaterThan = P.gt = function (y) {
+  return this.cmp(y) > 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is greater than or equal to the value of `y`,
+ * otherwise return false.
+ *
+ */
+P.greaterThanOrEqualTo = P.gte = function (y) {
+  var k = this.cmp(y);
+  return k == 1 || k === 0;
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [1, Infinity]
+ *
+ * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...
+ *
+ * cosh(0)         = 1
+ * cosh(-0)        = 1
+ * cosh(Infinity)  = Infinity
+ * cosh(-Infinity) = Infinity
+ * cosh(NaN)       = NaN
+ *
+ *  x        time taken (ms)   result
+ * 1000      9                 9.8503555700852349694e+433
+ * 10000     25                4.4034091128314607936e+4342
+ * 100000    171               1.4033316802130615897e+43429
+ * 1000000   3817              1.5166076984010437725e+434294
+ * 10000000  abandoned after 2 minute wait
+ *
+ * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))
+ *
+ */
+P.hyperbolicCosine = P.cosh = function () {
+  var k, n, pr, rm, len,
+    x = this,
+    Ctor = x.constructor,
+    one = new Ctor(1);
+
+  if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);
+  if (x.isZero()) return one;
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+  Ctor.rounding = 1;
+  len = x.d.length;
+
+  // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1
+  // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))
+
+  // Estimate the optimum number of times to use the argument reduction.
+  // TODO? Estimation reused from cosine() and may not be optimal here.
+  if (len < 32) {
+    k = Math.ceil(len / 3);
+    n = (1 / tinyPow(4, k)).toString();
+  } else {
+    k = 16;
+    n = '2.3283064365386962890625e-10';
+  }
+
+  x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);
+
+  // Reverse argument reduction
+  var cosh2_x,
+    i = k,
+    d8 = new Ctor(8);
+  for (; i--;) {
+    cosh2_x = x.times(x);
+    x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));
+  }
+
+  return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...
+ *
+ * sinh(0)         = 0
+ * sinh(-0)        = -0
+ * sinh(Infinity)  = Infinity
+ * sinh(-Infinity) = -Infinity
+ * sinh(NaN)       = NaN
+ *
+ * x        time taken (ms)
+ * 10       2 ms
+ * 100      5 ms
+ * 1000     14 ms
+ * 10000    82 ms
+ * 100000   886 ms            1.4033316802130615897e+43429
+ * 200000   2613 ms
+ * 300000   5407 ms
+ * 400000   8824 ms
+ * 500000   13026 ms          8.7080643612718084129e+217146
+ * 1000000  48543 ms
+ *
+ * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))
+ *
+ */
+P.hyperbolicSine = P.sinh = function () {
+  var k, pr, rm, len,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;
+  Ctor.rounding = 1;
+  len = x.d.length;
+
+  if (len < 3) {
+    x = taylorSeries(Ctor, 2, x, x, true);
+  } else {
+
+    // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))
+    // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))
+    // 3 multiplications and 1 addition
+
+    // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))
+    // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))
+    // 4 multiplications and 2 additions
+
+    // Estimate the optimum number of times to use the argument reduction.
+    k = 1.4 * Math.sqrt(len);
+    k = k > 16 ? 16 : k | 0;
+
+    x = x.times(1 / tinyPow(5, k));
+    x = taylorSeries(Ctor, 2, x, x, true);
+
+    // Reverse argument reduction
+    var sinh2_x,
+      d5 = new Ctor(5),
+      d16 = new Ctor(16),
+      d20 = new Ctor(20);
+    for (; k--;) {
+      sinh2_x = x.times(x);
+      x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));
+    }
+  }
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(x, pr, rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * tanh(x) = sinh(x) / cosh(x)
+ *
+ * tanh(0)         = 0
+ * tanh(-0)        = -0
+ * tanh(Infinity)  = 1
+ * tanh(-Infinity) = -1
+ * tanh(NaN)       = NaN
+ *
+ */
+P.hyperbolicTangent = P.tanh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(x.s);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 7;
+  Ctor.rounding = 1;
+
+  return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of
+ * this Decimal.
+ *
+ * Domain: [-1, 1]
+ * Range: [0, pi]
+ *
+ * acos(x) = pi/2 - asin(x)
+ *
+ * acos(0)       = pi/2
+ * acos(-0)      = pi/2
+ * acos(1)       = 0
+ * acos(-1)      = pi
+ * acos(1/2)     = pi/3
+ * acos(-1/2)    = 2*pi/3
+ * acos(|x| > 1) = NaN
+ * acos(NaN)     = NaN
+ *
+ */
+P.inverseCosine = P.acos = function () {
+  var x = this,
+    Ctor = x.constructor,
+    k = x.abs().cmp(1),
+    pr = Ctor.precision,
+    rm = Ctor.rounding;
+
+  if (k !== -1) {
+    return k === 0
+      // |x| is 1
+      ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)
+      // |x| > 1 or x is NaN
+      : new Ctor(NaN);
+  }
+
+  if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);
+
+  // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3
+
+  Ctor.precision = pr + 6;
+  Ctor.rounding = 1;
+
+  // See https://github.com/MikeMcl/decimal.js/pull/217
+  x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().atan();
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.times(2);
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the
+ * value of this Decimal.
+ *
+ * Domain: [1, Infinity]
+ * Range: [0, Infinity]
+ *
+ * acosh(x) = ln(x + sqrt(x^2 - 1))
+ *
+ * acosh(x < 1)     = NaN
+ * acosh(NaN)       = NaN
+ * acosh(Infinity)  = Infinity
+ * acosh(-Infinity) = NaN
+ * acosh(0)         = NaN
+ * acosh(-0)        = NaN
+ * acosh(1)         = 0
+ * acosh(-1)        = NaN
+ *
+ */
+P.inverseHyperbolicCosine = P.acosh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);
+  if (!x.isFinite()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;
+  Ctor.rounding = 1;
+  external = false;
+
+  x = x.times(x).minus(1).sqrt().plus(x);
+
+  external = true;
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.ln();
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value
+ * of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * asinh(x) = ln(x + sqrt(x^2 + 1))
+ *
+ * asinh(NaN)       = NaN
+ * asinh(Infinity)  = Infinity
+ * asinh(-Infinity) = -Infinity
+ * asinh(0)         = 0
+ * asinh(-0)        = -0
+ *
+ */
+P.inverseHyperbolicSine = P.asinh = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite() || x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;
+  Ctor.rounding = 1;
+  external = false;
+
+  x = x.times(x).plus(1).sqrt().plus(x);
+
+  external = true;
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.ln();
+};
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the
+ * value of this Decimal.
+ *
+ * Domain: [-1, 1]
+ * Range: [-Infinity, Infinity]
+ *
+ * atanh(x) = 0.5 * ln((1 + x) / (1 - x))
+ *
+ * atanh(|x| > 1)   = NaN
+ * atanh(NaN)       = NaN
+ * atanh(Infinity)  = NaN
+ * atanh(-Infinity) = NaN
+ * atanh(0)         = 0
+ * atanh(-0)        = -0
+ * atanh(1)         = Infinity
+ * atanh(-1)        = -Infinity
+ *
+ */
+P.inverseHyperbolicTangent = P.atanh = function () {
+  var pr, rm, wpr, xsd,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  xsd = x.sd();
+
+  if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);
+
+  Ctor.precision = wpr = xsd - x.e;
+
+  x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);
+
+  Ctor.precision = pr + 4;
+  Ctor.rounding = 1;
+
+  x = x.ln();
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.times(0.5);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this
+ * Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi/2, pi/2]
+ *
+ * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))
+ *
+ * asin(0)       = 0
+ * asin(-0)      = -0
+ * asin(1/2)     = pi/6
+ * asin(-1/2)    = -pi/6
+ * asin(1)       = pi/2
+ * asin(-1)      = -pi/2
+ * asin(|x| > 1) = NaN
+ * asin(NaN)     = NaN
+ *
+ * TODO? Compare performance of Taylor series.
+ *
+ */
+P.inverseSine = P.asin = function () {
+  var halfPi, k,
+    pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (x.isZero()) return new Ctor(x);
+
+  k = x.abs().cmp(1);
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  if (k !== -1) {
+
+    // |x| is 1
+    if (k === 0) {
+      halfPi = getPi(Ctor, pr + 4, rm).times(0.5);
+      halfPi.s = x.s;
+      return halfPi;
+    }
+
+    // |x| > 1 or x is NaN
+    return new Ctor(NaN);
+  }
+
+  // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6
+
+  Ctor.precision = pr + 6;
+  Ctor.rounding = 1;
+
+  x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return x.times(2);
+};
+
+
+/*
+ * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value
+ * of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi/2, pi/2]
+ *
+ * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+ *
+ * atan(0)         = 0
+ * atan(-0)        = -0
+ * atan(1)         = pi/4
+ * atan(-1)        = -pi/4
+ * atan(Infinity)  = pi/2
+ * atan(-Infinity) = -pi/2
+ * atan(NaN)       = NaN
+ *
+ */
+P.inverseTangent = P.atan = function () {
+  var i, j, k, n, px, t, r, wpr, x2,
+    x = this,
+    Ctor = x.constructor,
+    pr = Ctor.precision,
+    rm = Ctor.rounding;
+
+  if (!x.isFinite()) {
+    if (!x.s) return new Ctor(NaN);
+    if (pr + 4 <= PI_PRECISION) {
+      r = getPi(Ctor, pr + 4, rm).times(0.5);
+      r.s = x.s;
+      return r;
+    }
+  } else if (x.isZero()) {
+    return new Ctor(x);
+  } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {
+    r = getPi(Ctor, pr + 4, rm).times(0.25);
+    r.s = x.s;
+    return r;
+  }
+
+  Ctor.precision = wpr = pr + 10;
+  Ctor.rounding = 1;
+
+  // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);
+
+  // Argument reduction
+  // Ensure |x| < 0.42
+  // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))
+
+  k = Math.min(28, wpr / LOG_BASE + 2 | 0);
+
+  for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));
+
+  external = false;
+
+  j = Math.ceil(wpr / LOG_BASE);
+  n = 1;
+  x2 = x.times(x);
+  r = new Ctor(x);
+  px = x;
+
+  // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...
+  for (; i !== -1;) {
+    px = px.times(x2);
+    t = r.minus(px.div(n += 2));
+
+    px = px.times(x2);
+    r = t.plus(px.div(n += 2));
+
+    if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);
+  }
+
+  if (k) r = r.times(2 << (k - 1));
+
+  external = true;
+
+  return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);
+};
+
+
+/*
+ * Return true if the value of this Decimal is a finite number, otherwise return false.
+ *
+ */
+P.isFinite = function () {
+  return !!this.d;
+};
+
+
+/*
+ * Return true if the value of this Decimal is an integer, otherwise return false.
+ *
+ */
+P.isInteger = P.isInt = function () {
+  return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;
+};
+
+
+/*
+ * Return true if the value of this Decimal is NaN, otherwise return false.
+ *
+ */
+P.isNaN = function () {
+  return !this.s;
+};
+
+
+/*
+ * Return true if the value of this Decimal is negative, otherwise return false.
+ *
+ */
+P.isNegative = P.isNeg = function () {
+  return this.s < 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is positive, otherwise return false.
+ *
+ */
+P.isPositive = P.isPos = function () {
+  return this.s > 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is 0 or -0, otherwise return false.
+ *
+ */
+P.isZero = function () {
+  return !!this.d && this.d[0] === 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is less than `y`, otherwise return false.
+ *
+ */
+P.lessThan = P.lt = function (y) {
+  return this.cmp(y) < 0;
+};
+
+
+/*
+ * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.
+ *
+ */
+P.lessThanOrEqualTo = P.lte = function (y) {
+  return this.cmp(y) < 1;
+};
+
+
+/*
+ * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * If no base is specified, return log[10](arg).
+ *
+ * log[base](arg) = ln(arg) / ln(base)
+ *
+ * The result will always be correctly rounded if the base of the log is 10, and 'almost always'
+ * otherwise:
+ *
+ * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen
+ * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error
+ * between the result and the correctly rounded result will be one ulp (unit in the last place).
+ *
+ * log[-b](a)       = NaN
+ * log[0](a)        = NaN
+ * log[1](a)        = NaN
+ * log[NaN](a)      = NaN
+ * log[Infinity](a) = NaN
+ * log[b](0)        = -Infinity
+ * log[b](-0)       = -Infinity
+ * log[b](-a)       = NaN
+ * log[b](1)        = 0
+ * log[b](Infinity) = Infinity
+ * log[b](NaN)      = NaN
+ *
+ * [base] {number|string|bigint|Decimal} The base of the logarithm.
+ *
+ */
+P.logarithm = P.log = function (base) {
+  var isBase10, d, denominator, k, inf, num, sd, r,
+    arg = this,
+    Ctor = arg.constructor,
+    pr = Ctor.precision,
+    rm = Ctor.rounding,
+    guard = 5;
+
+  // Default base is 10.
+  if (base == null) {
+    base = new Ctor(10);
+    isBase10 = true;
+  } else {
+    base = new Ctor(base);
+    d = base.d;
+
+    // Return NaN if base is negative, or non-finite, or is 0 or 1.
+    if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);
+
+    isBase10 = base.eq(10);
+  }
+
+  d = arg.d;
+
+  // Is arg negative, non-finite, 0 or 1?
+  if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {
+    return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);
+  }
+
+  // The result will have a non-terminating decimal expansion if base is 10 and arg is not an
+  // integer power of 10.
+  if (isBase10) {
+    if (d.length > 1) {
+      inf = true;
+    } else {
+      for (k = d[0]; k % 10 === 0;) k /= 10;
+      inf = k !== 1;
+    }
+  }
+
+  external = false;
+  sd = pr + guard;
+  num = naturalLogarithm(arg, sd);
+  denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+
+  // The result will have 5 rounding digits.
+  r = divide(num, denominator, sd, 1);
+
+  // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,
+  // calculate 10 further digits.
+  //
+  // If the result is known to have an infinite decimal expansion, repeat this until it is clear
+  // that the result is above or below the boundary. Otherwise, if after calculating the 10
+  // further digits, the last 14 are nines, round up and assume the result is exact.
+  // Also assume the result is exact if the last 14 are zero.
+  //
+  // Example of a result that will be incorrectly rounded:
+  // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...
+  // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it
+  // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so
+  // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal
+  // place is still 2.6.
+  if (checkRoundingDigits(r.d, k = pr, rm)) {
+
+    do {
+      sd += 10;
+      num = naturalLogarithm(arg, sd);
+      denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);
+      r = divide(num, denominator, sd, 1);
+
+      if (!inf) {
+
+        // Check for 14 nines from the 2nd rounding digit, as the first may be 4.
+        if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {
+          r = finalise(r, pr + 1, 0);
+        }
+
+        break;
+      }
+    } while (checkRoundingDigits(r.d, k += 10, rm));
+  }
+
+  external = true;
+
+  return finalise(r, pr, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+P.max = function () {
+  Array.prototype.push.call(arguments, this);
+  return maxOrMin(this.constructor, arguments, -1);
+};
+ */
+
+
+/*
+ * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+P.min = function () {
+  Array.prototype.push.call(arguments, this);
+  return maxOrMin(this.constructor, arguments, 1);
+};
+ */
+
+
+/*
+ *  n - 0 = n
+ *  n - N = N
+ *  n - I = -I
+ *  0 - n = -n
+ *  0 - 0 = 0
+ *  0 - N = N
+ *  0 - I = -I
+ *  N - n = N
+ *  N - 0 = N
+ *  N - N = N
+ *  N - I = N
+ *  I - n = I
+ *  I - 0 = I
+ *  I - N = N
+ *  I - I = N
+ *
+ * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.minus = P.sub = function (y) {
+  var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // If either is not finite...
+  if (!x.d || !y.d) {
+
+    // Return NaN if either is NaN.
+    if (!x.s || !y.s) y = new Ctor(NaN);
+
+    // Return y negated if x is finite and y is ±Infinity.
+    else if (x.d) y.s = -y.s;
+
+    // Return x if y is finite and x is ±Infinity.
+    // Return x if both are ±Infinity with different signs.
+    // Return NaN if both are ±Infinity with the same sign.
+    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);
+
+    return y;
+  }
+
+  // If signs differ...
+  if (x.s != y.s) {
+    y.s = -y.s;
+    return x.plus(y);
+  }
+
+  xd = x.d;
+  yd = y.d;
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  // If either is zero...
+  if (!xd[0] || !yd[0]) {
+
+    // Return y negated if x is zero and y is non-zero.
+    if (yd[0]) y.s = -y.s;
+
+    // Return x if y is zero and x is non-zero.
+    else if (xd[0]) y = new Ctor(x);
+
+    // Return zero if both are zero.
+    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.
+    else return new Ctor(rm === 3 ? -0 : 0);
+
+    return external ? finalise(y, pr, rm) : y;
+  }
+
+  // x and y are finite, non-zero numbers with the same sign.
+
+  // Calculate base 1e7 exponents.
+  e = mathfloor(y.e / LOG_BASE);
+  xe = mathfloor(x.e / LOG_BASE);
+
+  xd = xd.slice();
+  k = xe - e;
+
+  // If base 1e7 exponents differ...
+  if (k) {
+    xLTy = k < 0;
+
+    if (xLTy) {
+      d = xd;
+      k = -k;
+      len = yd.length;
+    } else {
+      d = yd;
+      e = xe;
+      len = xd.length;
+    }
+
+    // Numbers with massively different exponents would result in a very high number of
+    // zeros needing to be prepended, but this can be avoided while still ensuring correct
+    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.
+    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;
+
+    if (k > i) {
+      k = i;
+      d.length = 1;
+    }
+
+    // Prepend zeros to equalise exponents.
+    d.reverse();
+    for (i = k; i--;) d.push(0);
+    d.reverse();
+
+  // Base 1e7 exponents equal.
+  } else {
+
+    // Check digits to determine which is the bigger number.
+
+    i = xd.length;
+    len = yd.length;
+    xLTy = i < len;
+    if (xLTy) len = i;
+
+    for (i = 0; i < len; i++) {
+      if (xd[i] != yd[i]) {
+        xLTy = xd[i] < yd[i];
+        break;
+      }
+    }
+
+    k = 0;
+  }
+
+  if (xLTy) {
+    d = xd;
+    xd = yd;
+    yd = d;
+    y.s = -y.s;
+  }
+
+  len = xd.length;
+
+  // Append zeros to `xd` if shorter.
+  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.
+  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;
+
+  // Subtract yd from xd.
+  for (i = yd.length; i > k;) {
+
+    if (xd[--i] < yd[i]) {
+      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;
+      --xd[j];
+      xd[i] += BASE;
+    }
+
+    xd[i] -= yd[i];
+  }
+
+  // Remove trailing zeros.
+  for (; xd[--len] === 0;) xd.pop();
+
+  // Remove leading zeros and adjust exponent accordingly.
+  for (; xd[0] === 0; xd.shift()) --e;
+
+  // Zero?
+  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);
+
+  y.d = xd;
+  y.e = getBase10Exponent(xd, e);
+
+  return external ? finalise(y, pr, rm) : y;
+};
+
+
+/*
+ *   n % 0 =  N
+ *   n % N =  N
+ *   n % I =  n
+ *   0 % n =  0
+ *  -0 % n = -0
+ *   0 % 0 =  N
+ *   0 % N =  N
+ *   0 % I =  0
+ *   N % n =  N
+ *   N % 0 =  N
+ *   N % N =  N
+ *   N % I =  N
+ *   I % n =  N
+ *   I % 0 =  N
+ *   I % N =  N
+ *   I % I =  N
+ *
+ * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * The result depends on the modulo mode.
+ *
+ */
+P.modulo = P.mod = function (y) {
+  var q,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.
+  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);
+
+  // Return x if y is ±Infinity or x is ±0.
+  if (!y.d || x.d && !x.d[0]) {
+    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);
+  }
+
+  // Prevent rounding of intermediate calculations.
+  external = false;
+
+  if (Ctor.modulo == 9) {
+
+    // Euclidian division: q = sign(y) * floor(x / abs(y))
+    // result = x - q * y    where  0 <= result < abs(y)
+    q = divide(x, y.abs(), 0, 3, 1);
+    q.s *= y.s;
+  } else {
+    q = divide(x, y, 0, Ctor.modulo, 1);
+  }
+
+  q = q.times(y);
+
+  external = true;
+
+  return x.minus(q);
+};
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of the value of this Decimal,
+ * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.naturalExponential = P.exp = function () {
+  return naturalExponential(this);
+};
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,
+ * rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ */
+P.naturalLogarithm = P.ln = function () {
+  return naturalLogarithm(this);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by
+ * -1.
+ *
+ */
+P.negated = P.neg = function () {
+  var x = new this.constructor(this);
+  x.s = -x.s;
+  return finalise(x);
+};
+
+
+/*
+ *  n + 0 = n
+ *  n + N = N
+ *  n + I = I
+ *  0 + n = n
+ *  0 + 0 = 0
+ *  0 + N = N
+ *  0 + I = I
+ *  N + n = N
+ *  N + 0 = N
+ *  N + N = N
+ *  N + I = N
+ *  I + n = I
+ *  I + 0 = I
+ *  I + N = N
+ *  I + I = I
+ *
+ * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ */
+P.plus = P.add = function (y) {
+  var carry, d, e, i, k, len, pr, rm, xd, yd,
+    x = this,
+    Ctor = x.constructor;
+
+  y = new Ctor(y);
+
+  // If either is not finite...
+  if (!x.d || !y.d) {
+
+    // Return NaN if either is NaN.
+    if (!x.s || !y.s) y = new Ctor(NaN);
+
+    // Return x if y is finite and x is ±Infinity.
+    // Return x if both are ±Infinity with the same sign.
+    // Return NaN if both are ±Infinity with different signs.
+    // Return y if x is finite and y is ±Infinity.
+    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);
+
+    return y;
+  }
+
+   // If signs differ...
+  if (x.s != y.s) {
+    y.s = -y.s;
+    return x.minus(y);
+  }
+
+  xd = x.d;
+  yd = y.d;
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  // If either is zero...
+  if (!xd[0] || !yd[0]) {
+
+    // Return x if y is zero.
+    // Return y if y is non-zero.
+    if (!yd[0]) y = new Ctor(x);
+
+    return external ? finalise(y, pr, rm) : y;
+  }
+
+  // x and y are finite, non-zero numbers with the same sign.
+
+  // Calculate base 1e7 exponents.
+  k = mathfloor(x.e / LOG_BASE);
+  e = mathfloor(y.e / LOG_BASE);
+
+  xd = xd.slice();
+  i = k - e;
+
+  // If base 1e7 exponents differ...
+  if (i) {
+
+    if (i < 0) {
+      d = xd;
+      i = -i;
+      len = yd.length;
+    } else {
+      d = yd;
+      e = k;
+      len = xd.length;
+    }
+
+    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.
+    k = Math.ceil(pr / LOG_BASE);
+    len = k > len ? k + 1 : len + 1;
+
+    if (i > len) {
+      i = len;
+      d.length = 1;
+    }
+
+    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.
+    d.reverse();
+    for (; i--;) d.push(0);
+    d.reverse();
+  }
+
+  len = xd.length;
+  i = yd.length;
+
+  // If yd is longer than xd, swap xd and yd so xd points to the longer array.
+  if (len - i < 0) {
+    i = len;
+    d = yd;
+    yd = xd;
+    xd = d;
+  }
+
+  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.
+  for (carry = 0; i;) {
+    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;
+    xd[i] %= BASE;
+  }
+
+  if (carry) {
+    xd.unshift(carry);
+    ++e;
+  }
+
+  // Remove trailing zeros.
+  // No need to check for zero, as +x + +y != 0 && -x + -y != 0
+  for (len = xd.length; xd[--len] == 0;) xd.pop();
+
+  y.d = xd;
+  y.e = getBase10Exponent(xd, e);
+
+  return external ? finalise(y, pr, rm) : y;
+};
+
+
+/*
+ * Return the number of significant digits of the value of this Decimal.
+ *
+ * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.
+ *
+ */
+P.precision = P.sd = function (z) {
+  var k,
+    x = this;
+
+  if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);
+
+  if (x.d) {
+    k = getPrecision(x.d);
+    if (z && x.e + 1 > k) k = x.e + 1;
+  } else {
+    k = NaN;
+  }
+
+  return k;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using
+ * rounding mode `rounding`.
+ *
+ */
+P.round = function () {
+  var x = this,
+    Ctor = x.constructor;
+
+  return finalise(new Ctor(x), x.e + 1, Ctor.rounding);
+};
+
+
+/*
+ * Return a new Decimal whose value is the sine of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-1, 1]
+ *
+ * sin(x) = x - x^3/3! + x^5/5! - ...
+ *
+ * sin(0)         = 0
+ * sin(-0)        = -0
+ * sin(Infinity)  = NaN
+ * sin(-Infinity) = NaN
+ * sin(NaN)       = NaN
+ *
+ */
+P.sine = P.sin = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;
+  Ctor.rounding = 1;
+
+  x = sine(Ctor, toLessThanHalfPi(Ctor, x));
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ *  sqrt(-n) =  N
+ *  sqrt(N)  =  N
+ *  sqrt(-I) =  N
+ *  sqrt(I)  =  I
+ *  sqrt(0)  =  0
+ *  sqrt(-0) = -0
+ *
+ */
+P.squareRoot = P.sqrt = function () {
+  var m, n, sd, r, rep, t,
+    x = this,
+    d = x.d,
+    e = x.e,
+    s = x.s,
+    Ctor = x.constructor;
+
+  // Negative/NaN/Infinity/zero?
+  if (s !== 1 || !d || !d[0]) {
+    return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);
+  }
+
+  external = false;
+
+  // Initial estimate.
+  s = Math.sqrt(+x);
+
+  // Math.sqrt underflow/overflow?
+  // Pass x to Math.sqrt as integer, then adjust the exponent of the result.
+  if (s == 0 || s == 1 / 0) {
+    n = digitsToString(d);
+
+    if ((n.length + e) % 2 == 0) n += '0';
+    s = Math.sqrt(n);
+    e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);
+
+    if (s == 1 / 0) {
+      n = '5e' + e;
+    } else {
+      n = s.toExponential();
+      n = n.slice(0, n.indexOf('e') + 1) + e;
+    }
+
+    r = new Ctor(n);
+  } else {
+    r = new Ctor(s.toString());
+  }
+
+  sd = (e = Ctor.precision) + 3;
+
+  // Newton-Raphson iteration.
+  for (;;) {
+    t = r;
+    r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);
+
+    // TODO? Replace with for-loop and checkRoundingDigits.
+    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {
+      n = n.slice(sd - 3, sd + 1);
+
+      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or
+      // 4999, i.e. approaching a rounding boundary, continue the iteration.
+      if (n == '9999' || !rep && n == '4999') {
+
+        // On the first iteration only, check to see if rounding up gives the exact result as the
+        // nines may infinitely repeat.
+        if (!rep) {
+          finalise(t, e + 1, 0);
+
+          if (t.times(t).eq(x)) {
+            r = t;
+            break;
+          }
+        }
+
+        sd += 4;
+        rep = 1;
+      } else {
+
+        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.
+        // If not, then there are further digits and m will be truthy.
+        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {
+
+          // Truncate to the first rounding digit.
+          finalise(r, e + 1, 1);
+          m = !r.times(r).eq(x);
+        }
+
+        break;
+      }
+    }
+  }
+
+  external = true;
+
+  return finalise(r, e, Ctor.rounding, m);
+};
+
+
+/*
+ * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-Infinity, Infinity]
+ *
+ * tan(0)         = 0
+ * tan(-0)        = -0
+ * tan(Infinity)  = NaN
+ * tan(-Infinity) = NaN
+ * tan(NaN)       = NaN
+ *
+ */
+P.tangent = P.tan = function () {
+  var pr, rm,
+    x = this,
+    Ctor = x.constructor;
+
+  if (!x.isFinite()) return new Ctor(NaN);
+  if (x.isZero()) return new Ctor(x);
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+  Ctor.precision = pr + 10;
+  Ctor.rounding = 1;
+
+  x = x.sin();
+  x.s = 1;
+  x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);
+
+  Ctor.precision = pr;
+  Ctor.rounding = rm;
+
+  return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);
+};
+
+
+/*
+ *  n * 0 = 0
+ *  n * N = N
+ *  n * I = I
+ *  0 * n = 0
+ *  0 * 0 = 0
+ *  0 * N = N
+ *  0 * I = N
+ *  N * n = N
+ *  N * 0 = N
+ *  N * N = N
+ *  N * I = N
+ *  I * n = I
+ *  I * 0 = N
+ *  I * N = N
+ *  I * I = I
+ *
+ * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ */
+P.times = P.mul = function (y) {
+  var carry, e, i, k, r, rL, t, xdL, ydL,
+    x = this,
+    Ctor = x.constructor,
+    xd = x.d,
+    yd = (y = new Ctor(y)).d;
+
+  y.s *= x.s;
+
+   // If either is NaN, ±Infinity or ±0...
+  if (!xd || !xd[0] || !yd || !yd[0]) {
+
+    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd
+
+      // Return NaN if either is NaN.
+      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.
+      ? NaN
+
+      // Return ±Infinity if either is ±Infinity.
+      // Return ±0 if either is ±0.
+      : !xd || !yd ? y.s / 0 : y.s * 0);
+  }
+
+  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);
+  xdL = xd.length;
+  ydL = yd.length;
+
+  // Ensure xd points to the longer array.
+  if (xdL < ydL) {
+    r = xd;
+    xd = yd;
+    yd = r;
+    rL = xdL;
+    xdL = ydL;
+    ydL = rL;
+  }
+
+  // Initialise the result array with zeros.
+  r = [];
+  rL = xdL + ydL;
+  for (i = rL; i--;) r.push(0);
+
+  // Multiply!
+  for (i = ydL; --i >= 0;) {
+    carry = 0;
+    for (k = xdL + i; k > i;) {
+      t = r[k] + yd[i] * xd[k - i - 1] + carry;
+      r[k--] = t % BASE | 0;
+      carry = t / BASE | 0;
+    }
+
+    r[k] = (r[k] + carry) % BASE | 0;
+  }
+
+  // Remove trailing zeros.
+  for (; !r[--rL];) r.pop();
+
+  if (carry) ++e;
+  else r.shift();
+
+  y.d = r;
+  y.e = getBase10Exponent(r, e);
+
+  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 2, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toBinary = function (sd, rm) {
+  return toStringBinary(this, 2, sd, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`
+ * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.
+ *
+ * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toDecimalPlaces = P.toDP = function (dp, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  x = new Ctor(x);
+  if (dp === void 0) return x;
+
+  checkInt32(dp, 0, MAX_DIGITS);
+
+  if (rm === void 0) rm = Ctor.rounding;
+  else checkInt32(rm, 0, 8);
+
+  return finalise(x, dp + x.e + 1, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in exponential notation rounded to
+ * `dp` fixed decimal places using rounding mode `rounding`.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toExponential = function (dp, rm) {
+  var str,
+    x = this,
+    Ctor = x.constructor;
+
+  if (dp === void 0) {
+    str = finiteToString(x, true);
+  } else {
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    x = finalise(new Ctor(x), dp + 1, rm);
+    str = finiteToString(x, true, dp + 1);
+  }
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in normal (fixed-point) notation to
+ * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is
+ * omitted.
+ *
+ * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.
+ *
+ * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.
+ * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.
+ * (-0).toFixed(3) is '0.000'.
+ * (-0.5).toFixed(0) is '-0'.
+ *
+ */
+P.toFixed = function (dp, rm) {
+  var str, y,
+    x = this,
+    Ctor = x.constructor;
+
+  if (dp === void 0) {
+    str = finiteToString(x);
+  } else {
+    checkInt32(dp, 0, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    y = finalise(new Ctor(x), dp + x.e + 1, rm);
+    str = finiteToString(y, false, dp + y.e + 1);
+  }
+
+  // To determine whether to add the minus sign look at the value before it was rounded,
+  // i.e. look at `x` rather than `y`.
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return an array representing the value of this Decimal as a simple fraction with an integer
+ * numerator and an integer denominator.
+ *
+ * The denominator will be a positive non-zero value less than or equal to the specified maximum
+ * denominator. If a maximum denominator is not specified, the denominator will be the lowest
+ * value necessary to represent the number exactly.
+ *
+ * [maxD] {number|string|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.
+ *
+ */
+P.toFraction = function (maxD) {
+  var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,
+    x = this,
+    xd = x.d,
+    Ctor = x.constructor;
+
+  if (!xd) return new Ctor(x);
+
+  n1 = d0 = new Ctor(1);
+  d1 = n0 = new Ctor(0);
+
+  d = new Ctor(d1);
+  e = d.e = getPrecision(xd) - x.e - 1;
+  k = e % LOG_BASE;
+  d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);
+
+  if (maxD == null) {
+
+    // d is 10**e, the minimum max-denominator needed.
+    maxD = e > 0 ? d : n1;
+  } else {
+    n = new Ctor(maxD);
+    if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);
+    maxD = n.gt(d) ? (e > 0 ? d : n1) : n;
+  }
+
+  external = false;
+  n = new Ctor(digitsToString(xd));
+  pr = Ctor.precision;
+  Ctor.precision = e = xd.length * LOG_BASE * 2;
+
+  for (;;)  {
+    q = divide(n, d, 0, 1, 1);
+    d2 = d0.plus(q.times(d1));
+    if (d2.cmp(maxD) == 1) break;
+    d0 = d1;
+    d1 = d2;
+    d2 = n1;
+    n1 = n0.plus(q.times(d2));
+    n0 = d2;
+    d2 = d;
+    d = n.minus(q.times(d2));
+    n = d2;
+  }
+
+  d2 = divide(maxD.minus(d0), d1, 0, 1, 1);
+  n0 = n0.plus(d2.times(n1));
+  d0 = d0.plus(d2.times(d1));
+  n0.s = n1.s = x.s;
+
+  // Determine which fraction is closer to x, n0/d0 or n1/d1?
+  r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1
+      ? [n1, d1] : [n0, d0];
+
+  Ctor.precision = pr;
+  external = true;
+
+  return r;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 16, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toHexadecimal = P.toHex = function (sd, rm) {
+  return toStringBinary(this, 16, sd, rm);
+};
+
+
+/*
+ * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding
+ * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.
+ *
+ * The return value will always have the same sign as this Decimal, unless either this Decimal
+ * or `y` is NaN, in which case the return value will be also be NaN.
+ *
+ * The return value is not affected by the value of `precision`.
+ *
+ * y {number|string|bigint|Decimal} The magnitude to round to a multiple of.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * 'toNearest() rounding mode not an integer: {rm}'
+ * 'toNearest() rounding mode out of range: {rm}'
+ *
+ */
+P.toNearest = function (y, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  x = new Ctor(x);
+
+  if (y == null) {
+
+    // If x is not finite, return x.
+    if (!x.d) return x;
+
+    y = new Ctor(1);
+    rm = Ctor.rounding;
+  } else {
+    y = new Ctor(y);
+    if (rm === void 0) {
+      rm = Ctor.rounding;
+    } else {
+      checkInt32(rm, 0, 8);
+    }
+
+    // If x is not finite, return x if y is not NaN, else NaN.
+    if (!x.d) return y.s ? x : y;
+
+    // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.
+    if (!y.d) {
+      if (y.s) y.s = x.s;
+      return y;
+    }
+  }
+
+  // If y is not zero, calculate the nearest multiple of y to x.
+  if (y.d[0]) {
+    external = false;
+    x = divide(x, y, 0, rm, 1).times(y);
+    external = true;
+    finalise(x);
+
+  // If y is zero, return zero with the sign of x.
+  } else {
+    y.s = x.s;
+    x = y;
+  }
+
+  return x;
+};
+
+
+/*
+ * Return the value of this Decimal converted to a number primitive.
+ * Zero keeps its sign.
+ *
+ */
+P.toNumber = function () {
+  return +this;
+};
+
+
+/*
+ * Return a string representing the value of this Decimal in base 8, round to `sd` significant
+ * digits using rounding mode `rm`.
+ *
+ * If the optional `sd` argument is present then return binary exponential notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toOctal = function (sd, rm) {
+  return toStringBinary(this, 8, sd, rm);
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded
+ * to `precision` significant digits using rounding mode `rounding`.
+ *
+ * ECMAScript compliant.
+ *
+ *   pow(x, NaN)                           = NaN
+ *   pow(x, ±0)                            = 1
+
+ *   pow(NaN, non-zero)                    = NaN
+ *   pow(abs(x) > 1, +Infinity)            = +Infinity
+ *   pow(abs(x) > 1, -Infinity)            = +0
+ *   pow(abs(x) == 1, ±Infinity)           = NaN
+ *   pow(abs(x) < 1, +Infinity)            = +0
+ *   pow(abs(x) < 1, -Infinity)            = +Infinity
+ *   pow(+Infinity, y > 0)                 = +Infinity
+ *   pow(+Infinity, y < 0)                 = +0
+ *   pow(-Infinity, odd integer > 0)       = -Infinity
+ *   pow(-Infinity, even integer > 0)      = +Infinity
+ *   pow(-Infinity, odd integer < 0)       = -0
+ *   pow(-Infinity, even integer < 0)      = +0
+ *   pow(+0, y > 0)                        = +0
+ *   pow(+0, y < 0)                        = +Infinity
+ *   pow(-0, odd integer > 0)              = -0
+ *   pow(-0, even integer > 0)             = +0
+ *   pow(-0, odd integer < 0)              = -Infinity
+ *   pow(-0, even integer < 0)             = +Infinity
+ *   pow(finite x < 0, finite non-integer) = NaN
+ *
+ * For non-integer or very large exponents pow(x, y) is calculated using
+ *
+ *   x^y = exp(y*ln(x))
+ *
+ * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the
+ * probability of an incorrectly rounded result
+ * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14
+ * i.e. 1 in 250,000,000,000,000
+ *
+ * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).
+ *
+ * y {number|string|bigint|Decimal} The power to which to raise this Decimal.
+ *
+ */
+P.toPower = P.pow = function (y) {
+  var e, k, pr, r, rm, s,
+    x = this,
+    Ctor = x.constructor,
+    yn = +(y = new Ctor(y));
+
+  // Either ±Infinity, NaN or ±0?
+  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));
+
+  x = new Ctor(x);
+
+  if (x.eq(1)) return x;
+
+  pr = Ctor.precision;
+  rm = Ctor.rounding;
+
+  if (y.eq(1)) return finalise(x, pr, rm);
+
+  // y exponent
+  e = mathfloor(y.e / LOG_BASE);
+
+  // If y is a small integer use the 'exponentiation by squaring' algorithm.
+  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {
+    r = intPow(Ctor, x, k, pr);
+    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);
+  }
+
+  s = x.s;
+
+  // if x is negative
+  if (s < 0) {
+
+    // if y is not an integer
+    if (e < y.d.length - 1) return new Ctor(NaN);
+
+    // Result is positive if x is negative and the last digit of integer y is even.
+    if ((y.d[e] & 1) == 0) s = 1;
+
+    // if x.eq(-1)
+    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {
+      x.s = s;
+      return x;
+    }
+  }
+
+  // Estimate result exponent.
+  // x^y = 10^e,  where e = y * log10(x)
+  // log10(x) = log10(x_significand) + x_exponent
+  // log10(x_significand) = ln(x_significand) / ln(10)
+  k = mathpow(+x, yn);
+  e = k == 0 || !isFinite(k)
+    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))
+    : new Ctor(k + '').e;
+
+  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.
+
+  // Overflow/underflow?
+  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);
+
+  external = false;
+  Ctor.rounding = x.s = 1;
+
+  // Estimate the extra guard digits needed to ensure five correct rounding digits from
+  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):
+  // new Decimal(2.32456).pow('2087987436534566.46411')
+  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815
+  k = Math.min(12, (e + '').length);
+
+  // r = x^y = exp(y*ln(x))
+  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);
+
+  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)
+  if (r.d) {
+
+    // Truncate to the required precision plus five rounding digits.
+    r = finalise(r, pr + 5, 1);
+
+    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate
+    // the result.
+    if (checkRoundingDigits(r.d, pr, rm)) {
+      e = pr + 10;
+
+      // Truncate to the increased precision plus five rounding digits.
+      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);
+
+      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).
+      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {
+        r = finalise(r, pr + 1, 0);
+      }
+    }
+  }
+
+  r.s = s;
+  external = true;
+  Ctor.rounding = rm;
+
+  return finalise(r, pr, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal rounded to `sd` significant digits
+ * using rounding mode `rounding`.
+ *
+ * Return exponential notation if `sd` is less than the number of digits necessary to represent
+ * the integer part of the value in normal notation.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ */
+P.toPrecision = function (sd, rm) {
+  var str,
+    x = this,
+    Ctor = x.constructor;
+
+  if (sd === void 0) {
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+  } else {
+    checkInt32(sd, 1, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+
+    x = finalise(new Ctor(x), sd, rm);
+    str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);
+  }
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`
+ * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if
+ * omitted.
+ *
+ * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.
+ * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.
+ *
+ * 'toSD() digits out of range: {sd}'
+ * 'toSD() digits not an integer: {sd}'
+ * 'toSD() rounding mode not an integer: {rm}'
+ * 'toSD() rounding mode out of range: {rm}'
+ *
+ */
+P.toSignificantDigits = P.toSD = function (sd, rm) {
+  var x = this,
+    Ctor = x.constructor;
+
+  if (sd === void 0) {
+    sd = Ctor.precision;
+    rm = Ctor.rounding;
+  } else {
+    checkInt32(sd, 1, MAX_DIGITS);
+
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+  }
+
+  return finalise(new Ctor(x), sd, rm);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal.
+ *
+ * Return exponential notation if this Decimal has a positive exponent equal to or greater than
+ * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.
+ *
+ */
+P.toString = function () {
+  var x = this,
+    Ctor = x.constructor,
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+  return x.isNeg() && !x.isZero() ? '-' + str : str;
+};
+
+
+/*
+ * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.
+ *
+ */
+P.truncated = P.trunc = function () {
+  return finalise(new this.constructor(this), this.e + 1, 1);
+};
+
+
+/*
+ * Return a string representing the value of this Decimal.
+ * Unlike `toString`, negative zero will include the minus sign.
+ *
+ */
+P.valueOf = P.toJSON = function () {
+  var x = this,
+    Ctor = x.constructor,
+    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);
+
+  return x.isNeg() ? '-' + str : str;
+};
+
+
+// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.
+
+
+/*
+ *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,
+ *                           finiteToString, naturalExponential, naturalLogarithm
+ *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,
+ *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random
+ *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm
+ *  convertBase              toStringBinary, parseOther
+ *  cos                      P.cos
+ *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,
+ *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,
+ *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,
+ *                           taylorSeries, atan2, parseOther
+ *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,
+ *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,
+ *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,
+ *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,
+ *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,
+ *                           P.truncated, divide, getLn10, getPi, naturalExponential,
+ *                           naturalLogarithm, ceil, floor, round, trunc
+ *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,
+ *                           toStringBinary
+ *  getBase10Exponent        P.minus, P.plus, P.times, parseOther
+ *  getLn10                  P.logarithm, naturalLogarithm
+ *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2
+ *  getPrecision             P.precision, P.toFraction
+ *  getZeroString            digitsToString, finiteToString
+ *  intPow                   P.toPower, parseOther
+ *  isOdd                    toLessThanHalfPi
+ *  maxOrMin                 max, min
+ *  naturalExponential       P.naturalExponential, P.toPower
+ *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,
+ *                           P.toPower, naturalExponential
+ *  nonFiniteToString        finiteToString, toStringBinary
+ *  parseDecimal             Decimal
+ *  parseOther               Decimal
+ *  sin                      P.sin
+ *  taylorSeries             P.cosh, P.sinh, cos, sin
+ *  toLessThanHalfPi         P.cos, P.sin
+ *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal
+ *  truncate                 intPow
+ *
+ *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,
+ *                           naturalLogarithm, config, parseOther, random, Decimal
+ */
+
+
+function digitsToString(d) {
+  var i, k, ws,
+    indexOfLastWord = d.length - 1,
+    str = '',
+    w = d[0];
+
+  if (indexOfLastWord > 0) {
+    str += w;
+    for (i = 1; i < indexOfLastWord; i++) {
+      ws = d[i] + '';
+      k = LOG_BASE - ws.length;
+      if (k) str += getZeroString(k);
+      str += ws;
+    }
+
+    w = d[i];
+    ws = w + '';
+    k = LOG_BASE - ws.length;
+    if (k) str += getZeroString(k);
+  } else if (w === 0) {
+    return '0';
+  }
+
+  // Remove trailing zeros of last w.
+  for (; w % 10 === 0;) w /= 10;
+
+  return str + w;
+}
+
+
+function checkInt32(i, min, max) {
+  if (i !== ~~i || i < min || i > max) {
+    throw Error(invalidArgument + i);
+  }
+}
+
+
+/*
+ * Check 5 rounding digits if `repeating` is null, 4 otherwise.
+ * `repeating == null` if caller is `log` or `pow`,
+ * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.
+ */
+function checkRoundingDigits(d, i, rm, repeating) {
+  var di, k, r, rd;
+
+  // Get the length of the first word of the array d.
+  for (k = d[0]; k >= 10; k /= 10) --i;
+
+  // Is the rounding digit in the first word of d?
+  if (--i < 0) {
+    i += LOG_BASE;
+    di = 0;
+  } else {
+    di = Math.ceil((i + 1) / LOG_BASE);
+    i %= LOG_BASE;
+  }
+
+  // i is the index (0 - 6) of the rounding digit.
+  // E.g. if within the word 3487563 the first rounding digit is 5,
+  // then i = 4, k = 1000, rd = 3487563 % 1000 = 563
+  k = mathpow(10, LOG_BASE - i);
+  rd = d[di] % k | 0;
+
+  if (repeating == null) {
+    if (i < 3) {
+      if (i == 0) rd = rd / 100 | 0;
+      else if (i == 1) rd = rd / 10 | 0;
+      r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;
+    } else {
+      r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&
+        (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||
+          (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;
+    }
+  } else {
+    if (i < 4) {
+      if (i == 0) rd = rd / 1000 | 0;
+      else if (i == 1) rd = rd / 100 | 0;
+      else if (i == 2) rd = rd / 10 | 0;
+      r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;
+    } else {
+      r = ((repeating || rm < 4) && rd + 1 == k ||
+      (!repeating && rm > 3) && rd + 1 == k / 2) &&
+        (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;
+    }
+  }
+
+  return r;
+}
+
+
+// Convert string of `baseIn` to an array of numbers of `baseOut`.
+// Eg. convertBase('255', 10, 16) returns [15, 15].
+// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].
+function convertBase(str, baseIn, baseOut) {
+  var j,
+    arr = [0],
+    arrL,
+    i = 0,
+    strL = str.length;
+
+  for (; i < strL;) {
+    for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;
+    arr[0] += NUMERALS.indexOf(str.charAt(i++));
+    for (j = 0; j < arr.length; j++) {
+      if (arr[j] > baseOut - 1) {
+        if (arr[j + 1] === void 0) arr[j + 1] = 0;
+        arr[j + 1] += arr[j] / baseOut | 0;
+        arr[j] %= baseOut;
+      }
+    }
+  }
+
+  return arr.reverse();
+}
+
+
+/*
+ * cos(x) = 1 - x^2/2! + x^4/4! - ...
+ * |x| < pi/2
+ *
+ */
+function cosine(Ctor, x) {
+  var k, len, y;
+
+  if (x.isZero()) return x;
+
+  // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1
+  // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1
+
+  // Estimate the optimum number of times to use the argument reduction.
+  len = x.d.length;
+  if (len < 32) {
+    k = Math.ceil(len / 3);
+    y = (1 / tinyPow(4, k)).toString();
+  } else {
+    k = 16;
+    y = '2.3283064365386962890625e-10';
+  }
+
+  Ctor.precision += k;
+
+  x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));
+
+  // Reverse argument reduction
+  for (var i = k; i--;) {
+    var cos2x = x.times(x);
+    x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);
+  }
+
+  Ctor.precision -= k;
+
+  return x;
+}
+
+
+/*
+ * Perform division in the specified base.
+ */
+var divide = (function () {
+
+  // Assumes non-zero x and k, and hence non-zero result.
+  function multiplyInteger(x, k, base) {
+    var temp,
+      carry = 0,
+      i = x.length;
+
+    for (x = x.slice(); i--;) {
+      temp = x[i] * k + carry;
+      x[i] = temp % base | 0;
+      carry = temp / base | 0;
+    }
+
+    if (carry) x.unshift(carry);
+
+    return x;
+  }
+
+  function compare(a, b, aL, bL) {
+    var i, r;
+
+    if (aL != bL) {
+      r = aL > bL ? 1 : -1;
+    } else {
+      for (i = r = 0; i < aL; i++) {
+        if (a[i] != b[i]) {
+          r = a[i] > b[i] ? 1 : -1;
+          break;
+        }
+      }
+    }
+
+    return r;
+  }
+
+  function subtract(a, b, aL, base) {
+    var i = 0;
+
+    // Subtract b from a.
+    for (; aL--;) {
+      a[aL] -= i;
+      i = a[aL] < b[aL] ? 1 : 0;
+      a[aL] = i * base + a[aL] - b[aL];
+    }
+
+    // Remove leading zeros.
+    for (; !a[0] && a.length > 1;) a.shift();
+  }
+
+  return function (x, y, pr, rm, dp, base) {
+    var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,
+      yL, yz,
+      Ctor = x.constructor,
+      sign = x.s == y.s ? 1 : -1,
+      xd = x.d,
+      yd = y.d;
+
+    // Either NaN, Infinity or 0?
+    if (!xd || !xd[0] || !yd || !yd[0]) {
+
+      return new Ctor(// Return NaN if either NaN, or both Infinity or 0.
+        !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :
+
+        // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
+        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);
+    }
+
+    if (base) {
+      logBase = 1;
+      e = x.e - y.e;
+    } else {
+      base = BASE;
+      logBase = LOG_BASE;
+      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);
+    }
+
+    yL = yd.length;
+    xL = xd.length;
+    q = new Ctor(sign);
+    qd = q.d = [];
+
+    // Result exponent may be one less than e.
+    // The digit array of a Decimal from toStringBinary may have trailing zeros.
+    for (i = 0; yd[i] == (xd[i] || 0); i++);
+
+    if (yd[i] > (xd[i] || 0)) e--;
+
+    if (pr == null) {
+      sd = pr = Ctor.precision;
+      rm = Ctor.rounding;
+    } else if (dp) {
+      sd = pr + (x.e - y.e) + 1;
+    } else {
+      sd = pr;
+    }
+
+    if (sd < 0) {
+      qd.push(1);
+      more = true;
+    } else {
+
+      // Convert precision in number of base 10 digits to base 1e7 digits.
+      sd = sd / logBase + 2 | 0;
+      i = 0;
+
+      // divisor < 1e7
+      if (yL == 1) {
+        k = 0;
+        yd = yd[0];
+        sd++;
+
+        // k is the carry.
+        for (; (i < xL || k) && sd--; i++) {
+          t = k * base + (xd[i] || 0);
+          qd[i] = t / yd | 0;
+          k = t % yd | 0;
+        }
+
+        more = k || i < xL;
+
+      // divisor >= 1e7
+      } else {
+
+        // Normalise xd and yd so highest order digit of yd is >= base/2
+        k = base / (yd[0] + 1) | 0;
+
+        if (k > 1) {
+          yd = multiplyInteger(yd, k, base);
+          xd = multiplyInteger(xd, k, base);
+          yL = yd.length;
+          xL = xd.length;
+        }
+
+        xi = yL;
+        rem = xd.slice(0, yL);
+        remL = rem.length;
+
+        // Add zeros to make remainder as long as divisor.
+        for (; remL < yL;) rem[remL++] = 0;
+
+        yz = yd.slice();
+        yz.unshift(0);
+        yd0 = yd[0];
+
+        if (yd[1] >= base / 2) ++yd0;
+
+        do {
+          k = 0;
+
+          // Compare divisor and remainder.
+          cmp = compare(yd, rem, yL, remL);
+
+          // If divisor < remainder.
+          if (cmp < 0) {
+
+            // Calculate trial digit, k.
+            rem0 = rem[0];
+            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
+
+            // k will be how many times the divisor goes into the current remainder.
+            k = rem0 / yd0 | 0;
+
+            //  Algorithm:
+            //  1. product = divisor * trial digit (k)
+            //  2. if product > remainder: product -= divisor, k--
+            //  3. remainder -= product
+            //  4. if product was < remainder at 2:
+            //    5. compare new remainder and divisor
+            //    6. If remainder > divisor: remainder -= divisor, k++
+
+            if (k > 1) {
+              if (k >= base) k = base - 1;
+
+              // product = divisor * trial digit.
+              prod = multiplyInteger(yd, k, base);
+              prodL = prod.length;
+              remL = rem.length;
+
+              // Compare product and remainder.
+              cmp = compare(prod, rem, prodL, remL);
+
+              // product > remainder.
+              if (cmp == 1) {
+                k--;
+
+                // Subtract divisor from product.
+                subtract(prod, yL < prodL ? yz : yd, prodL, base);
+              }
+            } else {
+
+              // cmp is -1.
+              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1
+              // to avoid it. If k is 1 there is a need to compare yd and rem again below.
+              if (k == 0) cmp = k = 1;
+              prod = yd.slice();
+            }
+
+            prodL = prod.length;
+            if (prodL < remL) prod.unshift(0);
+
+            // Subtract product from remainder.
+            subtract(rem, prod, remL, base);
+
+            // If product was < previous remainder.
+            if (cmp == -1) {
+              remL = rem.length;
+
+              // Compare divisor and new remainder.
+              cmp = compare(yd, rem, yL, remL);
+
+              // If divisor < new remainder, subtract divisor from remainder.
+              if (cmp < 1) {
+                k++;
+
+                // Subtract divisor from remainder.
+                subtract(rem, yL < remL ? yz : yd, remL, base);
+              }
+            }
+
+            remL = rem.length;
+          } else if (cmp === 0) {
+            k++;
+            rem = [0];
+          }    // if cmp === 1, k will be 0
+
+          // Add the next digit, k, to the result array.
+          qd[i++] = k;
+
+          // Update the remainder.
+          if (cmp && rem[0]) {
+            rem[remL++] = xd[xi] || 0;
+          } else {
+            rem = [xd[xi]];
+            remL = 1;
+          }
+
+        } while ((xi++ < xL || rem[0] !== void 0) && sd--);
+
+        more = rem[0] !== void 0;
+      }
+
+      // Leading zero?
+      if (!qd[0]) qd.shift();
+    }
+
+    // logBase is 1 when divide is being used for base conversion.
+    if (logBase == 1) {
+      q.e = e;
+      inexact = more;
+    } else {
+
+      // To calculate q.e, first get the number of digits of qd[0].
+      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;
+      q.e = i + e * logBase - 1;
+
+      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);
+    }
+
+    return q;
+  };
+})();
+
+
+/*
+ * Round `x` to `sd` significant digits using rounding mode `rm`.
+ * Check for over/under-flow.
+ */
+ function finalise(x, sd, rm, isTruncated) {
+  var digits, i, j, k, rd, roundUp, w, xd, xdi,
+    Ctor = x.constructor;
+
+  // Don't round if sd is null or undefined.
+  out: if (sd != null) {
+    xd = x.d;
+
+    // Infinity/NaN.
+    if (!xd) return x;
+
+    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.
+    // w: the word of xd containing rd, a base 1e7 number.
+    // xdi: the index of w within xd.
+    // digits: the number of digits of w.
+    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if
+    // they had leading zeros)
+    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).
+
+    // Get the length of the first word of the digits array xd.
+    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;
+    i = sd - digits;
+
+    // Is the rounding digit in the first word of xd?
+    if (i < 0) {
+      i += LOG_BASE;
+      j = sd;
+      w = xd[xdi = 0];
+
+      // Get the rounding digit at index j of w.
+      rd = w / mathpow(10, digits - j - 1) % 10 | 0;
+    } else {
+      xdi = Math.ceil((i + 1) / LOG_BASE);
+      k = xd.length;
+      if (xdi >= k) {
+        if (isTruncated) {
+
+          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.
+          for (; k++ <= xdi;) xd.push(0);
+          w = rd = 0;
+          digits = 1;
+          i %= LOG_BASE;
+          j = i - LOG_BASE + 1;
+        } else {
+          break out;
+        }
+      } else {
+        w = k = xd[xdi];
+
+        // Get the number of digits of w.
+        for (digits = 1; k >= 10; k /= 10) digits++;
+
+        // Get the index of rd within w.
+        i %= LOG_BASE;
+
+        // Get the index of rd within w, adjusted for leading zeros.
+        // The number of leading zeros of w is given by LOG_BASE - digits.
+        j = i - LOG_BASE + digits;
+
+        // Get the rounding digit at index j of w.
+        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;
+      }
+    }
+
+    // Are there any non-zero digits after the rounding digit?
+    isTruncated = isTruncated || sd < 0 ||
+      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));
+
+    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right
+    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression
+    // will give 714.
+
+    roundUp = rm < 4
+      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))
+      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&
+
+        // Check whether the digit to the left of the rounding digit is odd.
+        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||
+          rm == (x.s < 0 ? 8 : 7));
+
+    if (sd < 1 || !xd[0]) {
+      xd.length = 0;
+      if (roundUp) {
+
+        // Convert sd to decimal places.
+        sd -= x.e + 1;
+
+        // 1, 0.1, 0.01, 0.001, 0.0001 etc.
+        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);
+        x.e = -sd || 0;
+      } else {
+
+        // Zero.
+        xd[0] = x.e = 0;
+      }
+
+      return x;
+    }
+
+    // Remove excess digits.
+    if (i == 0) {
+      xd.length = xdi;
+      k = 1;
+      xdi--;
+    } else {
+      xd.length = xdi + 1;
+      k = mathpow(10, LOG_BASE - i);
+
+      // E.g. 56700 becomes 56000 if 7 is the rounding digit.
+      // j > 0 means i > number of leading zeros of w.
+      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;
+    }
+
+    if (roundUp) {
+      for (;;) {
+
+        // Is the digit to be rounded up in the first word of xd?
+        if (xdi == 0) {
+
+          // i will be the length of xd[0] before k is added.
+          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;
+          j = xd[0] += k;
+          for (k = 1; j >= 10; j /= 10) k++;
+
+          // if i != k the length has increased.
+          if (i != k) {
+            x.e++;
+            if (xd[0] == BASE) xd[0] = 1;
+          }
+
+          break;
+        } else {
+          xd[xdi] += k;
+          if (xd[xdi] != BASE) break;
+          xd[xdi--] = 0;
+          k = 1;
+        }
+      }
+    }
+
+    // Remove trailing zeros.
+    for (i = xd.length; xd[--i] === 0;) xd.pop();
+  }
+
+  if (external) {
+
+    // Overflow?
+    if (x.e > Ctor.maxE) {
+
+      // Infinity.
+      x.d = null;
+      x.e = NaN;
+
+    // Underflow?
+    } else if (x.e < Ctor.minE) {
+
+      // Zero.
+      x.e = 0;
+      x.d = [0];
+      // Ctor.underflow = true;
+    } // else Ctor.underflow = false;
+  }
+
+  return x;
+}
+
+
+function finiteToString(x, isExp, sd) {
+  if (!x.isFinite()) return nonFiniteToString(x);
+  var k,
+    e = x.e,
+    str = digitsToString(x.d),
+    len = str.length;
+
+  if (isExp) {
+    if (sd && (k = sd - len) > 0) {
+      str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);
+    } else if (len > 1) {
+      str = str.charAt(0) + '.' + str.slice(1);
+    }
+
+    str = str + (x.e < 0 ? 'e' : 'e+') + x.e;
+  } else if (e < 0) {
+    str = '0.' + getZeroString(-e - 1) + str;
+    if (sd && (k = sd - len) > 0) str += getZeroString(k);
+  } else if (e >= len) {
+    str += getZeroString(e + 1 - len);
+    if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);
+  } else {
+    if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);
+    if (sd && (k = sd - len) > 0) {
+      if (e + 1 === len) str += '.';
+      str += getZeroString(k);
+    }
+  }
+
+  return str;
+}
+
+
+// Calculate the base 10 exponent from the base 1e7 exponent.
+function getBase10Exponent(digits, e) {
+  var w = digits[0];
+
+  // Add the number of digits of the first word of the digits array.
+  for ( e *= LOG_BASE; w >= 10; w /= 10) e++;
+  return e;
+}
+
+
+function getLn10(Ctor, sd, pr) {
+  if (sd > LN10_PRECISION) {
+
+    // Reset global state in case the exception is caught.
+    external = true;
+    if (pr) Ctor.precision = pr;
+    throw Error(precisionLimitExceeded);
+  }
+  return finalise(new Ctor(LN10), sd, 1, true);
+}
+
+
+function getPi(Ctor, sd, rm) {
+  if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);
+  return finalise(new Ctor(PI), sd, rm, true);
+}
+
+
+function getPrecision(digits) {
+  var w = digits.length - 1,
+    len = w * LOG_BASE + 1;
+
+  w = digits[w];
+
+  // If non-zero...
+  if (w) {
+
+    // Subtract the number of trailing zeros of the last word.
+    for (; w % 10 == 0; w /= 10) len--;
+
+    // Add the number of digits of the first word.
+    for (w = digits[0]; w >= 10; w /= 10) len++;
+  }
+
+  return len;
+}
+
+
+function getZeroString(k) {
+  var zs = '';
+  for (; k--;) zs += '0';
+  return zs;
+}
+
+
+/*
+ * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an
+ * integer of type number.
+ *
+ * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.
+ *
+ */
+function intPow(Ctor, x, n, pr) {
+  var isTruncated,
+    r = new Ctor(1),
+
+    // Max n of 9007199254740991 takes 53 loop iterations.
+    // Maximum digits array length; leaves [28, 34] guard digits.
+    k = Math.ceil(pr / LOG_BASE + 4);
+
+  external = false;
+
+  for (;;) {
+    if (n % 2) {
+      r = r.times(x);
+      if (truncate(r.d, k)) isTruncated = true;
+    }
+
+    n = mathfloor(n / 2);
+    if (n === 0) {
+
+      // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.
+      n = r.d.length - 1;
+      if (isTruncated && r.d[n] === 0) ++r.d[n];
+      break;
+    }
+
+    x = x.times(x);
+    truncate(x.d, k);
+  }
+
+  external = true;
+
+  return r;
+}
+
+
+function isOdd(n) {
+  return n.d[n.d.length - 1] & 1;
+}
+
+
+/*
+ * Handle `max` (`n` is -1) and `min` (`n` is 1).
+ */
+function maxOrMin(Ctor, args, n) {
+  var k, y,
+    x = new Ctor(args[0]),
+    i = 0;
+
+  for (; ++i < args.length;) {
+    y = new Ctor(args[i]);
+
+    // NaN?
+    if (!y.s) {
+      x = y;
+      break;
+    }
+
+    k = x.cmp(y);
+
+    if (k === n || k === 0 && x.s === n) {
+      x = y;
+    }
+  }
+
+  return x;
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant
+ * digits.
+ *
+ * Taylor/Maclaurin series.
+ *
+ * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...
+ *
+ * Argument reduction:
+ *   Repeat x = x / 32, k += 5, until |x| < 0.1
+ *   exp(x) = exp(x / 2^k)^(2^k)
+ *
+ * Previously, the argument was initially reduced by
+ * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)
+ * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was
+ * found to be slower than just dividing repeatedly by 32 as above.
+ *
+ * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000
+ * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000
+ * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)
+ *
+ *  exp(Infinity)  = Infinity
+ *  exp(-Infinity) = 0
+ *  exp(NaN)       = NaN
+ *  exp(±0)        = 1
+ *
+ *  exp(x) is non-terminating for any finite, non-zero x.
+ *
+ *  The result will always be correctly rounded.
+ *
+ */
+function naturalExponential(x, sd) {
+  var denominator, guard, j, pow, sum, t, wpr,
+    rep = 0,
+    i = 0,
+    k = 0,
+    Ctor = x.constructor,
+    rm = Ctor.rounding,
+    pr = Ctor.precision;
+
+  // 0/NaN/Infinity?
+  if (!x.d || !x.d[0] || x.e > 17) {
+
+    return new Ctor(x.d
+      ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0
+      : x.s ? x.s < 0 ? 0 : x : 0 / 0);
+  }
+
+  if (sd == null) {
+    external = false;
+    wpr = pr;
+  } else {
+    wpr = sd;
+  }
+
+  t = new Ctor(0.03125);
+
+  // while abs(x) >= 0.1
+  while (x.e > -2) {
+
+    // x = x / 2^5
+    x = x.times(t);
+    k += 5;
+  }
+
+  // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision
+  // necessary to ensure the first 4 rounding digits are correct.
+  guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;
+  wpr += guard;
+  denominator = pow = sum = new Ctor(1);
+  Ctor.precision = wpr;
+
+  for (;;) {
+    pow = finalise(pow.times(x), wpr, 1);
+    denominator = denominator.times(++i);
+    t = sum.plus(divide(pow, denominator, wpr, 1));
+
+    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+      j = k;
+      while (j--) sum = finalise(sum.times(sum), wpr, 1);
+
+      // Check to see if the first 4 rounding digits are [49]999.
+      // If so, repeat the summation with a higher precision, otherwise
+      // e.g. with precision: 18, rounding: 1
+      // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)
+      // `wpr - guard` is the index of first rounding digit.
+      if (sd == null) {
+
+        if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+          Ctor.precision = wpr += 10;
+          denominator = pow = t = new Ctor(1);
+          i = 0;
+          rep++;
+        } else {
+          return finalise(sum, Ctor.precision = pr, rm, external = true);
+        }
+      } else {
+        Ctor.precision = pr;
+        return sum;
+      }
+    }
+
+    sum = t;
+  }
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant
+ * digits.
+ *
+ *  ln(-n)        = NaN
+ *  ln(0)         = -Infinity
+ *  ln(-0)        = -Infinity
+ *  ln(1)         = 0
+ *  ln(Infinity)  = Infinity
+ *  ln(-Infinity) = NaN
+ *  ln(NaN)       = NaN
+ *
+ *  ln(n) (n != 1) is non-terminating.
+ *
+ */
+function naturalLogarithm(y, sd) {
+  var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,
+    n = 1,
+    guard = 10,
+    x = y,
+    xd = x.d,
+    Ctor = x.constructor,
+    rm = Ctor.rounding,
+    pr = Ctor.precision;
+
+  // Is x negative or Infinity, NaN, 0 or 1?
+  if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {
+    return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);
+  }
+
+  if (sd == null) {
+    external = false;
+    wpr = pr;
+  } else {
+    wpr = sd;
+  }
+
+  Ctor.precision = wpr += guard;
+  c = digitsToString(xd);
+  c0 = c.charAt(0);
+
+  if (Math.abs(e = x.e) < 1.5e15) {
+
+    // Argument reduction.
+    // The series converges faster the closer the argument is to 1, so using
+    // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b
+    // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,
+    // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can
+    // later be divided by this number, then separate out the power of 10 using
+    // ln(a*10^b) = ln(a) + b*ln(10).
+
+    // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).
+    //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {
+    // max n is 6 (gives 0.7 - 1.3)
+    while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {
+      x = x.times(y);
+      c = digitsToString(x.d);
+      c0 = c.charAt(0);
+      n++;
+    }
+
+    e = x.e;
+
+    if (c0 > 1) {
+      x = new Ctor('0.' + c);
+      e++;
+    } else {
+      x = new Ctor(c0 + '.' + c.slice(1));
+    }
+  } else {
+
+    // The argument reduction method above may result in overflow if the argument y is a massive
+    // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this
+    // function using ln(x*10^e) = ln(x) + e*ln(10).
+    t = getLn10(Ctor, wpr + 2, pr).times(e + '');
+    x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);
+    Ctor.precision = pr;
+
+    return sd == null ? finalise(x, pr, rm, external = true) : x;
+  }
+
+  // x1 is x reduced to a value near 1.
+  x1 = x;
+
+  // Taylor series.
+  // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)
+  // where x = (y - 1)/(y + 1)    (|x| < 1)
+  sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);
+  x2 = finalise(x.times(x), wpr, 1);
+  denominator = 3;
+
+  for (;;) {
+    numerator = finalise(numerator.times(x2), wpr, 1);
+    t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));
+
+    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {
+      sum = sum.times(2);
+
+      // Reverse the argument reduction. Check that e is not 0 because, besides preventing an
+      // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.
+      if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));
+      sum = divide(sum, new Ctor(n), wpr, 1);
+
+      // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has
+      // been repeated previously) and the first 4 rounding digits 9999?
+      // If so, restart the summation with a higher precision, otherwise
+      // e.g. with precision: 12, rounding: 1
+      // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.
+      // `wpr - guard` is the index of first rounding digit.
+      if (sd == null) {
+        if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {
+          Ctor.precision = wpr += guard;
+          t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);
+          x2 = finalise(x.times(x), wpr, 1);
+          denominator = rep = 1;
+        } else {
+          return finalise(sum, Ctor.precision = pr, rm, external = true);
+        }
+      } else {
+        Ctor.precision = pr;
+        return sum;
+      }
+    }
+
+    sum = t;
+    denominator += 2;
+  }
+}
+
+
+// ±Infinity, NaN.
+function nonFiniteToString(x) {
+  // Unsigned.
+  return String(x.s * x.s / 0);
+}
+
+
+/*
+ * Parse the value of a new Decimal `x` from string `str`.
+ */
+function parseDecimal(x, str) {
+  var e, i, len;
+
+  // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.
+  // Decimal point?
+  if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');
+
+  // Exponential form?
+  if ((i = str.search(/e/i)) > 0) {
+
+    // Determine exponent.
+    if (e < 0) e = i;
+    e += +str.slice(i + 1);
+    str = str.substring(0, i);
+  } else if (e < 0) {
+
+    // Integer.
+    e = str.length;
+  }
+
+  // Determine leading zeros.
+  for (i = 0; str.charCodeAt(i) === 48; i++);
+
+  // Determine trailing zeros.
+  for (len = str.length; str.charCodeAt(len - 1) === 48; --len);
+  str = str.slice(i, len);
+
+  if (str) {
+    len -= i;
+    x.e = e = e - i - 1;
+    x.d = [];
+
+    // Transform base
+
+    // e is the base 10 exponent.
+    // i is where to slice str to get the first word of the digits array.
+    i = (e + 1) % LOG_BASE;
+    if (e < 0) i += LOG_BASE;
+
+    if (i < len) {
+      if (i) x.d.push(+str.slice(0, i));
+      for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));
+      str = str.slice(i);
+      i = LOG_BASE - str.length;
+    } else {
+      i -= len;
+    }
+
+    for (; i--;) str += '0';
+    x.d.push(+str);
+
+    if (external) {
+
+      // Overflow?
+      if (x.e > x.constructor.maxE) {
+
+        // Infinity.
+        x.d = null;
+        x.e = NaN;
+
+      // Underflow?
+      } else if (x.e < x.constructor.minE) {
+
+        // Zero.
+        x.e = 0;
+        x.d = [0];
+        // x.constructor.underflow = true;
+      } // else x.constructor.underflow = false;
+    }
+  } else {
+
+    // Zero.
+    x.e = 0;
+    x.d = [0];
+  }
+
+  return x;
+}
+
+
+/*
+ * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.
+ */
+function parseOther(x, str) {
+  var base, Ctor, divisor, i, isFloat, len, p, xd, xe;
+
+  if (str.indexOf('_') > -1) {
+    str = str.replace(/(\d)_(?=\d)/g, '$1');
+    if (isDecimal.test(str)) return parseDecimal(x, str);
+  } else if (str === 'Infinity' || str === 'NaN') {
+    if (!+str) x.s = NaN;
+    x.e = NaN;
+    x.d = null;
+    return x;
+  }
+
+  if (isHex.test(str))  {
+    base = 16;
+    str = str.toLowerCase();
+  } else if (isBinary.test(str))  {
+    base = 2;
+  } else if (isOctal.test(str))  {
+    base = 8;
+  } else {
+    throw Error(invalidArgument + str);
+  }
+
+  // Is there a binary exponent part?
+  i = str.search(/p/i);
+
+  if (i > 0) {
+    p = +str.slice(i + 1);
+    str = str.substring(2, i);
+  } else {
+    str = str.slice(2);
+  }
+
+  // Convert `str` as an integer then divide the result by `base` raised to a power such that the
+  // fraction part will be restored.
+  i = str.indexOf('.');
+  isFloat = i >= 0;
+  Ctor = x.constructor;
+
+  if (isFloat) {
+    str = str.replace('.', '');
+    len = str.length;
+    i = len - i;
+
+    // log[10](16) = 1.2041... , log[10](88) = 1.9444....
+    divisor = intPow(Ctor, new Ctor(base), i, i * 2);
+  }
+
+  xd = convertBase(str, base, BASE);
+  xe = xd.length - 1;
+
+  // Remove trailing zeros.
+  for (i = xe; xd[i] === 0; --i) xd.pop();
+  if (i < 0) return new Ctor(x.s * 0);
+  x.e = getBase10Exponent(xd, xe);
+  x.d = xd;
+  external = false;
+
+  // At what precision to perform the division to ensure exact conversion?
+  // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)
+  // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412
+  // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.
+  // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount
+  // Therefore using 4 * the number of digits of str will always be enough.
+  if (isFloat) x = divide(x, divisor, len * 4);
+
+  // Multiply by the binary exponent part if present.
+  if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));
+  external = true;
+
+  return x;
+}
+
+
+/*
+ * sin(x) = x - x^3/3! + x^5/5! - ...
+ * |x| < pi/2
+ *
+ */
+function sine(Ctor, x) {
+  var k,
+    len = x.d.length;
+
+  if (len < 3) {
+    return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);
+  }
+
+  // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)
+  // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)
+  // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))
+
+  // Estimate the optimum number of times to use the argument reduction.
+  k = 1.4 * Math.sqrt(len);
+  k = k > 16 ? 16 : k | 0;
+
+  x = x.times(1 / tinyPow(5, k));
+  x = taylorSeries(Ctor, 2, x, x);
+
+  // Reverse argument reduction
+  var sin2_x,
+    d5 = new Ctor(5),
+    d16 = new Ctor(16),
+    d20 = new Ctor(20);
+  for (; k--;) {
+    sin2_x = x.times(x);
+    x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));
+  }
+
+  return x;
+}
+
+
+// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.
+function taylorSeries(Ctor, n, x, y, isHyperbolic) {
+  var j, t, u, x2,
+    i = 1,
+    pr = Ctor.precision,
+    k = Math.ceil(pr / LOG_BASE);
+
+  external = false;
+  x2 = x.times(x);
+  u = new Ctor(y);
+
+  for (;;) {
+    t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);
+    u = isHyperbolic ? y.plus(t) : y.minus(t);
+    y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);
+    t = u.plus(y);
+
+    if (t.d[k] !== void 0) {
+      for (j = k; t.d[j] === u.d[j] && j--;);
+      if (j == -1) break;
+    }
+
+    j = u;
+    u = y;
+    y = t;
+    t = j;
+    i++;
+  }
+
+  external = true;
+  t.d.length = k + 1;
+
+  return t;
+}
+
+
+// Exponent e must be positive and non-zero.
+function tinyPow(b, e) {
+  var n = b;
+  while (--e) n *= b;
+  return n;
+}
+
+
+// Return the absolute value of `x` reduced to less than or equal to half pi.
+function toLessThanHalfPi(Ctor, x) {
+  var t,
+    isNeg = x.s < 0,
+    pi = getPi(Ctor, Ctor.precision, 1),
+    halfPi = pi.times(0.5);
+
+  x = x.abs();
+
+  if (x.lte(halfPi)) {
+    quadrant = isNeg ? 4 : 1;
+    return x;
+  }
+
+  t = x.divToInt(pi);
+
+  if (t.isZero()) {
+    quadrant = isNeg ? 3 : 2;
+  } else {
+    x = x.minus(t.times(pi));
+
+    // 0 <= x < pi
+    if (x.lte(halfPi)) {
+      quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);
+      return x;
+    }
+
+    quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);
+  }
+
+  return x.minus(pi).abs();
+}
+
+
+/*
+ * Return the value of Decimal `x` as a string in base `baseOut`.
+ *
+ * If the optional `sd` argument is present include a binary exponent suffix.
+ */
+function toStringBinary(x, baseOut, sd, rm) {
+  var base, e, i, k, len, roundUp, str, xd, y,
+    Ctor = x.constructor,
+    isExp = sd !== void 0;
+
+  if (isExp) {
+    checkInt32(sd, 1, MAX_DIGITS);
+    if (rm === void 0) rm = Ctor.rounding;
+    else checkInt32(rm, 0, 8);
+  } else {
+    sd = Ctor.precision;
+    rm = Ctor.rounding;
+  }
+
+  if (!x.isFinite()) {
+    str = nonFiniteToString(x);
+  } else {
+    str = finiteToString(x);
+    i = str.indexOf('.');
+
+    // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:
+    // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))
+    // minBinaryExponent = floor(decimalExponent * log[2](10))
+    // log[2](10) = 3.321928094887362347870319429489390175864
+
+    if (isExp) {
+      base = 2;
+      if (baseOut == 16) {
+        sd = sd * 4 - 3;
+      } else if (baseOut == 8) {
+        sd = sd * 3 - 2;
+      }
+    } else {
+      base = baseOut;
+    }
+
+    // Convert the number as an integer then divide the result by its base raised to a power such
+    // that the fraction part will be restored.
+
+    // Non-integer.
+    if (i >= 0) {
+      str = str.replace('.', '');
+      y = new Ctor(1);
+      y.e = str.length - i;
+      y.d = convertBase(finiteToString(y), 10, base);
+      y.e = y.d.length;
+    }
+
+    xd = convertBase(str, 10, base);
+    e = len = xd.length;
+
+    // Remove trailing zeros.
+    for (; xd[--len] == 0;) xd.pop();
+
+    if (!xd[0]) {
+      str = isExp ? '0p+0' : '0';
+    } else {
+      if (i < 0) {
+        e--;
+      } else {
+        x = new Ctor(x);
+        x.d = xd;
+        x.e = e;
+        x = divide(x, y, sd, rm, 0, base);
+        xd = x.d;
+        e = x.e;
+        roundUp = inexact;
+      }
+
+      // The rounding digit, i.e. the digit after the digit that may be rounded up.
+      i = xd[sd];
+      k = base / 2;
+      roundUp = roundUp || xd[sd + 1] !== void 0;
+
+      roundUp = rm < 4
+        ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))
+        : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||
+          rm === (x.s < 0 ? 8 : 7));
+
+      xd.length = sd;
+
+      if (roundUp) {
+
+        // Rounding up may mean the previous digit has to be rounded up and so on.
+        for (; ++xd[--sd] > base - 1;) {
+          xd[sd] = 0;
+          if (!sd) {
+            ++e;
+            xd.unshift(1);
+          }
+        }
+      }
+
+      // Determine trailing zeros.
+      for (len = xd.length; !xd[len - 1]; --len);
+
+      // E.g. [4, 11, 15] becomes 4bf.
+      for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);
+
+      // Add binary exponent suffix?
+      if (isExp) {
+        if (len > 1) {
+          if (baseOut == 16 || baseOut == 8) {
+            i = baseOut == 16 ? 4 : 3;
+            for (--len; len % i; len++) str += '0';
+            xd = convertBase(str, base, baseOut);
+            for (len = xd.length; !xd[len - 1]; --len);
+
+            // xd[0] will always be be 1
+            for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);
+          } else {
+            str = str.charAt(0) + '.' + str.slice(1);
+          }
+        }
+
+        str =  str + (e < 0 ? 'p' : 'p+') + e;
+      } else if (e < 0) {
+        for (; ++e;) str = '0' + str;
+        str = '0.' + str;
+      } else {
+        if (++e > len) for (e -= len; e-- ;) str += '0';
+        else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);
+      }
+    }
+
+    str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;
+  }
+
+  return x.s < 0 ? '-' + str : str;
+}
+
+
+// Does not strip trailing zeros.
+function truncate(arr, len) {
+  if (arr.length > len) {
+    arr.length = len;
+    return true;
+  }
+}
+
+
+// Decimal methods
+
+
+/*
+ *  abs
+ *  acos
+ *  acosh
+ *  add
+ *  asin
+ *  asinh
+ *  atan
+ *  atanh
+ *  atan2
+ *  cbrt
+ *  ceil
+ *  clamp
+ *  clone
+ *  config
+ *  cos
+ *  cosh
+ *  div
+ *  exp
+ *  floor
+ *  hypot
+ *  ln
+ *  log
+ *  log2
+ *  log10
+ *  max
+ *  min
+ *  mod
+ *  mul
+ *  pow
+ *  random
+ *  round
+ *  set
+ *  sign
+ *  sin
+ *  sinh
+ *  sqrt
+ *  sub
+ *  sum
+ *  tan
+ *  tanh
+ *  trunc
+ */
+
+
+/*
+ * Return a new Decimal whose value is the absolute value of `x`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function abs(x) {
+  return new this(x).abs();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arccosine in radians of `x`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function acos(x) {
+  return new this(x).acos();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function acosh(x) {
+  return new this(x).acosh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ * y {number|string|bigint|Decimal}
+ *
+ */
+function add(x, y) {
+  return new this(x).plus(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function asin(x) {
+  return new this(x).asin();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function asinh(x) {
+  return new this(x).asinh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function atan(x) {
+  return new this(x).atan();
+}
+
+
+/*
+ * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to
+ * `precision` significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function atanh(x) {
+  return new this(x).atanh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi
+ * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * Domain: [-Infinity, Infinity]
+ * Range: [-pi, pi]
+ *
+ * y {number|string|bigint|Decimal} The y-coordinate.
+ * x {number|string|bigint|Decimal} The x-coordinate.
+ *
+ * atan2(±0, -0)               = ±pi
+ * atan2(±0, +0)               = ±0
+ * atan2(±0, -x)               = ±pi for x > 0
+ * atan2(±0, x)                = ±0 for x > 0
+ * atan2(-y, ±0)               = -pi/2 for y > 0
+ * atan2(y, ±0)                = pi/2 for y > 0
+ * atan2(±y, -Infinity)        = ±pi for finite y > 0
+ * atan2(±y, +Infinity)        = ±0 for finite y > 0
+ * atan2(±Infinity, x)         = ±pi/2 for finite x
+ * atan2(±Infinity, -Infinity) = ±3*pi/4
+ * atan2(±Infinity, +Infinity) = ±pi/4
+ * atan2(NaN, x) = NaN
+ * atan2(y, NaN) = NaN
+ *
+ */
+function atan2(y, x) {
+  y = new this(y);
+  x = new this(x);
+  var r,
+    pr = this.precision,
+    rm = this.rounding,
+    wpr = pr + 4;
+
+  // Either NaN
+  if (!y.s || !x.s) {
+    r = new this(NaN);
+
+  // Both ±Infinity
+  } else if (!y.d && !x.d) {
+    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);
+    r.s = y.s;
+
+  // x is ±Infinity or y is ±0
+  } else if (!x.d || y.isZero()) {
+    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);
+    r.s = y.s;
+
+  // y is ±Infinity or x is ±0
+  } else if (!y.d || x.isZero()) {
+    r = getPi(this, wpr, 1).times(0.5);
+    r.s = y.s;
+
+  // Both non-zero and finite
+  } else if (x.s < 0) {
+    this.precision = wpr;
+    this.rounding = 1;
+    r = this.atan(divide(y, x, wpr, 1));
+    x = getPi(this, wpr, 1);
+    this.precision = pr;
+    this.rounding = rm;
+    r = y.s < 0 ? r.minus(x) : r.plus(x);
+  } else {
+    r = this.atan(divide(y, x, wpr, 1));
+  }
+
+  return r;
+}
+
+
+/*
+ * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function cbrt(x) {
+  return new this(x).cbrt();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function ceil(x) {
+  return finalise(x = new this(x), x.e + 1, 2);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.
+ *
+ * x {number|string|bigint|Decimal}
+ * min {number|string|bigint|Decimal}
+ * max {number|string|bigint|Decimal}
+ *
+ */
+function clamp(x, min, max) {
+  return new this(x).clamp(min, max);
+}
+
+
+/*
+ * Configure global settings for a Decimal constructor.
+ *
+ * `obj` is an object with one or more of the following properties,
+ *
+ *   precision  {number}
+ *   rounding   {number}
+ *   toExpNeg   {number}
+ *   toExpPos   {number}
+ *   maxE       {number}
+ *   minE       {number}
+ *   modulo     {number}
+ *   crypto     {boolean|number}
+ *   defaults   {true}
+ *
+ * E.g. Decimal.config({ precision: 20, rounding: 4 })
+ *
+ */
+function config(obj) {
+  if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');
+  var i, p, v,
+    useDefaults = obj.defaults === true,
+    ps = [
+      'precision', 1, MAX_DIGITS,
+      'rounding', 0, 8,
+      'toExpNeg', -EXP_LIMIT, 0,
+      'toExpPos', 0, EXP_LIMIT,
+      'maxE', 0, EXP_LIMIT,
+      'minE', -EXP_LIMIT, 0,
+      'modulo', 0, 9
+    ];
+
+  for (i = 0; i < ps.length; i += 3) {
+    if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];
+    if ((v = obj[p]) !== void 0) {
+      if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;
+      else throw Error(invalidArgument + p + ': ' + v);
+    }
+  }
+
+  if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];
+  if ((v = obj[p]) !== void 0) {
+    if (v === true || v === false || v === 0 || v === 1) {
+      if (v) {
+        if (typeof crypto != 'undefined' && crypto &&
+          (crypto.getRandomValues || crypto.randomBytes)) {
+          this[p] = true;
+        } else {
+          throw Error(cryptoUnavailable);
+        }
+      } else {
+        this[p] = false;
+      }
+    } else {
+      throw Error(invalidArgument + p + ': ' + v);
+    }
+  }
+
+  return this;
+}
+
+
+/*
+ * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function cos(x) {
+  return new this(x).cos();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function cosh(x) {
+  return new this(x).cosh();
+}
+
+
+/*
+ * Create and return a Decimal constructor with the same configuration properties as this Decimal
+ * constructor.
+ *
+ */
+function clone(obj) {
+  var i, p, ps;
+
+  /*
+   * The Decimal constructor and exported function.
+   * Return a new Decimal instance.
+   *
+   * v {number|string|bigint|Decimal} A numeric value.
+   *
+   */
+  function Decimal(v) {
+    var e, i, t,
+      x = this;
+
+    // Decimal called without new.
+    if (!(x instanceof Decimal)) return new Decimal(v);
+
+    // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor
+    // which points to Object.
+    x.constructor = Decimal;
+
+    if (isDecimalInstance(v)) {
+      x.s = v.s;
+
+      if (external) {
+        if (!v.d || v.e > Decimal.maxE) {
+
+          // Infinity.
+          x.e = NaN;
+          x.d = null;
+        } else if (v.e < Decimal.minE) {
+
+          // Zero.
+          x.e = 0;
+          x.d = [0];
+        } else {
+          x.e = v.e;
+          x.d = v.d.slice();
+        }
+      } else {
+        x.e = v.e;
+        x.d = v.d ? v.d.slice() : v.d;
+      }
+
+      return;
+    }
+
+    t = typeof v;
+
+    if (t === 'number') {
+      if (v === 0) {
+        x.s = 1 / v < 0 ? -1 : 1;
+        x.e = 0;
+        x.d = [0];
+        return;
+      }
+
+      if (v < 0) {
+        v = -v;
+        x.s = -1;
+      } else {
+        x.s = 1;
+      }
+
+      // Fast path for small integers.
+      if (v === ~~v && v < 1e7) {
+        for (e = 0, i = v; i >= 10; i /= 10) e++;
+
+        if (external) {
+          if (e > Decimal.maxE) {
+            x.e = NaN;
+            x.d = null;
+          } else if (e < Decimal.minE) {
+            x.e = 0;
+            x.d = [0];
+          } else {
+            x.e = e;
+            x.d = [v];
+          }
+        } else {
+          x.e = e;
+          x.d = [v];
+        }
+
+        return;
+      }
+
+      // Infinity or NaN?
+      if (v * 0 !== 0) {
+        if (!v) x.s = NaN;
+        x.e = NaN;
+        x.d = null;
+        return;
+      }
+
+      return parseDecimal(x, v.toString());
+    }
+
+    if (t === 'string') {
+      if ((i = v.charCodeAt(0)) === 45) {  // minus sign
+        v = v.slice(1);
+        x.s = -1;
+      } else {
+        if (i === 43) v = v.slice(1);  // plus sign
+        x.s = 1;
+      }
+
+      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);
+    }
+
+    if (t === 'bigint') {
+      if (v < 0) {
+        v = -v;
+        x.s = -1;
+      } else {
+        x.s = 1;
+      }
+
+      return parseDecimal(x, v.toString());
+    }
+
+    throw Error(invalidArgument + v);
+  }
+
+  Decimal.prototype = P;
+
+  Decimal.ROUND_UP = 0;
+  Decimal.ROUND_DOWN = 1;
+  Decimal.ROUND_CEIL = 2;
+  Decimal.ROUND_FLOOR = 3;
+  Decimal.ROUND_HALF_UP = 4;
+  Decimal.ROUND_HALF_DOWN = 5;
+  Decimal.ROUND_HALF_EVEN = 6;
+  Decimal.ROUND_HALF_CEIL = 7;
+  Decimal.ROUND_HALF_FLOOR = 8;
+  Decimal.EUCLID = 9;
+
+  Decimal.config = Decimal.set = config;
+  Decimal.clone = clone;
+  Decimal.isDecimal = isDecimalInstance;
+
+  Decimal.abs = abs;
+  Decimal.acos = acos;
+  Decimal.acosh = acosh;        // ES6
+  Decimal.add = add;
+  Decimal.asin = asin;
+  Decimal.asinh = asinh;        // ES6
+  Decimal.atan = atan;
+  Decimal.atanh = atanh;        // ES6
+  Decimal.atan2 = atan2;
+  Decimal.cbrt = cbrt;          // ES6
+  Decimal.ceil = ceil;
+  Decimal.clamp = clamp;
+  Decimal.cos = cos;
+  Decimal.cosh = cosh;          // ES6
+  Decimal.div = div;
+  Decimal.exp = exp;
+  Decimal.floor = floor;
+  Decimal.hypot = hypot;        // ES6
+  Decimal.ln = ln;
+  Decimal.log = log;
+  Decimal.log10 = log10;        // ES6
+  Decimal.log2 = log2;          // ES6
+  Decimal.max = max;
+  Decimal.min = min;
+  Decimal.mod = mod;
+  Decimal.mul = mul;
+  Decimal.pow = pow;
+  Decimal.random = random;
+  Decimal.round = round;
+  Decimal.sign = sign;          // ES6
+  Decimal.sin = sin;
+  Decimal.sinh = sinh;          // ES6
+  Decimal.sqrt = sqrt;
+  Decimal.sub = sub;
+  Decimal.sum = sum;
+  Decimal.tan = tan;
+  Decimal.tanh = tanh;          // ES6
+  Decimal.trunc = trunc;        // ES6
+
+  if (obj === void 0) obj = {};
+  if (obj) {
+    if (obj.defaults !== true) {
+      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];
+      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];
+    }
+  }
+
+  Decimal.config(obj);
+
+  return Decimal;
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ * y {number|string|bigint|Decimal}
+ *
+ */
+function div(x, y) {
+  return new this(x).div(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} The power to which to raise the base of the natural log.
+ *
+ */
+function exp(x) {
+  return new this(x).exp();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function floor(x) {
+  return finalise(x = new this(x), x.e + 1, 3);
+}
+
+
+/*
+ * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,
+ * rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+ */
+function hypot() {
+  var i, n,
+    t = new this(0);
+
+  external = false;
+
+  for (i = 0; i < arguments.length;) {
+    n = new this(arguments[i++]);
+    if (!n.d) {
+      if (n.s) {
+        external = true;
+        return new this(1 / 0);
+      }
+      t = n;
+    } else if (t.d) {
+      t = t.plus(n.times(n));
+    }
+  }
+
+  external = true;
+
+  return t.sqrt();
+}
+
+
+/*
+ * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),
+ * otherwise return false.
+ *
+ */
+function isDecimalInstance(obj) {
+  return obj instanceof Decimal || obj && obj.toStringTag === tag || false;
+}
+
+
+/*
+ * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function ln(x) {
+  return new this(x).ln();
+}
+
+
+/*
+ * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base
+ * is specified, rounded to `precision` significant digits using rounding mode `rounding`.
+ *
+ * log[y](x)
+ *
+ * x {number|string|bigint|Decimal} The argument of the logarithm.
+ * y {number|string|bigint|Decimal} The base of the logarithm.
+ *
+ */
+function log(x, y) {
+  return new this(x).log(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function log2(x) {
+  return new this(x).log(2);
+}
+
+
+/*
+ * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function log10(x) {
+  return new this(x).log(10);
+}
+
+
+/*
+ * Return a new Decimal whose value is the maximum of the arguments.
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+ */
+function max() {
+  return maxOrMin(this, arguments, -1);
+}
+
+
+/*
+ * Return a new Decimal whose value is the minimum of the arguments.
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+ */
+function min() {
+  return maxOrMin(this, arguments, 1);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ * y {number|string|bigint|Decimal}
+ *
+ */
+function mod(x, y) {
+  return new this(x).mod(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ * y {number|string|bigint|Decimal}
+ *
+ */
+function mul(x, y) {
+  return new this(x).mul(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} The base.
+ * y {number|string|bigint|Decimal} The exponent.
+ *
+ */
+function pow(x, y) {
+  return new this(x).pow(y);
+}
+
+
+/*
+ * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with
+ * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros
+ * are produced).
+ *
+ * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.
+ *
+ */
+function random(sd) {
+  var d, e, k, n,
+    i = 0,
+    r = new this(1),
+    rd = [];
+
+  if (sd === void 0) sd = this.precision;
+  else checkInt32(sd, 1, MAX_DIGITS);
+
+  k = Math.ceil(sd / LOG_BASE);
+
+  if (!this.crypto) {
+    for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;
+
+  // Browsers supporting crypto.getRandomValues.
+  } else if (crypto.getRandomValues) {
+    d = crypto.getRandomValues(new Uint32Array(k));
+
+    for (; i < k;) {
+      n = d[i];
+
+      // 0 <= n < 4294967296
+      // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).
+      if (n >= 4.29e9) {
+        d[i] = crypto.getRandomValues(new Uint32Array(1))[0];
+      } else {
+
+        // 0 <= n <= 4289999999
+        // 0 <= (n % 1e7) <= 9999999
+        rd[i++] = n % 1e7;
+      }
+    }
+
+  // Node.js supporting crypto.randomBytes.
+  } else if (crypto.randomBytes) {
+
+    // buffer
+    d = crypto.randomBytes(k *= 4);
+
+    for (; i < k;) {
+
+      // 0 <= n < 2147483648
+      n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);
+
+      // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).
+      if (n >= 2.14e9) {
+        crypto.randomBytes(4).copy(d, i);
+      } else {
+
+        // 0 <= n <= 2139999999
+        // 0 <= (n % 1e7) <= 9999999
+        rd.push(n % 1e7);
+        i += 4;
+      }
+    }
+
+    i = k / 4;
+  } else {
+    throw Error(cryptoUnavailable);
+  }
+
+  k = rd[--i];
+  sd %= LOG_BASE;
+
+  // Convert trailing digits to zeros according to sd.
+  if (k && sd) {
+    n = mathpow(10, LOG_BASE - sd);
+    rd[i] = (k / n | 0) * n;
+  }
+
+  // Remove trailing words which are zero.
+  for (; rd[i] === 0; i--) rd.pop();
+
+  // Zero?
+  if (i < 0) {
+    e = 0;
+    rd = [0];
+  } else {
+    e = -1;
+
+    // Remove leading words which are zero and adjust exponent accordingly.
+    for (; rd[0] === 0; e -= LOG_BASE) rd.shift();
+
+    // Count the digits of the first word of rd to determine leading zeros.
+    for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;
+
+    // Adjust the exponent for leading zeros of the first word of rd.
+    if (k < LOG_BASE) e -= LOG_BASE - k;
+  }
+
+  r.e = e;
+  r.d = rd;
+
+  return r;
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.
+ *
+ * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function round(x) {
+  return finalise(x = new this(x), x.e + 1, this.rounding);
+}
+
+
+/*
+ * Return
+ *   1    if x > 0,
+ *  -1    if x < 0,
+ *   0    if x is 0,
+ *  -0    if x is -0,
+ *   NaN  otherwise
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function sign(x) {
+  x = new this(x);
+  return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;
+}
+
+
+/*
+ * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function sin(x) {
+  return new this(x).sin();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function sinh(x) {
+  return new this(x).sinh();
+}
+
+
+/*
+ * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function sqrt(x) {
+  return new this(x).sqrt();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits
+ * using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal}
+ * y {number|string|bigint|Decimal}
+ *
+ */
+function sub(x, y) {
+  return new this(x).sub(y);
+}
+
+
+/*
+ * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * Only the result is rounded, not the intermediate calculations.
+ *
+ * arguments {number|string|bigint|Decimal}
+ *
+ */
+function sum() {
+  var i = 0,
+    args = arguments,
+    x = new this(args[i]);
+
+  external = false;
+  for (; x.s && ++i < args.length;) x = x.plus(args[i]);
+  external = true;
+
+  return finalise(x, this.precision, this.rounding);
+}
+
+
+/*
+ * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant
+ * digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function tan(x) {
+  return new this(x).tan();
+}
+
+
+/*
+ * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`
+ * significant digits using rounding mode `rounding`.
+ *
+ * x {number|string|bigint|Decimal} A value in radians.
+ *
+ */
+function tanh(x) {
+  return new this(x).tanh();
+}
+
+
+/*
+ * Return a new Decimal whose value is `x` truncated to an integer.
+ *
+ * x {number|string|bigint|Decimal}
+ *
+ */
+function trunc(x) {
+  return finalise(x = new this(x), x.e + 1, 1);
+}
+
+
+P[Symbol.for('nodejs.util.inspect.custom')] = P.toString;
+P[Symbol.toStringTag] = 'Decimal';
+
+// Create and configure initial Decimal constructor.
+export var Decimal = P.constructor = clone(DEFAULTS);
+
+// Create the internal constants from their string values.
+LN10 = new Decimal(LN10);
+PI = new Decimal(PI);
+
+export default Decimal;
diff --git a/node_modules/decimal.js/package.json b/node_modules/decimal.js/package.json
new file mode 100644
index 0000000..601307d
--- /dev/null
+++ b/node_modules/decimal.js/package.json
@@ -0,0 +1,55 @@
+{
+  "name": "decimal.js",
+  "description": "An arbitrary-precision Decimal type for JavaScript.",
+  "version": "10.6.0",
+  "keywords": [
+    "arbitrary",
+    "precision",
+    "arithmetic",
+    "big",
+    "number",
+    "decimal",
+    "float",
+    "biginteger",
+    "bigdecimal",
+    "bignumber",
+    "bigint",
+    "bignum"
+  ],
+  "repository" : {
+    "type": "git",
+    "url": "https://github.com/MikeMcl/decimal.js.git"
+  },
+  "main": "decimal",
+  "module": "decimal.mjs",
+  "browser": "decimal.js",
+  "exports": {
+    ".": {
+      "types": "./decimal.d.ts",
+      "import": "./decimal.mjs",
+      "require": "./decimal.js"
+    },
+    "./decimal.mjs": "./decimal.mjs",
+    "./decimal.js": "./decimal.js",
+    "./package.json": "./package.json",
+    "./decimal": {
+      "types": "./decimal.d.ts",
+      "import": "./decimal.mjs",
+      "require": "./decimal.js"
+    }
+  },
+  "author": {
+    "name": "Michael Mclaughlin",
+    "email": "M8ch88l@gmail.com"
+  },
+  "license": "MIT",
+  "scripts": {
+    "test": "node ./test/test.js"
+  },
+  "types": "decimal.d.ts",
+  "files": [
+    "decimal.js",
+    "decimal.mjs",
+    "decimal.d.ts"
+  ]
+}
diff --git a/node_modules/denque/CHANGELOG.md b/node_modules/denque/CHANGELOG.md
new file mode 100644
index 0000000..391a1f5
--- /dev/null
+++ b/node_modules/denque/CHANGELOG.md
@@ -0,0 +1,29 @@
+## 2.1.0
+
+ - fix: issue where `clear()` is still keeping references to the elements (#47)
+ - refactor: performance optimizations for growth and array copy (#43)
+ - refactor: performance optimizations for toArray and fromArray (#46)
+ - test: add additional benchmarks for queue growth and `toArray` (#45)
+
+## 2.0.1
+
+ - fix(types): incorrect return type on `size()`
+
+## 2.0.0
+
+ - fix!: `push` & `unshift` now accept `undefined` values to match behaviour of `Array` (fixes #25) (#35)
+   - This is only a **BREAKING** change if you are currently expecting `push(undefined)` and `unshift(undefined)` to do
+     nothing - the new behaviour now correctly adds undefined values to the queue.
+   - **Note**: behaviour of `push()` & `unshift()` (no arguments) remains unchanged (nothing gets added to the queue).
+   - **Note**: If you need to differentiate between `undefined` values in the queue and the return value of `pop()` then
+     check the queue `.length` before popping.
+ - fix: incorrect methods in types definition file
+
+## 1.5.1
+
+ - perf: minor performance tweak when growing queue size (#29)
+
+## 1.5.0
+
+ - feat: adds capacity option for circular buffers (#27)
+
diff --git a/node_modules/denque/LICENSE b/node_modules/denque/LICENSE
new file mode 100644
index 0000000..c9cde92
--- /dev/null
+++ b/node_modules/denque/LICENSE
@@ -0,0 +1,201 @@
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2018-present Invertase Limited
+
+   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.
diff --git a/node_modules/denque/README.md b/node_modules/denque/README.md
new file mode 100644
index 0000000..3c645d3
--- /dev/null
+++ b/node_modules/denque/README.md
@@ -0,0 +1,77 @@
+<p align="center">
+  <h1 align="center">Denque</h1>
+</p>
+
+<p align="center">
+  <a href="https://www.npmjs.com/package/denque"><img src="https://img.shields.io/npm/dm/denque.svg?style=flat-square" alt="NPM downloads"></a>
+  <a href="https://www.npmjs.com/package/denque"><img src="https://img.shields.io/npm/v/denque.svg?style=flat-square" alt="NPM version"></a>
+  <a href="https://github.com/invertase/denque/actions/workflows/testing.yam"><img src="https://github.com/invertase/denque/actions/workflows/testing.yaml/badge.svg" alt="Tests status"></a>
+  <a href="https://codecov.io/gh/invertase/denque"><img src="https://codecov.io/gh/invertase/denque/branch/master/graph/badge.svg?token=rn91iI4bSe" alt="Coverage"></a>
+  <a href="/LICENSE"><img src="https://img.shields.io/npm/l/denque.svg?style=flat-square" alt="License"></a>
+  <a href="https://twitter.com/invertaseio"><img src="https://img.shields.io/twitter/follow/invertaseio.svg?style=social&label=Follow" alt="Follow on Twitter"></a>
+</p>
+
+Denque is a well tested, extremely fast and lightweight [double-ended queue](http://en.wikipedia.org/wiki/Double-ended_queue)
+implementation with zero dependencies and includes TypeScript types.
+
+Double-ended queues can also be used as a:
+
+- [Stack](http://en.wikipedia.org/wiki/Stack_\(abstract_data_type\))
+- [Queue](http://en.wikipedia.org/wiki/Queue_\(data_structure\))
+
+This implementation is currently the fastest available, even faster than `double-ended-queue`, see the [benchmarks](https://docs.page/invertase/denque/benchmarks).
+
+Every queue operation is done at a constant `O(1)` - including random access from `.peekAt(index)`.
+
+**Works on all node versions >= v0.10**
+
+## Quick Start
+
+Install the package:
+
+```bash
+npm install denque
+```
+
+Create and consume a queue:
+
+```js
+const Denque = require("denque");
+
+const denque = new Denque([1,2,3,4]);
+denque.shift(); // 1
+denque.pop(); // 4
+```
+
+
+See the [API reference documentation](https://docs.page/invertase/denque/api) for more examples.
+
+---
+
+## Who's using it?
+
+- [Kafka Node.js client](https://www.npmjs.com/package/kafka-node)
+- [MariaDB Node.js client](https://www.npmjs.com/package/mariadb)
+- [MongoDB Node.js client](https://www.npmjs.com/package/mongodb)
+- [MySQL Node.js client](https://www.npmjs.com/package/mysql2)
+- [Redis Node.js clients](https://www.npmjs.com/package/redis)
+
+... and [many more](https://www.npmjs.com/browse/depended/denque).
+
+
+---
+
+## License
+
+- See [LICENSE](/LICENSE)
+
+---
+
+<p align="center">
+  <a href="https://invertase.io/?utm_source=readme&utm_medium=footer&utm_campaign=denque">
+    <img width="75px" src="https://static.invertase.io/assets/invertase/invertase-rounded-avatar.png">
+  </a>
+  <p align="center">
+    Built and maintained by <a href="https://invertase.io/?utm_source=readme&utm_medium=footer&utm_campaign=denque">Invertase</a>.
+  </p>
+</p>
diff --git a/node_modules/denque/index.d.ts b/node_modules/denque/index.d.ts
new file mode 100644
index 0000000..e125dd4
--- /dev/null
+++ b/node_modules/denque/index.d.ts
@@ -0,0 +1,47 @@
+declare class Denque<T = any> {
+  length: number;
+
+  constructor();
+
+  constructor(array: T[]);
+
+  constructor(array: T[], options: IDenqueOptions);
+
+  push(item: T): number;
+
+  unshift(item: T): number;
+
+  pop(): T | undefined;
+
+  shift(): T | undefined;
+
+  peekBack(): T | undefined;
+
+  peekFront(): T | undefined;
+
+  peekAt(index: number): T | undefined;
+
+  get(index: number): T | undefined;
+
+  remove(index: number, count: number): T[];
+
+  removeOne(index: number): T | undefined;
+
+  splice(index: number, count: number, ...item: T[]): T[] | undefined;
+
+  isEmpty(): boolean;
+
+  clear(): void;
+
+  size(): number;
+
+  toString(): string;
+
+  toArray(): T[];
+}
+
+interface IDenqueOptions {
+  capacity?: number
+}
+
+export = Denque;
diff --git a/node_modules/denque/index.js b/node_modules/denque/index.js
new file mode 100644
index 0000000..6b2e9d8
--- /dev/null
+++ b/node_modules/denque/index.js
@@ -0,0 +1,481 @@
+'use strict';
+
+/**
+ * Custom implementation of a double ended queue.
+ */
+function Denque(array, options) {
+  var options = options || {};
+  this._capacity = options.capacity;
+
+  this._head = 0;
+  this._tail = 0;
+
+  if (Array.isArray(array)) {
+    this._fromArray(array);
+  } else {
+    this._capacityMask = 0x3;
+    this._list = new Array(4);
+  }
+}
+
+/**
+ * --------------
+ *  PUBLIC API
+ * -------------
+ */
+
+/**
+ * Returns the item at the specified index from the list.
+ * 0 is the first element, 1 is the second, and so on...
+ * Elements at negative values are that many from the end: -1 is one before the end
+ * (the last element), -2 is two before the end (one before last), etc.
+ * @param index
+ * @returns {*}
+ */
+Denque.prototype.peekAt = function peekAt(index) {
+  var i = index;
+  // expect a number or return undefined
+  if ((i !== (i | 0))) {
+    return void 0;
+  }
+  var len = this.size();
+  if (i >= len || i < -len) return undefined;
+  if (i < 0) i += len;
+  i = (this._head + i) & this._capacityMask;
+  return this._list[i];
+};
+
+/**
+ * Alias for peekAt()
+ * @param i
+ * @returns {*}
+ */
+Denque.prototype.get = function get(i) {
+  return this.peekAt(i);
+};
+
+/**
+ * Returns the first item in the list without removing it.
+ * @returns {*}
+ */
+Denque.prototype.peek = function peek() {
+  if (this._head === this._tail) return undefined;
+  return this._list[this._head];
+};
+
+/**
+ * Alias for peek()
+ * @returns {*}
+ */
+Denque.prototype.peekFront = function peekFront() {
+  return this.peek();
+};
+
+/**
+ * Returns the item that is at the back of the queue without removing it.
+ * Uses peekAt(-1)
+ */
+Denque.prototype.peekBack = function peekBack() {
+  return this.peekAt(-1);
+};
+
+/**
+ * Returns the current length of the queue
+ * @return {Number}
+ */
+Object.defineProperty(Denque.prototype, 'length', {
+  get: function length() {
+    return this.size();
+  }
+});
+
+/**
+ * Return the number of items on the list, or 0 if empty.
+ * @returns {number}
+ */
+Denque.prototype.size = function size() {
+  if (this._head === this._tail) return 0;
+  if (this._head < this._tail) return this._tail - this._head;
+  else return this._capacityMask + 1 - (this._head - this._tail);
+};
+
+/**
+ * Add an item at the beginning of the list.
+ * @param item
+ */
+Denque.prototype.unshift = function unshift(item) {
+  if (arguments.length === 0) return this.size();
+  var len = this._list.length;
+  this._head = (this._head - 1 + len) & this._capacityMask;
+  this._list[this._head] = item;
+  if (this._tail === this._head) this._growArray();
+  if (this._capacity && this.size() > this._capacity) this.pop();
+  if (this._head < this._tail) return this._tail - this._head;
+  else return this._capacityMask + 1 - (this._head - this._tail);
+};
+
+/**
+ * Remove and return the first item on the list,
+ * Returns undefined if the list is empty.
+ * @returns {*}
+ */
+Denque.prototype.shift = function shift() {
+  var head = this._head;
+  if (head === this._tail) return undefined;
+  var item = this._list[head];
+  this._list[head] = undefined;
+  this._head = (head + 1) & this._capacityMask;
+  if (head < 2 && this._tail > 10000 && this._tail <= this._list.length >>> 2) this._shrinkArray();
+  return item;
+};
+
+/**
+ * Add an item to the bottom of the list.
+ * @param item
+ */
+Denque.prototype.push = function push(item) {
+  if (arguments.length === 0) return this.size();
+  var tail = this._tail;
+  this._list[tail] = item;
+  this._tail = (tail + 1) & this._capacityMask;
+  if (this._tail === this._head) {
+    this._growArray();
+  }
+  if (this._capacity && this.size() > this._capacity) {
+    this.shift();
+  }
+  if (this._head < this._tail) return this._tail - this._head;
+  else return this._capacityMask + 1 - (this._head - this._tail);
+};
+
+/**
+ * Remove and return the last item on the list.
+ * Returns undefined if the list is empty.
+ * @returns {*}
+ */
+Denque.prototype.pop = function pop() {
+  var tail = this._tail;
+  if (tail === this._head) return undefined;
+  var len = this._list.length;
+  this._tail = (tail - 1 + len) & this._capacityMask;
+  var item = this._list[this._tail];
+  this._list[this._tail] = undefined;
+  if (this._head < 2 && tail > 10000 && tail <= len >>> 2) this._shrinkArray();
+  return item;
+};
+
+/**
+ * Remove and return the item at the specified index from the list.
+ * Returns undefined if the list is empty.
+ * @param index
+ * @returns {*}
+ */
+Denque.prototype.removeOne = function removeOne(index) {
+  var i = index;
+  // expect a number or return undefined
+  if ((i !== (i | 0))) {
+    return void 0;
+  }
+  if (this._head === this._tail) return void 0;
+  var size = this.size();
+  var len = this._list.length;
+  if (i >= size || i < -size) return void 0;
+  if (i < 0) i += size;
+  i = (this._head + i) & this._capacityMask;
+  var item = this._list[i];
+  var k;
+  if (index < size / 2) {
+    for (k = index; k > 0; k--) {
+      this._list[i] = this._list[i = (i - 1 + len) & this._capacityMask];
+    }
+    this._list[i] = void 0;
+    this._head = (this._head + 1 + len) & this._capacityMask;
+  } else {
+    for (k = size - 1 - index; k > 0; k--) {
+      this._list[i] = this._list[i = (i + 1 + len) & this._capacityMask];
+    }
+    this._list[i] = void 0;
+    this._tail = (this._tail - 1 + len) & this._capacityMask;
+  }
+  return item;
+};
+
+/**
+ * Remove number of items from the specified index from the list.
+ * Returns array of removed items.
+ * Returns undefined if the list is empty.
+ * @param index
+ * @param count
+ * @returns {array}
+ */
+Denque.prototype.remove = function remove(index, count) {
+  var i = index;
+  var removed;
+  var del_count = count;
+  // expect a number or return undefined
+  if ((i !== (i | 0))) {
+    return void 0;
+  }
+  if (this._head === this._tail) return void 0;
+  var size = this.size();
+  var len = this._list.length;
+  if (i >= size || i < -size || count < 1) return void 0;
+  if (i < 0) i += size;
+  if (count === 1 || !count) {
+    removed = new Array(1);
+    removed[0] = this.removeOne(i);
+    return removed;
+  }
+  if (i === 0 && i + count >= size) {
+    removed = this.toArray();
+    this.clear();
+    return removed;
+  }
+  if (i + count > size) count = size - i;
+  var k;
+  removed = new Array(count);
+  for (k = 0; k < count; k++) {
+    removed[k] = this._list[(this._head + i + k) & this._capacityMask];
+  }
+  i = (this._head + i) & this._capacityMask;
+  if (index + count === size) {
+    this._tail = (this._tail - count + len) & this._capacityMask;
+    for (k = count; k > 0; k--) {
+      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;
+    }
+    return removed;
+  }
+  if (index === 0) {
+    this._head = (this._head + count + len) & this._capacityMask;
+    for (k = count - 1; k > 0; k--) {
+      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;
+    }
+    return removed;
+  }
+  if (i < size / 2) {
+    this._head = (this._head + index + count + len) & this._capacityMask;
+    for (k = index; k > 0; k--) {
+      this.unshift(this._list[i = (i - 1 + len) & this._capacityMask]);
+    }
+    i = (this._head - 1 + len) & this._capacityMask;
+    while (del_count > 0) {
+      this._list[i = (i - 1 + len) & this._capacityMask] = void 0;
+      del_count--;
+    }
+    if (index < 0) this._tail = i;
+  } else {
+    this._tail = i;
+    i = (i + count + len) & this._capacityMask;
+    for (k = size - (count + index); k > 0; k--) {
+      this.push(this._list[i++]);
+    }
+    i = this._tail;
+    while (del_count > 0) {
+      this._list[i = (i + 1 + len) & this._capacityMask] = void 0;
+      del_count--;
+    }
+  }
+  if (this._head < 2 && this._tail > 10000 && this._tail <= len >>> 2) this._shrinkArray();
+  return removed;
+};
+
+/**
+ * Native splice implementation.
+ * Remove number of items from the specified index from the list and/or add new elements.
+ * Returns array of removed items or empty array if count == 0.
+ * Returns undefined if the list is empty.
+ *
+ * @param index
+ * @param count
+ * @param {...*} [elements]
+ * @returns {array}
+ */
+Denque.prototype.splice = function splice(index, count) {
+  var i = index;
+  // expect a number or return undefined
+  if ((i !== (i | 0))) {
+    return void 0;
+  }
+  var size = this.size();
+  if (i < 0) i += size;
+  if (i > size) return void 0;
+  if (arguments.length > 2) {
+    var k;
+    var temp;
+    var removed;
+    var arg_len = arguments.length;
+    var len = this._list.length;
+    var arguments_index = 2;
+    if (!size || i < size / 2) {
+      temp = new Array(i);
+      for (k = 0; k < i; k++) {
+        temp[k] = this._list[(this._head + k) & this._capacityMask];
+      }
+      if (count === 0) {
+        removed = [];
+        if (i > 0) {
+          this._head = (this._head + i + len) & this._capacityMask;
+        }
+      } else {
+        removed = this.remove(i, count);
+        this._head = (this._head + i + len) & this._capacityMask;
+      }
+      while (arg_len > arguments_index) {
+        this.unshift(arguments[--arg_len]);
+      }
+      for (k = i; k > 0; k--) {
+        this.unshift(temp[k - 1]);
+      }
+    } else {
+      temp = new Array(size - (i + count));
+      var leng = temp.length;
+      for (k = 0; k < leng; k++) {
+        temp[k] = this._list[(this._head + i + count + k) & this._capacityMask];
+      }
+      if (count === 0) {
+        removed = [];
+        if (i != size) {
+          this._tail = (this._head + i + len) & this._capacityMask;
+        }
+      } else {
+        removed = this.remove(i, count);
+        this._tail = (this._tail - leng + len) & this._capacityMask;
+      }
+      while (arguments_index < arg_len) {
+        this.push(arguments[arguments_index++]);
+      }
+      for (k = 0; k < leng; k++) {
+        this.push(temp[k]);
+      }
+    }
+    return removed;
+  } else {
+    return this.remove(i, count);
+  }
+};
+
+/**
+ * Soft clear - does not reset capacity.
+ */
+Denque.prototype.clear = function clear() {
+  this._list = new Array(this._list.length);
+  this._head = 0;
+  this._tail = 0;
+};
+
+/**
+ * Returns true or false whether the list is empty.
+ * @returns {boolean}
+ */
+Denque.prototype.isEmpty = function isEmpty() {
+  return this._head === this._tail;
+};
+
+/**
+ * Returns an array of all queue items.
+ * @returns {Array}
+ */
+Denque.prototype.toArray = function toArray() {
+  return this._copyArray(false);
+};
+
+/**
+ * -------------
+ *   INTERNALS
+ * -------------
+ */
+
+/**
+ * Fills the queue with items from an array
+ * For use in the constructor
+ * @param array
+ * @private
+ */
+Denque.prototype._fromArray = function _fromArray(array) {
+  var length = array.length;
+  var capacity = this._nextPowerOf2(length);
+
+  this._list = new Array(capacity);
+  this._capacityMask = capacity - 1;
+  this._tail = length;
+
+  for (var i = 0; i < length; i++) this._list[i] = array[i];
+};
+
+/**
+ *
+ * @param fullCopy
+ * @param size Initialize the array with a specific size. Will default to the current list size
+ * @returns {Array}
+ * @private
+ */
+Denque.prototype._copyArray = function _copyArray(fullCopy, size) {
+  var src = this._list;
+  var capacity = src.length;
+  var length = this.length;
+  size = size | length;
+
+  // No prealloc requested and the buffer is contiguous
+  if (size == length && this._head < this._tail) {
+    // Simply do a fast slice copy
+    return this._list.slice(this._head, this._tail);
+  }
+
+  var dest = new Array(size);
+
+  var k = 0;
+  var i;
+  if (fullCopy || this._head > this._tail) {
+    for (i = this._head; i < capacity; i++) dest[k++] = src[i];
+    for (i = 0; i < this._tail; i++) dest[k++] = src[i];
+  } else {
+    for (i = this._head; i < this._tail; i++) dest[k++] = src[i];
+  }
+
+  return dest;
+}
+
+/**
+ * Grows the internal list array.
+ * @private
+ */
+Denque.prototype._growArray = function _growArray() {
+  if (this._head != 0) {
+    // double array size and copy existing data, head to end, then beginning to tail.
+    var newList = this._copyArray(true, this._list.length << 1);
+
+    this._tail = this._list.length;
+    this._head = 0;
+
+    this._list = newList;
+  } else {
+    this._tail = this._list.length;
+    this._list.length <<= 1;
+  }
+
+  this._capacityMask = (this._capacityMask << 1) | 1;
+};
+
+/**
+ * Shrinks the internal list array.
+ * @private
+ */
+Denque.prototype._shrinkArray = function _shrinkArray() {
+  this._list.length >>>= 1;
+  this._capacityMask >>>= 1;
+};
+
+/**
+ * Find the next power of 2, at least 4
+ * @private
+ * @param {number} num 
+ * @returns {number}
+ */
+Denque.prototype._nextPowerOf2 = function _nextPowerOf2(num) {
+  var log2 = Math.log(num) / Math.log(2);
+  var nextPow2 = 1 << (log2 + 1);
+
+  return Math.max(nextPow2, 4);
+}
+
+module.exports = Denque;
diff --git a/node_modules/denque/package.json b/node_modules/denque/package.json
new file mode 100644
index 0000000..a635910
--- /dev/null
+++ b/node_modules/denque/package.json
@@ -0,0 +1,58 @@
+{
+  "name": "denque",
+  "version": "2.1.0",
+  "description": "The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.",
+  "main": "index.js",
+  "engines": {
+    "node": ">=0.10"
+  },
+  "keywords": [
+    "data-structure",
+    "data-structures",
+    "queue",
+    "double",
+    "end",
+    "ended",
+    "deque",
+    "denque",
+    "double-ended-queue"
+  ],
+  "scripts": {
+    "test": "istanbul cover --report lcov _mocha && npm run typescript",
+    "coveralls": "cat ./coverage/lcov.info | coveralls",
+    "typescript": "tsc --project ./test/type/tsconfig.json",
+    "benchmark_thousand": "node benchmark/thousand",
+    "benchmark_2mil": "node benchmark/two_million",
+    "benchmark_splice": "node benchmark/splice",
+    "benchmark_remove": "node benchmark/remove",
+    "benchmark_removeOne": "node benchmark/removeOne",
+    "benchmark_growth": "node benchmark/growth",
+    "benchmark_toArray": "node benchmark/toArray",
+    "benchmark_fromArray": "node benchmark/fromArray"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/invertase/denque.git"
+  },
+  "license": "Apache-2.0",
+  "author": {
+    "name": "Invertase",
+    "email": "oss@invertase.io",
+    "url": "http://github.com/invertase/"
+  },
+  "contributors": [
+    "Mike Diarmid (Salakar) <mike@invertase.io>"
+  ],
+  "bugs": {
+    "url": "https://github.com/invertase/denque/issues"
+  },
+  "homepage": "https://docs.page/invertase/denque",
+  "devDependencies": {
+    "benchmark": "^2.1.4",
+    "codecov": "^3.8.3",
+    "double-ended-queue": "^2.1.0-0",
+    "istanbul": "^0.4.5",
+    "mocha": "^3.5.3",
+    "typescript": "^3.4.1"
+  }
+}
diff --git a/node_modules/detect-libc/LICENSE b/node_modules/detect-libc/LICENSE
new file mode 100644
index 0000000..8dada3e
--- /dev/null
+++ b/node_modules/detect-libc/LICENSE
@@ -0,0 +1,201 @@
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   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.
diff --git a/node_modules/detect-libc/README.md b/node_modules/detect-libc/README.md
new file mode 100644
index 0000000..23212fd
--- /dev/null
+++ b/node_modules/detect-libc/README.md
@@ -0,0 +1,163 @@
+# detect-libc
+
+Node.js module to detect details of the C standard library (libc)
+implementation provided by a given Linux system.
+
+Currently supports detection of GNU glibc and MUSL libc.
+
+Provides asychronous and synchronous functions for the
+family (e.g. `glibc`, `musl`) and version (e.g. `1.23`, `1.2.3`).
+
+The version numbers of libc implementations
+are not guaranteed to be semver-compliant.
+
+For previous v1.x releases, please see the
+[v1](https://github.com/lovell/detect-libc/tree/v1) branch.
+
+## Install
+
+```sh
+npm install detect-libc
+```
+
+## API
+
+### GLIBC
+
+```ts
+const GLIBC: string = 'glibc';
+```
+
+A String constant containing the value `glibc`.
+
+### MUSL
+
+```ts
+const MUSL: string = 'musl';
+```
+
+A String constant containing the value `musl`.
+
+### family
+
+```ts
+function family(): Promise<string | null>;
+```
+
+Resolves asychronously with:
+
+* `glibc` or `musl` when the libc family can be determined
+* `null` when the libc family cannot be determined
+* `null` when run on a non-Linux platform
+
+```js
+const { family, GLIBC, MUSL } = require('detect-libc');
+
+switch (await family()) {
+  case GLIBC: ...
+  case MUSL: ...
+  case null: ...
+}
+```
+
+### familySync
+
+```ts
+function familySync(): string | null;
+```
+
+Synchronous version of `family()`.
+
+```js
+const { familySync, GLIBC, MUSL } = require('detect-libc');
+
+switch (familySync()) {
+  case GLIBC: ...
+  case MUSL: ...
+  case null: ...
+}
+```
+
+### version
+
+```ts
+function version(): Promise<string | null>;
+```
+
+Resolves asychronously with:
+
+* The version when it can be determined
+* `null` when the libc family cannot be determined
+* `null` when run on a non-Linux platform
+
+```js
+const { version } = require('detect-libc');
+
+const v = await version();
+if (v) {
+  const [major, minor, patch] = v.split('.');
+}
+```
+
+### versionSync
+
+```ts
+function versionSync(): string | null;
+```
+
+Synchronous version of `version()`.
+
+```js
+const { versionSync } = require('detect-libc');
+
+const v = versionSync();
+if (v) {
+  const [major, minor, patch] = v.split('.');
+}
+```
+
+### isNonGlibcLinux
+
+```ts
+function isNonGlibcLinux(): Promise<boolean>;
+```
+
+Resolves asychronously with:
+
+* `false` when the libc family is `glibc`
+* `true` when the libc family is not `glibc`
+* `false` when run on a non-Linux platform
+
+```js
+const { isNonGlibcLinux } = require('detect-libc');
+
+if (await isNonGlibcLinux()) { ... }
+```
+
+### isNonGlibcLinuxSync
+
+```ts
+function isNonGlibcLinuxSync(): boolean;
+```
+
+Synchronous version of `isNonGlibcLinux()`.
+
+```js
+const { isNonGlibcLinuxSync } = require('detect-libc');
+
+if (isNonGlibcLinuxSync()) { ... }
+```
+
+## Licensing
+
+Copyright 2017 Lovell Fuller and others.
+
+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](http://www.apache.org/licenses/LICENSE-2.0.html)
+
+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.
diff --git a/node_modules/detect-libc/index.d.ts b/node_modules/detect-libc/index.d.ts
new file mode 100644
index 0000000..4c0fb2b
--- /dev/null
+++ b/node_modules/detect-libc/index.d.ts
@@ -0,0 +1,14 @@
+// Copyright 2017 Lovell Fuller and others.
+// SPDX-License-Identifier: Apache-2.0
+
+export const GLIBC: 'glibc';
+export const MUSL: 'musl';
+
+export function family(): Promise<string | null>;
+export function familySync(): string | null;
+
+export function isNonGlibcLinux(): Promise<boolean>;
+export function isNonGlibcLinuxSync(): boolean;
+
+export function version(): Promise<string | null>;
+export function versionSync(): string | null;
diff --git a/node_modules/detect-libc/lib/detect-libc.js b/node_modules/detect-libc/lib/detect-libc.js
new file mode 100644
index 0000000..01299b4
--- /dev/null
+++ b/node_modules/detect-libc/lib/detect-libc.js
@@ -0,0 +1,313 @@
+// Copyright 2017 Lovell Fuller and others.
+// SPDX-License-Identifier: Apache-2.0
+
+'use strict';
+
+const childProcess = require('child_process');
+const { isLinux, getReport } = require('./process');
+const { LDD_PATH, SELF_PATH, readFile, readFileSync } = require('./filesystem');
+const { interpreterPath } = require('./elf');
+
+let cachedFamilyInterpreter;
+let cachedFamilyFilesystem;
+let cachedVersionFilesystem;
+
+const command = 'getconf GNU_LIBC_VERSION 2>&1 || true; ldd --version 2>&1 || true';
+let commandOut = '';
+
+const safeCommand = () => {
+  if (!commandOut) {
+    return new Promise((resolve) => {
+      childProcess.exec(command, (err, out) => {
+        commandOut = err ? ' ' : out;
+        resolve(commandOut);
+      });
+    });
+  }
+  return commandOut;
+};
+
+const safeCommandSync = () => {
+  if (!commandOut) {
+    try {
+      commandOut = childProcess.execSync(command, { encoding: 'utf8' });
+    } catch (_err) {
+      commandOut = ' ';
+    }
+  }
+  return commandOut;
+};
+
+/**
+ * A String constant containing the value `glibc`.
+ * @type {string}
+ * @public
+ */
+const GLIBC = 'glibc';
+
+/**
+ * A Regexp constant to get the GLIBC Version.
+ * @type {string}
+ */
+const RE_GLIBC_VERSION = /LIBC[a-z0-9 \-).]*?(\d+\.\d+)/i;
+
+/**
+ * A String constant containing the value `musl`.
+ * @type {string}
+ * @public
+ */
+const MUSL = 'musl';
+
+const isFileMusl = (f) => f.includes('libc.musl-') || f.includes('ld-musl-');
+
+const familyFromReport = () => {
+  const report = getReport();
+  if (report.header && report.header.glibcVersionRuntime) {
+    return GLIBC;
+  }
+  if (Array.isArray(report.sharedObjects)) {
+    if (report.sharedObjects.some(isFileMusl)) {
+      return MUSL;
+    }
+  }
+  return null;
+};
+
+const familyFromCommand = (out) => {
+  const [getconf, ldd1] = out.split(/[\r\n]+/);
+  if (getconf && getconf.includes(GLIBC)) {
+    return GLIBC;
+  }
+  if (ldd1 && ldd1.includes(MUSL)) {
+    return MUSL;
+  }
+  return null;
+};
+
+const familyFromInterpreterPath = (path) => {
+  if (path) {
+    if (path.includes('/ld-musl-')) {
+      return MUSL;
+    } else if (path.includes('/ld-linux-')) {
+      return GLIBC;
+    }
+  }
+  return null;
+};
+
+const getFamilyFromLddContent = (content) => {
+  content = content.toString();
+  if (content.includes('musl')) {
+    return MUSL;
+  }
+  if (content.includes('GNU C Library')) {
+    return GLIBC;
+  }
+  return null;
+};
+
+const familyFromFilesystem = async () => {
+  if (cachedFamilyFilesystem !== undefined) {
+    return cachedFamilyFilesystem;
+  }
+  cachedFamilyFilesystem = null;
+  try {
+    const lddContent = await readFile(LDD_PATH);
+    cachedFamilyFilesystem = getFamilyFromLddContent(lddContent);
+  } catch (e) {}
+  return cachedFamilyFilesystem;
+};
+
+const familyFromFilesystemSync = () => {
+  if (cachedFamilyFilesystem !== undefined) {
+    return cachedFamilyFilesystem;
+  }
+  cachedFamilyFilesystem = null;
+  try {
+    const lddContent = readFileSync(LDD_PATH);
+    cachedFamilyFilesystem = getFamilyFromLddContent(lddContent);
+  } catch (e) {}
+  return cachedFamilyFilesystem;
+};
+
+const familyFromInterpreter = async () => {
+  if (cachedFamilyInterpreter !== undefined) {
+    return cachedFamilyInterpreter;
+  }
+  cachedFamilyInterpreter = null;
+  try {
+    const selfContent = await readFile(SELF_PATH);
+    const path = interpreterPath(selfContent);
+    cachedFamilyInterpreter = familyFromInterpreterPath(path);
+  } catch (e) {}
+  return cachedFamilyInterpreter;
+};
+
+const familyFromInterpreterSync = () => {
+  if (cachedFamilyInterpreter !== undefined) {
+    return cachedFamilyInterpreter;
+  }
+  cachedFamilyInterpreter = null;
+  try {
+    const selfContent = readFileSync(SELF_PATH);
+    const path = interpreterPath(selfContent);
+    cachedFamilyInterpreter = familyFromInterpreterPath(path);
+  } catch (e) {}
+  return cachedFamilyInterpreter;
+};
+
+/**
+ * Resolves with the libc family when it can be determined, `null` otherwise.
+ * @returns {Promise<?string>}
+ */
+const family = async () => {
+  let family = null;
+  if (isLinux()) {
+    family = await familyFromInterpreter();
+    if (!family) {
+      family = await familyFromFilesystem();
+      if (!family) {
+        family = familyFromReport();
+      }
+      if (!family) {
+        const out = await safeCommand();
+        family = familyFromCommand(out);
+      }
+    }
+  }
+  return family;
+};
+
+/**
+ * Returns the libc family when it can be determined, `null` otherwise.
+ * @returns {?string}
+ */
+const familySync = () => {
+  let family = null;
+  if (isLinux()) {
+    family = familyFromInterpreterSync();
+    if (!family) {
+      family = familyFromFilesystemSync();
+      if (!family) {
+        family = familyFromReport();
+      }
+      if (!family) {
+        const out = safeCommandSync();
+        family = familyFromCommand(out);
+      }
+    }
+  }
+  return family;
+};
+
+/**
+ * Resolves `true` only when the platform is Linux and the libc family is not `glibc`.
+ * @returns {Promise<boolean>}
+ */
+const isNonGlibcLinux = async () => isLinux() && await family() !== GLIBC;
+
+/**
+ * Returns `true` only when the platform is Linux and the libc family is not `glibc`.
+ * @returns {boolean}
+ */
+const isNonGlibcLinuxSync = () => isLinux() && familySync() !== GLIBC;
+
+const versionFromFilesystem = async () => {
+  if (cachedVersionFilesystem !== undefined) {
+    return cachedVersionFilesystem;
+  }
+  cachedVersionFilesystem = null;
+  try {
+    const lddContent = await readFile(LDD_PATH);
+    const versionMatch = lddContent.match(RE_GLIBC_VERSION);
+    if (versionMatch) {
+      cachedVersionFilesystem = versionMatch[1];
+    }
+  } catch (e) {}
+  return cachedVersionFilesystem;
+};
+
+const versionFromFilesystemSync = () => {
+  if (cachedVersionFilesystem !== undefined) {
+    return cachedVersionFilesystem;
+  }
+  cachedVersionFilesystem = null;
+  try {
+    const lddContent = readFileSync(LDD_PATH);
+    const versionMatch = lddContent.match(RE_GLIBC_VERSION);
+    if (versionMatch) {
+      cachedVersionFilesystem = versionMatch[1];
+    }
+  } catch (e) {}
+  return cachedVersionFilesystem;
+};
+
+const versionFromReport = () => {
+  const report = getReport();
+  if (report.header && report.header.glibcVersionRuntime) {
+    return report.header.glibcVersionRuntime;
+  }
+  return null;
+};
+
+const versionSuffix = (s) => s.trim().split(/\s+/)[1];
+
+const versionFromCommand = (out) => {
+  const [getconf, ldd1, ldd2] = out.split(/[\r\n]+/);
+  if (getconf && getconf.includes(GLIBC)) {
+    return versionSuffix(getconf);
+  }
+  if (ldd1 && ldd2 && ldd1.includes(MUSL)) {
+    return versionSuffix(ldd2);
+  }
+  return null;
+};
+
+/**
+ * Resolves with the libc version when it can be determined, `null` otherwise.
+ * @returns {Promise<?string>}
+ */
+const version = async () => {
+  let version = null;
+  if (isLinux()) {
+    version = await versionFromFilesystem();
+    if (!version) {
+      version = versionFromReport();
+    }
+    if (!version) {
+      const out = await safeCommand();
+      version = versionFromCommand(out);
+    }
+  }
+  return version;
+};
+
+/**
+ * Returns the libc version when it can be determined, `null` otherwise.
+ * @returns {?string}
+ */
+const versionSync = () => {
+  let version = null;
+  if (isLinux()) {
+    version = versionFromFilesystemSync();
+    if (!version) {
+      version = versionFromReport();
+    }
+    if (!version) {
+      const out = safeCommandSync();
+      version = versionFromCommand(out);
+    }
+  }
+  return version;
+};
+
+module.exports = {
+  GLIBC,
+  MUSL,
+  family,
+  familySync,
+  isNonGlibcLinux,
+  isNonGlibcLinuxSync,
+  version,
+  versionSync
+};
diff --git a/node_modules/detect-libc/lib/elf.js b/node_modules/detect-libc/lib/elf.js
new file mode 100644
index 0000000..aa166aa
--- /dev/null
+++ b/node_modules/detect-libc/lib/elf.js
@@ -0,0 +1,39 @@
+// Copyright 2017 Lovell Fuller and others.
+// SPDX-License-Identifier: Apache-2.0
+
+'use strict';
+
+const interpreterPath = (elf) => {
+  if (elf.length < 64) {
+    return null;
+  }
+  if (elf.readUInt32BE(0) !== 0x7F454C46) {
+    // Unexpected magic bytes
+    return null;
+  }
+  if (elf.readUInt8(4) !== 2) {
+    // Not a 64-bit ELF
+    return null;
+  }
+  if (elf.readUInt8(5) !== 1) {
+    // Not little-endian
+    return null;
+  }
+  const offset = elf.readUInt32LE(32);
+  const size = elf.readUInt16LE(54);
+  const count = elf.readUInt16LE(56);
+  for (let i = 0; i < count; i++) {
+    const headerOffset = offset + (i * size);
+    const type = elf.readUInt32LE(headerOffset);
+    if (type === 3) {
+      const fileOffset = elf.readUInt32LE(headerOffset + 8);
+      const fileSize = elf.readUInt32LE(headerOffset + 32);
+      return elf.subarray(fileOffset, fileOffset + fileSize).toString().replace(/\0.*$/g, '');
+    }
+  }
+  return null;
+};
+
+module.exports = {
+  interpreterPath
+};
diff --git a/node_modules/detect-libc/lib/filesystem.js b/node_modules/detect-libc/lib/filesystem.js
new file mode 100644
index 0000000..4c2443c
--- /dev/null
+++ b/node_modules/detect-libc/lib/filesystem.js
@@ -0,0 +1,51 @@
+// Copyright 2017 Lovell Fuller and others.
+// SPDX-License-Identifier: Apache-2.0
+
+'use strict';
+
+const fs = require('fs');
+
+const LDD_PATH = '/usr/bin/ldd';
+const SELF_PATH = '/proc/self/exe';
+const MAX_LENGTH = 2048;
+
+/**
+ * Read the content of a file synchronous
+ *
+ * @param {string} path
+ * @returns {Buffer}
+ */
+const readFileSync = (path) => {
+  const fd = fs.openSync(path, 'r');
+  const buffer = Buffer.alloc(MAX_LENGTH);
+  const bytesRead = fs.readSync(fd, buffer, 0, MAX_LENGTH, 0);
+  fs.close(fd, () => {});
+  return buffer.subarray(0, bytesRead);
+};
+
+/**
+ * Read the content of a file
+ *
+ * @param {string} path
+ * @returns {Promise<Buffer>}
+ */
+const readFile = (path) => new Promise((resolve, reject) => {
+  fs.open(path, 'r', (err, fd) => {
+    if (err) {
+      reject(err);
+    } else {
+      const buffer = Buffer.alloc(MAX_LENGTH);
+      fs.read(fd, buffer, 0, MAX_LENGTH, 0, (_, bytesRead) => {
+        resolve(buffer.subarray(0, bytesRead));
+        fs.close(fd, () => {});
+      });
+    }
+  });
+});
+
+module.exports = {
+  LDD_PATH,
+  SELF_PATH,
+  readFileSync,
+  readFile
+};
diff --git a/node_modules/detect-libc/lib/process.js b/node_modules/detect-libc/lib/process.js
new file mode 100644
index 0000000..ee78ad2
--- /dev/null
+++ b/node_modules/detect-libc/lib/process.js
@@ -0,0 +1,24 @@
+// Copyright 2017 Lovell Fuller and others.
+// SPDX-License-Identifier: Apache-2.0
+
+'use strict';
+
+const isLinux = () => process.platform === 'linux';
+
+let report = null;
+const getReport = () => {
+  if (!report) {
+    /* istanbul ignore next */
+    if (isLinux() && process.report) {
+      const orig = process.report.excludeNetwork;
+      process.report.excludeNetwork = true;
+      report = process.report.getReport();
+      process.report.excludeNetwork = orig;
+    } else {
+      report = {};
+    }
+  }
+  return report;
+};
+
+module.exports = { isLinux, getReport };
diff --git a/node_modules/detect-libc/package.json b/node_modules/detect-libc/package.json
new file mode 100644
index 0000000..36d0f2b
--- /dev/null
+++ b/node_modules/detect-libc/package.json
@@ -0,0 +1,44 @@
+{
+  "name": "detect-libc",
+  "version": "2.1.2",
+  "description": "Node.js module to detect the C standard library (libc) implementation family and version",
+  "main": "lib/detect-libc.js",
+  "files": [
+    "lib/",
+    "index.d.ts"
+  ],
+  "scripts": {
+    "test": "semistandard && nyc --reporter=text --check-coverage --branches=100 ava test/unit.js",
+    "changelog": "conventional-changelog -i CHANGELOG.md -s",
+    "bench": "node benchmark/detect-libc",
+    "bench:calls": "node benchmark/call-familySync.js && sleep 1 && node benchmark/call-isNonGlibcLinuxSync.js && sleep 1 && node benchmark/call-versionSync.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/lovell/detect-libc.git"
+  },
+  "keywords": [
+    "libc",
+    "glibc",
+    "musl"
+  ],
+  "author": "Lovell Fuller <npm@lovell.info>",
+  "contributors": [
+    "Niklas Salmoukas <niklas@salmoukas.com>",
+    "Vinícius Lourenço <vinyygamerlol@gmail.com>"
+  ],
+  "license": "Apache-2.0",
+  "devDependencies": {
+    "ava": "^2.4.0",
+    "benchmark": "^2.1.4",
+    "conventional-changelog-cli": "^5.0.0",
+    "eslint-config-standard": "^13.0.1",
+    "nyc": "^15.1.0",
+    "proxyquire": "^2.1.3",
+    "semistandard": "^14.2.3"
+  },
+  "engines": {
+    "node": ">=8"
+  },
+  "types": "index.d.ts"
+}
diff --git a/node_modules/dotenv/CHANGELOG.md b/node_modules/dotenv/CHANGELOG.md
new file mode 100644
index 0000000..8b80dd6
--- /dev/null
+++ b/node_modules/dotenv/CHANGELOG.md
@@ -0,0 +1,520 @@
+# Changelog
+
+All notable changes to this project will be documented in this file. See [standard-version](https://github.com/conventional-changelog/standard-version) for commit guidelines.
+
+## [Unreleased](https://github.com/motdotla/dotenv/compare/v16.6.1...master)
+
+## [16.6.1](https://github.com/motdotla/dotenv/compare/v16.6.0...v16.6.1) (2025-06-27)
+
+### Changed
+
+- Default `quiet` to true – hiding the runtime log message ([#874](https://github.com/motdotla/dotenv/pull/874))
+- NOTICE: 17.0.0 will be released with quiet defaulting to false. Use `config({ quiet: true })` to suppress.
+- And check out the new [dotenvx](https://github.com/dotenvx/dotenvx). As coding workflows evolve and agents increasingly handle secrets, encrypted .env files offer a much safer way to deploy both agents and code together with secure secrets. Simply switch `require('dotenv').config()` for `require('@dotenvx/dotenvx').config()`.
+
+## [16.6.0](https://github.com/motdotla/dotenv/compare/v16.5.0...v16.6.0) (2025-06-26)
+
+### Added
+
+- Default log helpful message `[dotenv@16.6.0] injecting env (1) from .env` ([#870](https://github.com/motdotla/dotenv/pull/870))
+- Use `{ quiet: true }` to suppress
+- Aligns dotenv more closely with [dotenvx](https://github.com/dotenvx/dotenvx).
+
+## [16.5.0](https://github.com/motdotla/dotenv/compare/v16.4.7...v16.5.0) (2025-04-07)
+
+### Added
+
+- 🎉 Added new sponsor [Graphite](https://graphite.dev/?utm_source=github&utm_medium=repo&utm_campaign=dotenv) - *the AI developer productivity platform helping teams on GitHub ship higher quality software, faster*.
+
+> [!TIP]
+> **[Become a sponsor](https://github.com/sponsors/motdotla)**
+> 
+> The dotenvx README is viewed thousands of times DAILY on GitHub and NPM.
+> Sponsoring dotenv is a great way to get in front of developers and give back to the developer community at the same time.
+
+### Changed
+
+- Remove `_log` method. Use `_debug` [#862](https://github.com/motdotla/dotenv/pull/862)
+
+## [16.4.7](https://github.com/motdotla/dotenv/compare/v16.4.6...v16.4.7) (2024-12-03)
+
+### Changed
+
+- Ignore `.tap` folder when publishing. (oops, sorry about that everyone. - @motdotla) [#848](https://github.com/motdotla/dotenv/pull/848)
+
+## [16.4.6](https://github.com/motdotla/dotenv/compare/v16.4.5...v16.4.6) (2024-12-02)
+
+### Changed
+
+- Clean up stale dev dependencies [#847](https://github.com/motdotla/dotenv/pull/847)
+- Various README updates clarifying usage and alternative solutions using [dotenvx](https://github.com/dotenvx/dotenvx)
+
+## [16.4.5](https://github.com/motdotla/dotenv/compare/v16.4.4...v16.4.5) (2024-02-19)
+
+### Changed
+
+- 🐞 Fix recent regression when using `path` option. return to historical behavior: do not attempt to auto find `.env` if `path` set. (regression was introduced in `16.4.3`) [#814](https://github.com/motdotla/dotenv/pull/814)
+
+## [16.4.4](https://github.com/motdotla/dotenv/compare/v16.4.3...v16.4.4) (2024-02-13)
+
+### Changed
+
+- 🐞 Replaced chaining operator `?.` with old school `&&` (fixing node 12 failures) [#812](https://github.com/motdotla/dotenv/pull/812)
+
+## [16.4.3](https://github.com/motdotla/dotenv/compare/v16.4.2...v16.4.3) (2024-02-12)
+
+### Changed
+
+- Fixed processing of multiple files in `options.path` [#805](https://github.com/motdotla/dotenv/pull/805)
+
+## [16.4.2](https://github.com/motdotla/dotenv/compare/v16.4.1...v16.4.2) (2024-02-10)
+
+### Changed
+
+- Changed funding link in package.json to [`dotenvx.com`](https://dotenvx.com)
+
+## [16.4.1](https://github.com/motdotla/dotenv/compare/v16.4.0...v16.4.1) (2024-01-24)
+
+- Patch support for array as `path` option [#797](https://github.com/motdotla/dotenv/pull/797)
+
+## [16.4.0](https://github.com/motdotla/dotenv/compare/v16.3.2...v16.4.0) (2024-01-23)
+
+- Add `error.code` to error messages around `.env.vault` decryption handling [#795](https://github.com/motdotla/dotenv/pull/795)
+- Add ability to find `.env.vault` file when filename(s) passed as an array [#784](https://github.com/motdotla/dotenv/pull/784)
+
+## [16.3.2](https://github.com/motdotla/dotenv/compare/v16.3.1...v16.3.2) (2024-01-18)
+
+### Added
+
+- Add debug message when no encoding set [#735](https://github.com/motdotla/dotenv/pull/735)
+
+### Changed
+
+- Fix output typing for `populate` [#792](https://github.com/motdotla/dotenv/pull/792)
+- Use subarray instead of slice [#793](https://github.com/motdotla/dotenv/pull/793)
+
+## [16.3.1](https://github.com/motdotla/dotenv/compare/v16.3.0...v16.3.1) (2023-06-17)
+
+### Added
+
+- Add missing type definitions for `processEnv` and `DOTENV_KEY` options. [#756](https://github.com/motdotla/dotenv/pull/756)
+
+## [16.3.0](https://github.com/motdotla/dotenv/compare/v16.2.0...v16.3.0) (2023-06-16)
+
+### Added
+
+- Optionally pass `DOTENV_KEY` to options rather than relying on `process.env.DOTENV_KEY`. Defaults to `process.env.DOTENV_KEY` [#754](https://github.com/motdotla/dotenv/pull/754)
+
+## [16.2.0](https://github.com/motdotla/dotenv/compare/v16.1.4...v16.2.0) (2023-06-15)
+
+### Added
+
+- Optionally write to your own target object rather than `process.env`. Defaults to `process.env`. [#753](https://github.com/motdotla/dotenv/pull/753)
+- Add import type URL to types file [#751](https://github.com/motdotla/dotenv/pull/751)
+
+## [16.1.4](https://github.com/motdotla/dotenv/compare/v16.1.3...v16.1.4) (2023-06-04)
+
+### Added
+
+- Added `.github/` to `.npmignore` [#747](https://github.com/motdotla/dotenv/pull/747)
+
+## [16.1.3](https://github.com/motdotla/dotenv/compare/v16.1.2...v16.1.3) (2023-05-31)
+
+### Removed
+
+- Removed `browser` keys for `path`, `os`, and `crypto` in package.json. These were set to false incorrectly as of 16.1. Instead, if using dotenv on the front-end make sure to include polyfills for `path`, `os`, and `crypto`. [node-polyfill-webpack-plugin](https://github.com/Richienb/node-polyfill-webpack-plugin) provides these.
+
+## [16.1.2](https://github.com/motdotla/dotenv/compare/v16.1.1...v16.1.2) (2023-05-31)
+
+### Changed
+
+- Exposed private function `_configDotenv` as `configDotenv`. [#744](https://github.com/motdotla/dotenv/pull/744)
+
+## [16.1.1](https://github.com/motdotla/dotenv/compare/v16.1.0...v16.1.1) (2023-05-30)
+
+### Added
+
+- Added type definition for `decrypt` function
+
+### Changed
+
+- Fixed `{crypto: false}` in `packageJson.browser`
+
+## [16.1.0](https://github.com/motdotla/dotenv/compare/v16.0.3...v16.1.0) (2023-05-30)
+
+### Added
+
+- Add `populate` convenience method [#733](https://github.com/motdotla/dotenv/pull/733)
+- Accept URL as path option [#720](https://github.com/motdotla/dotenv/pull/720)
+- Add dotenv to `npm fund` command
+- Spanish language README [#698](https://github.com/motdotla/dotenv/pull/698)
+- Add `.env.vault` support. 🎉 ([#730](https://github.com/motdotla/dotenv/pull/730))
+
+ℹ️ `.env.vault` extends the `.env` file format standard with a localized encrypted vault file. Package it securely with your production code deploys. It's cloud agnostic so that you can deploy your secrets anywhere – without [risky third-party integrations](https://techcrunch.com/2023/01/05/circleci-breach/). [read more](https://github.com/motdotla/dotenv#-deploying)
+
+### Changed
+
+- Fixed "cannot resolve 'fs'" error on tools like Replit [#693](https://github.com/motdotla/dotenv/pull/693)
+
+## [16.0.3](https://github.com/motdotla/dotenv/compare/v16.0.2...v16.0.3) (2022-09-29)
+
+### Changed
+
+- Added library version to debug logs ([#682](https://github.com/motdotla/dotenv/pull/682))
+
+## [16.0.2](https://github.com/motdotla/dotenv/compare/v16.0.1...v16.0.2) (2022-08-30)
+
+### Added
+
+- Export `env-options.js` and `cli-options.js` in package.json for use with downstream [dotenv-expand](https://github.com/motdotla/dotenv-expand) module
+
+## [16.0.1](https://github.com/motdotla/dotenv/compare/v16.0.0...v16.0.1) (2022-05-10)
+
+### Changed
+
+- Minor README clarifications
+- Development ONLY: updated devDependencies as recommended for development only security risks ([#658](https://github.com/motdotla/dotenv/pull/658))
+
+## [16.0.0](https://github.com/motdotla/dotenv/compare/v15.0.1...v16.0.0) (2022-02-02)
+
+### Added
+
+- _Breaking:_ Backtick support 🎉 ([#615](https://github.com/motdotla/dotenv/pull/615))
+
+If you had values containing the backtick character, please quote those values with either single or double quotes.
+
+## [15.0.1](https://github.com/motdotla/dotenv/compare/v15.0.0...v15.0.1) (2022-02-02)
+
+### Changed
+
+- Properly parse empty single or double quoted values 🐞 ([#614](https://github.com/motdotla/dotenv/pull/614))
+
+## [15.0.0](https://github.com/motdotla/dotenv/compare/v14.3.2...v15.0.0) (2022-01-31)
+
+`v15.0.0` is a major new release with some important breaking changes.
+
+### Added
+
+- _Breaking:_ Multiline parsing support (just works. no need for the flag.)
+
+### Changed
+
+- _Breaking:_ `#` marks the beginning of a comment (UNLESS the value is wrapped in quotes. Please update your `.env` files to wrap in quotes any values containing `#`. For example: `SECRET_HASH="something-with-a-#-hash"`).
+
+..Understandably, (as some teams have noted) this is tedious to do across the entire team. To make it less tedious, we recommend using [dotenv cli](https://github.com/dotenv-org/cli) going forward. It's an optional plugin that will keep your `.env` files in sync between machines, environments, or team members.
+
+### Removed
+
+- _Breaking:_ Remove multiline option (just works out of the box now. no need for the flag.)
+
+## [14.3.2](https://github.com/motdotla/dotenv/compare/v14.3.1...v14.3.2) (2022-01-25)
+
+### Changed
+
+- Preserve backwards compatibility on values containing `#` 🐞 ([#603](https://github.com/motdotla/dotenv/pull/603))
+
+## [14.3.1](https://github.com/motdotla/dotenv/compare/v14.3.0...v14.3.1) (2022-01-25)
+
+### Changed
+
+- Preserve backwards compatibility on exports by re-introducing the prior in-place exports 🐞 ([#606](https://github.com/motdotla/dotenv/pull/606))
+
+## [14.3.0](https://github.com/motdotla/dotenv/compare/v14.2.0...v14.3.0) (2022-01-24)
+
+### Added
+
+- Add `multiline` option 🎉 ([#486](https://github.com/motdotla/dotenv/pull/486))
+
+## [14.2.0](https://github.com/motdotla/dotenv/compare/v14.1.1...v14.2.0) (2022-01-17)
+
+### Added
+
+- Add `dotenv_config_override` cli option
+- Add `DOTENV_CONFIG_OVERRIDE` command line env option
+
+## [14.1.1](https://github.com/motdotla/dotenv/compare/v14.1.0...v14.1.1) (2022-01-17)
+
+### Added
+
+- Add React gotcha to FAQ on README
+
+## [14.1.0](https://github.com/motdotla/dotenv/compare/v14.0.1...v14.1.0) (2022-01-17)
+
+### Added
+
+- Add `override` option 🎉 ([#595](https://github.com/motdotla/dotenv/pull/595))
+
+## [14.0.1](https://github.com/motdotla/dotenv/compare/v14.0.0...v14.0.1) (2022-01-16)
+
+### Added
+
+- Log error on failure to load `.env` file ([#594](https://github.com/motdotla/dotenv/pull/594))
+
+## [14.0.0](https://github.com/motdotla/dotenv/compare/v13.0.1...v14.0.0) (2022-01-16)
+
+### Added
+
+- _Breaking:_ Support inline comments for the parser 🎉 ([#568](https://github.com/motdotla/dotenv/pull/568))
+
+## [13.0.1](https://github.com/motdotla/dotenv/compare/v13.0.0...v13.0.1) (2022-01-16)
+
+### Changed
+
+* Hide comments and newlines from debug output ([#404](https://github.com/motdotla/dotenv/pull/404))
+
+## [13.0.0](https://github.com/motdotla/dotenv/compare/v12.0.4...v13.0.0) (2022-01-16)
+
+### Added
+
+* _Breaking:_ Add type file for `config.js` ([#539](https://github.com/motdotla/dotenv/pull/539))
+
+## [12.0.4](https://github.com/motdotla/dotenv/compare/v12.0.3...v12.0.4) (2022-01-16)
+
+### Changed
+
+* README updates
+* Minor order adjustment to package json format
+
+## [12.0.3](https://github.com/motdotla/dotenv/compare/v12.0.2...v12.0.3) (2022-01-15)
+
+### Changed
+
+* Simplified jsdoc for consistency across editors
+
+## [12.0.2](https://github.com/motdotla/dotenv/compare/v12.0.1...v12.0.2) (2022-01-15)
+
+### Changed
+
+* Improve embedded jsdoc type documentation
+
+## [12.0.1](https://github.com/motdotla/dotenv/compare/v12.0.0...v12.0.1) (2022-01-15)
+
+### Changed
+
+* README updates and clarifications
+
+## [12.0.0](https://github.com/motdotla/dotenv/compare/v11.0.0...v12.0.0) (2022-01-15)
+
+### Removed
+
+- _Breaking:_ drop support for Flow static type checker ([#584](https://github.com/motdotla/dotenv/pull/584))
+
+### Changed
+
+- Move types/index.d.ts to lib/main.d.ts ([#585](https://github.com/motdotla/dotenv/pull/585))
+- Typescript cleanup ([#587](https://github.com/motdotla/dotenv/pull/587))
+- Explicit typescript inclusion in package.json ([#566](https://github.com/motdotla/dotenv/pull/566))
+
+## [11.0.0](https://github.com/motdotla/dotenv/compare/v10.0.0...v11.0.0) (2022-01-11)
+
+### Changed
+
+- _Breaking:_ drop support for Node v10 ([#558](https://github.com/motdotla/dotenv/pull/558))
+- Patch debug option ([#550](https://github.com/motdotla/dotenv/pull/550))
+
+## [10.0.0](https://github.com/motdotla/dotenv/compare/v9.0.2...v10.0.0) (2021-05-20)
+
+### Added
+
+- Add generic support to parse function
+- Allow for import "dotenv/config.js"
+- Add support to resolve home directory in path via ~
+
+## [9.0.2](https://github.com/motdotla/dotenv/compare/v9.0.1...v9.0.2) (2021-05-10)
+
+### Changed
+
+- Support windows newlines with debug mode
+
+## [9.0.1](https://github.com/motdotla/dotenv/compare/v9.0.0...v9.0.1) (2021-05-08)
+
+### Changed
+
+- Updates to README
+
+## [9.0.0](https://github.com/motdotla/dotenv/compare/v8.6.0...v9.0.0) (2021-05-05)
+
+### Changed
+
+- _Breaking:_ drop support for Node v8
+
+## [8.6.0](https://github.com/motdotla/dotenv/compare/v8.5.1...v8.6.0) (2021-05-05)
+
+### Added
+
+- define package.json in exports
+
+## [8.5.1](https://github.com/motdotla/dotenv/compare/v8.5.0...v8.5.1) (2021-05-05)
+
+### Changed
+
+- updated dev dependencies via npm audit
+
+## [8.5.0](https://github.com/motdotla/dotenv/compare/v8.4.0...v8.5.0) (2021-05-05)
+
+### Added
+
+- allow for `import "dotenv/config"`
+
+## [8.4.0](https://github.com/motdotla/dotenv/compare/v8.3.0...v8.4.0) (2021-05-05)
+
+### Changed
+
+- point to exact types file to work with VS Code
+
+## [8.3.0](https://github.com/motdotla/dotenv/compare/v8.2.0...v8.3.0) (2021-05-05)
+
+### Changed
+
+- _Breaking:_ drop support for Node v8 (mistake to be released as minor bump. later bumped to 9.0.0. see above.)
+
+## [8.2.0](https://github.com/motdotla/dotenv/compare/v8.1.0...v8.2.0) (2019-10-16)
+
+### Added
+
+- TypeScript types
+
+## [8.1.0](https://github.com/motdotla/dotenv/compare/v8.0.0...v8.1.0) (2019-08-18)
+
+### Changed
+
+- _Breaking:_ drop support for Node v6 ([#392](https://github.com/motdotla/dotenv/issues/392))
+
+# [8.0.0](https://github.com/motdotla/dotenv/compare/v7.0.0...v8.0.0) (2019-05-02)
+
+### Changed
+
+- _Breaking:_ drop support for Node v6 ([#302](https://github.com/motdotla/dotenv/issues/392))
+
+## [7.0.0] - 2019-03-12
+
+### Fixed
+
+- Fix removing unbalanced quotes ([#376](https://github.com/motdotla/dotenv/pull/376))
+
+### Removed
+
+- Removed `load` alias for `config` for consistency throughout code and documentation.
+
+## [6.2.0] - 2018-12-03
+
+### Added
+
+- Support preload configuration via environment variables ([#351](https://github.com/motdotla/dotenv/issues/351))
+
+## [6.1.0] - 2018-10-08
+
+### Added
+
+- `debug` option for `config` and `parse` methods will turn on logging
+
+## [6.0.0] - 2018-06-02
+
+### Changed
+
+- _Breaking:_ drop support for Node v4 ([#304](https://github.com/motdotla/dotenv/pull/304))
+
+## [5.0.0] - 2018-01-29
+
+### Added
+
+- Testing against Node v8 and v9
+- Documentation on trim behavior of values
+- Documentation on how to use with `import`
+
+### Changed
+
+- _Breaking_: default `path` is now `path.resolve(process.cwd(), '.env')`
+- _Breaking_: does not write over keys already in `process.env` if the key has a falsy value
+- using `const` and `let` instead of `var`
+
+### Removed
+
+- Testing against Node v7
+
+## [4.0.0] - 2016-12-23
+
+### Changed
+
+- Return Object with parsed content or error instead of false ([#165](https://github.com/motdotla/dotenv/pull/165)).
+
+### Removed
+
+- `verbose` option removed in favor of returning result.
+
+## [3.0.0] - 2016-12-20
+
+### Added
+
+- `verbose` option will log any error messages. Off by default.
+- parses email addresses correctly
+- allow importing config method directly in ES6
+
+### Changed
+
+- Suppress error messages by default ([#154](https://github.com/motdotla/dotenv/pull/154))
+- Ignoring more files for NPM to make package download smaller
+
+### Fixed
+
+- False positive test due to case-sensitive variable ([#124](https://github.com/motdotla/dotenv/pull/124))
+
+### Removed
+
+- `silent` option removed in favor of `verbose`
+
+## [2.0.0] - 2016-01-20
+
+### Added
+
+- CHANGELOG to ["make it easier for users and contributors to see precisely what notable changes have been made between each release"](http://keepachangelog.com/). Linked to from README
+- LICENSE to be more explicit about what was defined in `package.json`. Linked to from README
+- Testing nodejs v4 on travis-ci
+- added examples of how to use dotenv in different ways
+- return parsed object on success rather than boolean true
+
+### Changed
+
+- README has shorter description not referencing ruby gem since we don't have or want feature parity
+
+### Removed
+
+- Variable expansion and escaping so environment variables are encouraged to be fully orthogonal
+
+## [1.2.0] - 2015-06-20
+
+### Added
+
+- Preload hook to require dotenv without including it in your code
+
+### Changed
+
+- clarified license to be "BSD-2-Clause" in `package.json`
+
+### Fixed
+
+- retain spaces in string vars
+
+## [1.1.0] - 2015-03-31
+
+### Added
+
+- Silent option to silence `console.log` when `.env` missing
+
+## [1.0.0] - 2015-03-13
+
+### Removed
+
+- support for multiple `.env` files. should always use one `.env` file for the current environment
+
+[7.0.0]: https://github.com/motdotla/dotenv/compare/v6.2.0...v7.0.0
+[6.2.0]: https://github.com/motdotla/dotenv/compare/v6.1.0...v6.2.0
+[6.1.0]: https://github.com/motdotla/dotenv/compare/v6.0.0...v6.1.0
+[6.0.0]: https://github.com/motdotla/dotenv/compare/v5.0.0...v6.0.0
+[5.0.0]: https://github.com/motdotla/dotenv/compare/v4.0.0...v5.0.0
+[4.0.0]: https://github.com/motdotla/dotenv/compare/v3.0.0...v4.0.0
+[3.0.0]: https://github.com/motdotla/dotenv/compare/v2.0.0...v3.0.0
+[2.0.0]: https://github.com/motdotla/dotenv/compare/v1.2.0...v2.0.0
+[1.2.0]: https://github.com/motdotla/dotenv/compare/v1.1.0...v1.2.0
+[1.1.0]: https://github.com/motdotla/dotenv/compare/v1.0.0...v1.1.0
+[1.0.0]: https://github.com/motdotla/dotenv/compare/v0.4.0...v1.0.0
diff --git a/node_modules/dotenv/LICENSE b/node_modules/dotenv/LICENSE
new file mode 100644
index 0000000..c430ad8
--- /dev/null
+++ b/node_modules/dotenv/LICENSE
@@ -0,0 +1,23 @@
+Copyright (c) 2015, Scott Motte
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/node_modules/dotenv/README-es.md b/node_modules/dotenv/README-es.md
new file mode 100644
index 0000000..5fc934d
--- /dev/null
+++ b/node_modules/dotenv/README-es.md
@@ -0,0 +1,411 @@
+<div align="center">
+🎉 announcing <a href="https://github.com/dotenvx/dotenvx">dotenvx</a>. <em>run anywhere, multi-environment, encrypted envs</em>.
+</div>
+
+&nbsp;
+
+<div align="center">
+
+<p>
+  <sup>
+    <a href="https://github.com/sponsors/motdotla">Dotenv es apoyado por la comunidad.</a>
+  </sup>
+</p>
+<sup>Gracias espaciales a:</sup>
+<br>
+<br>
+
+<a href="https://graphite.dev/?utm_source=github&utm_medium=repo&utm_campaign=dotenv"><img src="https://res.cloudinary.com/dotenv-org/image/upload/v1744035073/graphite_lgsrl8.gif" width="240" alt="Graphite" /></a>
+
+<a href="https://graphite.dev/?utm_source=github&utm_medium=repo&utm_campaign=dotenv">
+  <b>Graphite is the AI developer productivity platform helping teams on GitHub ship higher quality software, faster.</b>
+</a>
+<hr>
+</div>
+
+# dotenv [![NPM version](https://img.shields.io/npm/v/dotenv.svg?style=flat-square)](https://www.npmjs.com/package/dotenv)
+
+<img src="https://raw.githubusercontent.com/motdotla/dotenv/master/dotenv.svg" alt="dotenv" align="right" width="200" />
+
+Dotenv es un módulo de dependencia cero que carga las variables de entorno desde un archivo `.env` en [`process.env`](https://nodejs.org/docs/latest/api/process.html#process_process_env). El almacenamiento de la configuración del entorno separado del código está basado en la metodología [The Twelve-Factor App](http://12factor.net/config).
+
+[![js-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg?style=flat-square)](https://github.com/feross/standard)
+[![LICENSE](https://img.shields.io/github/license/motdotla/dotenv.svg)](LICENSE)
+
+## Instalación
+
+```bash
+# instalación local (recomendado)
+npm install dotenv --save
+```
+
+O installación con yarn? `yarn add dotenv`
+
+## Uso
+
+Cree un archivo `.env` en la raíz de su proyecto:
+
+```dosini
+S3_BUCKET="YOURS3BUCKET"
+SECRET_KEY="YOURSECRETKEYGOESHERE"
+```
+
+Tan prónto como sea posible en su aplicación, importe y configure dotenv:
+
+```javascript
+require('dotenv').config()
+console.log(process.env) // elimine esto después que haya confirmado que esta funcionando
+```
+
+.. o usa ES6?
+
+```javascript
+import * as dotenv from 'dotenv' // vea en https://github.com/motdotla/dotenv#como-uso-dotenv-con-import
+// REVISAR LINK DE REFERENCIA DE IMPORTACIÓN
+dotenv.config()
+import express from 'express'
+```
+
+Eso es todo. `process.env` ahora tiene las claves y los valores que definiste en tu archivo `.env`:
+
+```javascript
+require('dotenv').config()
+
+...
+
+s3.getBucketCors({Bucket: process.env.S3_BUCKET}, function(err, data) {})
+```
+
+### Valores multilínea
+
+Si necesita variables de varias líneas, por ejemplo, claves privadas, ahora se admiten en la versión (`>= v15.0.0`) con saltos de línea:
+
+```dosini
+PRIVATE_KEY="-----BEGIN RSA PRIVATE KEY-----
+...
+Kh9NV...
+...
+-----END RSA PRIVATE KEY-----"
+```
+
+Alternativamente, puede usar comillas dobles y usar el carácter `\n`:
+
+```dosini
+PRIVATE_KEY="-----BEGIN RSA PRIVATE KEY-----\nKh9NV...\n-----END RSA PRIVATE KEY-----\n"
+```
+
+### Comentarios
+
+Los comentarios pueden ser agregados en tu archivo o en la misma línea:
+
+```dosini
+# This is a comment
+SECRET_KEY=YOURSECRETKEYGOESHERE # comment
+SECRET_HASH="something-with-a-#-hash"
+```
+
+Los comentarios comienzan donde existe un `#`, entonces, si su valor contiene un `#`, enciérrelo entre comillas. Este es un cambio importante desde la versión `>= v15.0.0` en adelante.
+
+### Análisis
+
+El motor que analiza el contenido de su archivo que contiene variables de entorno está disponible para su uso. Este Acepta una Cadena o un Búfer y devolverá un Objeto con las claves y los valores analizados.
+
+```javascript
+const dotenv = require('dotenv')
+const buf = Buffer.from('BASICO=basico')
+const config = dotenv.parse(buf) // devolverá un objeto
+console.log(typeof config, config) // objeto { BASICO : 'basico' }
+```
+
+### Precarga
+
+Puede usar el `--require` (`-r`) [opción de línea de comando](https://nodejs.org/api/cli.html#-r---require-module) para precargar dotenv. Al hacer esto, no necesita requerir ni cargar dotnev en el código de su aplicación.
+
+```bash
+$ node -r dotenv/config tu_script.js
+```
+
+Las opciones de configuración a continuación se admiten como argumentos de línea de comandos en el formato `dotenv_config_<option>=value`
+
+```bash
+$ node -r dotenv/config tu_script.js dotenv_config_path=/custom/path/to/.env dotenv_config_debug=true
+```
+
+Además, puede usar variables de entorno para establecer opciones de configuración. Los argumentos de línea de comandos precederán a estos.
+
+```bash
+$ DOTENV_CONFIG_<OPTION>=value node -r dotenv/config tu_script.js
+```
+
+```bash
+$ DOTENV_CONFIG_ENCODING=latin1 DOTENV_CONFIG_DEBUG=true node -r dotenv/config tu_script.js dotenv_config_path=/custom/path/to/.env
+```
+
+### Expansión Variable
+
+Necesitaras agregar el valor de otro variable en una de sus variables? Usa [dotenv-expand](https://github.com/motdotla/dotenv-expand).
+
+## Ejemplos
+
+Vea [ejemplos](https://github.com/dotenv-org/examples) sobre el uso de dotenv con varios frameworks, lenguajes y configuraciones.
+
+* [nodejs](https://github.com/dotenv-org/examples/tree/master/dotenv-nodejs)
+* [nodejs (depurar en)](https://github.com/dotenv-org/examples/tree/master/dotenv-nodejs-debug)
+* [nodejs (anular en)](https://github.com/dotenv-org/examples/tree/master/dotenv-nodejs-override)
+* [esm](https://github.com/dotenv-org/examples/tree/master/dotenv-esm)
+* [esm (precarga)](https://github.com/dotenv-org/examples/tree/master/dotenv-esm-preload)
+* [typescript](https://github.com/dotenv-org/examples/tree/master/dotenv-typescript)
+* [typescript parse](https://github.com/dotenv-org/examples/tree/master/dotenv-typescript-parse)
+* [typescript config](https://github.com/dotenv-org/examples/tree/master/dotenv-typescript-config)
+* [webpack](https://github.com/dotenv-org/examples/tree/master/dotenv-webpack)
+* [webpack (plugin)](https://github.com/dotenv-org/examples/tree/master/dotenv-webpack2)
+* [react](https://github.com/dotenv-org/examples/tree/master/dotenv-react)
+* [react (typescript)](https://github.com/dotenv-org/examples/tree/master/dotenv-react-typescript)
+* [express](https://github.com/dotenv-org/examples/tree/master/dotenv-express)
+* [nestjs](https://github.com/dotenv-org/examples/tree/master/dotenv-nestjs)
+
+## Documentación
+
+Dotenv expone dos funciones:
+
+* `configuración`
+* `analizar`
+
+### Configuración
+
+`Configuración` leerá su archivo `.env`, analizará el contenido, lo asignará a [`process.env`](https://nodejs.org/docs/latest/api/process.html#process_process_env),
+y devolverá un Objeto con una clave `parsed` que contiene el contenido cargado o una clave `error` si falla.
+
+```js
+const result = dotenv.config()
+
+if (result.error) {
+  throw result.error
+}
+
+console.log(result.parsed)
+```
+
+Adicionalmente, puede pasar opciones a `configuracion`.
+
+#### Opciones
+
+##### Ruta
+
+Por defecto: `path.resolve(process.cwd(), '.env')`
+
+Especifique una ruta personalizada si el archivo que contiene las variables de entorno se encuentra localizado en otro lugar.
+
+```js
+require('dotenv').config({ path: '/personalizado/ruta/a/.env' })
+```
+
+##### Codificación
+
+Por defecto: `utf8`
+
+Especifique la codificación del archivo que contiene las variables de entorno.
+
+```js
+require('dotenv').config({ encoding: 'latin1' })
+```
+
+##### Depurar
+
+Por defecto: `false`
+
+Active el registro de ayuda para depurar por qué ciertas claves o valores no se inician como lo esperabas.
+
+```js
+require('dotenv').config({ debug: process.env.DEBUG })
+```
+
+##### Anular
+
+Por defecto: `false`
+
+Anule cualquier variable de entorno que ya se haya configurada en su maquina con los valores de su archivo .env.
+
+```js
+require('dotenv').config({ override: true })
+```
+
+### Analizar
+
+El motor que analiza el contenido del archivo que contiene las variables de entorno está disponible para su uso. Acepta una Cadena o un Búfer y retornará un objecto con los valores analizados.
+
+```js
+const dotenv = require('dotenv')
+const buf = Buffer.from('BASICO=basico')
+const config = dotenv.parse(buf) // devolverá un objeto
+console.log(typeof config, config) // objeto { BASICO : 'basico' }
+```
+
+#### Opciones
+
+##### Depurar
+
+Por defecto: `false`
+
+Active el registro de ayuda para depurar por qué ciertas claves o valores no se inician como lo esperabas.
+
+```js
+const dotenv = require('dotenv')
+const buf = Buffer.from('hola mundo')
+const opt = { debug: true }
+const config = dotenv.parse(buf, opt)
+// espere por un mensaje de depuración porque el búfer no esta listo KEY=VAL
+```
+
+## FAQ
+
+### ¿Por qué el archivo `.env` no carga mis variables de entorno correctamente?
+
+Lo más probable es que su archivo `.env` no esté en el lugar correcto. [Vea este stack overflow](https://stackoverflow.com/questions/42335016/dotenv-file-is-not-loading-environment-variables).
+
+Active el modo de depuración y vuelva a intentarlo...
+
+```js
+require('dotenv').config({ debug: true })
+```
+
+Recibirá un error apropiado en su consola.
+
+### ¿Debo confirmar mi archivo `.env`?
+
+No. Recomendamos **enfáticamente** no enviar su archivo `.env` a la versión de control. Solo debe incluir los valores especificos del entorno, como la base de datos, contraseñas o claves API.
+
+### ¿Debería tener multiples archivos `.env`?
+
+No. Recomendamos **enfáticamente** no tener un archivo `.env` "principal" y un archivo `.env` de "entorno" como `.env.test`. Su configuración debe variar entre implementaciones y no debe compartir valores entre entornos.
+
+> En una Aplicación de Doce Factores, las variables de entorno son controles diferenciados, cada uno totalmente independiente a otras variables de entorno. Nunca se agrupan como "entornos", sino que se gestionan de manera independiente para cada despliegue. Este es un modelo que se escala sin problemas a medida que la aplicación se expande de forma natural en más despliegues a lo largo de su vida.
+>
+> – [La Apliación de los Doce Factores](https://12factor.net/es/)
+
+### ¿Qué reglas sigue el motor de análisis?
+
+El motor de análisis actualmente admite las siguientes reglas:
+
+- `BASICO=basico` se convierte en `{BASICO: 'basico'}`
+- las líneas vacías se saltan
+- las líneas que comienzan con `#` se tratan como comentarios
+- `#` marca el comienzo de un comentario (a menos que el valor esté entre comillas)
+- valores vacíos se convierten en cadenas vacías (`VACIO=` se convierte en `{VACIO: ''}`)
+- las comillas internas se mantienen (piensa en JSON) (`JSON={"foo": "bar"}` se convierte en `{JSON:"{\"foo\": \"bar\"}"`)
+- los espacios en blanco se eliminan de ambos extremos de los valores no citanos (aprende más en [`trim`](https://developer.mozilla.org/es/docs/Web/JavaScript/Reference/Global_Objects/String/Trim)) (`FOO=  algo ` se convierte en `{FOO: 'algo'}`)
+- los valores entre comillas simples y dobles se escapan (`CITA_SIMPLE='citado'` se convierte en `{CITA_SIMPLE: "citado"}`)
+- los valores entre comillas simples y dobles mantienen los espacios en blanco en ambos extremos  (`FOO="  algo  "` se convierte en `{FOO: '  algo  '}`)
+- los valores entre comillas dobles expanden nuevas líneas (`MULTILINEA="nueva\nlínea"` se convierte en
+
+```
+{MULTILINEA: 'nueva
+línea'}
+```
+
+- se admite la comilla simple invertida (`` SIGNO_ACENTO=`Esto tiene comillas 'simples' y "dobles" en su interior.` ``)
+
+### ¿Qué sucede con las variables de entorno que ya estaban configuradas?
+
+Por defecto, nunca modificaremos ninguna variable de entorno que ya haya sido establecida. En particular, si hay una variable en su archivo `.env` que colisiona con una que ya existe en su entorno, entonces esa variable se omitirá.
+
+Si por el contrario, quieres anular `process.env` utiliza la opción `override`.
+
+```javascript
+require('dotenv').config({ override: true })
+```
+
+### ¿Por qué mis variables de entorno no aparecen para React?
+
+Su código React se ejecuta en Webpack, donde el módulo `fs` o incluso el propio `process` global no son accesibles fuera-de-la-caja. El módulo `process.env` sólo puede ser inyectado a través de la configuración de Webpack.
+
+Si estás usando [`react-scripts`](https://www.npmjs.com/package/react-scripts), el cual se distribuye a través de [`create-react-app`](https://create-react-app.dev/), tiene dotenv incorporado pero con una singularidad. Escriba sus variables de entorno con `REACT_APP_`. Vea [este stack overflow](https://stackoverflow.com/questions/42182577/is-it-possible-to-use-dotenv-in-a-react-project) para más detalles.
+
+Si estás utilizando otros frameworks (por ejemplo, Next.js, Gatsby...), debes consultar su documentación para saber cómo injectar variables de entorno en el cliente.
+
+### ¿Puedo personalizar/escribir plugins para dotenv?
+
+Sí! `dotenv.config()` devuelve un objeto que representa el archivo `.env` analizado. Esto te da todo lo que necesitas para poder establecer valores en `process.env`. Por ejemplo:
+
+```js
+const dotenv = require('dotenv')
+const variableExpansion = require('dotenv-expand')
+const miEnv = dotenv.config()
+variableExpansion(miEnv)
+```
+
+### Cómo uso dotnev con `import`?
+
+Simplemente..
+
+```javascript
+// index.mjs (ESM)
+import * as dotenv from 'dotenv' // vea https://github.com/motdotla/dotenv#como-uso-dotenv-con-import
+dotenv.config()
+import express from 'express'
+```
+
+Un poco de historia...
+
+> Cuando se ejecuta un módulo que contiene una sentencia `import`, los módulos que importa serán cargados primero, y luego se ejecuta cada bloque del módulo en un recorrido en profundidad del gráfico de dependencias, evitando los ciclos al saltarse todo lo que ya se ha ejecutado.
+>
+> – [ES6 en Profundidad: Módulos](https://hacks.mozilla.org/2015/08/es6-in-depth-modules/)
+
+¿Qué significa esto en lenguaje sencillo? Significa que se podrías pensar que lo siguiente funcionaría pero no lo hará.
+
+```js
+// notificarError.mjs
+import { Cliente } from 'mejor-servicio-para-notificar-error'
+
+export default new Client(process.env.CLAVE_API)
+
+// index.mjs
+import dotenv from 'dotenv'
+dotenv.config()
+
+import notificarError from './notificarError.mjs'
+notificarError.report(new Error('ejemplo documentado'))
+```
+
+`process.env.CLAVE_API` será vacio.
+
+En su lugar, el código anterior debe ser escrito como...
+
+```js
+// notificarError.mjs
+import { Cliente } from 'mejor-servicio-para-notificar-errores'
+
+export default new Client(process.env.CLAVE_API)
+
+// index.mjs
+import * as dotenv from 'dotenv'
+dotenv.config()
+
+import notificarError from './notificarError.mjs'
+notificarError.report(new Error('ejemplo documentado'))
+```
+
+¿Esto tiene algo de sentido? Esto es poco poco intuitivo, pero es como funciona la importación de módulos en ES6. Aquí hay un ejemplo [ejemplo práctico de esta trampa](https://github.com/dotenv-org/examples/tree/master/dotenv-es6-import-pitfall).
+
+Existen dos arternativas a este planteamiento:
+
+1. Precarga dotenv: `node --require dotenv/config index.js` (_Nota: no es necesario usar `import` dotenv con este método_)
+2. Cree un archivo separado que ejecutará `config` primero como se describe en [este comentario #133](https://github.com/motdotla/dotenv/issues/133#issuecomment-255298822)
+
+### ¿Qué pasa con la expansión de variable?
+
+Prueba [dotenv-expand](https://github.com/motdotla/dotenv-expand)
+
+## Guía de contribución
+
+Vea [CONTRIBUTING.md](CONTRIBUTING.md)
+
+## REGISTRO DE CAMBIOS
+
+Vea [CHANGELOG.md](CHANGELOG.md)
+
+## ¿Quiénes utilizan dotenv?
+
+[Estos módulos npm dependen de él.](https://www.npmjs.com/browse/depended/dotenv)
+
+Los proyectos que lo amplían suelen utilizar la [palabra clave "dotenv" en npm](https://www.npmjs.com/search?q=keywords:dotenv).
diff --git a/node_modules/dotenv/README.md b/node_modules/dotenv/README.md
new file mode 100644
index 0000000..251aada
--- /dev/null
+++ b/node_modules/dotenv/README.md
@@ -0,0 +1,645 @@
+<div align="center">
+🎉 announcing <a href="https://github.com/dotenvx/dotenvx">dotenvx</a>. <em>run anywhere, multi-environment, encrypted envs</em>.
+</div>
+
+&nbsp;
+
+<div align="center">
+
+**Special thanks to [our sponsors](https://github.com/sponsors/motdotla)**
+
+<br>
+<a href="https://graphite.dev/?utm_source=github&utm_medium=repo&utm_campaign=dotenv"><img src="https://res.cloudinary.com/dotenv-org/image/upload/v1744035073/graphite_lgsrl8.gif" width="240" alt="Graphite" /></a>
+<br>
+<a href="https://graphite.dev/?utm_source=github&utm_medium=repo&utm_campaign=dotenv">
+  <b>Graphite is the AI developer productivity platform helping teams on GitHub ship higher quality software, faster.</b>
+</a>
+<hr>
+</div>
+
+# dotenv [![NPM version](https://img.shields.io/npm/v/dotenv.svg?style=flat-square)](https://www.npmjs.com/package/dotenv)
+
+<img src="https://raw.githubusercontent.com/motdotla/dotenv/master/dotenv.svg" alt="dotenv" align="right" width="200" />
+
+Dotenv is a zero-dependency module that loads environment variables from a `.env` file into [`process.env`](https://nodejs.org/docs/latest/api/process.html#process_process_env). Storing configuration in the environment separate from code is based on [The Twelve-Factor App](https://12factor.net/config) methodology.
+
+[![js-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg?style=flat-square)](https://github.com/feross/standard)
+[![LICENSE](https://img.shields.io/github/license/motdotla/dotenv.svg)](LICENSE)
+[![codecov](https://codecov.io/gh/motdotla/dotenv-expand/graph/badge.svg?token=pawWEyaMfg)](https://codecov.io/gh/motdotla/dotenv-expand)
+
+* [🌱 Install](#-install)
+* [🏗️ Usage (.env)](#%EF%B8%8F-usage)
+* [🌴 Multiple Environments 🆕](#-manage-multiple-environments)
+* [🚀 Deploying (encryption) 🆕](#-deploying)
+* [📚 Examples](#-examples)
+* [📖 Docs](#-documentation)
+* [❓ FAQ](#-faq)
+* [⏱️ Changelog](./CHANGELOG.md)
+
+## 🌱 Install
+
+```bash
+npm install dotenv --save
+```
+
+You can also use an npm-compatible package manager like yarn, bun or pnpm:
+
+```bash
+yarn add dotenv
+```
+```bash
+bun add dotenv
+```
+```bash
+pnpm add dotenv
+```
+
+## 🏗️ Usage
+
+<a href="https://www.youtube.com/watch?v=YtkZR0NFd1g">
+<div align="right">
+<img src="https://img.youtube.com/vi/YtkZR0NFd1g/hqdefault.jpg" alt="how to use dotenv video tutorial" align="right" width="330" />
+<img src="https://simpleicons.vercel.app/youtube/ff0000" alt="youtube/@dotenvorg" align="right" width="24" />
+</div>
+</a>
+
+Create a `.env` file in the root of your project (if using a monorepo structure like `apps/backend/app.js`, put it in the root of the folder where your `app.js` process runs):
+
+```dosini
+S3_BUCKET="YOURS3BUCKET"
+SECRET_KEY="YOURSECRETKEYGOESHERE"
+```
+
+As early as possible in your application, import and configure dotenv:
+
+```javascript
+require('dotenv').config()
+console.log(process.env) // remove this after you've confirmed it is working
+```
+
+.. [or using ES6?](#how-do-i-use-dotenv-with-import)
+
+```javascript
+import 'dotenv/config'
+```
+
+That's it. `process.env` now has the keys and values you defined in your `.env` file:
+
+```javascript
+require('dotenv').config()
+// or import 'dotenv/config' if you're using ES6
+
+...
+
+s3.getBucketCors({Bucket: process.env.S3_BUCKET}, function(err, data) {})
+```
+
+### Multiline values
+
+If you need multiline variables, for example private keys, those are now supported (`>= v15.0.0`) with line breaks:
+
+```dosini
+PRIVATE_KEY="-----BEGIN RSA PRIVATE KEY-----
+...
+Kh9NV...
+...
+-----END RSA PRIVATE KEY-----"
+```
+
+Alternatively, you can double quote strings and use the `\n` character:
+
+```dosini
+PRIVATE_KEY="-----BEGIN RSA PRIVATE KEY-----\nKh9NV...\n-----END RSA PRIVATE KEY-----\n"
+```
+
+### Comments
+
+Comments may be added to your file on their own line or inline:
+
+```dosini
+# This is a comment
+SECRET_KEY=YOURSECRETKEYGOESHERE # comment
+SECRET_HASH="something-with-a-#-hash"
+```
+
+Comments begin where a `#` exists, so if your value contains a `#` please wrap it in quotes. This is a breaking change from `>= v15.0.0` and on.
+
+### Parsing
+
+The engine which parses the contents of your file containing environment variables is available to use. It accepts a String or Buffer and will return an Object with the parsed keys and values.
+
+```javascript
+const dotenv = require('dotenv')
+const buf = Buffer.from('BASIC=basic')
+const config = dotenv.parse(buf) // will return an object
+console.log(typeof config, config) // object { BASIC : 'basic' }
+```
+
+### Preload
+
+> Note: Consider using [`dotenvx`](https://github.com/dotenvx/dotenvx) instead of preloading. I am now doing (and recommending) so.
+>
+> It serves the same purpose (you do not need to require and load dotenv), adds better debugging, and works with ANY language, framework, or platform. – [motdotla](https://github.com/motdotla)
+
+You can use the `--require` (`-r`) [command line option](https://nodejs.org/api/cli.html#-r---require-module) to preload dotenv. By doing this, you do not need to require and load dotenv in your application code.
+
+```bash
+$ node -r dotenv/config your_script.js
+```
+
+The configuration options below are supported as command line arguments in the format `dotenv_config_<option>=value`
+
+```bash
+$ node -r dotenv/config your_script.js dotenv_config_path=/custom/path/to/.env dotenv_config_debug=true
+```
+
+Additionally, you can use environment variables to set configuration options. Command line arguments will precede these.
+
+```bash
+$ DOTENV_CONFIG_<OPTION>=value node -r dotenv/config your_script.js
+```
+
+```bash
+$ DOTENV_CONFIG_ENCODING=latin1 DOTENV_CONFIG_DEBUG=true node -r dotenv/config your_script.js dotenv_config_path=/custom/path/to/.env
+```
+
+### Variable Expansion
+
+You need to add the value of another variable in one of your variables? Use [dotenv-expand](https://github.com/motdotla/dotenv-expand).
+
+### Command Substitution
+
+Use [dotenvx](https://github.com/dotenvx/dotenvx) to use command substitution.
+
+Add the output of a command to one of your variables in your .env file.
+
+```ini
+# .env
+DATABASE_URL="postgres://$(whoami)@localhost/my_database"
+```
+```js
+// index.js
+console.log('DATABASE_URL', process.env.DATABASE_URL)
+```
+```sh
+$ dotenvx run --debug -- node index.js
+[dotenvx@0.14.1] injecting env (1) from .env
+DATABASE_URL postgres://yourusername@localhost/my_database
+```
+
+### Syncing
+
+You need to keep `.env` files in sync between machines, environments, or team members? Use [dotenvx](https://github.com/dotenvx/dotenvx) to encrypt your `.env` files and safely include them in source control. This still subscribes to the twelve-factor app rules by generating a decryption key separate from code.
+
+### Multiple Environments
+
+Use [dotenvx](https://github.com/dotenvx/dotenvx) to generate `.env.ci`, `.env.production` files, and more.
+
+### Deploying
+
+You need to deploy your secrets in a cloud-agnostic manner? Use [dotenvx](https://github.com/dotenvx/dotenvx) to generate a private decryption key that is set on your production server.
+
+## 🌴 Manage Multiple Environments
+
+Use [dotenvx](https://github.com/dotenvx/dotenvx)
+
+Run any environment locally. Create a `.env.ENVIRONMENT` file and use `--env-file` to load it. It's straightforward, yet flexible.
+
+```bash
+$ echo "HELLO=production" > .env.production
+$ echo "console.log('Hello ' + process.env.HELLO)" > index.js
+
+$ dotenvx run --env-file=.env.production -- node index.js
+Hello production
+> ^^
+```
+
+or with multiple .env files
+
+```bash
+$ echo "HELLO=local" > .env.local
+$ echo "HELLO=World" > .env
+$ echo "console.log('Hello ' + process.env.HELLO)" > index.js
+
+$ dotenvx run --env-file=.env.local --env-file=.env -- node index.js
+Hello local
+```
+
+[more environment examples](https://dotenvx.com/docs/quickstart/environments)
+
+## 🚀 Deploying
+
+Use [dotenvx](https://github.com/dotenvx/dotenvx).
+
+Add encryption to your `.env` files with a single command. Pass the `--encrypt` flag.
+
+```
+$ dotenvx set HELLO Production --encrypt -f .env.production
+$ echo "console.log('Hello ' + process.env.HELLO)" > index.js
+
+$ DOTENV_PRIVATE_KEY_PRODUCTION="<.env.production private key>" dotenvx run -- node index.js
+[dotenvx] injecting env (2) from .env.production
+Hello Production
+```
+
+[learn more](https://github.com/dotenvx/dotenvx?tab=readme-ov-file#encryption)
+
+## 📚 Examples
+
+See [examples](https://github.com/dotenv-org/examples) of using dotenv with various frameworks, languages, and configurations.
+
+* [nodejs](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-nodejs)
+* [nodejs (debug on)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-nodejs-debug)
+* [nodejs (override on)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-nodejs-override)
+* [nodejs (processEnv override)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-custom-target)
+* [esm](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-esm)
+* [esm (preload)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-esm-preload)
+* [typescript](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-typescript)
+* [typescript parse](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-typescript-parse)
+* [typescript config](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-typescript-config)
+* [webpack](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-webpack)
+* [webpack (plugin)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-webpack2)
+* [react](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-react)
+* [react (typescript)](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-react-typescript)
+* [express](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-express)
+* [nestjs](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-nestjs)
+* [fastify](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-fastify)
+
+## 📖 Documentation
+
+Dotenv exposes four functions:
+
+* `config`
+* `parse`
+* `populate`
+* `decrypt`
+
+### Config
+
+`config` will read your `.env` file, parse the contents, assign it to
+[`process.env`](https://nodejs.org/docs/latest/api/process.html#process_process_env),
+and return an Object with a `parsed` key containing the loaded content or an `error` key if it failed.
+
+```js
+const result = dotenv.config()
+
+if (result.error) {
+  throw result.error
+}
+
+console.log(result.parsed)
+```
+
+You can additionally, pass options to `config`.
+
+#### Options
+
+##### path
+
+Default: `path.resolve(process.cwd(), '.env')`
+
+Specify a custom path if your file containing environment variables is located elsewhere.
+
+```js
+require('dotenv').config({ path: '/custom/path/to/.env' })
+```
+
+By default, `config` will look for a file called .env in the current working directory.
+
+Pass in multiple files as an array, and they will be parsed in order and combined with `process.env` (or `option.processEnv`, if set). The first value set for a variable will win, unless the `options.override` flag is set, in which case the last value set will win.  If a value already exists in `process.env` and the `options.override` flag is NOT set, no changes will be made to that value. 
+
+```js  
+require('dotenv').config({ path: ['.env.local', '.env'] })
+```
+
+##### encoding
+
+Default: `utf8`
+
+Specify the encoding of your file containing environment variables.
+
+```js
+require('dotenv').config({ encoding: 'latin1' })
+```
+
+##### debug
+
+Default: `false`
+
+Turn on logging to help debug why certain keys or values are not being set as you expect.
+
+```js
+require('dotenv').config({ debug: process.env.DEBUG })
+```
+
+##### override
+
+Default: `false`
+
+Override any environment variables that have already been set on your machine with values from your .env file(s). If multiple files have been provided in `option.path` the override will also be used as each file is combined with the next. Without `override` being set, the first value wins. With `override` set the last value wins. 
+
+```js
+require('dotenv').config({ override: true })
+```
+
+##### processEnv
+
+Default: `process.env`
+
+Specify an object to write your environment variables to. Defaults to `process.env` environment variables.
+
+```js
+const myObject = {}
+require('dotenv').config({ processEnv: myObject })
+
+console.log(myObject) // values from .env
+console.log(process.env) // this was not changed or written to
+```
+
+### Parse
+
+The engine which parses the contents of your file containing environment
+variables is available to use. It accepts a String or Buffer and will return
+an Object with the parsed keys and values.
+
+```js
+const dotenv = require('dotenv')
+const buf = Buffer.from('BASIC=basic')
+const config = dotenv.parse(buf) // will return an object
+console.log(typeof config, config) // object { BASIC : 'basic' }
+```
+
+#### Options
+
+##### debug
+
+Default: `false`
+
+Turn on logging to help debug why certain keys or values are not being set as you expect.
+
+```js
+const dotenv = require('dotenv')
+const buf = Buffer.from('hello world')
+const opt = { debug: true }
+const config = dotenv.parse(buf, opt)
+// expect a debug message because the buffer is not in KEY=VAL form
+```
+
+### Populate
+
+The engine which populates the contents of your .env file to `process.env` is available for use. It accepts a target, a source, and options. This is useful for power users who want to supply their own objects.
+
+For example, customizing the source:
+
+```js
+const dotenv = require('dotenv')
+const parsed = { HELLO: 'world' }
+
+dotenv.populate(process.env, parsed)
+
+console.log(process.env.HELLO) // world
+```
+
+For example, customizing the source AND target:
+
+```js
+const dotenv = require('dotenv')
+const parsed = { HELLO: 'universe' }
+const target = { HELLO: 'world' } // empty object
+
+dotenv.populate(target, parsed, { override: true, debug: true })
+
+console.log(target) // { HELLO: 'universe' }
+```
+
+#### options
+
+##### Debug
+
+Default: `false`
+
+Turn on logging to help debug why certain keys or values are not being populated as you expect.
+
+##### override
+
+Default: `false`
+
+Override any environment variables that have already been set.
+
+## ❓ FAQ
+
+### Why is the `.env` file not loading my environment variables successfully?
+
+Most likely your `.env` file is not in the correct place. [See this stack overflow](https://stackoverflow.com/questions/42335016/dotenv-file-is-not-loading-environment-variables).
+
+Turn on debug mode and try again..
+
+```js
+require('dotenv').config({ debug: true })
+```
+
+You will receive a helpful error outputted to your console.
+
+### Should I commit my `.env` file?
+
+No. We **strongly** recommend against committing your `.env` file to version
+control. It should only include environment-specific values such as database
+passwords or API keys. Your production database should have a different
+password than your development database.
+
+### Should I have multiple `.env` files?
+
+We recommend creating one `.env` file per environment. Use `.env` for local/development, `.env.production` for production and so on. This still follows the twelve factor principles as each is attributed individually to its own environment. Avoid custom set ups that work in inheritance somehow (`.env.production` inherits values form `.env` for example). It is better to duplicate values if necessary across each `.env.environment` file.
+
+> In a twelve-factor app, env vars are granular controls, each fully orthogonal to other env vars. They are never grouped together as “environments”, but instead are independently managed for each deploy. This is a model that scales up smoothly as the app naturally expands into more deploys over its lifetime.
+>
+> – [The Twelve-Factor App](http://12factor.net/config)
+
+### What rules does the parsing engine follow?
+
+The parsing engine currently supports the following rules:
+
+- `BASIC=basic` becomes `{BASIC: 'basic'}`
+- empty lines are skipped
+- lines beginning with `#` are treated as comments
+- `#` marks the beginning of a comment (unless when the value is wrapped in quotes)
+- empty values become empty strings (`EMPTY=` becomes `{EMPTY: ''}`)
+- inner quotes are maintained (think JSON) (`JSON={"foo": "bar"}` becomes `{JSON:"{\"foo\": \"bar\"}"`)
+- whitespace is removed from both ends of unquoted values (see more on [`trim`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/Trim)) (`FOO=  some value  ` becomes `{FOO: 'some value'}`)
+- single and double quoted values are escaped (`SINGLE_QUOTE='quoted'` becomes `{SINGLE_QUOTE: "quoted"}`)
+- single and double quoted values maintain whitespace from both ends (`FOO="  some value  "` becomes `{FOO: '  some value  '}`)
+- double quoted values expand new lines (`MULTILINE="new\nline"` becomes
+
+```
+{MULTILINE: 'new
+line'}
+```
+
+- backticks are supported (`` BACKTICK_KEY=`This has 'single' and "double" quotes inside of it.` ``)
+
+### What happens to environment variables that were already set?
+
+By default, we will never modify any environment variables that have already been set. In particular, if there is a variable in your `.env` file which collides with one that already exists in your environment, then that variable will be skipped.
+
+If instead, you want to override `process.env` use the `override` option.
+
+```javascript
+require('dotenv').config({ override: true })
+```
+
+### How come my environment variables are not showing up for React?
+
+Your React code is run in Webpack, where the `fs` module or even the `process` global itself are not accessible out-of-the-box. `process.env` can only be injected through Webpack configuration.
+
+If you are using [`react-scripts`](https://www.npmjs.com/package/react-scripts), which is distributed through [`create-react-app`](https://create-react-app.dev/), it has dotenv built in but with a quirk. Preface your environment variables with `REACT_APP_`. See [this stack overflow](https://stackoverflow.com/questions/42182577/is-it-possible-to-use-dotenv-in-a-react-project) for more details.
+
+If you are using other frameworks (e.g. Next.js, Gatsby...), you need to consult their documentation for how to inject environment variables into the client.
+
+### Can I customize/write plugins for dotenv?
+
+Yes! `dotenv.config()` returns an object representing the parsed `.env` file. This gives you everything you need to continue setting values on `process.env`. For example:
+
+```js
+const dotenv = require('dotenv')
+const variableExpansion = require('dotenv-expand')
+const myEnv = dotenv.config()
+variableExpansion(myEnv)
+```
+
+### How do I use dotenv with `import`?
+
+Simply..
+
+```javascript
+// index.mjs (ESM)
+import 'dotenv/config' // see https://github.com/motdotla/dotenv#how-do-i-use-dotenv-with-import
+import express from 'express'
+```
+
+A little background..
+
+> When you run a module containing an `import` declaration, the modules it imports are loaded first, then each module body is executed in a depth-first traversal of the dependency graph, avoiding cycles by skipping anything already executed.
+>
+> – [ES6 In Depth: Modules](https://hacks.mozilla.org/2015/08/es6-in-depth-modules/)
+
+What does this mean in plain language? It means you would think the following would work but it won't.
+
+`errorReporter.mjs`:
+```js
+class Client {
+  constructor (apiKey) {
+    console.log('apiKey', apiKey)
+
+    this.apiKey = apiKey
+  }
+}
+
+export default new Client(process.env.API_KEY)
+```
+`index.mjs`:
+```js
+// Note: this is INCORRECT and will not work
+import * as dotenv from 'dotenv'
+dotenv.config()
+
+import errorReporter from './errorReporter.mjs' // process.env.API_KEY will be blank!
+```
+
+`process.env.API_KEY` will be blank.
+
+Instead, `index.mjs` should be written as..
+
+```js
+import 'dotenv/config'
+
+import errorReporter from './errorReporter.mjs'
+```
+
+Does that make sense? It's a bit unintuitive, but it is how importing of ES6 modules work. Here is a [working example of this pitfall](https://github.com/dotenv-org/examples/tree/master/usage/dotenv-es6-import-pitfall).
+
+There are two alternatives to this approach:
+
+1. Preload dotenv: `node --require dotenv/config index.js` (_Note: you do not need to `import` dotenv with this approach_)
+2. Create a separate file that will execute `config` first as outlined in [this comment on #133](https://github.com/motdotla/dotenv/issues/133#issuecomment-255298822)
+
+### Why am I getting the error `Module not found: Error: Can't resolve 'crypto|os|path'`?
+
+You are using dotenv on the front-end and have not included a polyfill. Webpack < 5 used to include these for you. Do the following:
+
+```bash
+npm install node-polyfill-webpack-plugin
+```
+
+Configure your `webpack.config.js` to something like the following.
+
+```js
+require('dotenv').config()
+
+const path = require('path');
+const webpack = require('webpack')
+
+const NodePolyfillPlugin = require('node-polyfill-webpack-plugin')
+
+module.exports = {
+  mode: 'development',
+  entry: './src/index.ts',
+  output: {
+    filename: 'bundle.js',
+    path: path.resolve(__dirname, 'dist'),
+  },
+  plugins: [
+    new NodePolyfillPlugin(),
+    new webpack.DefinePlugin({
+      'process.env': {
+        HELLO: JSON.stringify(process.env.HELLO)
+      }
+    }),
+  ]
+};
+```
+
+Alternatively, just use [dotenv-webpack](https://github.com/mrsteele/dotenv-webpack) which does this and more behind the scenes for you.
+
+### What about variable expansion?
+
+Try [dotenv-expand](https://github.com/motdotla/dotenv-expand)
+
+### What about syncing and securing .env files?
+
+Use [dotenvx](https://github.com/dotenvx/dotenvx)
+
+### What if I accidentally commit my `.env` file to code?
+
+Remove it, [remove git history](https://docs.github.com/en/authentication/keeping-your-account-and-data-secure/removing-sensitive-data-from-a-repository) and then install the [git pre-commit hook](https://github.com/dotenvx/dotenvx#pre-commit) to prevent this from ever happening again. 
+
+```
+brew install dotenvx/brew/dotenvx
+dotenvx precommit --install
+```
+
+### How can I prevent committing my `.env` file to a Docker build?
+
+Use the [docker prebuild hook](https://dotenvx.com/docs/features/prebuild).
+
+```bash
+# Dockerfile
+...
+RUN curl -fsS https://dotenvx.sh/ | sh
+...
+RUN dotenvx prebuild
+CMD ["dotenvx", "run", "--", "node", "index.js"]
+```
+
+## Contributing Guide
+
+See [CONTRIBUTING.md](CONTRIBUTING.md)
+
+## CHANGELOG
+
+See [CHANGELOG.md](CHANGELOG.md)
+
+## Who's using dotenv?
+
+[These npm modules depend on it.](https://www.npmjs.com/browse/depended/dotenv)
+
+Projects that expand it often use the [keyword "dotenv" on npm](https://www.npmjs.com/search?q=keywords:dotenv).
diff --git a/node_modules/dotenv/SECURITY.md b/node_modules/dotenv/SECURITY.md
new file mode 100644
index 0000000..237a8ce
--- /dev/null
+++ b/node_modules/dotenv/SECURITY.md
@@ -0,0 +1 @@
+Please report any security vulnerabilities to security@dotenvx.com. 
diff --git a/node_modules/dotenv/config.d.ts b/node_modules/dotenv/config.d.ts
new file mode 100644
index 0000000..cb0ff5c
--- /dev/null
+++ b/node_modules/dotenv/config.d.ts
@@ -0,0 +1 @@
+export {};
diff --git a/node_modules/dotenv/config.js b/node_modules/dotenv/config.js
new file mode 100644
index 0000000..b0b5576
--- /dev/null
+++ b/node_modules/dotenv/config.js
@@ -0,0 +1,9 @@
+(function () {
+  require('./lib/main').config(
+    Object.assign(
+      {},
+      require('./lib/env-options'),
+      require('./lib/cli-options')(process.argv)
+    )
+  )
+})()
diff --git a/node_modules/dotenv/lib/cli-options.js b/node_modules/dotenv/lib/cli-options.js
new file mode 100644
index 0000000..b6e40db
--- /dev/null
+++ b/node_modules/dotenv/lib/cli-options.js
@@ -0,0 +1,17 @@
+const re = /^dotenv_config_(encoding|path|quiet|debug|override|DOTENV_KEY)=(.+)$/
+
+module.exports = function optionMatcher (args) {
+  const options = args.reduce(function (acc, cur) {
+    const matches = cur.match(re)
+    if (matches) {
+      acc[matches[1]] = matches[2]
+    }
+    return acc
+  }, {})
+
+  if (!('quiet' in options)) {
+    options.quiet = 'true'
+  }
+
+  return options
+}
diff --git a/node_modules/dotenv/lib/env-options.js b/node_modules/dotenv/lib/env-options.js
new file mode 100644
index 0000000..5dcee8a
--- /dev/null
+++ b/node_modules/dotenv/lib/env-options.js
@@ -0,0 +1,28 @@
+// ../config.js accepts options via environment variables
+const options = {}
+
+if (process.env.DOTENV_CONFIG_ENCODING != null) {
+  options.encoding = process.env.DOTENV_CONFIG_ENCODING
+}
+
+if (process.env.DOTENV_CONFIG_PATH != null) {
+  options.path = process.env.DOTENV_CONFIG_PATH
+}
+
+if (process.env.DOTENV_CONFIG_QUIET != null) {
+  options.quiet = process.env.DOTENV_CONFIG_QUIET
+}
+
+if (process.env.DOTENV_CONFIG_DEBUG != null) {
+  options.debug = process.env.DOTENV_CONFIG_DEBUG
+}
+
+if (process.env.DOTENV_CONFIG_OVERRIDE != null) {
+  options.override = process.env.DOTENV_CONFIG_OVERRIDE
+}
+
+if (process.env.DOTENV_CONFIG_DOTENV_KEY != null) {
+  options.DOTENV_KEY = process.env.DOTENV_CONFIG_DOTENV_KEY
+}
+
+module.exports = options
diff --git a/node_modules/dotenv/lib/main.d.ts b/node_modules/dotenv/lib/main.d.ts
new file mode 100644
index 0000000..82604e8
--- /dev/null
+++ b/node_modules/dotenv/lib/main.d.ts
@@ -0,0 +1,162 @@
+// TypeScript Version: 3.0
+/// <reference types="node" />
+import type { URL } from 'url';
+
+export interface DotenvParseOutput {
+  [name: string]: string;
+}
+
+/**
+ * Parses a string or buffer in the .env file format into an object.
+ *
+ * See https://dotenvx.com/docs
+ *
+ * @param src - contents to be parsed. example: `'DB_HOST=localhost'`
+ * @returns an object with keys and values based on `src`. example: `{ DB_HOST : 'localhost' }`
+ */
+export function parse<T extends DotenvParseOutput = DotenvParseOutput>(
+  src: string | Buffer
+): T;
+
+export interface DotenvConfigOptions {
+  /**
+   * Default: `path.resolve(process.cwd(), '.env')`
+   *
+   * Specify a custom path if your file containing environment variables is located elsewhere.
+   * Can also be an array of strings, specifying multiple paths.
+   *
+   * example: `require('dotenv').config({ path: '/custom/path/to/.env' })`
+   * example: `require('dotenv').config({ path: ['/path/to/first.env', '/path/to/second.env'] })`
+   */
+  path?: string | string[] | URL;
+
+  /**
+   * Default: `utf8`
+   *
+   * Specify the encoding of your file containing environment variables.
+   *
+   * example: `require('dotenv').config({ encoding: 'latin1' })`
+   */
+  encoding?: string;
+
+  /**
+   * Default: `false`
+   *
+   * Suppress all output (except errors).
+   *
+   * example: `require('dotenv').config({ quiet: true })`
+   */
+  quiet?: boolean;
+
+  /**
+   * Default: `false`
+   *
+   * Turn on logging to help debug why certain keys or values are not being set as you expect.
+   *
+   * example: `require('dotenv').config({ debug: process.env.DEBUG })`
+   */
+  debug?: boolean;
+
+  /**
+   * Default: `false`
+   *
+   * Override any environment variables that have already been set on your machine with values from your .env file.
+   *
+   * example: `require('dotenv').config({ override: true })`
+   */
+  override?: boolean;
+
+  /**
+   * Default: `process.env`
+   *
+   * Specify an object to write your secrets to. Defaults to process.env environment variables.
+   *
+   * example: `const processEnv = {}; require('dotenv').config({ processEnv: processEnv })`
+   */
+  processEnv?: DotenvPopulateInput;
+
+  /**
+   * Default: `undefined`
+   *
+   * Pass the DOTENV_KEY directly to config options. Defaults to looking for process.env.DOTENV_KEY environment variable. Note this only applies to decrypting .env.vault files. If passed as null or undefined, or not passed at all, dotenv falls back to its traditional job of parsing a .env file.
+   *
+   * example: `require('dotenv').config({ DOTENV_KEY: 'dotenv://:key_1234…@dotenvx.com/vault/.env.vault?environment=production' })`
+   */
+  DOTENV_KEY?: string;
+}
+
+export interface DotenvConfigOutput {
+  error?: Error;
+  parsed?: DotenvParseOutput;
+}
+
+export interface DotenvPopulateOptions {
+  /**
+   * Default: `false`
+   *
+   * Turn on logging to help debug why certain keys or values are not being set as you expect.
+   *
+   * example: `require('dotenv').config({ debug: process.env.DEBUG })`
+   */
+  debug?: boolean;
+
+  /**
+   * Default: `false`
+   *
+   * Override any environment variables that have already been set on your machine with values from your .env file.
+   *
+   * example: `require('dotenv').config({ override: true })`
+   */
+  override?: boolean;
+}
+
+export interface DotenvPopulateInput {
+  [name: string]: string;
+}
+
+/**
+ * Loads `.env` file contents into process.env by default. If `DOTENV_KEY` is present, it smartly attempts to load encrypted `.env.vault` file contents into process.env.
+ *
+ * See https://dotenvx.com/docs
+ *
+ * @param options - additional options. example: `{ path: './custom/path', encoding: 'latin1', quiet: false, debug: true, override: false }`
+ * @returns an object with a `parsed` key if successful or `error` key if an error occurred. example: { parsed: { KEY: 'value' } }
+ *
+ */
+export function config(options?: DotenvConfigOptions): DotenvConfigOutput;
+
+/**
+ * Loads `.env` file contents into process.env.
+ *
+ * See https://dotenvx.com/docs
+ *
+ * @param options - additional options. example: `{ path: './custom/path', encoding: 'latin1', quiet: false, debug: true, override: false }`
+ * @returns an object with a `parsed` key if successful or `error` key if an error occurred. example: { parsed: { KEY: 'value' } }
+ *
+ */
+export function configDotenv(options?: DotenvConfigOptions): DotenvConfigOutput;
+
+/**
+ * Loads `source` json contents into `target` like process.env.
+ *
+ * See https://dotenvx.com/docs
+ *
+ * @param processEnv - the target JSON object. in most cases use process.env but you can also pass your own JSON object
+ * @param parsed - the source JSON object
+ * @param options - additional options. example: `{ quiet: false, debug: true, override: false }`
+ * @returns {void}
+ *
+ */
+export function populate(processEnv: DotenvPopulateInput, parsed: DotenvPopulateInput, options?: DotenvConfigOptions): void;
+
+/**
+ * Decrypt ciphertext
+ *
+ * See https://dotenvx.com/docs
+ *
+ * @param encrypted - the encrypted ciphertext string
+ * @param keyStr - the decryption key string
+ * @returns {string}
+ *
+ */
+export function decrypt(encrypted: string, keyStr: string): string;
diff --git a/node_modules/dotenv/lib/main.js b/node_modules/dotenv/lib/main.js
new file mode 100644
index 0000000..91cabe4
--- /dev/null
+++ b/node_modules/dotenv/lib/main.js
@@ -0,0 +1,386 @@
+const fs = require('fs')
+const path = require('path')
+const os = require('os')
+const crypto = require('crypto')
+const packageJson = require('../package.json')
+
+const version = packageJson.version
+
+const LINE = /(?:^|^)\s*(?:export\s+)?([\w.-]+)(?:\s*=\s*?|:\s+?)(\s*'(?:\\'|[^'])*'|\s*"(?:\\"|[^"])*"|\s*`(?:\\`|[^`])*`|[^#\r\n]+)?\s*(?:#.*)?(?:$|$)/mg
+
+// Parse src into an Object
+function parse (src) {
+  const obj = {}
+
+  // Convert buffer to string
+  let lines = src.toString()
+
+  // Convert line breaks to same format
+  lines = lines.replace(/\r\n?/mg, '\n')
+
+  let match
+  while ((match = LINE.exec(lines)) != null) {
+    const key = match[1]
+
+    // Default undefined or null to empty string
+    let value = (match[2] || '')
+
+    // Remove whitespace
+    value = value.trim()
+
+    // Check if double quoted
+    const maybeQuote = value[0]
+
+    // Remove surrounding quotes
+    value = value.replace(/^(['"`])([\s\S]*)\1$/mg, '$2')
+
+    // Expand newlines if double quoted
+    if (maybeQuote === '"') {
+      value = value.replace(/\\n/g, '\n')
+      value = value.replace(/\\r/g, '\r')
+    }
+
+    // Add to object
+    obj[key] = value
+  }
+
+  return obj
+}
+
+function _parseVault (options) {
+  options = options || {}
+
+  const vaultPath = _vaultPath(options)
+  options.path = vaultPath // parse .env.vault
+  const result = DotenvModule.configDotenv(options)
+  if (!result.parsed) {
+    const err = new Error(`MISSING_DATA: Cannot parse ${vaultPath} for an unknown reason`)
+    err.code = 'MISSING_DATA'
+    throw err
+  }
+
+  // handle scenario for comma separated keys - for use with key rotation
+  // example: DOTENV_KEY="dotenv://:key_1234@dotenvx.com/vault/.env.vault?environment=prod,dotenv://:key_7890@dotenvx.com/vault/.env.vault?environment=prod"
+  const keys = _dotenvKey(options).split(',')
+  const length = keys.length
+
+  let decrypted
+  for (let i = 0; i < length; i++) {
+    try {
+      // Get full key
+      const key = keys[i].trim()
+
+      // Get instructions for decrypt
+      const attrs = _instructions(result, key)
+
+      // Decrypt
+      decrypted = DotenvModule.decrypt(attrs.ciphertext, attrs.key)
+
+      break
+    } catch (error) {
+      // last key
+      if (i + 1 >= length) {
+        throw error
+      }
+      // try next key
+    }
+  }
+
+  // Parse decrypted .env string
+  return DotenvModule.parse(decrypted)
+}
+
+function _warn (message) {
+  console.log(`[dotenv@${version}][WARN] ${message}`)
+}
+
+function _debug (message) {
+  console.log(`[dotenv@${version}][DEBUG] ${message}`)
+}
+
+function _log (message) {
+  console.log(`[dotenv@${version}] ${message}`)
+}
+
+function _dotenvKey (options) {
+  // prioritize developer directly setting options.DOTENV_KEY
+  if (options && options.DOTENV_KEY && options.DOTENV_KEY.length > 0) {
+    return options.DOTENV_KEY
+  }
+
+  // secondary infra already contains a DOTENV_KEY environment variable
+  if (process.env.DOTENV_KEY && process.env.DOTENV_KEY.length > 0) {
+    return process.env.DOTENV_KEY
+  }
+
+  // fallback to empty string
+  return ''
+}
+
+function _instructions (result, dotenvKey) {
+  // Parse DOTENV_KEY. Format is a URI
+  let uri
+  try {
+    uri = new URL(dotenvKey)
+  } catch (error) {
+    if (error.code === 'ERR_INVALID_URL') {
+      const err = new Error('INVALID_DOTENV_KEY: Wrong format. Must be in valid uri format like dotenv://:key_1234@dotenvx.com/vault/.env.vault?environment=development')
+      err.code = 'INVALID_DOTENV_KEY'
+      throw err
+    }
+
+    throw error
+  }
+
+  // Get decrypt key
+  const key = uri.password
+  if (!key) {
+    const err = new Error('INVALID_DOTENV_KEY: Missing key part')
+    err.code = 'INVALID_DOTENV_KEY'
+    throw err
+  }
+
+  // Get environment
+  const environment = uri.searchParams.get('environment')
+  if (!environment) {
+    const err = new Error('INVALID_DOTENV_KEY: Missing environment part')
+    err.code = 'INVALID_DOTENV_KEY'
+    throw err
+  }
+
+  // Get ciphertext payload
+  const environmentKey = `DOTENV_VAULT_${environment.toUpperCase()}`
+  const ciphertext = result.parsed[environmentKey] // DOTENV_VAULT_PRODUCTION
+  if (!ciphertext) {
+    const err = new Error(`NOT_FOUND_DOTENV_ENVIRONMENT: Cannot locate environment ${environmentKey} in your .env.vault file.`)
+    err.code = 'NOT_FOUND_DOTENV_ENVIRONMENT'
+    throw err
+  }
+
+  return { ciphertext, key }
+}
+
+function _vaultPath (options) {
+  let possibleVaultPath = null
+
+  if (options && options.path && options.path.length > 0) {
+    if (Array.isArray(options.path)) {
+      for (const filepath of options.path) {
+        if (fs.existsSync(filepath)) {
+          possibleVaultPath = filepath.endsWith('.vault') ? filepath : `${filepath}.vault`
+        }
+      }
+    } else {
+      possibleVaultPath = options.path.endsWith('.vault') ? options.path : `${options.path}.vault`
+    }
+  } else {
+    possibleVaultPath = path.resolve(process.cwd(), '.env.vault')
+  }
+
+  if (fs.existsSync(possibleVaultPath)) {
+    return possibleVaultPath
+  }
+
+  return null
+}
+
+function _resolveHome (envPath) {
+  return envPath[0] === '~' ? path.join(os.homedir(), envPath.slice(1)) : envPath
+}
+
+function _configVault (options) {
+  const debug = Boolean(options && options.debug)
+  const quiet = options && 'quiet' in options ? options.quiet : true
+
+  if (debug || !quiet) {
+    _log('Loading env from encrypted .env.vault')
+  }
+
+  const parsed = DotenvModule._parseVault(options)
+
+  let processEnv = process.env
+  if (options && options.processEnv != null) {
+    processEnv = options.processEnv
+  }
+
+  DotenvModule.populate(processEnv, parsed, options)
+
+  return { parsed }
+}
+
+function configDotenv (options) {
+  const dotenvPath = path.resolve(process.cwd(), '.env')
+  let encoding = 'utf8'
+  const debug = Boolean(options && options.debug)
+  const quiet = options && 'quiet' in options ? options.quiet : true
+
+  if (options && options.encoding) {
+    encoding = options.encoding
+  } else {
+    if (debug) {
+      _debug('No encoding is specified. UTF-8 is used by default')
+    }
+  }
+
+  let optionPaths = [dotenvPath] // default, look for .env
+  if (options && options.path) {
+    if (!Array.isArray(options.path)) {
+      optionPaths = [_resolveHome(options.path)]
+    } else {
+      optionPaths = [] // reset default
+      for (const filepath of options.path) {
+        optionPaths.push(_resolveHome(filepath))
+      }
+    }
+  }
+
+  // Build the parsed data in a temporary object (because we need to return it).  Once we have the final
+  // parsed data, we will combine it with process.env (or options.processEnv if provided).
+  let lastError
+  const parsedAll = {}
+  for (const path of optionPaths) {
+    try {
+      // Specifying an encoding returns a string instead of a buffer
+      const parsed = DotenvModule.parse(fs.readFileSync(path, { encoding }))
+
+      DotenvModule.populate(parsedAll, parsed, options)
+    } catch (e) {
+      if (debug) {
+        _debug(`Failed to load ${path} ${e.message}`)
+      }
+      lastError = e
+    }
+  }
+
+  let processEnv = process.env
+  if (options && options.processEnv != null) {
+    processEnv = options.processEnv
+  }
+
+  DotenvModule.populate(processEnv, parsedAll, options)
+
+  if (debug || !quiet) {
+    const keysCount = Object.keys(parsedAll).length
+    const shortPaths = []
+    for (const filePath of optionPaths) {
+      try {
+        const relative = path.relative(process.cwd(), filePath)
+        shortPaths.push(relative)
+      } catch (e) {
+        if (debug) {
+          _debug(`Failed to load ${filePath} ${e.message}`)
+        }
+        lastError = e
+      }
+    }
+
+    _log(`injecting env (${keysCount}) from ${shortPaths.join(',')}`)
+  }
+
+  if (lastError) {
+    return { parsed: parsedAll, error: lastError }
+  } else {
+    return { parsed: parsedAll }
+  }
+}
+
+// Populates process.env from .env file
+function config (options) {
+  // fallback to original dotenv if DOTENV_KEY is not set
+  if (_dotenvKey(options).length === 0) {
+    return DotenvModule.configDotenv(options)
+  }
+
+  const vaultPath = _vaultPath(options)
+
+  // dotenvKey exists but .env.vault file does not exist
+  if (!vaultPath) {
+    _warn(`You set DOTENV_KEY but you are missing a .env.vault file at ${vaultPath}. Did you forget to build it?`)
+
+    return DotenvModule.configDotenv(options)
+  }
+
+  return DotenvModule._configVault(options)
+}
+
+function decrypt (encrypted, keyStr) {
+  const key = Buffer.from(keyStr.slice(-64), 'hex')
+  let ciphertext = Buffer.from(encrypted, 'base64')
+
+  const nonce = ciphertext.subarray(0, 12)
+  const authTag = ciphertext.subarray(-16)
+  ciphertext = ciphertext.subarray(12, -16)
+
+  try {
+    const aesgcm = crypto.createDecipheriv('aes-256-gcm', key, nonce)
+    aesgcm.setAuthTag(authTag)
+    return `${aesgcm.update(ciphertext)}${aesgcm.final()}`
+  } catch (error) {
+    const isRange = error instanceof RangeError
+    const invalidKeyLength = error.message === 'Invalid key length'
+    const decryptionFailed = error.message === 'Unsupported state or unable to authenticate data'
+
+    if (isRange || invalidKeyLength) {
+      const err = new Error('INVALID_DOTENV_KEY: It must be 64 characters long (or more)')
+      err.code = 'INVALID_DOTENV_KEY'
+      throw err
+    } else if (decryptionFailed) {
+      const err = new Error('DECRYPTION_FAILED: Please check your DOTENV_KEY')
+      err.code = 'DECRYPTION_FAILED'
+      throw err
+    } else {
+      throw error
+    }
+  }
+}
+
+// Populate process.env with parsed values
+function populate (processEnv, parsed, options = {}) {
+  const debug = Boolean(options && options.debug)
+  const override = Boolean(options && options.override)
+
+  if (typeof parsed !== 'object') {
+    const err = new Error('OBJECT_REQUIRED: Please check the processEnv argument being passed to populate')
+    err.code = 'OBJECT_REQUIRED'
+    throw err
+  }
+
+  // Set process.env
+  for (const key of Object.keys(parsed)) {
+    if (Object.prototype.hasOwnProperty.call(processEnv, key)) {
+      if (override === true) {
+        processEnv[key] = parsed[key]
+      }
+
+      if (debug) {
+        if (override === true) {
+          _debug(`"${key}" is already defined and WAS overwritten`)
+        } else {
+          _debug(`"${key}" is already defined and was NOT overwritten`)
+        }
+      }
+    } else {
+      processEnv[key] = parsed[key]
+    }
+  }
+}
+
+const DotenvModule = {
+  configDotenv,
+  _configVault,
+  _parseVault,
+  config,
+  decrypt,
+  parse,
+  populate
+}
+
+module.exports.configDotenv = DotenvModule.configDotenv
+module.exports._configVault = DotenvModule._configVault
+module.exports._parseVault = DotenvModule._parseVault
+module.exports.config = DotenvModule.config
+module.exports.decrypt = DotenvModule.decrypt
+module.exports.parse = DotenvModule.parse
+module.exports.populate = DotenvModule.populate
+
+module.exports = DotenvModule
diff --git a/node_modules/dotenv/package.json b/node_modules/dotenv/package.json
new file mode 100644
index 0000000..e937256
--- /dev/null
+++ b/node_modules/dotenv/package.json
@@ -0,0 +1,62 @@
+{
+  "name": "dotenv",
+  "version": "16.6.1",
+  "description": "Loads environment variables from .env file",
+  "main": "lib/main.js",
+  "types": "lib/main.d.ts",
+  "exports": {
+    ".": {
+      "types": "./lib/main.d.ts",
+      "require": "./lib/main.js",
+      "default": "./lib/main.js"
+    },
+    "./config": "./config.js",
+    "./config.js": "./config.js",
+    "./lib/env-options": "./lib/env-options.js",
+    "./lib/env-options.js": "./lib/env-options.js",
+    "./lib/cli-options": "./lib/cli-options.js",
+    "./lib/cli-options.js": "./lib/cli-options.js",
+    "./package.json": "./package.json"
+  },
+  "scripts": {
+    "dts-check": "tsc --project tests/types/tsconfig.json",
+    "lint": "standard",
+    "pretest": "npm run lint && npm run dts-check",
+    "test": "tap run --allow-empty-coverage --disable-coverage --timeout=60000",
+    "test:coverage": "tap run --show-full-coverage --timeout=60000 --coverage-report=text --coverage-report=lcov",
+    "prerelease": "npm test",
+    "release": "standard-version"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/motdotla/dotenv.git"
+  },
+  "homepage": "https://github.com/motdotla/dotenv#readme",
+  "funding": "https://dotenvx.com",
+  "keywords": [
+    "dotenv",
+    "env",
+    ".env",
+    "environment",
+    "variables",
+    "config",
+    "settings"
+  ],
+  "readmeFilename": "README.md",
+  "license": "BSD-2-Clause",
+  "devDependencies": {
+    "@types/node": "^18.11.3",
+    "decache": "^4.6.2",
+    "sinon": "^14.0.1",
+    "standard": "^17.0.0",
+    "standard-version": "^9.5.0",
+    "tap": "^19.2.0",
+    "typescript": "^4.8.4"
+  },
+  "engines": {
+    "node": ">=12"
+  },
+  "browser": {
+    "fs": false
+  }
+}
diff --git a/node_modules/escape-latex/LICENSE.md b/node_modules/escape-latex/LICENSE.md
new file mode 100644
index 0000000..6e54eff
--- /dev/null
+++ b/node_modules/escape-latex/LICENSE.md
@@ -0,0 +1,18 @@
+Copyright (c) 2012 Dang Mai
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/escape-latex/README.md b/node_modules/escape-latex/README.md
new file mode 100644
index 0000000..78ff9da
--- /dev/null
+++ b/node_modules/escape-latex/README.md
@@ -0,0 +1,75 @@
+# escape-latex
+
+[![Greenkeeper badge](https://badges.greenkeeper.io/dangmai/escape-latex.svg)](https://greenkeeper.io/)
+
+[![Build Status](https://travis-ci.org/dangmai/escape-latex.png)](https://travis-ci.org/dangmai/escape-latex)
+
+Escape LaTeX special characters with Javascript in NodeJS (>= 4.x) environment.
+
+## Usage
+
+```javascript
+npm install escape-latex
+var lescape = require('escape-latex');
+lescape("String to be escaped here #yolo");
+```
+
+## API
+
+```javascript
+lescape((input: String), {
+  preserveFormatting: Boolean,
+  escapeMapFn: Function,
+});
+```
+
+By default,
+`escape-latex` only escapes characters that would result in malformed LaTeX.
+These characters include `# $ % & \ ^ _ { }`.
+
+This means that the final LaTeX output might not look the same as your input Javascript string.
+For example, multiple spaces are kept as-is, which may be truncated to 1 space by your LaTeX software.
+
+If you want the final output string to be as similar to your input Javascript string as possible,
+you can set the `preserveFormatting` param to `true`, like so:
+
+```javascript
+lescape("Hello   World", { preserveFormatting: true });
+// Hello~~~World
+```
+
+Which will be converted to three non-breaking spaces by your LaTeX software.
+
+The list of format characters that are escaped include `space, \t (tab), – (en-dash), — (em-dash)`.
+
+There is also the param `escapeMapFn` to modify the mapping of escaped characters,
+so you can add/modify/remove your own escapes if necessary.
+
+It accepts a callback function that takes in the default character escapes and the formatting escapes as parameters, and returns a complete escape mapping. Here's an example:
+
+```javascript
+lescape("Hello   World", {
+  preseveFormatting: true,
+  escapeMapFn: function(defaultEscapes, formattingEscapes) {
+    formattingEscapes[" "] = "\\\\";
+    return Object.assign({}, defaultEscapes, formattingEscapes);
+  },
+});
+// Hello\\\\\\world
+```
+
+## Testing
+
+```
+npm test
+```
+
+## Notes
+
+* If you are updating from `escape-latex < 1.0.0`,
+  the `en-dash` and `em-dash` are no longer escaped by default.
+  Please use `preserveFormatting` to turn them on if necessary.
+
+## License
+
+MIT
diff --git a/node_modules/escape-latex/dist/index.js b/node_modules/escape-latex/dist/index.js
new file mode 100644
index 0000000..0da9c0d
--- /dev/null
+++ b/node_modules/escape-latex/dist/index.js
@@ -0,0 +1,80 @@
+"use strict";
+
+// Map the characters to escape to their escaped values. The list is derived
+// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters
+
+var _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; };
+
+var defaultEscapes = {
+  "{": "\\{",
+  "}": "\\}",
+  "\\": "\\textbackslash{}",
+  "#": "\\#",
+  $: "\\$",
+  "%": "\\%",
+  "&": "\\&",
+  "^": "\\textasciicircum{}",
+  _: "\\_",
+  "~": "\\textasciitilde{}"
+};
+var formatEscapes = {
+  "\u2013": "\\--",
+  "\u2014": "\\---",
+  " ": "~",
+  "\t": "\\qquad{}",
+  "\r\n": "\\newline{}",
+  "\n": "\\newline{}"
+};
+
+var defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {
+  return _extends({}, defaultEscapes, formatEscapes);
+};
+
+/**
+ * Escape a string to be used in LaTeX documents.
+ * @param {string} str the string to be escaped.
+ * @param {boolean} params.preserveFormatting whether formatting escapes should
+ *  be performed (default: false).
+ * @param {function} params.escapeMapFn the function to modify the escape maps.
+ * @return {string} the escaped string, ready to be used in LaTeX.
+ */
+module.exports = function (str) {
+  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},
+      _ref$preserveFormatti = _ref.preserveFormatting,
+      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,
+      _ref$escapeMapFn = _ref.escapeMapFn,
+      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;
+
+  var runningStr = String(str);
+  var result = "";
+
+  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});
+  var escapeKeys = Object.keys(escapes); // as it is reused later on
+
+  // Algorithm: Go through the string character by character, if it matches
+  // with one of the special characters then we'll replace it with the escaped
+  // version.
+
+  var _loop = function _loop() {
+    var specialCharFound = false;
+    escapeKeys.forEach(function (key, index) {
+      if (specialCharFound) {
+        return;
+      }
+      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {
+        result += escapes[escapeKeys[index]];
+        runningStr = runningStr.slice(key.length, runningStr.length);
+        specialCharFound = true;
+      }
+    });
+    if (!specialCharFound) {
+      result += runningStr.slice(0, 1);
+      runningStr = runningStr.slice(1, runningStr.length);
+    }
+  };
+
+  while (runningStr) {
+    _loop();
+  }
+  return result;
+};
\ No newline at end of file
diff --git a/node_modules/escape-latex/package.json b/node_modules/escape-latex/package.json
new file mode 100644
index 0000000..a57945d
--- /dev/null
+++ b/node_modules/escape-latex/package.json
@@ -0,0 +1,55 @@
+{
+  "name": "escape-latex",
+  "version": "1.2.0",
+  "description": "Escape LaTeX special characters with Javascript",
+  "main": "./dist/index.js",
+  "files": ["dist"],
+  "scripts": {
+    "test": "mocha --require babel-core/register -u tdd ./src/**/*.test.js",
+    "preversion": "npm test && npm run build",
+    "postversion": "git push && git push --tags",
+    "precommit": "npm run lint && lint-staged",
+    "prettier": "prettier --write ./src/**/*.js",
+    "lint": "eslint ./src",
+    "init": "mkdir dist",
+    "clean": "rm -rf dist",
+    "prebuild": "npm run clean && npm run init",
+    "build": "babel ./src -d ./dist --ignore index.test.js"
+  },
+  "lint-staged": {
+    "*.{js,json,css,md}": ["npm run prettier", "git add"]
+  },
+  "eslintConfig": {
+    "parserOptions": {
+      "ecmaVersion": 8
+    },
+    "extends": ["eslint:recommended", "google", "prettier"],
+    "env": {
+      "node": "true"
+    }
+  },
+  "prettier": {
+    "trailingComma": "all"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/dangmai/escape-latex"
+  },
+  "keywords": ["latex", "escape"],
+  "devDependencies": {
+    "babel-cli": "^6.26.0",
+    "babel-core": "^6.26.0",
+    "babel-plugin-transform-object-assign": "^6.22.0",
+    "babel-preset-env": "^1.6.1",
+    "chai": "^4.1.2",
+    "eslint": "^5.0.1",
+    "eslint-config-google": "^0.9.1",
+    "eslint-config-prettier": "^3.0.1",
+    "husky": "^0.14.3",
+    "lint-staged": "^7.0.5",
+    "mocha": "^5.0.0",
+    "prettier": "^1.9.2"
+  },
+  "author": "Dang Mai",
+  "license": "MIT"
+}
diff --git a/node_modules/fraction.js/CHANGELOG.md b/node_modules/fraction.js/CHANGELOG.md
new file mode 100644
index 0000000..ec492a7
--- /dev/null
+++ b/node_modules/fraction.js/CHANGELOG.md
@@ -0,0 +1,38 @@
+# CHANGELOG
+
+v5.2.2
+    - Improved documentation and removed unecessary check
+
+v5.2.1:
+  - 2bb7b05: Added negative sign check
+
+v5.2:
+  - 6f9d124: Implemented log and improved simplify
+  - b773e7a: Added named export to TS definition
+  - 70304f9: Fixed merge conflict
+  - 3b940d3: Implemented other comparing functions
+  - 10acdfc: Update README.md
+  - ba41d00: Update README.md
+  - 73ded97: Update README.md
+  - acabc39: Fixed param parsing
+
+v5.0.5:
+  - 2c9d4c2: Improved roundTo() and param parser
+
+v5.0.4:
+  - 39e61e7: Fixed bignum param passing
+
+v5.0.3:
+  - 7d9a3ec: Upgraded bundler for code quality
+
+v5.0.2:
+  - c64b1d6: fixed esm export
+
+v5.0.1:
+  - e440f9c: Fixed CJS export
+  - 9bbdd29: Fixed CJS export
+
+v5.0.0:
+  - ac7cd06: Fixed readme
+  - 33cc9e5: Added crude build
+  - 1adcc76: Release breaking v5.0. Fraction.js now builds on BigInt. The API stays the same as v4, except that the object attributes `n`, `d`, and `s`, are not Number but BigInt and may break code that directly accesses these attributes.
\ No newline at end of file
diff --git a/node_modules/fraction.js/LICENSE b/node_modules/fraction.js/LICENSE
new file mode 100644
index 0000000..8741015
--- /dev/null
+++ b/node_modules/fraction.js/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Robert Eisele
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/fraction.js/README.md b/node_modules/fraction.js/README.md
new file mode 100644
index 0000000..e53343e
--- /dev/null
+++ b/node_modules/fraction.js/README.md
@@ -0,0 +1,520 @@
+# Fraction.js - ℚ in JavaScript
+
+[![NPM Package](https://img.shields.io/npm/v/fraction.js.svg?style=flat)](https://npmjs.org/package/fraction.js "View this project on npm")
+[![MIT license](http://img.shields.io/badge/license-MIT-brightgreen.svg)](http://opensource.org/licenses/MIT)
+
+Do you find the limitations of floating-point arithmetic frustrating, especially when rational and irrational numbers like π or √2 are stored within the same finite precision? This can lead to avoidable inaccuracies such as:
+
+```javascript
+1 / 98 * 98 // Results in 0.9999999999999999
+```
+
+For applications requiring higher precision or where working with fractions is preferable, consider incorporating *Fraction.js* into your project.
+
+The library effectively addresses precision issues, as demonstrated below:
+
+```javascript
+Fraction(1).div(98).mul(98) // Returns 1
+```
+
+*Fraction.js* uses a `BigInt` representation for both the numerator and denominator, ensuring minimal performance overhead while maximizing accuracy. Its design is optimized for precision, making it an ideal choice as a foundational library for other math tools, such as [Polynomial.js](https://github.com/rawify/Polynomial.js) and [Math.js](https://github.com/josdejong/mathjs).
+
+## Convert Decimal to Fraction
+
+One of the core features of *Fraction.js* is its ability to seamlessly convert decimal numbers into fractions.
+
+```javascript
+let x = new Fraction(1.88);
+let res = x.toFraction(true); // Returns "1 22/25" as a string
+```
+
+This is particularly useful when you need precise fraction representations instead of dealing with the limitations of floating-point arithmetic. What if you allow some error tolerance?
+
+```javascript
+let x = new Fraction(0.33333);
+let res = x.simplify(0.001) // Error < 0.001
+       .toFraction(); // Returns "1/3" as a string
+```
+
+## Precision
+
+As native `BigInt` support in JavaScript becomes more common, libraries like *Fraction.js* use it to handle calculations with higher precision. This improves the speed and accuracy of math operations with large numbers, providing a better solution for tasks that need more precision than floating-point numbers can offer.
+
+## Examples / Motivation
+
+A simple example of using *Fraction.js* might look like this:
+
+```javascript
+var f = new Fraction("9.4'31'"); // 9.4313131313131...
+f.mul([-4, 3]).mod("4.'8'"); // 4.88888888888888...
+```
+
+The result can then be displayed as:
+
+```javascript
+console.log(f.toFraction()); // -4154 / 1485
+```
+
+Additionally, you can access the internal attributes of the fraction, such as the sign (s), numerator (n), and denominator (d). Keep in mind that these values are stored as `BigInt`:
+
+```javascript
+Number(f.s) * Number(f.n) / Number(f.d) = -1 * 4154 / 1485 = -2.797306...
+```
+
+If you attempted to calculate this manually using floating-point arithmetic, you'd get something like:
+
+```javascript
+(9.4313131 * (-4 / 3)) % 4.888888 = -2.797308133...
+```
+
+While the result is reasonably close, it’s not as accurate as the fraction-based approach that *Fraction.js* provides, especially when dealing with repeating decimals or complex operations. This highlights the value of precision that the library brings.
+
+### Laplace Probability
+
+Here's a straightforward example of using *Fraction.js* to calculate probabilities. Let's determine the probability of rolling a specific outcome on a fair die:
+
+- **P({3})**: The probability of rolling a 3.
+- **P({1, 4})**: The probability of rolling either 1 or 4.
+- **P({2, 4, 6})**: The probability of rolling 2, 4, or 6.
+
+#### P({3}):
+
+```javascript
+var p = new Fraction([3].length, 6).toString(); // "0.1(6)"
+```
+
+#### P({1, 4}):
+
+```javascript
+var p = new Fraction([1, 4].length, 6).toString(); // "0.(3)"
+```
+
+#### P({2, 4, 6}):
+
+```javascript
+var p = new Fraction([2, 4, 6].length, 6).toString(); // "0.5"
+```
+
+### Convert degrees/minutes/seconds to precise rational representation:
+
+57+45/60+17/3600
+
+```javascript
+var deg = 57; // 57°
+var min = 45; // 45 Minutes
+var sec = 17; // 17 Seconds
+
+new Fraction(deg).add(min, 60).add(sec, 3600).toString() // -> 57.7547(2)
+```
+
+
+### Rational approximation of irrational numbers
+
+To approximate a number like *sqrt(5) - 2* with a numerator and denominator, you can reformat the equation as follows: *pow(n / d + 2, 2) = 5*.
+
+Then the following algorithm will generate the rational number besides the binary representation.
+
+```javascript
+var x = "/", s = "";
+
+var a = new Fraction(0),
+    b = new Fraction(1);
+for (var n = 0; n <= 10; n++) {
+
+  var c = a.add(b).div(2);
+
+  console.log(n + "\t" + a + "\t" + b + "\t" + c + "\t" + x);
+
+  if (c.add(2).pow(2).valueOf() < 5) {
+    a = c;
+    x = "1";
+  } else {
+    b = c;
+    x = "0";
+  }
+  s+= x;
+}
+console.log(s)
+```
+
+The result is
+
+```
+n   a[n]        b[n]        c[n]            x[n]
+0   0/1         1/1         1/2             /
+1   0/1         1/2         1/4             0
+2   0/1         1/4         1/8             0
+3   1/8         1/4         3/16            1
+4   3/16        1/4         7/32            1
+5   7/32        1/4         15/64           1
+6   15/64       1/4         31/128          1
+7   15/64       31/128      61/256          0
+8   15/64       61/256      121/512         0
+9   15/64       121/512     241/1024        0
+10  241/1024    121/512     483/2048        1
+```
+
+Thus the approximation after 11 iterations of the bisection method is *483 / 2048* and the binary representation is 0.00111100011 (see [WolframAlpha](http://www.wolframalpha.com/input/?i=sqrt%285%29-2+binary))
+
+I published another example on how to approximate PI with fraction.js on my [blog](https://raw.org/article/rational-numbers-in-javascript/) (Still not the best idea to approximate irrational numbers, but it illustrates the capabilities of Fraction.js perfectly).
+
+
+### Get the exact fractional part of a number
+
+```javascript
+var f = new Fraction("-6.(3416)");
+console.log(f.mod(1).abs().toFraction()); // = 3416/9999
+```
+
+### Mathematical correct modulo
+
+The behaviour on negative congruences is different to most modulo implementations in computer science. Even the *mod()* function of Fraction.js behaves in the typical way. To solve the problem of having the mathematical correct modulo with Fraction.js you could come up with this:
+
+```javascript
+var a = -1;
+var b = 10.99;
+
+console.log(new Fraction(a)
+  .mod(b)); // Not correct, usual Modulo
+
+console.log(new Fraction(a)
+  .mod(b).add(b).mod(b)); // Correct! Mathematical Modulo
+```
+
+fmod() imprecision circumvented
+---
+It turns out that Fraction.js outperforms almost any fmod() implementation, including JavaScript itself, [php.js](http://phpjs.org/functions/fmod/), C++, Python, Java and even Wolframalpha due to the fact that numbers like 0.05, 0.1, ... are infinite decimal in base 2.
+
+The equation *fmod(4.55, 0.05)* gives *0.04999999999999957*, wolframalpha says *1/20*. The correct answer should be **zero**, as 0.05 divides 4.55 without any remainder.
+
+
+## Parser
+
+Any function (see below) as well as the constructor of the *Fraction* class parses its input and reduce it to the smallest term.
+
+You can pass either Arrays, Objects, Integers, Doubles or Strings.
+
+### Arrays / Objects
+
+```javascript
+new Fraction(numerator, denominator);
+new Fraction([numerator, denominator]);
+new Fraction({n: numerator, d: denominator});
+```
+
+### Integers
+
+```javascript
+new Fraction(123);
+```
+
+### Doubles
+
+```javascript
+new Fraction(55.4);
+```
+
+**Note:** If you pass a double as it is, Fraction.js will perform a number analysis based on Farey Sequences. If you concern performance, cache Fraction.js objects and pass arrays/objects.
+
+The method is really precise, but too large exact numbers, like 1234567.9991829 will result in a wrong approximation. If you want to keep the number as it is, convert it to a string, as the string parser will not perform any further observations. If you have problems with the approximation, in the file `examples/approx.js` is a different approximation algorithm, which might work better in some more specific use-cases.
+
+
+### Strings
+
+```javascript
+new Fraction("123.45");
+new Fraction("123/45"); // A rational number represented as two decimals, separated by a slash
+new Fraction("123:45"); // A rational number represented as two decimals, separated by a colon
+new Fraction("4 123/45"); // A rational number represented as a whole number and a fraction
+new Fraction("123.'456'"); // Note the quotes, see below!
+new Fraction("123.(456)"); // Note the brackets, see below!
+new Fraction("123.45'6'"); // Note the quotes, see below!
+new Fraction("123.45(6)"); // Note the brackets, see below!
+```
+
+### Two arguments
+
+```javascript
+new Fraction(3, 2); // 3/2 = 1.5
+```
+
+### Repeating decimal places
+
+*Fraction.js* can easily handle repeating decimal places. For example *1/3* is *0.3333...*. There is only one repeating digit. As you can see in the examples above, you can pass a number like *1/3* as "0.'3'" or "0.(3)", which are synonym. There are no tests to parse something like 0.166666666 to 1/6! If you really want to handle this number, wrap around brackets on your own with the function below for example: 0.1(66666666)
+
+Assume you want to divide 123.32 / 33.6(567). [WolframAlpha](http://www.wolframalpha.com/input/?i=123.32+%2F+%2812453%2F370%29) states that you'll get a period of 1776 digits. *Fraction.js* comes to the same result. Give it a try:
+
+```javascript
+var f = new Fraction("123.32");
+console.log("Bam: " + f.div("33.6(567)"));
+```
+
+To automatically make a number like "0.123123123" to something more Fraction.js friendly like "0.(123)", I hacked this little brute force algorithm in a 10 minutes. Improvements are welcome...
+
+```javascript
+function formatDecimal(str) {
+
+  var comma, pre, offset, pad, times, repeat;
+
+  if (-1 === (comma = str.indexOf(".")))
+    return str;
+
+  pre = str.substr(0, comma + 1);
+  str = str.substr(comma + 1);
+
+  for (var i = 0; i < str.length; i++) {
+
+    offset = str.substr(0, i);
+
+    for (var j = 0; j < 5; j++) {
+
+      pad = str.substr(i, j + 1);
+
+      times = Math.ceil((str.length - offset.length) / pad.length);
+
+      repeat = new Array(times + 1).join(pad); // Silly String.repeat hack
+
+      if (0 === (offset + repeat).indexOf(str)) {
+        return pre + offset + "(" + pad + ")";
+      }
+    }
+  }
+  return null;
+}
+
+var f, x = formatDecimal("13.0123123123"); // = 13.0(123)
+if (x !== null) {
+  f = new Fraction(x);
+}
+```
+
+## Attributes
+
+
+The Fraction object allows direct access to the numerator, denominator and sign attributes. It is ensured that only the sign-attribute holds sign information so that a sign comparison is only necessary against this attribute.
+
+```javascript
+var f = new Fraction('-1/2');
+console.log(f.n); // Numerator: 1
+console.log(f.d); // Denominator: 2
+console.log(f.s); // Sign: -1
+```
+
+
+## Functions
+
+### Fraction abs()
+
+Returns the actual number without any sign information
+
+### Fraction neg()
+
+Returns the actual number with flipped sign in order to get the additive inverse
+
+### Fraction add(n)
+
+Returns the sum of the actual number and the parameter n
+
+### Fraction sub(n)
+
+Returns the difference of the actual number and the parameter n
+
+### Fraction mul(n)
+
+Returns the product of the actual number and the parameter n
+
+### Fraction div(n)
+
+Returns the quotient of the actual number and the parameter n
+
+### Fraction pow(exp)
+
+Returns the power of the actual number, raised to an possible rational exponent. If the result becomes non-rational the function returns `null`.
+
+### Fraction log(base)
+
+Returns the logarithm of the actual number to a given rational base. If the result becomes non-rational the function returns `null`.
+
+### Fraction mod(n)
+
+Returns the modulus (rest of the division) of the actual object and n (this % n). It's a much more precise [fmod()](#fmod-impreciseness-circumvented) if you like. Please note that *mod()* is just like the modulo operator of most programming languages. If you want a mathematical correct modulo, see [here](#mathematical-correct-modulo).
+
+### Fraction mod()
+
+Returns the modulus (rest of the division) of the actual object (numerator mod denominator)
+
+### Fraction gcd(n)
+
+Returns the fractional greatest common divisor
+
+### Fraction lcm(n)
+
+Returns the fractional least common multiple
+
+### Fraction ceil([places=0-16])
+
+Returns the ceiling of a rational number with Math.ceil
+
+### Fraction floor([places=0-16])
+
+Returns the floor of a rational number with Math.floor
+
+### Fraction round([places=0-16])
+
+Returns the rational number rounded with Math.round
+
+### Fraction roundTo(multiple)
+
+Rounds a fraction to the closest multiple of another fraction. 
+
+### Fraction inverse()
+
+Returns the multiplicative inverse of the actual number (n / d becomes d / n) in order to get the reciprocal
+
+### Fraction simplify([eps=0.001])
+
+Simplifies the rational number under a certain error threshold. Ex. `0.333` will be `1/3` with `eps=0.001`
+
+### boolean equals(n)
+
+Check if two rational numbers are equal
+
+### boolean lt(n)
+
+Check if this rational number is less than another
+
+### boolean lte(n)
+
+Check if this rational number is less than or equal another
+
+### boolean gt(n)
+
+Check if this rational number is greater than another
+
+### boolean gte(n)
+
+Check if this rational number is greater than or equal another
+
+### int compare(n)
+
+Compare two numbers.
+```
+result < 0: n is greater than actual number
+result > 0: n is smaller than actual number
+result = 0: n is equal to the actual number
+```
+
+### boolean divisible(n)
+
+Check if two numbers are divisible (n divides this)
+
+### double valueOf()
+
+Returns a decimal representation of the fraction
+
+### String toString([decimalPlaces=15])
+
+Generates an exact string representation of the given object. For repeating decimal places, digits within repeating cycles are enclosed in parentheses, e.g., `1/3 = "0.(3)"`. For other numbers, the string will include up to the specified `decimalPlaces` significant digits, including any trailing zeros if truncation occurs. For example, `1/2` will be represented as `"0.5"`, without additional trailing zeros.
+
+**Note:** Since both `valueOf()` and `toString()` are provided, `toString()` will only be invoked implicitly when the object is used in a string context. For instance, when using the plus operator like `"123" + new Fraction`, `valueOf()` will be called first, as JavaScript attempts to combine primitives before concatenating them, with the string type taking precedence. However, `alert(new Fraction)` or `String(new Fraction)` will behave as expected. To ensure specific behavior, explicitly call either `toString()` or `valueOf()`.
+
+### String toLatex(showMixed=false)
+
+Generates an exact LaTeX representation of the actual object. You can see a [live demo](https://raw.org/article/rational-numbers-in-javascript/) on my blog.
+
+The optional boolean parameter indicates if you want to show the a mixed fraction. "1 1/3" instead of "4/3"
+
+### String toFraction(showMixed=false)
+
+Gets a string representation of the fraction
+
+The optional boolean parameter indicates if you want to showa mixed fraction. "1 1/3" instead of "4/3"
+
+### Array toContinued()
+
+Gets an array of the fraction represented as a continued fraction. The first element always contains the whole part.
+
+```javascript
+var f = new Fraction('88/33');
+var c = f.toContinued(); // [2, 1, 2]
+```
+
+### Fraction clone()
+
+Creates a copy of the actual Fraction object
+
+
+## Exceptions
+
+If a really hard error occurs (parsing error, division by zero), *Fraction.js* throws exceptions! Please make sure you handle them correctly.
+
+
+## Installation
+
+You can install `Fraction.js` via npm:
+
+```bash
+npm install fraction.js
+```
+
+Or with yarn:
+
+```bash
+yarn add fraction.js
+```
+
+Alternatively, download or clone the repository:
+
+```bash
+git clone https://github.com/rawify/Fraction.js
+```
+
+## Usage
+
+Include the `fraction.min.js` file in your project:
+
+```html
+<script src="path/to/fraction.min.js"></script>
+<script>
+  var x = new Fraction("13/4");
+</script>
+```
+
+Or in a Node.js project:
+
+```javascript
+const Fraction = require('fraction.js');
+```
+
+or 
+
+```javascript
+import Fraction from 'fraction.js';
+```
+
+
+## Coding Style
+
+As every library I publish, Fraction.js is also built to be as small as possible after compressing it with Google Closure Compiler in advanced mode. Thus the coding style orientates a little on maxing-out the compression rate. Please make sure you keep this style if you plan to extend the library.
+
+## Building the library
+
+After cloning the Git repository run:
+
+```bash
+npm install
+npm run build
+```
+
+## Run a test
+
+Testing the source against the shipped test suite is as easy as
+
+```bash
+npm run test
+```
+
+## Copyright and Licensing
+
+Copyright (c) 2025, [Robert Eisele](https://raw.org/)
+Licensed under the MIT license.
diff --git a/node_modules/fraction.js/dist/fraction.js b/node_modules/fraction.js/dist/fraction.js
new file mode 100644
index 0000000..816d5db
--- /dev/null
+++ b/node_modules/fraction.js/dist/fraction.js
@@ -0,0 +1,1045 @@
+'use strict';
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <numerator>, 1 => <denominator> ]
+ * { n => <numerator>, d => <denominator> }
+ *
+ * Integer form
+ * - Single integer value as BigInt or Number
+ *
+ * Double form
+ * - Single double value as Number
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ * let f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+// Set Identity function to downgrade BigInt to Number if needed
+if (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(""); return n; };
+
+const C_ZERO = BigInt(0);
+const C_ONE = BigInt(1);
+const C_TWO = BigInt(2);
+const C_THREE = BigInt(3);
+const C_FIVE = BigInt(5);
+const C_TEN = BigInt(10);
+const MAX_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);
+
+// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+// Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+const MAX_CYCLE_LEN = 2000;
+
+// Parsed data to avoid calling "new" all the time
+const P = {
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE
+};
+
+function assign(n, s) {
+
+  try {
+    n = BigInt(n);
+  } catch (e) {
+    throw InvalidParameter();
+  }
+  return n * s;
+}
+
+function ifloor(x) {
+  return typeof x === 'bigint' ? x : Math.floor(x);
+}
+
+// Creates a new Fraction internally without the need of the bulky constructor
+function newFraction(n, d) {
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  const f = Object.create(Fraction.prototype);
+  f["s"] = n < C_ZERO ? -C_ONE : C_ONE;
+
+  n = n < C_ZERO ? -n : n;
+
+  const a = gcd(n, d);
+
+  f["n"] = n / a;
+  f["d"] = d / a;
+  return f;
+}
+
+const FACTORSTEPS = [C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO * C_THREE, C_TWO, C_TWO * C_THREE]; // repeats
+function factorize(n) {
+
+  const factors = Object.create(null);
+  if (n <= C_ONE) {
+    factors[n] = C_ONE;
+    return factors;
+  }
+
+  const add = (p) => { factors[p] = (factors[p] || C_ZERO) + C_ONE; };
+
+  while (n % C_TWO === C_ZERO) { add(C_TWO); n /= C_TWO; }
+  while (n % C_THREE === C_ZERO) { add(C_THREE); n /= C_THREE; }
+  while (n % C_FIVE === C_ZERO) { add(C_FIVE); n /= C_FIVE; }
+
+  // 30-wheel trial division: test only residues coprime to 2*3*5
+  // Residue step pattern after 5: 7,11,13,17,19,23,29,31, ...
+  for (let si = 0, p = C_TWO + C_FIVE; p * p <= n;) {
+    while (n % p === C_ZERO) { add(p); n /= p; }
+    p += FACTORSTEPS[si];
+    si = (si + 1) & 7; // fast modulo 8
+  }
+  if (n > C_ONE) add(n);
+  return factors;
+}
+
+const parse = function (p1, p2) {
+
+  let n = C_ZERO, d = C_ONE, s = C_ONE;
+
+  if (p1 === undefined || p1 === null) { // No argument
+    /* void */
+  } else if (p2 !== undefined) { // Two arguments
+
+    if (typeof p1 === "bigint") {
+      n = p1;
+    } else if (isNaN(p1)) {
+      throw InvalidParameter();
+    } else if (p1 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      n = BigInt(p1);
+    }
+
+    if (typeof p2 === "bigint") {
+      d = p2;
+    } else if (isNaN(p2)) {
+      throw InvalidParameter();
+    } else if (p2 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      d = BigInt(p2);
+    }
+
+    s = n * d;
+
+  } else if (typeof p1 === "object") {
+    if ("d" in p1 && "n" in p1) {
+      n = BigInt(p1["n"]);
+      d = BigInt(p1["d"]);
+      if ("s" in p1)
+        n *= BigInt(p1["s"]);
+    } else if (0 in p1) {
+      n = BigInt(p1[0]);
+      if (1 in p1)
+        d = BigInt(p1[1]);
+    } else if (typeof p1 === "bigint") {
+      n = p1;
+    } else {
+      throw InvalidParameter();
+    }
+    s = n * d;
+  } else if (typeof p1 === "number") {
+
+    if (isNaN(p1)) {
+      throw InvalidParameter();
+    }
+
+    if (p1 < 0) {
+      s = -C_ONE;
+      p1 = -p1;
+    }
+
+    if (p1 % 1 === 0) {
+      n = BigInt(p1);
+    } else {
+
+      let z = 1;
+
+      let A = 0, B = 1;
+      let C = 1, D = 1;
+
+      let N = 10000000;
+
+      if (p1 >= 1) {
+        z = 10 ** Math.floor(1 + Math.log10(p1));
+        p1 /= z;
+      }
+
+      // Using Farey Sequences
+
+      while (B <= N && D <= N) {
+        let M = (A + C) / (B + D);
+
+        if (p1 === M) {
+          if (B + D <= N) {
+            n = A + C;
+            d = B + D;
+          } else if (D > B) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+          break;
+
+        } else {
+
+          if (p1 > M) {
+            A += C;
+            B += D;
+          } else {
+            C += A;
+            D += B;
+          }
+
+          if (B > N) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+        }
+      }
+      n = BigInt(n) * BigInt(z);
+      d = BigInt(d);
+    }
+
+  } else if (typeof p1 === "string") {
+
+    let ndx = 0;
+
+    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;
+
+    let match = p1.replace(/_/g, '').match(/\d+|./g);
+
+    if (match === null)
+      throw InvalidParameter();
+
+    if (match[ndx] === '-') {// Check for minus sign at the beginning
+      s = -C_ONE;
+      ndx++;
+    } else if (match[ndx] === '+') {// Check for plus sign at the beginning
+      ndx++;
+    }
+
+    if (match.length === ndx + 1) { // Check if it's just a simple number "1234"
+      w = assign(match[ndx++], s);
+    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number
+
+      if (match[ndx] !== '.') { // Handle 0.5 and .5
+        v = assign(match[ndx++], s);
+      }
+      ndx++;
+
+      // Check for decimal places
+      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === "'" && match[ndx + 3] === "'") {
+        w = assign(match[ndx], s);
+        y = C_TEN ** BigInt(match[ndx].length);
+        ndx++;
+      }
+
+      // Check for repeating places
+      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === "'" && match[ndx + 2] === "'") {
+        x = assign(match[ndx + 1], s);
+        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;
+        ndx += 3;
+      }
+
+    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+      w = assign(match[ndx], s);
+      y = assign(match[ndx + 2], C_ONE);
+      ndx += 3;
+    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction "123 1/2"
+      v = assign(match[ndx], s);
+      w = assign(match[ndx + 2], s);
+      y = assign(match[ndx + 4], C_ONE);
+      ndx += 5;
+    }
+
+    if (match.length <= ndx) { // Check for more tokens on the stack
+      d = y * z;
+      s = /* void */
+        n = x + d * v + z * w;
+    } else {
+      throw InvalidParameter();
+    }
+
+  } else if (typeof p1 === "bigint") {
+    n = p1;
+    s = p1;
+    d = C_ONE;
+  } else {
+    throw InvalidParameter();
+  }
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  P["s"] = s < C_ZERO ? -C_ONE : C_ONE;
+  P["n"] = n < C_ZERO ? -n : n;
+  P["d"] = d < C_ZERO ? -d : d;
+};
+
+function modpow(b, e, m) {
+
+  let r = C_ONE;
+  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {
+
+    if (e & C_ONE) {
+      r = (r * b) % m;
+    }
+  }
+  return r;
+}
+
+function cycleLen(n, d) {
+
+  for (; d % C_TWO === C_ZERO;
+    d /= C_TWO) {
+  }
+
+  for (; d % C_FIVE === C_ZERO;
+    d /= C_FIVE) {
+  }
+
+  if (d === C_ONE) // Catch non-cyclic numbers
+    return C_ZERO;
+
+  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+  // 10^(d-1) % d == 1
+  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+  // as we want to translate the numbers to strings.
+
+  let rem = C_TEN % d;
+  let t = 1;
+
+  for (; rem !== C_ONE; t++) {
+    rem = rem * C_TEN % d;
+
+    if (t > MAX_CYCLE_LEN)
+      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+  }
+  return BigInt(t);
+}
+
+function cycleStart(n, d, len) {
+
+  let rem1 = C_ONE;
+  let rem2 = modpow(C_TEN, len, d);
+
+  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+    // Solve 10^s == 10^(s+t) (mod d)
+
+    if (rem1 === rem2)
+      return BigInt(t);
+
+    rem1 = rem1 * C_TEN % d;
+    rem2 = rem2 * C_TEN % d;
+  }
+  return 0;
+}
+
+function gcd(a, b) {
+
+  if (!a)
+    return b;
+  if (!b)
+    return a;
+
+  while (1) {
+    a %= b;
+    if (!a)
+      return b;
+    b %= a;
+    if (!b)
+      return a;
+  }
+}
+
+/**
+ * Module constructor
+ *
+ * @constructor
+ * @param {number|Fraction=} a
+ * @param {number=} b
+ */
+function Fraction(a, b) {
+
+  parse(a, b);
+
+  if (this instanceof Fraction) {
+    a = gcd(P["d"], P["n"]); // Abuse a
+    this["s"] = P["s"];
+    this["n"] = P["n"] / a;
+    this["d"] = P["d"] / a;
+  } else {
+    return newFraction(P['s'] * P['n'], P['d']);
+  }
+}
+
+const DivisionByZero = function () { return new Error("Division by Zero"); };
+const InvalidParameter = function () { return new Error("Invalid argument"); };
+const NonIntegerParameter = function () { return new Error("Parameters must be integer"); };
+
+Fraction.prototype = {
+
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE,
+
+  /**
+   * Calculates the absolute value
+   *
+   * Ex: new Fraction(-4).abs() => 4
+   **/
+  "abs": function () {
+
+    return newFraction(this["n"], this["d"]);
+  },
+
+  /**
+   * Inverts the sign of the current fraction
+   *
+   * Ex: new Fraction(-4).neg() => 4
+   **/
+  "neg": function () {
+
+    return newFraction(-this["s"] * this["n"], this["d"]);
+  },
+
+  /**
+   * Adds two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+   **/
+  "add": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Subtracts two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+   **/
+  "sub": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Multiplies two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+   **/
+  "mul": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Divides two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").inverse().div(3)
+   **/
+  "div": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["d"],
+      this["d"] * P["n"]
+    );
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * Ex: new Fraction("-17.(345)").clone()
+   **/
+  "clone": function () {
+    return newFraction(this['s'] * this['n'], this['d']);
+  },
+
+  /**
+   * Calculates the modulo of two rational numbers - a more precise fmod
+   *
+   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+   * Ex: new Fraction(20, 10).mod().equals(0) ? "is Integer"
+   **/
+  "mod": function (a, b) {
+
+    if (a === undefined) {
+      return newFraction(this["s"] * this["n"] % this["d"], C_ONE);
+    }
+
+    parse(a, b);
+    if (C_ZERO === P["n"] * this["d"]) {
+      throw DivisionByZero();
+    }
+
+    /**
+     * I derived the rational modulo similar to the modulo for integers
+     *
+     * https://raw.org/book/analysis/rational-numbers/
+     *
+     *    n1/d1 = (n2/d2) * q + r, where 0 ≤ r < n2/d2
+     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r
+     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)
+     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)
+     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)
+     */
+    return newFraction(
+      this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
+      P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional gcd of two rational numbers
+   *
+   * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+   */
+  "gcd": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+    return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional lcm of two rational numbers
+   *
+   * Ex: new Fraction(5,8).lcm(3,7) => 15
+   */
+  "lcm": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+    if (P["n"] === C_ZERO && this["n"] === C_ZERO) {
+      return newFraction(C_ZERO, C_ONE);
+    }
+    return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
+  },
+
+  /**
+   * Gets the inverse of the fraction, means numerator and denominator are exchanged
+   *
+   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+   **/
+  "inverse": function () {
+    return newFraction(this["s"] * this["d"], this["n"]);
+  },
+
+  /**
+   * Calculates the fraction to some integer exponent
+   *
+   * Ex: new Fraction(-1,2).pow(-3) => -8
+   */
+  "pow": function (a, b) {
+
+    parse(a, b);
+
+    // Trivial case when exp is an integer
+
+    if (P['d'] === C_ONE) {
+
+      if (P['s'] < C_ZERO) {
+        return newFraction((this['s'] * this["d"]) ** P['n'], this["n"] ** P['n']);
+      } else {
+        return newFraction((this['s'] * this["n"]) ** P['n'], this["d"] ** P['n']);
+      }
+    }
+
+    // Negative roots become complex
+    //     (-a/b)^(c/d) = x
+    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula
+    // From which follows that only for c=0 the root is non-complex
+    if (this['s'] < C_ZERO) return null;
+
+    // Now prime factor n and d
+    let N = factorize(this['n']);
+    let D = factorize(this['d']);
+
+    // Exponentiate and take root for n and d individually
+    let n = C_ONE;
+    let d = C_ONE;
+    for (let k in N) {
+      if (k === '1') continue;
+      if (k === '0') {
+        n = C_ZERO;
+        break;
+      }
+      N[k] *= P['n'];
+
+      if (N[k] % P['d'] === C_ZERO) {
+        N[k] /= P['d'];
+      } else return null;
+      n *= BigInt(k) ** N[k];
+    }
+
+    for (let k in D) {
+      if (k === '1') continue;
+      D[k] *= P['n'];
+
+      if (D[k] % P['d'] === C_ZERO) {
+        D[k] /= P['d'];
+      } else return null;
+      d *= BigInt(k) ** D[k];
+    }
+
+    if (P['s'] < C_ZERO) {
+      return newFraction(d, n);
+    }
+    return newFraction(n, d);
+  },
+
+  /**
+   * Calculates the logarithm of a fraction to a given rational base
+   *
+   * Ex: new Fraction(27, 8).log(9, 4) => 3/2
+   */
+  "log": function (a, b) {
+
+    parse(a, b);
+
+    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;
+
+    const allPrimes = Object.create(null);
+
+    const baseFactors = factorize(P['n']);
+    const T1 = factorize(P['d']);
+
+    const numberFactors = factorize(this['n']);
+    const T2 = factorize(this['d']);
+
+    for (const prime in T1) {
+      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];
+    }
+    for (const prime in T2) {
+      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];
+    }
+
+    for (const prime in baseFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+    for (const prime in numberFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+
+    let retN = null;
+    let retD = null;
+
+    // Iterate over all unique primes to determine if a consistent ratio exists
+    for (const prime in allPrimes) {
+
+      const baseExponent = baseFactors[prime] || C_ZERO;
+      const numberExponent = numberFactors[prime] || C_ZERO;
+
+      if (baseExponent === C_ZERO) {
+        if (numberExponent !== C_ZERO) {
+          return null; // Logarithm cannot be expressed as a rational number
+        }
+        continue; // Skip this prime since both exponents are zero
+      }
+
+      // Calculate the ratio of exponents for this prime
+      let curN = numberExponent;
+      let curD = baseExponent;
+
+      // Simplify the current ratio
+      const gcdValue = gcd(curN, curD);
+      curN /= gcdValue;
+      curD /= gcdValue;
+
+      // Check if this is the first ratio; otherwise, ensure ratios are consistent
+      if (retN === null && retD === null) {
+        retN = curN;
+        retD = curD;
+      } else if (curN * retD !== retN * curD) {
+        return null; // Ratios do not match, logarithm cannot be rational
+      }
+    }
+
+    return retN !== null && retD !== null
+      ? newFraction(retN, retD)
+      : null;
+  },
+
+  /**
+   * Check if two rational numbers are the same
+   *
+   * Ex: new Fraction(19.6).equals([98, 5]);
+   **/
+  "equals": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] < P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] <= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] > P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] >= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Compare two rational numbers
+   * < 0 iff this < that
+   * > 0 iff this > that
+   * = 0 iff this = that
+   *
+   * Ex: new Fraction(19.6).compare([98, 5]);
+   **/
+  "compare": function (a, b) {
+
+    parse(a, b);
+    let t = this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"];
+
+    return (C_ZERO < t) - (t < C_ZERO);
+  },
+
+  /**
+   * Calculates the ceil of a rational number
+   *
+   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+   **/
+  "ceil": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] >= C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Calculates the floor of a rational number
+   *
+   * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+   **/
+  "floor": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) -
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] < C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Rounds a rational numbers
+   *
+   * Ex: new Fraction('4.(3)').round() => (4 / 1)
+   **/
+  "round": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    /* Derivation:
+
+    s >= 0:
+      round(n / d) = ifloor(n / d) + (n % d) / d >= 0.5 ? 1 : 0
+                   = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    s < 0:
+      round(n / d) =-ifloor(n / d) - (n % d) / d > 0.5 ? 1 : 0
+                   =-ifloor(n / d) - 2(n % d) > d ? 1 : 0
+
+    =>:
+
+    round(s * n / d) = s * ifloor(n / d) + s * (C + 2(n % d) > d ? 1 : 0)
+        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.
+    */
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      this["s"] * ((this["s"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this["n"] % this["d"]) > this["d"] ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+    * Rounds a rational number to a multiple of another rational number
+    *
+    * Ex: new Fraction('0.9').roundTo("1/8") => 7 / 8
+    **/
+  "roundTo": function (a, b) {
+
+    /*
+    k * x/y ≤ a/b < (k+1) * x/y
+    ⇔ k ≤ a/b / (x/y) < (k+1)
+    ⇔ k = floor(a/b * y/x)
+    ⇔ k = floor((a * y) / (b * x))
+    */
+
+    parse(a, b);
+
+    const n = this['n'] * P['d'];
+    const d = this['d'] * P['n'];
+    const r = n % d;
+
+    // round(n / d) = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    let k = ifloor(n / d);
+    if (r + r >= d) {
+      k++;
+    }
+    return newFraction(this['s'] * k * P['n'], P['d']);
+  },
+
+  /**
+   * Check if two rational numbers are divisible
+   *
+   * Ex: new Fraction(19.6).divisible(1.5);
+   */
+  "divisible": function (a, b) {
+
+    parse(a, b);
+    if (P['n'] === C_ZERO) return false;
+    return (this['n'] * P['d']) % (P['n'] * this['d']) === C_ZERO;
+  },
+
+  /**
+   * Returns a decimal representation of the fraction
+   *
+   * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+   **/
+  'valueOf': function () {
+    //if (this['n'] <= MAX_INTEGER && this['d'] <= MAX_INTEGER) {
+    return Number(this['s'] * this['n']) / Number(this['d']);
+    //}
+  },
+
+  /**
+   * Creates a string representation of a fraction with all digits
+   *
+   * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+   **/
+  'toString': function (dec = 15) {
+
+    let N = this["n"];
+    let D = this["d"];
+
+    let cycLen = cycleLen(N, D); // Cycle length
+    let cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    // Append integer part
+    str += ifloor(N / D);
+
+    N %= D;
+    N *= C_TEN;
+
+    if (N)
+      str += ".";
+
+    if (cycLen) {
+
+      for (let i = cycOff; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += "(";
+      for (let i = cycLen; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += ")";
+    } else {
+      for (let i = dec; N && i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+    }
+    return str;
+  },
+
+  /**
+   * Returns a string-fraction representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toFraction() => "4 1/3"
+   **/
+  'toFraction': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        str += " ";
+        n %= d;
+      }
+
+      str += n;
+      str += '/';
+      str += d;
+    }
+    return str;
+  },
+
+  /**
+   * Returns a latex representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+   **/
+  'toLatex': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        n %= d;
+      }
+
+      str += "\\frac{";
+      str += n;
+      str += '}{';
+      str += d;
+      str += '}';
+    }
+    return str;
+  },
+
+  /**
+   * Returns an array of continued fraction elements
+   *
+   * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+   */
+  'toContinued': function () {
+
+    let a = this['n'];
+    let b = this['d'];
+    const res = [];
+
+    while (b) {
+      res.push(ifloor(a / b));
+      const t = a % b;
+      a = b;
+      b = t;
+    }
+    return res;
+  },
+
+  "simplify": function (eps = 1e-3) {
+
+    // Continued fractions give best approximations for a max denominator,
+    // generally outperforming mediants in denominator–accuracy trade-offs.
+    // Semiconvergents can further reduce the denominator within tolerance.
+
+    const ieps = BigInt(Math.ceil(1 / eps));
+
+    const thisABS = this['abs']();
+    const cont = thisABS['toContinued']();
+
+    for (let i = 1; i < cont.length; i++) {
+
+      let s = newFraction(cont[i - 1], C_ONE);
+      for (let k = i - 2; k >= 0; k--) {
+        s = s['inverse']()['add'](cont[k]);
+      }
+
+      let t = s['sub'](thisABS);
+      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps
+        return s['mul'](this['s']);
+      }
+    }
+    return this;
+  }
+};
+
+Object.defineProperty(Fraction, "__esModule", { 'value': true });
+Fraction['default'] = Fraction;
+Fraction['Fraction'] = Fraction;
+module['exports'] = Fraction;
diff --git a/node_modules/fraction.js/dist/fraction.min.js b/node_modules/fraction.js/dist/fraction.min.js
new file mode 100644
index 0000000..97b02ee
--- /dev/null
+++ b/node_modules/fraction.js/dist/fraction.min.js
@@ -0,0 +1,21 @@
+/*
+Fraction.js v5.3.4 8/22/2025
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2025, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+'use strict';(function(F){function D(){return Error("Parameters must be integer")}function x(){return Error("Invalid argument")}function C(){return Error("Division by Zero")}function q(a,b){var d=g,c=h;let f=h;if(void 0!==a&&null!==a)if(void 0!==b){if("bigint"===typeof a)d=a;else{if(isNaN(a))throw x();if(0!==a%1)throw D();d=BigInt(a)}if("bigint"===typeof b)c=b;else{if(isNaN(b))throw x();if(0!==b%1)throw D();c=BigInt(b)}f=d*c}else if("object"===typeof a){if("d"in a&&"n"in a)d=BigInt(a.n),c=BigInt(a.d),
+"s"in a&&(d*=BigInt(a.s));else if(0 in a)d=BigInt(a[0]),1 in a&&(c=BigInt(a[1]));else if("bigint"===typeof a)d=a;else throw x();f=d*c}else if("number"===typeof a){if(isNaN(a))throw x();0>a&&(f=-h,a=-a);if(0===a%1)d=BigInt(a);else{b=1;var k=0,l=1,m=1;let r=1;1<=a&&(b=10**Math.floor(1+Math.log10(a)),a/=b);for(;1E7>=l&&1E7>=r;)if(c=(k+m)/(l+r),a===c){1E7>=l+r?(d=k+m,c=l+r):r>l?(d=m,c=r):(d=k,c=l);break}else a>c?(k+=m,l+=r):(m+=k,r+=l),1E7<l?(d=m,c=r):(d=k,c=l);d=BigInt(d)*BigInt(b);c=BigInt(c)}}else if("string"===
+typeof a){c=0;k=b=d=g;l=m=h;a=a.replace(/_/g,"").match(/\d+|./g);if(null===a)throw x();"-"===a[c]?(f=-h,c++):"+"===a[c]&&c++;if(a.length===c+1)b=w(a[c++],f);else if("."===a[c+1]||"."===a[c]){"."!==a[c]&&(d=w(a[c++],f));c++;if(c+1===a.length||"("===a[c+1]&&")"===a[c+3]||"'"===a[c+1]&&"'"===a[c+3])b=w(a[c],f),m=t**BigInt(a[c].length),c++;if("("===a[c]&&")"===a[c+2]||"'"===a[c]&&"'"===a[c+2])k=w(a[c+1],f),l=t**BigInt(a[c+1].length)-h,c+=3}else"/"===a[c+1]||":"===a[c+1]?(b=w(a[c],f),m=w(a[c+2],h),c+=
+3):"/"===a[c+3]&&" "===a[c+1]&&(d=w(a[c],f),b=w(a[c+2],f),m=w(a[c+4],h),c+=5);if(a.length<=c)c=m*l,f=d=k+c*d+l*b;else throw x();}else if("bigint"===typeof a)f=d=a,c=h;else throw x();if(c===g)throw C();e.s=f<g?-h:h;e.n=d<g?-d:d;e.d=c<g?-c:c}function w(a,b){try{a=BigInt(a)}catch(d){throw x();}return a*b}function u(a){return"bigint"===typeof a?a:Math.floor(a)}function n(a,b){if(b===g)throw C();const d=Object.create(v.prototype);d.s=a<g?-h:h;a=a<g?-a:a;const c=y(a,b);d.n=a/c;d.d=b/c;return d}function A(a){const b=
+Object.create(null);if(a<=h)return b[a]=h,b;for(;a%p===g;)b[p]=(b[p]||g)+h,a/=p;for(;a%B===g;)b[B]=(b[B]||g)+h,a/=B;for(;a%z===g;)b[z]=(b[z]||g)+h,a/=z;for(let d=0,c=p+z;c*c<=a;){for(;a%c===g;)b[c]=(b[c]||g)+h,a/=c;c+=G[d];d=d+1&7}a>h&&(b[a]=(b[a]||g)+h);return b}function y(a,b){if(!a)return b;if(!b)return a;for(;;){a%=b;if(!a)return b;b%=a;if(!b)return a}}function v(a,b){q(a,b);if(this instanceof v)a=y(e.d,e.n),this.s=e.s,this.n=e.n/a,this.d=e.d/a;else return n(e.s*e.n,e.d)}"undefined"===typeof BigInt&&
+(BigInt=function(a){if(isNaN(a))throw Error("");return a});const g=BigInt(0),h=BigInt(1),p=BigInt(2),B=BigInt(3),z=BigInt(5),t=BigInt(10),e={s:h,n:g,d:h},G=[p*p,p,p*p,p,p*p,p*B,p,p*B];v.prototype={s:h,n:g,d:h,abs:function(){return n(this.n,this.d)},neg:function(){return n(-this.s*this.n,this.d)},add:function(a,b){q(a,b);return n(this.s*this.n*e.d+e.s*this.d*e.n,this.d*e.d)},sub:function(a,b){q(a,b);return n(this.s*this.n*e.d-e.s*this.d*e.n,this.d*e.d)},mul:function(a,b){q(a,b);return n(this.s*e.s*
+this.n*e.n,this.d*e.d)},div:function(a,b){q(a,b);return n(this.s*e.s*this.n*e.d,this.d*e.n)},clone:function(){return n(this.s*this.n,this.d)},mod:function(a,b){if(void 0===a)return n(this.s*this.n%this.d,h);q(a,b);if(g===e.n*this.d)throw C();return n(this.s*e.d*this.n%(e.n*this.d),e.d*this.d)},gcd:function(a,b){q(a,b);return n(y(e.n,this.n)*y(e.d,this.d),e.d*this.d)},lcm:function(a,b){q(a,b);return e.n===g&&this.n===g?n(g,h):n(e.n*this.n,y(e.n,this.n)*y(e.d,this.d))},inverse:function(){return n(this.s*
+this.d,this.n)},pow:function(a,b){q(a,b);if(e.d===h)return e.s<g?n((this.s*this.d)**e.n,this.n**e.n):n((this.s*this.n)**e.n,this.d**e.n);if(this.s<g)return null;a=A(this.n);b=A(this.d);let d=h,c=h;for(let f in a)if("1"!==f){if("0"===f){d=g;break}a[f]*=e.n;if(a[f]%e.d===g)a[f]/=e.d;else return null;d*=BigInt(f)**a[f]}for(let f in b)if("1"!==f){b[f]*=e.n;if(b[f]%e.d===g)b[f]/=e.d;else return null;c*=BigInt(f)**b[f]}return e.s<g?n(c,d):n(d,c)},log:function(a,b){q(a,b);if(this.s<=g||e.s<=g)return null;
+var d=Object.create(null);a=A(e.n);const c=A(e.d);b=A(this.n);const f=A(this.d);for(var k in c)a[k]=(a[k]||g)-c[k];for(var l in f)b[l]=(b[l]||g)-f[l];for(var m in a)"1"!==m&&(d[m]=!0);for(var r in b)"1"!==r&&(d[r]=!0);l=k=null;for(const E in d)if(m=a[E]||g,d=b[E]||g,m===g){if(d!==g)return null}else if(r=y(d,m),d/=r,m/=r,null===k&&null===l)k=d,l=m;else if(d*l!==k*m)return null;return null!==k&&null!==l?n(k,l):null},equals:function(a,b){q(a,b);return this.s*this.n*e.d===e.s*e.n*this.d},lt:function(a,
+b){q(a,b);return this.s*this.n*e.d<e.s*e.n*this.d},lte:function(a,b){q(a,b);return this.s*this.n*e.d<=e.s*e.n*this.d},gt:function(a,b){q(a,b);return this.s*this.n*e.d>e.s*e.n*this.d},gte:function(a,b){q(a,b);return this.s*this.n*e.d>=e.s*e.n*this.d},compare:function(a,b){q(a,b);a=this.s*this.n*e.d-e.s*e.n*this.d;return(g<a)-(a<g)},ceil:function(a){a=t**BigInt(a||0);return n(u(this.s*a*this.n/this.d)+(a*this.n%this.d>g&&this.s>=g?h:g),a)},floor:function(a){a=t**BigInt(a||0);return n(u(this.s*a*this.n/
+this.d)-(a*this.n%this.d>g&&this.s<g?h:g),a)},round:function(a){a=t**BigInt(a||0);return n(u(this.s*a*this.n/this.d)+this.s*((this.s>=g?h:g)+a*this.n%this.d*p>this.d?h:g),a)},roundTo:function(a,b){q(a,b);var d=this.n*e.d;a=this.d*e.n;b=d%a;d=u(d/a);b+b>=a&&d++;return n(this.s*d*e.n,e.d)},divisible:function(a,b){q(a,b);return e.n===g?!1:this.n*e.d%(e.n*this.d)===g},valueOf:function(){return Number(this.s*this.n)/Number(this.d)},toString:function(a=15){let b=this.n,d=this.d;var c;a:{for(c=d;c%p===g;c/=
+p);for(;c%z===g;c/=z);if(c===h)c=g;else{for(var f=t%c,k=1;f!==h;k++)if(f=f*t%c,2E3<k){c=g;break a}c=BigInt(k)}}a:{f=h;k=t;var l=c;let m=h;for(;l>g;k=k*k%d,l>>=h)l&h&&(m=m*k%d);k=m;for(l=0;300>l;l++){if(f===k){f=BigInt(l);break a}f=f*t%d;k=k*t%d}f=0}k=f;f=this.s<g?"-":"";f+=u(b/d);(b=b%d*t)&&(f+=".");if(c){for(a=k;a--;)f+=u(b/d),b%=d,b*=t;f+="(";for(a=c;a--;)f+=u(b/d),b%=d,b*=t;f+=")"}else for(;b&&a--;)f+=u(b/d),b%=d,b*=t;return f},toFraction:function(a=!1){let b=this.n,d=this.d,c=this.s<g?"-":"";
+if(d===h)c+=b;else{const f=u(b/d);a&&f>g&&(c+=f,c+=" ",b%=d);c=c+b+"/"+d}return c},toLatex:function(a=!1){let b=this.n,d=this.d,c=this.s<g?"-":"";if(d===h)c+=b;else{const f=u(b/d);a&&f>g&&(c+=f,b%=d);c=c+"\\frac{"+b+"}{"+d;c+="}"}return c},toContinued:function(){let a=this.n,b=this.d;const d=[];for(;b;){d.push(u(a/b));const c=a%b;a=b;b=c}return d},simplify:function(a=.001){a=BigInt(Math.ceil(1/a));const b=this.abs(),d=b.toContinued();for(let f=1;f<d.length;f++){let k=n(d[f-1],h);for(var c=f-2;0<=
+c;c--)k=k.inverse().add(d[c]);c=k.sub(b);if(c.n*a<c.d)return k.mul(this.s)}return this}};"function"===typeof define&&define.amd?define([],function(){return v}):"object"===typeof exports?(Object.defineProperty(v,"__esModule",{value:!0}),v["default"]=v,v.Fraction=v,module.exports=v):F.Fraction=v})(this);
diff --git a/node_modules/fraction.js/dist/fraction.mjs b/node_modules/fraction.js/dist/fraction.mjs
new file mode 100644
index 0000000..f6267c4
--- /dev/null
+++ b/node_modules/fraction.js/dist/fraction.mjs
@@ -0,0 +1,1043 @@
+'use strict';
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <numerator>, 1 => <denominator> ]
+ * { n => <numerator>, d => <denominator> }
+ *
+ * Integer form
+ * - Single integer value as BigInt or Number
+ *
+ * Double form
+ * - Single double value as Number
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ * let f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+// Set Identity function to downgrade BigInt to Number if needed
+if (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(""); return n; };
+
+const C_ZERO = BigInt(0);
+const C_ONE = BigInt(1);
+const C_TWO = BigInt(2);
+const C_THREE = BigInt(3);
+const C_FIVE = BigInt(5);
+const C_TEN = BigInt(10);
+const MAX_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);
+
+// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+// Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+const MAX_CYCLE_LEN = 2000;
+
+// Parsed data to avoid calling "new" all the time
+const P = {
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE
+};
+
+function assign(n, s) {
+
+  try {
+    n = BigInt(n);
+  } catch (e) {
+    throw InvalidParameter();
+  }
+  return n * s;
+}
+
+function ifloor(x) {
+  return typeof x === 'bigint' ? x : Math.floor(x);
+}
+
+// Creates a new Fraction internally without the need of the bulky constructor
+function newFraction(n, d) {
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  const f = Object.create(Fraction.prototype);
+  f["s"] = n < C_ZERO ? -C_ONE : C_ONE;
+
+  n = n < C_ZERO ? -n : n;
+
+  const a = gcd(n, d);
+
+  f["n"] = n / a;
+  f["d"] = d / a;
+  return f;
+}
+
+const FACTORSTEPS = [C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO * C_THREE, C_TWO, C_TWO * C_THREE]; // repeats
+function factorize(n) {
+
+  const factors = Object.create(null);
+  if (n <= C_ONE) {
+    factors[n] = C_ONE;
+    return factors;
+  }
+
+  const add = (p) => { factors[p] = (factors[p] || C_ZERO) + C_ONE; };
+
+  while (n % C_TWO === C_ZERO) { add(C_TWO); n /= C_TWO; }
+  while (n % C_THREE === C_ZERO) { add(C_THREE); n /= C_THREE; }
+  while (n % C_FIVE === C_ZERO) { add(C_FIVE); n /= C_FIVE; }
+
+  // 30-wheel trial division: test only residues coprime to 2*3*5
+  // Residue step pattern after 5: 7,11,13,17,19,23,29,31, ...
+  for (let si = 0, p = C_TWO + C_FIVE; p * p <= n;) {
+    while (n % p === C_ZERO) { add(p); n /= p; }
+    p += FACTORSTEPS[si];
+    si = (si + 1) & 7; // fast modulo 8
+  }
+  if (n > C_ONE) add(n);
+  return factors;
+}
+
+const parse = function (p1, p2) {
+
+  let n = C_ZERO, d = C_ONE, s = C_ONE;
+
+  if (p1 === undefined || p1 === null) { // No argument
+    /* void */
+  } else if (p2 !== undefined) { // Two arguments
+
+    if (typeof p1 === "bigint") {
+      n = p1;
+    } else if (isNaN(p1)) {
+      throw InvalidParameter();
+    } else if (p1 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      n = BigInt(p1);
+    }
+
+    if (typeof p2 === "bigint") {
+      d = p2;
+    } else if (isNaN(p2)) {
+      throw InvalidParameter();
+    } else if (p2 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      d = BigInt(p2);
+    }
+
+    s = n * d;
+
+  } else if (typeof p1 === "object") {
+    if ("d" in p1 && "n" in p1) {
+      n = BigInt(p1["n"]);
+      d = BigInt(p1["d"]);
+      if ("s" in p1)
+        n *= BigInt(p1["s"]);
+    } else if (0 in p1) {
+      n = BigInt(p1[0]);
+      if (1 in p1)
+        d = BigInt(p1[1]);
+    } else if (typeof p1 === "bigint") {
+      n = p1;
+    } else {
+      throw InvalidParameter();
+    }
+    s = n * d;
+  } else if (typeof p1 === "number") {
+
+    if (isNaN(p1)) {
+      throw InvalidParameter();
+    }
+
+    if (p1 < 0) {
+      s = -C_ONE;
+      p1 = -p1;
+    }
+
+    if (p1 % 1 === 0) {
+      n = BigInt(p1);
+    } else {
+
+      let z = 1;
+
+      let A = 0, B = 1;
+      let C = 1, D = 1;
+
+      let N = 10000000;
+
+      if (p1 >= 1) {
+        z = 10 ** Math.floor(1 + Math.log10(p1));
+        p1 /= z;
+      }
+
+      // Using Farey Sequences
+
+      while (B <= N && D <= N) {
+        let M = (A + C) / (B + D);
+
+        if (p1 === M) {
+          if (B + D <= N) {
+            n = A + C;
+            d = B + D;
+          } else if (D > B) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+          break;
+
+        } else {
+
+          if (p1 > M) {
+            A += C;
+            B += D;
+          } else {
+            C += A;
+            D += B;
+          }
+
+          if (B > N) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+        }
+      }
+      n = BigInt(n) * BigInt(z);
+      d = BigInt(d);
+    }
+
+  } else if (typeof p1 === "string") {
+
+    let ndx = 0;
+
+    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;
+
+    let match = p1.replace(/_/g, '').match(/\d+|./g);
+
+    if (match === null)
+      throw InvalidParameter();
+
+    if (match[ndx] === '-') {// Check for minus sign at the beginning
+      s = -C_ONE;
+      ndx++;
+    } else if (match[ndx] === '+') {// Check for plus sign at the beginning
+      ndx++;
+    }
+
+    if (match.length === ndx + 1) { // Check if it's just a simple number "1234"
+      w = assign(match[ndx++], s);
+    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number
+
+      if (match[ndx] !== '.') { // Handle 0.5 and .5
+        v = assign(match[ndx++], s);
+      }
+      ndx++;
+
+      // Check for decimal places
+      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === "'" && match[ndx + 3] === "'") {
+        w = assign(match[ndx], s);
+        y = C_TEN ** BigInt(match[ndx].length);
+        ndx++;
+      }
+
+      // Check for repeating places
+      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === "'" && match[ndx + 2] === "'") {
+        x = assign(match[ndx + 1], s);
+        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;
+        ndx += 3;
+      }
+
+    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+      w = assign(match[ndx], s);
+      y = assign(match[ndx + 2], C_ONE);
+      ndx += 3;
+    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction "123 1/2"
+      v = assign(match[ndx], s);
+      w = assign(match[ndx + 2], s);
+      y = assign(match[ndx + 4], C_ONE);
+      ndx += 5;
+    }
+
+    if (match.length <= ndx) { // Check for more tokens on the stack
+      d = y * z;
+      s = /* void */
+        n = x + d * v + z * w;
+    } else {
+      throw InvalidParameter();
+    }
+
+  } else if (typeof p1 === "bigint") {
+    n = p1;
+    s = p1;
+    d = C_ONE;
+  } else {
+    throw InvalidParameter();
+  }
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  P["s"] = s < C_ZERO ? -C_ONE : C_ONE;
+  P["n"] = n < C_ZERO ? -n : n;
+  P["d"] = d < C_ZERO ? -d : d;
+};
+
+function modpow(b, e, m) {
+
+  let r = C_ONE;
+  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {
+
+    if (e & C_ONE) {
+      r = (r * b) % m;
+    }
+  }
+  return r;
+}
+
+function cycleLen(n, d) {
+
+  for (; d % C_TWO === C_ZERO;
+    d /= C_TWO) {
+  }
+
+  for (; d % C_FIVE === C_ZERO;
+    d /= C_FIVE) {
+  }
+
+  if (d === C_ONE) // Catch non-cyclic numbers
+    return C_ZERO;
+
+  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+  // 10^(d-1) % d == 1
+  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+  // as we want to translate the numbers to strings.
+
+  let rem = C_TEN % d;
+  let t = 1;
+
+  for (; rem !== C_ONE; t++) {
+    rem = rem * C_TEN % d;
+
+    if (t > MAX_CYCLE_LEN)
+      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+  }
+  return BigInt(t);
+}
+
+function cycleStart(n, d, len) {
+
+  let rem1 = C_ONE;
+  let rem2 = modpow(C_TEN, len, d);
+
+  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+    // Solve 10^s == 10^(s+t) (mod d)
+
+    if (rem1 === rem2)
+      return BigInt(t);
+
+    rem1 = rem1 * C_TEN % d;
+    rem2 = rem2 * C_TEN % d;
+  }
+  return 0;
+}
+
+function gcd(a, b) {
+
+  if (!a)
+    return b;
+  if (!b)
+    return a;
+
+  while (1) {
+    a %= b;
+    if (!a)
+      return b;
+    b %= a;
+    if (!b)
+      return a;
+  }
+}
+
+/**
+ * Module constructor
+ *
+ * @constructor
+ * @param {number|Fraction=} a
+ * @param {number=} b
+ */
+function Fraction(a, b) {
+
+  parse(a, b);
+
+  if (this instanceof Fraction) {
+    a = gcd(P["d"], P["n"]); // Abuse a
+    this["s"] = P["s"];
+    this["n"] = P["n"] / a;
+    this["d"] = P["d"] / a;
+  } else {
+    return newFraction(P['s'] * P['n'], P['d']);
+  }
+}
+
+const DivisionByZero = function () { return new Error("Division by Zero"); };
+const InvalidParameter = function () { return new Error("Invalid argument"); };
+const NonIntegerParameter = function () { return new Error("Parameters must be integer"); };
+
+Fraction.prototype = {
+
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE,
+
+  /**
+   * Calculates the absolute value
+   *
+   * Ex: new Fraction(-4).abs() => 4
+   **/
+  "abs": function () {
+
+    return newFraction(this["n"], this["d"]);
+  },
+
+  /**
+   * Inverts the sign of the current fraction
+   *
+   * Ex: new Fraction(-4).neg() => 4
+   **/
+  "neg": function () {
+
+    return newFraction(-this["s"] * this["n"], this["d"]);
+  },
+
+  /**
+   * Adds two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+   **/
+  "add": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Subtracts two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+   **/
+  "sub": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Multiplies two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+   **/
+  "mul": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Divides two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").inverse().div(3)
+   **/
+  "div": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["d"],
+      this["d"] * P["n"]
+    );
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * Ex: new Fraction("-17.(345)").clone()
+   **/
+  "clone": function () {
+    return newFraction(this['s'] * this['n'], this['d']);
+  },
+
+  /**
+   * Calculates the modulo of two rational numbers - a more precise fmod
+   *
+   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+   * Ex: new Fraction(20, 10).mod().equals(0) ? "is Integer"
+   **/
+  "mod": function (a, b) {
+
+    if (a === undefined) {
+      return newFraction(this["s"] * this["n"] % this["d"], C_ONE);
+    }
+
+    parse(a, b);
+    if (C_ZERO === P["n"] * this["d"]) {
+      throw DivisionByZero();
+    }
+
+    /**
+     * I derived the rational modulo similar to the modulo for integers
+     *
+     * https://raw.org/book/analysis/rational-numbers/
+     *
+     *    n1/d1 = (n2/d2) * q + r, where 0 ≤ r < n2/d2
+     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r
+     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)
+     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)
+     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)
+     */
+    return newFraction(
+      this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
+      P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional gcd of two rational numbers
+   *
+   * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+   */
+  "gcd": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+    return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional lcm of two rational numbers
+   *
+   * Ex: new Fraction(5,8).lcm(3,7) => 15
+   */
+  "lcm": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+    if (P["n"] === C_ZERO && this["n"] === C_ZERO) {
+      return newFraction(C_ZERO, C_ONE);
+    }
+    return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
+  },
+
+  /**
+   * Gets the inverse of the fraction, means numerator and denominator are exchanged
+   *
+   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+   **/
+  "inverse": function () {
+    return newFraction(this["s"] * this["d"], this["n"]);
+  },
+
+  /**
+   * Calculates the fraction to some integer exponent
+   *
+   * Ex: new Fraction(-1,2).pow(-3) => -8
+   */
+  "pow": function (a, b) {
+
+    parse(a, b);
+
+    // Trivial case when exp is an integer
+
+    if (P['d'] === C_ONE) {
+
+      if (P['s'] < C_ZERO) {
+        return newFraction((this['s'] * this["d"]) ** P['n'], this["n"] ** P['n']);
+      } else {
+        return newFraction((this['s'] * this["n"]) ** P['n'], this["d"] ** P['n']);
+      }
+    }
+
+    // Negative roots become complex
+    //     (-a/b)^(c/d) = x
+    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula
+    // From which follows that only for c=0 the root is non-complex
+    if (this['s'] < C_ZERO) return null;
+
+    // Now prime factor n and d
+    let N = factorize(this['n']);
+    let D = factorize(this['d']);
+
+    // Exponentiate and take root for n and d individually
+    let n = C_ONE;
+    let d = C_ONE;
+    for (let k in N) {
+      if (k === '1') continue;
+      if (k === '0') {
+        n = C_ZERO;
+        break;
+      }
+      N[k] *= P['n'];
+
+      if (N[k] % P['d'] === C_ZERO) {
+        N[k] /= P['d'];
+      } else return null;
+      n *= BigInt(k) ** N[k];
+    }
+
+    for (let k in D) {
+      if (k === '1') continue;
+      D[k] *= P['n'];
+
+      if (D[k] % P['d'] === C_ZERO) {
+        D[k] /= P['d'];
+      } else return null;
+      d *= BigInt(k) ** D[k];
+    }
+
+    if (P['s'] < C_ZERO) {
+      return newFraction(d, n);
+    }
+    return newFraction(n, d);
+  },
+
+  /**
+   * Calculates the logarithm of a fraction to a given rational base
+   *
+   * Ex: new Fraction(27, 8).log(9, 4) => 3/2
+   */
+  "log": function (a, b) {
+
+    parse(a, b);
+
+    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;
+
+    const allPrimes = Object.create(null);
+
+    const baseFactors = factorize(P['n']);
+    const T1 = factorize(P['d']);
+
+    const numberFactors = factorize(this['n']);
+    const T2 = factorize(this['d']);
+
+    for (const prime in T1) {
+      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];
+    }
+    for (const prime in T2) {
+      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];
+    }
+
+    for (const prime in baseFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+    for (const prime in numberFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+
+    let retN = null;
+    let retD = null;
+
+    // Iterate over all unique primes to determine if a consistent ratio exists
+    for (const prime in allPrimes) {
+
+      const baseExponent = baseFactors[prime] || C_ZERO;
+      const numberExponent = numberFactors[prime] || C_ZERO;
+
+      if (baseExponent === C_ZERO) {
+        if (numberExponent !== C_ZERO) {
+          return null; // Logarithm cannot be expressed as a rational number
+        }
+        continue; // Skip this prime since both exponents are zero
+      }
+
+      // Calculate the ratio of exponents for this prime
+      let curN = numberExponent;
+      let curD = baseExponent;
+
+      // Simplify the current ratio
+      const gcdValue = gcd(curN, curD);
+      curN /= gcdValue;
+      curD /= gcdValue;
+
+      // Check if this is the first ratio; otherwise, ensure ratios are consistent
+      if (retN === null && retD === null) {
+        retN = curN;
+        retD = curD;
+      } else if (curN * retD !== retN * curD) {
+        return null; // Ratios do not match, logarithm cannot be rational
+      }
+    }
+
+    return retN !== null && retD !== null
+      ? newFraction(retN, retD)
+      : null;
+  },
+
+  /**
+   * Check if two rational numbers are the same
+   *
+   * Ex: new Fraction(19.6).equals([98, 5]);
+   **/
+  "equals": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] < P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] <= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] > P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] >= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Compare two rational numbers
+   * < 0 iff this < that
+   * > 0 iff this > that
+   * = 0 iff this = that
+   *
+   * Ex: new Fraction(19.6).compare([98, 5]);
+   **/
+  "compare": function (a, b) {
+
+    parse(a, b);
+    let t = this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"];
+
+    return (C_ZERO < t) - (t < C_ZERO);
+  },
+
+  /**
+   * Calculates the ceil of a rational number
+   *
+   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+   **/
+  "ceil": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] >= C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Calculates the floor of a rational number
+   *
+   * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+   **/
+  "floor": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) -
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] < C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Rounds a rational numbers
+   *
+   * Ex: new Fraction('4.(3)').round() => (4 / 1)
+   **/
+  "round": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    /* Derivation:
+
+    s >= 0:
+      round(n / d) = ifloor(n / d) + (n % d) / d >= 0.5 ? 1 : 0
+                   = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    s < 0:
+      round(n / d) =-ifloor(n / d) - (n % d) / d > 0.5 ? 1 : 0
+                   =-ifloor(n / d) - 2(n % d) > d ? 1 : 0
+
+    =>:
+
+    round(s * n / d) = s * ifloor(n / d) + s * (C + 2(n % d) > d ? 1 : 0)
+        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.
+    */
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      this["s"] * ((this["s"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this["n"] % this["d"]) > this["d"] ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+    * Rounds a rational number to a multiple of another rational number
+    *
+    * Ex: new Fraction('0.9').roundTo("1/8") => 7 / 8
+    **/
+  "roundTo": function (a, b) {
+
+    /*
+    k * x/y ≤ a/b < (k+1) * x/y
+    ⇔ k ≤ a/b / (x/y) < (k+1)
+    ⇔ k = floor(a/b * y/x)
+    ⇔ k = floor((a * y) / (b * x))
+    */
+
+    parse(a, b);
+
+    const n = this['n'] * P['d'];
+    const d = this['d'] * P['n'];
+    const r = n % d;
+
+    // round(n / d) = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    let k = ifloor(n / d);
+    if (r + r >= d) {
+      k++;
+    }
+    return newFraction(this['s'] * k * P['n'], P['d']);
+  },
+
+  /**
+   * Check if two rational numbers are divisible
+   *
+   * Ex: new Fraction(19.6).divisible(1.5);
+   */
+  "divisible": function (a, b) {
+
+    parse(a, b);
+    if (P['n'] === C_ZERO) return false;
+    return (this['n'] * P['d']) % (P['n'] * this['d']) === C_ZERO;
+  },
+
+  /**
+   * Returns a decimal representation of the fraction
+   *
+   * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+   **/
+  'valueOf': function () {
+    //if (this['n'] <= MAX_INTEGER && this['d'] <= MAX_INTEGER) {
+    return Number(this['s'] * this['n']) / Number(this['d']);
+    //}
+  },
+
+  /**
+   * Creates a string representation of a fraction with all digits
+   *
+   * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+   **/
+  'toString': function (dec = 15) {
+
+    let N = this["n"];
+    let D = this["d"];
+
+    let cycLen = cycleLen(N, D); // Cycle length
+    let cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    // Append integer part
+    str += ifloor(N / D);
+
+    N %= D;
+    N *= C_TEN;
+
+    if (N)
+      str += ".";
+
+    if (cycLen) {
+
+      for (let i = cycOff; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += "(";
+      for (let i = cycLen; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += ")";
+    } else {
+      for (let i = dec; N && i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+    }
+    return str;
+  },
+
+  /**
+   * Returns a string-fraction representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toFraction() => "4 1/3"
+   **/
+  'toFraction': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        str += " ";
+        n %= d;
+      }
+
+      str += n;
+      str += '/';
+      str += d;
+    }
+    return str;
+  },
+
+  /**
+   * Returns a latex representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+   **/
+  'toLatex': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        n %= d;
+      }
+
+      str += "\\frac{";
+      str += n;
+      str += '}{';
+      str += d;
+      str += '}';
+    }
+    return str;
+  },
+
+  /**
+   * Returns an array of continued fraction elements
+   *
+   * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+   */
+  'toContinued': function () {
+
+    let a = this['n'];
+    let b = this['d'];
+    const res = [];
+
+    while (b) {
+      res.push(ifloor(a / b));
+      const t = a % b;
+      a = b;
+      b = t;
+    }
+    return res;
+  },
+
+  "simplify": function (eps = 1e-3) {
+
+    // Continued fractions give best approximations for a max denominator,
+    // generally outperforming mediants in denominator–accuracy trade-offs.
+    // Semiconvergents can further reduce the denominator within tolerance.
+
+    const ieps = BigInt(Math.ceil(1 / eps));
+
+    const thisABS = this['abs']();
+    const cont = thisABS['toContinued']();
+
+    for (let i = 1; i < cont.length; i++) {
+
+      let s = newFraction(cont[i - 1], C_ONE);
+      for (let k = i - 2; k >= 0; k--) {
+        s = s['inverse']()['add'](cont[k]);
+      }
+
+      let t = s['sub'](thisABS);
+      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps
+        return s['mul'](this['s']);
+      }
+    }
+    return this;
+  }
+};
+export {
+  Fraction as default, Fraction
+};
diff --git a/node_modules/fraction.js/examples/angles.js b/node_modules/fraction.js/examples/angles.js
new file mode 100644
index 0000000..436947e
--- /dev/null
+++ b/node_modules/fraction.js/examples/angles.js
@@ -0,0 +1,26 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+
+// This example generates a list of angles with human readable radians
+
+var Fraction = require('fraction.js');
+
+var tab = [];
+for (var d = 1; d <= 360; d++) {
+
+   var pi = Fraction(2, 360).mul(d);
+   var tau = Fraction(1, 360).mul(d);
+
+   if (pi.d <= 6n && pi.d != 5n)
+      tab.push([
+         d,
+         pi.toFraction() + "pi",
+         tau.toFraction() + "tau"]);
+}
+
+console.table(tab);
diff --git a/node_modules/fraction.js/examples/approx.js b/node_modules/fraction.js/examples/approx.js
new file mode 100644
index 0000000..36aa030
--- /dev/null
+++ b/node_modules/fraction.js/examples/approx.js
@@ -0,0 +1,54 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+
+// Another rational approximation, not using Farey Sequences but Binary Search using the mediant
+function approximate(p, precision) {
+
+  var num1 = Math.floor(p);
+  var den1 = 1;
+
+  var num2 = num1 + 1;
+  var den2 = 1;
+
+  if (p !== num1) {
+
+    while (den1 <= precision && den2 <= precision) {
+
+      var m = (num1 + num2) / (den1 + den2);
+
+      if (p === m) {
+
+        if (den1 + den2 <= precision) {
+          den1 += den2;
+          num1 += num2;
+          den2 = precision + 1;
+        } else if (den1 > den2) {
+          den2 = precision + 1;
+        } else {
+          den1 = precision + 1;
+        }
+        break;
+
+      } else if (p < m) {
+        num2 += num1;
+        den2 += den1;
+      } else {
+        num1 += num2;
+        den1 += den2;
+      }
+    }
+  }
+
+  if (den1 > precision) {
+    den1 = den2;
+    num1 = num2;
+  }
+  return new Fraction(num1, den1);
+}
+
diff --git a/node_modules/fraction.js/examples/egyptian.js b/node_modules/fraction.js/examples/egyptian.js
new file mode 100644
index 0000000..66fc209
--- /dev/null
+++ b/node_modules/fraction.js/examples/egyptian.js
@@ -0,0 +1,24 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+
+// Based on http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fractions/egyptian.html
+function egyptian(a, b) {
+
+  var res = [];
+
+  do {
+    var t = Math.ceil(b / a);
+    var x = new Fraction(a, b).sub(1, t);
+    res.push(t);
+    a = Number(x.n);
+    b = Number(x.d);
+  } while (a !== 0n);
+  return res;
+}
+console.log("1 / " + egyptian(521, 1050).join(" + 1 / "));
diff --git a/node_modules/fraction.js/examples/hesse-convergence.js b/node_modules/fraction.js/examples/hesse-convergence.js
new file mode 100644
index 0000000..c33a58b
--- /dev/null
+++ b/node_modules/fraction.js/examples/hesse-convergence.js
@@ -0,0 +1,111 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+
+/*
+We have the polynom f(x) = 1/3x_1^2 + x_2^2 + x_1 * x_2 + 3
+
+The gradient of f(x):
+
+grad(x) = | x_1^2+x_2 |
+          | 2x_2+x_1  |
+
+And thus the Hesse-Matrix H:
+| 2x_1  1 |
+|  1    2 |
+
+The inverse Hesse-Matrix H^-1 is
+| -2 / (1-4x_1)    1 / (1 - 4x_1)     |
+| 1 / (1 - 4x_1)   -2x_1 / (1 - 4x_1) |
+
+We now want to find lim ->oo x[n], with the starting element of (3 2)^T
+
+*/
+
+// Get the Hesse Matrix
+function H(x) {
+
+  var z = Fraction(1).sub(Fraction(4).mul(x[0]));
+
+  return [
+    Fraction(-2).div(z),
+    Fraction(1).div(z),
+    Fraction(1).div(z),
+    Fraction(-2).mul(x[0]).div(z),
+  ];
+}
+
+// Get the gradient of f(x)
+function grad(x) {
+
+  return [
+    Fraction(x[0]).mul(x[0]).add(x[1]),
+    Fraction(2).mul(x[1]).add(x[0])
+  ];
+}
+
+// A simple matrix multiplication helper
+function matrMult(m, v) {
+
+  return [
+    Fraction(m[0]).mul(v[0]).add(Fraction(m[1]).mul(v[1])),
+    Fraction(m[2]).mul(v[0]).add(Fraction(m[3]).mul(v[1]))
+  ];
+}
+
+// A simple vector subtraction helper
+function vecSub(a, b) {
+
+  return [
+    Fraction(a[0]).sub(b[0]),
+    Fraction(a[1]).sub(b[1])
+  ];
+}
+
+// Main function, gets a vector and the actual index
+function run(V, j) {
+
+  var t = H(V);
+  //console.log("H(X)");
+  for (var i in t) {
+
+    //	console.log(t[i].toFraction());
+  }
+
+  var s = grad(V);
+  //console.log("vf(X)");
+  for (var i in s) {
+
+    //	console.log(s[i].toFraction());
+  }
+
+  //console.log("multiplication");
+  var r = matrMult(t, s);
+  for (var i in r) {
+
+    //	console.log(r[i].toFraction());
+  }
+
+  var R = (vecSub(V, r));
+
+  console.log("X" + j);
+  console.log(R[0].toFraction(), "= " + R[0].valueOf());
+  console.log(R[1].toFraction(), "= " + R[1].valueOf());
+  console.log("\n");
+
+  return R;
+}
+
+
+// Set the starting vector
+var v = [3, 2];
+
+for (var i = 0; i < 15; i++) {
+
+  v = run(v, i);
+}
diff --git a/node_modules/fraction.js/examples/integrate.js b/node_modules/fraction.js/examples/integrate.js
new file mode 100644
index 0000000..6376aed
--- /dev/null
+++ b/node_modules/fraction.js/examples/integrate.js
@@ -0,0 +1,67 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+
+// NOTE: This is a nice example, but a stable version of this is served with Polynomial.js: 
+// https://github.com/rawify/Polynomial.js
+
+function integrate(poly) {
+
+    poly = poly.replace(/\s+/g, "");
+
+    var regex = /(\([+-]?[0-9/]+\)|[+-]?[0-9/]+)x(?:\^(\([+-]?[0-9/]+\)|[+-]?[0-9]+))?/g;
+    var arr;
+    var res = {};
+    while (null !== (arr = regex.exec(poly))) {
+
+        var a = (arr[1] || "1").replace("(", "").replace(")", "").split("/");
+        var b = (arr[2] || "1").replace("(", "").replace(")", "").split("/");
+
+        var exp = new Fraction(b).add(1);
+        var key = "" + exp;
+
+        if (res[key] !== undefined) {
+            res[key] = { x: new Fraction(a).div(exp).add(res[key].x), e: exp };
+        } else {
+            res[key] = { x: new Fraction(a).div(exp), e: exp };
+        }
+    }
+
+    var str = "";
+    var c = 0;
+    for (var i in res) {
+        if (res[i].x.s !== -1n && c > 0) {
+            str += "+";
+        } else if (res[i].x.s === -1n) {
+            str += "-";
+        }
+        if (res[i].x.n !== res[i].x.d) {
+            if (res[i].x.d !== 1n) {
+                str += res[i].x.n + "/" + res[i].x.d;
+            } else {
+                str += res[i].x.n;
+            }
+        }
+        str += "x";
+        if (res[i].e.n !== res[i].e.d) {
+            str += "^";
+            if (res[i].e.d !== 1n) {
+                str += "(" + res[i].e.n + "/" + res[i].e.d + ")";
+            } else {
+                str += res[i].e.n;
+            }
+        }
+        c++;
+    }
+    return str;
+}
+
+var poly = "-2/3x^3-2x^2+3x+8x^3-1/3x^(4/8)";
+
+console.log("f(x): " + poly);
+console.log("F(x): " + integrate(poly));
diff --git a/node_modules/fraction.js/examples/ratio-chain.js b/node_modules/fraction.js/examples/ratio-chain.js
new file mode 100644
index 0000000..fab7876
--- /dev/null
+++ b/node_modules/fraction.js/examples/ratio-chain.js
@@ -0,0 +1,24 @@
+/*
+Given the ratio a : b : c = 2 : 3 : 4 
+What is c, given a = 40?
+
+A general ratio chain is a_1 : a_2 : a_3 : ... : a_n = r_1 : r2 : r_3 : ... : r_n.
+Now each term can be expressed as a_i = r_i * x for some unknown proportional constant x.
+If a_k is known it follows that x = a_k / r_k. Substituting x into the first equation yields
+a_i = r_i / r_k * a_k.
+
+Given an array r and a given value a_k, the following function calculates all a_i:
+*/
+
+function calculateRatios(r, a_k, k) {    
+    const x = Fraction(a_k).div(r[k]);
+    return r.map(r_i => x.mul(r_i));
+}
+
+// Example usage:
+const r = [2, 3, 4]; // Ratio array representing a : b : c = 2 : 3 : 4
+const a_k = 40; // Given value of a (corresponding to r[0])
+const k = 0; // Index of the known value (a corresponds to r[0])
+
+const result = calculateRatios(r, a_k, k);
+console.log(result); // Output: [40, 60, 80]
diff --git a/node_modules/fraction.js/examples/rational-pow.js b/node_modules/fraction.js/examples/rational-pow.js
new file mode 100644
index 0000000..1268e27
--- /dev/null
+++ b/node_modules/fraction.js/examples/rational-pow.js
@@ -0,0 +1,29 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+ 
+// Calculates (a/b)^(c/d) if result is rational
+// Derivation: https://raw.org/book/analysis/rational-numbers/
+function root(a, b, c, d) {
+
+  // Initial estimate
+  let x = Fraction(100 * (Math.floor(Math.pow(a / b, c / d)) || 1), 100);
+  const abc = Fraction(a, b).pow(c);
+
+  for (let i = 0; i < 30; i++) {
+    const n = abc.mul(x.pow(1 - d)).sub(x).div(d).add(x)
+
+    if (x.n === n.n && x.d === n.d) {
+      return n;
+    }
+    x = n;
+  }
+  return null;
+}
+
+root(18, 2, 1, 2); // 3/1
diff --git a/node_modules/fraction.js/examples/tape-measure.js b/node_modules/fraction.js/examples/tape-measure.js
new file mode 100644
index 0000000..14ec524
--- /dev/null
+++ b/node_modules/fraction.js/examples/tape-measure.js
@@ -0,0 +1,16 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+const Fraction = require('fraction.js');
+
+function closestTapeMeasure(frac) {
+
+    // A tape measure is usually divided in parts of 1/16
+
+    return Fraction(frac).roundTo("1/16");
+}
+console.log(closestTapeMeasure("1/3")); // 5/16
diff --git a/node_modules/fraction.js/examples/toFraction.js b/node_modules/fraction.js/examples/toFraction.js
new file mode 100644
index 0000000..f935e47
--- /dev/null
+++ b/node_modules/fraction.js/examples/toFraction.js
@@ -0,0 +1,35 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+
+const Fraction = require('fraction.js');
+
+function toFraction(frac) {
+
+  var map = {
+    '1:4': "¼",
+    '1:2': "½",
+    '3:4': "¾",
+    '1:7': "⅐",
+    '1:9': "⅑",
+    '1:10': "⅒",
+    '1:3': "⅓",
+    '2:3': "⅔",
+    '1:5': "⅕",
+    '2:5': "⅖",
+    '3:5': "⅗",
+    '4:5': "⅘",
+    '1:6': "⅙",
+    '5:6': "⅚",
+    '1:8': "⅛",
+    '3:8': "⅜",
+    '5:8': "⅝",
+    '7:8': "⅞"
+  };
+  return map[frac.n + ":" + frac.d] || frac.toFraction(false);
+}
+console.log(toFraction(Fraction(0.25))); // ¼
diff --git a/node_modules/fraction.js/examples/valueOfPi.js b/node_modules/fraction.js/examples/valueOfPi.js
new file mode 100644
index 0000000..8fc877e
--- /dev/null
+++ b/node_modules/fraction.js/examples/valueOfPi.js
@@ -0,0 +1,42 @@
+/*
+Fraction.js v5.0.0 10/1/2024
+https://raw.org/article/rational-numbers-in-javascript/
+
+Copyright (c) 2024, Robert Eisele (https://raw.org/)
+Licensed under the MIT license.
+*/
+
+var Fraction = require("fraction.js")
+
+function valueOfPi(val) {
+
+  let minLen = Infinity, minI = 0, min = null;
+  const choose = [val, val * Math.PI, val / Math.PI];
+  for (let i = 0; i < choose.length; i++) {
+    let el = new Fraction(choose[i]).simplify(1e-13);
+    let len = Math.log(Number(el.n) + 1) + Math.log(Number(el.d));
+    if (len < minLen) {
+      minLen = len;
+      minI = i;
+      min = el;
+    }
+  }
+
+  if (minI == 2) {
+    return min.toFraction().replace(/(\d+)(\/\d+)?/, (_, p, q) =>
+      (p == "1" ? "" : p) + "π" + (q || ""));
+  }
+
+  if (minI == 1) {
+    return min.toFraction().replace(/(\d+)(\/\d+)?/, (_, p, q) =>
+      p + (!q ? "/π" : "/(" + q.slice(1) + "π)"));
+  }
+  return min.toFraction();
+}
+
+console.log(valueOfPi(-3)); // -3
+console.log(valueOfPi(4 * Math.PI)); // 4π
+console.log(valueOfPi(3.14)); // 157/50
+console.log(valueOfPi(3 / 2 * Math.PI)); // 3π/2
+console.log(valueOfPi(Math.PI / 2)); // π/2
+console.log(valueOfPi(-1 / (2 * Math.PI))); // -1/(2π)
diff --git a/node_modules/fraction.js/fraction.d.mts b/node_modules/fraction.js/fraction.d.mts
new file mode 100644
index 0000000..0604ad7
--- /dev/null
+++ b/node_modules/fraction.js/fraction.d.mts
@@ -0,0 +1,79 @@
+/**
+ * Interface representing a fraction with numerator and denominator.
+ */
+export interface NumeratorDenominator {
+    n: number | bigint;
+    d: number | bigint;
+}
+
+/**
+ * Type for handling multiple types of input for Fraction operations.
+ */
+export type FractionInput =
+    | Fraction
+    | number
+    | bigint
+    | string
+    | [number | bigint | string, number | bigint | string]
+    | NumeratorDenominator;
+
+/**
+ * Function signature for Fraction operations like add, sub, mul, etc.
+ */
+export type FractionParam = {
+    (numerator: number | bigint, denominator: number | bigint): Fraction;
+    (num: FractionInput): Fraction;
+};
+
+/**
+ * Fraction class representing a rational number with numerator and denominator.
+ */
+declare class Fraction {
+    constructor();
+    constructor(num: FractionInput);
+    constructor(numerator: number | bigint, denominator: number | bigint);
+
+    s: bigint;
+    n: bigint;
+    d: bigint;
+
+    abs(): Fraction;
+    neg(): Fraction;
+
+    add: FractionParam;
+    sub: FractionParam;
+    mul: FractionParam;
+    div: FractionParam;
+    pow: FractionParam;
+    log: FractionParam;
+    gcd: FractionParam;
+    lcm: FractionParam;
+
+    mod(): Fraction;
+    mod(num: FractionInput): Fraction;
+
+    ceil(places?: number): Fraction;
+    floor(places?: number): Fraction;
+    round(places?: number): Fraction;
+    roundTo: FractionParam;
+
+    inverse(): Fraction;
+    simplify(eps?: number): Fraction;
+
+    equals(num: FractionInput): boolean;
+    lt(num: FractionInput): boolean;
+    lte(num: FractionInput): boolean;
+    gt(num: FractionInput): boolean;
+    gte(num: FractionInput): boolean;
+    compare(num: FractionInput): number;
+    divisible(num: FractionInput): boolean;
+
+    valueOf(): number;
+    toString(decimalPlaces?: number): string;
+    toLatex(showMixed?: boolean): string;
+    toFraction(showMixed?: boolean): string;
+    toContinued(): bigint[];
+    clone(): Fraction;
+}
+
+export { Fraction as default, Fraction };
\ No newline at end of file
diff --git a/node_modules/fraction.js/fraction.d.ts b/node_modules/fraction.js/fraction.d.ts
new file mode 100644
index 0000000..97222b9
--- /dev/null
+++ b/node_modules/fraction.js/fraction.d.ts
@@ -0,0 +1,79 @@
+declare class Fraction {
+  constructor();
+  constructor(num: Fraction.FractionInput);
+  constructor(numerator: number | bigint, denominator: number | bigint);
+
+  s: bigint;
+  n: bigint;
+  d: bigint;
+
+  abs(): Fraction;
+  neg(): Fraction;
+
+  add: Fraction.FractionParam;
+  sub: Fraction.FractionParam;
+  mul: Fraction.FractionParam;
+  div: Fraction.FractionParam;
+  pow: Fraction.FractionParam;
+  log: Fraction.FractionParam;
+  gcd: Fraction.FractionParam;
+  lcm: Fraction.FractionParam;
+
+  mod(): Fraction;
+  mod(num: Fraction.FractionInput): Fraction;
+
+  ceil(places?: number): Fraction;
+  floor(places?: number): Fraction;
+  round(places?: number): Fraction;
+  roundTo: Fraction.FractionParam;
+
+  inverse(): Fraction;
+  simplify(eps?: number): Fraction;
+
+  equals(num: Fraction.FractionInput): boolean;
+  lt(num: Fraction.FractionInput): boolean;
+  lte(num: Fraction.FractionInput): boolean;
+  gt(num: Fraction.FractionInput): boolean;
+  gte(num: Fraction.FractionInput): boolean;
+  compare(num: Fraction.FractionInput): number;
+  divisible(num: Fraction.FractionInput): boolean;
+
+  valueOf(): number;
+  toString(decimalPlaces?: number): string;
+  toLatex(showMixed?: boolean): string;
+  toFraction(showMixed?: boolean): string;
+  toContinued(): bigint[];
+  clone(): Fraction;
+
+  static default: typeof Fraction;
+  static Fraction: typeof Fraction;
+}
+
+declare namespace Fraction {
+  interface NumeratorDenominator { n: number | bigint; d: number | bigint; }
+  type FractionInput =
+    | Fraction
+    | number
+    | bigint
+    | string
+    | [number | bigint | string, number | bigint | string]
+    | NumeratorDenominator;
+
+  type FractionParam = {
+    (numerator: number | bigint, denominator: number | bigint): Fraction;
+    (num: FractionInput): Fraction;
+  };
+}
+
+/**
+ * Export matches CJS runtime:
+ *   module.exports = Fraction;
+ *   module.exports.default  = Fraction;
+ *   module.exports.Fraction = Fraction;
+ */
+declare const FractionExport: typeof Fraction & {
+  default: typeof Fraction;
+  Fraction: typeof Fraction;
+};
+
+export = FractionExport;
\ No newline at end of file
diff --git a/node_modules/fraction.js/package.json b/node_modules/fraction.js/package.json
new file mode 100644
index 0000000..03f7986
--- /dev/null
+++ b/node_modules/fraction.js/package.json
@@ -0,0 +1,81 @@
+{
+  "name": "fraction.js",
+  "title": "Fraction.js",
+  "version": "5.3.4",
+  "description": "The RAW rational numbers library",
+  "homepage": "https://raw.org/article/rational-numbers-in-javascript/",
+  "bugs": "https://github.com/rawify/Fraction.js/issues",
+  "keywords": [
+    "math",
+    "numbers",
+    "parser",
+    "ratio",
+    "fraction",
+    "fractions",
+    "rational",
+    "rationals",
+    "rational numbers",
+    "bigint",
+    "arbitrary precision",
+    "mixed numbers",
+    "decimal",
+    "numerator",
+    "denominator",
+    "simplification"
+  ],
+  "private": false,
+  "main": "./dist/fraction.js",
+  "module": "./dist/fraction.mjs",
+  "browser": "./dist/fraction.min.js",
+  "unpkg": "./dist/fraction.min.js",
+  "types": "./fraction.d.mts",
+  "exports": {
+    ".": {
+      "types": {
+        "import": "./fraction.d.mts",
+        "require": "./fraction.d.ts"
+      },
+      "import": "./dist/fraction.mjs",
+      "require": "./dist/fraction.js",
+      "browser": "./dist/fraction.min.js"
+    },
+    "./package.json": "./package.json"
+  },
+  "typesVersions": {
+    "<4.7": {
+      "*": [
+        "fraction.d.ts"
+      ]
+    }
+  },
+  "sideEffects": false,
+  "repository": {
+    "type": "git",
+    "url": "git+ssh://git@github.com/rawify/Fraction.js.git"
+  },
+  "funding": {
+    "type": "github",
+    "url": "https://github.com/sponsors/rawify"
+  },
+  "author": {
+    "name": "Robert Eisele",
+    "email": "robert@raw.org",
+    "url": "https://raw.org/"
+  },
+  "license": "MIT",
+  "engines": {
+    "node": "*"
+  },
+  "directories": {
+    "example": "examples",
+    "test": "tests"
+  },
+  "scripts": {
+    "build": "crude-build Fraction",
+    "test": "mocha tests/*.js"
+  },
+  "devDependencies": {
+    "crude-build": "^0.1.2",
+    "mocha": "*"
+  }
+}
\ No newline at end of file
diff --git a/node_modules/fraction.js/src/fraction.js b/node_modules/fraction.js/src/fraction.js
new file mode 100644
index 0000000..4292c48
--- /dev/null
+++ b/node_modules/fraction.js/src/fraction.js
@@ -0,0 +1,1046 @@
+/**
+ * @license Fraction.js v5.3.4 8/22/2025
+ * https://raw.org/article/rational-numbers-in-javascript/
+ *
+ * Copyright (c) 2025, Robert Eisele (https://raw.org/)
+ * Licensed under the MIT license.
+ **/
+
+/**
+ *
+ * This class offers the possibility to calculate fractions.
+ * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.
+ *
+ * Array/Object form
+ * [ 0 => <numerator>, 1 => <denominator> ]
+ * { n => <numerator>, d => <denominator> }
+ *
+ * Integer form
+ * - Single integer value as BigInt or Number
+ *
+ * Double form
+ * - Single double value as Number
+ *
+ * String form
+ * 123.456 - a simple double
+ * 123/456 - a string fraction
+ * 123.'456' - a double with repeating decimal places
+ * 123.(456) - synonym
+ * 123.45'6' - a double with repeating last place
+ * 123.45(6) - synonym
+ *
+ * Example:
+ * let f = new Fraction("9.4'31'");
+ * f.mul([-4, 3]).div(4.9);
+ *
+ */
+
+// Set Identity function to downgrade BigInt to Number if needed
+if (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(""); return n; };
+
+const C_ZERO = BigInt(0);
+const C_ONE = BigInt(1);
+const C_TWO = BigInt(2);
+const C_THREE = BigInt(3);
+const C_FIVE = BigInt(5);
+const C_TEN = BigInt(10);
+const MAX_INTEGER = BigInt(Number.MAX_SAFE_INTEGER);
+
+// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.
+// Example: 1/7 = 0.(142857) has 6 repeating decimal places.
+// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits
+const MAX_CYCLE_LEN = 2000;
+
+// Parsed data to avoid calling "new" all the time
+const P = {
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE
+};
+
+function assign(n, s) {
+
+  try {
+    n = BigInt(n);
+  } catch (e) {
+    throw InvalidParameter();
+  }
+  return n * s;
+}
+
+function ifloor(x) {
+  return typeof x === 'bigint' ? x : Math.floor(x);
+}
+
+// Creates a new Fraction internally without the need of the bulky constructor
+function newFraction(n, d) {
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  const f = Object.create(Fraction.prototype);
+  f["s"] = n < C_ZERO ? -C_ONE : C_ONE;
+
+  n = n < C_ZERO ? -n : n;
+
+  const a = gcd(n, d);
+
+  f["n"] = n / a;
+  f["d"] = d / a;
+  return f;
+}
+
+const FACTORSTEPS = [C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO, C_TWO * C_TWO, C_TWO * C_THREE, C_TWO, C_TWO * C_THREE]; // repeats
+function factorize(n) {
+
+  const factors = Object.create(null);
+  if (n <= C_ONE) {
+    factors[n] = C_ONE;
+    return factors;
+  }
+
+  const add = (p) => { factors[p] = (factors[p] || C_ZERO) + C_ONE; };
+
+  while (n % C_TWO === C_ZERO) { add(C_TWO); n /= C_TWO; }
+  while (n % C_THREE === C_ZERO) { add(C_THREE); n /= C_THREE; }
+  while (n % C_FIVE === C_ZERO) { add(C_FIVE); n /= C_FIVE; }
+
+  // 30-wheel trial division: test only residues coprime to 2*3*5
+  // Residue step pattern after 5: 7,11,13,17,19,23,29,31, ...
+  for (let si = 0, p = C_TWO + C_FIVE; p * p <= n;) {
+    while (n % p === C_ZERO) { add(p); n /= p; }
+    p += FACTORSTEPS[si];
+    si = (si + 1) & 7; // fast modulo 8
+  }
+  if (n > C_ONE) add(n);
+  return factors;
+}
+
+const parse = function (p1, p2) {
+
+  let n = C_ZERO, d = C_ONE, s = C_ONE;
+
+  if (p1 === undefined || p1 === null) { // No argument
+    /* void */
+  } else if (p2 !== undefined) { // Two arguments
+
+    if (typeof p1 === "bigint") {
+      n = p1;
+    } else if (isNaN(p1)) {
+      throw InvalidParameter();
+    } else if (p1 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      n = BigInt(p1);
+    }
+
+    if (typeof p2 === "bigint") {
+      d = p2;
+    } else if (isNaN(p2)) {
+      throw InvalidParameter();
+    } else if (p2 % 1 !== 0) {
+      throw NonIntegerParameter();
+    } else {
+      d = BigInt(p2);
+    }
+
+    s = n * d;
+
+  } else if (typeof p1 === "object") {
+    if ("d" in p1 && "n" in p1) {
+      n = BigInt(p1["n"]);
+      d = BigInt(p1["d"]);
+      if ("s" in p1)
+        n *= BigInt(p1["s"]);
+    } else if (0 in p1) {
+      n = BigInt(p1[0]);
+      if (1 in p1)
+        d = BigInt(p1[1]);
+    } else if (typeof p1 === "bigint") {
+      n = p1;
+    } else {
+      throw InvalidParameter();
+    }
+    s = n * d;
+  } else if (typeof p1 === "number") {
+
+    if (isNaN(p1)) {
+      throw InvalidParameter();
+    }
+
+    if (p1 < 0) {
+      s = -C_ONE;
+      p1 = -p1;
+    }
+
+    if (p1 % 1 === 0) {
+      n = BigInt(p1);
+    } else {
+
+      let z = 1;
+
+      let A = 0, B = 1;
+      let C = 1, D = 1;
+
+      let N = 10000000;
+
+      if (p1 >= 1) {
+        z = 10 ** Math.floor(1 + Math.log10(p1));
+        p1 /= z;
+      }
+
+      // Using Farey Sequences
+
+      while (B <= N && D <= N) {
+        let M = (A + C) / (B + D);
+
+        if (p1 === M) {
+          if (B + D <= N) {
+            n = A + C;
+            d = B + D;
+          } else if (D > B) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+          break;
+
+        } else {
+
+          if (p1 > M) {
+            A += C;
+            B += D;
+          } else {
+            C += A;
+            D += B;
+          }
+
+          if (B > N) {
+            n = C;
+            d = D;
+          } else {
+            n = A;
+            d = B;
+          }
+        }
+      }
+      n = BigInt(n) * BigInt(z);
+      d = BigInt(d);
+    }
+
+  } else if (typeof p1 === "string") {
+
+    let ndx = 0;
+
+    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;
+
+    let match = p1.replace(/_/g, '').match(/\d+|./g);
+
+    if (match === null)
+      throw InvalidParameter();
+
+    if (match[ndx] === '-') {// Check for minus sign at the beginning
+      s = -C_ONE;
+      ndx++;
+    } else if (match[ndx] === '+') {// Check for plus sign at the beginning
+      ndx++;
+    }
+
+    if (match.length === ndx + 1) { // Check if it's just a simple number "1234"
+      w = assign(match[ndx++], s);
+    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number
+
+      if (match[ndx] !== '.') { // Handle 0.5 and .5
+        v = assign(match[ndx++], s);
+      }
+      ndx++;
+
+      // Check for decimal places
+      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === "'" && match[ndx + 3] === "'") {
+        w = assign(match[ndx], s);
+        y = C_TEN ** BigInt(match[ndx].length);
+        ndx++;
+      }
+
+      // Check for repeating places
+      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === "'" && match[ndx + 2] === "'") {
+        x = assign(match[ndx + 1], s);
+        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;
+        ndx += 3;
+      }
+
+    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction "123/456" or "123:456"
+      w = assign(match[ndx], s);
+      y = assign(match[ndx + 2], C_ONE);
+      ndx += 3;
+    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction "123 1/2"
+      v = assign(match[ndx], s);
+      w = assign(match[ndx + 2], s);
+      y = assign(match[ndx + 4], C_ONE);
+      ndx += 5;
+    }
+
+    if (match.length <= ndx) { // Check for more tokens on the stack
+      d = y * z;
+      s = /* void */
+        n = x + d * v + z * w;
+    } else {
+      throw InvalidParameter();
+    }
+
+  } else if (typeof p1 === "bigint") {
+    n = p1;
+    s = p1;
+    d = C_ONE;
+  } else {
+    throw InvalidParameter();
+  }
+
+  if (d === C_ZERO) {
+    throw DivisionByZero();
+  }
+
+  P["s"] = s < C_ZERO ? -C_ONE : C_ONE;
+  P["n"] = n < C_ZERO ? -n : n;
+  P["d"] = d < C_ZERO ? -d : d;
+};
+
+function modpow(b, e, m) {
+
+  let r = C_ONE;
+  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {
+
+    if (e & C_ONE) {
+      r = (r * b) % m;
+    }
+  }
+  return r;
+}
+
+function cycleLen(n, d) {
+
+  for (; d % C_TWO === C_ZERO;
+    d /= C_TWO) {
+  }
+
+  for (; d % C_FIVE === C_ZERO;
+    d /= C_FIVE) {
+  }
+
+  if (d === C_ONE) // Catch non-cyclic numbers
+    return C_ZERO;
+
+  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:
+  // 10^(d-1) % d == 1
+  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,
+  // as we want to translate the numbers to strings.
+
+  let rem = C_TEN % d;
+  let t = 1;
+
+  for (; rem !== C_ONE; t++) {
+    rem = rem * C_TEN % d;
+
+    if (t > MAX_CYCLE_LEN)
+      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`
+  }
+  return BigInt(t);
+}
+
+function cycleStart(n, d, len) {
+
+  let rem1 = C_ONE;
+  let rem2 = modpow(C_TEN, len, d);
+
+  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)
+    // Solve 10^s == 10^(s+t) (mod d)
+
+    if (rem1 === rem2)
+      return BigInt(t);
+
+    rem1 = rem1 * C_TEN % d;
+    rem2 = rem2 * C_TEN % d;
+  }
+  return 0;
+}
+
+function gcd(a, b) {
+
+  if (!a)
+    return b;
+  if (!b)
+    return a;
+
+  while (1) {
+    a %= b;
+    if (!a)
+      return b;
+    b %= a;
+    if (!b)
+      return a;
+  }
+}
+
+/**
+ * Module constructor
+ *
+ * @constructor
+ * @param {number|Fraction=} a
+ * @param {number=} b
+ */
+function Fraction(a, b) {
+
+  parse(a, b);
+
+  if (this instanceof Fraction) {
+    a = gcd(P["d"], P["n"]); // Abuse a
+    this["s"] = P["s"];
+    this["n"] = P["n"] / a;
+    this["d"] = P["d"] / a;
+  } else {
+    return newFraction(P['s'] * P['n'], P['d']);
+  }
+}
+
+const DivisionByZero = function () { return new Error("Division by Zero"); };
+const InvalidParameter = function () { return new Error("Invalid argument"); };
+const NonIntegerParameter = function () { return new Error("Parameters must be integer"); };
+
+Fraction.prototype = {
+
+  "s": C_ONE,
+  "n": C_ZERO,
+  "d": C_ONE,
+
+  /**
+   * Calculates the absolute value
+   *
+   * Ex: new Fraction(-4).abs() => 4
+   **/
+  "abs": function () {
+
+    return newFraction(this["n"], this["d"]);
+  },
+
+  /**
+   * Inverts the sign of the current fraction
+   *
+   * Ex: new Fraction(-4).neg() => 4
+   **/
+  "neg": function () {
+
+    return newFraction(-this["s"] * this["n"], this["d"]);
+  },
+
+  /**
+   * Adds two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => 467 / 30
+   **/
+  "add": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] + P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Subtracts two rational numbers
+   *
+   * Ex: new Fraction({n: 2, d: 3}).add("14.9") => -427 / 30
+   **/
+  "sub": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * this["n"] * P["d"] - P["s"] * this["d"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Multiplies two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").mul(3) => 5776 / 111
+   **/
+  "mul": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["n"],
+      this["d"] * P["d"]
+    );
+  },
+
+  /**
+   * Divides two rational numbers
+   *
+   * Ex: new Fraction("-17.(345)").inverse().div(3)
+   **/
+  "div": function (a, b) {
+
+    parse(a, b);
+    return newFraction(
+      this["s"] * P["s"] * this["n"] * P["d"],
+      this["d"] * P["n"]
+    );
+  },
+
+  /**
+   * Clones the actual object
+   *
+   * Ex: new Fraction("-17.(345)").clone()
+   **/
+  "clone": function () {
+    return newFraction(this['s'] * this['n'], this['d']);
+  },
+
+  /**
+   * Calculates the modulo of two rational numbers - a more precise fmod
+   *
+   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)
+   * Ex: new Fraction(20, 10).mod().equals(0) ? "is Integer"
+   **/
+  "mod": function (a, b) {
+
+    if (a === undefined) {
+      return newFraction(this["s"] * this["n"] % this["d"], C_ONE);
+    }
+
+    parse(a, b);
+    if (C_ZERO === P["n"] * this["d"]) {
+      throw DivisionByZero();
+    }
+
+    /**
+     * I derived the rational modulo similar to the modulo for integers
+     *
+     * https://raw.org/book/analysis/rational-numbers/
+     *
+     *    n1/d1 = (n2/d2) * q + r, where 0 ≤ r < n2/d2
+     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r
+     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)
+     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)
+     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)
+     */
+    return newFraction(
+      this["s"] * (P["d"] * this["n"]) % (P["n"] * this["d"]),
+      P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional gcd of two rational numbers
+   *
+   * Ex: new Fraction(5,8).gcd(3,7) => 1/56
+   */
+  "gcd": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)
+
+    return newFraction(gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]), P["d"] * this["d"]);
+  },
+
+  /**
+   * Calculates the fractional lcm of two rational numbers
+   *
+   * Ex: new Fraction(5,8).lcm(3,7) => 15
+   */
+  "lcm": function (a, b) {
+
+    parse(a, b);
+
+    // https://raw.org/book/analysis/rational-numbers/
+    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)
+
+    if (P["n"] === C_ZERO && this["n"] === C_ZERO) {
+      return newFraction(C_ZERO, C_ONE);
+    }
+    return newFraction(P["n"] * this["n"], gcd(P["n"], this["n"]) * gcd(P["d"], this["d"]));
+  },
+
+  /**
+   * Gets the inverse of the fraction, means numerator and denominator are exchanged
+   *
+   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3
+   **/
+  "inverse": function () {
+    return newFraction(this["s"] * this["d"], this["n"]);
+  },
+
+  /**
+   * Calculates the fraction to some integer exponent
+   *
+   * Ex: new Fraction(-1,2).pow(-3) => -8
+   */
+  "pow": function (a, b) {
+
+    parse(a, b);
+
+    // Trivial case when exp is an integer
+
+    if (P['d'] === C_ONE) {
+
+      if (P['s'] < C_ZERO) {
+        return newFraction((this['s'] * this["d"]) ** P['n'], this["n"] ** P['n']);
+      } else {
+        return newFraction((this['s'] * this["n"]) ** P['n'], this["d"] ** P['n']);
+      }
+    }
+
+    // Negative roots become complex
+    //     (-a/b)^(c/d) = x
+    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x
+    // ⇔ (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula
+    // From which follows that only for c=0 the root is non-complex
+    if (this['s'] < C_ZERO) return null;
+
+    // Now prime factor n and d
+    let N = factorize(this['n']);
+    let D = factorize(this['d']);
+
+    // Exponentiate and take root for n and d individually
+    let n = C_ONE;
+    let d = C_ONE;
+    for (let k in N) {
+      if (k === '1') continue;
+      if (k === '0') {
+        n = C_ZERO;
+        break;
+      }
+      N[k] *= P['n'];
+
+      if (N[k] % P['d'] === C_ZERO) {
+        N[k] /= P['d'];
+      } else return null;
+      n *= BigInt(k) ** N[k];
+    }
+
+    for (let k in D) {
+      if (k === '1') continue;
+      D[k] *= P['n'];
+
+      if (D[k] % P['d'] === C_ZERO) {
+        D[k] /= P['d'];
+      } else return null;
+      d *= BigInt(k) ** D[k];
+    }
+
+    if (P['s'] < C_ZERO) {
+      return newFraction(d, n);
+    }
+    return newFraction(n, d);
+  },
+
+  /**
+   * Calculates the logarithm of a fraction to a given rational base
+   *
+   * Ex: new Fraction(27, 8).log(9, 4) => 3/2
+   */
+  "log": function (a, b) {
+
+    parse(a, b);
+
+    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;
+
+    const allPrimes = Object.create(null);
+
+    const baseFactors = factorize(P['n']);
+    const T1 = factorize(P['d']);
+
+    const numberFactors = factorize(this['n']);
+    const T2 = factorize(this['d']);
+
+    for (const prime in T1) {
+      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];
+    }
+    for (const prime in T2) {
+      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];
+    }
+
+    for (const prime in baseFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+    for (const prime in numberFactors) {
+      if (prime === '1') continue;
+      allPrimes[prime] = true;
+    }
+
+    let retN = null;
+    let retD = null;
+
+    // Iterate over all unique primes to determine if a consistent ratio exists
+    for (const prime in allPrimes) {
+
+      const baseExponent = baseFactors[prime] || C_ZERO;
+      const numberExponent = numberFactors[prime] || C_ZERO;
+
+      if (baseExponent === C_ZERO) {
+        if (numberExponent !== C_ZERO) {
+          return null; // Logarithm cannot be expressed as a rational number
+        }
+        continue; // Skip this prime since both exponents are zero
+      }
+
+      // Calculate the ratio of exponents for this prime
+      let curN = numberExponent;
+      let curD = baseExponent;
+
+      // Simplify the current ratio
+      const gcdValue = gcd(curN, curD);
+      curN /= gcdValue;
+      curD /= gcdValue;
+
+      // Check if this is the first ratio; otherwise, ensure ratios are consistent
+      if (retN === null && retD === null) {
+        retN = curN;
+        retD = curD;
+      } else if (curN * retD !== retN * curD) {
+        return null; // Ratios do not match, logarithm cannot be rational
+      }
+    }
+
+    return retN !== null && retD !== null
+      ? newFraction(retN, retD)
+      : null;
+  },
+
+  /**
+   * Check if two rational numbers are the same
+   *
+   * Ex: new Fraction(19.6).equals([98, 5]);
+   **/
+  "equals": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] === P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] < P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is less than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "lte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] <= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gt": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] > P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Check if this rational number is greater than or equal another
+   *
+   * Ex: new Fraction(19.6).lt([98, 5]);
+   **/
+  "gte": function (a, b) {
+
+    parse(a, b);
+    return this["s"] * this["n"] * P["d"] >= P["s"] * P["n"] * this["d"];
+  },
+
+  /**
+   * Compare two rational numbers
+   * < 0 iff this < that
+   * > 0 iff this > that
+   * = 0 iff this = that
+   *
+   * Ex: new Fraction(19.6).compare([98, 5]);
+   **/
+  "compare": function (a, b) {
+
+    parse(a, b);
+    let t = this["s"] * this["n"] * P["d"] - P["s"] * P["n"] * this["d"];
+
+    return (C_ZERO < t) - (t < C_ZERO);
+  },
+
+  /**
+   * Calculates the ceil of a rational number
+   *
+   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)
+   **/
+  "ceil": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] >= C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Calculates the floor of a rational number
+   *
+   * Ex: new Fraction('4.(3)').floor() => (4 / 1)
+   **/
+  "floor": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) -
+      (places * this["n"] % this["d"] > C_ZERO && this["s"] < C_ZERO ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+   * Rounds a rational numbers
+   *
+   * Ex: new Fraction('4.(3)').round() => (4 / 1)
+   **/
+  "round": function (places) {
+
+    places = C_TEN ** BigInt(places || 0);
+
+    /* Derivation:
+
+    s >= 0:
+      round(n / d) = ifloor(n / d) + (n % d) / d >= 0.5 ? 1 : 0
+                   = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    s < 0:
+      round(n / d) =-ifloor(n / d) - (n % d) / d > 0.5 ? 1 : 0
+                   =-ifloor(n / d) - 2(n % d) > d ? 1 : 0
+
+    =>:
+
+    round(s * n / d) = s * ifloor(n / d) + s * (C + 2(n % d) > d ? 1 : 0)
+        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.
+    */
+
+    return newFraction(ifloor(this["s"] * places * this["n"] / this["d"]) +
+      this["s"] * ((this["s"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this["n"] % this["d"]) > this["d"] ? C_ONE : C_ZERO),
+      places);
+  },
+
+  /**
+    * Rounds a rational number to a multiple of another rational number
+    *
+    * Ex: new Fraction('0.9').roundTo("1/8") => 7 / 8
+    **/
+  "roundTo": function (a, b) {
+
+    /*
+    k * x/y ≤ a/b < (k+1) * x/y
+    ⇔ k ≤ a/b / (x/y) < (k+1)
+    ⇔ k = floor(a/b * y/x)
+    ⇔ k = floor((a * y) / (b * x))
+    */
+
+    parse(a, b);
+
+    const n = this['n'] * P['d'];
+    const d = this['d'] * P['n'];
+    const r = n % d;
+
+    // round(n / d) = ifloor(n / d) + 2(n % d) >= d ? 1 : 0
+    let k = ifloor(n / d);
+    if (r + r >= d) {
+      k++;
+    }
+    return newFraction(this['s'] * k * P['n'], P['d']);
+  },
+
+  /**
+   * Check if two rational numbers are divisible
+   *
+   * Ex: new Fraction(19.6).divisible(1.5);
+   */
+  "divisible": function (a, b) {
+
+    parse(a, b);
+    if (P['n'] === C_ZERO) return false;
+    return (this['n'] * P['d']) % (P['n'] * this['d']) === C_ZERO;
+  },
+
+  /**
+   * Returns a decimal representation of the fraction
+   *
+   * Ex: new Fraction("100.'91823'").valueOf() => 100.91823918239183
+   **/
+  'valueOf': function () {
+    //if (this['n'] <= MAX_INTEGER && this['d'] <= MAX_INTEGER) {
+    return Number(this['s'] * this['n']) / Number(this['d']);
+    //}
+  },
+
+  /**
+   * Creates a string representation of a fraction with all digits
+   *
+   * Ex: new Fraction("100.'91823'").toString() => "100.(91823)"
+   **/
+  'toString': function (dec = 15) {
+
+    let N = this["n"];
+    let D = this["d"];
+
+    let cycLen = cycleLen(N, D); // Cycle length
+    let cycOff = cycleStart(N, D, cycLen); // Cycle start
+
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    // Append integer part
+    str += ifloor(N / D);
+
+    N %= D;
+    N *= C_TEN;
+
+    if (N)
+      str += ".";
+
+    if (cycLen) {
+
+      for (let i = cycOff; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += "(";
+      for (let i = cycLen; i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+      str += ")";
+    } else {
+      for (let i = dec; N && i--;) {
+        str += ifloor(N / D);
+        N %= D;
+        N *= C_TEN;
+      }
+    }
+    return str;
+  },
+
+  /**
+   * Returns a string-fraction representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toFraction() => "4 1/3"
+   **/
+  'toFraction': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        str += " ";
+        n %= d;
+      }
+
+      str += n;
+      str += '/';
+      str += d;
+    }
+    return str;
+  },
+
+  /**
+   * Returns a latex representation of a Fraction object
+   *
+   * Ex: new Fraction("1.'3'").toLatex() => "\frac{4}{3}"
+   **/
+  'toLatex': function (showMixed = false) {
+
+    let n = this["n"];
+    let d = this["d"];
+    let str = this['s'] < C_ZERO ? "-" : "";
+
+    if (d === C_ONE) {
+      str += n;
+    } else {
+      const whole = ifloor(n / d);
+      if (showMixed && whole > C_ZERO) {
+        str += whole;
+        n %= d;
+      }
+
+      str += "\\frac{";
+      str += n;
+      str += '}{';
+      str += d;
+      str += '}';
+    }
+    return str;
+  },
+
+  /**
+   * Returns an array of continued fraction elements
+   *
+   * Ex: new Fraction("7/8").toContinued() => [0,1,7]
+   */
+  'toContinued': function () {
+
+    let a = this['n'];
+    let b = this['d'];
+    const res = [];
+
+    while (b) {
+      res.push(ifloor(a / b));
+      const t = a % b;
+      a = b;
+      b = t;
+    }
+    return res;
+  },
+
+  "simplify": function (eps = 1e-3) {
+
+    // Continued fractions give best approximations for a max denominator,
+    // generally outperforming mediants in denominator–accuracy trade-offs.
+    // Semiconvergents can further reduce the denominator within tolerance.
+
+    const ieps = BigInt(Math.ceil(1 / eps));
+
+    const thisABS = this['abs']();
+    const cont = thisABS['toContinued']();
+
+    for (let i = 1; i < cont.length; i++) {
+
+      let s = newFraction(cont[i - 1], C_ONE);
+      for (let k = i - 2; k >= 0; k--) {
+        s = s['inverse']()['add'](cont[k]);
+      }
+
+      let t = s['sub'](thisABS);
+      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps
+        return s['mul'](this['s']);
+      }
+    }
+    return this;
+  }
+};
diff --git a/node_modules/fraction.js/tests/fraction.test.js b/node_modules/fraction.js/tests/fraction.test.js
new file mode 100644
index 0000000..b65833c
--- /dev/null
+++ b/node_modules/fraction.js/tests/fraction.test.js
@@ -0,0 +1,1806 @@
+const Fraction = require('fraction.js');
+const assert = require('assert');
+
+var DivisionByZero = function () { return new Error("Division by Zero"); };
+var InvalidParameter = function () { return new Error("Invalid argument"); };
+var NonIntegerParameter = function () { return new Error("Parameters must be integer"); };
+
+var tests = [{
+  set: "",
+  expectError: InvalidParameter()
+}, {
+  set: "foo",
+  expectError: InvalidParameter()
+}, {
+  set: " 123",
+  expectError: InvalidParameter()
+}, {
+  set: 0,
+  expect: 0
+}, {
+  set: .2,
+  expect: "0.2"
+}, {
+  set: .333,
+  expect: "0.333"
+}, {
+  set: 1.1,
+  expect: "1.1"
+}, {
+  set: 1.2,
+  expect: "1.2"
+}, {
+  set: 1.3,
+  expect: "1.3"
+}, {
+  set: 1.4,
+  expect: "1.4"
+}, {
+  set: 1.5,
+  expect: "1.5"
+}, {
+  set: 2.555,
+  expect: "2.555"
+}, {
+  set: 1e12,
+  expect: "1000000000000"
+}, {
+  set: " - ",
+  expectError: InvalidParameter()
+}, {
+  set: ".5",
+  expect: "0.5"
+}, {
+  set: "2_000_000",
+  expect: "2000000"
+}, {
+  set: "-.5",
+  expect: "-0.5"
+}, {
+  set: "123",
+  expect: "123"
+}, {
+  set: "-123",
+  expect: "-123"
+}, {
+  set: "123.4",
+  expect: "123.4"
+}, {
+  set: "-123.4",
+  expect: "-123.4"
+}, {
+  set: "123.",
+  expect: "123"
+}, {
+  set: "-123.",
+  expect: "-123"
+}, {
+  set: "123.4(56)",
+  expect: "123.4(56)"
+}, {
+  set: "-123.4(56)",
+  expect: "-123.4(56)"
+}, {
+  set: "123.(4)",
+  expect: "123.(4)"
+}, {
+  set: "-123.(4)",
+  expect: "-123.(4)"
+}, {
+  set: "0/0",
+  expectError: DivisionByZero()
+}, {
+  set: "9/0",
+  expectError: DivisionByZero()
+}, {
+  label: "0/1+0/1",
+  set: "0/1",
+  param: "0/1",
+  expect: "0"
+}, {
+  label: "1/9+0/1",
+  set: "1/9",
+  param: "0/1",
+  expect: "0.(1)"
+}, {
+  set: "123/456",
+  expect: "0.269(736842105263157894)"
+}, {
+  set: "-123/456",
+  expect: "-0.269(736842105263157894)"
+}, {
+  set: "19 123/456",
+  expect: "19.269(736842105263157894)"
+}, {
+  set: "-19 123/456",
+  expect: "-19.269(736842105263157894)"
+}, {
+  set: "123.(22)123",
+  expectError: InvalidParameter()
+}, {
+  set: "+33.3(3)",
+  expect: "33.(3)"
+}, {
+  set: "3.'09009'",
+  expect: "3.(09009)"
+}, {
+  set: "123.(((",
+  expectError: InvalidParameter()
+}, {
+  set: "123.((",
+  expectError: InvalidParameter()
+}, {
+  set: "123.()",
+  expectError: InvalidParameter()
+}, {
+  set: null,
+  expect: "0" // I would say it's just fine
+}, {
+  set: [22, 7],
+  expect: '3.(142857)' // We got Pi! - almost ;o
+}, {
+  set: "355/113",
+  expect: "3.(1415929203539823008849557522123893805309734513274336283185840707964601769911504424778761061946902654867256637168)" // Yay, a better PI
+}, {
+  set: "3 1/7",
+  expect: '3.(142857)'
+}, {
+  set: [36, -36],
+  expect: "-1"
+}, {
+  set: [1n, 3n],
+  expect: "0.(3)"
+}, {
+  set: 1n,
+  set2: 3n,
+  expect: "0.(3)"
+}, {
+  set: { n: 1n, d: 3n },
+  expect: "0.(3)"
+}, {
+  set: { n: 1n, d: 3n },
+  expect: "0.(3)"
+}, {
+  set: [1n, 3n],
+  expect: "0.(3)"
+}, {
+  set: "9/12",
+  expect: "0.75"
+}, {
+  set: "0.09(33)",
+  expect: "0.09(3)"
+}, {
+  set: 1 / 2,
+  expect: "0.5"
+}, {
+  set: 1 / 3,
+  expect: "0.(3)"
+}, {
+  set: "0.'3'",
+  expect: "0.(3)"
+}, {
+  set: "0.00002",
+  expect: "0.00002"
+}, {
+  set: 7 / 8,
+  expect: "0.875"
+}, {
+  set: 0.003,
+  expect: "0.003"
+}, {
+  set: 4,
+  expect: "4"
+}, {
+  set: -99,
+  expect: "-99"
+}, {
+  set: "-92332.1192",
+  expect: "-92332.1192"
+}, {
+  set: '88.92933(12111)',
+  expect: "88.92933(12111)"
+}, {
+  set: '-192322.823(123)',
+  expect: "-192322.8(231)"
+}, {
+  label: "-99.12 % 0.09(34)",
+  set: '-99.12',
+  fn: "mod",
+  param: "0.09(34)",
+  expect: "-0.07(95)"
+}, {
+  label: "0.4 / 0.1",
+  set: .4,
+  fn: "div",
+  param: ".1",
+  expect: "4"
+}, {
+  label: "1 / -.1",
+  set: 1,
+  fn: "div",
+  param: "-.1",
+  expect: "-10"
+}, {
+  label: "1 - (-1)",
+  set: 1,
+  fn: "sub",
+  param: "-1",
+  expect: "2"
+}, {
+  label: "1 + (-1)",
+  set: 1,
+  fn: "add",
+  param: "-1",
+  expect: "0"
+}, {
+  label: "-187 % 12",
+  set: '-187',
+  fn: "mod",
+  param: "12",
+  expect: "-7"
+}, {
+  label: "Negate by 99 * -1",
+  set: '99',
+  fn: "mul",
+  param: "-1",
+  expect: "-99"
+}, {
+  label: "0.5050000000000000000000000",
+  set: "0.5050000000000000000000000",
+  expect: "101/200",
+  fn: "toFraction",
+  param: true
+}, {
+  label: "0.505000000(0000000000)",
+  set: "0.505000000(0000000000)",
+  expect: "101/200",
+  fn: "toFraction",
+  param: true
+}, {
+  set: [20, -5],
+  expect: "-4",
+  fn: "toFraction",
+  param: true
+}, {
+  set: [-10, -7],
+  expect: "1 3/7",
+  fn: "toFraction",
+  param: true
+}, {
+  set: [21, -6],
+  expect: "-3 1/2",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "10/78",
+  expect: "5/39",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "0/91",
+  expect: "0",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "-0/287",
+  expect: "0",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "-5/20",
+  expect: "-1/4",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "42/9",
+  expect: "4 2/3",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "71/23",
+  expect: "3 2/23",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "6/3",
+  expect: "2",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "28/4",
+  expect: "7",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "105/35",
+  expect: "3",
+  fn: "toFraction",
+  param: true
+}, {
+  set: "4/6",
+  expect: "2/3",
+  fn: "toFraction",
+  param: true
+}, {
+  label: "99.(9) + 66",
+  set: '99.(999999)',
+  fn: "add",
+  param: "66",
+  expect: "166"
+}, {
+  label: "123.32 / 33.'9821'",
+  set: '123.32',
+  fn: "div",
+  param: "33.'9821'",
+  expect: "3.628958880242975"
+}, {
+  label: "-82.124 / 66.(3)",
+  set: '-82.124',
+  fn: "div",
+  param: "66.(3)",
+  expect: "-1.238(050251256281407035175879396984924623115577889447236180904522613065326633165829145728643216080402010)"
+}, {
+  label: "100 - .91",
+  set: '100',
+  fn: "sub",
+  param: ".91",
+  expect: "99.09"
+}, {
+  label: "381.(33411) % 11.119(356)",
+  set: '381.(33411)',
+  fn: "mod",
+  param: "11.119(356)",
+  expect: "3.275(997225017295217)"
+}, {
+  label: "13/26 mod 1",
+  set: '13/26',
+  fn: "mod",
+  param: "1.000",
+  expect: "0.5"
+}, {
+  label: "381.(33411) % 1", // Extract fraction part of a number
+  set: '381.(33411)',
+  fn: "mod",
+  param: "1",
+  expect: "0.(33411)"
+}, {
+  label: "-222/3",
+  set: {
+    n: 3,
+    d: 222,
+    s: -1
+  },
+  fn: "inverse",
+  param: null,
+  expect: "-74"
+}, {
+  label: "inverse",
+  set: 1 / 2,
+  fn: "inverse",
+  param: null,
+  expect: "2"
+}, {
+  label: "abs(-222/3)",
+  set: {
+    n: -222,
+    d: 3
+  },
+  fn: "abs",
+  param: null,
+  expect: "74"
+}, {
+  label: "9 % -2",
+  set: 9,
+  fn: "mod",
+  param: "-2",
+  expect: "1"
+}, {
+  label: "-9 % 2",
+  set: '-9',
+  fn: "mod",
+  param: "-2",
+  expect: "-1"
+}, {
+  label: "1 / 195312500",
+  set: '1',
+  fn: "div",
+  param: "195312500",
+  expect: "0.00000000512"
+}, {
+  label: "10 / 0",
+  set: 10,
+  fn: "div",
+  param: 0,
+  expectError: DivisionByZero()
+}, {
+  label: "-3 / 4",
+  set: [-3, 4],
+  fn: "inverse",
+  param: null,
+  expect: "-1.(3)"
+}, {
+  label: "-19.6",
+  set: [-98, 5],
+  fn: "equals",
+  param: '-19.6',
+  expect: "true" // actually, we get a real bool but we call toString() in the test below
+}, {
+  label: "-19.6",
+  set: [98, -5],
+  fn: "equals",
+  param: '-19.6',
+  expect: "true"
+}, {
+  label: "99/88",
+  set: [99, 88],
+  fn: "equals",
+  param: [88, 99],
+  expect: "false"
+}, {
+  label: "99/88",
+  set: [99, -88],
+  fn: "equals",
+  param: [9, 8],
+  expect: "false"
+}, {
+  label: "12.5",
+  set: 12.5,
+  fn: "add",
+  param: 0,
+  expect: "12.5"
+}, {
+  label: "0/1 -> 1/0",
+  set: 0,
+  fn: "inverse",
+  param: null,
+  expectError: DivisionByZero()
+}, {
+  label: "abs(-100.25)",
+  set: -100.25,
+  fn: "abs",
+  param: null,
+  expect: "100.25"
+}, {
+  label: "0.022222222",
+  set: '0.0(22222222)',
+  fn: "abs",
+  param: null,
+  expect: "0.0(2)"
+}, {
+  label: "1.5 | 100.5",
+  set: 100.5,
+  fn: "divisible",
+  param: '1.5',
+  expect: "true"
+}, {
+  label: "1.5 | 100.6",
+  set: 100.6,
+  fn: "divisible",
+  param: 1.6,
+  expect: "false"
+}, {
+  label: "(1/6) | (2/3)", // == 4
+  set: [2, 3],
+  fn: "divisible",
+  param: [1, 6],
+  expect: "true"
+}, {
+  label: "(1/6) | (2/5)",
+  set: [2, 5],
+  fn: "divisible",
+  param: [1, 6],
+  expect: "false"
+}, {
+  label: "0 | (2/5)",
+  set: [2, 5],
+  fn: "divisible",
+  param: 0,
+  expect: "false"
+}, {
+  label: "6 | 0",
+  set: 0,
+  fn: "divisible",
+  param: 6,
+  expect: "true"
+}, {
+  label: "fmod(4.55, 0.05)", // http://phpjs.org/functions/fmod/ (comment section)
+  set: 4.55,
+  fn: "mod",
+  param: 0.05,
+  expect: "0"
+}, {
+  label: "fmod(99.12, 0.4)",
+  set: 99.12,
+  fn: "mod",
+  param: "0.4",
+  expect: "0.32"
+}, {
+  label: "fmod(fmod(1.0,0.1))", // http://stackoverflow.com/questions/4218961/why-fmod1-0-0-1-1
+  set: 1.0,
+  fn: "mod",
+  param: 0.1,
+  expect: "0"
+}, {
+  label: "bignum",
+  set: [5385020324, 1673196525],
+  fn: "add",
+  param: 0,
+  expect: "3.21(840276592733181776121606516006839065124164060763872313206005492988936251824931324190982287630557922656455433410609073551596098372245902196097377144624418820138297860736950789447760776337973807350574075570710380240599651018280712721418065340531352107607323652551812465663589637206543923464101146157950573080469432602963360804254598843372567965379918536467197121390148715495330113717514444395585868193217769203770011415724163065662594535928766646225254382476081224230369471990147720394052336440275597631903998844367669243157195775313960803259497565595290726533154854597848271290188102679689703515252041298615534717298077104242133182771222884293284077911887845930112722413166618308629346454087334421161315763550250022184333666363549254920906556389124702491239037207539024741878423396797336762338781453063321417070239253574830368476888869943116813489676593728283053898883754853602746993512910863832926021645903191198654921901657666901979730085800889408373591978384009612977172541043856160291750546158945674358246709841810124486123947693472528578195558946669459524487119048971249805817042322628538808374587079661786890216019304725725509141850506771761314768448972244907094819599867385572056456428511886850828834945135927771544947477105237234460548500123140047759781236696030073335228807028510891749551057667897081007863078128255137273847732859712937785356684266362554153643129279150277938809369688357439064129062782986595074359241811119587401724970711375341877428295519559485099934689381452068220139292962014728066686607540019843156200674036183526020650801913421377683054893985032630879985)"
+}, {
+  label: "ceil(0.4)",
+  set: 0.4,
+  fn: "ceil",
+  param: null,
+  expect: "1"
+},
+
+
+{
+  label: "1 < 2",
+  set: 1,
+  fn: "lt",
+  param: 2,
+  expect: "true"
+}, {
+  label: "2 < 2",
+  set: 2,
+  fn: "lt",
+  param: 2,
+  expect: "false"
+}, {
+  label: "3 > 2",
+  set: 3,
+  fn: "gt",
+  param: 2,
+  expect: "true"
+}, {
+  label: "2 > 2",
+  set: 2,
+  fn: "gt",
+  param: 2,
+  expect: "false"
+}, {
+  label: "1 <= 2",
+  set: 1,
+  fn: "lte",
+  param: 2,
+  expect: "true"
+}, {
+  label: "2 <= 2",
+  set: 2,
+  fn: "lte",
+  param: 2,
+  expect: "true"
+}, {
+  label: "3 <= 2",
+  set: 3,
+  fn: "lte",
+  param: 2,
+  expect: "false"
+}, {
+  label: "3 >= 2",
+  set: 3,
+  fn: "gte",
+  param: 2,
+  expect: "true"
+}, {
+  label: "2 >= 2",
+  set: 2,
+  fn: "gte",
+  param: 2,
+  expect: "true"
+}, {
+  label: "ceil(0.5)",
+  set: 0.5,
+  fn: "ceil",
+  param: null,
+  expect: "1"
+}, {
+  label: "ceil(0.23, 2)",
+  set: 0.23,
+  fn: "ceil",
+  param: 2,
+  expect: "0.23"
+}, {
+  label: "ceil(0.6)",
+  set: 0.6,
+  fn: "ceil",
+  param: null,
+  expect: "1"
+}, {
+  label: "ceil(-0.4)",
+  set: -0.4,
+  fn: "ceil",
+  param: null,
+  expect: "0"
+}, {
+  label: "ceil(-0.5)",
+  set: -0.5,
+  fn: "ceil",
+  param: null,
+  expect: "0"
+}, {
+  label: "ceil(-0.6)",
+  set: -0.6,
+  fn: "ceil",
+  param: null,
+  expect: "0"
+}, {
+  label: "floor(0.4)",
+  set: 0.4,
+  fn: "floor",
+  param: null,
+  expect: "0"
+}, {
+  label: "floor(0.4, 1)",
+  set: 0.4,
+  fn: "floor",
+  param: 1,
+  expect: "0.4"
+}, {
+  label: "floor(0.5)",
+  set: 0.5,
+  fn: "floor",
+  param: null,
+  expect: "0"
+}, {
+  label: "floor(0.6)",
+  set: 0.6,
+  fn: "floor",
+  param: null,
+  expect: "0"
+}, {
+  label: "floor(-0.4)",
+  set: -0.4,
+  fn: "floor",
+  param: null,
+  expect: "-1"
+}, {
+  label: "floor(-0.5)",
+  set: -0.5,
+  fn: "floor",
+  param: null,
+  expect: "-1"
+}, {
+  label: "floor(-0.6)",
+  set: -0.6,
+  fn: "floor",
+  param: null,
+  expect: "-1"
+}, {
+  label: "floor(10.4)",
+  set: 10.4,
+  fn: "floor",
+  param: null,
+  expect: "10"
+}, {
+  label: "floor(10.4, 1)",
+  set: 10.4,
+  fn: "floor",
+  param: 1,
+  expect: "10.4"
+}, {
+  label: "floor(10.5)",
+  set: 10.5,
+  fn: "floor",
+  param: null,
+  expect: "10"
+}, {
+  label: "floor(10.6)",
+  set: 10.6,
+  fn: "floor",
+  param: null,
+  expect: "10"
+}, {
+  label: "floor(-10.4)",
+  set: -10.4,
+  fn: "floor",
+  param: null,
+  expect: "-11"
+}, {
+  label: "floor(-10.5)",
+  set: -10.5,
+  fn: "floor",
+  param: null,
+  expect: "-11"
+}, {
+  label: "floor(-10.6)",
+  set: -10.6,
+  fn: "floor",
+  param: null,
+  expect: "-11"
+}, {
+  label: "floor(-10.543,3)",
+  set: -10.543,
+  fn: "floor",
+  param: 3,
+  expect: "-10.543"
+}, {
+  label: "floor(10.543,3)",
+  set: 10.543,
+  fn: "floor",
+  param: 3,
+  expect: "10.543"
+}, {
+  label: "round(-10.543,3)",
+  set: -10.543,
+  fn: "round",
+  param: 3,
+  expect: "-10.543"
+}, {
+  label: "round(10.543,3)",
+  set: 10.543,
+  fn: "round",
+  param: 3,
+  expect: "10.543"
+}, {
+  label: "round(10.4)",
+  set: 10.4,
+  fn: "round",
+  param: null,
+  expect: "10"
+}, {
+  label: "round(10.5)",
+  set: 10.5,
+  fn: "round",
+  param: null,
+  expect: "11"
+}, {
+  label: "round(10.5, 1)",
+  set: 10.5,
+  fn: "round",
+  param: 1,
+  expect: "10.5"
+}, {
+  label: "round(10.6)",
+  set: 10.6,
+  fn: "round",
+  param: null,
+  expect: "11"
+}, {
+  label: "round(-10.4)",
+  set: -10.4,
+  fn: "round",
+  param: null,
+  expect: "-10"
+}, {
+  label: "round(-10.5)",
+  set: -10.5,
+  fn: "round",
+  param: null,
+  expect: "-10"
+}, {
+  label: "round(-10.6)",
+  set: -10.6,
+  fn: "round",
+  param: null,
+  expect: "-11"
+}, {
+  label: "round(-0.4)",
+  set: -0.4,
+  fn: "round",
+  param: null,
+  expect: "0"
+}, {
+  label: "round(-0.5)",
+  set: -0.5,
+  fn: "round",
+  param: null,
+  expect: "0"
+}, {
+  label: "round(-0.6)",
+  set: -0.6,
+  fn: "round",
+  param: null,
+  expect: "-1"
+}, {
+  label: "round(-0)",
+  set: -0,
+  fn: "round",
+  param: null,
+  expect: "0"
+}, {
+  label: "round(big fraction)",
+  set: [
+    '409652136432929109317120'.repeat(100),
+    '63723676445298091081155'.repeat(100)
+  ],
+  fn: "round",
+  param: null,
+  expect: "6428570341270001560623330590225448467479093479780591305451264291405695842465355472558570608574213642"
+}, {
+  label: "round(big numerator)",
+  set: ['409652136432929109317'.repeat(100), 10],
+  fn: "round",
+  param: null,
+  expect: '409652136432929109317'.repeat(99) + '40965213643292910932'
+}, {
+  label: "17402216385200408/5539306332998545",
+  set: [17402216385200408, 5539306332998545],
+  fn: "add",
+  param: 0,
+  expect: "3.141587653589870"
+}, {
+  label: "17402216385200401/553930633299855",
+  set: [17402216385200401, 553930633299855],
+  fn: "add",
+  param: 0,
+  expect: "31.415876535898660"
+}, {
+  label: "1283191/418183",
+  set: [1283191, 418183],
+  fn: "add",
+  param: 0,
+  expect: "3.068491545567371"
+}, {
+  label: "1.001",
+  set: "1.001",
+  fn: "add",
+  param: 0,
+  expect: "1.001"
+}, {
+  label: "99+1",
+  set: [99, 1],
+  fn: "add",
+  param: 1,
+  expect: "100"
+}, {
+  label: "gcd(5/8, 3/7)",
+  set: [5, 8],
+  fn: "gcd",
+  param: [3, 7],
+  expect: "0.017(857142)" // == 1/56
+}, {
+  label: "gcd(52, 39)",
+  set: 52,
+  fn: "gcd",
+  param: 39,
+  expect: "13"
+}, {
+  label: "gcd(51357, 3819)",
+  set: 51357,
+  fn: "gcd",
+  param: 3819,
+  expect: "57"
+}, {
+  label: "gcd(841, 299)",
+  set: 841,
+  fn: "gcd",
+  param: 299,
+  expect: "1"
+}, {
+  label: "gcd(2/3, 7/5)",
+  set: [2, 3],
+  fn: "gcd",
+  param: [7, 5],
+  expect: "0.0(6)" // == 1/15
+}, {
+  label: "lcm(-3, 3)",
+  set: -3,
+  fn: "lcm",
+  param: 3,
+  expect: "3"
+}, {
+  label: "lcm(3,-3)",
+  set: 3,
+  fn: "lcm",
+  param: -3,
+  expect: "3"
+}, {
+  label: "lcm(0,3)",
+  set: 0,
+  fn: "lcm",
+  param: 3,
+  expect: "0"
+}, {
+  label: "lcm(3, 0)",
+  set: 3,
+  fn: "lcm",
+  param: 0,
+  expect: "0"
+}, {
+  label: "lcm(0, 0)",
+  set: 0,
+  fn: "lcm",
+  param: 0,
+  expect: "0"
+}, {
+  label: "lcm(200, 333)",
+  set: 200,
+  fn: "lcm",
+  param: 333, expect: "66600"
+},
+{
+  label: "1 + -1",
+  set: 1,
+  fn: "add",
+  param: -1,
+  expect: "0"
+}, {
+  label: "3/10+3/14",
+  set: "3/10",
+  fn: "add",
+  param: "3/14",
+  expect: "0.5(142857)"
+}, {
+  label: "3/10-3/14",
+  set: "3/10",
+  fn: "sub",
+  param: "3/14",
+  expect: "0.0(857142)"
+}, {
+  label: "3/10*3/14",
+  set: "3/10",
+  fn: "mul",
+  param: "3/14",
+  expect: "0.06(428571)"
+}, {
+  label: "3/10 / 3/14",
+  set: "3/10",
+  fn: "div",
+  param: "3/14",
+  expect: "1.4"
+}, {
+  label: "1-2",
+  set: "1",
+  fn: "sub",
+  param: "2",
+  expect: "-1"
+}, {
+  label: "1--1",
+  set: "1",
+  fn: "sub",
+  param: "-1",
+  expect: "2"
+}, {
+  label: "0/1*1/3",
+  set: "0/1",
+  fn: "mul",
+  param: "1/3",
+  expect: "0"
+}, {
+  label: "3/10 * 8/12",
+  set: "3/10",
+  fn: "mul",
+  param: "8/12",
+  expect: "0.2"
+}, {
+  label: ".5+5",
+  set: ".5",
+  fn: "add",
+  param: 5, expect: "5.5"
+},
+{
+  label: "10/12-5/60",
+  set: "10/12",
+  fn: "sub",
+  param: "5/60",
+  expect: "0.75"
+}, {
+  label: "10/15 / 3/4",
+  set: "10/15",
+  fn: "div",
+  param: "3/4",
+  expect: "0.(8)"
+}, {
+  label: "1/4 + 3/8",
+  set: "1/4",
+  fn: "add",
+  param: "3/8",
+  expect: "0.625"
+}, {
+  label: "2-1/3",
+  set: "2",
+  fn: "sub",
+  param: "1/3",
+  expect: "1.(6)"
+}, {
+  label: "5*6",
+  set: "5",
+  fn: "mul",
+  param: 6,
+  expect: "30"
+}, {
+  label: "1/2-1/5",
+  set: "1/2",
+  fn: "sub",
+  param: "1/5",
+  expect: "0.3"
+}, {
+  label: "1/2-5",
+  set: "1/2",
+  fn: "add",
+  param: -5,
+  expect: "-4.5"
+}, {
+  label: "1*-1",
+  set: "1",
+  fn: "mul",
+  param: -1,
+  expect: "-1"
+}, {
+  label: "5/10",
+  set: 5.0,
+  fn: "div",
+  param: 10,
+  expect: "0.5"
+}, {
+  label: "1/-1",
+  set: "1",
+  fn: "div",
+  param: -1,
+  expect: "-1"
+}, {
+  label: "4/5 + 13/2",
+  set: "4/5",
+  fn: "add",
+  param: "13/2",
+  expect: "7.3"
+}, {
+  label: "4/5 + 61/2",
+  set: "4/5",
+  fn: "add",
+  param: "61/2",
+  expect: "31.3"
+}, {
+  label: "0.8 + 6.5",
+  set: "0.8",
+  fn: "add",
+  param: "6.5",
+  expect: "7.3"
+}, {
+  label: "2/7 inverse",
+  set: "2/7",
+  fn: "inverse",
+  param: null,
+  expect: "3.5"
+}, {
+  label: "neg 1/3",
+  set: "1/3",
+  fn: "neg",
+  param: null,
+  expect: "-0.(3)"
+}, {
+  label: "1/2+1/3",
+  set: "1/2",
+  fn: "add",
+  param: "1/3",
+  expect: "0.8(3)"
+}, {
+  label: "1/2+3",
+  set: ".5",
+  fn: "add",
+  param: 3,
+  expect: "3.5"
+}, {
+  label: "1/2+3.14",
+  set: "1/2",
+  fn: "add",
+  param: "3.14",
+  expect: "3.64"
+}, {
+  label: "3.5 < 4.1",
+  set: 3.5,
+  fn: "compare",
+  param: 4.1,
+  expect: "-1"
+}, {
+  label: "3.5 > 4.1",
+  set: 4.1,
+  fn: "compare",
+  param: 3.1,
+  expect: "1"
+}, {
+  label: "-3.5 > -4.1",
+  set: -3.5,
+  fn: "compare",
+  param: -4.1,
+  expect: "1"
+}, {
+  label: "-3.5 > -4.1",
+  set: -4.1,
+  fn: "compare",
+  param: -3.5,
+  expect: "-1"
+}, {
+  label: "4.3 == 4.3",
+  set: 4.3,
+  fn: "compare",
+  param: 4.3,
+  expect: "0"
+}, {
+  label: "-4.3 == -4.3",
+  set: -4.3,
+  fn: "compare",
+  param: -4.3,
+  expect: "0"
+}, {
+  label: "-4.3 < 4.3",
+  set: -4.3,
+  fn: "compare",
+  param: 4.3,
+  expect: "-1"
+}, {
+  label: "4.3 == -4.3",
+  set: 4.3,
+  fn: "compare",
+  param: -4.3,
+  expect: "1"
+}, {
+  label: "2^0.5",
+  set: 2,
+  fn: "pow",
+  param: 0.5,
+  expect: "null"
+}, {
+  label: "(-8/27)^(1/3)",
+  set: [-8, 27],
+  fn: "pow",
+  param: [1, 3],
+  expect: "null"
+}, {
+  label: "(-8/27)^(2/3)",
+  set: [-8, 27],
+  fn: "pow",
+  param: [2, 3],
+  expect: "null"
+}, {
+  label: "(-32/243)^(5/3)",
+  set: [-32, 243],
+  fn: "pow",
+  param: [5, 3],
+  expect: "null"
+}, {
+  label: "sqrt(0)",
+  set: 0,
+  fn: "pow",
+  param: 0.5,
+  expect: "0"
+}, {
+  label: "27^(2/3)",
+  set: 27,
+  fn: "pow",
+  param: "2/3",
+  expect: "9"
+}, {
+  label: "(243/1024)^(2/5)",
+  set: "243/1024",
+  fn: "pow",
+  param: "2/5",
+  expect: "0.5625"
+}, {
+  label: "-0.5^-3",
+  set: -0.5,
+  fn: "pow",
+  param: -3,
+  expect: "-8"
+}, {
+  label: "",
+  set: -3,
+  fn: "pow",
+  param: -3,
+  expect: "-0.(037)"
+}, {
+  label: "-3",
+  set: -3,
+  fn: "pow",
+  param: 2,
+  expect: "9"
+}, {
+  label: "-3",
+  set: -3,
+  fn: "pow",
+  param: 3,
+  expect: "-27"
+}, {
+  label: "0^0",
+  set: 0,
+  fn: "pow",
+  param: 0,
+  expect: "1"
+}, {
+  label: "2/3^7",
+  set: [2, 3],
+  fn: "pow",
+  param: 7,
+  expect: "0.(058527663465935070873342478280749885688157293095564700502972107910379515317786922725194330132601737540009144947416552354823959762231367169638774577046181984453589391860996799268404206675811614083219021490626428898033836305441243712848651120256)"
+}, {
+  label: "-0.6^4",
+  set: -0.6,
+  fn: "pow",
+  param: 4,
+  expect: "0.1296"
+}, {
+  label: "8128371:12394 - 8128371/12394",
+  set: "8128371:12394",
+  fn: "sub",
+  param: "8128371/12394",
+  expect: "0"
+}, {
+  label: "3/4 + 1/4",
+  set: "3/4",
+  fn: "add",
+  param: "1/4",
+  expect: "1"
+}, {
+  label: "1/10 + 2/10",
+  set: "1/10",
+  fn: "add",
+  param: "2/10",
+  expect: "0.3"
+}, {
+  label: "5/10 + 2/10",
+  set: "5/10",
+  fn: "add",
+  param: "2/10",
+  expect: "0.7"
+}, {
+  label: "18/10 + 2/10",
+  set: "18/10",
+  fn: "add",
+  param: "2/10",
+  expect: "2"
+}, {
+  label: "1/3 + 1/6",
+  set: "1/3",
+  fn: "add",
+  param: "1/6",
+  expect: "0.5"
+}, {
+  label: "1/3 + 2/6",
+  set: "1/3",
+  fn: "add",
+  param: "2/6",
+  expect: "0.(6)"
+}, {
+  label: "3/4 / 1/4",
+  set: "3/4",
+  fn: "div",
+  param: "1/4",
+  expect: "3"
+}, {
+  label: "1/10 / 2/10",
+  set: "1/10",
+  fn: "div",
+  param: "2/10",
+  expect: "0.5"
+}, {
+  label: "5/10 / 2/10",
+  set: "5/10",
+  fn: "div",
+  param: "2/10",
+  expect: "2.5"
+}, {
+  label: "18/10 / 2/10",
+  set: "18/10",
+  fn: "div",
+  param: "2/10",
+  expect: "9"
+}, {
+  label: "1/3 / 1/6",
+  set: "1/3",
+  fn: "div",
+  param: "1/6",
+  expect: "2"
+}, {
+  label: "1/3 / 2/6",
+  set: "1/3",
+  fn: "div",
+  param: "2/6",
+  expect: "1"
+}, {
+  label: "3/4 * 1/4",
+  set: "3/4",
+  fn: "mul",
+  param: "1/4",
+  expect: "0.1875"
+}, {
+  label: "1/10 * 2/10",
+  set: "1/10",
+  fn: "mul",
+  param: "2/10",
+  expect: "0.02"
+}, {
+  label: "5/10 * 2/10",
+  set: "5/10",
+  fn: "mul",
+  param: "2/10",
+  expect: "0.1"
+}, {
+  label: "18/10 * 2/10",
+  set: "18/10",
+  fn: "mul",
+  param: "2/10",
+  expect: "0.36"
+}, {
+  label: "1/3 * 1/6",
+  set: "1/3",
+  fn: "mul",
+  param: "1/6",
+  expect: "0.0(5)"
+}, {
+  label: "1/3 * 2/6",
+  set: "1/3",
+  fn: "mul",
+  param: "2/6",
+  expect: "0.(1)"
+}, {
+  label: "5/4 - 1/4",
+  set: "5/4",
+  fn: "sub",
+  param: "1/4",
+  expect: "1"
+}, {
+  label: "5/10 - 2/10",
+  set: "5/10",
+  fn: "sub",
+  param: "2/10",
+  expect: "0.3"
+}, {
+  label: "9/10 - 2/10",
+  set: "9/10",
+  fn: "sub",
+  param: "2/10",
+  expect: "0.7"
+}, {
+  label: "22/10 - 2/10",
+  set: "22/10",
+  fn: "sub",
+  param: "2/10",
+  expect: "2"
+}, {
+  label: "2/3 - 1/6",
+  set: "2/3",
+  fn: "sub",
+  param: "1/6",
+  expect: "0.5"
+}, {
+  label: "3/3 - 2/6",
+  set: "3/3",
+  fn: "sub",
+  param: "2/6",
+  expect: "0.(6)"
+}, {
+  label: "0.006999999999999999",
+  set: 0.006999999999999999,
+  fn: "add",
+  param: 0,
+  expect: "0.007"
+}, {
+  label: "1/7 - 1",
+  set: 1 / 7,
+  fn: "add",
+  param: -1,
+  expect: "-0.(857142)"
+}, {
+  label: "0.0065 + 0.0005",
+  set: 0.0065,
+  fn: "add",
+  param: 0.0005,
+  expect: "0.007"
+}, {
+  label: "6.5/.5",
+  set: 6.5,
+  fn: "div",
+  param: .5,
+  expect: "13"
+}, {
+  label: "0.999999999999999999999999999",
+  set: 0.999999999999999999999999999,
+  fn: "sub",
+  param: 1,
+  expect: "0"
+}, {
+  label: "0.5833333333333334",
+  set: 0.5833333333333334,
+  fn: "add",
+  param: 0,
+  expect: "0.58(3)"
+}, {
+  label: "1.75/3",
+  set: 1.75 / 3,
+  fn: "add",
+  param: 0,
+  expect: "0.58(3)"
+}, {
+  label: "3.3333333333333",
+  set: 3.3333333333333,
+  fn: "add",
+  param: 0,
+  expect: "3.(3)"
+}, {
+  label: "4.285714285714285714285714",
+  set: 4.285714285714285714285714,
+  fn: "add",
+  param: 0,
+  expect: "4.(285714)"
+}, {
+  label: "-4",
+  set: -4,
+  fn: "neg",
+  param: 0,
+  expect: "4"
+}, {
+  label: "4",
+  set: 4,
+  fn: "neg",
+  param: 0,
+  expect: "-4"
+}, {
+  label: "0",
+  set: 0,
+  fn: "neg",
+  param: 0,
+  expect: "0"
+}, {
+  label: "6869570742453802/5329686054127205",
+  set: "6869570742453802/5329686054127205",
+  fn: "neg",
+  param: 0,
+  expect: "-1.288925965373540"
+}, {
+  label: "686970702/53212205",
+  set: "686970702/53212205",
+  fn: "neg",
+  param: 0,
+  expect: "-12.910021338149772"
+}, {
+  label: "1/3000000000000000",
+  set: "1/3000000000000000",
+  fn: "add",
+  param: 0,
+  expect: "0.000000000000000(3)"
+}, {
+  label: "toString(15) .0000000000000003",
+  set: ".0000000000000003",
+  fn: "toString",
+  param: 15,
+  expect: "0.000000000000000"
+}, {
+  label: "toString(16) .0000000000000003",
+  set: ".0000000000000003",
+  fn: "toString",
+  param: 16,
+  expect: "0.0000000000000003"
+}, {
+  label: "12 / 4.3",
+  set: 12,
+  set2: 4.3,
+  fn: "toString",
+  param: null,
+  expectError: NonIntegerParameter()
+}, {
+  label: "12.5 / 4",
+  set: 12.5,
+  set2: 4,
+  fn: "toString",
+  param: null,
+  expectError: NonIntegerParameter()
+}, {
+  label: "0.9 round to multiple of 1/8",
+  set: .9,
+  fn: "roundTo",
+  param: "1/8",
+  expect: "0.875"
+}, {
+  label: "1/3 round to multiple of 1/16",
+  set: 1 / 3,
+  fn: "roundTo",
+  param: "1/16",
+  expect: "0.3125"
+}, {
+  label: "1/3 round to multiple of 1/16",
+  set: -1 / 3,
+  fn: "roundTo",
+  param: "1/16",
+  expect: "-0.3125"
+}, {
+  label: "1/2 round to multiple of 1/4",
+  set: 1 / 2,
+  fn: "roundTo",
+  param: "1/4",
+  expect: "0.5"
+}, {
+  label: "1/4 round to multiple of 1/2",
+  set: 1 / 4,
+  fn: "roundTo",
+  param: "1/2",
+  expect: "0.5"
+}, {
+  label: "10/3 round to multiple of 1/2",
+  set: "10/3",
+  fn: "roundTo",
+  param: "1/2",
+  expect: "3.5"
+}, {
+  label: "-10/3 round to multiple of 1/2",
+  set: "-10/3",
+  fn: "roundTo",
+  param: "1/2",
+  expect: "-3.5"
+}, {
+  label: "log_2(8)",
+  set: "8",
+  fn: "log",
+  param: "2",
+  expect: "3" // because 2^3 = 8
+}, {
+  label: "log_2(3)",
+  set: "3",
+  fn: "log",
+  param: "2",
+  expect: 'null' // because 2^(p/q) != 3
+}, {
+  label: "log_10(1000)",
+  set: "1000",
+  fn: "log",
+  param: "10",
+  expect: "3" // because 10^3 = 1000
+}, {
+  label: "log_27(81)",
+  set: "81",
+  fn: "log",
+  param: "27",
+  expect: "1.(3)" // because 27^(4/3) = 81
+}, {
+  label: "log_27(9)",
+  set: "9",
+  fn: "log",
+  param: "27",
+  expect: "0.(6)" // because 27^(2/3) = 9
+}, {
+  label: "log_9/4(27/8)",
+  set: "27/8",
+  fn: "log",
+  param: "9/4",
+  expect: "1.5" // because (9/4)^(3/2) = 27/8
+}];
+
+describe('Fraction', function () {
+  for (var i = 0; i < tests.length; i++) {
+
+    (function (i) {
+      var action;
+
+      if (tests[i].fn) {
+        action = function () {
+          var x = Fraction(tests[i].set, tests[i].set2)[tests[i].fn](tests[i].param);
+          if (x === null) return "null";
+          return x.toString();
+        };
+      } else {
+        action = function () {
+          var x = new Fraction(tests[i].set, tests[i].set2);
+          if (x === null) return "null";
+          return x.toString();
+        };
+      }
+
+      it(String(tests[i].label || tests[i].set), function () {
+        if (tests[i].expectError) {
+          assert.throws(action, tests[i].expectError);
+        } else {
+          assert.equal(action(), tests[i].expect);
+        }
+      });
+
+    })(i);
+  }
+});
+
+describe('JSON', function () {
+
+  it("Should be possible to stringify the object", function () {
+
+    if (typeof Fraction(1).n !== 'number') {
+      return;
+    }
+    assert.equal('{"s":1,"n":14623,"d":330}', JSON.stringify(new Fraction("44.3(12)")));
+    assert.equal('{"s":-1,"n":2,"d":1}', JSON.stringify(new Fraction(-1 / 2).inverse()));
+  });
+});
+
+describe('Arguments', function () {
+
+  it("Should be possible to use different kind of params", function () {
+
+    // String
+    var fraction = new Fraction("0.1");
+    assert.equal("1/10", fraction.n + "/" + fraction.d);
+
+    var fraction = new Fraction("6234/6460");
+    assert.equal("3117/3230", fraction.n + "/" + fraction.d);
+
+    // Two params
+    var fraction = new Fraction(1, 2);
+    assert.equal("1/2", fraction.n + "/" + fraction.d);
+
+    // Object
+    var fraction = new Fraction({ n: 1, d: 3 });
+    assert.equal("1/3", fraction.n + "/" + fraction.d);
+
+    // Array
+    var fraction = new Fraction([1, 4]);
+    assert.equal("1/4", fraction.n + "/" + fraction.d);
+  });
+});
+
+describe('fractions', function () {
+
+  it("Should pass 0.08 = 2/25", function () {
+
+    var fraction = new Fraction("0.08");
+    assert.equal("2/25", fraction.n + "/" + fraction.d);
+  });
+
+  it("Should pass 0.200 = 1/5", function () {
+
+    var fraction = new Fraction("0.200");
+    assert.equal("1/5", fraction.n + "/" + fraction.d);
+  });
+
+  it("Should pass 0.125 = 1/8", function () {
+
+    var fraction = new Fraction("0.125");
+    assert.equal("1/8", fraction.n + "/" + fraction.d);
+  });
+
+  it("Should pass 8.36 = 209/25", function () {
+
+    var fraction = new Fraction(8.36);
+    assert.equal("209/25", fraction.n + "/" + fraction.d);
+  });
+
+});
+
+describe('constructors', function () {
+
+  it("Should pass 0.08 = 2/25", function () {
+
+    var tmp = new Fraction({ d: 4, n: 2, s: -1 });
+    assert.equal("-1/2", tmp.s * tmp.n + "/" + tmp.d);
+
+    var tmp = new Fraction(-88.3);
+    assert.equal("-883/10", tmp.s * tmp.n + "/" + tmp.d);
+
+    var tmp = new Fraction(-88.3).clone();
+    assert.equal("-883/10", tmp.s * tmp.n + "/" + tmp.d);
+
+    var tmp = new Fraction("123.'3'");
+    assert.equal("370/3", tmp.s * tmp.n + "/" + tmp.d);
+
+    var tmp = new Fraction("123.'3'").clone();
+    assert.equal("370/3", tmp.s * tmp.n + "/" + tmp.d);
+
+    var tmp = new Fraction([-1023461776, 334639305]);
+    tmp = tmp.add([4, 25]);
+    assert.equal("-4849597436/1673196525", tmp.s * tmp.n + "/" + tmp.d);
+  });
+});
+
+describe('Latex Output', function () {
+
+  it("Should pass 123.'3' = \\frac{370}{3}", function () {
+
+    var tmp = new Fraction("123.'3'");
+    assert.equal("\\frac{370}{3}", tmp.toLatex());
+  });
+
+  it("Should pass 1.'3' = \\frac{4}{3}", function () {
+
+    var tmp = new Fraction("1.'3'");
+    assert.equal("\\frac{4}{3}", tmp.toLatex());
+  });
+
+  it("Should pass -1.0000000000 = -1", function () {
+
+    var tmp = new Fraction("-1.0000000000");
+    assert.equal('-1', tmp.toLatex());
+  });
+
+  it("Should pass -0.0000000000 = 0", function () {
+
+    var tmp = new Fraction("-0.0000000000");
+    assert.equal('0', tmp.toLatex());
+  });
+});
+
+describe('Fraction Output', function () {
+
+  it("Should pass 123.'3' = 123 1/3", function () {
+
+    var tmp = new Fraction("123.'3'");
+    assert.equal('370/3', tmp.toFraction());
+  });
+
+  it("Should pass 1.'3' = 1 1/3", function () {
+
+    var tmp = new Fraction("1.'3'");
+    assert.equal('4/3', tmp.toFraction());
+  });
+
+  it("Should pass -1.0000000000 = -1", function () {
+
+    var tmp = new Fraction("-1.0000000000");
+    assert.equal('-1', tmp.toFraction());
+  });
+
+  it("Should pass -0.0000000000 = 0", function () {
+
+    var tmp = new Fraction("-0.0000000000");
+    assert.equal('0', tmp.toFraction());
+  });
+
+  it("Should pass 1/-99/293 = -1/29007", function () {
+
+    var tmp = new Fraction(-99).inverse().div(293);
+    assert.equal('-1/29007', tmp.toFraction());
+  });
+
+  it('Should work with large calculations', function () {
+    var x = Fraction(1123875);
+    var y = Fraction(1238750184);
+    var z = Fraction(1657134);
+    var r = Fraction(77344464613500, 92063);
+    assert.equal(x.mul(y).div(z).toFraction(), r.toFraction());
+  });
+});
+
+describe('Fraction toContinued', function () {
+
+  it("Should pass 415/93", function () {
+
+    var tmp = new Fraction(415, 93);
+    assert.equal('4,2,6,7', tmp.toContinued().toString());
+  });
+
+  it("Should pass 0/2", function () {
+
+    var tmp = new Fraction(0, 2);
+    assert.equal('0', tmp.toContinued().toString());
+  });
+
+  it("Should pass 1/7", function () {
+
+    var tmp = new Fraction(1, 7);
+    assert.equal('0,7', tmp.toContinued().toString());
+  });
+
+  it("Should pass 23/88", function () {
+
+    var tmp = new Fraction('23/88');
+    assert.equal('0,3,1,4,1,3', tmp.toContinued().toString());
+  });
+
+  it("Should pass 1/99", function () {
+
+    var tmp = new Fraction('1/99');
+    assert.equal('0,99', tmp.toContinued().toString());
+  });
+
+  it("Should pass 1768/99", function () {
+
+    var tmp = new Fraction('1768/99');
+    assert.equal('17,1,6,14', tmp.toContinued().toString());
+  });
+
+  it("Should pass 1768/99", function () {
+
+    var tmp = new Fraction('7/8');
+    assert.equal('0,1,7', tmp.toContinued().toString());
+  });
+
+});
+
+
+describe('Fraction simplify', function () {
+
+  it("Should pass 415/93", function () {
+
+    var tmp = new Fraction(415, 93);
+    assert.equal('9/2', tmp.simplify(0.1).toFraction());
+    assert.equal('58/13', tmp.simplify(0.01).toFraction());
+    assert.equal('415/93', tmp.simplify(0.0001).toFraction());
+  });
+
+});
diff --git a/node_modules/ioredis/LICENSE b/node_modules/ioredis/LICENSE
new file mode 100644
index 0000000..1d4bd28
--- /dev/null
+++ b/node_modules/ioredis/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015-2022 Zihua Li
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/ioredis/README.md b/node_modules/ioredis/README.md
new file mode 100644
index 0000000..cd47b60
--- /dev/null
+++ b/node_modules/ioredis/README.md
@@ -0,0 +1,1540 @@
+[![ioredis](https://cdn.jsdelivr.net/gh/redis/ioredis@b5e8c74/logo.svg)](https://github.com/redis/ioredis)
+
+[![Build Status](https://github.com/redis/ioredis/actions/workflows/release.yml/badge.svg?branch=main)](https://github.com/redis/ioredis/actions/workflows/release.yml?query=branch%3Amain)
+[![Coverage Status](https://coveralls.io/repos/github/luin/ioredis/badge.svg?branch=main)](https://coveralls.io/github/luin/ioredis?branch=main)
+[![Commitizen friendly](https://img.shields.io/badge/commitizen-friendly-brightgreen.svg)](http://commitizen.github.io/cz-cli/)
+[![semantic-release](https://img.shields.io/badge/%20%20%F0%9F%93%A6%F0%9F%9A%80-semantic--release-e10079.svg)](https://github.com/semantic-release/semantic-release)
+
+[![Discord](https://img.shields.io/discord/697882427875393627.svg?style=social&logo=discord)](https://discord.gg/redis)
+[![Twitch](https://img.shields.io/twitch/status/redisinc?style=social)](https://www.twitch.tv/redisinc)
+[![YouTube](https://img.shields.io/youtube/channel/views/UCD78lHSwYqMlyetR0_P4Vig?style=social)](https://www.youtube.com/redisinc)
+[![Twitter](https://img.shields.io/twitter/follow/redisinc?style=social)](https://twitter.com/redisinc)
+
+A robust, performance-focused and full-featured [Redis](http://redis.io) client for [Node.js](https://nodejs.org).
+
+Supports Redis >= 2.6.12. Completely compatible with Redis 7.x.
+
+ioredis is a stable project and maintenance is done on a best-effort basis for relevant issues (contributions to ioredis will still be evaluated, reviewed, and merged when they benefit the project). For new projects, node-redis is the recommended client library. [node-redis](https://github.com/redis/node-redis) is the open-source (MIT license) Redis JavaScript client library redesigned from the ground up and actively maintained. [node-redis](https://github.com/redis/node-redis) supports new (hash-field expiration) and future commands and the capabilities available in Redis Stack and Redis 8 (search, JSON, time-series, probabilistic data structures).
+
+# Features
+
+ioredis is a robust, full-featured Redis client that is
+used in the world's biggest online commerce company [Alibaba](http://www.alibaba.com/) and many other awesome companies.
+
+0. Full-featured. It supports [Cluster](http://redis.io/topics/cluster-tutorial), [Sentinel](https://redis.io/docs/latest/operate/oss_and_stack/management/sentinel/), [Streams](https://redis.io/topics/streams-intro), [Pipelining](http://redis.io/topics/pipelining), and of course [Lua scripting](http://redis.io/commands/eval), [Redis Functions](https://redis.io/topics/functions-intro), [Pub/Sub](http://redis.io/topics/pubsub) (with the support of binary messages).
+1. High performance 🚀.
+2. Delightful API 😄. It works with Node callbacks and Native promises.
+3. Transformation of command arguments and replies.
+4. Transparent key prefixing.
+5. Abstraction for Lua scripting, allowing you to [define custom commands](https://github.com/redis/ioredis#lua-scripting).
+6. Supports [binary data](https://github.com/redis/ioredis#handle-binary-data).
+7. Supports [TLS](https://github.com/redis/ioredis#tls-options) 🔒.
+8. Supports offline queue and ready checking.
+9. Supports ES6 types, such as `Map` and `Set`.
+10. Supports GEO commands 📍.
+11. Supports Redis ACL.
+12. Sophisticated error handling strategy.
+13. Supports NAT mapping.
+14. Supports autopipelining.
+
+**100% written in TypeScript and official declarations are provided:**
+
+<img width="837" src="resources/ts-screenshot.png" alt="TypeScript Screenshot" />
+
+# Versions
+
+| Version        | Branch | Node.js Version | Redis Version   |
+| -------------- | ------ | --------------- | --------------- |
+| 5.x.x (latest) | main   | >= 12           | 2.6.12 ~ latest |
+| 4.x.x          | v4     | >= 8            | 2.6.12 ~ 7      |
+
+Refer to [CHANGELOG.md](CHANGELOG.md) for features and bug fixes introduced in v5.
+
+🚀 [Upgrading from v4 to v5](https://github.com/redis/ioredis/wiki/Upgrading-from-v4-to-v5)
+
+# Links
+
+- [API Documentation](https://redis.github.io/ioredis/) ([Redis](https://redis.github.io/ioredis/classes/Redis.html), [Cluster](https://redis.github.io/ioredis/classes/Cluster.html))
+- [Changelog](CHANGELOG.md)
+
+<hr>
+
+# Quick Start
+
+## Install
+
+```shell
+npm install ioredis
+```
+
+In a TypeScript project, you may want to add TypeScript declarations for Node.js:
+
+```shell
+npm install --save-dev @types/node
+```
+
+## Basic Usage
+
+```javascript
+// Import ioredis.
+// You can also use `import { Redis } from "ioredis"`
+// if your project is a TypeScript project,
+// Note that `import Redis from "ioredis"` is still supported,
+// but will be deprecated in the next major version.
+const Redis = require("ioredis");
+
+// Create a Redis instance.
+// By default, it will connect to localhost:6379.
+// We are going to cover how to specify connection options soon.
+const redis = new Redis();
+
+redis.set("mykey", "value"); // Returns a promise which resolves to "OK" when the command succeeds.
+
+// ioredis supports the node.js callback style
+redis.get("mykey", (err, result) => {
+  if (err) {
+    console.error(err);
+  } else {
+    console.log(result); // Prints "value"
+  }
+});
+
+// Or ioredis returns a promise if the last argument isn't a function
+redis.get("mykey").then((result) => {
+  console.log(result); // Prints "value"
+});
+
+redis.zadd("sortedSet", 1, "one", 2, "dos", 4, "quatro", 3, "three");
+redis.zrange("sortedSet", 0, 2, "WITHSCORES").then((elements) => {
+  // ["one", "1", "dos", "2", "three", "3"] as if the command was `redis> ZRANGE sortedSet 0 2 WITHSCORES`
+  console.log(elements);
+});
+
+// All arguments are passed directly to the redis server,
+// so technically ioredis supports all Redis commands.
+// The format is: redis[SOME_REDIS_COMMAND_IN_LOWERCASE](ARGUMENTS_ARE_JOINED_INTO_COMMAND_STRING)
+// so the following statement is equivalent to the CLI: `redis> SET mykey hello EX 10`
+redis.set("mykey", "hello", "EX", 10);
+```
+
+See the `examples/` folder for more examples. For example:
+
+- [TTL](examples/ttl.js)
+- [Strings](examples/string.js)
+- [Hashes](examples/hash.js)
+- [Lists](examples/list.js)
+- [Sets](examples/set.js)
+- [Sorted Sets](examples/zset.js)
+- [Streams](examples/stream.js)
+- [Redis Modules](examples/module.js) e.g. RedisJSON
+
+All Redis commands are supported. See [the documentation](https://redis.github.io/ioredis/classes/Redis.html) for details.
+
+## Connect to Redis
+
+When a new `Redis` instance is created,
+a connection to Redis will be created at the same time.
+You can specify which Redis to connect to by:
+
+```javascript
+new Redis(); // Connect to 127.0.0.1:6379
+new Redis(6380); // 127.0.0.1:6380
+new Redis(6379, "192.168.1.1"); // 192.168.1.1:6379
+new Redis("/tmp/redis.sock");
+new Redis({
+  port: 6379, // Redis port
+  host: "127.0.0.1", // Redis host
+  username: "default", // needs Redis >= 6
+  password: "my-top-secret",
+  db: 0, // Defaults to 0
+});
+```
+
+You can also specify connection options as a [`redis://` URL](http://www.iana.org/assignments/uri-schemes/prov/redis) or [`rediss://` URL](https://www.iana.org/assignments/uri-schemes/prov/rediss) when using [TLS encryption](#tls-options):
+
+```javascript
+// Connect to 127.0.0.1:6380, db 4, using password "authpassword":
+new Redis("redis://:authpassword@127.0.0.1:6380/4");
+
+// Username can also be passed via URI.
+new Redis("redis://username:authpassword@127.0.0.1:6380/4");
+```
+
+See [API Documentation](https://redis.github.io/ioredis/index.html#RedisOptions) for all available options.
+
+## Pub/Sub
+
+Redis provides several commands for developers to implement the [Publish–subscribe pattern](https://en.wikipedia.org/wiki/Publish%E2%80%93subscribe_pattern). There are two roles in this pattern: publisher and subscriber. Publishers are not programmed to send their messages to specific subscribers. Rather, published messages are characterized into channels, without knowledge of what (if any) subscribers there may be.
+
+By leveraging Node.js's built-in events module, ioredis makes pub/sub very straightforward to use. Below is a simple example that consists of two files, one is publisher.js that publishes messages to a channel, the other is subscriber.js that listens for messages on specific channels.
+
+```javascript
+// publisher.js
+
+const Redis = require("ioredis");
+const redis = new Redis();
+
+setInterval(() => {
+  const message = { foo: Math.random() };
+  // Publish to my-channel-1 or my-channel-2 randomly.
+  const channel = `my-channel-${1 + Math.round(Math.random())}`;
+
+  // Message can be either a string or a buffer
+  redis.publish(channel, JSON.stringify(message));
+  console.log("Published %s to %s", message, channel);
+}, 1000);
+```
+
+```javascript
+// subscriber.js
+
+const Redis = require("ioredis");
+const redis = new Redis();
+
+redis.subscribe("my-channel-1", "my-channel-2", (err, count) => {
+  if (err) {
+    // Just like other commands, subscribe() can fail for some reasons,
+    // ex network issues.
+    console.error("Failed to subscribe: %s", err.message);
+  } else {
+    // `count` represents the number of channels this client are currently subscribed to.
+    console.log(
+      `Subscribed successfully! This client is currently subscribed to ${count} channels.`
+    );
+  }
+});
+
+redis.on("message", (channel, message) => {
+  console.log(`Received ${message} from ${channel}`);
+});
+
+// There's also an event called 'messageBuffer', which is the same as 'message' except
+// it returns buffers instead of strings.
+// It's useful when the messages are binary data.
+redis.on("messageBuffer", (channel, message) => {
+  // Both `channel` and `message` are buffers.
+  console.log(channel, message);
+});
+```
+
+It's worth noticing that a connection (aka a `Redis` instance) can't play both roles at the same time. More specifically, when a client issues `subscribe()` or `psubscribe()`, it enters the "subscriber" mode. From that point, only commands that modify the subscription set are valid. Namely, they are: `subscribe`, `psubscribe`, `unsubscribe`, `punsubscribe`, `ping`, and `quit`. When the subscription set is empty (via `unsubscribe`/`punsubscribe`), the connection is put back into the regular mode.
+
+If you want to do pub/sub in the same file/process, you should create a separate connection:
+
+```javascript
+const Redis = require("ioredis");
+const sub = new Redis();
+const pub = new Redis();
+
+sub.subscribe(/* ... */); // From now, `sub` enters the subscriber mode.
+sub.on("message" /* ... */);
+
+setInterval(() => {
+  // `pub` can be used to publish messages, or send other regular commands (e.g. `hgetall`)
+  // because it's not in the subscriber mode.
+  pub.publish(/* ... */);
+}, 1000);
+```
+
+`PSUBSCRIBE` is also supported in a similar way when you want to subscribe all channels whose name matches a pattern:
+
+```javascript
+redis.psubscribe("pat?ern", (err, count) => {});
+
+// Event names are "pmessage"/"pmessageBuffer" instead of "message/messageBuffer".
+redis.on("pmessage", (pattern, channel, message) => {});
+redis.on("pmessageBuffer", (pattern, channel, message) => {});
+```
+
+## Streams
+
+Redis v5 introduces a new data type called streams. It doubles as a communication channel for building streaming architectures and as a log-like data structure for persisting data. With ioredis, the usage can be pretty straightforward. Say we have a producer publishes messages to a stream with `redis.xadd("mystream", "*", "randomValue", Math.random())` (You may find the [official documentation of Streams](https://redis.io/topics/streams-intro) as a starter to understand the parameters used), to consume the messages, we'll have a consumer with the following code:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis();
+
+const processMessage = (message) => {
+  console.log("Id: %s. Data: %O", message[0], message[1]);
+};
+
+async function listenForMessage(lastId = "$") {
+  // `results` is an array, each element of which corresponds to a key.
+  // Because we only listen to one key (mystream) here, `results` only contains
+  // a single element. See more: https://redis.io/commands/xread#return-value
+  const results = await redis.xread("BLOCK", 0, "STREAMS", "mystream", lastId);
+  const [key, messages] = results[0]; // `key` equals to "mystream"
+
+  messages.forEach(processMessage);
+
+  // Pass the last id of the results to the next round.
+  await listenForMessage(messages[messages.length - 1][0]);
+}
+
+listenForMessage();
+```
+
+## Expiration
+
+Redis can set a timeout to expire your key, after the timeout has expired the key will be automatically deleted. (You can find the [official Expire documentation](https://redis.io/commands/expire/) to understand better the different parameters you can use), to set your key to expire in 60 seconds, we will have the following code:
+
+```javascript
+redis.set("key", "data", "EX", 60);
+// Equivalent to redis command "SET key data EX 60", because on ioredis set method,
+// all arguments are passed directly to the redis server.
+```
+
+## Handle Binary Data
+
+Binary data support is out of the box. Pass buffers to send binary data:
+
+```javascript
+redis.set("foo", Buffer.from([0x62, 0x75, 0x66]));
+```
+
+Every command that returns a [bulk string](https://redis.io/docs/reference/protocol-spec/#resp-bulk-strings)
+has a variant command with a `Buffer` suffix. The variant command returns a buffer instead of a UTF-8 string:
+
+```javascript
+const result = await redis.getBuffer("foo");
+// result is `<Buffer 62 75 66>`
+```
+
+It's worth noticing that you don't need the `Buffer` suffix variant in order to **send** binary data. That means
+in most case you should just use `redis.set()` instead of `redis.setBuffer()` unless you want to get the old value
+with the `GET` parameter:
+
+```javascript
+const result = await redis.setBuffer("foo", "new value", "GET");
+// result is `<Buffer 62 75 66>` as `GET` indicates returning the old value.
+```
+
+## Pipelining
+
+If you want to send a batch of commands (e.g. > 5), you can use pipelining to queue
+the commands in memory and then send them to Redis all at once. This way the performance improves by 50%~300% (See [benchmark section](#benchmarks)).
+
+`redis.pipeline()` creates a `Pipeline` instance. You can call any Redis
+commands on it just like the `Redis` instance. The commands are queued in memory
+and flushed to Redis by calling the `exec` method:
+
+```javascript
+const pipeline = redis.pipeline();
+pipeline.set("foo", "bar");
+pipeline.del("cc");
+pipeline.exec((err, results) => {
+  // `err` is always null, and `results` is an array of responses
+  // corresponding to the sequence of queued commands.
+  // Each response follows the format `[err, result]`.
+});
+
+// You can even chain the commands:
+redis
+  .pipeline()
+  .set("foo", "bar")
+  .del("cc")
+  .exec((err, results) => {});
+
+// `exec` also returns a Promise:
+const promise = redis.pipeline().set("foo", "bar").get("foo").exec();
+promise.then((result) => {
+  // result === [[null, 'OK'], [null, 'bar']]
+});
+```
+
+Each chained command can also have a callback, which will be invoked when the command
+gets a reply:
+
+```javascript
+redis
+  .pipeline()
+  .set("foo", "bar")
+  .get("foo", (err, result) => {
+    // result === 'bar'
+  })
+  .exec((err, result) => {
+    // result[1][1] === 'bar'
+  });
+```
+
+In addition to adding commands to the `pipeline` queue individually, you can also pass an array of commands and arguments to the constructor:
+
+```javascript
+redis
+  .pipeline([
+    ["set", "foo", "bar"],
+    ["get", "foo"],
+  ])
+  .exec(() => {
+    /* ... */
+  });
+```
+
+`#length` property shows how many commands in the pipeline:
+
+```javascript
+const length = redis.pipeline().set("foo", "bar").get("foo").length;
+// length === 2
+```
+
+## Transaction
+
+Most of the time, the transaction commands `multi` & `exec` are used together with pipeline.
+Therefore, when `multi` is called, a `Pipeline` instance is created automatically by default,
+so you can use `multi` just like `pipeline`:
+
+```javascript
+redis
+  .multi()
+  .set("foo", "bar")
+  .get("foo")
+  .exec((err, results) => {
+    // results === [[null, 'OK'], [null, 'bar']]
+  });
+```
+
+If there's a syntax error in the transaction's command chain (e.g. wrong number of arguments, wrong command name, etc),
+then none of the commands would be executed, and an error is returned:
+
+```javascript
+redis
+  .multi()
+  .set("foo")
+  .set("foo", "new value")
+  .exec((err, results) => {
+    // err:
+    //  { [ReplyError: EXECABORT Transaction discarded because of previous errors.]
+    //    name: 'ReplyError',
+    //    message: 'EXECABORT Transaction discarded because of previous errors.',
+    //    command: { name: 'exec', args: [] },
+    //    previousErrors:
+    //     [ { [ReplyError: ERR wrong number of arguments for 'set' command]
+    //         name: 'ReplyError',
+    //         message: 'ERR wrong number of arguments for \'set\' command',
+    //         command: [Object] } ] }
+  });
+```
+
+In terms of the interface, `multi` differs from `pipeline` in that when specifying a callback
+to each chained command, the queueing state is passed to the callback instead of the result of the command:
+
+```javascript
+redis
+  .multi()
+  .set("foo", "bar", (err, result) => {
+    // result === 'QUEUED'
+  })
+  .exec(/* ... */);
+```
+
+If you want to use transaction without pipeline, pass `{ pipeline: false }` to `multi`,
+and every command will be sent to Redis immediately without waiting for an `exec` invocation:
+
+```javascript
+redis.multi({ pipeline: false });
+redis.set("foo", "bar");
+redis.get("foo");
+redis.exec((err, result) => {
+  // result === [[null, 'OK'], [null, 'bar']]
+});
+```
+
+The constructor of `multi` also accepts a batch of commands:
+
+```javascript
+redis
+  .multi([
+    ["set", "foo", "bar"],
+    ["get", "foo"],
+  ])
+  .exec(() => {
+    /* ... */
+  });
+```
+
+Inline transactions are supported by pipeline, which means you can group a subset of commands
+in the pipeline into a transaction:
+
+```javascript
+redis
+  .pipeline()
+  .get("foo")
+  .multi()
+  .set("foo", "bar")
+  .get("foo")
+  .exec()
+  .get("foo")
+  .exec();
+```
+
+## Lua Scripting
+
+ioredis supports all of the scripting commands such as `EVAL`, `EVALSHA` and `SCRIPT`.
+However, it's tedious to use in real world scenarios since developers have to take
+care of script caching and to detect when to use `EVAL` and when to use `EVALSHA`.
+ioredis exposes a `defineCommand` method to make scripting much easier to use:
+
+```javascript
+const redis = new Redis();
+
+// This will define a command myecho:
+redis.defineCommand("myecho", {
+  numberOfKeys: 2,
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Now `myecho` can be used just like any other ordinary command,
+// and ioredis will try to use `EVALSHA` internally when possible for better performance.
+redis.myecho("k1", "k2", "a1", "a2", (err, result) => {
+  // result === ['k1', 'k2', 'a1', 'a2']
+});
+
+// `myechoBuffer` is also defined automatically to return buffers instead of strings:
+redis.myechoBuffer("k1", "k2", "a1", "a2", (err, result) => {
+  // result[0] equals to Buffer.from('k1');
+});
+
+// And of course it works with pipeline:
+redis.pipeline().set("foo", "bar").myecho("k1", "k2", "a1", "a2").exec();
+```
+
+### Dynamic Keys
+
+If the number of keys can't be determined when defining a command, you can
+omit the `numberOfKeys` property and pass the number of keys as the first argument
+when you call the command:
+
+```javascript
+redis.defineCommand("echoDynamicKeyNumber", {
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Now you have to pass the number of keys as the first argument every time
+// you invoke the `echoDynamicKeyNumber` command:
+redis.echoDynamicKeyNumber(2, "k1", "k2", "a1", "a2", (err, result) => {
+  // result === ['k1', 'k2', 'a1', 'a2']
+});
+```
+
+### As Constructor Options
+
+Besides `defineCommand()`, you can also define custom commands with the `scripts` constructor option:
+
+```javascript
+const redis = new Redis({
+  scripts: {
+    myecho: {
+      numberOfKeys: 2,
+      lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+    },
+  },
+});
+```
+
+### TypeScript Usages
+
+You can refer to [the example](examples/typescript/scripts.ts) for how to declare your custom commands.
+
+## Transparent Key Prefixing
+
+This feature allows you to specify a string that will automatically be prepended
+to all the keys in a command, which makes it easier to manage your key
+namespaces.
+
+**Warning** This feature won't apply to commands like [KEYS](http://redis.io/commands/KEYS) and [SCAN](http://redis.io/commands/scan) that take patterns rather than actual keys([#239](https://github.com/redis/ioredis/issues/239)),
+and this feature also won't apply to the replies of commands even if they are key names ([#325](https://github.com/redis/ioredis/issues/325)).
+
+```javascript
+const fooRedis = new Redis({ keyPrefix: "foo:" });
+fooRedis.set("bar", "baz"); // Actually sends SET foo:bar baz
+
+fooRedis.defineCommand("myecho", {
+  numberOfKeys: 2,
+  lua: "return {KEYS[1],KEYS[2],ARGV[1],ARGV[2]}",
+});
+
+// Works well with pipelining/transaction
+fooRedis
+  .pipeline()
+  // Sends SORT foo:list BY foo:weight_*->fieldname
+  .sort("list", "BY", "weight_*->fieldname")
+  // Supports custom commands
+  // Sends EVALSHA xxx foo:k1 foo:k2 a1 a2
+  .myecho("k1", "k2", "a1", "a2")
+  .exec();
+```
+
+## Transforming Arguments & Replies
+
+Most Redis commands take one or more Strings as arguments,
+and replies are sent back as a single String or an Array of Strings. However, sometimes
+you may want something different. For instance, it would be more convenient if the `HGETALL`
+command returns a hash (e.g. `{ key: val1, key2: v2 }`) rather than an array of key values (e.g. `[key1, val1, key2, val2]`).
+
+ioredis has a flexible system for transforming arguments and replies. There are two types
+of transformers, argument transformer and reply transformer:
+
+```javascript
+const Redis = require("ioredis");
+
+// Here's the built-in argument transformer converting
+// hmset('key', { k1: 'v1', k2: 'v2' })
+// or
+// hmset('key', new Map([['k1', 'v1'], ['k2', 'v2']]))
+// into
+// hmset('key', 'k1', 'v1', 'k2', 'v2')
+Redis.Command.setArgumentTransformer("hmset", (args) => {
+  if (args.length === 2) {
+    if (args[1] instanceof Map) {
+      // utils is a internal module of ioredis
+      return [args[0], ...utils.convertMapToArray(args[1])];
+    }
+    if (typeof args[1] === "object" && args[1] !== null) {
+      return [args[0], ...utils.convertObjectToArray(args[1])];
+    }
+  }
+  return args;
+});
+
+// Here's the built-in reply transformer converting the HGETALL reply
+// ['k1', 'v1', 'k2', 'v2']
+// into
+// { k1: 'v1', 'k2': 'v2' }
+Redis.Command.setReplyTransformer("hgetall", (result) => {
+  if (Array.isArray(result)) {
+    const obj = {};
+    for (let i = 0; i < result.length; i += 2) {
+      obj[result[i]] = result[i + 1];
+    }
+    return obj;
+  }
+  return result;
+});
+```
+
+There are three built-in transformers, two argument transformers for `hmset` & `mset` and
+a reply transformer for `hgetall`. Transformers for `hmset` and `hgetall` were mentioned
+above, and the transformer for `mset` is similar to the one for `hmset`:
+
+```javascript
+redis.mset({ k1: "v1", k2: "v2" });
+redis.get("k1", (err, result) => {
+  // result === 'v1';
+});
+
+redis.mset(
+  new Map([
+    ["k3", "v3"],
+    ["k4", "v4"],
+  ])
+);
+redis.get("k3", (err, result) => {
+  // result === 'v3';
+});
+```
+
+Another useful example of a reply transformer is one that changes `hgetall` to return array of arrays instead of objects which avoids an unwanted conversation of hash keys to strings when dealing with binary hash keys:
+
+```javascript
+Redis.Command.setReplyTransformer("hgetall", (result) => {
+  const arr = [];
+  for (let i = 0; i < result.length; i += 2) {
+    arr.push([result[i], result[i + 1]]);
+  }
+  return arr;
+});
+redis.hset("h1", Buffer.from([0x01]), Buffer.from([0x02]));
+redis.hset("h1", Buffer.from([0x03]), Buffer.from([0x04]));
+redis.hgetallBuffer("h1", (err, result) => {
+  // result === [ [ <Buffer 01>, <Buffer 02> ], [ <Buffer 03>, <Buffer 04> ] ];
+});
+```
+
+## Monitor
+
+Redis supports the MONITOR command,
+which lets you see all commands received by the Redis server across all client connections,
+including from other client libraries and other computers.
+
+The `monitor` method returns a monitor instance.
+After you send the MONITOR command, no other commands are valid on that connection. ioredis will emit a monitor event for every new monitor message that comes across.
+The callback for the monitor event takes a timestamp from the Redis server and an array of command arguments.
+
+Here is a simple example:
+
+```javascript
+redis.monitor((err, monitor) => {
+  monitor.on("monitor", (time, args, source, database) => {});
+});
+```
+
+Here is another example illustrating an `async` function and `monitor.disconnect()`:
+
+```javascript
+async () => {
+  const monitor = await redis.monitor();
+  monitor.on("monitor", console.log);
+  // Any other tasks
+  monitor.disconnect();
+};
+```
+
+## Streamify Scanning
+
+Redis 2.8 added the `SCAN` command to incrementally iterate through the keys in the database. It's different from `KEYS` in that
+`SCAN` only returns a small number of elements each call, so it can be used in production without the downside
+of blocking the server for a long time. However, it requires recording the cursor on the client side each time
+the `SCAN` command is called in order to iterate through all the keys correctly. Since it's a relatively common use case, ioredis
+provides a streaming interface for the `SCAN` command to make things much easier. A readable stream can be created by calling `scanStream`:
+
+```javascript
+const redis = new Redis();
+// Create a readable stream (object mode)
+const stream = redis.scanStream();
+stream.on("data", (resultKeys) => {
+  // `resultKeys` is an array of strings representing key names.
+  // Note that resultKeys may contain 0 keys, and that it will sometimes
+  // contain duplicates due to SCAN's implementation in Redis.
+  for (let i = 0; i < resultKeys.length; i++) {
+    console.log(resultKeys[i]);
+  }
+});
+stream.on("end", () => {
+  console.log("all keys have been visited");
+});
+```
+
+`scanStream` accepts an option, with which you can specify the `MATCH` pattern, the `TYPE` filter, and the `COUNT` argument:
+
+```javascript
+const stream = redis.scanStream({
+  // only returns keys following the pattern of `user:*`
+  match: "user:*",
+  // only return objects that match a given type,
+  // (requires Redis >= 6.0)
+  type: "zset",
+  // returns approximately 100 elements per call
+  count: 100,
+});
+```
+
+Just like other commands, `scanStream` has a binary version `scanBufferStream`, which returns an array of buffers. It's useful when
+the key names are not utf8 strings.
+
+There are also `hscanStream`, `zscanStream` and `sscanStream` to iterate through elements in a hash, zset and set. The interface of each is
+similar to `scanStream` except the first argument is the key name:
+
+```javascript
+const stream = redis.zscanStream("myhash", {
+  match: "age:??",
+});
+```
+
+The `hscanStream` also accepts the `noValues` option to specify whether Redis should return only the keys in the hash table without their corresponding values.
+
+```javascript
+const stream = redis.hscanStream("myhash", {
+  match: "age:??",
+  noValues: true,
+});
+```
+
+You can learn more from the [Redis documentation](http://redis.io/commands/scan).
+
+**Useful Tips**
+It's pretty common that doing an async task in the `data` handler. We'd like the scanning process to be paused until the async task to be finished. `Stream#pause()` and `Stream#resume()` do the trick. For example if we want to migrate data in Redis to MySQL:
+
+```javascript
+const stream = redis.scanStream();
+stream.on("data", (resultKeys) => {
+  // Pause the stream from scanning more keys until we've migrated the current keys.
+  stream.pause();
+
+  Promise.all(resultKeys.map(migrateKeyToMySQL)).then(() => {
+    // Resume the stream here.
+    stream.resume();
+  });
+});
+
+stream.on("end", () => {
+  console.log("done migration");
+});
+```
+
+## Auto-reconnect
+
+By default, ioredis will try to reconnect when the connection to Redis is lost
+except when the connection is closed manually by `redis.disconnect()` or `redis.quit()`.
+
+It's very flexible to control how long to wait to reconnect after disconnection
+using the `retryStrategy` option:
+
+```javascript
+const redis = new Redis({
+  // This is the default value of `retryStrategy`
+  retryStrategy(times) {
+    const delay = Math.min(times * 50, 2000);
+    return delay;
+  },
+});
+```
+
+`retryStrategy` is a function that will be called when the connection is lost.
+The argument `times` means this is the nth reconnection being made and
+the return value represents how long (in ms) to wait to reconnect. When the
+return value isn't a number, ioredis will stop trying to reconnect, and the connection
+will be lost forever if the user doesn't call `redis.connect()` manually.
+
+When reconnected, the client will auto subscribe to channels that the previous connection subscribed to.
+This behavior can be disabled by setting the `autoResubscribe` option to `false`.
+
+And if the previous connection has some unfulfilled commands (most likely blocking commands such as `brpop` and `blpop`),
+the client will resend them when reconnected. This behavior can be disabled by setting the `autoResendUnfulfilledCommands` option to `false`.
+
+By default, all pending commands will be flushed with an error every 20 retry attempts. That makes sure commands won't wait forever when the connection is down. You can change this behavior by setting `maxRetriesPerRequest`:
+
+```javascript
+const redis = new Redis({
+  maxRetriesPerRequest: 1,
+});
+```
+
+Set maxRetriesPerRequest to `null` to disable this behavior, and every command will wait forever until the connection is alive again (which is the default behavior before ioredis v4).
+
+### Blocking Command Timeout
+
+ioredis can apply a client-side timeout to blocking commands (such as `blpop`, `brpop`, `bzpopmin`, `bzmpop`, `blmpop`, `xread`, `xreadgroup`, etc.). This protects against scenarios where the TCP connection becomes a zombie (e.g., due to a silent network failure like a Docker network disconnect) and Redis never replies.
+
+This feature is **opt-in**. It is **disabled by default** and is only enabled
+when `blockingTimeout` is set to a positive number of milliseconds. If
+`blockingTimeout` is omitted, `0`, or negative (for example `-1`), ioredis
+does not arm any client-side timeouts for blocking commands and their
+behavior matches Redis exactly.
+
+```javascript
+const redis = new Redis({
+  blockingTimeout: 30000, // Enable blocking timeout protection
+});
+```
+
+When enabled:
+
+- For commands with a finite timeout (e.g., `blpop("key", 5)`), ioredis sets a client-side deadline based on the command's timeout plus a small grace period (`blockingTimeoutGrace`, default 100ms). If no reply arrives before the deadline, the command resolves with `null`—the same value Redis returns when a blocking command times out normally.
+- For commands that block forever (e.g., `timeout = 0` or `BLOCK 0`), the `blockingTimeout` value is used as a safety net.
+
+### Reconnect on Error
+
+Besides auto-reconnect when the connection is closed, ioredis supports reconnecting on certain Redis errors using the `reconnectOnError` option. Here's an example that will reconnect when receiving `READONLY` error:
+
+```javascript
+const redis = new Redis({
+  reconnectOnError(err) {
+    const targetError = "READONLY";
+    if (err.message.includes(targetError)) {
+      // Only reconnect when the error contains "READONLY"
+      return true; // or `return 1;`
+    }
+  },
+});
+```
+
+This feature is useful when using Amazon ElastiCache instances with Auto-failover disabled. On these instances, test your `reconnectOnError` handler by manually promoting the replica node to the primary role using the AWS console. The following writes fail with the error `READONLY`. Using `reconnectOnError`, we can force the connection to reconnect on this error in order to connect to the new master. Furthermore, if the `reconnectOnError` returns `2`, ioredis will resend the failed command after reconnecting.
+
+On ElastiCache instances with Auto-failover enabled, `reconnectOnError` does not execute. Instead of returning a Redis error, AWS closes all connections to the master endpoint until the new primary node is ready. ioredis reconnects via `retryStrategy` instead of `reconnectOnError` after about a minute. On ElastiCache instances with Auto-failover enabled, test failover events with the `Failover primary` option in the AWS console.
+
+## Connection Events
+
+The Redis instance will emit some events about the state of the connection to the Redis server.
+
+| Event        | Description                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              |
+| :----------- | :------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| connect      | emits when a connection is established to the Redis server.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              |
+| ready        | If `enableReadyCheck` is `true`, client will emit `ready` when the server reports that it is ready to receive commands (e.g. finish loading data from disk).<br>Otherwise, `ready` will be emitted immediately right after the `connect` event.                                                                                                                                                                                                                                                                                                          |
+| error        | emits when an error occurs while connecting.<br>However, ioredis emits all `error` events silently (only emits when there's at least one listener) so that your application won't crash if you're not listening to the `error` event.<br>When `redis.connect()` is explicitly called the error will also be rejected from the returned promise, in addition to emitting it. If `redis.connect()` is not called explicitly and `lazyConnect` is true, ioredis will try to connect automatically on the first command and emit the `error` event silently. |
+| close        | emits when an established Redis server connection has closed.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            |
+| reconnecting | emits after `close` when a reconnection will be made. The argument of the event is the time (in ms) before reconnecting.                                                                                                                                                                                                                                                                                                                                                                                                                                 |
+| end          | emits after `close` when no more reconnections will be made, or the connection is failed to establish.                                                                                                                                                                                                                                                                                                                                                                                                                                                   |
+| wait         | emits when `lazyConnect` is set and will wait for the first command to be called before connecting.                                                                                                                                                                                                                                                                                                                                                                                                                                                      |
+
+You can also check out the `Redis#status` property to get the current connection status.
+
+Besides the above connection events, there are several other custom events:
+
+| Event  | Description                                                         |
+| :----- | :------------------------------------------------------------------ |
+| select | emits when the database changed. The argument is the new db number. |
+
+## Diagnostics Channel
+
+ioredis publishes telemetry through Node.js [`diagnostics_channel`](https://nodejs.org/api/diagnostics_channel.html), allowing APM tools and custom instrumentation to observe commands, connections, and batch operations without modifying application code.
+
+These channels use `TracingChannel#tracePromise()` and emit `start`, `end`, `asyncStart`, `asyncEnd`, and `error` sub-events. Requires Node.js >= 18.19.0; on older versions the channels are silently unavailable (zero overhead). Subscribe via `tracing:<name>:<event>`:
+
+```typescript
+import dc from "node:diagnostics_channel";
+
+dc.subscribe("tracing:ioredis:command:start", ({ command, args }) => {
+  console.log(`> ${command}`, args);
+});
+
+dc.subscribe("tracing:ioredis:command:asyncEnd", ({ command }) => {
+  console.log(`${command} settled`);
+});
+
+dc.subscribe("tracing:ioredis:command:error", ({ command, error }) => {
+  console.error(`${command} failed:`, error);
+});
+```
+
+| Channel name      | Payload                 | Description                                              |
+| :---------------- | :---------------------- | :------------------------------------------------------- |
+| `ioredis:command` | `CommandTraceContext`   | Individual command (standalone, pipeline, or within MULTI) |
+| `ioredis:batch`   | `BatchOperationContext` | MULTI transaction as a whole                             |
+| `ioredis:connect` | `ConnectTraceContext`   | Socket connection attempt                                |
+
+Command arguments are sanitized before emission using rules adapted from `@opentelemetry/redis-common`. Sensitive values (e.g. values in `SET`, `AUTH` passwords) are replaced with `?`, while read-only commands like `GET` and `DEL` retain all arguments. This is safe by default: unlisted or custom commands have all arguments redacted.
+
+Context types (`CommandTraceContext`, `BatchOperationContext`, `ConnectTraceContext`) are exported from `ioredis`.
+
+## Offline Queue
+
+When a command can't be processed by Redis (being sent before the `ready` event), by default, it's added to the offline queue and will be
+executed when it can be processed. You can disable this feature by setting the `enableOfflineQueue`
+option to `false`:
+
+```javascript
+const redis = new Redis({ enableOfflineQueue: false });
+```
+
+## TLS Options
+
+Redis doesn't support TLS natively, however if the redis server you want to connect to is hosted behind a TLS proxy (e.g. [stunnel](https://www.stunnel.org/)) or is offered by a PaaS service that supports TLS connection (e.g. [Redis.com](https://redis.com/)), you can set the `tls` option:
+
+```javascript
+const redis = new Redis({
+  host: "localhost",
+  tls: {
+    // Refer to `tls.connect()` section in
+    // https://nodejs.org/api/tls.html
+    // for all supported options
+    ca: fs.readFileSync("cert.pem"),
+  },
+});
+```
+
+Alternatively, specify the connection through a [`rediss://` URL](https://www.iana.org/assignments/uri-schemes/prov/rediss).
+
+```javascript
+const redis = new Redis("rediss://redis.my-service.com");
+```
+
+If you do not want to use a connection string, you can also specify an empty `tls: {}` object:
+
+```javascript
+const redis = new Redis({
+  host: "redis.my-service.com",
+  tls: {},
+});
+```
+
+### TLS Profiles
+
+> **Warning**
+> TLS profiles described in this section are going to be deprecated in the next major version. Please provide TLS options explicitly.
+
+To make it easier to configure we provide a few pre-configured TLS profiles that can be specified by setting the `tls` option to the profile's name or specifying a `tls.profile` option in case you need to customize some values of the profile.
+
+Profiles:
+
+- `RedisCloudFixed`: Contains the CA for [Redis.com](https://redis.com/) Cloud fixed subscriptions
+- `RedisCloudFlexible`: Contains the CA for [Redis.com](https://redis.com/) Cloud flexible subscriptions
+
+```javascript
+const redis = new Redis({
+  host: "localhost",
+  tls: "RedisCloudFixed",
+});
+
+const redisWithClientCertificate = new Redis({
+  host: "localhost",
+  tls: {
+    profile: "RedisCloudFixed",
+    key: "123",
+  },
+});
+```
+
+<hr>
+
+## Sentinel
+
+ioredis supports Sentinel out of the box. It works transparently as all features that work when
+you connect to a single node also work when you connect to a sentinel group. Make sure to run Redis >= 2.8.12 if you want to use this feature. Sentinels have a default port of 26379.
+
+To connect using Sentinel, use:
+
+```javascript
+const redis = new Redis({
+  sentinels: [
+    { host: "localhost", port: 26379 },
+    { host: "localhost", port: 26380 },
+  ],
+  name: "mymaster",
+});
+
+redis.set("foo", "bar");
+```
+
+The arguments passed to the constructor are different from the ones you use to connect to a single node, where:
+
+- `name` identifies a group of Redis instances composed of a master and one or more slaves (`mymaster` in the example);
+- `sentinelPassword` (optional) password for Sentinel instances.
+- `sentinels` are a list of sentinels to connect to. The list does not need to enumerate all your sentinel instances, but a few so that if one is down the client will try the next one.
+- `role` (optional) with a value of `slave` will return a random slave from the Sentinel group.
+- `preferredSlaves` (optional) can be used to prefer a particular slave or set of slaves based on priority. It accepts a function or array.
+- `enableTLSForSentinelMode` (optional) set to true if connecting to sentinel instances that are encrypted
+
+ioredis **guarantees** that the node you connected to is always a master even after a failover. When a failover happens, instead of trying to reconnect to the failed node (which will be demoted to slave when it's available again), ioredis will ask sentinels for the new master node and connect to it. All commands sent during the failover are queued and will be executed when the new connection is established so that none of the commands will be lost.
+
+It's possible to connect to a slave instead of a master by specifying the option `role` with the value of `slave` and ioredis will try to connect to a random slave of the specified master, with the guarantee that the connected node is always a slave. If the current node is promoted to master due to a failover, ioredis will disconnect from it and ask the sentinels for another slave node to connect to.
+
+If you specify the option `preferredSlaves` along with `role: 'slave'` ioredis will attempt to use this value when selecting the slave from the pool of available slaves. The value of `preferredSlaves` should either be a function that accepts an array of available slaves and returns a single result, or an array of slave values priorities by the lowest `prio` value first with a default value of `1`.
+
+```javascript
+// available slaves format
+const availableSlaves = [{ ip: "127.0.0.1", port: "31231", flags: "slave" }];
+
+// preferredSlaves array format
+let preferredSlaves = [
+  { ip: "127.0.0.1", port: "31231", prio: 1 },
+  { ip: "127.0.0.1", port: "31232", prio: 2 },
+];
+
+// preferredSlaves function format
+preferredSlaves = function (availableSlaves) {
+  for (let i = 0; i < availableSlaves.length; i++) {
+    const slave = availableSlaves[i];
+    if (slave.ip === "127.0.0.1") {
+      if (slave.port === "31234") {
+        return slave;
+      }
+    }
+  }
+  // if no preferred slaves are available a random one is used
+  return false;
+};
+
+const redis = new Redis({
+  sentinels: [
+    { host: "127.0.0.1", port: 26379 },
+    { host: "127.0.0.1", port: 26380 },
+  ],
+  name: "mymaster",
+  role: "slave",
+  preferredSlaves: preferredSlaves,
+});
+```
+
+Besides the `retryStrategy` option, there's also a `sentinelRetryStrategy` in Sentinel mode which will be invoked when all the sentinel nodes are unreachable during connecting. If `sentinelRetryStrategy` returns a valid delay time, ioredis will try to reconnect from scratch. The default value of `sentinelRetryStrategy` is:
+
+```javascript
+function (times) {
+  const delay = Math.min(times * 10, 1000);
+  return delay;
+}
+```
+
+## Cluster
+
+Redis Cluster provides a way to run a Redis installation where data is automatically sharded across multiple Redis nodes.
+You can connect to a Redis Cluster like this:
+
+```javascript
+const Redis = require("ioredis");
+
+const cluster = new Redis.Cluster([
+  {
+    port: 6380,
+    host: "127.0.0.1",
+  },
+  {
+    port: 6381,
+    host: "127.0.0.1",
+  },
+]);
+
+cluster.set("foo", "bar");
+cluster.get("foo", (err, res) => {
+  // res === 'bar'
+});
+```
+
+`Cluster` constructor accepts two arguments, where:
+
+0.  The first argument is a list of nodes of the cluster you want to connect to.
+    Just like Sentinel, the list does not need to enumerate all your cluster nodes,
+    but a few so that if one is unreachable the client will try the next one, and the client will discover other nodes automatically when at least one node is connected.
+1.  The second argument is the options, where:
+
+    - `clusterRetryStrategy`: When none of the startup nodes are reachable, `clusterRetryStrategy` will be invoked. When a number is returned,
+      ioredis will try to reconnect to the startup nodes from scratch after the specified delay (in ms). Otherwise, an error of "None of startup nodes is available" will be returned.
+      The default value of this option is:
+
+      ```javascript
+      function (times) {
+        const delay = Math.min(100 + times * 2, 2000);
+        return delay;
+      }
+      ```
+
+      It's possible to modify the `startupNodes` property in order to switch to another set of nodes here:
+
+      ```javascript
+      function (times) {
+        this.startupNodes = [{ port: 6790, host: '127.0.0.1' }];
+        return Math.min(100 + times * 2, 2000);
+      }
+      ```
+
+    - `dnsLookup`: Alternative DNS lookup function (`dns.lookup()` is used by default). It may be useful to override this in special cases, such as when AWS ElastiCache used with TLS enabled.
+    - `enableOfflineQueue`: Similar to the `enableOfflineQueue` option of `Redis` class.
+    - `enableReadyCheck`: When enabled, "ready" event will only be emitted when `CLUSTER INFO` command
+      reporting the cluster is ready for handling commands. Otherwise, it will be emitted immediately after "connect" is emitted.
+    - `scaleReads`: Config where to send the read queries. See below for more details.
+    - `maxRedirections`: When a cluster related error (e.g. `MOVED`, `ASK` and `CLUSTERDOWN` etc.) is received, the client will redirect the
+      command to another node. This option limits the max redirections allowed when sending a command. The default value is `16`.
+    - `retryDelayOnFailover`: If the target node is disconnected when sending a command,
+      ioredis will retry after the specified delay. The default value is `100`. You should make sure `retryDelayOnFailover * maxRedirections > cluster-node-timeout`
+      to insure that no command will fail during a failover.
+    - `retryDelayOnClusterDown`: When a cluster is down, all commands will be rejected with the error of `CLUSTERDOWN`. If this option is a number (by default, it is `100`), the client
+      will resend the commands after the specified time (in ms).
+    - `retryDelayOnTryAgain`: If this option is a number (by default, it is `100`), the client
+      will resend the commands rejected with `TRYAGAIN` error after the specified time (in ms).
+    - `retryDelayOnMoved`: By default, this value is `0` (in ms), which means when a `MOVED` error is received, the client will resend
+      the command instantly to the node returned together with the `MOVED` error. However, sometimes it takes time for a cluster to become
+      state stabilized after a failover, so adding a delay before resending can prevent a ping pong effect.
+    - `redisOptions`: Default options passed to the constructor of `Redis` when connecting to a node.
+    - `slotsRefreshTimeout`: Milliseconds before a timeout occurs while refreshing slots from the cluster (default `1000`).
+    - `slotsRefreshInterval`: Milliseconds between every automatic slots refresh (by default, it is disabled).
+
+### Read-Write Splitting
+
+A typical redis cluster contains three or more masters and several slaves for each master. It's possible to scale out redis cluster by sending read queries to slaves and write queries to masters by setting the `scaleReads` option.
+
+`scaleReads` is "master" by default, which means ioredis will never send any queries to slaves. There are other three available options:
+
+1. "all": Send write queries to masters and read queries to masters or slaves randomly.
+2. "slave": Send write queries to masters and read queries to slaves.
+3. a custom `function(nodes, command): node`: Will choose the custom function to select to which node to send read queries (write queries keep being sent to master). The first node in `nodes` is always the master serving the relevant slots. If the function returns an array of nodes, a random node of that list will be selected.
+
+For example:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    /* nodes */
+  ],
+  {
+    scaleReads: "slave",
+  }
+);
+cluster.set("foo", "bar"); // This query will be sent to one of the masters.
+cluster.get("foo", (err, res) => {
+  // This query will be sent to one of the slaves.
+});
+```
+
+**NB** In the code snippet above, the `res` may not be equal to "bar" because of the lag of replication between the master and slaves.
+
+### Running Commands to Multiple Nodes
+
+Every command will be sent to exactly one node. For commands containing keys, (e.g. `GET`, `SET` and `HGETALL`), ioredis sends them to the node that serving the keys, and for other commands not containing keys, (e.g. `INFO`, `KEYS` and `FLUSHDB`), ioredis sends them to a random node.
+
+Sometimes you may want to send a command to multiple nodes (masters or slaves) of the cluster, you can get the nodes via `Cluster#nodes()` method.
+
+`Cluster#nodes()` accepts a parameter role, which can be "master", "slave" and "all" (default), and returns an array of `Redis` instance. For example:
+
+```javascript
+// Send `FLUSHDB` command to all slaves:
+const slaves = cluster.nodes("slave");
+Promise.all(slaves.map((node) => node.flushdb()));
+
+// Get keys of all the masters:
+const masters = cluster.nodes("master");
+Promise.all(
+  masters
+    .map((node) => node.keys())
+    .then((keys) => {
+      // keys: [['key1', 'key2'], ['key3', 'key4']]
+    })
+);
+```
+
+### NAT Mapping
+
+Sometimes the cluster is hosted within a internal network that can only be accessed via a NAT (Network Address Translation) instance. See [Accessing ElastiCache from outside AWS](https://docs.aws.amazon.com/AmazonElastiCache/latest/red-ug/accessing-elasticache.html) as an example.
+
+You can specify nat mapping rules via `natMap` option:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "203.0.113.73",
+      port: 30001,
+    },
+  ],
+  {
+    natMap: {
+      "10.0.1.230:30001": { host: "203.0.113.73", port: 30001 },
+      "10.0.1.231:30001": { host: "203.0.113.73", port: 30002 },
+      "10.0.1.232:30001": { host: "203.0.113.73", port: 30003 },
+    },
+  }
+);
+```
+
+Or you can specify this parameter through function:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "203.0.113.73",
+      port: 30001,
+    },
+  ],
+  {
+    natMap: (key) => {
+      if (key.includes("30001")) {
+        return { host: "203.0.113.73", port: 30001 };
+      }
+
+      return null;
+    },
+  }
+);
+```
+
+This option is also useful when the cluster is running inside a Docker container.
+Also it works for Clusters in cloud infrastructure where cluster nodes connected through dedicated subnet.
+
+Specifying through may be useful if you don't know concrete internal host and know only node port.
+
+### Transaction and Pipeline in Cluster Mode
+
+Almost all features that are supported by `Redis` are also supported by `Redis.Cluster`, e.g. custom commands, transaction and pipeline.
+However there are some differences when using transaction and pipeline in Cluster mode:
+
+0. All keys in a pipeline should belong to slots served by the same node, since ioredis sends all commands in a pipeline to the same node.
+1. You can't use `multi` without pipeline (aka `cluster.multi({ pipeline: false })`). This is because when you call `cluster.multi({ pipeline: false })`, ioredis doesn't know which node the `multi` command should be sent to.
+
+When any commands in a pipeline receives a `MOVED` or `ASK` error, ioredis will resend the whole pipeline to the specified node automatically if all of the following conditions are satisfied:
+
+0. All errors received in the pipeline are the same. For example, we won't resend the pipeline if we got two `MOVED` errors pointing to different nodes.
+1. All commands executed successfully are readonly commands. This makes sure that resending the pipeline won't have side effects.
+
+### Pub/Sub
+
+Pub/Sub in cluster mode works exactly as the same as in standalone mode. Internally, when a node of the cluster receives a message, it will broadcast the message to the other nodes. ioredis makes sure that each message will only be received once by strictly subscribing one node at the same time.
+
+```javascript
+const nodes = [
+  /* nodes */
+];
+const pub = new Redis.Cluster(nodes);
+const sub = new Redis.Cluster(nodes);
+sub.on("message", (channel, message) => {
+  console.log(channel, message);
+});
+
+sub.subscribe("news", () => {
+  pub.publish("news", "highlights");
+});
+```
+
+### Sharded Pub/Sub
+
+For sharded Pub/Sub, use the `spublish` and `ssubscribe` commands instead of the traditional `publish` and `subscribe`. With the old commands, the Redis cluster handles message propagation behind the scenes, allowing you to publish or subscribe to any node without considering sharding. However, this approach has scalability limitations that are addressed with sharded Pub/Sub. Here’s what you need to know:
+
+1. Instead of a single subscriber connection, there is now one subscriber connection per shard. Because of the potential overhead, you can enable or disable the use of the cluster subscriber group with the `shardedSubscribers` option. By default, this option is set to `false`, meaning sharded subscriptions are disabled. You should enable this option when establishing your cluster connection before using `ssubscribe`.
+2. All channel names that you pass to a single `ssubscribe` need to map to the same hash slot. You can call `ssubscribe` multiple times on the same cluster client instance to subscribe to channels across slots. The cluster's subscriber group takes care of forwarding the `ssubscribe` command to the shard that is responsible for the channels.
+
+The following basic example shows you how to use sharded Pub/Sub:
+
+```javascript
+const cluster: Cluster = new Cluster([{ host: host, port: port }], {
+  shardedSubscribers: true,
+});
+
+//Register the callback
+cluster.on("smessage", (channel, message) => {
+  console.log(message);
+});
+
+//Subscribe to the channels on the same slot
+cluster
+  .ssubscribe("channel{my}:1", "channel{my}:2")
+  .then((count: number) => {
+    console.log(count);
+  })
+  .catch((err) => {
+    console.log(err);
+  });
+
+//Publish a message
+cluster
+  .spublish("channel{my}:1", "This is a test message to my first channel.")
+  .then((value: number) => {
+    console.log("Published a message to channel{my}:1");
+  });
+```
+
+### Events
+
+| Event        | Description                                                                                                                                                                                                |
+| :----------- | :--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
+| connect      | emits when a connection is established to the Redis server.                                                                                                                                                |
+| ready        | emits when `CLUSTER INFO` reporting the cluster is able to receive commands (if `enableReadyCheck` is `true`) or immediately after `connect` event (if `enableReadyCheck` is false).                       |
+| error        | emits when an error occurs while connecting with a property of `lastNodeError` representing the last node error received. This event is emitted silently (only emitting if there's at least one listener). |
+| close        | emits when an established Redis server connection has closed.                                                                                                                                              |
+| reconnecting | emits after `close` when a reconnection will be made. The argument of the event is the time (in ms) before reconnecting.                                                                                   |
+| end          | emits after `close` when no more reconnections will be made.                                                                                                                                               |
+| +node        | emits when a new node is connected.                                                                                                                                                                        |
+| -node        | emits when a node is disconnected.                                                                                                                                                                         |
+| node error   | emits when an error occurs when connecting to a node. The second argument indicates the address of the node.                                                                                               |
+
+### Password
+
+Setting the `password` option to access password-protected clusters:
+
+```javascript
+const Redis = require("ioredis");
+const cluster = new Redis.Cluster(nodes, {
+  redisOptions: {
+    password: "your-cluster-password",
+  },
+});
+```
+
+If some of nodes in the cluster using a different password, you should specify them in the first parameter:
+
+```javascript
+const Redis = require("ioredis");
+const cluster = new Redis.Cluster(
+  [
+    // Use password "password-for-30001" for 30001
+    { port: 30001, password: "password-for-30001" },
+    // Don't use password when accessing 30002
+    { port: 30002, password: null },
+    // Other nodes will use "fallback-password"
+  ],
+  {
+    redisOptions: {
+      password: "fallback-password",
+    },
+  }
+);
+```
+
+### Special Note: Aws Elasticache Clusters with TLS
+
+AWS ElastiCache for Redis (Clustered Mode) supports TLS encryption. If you use
+this, you may encounter errors with invalid certificates. To resolve this
+issue, construct the `Cluster` with the `dnsLookup` option as follows:
+
+```javascript
+const cluster = new Redis.Cluster(
+  [
+    {
+      host: "clustercfg.myCluster.abcdefg.xyz.cache.amazonaws.com",
+      port: 6379,
+    },
+  ],
+  {
+    dnsLookup: (address, callback) => callback(null, address),
+    redisOptions: {
+      tls: {},
+    },
+  }
+);
+```
+
+<hr>
+
+## Autopipelining
+
+In standard mode, when you issue multiple commands, ioredis sends them to the server one by one. As described in Redis pipeline documentation, this is a suboptimal use of the network link, especially when such link is not very performant.
+
+The TCP and network overhead negatively affects performance. Commands are stuck in the send queue until the previous ones are correctly delivered to the server. This is a problem known as Head-Of-Line blocking (HOL).
+
+ioredis supports a feature called “auto pipelining”. It can be enabled by setting the option `enableAutoPipelining` to `true`. No other code change is necessary.
+
+In auto pipelining mode, all commands issued during an event loop are enqueued in a pipeline automatically managed by ioredis. At the end of the iteration, the pipeline is executed and thus all commands are sent to the server at the same time.
+
+This feature can dramatically improve throughput and avoids HOL blocking. In our benchmarks, the improvement was between 35% and 50%.
+
+While an automatic pipeline is executing, all new commands will be enqueued in a new pipeline which will be executed as soon as the previous finishes.
+
+When using Redis Cluster, one pipeline per node is created. Commands are assigned to pipelines according to which node serves the slot.
+
+A pipeline will thus contain commands using different slots but that ultimately are assigned to the same node.
+
+Note that the same slot limitation within a single command still holds, as it is a Redis limitation.
+
+### Example of Automatic Pipeline Enqueuing
+
+This sample code uses ioredis with automatic pipeline enabled.
+
+```javascript
+const Redis = require("./built");
+const http = require("http");
+
+const db = new Redis({ enableAutoPipelining: true });
+
+const server = http.createServer((request, response) => {
+  const key = new URL(request.url, "https://localhost:3000/").searchParams.get(
+    "key"
+  );
+
+  db.get(key, (err, value) => {
+    response.writeHead(200, { "Content-Type": "text/plain" });
+    response.end(value);
+  });
+});
+
+server.listen(3000);
+```
+
+When Node receives requests, it schedules them to be processed in one or more iterations of the events loop.
+
+All commands issued by requests processing during one iteration of the loop will be wrapped in a pipeline automatically created by ioredis.
+
+In the example above, the pipeline will have the following contents:
+
+```
+GET key1
+GET key2
+GET key3
+...
+GET keyN
+```
+
+When all events in the current loop have been processed, the pipeline is executed and thus all commands are sent to the server at the same time.
+
+While waiting for pipeline response from Redis, Node will still be able to process requests. All commands issued by request handler will be enqueued in a new automatically created pipeline. This pipeline will not be sent to the server yet.
+
+As soon as a previous automatic pipeline has received all responses from the server, the new pipeline is immediately sent without waiting for the events loop iteration to finish.
+
+This approach increases the utilization of the network link, reduces the TCP overhead and idle times and therefore improves throughput.
+
+### Benchmarks
+
+Here's some of the results of our tests for a single node.
+
+Each iteration of the test runs 1000 random commands on the server.
+
+|                           | Samples | Result        | Tolerance |
+| ------------------------- | ------- | ------------- | --------- |
+| default                   | 1000    | 174.62 op/sec | ± 0.45 %  |
+| enableAutoPipelining=true | 1500    | 233.33 op/sec | ± 0.88 %  |
+
+And here's the same test for a cluster of 3 masters and 3 replicas:
+
+|                           | Samples | Result        | Tolerance |
+| ------------------------- | ------- | ------------- | --------- |
+| default                   | 1000    | 164.05 op/sec | ± 0.42 %  |
+| enableAutoPipelining=true | 3000    | 235.31 op/sec | ± 0.94 %  |
+
+# Error Handling
+
+All the errors returned by the Redis server are instances of `ReplyError`, which can be accessed via `Redis`:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis();
+// This command causes a reply error since the SET command requires two arguments.
+redis.set("foo", (err) => {
+  err instanceof Redis.ReplyError;
+});
+```
+
+This is the error stack of the `ReplyError`:
+
+```
+ReplyError: ERR wrong number of arguments for 'set' command
+    at ReplyParser._parseResult (/app/node_modules/ioredis/lib/parsers/javascript.js:60:14)
+    at ReplyParser.execute (/app/node_modules/ioredis/lib/parsers/javascript.js:178:20)
+    at Socket.<anonymous> (/app/node_modules/ioredis/lib/redis/event_handler.js:99:22)
+    at Socket.emit (events.js:97:17)
+    at readableAddChunk (_stream_readable.js:143:16)
+    at Socket.Readable.push (_stream_readable.js:106:10)
+    at TCP.onread (net.js:509:20)
+```
+
+By default, the error stack doesn't make any sense because the whole stack happens in the ioredis
+module itself, not in your code. So it's not easy to find out where the error happens in your code.
+ioredis provides an option `showFriendlyErrorStack` to solve the problem. When you enable
+`showFriendlyErrorStack`, ioredis will optimize the error stack for you:
+
+```javascript
+const Redis = require("ioredis");
+const redis = new Redis({ showFriendlyErrorStack: true });
+redis.set("foo");
+```
+
+And the output will be:
+
+```
+ReplyError: ERR wrong number of arguments for 'set' command
+    at Object.<anonymous> (/app/index.js:3:7)
+    at Module._compile (module.js:446:26)
+    at Object.Module._extensions..js (module.js:464:10)
+    at Module.load (module.js:341:32)
+    at Function.Module._load (module.js:296:12)
+    at Function.Module.runMain (module.js:487:10)
+    at startup (node.js:111:16)
+    at node.js:799:3
+```
+
+This time the stack tells you that the error happens on the third line in your code. Pretty sweet!
+However, it would decrease the performance significantly to optimize the error stack. So by
+default, this option is disabled and can only be used for debugging purposes. You **shouldn't** use this feature in a production environment.
+
+# Running tests
+
+Start a Redis server on 127.0.0.1:6379, and then:
+
+```shell
+npm test
+```
+
+`FLUSH ALL` will be invoked after each test, so make sure there's no valuable data in it before running tests.
+
+If your testing environment does not let you spin up a Redis server [ioredis-mock](https://github.com/stipsan/ioredis-mock) is a drop-in replacement you can use in your tests. It aims to behave identically to ioredis connected to a Redis server so that your integration tests is easier to write and of better quality.
+
+# Debug
+
+You can set the `DEBUG` env to `ioredis:*` to print debug info:
+
+```shell
+$ DEBUG=ioredis:* node app.js
+```
+
+# Join in!
+
+I'm happy to receive bug reports, fixes, documentation enhancements, and any other improvements.
+
+And since I'm not a native English speaker, if you find any grammar mistakes in the documentation, please also let me know. :)
+
+# Contributors
+
+This project exists thanks to all the people who contribute:
+
+<a href="https://github.com/redis/ioredis/graphs/contributors"><img src="https://opencollective.com/ioredis/contributors.svg?width=890&showBtn=false" /></a>
+
+# License
+
+MIT
+
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fluin%2Fioredis.svg?type=large)](https://app.fossa.io/projects/git%2Bgithub.com%2Fluin%2Fioredis?ref=badge_large)
diff --git a/node_modules/ioredis/built/Command.d.ts b/node_modules/ioredis/built/Command.d.ts
new file mode 100644
index 0000000..66afea3
--- /dev/null
+++ b/node_modules/ioredis/built/Command.d.ts
@@ -0,0 +1,166 @@
+/// <reference types="node" />
+import { Callback, Respondable, CommandParameter } from "./types";
+export declare type ArgumentType = string | Buffer | number | (string | Buffer | number | any[])[];
+interface CommandOptions {
+    /**
+     * Set the encoding of the reply, by default buffer will be returned.
+     */
+    replyEncoding?: BufferEncoding | null;
+    errorStack?: Error;
+    keyPrefix?: string;
+    /**
+     * Force the command to be readOnly so it will also execute on slaves
+     */
+    readOnly?: boolean;
+}
+declare type ArgumentTransformer = (args: any[]) => any[];
+declare type ReplyTransformer = (reply: any) => any;
+export interface CommandNameFlags {
+    VALID_IN_SUBSCRIBER_MODE: [
+        "subscribe",
+        "psubscribe",
+        "unsubscribe",
+        "punsubscribe",
+        "ssubscribe",
+        "sunsubscribe",
+        "ping",
+        "quit"
+    ];
+    VALID_IN_MONITOR_MODE: ["monitor", "auth"];
+    ENTER_SUBSCRIBER_MODE: ["subscribe", "psubscribe", "ssubscribe"];
+    EXIT_SUBSCRIBER_MODE: ["unsubscribe", "punsubscribe", "sunsubscribe"];
+    WILL_DISCONNECT: ["quit"];
+    HANDSHAKE_COMMANDS: ["auth", "select", "client", "readonly", "info"];
+    IGNORE_RECONNECT_ON_ERROR: ["client"];
+    BLOCKING_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+        "bzmpop",
+        "blmpop",
+        "xread",
+        "xreadgroup"
+    ];
+    LAST_ARG_TIMEOUT_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax"
+    ];
+    FIRST_ARG_TIMEOUT_COMMANDS: ["bzmpop", "blmpop"];
+    BLOCK_OPTION_COMMANDS: ["xread", "xreadgroup"];
+}
+/**
+ * Command instance
+ *
+ * It's rare that you need to create a Command instance yourself.
+ *
+ * ```js
+ * var infoCommand = new Command('info', null, function (err, result) {
+ *   console.log('result', result);
+ * });
+ *
+ * redis.sendCommand(infoCommand);
+ *
+ * // When no callback provided, Command instance will have a `promise` property,
+ * // which will resolve/reject with the result of the command.
+ * var getCommand = new Command('get', ['foo']);
+ * getCommand.promise.then(function (result) {
+ *   console.log('result', result);
+ * });
+ * ```
+ */
+export default class Command implements Respondable {
+    name: string;
+    static FLAGS: {
+        [key in keyof CommandNameFlags]: CommandNameFlags[key];
+    };
+    private static flagMap?;
+    private static _transformer;
+    /**
+     * Check whether the command has the flag
+     */
+    static checkFlag<T extends keyof CommandNameFlags>(flagName: T, commandName: string): commandName is CommandNameFlags[T][number];
+    static setArgumentTransformer(name: string, func: ArgumentTransformer): void;
+    static setReplyTransformer(name: string, func: ReplyTransformer): void;
+    private static getFlagMap;
+    ignore?: boolean;
+    isReadOnly?: boolean;
+    args: CommandParameter[];
+    inTransaction: boolean;
+    pipelineIndex?: number;
+    isTraced: boolean;
+    isResolved: boolean;
+    reject: (err: Error) => void;
+    resolve: (result: any) => void;
+    promise: Promise<any>;
+    private replyEncoding;
+    private errorStack;
+    private bufferMode;
+    private callback;
+    private transformed;
+    private _commandTimeoutTimer?;
+    private _blockingTimeoutTimer?;
+    private _blockingDeadline?;
+    private slot?;
+    private keys?;
+    /**
+     * Creates an instance of Command.
+     * @param name Command name
+     * @param args An array of command arguments
+     * @param options
+     * @param callback The callback that handles the response.
+     * If omit, the response will be handled via Promise
+     */
+    constructor(name: string, args?: Array<ArgumentType>, options?: CommandOptions, callback?: Callback);
+    getSlot(): number;
+    getKeys(): Array<string | Buffer>;
+    /**
+     * Convert command to writable buffer or string
+     */
+    toWritable(_socket: object): string | Buffer;
+    stringifyArguments(): void;
+    /**
+     * Convert buffer/buffer[] to string/string[],
+     * and apply reply transformer.
+     */
+    transformReply(result: Buffer | Buffer[]): string | string[] | Buffer | Buffer[];
+    /**
+     * Set the wait time before terminating the attempt to execute a command
+     * and generating an error.
+     */
+    setTimeout(ms: number): void;
+    /**
+     * Set a timeout for blocking commands.
+     * When the timeout expires, the command resolves with null (matching Redis behavior).
+     * This handles the case of undetectable network failures (e.g., docker network disconnect)
+     * where the TCP connection becomes a zombie and no close event fires.
+     */
+    setBlockingTimeout(ms: number): void;
+    /**
+     * Extract the blocking timeout from the command arguments.
+     *
+     * @returns The timeout in seconds, null for indefinite blocking (timeout of 0),
+     *          or undefined if this is not a blocking command
+     */
+    extractBlockingTimeout(): number | null | undefined;
+    /**
+     * Clear the command and blocking timers
+     */
+    private _clearTimers;
+    private initPromise;
+    /**
+     * Iterate through the command arguments that are considered keys.
+     */
+    private _iterateKeys;
+    /**
+     * Convert the value from buffer to the target encoding.
+     */
+    private _convertValue;
+}
+export {};
diff --git a/node_modules/ioredis/built/Command.js b/node_modules/ioredis/built/Command.js
new file mode 100644
index 0000000..ae9b61e
--- /dev/null
+++ b/node_modules/ioredis/built/Command.js
@@ -0,0 +1,450 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const calculateSlot = require("cluster-key-slot");
+const standard_as_callback_1 = require("standard-as-callback");
+const utils_1 = require("./utils");
+const argumentParsers_1 = require("./utils/argumentParsers");
+/**
+ * Command instance
+ *
+ * It's rare that you need to create a Command instance yourself.
+ *
+ * ```js
+ * var infoCommand = new Command('info', null, function (err, result) {
+ *   console.log('result', result);
+ * });
+ *
+ * redis.sendCommand(infoCommand);
+ *
+ * // When no callback provided, Command instance will have a `promise` property,
+ * // which will resolve/reject with the result of the command.
+ * var getCommand = new Command('get', ['foo']);
+ * getCommand.promise.then(function (result) {
+ *   console.log('result', result);
+ * });
+ * ```
+ */
+class Command {
+    /**
+     * Creates an instance of Command.
+     * @param name Command name
+     * @param args An array of command arguments
+     * @param options
+     * @param callback The callback that handles the response.
+     * If omit, the response will be handled via Promise
+     */
+    constructor(name, args = [], options = {}, callback) {
+        this.name = name;
+        this.inTransaction = false;
+        this.isTraced = false;
+        this.isResolved = false;
+        this.transformed = false;
+        this.replyEncoding = options.replyEncoding;
+        this.errorStack = options.errorStack;
+        this.args = args.flat();
+        this.callback = callback;
+        this.initPromise();
+        if (options.keyPrefix) {
+            // @ts-expect-error
+            const isBufferKeyPrefix = options.keyPrefix instanceof Buffer;
+            // @ts-expect-error
+            let keyPrefixBuffer = isBufferKeyPrefix
+                ? options.keyPrefix
+                : null;
+            this._iterateKeys((key) => {
+                if (key instanceof Buffer) {
+                    if (keyPrefixBuffer === null) {
+                        keyPrefixBuffer = Buffer.from(options.keyPrefix);
+                    }
+                    return Buffer.concat([keyPrefixBuffer, key]);
+                }
+                else if (isBufferKeyPrefix) {
+                    // @ts-expect-error
+                    return Buffer.concat([options.keyPrefix, Buffer.from(String(key))]);
+                }
+                return options.keyPrefix + key;
+            });
+        }
+        if (options.readOnly) {
+            this.isReadOnly = true;
+        }
+    }
+    /**
+     * Check whether the command has the flag
+     */
+    static checkFlag(flagName, commandName) {
+        commandName = commandName.toLowerCase();
+        return !!this.getFlagMap()[flagName][commandName];
+    }
+    static setArgumentTransformer(name, func) {
+        this._transformer.argument[name] = func;
+    }
+    static setReplyTransformer(name, func) {
+        this._transformer.reply[name] = func;
+    }
+    static getFlagMap() {
+        if (!this.flagMap) {
+            this.flagMap = Object.keys(Command.FLAGS).reduce((map, flagName) => {
+                map[flagName] = {};
+                Command.FLAGS[flagName].forEach((commandName) => {
+                    map[flagName][commandName] = true;
+                });
+                return map;
+            }, {});
+        }
+        return this.flagMap;
+    }
+    getSlot() {
+        if (typeof this.slot === "undefined") {
+            const key = this.getKeys()[0];
+            this.slot = key == null ? null : calculateSlot(key);
+        }
+        return this.slot;
+    }
+    getKeys() {
+        return this._iterateKeys();
+    }
+    /**
+     * Convert command to writable buffer or string
+     */
+    toWritable(_socket) {
+        let result;
+        const commandStr = "*" +
+            (this.args.length + 1) +
+            "\r\n$" +
+            Buffer.byteLength(this.name) +
+            "\r\n" +
+            this.name +
+            "\r\n";
+        if (this.bufferMode) {
+            const buffers = new MixedBuffers();
+            buffers.push(commandStr);
+            for (let i = 0; i < this.args.length; ++i) {
+                const arg = this.args[i];
+                if (arg instanceof Buffer) {
+                    if (arg.length === 0) {
+                        buffers.push("$0\r\n\r\n");
+                    }
+                    else {
+                        buffers.push("$" + arg.length + "\r\n");
+                        buffers.push(arg);
+                        buffers.push("\r\n");
+                    }
+                }
+                else {
+                    buffers.push("$" +
+                        Buffer.byteLength(arg) +
+                        "\r\n" +
+                        arg +
+                        "\r\n");
+                }
+            }
+            result = buffers.toBuffer();
+        }
+        else {
+            result = commandStr;
+            for (let i = 0; i < this.args.length; ++i) {
+                const arg = this.args[i];
+                result +=
+                    "$" +
+                        Buffer.byteLength(arg) +
+                        "\r\n" +
+                        arg +
+                        "\r\n";
+            }
+        }
+        return result;
+    }
+    stringifyArguments() {
+        for (let i = 0; i < this.args.length; ++i) {
+            const arg = this.args[i];
+            if (typeof arg === "string") {
+                // buffers and strings don't need any transformation
+            }
+            else if (arg instanceof Buffer) {
+                this.bufferMode = true;
+            }
+            else {
+                this.args[i] = (0, utils_1.toArg)(arg);
+            }
+        }
+    }
+    /**
+     * Convert buffer/buffer[] to string/string[],
+     * and apply reply transformer.
+     */
+    transformReply(result) {
+        if (this.replyEncoding) {
+            result = (0, utils_1.convertBufferToString)(result, this.replyEncoding);
+        }
+        const transformer = Command._transformer.reply[this.name];
+        if (transformer) {
+            result = transformer(result);
+        }
+        return result;
+    }
+    /**
+     * Set the wait time before terminating the attempt to execute a command
+     * and generating an error.
+     */
+    setTimeout(ms) {
+        if (!this._commandTimeoutTimer) {
+            this._commandTimeoutTimer = setTimeout(() => {
+                if (!this.isResolved) {
+                    this.reject(new Error("Command timed out"));
+                }
+            }, ms);
+        }
+    }
+    /**
+     * Set a timeout for blocking commands.
+     * When the timeout expires, the command resolves with null (matching Redis behavior).
+     * This handles the case of undetectable network failures (e.g., docker network disconnect)
+     * where the TCP connection becomes a zombie and no close event fires.
+     */
+    setBlockingTimeout(ms) {
+        if (ms <= 0) {
+            return;
+        }
+        // Clear existing timer if any (can happen when command moves from offline to command queue)
+        if (this._blockingTimeoutTimer) {
+            clearTimeout(this._blockingTimeoutTimer);
+            this._blockingTimeoutTimer = undefined;
+        }
+        const now = Date.now();
+        // First call: establish absolute deadline
+        if (this._blockingDeadline === undefined) {
+            this._blockingDeadline = now + ms;
+        }
+        // Check if we've already exceeded the deadline
+        const remaining = this._blockingDeadline - now;
+        if (remaining <= 0) {
+            // Resolve with null to indicate timeout (same as Redis behavior)
+            this.resolve(null);
+            return;
+        }
+        this._blockingTimeoutTimer = setTimeout(() => {
+            if (this.isResolved) {
+                this._blockingTimeoutTimer = undefined;
+                return;
+            }
+            this._blockingTimeoutTimer = undefined;
+            // Timeout expired - resolve with null (same as Redis behavior when blocking command times out)
+            this.resolve(null);
+        }, remaining);
+    }
+    /**
+     * Extract the blocking timeout from the command arguments.
+     *
+     * @returns The timeout in seconds, null for indefinite blocking (timeout of 0),
+     *          or undefined if this is not a blocking command
+     */
+    extractBlockingTimeout() {
+        const args = this.args;
+        if (!args || args.length === 0) {
+            return undefined;
+        }
+        const name = this.name.toLowerCase();
+        if (Command.checkFlag("LAST_ARG_TIMEOUT_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseSecondsArgument)(args[args.length - 1]);
+        }
+        if (Command.checkFlag("FIRST_ARG_TIMEOUT_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseSecondsArgument)(args[0]);
+        }
+        if (Command.checkFlag("BLOCK_OPTION_COMMANDS", name)) {
+            return (0, argumentParsers_1.parseBlockOption)(args);
+        }
+        return undefined;
+    }
+    /**
+     * Clear the command and blocking timers
+     */
+    _clearTimers() {
+        const existingTimer = this._commandTimeoutTimer;
+        if (existingTimer) {
+            clearTimeout(existingTimer);
+            delete this._commandTimeoutTimer;
+        }
+        const blockingTimer = this._blockingTimeoutTimer;
+        if (blockingTimer) {
+            clearTimeout(blockingTimer);
+            delete this._blockingTimeoutTimer;
+        }
+    }
+    initPromise() {
+        const promise = new Promise((resolve, reject) => {
+            if (!this.transformed) {
+                this.transformed = true;
+                const transformer = Command._transformer.argument[this.name];
+                if (transformer) {
+                    this.args = transformer(this.args);
+                }
+                this.stringifyArguments();
+            }
+            this.resolve = this._convertValue(resolve);
+            this.reject = (err) => {
+                this._clearTimers();
+                if (this.errorStack) {
+                    reject((0, utils_1.optimizeErrorStack)(err, this.errorStack.stack, __dirname));
+                }
+                else {
+                    reject(err);
+                }
+            };
+        });
+        this.promise = (0, standard_as_callback_1.default)(promise, this.callback);
+    }
+    /**
+     * Iterate through the command arguments that are considered keys.
+     */
+    _iterateKeys(transform = (key) => key) {
+        if (typeof this.keys === "undefined") {
+            this.keys = [];
+            if ((0, commands_1.exists)(this.name, { caseInsensitive: true })) {
+                // @ts-expect-error
+                const keyIndexes = (0, commands_1.getKeyIndexes)(this.name, this.args, {
+                    nameCaseInsensitive: true,
+                });
+                for (const index of keyIndexes) {
+                    this.args[index] = transform(this.args[index]);
+                    this.keys.push(this.args[index]);
+                }
+            }
+        }
+        return this.keys;
+    }
+    /**
+     * Convert the value from buffer to the target encoding.
+     */
+    _convertValue(resolve) {
+        return (value) => {
+            try {
+                this._clearTimers();
+                resolve(this.transformReply(value));
+                this.isResolved = true;
+            }
+            catch (err) {
+                this.reject(err);
+            }
+            return this.promise;
+        };
+    }
+}
+exports.default = Command;
+Command.FLAGS = {
+    VALID_IN_SUBSCRIBER_MODE: [
+        "subscribe",
+        "psubscribe",
+        "unsubscribe",
+        "punsubscribe",
+        "ssubscribe",
+        "sunsubscribe",
+        "ping",
+        "quit",
+    ],
+    VALID_IN_MONITOR_MODE: ["monitor", "auth"],
+    ENTER_SUBSCRIBER_MODE: ["subscribe", "psubscribe", "ssubscribe"],
+    EXIT_SUBSCRIBER_MODE: ["unsubscribe", "punsubscribe", "sunsubscribe"],
+    WILL_DISCONNECT: ["quit"],
+    HANDSHAKE_COMMANDS: ["auth", "select", "client", "readonly", "info"],
+    IGNORE_RECONNECT_ON_ERROR: ["client"],
+    BLOCKING_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+        "bzmpop",
+        "blmpop",
+        "xread",
+        "xreadgroup",
+    ],
+    LAST_ARG_TIMEOUT_COMMANDS: [
+        "blpop",
+        "brpop",
+        "brpoplpush",
+        "blmove",
+        "bzpopmin",
+        "bzpopmax",
+    ],
+    FIRST_ARG_TIMEOUT_COMMANDS: ["bzmpop", "blmpop"],
+    BLOCK_OPTION_COMMANDS: ["xread", "xreadgroup"],
+};
+Command._transformer = {
+    argument: {},
+    reply: {},
+};
+const msetArgumentTransformer = function (args) {
+    if (args.length === 1) {
+        if (args[0] instanceof Map) {
+            return (0, utils_1.convertMapToArray)(args[0]);
+        }
+        if (typeof args[0] === "object" && args[0] !== null) {
+            return (0, utils_1.convertObjectToArray)(args[0]);
+        }
+    }
+    return args;
+};
+const hsetArgumentTransformer = function (args) {
+    if (args.length === 2) {
+        if (args[1] instanceof Map) {
+            return [args[0]].concat((0, utils_1.convertMapToArray)(args[1]));
+        }
+        if (typeof args[1] === "object" && args[1] !== null) {
+            return [args[0]].concat((0, utils_1.convertObjectToArray)(args[1]));
+        }
+    }
+    return args;
+};
+Command.setArgumentTransformer("mset", msetArgumentTransformer);
+Command.setArgumentTransformer("msetnx", msetArgumentTransformer);
+Command.setArgumentTransformer("hset", hsetArgumentTransformer);
+Command.setArgumentTransformer("hmset", hsetArgumentTransformer);
+Command.setReplyTransformer("hgetall", function (result) {
+    if (Array.isArray(result)) {
+        const obj = {};
+        for (let i = 0; i < result.length; i += 2) {
+            const key = result[i];
+            const value = result[i + 1];
+            if (key in obj) {
+                // can only be truthy if the property is special somehow, like '__proto__' or 'constructor'
+                // https://github.com/luin/ioredis/issues/1267
+                Object.defineProperty(obj, key, {
+                    value,
+                    configurable: true,
+                    enumerable: true,
+                    writable: true,
+                });
+            }
+            else {
+                obj[key] = value;
+            }
+        }
+        return obj;
+    }
+    return result;
+});
+class MixedBuffers {
+    constructor() {
+        this.length = 0;
+        this.items = [];
+    }
+    push(x) {
+        this.length += Buffer.byteLength(x);
+        this.items.push(x);
+    }
+    toBuffer() {
+        const result = Buffer.allocUnsafe(this.length);
+        let offset = 0;
+        for (const item of this.items) {
+            const length = Buffer.byteLength(item);
+            Buffer.isBuffer(item)
+                ? item.copy(result, offset)
+                : result.write(item, offset, length);
+            offset += length;
+        }
+        return result;
+    }
+}
diff --git a/node_modules/ioredis/built/DataHandler.d.ts b/node_modules/ioredis/built/DataHandler.d.ts
new file mode 100644
index 0000000..93e97d9
--- /dev/null
+++ b/node_modules/ioredis/built/DataHandler.d.ts
@@ -0,0 +1,37 @@
+/// <reference types="node" />
+import { NetStream, CommandItem } from "./types";
+import Deque = require("denque");
+import { EventEmitter } from "events";
+import SubscriptionSet from "./SubscriptionSet";
+export interface Condition {
+    select: number;
+    auth?: string | [string, string];
+    subscriber: false | SubscriptionSet;
+}
+export declare type FlushQueueOptions = {
+    offlineQueue?: boolean;
+    commandQueue?: boolean;
+};
+export interface DataHandledable extends EventEmitter {
+    stream: NetStream;
+    status: string;
+    condition: Condition | null;
+    commandQueue: Deque<CommandItem>;
+    disconnect(reconnect: boolean): void;
+    recoverFromFatalError(commandError: Error, err: Error, options: FlushQueueOptions): void;
+    handleReconnection(err: Error, item: CommandItem): void;
+}
+interface ParserOptions {
+    stringNumbers: boolean;
+}
+export default class DataHandler {
+    private redis;
+    constructor(redis: DataHandledable, parserOptions: ParserOptions);
+    private returnFatalError;
+    private returnError;
+    private returnReply;
+    private handleSubscriberReply;
+    private handleMonitorReply;
+    private shiftCommand;
+}
+export {};
diff --git a/node_modules/ioredis/built/DataHandler.js b/node_modules/ioredis/built/DataHandler.js
new file mode 100644
index 0000000..7f95466
--- /dev/null
+++ b/node_modules/ioredis/built/DataHandler.js
@@ -0,0 +1,224 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const Command_1 = require("./Command");
+const utils_1 = require("./utils");
+const RedisParser = require("redis-parser");
+const SubscriptionSet_1 = require("./SubscriptionSet");
+const debug = (0, utils_1.Debug)("dataHandler");
+class DataHandler {
+    constructor(redis, parserOptions) {
+        this.redis = redis;
+        const parser = new RedisParser({
+            stringNumbers: parserOptions.stringNumbers,
+            returnBuffers: true,
+            returnError: (err) => {
+                this.returnError(err);
+            },
+            returnFatalError: (err) => {
+                this.returnFatalError(err);
+            },
+            returnReply: (reply) => {
+                this.returnReply(reply);
+            },
+        });
+        // prependListener ensures the parser receives and processes data before socket timeout checks are performed
+        redis.stream.prependListener("data", (data) => {
+            parser.execute(data);
+        });
+        // prependListener() doesn't enable flowing mode automatically - we need to resume the stream manually
+        redis.stream.resume();
+    }
+    returnFatalError(err) {
+        err.message += ". Please report this.";
+        this.redis.recoverFromFatalError(err, err, { offlineQueue: false });
+    }
+    returnError(err) {
+        const item = this.shiftCommand(err);
+        if (!item) {
+            return;
+        }
+        err.command = {
+            name: item.command.name,
+            args: item.command.args,
+        };
+        if (item.command.name == "ssubscribe" && err.message.includes("MOVED")) {
+            this.redis.emit("moved");
+            return;
+        }
+        this.redis.handleReconnection(err, item);
+    }
+    returnReply(reply) {
+        if (this.handleMonitorReply(reply)) {
+            return;
+        }
+        if (this.handleSubscriberReply(reply)) {
+            return;
+        }
+        const item = this.shiftCommand(reply);
+        if (!item) {
+            return;
+        }
+        if (Command_1.default.checkFlag("ENTER_SUBSCRIBER_MODE", item.command.name)) {
+            this.redis.condition.subscriber = new SubscriptionSet_1.default();
+            this.redis.condition.subscriber.add(item.command.name, reply[1].toString());
+            if (!fillSubCommand(item.command, reply[2])) {
+                this.redis.commandQueue.unshift(item);
+            }
+        }
+        else if (Command_1.default.checkFlag("EXIT_SUBSCRIBER_MODE", item.command.name)) {
+            if (!fillUnsubCommand(item.command, reply[2])) {
+                this.redis.commandQueue.unshift(item);
+            }
+        }
+        else {
+            item.command.resolve(reply);
+        }
+    }
+    handleSubscriberReply(reply) {
+        if (!this.redis.condition.subscriber) {
+            return false;
+        }
+        const replyType = Array.isArray(reply) ? reply[0].toString() : null;
+        debug('receive reply "%s" in subscriber mode', replyType);
+        switch (replyType) {
+            case "message":
+                if (this.redis.listeners("message").length > 0) {
+                    // Check if there're listeners to avoid unnecessary `toString()`.
+                    this.redis.emit("message", reply[1].toString(), reply[2] ? reply[2].toString() : "");
+                }
+                this.redis.emit("messageBuffer", reply[1], reply[2]);
+                break;
+            case "pmessage": {
+                const pattern = reply[1].toString();
+                if (this.redis.listeners("pmessage").length > 0) {
+                    this.redis.emit("pmessage", pattern, reply[2].toString(), reply[3].toString());
+                }
+                this.redis.emit("pmessageBuffer", pattern, reply[2], reply[3]);
+                break;
+            }
+            case "smessage": {
+                if (this.redis.listeners("smessage").length > 0) {
+                    this.redis.emit("smessage", reply[1].toString(), reply[2] ? reply[2].toString() : "");
+                }
+                this.redis.emit("smessageBuffer", reply[1], reply[2]);
+                break;
+            }
+            case "ssubscribe":
+            case "subscribe":
+            case "psubscribe": {
+                const channel = reply[1].toString();
+                this.redis.condition.subscriber.add(replyType, channel);
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                if (!fillSubCommand(item.command, reply[2])) {
+                    this.redis.commandQueue.unshift(item);
+                }
+                break;
+            }
+            case "sunsubscribe":
+            case "unsubscribe":
+            case "punsubscribe": {
+                const channel = reply[1] ? reply[1].toString() : null;
+                if (channel) {
+                    this.redis.condition.subscriber.del(replyType, channel);
+                }
+                const count = reply[2];
+                if (Number(count) === 0) {
+                    this.redis.condition.subscriber = false;
+                }
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                if (!fillUnsubCommand(item.command, count)) {
+                    this.redis.commandQueue.unshift(item);
+                }
+                break;
+            }
+            default: {
+                const item = this.shiftCommand(reply);
+                if (!item) {
+                    return;
+                }
+                item.command.resolve(reply);
+            }
+        }
+        return true;
+    }
+    handleMonitorReply(reply) {
+        if (this.redis.status !== "monitoring") {
+            return false;
+        }
+        const replyStr = reply.toString();
+        if (replyStr === "OK") {
+            // Valid commands in the monitoring mode are AUTH and MONITOR,
+            // both of which always reply with 'OK'.
+            // So if we got an 'OK', we can make certain that
+            // the reply is made to AUTH & MONITOR.
+            return false;
+        }
+        // Since commands sent in the monitoring mode will trigger an exception,
+        // any replies we received in the monitoring mode should consider to be
+        // realtime monitor data instead of result of commands.
+        const len = replyStr.indexOf(" ");
+        const timestamp = replyStr.slice(0, len);
+        const argIndex = replyStr.indexOf('"');
+        const args = replyStr
+            .slice(argIndex + 1, -1)
+            .split('" "')
+            .map((elem) => elem.replace(/\\"/g, '"'));
+        const dbAndSource = replyStr.slice(len + 2, argIndex - 2).split(" ");
+        this.redis.emit("monitor", timestamp, args, dbAndSource[1], dbAndSource[0]);
+        return true;
+    }
+    shiftCommand(reply) {
+        const item = this.redis.commandQueue.shift();
+        if (!item) {
+            const message = "Command queue state error. If you can reproduce this, please report it.";
+            const error = new Error(message +
+                (reply instanceof Error
+                    ? ` Last error: ${reply.message}`
+                    : ` Last reply: ${reply.toString()}`));
+            this.redis.emit("error", error);
+            return null;
+        }
+        return item;
+    }
+}
+exports.default = DataHandler;
+const remainingRepliesMap = new WeakMap();
+function fillSubCommand(command, count) {
+    let remainingReplies = remainingRepliesMap.has(command)
+        ? remainingRepliesMap.get(command)
+        : command.args.length;
+    remainingReplies -= 1;
+    if (remainingReplies <= 0) {
+        command.resolve(count);
+        remainingRepliesMap.delete(command);
+        return true;
+    }
+    remainingRepliesMap.set(command, remainingReplies);
+    return false;
+}
+function fillUnsubCommand(command, count) {
+    let remainingReplies = remainingRepliesMap.has(command)
+        ? remainingRepliesMap.get(command)
+        : command.args.length;
+    if (remainingReplies === 0) {
+        if (Number(count) === 0) {
+            remainingRepliesMap.delete(command);
+            command.resolve(count);
+            return true;
+        }
+        return false;
+    }
+    remainingReplies -= 1;
+    if (remainingReplies <= 0) {
+        command.resolve(count);
+        return true;
+    }
+    remainingRepliesMap.set(command, remainingReplies);
+    return false;
+}
diff --git a/node_modules/ioredis/built/Pipeline.d.ts b/node_modules/ioredis/built/Pipeline.d.ts
new file mode 100644
index 0000000..8503d72
--- /dev/null
+++ b/node_modules/ioredis/built/Pipeline.d.ts
@@ -0,0 +1,31 @@
+import Redis from "./Redis";
+import Cluster from "./cluster";
+import Command from "./Command";
+import Commander from "./utils/Commander";
+declare class Pipeline extends Commander<{
+    type: "pipeline";
+}> {
+    redis: Redis | Cluster;
+    isCluster: boolean;
+    isPipeline: boolean;
+    leftRedirections: {
+        value?: number;
+    };
+    promise: Promise<unknown>;
+    resolve: (result: unknown) => void;
+    reject: (error: Error) => void;
+    private replyPending;
+    private _queue;
+    private _result;
+    private _transactions;
+    private _shaToScript;
+    private preferKey;
+    constructor(redis: Redis | Cluster);
+    fillResult(value: unknown[], position: number): void;
+    sendCommand(command: Command): unknown;
+    addBatch(commands: any): this;
+}
+export default Pipeline;
+interface Pipeline {
+    length: number;
+}
diff --git a/node_modules/ioredis/built/Pipeline.js b/node_modules/ioredis/built/Pipeline.js
new file mode 100644
index 0000000..224e361
--- /dev/null
+++ b/node_modules/ioredis/built/Pipeline.js
@@ -0,0 +1,352 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const calculateSlot = require("cluster-key-slot");
+const commands_1 = require("@ioredis/commands");
+const standard_as_callback_1 = require("standard-as-callback");
+const util_1 = require("util");
+const Command_1 = require("./Command");
+const buffer_1 = require("buffer");
+const utils_1 = require("./utils");
+const Commander_1 = require("./utils/Commander");
+/*
+  This function derives from the cluster-key-slot implementation.
+  Instead of checking that all keys have the same slot, it checks that all slots are served by the same set of nodes.
+  If this is satisfied, it returns the first key's slot.
+*/
+function generateMultiWithNodes(redis, keys) {
+    const slot = calculateSlot(keys[0]);
+    const target = redis._groupsBySlot[slot];
+    for (let i = 1; i < keys.length; i++) {
+        if (redis._groupsBySlot[calculateSlot(keys[i])] !== target) {
+            return -1;
+        }
+    }
+    return slot;
+}
+class Pipeline extends Commander_1.default {
+    constructor(redis) {
+        super();
+        this.redis = redis;
+        this.isPipeline = true;
+        this.replyPending = 0;
+        this._queue = [];
+        this._result = [];
+        this._transactions = 0;
+        this._shaToScript = {};
+        this.isCluster =
+            this.redis.constructor.name === "Cluster" || this.redis.isCluster;
+        this.options = redis.options;
+        Object.keys(redis.scriptsSet).forEach((name) => {
+            const script = redis.scriptsSet[name];
+            this._shaToScript[script.sha] = script;
+            this[name] = redis[name];
+            this[name + "Buffer"] = redis[name + "Buffer"];
+        });
+        redis.addedBuiltinSet.forEach((name) => {
+            this[name] = redis[name];
+            this[name + "Buffer"] = redis[name + "Buffer"];
+        });
+        this.promise = new Promise((resolve, reject) => {
+            this.resolve = resolve;
+            this.reject = reject;
+        });
+        const _this = this;
+        Object.defineProperty(this, "length", {
+            get: function () {
+                return _this._queue.length;
+            },
+        });
+    }
+    fillResult(value, position) {
+        if (this._queue[position].name === "exec" && Array.isArray(value[1])) {
+            const execLength = value[1].length;
+            for (let i = 0; i < execLength; i++) {
+                if (value[1][i] instanceof Error) {
+                    continue;
+                }
+                const cmd = this._queue[position - (execLength - i)];
+                try {
+                    value[1][i] = cmd.transformReply(value[1][i]);
+                }
+                catch (err) {
+                    value[1][i] = err;
+                }
+            }
+        }
+        this._result[position] = value;
+        if (--this.replyPending) {
+            return;
+        }
+        if (this.isCluster) {
+            let retriable = true;
+            let commonError;
+            for (let i = 0; i < this._result.length; ++i) {
+                const error = this._result[i][0];
+                const command = this._queue[i];
+                if (error) {
+                    if (command.name === "exec" &&
+                        error.message ===
+                            "EXECABORT Transaction discarded because of previous errors.") {
+                        continue;
+                    }
+                    if (!commonError) {
+                        commonError = {
+                            name: error.name,
+                            message: error.message,
+                        };
+                    }
+                    else if (commonError.name !== error.name ||
+                        commonError.message !== error.message) {
+                        retriable = false;
+                        break;
+                    }
+                }
+                else if (!command.inTransaction) {
+                    const isReadOnly = (0, commands_1.exists)(command.name, { caseInsensitive: true }) &&
+                        (0, commands_1.hasFlag)(command.name, "readonly", { nameCaseInsensitive: true });
+                    if (!isReadOnly) {
+                        retriable = false;
+                        break;
+                    }
+                }
+            }
+            if (commonError && retriable) {
+                const _this = this;
+                const errv = commonError.message.split(" ");
+                const queue = this._queue;
+                let inTransaction = false;
+                this._queue = [];
+                for (let i = 0; i < queue.length; ++i) {
+                    if (errv[0] === "ASK" &&
+                        !inTransaction &&
+                        queue[i].name !== "asking" &&
+                        (!queue[i - 1] || queue[i - 1].name !== "asking")) {
+                        const asking = new Command_1.default("asking");
+                        asking.ignore = true;
+                        this.sendCommand(asking);
+                    }
+                    queue[i].initPromise();
+                    this.sendCommand(queue[i]);
+                    inTransaction = queue[i].inTransaction;
+                }
+                let matched = true;
+                if (typeof this.leftRedirections === "undefined") {
+                    this.leftRedirections = {};
+                }
+                const exec = function () {
+                    _this.exec();
+                };
+                const cluster = this.redis;
+                cluster.handleError(commonError, this.leftRedirections, {
+                    moved: function (_slot, key) {
+                        _this.preferKey = key;
+                        if (cluster.slots[errv[1]]) {
+                            if (cluster.slots[errv[1]][0] !== key) {
+                                cluster.slots[errv[1]] = [key];
+                            }
+                        }
+                        else {
+                            cluster.slots[errv[1]] = [key];
+                        }
+                        cluster._groupsBySlot[errv[1]] =
+                            cluster._groupsIds[cluster.slots[errv[1]].join(";")];
+                        cluster.refreshSlotsCache();
+                        _this.exec();
+                    },
+                    ask: function (_slot, key) {
+                        _this.preferKey = key;
+                        _this.exec();
+                    },
+                    tryagain: exec,
+                    clusterDown: exec,
+                    connectionClosed: exec,
+                    maxRedirections: () => {
+                        matched = false;
+                    },
+                    defaults: () => {
+                        matched = false;
+                    },
+                });
+                if (matched) {
+                    return;
+                }
+            }
+        }
+        let ignoredCount = 0;
+        for (let i = 0; i < this._queue.length - ignoredCount; ++i) {
+            if (this._queue[i + ignoredCount].ignore) {
+                ignoredCount += 1;
+            }
+            this._result[i] = this._result[i + ignoredCount];
+        }
+        this.resolve(this._result.slice(0, this._result.length - ignoredCount));
+    }
+    sendCommand(command) {
+        if (this._transactions > 0) {
+            command.inTransaction = true;
+        }
+        const position = this._queue.length;
+        command.pipelineIndex = position;
+        command.promise
+            .then((result) => {
+            this.fillResult([null, result], position);
+        })
+            .catch((error) => {
+            this.fillResult([error], position);
+        });
+        this._queue.push(command);
+        return this;
+    }
+    addBatch(commands) {
+        let command, commandName, args;
+        for (let i = 0; i < commands.length; ++i) {
+            command = commands[i];
+            commandName = command[0];
+            args = command.slice(1);
+            this[commandName].apply(this, args);
+        }
+        return this;
+    }
+}
+exports.default = Pipeline;
+// @ts-expect-error
+const multi = Pipeline.prototype.multi;
+// @ts-expect-error
+Pipeline.prototype.multi = function () {
+    this._transactions += 1;
+    return multi.apply(this, arguments);
+};
+// @ts-expect-error
+const execBuffer = Pipeline.prototype.execBuffer;
+// @ts-expect-error
+Pipeline.prototype.execBuffer = (0, util_1.deprecate)(function () {
+    if (this._transactions > 0) {
+        this._transactions -= 1;
+    }
+    return execBuffer.apply(this, arguments);
+}, "Pipeline#execBuffer: Use Pipeline#exec instead");
+// NOTE: To avoid an unhandled promise rejection, this will unconditionally always return this.promise,
+// which always has the rejection handled by standard-as-callback
+// adding the provided rejection callback.
+//
+// If a different promise instance were returned, that promise would cause its own unhandled promise rejection
+// errors, even if that promise unconditionally resolved to **the resolved value of** this.promise.
+Pipeline.prototype.exec = function (callback) {
+    // Wait for the cluster to be connected, since we need nodes information before continuing
+    if (this.isCluster && !this.redis.slots.length) {
+        if (this.redis.status === "wait")
+            this.redis.connect().catch(utils_1.noop);
+        if (callback && !this.nodeifiedPromise) {
+            this.nodeifiedPromise = true;
+            (0, standard_as_callback_1.default)(this.promise, callback);
+        }
+        this.redis.delayUntilReady((err) => {
+            if (err) {
+                this.reject(err);
+                return;
+            }
+            this.exec(callback);
+        });
+        return this.promise;
+    }
+    if (this._transactions > 0) {
+        this._transactions -= 1;
+        return execBuffer.apply(this, arguments);
+    }
+    if (!this.nodeifiedPromise) {
+        this.nodeifiedPromise = true;
+        (0, standard_as_callback_1.default)(this.promise, callback);
+    }
+    if (!this._queue.length) {
+        this.resolve([]);
+    }
+    let pipelineSlot;
+    if (this.isCluster) {
+        // List of the first key for each command
+        const sampleKeys = [];
+        for (let i = 0; i < this._queue.length; i++) {
+            const keys = this._queue[i].getKeys();
+            if (keys.length) {
+                sampleKeys.push(keys[0]);
+            }
+            // For each command, check that the keys belong to the same slot
+            if (keys.length && calculateSlot.generateMulti(keys) < 0) {
+                this.reject(new Error("All the keys in a pipeline command should belong to the same slot"));
+                return this.promise;
+            }
+        }
+        if (sampleKeys.length) {
+            pipelineSlot = generateMultiWithNodes(this.redis, sampleKeys);
+            if (pipelineSlot < 0) {
+                this.reject(new Error("All keys in the pipeline should belong to the same slots allocation group"));
+                return this.promise;
+            }
+        }
+        else {
+            // Send the pipeline to a random node
+            pipelineSlot = (Math.random() * 16384) | 0;
+        }
+    }
+    const _this = this;
+    execPipeline();
+    return this.promise;
+    function execPipeline() {
+        let writePending = (_this.replyPending = _this._queue.length);
+        let node;
+        if (_this.isCluster) {
+            node = {
+                slot: pipelineSlot,
+                redis: _this.redis.connectionPool.nodes.all[_this.preferKey],
+            };
+        }
+        let data = "";
+        let buffers;
+        const stream = {
+            isPipeline: true,
+            destination: _this.isCluster ? node : { redis: _this.redis },
+            write(writable) {
+                if (typeof writable !== "string") {
+                    if (!buffers) {
+                        buffers = [];
+                    }
+                    if (data) {
+                        buffers.push(Buffer.from(data, "utf8"));
+                        data = "";
+                    }
+                    buffers.push(writable);
+                }
+                else {
+                    if (data.length + writable.length >= buffer_1.constants.MAX_STRING_LENGTH) {
+                        if (!buffers) {
+                            buffers = [];
+                        }
+                        if (data) {
+                            buffers.push(Buffer.from(data, "utf8"));
+                            data = "";
+                        }
+                    }
+                    data += writable;
+                }
+                if (!--writePending) {
+                    if (buffers) {
+                        if (data) {
+                            buffers.push(Buffer.from(data, "utf8"));
+                        }
+                        stream.destination.redis.stream.write(Buffer.concat(buffers));
+                    }
+                    else {
+                        stream.destination.redis.stream.write(data);
+                    }
+                    // Reset writePending for resending
+                    writePending = _this._queue.length;
+                    data = "";
+                    buffers = undefined;
+                }
+            },
+        };
+        for (let i = 0; i < _this._queue.length; ++i) {
+            _this.redis.sendCommand(_this._queue[i], stream, node);
+        }
+        return _this.promise;
+    }
+};
diff --git a/node_modules/ioredis/built/Redis.d.ts b/node_modules/ioredis/built/Redis.d.ts
new file mode 100644
index 0000000..2b1f35e
--- /dev/null
+++ b/node_modules/ioredis/built/Redis.d.ts
@@ -0,0 +1,243 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import Cluster from "./cluster";
+import Command from "./Command";
+import { DataHandledable, FlushQueueOptions, Condition } from "./DataHandler";
+import { RedisOptions } from "./redis/RedisOptions";
+import ScanStream from "./ScanStream";
+import { Transaction } from "./transaction";
+import { Callback, CommandItem, NetStream, ScanStreamOptions, WriteableStream } from "./types";
+import { type BatchOperationContext } from "./tracing";
+import Commander from "./utils/Commander";
+import Deque = require("denque");
+declare type RedisStatus = "wait" | "reconnecting" | "connecting" | "connect" | "ready" | "close" | "end";
+/**
+ * This is the major component of ioredis.
+ * Use it to connect to a standalone Redis server or Sentinels.
+ *
+ * ```typescript
+ * const redis = new Redis(); // Default port is 6379
+ * async function main() {
+ *   redis.set("foo", "bar");
+ *   redis.get("foo", (err, result) => {
+ *     // `result` should be "bar"
+ *     console.log(err, result);
+ *   });
+ *   // Or use Promise
+ *   const result = await redis.get("foo");
+ * }
+ * ```
+ */
+declare class Redis extends Commander implements DataHandledable {
+    static Cluster: typeof Cluster;
+    static Command: typeof Command;
+    /**
+     * Default options
+     */
+    private static defaultOptions;
+    /**
+     * Create a Redis instance.
+     * This is the same as `new Redis()` but is included for compatibility with node-redis.
+     */
+    static createClient(...args: ConstructorParameters<typeof Redis>): Redis;
+    options: RedisOptions;
+    status: RedisStatus;
+    /**
+     * @ignore
+     */
+    stream: NetStream;
+    /**
+     * @ignore
+     */
+    isCluster: boolean;
+    /**
+     * @ignore
+     */
+    condition: Condition | null;
+    /**
+     * @ignore
+     */
+    commandQueue: Deque<CommandItem>;
+    private connector;
+    private reconnectTimeout;
+    private offlineQueue;
+    private connectionEpoch;
+    private retryAttempts;
+    private manuallyClosing;
+    private socketTimeoutTimer;
+    private _autoPipelines;
+    private _runningAutoPipelines;
+    constructor(port: number, host: string, options: RedisOptions);
+    constructor(path: string, options: RedisOptions);
+    constructor(port: number, options: RedisOptions);
+    constructor(port: number, host: string);
+    constructor(options: RedisOptions);
+    constructor(port: number);
+    constructor(path: string);
+    constructor();
+    get autoPipelineQueueSize(): number;
+    /**
+     * Create a connection to Redis.
+     * This method will be invoked automatically when creating a new Redis instance
+     * unless `lazyConnect: true` is passed.
+     *
+     * When calling this method manually, a Promise is returned, which will
+     * be resolved when the connection status is ready. The promise can reject
+     * if the connection fails, times out, or if Redis is already connecting/connected.
+     */
+    connect(callback?: Callback<void>): Promise<void>;
+    private _connect;
+    /**
+     * Disconnect from Redis.
+     *
+     * This method closes the connection immediately,
+     * and may lose some pending replies that haven't written to client.
+     * If you want to wait for the pending replies, use Redis#quit instead.
+     */
+    disconnect(reconnect?: boolean): void;
+    /**
+     * Disconnect from Redis.
+     *
+     * @deprecated
+     */
+    end(): void;
+    /**
+     * Create a new instance with the same options as the current one.
+     *
+     * @example
+     * ```js
+     * var redis = new Redis(6380);
+     * var anotherRedis = redis.duplicate();
+     * ```
+     */
+    duplicate(override?: Partial<RedisOptions>): Redis;
+    /**
+     * Mode of the connection.
+     *
+     * One of `"normal"`, `"subscriber"`, or `"monitor"`. When the connection is
+     * not in `"normal"` mode, certain commands are not allowed.
+     */
+    get mode(): "normal" | "subscriber" | "monitor";
+    /**
+     * Listen for all requests received by the server in real time.
+     *
+     * This command will create a new connection to Redis and send a
+     * MONITOR command via the new connection in order to avoid disturbing
+     * the current connection.
+     *
+     * @param callback The callback function. If omit, a promise will be returned.
+     * @example
+     * ```js
+     * var redis = new Redis();
+     * redis.monitor(function (err, monitor) {
+     *   // Entering monitoring mode.
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     *
+     * // supports promise as well as other commands
+     * redis.monitor().then(function (monitor) {
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     * ```
+     */
+    monitor(callback?: Callback<Redis>): Promise<Redis>;
+    /**
+     * Send a command to Redis
+     *
+     * This method is used internally and in most cases you should not
+     * use it directly. If you need to send a command that is not supported
+     * by the library, you can use the `call` method:
+     *
+     * ```js
+     * const redis = new Redis();
+     *
+     * redis.call('set', 'foo', 'bar');
+     * // or
+     * redis.call(['set', 'foo', 'bar']);
+     * ```
+     *
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream): unknown;
+    private getBlockingTimeoutInMs;
+    private getConfiguredBlockingTimeout;
+    private setSocketTimeout;
+    scanStream(options?: ScanStreamOptions): ScanStream;
+    scanBufferStream(options?: ScanStreamOptions): ScanStream;
+    sscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    sscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    /**
+     * Emit only when there's at least one listener.
+     *
+     * @ignore
+     */
+    silentEmit(eventName: string, arg?: unknown): boolean;
+    /**
+     * @ignore
+     */
+    recoverFromFatalError(_commandError: Error, err: Error, options: FlushQueueOptions): void;
+    /**
+     * @ignore
+     */
+    handleReconnection(err: Error, item: CommandItem): void;
+    /**
+     * @ignore
+     */
+    _getServerAddress(): {
+        address: string;
+        port: number | undefined;
+    };
+    private _buildCommandContext;
+    _buildBatchContext(batchSize: number): BatchOperationContext;
+    /**
+     * Get description of the connection. Used for debugging.
+     */
+    private _getDescription;
+    private resetCommandQueue;
+    private resetOfflineQueue;
+    private parseOptions;
+    /**
+     * Change instance's status
+     */
+    private setStatus;
+    private createScanStream;
+    /**
+     * Flush offline queue and command queue with error.
+     *
+     * @param error The error object to send to the commands
+     * @param options options
+     */
+    private flushQueue;
+    /**
+     * Check whether Redis has finished loading the persistent data and is able to
+     * process commands.
+     */
+    private _readyCheck;
+}
+interface Redis extends EventEmitter {
+    on(event: "message", cb: (channel: string, message: string) => void): this;
+    once(event: "message", cb: (channel: string, message: string) => void): this;
+    on(event: "messageBuffer", cb: (channel: Buffer, message: Buffer) => void): this;
+    once(event: "messageBuffer", cb: (channel: Buffer, message: Buffer) => void): this;
+    on(event: "pmessage", cb: (pattern: string, channel: string, message: string) => void): this;
+    once(event: "pmessage", cb: (pattern: string, channel: string, message: string) => void): this;
+    on(event: "pmessageBuffer", cb: (pattern: string, channel: Buffer, message: Buffer) => void): this;
+    once(event: "pmessageBuffer", cb: (pattern: string, channel: Buffer, message: Buffer) => void): this;
+    on(event: "error", cb: (error: Error) => void): this;
+    once(event: "error", cb: (error: Error) => void): this;
+    on(event: RedisStatus, cb: () => void): this;
+    once(event: RedisStatus, cb: () => void): this;
+    on(event: string | symbol, listener: (...args: any[]) => void): this;
+    once(event: string | symbol, listener: (...args: any[]) => void): this;
+}
+interface Redis extends Transaction {
+}
+export default Redis;
diff --git a/node_modules/ioredis/built/Redis.js b/node_modules/ioredis/built/Redis.js
new file mode 100644
index 0000000..30c5b45
--- /dev/null
+++ b/node_modules/ioredis/built/Redis.js
@@ -0,0 +1,800 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const events_1 = require("events");
+const standard_as_callback_1 = require("standard-as-callback");
+const cluster_1 = require("./cluster");
+const Command_1 = require("./Command");
+const connectors_1 = require("./connectors");
+const SentinelConnector_1 = require("./connectors/SentinelConnector");
+const eventHandler = require("./redis/event_handler");
+const RedisOptions_1 = require("./redis/RedisOptions");
+const ScanStream_1 = require("./ScanStream");
+const transaction_1 = require("./transaction");
+const utils_1 = require("./utils");
+const tracing_1 = require("./tracing");
+const applyMixin_1 = require("./utils/applyMixin");
+const Commander_1 = require("./utils/Commander");
+const lodash_1 = require("./utils/lodash");
+const Deque = require("denque");
+const debug = (0, utils_1.Debug)("redis");
+/**
+ * This is the major component of ioredis.
+ * Use it to connect to a standalone Redis server or Sentinels.
+ *
+ * ```typescript
+ * const redis = new Redis(); // Default port is 6379
+ * async function main() {
+ *   redis.set("foo", "bar");
+ *   redis.get("foo", (err, result) => {
+ *     // `result` should be "bar"
+ *     console.log(err, result);
+ *   });
+ *   // Or use Promise
+ *   const result = await redis.get("foo");
+ * }
+ * ```
+ */
+class Redis extends Commander_1.default {
+    constructor(arg1, arg2, arg3) {
+        super();
+        this.status = "wait";
+        /**
+         * @ignore
+         */
+        this.isCluster = false;
+        this.reconnectTimeout = null;
+        this.connectionEpoch = 0;
+        this.retryAttempts = 0;
+        this.manuallyClosing = false;
+        // Prepare autopipelines structures
+        this._autoPipelines = new Map();
+        this._runningAutoPipelines = new Set();
+        this.parseOptions(arg1, arg2, arg3);
+        events_1.EventEmitter.call(this);
+        this.resetCommandQueue();
+        this.resetOfflineQueue();
+        if (this.options.Connector) {
+            this.connector = new this.options.Connector(this.options);
+        }
+        else if (this.options.sentinels) {
+            const sentinelConnector = new SentinelConnector_1.default(this.options);
+            sentinelConnector.emitter = this;
+            this.connector = sentinelConnector;
+        }
+        else {
+            this.connector = new connectors_1.StandaloneConnector(this.options);
+        }
+        if (this.options.scripts) {
+            Object.entries(this.options.scripts).forEach(([name, definition]) => {
+                this.defineCommand(name, definition);
+            });
+        }
+        // end(or wait) -> connecting -> connect -> ready -> end
+        if (this.options.lazyConnect) {
+            this.setStatus("wait");
+        }
+        else {
+            this.connect().catch(lodash_1.noop);
+        }
+    }
+    /**
+     * Create a Redis instance.
+     * This is the same as `new Redis()` but is included for compatibility with node-redis.
+     */
+    static createClient(...args) {
+        return new Redis(...args);
+    }
+    get autoPipelineQueueSize() {
+        let queued = 0;
+        for (const pipeline of this._autoPipelines.values()) {
+            queued += pipeline.length;
+        }
+        return queued;
+    }
+    /**
+     * Create a connection to Redis.
+     * This method will be invoked automatically when creating a new Redis instance
+     * unless `lazyConnect: true` is passed.
+     *
+     * When calling this method manually, a Promise is returned, which will
+     * be resolved when the connection status is ready. The promise can reject
+     * if the connection fails, times out, or if Redis is already connecting/connected.
+     */
+    connect(callback) {
+        const promise = (0, tracing_1.traceConnect)(() => this._connect(), () => {
+            const { address, port } = this._getServerAddress();
+            return {
+                serverAddress: address,
+                serverPort: port,
+                connectionEpoch: this.connectionEpoch,
+            };
+        });
+        return (0, standard_as_callback_1.default)(promise, callback);
+    }
+    _connect() {
+        return new Promise((resolve, reject) => {
+            if (this.status === "connecting" ||
+                this.status === "connect" ||
+                this.status === "ready") {
+                reject(new Error("Redis is already connecting/connected"));
+                return;
+            }
+            this.connectionEpoch += 1;
+            this.setStatus("connecting");
+            const { options } = this;
+            this.condition = {
+                select: options.db,
+                auth: options.username
+                    ? [options.username, options.password]
+                    : options.password,
+                subscriber: false,
+            };
+            const _this = this;
+            (0, standard_as_callback_1.default)(this.connector.connect(function (type, err) {
+                _this.silentEmit(type, err);
+            }), function (err, stream) {
+                if (err) {
+                    _this.flushQueue(err);
+                    _this.silentEmit("error", err);
+                    reject(err);
+                    _this.setStatus("end");
+                    return;
+                }
+                let CONNECT_EVENT = options.tls ? "secureConnect" : "connect";
+                if ("sentinels" in options &&
+                    options.sentinels &&
+                    !options.enableTLSForSentinelMode) {
+                    CONNECT_EVENT = "connect";
+                }
+                _this.stream = stream;
+                if (options.noDelay) {
+                    stream.setNoDelay(true);
+                }
+                // Node ignores setKeepAlive before connect, therefore we wait for the event:
+                // https://github.com/nodejs/node/issues/31663
+                if (typeof options.keepAlive === "number") {
+                    if (stream.connecting) {
+                        stream.once(CONNECT_EVENT, () => {
+                            stream.setKeepAlive(true, options.keepAlive);
+                        });
+                    }
+                    else {
+                        stream.setKeepAlive(true, options.keepAlive);
+                    }
+                }
+                if (stream.connecting) {
+                    stream.once(CONNECT_EVENT, eventHandler.connectHandler(_this));
+                    if (options.connectTimeout) {
+                        /*
+                         * Typically, Socket#setTimeout(0) will clear the timer
+                         * set before. However, in some platforms (Electron 3.x~4.x),
+                         * the timer will not be cleared. So we introduce a variable here.
+                         *
+                         * See https://github.com/electron/electron/issues/14915
+                         */
+                        let connectTimeoutCleared = false;
+                        stream.setTimeout(options.connectTimeout, function () {
+                            if (connectTimeoutCleared) {
+                                return;
+                            }
+                            stream.setTimeout(0);
+                            stream.destroy();
+                            const err = new Error("connect ETIMEDOUT");
+                            // @ts-expect-error
+                            err.errorno = "ETIMEDOUT";
+                            // @ts-expect-error
+                            err.code = "ETIMEDOUT";
+                            // @ts-expect-error
+                            err.syscall = "connect";
+                            eventHandler.errorHandler(_this)(err);
+                        });
+                        stream.once(CONNECT_EVENT, function () {
+                            connectTimeoutCleared = true;
+                            stream.setTimeout(0);
+                        });
+                    }
+                }
+                else if (stream.destroyed) {
+                    const firstError = _this.connector.firstError;
+                    if (firstError) {
+                        process.nextTick(() => {
+                            eventHandler.errorHandler(_this)(firstError);
+                        });
+                    }
+                    process.nextTick(eventHandler.closeHandler(_this));
+                }
+                else {
+                    process.nextTick(eventHandler.connectHandler(_this));
+                }
+                if (!stream.destroyed) {
+                    stream.once("error", eventHandler.errorHandler(_this));
+                    stream.once("close", eventHandler.closeHandler(_this));
+                }
+                const connectionReadyHandler = function () {
+                    _this.removeListener("close", connectionCloseHandler);
+                    resolve();
+                };
+                var connectionCloseHandler = function () {
+                    _this.removeListener("ready", connectionReadyHandler);
+                    reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+                };
+                _this.once("ready", connectionReadyHandler);
+                _this.once("close", connectionCloseHandler);
+            });
+        });
+    }
+    /**
+     * Disconnect from Redis.
+     *
+     * This method closes the connection immediately,
+     * and may lose some pending replies that haven't written to client.
+     * If you want to wait for the pending replies, use Redis#quit instead.
+     */
+    disconnect(reconnect = false) {
+        if (!reconnect) {
+            this.manuallyClosing = true;
+        }
+        if (this.reconnectTimeout && !reconnect) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+        }
+        if (this.status === "wait") {
+            eventHandler.closeHandler(this)();
+        }
+        else {
+            this.connector.disconnect();
+        }
+    }
+    /**
+     * Disconnect from Redis.
+     *
+     * @deprecated
+     */
+    end() {
+        this.disconnect();
+    }
+    /**
+     * Create a new instance with the same options as the current one.
+     *
+     * @example
+     * ```js
+     * var redis = new Redis(6380);
+     * var anotherRedis = redis.duplicate();
+     * ```
+     */
+    duplicate(override) {
+        return new Redis({ ...this.options, ...override });
+    }
+    /**
+     * Mode of the connection.
+     *
+     * One of `"normal"`, `"subscriber"`, or `"monitor"`. When the connection is
+     * not in `"normal"` mode, certain commands are not allowed.
+     */
+    get mode() {
+        var _a;
+        return this.options.monitor
+            ? "monitor"
+            : ((_a = this.condition) === null || _a === void 0 ? void 0 : _a.subscriber)
+                ? "subscriber"
+                : "normal";
+    }
+    /**
+     * Listen for all requests received by the server in real time.
+     *
+     * This command will create a new connection to Redis and send a
+     * MONITOR command via the new connection in order to avoid disturbing
+     * the current connection.
+     *
+     * @param callback The callback function. If omit, a promise will be returned.
+     * @example
+     * ```js
+     * var redis = new Redis();
+     * redis.monitor(function (err, monitor) {
+     *   // Entering monitoring mode.
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     *
+     * // supports promise as well as other commands
+     * redis.monitor().then(function (monitor) {
+     *   monitor.on('monitor', function (time, args, source, database) {
+     *     console.log(time + ": " + util.inspect(args));
+     *   });
+     * });
+     * ```
+     */
+    monitor(callback) {
+        const monitorInstance = this.duplicate({
+            monitor: true,
+            lazyConnect: false,
+        });
+        return (0, standard_as_callback_1.default)(new Promise(function (resolve, reject) {
+            monitorInstance.once("error", reject);
+            monitorInstance.once("monitoring", function () {
+                resolve(monitorInstance);
+            });
+        }), callback);
+    }
+    /**
+     * Send a command to Redis
+     *
+     * This method is used internally and in most cases you should not
+     * use it directly. If you need to send a command that is not supported
+     * by the library, you can use the `call` method:
+     *
+     * ```js
+     * const redis = new Redis();
+     *
+     * redis.call('set', 'foo', 'bar');
+     * // or
+     * redis.call(['set', 'foo', 'bar']);
+     * ```
+     *
+     * @ignore
+     */
+    sendCommand(command, stream) {
+        var _a, _b;
+        if (this.status === "wait") {
+            this.connect().catch(lodash_1.noop);
+        }
+        if (this.status === "end") {
+            command.reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+            return command.promise;
+        }
+        if (((_a = this.condition) === null || _a === void 0 ? void 0 : _a.subscriber) &&
+            !Command_1.default.checkFlag("VALID_IN_SUBSCRIBER_MODE", command.name)) {
+            command.reject(new Error("Connection in subscriber mode, only subscriber commands may be used"));
+            return command.promise;
+        }
+        if (typeof this.options.commandTimeout === "number") {
+            command.setTimeout(this.options.commandTimeout);
+        }
+        const blockingTimeout = this.getBlockingTimeoutInMs(command);
+        let writable = this.status === "ready" ||
+            (!stream &&
+                this.status === "connect" &&
+                (0, commands_1.exists)(command.name, { caseInsensitive: true }) &&
+                ((0, commands_1.hasFlag)(command.name, "loading", { nameCaseInsensitive: true }) ||
+                    Command_1.default.checkFlag("HANDSHAKE_COMMANDS", command.name)));
+        if (!this.stream) {
+            writable = false;
+        }
+        else if (!this.stream.writable) {
+            writable = false;
+            // @ts-expect-error
+        }
+        else if (this.stream._writableState && this.stream._writableState.ended) {
+            // TODO: We should be able to remove this as the PR has already been merged.
+            // https://github.com/iojs/io.js/pull/1217
+            writable = false;
+        }
+        if (!writable) {
+            if (!this.options.enableOfflineQueue) {
+                command.reject(new Error("Stream isn't writeable and enableOfflineQueue options is false"));
+                return command.promise;
+            }
+            if (command.name === "quit" && this.offlineQueue.length === 0) {
+                this.disconnect();
+                command.resolve(Buffer.from("OK"));
+                return command.promise;
+            }
+            // @ts-expect-error
+            if (debug.enabled) {
+                debug("queue command[%s]: %d -> %s(%o)", this._getDescription(), this.condition.select, command.name, command.args);
+            }
+            this.offlineQueue.push({
+                command: command,
+                stream: stream,
+                select: this.condition.select,
+            });
+            // For blocking commands in the offline queue, arm a client-side timeout
+            // only when blockingTimeout is configured. Without this option, queued
+            // blocking commands may wait indefinitely on a dead connection.
+            if (Command_1.default.checkFlag("BLOCKING_COMMANDS", command.name)) {
+                const offlineTimeout = this.getConfiguredBlockingTimeout();
+                if (offlineTimeout !== undefined) {
+                    command.setBlockingTimeout(offlineTimeout);
+                }
+            }
+        }
+        else {
+            // @ts-expect-error
+            if (debug.enabled) {
+                debug("write command[%s]: %d -> %s(%o)", this._getDescription(), (_b = this.condition) === null || _b === void 0 ? void 0 : _b.select, command.name, command.args);
+            }
+            if (stream) {
+                if ("isPipeline" in stream && stream.isPipeline) {
+                    stream.write(command.toWritable(stream.destination.redis.stream));
+                }
+                else {
+                    stream.write(command.toWritable(stream));
+                }
+            }
+            else {
+                this.stream.write(command.toWritable(this.stream));
+            }
+            this.commandQueue.push({
+                command: command,
+                stream: stream,
+                select: this.condition.select,
+            });
+            if (blockingTimeout !== undefined) {
+                command.setBlockingTimeout(blockingTimeout);
+            }
+            if (Command_1.default.checkFlag("WILL_DISCONNECT", command.name)) {
+                this.manuallyClosing = true;
+            }
+            if (this.options.socketTimeout !== undefined &&
+                this.socketTimeoutTimer === undefined) {
+                this.setSocketTimeout();
+            }
+        }
+        if (command.name === "select" && (0, utils_1.isInt)(command.args[0])) {
+            const db = parseInt(command.args[0], 10);
+            if (this.condition.select !== db) {
+                this.condition.select = db;
+                this.emit("select", db);
+                debug("switch to db [%d]", this.condition.select);
+            }
+        }
+        if (!writable || command.isTraced) {
+            return command.promise;
+        }
+        // Trace on the write path only, and only once per command. Commands may
+        // pass through sendCommand multiple times (offline queue flush,
+        // prevCommandQueue resend after reconnect). The isTraced flag ensures
+        // we don't emit duplicate trace events.
+        command.isTraced = true;
+        return (0, tracing_1.traceCommand)(() => command.promise, () => this._buildCommandContext(command));
+    }
+    getBlockingTimeoutInMs(command) {
+        var _a;
+        if (!Command_1.default.checkFlag("BLOCKING_COMMANDS", command.name)) {
+            return undefined;
+        }
+        // Feature is opt-in: only enabled when blockingTimeout is set to a positive number
+        const configuredTimeout = this.getConfiguredBlockingTimeout();
+        if (configuredTimeout === undefined) {
+            return undefined;
+        }
+        const timeout = command.extractBlockingTimeout();
+        if (typeof timeout === "number") {
+            if (timeout > 0) {
+                // Finite timeout from command args - add grace period
+                return (timeout +
+                    ((_a = this.options.blockingTimeoutGrace) !== null && _a !== void 0 ? _a : RedisOptions_1.DEFAULT_REDIS_OPTIONS.blockingTimeoutGrace));
+            }
+            // Command has timeout=0 (block forever), use blockingTimeout option as safety net
+            return configuredTimeout;
+        }
+        if (timeout === null) {
+            // No BLOCK option found (e.g., XREAD without BLOCK), use blockingTimeout as safety net
+            return configuredTimeout;
+        }
+        return undefined;
+    }
+    getConfiguredBlockingTimeout() {
+        if (typeof this.options.blockingTimeout === "number" &&
+            this.options.blockingTimeout > 0) {
+            return this.options.blockingTimeout;
+        }
+        return undefined;
+    }
+    setSocketTimeout() {
+        this.socketTimeoutTimer = setTimeout(() => {
+            this.stream.destroy(new Error(`Socket timeout. Expecting data, but didn't receive any in ${this.options.socketTimeout}ms.`));
+            this.socketTimeoutTimer = undefined;
+        }, this.options.socketTimeout);
+        // this handler must run after the "data" handler in "DataHandler"
+        // so that `this.commandQueue.length` will be updated
+        this.stream.once("data", () => {
+            clearTimeout(this.socketTimeoutTimer);
+            this.socketTimeoutTimer = undefined;
+            if (this.commandQueue.length === 0)
+                return;
+            this.setSocketTimeout();
+        });
+    }
+    scanStream(options) {
+        return this.createScanStream("scan", { options });
+    }
+    scanBufferStream(options) {
+        return this.createScanStream("scanBuffer", { options });
+    }
+    sscanStream(key, options) {
+        return this.createScanStream("sscan", { key, options });
+    }
+    sscanBufferStream(key, options) {
+        return this.createScanStream("sscanBuffer", { key, options });
+    }
+    hscanStream(key, options) {
+        return this.createScanStream("hscan", { key, options });
+    }
+    hscanBufferStream(key, options) {
+        return this.createScanStream("hscanBuffer", { key, options });
+    }
+    zscanStream(key, options) {
+        return this.createScanStream("zscan", { key, options });
+    }
+    zscanBufferStream(key, options) {
+        return this.createScanStream("zscanBuffer", { key, options });
+    }
+    /**
+     * Emit only when there's at least one listener.
+     *
+     * @ignore
+     */
+    silentEmit(eventName, arg) {
+        let error;
+        if (eventName === "error") {
+            error = arg;
+            if (this.status === "end") {
+                return;
+            }
+            if (this.manuallyClosing) {
+                // ignore connection related errors when manually disconnecting
+                if (error instanceof Error &&
+                    (error.message === utils_1.CONNECTION_CLOSED_ERROR_MSG ||
+                        // @ts-expect-error
+                        error.syscall === "connect" ||
+                        // @ts-expect-error
+                        error.syscall === "read")) {
+                    return;
+                }
+            }
+        }
+        if (this.listeners(eventName).length > 0) {
+            return this.emit.apply(this, arguments);
+        }
+        if (error && error instanceof Error) {
+            console.error("[ioredis] Unhandled error event:", error.stack);
+        }
+        return false;
+    }
+    /**
+     * @ignore
+     */
+    recoverFromFatalError(_commandError, err, options) {
+        this.flushQueue(err, options);
+        this.silentEmit("error", err);
+        this.disconnect(true);
+    }
+    /**
+     * @ignore
+     */
+    handleReconnection(err, item) {
+        var _a;
+        let needReconnect = false;
+        if (this.options.reconnectOnError &&
+            !Command_1.default.checkFlag("IGNORE_RECONNECT_ON_ERROR", item.command.name)) {
+            needReconnect = this.options.reconnectOnError(err);
+        }
+        switch (needReconnect) {
+            case 1:
+            case true:
+                if (this.status !== "reconnecting") {
+                    this.disconnect(true);
+                }
+                item.command.reject(err);
+                break;
+            case 2:
+                if (this.status !== "reconnecting") {
+                    this.disconnect(true);
+                }
+                if (((_a = this.condition) === null || _a === void 0 ? void 0 : _a.select) !== item.select &&
+                    item.command.name !== "select") {
+                    this.select(item.select);
+                }
+                // TODO
+                // @ts-expect-error
+                this.sendCommand(item.command);
+                break;
+            default:
+                item.command.reject(err);
+        }
+    }
+    /**
+     * @ignore
+     */
+    _getServerAddress() {
+        if ("path" in this.options && this.options.path) {
+            return { address: this.options.path, port: undefined };
+        }
+        return {
+            address: ("host" in this.options && this.options.host) || "localhost",
+            port: ("port" in this.options && this.options.port) || 6379,
+        };
+    }
+    _buildCommandContext(command) {
+        var _a, _b, _c;
+        const { address, port } = this._getServerAddress();
+        return {
+            command: command.name,
+            args: (0, tracing_1.sanitizeArgs)(command.name, command.args),
+            database: (_c = (_b = (_a = this.condition) === null || _a === void 0 ? void 0 : _a.select) !== null && _b !== void 0 ? _b : this.options.db) !== null && _c !== void 0 ? _c : 0,
+            serverAddress: address,
+            serverPort: port,
+        };
+    }
+    _buildBatchContext(batchSize) {
+        var _a, _b, _c;
+        const { address, port } = this._getServerAddress();
+        return {
+            batchMode: "MULTI",
+            batchSize,
+            database: (_c = (_b = (_a = this.condition) === null || _a === void 0 ? void 0 : _a.select) !== null && _b !== void 0 ? _b : this.options.db) !== null && _c !== void 0 ? _c : 0,
+            serverAddress: address,
+            serverPort: port,
+        };
+    }
+    /**
+     * Get description of the connection. Used for debugging.
+     */
+    _getDescription() {
+        let description;
+        if ("path" in this.options && this.options.path) {
+            description = this.options.path;
+        }
+        else if (this.stream &&
+            this.stream.remoteAddress &&
+            this.stream.remotePort) {
+            description = this.stream.remoteAddress + ":" + this.stream.remotePort;
+        }
+        else if ("host" in this.options && this.options.host) {
+            description = this.options.host + ":" + this.options.port;
+        }
+        else {
+            // Unexpected
+            description = "";
+        }
+        if (this.options.connectionName) {
+            description += ` (${this.options.connectionName})`;
+        }
+        return description;
+    }
+    resetCommandQueue() {
+        this.commandQueue = new Deque();
+    }
+    resetOfflineQueue() {
+        this.offlineQueue = new Deque();
+    }
+    parseOptions(...args) {
+        const options = {};
+        let isTls = false;
+        for (let i = 0; i < args.length; ++i) {
+            const arg = args[i];
+            if (arg === null || typeof arg === "undefined") {
+                continue;
+            }
+            if (typeof arg === "object") {
+                (0, lodash_1.defaults)(options, arg);
+            }
+            else if (typeof arg === "string") {
+                (0, lodash_1.defaults)(options, (0, utils_1.parseURL)(arg));
+                if (arg.startsWith("rediss://")) {
+                    isTls = true;
+                }
+            }
+            else if (typeof arg === "number") {
+                options.port = arg;
+            }
+            else {
+                throw new Error("Invalid argument " + arg);
+            }
+        }
+        if (isTls) {
+            (0, lodash_1.defaults)(options, { tls: true });
+        }
+        (0, lodash_1.defaults)(options, Redis.defaultOptions);
+        if (typeof options.port === "string") {
+            options.port = parseInt(options.port, 10);
+        }
+        if (typeof options.db === "string") {
+            options.db = parseInt(options.db, 10);
+        }
+        // @ts-expect-error
+        this.options = (0, utils_1.resolveTLSProfile)(options);
+    }
+    /**
+     * Change instance's status
+     */
+    setStatus(status, arg) {
+        // @ts-expect-error
+        if (debug.enabled) {
+            debug("status[%s]: %s -> %s", this._getDescription(), this.status || "[empty]", status);
+        }
+        this.status = status;
+        process.nextTick(this.emit.bind(this, status, arg));
+    }
+    createScanStream(command, { key, options = {} }) {
+        return new ScanStream_1.default({
+            objectMode: true,
+            key: key,
+            redis: this,
+            command: command,
+            ...options,
+        });
+    }
+    /**
+     * Flush offline queue and command queue with error.
+     *
+     * @param error The error object to send to the commands
+     * @param options options
+     */
+    flushQueue(error, options) {
+        options = (0, lodash_1.defaults)({}, options, {
+            offlineQueue: true,
+            commandQueue: true,
+        });
+        let item;
+        if (options.offlineQueue) {
+            while ((item = this.offlineQueue.shift())) {
+                item.command.reject(error);
+            }
+        }
+        if (options.commandQueue) {
+            if (this.commandQueue.length > 0) {
+                if (this.stream) {
+                    this.stream.removeAllListeners("data");
+                }
+                while ((item = this.commandQueue.shift())) {
+                    item.command.reject(error);
+                }
+            }
+        }
+    }
+    /**
+     * Check whether Redis has finished loading the persistent data and is able to
+     * process commands.
+     */
+    _readyCheck(callback) {
+        const _this = this;
+        this.info(function (err, res) {
+            if (err) {
+                if (err.message && err.message.includes("NOPERM")) {
+                    console.warn(`Skipping the ready check because INFO command fails: "${err.message}". You can disable ready check with "enableReadyCheck". More: https://github.com/luin/ioredis/wiki/Disable-ready-check.`);
+                    return callback(null, {});
+                }
+                return callback(err);
+            }
+            if (typeof res !== "string") {
+                return callback(null, res);
+            }
+            const info = {};
+            const lines = res.split("\r\n");
+            for (let i = 0; i < lines.length; ++i) {
+                const [fieldName, ...fieldValueParts] = lines[i].split(":");
+                const fieldValue = fieldValueParts.join(":");
+                if (fieldValue) {
+                    info[fieldName] = fieldValue;
+                }
+            }
+            if (!info.loading || info.loading === "0") {
+                callback(null, info);
+            }
+            else {
+                const loadingEtaMs = (info.loading_eta_seconds || 1) * 1000;
+                const retryTime = _this.options.maxLoadingRetryTime &&
+                    _this.options.maxLoadingRetryTime < loadingEtaMs
+                    ? _this.options.maxLoadingRetryTime
+                    : loadingEtaMs;
+                debug("Redis server still loading, trying again in " + retryTime + "ms");
+                setTimeout(function () {
+                    _this._readyCheck(callback);
+                }, retryTime);
+            }
+        }).catch(lodash_1.noop);
+    }
+}
+Redis.Cluster = cluster_1.default;
+Redis.Command = Command_1.default;
+/**
+ * Default options
+ */
+Redis.defaultOptions = RedisOptions_1.DEFAULT_REDIS_OPTIONS;
+(0, applyMixin_1.default)(Redis, events_1.EventEmitter);
+(0, transaction_1.addTransactionSupport)(Redis.prototype);
+exports.default = Redis;
diff --git a/node_modules/ioredis/built/ScanStream.d.ts b/node_modules/ioredis/built/ScanStream.d.ts
new file mode 100644
index 0000000..38c3803
--- /dev/null
+++ b/node_modules/ioredis/built/ScanStream.d.ts
@@ -0,0 +1,23 @@
+/// <reference types="node" />
+import { Readable, ReadableOptions } from "stream";
+interface Options extends ReadableOptions {
+    key?: string;
+    match?: string;
+    type?: string;
+    command: string;
+    redis: any;
+    count?: string | number;
+    noValues?: boolean;
+}
+/**
+ * Convenient class to convert the process of scanning keys to a readable stream.
+ */
+export default class ScanStream extends Readable {
+    private opt;
+    private _redisCursor;
+    private _redisDrained;
+    constructor(opt: Options);
+    _read(): void;
+    close(): void;
+}
+export {};
diff --git a/node_modules/ioredis/built/ScanStream.js b/node_modules/ioredis/built/ScanStream.js
new file mode 100644
index 0000000..3abecaf
--- /dev/null
+++ b/node_modules/ioredis/built/ScanStream.js
@@ -0,0 +1,51 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const stream_1 = require("stream");
+/**
+ * Convenient class to convert the process of scanning keys to a readable stream.
+ */
+class ScanStream extends stream_1.Readable {
+    constructor(opt) {
+        super(opt);
+        this.opt = opt;
+        this._redisCursor = "0";
+        this._redisDrained = false;
+    }
+    _read() {
+        if (this._redisDrained) {
+            this.push(null);
+            return;
+        }
+        const args = [this._redisCursor];
+        if (this.opt.key) {
+            args.unshift(this.opt.key);
+        }
+        if (this.opt.match) {
+            args.push("MATCH", this.opt.match);
+        }
+        if (this.opt.type) {
+            args.push("TYPE", this.opt.type);
+        }
+        if (this.opt.count) {
+            args.push("COUNT", String(this.opt.count));
+        }
+        if (this.opt.noValues) {
+            args.push("NOVALUES");
+        }
+        this.opt.redis[this.opt.command](args, (err, res) => {
+            if (err) {
+                this.emit("error", err);
+                return;
+            }
+            this._redisCursor = res[0] instanceof Buffer ? res[0].toString() : res[0];
+            if (this._redisCursor === "0") {
+                this._redisDrained = true;
+            }
+            this.push(res[1]);
+        });
+    }
+    close() {
+        this._redisDrained = true;
+    }
+}
+exports.default = ScanStream;
diff --git a/node_modules/ioredis/built/Script.d.ts b/node_modules/ioredis/built/Script.d.ts
new file mode 100644
index 0000000..b17f4d8
--- /dev/null
+++ b/node_modules/ioredis/built/Script.d.ts
@@ -0,0 +1,11 @@
+import { Callback } from "./types";
+export default class Script {
+    private lua;
+    private numberOfKeys;
+    private keyPrefix;
+    private readOnly;
+    private sha;
+    private Command;
+    constructor(lua: string, numberOfKeys?: number | null, keyPrefix?: string, readOnly?: boolean);
+    execute(container: any, args: any[], options: any, callback?: Callback): any;
+}
diff --git a/node_modules/ioredis/built/Script.js b/node_modules/ioredis/built/Script.js
new file mode 100644
index 0000000..34ea485
--- /dev/null
+++ b/node_modules/ioredis/built/Script.js
@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const crypto_1 = require("crypto");
+const Command_1 = require("./Command");
+const standard_as_callback_1 = require("standard-as-callback");
+class Script {
+    constructor(lua, numberOfKeys = null, keyPrefix = "", readOnly = false) {
+        this.lua = lua;
+        this.numberOfKeys = numberOfKeys;
+        this.keyPrefix = keyPrefix;
+        this.readOnly = readOnly;
+        this.sha = (0, crypto_1.createHash)("sha1").update(lua).digest("hex");
+        const sha = this.sha;
+        const socketHasScriptLoaded = new WeakSet();
+        this.Command = class CustomScriptCommand extends Command_1.default {
+            toWritable(socket) {
+                const origReject = this.reject;
+                this.reject = (err) => {
+                    if (err.message.indexOf("NOSCRIPT") !== -1) {
+                        socketHasScriptLoaded.delete(socket);
+                    }
+                    origReject.call(this, err);
+                };
+                if (!socketHasScriptLoaded.has(socket)) {
+                    socketHasScriptLoaded.add(socket);
+                    this.name = "eval";
+                    this.args[0] = lua;
+                }
+                else if (this.name === "eval") {
+                    this.name = "evalsha";
+                    this.args[0] = sha;
+                }
+                return super.toWritable(socket);
+            }
+        };
+    }
+    execute(container, args, options, callback) {
+        if (typeof this.numberOfKeys === "number") {
+            args.unshift(this.numberOfKeys);
+        }
+        if (this.keyPrefix) {
+            options.keyPrefix = this.keyPrefix;
+        }
+        if (this.readOnly) {
+            options.readOnly = true;
+        }
+        const evalsha = new this.Command("evalsha", [this.sha, ...args], options);
+        evalsha.promise = evalsha.promise.catch((err) => {
+            if (err.message.indexOf("NOSCRIPT") === -1) {
+                throw err;
+            }
+            // Resend the same custom evalsha command that gets transformed
+            // to an eval in case it's not loaded yet on the connection.
+            const resend = new this.Command("evalsha", [this.sha, ...args], options);
+            const client = container.isPipeline ? container.redis : container;
+            return client.sendCommand(resend);
+        });
+        (0, standard_as_callback_1.default)(evalsha.promise, callback);
+        return container.sendCommand(evalsha);
+    }
+}
+exports.default = Script;
diff --git a/node_modules/ioredis/built/SubscriptionSet.d.ts b/node_modules/ioredis/built/SubscriptionSet.d.ts
new file mode 100644
index 0000000..2b5c7cc
--- /dev/null
+++ b/node_modules/ioredis/built/SubscriptionSet.d.ts
@@ -0,0 +1,14 @@
+import { CommandNameFlags } from "./Command";
+declare type AddSet = CommandNameFlags["ENTER_SUBSCRIBER_MODE"][number];
+declare type DelSet = CommandNameFlags["EXIT_SUBSCRIBER_MODE"][number];
+/**
+ * Tiny class to simplify dealing with subscription set
+ */
+export default class SubscriptionSet {
+    private set;
+    add(set: AddSet, channel: string): void;
+    del(set: DelSet, channel: string): void;
+    channels(set: AddSet | DelSet): string[];
+    isEmpty(): boolean;
+}
+export {};
diff --git a/node_modules/ioredis/built/SubscriptionSet.js b/node_modules/ioredis/built/SubscriptionSet.js
new file mode 100644
index 0000000..df39e61
--- /dev/null
+++ b/node_modules/ioredis/built/SubscriptionSet.js
@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Tiny class to simplify dealing with subscription set
+ */
+class SubscriptionSet {
+    constructor() {
+        this.set = {
+            subscribe: {},
+            psubscribe: {},
+            ssubscribe: {},
+        };
+    }
+    add(set, channel) {
+        this.set[mapSet(set)][channel] = true;
+    }
+    del(set, channel) {
+        delete this.set[mapSet(set)][channel];
+    }
+    channels(set) {
+        return Object.keys(this.set[mapSet(set)]);
+    }
+    isEmpty() {
+        return (this.channels("subscribe").length === 0 &&
+            this.channels("psubscribe").length === 0 &&
+            this.channels("ssubscribe").length === 0);
+    }
+}
+exports.default = SubscriptionSet;
+function mapSet(set) {
+    if (set === "unsubscribe") {
+        return "subscribe";
+    }
+    if (set === "punsubscribe") {
+        return "psubscribe";
+    }
+    if (set === "sunsubscribe") {
+        return "ssubscribe";
+    }
+    return set;
+}
diff --git a/node_modules/ioredis/built/autoPipelining.d.ts b/node_modules/ioredis/built/autoPipelining.d.ts
new file mode 100644
index 0000000..64505fc
--- /dev/null
+++ b/node_modules/ioredis/built/autoPipelining.d.ts
@@ -0,0 +1,8 @@
+/// <reference types="node" />
+import { ArgumentType } from "./Command";
+export declare const kExec: unique symbol;
+export declare const kCallbacks: unique symbol;
+export declare const notAllowedAutoPipelineCommands: string[];
+export declare function shouldUseAutoPipelining(client: any, functionName: string, commandName: string): boolean;
+export declare function getFirstValueInFlattenedArray(args: ArgumentType[]): string | Buffer | number | null | undefined;
+export declare function executeWithAutoPipelining(client: any, functionName: string, commandName: string, args: ArgumentType[], callback: any): Promise<unknown>;
diff --git a/node_modules/ioredis/built/autoPipelining.js b/node_modules/ioredis/built/autoPipelining.js
new file mode 100644
index 0000000..d18998f
--- /dev/null
+++ b/node_modules/ioredis/built/autoPipelining.js
@@ -0,0 +1,177 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.executeWithAutoPipelining = exports.getFirstValueInFlattenedArray = exports.shouldUseAutoPipelining = exports.notAllowedAutoPipelineCommands = exports.kCallbacks = exports.kExec = void 0;
+const lodash_1 = require("./utils/lodash");
+const calculateSlot = require("cluster-key-slot");
+const standard_as_callback_1 = require("standard-as-callback");
+const commands_1 = require("@ioredis/commands");
+exports.kExec = Symbol("exec");
+exports.kCallbacks = Symbol("callbacks");
+exports.notAllowedAutoPipelineCommands = [
+    "auth",
+    "info",
+    "script",
+    "quit",
+    "cluster",
+    "pipeline",
+    "multi",
+    "subscribe",
+    "psubscribe",
+    "unsubscribe",
+    "unpsubscribe",
+    "select",
+    "client",
+];
+function executeAutoPipeline(client, slotKey) {
+    /*
+      If a pipeline is already executing, keep queueing up commands
+      since ioredis won't serve two pipelines at the same time
+    */
+    if (client._runningAutoPipelines.has(slotKey)) {
+        return;
+    }
+    if (!client._autoPipelines.has(slotKey)) {
+        /*
+          Rare edge case. Somehow, something has deleted this running autopipeline in an immediate
+          call to executeAutoPipeline.
+         
+          Maybe the callback in the pipeline.exec is sometimes called in the same tick,
+          e.g. if redis is disconnected?
+        */
+        return;
+    }
+    client._runningAutoPipelines.add(slotKey);
+    // Get the pipeline and immediately delete it so that new commands are queued on a new pipeline
+    const pipeline = client._autoPipelines.get(slotKey);
+    client._autoPipelines.delete(slotKey);
+    const callbacks = pipeline[exports.kCallbacks];
+    // Stop keeping a reference to callbacks immediately after the callbacks stop being used.
+    // This allows the GC to reclaim objects referenced by callbacks, especially with 16384 slots
+    // in Redis.Cluster
+    pipeline[exports.kCallbacks] = null;
+    // Perform the call
+    pipeline.exec(function (err, results) {
+        client._runningAutoPipelines.delete(slotKey);
+        /*
+          Invoke all callback in nextTick so the stack is cleared
+          and callbacks can throw errors without affecting other callbacks.
+        */
+        if (err) {
+            for (let i = 0; i < callbacks.length; i++) {
+                process.nextTick(callbacks[i], err);
+            }
+        }
+        else {
+            for (let i = 0; i < callbacks.length; i++) {
+                process.nextTick(callbacks[i], ...results[i]);
+            }
+        }
+        // If there is another pipeline on the same node, immediately execute it without waiting for nextTick
+        if (client._autoPipelines.has(slotKey)) {
+            executeAutoPipeline(client, slotKey);
+        }
+    });
+}
+function shouldUseAutoPipelining(client, functionName, commandName) {
+    return (functionName &&
+        client.options.enableAutoPipelining &&
+        !client.isPipeline &&
+        !exports.notAllowedAutoPipelineCommands.includes(commandName) &&
+        !client.options.autoPipeliningIgnoredCommands.includes(commandName));
+}
+exports.shouldUseAutoPipelining = shouldUseAutoPipelining;
+function getFirstValueInFlattenedArray(args) {
+    for (let i = 0; i < args.length; i++) {
+        const arg = args[i];
+        if (typeof arg === "string") {
+            return arg;
+        }
+        else if (Array.isArray(arg) || (0, lodash_1.isArguments)(arg)) {
+            if (arg.length === 0) {
+                continue;
+            }
+            return arg[0];
+        }
+        const flattened = [arg].flat();
+        if (flattened.length > 0) {
+            return flattened[0];
+        }
+    }
+    return undefined;
+}
+exports.getFirstValueInFlattenedArray = getFirstValueInFlattenedArray;
+function getFirstKeyForCommand(commandName, args) {
+    if ((0, commands_1.exists)(commandName, { caseInsensitive: true })) {
+        const flattenedArgs = args.flat();
+        const keyIndexes = (0, commands_1.getKeyIndexes)(commandName, flattenedArgs, {
+            nameCaseInsensitive: true,
+        });
+        if (keyIndexes.length) {
+            return flattenedArgs[keyIndexes[0]];
+        }
+    }
+    return getFirstValueInFlattenedArray(args);
+}
+function executeWithAutoPipelining(client, functionName, commandName, args, callback) {
+    // On cluster mode let's wait for slots to be available
+    if (client.isCluster && !client.slots.length) {
+        if (client.status === "wait")
+            client.connect().catch(lodash_1.noop);
+        return (0, standard_as_callback_1.default)(new Promise(function (resolve, reject) {
+            client.delayUntilReady((err) => {
+                if (err) {
+                    reject(err);
+                    return;
+                }
+                executeWithAutoPipelining(client, functionName, commandName, args, null).then(resolve, reject);
+            });
+        }), callback);
+    }
+    // If we have slot information, we can improve routing by grouping slots served by the same subset of nodes
+    const prefix = client.options.keyPrefix || "";
+    let slotKey = client.isCluster
+        ? client.slots[calculateSlot(`${prefix}${getFirstKeyForCommand(commandName, args)}`)].join(",")
+        : "main";
+    // When scaleReads is enabled, separate read and write commands into different pipelines
+    // so they can be routed to replicas and masters respectively
+    if (client.isCluster && client.options.scaleReads !== "master") {
+        const isReadOnly = (0, commands_1.exists)(commandName) && (0, commands_1.hasFlag)(commandName, "readonly");
+        slotKey += isReadOnly ? ":read" : ":write";
+    }
+    if (!client._autoPipelines.has(slotKey)) {
+        const pipeline = client.pipeline();
+        pipeline[exports.kExec] = false;
+        pipeline[exports.kCallbacks] = [];
+        client._autoPipelines.set(slotKey, pipeline);
+    }
+    const pipeline = client._autoPipelines.get(slotKey);
+    /*
+      Mark the pipeline as scheduled.
+      The symbol will make sure that the pipeline is only scheduled once per tick.
+      New commands are appended to an already scheduled pipeline.
+    */
+    if (!pipeline[exports.kExec]) {
+        pipeline[exports.kExec] = true;
+        /*
+          Deferring with setImmediate so we have a chance to capture multiple
+          commands that can be scheduled by I/O events already in the event loop queue.
+        */
+        setImmediate(executeAutoPipeline, client, slotKey);
+    }
+    // Create the promise which will execute the command in the pipeline.
+    const autoPipelinePromise = new Promise(function (resolve, reject) {
+        pipeline[exports.kCallbacks].push(function (err, value) {
+            if (err) {
+                reject(err);
+                return;
+            }
+            resolve(value);
+        });
+        if (functionName === "call") {
+            args.unshift(commandName);
+        }
+        pipeline[functionName](...args);
+    });
+    return (0, standard_as_callback_1.default)(autoPipelinePromise, callback);
+}
+exports.executeWithAutoPipelining = executeWithAutoPipelining;
diff --git a/node_modules/ioredis/built/cluster/ClusterOptions.d.ts b/node_modules/ioredis/built/cluster/ClusterOptions.d.ts
new file mode 100644
index 0000000..80c7e2c
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterOptions.d.ts
@@ -0,0 +1,172 @@
+/// <reference types="node" />
+import { SrvRecord } from "dns";
+import { RedisOptions } from "../redis/RedisOptions";
+import { CommanderOptions } from "../utils/Commander";
+import { NodeRole } from "./util";
+export declare type DNSResolveSrvFunction = (hostname: string, callback: (err: NodeJS.ErrnoException | null | undefined, records?: SrvRecord[]) => void) => void;
+export declare type DNSLookupFunction = (hostname: string, callback: (err: NodeJS.ErrnoException | null | undefined, address: string, family?: number) => void) => void;
+export declare type NatMapFunction = (key: string) => {
+    host: string;
+    port: number;
+} | null;
+export declare type NatMap = {
+    [key: string]: {
+        host: string;
+        port: number;
+    };
+} | NatMapFunction;
+/**
+ * Options for Cluster constructor
+ */
+export interface ClusterOptions extends CommanderOptions {
+    /**
+     * See "Quick Start" section.
+     *
+     * @default (times) => Math.min(100 + times * 2, 2000)
+     */
+    clusterRetryStrategy?: ((times: number, reason?: Error) => number | void | null) | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default true
+     */
+    enableOfflineQueue?: boolean | undefined;
+    /**
+     * When enabled, ioredis only emits "ready" event when `CLUSTER INFO`
+     * command reporting the cluster is ready for handling commands.
+     *
+     * @default true
+     */
+    enableReadyCheck?: boolean | undefined;
+    /**
+     * Scale reads to the node with the specified role.
+     *
+     * @default "master"
+     */
+    scaleReads?: NodeRole | Function | undefined;
+    /**
+     * When a MOVED or ASK error is received, client will redirect the
+     * command to another node.
+     * This option limits the max redirections allowed to send a command.
+     *
+     * @default 16
+     */
+    maxRedirections?: number | undefined;
+    /**
+     * When an error is received when sending a command (e.g.
+     * "Connection is closed." when the target Redis node is down), client will retry
+     * if `retryDelayOnFailover` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnFailover?: number | undefined;
+    /**
+     * When a CLUSTERDOWN error is received, client will retry
+     * if `retryDelayOnClusterDown` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnClusterDown?: number | undefined;
+    /**
+     * When a TRYAGAIN error is received, client will retry
+     * if `retryDelayOnTryAgain` is valid delay time (in ms).
+     *
+     * @default 100
+     */
+    retryDelayOnTryAgain?: number | undefined;
+    /**
+     * By default, this value is 0, which means when a `MOVED` error is received,
+     * the client will resend the command instantly to the node returned together with
+     * the `MOVED` error. However, sometimes it takes time for a cluster to become
+     * state stabilized after a failover, so adding a delay before resending can
+     * prevent a ping pong effect.
+     *
+     * @default 0
+     */
+    retryDelayOnMoved?: number | undefined;
+    /**
+     * The milliseconds before a timeout occurs while refreshing
+     * slots from the cluster.
+     *
+     * @default 1000
+     */
+    slotsRefreshTimeout?: number | undefined;
+    /**
+     * The milliseconds between every automatic slots refresh.
+     *
+     * @default 5000
+     */
+    slotsRefreshInterval?: number | undefined;
+    /**
+     * Use sharded subscribers instead of a single subscriber.
+     *
+     * If sharded subscribers are used, then one additional subscriber connection per master node
+     * is established. If you don't plan to use SPUBLISH/SSUBSCRIBE, then this should be disabled.
+     *
+     * @default false
+     */
+    shardedSubscribers?: boolean | undefined;
+    /**
+     * Passed to the constructor of `Redis`
+     *
+     * @default null
+     */
+    redisOptions?: Omit<RedisOptions, "port" | "host" | "path" | "sentinels" | "retryStrategy" | "enableOfflineQueue" | "readOnly"> | undefined;
+    /**
+     * By default, When a new Cluster instance is created,
+     * it will connect to the Redis cluster automatically.
+     * If you want to keep the instance disconnected until the first command is called,
+     * set this option to `true`.
+     *
+     * @default false
+     */
+    lazyConnect?: boolean | undefined;
+    /**
+     * Discover nodes using SRV records
+     *
+     * @default false
+     */
+    useSRVRecords?: boolean | undefined;
+    /**
+     * SRV records will be resolved via this function.
+     *
+     * You may provide a custom `resolveSrv` function when you want to customize
+     * the cache behavior of the default function.
+     *
+     * @default require('dns').resolveSrv
+     */
+    resolveSrv?: DNSResolveSrvFunction | undefined;
+    /**
+     * Hostnames will be resolved to IP addresses via this function.
+     * This is needed when the addresses of startup nodes are hostnames instead
+     * of IPs.
+     *
+     * You may provide a custom `lookup` function when you want to customize
+     * the cache behavior of the default function.
+     *
+     * @default require('dns').lookup
+     */
+    dnsLookup?: DNSLookupFunction | undefined;
+    natMap?: NatMap | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default false
+     */
+    enableAutoPipelining?: boolean | undefined;
+    /**
+     * See Redis class.
+     *
+     * @default []
+     */
+    autoPipeliningIgnoredCommands?: string[] | undefined;
+    /**
+     * Custom LUA commands
+     */
+    scripts?: Record<string, {
+        lua: string;
+        numberOfKeys?: number;
+        readOnly?: boolean;
+    }> | undefined;
+}
+export declare const DEFAULT_CLUSTER_OPTIONS: ClusterOptions;
diff --git a/node_modules/ioredis/built/cluster/ClusterOptions.js b/node_modules/ioredis/built/cluster/ClusterOptions.js
new file mode 100644
index 0000000..8c3e2e5
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterOptions.js
@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_CLUSTER_OPTIONS = void 0;
+const dns_1 = require("dns");
+exports.DEFAULT_CLUSTER_OPTIONS = {
+    clusterRetryStrategy: (times) => Math.min(100 + times * 2, 2000),
+    enableOfflineQueue: true,
+    enableReadyCheck: true,
+    scaleReads: "master",
+    maxRedirections: 16,
+    retryDelayOnMoved: 0,
+    retryDelayOnFailover: 100,
+    retryDelayOnClusterDown: 100,
+    retryDelayOnTryAgain: 100,
+    slotsRefreshTimeout: 1000,
+    useSRVRecords: false,
+    resolveSrv: dns_1.resolveSrv,
+    dnsLookup: dns_1.lookup,
+    enableAutoPipelining: false,
+    autoPipeliningIgnoredCommands: [],
+    shardedSubscribers: false,
+};
diff --git a/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts b/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts
new file mode 100644
index 0000000..93a221a
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterSubscriber.d.ts
@@ -0,0 +1,29 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import ConnectionPool from "./ConnectionPool";
+export default class ClusterSubscriber {
+    private connectionPool;
+    private emitter;
+    private isSharded;
+    private started;
+    private subscriber;
+    private lastActiveSubscriber;
+    private slotRange;
+    constructor(connectionPool: ConnectionPool, emitter: EventEmitter, isSharded?: boolean);
+    getInstance(): any;
+    /**
+     * Associate this subscriber to a specific slot range.
+     *
+     * Returns the range or an empty array if the slot range couldn't be associated.
+     *
+     * BTW: This is more for debugging and testing purposes.
+     *
+     * @param range
+     */
+    associateSlotRange(range: number[]): number[];
+    start(): void;
+    stop(): void;
+    isStarted(): boolean;
+    private onSubscriberEnd;
+    private selectSubscriber;
+}
diff --git a/node_modules/ioredis/built/cluster/ClusterSubscriber.js b/node_modules/ioredis/built/cluster/ClusterSubscriber.js
new file mode 100644
index 0000000..ceb02cd
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterSubscriber.js
@@ -0,0 +1,223 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const util_1 = require("./util");
+const utils_1 = require("../utils");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:subscriber");
+class ClusterSubscriber {
+    constructor(connectionPool, emitter, isSharded = false) {
+        this.connectionPool = connectionPool;
+        this.emitter = emitter;
+        this.isSharded = isSharded;
+        this.started = false;
+        //There is only one connection for the entire pool
+        this.subscriber = null;
+        //The slot range for which this subscriber is responsible
+        this.slotRange = [];
+        this.onSubscriberEnd = () => {
+            if (!this.started) {
+                debug("subscriber has disconnected, but ClusterSubscriber is not started, so not reconnecting.");
+                return;
+            }
+            // If the subscriber closes whilst it's still the active connection,
+            // we might as well try to connecting to a new node if possible to
+            // minimise the number of missed publishes.
+            debug("subscriber has disconnected, selecting a new one...");
+            this.selectSubscriber();
+        };
+        // If the current node we're using as the subscriber disappears
+        // from the node pool for some reason, we will select a new one
+        // to connect to.
+        // Note that this event is only triggered if the connection to
+        // the node has been used; cluster subscriptions are setup with
+        // lazyConnect = true. It's possible for the subscriber node to
+        // disappear without this method being called!
+        // See https://github.com/luin/ioredis/pull/1589
+        this.connectionPool.on("-node", (_, key) => {
+            if (!this.started || !this.subscriber) {
+                return;
+            }
+            if ((0, util_1.getNodeKey)(this.subscriber.options) === key) {
+                debug("subscriber has left, selecting a new one...");
+                this.selectSubscriber();
+            }
+        });
+        this.connectionPool.on("+node", () => {
+            if (!this.started || this.subscriber) {
+                return;
+            }
+            debug("a new node is discovered and there is no subscriber, selecting a new one...");
+            this.selectSubscriber();
+        });
+    }
+    getInstance() {
+        return this.subscriber;
+    }
+    /**
+     * Associate this subscriber to a specific slot range.
+     *
+     * Returns the range or an empty array if the slot range couldn't be associated.
+     *
+     * BTW: This is more for debugging and testing purposes.
+     *
+     * @param range
+     */
+    associateSlotRange(range) {
+        if (this.isSharded) {
+            this.slotRange = range;
+        }
+        return this.slotRange;
+    }
+    start() {
+        this.started = true;
+        this.selectSubscriber();
+        debug("started");
+    }
+    stop() {
+        this.started = false;
+        if (this.subscriber) {
+            this.subscriber.disconnect();
+            this.subscriber = null;
+        }
+    }
+    isStarted() {
+        return this.started;
+    }
+    selectSubscriber() {
+        const lastActiveSubscriber = this.lastActiveSubscriber;
+        // Disconnect the previous subscriber even if there
+        // will not be a new one.
+        if (lastActiveSubscriber) {
+            lastActiveSubscriber.off("end", this.onSubscriberEnd);
+            lastActiveSubscriber.disconnect();
+        }
+        if (this.subscriber) {
+            this.subscriber.off("end", this.onSubscriberEnd);
+            this.subscriber.disconnect();
+        }
+        const sampleNode = (0, utils_1.sample)(this.connectionPool.getNodes());
+        if (!sampleNode) {
+            debug("selecting subscriber failed since there is no node discovered in the cluster yet");
+            this.subscriber = null;
+            return;
+        }
+        const { options } = sampleNode;
+        debug("selected a subscriber %s:%s", options.host, options.port);
+        /*
+         * Create a specialized Redis connection for the subscription.
+         * Note that auto reconnection is enabled here.
+         *
+         * `enableReadyCheck` is also enabled because although subscription is allowed
+         * while redis is loading data from the disk, we can check if the password
+         * provided for the subscriber is correct, and if not, the current subscriber
+         * will be disconnected and a new subscriber will be selected.
+         */
+        let connectionPrefix = "subscriber";
+        if (this.isSharded)
+            connectionPrefix = "ssubscriber";
+        this.subscriber = new Redis_1.default({
+            port: options.port,
+            host: options.host,
+            username: options.username,
+            password: options.password,
+            enableReadyCheck: true,
+            connectionName: (0, util_1.getConnectionName)(connectionPrefix, options.connectionName),
+            lazyConnect: true,
+            tls: options.tls,
+            // Don't try to reconnect the subscriber connection. If the connection fails
+            // we will get an end event (handled below), at which point we'll pick a new
+            // node from the pool and try to connect to that as the subscriber connection.
+            retryStrategy: null,
+        });
+        // Ignore the errors since they're handled in the connection pool.
+        this.subscriber.on("error", utils_1.noop);
+        this.subscriber.on("moved", () => {
+            this.emitter.emit("forceRefresh");
+        });
+        // The node we lost connection to may not come back up in a
+        // reasonable amount of time (e.g. a slave that's taken down
+        // for maintainence), we could potentially miss many published
+        // messages so we should reconnect as quickly as possible, to
+        // a different node if needed.
+        this.subscriber.once("end", this.onSubscriberEnd);
+        // Re-subscribe previous channels
+        const previousChannels = { subscribe: [], psubscribe: [], ssubscribe: [] };
+        if (lastActiveSubscriber) {
+            const condition = lastActiveSubscriber.condition || lastActiveSubscriber.prevCondition;
+            if (condition && condition.subscriber) {
+                previousChannels.subscribe = condition.subscriber.channels("subscribe");
+                previousChannels.psubscribe =
+                    condition.subscriber.channels("psubscribe");
+                previousChannels.ssubscribe =
+                    condition.subscriber.channels("ssubscribe");
+            }
+        }
+        if (previousChannels.subscribe.length ||
+            previousChannels.psubscribe.length ||
+            previousChannels.ssubscribe.length) {
+            let pending = 0;
+            for (const type of ["subscribe", "psubscribe", "ssubscribe"]) {
+                const channels = previousChannels[type];
+                if (channels.length == 0) {
+                    continue;
+                }
+                debug("%s %d channels", type, channels.length);
+                if (type === "ssubscribe") {
+                    for (const channel of channels) {
+                        pending += 1;
+                        this.subscriber[type](channel)
+                            .then(() => {
+                            if (!--pending) {
+                                this.lastActiveSubscriber = this.subscriber;
+                            }
+                        })
+                            .catch(() => {
+                            // TODO: should probably disconnect the subscriber and try again.
+                            debug("failed to ssubscribe to channel: %s", channel);
+                        });
+                    }
+                }
+                else {
+                    pending += 1;
+                    this.subscriber[type](channels)
+                        .then(() => {
+                        if (!--pending) {
+                            this.lastActiveSubscriber = this.subscriber;
+                        }
+                    })
+                        .catch(() => {
+                        // TODO: should probably disconnect the subscriber and try again.
+                        debug("failed to %s %d channels", type, channels.length);
+                    });
+                }
+            }
+        }
+        else {
+            this.lastActiveSubscriber = this.subscriber;
+        }
+        for (const event of [
+            "message",
+            "messageBuffer",
+        ]) {
+            this.subscriber.on(event, (arg1, arg2) => {
+                this.emitter.emit(event, arg1, arg2);
+            });
+        }
+        for (const event of ["pmessage", "pmessageBuffer"]) {
+            this.subscriber.on(event, (arg1, arg2, arg3) => {
+                this.emitter.emit(event, arg1, arg2, arg3);
+            });
+        }
+        if (this.isSharded == true) {
+            for (const event of [
+                "smessage",
+                "smessageBuffer",
+            ]) {
+                this.subscriber.on(event, (arg1, arg2) => {
+                    this.emitter.emit(event, arg1, arg2);
+                });
+            }
+        }
+    }
+}
+exports.default = ClusterSubscriber;
diff --git a/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts b/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts
new file mode 100644
index 0000000..496b96d
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.d.ts
@@ -0,0 +1,108 @@
+/// <reference types="node" />
+import * as EventEmitter from "events";
+import ShardedSubscriber from "./ShardedSubscriber";
+import { ClusterOptions } from "./ClusterOptions";
+/**
+ * Redis distinguishes between "normal" and sharded PubSub. When using the normal PubSub feature,
+ * exactly one subscriber exists per cluster instance because the Redis cluster bus forwards
+ * messages between shards. Sharded PubSub removes this limitation by making each shard
+ * responsible for its own messages.
+ *
+ * This class coordinates one ShardedSubscriber per master node in the cluster, providing
+ * sharded PubSub support while keeping the public API backward compatible.
+ */
+export default class ClusterSubscriberGroup {
+    private readonly subscriberGroupEmitter;
+    private readonly options;
+    private shardedSubscribers;
+    private clusterSlots;
+    private subscriberToSlotsIndex;
+    private channels;
+    private failedAttemptsByNode;
+    private isResetting;
+    private pendingReset;
+    private static readonly MAX_RETRY_ATTEMPTS;
+    private static readonly MAX_BACKOFF_MS;
+    private static readonly BASE_BACKOFF_MS;
+    /**
+     * Register callbacks
+     *
+     * @param cluster
+     */
+    constructor(subscriberGroupEmitter: EventEmitter, options: ClusterOptions);
+    /**
+     * Get the responsible subscriber.
+     *
+     * @param slot
+     */
+    getResponsibleSubscriber(slot: number): ShardedSubscriber | undefined;
+    /**
+     * Adds a channel for which this subscriber group is responsible
+     *
+     * @param channels
+     */
+    addChannels(channels: (string | Buffer)[]): number;
+    /**
+     * Removes channels for which the subscriber group is responsible by optionally unsubscribing
+     * @param channels
+     */
+    removeChannels(channels: (string | Buffer)[]): number;
+    /**
+     * Disconnect all subscribers and clear some of the internal state.
+     */
+    stop(): void;
+    /**
+     * Start all not yet started subscribers
+     */
+    start(): Promise<any[]>;
+    /**
+     * Resets the subscriber group by disconnecting all subscribers that are no longer needed and connecting new ones.
+     */
+    reset(clusterSlots: string[][], clusterNodes: any[]): Promise<void>;
+    /**
+     * Refreshes the subscriber-related slot ranges
+     *
+     * Returns false if no refresh was needed
+     *
+     * @param targetSlots
+     */
+    private _refreshSlots;
+    /**
+     * Resubscribes to the previous channels
+     *
+     * @private
+     */
+    private _resubscribe;
+    /**
+     * Deep equality of the cluster slots objects
+     *
+     * @param other
+     * @private
+     */
+    private _slotsAreEqual;
+    /**
+     * Checks if any subscribers are in an unhealthy state.
+     *
+     * A subscriber is considered unhealthy if:
+     * - It exists but is not started (failed/disconnected)
+     * - It's missing entirely for a node that should have one
+     *
+     * @returns true if any subscribers need to be recreated
+     */
+    private hasUnhealthySubscribers;
+    /**
+     * Handles failed subscriber connections by emitting an event to refresh the slots cache
+     * after a backoff period.
+     *
+     * @param error
+     * @param nodeKey
+     */
+    private handleSubscriberConnectFailed;
+    /**
+     * Handles successful subscriber connections by resetting the failed attempts counter.
+     *
+     * @param nodeKey
+     */
+    private handleSubscriberConnectSucceeded;
+    private shouldStartSubscriber;
+}
diff --git a/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js b/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js
new file mode 100644
index 0000000..8f524a8
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ClusterSubscriberGroup.js
@@ -0,0 +1,373 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const util_1 = require("./util");
+const calculateSlot = require("cluster-key-slot");
+const ShardedSubscriber_1 = require("./ShardedSubscriber");
+const debug = (0, utils_1.Debug)("cluster:subscriberGroup");
+/**
+ * Redis distinguishes between "normal" and sharded PubSub. When using the normal PubSub feature,
+ * exactly one subscriber exists per cluster instance because the Redis cluster bus forwards
+ * messages between shards. Sharded PubSub removes this limitation by making each shard
+ * responsible for its own messages.
+ *
+ * This class coordinates one ShardedSubscriber per master node in the cluster, providing
+ * sharded PubSub support while keeping the public API backward compatible.
+ */
+class ClusterSubscriberGroup {
+    /**
+     * Register callbacks
+     *
+     * @param cluster
+     */
+    constructor(subscriberGroupEmitter, options) {
+        this.subscriberGroupEmitter = subscriberGroupEmitter;
+        this.options = options;
+        this.shardedSubscribers = new Map();
+        this.clusterSlots = [];
+        // Simple [min, max] slot ranges aren't enough because you can migrate single slots
+        this.subscriberToSlotsIndex = new Map();
+        this.channels = new Map();
+        this.failedAttemptsByNode = new Map();
+        // Only latest pending reset kept; throttled by refreshSlotsCache's isRefreshing + backoff delay
+        this.isResetting = false;
+        this.pendingReset = null;
+        /**
+         * Handles failed subscriber connections by emitting an event to refresh the slots cache
+         * after a backoff period.
+         *
+         * @param error
+         * @param nodeKey
+         */
+        this.handleSubscriberConnectFailed = (error, nodeKey) => {
+            const currentAttempts = this.failedAttemptsByNode.get(nodeKey) || 0;
+            const failedAttempts = currentAttempts + 1;
+            this.failedAttemptsByNode.set(nodeKey, failedAttempts);
+            const attempts = Math.min(failedAttempts, ClusterSubscriberGroup.MAX_RETRY_ATTEMPTS);
+            const backoff = Math.min(ClusterSubscriberGroup.BASE_BACKOFF_MS * 2 ** attempts, ClusterSubscriberGroup.MAX_BACKOFF_MS);
+            const jitter = Math.floor((Math.random() - 0.5) * (backoff * 0.5));
+            const delay = Math.max(0, backoff + jitter);
+            debug("Failed to connect subscriber for %s. Refreshing slots in %dms", nodeKey, delay);
+            this.subscriberGroupEmitter.emit("subscriberConnectFailed", {
+                delay,
+                error,
+            });
+        };
+        /**
+         * Handles successful subscriber connections by resetting the failed attempts counter.
+         *
+         * @param nodeKey
+         */
+        this.handleSubscriberConnectSucceeded = (nodeKey) => {
+            this.failedAttemptsByNode.delete(nodeKey);
+        };
+    }
+    /**
+     * Get the responsible subscriber.
+     *
+     * @param slot
+     */
+    getResponsibleSubscriber(slot) {
+        const nodeKey = this.clusterSlots[slot][0];
+        const sub = this.shardedSubscribers.get(nodeKey);
+        if (sub && sub.subscriberStatus === "idle") {
+            sub
+                .start()
+                .then(() => {
+                this.handleSubscriberConnectSucceeded(sub.getNodeKey());
+            })
+                .catch((err) => {
+                this.handleSubscriberConnectFailed(err, sub.getNodeKey());
+            });
+        }
+        return sub;
+    }
+    /**
+     * Adds a channel for which this subscriber group is responsible
+     *
+     * @param channels
+     */
+    addChannels(channels) {
+        const slot = calculateSlot(channels[0]);
+        // Check if the all channels belong to the same slot and otherwise reject the operation
+        for (const c of channels) {
+            if (calculateSlot(c) !== slot) {
+                return -1;
+            }
+        }
+        const currChannels = this.channels.get(slot);
+        if (!currChannels) {
+            this.channels.set(slot, channels);
+        }
+        else {
+            this.channels.set(slot, currChannels.concat(channels));
+        }
+        return Array.from(this.channels.values()).reduce((sum, array) => sum + array.length, 0);
+    }
+    /**
+     * Removes channels for which the subscriber group is responsible by optionally unsubscribing
+     * @param channels
+     */
+    removeChannels(channels) {
+        const slot = calculateSlot(channels[0]);
+        // Check if the all channels belong to the same slot and otherwise reject the operation
+        for (const c of channels) {
+            if (calculateSlot(c) !== slot) {
+                return -1;
+            }
+        }
+        const slotChannels = this.channels.get(slot);
+        if (slotChannels) {
+            const updatedChannels = slotChannels.filter((c) => !channels.includes(c));
+            this.channels.set(slot, updatedChannels);
+        }
+        return Array.from(this.channels.values()).reduce((sum, array) => sum + array.length, 0);
+    }
+    /**
+     * Disconnect all subscribers and clear some of the internal state.
+     */
+    stop() {
+        for (const s of this.shardedSubscribers.values()) {
+            s.stop();
+        }
+        // Clear subscriber instances and pending operations.
+        // Channels are preserved for resubscription on reconnect.
+        this.pendingReset = null;
+        this.shardedSubscribers.clear();
+        this.subscriberToSlotsIndex.clear();
+    }
+    /**
+     * Start all not yet started subscribers
+     */
+    start() {
+        const startPromises = [];
+        for (const s of this.shardedSubscribers.values()) {
+            if (this.shouldStartSubscriber(s)) {
+                startPromises.push(s
+                    .start()
+                    .then(() => {
+                    this.handleSubscriberConnectSucceeded(s.getNodeKey());
+                })
+                    .catch((err) => {
+                    this.handleSubscriberConnectFailed(err, s.getNodeKey());
+                }));
+                this.subscriberGroupEmitter.emit("+subscriber");
+            }
+        }
+        return Promise.all(startPromises);
+    }
+    /**
+     * Resets the subscriber group by disconnecting all subscribers that are no longer needed and connecting new ones.
+     */
+    async reset(clusterSlots, clusterNodes) {
+        if (this.isResetting) {
+            this.pendingReset = { slots: clusterSlots, nodes: clusterNodes };
+            return;
+        }
+        this.isResetting = true;
+        try {
+            const hasTopologyChanged = this._refreshSlots(clusterSlots);
+            const hasFailedSubscribers = this.hasUnhealthySubscribers();
+            if (!hasTopologyChanged && !hasFailedSubscribers) {
+                debug("No topology change detected or failed subscribers. Skipping reset.");
+                return;
+            }
+            // For each of the sharded subscribers
+            for (const [nodeKey, shardedSubscriber] of this.shardedSubscribers) {
+                if (
+                // If the subscriber is still responsible for a slot range and is healthy then keep it
+                this.subscriberToSlotsIndex.has(nodeKey) &&
+                    shardedSubscriber.isHealthy()) {
+                    debug("Skipping deleting subscriber for %s", nodeKey);
+                    continue;
+                }
+                debug("Removing subscriber for %s", nodeKey);
+                // Otherwise stop the subscriber and remove it
+                shardedSubscriber.stop();
+                this.shardedSubscribers.delete(nodeKey);
+                this.subscriberGroupEmitter.emit("-subscriber");
+            }
+            const startPromises = [];
+            // For each node in slots cache
+            for (const [nodeKey, _] of this.subscriberToSlotsIndex) {
+                const existingSubscriber = this.shardedSubscribers.get(nodeKey);
+                // If we already have a subscriber for this node, only ensure it is healthy
+                // when it now owns slots with active channel subscriptions.
+                if (existingSubscriber && existingSubscriber.isHealthy()) {
+                    debug("Skipping creating new subscriber for %s", nodeKey);
+                    if (!existingSubscriber.isStarted() &&
+                        this.shouldStartSubscriber(existingSubscriber)) {
+                        startPromises.push(existingSubscriber
+                            .start()
+                            .then(() => {
+                            this.handleSubscriberConnectSucceeded(nodeKey);
+                        })
+                            .catch((error) => {
+                            this.handleSubscriberConnectFailed(error, nodeKey);
+                        }));
+                    }
+                    continue;
+                }
+                // If we have an existing subscriber but it is not healthy, stop it
+                if (existingSubscriber && !existingSubscriber.isHealthy()) {
+                    debug("Replacing subscriber for %s", nodeKey);
+                    existingSubscriber.stop();
+                    this.shardedSubscribers.delete(nodeKey);
+                    this.subscriberGroupEmitter.emit("-subscriber");
+                }
+                debug("Creating new subscriber for %s", nodeKey);
+                // Otherwise create a new subscriber
+                const redis = clusterNodes.find((node) => {
+                    return (0, util_1.getNodeKey)(node.options) === nodeKey;
+                });
+                if (!redis) {
+                    debug("Failed to find node for key %s", nodeKey);
+                    continue;
+                }
+                const sub = new ShardedSubscriber_1.default(this.subscriberGroupEmitter, redis.options, this.options.redisOptions);
+                this.shardedSubscribers.set(nodeKey, sub);
+                if (this.shouldStartSubscriber(sub)) {
+                    startPromises.push(sub
+                        .start()
+                        .then(() => {
+                        this.handleSubscriberConnectSucceeded(nodeKey);
+                    })
+                        .catch((error) => {
+                        this.handleSubscriberConnectFailed(error, nodeKey);
+                    }));
+                }
+                this.subscriberGroupEmitter.emit("+subscriber");
+            }
+            // It's vital to await the start promises before resubscribing
+            // Otherwise we might try to resubscribe to a subscriber that is not yet connected
+            // This can cause a race condition
+            await Promise.all(startPromises);
+            this._resubscribe();
+            this.subscriberGroupEmitter.emit("subscribersReady");
+        }
+        finally {
+            this.isResetting = false;
+            if (this.pendingReset) {
+                const { slots, nodes } = this.pendingReset;
+                this.pendingReset = null;
+                await this.reset(slots, nodes);
+            }
+        }
+    }
+    /**
+     * Refreshes the subscriber-related slot ranges
+     *
+     * Returns false if no refresh was needed
+     *
+     * @param targetSlots
+     */
+    _refreshSlots(targetSlots) {
+        //If there was an actual change, then reassign the slot ranges
+        // Also rebuild if subscriberToSlotsIndex is empty (e.g., after stop() was called)
+        if (this._slotsAreEqual(targetSlots) && this.subscriberToSlotsIndex.size > 0) {
+            debug("Nothing to refresh because the new cluster map is equal to the previous one.");
+            return false;
+        }
+        debug("Refreshing the slots of the subscriber group.");
+        //Rebuild the slots index
+        this.subscriberToSlotsIndex = new Map();
+        for (let slot = 0; slot < targetSlots.length; slot++) {
+            const node = targetSlots[slot][0];
+            if (!this.subscriberToSlotsIndex.has(node)) {
+                this.subscriberToSlotsIndex.set(node, []);
+            }
+            this.subscriberToSlotsIndex.get(node).push(Number(slot));
+        }
+        //Update the cached slots map
+        this.clusterSlots = JSON.parse(JSON.stringify(targetSlots));
+        return true;
+    }
+    /**
+     * Resubscribes to the previous channels
+     *
+     * @private
+     */
+    _resubscribe() {
+        if (this.shardedSubscribers) {
+            this.shardedSubscribers.forEach((s, nodeKey) => {
+                const subscriberSlots = this.subscriberToSlotsIndex.get(nodeKey);
+                if (subscriberSlots) {
+                    //Resubscribe on the underlying connection
+                    subscriberSlots.forEach((ss) => {
+                        //Might return null if being disconnected
+                        const redis = s.getInstance();
+                        const channels = this.channels.get(ss);
+                        if (channels && channels.length > 0) {
+                            if (!redis || redis.status === "end") {
+                                return;
+                            }
+                            if (redis.status === "ready") {
+                                redis.ssubscribe(...channels).catch((err) => {
+                                    // TODO: Should we emit an error event here?
+                                    debug("Failed to ssubscribe on node %s: %s", nodeKey, err);
+                                });
+                            }
+                            else {
+                                redis.once("ready", () => {
+                                    redis.ssubscribe(...channels).catch((err) => {
+                                        // TODO: Should we emit an error event here?
+                                        debug("Failed to ssubscribe on node %s: %s", nodeKey, err);
+                                    });
+                                });
+                            }
+                        }
+                    });
+                }
+            });
+        }
+    }
+    /**
+     * Deep equality of the cluster slots objects
+     *
+     * @param other
+     * @private
+     */
+    _slotsAreEqual(other) {
+        if (this.clusterSlots === undefined) {
+            return false;
+        }
+        else {
+            return JSON.stringify(this.clusterSlots) === JSON.stringify(other);
+        }
+    }
+    /**
+     * Checks if any subscribers are in an unhealthy state.
+     *
+     * A subscriber is considered unhealthy if:
+     * - It exists but is not started (failed/disconnected)
+     * - It's missing entirely for a node that should have one
+     *
+     * @returns true if any subscribers need to be recreated
+     */
+    hasUnhealthySubscribers() {
+        const hasFailedSubscribers = Array.from(this.shardedSubscribers.values()).some((sub) => !sub.isHealthy());
+        const hasMissingSubscribers = Array.from(this.subscriberToSlotsIndex.keys()).some((nodeKey) => !this.shardedSubscribers.has(nodeKey));
+        return hasFailedSubscribers || hasMissingSubscribers;
+    }
+    shouldStartSubscriber(sub) {
+        if (sub.isStarted()) {
+            return false;
+        }
+        if (!sub.isLazyConnect()) {
+            return true;
+        }
+        const subscriberSlots = this.subscriberToSlotsIndex.get(sub.getNodeKey());
+        if (!subscriberSlots) {
+            return false;
+        }
+        return subscriberSlots.some((slot) => {
+            const channels = this.channels.get(slot);
+            return Boolean(channels && channels.length > 0);
+        });
+    }
+}
+exports.default = ClusterSubscriberGroup;
+// Retry strategy
+ClusterSubscriberGroup.MAX_RETRY_ATTEMPTS = 10;
+ClusterSubscriberGroup.MAX_BACKOFF_MS = 2000;
+ClusterSubscriberGroup.BASE_BACKOFF_MS = 100;
diff --git a/node_modules/ioredis/built/cluster/ConnectionPool.d.ts b/node_modules/ioredis/built/cluster/ConnectionPool.d.ts
new file mode 100644
index 0000000..0de5d7a
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ConnectionPool.d.ts
@@ -0,0 +1,37 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import { RedisOptions, NodeKey, NodeRole } from "./util";
+import Redis from "../Redis";
+export default class ConnectionPool extends EventEmitter {
+    private redisOptions;
+    private nodes;
+    private specifiedOptions;
+    constructor(redisOptions: any);
+    getNodes(role?: NodeRole): Redis[];
+    getInstanceByKey(key: NodeKey): Redis;
+    getSampleInstance(role: NodeRole): Redis;
+    /**
+     * Add a master node to the pool
+     * @param node
+     */
+    addMasterNode(node: RedisOptions): boolean;
+    /**
+     * Creates a Redis connection instance from the node options
+     * @param node
+     * @param readOnly
+     */
+    createRedisFromOptions(node: RedisOptions, readOnly: boolean): Redis;
+    /**
+     * Find or create a connection to the node
+     */
+    findOrCreate(node: RedisOptions, readOnly?: boolean): Redis;
+    /**
+     * Reset the pool with a set of nodes.
+     * The old node will be removed.
+     */
+    reset(nodes: RedisOptions[]): void;
+    /**
+     * Remove a node from the pool.
+     */
+    private removeNode;
+}
diff --git a/node_modules/ioredis/built/cluster/ConnectionPool.js b/node_modules/ioredis/built/cluster/ConnectionPool.js
new file mode 100644
index 0000000..4fef1b8
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ConnectionPool.js
@@ -0,0 +1,154 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const events_1 = require("events");
+const utils_1 = require("../utils");
+const util_1 = require("./util");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:connectionPool");
+class ConnectionPool extends events_1.EventEmitter {
+    constructor(redisOptions) {
+        super();
+        this.redisOptions = redisOptions;
+        // master + slave = all
+        this.nodes = {
+            all: {},
+            master: {},
+            slave: {},
+        };
+        this.specifiedOptions = {};
+    }
+    getNodes(role = "all") {
+        const nodes = this.nodes[role];
+        return Object.keys(nodes).map((key) => nodes[key]);
+    }
+    getInstanceByKey(key) {
+        return this.nodes.all[key];
+    }
+    getSampleInstance(role) {
+        const keys = Object.keys(this.nodes[role]);
+        const sampleKey = (0, utils_1.sample)(keys);
+        return this.nodes[role][sampleKey];
+    }
+    /**
+     * Add a master node to the pool
+     * @param node
+     */
+    addMasterNode(node) {
+        const key = (0, util_1.getNodeKey)(node.options);
+        const redis = this.createRedisFromOptions(node, node.options.readOnly);
+        //Master nodes aren't read-only
+        if (!node.options.readOnly) {
+            this.nodes.all[key] = redis;
+            this.nodes.master[key] = redis;
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Creates a Redis connection instance from the node options
+     * @param node
+     * @param readOnly
+     */
+    createRedisFromOptions(node, readOnly) {
+        const redis = new Redis_1.default((0, utils_1.defaults)({
+            // Never try to reconnect when a node is lose,
+            // instead, waiting for a `MOVED` error and
+            // fetch the slots again.
+            retryStrategy: null,
+            // Offline queue should be enabled so that
+            // we don't need to wait for the `ready` event
+            // before sending commands to the node.
+            enableOfflineQueue: true,
+            readOnly: readOnly,
+        }, node, this.redisOptions, { lazyConnect: true }));
+        return redis;
+    }
+    /**
+     * Find or create a connection to the node
+     */
+    findOrCreate(node, readOnly = false) {
+        const key = (0, util_1.getNodeKey)(node);
+        readOnly = Boolean(readOnly);
+        if (this.specifiedOptions[key]) {
+            Object.assign(node, this.specifiedOptions[key]);
+        }
+        else {
+            this.specifiedOptions[key] = node;
+        }
+        let redis;
+        if (this.nodes.all[key]) {
+            redis = this.nodes.all[key];
+            if (redis.options.readOnly !== readOnly) {
+                redis.options.readOnly = readOnly;
+                debug("Change role of %s to %s", key, readOnly ? "slave" : "master");
+                redis[readOnly ? "readonly" : "readwrite"]().catch(utils_1.noop);
+                if (readOnly) {
+                    delete this.nodes.master[key];
+                    this.nodes.slave[key] = redis;
+                }
+                else {
+                    delete this.nodes.slave[key];
+                    this.nodes.master[key] = redis;
+                }
+            }
+        }
+        else {
+            debug("Connecting to %s as %s", key, readOnly ? "slave" : "master");
+            redis = this.createRedisFromOptions(node, readOnly);
+            this.nodes.all[key] = redis;
+            this.nodes[readOnly ? "slave" : "master"][key] = redis;
+            redis.once("end", () => {
+                this.removeNode(key);
+                this.emit("-node", redis, key);
+                if (!Object.keys(this.nodes.all).length) {
+                    this.emit("drain");
+                }
+            });
+            this.emit("+node", redis, key);
+            redis.on("error", function (error) {
+                this.emit("nodeError", error, key);
+            });
+        }
+        return redis;
+    }
+    /**
+     * Reset the pool with a set of nodes.
+     * The old node will be removed.
+     */
+    reset(nodes) {
+        debug("Reset with %O", nodes);
+        const newNodes = {};
+        nodes.forEach((node) => {
+            const key = (0, util_1.getNodeKey)(node);
+            // Don't override the existing (master) node
+            // when the current one is slave.
+            if (!(node.readOnly && newNodes[key])) {
+                newNodes[key] = node;
+            }
+        });
+        Object.keys(this.nodes.all).forEach((key) => {
+            if (!newNodes[key]) {
+                debug("Disconnect %s because the node does not hold any slot", key);
+                this.nodes.all[key].disconnect();
+                this.removeNode(key);
+            }
+        });
+        Object.keys(newNodes).forEach((key) => {
+            const node = newNodes[key];
+            this.findOrCreate(node, node.readOnly);
+        });
+    }
+    /**
+     * Remove a node from the pool.
+     */
+    removeNode(key) {
+        const { nodes } = this;
+        if (nodes.all[key]) {
+            debug("Remove %s from the pool", key);
+            delete nodes.all[key];
+        }
+        delete nodes.master[key];
+        delete nodes.slave[key];
+    }
+}
+exports.default = ConnectionPool;
diff --git a/node_modules/ioredis/built/cluster/DelayQueue.d.ts b/node_modules/ioredis/built/cluster/DelayQueue.d.ts
new file mode 100644
index 0000000..2d64896
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/DelayQueue.d.ts
@@ -0,0 +1,20 @@
+export interface DelayQueueOptions {
+    callback?: Function;
+    timeout: number;
+}
+/**
+ * Queue that runs items after specified duration
+ */
+export default class DelayQueue {
+    private queues;
+    private timeouts;
+    /**
+     * Add a new item to the queue
+     *
+     * @param bucket bucket name
+     * @param item function that will run later
+     * @param options
+     */
+    push(bucket: string, item: Function, options: DelayQueueOptions): void;
+    private execute;
+}
diff --git a/node_modules/ioredis/built/cluster/DelayQueue.js b/node_modules/ioredis/built/cluster/DelayQueue.js
new file mode 100644
index 0000000..e17df51
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/DelayQueue.js
@@ -0,0 +1,53 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const Deque = require("denque");
+const debug = (0, utils_1.Debug)("delayqueue");
+/**
+ * Queue that runs items after specified duration
+ */
+class DelayQueue {
+    constructor() {
+        this.queues = {};
+        this.timeouts = {};
+    }
+    /**
+     * Add a new item to the queue
+     *
+     * @param bucket bucket name
+     * @param item function that will run later
+     * @param options
+     */
+    push(bucket, item, options) {
+        const callback = options.callback || process.nextTick;
+        if (!this.queues[bucket]) {
+            this.queues[bucket] = new Deque();
+        }
+        const queue = this.queues[bucket];
+        queue.push(item);
+        if (!this.timeouts[bucket]) {
+            this.timeouts[bucket] = setTimeout(() => {
+                callback(() => {
+                    this.timeouts[bucket] = null;
+                    this.execute(bucket);
+                });
+            }, options.timeout);
+        }
+    }
+    execute(bucket) {
+        const queue = this.queues[bucket];
+        if (!queue) {
+            return;
+        }
+        const { length } = queue;
+        if (!length) {
+            return;
+        }
+        debug("send %d commands in %s queue", length, bucket);
+        this.queues[bucket] = null;
+        while (queue.length > 0) {
+            queue.shift()();
+        }
+    }
+}
+exports.default = DelayQueue;
diff --git a/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts b/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts
new file mode 100644
index 0000000..921bcdb
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ShardedSubscriber.d.ts
@@ -0,0 +1,36 @@
+/// <reference types="node" />
+import EventEmitter = require("events");
+import { RedisOptions } from "./util";
+import Redis from "../Redis";
+import { ClusterOptions } from "./ClusterOptions";
+declare const SubscriberStatus: {
+    readonly IDLE: "idle";
+    readonly STARTING: "starting";
+    readonly CONNECTED: "connected";
+    readonly STOPPING: "stopping";
+    readonly ENDED: "ended";
+};
+declare type SubscriberStatus = typeof SubscriberStatus[keyof typeof SubscriberStatus];
+export default class ShardedSubscriber {
+    private readonly emitter;
+    private readonly nodeKey;
+    private status;
+    private instance;
+    private connectPromise;
+    private lazyConnect;
+    private readonly messageListeners;
+    constructor(emitter: EventEmitter, options: RedisOptions, redisOptions?: ClusterOptions["redisOptions"]);
+    start(): Promise<void>;
+    stop(): void;
+    isStarted(): boolean;
+    get subscriberStatus(): SubscriberStatus;
+    isHealthy(): boolean;
+    getInstance(): Redis | null;
+    getNodeKey(): string;
+    isLazyConnect(): boolean;
+    private onEnd;
+    private onError;
+    private onMoved;
+    private updateStatus;
+}
+export {};
diff --git a/node_modules/ioredis/built/cluster/ShardedSubscriber.js b/node_modules/ioredis/built/cluster/ShardedSubscriber.js
new file mode 100644
index 0000000..163fb63
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/ShardedSubscriber.js
@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const util_1 = require("./util");
+const utils_1 = require("../utils");
+const Redis_1 = require("../Redis");
+const debug = (0, utils_1.Debug)("cluster:subscriberGroup:shardedSubscriber");
+const SubscriberStatus = {
+    IDLE: "idle",
+    STARTING: "starting",
+    CONNECTED: "connected",
+    STOPPING: "stopping",
+    ENDED: "ended",
+};
+const ALLOWED_STATUS_UPDATES = {
+    [SubscriberStatus.IDLE]: [
+        SubscriberStatus.STARTING,
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.STARTING]: [
+        SubscriberStatus.CONNECTED,
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.CONNECTED]: [
+        SubscriberStatus.STOPPING,
+        SubscriberStatus.ENDED,
+    ],
+    [SubscriberStatus.STOPPING]: [SubscriberStatus.ENDED],
+    [SubscriberStatus.ENDED]: [],
+};
+class ShardedSubscriber {
+    constructor(emitter, options, redisOptions) {
+        var _a;
+        this.emitter = emitter;
+        this.status = SubscriberStatus.IDLE;
+        this.instance = null;
+        this.connectPromise = null;
+        // Store listener references for cleanup
+        this.messageListeners = new Map();
+        this.onEnd = () => {
+            this.updateStatus(SubscriberStatus.ENDED);
+            this.emitter.emit("-node", this.instance, this.nodeKey);
+        };
+        this.onError = (error) => {
+            this.emitter.emit("nodeError", error, this.nodeKey);
+        };
+        this.onMoved = () => {
+            this.emitter.emit("moved");
+        };
+        this.instance = new Redis_1.default((0, utils_1.defaults)({
+            enableReadyCheck: false,
+            enableOfflineQueue: true,
+            connectionName: (0, util_1.getConnectionName)("ssubscriber", options.connectionName),
+            /**
+             * Disable auto reconnection for subscribers.
+             * The ClusterSubscriberGroup will handle the reconnection.
+             */
+            retryStrategy: null,
+            lazyConnect: true,
+        }, options, redisOptions));
+        this.lazyConnect = (_a = redisOptions === null || redisOptions === void 0 ? void 0 : redisOptions.lazyConnect) !== null && _a !== void 0 ? _a : true;
+        this.nodeKey = (0, util_1.getNodeKey)(options);
+        // Register listeners
+        this.instance.on("end", this.onEnd);
+        this.instance.on("error", this.onError);
+        this.instance.on("moved", this.onMoved);
+        for (const event of ["smessage", "smessageBuffer"]) {
+            const listener = (...args) => {
+                this.emitter.emit(event, ...args);
+            };
+            this.messageListeners.set(event, listener);
+            this.instance.on(event, listener);
+        }
+    }
+    async start() {
+        if (this.connectPromise) {
+            return this.connectPromise;
+        }
+        if (this.status === SubscriberStatus.STARTING ||
+            this.status === SubscriberStatus.CONNECTED) {
+            return;
+        }
+        if (this.status === SubscriberStatus.ENDED || !this.instance) {
+            throw new Error(`Sharded subscriber ${this.nodeKey} cannot be restarted once ended.`);
+        }
+        this.updateStatus(SubscriberStatus.STARTING);
+        this.connectPromise = this.instance.connect();
+        try {
+            await this.connectPromise;
+            this.updateStatus(SubscriberStatus.CONNECTED);
+        }
+        catch (err) {
+            this.updateStatus(SubscriberStatus.ENDED);
+            throw err;
+        }
+        finally {
+            this.connectPromise = null;
+        }
+    }
+    stop() {
+        this.updateStatus(SubscriberStatus.STOPPING);
+        if (this.instance) {
+            this.instance.disconnect();
+            this.instance.removeAllListeners();
+            this.messageListeners.clear();
+            this.instance = null;
+        }
+        this.updateStatus(SubscriberStatus.ENDED);
+        debug("stopped %s", this.nodeKey);
+    }
+    isStarted() {
+        return [
+            SubscriberStatus.CONNECTED,
+            SubscriberStatus.STARTING,
+        ].includes(this.status);
+    }
+    get subscriberStatus() {
+        return this.status;
+    }
+    isHealthy() {
+        return ((this.status === SubscriberStatus.IDLE ||
+            this.status === SubscriberStatus.CONNECTED ||
+            this.status === SubscriberStatus.STARTING) &&
+            this.instance !== null);
+    }
+    getInstance() {
+        return this.instance;
+    }
+    getNodeKey() {
+        return this.nodeKey;
+    }
+    isLazyConnect() {
+        return this.lazyConnect;
+    }
+    updateStatus(nextStatus) {
+        if (this.status === nextStatus) {
+            return;
+        }
+        if (!ALLOWED_STATUS_UPDATES[this.status].includes(nextStatus)) {
+            debug("Invalid status transition for %s: %s -> %s", this.nodeKey, this.status, nextStatus);
+            return;
+        }
+        this.status = nextStatus;
+    }
+}
+exports.default = ShardedSubscriber;
diff --git a/node_modules/ioredis/built/cluster/index.d.ts b/node_modules/ioredis/built/cluster/index.d.ts
new file mode 100644
index 0000000..3f5e1b4
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/index.d.ts
@@ -0,0 +1,163 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import Command from "../Command";
+import Redis from "../Redis";
+import ScanStream from "../ScanStream";
+import { Transaction } from "../transaction";
+import { Callback, ScanStreamOptions, WriteableStream } from "../types";
+import Commander from "../utils/Commander";
+import { ClusterOptions } from "./ClusterOptions";
+import { NodeKey, NodeRole } from "./util";
+export declare type ClusterNode = string | number | {
+    host?: string | undefined;
+    port?: number | undefined;
+};
+declare type ClusterStatus = "end" | "close" | "wait" | "connecting" | "connect" | "ready" | "reconnecting" | "disconnecting";
+/**
+ * Client for the official Redis Cluster
+ */
+declare class Cluster extends Commander {
+    options: ClusterOptions;
+    slots: NodeKey[][];
+    status: ClusterStatus;
+    /**
+     * @ignore
+     */
+    _groupsIds: {
+        [key: string]: number;
+    };
+    /**
+     * @ignore
+     */
+    _groupsBySlot: number[];
+    /**
+     * @ignore
+     */
+    isCluster: boolean;
+    private startupNodes;
+    private connectionPool;
+    private manuallyClosing;
+    private retryAttempts;
+    private delayQueue;
+    private offlineQueue;
+    private subscriber;
+    private shardedSubscribers;
+    private slotsTimer;
+    private reconnectTimeout;
+    private isRefreshing;
+    private _refreshSlotsCacheCallbacks;
+    private _autoPipelines;
+    private _runningAutoPipelines;
+    private _readyDelayedCallbacks;
+    private subscriberGroupEmitter;
+    /**
+     * Every time Cluster#connect() is called, this value will be
+     * auto-incrementing. The purpose of this value is used for
+     * discarding previous connect attampts when creating a new
+     * connection.
+     */
+    private connectionEpoch;
+    /**
+     * Creates an instance of Cluster.
+     */
+    constructor(startupNodes: ClusterNode[], options?: ClusterOptions);
+    /**
+     * Connect to a cluster
+     */
+    connect(): Promise<void>;
+    /**
+     * Disconnect from every node in the cluster.
+     */
+    disconnect(reconnect?: boolean): void;
+    /**
+     * Quit the cluster gracefully.
+     */
+    quit(callback?: Callback<"OK">): Promise<"OK">;
+    /**
+     * Create a new instance with the same startup nodes and options as the current one.
+     *
+     * @example
+     * ```js
+     * var cluster = new Redis.Cluster([{ host: "127.0.0.1", port: "30001" }]);
+     * var anotherCluster = cluster.duplicate();
+     * ```
+     */
+    duplicate(overrideStartupNodes?: any[], overrideOptions?: {}): Cluster;
+    /**
+     * Get nodes with the specified role
+     */
+    nodes(role?: NodeRole): Redis[];
+    /**
+     * This is needed in order not to install a listener for each auto pipeline
+     *
+     * @ignore
+     */
+    delayUntilReady(callback: Callback): void;
+    /**
+     * Get the number of commands queued in automatic pipelines.
+     *
+     * This is not available (and returns 0) until the cluster is connected and slots information have been received.
+     */
+    get autoPipelineQueueSize(): number;
+    /**
+     * Refresh the slot cache
+     *
+     * @ignore
+     */
+    refreshSlotsCache(callback?: Callback<void>): void;
+    /**
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream, node?: any): unknown;
+    sscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    sscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    hscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanStream(key: string, options?: ScanStreamOptions): ScanStream;
+    zscanBufferStream(key: string, options?: ScanStreamOptions): ScanStream;
+    /**
+     * @ignore
+     */
+    handleError(error: Error, ttl: {
+        value?: any;
+    }, handlers: any): void;
+    private resetOfflineQueue;
+    private clearNodesRefreshInterval;
+    private resetNodesRefreshInterval;
+    /**
+     * Change cluster instance's status
+     */
+    private setStatus;
+    /**
+     * Called when closed to check whether a reconnection should be made
+     */
+    private handleCloseEvent;
+    /**
+     * Flush offline queue with error.
+     */
+    private flushQueue;
+    private executeOfflineCommands;
+    private natMapper;
+    private getInfoFromNode;
+    private invokeReadyDelayedCallbacks;
+    /**
+     * Check whether Cluster is able to process commands
+     */
+    private readyCheck;
+    private resolveSrv;
+    private dnsLookup;
+    /**
+     * Normalize startup nodes, and resolving hostnames to IPs.
+     *
+     * This process happens every time when #connect() is called since
+     * #startupNodes and DNS records may chanage.
+     */
+    private resolveStartupNodeHostnames;
+    private createScanStream;
+    private createShardedSubscriberGroup;
+}
+interface Cluster extends EventEmitter {
+}
+interface Cluster extends Transaction {
+}
+export default Cluster;
diff --git a/node_modules/ioredis/built/cluster/index.js b/node_modules/ioredis/built/cluster/index.js
new file mode 100644
index 0000000..1c8d57b
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/index.js
@@ -0,0 +1,937 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const events_1 = require("events");
+const redis_errors_1 = require("redis-errors");
+const standard_as_callback_1 = require("standard-as-callback");
+const Command_1 = require("../Command");
+const ClusterAllFailedError_1 = require("../errors/ClusterAllFailedError");
+const Redis_1 = require("../Redis");
+const ScanStream_1 = require("../ScanStream");
+const transaction_1 = require("../transaction");
+const utils_1 = require("../utils");
+const applyMixin_1 = require("../utils/applyMixin");
+const Commander_1 = require("../utils/Commander");
+const ClusterOptions_1 = require("./ClusterOptions");
+const ClusterSubscriber_1 = require("./ClusterSubscriber");
+const ConnectionPool_1 = require("./ConnectionPool");
+const DelayQueue_1 = require("./DelayQueue");
+const util_1 = require("./util");
+const Deque = require("denque");
+const ClusterSubscriberGroup_1 = require("./ClusterSubscriberGroup");
+const debug = (0, utils_1.Debug)("cluster");
+const REJECT_OVERWRITTEN_COMMANDS = new WeakSet();
+/**
+ * Client for the official Redis Cluster
+ */
+class Cluster extends Commander_1.default {
+    /**
+     * Creates an instance of Cluster.
+     */
+    //TODO: Add an option that enables or disables sharded PubSub
+    constructor(startupNodes, options = {}) {
+        super();
+        this.slots = [];
+        /**
+         * @ignore
+         */
+        this._groupsIds = {};
+        /**
+         * @ignore
+         */
+        this._groupsBySlot = Array(16384);
+        /**
+         * @ignore
+         */
+        this.isCluster = true;
+        this.retryAttempts = 0;
+        this.delayQueue = new DelayQueue_1.default();
+        this.offlineQueue = new Deque();
+        this.isRefreshing = false;
+        this._refreshSlotsCacheCallbacks = [];
+        this._autoPipelines = new Map();
+        this._runningAutoPipelines = new Set();
+        this._readyDelayedCallbacks = [];
+        /**
+         * Every time Cluster#connect() is called, this value will be
+         * auto-incrementing. The purpose of this value is used for
+         * discarding previous connect attampts when creating a new
+         * connection.
+         */
+        this.connectionEpoch = 0;
+        events_1.EventEmitter.call(this);
+        this.startupNodes = startupNodes;
+        this.options = (0, utils_1.defaults)({}, options, ClusterOptions_1.DEFAULT_CLUSTER_OPTIONS, this.options);
+        if (this.options.shardedSubscribers) {
+            this.createShardedSubscriberGroup();
+        }
+        if (this.options.redisOptions &&
+            this.options.redisOptions.keyPrefix &&
+            !this.options.keyPrefix) {
+            this.options.keyPrefix = this.options.redisOptions.keyPrefix;
+        }
+        // validate options
+        if (typeof this.options.scaleReads !== "function" &&
+            ["all", "master", "slave"].indexOf(this.options.scaleReads) === -1) {
+            throw new Error('Invalid option scaleReads "' +
+                this.options.scaleReads +
+                '". Expected "all", "master", "slave" or a custom function');
+        }
+        this.connectionPool = new ConnectionPool_1.default(this.options.redisOptions);
+        this.connectionPool.on("-node", (redis, key) => {
+            this.emit("-node", redis);
+        });
+        this.connectionPool.on("+node", (redis) => {
+            this.emit("+node", redis);
+        });
+        this.connectionPool.on("drain", () => {
+            this.setStatus("close");
+        });
+        this.connectionPool.on("nodeError", (error, key) => {
+            this.emit("node error", error, key);
+        });
+        this.subscriber = new ClusterSubscriber_1.default(this.connectionPool, this);
+        if (this.options.scripts) {
+            Object.entries(this.options.scripts).forEach(([name, definition]) => {
+                this.defineCommand(name, definition);
+            });
+        }
+        if (this.options.lazyConnect) {
+            this.setStatus("wait");
+        }
+        else {
+            this.connect().catch((err) => {
+                debug("connecting failed: %s", err);
+            });
+        }
+    }
+    /**
+     * Connect to a cluster
+     */
+    connect() {
+        return new Promise((resolve, reject) => {
+            if (this.status === "connecting" ||
+                this.status === "connect" ||
+                this.status === "ready") {
+                reject(new Error("Redis is already connecting/connected"));
+                return;
+            }
+            const epoch = ++this.connectionEpoch;
+            this.setStatus("connecting");
+            this.resolveStartupNodeHostnames()
+                .then((nodes) => {
+                if (this.connectionEpoch !== epoch) {
+                    debug("discard connecting after resolving startup nodes because epoch not match: %d != %d", epoch, this.connectionEpoch);
+                    reject(new redis_errors_1.RedisError("Connection is discarded because a new connection is made"));
+                    return;
+                }
+                if (this.status !== "connecting") {
+                    debug("discard connecting after resolving startup nodes because the status changed to %s", this.status);
+                    reject(new redis_errors_1.RedisError("Connection is aborted"));
+                    return;
+                }
+                this.connectionPool.reset(nodes);
+                if (this.options.shardedSubscribers) {
+                    this.shardedSubscribers
+                        .reset(this.slots, this.connectionPool.getNodes("all"))
+                        .catch((err) => {
+                        // TODO should we emit an error event here?
+                        debug("Error while starting subscribers: %s", err);
+                    });
+                }
+                const readyHandler = () => {
+                    this.setStatus("ready");
+                    this.retryAttempts = 0;
+                    this.executeOfflineCommands();
+                    this.resetNodesRefreshInterval();
+                    resolve();
+                };
+                let closeListener = undefined;
+                const refreshListener = () => {
+                    this.invokeReadyDelayedCallbacks(undefined);
+                    this.removeListener("close", closeListener);
+                    this.manuallyClosing = false;
+                    this.setStatus("connect");
+                    if (this.options.enableReadyCheck) {
+                        this.readyCheck((err, fail) => {
+                            if (err || fail) {
+                                debug("Ready check failed (%s). Reconnecting...", err || fail);
+                                if (this.status === "connect") {
+                                    this.disconnect(true);
+                                }
+                            }
+                            else {
+                                readyHandler();
+                            }
+                        });
+                    }
+                    else {
+                        readyHandler();
+                    }
+                };
+                closeListener = () => {
+                    const error = new Error("None of startup nodes is available");
+                    this.removeListener("refresh", refreshListener);
+                    this.invokeReadyDelayedCallbacks(error);
+                    reject(error);
+                };
+                this.once("refresh", refreshListener);
+                this.once("close", closeListener);
+                this.once("close", this.handleCloseEvent.bind(this));
+                this.refreshSlotsCache((err) => {
+                    if (err && err.message === ClusterAllFailedError_1.default.defaultMessage) {
+                        Redis_1.default.prototype.silentEmit.call(this, "error", err);
+                        this.connectionPool.reset([]);
+                    }
+                });
+                this.subscriber.start();
+                if (this.options.shardedSubscribers) {
+                    this.shardedSubscribers.start().catch((err) => {
+                        // TODO should we emit an error event here?
+                        debug("Error while starting subscribers: %s", err);
+                    });
+                }
+            })
+                .catch((err) => {
+                this.setStatus("close");
+                this.handleCloseEvent(err);
+                this.invokeReadyDelayedCallbacks(err);
+                reject(err);
+            });
+        });
+    }
+    /**
+     * Disconnect from every node in the cluster.
+     */
+    disconnect(reconnect = false) {
+        const status = this.status;
+        this.setStatus("disconnecting");
+        if (!reconnect) {
+            this.manuallyClosing = true;
+        }
+        if (this.reconnectTimeout && !reconnect) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+            debug("Canceled reconnecting attempts");
+        }
+        this.clearNodesRefreshInterval();
+        this.subscriber.stop();
+        if (this.options.shardedSubscribers) {
+            this.shardedSubscribers.stop();
+        }
+        if (status === "wait") {
+            this.setStatus("close");
+            this.handleCloseEvent();
+        }
+        else {
+            this.connectionPool.reset([]);
+        }
+    }
+    /**
+     * Quit the cluster gracefully.
+     */
+    quit(callback) {
+        const status = this.status;
+        this.setStatus("disconnecting");
+        this.manuallyClosing = true;
+        if (this.reconnectTimeout) {
+            clearTimeout(this.reconnectTimeout);
+            this.reconnectTimeout = null;
+        }
+        this.clearNodesRefreshInterval();
+        this.subscriber.stop();
+        if (this.options.shardedSubscribers) {
+            this.shardedSubscribers.stop();
+        }
+        if (status === "wait") {
+            const ret = (0, standard_as_callback_1.default)(Promise.resolve("OK"), callback);
+            // use setImmediate to make sure "close" event
+            // being emitted after quit() is returned
+            setImmediate(function () {
+                this.setStatus("close");
+                this.handleCloseEvent();
+            }.bind(this));
+            return ret;
+        }
+        return (0, standard_as_callback_1.default)(Promise.all(this.nodes().map((node) => node.quit().catch((err) => {
+            // Ignore the error caused by disconnecting since
+            // we're disconnecting...
+            if (err.message === utils_1.CONNECTION_CLOSED_ERROR_MSG) {
+                return "OK";
+            }
+            throw err;
+        }))).then(() => "OK"), callback);
+    }
+    /**
+     * Create a new instance with the same startup nodes and options as the current one.
+     *
+     * @example
+     * ```js
+     * var cluster = new Redis.Cluster([{ host: "127.0.0.1", port: "30001" }]);
+     * var anotherCluster = cluster.duplicate();
+     * ```
+     */
+    duplicate(overrideStartupNodes = [], overrideOptions = {}) {
+        const startupNodes = overrideStartupNodes.length > 0
+            ? overrideStartupNodes
+            : this.startupNodes.slice(0);
+        const options = Object.assign({}, this.options, overrideOptions);
+        return new Cluster(startupNodes, options);
+    }
+    /**
+     * Get nodes with the specified role
+     */
+    nodes(role = "all") {
+        if (role !== "all" && role !== "master" && role !== "slave") {
+            throw new Error('Invalid role "' + role + '". Expected "all", "master" or "slave"');
+        }
+        return this.connectionPool.getNodes(role);
+    }
+    /**
+     * This is needed in order not to install a listener for each auto pipeline
+     *
+     * @ignore
+     */
+    delayUntilReady(callback) {
+        this._readyDelayedCallbacks.push(callback);
+    }
+    /**
+     * Get the number of commands queued in automatic pipelines.
+     *
+     * This is not available (and returns 0) until the cluster is connected and slots information have been received.
+     */
+    get autoPipelineQueueSize() {
+        let queued = 0;
+        for (const pipeline of this._autoPipelines.values()) {
+            queued += pipeline.length;
+        }
+        return queued;
+    }
+    /**
+     * Refresh the slot cache
+     *
+     * @ignore
+     */
+    refreshSlotsCache(callback) {
+        if (callback) {
+            this._refreshSlotsCacheCallbacks.push(callback);
+        }
+        if (this.isRefreshing) {
+            return;
+        }
+        this.isRefreshing = true;
+        const _this = this;
+        const wrapper = (error) => {
+            this.isRefreshing = false;
+            for (const callback of this._refreshSlotsCacheCallbacks) {
+                callback(error);
+            }
+            this._refreshSlotsCacheCallbacks = [];
+        };
+        const nodes = (0, utils_1.shuffle)(this.connectionPool.getNodes());
+        let lastNodeError = null;
+        function tryNode(index) {
+            if (index === nodes.length) {
+                const error = new ClusterAllFailedError_1.default(ClusterAllFailedError_1.default.defaultMessage, lastNodeError);
+                return wrapper(error);
+            }
+            const node = nodes[index];
+            const key = `${node.options.host}:${node.options.port}`;
+            debug("getting slot cache from %s", key);
+            _this.getInfoFromNode(node, function (err) {
+                switch (_this.status) {
+                    case "close":
+                    case "end":
+                        return wrapper(new Error("Cluster is disconnected."));
+                    case "disconnecting":
+                        return wrapper(new Error("Cluster is disconnecting."));
+                }
+                if (err) {
+                    _this.emit("node error", err, key);
+                    lastNodeError = err;
+                    tryNode(index + 1);
+                }
+                else {
+                    _this.emit("refresh");
+                    wrapper();
+                }
+            });
+        }
+        tryNode(0);
+    }
+    /**
+     * @ignore
+     */
+    sendCommand(command, stream, node) {
+        if (this.status === "wait") {
+            this.connect().catch(utils_1.noop);
+        }
+        if (this.status === "end") {
+            command.reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+            return command.promise;
+        }
+        let to = this.options.scaleReads;
+        if (to !== "master") {
+            const isCommandReadOnly = command.isReadOnly ||
+                ((0, commands_1.exists)(command.name) && (0, commands_1.hasFlag)(command.name, "readonly"));
+            if (!isCommandReadOnly) {
+                to = "master";
+            }
+        }
+        let targetSlot = node ? node.slot : command.getSlot();
+        const ttl = {};
+        const _this = this;
+        if (!node && !REJECT_OVERWRITTEN_COMMANDS.has(command)) {
+            REJECT_OVERWRITTEN_COMMANDS.add(command);
+            const reject = command.reject;
+            command.reject = function (err) {
+                const partialTry = tryConnection.bind(null, true);
+                _this.handleError(err, ttl, {
+                    moved: function (slot, key) {
+                        debug("command %s is moved to %s", command.name, key);
+                        targetSlot = Number(slot);
+                        if (_this.slots[slot]) {
+                            _this.slots[slot][0] = key;
+                        }
+                        else {
+                            _this.slots[slot] = [key];
+                        }
+                        _this._groupsBySlot[slot] =
+                            _this._groupsIds[_this.slots[slot].join(";")];
+                        _this.connectionPool.findOrCreate(_this.natMapper(key));
+                        tryConnection();
+                        debug("refreshing slot caches... (triggered by MOVED error)");
+                        _this.refreshSlotsCache();
+                    },
+                    ask: function (slot, key) {
+                        debug("command %s is required to ask %s:%s", command.name, key);
+                        const mapped = _this.natMapper(key);
+                        _this.connectionPool.findOrCreate(mapped);
+                        tryConnection(false, `${mapped.host}:${mapped.port}`);
+                    },
+                    tryagain: partialTry,
+                    clusterDown: partialTry,
+                    connectionClosed: partialTry,
+                    maxRedirections: function (redirectionError) {
+                        reject.call(command, redirectionError);
+                    },
+                    defaults: function () {
+                        reject.call(command, err);
+                    },
+                });
+            };
+        }
+        tryConnection();
+        function tryConnection(random, asking) {
+            if (_this.status === "end") {
+                command.reject(new redis_errors_1.AbortError("Cluster is ended."));
+                return;
+            }
+            let redis;
+            if (_this.status === "ready" || command.name === "cluster") {
+                if (node && node.redis) {
+                    redis = node.redis;
+                }
+                else if (Command_1.default.checkFlag("ENTER_SUBSCRIBER_MODE", command.name) ||
+                    Command_1.default.checkFlag("EXIT_SUBSCRIBER_MODE", command.name)) {
+                    if (_this.options.shardedSubscribers &&
+                        (command.name == "ssubscribe" || command.name == "sunsubscribe")) {
+                        const sub = _this.shardedSubscribers.getResponsibleSubscriber(targetSlot);
+                        if (!sub) {
+                            command.reject(new redis_errors_1.AbortError(`No sharded subscriber for slot: ${targetSlot}`));
+                            return;
+                        }
+                        let status = -1;
+                        if (command.name == "ssubscribe") {
+                            status = _this.shardedSubscribers.addChannels(command.getKeys());
+                        }
+                        if (command.name == "sunsubscribe") {
+                            status = _this.shardedSubscribers.removeChannels(command.getKeys());
+                        }
+                        if (status !== -1) {
+                            redis = sub.getInstance();
+                        }
+                        else {
+                            command.reject(new redis_errors_1.AbortError("Possible CROSSSLOT error: All channels must hash to the same slot"));
+                        }
+                    }
+                    else {
+                        redis = _this.subscriber.getInstance();
+                    }
+                    if (!redis) {
+                        command.reject(new redis_errors_1.AbortError("No subscriber for the cluster"));
+                        return;
+                    }
+                }
+                else {
+                    if (!random) {
+                        if (typeof targetSlot === "number" && _this.slots[targetSlot]) {
+                            const nodeKeys = _this.slots[targetSlot];
+                            if (typeof to === "function") {
+                                const nodes = nodeKeys.map(function (key) {
+                                    return _this.connectionPool.getInstanceByKey(key);
+                                });
+                                redis = to(nodes, command);
+                                if (Array.isArray(redis)) {
+                                    redis = (0, utils_1.sample)(redis);
+                                }
+                                if (!redis) {
+                                    redis = nodes[0];
+                                }
+                            }
+                            else {
+                                let key;
+                                if (to === "all") {
+                                    key = (0, utils_1.sample)(nodeKeys);
+                                }
+                                else if (to === "slave" && nodeKeys.length > 1) {
+                                    key = (0, utils_1.sample)(nodeKeys, 1);
+                                }
+                                else {
+                                    key = nodeKeys[0];
+                                }
+                                redis = _this.connectionPool.getInstanceByKey(key);
+                            }
+                        }
+                        if (asking) {
+                            redis = _this.connectionPool.getInstanceByKey(asking);
+                            redis.asking();
+                        }
+                    }
+                    if (!redis) {
+                        redis =
+                            (typeof to === "function"
+                                ? null
+                                : _this.connectionPool.getSampleInstance(to)) ||
+                                _this.connectionPool.getSampleInstance("all");
+                    }
+                }
+                if (node && !node.redis) {
+                    node.redis = redis;
+                }
+            }
+            if (redis) {
+                redis.sendCommand(command, stream);
+            }
+            else if (_this.options.enableOfflineQueue) {
+                _this.offlineQueue.push({
+                    command: command,
+                    stream: stream,
+                    node: node,
+                });
+            }
+            else {
+                command.reject(new Error("Cluster isn't ready and enableOfflineQueue options is false"));
+            }
+        }
+        return command.promise;
+    }
+    sscanStream(key, options) {
+        return this.createScanStream("sscan", { key, options });
+    }
+    sscanBufferStream(key, options) {
+        return this.createScanStream("sscanBuffer", { key, options });
+    }
+    hscanStream(key, options) {
+        return this.createScanStream("hscan", { key, options });
+    }
+    hscanBufferStream(key, options) {
+        return this.createScanStream("hscanBuffer", { key, options });
+    }
+    zscanStream(key, options) {
+        return this.createScanStream("zscan", { key, options });
+    }
+    zscanBufferStream(key, options) {
+        return this.createScanStream("zscanBuffer", { key, options });
+    }
+    /**
+     * @ignore
+     */
+    handleError(error, ttl, handlers) {
+        if (typeof ttl.value === "undefined") {
+            ttl.value = this.options.maxRedirections;
+        }
+        else {
+            ttl.value -= 1;
+        }
+        if (ttl.value <= 0) {
+            handlers.maxRedirections(new Error("Too many Cluster redirections. Last error: " + error));
+            return;
+        }
+        const errv = error.message.split(" ");
+        if (errv[0] === "MOVED") {
+            const timeout = this.options.retryDelayOnMoved;
+            if (timeout && typeof timeout === "number") {
+                this.delayQueue.push("moved", handlers.moved.bind(null, errv[1], errv[2]), { timeout });
+            }
+            else {
+                handlers.moved(errv[1], errv[2]);
+            }
+        }
+        else if (errv[0] === "ASK") {
+            handlers.ask(errv[1], errv[2]);
+        }
+        else if (errv[0] === "TRYAGAIN") {
+            this.delayQueue.push("tryagain", handlers.tryagain, {
+                timeout: this.options.retryDelayOnTryAgain,
+            });
+        }
+        else if (errv[0] === "CLUSTERDOWN" &&
+            this.options.retryDelayOnClusterDown > 0) {
+            this.delayQueue.push("clusterdown", handlers.connectionClosed, {
+                timeout: this.options.retryDelayOnClusterDown,
+                callback: this.refreshSlotsCache.bind(this),
+            });
+        }
+        else if (error.message === utils_1.CONNECTION_CLOSED_ERROR_MSG &&
+            this.options.retryDelayOnFailover > 0 &&
+            this.status === "ready") {
+            this.delayQueue.push("failover", handlers.connectionClosed, {
+                timeout: this.options.retryDelayOnFailover,
+                callback: this.refreshSlotsCache.bind(this),
+            });
+        }
+        else {
+            handlers.defaults();
+        }
+    }
+    resetOfflineQueue() {
+        this.offlineQueue = new Deque();
+    }
+    clearNodesRefreshInterval() {
+        if (this.slotsTimer) {
+            clearTimeout(this.slotsTimer);
+            this.slotsTimer = null;
+        }
+    }
+    resetNodesRefreshInterval() {
+        if (this.slotsTimer || !this.options.slotsRefreshInterval) {
+            return;
+        }
+        const nextRound = () => {
+            this.slotsTimer = setTimeout(() => {
+                debug('refreshing slot caches... (triggered by "slotsRefreshInterval" option)');
+                this.refreshSlotsCache(() => {
+                    nextRound();
+                });
+            }, this.options.slotsRefreshInterval);
+        };
+        nextRound();
+    }
+    /**
+     * Change cluster instance's status
+     */
+    setStatus(status) {
+        debug("status: %s -> %s", this.status || "[empty]", status);
+        this.status = status;
+        process.nextTick(() => {
+            this.emit(status);
+        });
+    }
+    /**
+     * Called when closed to check whether a reconnection should be made
+     */
+    handleCloseEvent(reason) {
+        var _a;
+        if (reason) {
+            debug("closed because %s", reason);
+        }
+        let retryDelay;
+        if (!this.manuallyClosing &&
+            typeof this.options.clusterRetryStrategy === "function") {
+            retryDelay = this.options.clusterRetryStrategy.call(this, ++this.retryAttempts, reason);
+        }
+        if (typeof retryDelay === "number") {
+            this.setStatus("reconnecting");
+            this.reconnectTimeout = setTimeout(() => {
+                this.reconnectTimeout = null;
+                debug("Cluster is disconnected. Retrying after %dms", retryDelay);
+                this.connect().catch(function (err) {
+                    debug("Got error %s when reconnecting. Ignoring...", err);
+                });
+            }, retryDelay);
+        }
+        else {
+            if (this.options.shardedSubscribers) {
+                (_a = this.subscriberGroupEmitter) === null || _a === void 0 ? void 0 : _a.removeAllListeners();
+            }
+            this.setStatus("end");
+            this.flushQueue(new Error("None of startup nodes is available"));
+        }
+    }
+    /**
+     * Flush offline queue with error.
+     */
+    flushQueue(error) {
+        let item;
+        while ((item = this.offlineQueue.shift())) {
+            item.command.reject(error);
+        }
+    }
+    executeOfflineCommands() {
+        if (this.offlineQueue.length) {
+            debug("send %d commands in offline queue", this.offlineQueue.length);
+            const offlineQueue = this.offlineQueue;
+            this.resetOfflineQueue();
+            let item;
+            while ((item = offlineQueue.shift())) {
+                this.sendCommand(item.command, item.stream, item.node);
+            }
+        }
+    }
+    natMapper(nodeKey) {
+        const key = typeof nodeKey === "string"
+            ? nodeKey
+            : `${nodeKey.host}:${nodeKey.port}`;
+        let mapped = null;
+        if (this.options.natMap && typeof this.options.natMap === "function") {
+            mapped = this.options.natMap(key);
+        }
+        else if (this.options.natMap && typeof this.options.natMap === "object") {
+            mapped = this.options.natMap[key];
+        }
+        if (mapped) {
+            debug("NAT mapping %s -> %O", key, mapped);
+            return Object.assign({}, mapped);
+        }
+        return typeof nodeKey === "string"
+            ? (0, util_1.nodeKeyToRedisOptions)(nodeKey)
+            : nodeKey;
+    }
+    getInfoFromNode(redis, callback) {
+        if (!redis) {
+            return callback(new Error("Node is disconnected"));
+        }
+        // Use a duplication of the connection to avoid
+        // timeouts when the connection is in the blocking
+        // mode (e.g. waiting for BLPOP).
+        const duplicatedConnection = redis.duplicate({
+            enableOfflineQueue: true,
+            enableReadyCheck: false,
+            retryStrategy: null,
+            connectionName: (0, util_1.getConnectionName)("refresher", this.options.redisOptions && this.options.redisOptions.connectionName),
+        });
+        // Ignore error events since we will handle
+        // exceptions for the CLUSTER SLOTS command.
+        duplicatedConnection.on("error", utils_1.noop);
+        duplicatedConnection.cluster("SLOTS", (0, utils_1.timeout)((err, result) => {
+            duplicatedConnection.disconnect();
+            if (err) {
+                debug("error encountered running CLUSTER.SLOTS: %s", err);
+                return callback(err);
+            }
+            if (this.status === "disconnecting" ||
+                this.status === "close" ||
+                this.status === "end") {
+                debug("ignore CLUSTER.SLOTS results (count: %d) since cluster status is %s", result.length, this.status);
+                callback();
+                return;
+            }
+            const nodes = [];
+            debug("cluster slots result count: %d", result.length);
+            for (let i = 0; i < result.length; ++i) {
+                const items = result[i];
+                const slotRangeStart = items[0];
+                const slotRangeEnd = items[1];
+                const keys = [];
+                for (let j = 2; j < items.length; j++) {
+                    if (!items[j][0]) {
+                        continue;
+                    }
+                    const node = this.natMapper({
+                        host: items[j][0],
+                        port: items[j][1],
+                    });
+                    node.readOnly = j !== 2;
+                    nodes.push(node);
+                    keys.push(node.host + ":" + node.port);
+                }
+                debug("cluster slots result [%d]: slots %d~%d served by %s", i, slotRangeStart, slotRangeEnd, keys);
+                for (let slot = slotRangeStart; slot <= slotRangeEnd; slot++) {
+                    this.slots[slot] = keys;
+                }
+            }
+            // Assign to each node keys a numeric value to make autopipeline comparison faster.
+            this._groupsIds = Object.create(null);
+            let j = 0;
+            for (let i = 0; i < 16384; i++) {
+                const target = (this.slots[i] || []).join(";");
+                if (!target.length) {
+                    this._groupsBySlot[i] = undefined;
+                    continue;
+                }
+                if (!this._groupsIds[target]) {
+                    this._groupsIds[target] = ++j;
+                }
+                this._groupsBySlot[i] = this._groupsIds[target];
+            }
+            this.connectionPool.reset(nodes);
+            if (this.options.shardedSubscribers) {
+                this.shardedSubscribers
+                    .reset(this.slots, this.connectionPool.getNodes("all"))
+                    .catch((err) => {
+                    // TODO should we emit an error event here?
+                    debug("Error while starting subscribers: %s", err);
+                });
+            }
+            callback();
+        }, this.options.slotsRefreshTimeout));
+    }
+    invokeReadyDelayedCallbacks(err) {
+        for (const c of this._readyDelayedCallbacks) {
+            process.nextTick(c, err);
+        }
+        this._readyDelayedCallbacks = [];
+    }
+    /**
+     * Check whether Cluster is able to process commands
+     */
+    readyCheck(callback) {
+        this.cluster("INFO", (err, res) => {
+            if (err) {
+                return callback(err);
+            }
+            if (typeof res !== "string") {
+                return callback();
+            }
+            let state;
+            const lines = res.split("\r\n");
+            for (let i = 0; i < lines.length; ++i) {
+                const parts = lines[i].split(":");
+                if (parts[0] === "cluster_state") {
+                    state = parts[1];
+                    break;
+                }
+            }
+            if (state === "fail") {
+                debug("cluster state not ok (%s)", state);
+                callback(null, state);
+            }
+            else {
+                callback();
+            }
+        });
+    }
+    resolveSrv(hostname) {
+        return new Promise((resolve, reject) => {
+            this.options.resolveSrv(hostname, (err, records) => {
+                if (err) {
+                    return reject(err);
+                }
+                const self = this, groupedRecords = (0, util_1.groupSrvRecords)(records), sortedKeys = Object.keys(groupedRecords).sort((a, b) => parseInt(a) - parseInt(b));
+                function tryFirstOne(err) {
+                    if (!sortedKeys.length) {
+                        return reject(err);
+                    }
+                    const key = sortedKeys[0], group = groupedRecords[key], record = (0, util_1.weightSrvRecords)(group);
+                    if (!group.records.length) {
+                        sortedKeys.shift();
+                    }
+                    self.dnsLookup(record.name).then((host) => resolve({
+                        host,
+                        port: record.port,
+                    }), tryFirstOne);
+                }
+                tryFirstOne();
+            });
+        });
+    }
+    dnsLookup(hostname) {
+        return new Promise((resolve, reject) => {
+            this.options.dnsLookup(hostname, (err, address) => {
+                if (err) {
+                    debug("failed to resolve hostname %s to IP: %s", hostname, err.message);
+                    reject(err);
+                }
+                else {
+                    debug("resolved hostname %s to IP %s", hostname, address);
+                    resolve(address);
+                }
+            });
+        });
+    }
+    /**
+     * Normalize startup nodes, and resolving hostnames to IPs.
+     *
+     * This process happens every time when #connect() is called since
+     * #startupNodes and DNS records may chanage.
+     */
+    async resolveStartupNodeHostnames() {
+        if (!Array.isArray(this.startupNodes) || this.startupNodes.length === 0) {
+            throw new Error("`startupNodes` should contain at least one node.");
+        }
+        const startupNodes = (0, util_1.normalizeNodeOptions)(this.startupNodes);
+        const hostnames = (0, util_1.getUniqueHostnamesFromOptions)(startupNodes);
+        if (hostnames.length === 0) {
+            return startupNodes;
+        }
+        const configs = await Promise.all(hostnames.map((this.options.useSRVRecords ? this.resolveSrv : this.dnsLookup).bind(this)));
+        const hostnameToConfig = (0, utils_1.zipMap)(hostnames, configs);
+        return startupNodes.map((node) => {
+            const config = hostnameToConfig.get(node.host);
+            if (!config) {
+                return node;
+            }
+            if (this.options.useSRVRecords) {
+                return Object.assign({}, node, config);
+            }
+            return Object.assign({}, node, { host: config });
+        });
+    }
+    createScanStream(command, { key, options = {} }) {
+        return new ScanStream_1.default({
+            objectMode: true,
+            key: key,
+            redis: this,
+            command: command,
+            ...options,
+        });
+    }
+    createShardedSubscriberGroup() {
+        this.subscriberGroupEmitter = new events_1.EventEmitter();
+        this.shardedSubscribers = new ClusterSubscriberGroup_1.default(this.subscriberGroupEmitter, this.options);
+        // Error handler used only for sharded-subscriber-triggered slots cache refreshes.
+        // Normal (non-subscriber) connections are created with lazyConnect: true and can
+        // become zombied. For sharded subscribers, a ClusterAllFailedError means
+        // we have lost all nodes from the subscriber perspective and must tear down.
+        const refreshSlotsCacheCallback = (err) => {
+            // Disconnect only when refreshing the slots cache fails with ClusterAllFailedError
+            if (err instanceof ClusterAllFailedError_1.default) {
+                this.disconnect(true);
+            }
+        };
+        this.subscriberGroupEmitter.on("-node", (redis, nodeKey) => {
+            this.emit("-node", redis, nodeKey);
+            this.refreshSlotsCache(refreshSlotsCacheCallback);
+        });
+        this.subscriberGroupEmitter.on("subscriberConnectFailed", ({ delay, error }) => {
+            this.emit("error", error);
+            setTimeout(() => {
+                this.refreshSlotsCache(refreshSlotsCacheCallback);
+            }, delay);
+        });
+        this.subscriberGroupEmitter.on("moved", () => {
+            this.refreshSlotsCache(refreshSlotsCacheCallback);
+        });
+        this.subscriberGroupEmitter.on("-subscriber", () => {
+            this.emit("-subscriber");
+        });
+        this.subscriberGroupEmitter.on("+subscriber", () => {
+            this.emit("+subscriber");
+        });
+        this.subscriberGroupEmitter.on("nodeError", (error, nodeKey) => {
+            this.emit("nodeError", error, nodeKey);
+        });
+        this.subscriberGroupEmitter.on("subscribersReady", () => {
+            this.emit("subscribersReady");
+        });
+        for (const event of ["smessage", "smessageBuffer"]) {
+            this.subscriberGroupEmitter.on(event, (arg1, arg2, arg3) => {
+                this.emit(event, arg1, arg2, arg3);
+            });
+        }
+    }
+}
+(0, applyMixin_1.default)(Cluster, events_1.EventEmitter);
+(0, transaction_1.addTransactionSupport)(Cluster.prototype);
+exports.default = Cluster;
diff --git a/node_modules/ioredis/built/cluster/util.d.ts b/node_modules/ioredis/built/cluster/util.d.ts
new file mode 100644
index 0000000..d8629c3
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/util.d.ts
@@ -0,0 +1,25 @@
+/// <reference types="node" />
+import { SrvRecord } from "dns";
+export declare type NodeKey = string;
+export declare type NodeRole = "master" | "slave" | "all";
+export interface RedisOptions {
+    port: number;
+    host: string;
+    username?: string | undefined;
+    password?: string | undefined;
+    [key: string]: any;
+}
+export interface SrvRecordsGroup {
+    totalWeight: number;
+    records: SrvRecord[];
+}
+export interface GroupedSrvRecords {
+    [key: number]: SrvRecordsGroup;
+}
+export declare function getNodeKey(node: RedisOptions): NodeKey;
+export declare function nodeKeyToRedisOptions(nodeKey: NodeKey): RedisOptions;
+export declare function normalizeNodeOptions(nodes: Array<string | number | object>): RedisOptions[];
+export declare function getUniqueHostnamesFromOptions(nodes: RedisOptions[]): string[];
+export declare function groupSrvRecords(records: SrvRecord[]): GroupedSrvRecords;
+export declare function weightSrvRecords(recordsGroup: SrvRecordsGroup): SrvRecord;
+export declare function getConnectionName(component: any, nodeConnectionName: any): string;
diff --git a/node_modules/ioredis/built/cluster/util.js b/node_modules/ioredis/built/cluster/util.js
new file mode 100644
index 0000000..e3a779b
--- /dev/null
+++ b/node_modules/ioredis/built/cluster/util.js
@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getConnectionName = exports.weightSrvRecords = exports.groupSrvRecords = exports.getUniqueHostnamesFromOptions = exports.normalizeNodeOptions = exports.nodeKeyToRedisOptions = exports.getNodeKey = void 0;
+const utils_1 = require("../utils");
+const net_1 = require("net");
+function getNodeKey(node) {
+    node.port = node.port || 6379;
+    node.host = node.host || "127.0.0.1";
+    return node.host + ":" + node.port;
+}
+exports.getNodeKey = getNodeKey;
+function nodeKeyToRedisOptions(nodeKey) {
+    const portIndex = nodeKey.lastIndexOf(":");
+    if (portIndex === -1) {
+        throw new Error(`Invalid node key ${nodeKey}`);
+    }
+    return {
+        host: nodeKey.slice(0, portIndex),
+        port: Number(nodeKey.slice(portIndex + 1)),
+    };
+}
+exports.nodeKeyToRedisOptions = nodeKeyToRedisOptions;
+function normalizeNodeOptions(nodes) {
+    return nodes.map((node) => {
+        const options = {};
+        if (typeof node === "object") {
+            Object.assign(options, node);
+        }
+        else if (typeof node === "string") {
+            Object.assign(options, (0, utils_1.parseURL)(node));
+        }
+        else if (typeof node === "number") {
+            options.port = node;
+        }
+        else {
+            throw new Error("Invalid argument " + node);
+        }
+        if (typeof options.port === "string") {
+            options.port = parseInt(options.port, 10);
+        }
+        // Cluster mode only support db 0
+        delete options.db;
+        if (!options.port) {
+            options.port = 6379;
+        }
+        if (!options.host) {
+            options.host = "127.0.0.1";
+        }
+        return (0, utils_1.resolveTLSProfile)(options);
+    });
+}
+exports.normalizeNodeOptions = normalizeNodeOptions;
+function getUniqueHostnamesFromOptions(nodes) {
+    const uniqueHostsMap = {};
+    nodes.forEach((node) => {
+        uniqueHostsMap[node.host] = true;
+    });
+    return Object.keys(uniqueHostsMap).filter((host) => !(0, net_1.isIP)(host));
+}
+exports.getUniqueHostnamesFromOptions = getUniqueHostnamesFromOptions;
+function groupSrvRecords(records) {
+    const recordsByPriority = {};
+    for (const record of records) {
+        if (!recordsByPriority.hasOwnProperty(record.priority)) {
+            recordsByPriority[record.priority] = {
+                totalWeight: record.weight,
+                records: [record],
+            };
+        }
+        else {
+            recordsByPriority[record.priority].totalWeight += record.weight;
+            recordsByPriority[record.priority].records.push(record);
+        }
+    }
+    return recordsByPriority;
+}
+exports.groupSrvRecords = groupSrvRecords;
+function weightSrvRecords(recordsGroup) {
+    if (recordsGroup.records.length === 1) {
+        recordsGroup.totalWeight = 0;
+        return recordsGroup.records.shift();
+    }
+    // + `recordsGroup.records.length` to support `weight` 0
+    const random = Math.floor(Math.random() * (recordsGroup.totalWeight + recordsGroup.records.length));
+    let total = 0;
+    for (const [i, record] of recordsGroup.records.entries()) {
+        total += 1 + record.weight;
+        if (total > random) {
+            recordsGroup.totalWeight -= record.weight;
+            recordsGroup.records.splice(i, 1);
+            return record;
+        }
+    }
+}
+exports.weightSrvRecords = weightSrvRecords;
+function getConnectionName(component, nodeConnectionName) {
+    const prefix = `ioredis-cluster(${component})`;
+    return nodeConnectionName ? `${prefix}:${nodeConnectionName}` : prefix;
+}
+exports.getConnectionName = getConnectionName;
diff --git a/node_modules/ioredis/built/connectors/AbstractConnector.d.ts b/node_modules/ioredis/built/connectors/AbstractConnector.d.ts
new file mode 100644
index 0000000..14bdbaa
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/AbstractConnector.d.ts
@@ -0,0 +1,12 @@
+import { NetStream } from "../types";
+export declare type ErrorEmitter = (type: string, err: Error) => void;
+export default abstract class AbstractConnector {
+    firstError?: Error;
+    protected connecting: boolean;
+    protected stream: NetStream;
+    private disconnectTimeout;
+    constructor(disconnectTimeout: number);
+    check(info: any): boolean;
+    disconnect(): void;
+    abstract connect(_: ErrorEmitter): Promise<NetStream>;
+}
diff --git a/node_modules/ioredis/built/connectors/AbstractConnector.js b/node_modules/ioredis/built/connectors/AbstractConnector.js
new file mode 100644
index 0000000..2e2151d
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/AbstractConnector.js
@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("../utils");
+const debug = (0, utils_1.Debug)("AbstractConnector");
+class AbstractConnector {
+    constructor(disconnectTimeout) {
+        this.connecting = false;
+        this.disconnectTimeout = disconnectTimeout;
+    }
+    check(info) {
+        return true;
+    }
+    disconnect() {
+        this.connecting = false;
+        if (this.stream) {
+            const stream = this.stream; // Make sure callbacks refer to the same instance
+            const timeout = setTimeout(() => {
+                debug("stream %s:%s still open, destroying it", stream.remoteAddress, stream.remotePort);
+                stream.destroy();
+            }, this.disconnectTimeout);
+            stream.on("close", () => clearTimeout(timeout));
+            stream.end();
+        }
+    }
+}
+exports.default = AbstractConnector;
diff --git a/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts b/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts
new file mode 100644
index 0000000..2f332ae
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/ConnectorConstructor.d.ts
@@ -0,0 +1,5 @@
+import AbstractConnector from "./AbstractConnector";
+interface ConnectorConstructor {
+    new (options: unknown): AbstractConnector;
+}
+export default ConnectorConstructor;
diff --git a/node_modules/ioredis/built/connectors/ConnectorConstructor.js b/node_modules/ioredis/built/connectors/ConnectorConstructor.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/ConnectorConstructor.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts b/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts
new file mode 100644
index 0000000..abd44e5
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.d.ts
@@ -0,0 +1,11 @@
+import SentinelConnector from "./index";
+import { Sentinel } from "./types";
+export declare class FailoverDetector {
+    private connector;
+    private sentinels;
+    private isDisconnected;
+    constructor(connector: SentinelConnector, sentinels: Sentinel[]);
+    cleanup(): void;
+    subscribe(): Promise<void>;
+    private disconnect;
+}
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js b/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js
new file mode 100644
index 0000000..8db28d0
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/FailoverDetector.js
@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FailoverDetector = void 0;
+const utils_1 = require("../../utils");
+const debug = (0, utils_1.Debug)("FailoverDetector");
+const CHANNEL_NAME = "+switch-master";
+class FailoverDetector {
+    // sentinels can't be used for regular commands after this
+    constructor(connector, sentinels) {
+        this.isDisconnected = false;
+        this.connector = connector;
+        this.sentinels = sentinels;
+    }
+    cleanup() {
+        this.isDisconnected = true;
+        for (const sentinel of this.sentinels) {
+            sentinel.client.disconnect();
+        }
+    }
+    async subscribe() {
+        debug("Starting FailoverDetector");
+        const promises = [];
+        for (const sentinel of this.sentinels) {
+            const promise = sentinel.client.subscribe(CHANNEL_NAME).catch((err) => {
+                debug("Failed to subscribe to failover messages on sentinel %s:%s (%s)", sentinel.address.host || "127.0.0.1", sentinel.address.port || 26739, err.message);
+            });
+            promises.push(promise);
+            sentinel.client.on("message", (channel) => {
+                if (!this.isDisconnected && channel === CHANNEL_NAME) {
+                    this.disconnect();
+                }
+            });
+        }
+        await Promise.all(promises);
+    }
+    disconnect() {
+        // Avoid disconnecting more than once per failover.
+        // A new FailoverDetector will be created after reconnecting.
+        this.isDisconnected = true;
+        debug("Failover detected, disconnecting");
+        // Will call this.cleanup()
+        this.connector.disconnect();
+    }
+}
+exports.FailoverDetector = FailoverDetector;
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts b/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts
new file mode 100644
index 0000000..fbe5f34
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.d.ts
@@ -0,0 +1,13 @@
+import { SentinelAddress } from "./types";
+export default class SentinelIterator implements Iterator<Partial<SentinelAddress>> {
+    private cursor;
+    private sentinels;
+    constructor(sentinels: Array<Partial<SentinelAddress>>);
+    next(): {
+        done: boolean;
+        value: Partial<SentinelAddress>;
+    };
+    reset(moveCurrentEndpointToFirst: boolean): void;
+    add(sentinel: SentinelAddress): boolean;
+    toString(): string;
+}
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js b/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js
new file mode 100644
index 0000000..3399bae
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/SentinelIterator.js
@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function isSentinelEql(a, b) {
+    return ((a.host || "127.0.0.1") === (b.host || "127.0.0.1") &&
+        (a.port || 26379) === (b.port || 26379));
+}
+class SentinelIterator {
+    constructor(sentinels) {
+        this.cursor = 0;
+        this.sentinels = sentinels.slice(0);
+    }
+    next() {
+        const done = this.cursor >= this.sentinels.length;
+        return { done, value: done ? undefined : this.sentinels[this.cursor++] };
+    }
+    reset(moveCurrentEndpointToFirst) {
+        if (moveCurrentEndpointToFirst &&
+            this.sentinels.length > 1 &&
+            this.cursor !== 1) {
+            this.sentinels.unshift(...this.sentinels.splice(this.cursor - 1));
+        }
+        this.cursor = 0;
+    }
+    add(sentinel) {
+        for (let i = 0; i < this.sentinels.length; i++) {
+            if (isSentinelEql(sentinel, this.sentinels[i])) {
+                return false;
+            }
+        }
+        this.sentinels.push(sentinel);
+        return true;
+    }
+    toString() {
+        return `${JSON.stringify(this.sentinels)} @${this.cursor}`;
+    }
+}
+exports.default = SentinelIterator;
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts b/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts
new file mode 100644
index 0000000..66660e5
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/index.d.ts
@@ -0,0 +1,72 @@
+/// <reference types="node" />
+import { EventEmitter } from "events";
+import { NatMap } from "../../cluster/ClusterOptions";
+import { ConnectionOptions } from "tls";
+import SentinelIterator from "./SentinelIterator";
+import { SentinelAddress } from "./types";
+import AbstractConnector, { ErrorEmitter } from "../AbstractConnector";
+import { NetStream } from "../../types";
+interface AddressFromResponse {
+    port: string;
+    ip: string;
+    flags?: string | undefined;
+}
+declare type PreferredSlaves = ((slaves: AddressFromResponse[]) => AddressFromResponse | null) | Array<{
+    port: string;
+    ip: string;
+    prio?: number | undefined;
+}> | {
+    port: string;
+    ip: string;
+    prio?: number | undefined;
+};
+export { SentinelAddress, SentinelIterator };
+export interface SentinelConnectionOptions {
+    /**
+     * Master group name of the Sentinel
+     */
+    name?: string | undefined;
+    /**
+     * @default "master"
+     */
+    role?: "master" | "slave" | undefined;
+    tls?: ConnectionOptions | undefined;
+    sentinelUsername?: string | undefined;
+    sentinelPassword?: string | undefined;
+    sentinels?: Array<Partial<SentinelAddress>> | undefined;
+    sentinelRetryStrategy?: ((retryAttempts: number) => number | void | null) | undefined;
+    sentinelReconnectStrategy?: ((retryAttempts: number) => number | void | null) | undefined;
+    preferredSlaves?: PreferredSlaves | undefined;
+    connectTimeout?: number | undefined;
+    disconnectTimeout?: number | undefined;
+    sentinelCommandTimeout?: number | undefined;
+    enableTLSForSentinelMode?: boolean | undefined;
+    sentinelTLS?: ConnectionOptions | undefined;
+    natMap?: NatMap | undefined;
+    updateSentinels?: boolean | undefined;
+    /**
+     * @default 10
+     */
+    sentinelMaxConnections?: number | undefined;
+    failoverDetector?: boolean | undefined;
+}
+export default class SentinelConnector extends AbstractConnector {
+    protected options: SentinelConnectionOptions;
+    emitter: EventEmitter | null;
+    protected sentinelIterator: SentinelIterator;
+    private retryAttempts;
+    private failoverDetector;
+    constructor(options: SentinelConnectionOptions);
+    check(info: {
+        role?: string;
+    }): boolean;
+    disconnect(): void;
+    connect(eventEmitter: ErrorEmitter): Promise<NetStream>;
+    private updateSentinels;
+    private resolveMaster;
+    private resolveSlave;
+    private sentinelNatResolve;
+    private connectToSentinel;
+    private resolve;
+    private initFailoverDetector;
+}
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/index.js b/node_modules/ioredis/built/connectors/SentinelConnector/index.js
new file mode 100644
index 0000000..5cb4b48
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/index.js
@@ -0,0 +1,305 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SentinelIterator = void 0;
+const net_1 = require("net");
+const utils_1 = require("../../utils");
+const tls_1 = require("tls");
+const SentinelIterator_1 = require("./SentinelIterator");
+exports.SentinelIterator = SentinelIterator_1.default;
+const AbstractConnector_1 = require("../AbstractConnector");
+const Redis_1 = require("../../Redis");
+const FailoverDetector_1 = require("./FailoverDetector");
+const debug = (0, utils_1.Debug)("SentinelConnector");
+class SentinelConnector extends AbstractConnector_1.default {
+    constructor(options) {
+        super(options.disconnectTimeout);
+        this.options = options;
+        this.emitter = null;
+        this.failoverDetector = null;
+        if (!this.options.sentinels.length) {
+            throw new Error("Requires at least one sentinel to connect to.");
+        }
+        if (!this.options.name) {
+            throw new Error("Requires the name of master.");
+        }
+        this.sentinelIterator = new SentinelIterator_1.default(this.options.sentinels);
+    }
+    check(info) {
+        const roleMatches = !info.role || this.options.role === info.role;
+        if (!roleMatches) {
+            debug("role invalid, expected %s, but got %s", this.options.role, info.role);
+            // Start from the next item.
+            // Note that `reset` will move the cursor to the previous element,
+            // so we advance two steps here.
+            this.sentinelIterator.next();
+            this.sentinelIterator.next();
+            this.sentinelIterator.reset(true);
+        }
+        return roleMatches;
+    }
+    disconnect() {
+        super.disconnect();
+        if (this.failoverDetector) {
+            this.failoverDetector.cleanup();
+        }
+    }
+    connect(eventEmitter) {
+        this.connecting = true;
+        this.retryAttempts = 0;
+        let lastError;
+        const connectToNext = async () => {
+            const endpoint = this.sentinelIterator.next();
+            if (endpoint.done) {
+                this.sentinelIterator.reset(false);
+                const retryDelay = typeof this.options.sentinelRetryStrategy === "function"
+                    ? this.options.sentinelRetryStrategy(++this.retryAttempts)
+                    : null;
+                let errorMsg = typeof retryDelay !== "number"
+                    ? "All sentinels are unreachable and retry is disabled."
+                    : `All sentinels are unreachable. Retrying from scratch after ${retryDelay}ms.`;
+                if (lastError) {
+                    errorMsg += ` Last error: ${lastError.message}`;
+                }
+                debug(errorMsg);
+                const error = new Error(errorMsg);
+                if (typeof retryDelay === "number") {
+                    eventEmitter("error", error);
+                    await new Promise((resolve) => setTimeout(resolve, retryDelay));
+                    return connectToNext();
+                }
+                else {
+                    throw error;
+                }
+            }
+            let resolved = null;
+            let err = null;
+            try {
+                resolved = await this.resolve(endpoint.value);
+            }
+            catch (error) {
+                err = error;
+            }
+            if (!this.connecting) {
+                throw new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG);
+            }
+            const endpointAddress = endpoint.value.host + ":" + endpoint.value.port;
+            if (resolved) {
+                debug("resolved: %s:%s from sentinel %s", resolved.host, resolved.port, endpointAddress);
+                if (this.options.enableTLSForSentinelMode && this.options.tls) {
+                    Object.assign(resolved, this.options.tls);
+                    this.stream = (0, tls_1.connect)(resolved);
+                    this.stream.once("secureConnect", this.initFailoverDetector.bind(this));
+                }
+                else {
+                    this.stream = (0, net_1.createConnection)(resolved);
+                    this.stream.once("connect", this.initFailoverDetector.bind(this));
+                }
+                this.stream.once("error", (err) => {
+                    this.firstError = err;
+                });
+                return this.stream;
+            }
+            else {
+                const errorMsg = err
+                    ? "failed to connect to sentinel " +
+                        endpointAddress +
+                        " because " +
+                        err.message
+                    : "connected to sentinel " +
+                        endpointAddress +
+                        " successfully, but got an invalid reply: " +
+                        resolved;
+                debug(errorMsg);
+                eventEmitter("sentinelError", new Error(errorMsg));
+                if (err) {
+                    lastError = err;
+                }
+                return connectToNext();
+            }
+        };
+        return connectToNext();
+    }
+    async updateSentinels(client) {
+        if (!this.options.updateSentinels) {
+            return;
+        }
+        const result = await client.sentinel("sentinels", this.options.name);
+        if (!Array.isArray(result)) {
+            return;
+        }
+        result
+            .map(utils_1.packObject)
+            .forEach((sentinel) => {
+            const flags = sentinel.flags ? sentinel.flags.split(",") : [];
+            if (flags.indexOf("disconnected") === -1 &&
+                sentinel.ip &&
+                sentinel.port) {
+                const endpoint = this.sentinelNatResolve(addressResponseToAddress(sentinel));
+                if (this.sentinelIterator.add(endpoint)) {
+                    debug("adding sentinel %s:%s", endpoint.host, endpoint.port);
+                }
+            }
+        });
+        debug("Updated internal sentinels: %s", this.sentinelIterator);
+    }
+    async resolveMaster(client) {
+        const result = await client.sentinel("get-master-addr-by-name", this.options.name);
+        await this.updateSentinels(client);
+        return this.sentinelNatResolve(Array.isArray(result)
+            ? { host: result[0], port: Number(result[1]) }
+            : null);
+    }
+    async resolveSlave(client) {
+        const result = await client.sentinel("slaves", this.options.name);
+        if (!Array.isArray(result)) {
+            return null;
+        }
+        const availableSlaves = result
+            .map(utils_1.packObject)
+            .filter((slave) => slave.flags && !slave.flags.match(/(disconnected|s_down|o_down)/));
+        return this.sentinelNatResolve(selectPreferredSentinel(availableSlaves, this.options.preferredSlaves));
+    }
+    sentinelNatResolve(item) {
+        if (!item || !this.options.natMap)
+            return item;
+        const key = `${item.host}:${item.port}`;
+        let result = item;
+        if (typeof this.options.natMap === "function") {
+            result = this.options.natMap(key) || item;
+        }
+        else if (typeof this.options.natMap === "object") {
+            result = this.options.natMap[key] || item;
+        }
+        return result;
+    }
+    connectToSentinel(endpoint, options) {
+        const redis = new Redis_1.default({
+            port: endpoint.port || 26379,
+            host: endpoint.host,
+            username: this.options.sentinelUsername || null,
+            password: this.options.sentinelPassword || null,
+            family: endpoint.family ||
+                // @ts-expect-error
+                ("path" in this.options && this.options.path
+                    ? undefined
+                    : // @ts-expect-error
+                        this.options.family),
+            tls: this.options.sentinelTLS,
+            retryStrategy: null,
+            enableReadyCheck: false,
+            connectTimeout: this.options.connectTimeout,
+            commandTimeout: this.options.sentinelCommandTimeout,
+            ...options,
+        });
+        // @ts-expect-error
+        return redis;
+    }
+    async resolve(endpoint) {
+        const client = this.connectToSentinel(endpoint);
+        // ignore the errors since resolve* methods will handle them
+        client.on("error", noop);
+        try {
+            if (this.options.role === "slave") {
+                return await this.resolveSlave(client);
+            }
+            else {
+                return await this.resolveMaster(client);
+            }
+        }
+        finally {
+            client.disconnect();
+        }
+    }
+    async initFailoverDetector() {
+        var _a;
+        if (!this.options.failoverDetector) {
+            return;
+        }
+        // Move the current sentinel to the first position
+        this.sentinelIterator.reset(true);
+        const sentinels = [];
+        // In case of a large amount of sentinels, limit the number of concurrent connections
+        while (sentinels.length < this.options.sentinelMaxConnections) {
+            const { done, value } = this.sentinelIterator.next();
+            if (done) {
+                break;
+            }
+            const client = this.connectToSentinel(value, {
+                lazyConnect: true,
+                retryStrategy: this.options.sentinelReconnectStrategy,
+            });
+            client.on("reconnecting", () => {
+                var _a;
+                // Tests listen to this event
+                (_a = this.emitter) === null || _a === void 0 ? void 0 : _a.emit("sentinelReconnecting");
+            });
+            sentinels.push({ address: value, client });
+        }
+        this.sentinelIterator.reset(false);
+        if (this.failoverDetector) {
+            // Clean up previous detector
+            this.failoverDetector.cleanup();
+        }
+        this.failoverDetector = new FailoverDetector_1.FailoverDetector(this, sentinels);
+        await this.failoverDetector.subscribe();
+        // Tests listen to this event
+        (_a = this.emitter) === null || _a === void 0 ? void 0 : _a.emit("failoverSubscribed");
+    }
+}
+exports.default = SentinelConnector;
+function selectPreferredSentinel(availableSlaves, preferredSlaves) {
+    if (availableSlaves.length === 0) {
+        return null;
+    }
+    let selectedSlave;
+    if (typeof preferredSlaves === "function") {
+        selectedSlave = preferredSlaves(availableSlaves);
+    }
+    else if (preferredSlaves !== null && typeof preferredSlaves === "object") {
+        const preferredSlavesArray = Array.isArray(preferredSlaves)
+            ? preferredSlaves
+            : [preferredSlaves];
+        // sort by priority
+        preferredSlavesArray.sort((a, b) => {
+            // default the priority to 1
+            if (!a.prio) {
+                a.prio = 1;
+            }
+            if (!b.prio) {
+                b.prio = 1;
+            }
+            // lowest priority first
+            if (a.prio < b.prio) {
+                return -1;
+            }
+            if (a.prio > b.prio) {
+                return 1;
+            }
+            return 0;
+        });
+        // loop over preferred slaves and return the first match
+        for (let p = 0; p < preferredSlavesArray.length; p++) {
+            for (let a = 0; a < availableSlaves.length; a++) {
+                const slave = availableSlaves[a];
+                if (slave.ip === preferredSlavesArray[p].ip) {
+                    if (slave.port === preferredSlavesArray[p].port) {
+                        selectedSlave = slave;
+                        break;
+                    }
+                }
+            }
+            if (selectedSlave) {
+                break;
+            }
+        }
+    }
+    // if none of the preferred slaves are available, a random available slave is returned
+    if (!selectedSlave) {
+        selectedSlave = (0, utils_1.sample)(availableSlaves);
+    }
+    return addressResponseToAddress(selectedSlave);
+}
+function addressResponseToAddress(input) {
+    return { host: input.ip, port: Number(input.port) };
+}
+function noop() { }
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts b/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts
new file mode 100644
index 0000000..4734cdc
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/types.d.ts
@@ -0,0 +1,21 @@
+import { RedisOptions } from "../../redis/RedisOptions";
+export interface SentinelAddress {
+    port: number;
+    host: string;
+    family?: number;
+}
+export interface RedisClient {
+    options: RedisOptions;
+    sentinel(subcommand: "sentinels", name: string): Promise<string[]>;
+    sentinel(subcommand: "get-master-addr-by-name", name: string): Promise<string[]>;
+    sentinel(subcommand: "slaves", name: string): Promise<string[]>;
+    subscribe(...channelNames: string[]): Promise<number>;
+    on(event: "message", callback: (channel: string, message: string) => void): void;
+    on(event: "error", callback: (error: Error) => void): void;
+    on(event: "reconnecting", callback: () => void): void;
+    disconnect(): void;
+}
+export interface Sentinel {
+    address: Partial<SentinelAddress>;
+    client: RedisClient;
+}
diff --git a/node_modules/ioredis/built/connectors/SentinelConnector/types.js b/node_modules/ioredis/built/connectors/SentinelConnector/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/SentinelConnector/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts b/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts
new file mode 100644
index 0000000..45fb552
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/StandaloneConnector.d.ts
@@ -0,0 +1,17 @@
+/// <reference types="node" />
+import { IpcNetConnectOpts, TcpNetConnectOpts } from "net";
+import { ConnectionOptions } from "tls";
+import { NetStream } from "../types";
+import AbstractConnector, { ErrorEmitter } from "./AbstractConnector";
+declare type TcpOptions = Pick<TcpNetConnectOpts, "port" | "host" | "family">;
+declare type IpcOptions = Pick<IpcNetConnectOpts, "path">;
+export declare type StandaloneConnectionOptions = Partial<TcpOptions & IpcOptions> & {
+    disconnectTimeout?: number | undefined;
+    tls?: ConnectionOptions | undefined;
+};
+export default class StandaloneConnector extends AbstractConnector {
+    protected options: StandaloneConnectionOptions;
+    constructor(options: StandaloneConnectionOptions);
+    connect(_: ErrorEmitter): Promise<NetStream>;
+}
+export {};
diff --git a/node_modules/ioredis/built/connectors/StandaloneConnector.js b/node_modules/ioredis/built/connectors/StandaloneConnector.js
new file mode 100644
index 0000000..d17c91a
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/StandaloneConnector.js
@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const net_1 = require("net");
+const tls_1 = require("tls");
+const utils_1 = require("../utils");
+const AbstractConnector_1 = require("./AbstractConnector");
+class StandaloneConnector extends AbstractConnector_1.default {
+    constructor(options) {
+        super(options.disconnectTimeout);
+        this.options = options;
+    }
+    connect(_) {
+        const { options } = this;
+        this.connecting = true;
+        let connectionOptions;
+        if ("path" in options && options.path) {
+            connectionOptions = {
+                path: options.path,
+            };
+        }
+        else {
+            connectionOptions = {};
+            if ("port" in options && options.port != null) {
+                connectionOptions.port = options.port;
+            }
+            if ("host" in options && options.host != null) {
+                connectionOptions.host = options.host;
+            }
+            if ("family" in options && options.family != null) {
+                connectionOptions.family = options.family;
+            }
+        }
+        if (options.tls) {
+            Object.assign(connectionOptions, options.tls);
+        }
+        // TODO:
+        // We use native Promise here since other Promise
+        // implementation may use different schedulers that
+        // cause issue when the stream is resolved in the
+        // next tick.
+        // Should use the provided promise in the next major
+        // version and do not connect before resolved.
+        return new Promise((resolve, reject) => {
+            process.nextTick(() => {
+                if (!this.connecting) {
+                    reject(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+                    return;
+                }
+                try {
+                    if (options.tls) {
+                        this.stream = (0, tls_1.connect)(connectionOptions);
+                    }
+                    else {
+                        this.stream = (0, net_1.createConnection)(connectionOptions);
+                    }
+                }
+                catch (err) {
+                    reject(err);
+                    return;
+                }
+                this.stream.once("error", (err) => {
+                    this.firstError = err;
+                });
+                resolve(this.stream);
+            });
+        });
+    }
+}
+exports.default = StandaloneConnector;
diff --git a/node_modules/ioredis/built/connectors/index.d.ts b/node_modules/ioredis/built/connectors/index.d.ts
new file mode 100644
index 0000000..fa74d6f
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/index.d.ts
@@ -0,0 +1,3 @@
+import StandaloneConnector from "./StandaloneConnector";
+import SentinelConnector from "./SentinelConnector";
+export { StandaloneConnector, SentinelConnector };
diff --git a/node_modules/ioredis/built/connectors/index.js b/node_modules/ioredis/built/connectors/index.js
new file mode 100644
index 0000000..49a03a2
--- /dev/null
+++ b/node_modules/ioredis/built/connectors/index.js
@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SentinelConnector = exports.StandaloneConnector = void 0;
+const StandaloneConnector_1 = require("./StandaloneConnector");
+exports.StandaloneConnector = StandaloneConnector_1.default;
+const SentinelConnector_1 = require("./SentinelConnector");
+exports.SentinelConnector = SentinelConnector_1.default;
diff --git a/node_modules/ioredis/built/constants/TLSProfiles.d.ts b/node_modules/ioredis/built/constants/TLSProfiles.d.ts
new file mode 100644
index 0000000..7547966
--- /dev/null
+++ b/node_modules/ioredis/built/constants/TLSProfiles.d.ts
@@ -0,0 +1,9 @@
+declare const TLSProfiles: {
+    readonly RedisCloudFixed: {
+        readonly ca: "-----BEGIN CERTIFICATE-----\nMIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP\nJnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz\nrmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E\nQwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2\nBDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3\nTMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp\n4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w\nMB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w\nDQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta\nlbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6\nSu8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ\nuFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k\nBpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp\nZ4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx\nCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w\nKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN\nMTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG\nA1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy\nbWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA\nA4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv\nTq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4\nVuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym\nhjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W\nP0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN\nr0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw\nhhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s\nUzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u\nP1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9\nMjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT\nt5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID\nAQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy\nLnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw\nAYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G\nA1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4\nL2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB\nhjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr\nAP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW\nvcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw\n7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+\nXoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc\nAUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1\njQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh\n/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z\nzDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli\niF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43\niqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo\n616pxqo=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV\nBAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz\nTGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y\naXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC\nVVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz\nMS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw\nggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1\nG5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY\nDm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl\npp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT\nULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag\n54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ\nxeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC\nJpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K\n2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3\nStsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI\nSIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B\ncS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL\nyzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T\nAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg\nz5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu\nrYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3\n3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+\nhSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ\nD0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj\nTY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l\nFXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj\nmcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf\nybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji\nn8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F\nUhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM\nMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv\nYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y\nNTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu\nIG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy\nMDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf\n8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD\nBVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg\nofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK\ndZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh\ncounQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu\njE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG\nCCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW\nBBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj\nmove4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw\nMi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1\ncmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w\nK6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD\nVR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC\nAQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/\n3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY\n0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX\ny+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3\n15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5\nZgKnO/Fx2hBgTxhOTMYaD312kg==\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G\nA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp\nZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4\nMTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG\nA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\nhvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8\nRgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT\ngHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm\nKPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd\nQQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ\nXriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw\nDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o\nLkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU\nRUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp\njjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK\n6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX\nmcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs\nMx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH\nWD9f\n-----END CERTIFICATE-----";
+    };
+    readonly RedisCloudFlexible: {
+        readonly ca: "-----BEGIN CERTIFICATE-----\nMIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV\nBAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1\ndGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP\nJnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz\nrmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E\nQwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2\nBDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3\nTMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp\n4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w\nMB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w\nDQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta\nlbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6\nSu8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ\nuFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k\nBpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp\nZ4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx\nCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w\nKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN\nMTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG\nA1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy\nbWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA\nA4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv\nTq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4\nVuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym\nhjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W\nP0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN\nr0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw\nhhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s\nUzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u\nP1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9\nMjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT\nt5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID\nAQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy\nLnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw\nAYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G\nA1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4\nL2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB\nhjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr\nAP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW\nvcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw\n7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+\nXoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc\nAUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1\njQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh\n/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z\nzDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli\niF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43\niqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo\n616pxqo=\n-----END CERTIFICATE-----\n-----BEGIN CERTIFICATE-----\nMIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV\nBAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz\nTGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y\naXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC\nVVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz\nMS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw\nggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1\nG5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY\nDm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl\npp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT\nULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag\n54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ\nxeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC\nJpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K\n2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3\nStsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI\nSIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B\ncS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL\nyzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T\nAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg\nz5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu\nrYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3\n3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+\nhSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ\nD0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj\nTY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l\nFXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj\nmcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf\nybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji\nn8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F\nUhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM\nMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv\nYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y\nNTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu\nIG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy\nMDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf\n8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD\nBVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg\nofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK\ndZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh\ncounQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu\njE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG\nCCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW\nBBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj\nmove4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw\nMi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1\ncmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w\nK6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD\nVR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC\nAQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/\n3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY\n0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX\ny+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3\n15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5\nZgKnO/Fx2hBgTxhOTMYaD312kg==\n-----END CERTIFICATE-----\n\n-----BEGIN CERTIFICATE-----\nMIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G\nA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp\nZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4\nMTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG\nA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI\nhvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8\nRgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT\ngHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm\nKPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd\nQQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ\nXriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw\nDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o\nLkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU\nRUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp\njjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK\n6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX\nmcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs\nMx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH\nWD9f\n-----END CERTIFICATE-----";
+    };
+};
+export default TLSProfiles;
diff --git a/node_modules/ioredis/built/constants/TLSProfiles.js b/node_modules/ioredis/built/constants/TLSProfiles.js
new file mode 100644
index 0000000..f90760d
--- /dev/null
+++ b/node_modules/ioredis/built/constants/TLSProfiles.js
@@ -0,0 +1,149 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * TLS settings for Redis Cloud. Updated on 2022-08-19.
+ */
+const RedisCloudCA = `-----BEGIN CERTIFICATE-----
+MIIDTzCCAjegAwIBAgIJAKSVpiDswLcwMA0GCSqGSIb3DQEBBQUAMD4xFjAUBgNV
+BAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1
+dGhvcml0eTAeFw0xMzEwMDExMjE0NTVaFw0yMzA5MjkxMjE0NTVaMD4xFjAUBgNV
+BAoMDUdhcmFudGlhIERhdGExJDAiBgNVBAMMG1NTTCBDZXJ0aWZpY2F0aW9uIEF1
+dGhvcml0eTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALZqkh/DczWP
+JnxnHLQ7QL0T4B4CDKWBKCcisriGbA6ZePWVNo4hfKQC6JrzfR+081NeD6VcWUiz
+rmd+jtPhIY4c+WVQYm5PKaN6DT1imYdxQw7aqO5j2KUCEh/cznpLxeSHoTxlR34E
+QwF28Wl3eg2vc5ct8LjU3eozWVk3gb7alx9mSA2SgmuX5lEQawl++rSjsBStemY2
+BDwOpAMXIrdEyP/cVn8mkvi/BDs5M5G+09j0gfhyCzRWMQ7Hn71u1eolRxwVxgi3
+TMn+/vTaFSqxKjgck6zuAYjBRPaHe7qLxHNr1So/Mc9nPy+3wHebFwbIcnUojwbp
+4nctkWbjb2cCAwEAAaNQME4wHQYDVR0OBBYEFP1whtcrydmW3ZJeuSoKZIKjze3w
+MB8GA1UdIwQYMBaAFP1whtcrydmW3ZJeuSoKZIKjze3wMAwGA1UdEwQFMAMBAf8w
+DQYJKoZIhvcNAQEFBQADggEBAG2erXhwRAa7+ZOBs0B6X57Hwyd1R4kfmXcs0rta
+lbPpvgULSiB+TCbf3EbhJnHGyvdCY1tvlffLjdA7HJ0PCOn+YYLBA0pTU/dyvrN6
+Su8NuS5yubnt9mb13nDGYo1rnt0YRfxN+8DM3fXIVr038A30UlPX2Ou1ExFJT0MZ
+uFKY6ZvLdI6/1cbgmguMlAhM+DhKyV6Sr5699LM3zqeI816pZmlREETYkGr91q7k
+BpXJu/dtHaGxg1ZGu6w/PCsYGUcECWENYD4VQPd8N32JjOfu6vEgoEAwfPP+3oGp
+Z4m3ewACcWOAenqflb+cQYC4PsF7qbXDmRaWrbKntOlZ3n0=
+-----END CERTIFICATE-----
+-----BEGIN CERTIFICATE-----
+MIIGMTCCBBmgAwIBAgICEAAwDQYJKoZIhvcNAQELBQAwajELMAkGA1UEBhMCVVMx
+CzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJzMS0w
+KwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwHhcN
+MTgwMjI1MTUzNzM3WhcNMjgwMjIzMTUzNzM3WjBfMQswCQYDVQQGEwJVUzELMAkG
+A1UECAwCQ0ExEjAQBgNVBAoMCVJlZGlzTGFiczEvMC0GA1UEAwwmUkNQIEludGVy
+bWVkaWF0ZSBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUA
+A4ICDwAwggIKAoICAQDf9dqbxc8Bq7Ctq9rWcxrGNKKHivqLAFpPq02yLPx6fsOv
+Tq7GsDChAYBBc4v7Y2Ap9RD5Vs3dIhEANcnolf27QwrG9RMnnvzk8pCvp1o6zSU4
+VuOE1W66/O1/7e2rVxyrnTcP7UgK43zNIXu7+tiAqWsO92uSnuMoGPGpeaUm1jym
+hjWKtkAwDFSqvHY+XL5qDVBEjeUe+WHkYUg40cAXjusAqgm2hZt29c2wnVrxW25W
+P0meNlzHGFdA2AC5z54iRiqj57dTfBTkHoBczQxcyw6hhzxZQ4e5I5zOKjXXEhZN
+r0tA3YC14CTabKRus/JmZieyZzRgEy2oti64tmLYTqSlAD78pRL40VNoaSYetXLw
+hhNsXCHgWaY6d5bLOc/aIQMAV5oLvZQKvuXAF1IDmhPA+bZbpWipp0zagf1P1H3s
+UzsMdn2KM0ejzgotbtNlj5TcrVwpmvE3ktvUAuA+hi3FkVx1US+2Gsp5x4YOzJ7u
+P1WPk6ShF0JgnJH2ILdj6kttTWwFzH17keSFICWDfH/+kM+k7Y1v3EXMQXE7y0T9
+MjvJskz6d/nv+sQhY04xt64xFMGTnZjlJMzfQNi7zWFLTZnDD0lPowq7l3YiPoTT
+t5Xky83lu0KZsZBo0WlWaDG00gLVdtRgVbcuSWxpi5BdLb1kRab66JptWjxwXQID
+AQABo4HrMIHoMDoGA1UdHwQzMDEwL6AtoCuGKWh0dHBzOi8vcmwtY2Etc2VydmVy
+LnJlZGlzbGFicy5jb20vdjEvY3JsMEYGCCsGAQUFBwEBBDowODA2BggrBgEFBQcw
+AYYqaHR0cHM6Ly9ybC1jYS1zZXJ2ZXIucmVkaXNsYWJzLmNvbS92MS9vY3NwMB0G
+A1UdDgQWBBQHar5OKvQUpP2qWt6mckzToeCOHDAfBgNVHSMEGDAWgBQi42wH6hM4
+L2sujEvLM0/u8lRXTzASBgNVHRMBAf8ECDAGAQH/AgEAMA4GA1UdDwEB/wQEAwIB
+hjANBgkqhkiG9w0BAQsFAAOCAgEAirEn/iTsAKyhd+pu2W3Z5NjCko4NPU0EYUbr
+AP7+POK2rzjIrJO3nFYQ/LLuC7KCXG+2qwan2SAOGmqWst13Y+WHp44Kae0kaChW
+vcYLXXSoGQGC8QuFSNUdaeg3RbMDYFT04dOkqufeWVccoHVxyTSg9eD8LZuHn5jw
+7QDLiEECBmIJHk5Eeo2TAZrx4Yx6ufSUX5HeVjlAzqwtAqdt99uCJ/EL8bgpWbe+
+XoSpvUv0SEC1I1dCAhCKAvRlIOA6VBcmzg5Am12KzkqTul12/VEFIgzqu0Zy2Jbc
+AUPrYVu/+tOGXQaijy7YgwH8P8n3s7ZeUa1VABJHcxrxYduDDJBLZi+MjheUDaZ1
+jQRHYevI2tlqeSBqdPKG4zBY5lS0GiAlmuze5oENt0P3XboHoZPHiqcK3VECgTVh
+/BkJcuudETSJcZDmQ8YfoKfBzRQNg2sv/hwvUv73Ss51Sco8GEt2lD8uEdib1Q6z
+zDT5lXJowSzOD5ZA9OGDjnSRL+2riNtKWKEqvtEG3VBJoBzu9GoxbAc7wIZLxmli
+iF5a/Zf5X+UXD3s4TMmy6C4QZJpAA2egsSQCnraWO2ULhh7iXMysSkF/nzVfZn43
+iqpaB8++9a37hWq14ZmOv0TJIDz//b2+KC4VFXWQ5W5QC6whsjT+OlG4p5ZYG0jo
+616pxqo=
+-----END CERTIFICATE-----
+-----BEGIN CERTIFICATE-----
+MIIFujCCA6KgAwIBAgIJAJ1aTT1lu2ScMA0GCSqGSIb3DQEBCwUAMGoxCzAJBgNV
+BAYTAlVTMQswCQYDVQQIDAJDQTELMAkGA1UEBwwCQ0ExEjAQBgNVBAoMCVJlZGlz
+TGFiczEtMCsGA1UEAwwkUmVkaXNMYWJzIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9y
+aXR5MB4XDTE4MDIyNTE1MjA0MloXDTM4MDIyMDE1MjA0MlowajELMAkGA1UEBhMC
+VVMxCzAJBgNVBAgMAkNBMQswCQYDVQQHDAJDQTESMBAGA1UECgwJUmVkaXNMYWJz
+MS0wKwYDVQQDDCRSZWRpc0xhYnMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkw
+ggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDLEjXy7YrbN5Waau5cd6g1
+G5C2tMmeTpZ0duFAPxNU4oE3RHS5gGiok346fUXuUxbZ6QkuzeN2/2Z+RmRcJhQY
+Dm0ZgdG4x59An1TJfnzKKoWj8ISmoHS/TGNBdFzXV7FYNLBuqZouqePI6ReC6Qhl
+pp45huV32Q3a6IDrrvx7Wo5ZczEQeFNbCeCOQYNDdTmCyEkHqc2AGo8eoIlSTutT
+ULOC7R5gzJVTS0e1hesQ7jmqHjbO+VQS1NAL4/5K6cuTEqUl+XhVhPdLWBXJQ5ag
+54qhX4v+ojLzeU1R/Vc6NjMvVtptWY6JihpgplprN0Yh2556ewcXMeturcKgXfGJ
+xeYzsjzXerEjrVocX5V8BNrg64NlifzTMKNOOv4fVZszq1SIHR8F9ROrqiOdh8iC
+JpUbLpXH9hWCSEO6VRMB2xJoKu3cgl63kF30s77x7wLFMEHiwsQRKxooE1UhgS9K
+2sO4TlQ1eWUvFvHSTVDQDlGQ6zu4qjbOpb3Q8bQwoK+ai2alkXVR4Ltxe9QlgYK3
+StsnPhruzZGA0wbXdpw0bnM+YdlEm5ffSTpNIfgHeaa7Dtb801FtA71ZlH7A6TaI
+SIQuUST9EKmv7xrJyx0W1pGoPOLw5T029aTjnICSLdtV9bLwysrLhIYG5bnPq78B
+cS+jZHFGzD7PUVGQD01nOQIDAQABo2MwYTAdBgNVHQ4EFgQUIuNsB+oTOC9rLoxL
+yzNP7vJUV08wHwYDVR0jBBgwFoAUIuNsB+oTOC9rLoxLyzNP7vJUV08wDwYDVR0T
+AQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBAHfg
+z5pMNUAKdMzK1aS1EDdK9yKz4qicILz5czSLj1mC7HKDRy8cVADUxEICis++CsCu
+rYOvyCVergHQLREcxPq4rc5Nq1uj6J6649NEeh4WazOOjL4ZfQ1jVznMbGy+fJm3
+3Hoelv6jWRG9iqeJZja7/1s6YC6bWymI/OY1e4wUKeNHAo+Vger7MlHV+RuabaX+
+hSJ8bJAM59NCM7AgMTQpJCncrcdLeceYniGy5Q/qt2b5mJkQVkIdy4TPGGB+AXDJ
+D0q3I/JDRkDUFNFdeW0js7fHdsvCR7O3tJy5zIgEV/o/BCkmJVtuwPYOrw/yOlKj
+TY/U7ATAx9VFF6/vYEOMYSmrZlFX+98L6nJtwDqfLB5VTltqZ4H/KBxGE3IRSt9l
+FXy40U+LnXzhhW+7VBAvyYX8GEXhHkKU8Gqk1xitrqfBXY74xKgyUSTolFSfFVgj
+mcM/X4K45bka+qpkj7Kfv/8D4j6aZekwhN2ly6hhC1SmQ8qjMjpG/mrWOSSHZFmf
+ybu9iD2AYHeIOkshIl6xYIa++Q/00/vs46IzAbQyriOi0XxlSMMVtPx0Q3isp+ji
+n8Mq9eOuxYOEQ4of8twUkUDd528iwGtEdwf0Q01UyT84S62N8AySl1ZBKXJz6W4F
+UhWfa/HQYOAPDdEjNgnVwLI23b8t0TozyCWw7q8h
+-----END CERTIFICATE-----
+
+-----BEGIN CERTIFICATE-----
+MIIEjzCCA3egAwIBAgIQe55B/ALCKJDZtdNT8kD6hTANBgkqhkiG9w0BAQsFADBM
+MSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEGA1UEChMKR2xv
+YmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjAeFw0yMjAxMjYxMjAwMDBaFw0y
+NTAxMjYwMDAwMDBaMFgxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9iYWxTaWdu
+IG52LXNhMS4wLAYDVQQDEyVHbG9iYWxTaWduIEF0bGFzIFIzIE9WIFRMUyBDQSAy
+MDIyIFEyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAmGmg1LW9b7Lf
+8zDD83yBDTEkt+FOxKJZqF4veWc5KZsQj9HfnUS2e5nj/E+JImlGPsQuoiosLuXD
+BVBNAMcUFa11buFMGMeEMwiTmCXoXRrXQmH0qjpOfKgYc5gHG3BsRGaRrf7VR4eg
+ofNMG9wUBw4/g/TT7+bQJdA4NfE7Y4d5gEryZiBGB/swaX6Jp/8MF4TgUmOWmalK
+dZCKyb4sPGQFRTtElk67F7vU+wdGcrcOx1tDcIB0ncjLPMnaFicagl+daWGsKqTh
+counQb6QJtYHa91KvCfKWocMxQ7OIbB5UARLPmC4CJ1/f8YFm35ebfzAeULYdGXu
+jE9CLor0OwIDAQABo4IBXzCCAVswDgYDVR0PAQH/BAQDAgGGMB0GA1UdJQQWMBQG
+CCsGAQUFBwMBBggrBgEFBQcDAjASBgNVHRMBAf8ECDAGAQH/AgEAMB0GA1UdDgQW
+BBSH5Zq7a7B/t95GfJWkDBpA8HHqdjAfBgNVHSMEGDAWgBSP8Et/qC5FJK5NUPpj
+move4t0bvDB7BggrBgEFBQcBAQRvMG0wLgYIKwYBBQUHMAGGImh0dHA6Ly9vY3Nw
+Mi5nbG9iYWxzaWduLmNvbS9yb290cjMwOwYIKwYBBQUHMAKGL2h0dHA6Ly9zZWN1
+cmUuZ2xvYmFsc2lnbi5jb20vY2FjZXJ0L3Jvb3QtcjMuY3J0MDYGA1UdHwQvMC0w
+K6ApoCeGJWh0dHA6Ly9jcmwuZ2xvYmFsc2lnbi5jb20vcm9vdC1yMy5jcmwwIQYD
+VR0gBBowGDAIBgZngQwBAgIwDAYKKwYBBAGgMgoBAjANBgkqhkiG9w0BAQsFAAOC
+AQEAKRic9/f+nmhQU/wz04APZLjgG5OgsuUOyUEZjKVhNGDwxGTvKhyXGGAMW2B/
+3bRi+aElpXwoxu3pL6fkElbX3B0BeS5LoDtxkyiVEBMZ8m+sXbocwlPyxrPbX6mY
+0rVIvnuUeBH8X0L5IwfpNVvKnBIilTbcebfHyXkPezGwz7E1yhUULjJFm2bt0SdX
+y+4X/WeiiYIv+fTVgZZgl+/2MKIsu/qdBJc3f3TvJ8nz+Eax1zgZmww+RSQWeOj3
+15Iw6Z5FX+NwzY/Ab+9PosR5UosSeq+9HhtaxZttXG1nVh+avYPGYddWmiMT90J5
+ZgKnO/Fx2hBgTxhOTMYaD312kg==
+-----END CERTIFICATE-----
+
+-----BEGIN CERTIFICATE-----
+MIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G
+A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp
+Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4
+MTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG
+A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8
+RgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT
+gHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm
+KPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd
+QQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ
+XriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw
+DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o
+LkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU
+RUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp
+jjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK
+6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX
+mcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs
+Mx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH
+WD9f
+-----END CERTIFICATE-----`;
+const TLSProfiles = {
+    RedisCloudFixed: { ca: RedisCloudCA },
+    RedisCloudFlexible: { ca: RedisCloudCA },
+};
+exports.default = TLSProfiles;
diff --git a/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts b/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts
new file mode 100644
index 0000000..870640f
--- /dev/null
+++ b/node_modules/ioredis/built/errors/ClusterAllFailedError.d.ts
@@ -0,0 +1,7 @@
+import { RedisError } from "redis-errors";
+export default class ClusterAllFailedError extends RedisError {
+    lastNodeError: RedisError;
+    static defaultMessage: string;
+    constructor(message: any, lastNodeError: RedisError);
+    get name(): string;
+}
diff --git a/node_modules/ioredis/built/errors/ClusterAllFailedError.js b/node_modules/ioredis/built/errors/ClusterAllFailedError.js
new file mode 100644
index 0000000..c223f16
--- /dev/null
+++ b/node_modules/ioredis/built/errors/ClusterAllFailedError.js
@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const redis_errors_1 = require("redis-errors");
+class ClusterAllFailedError extends redis_errors_1.RedisError {
+    constructor(message, lastNodeError) {
+        super(message);
+        this.lastNodeError = lastNodeError;
+        Error.captureStackTrace(this, this.constructor);
+    }
+    get name() {
+        return this.constructor.name;
+    }
+}
+exports.default = ClusterAllFailedError;
+ClusterAllFailedError.defaultMessage = "Failed to refresh slots cache.";
diff --git a/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts b/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts
new file mode 100644
index 0000000..9c4b4e5
--- /dev/null
+++ b/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.d.ts
@@ -0,0 +1,5 @@
+import { AbortError } from "redis-errors";
+export default class MaxRetriesPerRequestError extends AbortError {
+    constructor(maxRetriesPerRequest: number);
+    get name(): string;
+}
diff --git a/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js b/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js
new file mode 100644
index 0000000..d8c8e1d
--- /dev/null
+++ b/node_modules/ioredis/built/errors/MaxRetriesPerRequestError.js
@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const redis_errors_1 = require("redis-errors");
+class MaxRetriesPerRequestError extends redis_errors_1.AbortError {
+    constructor(maxRetriesPerRequest) {
+        const message = `Reached the max retries per request limit (which is ${maxRetriesPerRequest}). Refer to "maxRetriesPerRequest" option for details.`;
+        super(message);
+        Error.captureStackTrace(this, this.constructor);
+    }
+    get name() {
+        return this.constructor.name;
+    }
+}
+exports.default = MaxRetriesPerRequestError;
diff --git a/node_modules/ioredis/built/errors/index.d.ts b/node_modules/ioredis/built/errors/index.d.ts
new file mode 100644
index 0000000..6d25308
--- /dev/null
+++ b/node_modules/ioredis/built/errors/index.d.ts
@@ -0,0 +1,2 @@
+import MaxRetriesPerRequestError from "./MaxRetriesPerRequestError";
+export { MaxRetriesPerRequestError };
diff --git a/node_modules/ioredis/built/errors/index.js b/node_modules/ioredis/built/errors/index.js
new file mode 100644
index 0000000..02b72a9
--- /dev/null
+++ b/node_modules/ioredis/built/errors/index.js
@@ -0,0 +1,5 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MaxRetriesPerRequestError = void 0;
+const MaxRetriesPerRequestError_1 = require("./MaxRetriesPerRequestError");
+exports.MaxRetriesPerRequestError = MaxRetriesPerRequestError_1.default;
diff --git a/node_modules/ioredis/built/index.d.ts b/node_modules/ioredis/built/index.d.ts
new file mode 100644
index 0000000..d4517f3
--- /dev/null
+++ b/node_modules/ioredis/built/index.d.ts
@@ -0,0 +1,44 @@
+export { default } from "./Redis";
+export { default as Redis } from "./Redis";
+export { default as Cluster } from "./cluster";
+/**
+ * @ignore
+ */
+export { default as Command } from "./Command";
+/**
+ * @ignore
+ */
+export { default as RedisCommander, Result, ClientContext, } from "./utils/RedisCommander";
+/**
+ * @ignore
+ */
+export { default as ScanStream } from "./ScanStream";
+/**
+ * @ignore
+ */
+export { default as Pipeline } from "./Pipeline";
+/**
+ * @ignore
+ */
+export { default as AbstractConnector } from "./connectors/AbstractConnector";
+/**
+ * @ignore
+ */
+export { default as SentinelConnector, SentinelIterator, } from "./connectors/SentinelConnector";
+/**
+ * @ignore
+ */
+export { Callback } from "./types";
+export { SentinelAddress, SentinelConnectionOptions, } from "./connectors/SentinelConnector";
+export { StandaloneConnectionOptions } from "./connectors/StandaloneConnector";
+export { RedisOptions, CommonRedisOptions } from "./redis/RedisOptions";
+export { ClusterNode } from "./cluster";
+export { ClusterOptions, DNSLookupFunction, DNSResolveSrvFunction, NatMap, } from "./cluster/ClusterOptions";
+export { NodeRole } from "./cluster/util";
+export type { RedisKey, RedisValue, ChainableCommander, } from "./utils/RedisCommander";
+export type { CommandTraceContext, BatchOperationContext, ConnectTraceContext, } from "./tracing";
+export declare const ReplyError: any;
+/**
+ * @ignore
+ */
+export declare function print(err: Error | null, reply?: any): void;
diff --git a/node_modules/ioredis/built/index.js b/node_modules/ioredis/built/index.js
new file mode 100644
index 0000000..24a1895
--- /dev/null
+++ b/node_modules/ioredis/built/index.js
@@ -0,0 +1,62 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.print = exports.ReplyError = exports.SentinelIterator = exports.SentinelConnector = exports.AbstractConnector = exports.Pipeline = exports.ScanStream = exports.Command = exports.Cluster = exports.Redis = exports.default = void 0;
+exports = module.exports = require("./Redis").default;
+var Redis_1 = require("./Redis");
+Object.defineProperty(exports, "default", { enumerable: true, get: function () { return Redis_1.default; } });
+var Redis_2 = require("./Redis");
+Object.defineProperty(exports, "Redis", { enumerable: true, get: function () { return Redis_2.default; } });
+var cluster_1 = require("./cluster");
+Object.defineProperty(exports, "Cluster", { enumerable: true, get: function () { return cluster_1.default; } });
+/**
+ * @ignore
+ */
+var Command_1 = require("./Command");
+Object.defineProperty(exports, "Command", { enumerable: true, get: function () { return Command_1.default; } });
+/**
+ * @ignore
+ */
+var ScanStream_1 = require("./ScanStream");
+Object.defineProperty(exports, "ScanStream", { enumerable: true, get: function () { return ScanStream_1.default; } });
+/**
+ * @ignore
+ */
+var Pipeline_1 = require("./Pipeline");
+Object.defineProperty(exports, "Pipeline", { enumerable: true, get: function () { return Pipeline_1.default; } });
+/**
+ * @ignore
+ */
+var AbstractConnector_1 = require("./connectors/AbstractConnector");
+Object.defineProperty(exports, "AbstractConnector", { enumerable: true, get: function () { return AbstractConnector_1.default; } });
+/**
+ * @ignore
+ */
+var SentinelConnector_1 = require("./connectors/SentinelConnector");
+Object.defineProperty(exports, "SentinelConnector", { enumerable: true, get: function () { return SentinelConnector_1.default; } });
+Object.defineProperty(exports, "SentinelIterator", { enumerable: true, get: function () { return SentinelConnector_1.SentinelIterator; } });
+// No TS typings
+exports.ReplyError = require("redis-errors").ReplyError;
+/**
+ * @ignore
+ */
+Object.defineProperty(exports, "Promise", {
+    get() {
+        console.warn("ioredis v5 does not support plugging third-party Promise library anymore. Native Promise will be used.");
+        return Promise;
+    },
+    set(_lib) {
+        console.warn("ioredis v5 does not support plugging third-party Promise library anymore. Native Promise will be used.");
+    },
+});
+/**
+ * @ignore
+ */
+function print(err, reply) {
+    if (err) {
+        console.log("Error: " + err);
+    }
+    else {
+        console.log("Reply: " + reply);
+    }
+}
+exports.print = print;
diff --git a/node_modules/ioredis/built/redis/RedisOptions.d.ts b/node_modules/ioredis/built/redis/RedisOptions.d.ts
new file mode 100644
index 0000000..6242728
--- /dev/null
+++ b/node_modules/ioredis/built/redis/RedisOptions.d.ts
@@ -0,0 +1,197 @@
+import { CommanderOptions } from "../utils/Commander";
+import ConnectorConstructor from "../connectors/ConnectorConstructor";
+import { SentinelConnectionOptions } from "../connectors/SentinelConnector";
+import { StandaloneConnectionOptions } from "../connectors/StandaloneConnector";
+export declare type ReconnectOnError = (err: Error) => boolean | 1 | 2;
+export interface CommonRedisOptions extends CommanderOptions {
+    Connector?: ConnectorConstructor | undefined;
+    retryStrategy?: ((times: number) => number | void | null) | undefined;
+    /**
+     * If a command does not return a reply within a set number of milliseconds,
+     * a "Command timed out" error will be thrown.
+     */
+    commandTimeout?: number | undefined;
+    /**
+     * Enables client-side timeout protection for blocking commands when set
+     * to a positive number. If `blockingTimeout` is undefined, `0`, or
+     * negative (e.g. `-1`), the protection is disabled and no client-side
+     * timers are installed for blocking commands.
+     */
+    blockingTimeout?: number | undefined;
+    /**
+     * Grace period (ms) added to blocking command timeouts. Only used when
+     * `blockingTimeout` is a positive number. Defaults to 100ms.
+     */
+    blockingTimeoutGrace?: number | undefined;
+    /**
+     * If the socket does not receive data within a set number of milliseconds:
+     * 1. the socket is considered "dead" and will be destroyed
+     * 2. the client will reject any running commands (altought they might have been processed by the server)
+     * 3. the reconnect strategy will kick in (depending on the configuration)
+     */
+    socketTimeout?: number | undefined;
+    /**
+     * Enable/disable keep-alive functionality.
+     * @link https://nodejs.org/api/net.html#socketsetkeepaliveenable-initialdelay
+     * @default 0
+     */
+    keepAlive?: number | undefined;
+    /**
+     * Enable/disable the use of Nagle's algorithm.
+     * @link https://nodejs.org/api/net.html#socketsetnodelaynodelay
+     * @default true
+     */
+    noDelay?: boolean | undefined;
+    /**
+     * Set the name of the connection to make it easier to identity the connection
+     * in client list.
+     * @link https://redis.io/commands/client-setname
+     */
+    connectionName?: string | undefined;
+    /**
+     * If true, skips setting library info via CLIENT SETINFO.
+     * @link https://redis.io/docs/latest/commands/client-setinfo/
+     * @default false
+     */
+    disableClientInfo?: boolean | undefined;
+    /**
+     * Tag to append to the library name in CLIENT SETINFO (ioredis(tag)).
+     * @link https://redis.io/docs/latest/commands/client-setinfo/
+     * @default undefined
+     */
+    clientInfoTag?: string | undefined;
+    /**
+     * If set, client will send AUTH command with the value of this option as the first argument when connected.
+     * This is supported since Redis 6.
+     */
+    username?: string | undefined;
+    /**
+     * If set, client will send AUTH command with the value of this option when connected.
+     */
+    password?: string | undefined;
+    /**
+     * Database index to use.
+     *
+     * @default 0
+     */
+    db?: number | undefined;
+    /**
+     * When the client reconnects, channels subscribed in the previous connection will be
+     * resubscribed automatically if `autoResubscribe` is `true`.
+     * @default true
+     */
+    autoResubscribe?: boolean | undefined;
+    /**
+     * Whether or not to resend unfulfilled commands on reconnect.
+     * Unfulfilled commands are most likely to be blocking commands such as `brpop` or `blpop`.
+     * @default true
+     */
+    autoResendUnfulfilledCommands?: boolean | undefined;
+    /**
+     * Whether or not to reconnect on certain Redis errors.
+     * This options by default is `null`, which means it should never reconnect on Redis errors.
+     * You can pass a function that accepts an Redis error, and returns:
+     * - `true` or `1` to trigger a reconnection.
+     * - `false` or `0` to not reconnect.
+     * - `2` to reconnect and resend the failed command (who triggered the error) after reconnection.
+     * @example
+     * ```js
+     * const redis = new Redis({
+     *   reconnectOnError(err) {
+     *     const targetError = "READONLY";
+     *     if (err.message.includes(targetError)) {
+     *       // Only reconnect when the error contains "READONLY"
+     *       return true; // or `return 1;`
+     *     }
+     *   },
+     * });
+     * ```
+     * @default null
+     */
+    reconnectOnError?: ReconnectOnError | null | undefined;
+    /**
+     * @default false
+     */
+    readOnly?: boolean | undefined;
+    /**
+     * When enabled, numbers returned by Redis will be converted to JavaScript strings instead of numbers.
+     * This is necessary if you want to handle big numbers (above `Number.MAX_SAFE_INTEGER` === 2^53).
+     * @default false
+     */
+    stringNumbers?: boolean | undefined;
+    /**
+     * How long the client will wait before killing a socket due to inactivity during initial connection.
+     * @default 10000
+     */
+    connectTimeout?: number | undefined;
+    /**
+     * This option is used internally when you call `redis.monitor()` to tell Redis
+     * to enter the monitor mode when the connection is established.
+     *
+     * @default false
+     */
+    monitor?: boolean | undefined;
+    /**
+     * The commands that don't get a reply due to the connection to the server is lost are
+     * put into a queue and will be resent on reconnect (if allowed by the `retryStrategy` option).
+     * This option is used to configure how many reconnection attempts should be allowed before
+     * the queue is flushed with a `MaxRetriesPerRequestError` error.
+     * Set this options to `null` instead of a number to let commands wait forever
+     * until the connection is alive again.
+     *
+     * @default 20
+     */
+    maxRetriesPerRequest?: number | null | undefined;
+    /**
+     * @default 10000
+     */
+    maxLoadingRetryTime?: number | undefined;
+    /**
+     * @default false
+     */
+    enableAutoPipelining?: boolean | undefined;
+    /**
+     * @default []
+     */
+    autoPipeliningIgnoredCommands?: string[] | undefined;
+    offlineQueue?: boolean | undefined;
+    commandQueue?: boolean | undefined;
+    /**
+     *
+     * By default, if the connection to Redis server has not been established, commands are added to a queue
+     * and are executed once the connection is "ready" (when `enableReadyCheck` is true, "ready" means
+     * the Redis server has loaded the database from disk, otherwise means the connection to the Redis
+     * server has been established). If this option is false, when execute the command when the connection
+     * isn't ready, an error will be returned.
+     *
+     * @default true
+     */
+    enableOfflineQueue?: boolean | undefined;
+    /**
+     * The client will sent an INFO command to check whether the server is still loading data from the disk (
+     * which happens when the server is just launched) when the connection is established, and only wait until
+     * the loading process is finished before emitting the `ready` event.
+     *
+     * @default true
+     */
+    enableReadyCheck?: boolean | undefined;
+    /**
+     * When a Redis instance is initialized, a connection to the server is immediately established. Set this to
+     * true will delay the connection to the server until the first command is sent or `redis.connect()` is called
+     * explicitly. When `redis.connect()` is called explicitly, a Promise is returned, which will be resolved
+     * when the connection is ready or rejected when it fails. The rejection should be handled by the user.
+     *
+     * @default false
+     */
+    lazyConnect?: boolean | undefined;
+    /**
+     * @default undefined
+     */
+    scripts?: Record<string, {
+        lua: string;
+        numberOfKeys?: number | undefined;
+        readOnly?: boolean | undefined;
+    }> | undefined;
+}
+export declare type RedisOptions = CommonRedisOptions & SentinelConnectionOptions & StandaloneConnectionOptions;
+export declare const DEFAULT_REDIS_OPTIONS: RedisOptions;
diff --git a/node_modules/ioredis/built/redis/RedisOptions.js b/node_modules/ioredis/built/redis/RedisOptions.js
new file mode 100644
index 0000000..99ee7dc
--- /dev/null
+++ b/node_modules/ioredis/built/redis/RedisOptions.js
@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_REDIS_OPTIONS = void 0;
+exports.DEFAULT_REDIS_OPTIONS = {
+    // Connection
+    port: 6379,
+    host: "localhost",
+    family: 0,
+    connectTimeout: 10000,
+    disconnectTimeout: 2000,
+    retryStrategy: function (times) {
+        return Math.min(times * 50, 2000);
+    },
+    keepAlive: 0,
+    noDelay: true,
+    connectionName: null,
+    disableClientInfo: false,
+    clientInfoTag: undefined,
+    // Sentinel
+    sentinels: null,
+    name: null,
+    role: "master",
+    sentinelRetryStrategy: function (times) {
+        return Math.min(times * 10, 1000);
+    },
+    sentinelReconnectStrategy: function () {
+        // This strategy only applies when sentinels are used for detecting
+        // a failover, not during initial master resolution.
+        // The deployment can still function when some of the sentinels are down
+        // for a long period of time, so we may not want to attempt reconnection
+        // very often. Therefore the default interval is fairly long (1 minute).
+        return 60000;
+    },
+    natMap: null,
+    enableTLSForSentinelMode: false,
+    updateSentinels: true,
+    failoverDetector: false,
+    // Status
+    username: null,
+    password: null,
+    db: 0,
+    // Others
+    enableOfflineQueue: true,
+    enableReadyCheck: true,
+    autoResubscribe: true,
+    autoResendUnfulfilledCommands: true,
+    lazyConnect: false,
+    keyPrefix: "",
+    reconnectOnError: null,
+    readOnly: false,
+    stringNumbers: false,
+    maxRetriesPerRequest: 20,
+    maxLoadingRetryTime: 10000,
+    enableAutoPipelining: false,
+    autoPipeliningIgnoredCommands: [],
+    sentinelMaxConnections: 10,
+    blockingTimeoutGrace: 100,
+};
diff --git a/node_modules/ioredis/built/redis/event_handler.d.ts b/node_modules/ioredis/built/redis/event_handler.d.ts
new file mode 100644
index 0000000..1ce79dd
--- /dev/null
+++ b/node_modules/ioredis/built/redis/event_handler.d.ts
@@ -0,0 +1,4 @@
+export declare function connectHandler(self: any): () => void;
+export declare function closeHandler(self: any): () => void;
+export declare function errorHandler(self: any): (error: any) => void;
+export declare function readyHandler(self: any): () => void;
diff --git a/node_modules/ioredis/built/redis/event_handler.js b/node_modules/ioredis/built/redis/event_handler.js
new file mode 100644
index 0000000..ba8b1dc
--- /dev/null
+++ b/node_modules/ioredis/built/redis/event_handler.js
@@ -0,0 +1,315 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.readyHandler = exports.errorHandler = exports.closeHandler = exports.connectHandler = void 0;
+const redis_errors_1 = require("redis-errors");
+const Command_1 = require("../Command");
+const errors_1 = require("../errors");
+const utils_1 = require("../utils");
+const DataHandler_1 = require("../DataHandler");
+const debug = (0, utils_1.Debug)("connection");
+function connectHandler(self) {
+    return function () {
+        var _a;
+        self.setStatus("connect");
+        self.resetCommandQueue();
+        // AUTH command should be processed before any other commands
+        let flushed = false;
+        const { connectionEpoch } = self;
+        if (self.condition.auth) {
+            self.auth(self.condition.auth, function (err) {
+                if (connectionEpoch !== self.connectionEpoch) {
+                    return;
+                }
+                if (err) {
+                    if (err.message.indexOf("no password is set") !== -1) {
+                        console.warn("[WARN] Redis server does not require a password, but a password was supplied.");
+                    }
+                    else if (err.message.indexOf("without any password configured for the default user") !== -1) {
+                        console.warn("[WARN] This Redis server's `default` user does not require a password, but a password was supplied");
+                    }
+                    else if (err.message.indexOf("wrong number of arguments for 'auth' command") !== -1) {
+                        console.warn(`[ERROR] The server returned "wrong number of arguments for 'auth' command". You are probably passing both username and password to Redis version 5 or below. You should only pass the 'password' option for Redis version 5 and under.`);
+                    }
+                    else {
+                        flushed = true;
+                        self.recoverFromFatalError(err, err);
+                    }
+                }
+            });
+        }
+        if (self.condition.select) {
+            self.select(self.condition.select).catch((err) => {
+                // If the node is in cluster mode, select is disallowed.
+                // In this case, reconnect won't help.
+                self.silentEmit("error", err);
+            });
+        }
+        /*
+          No need to keep the reference of DataHandler here
+          because we don't need to do the cleanup.
+          `Stream#end()` will remove all listeners for us.
+        */
+        new DataHandler_1.default(self, {
+            stringNumbers: self.options.stringNumbers,
+        });
+        const clientCommandPromises = [];
+        if (self.options.connectionName) {
+            debug("set the connection name [%s]", self.options.connectionName);
+            clientCommandPromises.push(self.client("setname", self.options.connectionName).catch(utils_1.noop));
+        }
+        if (!self.options.disableClientInfo) {
+            debug("set the client info");
+            clientCommandPromises.push((0, utils_1.getPackageMeta)()
+                .then((packageMeta) => {
+                return self
+                    .client("SETINFO", "LIB-VER", packageMeta.version)
+                    .catch(utils_1.noop);
+            })
+                .catch(utils_1.noop));
+            clientCommandPromises.push(self
+                .client("SETINFO", "LIB-NAME", ((_a = self.options) === null || _a === void 0 ? void 0 : _a.clientInfoTag)
+                ? `ioredis(${self.options.clientInfoTag})`
+                : "ioredis")
+                .catch(utils_1.noop));
+        }
+        Promise.all(clientCommandPromises)
+            .catch(utils_1.noop)
+            .finally(() => {
+            if (!self.options.enableReadyCheck) {
+                exports.readyHandler(self)();
+            }
+            if (self.options.enableReadyCheck) {
+                self._readyCheck(function (err, info) {
+                    if (connectionEpoch !== self.connectionEpoch) {
+                        return;
+                    }
+                    if (err) {
+                        if (!flushed) {
+                            self.recoverFromFatalError(new Error("Ready check failed: " + err.message), err);
+                        }
+                    }
+                    else {
+                        if (self.connector.check(info)) {
+                            exports.readyHandler(self)();
+                        }
+                        else {
+                            self.disconnect(true);
+                        }
+                    }
+                });
+            }
+        });
+    };
+}
+exports.connectHandler = connectHandler;
+function abortError(command) {
+    const err = new redis_errors_1.AbortError("Command aborted due to connection close");
+    err.command = {
+        name: command.name,
+        args: command.args,
+    };
+    return err;
+}
+// If a contiguous set of pipeline commands starts from index zero then they
+// can be safely reattempted. If however we have a chain of pipelined commands
+// starting at index 1 or more it means we received a partial response before
+// the connection close and those pipelined commands must be aborted. For
+// example, if the queue looks like this: [2, 3, 4, 0, 1, 2] then after
+// aborting and purging we'll have a queue that looks like this: [0, 1, 2]
+function abortIncompletePipelines(commandQueue) {
+    var _a;
+    let expectedIndex = 0;
+    for (let i = 0; i < commandQueue.length;) {
+        const command = (_a = commandQueue.peekAt(i)) === null || _a === void 0 ? void 0 : _a.command;
+        const pipelineIndex = command.pipelineIndex;
+        if (pipelineIndex === undefined || pipelineIndex === 0) {
+            expectedIndex = 0;
+        }
+        if (pipelineIndex !== undefined && pipelineIndex !== expectedIndex++) {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+            continue;
+        }
+        i++;
+    }
+}
+// If only a partial transaction result was received before connection close,
+// we have to abort any transaction fragments that may have ended up in the
+// offline queue
+function abortTransactionFragments(commandQueue) {
+    var _a;
+    for (let i = 0; i < commandQueue.length;) {
+        const command = (_a = commandQueue.peekAt(i)) === null || _a === void 0 ? void 0 : _a.command;
+        if (command.name === "multi") {
+            break;
+        }
+        if (command.name === "exec") {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+            break;
+        }
+        if (command.inTransaction) {
+            commandQueue.remove(i, 1);
+            command.reject(abortError(command));
+        }
+        else {
+            i++;
+        }
+    }
+}
+function closeHandler(self) {
+    return function () {
+        const prevStatus = self.status;
+        self.setStatus("close");
+        if (self.commandQueue.length) {
+            abortIncompletePipelines(self.commandQueue);
+        }
+        if (self.offlineQueue.length) {
+            abortTransactionFragments(self.offlineQueue);
+        }
+        if (prevStatus === "ready") {
+            if (!self.prevCondition) {
+                self.prevCondition = self.condition;
+            }
+            if (self.commandQueue.length) {
+                self.prevCommandQueue = self.commandQueue;
+            }
+        }
+        if (self.manuallyClosing) {
+            self.manuallyClosing = false;
+            debug("skip reconnecting since the connection is manually closed.");
+            return close();
+        }
+        if (typeof self.options.retryStrategy !== "function") {
+            debug("skip reconnecting because `retryStrategy` is not a function");
+            return close();
+        }
+        const retryDelay = self.options.retryStrategy(++self.retryAttempts);
+        if (typeof retryDelay !== "number") {
+            debug("skip reconnecting because `retryStrategy` doesn't return a number");
+            return close();
+        }
+        debug("reconnect in %sms", retryDelay);
+        self.setStatus("reconnecting", retryDelay);
+        self.reconnectTimeout = setTimeout(function () {
+            self.reconnectTimeout = null;
+            self.connect().catch(utils_1.noop);
+        }, retryDelay);
+        const { maxRetriesPerRequest } = self.options;
+        if (typeof maxRetriesPerRequest === "number") {
+            if (maxRetriesPerRequest < 0) {
+                debug("maxRetriesPerRequest is negative, ignoring...");
+            }
+            else {
+                const remainder = self.retryAttempts % (maxRetriesPerRequest + 1);
+                if (remainder === 0) {
+                    debug("reach maxRetriesPerRequest limitation, flushing command queue...");
+                    self.flushQueue(new errors_1.MaxRetriesPerRequestError(maxRetriesPerRequest));
+                }
+            }
+        }
+    };
+    function close() {
+        self.setStatus("end");
+        self.flushQueue(new Error(utils_1.CONNECTION_CLOSED_ERROR_MSG));
+    }
+}
+exports.closeHandler = closeHandler;
+function errorHandler(self) {
+    return function (error) {
+        debug("error: %s", error);
+        self.silentEmit("error", error);
+    };
+}
+exports.errorHandler = errorHandler;
+function readyHandler(self) {
+    return function () {
+        self.setStatus("ready");
+        self.retryAttempts = 0;
+        if (self.options.monitor) {
+            self.call("monitor").then(() => self.setStatus("monitoring"), (error) => self.emit("error", error));
+            const { sendCommand } = self;
+            self.sendCommand = function (command) {
+                if (Command_1.default.checkFlag("VALID_IN_MONITOR_MODE", command.name)) {
+                    return sendCommand.call(self, command);
+                }
+                command.reject(new Error("Connection is in monitoring mode, can't process commands."));
+                return command.promise;
+            };
+            self.once("close", function () {
+                delete self.sendCommand;
+            });
+            return;
+        }
+        const finalSelect = self.prevCondition
+            ? self.prevCondition.select
+            : self.condition.select;
+        if (self.options.readOnly) {
+            debug("set the connection to readonly mode");
+            self.readonly().catch(utils_1.noop);
+        }
+        if (self.prevCondition) {
+            const condition = self.prevCondition;
+            self.prevCondition = null;
+            if (condition.subscriber && self.options.autoResubscribe) {
+                // We re-select the previous db first since
+                // `SELECT` command is not valid in sub mode.
+                if (self.condition.select !== finalSelect) {
+                    debug("connect to db [%d]", finalSelect);
+                    self.select(finalSelect);
+                }
+                const subscribeChannels = condition.subscriber.channels("subscribe");
+                if (subscribeChannels.length) {
+                    debug("subscribe %d channels", subscribeChannels.length);
+                    self.subscribe(subscribeChannels);
+                }
+                const psubscribeChannels = condition.subscriber.channels("psubscribe");
+                if (psubscribeChannels.length) {
+                    debug("psubscribe %d channels", psubscribeChannels.length);
+                    self.psubscribe(psubscribeChannels);
+                }
+                const ssubscribeChannels = condition.subscriber.channels("ssubscribe");
+                if (ssubscribeChannels.length) {
+                    debug("ssubscribe %s", ssubscribeChannels.length);
+                    for (const channel of ssubscribeChannels) {
+                        self.ssubscribe(channel);
+                    }
+                }
+            }
+        }
+        if (self.prevCommandQueue) {
+            if (self.options.autoResendUnfulfilledCommands) {
+                debug("resend %d unfulfilled commands", self.prevCommandQueue.length);
+                while (self.prevCommandQueue.length > 0) {
+                    const item = self.prevCommandQueue.shift();
+                    if (item.select !== self.condition.select &&
+                        item.command.name !== "select") {
+                        self.select(item.select);
+                    }
+                    self.sendCommand(item.command, item.stream);
+                }
+            }
+            else {
+                self.prevCommandQueue = null;
+            }
+        }
+        if (self.offlineQueue.length) {
+            debug("send %d commands in offline queue", self.offlineQueue.length);
+            const offlineQueue = self.offlineQueue;
+            self.resetOfflineQueue();
+            while (offlineQueue.length > 0) {
+                const item = offlineQueue.shift();
+                if (item.select !== self.condition.select &&
+                    item.command.name !== "select") {
+                    self.select(item.select);
+                }
+                self.sendCommand(item.command, item.stream);
+            }
+        }
+        if (self.condition.select !== finalSelect) {
+            debug("connect to db [%d]", finalSelect);
+            self.select(finalSelect);
+        }
+    };
+}
+exports.readyHandler = readyHandler;
diff --git a/node_modules/ioredis/built/tracing.d.ts b/node_modules/ioredis/built/tracing.d.ts
new file mode 100644
index 0000000..cff7c6b
--- /dev/null
+++ b/node_modules/ioredis/built/tracing.d.ts
@@ -0,0 +1,26 @@
+import type { CommandParameter } from "./types";
+export declare function sanitizeArgs(commandName: string, args: CommandParameter[]): string[];
+export interface CommandTraceContext {
+    command: string;
+    args: string[];
+    database: number;
+    serverAddress: string;
+    serverPort: number | undefined;
+}
+export interface BatchOperationContext {
+    batchMode: "MULTI";
+    batchSize: number;
+    database: number;
+    serverAddress: string;
+    serverPort: number | undefined;
+}
+export interface ConnectTraceContext {
+    serverAddress: string;
+    serverPort: number | undefined;
+    connectionEpoch: number;
+}
+declare type CommandContext = CommandTraceContext;
+export declare function traceCommand<T>(fn: () => Promise<T>, contextFactory: () => CommandContext): Promise<T>;
+export declare function traceBatch<T>(fn: () => Promise<T>, contextFactory: () => BatchOperationContext): Promise<T>;
+export declare function traceConnect<T>(fn: () => Promise<T>, contextFactory: () => ConnectTraceContext): Promise<T>;
+export {};
diff --git a/node_modules/ioredis/built/tracing.js b/node_modules/ioredis/built/tracing.js
new file mode 100644
index 0000000..d402b2a
--- /dev/null
+++ b/node_modules/ioredis/built/tracing.js
@@ -0,0 +1,96 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.traceConnect = exports.traceBatch = exports.traceCommand = exports.sanitizeArgs = void 0;
+// Argument sanitization rules adapted from @opentelemetry/redis-common (Apache 2.0).
+// https://github.com/open-telemetry/opentelemetry-js-contrib/blob/main/packages/redis-common/src/index.ts
+//
+// Each entry specifies how many positional args (after the command name) are safe
+// to emit. -1 means all args are safe (read-only/structural commands).
+// Unlisted commands default to 0 (all args redacted) for safe-by-default behavior,
+// which covers AUTH, HELLO, and unknown/custom commands.
+const SERIALIZATION_SUBSETS = [
+    { regex: /^ECHO/i, args: 0 },
+    {
+        regex: /^(LPUSH|MSET|PFA|PUBLISH|RPUSH|SADD|SET|SPUBLISH|XADD|ZADD)/i,
+        args: 1,
+    },
+    { regex: /^(HSET|HMSET|LSET|LINSERT)/i, args: 2 },
+    {
+        regex: /^(ACL|BIT|B[LRZ]|CLIENT|CLUSTER|CONFIG|COMMAND|DECR|DEL|EVAL|EX|FUNCTION|GEO|GET|HINCR|HMGET|HSCAN|INCR|L[TRLM]|MEMORY|P[EFISTU]|RPOP|S[CDIMORSU]|XACK|X[CDGILPRT]|Z[CDILMPRS])/i,
+        args: -1,
+    },
+];
+function sanitizeArgs(commandName, args) {
+    let allowedArgCount = 0;
+    for (const subset of SERIALIZATION_SUBSETS) {
+        if (subset.regex.test(commandName)) {
+            allowedArgCount = subset.args;
+            break;
+        }
+    }
+    if (allowedArgCount === -1) {
+        return args.map((a) => String(a));
+    }
+    const result = [];
+    for (let i = 0; i < args.length; i++) {
+        if (i < allowedArgCount) {
+            result.push(String(args[i]));
+        }
+        else {
+            result.push("?");
+        }
+    }
+    return result;
+}
+exports.sanitizeArgs = sanitizeArgs;
+// Load diagnostics_channel with Node 18 compatibility
+const dc = (() => {
+    try {
+        return "getBuiltinModule" in process
+            ? process.getBuiltinModule("node:diagnostics_channel")
+            : require("node:diagnostics_channel");
+    }
+    catch {
+        return undefined;
+    }
+})();
+const hasTracingChannel = dc && typeof dc.tracingChannel === "function";
+const commandChannel = hasTracingChannel
+    ? dc.tracingChannel("ioredis:command")
+    : undefined;
+const batchChannel = hasTracingChannel
+    ? dc.tracingChannel("ioredis:batch")
+    : undefined;
+const connectChannel = hasTracingChannel
+    ? dc.tracingChannel("ioredis:connect")
+    : undefined;
+function shouldTrace(channel) {
+    return !!channel && channel.hasSubscribers !== false;
+}
+const noop = () => { };
+function traceCommand(fn, contextFactory) {
+    if (!shouldTrace(commandChannel))
+        return fn();
+    // tracePromise returns a wrapper promise that re-rejects on error.
+    // Silence the wrapper to prevent unhandled rejections when callers
+    // (e.g. Pipeline) discard the return value. Callers that await this
+    // promise still see the rejection through their own .then() chain.
+    const traced = commandChannel.tracePromise(fn, contextFactory());
+    traced.catch(noop);
+    return traced;
+}
+exports.traceCommand = traceCommand;
+function traceBatch(fn, contextFactory) {
+    if (!shouldTrace(batchChannel))
+        return fn();
+    const traced = batchChannel.tracePromise(fn, contextFactory());
+    traced.catch(noop);
+    return traced;
+}
+exports.traceBatch = traceBatch;
+function traceConnect(fn, contextFactory) {
+    if (!shouldTrace(connectChannel))
+        return fn();
+    return connectChannel.tracePromise(fn, contextFactory());
+}
+exports.traceConnect = traceConnect;
diff --git a/node_modules/ioredis/built/transaction.d.ts b/node_modules/ioredis/built/transaction.d.ts
new file mode 100644
index 0000000..d499f25
--- /dev/null
+++ b/node_modules/ioredis/built/transaction.d.ts
@@ -0,0 +1,13 @@
+import { ChainableCommander } from "./utils/RedisCommander";
+export interface Transaction {
+    pipeline(commands?: unknown[][]): ChainableCommander;
+    multi(options: {
+        pipeline: false;
+    }): Promise<"OK">;
+    multi(): ChainableCommander;
+    multi(options: {
+        pipeline: true;
+    }): ChainableCommander;
+    multi(commands?: unknown[][]): ChainableCommander;
+}
+export declare function addTransactionSupport(redis: any): void;
diff --git a/node_modules/ioredis/built/transaction.js b/node_modules/ioredis/built/transaction.js
new file mode 100644
index 0000000..27892ec
--- /dev/null
+++ b/node_modules/ioredis/built/transaction.js
@@ -0,0 +1,100 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.addTransactionSupport = void 0;
+const utils_1 = require("./utils");
+const standard_as_callback_1 = require("standard-as-callback");
+const Pipeline_1 = require("./Pipeline");
+const tracing_1 = require("./tracing");
+function addTransactionSupport(redis) {
+    redis.pipeline = function (commands) {
+        const pipeline = new Pipeline_1.default(this);
+        if (Array.isArray(commands)) {
+            pipeline.addBatch(commands);
+        }
+        return pipeline;
+    };
+    const { multi } = redis;
+    redis.multi = function (commands, options) {
+        if (typeof options === "undefined" && !Array.isArray(commands)) {
+            options = commands;
+            commands = null;
+        }
+        if (options && options.pipeline === false) {
+            return multi.call(this);
+        }
+        const pipeline = new Pipeline_1.default(this);
+        // @ts-expect-error
+        pipeline.multi();
+        if (Array.isArray(commands)) {
+            pipeline.addBatch(commands);
+        }
+        const exec = pipeline.exec;
+        pipeline.exec = function (callback) {
+            // Wait for the cluster to be connected, since we need nodes information before continuing
+            if (this.isCluster && !this.redis.slots.length) {
+                if (this.redis.status === "wait")
+                    this.redis.connect().catch(utils_1.noop);
+                return (0, standard_as_callback_1.default)(new Promise((resolve, reject) => {
+                    this.redis.delayUntilReady((err) => {
+                        if (err) {
+                            reject(err);
+                            return;
+                        }
+                        this.exec(pipeline).then(resolve, reject);
+                    });
+                }), callback);
+            }
+            if (this._transactions > 0) {
+                exec.call(pipeline);
+            }
+            // Returns directly when the pipeline
+            // has been called multiple times (retries).
+            if (this.nodeifiedPromise) {
+                return exec.call(pipeline);
+            }
+            // Count only user commands (exclude MULTI/EXEC wrappers).
+            const batchSize = Math.max(pipeline.length - 2, 0);
+            const execAndUnwrap = () => exec.call(pipeline).then(function (result) {
+                const execResult = result[result.length - 1];
+                if (typeof execResult === "undefined") {
+                    throw new Error("Pipeline cannot be used to send any commands when the `exec()` has been called on it.");
+                }
+                if (execResult[0]) {
+                    execResult[0].previousErrors = [];
+                    for (let i = 0; i < result.length - 1; ++i) {
+                        if (result[i][0]) {
+                            execResult[0].previousErrors.push(result[i][0]);
+                        }
+                    }
+                    throw execResult[0];
+                }
+                return (0, utils_1.wrapMultiResult)(execResult[1]);
+            });
+            // Trace MULTI as a single batch operation on ioredis:batch.
+            const promise = "_buildBatchContext" in this.redis
+                ? (0, tracing_1.traceBatch)(execAndUnwrap, () => this.redis._buildBatchContext(batchSize))
+                : execAndUnwrap();
+            return (0, standard_as_callback_1.default)(promise, callback);
+        };
+        // @ts-expect-error
+        const { execBuffer } = pipeline;
+        // @ts-expect-error
+        pipeline.execBuffer = function (callback) {
+            if (this._transactions > 0) {
+                execBuffer.call(pipeline);
+            }
+            return pipeline.exec(callback);
+        };
+        return pipeline;
+    };
+    const { exec } = redis;
+    redis.exec = function (callback) {
+        return (0, standard_as_callback_1.default)(exec.call(this).then(function (results) {
+            if (Array.isArray(results)) {
+                results = (0, utils_1.wrapMultiResult)(results);
+            }
+            return results;
+        }), callback);
+    };
+}
+exports.addTransactionSupport = addTransactionSupport;
diff --git a/node_modules/ioredis/built/types.d.ts b/node_modules/ioredis/built/types.d.ts
new file mode 100644
index 0000000..e6d95a9
--- /dev/null
+++ b/node_modules/ioredis/built/types.d.ts
@@ -0,0 +1,33 @@
+/// <reference types="node" />
+import { Socket } from "net";
+import { TLSSocket } from "tls";
+export declare type Callback<T = any> = (err?: Error | null, result?: T) => void;
+export declare type NetStream = Socket | TLSSocket;
+export declare type CommandParameter = string | Buffer | number | any[];
+export interface Respondable {
+    name: string;
+    args: CommandParameter[];
+    resolve(result: any): void;
+    reject(error: Error): void;
+}
+export interface PipelineWriteableStream {
+    isPipeline: true;
+    write(data: string | Buffer): unknown;
+    destination: {
+        redis: {
+            stream: NetStream;
+        };
+    };
+}
+export declare type WriteableStream = NetStream | PipelineWriteableStream;
+export interface CommandItem {
+    command: Respondable;
+    stream: WriteableStream;
+    select: number;
+}
+export interface ScanStreamOptions {
+    match?: string;
+    type?: string;
+    count?: number;
+    noValues?: boolean;
+}
diff --git a/node_modules/ioredis/built/types.js b/node_modules/ioredis/built/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/ioredis/built/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ioredis/built/utils/Commander.d.ts b/node_modules/ioredis/built/utils/Commander.d.ts
new file mode 100644
index 0000000..cbee525
--- /dev/null
+++ b/node_modules/ioredis/built/utils/Commander.d.ts
@@ -0,0 +1,50 @@
+import Command from "../Command";
+import { WriteableStream } from "../types";
+import RedisCommander, { ClientContext } from "./RedisCommander";
+export interface CommanderOptions {
+    keyPrefix?: string | undefined;
+    showFriendlyErrorStack?: boolean | undefined;
+}
+declare class Commander<Context extends ClientContext = {
+    type: "default";
+}> {
+    options: CommanderOptions;
+    /**
+     * @ignore
+     */
+    scriptsSet: {};
+    /**
+     * @ignore
+     */
+    addedBuiltinSet: Set<string>;
+    /**
+     * Return supported builtin commands
+     */
+    getBuiltinCommands(): string[];
+    /**
+     * Create a builtin command
+     */
+    createBuiltinCommand(commandName: string): {
+        string: any;
+        buffer: any;
+    };
+    /**
+     * Create add builtin command
+     */
+    addBuiltinCommand(commandName: string): void;
+    /**
+     * Define a custom command using lua script
+     */
+    defineCommand(name: string, definition: {
+        lua: string;
+        numberOfKeys?: number;
+        readOnly?: boolean;
+    }): void;
+    /**
+     * @ignore
+     */
+    sendCommand(command: Command, stream?: WriteableStream, node?: unknown): unknown;
+}
+interface Commander<Context> extends RedisCommander<Context> {
+}
+export default Commander;
diff --git a/node_modules/ioredis/built/utils/Commander.js b/node_modules/ioredis/built/utils/Commander.js
new file mode 100644
index 0000000..31a9155
--- /dev/null
+++ b/node_modules/ioredis/built/utils/Commander.js
@@ -0,0 +1,117 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const commands_1 = require("@ioredis/commands");
+const autoPipelining_1 = require("../autoPipelining");
+const Command_1 = require("../Command");
+const Script_1 = require("../Script");
+// eslint-disable-next-line @typescript-eslint/no-unused-vars
+class Commander {
+    constructor() {
+        this.options = {};
+        /**
+         * @ignore
+         */
+        this.scriptsSet = {};
+        /**
+         * @ignore
+         */
+        this.addedBuiltinSet = new Set();
+    }
+    /**
+     * Return supported builtin commands
+     */
+    getBuiltinCommands() {
+        return commands.slice(0);
+    }
+    /**
+     * Create a builtin command
+     */
+    createBuiltinCommand(commandName) {
+        return {
+            string: generateFunction(null, commandName, "utf8"),
+            buffer: generateFunction(null, commandName, null),
+        };
+    }
+    /**
+     * Create add builtin command
+     */
+    addBuiltinCommand(commandName) {
+        this.addedBuiltinSet.add(commandName);
+        this[commandName] = generateFunction(commandName, commandName, "utf8");
+        this[commandName + "Buffer"] = generateFunction(commandName + "Buffer", commandName, null);
+    }
+    /**
+     * Define a custom command using lua script
+     */
+    defineCommand(name, definition) {
+        const script = new Script_1.default(definition.lua, definition.numberOfKeys, this.options.keyPrefix, definition.readOnly);
+        this.scriptsSet[name] = script;
+        this[name] = generateScriptingFunction(name, name, script, "utf8");
+        this[name + "Buffer"] = generateScriptingFunction(name + "Buffer", name, script, null);
+    }
+    /**
+     * @ignore
+     */
+    sendCommand(command, stream, node) {
+        throw new Error('"sendCommand" is not implemented');
+    }
+}
+const commands = commands_1.list.filter((command) => command !== "monitor");
+commands.push("sentinel");
+commands.forEach(function (commandName) {
+    Commander.prototype[commandName] = generateFunction(commandName, commandName, "utf8");
+    Commander.prototype[commandName + "Buffer"] = generateFunction(commandName + "Buffer", commandName, null);
+});
+Commander.prototype.call = generateFunction("call", "utf8");
+Commander.prototype.callBuffer = generateFunction("callBuffer", null);
+// @ts-expect-error
+Commander.prototype.send_command = Commander.prototype.call;
+function generateFunction(functionName, _commandName, _encoding) {
+    if (typeof _encoding === "undefined") {
+        _encoding = _commandName;
+        _commandName = null;
+    }
+    return function (...args) {
+        const commandName = (_commandName || args.shift());
+        let callback = args[args.length - 1];
+        if (typeof callback === "function") {
+            args.pop();
+        }
+        else {
+            callback = undefined;
+        }
+        const options = {
+            errorStack: this.options.showFriendlyErrorStack ? new Error() : undefined,
+            keyPrefix: this.options.keyPrefix,
+            replyEncoding: _encoding,
+        };
+        // No auto pipeline, use regular command sending
+        if (!(0, autoPipelining_1.shouldUseAutoPipelining)(this, functionName, commandName)) {
+            return this.sendCommand(
+            // @ts-expect-error
+            new Command_1.default(commandName, args, options, callback));
+        }
+        // Create a new pipeline and make sure it's scheduled
+        return (0, autoPipelining_1.executeWithAutoPipelining)(this, functionName, commandName, 
+        // @ts-expect-error
+        args, callback);
+    };
+}
+function generateScriptingFunction(functionName, commandName, script, encoding) {
+    return function (...args) {
+        const callback = typeof args[args.length - 1] === "function" ? args.pop() : undefined;
+        const options = {
+            replyEncoding: encoding,
+        };
+        if (this.options.showFriendlyErrorStack) {
+            options.errorStack = new Error();
+        }
+        // No auto pipeline, use regular command sending
+        if (!(0, autoPipelining_1.shouldUseAutoPipelining)(this, functionName, commandName)) {
+            return script.execute(this, args, options, callback);
+        }
+        // Create a new pipeline and make sure it's scheduled
+        return (0, autoPipelining_1.executeWithAutoPipelining)(this, functionName, commandName, args, callback);
+    };
+}
+exports.default = Commander;
diff --git a/node_modules/ioredis/built/utils/RedisCommander.d.ts b/node_modules/ioredis/built/utils/RedisCommander.d.ts
new file mode 100644
index 0000000..d99eafe
--- /dev/null
+++ b/node_modules/ioredis/built/utils/RedisCommander.d.ts
@@ -0,0 +1,9728 @@
+/**
+ * This file is generated by @ioredis/interface-generator.
+ * Don't edit it manually. Instead, run `npm run generate` to update
+ * this file.
+ */
+/// <reference types="node" />
+import { Callback } from "../types";
+export declare type RedisKey = string | Buffer;
+export declare type RedisValue = string | Buffer | number;
+export interface ResultTypes<Result, Context> {
+    default: Promise<Result>;
+    pipeline: ChainableCommander;
+}
+export interface ChainableCommander extends RedisCommander<{
+    type: "pipeline";
+}> {
+    length: number;
+}
+export declare type ClientContext = {
+    type: keyof ResultTypes<unknown, unknown>;
+};
+export declare type Result<T, Context extends ClientContext> = ResultTypes<T, Context>[Context["type"]];
+interface RedisCommander<Context extends ClientContext = {
+    type: "default";
+}> {
+    /**
+     * Call arbitrary commands.
+     *
+     * `redis.call('set', 'foo', 'bar')` is the same as `redis.set('foo', 'bar')`,
+     * so the only case you need to use this method is when the command is not
+     * supported by ioredis.
+     *
+     * ```ts
+     * redis.call('set', 'foo', 'bar');
+     * redis.call('get', 'foo', (err, value) => {
+     *   // value === 'bar'
+     * });
+     * ```
+     */
+    call(command: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    call(command: string, args: (string | Buffer | number)[], callback?: Callback<unknown>): Result<unknown, Context>;
+    call(...args: [
+        command: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    call(...args: [command: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    callBuffer(command: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    callBuffer(command: string, args: (string | Buffer | number)[], callback?: Callback<unknown>): Result<unknown, Context>;
+    callBuffer(...args: [
+        command: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    callBuffer(...args: [command: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    /**
+     * List the ACL categories or the commands inside a category
+     * - _group_: server
+     * - _complexity_: O(1) since the categories and commands are a fixed set.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "CAT", callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "CAT", categoryname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Remove the specified ACL users and the associated rules
+     * - _group_: server
+     * - _complexity_: O(1) amortized time considering the typical user.
+     * - _since_: 6.0.0
+     */
+    acl(...args: [
+        subcommand: "DELUSER",
+        ...usernames: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    acl(...args: [subcommand: "DELUSER", ...usernames: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Returns whether the user can execute the given command without executing the command.
+     * - _group_: server
+     * - _complexity_: O(1).
+     * - _since_: 7.0.0
+     */
+    acl(subcommand: "DRYRUN", username: string | Buffer, command: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "DRYRUN", username: string | Buffer, command: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    acl(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    aclBuffer(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    acl(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    aclBuffer(...args: [
+        subcommand: "DRYRUN",
+        username: string | Buffer,
+        command: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    /**
+     * Generate a pseudorandom secure password to use for ACL users
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "GENPASS", callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "GENPASS", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    acl(subcommand: "GENPASS", bits: number | string, callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "GENPASS", bits: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Get the rules for a specific ACL user
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of password, command and pattern rules that the user has.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "GETUSER", username: string | Buffer, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    aclBuffer(subcommand: "GETUSER", username: string | Buffer, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the current ACL rules in ACL config file format
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LIST", callback?: Callback<string[]>): Result<string[], Context>;
+    aclBuffer(subcommand: "LIST", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Reload the ACLs from the configured ACL file
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LOAD", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * List latest events denied because of ACLs in place
+     * - _group_: server
+     * - _complexity_: O(N) with N being the number of entries shown.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "LOG", callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "LOG", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    acl(subcommand: "LOG", reset: "RESET", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Save the current ACL rules in the configured ACL file
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "SAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Modify or create the rules for a specific ACL user
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of rules provided.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "SETUSER", username: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    acl(...args: [
+        subcommand: "SETUSER",
+        username: string | Buffer,
+        ...rules: (string | Buffer)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    acl(...args: [
+        subcommand: "SETUSER",
+        username: string | Buffer,
+        ...rules: (string | Buffer)[]
+    ]): Result<"OK", Context>;
+    /**
+     * List the username of all the configured ACL rules
+     * - _group_: server
+     * - _complexity_: O(N). Where N is the number of configured users.
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "USERS", callback?: Callback<string[]>): Result<string[], Context>;
+    aclBuffer(subcommand: "USERS", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return the name of the user associated to the current connection
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    acl(subcommand: "WHOAMI", callback?: Callback<string>): Result<string, Context>;
+    aclBuffer(subcommand: "WHOAMI", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Append a value to a key
+     * - _group_: string
+     * - _complexity_: O(1). The amortized time complexity is O(1) assuming the appended value is small and the already present value is of any size, since the dynamic string library used by Redis will double the free space available on every reallocation.
+     * - _since_: 2.0.0
+     */
+    append(key: RedisKey, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns the number of non-empty elements in an array.
+     * - _group_: array
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    arcount(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Deletes elements at the specified indices in an array.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the number of indices to delete
+     * - _since_: 8.8.0
+     */
+    ardel(...args: [key: RedisKey, ...indices: (number | string)[], callback: Callback<number>]): Result<number, Context>;
+    ardel(...args: [key: RedisKey, ...indices: (number | string)[]]): Result<number, Context>;
+    /**
+     * Deletes elements in one or more ranges.
+     * - _group_: array
+     * - _complexity_: Proportional to the number of existing elements / slices touched, not to the numeric span of the requested ranges
+     * - _since_: 8.8.0
+     */
+    ardelrange(...args: [key: RedisKey, ...ranges: (string | number)[], callback: Callback<number>]): Result<number, Context>;
+    ardelrange(...args: [key: RedisKey, ...ranges: (string | number)[]]): Result<number, Context>;
+    /**
+     * Gets the value at an index in an array.
+     * - _group_: array
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    arget(key: RedisKey, index: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    argetBuffer(key: RedisKey, index: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Gets values in a range of indices.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the range length
+     * - _since_: 8.8.0
+     */
+    argetrange(key: RedisKey, start: number | string, end: number | string, callback?: Callback<(string | null)[]>): Result<(string | null)[], Context>;
+    argetrangeBuffer(key: RedisKey, start: number | string, end: number | string, callback?: Callback<(Buffer | null)[]>): Result<(Buffer | null)[], Context>;
+    /**
+     * Searches array elements in a range using textual predicates.
+     * - _group_: array
+     * - _complexity_: O(P * C) where P is the number of visited positions in touched slices and C is the cost of evaluating the predicates on one existing element.
+     * - _since_: 8.8.0
+     */
+    argrep(key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, callback: Callback<number[]>): Result<number[], Context>;
+    argrep(...args: [key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, ...args: RedisValue[], callback: Callback<number[] | Array<[index: number, value: string]>>]): Result<number[] | Array<[index: number, value: string]>, Context>;
+    argrep<T extends RedisValue[]>(...args: [key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, ...args: T]): Result<'WITHVALUES' extends T[number] ? Array<[index: number, value: string]> : number[], Context>;
+    argrepBuffer(key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, callback: Callback<number[]>): Result<number[], Context>;
+    argrepBuffer(...args: [key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, ...args: RedisValue[], callback: Callback<number[] | Array<[index: number, value: Buffer]>>]): Result<number[] | Array<[index: number, value: Buffer]>, Context>;
+    argrepBuffer<T extends RedisValue[]>(...args: [key: RedisKey, start: number | string, end: number | string, predicate: 'EXACT' | 'MATCH' | 'GLOB' | 'RE', value: RedisValue, ...args: T]): Result<'WITHVALUES' extends T[number] ? Array<[index: number, value: Buffer]> : number[], Context>;
+    /**
+     * Returns metadata about an array.
+     * - _group_: array
+     * - _complexity_: O(1), or O(N) with FULL option where N is the number of slices.
+     * - _since_: 8.8.0
+     */
+    arinfo(key: RedisKey, callback?: Callback<(string | number)[]>): Result<(string | number)[], Context>;
+    arinfoBuffer(key: RedisKey, callback?: Callback<(Buffer | number)[]>): Result<(Buffer | number)[], Context>;
+    arinfo(key: RedisKey, full: 'FULL', callback?: Callback<(string | number)[]>): Result<(string | number)[], Context>;
+    arinfoBuffer(key: RedisKey, full: 'FULL', callback?: Callback<(Buffer | number)[]>): Result<(Buffer | number)[], Context>;
+    /**
+     * Inserts one or more values at consecutive indices.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the number of values
+     * - _since_: 8.8.0
+     */
+    arinsert(...args: [key: RedisKey, ...values: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    arinsert(...args: [key: RedisKey, ...values: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Returns the most recently inserted elements.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the count
+     * - _since_: 8.8.0
+     */
+    arlastitems(key: RedisKey, count: number | string, callback?: Callback<(string | null)[]>): Result<(string | null)[], Context>;
+    arlastitemsBuffer(key: RedisKey, count: number | string, callback?: Callback<(Buffer | null)[]>): Result<(Buffer | null)[], Context>;
+    arlastitems(key: RedisKey, count: number | string, rev: 'REV', callback?: Callback<(string | null)[]>): Result<(string | null)[], Context>;
+    arlastitemsBuffer(key: RedisKey, count: number | string, rev: 'REV', callback?: Callback<(Buffer | null)[]>): Result<(Buffer | null)[], Context>;
+    /**
+     * Returns the length of an array (max index + 1).
+     * - _group_: array
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    arlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Gets values at multiple indices in an array.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the number of indices
+     * - _since_: 8.8.0
+     */
+    armget(...args: [key: RedisKey, ...indices: (number | string)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    armgetBuffer(...args: [key: RedisKey, ...indices: (number | string)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    armget(...args: [key: RedisKey, ...indices: (number | string)[]]): Result<(string | null)[], Context>;
+    armgetBuffer(...args: [key: RedisKey, ...indices: (number | string)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Sets multiple index-value pairs in an array.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the number of pairs
+     * - _since_: 8.8.0
+     */
+    armset(...args: [key: RedisKey, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    armset(...args: [key: RedisKey, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Returns the next index ARINSERT would use.
+     * - _group_: array
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    arnext(key: RedisKey, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Performs aggregate operations on array elements in a range.
+     * - _group_: array
+     * - _complexity_: O(P) where P is visited positions in touched slices (dense scanned slots + sparse entries), with worst-case O(|end-start|+1) and typical case close to O(N), where N is the number of existing elements in range.
+     * - _since_: 8.8.0
+     */
+    arop(key: RedisKey, start: number | string, end: number | string, sum: 'SUM', callback?: Callback<string | null>): Result<string | null, Context>;
+    aropBuffer(key: RedisKey, start: number | string, end: number | string, sum: 'SUM', callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, min: 'MIN', callback?: Callback<string | null>): Result<string | null, Context>;
+    aropBuffer(key: RedisKey, start: number | string, end: number | string, min: 'MIN', callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, max: 'MAX', callback?: Callback<string | null>): Result<string | null, Context>;
+    aropBuffer(key: RedisKey, start: number | string, end: number | string, max: 'MAX', callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, and: 'AND', callback?: Callback<number | null>): Result<number | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, or: 'OR', callback?: Callback<number | null>): Result<number | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, xor: 'XOR', callback?: Callback<number | null>): Result<number | null, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, match: 'MATCH', value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    arop(key: RedisKey, start: number | string, end: number | string, used: 'USED', callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Inserts values into a ring buffer of specified size, wrapping and truncating as needed.
+     * - _group_: array
+     * - _complexity_: O(M) normally, O(N+M) on ring resize, where N is the maximum of the old and new ring size and M is the number of inserted values
+     * - _since_: 8.8.0
+     */
+    arring(...args: [key: RedisKey, size: number | string, ...values: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    arring(...args: [key: RedisKey, size: number | string, ...values: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Iterates existing elements in a range, returning index-value pairs.
+     * - _group_: array
+     * - _complexity_: O(P) where P is visited positions in touched slices (dense scanned slots + sparse entries), with worst-case O(|end-start|+1) and typical case close to O(N), where N is the number of existing elements in range.
+     * - _since_: 8.8.0
+     */
+    arscan(key: RedisKey, start: number | string, end: number | string, callback?: Callback<Array<[index: number, value: string]>>): Result<Array<[index: number, value: string]>, Context>;
+    arscanBuffer(key: RedisKey, start: number | string, end: number | string, callback?: Callback<Array<[index: number, value: Buffer]>>): Result<Array<[index: number, value: Buffer]>, Context>;
+    arscan(key: RedisKey, start: number | string, end: number | string, limitToken: 'LIMIT', limit: number | string, callback?: Callback<Array<[index: number, value: string]>>): Result<Array<[index: number, value: string]>, Context>;
+    arscanBuffer(key: RedisKey, start: number | string, end: number | string, limitToken: 'LIMIT', limit: number | string, callback?: Callback<Array<[index: number, value: Buffer]>>): Result<Array<[index: number, value: Buffer]>, Context>;
+    /**
+     * Sets the ARINSERT / ARRING cursor to a specific index.
+     * - _group_: array
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    arseek(key: RedisKey, index: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Sets one or more contiguous values starting at an index in an array.
+     * - _group_: array
+     * - _complexity_: O(N) where N is the number of values
+     * - _since_: 8.8.0
+     */
+    arset(...args: [key: RedisKey, index: number | string, ...values: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    arset(...args: [key: RedisKey, index: number | string, ...values: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Signals that a cluster client is following an -ASK redirect.
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    asking(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Authenticate to the server
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of passwords defined for the user
+     * - _since_: 1.0.0
+     */
+    auth(password: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    auth(username: string | Buffer, password: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Asynchronously rewrite the append-only file
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    bgrewriteaof(callback?: Callback<string>): Result<string, Context>;
+    bgrewriteaofBuffer(callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Asynchronously save the dataset to disk
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    bgsave(callback?: Callback<"OK">): Result<"OK", Context>;
+    bgsave(schedule: "SCHEDULE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Count set bits in a string
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.6.0
+     */
+    bitcount(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, byte: "BYTE", callback?: Callback<number>): Result<number, Context>;
+    bitcount(key: RedisKey, start: number | string, end: number | string, bit: "BIT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Perform arbitrary bitfield integer operations on strings
+     * - _group_: bitmap
+     * - _complexity_: O(1) for each subcommand specified
+     * - _since_: 3.2.0
+     */
+    bitfield(key: RedisKey, encodingOffsetToken: "GET", encoding: string | Buffer, offset: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", wrap: "WRAP", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", wrap: "WRAP", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", sat: "SAT", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", sat: "SAT", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", fail: "FAIL", encodingOffsetValueToken: "SET", encoding: string | Buffer, offset: number | string, value: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    bitfield(key: RedisKey, overflow: "OVERFLOW", fail: "FAIL", encodingOffsetIncrementToken: "INCRBY", encoding: string | Buffer, offset: number | string, increment: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Perform arbitrary bitfield integer operations on strings. Read-only variant of BITFIELD
+     * - _group_: bitmap
+     * - _complexity_: O(1) for each subcommand specified
+     * - _since_: 6.0.0
+     */
+    bitfield_ro(...args: [
+        key: RedisKey,
+        encodingOffsetToken: "GET",
+        ...encodingOffsets: (string | Buffer | number)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    bitfield_ro(...args: [
+        key: RedisKey,
+        encodingOffsetToken: "GET",
+        ...encodingOffsets: (string | Buffer | number)[]
+    ]): Result<unknown[], Context>;
+    /**
+     * Perform bitwise operations between strings
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.6.0
+     */
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    bitop(...args: [
+        operation: string | Buffer,
+        destkey: RedisKey,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    bitop(...args: [operation: string | Buffer, destkey: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Find first bit set or clear in a string
+     * - _group_: bitmap
+     * - _complexity_: O(N)
+     * - _since_: 2.8.7
+     */
+    bitpos(key: RedisKey, bit: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, byte: "BYTE", callback?: Callback<number>): Result<number, Context>;
+    bitpos(key: RedisKey, bit: number | string, start: number | string, end: number | string, bit1: "BIT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it; or block until one is available
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    blmove(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    blmove(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    blmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Pop elements from a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the number of provided keys and M is the number of elements returned.
+     * - _since_: 7.0.0
+     */
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT"
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    blmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    blmpopBuffer(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    /**
+     * Remove and get the first element in a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of provided keys.
+     * - _since_: 2.0.0
+     */
+    blpop(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [...keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    blpop(...args: [keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    blpopBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    /**
+     * Remove and get the last element in a list, or block until one is available
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of provided keys.
+     * - _since_: 2.0.0
+     */
+    brpop(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[string, string] | null>
+    ]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[Buffer, Buffer] | null>
+    ]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [...keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    brpop(...args: [keys: RedisKey[], timeout: number | string]): Result<[string, string] | null, Context>;
+    brpopBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[Buffer, Buffer] | null, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it; or block until one is available
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    brpoplpush(source: RedisKey, destination: RedisKey, timeout: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    brpoplpushBuffer(source: RedisKey, destination: RedisKey, timeout: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Remove and return members with scores in a sorted set or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 7.0.0
+     */
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX"
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    bzmpop(...args: [
+        timeout: number | string,
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    /**
+     * Remove and return the member with the highest score from one or more sorted sets, or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 5.0.0
+     */
+    bzpopmax(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmax(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopmaxBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    /**
+     * Remove and return the member with the lowest score from one or more sorted sets, or block until one is available
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 5.0.0
+     */
+    bzpopmin(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [
+        ...keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: string, member: string, score: string] | null>
+    ]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [
+        keys: RedisKey[],
+        timeout: number | string,
+        callback: Callback<[key: Buffer, member: Buffer, score: Buffer] | null>
+    ]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [...keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    bzpopmin(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: string, member: string, score: string] | null, Context>;
+    bzpopminBuffer(...args: [keys: RedisKey[], timeout: number | string]): Result<[key: Buffer, member: Buffer, score: Buffer] | null, Context>;
+    /**
+     * Instruct the server about tracking or not keys in the next request
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    client(subcommand: "CACHING", yes: "YES", callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "CACHING", no: "NO", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get the current connection name
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.6.9
+     */
+    client(subcommand: "GETNAME", callback?: Callback<string | null>): Result<string | null, Context>;
+    clientBuffer(subcommand: "GETNAME", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get tracking notifications redirection client ID if any
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    client(subcommand: "GETREDIR", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Returns the client ID for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "ID", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns information about the current client connection.
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "INFO", callback?: Callback<string>): Result<string, Context>;
+    clientBuffer(subcommand: "INFO", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Kill the connection of a client
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of client connections
+     * - _since_: 2.4.0
+     */
+    client(...args: [
+        subcommand: "KILL",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [subcommand: "KILL", ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Get the list of client connections
+     * - _group_: connection
+     * - _complexity_: O(N) where N is the number of client connections
+     * - _since_: 2.4.0
+     */
+    client(subcommand: "LIST", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", normal: "NORMAL", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        normal: "NORMAL",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        normal: "NORMAL",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", master: "MASTER", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        master: "MASTER",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        master: "MASTER",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", replica: "REPLICA", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        replica: "REPLICA",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        replica: "REPLICA",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    client(subcommand: "LIST", type: "TYPE", pubsub: "PUBSUB", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        pubsub: "PUBSUB",
+        idToken: "ID",
+        ...clientIds: (number | string)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [
+        subcommand: "LIST",
+        type: "TYPE",
+        pubsub: "PUBSUB",
+        idToken: "ID",
+        ...clientIds: (number | string)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Set client eviction mode for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    client(subcommand: "NO-EVICT", on: "ON", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "NO-EVICT", off: "OFF", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Stop processing commands from clients for some time
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.9.50
+     */
+    client(subcommand: "PAUSE", timeout: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "PAUSE", timeout: number | string, write: "WRITE", callback?: Callback<"OK">): Result<"OK", Context>;
+    client(subcommand: "PAUSE", timeout: number | string, all: "ALL", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Instruct the server whether to reply to commands
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    client(subcommand: "REPLY", on: "ON", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "REPLY", off: "OFF", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "REPLY", skip: "SKIP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set the current connection name
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 2.6.9
+     */
+    client(subcommand: "SETNAME", connectionName: string | Buffer, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Enable or disable server assisted client side caching support
+     * - _group_: connection
+     * - _complexity_: O(1). Some options may introduce additional complexity.
+     * - _since_: 6.0.0
+     */
+    client(...args: [
+        subcommand: "TRACKING",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    client(...args: [subcommand: "TRACKING", ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Return information about server assisted client side caching for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "TRACKINGINFO", callback?: Callback<string>): Result<string, Context>;
+    clientBuffer(subcommand: "TRACKINGINFO", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Unblock a client blocked in a blocking command from a different connection
+     * - _group_: connection
+     * - _complexity_: O(log N) where N is the number of client connections
+     * - _since_: 5.0.0
+     */
+    client(subcommand: "UNBLOCK", clientId: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "UNBLOCK", clientId: number | string, timeout: "TIMEOUT", callback?: Callback<unknown>): Result<unknown, Context>;
+    client(subcommand: "UNBLOCK", clientId: number | string, error: "ERROR", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Resume processing of clients that were paused
+     * - _group_: connection
+     * - _complexity_: O(N) Where N is the number of paused clients
+     * - _since_: 6.2.0
+     */
+    client(subcommand: "UNPAUSE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Assign new hash slots to receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of hash slot arguments
+     * - _since_: 3.0.0
+     */
+    cluster(...args: [
+        subcommand: "ADDSLOTS",
+        ...slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "ADDSLOTS",
+        slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "ADDSLOTS", ...slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "ADDSLOTS", slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Assign new hash slots to receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of the slots between the start slot and end slot arguments.
+     * - _since_: 7.0.0
+     */
+    cluster(...args: [
+        subcommand: "ADDSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "ADDSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[]
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Advance the cluster config epoch
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "BUMPEPOCH", callback?: Callback<"BUMPED" | "STILL">): Result<"BUMPED" | "STILL", Context>;
+    /**
+     * Return the number of failure reports active for a given node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of failure reports
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "COUNT-FAILURE-REPORTS", nodeId: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the number of local keys in the specified hash slot
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "COUNTKEYSINSLOT", slot: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set hash slots as unbound in receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of hash slot arguments
+     * - _since_: 3.0.0
+     */
+    cluster(...args: [
+        subcommand: "DELSLOTS",
+        ...slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "DELSLOTS",
+        slots: (number | string)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "DELSLOTS", ...slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [subcommand: "DELSLOTS", slots: (number | string)[]]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Set hash slots as unbound in receiving node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of the slots between the start slot and end slot arguments.
+     * - _since_: 7.0.0
+     */
+    cluster(...args: [
+        subcommand: "DELSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[],
+        callback: Callback<[
+            startSlotRange: number,
+            endSlotRange: number,
+            ...nodes: [
+                host: string,
+                port: number,
+                nodeId: string,
+                info: unknown[]
+            ][]
+        ][]>
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    cluster(...args: [
+        subcommand: "DELSLOTSRANGE",
+        ...startSlotEndSlots: (string | number)[]
+    ]): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Forces a replica to perform a manual failover of its master.
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FAILOVER", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "FAILOVER", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "FAILOVER", takeover: "TAKEOVER", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Delete a node's own slots information
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FLUSHSLOTS", callback?: Callback<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [
+            host: string,
+            port: number,
+            nodeId: string,
+            info: unknown[]
+        ][]
+    ][]>): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Remove a node from the nodes table
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "FORGET", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return local key names in the specified hash slot
+     * - _group_: cluster
+     * - _complexity_: O(log(N)) where N is the number of requested keys
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "GETKEYSINSLOT", slot: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    cluster(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Provides info about Redis Cluster node state
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "INFO", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Returns the hash slot of the specified key
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of bytes in the key
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "KEYSLOT", key: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns a list of all TCP links to and from peer nodes in cluster
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 7.0.0
+     */
+    cluster(subcommand: "LINKS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Force a node cluster to handshake with another node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "MEET", ip: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return the node id
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "MYID", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Get Cluster config for the node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "NODES", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List replica nodes of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    cluster(subcommand: "REPLICAS", nodeId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Reconfigure a node as a replica of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "REPLICATE", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Reset a Redis Cluster node
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the number of known nodes. The command may execute a FLUSHALL as a side effect.
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "RESET", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "RESET", hard: "HARD", callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "RESET", soft: "SOFT", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Forces the node to save cluster state on disk
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SAVECONFIG", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the configuration epoch in a new node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SET-CONFIG-EPOCH", configEpoch: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Bind a hash slot to a specific node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "IMPORTING", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "MIGRATING", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, nodeIdToken: "NODE", nodeId: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    cluster(subcommand: "SETSLOT", slot: number | string, stable: "STABLE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get array of cluster slots to node mappings
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of cluster nodes
+     * - _since_: 7.0.0
+     */
+    cluster(subcommand: "SHARDS", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List replica nodes of the specified master node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SLAVES", nodeId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get array of Cluster slot to node mappings
+     * - _group_: cluster
+     * - _complexity_: O(N) where N is the total number of Cluster nodes
+     * - _since_: 3.0.0
+     */
+    cluster(subcommand: "SLOTS", callback?: Callback<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [
+            host: string,
+            port: number,
+            nodeId: string,
+            info: unknown[]
+        ][]
+    ][]>): Result<[
+        startSlotRange: number,
+        endSlotRange: number,
+        ...nodes: [host: string, port: number, nodeId: string, info: unknown[]][]
+    ][], Context>;
+    /**
+     * Get total number of Redis commands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "COUNT", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get array of specific Redis command documentation
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands to look up
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "DOCS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(...args: [
+        subcommand: "DOCS",
+        ...commandNames: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    command(...args: [subcommand: "DOCS", ...commandNames: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Extract keys given a full Redis command
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of arguments to the command
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "GETKEYS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Extract keys and access flags given a full Redis command
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of arguments to the command
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "GETKEYSANDFLAGS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    command(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get array of specific Redis command details, or all when no argument is given.
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands to look up
+     * - _since_: 2.8.13
+     */
+    command(subcommand: "INFO", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(...args: [
+        subcommand: "INFO",
+        ...commandNames: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    command(...args: [subcommand: "INFO", ...commandNames: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Get an array of Redis command names
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of Redis commands
+     * - _since_: 7.0.0
+     */
+    command(subcommand: "LIST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", moduleNameToken: "MODULE", moduleName: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", categoryToken: "ACLCAT", category: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    command(subcommand: "LIST", filterby: "FILTERBY", patternToken: "PATTERN", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the values of configuration parameters
+     * - _group_: server
+     * - _complexity_: O(N) when N is the number of configuration parameters provided
+     * - _since_: 2.0.0
+     */
+    config(...args: [
+        subcommand: "GET",
+        ...parameters: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    config(...args: [subcommand: "GET", ...parameters: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    config(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Reset the stats returned by INFO
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    config(subcommand: "RESETSTAT", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Rewrite the configuration file with the in memory configuration
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.0
+     */
+    config(subcommand: "REWRITE", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set configuration parameters to the given values
+     * - _group_: server
+     * - _complexity_: O(N) when N is the number of configuration parameters provided
+     * - _since_: 2.0.0
+     */
+    config(...args: [
+        subcommand: "SET",
+        ...parameterValues: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    config(...args: [
+        subcommand: "SET",
+        ...parameterValues: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Copy a key
+     * - _group_: generic
+     * - _complexity_: O(N) worst case for collections, where N is the number of nested items. O(1) for string values.
+     * - _since_: 6.2.0
+     */
+    copy(source: RedisKey, destination: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, replace: "REPLACE", callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, destinationDbToken: "DB", destinationDb: number | string, callback?: Callback<number>): Result<number, Context>;
+    copy(source: RedisKey, destination: RedisKey, destinationDbToken: "DB", destinationDb: number | string, replace: "REPLACE", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the number of keys in the selected database
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    dbsize(callback?: Callback<number>): Result<number, Context>;
+    /**
+     * A container for debugging commands
+     * - _group_: server
+     * - _complexity_: Depends on subcommand.
+     * - _since_: 1.0.0
+     */
+    debug(subcommand: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    debug(...args: [
+        subcommand: string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    debug(...args: [subcommand: string, ...args: (string | Buffer | number)[]]): Result<unknown, Context>;
+    /**
+     * Decrement the integer value of a key by one
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    decr(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Decrement the integer value of a key by the given number
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    decrby(key: RedisKey, decrement: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Delete a key
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys that will be removed. When a key to remove holds a value other than a string, the individual complexity for this key is O(M) where M is the number of elements in the list, set, sorted set or hash. Removing a single key that holds a string value is O(1).
+     * - _since_: 1.0.0
+     */
+    del(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    del(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    del(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    del(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Discard all commands issued after MULTI
+     * - _group_: transactions
+     * - _complexity_: O(N), when N is the number of queued commands
+     * - _since_: 2.0.0
+     */
+    discard(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return a serialized version of the value stored at the specified key.
+     * - _group_: generic
+     * - _complexity_: O(1) to access the key and additional O(N*M) to serialize it, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1).
+     * - _since_: 2.6.0
+     */
+    dump(key: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    dumpBuffer(key: RedisKey, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Echo the given string
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    echo(message: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    echoBuffer(message: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Execute a Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 2.6.0
+     */
+    eval(script: string | Buffer, numkeys: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a read-only Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 7.0.0
+     */
+    eval_ro(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    eval_ro(...args: [
+        script: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 2.6.0
+     */
+    evalsha(sha1: string | Buffer, numkeys: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<unknown, Context>;
+    evalsha(...args: [sha1: string | Buffer, numkeys: number | string, keys: RedisKey[]]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute a read-only Lua script server side
+     * - _group_: scripting
+     * - _complexity_: Depends on the script that is executed.
+     * - _since_: 7.0.0
+     */
+    evalsha_ro(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    evalsha_ro(...args: [
+        sha1: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Execute all commands issued after MULTI
+     * - _group_: transactions
+     * - _complexity_: Depends on commands in the transaction
+     * - _since_: 1.2.0
+     */
+    exec(callback?: Callback<[error: Error | null, result: unknown][] | null>): Promise<[error: Error | null, result: unknown][] | null>;
+    /**
+     * Determine if a key exists
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys to check.
+     * - _since_: 1.0.0
+     */
+    exists(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    exists(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    exists(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    exists(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Set a key's time to live in seconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    expire(key: RedisKey, seconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    expire(key: RedisKey, seconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the expiration for a key as a UNIX timestamp
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    expireat(key: RedisKey, unixTimeSeconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    expireat(key: RedisKey, unixTimeSeconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the expiration Unix timestamp for a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    expiretime(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Start a coordinated failover between this server and one of its replicas.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    failover(callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    failover(targetToken: "TO", host: string | Buffer, port: number | string, force: "FORCE", abort: "ABORT", millisecondsToken: "TIMEOUT", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Invoke a function
+     * - _group_: scripting
+     * - _complexity_: Depends on the function that is executed.
+     * - _since_: 7.0.0
+     */
+    fcall(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    fcall(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Invoke a read-only function
+     * - _group_: scripting
+     * - _complexity_: Depends on the function that is executed.
+     * - _since_: 7.0.0
+     */
+    fcall_ro(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    fcall_ro(...args: [
+        function: string | Buffer,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Remove all keys from all databases
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of keys in all databases
+     * - _since_: 1.0.0
+     */
+    flushall(callback?: Callback<"OK">): Result<"OK", Context>;
+    flushall(async: "ASYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    flushall(sync: "SYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Remove all keys from the current database
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of keys in the selected database
+     * - _since_: 1.0.0
+     */
+    flushdb(callback?: Callback<"OK">): Result<"OK", Context>;
+    flushdb(async: "ASYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    flushdb(sync: "SYNC", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Delete a function by name
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "DELETE", libraryName: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "DELETE", libraryName: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Dump all functions into a serialized binary payload
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "DUMP", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "DUMP", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Deleting all functions
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions deleted
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "FLUSH", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Kill the function currently in execution.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "KILL", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "KILL", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * List information about all the functions
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "LIST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", withcode: "WITHCODE", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", libraryNamePatternToken: "LIBRARYNAME", libraryNamePattern: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    function(subcommand: "LIST", libraryNamePatternToken: "LIBRARYNAME", libraryNamePattern: string | Buffer, withcode: "WITHCODE", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Create a function with the given arguments (name, code, description)
+     * - _group_: scripting
+     * - _complexity_: O(1) (considering compilation time is redundant)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "LOAD", functionCode: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "LOAD", functionCode: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "LOAD", replace: "REPLACE", functionCode: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "LOAD", replace: "REPLACE", functionCode: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Restore all the functions on the given payload
+     * - _group_: scripting
+     * - _complexity_: O(N) where N is the number of functions on the payload
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, flush: "FLUSH", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, flush: "FLUSH", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, append: "APPEND", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, append: "APPEND", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    function(subcommand: "RESTORE", serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<string>): Result<string, Context>;
+    functionBuffer(subcommand: "RESTORE", serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Return information about the function currently running (name, description, duration)
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    function(subcommand: "STATS", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Add one or more geospatial items in the geospatial index represented using a sorted set
+     * - _group_: geo
+     * - _complexity_: O(log(N)) for each item added, where N is the number of elements in the sorted set.
+     * - _since_: 3.2.0
+     */
+    geoadd(...args: [
+        key: RedisKey,
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geoadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...longitudeLatitudeMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    /**
+     * Returns the distance between two members of a geospatial index
+     * - _group_: geo
+     * - _complexity_: O(log(N))
+     * - _since_: 3.2.0
+     */
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, m: "M", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, m: "M", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, km: "KM", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, km: "KM", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, ft: "FT", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, ft: "FT", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    geodist(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, mi: "MI", callback?: Callback<string | null>): Result<string | null, Context>;
+    geodistBuffer(key: RedisKey, member1: string | Buffer | number, member2: string | Buffer | number, mi: "MI", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Returns members of a geospatial index as standard geohash strings
+     * - _group_: geo
+     * - _complexity_: O(log(N)) for each member requested, where N is the number of elements in the sorted set.
+     * - _since_: 3.2.0
+     */
+    geohash(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    geohashBuffer(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    geohash(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    geohashBuffer(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    geohash(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<string[], Context>;
+    geohashBuffer(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<Buffer[], Context>;
+    geohash(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<string[], Context>;
+    geohashBuffer(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<Buffer[], Context>;
+    /**
+     * Returns longitude and latitude of members of a geospatial index
+     * - _group_: geo
+     * - _complexity_: O(N) where N is the number of members requested.
+     * - _since_: 3.2.0
+     */
+    geopos(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<([longitude: string, latitude: string] | null)[]>
+    ]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<([longitude: string, latitude: string] | null)[]>
+    ]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    geopos(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<([longitude: string, latitude: string] | null)[], Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.0
+     */
+    georadius(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    georadius(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    /**
+     * A read-only variant for GEORADIUS
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.10
+     */
+    georadius_ro(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadius_ro(...args: [
+        key: RedisKey,
+        longitude: number | string,
+        latitude: number | string,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.0
+     */
+    georadiusbymember(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadiusbymember(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * A read-only variant for GEORADIUSBYMEMBER
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.
+     * - _since_: 3.2.10
+     */
+    georadiusbymember_ro(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    georadiusbymember_ro(...args: [
+        key: RedisKey,
+        member: string | Buffer | number,
+        radius: number | string,
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle.
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape
+     * - _since_: 6.2.0
+     */
+    geosearch(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    geosearch(...args: [key: RedisKey, ...args: RedisValue[]]): Result<unknown[], Context>;
+    /**
+     * Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle, and store the result in another key.
+     * - _group_: geo
+     * - _complexity_: O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape
+     * - _since_: 6.2.0
+     */
+    geosearchstore(...args: [
+        destination: RedisKey,
+        source: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    geosearchstore(...args: [destination: RedisKey, source: RedisKey, ...args: RedisValue[]]): Result<number, Context>;
+    /**
+     * Get the value of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    get(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Returns the bit value at offset in the string value stored at key
+     * - _group_: bitmap
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    getbit(key: RedisKey, offset: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the value of a key and delete the key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    getdel(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getdelBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get the value of a key and optionally set its expiration
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    getex(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, secondsToken: "EX", seconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, secondsToken: "EX", seconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    getex(key: RedisKey, persist: "PERSIST", callback?: Callback<string | null>): Result<string | null, Context>;
+    getexBuffer(key: RedisKey, persist: "PERSIST", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get a substring of the string stored at a key
+     * - _group_: string
+     * - _complexity_: O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.
+     * - _since_: 2.4.0
+     */
+    getrange(key: RedisKey, start: number | string, end: number | string, callback?: Callback<string>): Result<string, Context>;
+    getrangeBuffer(key: RedisKey, start: number | string, end: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Set the string value of a key and return its old value
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    getset(key: RedisKey, value: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    getsetBuffer(key: RedisKey, value: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Delete one or more hash fields
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields to be removed.
+     * - _since_: 2.0.0
+     */
+    hdel(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    hdel(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Handshake with Redis
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.0.0
+     */
+    hello(callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, clientnameToken: "SETNAME", clientname: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, usernamePasswordToken: "AUTH", username: string | Buffer, password: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    hello(protover: number | string, usernamePasswordToken: "AUTH", username: string | Buffer, password: string | Buffer, clientnameToken: "SETNAME", clientname: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Determine if a hash field exists
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hexists(key: RedisKey, field: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set expiry for hash field using relative time to expire (seconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpire(...args: [key: RedisKey, seconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpire(...args: [key: RedisKey, seconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using an absolute Unix timestamp (seconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpireat(...args: [key: RedisKey, unixTimeSeconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the expiration time of a hash field as a Unix timestamp, in seconds.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hexpiretime(...args: [key: RedisKey, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hexpiretime(...args: [key: RedisKey, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get the value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hget(key: RedisKey, field: string | Buffer, callback?: Callback<string | null>): Result<string | null, Context>;
+    hgetBuffer(key: RedisKey, field: string | Buffer, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Get all the fields and values in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hgetall(key: RedisKey, callback?: Callback<Record<string, string>>): Result<Record<string, string>, Context>;
+    hgetallBuffer(key: RedisKey, callback?: Callback<Record<string, Buffer>>): Result<Record<string, Buffer>, Context>;
+    /**
+     * Returns the value of a field and deletes it from the hash.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 8.0.0
+     */
+    hgetdel(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetdelBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetdel(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetdelBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Get the value of one or more fields of a given hash key, and optionally set their expiration.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 8.0.0
+     */
+    hgetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    hgetex(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hgetexBuffer(...args: [key: RedisKey, persist: "PERSIST", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Increment the integer value of a hash field by the given number
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hincrby(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the float value of a hash field by the given amount
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    hincrbyfloat(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<string>): Result<string, Context>;
+    hincrbyfloatBuffer(key: RedisKey, field: string | Buffer, increment: number | string, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Get all the fields in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hkeys(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    hkeysBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get the number of fields in a hash
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the values of all the given hash fields
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being requested.
+     * - _since_: 2.0.0
+     */
+    hmget(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    hmgetBuffer(...args: [
+        key: RedisKey,
+        ...fields: (string | Buffer)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    hmget(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<(string | null)[], Context>;
+    hmgetBuffer(...args: [key: RedisKey, ...fields: (string | Buffer)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Set multiple hash fields to multiple values
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being set.
+     * - _since_: 2.0.0
+     */
+    hmset(key: RedisKey, object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    hmset(key: RedisKey, map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    hmset(...args: [
+        key: RedisKey,
+        ...fieldValues: (string | Buffer | number)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    hmset(...args: [key: RedisKey, ...fieldValues: (string | Buffer | number)[]]): Result<"OK", Context>;
+    /**
+     * Removes the expiration time for each specified field
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpersist(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpersist(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using relative time to expire (milliseconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, nx: 'NX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, xx: 'XX', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, gt: 'GT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpire(...args: [key: RedisKey, milliseconds: number | string, lt: 'LT', fieldsToken: 'FIELDS', numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Set expiry for hash field using an absolute Unix timestamp (milliseconds)
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpireat(...args: [key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the expiration time of a hash field as a Unix timestamp, in msec.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpexpiretime(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpexpiretime(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Returns the TTL in milliseconds of a hash field.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    hpttl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    hpttl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get one or multiple random fields from a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields returned
+     * - _since_: 6.2.0
+     */
+    hrandfield(key: RedisKey, callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    hrandfield(key: RedisKey, count: number | string, callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    hrandfield(key: RedisKey, count: number | string, withvalues: "WITHVALUES", callback?: Callback<string | unknown[] | null>): Result<string | unknown[] | null, Context>;
+    hrandfieldBuffer(key: RedisKey, count: number | string, withvalues: "WITHVALUES", callback?: Callback<Buffer | unknown[] | null>): Result<Buffer | unknown[] | null, Context>;
+    /**
+     * Incrementally iterate hash fields and associated values
+     * - _group_: hash
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    hscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    hscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    hscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Set the string value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1) for each field/value pair added, so O(N) to add N field/value pairs when the command is called with multiple field/value pairs.
+     * - _since_: 2.0.0
+     */
+    hset(key: RedisKey, object: object, callback?: Callback<number>): Result<number, Context>;
+    hset(key: RedisKey, map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<number>): Result<number, Context>;
+    hset(...args: [
+        key: RedisKey,
+        ...fieldValues: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    hset(...args: [key: RedisKey, ...fieldValues: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Set the value of one or more fields of a given hash key, and optionally set their expiration.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of fields being set.
+     * - _since_: 8.0.0
+     */
+    hsetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fnx: "FNX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", secondsToken: "EX", seconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", millisecondsToken: "PX", milliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    hsetex(...args: [key: RedisKey, fxx: "FXX", keepttl: "KEEPTTL", fieldsToken: "FIELDS", numfields: number | string, ...data: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Set the value of a hash field, only if the field does not exist
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    hsetnx(key: RedisKey, field: string | Buffer, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the length of the value of a hash field
+     * - _group_: hash
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    hstrlen(key: RedisKey, field: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Returns the TTL in seconds of a hash field.
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the number of specified fields
+     * - _since_: 7.4.0
+     */
+    httl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[], callback: Callback<number[]>]): Result<number[], Context>;
+    httl(...args: [key: RedisKey, fieldsToken: "FIELDS", numfields: number | string, ...fields: (string | Buffer)[]]): Result<number[], Context>;
+    /**
+     * Get all the values in a hash
+     * - _group_: hash
+     * - _complexity_: O(N) where N is the size of the hash.
+     * - _since_: 2.0.0
+     */
+    hvals(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    hvalsBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Increment the integer value of a key by one
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    incr(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the integer value of a key by the given amount
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    incrby(key: RedisKey, increment: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Increment the float value of a key by the given amount
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    incrbyfloat(key: RedisKey, increment: number | string, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Increments the numeric value of a key by a number and sets its expiration time. Uses 0 as initial value if the key doesn't exist.
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 8.8.0
+     */
+    increx(...args: [key: RedisKey, ...args: (RedisValue)[], callback: Callback<[value: number, increment: number] | [value: string, increment: string]>]): Result<[value: number, increment: number] | [value: string, increment: string], Context>;
+    increxBuffer(...args: [key: RedisKey, ...args: (RedisValue)[], callback: Callback<[value: number, increment: number] | [value: Buffer, increment: Buffer]>]): Result<[value: number, increment: number] | [value: Buffer, increment: Buffer], Context>;
+    increx(...args: [key: RedisKey, ...args: (RedisValue)[]]): Result<[value: number, increment: number] | [value: string, increment: string], Context>;
+    increxBuffer(...args: [key: RedisKey, ...args: (RedisValue)[]]): Result<[value: number, increment: number] | [value: Buffer, increment: Buffer], Context>;
+    /**
+     * Get information and statistics about the server
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    info(callback?: Callback<string>): Result<string, Context>;
+    info(...args: [...sections: (string | Buffer)[], callback: Callback<string>]): Result<string, Context>;
+    info(...args: [...sections: (string | Buffer)[]]): Result<string, Context>;
+    /**
+     * Find all keys matching the given pattern
+     * - _group_: generic
+     * - _complexity_: O(N) with N being the number of keys in the database, under the assumption that the key names in the database and the given pattern have limited length.
+     * - _since_: 1.0.0
+     */
+    keys(pattern: string, callback?: Callback<string[]>): Result<string[], Context>;
+    keysBuffer(pattern: string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get the UNIX time stamp of the last successful save to disk
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    lastsave(callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return a human readable latency analysis report.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "DOCTOR", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Return a latency graph for the event.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "GRAPH", event: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Show helpful text about the different subcommands.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return the cumulative distribution of latencies of a subset of commands or all.
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of commands with latency information being retrieved.
+     * - _since_: 7.0.0
+     */
+    latency(subcommand: "HISTOGRAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    latency(...args: [
+        subcommand: "HISTOGRAM",
+        ...commands: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    latency(...args: [subcommand: "HISTOGRAM", ...commands: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Return timestamp-latency samples for the event.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "HISTORY", event: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return the latest latency samples for all events.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "LATEST", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Reset latency data for one or more events.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.13
+     */
+    latency(subcommand: "RESET", callback?: Callback<number>): Result<number, Context>;
+    latency(...args: [
+        subcommand: "RESET",
+        ...events: (string | Buffer)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    latency(...args: [subcommand: "RESET", ...events: (string | Buffer)[]]): Result<number, Context>;
+    /**
+     * Find longest common substring
+     * - _group_: string
+     * - _complexity_: O(N*M) where N and M are the lengths of s1 and s2, respectively
+     * - _since_: 7.0.0
+     */
+    lcs(key1: RedisKey, key2: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, lenToken: "MINMATCHLEN", len: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, lenToken: "MINMATCHLEN", len: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", lenToken: "MINMATCHLEN", len: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, idx: "IDX", lenToken: "MINMATCHLEN", len: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", lenToken: "MINMATCHLEN", len1: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", lenToken: "MINMATCHLEN", len1: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", lenToken: "MINMATCHLEN", len1: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    lcs(key1: RedisKey, key2: RedisKey, len: "LEN", idx: "IDX", lenToken: "MINMATCHLEN", len1: number | string, withmatchlen: "WITHMATCHLEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get an element from a list by its index
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to traverse to get to the element at index. This makes asking for the first or the last element of the list O(1).
+     * - _since_: 1.0.0
+     */
+    lindex(key: RedisKey, index: number | string, callback?: Callback<string | null>): Result<string | null, Context>;
+    lindexBuffer(key: RedisKey, index: number | string, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Insert an element before or after another element in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to traverse before seeing the value pivot. This means that inserting somewhere on the left end on the list (head) can be considered O(1) and inserting somewhere on the right end (tail) is O(N).
+     * - _since_: 2.2.0
+     */
+    linsert(key: RedisKey, before: "BEFORE", pivot: string | Buffer | number, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    linsert(key: RedisKey, after: "AFTER", pivot: string | Buffer | number, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the length of a list
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    llen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Pop an element from a list, push it to another list and return it
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    lmove(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", left1: "LEFT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, left: "LEFT", right: "RIGHT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", left: "LEFT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    lmove(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", callback?: Callback<string>): Result<string, Context>;
+    lmoveBuffer(source: RedisKey, destination: RedisKey, right: "RIGHT", right1: "RIGHT", callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Pop elements from a list
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the number of provided keys and M is the number of elements returned.
+     * - _since_: 7.0.0
+     */
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, ...keys: RedisKey[], left: "LEFT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, ...keys: RedisKey[], left: "LEFT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, keys: RedisKey[], left: "LEFT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, keys: RedisKey[], left: "LEFT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        left: "LEFT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, ...keys: RedisKey[], right: "RIGHT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, ...keys: RedisKey[], right: "RIGHT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [numkeys: number | string, keys: RedisKey[], right: "RIGHT"]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [numkeys: number | string, keys: RedisKey[], right: "RIGHT"]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: string, members: string[]] | null>
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<[key: Buffer, members: Buffer[]] | null>
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    lmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: string, members: string[]] | null, Context>;
+    lmpopBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        right: "RIGHT",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<[key: Buffer, members: Buffer[]] | null, Context>;
+    /**
+     * Display some computer art and the Redis version
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 5.0.0
+     */
+    lolwut(callback?: Callback<string>): Result<string, Context>;
+    lolwut(versionToken: "VERSION", version: number | string, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Remove and get the first elements in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 1.0.0
+     */
+    lpop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    lpopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    lpop(key: RedisKey, count: number | string, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    lpopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Return the index of matching elements on a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements in the list, for the average case. When searching for elements near the head or the tail of the list, or when the MAXLEN option is provided, the command may run in constant time.
+     * - _since_: 6.0.6
+     */
+    lpos(key: RedisKey, element: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, lenToken: "MAXLEN", len: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, numMatchesToken: "COUNT", numMatches: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, numMatchesToken: "COUNT", numMatches: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, numMatchesToken: "COUNT", numMatches: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    lpos(key: RedisKey, element: string | Buffer | number, rankToken: "RANK", rank: number | string, numMatchesToken: "COUNT", numMatches: number | string, lenToken: "MAXLEN", len: number | string, callback?: Callback<number[]>): Result<number[], Context>;
+    /**
+     * Prepend one or multiple elements to a list
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    lpush(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    lpush(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Prepend an element to a list, only if the list exists
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 2.2.0
+     */
+    lpushx(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    lpushx(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Get a range of elements from a list
+     * - _group_: list
+     * - _complexity_: O(S+N) where S is the distance of start offset from HEAD for small lists, from nearest end (HEAD or TAIL) for large lists; and N is the number of elements in the specified range.
+     * - _since_: 1.0.0
+     */
+    lrange(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    lrangeBuffer(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove elements from a list
+     * - _group_: list
+     * - _complexity_: O(N+M) where N is the length of the list and M is the number of elements removed.
+     * - _since_: 1.0.0
+     */
+    lrem(key: RedisKey, count: number | string, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the value of an element in a list by its index
+     * - _group_: list
+     * - _complexity_: O(N) where N is the length of the list. Setting either the first or the last element of the list is O(1).
+     * - _since_: 1.0.0
+     */
+    lset(key: RedisKey, index: number | string, element: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Trim a list to the specified range
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements to be removed by the operation.
+     * - _since_: 1.0.0
+     */
+    ltrim(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Outputs memory problems report
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "DOCTOR", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show allocator internal stats
+     * - _group_: server
+     * - _complexity_: Depends on how much memory is allocated, could be slow
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "MALLOC-STATS", callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Ask the allocator to release memory
+     * - _group_: server
+     * - _complexity_: Depends on how much memory is allocated, could be slow
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "PURGE", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Show memory usage details
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "STATS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Estimate the memory usage of a key
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of samples.
+     * - _since_: 4.0.0
+     */
+    memory(subcommand: "USAGE", key: RedisKey, callback?: Callback<number | null>): Result<number | null, Context>;
+    memory(subcommand: "USAGE", key: RedisKey, countToken: "SAMPLES", count: number | string, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Get the values of all the given keys
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to retrieve.
+     * - _since_: 1.0.0
+     */
+    mget(...args: [...keys: RedisKey[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [...keys: RedisKey[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    mget(...args: [keys: RedisKey[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [keys: RedisKey[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    mget(...args: [...keys: RedisKey[]]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [...keys: RedisKey[]]): Result<(Buffer | null)[], Context>;
+    mget(...args: [keys: RedisKey[]]): Result<(string | null)[], Context>;
+    mgetBuffer(...args: [keys: RedisKey[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Atomically transfer a key from a Redis instance to another one.
+     * - _group_: generic
+     * - _complexity_: This command actually executes a DUMP+DEL in the source instance, and a RESTORE in the target instance. See the pages of these commands for time complexity. Also an O(N) data transfer between the two instances is performed.
+     * - _since_: 2.6.0
+     */
+    migrate(...args: [
+        host: string | Buffer,
+        port: number | string,
+        ...args: RedisValue[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    migrate(...args: [
+        host: string | Buffer,
+        port: number | string,
+        ...args: RedisValue[]
+    ]): Result<"OK", Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    module(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List all modules loaded by the server
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of loaded modules.
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "LIST", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Load a module
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "LOAD", path: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOAD",
+        path: string | Buffer,
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOAD",
+        path: string | Buffer,
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Load a module with extended parameters
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    module(subcommand: "LOADEX", path: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        argsToken: "ARGS",
+        ...args: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        argsToken: "ARGS",
+        ...args: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...configs: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...configs: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...args: RedisValue[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    module(...args: [
+        subcommand: "LOADEX",
+        path: string | Buffer,
+        configsToken: "CONFIG",
+        ...args: RedisValue[]
+    ]): Result<unknown, Context>;
+    /**
+     * Unload a module
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    module(subcommand: "UNLOAD", name: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Move a key to another database
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    move(key: RedisKey, db: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set multiple keys to multiple values
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to set.
+     * - _since_: 1.0.1
+     */
+    mset(object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    mset(map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    mset(...args: [
+        ...keyValues: (RedisKey | string | Buffer | number)[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    mset(...args: [...keyValues: (RedisKey | string | Buffer | number)[]]): Result<"OK", Context>;
+    /**
+     * Atomically sets multiple string keys with a shared expiration in a single operation. Supports flexible argument parsing where condition and expiration flags can appear in any order.
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to set.
+     * - _since_: 8.4.0
+     */
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[]]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], secondsToken: 'EX', seconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], secondsToken: 'EX', seconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], millisecondsToken: 'PX', milliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], millisecondsToken: 'PX', milliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], keepttl: 'KEEPTTL', callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], keepttl: 'KEEPTTL']): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX']): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', secondsToken: 'EX', seconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', secondsToken: 'EX', seconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', millisecondsToken: 'PX', milliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', millisecondsToken: 'PX', milliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', keepttl: 'KEEPTTL', callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], nx: 'NX', keepttl: 'KEEPTTL']): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX']): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', secondsToken: 'EX', seconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', secondsToken: 'EX', seconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', millisecondsToken: 'PX', milliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', millisecondsToken: 'PX', milliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', unixTimeSecondsToken: 'EXAT', unixTimeSeconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string, callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', unixTimeMillisecondsToken: 'PXAT', unixTimeMilliseconds: number | string]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', keepttl: 'KEEPTTL', callback: Callback<number>]): Result<number, Context>;
+    msetex(...args: [numkeys: number | string, ...data: (RedisKey | string | Buffer | number)[], xx: 'XX', keepttl: 'KEEPTTL']): Result<number, Context>;
+    /**
+     * Set multiple keys to multiple values, only if none of the keys exist
+     * - _group_: string
+     * - _complexity_: O(N) where N is the number of keys to set.
+     * - _since_: 1.0.1
+     */
+    msetnx(object: object, callback?: Callback<"OK">): Result<"OK", Context>;
+    msetnx(map: Map<string | Buffer | number, string | Buffer | number>, callback?: Callback<"OK">): Result<"OK", Context>;
+    msetnx(...args: [
+        ...keyValues: (RedisKey | string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    msetnx(...args: [...keyValues: (RedisKey | string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Inspect the internal encoding of a Redis object
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "ENCODING", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the logarithmic access frequency counter of a Redis object
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 4.0.0
+     */
+    object(subcommand: "FREQ", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    object(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the time since a Redis object was last accessed
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "IDLETIME", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the number of references to the value of the key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.3
+     */
+    object(subcommand: "REFCOUNT", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Remove the expiration from a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    persist(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set a key's time to live in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pexpire(key: RedisKey, milliseconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    pexpire(key: RedisKey, milliseconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the expiration for a key as a UNIX timestamp specified in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, nx: "NX", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, xx: "XX", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, gt: "GT", callback?: Callback<number>): Result<number, Context>;
+    pexpireat(key: RedisKey, unixTimeMilliseconds: number | string, lt: "LT", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Get the expiration Unix timestamp for a key in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 7.0.0
+     */
+    pexpiretime(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Adds the specified elements to the specified HyperLogLog.
+     * - _group_: hyperloglog
+     * - _complexity_: O(1) to add every element.
+     * - _since_: 2.8.9
+     */
+    pfadd(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    pfadd(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    pfadd(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).
+     * - _group_: hyperloglog
+     * - _complexity_: O(1) with a very small average constant time when called with a single key. O(N) with N being the number of keys, and much bigger constant times, when called with multiple keys.
+     * - _since_: 2.8.9
+     */
+    pfcount(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    pfcount(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    pfcount(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    pfcount(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Internal commands for debugging HyperLogLog values
+     * - _group_: hyperloglog
+     * - _complexity_: N/A
+     * - _since_: 2.8.9
+     */
+    pfdebug(subcommand: string | Buffer, key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Merge N different HyperLogLogs into a single one.
+     * - _group_: hyperloglog
+     * - _complexity_: O(N) to merge N HyperLogLogs, but with high constant times.
+     * - _since_: 2.8.9
+     */
+    pfmerge(...args: [
+        destkey: RedisKey,
+        ...sourcekeys: RedisKey[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    pfmerge(...args: [
+        destkey: RedisKey,
+        sourcekeys: RedisKey[],
+        callback: Callback<"OK">
+    ]): Result<"OK", Context>;
+    pfmerge(...args: [destkey: RedisKey, ...sourcekeys: RedisKey[]]): Result<"OK", Context>;
+    pfmerge(...args: [destkey: RedisKey, sourcekeys: RedisKey[]]): Result<"OK", Context>;
+    /**
+     * An internal command for testing HyperLogLog values
+     * - _group_: hyperloglog
+     * - _complexity_: N/A
+     * - _since_: 2.8.9
+     */
+    pfselftest(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Ping the server
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    ping(callback?: Callback<"PONG">): Result<"PONG", Context>;
+    ping(message: string | Buffer, callback?: Callback<string>): Result<string, Context>;
+    pingBuffer(message: string | Buffer, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Set the value and expiration in milliseconds of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    psetex(key: RedisKey, milliseconds: number | string, value: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Listen for messages published to channels matching the given patterns
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of patterns the client is already subscribed to.
+     * - _since_: 2.0.0
+     */
+    psubscribe(...args: [...patterns: string[], callback: Callback<unknown>]): Result<unknown, Context>;
+    psubscribe(...args: [...patterns: string[]]): Result<unknown, Context>;
+    /**
+     * Internal command used for replication
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 2.8.0
+     */
+    psync(replicationid: string | Buffer | number, offset: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the time to live for a key in milliseconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    pttl(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Post a message to a channel
+     * - _group_: pubsub
+     * - _complexity_: O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
+     * - _since_: 2.0.0
+     */
+    publish(channel: string | Buffer, message: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * List active channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of active channels, and assuming constant time pattern matching (relatively short channels and patterns)
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "CHANNELS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(subcommand: "CHANNELS", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: pubsub
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    pubsub(subcommand: "HELP", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of unique patterns pattern subscriptions
+     * - _group_: pubsub
+     * - _complexity_: O(1)
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "NUMPAT", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of subscribers for channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) for the NUMSUB subcommand, where N is the number of requested channels
+     * - _since_: 2.8.0
+     */
+    pubsub(subcommand: "NUMSUB", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(...args: [
+        subcommand: "NUMSUB",
+        ...channels: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    pubsub(...args: [subcommand: "NUMSUB", ...channels: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * List active shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of active shard channels, and assuming constant time pattern matching (relatively short shard channels).
+     * - _since_: 7.0.0
+     */
+    pubsub(subcommand: "SHARDCHANNELS", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(subcommand: "SHARDCHANNELS", pattern: string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Get the count of subscribers for shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) for the SHARDNUMSUB subcommand, where N is the number of requested shard channels
+     * - _since_: 7.0.0
+     */
+    pubsub(subcommand: "SHARDNUMSUB", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    pubsub(...args: [
+        subcommand: "SHARDNUMSUB",
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    pubsub(...args: [subcommand: "SHARDNUMSUB", ...shardchannels: (string | Buffer)[]]): Result<unknown[], Context>;
+    /**
+     * Stop listening for messages posted to channels matching the given patterns
+     * - _group_: pubsub
+     * - _complexity_: O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).
+     * - _since_: 2.0.0
+     */
+    punsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    punsubscribe(...args: [...patterns: string[], callback: Callback<unknown>]): Result<unknown, Context>;
+    punsubscribe(...args: [...patterns: string[]]): Result<unknown, Context>;
+    /**
+     * Close the connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    quit(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Return a random key from the keyspace
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    randomkey(callback?: Callback<string | null>): Result<string | null, Context>;
+    randomkeyBuffer(callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Enables read queries for a connection to a cluster replica node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    readonly(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Disables read queries for a connection to a cluster replica node
+     * - _group_: cluster
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    readwrite(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Rename a key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    rename(key: RedisKey, newkey: RedisKey, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Rename a key, only if the new key does not exist
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    renamenx(key: RedisKey, newkey: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * An internal command for configuring the replication stream
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    replconf(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Make the server a replica of another instance, or promote it as master.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    replicaof(host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Reset the connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    reset(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Create a key using the provided serialized value, previously obtained using DUMP.
+     * - _group_: generic
+     * - _complexity_: O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).
+     * - _since_: 2.6.0
+     */
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    restore(key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * An internal command for migrating keys in a cluster
+     * - _group_: server
+     * - _complexity_: O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).
+     * - _since_: 3.0.0
+     */
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    ["restore-asking"](key: RedisKey, ttl: number | string, serializedValue: string | Buffer | number, replace: "REPLACE", absttl: "ABSTTL", secondsToken: "IDLETIME", seconds: number | string, frequencyToken: "FREQ", frequency: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the role of the instance in the context of replication
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.8.12
+     */
+    role(callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Remove and get the last elements in a list
+     * - _group_: list
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 1.0.0
+     */
+    rpop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    rpopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    rpop(key: RedisKey, count: number | string, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    rpopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Remove the last element in a list, prepend it to another list and return it
+     * - _group_: list
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    rpoplpush(source: RedisKey, destination: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    rpoplpushBuffer(source: RedisKey, destination: RedisKey, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Append one or multiple elements to a list
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    rpush(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    rpush(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Append an element to a list, only if the list exists
+     * - _group_: list
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 2.2.0
+     */
+    rpushx(...args: [
+        key: RedisKey,
+        ...elements: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    rpushx(...args: [key: RedisKey, ...elements: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Add one or more members to a set
+     * - _group_: set
+     * - _complexity_: O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.
+     * - _since_: 1.0.0
+     */
+    sadd(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sadd(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sadd(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    sadd(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Synchronously save the dataset to disk
+     * - _group_: server
+     * - _complexity_: O(N) where N is the total number of keys in all databases
+     * - _since_: 1.0.0
+     */
+    save(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Incrementally iterate the keys space
+     * - _group_: generic
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection.
+     * - _since_: 2.8.0
+     */
+    scan(cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    scan(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    scanBuffer(cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, typeToken: "TYPE", type: string | Buffer, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Get the number of members in a set
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    scard(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the debug mode for executed scripts.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 3.2.0
+     */
+    script(subcommand: "DEBUG", yes: "YES", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "DEBUG", sync: "SYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "DEBUG", no: "NO", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Check existence of scripts in the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the number of scripts to check (so checking a single script is an O(1) operation).
+     * - _since_: 2.6.0
+     */
+    script(...args: [
+        subcommand: "EXISTS",
+        ...sha1s: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    script(...args: [subcommand: "EXISTS", ...sha1s: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Remove all the scripts from the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the number of scripts in cache
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "FLUSH", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "FLUSH", async: "ASYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    script(subcommand: "FLUSH", sync: "SYNC", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    script(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Kill the script currently in execution.
+     * - _group_: scripting
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "KILL", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Load the specified Lua script into the script cache.
+     * - _group_: scripting
+     * - _complexity_: O(N) with N being the length in bytes of the script body.
+     * - _since_: 2.6.0
+     */
+    script(subcommand: "LOAD", script: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Subtract multiple sets
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sdiff(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sdiffBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sdiff(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sdiffBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sdiff(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sdiffBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sdiff(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sdiffBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Subtract multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sdiffstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sdiffstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sdiffstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sdiffstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Change the selected database for the current connection
+     * - _group_: connection
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    select(index: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the string value of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    set(key: RedisKey, value: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, secondsToken: "EX", seconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, millisecondsToken: "PX", milliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeSecondsToken: "EXAT", unixTimeSeconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, unixTimeMillisecondsToken: "PXAT", unixTimeMilliseconds: number | string, xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", callback?: Callback<"OK">): Result<"OK", Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", nx: "NX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", callback?: Callback<"OK" | null>): Result<"OK" | null, Context>;
+    set(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", get: "GET", callback?: Callback<string | null>): Result<string | null, Context>;
+    setBuffer(key: RedisKey, value: string | Buffer | number, keepttl: "KEEPTTL", xx: "XX", get: "GET", callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Sets or clears the bit at offset in the string value stored at key
+     * - _group_: bitmap
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    setbit(key: RedisKey, offset: number | string, value: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Set the value and expiration of a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.0.0
+     */
+    setex(key: RedisKey, seconds: number | string, value: string | Buffer | number, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Set the value of a key, only if the key does not exist
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    setnx(key: RedisKey, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Overwrite part of a string at key starting at the specified offset
+     * - _group_: string
+     * - _complexity_: O(1), not counting the time taken to copy the new string in place. Usually, this string is very small so the amortized complexity is O(1). Otherwise, complexity is O(M) with M being the length of the value argument.
+     * - _since_: 2.2.0
+     */
+    setrange(key: RedisKey, offset: number | string, value: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Synchronously save the dataset to disk and then shut down the server
+     * - _group_: server
+     * - _complexity_: O(N) when saving, where N is the total number of keys in all databases when saving data, otherwise O(1)
+     * - _since_: 1.0.0
+     */
+    shutdown(callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(nosave: "NOSAVE", now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", force: "FORCE", callback?: Callback<"OK">): Result<"OK", Context>;
+    shutdown(save: "SAVE", now: "NOW", force: "FORCE", abort: "ABORT", callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Intersect multiple sets
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 1.0.0
+     */
+    sinter(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sinterBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sinter(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sinterBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sinter(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sinterBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sinter(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sinterBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Intersect multiple sets and return the cardinality of the result
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 7.0.0
+     */
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<number, Context>;
+    sintercard(...args: [numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    sintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    /**
+     * Intersect multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.
+     * - _since_: 1.0.0
+     */
+    sinterstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sinterstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sinterstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sinterstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Determine if a given value is a member of a set
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    sismember(key: RedisKey, member: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Make the server a replica of another instance, or promote it as master.
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    slaveof(host: string | Buffer, port: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Get the slow log's entries
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of entries returned
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "GET", callback?: Callback<unknown>): Result<unknown, Context>;
+    slowlog(subcommand: "GET", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    slowlog(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get the slow log's length
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "LEN", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Clear all entries from the slow log
+     * - _group_: server
+     * - _complexity_: O(N) where N is the number of entries in the slowlog
+     * - _since_: 2.2.12
+     */
+    slowlog(subcommand: "RESET", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get all the members in a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the set cardinality.
+     * - _since_: 1.0.0
+     */
+    smembers(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    smembersBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Returns the membership associated with the given elements for a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the number of elements being checked for membership
+     * - _since_: 6.2.0
+     */
+    smismember(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number[]>
+    ]): Result<number[], Context>;
+    smismember(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number[]>
+    ]): Result<number[], Context>;
+    smismember(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number[], Context>;
+    smismember(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number[], Context>;
+    /**
+     * Move a member from one set to another
+     * - _group_: set
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    smove(source: RedisKey, destination: RedisKey, member: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Sort the elements in a list, set or sorted set
+     * - _group_: generic
+     * - _complexity_: O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is O(N).
+     * - _since_: 1.0.0
+     */
+    sort(...args: [key: RedisKey, ...args: RedisValue[], callback: Callback<unknown>]): Result<unknown, Context>;
+    sort(...args: [key: RedisKey, ...args: RedisValue[]]): Result<unknown, Context>;
+    /**
+     * Sort the elements in a list, set or sorted set. Read-only variant of SORT.
+     * - _group_: generic
+     * - _complexity_: O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is O(N).
+     * - _since_: 7.0.0
+     */
+    sort_ro(key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [key: RedisKey, patternToken: "GET", ...patterns: string[]]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken: "GET",
+        ...patterns: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, asc: "ASC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(key: RedisKey, patternToken: "BY", pattern: string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, desc: "DESC", alpha: "ALPHA", callback?: Callback<unknown>): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[]
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        asc: "ASC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC"
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sort_ro(...args: [
+        key: RedisKey,
+        patternToken: "BY",
+        pattern: string,
+        offsetCountToken: "LIMIT",
+        offset: number | string,
+        count: number | string,
+        patternToken1: "GET",
+        ...pattern1s: string[],
+        desc: "DESC",
+        alpha: "ALPHA"
+    ]): Result<unknown, Context>;
+    /**
+     * Remove and return one or multiple random members from a set
+     * - _group_: set
+     * - _complexity_: Without the count argument O(1), otherwise O(N) where N is the value of the passed count.
+     * - _since_: 1.0.0
+     */
+    spop(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    spopBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    spop(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    spopBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Post a message to a shard channel
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients subscribed to the receiving shard channel.
+     * - _since_: 7.0.0
+     */
+    spublish(shardchannel: string | Buffer, message: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get one or multiple random members from a set
+     * - _group_: set
+     * - _complexity_: Without the count argument O(1), otherwise O(N) where N is the absolute value of the passed count.
+     * - _since_: 1.0.0
+     */
+    srandmember(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    srandmemberBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    srandmember(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    srandmemberBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove one or more members from a set
+     * - _group_: set
+     * - _complexity_: O(N) where N is the number of members to be removed.
+     * - _since_: 1.0.0
+     */
+    srem(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    srem(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    srem(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    srem(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Incrementally iterate Set elements
+     * - _group_: set
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    sscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    sscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    sscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Listen for messages published to the given shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of shard channels to subscribe to.
+     * - _since_: 7.0.0
+     */
+    ssubscribe(...args: [
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    ssubscribe(...args: [...shardchannels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Get the length of the value stored in a key
+     * - _group_: string
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    strlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Listen for messages published to the given channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of channels to subscribe to.
+     * - _since_: 2.0.0
+     */
+    subscribe(...args: [...channels: (string | Buffer)[], callback: Callback<unknown>]): Result<unknown, Context>;
+    subscribe(...args: [...channels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Get a substring of the string stored at a key
+     * - _group_: string
+     * - _complexity_: O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.
+     * - _since_: 1.0.0
+     */
+    substr(key: RedisKey, start: number | string, end: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Add multiple sets
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sunion(...args: [...keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sunionBuffer(...args: [...keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sunion(...args: [keys: RedisKey[], callback: Callback<string[]>]): Result<string[], Context>;
+    sunionBuffer(...args: [keys: RedisKey[], callback: Callback<Buffer[]>]): Result<Buffer[], Context>;
+    sunion(...args: [...keys: RedisKey[]]): Result<string[], Context>;
+    sunionBuffer(...args: [...keys: RedisKey[]]): Result<Buffer[], Context>;
+    sunion(...args: [keys: RedisKey[]]): Result<string[], Context>;
+    sunionBuffer(...args: [keys: RedisKey[]]): Result<Buffer[], Context>;
+    /**
+     * Add multiple sets and store the resulting set in a key
+     * - _group_: set
+     * - _complexity_: O(N) where N is the total number of elements in all given sets.
+     * - _since_: 1.0.0
+     */
+    sunionstore(...args: [
+        destination: RedisKey,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sunionstore(...args: [
+        destination: RedisKey,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    sunionstore(...args: [destination: RedisKey, ...keys: RedisKey[]]): Result<number, Context>;
+    sunionstore(...args: [destination: RedisKey, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Stop listening for messages posted to the given shard channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients already subscribed to a shard channel.
+     * - _since_: 7.0.0
+     */
+    sunsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    sunsubscribe(...args: [
+        ...shardchannels: (string | Buffer)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    sunsubscribe(...args: [...shardchannels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Swaps two Redis databases
+     * - _group_: server
+     * - _complexity_: O(N) where N is the count of clients watching or blocking on keys from both databases.
+     * - _since_: 4.0.0
+     */
+    swapdb(index1: number | string, index2: number | string, callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Internal command used for replication
+     * - _group_: server
+     * - _complexity_: undefined
+     * - _since_: 1.0.0
+     */
+    sync(callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the current server time
+     * - _group_: server
+     * - _complexity_: O(1)
+     * - _since_: 2.6.0
+     */
+    time(callback?: Callback<number[]>): Result<number[], Context>;
+    /**
+     * Alters the last access time of a key(s). Returns the number of existing keys specified.
+     * - _group_: generic
+     * - _complexity_: O(N) where N is the number of keys that will be touched.
+     * - _since_: 3.2.1
+     */
+    touch(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    touch(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    touch(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    touch(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Get the time to live for a key in seconds
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    ttl(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Determine the type stored at key
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 1.0.0
+     */
+    type(key: RedisKey, callback?: Callback<string>): Result<string, Context>;
+    /**
+     * Delete a key asynchronously in another thread. Otherwise it is just as DEL, but non blocking.
+     * - _group_: generic
+     * - _complexity_: O(1) for each key removed regardless of its size. Then the command does O(N) work in a different thread in order to reclaim memory, where N is the number of allocations the deleted objects where composed of.
+     * - _since_: 4.0.0
+     */
+    unlink(...args: [...keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    unlink(...args: [keys: RedisKey[], callback: Callback<number>]): Result<number, Context>;
+    unlink(...args: [...keys: RedisKey[]]): Result<number, Context>;
+    unlink(...args: [keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Stop listening for messages posted to the given channels
+     * - _group_: pubsub
+     * - _complexity_: O(N) where N is the number of clients already subscribed to a channel.
+     * - _since_: 2.0.0
+     */
+    unsubscribe(callback?: Callback<unknown>): Result<unknown, Context>;
+    unsubscribe(...args: [...channels: (string | Buffer)[], callback: Callback<unknown>]): Result<unknown, Context>;
+    unsubscribe(...args: [...channels: (string | Buffer)[]]): Result<unknown, Context>;
+    /**
+     * Forget about all watched keys
+     * - _group_: transactions
+     * - _complexity_: O(1)
+     * - _since_: 2.2.0
+     */
+    unwatch(callback?: Callback<"OK">): Result<"OK", Context>;
+    /**
+     * Add one or more elements to a vector set, or update its vector if it already exists
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vadd(...args: [key: RedisKey, ...args: (RedisValue)[], callback: Callback<number>]): Result<number, Context>;
+    vadd(...args: [key: RedisKey, ...args: (RedisValue)[]]): Result<number, Context>;
+    /**
+     * Return the number of elements in a vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vcard(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the dimension of vectors in the vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vdim(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the vector associated with an element
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vemb(key: RedisKey, element: string | Buffer | number, callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    vembBuffer(key: RedisKey, element: string | Buffer | number, callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    vemb(key: RedisKey, element: string | Buffer | number, raw: 'RAW', callback?: Callback<string[] | null>): Result<string[] | null, Context>;
+    vembBuffer(key: RedisKey, element: string | Buffer | number, raw: 'RAW', callback?: Callback<Buffer[] | null>): Result<Buffer[] | null, Context>;
+    /**
+     * Retrieve the JSON attributes of elements
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vgetattr(key: RedisKey, element: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    vgetattrBuffer(key: RedisKey, element: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Return information about a vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vinfo(key: RedisKey, callback?: Callback<(string | number)[] | null>): Result<(string | number)[] | null, Context>;
+    vinfoBuffer(key: RedisKey, callback?: Callback<(Buffer | number)[] | null>): Result<(Buffer | number)[] | null, Context>;
+    /**
+     * Check if an element exists in a vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vismember(key: RedisKey, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return the neighbors of an element at each layer in the HNSW graph
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vlinks(key: RedisKey, element: string | Buffer | number, callback?: Callback<string[][] | null>): Result<string[][] | null, Context>;
+    vlinksBuffer(key: RedisKey, element: string | Buffer | number, callback?: Callback<Buffer[][] | null>): Result<Buffer[][] | null, Context>;
+    vlinks(key: RedisKey, element: string | Buffer | number, withscores: 'WITHSCORES', callback?: Callback<string[][] | null>): Result<string[][] | null, Context>;
+    vlinksBuffer(key: RedisKey, element: string | Buffer | number, withscores: 'WITHSCORES', callback?: Callback<Buffer[][] | null>): Result<Buffer[][] | null, Context>;
+    /**
+     * Return one or multiple random members from a vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vrandmember(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    vrandmemberBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    vrandmember(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    vrandmemberBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return vector set elements in a lex range
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.4.0
+     */
+    vrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    vrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    vrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    vrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove an element from a vector set
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vrem(key: RedisKey, element: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Associate or remove the JSON attributes of elements
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vsetattr(key: RedisKey, element: string | Buffer | number, json: string | Buffer, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return elements by vector similarity
+     * - _group_: module
+     * - _complexity_: undefined
+     * - _since_: 8.0.0
+     */
+    vsim(...args: [key: RedisKey, ...args: (RedisValue)[], callback: Callback<(string | null)[]>]): Result<(string | null)[], Context>;
+    vsimBuffer(...args: [key: RedisKey, ...args: (RedisValue)[], callback: Callback<(Buffer | null)[]>]): Result<(Buffer | null)[], Context>;
+    vsim(...args: [key: RedisKey, ...args: (RedisValue)[]]): Result<(string | null)[], Context>;
+    vsimBuffer(...args: [key: RedisKey, ...args: (RedisValue)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Wait for the synchronous replication of all the write commands sent in the context of the current connection
+     * - _group_: generic
+     * - _complexity_: O(1)
+     * - _since_: 3.0.0
+     */
+    wait(numreplicas: number | string, timeout: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Watch the given keys to determine execution of the MULTI/EXEC block
+     * - _group_: transactions
+     * - _complexity_: O(1) for every key.
+     * - _since_: 2.2.0
+     */
+    watch(...args: [...keys: RedisKey[], callback: Callback<"OK">]): Result<"OK", Context>;
+    watch(...args: [keys: RedisKey[], callback: Callback<"OK">]): Result<"OK", Context>;
+    watch(...args: [...keys: RedisKey[]]): Result<"OK", Context>;
+    watch(...args: [keys: RedisKey[]]): Result<"OK", Context>;
+    /**
+     * Marks a pending message as correctly processed, effectively removing it from the pending entries list of the consumer group. Return value of the command is the number of messages successfully acknowledged, that is, the IDs we were actually able to resolve in the PEL.
+     * - _group_: stream
+     * - _complexity_: O(1) for each message ID processed.
+     * - _since_: 5.0.0
+     */
+    xack(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    xack(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    /**
+     * Appends a new entry to a stream
+     * - _group_: stream
+     * - _complexity_: O(1) when adding a new entry, O(N) when trimming where N being the number of entries evicted.
+     * - _since_: 5.0.0
+     */
+    xadd(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    xaddBuffer(...args: [
+        key: RedisKey,
+        ...args: RedisValue[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    xadd(...args: [key: RedisKey, ...args: RedisValue[]]): Result<string | null, Context>;
+    xaddBuffer(...args: [key: RedisKey, ...args: RedisValue[]]): Result<Buffer | null, Context>;
+    /**
+     * Changes (or acquires) ownership of messages in a consumer group, as if the messages were delivered to the specified consumer.
+     * - _group_: stream
+     * - _complexity_: O(1) if COUNT is small.
+     * - _since_: 6.2.0
+     */
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, justid: "JUSTID", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xautoclaim(key: RedisKey, group: string | Buffer, consumer: string | Buffer, minIdleTime: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, justid: "JUSTID", callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Changes (or acquires) ownership of a message in a consumer group, as if the message was delivered to the specified consumer.
+     * - _group_: stream
+     * - _complexity_: O(log N) with N being the number of messages in the PEL of the consumer group.
+     * - _since_: 5.0.0
+     */
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE"
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID",
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xclaim(...args: [
+        key: RedisKey,
+        group: string | Buffer,
+        consumer: string | Buffer,
+        minIdleTime: string | Buffer | number,
+        ...ids: (string | Buffer | number)[],
+        msToken: "IDLE",
+        ms: number | string,
+        unixTimeMillisecondsToken: "TIME",
+        unixTimeMilliseconds: number | string,
+        countToken: "RETRYCOUNT",
+        count: number | string,
+        force: "FORCE",
+        justid: "JUSTID"
+    ]): Result<unknown[], Context>;
+    /**
+     * Removes the specified entries from the stream. Returns the number of items actually deleted, that may be different from the number of IDs passed in case certain IDs do not exist.
+     * - _group_: stream
+     * - _complexity_: O(1) for each single item to delete in the stream, regardless of the stream size.
+     * - _since_: 5.0.0
+     */
+    xdel(...args: [
+        key: RedisKey,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    xdel(...args: [key: RedisKey, ...ids: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Deletes one or multiple entries from the stream.
+     * - _group_: stream
+     * - _complexity_: O(1) for each single item to delete in the stream, regardless of the stream size.
+     * - _since_: 8.2.0
+     */
+    xdelex(...args: [
+        key: RedisKey,
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        keepref: "KEEPREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        keepref: "KEEPREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        delref: "DELREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        delref: "DELREF",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        acked: "ACKED",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[],
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    xdelex(...args: [
+        key: RedisKey,
+        acked: "ACKED",
+        idsToken: "IDS",
+        numids: number | string,
+        ...ids: (string | Buffer | number)[]
+    ]): Result<unknown, Context>;
+    /**
+     * Create a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, mkstream: "MKSTREAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, mkstream: "MKSTREAM", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", mkstream: "MKSTREAM", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "CREATE", key: RedisKey, groupname: string | Buffer, newId: "$", mkstream: "MKSTREAM", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Create a consumer in a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 6.2.0
+     */
+    xgroup(subcommand: "CREATECONSUMER", key: RedisKey, groupname: string | Buffer, consumername: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Delete a consumer from a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "DELCONSUMER", key: RedisKey, groupname: string | Buffer, consumername: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Destroy a consumer group.
+     * - _group_: stream
+     * - _complexity_: O(N) where N is the number of entries in the group's pending entries list (PEL).
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "DESTROY", key: RedisKey, groupname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Set a consumer group to an arbitrary last delivered ID value.
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, id: string | Buffer | number, entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, newId: "$", callback?: Callback<unknown>): Result<unknown, Context>;
+    xgroup(subcommand: "SETID", key: RedisKey, groupname: string | Buffer, newId: "$", entriesReadToken: "ENTRIESREAD", entriesRead: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the consumers in a consumer group
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "CONSUMERS", key: RedisKey, groupname: string | Buffer, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * List the consumer groups of a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "GROUPS", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Show helpful text about the different subcommands
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "HELP", callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Get information about a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xinfo(subcommand: "STREAM", key: RedisKey, callback?: Callback<unknown>): Result<unknown, Context>;
+    xinfo(subcommand: "STREAM", key: RedisKey, fullToken: "FULL", callback?: Callback<unknown>): Result<unknown, Context>;
+    xinfo(subcommand: "STREAM", key: RedisKey, fullToken: "FULL", countToken: "COUNT", count: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Return the number of entries in a stream
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xlen(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Releases claimed messages back to the group's PEL without acknowledging them, making them available for re-delivery.
+     * - _group_: stream
+     * - _complexity_: O(1) for each message ID processed.
+     * - _since_: 8.8.0
+     */
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[]]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE']): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, silent: 'SILENT', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE']): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[]]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE']): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fail: 'FAIL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE']): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[]]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], force: 'FORCE']): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE', callback: Callback<number>]): Result<number, Context>;
+    xnack(...args: [key: RedisKey, group: string | Buffer, fatal: 'FATAL', idsToken: 'IDS', numids: number | string, ...ids: (string | Buffer | number)[], countToken: 'RETRYCOUNT', count: number | string, force: 'FORCE']): Result<number, Context>;
+    /**
+     * Return information and entries from a stream consumer group pending entries list, that are messages fetched but never acknowledged.
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements returned, so asking for a small fixed number of entries per call is O(1). O(M), where M is the total number of entries scanned when used with the IDLE filter. When the command returns just the summary and the list of consumers is small, it runs in O(1) time; otherwise, an additional O(N) time for iterating every consumer.
+     * - _since_: 5.0.0
+     */
+    xpending(key: RedisKey, group: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, start: string | Buffer | number, end: string | Buffer | number, count: number | string, consumer: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, minIdleTimeToken: "IDLE", minIdleTime: number | string, start: string | Buffer | number, end: string | Buffer | number, count: number | string, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    xpending(key: RedisKey, group: string | Buffer, minIdleTimeToken: "IDLE", minIdleTime: number | string, start: string | Buffer | number, end: string | Buffer | number, count: number | string, consumer: string | Buffer, callback?: Callback<unknown[]>): Result<unknown[], Context>;
+    /**
+     * Return a range of elements in a stream, with IDs matching the specified IDs interval
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements being returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).
+     * - _since_: 5.0.0
+     */
+    xrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    xrange(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrangeBuffer(key: RedisKey, start: string | Buffer | number, end: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    /**
+     * Return never seen elements in multiple streams, with IDs greater than the ones reported by the caller for each stream. Can block.
+     * - _group_: stream
+     * - _complexity_: For each stream mentioned: O(N) with N being the number of elements being returned, it means that XREAD-ing with a fixed COUNT is O(1). Note that when the BLOCK option is used, XADD will pay O(M) time in order to serve the M clients blocked on the stream getting new data.
+     * - _since_: 5.0.0
+     */
+    xread(...args: [
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [streamsToken: "STREAMS", ...args: RedisValue[]]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [streamsToken: "STREAMS", ...args: RedisValue[]]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: string,
+            items: [id: string, fields: string[]][]
+        ][] | null>
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<[
+            key: Buffer,
+            items: [id: Buffer, fields: Buffer[]][]
+        ][] | null>
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    xread(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: string,
+        items: [id: string, fields: string[]][]
+    ][] | null, Context>;
+    xreadBuffer(...args: [
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<[
+        key: Buffer,
+        items: [id: Buffer, fields: Buffer[]][]
+    ][] | null, Context>;
+    /**
+     * Return new entries from a stream using a consumer group, or access the history of the pending entries for a given consumer. Can block.
+     * - _group_: stream
+     * - _complexity_: For each stream mentioned: O(M) with M being the number of elements returned. If M is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1). On the other side when XREADGROUP blocks, XADD will pay the O(N) time in order to serve the N clients blocked on the stream getting new data.
+     * - _since_: 5.0.0
+     */
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[],
+        callback: Callback<unknown[]>
+    ]): Result<unknown[], Context>;
+    xreadgroup(...args: [
+        groupConsumerToken: "GROUP",
+        group: string | Buffer,
+        consumer: string | Buffer,
+        countToken: "COUNT",
+        count: number | string,
+        millisecondsToken: "BLOCK",
+        milliseconds: number | string,
+        noack: "NOACK",
+        streamsToken: "STREAMS",
+        ...args: RedisValue[]
+    ]): Result<unknown[], Context>;
+    /**
+     * Return a range of elements in a stream, with IDs matching the specified IDs interval, in reverse order (from greater to smaller IDs) compared to XRANGE
+     * - _group_: stream
+     * - _complexity_: O(N) with N being the number of elements returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).
+     * - _since_: 5.0.0
+     */
+    xrevrange(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrevrangeBuffer(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    xrevrange(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: string, fields: string[]][]>): Result<[id: string, fields: string[]][], Context>;
+    xrevrangeBuffer(key: RedisKey, end: string | Buffer | number, start: string | Buffer | number, countToken: "COUNT", count: number | string, callback?: Callback<[id: Buffer, fields: Buffer[]][]>): Result<[id: Buffer, fields: Buffer[]][], Context>;
+    /**
+     * An internal command for replicating stream values
+     * - _group_: stream
+     * - _complexity_: O(1)
+     * - _since_: 5.0.0
+     */
+    xsetid(key: RedisKey, lastId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, maxDeletedEntryIdToken: "MAXDELETEDID", maxDeletedEntryId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, entriesAddedToken: "ENTRIESADDED", entriesAdded: number | string, callback?: Callback<unknown>): Result<unknown, Context>;
+    xsetid(key: RedisKey, lastId: string | Buffer | number, entriesAddedToken: "ENTRIESADDED", entriesAdded: number | string, maxDeletedEntryIdToken: "MAXDELETEDID", maxDeletedEntryId: string | Buffer | number, callback?: Callback<unknown>): Result<unknown, Context>;
+    /**
+     * Deletes messages from the beginning of a stream.
+     * - _group_: stream
+     * - _complexity_: O(N), with N being the number of evicted entries. Constant times are very small however, since entries are organized in macro nodes containing multiple entries that can be released with a single deallocation.
+     * - _since_: 5.0.0
+     */
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, maxlen: "MAXLEN", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", equal: "=", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, keepref: "KEEPREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, delref: "DELREF", callback?: Callback<number>): Result<number, Context>;
+    xtrim(key: RedisKey, minid: "MINID", approximately: "~", threshold: string | Buffer | number, countToken: "LIMIT", count: number | string, acked: "ACKED", callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Add one or more members to a sorted set, or update its score if it already exists
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) for each item added, where N is the number of elements in the sorted set.
+     * - _since_: 1.2.0
+     */
+    zadd(...args: [
+        key: RedisKey,
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [key: RedisKey, ...scoreMembers: (string | Buffer | number)[]]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string>
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer>
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        nx: "NX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        gt: "GT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<number, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<string | null>
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[],
+        callback: Callback<Buffer | null>
+    ]): Result<Buffer | null, Context>;
+    zadd(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<string | null, Context>;
+    zaddBuffer(...args: [
+        key: RedisKey,
+        xx: "XX",
+        lt: "LT",
+        ch: "CH",
+        incr: "INCR",
+        ...scoreMembers: (string | Buffer | number)[]
+    ]): Result<Buffer | null, Context>;
+    /**
+     * Get the number of members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    zcard(key: RedisKey, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Count the members in a sorted set with scores within the given values
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 2.0.0
+     */
+    zcount(key: RedisKey, min: number | string, max: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Subtract multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.
+     * - _since_: 6.2.0
+     */
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zdiffBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zdiff(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zdiffBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zdiff(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zdiffBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Subtract multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.
+     * - _since_: 6.2.0
+     */
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zdiffstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zdiffstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    /**
+     * Increment the score of a member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) where N is the number of elements in the sorted set.
+     * - _since_: 1.2.0
+     */
+    zincrby(key: RedisKey, increment: number | string, member: string | Buffer | number, callback?: Callback<string>): Result<string, Context>;
+    zincrbyBuffer(key: RedisKey, increment: number | string, member: string | Buffer | number, callback?: Callback<Buffer>): Result<Buffer, Context>;
+    /**
+     * Intersect multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.
+     * - _since_: 6.2.0
+     */
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<string[], Context>;
+    zinterBuffer(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zinter(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zinterBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Intersect multiple sorted sets and return the cardinality of the result
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K) worst case with N being the smallest input sorted set, K being the number of input sorted sets.
+     * - _since_: 7.0.0
+     */
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<number, Context>;
+    zintercard(...args: [numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string,
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    zintercard(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        limitToken: "LIMIT",
+        limit: number | string
+    ]): Result<number, Context>;
+    /**
+     * Intersect multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.
+     * - _since_: 2.0.0
+     */
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zinterstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zinterstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+    /**
+     * Count the number of members in a sorted set between a given lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)) with N being the number of elements in the sorted set.
+     * - _since_: 2.8.9
+     */
+    zlexcount(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove and return members with scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(K) + O(N*log(M)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 7.0.0
+     */
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, ...keys: RedisKey[], min: "MIN"]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, keys: RedisKey[], min: "MIN"]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        min: "MIN",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, ...keys: RedisKey[], max: "MAX"]): Result<unknown, Context>;
+    zmpop(...args: [numkeys: number | string, keys: RedisKey[], max: "MAX"]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string,
+        callback: Callback<unknown>
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    zmpop(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        max: "MAX",
+        countToken: "COUNT",
+        count: number | string
+    ]): Result<unknown, Context>;
+    /**
+     * Get the score associated with the given members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(N) where N is the number of members being requested.
+     * - _since_: 6.2.0
+     */
+    zmscore(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<(string | null)[]>
+    ]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<(Buffer | null)[]>
+    ]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<(Buffer | null)[], Context>;
+    zmscore(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<(string | null)[], Context>;
+    zmscoreBuffer(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<(Buffer | null)[], Context>;
+    /**
+     * Remove and return members with the highest scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 5.0.0
+     */
+    zpopmax(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopmaxBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zpopmax(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopmaxBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Remove and return members with the lowest scores in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.
+     * - _since_: 5.0.0
+     */
+    zpopmin(key: RedisKey, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopminBuffer(key: RedisKey, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zpopmin(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zpopminBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Get one or multiple random elements from a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(N) where N is the number of elements returned
+     * - _since_: 6.2.0
+     */
+    zrandmember(key: RedisKey, callback?: Callback<string | null>): Result<string | null, Context>;
+    zrandmemberBuffer(key: RedisKey, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    zrandmember(key: RedisKey, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrandmemberBuffer(key: RedisKey, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrandmember(key: RedisKey, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrandmemberBuffer(key: RedisKey, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.
+     * - _since_: 1.2.0
+     */
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrange(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangeBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.8.9
+     */
+    zrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebylexBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebylexBuffer(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by score
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 1.0.5
+     */
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrangebyscore(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrangebyscoreBuffer(key: RedisKey, min: number | string, max: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Store a range of members from sorted set into another key
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements stored into the destination key.
+     * - _since_: 6.2.0
+     */
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, byscore: "BYSCORE", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", callback?: Callback<number>): Result<number, Context>;
+    zrangestore(dst: RedisKey, src: RedisKey, min: string | Buffer | number, max: string | Buffer | number, bylex: "BYLEX", rev: "REV", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Determine the index of a member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N))
+     * - _since_: 2.0.0
+     */
+    zrank(key: RedisKey, member: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Remove one or more members from a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.
+     * - _since_: 1.2.0
+     */
+    zrem(...args: [
+        key: RedisKey,
+        ...members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zrem(...args: [
+        key: RedisKey,
+        members: (string | Buffer | number)[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zrem(...args: [key: RedisKey, ...members: (string | Buffer | number)[]]): Result<number, Context>;
+    zrem(...args: [key: RedisKey, members: (string | Buffer | number)[]]): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set between the given lexicographical range
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 2.8.9
+     */
+    zremrangebylex(key: RedisKey, min: string | Buffer | number, max: string | Buffer | number, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set within the given indexes
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 2.0.0
+     */
+    zremrangebyrank(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Remove all members in a sorted set within the given scores
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.
+     * - _since_: 1.2.0
+     */
+    zremrangebyscore(key: RedisKey, min: number | string, max: number | string, callback?: Callback<number>): Result<number, Context>;
+    /**
+     * Return a range of members in a sorted set, by index, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.
+     * - _since_: 1.2.0
+     */
+    zrevrange(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangeBuffer(key: RedisKey, start: number | string, stop: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrange(key: RedisKey, start: number | string, stop: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangeBuffer(key: RedisKey, start: number | string, stop: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.8.9
+     */
+    zrevrangebylex(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebylexBuffer(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebylex(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebylexBuffer(key: RedisKey, max: string | Buffer | number, min: string | Buffer | number, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Return a range of members in a sorted set, by score, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).
+     * - _since_: 2.2.0
+     */
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    zrevrangebyscore(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<string[]>): Result<string[], Context>;
+    zrevrangebyscoreBuffer(key: RedisKey, max: number | string, min: number | string, withscores: "WITHSCORES", offsetCountToken: "LIMIT", offset: number | string, count: number | string, callback?: Callback<Buffer[]>): Result<Buffer[], Context>;
+    /**
+     * Determine the index of a member in a sorted set, with scores ordered from high to low
+     * - _group_: sorted-set
+     * - _complexity_: O(log(N))
+     * - _since_: 2.0.0
+     */
+    zrevrank(key: RedisKey, member: string | Buffer | number, callback?: Callback<number | null>): Result<number | null, Context>;
+    /**
+     * Incrementally iterate sorted sets elements and associated scores
+     * - _group_: sorted-set
+     * - _complexity_: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
+     * - _since_: 2.8.0
+     */
+    zscan(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    zscan(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: string, elements: string[]]>): Result<[cursor: string, elements: string[]], Context>;
+    zscanBuffer(key: RedisKey, cursor: number | string, patternToken: "MATCH", pattern: string, countToken: "COUNT", count: number | string, callback?: Callback<[cursor: Buffer, elements: Buffer[]]>): Result<[cursor: Buffer, elements: Buffer[]], Context>;
+    /**
+     * Get the score associated with the given member in a sorted set
+     * - _group_: sorted-set
+     * - _complexity_: O(1)
+     * - _since_: 1.2.0
+     */
+    zscore(key: RedisKey, member: string | Buffer | number, callback?: Callback<string | null>): Result<string | null, Context>;
+    zscoreBuffer(key: RedisKey, member: string | Buffer | number, callback?: Callback<Buffer | null>): Result<Buffer | null, Context>;
+    /**
+     * Add multiple sorted sets
+     * - _group_: sorted-set
+     * - _complexity_: O(N)+O(M*log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.
+     * - _since_: 6.2.0
+     */
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, ...keys: RedisKey[]]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, keys: RedisKey[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, keys: RedisKey[]]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<string[], Context>;
+    zunionBuffer(...args: [numkeys: number | string, ...args: RedisValue[]]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<string[]>
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES",
+        callback: Callback<Buffer[]>
+    ]): Result<Buffer[], Context>;
+    zunion(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<string[], Context>;
+    zunionBuffer(...args: [
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        withscores: "WITHSCORES"
+    ]): Result<Buffer[], Context>;
+    /**
+     * Add multiple sorted sets and store the resulting sorted set in a new key
+     * - _group_: sorted-set
+     * - _complexity_: O(N)+O(M log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.
+     * - _since_: 2.0.0
+     */
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[]
+    ]): Result<number, Context>;
+    zunionstore(...args: [destination: RedisKey, numkeys: number | string, keys: RedisKey[]]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        keys: RedisKey[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[]
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        sum: "SUM"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        min: "MIN"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        max: "MAX"
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT",
+        callback: Callback<number>
+    ]): Result<number, Context>;
+    zunionstore(...args: [
+        destination: RedisKey,
+        numkeys: number | string,
+        ...args: RedisValue[],
+        aggregate: "AGGREGATE",
+        count: "COUNT"
+    ]): Result<number, Context>;
+}
+export default RedisCommander;
diff --git a/node_modules/ioredis/built/utils/RedisCommander.js b/node_modules/ioredis/built/utils/RedisCommander.js
new file mode 100644
index 0000000..c7431fc
--- /dev/null
+++ b/node_modules/ioredis/built/utils/RedisCommander.js
@@ -0,0 +1,7 @@
+"use strict";
+/**
+ * This file is generated by @ioredis/interface-generator.
+ * Don't edit it manually. Instead, run `npm run generate` to update
+ * this file.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/ioredis/built/utils/applyMixin.d.ts b/node_modules/ioredis/built/utils/applyMixin.d.ts
new file mode 100644
index 0000000..cf5cdb4
--- /dev/null
+++ b/node_modules/ioredis/built/utils/applyMixin.d.ts
@@ -0,0 +1,3 @@
+declare type Constructor = new (...args: any[]) => void;
+declare function applyMixin(derivedConstructor: Constructor, mixinConstructor: Constructor): void;
+export default applyMixin;
diff --git a/node_modules/ioredis/built/utils/applyMixin.js b/node_modules/ioredis/built/utils/applyMixin.js
new file mode 100644
index 0000000..0b2d5b9
--- /dev/null
+++ b/node_modules/ioredis/built/utils/applyMixin.js
@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function applyMixin(derivedConstructor, mixinConstructor) {
+    Object.getOwnPropertyNames(mixinConstructor.prototype).forEach((name) => {
+        Object.defineProperty(derivedConstructor.prototype, name, Object.getOwnPropertyDescriptor(mixinConstructor.prototype, name));
+    });
+}
+exports.default = applyMixin;
diff --git a/node_modules/ioredis/built/utils/argumentParsers.d.ts b/node_modules/ioredis/built/utils/argumentParsers.d.ts
new file mode 100644
index 0000000..c451e14
--- /dev/null
+++ b/node_modules/ioredis/built/utils/argumentParsers.d.ts
@@ -0,0 +1,14 @@
+import { CommandParameter } from "../types";
+/**
+ * Parses a command parameter as seconds and converts to milliseconds.
+ * @param arg - The command parameter representing seconds
+ * @returns The value in milliseconds, 0 if value is <= 0, or undefined if parsing fails
+ */
+export declare const parseSecondsArgument: (arg: CommandParameter | undefined) => number | undefined;
+/**
+ * Parses the BLOCK option from Redis command arguments (e.g., XREAD, XREADGROUP).
+ * @param args - Array of command parameters to search for the BLOCK option
+ * @returns The block duration in milliseconds, 0 if duration is <= 0,
+ *          null if BLOCK option is not found, or undefined if BLOCK is found but duration is invalid
+ */
+export declare const parseBlockOption: (args: CommandParameter[]) => number | null | undefined;
diff --git a/node_modules/ioredis/built/utils/argumentParsers.js b/node_modules/ioredis/built/utils/argumentParsers.js
new file mode 100644
index 0000000..7a80605
--- /dev/null
+++ b/node_modules/ioredis/built/utils/argumentParsers.js
@@ -0,0 +1,74 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.parseBlockOption = exports.parseSecondsArgument = void 0;
+/**
+ * Parses a command parameter to a number.
+ * @param arg - The command parameter to parse (number, string, or Buffer)
+ * @returns The parsed number, or undefined if parsing fails or arg is undefined
+ */
+const parseNumberArgument = (arg) => {
+    if (typeof arg === "number") {
+        return arg;
+    }
+    if (Buffer.isBuffer(arg)) {
+        return parseNumberArgument(arg.toString());
+    }
+    if (typeof arg === "string") {
+        const value = Number(arg);
+        return Number.isFinite(value) ? value : undefined;
+    }
+    return undefined;
+};
+/**
+ * Parses a command parameter to a string.
+ * @param arg - The command parameter to parse (string or Buffer)
+ * @returns The parsed string, or undefined if arg is not a string/Buffer or is undefined
+ */
+const parseStringArgument = (arg) => {
+    if (typeof arg === "string") {
+        return arg;
+    }
+    if (Buffer.isBuffer(arg)) {
+        return arg.toString();
+    }
+    return undefined;
+};
+/**
+ * Parses a command parameter as seconds and converts to milliseconds.
+ * @param arg - The command parameter representing seconds
+ * @returns The value in milliseconds, 0 if value is <= 0, or undefined if parsing fails
+ */
+const parseSecondsArgument = (arg) => {
+    const value = parseNumberArgument(arg);
+    if (value === undefined) {
+        return undefined;
+    }
+    if (value <= 0) {
+        return 0;
+    }
+    return value * 1000;
+};
+exports.parseSecondsArgument = parseSecondsArgument;
+/**
+ * Parses the BLOCK option from Redis command arguments (e.g., XREAD, XREADGROUP).
+ * @param args - Array of command parameters to search for the BLOCK option
+ * @returns The block duration in milliseconds, 0 if duration is <= 0,
+ *          null if BLOCK option is not found, or undefined if BLOCK is found but duration is invalid
+ */
+const parseBlockOption = (args) => {
+    for (let i = 0; i < args.length; i++) {
+        const token = parseStringArgument(args[i]);
+        if (token && token.toLowerCase() === "block") {
+            const duration = parseNumberArgument(args[i + 1]);
+            if (duration === undefined) {
+                return undefined;
+            }
+            if (duration <= 0) {
+                return 0;
+            }
+            return duration;
+        }
+    }
+    return null;
+};
+exports.parseBlockOption = parseBlockOption;
diff --git a/node_modules/ioredis/built/utils/debug.d.ts b/node_modules/ioredis/built/utils/debug.d.ts
new file mode 100644
index 0000000..e73b378
--- /dev/null
+++ b/node_modules/ioredis/built/utils/debug.d.ts
@@ -0,0 +1,16 @@
+declare const MAX_ARGUMENT_LENGTH = 200;
+/**
+ * helper function that tried to get a string value for
+ * arbitrary "debug" arg
+ */
+declare function getStringValue(v: any): string | void;
+/**
+ * helper function that redacts a string representation of a "debug" arg
+ */
+declare function genRedactedString(str: string, maxLen: number): string;
+/**
+ * a wrapper for the `debug` module, used to generate
+ * "debug functions" that trim the values in their output
+ */
+export default function genDebugFunction(namespace: string): (...args: any[]) => void;
+export { MAX_ARGUMENT_LENGTH, getStringValue, genRedactedString };
diff --git a/node_modules/ioredis/built/utils/debug.js b/node_modules/ioredis/built/utils/debug.js
new file mode 100644
index 0000000..6613511
--- /dev/null
+++ b/node_modules/ioredis/built/utils/debug.js
@@ -0,0 +1,95 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.genRedactedString = exports.getStringValue = exports.MAX_ARGUMENT_LENGTH = void 0;
+const debug_1 = require("debug");
+const MAX_ARGUMENT_LENGTH = 200;
+exports.MAX_ARGUMENT_LENGTH = MAX_ARGUMENT_LENGTH;
+const NAMESPACE_PREFIX = "ioredis";
+/**
+ * helper function that tried to get a string value for
+ * arbitrary "debug" arg
+ */
+function getStringValue(v) {
+    if (v === null) {
+        return;
+    }
+    switch (typeof v) {
+        case "boolean":
+            return;
+        case "number":
+            return;
+        case "object":
+            if (Buffer.isBuffer(v)) {
+                return v.toString("hex");
+            }
+            if (Array.isArray(v)) {
+                return v.join(",");
+            }
+            try {
+                return JSON.stringify(v);
+            }
+            catch (e) {
+                return;
+            }
+        case "string":
+            return v;
+    }
+}
+exports.getStringValue = getStringValue;
+/**
+ * helper function that redacts a string representation of a "debug" arg
+ */
+function genRedactedString(str, maxLen) {
+    const { length } = str;
+    return length <= maxLen
+        ? str
+        : str.slice(0, maxLen) + ' ... <REDACTED full-length="' + length + '">';
+}
+exports.genRedactedString = genRedactedString;
+/**
+ * a wrapper for the `debug` module, used to generate
+ * "debug functions" that trim the values in their output
+ */
+function genDebugFunction(namespace) {
+    const fn = (0, debug_1.default)(`${NAMESPACE_PREFIX}:${namespace}`);
+    function wrappedDebug(...args) {
+        if (!fn.enabled) {
+            return; // no-op
+        }
+        // we skip the first arg because that is the message
+        for (let i = 1; i < args.length; i++) {
+            const str = getStringValue(args[i]);
+            if (typeof str === "string" && str.length > MAX_ARGUMENT_LENGTH) {
+                args[i] = genRedactedString(str, MAX_ARGUMENT_LENGTH);
+            }
+        }
+        return fn.apply(null, args);
+    }
+    Object.defineProperties(wrappedDebug, {
+        namespace: {
+            get() {
+                return fn.namespace;
+            },
+        },
+        enabled: {
+            get() {
+                return fn.enabled;
+            },
+        },
+        destroy: {
+            get() {
+                return fn.destroy;
+            },
+        },
+        log: {
+            get() {
+                return fn.log;
+            },
+            set(l) {
+                fn.log = l;
+            },
+        },
+    });
+    return wrappedDebug;
+}
+exports.default = genDebugFunction;
diff --git a/node_modules/ioredis/built/utils/defaults.d.ts b/node_modules/ioredis/built/utils/defaults.d.ts
new file mode 100644
index 0000000..347dca2
--- /dev/null
+++ b/node_modules/ioredis/built/utils/defaults.d.ts
@@ -0,0 +1,6 @@
+export declare function defaults<T, S>(object: T, source: S): NonNullable<S & T>;
+export declare function defaults<T, S1, S2>(object: T, source1: S1, source2: S2): NonNullable<S2 & S1 & T>;
+export declare function defaults<T, S1, S2, S3>(object: T, source1: S1, source2: S2, source3: S3): NonNullable<S3 & S2 & S1 & T>;
+export declare function defaults<T, S1, S2, S3, S4>(object: T, source1: S1, source2: S2, source3: S3, source4: S4): NonNullable<S4 & S3 & S2 & S1 & T>;
+export declare function defaults<T>(object: T): NonNullable<T>;
+export declare function defaults(object: any, ...sources: any[]): any;
diff --git a/node_modules/ioredis/built/utils/defaults.js b/node_modules/ioredis/built/utils/defaults.js
new file mode 100644
index 0000000..1c9aa7c
--- /dev/null
+++ b/node_modules/ioredis/built/utils/defaults.js
@@ -0,0 +1,102 @@
+"use strict";
+/*
+ * Derived from `src/compat/object/defaults.ts` in es-toolkit
+ * (https://github.com/toss/es-toolkit).
+ *
+ * Copyright (c) 2024 Viva Republica, Inc
+ * Copyright OpenJS Foundation and other contributors
+ *
+ * Parts of the compatibility layer in `es-toolkit/compat` are derived from
+ * Lodash (https://github.com/lodash/lodash) by the OpenJS Foundation
+ * (https://openjsf.org/) and Underscore.js by Jeremy Ashkenas, DocumentCloud
+ * and Investigative Reporters & Editors (http://underscorejs.org/).
+ *
+ * This file has been modified from the original source to create a standalone
+ * adaptation.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaults = void 0;
+const IS_UNSIGNED_INTEGER = /^(?:0|[1-9]\d*)$/;
+function isNil(value) {
+    return value == null;
+}
+function eq(value, other) {
+    return value === other || (Number.isNaN(value) && Number.isNaN(other));
+}
+function isLength(value) {
+    return Number.isSafeInteger(value) && value >= 0;
+}
+function isArrayLike(value) {
+    return (value != null &&
+        typeof value !== "function" &&
+        isLength(value.length));
+}
+function isObject(value) {
+    return (value !== null && (typeof value === "object" || typeof value === "function"));
+}
+function isIndex(value, length = Number.MAX_SAFE_INTEGER) {
+    switch (typeof value) {
+        case "number":
+            return Number.isInteger(value) && value >= 0 && value < length;
+        case "symbol":
+            return false;
+        case "string":
+            return IS_UNSIGNED_INTEGER.test(value);
+    }
+}
+function isIterateeCall(value, index, object) {
+    if (!isObject(object)) {
+        return false;
+    }
+    if ((typeof index === "number" &&
+        isArrayLike(object) &&
+        isIndex(index) &&
+        index < object.length) ||
+        (typeof index === "string" && index in object)) {
+        return eq(object[index], value);
+    }
+    return false;
+}
+function defaults(object, ...sources) {
+    object = Object(object);
+    const objectProto = Object.prototype;
+    let length = sources.length;
+    const guard = length > 2 ? sources[2] : undefined;
+    if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+        length = 1;
+    }
+    for (let i = 0; i < length; i++) {
+        if (isNil(sources[i])) {
+            continue;
+        }
+        const source = sources[i];
+        for (const key in source) {
+            const value = object[key];
+            if (value === undefined ||
+                (!objectProto.hasOwnProperty.call(object, key) &&
+                    eq(value, objectProto[key]))) {
+                object[key] = source[key];
+            }
+        }
+    }
+    return object;
+}
+exports.defaults = defaults;
diff --git a/node_modules/ioredis/built/utils/index.d.ts b/node_modules/ioredis/built/utils/index.d.ts
new file mode 100644
index 0000000..c10bae6
--- /dev/null
+++ b/node_modules/ioredis/built/utils/index.d.ts
@@ -0,0 +1,124 @@
+/// <reference types="node" />
+import { defaults, isArguments, noop } from "./lodash";
+import { Callback } from "../types";
+import Debug from "./debug";
+/**
+ * Convert a buffer to string, supports buffer array
+ *
+ * @example
+ * ```js
+ * const input = [Buffer.from('foo'), [Buffer.from('bar')]]
+ * const res = convertBufferToString(input, 'utf8')
+ * expect(res).to.eql(['foo', ['bar']])
+ * ```
+ */
+export declare function convertBufferToString(value: any, encoding?: BufferEncoding): any;
+/**
+ * Convert a list of results to node-style
+ *
+ * @example
+ * ```js
+ * const input = ['a', 'b', new Error('c'), 'd']
+ * const output = exports.wrapMultiResult(input)
+ * expect(output).to.eql([[null, 'a'], [null, 'b'], [new Error('c')], [null, 'd'])
+ * ```
+ */
+export declare function wrapMultiResult(arr: unknown[] | null): unknown[][] | null;
+/**
+ * Detect if the argument is a int
+ * @example
+ * ```js
+ * > isInt('123')
+ * true
+ * > isInt('123.3')
+ * false
+ * > isInt('1x')
+ * false
+ * > isInt(123)
+ * true
+ * > isInt(true)
+ * false
+ * ```
+ */
+export declare function isInt(value: any): value is string;
+/**
+ * Pack an array to an Object
+ *
+ * @example
+ * ```js
+ * > packObject(['a', 'b', 'c', 'd'])
+ * { a: 'b', c: 'd' }
+ * ```
+ */
+export declare function packObject(array: any[]): Record<string, any>;
+/**
+ * Return a callback with timeout
+ */
+export declare function timeout<T>(callback: Callback<T>, timeout: number): Callback<T>;
+/**
+ * Convert an object to an array
+ * @example
+ * ```js
+ * > convertObjectToArray({ a: '1' })
+ * ['a', '1']
+ * ```
+ */
+export declare function convertObjectToArray<T>(obj: Record<string, T>): (string | T)[];
+/**
+ * Convert a map to an array
+ * @example
+ * ```js
+ * > convertMapToArray(new Map([[1, '2']]))
+ * [1, '2']
+ * ```
+ */
+export declare function convertMapToArray<K, V>(map: Map<K, V>): (K | V)[];
+/**
+ * Convert a non-string arg to a string
+ */
+export declare function toArg(arg: any): string;
+/**
+ * Optimize error stack
+ *
+ * @param error actually error
+ * @param friendlyStack the stack that more meaningful
+ * @param filterPath only show stacks with the specified path
+ */
+export declare function optimizeErrorStack(error: Error, friendlyStack: string, filterPath: string): Error;
+/**
+ * Parse the redis protocol url
+ */
+export declare function parseURL(url: string): Record<string, unknown>;
+interface TLSOptions {
+    port: number;
+    host: string;
+    [key: string]: any;
+}
+/**
+ * Resolve TLS profile shortcut in connection options
+ */
+export declare function resolveTLSProfile(options: TLSOptions): TLSOptions;
+/**
+ * Get a random element from `array`
+ */
+export declare function sample<T>(array: T[], from?: number): T;
+/**
+ * Shuffle the array using the Fisher-Yates Shuffle.
+ * This method will mutate the original array.
+ */
+export declare function shuffle<T>(array: T[]): T[];
+/**
+ * Error message for connection being disconnected
+ */
+export declare const CONNECTION_CLOSED_ERROR_MSG = "Connection is closed.";
+export declare function zipMap<K, V>(keys: K[], values: V[]): Map<K, V>;
+/**
+ * Retrieves cached package metadata from package.json.
+ *
+ * @internal
+ * @returns {Promise<{version: string} | null>} Package metadata or null if unavailable
+ */
+export declare function getPackageMeta(): Promise<{
+    version: string;
+}>;
+export { Debug, defaults, isArguments, noop };
diff --git a/node_modules/ioredis/built/utils/index.js b/node_modules/ioredis/built/utils/index.js
new file mode 100644
index 0000000..51697cd
--- /dev/null
+++ b/node_modules/ioredis/built/utils/index.js
@@ -0,0 +1,368 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.noop = exports.isArguments = exports.defaults = exports.Debug = exports.getPackageMeta = exports.zipMap = exports.CONNECTION_CLOSED_ERROR_MSG = exports.shuffle = exports.sample = exports.resolveTLSProfile = exports.parseURL = exports.optimizeErrorStack = exports.toArg = exports.convertMapToArray = exports.convertObjectToArray = exports.timeout = exports.packObject = exports.isInt = exports.wrapMultiResult = exports.convertBufferToString = void 0;
+const fs_1 = require("fs");
+const path_1 = require("path");
+const lodash_1 = require("./lodash");
+Object.defineProperty(exports, "defaults", { enumerable: true, get: function () { return lodash_1.defaults; } });
+Object.defineProperty(exports, "isArguments", { enumerable: true, get: function () { return lodash_1.isArguments; } });
+Object.defineProperty(exports, "noop", { enumerable: true, get: function () { return lodash_1.noop; } });
+const debug_1 = require("./debug");
+exports.Debug = debug_1.default;
+const TLSProfiles_1 = require("../constants/TLSProfiles");
+/**
+ * Convert a buffer to string, supports buffer array
+ *
+ * @example
+ * ```js
+ * const input = [Buffer.from('foo'), [Buffer.from('bar')]]
+ * const res = convertBufferToString(input, 'utf8')
+ * expect(res).to.eql(['foo', ['bar']])
+ * ```
+ */
+function convertBufferToString(value, encoding) {
+    if (value instanceof Buffer) {
+        return value.toString(encoding);
+    }
+    if (Array.isArray(value)) {
+        const length = value.length;
+        const res = Array(length);
+        for (let i = 0; i < length; ++i) {
+            res[i] =
+                value[i] instanceof Buffer && encoding === "utf8"
+                    ? value[i].toString()
+                    : convertBufferToString(value[i], encoding);
+        }
+        return res;
+    }
+    return value;
+}
+exports.convertBufferToString = convertBufferToString;
+/**
+ * Convert a list of results to node-style
+ *
+ * @example
+ * ```js
+ * const input = ['a', 'b', new Error('c'), 'd']
+ * const output = exports.wrapMultiResult(input)
+ * expect(output).to.eql([[null, 'a'], [null, 'b'], [new Error('c')], [null, 'd'])
+ * ```
+ */
+function wrapMultiResult(arr) {
+    // When using WATCH/EXEC transactions, the EXEC will return
+    // a null instead of an array
+    if (!arr) {
+        return null;
+    }
+    const result = [];
+    const length = arr.length;
+    for (let i = 0; i < length; ++i) {
+        const item = arr[i];
+        if (item instanceof Error) {
+            result.push([item]);
+        }
+        else {
+            result.push([null, item]);
+        }
+    }
+    return result;
+}
+exports.wrapMultiResult = wrapMultiResult;
+/**
+ * Detect if the argument is a int
+ * @example
+ * ```js
+ * > isInt('123')
+ * true
+ * > isInt('123.3')
+ * false
+ * > isInt('1x')
+ * false
+ * > isInt(123)
+ * true
+ * > isInt(true)
+ * false
+ * ```
+ */
+function isInt(value) {
+    const x = parseFloat(value);
+    return !isNaN(value) && (x | 0) === x;
+}
+exports.isInt = isInt;
+/**
+ * Pack an array to an Object
+ *
+ * @example
+ * ```js
+ * > packObject(['a', 'b', 'c', 'd'])
+ * { a: 'b', c: 'd' }
+ * ```
+ */
+function packObject(array) {
+    const result = {};
+    const length = array.length;
+    for (let i = 1; i < length; i += 2) {
+        result[array[i - 1]] = array[i];
+    }
+    return result;
+}
+exports.packObject = packObject;
+/**
+ * Return a callback with timeout
+ */
+function timeout(callback, timeout) {
+    let timer = null;
+    const run = function () {
+        if (timer) {
+            clearTimeout(timer);
+            timer = null;
+            callback.apply(this, arguments);
+        }
+    };
+    timer = setTimeout(run, timeout, new Error("timeout"));
+    return run;
+}
+exports.timeout = timeout;
+/**
+ * Convert an object to an array
+ * @example
+ * ```js
+ * > convertObjectToArray({ a: '1' })
+ * ['a', '1']
+ * ```
+ */
+function convertObjectToArray(obj) {
+    const result = [];
+    const keys = Object.keys(obj); // Object.entries requires node 7+
+    for (let i = 0, l = keys.length; i < l; i++) {
+        result.push(keys[i], obj[keys[i]]);
+    }
+    return result;
+}
+exports.convertObjectToArray = convertObjectToArray;
+/**
+ * Convert a map to an array
+ * @example
+ * ```js
+ * > convertMapToArray(new Map([[1, '2']]))
+ * [1, '2']
+ * ```
+ */
+function convertMapToArray(map) {
+    const result = [];
+    let pos = 0;
+    map.forEach(function (value, key) {
+        result[pos] = key;
+        result[pos + 1] = value;
+        pos += 2;
+    });
+    return result;
+}
+exports.convertMapToArray = convertMapToArray;
+/**
+ * Convert a non-string arg to a string
+ */
+function toArg(arg) {
+    if (arg === null || typeof arg === "undefined") {
+        return "";
+    }
+    return String(arg);
+}
+exports.toArg = toArg;
+/**
+ * Optimize error stack
+ *
+ * @param error actually error
+ * @param friendlyStack the stack that more meaningful
+ * @param filterPath only show stacks with the specified path
+ */
+function optimizeErrorStack(error, friendlyStack, filterPath) {
+    const stacks = friendlyStack.split("\n");
+    let lines = "";
+    let i;
+    for (i = 1; i < stacks.length; ++i) {
+        if (stacks[i].indexOf(filterPath) === -1) {
+            break;
+        }
+    }
+    for (let j = i; j < stacks.length; ++j) {
+        lines += "\n" + stacks[j];
+    }
+    if (error.stack) {
+        const pos = error.stack.indexOf("\n");
+        error.stack = error.stack.slice(0, pos) + lines;
+    }
+    return error;
+}
+exports.optimizeErrorStack = optimizeErrorStack;
+/**
+ * Parse the redis protocol url
+ */
+function parseURL(url) {
+    if (isInt(url)) {
+        return { port: url };
+    }
+    // Re-assert string type: isInt's type guard (value is string) incorrectly
+    // narrows url to 'never' in the false branch since url is already string.
+    const rawUrl = url;
+    // Determine if the URL has a known protocol (redis:// or rediss://)
+    const hasProtocol = /^rediss?:\/\//i.test(rawUrl);
+    // Unix socket paths (starting with "/") are not valid URLs — handle separately.
+    // Preserve query params (e.g., /tmp/redis.sock?db=2)
+    if (rawUrl[0] === "/") {
+        const qIdx = rawUrl.indexOf("?");
+        const result = {
+            path: qIdx === -1 ? rawUrl : rawUrl.slice(0, qIdx),
+        };
+        if (qIdx !== -1) {
+            const options = {};
+            const params = new URLSearchParams(rawUrl.slice(qIdx + 1));
+            params.forEach((value, key) => {
+                options[key] = parseURLQueryItem(key, value);
+            });
+            (0, lodash_1.defaults)(result, options);
+        }
+        return result;
+    }
+    let parsed;
+    if (hasProtocol) {
+        parsed = new URL(rawUrl);
+    }
+    else {
+        // Prepend a dummy protocol so new URL() can parse "host:port?query" correctly
+        parsed = new URL("redis://" + rawUrl);
+    }
+    // Convert searchParams to a plain object (equivalent to url.parse(url, true).query)
+    const options = {};
+    parsed.searchParams.forEach((value, key) => {
+        options[key] = parseURLQueryItem(key, value);
+    });
+    const result = {};
+    // Extract auth — WHATWG URL percent-encodes special chars, so decode them.
+    // Check both username AND password: redis://:password@host has empty username but valid password.
+    if (parsed.username || parsed.password) {
+        result.username = decodeURIComponent(parsed.username);
+        result.password = decodeURIComponent(parsed.password);
+    }
+    if (parsed.pathname && parsed.pathname !== "/") {
+        if (hasProtocol) {
+            // For redis:// and rediss://, the path after / is the db number
+            if (parsed.pathname.length > 1) {
+                result.db = parsed.pathname.slice(1);
+            }
+        }
+        else {
+            result.path = parsed.pathname;
+        }
+    }
+    if (parsed.hostname) {
+        // WHATWG URL keeps brackets around IPv6 addresses (e.g., "[::1]").
+        // Strip them to match the old url.parse() behavior.
+        result.host = parsed.hostname.replace(/^\[|\]$/g, "");
+    }
+    if (parsed.port) {
+        result.port = parsed.port;
+    }
+    (0, lodash_1.defaults)(result, options);
+    return result;
+}
+exports.parseURL = parseURL;
+function parseURLQueryItem(key, value) {
+    if (key === "family") {
+        const intFamily = Number.parseInt(value, 10);
+        if (!Number.isNaN(intFamily)) {
+            return intFamily;
+        }
+    }
+    return value;
+}
+/**
+ * Resolve TLS profile shortcut in connection options
+ */
+function resolveTLSProfile(options) {
+    let tls = options === null || options === void 0 ? void 0 : options.tls;
+    if (typeof tls === "string")
+        tls = { profile: tls };
+    const profile = TLSProfiles_1.default[tls === null || tls === void 0 ? void 0 : tls.profile];
+    if (profile) {
+        tls = Object.assign({}, profile, tls);
+        delete tls.profile;
+        options = Object.assign({}, options, { tls });
+    }
+    return options;
+}
+exports.resolveTLSProfile = resolveTLSProfile;
+/**
+ * Get a random element from `array`
+ */
+function sample(array, from = 0) {
+    const length = array.length;
+    if (from >= length) {
+        return null;
+    }
+    return array[from + Math.floor(Math.random() * (length - from))];
+}
+exports.sample = sample;
+/**
+ * Shuffle the array using the Fisher-Yates Shuffle.
+ * This method will mutate the original array.
+ */
+function shuffle(array) {
+    let counter = array.length;
+    // While there are elements in the array
+    while (counter > 0) {
+        // Pick a random index
+        const index = Math.floor(Math.random() * counter);
+        // Decrease counter by 1
+        counter--;
+        // And swap the last element with it
+        [array[counter], array[index]] = [array[index], array[counter]];
+    }
+    return array;
+}
+exports.shuffle = shuffle;
+/**
+ * Error message for connection being disconnected
+ */
+exports.CONNECTION_CLOSED_ERROR_MSG = "Connection is closed.";
+function zipMap(keys, values) {
+    const map = new Map();
+    keys.forEach((key, index) => {
+        map.set(key, values[index]);
+    });
+    return map;
+}
+exports.zipMap = zipMap;
+/**
+ * Memoized package metadata to avoid repeated file system reads.
+ *
+ * @internal
+ */
+let cachedPackageMeta = null;
+/**
+ * Retrieves cached package metadata from package.json.
+ *
+ * @internal
+ * @returns {Promise<{version: string} | null>} Package metadata or null if unavailable
+ */
+async function getPackageMeta() {
+    if (cachedPackageMeta) {
+        return cachedPackageMeta;
+    }
+    try {
+        const filePath = (0, path_1.resolve)(__dirname, "..", "..", "package.json");
+        const data = await fs_1.promises.readFile(filePath, "utf8");
+        const parsed = JSON.parse(data);
+        cachedPackageMeta = {
+            version: parsed.version,
+        };
+        return cachedPackageMeta;
+    }
+    catch (err) {
+        cachedPackageMeta = {
+            version: "error-fetching-version",
+        };
+        return cachedPackageMeta;
+    }
+}
+exports.getPackageMeta = getPackageMeta;
diff --git a/node_modules/ioredis/built/utils/isArguments.d.ts b/node_modules/ioredis/built/utils/isArguments.d.ts
new file mode 100644
index 0000000..4dbeb11
--- /dev/null
+++ b/node_modules/ioredis/built/utils/isArguments.d.ts
@@ -0,0 +1 @@
+export declare function isArguments(value?: unknown): value is IArguments;
diff --git a/node_modules/ioredis/built/utils/isArguments.js b/node_modules/ioredis/built/utils/isArguments.js
new file mode 100644
index 0000000..7c8e727
--- /dev/null
+++ b/node_modules/ioredis/built/utils/isArguments.js
@@ -0,0 +1,48 @@
+"use strict";
+/*
+ * Derived from `src/compat/predicate/isArguments.ts` in es-toolkit
+ * (https://github.com/toss/es-toolkit).
+ *
+ * Copyright (c) 2024 Viva Republica, Inc
+ * Copyright OpenJS Foundation and other contributors
+ *
+ * Parts of the compatibility layer in `es-toolkit/compat` are derived from
+ * Lodash (https://github.com/lodash/lodash) by the OpenJS Foundation
+ * (https://openjsf.org/) and Underscore.js by Jeremy Ashkenas, DocumentCloud
+ * and Investigative Reporters & Editors (http://underscorejs.org/).
+ *
+ * This file has been modified from the original source to create a standalone
+ * adaptation.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isArguments = void 0;
+function getTag(value) {
+    if (value == null) {
+        return value === undefined ? "[object Undefined]" : "[object Null]";
+    }
+    return Object.prototype.toString.call(value);
+}
+function isArguments(value) {
+    return (value !== null &&
+        typeof value === "object" &&
+        getTag(value) === "[object Arguments]");
+}
+exports.isArguments = isArguments;
diff --git a/node_modules/ioredis/built/utils/lodash.d.ts b/node_modules/ioredis/built/utils/lodash.d.ts
new file mode 100644
index 0000000..ee7d691
--- /dev/null
+++ b/node_modules/ioredis/built/utils/lodash.d.ts
@@ -0,0 +1,3 @@
+export declare function noop(): void;
+export * from "./defaults";
+export * from "./isArguments";
diff --git a/node_modules/ioredis/built/utils/lodash.js b/node_modules/ioredis/built/utils/lodash.js
new file mode 100644
index 0000000..4239101
--- /dev/null
+++ b/node_modules/ioredis/built/utils/lodash.js
@@ -0,0 +1,17 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.noop = void 0;
+function noop() { }
+exports.noop = noop;
+__exportStar(require("./defaults"), exports);
+__exportStar(require("./isArguments"), exports);
diff --git a/node_modules/ioredis/package.json b/node_modules/ioredis/package.json
new file mode 100644
index 0000000..ad08e30
--- /dev/null
+++ b/node_modules/ioredis/package.json
@@ -0,0 +1,98 @@
+{
+  "name": "ioredis",
+  "version": "5.11.0",
+  "description": "A robust, performance-focused and full-featured Redis client for Node.js.",
+  "main": "./built/index.js",
+  "types": "./built/index.d.ts",
+  "files": [
+    "built/"
+  ],
+  "scripts": {
+    "docker:setup": "docker compose -f test/docker-compose.yml up -d --wait",
+    "docker:teardown": "docker compose -f test/docker-compose.yml down --volumes --remove-orphans",
+    "test:tsd": "npm run build && tsd",
+    "test:js": "TS_NODE_TRANSPILE_ONLY=true NODE_ENV=test mocha --no-experimental-strip-types \"test/helpers/*.ts\" \"test/unit/**/*.ts\" \"test/functional/**/*.ts\"",
+    "test:cov": "nyc npm run test:js",
+    "test:cluster": "TS_NODE_TRANSPILE_ONLY=true NODE_ENV=test mocha --no-experimental-strip-types \"test/cluster/**/*.ts\"",
+    "test": "npm run test:js && npm run test:tsd",
+    "lint": "eslint --ext .js,.ts ./lib",
+    "docs": "npx typedoc --logLevel Error --excludeExternals --excludeProtected --excludePrivate --readme none lib/index.ts",
+    "format": "prettier --write \"{,!(node_modules)/**/}*.{js,ts}\"",
+    "format-check": "prettier --check \"{,!(node_modules)/**/}*.{js,ts}\"",
+    "build": "rm -rf built && tsc",
+    "prepublishOnly": "npm run build",
+    "semantic-release": "semantic-release"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/luin/ioredis.git"
+  },
+  "keywords": [
+    "redis",
+    "cluster",
+    "sentinel",
+    "pipelining"
+  ],
+  "tsd": {
+    "directory": "test/typing"
+  },
+  "author": "Zihua Li <i@zihua.li> (http://zihua.li)",
+  "license": "MIT",
+  "funding": {
+    "type": "opencollective",
+    "url": "https://opencollective.com/ioredis"
+  },
+  "dependencies": {
+    "@ioredis/commands": "1.10.0",
+    "cluster-key-slot": "1.1.1",
+    "debug": "4.4.3",
+    "denque": "2.1.0",
+    "redis-errors": "1.2.0",
+    "redis-parser": "3.0.0",
+    "standard-as-callback": "2.1.0"
+  },
+  "devDependencies": {
+    "@ioredis/interface-generator": "^1.3.0",
+    "@semantic-release/changelog": "^6.0.1",
+    "@semantic-release/commit-analyzer": "^9.0.2",
+    "@semantic-release/git": "^10.0.1",
+    "@types/chai": "^4.3.0",
+    "@types/chai-as-promised": "^7.1.5",
+    "@types/debug": "^4.1.5",
+    "@types/mocha": "^9.1.0",
+    "@types/node": "^14.18.12",
+    "@types/redis-errors": "^1.2.1",
+    "@types/sinon": "^10.0.11",
+    "@typescript-eslint/eslint-plugin": "^5.48.1",
+    "@typescript-eslint/parser": "^5.48.1",
+    "chai": "^4.3.6",
+    "chai-as-promised": "^7.1.1",
+    "eslint": "^8.31.0",
+    "eslint-config-prettier": "^8.6.0",
+    "mocha": "^11.7.6",
+    "nyc": "^15.1.0",
+    "prettier": "^2.6.1",
+    "semantic-release": "^19.0.2",
+    "server-destroy": "^1.0.1",
+    "sinon": "^13.0.1",
+    "ts-node": "^10.4.0",
+    "tsd": "^0.19.1",
+    "typedoc": "^0.22.18",
+    "typescript": "^4.6.3",
+    "uuid": "^9.0.0"
+  },
+  "nyc": {
+    "reporter": [
+      "lcov"
+    ]
+  },
+  "engines": {
+    "node": ">=12.22.0"
+  },
+  "mocha": {
+    "exit": true,
+    "timeout": 8000,
+    "recursive": true,
+    "require": "ts-node/register"
+  }
+}
diff --git a/node_modules/javascript-natural-sort/.gitattributes b/node_modules/javascript-natural-sort/.gitattributes
new file mode 100644
index 0000000..412eeda
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.gitattributes
@@ -0,0 +1,22 @@
+# Auto detect text files and perform LF normalization
+* text=auto
+
+# Custom for Visual Studio
+*.cs     diff=csharp
+*.sln    merge=union
+*.csproj merge=union
+*.vbproj merge=union
+*.fsproj merge=union
+*.dbproj merge=union
+
+# Standard to msysgit
+*.doc	 diff=astextplain
+*.DOC	 diff=astextplain
+*.docx diff=astextplain
+*.DOCX diff=astextplain
+*.dot  diff=astextplain
+*.DOT  diff=astextplain
+*.pdf  diff=astextplain
+*.PDF	 diff=astextplain
+*.rtf	 diff=astextplain
+*.RTF	 diff=astextplain
diff --git a/node_modules/javascript-natural-sort/.idea/.name b/node_modules/javascript-natural-sort/.idea/.name
new file mode 100644
index 0000000..f9bd021
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/.name
@@ -0,0 +1 @@
+javascript-natural-sort
\ No newline at end of file
diff --git a/node_modules/javascript-natural-sort/.idea/encodings.xml b/node_modules/javascript-natural-sort/.idea/encodings.xml
new file mode 100644
index 0000000..e206d70
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/encodings.xml
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="Encoding" useUTFGuessing="true" native2AsciiForPropertiesFiles="false" />
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml b/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml
new file mode 100644
index 0000000..6b8184f
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/javascript-natural-sort.iml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$" />
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
+
diff --git a/node_modules/javascript-natural-sort/.idea/misc.xml b/node_modules/javascript-natural-sort/.idea/misc.xml
new file mode 100644
index 0000000..1162f43
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/misc.xml
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" />
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/modules.xml b/node_modules/javascript-natural-sort/.idea/modules.xml
new file mode 100644
index 0000000..63a98c1
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/modules.xml
@@ -0,0 +1,9 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/javascript-natural-sort.iml" filepath="$PROJECT_DIR$/.idea/javascript-natural-sort.iml" />
+    </modules>
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml b/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml
new file mode 100644
index 0000000..922003b
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/scopes/scope_settings.xml
@@ -0,0 +1,5 @@
+<component name="DependencyValidationManager">
+  <state>
+    <option name="SKIP_IMPORT_STATEMENTS" value="false" />
+  </state>
+</component>
\ No newline at end of file
diff --git a/node_modules/javascript-natural-sort/.idea/vcs.xml b/node_modules/javascript-natural-sort/.idea/vcs.xml
new file mode 100644
index 0000000..c80f219
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/vcs.xml
@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.idea/workspace.xml b/node_modules/javascript-natural-sort/.idea/workspace.xml
new file mode 100644
index 0000000..e229274
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.idea/workspace.xml
@@ -0,0 +1,318 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ChangeListManager">
+    <list default="true" id="7e2ccc79-07ee-4d3a-8f78-ceb66a24e495" name="Default" comment="">
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/naturalSort.js" afterPath="$PROJECT_DIR$/naturalSort.js" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/package.json" afterPath="$PROJECT_DIR$/package.json" />
+    </list>
+    <ignored path="javascript-natural-sort.iws" />
+    <ignored path=".idea/workspace.xml" />
+    <option name="TRACKING_ENABLED" value="true" />
+    <option name="SHOW_DIALOG" value="false" />
+    <option name="HIGHLIGHT_CONFLICTS" value="true" />
+    <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
+    <option name="LAST_RESOLUTION" value="IGNORE" />
+  </component>
+  <component name="ChangesViewManager" flattened_view="true" show_ignored="false" />
+  <component name="CreatePatchCommitExecutor">
+    <option name="PATCH_PATH" value="" />
+  </component>
+  <component name="DaemonCodeAnalyzer">
+    <disable_hints />
+  </component>
+  <component name="ExecutionTargetManager" SELECTED_TARGET="default_target" />
+  <component name="FavoritesManager">
+    <favorites_list name="javascript-natural-sort" />
+  </component>
+  <component name="FileEditorManager">
+    <leaf>
+      <file leaf-file-name="naturalSort.js" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/naturalSort.js">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="14" column="40" selection-start="689" selection-end="689" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="867">
+              <folding>
+                <element signature="n#!!doc" expanded="true" />
+              </folding>
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="README.md" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/README.md">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="package.json" pinned="false" current="true" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/package.json">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="2" column="19" selection-start="58" selection-end="58" vertical-scroll-proportion="0.05724508" vertical-offset="2" max-vertical-offset="561">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+    </leaf>
+  </component>
+  <component name="FindManager">
+    <FindUsagesManager>
+      <setting name="OPEN_NEW_TAB" value="false" />
+    </FindUsagesManager>
+  </component>
+  <component name="Git.Settings">
+    <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
+  </component>
+  <component name="GitLogSettings">
+    <option name="myDateState">
+      <MyDateState />
+    </option>
+  </component>
+  <component name="IdeDocumentHistory">
+    <option name="changedFiles">
+      <list>
+        <option value="$PROJECT_DIR$/naturalSort.js" />
+        <option value="$PROJECT_DIR$/package.json" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectFrameBounds">
+    <option name="x" value="-1928" />
+    <option name="y" value="-8" />
+    <option name="width" value="1936" />
+    <option name="height" value="1066" />
+  </component>
+  <component name="ProjectLevelVcsManager" settingsEditedManually="false">
+    <OptionsSetting value="true" id="Add" />
+    <OptionsSetting value="true" id="Remove" />
+    <OptionsSetting value="true" id="Checkout" />
+    <OptionsSetting value="true" id="Update" />
+    <OptionsSetting value="true" id="Status" />
+    <OptionsSetting value="true" id="Edit" />
+    <ConfirmationsSetting value="0" id="Add" />
+    <ConfirmationsSetting value="0" id="Remove" />
+  </component>
+  <component name="ProjectReloadState">
+    <option name="STATE" value="0" />
+  </component>
+  <component name="ProjectView">
+    <navigator currentView="ProjectPane" proportions="" version="1" splitterProportion="0.5">
+      <flattenPackages />
+      <showMembers />
+      <showModules />
+      <showLibraryContents />
+      <hideEmptyPackages />
+      <abbreviatePackageNames />
+      <autoscrollToSource />
+      <autoscrollFromSource />
+      <sortByType />
+    </navigator>
+    <panes>
+      <pane id="ProjectPane">
+        <subPane>
+          <PATH>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
+            </PATH_ELEMENT>
+          </PATH>
+          <PATH>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
+            </PATH_ELEMENT>
+            <PATH_ELEMENT>
+              <option name="myItemId" value="javascript-natural-sort" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
+            </PATH_ELEMENT>
+          </PATH>
+        </subPane>
+      </pane>
+      <pane id="Scope" />
+    </panes>
+  </component>
+  <component name="PropertiesComponent">
+    <property name="WebServerToolWindowFactoryState" value="false" />
+    <property name="last_opened_file_path" value="$PROJECT_DIR$" />
+  </component>
+  <component name="RunManager">
+    <configuration default="true" type="DartCommandLineRunConfigurationType" factoryName="Dart Command Line Application">
+      <option name="VMOptions" />
+      <option name="arguments" />
+      <option name="filePath" />
+      <option name="name" value="Dart" />
+      <option name="saveOutputToFile" value="false" />
+      <option name="showConsoleOnStdErr" value="false" />
+      <option name="showConsoleOnStdOut" value="false" />
+      <method />
+    </configuration>
+    <configuration default="true" type="DartUnitRunConfigurationType" factoryName="DartUnit">
+      <option name="VMOptions" />
+      <option name="arguments" />
+      <option name="filePath" />
+      <option name="scope" value="ALL" />
+      <option name="testName" />
+      <method />
+    </configuration>
+    <configuration default="true" type="JavaScriptTestRunnerKarma" factoryName="Karma" singleton="true" config-file="">
+      <envs />
+      <method />
+    </configuration>
+    <configuration default="true" type="JSTestDriver:ConfigurationType" factoryName="JsTestDriver">
+      <setting name="configLocationType" value="CONFIG_FILE" />
+      <setting name="settingsFile" value="" />
+      <setting name="serverType" value="INTERNAL" />
+      <setting name="preferredDebugBrowser" value="CHROME" />
+      <method />
+    </configuration>
+    <configuration default="true" type="JavascriptDebugType" factoryName="JavaScript Debug" singleton="true">
+      <method />
+    </configuration>
+    <configuration default="true" type="NodeJSConfigurationType" factoryName="Node.js" working-dir="">
+      <browser start="false" url="" with-js-debugger="false" />
+      <method />
+    </configuration>
+    <list size="0" />
+  </component>
+  <component name="ShelveChangesManager" show_recycled="false" />
+  <component name="TaskManager">
+    <task active="true" id="Default" summary="Default task">
+      <changelist id="7e2ccc79-07ee-4d3a-8f78-ceb66a24e495" name="Default" comment="" />
+      <created>1388535088299</created>
+      <updated>1388535088299</updated>
+    </task>
+    <task id="LOCAL-00001" summary="Added package.json, using commonjs now">
+      <created>1388535399296</created>
+      <updated>1388535399296</updated>
+    </task>
+    <option name="localTasksCounter" value="2" />
+    <servers />
+  </component>
+  <component name="ToolWindowManager">
+    <frame x="-1928" y="-8" width="1936" height="1066" extended-state="0" />
+    <editor active="false" />
+    <layout>
+      <window_info id="Changes" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.32929516" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Terminal" active="true" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.32857144" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="TODO" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="6" side_tool="false" content_ui="tabs" />
+      <window_info id="Structure" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Project" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.14654718" sideWeight="0.67142856" order="0" side_tool="false" content_ui="combo" />
+      <window_info id="Debug" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
+      <window_info id="Favorites" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="2" side_tool="true" content_ui="tabs" />
+      <window_info id="Event Log" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="true" content_ui="tabs" />
+      <window_info id="Run" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="2" side_tool="false" content_ui="tabs" />
+      <window_info id="Version Control" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Cvs" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="4" side_tool="false" content_ui="tabs" />
+      <window_info id="Message" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
+      <window_info id="Ant Build" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Find" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
+      <window_info id="Messages" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="7" side_tool="false" content_ui="tabs" />
+      <window_info id="Commander" active="false" anchor="right" auto_hide="false" internal_type="SLIDING" type="SLIDING" visible="false" weight="0.4" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
+      <window_info id="Hierarchy" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="2" side_tool="false" content_ui="combo" />
+      <window_info id="Inspection" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="5" side_tool="false" content_ui="tabs" />
+    </layout>
+  </component>
+  <component name="VcsContentAnnotationSettings">
+    <option name="myLimit" value="2678400000" />
+  </component>
+  <component name="VcsManagerConfiguration">
+    <option name="myTodoPanelSettings">
+      <TodoPanelSettings />
+    </option>
+    <MESSAGE value="Added package.json, using commonjs now" />
+    <option name="LAST_COMMIT_MESSAGE" value="Added package.json, using commonjs now" />
+  </component>
+  <component name="XDebuggerManager">
+    <breakpoint-manager />
+  </component>
+  <component name="editorHistoryManager">
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="11" column="19" selection-start="506" selection-end="506" vertical-scroll-proportion="0.0" vertical-offset="51" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="10" column="49" selection-start="354" selection-end="354" vertical-scroll-proportion="0.0" vertical-offset="170" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="5" column="26" selection-start="206" selection-end="206" vertical-scroll-proportion="0.0" vertical-offset="85" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="238" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="0" column="0" selection-start="0" selection-end="0" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="5" column="26" selection-start="206" selection-end="206" vertical-scroll-proportion="0.0" vertical-offset="85" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="0" column="0" selection-start="0" selection-end="0" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/README.md">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="28" selection-start="257" selection-end="257" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="1394">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/naturalSort.js">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="14" column="40" selection-start="689" selection-end="689" vertical-scroll-proportion="0.0" vertical-offset="0" max-vertical-offset="867">
+          <folding>
+            <element signature="n#!!doc" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/package.json">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="2" column="19" selection-start="58" selection-end="58" vertical-scroll-proportion="0.05724508" vertical-offset="2" max-vertical-offset="561">
+          <folding />
+        </state>
+      </provider>
+    </entry>
+  </component>
+</project>
+
diff --git a/node_modules/javascript-natural-sort/.npmignore b/node_modules/javascript-natural-sort/.npmignore
new file mode 100644
index 0000000..5ebd21a
--- /dev/null
+++ b/node_modules/javascript-natural-sort/.npmignore
@@ -0,0 +1,163 @@
+#################
+## Eclipse
+#################
+
+*.pydevproject
+.project
+.metadata
+bin/
+tmp/
+*.tmp
+*.bak
+*.swp
+*~.nib
+local.properties
+.classpath
+.settings/
+.loadpath
+
+# External tool builders
+.externalToolBuilders/
+
+# Locally stored "Eclipse launch configurations"
+*.launch
+
+# CDT-specific
+.cproject
+
+# PDT-specific
+.buildpath
+
+
+#################
+## Visual Studio
+#################
+
+## Ignore Visual Studio temporary files, build results, and
+## files generated by popular Visual Studio add-ons.
+
+# User-specific files
+*.suo
+*.user
+*.sln.docstates
+
+# Build results
+[Dd]ebug/
+[Rr]elease/
+*_i.c
+*_p.c
+*.ilk
+*.meta
+*.obj
+*.pch
+*.pdb
+*.pgc
+*.pgd
+*.rsp
+*.sbr
+*.tlb
+*.tli
+*.tlh
+*.tmp
+*.vspscc
+.builds
+*.dotCover
+
+## TODO: If you have NuGet Package Restore enabled, uncomment this
+#packages/
+
+# Visual C++ cache files
+ipch/
+*.aps
+*.ncb
+*.opensdf
+*.sdf
+
+# Visual Studio profiler
+*.psess
+*.vsp
+
+# ReSharper is a .NET coding add-in
+_ReSharper*
+
+# Installshield output folder
+[Ee]xpress
+
+# DocProject is a documentation generator add-in
+DocProject/buildhelp/
+DocProject/Help/*.HxT
+DocProject/Help/*.HxC
+DocProject/Help/*.hhc
+DocProject/Help/*.hhk
+DocProject/Help/*.hhp
+DocProject/Help/Html2
+DocProject/Help/html
+
+# Click-Once directory
+publish
+
+# Others
+[Bb]in
+[Oo]bj
+sql
+TestResults
+*.Cache
+ClientBin
+stylecop.*
+~$*
+*.dbmdl
+Generated_Code #added for RIA/Silverlight projects
+
+# Backup & report files from converting an old project file to a newer
+# Visual Studio version. Backup files are not needed, because we have git ;-)
+_UpgradeReport_Files/
+Backup*/
+UpgradeLog*.XML
+
+
+
+############
+## Windows
+############
+
+# Windows image file caches
+Thumbs.db
+
+# Folder config file
+Desktop.ini
+
+
+#############
+## Python
+#############
+
+*.py[co]
+
+# Packages
+*.egg
+*.egg-info
+dist
+build
+eggs
+parts
+bin
+var
+sdist
+develop-eggs
+.installed.cfg
+
+# Installer logs
+pip-log.txt
+
+# Unit test / coverage reports
+.coverage
+.tox
+
+#Translations
+*.mo
+
+#Mr Developer
+.mr.developer.cfg
+
+# Mac crap
+.DS_Store
diff --git a/node_modules/javascript-natural-sort/README.md b/node_modules/javascript-natural-sort/README.md
new file mode 100644
index 0000000..8270bd1
--- /dev/null
+++ b/node_modules/javascript-natural-sort/README.md
@@ -0,0 +1,76 @@
+### Simple numerics
+
+```javascript
+>>> ['10',9,2,'1','4'].sort(naturalSort)
+['1',2,'4',9,'10']
+```
+
+### Floats
+
+```javascript
+>>> ['10.0401',10.022,10.042,'10.021999'].sort(naturalSort)
+['10.021999',10.022,'10.0401',10.042]
+```
+
+### Float & decimal notation
+
+```javascript
+>>> ['10.04f','10.039F','10.038d','10.037D'].sort(naturalSort)
+['10.037D','10.038d','10.039F','10.04f']
+```
+
+### Scientific notation
+
+```javascript
+>>> ['1.528535047e5','1.528535047e7','1.528535047e3'].sort(naturalSort)
+['1.528535047e3','1.528535047e5','1.528535047e7']
+```
+
+### IP addresses
+
+```javascript
+>>> ['192.168.0.100','192.168.0.1','192.168.1.1'].sort(naturalSort)
+['192.168.0.1','192.168.0.100','192.168.1.1']
+```
+
+### Filenames
+
+```javascript
+>>> ['car.mov','01alpha.sgi','001alpha.sgi','my.string_41299.tif'].sort(naturalSort)
+['001alpha.sgi','01alpha.sgi','car.mov','my.string_41299.tif'
+```
+
+### Dates
+
+```javascript
+>>> ['10/12/2008','10/11/2008','10/11/2007','10/12/2007'].sort(naturalSort)
+['10/11/2007', '10/12/2007', '10/11/2008', '10/12/2008']
+```
+
+### Money
+
+```javascript
+>>> ['$10002.00','$10001.02','$10001.01'].sort(naturalSort)
+['$10001.01','$10001.02','$10002.00']
+```
+
+### Movie Titles
+
+```javascript
+>>> ['1 Title - The Big Lebowski','1 Title - Gattaca','1 Title - Last Picture Show'].sort(naturalSort)
+['1 Title - Gattaca','1 Title - Last Picture Show','1 Title - The Big Lebowski']
+```
+
+### By default - case-sensitive sorting
+
+```javascript
+>>> ['a', 'B'].sort(naturalSort);
+['B', 'a']
+```
+
+### To enable case-insensitive sorting
+```javascript
+>>> naturalSort.insensitive = true;
+>>> ['a', 'B'].sort(naturalSort);
+['a', 'B']
+```
diff --git a/node_modules/javascript-natural-sort/index.html b/node_modules/javascript-natural-sort/index.html
new file mode 100644
index 0000000..9c0bf7e
--- /dev/null
+++ b/node_modules/javascript-natural-sort/index.html
@@ -0,0 +1,100 @@
+<!DOCTYPE html>
+<html>
+<head>
+  <meta charset='utf-8'>
+
+  <title>overset/javascript-natural-sort @ GitHub</title>
+
+  <style type="text/css">
+    body {
+      margin-top: 1.0em;
+      background-color: #ffffff;
+      font-family: Helvetica, Arial, FreeSans, san-serif;
+      color: #000000;
+    }
+    #container {
+      margin: 0 auto;
+      width: 700px;
+    }
+    h1 { font-size: 3.8em; color: #000000; margin-bottom: 3px; }
+    h1 .small { font-size: 0.4em; }
+    h1 a { text-decoration: none }
+    h2 { font-size: 1.5em; color: #000000; }
+    h3 { text-align: center; color: #000000; }
+    a { color: #000000; }
+    .description { font-size: 1.2em; margin-bottom: 30px; margin-top: 30px; font-style: italic;}
+    .download { float: right; }
+    pre { background: #000; color: #fff; padding: 15px;}
+    hr { border: 0; width: 80%; border-bottom: 1px solid #aaa}
+    .footer { text-align:center; padding-top:30px; font-style: italic; }
+  </style>
+</head>
+
+<body>
+  <a href="https://github.com/overset/javascript-natural-sort"><img style="position: absolute; top: 0; right: 0; border: 0;" src="http://s3.amazonaws.com/github/ribbons/forkme_right_darkblue_121621.png" alt="Fork me on GitHub" /></a>
+
+  <div id="container">
+
+    <div class="download">
+      <a href="https://github.com/overset/javascript-natural-sort/zipball/master">
+        <img border="0" width="90" src="https://github.com/images/modules/download/zip.png"></a>
+      <a href="https://github.com/overset/javascript-natural-sort/tarball/master">
+        <img border="0" width="90" src="https://github.com/images/modules/download/tar.png"></a>
+    </div>
+
+    <h1><a href="https://github.com/overset/javascript-natural-sort">javascript-natural-sort</a>
+      <span class="small">by <a href="https://github.com/overset">overset</a></span></h1>
+
+    <div class="description">
+      A fast and lightweight function to be used in conjunction with the Array.sort() using the browser's default bubble sort. This will properly sort padded numbers, numbers preceding text, dates, floats, etc.
+    </div>
+
+    
+
+    
+
+    
+
+    
+      <h2>License</h2>
+      <p>MIT</p>
+    
+
+    
+      <h2>Authors</h2>
+      <p>Jim Palmer (jimpalmer@gmail.com)
<br/>      </p>
+    
+
+    
+      <h2>Contact</h2>
+      <p>Jim Palmer (jimpalmer@gmail.com)
<br/>      </p>
+    
+
+    <h2>Download</h2>
+    <p>
+      You can download this project in either
+      <a href="https://github.com/overset/javascript-natural-sort/zipball/master">zip</a> or
+      <a href="https://github.com/overset/javascript-natural-sort/tarball/master">tar formats.
+    </p>
+    <p>You can also clone the project with <a href="http://git-scm.com">Git</a>
+      by running:
+      <pre>$ git clone git://github.com/overset/javascript-natural-sort</pre>
+    </p>
+
+    <div class="footer">
+      get the source code on GitHub : <a href="https://github.com/overset/javascript-natural-sort">overset/javascript-natural-sort</a>
+    </div>
+
+  </div>
+
+<script type="text/javascript">
+var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
+document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
+</script>
+<script type="text/javascript">
+try {
+var pageTracker = _gat._getTracker("UA-87585-8");
+pageTracker._trackPageview();
+} catch(err) {}</script>"
+</body>
+</html>
diff --git a/node_modules/javascript-natural-sort/naturalSort.js b/node_modules/javascript-natural-sort/naturalSort.js
new file mode 100644
index 0000000..28dd64d
--- /dev/null
+++ b/node_modules/javascript-natural-sort/naturalSort.js
@@ -0,0 +1,45 @@
+/*
+ * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license
+ * Author: Jim Palmer (based on chunking idea from Dave Koelle)
+ */
+/*jshint unused:false */
+module.exports = function naturalSort (a, b) {
+	"use strict";
+	var re = /(^([+\-]?(?:0|[1-9]\d*)(?:\.\d*)?(?:[eE][+\-]?\d+)?)?$|^0x[0-9a-f]+$|\d+)/gi,
+		sre = /(^[ ]*|[ ]*$)/g,
+		dre = /(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/,
+		hre = /^0x[0-9a-f]+$/i,
+		ore = /^0/,
+		i = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },
+		// convert all to strings strip whitespace
+		x = i(a).replace(sre, '') || '',
+		y = i(b).replace(sre, '') || '',
+		// chunk/tokenize
+		xN = x.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
+		yN = y.replace(re, '\0$1\0').replace(/\0$/,'').replace(/^\0/,'').split('\0'),
+		// numeric, hex or date detection
+		xD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),
+		yD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,
+		oFxNcL, oFyNcL;
+	// first try and sort Hex codes or Dates
+	if (yD) {
+		if ( xD < yD ) { return -1; }
+		else if ( xD > yD ) { return 1; }
+	}
+	// natural sorting through split numeric strings and default strings
+	for(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {
+		// find floats not starting with '0', string or 0 if not defined (Clint Priest)
+		oFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;
+		oFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;
+		// handle numeric vs string comparison - number < string - (Kyle Adams)
+		if (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }
+		// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'
+		else if (typeof oFxNcL !== typeof oFyNcL) {
+			oFxNcL += '';
+			oFyNcL += '';
+		}
+		if (oFxNcL < oFyNcL) { return -1; }
+		if (oFxNcL > oFyNcL) { return 1; }
+	}
+	return 0;
+};
diff --git a/node_modules/javascript-natural-sort/package.json b/node_modules/javascript-natural-sort/package.json
new file mode 100644
index 0000000..4b1bf07
--- /dev/null
+++ b/node_modules/javascript-natural-sort/package.json
@@ -0,0 +1,27 @@
+{
+  "name": "javascript-natural-sort",
+  "version": "0.7.1",
+  "description": "Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license",
+  "main": "naturalSort.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/Bill4Time/javascript-natural-sort.git"
+  },
+  "keywords": [
+    "natural",
+    "sort",
+    "javascript",
+    "array",
+    "sort",
+    "sorting"
+  ],
+  "author": "Jim Palmer (based on chunking idea from Dave Koelle, packaged by @khous of Bill4Time)",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/Bill4Time/javascript-natural-sort/issues"
+  },
+  "homepage": "https://github.com/Bill4Time/javascript-natural-sort"
+}
diff --git a/node_modules/javascript-natural-sort/speed-tests.html b/node_modules/javascript-natural-sort/speed-tests.html
new file mode 100644
index 0000000..090259b
--- /dev/null
+++ b/node_modules/javascript-natural-sort/speed-tests.html
@@ -0,0 +1,105 @@
+<!DOCTYPE html>
+<html>
+<head>
+<script src="naturalSort.js" type="text/javascript"></script>
+
+<script>
+
+/* Mike Grier's fixes on v0.2 http://mgrier.com/code/natsort.optimized.txt */
+function naturalSort2(a,b){
+	// setup temp-scope variables for comparison evauluation
+	var x = a.toString().toLowerCase() || '',
+	re=/(-?[0-9.]+)/g,
+	y = b.toString().toLowerCase() || '',
+	nC = String.fromCharCode(0),
+	xN = x.replace( re, nC + '$1' + nC ).split(nC),
+	yN = y.replace( re, nC + '$1' + nC ).split(nC),
+	xD = (new Date(x)).getTime(),yD;
+
+	if(xD) yD = (new Date(y)).getTime(); //no point in getting yD if xD is not a date
+
+	// natural sorting of dates
+	if(yD){ // we already checked if(xD), so if(yD), it's a date, too
+		if( xD < yD ) return -1;
+		else if( xD > yD ) return 1;
+	}
+
+	// natural sorting through split numeric strings and default strings
+	var cLoc, numS=Math.max(xN.length,yN.length);
+	for(cLoc=0; cLoc<numS; cLoc++){
+		// instead of performing these next 6 operations in the if
+		// and the same 6 operations in the else if, just do them once
+		// so we can reuse results instead of computing twice
+		xNcL = xN[cLoc]; // only look up values
+		yNcL = yN[cLoc]; // in arrays once
+		FxNcL = parseFloat(xNcL);
+		FyNcL = parseFloat(yNcL);
+		oFxNcL = FxNcL || xNcL;
+		oFyNcL = FyNcL || yNcL;
+
+		if(oFxNcL < oFyNcL)return -1;
+		else if(oFxNcL > oFyNcL)return 1;
+	}
+	return 0;
+}
+
+/*
+ * Natural Sort algorithm for Javascript
+ *	Version 0.3
+ * Author: Jim Palmer (based on chunking idea from Dave Koelle)
+ *	optimizations and safari fix by Mike Grier (mgrier.com)
+ * Released under MIT license.
+ */
+function naturalSort3(a, b){
+	// setup temp-scope variables for comparison evauluation
+	var re = /(-?[0-9\.]+)/g,
+		x = a.toString().toLowerCase() || '',
+		y = b.toString().toLowerCase() || '',
+		nC = String.fromCharCode(0),
+		xN = x.replace( re, nC + '$1' + nC ).split(nC),
+		yN = y.replace( re, nC + '$1' + nC ).split(nC),
+		xD = (new Date(x)).getTime(),
+		yD = xD ? (new Date(y)).getTime() : null;
+	// natural sorting of dates
+	if ( yD )
+		if ( xD < yD ) return -1;
+		else if ( xD > yD )	return 1;
+	// natural sorting through split numeric strings and default strings
+	for( var cLoc = 0, numS = Math.max(xN.length, yN.length); cLoc < numS; cLoc++ ) {
+		oFxNcL = parseFloat(xN[cLoc]) || xN[cLoc];
+		oFyNcL = parseFloat(yN[cLoc]) || yN[cLoc];
+		if (oFxNcL < oFyNcL) return -1;
+		else if (oFxNcL > oFyNcL) return 1;
+	}
+	return 0;
+}
+
+var a = [], b = [], c = [];
+for ( var i = 0; i < 1000; i++ ) {
+	a.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+	b.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+	c.push(String.fromCharCode( Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65, Math.floor(Math.random() * (90-66)) + 65 ));
+}
+for ( i = 0; i < 1000; i++ ) {
+	a.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+	b.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+	c.push(Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() + Math.floor(Math.random() * 9).toString() );
+}
+for ( i = 0; i < 1000; i++ ) {
+	a.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+	b.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+	c.push( (Math.floor(Math.random() * 12) + 1).toString() + '/' + (Math.floor(Math.random() * 28) + 1).toString() + '/' + ( 2009 - Math.floor(Math.random() * 2)) );
+}
+
+var d = new Date();
+document.write(a.sort(naturalSort)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]<BR><BR>');
+//d = new Date();
+//document.write(b.sort(naturalSort2)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]<BR><BR>');
+//d = new Date();
+//document.write(c.sort(naturalSort3)[0] + ' <BR>[' + ((new Date()).getTime() - d.getTime()) + 'ms]');
+
+</script>
+<style>*{font-family:tahoma;font-size:9px;}</style>
+</head>
+<body></body>
+</html>
diff --git a/node_modules/javascript-natural-sort/unit-tests.html b/node_modules/javascript-natural-sort/unit-tests.html
new file mode 100644
index 0000000..7b11540
--- /dev/null
+++ b/node_modules/javascript-natural-sort/unit-tests.html
@@ -0,0 +1,365 @@
+<!DOCTYPE html>
+<html>
+<head>
+	<title>js-naturalsort test suite</title>
+	<script src='http://code.jquery.com/jquery-latest.js'></script>
+	<link rel='stylesheet' href='http://code.jquery.com/qunit/git/qunit.css' type='text/css' media='screen' />
+	<script type='text/javascript' src='http://code.jquery.com/qunit/git/qunit.js'></script>
+	<script src='naturalSort.js' type='text/javascript'></script>
+	<script type='text/javascript'>
+	$(function () {
+		test('different values types', function () {
+			wrapTest(
+				['a',1],
+				[1,'a'],
+				'number always comes first');
+			wrapTest(
+				['1',1],
+				['1',1],
+				'number vs numeric string - should remain unchanged (error in chrome)');
+			wrapTest(
+				['02',3,2,'01'],
+				['01','02',2,3],
+				'padding numeric string vs number');
+		});
+		test('datetime', function () {
+			wrapTest(
+				['10/12/2008','10/11/2008','10/11/2007','10/12/2007'],
+				['10/11/2007','10/12/2007','10/11/2008','10/12/2008'],
+				'similar dates');
+			wrapTest(
+				['01/01/2008','01/10/2008','01/01/1992','01/01/1991'],
+				['01/01/1991','01/01/1992','01/01/2008','01/10/2008'],
+				'similar dates');
+			wrapTest(
+				[
+					'Wed Jan 01 2010 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Thu Dec 31 2009 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0500 (Eastern Standard Time)'
+				],[
+					'Thu Dec 31 2009 00:00:00 GMT-0800 (Pacific Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0500 (Eastern Standard Time)',
+					'Wed Jan 01 2010 00:00:00 GMT-0800 (Pacific Standard Time)'
+				], 'javascript toString(), different timezones');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010',
+					'Monday, August 2, 2010',
+					'Monday, May 3, 2010'
+				],[
+					'Monday, May 3, 2010',
+					'Saturday, July 3, 2010',
+					'Monday, August 2, 2010'
+				], 'Date.toString(), Date.toLocaleString()');
+			wrapTest(
+				[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 3 May 2010 17:45:30 GMT',
+					'Mon, 15 Jun 2009 17:45:30 GMT'
+				],[
+					'Mon, 15 Jun 2009 17:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 3 May 2010 17:45:30 GMT'
+				], 'Date.toUTCString()');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010 1:45 PM',
+					'Saturday, July 3, 2010 1:45 AM',
+					'Monday, August 2, 2010 1:45 PM',
+					'Monday, May 3, 2010 1:45 PM'
+				],[
+					'Monday, May 3, 2010 1:45 PM',
+					'Saturday, July 3, 2010 1:45 AM',
+					'Saturday, July 3, 2010 1:45 PM',
+					'Monday, August 2, 2010 1:45 PM'
+				], '');
+			wrapTest(
+				[
+					'Saturday, July 3, 2010 1:45:30 PM',
+					'Saturday, July 3, 2010 1:45:29 PM',
+					'Monday, August 2, 2010 1:45:01 PM',
+					'Monday, May 3, 2010 1:45:00 PM'
+				],[
+					'Monday, May 3, 2010 1:45:00 PM',
+					'Saturday, July 3, 2010 1:45:29 PM',
+					'Saturday, July 3, 2010 1:45:30 PM',
+					'Monday, August 2, 2010 1:45:01 PM'
+				], '');
+			wrapTest(
+				[
+					'2/15/2009 1:45 PM',
+					'1/15/2009 1:45 PM',
+					'2/15/2009 1:45 AM'
+				],[
+					'1/15/2009 1:45 PM',
+					'2/15/2009 1:45 AM',
+					'2/15/2009 1:45 PM'
+				], '');
+			wrapTest(
+				[
+					'2010-06-15T13:45:30',
+					'2009-06-15T13:45:30',
+					'2009-06-15T01:45:30.2',
+					'2009-01-15T01:45:30'
+				],[
+					'2009-01-15T01:45:30',
+					'2009-06-15T01:45:30.2',
+					'2009-06-15T13:45:30',
+					'2010-06-15T13:45:30'
+				], 'ISO8601 Dates');
+			wrapTest(
+				[
+					'2010-06-15 13:45:30',
+					'2009-06-15 13:45:30',
+					'2009-01-15 01:45:30'
+				],[
+					'2009-01-15 01:45:30',
+					'2009-06-15 13:45:30',
+					'2010-06-15 13:45:30'
+				], 'ISO8601-ish YYYY-MM-DDThh:mm:ss - which does not parse into a Date instance');
+			wrapTest(
+				[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 PDT',
+					'Mon, 15 Jun 2009 20:45:30 EST',
+				],[
+					'Mon, 15 Jun 2009 20:45:30 GMT',
+					'Mon, 15 Jun 2009 20:45:30 EST',
+					'Mon, 15 Jun 2009 20:45:30 PDT'
+				], 'RFC1123 testing different timezones');
+			wrapTest(
+				[
+					'1245098730000',
+					'14330728000',
+					'1245098728000'
+				],[
+					'14330728000',
+					'1245098728000',
+					'1245098730000'
+				], 'unix epoch, Date.getTime()');
+		});
+		test('version number strings', function () {
+			wrapTest(
+				['1.0.2','1.0.1','1.0.0','1.0.9'],
+				['1.0.0','1.0.1','1.0.2','1.0.9'],
+				'close version numbers');
+			wrapTest(
+				['1.0.03','1.0.003','1.0.002','1.0.0001'],
+				['1.0.0001','1.0.002','1.0.003','1.0.03'],
+				'multi-digit branch release');
+			wrapTest(
+				['1.1beta','1.1.2alpha3','1.0.2alpha3','1.0.2alpha1','1.0.1alpha4','2.1.2','2.1.1'],
+				['1.0.1alpha4','1.0.2alpha1','1.0.2alpha3','1.1.2alpha3','1.1beta','2.1.1','2.1.2'],
+				'close version numbers');
+			wrapTest(
+				['myrelease-1.1.3','myrelease-1.2.3','myrelease-1.1.4','myrelease-1.1.1','myrelease-1.0.5'],
+				['myrelease-1.0.5','myrelease-1.1.1','myrelease-1.1.3','myrelease-1.1.4','myrelease-1.2.3'],
+				'string first');
+		});
+		test('numerics', function () {
+			wrapTest(
+				['10',9,2,'1','4'],
+				['1',2,'4',9,'10'],
+				'string vs number');
+			wrapTest(
+				['0001','002','001'],
+				['0001','001','002'],
+				'0 left-padded numbers');
+			wrapTest(
+				[2,1,'1','0001','002','02','001'],
+				['0001','001','002','02',1,'1',2],
+				'0 left-padded numbers and regular numbers');
+			wrapTest(
+				['10.0401',10.022,10.042,'10.021999'],
+				['10.021999',10.022,'10.0401',10.042],
+				'decimal string vs decimal, different precision');
+			wrapTest(
+				['10.04',10.02,10.03,'10.01'],
+				['10.01',10.02,10.03,'10.04'],
+				'decimal string vs decimal, same precision');
+			wrapTest(
+				['10.04f','10.039F','10.038d','10.037D'],
+				['10.037D','10.038d','10.039F','10.04f'],
+				'float/decimal with \'F\' or \'D\' notation');
+			wrapTest(
+				['10.004Z','10.039T','10.038ooo','10.037g'],
+				['10.004Z','10.037g','10.038ooo','10.039T'],
+				'not foat/decimal notation');
+			wrapTest(
+				['1.528535047e5','1.528535047e7','1.52e15','1.528535047e3','1.59e-3'],
+				['1.59e-3','1.528535047e3','1.528535047e5','1.528535047e7','1.52e15'],
+				'scientific notation');
+			wrapTest(
+				['-1','-2','4','-3','0','-5'],
+				['-5','-3','-2','-1','0','4'],
+				'negative numbers as strings');
+			wrapTest(
+				[-1,'-2',4,-3,'0','-5'],
+				['-5',-3,'-2',-1,'0',4],
+				'negative numbers as strings - mixed input type, string + numeric');
+			wrapTest(
+				[-2.01,-2.1,4.144,4.1,-2.001,-5],
+				[-5,-2.1,-2.01,-2.001,4.1,4.144],
+				'negative floats - all numeric');
+		});
+		test('IP addresses', function () {
+			wrapTest(
+				[
+					'192.168.0.100',
+					'192.168.0.1',
+					'192.168.1.1',
+					'192.168.0.250',
+					'192.168.1.123',
+					'10.0.0.2',
+					'10.0.0.1'
+				],
+				[
+					'10.0.0.1',
+					'10.0.0.2',
+					'192.168.0.1',
+					'192.168.0.100',
+					'192.168.0.250',
+					'192.168.1.1',
+					'192.168.1.123'
+				]);
+		});
+		test('filenames', function () {
+			wrapTest(
+				['img12.png','img10.png','img2.png','img1.png'],
+				['img1.png','img2.png','img10.png','img12.png'],
+				'simple image filenames');
+			wrapTest(
+				['car.mov','01alpha.sgi','001alpha.sgi','my.string_41299.tif','organic2.0001.sgi'],
+				['001alpha.sgi','01alpha.sgi','car.mov','my.string_41299.tif','organic2.0001.sgi'],
+				'complex filenames');
+			wrapTest([
+					'./system/kernel/js/01_ui.core.js',
+					'./system/kernel/js/00_jquery-1.3.2.js',
+					'./system/kernel/js/02_my.desktop.js'
+				],[
+					'./system/kernel/js/00_jquery-1.3.2.js',
+					'./system/kernel/js/01_ui.core.js',
+					'./system/kernel/js/02_my.desktop.js'
+				], 'unix filenames');
+		});
+		test('space(s) as first character(s)', function () {
+			wrapTest(
+				['alpha',' 1','  3',' 2',0],
+				[0,' 1',' 2','  3','alpha']);
+		});
+		test('empty strings and space character', function () {
+			wrapTest(
+				['10023','999','',2,5.663,5.6629],
+				['',2,5.6629,5.663,'999','10023']);
+			wrapTest(
+				[0,'0',''],
+				[0,'0','']);
+		});
+		test('hex', function () {
+			wrapTest(
+				[ '0xA','0x9','0x99' ],
+				[ '0x9','0xA','0x99'],
+				'real hex numbers');
+			wrapTest(
+				[ '0xZZ','0xVVV','0xVEV','0xUU' ],
+				[ '0xUU','0xVEV','0xVVV','0xZZ' ],'fake hex numbers');
+		});
+		test('unicode', function () {
+			wrapTest(
+				[ '\u0044', '\u0055', '\u0054', '\u0043' ],
+				[ '\u0043', '\u0044', '\u0054', '\u0055' ],
+				'basic latin');
+		});
+		test('sparse array sort', function () {
+			var sarray = [3, 2]
+			sarrayOutput = [1, 2, 3];
+			sarray[10] = 1;
+			for (var i=0; i < 8; i++)
+				sarrayOutput.push(undefined);
+			wrapTest(sarray, sarrayOutput,'simple sparse array');
+		});
+		test('case insensitive support', function () {
+			naturalSort.insensitive = true;
+			wrapTest(
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				'case sensitive pre-sorted array');
+			wrapTest(
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				'case sensitive un-sorted array');
+			naturalSort.insensitive = false;
+			wrapTest(
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				'case sensitive pre-sorted array');
+			wrapTest(
+				['A', 'b', 'C', 'd', 'E', 'f'],
+				['A', 'C', 'E', 'b', 'd', 'f'],
+				'case sensitive un-sorted array');
+		});
+		test('contributed tests', function () {
+			wrapTest(
+				['T78','U17','U10','U12','U14','745','U7','01','485','S16','S2','S22','1081','S25','1055','779','776','771','44','4','87','1091','42','480','952','951','756','1000','824','770','666','633','619','1','991','77H','PIER-7','47','29','9','77L','433'],
+				['01','1','4','9','29','42','44','47','77H','77L','87','433','480','485','619','633','666','745','756','770','771','776','779','824','951','952','991','1000','1055','1081','1091','PIER-7','S2','S16','S22','S25','T78','U7','U10','U12','U14','U17'],
+				'contributed by Bob Zeiner');
+			wrapTest(
+				[
+					'FSI stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'FSI stop, Position: 6',
+					'FSI stop, Position: 6',
+					'Newsstand stop, Position: 4',
+					'Newsstand stop, Position: 4',
+					'FSI stop, Position: 5'
+				],[
+					'FSI stop, Position: 5',
+					'FSI stop, Position: 5',
+					'FSI stop, Position: 6',
+					'FSI stop, Position: 6',
+					'Mail Group stop, Position: 5',
+					'Mail Group stop, Position: 5',
+					'Newsstand stop, Position: 4',
+					'Newsstand stop, Position: 4'
+				],'contributed by Scott');
+		wrapTest(
+			[2, 10, 1, 'azd', undefined, 'asd'],
+			[1, 2, 10, 'asd', 'azd', undefined],
+			'issue #2 - undefined support - jarvinen pekka');
+		wrapTest(
+			[undefined, undefined, undefined, 1, undefined],
+			[1, undefined, undefined, undefined],
+			'issue #2 - undefined support - jarvinen pekka');
+		wrapTest(
+			['-1', '-2', '4', '-3', '0', '-5'],
+			['-5', '-3', '-2', '-1', '0', '4'],
+			'issue #3 - invalid numeric string sorting - guilermo.dev');
+		naturalSort.insensitive = true;
+		wrapTest(
+			['9','11','22','99','A','aaaa','bbbb','Aaaa','aAaa','aa','AA','Aa','aA','BB','bB','aaA','AaA','aaa'],
+			['9', '11', '22', '99', 'A', 'aa', 'AA', 'Aa', 'aA', 'aaA', 'AaA', 'aaa', 'aaaa', 'Aaaa', 'aAaa', 'BB', 'bB', 'bbbb'],
+			'issue #5 - invalid sort order - Howie Schecter');
+		naturalSort.insensitive = false;
+		wrapTest(
+			['9','11','22','99','A','aaaa','bbbb','Aaaa','aAaa','aa','AA','Aa','aA','BB','bB','aaA','AaA','aaa'],
+			['9', '11', '22', '99', 'A', 'AA', 'Aa', 'AaA', 'Aaaa', 'BB', 'aA', 'aAaa', 'aa', 'aaA', 'aaa', 'aaaa', 'bB', 'bbbb'],
+			'issue #5 - invalid sort order - Howie Schecter');
+		wrapTest(
+			['5D','1A','2D','33A','5E','33K','33D','5S','2C','5C','5F','1D','2M'],
+			['1A','1D','2C','2D','2M','5C','5D','5E','5F','5S','33A','33D','33K'],
+			'alphanumeric - number first');
+		});
+	});
+	function wrapTest(origArray, sortArray, message) {
+		deepEqual($.extend([], origArray).sort(naturalSort), sortArray, (message ? message + ' - ' : '') + QUnit.jsDump.parse(origArray));
+	}
+	</script>
+</head>
+<body>
+	<h1 id='qunit-header'>js-naturalsort test suite</h1>
+	<h2 id='qunit-banner'></h2>
+	<h2 id='qunit-userAgent'></h2>
+	<ol id='qunit-tests' />
+</body>
+</html>
diff --git a/node_modules/lodash.defaults/LICENSE b/node_modules/lodash.defaults/LICENSE
new file mode 100644
index 0000000..e0c69d5
--- /dev/null
+++ b/node_modules/lodash.defaults/LICENSE
@@ -0,0 +1,47 @@
+Copyright jQuery Foundation and other contributors <https://jquery.org/>
+
+Based on Underscore.js, copyright Jeremy Ashkenas,
+DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
+
+This software consists of voluntary contributions made by many
+individuals. For exact contribution history, see the revision history
+available at https://github.com/lodash/lodash
+
+The following license applies to all parts of this software except as
+documented below:
+
+====
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+====
+
+Copyright and related rights for sample code are waived via CC0. Sample
+code is defined as all source code displayed within the prose of the
+documentation.
+
+CC0: http://creativecommons.org/publicdomain/zero/1.0/
+
+====
+
+Files located in the node_modules and vendor directories are externally
+maintained libraries used by this software which have their own
+licenses; we recommend you read them, as their terms may differ from the
+terms above.
diff --git a/node_modules/lodash.defaults/README.md b/node_modules/lodash.defaults/README.md
new file mode 100644
index 0000000..a129849
--- /dev/null
+++ b/node_modules/lodash.defaults/README.md
@@ -0,0 +1,18 @@
+# lodash.defaults v4.2.0
+
+The [lodash](https://lodash.com/) method `_.defaults` exported as a [Node.js](https://nodejs.org/) module.
+
+## Installation
+
+Using npm:
+```bash
+$ {sudo -H} npm i -g npm
+$ npm i --save lodash.defaults
+```
+
+In Node.js:
+```js
+var defaults = require('lodash.defaults');
+```
+
+See the [documentation](https://lodash.com/docs#defaults) or [package source](https://github.com/lodash/lodash/blob/4.2.0-npm-packages/lodash.defaults) for more details.
diff --git a/node_modules/lodash.defaults/index.js b/node_modules/lodash.defaults/index.js
new file mode 100644
index 0000000..25eba9c
--- /dev/null
+++ b/node_modules/lodash.defaults/index.js
@@ -0,0 +1,668 @@
+/**
+ * lodash (Custom Build) <https://lodash.com/>
+ * Build: `lodash modularize exports="npm" -o ./`
+ * Copyright jQuery Foundation and other contributors <https://jquery.org/>
+ * Released under MIT license <https://lodash.com/license>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ */
+
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+    funcTag = '[object Function]',
+    genTag = '[object GeneratorFunction]';
+
+/** Used to detect unsigned integer values. */
+var reIsUint = /^(?:0|[1-9]\d*)$/;
+
+/**
+ * A faster alternative to `Function#apply`, this function invokes `func`
+ * with the `this` binding of `thisArg` and the arguments of `args`.
+ *
+ * @private
+ * @param {Function} func The function to invoke.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {Array} args The arguments to invoke `func` with.
+ * @returns {*} Returns the result of `func`.
+ */
+function apply(func, thisArg, args) {
+  switch (args.length) {
+    case 0: return func.call(thisArg);
+    case 1: return func.call(thisArg, args[0]);
+    case 2: return func.call(thisArg, args[0], args[1]);
+    case 3: return func.call(thisArg, args[0], args[1], args[2]);
+  }
+  return func.apply(thisArg, args);
+}
+
+/**
+ * The base implementation of `_.times` without support for iteratee shorthands
+ * or max array length checks.
+ *
+ * @private
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the array of results.
+ */
+function baseTimes(n, iteratee) {
+  var index = -1,
+      result = Array(n);
+
+  while (++index < n) {
+    result[index] = iteratee(index);
+  }
+  return result;
+}
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var objectToString = objectProto.toString;
+
+/** Built-in value references. */
+var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max;
+
+/**
+ * Creates an array of the enumerable property names of the array-like `value`.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @param {boolean} inherited Specify returning inherited property names.
+ * @returns {Array} Returns the array of property names.
+ */
+function arrayLikeKeys(value, inherited) {
+  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.
+  // Safari 9 makes `arguments.length` enumerable in strict mode.
+  var result = (isArray(value) || isArguments(value))
+    ? baseTimes(value.length, String)
+    : [];
+
+  var length = result.length,
+      skipIndexes = !!length;
+
+  for (var key in value) {
+    if ((inherited || hasOwnProperty.call(value, key)) &&
+        !(skipIndexes && (key == 'length' || isIndex(key, length)))) {
+      result.push(key);
+    }
+  }
+  return result;
+}
+
+/**
+ * Used by `_.defaults` to customize its `_.assignIn` use.
+ *
+ * @private
+ * @param {*} objValue The destination value.
+ * @param {*} srcValue The source value.
+ * @param {string} key The key of the property to assign.
+ * @param {Object} object The parent object of `objValue`.
+ * @returns {*} Returns the value to assign.
+ */
+function assignInDefaults(objValue, srcValue, key, object) {
+  if (objValue === undefined ||
+      (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
+    return srcValue;
+  }
+  return objValue;
+}
+
+/**
+ * Assigns `value` to `key` of `object` if the existing value is not equivalent
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {string} key The key of the property to assign.
+ * @param {*} value The value to assign.
+ */
+function assignValue(object, key, value) {
+  var objValue = object[key];
+  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
+      (value === undefined && !(key in object))) {
+    object[key] = value;
+  }
+}
+
+/**
+ * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+function baseKeysIn(object) {
+  if (!isObject(object)) {
+    return nativeKeysIn(object);
+  }
+  var isProto = isPrototype(object),
+      result = [];
+
+  for (var key in object) {
+    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+      result.push(key);
+    }
+  }
+  return result;
+}
+
+/**
+ * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ */
+function baseRest(func, start) {
+  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);
+  return function() {
+    var args = arguments,
+        index = -1,
+        length = nativeMax(args.length - start, 0),
+        array = Array(length);
+
+    while (++index < length) {
+      array[index] = args[start + index];
+    }
+    index = -1;
+    var otherArgs = Array(start + 1);
+    while (++index < start) {
+      otherArgs[index] = args[index];
+    }
+    otherArgs[start] = array;
+    return apply(func, this, otherArgs);
+  };
+}
+
+/**
+ * Copies properties of `source` to `object`.
+ *
+ * @private
+ * @param {Object} source The object to copy properties from.
+ * @param {Array} props The property identifiers to copy.
+ * @param {Object} [object={}] The object to copy properties to.
+ * @param {Function} [customizer] The function to customize copied values.
+ * @returns {Object} Returns `object`.
+ */
+function copyObject(source, props, object, customizer) {
+  object || (object = {});
+
+  var index = -1,
+      length = props.length;
+
+  while (++index < length) {
+    var key = props[index];
+
+    var newValue = customizer
+      ? customizer(object[key], source[key], key, object, source)
+      : undefined;
+
+    assignValue(object, key, newValue === undefined ? source[key] : newValue);
+  }
+  return object;
+}
+
+/**
+ * Creates a function like `_.assign`.
+ *
+ * @private
+ * @param {Function} assigner The function to assign values.
+ * @returns {Function} Returns the new assigner function.
+ */
+function createAssigner(assigner) {
+  return baseRest(function(object, sources) {
+    var index = -1,
+        length = sources.length,
+        customizer = length > 1 ? sources[length - 1] : undefined,
+        guard = length > 2 ? sources[2] : undefined;
+
+    customizer = (assigner.length > 3 && typeof customizer == 'function')
+      ? (length--, customizer)
+      : undefined;
+
+    if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+      customizer = length < 3 ? undefined : customizer;
+      length = 1;
+    }
+    object = Object(object);
+    while (++index < length) {
+      var source = sources[index];
+      if (source) {
+        assigner(object, source, index, customizer);
+      }
+    }
+    return object;
+  });
+}
+
+/**
+ * Checks if `value` is a valid array-like index.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
+ * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
+ */
+function isIndex(value, length) {
+  length = length == null ? MAX_SAFE_INTEGER : length;
+  return !!length &&
+    (typeof value == 'number' || reIsUint.test(value)) &&
+    (value > -1 && value % 1 == 0 && value < length);
+}
+
+/**
+ * Checks if the given arguments are from an iteratee call.
+ *
+ * @private
+ * @param {*} value The potential iteratee value argument.
+ * @param {*} index The potential iteratee index or key argument.
+ * @param {*} object The potential iteratee object argument.
+ * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
+ *  else `false`.
+ */
+function isIterateeCall(value, index, object) {
+  if (!isObject(object)) {
+    return false;
+  }
+  var type = typeof index;
+  if (type == 'number'
+        ? (isArrayLike(object) && isIndex(index, object.length))
+        : (type == 'string' && index in object)
+      ) {
+    return eq(object[index], value);
+  }
+  return false;
+}
+
+/**
+ * Checks if `value` is likely a prototype object.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
+ */
+function isPrototype(value) {
+  var Ctor = value && value.constructor,
+      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
+
+  return value === proto;
+}
+
+/**
+ * This function is like
+ * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+ * except that it includes inherited enumerable properties.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+function nativeKeysIn(object) {
+  var result = [];
+  if (object != null) {
+    for (var key in Object(object)) {
+      result.push(key);
+    }
+  }
+  return result;
+}
+
+/**
+ * Performs a
+ * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * comparison between two values to determine if they are equivalent.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'a': 1 };
+ * var other = { 'a': 1 };
+ *
+ * _.eq(object, object);
+ * // => true
+ *
+ * _.eq(object, other);
+ * // => false
+ *
+ * _.eq('a', 'a');
+ * // => true
+ *
+ * _.eq('a', Object('a'));
+ * // => false
+ *
+ * _.eq(NaN, NaN);
+ * // => true
+ */
+function eq(value, other) {
+  return value === other || (value !== value && other !== other);
+}
+
+/**
+ * Checks if `value` is likely an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArguments(function() { return arguments; }());
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+function isArguments(value) {
+  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.
+  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
+    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
+}
+
+/**
+ * Checks if `value` is classified as an `Array` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array, else `false`.
+ * @example
+ *
+ * _.isArray([1, 2, 3]);
+ * // => true
+ *
+ * _.isArray(document.body.children);
+ * // => false
+ *
+ * _.isArray('abc');
+ * // => false
+ *
+ * _.isArray(_.noop);
+ * // => false
+ */
+var isArray = Array.isArray;
+
+/**
+ * Checks if `value` is array-like. A value is considered array-like if it's
+ * not a function and has a `value.length` that's an integer greater than or
+ * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+ * @example
+ *
+ * _.isArrayLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLike(document.body.children);
+ * // => true
+ *
+ * _.isArrayLike('abc');
+ * // => true
+ *
+ * _.isArrayLike(_.noop);
+ * // => false
+ */
+function isArrayLike(value) {
+  return value != null && isLength(value.length) && !isFunction(value);
+}
+
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+function isArrayLikeObject(value) {
+  return isObjectLike(value) && isArrayLike(value);
+}
+
+/**
+ * Checks if `value` is classified as a `Function` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ *
+ * _.isFunction(/abc/);
+ * // => false
+ */
+function isFunction(value) {
+  // The use of `Object#toString` avoids issues with the `typeof` operator
+  // in Safari 8-9 which returns 'object' for typed array and other constructors.
+  var tag = isObject(value) ? objectToString.call(value) : '';
+  return tag == funcTag || tag == genTag;
+}
+
+/**
+ * Checks if `value` is a valid array-like length.
+ *
+ * **Note:** This method is loosely based on
+ * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+ * @example
+ *
+ * _.isLength(3);
+ * // => true
+ *
+ * _.isLength(Number.MIN_VALUE);
+ * // => false
+ *
+ * _.isLength(Infinity);
+ * // => false
+ *
+ * _.isLength('3');
+ * // => false
+ */
+function isLength(value) {
+  return typeof value == 'number' &&
+    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+}
+
+/**
+ * Checks if `value` is the
+ * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+ * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(_.noop);
+ * // => true
+ *
+ * _.isObject(null);
+ * // => false
+ */
+function isObject(value) {
+  var type = typeof value;
+  return !!value && (type == 'object' || type == 'function');
+}
+
+/**
+ * Checks if `value` is object-like. A value is object-like if it's not `null`
+ * and has a `typeof` result of "object".
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+ * @example
+ *
+ * _.isObjectLike({});
+ * // => true
+ *
+ * _.isObjectLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isObjectLike(_.noop);
+ * // => false
+ *
+ * _.isObjectLike(null);
+ * // => false
+ */
+function isObjectLike(value) {
+  return !!value && typeof value == 'object';
+}
+
+/**
+ * This method is like `_.assignIn` except that it accepts `customizer`
+ * which is invoked to produce the assigned values. If `customizer` returns
+ * `undefined`, assignment is handled by the method instead. The `customizer`
+ * is invoked with five arguments: (objValue, srcValue, key, object, source).
+ *
+ * **Note:** This method mutates `object`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @alias extendWith
+ * @category Object
+ * @param {Object} object The destination object.
+ * @param {...Object} sources The source objects.
+ * @param {Function} [customizer] The function to customize assigned values.
+ * @returns {Object} Returns `object`.
+ * @see _.assignWith
+ * @example
+ *
+ * function customizer(objValue, srcValue) {
+ *   return _.isUndefined(objValue) ? srcValue : objValue;
+ * }
+ *
+ * var defaults = _.partialRight(_.assignInWith, customizer);
+ *
+ * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+ * // => { 'a': 1, 'b': 2 }
+ */
+var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {
+  copyObject(source, keysIn(source), object, customizer);
+});
+
+/**
+ * Assigns own and inherited enumerable string keyed properties of source
+ * objects to the destination object for all destination properties that
+ * resolve to `undefined`. Source objects are applied from left to right.
+ * Once a property is set, additional values of the same property are ignored.
+ *
+ * **Note:** This method mutates `object`.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The destination object.
+ * @param {...Object} [sources] The source objects.
+ * @returns {Object} Returns `object`.
+ * @see _.defaultsDeep
+ * @example
+ *
+ * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+ * // => { 'a': 1, 'b': 2 }
+ */
+var defaults = baseRest(function(args) {
+  args.push(undefined, assignInDefaults);
+  return apply(assignInWith, undefined, args);
+});
+
+/**
+ * Creates an array of the own and inherited enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.0.0
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ *   this.a = 1;
+ *   this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keysIn(new Foo);
+ * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
+ */
+function keysIn(object) {
+  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
+}
+
+module.exports = defaults;
diff --git a/node_modules/lodash.defaults/package.json b/node_modules/lodash.defaults/package.json
new file mode 100644
index 0000000..3c49784
--- /dev/null
+++ b/node_modules/lodash.defaults/package.json
@@ -0,0 +1,17 @@
+{
+  "name": "lodash.defaults",
+  "version": "4.2.0",
+  "description": "The lodash method `_.defaults` exported as a module.",
+  "homepage": "https://lodash.com/",
+  "icon": "https://lodash.com/icon.svg",
+  "license": "MIT",
+  "keywords": "lodash-modularized, defaults",
+  "author": "John-David Dalton <john.david.dalton@gmail.com> (http://allyoucanleet.com/)",
+  "contributors": [
+    "John-David Dalton <john.david.dalton@gmail.com> (http://allyoucanleet.com/)",
+    "Blaine Bublitz <blaine.bublitz@gmail.com> (https://github.com/phated)",
+    "Mathias Bynens <mathias@qiwi.be> (https://mathiasbynens.be/)"
+  ],
+  "repository": "lodash/lodash",
+  "scripts": { "test": "echo \"See https://travis-ci.org/lodash/lodash-cli for testing details.\"" }
+}
diff --git a/node_modules/lodash.isarguments/LICENSE b/node_modules/lodash.isarguments/LICENSE
new file mode 100644
index 0000000..e0c69d5
--- /dev/null
+++ b/node_modules/lodash.isarguments/LICENSE
@@ -0,0 +1,47 @@
+Copyright jQuery Foundation and other contributors <https://jquery.org/>
+
+Based on Underscore.js, copyright Jeremy Ashkenas,
+DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
+
+This software consists of voluntary contributions made by many
+individuals. For exact contribution history, see the revision history
+available at https://github.com/lodash/lodash
+
+The following license applies to all parts of this software except as
+documented below:
+
+====
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+====
+
+Copyright and related rights for sample code are waived via CC0. Sample
+code is defined as all source code displayed within the prose of the
+documentation.
+
+CC0: http://creativecommons.org/publicdomain/zero/1.0/
+
+====
+
+Files located in the node_modules and vendor directories are externally
+maintained libraries used by this software which have their own
+licenses; we recommend you read them, as their terms may differ from the
+terms above.
diff --git a/node_modules/lodash.isarguments/README.md b/node_modules/lodash.isarguments/README.md
new file mode 100644
index 0000000..eb95fe1
--- /dev/null
+++ b/node_modules/lodash.isarguments/README.md
@@ -0,0 +1,18 @@
+# lodash.isarguments v3.1.0
+
+The [lodash](https://lodash.com/) method `_.isArguments` exported as a [Node.js](https://nodejs.org/) module.
+
+## Installation
+
+Using npm:
+```bash
+$ {sudo -H} npm i -g npm
+$ npm i --save lodash.isarguments
+```
+
+In Node.js:
+```js
+var isArguments = require('lodash.isarguments');
+```
+
+See the [documentation](https://lodash.com/docs#isArguments) or [package source](https://github.com/lodash/lodash/blob/3.1.0-npm-packages/lodash.isarguments) for more details.
diff --git a/node_modules/lodash.isarguments/index.js b/node_modules/lodash.isarguments/index.js
new file mode 100644
index 0000000..042dac5
--- /dev/null
+++ b/node_modules/lodash.isarguments/index.js
@@ -0,0 +1,229 @@
+/**
+ * lodash (Custom Build) <https://lodash.com/>
+ * Build: `lodash modularize exports="npm" -o ./`
+ * Copyright jQuery Foundation and other contributors <https://jquery.org/>
+ * Released under MIT license <https://lodash.com/license>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ */
+
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+    funcTag = '[object Function]',
+    genTag = '[object GeneratorFunction]';
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var objectToString = objectProto.toString;
+
+/** Built-in value references. */
+var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+
+/**
+ * Checks if `value` is likely an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArguments(function() { return arguments; }());
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+function isArguments(value) {
+  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.
+  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&
+    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);
+}
+
+/**
+ * Checks if `value` is array-like. A value is considered array-like if it's
+ * not a function and has a `value.length` that's an integer greater than or
+ * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+ * @example
+ *
+ * _.isArrayLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLike(document.body.children);
+ * // => true
+ *
+ * _.isArrayLike('abc');
+ * // => true
+ *
+ * _.isArrayLike(_.noop);
+ * // => false
+ */
+function isArrayLike(value) {
+  return value != null && isLength(value.length) && !isFunction(value);
+}
+
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+function isArrayLikeObject(value) {
+  return isObjectLike(value) && isArrayLike(value);
+}
+
+/**
+ * Checks if `value` is classified as a `Function` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ *
+ * _.isFunction(/abc/);
+ * // => false
+ */
+function isFunction(value) {
+  // The use of `Object#toString` avoids issues with the `typeof` operator
+  // in Safari 8-9 which returns 'object' for typed array and other constructors.
+  var tag = isObject(value) ? objectToString.call(value) : '';
+  return tag == funcTag || tag == genTag;
+}
+
+/**
+ * Checks if `value` is a valid array-like length.
+ *
+ * **Note:** This method is loosely based on
+ * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+ * @example
+ *
+ * _.isLength(3);
+ * // => true
+ *
+ * _.isLength(Number.MIN_VALUE);
+ * // => false
+ *
+ * _.isLength(Infinity);
+ * // => false
+ *
+ * _.isLength('3');
+ * // => false
+ */
+function isLength(value) {
+  return typeof value == 'number' &&
+    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+}
+
+/**
+ * Checks if `value` is the
+ * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+ * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(_.noop);
+ * // => true
+ *
+ * _.isObject(null);
+ * // => false
+ */
+function isObject(value) {
+  var type = typeof value;
+  return !!value && (type == 'object' || type == 'function');
+}
+
+/**
+ * Checks if `value` is object-like. A value is object-like if it's not `null`
+ * and has a `typeof` result of "object".
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+ * @example
+ *
+ * _.isObjectLike({});
+ * // => true
+ *
+ * _.isObjectLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isObjectLike(_.noop);
+ * // => false
+ *
+ * _.isObjectLike(null);
+ * // => false
+ */
+function isObjectLike(value) {
+  return !!value && typeof value == 'object';
+}
+
+module.exports = isArguments;
diff --git a/node_modules/lodash.isarguments/package.json b/node_modules/lodash.isarguments/package.json
new file mode 100644
index 0000000..3d32280
--- /dev/null
+++ b/node_modules/lodash.isarguments/package.json
@@ -0,0 +1,17 @@
+{
+  "name": "lodash.isarguments",
+  "version": "3.1.0",
+  "description": "The lodash method `_.isArguments` exported as a module.",
+  "homepage": "https://lodash.com/",
+  "icon": "https://lodash.com/icon.svg",
+  "license": "MIT",
+  "keywords": "lodash-modularized, isarguments",
+  "author": "John-David Dalton <john.david.dalton@gmail.com> (http://allyoucanleet.com/)",
+  "contributors": [
+    "John-David Dalton <john.david.dalton@gmail.com> (http://allyoucanleet.com/)",
+    "Blaine Bublitz <blaine.bublitz@gmail.com> (https://github.com/phated)",
+    "Mathias Bynens <mathias@qiwi.be> (https://mathiasbynens.be/)"
+  ],
+  "repository": "lodash/lodash",
+  "scripts": { "test": "echo \"See https://travis-ci.org/lodash/lodash-cli for testing details.\"" }
+}
diff --git a/node_modules/luxon/LICENSE.md b/node_modules/luxon/LICENSE.md
new file mode 100644
index 0000000..2d560a6
--- /dev/null
+++ b/node_modules/luxon/LICENSE.md
@@ -0,0 +1,7 @@
+Copyright 2019 JS Foundation and other contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/luxon/README.md b/node_modules/luxon/README.md
new file mode 100644
index 0000000..3fcacd7
--- /dev/null
+++ b/node_modules/luxon/README.md
@@ -0,0 +1,55 @@
+# Luxon
+
+[![MIT License][license-image]][license] [![Build Status][github-action-image]][github-action-url] [![NPM version][npm-version-image]][npm-url] [![Coverage Status][test-coverage-image]][test-coverage-url] [![PRs welcome][contributing-image]][contributing-url]
+
+Luxon is a library for working with dates and times in JavaScript.
+
+```js
+DateTime.now().setZone("America/New_York").minus({ weeks: 1 }).endOf("day").toISO();
+```
+
+## Upgrading to 3.0
+
+[Guide](https://moment.github.io/luxon/#upgrading)
+
+## Features
+ * DateTime, Duration, and Interval types.
+ * Immutable, chainable, unambiguous API.
+ * Parsing and formatting for common and custom formats.
+ * Native time zone and Intl support (no locale or tz files).
+
+## Download/install
+
+[Download/install instructions](https://moment.github.io/luxon/#/install)
+
+## Documentation
+
+* [General documentation](https://moment.github.io/luxon/#/?id=luxon)
+* [API docs](https://moment.github.io/luxon/api-docs/index.html)
+* [Quick tour](https://moment.github.io/luxon/#/tour)
+* [For Moment users](https://moment.github.io/luxon/#/moment)
+* [Why does Luxon exist?](https://moment.github.io/luxon/#/why)
+* [A quick demo](https://moment.github.io/luxon/demo/global.html)
+
+## Development
+
+See [contributing](CONTRIBUTING.md).
+
+![Phasers to stun][phasers-image]
+
+[license-image]: https://img.shields.io/badge/license-MIT-blue.svg
+[license]: LICENSE.md
+
+[github-action-image]: https://github.com/moment/luxon/actions/workflows/test.yml/badge.svg
+[github-action-url]: https://github.com/moment/luxon/actions/workflows/test.yml
+
+[npm-url]: https://npmjs.org/package/luxon
+[npm-version-image]: https://badge.fury.io/js/luxon.svg
+
+[test-coverage-url]: https://codecov.io/gh/moment/luxon
+[test-coverage-image]: https://codecov.io/gh/moment/luxon/branch/master/graph/badge.svg
+
+[contributing-url]: https://github.com/moment/luxon/blob/master/CONTRIBUTING.md
+[contributing-image]: https://img.shields.io/badge/PRs-welcome-brightgreen.svg
+
+[phasers-image]: https://img.shields.io/badge/phasers-stun-brightgreen.svg
diff --git a/node_modules/luxon/build/amd/luxon.js b/node_modules/luxon/build/amd/luxon.js
new file mode 100644
index 0000000..dcdb4f9
--- /dev/null
+++ b/node_modules/luxon/build/amd/luxon.js
@@ -0,0 +1,8741 @@
+define(['exports'], (function (exports) { 'use strict';
+
+  function _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, _toPropertyKey(descriptor.key), descriptor);
+    }
+  }
+  function _createClass(Constructor, protoProps, staticProps) {
+    if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+    if (staticProps) _defineProperties(Constructor, staticProps);
+    Object.defineProperty(Constructor, "prototype", {
+      writable: false
+    });
+    return Constructor;
+  }
+  function _extends() {
+    _extends = Object.assign ? Object.assign.bind() : 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);
+  }
+  function _inheritsLoose(subClass, superClass) {
+    subClass.prototype = Object.create(superClass.prototype);
+    subClass.prototype.constructor = subClass;
+    _setPrototypeOf(subClass, superClass);
+  }
+  function _getPrototypeOf(o) {
+    _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {
+      return o.__proto__ || Object.getPrototypeOf(o);
+    };
+    return _getPrototypeOf(o);
+  }
+  function _setPrototypeOf(o, p) {
+    _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {
+      o.__proto__ = p;
+      return o;
+    };
+    return _setPrototypeOf(o, p);
+  }
+  function _isNativeReflectConstruct() {
+    if (typeof Reflect === "undefined" || !Reflect.construct) return false;
+    if (Reflect.construct.sham) return false;
+    if (typeof Proxy === "function") return true;
+    try {
+      Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+      return true;
+    } catch (e) {
+      return false;
+    }
+  }
+  function _construct(Parent, args, Class) {
+    if (_isNativeReflectConstruct()) {
+      _construct = Reflect.construct.bind();
+    } else {
+      _construct = function _construct(Parent, args, Class) {
+        var a = [null];
+        a.push.apply(a, args);
+        var Constructor = Function.bind.apply(Parent, a);
+        var instance = new Constructor();
+        if (Class) _setPrototypeOf(instance, Class.prototype);
+        return instance;
+      };
+    }
+    return _construct.apply(null, arguments);
+  }
+  function _isNativeFunction(fn) {
+    return Function.toString.call(fn).indexOf("[native code]") !== -1;
+  }
+  function _wrapNativeSuper(Class) {
+    var _cache = typeof Map === "function" ? new Map() : undefined;
+    _wrapNativeSuper = function _wrapNativeSuper(Class) {
+      if (Class === null || !_isNativeFunction(Class)) return Class;
+      if (typeof Class !== "function") {
+        throw new TypeError("Super expression must either be null or a function");
+      }
+      if (typeof _cache !== "undefined") {
+        if (_cache.has(Class)) return _cache.get(Class);
+        _cache.set(Class, Wrapper);
+      }
+      function Wrapper() {
+        return _construct(Class, arguments, _getPrototypeOf(this).constructor);
+      }
+      Wrapper.prototype = Object.create(Class.prototype, {
+        constructor: {
+          value: Wrapper,
+          enumerable: false,
+          writable: true,
+          configurable: true
+        }
+      });
+      return _setPrototypeOf(Wrapper, Class);
+    };
+    return _wrapNativeSuper(Class);
+  }
+  function _objectWithoutPropertiesLoose(source, excluded) {
+    if (source == null) return {};
+    var target = {};
+    var sourceKeys = Object.keys(source);
+    var key, i;
+    for (i = 0; i < sourceKeys.length; i++) {
+      key = sourceKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      target[key] = source[key];
+    }
+    return target;
+  }
+  function _unsupportedIterableToArray(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _arrayLikeToArray(o, minLen);
+    var n = Object.prototype.toString.call(o).slice(8, -1);
+    if (n === "Object" && o.constructor) n = o.constructor.name;
+    if (n === "Map" || n === "Set") return Array.from(o);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
+  }
+  function _arrayLikeToArray(arr, len) {
+    if (len == null || len > arr.length) len = arr.length;
+    for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
+    return arr2;
+  }
+  function _createForOfIteratorHelperLoose(o, allowArrayLike) {
+    var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+    if (it) return (it = it.call(o)).next.bind(it);
+    if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+      if (it) o = it;
+      var i = 0;
+      return function () {
+        if (i >= o.length) return {
+          done: true
+        };
+        return {
+          done: false,
+          value: o[i++]
+        };
+      };
+    }
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+  function _toPrimitive(input, hint) {
+    if (typeof input !== "object" || input === null) return input;
+    var prim = input[Symbol.toPrimitive];
+    if (prim !== undefined) {
+      var res = prim.call(input, hint || "default");
+      if (typeof res !== "object") return res;
+      throw new TypeError("@@toPrimitive must return a primitive value.");
+    }
+    return (hint === "string" ? String : Number)(input);
+  }
+  function _toPropertyKey(arg) {
+    var key = _toPrimitive(arg, "string");
+    return typeof key === "symbol" ? key : String(key);
+  }
+
+  // these aren't really private, but nor are they really useful to document
+  /**
+   * @private
+   */
+  var LuxonError = /*#__PURE__*/function (_Error) {
+    _inheritsLoose(LuxonError, _Error);
+    function LuxonError() {
+      return _Error.apply(this, arguments) || this;
+    }
+    return LuxonError;
+  }( /*#__PURE__*/_wrapNativeSuper(Error));
+  /**
+   * @private
+   */
+  var InvalidDateTimeError = /*#__PURE__*/function (_LuxonError) {
+    _inheritsLoose(InvalidDateTimeError, _LuxonError);
+    function InvalidDateTimeError(reason) {
+      return _LuxonError.call(this, "Invalid DateTime: " + reason.toMessage()) || this;
+    }
+    return InvalidDateTimeError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidIntervalError = /*#__PURE__*/function (_LuxonError2) {
+    _inheritsLoose(InvalidIntervalError, _LuxonError2);
+    function InvalidIntervalError(reason) {
+      return _LuxonError2.call(this, "Invalid Interval: " + reason.toMessage()) || this;
+    }
+    return InvalidIntervalError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidDurationError = /*#__PURE__*/function (_LuxonError3) {
+    _inheritsLoose(InvalidDurationError, _LuxonError3);
+    function InvalidDurationError(reason) {
+      return _LuxonError3.call(this, "Invalid Duration: " + reason.toMessage()) || this;
+    }
+    return InvalidDurationError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var ConflictingSpecificationError = /*#__PURE__*/function (_LuxonError4) {
+    _inheritsLoose(ConflictingSpecificationError, _LuxonError4);
+    function ConflictingSpecificationError() {
+      return _LuxonError4.apply(this, arguments) || this;
+    }
+    return ConflictingSpecificationError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidUnitError = /*#__PURE__*/function (_LuxonError5) {
+    _inheritsLoose(InvalidUnitError, _LuxonError5);
+    function InvalidUnitError(unit) {
+      return _LuxonError5.call(this, "Invalid unit " + unit) || this;
+    }
+    return InvalidUnitError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidArgumentError = /*#__PURE__*/function (_LuxonError6) {
+    _inheritsLoose(InvalidArgumentError, _LuxonError6);
+    function InvalidArgumentError() {
+      return _LuxonError6.apply(this, arguments) || this;
+    }
+    return InvalidArgumentError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var ZoneIsAbstractError = /*#__PURE__*/function (_LuxonError7) {
+    _inheritsLoose(ZoneIsAbstractError, _LuxonError7);
+    function ZoneIsAbstractError() {
+      return _LuxonError7.call(this, "Zone is an abstract class") || this;
+    }
+    return ZoneIsAbstractError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+
+  var n = "numeric",
+    s = "short",
+    l = "long";
+  var DATE_SHORT = {
+    year: n,
+    month: n,
+    day: n
+  };
+  var DATE_MED = {
+    year: n,
+    month: s,
+    day: n
+  };
+  var DATE_MED_WITH_WEEKDAY = {
+    year: n,
+    month: s,
+    day: n,
+    weekday: s
+  };
+  var DATE_FULL = {
+    year: n,
+    month: l,
+    day: n
+  };
+  var DATE_HUGE = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l
+  };
+  var TIME_SIMPLE = {
+    hour: n,
+    minute: n
+  };
+  var TIME_WITH_SECONDS = {
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var TIME_WITH_SHORT_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: s
+  };
+  var TIME_WITH_LONG_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: l
+  };
+  var TIME_24_SIMPLE = {
+    hour: n,
+    minute: n,
+    hourCycle: "h23"
+  };
+  var TIME_24_WITH_SECONDS = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23"
+  };
+  var TIME_24_WITH_SHORT_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23",
+    timeZoneName: s
+  };
+  var TIME_24_WITH_LONG_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23",
+    timeZoneName: l
+  };
+  var DATETIME_SHORT = {
+    year: n,
+    month: n,
+    day: n,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_SHORT_WITH_SECONDS = {
+    year: n,
+    month: n,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var DATETIME_MED = {
+    year: n,
+    month: s,
+    day: n,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_MED_WITH_SECONDS = {
+    year: n,
+    month: s,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var DATETIME_MED_WITH_WEEKDAY = {
+    year: n,
+    month: s,
+    day: n,
+    weekday: s,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_FULL = {
+    year: n,
+    month: l,
+    day: n,
+    hour: n,
+    minute: n,
+    timeZoneName: s
+  };
+  var DATETIME_FULL_WITH_SECONDS = {
+    year: n,
+    month: l,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: s
+  };
+  var DATETIME_HUGE = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l,
+    hour: n,
+    minute: n,
+    timeZoneName: l
+  };
+  var DATETIME_HUGE_WITH_SECONDS = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l,
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: l
+  };
+
+  /**
+   * @interface
+   */
+  var Zone = /*#__PURE__*/function () {
+    function Zone() {}
+    var _proto = Zone.prototype;
+    /**
+     * Returns the offset's common name (such as EST) at the specified timestamp
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to get the name
+     * @param {Object} opts - Options to affect the format
+     * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+     * @param {string} opts.locale - What locale to return the offset name in.
+     * @return {string}
+     */
+    _proto.offsetName = function offsetName(ts, opts) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset(ts, format) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to compute the offset
+     * @return {number}
+     */;
+    _proto.offset = function offset(ts) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone
+     * @abstract
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return whether this Zone is valid.
+     * @abstract
+     * @type {boolean}
+     */;
+    _createClass(Zone, [{
+      key: "type",
+      get:
+      /**
+       * The type of zone
+       * @abstract
+       * @type {string}
+       */
+      function get() {
+        throw new ZoneIsAbstractError();
+      }
+
+      /**
+       * The name of this zone.
+       * @abstract
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+
+      /**
+       * The IANA name of this zone.
+       * Defaults to `name` if not overwritten by a subclass.
+       * @abstract
+       * @type {string}
+       */
+    }, {
+      key: "ianaName",
+      get: function get() {
+        return this.name;
+      }
+
+      /**
+       * Returns whether the offset is known to be fixed for the whole year.
+       * @abstract
+       * @type {boolean}
+       */
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+    }]);
+    return Zone;
+  }();
+
+  var singleton$1 = null;
+
+  /**
+   * Represents the local zone for this JavaScript environment.
+   * @implements {Zone}
+   */
+  var SystemZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(SystemZone, _Zone);
+    function SystemZone() {
+      return _Zone.apply(this, arguments) || this;
+    }
+    var _proto = SystemZone.prototype;
+    /** @override **/
+    _proto.offsetName = function offsetName(ts, _ref) {
+      var format = _ref.format,
+        locale = _ref.locale;
+      return parseZoneInfo(ts, format, locale);
+    }
+
+    /** @override **/;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.offset(ts), format);
+    }
+
+    /** @override **/;
+    _proto.offset = function offset(ts) {
+      return -new Date(ts).getTimezoneOffset();
+    }
+
+    /** @override **/;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "system";
+    }
+
+    /** @override **/;
+    _createClass(SystemZone, [{
+      key: "type",
+      get: /** @override **/
+      function get() {
+        return "system";
+      }
+
+      /** @override **/
+    }, {
+      key: "name",
+      get: function get() {
+        return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+      }
+
+      /** @override **/
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return true;
+      }
+    }], [{
+      key: "instance",
+      get:
+      /**
+       * Get a singleton instance of the local zone
+       * @return {SystemZone}
+       */
+      function get() {
+        if (singleton$1 === null) {
+          singleton$1 = new SystemZone();
+        }
+        return singleton$1;
+      }
+    }]);
+    return SystemZone;
+  }(Zone);
+
+  var dtfCache = new Map();
+  function makeDTF(zoneName) {
+    var dtf = dtfCache.get(zoneName);
+    if (dtf === undefined) {
+      dtf = new Intl.DateTimeFormat("en-US", {
+        hour12: false,
+        timeZone: zoneName,
+        year: "numeric",
+        month: "2-digit",
+        day: "2-digit",
+        hour: "2-digit",
+        minute: "2-digit",
+        second: "2-digit",
+        era: "short"
+      });
+      dtfCache.set(zoneName, dtf);
+    }
+    return dtf;
+  }
+  var typeToPos = {
+    year: 0,
+    month: 1,
+    day: 2,
+    era: 3,
+    hour: 4,
+    minute: 5,
+    second: 6
+  };
+  function hackyOffset(dtf, date) {
+    var formatted = dtf.format(date).replace(/\u200E/g, ""),
+      parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+      fMonth = parsed[1],
+      fDay = parsed[2],
+      fYear = parsed[3],
+      fadOrBc = parsed[4],
+      fHour = parsed[5],
+      fMinute = parsed[6],
+      fSecond = parsed[7];
+    return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+  }
+  function partsOffset(dtf, date) {
+    var formatted = dtf.formatToParts(date);
+    var filled = [];
+    for (var i = 0; i < formatted.length; i++) {
+      var _formatted$i = formatted[i],
+        type = _formatted$i.type,
+        value = _formatted$i.value;
+      var pos = typeToPos[type];
+      if (type === "era") {
+        filled[pos] = value;
+      } else if (!isUndefined(pos)) {
+        filled[pos] = parseInt(value, 10);
+      }
+    }
+    return filled;
+  }
+  var ianaZoneCache = new Map();
+  /**
+   * A zone identified by an IANA identifier, like America/New_York
+   * @implements {Zone}
+   */
+  var IANAZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(IANAZone, _Zone);
+    /**
+     * @param {string} name - Zone name
+     * @return {IANAZone}
+     */
+    IANAZone.create = function create(name) {
+      var zone = ianaZoneCache.get(name);
+      if (zone === undefined) {
+        ianaZoneCache.set(name, zone = new IANAZone(name));
+      }
+      return zone;
+    }
+
+    /**
+     * Reset local caches. Should only be necessary in testing scenarios.
+     * @return {void}
+     */;
+    IANAZone.resetCache = function resetCache() {
+      ianaZoneCache.clear();
+      dtfCache.clear();
+    }
+
+    /**
+     * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+     * @param {string} s - The string to check validity on
+     * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+     * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+     * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+     * @return {boolean}
+     */;
+    IANAZone.isValidSpecifier = function isValidSpecifier(s) {
+      return this.isValidZone(s);
+    }
+
+    /**
+     * Returns whether the provided string identifies a real zone
+     * @param {string} zone - The string to check
+     * @example IANAZone.isValidZone("America/New_York") //=> true
+     * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+     * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+     * @return {boolean}
+     */;
+    IANAZone.isValidZone = function isValidZone(zone) {
+      if (!zone) {
+        return false;
+      }
+      try {
+        new Intl.DateTimeFormat("en-US", {
+          timeZone: zone
+        }).format();
+        return true;
+      } catch (e) {
+        return false;
+      }
+    };
+    function IANAZone(name) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /** @private **/
+      _this.zoneName = name;
+      /** @private **/
+      _this.valid = IANAZone.isValidZone(name);
+      return _this;
+    }
+
+    /**
+     * The type of zone. `iana` for all instances of `IANAZone`.
+     * @override
+     * @type {string}
+     */
+    var _proto = IANAZone.prototype;
+    /**
+     * Returns the offset's common name (such as EST) at the specified timestamp
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the name
+     * @param {Object} opts - Options to affect the format
+     * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+     * @param {string} opts.locale - What locale to return the offset name in.
+     * @return {string}
+     */
+    _proto.offsetName = function offsetName(ts, _ref) {
+      var format = _ref.format,
+        locale = _ref.locale;
+      return parseZoneInfo(ts, format, locale, this.name);
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.offset(ts), format);
+    }
+
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to compute the offset
+     * @return {number}
+     */;
+    _proto.offset = function offset(ts) {
+      if (!this.valid) return NaN;
+      var date = new Date(ts);
+      if (isNaN(date)) return NaN;
+      var dtf = makeDTF(this.name);
+      var _ref2 = dtf.formatToParts ? partsOffset(dtf, date) : hackyOffset(dtf, date),
+        year = _ref2[0],
+        month = _ref2[1],
+        day = _ref2[2],
+        adOrBc = _ref2[3],
+        hour = _ref2[4],
+        minute = _ref2[5],
+        second = _ref2[6];
+      if (adOrBc === "BC") {
+        year = -Math.abs(year) + 1;
+      }
+
+      // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+      var adjustedHour = hour === 24 ? 0 : hour;
+      var asUTC = objToLocalTS({
+        year: year,
+        month: month,
+        day: day,
+        hour: adjustedHour,
+        minute: minute,
+        second: second,
+        millisecond: 0
+      });
+      var asTS = +date;
+      var over = asTS % 1000;
+      asTS -= over >= 0 ? over : 1000 + over;
+      return (asUTC - asTS) / (60 * 1000);
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone
+     * @override
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "iana" && otherZone.name === this.name;
+    }
+
+    /**
+     * Return whether this Zone is valid.
+     * @override
+     * @type {boolean}
+     */;
+    _createClass(IANAZone, [{
+      key: "type",
+      get: function get() {
+        return "iana";
+      }
+
+      /**
+       * The name of this zone (i.e. the IANA zone name).
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        return this.zoneName;
+      }
+
+      /**
+       * Returns whether the offset is known to be fixed for the whole year:
+       * Always returns false for all IANA zones.
+       * @override
+       * @type {boolean}
+       */
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.valid;
+      }
+    }]);
+    return IANAZone;
+  }(Zone);
+
+  var _excluded = ["base"],
+    _excluded2 = ["padTo", "floor"];
+
+  // todo - remap caching
+
+  var intlLFCache = {};
+  function getCachedLF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var dtf = intlLFCache[key];
+    if (!dtf) {
+      dtf = new Intl.ListFormat(locString, opts);
+      intlLFCache[key] = dtf;
+    }
+    return dtf;
+  }
+  var intlDTCache = new Map();
+  function getCachedDTF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var dtf = intlDTCache.get(key);
+    if (dtf === undefined) {
+      dtf = new Intl.DateTimeFormat(locString, opts);
+      intlDTCache.set(key, dtf);
+    }
+    return dtf;
+  }
+  var intlNumCache = new Map();
+  function getCachedINF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var inf = intlNumCache.get(key);
+    if (inf === undefined) {
+      inf = new Intl.NumberFormat(locString, opts);
+      intlNumCache.set(key, inf);
+    }
+    return inf;
+  }
+  var intlRelCache = new Map();
+  function getCachedRTF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _opts = opts;
+      _opts.base;
+      var cacheKeyOpts = _objectWithoutPropertiesLoose(_opts, _excluded); // exclude `base` from the options
+    var key = JSON.stringify([locString, cacheKeyOpts]);
+    var inf = intlRelCache.get(key);
+    if (inf === undefined) {
+      inf = new Intl.RelativeTimeFormat(locString, opts);
+      intlRelCache.set(key, inf);
+    }
+    return inf;
+  }
+  var sysLocaleCache = null;
+  function systemLocale() {
+    if (sysLocaleCache) {
+      return sysLocaleCache;
+    } else {
+      sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+      return sysLocaleCache;
+    }
+  }
+  var intlResolvedOptionsCache = new Map();
+  function getCachedIntResolvedOptions(locString) {
+    var opts = intlResolvedOptionsCache.get(locString);
+    if (opts === undefined) {
+      opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+      intlResolvedOptionsCache.set(locString, opts);
+    }
+    return opts;
+  }
+  var weekInfoCache = new Map();
+  function getCachedWeekInfo(locString) {
+    var data = weekInfoCache.get(locString);
+    if (!data) {
+      var locale = new Intl.Locale(locString);
+      // browsers currently implement this as a property, but spec says it should be a getter function
+      data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+      // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+      if (!("minimalDays" in data)) {
+        data = _extends({}, fallbackWeekSettings, data);
+      }
+      weekInfoCache.set(locString, data);
+    }
+    return data;
+  }
+  function parseLocaleString(localeStr) {
+    // I really want to avoid writing a BCP 47 parser
+    // see, e.g. https://github.com/wooorm/bcp-47
+    // Instead, we'll do this:
+
+    // a) if the string has no -u extensions, just leave it alone
+    // b) if it does, use Intl to resolve everything
+    // c) if Intl fails, try again without the -u
+
+    // private subtags and unicode subtags have ordering requirements,
+    // and we're not properly parsing this, so just strip out the
+    // private ones if they exist.
+    var xIndex = localeStr.indexOf("-x-");
+    if (xIndex !== -1) {
+      localeStr = localeStr.substring(0, xIndex);
+    }
+    var uIndex = localeStr.indexOf("-u-");
+    if (uIndex === -1) {
+      return [localeStr];
+    } else {
+      var options;
+      var selectedStr;
+      try {
+        options = getCachedDTF(localeStr).resolvedOptions();
+        selectedStr = localeStr;
+      } catch (e) {
+        var smaller = localeStr.substring(0, uIndex);
+        options = getCachedDTF(smaller).resolvedOptions();
+        selectedStr = smaller;
+      }
+      var _options = options,
+        numberingSystem = _options.numberingSystem,
+        calendar = _options.calendar;
+      return [selectedStr, numberingSystem, calendar];
+    }
+  }
+  function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+    if (outputCalendar || numberingSystem) {
+      if (!localeStr.includes("-u-")) {
+        localeStr += "-u";
+      }
+      if (outputCalendar) {
+        localeStr += "-ca-" + outputCalendar;
+      }
+      if (numberingSystem) {
+        localeStr += "-nu-" + numberingSystem;
+      }
+      return localeStr;
+    } else {
+      return localeStr;
+    }
+  }
+  function mapMonths(f) {
+    var ms = [];
+    for (var i = 1; i <= 12; i++) {
+      var dt = DateTime.utc(2009, i, 1);
+      ms.push(f(dt));
+    }
+    return ms;
+  }
+  function mapWeekdays(f) {
+    var ms = [];
+    for (var i = 1; i <= 7; i++) {
+      var dt = DateTime.utc(2016, 11, 13 + i);
+      ms.push(f(dt));
+    }
+    return ms;
+  }
+  function listStuff(loc, length, englishFn, intlFn) {
+    var mode = loc.listingMode();
+    if (mode === "error") {
+      return null;
+    } else if (mode === "en") {
+      return englishFn(length);
+    } else {
+      return intlFn(length);
+    }
+  }
+  function supportsFastNumbers(loc) {
+    if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+      return false;
+    } else {
+      return loc.numberingSystem === "latn" || !loc.locale || loc.locale.startsWith("en") || getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn";
+    }
+  }
+
+  /**
+   * @private
+   */
+  var PolyNumberFormatter = /*#__PURE__*/function () {
+    function PolyNumberFormatter(intl, forceSimple, opts) {
+      this.padTo = opts.padTo || 0;
+      this.floor = opts.floor || false;
+      opts.padTo;
+        opts.floor;
+        var otherOpts = _objectWithoutPropertiesLoose(opts, _excluded2);
+      if (!forceSimple || Object.keys(otherOpts).length > 0) {
+        var intlOpts = _extends({
+          useGrouping: false
+        }, opts);
+        if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+        this.inf = getCachedINF(intl, intlOpts);
+      }
+    }
+    var _proto = PolyNumberFormatter.prototype;
+    _proto.format = function format(i) {
+      if (this.inf) {
+        var fixed = this.floor ? Math.floor(i) : i;
+        return this.inf.format(fixed);
+      } else {
+        // to match the browser's numberformatter defaults
+        var _fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+        return padStart(_fixed, this.padTo);
+      }
+    };
+    return PolyNumberFormatter;
+  }();
+  /**
+   * @private
+   */
+  var PolyDateFormatter = /*#__PURE__*/function () {
+    function PolyDateFormatter(dt, intl, opts) {
+      this.opts = opts;
+      this.originalZone = undefined;
+      var z = undefined;
+      if (this.opts.timeZone) {
+        // Don't apply any workarounds if a timeZone is explicitly provided in opts
+        this.dt = dt;
+      } else if (dt.zone.type === "fixed") {
+        // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+        // That is why fixed-offset TZ is set to that unless it is:
+        // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+        // 2. Unsupported by the browser:
+        //    - some do not support Etc/
+        //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+        var gmtOffset = -1 * (dt.offset / 60);
+        var offsetZ = gmtOffset >= 0 ? "Etc/GMT+" + gmtOffset : "Etc/GMT" + gmtOffset;
+        if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+          z = offsetZ;
+          this.dt = dt;
+        } else {
+          // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+          // we manually apply the offset and substitute the zone as needed.
+          z = "UTC";
+          this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({
+            minutes: dt.offset
+          });
+          this.originalZone = dt.zone;
+        }
+      } else if (dt.zone.type === "system") {
+        this.dt = dt;
+      } else if (dt.zone.type === "iana") {
+        this.dt = dt;
+        z = dt.zone.name;
+      } else {
+        // Custom zones can have any offset / offsetName so we just manually
+        // apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.setZone("UTC").plus({
+          minutes: dt.offset
+        });
+        this.originalZone = dt.zone;
+      }
+      var intlOpts = _extends({}, this.opts);
+      intlOpts.timeZone = intlOpts.timeZone || z;
+      this.dtf = getCachedDTF(intl, intlOpts);
+    }
+    var _proto2 = PolyDateFormatter.prototype;
+    _proto2.format = function format() {
+      if (this.originalZone) {
+        // If we have to substitute in the actual zone name, we have to use
+        // formatToParts so that the timezone can be replaced.
+        return this.formatToParts().map(function (_ref) {
+          var value = _ref.value;
+          return value;
+        }).join("");
+      }
+      return this.dtf.format(this.dt.toJSDate());
+    };
+    _proto2.formatToParts = function formatToParts() {
+      var _this = this;
+      var parts = this.dtf.formatToParts(this.dt.toJSDate());
+      if (this.originalZone) {
+        return parts.map(function (part) {
+          if (part.type === "timeZoneName") {
+            var offsetName = _this.originalZone.offsetName(_this.dt.ts, {
+              locale: _this.dt.locale,
+              format: _this.opts.timeZoneName
+            });
+            return _extends({}, part, {
+              value: offsetName
+            });
+          } else {
+            return part;
+          }
+        });
+      }
+      return parts;
+    };
+    _proto2.resolvedOptions = function resolvedOptions() {
+      return this.dtf.resolvedOptions();
+    };
+    return PolyDateFormatter;
+  }();
+  /**
+   * @private
+   */
+  var PolyRelFormatter = /*#__PURE__*/function () {
+    function PolyRelFormatter(intl, isEnglish, opts) {
+      this.opts = _extends({
+        style: "long"
+      }, opts);
+      if (!isEnglish && hasRelative()) {
+        this.rtf = getCachedRTF(intl, opts);
+      }
+    }
+    var _proto3 = PolyRelFormatter.prototype;
+    _proto3.format = function format(count, unit) {
+      if (this.rtf) {
+        return this.rtf.format(count, unit);
+      } else {
+        return formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+      }
+    };
+    _proto3.formatToParts = function formatToParts(count, unit) {
+      if (this.rtf) {
+        return this.rtf.formatToParts(count, unit);
+      } else {
+        return [];
+      }
+    };
+    return PolyRelFormatter;
+  }();
+  var fallbackWeekSettings = {
+    firstDay: 1,
+    minimalDays: 4,
+    weekend: [6, 7]
+  };
+
+  /**
+   * @private
+   */
+  var Locale = /*#__PURE__*/function () {
+    Locale.fromOpts = function fromOpts(opts) {
+      return Locale.create(opts.locale, opts.numberingSystem, opts.outputCalendar, opts.weekSettings, opts.defaultToEN);
+    };
+    Locale.create = function create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN) {
+      if (defaultToEN === void 0) {
+        defaultToEN = false;
+      }
+      var specifiedLocale = locale || Settings.defaultLocale;
+      // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+      var localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+      var numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+      var outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+      var weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+      return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+    };
+    Locale.resetCache = function resetCache() {
+      sysLocaleCache = null;
+      intlDTCache.clear();
+      intlNumCache.clear();
+      intlRelCache.clear();
+      intlResolvedOptionsCache.clear();
+      weekInfoCache.clear();
+    };
+    Locale.fromObject = function fromObject(_temp) {
+      var _ref2 = _temp === void 0 ? {} : _temp,
+        locale = _ref2.locale,
+        numberingSystem = _ref2.numberingSystem,
+        outputCalendar = _ref2.outputCalendar,
+        weekSettings = _ref2.weekSettings;
+      return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+    };
+    function Locale(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+      var _parseLocaleString = parseLocaleString(locale),
+        parsedLocale = _parseLocaleString[0],
+        parsedNumberingSystem = _parseLocaleString[1],
+        parsedOutputCalendar = _parseLocaleString[2];
+      this.locale = parsedLocale;
+      this.numberingSystem = numbering || parsedNumberingSystem || null;
+      this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+      this.weekSettings = weekSettings;
+      this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+      this.weekdaysCache = {
+        format: {},
+        standalone: {}
+      };
+      this.monthsCache = {
+        format: {},
+        standalone: {}
+      };
+      this.meridiemCache = null;
+      this.eraCache = {};
+      this.specifiedLocale = specifiedLocale;
+      this.fastNumbersCached = null;
+    }
+    var _proto4 = Locale.prototype;
+    _proto4.listingMode = function listingMode() {
+      var isActuallyEn = this.isEnglish();
+      var hasNoWeirdness = (this.numberingSystem === null || this.numberingSystem === "latn") && (this.outputCalendar === null || this.outputCalendar === "gregory");
+      return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+    };
+    _proto4.clone = function clone(alts) {
+      if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+        return this;
+      } else {
+        return Locale.create(alts.locale || this.specifiedLocale, alts.numberingSystem || this.numberingSystem, alts.outputCalendar || this.outputCalendar, validateWeekSettings(alts.weekSettings) || this.weekSettings, alts.defaultToEN || false);
+      }
+    };
+    _proto4.redefaultToEN = function redefaultToEN(alts) {
+      if (alts === void 0) {
+        alts = {};
+      }
+      return this.clone(_extends({}, alts, {
+        defaultToEN: true
+      }));
+    };
+    _proto4.redefaultToSystem = function redefaultToSystem(alts) {
+      if (alts === void 0) {
+        alts = {};
+      }
+      return this.clone(_extends({}, alts, {
+        defaultToEN: false
+      }));
+    };
+    _proto4.months = function months$1(length, format) {
+      var _this2 = this;
+      if (format === void 0) {
+        format = false;
+      }
+      return listStuff(this, length, months, function () {
+        // Workaround for "ja" locale: formatToParts does not label all parts of the month
+        // as "month" and for this locale there is no difference between "format" and "non-format".
+        // As such, just use format() instead of formatToParts() and take the whole string
+        var monthSpecialCase = _this2.intl === "ja" || _this2.intl.startsWith("ja-");
+        format &= !monthSpecialCase;
+        var intl = format ? {
+            month: length,
+            day: "numeric"
+          } : {
+            month: length
+          },
+          formatStr = format ? "format" : "standalone";
+        if (!_this2.monthsCache[formatStr][length]) {
+          var mapper = !monthSpecialCase ? function (dt) {
+            return _this2.extract(dt, intl, "month");
+          } : function (dt) {
+            return _this2.dtFormatter(dt, intl).format();
+          };
+          _this2.monthsCache[formatStr][length] = mapMonths(mapper);
+        }
+        return _this2.monthsCache[formatStr][length];
+      });
+    };
+    _proto4.weekdays = function weekdays$1(length, format) {
+      var _this3 = this;
+      if (format === void 0) {
+        format = false;
+      }
+      return listStuff(this, length, weekdays, function () {
+        var intl = format ? {
+            weekday: length,
+            year: "numeric",
+            month: "long",
+            day: "numeric"
+          } : {
+            weekday: length
+          },
+          formatStr = format ? "format" : "standalone";
+        if (!_this3.weekdaysCache[formatStr][length]) {
+          _this3.weekdaysCache[formatStr][length] = mapWeekdays(function (dt) {
+            return _this3.extract(dt, intl, "weekday");
+          });
+        }
+        return _this3.weekdaysCache[formatStr][length];
+      });
+    };
+    _proto4.meridiems = function meridiems$1() {
+      var _this4 = this;
+      return listStuff(this, undefined, function () {
+        return meridiems;
+      }, function () {
+        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+        // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+        if (!_this4.meridiemCache) {
+          var intl = {
+            hour: "numeric",
+            hourCycle: "h12"
+          };
+          _this4.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(function (dt) {
+            return _this4.extract(dt, intl, "dayperiod");
+          });
+        }
+        return _this4.meridiemCache;
+      });
+    };
+    _proto4.eras = function eras$1(length) {
+      var _this5 = this;
+      return listStuff(this, length, eras, function () {
+        var intl = {
+          era: length
+        };
+
+        // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+        // to definitely enumerate them.
+        if (!_this5.eraCache[length]) {
+          _this5.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map(function (dt) {
+            return _this5.extract(dt, intl, "era");
+          });
+        }
+        return _this5.eraCache[length];
+      });
+    };
+    _proto4.extract = function extract(dt, intlOpts, field) {
+      var df = this.dtFormatter(dt, intlOpts),
+        results = df.formatToParts(),
+        matching = results.find(function (m) {
+          return m.type.toLowerCase() === field;
+        });
+      return matching ? matching.value : null;
+    };
+    _proto4.numberFormatter = function numberFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+      // (in contrast, the rest of the condition is used heavily)
+      return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+    };
+    _proto4.dtFormatter = function dtFormatter(dt, intlOpts) {
+      if (intlOpts === void 0) {
+        intlOpts = {};
+      }
+      return new PolyDateFormatter(dt, this.intl, intlOpts);
+    };
+    _proto4.relFormatter = function relFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+    };
+    _proto4.listFormatter = function listFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return getCachedLF(this.intl, opts);
+    };
+    _proto4.isEnglish = function isEnglish() {
+      return this.locale === "en" || this.locale.toLowerCase() === "en-us" || getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us");
+    };
+    _proto4.getWeekSettings = function getWeekSettings() {
+      if (this.weekSettings) {
+        return this.weekSettings;
+      } else if (!hasLocaleWeekInfo()) {
+        return fallbackWeekSettings;
+      } else {
+        return getCachedWeekInfo(this.locale);
+      }
+    };
+    _proto4.getStartOfWeek = function getStartOfWeek() {
+      return this.getWeekSettings().firstDay;
+    };
+    _proto4.getMinDaysInFirstWeek = function getMinDaysInFirstWeek() {
+      return this.getWeekSettings().minimalDays;
+    };
+    _proto4.getWeekendDays = function getWeekendDays() {
+      return this.getWeekSettings().weekend;
+    };
+    _proto4.equals = function equals(other) {
+      return this.locale === other.locale && this.numberingSystem === other.numberingSystem && this.outputCalendar === other.outputCalendar;
+    };
+    _proto4.toString = function toString() {
+      return "Locale(" + this.locale + ", " + this.numberingSystem + ", " + this.outputCalendar + ")";
+    };
+    _createClass(Locale, [{
+      key: "fastNumbers",
+      get: function get() {
+        if (this.fastNumbersCached == null) {
+          this.fastNumbersCached = supportsFastNumbers(this);
+        }
+        return this.fastNumbersCached;
+      }
+    }]);
+    return Locale;
+  }();
+
+  var singleton = null;
+
+  /**
+   * A zone with a fixed offset (meaning no DST)
+   * @implements {Zone}
+   */
+  var FixedOffsetZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(FixedOffsetZone, _Zone);
+    /**
+     * Get an instance with a specified offset
+     * @param {number} offset - The offset in minutes
+     * @return {FixedOffsetZone}
+     */
+    FixedOffsetZone.instance = function instance(offset) {
+      return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+    }
+
+    /**
+     * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+     * @param {string} s - The offset string to parse
+     * @example FixedOffsetZone.parseSpecifier("UTC+6")
+     * @example FixedOffsetZone.parseSpecifier("UTC+06")
+     * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+     * @return {FixedOffsetZone}
+     */;
+    FixedOffsetZone.parseSpecifier = function parseSpecifier(s) {
+      if (s) {
+        var r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+        if (r) {
+          return new FixedOffsetZone(signedOffset(r[1], r[2]));
+        }
+      }
+      return null;
+    };
+    function FixedOffsetZone(offset) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /** @private **/
+      _this.fixed = offset;
+      return _this;
+    }
+
+    /**
+     * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+     * @override
+     * @type {string}
+     */
+    var _proto = FixedOffsetZone.prototype;
+    /**
+     * Returns the offset's common name at the specified timestamp.
+     *
+     * For fixed offset zones this equals to the zone name.
+     * @override
+     */
+    _proto.offsetName = function offsetName() {
+      return this.name;
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.fixed, format);
+    }
+
+    /**
+     * Returns whether the offset is known to be fixed for the whole year:
+     * Always returns true for all fixed offset zones.
+     * @override
+     * @type {boolean}
+     */;
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     *
+     * For fixed offset zones, this is constant and does not depend on a timestamp.
+     * @override
+     * @return {number}
+     */
+    _proto.offset = function offset() {
+      return this.fixed;
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+     * @override
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+    }
+
+    /**
+     * Return whether this Zone is valid:
+     * All fixed offset zones are valid.
+     * @override
+     * @type {boolean}
+     */;
+    _createClass(FixedOffsetZone, [{
+      key: "type",
+      get: function get() {
+        return "fixed";
+      }
+
+      /**
+       * The name of this zone.
+       * All fixed zones' names always start with "UTC" (plus optional offset)
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        return this.fixed === 0 ? "UTC" : "UTC" + formatOffset(this.fixed, "narrow");
+      }
+
+      /**
+       * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+       *
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "ianaName",
+      get: function get() {
+        if (this.fixed === 0) {
+          return "Etc/UTC";
+        } else {
+          return "Etc/GMT" + formatOffset(-this.fixed, "narrow");
+        }
+      }
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return true;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return true;
+      }
+    }], [{
+      key: "utcInstance",
+      get:
+      /**
+       * Get a singleton instance of UTC
+       * @return {FixedOffsetZone}
+       */
+      function get() {
+        if (singleton === null) {
+          singleton = new FixedOffsetZone(0);
+        }
+        return singleton;
+      }
+    }]);
+    return FixedOffsetZone;
+  }(Zone);
+
+  /**
+   * A zone that failed to parse. You should never need to instantiate this.
+   * @implements {Zone}
+   */
+  var InvalidZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(InvalidZone, _Zone);
+    function InvalidZone(zoneName) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /**  @private */
+      _this.zoneName = zoneName;
+      return _this;
+    }
+
+    /** @override **/
+    var _proto = InvalidZone.prototype;
+    /** @override **/
+    _proto.offsetName = function offsetName() {
+      return null;
+    }
+
+    /** @override **/;
+    _proto.formatOffset = function formatOffset() {
+      return "";
+    }
+
+    /** @override **/;
+    _proto.offset = function offset() {
+      return NaN;
+    }
+
+    /** @override **/;
+    _proto.equals = function equals() {
+      return false;
+    }
+
+    /** @override **/;
+    _createClass(InvalidZone, [{
+      key: "type",
+      get: function get() {
+        return "invalid";
+      }
+
+      /** @override **/
+    }, {
+      key: "name",
+      get: function get() {
+        return this.zoneName;
+      }
+
+      /** @override **/
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return false;
+      }
+    }]);
+    return InvalidZone;
+  }(Zone);
+
+  /**
+   * @private
+   */
+  function normalizeZone(input, defaultZone) {
+    if (isUndefined(input) || input === null) {
+      return defaultZone;
+    } else if (input instanceof Zone) {
+      return input;
+    } else if (isString(input)) {
+      var lowered = input.toLowerCase();
+      if (lowered === "default") return defaultZone;else if (lowered === "local" || lowered === "system") return SystemZone.instance;else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+    } else if (isNumber(input)) {
+      return FixedOffsetZone.instance(input);
+    } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+      // This is dumb, but the instanceof check above doesn't seem to really work
+      // so we're duck checking it
+      return input;
+    } else {
+      return new InvalidZone(input);
+    }
+  }
+
+  var numberingSystems = {
+    arab: "[\u0660-\u0669]",
+    arabext: "[\u06F0-\u06F9]",
+    bali: "[\u1B50-\u1B59]",
+    beng: "[\u09E6-\u09EF]",
+    deva: "[\u0966-\u096F]",
+    fullwide: "[\uFF10-\uFF19]",
+    gujr: "[\u0AE6-\u0AEF]",
+    hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+    khmr: "[\u17E0-\u17E9]",
+    knda: "[\u0CE6-\u0CEF]",
+    laoo: "[\u0ED0-\u0ED9]",
+    limb: "[\u1946-\u194F]",
+    mlym: "[\u0D66-\u0D6F]",
+    mong: "[\u1810-\u1819]",
+    mymr: "[\u1040-\u1049]",
+    orya: "[\u0B66-\u0B6F]",
+    tamldec: "[\u0BE6-\u0BEF]",
+    telu: "[\u0C66-\u0C6F]",
+    thai: "[\u0E50-\u0E59]",
+    tibt: "[\u0F20-\u0F29]",
+    latn: "\\d"
+  };
+  var numberingSystemsUTF16 = {
+    arab: [1632, 1641],
+    arabext: [1776, 1785],
+    bali: [6992, 7001],
+    beng: [2534, 2543],
+    deva: [2406, 2415],
+    fullwide: [65296, 65303],
+    gujr: [2790, 2799],
+    khmr: [6112, 6121],
+    knda: [3302, 3311],
+    laoo: [3792, 3801],
+    limb: [6470, 6479],
+    mlym: [3430, 3439],
+    mong: [6160, 6169],
+    mymr: [4160, 4169],
+    orya: [2918, 2927],
+    tamldec: [3046, 3055],
+    telu: [3174, 3183],
+    thai: [3664, 3673],
+    tibt: [3872, 3881]
+  };
+  var hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+  function parseDigits(str) {
+    var value = parseInt(str, 10);
+    if (isNaN(value)) {
+      value = "";
+      for (var i = 0; i < str.length; i++) {
+        var code = str.charCodeAt(i);
+        if (str[i].search(numberingSystems.hanidec) !== -1) {
+          value += hanidecChars.indexOf(str[i]);
+        } else {
+          for (var key in numberingSystemsUTF16) {
+            var _numberingSystemsUTF = numberingSystemsUTF16[key],
+              min = _numberingSystemsUTF[0],
+              max = _numberingSystemsUTF[1];
+            if (code >= min && code <= max) {
+              value += code - min;
+            }
+          }
+        }
+      }
+      return parseInt(value, 10);
+    } else {
+      return value;
+    }
+  }
+
+  // cache of {numberingSystem: {append: regex}}
+  var digitRegexCache = new Map();
+  function resetDigitRegexCache() {
+    digitRegexCache.clear();
+  }
+  function digitRegex(_ref, append) {
+    var numberingSystem = _ref.numberingSystem;
+    if (append === void 0) {
+      append = "";
+    }
+    var ns = numberingSystem || "latn";
+    var appendCache = digitRegexCache.get(ns);
+    if (appendCache === undefined) {
+      appendCache = new Map();
+      digitRegexCache.set(ns, appendCache);
+    }
+    var regex = appendCache.get(append);
+    if (regex === undefined) {
+      regex = new RegExp("" + numberingSystems[ns] + append);
+      appendCache.set(append, regex);
+    }
+    return regex;
+  }
+
+  var now = function now() {
+      return Date.now();
+    },
+    defaultZone = "system",
+    defaultLocale = null,
+    defaultNumberingSystem = null,
+    defaultOutputCalendar = null,
+    twoDigitCutoffYear = 60,
+    throwOnInvalid,
+    defaultWeekSettings = null;
+
+  /**
+   * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+   */
+  var Settings = /*#__PURE__*/function () {
+    function Settings() {}
+    /**
+     * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+     * @return {void}
+     */
+    Settings.resetCaches = function resetCaches() {
+      Locale.resetCache();
+      IANAZone.resetCache();
+      DateTime.resetCache();
+      resetDigitRegexCache();
+    };
+    _createClass(Settings, null, [{
+      key: "now",
+      get:
+      /**
+       * Get the callback for returning the current timestamp.
+       * @type {function}
+       */
+      function get() {
+        return now;
+      }
+
+      /**
+       * Set the callback for returning the current timestamp.
+       * The function should return a number, which will be interpreted as an Epoch millisecond count
+       * @type {function}
+       * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+       * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+       */,
+      set: function set(n) {
+        now = n;
+      }
+
+      /**
+       * Set the default time zone to create DateTimes in. Does not affect existing instances.
+       * Use the value "system" to reset this value to the system's time zone.
+       * @type {string}
+       */
+    }, {
+      key: "defaultZone",
+      get:
+      /**
+       * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+       * The default value is the system's time zone (the one set on the machine that runs this code).
+       * @type {Zone}
+       */
+      function get() {
+        return normalizeZone(defaultZone, SystemZone.instance);
+      }
+
+      /**
+       * Get the default locale to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(zone) {
+        defaultZone = zone;
+      }
+    }, {
+      key: "defaultLocale",
+      get: function get() {
+        return defaultLocale;
+      }
+
+      /**
+       * Set the default locale to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(locale) {
+        defaultLocale = locale;
+      }
+
+      /**
+       * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */
+    }, {
+      key: "defaultNumberingSystem",
+      get: function get() {
+        return defaultNumberingSystem;
+      }
+
+      /**
+       * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(numberingSystem) {
+        defaultNumberingSystem = numberingSystem;
+      }
+
+      /**
+       * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */
+    }, {
+      key: "defaultOutputCalendar",
+      get: function get() {
+        return defaultOutputCalendar;
+      }
+
+      /**
+       * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(outputCalendar) {
+        defaultOutputCalendar = outputCalendar;
+      }
+
+      /**
+       * @typedef {Object} WeekSettings
+       * @property {number} firstDay
+       * @property {number} minimalDays
+       * @property {number[]} weekend
+       */
+
+      /**
+       * @return {WeekSettings|null}
+       */
+    }, {
+      key: "defaultWeekSettings",
+      get: function get() {
+        return defaultWeekSettings;
+      }
+
+      /**
+       * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+       * how many days are required in the first week of a year.
+       * Does not affect existing instances.
+       *
+       * @param {WeekSettings|null} weekSettings
+       */,
+      set: function set(weekSettings) {
+        defaultWeekSettings = validateWeekSettings(weekSettings);
+      }
+
+      /**
+       * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+       * @type {number}
+       */
+    }, {
+      key: "twoDigitCutoffYear",
+      get: function get() {
+        return twoDigitCutoffYear;
+      }
+
+      /**
+       * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+       * @type {number}
+       * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+       * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+       * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+       * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+       * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+       */,
+      set: function set(cutoffYear) {
+        twoDigitCutoffYear = cutoffYear % 100;
+      }
+
+      /**
+       * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+       * @type {boolean}
+       */
+    }, {
+      key: "throwOnInvalid",
+      get: function get() {
+        return throwOnInvalid;
+      }
+
+      /**
+       * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+       * @type {boolean}
+       */,
+      set: function set(t) {
+        throwOnInvalid = t;
+      }
+    }]);
+    return Settings;
+  }();
+
+  var Invalid = /*#__PURE__*/function () {
+    function Invalid(reason, explanation) {
+      this.reason = reason;
+      this.explanation = explanation;
+    }
+    var _proto = Invalid.prototype;
+    _proto.toMessage = function toMessage() {
+      if (this.explanation) {
+        return this.reason + ": " + this.explanation;
+      } else {
+        return this.reason;
+      }
+    };
+    return Invalid;
+  }();
+
+  var nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+    leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+  function unitOutOfRange(unit, value) {
+    return new Invalid("unit out of range", "you specified " + value + " (of type " + typeof value + ") as a " + unit + ", which is invalid");
+  }
+  function dayOfWeek(year, month, day) {
+    var d = new Date(Date.UTC(year, month - 1, day));
+    if (year < 100 && year >= 0) {
+      d.setUTCFullYear(d.getUTCFullYear() - 1900);
+    }
+    var js = d.getUTCDay();
+    return js === 0 ? 7 : js;
+  }
+  function computeOrdinal(year, month, day) {
+    return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+  }
+  function uncomputeOrdinal(year, ordinal) {
+    var table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+      month0 = table.findIndex(function (i) {
+        return i < ordinal;
+      }),
+      day = ordinal - table[month0];
+    return {
+      month: month0 + 1,
+      day: day
+    };
+  }
+  function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+    return (isoWeekday - startOfWeek + 7) % 7 + 1;
+  }
+
+  /**
+   * @private
+   */
+
+  function gregorianToWeek(gregObj, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var year = gregObj.year,
+      month = gregObj.month,
+      day = gregObj.day,
+      ordinal = computeOrdinal(year, month, day),
+      weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+    var weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+      weekYear;
+    if (weekNumber < 1) {
+      weekYear = year - 1;
+      weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+    } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+      weekYear = year + 1;
+      weekNumber = 1;
+    } else {
+      weekYear = year;
+    }
+    return _extends({
+      weekYear: weekYear,
+      weekNumber: weekNumber,
+      weekday: weekday
+    }, timeObject(gregObj));
+  }
+  function weekToGregorian(weekData, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var weekYear = weekData.weekYear,
+      weekNumber = weekData.weekNumber,
+      weekday = weekData.weekday,
+      weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+      yearInDays = daysInYear(weekYear);
+    var ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+      year;
+    if (ordinal < 1) {
+      year = weekYear - 1;
+      ordinal += daysInYear(year);
+    } else if (ordinal > yearInDays) {
+      year = weekYear + 1;
+      ordinal -= daysInYear(weekYear);
+    } else {
+      year = weekYear;
+    }
+    var _uncomputeOrdinal = uncomputeOrdinal(year, ordinal),
+      month = _uncomputeOrdinal.month,
+      day = _uncomputeOrdinal.day;
+    return _extends({
+      year: year,
+      month: month,
+      day: day
+    }, timeObject(weekData));
+  }
+  function gregorianToOrdinal(gregData) {
+    var year = gregData.year,
+      month = gregData.month,
+      day = gregData.day;
+    var ordinal = computeOrdinal(year, month, day);
+    return _extends({
+      year: year,
+      ordinal: ordinal
+    }, timeObject(gregData));
+  }
+  function ordinalToGregorian(ordinalData) {
+    var year = ordinalData.year,
+      ordinal = ordinalData.ordinal;
+    var _uncomputeOrdinal2 = uncomputeOrdinal(year, ordinal),
+      month = _uncomputeOrdinal2.month,
+      day = _uncomputeOrdinal2.day;
+    return _extends({
+      year: year,
+      month: month,
+      day: day
+    }, timeObject(ordinalData));
+  }
+
+  /**
+   * Check if local week units like localWeekday are used in obj.
+   * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+   * Modifies obj in-place!
+   * @param obj the object values
+   */
+  function usesLocalWeekValues(obj, loc) {
+    var hasLocaleWeekData = !isUndefined(obj.localWeekday) || !isUndefined(obj.localWeekNumber) || !isUndefined(obj.localWeekYear);
+    if (hasLocaleWeekData) {
+      var hasIsoWeekData = !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+      if (hasIsoWeekData) {
+        throw new ConflictingSpecificationError("Cannot mix locale-based week fields with ISO-based week fields");
+      }
+      if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+      if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+      if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+      delete obj.localWeekday;
+      delete obj.localWeekNumber;
+      delete obj.localWeekYear;
+      return {
+        minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+        startOfWeek: loc.getStartOfWeek()
+      };
+    } else {
+      return {
+        minDaysInFirstWeek: 4,
+        startOfWeek: 1
+      };
+    }
+  }
+  function hasInvalidWeekData(obj, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var validYear = isInteger(obj.weekYear),
+      validWeek = integerBetween(obj.weekNumber, 1, weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)),
+      validWeekday = integerBetween(obj.weekday, 1, 7);
+    if (!validYear) {
+      return unitOutOfRange("weekYear", obj.weekYear);
+    } else if (!validWeek) {
+      return unitOutOfRange("week", obj.weekNumber);
+    } else if (!validWeekday) {
+      return unitOutOfRange("weekday", obj.weekday);
+    } else return false;
+  }
+  function hasInvalidOrdinalData(obj) {
+    var validYear = isInteger(obj.year),
+      validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+    if (!validYear) {
+      return unitOutOfRange("year", obj.year);
+    } else if (!validOrdinal) {
+      return unitOutOfRange("ordinal", obj.ordinal);
+    } else return false;
+  }
+  function hasInvalidGregorianData(obj) {
+    var validYear = isInteger(obj.year),
+      validMonth = integerBetween(obj.month, 1, 12),
+      validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+    if (!validYear) {
+      return unitOutOfRange("year", obj.year);
+    } else if (!validMonth) {
+      return unitOutOfRange("month", obj.month);
+    } else if (!validDay) {
+      return unitOutOfRange("day", obj.day);
+    } else return false;
+  }
+  function hasInvalidTimeData(obj) {
+    var hour = obj.hour,
+      minute = obj.minute,
+      second = obj.second,
+      millisecond = obj.millisecond;
+    var validHour = integerBetween(hour, 0, 23) || hour === 24 && minute === 0 && second === 0 && millisecond === 0,
+      validMinute = integerBetween(minute, 0, 59),
+      validSecond = integerBetween(second, 0, 59),
+      validMillisecond = integerBetween(millisecond, 0, 999);
+    if (!validHour) {
+      return unitOutOfRange("hour", hour);
+    } else if (!validMinute) {
+      return unitOutOfRange("minute", minute);
+    } else if (!validSecond) {
+      return unitOutOfRange("second", second);
+    } else if (!validMillisecond) {
+      return unitOutOfRange("millisecond", millisecond);
+    } else return false;
+  }
+
+  /**
+   * @private
+   */
+
+  // TYPES
+
+  function isUndefined(o) {
+    return typeof o === "undefined";
+  }
+  function isNumber(o) {
+    return typeof o === "number";
+  }
+  function isInteger(o) {
+    return typeof o === "number" && o % 1 === 0;
+  }
+  function isString(o) {
+    return typeof o === "string";
+  }
+  function isDate(o) {
+    return Object.prototype.toString.call(o) === "[object Date]";
+  }
+
+  // CAPABILITIES
+
+  function hasRelative() {
+    try {
+      return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+    } catch (e) {
+      return false;
+    }
+  }
+  function hasLocaleWeekInfo() {
+    try {
+      return typeof Intl !== "undefined" && !!Intl.Locale && ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype);
+    } catch (e) {
+      return false;
+    }
+  }
+
+  // OBJECTS AND ARRAYS
+
+  function maybeArray(thing) {
+    return Array.isArray(thing) ? thing : [thing];
+  }
+  function bestBy(arr, by, compare) {
+    if (arr.length === 0) {
+      return undefined;
+    }
+    return arr.reduce(function (best, next) {
+      var pair = [by(next), next];
+      if (!best) {
+        return pair;
+      } else if (compare(best[0], pair[0]) === best[0]) {
+        return best;
+      } else {
+        return pair;
+      }
+    }, null)[1];
+  }
+  function pick(obj, keys) {
+    return keys.reduce(function (a, k) {
+      a[k] = obj[k];
+      return a;
+    }, {});
+  }
+  function hasOwnProperty(obj, prop) {
+    return Object.prototype.hasOwnProperty.call(obj, prop);
+  }
+  function validateWeekSettings(settings) {
+    if (settings == null) {
+      return null;
+    } else if (typeof settings !== "object") {
+      throw new InvalidArgumentError("Week settings must be an object");
+    } else {
+      if (!integerBetween(settings.firstDay, 1, 7) || !integerBetween(settings.minimalDays, 1, 7) || !Array.isArray(settings.weekend) || settings.weekend.some(function (v) {
+        return !integerBetween(v, 1, 7);
+      })) {
+        throw new InvalidArgumentError("Invalid week settings");
+      }
+      return {
+        firstDay: settings.firstDay,
+        minimalDays: settings.minimalDays,
+        weekend: Array.from(settings.weekend)
+      };
+    }
+  }
+
+  // NUMBERS AND STRINGS
+
+  function integerBetween(thing, bottom, top) {
+    return isInteger(thing) && thing >= bottom && thing <= top;
+  }
+
+  // x % n but takes the sign of n instead of x
+  function floorMod(x, n) {
+    return x - n * Math.floor(x / n);
+  }
+  function padStart(input, n) {
+    if (n === void 0) {
+      n = 2;
+    }
+    var isNeg = input < 0;
+    var padded;
+    if (isNeg) {
+      padded = "-" + ("" + -input).padStart(n, "0");
+    } else {
+      padded = ("" + input).padStart(n, "0");
+    }
+    return padded;
+  }
+  function parseInteger(string) {
+    if (isUndefined(string) || string === null || string === "") {
+      return undefined;
+    } else {
+      return parseInt(string, 10);
+    }
+  }
+  function parseFloating(string) {
+    if (isUndefined(string) || string === null || string === "") {
+      return undefined;
+    } else {
+      return parseFloat(string);
+    }
+  }
+  function parseMillis(fraction) {
+    // Return undefined (instead of 0) in these cases, where fraction is not set
+    if (isUndefined(fraction) || fraction === null || fraction === "") {
+      return undefined;
+    } else {
+      var f = parseFloat("0." + fraction) * 1000;
+      return Math.floor(f);
+    }
+  }
+  function roundTo(number, digits, rounding) {
+    if (rounding === void 0) {
+      rounding = "round";
+    }
+    var factor = Math.pow(10, digits);
+    switch (rounding) {
+      case "expand":
+        return number > 0 ? Math.ceil(number * factor) / factor : Math.floor(number * factor) / factor;
+      case "trunc":
+        return Math.trunc(number * factor) / factor;
+      case "round":
+        return Math.round(number * factor) / factor;
+      case "floor":
+        return Math.floor(number * factor) / factor;
+      case "ceil":
+        return Math.ceil(number * factor) / factor;
+      default:
+        throw new RangeError("Value rounding " + rounding + " is out of range");
+    }
+  }
+
+  // DATE BASICS
+
+  function isLeapYear(year) {
+    return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+  }
+  function daysInYear(year) {
+    return isLeapYear(year) ? 366 : 365;
+  }
+  function daysInMonth(year, month) {
+    var modMonth = floorMod(month - 1, 12) + 1,
+      modYear = year + (month - modMonth) / 12;
+    if (modMonth === 2) {
+      return isLeapYear(modYear) ? 29 : 28;
+    } else {
+      return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+    }
+  }
+
+  // convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+  function objToLocalTS(obj) {
+    var d = Date.UTC(obj.year, obj.month - 1, obj.day, obj.hour, obj.minute, obj.second, obj.millisecond);
+
+    // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+    if (obj.year < 100 && obj.year >= 0) {
+      d = new Date(d);
+      // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+      // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+      // the calculations done by Date.UTC are using year 2000 - which is incorrect
+      d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+    }
+    return +d;
+  }
+
+  // adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+  function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+    var fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+    return -fwdlw + minDaysInFirstWeek - 1;
+  }
+  function weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+    var weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+    return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+  }
+  function untruncateYear(year) {
+    if (year > 99) {
+      return year;
+    } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+  }
+
+  // PARSING
+
+  function parseZoneInfo(ts, offsetFormat, locale, timeZone) {
+    if (timeZone === void 0) {
+      timeZone = null;
+    }
+    var date = new Date(ts),
+      intlOpts = {
+        hourCycle: "h23",
+        year: "numeric",
+        month: "2-digit",
+        day: "2-digit",
+        hour: "2-digit",
+        minute: "2-digit"
+      };
+    if (timeZone) {
+      intlOpts.timeZone = timeZone;
+    }
+    var modified = _extends({
+      timeZoneName: offsetFormat
+    }, intlOpts);
+    var parsed = new Intl.DateTimeFormat(locale, modified).formatToParts(date).find(function (m) {
+      return m.type.toLowerCase() === "timezonename";
+    });
+    return parsed ? parsed.value : null;
+  }
+
+  // signedOffset('-5', '30') -> -330
+  function signedOffset(offHourStr, offMinuteStr) {
+    var offHour = parseInt(offHourStr, 10);
+
+    // don't || this because we want to preserve -0
+    if (Number.isNaN(offHour)) {
+      offHour = 0;
+    }
+    var offMin = parseInt(offMinuteStr, 10) || 0,
+      offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+    return offHour * 60 + offMinSigned;
+  }
+
+  // COERCION
+
+  function asNumber(value) {
+    var numericValue = Number(value);
+    if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue)) throw new InvalidArgumentError("Invalid unit value " + value);
+    return numericValue;
+  }
+  function normalizeObject(obj, normalizer) {
+    var normalized = {};
+    for (var u in obj) {
+      if (hasOwnProperty(obj, u)) {
+        var v = obj[u];
+        if (v === undefined || v === null) continue;
+        normalized[normalizer(u)] = asNumber(v);
+      }
+    }
+    return normalized;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  function formatOffset(offset, format) {
+    var hours = Math.trunc(Math.abs(offset / 60)),
+      minutes = Math.trunc(Math.abs(offset % 60)),
+      sign = offset >= 0 ? "+" : "-";
+    switch (format) {
+      case "short":
+        return "" + sign + padStart(hours, 2) + ":" + padStart(minutes, 2);
+      case "narrow":
+        return "" + sign + hours + (minutes > 0 ? ":" + minutes : "");
+      case "techie":
+        return "" + sign + padStart(hours, 2) + padStart(minutes, 2);
+      default:
+        throw new RangeError("Value format " + format + " is out of range for property format");
+    }
+  }
+  function timeObject(obj) {
+    return pick(obj, ["hour", "minute", "second", "millisecond"]);
+  }
+
+  /**
+   * @private
+   */
+
+  var monthsLong = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"];
+  var monthsShort = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"];
+  var monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+  function months(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(monthsNarrow);
+      case "short":
+        return [].concat(monthsShort);
+      case "long":
+        return [].concat(monthsLong);
+      case "numeric":
+        return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+      case "2-digit":
+        return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+      default:
+        return null;
+    }
+  }
+  var weekdaysLong = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"];
+  var weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+  var weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+  function weekdays(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(weekdaysNarrow);
+      case "short":
+        return [].concat(weekdaysShort);
+      case "long":
+        return [].concat(weekdaysLong);
+      case "numeric":
+        return ["1", "2", "3", "4", "5", "6", "7"];
+      default:
+        return null;
+    }
+  }
+  var meridiems = ["AM", "PM"];
+  var erasLong = ["Before Christ", "Anno Domini"];
+  var erasShort = ["BC", "AD"];
+  var erasNarrow = ["B", "A"];
+  function eras(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(erasNarrow);
+      case "short":
+        return [].concat(erasShort);
+      case "long":
+        return [].concat(erasLong);
+      default:
+        return null;
+    }
+  }
+  function meridiemForDateTime(dt) {
+    return meridiems[dt.hour < 12 ? 0 : 1];
+  }
+  function weekdayForDateTime(dt, length) {
+    return weekdays(length)[dt.weekday - 1];
+  }
+  function monthForDateTime(dt, length) {
+    return months(length)[dt.month - 1];
+  }
+  function eraForDateTime(dt, length) {
+    return eras(length)[dt.year < 0 ? 0 : 1];
+  }
+  function formatRelativeTime(unit, count, numeric, narrow) {
+    if (numeric === void 0) {
+      numeric = "always";
+    }
+    if (narrow === void 0) {
+      narrow = false;
+    }
+    var units = {
+      years: ["year", "yr."],
+      quarters: ["quarter", "qtr."],
+      months: ["month", "mo."],
+      weeks: ["week", "wk."],
+      days: ["day", "day", "days"],
+      hours: ["hour", "hr."],
+      minutes: ["minute", "min."],
+      seconds: ["second", "sec."]
+    };
+    var lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+    if (numeric === "auto" && lastable) {
+      var isDay = unit === "days";
+      switch (count) {
+        case 1:
+          return isDay ? "tomorrow" : "next " + units[unit][0];
+        case -1:
+          return isDay ? "yesterday" : "last " + units[unit][0];
+        case 0:
+          return isDay ? "today" : "this " + units[unit][0];
+      }
+    }
+
+    var isInPast = Object.is(count, -0) || count < 0,
+      fmtValue = Math.abs(count),
+      singular = fmtValue === 1,
+      lilUnits = units[unit],
+      fmtUnit = narrow ? singular ? lilUnits[1] : lilUnits[2] || lilUnits[1] : singular ? units[unit][0] : unit;
+    return isInPast ? fmtValue + " " + fmtUnit + " ago" : "in " + fmtValue + " " + fmtUnit;
+  }
+
+  function stringifyTokens(splits, tokenToString) {
+    var s = "";
+    for (var _iterator = _createForOfIteratorHelperLoose(splits), _step; !(_step = _iterator()).done;) {
+      var token = _step.value;
+      if (token.literal) {
+        s += token.val;
+      } else {
+        s += tokenToString(token.val);
+      }
+    }
+    return s;
+  }
+  var _macroTokenToFormatOpts = {
+    D: DATE_SHORT,
+    DD: DATE_MED,
+    DDD: DATE_FULL,
+    DDDD: DATE_HUGE,
+    t: TIME_SIMPLE,
+    tt: TIME_WITH_SECONDS,
+    ttt: TIME_WITH_SHORT_OFFSET,
+    tttt: TIME_WITH_LONG_OFFSET,
+    T: TIME_24_SIMPLE,
+    TT: TIME_24_WITH_SECONDS,
+    TTT: TIME_24_WITH_SHORT_OFFSET,
+    TTTT: TIME_24_WITH_LONG_OFFSET,
+    f: DATETIME_SHORT,
+    ff: DATETIME_MED,
+    fff: DATETIME_FULL,
+    ffff: DATETIME_HUGE,
+    F: DATETIME_SHORT_WITH_SECONDS,
+    FF: DATETIME_MED_WITH_SECONDS,
+    FFF: DATETIME_FULL_WITH_SECONDS,
+    FFFF: DATETIME_HUGE_WITH_SECONDS
+  };
+
+  /**
+   * @private
+   */
+  var Formatter = /*#__PURE__*/function () {
+    Formatter.create = function create(locale, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return new Formatter(locale, opts);
+    };
+    Formatter.parseFormat = function parseFormat(fmt) {
+      // white-space is always considered a literal in user-provided formats
+      // the " " token has a special meaning (see unitForToken)
+
+      var current = null,
+        currentFull = "",
+        bracketed = false;
+      var splits = [];
+      for (var i = 0; i < fmt.length; i++) {
+        var c = fmt.charAt(i);
+        if (c === "'") {
+          // turn '' into a literal signal quote instead of just skipping the empty literal
+          if (currentFull.length > 0 || bracketed) {
+            splits.push({
+              literal: bracketed || /^\s+$/.test(currentFull),
+              val: currentFull === "" ? "'" : currentFull
+            });
+          }
+          current = null;
+          currentFull = "";
+          bracketed = !bracketed;
+        } else if (bracketed) {
+          currentFull += c;
+        } else if (c === current) {
+          currentFull += c;
+        } else {
+          if (currentFull.length > 0) {
+            splits.push({
+              literal: /^\s+$/.test(currentFull),
+              val: currentFull
+            });
+          }
+          currentFull = c;
+          current = c;
+        }
+      }
+      if (currentFull.length > 0) {
+        splits.push({
+          literal: bracketed || /^\s+$/.test(currentFull),
+          val: currentFull
+        });
+      }
+      return splits;
+    };
+    Formatter.macroTokenToFormatOpts = function macroTokenToFormatOpts(token) {
+      return _macroTokenToFormatOpts[token];
+    };
+    function Formatter(locale, formatOpts) {
+      this.opts = formatOpts;
+      this.loc = locale;
+      this.systemLoc = null;
+    }
+    var _proto = Formatter.prototype;
+    _proto.formatWithSystemDefault = function formatWithSystemDefault(dt, opts) {
+      if (this.systemLoc === null) {
+        this.systemLoc = this.loc.redefaultToSystem();
+      }
+      var df = this.systemLoc.dtFormatter(dt, _extends({}, this.opts, opts));
+      return df.format();
+    };
+    _proto.dtFormatter = function dtFormatter(dt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.loc.dtFormatter(dt, _extends({}, this.opts, opts));
+    };
+    _proto.formatDateTime = function formatDateTime(dt, opts) {
+      return this.dtFormatter(dt, opts).format();
+    };
+    _proto.formatDateTimeParts = function formatDateTimeParts(dt, opts) {
+      return this.dtFormatter(dt, opts).formatToParts();
+    };
+    _proto.formatInterval = function formatInterval(interval, opts) {
+      var df = this.dtFormatter(interval.start, opts);
+      return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+    };
+    _proto.resolvedOptions = function resolvedOptions(dt, opts) {
+      return this.dtFormatter(dt, opts).resolvedOptions();
+    };
+    _proto.num = function num(n, p, signDisplay) {
+      if (p === void 0) {
+        p = 0;
+      }
+      if (signDisplay === void 0) {
+        signDisplay = undefined;
+      }
+      // we get some perf out of doing this here, annoyingly
+      if (this.opts.forceSimple) {
+        return padStart(n, p);
+      }
+      var opts = _extends({}, this.opts);
+      if (p > 0) {
+        opts.padTo = p;
+      }
+      if (signDisplay) {
+        opts.signDisplay = signDisplay;
+      }
+      return this.loc.numberFormatter(opts).format(n);
+    };
+    _proto.formatDateTimeFromString = function formatDateTimeFromString(dt, fmt) {
+      var _this = this;
+      var knownEnglish = this.loc.listingMode() === "en",
+        useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+        string = function string(opts, extract) {
+          return _this.loc.extract(dt, opts, extract);
+        },
+        formatOffset = function formatOffset(opts) {
+          if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+            return "Z";
+          }
+          return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+        },
+        meridiem = function meridiem() {
+          return knownEnglish ? meridiemForDateTime(dt) : string({
+            hour: "numeric",
+            hourCycle: "h12"
+          }, "dayperiod");
+        },
+        month = function month(length, standalone) {
+          return knownEnglish ? monthForDateTime(dt, length) : string(standalone ? {
+            month: length
+          } : {
+            month: length,
+            day: "numeric"
+          }, "month");
+        },
+        weekday = function weekday(length, standalone) {
+          return knownEnglish ? weekdayForDateTime(dt, length) : string(standalone ? {
+            weekday: length
+          } : {
+            weekday: length,
+            month: "long",
+            day: "numeric"
+          }, "weekday");
+        },
+        maybeMacro = function maybeMacro(token) {
+          var formatOpts = Formatter.macroTokenToFormatOpts(token);
+          if (formatOpts) {
+            return _this.formatWithSystemDefault(dt, formatOpts);
+          } else {
+            return token;
+          }
+        },
+        era = function era(length) {
+          return knownEnglish ? eraForDateTime(dt, length) : string({
+            era: length
+          }, "era");
+        },
+        tokenToString = function tokenToString(token) {
+          // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+          switch (token) {
+            // ms
+            case "S":
+              return _this.num(dt.millisecond);
+            case "u":
+            // falls through
+            case "SSS":
+              return _this.num(dt.millisecond, 3);
+            // seconds
+            case "s":
+              return _this.num(dt.second);
+            case "ss":
+              return _this.num(dt.second, 2);
+            // fractional seconds
+            case "uu":
+              return _this.num(Math.floor(dt.millisecond / 10), 2);
+            case "uuu":
+              return _this.num(Math.floor(dt.millisecond / 100));
+            // minutes
+            case "m":
+              return _this.num(dt.minute);
+            case "mm":
+              return _this.num(dt.minute, 2);
+            // hours
+            case "h":
+              return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+            case "hh":
+              return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+            case "H":
+              return _this.num(dt.hour);
+            case "HH":
+              return _this.num(dt.hour, 2);
+            // offset
+            case "Z":
+              // like +6
+              return formatOffset({
+                format: "narrow",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZ":
+              // like +06:00
+              return formatOffset({
+                format: "short",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZZ":
+              // like +0600
+              return formatOffset({
+                format: "techie",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZZZ":
+              // like EST
+              return dt.zone.offsetName(dt.ts, {
+                format: "short",
+                locale: _this.loc.locale
+              });
+            case "ZZZZZ":
+              // like Eastern Standard Time
+              return dt.zone.offsetName(dt.ts, {
+                format: "long",
+                locale: _this.loc.locale
+              });
+            // zone
+            case "z":
+              // like America/New_York
+              return dt.zoneName;
+            // meridiems
+            case "a":
+              return meridiem();
+            // dates
+            case "d":
+              return useDateTimeFormatter ? string({
+                day: "numeric"
+              }, "day") : _this.num(dt.day);
+            case "dd":
+              return useDateTimeFormatter ? string({
+                day: "2-digit"
+              }, "day") : _this.num(dt.day, 2);
+            // weekdays - standalone
+            case "c":
+              // like 1
+              return _this.num(dt.weekday);
+            case "ccc":
+              // like 'Tues'
+              return weekday("short", true);
+            case "cccc":
+              // like 'Tuesday'
+              return weekday("long", true);
+            case "ccccc":
+              // like 'T'
+              return weekday("narrow", true);
+            // weekdays - format
+            case "E":
+              // like 1
+              return _this.num(dt.weekday);
+            case "EEE":
+              // like 'Tues'
+              return weekday("short", false);
+            case "EEEE":
+              // like 'Tuesday'
+              return weekday("long", false);
+            case "EEEEE":
+              // like 'T'
+              return weekday("narrow", false);
+            // months - standalone
+            case "L":
+              // like 1
+              return useDateTimeFormatter ? string({
+                month: "numeric",
+                day: "numeric"
+              }, "month") : _this.num(dt.month);
+            case "LL":
+              // like 01, doesn't seem to work
+              return useDateTimeFormatter ? string({
+                month: "2-digit",
+                day: "numeric"
+              }, "month") : _this.num(dt.month, 2);
+            case "LLL":
+              // like Jan
+              return month("short", true);
+            case "LLLL":
+              // like January
+              return month("long", true);
+            case "LLLLL":
+              // like J
+              return month("narrow", true);
+            // months - format
+            case "M":
+              // like 1
+              return useDateTimeFormatter ? string({
+                month: "numeric"
+              }, "month") : _this.num(dt.month);
+            case "MM":
+              // like 01
+              return useDateTimeFormatter ? string({
+                month: "2-digit"
+              }, "month") : _this.num(dt.month, 2);
+            case "MMM":
+              // like Jan
+              return month("short", false);
+            case "MMMM":
+              // like January
+              return month("long", false);
+            case "MMMMM":
+              // like J
+              return month("narrow", false);
+            // years
+            case "y":
+              // like 2014
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year);
+            case "yy":
+              // like 14
+              return useDateTimeFormatter ? string({
+                year: "2-digit"
+              }, "year") : _this.num(dt.year.toString().slice(-2), 2);
+            case "yyyy":
+              // like 0012
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year, 4);
+            case "yyyyyy":
+              // like 000012
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year, 6);
+            // eras
+            case "G":
+              // like AD
+              return era("short");
+            case "GG":
+              // like Anno Domini
+              return era("long");
+            case "GGGGG":
+              return era("narrow");
+            case "kk":
+              return _this.num(dt.weekYear.toString().slice(-2), 2);
+            case "kkkk":
+              return _this.num(dt.weekYear, 4);
+            case "W":
+              return _this.num(dt.weekNumber);
+            case "WW":
+              return _this.num(dt.weekNumber, 2);
+            case "n":
+              return _this.num(dt.localWeekNumber);
+            case "nn":
+              return _this.num(dt.localWeekNumber, 2);
+            case "ii":
+              return _this.num(dt.localWeekYear.toString().slice(-2), 2);
+            case "iiii":
+              return _this.num(dt.localWeekYear, 4);
+            case "o":
+              return _this.num(dt.ordinal);
+            case "ooo":
+              return _this.num(dt.ordinal, 3);
+            case "q":
+              // like 1
+              return _this.num(dt.quarter);
+            case "qq":
+              // like 01
+              return _this.num(dt.quarter, 2);
+            case "X":
+              return _this.num(Math.floor(dt.ts / 1000));
+            case "x":
+              return _this.num(dt.ts);
+            default:
+              return maybeMacro(token);
+          }
+        };
+      return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+    };
+    _proto.formatDurationFromString = function formatDurationFromString(dur, fmt) {
+      var _this2 = this;
+      var invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+      var tokenToField = function tokenToField(token) {
+          switch (token[0]) {
+            case "S":
+              return "milliseconds";
+            case "s":
+              return "seconds";
+            case "m":
+              return "minutes";
+            case "h":
+              return "hours";
+            case "d":
+              return "days";
+            case "w":
+              return "weeks";
+            case "M":
+              return "months";
+            case "y":
+              return "years";
+            default:
+              return null;
+          }
+        },
+        tokenToString = function tokenToString(lildur, info) {
+          return function (token) {
+            var mapped = tokenToField(token);
+            if (mapped) {
+              var inversionFactor = info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+              var signDisplay;
+              if (_this2.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+                signDisplay = "never";
+              } else if (_this2.opts.signMode === "all") {
+                signDisplay = "always";
+              } else {
+                // "auto" and "negative" are the same, but "auto" has better support
+                signDisplay = "auto";
+              }
+              return _this2.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+            } else {
+              return token;
+            }
+          };
+        },
+        tokens = Formatter.parseFormat(fmt),
+        realTokens = tokens.reduce(function (found, _ref) {
+          var literal = _ref.literal,
+            val = _ref.val;
+          return literal ? found : found.concat(val);
+        }, []),
+        collapsed = dur.shiftTo.apply(dur, realTokens.map(tokenToField).filter(function (t) {
+          return t;
+        })),
+        durationInfo = {
+          isNegativeDuration: collapsed < 0,
+          // this relies on "collapsed" being based on "shiftTo", which builds up the object
+          // in order
+          largestUnit: Object.keys(collapsed.values)[0]
+        };
+      return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+    };
+    return Formatter;
+  }();
+
+  /*
+   * This file handles parsing for well-specified formats. Here's how it works:
+   * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+   * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+   * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+   * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+   * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+   * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+   */
+
+  var ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+  function combineRegexes() {
+    for (var _len = arguments.length, regexes = new Array(_len), _key = 0; _key < _len; _key++) {
+      regexes[_key] = arguments[_key];
+    }
+    var full = regexes.reduce(function (f, r) {
+      return f + r.source;
+    }, "");
+    return RegExp("^" + full + "$");
+  }
+  function combineExtractors() {
+    for (var _len2 = arguments.length, extractors = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      extractors[_key2] = arguments[_key2];
+    }
+    return function (m) {
+      return extractors.reduce(function (_ref, ex) {
+        var mergedVals = _ref[0],
+          mergedZone = _ref[1],
+          cursor = _ref[2];
+        var _ex = ex(m, cursor),
+          val = _ex[0],
+          zone = _ex[1],
+          next = _ex[2];
+        return [_extends({}, mergedVals, val), zone || mergedZone, next];
+      }, [{}, null, 1]).slice(0, 2);
+    };
+  }
+  function parse(s) {
+    if (s == null) {
+      return [null, null];
+    }
+    for (var _len3 = arguments.length, patterns = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
+      patterns[_key3 - 1] = arguments[_key3];
+    }
+    for (var _i = 0, _patterns = patterns; _i < _patterns.length; _i++) {
+      var _patterns$_i = _patterns[_i],
+        regex = _patterns$_i[0],
+        extractor = _patterns$_i[1];
+      var m = regex.exec(s);
+      if (m) {
+        return extractor(m);
+      }
+    }
+    return [null, null];
+  }
+  function simpleParse() {
+    for (var _len4 = arguments.length, keys = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {
+      keys[_key4] = arguments[_key4];
+    }
+    return function (match, cursor) {
+      var ret = {};
+      var i;
+      for (i = 0; i < keys.length; i++) {
+        ret[keys[i]] = parseInteger(match[cursor + i]);
+      }
+      return [ret, null, cursor + i];
+    };
+  }
+
+  // ISO and SQL parsing
+  var offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+  var isoExtendedZone = "(?:" + offsetRegex.source + "?(?:\\[(" + ianaRegex.source + ")\\])?)?";
+  var isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+  var isoTimeRegex = RegExp("" + isoTimeBaseRegex.source + isoExtendedZone);
+  var isoTimeExtensionRegex = RegExp("(?:[Tt]" + isoTimeRegex.source + ")?");
+  var isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+  var isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+  var isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+  var extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+  var extractISOOrdinalData = simpleParse("year", "ordinal");
+  var sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+  var sqlTimeRegex = RegExp(isoTimeBaseRegex.source + " ?(?:" + offsetRegex.source + "|(" + ianaRegex.source + "))?");
+  var sqlTimeExtensionRegex = RegExp("(?: " + sqlTimeRegex.source + ")?");
+  function int(match, pos, fallback) {
+    var m = match[pos];
+    return isUndefined(m) ? fallback : parseInteger(m);
+  }
+  function extractISOYmd(match, cursor) {
+    var item = {
+      year: int(match, cursor),
+      month: int(match, cursor + 1, 1),
+      day: int(match, cursor + 2, 1)
+    };
+    return [item, null, cursor + 3];
+  }
+  function extractISOTime(match, cursor) {
+    var item = {
+      hours: int(match, cursor, 0),
+      minutes: int(match, cursor + 1, 0),
+      seconds: int(match, cursor + 2, 0),
+      milliseconds: parseMillis(match[cursor + 3])
+    };
+    return [item, null, cursor + 4];
+  }
+  function extractISOOffset(match, cursor) {
+    var local = !match[cursor] && !match[cursor + 1],
+      fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+      zone = local ? null : FixedOffsetZone.instance(fullOffset);
+    return [{}, zone, cursor + 3];
+  }
+  function extractIANAZone(match, cursor) {
+    var zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+    return [{}, zone, cursor + 1];
+  }
+
+  // ISO time parsing
+
+  var isoTimeOnly = RegExp("^T?" + isoTimeBaseRegex.source + "$");
+
+  // ISO duration parsing
+
+  var isoDuration = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+  function extractISODuration(match) {
+    var s = match[0],
+      yearStr = match[1],
+      monthStr = match[2],
+      weekStr = match[3],
+      dayStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      millisecondsStr = match[8];
+    var hasNegativePrefix = s[0] === "-";
+    var negativeSeconds = secondStr && secondStr[0] === "-";
+    var maybeNegate = function maybeNegate(num, force) {
+      if (force === void 0) {
+        force = false;
+      }
+      return num !== undefined && (force || num && hasNegativePrefix) ? -num : num;
+    };
+    return [{
+      years: maybeNegate(parseFloating(yearStr)),
+      months: maybeNegate(parseFloating(monthStr)),
+      weeks: maybeNegate(parseFloating(weekStr)),
+      days: maybeNegate(parseFloating(dayStr)),
+      hours: maybeNegate(parseFloating(hourStr)),
+      minutes: maybeNegate(parseFloating(minuteStr)),
+      seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds)
+    }];
+  }
+
+  // These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+  // and not just that we're in -240 *right now*. But since I don't think these are used that often
+  // I'm just going to ignore that
+  var obsOffsets = {
+    GMT: 0,
+    EDT: -4 * 60,
+    EST: -5 * 60,
+    CDT: -5 * 60,
+    CST: -6 * 60,
+    MDT: -6 * 60,
+    MST: -7 * 60,
+    PDT: -7 * 60,
+    PST: -8 * 60
+  };
+  function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+    var result = {
+      year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+      month: monthsShort.indexOf(monthStr) + 1,
+      day: parseInteger(dayStr),
+      hour: parseInteger(hourStr),
+      minute: parseInteger(minuteStr)
+    };
+    if (secondStr) result.second = parseInteger(secondStr);
+    if (weekdayStr) {
+      result.weekday = weekdayStr.length > 3 ? weekdaysLong.indexOf(weekdayStr) + 1 : weekdaysShort.indexOf(weekdayStr) + 1;
+    }
+    return result;
+  }
+
+  // RFC 2822/5322
+  var rfc2822 = /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+  function extractRFC2822(match) {
+    var weekdayStr = match[1],
+      dayStr = match[2],
+      monthStr = match[3],
+      yearStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      obsOffset = match[8],
+      milOffset = match[9],
+      offHourStr = match[10],
+      offMinuteStr = match[11],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    var offset;
+    if (obsOffset) {
+      offset = obsOffsets[obsOffset];
+    } else if (milOffset) {
+      offset = 0;
+    } else {
+      offset = signedOffset(offHourStr, offMinuteStr);
+    }
+    return [result, new FixedOffsetZone(offset)];
+  }
+  function preprocessRFC2822(s) {
+    // Remove comments and folding whitespace and replace multiple-spaces with a single space
+    return s.replace(/\([^()]*\)|[\n\t]/g, " ").replace(/(\s\s+)/g, " ").trim();
+  }
+
+  // http date
+
+  var rfc1123 = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+    rfc850 = /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+    ascii = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+  function extractRFC1123Or850(match) {
+    var weekdayStr = match[1],
+      dayStr = match[2],
+      monthStr = match[3],
+      yearStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    return [result, FixedOffsetZone.utcInstance];
+  }
+  function extractASCII(match) {
+    var weekdayStr = match[1],
+      monthStr = match[2],
+      dayStr = match[3],
+      hourStr = match[4],
+      minuteStr = match[5],
+      secondStr = match[6],
+      yearStr = match[7],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    return [result, FixedOffsetZone.utcInstance];
+  }
+  var isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+  var isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+  var isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+  var isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+  var extractISOYmdTimeAndOffset = combineExtractors(extractISOYmd, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOWeekTimeAndOffset = combineExtractors(extractISOWeekData, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOOrdinalDateAndTime = combineExtractors(extractISOOrdinalData, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOTimeAndOffset = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+
+  /*
+   * @private
+   */
+
+  function parseISODate(s) {
+    return parse(s, [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset], [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime], [isoTimeCombinedRegex, extractISOTimeAndOffset]);
+  }
+  function parseRFC2822Date(s) {
+    return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+  }
+  function parseHTTPDate(s) {
+    return parse(s, [rfc1123, extractRFC1123Or850], [rfc850, extractRFC1123Or850], [ascii, extractASCII]);
+  }
+  function parseISODuration(s) {
+    return parse(s, [isoDuration, extractISODuration]);
+  }
+  var extractISOTimeOnly = combineExtractors(extractISOTime);
+  function parseISOTimeOnly(s) {
+    return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+  }
+  var sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+  var sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+  var extractISOTimeOffsetAndIANAZone = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+  function parseSQL(s) {
+    return parse(s, [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]);
+  }
+
+  var INVALID$2 = "Invalid Duration";
+
+  // unit conversion constants
+  var lowOrderMatrix = {
+      weeks: {
+        days: 7,
+        hours: 7 * 24,
+        minutes: 7 * 24 * 60,
+        seconds: 7 * 24 * 60 * 60,
+        milliseconds: 7 * 24 * 60 * 60 * 1000
+      },
+      days: {
+        hours: 24,
+        minutes: 24 * 60,
+        seconds: 24 * 60 * 60,
+        milliseconds: 24 * 60 * 60 * 1000
+      },
+      hours: {
+        minutes: 60,
+        seconds: 60 * 60,
+        milliseconds: 60 * 60 * 1000
+      },
+      minutes: {
+        seconds: 60,
+        milliseconds: 60 * 1000
+      },
+      seconds: {
+        milliseconds: 1000
+      }
+    },
+    casualMatrix = _extends({
+      years: {
+        quarters: 4,
+        months: 12,
+        weeks: 52,
+        days: 365,
+        hours: 365 * 24,
+        minutes: 365 * 24 * 60,
+        seconds: 365 * 24 * 60 * 60,
+        milliseconds: 365 * 24 * 60 * 60 * 1000
+      },
+      quarters: {
+        months: 3,
+        weeks: 13,
+        days: 91,
+        hours: 91 * 24,
+        minutes: 91 * 24 * 60,
+        seconds: 91 * 24 * 60 * 60,
+        milliseconds: 91 * 24 * 60 * 60 * 1000
+      },
+      months: {
+        weeks: 4,
+        days: 30,
+        hours: 30 * 24,
+        minutes: 30 * 24 * 60,
+        seconds: 30 * 24 * 60 * 60,
+        milliseconds: 30 * 24 * 60 * 60 * 1000
+      }
+    }, lowOrderMatrix),
+    daysInYearAccurate = 146097.0 / 400,
+    daysInMonthAccurate = 146097.0 / 4800,
+    accurateMatrix = _extends({
+      years: {
+        quarters: 4,
+        months: 12,
+        weeks: daysInYearAccurate / 7,
+        days: daysInYearAccurate,
+        hours: daysInYearAccurate * 24,
+        minutes: daysInYearAccurate * 24 * 60,
+        seconds: daysInYearAccurate * 24 * 60 * 60,
+        milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000
+      },
+      quarters: {
+        months: 3,
+        weeks: daysInYearAccurate / 28,
+        days: daysInYearAccurate / 4,
+        hours: daysInYearAccurate * 24 / 4,
+        minutes: daysInYearAccurate * 24 * 60 / 4,
+        seconds: daysInYearAccurate * 24 * 60 * 60 / 4,
+        milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000 / 4
+      },
+      months: {
+        weeks: daysInMonthAccurate / 7,
+        days: daysInMonthAccurate,
+        hours: daysInMonthAccurate * 24,
+        minutes: daysInMonthAccurate * 24 * 60,
+        seconds: daysInMonthAccurate * 24 * 60 * 60,
+        milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000
+      }
+    }, lowOrderMatrix);
+
+  // units ordered by size
+  var orderedUnits$1 = ["years", "quarters", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds"];
+  var reverseUnits = orderedUnits$1.slice(0).reverse();
+
+  // clone really means "create another instance just like this one, but with these changes"
+  function clone$1(dur, alts, clear) {
+    if (clear === void 0) {
+      clear = false;
+    }
+    // deep merge for vals
+    var conf = {
+      values: clear ? alts.values : _extends({}, dur.values, alts.values || {}),
+      loc: dur.loc.clone(alts.loc),
+      conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+      matrix: alts.matrix || dur.matrix
+    };
+    return new Duration(conf);
+  }
+  function durationToMillis(matrix, vals) {
+    var _vals$milliseconds;
+    var sum = (_vals$milliseconds = vals.milliseconds) != null ? _vals$milliseconds : 0;
+    for (var _iterator = _createForOfIteratorHelperLoose(reverseUnits.slice(1)), _step; !(_step = _iterator()).done;) {
+      var unit = _step.value;
+      if (vals[unit]) {
+        sum += vals[unit] * matrix[unit]["milliseconds"];
+      }
+    }
+    return sum;
+  }
+
+  // NB: mutates parameters
+  function normalizeValues(matrix, vals) {
+    // the logic below assumes the overall value of the duration is positive
+    // if this is not the case, factor is used to make it so
+    var factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+    orderedUnits$1.reduceRight(function (previous, current) {
+      if (!isUndefined(vals[current])) {
+        if (previous) {
+          var previousVal = vals[previous] * factor;
+          var conv = matrix[current][previous];
+
+          // if (previousVal < 0):
+          // lower order unit is negative (e.g. { years: 2, days: -2 })
+          // normalize this by reducing the higher order unit by the appropriate amount
+          // and increasing the lower order unit
+          // this can never make the higher order unit negative, because this function only operates
+          // on positive durations, so the amount of time represented by the lower order unit cannot
+          // be larger than the higher order unit
+          // else:
+          // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+          // in this case we attempt to convert as much as possible from the lower order unit into
+          // the higher order one
+          //
+          // Math.floor takes care of both of these cases, rounding away from 0
+          // if previousVal < 0 it makes the absolute value larger
+          // if previousVal >= it makes the absolute value smaller
+          var rollUp = Math.floor(previousVal / conv);
+          vals[current] += rollUp * factor;
+          vals[previous] -= rollUp * conv * factor;
+        }
+        return current;
+      } else {
+        return previous;
+      }
+    }, null);
+
+    // try to convert any decimals into smaller units if possible
+    // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+    orderedUnits$1.reduce(function (previous, current) {
+      if (!isUndefined(vals[current])) {
+        if (previous) {
+          var fraction = vals[previous] % 1;
+          vals[previous] -= fraction;
+          vals[current] += fraction * matrix[previous][current];
+        }
+        return current;
+      } else {
+        return previous;
+      }
+    }, null);
+  }
+
+  // Remove all properties with a value of 0 from an object
+  function removeZeroes(vals) {
+    var newVals = {};
+    for (var _i = 0, _Object$entries = Object.entries(vals); _i < _Object$entries.length; _i++) {
+      var _Object$entries$_i = _Object$entries[_i],
+        key = _Object$entries$_i[0],
+        value = _Object$entries$_i[1];
+      if (value !== 0) {
+        newVals[key] = value;
+      }
+    }
+    return newVals;
+  }
+
+  /**
+   * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+   *
+   * Here is a brief overview of commonly used methods and getters in Duration:
+   *
+   * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+   * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+   * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+   * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+   * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+   *
+   * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+   */
+  var Duration = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @private
+     */
+    function Duration(config) {
+      var accurate = config.conversionAccuracy === "longterm" || false;
+      var matrix = accurate ? accurateMatrix : casualMatrix;
+      if (config.matrix) {
+        matrix = config.matrix;
+      }
+
+      /**
+       * @access private
+       */
+      this.values = config.values;
+      /**
+       * @access private
+       */
+      this.loc = config.loc || Locale.create();
+      /**
+       * @access private
+       */
+      this.conversionAccuracy = accurate ? "longterm" : "casual";
+      /**
+       * @access private
+       */
+      this.invalid = config.invalid || null;
+      /**
+       * @access private
+       */
+      this.matrix = matrix;
+      /**
+       * @access private
+       */
+      this.isLuxonDuration = true;
+    }
+
+    /**
+     * Create Duration from a number of milliseconds.
+     * @param {number} count of milliseconds
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @return {Duration}
+     */
+    Duration.fromMillis = function fromMillis(count, opts) {
+      return Duration.fromObject({
+        milliseconds: count
+      }, opts);
+    }
+
+    /**
+     * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+     * If this object is empty then a zero milliseconds duration is returned.
+     * @param {Object} obj - the object to create the DateTime from
+     * @param {number} obj.years
+     * @param {number} obj.quarters
+     * @param {number} obj.months
+     * @param {number} obj.weeks
+     * @param {number} obj.days
+     * @param {number} obj.hours
+     * @param {number} obj.minutes
+     * @param {number} obj.seconds
+     * @param {number} obj.milliseconds
+     * @param {Object} [opts=[]] - options for creating this Duration
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the custom conversion system to use
+     * @return {Duration}
+     */;
+    Duration.fromObject = function fromObject(obj, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (obj == null || typeof obj !== "object") {
+        throw new InvalidArgumentError("Duration.fromObject: argument expected to be an object, got " + (obj === null ? "null" : typeof obj));
+      }
+      return new Duration({
+        values: normalizeObject(obj, Duration.normalizeUnit),
+        loc: Locale.fromObject(opts),
+        conversionAccuracy: opts.conversionAccuracy,
+        matrix: opts.matrix
+      });
+    }
+
+    /**
+     * Create a Duration from DurationLike.
+     *
+     * @param {Object | number | Duration} durationLike
+     * One of:
+     * - object with keys like 'years' and 'hours'.
+     * - number representing milliseconds
+     * - Duration instance
+     * @return {Duration}
+     */;
+    Duration.fromDurationLike = function fromDurationLike(durationLike) {
+      if (isNumber(durationLike)) {
+        return Duration.fromMillis(durationLike);
+      } else if (Duration.isDuration(durationLike)) {
+        return durationLike;
+      } else if (typeof durationLike === "object") {
+        return Duration.fromObject(durationLike);
+      } else {
+        throw new InvalidArgumentError("Unknown duration argument " + durationLike + " of type " + typeof durationLike);
+      }
+    }
+
+    /**
+     * Create a Duration from an ISO 8601 duration string.
+     * @param {string} text - text to parse
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the preset conversion system to use
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+     * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+     * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+     * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+     * @return {Duration}
+     */;
+    Duration.fromISO = function fromISO(text, opts) {
+      var _parseISODuration = parseISODuration(text),
+        parsed = _parseISODuration[0];
+      if (parsed) {
+        return Duration.fromObject(parsed, opts);
+      } else {
+        return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+      }
+    }
+
+    /**
+     * Create a Duration from an ISO 8601 time string.
+     * @param {string} text - text to parse
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the conversion system to use
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+     * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+     * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @return {Duration}
+     */;
+    Duration.fromISOTime = function fromISOTime(text, opts) {
+      var _parseISOTimeOnly = parseISOTimeOnly(text),
+        parsed = _parseISOTimeOnly[0];
+      if (parsed) {
+        return Duration.fromObject(parsed, opts);
+      } else {
+        return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+      }
+    }
+
+    /**
+     * Create an invalid Duration.
+     * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {Duration}
+     */;
+    Duration.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidDurationError(invalid);
+      } else {
+        return new Duration({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * @private
+     */;
+    Duration.normalizeUnit = function normalizeUnit(unit) {
+      var normalized = {
+        year: "years",
+        years: "years",
+        quarter: "quarters",
+        quarters: "quarters",
+        month: "months",
+        months: "months",
+        week: "weeks",
+        weeks: "weeks",
+        day: "days",
+        days: "days",
+        hour: "hours",
+        hours: "hours",
+        minute: "minutes",
+        minutes: "minutes",
+        second: "seconds",
+        seconds: "seconds",
+        millisecond: "milliseconds",
+        milliseconds: "milliseconds"
+      }[unit ? unit.toLowerCase() : unit];
+      if (!normalized) throw new InvalidUnitError(unit);
+      return normalized;
+    }
+
+    /**
+     * Check if an object is a Duration. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    Duration.isDuration = function isDuration(o) {
+      return o && o.isLuxonDuration || false;
+    }
+
+    /**
+     * Get  the locale of a Duration, such 'en-GB'
+     * @type {string}
+     */;
+    var _proto = Duration.prototype;
+    /**
+     * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+     * * `S` for milliseconds
+     * * `s` for seconds
+     * * `m` for minutes
+     * * `h` for hours
+     * * `d` for days
+     * * `w` for weeks
+     * * `M` for months
+     * * `y` for years
+     * Notes:
+     * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+     * * Tokens can be escaped by wrapping with single quotes.
+     * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+     * @param {string} fmt - the format string
+     * @param {Object} opts - options
+     * @param {boolean} [opts.floor=true] - floor numerical values
+     * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+     * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+     * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+     * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+     * @return {string}
+     */
+    _proto.toFormat = function toFormat(fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+      var fmtOpts = _extends({}, opts, {
+        floor: opts.round !== false && opts.floor !== false
+      });
+      return this.isValid ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt) : INVALID$2;
+    }
+
+    /**
+     * Returns a string representation of a Duration with all units included.
+     * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+     * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+     * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+     * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+     * @example
+     * ```js
+     * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+     * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+     * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+     * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+     * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+     * ```
+     */;
+    _proto.toHuman = function toHuman(opts) {
+      var _this = this;
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return INVALID$2;
+      var showZeros = opts.showZeros !== false;
+      var l = orderedUnits$1.map(function (unit) {
+        var val = _this.values[unit];
+        if (isUndefined(val) || val === 0 && !showZeros) {
+          return null;
+        }
+        return _this.loc.numberFormatter(_extends({
+          style: "unit",
+          unitDisplay: "long"
+        }, opts, {
+          unit: unit.slice(0, -1)
+        })).format(val);
+      }).filter(function (n) {
+        return n;
+      });
+      return this.loc.listFormatter(_extends({
+        type: "conjunction",
+        style: opts.listStyle || "narrow"
+      }, opts)).format(l);
+    }
+
+    /**
+     * Returns a JavaScript object with this Duration's values.
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+     * @return {Object}
+     */;
+    _proto.toObject = function toObject() {
+      if (!this.isValid) return {};
+      return _extends({}, this.values);
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Duration.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+     * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+     * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+     * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+     * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+     * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+     * @return {string}
+     */;
+    _proto.toISO = function toISO() {
+      // we could use the formatter, but this is an easier way to get the minimum string
+      if (!this.isValid) return null;
+      var s = "P";
+      if (this.years !== 0) s += this.years + "Y";
+      if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+      if (this.weeks !== 0) s += this.weeks + "W";
+      if (this.days !== 0) s += this.days + "D";
+      if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0) s += "T";
+      if (this.hours !== 0) s += this.hours + "H";
+      if (this.minutes !== 0) s += this.minutes + "M";
+      if (this.seconds !== 0 || this.milliseconds !== 0)
+        // this will handle "floating point madness" by removing extra decimal places
+        // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+        s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+      if (s === "P") s += "T0S";
+      return s;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+     * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return null;
+      var millis = this.toMillis();
+      if (millis < 0 || millis >= 86400000) return null;
+      opts = _extends({
+        suppressMilliseconds: false,
+        suppressSeconds: false,
+        includePrefix: false,
+        format: "extended"
+      }, opts, {
+        includeOffset: false
+      });
+      var dateTime = DateTime.fromMillis(millis, {
+        zone: "UTC"
+      });
+      return dateTime.toISOTime(opts);
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+     * @return {string}
+     */;
+    _proto.toJSON = function toJSON() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns a string representation of this Duration appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "Duration { values: " + JSON.stringify(this.values) + " }";
+      } else {
+        return "Duration { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns an milliseconds value of this Duration.
+     * @return {number}
+     */;
+    _proto.toMillis = function toMillis() {
+      if (!this.isValid) return NaN;
+      return durationToMillis(this.matrix, this.values);
+    }
+
+    /**
+     * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+     * @return {number}
+     */;
+    _proto.valueOf = function valueOf() {
+      return this.toMillis();
+    }
+
+    /**
+     * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+     * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @return {Duration}
+     */;
+    _proto.plus = function plus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration),
+        result = {};
+      for (var _i2 = 0, _orderedUnits = orderedUnits$1; _i2 < _orderedUnits.length; _i2++) {
+        var k = _orderedUnits[_i2];
+        if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+          result[k] = dur.get(k) + this.get(k);
+        }
+      }
+      return clone$1(this, {
+        values: result
+      }, true);
+    }
+
+    /**
+     * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+     * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @return {Duration}
+     */;
+    _proto.minus = function minus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration);
+      return this.plus(dur.negate());
+    }
+
+    /**
+     * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+     * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+     * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+     * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+     * @return {Duration}
+     */;
+    _proto.mapUnits = function mapUnits(fn) {
+      if (!this.isValid) return this;
+      var result = {};
+      for (var _i3 = 0, _Object$keys = Object.keys(this.values); _i3 < _Object$keys.length; _i3++) {
+        var k = _Object$keys[_i3];
+        result[k] = asNumber(fn(this.values[k], k));
+      }
+      return clone$1(this, {
+        values: result
+      }, true);
+    }
+
+    /**
+     * Get the value of unit.
+     * @param {string} unit - a unit such as 'minute' or 'day'
+     * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+     * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+     * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+     * @return {number}
+     */;
+    _proto.get = function get(unit) {
+      return this[Duration.normalizeUnit(unit)];
+    }
+
+    /**
+     * "Set" the values of specified units. Return a newly-constructed Duration.
+     * @param {Object} values - a mapping of units to numbers
+     * @example dur.set({ years: 2017 })
+     * @example dur.set({ hours: 8, minutes: 30 })
+     * @return {Duration}
+     */;
+    _proto.set = function set(values) {
+      if (!this.isValid) return this;
+      var mixed = _extends({}, this.values, normalizeObject(values, Duration.normalizeUnit));
+      return clone$1(this, {
+        values: mixed
+      });
+    }
+
+    /**
+     * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+     * @example dur.reconfigure({ locale: 'en-GB' })
+     * @return {Duration}
+     */;
+    _proto.reconfigure = function reconfigure(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        locale = _ref.locale,
+        numberingSystem = _ref.numberingSystem,
+        conversionAccuracy = _ref.conversionAccuracy,
+        matrix = _ref.matrix;
+      var loc = this.loc.clone({
+        locale: locale,
+        numberingSystem: numberingSystem
+      });
+      var opts = {
+        loc: loc,
+        matrix: matrix,
+        conversionAccuracy: conversionAccuracy
+      };
+      return clone$1(this, opts);
+    }
+
+    /**
+     * Return the length of the duration in the specified unit.
+     * @param {string} unit - a unit such as 'minutes' or 'days'
+     * @example Duration.fromObject({years: 1}).as('days') //=> 365
+     * @example Duration.fromObject({years: 1}).as('months') //=> 12
+     * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+     * @return {number}
+     */;
+    _proto.as = function as(unit) {
+      return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+    }
+
+    /**
+     * Reduce this Duration to its canonical representation in its current units.
+     * Assuming the overall value of the Duration is positive, this means:
+     * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+     * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+     *   the overall value would be negative, see third example)
+     * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+     *
+     * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+     * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+     * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+     * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+     * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+     * @return {Duration}
+     */;
+    _proto.normalize = function normalize() {
+      if (!this.isValid) return this;
+      var vals = this.toObject();
+      normalizeValues(this.matrix, vals);
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Rescale units to its largest representation
+     * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+     * @return {Duration}
+     */;
+    _proto.rescale = function rescale() {
+      if (!this.isValid) return this;
+      var vals = removeZeroes(this.normalize().shiftToAll().toObject());
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Convert this Duration into its representation in a different set of units.
+     * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+     * @return {Duration}
+     */;
+    _proto.shiftTo = function shiftTo() {
+      for (var _len = arguments.length, units = new Array(_len), _key = 0; _key < _len; _key++) {
+        units[_key] = arguments[_key];
+      }
+      if (!this.isValid) return this;
+      if (units.length === 0) {
+        return this;
+      }
+      units = units.map(function (u) {
+        return Duration.normalizeUnit(u);
+      });
+      var built = {},
+        accumulated = {},
+        vals = this.toObject();
+      var lastUnit;
+      for (var _i4 = 0, _orderedUnits2 = orderedUnits$1; _i4 < _orderedUnits2.length; _i4++) {
+        var k = _orderedUnits2[_i4];
+        if (units.indexOf(k) >= 0) {
+          lastUnit = k;
+          var own = 0;
+
+          // anything we haven't boiled down yet should get boiled to this unit
+          for (var ak in accumulated) {
+            own += this.matrix[ak][k] * accumulated[ak];
+            accumulated[ak] = 0;
+          }
+
+          // plus anything that's already in this unit
+          if (isNumber(vals[k])) {
+            own += vals[k];
+          }
+
+          // only keep the integer part for now in the hopes of putting any decimal part
+          // into a smaller unit later
+          var i = Math.trunc(own);
+          built[k] = i;
+          accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+          // otherwise, keep it in the wings to boil it later
+        } else if (isNumber(vals[k])) {
+          accumulated[k] = vals[k];
+        }
+      }
+
+      // anything leftover becomes the decimal for the last unit
+      // lastUnit must be defined since units is not empty
+      for (var key in accumulated) {
+        if (accumulated[key] !== 0) {
+          built[lastUnit] += key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+        }
+      }
+      normalizeValues(this.matrix, built);
+      return clone$1(this, {
+        values: built
+      }, true);
+    }
+
+    /**
+     * Shift this Duration to all available units.
+     * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+     * @return {Duration}
+     */;
+    _proto.shiftToAll = function shiftToAll() {
+      if (!this.isValid) return this;
+      return this.shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds");
+    }
+
+    /**
+     * Return the negative of this Duration.
+     * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+     * @return {Duration}
+     */;
+    _proto.negate = function negate() {
+      if (!this.isValid) return this;
+      var negated = {};
+      for (var _i5 = 0, _Object$keys2 = Object.keys(this.values); _i5 < _Object$keys2.length; _i5++) {
+        var k = _Object$keys2[_i5];
+        negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+      }
+      return clone$1(this, {
+        values: negated
+      }, true);
+    }
+
+    /**
+     * Removes all units with values equal to 0 from this Duration.
+     * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+     * @return {Duration}
+     */;
+    _proto.removeZeros = function removeZeros() {
+      if (!this.isValid) return this;
+      var vals = removeZeroes(this.values);
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Get the years.
+     * @type {number}
+     */;
+    /**
+     * Equality check
+     * Two Durations are equal iff they have the same units and the same values for each unit.
+     * @param {Duration} other
+     * @return {boolean}
+     */
+    _proto.equals = function equals(other) {
+      if (!this.isValid || !other.isValid) {
+        return false;
+      }
+      if (!this.loc.equals(other.loc)) {
+        return false;
+      }
+      function eq(v1, v2) {
+        // Consider 0 and undefined as equal
+        if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+        return v1 === v2;
+      }
+      for (var _i6 = 0, _orderedUnits3 = orderedUnits$1; _i6 < _orderedUnits3.length; _i6++) {
+        var u = _orderedUnits3[_i6];
+        if (!eq(this.values[u], other.values[u])) {
+          return false;
+        }
+      }
+      return true;
+    };
+    _createClass(Duration, [{
+      key: "locale",
+      get: function get() {
+        return this.isValid ? this.loc.locale : null;
+      }
+
+      /**
+       * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+       *
+       * @type {string}
+       */
+    }, {
+      key: "numberingSystem",
+      get: function get() {
+        return this.isValid ? this.loc.numberingSystem : null;
+      }
+    }, {
+      key: "years",
+      get: function get() {
+        return this.isValid ? this.values.years || 0 : NaN;
+      }
+
+      /**
+       * Get the quarters.
+       * @type {number}
+       */
+    }, {
+      key: "quarters",
+      get: function get() {
+        return this.isValid ? this.values.quarters || 0 : NaN;
+      }
+
+      /**
+       * Get the months.
+       * @type {number}
+       */
+    }, {
+      key: "months",
+      get: function get() {
+        return this.isValid ? this.values.months || 0 : NaN;
+      }
+
+      /**
+       * Get the weeks
+       * @type {number}
+       */
+    }, {
+      key: "weeks",
+      get: function get() {
+        return this.isValid ? this.values.weeks || 0 : NaN;
+      }
+
+      /**
+       * Get the days.
+       * @type {number}
+       */
+    }, {
+      key: "days",
+      get: function get() {
+        return this.isValid ? this.values.days || 0 : NaN;
+      }
+
+      /**
+       * Get the hours.
+       * @type {number}
+       */
+    }, {
+      key: "hours",
+      get: function get() {
+        return this.isValid ? this.values.hours || 0 : NaN;
+      }
+
+      /**
+       * Get the minutes.
+       * @type {number}
+       */
+    }, {
+      key: "minutes",
+      get: function get() {
+        return this.isValid ? this.values.minutes || 0 : NaN;
+      }
+
+      /**
+       * Get the seconds.
+       * @return {number}
+       */
+    }, {
+      key: "seconds",
+      get: function get() {
+        return this.isValid ? this.values.seconds || 0 : NaN;
+      }
+
+      /**
+       * Get the milliseconds.
+       * @return {number}
+       */
+    }, {
+      key: "milliseconds",
+      get: function get() {
+        return this.isValid ? this.values.milliseconds || 0 : NaN;
+      }
+
+      /**
+       * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+       * on invalid DateTimes or Intervals.
+       * @return {boolean}
+       */
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.invalid === null;
+      }
+
+      /**
+       * Returns an error code if this Duration became invalid, or null if the Duration is valid
+       * @return {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+    }]);
+    return Duration;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+
+  var INVALID$1 = "Invalid Interval";
+
+  // checks if the start is equal to or before the end
+  function validateStartEnd(start, end) {
+    if (!start || !start.isValid) {
+      return Interval.invalid("missing or invalid start");
+    } else if (!end || !end.isValid) {
+      return Interval.invalid("missing or invalid end");
+    } else if (end < start) {
+      return Interval.invalid("end before start", "The end of an interval must be after its start, but you had start=" + start.toISO() + " and end=" + end.toISO());
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+   *
+   * Here is a brief overview of the most commonly used methods and getters in Interval:
+   *
+   * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+   * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+   * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+   * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+   * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+   * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+   */
+  var Interval = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @private
+     */
+    function Interval(config) {
+      /**
+       * @access private
+       */
+      this.s = config.start;
+      /**
+       * @access private
+       */
+      this.e = config.end;
+      /**
+       * @access private
+       */
+      this.invalid = config.invalid || null;
+      /**
+       * @access private
+       */
+      this.isLuxonInterval = true;
+    }
+
+    /**
+     * Create an invalid Interval.
+     * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {Interval}
+     */
+    Interval.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidIntervalError(invalid);
+      } else {
+        return new Interval({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+     * @param {DateTime|Date|Object} start
+     * @param {DateTime|Date|Object} end
+     * @return {Interval}
+     */;
+    Interval.fromDateTimes = function fromDateTimes(start, end) {
+      var builtStart = friendlyDateTime(start),
+        builtEnd = friendlyDateTime(end);
+      var validateError = validateStartEnd(builtStart, builtEnd);
+      if (validateError == null) {
+        return new Interval({
+          start: builtStart,
+          end: builtEnd
+        });
+      } else {
+        return validateError;
+      }
+    }
+
+    /**
+     * Create an Interval from a start DateTime and a Duration to extend to.
+     * @param {DateTime|Date|Object} start
+     * @param {Duration|Object|number} duration - the length of the Interval.
+     * @return {Interval}
+     */;
+    Interval.after = function after(start, duration) {
+      var dur = Duration.fromDurationLike(duration),
+        dt = friendlyDateTime(start);
+      return Interval.fromDateTimes(dt, dt.plus(dur));
+    }
+
+    /**
+     * Create an Interval from an end DateTime and a Duration to extend backwards to.
+     * @param {DateTime|Date|Object} end
+     * @param {Duration|Object|number} duration - the length of the Interval.
+     * @return {Interval}
+     */;
+    Interval.before = function before(end, duration) {
+      var dur = Duration.fromDurationLike(duration),
+        dt = friendlyDateTime(end);
+      return Interval.fromDateTimes(dt.minus(dur), dt);
+    }
+
+    /**
+     * Create an Interval from an ISO 8601 string.
+     * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+     * @param {string} text - the ISO string to parse
+     * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @return {Interval}
+     */;
+    Interval.fromISO = function fromISO(text, opts) {
+      var _split = (text || "").split("/", 2),
+        s = _split[0],
+        e = _split[1];
+      if (s && e) {
+        var start, startIsValid;
+        try {
+          start = DateTime.fromISO(s, opts);
+          startIsValid = start.isValid;
+        } catch (e) {
+          startIsValid = false;
+        }
+        var end, endIsValid;
+        try {
+          end = DateTime.fromISO(e, opts);
+          endIsValid = end.isValid;
+        } catch (e) {
+          endIsValid = false;
+        }
+        if (startIsValid && endIsValid) {
+          return Interval.fromDateTimes(start, end);
+        }
+        if (startIsValid) {
+          var dur = Duration.fromISO(e, opts);
+          if (dur.isValid) {
+            return Interval.after(start, dur);
+          }
+        } else if (endIsValid) {
+          var _dur = Duration.fromISO(s, opts);
+          if (_dur.isValid) {
+            return Interval.before(end, _dur);
+          }
+        }
+      }
+      return Interval.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+    }
+
+    /**
+     * Check if an object is an Interval. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    Interval.isInterval = function isInterval(o) {
+      return o && o.isLuxonInterval || false;
+    }
+
+    /**
+     * Returns the start of the Interval
+     * @type {DateTime}
+     */;
+    var _proto = Interval.prototype;
+    /**
+     * Returns the length of the Interval in the specified unit.
+     * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+     * @return {number}
+     */
+    _proto.length = function length(unit) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      return this.isValid ? this.toDuration.apply(this, [unit]).get(unit) : NaN;
+    }
+
+    /**
+     * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+     * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+     * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+     * @param {string} [unit='milliseconds'] - the unit of time to count.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+     * @return {number}
+     */;
+    _proto.count = function count(unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (!this.isValid) return NaN;
+      var start = this.start.startOf(unit, opts);
+      var end;
+      if (opts != null && opts.useLocaleWeeks) {
+        end = this.end.reconfigure({
+          locale: start.locale
+        });
+      } else {
+        end = this.end;
+      }
+      end = end.startOf(unit, opts);
+      return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+    }
+
+    /**
+     * Returns whether this Interval's start and end are both in the same unit of time
+     * @param {string} unit - the unit of time to check sameness on
+     * @return {boolean}
+     */;
+    _proto.hasSame = function hasSame(unit) {
+      return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+    }
+
+    /**
+     * Return whether this Interval has the same start and end DateTimes.
+     * @return {boolean}
+     */;
+    _proto.isEmpty = function isEmpty() {
+      return this.s.valueOf() === this.e.valueOf();
+    }
+
+    /**
+     * Return whether this Interval's start is after the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.isAfter = function isAfter(dateTime) {
+      if (!this.isValid) return false;
+      return this.s > dateTime;
+    }
+
+    /**
+     * Return whether this Interval's end is before the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.isBefore = function isBefore(dateTime) {
+      if (!this.isValid) return false;
+      return this.e <= dateTime;
+    }
+
+    /**
+     * Return whether this Interval contains the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.contains = function contains(dateTime) {
+      if (!this.isValid) return false;
+      return this.s <= dateTime && this.e > dateTime;
+    }
+
+    /**
+     * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+     * @param {Object} values - the values to set
+     * @param {DateTime} values.start - the starting DateTime
+     * @param {DateTime} values.end - the ending DateTime
+     * @return {Interval}
+     */;
+    _proto.set = function set(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        start = _ref.start,
+        end = _ref.end;
+      if (!this.isValid) return this;
+      return Interval.fromDateTimes(start || this.s, end || this.e);
+    }
+
+    /**
+     * Split this Interval at each of the specified DateTimes
+     * @param {...DateTime} dateTimes - the unit of time to count.
+     * @return {Array}
+     */;
+    _proto.splitAt = function splitAt() {
+      var _this = this;
+      if (!this.isValid) return [];
+      for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+        dateTimes[_key] = arguments[_key];
+      }
+      var sorted = dateTimes.map(friendlyDateTime).filter(function (d) {
+          return _this.contains(d);
+        }).sort(function (a, b) {
+          return a.toMillis() - b.toMillis();
+        }),
+        results = [];
+      var s = this.s,
+        i = 0;
+      while (s < this.e) {
+        var added = sorted[i] || this.e,
+          next = +added > +this.e ? this.e : added;
+        results.push(Interval.fromDateTimes(s, next));
+        s = next;
+        i += 1;
+      }
+      return results;
+    }
+
+    /**
+     * Split this Interval into smaller Intervals, each of the specified length.
+     * Left over time is grouped into a smaller interval
+     * @param {Duration|Object|number} duration - The length of each resulting interval.
+     * @return {Array}
+     */;
+    _proto.splitBy = function splitBy(duration) {
+      var dur = Duration.fromDurationLike(duration);
+      if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+        return [];
+      }
+      var s = this.s,
+        idx = 1,
+        next;
+      var results = [];
+      while (s < this.e) {
+        var added = this.start.plus(dur.mapUnits(function (x) {
+          return x * idx;
+        }));
+        next = +added > +this.e ? this.e : added;
+        results.push(Interval.fromDateTimes(s, next));
+        s = next;
+        idx += 1;
+      }
+      return results;
+    }
+
+    /**
+     * Split this Interval into the specified number of smaller intervals.
+     * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+     * @return {Array}
+     */;
+    _proto.divideEqually = function divideEqually(numberOfParts) {
+      if (!this.isValid) return [];
+      return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+    }
+
+    /**
+     * Return whether this Interval overlaps with the specified Interval
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.overlaps = function overlaps(other) {
+      return this.e > other.s && this.s < other.e;
+    }
+
+    /**
+     * Return whether this Interval's end is adjacent to the specified Interval's start.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.abutsStart = function abutsStart(other) {
+      if (!this.isValid) return false;
+      return +this.e === +other.s;
+    }
+
+    /**
+     * Return whether this Interval's start is adjacent to the specified Interval's end.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.abutsEnd = function abutsEnd(other) {
+      if (!this.isValid) return false;
+      return +other.e === +this.s;
+    }
+
+    /**
+     * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.engulfs = function engulfs(other) {
+      if (!this.isValid) return false;
+      return this.s <= other.s && this.e >= other.e;
+    }
+
+    /**
+     * Return whether this Interval has the same start and end as the specified Interval.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(other) {
+      if (!this.isValid || !other.isValid) {
+        return false;
+      }
+      return this.s.equals(other.s) && this.e.equals(other.e);
+    }
+
+    /**
+     * Return an Interval representing the intersection of this Interval and the specified Interval.
+     * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+     * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+     * @param {Interval} other
+     * @return {Interval}
+     */;
+    _proto.intersection = function intersection(other) {
+      if (!this.isValid) return this;
+      var s = this.s > other.s ? this.s : other.s,
+        e = this.e < other.e ? this.e : other.e;
+      if (s >= e) {
+        return null;
+      } else {
+        return Interval.fromDateTimes(s, e);
+      }
+    }
+
+    /**
+     * Return an Interval representing the union of this Interval and the specified Interval.
+     * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+     * @param {Interval} other
+     * @return {Interval}
+     */;
+    _proto.union = function union(other) {
+      if (!this.isValid) return this;
+      var s = this.s < other.s ? this.s : other.s,
+        e = this.e > other.e ? this.e : other.e;
+      return Interval.fromDateTimes(s, e);
+    }
+
+    /**
+     * Merge an array of Intervals into an equivalent minimal set of Intervals.
+     * Combines overlapping and adjacent Intervals.
+     * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+     * and ending with the latest.
+     *
+     * @param {Array} intervals
+     * @return {Array}
+     */;
+    Interval.merge = function merge(intervals) {
+      var _intervals$sort$reduc = intervals.sort(function (a, b) {
+          return a.s - b.s;
+        }).reduce(function (_ref2, item) {
+          var sofar = _ref2[0],
+            current = _ref2[1];
+          if (!current) {
+            return [sofar, item];
+          } else if (current.overlaps(item) || current.abutsStart(item)) {
+            return [sofar, current.union(item)];
+          } else {
+            return [sofar.concat([current]), item];
+          }
+        }, [[], null]),
+        found = _intervals$sort$reduc[0],
+        final = _intervals$sort$reduc[1];
+      if (final) {
+        found.push(final);
+      }
+      return found;
+    }
+
+    /**
+     * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+     * @param {Array} intervals
+     * @return {Array}
+     */;
+    Interval.xor = function xor(intervals) {
+      var _Array$prototype;
+      var start = null,
+        currentCount = 0;
+      var results = [],
+        ends = intervals.map(function (i) {
+          return [{
+            time: i.s,
+            type: "s"
+          }, {
+            time: i.e,
+            type: "e"
+          }];
+        }),
+        flattened = (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, ends),
+        arr = flattened.sort(function (a, b) {
+          return a.time - b.time;
+        });
+      for (var _iterator = _createForOfIteratorHelperLoose(arr), _step; !(_step = _iterator()).done;) {
+        var i = _step.value;
+        currentCount += i.type === "s" ? 1 : -1;
+        if (currentCount === 1) {
+          start = i.time;
+        } else {
+          if (start && +start !== +i.time) {
+            results.push(Interval.fromDateTimes(start, i.time));
+          }
+          start = null;
+        }
+      }
+      return Interval.merge(results);
+    }
+
+    /**
+     * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+     * @param {...Interval} intervals
+     * @return {Array}
+     */;
+    _proto.difference = function difference() {
+      var _this2 = this;
+      for (var _len2 = arguments.length, intervals = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        intervals[_key2] = arguments[_key2];
+      }
+      return Interval.xor([this].concat(intervals)).map(function (i) {
+        return _this2.intersection(i);
+      }).filter(function (i) {
+        return i && !i.isEmpty();
+      });
+    }
+
+    /**
+     * Returns a string representation of this Interval appropriate for debugging.
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      if (!this.isValid) return INVALID$1;
+      return "[" + this.s.toISO() + " \u2013 " + this.e.toISO() + ")";
+    }
+
+    /**
+     * Returns a string representation of this Interval appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "Interval { start: " + this.s.toISO() + ", end: " + this.e.toISO() + " }";
+      } else {
+        return "Interval { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns a localized string representing this Interval. Accepts the same options as the
+     * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+     * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+     * is browser-specific, but in general it will return an appropriate representation of the
+     * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+     * specified.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+     * Intl.DateTimeFormat constructor options.
+     * @param {Object} opts - Options to override the configuration of the start DateTime.
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+     * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+     * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+     * @return {string}
+     */;
+    _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+      if (formatOpts === void 0) {
+        formatOpts = DATE_SHORT;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this) : INVALID$1;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Interval.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @param {Object} opts - The same options as {@link DateTime#toISO}
+     * @return {string}
+     */;
+    _proto.toISO = function toISO(opts) {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISO(opts) + "/" + this.e.toISO(opts);
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of date of this Interval.
+     * The time components are ignored.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @return {string}
+     */;
+    _proto.toISODate = function toISODate() {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISODate() + "/" + this.e.toISODate();
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of time of this Interval.
+     * The date components are ignored.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @param {Object} opts - The same options as {@link DateTime#toISO}
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(opts) {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISOTime(opts) + "/" + this.e.toISOTime(opts);
+    }
+
+    /**
+     * Returns a string representation of this Interval formatted according to the specified format
+     * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+     * formatting tool.
+     * @param {string} dateFormat - The format string. This string formats the start and end time.
+     * See {@link DateTime#toFormat} for details.
+     * @param {Object} opts - Options.
+     * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+     * representations.
+     * @return {string}
+     */;
+    _proto.toFormat = function toFormat(dateFormat, _temp2) {
+      var _ref3 = _temp2 === void 0 ? {} : _temp2,
+        _ref3$separator = _ref3.separator,
+        separator = _ref3$separator === void 0 ? " – " : _ref3$separator;
+      if (!this.isValid) return INVALID$1;
+      return "" + this.s.toFormat(dateFormat) + separator + this.e.toFormat(dateFormat);
+    }
+
+    /**
+     * Return a Duration representing the time spanned by this interval.
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+     * @return {Duration}
+     */;
+    _proto.toDuration = function toDuration(unit, opts) {
+      if (!this.isValid) {
+        return Duration.invalid(this.invalidReason);
+      }
+      return this.e.diff(this.s, unit, opts);
+    }
+
+    /**
+     * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+     * @param {function} mapFn
+     * @return {Interval}
+     * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+     * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+     */;
+    _proto.mapEndpoints = function mapEndpoints(mapFn) {
+      return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+    };
+    _createClass(Interval, [{
+      key: "start",
+      get: function get() {
+        return this.isValid ? this.s : null;
+      }
+
+      /**
+       * Returns the end of the Interval. This is the first instant which is not part of the interval
+       * (Interval is half-open).
+       * @type {DateTime}
+       */
+    }, {
+      key: "end",
+      get: function get() {
+        return this.isValid ? this.e : null;
+      }
+
+      /**
+       * Returns the last DateTime included in the interval (since end is not part of the interval)
+       * @type {DateTime}
+       */
+    }, {
+      key: "lastDateTime",
+      get: function get() {
+        return this.isValid ? this.e ? this.e.minus(1) : null : null;
+      }
+
+      /**
+       * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+       * @type {boolean}
+       */
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.invalidReason === null;
+      }
+
+      /**
+       * Returns an error code if this Interval is invalid, or null if the Interval is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+    }]);
+    return Interval;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+
+  /**
+   * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+   */
+  var Info = /*#__PURE__*/function () {
+    function Info() {}
+    /**
+     * Return whether the specified zone contains a DST.
+     * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+     * @return {boolean}
+     */
+    Info.hasDST = function hasDST(zone) {
+      if (zone === void 0) {
+        zone = Settings.defaultZone;
+      }
+      var proto = DateTime.now().setZone(zone).set({
+        month: 12
+      });
+      return !zone.isUniversal && proto.offset !== proto.set({
+        month: 6
+      }).offset;
+    }
+
+    /**
+     * Return whether the specified zone is a valid IANA specifier.
+     * @param {string} zone - Zone to check
+     * @return {boolean}
+     */;
+    Info.isValidIANAZone = function isValidIANAZone(zone) {
+      return IANAZone.isValidZone(zone);
+    }
+
+    /**
+     * Converts the input into a {@link Zone} instance.
+     *
+     * * If `input` is already a Zone instance, it is returned unchanged.
+     * * If `input` is a string containing a valid time zone name, a Zone instance
+     *   with that name is returned.
+     * * If `input` is a string that doesn't refer to a known time zone, a Zone
+     *   instance with {@link Zone#isValid} == false is returned.
+     * * If `input is a number, a Zone instance with the specified fixed offset
+     *   in minutes is returned.
+     * * If `input` is `null` or `undefined`, the default zone is returned.
+     * @param {string|Zone|number} [input] - the value to be converted
+     * @return {Zone}
+     */;
+    Info.normalizeZone = function normalizeZone$1(input) {
+      return normalizeZone(input, Settings.defaultZone);
+    }
+
+    /**
+     * Get the weekday on which the week starts according to the given locale.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+     */;
+    Info.getStartOfWeek = function getStartOfWeek(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        _ref$locale = _ref.locale,
+        locale = _ref$locale === void 0 ? null : _ref$locale,
+        _ref$locObj = _ref.locObj,
+        locObj = _ref$locObj === void 0 ? null : _ref$locObj;
+      return (locObj || Locale.create(locale)).getStartOfWeek();
+    }
+
+    /**
+     * Get the minimum number of days necessary in a week before it is considered part of the next year according
+     * to the given locale.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number}
+     */;
+    Info.getMinimumDaysInFirstWeek = function getMinimumDaysInFirstWeek(_temp2) {
+      var _ref2 = _temp2 === void 0 ? {} : _temp2,
+        _ref2$locale = _ref2.locale,
+        locale = _ref2$locale === void 0 ? null : _ref2$locale,
+        _ref2$locObj = _ref2.locObj,
+        locObj = _ref2$locObj === void 0 ? null : _ref2$locObj;
+      return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+    }
+
+    /**
+     * Get the weekdays, which are considered the weekend according to the given locale
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+     */;
+    Info.getWeekendWeekdays = function getWeekendWeekdays(_temp3) {
+      var _ref3 = _temp3 === void 0 ? {} : _temp3,
+        _ref3$locale = _ref3.locale,
+        locale = _ref3$locale === void 0 ? null : _ref3$locale,
+        _ref3$locObj = _ref3.locObj,
+        locObj = _ref3$locObj === void 0 ? null : _ref3$locObj;
+      // copy the array, because we cache it internally
+      return (locObj || Locale.create(locale)).getWeekendDays().slice();
+    }
+
+    /**
+     * Return an array of standalone month names.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @param {string} [opts.outputCalendar='gregory'] - the calendar
+     * @example Info.months()[0] //=> 'January'
+     * @example Info.months('short')[0] //=> 'Jan'
+     * @example Info.months('numeric')[0] //=> '1'
+     * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+     * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+     * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+     * @return {Array}
+     */;
+    Info.months = function months(length, _temp4) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref4 = _temp4 === void 0 ? {} : _temp4,
+        _ref4$locale = _ref4.locale,
+        locale = _ref4$locale === void 0 ? null : _ref4$locale,
+        _ref4$numberingSystem = _ref4.numberingSystem,
+        numberingSystem = _ref4$numberingSystem === void 0 ? null : _ref4$numberingSystem,
+        _ref4$locObj = _ref4.locObj,
+        locObj = _ref4$locObj === void 0 ? null : _ref4$locObj,
+        _ref4$outputCalendar = _ref4.outputCalendar,
+        outputCalendar = _ref4$outputCalendar === void 0 ? "gregory" : _ref4$outputCalendar;
+      return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+    }
+
+    /**
+     * Return an array of format month names.
+     * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+     * changes the string.
+     * See {@link Info#months}
+     * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @param {string} [opts.outputCalendar='gregory'] - the calendar
+     * @return {Array}
+     */;
+    Info.monthsFormat = function monthsFormat(length, _temp5) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref5 = _temp5 === void 0 ? {} : _temp5,
+        _ref5$locale = _ref5.locale,
+        locale = _ref5$locale === void 0 ? null : _ref5$locale,
+        _ref5$numberingSystem = _ref5.numberingSystem,
+        numberingSystem = _ref5$numberingSystem === void 0 ? null : _ref5$numberingSystem,
+        _ref5$locObj = _ref5.locObj,
+        locObj = _ref5$locObj === void 0 ? null : _ref5$locObj,
+        _ref5$outputCalendar = _ref5.outputCalendar,
+        outputCalendar = _ref5$outputCalendar === void 0 ? "gregory" : _ref5$outputCalendar;
+      return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+    }
+
+    /**
+     * Return an array of standalone week names.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @example Info.weekdays()[0] //=> 'Monday'
+     * @example Info.weekdays('short')[0] //=> 'Mon'
+     * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+     * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+     * @return {Array}
+     */;
+    Info.weekdays = function weekdays(length, _temp6) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref6 = _temp6 === void 0 ? {} : _temp6,
+        _ref6$locale = _ref6.locale,
+        locale = _ref6$locale === void 0 ? null : _ref6$locale,
+        _ref6$numberingSystem = _ref6.numberingSystem,
+        numberingSystem = _ref6$numberingSystem === void 0 ? null : _ref6$numberingSystem,
+        _ref6$locObj = _ref6.locObj,
+        locObj = _ref6$locObj === void 0 ? null : _ref6$locObj;
+      return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+    }
+
+    /**
+     * Return an array of format week names.
+     * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+     * changes the string.
+     * See {@link Info#weekdays}
+     * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale=null] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @return {Array}
+     */;
+    Info.weekdaysFormat = function weekdaysFormat(length, _temp7) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref7 = _temp7 === void 0 ? {} : _temp7,
+        _ref7$locale = _ref7.locale,
+        locale = _ref7$locale === void 0 ? null : _ref7$locale,
+        _ref7$numberingSystem = _ref7.numberingSystem,
+        numberingSystem = _ref7$numberingSystem === void 0 ? null : _ref7$numberingSystem,
+        _ref7$locObj = _ref7.locObj,
+        locObj = _ref7$locObj === void 0 ? null : _ref7$locObj;
+      return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+    }
+
+    /**
+     * Return an array of meridiems.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+     * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+     * @return {Array}
+     */;
+    Info.meridiems = function meridiems(_temp8) {
+      var _ref8 = _temp8 === void 0 ? {} : _temp8,
+        _ref8$locale = _ref8.locale,
+        locale = _ref8$locale === void 0 ? null : _ref8$locale;
+      return Locale.create(locale).meridiems();
+    }
+
+    /**
+     * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+     * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @example Info.eras() //=> [ 'BC', 'AD' ]
+     * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+     * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+     * @return {Array}
+     */;
+    Info.eras = function eras(length, _temp9) {
+      if (length === void 0) {
+        length = "short";
+      }
+      var _ref9 = _temp9 === void 0 ? {} : _temp9,
+        _ref9$locale = _ref9.locale,
+        locale = _ref9$locale === void 0 ? null : _ref9$locale;
+      return Locale.create(locale, null, "gregory").eras(length);
+    }
+
+    /**
+     * Return the set of available features in this environment.
+     * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+     * Keys:
+     * * `relative`: whether this environment supports relative time formatting
+     * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+     * @example Info.features() //=> { relative: false, localeWeek: true }
+     * @return {Object}
+     */;
+    Info.features = function features() {
+      return {
+        relative: hasRelative(),
+        localeWeek: hasLocaleWeekInfo()
+      };
+    };
+    return Info;
+  }();
+
+  function dayDiff(earlier, later) {
+    var utcDayStart = function utcDayStart(dt) {
+        return dt.toUTC(0, {
+          keepLocalTime: true
+        }).startOf("day").valueOf();
+      },
+      ms = utcDayStart(later) - utcDayStart(earlier);
+    return Math.floor(Duration.fromMillis(ms).as("days"));
+  }
+  function highOrderDiffs(cursor, later, units) {
+    var differs = [["years", function (a, b) {
+      return b.year - a.year;
+    }], ["quarters", function (a, b) {
+      return b.quarter - a.quarter + (b.year - a.year) * 4;
+    }], ["months", function (a, b) {
+      return b.month - a.month + (b.year - a.year) * 12;
+    }], ["weeks", function (a, b) {
+      var days = dayDiff(a, b);
+      return (days - days % 7) / 7;
+    }], ["days", dayDiff]];
+    var results = {};
+    var earlier = cursor;
+    var lowestOrder, highWater;
+
+    /* This loop tries to diff using larger units first.
+       If we overshoot, we backtrack and try the next smaller unit.
+       "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+       as we use smaller and smaller units.
+       highWater keeps track of where we would be if we added one more of the smallest unit,
+       this is used later to potentially convert any difference smaller than the smallest higher order unit
+       into a fraction of that smallest higher order unit
+    */
+    for (var _i = 0, _differs = differs; _i < _differs.length; _i++) {
+      var _differs$_i = _differs[_i],
+        unit = _differs$_i[0],
+        differ = _differs$_i[1];
+      if (units.indexOf(unit) >= 0) {
+        lowestOrder = unit;
+        results[unit] = differ(cursor, later);
+        highWater = earlier.plus(results);
+        if (highWater > later) {
+          // we overshot the end point, backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+
+          // if we are still overshooting now, we need to backtrack again
+          // this happens in certain situations when diffing times in different zones,
+          // because this calculation ignores time zones
+          if (cursor > later) {
+            // keep the "overshot by 1" around as highWater
+            highWater = cursor;
+            // backtrack cursor by 1
+            results[unit]--;
+            cursor = earlier.plus(results);
+          }
+        } else {
+          cursor = highWater;
+        }
+      }
+    }
+    return [cursor, results, highWater, lowestOrder];
+  }
+  function _diff (earlier, later, units, opts) {
+    var _highOrderDiffs = highOrderDiffs(earlier, later, units),
+      cursor = _highOrderDiffs[0],
+      results = _highOrderDiffs[1],
+      highWater = _highOrderDiffs[2],
+      lowestOrder = _highOrderDiffs[3];
+    var remainingMillis = later - cursor;
+    var lowerOrderUnits = units.filter(function (u) {
+      return ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0;
+    });
+    if (lowerOrderUnits.length === 0) {
+      if (highWater < later) {
+        var _cursor$plus;
+        highWater = cursor.plus((_cursor$plus = {}, _cursor$plus[lowestOrder] = 1, _cursor$plus));
+      }
+      if (highWater !== cursor) {
+        results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+      }
+    }
+    var duration = Duration.fromObject(results, opts);
+    if (lowerOrderUnits.length > 0) {
+      var _Duration$fromMillis;
+      return (_Duration$fromMillis = Duration.fromMillis(remainingMillis, opts)).shiftTo.apply(_Duration$fromMillis, lowerOrderUnits).plus(duration);
+    } else {
+      return duration;
+    }
+  }
+
+  var MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+  function intUnit(regex, post) {
+    if (post === void 0) {
+      post = function post(i) {
+        return i;
+      };
+    }
+    return {
+      regex: regex,
+      deser: function deser(_ref) {
+        var s = _ref[0];
+        return post(parseDigits(s));
+      }
+    };
+  }
+  var NBSP = String.fromCharCode(160);
+  var spaceOrNBSP = "[ " + NBSP + "]";
+  var spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+  function fixListRegex(s) {
+    // make dots optional and also make them literal
+    // make space and non breakable space characters interchangeable
+    return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+  }
+  function stripInsensitivities(s) {
+    return s.replace(/\./g, "") // ignore dots that were made optional
+    .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+    .toLowerCase();
+  }
+  function oneOf(strings, startIndex) {
+    if (strings === null) {
+      return null;
+    } else {
+      return {
+        regex: RegExp(strings.map(fixListRegex).join("|")),
+        deser: function deser(_ref2) {
+          var s = _ref2[0];
+          return strings.findIndex(function (i) {
+            return stripInsensitivities(s) === stripInsensitivities(i);
+          }) + startIndex;
+        }
+      };
+    }
+  }
+  function offset(regex, groups) {
+    return {
+      regex: regex,
+      deser: function deser(_ref3) {
+        var h = _ref3[1],
+          m = _ref3[2];
+        return signedOffset(h, m);
+      },
+      groups: groups
+    };
+  }
+  function simple(regex) {
+    return {
+      regex: regex,
+      deser: function deser(_ref4) {
+        var s = _ref4[0];
+        return s;
+      }
+    };
+  }
+  function escapeToken(value) {
+    return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+  }
+
+  /**
+   * @param token
+   * @param {Locale} loc
+   */
+  function unitForToken(token, loc) {
+    var one = digitRegex(loc),
+      two = digitRegex(loc, "{2}"),
+      three = digitRegex(loc, "{3}"),
+      four = digitRegex(loc, "{4}"),
+      six = digitRegex(loc, "{6}"),
+      oneOrTwo = digitRegex(loc, "{1,2}"),
+      oneToThree = digitRegex(loc, "{1,3}"),
+      oneToSix = digitRegex(loc, "{1,6}"),
+      oneToNine = digitRegex(loc, "{1,9}"),
+      twoToFour = digitRegex(loc, "{2,4}"),
+      fourToSix = digitRegex(loc, "{4,6}"),
+      literal = function literal(t) {
+        return {
+          regex: RegExp(escapeToken(t.val)),
+          deser: function deser(_ref5) {
+            var s = _ref5[0];
+            return s;
+          },
+          literal: true
+        };
+      },
+      unitate = function unitate(t) {
+        if (token.literal) {
+          return literal(t);
+        }
+        switch (t.val) {
+          // era
+          case "G":
+            return oneOf(loc.eras("short"), 0);
+          case "GG":
+            return oneOf(loc.eras("long"), 0);
+          // years
+          case "y":
+            return intUnit(oneToSix);
+          case "yy":
+            return intUnit(twoToFour, untruncateYear);
+          case "yyyy":
+            return intUnit(four);
+          case "yyyyy":
+            return intUnit(fourToSix);
+          case "yyyyyy":
+            return intUnit(six);
+          // months
+          case "M":
+            return intUnit(oneOrTwo);
+          case "MM":
+            return intUnit(two);
+          case "MMM":
+            return oneOf(loc.months("short", true), 1);
+          case "MMMM":
+            return oneOf(loc.months("long", true), 1);
+          case "L":
+            return intUnit(oneOrTwo);
+          case "LL":
+            return intUnit(two);
+          case "LLL":
+            return oneOf(loc.months("short", false), 1);
+          case "LLLL":
+            return oneOf(loc.months("long", false), 1);
+          // dates
+          case "d":
+            return intUnit(oneOrTwo);
+          case "dd":
+            return intUnit(two);
+          // ordinals
+          case "o":
+            return intUnit(oneToThree);
+          case "ooo":
+            return intUnit(three);
+          // time
+          case "HH":
+            return intUnit(two);
+          case "H":
+            return intUnit(oneOrTwo);
+          case "hh":
+            return intUnit(two);
+          case "h":
+            return intUnit(oneOrTwo);
+          case "mm":
+            return intUnit(two);
+          case "m":
+            return intUnit(oneOrTwo);
+          case "q":
+            return intUnit(oneOrTwo);
+          case "qq":
+            return intUnit(two);
+          case "s":
+            return intUnit(oneOrTwo);
+          case "ss":
+            return intUnit(two);
+          case "S":
+            return intUnit(oneToThree);
+          case "SSS":
+            return intUnit(three);
+          case "u":
+            return simple(oneToNine);
+          case "uu":
+            return simple(oneOrTwo);
+          case "uuu":
+            return intUnit(one);
+          // meridiem
+          case "a":
+            return oneOf(loc.meridiems(), 0);
+          // weekYear (k)
+          case "kkkk":
+            return intUnit(four);
+          case "kk":
+            return intUnit(twoToFour, untruncateYear);
+          // weekNumber (W)
+          case "W":
+            return intUnit(oneOrTwo);
+          case "WW":
+            return intUnit(two);
+          // weekdays
+          case "E":
+          case "c":
+            return intUnit(one);
+          case "EEE":
+            return oneOf(loc.weekdays("short", false), 1);
+          case "EEEE":
+            return oneOf(loc.weekdays("long", false), 1);
+          case "ccc":
+            return oneOf(loc.weekdays("short", true), 1);
+          case "cccc":
+            return oneOf(loc.weekdays("long", true), 1);
+          // offset/zone
+          case "Z":
+          case "ZZ":
+            return offset(new RegExp("([+-]" + oneOrTwo.source + ")(?::(" + two.source + "))?"), 2);
+          case "ZZZ":
+            return offset(new RegExp("([+-]" + oneOrTwo.source + ")(" + two.source + ")?"), 2);
+          // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+          // because we don't have any way to figure out what they are
+          case "z":
+            return simple(/[a-z_+-/]{1,256}?/i);
+          // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+          // in this case we accept any non-newline white-space
+          case " ":
+            return simple(/[^\S\n\r]/);
+          default:
+            return literal(t);
+        }
+      };
+    var unit = unitate(token) || {
+      invalidReason: MISSING_FTP
+    };
+    unit.token = token;
+    return unit;
+  }
+  var partTypeStyleToTokenVal = {
+    year: {
+      "2-digit": "yy",
+      numeric: "yyyyy"
+    },
+    month: {
+      numeric: "M",
+      "2-digit": "MM",
+      short: "MMM",
+      long: "MMMM"
+    },
+    day: {
+      numeric: "d",
+      "2-digit": "dd"
+    },
+    weekday: {
+      short: "EEE",
+      long: "EEEE"
+    },
+    dayperiod: "a",
+    dayPeriod: "a",
+    hour12: {
+      numeric: "h",
+      "2-digit": "hh"
+    },
+    hour24: {
+      numeric: "H",
+      "2-digit": "HH"
+    },
+    minute: {
+      numeric: "m",
+      "2-digit": "mm"
+    },
+    second: {
+      numeric: "s",
+      "2-digit": "ss"
+    },
+    timeZoneName: {
+      long: "ZZZZZ",
+      short: "ZZZ"
+    }
+  };
+  function tokenForPart(part, formatOpts, resolvedOpts) {
+    var type = part.type,
+      value = part.value;
+    if (type === "literal") {
+      var isSpace = /^\s+$/.test(value);
+      return {
+        literal: !isSpace,
+        val: isSpace ? " " : value
+      };
+    }
+    var style = formatOpts[type];
+
+    // The user might have explicitly specified hour12 or hourCycle
+    // if so, respect their decision
+    // if not, refer back to the resolvedOpts, which are based on the locale
+    var actualType = type;
+    if (type === "hour") {
+      if (formatOpts.hour12 != null) {
+        actualType = formatOpts.hour12 ? "hour12" : "hour24";
+      } else if (formatOpts.hourCycle != null) {
+        if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+          actualType = "hour12";
+        } else {
+          actualType = "hour24";
+        }
+      } else {
+        // tokens only differentiate between 24 hours or not,
+        // so we do not need to check hourCycle here, which is less supported anyways
+        actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+      }
+    }
+    var val = partTypeStyleToTokenVal[actualType];
+    if (typeof val === "object") {
+      val = val[style];
+    }
+    if (val) {
+      return {
+        literal: false,
+        val: val
+      };
+    }
+    return undefined;
+  }
+  function buildRegex(units) {
+    var re = units.map(function (u) {
+      return u.regex;
+    }).reduce(function (f, r) {
+      return f + "(" + r.source + ")";
+    }, "");
+    return ["^" + re + "$", units];
+  }
+  function match(input, regex, handlers) {
+    var matches = input.match(regex);
+    if (matches) {
+      var all = {};
+      var matchIndex = 1;
+      for (var i in handlers) {
+        if (hasOwnProperty(handlers, i)) {
+          var h = handlers[i],
+            groups = h.groups ? h.groups + 1 : 1;
+          if (!h.literal && h.token) {
+            all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+          }
+          matchIndex += groups;
+        }
+      }
+      return [matches, all];
+    } else {
+      return [matches, {}];
+    }
+  }
+  function dateTimeFromMatches(matches) {
+    var toField = function toField(token) {
+      switch (token) {
+        case "S":
+          return "millisecond";
+        case "s":
+          return "second";
+        case "m":
+          return "minute";
+        case "h":
+        case "H":
+          return "hour";
+        case "d":
+          return "day";
+        case "o":
+          return "ordinal";
+        case "L":
+        case "M":
+          return "month";
+        case "y":
+          return "year";
+        case "E":
+        case "c":
+          return "weekday";
+        case "W":
+          return "weekNumber";
+        case "k":
+          return "weekYear";
+        case "q":
+          return "quarter";
+        default:
+          return null;
+      }
+    };
+    var zone = null;
+    var specificOffset;
+    if (!isUndefined(matches.z)) {
+      zone = IANAZone.create(matches.z);
+    }
+    if (!isUndefined(matches.Z)) {
+      if (!zone) {
+        zone = new FixedOffsetZone(matches.Z);
+      }
+      specificOffset = matches.Z;
+    }
+    if (!isUndefined(matches.q)) {
+      matches.M = (matches.q - 1) * 3 + 1;
+    }
+    if (!isUndefined(matches.h)) {
+      if (matches.h < 12 && matches.a === 1) {
+        matches.h += 12;
+      } else if (matches.h === 12 && matches.a === 0) {
+        matches.h = 0;
+      }
+    }
+    if (matches.G === 0 && matches.y) {
+      matches.y = -matches.y;
+    }
+    if (!isUndefined(matches.u)) {
+      matches.S = parseMillis(matches.u);
+    }
+    var vals = Object.keys(matches).reduce(function (r, k) {
+      var f = toField(k);
+      if (f) {
+        r[f] = matches[k];
+      }
+      return r;
+    }, {});
+    return [vals, zone, specificOffset];
+  }
+  var dummyDateTimeCache = null;
+  function getDummyDateTime() {
+    if (!dummyDateTimeCache) {
+      dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+    }
+    return dummyDateTimeCache;
+  }
+  function maybeExpandMacroToken(token, locale) {
+    if (token.literal) {
+      return token;
+    }
+    var formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+    var tokens = formatOptsToTokens(formatOpts, locale);
+    if (tokens == null || tokens.includes(undefined)) {
+      return token;
+    }
+    return tokens;
+  }
+  function expandMacroTokens(tokens, locale) {
+    var _Array$prototype;
+    return (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, tokens.map(function (t) {
+      return maybeExpandMacroToken(t, locale);
+    }));
+  }
+
+  /**
+   * @private
+   */
+
+  var TokenParser = /*#__PURE__*/function () {
+    function TokenParser(locale, format) {
+      this.locale = locale;
+      this.format = format;
+      this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+      this.units = this.tokens.map(function (t) {
+        return unitForToken(t, locale);
+      });
+      this.disqualifyingUnit = this.units.find(function (t) {
+        return t.invalidReason;
+      });
+      if (!this.disqualifyingUnit) {
+        var _buildRegex = buildRegex(this.units),
+          regexString = _buildRegex[0],
+          handlers = _buildRegex[1];
+        this.regex = RegExp(regexString, "i");
+        this.handlers = handlers;
+      }
+    }
+    var _proto = TokenParser.prototype;
+    _proto.explainFromTokens = function explainFromTokens(input) {
+      if (!this.isValid) {
+        return {
+          input: input,
+          tokens: this.tokens,
+          invalidReason: this.invalidReason
+        };
+      } else {
+        var _match = match(input, this.regex, this.handlers),
+          rawMatches = _match[0],
+          matches = _match[1],
+          _ref6 = matches ? dateTimeFromMatches(matches) : [null, null, undefined],
+          result = _ref6[0],
+          zone = _ref6[1],
+          specificOffset = _ref6[2];
+        if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+          throw new ConflictingSpecificationError("Can't include meridiem when specifying 24-hour format");
+        }
+        return {
+          input: input,
+          tokens: this.tokens,
+          regex: this.regex,
+          rawMatches: rawMatches,
+          matches: matches,
+          result: result,
+          zone: zone,
+          specificOffset: specificOffset
+        };
+      }
+    };
+    _createClass(TokenParser, [{
+      key: "isValid",
+      get: function get() {
+        return !this.disqualifyingUnit;
+      }
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+      }
+    }]);
+    return TokenParser;
+  }();
+  function explainFromTokens(locale, input, format) {
+    var parser = new TokenParser(locale, format);
+    return parser.explainFromTokens(input);
+  }
+  function parseFromTokens(locale, input, format) {
+    var _explainFromTokens = explainFromTokens(locale, input, format),
+      result = _explainFromTokens.result,
+      zone = _explainFromTokens.zone,
+      specificOffset = _explainFromTokens.specificOffset,
+      invalidReason = _explainFromTokens.invalidReason;
+    return [result, zone, specificOffset, invalidReason];
+  }
+  function formatOptsToTokens(formatOpts, locale) {
+    if (!formatOpts) {
+      return null;
+    }
+    var formatter = Formatter.create(locale, formatOpts);
+    var df = formatter.dtFormatter(getDummyDateTime());
+    var parts = df.formatToParts();
+    var resolvedOpts = df.resolvedOptions();
+    return parts.map(function (p) {
+      return tokenForPart(p, formatOpts, resolvedOpts);
+    });
+  }
+
+  var INVALID = "Invalid DateTime";
+  var MAX_DATE = 8.64e15;
+  function unsupportedZone(zone) {
+    return new Invalid("unsupported zone", "the zone \"" + zone.name + "\" is not supported");
+  }
+
+  // we cache week data on the DT object and this intermediates the cache
+  /**
+   * @param {DateTime} dt
+   */
+  function possiblyCachedWeekData(dt) {
+    if (dt.weekData === null) {
+      dt.weekData = gregorianToWeek(dt.c);
+    }
+    return dt.weekData;
+  }
+
+  /**
+   * @param {DateTime} dt
+   */
+  function possiblyCachedLocalWeekData(dt) {
+    if (dt.localWeekData === null) {
+      dt.localWeekData = gregorianToWeek(dt.c, dt.loc.getMinDaysInFirstWeek(), dt.loc.getStartOfWeek());
+    }
+    return dt.localWeekData;
+  }
+
+  // clone really means, "make a new object with these modifications". all "setters" really use this
+  // to create a new object while only changing some of the properties
+  function clone(inst, alts) {
+    var current = {
+      ts: inst.ts,
+      zone: inst.zone,
+      c: inst.c,
+      o: inst.o,
+      loc: inst.loc,
+      invalid: inst.invalid
+    };
+    return new DateTime(_extends({}, current, alts, {
+      old: current
+    }));
+  }
+
+  // find the right offset a given local time. The o input is our guess, which determines which
+  // offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+  function fixOffset(localTS, o, tz) {
+    // Our UTC time is just a guess because our offset is just a guess
+    var utcGuess = localTS - o * 60 * 1000;
+
+    // Test whether the zone matches the offset for this ts
+    var o2 = tz.offset(utcGuess);
+
+    // If so, offset didn't change and we're done
+    if (o === o2) {
+      return [utcGuess, o];
+    }
+
+    // If not, change the ts by the difference in the offset
+    utcGuess -= (o2 - o) * 60 * 1000;
+
+    // If that gives us the local time we want, we're done
+    var o3 = tz.offset(utcGuess);
+    if (o2 === o3) {
+      return [utcGuess, o2];
+    }
+
+    // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+    return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+  }
+
+  // convert an epoch timestamp into a calendar object with the given offset
+  function tsToObj(ts, offset) {
+    ts += offset * 60 * 1000;
+    var d = new Date(ts);
+    return {
+      year: d.getUTCFullYear(),
+      month: d.getUTCMonth() + 1,
+      day: d.getUTCDate(),
+      hour: d.getUTCHours(),
+      minute: d.getUTCMinutes(),
+      second: d.getUTCSeconds(),
+      millisecond: d.getUTCMilliseconds()
+    };
+  }
+
+  // convert a calendar object to a epoch timestamp
+  function objToTS(obj, offset, zone) {
+    return fixOffset(objToLocalTS(obj), offset, zone);
+  }
+
+  // create a new DT instance by adding a duration, adjusting for DSTs
+  function adjustTime(inst, dur) {
+    var oPre = inst.o,
+      year = inst.c.year + Math.trunc(dur.years),
+      month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+      c = _extends({}, inst.c, {
+        year: year,
+        month: month,
+        day: Math.min(inst.c.day, daysInMonth(year, month)) + Math.trunc(dur.days) + Math.trunc(dur.weeks) * 7
+      }),
+      millisToAdd = Duration.fromObject({
+        years: dur.years - Math.trunc(dur.years),
+        quarters: dur.quarters - Math.trunc(dur.quarters),
+        months: dur.months - Math.trunc(dur.months),
+        weeks: dur.weeks - Math.trunc(dur.weeks),
+        days: dur.days - Math.trunc(dur.days),
+        hours: dur.hours,
+        minutes: dur.minutes,
+        seconds: dur.seconds,
+        milliseconds: dur.milliseconds
+      }).as("milliseconds"),
+      localTS = objToLocalTS(c);
+    var _fixOffset = fixOffset(localTS, oPre, inst.zone),
+      ts = _fixOffset[0],
+      o = _fixOffset[1];
+    if (millisToAdd !== 0) {
+      ts += millisToAdd;
+      // that could have changed the offset by going over a DST, but we want to keep the ts the same
+      o = inst.zone.offset(ts);
+    }
+    return {
+      ts: ts,
+      o: o
+    };
+  }
+
+  // helper useful in turning the results of parsing into real dates
+  // by handling the zone options
+  function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+    var setZone = opts.setZone,
+      zone = opts.zone;
+    if (parsed && Object.keys(parsed).length !== 0 || parsedZone) {
+      var interpretationZone = parsedZone || zone,
+        inst = DateTime.fromObject(parsed, _extends({}, opts, {
+          zone: interpretationZone,
+          specificOffset: specificOffset
+        }));
+      return setZone ? inst : inst.setZone(zone);
+    } else {
+      return DateTime.invalid(new Invalid("unparsable", "the input \"" + text + "\" can't be parsed as " + format));
+    }
+  }
+
+  // if you want to output a technical format (e.g. RFC 2822), this helper
+  // helps handle the details
+  function toTechFormat(dt, format, allowZ) {
+    if (allowZ === void 0) {
+      allowZ = true;
+    }
+    return dt.isValid ? Formatter.create(Locale.create("en-US"), {
+      allowZ: allowZ,
+      forceSimple: true
+    }).formatDateTimeFromString(dt, format) : null;
+  }
+  function _toISODate(o, extended, precision) {
+    var longFormat = o.c.year > 9999 || o.c.year < 0;
+    var c = "";
+    if (longFormat && o.c.year >= 0) c += "+";
+    c += padStart(o.c.year, longFormat ? 6 : 4);
+    if (precision === "year") return c;
+    if (extended) {
+      c += "-";
+      c += padStart(o.c.month);
+      if (precision === "month") return c;
+      c += "-";
+    } else {
+      c += padStart(o.c.month);
+      if (precision === "month") return c;
+    }
+    c += padStart(o.c.day);
+    return c;
+  }
+  function _toISOTime(o, extended, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision) {
+    var showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+      c = "";
+    switch (precision) {
+      case "day":
+      case "month":
+      case "year":
+        break;
+      default:
+        c += padStart(o.c.hour);
+        if (precision === "hour") break;
+        if (extended) {
+          c += ":";
+          c += padStart(o.c.minute);
+          if (precision === "minute") break;
+          if (showSeconds) {
+            c += ":";
+            c += padStart(o.c.second);
+          }
+        } else {
+          c += padStart(o.c.minute);
+          if (precision === "minute") break;
+          if (showSeconds) {
+            c += padStart(o.c.second);
+          }
+        }
+        if (precision === "second") break;
+        if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+          c += ".";
+          c += padStart(o.c.millisecond, 3);
+        }
+    }
+    if (includeOffset) {
+      if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+        c += "Z";
+      } else if (o.o < 0) {
+        c += "-";
+        c += padStart(Math.trunc(-o.o / 60));
+        c += ":";
+        c += padStart(Math.trunc(-o.o % 60));
+      } else {
+        c += "+";
+        c += padStart(Math.trunc(o.o / 60));
+        c += ":";
+        c += padStart(Math.trunc(o.o % 60));
+      }
+    }
+    if (extendedZone) {
+      c += "[" + o.zone.ianaName + "]";
+    }
+    return c;
+  }
+
+  // defaults for unspecified units in the supported calendars
+  var defaultUnitValues = {
+      month: 1,
+      day: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    },
+    defaultWeekUnitValues = {
+      weekNumber: 1,
+      weekday: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    },
+    defaultOrdinalUnitValues = {
+      ordinal: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    };
+
+  // Units in the supported calendars, sorted by bigness
+  var orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+    orderedWeekUnits = ["weekYear", "weekNumber", "weekday", "hour", "minute", "second", "millisecond"],
+    orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+  // standardize case and plurality in units
+  function normalizeUnit(unit) {
+    var normalized = {
+      year: "year",
+      years: "year",
+      month: "month",
+      months: "month",
+      day: "day",
+      days: "day",
+      hour: "hour",
+      hours: "hour",
+      minute: "minute",
+      minutes: "minute",
+      quarter: "quarter",
+      quarters: "quarter",
+      second: "second",
+      seconds: "second",
+      millisecond: "millisecond",
+      milliseconds: "millisecond",
+      weekday: "weekday",
+      weekdays: "weekday",
+      weeknumber: "weekNumber",
+      weeksnumber: "weekNumber",
+      weeknumbers: "weekNumber",
+      weekyear: "weekYear",
+      weekyears: "weekYear",
+      ordinal: "ordinal"
+    }[unit.toLowerCase()];
+    if (!normalized) throw new InvalidUnitError(unit);
+    return normalized;
+  }
+  function normalizeUnitWithLocalWeeks(unit) {
+    switch (unit.toLowerCase()) {
+      case "localweekday":
+      case "localweekdays":
+        return "localWeekday";
+      case "localweeknumber":
+      case "localweeknumbers":
+        return "localWeekNumber";
+      case "localweekyear":
+      case "localweekyears":
+        return "localWeekYear";
+      default:
+        return normalizeUnit(unit);
+    }
+  }
+
+  // cache offsets for zones based on the current timestamp when this function is
+  // first called. When we are handling a datetime from components like (year,
+  // month, day, hour) in a time zone, we need a guess about what the timezone
+  // offset is so that we can convert into a UTC timestamp. One way is to find the
+  // offset of now in the zone. The actual date may have a different offset (for
+  // example, if we handle a date in June while we're in December in a zone that
+  // observes DST), but we can check and adjust that.
+  //
+  // When handling many dates, calculating the offset for now every time is
+  // expensive. It's just a guess, so we can cache the offset to use even if we
+  // are right on a time change boundary (we'll just correct in the other
+  // direction). Using a timestamp from first read is a slight optimization for
+  // handling dates close to the current date, since those dates will usually be
+  // in the same offset (we could set the timestamp statically, instead). We use a
+  // single timestamp for all zones to make things a bit more predictable.
+  //
+  // This is safe for quickDT (used by local() and utc()) because we don't fill in
+  // higher-order units from tsNow (as we do in fromObject, this requires that
+  // offset is calculated from tsNow).
+  /**
+   * @param {Zone} zone
+   * @return {number}
+   */
+  function guessOffsetForZone(zone) {
+    if (zoneOffsetTs === undefined) {
+      zoneOffsetTs = Settings.now();
+    }
+
+    // Do not cache anything but IANA zones, because it is not safe to do so.
+    // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+    if (zone.type !== "iana") {
+      return zone.offset(zoneOffsetTs);
+    }
+    var zoneName = zone.name;
+    var offsetGuess = zoneOffsetGuessCache.get(zoneName);
+    if (offsetGuess === undefined) {
+      offsetGuess = zone.offset(zoneOffsetTs);
+      zoneOffsetGuessCache.set(zoneName, offsetGuess);
+    }
+    return offsetGuess;
+  }
+
+  // this is a dumbed down version of fromObject() that runs about 60% faster
+  // but doesn't do any validation, makes a bunch of assumptions about what units
+  // are present, and so on.
+  function quickDT(obj, opts) {
+    var zone = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    }
+    var loc = Locale.fromObject(opts);
+    var ts, o;
+
+    // assume we have the higher-order units
+    if (!isUndefined(obj.year)) {
+      for (var _i = 0, _orderedUnits = orderedUnits; _i < _orderedUnits.length; _i++) {
+        var u = _orderedUnits[_i];
+        if (isUndefined(obj[u])) {
+          obj[u] = defaultUnitValues[u];
+        }
+      }
+      var invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      }
+      var offsetProvis = guessOffsetForZone(zone);
+      var _objToTS = objToTS(obj, offsetProvis, zone);
+      ts = _objToTS[0];
+      o = _objToTS[1];
+    } else {
+      ts = Settings.now();
+    }
+    return new DateTime({
+      ts: ts,
+      zone: zone,
+      loc: loc,
+      o: o
+    });
+  }
+  function diffRelative(start, end, opts) {
+    var round = isUndefined(opts.round) ? true : opts.round,
+      rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+      format = function format(c, unit) {
+        c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+        var formatter = end.loc.clone(opts).relFormatter(opts);
+        return formatter.format(c, unit);
+      },
+      differ = function differ(unit) {
+        if (opts.calendary) {
+          if (!end.hasSame(start, unit)) {
+            return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+          } else return 0;
+        } else {
+          return end.diff(start, unit).get(unit);
+        }
+      };
+    if (opts.unit) {
+      return format(differ(opts.unit), opts.unit);
+    }
+    for (var _iterator = _createForOfIteratorHelperLoose(opts.units), _step; !(_step = _iterator()).done;) {
+      var unit = _step.value;
+      var count = differ(unit);
+      if (Math.abs(count) >= 1) {
+        return format(count, unit);
+      }
+    }
+    return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+  }
+  function lastOpts(argList) {
+    var opts = {},
+      args;
+    if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+      opts = argList[argList.length - 1];
+      args = Array.from(argList).slice(0, argList.length - 1);
+    } else {
+      args = Array.from(argList);
+    }
+    return [opts, args];
+  }
+
+  /**
+   * Timestamp to use for cached zone offset guesses (exposed for test)
+   */
+  var zoneOffsetTs;
+  /**
+   * Cache for zone offset guesses (exposed for test).
+   *
+   * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+   * zone.offset().
+   */
+  var zoneOffsetGuessCache = new Map();
+
+  /**
+   * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+   *
+   * A DateTime comprises of:
+   * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+   * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+   * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+   *
+   * Here is a brief overview of the most commonly used functionality it provides:
+   *
+   * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+   * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+   * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+   * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+   * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+   * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+   * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+   *
+   * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+   */
+  var DateTime = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @access private
+     */
+    function DateTime(config) {
+      var zone = config.zone || Settings.defaultZone;
+      var invalid = config.invalid || (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) || (!zone.isValid ? unsupportedZone(zone) : null);
+      /**
+       * @access private
+       */
+      this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+      var c = null,
+        o = null;
+      if (!invalid) {
+        var unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+        if (unchanged) {
+          var _ref = [config.old.c, config.old.o];
+          c = _ref[0];
+          o = _ref[1];
+        } else {
+          // If an offset has been passed and we have not been called from
+          // clone(), we can trust it and avoid the offset calculation.
+          var ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+          c = tsToObj(this.ts, ot);
+          invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+          c = invalid ? null : c;
+          o = invalid ? null : ot;
+        }
+      }
+
+      /**
+       * @access private
+       */
+      this._zone = zone;
+      /**
+       * @access private
+       */
+      this.loc = config.loc || Locale.create();
+      /**
+       * @access private
+       */
+      this.invalid = invalid;
+      /**
+       * @access private
+       */
+      this.weekData = null;
+      /**
+       * @access private
+       */
+      this.localWeekData = null;
+      /**
+       * @access private
+       */
+      this.c = c;
+      /**
+       * @access private
+       */
+      this.o = o;
+      /**
+       * @access private
+       */
+      this.isLuxonDateTime = true;
+    }
+
+    // CONSTRUCT
+
+    /**
+     * Create a DateTime for the current instant, in the system's time zone.
+     *
+     * Use Settings to override these default values if needed.
+     * @example DateTime.now().toISO() //~> now in the ISO format
+     * @return {DateTime}
+     */
+    DateTime.now = function now() {
+      return new DateTime({});
+    }
+
+    /**
+     * Create a local DateTime
+     * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+     * @param {number} [month=1] - The month, 1-indexed
+     * @param {number} [day=1] - The day of the month, 1-indexed
+     * @param {number} [hour=0] - The hour of the day, in 24-hour time
+     * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+     * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+     * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+     * @example DateTime.local()                                  //~> now
+     * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+     * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+     * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+     * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+     * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+     * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+     * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+     * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+     * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+     * @return {DateTime}
+     */;
+    DateTime.local = function local() {
+      var _lastOpts = lastOpts(arguments),
+        opts = _lastOpts[0],
+        args = _lastOpts[1],
+        year = args[0],
+        month = args[1],
+        day = args[2],
+        hour = args[3],
+        minute = args[4],
+        second = args[5],
+        millisecond = args[6];
+      return quickDT({
+        year: year,
+        month: month,
+        day: day,
+        hour: hour,
+        minute: minute,
+        second: second,
+        millisecond: millisecond
+      }, opts);
+    }
+
+    /**
+     * Create a DateTime in UTC
+     * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+     * @param {number} [month=1] - The month, 1-indexed
+     * @param {number} [day=1] - The day of the month
+     * @param {number} [hour=0] - The hour of the day, in 24-hour time
+     * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+     * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+     * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+     * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+     * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+     * @example DateTime.utc()                                              //~> now
+     * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+     * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+     * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+     * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+     * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+     * @return {DateTime}
+     */;
+    DateTime.utc = function utc() {
+      var _lastOpts2 = lastOpts(arguments),
+        opts = _lastOpts2[0],
+        args = _lastOpts2[1],
+        year = args[0],
+        month = args[1],
+        day = args[2],
+        hour = args[3],
+        minute = args[4],
+        second = args[5],
+        millisecond = args[6];
+      opts.zone = FixedOffsetZone.utcInstance;
+      return quickDT({
+        year: year,
+        month: month,
+        day: day,
+        hour: hour,
+        minute: minute,
+        second: second,
+        millisecond: millisecond
+      }, opts);
+    }
+
+    /**
+     * Create a DateTime from a JavaScript Date object. Uses the default zone.
+     * @param {Date} date - a JavaScript Date object
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @return {DateTime}
+     */;
+    DateTime.fromJSDate = function fromJSDate(date, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var ts = isDate(date) ? date.valueOf() : NaN;
+      if (Number.isNaN(ts)) {
+        return DateTime.invalid("invalid input");
+      }
+      var zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+      if (!zoneToUse.isValid) {
+        return DateTime.invalid(unsupportedZone(zoneToUse));
+      }
+      return new DateTime({
+        ts: ts,
+        zone: zoneToUse,
+        loc: Locale.fromObject(options)
+      });
+    }
+
+    /**
+     * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+     * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromMillis = function fromMillis(milliseconds, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!isNumber(milliseconds)) {
+        throw new InvalidArgumentError("fromMillis requires a numerical input, but received a " + typeof milliseconds + " with value " + milliseconds);
+      } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+        // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+        return DateTime.invalid("Timestamp out of range");
+      } else {
+        return new DateTime({
+          ts: milliseconds,
+          zone: normalizeZone(options.zone, Settings.defaultZone),
+          loc: Locale.fromObject(options)
+        });
+      }
+    }
+
+    /**
+     * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+     * @param {number} seconds - a number of seconds since 1970 UTC
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromSeconds = function fromSeconds(seconds, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!isNumber(seconds)) {
+        throw new InvalidArgumentError("fromSeconds requires a numerical input");
+      } else {
+        return new DateTime({
+          ts: seconds * 1000,
+          zone: normalizeZone(options.zone, Settings.defaultZone),
+          loc: Locale.fromObject(options)
+        });
+      }
+    }
+
+    /**
+     * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+     * @param {Object} obj - the object to create the DateTime from
+     * @param {number} obj.year - a year, such as 1987
+     * @param {number} obj.month - a month, 1-12
+     * @param {number} obj.day - a day of the month, 1-31, depending on the month
+     * @param {number} obj.ordinal - day of the year, 1-365 or 366
+     * @param {number} obj.weekYear - an ISO week year
+     * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+     * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+     * @param {number} obj.localWeekYear - a week year, according to the locale
+     * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+     * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+     * @param {number} obj.hour - hour of the day, 0-23
+     * @param {number} obj.minute - minute of the hour, 0-59
+     * @param {number} obj.second - second of the minute, 0-59
+     * @param {number} obj.millisecond - millisecond of the second, 0-999
+     * @param {Object} opts - options for creating this DateTime
+     * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+     * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+     * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+     * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+     * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+     * @return {DateTime}
+     */;
+    DateTime.fromObject = function fromObject(obj, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      obj = obj || {};
+      var zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+      if (!zoneToUse.isValid) {
+        return DateTime.invalid(unsupportedZone(zoneToUse));
+      }
+      var loc = Locale.fromObject(opts);
+      var normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+      var _usesLocalWeekValues = usesLocalWeekValues(normalized, loc),
+        minDaysInFirstWeek = _usesLocalWeekValues.minDaysInFirstWeek,
+        startOfWeek = _usesLocalWeekValues.startOfWeek;
+      var tsNow = Settings.now(),
+        offsetProvis = !isUndefined(opts.specificOffset) ? opts.specificOffset : zoneToUse.offset(tsNow),
+        containsOrdinal = !isUndefined(normalized.ordinal),
+        containsGregorYear = !isUndefined(normalized.year),
+        containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+        containsGregor = containsGregorYear || containsGregorMD,
+        definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+      // cases:
+      // just a weekday -> this week's instance of that weekday, no worries
+      // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+      // (gregorian month or day) + ordinal -> error
+      // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+      if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+        throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+      }
+      if (containsGregorMD && containsOrdinal) {
+        throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+      }
+      var useWeekData = definiteWeekDef || normalized.weekday && !containsGregor;
+
+      // configure ourselves to deal with gregorian dates or week stuff
+      var units,
+        defaultValues,
+        objNow = tsToObj(tsNow, offsetProvis);
+      if (useWeekData) {
+        units = orderedWeekUnits;
+        defaultValues = defaultWeekUnitValues;
+        objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+      } else if (containsOrdinal) {
+        units = orderedOrdinalUnits;
+        defaultValues = defaultOrdinalUnitValues;
+        objNow = gregorianToOrdinal(objNow);
+      } else {
+        units = orderedUnits;
+        defaultValues = defaultUnitValues;
+      }
+
+      // set default values for missing stuff
+      var foundFirst = false;
+      for (var _iterator2 = _createForOfIteratorHelperLoose(units), _step2; !(_step2 = _iterator2()).done;) {
+        var u = _step2.value;
+        var v = normalized[u];
+        if (!isUndefined(v)) {
+          foundFirst = true;
+        } else if (foundFirst) {
+          normalized[u] = defaultValues[u];
+        } else {
+          normalized[u] = objNow[u];
+        }
+      }
+
+      // make sure the values we have are in range
+      var higherOrderInvalid = useWeekData ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? hasInvalidOrdinalData(normalized) : hasInvalidGregorianData(normalized),
+        invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      }
+
+      // compute the actual time
+      var gregorian = useWeekData ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? ordinalToGregorian(normalized) : normalized,
+        _objToTS2 = objToTS(gregorian, offsetProvis, zoneToUse),
+        tsFinal = _objToTS2[0],
+        offsetFinal = _objToTS2[1],
+        inst = new DateTime({
+          ts: tsFinal,
+          zone: zoneToUse,
+          o: offsetFinal,
+          loc: loc
+        });
+
+      // gregorian data + weekday serves only to validate
+      if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+        return DateTime.invalid("mismatched weekday", "you can't specify both a weekday of " + normalized.weekday + " and a date of " + inst.toISO());
+      }
+      if (!inst.isValid) {
+        return DateTime.invalid(inst.invalid);
+      }
+      return inst;
+    }
+
+    /**
+     * Create a DateTime from an ISO 8601 string
+     * @param {string} text - the ISO string
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+     * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+     * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+     * @example DateTime.fromISO('2016-W05-4')
+     * @return {DateTime}
+     */;
+    DateTime.fromISO = function fromISO(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseISODate = parseISODate(text),
+        vals = _parseISODate[0],
+        parsedZone = _parseISODate[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+    }
+
+    /**
+     * Create a DateTime from an RFC 2822 string
+     * @param {string} text - the RFC 2822 string
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+     * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+     * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+     * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+     * @return {DateTime}
+     */;
+    DateTime.fromRFC2822 = function fromRFC2822(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseRFC2822Date = parseRFC2822Date(text),
+        vals = _parseRFC2822Date[0],
+        parsedZone = _parseRFC2822Date[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+    }
+
+    /**
+     * Create a DateTime from an HTTP header date
+     * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+     * @param {string} text - the HTTP header date
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+     * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+     * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+     * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+     * @return {DateTime}
+     */;
+    DateTime.fromHTTP = function fromHTTP(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseHTTPDate = parseHTTPDate(text),
+        vals = _parseHTTPDate[0],
+        parsedZone = _parseHTTPDate[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+    }
+
+    /**
+     * Create a DateTime from an input string and format string.
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+     * @param {string} text - the string to parse
+     * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+     * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromFormat = function fromFormat(text, fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (isUndefined(text) || isUndefined(fmt)) {
+        throw new InvalidArgumentError("fromFormat requires an input string and a format");
+      }
+      var _opts = opts,
+        _opts$locale = _opts.locale,
+        locale = _opts$locale === void 0 ? null : _opts$locale,
+        _opts$numberingSystem = _opts.numberingSystem,
+        numberingSystem = _opts$numberingSystem === void 0 ? null : _opts$numberingSystem,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        }),
+        _parseFromTokens = parseFromTokens(localeToUse, text, fmt),
+        vals = _parseFromTokens[0],
+        parsedZone = _parseFromTokens[1],
+        specificOffset = _parseFromTokens[2],
+        invalid = _parseFromTokens[3];
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      } else {
+        return parseDataToDateTime(vals, parsedZone, opts, "format " + fmt, text, specificOffset);
+      }
+    }
+
+    /**
+     * @deprecated use fromFormat instead
+     */;
+    DateTime.fromString = function fromString(text, fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return DateTime.fromFormat(text, fmt, opts);
+    }
+
+    /**
+     * Create a DateTime from a SQL date, time, or datetime
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale
+     * @param {string} text - the string to parse
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+     * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @example DateTime.fromSQL('2017-05-15')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+     * @example DateTime.fromSQL('09:12:34.342')
+     * @return {DateTime}
+     */;
+    DateTime.fromSQL = function fromSQL(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseSQL = parseSQL(text),
+        vals = _parseSQL[0],
+        parsedZone = _parseSQL[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+    }
+
+    /**
+     * Create an invalid DateTime.
+     * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {DateTime}
+     */;
+    DateTime.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidDateTimeError(invalid);
+      } else {
+        return new DateTime({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * Check if an object is an instance of DateTime. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    DateTime.isDateTime = function isDateTime(o) {
+      return o && o.isLuxonDateTime || false;
+    }
+
+    /**
+     * Produce the format string for a set of options
+     * @param formatOpts
+     * @param localeOpts
+     * @returns {string}
+     */;
+    DateTime.parseFormatForOpts = function parseFormatForOpts(formatOpts, localeOpts) {
+      if (localeOpts === void 0) {
+        localeOpts = {};
+      }
+      var tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+      return !tokenList ? null : tokenList.map(function (t) {
+        return t ? t.val : null;
+      }).join("");
+    }
+
+    /**
+     * Produce the the fully expanded format token for the locale
+     * Does NOT quote characters, so quoted tokens will not round trip correctly
+     * @param fmt
+     * @param localeOpts
+     * @returns {string}
+     */;
+    DateTime.expandFormat = function expandFormat(fmt, localeOpts) {
+      if (localeOpts === void 0) {
+        localeOpts = {};
+      }
+      var expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+      return expanded.map(function (t) {
+        return t.val;
+      }).join("");
+    };
+    DateTime.resetCache = function resetCache() {
+      zoneOffsetTs = undefined;
+      zoneOffsetGuessCache.clear();
+    }
+
+    // INFO
+
+    /**
+     * Get the value of unit.
+     * @param {string} unit - a unit such as 'minute' or 'day'
+     * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+     * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+     * @return {number}
+     */;
+    var _proto = DateTime.prototype;
+    _proto.get = function get(unit) {
+      return this[unit];
+    }
+
+    /**
+     * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+     * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+     * * The DateTime was created by an operation on another invalid date
+     * @type {boolean}
+     */;
+    /**
+     * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+     * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+     * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+     * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+     * @returns {DateTime[]}
+     */
+    _proto.getPossibleOffsets = function getPossibleOffsets() {
+      if (!this.isValid || this.isOffsetFixed) {
+        return [this];
+      }
+      var dayMs = 86400000;
+      var minuteMs = 60000;
+      var localTS = objToLocalTS(this.c);
+      var oEarlier = this.zone.offset(localTS - dayMs);
+      var oLater = this.zone.offset(localTS + dayMs);
+      var o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+      var o2 = this.zone.offset(localTS - oLater * minuteMs);
+      if (o1 === o2) {
+        return [this];
+      }
+      var ts1 = localTS - o1 * minuteMs;
+      var ts2 = localTS - o2 * minuteMs;
+      var c1 = tsToObj(ts1, o1);
+      var c2 = tsToObj(ts2, o2);
+      if (c1.hour === c2.hour && c1.minute === c2.minute && c1.second === c2.second && c1.millisecond === c2.millisecond) {
+        return [clone(this, {
+          ts: ts1
+        }), clone(this, {
+          ts: ts2
+        })];
+      }
+      return [this];
+    }
+
+    /**
+     * Returns true if this DateTime is in a leap year, false otherwise
+     * @example DateTime.local(2016).isInLeapYear //=> true
+     * @example DateTime.local(2013).isInLeapYear //=> false
+     * @type {boolean}
+     */;
+    /**
+     * Returns the resolved Intl options for this DateTime.
+     * This is useful in understanding the behavior of formatting methods
+     * @param {Object} opts - the same options as toLocaleString
+     * @return {Object}
+     */
+    _proto.resolvedLocaleOptions = function resolvedLocaleOptions(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _Formatter$create$res = Formatter.create(this.loc.clone(opts), opts).resolvedOptions(this),
+        locale = _Formatter$create$res.locale,
+        numberingSystem = _Formatter$create$res.numberingSystem,
+        calendar = _Formatter$create$res.calendar;
+      return {
+        locale: locale,
+        numberingSystem: numberingSystem,
+        outputCalendar: calendar
+      };
+    }
+
+    // TRANSFORM
+
+    /**
+     * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+     *
+     * Equivalent to {@link DateTime#setZone}('utc')
+     * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+     * @param {Object} [opts={}] - options to pass to `setZone()`
+     * @return {DateTime}
+     */;
+    _proto.toUTC = function toUTC(offset, opts) {
+      if (offset === void 0) {
+        offset = 0;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.setZone(FixedOffsetZone.instance(offset), opts);
+    }
+
+    /**
+     * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+     *
+     * Equivalent to `setZone('local')`
+     * @return {DateTime}
+     */;
+    _proto.toLocal = function toLocal() {
+      return this.setZone(Settings.defaultZone);
+    }
+
+    /**
+     * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+     *
+     * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+     * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+     * @return {DateTime}
+     */;
+    _proto.setZone = function setZone(zone, _temp) {
+      var _ref2 = _temp === void 0 ? {} : _temp,
+        _ref2$keepLocalTime = _ref2.keepLocalTime,
+        keepLocalTime = _ref2$keepLocalTime === void 0 ? false : _ref2$keepLocalTime,
+        _ref2$keepCalendarTim = _ref2.keepCalendarTime,
+        keepCalendarTime = _ref2$keepCalendarTim === void 0 ? false : _ref2$keepCalendarTim;
+      zone = normalizeZone(zone, Settings.defaultZone);
+      if (zone.equals(this.zone)) {
+        return this;
+      } else if (!zone.isValid) {
+        return DateTime.invalid(unsupportedZone(zone));
+      } else {
+        var newTS = this.ts;
+        if (keepLocalTime || keepCalendarTime) {
+          var offsetGuess = zone.offset(this.ts);
+          var asObj = this.toObject();
+          var _objToTS3 = objToTS(asObj, offsetGuess, zone);
+          newTS = _objToTS3[0];
+        }
+        return clone(this, {
+          ts: newTS,
+          zone: zone
+        });
+      }
+    }
+
+    /**
+     * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+     * @param {Object} properties - the properties to set
+     * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+     * @return {DateTime}
+     */;
+    _proto.reconfigure = function reconfigure(_temp2) {
+      var _ref3 = _temp2 === void 0 ? {} : _temp2,
+        locale = _ref3.locale,
+        numberingSystem = _ref3.numberingSystem,
+        outputCalendar = _ref3.outputCalendar;
+      var loc = this.loc.clone({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        outputCalendar: outputCalendar
+      });
+      return clone(this, {
+        loc: loc
+      });
+    }
+
+    /**
+     * "Set" the locale. Returns a newly-constructed DateTime.
+     * Just a convenient alias for reconfigure({ locale })
+     * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+     * @return {DateTime}
+     */;
+    _proto.setLocale = function setLocale(locale) {
+      return this.reconfigure({
+        locale: locale
+      });
+    }
+
+    /**
+     * "Set" the values of specified units. Returns a newly-constructed DateTime.
+     * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+     *
+     * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+     * They cannot be mixed with ISO-week units like `weekday`.
+     * @param {Object} values - a mapping of units to numbers
+     * @example dt.set({ year: 2017 })
+     * @example dt.set({ hour: 8, minute: 30 })
+     * @example dt.set({ weekday: 5 })
+     * @example dt.set({ year: 2005, ordinal: 234 })
+     * @return {DateTime}
+     */;
+    _proto.set = function set(values) {
+      if (!this.isValid) return this;
+      var normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+      var _usesLocalWeekValues2 = usesLocalWeekValues(normalized, this.loc),
+        minDaysInFirstWeek = _usesLocalWeekValues2.minDaysInFirstWeek,
+        startOfWeek = _usesLocalWeekValues2.startOfWeek;
+      var settingWeekStuff = !isUndefined(normalized.weekYear) || !isUndefined(normalized.weekNumber) || !isUndefined(normalized.weekday),
+        containsOrdinal = !isUndefined(normalized.ordinal),
+        containsGregorYear = !isUndefined(normalized.year),
+        containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+        containsGregor = containsGregorYear || containsGregorMD,
+        definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+      if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+        throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+      }
+      if (containsGregorMD && containsOrdinal) {
+        throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+      }
+      var mixed;
+      if (settingWeekStuff) {
+        mixed = weekToGregorian(_extends({}, gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), normalized), minDaysInFirstWeek, startOfWeek);
+      } else if (!isUndefined(normalized.ordinal)) {
+        mixed = ordinalToGregorian(_extends({}, gregorianToOrdinal(this.c), normalized));
+      } else {
+        mixed = _extends({}, this.toObject(), normalized);
+
+        // if we didn't set the day but we ended up on an overflow date,
+        // use the last day of the right month
+        if (isUndefined(normalized.day)) {
+          mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+        }
+      }
+      var _objToTS4 = objToTS(mixed, this.o, this.zone),
+        ts = _objToTS4[0],
+        o = _objToTS4[1];
+      return clone(this, {
+        ts: ts,
+        o: o
+      });
+    }
+
+    /**
+     * Add a period of time to this DateTime and return the resulting DateTime
+     *
+     * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+     * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @example DateTime.now().plus(123) //~> in 123 milliseconds
+     * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+     * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+     * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+     * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+     * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+     * @return {DateTime}
+     */;
+    _proto.plus = function plus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration);
+      return clone(this, adjustTime(this, dur));
+    }
+
+    /**
+     * Subtract a period of time to this DateTime and return the resulting DateTime
+     * See {@link DateTime#plus}
+     * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     @return {DateTime}
+     */;
+    _proto.minus = function minus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration).negate();
+      return clone(this, adjustTime(this, dur));
+    }
+
+    /**
+     * "Set" this DateTime to the beginning of a unit of time.
+     * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+     * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+     * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+     * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+     * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+     * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+     * @return {DateTime}
+     */;
+    _proto.startOf = function startOf(unit, _temp3) {
+      var _ref4 = _temp3 === void 0 ? {} : _temp3,
+        _ref4$useLocaleWeeks = _ref4.useLocaleWeeks,
+        useLocaleWeeks = _ref4$useLocaleWeeks === void 0 ? false : _ref4$useLocaleWeeks;
+      if (!this.isValid) return this;
+      var o = {},
+        normalizedUnit = Duration.normalizeUnit(unit);
+      switch (normalizedUnit) {
+        case "years":
+          o.month = 1;
+        // falls through
+        case "quarters":
+        case "months":
+          o.day = 1;
+        // falls through
+        case "weeks":
+        case "days":
+          o.hour = 0;
+        // falls through
+        case "hours":
+          o.minute = 0;
+        // falls through
+        case "minutes":
+          o.second = 0;
+        // falls through
+        case "seconds":
+          o.millisecond = 0;
+          break;
+        // no default, invalid units throw in normalizeUnit()
+      }
+
+      if (normalizedUnit === "weeks") {
+        if (useLocaleWeeks) {
+          var startOfWeek = this.loc.getStartOfWeek();
+          var weekday = this.weekday;
+          if (weekday < startOfWeek) {
+            o.weekNumber = this.weekNumber - 1;
+          }
+          o.weekday = startOfWeek;
+        } else {
+          o.weekday = 1;
+        }
+      }
+      if (normalizedUnit === "quarters") {
+        var q = Math.ceil(this.month / 3);
+        o.month = (q - 1) * 3 + 1;
+      }
+      return this.set(o);
+    }
+
+    /**
+     * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+     * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+     * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+     * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+     * @return {DateTime}
+     */;
+    _proto.endOf = function endOf(unit, opts) {
+      var _this$plus;
+      return this.isValid ? this.plus((_this$plus = {}, _this$plus[unit] = 1, _this$plus)).startOf(unit, opts).minus(1) : this;
+    }
+
+    // OUTPUT
+
+    /**
+     * Returns a string representation of this DateTime formatted according to the specified format string.
+     * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+     * @param {string} fmt - the format string
+     * @param {Object} opts - opts to override the configuration options on this DateTime
+     * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+     * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+     * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+     * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+     * @return {string}
+     */;
+    _proto.toFormat = function toFormat(fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt) : INVALID;
+    }
+
+    /**
+     * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+     * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+     * of the DateTime in the assigned locale.
+     * Defaults to the system's locale if no locale has been specified
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+     * @param {Object} opts - opts to override the configuration options on this DateTime
+     * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+     * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+     * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+     * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+     * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+     * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+     * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+     * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+     * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+     * @return {string}
+     */;
+    _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+      if (formatOpts === void 0) {
+        formatOpts = DATE_SHORT;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this) : INVALID;
+    }
+
+    /**
+     * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+     * Defaults to the system's locale if no locale has been specified
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+     * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+     * @example DateTime.now().toLocaleParts(); //=> [
+     *                                   //=>   { type: 'day', value: '25' },
+     *                                   //=>   { type: 'literal', value: '/' },
+     *                                   //=>   { type: 'month', value: '05' },
+     *                                   //=>   { type: 'literal', value: '/' },
+     *                                   //=>   { type: 'year', value: '1982' }
+     *                                   //=> ]
+     */;
+    _proto.toLocaleParts = function toLocaleParts(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this) : [];
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+     * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+     * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+     * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+     * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+     * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+     * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+     * @return {string|null}
+     */;
+    _proto.toISO = function toISO(_temp4) {
+      var _ref5 = _temp4 === void 0 ? {} : _temp4,
+        _ref5$format = _ref5.format,
+        format = _ref5$format === void 0 ? "extended" : _ref5$format,
+        _ref5$suppressSeconds = _ref5.suppressSeconds,
+        suppressSeconds = _ref5$suppressSeconds === void 0 ? false : _ref5$suppressSeconds,
+        _ref5$suppressMillise = _ref5.suppressMilliseconds,
+        suppressMilliseconds = _ref5$suppressMillise === void 0 ? false : _ref5$suppressMillise,
+        _ref5$includeOffset = _ref5.includeOffset,
+        includeOffset = _ref5$includeOffset === void 0 ? true : _ref5$includeOffset,
+        _ref5$extendedZone = _ref5.extendedZone,
+        extendedZone = _ref5$extendedZone === void 0 ? false : _ref5$extendedZone,
+        _ref5$precision = _ref5.precision,
+        precision = _ref5$precision === void 0 ? "milliseconds" : _ref5$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      precision = normalizeUnit(precision);
+      var ext = format === "extended";
+      var c = _toISODate(this, ext, precision);
+      if (orderedUnits.indexOf(precision) >= 3) c += "T";
+      c += _toISOTime(this, ext, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+      return c;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's date component
+     * @param {Object} opts - options
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+     * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+     * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+     * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+     * @return {string|null}
+     */;
+    _proto.toISODate = function toISODate(_temp5) {
+      var _ref6 = _temp5 === void 0 ? {} : _temp5,
+        _ref6$format = _ref6.format,
+        format = _ref6$format === void 0 ? "extended" : _ref6$format,
+        _ref6$precision = _ref6.precision,
+        precision = _ref6$precision === void 0 ? "day" : _ref6$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      return _toISODate(this, format === "extended", normalizeUnit(precision));
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's week date
+     * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+     * @return {string}
+     */;
+    _proto.toISOWeekDate = function toISOWeekDate() {
+      return toTechFormat(this, "kkkk-'W'WW-c");
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's time component
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+     * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(_temp6) {
+      var _ref7 = _temp6 === void 0 ? {} : _temp6,
+        _ref7$suppressMillise = _ref7.suppressMilliseconds,
+        suppressMilliseconds = _ref7$suppressMillise === void 0 ? false : _ref7$suppressMillise,
+        _ref7$suppressSeconds = _ref7.suppressSeconds,
+        suppressSeconds = _ref7$suppressSeconds === void 0 ? false : _ref7$suppressSeconds,
+        _ref7$includeOffset = _ref7.includeOffset,
+        includeOffset = _ref7$includeOffset === void 0 ? true : _ref7$includeOffset,
+        _ref7$includePrefix = _ref7.includePrefix,
+        includePrefix = _ref7$includePrefix === void 0 ? false : _ref7$includePrefix,
+        _ref7$extendedZone = _ref7.extendedZone,
+        extendedZone = _ref7$extendedZone === void 0 ? false : _ref7$extendedZone,
+        _ref7$format = _ref7.format,
+        format = _ref7$format === void 0 ? "extended" : _ref7$format,
+        _ref7$precision = _ref7.precision,
+        precision = _ref7$precision === void 0 ? "milliseconds" : _ref7$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      precision = normalizeUnit(precision);
+      var c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+      return c + _toISOTime(this, format === "extended", suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+    }
+
+    /**
+     * Returns an RFC 2822-compatible string representation of this DateTime
+     * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+     * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+     * @return {string}
+     */;
+    _proto.toRFC2822 = function toRFC2822() {
+      return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+     * Specifically, the string conforms to RFC 1123.
+     * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+     * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+     * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+     * @return {string}
+     */;
+    _proto.toHTTP = function toHTTP() {
+      return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL Date
+     * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+     * @return {string|null}
+     */;
+    _proto.toSQLDate = function toSQLDate() {
+      if (!this.isValid) {
+        return null;
+      }
+      return _toISODate(this, true);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL Time
+     * @param {Object} opts - options
+     * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+     * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+     * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+     * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+     * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+     * @return {string}
+     */;
+    _proto.toSQLTime = function toSQLTime(_temp7) {
+      var _ref8 = _temp7 === void 0 ? {} : _temp7,
+        _ref8$includeOffset = _ref8.includeOffset,
+        includeOffset = _ref8$includeOffset === void 0 ? true : _ref8$includeOffset,
+        _ref8$includeZone = _ref8.includeZone,
+        includeZone = _ref8$includeZone === void 0 ? false : _ref8$includeZone,
+        _ref8$includeOffsetSp = _ref8.includeOffsetSpace,
+        includeOffsetSpace = _ref8$includeOffsetSp === void 0 ? true : _ref8$includeOffsetSp;
+      var fmt = "HH:mm:ss.SSS";
+      if (includeZone || includeOffset) {
+        if (includeOffsetSpace) {
+          fmt += " ";
+        }
+        if (includeZone) {
+          fmt += "z";
+        } else if (includeOffset) {
+          fmt += "ZZ";
+        }
+      }
+      return toTechFormat(this, fmt, true);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+     * @param {Object} opts - options
+     * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+     * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+     * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+     * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+     * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+     * @return {string}
+     */;
+    _proto.toSQL = function toSQL(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) {
+        return null;
+      }
+      return this.toSQLDate() + " " + this.toSQLTime(opts);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for debugging
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      return this.isValid ? this.toISO() : INVALID;
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "DateTime { ts: " + this.toISO() + ", zone: " + this.zone.name + ", locale: " + this.locale + " }";
+      } else {
+        return "DateTime { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+     * @return {number}
+     */;
+    _proto.valueOf = function valueOf() {
+      return this.toMillis();
+    }
+
+    /**
+     * Returns the epoch milliseconds of this DateTime.
+     * @return {number}
+     */;
+    _proto.toMillis = function toMillis() {
+      return this.isValid ? this.ts : NaN;
+    }
+
+    /**
+     * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+     * @return {number}
+     */;
+    _proto.toSeconds = function toSeconds() {
+      return this.isValid ? this.ts / 1000 : NaN;
+    }
+
+    /**
+     * Returns the epoch seconds (as a whole number) of this DateTime.
+     * @return {number}
+     */;
+    _proto.toUnixInteger = function toUnixInteger() {
+      return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+     * @return {string}
+     */;
+    _proto.toJSON = function toJSON() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns a BSON serializable equivalent to this DateTime.
+     * @return {Date}
+     */;
+    _proto.toBSON = function toBSON() {
+      return this.toJSDate();
+    }
+
+    /**
+     * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+     * @param opts - options for generating the object
+     * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+     * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+     * @return {Object}
+     */;
+    _proto.toObject = function toObject(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return {};
+      var base = _extends({}, this.c);
+      if (opts.includeConfig) {
+        base.outputCalendar = this.outputCalendar;
+        base.numberingSystem = this.loc.numberingSystem;
+        base.locale = this.loc.locale;
+      }
+      return base;
+    }
+
+    /**
+     * Returns a JavaScript Date equivalent to this DateTime.
+     * @return {Date}
+     */;
+    _proto.toJSDate = function toJSDate() {
+      return new Date(this.isValid ? this.ts : NaN);
+    }
+
+    // COMPARE
+
+    /**
+     * Return the difference between two DateTimes as a Duration.
+     * @param {DateTime} otherDateTime - the DateTime to compare this one to
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @example
+     * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+     *     i2 = DateTime.fromISO('1983-10-14T10:30');
+     * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+     * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+     * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+     * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+     * @return {Duration}
+     */;
+    _proto.diff = function diff(otherDateTime, unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid || !otherDateTime.isValid) {
+        return Duration.invalid("created by diffing an invalid DateTime");
+      }
+      var durOpts = _extends({
+        locale: this.locale,
+        numberingSystem: this.numberingSystem
+      }, opts);
+      var units = maybeArray(unit).map(Duration.normalizeUnit),
+        otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+        earlier = otherIsLater ? this : otherDateTime,
+        later = otherIsLater ? otherDateTime : this,
+        diffed = _diff(earlier, later, units, durOpts);
+      return otherIsLater ? diffed.negate() : diffed;
+    }
+
+    /**
+     * Return the difference between this DateTime and right now.
+     * See {@link DateTime#diff}
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @return {Duration}
+     */;
+    _proto.diffNow = function diffNow(unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.diff(DateTime.now(), unit, opts);
+    }
+
+    /**
+     * Return an Interval spanning between this DateTime and another DateTime
+     * @param {DateTime} otherDateTime - the other end point of the Interval
+     * @return {Interval|DateTime}
+     */;
+    _proto.until = function until(otherDateTime) {
+      return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+    }
+
+    /**
+     * Return whether this DateTime is in the same unit of time as another DateTime.
+     * Higher-order units must also be identical for this function to return `true`.
+     * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+     * @param {DateTime} otherDateTime - the other DateTime
+     * @param {string} unit - the unit of time to check sameness on
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+     * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+     * @return {boolean}
+     */;
+    _proto.hasSame = function hasSame(otherDateTime, unit, opts) {
+      if (!this.isValid) return false;
+      var inputMs = otherDateTime.valueOf();
+      var adjustedToZone = this.setZone(otherDateTime.zone, {
+        keepLocalTime: true
+      });
+      return adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts);
+    }
+
+    /**
+     * Equality check
+     * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+     * To compare just the millisecond values, use `+dt1 === +dt2`.
+     * @param {DateTime} other - the other DateTime
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(other) {
+      return this.isValid && other.isValid && this.valueOf() === other.valueOf() && this.zone.equals(other.zone) && this.loc.equals(other.loc);
+    }
+
+    /**
+     * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+     * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+     * @param {Object} options - options that affect the output
+     * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+     * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+     * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+     * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+     * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+     * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+     * @param {string} options.locale - override the locale of this DateTime
+     * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+     * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+     * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+     * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+     * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+     * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+     * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+     */;
+    _proto.toRelative = function toRelative(options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!this.isValid) return null;
+      var base = options.base || DateTime.fromObject({}, {
+          zone: this.zone
+        }),
+        padding = options.padding ? this < base ? -options.padding : options.padding : 0;
+      var units = ["years", "months", "days", "hours", "minutes", "seconds"];
+      var unit = options.unit;
+      if (Array.isArray(options.unit)) {
+        units = options.unit;
+        unit = undefined;
+      }
+      return diffRelative(base, this.plus(padding), _extends({}, options, {
+        numeric: "always",
+        units: units,
+        unit: unit
+      }));
+    }
+
+    /**
+     * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+     * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+     * @param {Object} options - options that affect the output
+     * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+     * @param {string} options.locale - override the locale of this DateTime
+     * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+     * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+     * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+     * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+     * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+     * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+     */;
+    _proto.toRelativeCalendar = function toRelativeCalendar(options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!this.isValid) return null;
+      return diffRelative(options.base || DateTime.fromObject({}, {
+        zone: this.zone
+      }), this, _extends({}, options, {
+        numeric: "auto",
+        units: ["years", "months", "days"],
+        calendary: true
+      }));
+    }
+
+    /**
+     * Return the min of several date times
+     * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+     * @return {DateTime} the min DateTime, or undefined if called with no argument
+     */;
+    DateTime.min = function min() {
+      for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+        dateTimes[_key] = arguments[_key];
+      }
+      if (!dateTimes.every(DateTime.isDateTime)) {
+        throw new InvalidArgumentError("min requires all arguments be DateTimes");
+      }
+      return bestBy(dateTimes, function (i) {
+        return i.valueOf();
+      }, Math.min);
+    }
+
+    /**
+     * Return the max of several date times
+     * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+     * @return {DateTime} the max DateTime, or undefined if called with no argument
+     */;
+    DateTime.max = function max() {
+      for (var _len2 = arguments.length, dateTimes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        dateTimes[_key2] = arguments[_key2];
+      }
+      if (!dateTimes.every(DateTime.isDateTime)) {
+        throw new InvalidArgumentError("max requires all arguments be DateTimes");
+      }
+      return bestBy(dateTimes, function (i) {
+        return i.valueOf();
+      }, Math.max);
+    }
+
+    // MISC
+
+    /**
+     * Explain how a string would be parsed by fromFormat()
+     * @param {string} text - the string to parse
+     * @param {string} fmt - the format the string is expected to be in (see description)
+     * @param {Object} options - options taken by fromFormat()
+     * @return {Object}
+     */;
+    DateTime.fromFormatExplain = function fromFormatExplain(text, fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var _options = options,
+        _options$locale = _options.locale,
+        locale = _options$locale === void 0 ? null : _options$locale,
+        _options$numberingSys = _options.numberingSystem,
+        numberingSystem = _options$numberingSys === void 0 ? null : _options$numberingSys,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      return explainFromTokens(localeToUse, text, fmt);
+    }
+
+    /**
+     * @deprecated use fromFormatExplain instead
+     */;
+    DateTime.fromStringExplain = function fromStringExplain(text, fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      return DateTime.fromFormatExplain(text, fmt, options);
+    }
+
+    /**
+     * Build a parser for `fmt` using the given locale. This parser can be passed
+     * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+     * can be used to optimize cases where many dates need to be parsed in a
+     * specific format.
+     *
+     * @param {String} fmt - the format the string is expected to be in (see
+     * description)
+     * @param {Object} options - options used to set locale and numberingSystem
+     * for parser
+     * @returns {TokenParser} - opaque object to be used
+     */;
+    DateTime.buildFormatParser = function buildFormatParser(fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var _options2 = options,
+        _options2$locale = _options2.locale,
+        locale = _options2$locale === void 0 ? null : _options2$locale,
+        _options2$numberingSy = _options2.numberingSystem,
+        numberingSystem = _options2$numberingSy === void 0 ? null : _options2$numberingSy,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      return new TokenParser(localeToUse, fmt);
+    }
+
+    /**
+     * Create a DateTime from an input string and format parser.
+     *
+     * The format parser must have been created with the same locale as this call.
+     *
+     * @param {String} text - the string to parse
+     * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+     * @param {Object} opts - options taken by fromFormat()
+     * @returns {DateTime}
+     */;
+    DateTime.fromFormatParser = function fromFormatParser(text, formatParser, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (isUndefined(text) || isUndefined(formatParser)) {
+        throw new InvalidArgumentError("fromFormatParser requires an input string and a format parser");
+      }
+      var _opts2 = opts,
+        _opts2$locale = _opts2.locale,
+        locale = _opts2$locale === void 0 ? null : _opts2$locale,
+        _opts2$numberingSyste = _opts2.numberingSystem,
+        numberingSystem = _opts2$numberingSyste === void 0 ? null : _opts2$numberingSyste,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      if (!localeToUse.equals(formatParser.locale)) {
+        throw new InvalidArgumentError("fromFormatParser called with a locale of " + localeToUse + ", " + ("but the format parser was created for " + formatParser.locale));
+      }
+      var _formatParser$explain = formatParser.explainFromTokens(text),
+        result = _formatParser$explain.result,
+        zone = _formatParser$explain.zone,
+        specificOffset = _formatParser$explain.specificOffset,
+        invalidReason = _formatParser$explain.invalidReason;
+      if (invalidReason) {
+        return DateTime.invalid(invalidReason);
+      } else {
+        return parseDataToDateTime(result, zone, opts, "format " + formatParser.format, text, specificOffset);
+      }
+    }
+
+    // FORMAT PRESETS
+
+    /**
+     * {@link DateTime#toLocaleString} format like 10/14/1983
+     * @type {Object}
+     */;
+    _createClass(DateTime, [{
+      key: "isValid",
+      get: function get() {
+        return this.invalid === null;
+      }
+
+      /**
+       * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+
+      /**
+       * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "locale",
+      get: function get() {
+        return this.isValid ? this.loc.locale : null;
+      }
+
+      /**
+       * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "numberingSystem",
+      get: function get() {
+        return this.isValid ? this.loc.numberingSystem : null;
+      }
+
+      /**
+       * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "outputCalendar",
+      get: function get() {
+        return this.isValid ? this.loc.outputCalendar : null;
+      }
+
+      /**
+       * Get the time zone associated with this DateTime.
+       * @type {Zone}
+       */
+    }, {
+      key: "zone",
+      get: function get() {
+        return this._zone;
+      }
+
+      /**
+       * Get the name of the time zone.
+       * @type {string}
+       */
+    }, {
+      key: "zoneName",
+      get: function get() {
+        return this.isValid ? this.zone.name : null;
+      }
+
+      /**
+       * Get the year
+       * @example DateTime.local(2017, 5, 25).year //=> 2017
+       * @type {number}
+       */
+    }, {
+      key: "year",
+      get: function get() {
+        return this.isValid ? this.c.year : NaN;
+      }
+
+      /**
+       * Get the quarter
+       * @example DateTime.local(2017, 5, 25).quarter //=> 2
+       * @type {number}
+       */
+    }, {
+      key: "quarter",
+      get: function get() {
+        return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+      }
+
+      /**
+       * Get the month (1-12).
+       * @example DateTime.local(2017, 5, 25).month //=> 5
+       * @type {number}
+       */
+    }, {
+      key: "month",
+      get: function get() {
+        return this.isValid ? this.c.month : NaN;
+      }
+
+      /**
+       * Get the day of the month (1-30ish).
+       * @example DateTime.local(2017, 5, 25).day //=> 25
+       * @type {number}
+       */
+    }, {
+      key: "day",
+      get: function get() {
+        return this.isValid ? this.c.day : NaN;
+      }
+
+      /**
+       * Get the hour of the day (0-23).
+       * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+       * @type {number}
+       */
+    }, {
+      key: "hour",
+      get: function get() {
+        return this.isValid ? this.c.hour : NaN;
+      }
+
+      /**
+       * Get the minute of the hour (0-59).
+       * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+       * @type {number}
+       */
+    }, {
+      key: "minute",
+      get: function get() {
+        return this.isValid ? this.c.minute : NaN;
+      }
+
+      /**
+       * Get the second of the minute (0-59).
+       * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+       * @type {number}
+       */
+    }, {
+      key: "second",
+      get: function get() {
+        return this.isValid ? this.c.second : NaN;
+      }
+
+      /**
+       * Get the millisecond of the second (0-999).
+       * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+       * @type {number}
+       */
+    }, {
+      key: "millisecond",
+      get: function get() {
+        return this.isValid ? this.c.millisecond : NaN;
+      }
+
+      /**
+       * Get the week year
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+       * @type {number}
+       */
+    }, {
+      key: "weekYear",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+      }
+
+      /**
+       * Get the week number of the week year (1-52ish).
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+       * @type {number}
+       */
+    }, {
+      key: "weekNumber",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+      }
+
+      /**
+       * Get the day of the week.
+       * 1 is Monday and 7 is Sunday
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2014, 11, 31).weekday //=> 4
+       * @type {number}
+       */
+    }, {
+      key: "weekday",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+      }
+
+      /**
+       * Returns true if this date is on a weekend according to the locale, false otherwise
+       * @returns {boolean}
+       */
+    }, {
+      key: "isWeekend",
+      get: function get() {
+        return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+      }
+
+      /**
+       * Get the day of the week according to the locale.
+       * 1 is the first day of the week and 7 is the last day of the week.
+       * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekday",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+      }
+
+      /**
+       * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+       * because the week can start on different days of the week (see localWeekday) and because a different number of days
+       * is required for a week to count as the first week of a year.
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekNumber",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+      }
+
+      /**
+       * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+       * differently, see localWeekNumber.
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekYear",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+      }
+
+      /**
+       * Get the ordinal (meaning the day of the year)
+       * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+       * @type {number|DateTime}
+       */
+    }, {
+      key: "ordinal",
+      get: function get() {
+        return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+      }
+
+      /**
+       * Get the human readable short month name, such as 'Oct'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+       * @type {string}
+       */
+    }, {
+      key: "monthShort",
+      get: function get() {
+        return this.isValid ? Info.months("short", {
+          locObj: this.loc
+        })[this.month - 1] : null;
+      }
+
+      /**
+       * Get the human readable long month name, such as 'October'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).monthLong //=> October
+       * @type {string}
+       */
+    }, {
+      key: "monthLong",
+      get: function get() {
+        return this.isValid ? Info.months("long", {
+          locObj: this.loc
+        })[this.month - 1] : null;
+      }
+
+      /**
+       * Get the human readable short weekday, such as 'Mon'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+       * @type {string}
+       */
+    }, {
+      key: "weekdayShort",
+      get: function get() {
+        return this.isValid ? Info.weekdays("short", {
+          locObj: this.loc
+        })[this.weekday - 1] : null;
+      }
+
+      /**
+       * Get the human readable long weekday, such as 'Monday'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+       * @type {string}
+       */
+    }, {
+      key: "weekdayLong",
+      get: function get() {
+        return this.isValid ? Info.weekdays("long", {
+          locObj: this.loc
+        })[this.weekday - 1] : null;
+      }
+
+      /**
+       * Get the UTC offset of this DateTime in minutes
+       * @example DateTime.now().offset //=> -240
+       * @example DateTime.utc().offset //=> 0
+       * @type {number}
+       */
+    }, {
+      key: "offset",
+      get: function get() {
+        return this.isValid ? +this.o : NaN;
+      }
+
+      /**
+       * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+       * Defaults to the system's locale if no locale has been specified
+       * @type {string}
+       */
+    }, {
+      key: "offsetNameShort",
+      get: function get() {
+        if (this.isValid) {
+          return this.zone.offsetName(this.ts, {
+            format: "short",
+            locale: this.locale
+          });
+        } else {
+          return null;
+        }
+      }
+
+      /**
+       * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+       * Defaults to the system's locale if no locale has been specified
+       * @type {string}
+       */
+    }, {
+      key: "offsetNameLong",
+      get: function get() {
+        if (this.isValid) {
+          return this.zone.offsetName(this.ts, {
+            format: "long",
+            locale: this.locale
+          });
+        } else {
+          return null;
+        }
+      }
+
+      /**
+       * Get whether this zone's offset ever changes, as in a DST.
+       * @type {boolean}
+       */
+    }, {
+      key: "isOffsetFixed",
+      get: function get() {
+        return this.isValid ? this.zone.isUniversal : null;
+      }
+
+      /**
+       * Get whether the DateTime is in a DST.
+       * @type {boolean}
+       */
+    }, {
+      key: "isInDST",
+      get: function get() {
+        if (this.isOffsetFixed) {
+          return false;
+        } else {
+          return this.offset > this.set({
+            month: 1,
+            day: 1
+          }).offset || this.offset > this.set({
+            month: 5
+          }).offset;
+        }
+      }
+    }, {
+      key: "isInLeapYear",
+      get: function get() {
+        return isLeapYear(this.year);
+      }
+
+      /**
+       * Returns the number of days in this DateTime's month
+       * @example DateTime.local(2016, 2).daysInMonth //=> 29
+       * @example DateTime.local(2016, 3).daysInMonth //=> 31
+       * @type {number}
+       */
+    }, {
+      key: "daysInMonth",
+      get: function get() {
+        return daysInMonth(this.year, this.month);
+      }
+
+      /**
+       * Returns the number of days in this DateTime's year
+       * @example DateTime.local(2016).daysInYear //=> 366
+       * @example DateTime.local(2013).daysInYear //=> 365
+       * @type {number}
+       */
+    }, {
+      key: "daysInYear",
+      get: function get() {
+        return this.isValid ? daysInYear(this.year) : NaN;
+      }
+
+      /**
+       * Returns the number of weeks in this DateTime's year
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2004).weeksInWeekYear //=> 53
+       * @example DateTime.local(2013).weeksInWeekYear //=> 52
+       * @type {number}
+       */
+    }, {
+      key: "weeksInWeekYear",
+      get: function get() {
+        return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+      }
+
+      /**
+       * Returns the number of weeks in this DateTime's local week year
+       * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+       * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+       * @type {number}
+       */
+    }, {
+      key: "weeksInLocalWeekYear",
+      get: function get() {
+        return this.isValid ? weeksInWeekYear(this.localWeekYear, this.loc.getMinDaysInFirstWeek(), this.loc.getStartOfWeek()) : NaN;
+      }
+    }], [{
+      key: "DATE_SHORT",
+      get: function get() {
+        return DATE_SHORT;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_MED",
+      get: function get() {
+        return DATE_MED;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_MED_WITH_WEEKDAY",
+      get: function get() {
+        return DATE_MED_WITH_WEEKDAY;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_FULL",
+      get: function get() {
+        return DATE_FULL;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_HUGE",
+      get: function get() {
+        return DATE_HUGE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_SIMPLE",
+      get: function get() {
+        return TIME_SIMPLE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_SECONDS",
+      get: function get() {
+        return TIME_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_SHORT_OFFSET",
+      get: function get() {
+        return TIME_WITH_SHORT_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_LONG_OFFSET",
+      get: function get() {
+        return TIME_WITH_LONG_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_SIMPLE",
+      get: function get() {
+        return TIME_24_SIMPLE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_SECONDS",
+      get: function get() {
+        return TIME_24_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_SHORT_OFFSET",
+      get: function get() {
+        return TIME_24_WITH_SHORT_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_LONG_OFFSET",
+      get: function get() {
+        return TIME_24_WITH_LONG_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_SHORT",
+      get: function get() {
+        return DATETIME_SHORT;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_SHORT_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_SHORT_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED",
+      get: function get() {
+        return DATETIME_MED;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_MED_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED_WITH_WEEKDAY",
+      get: function get() {
+        return DATETIME_MED_WITH_WEEKDAY;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_FULL",
+      get: function get() {
+        return DATETIME_FULL;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_FULL_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_FULL_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_HUGE",
+      get: function get() {
+        return DATETIME_HUGE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_HUGE_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_HUGE_WITH_SECONDS;
+      }
+    }]);
+    return DateTime;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+  function friendlyDateTime(dateTimeish) {
+    if (DateTime.isDateTime(dateTimeish)) {
+      return dateTimeish;
+    } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+      return DateTime.fromJSDate(dateTimeish);
+    } else if (dateTimeish && typeof dateTimeish === "object") {
+      return DateTime.fromObject(dateTimeish);
+    } else {
+      throw new InvalidArgumentError("Unknown datetime argument: " + dateTimeish + ", of type " + typeof dateTimeish);
+    }
+  }
+
+  var VERSION = "3.7.2";
+
+  exports.DateTime = DateTime;
+  exports.Duration = Duration;
+  exports.FixedOffsetZone = FixedOffsetZone;
+  exports.IANAZone = IANAZone;
+  exports.Info = Info;
+  exports.Interval = Interval;
+  exports.InvalidZone = InvalidZone;
+  exports.Settings = Settings;
+  exports.SystemZone = SystemZone;
+  exports.VERSION = VERSION;
+  exports.Zone = Zone;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+}));
+//# sourceMappingURL=luxon.js.map
diff --git a/node_modules/luxon/build/amd/luxon.js.map b/node_modules/luxon/build/amd/luxon.js.map
new file mode 100644
index 0000000..30cf226
--- /dev/null
+++ b/node_modules/luxon/build/amd/luxon.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"luxon.js","sources":["../../src/errors.js","../../src/impl/formats.js","../../src/zone.js","../../src/zones/systemZone.js","../../src/zones/IANAZone.js","../../src/impl/locale.js","../../src/zones/fixedOffsetZone.js","../../src/zones/invalidZone.js","../../src/impl/zoneUtil.js","../../src/impl/digits.js","../../src/settings.js","../../src/impl/invalid.js","../../src/impl/conversions.js","../../src/impl/util.js","../../src/impl/english.js","../../src/impl/formatter.js","../../src/impl/regexParser.js","../../src/duration.js","../../src/interval.js","../../src/info.js","../../src/impl/diff.js","../../src/impl/tokenParser.js","../../src/datetime.js","../../src/luxon.js"],"sourcesContent":["// these aren't really private, but nor are they really useful to document\n\n/**\n * @private\n */\nclass LuxonError extends Error {}\n\n/**\n * @private\n */\nexport class InvalidDateTimeError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid DateTime: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidIntervalError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Interval: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidDurationError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Duration: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class ConflictingSpecificationError extends LuxonError {}\n\n/**\n * @private\n */\nexport class InvalidUnitError extends LuxonError {\n  constructor(unit) {\n    super(`Invalid unit ${unit}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidArgumentError extends LuxonError {}\n\n/**\n * @private\n */\nexport class ZoneIsAbstractError extends LuxonError {\n  constructor() {\n    super(\"Zone is an abstract class\");\n  }\n}\n","/**\n * @private\n */\n\nconst n = \"numeric\",\n  s = \"short\",\n  l = \"long\";\n\nexport const DATE_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n};\n\nexport const DATE_MED = {\n  year: n,\n  month: s,\n  day: n,\n};\n\nexport const DATE_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n};\n\nexport const DATE_FULL = {\n  year: n,\n  month: l,\n  day: n,\n};\n\nexport const DATE_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n};\n\nexport const TIME_SIMPLE = {\n  hour: n,\n  minute: n,\n};\n\nexport const TIME_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const TIME_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const TIME_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n\nexport const TIME_24_SIMPLE = {\n  hour: n,\n  minute: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: s,\n};\n\nexport const TIME_24_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: l,\n};\n\nexport const DATETIME_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_SHORT_WITH_SECONDS = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_MED_WITH_SECONDS = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_FULL = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_FULL_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  timeZoneName: l,\n};\n\nexport const DATETIME_HUGE_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n","import { ZoneIsAbstractError } from \"./errors.js\";\n\n/**\n * @interface\n */\nexport default class Zone {\n  /**\n   * The type of zone\n   * @abstract\n   * @type {string}\n   */\n  get type() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The name of this zone.\n   * @abstract\n   * @type {string}\n   */\n  get name() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The IANA name of this zone.\n   * Defaults to `name` if not overwritten by a subclass.\n   * @abstract\n   * @type {string}\n   */\n  get ianaName() {\n    return this.name;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year.\n   * @abstract\n   * @type {boolean}\n   */\n  get isUniversal() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, opts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @abstract\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @abstract\n   * @type {boolean}\n   */\n  get isValid() {\n    throw new ZoneIsAbstractError();\n  }\n}\n","import { formatOffset, parseZoneInfo } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * Represents the local zone for this JavaScript environment.\n * @implements {Zone}\n */\nexport default class SystemZone extends Zone {\n  /**\n   * Get a singleton instance of the local zone\n   * @return {SystemZone}\n   */\n  static get instance() {\n    if (singleton === null) {\n      singleton = new SystemZone();\n    }\n    return singleton;\n  }\n\n  /** @override **/\n  get type() {\n    return \"system\";\n  }\n\n  /** @override **/\n  get name() {\n    return new Intl.DateTimeFormat().resolvedOptions().timeZone;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale);\n  }\n\n  /** @override **/\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /** @override **/\n  offset(ts) {\n    return -new Date(ts).getTimezoneOffset();\n  }\n\n  /** @override **/\n  equals(otherZone) {\n    return otherZone.type === \"system\";\n  }\n\n  /** @override **/\n  get isValid() {\n    return true;\n  }\n}\n","import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nconst dtfCache = new Map();\nfunction makeDTF(zoneName) {\n  let dtf = dtfCache.get(zoneName);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(\"en-US\", {\n      hour12: false,\n      timeZone: zoneName,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      era: \"short\",\n    });\n    dtfCache.set(zoneName, dtf);\n  }\n  return dtf;\n}\n\nconst typeToPos = {\n  year: 0,\n  month: 1,\n  day: 2,\n  era: 3,\n  hour: 4,\n  minute: 5,\n  second: 6,\n};\n\nfunction hackyOffset(dtf, date) {\n  const formatted = dtf.format(date).replace(/\\u200E/g, \"\"),\n    parsed = /(\\d+)\\/(\\d+)\\/(\\d+) (AD|BC),? (\\d+):(\\d+):(\\d+)/.exec(formatted),\n    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;\n  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];\n}\n\nfunction partsOffset(dtf, date) {\n  const formatted = dtf.formatToParts(date);\n  const filled = [];\n  for (let i = 0; i < formatted.length; i++) {\n    const { type, value } = formatted[i];\n    const pos = typeToPos[type];\n\n    if (type === \"era\") {\n      filled[pos] = value;\n    } else if (!isUndefined(pos)) {\n      filled[pos] = parseInt(value, 10);\n    }\n  }\n  return filled;\n}\n\nconst ianaZoneCache = new Map();\n/**\n * A zone identified by an IANA identifier, like America/New_York\n * @implements {Zone}\n */\nexport default class IANAZone extends Zone {\n  /**\n   * @param {string} name - Zone name\n   * @return {IANAZone}\n   */\n  static create(name) {\n    let zone = ianaZoneCache.get(name);\n    if (zone === undefined) {\n      ianaZoneCache.set(name, (zone = new IANAZone(name)));\n    }\n    return zone;\n  }\n\n  /**\n   * Reset local caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCache() {\n    ianaZoneCache.clear();\n    dtfCache.clear();\n  }\n\n  /**\n   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.\n   * @param {string} s - The string to check validity on\n   * @example IANAZone.isValidSpecifier(\"America/New_York\") //=> true\n   * @example IANAZone.isValidSpecifier(\"Sport~~blorp\") //=> false\n   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.\n   * @return {boolean}\n   */\n  static isValidSpecifier(s) {\n    return this.isValidZone(s);\n  }\n\n  /**\n   * Returns whether the provided string identifies a real zone\n   * @param {string} zone - The string to check\n   * @example IANAZone.isValidZone(\"America/New_York\") //=> true\n   * @example IANAZone.isValidZone(\"Fantasia/Castle\") //=> false\n   * @example IANAZone.isValidZone(\"Sport~~blorp\") //=> false\n   * @return {boolean}\n   */\n  static isValidZone(zone) {\n    if (!zone) {\n      return false;\n    }\n    try {\n      new Intl.DateTimeFormat(\"en-US\", { timeZone: zone }).format();\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  constructor(name) {\n    super();\n    /** @private **/\n    this.zoneName = name;\n    /** @private **/\n    this.valid = IANAZone.isValidZone(name);\n  }\n\n  /**\n   * The type of zone. `iana` for all instances of `IANAZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"iana\";\n  }\n\n  /**\n   * The name of this zone (i.e. the IANA zone name).\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.zoneName;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns false for all IANA zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return false;\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale, this.name);\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    if (!this.valid) return NaN;\n    const date = new Date(ts);\n\n    if (isNaN(date)) return NaN;\n\n    const dtf = makeDTF(this.name);\n    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts\n      ? partsOffset(dtf, date)\n      : hackyOffset(dtf, date);\n\n    if (adOrBc === \"BC\") {\n      year = -Math.abs(year) + 1;\n    }\n\n    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat\n    const adjustedHour = hour === 24 ? 0 : hour;\n\n    const asUTC = objToLocalTS({\n      year,\n      month,\n      day,\n      hour: adjustedHour,\n      minute,\n      second,\n      millisecond: 0,\n    });\n\n    let asTS = +date;\n    const over = asTS % 1000;\n    asTS -= over >= 0 ? over : 1000 + over;\n    return (asUTC - asTS) / (60 * 1000);\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"iana\" && otherZone.name === this.name;\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.valid;\n  }\n}\n","import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from \"./util.js\";\nimport * as English from \"./english.js\";\nimport Settings from \"../settings.js\";\nimport DateTime from \"../datetime.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n// todo - remap caching\n\nlet intlLFCache = {};\nfunction getCachedLF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlLFCache[key];\n  if (!dtf) {\n    dtf = new Intl.ListFormat(locString, opts);\n    intlLFCache[key] = dtf;\n  }\n  return dtf;\n}\n\nconst intlDTCache = new Map();\nfunction getCachedDTF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlDTCache.get(key);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(locString, opts);\n    intlDTCache.set(key, dtf);\n  }\n  return dtf;\n}\n\nconst intlNumCache = new Map();\nfunction getCachedINF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let inf = intlNumCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.NumberFormat(locString, opts);\n    intlNumCache.set(key, inf);\n  }\n  return inf;\n}\n\nconst intlRelCache = new Map();\nfunction getCachedRTF(locString, opts = {}) {\n  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options\n  const key = JSON.stringify([locString, cacheKeyOpts]);\n  let inf = intlRelCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.RelativeTimeFormat(locString, opts);\n    intlRelCache.set(key, inf);\n  }\n  return inf;\n}\n\nlet sysLocaleCache = null;\nfunction systemLocale() {\n  if (sysLocaleCache) {\n    return sysLocaleCache;\n  } else {\n    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;\n    return sysLocaleCache;\n  }\n}\n\nconst intlResolvedOptionsCache = new Map();\nfunction getCachedIntResolvedOptions(locString) {\n  let opts = intlResolvedOptionsCache.get(locString);\n  if (opts === undefined) {\n    opts = new Intl.DateTimeFormat(locString).resolvedOptions();\n    intlResolvedOptionsCache.set(locString, opts);\n  }\n  return opts;\n}\n\nconst weekInfoCache = new Map();\nfunction getCachedWeekInfo(locString) {\n  let data = weekInfoCache.get(locString);\n  if (!data) {\n    const locale = new Intl.Locale(locString);\n    // browsers currently implement this as a property, but spec says it should be a getter function\n    data = \"getWeekInfo\" in locale ? locale.getWeekInfo() : locale.weekInfo;\n    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86\n    if (!(\"minimalDays\" in data)) {\n      data = { ...fallbackWeekSettings, ...data };\n    }\n    weekInfoCache.set(locString, data);\n  }\n  return data;\n}\n\nfunction parseLocaleString(localeStr) {\n  // I really want to avoid writing a BCP 47 parser\n  // see, e.g. https://github.com/wooorm/bcp-47\n  // Instead, we'll do this:\n\n  // a) if the string has no -u extensions, just leave it alone\n  // b) if it does, use Intl to resolve everything\n  // c) if Intl fails, try again without the -u\n\n  // private subtags and unicode subtags have ordering requirements,\n  // and we're not properly parsing this, so just strip out the\n  // private ones if they exist.\n  const xIndex = localeStr.indexOf(\"-x-\");\n  if (xIndex !== -1) {\n    localeStr = localeStr.substring(0, xIndex);\n  }\n\n  const uIndex = localeStr.indexOf(\"-u-\");\n  if (uIndex === -1) {\n    return [localeStr];\n  } else {\n    let options;\n    let selectedStr;\n    try {\n      options = getCachedDTF(localeStr).resolvedOptions();\n      selectedStr = localeStr;\n    } catch (e) {\n      const smaller = localeStr.substring(0, uIndex);\n      options = getCachedDTF(smaller).resolvedOptions();\n      selectedStr = smaller;\n    }\n\n    const { numberingSystem, calendar } = options;\n    return [selectedStr, numberingSystem, calendar];\n  }\n}\n\nfunction intlConfigString(localeStr, numberingSystem, outputCalendar) {\n  if (outputCalendar || numberingSystem) {\n    if (!localeStr.includes(\"-u-\")) {\n      localeStr += \"-u\";\n    }\n\n    if (outputCalendar) {\n      localeStr += `-ca-${outputCalendar}`;\n    }\n\n    if (numberingSystem) {\n      localeStr += `-nu-${numberingSystem}`;\n    }\n    return localeStr;\n  } else {\n    return localeStr;\n  }\n}\n\nfunction mapMonths(f) {\n  const ms = [];\n  for (let i = 1; i <= 12; i++) {\n    const dt = DateTime.utc(2009, i, 1);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction mapWeekdays(f) {\n  const ms = [];\n  for (let i = 1; i <= 7; i++) {\n    const dt = DateTime.utc(2016, 11, 13 + i);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction listStuff(loc, length, englishFn, intlFn) {\n  const mode = loc.listingMode();\n\n  if (mode === \"error\") {\n    return null;\n  } else if (mode === \"en\") {\n    return englishFn(length);\n  } else {\n    return intlFn(length);\n  }\n}\n\nfunction supportsFastNumbers(loc) {\n  if (loc.numberingSystem && loc.numberingSystem !== \"latn\") {\n    return false;\n  } else {\n    return (\n      loc.numberingSystem === \"latn\" ||\n      !loc.locale ||\n      loc.locale.startsWith(\"en\") ||\n      getCachedIntResolvedOptions(loc.locale).numberingSystem === \"latn\"\n    );\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyNumberFormatter {\n  constructor(intl, forceSimple, opts) {\n    this.padTo = opts.padTo || 0;\n    this.floor = opts.floor || false;\n\n    const { padTo, floor, ...otherOpts } = opts;\n\n    if (!forceSimple || Object.keys(otherOpts).length > 0) {\n      const intlOpts = { useGrouping: false, ...opts };\n      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;\n      this.inf = getCachedINF(intl, intlOpts);\n    }\n  }\n\n  format(i) {\n    if (this.inf) {\n      const fixed = this.floor ? Math.floor(i) : i;\n      return this.inf.format(fixed);\n    } else {\n      // to match the browser's numberformatter defaults\n      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);\n      return padStart(fixed, this.padTo);\n    }\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyDateFormatter {\n  constructor(dt, intl, opts) {\n    this.opts = opts;\n    this.originalZone = undefined;\n\n    let z = undefined;\n    if (this.opts.timeZone) {\n      // Don't apply any workarounds if a timeZone is explicitly provided in opts\n      this.dt = dt;\n    } else if (dt.zone.type === \"fixed\") {\n      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.\n      // That is why fixed-offset TZ is set to that unless it is:\n      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.\n      // 2. Unsupported by the browser:\n      //    - some do not support Etc/\n      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata\n      const gmtOffset = -1 * (dt.offset / 60);\n      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;\n      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {\n        z = offsetZ;\n        this.dt = dt;\n      } else {\n        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so\n        // we manually apply the offset and substitute the zone as needed.\n        z = \"UTC\";\n        this.dt = dt.offset === 0 ? dt : dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n        this.originalZone = dt.zone;\n      }\n    } else if (dt.zone.type === \"system\") {\n      this.dt = dt;\n    } else if (dt.zone.type === \"iana\") {\n      this.dt = dt;\n      z = dt.zone.name;\n    } else {\n      // Custom zones can have any offset / offsetName so we just manually\n      // apply the offset and substitute the zone as needed.\n      z = \"UTC\";\n      this.dt = dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n      this.originalZone = dt.zone;\n    }\n\n    const intlOpts = { ...this.opts };\n    intlOpts.timeZone = intlOpts.timeZone || z;\n    this.dtf = getCachedDTF(intl, intlOpts);\n  }\n\n  format() {\n    if (this.originalZone) {\n      // If we have to substitute in the actual zone name, we have to use\n      // formatToParts so that the timezone can be replaced.\n      return this.formatToParts()\n        .map(({ value }) => value)\n        .join(\"\");\n    }\n    return this.dtf.format(this.dt.toJSDate());\n  }\n\n  formatToParts() {\n    const parts = this.dtf.formatToParts(this.dt.toJSDate());\n    if (this.originalZone) {\n      return parts.map((part) => {\n        if (part.type === \"timeZoneName\") {\n          const offsetName = this.originalZone.offsetName(this.dt.ts, {\n            locale: this.dt.locale,\n            format: this.opts.timeZoneName,\n          });\n          return {\n            ...part,\n            value: offsetName,\n          };\n        } else {\n          return part;\n        }\n      });\n    }\n    return parts;\n  }\n\n  resolvedOptions() {\n    return this.dtf.resolvedOptions();\n  }\n}\n\n/**\n * @private\n */\nclass PolyRelFormatter {\n  constructor(intl, isEnglish, opts) {\n    this.opts = { style: \"long\", ...opts };\n    if (!isEnglish && hasRelative()) {\n      this.rtf = getCachedRTF(intl, opts);\n    }\n  }\n\n  format(count, unit) {\n    if (this.rtf) {\n      return this.rtf.format(count, unit);\n    } else {\n      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== \"long\");\n    }\n  }\n\n  formatToParts(count, unit) {\n    if (this.rtf) {\n      return this.rtf.formatToParts(count, unit);\n    } else {\n      return [];\n    }\n  }\n}\n\nconst fallbackWeekSettings = {\n  firstDay: 1,\n  minimalDays: 4,\n  weekend: [6, 7],\n};\n\n/**\n * @private\n */\nexport default class Locale {\n  static fromOpts(opts) {\n    return Locale.create(\n      opts.locale,\n      opts.numberingSystem,\n      opts.outputCalendar,\n      opts.weekSettings,\n      opts.defaultToEN\n    );\n  }\n\n  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {\n    const specifiedLocale = locale || Settings.defaultLocale;\n    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats\n    const localeR = specifiedLocale || (defaultToEN ? \"en-US\" : systemLocale());\n    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;\n    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;\n    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;\n    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);\n  }\n\n  static resetCache() {\n    sysLocaleCache = null;\n    intlDTCache.clear();\n    intlNumCache.clear();\n    intlRelCache.clear();\n    intlResolvedOptionsCache.clear();\n    weekInfoCache.clear();\n  }\n\n  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {\n    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);\n  }\n\n  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {\n    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);\n\n    this.locale = parsedLocale;\n    this.numberingSystem = numbering || parsedNumberingSystem || null;\n    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;\n    this.weekSettings = weekSettings;\n    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);\n\n    this.weekdaysCache = { format: {}, standalone: {} };\n    this.monthsCache = { format: {}, standalone: {} };\n    this.meridiemCache = null;\n    this.eraCache = {};\n\n    this.specifiedLocale = specifiedLocale;\n    this.fastNumbersCached = null;\n  }\n\n  get fastNumbers() {\n    if (this.fastNumbersCached == null) {\n      this.fastNumbersCached = supportsFastNumbers(this);\n    }\n\n    return this.fastNumbersCached;\n  }\n\n  listingMode() {\n    const isActuallyEn = this.isEnglish();\n    const hasNoWeirdness =\n      (this.numberingSystem === null || this.numberingSystem === \"latn\") &&\n      (this.outputCalendar === null || this.outputCalendar === \"gregory\");\n    return isActuallyEn && hasNoWeirdness ? \"en\" : \"intl\";\n  }\n\n  clone(alts) {\n    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {\n      return this;\n    } else {\n      return Locale.create(\n        alts.locale || this.specifiedLocale,\n        alts.numberingSystem || this.numberingSystem,\n        alts.outputCalendar || this.outputCalendar,\n        validateWeekSettings(alts.weekSettings) || this.weekSettings,\n        alts.defaultToEN || false\n      );\n    }\n  }\n\n  redefaultToEN(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: true });\n  }\n\n  redefaultToSystem(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: false });\n  }\n\n  months(length, format = false) {\n    return listStuff(this, length, English.months, () => {\n      // Workaround for \"ja\" locale: formatToParts does not label all parts of the month\n      // as \"month\" and for this locale there is no difference between \"format\" and \"non-format\".\n      // As such, just use format() instead of formatToParts() and take the whole string\n      const monthSpecialCase = this.intl === \"ja\" || this.intl.startsWith(\"ja-\");\n      format &= !monthSpecialCase;\n      const intl = format ? { month: length, day: \"numeric\" } : { month: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.monthsCache[formatStr][length]) {\n        const mapper = !monthSpecialCase\n          ? (dt) => this.extract(dt, intl, \"month\")\n          : (dt) => this.dtFormatter(dt, intl).format();\n        this.monthsCache[formatStr][length] = mapMonths(mapper);\n      }\n      return this.monthsCache[formatStr][length];\n    });\n  }\n\n  weekdays(length, format = false) {\n    return listStuff(this, length, English.weekdays, () => {\n      const intl = format\n          ? { weekday: length, year: \"numeric\", month: \"long\", day: \"numeric\" }\n          : { weekday: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.weekdaysCache[formatStr][length]) {\n        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>\n          this.extract(dt, intl, \"weekday\")\n        );\n      }\n      return this.weekdaysCache[formatStr][length];\n    });\n  }\n\n  meridiems() {\n    return listStuff(\n      this,\n      undefined,\n      () => English.meridiems,\n      () => {\n        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two\n        // for AM and PM. This is probably wrong, but it's makes parsing way easier.\n        if (!this.meridiemCache) {\n          const intl = { hour: \"numeric\", hourCycle: \"h12\" };\n          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(\n            (dt) => this.extract(dt, intl, \"dayperiod\")\n          );\n        }\n\n        return this.meridiemCache;\n      }\n    );\n  }\n\n  eras(length) {\n    return listStuff(this, length, English.eras, () => {\n      const intl = { era: length };\n\n      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates\n      // to definitely enumerate them.\n      if (!this.eraCache[length]) {\n        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>\n          this.extract(dt, intl, \"era\")\n        );\n      }\n\n      return this.eraCache[length];\n    });\n  }\n\n  extract(dt, intlOpts, field) {\n    const df = this.dtFormatter(dt, intlOpts),\n      results = df.formatToParts(),\n      matching = results.find((m) => m.type.toLowerCase() === field);\n    return matching ? matching.value : null;\n  }\n\n  numberFormatter(opts = {}) {\n    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)\n    // (in contrast, the rest of the condition is used heavily)\n    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);\n  }\n\n  dtFormatter(dt, intlOpts = {}) {\n    return new PolyDateFormatter(dt, this.intl, intlOpts);\n  }\n\n  relFormatter(opts = {}) {\n    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);\n  }\n\n  listFormatter(opts = {}) {\n    return getCachedLF(this.intl, opts);\n  }\n\n  isEnglish() {\n    return (\n      this.locale === \"en\" ||\n      this.locale.toLowerCase() === \"en-us\" ||\n      getCachedIntResolvedOptions(this.intl).locale.startsWith(\"en-us\")\n    );\n  }\n\n  getWeekSettings() {\n    if (this.weekSettings) {\n      return this.weekSettings;\n    } else if (!hasLocaleWeekInfo()) {\n      return fallbackWeekSettings;\n    } else {\n      return getCachedWeekInfo(this.locale);\n    }\n  }\n\n  getStartOfWeek() {\n    return this.getWeekSettings().firstDay;\n  }\n\n  getMinDaysInFirstWeek() {\n    return this.getWeekSettings().minimalDays;\n  }\n\n  getWeekendDays() {\n    return this.getWeekSettings().weekend;\n  }\n\n  equals(other) {\n    return (\n      this.locale === other.locale &&\n      this.numberingSystem === other.numberingSystem &&\n      this.outputCalendar === other.outputCalendar\n    );\n  }\n\n  toString() {\n    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;\n  }\n}\n","import { formatOffset, signedOffset } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * A zone with a fixed offset (meaning no DST)\n * @implements {Zone}\n */\nexport default class FixedOffsetZone extends Zone {\n  /**\n   * Get a singleton instance of UTC\n   * @return {FixedOffsetZone}\n   */\n  static get utcInstance() {\n    if (singleton === null) {\n      singleton = new FixedOffsetZone(0);\n    }\n    return singleton;\n  }\n\n  /**\n   * Get an instance with a specified offset\n   * @param {number} offset - The offset in minutes\n   * @return {FixedOffsetZone}\n   */\n  static instance(offset) {\n    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);\n  }\n\n  /**\n   * Get an instance of FixedOffsetZone from a UTC offset string, like \"UTC+6\"\n   * @param {string} s - The offset string to parse\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+6\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+06\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC-6:00\")\n   * @return {FixedOffsetZone}\n   */\n  static parseSpecifier(s) {\n    if (s) {\n      const r = s.match(/^utc(?:([+-]\\d{1,2})(?::(\\d{2}))?)?$/i);\n      if (r) {\n        return new FixedOffsetZone(signedOffset(r[1], r[2]));\n      }\n    }\n    return null;\n  }\n\n  constructor(offset) {\n    super();\n    /** @private **/\n    this.fixed = offset;\n  }\n\n  /**\n   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"fixed\";\n  }\n\n  /**\n   * The name of this zone.\n   * All fixed zones' names always start with \"UTC\" (plus optional offset)\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.fixed === 0 ? \"UTC\" : `UTC${formatOffset(this.fixed, \"narrow\")}`;\n  }\n\n  /**\n   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`\n   *\n   * @override\n   * @type {string}\n   */\n  get ianaName() {\n    if (this.fixed === 0) {\n      return \"Etc/UTC\";\n    } else {\n      return `Etc/GMT${formatOffset(-this.fixed, \"narrow\")}`;\n    }\n  }\n\n  /**\n   * Returns the offset's common name at the specified timestamp.\n   *\n   * For fixed offset zones this equals to the zone name.\n   * @override\n   */\n  offsetName() {\n    return this.name;\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.fixed, format);\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns true for all fixed offset zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return true;\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   *\n   * For fixed offset zones, this is constant and does not depend on a timestamp.\n   * @override\n   * @return {number}\n   */\n  offset() {\n    return this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"fixed\" && otherZone.fixed === this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is valid:\n   * All fixed offset zones are valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return true;\n  }\n}\n","import Zone from \"../zone.js\";\n\n/**\n * A zone that failed to parse. You should never need to instantiate this.\n * @implements {Zone}\n */\nexport default class InvalidZone extends Zone {\n  constructor(zoneName) {\n    super();\n    /**  @private */\n    this.zoneName = zoneName;\n  }\n\n  /** @override **/\n  get type() {\n    return \"invalid\";\n  }\n\n  /** @override **/\n  get name() {\n    return this.zoneName;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName() {\n    return null;\n  }\n\n  /** @override **/\n  formatOffset() {\n    return \"\";\n  }\n\n  /** @override **/\n  offset() {\n    return NaN;\n  }\n\n  /** @override **/\n  equals() {\n    return false;\n  }\n\n  /** @override **/\n  get isValid() {\n    return false;\n  }\n}\n","/**\n * @private\n */\n\nimport Zone from \"../zone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport InvalidZone from \"../zones/invalidZone.js\";\n\nimport { isUndefined, isString, isNumber } from \"./util.js\";\nimport SystemZone from \"../zones/systemZone.js\";\n\nexport function normalizeZone(input, defaultZone) {\n  let offset;\n  if (isUndefined(input) || input === null) {\n    return defaultZone;\n  } else if (input instanceof Zone) {\n    return input;\n  } else if (isString(input)) {\n    const lowered = input.toLowerCase();\n    if (lowered === \"default\") return defaultZone;\n    else if (lowered === \"local\" || lowered === \"system\") return SystemZone.instance;\n    else if (lowered === \"utc\" || lowered === \"gmt\") return FixedOffsetZone.utcInstance;\n    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);\n  } else if (isNumber(input)) {\n    return FixedOffsetZone.instance(input);\n  } else if (typeof input === \"object\" && \"offset\" in input && typeof input.offset === \"function\") {\n    // This is dumb, but the instanceof check above doesn't seem to really work\n    // so we're duck checking it\n    return input;\n  } else {\n    return new InvalidZone(input);\n  }\n}\n","const numberingSystems = {\n  arab: \"[\\u0660-\\u0669]\",\n  arabext: \"[\\u06F0-\\u06F9]\",\n  bali: \"[\\u1B50-\\u1B59]\",\n  beng: \"[\\u09E6-\\u09EF]\",\n  deva: \"[\\u0966-\\u096F]\",\n  fullwide: \"[\\uFF10-\\uFF19]\",\n  gujr: \"[\\u0AE6-\\u0AEF]\",\n  hanidec: \"[〇|一|二|三|四|五|六|七|八|九]\",\n  khmr: \"[\\u17E0-\\u17E9]\",\n  knda: \"[\\u0CE6-\\u0CEF]\",\n  laoo: \"[\\u0ED0-\\u0ED9]\",\n  limb: \"[\\u1946-\\u194F]\",\n  mlym: \"[\\u0D66-\\u0D6F]\",\n  mong: \"[\\u1810-\\u1819]\",\n  mymr: \"[\\u1040-\\u1049]\",\n  orya: \"[\\u0B66-\\u0B6F]\",\n  tamldec: \"[\\u0BE6-\\u0BEF]\",\n  telu: \"[\\u0C66-\\u0C6F]\",\n  thai: \"[\\u0E50-\\u0E59]\",\n  tibt: \"[\\u0F20-\\u0F29]\",\n  latn: \"\\\\d\",\n};\n\nconst numberingSystemsUTF16 = {\n  arab: [1632, 1641],\n  arabext: [1776, 1785],\n  bali: [6992, 7001],\n  beng: [2534, 2543],\n  deva: [2406, 2415],\n  fullwide: [65296, 65303],\n  gujr: [2790, 2799],\n  khmr: [6112, 6121],\n  knda: [3302, 3311],\n  laoo: [3792, 3801],\n  limb: [6470, 6479],\n  mlym: [3430, 3439],\n  mong: [6160, 6169],\n  mymr: [4160, 4169],\n  orya: [2918, 2927],\n  tamldec: [3046, 3055],\n  telu: [3174, 3183],\n  thai: [3664, 3673],\n  tibt: [3872, 3881],\n};\n\nconst hanidecChars = numberingSystems.hanidec.replace(/[\\[|\\]]/g, \"\").split(\"\");\n\nexport function parseDigits(str) {\n  let value = parseInt(str, 10);\n  if (isNaN(value)) {\n    value = \"\";\n    for (let i = 0; i < str.length; i++) {\n      const code = str.charCodeAt(i);\n\n      if (str[i].search(numberingSystems.hanidec) !== -1) {\n        value += hanidecChars.indexOf(str[i]);\n      } else {\n        for (const key in numberingSystemsUTF16) {\n          const [min, max] = numberingSystemsUTF16[key];\n          if (code >= min && code <= max) {\n            value += code - min;\n          }\n        }\n      }\n    }\n    return parseInt(value, 10);\n  } else {\n    return value;\n  }\n}\n\n// cache of {numberingSystem: {append: regex}}\nconst digitRegexCache = new Map();\nexport function resetDigitRegexCache() {\n  digitRegexCache.clear();\n}\n\nexport function digitRegex({ numberingSystem }, append = \"\") {\n  const ns = numberingSystem || \"latn\";\n\n  let appendCache = digitRegexCache.get(ns);\n  if (appendCache === undefined) {\n    appendCache = new Map();\n    digitRegexCache.set(ns, appendCache);\n  }\n  let regex = appendCache.get(append);\n  if (regex === undefined) {\n    regex = new RegExp(`${numberingSystems[ns]}${append}`);\n    appendCache.set(append, regex);\n  }\n\n  return regex;\n}\n","import SystemZone from \"./zones/systemZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport DateTime from \"./datetime.js\";\n\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport { validateWeekSettings } from \"./impl/util.js\";\nimport { resetDigitRegexCache } from \"./impl/digits.js\";\n\nlet now = () => Date.now(),\n  defaultZone = \"system\",\n  defaultLocale = null,\n  defaultNumberingSystem = null,\n  defaultOutputCalendar = null,\n  twoDigitCutoffYear = 60,\n  throwOnInvalid,\n  defaultWeekSettings = null;\n\n/**\n * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.\n */\nexport default class Settings {\n  /**\n   * Get the callback for returning the current timestamp.\n   * @type {function}\n   */\n  static get now() {\n    return now;\n  }\n\n  /**\n   * Set the callback for returning the current timestamp.\n   * The function should return a number, which will be interpreted as an Epoch millisecond count\n   * @type {function}\n   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future\n   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time\n   */\n  static set now(n) {\n    now = n;\n  }\n\n  /**\n   * Set the default time zone to create DateTimes in. Does not affect existing instances.\n   * Use the value \"system\" to reset this value to the system's time zone.\n   * @type {string}\n   */\n  static set defaultZone(zone) {\n    defaultZone = zone;\n  }\n\n  /**\n   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.\n   * The default value is the system's time zone (the one set on the machine that runs this code).\n   * @type {Zone}\n   */\n  static get defaultZone() {\n    return normalizeZone(defaultZone, SystemZone.instance);\n  }\n\n  /**\n   * Get the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultLocale() {\n    return defaultLocale;\n  }\n\n  /**\n   * Set the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultLocale(locale) {\n    defaultLocale = locale;\n  }\n\n  /**\n   * Get the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultNumberingSystem() {\n    return defaultNumberingSystem;\n  }\n\n  /**\n   * Set the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultNumberingSystem(numberingSystem) {\n    defaultNumberingSystem = numberingSystem;\n  }\n\n  /**\n   * Get the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultOutputCalendar() {\n    return defaultOutputCalendar;\n  }\n\n  /**\n   * Set the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultOutputCalendar(outputCalendar) {\n    defaultOutputCalendar = outputCalendar;\n  }\n\n  /**\n   * @typedef {Object} WeekSettings\n   * @property {number} firstDay\n   * @property {number} minimalDays\n   * @property {number[]} weekend\n   */\n\n  /**\n   * @return {WeekSettings|null}\n   */\n  static get defaultWeekSettings() {\n    return defaultWeekSettings;\n  }\n\n  /**\n   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and\n   * how many days are required in the first week of a year.\n   * Does not affect existing instances.\n   *\n   * @param {WeekSettings|null} weekSettings\n   */\n  static set defaultWeekSettings(weekSettings) {\n    defaultWeekSettings = validateWeekSettings(weekSettings);\n  }\n\n  /**\n   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   */\n  static get twoDigitCutoffYear() {\n    return twoDigitCutoffYear;\n  }\n\n  /**\n   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century\n   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century\n   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950\n   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50\n   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50\n   */\n  static set twoDigitCutoffYear(cutoffYear) {\n    twoDigitCutoffYear = cutoffYear % 100;\n  }\n\n  /**\n   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static get throwOnInvalid() {\n    return throwOnInvalid;\n  }\n\n  /**\n   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static set throwOnInvalid(t) {\n    throwOnInvalid = t;\n  }\n\n  /**\n   * Reset Luxon's global caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCaches() {\n    Locale.resetCache();\n    IANAZone.resetCache();\n    DateTime.resetCache();\n    resetDigitRegexCache();\n  }\n}\n","export default class Invalid {\n  constructor(reason, explanation) {\n    this.reason = reason;\n    this.explanation = explanation;\n  }\n\n  toMessage() {\n    if (this.explanation) {\n      return `${this.reason}: ${this.explanation}`;\n    } else {\n      return this.reason;\n    }\n  }\n}\n","import {\n  integerBetween,\n  isLeapYear,\n  timeObject,\n  daysInYear,\n  daysInMonth,\n  weeksInWeekYear,\n  isInteger,\n  isUndefined,\n} from \"./util.js\";\nimport Invalid from \"./invalid.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],\n  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];\n\nfunction unitOutOfRange(unit, value) {\n  return new Invalid(\n    \"unit out of range\",\n    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`\n  );\n}\n\nexport function dayOfWeek(year, month, day) {\n  const d = new Date(Date.UTC(year, month - 1, day));\n\n  if (year < 100 && year >= 0) {\n    d.setUTCFullYear(d.getUTCFullYear() - 1900);\n  }\n\n  const js = d.getUTCDay();\n\n  return js === 0 ? 7 : js;\n}\n\nfunction computeOrdinal(year, month, day) {\n  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];\n}\n\nfunction uncomputeOrdinal(year, ordinal) {\n  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,\n    month0 = table.findIndex((i) => i < ordinal),\n    day = ordinal - table[month0];\n  return { month: month0 + 1, day };\n}\n\nexport function isoWeekdayToLocal(isoWeekday, startOfWeek) {\n  return ((isoWeekday - startOfWeek + 7) % 7) + 1;\n}\n\n/**\n * @private\n */\n\nexport function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { year, month, day } = gregObj,\n    ordinal = computeOrdinal(year, month, day),\n    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);\n\n  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),\n    weekYear;\n\n  if (weekNumber < 1) {\n    weekYear = year - 1;\n    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);\n  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {\n    weekYear = year + 1;\n    weekNumber = 1;\n  } else {\n    weekYear = year;\n  }\n\n  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };\n}\n\nexport function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { weekYear, weekNumber, weekday } = weekData,\n    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),\n    yearInDays = daysInYear(weekYear);\n\n  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,\n    year;\n\n  if (ordinal < 1) {\n    year = weekYear - 1;\n    ordinal += daysInYear(year);\n  } else if (ordinal > yearInDays) {\n    year = weekYear + 1;\n    ordinal -= daysInYear(weekYear);\n  } else {\n    year = weekYear;\n  }\n\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(weekData) };\n}\n\nexport function gregorianToOrdinal(gregData) {\n  const { year, month, day } = gregData;\n  const ordinal = computeOrdinal(year, month, day);\n  return { year, ordinal, ...timeObject(gregData) };\n}\n\nexport function ordinalToGregorian(ordinalData) {\n  const { year, ordinal } = ordinalData;\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(ordinalData) };\n}\n\n/**\n * Check if local week units like localWeekday are used in obj.\n * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.\n * Modifies obj in-place!\n * @param obj the object values\n */\nexport function usesLocalWeekValues(obj, loc) {\n  const hasLocaleWeekData =\n    !isUndefined(obj.localWeekday) ||\n    !isUndefined(obj.localWeekNumber) ||\n    !isUndefined(obj.localWeekYear);\n  if (hasLocaleWeekData) {\n    const hasIsoWeekData =\n      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);\n\n    if (hasIsoWeekData) {\n      throw new ConflictingSpecificationError(\n        \"Cannot mix locale-based week fields with ISO-based week fields\"\n      );\n    }\n    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;\n    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;\n    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;\n    delete obj.localWeekday;\n    delete obj.localWeekNumber;\n    delete obj.localWeekYear;\n    return {\n      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),\n      startOfWeek: loc.getStartOfWeek(),\n    };\n  } else {\n    return { minDaysInFirstWeek: 4, startOfWeek: 1 };\n  }\n}\n\nexport function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const validYear = isInteger(obj.weekYear),\n    validWeek = integerBetween(\n      obj.weekNumber,\n      1,\n      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)\n    ),\n    validWeekday = integerBetween(obj.weekday, 1, 7);\n\n  if (!validYear) {\n    return unitOutOfRange(\"weekYear\", obj.weekYear);\n  } else if (!validWeek) {\n    return unitOutOfRange(\"week\", obj.weekNumber);\n  } else if (!validWeekday) {\n    return unitOutOfRange(\"weekday\", obj.weekday);\n  } else return false;\n}\n\nexport function hasInvalidOrdinalData(obj) {\n  const validYear = isInteger(obj.year),\n    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validOrdinal) {\n    return unitOutOfRange(\"ordinal\", obj.ordinal);\n  } else return false;\n}\n\nexport function hasInvalidGregorianData(obj) {\n  const validYear = isInteger(obj.year),\n    validMonth = integerBetween(obj.month, 1, 12),\n    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validMonth) {\n    return unitOutOfRange(\"month\", obj.month);\n  } else if (!validDay) {\n    return unitOutOfRange(\"day\", obj.day);\n  } else return false;\n}\n\nexport function hasInvalidTimeData(obj) {\n  const { hour, minute, second, millisecond } = obj;\n  const validHour =\n      integerBetween(hour, 0, 23) ||\n      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),\n    validMinute = integerBetween(minute, 0, 59),\n    validSecond = integerBetween(second, 0, 59),\n    validMillisecond = integerBetween(millisecond, 0, 999);\n\n  if (!validHour) {\n    return unitOutOfRange(\"hour\", hour);\n  } else if (!validMinute) {\n    return unitOutOfRange(\"minute\", minute);\n  } else if (!validSecond) {\n    return unitOutOfRange(\"second\", second);\n  } else if (!validMillisecond) {\n    return unitOutOfRange(\"millisecond\", millisecond);\n  } else return false;\n}\n","/*\n  This is just a junk drawer, containing anything used across multiple classes.\n  Because Luxon is small(ish), this should stay small and we won't worry about splitting\n  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.\n*/\n\nimport { InvalidArgumentError } from \"../errors.js\";\nimport Settings from \"../settings.js\";\nimport { dayOfWeek, isoWeekdayToLocal } from \"./conversions.js\";\n\n/**\n * @private\n */\n\n// TYPES\n\nexport function isUndefined(o) {\n  return typeof o === \"undefined\";\n}\n\nexport function isNumber(o) {\n  return typeof o === \"number\";\n}\n\nexport function isInteger(o) {\n  return typeof o === \"number\" && o % 1 === 0;\n}\n\nexport function isString(o) {\n  return typeof o === \"string\";\n}\n\nexport function isDate(o) {\n  return Object.prototype.toString.call(o) === \"[object Date]\";\n}\n\n// CAPABILITIES\n\nexport function hasRelative() {\n  try {\n    return typeof Intl !== \"undefined\" && !!Intl.RelativeTimeFormat;\n  } catch (e) {\n    return false;\n  }\n}\n\nexport function hasLocaleWeekInfo() {\n  try {\n    return (\n      typeof Intl !== \"undefined\" &&\n      !!Intl.Locale &&\n      (\"weekInfo\" in Intl.Locale.prototype || \"getWeekInfo\" in Intl.Locale.prototype)\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n// OBJECTS AND ARRAYS\n\nexport function maybeArray(thing) {\n  return Array.isArray(thing) ? thing : [thing];\n}\n\nexport function bestBy(arr, by, compare) {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  return arr.reduce((best, next) => {\n    const pair = [by(next), next];\n    if (!best) {\n      return pair;\n    } else if (compare(best[0], pair[0]) === best[0]) {\n      return best;\n    } else {\n      return pair;\n    }\n  }, null)[1];\n}\n\nexport function pick(obj, keys) {\n  return keys.reduce((a, k) => {\n    a[k] = obj[k];\n    return a;\n  }, {});\n}\n\nexport function hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function validateWeekSettings(settings) {\n  if (settings == null) {\n    return null;\n  } else if (typeof settings !== \"object\") {\n    throw new InvalidArgumentError(\"Week settings must be an object\");\n  } else {\n    if (\n      !integerBetween(settings.firstDay, 1, 7) ||\n      !integerBetween(settings.minimalDays, 1, 7) ||\n      !Array.isArray(settings.weekend) ||\n      settings.weekend.some((v) => !integerBetween(v, 1, 7))\n    ) {\n      throw new InvalidArgumentError(\"Invalid week settings\");\n    }\n    return {\n      firstDay: settings.firstDay,\n      minimalDays: settings.minimalDays,\n      weekend: Array.from(settings.weekend),\n    };\n  }\n}\n\n// NUMBERS AND STRINGS\n\nexport function integerBetween(thing, bottom, top) {\n  return isInteger(thing) && thing >= bottom && thing <= top;\n}\n\n// x % n but takes the sign of n instead of x\nexport function floorMod(x, n) {\n  return x - n * Math.floor(x / n);\n}\n\nexport function padStart(input, n = 2) {\n  const isNeg = input < 0;\n  let padded;\n  if (isNeg) {\n    padded = \"-\" + (\"\" + -input).padStart(n, \"0\");\n  } else {\n    padded = (\"\" + input).padStart(n, \"0\");\n  }\n  return padded;\n}\n\nexport function parseInteger(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseInt(string, 10);\n  }\n}\n\nexport function parseFloating(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseFloat(string);\n  }\n}\n\nexport function parseMillis(fraction) {\n  // Return undefined (instead of 0) in these cases, where fraction is not set\n  if (isUndefined(fraction) || fraction === null || fraction === \"\") {\n    return undefined;\n  } else {\n    const f = parseFloat(\"0.\" + fraction) * 1000;\n    return Math.floor(f);\n  }\n}\n\nexport function roundTo(number, digits, rounding = \"round\") {\n  const factor = 10 ** digits;\n  switch (rounding) {\n    case \"expand\":\n      return number > 0\n        ? Math.ceil(number * factor) / factor\n        : Math.floor(number * factor) / factor;\n    case \"trunc\":\n      return Math.trunc(number * factor) / factor;\n    case \"round\":\n      return Math.round(number * factor) / factor;\n    case \"floor\":\n      return Math.floor(number * factor) / factor;\n    case \"ceil\":\n      return Math.ceil(number * factor) / factor;\n    default:\n      throw new RangeError(`Value rounding ${rounding} is out of range`);\n  }\n}\n\n// DATE BASICS\n\nexport function isLeapYear(year) {\n  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n\nexport function daysInYear(year) {\n  return isLeapYear(year) ? 366 : 365;\n}\n\nexport function daysInMonth(year, month) {\n  const modMonth = floorMod(month - 1, 12) + 1,\n    modYear = year + (month - modMonth) / 12;\n\n  if (modMonth === 2) {\n    return isLeapYear(modYear) ? 29 : 28;\n  } else {\n    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];\n  }\n}\n\n// convert a calendar object to a local timestamp (epoch, but with the offset baked in)\nexport function objToLocalTS(obj) {\n  let d = Date.UTC(\n    obj.year,\n    obj.month - 1,\n    obj.day,\n    obj.hour,\n    obj.minute,\n    obj.second,\n    obj.millisecond\n  );\n\n  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that\n  if (obj.year < 100 && obj.year >= 0) {\n    d = new Date(d);\n    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not\n    // so if obj.year is in 99, but obj.day makes it roll over into year 100,\n    // the calculations done by Date.UTC are using year 2000 - which is incorrect\n    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);\n  }\n  return +d;\n}\n\n// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js\nfunction firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {\n  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);\n  return -fwdlw + minDaysInFirstWeek - 1;\n}\n\nexport function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);\n  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);\n  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;\n}\n\nexport function untruncateYear(year) {\n  if (year > 99) {\n    return year;\n  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;\n}\n\n// PARSING\n\nexport function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {\n  const date = new Date(ts),\n    intlOpts = {\n      hourCycle: \"h23\",\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n    };\n\n  if (timeZone) {\n    intlOpts.timeZone = timeZone;\n  }\n\n  const modified = { timeZoneName: offsetFormat, ...intlOpts };\n\n  const parsed = new Intl.DateTimeFormat(locale, modified)\n    .formatToParts(date)\n    .find((m) => m.type.toLowerCase() === \"timezonename\");\n  return parsed ? parsed.value : null;\n}\n\n// signedOffset('-5', '30') -> -330\nexport function signedOffset(offHourStr, offMinuteStr) {\n  let offHour = parseInt(offHourStr, 10);\n\n  // don't || this because we want to preserve -0\n  if (Number.isNaN(offHour)) {\n    offHour = 0;\n  }\n\n  const offMin = parseInt(offMinuteStr, 10) || 0,\n    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;\n  return offHour * 60 + offMinSigned;\n}\n\n// COERCION\n\nexport function asNumber(value) {\n  const numericValue = Number(value);\n  if (typeof value === \"boolean\" || value === \"\" || !Number.isFinite(numericValue))\n    throw new InvalidArgumentError(`Invalid unit value ${value}`);\n  return numericValue;\n}\n\nexport function normalizeObject(obj, normalizer) {\n  const normalized = {};\n  for (const u in obj) {\n    if (hasOwnProperty(obj, u)) {\n      const v = obj[u];\n      if (v === undefined || v === null) continue;\n      normalized[normalizer(u)] = asNumber(v);\n    }\n  }\n  return normalized;\n}\n\n/**\n * Returns the offset's value as a string\n * @param {number} ts - Epoch milliseconds for which to get the offset\n * @param {string} format - What style of offset to return.\n *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n * @return {string}\n */\nexport function formatOffset(offset, format) {\n  const hours = Math.trunc(Math.abs(offset / 60)),\n    minutes = Math.trunc(Math.abs(offset % 60)),\n    sign = offset >= 0 ? \"+\" : \"-\";\n\n  switch (format) {\n    case \"short\":\n      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;\n    case \"narrow\":\n      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : \"\"}`;\n    case \"techie\":\n      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;\n    default:\n      throw new RangeError(`Value format ${format} is out of range for property format`);\n  }\n}\n\nexport function timeObject(obj) {\n  return pick(obj, [\"hour\", \"minute\", \"second\", \"millisecond\"]);\n}\n","import * as Formats from \"./formats.js\";\nimport { pick } from \"./util.js\";\n\nfunction stringify(obj) {\n  return JSON.stringify(obj, Object.keys(obj).sort());\n}\n\n/**\n * @private\n */\n\nexport const monthsLong = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n];\n\nexport const monthsShort = [\n  \"Jan\",\n  \"Feb\",\n  \"Mar\",\n  \"Apr\",\n  \"May\",\n  \"Jun\",\n  \"Jul\",\n  \"Aug\",\n  \"Sep\",\n  \"Oct\",\n  \"Nov\",\n  \"Dec\",\n];\n\nexport const monthsNarrow = [\"J\", \"F\", \"M\", \"A\", \"M\", \"J\", \"J\", \"A\", \"S\", \"O\", \"N\", \"D\"];\n\nexport function months(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...monthsNarrow];\n    case \"short\":\n      return [...monthsShort];\n    case \"long\":\n      return [...monthsLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"11\", \"12\"];\n    case \"2-digit\":\n      return [\"01\", \"02\", \"03\", \"04\", \"05\", \"06\", \"07\", \"08\", \"09\", \"10\", \"11\", \"12\"];\n    default:\n      return null;\n  }\n}\n\nexport const weekdaysLong = [\n  \"Monday\",\n  \"Tuesday\",\n  \"Wednesday\",\n  \"Thursday\",\n  \"Friday\",\n  \"Saturday\",\n  \"Sunday\",\n];\n\nexport const weekdaysShort = [\"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\"];\n\nexport const weekdaysNarrow = [\"M\", \"T\", \"W\", \"T\", \"F\", \"S\", \"S\"];\n\nexport function weekdays(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...weekdaysNarrow];\n    case \"short\":\n      return [...weekdaysShort];\n    case \"long\":\n      return [...weekdaysLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\"];\n    default:\n      return null;\n  }\n}\n\nexport const meridiems = [\"AM\", \"PM\"];\n\nexport const erasLong = [\"Before Christ\", \"Anno Domini\"];\n\nexport const erasShort = [\"BC\", \"AD\"];\n\nexport const erasNarrow = [\"B\", \"A\"];\n\nexport function eras(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...erasNarrow];\n    case \"short\":\n      return [...erasShort];\n    case \"long\":\n      return [...erasLong];\n    default:\n      return null;\n  }\n}\n\nexport function meridiemForDateTime(dt) {\n  return meridiems[dt.hour < 12 ? 0 : 1];\n}\n\nexport function weekdayForDateTime(dt, length) {\n  return weekdays(length)[dt.weekday - 1];\n}\n\nexport function monthForDateTime(dt, length) {\n  return months(length)[dt.month - 1];\n}\n\nexport function eraForDateTime(dt, length) {\n  return eras(length)[dt.year < 0 ? 0 : 1];\n}\n\nexport function formatRelativeTime(unit, count, numeric = \"always\", narrow = false) {\n  const units = {\n    years: [\"year\", \"yr.\"],\n    quarters: [\"quarter\", \"qtr.\"],\n    months: [\"month\", \"mo.\"],\n    weeks: [\"week\", \"wk.\"],\n    days: [\"day\", \"day\", \"days\"],\n    hours: [\"hour\", \"hr.\"],\n    minutes: [\"minute\", \"min.\"],\n    seconds: [\"second\", \"sec.\"],\n  };\n\n  const lastable = [\"hours\", \"minutes\", \"seconds\"].indexOf(unit) === -1;\n\n  if (numeric === \"auto\" && lastable) {\n    const isDay = unit === \"days\";\n    switch (count) {\n      case 1:\n        return isDay ? \"tomorrow\" : `next ${units[unit][0]}`;\n      case -1:\n        return isDay ? \"yesterday\" : `last ${units[unit][0]}`;\n      case 0:\n        return isDay ? \"today\" : `this ${units[unit][0]}`;\n      default: // fall through\n    }\n  }\n\n  const isInPast = Object.is(count, -0) || count < 0,\n    fmtValue = Math.abs(count),\n    singular = fmtValue === 1,\n    lilUnits = units[unit],\n    fmtUnit = narrow\n      ? singular\n        ? lilUnits[1]\n        : lilUnits[2] || lilUnits[1]\n      : singular\n      ? units[unit][0]\n      : unit;\n  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;\n}\n\nexport function formatString(knownFormat) {\n  // these all have the offsets removed because we don't have access to them\n  // without all the intl stuff this is backfilling\n  const filtered = pick(knownFormat, [\n      \"weekday\",\n      \"era\",\n      \"year\",\n      \"month\",\n      \"day\",\n      \"hour\",\n      \"minute\",\n      \"second\",\n      \"timeZoneName\",\n      \"hourCycle\",\n    ]),\n    key = stringify(filtered),\n    dateTimeHuge = \"EEEE, LLLL d, yyyy, h:mm a\";\n  switch (key) {\n    case stringify(Formats.DATE_SHORT):\n      return \"M/d/yyyy\";\n    case stringify(Formats.DATE_MED):\n      return \"LLL d, yyyy\";\n    case stringify(Formats.DATE_MED_WITH_WEEKDAY):\n      return \"EEE, LLL d, yyyy\";\n    case stringify(Formats.DATE_FULL):\n      return \"LLLL d, yyyy\";\n    case stringify(Formats.DATE_HUGE):\n      return \"EEEE, LLLL d, yyyy\";\n    case stringify(Formats.TIME_SIMPLE):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_SECONDS):\n      return \"h:mm:ss a\";\n    case stringify(Formats.TIME_WITH_SHORT_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_LONG_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_24_SIMPLE):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_SECONDS):\n      return \"HH:mm:ss\";\n    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.DATETIME_SHORT):\n      return \"M/d/yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_MED):\n      return \"LLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL):\n      return \"LLLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_HUGE):\n      return dateTimeHuge;\n    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):\n      return \"M/d/yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_SECONDS):\n      return \"LLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):\n      return \"EEE, d LLL yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):\n      return \"LLLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):\n      return \"EEEE, LLLL d, yyyy, h:mm:ss a\";\n    default:\n      return dateTimeHuge;\n  }\n}\n","import * as English from \"./english.js\";\nimport * as Formats from \"./formats.js\";\nimport { padStart } from \"./util.js\";\n\nfunction stringifyTokens(splits, tokenToString) {\n  let s = \"\";\n  for (const token of splits) {\n    if (token.literal) {\n      s += token.val;\n    } else {\n      s += tokenToString(token.val);\n    }\n  }\n  return s;\n}\n\nconst macroTokenToFormatOpts = {\n  D: Formats.DATE_SHORT,\n  DD: Formats.DATE_MED,\n  DDD: Formats.DATE_FULL,\n  DDDD: Formats.DATE_HUGE,\n  t: Formats.TIME_SIMPLE,\n  tt: Formats.TIME_WITH_SECONDS,\n  ttt: Formats.TIME_WITH_SHORT_OFFSET,\n  tttt: Formats.TIME_WITH_LONG_OFFSET,\n  T: Formats.TIME_24_SIMPLE,\n  TT: Formats.TIME_24_WITH_SECONDS,\n  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,\n  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,\n  f: Formats.DATETIME_SHORT,\n  ff: Formats.DATETIME_MED,\n  fff: Formats.DATETIME_FULL,\n  ffff: Formats.DATETIME_HUGE,\n  F: Formats.DATETIME_SHORT_WITH_SECONDS,\n  FF: Formats.DATETIME_MED_WITH_SECONDS,\n  FFF: Formats.DATETIME_FULL_WITH_SECONDS,\n  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,\n};\n\n/**\n * @private\n */\n\nexport default class Formatter {\n  static create(locale, opts = {}) {\n    return new Formatter(locale, opts);\n  }\n\n  static parseFormat(fmt) {\n    // white-space is always considered a literal in user-provided formats\n    // the \" \" token has a special meaning (see unitForToken)\n\n    let current = null,\n      currentFull = \"\",\n      bracketed = false;\n    const splits = [];\n    for (let i = 0; i < fmt.length; i++) {\n      const c = fmt.charAt(i);\n      if (c === \"'\") {\n        // turn '' into a literal signal quote instead of just skipping the empty literal\n        if (currentFull.length > 0 || bracketed) {\n          splits.push({\n            literal: bracketed || /^\\s+$/.test(currentFull),\n            val: currentFull === \"\" ? \"'\" : currentFull,\n          });\n        }\n        current = null;\n        currentFull = \"\";\n        bracketed = !bracketed;\n      } else if (bracketed) {\n        currentFull += c;\n      } else if (c === current) {\n        currentFull += c;\n      } else {\n        if (currentFull.length > 0) {\n          splits.push({ literal: /^\\s+$/.test(currentFull), val: currentFull });\n        }\n        currentFull = c;\n        current = c;\n      }\n    }\n\n    if (currentFull.length > 0) {\n      splits.push({ literal: bracketed || /^\\s+$/.test(currentFull), val: currentFull });\n    }\n\n    return splits;\n  }\n\n  static macroTokenToFormatOpts(token) {\n    return macroTokenToFormatOpts[token];\n  }\n\n  constructor(locale, formatOpts) {\n    this.opts = formatOpts;\n    this.loc = locale;\n    this.systemLoc = null;\n  }\n\n  formatWithSystemDefault(dt, opts) {\n    if (this.systemLoc === null) {\n      this.systemLoc = this.loc.redefaultToSystem();\n    }\n    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });\n    return df.format();\n  }\n\n  dtFormatter(dt, opts = {}) {\n    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });\n  }\n\n  formatDateTime(dt, opts) {\n    return this.dtFormatter(dt, opts).format();\n  }\n\n  formatDateTimeParts(dt, opts) {\n    return this.dtFormatter(dt, opts).formatToParts();\n  }\n\n  formatInterval(interval, opts) {\n    const df = this.dtFormatter(interval.start, opts);\n    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());\n  }\n\n  resolvedOptions(dt, opts) {\n    return this.dtFormatter(dt, opts).resolvedOptions();\n  }\n\n  num(n, p = 0, signDisplay = undefined) {\n    // we get some perf out of doing this here, annoyingly\n    if (this.opts.forceSimple) {\n      return padStart(n, p);\n    }\n\n    const opts = { ...this.opts };\n\n    if (p > 0) {\n      opts.padTo = p;\n    }\n    if (signDisplay) {\n      opts.signDisplay = signDisplay;\n    }\n\n    return this.loc.numberFormatter(opts).format(n);\n  }\n\n  formatDateTimeFromString(dt, fmt) {\n    const knownEnglish = this.loc.listingMode() === \"en\",\n      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== \"gregory\",\n      string = (opts, extract) => this.loc.extract(dt, opts, extract),\n      formatOffset = (opts) => {\n        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {\n          return \"Z\";\n        }\n\n        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : \"\";\n      },\n      meridiem = () =>\n        knownEnglish\n          ? English.meridiemForDateTime(dt)\n          : string({ hour: \"numeric\", hourCycle: \"h12\" }, \"dayperiod\"),\n      month = (length, standalone) =>\n        knownEnglish\n          ? English.monthForDateTime(dt, length)\n          : string(standalone ? { month: length } : { month: length, day: \"numeric\" }, \"month\"),\n      weekday = (length, standalone) =>\n        knownEnglish\n          ? English.weekdayForDateTime(dt, length)\n          : string(\n              standalone ? { weekday: length } : { weekday: length, month: \"long\", day: \"numeric\" },\n              \"weekday\"\n            ),\n      maybeMacro = (token) => {\n        const formatOpts = Formatter.macroTokenToFormatOpts(token);\n        if (formatOpts) {\n          return this.formatWithSystemDefault(dt, formatOpts);\n        } else {\n          return token;\n        }\n      },\n      era = (length) =>\n        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, \"era\"),\n      tokenToString = (token) => {\n        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols\n        switch (token) {\n          // ms\n          case \"S\":\n            return this.num(dt.millisecond);\n          case \"u\":\n          // falls through\n          case \"SSS\":\n            return this.num(dt.millisecond, 3);\n          // seconds\n          case \"s\":\n            return this.num(dt.second);\n          case \"ss\":\n            return this.num(dt.second, 2);\n          // fractional seconds\n          case \"uu\":\n            return this.num(Math.floor(dt.millisecond / 10), 2);\n          case \"uuu\":\n            return this.num(Math.floor(dt.millisecond / 100));\n          // minutes\n          case \"m\":\n            return this.num(dt.minute);\n          case \"mm\":\n            return this.num(dt.minute, 2);\n          // hours\n          case \"h\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);\n          case \"hh\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);\n          case \"H\":\n            return this.num(dt.hour);\n          case \"HH\":\n            return this.num(dt.hour, 2);\n          // offset\n          case \"Z\":\n            // like +6\n            return formatOffset({ format: \"narrow\", allowZ: this.opts.allowZ });\n          case \"ZZ\":\n            // like +06:00\n            return formatOffset({ format: \"short\", allowZ: this.opts.allowZ });\n          case \"ZZZ\":\n            // like +0600\n            return formatOffset({ format: \"techie\", allowZ: this.opts.allowZ });\n          case \"ZZZZ\":\n            // like EST\n            return dt.zone.offsetName(dt.ts, { format: \"short\", locale: this.loc.locale });\n          case \"ZZZZZ\":\n            // like Eastern Standard Time\n            return dt.zone.offsetName(dt.ts, { format: \"long\", locale: this.loc.locale });\n          // zone\n          case \"z\":\n            // like America/New_York\n            return dt.zoneName;\n          // meridiems\n          case \"a\":\n            return meridiem();\n          // dates\n          case \"d\":\n            return useDateTimeFormatter ? string({ day: \"numeric\" }, \"day\") : this.num(dt.day);\n          case \"dd\":\n            return useDateTimeFormatter ? string({ day: \"2-digit\" }, \"day\") : this.num(dt.day, 2);\n          // weekdays - standalone\n          case \"c\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"ccc\":\n            // like 'Tues'\n            return weekday(\"short\", true);\n          case \"cccc\":\n            // like 'Tuesday'\n            return weekday(\"long\", true);\n          case \"ccccc\":\n            // like 'T'\n            return weekday(\"narrow\", true);\n          // weekdays - format\n          case \"E\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"EEE\":\n            // like 'Tues'\n            return weekday(\"short\", false);\n          case \"EEEE\":\n            // like 'Tuesday'\n            return weekday(\"long\", false);\n          case \"EEEEE\":\n            // like 'T'\n            return weekday(\"narrow\", false);\n          // months - standalone\n          case \"L\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"LL\":\n            // like 01, doesn't seem to work\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"LLL\":\n            // like Jan\n            return month(\"short\", true);\n          case \"LLLL\":\n            // like January\n            return month(\"long\", true);\n          case \"LLLLL\":\n            // like J\n            return month(\"narrow\", true);\n          // months - format\n          case \"M\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"MM\":\n            // like 01\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"MMM\":\n            // like Jan\n            return month(\"short\", false);\n          case \"MMMM\":\n            // like January\n            return month(\"long\", false);\n          case \"MMMMM\":\n            // like J\n            return month(\"narrow\", false);\n          // years\n          case \"y\":\n            // like 2014\n            return useDateTimeFormatter ? string({ year: \"numeric\" }, \"year\") : this.num(dt.year);\n          case \"yy\":\n            // like 14\n            return useDateTimeFormatter\n              ? string({ year: \"2-digit\" }, \"year\")\n              : this.num(dt.year.toString().slice(-2), 2);\n          case \"yyyy\":\n            // like 0012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 4);\n          case \"yyyyyy\":\n            // like 000012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 6);\n          // eras\n          case \"G\":\n            // like AD\n            return era(\"short\");\n          case \"GG\":\n            // like Anno Domini\n            return era(\"long\");\n          case \"GGGGG\":\n            return era(\"narrow\");\n          case \"kk\":\n            return this.num(dt.weekYear.toString().slice(-2), 2);\n          case \"kkkk\":\n            return this.num(dt.weekYear, 4);\n          case \"W\":\n            return this.num(dt.weekNumber);\n          case \"WW\":\n            return this.num(dt.weekNumber, 2);\n          case \"n\":\n            return this.num(dt.localWeekNumber);\n          case \"nn\":\n            return this.num(dt.localWeekNumber, 2);\n          case \"ii\":\n            return this.num(dt.localWeekYear.toString().slice(-2), 2);\n          case \"iiii\":\n            return this.num(dt.localWeekYear, 4);\n          case \"o\":\n            return this.num(dt.ordinal);\n          case \"ooo\":\n            return this.num(dt.ordinal, 3);\n          case \"q\":\n            // like 1\n            return this.num(dt.quarter);\n          case \"qq\":\n            // like 01\n            return this.num(dt.quarter, 2);\n          case \"X\":\n            return this.num(Math.floor(dt.ts / 1000));\n          case \"x\":\n            return this.num(dt.ts);\n          default:\n            return maybeMacro(token);\n        }\n      };\n\n    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);\n  }\n\n  formatDurationFromString(dur, fmt) {\n    const invertLargest = this.opts.signMode === \"negativeLargestOnly\" ? -1 : 1;\n    const tokenToField = (token) => {\n        switch (token[0]) {\n          case \"S\":\n            return \"milliseconds\";\n          case \"s\":\n            return \"seconds\";\n          case \"m\":\n            return \"minutes\";\n          case \"h\":\n            return \"hours\";\n          case \"d\":\n            return \"days\";\n          case \"w\":\n            return \"weeks\";\n          case \"M\":\n            return \"months\";\n          case \"y\":\n            return \"years\";\n          default:\n            return null;\n        }\n      },\n      tokenToString = (lildur, info) => (token) => {\n        const mapped = tokenToField(token);\n        if (mapped) {\n          const inversionFactor =\n            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;\n          let signDisplay;\n          if (this.opts.signMode === \"negativeLargestOnly\" && mapped !== info.largestUnit) {\n            signDisplay = \"never\";\n          } else if (this.opts.signMode === \"all\") {\n            signDisplay = \"always\";\n          } else {\n            // \"auto\" and \"negative\" are the same, but \"auto\" has better support\n            signDisplay = \"auto\";\n          }\n          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);\n        } else {\n          return token;\n        }\n      },\n      tokens = Formatter.parseFormat(fmt),\n      realTokens = tokens.reduce(\n        (found, { literal, val }) => (literal ? found : found.concat(val)),\n        []\n      ),\n      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),\n      durationInfo = {\n        isNegativeDuration: collapsed < 0,\n        // this relies on \"collapsed\" being based on \"shiftTo\", which builds up the object\n        // in order\n        largestUnit: Object.keys(collapsed.values)[0],\n      };\n    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));\n  }\n}\n","import {\n  untruncateYear,\n  signedOffset,\n  parseInteger,\n  parseMillis,\n  isUndefined,\n  parseFloating,\n} from \"./util.js\";\nimport * as English from \"./english.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n/*\n * This file handles parsing for well-specified formats. Here's how it works:\n * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.\n * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object\n * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.\n * Extractors can take a \"cursor\" representing the offset in the match to look at. This makes it easy to combine extractors.\n * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.\n * Some extractions are super dumb and simpleParse and fromStrings help DRY them.\n */\n\nconst ianaRegex = /[A-Za-z_+-]{1,256}(?::?\\/[A-Za-z0-9_+-]{1,256}(?:\\/[A-Za-z0-9_+-]{1,256})?)?/;\n\nfunction combineRegexes(...regexes) {\n  const full = regexes.reduce((f, r) => f + r.source, \"\");\n  return RegExp(`^${full}$`);\n}\n\nfunction combineExtractors(...extractors) {\n  return (m) =>\n    extractors\n      .reduce(\n        ([mergedVals, mergedZone, cursor], ex) => {\n          const [val, zone, next] = ex(m, cursor);\n          return [{ ...mergedVals, ...val }, zone || mergedZone, next];\n        },\n        [{}, null, 1]\n      )\n      .slice(0, 2);\n}\n\nfunction parse(s, ...patterns) {\n  if (s == null) {\n    return [null, null];\n  }\n\n  for (const [regex, extractor] of patterns) {\n    const m = regex.exec(s);\n    if (m) {\n      return extractor(m);\n    }\n  }\n  return [null, null];\n}\n\nfunction simpleParse(...keys) {\n  return (match, cursor) => {\n    const ret = {};\n    let i;\n\n    for (i = 0; i < keys.length; i++) {\n      ret[keys[i]] = parseInteger(match[cursor + i]);\n    }\n    return [ret, null, cursor + i];\n  };\n}\n\n// ISO and SQL parsing\nconst offsetRegex = /(?:([Zz])|([+-]\\d\\d)(?::?(\\d\\d))?)/;\nconst isoExtendedZone = `(?:${offsetRegex.source}?(?:\\\\[(${ianaRegex.source})\\\\])?)?`;\nconst isoTimeBaseRegex = /(\\d\\d)(?::?(\\d\\d)(?::?(\\d\\d)(?:[.,](\\d{1,30}))?)?)?/;\nconst isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);\nconst isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);\nconst isoYmdRegex = /([+-]\\d{6}|\\d{4})(?:-?(\\d\\d)(?:-?(\\d\\d))?)?/;\nconst isoWeekRegex = /(\\d{4})-?W(\\d\\d)(?:-?(\\d))?/;\nconst isoOrdinalRegex = /(\\d{4})-?(\\d{3})/;\nconst extractISOWeekData = simpleParse(\"weekYear\", \"weekNumber\", \"weekDay\");\nconst extractISOOrdinalData = simpleParse(\"year\", \"ordinal\");\nconst sqlYmdRegex = /(\\d{4})-(\\d\\d)-(\\d\\d)/; // dumbed-down version of the ISO one\nconst sqlTimeRegex = RegExp(\n  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`\n);\nconst sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);\n\nfunction int(match, pos, fallback) {\n  const m = match[pos];\n  return isUndefined(m) ? fallback : parseInteger(m);\n}\n\nfunction extractISOYmd(match, cursor) {\n  const item = {\n    year: int(match, cursor),\n    month: int(match, cursor + 1, 1),\n    day: int(match, cursor + 2, 1),\n  };\n\n  return [item, null, cursor + 3];\n}\n\nfunction extractISOTime(match, cursor) {\n  const item = {\n    hours: int(match, cursor, 0),\n    minutes: int(match, cursor + 1, 0),\n    seconds: int(match, cursor + 2, 0),\n    milliseconds: parseMillis(match[cursor + 3]),\n  };\n\n  return [item, null, cursor + 4];\n}\n\nfunction extractISOOffset(match, cursor) {\n  const local = !match[cursor] && !match[cursor + 1],\n    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),\n    zone = local ? null : FixedOffsetZone.instance(fullOffset);\n  return [{}, zone, cursor + 3];\n}\n\nfunction extractIANAZone(match, cursor) {\n  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;\n  return [{}, zone, cursor + 1];\n}\n\n// ISO time parsing\n\nconst isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);\n\n// ISO duration parsing\n\nconst isoDuration =\n  /^-?P(?:(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)Y)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)W)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)D)?(?:T(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)H)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20})(?:[.,](-?\\d{1,20}))?S)?)?)$/;\n\nfunction extractISODuration(match) {\n  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =\n    match;\n\n  const hasNegativePrefix = s[0] === \"-\";\n  const negativeSeconds = secondStr && secondStr[0] === \"-\";\n\n  const maybeNegate = (num, force = false) =>\n    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;\n\n  return [\n    {\n      years: maybeNegate(parseFloating(yearStr)),\n      months: maybeNegate(parseFloating(monthStr)),\n      weeks: maybeNegate(parseFloating(weekStr)),\n      days: maybeNegate(parseFloating(dayStr)),\n      hours: maybeNegate(parseFloating(hourStr)),\n      minutes: maybeNegate(parseFloating(minuteStr)),\n      seconds: maybeNegate(parseFloating(secondStr), secondStr === \"-0\"),\n      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),\n    },\n  ];\n}\n\n// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York\n// and not just that we're in -240 *right now*. But since I don't think these are used that often\n// I'm just going to ignore that\nconst obsOffsets = {\n  GMT: 0,\n  EDT: -4 * 60,\n  EST: -5 * 60,\n  CDT: -5 * 60,\n  CST: -6 * 60,\n  MDT: -6 * 60,\n  MST: -7 * 60,\n  PDT: -7 * 60,\n  PST: -8 * 60,\n};\n\nfunction fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {\n  const result = {\n    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),\n    month: English.monthsShort.indexOf(monthStr) + 1,\n    day: parseInteger(dayStr),\n    hour: parseInteger(hourStr),\n    minute: parseInteger(minuteStr),\n  };\n\n  if (secondStr) result.second = parseInteger(secondStr);\n  if (weekdayStr) {\n    result.weekday =\n      weekdayStr.length > 3\n        ? English.weekdaysLong.indexOf(weekdayStr) + 1\n        : English.weekdaysShort.indexOf(weekdayStr) + 1;\n  }\n\n  return result;\n}\n\n// RFC 2822/5322\nconst rfc2822 =\n  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\\d\\d)(\\d\\d)))$/;\n\nfunction extractRFC2822(match) {\n  const [\n      ,\n      weekdayStr,\n      dayStr,\n      monthStr,\n      yearStr,\n      hourStr,\n      minuteStr,\n      secondStr,\n      obsOffset,\n      milOffset,\n      offHourStr,\n      offMinuteStr,\n    ] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n\n  let offset;\n  if (obsOffset) {\n    offset = obsOffsets[obsOffset];\n  } else if (milOffset) {\n    offset = 0;\n  } else {\n    offset = signedOffset(offHourStr, offMinuteStr);\n  }\n\n  return [result, new FixedOffsetZone(offset)];\n}\n\nfunction preprocessRFC2822(s) {\n  // Remove comments and folding whitespace and replace multiple-spaces with a single space\n  return s\n    .replace(/\\([^()]*\\)|[\\n\\t]/g, \" \")\n    .replace(/(\\s\\s+)/g, \" \")\n    .trim();\n}\n\n// http date\n\nconst rfc1123 =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\\d\\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\\d{4}) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  rfc850 =\n    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\\d\\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  ascii =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \\d|\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) (\\d{4})$/;\n\nfunction extractRFC1123Or850(match) {\n  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nfunction extractASCII(match) {\n  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nconst isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);\nconst isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);\nconst isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);\nconst isoTimeCombinedRegex = combineRegexes(isoTimeRegex);\n\nconst extractISOYmdTimeAndOffset = combineExtractors(\n  extractISOYmd,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOWeekTimeAndOffset = combineExtractors(\n  extractISOWeekData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOOrdinalDateAndTime = combineExtractors(\n  extractISOOrdinalData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOTimeAndOffset = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\n/*\n * @private\n */\n\nexport function parseISODate(s) {\n  return parse(\n    s,\n    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],\n    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],\n    [isoTimeCombinedRegex, extractISOTimeAndOffset]\n  );\n}\n\nexport function parseRFC2822Date(s) {\n  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);\n}\n\nexport function parseHTTPDate(s) {\n  return parse(\n    s,\n    [rfc1123, extractRFC1123Or850],\n    [rfc850, extractRFC1123Or850],\n    [ascii, extractASCII]\n  );\n}\n\nexport function parseISODuration(s) {\n  return parse(s, [isoDuration, extractISODuration]);\n}\n\nconst extractISOTimeOnly = combineExtractors(extractISOTime);\n\nexport function parseISOTimeOnly(s) {\n  return parse(s, [isoTimeOnly, extractISOTimeOnly]);\n}\n\nconst sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);\nconst sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);\n\nconst extractISOTimeOffsetAndIANAZone = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\nexport function parseSQL(s) {\n  return parse(\n    s,\n    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]\n  );\n}\n","import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from \"./errors.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Locale from \"./impl/locale.js\";\nimport { parseISODuration, parseISOTimeOnly } from \"./impl/regexParser.js\";\nimport {\n  asNumber,\n  hasOwnProperty,\n  isNumber,\n  isUndefined,\n  normalizeObject,\n  roundTo,\n} from \"./impl/util.js\";\nimport Settings from \"./settings.js\";\nimport DateTime from \"./datetime.js\";\n\nconst INVALID = \"Invalid Duration\";\n\n// unit conversion constants\nexport const lowOrderMatrix = {\n    weeks: {\n      days: 7,\n      hours: 7 * 24,\n      minutes: 7 * 24 * 60,\n      seconds: 7 * 24 * 60 * 60,\n      milliseconds: 7 * 24 * 60 * 60 * 1000,\n    },\n    days: {\n      hours: 24,\n      minutes: 24 * 60,\n      seconds: 24 * 60 * 60,\n      milliseconds: 24 * 60 * 60 * 1000,\n    },\n    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },\n    minutes: { seconds: 60, milliseconds: 60 * 1000 },\n    seconds: { milliseconds: 1000 },\n  },\n  casualMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: 52,\n      days: 365,\n      hours: 365 * 24,\n      minutes: 365 * 24 * 60,\n      seconds: 365 * 24 * 60 * 60,\n      milliseconds: 365 * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: 13,\n      days: 91,\n      hours: 91 * 24,\n      minutes: 91 * 24 * 60,\n      seconds: 91 * 24 * 60 * 60,\n      milliseconds: 91 * 24 * 60 * 60 * 1000,\n    },\n    months: {\n      weeks: 4,\n      days: 30,\n      hours: 30 * 24,\n      minutes: 30 * 24 * 60,\n      seconds: 30 * 24 * 60 * 60,\n      milliseconds: 30 * 24 * 60 * 60 * 1000,\n    },\n\n    ...lowOrderMatrix,\n  },\n  daysInYearAccurate = 146097.0 / 400,\n  daysInMonthAccurate = 146097.0 / 4800,\n  accurateMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: daysInYearAccurate / 7,\n      days: daysInYearAccurate,\n      hours: daysInYearAccurate * 24,\n      minutes: daysInYearAccurate * 24 * 60,\n      seconds: daysInYearAccurate * 24 * 60 * 60,\n      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: daysInYearAccurate / 28,\n      days: daysInYearAccurate / 4,\n      hours: (daysInYearAccurate * 24) / 4,\n      minutes: (daysInYearAccurate * 24 * 60) / 4,\n      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,\n      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,\n    },\n    months: {\n      weeks: daysInMonthAccurate / 7,\n      days: daysInMonthAccurate,\n      hours: daysInMonthAccurate * 24,\n      minutes: daysInMonthAccurate * 24 * 60,\n      seconds: daysInMonthAccurate * 24 * 60 * 60,\n      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,\n    },\n    ...lowOrderMatrix,\n  };\n\n// units ordered by size\nconst orderedUnits = [\n  \"years\",\n  \"quarters\",\n  \"months\",\n  \"weeks\",\n  \"days\",\n  \"hours\",\n  \"minutes\",\n  \"seconds\",\n  \"milliseconds\",\n];\n\nconst reverseUnits = orderedUnits.slice(0).reverse();\n\n// clone really means \"create another instance just like this one, but with these changes\"\nfunction clone(dur, alts, clear = false) {\n  // deep merge for vals\n  const conf = {\n    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },\n    loc: dur.loc.clone(alts.loc),\n    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,\n    matrix: alts.matrix || dur.matrix,\n  };\n  return new Duration(conf);\n}\n\nfunction durationToMillis(matrix, vals) {\n  let sum = vals.milliseconds ?? 0;\n  for (const unit of reverseUnits.slice(1)) {\n    if (vals[unit]) {\n      sum += vals[unit] * matrix[unit][\"milliseconds\"];\n    }\n  }\n  return sum;\n}\n\n// NB: mutates parameters\nfunction normalizeValues(matrix, vals) {\n  // the logic below assumes the overall value of the duration is positive\n  // if this is not the case, factor is used to make it so\n  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;\n\n  orderedUnits.reduceRight((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const previousVal = vals[previous] * factor;\n        const conv = matrix[current][previous];\n\n        // if (previousVal < 0):\n        // lower order unit is negative (e.g. { years: 2, days: -2 })\n        // normalize this by reducing the higher order unit by the appropriate amount\n        // and increasing the lower order unit\n        // this can never make the higher order unit negative, because this function only operates\n        // on positive durations, so the amount of time represented by the lower order unit cannot\n        // be larger than the higher order unit\n        // else:\n        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })\n        // in this case we attempt to convert as much as possible from the lower order unit into\n        // the higher order one\n        //\n        // Math.floor takes care of both of these cases, rounding away from 0\n        // if previousVal < 0 it makes the absolute value larger\n        // if previousVal >= it makes the absolute value smaller\n        const rollUp = Math.floor(previousVal / conv);\n        vals[current] += rollUp * factor;\n        vals[previous] -= rollUp * conv * factor;\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n\n  // try to convert any decimals into smaller units if possible\n  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }\n  orderedUnits.reduce((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const fraction = vals[previous] % 1;\n        vals[previous] -= fraction;\n        vals[current] += fraction * matrix[previous][current];\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n}\n\n// Remove all properties with a value of 0 from an object\nfunction removeZeroes(vals) {\n  const newVals = {};\n  for (const [key, value] of Object.entries(vals)) {\n    if (value !== 0) {\n      newVals[key] = value;\n    }\n  }\n  return newVals;\n}\n\n/**\n * A Duration object represents a period of time, like \"2 months\" or \"1 day, 1 hour\". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.\n *\n * Here is a brief overview of commonly used methods and getters in Duration:\n *\n * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.\n * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.\n * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.\n * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.\n * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}\n *\n * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.\n */\nexport default class Duration {\n  /**\n   * @private\n   */\n  constructor(config) {\n    const accurate = config.conversionAccuracy === \"longterm\" || false;\n    let matrix = accurate ? accurateMatrix : casualMatrix;\n\n    if (config.matrix) {\n      matrix = config.matrix;\n    }\n\n    /**\n     * @access private\n     */\n    this.values = config.values;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.conversionAccuracy = accurate ? \"longterm\" : \"casual\";\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.matrix = matrix;\n    /**\n     * @access private\n     */\n    this.isLuxonDuration = true;\n  }\n\n  /**\n   * Create Duration from a number of milliseconds.\n   * @param {number} count of milliseconds\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  static fromMillis(count, opts) {\n    return Duration.fromObject({ milliseconds: count }, opts);\n  }\n\n  /**\n   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.\n   * If this object is empty then a zero milliseconds duration is returned.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.years\n   * @param {number} obj.quarters\n   * @param {number} obj.months\n   * @param {number} obj.weeks\n   * @param {number} obj.days\n   * @param {number} obj.hours\n   * @param {number} obj.minutes\n   * @param {number} obj.seconds\n   * @param {number} obj.milliseconds\n   * @param {Object} [opts=[]] - options for creating this Duration\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the custom conversion system to use\n   * @return {Duration}\n   */\n  static fromObject(obj, opts = {}) {\n    if (obj == null || typeof obj !== \"object\") {\n      throw new InvalidArgumentError(\n        `Duration.fromObject: argument expected to be an object, got ${\n          obj === null ? \"null\" : typeof obj\n        }`\n      );\n    }\n\n    return new Duration({\n      values: normalizeObject(obj, Duration.normalizeUnit),\n      loc: Locale.fromObject(opts),\n      conversionAccuracy: opts.conversionAccuracy,\n      matrix: opts.matrix,\n    });\n  }\n\n  /**\n   * Create a Duration from DurationLike.\n   *\n   * @param {Object | number | Duration} durationLike\n   * One of:\n   * - object with keys like 'years' and 'hours'.\n   * - number representing milliseconds\n   * - Duration instance\n   * @return {Duration}\n   */\n  static fromDurationLike(durationLike) {\n    if (isNumber(durationLike)) {\n      return Duration.fromMillis(durationLike);\n    } else if (Duration.isDuration(durationLike)) {\n      return durationLike;\n    } else if (typeof durationLike === \"object\") {\n      return Duration.fromObject(durationLike);\n    } else {\n      throw new InvalidArgumentError(\n        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`\n      );\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 duration string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the preset conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }\n   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }\n   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }\n   * @return {Duration}\n   */\n  static fromISO(text, opts) {\n    const [parsed] = parseISODuration(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 time string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }\n   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @return {Duration}\n   */\n  static fromISOTime(text, opts) {\n    const [parsed] = parseISOTimeOnly(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create an invalid Duration.\n   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Duration}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Duration is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDurationError(invalid);\n    } else {\n      return new Duration({ invalid });\n    }\n  }\n\n  /**\n   * @private\n   */\n  static normalizeUnit(unit) {\n    const normalized = {\n      year: \"years\",\n      years: \"years\",\n      quarter: \"quarters\",\n      quarters: \"quarters\",\n      month: \"months\",\n      months: \"months\",\n      week: \"weeks\",\n      weeks: \"weeks\",\n      day: \"days\",\n      days: \"days\",\n      hour: \"hours\",\n      hours: \"hours\",\n      minute: \"minutes\",\n      minutes: \"minutes\",\n      second: \"seconds\",\n      seconds: \"seconds\",\n      millisecond: \"milliseconds\",\n      milliseconds: \"milliseconds\",\n    }[unit ? unit.toLowerCase() : unit];\n\n    if (!normalized) throw new InvalidUnitError(unit);\n\n    return normalized;\n  }\n\n  /**\n   * Check if an object is a Duration. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDuration(o) {\n    return (o && o.isLuxonDuration) || false;\n  }\n\n  /**\n   * Get  the locale of a Duration, such 'en-GB'\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:\n   * * `S` for milliseconds\n   * * `s` for seconds\n   * * `m` for minutes\n   * * `h` for hours\n   * * `d` for days\n   * * `w` for weeks\n   * * `M` for months\n   * * `y` for years\n   * Notes:\n   * * Add padding by repeating the token, e.g. \"yy\" pads the years to two digits, \"hhhh\" pads the hours out to four digits\n   * * Tokens can be escaped by wrapping with single quotes.\n   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - options\n   * @param {boolean} [opts.floor=true] - floor numerical values\n   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"y d s\") //=> \"1 6 2\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"yy dd sss\") //=> \"01 06 002\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"M S\") //=> \"12 518402000\"\n   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"+6 +2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"-6 -2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"negativeLargestOnly\" }) //=> \"-6 2\"\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    // reverse-compat since 1.2; we always round down now, never up, and we do it by default\n    const fmtOpts = {\n      ...opts,\n      floor: opts.round !== false && opts.floor !== false,\n    };\n    return this.isValid\n      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a string representation of a Duration with all units included.\n   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options\n   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.\n   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.\n   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero\n   * @example\n   * ```js\n   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })\n   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'\n   * dur.toHuman({ listStyle: \"long\" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'\n   * dur.toHuman({ unitDisplay: \"short\" }) //=> '1 mth, 0 wks, 5 hr, 6 min'\n   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'\n   * ```\n   */\n  toHuman(opts = {}) {\n    if (!this.isValid) return INVALID;\n\n    const showZeros = opts.showZeros !== false;\n\n    const l = orderedUnits\n      .map((unit) => {\n        const val = this.values[unit];\n        if (isUndefined(val) || (val === 0 && !showZeros)) {\n          return null;\n        }\n        return this.loc\n          .numberFormatter({ style: \"unit\", unitDisplay: \"long\", ...opts, unit: unit.slice(0, -1) })\n          .format(val);\n      })\n      .filter((n) => n);\n\n    return this.loc\n      .listFormatter({ type: \"conjunction\", style: opts.listStyle || \"narrow\", ...opts })\n      .format(l);\n  }\n\n  /**\n   * Returns a JavaScript object with this Duration's values.\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }\n   * @return {Object}\n   */\n  toObject() {\n    if (!this.isValid) return {};\n    return { ...this.values };\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'\n   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'\n   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'\n   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'\n   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'\n   * @return {string}\n   */\n  toISO() {\n    // we could use the formatter, but this is an easier way to get the minimum string\n    if (!this.isValid) return null;\n\n    let s = \"P\";\n    if (this.years !== 0) s += this.years + \"Y\";\n    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + \"M\";\n    if (this.weeks !== 0) s += this.weeks + \"W\";\n    if (this.days !== 0) s += this.days + \"D\";\n    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)\n      s += \"T\";\n    if (this.hours !== 0) s += this.hours + \"H\";\n    if (this.minutes !== 0) s += this.minutes + \"M\";\n    if (this.seconds !== 0 || this.milliseconds !== 0)\n      // this will handle \"floating point madness\" by removing extra decimal places\n      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken\n      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + \"S\";\n    if (s === \"P\") s += \"T0S\";\n    return s;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.\n   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'\n   * @return {string}\n   */\n  toISOTime(opts = {}) {\n    if (!this.isValid) return null;\n\n    const millis = this.toMillis();\n    if (millis < 0 || millis >= 86400000) return null;\n\n    opts = {\n      suppressMilliseconds: false,\n      suppressSeconds: false,\n      includePrefix: false,\n      format: \"extended\",\n      ...opts,\n      includeOffset: false,\n    };\n\n    const dateTime = DateTime.fromMillis(millis, { zone: \"UTC\" });\n    return dateTime.toISOTime(opts);\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.\n   * @return {string}\n   */\n  toString() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a string representation of this Duration appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Duration { values: ${JSON.stringify(this.values)} }`;\n    } else {\n      return `Duration { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration.\n   * @return {number}\n   */\n  toMillis() {\n    if (!this.isValid) return NaN;\n\n    return durationToMillis(this.matrix, this.values);\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration),\n      result = {};\n\n    for (const k of orderedUnits) {\n      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {\n        result[k] = dur.get(k) + this.get(k);\n      }\n    }\n\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration);\n    return this.plus(dur.negate());\n  }\n\n  /**\n   * Scale this Duration by the specified amount. Return a newly-constructed Duration.\n   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === \"hours\" ? x * 2 : x) //=> { hours: 2, minutes: 30 }\n   * @return {Duration}\n   */\n  mapUnits(fn) {\n    if (!this.isValid) return this;\n    const result = {};\n    for (const k of Object.keys(this.values)) {\n      result[k] = asNumber(fn(this.values[k], k));\n    }\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2\n   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0\n   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3\n   * @return {number}\n   */\n  get(unit) {\n    return this[Duration.normalizeUnit(unit)];\n  }\n\n  /**\n   * \"Set\" the values of specified units. Return a newly-constructed Duration.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dur.set({ years: 2017 })\n   * @example dur.set({ hours: 8, minutes: 30 })\n   * @return {Duration}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };\n    return clone(this, { values: mixed });\n  }\n\n  /**\n   * \"Set\" the locale and/or numberingSystem.  Returns a newly-constructed Duration.\n   * @example dur.reconfigure({ locale: 'en-GB' })\n   * @return {Duration}\n   */\n  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem });\n    const opts = { loc, matrix, conversionAccuracy };\n    return clone(this, opts);\n  }\n\n  /**\n   * Return the length of the duration in the specified unit.\n   * @param {string} unit - a unit such as 'minutes' or 'days'\n   * @example Duration.fromObject({years: 1}).as('days') //=> 365\n   * @example Duration.fromObject({years: 1}).as('months') //=> 12\n   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5\n   * @return {number}\n   */\n  as(unit) {\n    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;\n  }\n\n  /**\n   * Reduce this Duration to its canonical representation in its current units.\n   * Assuming the overall value of the Duration is positive, this means:\n   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)\n   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise\n   *   the overall value would be negative, see third example)\n   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)\n   *\n   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.\n   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }\n   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }\n   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }\n   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }\n   * @return {Duration}\n   */\n  normalize() {\n    if (!this.isValid) return this;\n    const vals = this.toObject();\n    normalizeValues(this.matrix, vals);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Rescale units to its largest representation\n   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }\n   * @return {Duration}\n   */\n  rescale() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.normalize().shiftToAll().toObject());\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Convert this Duration into its representation in a different set of units.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }\n   * @return {Duration}\n   */\n  shiftTo(...units) {\n    if (!this.isValid) return this;\n\n    if (units.length === 0) {\n      return this;\n    }\n\n    units = units.map((u) => Duration.normalizeUnit(u));\n\n    const built = {},\n      accumulated = {},\n      vals = this.toObject();\n    let lastUnit;\n\n    for (const k of orderedUnits) {\n      if (units.indexOf(k) >= 0) {\n        lastUnit = k;\n\n        let own = 0;\n\n        // anything we haven't boiled down yet should get boiled to this unit\n        for (const ak in accumulated) {\n          own += this.matrix[ak][k] * accumulated[ak];\n          accumulated[ak] = 0;\n        }\n\n        // plus anything that's already in this unit\n        if (isNumber(vals[k])) {\n          own += vals[k];\n        }\n\n        // only keep the integer part for now in the hopes of putting any decimal part\n        // into a smaller unit later\n        const i = Math.trunc(own);\n        built[k] = i;\n        accumulated[k] = (own * 1000 - i * 1000) / 1000;\n\n        // otherwise, keep it in the wings to boil it later\n      } else if (isNumber(vals[k])) {\n        accumulated[k] = vals[k];\n      }\n    }\n\n    // anything leftover becomes the decimal for the last unit\n    // lastUnit must be defined since units is not empty\n    for (const key in accumulated) {\n      if (accumulated[key] !== 0) {\n        built[lastUnit] +=\n          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];\n      }\n    }\n\n    normalizeValues(this.matrix, built);\n    return clone(this, { values: built }, true);\n  }\n\n  /**\n   * Shift this Duration to all available units.\n   * Same as shiftTo(\"years\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", \"seconds\", \"milliseconds\")\n   * @return {Duration}\n   */\n  shiftToAll() {\n    if (!this.isValid) return this;\n    return this.shiftTo(\n      \"years\",\n      \"months\",\n      \"weeks\",\n      \"days\",\n      \"hours\",\n      \"minutes\",\n      \"seconds\",\n      \"milliseconds\"\n    );\n  }\n\n  /**\n   * Return the negative of this Duration.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }\n   * @return {Duration}\n   */\n  negate() {\n    if (!this.isValid) return this;\n    const negated = {};\n    for (const k of Object.keys(this.values)) {\n      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];\n    }\n    return clone(this, { values: negated }, true);\n  }\n\n  /**\n   * Removes all units with values equal to 0 from this Duration.\n   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }\n   * @return {Duration}\n   */\n  removeZeros() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.values);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Get the years.\n   * @type {number}\n   */\n  get years() {\n    return this.isValid ? this.values.years || 0 : NaN;\n  }\n\n  /**\n   * Get the quarters.\n   * @type {number}\n   */\n  get quarters() {\n    return this.isValid ? this.values.quarters || 0 : NaN;\n  }\n\n  /**\n   * Get the months.\n   * @type {number}\n   */\n  get months() {\n    return this.isValid ? this.values.months || 0 : NaN;\n  }\n\n  /**\n   * Get the weeks\n   * @type {number}\n   */\n  get weeks() {\n    return this.isValid ? this.values.weeks || 0 : NaN;\n  }\n\n  /**\n   * Get the days.\n   * @type {number}\n   */\n  get days() {\n    return this.isValid ? this.values.days || 0 : NaN;\n  }\n\n  /**\n   * Get the hours.\n   * @type {number}\n   */\n  get hours() {\n    return this.isValid ? this.values.hours || 0 : NaN;\n  }\n\n  /**\n   * Get the minutes.\n   * @type {number}\n   */\n  get minutes() {\n    return this.isValid ? this.values.minutes || 0 : NaN;\n  }\n\n  /**\n   * Get the seconds.\n   * @return {number}\n   */\n  get seconds() {\n    return this.isValid ? this.values.seconds || 0 : NaN;\n  }\n\n  /**\n   * Get the milliseconds.\n   * @return {number}\n   */\n  get milliseconds() {\n    return this.isValid ? this.values.milliseconds || 0 : NaN;\n  }\n\n  /**\n   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations\n   * on invalid DateTimes or Intervals.\n   * @return {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this Duration became invalid, or null if the Duration is valid\n   * @return {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Equality check\n   * Two Durations are equal iff they have the same units and the same values for each unit.\n   * @param {Duration} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    if (!this.loc.equals(other.loc)) {\n      return false;\n    }\n\n    function eq(v1, v2) {\n      // Consider 0 and undefined as equal\n      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;\n      return v1 === v2;\n    }\n\n    for (const u of orderedUnits) {\n      if (!eq(this.values[u], other.values[u])) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n","import DateTime, { friendlyDateTime } from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Settings from \"./settings.js\";\nimport { InvalidArgumentError, InvalidIntervalError } from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport * as Formats from \"./impl/formats.js\";\n\nconst INVALID = \"Invalid Interval\";\n\n// checks if the start is equal to or before the end\nfunction validateStartEnd(start, end) {\n  if (!start || !start.isValid) {\n    return Interval.invalid(\"missing or invalid start\");\n  } else if (!end || !end.isValid) {\n    return Interval.invalid(\"missing or invalid end\");\n  } else if (end < start) {\n    return Interval.invalid(\n      \"end before start\",\n      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`\n    );\n  } else {\n    return null;\n  }\n}\n\n/**\n * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.\n *\n * Here is a brief overview of the most commonly used methods and getters in Interval:\n *\n * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.\n * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.\n * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.\n * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.\n * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}\n * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.\n */\nexport default class Interval {\n  /**\n   * @private\n   */\n  constructor(config) {\n    /**\n     * @access private\n     */\n    this.s = config.start;\n    /**\n     * @access private\n     */\n    this.e = config.end;\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.isLuxonInterval = true;\n  }\n\n  /**\n   * Create an invalid Interval.\n   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Interval}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Interval is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidIntervalError(invalid);\n    } else {\n      return new Interval({ invalid });\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.\n   * @param {DateTime|Date|Object} start\n   * @param {DateTime|Date|Object} end\n   * @return {Interval}\n   */\n  static fromDateTimes(start, end) {\n    const builtStart = friendlyDateTime(start),\n      builtEnd = friendlyDateTime(end);\n\n    const validateError = validateStartEnd(builtStart, builtEnd);\n\n    if (validateError == null) {\n      return new Interval({\n        start: builtStart,\n        end: builtEnd,\n      });\n    } else {\n      return validateError;\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and a Duration to extend to.\n   * @param {DateTime|Date|Object} start\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static after(start, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(start);\n    return Interval.fromDateTimes(dt, dt.plus(dur));\n  }\n\n  /**\n   * Create an Interval from an end DateTime and a Duration to extend backwards to.\n   * @param {DateTime|Date|Object} end\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static before(end, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(end);\n    return Interval.fromDateTimes(dt.minus(dur), dt);\n  }\n\n  /**\n   * Create an Interval from an ISO 8601 string.\n   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.\n   * @param {string} text - the ISO string to parse\n   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {Interval}\n   */\n  static fromISO(text, opts) {\n    const [s, e] = (text || \"\").split(\"/\", 2);\n    if (s && e) {\n      let start, startIsValid;\n      try {\n        start = DateTime.fromISO(s, opts);\n        startIsValid = start.isValid;\n      } catch (e) {\n        startIsValid = false;\n      }\n\n      let end, endIsValid;\n      try {\n        end = DateTime.fromISO(e, opts);\n        endIsValid = end.isValid;\n      } catch (e) {\n        endIsValid = false;\n      }\n\n      if (startIsValid && endIsValid) {\n        return Interval.fromDateTimes(start, end);\n      }\n\n      if (startIsValid) {\n        const dur = Duration.fromISO(e, opts);\n        if (dur.isValid) {\n          return Interval.after(start, dur);\n        }\n      } else if (endIsValid) {\n        const dur = Duration.fromISO(s, opts);\n        if (dur.isValid) {\n          return Interval.before(end, dur);\n        }\n      }\n    }\n    return Interval.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n  }\n\n  /**\n   * Check if an object is an Interval. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isInterval(o) {\n    return (o && o.isLuxonInterval) || false;\n  }\n\n  /**\n   * Returns the start of the Interval\n   * @type {DateTime}\n   */\n  get start() {\n    return this.isValid ? this.s : null;\n  }\n\n  /**\n   * Returns the end of the Interval. This is the first instant which is not part of the interval\n   * (Interval is half-open).\n   * @type {DateTime}\n   */\n  get end() {\n    return this.isValid ? this.e : null;\n  }\n\n  /**\n   * Returns the last DateTime included in the interval (since end is not part of the interval)\n   * @type {DateTime}\n   */\n  get lastDateTime() {\n    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;\n  }\n\n  /**\n   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalidReason === null;\n  }\n\n  /**\n   * Returns an error code if this Interval is invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Returns the length of the Interval in the specified unit.\n   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.\n   * @return {number}\n   */\n  length(unit = \"milliseconds\") {\n    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;\n  }\n\n  /**\n   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.\n   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'\n   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'\n   * @param {string} [unit='milliseconds'] - the unit of time to count.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime\n   * @return {number}\n   */\n  count(unit = \"milliseconds\", opts) {\n    if (!this.isValid) return NaN;\n    const start = this.start.startOf(unit, opts);\n    let end;\n    if (opts?.useLocaleWeeks) {\n      end = this.end.reconfigure({ locale: start.locale });\n    } else {\n      end = this.end;\n    }\n    end = end.startOf(unit, opts);\n    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());\n  }\n\n  /**\n   * Returns whether this Interval's start and end are both in the same unit of time\n   * @param {string} unit - the unit of time to check sameness on\n   * @return {boolean}\n   */\n  hasSame(unit) {\n    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end DateTimes.\n   * @return {boolean}\n   */\n  isEmpty() {\n    return this.s.valueOf() === this.e.valueOf();\n  }\n\n  /**\n   * Return whether this Interval's start is after the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isAfter(dateTime) {\n    if (!this.isValid) return false;\n    return this.s > dateTime;\n  }\n\n  /**\n   * Return whether this Interval's end is before the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isBefore(dateTime) {\n    if (!this.isValid) return false;\n    return this.e <= dateTime;\n  }\n\n  /**\n   * Return whether this Interval contains the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  contains(dateTime) {\n    if (!this.isValid) return false;\n    return this.s <= dateTime && this.e > dateTime;\n  }\n\n  /**\n   * \"Sets\" the start and/or end dates. Returns a newly-constructed Interval.\n   * @param {Object} values - the values to set\n   * @param {DateTime} values.start - the starting DateTime\n   * @param {DateTime} values.end - the ending DateTime\n   * @return {Interval}\n   */\n  set({ start, end } = {}) {\n    if (!this.isValid) return this;\n    return Interval.fromDateTimes(start || this.s, end || this.e);\n  }\n\n  /**\n   * Split this Interval at each of the specified DateTimes\n   * @param {...DateTime} dateTimes - the unit of time to count.\n   * @return {Array}\n   */\n  splitAt(...dateTimes) {\n    if (!this.isValid) return [];\n    const sorted = dateTimes\n        .map(friendlyDateTime)\n        .filter((d) => this.contains(d))\n        .sort((a, b) => a.toMillis() - b.toMillis()),\n      results = [];\n    let { s } = this,\n      i = 0;\n\n    while (s < this.e) {\n      const added = sorted[i] || this.e,\n        next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      i += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into smaller Intervals, each of the specified length.\n   * Left over time is grouped into a smaller interval\n   * @param {Duration|Object|number} duration - The length of each resulting interval.\n   * @return {Array}\n   */\n  splitBy(duration) {\n    const dur = Duration.fromDurationLike(duration);\n\n    if (!this.isValid || !dur.isValid || dur.as(\"milliseconds\") === 0) {\n      return [];\n    }\n\n    let { s } = this,\n      idx = 1,\n      next;\n\n    const results = [];\n    while (s < this.e) {\n      const added = this.start.plus(dur.mapUnits((x) => x * idx));\n      next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      idx += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into the specified number of smaller intervals.\n   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.\n   * @return {Array}\n   */\n  divideEqually(numberOfParts) {\n    if (!this.isValid) return [];\n    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);\n  }\n\n  /**\n   * Return whether this Interval overlaps with the specified Interval\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  overlaps(other) {\n    return this.e > other.s && this.s < other.e;\n  }\n\n  /**\n   * Return whether this Interval's end is adjacent to the specified Interval's start.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsStart(other) {\n    if (!this.isValid) return false;\n    return +this.e === +other.s;\n  }\n\n  /**\n   * Return whether this Interval's start is adjacent to the specified Interval's end.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsEnd(other) {\n    if (!this.isValid) return false;\n    return +other.e === +this.s;\n  }\n\n  /**\n   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  engulfs(other) {\n    if (!this.isValid) return false;\n    return this.s <= other.s && this.e >= other.e;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end as the specified Interval.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    return this.s.equals(other.s) && this.e.equals(other.e);\n  }\n\n  /**\n   * Return an Interval representing the intersection of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.\n   * Returns null if the intersection is empty, meaning, the intervals don't intersect.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  intersection(other) {\n    if (!this.isValid) return this;\n    const s = this.s > other.s ? this.s : other.s,\n      e = this.e < other.e ? this.e : other.e;\n\n    if (s >= e) {\n      return null;\n    } else {\n      return Interval.fromDateTimes(s, e);\n    }\n  }\n\n  /**\n   * Return an Interval representing the union of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  union(other) {\n    if (!this.isValid) return this;\n    const s = this.s < other.s ? this.s : other.s,\n      e = this.e > other.e ? this.e : other.e;\n    return Interval.fromDateTimes(s, e);\n  }\n\n  /**\n   * Merge an array of Intervals into an equivalent minimal set of Intervals.\n   * Combines overlapping and adjacent Intervals.\n   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval\n   * and ending with the latest.\n   *\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static merge(intervals) {\n    const [found, final] = intervals\n      .sort((a, b) => a.s - b.s)\n      .reduce(\n        ([sofar, current], item) => {\n          if (!current) {\n            return [sofar, item];\n          } else if (current.overlaps(item) || current.abutsStart(item)) {\n            return [sofar, current.union(item)];\n          } else {\n            return [sofar.concat([current]), item];\n          }\n        },\n        [[], null]\n      );\n    if (final) {\n      found.push(final);\n    }\n    return found;\n  }\n\n  /**\n   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static xor(intervals) {\n    let start = null,\n      currentCount = 0;\n    const results = [],\n      ends = intervals.map((i) => [\n        { time: i.s, type: \"s\" },\n        { time: i.e, type: \"e\" },\n      ]),\n      flattened = Array.prototype.concat(...ends),\n      arr = flattened.sort((a, b) => a.time - b.time);\n\n    for (const i of arr) {\n      currentCount += i.type === \"s\" ? 1 : -1;\n\n      if (currentCount === 1) {\n        start = i.time;\n      } else {\n        if (start && +start !== +i.time) {\n          results.push(Interval.fromDateTimes(start, i.time));\n        }\n\n        start = null;\n      }\n    }\n\n    return Interval.merge(results);\n  }\n\n  /**\n   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.\n   * @param {...Interval} intervals\n   * @return {Array}\n   */\n  difference(...intervals) {\n    return Interval.xor([this].concat(intervals))\n      .map((i) => this.intersection(i))\n      .filter((i) => i && !i.isEmpty());\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for debugging.\n   * @return {string}\n   */\n  toString() {\n    if (!this.isValid) return INVALID;\n    return `[${this.s.toISO()} – ${this.e.toISO()})`;\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;\n    } else {\n      return `Interval { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns a localized string representing this Interval. Accepts the same options as the\n   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as\n   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method\n   * is browser-specific, but in general it will return an appropriate representation of the\n   * Interval in the assigned locale. Defaults to the system's locale if no locale has been\n   * specified.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or\n   * Intl.DateTimeFormat constructor options.\n   * @param {Object} opts - Options to override the configuration of the start DateTime.\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Interval.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISO(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of date of this Interval.\n   * The time components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {string}\n   */\n  toISODate() {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISODate()}/${this.e.toISODate()}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of time of this Interval.\n   * The date components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISOTime(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this Interval formatted according to the specified format\n   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible\n   * formatting tool.\n   * @param {string} dateFormat - The format string. This string formats the start and end time.\n   * See {@link DateTime#toFormat} for details.\n   * @param {Object} opts - Options.\n   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end\n   * representations.\n   * @return {string}\n   */\n  toFormat(dateFormat, { separator = \" – \" } = {}) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;\n  }\n\n  /**\n   * Return a Duration representing the time spanned by this interval.\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }\n   * @return {Duration}\n   */\n  toDuration(unit, opts) {\n    if (!this.isValid) {\n      return Duration.invalid(this.invalidReason);\n    }\n    return this.e.diff(this.s, unit, opts);\n  }\n\n  /**\n   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes\n   * @param {function} mapFn\n   * @return {Interval}\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))\n   */\n  mapEndpoints(mapFn) {\n    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Settings from \"./settings.js\";\nimport Locale from \"./impl/locale.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\n\nimport { hasLocaleWeekInfo, hasRelative } from \"./impl/util.js\";\n\n/**\n * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.\n */\nexport default class Info {\n  /**\n   * Return whether the specified zone contains a DST.\n   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.\n   * @return {boolean}\n   */\n  static hasDST(zone = Settings.defaultZone) {\n    const proto = DateTime.now().setZone(zone).set({ month: 12 });\n\n    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;\n  }\n\n  /**\n   * Return whether the specified zone is a valid IANA specifier.\n   * @param {string} zone - Zone to check\n   * @return {boolean}\n   */\n  static isValidIANAZone(zone) {\n    return IANAZone.isValidZone(zone);\n  }\n\n  /**\n   * Converts the input into a {@link Zone} instance.\n   *\n   * * If `input` is already a Zone instance, it is returned unchanged.\n   * * If `input` is a string containing a valid time zone name, a Zone instance\n   *   with that name is returned.\n   * * If `input` is a string that doesn't refer to a known time zone, a Zone\n   *   instance with {@link Zone#isValid} == false is returned.\n   * * If `input is a number, a Zone instance with the specified fixed offset\n   *   in minutes is returned.\n   * * If `input` is `null` or `undefined`, the default zone is returned.\n   * @param {string|Zone|number} [input] - the value to be converted\n   * @return {Zone}\n   */\n  static normalizeZone(input) {\n    return normalizeZone(input, Settings.defaultZone);\n  }\n\n  /**\n   * Get the weekday on which the week starts according to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday\n   */\n  static getStartOfWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getStartOfWeek();\n  }\n\n  /**\n   * Get the minimum number of days necessary in a week before it is considered part of the next year according\n   * to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number}\n   */\n  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();\n  }\n\n  /**\n   * Get the weekdays, which are considered the weekend according to the given locale\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday\n   */\n  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {\n    // copy the array, because we cache it internally\n    return (locObj || Locale.create(locale)).getWeekendDays().slice();\n  }\n\n  /**\n   * Return an array of standalone month names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @example Info.months()[0] //=> 'January'\n   * @example Info.months('short')[0] //=> 'Jan'\n   * @example Info.months('numeric')[0] //=> '1'\n   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'\n   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'\n   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'\n   * @return {Array}\n   */\n  static months(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);\n  }\n\n  /**\n   * Return an array of format month names.\n   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that\n   * changes the string.\n   * See {@link Info#months}\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @return {Array}\n   */\n  static monthsFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);\n  }\n\n  /**\n   * Return an array of standalone week names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the weekday representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @example Info.weekdays()[0] //=> 'Monday'\n   * @example Info.weekdays('short')[0] //=> 'Mon'\n   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'\n   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'\n   * @return {Array}\n   */\n  static weekdays(length = \"long\", { locale = null, numberingSystem = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);\n  }\n\n  /**\n   * Return an array of format week names.\n   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that\n   * changes the string.\n   * See {@link Info#weekdays}\n   * @param {string} [length='long'] - the length of the month representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale=null] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @return {Array}\n   */\n  static weekdaysFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);\n  }\n\n  /**\n   * Return an array of meridiems.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.meridiems() //=> [ 'AM', 'PM' ]\n   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]\n   * @return {Array}\n   */\n  static meridiems({ locale = null } = {}) {\n    return Locale.create(locale).meridiems();\n  }\n\n  /**\n   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.\n   * @param {string} [length='short'] - the length of the era representation, such as \"short\" or \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.eras() //=> [ 'BC', 'AD' ]\n   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]\n   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]\n   * @return {Array}\n   */\n  static eras(length = \"short\", { locale = null } = {}) {\n    return Locale.create(locale, null, \"gregory\").eras(length);\n  }\n\n  /**\n   * Return the set of available features in this environment.\n   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.\n   * Keys:\n   * * `relative`: whether this environment supports relative time formatting\n   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale\n   * @example Info.features() //=> { relative: false, localeWeek: true }\n   * @return {Object}\n   */\n  static features() {\n    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };\n  }\n}\n","import Duration from \"../duration.js\";\n\nfunction dayDiff(earlier, later) {\n  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf(\"day\").valueOf(),\n    ms = utcDayStart(later) - utcDayStart(earlier);\n  return Math.floor(Duration.fromMillis(ms).as(\"days\"));\n}\n\nfunction highOrderDiffs(cursor, later, units) {\n  const differs = [\n    [\"years\", (a, b) => b.year - a.year],\n    [\"quarters\", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],\n    [\"months\", (a, b) => b.month - a.month + (b.year - a.year) * 12],\n    [\n      \"weeks\",\n      (a, b) => {\n        const days = dayDiff(a, b);\n        return (days - (days % 7)) / 7;\n      },\n    ],\n    [\"days\", dayDiff],\n  ];\n\n  const results = {};\n  const earlier = cursor;\n  let lowestOrder, highWater;\n\n  /* This loop tries to diff using larger units first.\n     If we overshoot, we backtrack and try the next smaller unit.\n     \"cursor\" starts out at the earlier timestamp and moves closer and closer to \"later\"\n     as we use smaller and smaller units.\n     highWater keeps track of where we would be if we added one more of the smallest unit,\n     this is used later to potentially convert any difference smaller than the smallest higher order unit\n     into a fraction of that smallest higher order unit\n  */\n  for (const [unit, differ] of differs) {\n    if (units.indexOf(unit) >= 0) {\n      lowestOrder = unit;\n\n      results[unit] = differ(cursor, later);\n      highWater = earlier.plus(results);\n\n      if (highWater > later) {\n        // we overshot the end point, backtrack cursor by 1\n        results[unit]--;\n        cursor = earlier.plus(results);\n\n        // if we are still overshooting now, we need to backtrack again\n        // this happens in certain situations when diffing times in different zones,\n        // because this calculation ignores time zones\n        if (cursor > later) {\n          // keep the \"overshot by 1\" around as highWater\n          highWater = cursor;\n          // backtrack cursor by 1\n          results[unit]--;\n          cursor = earlier.plus(results);\n        }\n      } else {\n        cursor = highWater;\n      }\n    }\n  }\n\n  return [cursor, results, highWater, lowestOrder];\n}\n\nexport default function (earlier, later, units, opts) {\n  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);\n\n  const remainingMillis = later - cursor;\n\n  const lowerOrderUnits = units.filter(\n    (u) => [\"hours\", \"minutes\", \"seconds\", \"milliseconds\"].indexOf(u) >= 0\n  );\n\n  if (lowerOrderUnits.length === 0) {\n    if (highWater < later) {\n      highWater = cursor.plus({ [lowestOrder]: 1 });\n    }\n\n    if (highWater !== cursor) {\n      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);\n    }\n  }\n\n  const duration = Duration.fromObject(results, opts);\n\n  if (lowerOrderUnits.length > 0) {\n    return Duration.fromMillis(remainingMillis, opts)\n      .shiftTo(...lowerOrderUnits)\n      .plus(duration);\n  } else {\n    return duration;\n  }\n}\n","import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from \"./util.js\";\nimport Formatter from \"./formatter.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport DateTime from \"../datetime.js\";\nimport { digitRegex, parseDigits } from \"./digits.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst MISSING_FTP = \"missing Intl.DateTimeFormat.formatToParts support\";\n\nfunction intUnit(regex, post = (i) => i) {\n  return { regex, deser: ([s]) => post(parseDigits(s)) };\n}\n\nconst NBSP = String.fromCharCode(160);\nconst spaceOrNBSP = `[ ${NBSP}]`;\nconst spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, \"g\");\n\nfunction fixListRegex(s) {\n  // make dots optional and also make them literal\n  // make space and non breakable space characters interchangeable\n  return s.replace(/\\./g, \"\\\\.?\").replace(spaceOrNBSPRegExp, spaceOrNBSP);\n}\n\nfunction stripInsensitivities(s) {\n  return s\n    .replace(/\\./g, \"\") // ignore dots that were made optional\n    .replace(spaceOrNBSPRegExp, \" \") // interchange space and nbsp\n    .toLowerCase();\n}\n\nfunction oneOf(strings, startIndex) {\n  if (strings === null) {\n    return null;\n  } else {\n    return {\n      regex: RegExp(strings.map(fixListRegex).join(\"|\")),\n      deser: ([s]) =>\n        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,\n    };\n  }\n}\n\nfunction offset(regex, groups) {\n  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };\n}\n\nfunction simple(regex) {\n  return { regex, deser: ([s]) => s };\n}\n\nfunction escapeToken(value) {\n  return value.replace(/[\\-\\[\\]{}()*+?.,\\\\\\^$|#\\s]/g, \"\\\\$&\");\n}\n\n/**\n * @param token\n * @param {Locale} loc\n */\nfunction unitForToken(token, loc) {\n  const one = digitRegex(loc),\n    two = digitRegex(loc, \"{2}\"),\n    three = digitRegex(loc, \"{3}\"),\n    four = digitRegex(loc, \"{4}\"),\n    six = digitRegex(loc, \"{6}\"),\n    oneOrTwo = digitRegex(loc, \"{1,2}\"),\n    oneToThree = digitRegex(loc, \"{1,3}\"),\n    oneToSix = digitRegex(loc, \"{1,6}\"),\n    oneToNine = digitRegex(loc, \"{1,9}\"),\n    twoToFour = digitRegex(loc, \"{2,4}\"),\n    fourToSix = digitRegex(loc, \"{4,6}\"),\n    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),\n    unitate = (t) => {\n      if (token.literal) {\n        return literal(t);\n      }\n      switch (t.val) {\n        // era\n        case \"G\":\n          return oneOf(loc.eras(\"short\"), 0);\n        case \"GG\":\n          return oneOf(loc.eras(\"long\"), 0);\n        // years\n        case \"y\":\n          return intUnit(oneToSix);\n        case \"yy\":\n          return intUnit(twoToFour, untruncateYear);\n        case \"yyyy\":\n          return intUnit(four);\n        case \"yyyyy\":\n          return intUnit(fourToSix);\n        case \"yyyyyy\":\n          return intUnit(six);\n        // months\n        case \"M\":\n          return intUnit(oneOrTwo);\n        case \"MM\":\n          return intUnit(two);\n        case \"MMM\":\n          return oneOf(loc.months(\"short\", true), 1);\n        case \"MMMM\":\n          return oneOf(loc.months(\"long\", true), 1);\n        case \"L\":\n          return intUnit(oneOrTwo);\n        case \"LL\":\n          return intUnit(two);\n        case \"LLL\":\n          return oneOf(loc.months(\"short\", false), 1);\n        case \"LLLL\":\n          return oneOf(loc.months(\"long\", false), 1);\n        // dates\n        case \"d\":\n          return intUnit(oneOrTwo);\n        case \"dd\":\n          return intUnit(two);\n        // ordinals\n        case \"o\":\n          return intUnit(oneToThree);\n        case \"ooo\":\n          return intUnit(three);\n        // time\n        case \"HH\":\n          return intUnit(two);\n        case \"H\":\n          return intUnit(oneOrTwo);\n        case \"hh\":\n          return intUnit(two);\n        case \"h\":\n          return intUnit(oneOrTwo);\n        case \"mm\":\n          return intUnit(two);\n        case \"m\":\n          return intUnit(oneOrTwo);\n        case \"q\":\n          return intUnit(oneOrTwo);\n        case \"qq\":\n          return intUnit(two);\n        case \"s\":\n          return intUnit(oneOrTwo);\n        case \"ss\":\n          return intUnit(two);\n        case \"S\":\n          return intUnit(oneToThree);\n        case \"SSS\":\n          return intUnit(three);\n        case \"u\":\n          return simple(oneToNine);\n        case \"uu\":\n          return simple(oneOrTwo);\n        case \"uuu\":\n          return intUnit(one);\n        // meridiem\n        case \"a\":\n          return oneOf(loc.meridiems(), 0);\n        // weekYear (k)\n        case \"kkkk\":\n          return intUnit(four);\n        case \"kk\":\n          return intUnit(twoToFour, untruncateYear);\n        // weekNumber (W)\n        case \"W\":\n          return intUnit(oneOrTwo);\n        case \"WW\":\n          return intUnit(two);\n        // weekdays\n        case \"E\":\n        case \"c\":\n          return intUnit(one);\n        case \"EEE\":\n          return oneOf(loc.weekdays(\"short\", false), 1);\n        case \"EEEE\":\n          return oneOf(loc.weekdays(\"long\", false), 1);\n        case \"ccc\":\n          return oneOf(loc.weekdays(\"short\", true), 1);\n        case \"cccc\":\n          return oneOf(loc.weekdays(\"long\", true), 1);\n        // offset/zone\n        case \"Z\":\n        case \"ZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);\n        case \"ZZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);\n        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing\n        // because we don't have any way to figure out what they are\n        case \"z\":\n          return simple(/[a-z_+-/]{1,256}?/i);\n        // this special-case \"token\" represents a place where a macro-token expanded into a white-space literal\n        // in this case we accept any non-newline white-space\n        case \" \":\n          return simple(/[^\\S\\n\\r]/);\n        default:\n          return literal(t);\n      }\n    };\n\n  const unit = unitate(token) || {\n    invalidReason: MISSING_FTP,\n  };\n\n  unit.token = token;\n\n  return unit;\n}\n\nconst partTypeStyleToTokenVal = {\n  year: {\n    \"2-digit\": \"yy\",\n    numeric: \"yyyyy\",\n  },\n  month: {\n    numeric: \"M\",\n    \"2-digit\": \"MM\",\n    short: \"MMM\",\n    long: \"MMMM\",\n  },\n  day: {\n    numeric: \"d\",\n    \"2-digit\": \"dd\",\n  },\n  weekday: {\n    short: \"EEE\",\n    long: \"EEEE\",\n  },\n  dayperiod: \"a\",\n  dayPeriod: \"a\",\n  hour12: {\n    numeric: \"h\",\n    \"2-digit\": \"hh\",\n  },\n  hour24: {\n    numeric: \"H\",\n    \"2-digit\": \"HH\",\n  },\n  minute: {\n    numeric: \"m\",\n    \"2-digit\": \"mm\",\n  },\n  second: {\n    numeric: \"s\",\n    \"2-digit\": \"ss\",\n  },\n  timeZoneName: {\n    long: \"ZZZZZ\",\n    short: \"ZZZ\",\n  },\n};\n\nfunction tokenForPart(part, formatOpts, resolvedOpts) {\n  const { type, value } = part;\n\n  if (type === \"literal\") {\n    const isSpace = /^\\s+$/.test(value);\n    return {\n      literal: !isSpace,\n      val: isSpace ? \" \" : value,\n    };\n  }\n\n  const style = formatOpts[type];\n\n  // The user might have explicitly specified hour12 or hourCycle\n  // if so, respect their decision\n  // if not, refer back to the resolvedOpts, which are based on the locale\n  let actualType = type;\n  if (type === \"hour\") {\n    if (formatOpts.hour12 != null) {\n      actualType = formatOpts.hour12 ? \"hour12\" : \"hour24\";\n    } else if (formatOpts.hourCycle != null) {\n      if (formatOpts.hourCycle === \"h11\" || formatOpts.hourCycle === \"h12\") {\n        actualType = \"hour12\";\n      } else {\n        actualType = \"hour24\";\n      }\n    } else {\n      // tokens only differentiate between 24 hours or not,\n      // so we do not need to check hourCycle here, which is less supported anyways\n      actualType = resolvedOpts.hour12 ? \"hour12\" : \"hour24\";\n    }\n  }\n  let val = partTypeStyleToTokenVal[actualType];\n  if (typeof val === \"object\") {\n    val = val[style];\n  }\n\n  if (val) {\n    return {\n      literal: false,\n      val,\n    };\n  }\n\n  return undefined;\n}\n\nfunction buildRegex(units) {\n  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, \"\");\n  return [`^${re}$`, units];\n}\n\nfunction match(input, regex, handlers) {\n  const matches = input.match(regex);\n\n  if (matches) {\n    const all = {};\n    let matchIndex = 1;\n    for (const i in handlers) {\n      if (hasOwnProperty(handlers, i)) {\n        const h = handlers[i],\n          groups = h.groups ? h.groups + 1 : 1;\n        if (!h.literal && h.token) {\n          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));\n        }\n        matchIndex += groups;\n      }\n    }\n    return [matches, all];\n  } else {\n    return [matches, {}];\n  }\n}\n\nfunction dateTimeFromMatches(matches) {\n  const toField = (token) => {\n    switch (token) {\n      case \"S\":\n        return \"millisecond\";\n      case \"s\":\n        return \"second\";\n      case \"m\":\n        return \"minute\";\n      case \"h\":\n      case \"H\":\n        return \"hour\";\n      case \"d\":\n        return \"day\";\n      case \"o\":\n        return \"ordinal\";\n      case \"L\":\n      case \"M\":\n        return \"month\";\n      case \"y\":\n        return \"year\";\n      case \"E\":\n      case \"c\":\n        return \"weekday\";\n      case \"W\":\n        return \"weekNumber\";\n      case \"k\":\n        return \"weekYear\";\n      case \"q\":\n        return \"quarter\";\n      default:\n        return null;\n    }\n  };\n\n  let zone = null;\n  let specificOffset;\n  if (!isUndefined(matches.z)) {\n    zone = IANAZone.create(matches.z);\n  }\n\n  if (!isUndefined(matches.Z)) {\n    if (!zone) {\n      zone = new FixedOffsetZone(matches.Z);\n    }\n    specificOffset = matches.Z;\n  }\n\n  if (!isUndefined(matches.q)) {\n    matches.M = (matches.q - 1) * 3 + 1;\n  }\n\n  if (!isUndefined(matches.h)) {\n    if (matches.h < 12 && matches.a === 1) {\n      matches.h += 12;\n    } else if (matches.h === 12 && matches.a === 0) {\n      matches.h = 0;\n    }\n  }\n\n  if (matches.G === 0 && matches.y) {\n    matches.y = -matches.y;\n  }\n\n  if (!isUndefined(matches.u)) {\n    matches.S = parseMillis(matches.u);\n  }\n\n  const vals = Object.keys(matches).reduce((r, k) => {\n    const f = toField(k);\n    if (f) {\n      r[f] = matches[k];\n    }\n\n    return r;\n  }, {});\n\n  return [vals, zone, specificOffset];\n}\n\nlet dummyDateTimeCache = null;\n\nfunction getDummyDateTime() {\n  if (!dummyDateTimeCache) {\n    dummyDateTimeCache = DateTime.fromMillis(1555555555555);\n  }\n\n  return dummyDateTimeCache;\n}\n\nfunction maybeExpandMacroToken(token, locale) {\n  if (token.literal) {\n    return token;\n  }\n\n  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);\n  const tokens = formatOptsToTokens(formatOpts, locale);\n\n  if (tokens == null || tokens.includes(undefined)) {\n    return token;\n  }\n\n  return tokens;\n}\n\nexport function expandMacroTokens(tokens, locale) {\n  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));\n}\n\n/**\n * @private\n */\n\nexport class TokenParser {\n  constructor(locale, format) {\n    this.locale = locale;\n    this.format = format;\n    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);\n    this.units = this.tokens.map((t) => unitForToken(t, locale));\n    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);\n\n    if (!this.disqualifyingUnit) {\n      const [regexString, handlers] = buildRegex(this.units);\n      this.regex = RegExp(regexString, \"i\");\n      this.handlers = handlers;\n    }\n  }\n\n  explainFromTokens(input) {\n    if (!this.isValid) {\n      return { input, tokens: this.tokens, invalidReason: this.invalidReason };\n    } else {\n      const [rawMatches, matches] = match(input, this.regex, this.handlers),\n        [result, zone, specificOffset] = matches\n          ? dateTimeFromMatches(matches)\n          : [null, null, undefined];\n      if (hasOwnProperty(matches, \"a\") && hasOwnProperty(matches, \"H\")) {\n        throw new ConflictingSpecificationError(\n          \"Can't include meridiem when specifying 24-hour format\"\n        );\n      }\n      return {\n        input,\n        tokens: this.tokens,\n        regex: this.regex,\n        rawMatches,\n        matches,\n        result,\n        zone,\n        specificOffset,\n      };\n    }\n  }\n\n  get isValid() {\n    return !this.disqualifyingUnit;\n  }\n\n  get invalidReason() {\n    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;\n  }\n}\n\nexport function explainFromTokens(locale, input, format) {\n  const parser = new TokenParser(locale, format);\n  return parser.explainFromTokens(input);\n}\n\nexport function parseFromTokens(locale, input, format) {\n  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);\n  return [result, zone, specificOffset, invalidReason];\n}\n\nexport function formatOptsToTokens(formatOpts, locale) {\n  if (!formatOpts) {\n    return null;\n  }\n\n  const formatter = Formatter.create(locale, formatOpts);\n  const df = formatter.dtFormatter(getDummyDateTime());\n  const parts = df.formatToParts();\n  const resolvedOpts = df.resolvedOptions();\n  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));\n}\n","import Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Settings from \"./settings.js\";\nimport Info from \"./info.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport {\n  isUndefined,\n  maybeArray,\n  isDate,\n  isNumber,\n  bestBy,\n  daysInMonth,\n  daysInYear,\n  isLeapYear,\n  weeksInWeekYear,\n  normalizeObject,\n  roundTo,\n  objToLocalTS,\n  padStart,\n} from \"./impl/util.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport diff from \"./impl/diff.js\";\nimport { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from \"./impl/regexParser.js\";\nimport {\n  parseFromTokens,\n  explainFromTokens,\n  formatOptsToTokens,\n  expandMacroTokens,\n  TokenParser,\n} from \"./impl/tokenParser.js\";\nimport {\n  gregorianToWeek,\n  weekToGregorian,\n  gregorianToOrdinal,\n  ordinalToGregorian,\n  hasInvalidGregorianData,\n  hasInvalidWeekData,\n  hasInvalidOrdinalData,\n  hasInvalidTimeData,\n  usesLocalWeekValues,\n  isoWeekdayToLocal,\n} from \"./impl/conversions.js\";\nimport * as Formats from \"./impl/formats.js\";\nimport {\n  InvalidArgumentError,\n  ConflictingSpecificationError,\n  InvalidUnitError,\n  InvalidDateTimeError,\n} from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\n\nconst INVALID = \"Invalid DateTime\";\nconst MAX_DATE = 8.64e15;\n\nfunction unsupportedZone(zone) {\n  return new Invalid(\"unsupported zone\", `the zone \"${zone.name}\" is not supported`);\n}\n\n// we cache week data on the DT object and this intermediates the cache\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedWeekData(dt) {\n  if (dt.weekData === null) {\n    dt.weekData = gregorianToWeek(dt.c);\n  }\n  return dt.weekData;\n}\n\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedLocalWeekData(dt) {\n  if (dt.localWeekData === null) {\n    dt.localWeekData = gregorianToWeek(\n      dt.c,\n      dt.loc.getMinDaysInFirstWeek(),\n      dt.loc.getStartOfWeek()\n    );\n  }\n  return dt.localWeekData;\n}\n\n// clone really means, \"make a new object with these modifications\". all \"setters\" really use this\n// to create a new object while only changing some of the properties\nfunction clone(inst, alts) {\n  const current = {\n    ts: inst.ts,\n    zone: inst.zone,\n    c: inst.c,\n    o: inst.o,\n    loc: inst.loc,\n    invalid: inst.invalid,\n  };\n  return new DateTime({ ...current, ...alts, old: current });\n}\n\n// find the right offset a given local time. The o input is our guess, which determines which\n// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)\nfunction fixOffset(localTS, o, tz) {\n  // Our UTC time is just a guess because our offset is just a guess\n  let utcGuess = localTS - o * 60 * 1000;\n\n  // Test whether the zone matches the offset for this ts\n  const o2 = tz.offset(utcGuess);\n\n  // If so, offset didn't change and we're done\n  if (o === o2) {\n    return [utcGuess, o];\n  }\n\n  // If not, change the ts by the difference in the offset\n  utcGuess -= (o2 - o) * 60 * 1000;\n\n  // If that gives us the local time we want, we're done\n  const o3 = tz.offset(utcGuess);\n  if (o2 === o3) {\n    return [utcGuess, o2];\n  }\n\n  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time\n  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];\n}\n\n// convert an epoch timestamp into a calendar object with the given offset\nfunction tsToObj(ts, offset) {\n  ts += offset * 60 * 1000;\n\n  const d = new Date(ts);\n\n  return {\n    year: d.getUTCFullYear(),\n    month: d.getUTCMonth() + 1,\n    day: d.getUTCDate(),\n    hour: d.getUTCHours(),\n    minute: d.getUTCMinutes(),\n    second: d.getUTCSeconds(),\n    millisecond: d.getUTCMilliseconds(),\n  };\n}\n\n// convert a calendar object to a epoch timestamp\nfunction objToTS(obj, offset, zone) {\n  return fixOffset(objToLocalTS(obj), offset, zone);\n}\n\n// create a new DT instance by adding a duration, adjusting for DSTs\nfunction adjustTime(inst, dur) {\n  const oPre = inst.o,\n    year = inst.c.year + Math.trunc(dur.years),\n    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,\n    c = {\n      ...inst.c,\n      year,\n      month,\n      day:\n        Math.min(inst.c.day, daysInMonth(year, month)) +\n        Math.trunc(dur.days) +\n        Math.trunc(dur.weeks) * 7,\n    },\n    millisToAdd = Duration.fromObject({\n      years: dur.years - Math.trunc(dur.years),\n      quarters: dur.quarters - Math.trunc(dur.quarters),\n      months: dur.months - Math.trunc(dur.months),\n      weeks: dur.weeks - Math.trunc(dur.weeks),\n      days: dur.days - Math.trunc(dur.days),\n      hours: dur.hours,\n      minutes: dur.minutes,\n      seconds: dur.seconds,\n      milliseconds: dur.milliseconds,\n    }).as(\"milliseconds\"),\n    localTS = objToLocalTS(c);\n\n  let [ts, o] = fixOffset(localTS, oPre, inst.zone);\n\n  if (millisToAdd !== 0) {\n    ts += millisToAdd;\n    // that could have changed the offset by going over a DST, but we want to keep the ts the same\n    o = inst.zone.offset(ts);\n  }\n\n  return { ts, o };\n}\n\n// helper useful in turning the results of parsing into real dates\n// by handling the zone options\nfunction parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {\n  const { setZone, zone } = opts;\n  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {\n    const interpretationZone = parsedZone || zone,\n      inst = DateTime.fromObject(parsed, {\n        ...opts,\n        zone: interpretationZone,\n        specificOffset,\n      });\n    return setZone ? inst : inst.setZone(zone);\n  } else {\n    return DateTime.invalid(\n      new Invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ${format}`)\n    );\n  }\n}\n\n// if you want to output a technical format (e.g. RFC 2822), this helper\n// helps handle the details\nfunction toTechFormat(dt, format, allowZ = true) {\n  return dt.isValid\n    ? Formatter.create(Locale.create(\"en-US\"), {\n        allowZ,\n        forceSimple: true,\n      }).formatDateTimeFromString(dt, format)\n    : null;\n}\n\nfunction toISODate(o, extended, precision) {\n  const longFormat = o.c.year > 9999 || o.c.year < 0;\n  let c = \"\";\n  if (longFormat && o.c.year >= 0) c += \"+\";\n  c += padStart(o.c.year, longFormat ? 6 : 4);\n  if (precision === \"year\") return c;\n  if (extended) {\n    c += \"-\";\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n    c += \"-\";\n  } else {\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n  }\n  c += padStart(o.c.day);\n  return c;\n}\n\nfunction toISOTime(\n  o,\n  extended,\n  suppressSeconds,\n  suppressMilliseconds,\n  includeOffset,\n  extendedZone,\n  precision\n) {\n  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,\n    c = \"\";\n  switch (precision) {\n    case \"day\":\n    case \"month\":\n    case \"year\":\n      break;\n    default:\n      c += padStart(o.c.hour);\n      if (precision === \"hour\") break;\n      if (extended) {\n        c += \":\";\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += \":\";\n          c += padStart(o.c.second);\n        }\n      } else {\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += padStart(o.c.second);\n        }\n      }\n      if (precision === \"second\") break;\n      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {\n        c += \".\";\n        c += padStart(o.c.millisecond, 3);\n      }\n  }\n\n  if (includeOffset) {\n    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {\n      c += \"Z\";\n    } else if (o.o < 0) {\n      c += \"-\";\n      c += padStart(Math.trunc(-o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(-o.o % 60));\n    } else {\n      c += \"+\";\n      c += padStart(Math.trunc(o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(o.o % 60));\n    }\n  }\n\n  if (extendedZone) {\n    c += \"[\" + o.zone.ianaName + \"]\";\n  }\n  return c;\n}\n\n// defaults for unspecified units in the supported calendars\nconst defaultUnitValues = {\n    month: 1,\n    day: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultWeekUnitValues = {\n    weekNumber: 1,\n    weekday: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultOrdinalUnitValues = {\n    ordinal: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  };\n\n// Units in the supported calendars, sorted by bigness\nconst orderedUnits = [\"year\", \"month\", \"day\", \"hour\", \"minute\", \"second\", \"millisecond\"],\n  orderedWeekUnits = [\n    \"weekYear\",\n    \"weekNumber\",\n    \"weekday\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"millisecond\",\n  ],\n  orderedOrdinalUnits = [\"year\", \"ordinal\", \"hour\", \"minute\", \"second\", \"millisecond\"];\n\n// standardize case and plurality in units\nfunction normalizeUnit(unit) {\n  const normalized = {\n    year: \"year\",\n    years: \"year\",\n    month: \"month\",\n    months: \"month\",\n    day: \"day\",\n    days: \"day\",\n    hour: \"hour\",\n    hours: \"hour\",\n    minute: \"minute\",\n    minutes: \"minute\",\n    quarter: \"quarter\",\n    quarters: \"quarter\",\n    second: \"second\",\n    seconds: \"second\",\n    millisecond: \"millisecond\",\n    milliseconds: \"millisecond\",\n    weekday: \"weekday\",\n    weekdays: \"weekday\",\n    weeknumber: \"weekNumber\",\n    weeksnumber: \"weekNumber\",\n    weeknumbers: \"weekNumber\",\n    weekyear: \"weekYear\",\n    weekyears: \"weekYear\",\n    ordinal: \"ordinal\",\n  }[unit.toLowerCase()];\n\n  if (!normalized) throw new InvalidUnitError(unit);\n\n  return normalized;\n}\n\nfunction normalizeUnitWithLocalWeeks(unit) {\n  switch (unit.toLowerCase()) {\n    case \"localweekday\":\n    case \"localweekdays\":\n      return \"localWeekday\";\n    case \"localweeknumber\":\n    case \"localweeknumbers\":\n      return \"localWeekNumber\";\n    case \"localweekyear\":\n    case \"localweekyears\":\n      return \"localWeekYear\";\n    default:\n      return normalizeUnit(unit);\n  }\n}\n\n// cache offsets for zones based on the current timestamp when this function is\n// first called. When we are handling a datetime from components like (year,\n// month, day, hour) in a time zone, we need a guess about what the timezone\n// offset is so that we can convert into a UTC timestamp. One way is to find the\n// offset of now in the zone. The actual date may have a different offset (for\n// example, if we handle a date in June while we're in December in a zone that\n// observes DST), but we can check and adjust that.\n//\n// When handling many dates, calculating the offset for now every time is\n// expensive. It's just a guess, so we can cache the offset to use even if we\n// are right on a time change boundary (we'll just correct in the other\n// direction). Using a timestamp from first read is a slight optimization for\n// handling dates close to the current date, since those dates will usually be\n// in the same offset (we could set the timestamp statically, instead). We use a\n// single timestamp for all zones to make things a bit more predictable.\n//\n// This is safe for quickDT (used by local() and utc()) because we don't fill in\n// higher-order units from tsNow (as we do in fromObject, this requires that\n// offset is calculated from tsNow).\n/**\n * @param {Zone} zone\n * @return {number}\n */\nfunction guessOffsetForZone(zone) {\n  if (zoneOffsetTs === undefined) {\n    zoneOffsetTs = Settings.now();\n  }\n\n  // Do not cache anything but IANA zones, because it is not safe to do so.\n  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset\n  if (zone.type !== \"iana\") {\n    return zone.offset(zoneOffsetTs);\n  }\n  const zoneName = zone.name;\n  let offsetGuess = zoneOffsetGuessCache.get(zoneName);\n  if (offsetGuess === undefined) {\n    offsetGuess = zone.offset(zoneOffsetTs);\n    zoneOffsetGuessCache.set(zoneName, offsetGuess);\n  }\n  return offsetGuess;\n}\n\n// this is a dumbed down version of fromObject() that runs about 60% faster\n// but doesn't do any validation, makes a bunch of assumptions about what units\n// are present, and so on.\nfunction quickDT(obj, opts) {\n  const zone = normalizeZone(opts.zone, Settings.defaultZone);\n  if (!zone.isValid) {\n    return DateTime.invalid(unsupportedZone(zone));\n  }\n\n  const loc = Locale.fromObject(opts);\n\n  let ts, o;\n\n  // assume we have the higher-order units\n  if (!isUndefined(obj.year)) {\n    for (const u of orderedUnits) {\n      if (isUndefined(obj[u])) {\n        obj[u] = defaultUnitValues[u];\n      }\n    }\n\n    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    const offsetProvis = guessOffsetForZone(zone);\n    [ts, o] = objToTS(obj, offsetProvis, zone);\n  } else {\n    ts = Settings.now();\n  }\n\n  return new DateTime({ ts, zone, loc, o });\n}\n\nfunction diffRelative(start, end, opts) {\n  const round = isUndefined(opts.round) ? true : opts.round,\n    rounding = isUndefined(opts.rounding) ? \"trunc\" : opts.rounding,\n    format = (c, unit) => {\n      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? \"round\" : rounding);\n      const formatter = end.loc.clone(opts).relFormatter(opts);\n      return formatter.format(c, unit);\n    },\n    differ = (unit) => {\n      if (opts.calendary) {\n        if (!end.hasSame(start, unit)) {\n          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);\n        } else return 0;\n      } else {\n        return end.diff(start, unit).get(unit);\n      }\n    };\n\n  if (opts.unit) {\n    return format(differ(opts.unit), opts.unit);\n  }\n\n  for (const unit of opts.units) {\n    const count = differ(unit);\n    if (Math.abs(count) >= 1) {\n      return format(count, unit);\n    }\n  }\n  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);\n}\n\nfunction lastOpts(argList) {\n  let opts = {},\n    args;\n  if (argList.length > 0 && typeof argList[argList.length - 1] === \"object\") {\n    opts = argList[argList.length - 1];\n    args = Array.from(argList).slice(0, argList.length - 1);\n  } else {\n    args = Array.from(argList);\n  }\n  return [opts, args];\n}\n\n/**\n * Timestamp to use for cached zone offset guesses (exposed for test)\n */\nlet zoneOffsetTs;\n/**\n * Cache for zone offset guesses (exposed for test).\n *\n * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of\n * zone.offset().\n */\nconst zoneOffsetGuessCache = new Map();\n\n/**\n * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.\n *\n * A DateTime comprises of:\n * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.\n * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).\n * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.\n *\n * Here is a brief overview of the most commonly used functionality it provides:\n *\n * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.\n * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},\n * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.\n * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.\n * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.\n * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.\n * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.\n *\n * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.\n */\nexport default class DateTime {\n  /**\n   * @access private\n   */\n  constructor(config) {\n    const zone = config.zone || Settings.defaultZone;\n\n    let invalid =\n      config.invalid ||\n      (Number.isNaN(config.ts) ? new Invalid(\"invalid input\") : null) ||\n      (!zone.isValid ? unsupportedZone(zone) : null);\n    /**\n     * @access private\n     */\n    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;\n\n    let c = null,\n      o = null;\n    if (!invalid) {\n      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);\n\n      if (unchanged) {\n        [c, o] = [config.old.c, config.old.o];\n      } else {\n        // If an offset has been passed and we have not been called from\n        // clone(), we can trust it and avoid the offset calculation.\n        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);\n        c = tsToObj(this.ts, ot);\n        invalid = Number.isNaN(c.year) ? new Invalid(\"invalid input\") : null;\n        c = invalid ? null : c;\n        o = invalid ? null : ot;\n      }\n    }\n\n    /**\n     * @access private\n     */\n    this._zone = zone;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.invalid = invalid;\n    /**\n     * @access private\n     */\n    this.weekData = null;\n    /**\n     * @access private\n     */\n    this.localWeekData = null;\n    /**\n     * @access private\n     */\n    this.c = c;\n    /**\n     * @access private\n     */\n    this.o = o;\n    /**\n     * @access private\n     */\n    this.isLuxonDateTime = true;\n  }\n\n  // CONSTRUCT\n\n  /**\n   * Create a DateTime for the current instant, in the system's time zone.\n   *\n   * Use Settings to override these default values if needed.\n   * @example DateTime.now().toISO() //~> now in the ISO format\n   * @return {DateTime}\n   */\n  static now() {\n    return new DateTime({});\n  }\n\n  /**\n   * Create a local DateTime\n   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month, 1-indexed\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @example DateTime.local()                                  //~> now\n   * @example DateTime.local({ zone: \"America/New_York\" })      //~> now, in US east coast time\n   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00\n   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00\n   * @example DateTime.local(2017, 3, 12, { locale: \"fr\" })     //~> 2017-03-12T00:00:00, with a French locale\n   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00\n   * @example DateTime.local(2017, 3, 12, 5, { zone: \"utc\" })   //~> 2017-03-12T05:00:00, in UTC\n   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765\n   * @return {DateTime}\n   */\n  static local() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime in UTC\n   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.utc()                                              //~> now\n   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z\n   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: \"fr\" })          //~> 2017-03-12T05:45:00Z with a French locale\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: \"fr\" }) //~> 2017-03-12T05:45:10.765Z with a French locale\n   * @return {DateTime}\n   */\n  static utc() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n\n    opts.zone = FixedOffsetZone.utcInstance;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime from a JavaScript Date object. Uses the default zone.\n   * @param {Date} date - a JavaScript Date object\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @return {DateTime}\n   */\n  static fromJSDate(date, options = {}) {\n    const ts = isDate(date) ? date.valueOf() : NaN;\n    if (Number.isNaN(ts)) {\n      return DateTime.invalid(\"invalid input\");\n    }\n\n    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    return new DateTime({\n      ts: ts,\n      zone: zoneToUse,\n      loc: Locale.fromObject(options),\n    });\n  }\n\n  /**\n   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} milliseconds - a number of milliseconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromMillis(milliseconds, options = {}) {\n    if (!isNumber(milliseconds)) {\n      throw new InvalidArgumentError(\n        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`\n      );\n    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {\n      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start\n      return DateTime.invalid(\"Timestamp out of range\");\n    } else {\n      return new DateTime({\n        ts: milliseconds,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} seconds - a number of seconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromSeconds(seconds, options = {}) {\n    if (!isNumber(seconds)) {\n      throw new InvalidArgumentError(\"fromSeconds requires a numerical input\");\n    } else {\n      return new DateTime({\n        ts: seconds * 1000,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.year - a year, such as 1987\n   * @param {number} obj.month - a month, 1-12\n   * @param {number} obj.day - a day of the month, 1-31, depending on the month\n   * @param {number} obj.ordinal - day of the year, 1-365 or 366\n   * @param {number} obj.weekYear - an ISO week year\n   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year\n   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday\n   * @param {number} obj.localWeekYear - a week year, according to the locale\n   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale\n   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale\n   * @param {number} obj.hour - hour of the day, 0-23\n   * @param {number} obj.minute - minute of the hour, 0-59\n   * @param {number} obj.second - second of the minute, 0-59\n   * @param {number} obj.millisecond - millisecond of the second, 0-999\n   * @param {Object} opts - options for creating this DateTime\n   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()\n   * @param {string} [opts.locale='system\\'s locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'\n   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })\n   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'\n   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: \"en-US\" }).toISODate() //=> '2021-12-26'\n   * @return {DateTime}\n   */\n  static fromObject(obj, opts = {}) {\n    obj = obj || {};\n    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    const loc = Locale.fromObject(opts);\n    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);\n\n    const tsNow = Settings.now(),\n      offsetProvis = !isUndefined(opts.specificOffset)\n        ? opts.specificOffset\n        : zoneToUse.offset(tsNow),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    // cases:\n    // just a weekday -> this week's instance of that weekday, no worries\n    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error\n    // (gregorian month or day) + ordinal -> error\n    // otherwise just use weeks or ordinals or gregorian, depending on what's specified\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);\n\n    // configure ourselves to deal with gregorian dates or week stuff\n    let units,\n      defaultValues,\n      objNow = tsToObj(tsNow, offsetProvis);\n    if (useWeekData) {\n      units = orderedWeekUnits;\n      defaultValues = defaultWeekUnitValues;\n      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);\n    } else if (containsOrdinal) {\n      units = orderedOrdinalUnits;\n      defaultValues = defaultOrdinalUnitValues;\n      objNow = gregorianToOrdinal(objNow);\n    } else {\n      units = orderedUnits;\n      defaultValues = defaultUnitValues;\n    }\n\n    // set default values for missing stuff\n    let foundFirst = false;\n    for (const u of units) {\n      const v = normalized[u];\n      if (!isUndefined(v)) {\n        foundFirst = true;\n      } else if (foundFirst) {\n        normalized[u] = defaultValues[u];\n      } else {\n        normalized[u] = objNow[u];\n      }\n    }\n\n    // make sure the values we have are in range\n    const higherOrderInvalid = useWeekData\n        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? hasInvalidOrdinalData(normalized)\n        : hasInvalidGregorianData(normalized),\n      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);\n\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    // compute the actual time\n    const gregorian = useWeekData\n        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? ordinalToGregorian(normalized)\n        : normalized,\n      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),\n      inst = new DateTime({\n        ts: tsFinal,\n        zone: zoneToUse,\n        o: offsetFinal,\n        loc,\n      });\n\n    // gregorian data + weekday serves only to validate\n    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {\n      return DateTime.invalid(\n        \"mismatched weekday\",\n        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`\n      );\n    }\n\n    if (!inst.isValid) {\n      return DateTime.invalid(inst.invalid);\n    }\n\n    return inst;\n  }\n\n  /**\n   * Create a DateTime from an ISO 8601 string\n   * @param {string} text - the ISO string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})\n   * @example DateTime.fromISO('2016-W05-4')\n   * @return {DateTime}\n   */\n  static fromISO(text, opts = {}) {\n    const [vals, parsedZone] = parseISODate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"ISO 8601\", text);\n  }\n\n  /**\n   * Create a DateTime from an RFC 2822 string\n   * @param {string} text - the RFC 2822 string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')\n   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')\n   * @return {DateTime}\n   */\n  static fromRFC2822(text, opts = {}) {\n    const [vals, parsedZone] = parseRFC2822Date(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"RFC 2822\", text);\n  }\n\n  /**\n   * Create a DateTime from an HTTP header date\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @param {string} text - the HTTP header date\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')\n   * @return {DateTime}\n   */\n  static fromHTTP(text, opts = {}) {\n    const [vals, parsedZone] = parseHTTPDate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"HTTP\", opts);\n  }\n\n  /**\n   * Create a DateTime from an input string and format string.\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromFormat(text, fmt, opts = {}) {\n    if (isUndefined(text) || isUndefined(fmt)) {\n      throw new InvalidArgumentError(\"fromFormat requires an input string and a format\");\n    }\n\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      }),\n      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    } else {\n      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);\n    }\n  }\n\n  /**\n   * @deprecated use fromFormat instead\n   */\n  static fromString(text, fmt, opts = {}) {\n    return DateTime.fromFormat(text, fmt, opts);\n  }\n\n  /**\n   * Create a DateTime from a SQL date, time, or datetime\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale\n   * @param {string} text - the string to parse\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @example DateTime.fromSQL('2017-05-15')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })\n   * @example DateTime.fromSQL('09:12:34.342')\n   * @return {DateTime}\n   */\n  static fromSQL(text, opts = {}) {\n    const [vals, parsedZone] = parseSQL(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"SQL\", text);\n  }\n\n  /**\n   * Create an invalid DateTime.\n   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {DateTime}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the DateTime is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDateTimeError(invalid);\n    } else {\n      return new DateTime({ invalid });\n    }\n  }\n\n  /**\n   * Check if an object is an instance of DateTime. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDateTime(o) {\n    return (o && o.isLuxonDateTime) || false;\n  }\n\n  /**\n   * Produce the format string for a set of options\n   * @param formatOpts\n   * @param localeOpts\n   * @returns {string}\n   */\n  static parseFormatForOpts(formatOpts, localeOpts = {}) {\n    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));\n    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join(\"\");\n  }\n\n  /**\n   * Produce the the fully expanded format token for the locale\n   * Does NOT quote characters, so quoted tokens will not round trip correctly\n   * @param fmt\n   * @param localeOpts\n   * @returns {string}\n   */\n  static expandFormat(fmt, localeOpts = {}) {\n    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));\n    return expanded.map((t) => t.val).join(\"\");\n  }\n\n  static resetCache() {\n    zoneOffsetTs = undefined;\n    zoneOffsetGuessCache.clear();\n  }\n\n  // INFO\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7\n   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4\n   * @return {number}\n   */\n  get(unit) {\n    return this[unit];\n  }\n\n  /**\n   * Returns whether the DateTime is valid. Invalid DateTimes occur when:\n   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30\n   * * The DateTime was created by an operation on another invalid date\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get outputCalendar() {\n    return this.isValid ? this.loc.outputCalendar : null;\n  }\n\n  /**\n   * Get the time zone associated with this DateTime.\n   * @type {Zone}\n   */\n  get zone() {\n    return this._zone;\n  }\n\n  /**\n   * Get the name of the time zone.\n   * @type {string}\n   */\n  get zoneName() {\n    return this.isValid ? this.zone.name : null;\n  }\n\n  /**\n   * Get the year\n   * @example DateTime.local(2017, 5, 25).year //=> 2017\n   * @type {number}\n   */\n  get year() {\n    return this.isValid ? this.c.year : NaN;\n  }\n\n  /**\n   * Get the quarter\n   * @example DateTime.local(2017, 5, 25).quarter //=> 2\n   * @type {number}\n   */\n  get quarter() {\n    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;\n  }\n\n  /**\n   * Get the month (1-12).\n   * @example DateTime.local(2017, 5, 25).month //=> 5\n   * @type {number}\n   */\n  get month() {\n    return this.isValid ? this.c.month : NaN;\n  }\n\n  /**\n   * Get the day of the month (1-30ish).\n   * @example DateTime.local(2017, 5, 25).day //=> 25\n   * @type {number}\n   */\n  get day() {\n    return this.isValid ? this.c.day : NaN;\n  }\n\n  /**\n   * Get the hour of the day (0-23).\n   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9\n   * @type {number}\n   */\n  get hour() {\n    return this.isValid ? this.c.hour : NaN;\n  }\n\n  /**\n   * Get the minute of the hour (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30\n   * @type {number}\n   */\n  get minute() {\n    return this.isValid ? this.c.minute : NaN;\n  }\n\n  /**\n   * Get the second of the minute (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52\n   * @type {number}\n   */\n  get second() {\n    return this.isValid ? this.c.second : NaN;\n  }\n\n  /**\n   * Get the millisecond of the second (0-999).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654\n   * @type {number}\n   */\n  get millisecond() {\n    return this.isValid ? this.c.millisecond : NaN;\n  }\n\n  /**\n   * Get the week year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015\n   * @type {number}\n   */\n  get weekYear() {\n    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the week number of the week year (1-52ish).\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21\n   * @type {number}\n   */\n  get weekNumber() {\n    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the day of the week.\n   * 1 is Monday and 7 is Sunday\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 11, 31).weekday //=> 4\n   * @type {number}\n   */\n  get weekday() {\n    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Returns true if this date is on a weekend according to the locale, false otherwise\n   * @returns {boolean}\n   */\n  get isWeekend() {\n    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);\n  }\n\n  /**\n   * Get the day of the week according to the locale.\n   * 1 is the first day of the week and 7 is the last day of the week.\n   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,\n   * @returns {number}\n   */\n  get localWeekday() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,\n   * because the week can start on different days of the week (see localWeekday) and because a different number of days\n   * is required for a week to count as the first week of a year.\n   * @returns {number}\n   */\n  get localWeekNumber() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)\n   * differently, see localWeekNumber.\n   * @returns {number}\n   */\n  get localWeekYear() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the ordinal (meaning the day of the year)\n   * @example DateTime.local(2017, 5, 25).ordinal //=> 145\n   * @type {number|DateTime}\n   */\n  get ordinal() {\n    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;\n  }\n\n  /**\n   * Get the human readable short month name, such as 'Oct'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct\n   * @type {string}\n   */\n  get monthShort() {\n    return this.isValid ? Info.months(\"short\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable long month name, such as 'October'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthLong //=> October\n   * @type {string}\n   */\n  get monthLong() {\n    return this.isValid ? Info.months(\"long\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable short weekday, such as 'Mon'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon\n   * @type {string}\n   */\n  get weekdayShort() {\n    return this.isValid ? Info.weekdays(\"short\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the human readable long weekday, such as 'Monday'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday\n   * @type {string}\n   */\n  get weekdayLong() {\n    return this.isValid ? Info.weekdays(\"long\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the UTC offset of this DateTime in minutes\n   * @example DateTime.now().offset //=> -240\n   * @example DateTime.utc().offset //=> 0\n   * @type {number}\n   */\n  get offset() {\n    return this.isValid ? +this.o : NaN;\n  }\n\n  /**\n   * Get the short human name for the zone's current offset, for example \"EST\" or \"EDT\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameShort() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"short\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get the long human name for the zone's current offset, for example \"Eastern Standard Time\" or \"Eastern Daylight Time\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameLong() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"long\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get whether this zone's offset ever changes, as in a DST.\n   * @type {boolean}\n   */\n  get isOffsetFixed() {\n    return this.isValid ? this.zone.isUniversal : null;\n  }\n\n  /**\n   * Get whether the DateTime is in a DST.\n   * @type {boolean}\n   */\n  get isInDST() {\n    if (this.isOffsetFixed) {\n      return false;\n    } else {\n      return (\n        this.offset > this.set({ month: 1, day: 1 }).offset ||\n        this.offset > this.set({ month: 5 }).offset\n      );\n    }\n  }\n\n  /**\n   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC\n   * in this DateTime's zone. During DST changes local time can be ambiguous, for example\n   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.\n   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.\n   * @returns {DateTime[]}\n   */\n  getPossibleOffsets() {\n    if (!this.isValid || this.isOffsetFixed) {\n      return [this];\n    }\n    const dayMs = 86400000;\n    const minuteMs = 60000;\n    const localTS = objToLocalTS(this.c);\n    const oEarlier = this.zone.offset(localTS - dayMs);\n    const oLater = this.zone.offset(localTS + dayMs);\n\n    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);\n    const o2 = this.zone.offset(localTS - oLater * minuteMs);\n    if (o1 === o2) {\n      return [this];\n    }\n    const ts1 = localTS - o1 * minuteMs;\n    const ts2 = localTS - o2 * minuteMs;\n    const c1 = tsToObj(ts1, o1);\n    const c2 = tsToObj(ts2, o2);\n    if (\n      c1.hour === c2.hour &&\n      c1.minute === c2.minute &&\n      c1.second === c2.second &&\n      c1.millisecond === c2.millisecond\n    ) {\n      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];\n    }\n    return [this];\n  }\n\n  /**\n   * Returns true if this DateTime is in a leap year, false otherwise\n   * @example DateTime.local(2016).isInLeapYear //=> true\n   * @example DateTime.local(2013).isInLeapYear //=> false\n   * @type {boolean}\n   */\n  get isInLeapYear() {\n    return isLeapYear(this.year);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's month\n   * @example DateTime.local(2016, 2).daysInMonth //=> 29\n   * @example DateTime.local(2016, 3).daysInMonth //=> 31\n   * @type {number}\n   */\n  get daysInMonth() {\n    return daysInMonth(this.year, this.month);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's year\n   * @example DateTime.local(2016).daysInYear //=> 366\n   * @example DateTime.local(2013).daysInYear //=> 365\n   * @type {number}\n   */\n  get daysInYear() {\n    return this.isValid ? daysInYear(this.year) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2004).weeksInWeekYear //=> 53\n   * @example DateTime.local(2013).weeksInWeekYear //=> 52\n   * @type {number}\n   */\n  get weeksInWeekYear() {\n    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's local week year\n   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52\n   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53\n   * @type {number}\n   */\n  get weeksInLocalWeekYear() {\n    return this.isValid\n      ? weeksInWeekYear(\n          this.localWeekYear,\n          this.loc.getMinDaysInFirstWeek(),\n          this.loc.getStartOfWeek()\n        )\n      : NaN;\n  }\n\n  /**\n   * Returns the resolved Intl options for this DateTime.\n   * This is useful in understanding the behavior of formatting methods\n   * @param {Object} opts - the same options as toLocaleString\n   * @return {Object}\n   */\n  resolvedLocaleOptions(opts = {}) {\n    const { locale, numberingSystem, calendar } = Formatter.create(\n      this.loc.clone(opts),\n      opts\n    ).resolvedOptions(this);\n    return { locale, numberingSystem, outputCalendar: calendar };\n  }\n\n  // TRANSFORM\n\n  /**\n   * \"Set\" the DateTime's zone to UTC. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to {@link DateTime#setZone}('utc')\n   * @param {number} [offset=0] - optionally, an offset from UTC in minutes\n   * @param {Object} [opts={}] - options to pass to `setZone()`\n   * @return {DateTime}\n   */\n  toUTC(offset = 0, opts = {}) {\n    return this.setZone(FixedOffsetZone.instance(offset), opts);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to `setZone('local')`\n   * @return {DateTime}\n   */\n  toLocal() {\n    return this.setZone(Settings.defaultZone);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.\n   *\n   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.\n   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.\n   * @return {DateTime}\n   */\n  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {\n    zone = normalizeZone(zone, Settings.defaultZone);\n    if (zone.equals(this.zone)) {\n      return this;\n    } else if (!zone.isValid) {\n      return DateTime.invalid(unsupportedZone(zone));\n    } else {\n      let newTS = this.ts;\n      if (keepLocalTime || keepCalendarTime) {\n        const offsetGuess = zone.offset(this.ts);\n        const asObj = this.toObject();\n        [newTS] = objToTS(asObj, offsetGuess, zone);\n      }\n      return clone(this, { ts: newTS, zone });\n    }\n  }\n\n  /**\n   * \"Set\" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.\n   * @param {Object} properties - the properties to set\n   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })\n   * @return {DateTime}\n   */\n  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });\n    return clone(this, { loc });\n  }\n\n  /**\n   * \"Set\" the locale. Returns a newly-constructed DateTime.\n   * Just a convenient alias for reconfigure({ locale })\n   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')\n   * @return {DateTime}\n   */\n  setLocale(locale) {\n    return this.reconfigure({ locale });\n  }\n\n  /**\n   * \"Set\" the values of specified units. Returns a newly-constructed DateTime.\n   * You can only set units with this method; for \"setting\" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.\n   *\n   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.\n   * They cannot be mixed with ISO-week units like `weekday`.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dt.set({ year: 2017 })\n   * @example dt.set({ hour: 8, minute: 30 })\n   * @example dt.set({ weekday: 5 })\n   * @example dt.set({ year: 2005, ordinal: 234 })\n   * @return {DateTime}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);\n\n    const settingWeekStuff =\n        !isUndefined(normalized.weekYear) ||\n        !isUndefined(normalized.weekNumber) ||\n        !isUndefined(normalized.weekday),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    let mixed;\n    if (settingWeekStuff) {\n      mixed = weekToGregorian(\n        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },\n        minDaysInFirstWeek,\n        startOfWeek\n      );\n    } else if (!isUndefined(normalized.ordinal)) {\n      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });\n    } else {\n      mixed = { ...this.toObject(), ...normalized };\n\n      // if we didn't set the day but we ended up on an overflow date,\n      // use the last day of the right month\n      if (isUndefined(normalized.day)) {\n        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);\n      }\n    }\n\n    const [ts, o] = objToTS(mixed, this.o, this.zone);\n    return clone(this, { ts, o });\n  }\n\n  /**\n   * Add a period of time to this DateTime and return the resulting DateTime\n   *\n   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @example DateTime.now().plus(123) //~> in 123 milliseconds\n   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes\n   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow\n   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday\n   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min\n   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min\n   * @return {DateTime}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration);\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * Subtract a period of time to this DateTime and return the resulting DateTime\n   * See {@link DateTime#plus}\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   @return {DateTime}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration).negate();\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * \"Set\" this DateTime to the beginning of a unit of time.\n   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'\n   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'\n   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'\n   * @return {DateTime}\n   */\n  startOf(unit, { useLocaleWeeks = false } = {}) {\n    if (!this.isValid) return this;\n\n    const o = {},\n      normalizedUnit = Duration.normalizeUnit(unit);\n    switch (normalizedUnit) {\n      case \"years\":\n        o.month = 1;\n      // falls through\n      case \"quarters\":\n      case \"months\":\n        o.day = 1;\n      // falls through\n      case \"weeks\":\n      case \"days\":\n        o.hour = 0;\n      // falls through\n      case \"hours\":\n        o.minute = 0;\n      // falls through\n      case \"minutes\":\n        o.second = 0;\n      // falls through\n      case \"seconds\":\n        o.millisecond = 0;\n        break;\n      case \"milliseconds\":\n        break;\n      // no default, invalid units throw in normalizeUnit()\n    }\n\n    if (normalizedUnit === \"weeks\") {\n      if (useLocaleWeeks) {\n        const startOfWeek = this.loc.getStartOfWeek();\n        const { weekday } = this;\n        if (weekday < startOfWeek) {\n          o.weekNumber = this.weekNumber - 1;\n        }\n        o.weekday = startOfWeek;\n      } else {\n        o.weekday = 1;\n      }\n    }\n\n    if (normalizedUnit === \"quarters\") {\n      const q = Math.ceil(this.month / 3);\n      o.month = (q - 1) * 3 + 1;\n    }\n\n    return this.set(o);\n  }\n\n  /**\n   * \"Set\" this DateTime to the end (meaning the last millisecond) of a unit of time\n   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'\n   * @return {DateTime}\n   */\n  endOf(unit, opts) {\n    return this.isValid\n      ? this.plus({ [unit]: 1 })\n          .startOf(unit, opts)\n          .minus(1)\n      : this;\n  }\n\n  // OUTPUT\n\n  /**\n   * Returns a string representation of this DateTime formatted according to the specified format string.\n   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'\n   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: \"fr\" }) //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat(\"HH 'hours and' mm 'minutes'\") //=> '20 hours and 55 minutes'\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.\n   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation\n   * of the DateTime in the assigned locale.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toLocaleString(); //=> 4/20/2017\n   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'\n   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'\n   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'\n   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'\n   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'\n   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an array of format \"parts\", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts\n   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.\n   * @example DateTime.now().toLocaleParts(); //=> [\n   *                                   //=>   { type: 'day', value: '25' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'month', value: '05' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'year', value: '1982' }\n   *                                   //=> ]\n   */\n  toLocaleParts(opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)\n      : [];\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'\n   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'\n   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'\n   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'\n   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'\n   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'\n   * @return {string|null}\n   */\n  toISO({\n    format = \"extended\",\n    suppressSeconds = false,\n    suppressMilliseconds = false,\n    includeOffset = true,\n    extendedZone = false,\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    const ext = format === \"extended\";\n\n    let c = toISODate(this, ext, precision);\n    if (orderedUnits.indexOf(precision) >= 3) c += \"T\";\n    c += toISOTime(\n      this,\n      ext,\n      suppressSeconds,\n      suppressMilliseconds,\n      includeOffset,\n      extendedZone,\n      precision\n    );\n    return c;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's date component\n   * @param {Object} opts - options\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.\n   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'\n   * @return {string|null}\n   */\n  toISODate({ format = \"extended\", precision = \"day\" } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, format === \"extended\", normalizeUnit(precision));\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's week date\n   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'\n   * @return {string}\n   */\n  toISOWeekDate() {\n    return toTechFormat(this, \"kkkk-'W'WW-c\");\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's time component\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'\n   * @return {string}\n   */\n  toISOTime({\n    suppressMilliseconds = false,\n    suppressSeconds = false,\n    includeOffset = true,\n    includePrefix = false,\n    extendedZone = false,\n    format = \"extended\",\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? \"T\" : \"\";\n    return (\n      c +\n      toISOTime(\n        this,\n        format === \"extended\",\n        suppressSeconds,\n        suppressMilliseconds,\n        includeOffset,\n        extendedZone,\n        precision\n      )\n    );\n  }\n\n  /**\n   * Returns an RFC 2822-compatible string representation of this DateTime\n   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'\n   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'\n   * @return {string}\n   */\n  toRFC2822() {\n    return toTechFormat(this, \"EEE, dd LLL yyyy HH:mm:ss ZZZ\", false);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.\n   * Specifically, the string conforms to RFC 1123.\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'\n   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'\n   * @return {string}\n   */\n  toHTTP() {\n    return toTechFormat(this.toUTC(), \"EEE, dd LLL yyyy HH:mm:ss 'GMT'\");\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Date\n   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'\n   * @return {string|null}\n   */\n  toSQLDate() {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Time\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc().toSQL() //=> '05:15:16.345'\n   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'\n   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'\n   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'\n   * @return {string}\n   */\n  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {\n    let fmt = \"HH:mm:ss.SSS\";\n\n    if (includeZone || includeOffset) {\n      if (includeOffsetSpace) {\n        fmt += \" \";\n      }\n      if (includeZone) {\n        fmt += \"z\";\n      } else if (includeOffset) {\n        fmt += \"ZZ\";\n      }\n    }\n\n    return toTechFormat(this, fmt, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'\n   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'\n   * @return {string}\n   */\n  toSQL(opts = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for debugging\n   * @return {string}\n   */\n  toString() {\n    return this.isValid ? this.toISO() : INVALID;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;\n    } else {\n      return `DateTime { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime.\n   * @return {number}\n   */\n  toMillis() {\n    return this.isValid ? this.ts : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.\n   * @return {number}\n   */\n  toSeconds() {\n    return this.isValid ? this.ts / 1000 : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (as a whole number) of this DateTime.\n   * @return {number}\n   */\n  toUnixInteger() {\n    return this.isValid ? Math.floor(this.ts / 1000) : NaN;\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a BSON serializable equivalent to this DateTime.\n   * @return {Date}\n   */\n  toBSON() {\n    return this.toJSDate();\n  }\n\n  /**\n   * Returns a JavaScript object with this DateTime's year, month, day, and so on.\n   * @param opts - options for generating the object\n   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output\n   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }\n   * @return {Object}\n   */\n  toObject(opts = {}) {\n    if (!this.isValid) return {};\n\n    const base = { ...this.c };\n\n    if (opts.includeConfig) {\n      base.outputCalendar = this.outputCalendar;\n      base.numberingSystem = this.loc.numberingSystem;\n      base.locale = this.loc.locale;\n    }\n    return base;\n  }\n\n  /**\n   * Returns a JavaScript Date equivalent to this DateTime.\n   * @return {Date}\n   */\n  toJSDate() {\n    return new Date(this.isValid ? this.ts : NaN);\n  }\n\n  // COMPARE\n\n  /**\n   * Return the difference between two DateTimes as a Duration.\n   * @param {DateTime} otherDateTime - the DateTime to compare this one to\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example\n   * var i1 = DateTime.fromISO('1982-05-25T09:45'),\n   *     i2 = DateTime.fromISO('1983-10-14T10:30');\n   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }\n   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }\n   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }\n   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }\n   * @return {Duration}\n   */\n  diff(otherDateTime, unit = \"milliseconds\", opts = {}) {\n    if (!this.isValid || !otherDateTime.isValid) {\n      return Duration.invalid(\"created by diffing an invalid DateTime\");\n    }\n\n    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };\n\n    const units = maybeArray(unit).map(Duration.normalizeUnit),\n      otherIsLater = otherDateTime.valueOf() > this.valueOf(),\n      earlier = otherIsLater ? this : otherDateTime,\n      later = otherIsLater ? otherDateTime : this,\n      diffed = diff(earlier, later, units, durOpts);\n\n    return otherIsLater ? diffed.negate() : diffed;\n  }\n\n  /**\n   * Return the difference between this DateTime and right now.\n   * See {@link DateTime#diff}\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  diffNow(unit = \"milliseconds\", opts = {}) {\n    return this.diff(DateTime.now(), unit, opts);\n  }\n\n  /**\n   * Return an Interval spanning between this DateTime and another DateTime\n   * @param {DateTime} otherDateTime - the other end point of the Interval\n   * @return {Interval|DateTime}\n   */\n  until(otherDateTime) {\n    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;\n  }\n\n  /**\n   * Return whether this DateTime is in the same unit of time as another DateTime.\n   * Higher-order units must also be identical for this function to return `true`.\n   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.\n   * @param {DateTime} otherDateTime - the other DateTime\n   * @param {string} unit - the unit of time to check sameness on\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used\n   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day\n   * @return {boolean}\n   */\n  hasSame(otherDateTime, unit, opts) {\n    if (!this.isValid) return false;\n\n    const inputMs = otherDateTime.valueOf();\n    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });\n    return (\n      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)\n    );\n  }\n\n  /**\n   * Equality check\n   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.\n   * To compare just the millisecond values, use `+dt1 === +dt2`.\n   * @param {DateTime} other - the other DateTime\n   * @return {boolean}\n   */\n  equals(other) {\n    return (\n      this.isValid &&\n      other.isValid &&\n      this.valueOf() === other.valueOf() &&\n      this.zone.equals(other.zone) &&\n      this.loc.equals(other.loc)\n    );\n  }\n\n  /**\n   * Returns a string representation of a this time relative to now, such as \"in two days\". Can only internationalize if your\n   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} [options.style=\"long\"] - the style of units, must be \"long\", \"short\", or \"narrow\"\n   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of \"years\", \"quarters\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", or \"seconds\"\n   * @param {boolean} [options.round=true] - whether to round the numbers in the output.\n   * @param {string} [options.rounding=\"trunc\"] - rounding method to use when rounding the numbers in the output. Can be \"trunc\" (toward zero), \"expand\" (away from zero), \"round\", \"floor\", or \"ceil\".\n   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> \"in 1 day\"\n   * @example DateTime.now().setLocale(\"es\").toRelative({ days: 1 }) //=> \"dentro de 1 día\"\n   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: \"fr\" }) //=> \"dans 23 heures\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> \"2 days ago\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: \"hours\" }) //=> \"48 hours ago\"\n   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> \"1.5 days ago\"\n   */\n  toRelative(options = {}) {\n    if (!this.isValid) return null;\n    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),\n      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;\n    let units = [\"years\", \"months\", \"days\", \"hours\", \"minutes\", \"seconds\"];\n    let unit = options.unit;\n    if (Array.isArray(options.unit)) {\n      units = options.unit;\n      unit = undefined;\n    }\n    return diffRelative(base, this.plus(padding), {\n      ...options,\n      numeric: \"always\",\n      units,\n      unit,\n    });\n  }\n\n  /**\n   * Returns a string representation of this date relative to today, such as \"yesterday\" or \"next month\".\n   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of \"years\", \"quarters\", \"months\", \"weeks\", or \"days\"\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> \"tomorrow\"\n   * @example DateTime.now().setLocale(\"es\").plus({ days: 1 }).toRelative() //=> \"\"mañana\"\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: \"fr\" }) //=> \"demain\"\n   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> \"2 days ago\"\n   */\n  toRelativeCalendar(options = {}) {\n    if (!this.isValid) return null;\n\n    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {\n      ...options,\n      numeric: \"auto\",\n      units: [\"years\", \"months\", \"days\"],\n      calendary: true,\n    });\n  }\n\n  /**\n   * Return the min of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum\n   * @return {DateTime} the min DateTime, or undefined if called with no argument\n   */\n  static min(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"min requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);\n  }\n\n  /**\n   * Return the max of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum\n   * @return {DateTime} the max DateTime, or undefined if called with no argument\n   */\n  static max(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"max requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);\n  }\n\n  // MISC\n\n  /**\n   * Explain how a string would be parsed by fromFormat()\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see description)\n   * @param {Object} options - options taken by fromFormat()\n   * @return {Object}\n   */\n  static fromFormatExplain(text, fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return explainFromTokens(localeToUse, text, fmt);\n  }\n\n  /**\n   * @deprecated use fromFormatExplain instead\n   */\n  static fromStringExplain(text, fmt, options = {}) {\n    return DateTime.fromFormatExplain(text, fmt, options);\n  }\n\n  /**\n   * Build a parser for `fmt` using the given locale. This parser can be passed\n   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This\n   * can be used to optimize cases where many dates need to be parsed in a\n   * specific format.\n   *\n   * @param {String} fmt - the format the string is expected to be in (see\n   * description)\n   * @param {Object} options - options used to set locale and numberingSystem\n   * for parser\n   * @returns {TokenParser} - opaque object to be used\n   */\n  static buildFormatParser(fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return new TokenParser(localeToUse, fmt);\n  }\n\n  /**\n   * Create a DateTime from an input string and format parser.\n   *\n   * The format parser must have been created with the same locale as this call.\n   *\n   * @param {String} text - the string to parse\n   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}\n   * @param {Object} opts - options taken by fromFormat()\n   * @returns {DateTime}\n   */\n  static fromFormatParser(text, formatParser, opts = {}) {\n    if (isUndefined(text) || isUndefined(formatParser)) {\n      throw new InvalidArgumentError(\n        \"fromFormatParser requires an input string and a format parser\"\n      );\n    }\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n\n    if (!localeToUse.equals(formatParser.locale)) {\n      throw new InvalidArgumentError(\n        `fromFormatParser called with a locale of ${localeToUse}, ` +\n          `but the format parser was created for ${formatParser.locale}`\n      );\n    }\n\n    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);\n\n    if (invalidReason) {\n      return DateTime.invalid(invalidReason);\n    } else {\n      return parseDataToDateTime(\n        result,\n        zone,\n        opts,\n        `format ${formatParser.format}`,\n        text,\n        specificOffset\n      );\n    }\n  }\n\n  // FORMAT PRESETS\n\n  /**\n   * {@link DateTime#toLocaleString} format like 10/14/1983\n   * @type {Object}\n   */\n  static get DATE_SHORT() {\n    return Formats.DATE_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED() {\n    return Formats.DATE_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED_WITH_WEEKDAY() {\n    return Formats.DATE_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_FULL() {\n    return Formats.DATE_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_HUGE() {\n    return Formats.DATE_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_SIMPLE() {\n    return Formats.TIME_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SECONDS() {\n    return Formats.TIME_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SHORT_OFFSET() {\n    return Formats.TIME_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_LONG_OFFSET() {\n    return Formats.TIME_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_SIMPLE() {\n    return Formats.TIME_24_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SECONDS() {\n    return Formats.TIME_24_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SHORT_OFFSET() {\n    return Formats.TIME_24_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_LONG_OFFSET() {\n    return Formats.TIME_24_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT() {\n    return Formats.DATETIME_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT_WITH_SECONDS() {\n    return Formats.DATETIME_SHORT_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED() {\n    return Formats.DATETIME_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_SECONDS() {\n    return Formats.DATETIME_MED_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_WEEKDAY() {\n    return Formats.DATETIME_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL() {\n    return Formats.DATETIME_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL_WITH_SECONDS() {\n    return Formats.DATETIME_FULL_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE() {\n    return Formats.DATETIME_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE_WITH_SECONDS() {\n    return Formats.DATETIME_HUGE_WITH_SECONDS;\n  }\n}\n\n/**\n * @private\n */\nexport function friendlyDateTime(dateTimeish) {\n  if (DateTime.isDateTime(dateTimeish)) {\n    return dateTimeish;\n  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {\n    return DateTime.fromJSDate(dateTimeish);\n  } else if (dateTimeish && typeof dateTimeish === \"object\") {\n    return DateTime.fromObject(dateTimeish);\n  } else {\n    throw new InvalidArgumentError(\n      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`\n    );\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Info from \"./info.js\";\nimport Zone from \"./zone.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport InvalidZone from \"./zones/invalidZone.js\";\nimport SystemZone from \"./zones/systemZone.js\";\nimport Settings from \"./settings.js\";\n\nconst VERSION = \"3.7.2\";\n\nexport {\n  VERSION,\n  DateTime,\n  Duration,\n  Interval,\n  Info,\n  Zone,\n  FixedOffsetZone,\n  IANAZone,\n  InvalidZone,\n  SystemZone,\n  Settings,\n};\n"],"names":["LuxonError","_Error","_inheritsLoose","apply","arguments","_wrapNativeSuper","Error","InvalidDateTimeError","_LuxonError","reason","call","toMessage","InvalidIntervalError","_LuxonError2","InvalidDurationError","_LuxonError3","ConflictingSpecificationError","_LuxonError4","InvalidUnitError","_LuxonError5","unit","InvalidArgumentError","_LuxonError6","ZoneIsAbstractError","_LuxonError7","n","s","l","DATE_SHORT","year","month","day","DATE_MED","DATE_MED_WITH_WEEKDAY","weekday","DATE_FULL","DATE_HUGE","TIME_SIMPLE","hour","minute","TIME_WITH_SECONDS","second","TIME_WITH_SHORT_OFFSET","timeZoneName","TIME_WITH_LONG_OFFSET","TIME_24_SIMPLE","hourCycle","TIME_24_WITH_SECONDS","TIME_24_WITH_SHORT_OFFSET","TIME_24_WITH_LONG_OFFSET","DATETIME_SHORT","DATETIME_SHORT_WITH_SECONDS","DATETIME_MED","DATETIME_MED_WITH_SECONDS","DATETIME_MED_WITH_WEEKDAY","DATETIME_FULL","DATETIME_FULL_WITH_SECONDS","DATETIME_HUGE","DATETIME_HUGE_WITH_SECONDS","Zone","_proto","prototype","offsetName","ts","opts","formatOffset","format","offset","equals","otherZone","_createClass","key","get","name","singleton","SystemZone","_Zone","_ref","locale","parseZoneInfo","Date","getTimezoneOffset","type","Intl","DateTimeFormat","resolvedOptions","timeZone","dtfCache","Map","makeDTF","zoneName","dtf","undefined","hour12","era","set","typeToPos","hackyOffset","date","formatted","replace","parsed","exec","fMonth","fDay","fYear","fadOrBc","fHour","fMinute","fSecond","partsOffset","formatToParts","filled","i","length","_formatted$i","value","pos","isUndefined","parseInt","ianaZoneCache","IANAZone","create","zone","resetCache","clear","isValidSpecifier","isValidZone","e","_this","valid","NaN","isNaN","_ref2","adOrBc","Math","abs","adjustedHour","asUTC","objToLocalTS","millisecond","asTS","over","intlLFCache","getCachedLF","locString","JSON","stringify","ListFormat","intlDTCache","getCachedDTF","intlNumCache","getCachedINF","inf","NumberFormat","intlRelCache","getCachedRTF","_opts","base","cacheKeyOpts","_objectWithoutPropertiesLoose","_excluded","RelativeTimeFormat","sysLocaleCache","systemLocale","intlResolvedOptionsCache","getCachedIntResolvedOptions","weekInfoCache","getCachedWeekInfo","data","Locale","getWeekInfo","weekInfo","_extends","fallbackWeekSettings","parseLocaleString","localeStr","xIndex","indexOf","substring","uIndex","options","selectedStr","smaller","_options","numberingSystem","calendar","intlConfigString","outputCalendar","includes","mapMonths","f","ms","dt","DateTime","utc","push","mapWeekdays","listStuff","loc","englishFn","intlFn","mode","listingMode","supportsFastNumbers","startsWith","PolyNumberFormatter","intl","forceSimple","padTo","floor","otherOpts","_excluded2","Object","keys","intlOpts","useGrouping","minimumIntegerDigits","fixed","roundTo","padStart","PolyDateFormatter","originalZone","z","gmtOffset","offsetZ","setZone","plus","minutes","_proto2","map","join","toJSDate","parts","part","PolyRelFormatter","isEnglish","style","hasRelative","rtf","_proto3","count","English","numeric","firstDay","minimalDays","weekend","fromOpts","weekSettings","defaultToEN","specifiedLocale","Settings","defaultLocale","localeR","numberingSystemR","defaultNumberingSystem","outputCalendarR","defaultOutputCalendar","weekSettingsR","validateWeekSettings","defaultWeekSettings","fromObject","_temp","numbering","_parseLocaleString","parsedLocale","parsedNumberingSystem","parsedOutputCalendar","weekdaysCache","standalone","monthsCache","meridiemCache","eraCache","fastNumbersCached","_proto4","isActuallyEn","hasNoWeirdness","clone","alts","getOwnPropertyNames","redefaultToEN","redefaultToSystem","months","_this2","monthSpecialCase","formatStr","mapper","extract","dtFormatter","weekdays","_this3","meridiems","_this4","eras","_this5","field","df","results","matching","find","m","toLowerCase","numberFormatter","fastNumbers","relFormatter","listFormatter","getWeekSettings","hasLocaleWeekInfo","getStartOfWeek","getMinDaysInFirstWeek","getWeekendDays","other","toString","FixedOffsetZone","instance","utcInstance","parseSpecifier","r","match","signedOffset","InvalidZone","normalizeZone","input","defaultZone","isString","lowered","isNumber","numberingSystems","arab","arabext","bali","beng","deva","fullwide","gujr","hanidec","khmr","knda","laoo","limb","mlym","mong","mymr","orya","tamldec","telu","thai","tibt","latn","numberingSystemsUTF16","hanidecChars","split","parseDigits","str","code","charCodeAt","search","_numberingSystemsUTF","min","max","digitRegexCache","resetDigitRegexCache","digitRegex","append","ns","appendCache","regex","RegExp","now","twoDigitCutoffYear","throwOnInvalid","resetCaches","cutoffYear","t","Invalid","explanation","nonLeapLadder","leapLadder","unitOutOfRange","dayOfWeek","d","UTC","setUTCFullYear","getUTCFullYear","js","getUTCDay","computeOrdinal","isLeapYear","uncomputeOrdinal","ordinal","table","month0","findIndex","isoWeekdayToLocal","isoWeekday","startOfWeek","gregorianToWeek","gregObj","minDaysInFirstWeek","weekNumber","weekYear","weeksInWeekYear","timeObject","weekToGregorian","weekData","weekdayOfJan4","yearInDays","daysInYear","_uncomputeOrdinal","gregorianToOrdinal","gregData","ordinalToGregorian","ordinalData","_uncomputeOrdinal2","usesLocalWeekValues","obj","hasLocaleWeekData","localWeekday","localWeekNumber","localWeekYear","hasIsoWeekData","hasInvalidWeekData","validYear","isInteger","validWeek","integerBetween","validWeekday","hasInvalidOrdinalData","validOrdinal","hasInvalidGregorianData","validMonth","validDay","daysInMonth","hasInvalidTimeData","validHour","validMinute","validSecond","validMillisecond","o","isDate","maybeArray","thing","Array","isArray","bestBy","arr","by","compare","reduce","best","next","pair","pick","a","k","hasOwnProperty","prop","settings","some","v","from","bottom","top","floorMod","x","isNeg","padded","parseInteger","string","parseFloating","parseFloat","parseMillis","fraction","number","digits","rounding","factor","pow","ceil","trunc","round","RangeError","modMonth","modYear","firstWeekOffset","fwdlw","weekOffset","weekOffsetNext","untruncateYear","offsetFormat","modified","offHourStr","offMinuteStr","offHour","Number","offMin","offMinSigned","is","asNumber","numericValue","isFinite","normalizeObject","normalizer","normalized","u","hours","sign","monthsLong","monthsShort","monthsNarrow","concat","weekdaysLong","weekdaysShort","weekdaysNarrow","erasLong","erasShort","erasNarrow","meridiemForDateTime","weekdayForDateTime","monthForDateTime","eraForDateTime","formatRelativeTime","narrow","units","years","quarters","weeks","days","seconds","lastable","isDay","isInPast","fmtValue","singular","lilUnits","fmtUnit","stringifyTokens","splits","tokenToString","_iterator","_createForOfIteratorHelperLoose","_step","done","token","literal","val","macroTokenToFormatOpts","D","Formats","DD","DDD","DDDD","tt","ttt","tttt","T","TT","TTT","TTTT","ff","fff","ffff","F","FF","FFF","FFFF","Formatter","parseFormat","fmt","current","currentFull","bracketed","c","charAt","test","formatOpts","systemLoc","formatWithSystemDefault","formatDateTime","formatDateTimeParts","formatInterval","interval","start","formatRange","end","num","p","signDisplay","formatDateTimeFromString","knownEnglish","useDateTimeFormatter","isOffsetFixed","allowZ","isValid","meridiem","maybeMacro","slice","quarter","formatDurationFromString","dur","invertLargest","signMode","tokenToField","lildur","info","mapped","inversionFactor","isNegativeDuration","largestUnit","tokens","realTokens","found","collapsed","shiftTo","filter","durationInfo","values","ianaRegex","combineRegexes","_len","regexes","_key","full","source","combineExtractors","_len2","extractors","_key2","ex","mergedVals","mergedZone","cursor","_ex","parse","_len3","patterns","_key3","_i","_patterns","_patterns$_i","extractor","simpleParse","_len4","_key4","ret","offsetRegex","isoExtendedZone","isoTimeBaseRegex","isoTimeRegex","isoTimeExtensionRegex","isoYmdRegex","isoWeekRegex","isoOrdinalRegex","extractISOWeekData","extractISOOrdinalData","sqlYmdRegex","sqlTimeRegex","sqlTimeExtensionRegex","int","fallback","extractISOYmd","item","extractISOTime","milliseconds","extractISOOffset","local","fullOffset","extractIANAZone","isoTimeOnly","isoDuration","extractISODuration","yearStr","monthStr","weekStr","dayStr","hourStr","minuteStr","secondStr","millisecondsStr","hasNegativePrefix","negativeSeconds","maybeNegate","force","obsOffsets","GMT","EDT","EST","CDT","CST","MDT","MST","PDT","PST","fromStrings","weekdayStr","result","rfc2822","extractRFC2822","obsOffset","milOffset","preprocessRFC2822","trim","rfc1123","rfc850","ascii","extractRFC1123Or850","extractASCII","isoYmdWithTimeExtensionRegex","isoWeekWithTimeExtensionRegex","isoOrdinalWithTimeExtensionRegex","isoTimeCombinedRegex","extractISOYmdTimeAndOffset","extractISOWeekTimeAndOffset","extractISOOrdinalDateAndTime","extractISOTimeAndOffset","parseISODate","parseRFC2822Date","parseHTTPDate","parseISODuration","extractISOTimeOnly","parseISOTimeOnly","sqlYmdWithTimeExtensionRegex","sqlTimeCombinedRegex","extractISOTimeOffsetAndIANAZone","parseSQL","INVALID","lowOrderMatrix","casualMatrix","daysInYearAccurate","daysInMonthAccurate","accurateMatrix","orderedUnits","reverseUnits","reverse","conf","conversionAccuracy","matrix","Duration","durationToMillis","vals","_vals$milliseconds","sum","normalizeValues","reduceRight","previous","previousVal","conv","rollUp","removeZeroes","newVals","_Object$entries","entries","_Object$entries$_i","_Symbol$for","config","accurate","invalid","isLuxonDuration","fromMillis","normalizeUnit","fromDurationLike","durationLike","isDuration","fromISO","text","_parseISODuration","fromISOTime","_parseISOTimeOnly","week","toFormat","fmtOpts","toHuman","showZeros","unitDisplay","listStyle","toObject","toISO","toISOTime","millis","toMillis","suppressMilliseconds","suppressSeconds","includePrefix","includeOffset","dateTime","toJSON","invalidReason","valueOf","duration","_i2","_orderedUnits","minus","negate","mapUnits","fn","_i3","_Object$keys","mixed","reconfigure","as","normalize","rescale","shiftToAll","built","accumulated","lastUnit","_i4","_orderedUnits2","own","ak","negated","_i5","_Object$keys2","removeZeros","eq","v1","v2","_i6","_orderedUnits3","Symbol","for","validateStartEnd","Interval","isLuxonInterval","fromDateTimes","builtStart","friendlyDateTime","builtEnd","validateError","after","before","_split","startIsValid","endIsValid","isInterval","toDuration","startOf","useLocaleWeeks","diff","hasSame","isEmpty","isAfter","isBefore","contains","splitAt","dateTimes","sorted","sort","b","added","splitBy","idx","divideEqually","numberOfParts","overlaps","abutsStart","abutsEnd","engulfs","intersection","union","merge","intervals","_intervals$sort$reduc","sofar","final","xor","_Array$prototype","currentCount","ends","time","flattened","difference","toLocaleString","toISODate","dateFormat","_temp2","_ref3","_ref3$separator","separator","mapEndpoints","mapFn","Info","hasDST","proto","isUniversal","isValidIANAZone","_ref$locale","_ref$locObj","locObj","getMinimumDaysInFirstWeek","_ref2$locale","_ref2$locObj","getWeekendWeekdays","_temp3","_ref3$locale","_ref3$locObj","_temp4","_ref4","_ref4$locale","_ref4$numberingSystem","_ref4$locObj","_ref4$outputCalendar","monthsFormat","_temp5","_ref5","_ref5$locale","_ref5$numberingSystem","_ref5$locObj","_ref5$outputCalendar","_temp6","_ref6","_ref6$locale","_ref6$numberingSystem","_ref6$locObj","weekdaysFormat","_temp7","_ref7","_ref7$locale","_ref7$numberingSystem","_ref7$locObj","_temp8","_ref8","_ref8$locale","_temp9","_ref9","_ref9$locale","features","relative","localeWeek","dayDiff","earlier","later","utcDayStart","toUTC","keepLocalTime","highOrderDiffs","differs","lowestOrder","highWater","_differs","_differs$_i","differ","_highOrderDiffs","remainingMillis","lowerOrderUnits","_cursor$plus","_Duration$fromMillis","MISSING_FTP","intUnit","post","deser","NBSP","String","fromCharCode","spaceOrNBSP","spaceOrNBSPRegExp","fixListRegex","stripInsensitivities","oneOf","strings","startIndex","groups","h","simple","escapeToken","unitForToken","one","two","three","four","six","oneOrTwo","oneToThree","oneToSix","oneToNine","twoToFour","fourToSix","unitate","partTypeStyleToTokenVal","short","long","dayperiod","dayPeriod","hour24","tokenForPart","resolvedOpts","isSpace","actualType","buildRegex","re","handlers","matches","all","matchIndex","dateTimeFromMatches","toField","specificOffset","Z","q","M","G","y","S","dummyDateTimeCache","getDummyDateTime","maybeExpandMacroToken","formatOptsToTokens","expandMacroTokens","TokenParser","disqualifyingUnit","_buildRegex","regexString","explainFromTokens","_match","rawMatches","parser","parseFromTokens","_explainFromTokens","formatter","MAX_DATE","unsupportedZone","possiblyCachedWeekData","possiblyCachedLocalWeekData","localWeekData","inst","old","fixOffset","localTS","tz","utcGuess","o2","o3","tsToObj","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","objToTS","adjustTime","oPre","millisToAdd","_fixOffset","parseDataToDateTime","parsedZone","interpretationZone","toTechFormat","extended","precision","longFormat","extendedZone","showSeconds","ianaName","defaultUnitValues","defaultWeekUnitValues","defaultOrdinalUnitValues","orderedWeekUnits","orderedOrdinalUnits","weeknumber","weeksnumber","weeknumbers","weekyear","weekyears","normalizeUnitWithLocalWeeks","guessOffsetForZone","zoneOffsetTs","offsetGuess","zoneOffsetGuessCache","quickDT","offsetProvis","_objToTS","diffRelative","calendary","lastOpts","argList","args","unchanged","ot","_zone","isLuxonDateTime","_lastOpts","_lastOpts2","fromJSDate","zoneToUse","fromSeconds","_usesLocalWeekValues","tsNow","containsOrdinal","containsGregorYear","containsGregorMD","containsGregor","definiteWeekDef","useWeekData","defaultValues","objNow","foundFirst","_iterator2","_step2","higherOrderInvalid","gregorian","_objToTS2","tsFinal","offsetFinal","_parseISODate","fromRFC2822","_parseRFC2822Date","fromHTTP","_parseHTTPDate","fromFormat","_opts$locale","_opts$numberingSystem","localeToUse","_parseFromTokens","fromString","fromSQL","_parseSQL","isDateTime","parseFormatForOpts","localeOpts","tokenList","expandFormat","expanded","getPossibleOffsets","dayMs","minuteMs","oEarlier","oLater","o1","ts1","ts2","c1","c2","resolvedLocaleOptions","_Formatter$create$res","toLocal","_ref2$keepLocalTime","_ref2$keepCalendarTim","keepCalendarTime","newTS","asObj","_objToTS3","setLocale","_usesLocalWeekValues2","settingWeekStuff","_objToTS4","_ref4$useLocaleWeeks","normalizedUnit","endOf","_this$plus","toLocaleParts","_ref5$format","_ref5$suppressSeconds","_ref5$suppressMillise","_ref5$includeOffset","_ref5$extendedZone","_ref5$precision","ext","_ref6$format","_ref6$precision","toISOWeekDate","_ref7$suppressMillise","_ref7$suppressSeconds","_ref7$includeOffset","_ref7$includePrefix","_ref7$extendedZone","_ref7$format","_ref7$precision","toRFC2822","toHTTP","toSQLDate","toSQLTime","_ref8$includeOffset","_ref8$includeZone","includeZone","_ref8$includeOffsetSp","includeOffsetSpace","toSQL","toSeconds","toUnixInteger","toBSON","includeConfig","otherDateTime","durOpts","otherIsLater","diffed","diffNow","until","inputMs","adjustedToZone","toRelative","padding","toRelativeCalendar","every","fromFormatExplain","_options$locale","_options$numberingSys","fromStringExplain","buildFormatParser","_options2","_options2$locale","_options2$numberingSy","fromFormatParser","formatParser","_opts2","_opts2$locale","_opts2$numberingSyste","_formatParser$explain","dateTimeish","VERSION"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAAA;EAEA;EACA;EACA;EAFA,IAGMA,UAAU,0BAAAC,MAAA,EAAA;IAAAC,cAAA,CAAAF,UAAA,EAAAC,MAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,UAAA,GAAA;EAAA,IAAA,OAAAC,MAAA,CAAAE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAJ,UAAA,CAAA;EAAA,CAAAK,eAAAA,gBAAA,CAASC,KAAK,CAAA,CAAA,CAAA;EAE9B;EACA;EACA;EACaC,IAAAA,oBAAoB,0BAAAC,WAAA,EAAA;IAAAN,cAAA,CAAAK,oBAAA,EAAAC,WAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYE,MAAM,EAAE;MAAA,OAClBD,WAAA,CAAAE,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAJ,oBAAA,CAAA;EAAA,CAAA,CAHuCP,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACaY,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAAX,cAAA,CAAAU,oBAAA,EAAAC,YAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYH,MAAM,EAAE;MAAA,OAClBI,YAAA,CAAAH,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAC,oBAAA,CAAA;EAAA,CAAA,CAHuCZ,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACac,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAAb,cAAA,CAAAY,oBAAA,EAAAC,YAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYL,MAAM,EAAE;MAAA,OAClBM,YAAA,CAAAL,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAG,oBAAA,CAAA;EAAA,CAAA,CAHuCd,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACagB,IAAAA,6BAA6B,0BAAAC,YAAA,EAAA;IAAAf,cAAA,CAAAc,6BAAA,EAAAC,YAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,6BAAA,GAAA;EAAA,IAAA,OAAAC,YAAA,CAAAd,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAY,6BAAA,CAAA;EAAA,CAAA,CAAShB,UAAU,CAAA,CAAA;;EAE7D;EACA;EACA;EACakB,IAAAA,gBAAgB,0BAAAC,YAAA,EAAA;IAAAjB,cAAA,CAAAgB,gBAAA,EAAAC,YAAA,CAAA,CAAA;IAC3B,SAAAD,gBAAAA,CAAYE,IAAI,EAAE;EAAA,IAAA,OAChBD,YAAA,CAAAT,IAAA,CAAA,IAAA,EAAA,eAAA,GAAsBU,IAAM,CAAC,IAAA,IAAA,CAAA;EAC/B,GAAA;EAAC,EAAA,OAAAF,gBAAA,CAAA;EAAA,CAAA,CAHmClB,UAAU,CAAA,CAAA;;EAMhD;EACA;EACA;EACaqB,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAApB,cAAA,CAAAmB,oBAAA,EAAAC,YAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,oBAAA,GAAA;EAAA,IAAA,OAAAC,YAAA,CAAAnB,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAiB,oBAAA,CAAA;EAAA,CAAA,CAASrB,UAAU,CAAA,CAAA;;EAEpD;EACA;EACA;EACauB,IAAAA,mBAAmB,0BAAAC,YAAA,EAAA;IAAAtB,cAAA,CAAAqB,mBAAA,EAAAC,YAAA,CAAA,CAAA;EAC9B,EAAA,SAAAD,sBAAc;EAAA,IAAA,OACZC,YAAA,CAAAd,IAAA,CAAA,IAAA,EAAM,2BAA2B,CAAC,IAAA,IAAA,CAAA;EACpC,GAAA;EAAC,EAAA,OAAAa,mBAAA,CAAA;EAAA,CAAA,CAHsCvB,UAAU,CAAA;;ECxDnD;EACA;EACA;;EAEA,IAAMyB,CAAC,GAAG,SAAS;EACjBC,EAAAA,CAAC,GAAG,OAAO;EACXC,EAAAA,CAAC,GAAG,MAAM,CAAA;EAEL,IAAMC,UAAU,GAAG;EACxBC,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMO,QAAQ,GAAG;EACtBH,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMQ,qBAAqB,GAAG;EACnCJ,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAER,CAAAA;EACX,CAAC,CAAA;EAEM,IAAMS,SAAS,GAAG;EACvBN,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMW,SAAS,GAAG;EACvBP,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAAA;EACX,CAAC,CAAA;EAEM,IAAMU,WAAW,GAAG;EACzBC,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAMe,iBAAiB,GAAG;EAC/BF,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAMiB,sBAAsB,GAAG;EACpCJ,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMkB,qBAAqB,GAAG;EACnCN,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMkB,cAAc,GAAG;EAC5BP,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAA;EACb,CAAC,CAAA;EAEM,IAAMC,oBAAoB,GAAG;EAClCT,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAA;EACb,CAAC,CAAA;EAEM,IAAME,yBAAyB,GAAG;EACvCV,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAK;EAChBH,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMuB,wBAAwB,GAAG;EACtCX,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAK;EAChBH,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMuB,cAAc,GAAG;EAC5BrB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM0B,2BAA2B,GAAG;EACzCtB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM2B,YAAY,GAAG;EAC1BvB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM4B,yBAAyB,GAAG;EACvCxB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM6B,yBAAyB,GAAG;EACvCzB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAER,CAAC;EACVY,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM8B,aAAa,GAAG;EAC3B1B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM8B,0BAA0B,GAAG;EACxC3B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM+B,aAAa,GAAG;EAC3B5B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAC;EACVW,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM+B,0BAA0B,GAAG;EACxC7B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAC;EACVW,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC;;EC7KD;EACA;EACA;AAFA,MAGqBgC,IAAI,gBAAA,YAAA;EAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;EAAA,EAAA,IAAAC,MAAA,GAAAD,IAAA,CAAAE,SAAA,CAAA;EAsCvB;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAEC,IAAI,EAAE;MACnB,MAAM,IAAIzC,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAqC,MAAA,CAQAK,YAAY,GAAZ,SAAAA,aAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,MAAM,IAAI3C,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAqC,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;MACT,MAAM,IAAIxC,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAqC,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;MAChB,MAAM,IAAI9C,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA+C,EAAAA,YAAA,CAAAX,IAAA,EAAA,CAAA;MAAAY,GAAA,EAAA,MAAA;MAAAC,GAAA;EAlFA;EACF;EACA;EACA;EACA;EACE,IAAA,SAAAA,MAAW;QACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAgD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAgD,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACC,IAAI,CAAA;EAClB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAF,GAAA,EAAA,aAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;QAChB,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;EAAC,GAAA,EAAA;MAAAgD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAoDD,SAAAA,GAAAA,GAAc;QACZ,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAoC,IAAA,CAAA;EAAA,CAAA;;EC5FH,IAAIe,WAAS,GAAG,IAAI,CAAA;;EAEpB;EACA;EACA;EACA;AACqBC,MAAAA,UAAU,0BAAAC,KAAA,EAAA;IAAA1E,cAAA,CAAAyE,UAAA,EAAAC,KAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,UAAA,GAAA;EAAA,IAAA,OAAAC,KAAA,CAAAzE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,IAAAwD,MAAA,GAAAe,UAAA,CAAAd,SAAA,CAAA;EA2B7B;IAAAD,MAAA,CACAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;EAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;QAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;EAC7B,IAAA,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,CAAC,CAAA;EAC1C,GAAA;;EAEA,oBAAA;IAAAlB,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;EAC9C,GAAA;;EAEA,oBAAA;EAAAN,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;MACT,OAAO,CAAC,IAAIiB,IAAI,CAACjB,EAAE,CAAC,CAACkB,iBAAiB,EAAE,CAAA;EAC1C,GAAA;;EAEA,oBAAA;EAAArB,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,QAAQ,CAAA;EACpC,GAAA;;EAEA,oBAAA;EAAAZ,EAAAA,YAAA,CAAAK,UAAA,EAAA,CAAA;MAAAJ,GAAA,EAAA,MAAA;EAAAC,IAAAA,GAAA;EAlCA,IAAA,SAAAA,MAAW;EACT,MAAA,OAAO,QAAQ,CAAA;EACjB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAIW,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACC,QAAQ,CAAA;EAC7D,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAf,GAAA,EAAA,aAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAAD,GAAA,EAAA,UAAA;MAAAC,GAAA;EAjDD;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAsB;QACpB,IAAIE,WAAS,KAAK,IAAI,EAAE;EACtBA,QAAAA,WAAS,GAAG,IAAIC,UAAU,EAAE,CAAA;EAC9B,OAAA;EACA,MAAA,OAAOD,WAAS,CAAA;EAClB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAC,UAAA,CAAA;EAAA,CAAA,CAVqChB,IAAI;;ECN5C,IAAM4B,QAAQ,GAAG,IAAIC,GAAG,EAAE,CAAA;EAC1B,SAASC,OAAOA,CAACC,QAAQ,EAAE;EACzB,EAAA,IAAIC,GAAG,GAAGJ,QAAQ,CAACf,GAAG,CAACkB,QAAQ,CAAC,CAAA;IAChC,IAAIC,GAAG,KAAKC,SAAS,EAAE;EACrBD,IAAAA,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;EACrCS,MAAAA,MAAM,EAAE,KAAK;EACbP,MAAAA,QAAQ,EAAEI,QAAQ;EAClB7D,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,KAAK,EAAE,SAAS;EAChBC,MAAAA,GAAG,EAAE,SAAS;EACdO,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,MAAM,EAAE,SAAS;EACjBE,MAAAA,MAAM,EAAE,SAAS;EACjBqD,MAAAA,GAAG,EAAE,OAAA;EACP,KAAC,CAAC,CAAA;EACFP,IAAAA,QAAQ,CAACQ,GAAG,CAACL,QAAQ,EAAEC,GAAG,CAAC,CAAA;EAC7B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAMK,SAAS,GAAG;EAChBnE,EAAAA,IAAI,EAAE,CAAC;EACPC,EAAAA,KAAK,EAAE,CAAC;EACRC,EAAAA,GAAG,EAAE,CAAC;EACN+D,EAAAA,GAAG,EAAE,CAAC;EACNxD,EAAAA,IAAI,EAAE,CAAC;EACPC,EAAAA,MAAM,EAAE,CAAC;EACTE,EAAAA,MAAM,EAAE,CAAA;EACV,CAAC,CAAA;EAED,SAASwD,WAAWA,CAACN,GAAG,EAAEO,IAAI,EAAE;EACxB,EAAA,IAAAC,SAAS,GAAGR,GAAG,CAACzB,MAAM,CAACgC,IAAI,CAAC,CAACE,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;EACvDC,IAAAA,MAAM,GAAG,iDAAiD,CAACC,IAAI,CAACH,SAAS,CAAC;EACvEI,IAAAA,MAAM,GAAmDF,MAAM,CAAA,CAAA,CAAA;EAAvDG,IAAAA,IAAI,GAA6CH,MAAM,CAAA,CAAA,CAAA;EAAjDI,IAAAA,KAAK,GAAsCJ,MAAM,CAAA,CAAA,CAAA;EAA1CK,IAAAA,OAAO,GAA6BL,MAAM,CAAA,CAAA,CAAA;EAAjCM,IAAAA,KAAK,GAAsBN,MAAM,CAAA,CAAA,CAAA;EAA1BO,IAAAA,OAAO,GAAaP,MAAM,CAAA,CAAA,CAAA;EAAjBQ,IAAAA,OAAO,GAAIR,MAAM,CAAA,CAAA,CAAA,CAAA;EACpE,EAAA,OAAO,CAACI,KAAK,EAAEF,MAAM,EAAEC,IAAI,EAAEE,OAAO,EAAEC,KAAK,EAAEC,OAAO,EAAEC,OAAO,CAAC,CAAA;EAChE,CAAA;EAEA,SAASC,WAAWA,CAACnB,GAAG,EAAEO,IAAI,EAAE;EAC9B,EAAA,IAAMC,SAAS,GAAGR,GAAG,CAACoB,aAAa,CAACb,IAAI,CAAC,CAAA;IACzC,IAAMc,MAAM,GAAG,EAAE,CAAA;EACjB,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGd,SAAS,CAACe,MAAM,EAAED,CAAC,EAAE,EAAE;EACzC,IAAA,IAAAE,YAAA,GAAwBhB,SAAS,CAACc,CAAC,CAAC;QAA5B/B,IAAI,GAAAiC,YAAA,CAAJjC,IAAI;QAAEkC,KAAK,GAAAD,YAAA,CAALC,KAAK,CAAA;EACnB,IAAA,IAAMC,GAAG,GAAGrB,SAAS,CAACd,IAAI,CAAC,CAAA;MAE3B,IAAIA,IAAI,KAAK,KAAK,EAAE;EAClB8B,MAAAA,MAAM,CAACK,GAAG,CAAC,GAAGD,KAAK,CAAA;EACrB,KAAC,MAAM,IAAI,CAACE,WAAW,CAACD,GAAG,CAAC,EAAE;QAC5BL,MAAM,CAACK,GAAG,CAAC,GAAGE,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;EACnC,KAAA;EACF,GAAA;EACA,EAAA,OAAOJ,MAAM,CAAA;EACf,CAAA;EAEA,IAAMQ,aAAa,GAAG,IAAIhC,GAAG,EAAE,CAAA;EAC/B;EACA;EACA;EACA;AACqBiC,MAAAA,QAAQ,0BAAA7C,KAAA,EAAA;IAAA1E,cAAA,CAAAuH,QAAA,EAAA7C,KAAA,CAAA,CAAA;EAC3B;EACF;EACA;EACA;EAHE6C,EAAAA,QAAA,CAIOC,MAAM,GAAb,SAAAA,MAAAA,CAAcjD,IAAI,EAAE;EAClB,IAAA,IAAIkD,IAAI,GAAGH,aAAa,CAAChD,GAAG,CAACC,IAAI,CAAC,CAAA;MAClC,IAAIkD,IAAI,KAAK/B,SAAS,EAAE;EACtB4B,MAAAA,aAAa,CAACzB,GAAG,CAACtB,IAAI,EAAGkD,IAAI,GAAG,IAAIF,QAAQ,CAAChD,IAAI,CAAE,CAAC,CAAA;EACtD,KAAA;EACA,IAAA,OAAOkD,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAF,EAAAA,QAAA,CAIOG,UAAU,GAAjB,SAAAA,aAAoB;MAClBJ,aAAa,CAACK,KAAK,EAAE,CAAA;MACrBtC,QAAQ,CAACsC,KAAK,EAAE,CAAA;EAClB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAJ,EAAAA,QAAA,CAQOK,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBpG,CAAC,EAAE;EACzB,IAAA,OAAO,IAAI,CAACqG,WAAW,CAACrG,CAAC,CAAC,CAAA;EAC5B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA+F,EAAAA,QAAA,CAQOM,WAAW,GAAlB,SAAAA,WAAAA,CAAmBJ,IAAI,EAAE;MACvB,IAAI,CAACA,IAAI,EAAE;EACT,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MACA,IAAI;EACF,MAAA,IAAIxC,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;EAAEE,QAAAA,QAAQ,EAAEqC,IAAAA;EAAK,OAAC,CAAC,CAACzD,MAAM,EAAE,CAAA;EAC7D,MAAA,OAAO,IAAI,CAAA;OACZ,CAAC,OAAO8D,CAAC,EAAE;EACV,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;KACD,CAAA;IAED,SAAAP,QAAAA,CAAYhD,IAAI,EAAE;EAAA,IAAA,IAAAwD,KAAA,CAAA;EAChBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKvC,QAAQ,GAAGjB,IAAI,CAAA;EACpB;MACAwD,KAAA,CAAKC,KAAK,GAAGT,QAAQ,CAACM,WAAW,CAACtD,IAAI,CAAC,CAAA;EAAC,IAAA,OAAAwD,KAAA,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,EAAA,IAAArE,MAAA,GAAA6D,QAAA,CAAA5D,SAAA,CAAA;EA4BA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;EAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;QAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;MAC7B,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,EAAE,IAAI,CAACL,IAAI,CAAC,CAAA;EACrD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAN,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;EACT,IAAA,IAAI,CAAC,IAAI,CAACmE,KAAK,EAAE,OAAOC,GAAG,CAAA;EAC3B,IAAA,IAAMjC,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC,CAAA;EAEzB,IAAA,IAAIqE,KAAK,CAAClC,IAAI,CAAC,EAAE,OAAOiC,GAAG,CAAA;EAE3B,IAAA,IAAMxC,GAAG,GAAGF,OAAO,CAAC,IAAI,CAAChB,IAAI,CAAC,CAAA;EAC9B,IAAA,IAAA4D,KAAA,GAAuD1C,GAAG,CAACoB,aAAa,GACpED,WAAW,CAACnB,GAAG,EAAEO,IAAI,CAAC,GACtBD,WAAW,CAACN,GAAG,EAAEO,IAAI,CAAC;EAFrBrE,MAAAA,IAAI,GAAAwG,KAAA,CAAA,CAAA,CAAA;EAAEvG,MAAAA,KAAK,GAAAuG,KAAA,CAAA,CAAA,CAAA;EAAEtG,MAAAA,GAAG,GAAAsG,KAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,MAAM,GAAAD,KAAA,CAAA,CAAA,CAAA;EAAE/F,MAAAA,IAAI,GAAA+F,KAAA,CAAA,CAAA,CAAA;EAAE9F,MAAAA,MAAM,GAAA8F,KAAA,CAAA,CAAA,CAAA;EAAE5F,MAAAA,MAAM,GAAA4F,KAAA,CAAA,CAAA,CAAA,CAAA;MAInD,IAAIC,MAAM,KAAK,IAAI,EAAE;QACnBzG,IAAI,GAAG,CAAC0G,IAAI,CAACC,GAAG,CAAC3G,IAAI,CAAC,GAAG,CAAC,CAAA;EAC5B,KAAA;;EAEA;MACA,IAAM4G,YAAY,GAAGnG,IAAI,KAAK,EAAE,GAAG,CAAC,GAAGA,IAAI,CAAA;MAE3C,IAAMoG,KAAK,GAAGC,YAAY,CAAC;EACzB9G,MAAAA,IAAI,EAAJA,IAAI;EACJC,MAAAA,KAAK,EAALA,KAAK;EACLC,MAAAA,GAAG,EAAHA,GAAG;EACHO,MAAAA,IAAI,EAAEmG,YAAY;EAClBlG,MAAAA,MAAM,EAANA,MAAM;EACNE,MAAAA,MAAM,EAANA,MAAM;EACNmG,MAAAA,WAAW,EAAE,CAAA;EACf,KAAC,CAAC,CAAA;MAEF,IAAIC,IAAI,GAAG,CAAC3C,IAAI,CAAA;EAChB,IAAA,IAAM4C,IAAI,GAAGD,IAAI,GAAG,IAAI,CAAA;MACxBA,IAAI,IAAIC,IAAI,IAAI,CAAC,GAAGA,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;MACtC,OAAO,CAACJ,KAAK,GAAGG,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAjF,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,MAAM,IAAIb,SAAS,CAACI,IAAI,KAAK,IAAI,CAACA,IAAI,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAH,EAAAA,YAAA,CAAAmD,QAAA,EAAA,CAAA;MAAAlD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAlGA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,MAAM,CAAA;EACf,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;EACtB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAnB,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAkFD,SAAAA,GAAAA,GAAc;QACZ,OAAO,IAAI,CAAC0D,KAAK,CAAA;EACnB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAT,QAAA,CAAA;EAAA,CAAA,CA5KmC9D,IAAI;;;;;ECvD1C;;EAEA,IAAIoF,WAAW,GAAG,EAAE,CAAA;EACpB,SAASC,WAAWA,CAACC,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACvC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAI2B,GAAG,GAAGoD,WAAW,CAACxE,GAAG,CAAC,CAAA;IAC1B,IAAI,CAACoB,GAAG,EAAE;MACRA,GAAG,GAAG,IAAIR,IAAI,CAACiE,UAAU,CAACH,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC1C+E,IAAAA,WAAW,CAACxE,GAAG,CAAC,GAAGoB,GAAG,CAAA;EACxB,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAM0D,WAAW,GAAG,IAAI7D,GAAG,EAAE,CAAA;EAC7B,SAAS8D,YAAYA,CAACL,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAI2B,GAAG,GAAG0D,WAAW,CAAC7E,GAAG,CAACD,GAAG,CAAC,CAAA;IAC9B,IAAIoB,GAAG,KAAKC,SAAS,EAAE;MACrBD,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC6D,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC9CqF,IAAAA,WAAW,CAACtD,GAAG,CAACxB,GAAG,EAAEoB,GAAG,CAAC,CAAA;EAC3B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAM4D,YAAY,GAAG,IAAI/D,GAAG,EAAE,CAAA;EAC9B,SAASgE,YAAYA,CAACP,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAIyF,GAAG,GAAGF,YAAY,CAAC/E,GAAG,CAACD,GAAG,CAAC,CAAA;IAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;MACrB6D,GAAG,GAAG,IAAItE,IAAI,CAACuE,YAAY,CAACT,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC5CuF,IAAAA,YAAY,CAACxD,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAME,YAAY,GAAG,IAAInE,GAAG,EAAE,CAAA;EAC9B,SAASoE,YAAYA,CAACX,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC6F,IAAAA,KAAA,GAAkC7F,IAAI,CAAA;MAA1B6F,KAAA,CAAJC,IAAI,CAAA;EAAKC,QAAAA,YAAY,GAAAC,6BAAA,CAAAH,KAAA,EAAAI,SAAA,EAAU;IACvC,IAAM1F,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEc,YAAY,CAAC,CAAC,CAAA;EACrD,EAAA,IAAIN,GAAG,GAAGE,YAAY,CAACnF,GAAG,CAACD,GAAG,CAAC,CAAA;IAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;MACrB6D,GAAG,GAAG,IAAItE,IAAI,CAAC+E,kBAAkB,CAACjB,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAClD2F,IAAAA,YAAY,CAAC5D,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAIU,cAAc,GAAG,IAAI,CAAA;EACzB,SAASC,YAAYA,GAAG;EACtB,EAAA,IAAID,cAAc,EAAE;EAClB,IAAA,OAAOA,cAAc,CAAA;EACvB,GAAC,MAAM;EACLA,IAAAA,cAAc,GAAG,IAAIhF,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACP,MAAM,CAAA;EACnE,IAAA,OAAOqF,cAAc,CAAA;EACvB,GAAA;EACF,CAAA;EAEA,IAAME,wBAAwB,GAAG,IAAI7E,GAAG,EAAE,CAAA;EAC1C,SAAS8E,2BAA2BA,CAACrB,SAAS,EAAE;EAC9C,EAAA,IAAIjF,IAAI,GAAGqG,wBAAwB,CAAC7F,GAAG,CAACyE,SAAS,CAAC,CAAA;IAClD,IAAIjF,IAAI,KAAK4B,SAAS,EAAE;MACtB5B,IAAI,GAAG,IAAImB,IAAI,CAACC,cAAc,CAAC6D,SAAS,CAAC,CAAC5D,eAAe,EAAE,CAAA;EAC3DgF,IAAAA,wBAAwB,CAACtE,GAAG,CAACkD,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC/C,GAAA;EACA,EAAA,OAAOA,IAAI,CAAA;EACb,CAAA;EAEA,IAAMuG,aAAa,GAAG,IAAI/E,GAAG,EAAE,CAAA;EAC/B,SAASgF,iBAAiBA,CAACvB,SAAS,EAAE;EACpC,EAAA,IAAIwB,IAAI,GAAGF,aAAa,CAAC/F,GAAG,CAACyE,SAAS,CAAC,CAAA;IACvC,IAAI,CAACwB,IAAI,EAAE;MACT,IAAM3F,MAAM,GAAG,IAAIK,IAAI,CAACuF,MAAM,CAACzB,SAAS,CAAC,CAAA;EACzC;EACAwB,IAAAA,IAAI,GAAG,aAAa,IAAI3F,MAAM,GAAGA,MAAM,CAAC6F,WAAW,EAAE,GAAG7F,MAAM,CAAC8F,QAAQ,CAAA;EACvE;EACA,IAAA,IAAI,EAAE,aAAa,IAAIH,IAAI,CAAC,EAAE;EAC5BA,MAAAA,IAAI,GAAAI,QAAA,CAAA,EAAA,EAAQC,oBAAoB,EAAKL,IAAI,CAAE,CAAA;EAC7C,KAAA;EACAF,IAAAA,aAAa,CAACxE,GAAG,CAACkD,SAAS,EAAEwB,IAAI,CAAC,CAAA;EACpC,GAAA;EACA,EAAA,OAAOA,IAAI,CAAA;EACb,CAAA;EAEA,SAASM,iBAAiBA,CAACC,SAAS,EAAE;EACpC;EACA;EACA;;EAEA;EACA;EACA;;EAEA;EACA;EACA;EACA,EAAA,IAAMC,MAAM,GAAGD,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;EACvC,EAAA,IAAID,MAAM,KAAK,CAAC,CAAC,EAAE;MACjBD,SAAS,GAAGA,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEF,MAAM,CAAC,CAAA;EAC5C,GAAA;EAEA,EAAA,IAAMG,MAAM,GAAGJ,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;EACvC,EAAA,IAAIE,MAAM,KAAK,CAAC,CAAC,EAAE;MACjB,OAAO,CAACJ,SAAS,CAAC,CAAA;EACpB,GAAC,MAAM;EACL,IAAA,IAAIK,OAAO,CAAA;EACX,IAAA,IAAIC,WAAW,CAAA;MACf,IAAI;QACFD,OAAO,GAAG/B,YAAY,CAAC0B,SAAS,CAAC,CAAC3F,eAAe,EAAE,CAAA;EACnDiG,MAAAA,WAAW,GAAGN,SAAS,CAAA;OACxB,CAAC,OAAOhD,CAAC,EAAE;QACV,IAAMuD,OAAO,GAAGP,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEC,MAAM,CAAC,CAAA;QAC9CC,OAAO,GAAG/B,YAAY,CAACiC,OAAO,CAAC,CAAClG,eAAe,EAAE,CAAA;EACjDiG,MAAAA,WAAW,GAAGC,OAAO,CAAA;EACvB,KAAA;MAEA,IAAAC,QAAA,GAAsCH,OAAO;QAArCI,eAAe,GAAAD,QAAA,CAAfC,eAAe;QAAEC,QAAQ,GAAAF,QAAA,CAARE,QAAQ,CAAA;EACjC,IAAA,OAAO,CAACJ,WAAW,EAAEG,eAAe,EAAEC,QAAQ,CAAC,CAAA;EACjD,GAAA;EACF,CAAA;EAEA,SAASC,gBAAgBA,CAACX,SAAS,EAAES,eAAe,EAAEG,cAAc,EAAE;IACpE,IAAIA,cAAc,IAAIH,eAAe,EAAE;EACrC,IAAA,IAAI,CAACT,SAAS,CAACa,QAAQ,CAAC,KAAK,CAAC,EAAE;EAC9Bb,MAAAA,SAAS,IAAI,IAAI,CAAA;EACnB,KAAA;EAEA,IAAA,IAAIY,cAAc,EAAE;EAClBZ,MAAAA,SAAS,aAAWY,cAAgB,CAAA;EACtC,KAAA;EAEA,IAAA,IAAIH,eAAe,EAAE;EACnBT,MAAAA,SAAS,aAAWS,eAAiB,CAAA;EACvC,KAAA;EACA,IAAA,OAAOT,SAAS,CAAA;EAClB,GAAC,MAAM;EACL,IAAA,OAAOA,SAAS,CAAA;EAClB,GAAA;EACF,CAAA;EAEA,SAASc,SAASA,CAACC,CAAC,EAAE;IACpB,IAAMC,EAAE,GAAG,EAAE,CAAA;IACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,EAAE,EAAEA,CAAC,EAAE,EAAE;MAC5B,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAElF,CAAC,EAAE,CAAC,CAAC,CAAA;EACnC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;EAChB,GAAA;EACA,EAAA,OAAOD,EAAE,CAAA;EACX,CAAA;EAEA,SAASK,WAAWA,CAACN,CAAC,EAAE;IACtB,IAAMC,EAAE,GAAG,EAAE,CAAA;IACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;EAC3B,IAAA,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAGlF,CAAC,CAAC,CAAA;EACzC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;EAChB,GAAA;EACA,EAAA,OAAOD,EAAE,CAAA;EACX,CAAA;EAEA,SAASM,SAASA,CAACC,GAAG,EAAErF,MAAM,EAAEsF,SAAS,EAAEC,MAAM,EAAE;EACjD,EAAA,IAAMC,IAAI,GAAGH,GAAG,CAACI,WAAW,EAAE,CAAA;IAE9B,IAAID,IAAI,KAAK,OAAO,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM,IAAIA,IAAI,KAAK,IAAI,EAAE;MACxB,OAAOF,SAAS,CAACtF,MAAM,CAAC,CAAA;EAC1B,GAAC,MAAM;MACL,OAAOuF,MAAM,CAACvF,MAAM,CAAC,CAAA;EACvB,GAAA;EACF,CAAA;EAEA,SAAS0F,mBAAmBA,CAACL,GAAG,EAAE;IAChC,IAAIA,GAAG,CAACd,eAAe,IAAIc,GAAG,CAACd,eAAe,KAAK,MAAM,EAAE;EACzD,IAAA,OAAO,KAAK,CAAA;EACd,GAAC,MAAM;EACL,IAAA,OACEc,GAAG,CAACd,eAAe,KAAK,MAAM,IAC9B,CAACc,GAAG,CAACzH,MAAM,IACXyH,GAAG,CAACzH,MAAM,CAAC+H,UAAU,CAAC,IAAI,CAAC,IAC3BvC,2BAA2B,CAACiC,GAAG,CAACzH,MAAM,CAAC,CAAC2G,eAAe,KAAK,MAAM,CAAA;EAEtE,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EAFA,IAIMqB,mBAAmB,gBAAA,YAAA;EACvB,EAAA,SAAAA,oBAAYC,IAAI,EAAEC,WAAW,EAAEhJ,IAAI,EAAE;EACnC,IAAA,IAAI,CAACiJ,KAAK,GAAGjJ,IAAI,CAACiJ,KAAK,IAAI,CAAC,CAAA;EAC5B,IAAA,IAAI,CAACC,KAAK,GAAGlJ,IAAI,CAACkJ,KAAK,IAAI,KAAK,CAAA;EAEhC,IAAuClJ,IAAI,CAAnCiJ,KAAK,CAAA;QAA0BjJ,IAAI,CAA5BkJ,KAAK,CAAA;EAAKC,UAAAA,SAAS,GAAAnD,6BAAA,CAAKhG,IAAI,EAAAoJ,UAAA,EAAA;EAE3C,IAAA,IAAI,CAACJ,WAAW,IAAIK,MAAM,CAACC,IAAI,CAACH,SAAS,CAAC,CAACjG,MAAM,GAAG,CAAC,EAAE;QACrD,IAAMqG,QAAQ,GAAA1C,QAAA,CAAA;EAAK2C,QAAAA,WAAW,EAAE,KAAA;EAAK,OAAA,EAAKxJ,IAAI,CAAE,CAAA;EAChD,MAAA,IAAIA,IAAI,CAACiJ,KAAK,GAAG,CAAC,EAAEM,QAAQ,CAACE,oBAAoB,GAAGzJ,IAAI,CAACiJ,KAAK,CAAA;QAC9D,IAAI,CAACxD,GAAG,GAAGD,YAAY,CAACuD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;EAAC,EAAA,IAAA3J,MAAA,GAAAkJ,mBAAA,CAAAjJ,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDM,MAAM,GAAN,SAAAA,MAAAA,CAAO+C,CAAC,EAAE;MACR,IAAI,IAAI,CAACwC,GAAG,EAAE;EACZ,MAAA,IAAMiE,KAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAGA,CAAC,CAAA;EAC5C,MAAA,OAAO,IAAI,CAACwC,GAAG,CAACvF,MAAM,CAACwJ,KAAK,CAAC,CAAA;EAC/B,KAAC,MAAM;EACL;EACA,MAAA,IAAMA,MAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAG0G,OAAO,CAAC1G,CAAC,EAAE,CAAC,CAAC,CAAA;EACxD,MAAA,OAAO2G,QAAQ,CAACF,MAAK,EAAE,IAAI,CAACT,KAAK,CAAC,CAAA;EACpC,KAAA;KACD,CAAA;EAAA,EAAA,OAAAH,mBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH;EACA;EACA;EAFA,IAIMe,iBAAiB,gBAAA,YAAA;EACrB,EAAA,SAAAA,kBAAY5B,EAAE,EAAEc,IAAI,EAAE/I,IAAI,EAAE;MAC1B,IAAI,CAACA,IAAI,GAAGA,IAAI,CAAA;MAChB,IAAI,CAAC8J,YAAY,GAAGlI,SAAS,CAAA;MAE7B,IAAImI,CAAC,GAAGnI,SAAS,CAAA;EACjB,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACsB,QAAQ,EAAE;EACtB;QACA,IAAI,CAAC2G,EAAE,GAAGA,EAAE,CAAA;OACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,OAAO,EAAE;EACnC;EACA;EACA;EACA;EACA;EACA;QACA,IAAM8I,SAAS,GAAG,CAAC,CAAC,IAAI/B,EAAE,CAAC9H,MAAM,GAAG,EAAE,CAAC,CAAA;QACvC,IAAM8J,OAAO,GAAGD,SAAS,IAAI,CAAC,GAAcA,UAAAA,GAAAA,SAAS,eAAeA,SAAW,CAAA;EAC/E,MAAA,IAAI/B,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIsD,QAAQ,CAACC,MAAM,CAACuG,OAAO,CAAC,CAAC/F,KAAK,EAAE;EACrD6F,QAAAA,CAAC,GAAGE,OAAO,CAAA;UACX,IAAI,CAAChC,EAAE,GAAGA,EAAE,CAAA;EACd,OAAC,MAAM;EACL;EACA;EACA8B,QAAAA,CAAC,GAAG,KAAK,CAAA;EACT,QAAA,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAAC9H,MAAM,KAAK,CAAC,GAAG8H,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;YAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;EAAO,SAAC,CAAC,CAAA;EAC/E,QAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;EAC7B,OAAA;OACD,MAAM,IAAIsE,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,QAAQ,EAAE;QACpC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;OACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;QAClC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;EACZ8B,MAAAA,CAAC,GAAG9B,EAAE,CAACtE,IAAI,CAAClD,IAAI,CAAA;EAClB,KAAC,MAAM;EACL;EACA;EACAsJ,MAAAA,CAAC,GAAG,KAAK,CAAA;QACT,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;UAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;EAAO,OAAC,CAAC,CAAA;EACxD,MAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;EAC7B,KAAA;EAEA,IAAA,IAAM4F,QAAQ,GAAA1C,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;EACjCuJ,IAAAA,QAAQ,CAACjI,QAAQ,GAAGiI,QAAQ,CAACjI,QAAQ,IAAIyI,CAAC,CAAA;MAC1C,IAAI,CAACpI,GAAG,GAAG2D,YAAY,CAACyD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;EACzC,GAAA;EAAC,EAAA,IAAAc,OAAA,GAAAR,iBAAA,CAAAhK,SAAA,CAAA;EAAAwK,EAAAA,OAAA,CAEDnK,MAAM,GAAN,SAAAA,SAAS;MACP,IAAI,IAAI,CAAC4J,YAAY,EAAE;EACrB;EACA;QACA,OAAO,IAAI,CAAC/G,aAAa,EAAE,CACxBuH,GAAG,CAAC,UAAAzJ,IAAA,EAAA;EAAA,QAAA,IAAGuC,KAAK,GAAAvC,IAAA,CAALuC,KAAK,CAAA;EAAA,QAAA,OAAOA,KAAK,CAAA;EAAA,OAAA,CAAC,CACzBmH,IAAI,CAAC,EAAE,CAAC,CAAA;EACb,KAAA;EACA,IAAA,OAAO,IAAI,CAAC5I,GAAG,CAACzB,MAAM,CAAC,IAAI,CAAC+H,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;KAC3C,CAAA;EAAAH,EAAAA,OAAA,CAEDtH,aAAa,GAAb,SAAAA,gBAAgB;EAAA,IAAA,IAAAkB,KAAA,GAAA,IAAA,CAAA;EACd,IAAA,IAAMwG,KAAK,GAAG,IAAI,CAAC9I,GAAG,CAACoB,aAAa,CAAC,IAAI,CAACkF,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;MACxD,IAAI,IAAI,CAACV,YAAY,EAAE;EACrB,MAAA,OAAOW,KAAK,CAACH,GAAG,CAAC,UAACI,IAAI,EAAK;EACzB,QAAA,IAAIA,IAAI,CAACxJ,IAAI,KAAK,cAAc,EAAE;EAChC,UAAA,IAAMpB,UAAU,GAAGmE,KAAI,CAAC6F,YAAY,CAAChK,UAAU,CAACmE,KAAI,CAACgE,EAAE,CAAClI,EAAE,EAAE;EAC1De,YAAAA,MAAM,EAAEmD,KAAI,CAACgE,EAAE,CAACnH,MAAM;EACtBZ,YAAAA,MAAM,EAAE+D,KAAI,CAACjE,IAAI,CAACrB,YAAAA;EACpB,WAAC,CAAC,CAAA;YACF,OAAAkI,QAAA,KACK6D,IAAI,EAAA;EACPtH,YAAAA,KAAK,EAAEtD,UAAAA;EAAU,WAAA,CAAA,CAAA;EAErB,SAAC,MAAM;EACL,UAAA,OAAO4K,IAAI,CAAA;EACb,SAAA;EACF,OAAC,CAAC,CAAA;EACJ,KAAA;EACA,IAAA,OAAOD,KAAK,CAAA;KACb,CAAA;EAAAJ,EAAAA,OAAA,CAEDhJ,eAAe,GAAf,SAAAA,kBAAkB;EAChB,IAAA,OAAO,IAAI,CAACM,GAAG,CAACN,eAAe,EAAE,CAAA;KAClC,CAAA;EAAA,EAAA,OAAAwI,iBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH;EACA;EACA;EAFA,IAGMc,gBAAgB,gBAAA,YAAA;EACpB,EAAA,SAAAA,iBAAY5B,IAAI,EAAE6B,SAAS,EAAE5K,IAAI,EAAE;MACjC,IAAI,CAACA,IAAI,GAAA6G,QAAA,CAAA;EAAKgE,MAAAA,KAAK,EAAE,MAAA;EAAM,KAAA,EAAK7K,IAAI,CAAE,CAAA;EACtC,IAAA,IAAI,CAAC4K,SAAS,IAAIE,WAAW,EAAE,EAAE;QAC/B,IAAI,CAACC,GAAG,GAAGnF,YAAY,CAACmD,IAAI,EAAE/I,IAAI,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;EAAC,EAAA,IAAAgL,OAAA,GAAAL,gBAAA,CAAA9K,SAAA,CAAA;IAAAmL,OAAA,CAED9K,MAAM,GAAN,SAAAA,OAAO+K,KAAK,EAAE7N,IAAI,EAAE;MAClB,IAAI,IAAI,CAAC2N,GAAG,EAAE;QACZ,OAAO,IAAI,CAACA,GAAG,CAAC7K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;EACrC,KAAC,MAAM;QACL,OAAO8N,kBAA0B,CAAC9N,IAAI,EAAE6N,KAAK,EAAE,IAAI,CAACjL,IAAI,CAACmL,OAAO,EAAE,IAAI,CAACnL,IAAI,CAAC6K,KAAK,KAAK,MAAM,CAAC,CAAA;EAC/F,KAAA;KACD,CAAA;IAAAG,OAAA,CAEDjI,aAAa,GAAb,SAAAA,cAAckI,KAAK,EAAE7N,IAAI,EAAE;MACzB,IAAI,IAAI,CAAC2N,GAAG,EAAE;QACZ,OAAO,IAAI,CAACA,GAAG,CAAChI,aAAa,CAACkI,KAAK,EAAE7N,IAAI,CAAC,CAAA;EAC5C,KAAC,MAAM;EACL,MAAA,OAAO,EAAE,CAAA;EACX,KAAA;KACD,CAAA;EAAA,EAAA,OAAAuN,gBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH,IAAM7D,oBAAoB,GAAG;EAC3BsE,EAAAA,QAAQ,EAAE,CAAC;EACXC,EAAAA,WAAW,EAAE,CAAC;EACdC,EAAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;EAChB,CAAC,CAAA;;EAED;EACA;EACA;EAFA,IAGqB5E,MAAM,gBAAA,YAAA;EAAAA,EAAAA,MAAA,CAClB6E,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvL,IAAI,EAAE;MACpB,OAAO0G,MAAM,CAAChD,MAAM,CAClB1D,IAAI,CAACc,MAAM,EACXd,IAAI,CAACyH,eAAe,EACpBzH,IAAI,CAAC4H,cAAc,EACnB5H,IAAI,CAACwL,YAAY,EACjBxL,IAAI,CAACyL,WACP,CAAC,CAAA;KACF,CAAA;EAAA/E,EAAAA,MAAA,CAEMhD,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,EAAEC,WAAW,EAAU;EAAA,IAAA,IAArBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,KAAK,CAAA;EAAA,KAAA;EACtF,IAAA,IAAMC,eAAe,GAAG5K,MAAM,IAAI6K,QAAQ,CAACC,aAAa,CAAA;EACxD;MACA,IAAMC,OAAO,GAAGH,eAAe,KAAKD,WAAW,GAAG,OAAO,GAAGrF,YAAY,EAAE,CAAC,CAAA;EAC3E,IAAA,IAAM0F,gBAAgB,GAAGrE,eAAe,IAAIkE,QAAQ,CAACI,sBAAsB,CAAA;EAC3E,IAAA,IAAMC,eAAe,GAAGpE,cAAc,IAAI+D,QAAQ,CAACM,qBAAqB,CAAA;MACxE,IAAMC,aAAa,GAAGC,oBAAoB,CAACX,YAAY,CAAC,IAAIG,QAAQ,CAACS,mBAAmB,CAAA;EACxF,IAAA,OAAO,IAAI1F,MAAM,CAACmF,OAAO,EAAEC,gBAAgB,EAAEE,eAAe,EAAEE,aAAa,EAAER,eAAe,CAAC,CAAA;KAC9F,CAAA;EAAAhF,EAAAA,MAAA,CAEM9C,UAAU,GAAjB,SAAAA,aAAoB;EAClBuC,IAAAA,cAAc,GAAG,IAAI,CAAA;MACrBd,WAAW,CAACxB,KAAK,EAAE,CAAA;MACnB0B,YAAY,CAAC1B,KAAK,EAAE,CAAA;MACpB8B,YAAY,CAAC9B,KAAK,EAAE,CAAA;MACpBwC,wBAAwB,CAACxC,KAAK,EAAE,CAAA;MAChC0C,aAAa,CAAC1C,KAAK,EAAE,CAAA;KACtB,CAAA;EAAA6C,EAAAA,MAAA,CAEM2F,UAAU,GAAjB,SAAAA,UAAAA,CAAAC,KAAA,EAAkF;EAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAA5DxL,MAAM,GAAAuD,KAAA,CAANvD,MAAM;QAAE2G,eAAe,GAAApD,KAAA,CAAfoD,eAAe;QAAEG,cAAc,GAAAvD,KAAA,CAAduD,cAAc;QAAE4D,YAAY,GAAAnH,KAAA,CAAZmH,YAAY,CAAA;MACvE,OAAO9E,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,CAAC,CAAA;KAC5E,CAAA;IAED,SAAA9E,MAAAA,CAAY5F,MAAM,EAAEyL,SAAS,EAAE3E,cAAc,EAAE4D,YAAY,EAAEE,eAAe,EAAE;EAC5E,IAAA,IAAAc,kBAAA,GAAoEzF,iBAAiB,CAACjG,MAAM,CAAC;EAAtF2L,MAAAA,YAAY,GAAAD,kBAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,qBAAqB,GAAAF,kBAAA,CAAA,CAAA,CAAA;EAAEG,MAAAA,oBAAoB,GAAAH,kBAAA,CAAA,CAAA,CAAA,CAAA;MAEhE,IAAI,CAAC1L,MAAM,GAAG2L,YAAY,CAAA;EAC1B,IAAA,IAAI,CAAChF,eAAe,GAAG8E,SAAS,IAAIG,qBAAqB,IAAI,IAAI,CAAA;EACjE,IAAA,IAAI,CAAC9E,cAAc,GAAGA,cAAc,IAAI+E,oBAAoB,IAAI,IAAI,CAAA;MACpE,IAAI,CAACnB,YAAY,GAAGA,YAAY,CAAA;EAChC,IAAA,IAAI,CAACzC,IAAI,GAAGpB,gBAAgB,CAAC,IAAI,CAAC7G,MAAM,EAAE,IAAI,CAAC2G,eAAe,EAAE,IAAI,CAACG,cAAc,CAAC,CAAA;MAEpF,IAAI,CAACgF,aAAa,GAAG;QAAE1M,MAAM,EAAE,EAAE;EAAE2M,MAAAA,UAAU,EAAE,EAAC;OAAG,CAAA;MACnD,IAAI,CAACC,WAAW,GAAG;QAAE5M,MAAM,EAAE,EAAE;EAAE2M,MAAAA,UAAU,EAAE,EAAC;OAAG,CAAA;MACjD,IAAI,CAACE,aAAa,GAAG,IAAI,CAAA;EACzB,IAAA,IAAI,CAACC,QAAQ,GAAG,EAAE,CAAA;MAElB,IAAI,CAACtB,eAAe,GAAGA,eAAe,CAAA;MACtC,IAAI,CAACuB,iBAAiB,GAAG,IAAI,CAAA;EAC/B,GAAA;EAAC,EAAA,IAAAC,OAAA,GAAAxG,MAAA,CAAA7G,SAAA,CAAA;EAAAqN,EAAAA,OAAA,CAUDvE,WAAW,GAAX,SAAAA,cAAc;EACZ,IAAA,IAAMwE,YAAY,GAAG,IAAI,CAACvC,SAAS,EAAE,CAAA;MACrC,IAAMwC,cAAc,GAClB,CAAC,IAAI,CAAC3F,eAAe,KAAK,IAAI,IAAI,IAAI,CAACA,eAAe,KAAK,MAAM,MAChE,IAAI,CAACG,cAAc,KAAK,IAAI,IAAI,IAAI,CAACA,cAAc,KAAK,SAAS,CAAC,CAAA;EACrE,IAAA,OAAOuF,YAAY,IAAIC,cAAc,GAAG,IAAI,GAAG,MAAM,CAAA;KACtD,CAAA;EAAAF,EAAAA,OAAA,CAEDG,KAAK,GAAL,SAAAA,KAAAA,CAAMC,IAAI,EAAE;EACV,IAAA,IAAI,CAACA,IAAI,IAAIjE,MAAM,CAACkE,mBAAmB,CAACD,IAAI,CAAC,CAACpK,MAAM,KAAK,CAAC,EAAE;EAC1D,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM;QACL,OAAOwD,MAAM,CAAChD,MAAM,CAClB4J,IAAI,CAACxM,MAAM,IAAI,IAAI,CAAC4K,eAAe,EACnC4B,IAAI,CAAC7F,eAAe,IAAI,IAAI,CAACA,eAAe,EAC5C6F,IAAI,CAAC1F,cAAc,IAAI,IAAI,CAACA,cAAc,EAC1CuE,oBAAoB,CAACmB,IAAI,CAAC9B,YAAY,CAAC,IAAI,IAAI,CAACA,YAAY,EAC5D8B,IAAI,CAAC7B,WAAW,IAAI,KACtB,CAAC,CAAA;EACH,KAAA;KACD,CAAA;EAAAyB,EAAAA,OAAA,CAEDM,aAAa,GAAb,SAAAA,aAAAA,CAAcF,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;EAAE7B,MAAAA,WAAW,EAAE,IAAA;EAAI,KAAA,CAAE,CAAC,CAAA;KAClD,CAAA;EAAAyB,EAAAA,OAAA,CAEDO,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBH,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACzB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;EAAE7B,MAAAA,WAAW,EAAE,KAAA;EAAK,KAAA,CAAE,CAAC,CAAA;KACnD,CAAA;IAAAyB,OAAA,CAEDQ,MAAM,GAAN,SAAAA,SAAOxK,MAAM,EAAEhD,MAAM,EAAU;EAAA,IAAA,IAAAyN,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAhBzN,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,KAAA;MAC3B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,MAAc,EAAE,YAAM;EACnD;EACA;EACA;EACA,MAAA,IAAM0C,gBAAgB,GAAGD,MAAI,CAAC5E,IAAI,KAAK,IAAI,IAAI4E,MAAI,CAAC5E,IAAI,CAACF,UAAU,CAAC,KAAK,CAAC,CAAA;QAC1E3I,MAAM,IAAI,CAAC0N,gBAAgB,CAAA;QAC3B,IAAM7E,IAAI,GAAG7I,MAAM,GAAG;EAAEpC,UAAAA,KAAK,EAAEoF,MAAM;EAAEnF,UAAAA,GAAG,EAAE,SAAA;EAAU,SAAC,GAAG;EAAED,UAAAA,KAAK,EAAEoF,MAAAA;WAAQ;EACzE2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;QAC9C,IAAI,CAACyN,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;EACxC,QAAA,IAAM4K,MAAM,GAAG,CAACF,gBAAgB,GAC5B,UAAC3F,EAAE,EAAA;YAAA,OAAK0F,MAAI,CAACI,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,OAAO,CAAC,CAAA;EAAA,SAAA,GACvC,UAACd,EAAE,EAAA;YAAA,OAAK0F,MAAI,CAACK,WAAW,CAAC/F,EAAE,EAAEc,IAAI,CAAC,CAAC7I,MAAM,EAAE,CAAA;EAAA,SAAA,CAAA;EAC/CyN,QAAAA,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAG4E,SAAS,CAACgG,MAAM,CAAC,CAAA;EACzD,OAAA;QACA,OAAOH,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;EAC5C,KAAC,CAAC,CAAA;KACH,CAAA;IAAAgK,OAAA,CAEDe,QAAQ,GAAR,SAAAA,WAAS/K,MAAM,EAAEhD,MAAM,EAAU;EAAA,IAAA,IAAAgO,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAhBhO,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,KAAA;MAC7B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,QAAgB,EAAE,YAAM;QACrD,IAAMnC,IAAI,GAAG7I,MAAM,GACb;EAAEhC,UAAAA,OAAO,EAAEgF,MAAM;EAAErF,UAAAA,IAAI,EAAE,SAAS;EAAEC,UAAAA,KAAK,EAAE,MAAM;EAAEC,UAAAA,GAAG,EAAE,SAAA;EAAU,SAAC,GACnE;EAAEG,UAAAA,OAAO,EAAEgF,MAAAA;WAAQ;EACvB2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;QAC9C,IAAI,CAACgO,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;EAC1CgL,QAAAA,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAGmF,WAAW,CAAC,UAACJ,EAAE,EAAA;YAAA,OACrDiG,MAAI,CAACH,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,SAAS,CAAC,CAAA;EAAA,SACnC,CAAC,CAAA;EACH,OAAA;QACA,OAAOmF,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;EAC9C,KAAC,CAAC,CAAA;KACH,CAAA;EAAAgK,EAAAA,OAAA,CAEDiB,SAAS,GAAT,SAAAA,cAAY;EAAA,IAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;EACV,IAAA,OAAO9F,SAAS,CACd,IAAI,EACJ1G,SAAS,EACT,YAAA;QAAA,OAAMsJ,SAAiB,CAAA;EAAA,KAAA,EACvB,YAAM;EACJ;EACA;EACA,MAAA,IAAI,CAACkD,MAAI,CAACrB,aAAa,EAAE;EACvB,QAAA,IAAMhE,IAAI,GAAG;EAAEzK,UAAAA,IAAI,EAAE,SAAS;EAAEQ,UAAAA,SAAS,EAAE,KAAA;WAAO,CAAA;EAClDsP,QAAAA,MAAI,CAACrB,aAAa,GAAG,CAAC7E,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAACmC,GAAG,CACtF,UAACrC,EAAE,EAAA;YAAA,OAAKmG,MAAI,CAACL,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,WAAW,CAAC,CAAA;EAAA,SAC7C,CAAC,CAAA;EACH,OAAA;QAEA,OAAOqF,MAAI,CAACrB,aAAa,CAAA;EAC3B,KACF,CAAC,CAAA;KACF,CAAA;EAAAG,EAAAA,OAAA,CAEDmB,IAAI,GAAJ,SAAAA,MAAAA,CAAKnL,MAAM,EAAE;EAAA,IAAA,IAAAoL,MAAA,GAAA,IAAA,CAAA;MACX,OAAOhG,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,IAAY,EAAE,YAAM;EACjD,MAAA,IAAMnC,IAAI,GAAG;EAAEjH,QAAAA,GAAG,EAAEoB,MAAAA;SAAQ,CAAA;;EAE5B;EACA;EACA,MAAA,IAAI,CAACoL,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,EAAE;EAC1BoL,QAAAA,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,GAAG,CAACgF,QAAQ,CAACC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAACmC,GAAG,CAAC,UAACrC,EAAE,EAAA;YAAA,OACjFqG,MAAI,CAACP,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,KAAK,CAAC,CAAA;EAAA,SAC/B,CAAC,CAAA;EACH,OAAA;EAEA,MAAA,OAAOuF,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,CAAA;EAC9B,KAAC,CAAC,CAAA;KACH,CAAA;IAAAgK,OAAA,CAEDa,OAAO,GAAP,SAAAA,OAAAA,CAAQ9F,EAAE,EAAEsB,QAAQ,EAAEgF,KAAK,EAAE;MAC3B,IAAMC,EAAE,GAAG,IAAI,CAACR,WAAW,CAAC/F,EAAE,EAAEsB,QAAQ,CAAC;EACvCkF,MAAAA,OAAO,GAAGD,EAAE,CAACzL,aAAa,EAAE;EAC5B2L,MAAAA,QAAQ,GAAGD,OAAO,CAACE,IAAI,CAAC,UAACC,CAAC,EAAA;UAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAKN,KAAK,CAAA;SAAC,CAAA,CAAA;EAChE,IAAA,OAAOG,QAAQ,GAAGA,QAAQ,CAACtL,KAAK,GAAG,IAAI,CAAA;KACxC,CAAA;EAAA8J,EAAAA,OAAA,CAED4B,eAAe,GAAf,SAAAA,eAAAA,CAAgB9O,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACvB;EACA;EACA,IAAA,OAAO,IAAI8I,mBAAmB,CAAC,IAAI,CAACC,IAAI,EAAE/I,IAAI,CAACgJ,WAAW,IAAI,IAAI,CAAC+F,WAAW,EAAE/O,IAAI,CAAC,CAAA;KACtF,CAAA;IAAAkN,OAAA,CAEDc,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEsB,QAAQ,EAAO;EAAA,IAAA,IAAfA,QAAQ,KAAA,KAAA,CAAA,EAAA;QAARA,QAAQ,GAAG,EAAE,CAAA;EAAA,KAAA;MAC3B,OAAO,IAAIM,iBAAiB,CAAC5B,EAAE,EAAE,IAAI,CAACc,IAAI,EAAEQ,QAAQ,CAAC,CAAA;KACtD,CAAA;EAAA2D,EAAAA,OAAA,CAED8B,YAAY,GAAZ,SAAAA,YAAAA,CAAahP,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACpB,IAAA,OAAO,IAAI2K,gBAAgB,CAAC,IAAI,CAAC5B,IAAI,EAAE,IAAI,CAAC6B,SAAS,EAAE,EAAE5K,IAAI,CAAC,CAAA;KAC/D,CAAA;EAAAkN,EAAAA,OAAA,CAED+B,aAAa,GAAb,SAAAA,aAAAA,CAAcjP,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,OAAOgF,WAAW,CAAC,IAAI,CAAC+D,IAAI,EAAE/I,IAAI,CAAC,CAAA;KACpC,CAAA;EAAAkN,EAAAA,OAAA,CAEDtC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,OACE,IAAI,CAAC9J,MAAM,KAAK,IAAI,IACpB,IAAI,CAACA,MAAM,CAAC+N,WAAW,EAAE,KAAK,OAAO,IACrCvI,2BAA2B,CAAC,IAAI,CAACyC,IAAI,CAAC,CAACjI,MAAM,CAAC+H,UAAU,CAAC,OAAO,CAAC,CAAA;KAEpE,CAAA;EAAAqE,EAAAA,OAAA,CAEDgC,eAAe,GAAf,SAAAA,kBAAkB;MAChB,IAAI,IAAI,CAAC1D,YAAY,EAAE;QACrB,OAAO,IAAI,CAACA,YAAY,CAAA;EAC1B,KAAC,MAAM,IAAI,CAAC2D,iBAAiB,EAAE,EAAE;EAC/B,MAAA,OAAOrI,oBAAoB,CAAA;EAC7B,KAAC,MAAM;EACL,MAAA,OAAON,iBAAiB,CAAC,IAAI,CAAC1F,MAAM,CAAC,CAAA;EACvC,KAAA;KACD,CAAA;EAAAoM,EAAAA,OAAA,CAEDkC,cAAc,GAAd,SAAAA,iBAAiB;EACf,IAAA,OAAO,IAAI,CAACF,eAAe,EAAE,CAAC9D,QAAQ,CAAA;KACvC,CAAA;EAAA8B,EAAAA,OAAA,CAEDmC,qBAAqB,GAArB,SAAAA,wBAAwB;EACtB,IAAA,OAAO,IAAI,CAACH,eAAe,EAAE,CAAC7D,WAAW,CAAA;KAC1C,CAAA;EAAA6B,EAAAA,OAAA,CAEDoC,cAAc,GAAd,SAAAA,iBAAiB;EACf,IAAA,OAAO,IAAI,CAACJ,eAAe,EAAE,CAAC5D,OAAO,CAAA;KACtC,CAAA;EAAA4B,EAAAA,OAAA,CAED9M,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,OACE,IAAI,CAACzO,MAAM,KAAKyO,KAAK,CAACzO,MAAM,IAC5B,IAAI,CAAC2G,eAAe,KAAK8H,KAAK,CAAC9H,eAAe,IAC9C,IAAI,CAACG,cAAc,KAAK2H,KAAK,CAAC3H,cAAc,CAAA;KAE/C,CAAA;EAAAsF,EAAAA,OAAA,CAEDsC,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAiB,SAAA,GAAA,IAAI,CAAC1O,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC2G,eAAe,GAAA,IAAA,GAAK,IAAI,CAACG,cAAc,GAAA,GAAA,CAAA;KAC9E,CAAA;EAAAtH,EAAAA,YAAA,CAAAoG,MAAA,EAAA,CAAA;MAAAnG,GAAA,EAAA,aAAA;MAAAC,GAAA,EA7KD,SAAAA,GAAAA,GAAkB;EAChB,MAAA,IAAI,IAAI,CAACyM,iBAAiB,IAAI,IAAI,EAAE;EAClC,QAAA,IAAI,CAACA,iBAAiB,GAAGrE,mBAAmB,CAAC,IAAI,CAAC,CAAA;EACpD,OAAA;QAEA,OAAO,IAAI,CAACqE,iBAAiB,CAAA;EAC/B,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAvG,MAAA,CAAA;EAAA,CAAA,EAAA;;EC7YH,IAAIhG,SAAS,GAAG,IAAI,CAAA;;EAEpB;EACA;EACA;EACA;AACqB+O,MAAAA,eAAe,0BAAA7O,KAAA,EAAA;IAAA1E,cAAA,CAAAuT,eAAA,EAAA7O,KAAA,CAAA,CAAA;EAYlC;EACF;EACA;EACA;EACA;EAJE6O,EAAAA,eAAA,CAKOC,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvP,MAAM,EAAE;EACtB,IAAA,OAAOA,MAAM,KAAK,CAAC,GAAGsP,eAAe,CAACE,WAAW,GAAG,IAAIF,eAAe,CAACtP,MAAM,CAAC,CAAA;EACjF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAsP,EAAAA,eAAA,CAQOG,cAAc,GAArB,SAAAA,cAAAA,CAAsBlS,CAAC,EAAE;EACvB,IAAA,IAAIA,CAAC,EAAE;EACL,MAAA,IAAMmS,CAAC,GAAGnS,CAAC,CAACoS,KAAK,CAAC,uCAAuC,CAAC,CAAA;EAC1D,MAAA,IAAID,CAAC,EAAE;EACL,QAAA,OAAO,IAAIJ,eAAe,CAACM,YAAY,CAACF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;EACtD,OAAA;EACF,KAAA;EACA,IAAA,OAAO,IAAI,CAAA;KACZ,CAAA;IAED,SAAAJ,eAAAA,CAAYtP,MAAM,EAAE;EAAA,IAAA,IAAA8D,KAAA,CAAA;EAClBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKyF,KAAK,GAAGvJ,MAAM,CAAA;EAAC,IAAA,OAAA8D,KAAA,CAAA;EACtB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,EAAA,IAAArE,MAAA,GAAA6P,eAAA,CAAA5P,SAAA,CAAA;EAiCA;EACF;EACA;EACA;EACA;EACA;EALED,EAAAA,MAAA,CAMAE,UAAU,GAAV,SAAAA,aAAa;MACX,OAAO,IAAI,CAACW,IAAI,CAAA;EAClB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;EACvB,IAAA,OAAOD,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAExJ,MAAM,CAAC,CAAA;EACzC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAUA;EACF;EACA;EACA;EACA;EACA;EACA;EANEN,EAAAA,MAAA,CAOAO,MAAM,GAAN,SAAAA,SAAS;MACP,OAAO,IAAI,CAACuJ,KAAK,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA9J,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,OAAO,IAAIb,SAAS,CAACqJ,KAAK,KAAK,IAAI,CAACA,KAAK,CAAA;EACrE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAApJ,EAAAA,YAAA,CAAAmP,eAAA,EAAA,CAAA;MAAAlP,GAAA,EAAA,MAAA;MAAAC,GAAA,EAjFA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,OAAO,CAAA;EAChB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,IAAI,CAACkJ,KAAK,KAAK,CAAC,GAAG,KAAK,GAASzJ,KAAAA,GAAAA,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAG,CAAA;EAC9E,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAnJ,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;EACb,MAAA,IAAI,IAAI,CAACkJ,KAAK,KAAK,CAAC,EAAE;EACpB,QAAA,OAAO,SAAS,CAAA;EAClB,OAAC,MAAM;UACL,OAAiBzJ,SAAAA,GAAAA,YAAY,CAAC,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAC,CAAA;EACtD,OAAA;EACF,KAAA;EAAC,GAAA,EAAA;MAAAnJ,GAAA,EAAA,aAAA;MAAAC,GAAA,EA8BD,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EA6BD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAAD,GAAA,EAAA,aAAA;MAAAC,GAAA;EA1ID;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAyB;QACvB,IAAIE,SAAS,KAAK,IAAI,EAAE;EACtBA,QAAAA,SAAS,GAAG,IAAI+O,eAAe,CAAC,CAAC,CAAC,CAAA;EACpC,OAAA;EACA,MAAA,OAAO/O,SAAS,CAAA;EAClB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA+O,eAAA,CAAA;EAAA,CAAA,CAV0C9P,IAAI;;ECPjD;EACA;EACA;EACA;AACqBqQ,MAAAA,WAAW,0BAAApP,KAAA,EAAA;IAAA1E,cAAA,CAAA8T,WAAA,EAAApP,KAAA,CAAA,CAAA;IAC9B,SAAAoP,WAAAA,CAAYtO,QAAQ,EAAE;EAAA,IAAA,IAAAuC,KAAA,CAAA;EACpBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKvC,QAAQ,GAAGA,QAAQ,CAAA;EAAC,IAAA,OAAAuC,KAAA,CAAA;EAC3B,GAAA;;EAEA;EAAA,EAAA,IAAArE,MAAA,GAAAoQ,WAAA,CAAAnQ,SAAA,CAAA;EAeA;EAAAD,EAAAA,MAAA,CACAE,UAAU,GAAV,SAAAA,aAAa;EACX,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;;EAEA,oBAAA;EAAAF,EAAAA,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAe;EACb,IAAA,OAAO,EAAE,CAAA;EACX,GAAA;;EAEA,oBAAA;EAAAL,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAOgE,GAAG,CAAA;EACZ,GAAA;;EAEA,oBAAA;EAAAvE,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;;EAEA,oBAAA;EAAAE,EAAAA,YAAA,CAAA0P,WAAA,EAAA,CAAA;MAAAzP,GAAA,EAAA,MAAA;MAAAC,GAAA,EAlCA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,SAAS,CAAA;EAClB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;EACtB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAnB,GAAA,EAAA,aAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAwP,WAAA,CAAA;EAAA,CAAA,CA7CsCrQ,IAAI;;ECN7C;EACA;EACA;EAUO,SAASsQ,aAAaA,CAACC,KAAK,EAAEC,WAAW,EAAE;IAEhD,IAAI7M,WAAW,CAAC4M,KAAK,CAAC,IAAIA,KAAK,KAAK,IAAI,EAAE;EACxC,IAAA,OAAOC,WAAW,CAAA;EACpB,GAAC,MAAM,IAAID,KAAK,YAAYvQ,IAAI,EAAE;EAChC,IAAA,OAAOuQ,KAAK,CAAA;EACd,GAAC,MAAM,IAAIE,QAAQ,CAACF,KAAK,CAAC,EAAE;EAC1B,IAAA,IAAMG,OAAO,GAAGH,KAAK,CAACrB,WAAW,EAAE,CAAA;MACnC,IAAIwB,OAAO,KAAK,SAAS,EAAE,OAAOF,WAAW,CAAC,KACzC,IAAIE,OAAO,KAAK,OAAO,IAAIA,OAAO,KAAK,QAAQ,EAAE,OAAO1P,UAAU,CAAC+O,QAAQ,CAAC,KAC5E,IAAIW,OAAO,KAAK,KAAK,IAAIA,OAAO,KAAK,KAAK,EAAE,OAAOZ,eAAe,CAACE,WAAW,CAAC,KAC/E,OAAOF,eAAe,CAACG,cAAc,CAACS,OAAO,CAAC,IAAI5M,QAAQ,CAACC,MAAM,CAACwM,KAAK,CAAC,CAAA;EAC/E,GAAC,MAAM,IAAII,QAAQ,CAACJ,KAAK,CAAC,EAAE;EAC1B,IAAA,OAAOT,eAAe,CAACC,QAAQ,CAACQ,KAAK,CAAC,CAAA;EACxC,GAAC,MAAM,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAIA,KAAK,IAAI,OAAOA,KAAK,CAAC/P,MAAM,KAAK,UAAU,EAAE;EAC/F;EACA;EACA,IAAA,OAAO+P,KAAK,CAAA;EACd,GAAC,MAAM;EACL,IAAA,OAAO,IAAIF,WAAW,CAACE,KAAK,CAAC,CAAA;EAC/B,GAAA;EACF;;ECjCA,IAAMK,gBAAgB,GAAG;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,iBAAiB;EAC1BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,QAAQ,EAAE,iBAAiB;EAC3BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,uBAAuB;EAChCC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,iBAAiB;EAC1BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,KAAA;EACR,CAAC,CAAA;EAED,IAAMC,qBAAqB,GAAG;EAC5BrB,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;EACxBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBE,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAA;EACnB,CAAC,CAAA;EAED,IAAMG,YAAY,GAAGvB,gBAAgB,CAACQ,OAAO,CAAC3O,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC2P,KAAK,CAAC,EAAE,CAAC,CAAA;EAExE,SAASC,WAAWA,CAACC,GAAG,EAAE;EAC/B,EAAA,IAAI7O,KAAK,GAAGG,QAAQ,CAAC0O,GAAG,EAAE,EAAE,CAAC,CAAA;EAC7B,EAAA,IAAI7N,KAAK,CAAChB,KAAK,CAAC,EAAE;EAChBA,IAAAA,KAAK,GAAG,EAAE,CAAA;EACV,IAAA,KAAK,IAAIH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgP,GAAG,CAAC/O,MAAM,EAAED,CAAC,EAAE,EAAE;EACnC,MAAA,IAAMiP,IAAI,GAAGD,GAAG,CAACE,UAAU,CAAClP,CAAC,CAAC,CAAA;EAE9B,MAAA,IAAIgP,GAAG,CAAChP,CAAC,CAAC,CAACmP,MAAM,CAAC7B,gBAAgB,CAACQ,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;UAClD3N,KAAK,IAAI0O,YAAY,CAAC5K,OAAO,CAAC+K,GAAG,CAAChP,CAAC,CAAC,CAAC,CAAA;EACvC,OAAC,MAAM;EACL,QAAA,KAAK,IAAM1C,GAAG,IAAIsR,qBAAqB,EAAE;EACvC,UAAA,IAAAQ,oBAAA,GAAmBR,qBAAqB,CAACtR,GAAG,CAAC;EAAtC+R,YAAAA,GAAG,GAAAD,oBAAA,CAAA,CAAA,CAAA;EAAEE,YAAAA,GAAG,GAAAF,oBAAA,CAAA,CAAA,CAAA,CAAA;EACf,UAAA,IAAIH,IAAI,IAAII,GAAG,IAAIJ,IAAI,IAAIK,GAAG,EAAE;cAC9BnP,KAAK,IAAI8O,IAAI,GAAGI,GAAG,CAAA;EACrB,WAAA;EACF,SAAA;EACF,OAAA;EACF,KAAA;EACA,IAAA,OAAO/O,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;EAC5B,GAAC,MAAM;EACL,IAAA,OAAOA,KAAK,CAAA;EACd,GAAA;EACF,CAAA;;EAEA;EACA,IAAMoP,eAAe,GAAG,IAAIhR,GAAG,EAAE,CAAA;EAC1B,SAASiR,oBAAoBA,GAAG;IACrCD,eAAe,CAAC3O,KAAK,EAAE,CAAA;EACzB,CAAA;EAEO,SAAS6O,UAAUA,CAAA7R,IAAA,EAAsB8R,MAAM,EAAO;EAAA,EAAA,IAAhClL,eAAe,GAAA5G,IAAA,CAAf4G,eAAe,CAAA;EAAA,EAAA,IAAIkL,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,EAAE,CAAA;EAAA,GAAA;EACzD,EAAA,IAAMC,EAAE,GAAGnL,eAAe,IAAI,MAAM,CAAA;EAEpC,EAAA,IAAIoL,WAAW,GAAGL,eAAe,CAAChS,GAAG,CAACoS,EAAE,CAAC,CAAA;IACzC,IAAIC,WAAW,KAAKjR,SAAS,EAAE;EAC7BiR,IAAAA,WAAW,GAAG,IAAIrR,GAAG,EAAE,CAAA;EACvBgR,IAAAA,eAAe,CAACzQ,GAAG,CAAC6Q,EAAE,EAAEC,WAAW,CAAC,CAAA;EACtC,GAAA;EACA,EAAA,IAAIC,KAAK,GAAGD,WAAW,CAACrS,GAAG,CAACmS,MAAM,CAAC,CAAA;IACnC,IAAIG,KAAK,KAAKlR,SAAS,EAAE;MACvBkR,KAAK,GAAG,IAAIC,MAAM,CAAIxC,EAAAA,GAAAA,gBAAgB,CAACqC,EAAE,CAAC,GAAGD,MAAQ,CAAC,CAAA;EACtDE,IAAAA,WAAW,CAAC9Q,GAAG,CAAC4Q,MAAM,EAAEG,KAAK,CAAC,CAAA;EAChC,GAAA;EAEA,EAAA,OAAOA,KAAK,CAAA;EACd;;ECpFA,IAAIE,GAAG,GAAG,SAAAA,GAAA,GAAA;EAAA,IAAA,OAAMhS,IAAI,CAACgS,GAAG,EAAE,CAAA;EAAA,GAAA;EACxB7C,EAAAA,WAAW,GAAG,QAAQ;EACtBvE,EAAAA,aAAa,GAAG,IAAI;EACpBG,EAAAA,sBAAsB,GAAG,IAAI;EAC7BE,EAAAA,qBAAqB,GAAG,IAAI;EAC5BgH,EAAAA,kBAAkB,GAAG,EAAE;IACvBC,cAAc;EACd9G,EAAAA,mBAAmB,GAAG,IAAI,CAAA;;EAE5B;EACA;EACA;AAFA,MAGqBT,QAAQ,gBAAA,YAAA;EAAA,EAAA,SAAAA,QAAA,GAAA,EAAA;EAoJ3B;EACF;EACA;EACA;EAHEA,EAAAA,QAAA,CAIOwH,WAAW,GAAlB,SAAAA,cAAqB;MACnBzM,MAAM,CAAC9C,UAAU,EAAE,CAAA;MACnBH,QAAQ,CAACG,UAAU,EAAE,CAAA;MACrBsE,QAAQ,CAACtE,UAAU,EAAE,CAAA;EACrB6O,IAAAA,oBAAoB,EAAE,CAAA;KACvB,CAAA;EAAAnS,EAAAA,YAAA,CAAAqL,QAAA,EAAA,IAAA,EAAA,CAAA;MAAApL,GAAA,EAAA,KAAA;MAAAC,GAAA;EA5JD;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAiB;EACf,MAAA,OAAOwS,GAAG,CAAA;EACZ,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANEjR,IAAAA,GAAA,EAOA,SAAAA,GAAetE,CAAAA,CAAC,EAAE;EAChBuV,MAAAA,GAAG,GAAGvV,CAAC,CAAA;EACT,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA8C,GAAA,EAAA,aAAA;MAAAC,GAAA;EASA;EACF;EACA;EACA;EACA;EACE,IAAA,SAAAA,MAAyB;EACvB,MAAA,OAAOyP,aAAa,CAACE,WAAW,EAAExP,UAAU,CAAC+O,QAAQ,CAAC,CAAA;EACxD,KAAA;;EAEA;EACF;EACA;EACA;EAHE3N,IAAAA,GAAA,EAbA,SAAAA,GAAuB4B,CAAAA,IAAI,EAAE;EAC3BwM,MAAAA,WAAW,GAAGxM,IAAI,CAAA;EACpB,KAAA;EAAC,GAAA,EAAA;MAAApD,GAAA,EAAA,eAAA;MAAAC,GAAA,EAeD,SAAAA,GAAAA,GAA2B;EACzB,MAAA,OAAOoL,aAAa,CAAA;EACtB,KAAA;;EAEA;EACF;EACA;EACA;EAHE7J,IAAAA,GAAA,EAIA,SAAAA,GAAyBjB,CAAAA,MAAM,EAAE;EAC/B8K,MAAAA,aAAa,GAAG9K,MAAM,CAAA;EACxB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAP,GAAA,EAAA,wBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;EAClC,MAAA,OAAOuL,sBAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHEhK,IAAAA,GAAA,EAIA,SAAAA,GAAkC0F,CAAAA,eAAe,EAAE;EACjDsE,MAAAA,sBAAsB,GAAGtE,eAAe,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAlH,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;EACjC,MAAA,OAAOyL,qBAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHElK,IAAAA,GAAA,EAIA,SAAAA,GAAiC6F,CAAAA,cAAc,EAAE;EAC/CqE,MAAAA,qBAAqB,GAAGrE,cAAc,CAAA;EACxC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;;EAEE;EACF;EACA;EAFE,GAAA,EAAA;MAAArH,GAAA,EAAA,qBAAA;MAAAC,GAAA,EAGA,SAAAA,GAAAA,GAAiC;EAC/B,MAAA,OAAO4L,mBAAmB,CAAA;EAC5B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANErK,IAAAA,GAAA,EAOA,SAAAA,GAA+ByJ,CAAAA,YAAY,EAAE;EAC3CY,MAAAA,mBAAmB,GAAGD,oBAAoB,CAACX,YAAY,CAAC,CAAA;EAC1D,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAjL,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgC;EAC9B,MAAA,OAAOyS,kBAAkB,CAAA;EAC3B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EARElR,IAAAA,GAAA,EASA,SAAAA,GAA8BqR,CAAAA,UAAU,EAAE;QACxCH,kBAAkB,GAAGG,UAAU,GAAG,GAAG,CAAA;EACvC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7S,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;EAC1B,MAAA,OAAO0S,cAAc,CAAA;EACvB,KAAA;;EAEA;EACF;EACA;EACA;EAHEnR,IAAAA,GAAA,EAIA,SAAAA,GAA0BsR,CAAAA,CAAC,EAAE;EAC3BH,MAAAA,cAAc,GAAGG,CAAC,CAAA;EACpB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA1H,QAAA,CAAA;EAAA,CAAA;;MCvKkB2H,OAAO,gBAAA,YAAA;EAC1B,EAAA,SAAAA,OAAY7W,CAAAA,MAAM,EAAE8W,WAAW,EAAE;MAC/B,IAAI,CAAC9W,MAAM,GAAGA,MAAM,CAAA;MACpB,IAAI,CAAC8W,WAAW,GAAGA,WAAW,CAAA;EAChC,GAAA;EAAC,EAAA,IAAA3T,MAAA,GAAA0T,OAAA,CAAAzT,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDjD,SAAS,GAAT,SAAAA,YAAY;MACV,IAAI,IAAI,CAAC4W,WAAW,EAAE;EACpB,MAAA,OAAU,IAAI,CAAC9W,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC8W,WAAW,CAAA;EAC5C,KAAC,MAAM;QACL,OAAO,IAAI,CAAC9W,MAAM,CAAA;EACpB,KAAA;KACD,CAAA;EAAA,EAAA,OAAA6W,OAAA,CAAA;EAAA,CAAA,EAAA;;ECCH,IAAME,aAAa,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC3EC,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAEtE,SAASC,cAAcA,CAACtW,IAAI,EAAEgG,KAAK,EAAE;EACnC,EAAA,OAAO,IAAIkQ,OAAO,CAChB,mBAAmB,EACFlQ,gBAAAA,GAAAA,KAAK,GAAa,YAAA,GAAA,OAAOA,KAAK,GAAA,SAAA,GAAUhG,IAAI,GAAA,oBAC/D,CAAC,CAAA;EACH,CAAA;EAEO,SAASuW,SAASA,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;EAC1C,EAAA,IAAM6V,CAAC,GAAG,IAAI5S,IAAI,CAACA,IAAI,CAAC6S,GAAG,CAAChW,IAAI,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,CAAC,CAAC,CAAA;EAElD,EAAA,IAAIF,IAAI,GAAG,GAAG,IAAIA,IAAI,IAAI,CAAC,EAAE;MAC3B+V,CAAC,CAACE,cAAc,CAACF,CAAC,CAACG,cAAc,EAAE,GAAG,IAAI,CAAC,CAAA;EAC7C,GAAA;EAEA,EAAA,IAAMC,EAAE,GAAGJ,CAAC,CAACK,SAAS,EAAE,CAAA;EAExB,EAAA,OAAOD,EAAE,KAAK,CAAC,GAAG,CAAC,GAAGA,EAAE,CAAA;EAC1B,CAAA;EAEA,SAASE,cAAcA,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;EACxC,EAAA,OAAOA,GAAG,GAAG,CAACoW,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa,EAAE1V,KAAK,GAAG,CAAC,CAAC,CAAA;EACzE,CAAA;EAEA,SAASsW,gBAAgBA,CAACvW,IAAI,EAAEwW,OAAO,EAAE;IACvC,IAAMC,KAAK,GAAGH,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa;EACzDe,IAAAA,MAAM,GAAGD,KAAK,CAACE,SAAS,CAAC,UAACvR,CAAC,EAAA;QAAA,OAAKA,CAAC,GAAGoR,OAAO,CAAA;OAAC,CAAA;EAC5CtW,IAAAA,GAAG,GAAGsW,OAAO,GAAGC,KAAK,CAACC,MAAM,CAAC,CAAA;IAC/B,OAAO;MAAEzW,KAAK,EAAEyW,MAAM,GAAG,CAAC;EAAExW,IAAAA,GAAG,EAAHA,GAAAA;KAAK,CAAA;EACnC,CAAA;EAEO,SAAS0W,iBAAiBA,CAACC,UAAU,EAAEC,WAAW,EAAE;IACzD,OAAQ,CAACD,UAAU,GAAGC,WAAW,GAAG,CAAC,IAAI,CAAC,GAAI,CAAC,CAAA;EACjD,CAAA;;EAEA;EACA;EACA;;EAEO,SAASC,eAAeA,CAACC,OAAO,EAAEC,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC9E,EAAA,IAAQ9W,IAAI,GAAiBgX,OAAO,CAA5BhX,IAAI;MAAEC,KAAK,GAAU+W,OAAO,CAAtB/W,KAAK;MAAEC,GAAG,GAAK8W,OAAO,CAAf9W,GAAG;MACtBsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC;EAC1CG,IAAAA,OAAO,GAAGuW,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,EAAE4W,WAAW,CAAC,CAAA;EAEvE,EAAA,IAAII,UAAU,GAAGxQ,IAAI,CAAC2E,KAAK,CAAC,CAACmL,OAAO,GAAGnW,OAAO,GAAG,EAAE,GAAG4W,kBAAkB,IAAI,CAAC,CAAC;MAC5EE,QAAQ,CAAA;IAEV,IAAID,UAAU,GAAG,CAAC,EAAE;MAClBC,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;MACnBkX,UAAU,GAAGE,eAAe,CAACD,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EACzE,GAAC,MAAM,IAAII,UAAU,GAAGE,eAAe,CAACpX,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,CAAC,EAAE;MAC9EK,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;EACnBkX,IAAAA,UAAU,GAAG,CAAC,CAAA;EAChB,GAAC,MAAM;EACLC,IAAAA,QAAQ,GAAGnX,IAAI,CAAA;EACjB,GAAA;EAEA,EAAA,OAAAgJ,QAAA,CAAA;EAASmO,IAAAA,QAAQ,EAARA,QAAQ;EAAED,IAAAA,UAAU,EAAVA,UAAU;EAAE7W,IAAAA,OAAO,EAAPA,OAAAA;KAAYgX,EAAAA,UAAU,CAACL,OAAO,CAAC,CAAA,CAAA;EAChE,CAAA;EAEO,SAASM,eAAeA,CAACC,QAAQ,EAAEN,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC/E,EAAA,IAAQK,QAAQ,GAA0BI,QAAQ,CAA1CJ,QAAQ;MAAED,UAAU,GAAcK,QAAQ,CAAhCL,UAAU;MAAE7W,OAAO,GAAKkX,QAAQ,CAApBlX,OAAO;EACnCmX,IAAAA,aAAa,GAAGZ,iBAAiB,CAACd,SAAS,CAACqB,QAAQ,EAAE,CAAC,EAAEF,kBAAkB,CAAC,EAAEH,WAAW,CAAC;EAC1FW,IAAAA,UAAU,GAAGC,UAAU,CAACP,QAAQ,CAAC,CAAA;EAEnC,EAAA,IAAIX,OAAO,GAAGU,UAAU,GAAG,CAAC,GAAG7W,OAAO,GAAGmX,aAAa,GAAG,CAAC,GAAGP,kBAAkB;MAC7EjX,IAAI,CAAA;IAEN,IAAIwW,OAAO,GAAG,CAAC,EAAE;MACfxW,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;EACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAAC1X,IAAI,CAAC,CAAA;EAC7B,GAAC,MAAM,IAAIwW,OAAO,GAAGiB,UAAU,EAAE;MAC/BzX,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;EACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAACP,QAAQ,CAAC,CAAA;EACjC,GAAC,MAAM;EACLnX,IAAAA,IAAI,GAAGmX,QAAQ,CAAA;EACjB,GAAA;EAEA,EAAA,IAAAQ,iBAAA,GAAuBpB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;MAA9CvW,KAAK,GAAA0X,iBAAA,CAAL1X,KAAK;MAAEC,GAAG,GAAAyX,iBAAA,CAAHzX,GAAG,CAAA;EAClB,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEC,IAAAA,KAAK,EAALA,KAAK;EAAEC,IAAAA,GAAG,EAAHA,GAAAA;KAAQmX,EAAAA,UAAU,CAACE,QAAQ,CAAC,CAAA,CAAA;EACpD,CAAA;EAEO,SAASK,kBAAkBA,CAACC,QAAQ,EAAE;EAC3C,EAAA,IAAQ7X,IAAI,GAAiB6X,QAAQ,CAA7B7X,IAAI;MAAEC,KAAK,GAAU4X,QAAQ,CAAvB5X,KAAK;MAAEC,GAAG,GAAK2X,QAAQ,CAAhB3X,GAAG,CAAA;IACxB,IAAMsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,CAAA;EAChD,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEwW,IAAAA,OAAO,EAAPA,OAAAA;KAAYa,EAAAA,UAAU,CAACQ,QAAQ,CAAC,CAAA,CAAA;EACjD,CAAA;EAEO,SAASC,kBAAkBA,CAACC,WAAW,EAAE;EAC9C,EAAA,IAAQ/X,IAAI,GAAc+X,WAAW,CAA7B/X,IAAI;MAAEwW,OAAO,GAAKuB,WAAW,CAAvBvB,OAAO,CAAA;EACrB,EAAA,IAAAwB,kBAAA,GAAuBzB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;MAA9CvW,KAAK,GAAA+X,kBAAA,CAAL/X,KAAK;MAAEC,GAAG,GAAA8X,kBAAA,CAAH9X,GAAG,CAAA;EAClB,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEC,IAAAA,KAAK,EAALA,KAAK;EAAEC,IAAAA,GAAG,EAAHA,GAAAA;KAAQmX,EAAAA,UAAU,CAACU,WAAW,CAAC,CAAA,CAAA;EACvD,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACO,SAASE,mBAAmBA,CAACC,GAAG,EAAExN,GAAG,EAAE;IAC5C,IAAMyN,iBAAiB,GACrB,CAAC1S,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,IAC9B,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,IACjC,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,CAAA;EACjC,EAAA,IAAIH,iBAAiB,EAAE;MACrB,IAAMI,cAAc,GAClB,CAAC9S,WAAW,CAACyS,GAAG,CAAC7X,OAAO,CAAC,IAAI,CAACoF,WAAW,CAACyS,GAAG,CAAChB,UAAU,CAAC,IAAI,CAACzR,WAAW,CAACyS,GAAG,CAACf,QAAQ,CAAC,CAAA;EAEzF,IAAA,IAAIoB,cAAc,EAAE;EAClB,MAAA,MAAM,IAAIpZ,6BAA6B,CACrC,gEACF,CAAC,CAAA;EACH,KAAA;EACA,IAAA,IAAI,CAACsG,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,EAAEF,GAAG,CAAC7X,OAAO,GAAG6X,GAAG,CAACE,YAAY,CAAA;EAClE,IAAA,IAAI,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,EAAEH,GAAG,CAAChB,UAAU,GAAGgB,GAAG,CAACG,eAAe,CAAA;EAC3E,IAAA,IAAI,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,EAAEJ,GAAG,CAACf,QAAQ,GAAGe,GAAG,CAACI,aAAa,CAAA;MACrE,OAAOJ,GAAG,CAACE,YAAY,CAAA;MACvB,OAAOF,GAAG,CAACG,eAAe,CAAA;MAC1B,OAAOH,GAAG,CAACI,aAAa,CAAA;MACxB,OAAO;EACLrB,MAAAA,kBAAkB,EAAEvM,GAAG,CAAC8G,qBAAqB,EAAE;EAC/CsF,MAAAA,WAAW,EAAEpM,GAAG,CAAC6G,cAAc,EAAC;OACjC,CAAA;EACH,GAAC,MAAM;MACL,OAAO;EAAE0F,MAAAA,kBAAkB,EAAE,CAAC;EAAEH,MAAAA,WAAW,EAAE,CAAA;OAAG,CAAA;EAClD,GAAA;EACF,CAAA;EAEO,SAAS0B,kBAAkBA,CAACN,GAAG,EAAEjB,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC7E,EAAA,IAAM2B,SAAS,GAAGC,SAAS,CAACR,GAAG,CAACf,QAAQ,CAAC;EACvCwB,IAAAA,SAAS,GAAGC,cAAc,CACxBV,GAAG,CAAChB,UAAU,EACd,CAAC,EACDE,eAAe,CAACc,GAAG,CAACf,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAC/D,CAAC;MACD+B,YAAY,GAAGD,cAAc,CAACV,GAAG,CAAC7X,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAElD,IAAI,CAACoY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,UAAU,EAAEqC,GAAG,CAACf,QAAQ,CAAC,CAAA;EACjD,GAAC,MAAM,IAAI,CAACwB,SAAS,EAAE;EACrB,IAAA,OAAO9C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAChB,UAAU,CAAC,CAAA;EAC/C,GAAC,MAAM,IAAI,CAAC2B,YAAY,EAAE;EACxB,IAAA,OAAOhD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC7X,OAAO,CAAC,CAAA;KAC9C,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASyY,qBAAqBA,CAACZ,GAAG,EAAE;EACzC,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;EACnC+Y,IAAAA,YAAY,GAAGH,cAAc,CAACV,GAAG,CAAC1B,OAAO,EAAE,CAAC,EAAEkB,UAAU,CAACQ,GAAG,CAAClY,IAAI,CAAC,CAAC,CAAA;IAErE,IAAI,CAACyY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC+Y,YAAY,EAAE;EACxB,IAAA,OAAOlD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC1B,OAAO,CAAC,CAAA;KAC9C,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASwC,uBAAuBA,CAACd,GAAG,EAAE;EAC3C,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;MACnCiZ,UAAU,GAAGL,cAAc,CAACV,GAAG,CAACjY,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;EAC7CiZ,IAAAA,QAAQ,GAAGN,cAAc,CAACV,GAAG,CAAChY,GAAG,EAAE,CAAC,EAAEiZ,WAAW,CAACjB,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,CAAC,CAAC,CAAA;IAEzE,IAAI,CAACwY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAACiZ,UAAU,EAAE;EACtB,IAAA,OAAOpD,cAAc,CAAC,OAAO,EAAEqC,GAAG,CAACjY,KAAK,CAAC,CAAA;EAC3C,GAAC,MAAM,IAAI,CAACiZ,QAAQ,EAAE;EACpB,IAAA,OAAOrD,cAAc,CAAC,KAAK,EAAEqC,GAAG,CAAChY,GAAG,CAAC,CAAA;KACtC,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASkZ,kBAAkBA,CAAClB,GAAG,EAAE;EACtC,EAAA,IAAQzX,IAAI,GAAkCyX,GAAG,CAAzCzX,IAAI;MAAEC,MAAM,GAA0BwX,GAAG,CAAnCxX,MAAM;MAAEE,MAAM,GAAkBsX,GAAG,CAA3BtX,MAAM;MAAEmG,WAAW,GAAKmR,GAAG,CAAnBnR,WAAW,CAAA;IACzC,IAAMsS,SAAS,GACXT,cAAc,CAACnY,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAC1BA,IAAI,KAAK,EAAE,IAAIC,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAC,IAAImG,WAAW,KAAK,CAAE;MACpEuS,WAAW,GAAGV,cAAc,CAAClY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;MAC3C6Y,WAAW,GAAGX,cAAc,CAAChY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;MAC3C4Y,gBAAgB,GAAGZ,cAAc,CAAC7R,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAExD,IAAI,CAACsS,SAAS,EAAE;EACd,IAAA,OAAOxD,cAAc,CAAC,MAAM,EAAEpV,IAAI,CAAC,CAAA;EACrC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;EACvB,IAAA,OAAOzD,cAAc,CAAC,QAAQ,EAAEnV,MAAM,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;EACvB,IAAA,OAAO1D,cAAc,CAAC,QAAQ,EAAEjV,MAAM,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC4Y,gBAAgB,EAAE;EAC5B,IAAA,OAAO3D,cAAc,CAAC,aAAa,EAAE9O,WAAW,CAAC,CAAA;KAClD,MAAM,OAAO,KAAK,CAAA;EACrB;;ECnMA;EACA;EACA;;EAEA;;EAEO,SAAStB,WAAWA,CAACgU,CAAC,EAAE;IAC7B,OAAO,OAAOA,CAAC,KAAK,WAAW,CAAA;EACjC,CAAA;EAEO,SAAShH,QAAQA,CAACgH,CAAC,EAAE;IAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;EAC9B,CAAA;EAEO,SAASf,SAASA,CAACe,CAAC,EAAE;IAC3B,OAAO,OAAOA,CAAC,KAAK,QAAQ,IAAIA,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;EAC7C,CAAA;EAEO,SAASlH,QAAQA,CAACkH,CAAC,EAAE;IAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;EAC9B,CAAA;EAEO,SAASC,MAAMA,CAACD,CAAC,EAAE;IACxB,OAAOjO,MAAM,CAACxJ,SAAS,CAAC2P,QAAQ,CAAC9S,IAAI,CAAC4a,CAAC,CAAC,KAAK,eAAe,CAAA;EAC9D,CAAA;;EAEA;;EAEO,SAASxM,WAAWA,GAAG;IAC5B,IAAI;MACF,OAAO,OAAO3J,IAAI,KAAK,WAAW,IAAI,CAAC,CAACA,IAAI,CAAC+E,kBAAkB,CAAA;KAChE,CAAC,OAAOlC,CAAC,EAAE;EACV,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;EACF,CAAA;EAEO,SAASmL,iBAAiBA,GAAG;IAClC,IAAI;MACF,OACE,OAAOhO,IAAI,KAAK,WAAW,IAC3B,CAAC,CAACA,IAAI,CAACuF,MAAM,KACZ,UAAU,IAAIvF,IAAI,CAACuF,MAAM,CAAC7G,SAAS,IAAI,aAAa,IAAIsB,IAAI,CAACuF,MAAM,CAAC7G,SAAS,CAAC,CAAA;KAElF,CAAC,OAAOmE,CAAC,EAAE;EACV,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASwT,UAAUA,CAACC,KAAK,EAAE;IAChC,OAAOC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAC,CAAA;EAC/C,CAAA;EAEO,SAASG,MAAMA,CAACC,GAAG,EAAEC,EAAE,EAAEC,OAAO,EAAE;EACvC,EAAA,IAAIF,GAAG,CAAC3U,MAAM,KAAK,CAAC,EAAE;EACpB,IAAA,OAAOtB,SAAS,CAAA;EAClB,GAAA;IACA,OAAOiW,GAAG,CAACG,MAAM,CAAC,UAACC,IAAI,EAAEC,IAAI,EAAK;MAChC,IAAMC,IAAI,GAAG,CAACL,EAAE,CAACI,IAAI,CAAC,EAAEA,IAAI,CAAC,CAAA;MAC7B,IAAI,CAACD,IAAI,EAAE;EACT,MAAA,OAAOE,IAAI,CAAA;EACb,KAAC,MAAM,IAAIJ,OAAO,CAACE,IAAI,CAAC,CAAC,CAAC,EAAEE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAKF,IAAI,CAAC,CAAC,CAAC,EAAE;EAChD,MAAA,OAAOA,IAAI,CAAA;EACb,KAAC,MAAM;EACL,MAAA,OAAOE,IAAI,CAAA;EACb,KAAA;EACF,GAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;EACb,CAAA;EAEO,SAASC,IAAIA,CAACrC,GAAG,EAAEzM,IAAI,EAAE;IAC9B,OAAOA,IAAI,CAAC0O,MAAM,CAAC,UAACK,CAAC,EAAEC,CAAC,EAAK;EAC3BD,IAAAA,CAAC,CAACC,CAAC,CAAC,GAAGvC,GAAG,CAACuC,CAAC,CAAC,CAAA;EACb,IAAA,OAAOD,CAAC,CAAA;KACT,EAAE,EAAE,CAAC,CAAA;EACR,CAAA;EAEO,SAASE,cAAcA,CAACxC,GAAG,EAAEyC,IAAI,EAAE;IACxC,OAAOnP,MAAM,CAACxJ,SAAS,CAAC0Y,cAAc,CAAC7b,IAAI,CAACqZ,GAAG,EAAEyC,IAAI,CAAC,CAAA;EACxD,CAAA;EAEO,SAASrM,oBAAoBA,CAACsM,QAAQ,EAAE;IAC7C,IAAIA,QAAQ,IAAI,IAAI,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM,IAAI,OAAOA,QAAQ,KAAK,QAAQ,EAAE;EACvC,IAAA,MAAM,IAAIpb,oBAAoB,CAAC,iCAAiC,CAAC,CAAA;EACnE,GAAC,MAAM;EACL,IAAA,IACE,CAACoZ,cAAc,CAACgC,QAAQ,CAACrN,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,IACxC,CAACqL,cAAc,CAACgC,QAAQ,CAACpN,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,IAC3C,CAACqM,KAAK,CAACC,OAAO,CAACc,QAAQ,CAACnN,OAAO,CAAC,IAChCmN,QAAQ,CAACnN,OAAO,CAACoN,IAAI,CAAC,UAACC,CAAC,EAAA;QAAA,OAAK,CAAClC,cAAc,CAACkC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EAAA,KAAA,CAAC,EACtD;EACA,MAAA,MAAM,IAAItb,oBAAoB,CAAC,uBAAuB,CAAC,CAAA;EACzD,KAAA;MACA,OAAO;QACL+N,QAAQ,EAAEqN,QAAQ,CAACrN,QAAQ;QAC3BC,WAAW,EAAEoN,QAAQ,CAACpN,WAAW;EACjCC,MAAAA,OAAO,EAAEoM,KAAK,CAACkB,IAAI,CAACH,QAAQ,CAACnN,OAAO,CAAA;OACrC,CAAA;EACH,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASmL,cAAcA,CAACgB,KAAK,EAAEoB,MAAM,EAAEC,GAAG,EAAE;IACjD,OAAOvC,SAAS,CAACkB,KAAK,CAAC,IAAIA,KAAK,IAAIoB,MAAM,IAAIpB,KAAK,IAAIqB,GAAG,CAAA;EAC5D,CAAA;;EAEA;EACO,SAASC,QAAQA,CAACC,CAAC,EAAEvb,CAAC,EAAE;IAC7B,OAAOub,CAAC,GAAGvb,CAAC,GAAG8G,IAAI,CAAC2E,KAAK,CAAC8P,CAAC,GAAGvb,CAAC,CAAC,CAAA;EAClC,CAAA;EAEO,SAASmM,QAAQA,CAACsG,KAAK,EAAEzS,CAAC,EAAM;EAAA,EAAA,IAAPA,CAAC,KAAA,KAAA,CAAA,EAAA;EAADA,IAAAA,CAAC,GAAG,CAAC,CAAA;EAAA,GAAA;EACnC,EAAA,IAAMwb,KAAK,GAAG/I,KAAK,GAAG,CAAC,CAAA;EACvB,EAAA,IAAIgJ,MAAM,CAAA;EACV,EAAA,IAAID,KAAK,EAAE;EACTC,IAAAA,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,CAAChJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;EAC/C,GAAC,MAAM;MACLyb,MAAM,GAAG,CAAC,EAAE,GAAGhJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;EACxC,GAAA;EACA,EAAA,OAAOyb,MAAM,CAAA;EACf,CAAA;EAEO,SAASC,YAAYA,CAACC,MAAM,EAAE;EACnC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;EAC3D,IAAA,OAAOxX,SAAS,CAAA;EAClB,GAAC,MAAM;EACL,IAAA,OAAO2B,QAAQ,CAAC6V,MAAM,EAAE,EAAE,CAAC,CAAA;EAC7B,GAAA;EACF,CAAA;EAEO,SAASC,aAAaA,CAACD,MAAM,EAAE;EACpC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;EAC3D,IAAA,OAAOxX,SAAS,CAAA;EAClB,GAAC,MAAM;MACL,OAAO0X,UAAU,CAACF,MAAM,CAAC,CAAA;EAC3B,GAAA;EACF,CAAA;EAEO,SAASG,WAAWA,CAACC,QAAQ,EAAE;EACpC;EACA,EAAA,IAAIlW,WAAW,CAACkW,QAAQ,CAAC,IAAIA,QAAQ,KAAK,IAAI,IAAIA,QAAQ,KAAK,EAAE,EAAE;EACjE,IAAA,OAAO5X,SAAS,CAAA;EAClB,GAAC,MAAM;MACL,IAAMmG,CAAC,GAAGuR,UAAU,CAAC,IAAI,GAAGE,QAAQ,CAAC,GAAG,IAAI,CAAA;EAC5C,IAAA,OAAOjV,IAAI,CAAC2E,KAAK,CAACnB,CAAC,CAAC,CAAA;EACtB,GAAA;EACF,CAAA;EAEO,SAAS4B,OAAOA,CAAC8P,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAY;EAAA,EAAA,IAApBA,QAAQ,KAAA,KAAA,CAAA,EAAA;EAARA,IAAAA,QAAQ,GAAG,OAAO,CAAA;EAAA,GAAA;IACxD,IAAMC,MAAM,GAAArV,IAAA,CAAAsV,GAAA,CAAG,EAAE,EAAIH,MAAM,CAAA,CAAA;EAC3B,EAAA,QAAQC,QAAQ;EACd,IAAA,KAAK,QAAQ;QACX,OAAOF,MAAM,GAAG,CAAC,GACblV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,GACnCrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC1C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAACwV,KAAK,CAACN,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAACyV,KAAK,CAACP,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,MAAM;QACT,OAAOrV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC5C,IAAA;EACE,MAAA,MAAM,IAAIK,UAAU,CAAmBN,iBAAAA,GAAAA,QAAQ,qBAAkB,CAAC,CAAA;EACtE,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASxF,UAAUA,CAACtW,IAAI,EAAE;EAC/B,EAAA,OAAOA,IAAI,GAAG,CAAC,KAAK,CAAC,KAAKA,IAAI,GAAG,GAAG,KAAK,CAAC,IAAIA,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAA;EACjE,CAAA;EAEO,SAAS0X,UAAUA,CAAC1X,IAAI,EAAE;EAC/B,EAAA,OAAOsW,UAAU,CAACtW,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;EACrC,CAAA;EAEO,SAASmZ,WAAWA,CAACnZ,IAAI,EAAEC,KAAK,EAAE;IACvC,IAAMoc,QAAQ,GAAGnB,QAAQ,CAACjb,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;MAC1Cqc,OAAO,GAAGtc,IAAI,GAAG,CAACC,KAAK,GAAGoc,QAAQ,IAAI,EAAE,CAAA;IAE1C,IAAIA,QAAQ,KAAK,CAAC,EAAE;EAClB,IAAA,OAAO/F,UAAU,CAACgG,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;EACtC,GAAC,MAAM;EACL,IAAA,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAACD,QAAQ,GAAG,CAAC,CAAC,CAAA;EACzE,GAAA;EACF,CAAA;;EAEA;EACO,SAASvV,YAAYA,CAACoR,GAAG,EAAE;EAChC,EAAA,IAAInC,CAAC,GAAG5S,IAAI,CAAC6S,GAAG,CACdkC,GAAG,CAAClY,IAAI,EACRkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EACbiY,GAAG,CAAChY,GAAG,EACPgY,GAAG,CAACzX,IAAI,EACRyX,GAAG,CAACxX,MAAM,EACVwX,GAAG,CAACtX,MAAM,EACVsX,GAAG,CAACnR,WACN,CAAC,CAAA;;EAED;IACA,IAAImR,GAAG,CAAClY,IAAI,GAAG,GAAG,IAAIkY,GAAG,CAAClY,IAAI,IAAI,CAAC,EAAE;EACnC+V,IAAAA,CAAC,GAAG,IAAI5S,IAAI,CAAC4S,CAAC,CAAC,CAAA;EACf;EACA;EACA;EACAA,IAAAA,CAAC,CAACE,cAAc,CAACiC,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EAAEiY,GAAG,CAAChY,GAAG,CAAC,CAAA;EACpD,GAAA;EACA,EAAA,OAAO,CAAC6V,CAAC,CAAA;EACX,CAAA;;EAEA;EACA,SAASwG,eAAeA,CAACvc,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,EAAE;EAC9D,EAAA,IAAM0F,KAAK,GAAG5F,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAE,CAAC,EAAEiX,kBAAkB,CAAC,EAAEH,WAAW,CAAC,CAAA;EACpF,EAAA,OAAO,CAAC0F,KAAK,GAAGvF,kBAAkB,GAAG,CAAC,CAAA;EACxC,CAAA;EAEO,SAASG,eAAeA,CAACD,QAAQ,EAAEF,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;IAC/E,IAAM2F,UAAU,GAAGF,eAAe,CAACpF,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;IAC7E,IAAM4F,cAAc,GAAGH,eAAe,CAACpF,QAAQ,GAAG,CAAC,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;IACrF,OAAO,CAACY,UAAU,CAACP,QAAQ,CAAC,GAAGsF,UAAU,GAAGC,cAAc,IAAI,CAAC,CAAA;EACjE,CAAA;EAEO,SAASC,cAAcA,CAAC3c,IAAI,EAAE;IACnC,IAAIA,IAAI,GAAG,EAAE,EAAE;EACb,IAAA,OAAOA,IAAI,CAAA;EACb,GAAC,MAAM,OAAOA,IAAI,GAAG8N,QAAQ,CAACsH,kBAAkB,GAAG,IAAI,GAAGpV,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;EAC9E,CAAA;;EAEA;;EAEO,SAASkD,aAAaA,CAAChB,EAAE,EAAE0a,YAAY,EAAE3Z,MAAM,EAAEQ,QAAQ,EAAS;EAAA,EAAA,IAAjBA,QAAQ,KAAA,KAAA,CAAA,EAAA;EAARA,IAAAA,QAAQ,GAAG,IAAI,CAAA;EAAA,GAAA;EACrE,EAAA,IAAMY,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC;EACvBwJ,IAAAA,QAAQ,GAAG;EACTzK,MAAAA,SAAS,EAAE,KAAK;EAChBjB,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,KAAK,EAAE,SAAS;EAChBC,MAAAA,GAAG,EAAE,SAAS;EACdO,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,MAAM,EAAE,SAAA;OACT,CAAA;EAEH,EAAA,IAAI+C,QAAQ,EAAE;MACZiI,QAAQ,CAACjI,QAAQ,GAAGA,QAAQ,CAAA;EAC9B,GAAA;IAEA,IAAMoZ,QAAQ,GAAA7T,QAAA,CAAA;EAAKlI,IAAAA,YAAY,EAAE8b,YAAAA;EAAY,GAAA,EAAKlR,QAAQ,CAAE,CAAA;IAE5D,IAAMlH,MAAM,GAAG,IAAIlB,IAAI,CAACC,cAAc,CAACN,MAAM,EAAE4Z,QAAQ,CAAC,CACrD3X,aAAa,CAACb,IAAI,CAAC,CACnByM,IAAI,CAAC,UAACC,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAK,cAAc,CAAA;KAAC,CAAA,CAAA;EACvD,EAAA,OAAOxM,MAAM,GAAGA,MAAM,CAACe,KAAK,GAAG,IAAI,CAAA;EACrC,CAAA;;EAEA;EACO,SAAS2M,YAAYA,CAAC4K,UAAU,EAAEC,YAAY,EAAE;EACrD,EAAA,IAAIC,OAAO,GAAGtX,QAAQ,CAACoX,UAAU,EAAE,EAAE,CAAC,CAAA;;EAEtC;EACA,EAAA,IAAIG,MAAM,CAAC1W,KAAK,CAACyW,OAAO,CAAC,EAAE;EACzBA,IAAAA,OAAO,GAAG,CAAC,CAAA;EACb,GAAA;IAEA,IAAME,MAAM,GAAGxX,QAAQ,CAACqX,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC;EAC5CI,IAAAA,YAAY,GAAGH,OAAO,GAAG,CAAC,IAAIxR,MAAM,CAAC4R,EAAE,CAACJ,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAACE,MAAM,GAAGA,MAAM,CAAA;EACzE,EAAA,OAAOF,OAAO,GAAG,EAAE,GAAGG,YAAY,CAAA;EACpC,CAAA;;EAEA;;EAEO,SAASE,QAAQA,CAAC9X,KAAK,EAAE;EAC9B,EAAA,IAAM+X,YAAY,GAAGL,MAAM,CAAC1X,KAAK,CAAC,CAAA;IAClC,IAAI,OAAOA,KAAK,KAAK,SAAS,IAAIA,KAAK,KAAK,EAAE,IAAI,CAAC0X,MAAM,CAACM,QAAQ,CAACD,YAAY,CAAC,EAC9E,MAAM,IAAI9d,oBAAoB,CAAuB+F,qBAAAA,GAAAA,KAAO,CAAC,CAAA;EAC/D,EAAA,OAAO+X,YAAY,CAAA;EACrB,CAAA;EAEO,SAASE,eAAeA,CAACtF,GAAG,EAAEuF,UAAU,EAAE;IAC/C,IAAMC,UAAU,GAAG,EAAE,CAAA;EACrB,EAAA,KAAK,IAAMC,CAAC,IAAIzF,GAAG,EAAE;EACnB,IAAA,IAAIwC,cAAc,CAACxC,GAAG,EAAEyF,CAAC,CAAC,EAAE;EAC1B,MAAA,IAAM7C,CAAC,GAAG5C,GAAG,CAACyF,CAAC,CAAC,CAAA;EAChB,MAAA,IAAI7C,CAAC,KAAK/W,SAAS,IAAI+W,CAAC,KAAK,IAAI,EAAE,SAAA;QACnC4C,UAAU,CAACD,UAAU,CAACE,CAAC,CAAC,CAAC,GAAGN,QAAQ,CAACvC,CAAC,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;EACA,EAAA,OAAO4C,UAAU,CAAA;EACnB,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACO,SAAStb,YAAYA,CAACE,MAAM,EAAED,MAAM,EAAE;EAC3C,EAAA,IAAMub,KAAK,GAAGlX,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;EAC7CiK,IAAAA,OAAO,GAAG7F,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;EAC3Cub,IAAAA,IAAI,GAAGvb,MAAM,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;EAEhC,EAAA,QAAQD,MAAM;EACZ,IAAA,KAAK,OAAO;EACV,MAAA,OAAA,EAAA,GAAUwb,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAA,GAAA,GAAI7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;EAC7D,IAAA,KAAK,QAAQ;QACX,OAAUsR,EAAAA,GAAAA,IAAI,GAAGD,KAAK,IAAGrR,OAAO,GAAG,CAAC,GAAA,GAAA,GAAOA,OAAO,GAAK,EAAE,CAAA,CAAA;EAC3D,IAAA,KAAK,QAAQ;EACX,MAAA,OAAA,EAAA,GAAUsR,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAG7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;EAC5D,IAAA;EACE,MAAA,MAAM,IAAI6P,UAAU,CAAiB/Z,eAAAA,GAAAA,MAAM,yCAAsC,CAAC,CAAA;EACtF,GAAA;EACF,CAAA;EAEO,SAASgV,UAAUA,CAACa,GAAG,EAAE;EAC9B,EAAA,OAAOqC,IAAI,CAACrC,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAA;EAC/D;;EClUA;EACA;EACA;;EAEO,IAAM4F,UAAU,GAAG,CACxB,SAAS,EACT,UAAU,EACV,OAAO,EACP,OAAO,EACP,KAAK,EACL,MAAM,EACN,MAAM,EACN,QAAQ,EACR,WAAW,EACX,SAAS,EACT,UAAU,EACV,UAAU,CACX,CAAA;EAEM,IAAMC,WAAW,GAAG,CACzB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,CACN,CAAA;EAEM,IAAMC,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAEjF,SAASnO,MAAMA,CAACxK,MAAM,EAAE;EAC7B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWD,YAAY,CAAA,CAAA;EACzB,IAAA,KAAK,OAAO;QACV,OAAAC,EAAAA,CAAAA,MAAA,CAAWF,WAAW,CAAA,CAAA;EACxB,IAAA,KAAK,MAAM;QACT,OAAAE,EAAAA,CAAAA,MAAA,CAAWH,UAAU,CAAA,CAAA;EACvB,IAAA,KAAK,SAAS;QACZ,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;EACxE,IAAA,KAAK,SAAS;QACZ,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;EACjF,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,IAAMI,YAAY,GAAG,CAC1B,QAAQ,EACR,SAAS,EACT,WAAW,EACX,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,CACT,CAAA;EAEM,IAAMC,aAAa,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;EAEvE,IAAMC,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAE1D,SAAShO,QAAQA,CAAC/K,MAAM,EAAE;EAC/B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWG,cAAc,CAAA,CAAA;EAC3B,IAAA,KAAK,OAAO;QACV,OAAAH,EAAAA,CAAAA,MAAA,CAAWE,aAAa,CAAA,CAAA;EAC1B,IAAA,KAAK,MAAM;QACT,OAAAF,EAAAA,CAAAA,MAAA,CAAWC,YAAY,CAAA,CAAA;EACzB,IAAA,KAAK,SAAS;EACZ,MAAA,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAC5C,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,IAAM5N,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAE9B,IAAM+N,QAAQ,GAAG,CAAC,eAAe,EAAE,aAAa,CAAC,CAAA;EAEjD,IAAMC,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAE9B,IAAMC,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;EAE7B,SAAS/N,IAAIA,CAACnL,MAAM,EAAE;EAC3B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWM,UAAU,CAAA,CAAA;EACvB,IAAA,KAAK,OAAO;QACV,OAAAN,EAAAA,CAAAA,MAAA,CAAWK,SAAS,CAAA,CAAA;EACtB,IAAA,KAAK,MAAM;QACT,OAAAL,EAAAA,CAAAA,MAAA,CAAWI,QAAQ,CAAA,CAAA;EACrB,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,SAASG,mBAAmBA,CAACpU,EAAE,EAAE;IACtC,OAAOkG,SAAS,CAAClG,EAAE,CAAC3J,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EACxC,CAAA;EAEO,SAASge,kBAAkBA,CAACrU,EAAE,EAAE/E,MAAM,EAAE;IAC7C,OAAO+K,QAAQ,CAAC/K,MAAM,CAAC,CAAC+E,EAAE,CAAC/J,OAAO,GAAG,CAAC,CAAC,CAAA;EACzC,CAAA;EAEO,SAASqe,gBAAgBA,CAACtU,EAAE,EAAE/E,MAAM,EAAE;IAC3C,OAAOwK,MAAM,CAACxK,MAAM,CAAC,CAAC+E,EAAE,CAACnK,KAAK,GAAG,CAAC,CAAC,CAAA;EACrC,CAAA;EAEO,SAAS0e,cAAcA,CAACvU,EAAE,EAAE/E,MAAM,EAAE;EACzC,EAAA,OAAOmL,IAAI,CAACnL,MAAM,CAAC,CAAC+E,EAAE,CAACpK,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EAC1C,CAAA;EAEO,SAAS4e,kBAAkBA,CAACrf,IAAI,EAAE6N,KAAK,EAAEE,OAAO,EAAauR,MAAM,EAAU;EAAA,EAAA,IAApCvR,OAAO,KAAA,KAAA,CAAA,EAAA;EAAPA,IAAAA,OAAO,GAAG,QAAQ,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEuR,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,GAAA;EAChF,EAAA,IAAMC,KAAK,GAAG;EACZC,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBC,IAAAA,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;EAC7BnP,IAAAA,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;EACxBoP,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBC,IAAAA,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;EAC5BtB,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBrR,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;EAC3B4S,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAA;KAC3B,CAAA;EAED,EAAA,IAAMC,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC/V,OAAO,CAAC9J,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;EAErE,EAAA,IAAI+N,OAAO,KAAK,MAAM,IAAI8R,QAAQ,EAAE;EAClC,IAAA,IAAMC,KAAK,GAAG9f,IAAI,KAAK,MAAM,CAAA;EAC7B,IAAA,QAAQ6N,KAAK;EACX,MAAA,KAAK,CAAC;UACJ,OAAOiS,KAAK,GAAG,UAAU,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EACtD,MAAA,KAAK,CAAC,CAAC;UACL,OAAO8f,KAAK,GAAG,WAAW,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EACvD,MAAA,KAAK,CAAC;UACJ,OAAO8f,KAAK,GAAG,OAAO,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EAErD,KAAA;EACF,GAAA;;EAEA,EAAA,IAAM+f,QAAQ,GAAG9T,MAAM,CAAC4R,EAAE,CAAChQ,KAAK,EAAE,CAAC,CAAC,CAAC,IAAIA,KAAK,GAAG,CAAC;EAChDmS,IAAAA,QAAQ,GAAG7Y,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC;MAC1BoS,QAAQ,GAAGD,QAAQ,KAAK,CAAC;EACzBE,IAAAA,QAAQ,GAAGX,KAAK,CAACvf,IAAI,CAAC;EACtBmgB,IAAAA,OAAO,GAAGb,MAAM,GACZW,QAAQ,GACNC,QAAQ,CAAC,CAAC,CAAC,GACXA,QAAQ,CAAC,CAAC,CAAC,IAAIA,QAAQ,CAAC,CAAC,CAAC,GAC5BD,QAAQ,GACRV,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAC,GACdA,IAAI,CAAA;IACV,OAAO+f,QAAQ,GAAMC,QAAQ,GAAA,GAAA,GAAIG,OAAO,GAAeH,MAAAA,GAAAA,KAAAA,GAAAA,QAAQ,SAAIG,OAAS,CAAA;EAC9E;;ECjKA,SAASC,eAAeA,CAACC,MAAM,EAAEC,aAAa,EAAE;IAC9C,IAAIhgB,CAAC,GAAG,EAAE,CAAA;EACV,EAAA,KAAA,IAAAigB,SAAA,GAAAC,+BAAA,CAAoBH,MAAM,CAAA,EAAAI,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAAjBC,KAAK,GAAAF,KAAA,CAAAza,KAAA,CAAA;MACd,IAAI2a,KAAK,CAACC,OAAO,EAAE;QACjBtgB,CAAC,IAAIqgB,KAAK,CAACE,GAAG,CAAA;EAChB,KAAC,MAAM;EACLvgB,MAAAA,CAAC,IAAIggB,aAAa,CAACK,KAAK,CAACE,GAAG,CAAC,CAAA;EAC/B,KAAA;EACF,GAAA;EACA,EAAA,OAAOvgB,CAAC,CAAA;EACV,CAAA;EAEA,IAAMwgB,uBAAsB,GAAG;IAC7BC,CAAC,EAAEC,UAAkB;IACrBC,EAAE,EAAED,QAAgB;IACpBE,GAAG,EAAEF,SAAiB;IACtBG,IAAI,EAAEH,SAAiB;IACvB/K,CAAC,EAAE+K,WAAmB;IACtBI,EAAE,EAAEJ,iBAAyB;IAC7BK,GAAG,EAAEL,sBAA8B;IACnCM,IAAI,EAAEN,qBAA6B;IACnCO,CAAC,EAAEP,cAAsB;IACzBQ,EAAE,EAAER,oBAA4B;IAChCS,GAAG,EAAET,yBAAiC;IACtCU,IAAI,EAAEV,wBAAgC;IACtCrW,CAAC,EAAEqW,cAAsB;IACzBW,EAAE,EAAEX,YAAoB;IACxBY,GAAG,EAAEZ,aAAqB;IAC1Ba,IAAI,EAAEb,aAAqB;IAC3Bc,CAAC,EAAEd,2BAAmC;IACtCe,EAAE,EAAEf,yBAAiC;IACrCgB,GAAG,EAAEhB,0BAAkC;IACvCiB,IAAI,EAAEjB,0BAAQ1e;EAChB,CAAC,CAAA;;EAED;EACA;EACA;EAFA,IAIqB4f,SAAS,gBAAA,YAAA;IAAAA,SAAA,CACrB5b,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAEd,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,OAAO,IAAIsf,SAAS,CAACxe,MAAM,EAAEd,IAAI,CAAC,CAAA;KACnC,CAAA;EAAAsf,EAAAA,SAAA,CAEMC,WAAW,GAAlB,SAAAA,WAAAA,CAAmBC,GAAG,EAAE;EACtB;EACA;;MAEA,IAAIC,OAAO,GAAG,IAAI;EAChBC,MAAAA,WAAW,GAAG,EAAE;EAChBC,MAAAA,SAAS,GAAG,KAAK,CAAA;MACnB,IAAMlC,MAAM,GAAG,EAAE,CAAA;EACjB,IAAA,KAAK,IAAIxa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuc,GAAG,CAACtc,MAAM,EAAED,CAAC,EAAE,EAAE;EACnC,MAAA,IAAM2c,CAAC,GAAGJ,GAAG,CAACK,MAAM,CAAC5c,CAAC,CAAC,CAAA;QACvB,IAAI2c,CAAC,KAAK,GAAG,EAAE;EACb;EACA,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,IAAIyc,SAAS,EAAE;YACvClC,MAAM,CAACrV,IAAI,CAAC;cACV4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;EAC/CzB,YAAAA,GAAG,EAAEyB,WAAW,KAAK,EAAE,GAAG,GAAG,GAAGA,WAAAA;EAClC,WAAC,CAAC,CAAA;EACJ,SAAA;EACAD,QAAAA,OAAO,GAAG,IAAI,CAAA;EACdC,QAAAA,WAAW,GAAG,EAAE,CAAA;UAChBC,SAAS,GAAG,CAACA,SAAS,CAAA;SACvB,MAAM,IAAIA,SAAS,EAAE;EACpBD,QAAAA,WAAW,IAAIE,CAAC,CAAA;EAClB,OAAC,MAAM,IAAIA,CAAC,KAAKH,OAAO,EAAE;EACxBC,QAAAA,WAAW,IAAIE,CAAC,CAAA;EAClB,OAAC,MAAM;EACL,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;YAC1Bua,MAAM,CAACrV,IAAI,CAAC;EAAE4V,YAAAA,OAAO,EAAE,OAAO,CAAC8B,IAAI,CAACJ,WAAW,CAAC;EAAEzB,YAAAA,GAAG,EAAEyB,WAAAA;EAAY,WAAC,CAAC,CAAA;EACvE,SAAA;EACAA,QAAAA,WAAW,GAAGE,CAAC,CAAA;EACfH,QAAAA,OAAO,GAAGG,CAAC,CAAA;EACb,OAAA;EACF,KAAA;EAEA,IAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;QAC1Bua,MAAM,CAACrV,IAAI,CAAC;UAAE4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;EAAEzB,QAAAA,GAAG,EAAEyB,WAAAA;EAAY,OAAC,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,OAAOjC,MAAM,CAAA;KACd,CAAA;EAAA6B,EAAAA,SAAA,CAEMpB,sBAAsB,GAA7B,SAAAA,sBAAAA,CAA8BH,KAAK,EAAE;MACnC,OAAOG,uBAAsB,CAACH,KAAK,CAAC,CAAA;KACrC,CAAA;EAED,EAAA,SAAAuB,SAAYxe,CAAAA,MAAM,EAAEif,UAAU,EAAE;MAC9B,IAAI,CAAC/f,IAAI,GAAG+f,UAAU,CAAA;MACtB,IAAI,CAACxX,GAAG,GAAGzH,MAAM,CAAA;MACjB,IAAI,CAACkf,SAAS,GAAG,IAAI,CAAA;EACvB,GAAA;EAAC,EAAA,IAAApgB,MAAA,GAAA0f,SAAA,CAAAzf,SAAA,CAAA;IAAAD,MAAA,CAEDqgB,uBAAuB,GAAvB,SAAAA,wBAAwBhY,EAAE,EAAEjI,IAAI,EAAE;EAChC,IAAA,IAAI,IAAI,CAACggB,SAAS,KAAK,IAAI,EAAE;QAC3B,IAAI,CAACA,SAAS,GAAG,IAAI,CAACzX,GAAG,CAACkF,iBAAiB,EAAE,CAAA;EAC/C,KAAA;EACA,IAAA,IAAMe,EAAE,GAAG,IAAI,CAACwR,SAAS,CAAChS,WAAW,CAAC/F,EAAE,EAAApB,QAAA,KAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;EACpE,IAAA,OAAOwO,EAAE,CAACtO,MAAM,EAAE,CAAA;KACnB,CAAA;IAAAN,MAAA,CAEDoO,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEjI,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACvB,IAAA,OAAO,IAAI,CAACuI,GAAG,CAACyF,WAAW,CAAC/F,EAAE,EAAApB,QAAA,CAAA,EAAA,EAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;KAC3D,CAAA;IAAAJ,MAAA,CAEDsgB,cAAc,GAAd,SAAAA,eAAejY,EAAE,EAAEjI,IAAI,EAAE;MACvB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACE,MAAM,EAAE,CAAA;KAC3C,CAAA;IAAAN,MAAA,CAEDugB,mBAAmB,GAAnB,SAAAA,oBAAoBlY,EAAE,EAAEjI,IAAI,EAAE;MAC5B,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAAC+C,aAAa,EAAE,CAAA;KAClD,CAAA;IAAAnD,MAAA,CAEDwgB,cAAc,GAAd,SAAAA,eAAeC,QAAQ,EAAErgB,IAAI,EAAE;MAC7B,IAAMwO,EAAE,GAAG,IAAI,CAACR,WAAW,CAACqS,QAAQ,CAACC,KAAK,EAAEtgB,IAAI,CAAC,CAAA;MACjD,OAAOwO,EAAE,CAAC7M,GAAG,CAAC4e,WAAW,CAACF,QAAQ,CAACC,KAAK,CAAC9V,QAAQ,EAAE,EAAE6V,QAAQ,CAACG,GAAG,CAAChW,QAAQ,EAAE,CAAC,CAAA;KAC9E,CAAA;IAAA5K,MAAA,CAEDyB,eAAe,GAAf,SAAAA,gBAAgB4G,EAAE,EAAEjI,IAAI,EAAE;MACxB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACqB,eAAe,EAAE,CAAA;KACpD,CAAA;IAAAzB,MAAA,CAED6gB,GAAG,GAAH,SAAAA,GAAAA,CAAIhjB,CAAC,EAAEijB,CAAC,EAAMC,WAAW,EAAc;EAAA,IAAA,IAAhCD,CAAC,KAAA,KAAA,CAAA,EAAA;EAADA,MAAAA,CAAC,GAAG,CAAC,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEC,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG/e,SAAS,CAAA;EAAA,KAAA;EACnC;EACA,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACgJ,WAAW,EAAE;EACzB,MAAA,OAAOY,QAAQ,CAACnM,CAAC,EAAEijB,CAAC,CAAC,CAAA;EACvB,KAAA;EAEA,IAAA,IAAM1gB,IAAI,GAAA6G,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;MAE7B,IAAI0gB,CAAC,GAAG,CAAC,EAAE;QACT1gB,IAAI,CAACiJ,KAAK,GAAGyX,CAAC,CAAA;EAChB,KAAA;EACA,IAAA,IAAIC,WAAW,EAAE;QACf3gB,IAAI,CAAC2gB,WAAW,GAAGA,WAAW,CAAA;EAChC,KAAA;EAEA,IAAA,OAAO,IAAI,CAACpY,GAAG,CAACuG,eAAe,CAAC9O,IAAI,CAAC,CAACE,MAAM,CAACzC,CAAC,CAAC,CAAA;KAChD,CAAA;IAAAmC,MAAA,CAEDghB,wBAAwB,GAAxB,SAAAA,yBAAyB3Y,EAAE,EAAEuX,GAAG,EAAE;EAAA,IAAA,IAAAvb,KAAA,GAAA,IAAA,CAAA;MAChC,IAAM4c,YAAY,GAAG,IAAI,CAACtY,GAAG,CAACI,WAAW,EAAE,KAAK,IAAI;EAClDmY,MAAAA,oBAAoB,GAAG,IAAI,CAACvY,GAAG,CAACX,cAAc,IAAI,IAAI,CAACW,GAAG,CAACX,cAAc,KAAK,SAAS;EACvFwR,MAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIpZ,IAAI,EAAE+N,OAAO,EAAA;UAAA,OAAK9J,KAAI,CAACsE,GAAG,CAACwF,OAAO,CAAC9F,EAAE,EAAEjI,IAAI,EAAE+N,OAAO,CAAC,CAAA;EAAA,OAAA;EAC/D9N,MAAAA,YAAY,GAAG,SAAfA,YAAYA,CAAID,IAAI,EAAK;EACvB,QAAA,IAAIiI,EAAE,CAAC8Y,aAAa,IAAI9Y,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIH,IAAI,CAACghB,MAAM,EAAE;EACtD,UAAA,OAAO,GAAG,CAAA;EACZ,SAAA;EAEA,QAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GAAGhZ,EAAE,CAACtE,IAAI,CAAC1D,YAAY,CAACgI,EAAE,CAAClI,EAAE,EAAEC,IAAI,CAACE,MAAM,CAAC,GAAG,EAAE,CAAA;SAClE;QACDghB,QAAQ,GAAG,SAAXA,QAAQA,GAAA;UAAA,OACNL,YAAY,GACR3V,mBAA2B,CAACjD,EAAE,CAAC,GAC/BmR,MAAM,CAAC;EAAE9a,UAAAA,IAAI,EAAE,SAAS;EAAEQ,UAAAA,SAAS,EAAE,KAAA;WAAO,EAAE,WAAW,CAAC,CAAA;EAAA,OAAA;EAChEhB,MAAAA,KAAK,GAAG,SAARA,KAAKA,CAAIoF,MAAM,EAAE2J,UAAU,EAAA;EAAA,QAAA,OACzBgU,YAAY,GACR3V,gBAAwB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACpCkW,MAAM,CAACvM,UAAU,GAAG;EAAE/O,UAAAA,KAAK,EAAEoF,MAAAA;EAAO,SAAC,GAAG;EAAEpF,UAAAA,KAAK,EAAEoF,MAAM;EAAEnF,UAAAA,GAAG,EAAE,SAAA;WAAW,EAAE,OAAO,CAAC,CAAA;EAAA,OAAA;EACzFG,MAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAIgF,MAAM,EAAE2J,UAAU,EAAA;EAAA,QAAA,OAC3BgU,YAAY,GACR3V,kBAA0B,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACtCkW,MAAM,CACJvM,UAAU,GAAG;EAAE3O,UAAAA,OAAO,EAAEgF,MAAAA;EAAO,SAAC,GAAG;EAAEhF,UAAAA,OAAO,EAAEgF,MAAM;EAAEpF,UAAAA,KAAK,EAAE,MAAM;EAAEC,UAAAA,GAAG,EAAE,SAAA;WAAW,EACrF,SACF,CAAC,CAAA;EAAA,OAAA;EACPojB,MAAAA,UAAU,GAAG,SAAbA,UAAUA,CAAIpD,KAAK,EAAK;EACtB,QAAA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAAC,CAAA;EAC1D,QAAA,IAAIgC,UAAU,EAAE;EACd,UAAA,OAAO9b,KAAI,CAACgc,uBAAuB,CAAChY,EAAE,EAAE8X,UAAU,CAAC,CAAA;EACrD,SAAC,MAAM;EACL,UAAA,OAAOhC,KAAK,CAAA;EACd,SAAA;SACD;EACDjc,MAAAA,GAAG,GAAG,SAANA,GAAGA,CAAIoB,MAAM,EAAA;EAAA,QAAA,OACX2d,YAAY,GAAG3V,cAAsB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GAAGkW,MAAM,CAAC;EAAEtX,UAAAA,GAAG,EAAEoB,MAAAA;WAAQ,EAAE,KAAK,CAAC,CAAA;EAAA,OAAA;EACpFwa,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIK,KAAK,EAAK;EACzB;EACA,QAAA,QAAQA,KAAK;EACX;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAO9Z,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,CAAC,CAAA;EACjC,UAAA,KAAK,GAAG,CAAA;EACR;EACA,UAAA,KAAK,KAAK;cACR,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,EAAE,CAAC,CAAC,CAAA;EACpC;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,CAAC,CAAA;EAC5B,UAAA,KAAK,IAAI;cACP,OAAOwF,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,EAAE,CAAC,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,IAAI;EACP,YAAA,OAAOwF,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EACrD,UAAA,KAAK,KAAK;EACR,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,GAAG,CAAC,CAAC,CAAA;EACnD;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,CAAC,CAAA;EAC5B,UAAA,KAAK,IAAI;cACP,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,EAAE,CAAC,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,CAAC,CAAA;EACzD,UAAA,KAAK,IAAI;cACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;EAC5D,UAAA,KAAK,GAAG;EACN,YAAA,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,CAAC,CAAA;EAC1B,UAAA,KAAK,IAAI;cACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,EAAE,CAAC,CAAC,CAAA;EAC7B;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAO2B,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,QAAQ;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACrE,UAAA,KAAK,IAAI;EACP;EACA,YAAA,OAAO/gB,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,OAAO;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACpE,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAO/gB,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,QAAQ;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACrE,UAAA,KAAK,MAAM;EACT;cACA,OAAO/Y,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;EAAEG,cAAAA,MAAM,EAAE,OAAO;EAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;EAAO,aAAC,CAAC,CAAA;EAChF,UAAA,KAAK,OAAO;EACV;cACA,OAAOmH,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;EAAEG,cAAAA,MAAM,EAAE,MAAM;EAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;EAAO,aAAC,CAAC,CAAA;EAC/E;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOmH,EAAE,CAACvG,QAAQ,CAAA;EACpB;EACA,UAAA,KAAK,GAAG;cACN,OAAOwf,QAAQ,EAAE,CAAA;EACnB;EACA,UAAA,KAAK,GAAG;cACN,OAAOJ,oBAAoB,GAAG1H,MAAM,CAAC;EAAErb,cAAAA,GAAG,EAAE,SAAA;eAAW,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,CAAC,CAAA;EACpF,UAAA,KAAK,IAAI;cACP,OAAO+iB,oBAAoB,GAAG1H,MAAM,CAAC;EAAErb,cAAAA,GAAG,EAAE,SAAA;EAAU,aAAC,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,EAAE,CAAC,CAAC,CAAA;EACvF;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAOkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;EAC/B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;EAC9B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;EAChC;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAO+F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;EAChC,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;EAC/B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;EACjC;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAO4iB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAS;EAAEC,cAAAA,GAAG,EAAE,SAAA;eAAW,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;EACxB,UAAA,KAAK,IAAI;EACP;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAS;EAAEC,cAAAA,GAAG,EAAE,SAAA;EAAU,aAAC,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;EAC3B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;EAC7B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;EAC5B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;EAC9B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAA;eAAW,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;EACxB,UAAA,KAAK,IAAI;EACP;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAA;EAAU,aAAC,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;EAC3B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;EAC9B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;EAC7B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOgjB,oBAAoB,GAAG1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;eAAW,EAAE,MAAM,CAAC,GAAGoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC,CAAA;EACvF,UAAA,KAAK,IAAI;EACP;cACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;eAAW,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC2R,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/C,UAAA,KAAK,MAAM;EACT;cACA,OAAON,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;EAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;EAC1B,UAAA,KAAK,QAAQ;EACX;cACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;EAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;EAC1B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOiE,GAAG,CAAC,OAAO,CAAC,CAAA;EACrB,UAAA,KAAK,IAAI;EACP;cACA,OAAOA,GAAG,CAAC,MAAM,CAAC,CAAA;EACpB,UAAA,KAAK,OAAO;cACV,OAAOA,GAAG,CAAC,QAAQ,CAAC,CAAA;EACtB,UAAA,KAAK,IAAI;EACP,YAAA,OAAOmC,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,CAACxF,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EACtD,UAAA,KAAK,MAAM;cACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,EAAE,CAAC,CAAC,CAAA;EACjC,UAAA,KAAK,GAAG;EACN,YAAA,OAAO/Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,CAAC,CAAA;EAChC,UAAA,KAAK,IAAI;cACP,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,EAAE,CAAC,CAAC,CAAA;EACnC,UAAA,KAAK,GAAG;EACN,YAAA,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,CAAC,CAAA;EACrC,UAAA,KAAK,IAAI;cACP,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,EAAE,CAAC,CAAC,CAAA;EACxC,UAAA,KAAK,IAAI;EACP,YAAA,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,CAAC3G,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAC3D,UAAA,KAAK,MAAM;cACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,EAAE,CAAC,CAAC,CAAA;EACtC,UAAA,KAAK,GAAG;EACN,YAAA,OAAOlS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;cACR,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,EAAE,CAAC,CAAC,CAAA;EAChC,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,IAAI;EACP;cACA,OAAOpd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,EAAE,CAAC,CAAC,CAAA;EAChC,UAAA,KAAK,GAAG;EACN,YAAA,OAAOpd,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAAClI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;EAC3C,UAAA,KAAK,GAAG;EACN,YAAA,OAAOkE,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClI,EAAE,CAAC,CAAA;EACxB,UAAA;cACE,OAAOohB,UAAU,CAACpD,KAAK,CAAC,CAAA;EAC5B,SAAA;SACD,CAAA;MAEH,OAAOP,eAAe,CAAC8B,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9B,aAAa,CAAC,CAAA;KAClE,CAAA;IAAA9d,MAAA,CAED0hB,wBAAwB,GAAxB,SAAAA,yBAAyBC,GAAG,EAAE/B,GAAG,EAAE;EAAA,IAAA,IAAA7R,MAAA,GAAA,IAAA,CAAA;EACjC,IAAA,IAAM6T,aAAa,GAAG,IAAI,CAACxhB,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;EAC3E,IAAA,IAAMC,YAAY,GAAG,SAAfA,YAAYA,CAAI3D,KAAK,EAAK;UAC5B,QAAQA,KAAK,CAAC,CAAC,CAAC;EACd,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,cAAc,CAAA;EACvB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,SAAS,CAAA;EAClB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,SAAS,CAAA;EAClB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,MAAM,CAAA;EACf,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,QAAQ,CAAA;EACjB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA;EACE,YAAA,OAAO,IAAI,CAAA;EACf,SAAA;SACD;EACDL,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIiE,MAAM,EAAEC,IAAI,EAAA;UAAA,OAAK,UAAC7D,KAAK,EAAK;EAC3C,UAAA,IAAM8D,MAAM,GAAGH,YAAY,CAAC3D,KAAK,CAAC,CAAA;EAClC,UAAA,IAAI8D,MAAM,EAAE;EACV,YAAA,IAAMC,eAAe,GACnBF,IAAI,CAACG,kBAAkB,IAAIF,MAAM,KAAKD,IAAI,CAACI,WAAW,GAAGR,aAAa,GAAG,CAAC,CAAA;EAC5E,YAAA,IAAIb,WAAW,CAAA;EACf,YAAA,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,IAAII,MAAM,KAAKD,IAAI,CAACI,WAAW,EAAE;EAC/ErB,cAAAA,WAAW,GAAG,OAAO,CAAA;eACtB,MAAM,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,KAAK,EAAE;EACvCd,cAAAA,WAAW,GAAG,QAAQ,CAAA;EACxB,aAAC,MAAM;EACL;EACAA,cAAAA,WAAW,GAAG,MAAM,CAAA;EACtB,aAAA;EACA,YAAA,OAAOhT,MAAI,CAAC8S,GAAG,CAACkB,MAAM,CAACnhB,GAAG,CAACqhB,MAAM,CAAC,GAAGC,eAAe,EAAE/D,KAAK,CAAC7a,MAAM,EAAEyd,WAAW,CAAC,CAAA;EAClF,WAAC,MAAM;EACL,YAAA,OAAO5C,KAAK,CAAA;EACd,WAAA;WACD,CAAA;EAAA,OAAA;EACDkE,MAAAA,MAAM,GAAG3C,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC;QACnC0C,UAAU,GAAGD,MAAM,CAACjK,MAAM,CACxB,UAACmK,KAAK,EAAAthB,IAAA,EAAA;EAAA,QAAA,IAAImd,OAAO,GAAAnd,IAAA,CAAPmd,OAAO;YAAEC,GAAG,GAAApd,IAAA,CAAHod,GAAG,CAAA;UAAA,OAAQD,OAAO,GAAGmE,KAAK,GAAGA,KAAK,CAACrG,MAAM,CAACmC,GAAG,CAAC,CAAA;SAAC,EAClE,EACF,CAAC;EACDmE,MAAAA,SAAS,GAAGb,GAAG,CAACc,OAAO,CAAAlmB,KAAA,CAAXolB,GAAG,EAAYW,UAAU,CAAC5X,GAAG,CAACoX,YAAY,CAAC,CAACY,MAAM,CAAC,UAACjP,CAAC,EAAA;EAAA,QAAA,OAAKA,CAAC,CAAA;EAAA,OAAA,CAAC,CAAC;EACzEkP,MAAAA,YAAY,GAAG;UACbR,kBAAkB,EAAEK,SAAS,GAAG,CAAC;EACjC;EACA;UACAJ,WAAW,EAAE3Y,MAAM,CAACC,IAAI,CAAC8Y,SAAS,CAACI,MAAM,CAAC,CAAC,CAAC,CAAA;SAC7C,CAAA;MACH,OAAOhF,eAAe,CAACyE,MAAM,EAAEvE,aAAa,CAAC0E,SAAS,EAAEG,YAAY,CAAC,CAAC,CAAA;KACvE,CAAA;EAAA,EAAA,OAAAjD,SAAA,CAAA;EAAA,CAAA,EAAA;;ECpaH;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA,IAAMmD,SAAS,GAAG,8EAA8E,CAAA;EAEhG,SAASC,cAAcA,GAAa;EAAA,EAAA,KAAA,IAAAC,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAT0f,OAAO,GAAAlL,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAAPD,IAAAA,OAAO,CAAAC,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,GAAA;IAChC,IAAMC,IAAI,GAAGF,OAAO,CAAC5K,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;EAAA,IAAA,OAAK9H,CAAC,GAAG8H,CAAC,CAACkT,MAAM,CAAA;EAAA,GAAA,EAAE,EAAE,CAAC,CAAA;EACvD,EAAA,OAAOhQ,MAAM,CAAA,GAAA,GAAK+P,IAAI,GAAA,GAAG,CAAC,CAAA;EAC5B,CAAA;EAEA,SAASE,iBAAiBA,GAAgB;EAAA,EAAA,KAAA,IAAAC,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAZggB,UAAU,GAAAxL,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAVD,IAAAA,UAAU,CAAAC,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,GAAA;EACtC,EAAA,OAAO,UAACvU,CAAC,EAAA;MAAA,OACPsU,UAAU,CACPlL,MAAM,CACL,UAAAnX,IAAA,EAAmCuiB,EAAE,EAAK;QAAA,IAAxCC,UAAU,GAAAxiB,IAAA,CAAA,CAAA,CAAA;EAAEyiB,QAAAA,UAAU,GAAAziB,IAAA,CAAA,CAAA,CAAA;EAAE0iB,QAAAA,MAAM,GAAA1iB,IAAA,CAAA,CAAA,CAAA,CAAA;EAC9B,MAAA,IAAA2iB,GAAA,GAA0BJ,EAAE,CAACxU,CAAC,EAAE2U,MAAM,CAAC;EAAhCtF,QAAAA,GAAG,GAAAuF,GAAA,CAAA,CAAA,CAAA;EAAE7f,QAAAA,IAAI,GAAA6f,GAAA,CAAA,CAAA,CAAA;EAAEtL,QAAAA,IAAI,GAAAsL,GAAA,CAAA,CAAA,CAAA,CAAA;EACtB,MAAA,OAAO,CAAA3c,QAAA,CAAMwc,EAAAA,EAAAA,UAAU,EAAKpF,GAAG,CAAIta,EAAAA,IAAI,IAAI2f,UAAU,EAAEpL,IAAI,CAAC,CAAA;EAC9D,KAAC,EACD,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CACd,CAAC,CACAkJ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAAA,GAAA,CAAA;EAClB,CAAA;EAEA,SAASqC,KAAKA,CAAC/lB,CAAC,EAAe;IAC7B,IAAIA,CAAC,IAAI,IAAI,EAAE;EACb,IAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EACrB,GAAA;IAAC,KAAAgmB,IAAAA,KAAA,GAAAtnB,SAAA,CAAA8G,MAAA,EAHkBygB,QAAQ,OAAAjM,KAAA,CAAAgM,KAAA,GAAAA,CAAAA,GAAAA,KAAA,WAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAARD,IAAAA,QAAQ,CAAAC,KAAA,GAAAxnB,CAAAA,CAAAA,GAAAA,SAAA,CAAAwnB,KAAA,CAAA,CAAA;EAAA,GAAA;EAK3B,EAAA,KAAA,IAAAC,EAAA,GAAA,CAAA,EAAAC,SAAA,GAAiCH,QAAQ,EAAAE,EAAA,GAAAC,SAAA,CAAA5gB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAtC,IAAA,IAAAE,YAAA,GAAAD,SAAA,CAAAD,EAAA,CAAA;EAAO/Q,MAAAA,KAAK,GAAAiR,YAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,SAAS,GAAAD,YAAA,CAAA,CAAA,CAAA,CAAA;EAC1B,IAAA,IAAMnV,CAAC,GAAGkE,KAAK,CAACxQ,IAAI,CAAC5E,CAAC,CAAC,CAAA;EACvB,IAAA,IAAIkR,CAAC,EAAE;QACL,OAAOoV,SAAS,CAACpV,CAAC,CAAC,CAAA;EACrB,KAAA;EACF,GAAA;EACA,EAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EACrB,CAAA;EAEA,SAASqV,WAAWA,GAAU;EAAA,EAAA,KAAA,IAAAC,KAAA,GAAA9nB,SAAA,CAAA8G,MAAA,EAANoG,IAAI,GAAAoO,IAAAA,KAAA,CAAAwM,KAAA,GAAAC,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA,EAAA,EAAA;EAAJ7a,IAAAA,IAAI,CAAA6a,KAAA,CAAA/nB,GAAAA,SAAA,CAAA+nB,KAAA,CAAA,CAAA;EAAA,GAAA;EAC1B,EAAA,OAAO,UAACrU,KAAK,EAAEyT,MAAM,EAAK;MACxB,IAAMa,GAAG,GAAG,EAAE,CAAA;EACd,IAAA,IAAInhB,CAAC,CAAA;EAEL,IAAA,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqG,IAAI,CAACpG,MAAM,EAAED,CAAC,EAAE,EAAE;EAChCmhB,MAAAA,GAAG,CAAC9a,IAAI,CAACrG,CAAC,CAAC,CAAC,GAAGkW,YAAY,CAACrJ,KAAK,CAACyT,MAAM,GAAGtgB,CAAC,CAAC,CAAC,CAAA;EAChD,KAAA;MACA,OAAO,CAACmhB,GAAG,EAAE,IAAI,EAAEb,MAAM,GAAGtgB,CAAC,CAAC,CAAA;KAC/B,CAAA;EACH,CAAA;;EAEA;EACA,IAAMohB,WAAW,GAAG,oCAAoC,CAAA;EACxD,IAAMC,eAAe,WAASD,WAAW,CAACtB,MAAM,GAAWN,UAAAA,GAAAA,SAAS,CAACM,MAAM,GAAU,UAAA,CAAA;EACrF,IAAMwB,gBAAgB,GAAG,qDAAqD,CAAA;EAC9E,IAAMC,YAAY,GAAGzR,MAAM,CAAA,EAAA,GAAIwR,gBAAgB,CAACxB,MAAM,GAAGuB,eAAiB,CAAC,CAAA;EAC3E,IAAMG,qBAAqB,GAAG1R,MAAM,CAAA,SAAA,GAAWyR,YAAY,CAACzB,MAAM,OAAI,CAAC,CAAA;EACvE,IAAM2B,WAAW,GAAG,6CAA6C,CAAA;EACjE,IAAMC,YAAY,GAAG,6BAA6B,CAAA;EAClD,IAAMC,eAAe,GAAG,kBAAkB,CAAA;EAC1C,IAAMC,kBAAkB,GAAGZ,WAAW,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAA;EAC3E,IAAMa,qBAAqB,GAAGb,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;EAC5D,IAAMc,WAAW,GAAG,uBAAuB,CAAC;EAC5C,IAAMC,YAAY,GAAGjS,MAAM,CACtBwR,gBAAgB,CAACxB,MAAM,GAAA,OAAA,GAAQsB,WAAW,CAACtB,MAAM,GAAKN,IAAAA,GAAAA,SAAS,CAACM,MAAM,QAC3E,CAAC,CAAA;EACD,IAAMkC,qBAAqB,GAAGlS,MAAM,CAAA,MAAA,GAAQiS,YAAY,CAACjC,MAAM,OAAI,CAAC,CAAA;EAEpE,SAASmC,GAAGA,CAACpV,KAAK,EAAEzM,GAAG,EAAE8hB,QAAQ,EAAE;EACjC,EAAA,IAAMvW,CAAC,GAAGkB,KAAK,CAACzM,GAAG,CAAC,CAAA;IACpB,OAAOC,WAAW,CAACsL,CAAC,CAAC,GAAGuW,QAAQ,GAAGhM,YAAY,CAACvK,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,SAASwW,aAAaA,CAACtV,KAAK,EAAEyT,MAAM,EAAE;EACpC,EAAA,IAAM8B,IAAI,GAAG;EACXxnB,IAAAA,IAAI,EAAEqnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,CAAC;MACxBzlB,KAAK,EAAEonB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAChCxlB,GAAG,EAAEmnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;KAC9B,CAAA;IAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;EACjC,CAAA;EAEA,SAAS+B,cAAcA,CAACxV,KAAK,EAAEyT,MAAM,EAAE;EACrC,EAAA,IAAM8B,IAAI,GAAG;MACX5J,KAAK,EAAEyJ,GAAG,CAACpV,KAAK,EAAEyT,MAAM,EAAE,CAAC,CAAC;MAC5BnZ,OAAO,EAAE8a,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAClCvG,OAAO,EAAEkI,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAClCgC,YAAY,EAAEhM,WAAW,CAACzJ,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAA;KAC5C,CAAA;IAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;EACjC,CAAA;EAEA,SAASiC,gBAAgBA,CAAC1V,KAAK,EAAEyT,MAAM,EAAE;EACvC,EAAA,IAAMkC,KAAK,GAAG,CAAC3V,KAAK,CAACyT,MAAM,CAAC,IAAI,CAACzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC;EAChDmC,IAAAA,UAAU,GAAG3V,YAAY,CAACD,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,EAAEzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAC;MAC/D5f,IAAI,GAAG8hB,KAAK,GAAG,IAAI,GAAGhW,eAAe,CAACC,QAAQ,CAACgW,UAAU,CAAC,CAAA;IAC5D,OAAO,CAAC,EAAE,EAAE/hB,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;EAC/B,CAAA;EAEA,SAASoC,eAAeA,CAAC7V,KAAK,EAAEyT,MAAM,EAAE;EACtC,EAAA,IAAM5f,IAAI,GAAGmM,KAAK,CAACyT,MAAM,CAAC,GAAG9f,QAAQ,CAACC,MAAM,CAACoM,KAAK,CAACyT,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;IAClE,OAAO,CAAC,EAAE,EAAE5f,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;EAC/B,CAAA;;EAEA;;EAEA,IAAMqC,WAAW,GAAG7S,MAAM,CAAA,KAAA,GAAOwR,gBAAgB,CAACxB,MAAM,MAAG,CAAC,CAAA;;EAE5D;;EAEA,IAAM8C,WAAW,GACf,8PAA8P,CAAA;EAEhQ,SAASC,kBAAkBA,CAAChW,KAAK,EAAE;IACjC,IAAOpS,CAAC,GACNoS,KAAK,CAAA,CAAA,CAAA;EADGiW,IAAAA,OAAO,GACfjW,KAAK,CAAA,CAAA,CAAA;EADYkW,IAAAA,QAAQ,GACzBlW,KAAK,CAAA,CAAA,CAAA;EADsBmW,IAAAA,OAAO,GAClCnW,KAAK,CAAA,CAAA,CAAA;EAD+BoW,IAAAA,MAAM,GAC1CpW,KAAK,CAAA,CAAA,CAAA;EADuCqW,IAAAA,OAAO,GACnDrW,KAAK,CAAA,CAAA,CAAA;EADgDsW,IAAAA,SAAS,GAC9DtW,KAAK,CAAA,CAAA,CAAA;EAD2DuW,IAAAA,SAAS,GACzEvW,KAAK,CAAA,CAAA,CAAA;EADsEwW,IAAAA,eAAe,GAC1FxW,KAAK,CAAA,CAAA,CAAA,CAAA;EAEP,EAAA,IAAMyW,iBAAiB,GAAG7oB,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;IACtC,IAAM8oB,eAAe,GAAGH,SAAS,IAAIA,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;EAEzD,EAAA,IAAMI,WAAW,GAAG,SAAdA,WAAWA,CAAIhG,GAAG,EAAEiG,KAAK,EAAA;EAAA,IAAA,IAALA,KAAK,KAAA,KAAA,CAAA,EAAA;EAALA,MAAAA,KAAK,GAAG,KAAK,CAAA;EAAA,KAAA;EAAA,IAAA,OACrCjG,GAAG,KAAK7e,SAAS,KAAK8kB,KAAK,IAAKjG,GAAG,IAAI8F,iBAAkB,CAAC,GAAG,CAAC9F,GAAG,GAAGA,GAAG,CAAA;EAAA,GAAA,CAAA;EAEzE,EAAA,OAAO,CACL;EACE7D,IAAAA,KAAK,EAAE6J,WAAW,CAACpN,aAAa,CAAC0M,OAAO,CAAC,CAAC;EAC1CrY,IAAAA,MAAM,EAAE+Y,WAAW,CAACpN,aAAa,CAAC2M,QAAQ,CAAC,CAAC;EAC5ClJ,IAAAA,KAAK,EAAE2J,WAAW,CAACpN,aAAa,CAAC4M,OAAO,CAAC,CAAC;EAC1ClJ,IAAAA,IAAI,EAAE0J,WAAW,CAACpN,aAAa,CAAC6M,MAAM,CAAC,CAAC;EACxCzK,IAAAA,KAAK,EAAEgL,WAAW,CAACpN,aAAa,CAAC8M,OAAO,CAAC,CAAC;EAC1C/b,IAAAA,OAAO,EAAEqc,WAAW,CAACpN,aAAa,CAAC+M,SAAS,CAAC,CAAC;MAC9CpJ,OAAO,EAAEyJ,WAAW,CAACpN,aAAa,CAACgN,SAAS,CAAC,EAAEA,SAAS,KAAK,IAAI,CAAC;MAClEd,YAAY,EAAEkB,WAAW,CAAClN,WAAW,CAAC+M,eAAe,CAAC,EAAEE,eAAe,CAAA;EACzE,GAAC,CACF,CAAA;EACH,CAAA;;EAEA;EACA;EACA;EACA,IAAMG,UAAU,GAAG;EACjBC,EAAAA,GAAG,EAAE,CAAC;EACNC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;IACZC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAA;EACZ,CAAC,CAAA;EAED,SAASC,WAAWA,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAE;EACzF,EAAA,IAAMkB,MAAM,GAAG;EACb1pB,IAAAA,IAAI,EAAEkoB,OAAO,CAAC7iB,MAAM,KAAK,CAAC,GAAGsX,cAAc,CAACrB,YAAY,CAAC4M,OAAO,CAAC,CAAC,GAAG5M,YAAY,CAAC4M,OAAO,CAAC;MAC1FjoB,KAAK,EAAEoN,WAAmB,CAAChE,OAAO,CAAC8e,QAAQ,CAAC,GAAG,CAAC;EAChDjoB,IAAAA,GAAG,EAAEob,YAAY,CAAC+M,MAAM,CAAC;EACzB5nB,IAAAA,IAAI,EAAE6a,YAAY,CAACgN,OAAO,CAAC;MAC3B5nB,MAAM,EAAE4a,YAAY,CAACiN,SAAS,CAAA;KAC/B,CAAA;IAED,IAAIC,SAAS,EAAEkB,MAAM,CAAC9oB,MAAM,GAAG0a,YAAY,CAACkN,SAAS,CAAC,CAAA;EACtD,EAAA,IAAIiB,UAAU,EAAE;EACdC,IAAAA,MAAM,CAACrpB,OAAO,GACZopB,UAAU,CAACpkB,MAAM,GAAG,CAAC,GACjBgI,YAAoB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,GAC5Cpc,aAAqB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,CAAA;EACrD,GAAA;EAEA,EAAA,OAAOC,MAAM,CAAA;EACf,CAAA;;EAEA;EACA,IAAMC,OAAO,GACX,iMAAiM,CAAA;EAEnM,SAASC,cAAcA,CAAC3X,KAAK,EAAE;IAC7B,IAEIwX,UAAU,GAWRxX,KAAK,CAAA,CAAA,CAAA;EAVPoW,IAAAA,MAAM,GAUJpW,KAAK,CAAA,CAAA,CAAA;EATPkW,IAAAA,QAAQ,GASNlW,KAAK,CAAA,CAAA,CAAA;EARPiW,IAAAA,OAAO,GAQLjW,KAAK,CAAA,CAAA,CAAA;EAPPqW,IAAAA,OAAO,GAOLrW,KAAK,CAAA,CAAA,CAAA;EANPsW,IAAAA,SAAS,GAMPtW,KAAK,CAAA,CAAA,CAAA;EALPuW,IAAAA,SAAS,GAKPvW,KAAK,CAAA,CAAA,CAAA;EAJP4X,IAAAA,SAAS,GAIP5X,KAAK,CAAA,CAAA,CAAA;EAHP6X,IAAAA,SAAS,GAGP7X,KAAK,CAAA,CAAA,CAAA;EAFP6K,IAAAA,UAAU,GAER7K,KAAK,CAAA,EAAA,CAAA;EADP8K,IAAAA,YAAY,GACV9K,KAAK,CAAA,EAAA,CAAA;EACTyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAE5F,EAAA,IAAIlmB,MAAM,CAAA;EACV,EAAA,IAAIunB,SAAS,EAAE;EACbvnB,IAAAA,MAAM,GAAGwmB,UAAU,CAACe,SAAS,CAAC,CAAA;KAC/B,MAAM,IAAIC,SAAS,EAAE;EACpBxnB,IAAAA,MAAM,GAAG,CAAC,CAAA;EACZ,GAAC,MAAM;EACLA,IAAAA,MAAM,GAAG4P,YAAY,CAAC4K,UAAU,EAAEC,YAAY,CAAC,CAAA;EACjD,GAAA;IAEA,OAAO,CAAC2M,MAAM,EAAE,IAAI9X,eAAe,CAACtP,MAAM,CAAC,CAAC,CAAA;EAC9C,CAAA;EAEA,SAASynB,iBAAiBA,CAAClqB,CAAC,EAAE;EAC5B;EACA,EAAA,OAAOA,CAAC,CACL0E,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAClCA,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CACxBylB,IAAI,EAAE,CAAA;EACX,CAAA;;EAEA;;EAEA,IAAMC,OAAO,GACT,4HAA4H;EAC9HC,EAAAA,MAAM,GACJ,wJAAwJ;EAC1JC,EAAAA,KAAK,GACH,2HAA2H,CAAA;EAE/H,SAASC,mBAAmBA,CAACnY,KAAK,EAAE;IAClC,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;EAAjEoW,IAAAA,MAAM,GAAsDpW,KAAK,CAAA,CAAA,CAAA;EAAzDkW,IAAAA,QAAQ,GAA4ClW,KAAK,CAAA,CAAA,CAAA;EAA/CiW,IAAAA,OAAO,GAAmCjW,KAAK,CAAA,CAAA,CAAA;EAAtCqW,IAAAA,OAAO,GAA0BrW,KAAK,CAAA,CAAA,CAAA;EAA7BsW,IAAAA,SAAS,GAAetW,KAAK,CAAA,CAAA,CAAA;EAAlBuW,IAAAA,SAAS,GAAIvW,KAAK,CAAA,CAAA,CAAA;EACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;EAC9C,CAAA;EAEA,SAASuY,YAAYA,CAACpY,KAAK,EAAE;IAC3B,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;EAAjEkW,IAAAA,QAAQ,GAAoDlW,KAAK,CAAA,CAAA,CAAA;EAAvDoW,IAAAA,MAAM,GAA4CpW,KAAK,CAAA,CAAA,CAAA;EAA/CqW,IAAAA,OAAO,GAAmCrW,KAAK,CAAA,CAAA,CAAA;EAAtCsW,IAAAA,SAAS,GAAwBtW,KAAK,CAAA,CAAA,CAAA;EAA3BuW,IAAAA,SAAS,GAAavW,KAAK,CAAA,CAAA,CAAA;EAAhBiW,IAAAA,OAAO,GAAIjW,KAAK,CAAA,CAAA,CAAA;EACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;EAC9C,CAAA;EAEA,IAAMwY,4BAA4B,GAAGzF,cAAc,CAACgC,WAAW,EAAED,qBAAqB,CAAC,CAAA;EACvF,IAAM2D,6BAA6B,GAAG1F,cAAc,CAACiC,YAAY,EAAEF,qBAAqB,CAAC,CAAA;EACzF,IAAM4D,gCAAgC,GAAG3F,cAAc,CAACkC,eAAe,EAAEH,qBAAqB,CAAC,CAAA;EAC/F,IAAM6D,oBAAoB,GAAG5F,cAAc,CAAC8B,YAAY,CAAC,CAAA;EAEzD,IAAM+D,0BAA0B,GAAGvF,iBAAiB,CAClDoC,aAAa,EACbE,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM6C,2BAA2B,GAAGxF,iBAAiB,CACnD6B,kBAAkB,EAClBS,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM8C,4BAA4B,GAAGzF,iBAAiB,CACpD8B,qBAAqB,EACrBQ,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM+C,uBAAuB,GAAG1F,iBAAiB,CAC/CsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;;EAED;EACA;EACA;;EAEO,SAASgD,YAAYA,CAACjrB,CAAC,EAAE;IAC9B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACyqB,4BAA4B,EAAEI,0BAA0B,CAAC,EAC1D,CAACH,6BAA6B,EAAEI,2BAA2B,CAAC,EAC5D,CAACH,gCAAgC,EAAEI,4BAA4B,CAAC,EAChE,CAACH,oBAAoB,EAAEI,uBAAuB,CAChD,CAAC,CAAA;EACH,CAAA;EAEO,SAASE,gBAAgBA,CAAClrB,CAAC,EAAE;EAClC,EAAA,OAAO+lB,KAAK,CAACmE,iBAAiB,CAAClqB,CAAC,CAAC,EAAE,CAAC8pB,OAAO,EAAEC,cAAc,CAAC,CAAC,CAAA;EAC/D,CAAA;EAEO,SAASoB,aAAaA,CAACnrB,CAAC,EAAE;IAC/B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACoqB,OAAO,EAAEG,mBAAmB,CAAC,EAC9B,CAACF,MAAM,EAAEE,mBAAmB,CAAC,EAC7B,CAACD,KAAK,EAAEE,YAAY,CACtB,CAAC,CAAA;EACH,CAAA;EAEO,SAASY,gBAAgBA,CAACprB,CAAC,EAAE;IAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACmoB,WAAW,EAAEC,kBAAkB,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,IAAMiD,kBAAkB,GAAG/F,iBAAiB,CAACsC,cAAc,CAAC,CAAA;EAErD,SAAS0D,gBAAgBA,CAACtrB,CAAC,EAAE;IAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACkoB,WAAW,EAAEmD,kBAAkB,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,IAAME,4BAA4B,GAAGvG,cAAc,CAACqC,WAAW,EAAEE,qBAAqB,CAAC,CAAA;EACvF,IAAMiE,oBAAoB,GAAGxG,cAAc,CAACsC,YAAY,CAAC,CAAA;EAEzD,IAAMmE,+BAA+B,GAAGnG,iBAAiB,CACvDsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EAEM,SAASyD,QAAQA,CAAC1rB,CAAC,EAAE;EAC1B,EAAA,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACurB,4BAA4B,EAAEV,0BAA0B,CAAC,EAC1D,CAACW,oBAAoB,EAAEC,+BAA+B,CACxD,CAAC,CAAA;EACH;;EC9TA,IAAME,SAAO,GAAG,kBAAkB,CAAA;;EAElC;EACO,IAAMC,cAAc,GAAG;EAC1BxM,IAAAA,KAAK,EAAE;EACLC,MAAAA,IAAI,EAAE,CAAC;QACPtB,KAAK,EAAE,CAAC,GAAG,EAAE;EACbrR,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE;EACpB4S,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QACzBuI,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OAClC;EACDxI,IAAAA,IAAI,EAAE;EACJtB,MAAAA,KAAK,EAAE,EAAE;QACTrR,OAAO,EAAE,EAAE,GAAG,EAAE;EAChB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrBuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OAC9B;EACD9J,IAAAA,KAAK,EAAE;EAAErR,MAAAA,OAAO,EAAE,EAAE;QAAE4S,OAAO,EAAE,EAAE,GAAG,EAAE;EAAEuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,IAAA;OAAM;EACtEnb,IAAAA,OAAO,EAAE;EAAE4S,MAAAA,OAAO,EAAE,EAAE;QAAEuI,YAAY,EAAE,EAAE,GAAG,IAAA;OAAM;EACjDvI,IAAAA,OAAO,EAAE;EAAEuI,MAAAA,YAAY,EAAE,IAAA;EAAK,KAAA;KAC/B;EACDgE,EAAAA,YAAY,GAAA1iB,QAAA,CAAA;EACV+V,IAAAA,KAAK,EAAE;EACLC,MAAAA,QAAQ,EAAE,CAAC;EACXnP,MAAAA,MAAM,EAAE,EAAE;EACVoP,MAAAA,KAAK,EAAE,EAAE;EACTC,MAAAA,IAAI,EAAE,GAAG;QACTtB,KAAK,EAAE,GAAG,GAAG,EAAE;EACfrR,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE;EACtB4S,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC3BuI,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACpC;EACD1I,IAAAA,QAAQ,EAAE;EACRnP,MAAAA,MAAM,EAAE,CAAC;EACToP,MAAAA,KAAK,EAAE,EAAE;EACTC,MAAAA,IAAI,EAAE,EAAE;QACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;EACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACnC;EACD7X,IAAAA,MAAM,EAAE;EACNoP,MAAAA,KAAK,EAAE,CAAC;EACRC,MAAAA,IAAI,EAAE,EAAE;QACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;EACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;EACpC,KAAA;EAAC,GAAA,EAEE+D,cAAc,CAClB;IACDE,kBAAkB,GAAG,QAAQ,GAAG,GAAG;IACnCC,mBAAmB,GAAG,QAAQ,GAAG,IAAI;EACrCC,EAAAA,cAAc,GAAA7iB,QAAA,CAAA;EACZ+V,IAAAA,KAAK,EAAE;EACLC,MAAAA,QAAQ,EAAE,CAAC;EACXnP,MAAAA,MAAM,EAAE,EAAE;QACVoP,KAAK,EAAE0M,kBAAkB,GAAG,CAAC;EAC7BzM,MAAAA,IAAI,EAAEyM,kBAAkB;QACxB/N,KAAK,EAAE+N,kBAAkB,GAAG,EAAE;EAC9Bpf,MAAAA,OAAO,EAAEof,kBAAkB,GAAG,EAAE,GAAG,EAAE;EACrCxM,MAAAA,OAAO,EAAEwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1CjE,YAAY,EAAEiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACnD;EACD3M,IAAAA,QAAQ,EAAE;EACRnP,MAAAA,MAAM,EAAE,CAAC;QACToP,KAAK,EAAE0M,kBAAkB,GAAG,EAAE;QAC9BzM,IAAI,EAAEyM,kBAAkB,GAAG,CAAC;EAC5B/N,MAAAA,KAAK,EAAG+N,kBAAkB,GAAG,EAAE,GAAI,CAAC;EACpCpf,MAAAA,OAAO,EAAGof,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;QAC3CxM,OAAO,EAAGwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;QAChDjE,YAAY,EAAGiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,GAAI,CAAA;OAC5D;EACD9b,IAAAA,MAAM,EAAE;QACNoP,KAAK,EAAE2M,mBAAmB,GAAG,CAAC;EAC9B1M,MAAAA,IAAI,EAAE0M,mBAAmB;QACzBhO,KAAK,EAAEgO,mBAAmB,GAAG,EAAE;EAC/Brf,MAAAA,OAAO,EAAEqf,mBAAmB,GAAG,EAAE,GAAG,EAAE;EACtCzM,MAAAA,OAAO,EAAEyM,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC3ClE,YAAY,EAAEkE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;EACrD,KAAA;EAAC,GAAA,EACEH,cAAc,CAClB,CAAA;;EAEH;EACA,IAAMK,cAAY,GAAG,CACnB,OAAO,EACP,UAAU,EACV,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cAAc,CACf,CAAA;EAED,IAAMC,YAAY,GAAGD,cAAY,CAACvI,KAAK,CAAC,CAAC,CAAC,CAACyI,OAAO,EAAE,CAAA;;EAEpD;EACA,SAASxc,OAAKA,CAACkU,GAAG,EAAEjU,IAAI,EAAEzJ,KAAK,EAAU;EAAA,EAAA,IAAfA,KAAK,KAAA,KAAA,CAAA,EAAA;EAALA,IAAAA,KAAK,GAAG,KAAK,CAAA;EAAA,GAAA;EACrC;EACA,EAAA,IAAMimB,IAAI,GAAG;EACXtH,IAAAA,MAAM,EAAE3e,KAAK,GAAGyJ,IAAI,CAACkV,MAAM,GAAA3b,QAAA,CAAA,EAAA,EAAQ0a,GAAG,CAACiB,MAAM,EAAMlV,IAAI,CAACkV,MAAM,IAAI,EAAE,CAAG;MACvEja,GAAG,EAAEgZ,GAAG,CAAChZ,GAAG,CAAC8E,KAAK,CAACC,IAAI,CAAC/E,GAAG,CAAC;EAC5BwhB,IAAAA,kBAAkB,EAAEzc,IAAI,CAACyc,kBAAkB,IAAIxI,GAAG,CAACwI,kBAAkB;EACrEC,IAAAA,MAAM,EAAE1c,IAAI,CAAC0c,MAAM,IAAIzI,GAAG,CAACyI,MAAAA;KAC5B,CAAA;EACD,EAAA,OAAO,IAAIC,QAAQ,CAACH,IAAI,CAAC,CAAA;EAC3B,CAAA;EAEA,SAASI,gBAAgBA,CAACF,MAAM,EAAEG,IAAI,EAAE;EAAA,EAAA,IAAAC,kBAAA,CAAA;IACtC,IAAIC,GAAG,GAAAD,CAAAA,kBAAA,GAAGD,IAAI,CAAC5E,YAAY,KAAA,IAAA,GAAA6E,kBAAA,GAAI,CAAC,CAAA;EAChC,EAAA,KAAA,IAAAzM,SAAA,GAAAC,+BAAA,CAAmBgM,YAAY,CAACxI,KAAK,CAAC,CAAC,CAAC,CAAA,EAAAvD,KAAA,EAAAA,CAAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAA/B1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;EACb,IAAA,IAAI+mB,IAAI,CAAC/sB,IAAI,CAAC,EAAE;EACditB,MAAAA,GAAG,IAAIF,IAAI,CAAC/sB,IAAI,CAAC,GAAG4sB,MAAM,CAAC5sB,IAAI,CAAC,CAAC,cAAc,CAAC,CAAA;EAClD,KAAA;EACF,GAAA;EACA,EAAA,OAAOitB,GAAG,CAAA;EACZ,CAAA;;EAEA;EACA,SAASC,eAAeA,CAACN,MAAM,EAAEG,IAAI,EAAE;EACrC;EACA;EACA,EAAA,IAAMvQ,MAAM,GAAGsQ,gBAAgB,CAACF,MAAM,EAAEG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;EAE1DR,EAAAA,cAAY,CAACY,WAAW,CAAC,UAACC,QAAQ,EAAE/K,OAAO,EAAK;MAC9C,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;EAC/B,MAAA,IAAI+K,QAAQ,EAAE;EACZ,QAAA,IAAMC,WAAW,GAAGN,IAAI,CAACK,QAAQ,CAAC,GAAG5Q,MAAM,CAAA;UAC3C,IAAM8Q,IAAI,GAAGV,MAAM,CAACvK,OAAO,CAAC,CAAC+K,QAAQ,CAAC,CAAA;;EAEtC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;UACA,IAAMG,MAAM,GAAGpmB,IAAI,CAAC2E,KAAK,CAACuhB,WAAW,GAAGC,IAAI,CAAC,CAAA;EAC7CP,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIkL,MAAM,GAAG/Q,MAAM,CAAA;UAChCuQ,IAAI,CAACK,QAAQ,CAAC,IAAIG,MAAM,GAAGD,IAAI,GAAG9Q,MAAM,CAAA;EAC1C,OAAA;EACA,MAAA,OAAO6F,OAAO,CAAA;EAChB,KAAC,MAAM;EACL,MAAA,OAAO+K,QAAQ,CAAA;EACjB,KAAA;KACD,EAAE,IAAI,CAAC,CAAA;;EAER;EACA;EACAb,EAAAA,cAAY,CAAC3R,MAAM,CAAC,UAACwS,QAAQ,EAAE/K,OAAO,EAAK;MACzC,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;EAC/B,MAAA,IAAI+K,QAAQ,EAAE;EACZ,QAAA,IAAMhR,QAAQ,GAAG2Q,IAAI,CAACK,QAAQ,CAAC,GAAG,CAAC,CAAA;EACnCL,QAAAA,IAAI,CAACK,QAAQ,CAAC,IAAIhR,QAAQ,CAAA;EAC1B2Q,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIjG,QAAQ,GAAGwQ,MAAM,CAACQ,QAAQ,CAAC,CAAC/K,OAAO,CAAC,CAAA;EACvD,OAAA;EACA,MAAA,OAAOA,OAAO,CAAA;EAChB,KAAC,MAAM;EACL,MAAA,OAAO+K,QAAQ,CAAA;EACjB,KAAA;KACD,EAAE,IAAI,CAAC,CAAA;EACV,CAAA;;EAEA;EACA,SAASI,YAAYA,CAACT,IAAI,EAAE;IAC1B,IAAMU,OAAO,GAAG,EAAE,CAAA;EAClB,EAAA,KAAA,IAAAhH,EAAA,GAAAiH,CAAAA,EAAAA,eAAA,GAA2BzhB,MAAM,CAAC0hB,OAAO,CAACZ,IAAI,CAAC,EAAAtG,EAAA,GAAAiH,eAAA,CAAA5nB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAA5C,IAAA,IAAAmH,kBAAA,GAAAF,eAAA,CAAAjH,EAAA,CAAA;EAAOtjB,MAAAA,GAAG,GAAAyqB,kBAAA,CAAA,CAAA,CAAA;EAAE5nB,MAAAA,KAAK,GAAA4nB,kBAAA,CAAA,CAAA,CAAA,CAAA;MACpB,IAAI5nB,KAAK,KAAK,CAAC,EAAE;EACfynB,MAAAA,OAAO,CAACtqB,GAAG,CAAC,GAAG6C,KAAK,CAAA;EACtB,KAAA;EACF,GAAA;EACA,EAAA,OAAOynB,OAAO,CAAA;EAChB,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqBZ,MAAAA,QAAQ,0BAAAgB,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAAhB,QAAAA,CAAYiB,MAAM,EAAE;MAClB,IAAMC,QAAQ,GAAGD,MAAM,CAACnB,kBAAkB,KAAK,UAAU,IAAI,KAAK,CAAA;EAClE,IAAA,IAAIC,MAAM,GAAGmB,QAAQ,GAAGzB,cAAc,GAAGH,YAAY,CAAA;MAErD,IAAI2B,MAAM,CAAClB,MAAM,EAAE;QACjBA,MAAM,GAAGkB,MAAM,CAAClB,MAAM,CAAA;EACxB,KAAA;;EAEA;EACJ;EACA;EACI,IAAA,IAAI,CAACxH,MAAM,GAAG0I,MAAM,CAAC1I,MAAM,CAAA;EAC3B;EACJ;EACA;MACI,IAAI,CAACja,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;EACxC;EACJ;EACA;EACI,IAAA,IAAI,CAACqmB,kBAAkB,GAAGoB,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAA;EAC1D;EACJ;EACA;EACI,IAAA,IAAI,CAACC,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;EACrC;EACJ;EACA;MACI,IAAI,CAACpB,MAAM,GAAGA,MAAM,CAAA;EACpB;EACJ;EACA;MACI,IAAI,CAACqB,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAREpB,QAAA,CASOqB,UAAU,GAAjB,SAAAA,WAAkBrgB,KAAK,EAAEjL,IAAI,EAAE;MAC7B,OAAOiqB,QAAQ,CAAC5d,UAAU,CAAC;EAAEkZ,MAAAA,YAAY,EAAEta,KAAAA;OAAO,EAAEjL,IAAI,CAAC,CAAA;EAC3D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAnBE;IAAAiqB,QAAA,CAoBO5d,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9B,IAAI+V,GAAG,IAAI,IAAI,IAAI,OAAOA,GAAG,KAAK,QAAQ,EAAE;EAC1C,MAAA,MAAM,IAAI1Y,oBAAoB,CAE1B0Y,8DAAAA,IAAAA,GAAG,KAAK,IAAI,GAAG,MAAM,GAAG,OAAOA,GAAG,CAEtC,CAAC,CAAA;EACH,KAAA;MAEA,OAAO,IAAIkU,QAAQ,CAAC;QAClBzH,MAAM,EAAEnH,eAAe,CAACtF,GAAG,EAAEkU,QAAQ,CAACsB,aAAa,CAAC;EACpDhjB,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC;QAC5B+pB,kBAAkB,EAAE/pB,IAAI,CAAC+pB,kBAAkB;QAC3CC,MAAM,EAAEhqB,IAAI,CAACgqB,MAAAA;EACf,KAAC,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAAC,EAAAA,QAAA,CAUOuB,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBC,YAAY,EAAE;EACpC,IAAA,IAAInb,QAAQ,CAACmb,YAAY,CAAC,EAAE;EAC1B,MAAA,OAAOxB,QAAQ,CAACqB,UAAU,CAACG,YAAY,CAAC,CAAA;OACzC,MAAM,IAAIxB,QAAQ,CAACyB,UAAU,CAACD,YAAY,CAAC,EAAE;EAC5C,MAAA,OAAOA,YAAY,CAAA;EACrB,KAAC,MAAM,IAAI,OAAOA,YAAY,KAAK,QAAQ,EAAE;EAC3C,MAAA,OAAOxB,QAAQ,CAAC5d,UAAU,CAACof,YAAY,CAAC,CAAA;EAC1C,KAAC,MAAM;EACL,MAAA,MAAM,IAAIpuB,oBAAoB,CAAA,4BAAA,GACCouB,YAAY,GAAY,WAAA,GAAA,OAAOA,YAC9D,CAAC,CAAA;EACH,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAAxB,QAAA,CAcO0B,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;EACzB,IAAA,IAAA6rB,iBAAA,GAAiB/C,gBAAgB,CAAC8C,IAAI,CAAC;EAAhCvpB,MAAAA,MAAM,GAAAwpB,iBAAA,CAAA,CAAA,CAAA,CAAA;EACb,IAAA,IAAIxpB,MAAM,EAAE;EACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;EAC1C,KAAC,MAAM;QACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;IAAA3B,QAAA,CAgBO6B,WAAW,GAAlB,SAAAA,YAAmBF,IAAI,EAAE5rB,IAAI,EAAE;EAC7B,IAAA,IAAA+rB,iBAAA,GAAiB/C,gBAAgB,CAAC4C,IAAI,CAAC;EAAhCvpB,MAAAA,MAAM,GAAA0pB,iBAAA,CAAA,CAAA,CAAA,CAAA;EACb,IAAA,IAAI1pB,MAAM,EAAE;EACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;EAC1C,KAAC,MAAM;QACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA3B,QAAA,CAMOmB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAIpW,oBAAoB,CAACsuB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAInB,QAAQ,CAAC;EAAEmB,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA,MAFE;EAAAnB,EAAAA,QAAA,CAGOsB,aAAa,GAApB,SAAAA,aAAAA,CAAqBnuB,IAAI,EAAE;EACzB,IAAA,IAAMme,UAAU,GAAG;EACjB1d,MAAAA,IAAI,EAAE,OAAO;EACb+e,MAAAA,KAAK,EAAE,OAAO;EACdyE,MAAAA,OAAO,EAAE,UAAU;EACnBxE,MAAAA,QAAQ,EAAE,UAAU;EACpB/e,MAAAA,KAAK,EAAE,QAAQ;EACf4P,MAAAA,MAAM,EAAE,QAAQ;EAChBse,MAAAA,IAAI,EAAE,OAAO;EACblP,MAAAA,KAAK,EAAE,OAAO;EACd/e,MAAAA,GAAG,EAAE,MAAM;EACXgf,MAAAA,IAAI,EAAE,MAAM;EACZze,MAAAA,IAAI,EAAE,OAAO;EACbmd,MAAAA,KAAK,EAAE,OAAO;EACdld,MAAAA,MAAM,EAAE,SAAS;EACjB6L,MAAAA,OAAO,EAAE,SAAS;EAClB3L,MAAAA,MAAM,EAAE,SAAS;EACjBue,MAAAA,OAAO,EAAE,SAAS;EAClBpY,MAAAA,WAAW,EAAE,cAAc;EAC3B2gB,MAAAA,YAAY,EAAE,cAAA;OACf,CAACnoB,IAAI,GAAGA,IAAI,CAACyR,WAAW,EAAE,GAAGzR,IAAI,CAAC,CAAA;MAEnC,IAAI,CAACme,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;EAEjD,IAAA,OAAOme,UAAU,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA0O,EAAAA,QAAA,CAKOyB,UAAU,GAAjB,SAAAA,UAAAA,CAAkBpU,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAAC+T,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA,EAAA,IAAAzrB,MAAA,GAAAqqB,QAAA,CAAApqB,SAAA,CAAA;EAiBA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAzBED,MAAA,CA0BAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB;EACA,IAAA,IAAMksB,OAAO,GAAArlB,QAAA,CAAA,EAAA,EACR7G,IAAI,EAAA;QACPkJ,KAAK,EAAElJ,IAAI,CAACga,KAAK,KAAK,KAAK,IAAIha,IAAI,CAACkJ,KAAK,KAAK,KAAA;OAC/C,CAAA,CAAA;MACD,OAAO,IAAI,CAAC+X,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,EAAE2jB,OAAO,CAAC,CAAC5K,wBAAwB,CAAC,IAAI,EAAE9B,GAAG,CAAC,GACvE6J,SAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;EAAAzpB,EAAAA,MAAA,CAgBAusB,OAAO,GAAP,SAAAA,OAAAA,CAAQnsB,IAAI,EAAO;EAAA,IAAA,IAAAiE,KAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAXjE,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACf,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EAEjC,IAAA,IAAM+C,SAAS,GAAGpsB,IAAI,CAACosB,SAAS,KAAK,KAAK,CAAA;MAE1C,IAAMzuB,CAAC,GAAGgsB,cAAY,CACnBrf,GAAG,CAAC,UAAClN,IAAI,EAAK;EACb,MAAA,IAAM6gB,GAAG,GAAGha,KAAI,CAACue,MAAM,CAACplB,IAAI,CAAC,CAAA;QAC7B,IAAIkG,WAAW,CAAC2a,GAAG,CAAC,IAAKA,GAAG,KAAK,CAAC,IAAI,CAACmO,SAAU,EAAE;EACjD,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACA,MAAA,OAAOnoB,KAAI,CAACsE,GAAG,CACZuG,eAAe,CAAAjI,QAAA,CAAA;EAAGgE,QAAAA,KAAK,EAAE,MAAM;EAAEwhB,QAAAA,WAAW,EAAE,MAAA;EAAM,OAAA,EAAKrsB,IAAI,EAAA;UAAE5C,IAAI,EAAEA,IAAI,CAACgkB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAAC,OAAA,CAAE,CAAC,CACzFlhB,MAAM,CAAC+d,GAAG,CAAC,CAAA;EAChB,KAAC,CAAC,CACDqE,MAAM,CAAC,UAAC7kB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAAA;OAAC,CAAA,CAAA;EAEnB,IAAA,OAAO,IAAI,CAAC8K,GAAG,CACZ0G,aAAa,CAAApI,QAAA,CAAA;EAAG3F,MAAAA,IAAI,EAAE,aAAa;EAAE2J,MAAAA,KAAK,EAAE7K,IAAI,CAACssB,SAAS,IAAI,QAAA;EAAQ,KAAA,EAAKtsB,IAAI,CAAE,CAAC,CAClFE,MAAM,CAACvC,CAAC,CAAC,CAAA;EACd,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAiC,EAAAA,MAAA,CAKA2sB,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAACtL,OAAO,EAAE,OAAO,EAAE,CAAA;EAC5B,IAAA,OAAApa,QAAA,CAAA,EAAA,EAAY,IAAI,CAAC2b,MAAM,CAAA,CAAA;EACzB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAA5iB,EAAAA,MAAA,CAUA4sB,KAAK,GAAL,SAAAA,QAAQ;EACN;EACA,IAAA,IAAI,CAAC,IAAI,CAACvL,OAAO,EAAE,OAAO,IAAI,CAAA;MAE9B,IAAIvjB,CAAC,GAAG,GAAG,CAAA;EACX,IAAA,IAAI,IAAI,CAACkf,KAAK,KAAK,CAAC,EAAElf,CAAC,IAAI,IAAI,CAACkf,KAAK,GAAG,GAAG,CAAA;MAC3C,IAAI,IAAI,CAAClP,MAAM,KAAK,CAAC,IAAI,IAAI,CAACmP,QAAQ,KAAK,CAAC,EAAEnf,CAAC,IAAI,IAAI,CAACgQ,MAAM,GAAG,IAAI,CAACmP,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAA;EACxF,IAAA,IAAI,IAAI,CAACC,KAAK,KAAK,CAAC,EAAEpf,CAAC,IAAI,IAAI,CAACof,KAAK,GAAG,GAAG,CAAA;EAC3C,IAAA,IAAI,IAAI,CAACC,IAAI,KAAK,CAAC,EAAErf,CAAC,IAAI,IAAI,CAACqf,IAAI,GAAG,GAAG,CAAA;MACzC,IAAI,IAAI,CAACtB,KAAK,KAAK,CAAC,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC,EACzF7nB,CAAC,IAAI,GAAG,CAAA;EACV,IAAA,IAAI,IAAI,CAAC+d,KAAK,KAAK,CAAC,EAAE/d,CAAC,IAAI,IAAI,CAAC+d,KAAK,GAAG,GAAG,CAAA;EAC3C,IAAA,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,EAAE1M,CAAC,IAAI,IAAI,CAAC0M,OAAO,GAAG,GAAG,CAAA;MAC/C,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC;EAC/C;EACA;EACA7nB,MAAAA,CAAC,IAAIiM,OAAO,CAAC,IAAI,CAACqT,OAAO,GAAG,IAAI,CAACuI,YAAY,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;EAChE,IAAA,IAAI7nB,CAAC,KAAK,GAAG,EAAEA,CAAC,IAAI,KAAK,CAAA;EACzB,IAAA,OAAOA,CAAC,CAAA;EACV,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;EAAAkC,EAAAA,MAAA,CAgBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACjB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMyL,MAAM,GAAG,IAAI,CAACC,QAAQ,EAAE,CAAA;MAC9B,IAAID,MAAM,GAAG,CAAC,IAAIA,MAAM,IAAI,QAAQ,EAAE,OAAO,IAAI,CAAA;EAEjD1sB,IAAAA,IAAI,GAAA6G,QAAA,CAAA;EACF+lB,MAAAA,oBAAoB,EAAE,KAAK;EAC3BC,MAAAA,eAAe,EAAE,KAAK;EACtBC,MAAAA,aAAa,EAAE,KAAK;EACpB5sB,MAAAA,MAAM,EAAE,UAAA;EAAU,KAAA,EACfF,IAAI,EAAA;EACP+sB,MAAAA,aAAa,EAAE,KAAA;OAChB,CAAA,CAAA;EAED,IAAA,IAAMC,QAAQ,GAAG9kB,QAAQ,CAACojB,UAAU,CAACoB,MAAM,EAAE;EAAE/oB,MAAAA,IAAI,EAAE,KAAA;EAAM,KAAC,CAAC,CAAA;EAC7D,IAAA,OAAOqpB,QAAQ,CAACP,SAAS,CAACzsB,IAAI,CAAC,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAJ,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5sB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,OAAO,IAAI,CAACgd,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,qBAAA,GAA6B/b,IAAI,CAACC,SAAS,CAAC,IAAI,CAACqd,MAAM,CAAC,GAAA,IAAA,CAAA;EAC1D,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAAC0K,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAttB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAAC1L,OAAO,EAAE,OAAO9c,GAAG,CAAA;MAE7B,OAAO+lB,gBAAgB,CAAC,IAAI,CAACF,MAAM,EAAE,IAAI,CAACxH,MAAM,CAAC,CAAA;EACnD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5iB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA/sB,EAAAA,MAAA,CAKAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;QAC7C7F,MAAM,GAAG,EAAE,CAAA;EAEb,IAAA,KAAA,IAAA8F,GAAA,GAAA,CAAA,EAAAC,aAAA,GAAgB3D,cAAY,EAAA0D,GAAA,GAAAC,aAAA,CAAApqB,MAAA,EAAAmqB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAM/U,CAAC,GAAAgV,aAAA,CAAAD,GAAA,CAAA,CAAA;EACV,MAAA,IAAI9U,cAAc,CAACgJ,GAAG,CAACiB,MAAM,EAAElK,CAAC,CAAC,IAAIC,cAAc,CAAC,IAAI,CAACiK,MAAM,EAAElK,CAAC,CAAC,EAAE;EACnEiP,QAAAA,MAAM,CAACjP,CAAC,CAAC,GAAGiJ,GAAG,CAAC/gB,GAAG,CAAC8X,CAAC,CAAC,GAAG,IAAI,CAAC9X,GAAG,CAAC8X,CAAC,CAAC,CAAA;EACtC,OAAA;EACF,KAAA;MAEA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;OAAQ,EAAE,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA3nB,EAAAA,MAAA,CAKA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;MAC/C,OAAO,IAAI,CAACjjB,IAAI,CAACoX,GAAG,CAACiM,MAAM,EAAE,CAAC,CAAA;EAChC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA5tB,EAAAA,MAAA,CAOA6tB,QAAQ,GAAR,SAAAA,QAAAA,CAASC,EAAE,EAAE;EACX,IAAA,IAAI,CAAC,IAAI,CAACzM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMsG,MAAM,GAAG,EAAE,CAAA;MACjB,KAAAoG,IAAAA,GAAA,MAAAC,YAAA,GAAgBvkB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmL,GAAA,GAAAC,YAAA,CAAA1qB,MAAA,EAAAyqB,GAAA,EAAE,EAAA;EAArC,MAAA,IAAMrV,CAAC,GAAAsV,YAAA,CAAAD,GAAA,CAAA,CAAA;EACVpG,MAAAA,MAAM,CAACjP,CAAC,CAAC,GAAG4C,QAAQ,CAACwS,EAAE,CAAC,IAAI,CAAClL,MAAM,CAAClK,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAA;EAC7C,KAAA;MACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;OAAQ,EAAE,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA3nB,EAAAA,MAAA,CAQAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;MACR,OAAO,IAAI,CAAC6sB,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAwC,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAM4M,KAAK,GAAAhnB,QAAA,CAAQ,EAAA,EAAA,IAAI,CAAC2b,MAAM,EAAKnH,eAAe,CAACmH,MAAM,EAAEyH,QAAQ,CAACsB,aAAa,CAAC,CAAE,CAAA;MACpF,OAAOle,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAEqL,KAAAA;EAAM,KAAC,CAAC,CAAA;EACvC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAjuB,EAAAA,MAAA,CAKAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAAxhB,KAAA,EAA0E;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAA1DxL,MAAM,GAAAD,IAAA,CAANC,MAAM;QAAE2G,eAAe,GAAA5G,IAAA,CAAf4G,eAAe;QAAEsiB,kBAAkB,GAAAlpB,IAAA,CAAlBkpB,kBAAkB;QAAEC,MAAM,GAAAnpB,IAAA,CAANmpB,MAAM,CAAA;EAC/D,IAAA,IAAMzhB,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;EAAEvM,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAAA;EAAgB,KAAC,CAAC,CAAA;EACvD,IAAA,IAAMzH,IAAI,GAAG;EAAEuI,MAAAA,GAAG,EAAHA,GAAG;EAAEyhB,MAAAA,MAAM,EAANA,MAAM;EAAED,MAAAA,kBAAkB,EAAlBA,kBAAAA;OAAoB,CAAA;EAChD,IAAA,OAAO1c,OAAK,CAAC,IAAI,EAAErN,IAAI,CAAC,CAAA;EAC1B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAJ,EAAAA,MAAA,CAQAmuB,EAAE,GAAF,SAAAA,EAAAA,CAAG3wB,IAAI,EAAE;EACP,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACoB,OAAO,CAACjlB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;EAC1D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;EAAAvE,EAAAA,MAAA,CAeAouB,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAAC/M,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;EAC5BjC,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEG,IAAI,CAAC,CAAA;MAClC,OAAO9c,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvqB,EAAAA,MAAA,CAKAquB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,IAAI,CAAC,IAAI,CAAChN,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACoD,SAAS,EAAE,CAACE,UAAU,EAAE,CAAC3B,QAAQ,EAAE,CAAC,CAAA;MACnE,OAAOlf,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvqB,EAAAA,MAAA,CAKAyiB,OAAO,GAAP,SAAAA,UAAkB;EAAA,IAAA,KAAA,IAAAM,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAPyZ,KAAK,GAAAjF,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAALlG,MAAAA,KAAK,CAAAkG,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;EACd,IAAA,IAAI,CAAC,IAAI,CAAC5B,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAItE,KAAK,CAACzZ,MAAM,KAAK,CAAC,EAAE;EACtB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAyZ,IAAAA,KAAK,GAAGA,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;EAAA,MAAA,OAAKyO,QAAQ,CAACsB,aAAa,CAAC/P,CAAC,CAAC,CAAA;OAAC,CAAA,CAAA;MAEnD,IAAM2S,KAAK,GAAG,EAAE;QACdC,WAAW,GAAG,EAAE;EAChBjE,MAAAA,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;EACxB,IAAA,IAAI8B,QAAQ,CAAA;EAEZ,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgB5E,cAAY,EAAA2E,GAAA,GAAAC,cAAA,CAAArrB,MAAA,EAAAorB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAMhW,CAAC,GAAAiW,cAAA,CAAAD,GAAA,CAAA,CAAA;QACV,IAAI3R,KAAK,CAACzV,OAAO,CAACoR,CAAC,CAAC,IAAI,CAAC,EAAE;EACzB+V,QAAAA,QAAQ,GAAG/V,CAAC,CAAA;UAEZ,IAAIkW,GAAG,GAAG,CAAC,CAAA;;EAEX;EACA,QAAA,KAAK,IAAMC,EAAE,IAAIL,WAAW,EAAE;EAC5BI,UAAAA,GAAG,IAAI,IAAI,CAACxE,MAAM,CAACyE,EAAE,CAAC,CAACnW,CAAC,CAAC,GAAG8V,WAAW,CAACK,EAAE,CAAC,CAAA;EAC3CL,UAAAA,WAAW,CAACK,EAAE,CAAC,GAAG,CAAC,CAAA;EACrB,SAAA;;EAEA;EACA,QAAA,IAAIne,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;EACrBkW,UAAAA,GAAG,IAAIrE,IAAI,CAAC7R,CAAC,CAAC,CAAA;EAChB,SAAA;;EAEA;EACA;EACA,QAAA,IAAMrV,CAAC,GAAGsB,IAAI,CAACwV,KAAK,CAACyU,GAAG,CAAC,CAAA;EACzBL,QAAAA,KAAK,CAAC7V,CAAC,CAAC,GAAGrV,CAAC,CAAA;EACZmrB,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG,CAACkW,GAAG,GAAG,IAAI,GAAGvrB,CAAC,GAAG,IAAI,IAAI,IAAI,CAAA;;EAE/C;SACD,MAAM,IAAIqN,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;EAC5B8V,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG6R,IAAI,CAAC7R,CAAC,CAAC,CAAA;EAC1B,OAAA;EACF,KAAA;;EAEA;EACA;EACA,IAAA,KAAK,IAAM/X,GAAG,IAAI6tB,WAAW,EAAE;EAC7B,MAAA,IAAIA,WAAW,CAAC7tB,GAAG,CAAC,KAAK,CAAC,EAAE;UAC1B4tB,KAAK,CAACE,QAAQ,CAAC,IACb9tB,GAAG,KAAK8tB,QAAQ,GAAGD,WAAW,CAAC7tB,GAAG,CAAC,GAAG6tB,WAAW,CAAC7tB,GAAG,CAAC,GAAG,IAAI,CAACypB,MAAM,CAACqE,QAAQ,CAAC,CAAC9tB,GAAG,CAAC,CAAA;EACvF,OAAA;EACF,KAAA;EAEA+pB,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEmE,KAAK,CAAC,CAAA;MACnC,OAAO9gB,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2L,KAAAA;OAAO,EAAE,IAAI,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvuB,EAAAA,MAAA,CAKAsuB,UAAU,GAAV,SAAAA,aAAa;EACX,IAAA,IAAI,CAAC,IAAI,CAACjN,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,OAAO,IAAI,CAACoB,OAAO,CACjB,OAAO,EACP,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cACF,CAAC,CAAA;EACH,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAziB,EAAAA,MAAA,CAKA4tB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,IAAI,CAAC,IAAI,CAACvM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMyN,OAAO,GAAG,EAAE,CAAA;MAClB,KAAAC,IAAAA,GAAA,MAAAC,aAAA,GAAgBvlB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmM,GAAA,GAAAC,aAAA,CAAA1rB,MAAA,EAAAyrB,GAAA,EAAE,EAAA;EAArC,MAAA,IAAMrW,CAAC,GAAAsW,aAAA,CAAAD,GAAA,CAAA,CAAA;QACVD,OAAO,CAACpW,CAAC,CAAC,GAAG,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,CAAA;EACzD,KAAA;MACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAEkM,OAAAA;OAAS,EAAE,IAAI,CAAC,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA9uB,EAAAA,MAAA,CAKAivB,WAAW,GAAX,SAAAA,cAAc;EACZ,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACpI,MAAM,CAAC,CAAA;MACtC,OAAOnV,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAiGA;EACF;EACA;EACA;EACA;EACA;EALEvqB,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;EACnC,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MAEA,IAAI,CAAC,IAAI,CAAC1Y,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,EAAE;EAC/B,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAEA,IAAA,SAASumB,EAAEA,CAACC,EAAE,EAAEC,EAAE,EAAE;EAClB;EACA,MAAA,IAAID,EAAE,KAAKntB,SAAS,IAAImtB,EAAE,KAAK,CAAC,EAAE,OAAOC,EAAE,KAAKptB,SAAS,IAAIotB,EAAE,KAAK,CAAC,CAAA;QACrE,OAAOD,EAAE,KAAKC,EAAE,CAAA;EAClB,KAAA;EAEA,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgBvF,cAAY,EAAAsF,GAAA,GAAAC,cAAA,CAAAhsB,MAAA,EAAA+rB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAMzT,CAAC,GAAA0T,cAAA,CAAAD,GAAA,CAAA,CAAA;EACV,MAAA,IAAI,CAACH,EAAE,CAAC,IAAI,CAACtM,MAAM,CAAChH,CAAC,CAAC,EAAEjM,KAAK,CAACiT,MAAM,CAAChH,CAAC,CAAC,CAAC,EAAE;EACxC,QAAA,OAAO,KAAK,CAAA;EACd,OAAA;EACF,KAAA;EACA,IAAA,OAAO,IAAI,CAAA;KACZ,CAAA;EAAAlb,EAAAA,YAAA,CAAA2pB,QAAA,EAAA,CAAA;MAAA1pB,GAAA,EAAA,QAAA;MAAAC,GAAA,EAzjBD,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;EAC9C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,EAAA;MAAAlH,GAAA,EAAA,OAAA;MAAAC,GAAA,EAsbD,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC5F,KAAK,IAAI,CAAC,GAAGzY,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;EACb,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC3F,QAAQ,IAAI,CAAC,GAAG1Y,GAAG,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAa;EACX,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC9U,MAAM,IAAI,CAAC,GAAGvJ,GAAG,CAAA;EACrD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC1F,KAAK,IAAI,CAAC,GAAG3Y,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,MAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACzF,IAAI,IAAI,CAAC,GAAG5Y,GAAG,CAAA;EACnD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC/G,KAAK,IAAI,CAAC,GAAGtX,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACpY,OAAO,IAAI,CAAC,GAAGjG,GAAG,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACxF,OAAO,IAAI,CAAC,GAAG7Y,GAAG,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC+C,YAAY,IAAI,CAAC,GAAGphB,GAAG,CAAA;EAC3D,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7qB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA0W,QAAA,CAAA;EAAA,CAAA,CApWAkF,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ECtmB3C,IAAM/F,SAAO,GAAG,kBAAkB,CAAA;;EAElC;EACA,SAASgG,gBAAgBA,CAAC/O,KAAK,EAAEE,GAAG,EAAE;EACpC,EAAA,IAAI,CAACF,KAAK,IAAI,CAACA,KAAK,CAACW,OAAO,EAAE;EAC5B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,0BAA0B,CAAC,CAAA;KACpD,MAAM,IAAI,CAAC5K,GAAG,IAAI,CAACA,GAAG,CAACS,OAAO,EAAE;EAC/B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,wBAAwB,CAAC,CAAA;EACnD,GAAC,MAAM,IAAI5K,GAAG,GAAGF,KAAK,EAAE;EACtB,IAAA,OAAOgP,QAAQ,CAAClE,OAAO,CACrB,kBAAkB,yEACmD9K,KAAK,CAACkM,KAAK,EAAE,GAAYhM,WAAAA,GAAAA,GAAG,CAACgM,KAAK,EACzG,CAAC,CAAA;EACH,GAAC,MAAM;EACL,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqB8C,MAAAA,QAAQ,0BAAArE,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAAqE,QAAAA,CAAYpE,MAAM,EAAE;EAClB;EACJ;EACA;EACI,IAAA,IAAI,CAACxtB,CAAC,GAAGwtB,MAAM,CAAC5K,KAAK,CAAA;EACrB;EACJ;EACA;EACI,IAAA,IAAI,CAACtc,CAAC,GAAGknB,MAAM,CAAC1K,GAAG,CAAA;EACnB;EACJ;EACA;EACI,IAAA,IAAI,CAAC4K,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;EACrC;EACJ;EACA;MACI,IAAI,CAACmE,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;IALED,QAAA,CAMOlE,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAItW,oBAAoB,CAACwuB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAIkE,QAAQ,CAAC;EAAElE,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAkE,QAAA,CAMOE,aAAa,GAApB,SAAAA,cAAqBlP,KAAK,EAAEE,GAAG,EAAE;EAC/B,IAAA,IAAMiP,UAAU,GAAGC,gBAAgB,CAACpP,KAAK,CAAC;EACxCqP,MAAAA,QAAQ,GAAGD,gBAAgB,CAAClP,GAAG,CAAC,CAAA;EAElC,IAAA,IAAMoP,aAAa,GAAGP,gBAAgB,CAACI,UAAU,EAAEE,QAAQ,CAAC,CAAA;MAE5D,IAAIC,aAAa,IAAI,IAAI,EAAE;QACzB,OAAO,IAAIN,QAAQ,CAAC;EAClBhP,QAAAA,KAAK,EAAEmP,UAAU;EACjBjP,QAAAA,GAAG,EAAEmP,QAAAA;EACP,OAAC,CAAC,CAAA;EACJ,KAAC,MAAM;EACL,MAAA,OAAOC,aAAa,CAAA;EACtB,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAN,QAAA,CAMOO,KAAK,GAAZ,SAAAA,MAAavP,KAAK,EAAE8M,QAAQ,EAAE;EAC5B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;EAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAACpP,KAAK,CAAC,CAAA;EAC9B,IAAA,OAAOgP,QAAQ,CAACE,aAAa,CAACvnB,EAAE,EAAEA,EAAE,CAACkC,IAAI,CAACoX,GAAG,CAAC,CAAC,CAAA;EACjD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA+N,QAAA,CAMOQ,MAAM,GAAb,SAAAA,OAActP,GAAG,EAAE4M,QAAQ,EAAE;EAC3B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;EAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAAClP,GAAG,CAAC,CAAA;EAC5B,IAAA,OAAO8O,QAAQ,CAACE,aAAa,CAACvnB,EAAE,CAACslB,KAAK,CAAChM,GAAG,CAAC,EAAEtZ,EAAE,CAAC,CAAA;EAClD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAqnB,QAAA,CAQO3D,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;EACzB,IAAA,IAAA+vB,MAAA,GAAe,CAACnE,IAAI,IAAI,EAAE,EAAE7Z,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EAAlCrU,MAAAA,CAAC,GAAAqyB,MAAA,CAAA,CAAA,CAAA;EAAE/rB,MAAAA,CAAC,GAAA+rB,MAAA,CAAA,CAAA,CAAA,CAAA;MACX,IAAIryB,CAAC,IAAIsG,CAAC,EAAE;QACV,IAAIsc,KAAK,EAAE0P,YAAY,CAAA;QACvB,IAAI;UACF1P,KAAK,GAAGpY,QAAQ,CAACyjB,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;UACjCgwB,YAAY,GAAG1P,KAAK,CAACW,OAAO,CAAA;SAC7B,CAAC,OAAOjd,CAAC,EAAE;EACVgsB,QAAAA,YAAY,GAAG,KAAK,CAAA;EACtB,OAAA;QAEA,IAAIxP,GAAG,EAAEyP,UAAU,CAAA;QACnB,IAAI;UACFzP,GAAG,GAAGtY,QAAQ,CAACyjB,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;UAC/BiwB,UAAU,GAAGzP,GAAG,CAACS,OAAO,CAAA;SACzB,CAAC,OAAOjd,CAAC,EAAE;EACVisB,QAAAA,UAAU,GAAG,KAAK,CAAA;EACpB,OAAA;QAEA,IAAID,YAAY,IAAIC,UAAU,EAAE;EAC9B,QAAA,OAAOX,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAEE,GAAG,CAAC,CAAA;EAC3C,OAAA;EAEA,MAAA,IAAIwP,YAAY,EAAE;UAChB,IAAMzO,GAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;UACrC,IAAIuhB,GAAG,CAACN,OAAO,EAAE;EACf,UAAA,OAAOqO,QAAQ,CAACO,KAAK,CAACvP,KAAK,EAAEiB,GAAG,CAAC,CAAA;EACnC,SAAA;SACD,MAAM,IAAI0O,UAAU,EAAE;UACrB,IAAM1O,IAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;UACrC,IAAIuhB,IAAG,CAACN,OAAO,EAAE;EACf,UAAA,OAAOqO,QAAQ,CAACQ,MAAM,CAACtP,GAAG,EAAEe,IAAG,CAAC,CAAA;EAClC,SAAA;EACF,OAAA;EACF,KAAA;MACA,OAAO+N,QAAQ,CAAClE,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA0D,EAAAA,QAAA,CAKOY,UAAU,GAAjB,SAAAA,UAAAA,CAAkB5Y,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACiY,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA,EAAA,IAAA3vB,MAAA,GAAA0vB,QAAA,CAAAzvB,SAAA,CAAA;EAiDA;EACF;EACA;EACA;EACA;EAJED,EAAAA,MAAA,CAKAsD,MAAM,GAAN,SAAAA,MAAAA,CAAO9F,IAAI,EAAmB;EAAA,IAAA,IAAvBA,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;MAC1B,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACkP,UAAU,CAAAh0B,KAAA,CAAf,IAAI,EAAe,CAACiB,IAAI,CAAC,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;IAAAvE,MAAA,CASAqL,KAAK,GAAL,SAAAA,MAAM7N,IAAI,EAAmB4C,IAAI,EAAE;EAAA,IAAA,IAA7B5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EACzB,IAAA,IAAI,CAAC,IAAI,CAAC6jB,OAAO,EAAE,OAAO9c,GAAG,CAAA;MAC7B,IAAMmc,KAAK,GAAG,IAAI,CAACA,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC5C,IAAA,IAAIwgB,GAAG,CAAA;EACP,IAAA,IAAIxgB,IAAI,IAAA,IAAA,IAAJA,IAAI,CAAEqwB,cAAc,EAAE;EACxB7P,MAAAA,GAAG,GAAG,IAAI,CAACA,GAAG,CAACsN,WAAW,CAAC;UAAEhtB,MAAM,EAAEwf,KAAK,CAACxf,MAAAA;EAAO,OAAC,CAAC,CAAA;EACtD,KAAC,MAAM;QACL0f,GAAG,GAAG,IAAI,CAACA,GAAG,CAAA;EAChB,KAAA;MACAA,GAAG,GAAGA,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC7B,IAAA,OAAOuE,IAAI,CAAC2E,KAAK,CAACsX,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAC,IAAIojB,GAAG,CAAC2M,OAAO,EAAE,KAAK,IAAI,CAAC3M,GAAG,CAAC2M,OAAO,EAAE,CAAC,CAAA;EAC7F,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvtB,EAAAA,MAAA,CAKA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQnzB,IAAI,EAAE;EACZ,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACuP,OAAO,EAAE,IAAI,IAAI,CAACxsB,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,CAACgD,OAAO,CAAC,IAAI,CAAC7yB,CAAC,EAAEN,IAAI,CAAC,GAAG,KAAK,CAAA;EACvF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAwC,EAAAA,MAAA,CAIA4wB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAAC9yB,CAAC,CAACyvB,OAAO,EAAE,KAAK,IAAI,CAACnpB,CAAC,CAACmpB,OAAO,EAAE,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvtB,EAAAA,MAAA,CAKA6wB,OAAO,GAAP,SAAAA,OAAAA,CAAQzD,QAAQ,EAAE;EAChB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,GAAGsvB,QAAQ,CAAA;EAC1B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAptB,EAAAA,MAAA,CAKA8wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS1D,QAAQ,EAAE;EACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACjd,CAAC,IAAIgpB,QAAQ,CAAA;EAC3B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAptB,EAAAA,MAAA,CAKA+wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS3D,QAAQ,EAAE;EACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,IAAI,CAACvjB,CAAC,IAAIsvB,QAAQ,IAAI,IAAI,CAAChpB,CAAC,GAAGgpB,QAAQ,CAAA;EAChD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAptB,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAAuK,KAAA,EAAyB;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAjBgU,KAAK,GAAAzf,IAAA,CAALyf,KAAK;QAAEE,GAAG,GAAA3f,IAAA,CAAH2f,GAAG,CAAA;EACd,IAAA,IAAI,CAAC,IAAI,CAACS,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,OAAOqO,QAAQ,CAACE,aAAa,CAAClP,KAAK,IAAI,IAAI,CAAC5iB,CAAC,EAAE8iB,GAAG,IAAI,IAAI,CAACxc,CAAC,CAAC,CAAA;EAC/D,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKAgxB,OAAO,GAAP,SAAAA,UAAsB;EAAA,IAAA,IAAA3sB,KAAA,GAAA,IAAA,CAAA;EACpB,IAAA,IAAI,CAAC,IAAI,CAACgd,OAAO,EAAE,OAAO,EAAE,CAAA;EAAC,IAAA,KAAA,IAAA0B,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EADpB2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;EAElB,IAAA,IAAMiO,MAAM,GAAGD,SAAS,CACnBvmB,GAAG,CAAColB,gBAAgB,CAAC,CACrBpN,MAAM,CAAC,UAAC1O,CAAC,EAAA;EAAA,QAAA,OAAK3P,KAAI,CAAC0sB,QAAQ,CAAC/c,CAAC,CAAC,CAAA;EAAA,OAAA,CAAC,CAC/Bmd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;UAAA,OAAK3Y,CAAC,CAACsU,QAAQ,EAAE,GAAGqE,CAAC,CAACrE,QAAQ,EAAE,CAAA;SAAC,CAAA;EAC9Cle,MAAAA,OAAO,GAAG,EAAE,CAAA;EACV,IAAA,IAAE/Q,CAAC,GAAK,IAAI,CAAVA,CAAC;EACLuF,MAAAA,CAAC,GAAG,CAAC,CAAA;EAEP,IAAA,OAAOvF,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;QACjB,IAAMitB,KAAK,GAAGH,MAAM,CAAC7tB,CAAC,CAAC,IAAI,IAAI,CAACe,CAAC;EAC/BkU,QAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;QAC1CxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;EAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;EACRjV,MAAAA,CAAC,IAAI,CAAC,CAAA;EACR,KAAA;EAEA,IAAA,OAAOwL,OAAO,CAAA;EAChB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA7O,EAAAA,MAAA,CAMAsxB,OAAO,GAAP,SAAAA,OAAAA,CAAQ9D,QAAQ,EAAE;EAChB,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;EAE/C,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,IAAI,CAACM,GAAG,CAACN,OAAO,IAAIM,GAAG,CAACwM,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;EACjE,MAAA,OAAO,EAAE,CAAA;EACX,KAAA;EAEI,IAAA,IAAErwB,CAAC,GAAK,IAAI,CAAVA,CAAC;EACLyzB,MAAAA,GAAG,GAAG,CAAC;QACPjZ,IAAI,CAAA;MAEN,IAAMzJ,OAAO,GAAG,EAAE,CAAA;EAClB,IAAA,OAAO/Q,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;EACjB,MAAA,IAAMitB,KAAK,GAAG,IAAI,CAAC3Q,KAAK,CAACnW,IAAI,CAACoX,GAAG,CAACkM,QAAQ,CAAC,UAACzU,CAAC,EAAA;UAAA,OAAKA,CAAC,GAAGmY,GAAG,CAAA;EAAA,OAAA,CAAC,CAAC,CAAA;EAC3DjZ,MAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;QACxCxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;EAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;EACRiZ,MAAAA,GAAG,IAAI,CAAC,CAAA;EACV,KAAA;EAEA,IAAA,OAAO1iB,OAAO,CAAA;EAChB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA7O,EAAAA,MAAA,CAKAwxB,aAAa,GAAb,SAAAA,aAAAA,CAAcC,aAAa,EAAE;EAC3B,IAAA,IAAI,CAAC,IAAI,CAACpQ,OAAO,EAAE,OAAO,EAAE,CAAA;EAC5B,IAAA,OAAO,IAAI,CAACiQ,OAAO,CAAC,IAAI,CAAChuB,MAAM,EAAE,GAAGmuB,aAAa,CAAC,CAACjQ,KAAK,CAAC,CAAC,EAAEiQ,aAAa,CAAC,CAAA;EAC5E,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAzxB,EAAAA,MAAA,CAKA0xB,QAAQ,GAAR,SAAAA,QAAAA,CAAS/hB,KAAK,EAAE;EACd,IAAA,OAAO,IAAI,CAACvL,CAAC,GAAGuL,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAACvL,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKA2xB,UAAU,GAAV,SAAAA,UAAAA,CAAWhiB,KAAK,EAAE;EAChB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,CAAC,IAAI,CAACjd,CAAC,KAAK,CAACuL,KAAK,CAAC7R,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAkC,EAAAA,MAAA,CAKA4xB,QAAQ,GAAR,SAAAA,QAAAA,CAASjiB,KAAK,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,CAAC1R,KAAK,CAACvL,CAAC,KAAK,CAAC,IAAI,CAACtG,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAkC,EAAAA,MAAA,CAKA6xB,OAAO,GAAP,SAAAA,OAAAA,CAAQliB,KAAK,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,IAAI6R,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACsG,CAAC,IAAIuL,KAAK,CAACvL,CAAC,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;EACnC,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MAEA,OAAO,IAAI,CAACvjB,CAAC,CAAC0C,MAAM,CAACmP,KAAK,CAAC7R,CAAC,CAAC,IAAI,IAAI,CAACsG,CAAC,CAAC5D,MAAM,CAACmP,KAAK,CAACvL,CAAC,CAAC,CAAA;EACzD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAApE,EAAAA,MAAA,CAOA8xB,YAAY,GAAZ,SAAAA,YAAAA,CAAaniB,KAAK,EAAE;EAClB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;EAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;MAEzC,IAAItG,CAAC,IAAIsG,CAAC,EAAE;EACV,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM;EACL,MAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAApE,EAAAA,MAAA,CAMA+xB,KAAK,GAAL,SAAAA,KAAAA,CAAMpiB,KAAK,EAAE;EACX,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;EAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;EACzC,IAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;EAAAsrB,EAAAA,QAAA,CASOsC,KAAK,GAAZ,SAAAA,KAAAA,CAAaC,SAAS,EAAE;MACtB,IAAAC,qBAAA,GAAuBD,SAAS,CAC7Bd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;EAAA,QAAA,OAAK3Y,CAAC,CAAC3a,CAAC,GAAGszB,CAAC,CAACtzB,CAAC,CAAA;EAAA,OAAA,CAAC,CACzBsa,MAAM,CACL,UAAA3T,KAAA,EAAmBghB,IAAI,EAAK;UAAA,IAA1B0M,KAAK,GAAA1tB,KAAA,CAAA,CAAA,CAAA;EAAEob,UAAAA,OAAO,GAAApb,KAAA,CAAA,CAAA,CAAA,CAAA;UACd,IAAI,CAACob,OAAO,EAAE;EACZ,UAAA,OAAO,CAACsS,KAAK,EAAE1M,IAAI,CAAC,CAAA;EACtB,SAAC,MAAM,IAAI5F,OAAO,CAAC6R,QAAQ,CAACjM,IAAI,CAAC,IAAI5F,OAAO,CAAC8R,UAAU,CAAClM,IAAI,CAAC,EAAE;YAC7D,OAAO,CAAC0M,KAAK,EAAEtS,OAAO,CAACkS,KAAK,CAACtM,IAAI,CAAC,CAAC,CAAA;EACrC,SAAC,MAAM;YACL,OAAO,CAAC0M,KAAK,CAACjW,MAAM,CAAC,CAAC2D,OAAO,CAAC,CAAC,EAAE4F,IAAI,CAAC,CAAA;EACxC,SAAA;EACF,OAAC,EACD,CAAC,EAAE,EAAE,IAAI,CACX,CAAC;EAbIlD,MAAAA,KAAK,GAAA2P,qBAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,KAAK,GAAAF,qBAAA,CAAA,CAAA,CAAA,CAAA;EAcnB,IAAA,IAAIE,KAAK,EAAE;EACT7P,MAAAA,KAAK,CAAC/Z,IAAI,CAAC4pB,KAAK,CAAC,CAAA;EACnB,KAAA;EACA,IAAA,OAAO7P,KAAK,CAAA;EACd,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAmN,EAAAA,QAAA,CAKO2C,GAAG,GAAV,SAAAA,GAAAA,CAAWJ,SAAS,EAAE;EAAA,IAAA,IAAAK,gBAAA,CAAA;MACpB,IAAI5R,KAAK,GAAG,IAAI;EACd6R,MAAAA,YAAY,GAAG,CAAC,CAAA;MAClB,IAAM1jB,OAAO,GAAG,EAAE;EAChB2jB,MAAAA,IAAI,GAAGP,SAAS,CAACvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;EAAA,QAAA,OAAK,CAC1B;YAAEovB,IAAI,EAAEpvB,CAAC,CAACvF,CAAC;EAAEwD,UAAAA,IAAI,EAAE,GAAA;EAAI,SAAC,EACxB;YAAEmxB,IAAI,EAAEpvB,CAAC,CAACe,CAAC;EAAE9C,UAAAA,IAAI,EAAE,GAAA;EAAI,SAAC,CACzB,CAAA;SAAC,CAAA;EACFoxB,MAAAA,SAAS,GAAG,CAAAJ,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIE,IAAI,CAAC;QAC3Cva,GAAG,GAAGya,SAAS,CAACvB,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;EAAA,QAAA,OAAK3Y,CAAC,CAACga,IAAI,GAAGrB,CAAC,CAACqB,IAAI,CAAA;SAAC,CAAA,CAAA;EAEjD,IAAA,KAAA,IAAA1U,SAAA,GAAAC,+BAAA,CAAgB/F,GAAG,CAAA,EAAAgG,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,MAAA,IAAV7a,CAAC,GAAA4a,KAAA,CAAAza,KAAA,CAAA;QACV+uB,YAAY,IAAIlvB,CAAC,CAAC/B,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAEvC,IAAIixB,YAAY,KAAK,CAAC,EAAE;UACtB7R,KAAK,GAAGrd,CAAC,CAACovB,IAAI,CAAA;EAChB,OAAC,MAAM;UACL,IAAI/R,KAAK,IAAI,CAACA,KAAK,KAAK,CAACrd,CAAC,CAACovB,IAAI,EAAE;EAC/B5jB,UAAAA,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAErd,CAAC,CAACovB,IAAI,CAAC,CAAC,CAAA;EACrD,SAAA;EAEA/R,QAAAA,KAAK,GAAG,IAAI,CAAA;EACd,OAAA;EACF,KAAA;EAEA,IAAA,OAAOgP,QAAQ,CAACsC,KAAK,CAACnjB,OAAO,CAAC,CAAA;EAChC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA7O,EAAAA,MAAA,CAKA2yB,UAAU,GAAV,SAAAA,aAAyB;EAAA,IAAA,IAAA5kB,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,KAAA,IAAAsV,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2uB,SAAS,GAAAna,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAT0O,MAAAA,SAAS,CAAA1O,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,KAAA;EACrB,IAAA,OAAOmM,QAAQ,CAAC2C,GAAG,CAAC,CAAC,IAAI,CAAC,CAACnW,MAAM,CAAC+V,SAAS,CAAC,CAAC,CAC1CvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;EAAA,MAAA,OAAK0K,MAAI,CAAC+jB,YAAY,CAACzuB,CAAC,CAAC,CAAA;EAAA,KAAA,CAAC,CAChCqf,MAAM,CAAC,UAACrf,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,IAAI,CAACA,CAAC,CAACutB,OAAO,EAAE,CAAA;OAAC,CAAA,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5wB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAACyR,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAA,GAAA,GAAW,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,EAAE,GAAM,UAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,GAAA,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,oBAAA,GAA4B,IAAI,CAACvjB,CAAC,CAAC8uB,KAAK,EAAE,GAAU,SAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,IAAA,CAAA;EACpE,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAACU,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAjBE;IAAAttB,MAAA,CAkBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;EAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG3B,UAAkB,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAChG,CAAC,CAAC6K,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACK,cAAc,CAAC,IAAI,CAAC,GACzEiJ,SAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAzpB,EAAAA,MAAA,CAMA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAMxsB,IAAI,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,CAACxsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACwoB,KAAK,CAACxsB,IAAI,CAAC,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAJ,EAAAA,MAAA,CAMA6yB,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAACxR,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+0B,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACzuB,CAAC,CAACyuB,SAAS,EAAE,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA7yB,EAAAA,MAAA,CAOA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+uB,SAAS,CAACzsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACyoB,SAAS,CAACzsB,IAAI,CAAC,CAAA;EAC5D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAJ,MAAA,CAWAqsB,QAAQ,GAAR,SAAAA,SAASyG,UAAU,EAAAC,MAAA,EAA8B;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAE,eAAA,GAAAD,KAAA,CAAxBE,SAAS;EAATA,MAAAA,SAAS,GAAAD,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;EACtC,IAAA,IAAI,CAAC,IAAI,CAAC5R,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAA,EAAA,GAAU,IAAI,CAAC3rB,CAAC,CAACuuB,QAAQ,CAACyG,UAAU,CAAC,GAAGI,SAAS,GAAG,IAAI,CAAC9uB,CAAC,CAACioB,QAAQ,CAACyG,UAAU,CAAC,CAAA;EACjF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA9yB,MAAA,CAYAuwB,UAAU,GAAV,SAAAA,WAAW/yB,IAAI,EAAE4C,IAAI,EAAE;EACrB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;EACjB,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,IAAI,CAAC8B,aAAa,CAAC,CAAA;EAC7C,KAAA;EACA,IAAA,OAAO,IAAI,CAAClpB,CAAC,CAACssB,IAAI,CAAC,IAAI,CAAC5yB,CAAC,EAAEN,IAAI,EAAE4C,IAAI,CAAC,CAAA;EACxC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAJ,EAAAA,MAAA,CAOAmzB,YAAY,GAAZ,SAAAA,YAAAA,CAAaC,KAAK,EAAE;EAClB,IAAA,OAAO1D,QAAQ,CAACE,aAAa,CAACwD,KAAK,CAAC,IAAI,CAACt1B,CAAC,CAAC,EAAEs1B,KAAK,CAAC,IAAI,CAAChvB,CAAC,CAAC,CAAC,CAAA;KAC5D,CAAA;EAAA1D,EAAAA,YAAA,CAAAgvB,QAAA,EAAA,CAAA;MAAA/uB,GAAA,EAAA,OAAA;MAAAC,GAAA,EAjeD,SAAAA,GAAAA,GAAY;QACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACvjB,CAAC,GAAG,IAAI,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA6C,GAAA,EAAA,KAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;QACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACjd,CAAC,GAAG,IAAI,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAzD,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAI,IAAI,CAACjd,CAAC,GAAG,IAAI,CAACA,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAI,IAAI,CAAA;EAChE,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAhtB,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC0sB,aAAa,KAAK,IAAI,CAAA;EACpC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA3sB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA+b,QAAA,CAAA;EAAA,CAAA,CAwUAH,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ECriB3C;EACA;EACA;AAFA,MAGqB6D,IAAI,gBAAA,YAAA;EAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;EACvB;EACF;EACA;EACA;EACA;EAJEA,EAAAA,IAAA,CAKOC,MAAM,GAAb,SAAAA,MAAAA,CAAcvvB,IAAI,EAAyB;EAAA,IAAA,IAA7BA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAGgI,QAAQ,CAACwE,WAAW,CAAA;EAAA,KAAA;EACvC,IAAA,IAAMgjB,KAAK,GAAGjrB,QAAQ,CAAC8K,GAAG,EAAE,CAAC9I,OAAO,CAACvG,IAAI,CAAC,CAAC5B,GAAG,CAAC;EAAEjE,MAAAA,KAAK,EAAE,EAAA;EAAG,KAAC,CAAC,CAAA;EAE7D,IAAA,OAAO,CAAC6F,IAAI,CAACyvB,WAAW,IAAID,KAAK,CAAChzB,MAAM,KAAKgzB,KAAK,CAACpxB,GAAG,CAAC;EAAEjE,MAAAA,KAAK,EAAE,CAAA;OAAG,CAAC,CAACqC,MAAM,CAAA;EAC7E,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA8yB,EAAAA,IAAA,CAKOI,eAAe,GAAtB,SAAAA,eAAAA,CAAuB1vB,IAAI,EAAE;EAC3B,IAAA,OAAOF,QAAQ,CAACM,WAAW,CAACJ,IAAI,CAAC,CAAA;EACnC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;EAAAsvB,EAAAA,IAAA,CAcOhjB,aAAa,GAApB,SAAAA,eAAAA,CAAqBC,KAAK,EAAE;EAC1B,IAAA,OAAOD,aAAa,CAACC,KAAK,EAAEvE,QAAQ,CAACwE,WAAW,CAAC,CAAA;EACnD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA8iB,EAAAA,IAAA,CAOO7jB,cAAc,GAArB,SAAAA,cAAAA,CAAA9C,KAAA,EAA6D;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAAgnB,WAAA,GAAAzyB,IAAA,CAAnCC,MAAM;EAANA,MAAAA,MAAM,GAAAwyB,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA;QAAAC,WAAA,GAAA1yB,IAAA,CAAE2yB,MAAM;EAANA,MAAAA,MAAM,GAAAD,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA,CAAA;EAClD,IAAA,OAAO,CAACC,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEsO,cAAc,EAAE,CAAA;EAC3D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA6jB,EAAAA,IAAA,CAQOQ,yBAAyB,GAAhC,SAAAA,yBAAAA,CAAAd,MAAA,EAAwE;EAAA,IAAA,IAAAtuB,KAAA,GAAAsuB,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAe,YAAA,GAAArvB,KAAA,CAAnCvD,MAAM;EAANA,MAAAA,MAAM,GAAA4yB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,YAAA,GAAAtvB,KAAA,CAAEmvB,MAAM;EAANA,MAAAA,MAAM,GAAAG,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAC7D,IAAA,OAAO,CAACH,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEuO,qBAAqB,EAAE,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA4jB,EAAAA,IAAA,CAOOW,kBAAkB,GAAzB,SAAAA,kBAAAA,CAAAC,MAAA,EAAiE;EAAA,IAAA,IAAAjB,KAAA,GAAAiB,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAC,YAAA,GAAAlB,KAAA,CAAnC9xB,MAAM;EAANA,MAAAA,MAAM,GAAAgzB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,YAAA,GAAAnB,KAAA,CAAEY,MAAM;EAANA,MAAAA,MAAM,GAAAO,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EACtD;EACA,IAAA,OAAO,CAACP,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEwO,cAAc,EAAE,CAAC8R,KAAK,EAAE,CAAA;EACnE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;IAAA6R,IAAA,CAiBOvlB,MAAM,GAAb,SAAAA,OACExK,MAAM,EAAA8wB,MAAA,EAEN;EAAA,IAAA,IAFA9wB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA+wB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAAvFnzB,MAAM;EAANA,MAAAA,MAAM,GAAAozB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAExsB,eAAe;EAAfA,MAAAA,eAAe,GAAA0sB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAET,MAAM;EAANA,MAAAA,MAAM,GAAAY,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,oBAAA,GAAAJ,KAAA,CAAErsB,cAAc;EAAdA,MAAAA,cAAc,GAAAysB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;EAElF,IAAA,OAAO,CAACb,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,CAAC,CAAA;EAC1F,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;IAAA+vB,IAAA,CAaOqB,YAAY,GAAnB,SAAAA,aACEpxB,MAAM,EAAAqxB,MAAA,EAEN;EAAA,IAAA,IAFArxB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAAsxB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAAvF1zB,MAAM;EAANA,MAAAA,MAAM,GAAA2zB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAE/sB,eAAe;EAAfA,MAAAA,eAAe,GAAAitB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAEhB,MAAM;EAANA,MAAAA,MAAM,GAAAmB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,oBAAA,GAAAJ,KAAA,CAAE5sB,cAAc;EAAdA,MAAAA,cAAc,GAAAgtB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;EAElF,IAAA,OAAO,CAACpB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,EAAE,IAAI,CAAC,CAAA;EAChG,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAA+vB,IAAA,CAcOhlB,QAAQ,GAAf,SAAAA,SAAgB/K,MAAM,EAAA2xB,MAAA,EAA0E;EAAA,IAAA,IAAhF3xB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA4xB,KAAA,GAAAD,MAAA,cAA6D,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAA3Dh0B,MAAM;EAANA,MAAAA,MAAM,GAAAi0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAErtB,eAAe;EAAfA,MAAAA,eAAe,GAAAutB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAEtB,MAAM;EAANA,MAAAA,MAAM,GAAAyB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EACrF,IAAA,OAAO,CAACzB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,CAAC,CAAA;EAClF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA+vB,IAAA,CAYOiC,cAAc,GAArB,SAAAA,eACEhyB,MAAM,EAAAiyB,MAAA,EAEN;EAAA,IAAA,IAFAjyB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAAkyB,KAAA,GAAAD,MAAA,cAC4C,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAA3Dt0B,MAAM;EAANA,MAAAA,MAAM,GAAAu0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAE3tB,eAAe;EAAfA,MAAAA,eAAe,GAAA6tB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAE5B,MAAM;EAANA,MAAAA,MAAM,GAAA+B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAEtD,IAAA,OAAO,CAAC/B,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,EAAE,IAAI,CAAC,CAAA;EACxF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA+vB,EAAAA,IAAA,CAQO9kB,SAAS,GAAhB,SAAAA,SAAAA,CAAAqnB,MAAA,EAAyC;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAApB30B,MAAM;EAANA,MAAAA,MAAM,GAAA40B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;MAC9B,OAAOhvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,CAACqN,SAAS,EAAE,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;IAAA8kB,IAAA,CAUO5kB,IAAI,GAAX,SAAAA,KAAYnL,MAAM,EAAAyyB,MAAA,EAAoC;EAAA,IAAA,IAA1CzyB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,OAAO,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA0yB,KAAA,GAAAD,MAAA,cAAsB,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAApB90B,MAAM;EAANA,MAAAA,MAAM,GAAA+0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAC3C,IAAA,OAAOnvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAACuN,IAAI,CAACnL,MAAM,CAAC,CAAA;EAC5D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;EAAA+vB,EAAAA,IAAA,CASO6C,QAAQ,GAAf,SAAAA,WAAkB;MAChB,OAAO;QAAEC,QAAQ,EAAEjrB,WAAW,EAAE;QAAEkrB,UAAU,EAAE7mB,iBAAiB,EAAC;OAAG,CAAA;KACpE,CAAA;EAAA,EAAA,OAAA8jB,IAAA,CAAA;EAAA,CAAA;;ECzMH,SAASgD,OAAOA,CAACC,OAAO,EAAEC,KAAK,EAAE;EAC/B,EAAA,IAAMC,WAAW,GAAG,SAAdA,WAAWA,CAAInuB,EAAE,EAAA;EAAA,MAAA,OAAKA,EAAE,CAACouB,KAAK,CAAC,CAAC,EAAE;EAAEC,QAAAA,aAAa,EAAE,IAAA;SAAM,CAAC,CAAClG,OAAO,CAAC,KAAK,CAAC,CAACjD,OAAO,EAAE,CAAA;EAAA,KAAA;MACvFnlB,EAAE,GAAGouB,WAAW,CAACD,KAAK,CAAC,GAAGC,WAAW,CAACF,OAAO,CAAC,CAAA;EAChD,EAAA,OAAO3xB,IAAI,CAAC2E,KAAK,CAAC+gB,QAAQ,CAACqB,UAAU,CAACtjB,EAAE,CAAC,CAAC+lB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAA;EACvD,CAAA;EAEA,SAASwI,cAAcA,CAAChT,MAAM,EAAE4S,KAAK,EAAExZ,KAAK,EAAE;IAC5C,IAAM6Z,OAAO,GAAG,CACd,CAAC,OAAO,EAAE,UAACne,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,CAAA;EAAA,GAAA,CAAC,EACpC,CAAC,UAAU,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAAC3P,OAAO,GAAGhJ,CAAC,CAACgJ,OAAO,GAAG,CAAC2P,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,CAAC,CAAA;EAAA,GAAA,CAAC,EACrE,CAAC,QAAQ,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAAClzB,KAAK,GAAGua,CAAC,CAACva,KAAK,GAAG,CAACkzB,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,EAAE,CAAA;KAAC,CAAA,EAChE,CACE,OAAO,EACP,UAACwa,CAAC,EAAE2Y,CAAC,EAAK;EACR,IAAA,IAAMjU,IAAI,GAAGkZ,OAAO,CAAC5d,CAAC,EAAE2Y,CAAC,CAAC,CAAA;EAC1B,IAAA,OAAO,CAACjU,IAAI,GAAIA,IAAI,GAAG,CAAE,IAAI,CAAC,CAAA;EAChC,GAAC,CACF,EACD,CAAC,MAAM,EAAEkZ,OAAO,CAAC,CAClB,CAAA;IAED,IAAMxnB,OAAO,GAAG,EAAE,CAAA;IAClB,IAAMynB,OAAO,GAAG3S,MAAM,CAAA;IACtB,IAAIkT,WAAW,EAAEC,SAAS,CAAA;;EAE1B;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACE,EAAA,KAAA,IAAA7S,EAAA,GAAA,CAAA,EAAA8S,QAAA,GAA6BH,OAAO,EAAA3S,EAAA,GAAA8S,QAAA,CAAAzzB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAjC,IAAA,IAAA+S,WAAA,GAAAD,QAAA,CAAA9S,EAAA,CAAA;EAAOzmB,MAAAA,IAAI,GAAAw5B,WAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,MAAM,GAAAD,WAAA,CAAA,CAAA,CAAA,CAAA;MACtB,IAAIja,KAAK,CAACzV,OAAO,CAAC9J,IAAI,CAAC,IAAI,CAAC,EAAE;EAC5Bq5B,MAAAA,WAAW,GAAGr5B,IAAI,CAAA;QAElBqR,OAAO,CAACrR,IAAI,CAAC,GAAGy5B,MAAM,CAACtT,MAAM,EAAE4S,KAAK,CAAC,CAAA;EACrCO,MAAAA,SAAS,GAAGR,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;QAEjC,IAAIioB,SAAS,GAAGP,KAAK,EAAE;EACrB;UACA1nB,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;EACfmmB,QAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;;EAE9B;EACA;EACA;UACA,IAAI8U,MAAM,GAAG4S,KAAK,EAAE;EAClB;EACAO,UAAAA,SAAS,GAAGnT,MAAM,CAAA;EAClB;YACA9U,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;EACfmmB,UAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;EAChC,SAAA;EACF,OAAC,MAAM;EACL8U,QAAAA,MAAM,GAAGmT,SAAS,CAAA;EACpB,OAAA;EACF,KAAA;EACF,GAAA;IAEA,OAAO,CAACnT,MAAM,EAAE9U,OAAO,EAAEioB,SAAS,EAAED,WAAW,CAAC,CAAA;EAClD,CAAA;EAEe,cAAA,EAAUP,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAE3c,IAAI,EAAE;IACpD,IAAA82B,eAAA,GAAgDP,cAAc,CAACL,OAAO,EAAEC,KAAK,EAAExZ,KAAK,CAAC;EAAhF4G,IAAAA,MAAM,GAAAuT,eAAA,CAAA,CAAA,CAAA;EAAEroB,IAAAA,OAAO,GAAAqoB,eAAA,CAAA,CAAA,CAAA;EAAEJ,IAAAA,SAAS,GAAAI,eAAA,CAAA,CAAA,CAAA;EAAEL,IAAAA,WAAW,GAAAK,eAAA,CAAA,CAAA,CAAA,CAAA;EAE5C,EAAA,IAAMC,eAAe,GAAGZ,KAAK,GAAG5S,MAAM,CAAA;EAEtC,EAAA,IAAMyT,eAAe,GAAGra,KAAK,CAAC2F,MAAM,CAClC,UAAC9G,CAAC,EAAA;EAAA,IAAA,OAAK,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAACtU,OAAO,CAACsU,CAAC,CAAC,IAAI,CAAC,CAAA;EAAA,GACxE,CAAC,CAAA;EAED,EAAA,IAAIwb,eAAe,CAAC9zB,MAAM,KAAK,CAAC,EAAE;MAChC,IAAIwzB,SAAS,GAAGP,KAAK,EAAE;EAAA,MAAA,IAAAc,YAAA,CAAA;EACrBP,MAAAA,SAAS,GAAGnT,MAAM,CAACpZ,IAAI,EAAA8sB,YAAA,GAAA,EAAA,EAAAA,YAAA,CAAIR,WAAW,CAAG,GAAA,CAAC,EAAAQ,YAAA,EAAG,CAAA;EAC/C,KAAA;MAEA,IAAIP,SAAS,KAAKnT,MAAM,EAAE;EACxB9U,MAAAA,OAAO,CAACgoB,WAAW,CAAC,GAAG,CAAChoB,OAAO,CAACgoB,WAAW,CAAC,IAAI,CAAC,IAAIM,eAAe,IAAIL,SAAS,GAAGnT,MAAM,CAAC,CAAA;EAC7F,KAAA;EACF,GAAA;IAEA,IAAM6J,QAAQ,GAAGnD,QAAQ,CAAC5d,UAAU,CAACoC,OAAO,EAAEzO,IAAI,CAAC,CAAA;EAEnD,EAAA,IAAIg3B,eAAe,CAAC9zB,MAAM,GAAG,CAAC,EAAE;EAAA,IAAA,IAAAg0B,oBAAA,CAAA;MAC9B,OAAO,CAAAA,oBAAA,GAAAjN,QAAQ,CAACqB,UAAU,CAACyL,eAAe,EAAE/2B,IAAI,CAAC,EAC9CqiB,OAAO,CAAAlmB,KAAA,CAAA+6B,oBAAA,EAAIF,eAAe,CAAC,CAC3B7sB,IAAI,CAACijB,QAAQ,CAAC,CAAA;EACnB,GAAC,MAAM;EACL,IAAA,OAAOA,QAAQ,CAAA;EACjB,GAAA;EACF;;ECtFA,IAAM+J,WAAW,GAAG,mDAAmD,CAAA;EAEvE,SAASC,OAAOA,CAACtkB,KAAK,EAAEukB,IAAI,EAAa;EAAA,EAAA,IAAjBA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,SAAAA,IAAAA,CAACp0B,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAAA;EAAA,KAAA,CAAA;EAAA,GAAA;IACrC,OAAO;EAAE6P,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAAz2B,IAAA,EAAA;QAAA,IAAEnD,CAAC,GAAAmD,IAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAMw2B,IAAI,CAACrlB,WAAW,CAACtU,CAAC,CAAC,CAAC,CAAA;EAAA,KAAA;KAAE,CAAA;EACxD,CAAA;EAEA,IAAM65B,IAAI,GAAGC,MAAM,CAACC,YAAY,CAAC,GAAG,CAAC,CAAA;EACrC,IAAMC,WAAW,GAAQH,IAAAA,GAAAA,IAAI,GAAG,GAAA,CAAA;EAChC,IAAMI,iBAAiB,GAAG,IAAI5kB,MAAM,CAAC2kB,WAAW,EAAE,GAAG,CAAC,CAAA;EAEtD,SAASE,YAAYA,CAACl6B,CAAC,EAAE;EACvB;EACA;EACA,EAAA,OAAOA,CAAC,CAAC0E,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAACA,OAAO,CAACu1B,iBAAiB,EAAED,WAAW,CAAC,CAAA;EACzE,CAAA;EAEA,SAASG,oBAAoBA,CAACn6B,CAAC,EAAE;IAC/B,OAAOA,CAAC,CACL0E,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;EAAC,GACnBA,OAAO,CAACu1B,iBAAiB,EAAE,GAAG,CAAC;KAC/B9oB,WAAW,EAAE,CAAA;EAClB,CAAA;EAEA,SAASipB,KAAKA,CAACC,OAAO,EAAEC,UAAU,EAAE;IAClC,IAAID,OAAO,KAAK,IAAI,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM;MACL,OAAO;EACLjlB,MAAAA,KAAK,EAAEC,MAAM,CAACglB,OAAO,CAACztB,GAAG,CAACstB,YAAY,CAAC,CAACrtB,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD+sB,KAAK,EAAE,SAAAA,KAAAA,CAAAjzB,KAAA,EAAA;UAAA,IAAE3G,CAAC,GAAA2G,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,QAAA,OACR0zB,OAAO,CAACvjB,SAAS,CAAC,UAACvR,CAAC,EAAA;YAAA,OAAK40B,oBAAoB,CAACn6B,CAAC,CAAC,KAAKm6B,oBAAoB,CAAC50B,CAAC,CAAC,CAAA;EAAA,SAAA,CAAC,GAAG+0B,UAAU,CAAA;EAAA,OAAA;OAC7F,CAAA;EACH,GAAA;EACF,CAAA;EAEA,SAAS73B,MAAMA,CAAC2S,KAAK,EAAEmlB,MAAM,EAAE;IAC7B,OAAO;EAAEnlB,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAA1E,KAAA,EAAA;QAAA,IAAIsF,CAAC,GAAAtF,KAAA,CAAA,CAAA,CAAA;EAAEhkB,QAAAA,CAAC,GAAAgkB,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAM7iB,YAAY,CAACmoB,CAAC,EAAEtpB,CAAC,CAAC,CAAA;EAAA,KAAA;EAAEqpB,IAAAA,MAAM,EAANA,MAAAA;KAAQ,CAAA;EACnE,CAAA;EAEA,SAASE,MAAMA,CAACrlB,KAAK,EAAE;IACrB,OAAO;EAAEA,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAArD,KAAA,EAAA;QAAA,IAAEv2B,CAAC,GAAAu2B,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAMv2B,CAAC,CAAA;EAAA,KAAA;KAAE,CAAA;EACrC,CAAA;EAEA,SAAS06B,WAAWA,CAACh1B,KAAK,EAAE;EAC1B,EAAA,OAAOA,KAAK,CAAChB,OAAO,CAAC,6BAA6B,EAAE,MAAM,CAAC,CAAA;EAC7D,CAAA;;EAEA;EACA;EACA;EACA;EACA,SAASi2B,YAAYA,CAACta,KAAK,EAAExV,GAAG,EAAE;EAChC,EAAA,IAAM+vB,GAAG,GAAG5lB,UAAU,CAACnK,GAAG,CAAC;EACzBgwB,IAAAA,GAAG,GAAG7lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC5BiwB,IAAAA,KAAK,GAAG9lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC9BkwB,IAAAA,IAAI,GAAG/lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC7BmwB,IAAAA,GAAG,GAAGhmB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC5BowB,IAAAA,QAAQ,GAAGjmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACnCqwB,IAAAA,UAAU,GAAGlmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACrCswB,IAAAA,QAAQ,GAAGnmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACnCuwB,IAAAA,SAAS,GAAGpmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCwwB,IAAAA,SAAS,GAAGrmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCywB,IAAAA,SAAS,GAAGtmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCyV,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI3K,CAAC,EAAA;QAAA,OAAM;UAAEP,KAAK,EAAEC,MAAM,CAACqlB,WAAW,CAAC/kB,CAAC,CAAC4K,GAAG,CAAC,CAAC;UAAEqZ,KAAK,EAAE,SAAAA,KAAAA,CAAA9C,KAAA,EAAA;YAAA,IAAE92B,CAAC,GAAA82B,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,UAAA,OAAM92B,CAAC,CAAA;EAAA,SAAA;EAAEsgB,QAAAA,OAAO,EAAE,IAAA;SAAM,CAAA;OAAC;EAC1Fib,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI5lB,CAAC,EAAK;QACf,IAAI0K,KAAK,CAACC,OAAO,EAAE;UACjB,OAAOA,OAAO,CAAC3K,CAAC,CAAC,CAAA;EACnB,OAAA;QACA,QAAQA,CAAC,CAAC4K,GAAG;EACX;EACA,QAAA,KAAK,GAAG;YACN,OAAO6Z,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;EACpC,QAAA,KAAK,IAAI;YACP,OAAOypB,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;EACnC;EACA,QAAA,KAAK,GAAG;YACN,OAAO+oB,OAAO,CAACyB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;EACP,UAAA,OAAOzB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;EAC3C,QAAA,KAAK,MAAM;YACT,OAAO4c,OAAO,CAACqB,IAAI,CAAC,CAAA;EACtB,QAAA,KAAK,OAAO;YACV,OAAOrB,OAAO,CAAC4B,SAAS,CAAC,CAAA;EAC3B,QAAA,KAAK,QAAQ;YACX,OAAO5B,OAAO,CAACsB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOtB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC5C,QAAA,KAAK,MAAM;EACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC3C,QAAA,KAAK,GAAG;YACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC7C,QAAA,KAAK,MAAM;EACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC5C;EACA,QAAA,KAAK,GAAG;YACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;EAC5B,QAAA,KAAK,KAAK;YACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;EACvB;EACA,QAAA,KAAK,IAAI;YACP,OAAOpB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,GAAG;YACN,OAAOvB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;EAC5B,QAAA,KAAK,KAAK;YACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;EACvB,QAAA,KAAK,GAAG;YACN,OAAOL,MAAM,CAACW,SAAS,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOX,MAAM,CAACQ,QAAQ,CAAC,CAAA;EACzB,QAAA,KAAK,KAAK;YACR,OAAOvB,OAAO,CAACkB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOR,KAAK,CAACvvB,GAAG,CAAC4F,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;EAClC;EACA,QAAA,KAAK,MAAM;YACT,OAAOipB,OAAO,CAACqB,IAAI,CAAC,CAAA;EACtB,QAAA,KAAK,IAAI;EACP,UAAA,OAAOrB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;EAC3C;EACA,QAAA,KAAK,GAAG;YACN,OAAO4c,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG,CAAA;EACR,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACkB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOR,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/C,QAAA,KAAK,MAAM;EACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC9C,QAAA,KAAK,KAAK;EACR,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC9C,QAAA,KAAK,MAAM;EACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC7C;EACA,QAAA,KAAK,GAAG,CAAA;EACR,QAAA,KAAK,IAAI;EACP,UAAA,OAAO9N,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAASwV,QAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/E,QAAA,KAAK,KAAK;EACR,UAAA,OAAO5iB,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAAKwV,IAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC1E;EACA;EACA,QAAA,KAAK,GAAG;YACN,OAAOoV,MAAM,CAAC,oBAAoB,CAAC,CAAA;EACrC;EACA;EACA,QAAA,KAAK,GAAG;YACN,OAAOA,MAAM,CAAC,WAAW,CAAC,CAAA;EAC5B,QAAA;YACE,OAAOna,OAAO,CAAC3K,CAAC,CAAC,CAAA;EACrB,OAAA;OACD,CAAA;EAEH,EAAA,IAAMjW,IAAI,GAAG67B,OAAO,CAAClb,KAAK,CAAC,IAAI;EAC7BmP,IAAAA,aAAa,EAAEiK,WAAAA;KAChB,CAAA;IAED/5B,IAAI,CAAC2gB,KAAK,GAAGA,KAAK,CAAA;EAElB,EAAA,OAAO3gB,IAAI,CAAA;EACb,CAAA;EAEA,IAAM87B,uBAAuB,GAAG;EAC9Br7B,EAAAA,IAAI,EAAE;EACJ,IAAA,SAAS,EAAE,IAAI;EACfsN,IAAAA,OAAO,EAAE,OAAA;KACV;EACDrN,EAAAA,KAAK,EAAE;EACLqN,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAI;EACfguB,IAAAA,KAAK,EAAE,KAAK;EACZC,IAAAA,IAAI,EAAE,MAAA;KACP;EACDr7B,EAAAA,GAAG,EAAE;EACHoN,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDjN,EAAAA,OAAO,EAAE;EACPi7B,IAAAA,KAAK,EAAE,KAAK;EACZC,IAAAA,IAAI,EAAE,MAAA;KACP;EACDC,EAAAA,SAAS,EAAE,GAAG;EACdC,EAAAA,SAAS,EAAE,GAAG;EACdz3B,EAAAA,MAAM,EAAE;EACNsJ,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDouB,EAAAA,MAAM,EAAE;EACNpuB,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACD5M,EAAAA,MAAM,EAAE;EACN4M,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACD1M,EAAAA,MAAM,EAAE;EACN0M,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDxM,EAAAA,YAAY,EAAE;EACZy6B,IAAAA,IAAI,EAAE,OAAO;EACbD,IAAAA,KAAK,EAAE,KAAA;EACT,GAAA;EACF,CAAC,CAAA;EAED,SAASK,YAAYA,CAAC9uB,IAAI,EAAEqV,UAAU,EAAE0Z,YAAY,EAAE;EACpD,EAAA,IAAQv4B,IAAI,GAAYwJ,IAAI,CAApBxJ,IAAI;MAAEkC,KAAK,GAAKsH,IAAI,CAAdtH,KAAK,CAAA;IAEnB,IAAIlC,IAAI,KAAK,SAAS,EAAE;EACtB,IAAA,IAAMw4B,OAAO,GAAG,OAAO,CAAC5Z,IAAI,CAAC1c,KAAK,CAAC,CAAA;MACnC,OAAO;QACL4a,OAAO,EAAE,CAAC0b,OAAO;EACjBzb,MAAAA,GAAG,EAAEyb,OAAO,GAAG,GAAG,GAAGt2B,KAAAA;OACtB,CAAA;EACH,GAAA;EAEA,EAAA,IAAMyH,KAAK,GAAGkV,UAAU,CAAC7e,IAAI,CAAC,CAAA;;EAE9B;EACA;EACA;IACA,IAAIy4B,UAAU,GAAGz4B,IAAI,CAAA;IACrB,IAAIA,IAAI,KAAK,MAAM,EAAE;EACnB,IAAA,IAAI6e,UAAU,CAACle,MAAM,IAAI,IAAI,EAAE;EAC7B83B,MAAAA,UAAU,GAAG5Z,UAAU,CAACle,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;EACtD,KAAC,MAAM,IAAIke,UAAU,CAACjhB,SAAS,IAAI,IAAI,EAAE;QACvC,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,EAAE;EACpE66B,QAAAA,UAAU,GAAG,QAAQ,CAAA;EACvB,OAAC,MAAM;EACLA,QAAAA,UAAU,GAAG,QAAQ,CAAA;EACvB,OAAA;EACF,KAAC,MAAM;EACL;EACA;EACAA,MAAAA,UAAU,GAAGF,YAAY,CAAC53B,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;EACxD,KAAA;EACF,GAAA;EACA,EAAA,IAAIoc,GAAG,GAAGib,uBAAuB,CAACS,UAAU,CAAC,CAAA;EAC7C,EAAA,IAAI,OAAO1b,GAAG,KAAK,QAAQ,EAAE;EAC3BA,IAAAA,GAAG,GAAGA,GAAG,CAACpT,KAAK,CAAC,CAAA;EAClB,GAAA;EAEA,EAAA,IAAIoT,GAAG,EAAE;MACP,OAAO;EACLD,MAAAA,OAAO,EAAE,KAAK;EACdC,MAAAA,GAAG,EAAHA,GAAAA;OACD,CAAA;EACH,GAAA;EAEA,EAAA,OAAOrc,SAAS,CAAA;EAClB,CAAA;EAEA,SAASg4B,UAAUA,CAACjd,KAAK,EAAE;EACzB,EAAA,IAAMkd,EAAE,GAAGld,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC1I,KAAK,CAAA;EAAA,GAAA,CAAC,CAACkF,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;EAAA,IAAA,OAAQ9H,CAAC,GAAA,GAAA,GAAI8H,CAAC,CAACkT,MAAM,GAAA,GAAA,CAAA;KAAG,EAAE,EAAE,CAAC,CAAA;EAC9E,EAAA,OAAO,CAAK8W,GAAAA,GAAAA,EAAE,GAAKld,GAAAA,EAAAA,KAAK,CAAC,CAAA;EAC3B,CAAA;EAEA,SAAS7M,KAAKA,CAACI,KAAK,EAAE4C,KAAK,EAAEgnB,QAAQ,EAAE;EACrC,EAAA,IAAMC,OAAO,GAAG7pB,KAAK,CAACJ,KAAK,CAACgD,KAAK,CAAC,CAAA;EAElC,EAAA,IAAIinB,OAAO,EAAE;MACX,IAAMC,GAAG,GAAG,EAAE,CAAA;MACd,IAAIC,UAAU,GAAG,CAAC,CAAA;EAClB,IAAA,KAAK,IAAMh3B,CAAC,IAAI62B,QAAQ,EAAE;EACxB,MAAA,IAAIvhB,cAAc,CAACuhB,QAAQ,EAAE72B,CAAC,CAAC,EAAE;EAC/B,QAAA,IAAMi1B,CAAC,GAAG4B,QAAQ,CAAC72B,CAAC,CAAC;YACnBg1B,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;UACtC,IAAI,CAACC,CAAC,CAACla,OAAO,IAAIka,CAAC,CAACna,KAAK,EAAE;YACzBic,GAAG,CAAC9B,CAAC,CAACna,KAAK,CAACE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAGia,CAAC,CAACZ,KAAK,CAACyC,OAAO,CAAC3Y,KAAK,CAAC6Y,UAAU,EAAEA,UAAU,GAAGhC,MAAM,CAAC,CAAC,CAAA;EAC/E,SAAA;EACAgC,QAAAA,UAAU,IAAIhC,MAAM,CAAA;EACtB,OAAA;EACF,KAAA;EACA,IAAA,OAAO,CAAC8B,OAAO,EAAEC,GAAG,CAAC,CAAA;EACvB,GAAC,MAAM;EACL,IAAA,OAAO,CAACD,OAAO,EAAE,EAAE,CAAC,CAAA;EACtB,GAAA;EACF,CAAA;EAEA,SAASG,mBAAmBA,CAACH,OAAO,EAAE;EACpC,EAAA,IAAMI,OAAO,GAAG,SAAVA,OAAOA,CAAIpc,KAAK,EAAK;EACzB,IAAA,QAAQA,KAAK;EACX,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,aAAa,CAAA;EACtB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,QAAQ,CAAA;EACjB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,QAAQ,CAAA;EACjB,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,MAAM,CAAA;EACf,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,KAAK,CAAA;EACd,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,OAAO,CAAA;EAChB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,MAAM,CAAA;EACf,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,YAAY,CAAA;EACrB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,UAAU,CAAA;EACnB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA;EACE,QAAA,OAAO,IAAI,CAAA;EACf,KAAA;KACD,CAAA;IAED,IAAIpa,IAAI,GAAG,IAAI,CAAA;EACf,EAAA,IAAIy2B,cAAc,CAAA;EAClB,EAAA,IAAI,CAAC92B,WAAW,CAACy2B,OAAO,CAAChwB,CAAC,CAAC,EAAE;MAC3BpG,IAAI,GAAGF,QAAQ,CAACC,MAAM,CAACq2B,OAAO,CAAChwB,CAAC,CAAC,CAAA;EACnC,GAAA;EAEA,EAAA,IAAI,CAACzG,WAAW,CAACy2B,OAAO,CAACM,CAAC,CAAC,EAAE;MAC3B,IAAI,CAAC12B,IAAI,EAAE;EACTA,MAAAA,IAAI,GAAG,IAAI8L,eAAe,CAACsqB,OAAO,CAACM,CAAC,CAAC,CAAA;EACvC,KAAA;MACAD,cAAc,GAAGL,OAAO,CAACM,CAAC,CAAA;EAC5B,GAAA;EAEA,EAAA,IAAI,CAAC/2B,WAAW,CAACy2B,OAAO,CAACO,CAAC,CAAC,EAAE;EAC3BP,IAAAA,OAAO,CAACQ,CAAC,GAAG,CAACR,OAAO,CAACO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;EACrC,GAAA;EAEA,EAAA,IAAI,CAACh3B,WAAW,CAACy2B,OAAO,CAAC7B,CAAC,CAAC,EAAE;MAC3B,IAAI6B,OAAO,CAAC7B,CAAC,GAAG,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;QACrC0hB,OAAO,CAAC7B,CAAC,IAAI,EAAE,CAAA;EACjB,KAAC,MAAM,IAAI6B,OAAO,CAAC7B,CAAC,KAAK,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;QAC9C0hB,OAAO,CAAC7B,CAAC,GAAG,CAAC,CAAA;EACf,KAAA;EACF,GAAA;IAEA,IAAI6B,OAAO,CAACS,CAAC,KAAK,CAAC,IAAIT,OAAO,CAACU,CAAC,EAAE;EAChCV,IAAAA,OAAO,CAACU,CAAC,GAAG,CAACV,OAAO,CAACU,CAAC,CAAA;EACxB,GAAA;EAEA,EAAA,IAAI,CAACn3B,WAAW,CAACy2B,OAAO,CAACve,CAAC,CAAC,EAAE;MAC3Bue,OAAO,CAACW,CAAC,GAAGnhB,WAAW,CAACwgB,OAAO,CAACve,CAAC,CAAC,CAAA;EACpC,GAAA;EAEA,EAAA,IAAM2O,IAAI,GAAG9gB,MAAM,CAACC,IAAI,CAACywB,OAAO,CAAC,CAAC/hB,MAAM,CAAC,UAACnI,CAAC,EAAEyI,CAAC,EAAK;EACjD,IAAA,IAAMvQ,CAAC,GAAGoyB,OAAO,CAAC7hB,CAAC,CAAC,CAAA;EACpB,IAAA,IAAIvQ,CAAC,EAAE;EACL8H,MAAAA,CAAC,CAAC9H,CAAC,CAAC,GAAGgyB,OAAO,CAACzhB,CAAC,CAAC,CAAA;EACnB,KAAA;EAEA,IAAA,OAAOzI,CAAC,CAAA;KACT,EAAE,EAAE,CAAC,CAAA;EAEN,EAAA,OAAO,CAACsa,IAAI,EAAExmB,IAAI,EAAEy2B,cAAc,CAAC,CAAA;EACrC,CAAA;EAEA,IAAIO,kBAAkB,GAAG,IAAI,CAAA;EAE7B,SAASC,gBAAgBA,GAAG;IAC1B,IAAI,CAACD,kBAAkB,EAAE;EACvBA,IAAAA,kBAAkB,GAAGzyB,QAAQ,CAACojB,UAAU,CAAC,aAAa,CAAC,CAAA;EACzD,GAAA;EAEA,EAAA,OAAOqP,kBAAkB,CAAA;EAC3B,CAAA;EAEA,SAASE,qBAAqBA,CAAC9c,KAAK,EAAEjd,MAAM,EAAE;IAC5C,IAAIid,KAAK,CAACC,OAAO,EAAE;EACjB,IAAA,OAAOD,KAAK,CAAA;EACd,GAAA;IAEA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAACE,GAAG,CAAC,CAAA;EAC9D,EAAA,IAAMgE,MAAM,GAAG6Y,kBAAkB,CAAC/a,UAAU,EAAEjf,MAAM,CAAC,CAAA;IAErD,IAAImhB,MAAM,IAAI,IAAI,IAAIA,MAAM,CAACpa,QAAQ,CAACjG,SAAS,CAAC,EAAE;EAChD,IAAA,OAAOmc,KAAK,CAAA;EACd,GAAA;EAEA,EAAA,OAAOkE,MAAM,CAAA;EACf,CAAA;EAEO,SAAS8Y,iBAAiBA,CAAC9Y,MAAM,EAAEnhB,MAAM,EAAE;EAAA,EAAA,IAAAoxB,gBAAA,CAAA;EAChD,EAAA,OAAO,CAAAA,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIjQ,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,IAAA,OAAKwnB,qBAAqB,CAACxnB,CAAC,EAAEvS,MAAM,CAAC,CAAA;EAAA,GAAA,CAAC,CAAC,CAAA;EACvF,CAAA;;EAEA;EACA;EACA;;EAEA,IAAak6B,WAAW,gBAAA,YAAA;EACtB,EAAA,SAAAA,WAAYl6B,CAAAA,MAAM,EAAEZ,MAAM,EAAE;MAC1B,IAAI,CAACY,MAAM,GAAGA,MAAM,CAAA;MACpB,IAAI,CAACZ,MAAM,GAAGA,MAAM,CAAA;EACpB,IAAA,IAAI,CAAC+hB,MAAM,GAAG8Y,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACrf,MAAM,CAAC,EAAEY,MAAM,CAAC,CAAA;MACtE,IAAI,CAAC6b,KAAK,GAAG,IAAI,CAACsF,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,MAAA,OAAKglB,YAAY,CAAChlB,CAAC,EAAEvS,MAAM,CAAC,CAAA;OAAC,CAAA,CAAA;MAC5D,IAAI,CAACm6B,iBAAiB,GAAG,IAAI,CAACte,KAAK,CAAChO,IAAI,CAAC,UAAC0E,CAAC,EAAA;QAAA,OAAKA,CAAC,CAAC6Z,aAAa,CAAA;OAAC,CAAA,CAAA;EAEhE,IAAA,IAAI,CAAC,IAAI,CAAC+N,iBAAiB,EAAE;EAC3B,MAAA,IAAAC,WAAA,GAAgCtB,UAAU,CAAC,IAAI,CAACjd,KAAK,CAAC;EAA/Cwe,QAAAA,WAAW,GAAAD,WAAA,CAAA,CAAA,CAAA;EAAEpB,QAAAA,QAAQ,GAAAoB,WAAA,CAAA,CAAA,CAAA,CAAA;QAC5B,IAAI,CAACpoB,KAAK,GAAGC,MAAM,CAACooB,WAAW,EAAE,GAAG,CAAC,CAAA;QACrC,IAAI,CAACrB,QAAQ,GAAGA,QAAQ,CAAA;EAC1B,KAAA;EACF,GAAA;EAAC,EAAA,IAAAl6B,MAAA,GAAAo7B,WAAA,CAAAn7B,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDw7B,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBlrB,KAAK,EAAE;EACvB,IAAA,IAAI,CAAC,IAAI,CAAC+Q,OAAO,EAAE;QACjB,OAAO;EAAE/Q,QAAAA,KAAK,EAALA,KAAK;UAAE+R,MAAM,EAAE,IAAI,CAACA,MAAM;UAAEiL,aAAa,EAAE,IAAI,CAACA,aAAAA;SAAe,CAAA;EAC1E,KAAC,MAAM;EACL,MAAA,IAAAmO,MAAA,GAA8BvrB,KAAK,CAACI,KAAK,EAAE,IAAI,CAAC4C,KAAK,EAAE,IAAI,CAACgnB,QAAQ,CAAC;EAA9DwB,QAAAA,UAAU,GAAAD,MAAA,CAAA,CAAA,CAAA;EAAEtB,QAAAA,OAAO,GAAAsB,MAAA,CAAA,CAAA,CAAA;EAAAvG,QAAAA,KAAA,GACSiF,OAAO,GACpCG,mBAAmB,CAACH,OAAO,CAAC,GAC5B,CAAC,IAAI,EAAE,IAAI,EAAEn4B,SAAS,CAAC;EAF1B2lB,QAAAA,MAAM,GAAAuN,KAAA,CAAA,CAAA,CAAA;EAAEnxB,QAAAA,IAAI,GAAAmxB,KAAA,CAAA,CAAA,CAAA;EAAEsF,QAAAA,cAAc,GAAAtF,KAAA,CAAA,CAAA,CAAA,CAAA;EAG/B,MAAA,IAAIvc,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,IAAIxhB,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,EAAE;EAChE,QAAA,MAAM,IAAI/8B,6BAA6B,CACrC,uDACF,CAAC,CAAA;EACH,OAAA;QACA,OAAO;EACLkT,QAAAA,KAAK,EAALA,KAAK;UACL+R,MAAM,EAAE,IAAI,CAACA,MAAM;UACnBnP,KAAK,EAAE,IAAI,CAACA,KAAK;EACjBwoB,QAAAA,UAAU,EAAVA,UAAU;EACVvB,QAAAA,OAAO,EAAPA,OAAO;EACPxS,QAAAA,MAAM,EAANA,MAAM;EACN5jB,QAAAA,IAAI,EAAJA,IAAI;EACJy2B,QAAAA,cAAc,EAAdA,cAAAA;SACD,CAAA;EACH,KAAA;KACD,CAAA;EAAA95B,EAAAA,YAAA,CAAA06B,WAAA,EAAA,CAAA;MAAAz6B,GAAA,EAAA,SAAA;MAAAC,GAAA,EAED,SAAAA,GAAAA,GAAc;QACZ,OAAO,CAAC,IAAI,CAACy6B,iBAAiB,CAAA;EAChC,KAAA;EAAC,GAAA,EAAA;MAAA16B,GAAA,EAAA,eAAA;MAAAC,GAAA,EAED,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACy6B,iBAAiB,GAAG,IAAI,CAACA,iBAAiB,CAAC/N,aAAa,GAAG,IAAI,CAAA;EAC7E,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA8N,WAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGI,SAASI,iBAAiBA,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;IACvD,IAAMq7B,MAAM,GAAG,IAAIP,WAAW,CAACl6B,MAAM,EAAEZ,MAAM,CAAC,CAAA;EAC9C,EAAA,OAAOq7B,MAAM,CAACH,iBAAiB,CAAClrB,KAAK,CAAC,CAAA;EACxC,CAAA;EAEO,SAASsrB,eAAeA,CAAC16B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;IACrD,IAAAu7B,kBAAA,GAAwDL,iBAAiB,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,CAAC;MAAxFqnB,MAAM,GAAAkU,kBAAA,CAANlU,MAAM;MAAE5jB,IAAI,GAAA83B,kBAAA,CAAJ93B,IAAI;MAAEy2B,cAAc,GAAAqB,kBAAA,CAAdrB,cAAc;MAAElN,aAAa,GAAAuO,kBAAA,CAAbvO,aAAa,CAAA;IACnD,OAAO,CAAC3F,MAAM,EAAE5jB,IAAI,EAAEy2B,cAAc,EAAElN,aAAa,CAAC,CAAA;EACtD,CAAA;EAEO,SAAS4N,kBAAkBA,CAAC/a,UAAU,EAAEjf,MAAM,EAAE;IACrD,IAAI,CAACif,UAAU,EAAE;EACf,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;IAEA,IAAM2b,SAAS,GAAGpc,SAAS,CAAC5b,MAAM,CAAC5C,MAAM,EAAEif,UAAU,CAAC,CAAA;IACtD,IAAMvR,EAAE,GAAGktB,SAAS,CAAC1tB,WAAW,CAAC4sB,gBAAgB,EAAE,CAAC,CAAA;EACpD,EAAA,IAAMnwB,KAAK,GAAG+D,EAAE,CAACzL,aAAa,EAAE,CAAA;EAChC,EAAA,IAAM02B,YAAY,GAAGjrB,EAAE,CAACnN,eAAe,EAAE,CAAA;EACzC,EAAA,OAAOoJ,KAAK,CAACH,GAAG,CAAC,UAACoW,CAAC,EAAA;EAAA,IAAA,OAAK8Y,YAAY,CAAC9Y,CAAC,EAAEX,UAAU,EAAE0Z,YAAY,CAAC,CAAA;KAAC,CAAA,CAAA;EACpE;;ECncA,IAAMpQ,OAAO,GAAG,kBAAkB,CAAA;EAClC,IAAMsS,QAAQ,GAAG,OAAO,CAAA;EAExB,SAASC,eAAeA,CAACj4B,IAAI,EAAE;IAC7B,OAAO,IAAI2P,OAAO,CAAC,kBAAkB,kBAAe3P,IAAI,CAAClD,IAAI,GAAA,qBAAoB,CAAC,CAAA;EACpF,CAAA;;EAEA;EACA;EACA;EACA;EACA,SAASo7B,sBAAsBA,CAAC5zB,EAAE,EAAE;EAClC,EAAA,IAAIA,EAAE,CAACmN,QAAQ,KAAK,IAAI,EAAE;MACxBnN,EAAE,CAACmN,QAAQ,GAAGR,eAAe,CAAC3M,EAAE,CAAC2X,CAAC,CAAC,CAAA;EACrC,GAAA;IACA,OAAO3X,EAAE,CAACmN,QAAQ,CAAA;EACpB,CAAA;;EAEA;EACA;EACA;EACA,SAAS0mB,2BAA2BA,CAAC7zB,EAAE,EAAE;EACvC,EAAA,IAAIA,EAAE,CAAC8zB,aAAa,KAAK,IAAI,EAAE;MAC7B9zB,EAAE,CAAC8zB,aAAa,GAAGnnB,eAAe,CAChC3M,EAAE,CAAC2X,CAAC,EACJ3X,EAAE,CAACM,GAAG,CAAC8G,qBAAqB,EAAE,EAC9BpH,EAAE,CAACM,GAAG,CAAC6G,cAAc,EACvB,CAAC,CAAA;EACH,GAAA;IACA,OAAOnH,EAAE,CAAC8zB,aAAa,CAAA;EACzB,CAAA;;EAEA;EACA;EACA,SAAS1uB,KAAKA,CAAC2uB,IAAI,EAAE1uB,IAAI,EAAE;EACzB,EAAA,IAAMmS,OAAO,GAAG;MACd1f,EAAE,EAAEi8B,IAAI,CAACj8B,EAAE;MACX4D,IAAI,EAAEq4B,IAAI,CAACr4B,IAAI;MACfic,CAAC,EAAEoc,IAAI,CAACpc,CAAC;MACTtI,CAAC,EAAE0kB,IAAI,CAAC1kB,CAAC;MACT/O,GAAG,EAAEyzB,IAAI,CAACzzB,GAAG;MACb6iB,OAAO,EAAE4Q,IAAI,CAAC5Q,OAAAA;KACf,CAAA;EACD,EAAA,OAAO,IAAIljB,QAAQ,CAAArB,QAAA,CAAM4Y,EAAAA,EAAAA,OAAO,EAAKnS,IAAI,EAAA;EAAE2uB,IAAAA,GAAG,EAAExc,OAAAA;EAAO,GAAA,CAAE,CAAC,CAAA;EAC5D,CAAA;;EAEA;EACA;EACA,SAASyc,SAASA,CAACC,OAAO,EAAE7kB,CAAC,EAAE8kB,EAAE,EAAE;EACjC;IACA,IAAIC,QAAQ,GAAGF,OAAO,GAAG7kB,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;;EAEtC;EACA,EAAA,IAAMglB,EAAE,GAAGF,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;;EAE9B;IACA,IAAI/kB,CAAC,KAAKglB,EAAE,EAAE;EACZ,IAAA,OAAO,CAACD,QAAQ,EAAE/kB,CAAC,CAAC,CAAA;EACtB,GAAA;;EAEA;IACA+kB,QAAQ,IAAI,CAACC,EAAE,GAAGhlB,CAAC,IAAI,EAAE,GAAG,IAAI,CAAA;;EAEhC;EACA,EAAA,IAAMilB,EAAE,GAAGH,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;IAC9B,IAAIC,EAAE,KAAKC,EAAE,EAAE;EACb,IAAA,OAAO,CAACF,QAAQ,EAAEC,EAAE,CAAC,CAAA;EACvB,GAAA;;EAEA;IACA,OAAO,CAACH,OAAO,GAAG53B,IAAI,CAAC+N,GAAG,CAACgqB,EAAE,EAAEC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAEh4B,IAAI,CAACgO,GAAG,CAAC+pB,EAAE,EAAEC,EAAE,CAAC,CAAC,CAAA;EACnE,CAAA;;EAEA;EACA,SAASC,OAAOA,CAACz8B,EAAE,EAAEI,MAAM,EAAE;EAC3BJ,EAAAA,EAAE,IAAII,MAAM,GAAG,EAAE,GAAG,IAAI,CAAA;EAExB,EAAA,IAAMyT,CAAC,GAAG,IAAI5S,IAAI,CAACjB,EAAE,CAAC,CAAA;IAEtB,OAAO;EACLlC,IAAAA,IAAI,EAAE+V,CAAC,CAACG,cAAc,EAAE;EACxBjW,IAAAA,KAAK,EAAE8V,CAAC,CAAC6oB,WAAW,EAAE,GAAG,CAAC;EAC1B1+B,IAAAA,GAAG,EAAE6V,CAAC,CAAC8oB,UAAU,EAAE;EACnBp+B,IAAAA,IAAI,EAAEsV,CAAC,CAAC+oB,WAAW,EAAE;EACrBp+B,IAAAA,MAAM,EAAEqV,CAAC,CAACgpB,aAAa,EAAE;EACzBn+B,IAAAA,MAAM,EAAEmV,CAAC,CAACipB,aAAa,EAAE;EACzBj4B,IAAAA,WAAW,EAAEgP,CAAC,CAACkpB,kBAAkB,EAAC;KACnC,CAAA;EACH,CAAA;;EAEA;EACA,SAASC,OAAOA,CAAChnB,GAAG,EAAE5V,MAAM,EAAEwD,IAAI,EAAE;IAClC,OAAOu4B,SAAS,CAACv3B,YAAY,CAACoR,GAAG,CAAC,EAAE5V,MAAM,EAAEwD,IAAI,CAAC,CAAA;EACnD,CAAA;;EAEA;EACA,SAASq5B,UAAUA,CAAChB,IAAI,EAAEza,GAAG,EAAE;EAC7B,EAAA,IAAM0b,IAAI,GAAGjB,IAAI,CAAC1kB,CAAC;EACjBzZ,IAAAA,IAAI,GAAGm+B,IAAI,CAACpc,CAAC,CAAC/hB,IAAI,GAAG0G,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;MAC1C9e,KAAK,GAAGk+B,IAAI,CAACpc,CAAC,CAAC9hB,KAAK,GAAGyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC,GAAG,CAAC;EAC5E+C,IAAAA,CAAC,GAAA/Y,QAAA,CACIm1B,EAAAA,EAAAA,IAAI,CAACpc,CAAC,EAAA;EACT/hB,MAAAA,IAAI,EAAJA,IAAI;EACJC,MAAAA,KAAK,EAALA,KAAK;EACLC,MAAAA,GAAG,EACDwG,IAAI,CAAC+N,GAAG,CAAC0pB,IAAI,CAACpc,CAAC,CAAC7hB,GAAG,EAAEiZ,WAAW,CAACnZ,IAAI,EAAEC,KAAK,CAAC,CAAC,GAC9CyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC,GACpBxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC,GAAG,CAAA;OAC3B,CAAA;EACDogB,IAAAA,WAAW,GAAGjT,QAAQ,CAAC5d,UAAU,CAAC;EAChCuQ,MAAAA,KAAK,EAAE2E,GAAG,CAAC3E,KAAK,GAAGrY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;EACxCC,MAAAA,QAAQ,EAAE0E,GAAG,CAAC1E,QAAQ,GAAGtY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC;EACjDnP,MAAAA,MAAM,EAAE6T,GAAG,CAAC7T,MAAM,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC;EAC3CoP,MAAAA,KAAK,EAAEyE,GAAG,CAACzE,KAAK,GAAGvY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC;EACxCC,MAAAA,IAAI,EAAEwE,GAAG,CAACxE,IAAI,GAAGxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC;QACrCtB,KAAK,EAAE8F,GAAG,CAAC9F,KAAK;QAChBrR,OAAO,EAAEmX,GAAG,CAACnX,OAAO;QACpB4S,OAAO,EAAEuE,GAAG,CAACvE,OAAO;QACpBuI,YAAY,EAAEhE,GAAG,CAACgE,YAAAA;EACpB,KAAC,CAAC,CAACwI,EAAE,CAAC,cAAc,CAAC;EACrBoO,IAAAA,OAAO,GAAGx3B,YAAY,CAACib,CAAC,CAAC,CAAA;IAE3B,IAAAud,UAAA,GAAcjB,SAAS,CAACC,OAAO,EAAEc,IAAI,EAAEjB,IAAI,CAACr4B,IAAI,CAAC;EAA5C5D,IAAAA,EAAE,GAAAo9B,UAAA,CAAA,CAAA,CAAA;EAAE7lB,IAAAA,CAAC,GAAA6lB,UAAA,CAAA,CAAA,CAAA,CAAA;IAEV,IAAID,WAAW,KAAK,CAAC,EAAE;EACrBn9B,IAAAA,EAAE,IAAIm9B,WAAW,CAAA;EACjB;MACA5lB,CAAC,GAAG0kB,IAAI,CAACr4B,IAAI,CAACxD,MAAM,CAACJ,EAAE,CAAC,CAAA;EAC1B,GAAA;IAEA,OAAO;EAAEA,IAAAA,EAAE,EAAFA,EAAE;EAAEuX,IAAAA,CAAC,EAADA,CAAAA;KAAG,CAAA;EAClB,CAAA;;EAEA;EACA;EACA,SAAS8lB,mBAAmBA,CAAC/6B,MAAM,EAAEg7B,UAAU,EAAEr9B,IAAI,EAAEE,MAAM,EAAE0rB,IAAI,EAAEwO,cAAc,EAAE;EACnF,EAAA,IAAQlwB,OAAO,GAAWlK,IAAI,CAAtBkK,OAAO;MAAEvG,IAAI,GAAK3D,IAAI,CAAb2D,IAAI,CAAA;EACrB,EAAA,IAAKtB,MAAM,IAAIgH,MAAM,CAACC,IAAI,CAACjH,MAAM,CAAC,CAACa,MAAM,KAAK,CAAC,IAAKm6B,UAAU,EAAE;EAC9D,IAAA,IAAMC,kBAAkB,GAAGD,UAAU,IAAI15B,IAAI;QAC3Cq4B,IAAI,GAAG9zB,QAAQ,CAACmE,UAAU,CAAChK,MAAM,EAAAwE,QAAA,CAAA,EAAA,EAC5B7G,IAAI,EAAA;EACP2D,QAAAA,IAAI,EAAE25B,kBAAkB;EACxBlD,QAAAA,cAAc,EAAdA,cAAAA;EAAc,OAAA,CACf,CAAC,CAAA;MACJ,OAAOlwB,OAAO,GAAG8xB,IAAI,GAAGA,IAAI,CAAC9xB,OAAO,CAACvG,IAAI,CAAC,CAAA;EAC5C,GAAC,MAAM;EACL,IAAA,OAAOuE,QAAQ,CAACkjB,OAAO,CACrB,IAAI9X,OAAO,CAAC,YAAY,EAAgBsY,cAAAA,GAAAA,IAAI,GAAwB1rB,wBAAAA,GAAAA,MAAQ,CAC9E,CAAC,CAAA;EACH,GAAA;EACF,CAAA;;EAEA;EACA;EACA,SAASq9B,YAAYA,CAACt1B,EAAE,EAAE/H,MAAM,EAAE8gB,MAAM,EAAS;EAAA,EAAA,IAAfA,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,IAAI,CAAA;EAAA,GAAA;EAC7C,EAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GACb3B,SAAS,CAAC5b,MAAM,CAACgD,MAAM,CAAChD,MAAM,CAAC,OAAO,CAAC,EAAE;EACvCsd,IAAAA,MAAM,EAANA,MAAM;EACNhY,IAAAA,WAAW,EAAE,IAAA;KACd,CAAC,CAAC4X,wBAAwB,CAAC3Y,EAAE,EAAE/H,MAAM,CAAC,GACvC,IAAI,CAAA;EACV,CAAA;EAEA,SAASuyB,UAASA,CAACnb,CAAC,EAAEkmB,QAAQ,EAAEC,SAAS,EAAE;EACzC,EAAA,IAAMC,UAAU,GAAGpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,IAAI,IAAIyZ,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,CAAC,CAAA;IAClD,IAAI+hB,CAAC,GAAG,EAAE,CAAA;EACV,EAAA,IAAI8d,UAAU,IAAIpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,IAAI,CAAC,EAAE+hB,CAAC,IAAI,GAAG,CAAA;EACzCA,EAAAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,EAAE6/B,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EAC3C,EAAA,IAAID,SAAS,KAAK,MAAM,EAAE,OAAO7d,CAAC,CAAA;EAClC,EAAA,IAAI4d,QAAQ,EAAE;EACZ5d,IAAAA,CAAC,IAAI,GAAG,CAAA;MACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;EACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;EACnCA,IAAAA,CAAC,IAAI,GAAG,CAAA;EACV,GAAC,MAAM;MACLA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;EACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;EACrC,GAAA;IACAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC7hB,GAAG,CAAC,CAAA;EACtB,EAAA,OAAO6hB,CAAC,CAAA;EACV,CAAA;EAEA,SAAS6M,UAASA,CAChBnV,CAAC,EACDkmB,QAAQ,EACR3Q,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SAAS,EACT;EACA,EAAA,IAAIG,WAAW,GAAG,CAAC/Q,eAAe,IAAIvV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,IAAI0S,CAAC,CAACsI,CAAC,CAACnhB,MAAM,KAAK,CAAC;EAC7EmhB,IAAAA,CAAC,GAAG,EAAE,CAAA;EACR,EAAA,QAAQ6d,SAAS;EACf,IAAA,KAAK,KAAK,CAAA;EACV,IAAA,KAAK,OAAO,CAAA;EACZ,IAAA,KAAK,MAAM;EACT,MAAA,MAAA;EACF,IAAA;QACE7d,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACthB,IAAI,CAAC,CAAA;QACvB,IAAIm/B,SAAS,KAAK,MAAM,EAAE,MAAA;EAC1B,MAAA,IAAID,QAAQ,EAAE;EACZ5d,QAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;UACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,QAAA,IAAIG,WAAW,EAAE;EACfhe,UAAAA,CAAC,IAAI,GAAG,CAAA;YACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;EAC3B,SAAA;EACF,OAAC,MAAM;UACLmhB,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;UACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,QAAA,IAAIG,WAAW,EAAE;YACfhe,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;EAC3B,SAAA;EACF,OAAA;QACA,IAAIg/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,MAAA,IAAIG,WAAW,KAAK,CAAChR,oBAAoB,IAAItV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,CAAC,EAAE;EACnEgb,QAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAChb,WAAW,EAAE,CAAC,CAAC,CAAA;EACnC,OAAA;EACJ,GAAA;EAEA,EAAA,IAAImoB,aAAa,EAAE;EACjB,IAAA,IAAIzV,CAAC,CAACyJ,aAAa,IAAIzJ,CAAC,CAACnX,MAAM,KAAK,CAAC,IAAI,CAACw9B,YAAY,EAAE;EACtD/d,MAAAA,CAAC,IAAI,GAAG,CAAA;EACV,KAAC,MAAM,IAAItI,CAAC,CAACA,CAAC,GAAG,CAAC,EAAE;EAClBsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACpCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACtC,KAAC,MAAM;EACLsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACnCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;EAEA,EAAA,IAAIqmB,YAAY,EAAE;MAChB/d,CAAC,IAAI,GAAG,GAAGtI,CAAC,CAAC3T,IAAI,CAACk6B,QAAQ,GAAG,GAAG,CAAA;EAClC,GAAA;EACA,EAAA,OAAOje,CAAC,CAAA;EACV,CAAA;;EAEA;EACA,IAAMke,iBAAiB,GAAG;EACtBhgC,IAAAA,KAAK,EAAE,CAAC;EACRC,IAAAA,GAAG,EAAE,CAAC;EACNO,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd;EACDm5B,EAAAA,qBAAqB,GAAG;EACtBhpB,IAAAA,UAAU,EAAE,CAAC;EACb7W,IAAAA,OAAO,EAAE,CAAC;EACVI,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd;EACDo5B,EAAAA,wBAAwB,GAAG;EACzB3pB,IAAAA,OAAO,EAAE,CAAC;EACV/V,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd,CAAA;;EAEH;EACA,IAAM+kB,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC;EACtFsU,EAAAA,gBAAgB,GAAG,CACjB,UAAU,EACV,YAAY,EACZ,SAAS,EACT,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,CACd;EACDC,EAAAA,mBAAmB,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;;EAEtF;EACA,SAAS3S,aAAaA,CAACnuB,IAAI,EAAE;EAC3B,EAAA,IAAMme,UAAU,GAAG;EACjB1d,IAAAA,IAAI,EAAE,MAAM;EACZ+e,IAAAA,KAAK,EAAE,MAAM;EACb9e,IAAAA,KAAK,EAAE,OAAO;EACd4P,IAAAA,MAAM,EAAE,OAAO;EACf3P,IAAAA,GAAG,EAAE,KAAK;EACVgf,IAAAA,IAAI,EAAE,KAAK;EACXze,IAAAA,IAAI,EAAE,MAAM;EACZmd,IAAAA,KAAK,EAAE,MAAM;EACbld,IAAAA,MAAM,EAAE,QAAQ;EAChB6L,IAAAA,OAAO,EAAE,QAAQ;EACjBiX,IAAAA,OAAO,EAAE,SAAS;EAClBxE,IAAAA,QAAQ,EAAE,SAAS;EACnBpe,IAAAA,MAAM,EAAE,QAAQ;EAChBue,IAAAA,OAAO,EAAE,QAAQ;EACjBpY,IAAAA,WAAW,EAAE,aAAa;EAC1B2gB,IAAAA,YAAY,EAAE,aAAa;EAC3BrnB,IAAAA,OAAO,EAAE,SAAS;EAClB+P,IAAAA,QAAQ,EAAE,SAAS;EACnBkwB,IAAAA,UAAU,EAAE,YAAY;EACxBC,IAAAA,WAAW,EAAE,YAAY;EACzBC,IAAAA,WAAW,EAAE,YAAY;EACzBC,IAAAA,QAAQ,EAAE,UAAU;EACpBC,IAAAA,SAAS,EAAE,UAAU;EACrBlqB,IAAAA,OAAO,EAAE,SAAA;EACX,GAAC,CAACjX,IAAI,CAACyR,WAAW,EAAE,CAAC,CAAA;IAErB,IAAI,CAAC0M,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;EAEjD,EAAA,OAAOme,UAAU,CAAA;EACnB,CAAA;EAEA,SAASijB,2BAA2BA,CAACphC,IAAI,EAAE;EACzC,EAAA,QAAQA,IAAI,CAACyR,WAAW,EAAE;EACxB,IAAA,KAAK,cAAc,CAAA;EACnB,IAAA,KAAK,eAAe;EAClB,MAAA,OAAO,cAAc,CAAA;EACvB,IAAA,KAAK,iBAAiB,CAAA;EACtB,IAAA,KAAK,kBAAkB;EACrB,MAAA,OAAO,iBAAiB,CAAA;EAC1B,IAAA,KAAK,eAAe,CAAA;EACpB,IAAA,KAAK,gBAAgB;EACnB,MAAA,OAAO,eAAe,CAAA;EACxB,IAAA;QACE,OAAO0c,aAAa,CAACnuB,IAAI,CAAC,CAAA;EAC9B,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,SAASqhC,kBAAkBA,CAAC96B,IAAI,EAAE;IAChC,IAAI+6B,YAAY,KAAK98B,SAAS,EAAE;EAC9B88B,IAAAA,YAAY,GAAG/yB,QAAQ,CAACqH,GAAG,EAAE,CAAA;EAC/B,GAAA;;EAEA;EACA;EACA,EAAA,IAAIrP,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;EACxB,IAAA,OAAOyC,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;EAClC,GAAA;EACA,EAAA,IAAMh9B,QAAQ,GAAGiC,IAAI,CAAClD,IAAI,CAAA;EAC1B,EAAA,IAAIk+B,WAAW,GAAGC,oBAAoB,CAACp+B,GAAG,CAACkB,QAAQ,CAAC,CAAA;IACpD,IAAIi9B,WAAW,KAAK/8B,SAAS,EAAE;EAC7B+8B,IAAAA,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;EACvCE,IAAAA,oBAAoB,CAAC78B,GAAG,CAACL,QAAQ,EAAEi9B,WAAW,CAAC,CAAA;EACjD,GAAA;EACA,EAAA,OAAOA,WAAW,CAAA;EACpB,CAAA;;EAEA;EACA;EACA;EACA,SAASE,OAAOA,CAAC9oB,GAAG,EAAE/V,IAAI,EAAE;IAC1B,IAAM2D,IAAI,GAAGsM,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAC3D,EAAA,IAAI,CAACxM,IAAI,CAACsd,OAAO,EAAE;MACjB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;EAChD,GAAA;EAEA,EAAA,IAAM4E,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;IAEnC,IAAID,EAAE,EAAEuX,CAAC,CAAA;;EAET;EACA,EAAA,IAAI,CAAChU,WAAW,CAACyS,GAAG,CAAClY,IAAI,CAAC,EAAE;EAC1B,IAAA,KAAA,IAAAgmB,EAAA,GAAA,CAAA,EAAAyJ,aAAA,GAAgB3D,YAAY,EAAA9F,EAAA,GAAAyJ,aAAA,CAAApqB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAzB,MAAA,IAAMrI,CAAC,GAAA8R,aAAA,CAAAzJ,EAAA,CAAA,CAAA;EACV,MAAA,IAAIvgB,WAAW,CAACyS,GAAG,CAACyF,CAAC,CAAC,CAAC,EAAE;EACvBzF,QAAAA,GAAG,CAACyF,CAAC,CAAC,GAAGsiB,iBAAiB,CAACtiB,CAAC,CAAC,CAAA;EAC/B,OAAA;EACF,KAAA;MAEA,IAAM4P,OAAO,GAAGvU,uBAAuB,CAACd,GAAG,CAAC,IAAIkB,kBAAkB,CAAClB,GAAG,CAAC,CAAA;EACvE,IAAA,IAAIqV,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAA;EAEA,IAAA,IAAM0T,YAAY,GAAGL,kBAAkB,CAAC96B,IAAI,CAAC,CAAA;MAAC,IAAAo7B,QAAA,GACpChC,OAAO,CAAChnB,GAAG,EAAE+oB,YAAY,EAAEn7B,IAAI,CAAC,CAAA;EAAzC5D,IAAAA,EAAE,GAAAg/B,QAAA,CAAA,CAAA,CAAA,CAAA;EAAEznB,IAAAA,CAAC,GAAAynB,QAAA,CAAA,CAAA,CAAA,CAAA;EACR,GAAC,MAAM;EACLh/B,IAAAA,EAAE,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,CAAA;EACrB,GAAA;IAEA,OAAO,IAAI9K,QAAQ,CAAC;EAAEnI,IAAAA,EAAE,EAAFA,EAAE;EAAE4D,IAAAA,IAAI,EAAJA,IAAI;EAAE4E,IAAAA,GAAG,EAAHA,GAAG;EAAE+O,IAAAA,CAAC,EAADA,CAAAA;EAAE,GAAC,CAAC,CAAA;EAC3C,CAAA;EAEA,SAAS0nB,YAAYA,CAAC1e,KAAK,EAAEE,GAAG,EAAExgB,IAAI,EAAE;EACtC,EAAA,IAAMga,KAAK,GAAG1W,WAAW,CAACtD,IAAI,CAACga,KAAK,CAAC,GAAG,IAAI,GAAGha,IAAI,CAACga,KAAK;EACvDL,IAAAA,QAAQ,GAAGrW,WAAW,CAACtD,IAAI,CAAC2Z,QAAQ,CAAC,GAAG,OAAO,GAAG3Z,IAAI,CAAC2Z,QAAQ;EAC/DzZ,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAI0f,CAAC,EAAExiB,IAAI,EAAK;QACpBwiB,CAAC,GAAGjW,OAAO,CAACiW,CAAC,EAAE5F,KAAK,IAAIha,IAAI,CAACi/B,SAAS,GAAG,CAAC,GAAG,CAAC,EAAEj/B,IAAI,CAACi/B,SAAS,GAAG,OAAO,GAAGtlB,QAAQ,CAAC,CAAA;EACpF,MAAA,IAAM+hB,SAAS,GAAGlb,GAAG,CAACjY,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,CAACgP,YAAY,CAAChP,IAAI,CAAC,CAAA;EACxD,MAAA,OAAO07B,SAAS,CAACx7B,MAAM,CAAC0f,CAAC,EAAExiB,IAAI,CAAC,CAAA;OACjC;EACDy5B,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIz5B,IAAI,EAAK;QACjB,IAAI4C,IAAI,CAACi/B,SAAS,EAAE;UAClB,IAAI,CAACze,GAAG,CAAC+P,OAAO,CAACjQ,KAAK,EAAEljB,IAAI,CAAC,EAAE;YAC7B,OAAOojB,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,CAAC,CAACkzB,IAAI,CAAChQ,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;WACnE,MAAM,OAAO,CAAC,CAAA;EACjB,OAAC,MAAM;EACL,QAAA,OAAOojB,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;EACxC,OAAA;OACD,CAAA;IAEH,IAAI4C,IAAI,CAAC5C,IAAI,EAAE;EACb,IAAA,OAAO8C,MAAM,CAAC22B,MAAM,CAAC72B,IAAI,CAAC5C,IAAI,CAAC,EAAE4C,IAAI,CAAC5C,IAAI,CAAC,CAAA;EAC7C,GAAA;EAEA,EAAA,KAAA,IAAAugB,SAAA,GAAAC,+BAAA,CAAmB5d,IAAI,CAAC2c,KAAK,CAAAkB,EAAAA,KAAA,IAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAApB1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;EACb,IAAA,IAAM6H,KAAK,GAAG4rB,MAAM,CAACz5B,IAAI,CAAC,CAAA;MAC1B,IAAImH,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC,IAAI,CAAC,EAAE;EACxB,MAAA,OAAO/K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;EAC5B,KAAA;EACF,GAAA;IACA,OAAO8C,MAAM,CAACogB,KAAK,GAAGE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAExgB,IAAI,CAAC2c,KAAK,CAAC3c,IAAI,CAAC2c,KAAK,CAACzZ,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;EACxE,CAAA;EAEA,SAASg8B,QAAQA,CAACC,OAAO,EAAE;IACzB,IAAIn/B,IAAI,GAAG,EAAE;MACXo/B,IAAI,CAAA;EACN,EAAA,IAAID,OAAO,CAACj8B,MAAM,GAAG,CAAC,IAAI,OAAOi8B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE;MACzElD,IAAI,GAAGm/B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;EAClCk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAC/d,KAAK,CAAC,CAAC,EAAE+d,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;EACzD,GAAC,MAAM;EACLk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAO,CAACn/B,IAAI,EAAEo/B,IAAI,CAAC,CAAA;EACrB,CAAA;;EAEA;EACA;EACA;EACA,IAAIV,YAAY,CAAA;EAChB;EACA;EACA;EACA;EACA;EACA;EACA,IAAME,oBAAoB,GAAG,IAAIp9B,GAAG,EAAE,CAAA;;EAEtC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqB0G,MAAAA,QAAQ,0BAAA+iB,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAA/iB,QAAAA,CAAYgjB,MAAM,EAAE;MAClB,IAAMvnB,IAAI,GAAGunB,MAAM,CAACvnB,IAAI,IAAIgI,QAAQ,CAACwE,WAAW,CAAA;EAEhD,IAAA,IAAIib,OAAO,GACTF,MAAM,CAACE,OAAO,KACbtQ,MAAM,CAAC1W,KAAK,CAAC8mB,MAAM,CAACnrB,EAAE,CAAC,GAAG,IAAIuT,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,KAC9D,CAAC3P,IAAI,CAACsd,OAAO,GAAG2a,eAAe,CAACj4B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;EAChD;EACJ;EACA;EACI,IAAA,IAAI,CAAC5D,EAAE,GAAGuD,WAAW,CAAC4nB,MAAM,CAACnrB,EAAE,CAAC,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,GAAGkY,MAAM,CAACnrB,EAAE,CAAA;MAE7D,IAAI6f,CAAC,GAAG,IAAI;EACVtI,MAAAA,CAAC,GAAG,IAAI,CAAA;MACV,IAAI,CAAC8T,OAAO,EAAE;QACZ,IAAMiU,SAAS,GAAGnU,MAAM,CAAC+Q,GAAG,IAAI/Q,MAAM,CAAC+Q,GAAG,CAACl8B,EAAE,KAAK,IAAI,CAACA,EAAE,IAAImrB,MAAM,CAAC+Q,GAAG,CAACt4B,IAAI,CAACvD,MAAM,CAACuD,IAAI,CAAC,CAAA;EAEzF,MAAA,IAAI07B,SAAS,EAAE;EAAA,QAAA,IAAAx+B,IAAA,GACJ,CAACqqB,MAAM,CAAC+Q,GAAG,CAACrc,CAAC,EAAEsL,MAAM,CAAC+Q,GAAG,CAAC3kB,CAAC,CAAC,CAAA;EAApCsI,QAAAA,CAAC,GAAA/e,IAAA,CAAA,CAAA,CAAA,CAAA;EAAEyW,QAAAA,CAAC,GAAAzW,IAAA,CAAA,CAAA,CAAA,CAAA;EACP,OAAC,MAAM;EACL;EACA;UACA,IAAMy+B,EAAE,GAAGhvB,QAAQ,CAAC4a,MAAM,CAAC5T,CAAC,CAAC,IAAI,CAAC4T,MAAM,CAAC+Q,GAAG,GAAG/Q,MAAM,CAAC5T,CAAC,GAAG3T,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;UAC9E6f,CAAC,GAAG4c,OAAO,CAAC,IAAI,CAACz8B,EAAE,EAAEu/B,EAAE,CAAC,CAAA;EACxBlU,QAAAA,OAAO,GAAGtQ,MAAM,CAAC1W,KAAK,CAACwb,CAAC,CAAC/hB,IAAI,CAAC,GAAG,IAAIyV,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAA;EACpEsM,QAAAA,CAAC,GAAGwL,OAAO,GAAG,IAAI,GAAGxL,CAAC,CAAA;EACtBtI,QAAAA,CAAC,GAAG8T,OAAO,GAAG,IAAI,GAAGkU,EAAE,CAAA;EACzB,OAAA;EACF,KAAA;;EAEA;EACJ;EACA;MACI,IAAI,CAACC,KAAK,GAAG57B,IAAI,CAAA;EACjB;EACJ;EACA;MACI,IAAI,CAAC4E,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;EACxC;EACJ;EACA;MACI,IAAI,CAAC0nB,OAAO,GAAGA,OAAO,CAAA;EACtB;EACJ;EACA;MACI,IAAI,CAAChW,QAAQ,GAAG,IAAI,CAAA;EACpB;EACJ;EACA;MACI,IAAI,CAAC2mB,aAAa,GAAG,IAAI,CAAA;EACzB;EACJ;EACA;MACI,IAAI,CAACnc,CAAC,GAAGA,CAAC,CAAA;EACV;EACJ;EACA;MACI,IAAI,CAACtI,CAAC,GAAGA,CAAC,CAAA;EACV;EACJ;EACA;MACI,IAAI,CAACkoB,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANEt3B,EAAAA,QAAA,CAOO8K,GAAG,GAAV,SAAAA,MAAa;EACX,IAAA,OAAO,IAAI9K,QAAQ,CAAC,EAAE,CAAC,CAAA;EACzB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MApBE;EAAAA,EAAAA,QAAA,CAqBOud,KAAK,GAAZ,SAAAA,QAAe;EACb,IAAA,IAAAga,SAAA,GAAqBP,QAAQ,CAAC9iC,SAAS,CAAC;EAAjC4D,MAAAA,IAAI,GAAAy/B,SAAA,CAAA,CAAA,CAAA;EAAEL,MAAAA,IAAI,GAAAK,SAAA,CAAA,CAAA,CAAA;EACd5hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;EAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;EAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;EAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;EAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;EAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;EAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;EAC9D,IAAA,OAAOP,OAAO,CAAC;EAAEhhC,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,KAAK,EAALA,KAAK;EAAEC,MAAAA,GAAG,EAAHA,GAAG;EAAEO,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,MAAM,EAANA,MAAM;EAAEE,MAAAA,MAAM,EAANA,MAAM;EAAEmG,MAAAA,WAAW,EAAXA,WAAAA;OAAa,EAAE5E,IAAI,CAAC,CAAA;EAC/E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAxBE;EAAAkI,EAAAA,QAAA,CAyBOC,GAAG,GAAV,SAAAA,MAAa;EACX,IAAA,IAAAu3B,UAAA,GAAqBR,QAAQ,CAAC9iC,SAAS,CAAC;EAAjC4D,MAAAA,IAAI,GAAA0/B,UAAA,CAAA,CAAA,CAAA;EAAEN,MAAAA,IAAI,GAAAM,UAAA,CAAA,CAAA,CAAA;EACd7hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;EAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;EAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;EAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;EAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;EAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;EAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;EAE9Dp/B,IAAAA,IAAI,CAAC2D,IAAI,GAAG8L,eAAe,CAACE,WAAW,CAAA;EACvC,IAAA,OAAOkvB,OAAO,CAAC;EAAEhhC,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,KAAK,EAALA,KAAK;EAAEC,MAAAA,GAAG,EAAHA,GAAG;EAAEO,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,MAAM,EAANA,MAAM;EAAEE,MAAAA,MAAM,EAANA,MAAM;EAAEmG,MAAAA,WAAW,EAAXA,WAAAA;OAAa,EAAE5E,IAAI,CAAC,CAAA;EAC/E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAAkI,QAAA,CAOOy3B,UAAU,GAAjB,SAAAA,WAAkBz9B,IAAI,EAAEmF,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAClC,IAAA,IAAMtH,EAAE,GAAGwX,MAAM,CAACrV,IAAI,CAAC,GAAGA,IAAI,CAACirB,OAAO,EAAE,GAAGhpB,GAAG,CAAA;EAC9C,IAAA,IAAI2W,MAAM,CAAC1W,KAAK,CAACrE,EAAE,CAAC,EAAE;EACpB,MAAA,OAAOmI,QAAQ,CAACkjB,OAAO,CAAC,eAAe,CAAC,CAAA;EAC1C,KAAA;MAEA,IAAMwU,SAAS,GAAG3vB,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EACnE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;QACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;EACrD,KAAA;MAEA,OAAO,IAAI13B,QAAQ,CAAC;EAClBnI,MAAAA,EAAE,EAAEA,EAAE;EACN4D,MAAAA,IAAI,EAAEi8B,SAAS;EACfr3B,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,KAAC,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAa,QAAA,CAWOojB,UAAU,GAAjB,SAAAA,WAAkB/F,YAAY,EAAEle,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAC1C,IAAA,IAAI,CAACiJ,QAAQ,CAACiV,YAAY,CAAC,EAAE;EAC3B,MAAA,MAAM,IAAIloB,oBAAoB,CAAA,wDAAA,GAC6B,OAAOkoB,YAAY,GAAA,cAAA,GAAeA,YAC7F,CAAC,CAAA;OACF,MAAM,IAAIA,YAAY,GAAG,CAACoW,QAAQ,IAAIpW,YAAY,GAAGoW,QAAQ,EAAE;EAC9D;EACA,MAAA,OAAOzzB,QAAQ,CAACkjB,OAAO,CAAC,wBAAwB,CAAC,CAAA;EACnD,KAAC,MAAM;QACL,OAAO,IAAIljB,QAAQ,CAAC;EAClBnI,QAAAA,EAAE,EAAEwlB,YAAY;UAChB5hB,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;EACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,OAAC,CAAC,CAAA;EACJ,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAa,QAAA,CAWO23B,WAAW,GAAlB,SAAAA,YAAmB7iB,OAAO,EAAE3V,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,IAAI,CAACiJ,QAAQ,CAAC0M,OAAO,CAAC,EAAE;EACtB,MAAA,MAAM,IAAI3f,oBAAoB,CAAC,wCAAwC,CAAC,CAAA;EAC1E,KAAC,MAAM;QACL,OAAO,IAAI6K,QAAQ,CAAC;UAClBnI,EAAE,EAAEid,OAAO,GAAG,IAAI;UAClBrZ,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;EACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,OAAC,CAAC,CAAA;EACJ,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhCE;IAAAa,QAAA,CAiCOmE,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC9B+V,IAAAA,GAAG,GAAGA,GAAG,IAAI,EAAE,CAAA;MACf,IAAM6pB,SAAS,GAAG3vB,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAChE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;QACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;EACrD,KAAA;EAEA,IAAA,IAAMr3B,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;EACnC,IAAA,IAAMub,UAAU,GAAGF,eAAe,CAACtF,GAAG,EAAEyoB,2BAA2B,CAAC,CAAA;EACpE,IAAA,IAAAsB,oBAAA,GAA4ChqB,mBAAmB,CAACyF,UAAU,EAAEhT,GAAG,CAAC;QAAxEuM,kBAAkB,GAAAgrB,oBAAA,CAAlBhrB,kBAAkB;QAAEH,WAAW,GAAAmrB,oBAAA,CAAXnrB,WAAW,CAAA;EAEvC,IAAA,IAAMorB,KAAK,GAAGp0B,QAAQ,CAACqH,GAAG,EAAE;EAC1B8rB,MAAAA,YAAY,GAAG,CAACx7B,WAAW,CAACtD,IAAI,CAACo6B,cAAc,CAAC,GAC5Cp6B,IAAI,CAACo6B,cAAc,GACnBwF,SAAS,CAACz/B,MAAM,CAAC4/B,KAAK,CAAC;EAC3BC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;EAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;EAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;QACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;EACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;;EAEhE;EACA;EACA;EACA;EACA;;EAEA,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;EAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;EACH,KAAA;MAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;EACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;EACnF,KAAA;MAEA,IAAMqjC,WAAW,GAAGD,eAAe,IAAK7kB,UAAU,CAACrd,OAAO,IAAI,CAACiiC,cAAe,CAAA;;EAE9E;EACA,IAAA,IAAIxjB,KAAK;QACP2jB,aAAa;EACbC,MAAAA,MAAM,GAAG/D,OAAO,CAACuD,KAAK,EAAEjB,YAAY,CAAC,CAAA;EACvC,IAAA,IAAIuB,WAAW,EAAE;EACf1jB,MAAAA,KAAK,GAAGshB,gBAAgB,CAAA;EACxBqC,MAAAA,aAAa,GAAGvC,qBAAqB,CAAA;QACrCwC,MAAM,GAAG3rB,eAAe,CAAC2rB,MAAM,EAAEzrB,kBAAkB,EAAEH,WAAW,CAAC,CAAA;OAClE,MAAM,IAAIqrB,eAAe,EAAE;EAC1BrjB,MAAAA,KAAK,GAAGuhB,mBAAmB,CAAA;EAC3BoC,MAAAA,aAAa,GAAGtC,wBAAwB,CAAA;EACxCuC,MAAAA,MAAM,GAAG9qB,kBAAkB,CAAC8qB,MAAM,CAAC,CAAA;EACrC,KAAC,MAAM;EACL5jB,MAAAA,KAAK,GAAGgN,YAAY,CAAA;EACpB2W,MAAAA,aAAa,GAAGxC,iBAAiB,CAAA;EACnC,KAAA;;EAEA;MACA,IAAI0C,UAAU,GAAG,KAAK,CAAA;EACtB,IAAA,KAAA,IAAAC,UAAA,GAAA7iB,+BAAA,CAAgBjB,KAAK,CAAA,EAAA+jB,MAAA,EAAA,CAAA,CAAAA,MAAA,GAAAD,UAAA,EAAA,EAAA3iB,IAAA,GAAE;EAAA,MAAA,IAAZtC,CAAC,GAAAklB,MAAA,CAAAt9B,KAAA,CAAA;EACV,MAAA,IAAMuV,CAAC,GAAG4C,UAAU,CAACC,CAAC,CAAC,CAAA;EACvB,MAAA,IAAI,CAAClY,WAAW,CAACqV,CAAC,CAAC,EAAE;EACnB6nB,QAAAA,UAAU,GAAG,IAAI,CAAA;SAClB,MAAM,IAAIA,UAAU,EAAE;EACrBjlB,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG8kB,aAAa,CAAC9kB,CAAC,CAAC,CAAA;EAClC,OAAC,MAAM;EACLD,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG+kB,MAAM,CAAC/kB,CAAC,CAAC,CAAA;EAC3B,OAAA;EACF,KAAA;;EAEA;MACA,IAAMmlB,kBAAkB,GAAGN,WAAW,GAChChqB,kBAAkB,CAACkF,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC/DqrB,eAAe,GACfrpB,qBAAqB,CAAC4E,UAAU,CAAC,GACjC1E,uBAAuB,CAAC0E,UAAU,CAAC;EACvC6P,MAAAA,OAAO,GAAGuV,kBAAkB,IAAI1pB,kBAAkB,CAACsE,UAAU,CAAC,CAAA;EAEhE,IAAA,IAAI6P,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAA;;EAEA;MACM,IAAAwV,SAAS,GAAGP,WAAW,GACvBlrB,eAAe,CAACoG,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC5DqrB,eAAe,GACfrqB,kBAAkB,CAAC4F,UAAU,CAAC,GAC9BA,UAAU;QAAAslB,SAAA,GACW9D,OAAO,CAAC6D,SAAS,EAAE9B,YAAY,EAAEc,SAAS,CAAC;EAAnEkB,MAAAA,OAAO,GAAAD,SAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,WAAW,GAAAF,SAAA,CAAA,CAAA,CAAA;QACrB7E,IAAI,GAAG,IAAI9zB,QAAQ,CAAC;EAClBnI,QAAAA,EAAE,EAAE+gC,OAAO;EACXn9B,QAAAA,IAAI,EAAEi8B,SAAS;EACftoB,QAAAA,CAAC,EAAEypB,WAAW;EACdx4B,QAAAA,GAAG,EAAHA,GAAAA;EACF,OAAC,CAAC,CAAA;;EAEJ;EACA,IAAA,IAAIgT,UAAU,CAACrd,OAAO,IAAIiiC,cAAc,IAAIpqB,GAAG,CAAC7X,OAAO,KAAK89B,IAAI,CAAC99B,OAAO,EAAE;EACxE,MAAA,OAAOgK,QAAQ,CAACkjB,OAAO,CACrB,oBAAoB,EACmB7P,sCAAAA,GAAAA,UAAU,CAACrd,OAAO,uBAAkB89B,IAAI,CAACxP,KAAK,EACvF,CAAC,CAAA;EACH,KAAA;EAEA,IAAA,IAAI,CAACwP,IAAI,CAAC/a,OAAO,EAAE;EACjB,MAAA,OAAO/Y,QAAQ,CAACkjB,OAAO,CAAC4Q,IAAI,CAAC5Q,OAAO,CAAC,CAAA;EACvC,KAAA;EAEA,IAAA,OAAO4Q,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;IAAA9zB,QAAA,CAiBOyjB,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC5B,IAAA,IAAAghC,aAAA,GAA2BrY,YAAY,CAACiD,IAAI,CAAC;EAAtCzB,MAAAA,IAAI,GAAA6W,aAAA,CAAA,CAAA,CAAA;EAAE3D,MAAAA,UAAU,GAAA2D,aAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAO5D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;IAAA1jB,QAAA,CAeO+4B,WAAW,GAAlB,SAAAA,YAAmBrV,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAChC,IAAA,IAAAkhC,iBAAA,GAA2BtY,gBAAgB,CAACgD,IAAI,CAAC;EAA1CzB,MAAAA,IAAI,GAAA+W,iBAAA,CAAA,CAAA,CAAA;EAAE7D,MAAAA,UAAU,GAAA6D,iBAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAO9D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;IAAA1jB,QAAA,CAgBOi5B,QAAQ,GAAf,SAAAA,SAAgBvV,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,IAAAohC,cAAA,GAA2BvY,aAAa,CAAC+C,IAAI,CAAC;EAAvCzB,MAAAA,IAAI,GAAAiX,cAAA,CAAA,CAAA,CAAA;EAAE/D,MAAAA,UAAU,GAAA+D,cAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAOhE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,MAAM,EAAEA,IAAI,CAAC,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAAkI,QAAA,CAcOm5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACpC,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAACkc,GAAG,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIniB,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;MAEA,IAAAwI,KAAA,GAAkD7F,IAAI;QAAAshC,YAAA,GAAAz7B,KAAA,CAA9C/E,MAAM;EAANA,MAAAA,MAAM,GAAAwgC,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAA17B,KAAA,CAAE4B,eAAe;EAAfA,MAAAA,eAAe,GAAA85B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CC,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC;QAAAg2B,gBAAA,GAC4CjG,eAAe,CAACgG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC;EAApF2K,MAAAA,IAAI,GAAAsX,gBAAA,CAAA,CAAA,CAAA;EAAEpE,MAAAA,UAAU,GAAAoE,gBAAA,CAAA,CAAA,CAAA;EAAErH,MAAAA,cAAc,GAAAqH,gBAAA,CAAA,CAAA,CAAA;EAAErW,MAAAA,OAAO,GAAAqW,gBAAA,CAAA,CAAA,CAAA,CAAA;EAC5C,IAAA,IAAIrW,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAC,MAAM;EACL,MAAA,OAAOgS,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAA,SAAA,GAAYwf,GAAG,EAAIoM,IAAI,EAAEwO,cAAc,CAAC,CAAA;EAC3F,KAAA;EACF,GAAA;;EAEA;EACF;EACA,MAFE;IAAAlyB,QAAA,CAGOw5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkB9V,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACpC,OAAOkI,QAAQ,CAACm5B,UAAU,CAACzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MApBE;IAAAkI,QAAA,CAqBOy5B,OAAO,GAAd,SAAAA,QAAe/V,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC5B,IAAA,IAAA4hC,SAAA,GAA2BxY,QAAQ,CAACwC,IAAI,CAAC;EAAlCzB,MAAAA,IAAI,GAAAyX,SAAA,CAAA,CAAA,CAAA;EAAEvE,MAAAA,UAAU,GAAAuE,SAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAOxE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,KAAK,EAAE4rB,IAAI,CAAC,CAAA;EACjE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA1jB,QAAA,CAMOkjB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAI3W,oBAAoB,CAAC6uB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAIljB,QAAQ,CAAC;EAAEkjB,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAljB,EAAAA,QAAA,CAKO25B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBvqB,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACkoB,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAt3B,QAAA,CAMO45B,kBAAkB,GAAzB,SAAAA,mBAA0B/hB,UAAU,EAAEgiB,UAAU,EAAO;EAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG,EAAE,CAAA;EAAA,KAAA;EACnD,IAAA,IAAMC,SAAS,GAAGlH,kBAAkB,CAAC/a,UAAU,EAAErZ,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;MAC/E,OAAO,CAACC,SAAS,GAAG,IAAI,GAAGA,SAAS,CAAC13B,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,MAAA,OAAMA,CAAC,GAAGA,CAAC,CAAC4K,GAAG,GAAG,IAAI,CAAA;EAAA,KAAC,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;EAC9E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAArC,QAAA,CAOO+5B,YAAY,GAAnB,SAAAA,aAAoBziB,GAAG,EAAEuiB,UAAU,EAAO;EAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,IAAMG,QAAQ,GAAGnH,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9Y,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;EAC7F,IAAA,OAAOG,QAAQ,CAAC53B,GAAG,CAAC,UAAC+I,CAAC,EAAA;QAAA,OAAKA,CAAC,CAAC4K,GAAG,CAAA;EAAA,KAAA,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;KAC3C,CAAA;EAAArC,EAAAA,QAAA,CAEMtE,UAAU,GAAjB,SAAAA,aAAoB;EAClB86B,IAAAA,YAAY,GAAG98B,SAAS,CAAA;MACxBg9B,oBAAoB,CAAC/6B,KAAK,EAAE,CAAA;EAC9B,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA,EAAA,IAAAjE,MAAA,GAAAsI,QAAA,CAAArI,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAOAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;MACR,OAAO,IAAI,CAACA,IAAI,CAAC,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAmUA;EACF;EACA;EACA;EACA;EACA;EACA;EANEwC,EAAAA,MAAA,CAOAuiC,kBAAkB,GAAlB,SAAAA,qBAAqB;MACnB,IAAI,CAAC,IAAI,CAAClhB,OAAO,IAAI,IAAI,CAACF,aAAa,EAAE;QACvC,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,KAAA;MACA,IAAMqhB,KAAK,GAAG,QAAQ,CAAA;MACtB,IAAMC,QAAQ,GAAG,KAAK,CAAA;EACtB,IAAA,IAAMlG,OAAO,GAAGx3B,YAAY,CAAC,IAAI,CAACib,CAAC,CAAC,CAAA;MACpC,IAAM0iB,QAAQ,GAAG,IAAI,CAAC3+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;MAClD,IAAMG,MAAM,GAAG,IAAI,CAAC5+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;EAEhD,IAAA,IAAMI,EAAE,GAAG,IAAI,CAAC7+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGmG,QAAQ,GAAGD,QAAQ,CAAC,CAAA;EAC1D,IAAA,IAAM/F,EAAE,GAAG,IAAI,CAAC34B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGoG,MAAM,GAAGF,QAAQ,CAAC,CAAA;MACxD,IAAIG,EAAE,KAAKlG,EAAE,EAAE;QACb,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,KAAA;EACA,IAAA,IAAMmG,GAAG,GAAGtG,OAAO,GAAGqG,EAAE,GAAGH,QAAQ,CAAA;EACnC,IAAA,IAAMK,GAAG,GAAGvG,OAAO,GAAGG,EAAE,GAAG+F,QAAQ,CAAA;EACnC,IAAA,IAAMM,EAAE,GAAGnG,OAAO,CAACiG,GAAG,EAAED,EAAE,CAAC,CAAA;EAC3B,IAAA,IAAMI,EAAE,GAAGpG,OAAO,CAACkG,GAAG,EAAEpG,EAAE,CAAC,CAAA;EAC3B,IAAA,IACEqG,EAAE,CAACrkC,IAAI,KAAKskC,EAAE,CAACtkC,IAAI,IACnBqkC,EAAE,CAACpkC,MAAM,KAAKqkC,EAAE,CAACrkC,MAAM,IACvBokC,EAAE,CAAClkC,MAAM,KAAKmkC,EAAE,CAACnkC,MAAM,IACvBkkC,EAAE,CAAC/9B,WAAW,KAAKg+B,EAAE,CAACh+B,WAAW,EACjC;EACA,MAAA,OAAO,CAACyI,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAE0iC,GAAAA;EAAI,OAAC,CAAC,EAAEp1B,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAE2iC,GAAAA;EAAI,OAAC,CAAC,CAAC,CAAA;EAC7D,KAAA;MACA,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAyDA;EACF;EACA;EACA;EACA;EACA;EALE9iC,EAAAA,MAAA,CAMAijC,qBAAqB,GAArB,SAAAA,qBAAAA,CAAsB7iC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAC7B,IAAA8iC,qBAAA,GAA8CxjB,SAAS,CAAC5b,MAAM,CAC5D,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EACpBA,IACF,CAAC,CAACqB,eAAe,CAAC,IAAI,CAAC;QAHfP,MAAM,GAAAgiC,qBAAA,CAANhiC,MAAM;QAAE2G,eAAe,GAAAq7B,qBAAA,CAAfr7B,eAAe;QAAEC,QAAQ,GAAAo7B,qBAAA,CAARp7B,QAAQ,CAAA;MAIzC,OAAO;EAAE5G,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAe;EAAEG,MAAAA,cAAc,EAAEF,QAAAA;OAAU,CAAA;EAC9D,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAA9H,MAAA,CAQAy2B,KAAK,GAAL,SAAAA,MAAMl2B,MAAM,EAAMH,IAAI,EAAO;EAAA,IAAA,IAAvBG,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,CAAC,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEH,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACzB,IAAA,OAAO,IAAI,CAACkK,OAAO,CAACuF,eAAe,CAACC,QAAQ,CAACvP,MAAM,CAAC,EAAEH,IAAI,CAAC,CAAA;EAC7D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAJ,EAAAA,MAAA,CAMAmjC,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAAC74B,OAAO,CAACyB,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;IAAAvQ,MAAA,CASAsK,OAAO,GAAP,SAAAA,QAAQvG,IAAI,EAAA2I,KAAA,EAA4D;EAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAA02B,mBAAA,GAAA3+B,KAAA,CAAtDiyB,aAAa;EAAbA,MAAAA,aAAa,GAAA0M,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;QAAAC,qBAAA,GAAA5+B,KAAA,CAAE6+B,gBAAgB;EAAhBA,MAAAA,gBAAgB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA,CAAA;MAC7Dt/B,IAAI,GAAGsM,aAAa,CAACtM,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;MAChD,IAAIxM,IAAI,CAACvD,MAAM,CAAC,IAAI,CAACuD,IAAI,CAAC,EAAE;EAC1B,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM,IAAI,CAACA,IAAI,CAACsd,OAAO,EAAE;QACxB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;EAChD,KAAC,MAAM;EACL,MAAA,IAAIw/B,KAAK,GAAG,IAAI,CAACpjC,EAAE,CAAA;QACnB,IAAIu2B,aAAa,IAAI4M,gBAAgB,EAAE;UACrC,IAAMvE,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;EACxC,QAAA,IAAMqjC,KAAK,GAAG,IAAI,CAAC7W,QAAQ,EAAE,CAAA;UAAC,IAAA8W,SAAA,GACpBtG,OAAO,CAACqG,KAAK,EAAEzE,WAAW,EAAEh7B,IAAI,CAAC,CAAA;EAA1Cw/B,QAAAA,KAAK,GAAAE,SAAA,CAAA,CAAA,CAAA,CAAA;EACR,OAAA;QACA,OAAOh2B,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAEojC,KAAK;EAAEx/B,QAAAA,IAAI,EAAJA,IAAAA;EAAK,OAAC,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA/D,EAAAA,MAAA,CAMAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAA6E,MAAA,EAA8D;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAA9C7xB,MAAM,GAAA8xB,KAAA,CAAN9xB,MAAM;QAAE2G,eAAe,GAAAmrB,KAAA,CAAfnrB,eAAe;QAAEG,cAAc,GAAAgrB,KAAA,CAAdhrB,cAAc,CAAA;EACnD,IAAA,IAAMW,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;EAAEvM,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAe;EAAEG,MAAAA,cAAc,EAAdA,cAAAA;EAAe,KAAC,CAAC,CAAA;MACvE,OAAOyF,KAAK,CAAC,IAAI,EAAE;EAAE9E,MAAAA,GAAG,EAAHA,GAAAA;EAAI,KAAC,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA3I,EAAAA,MAAA,CAMA0jC,SAAS,GAAT,SAAAA,SAAAA,CAAUxiC,MAAM,EAAE;MAChB,OAAO,IAAI,CAACgtB,WAAW,CAAC;EAAEhtB,MAAAA,MAAM,EAANA,MAAAA;EAAO,KAAC,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAlB,EAAAA,MAAA,CAaAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAM1F,UAAU,GAAGF,eAAe,CAACmH,MAAM,EAAEgc,2BAA2B,CAAC,CAAA;MACvE,IAAA+E,qBAAA,GAA4CztB,mBAAmB,CAACyF,UAAU,EAAE,IAAI,CAAChT,GAAG,CAAC;QAA7EuM,kBAAkB,GAAAyuB,qBAAA,CAAlBzuB,kBAAkB;QAAEH,WAAW,GAAA4uB,qBAAA,CAAX5uB,WAAW,CAAA;MAEvC,IAAM6uB,gBAAgB,GAClB,CAAClgC,WAAW,CAACiY,UAAU,CAACvG,QAAQ,CAAC,IACjC,CAAC1R,WAAW,CAACiY,UAAU,CAACxG,UAAU,CAAC,IACnC,CAACzR,WAAW,CAACiY,UAAU,CAACrd,OAAO,CAAC;EAClC8hC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;EAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;EAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;QACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;EACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;EAEhE,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;EAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;EACH,KAAA;MAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;EACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;EACnF,KAAA;EAEA,IAAA,IAAI6wB,KAAK,CAAA;EACT,IAAA,IAAI2V,gBAAgB,EAAE;QACpB3V,KAAK,GAAG1Y,eAAe,CAAAtO,QAAA,KAChB+N,eAAe,CAAC,IAAI,CAACgL,CAAC,EAAE9K,kBAAkB,EAAEH,WAAW,CAAC,EAAK4G,UAAU,CAC5EzG,EAAAA,kBAAkB,EAClBH,WACF,CAAC,CAAA;OACF,MAAM,IAAI,CAACrR,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC,EAAE;EAC3CwZ,MAAAA,KAAK,GAAGlY,kBAAkB,CAAA9O,QAAA,KAAM4O,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,EAAKrE,UAAU,CAAE,CAAC,CAAA;EAC9E,KAAC,MAAM;QACLsS,KAAK,GAAAhnB,QAAA,CAAA,EAAA,EAAQ,IAAI,CAAC0lB,QAAQ,EAAE,EAAKhR,UAAU,CAAE,CAAA;;EAE7C;EACA;EACA,MAAA,IAAIjY,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC,EAAE;UAC/B8vB,KAAK,CAAC9vB,GAAG,GAAGwG,IAAI,CAAC+N,GAAG,CAAC0E,WAAW,CAAC6W,KAAK,CAAChwB,IAAI,EAAEgwB,KAAK,CAAC/vB,KAAK,CAAC,EAAE+vB,KAAK,CAAC9vB,GAAG,CAAC,CAAA;EACvE,OAAA;EACF,KAAA;EAEA,IAAA,IAAA0lC,SAAA,GAAgB1G,OAAO,CAAClP,KAAK,EAAE,IAAI,CAACvW,CAAC,EAAE,IAAI,CAAC3T,IAAI,CAAC;EAA1C5D,MAAAA,EAAE,GAAA0jC,SAAA,CAAA,CAAA,CAAA;EAAEnsB,MAAAA,CAAC,GAAAmsB,SAAA,CAAA,CAAA,CAAA,CAAA;MACZ,OAAOp2B,KAAK,CAAC,IAAI,EAAE;EAAEtN,MAAAA,EAAE,EAAFA,EAAE;EAAEuX,MAAAA,CAAC,EAADA,CAAAA;EAAE,KAAC,CAAC,CAAA;EAC/B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAA1X,EAAAA,MAAA,CAaAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;MAC/C,OAAO/f,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA3hB,EAAAA,MAAA,CAMA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAACI,MAAM,EAAE,CAAA;MACxD,OAAOngB,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA3hB,MAAA,CAYAwwB,OAAO,GAAP,SAAAA,QAAQhzB,IAAI,EAAAy2B,MAAA,EAAmC;EAAA,IAAA,IAAAI,KAAA,GAAAJ,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA6P,oBAAA,GAAAzP,KAAA,CAA7B5D,cAAc;EAAdA,MAAAA,cAAc,GAAAqT,oBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,oBAAA,CAAA;EACpC,IAAA,IAAI,CAAC,IAAI,CAACziB,OAAO,EAAE,OAAO,IAAI,CAAA;MAE9B,IAAM3J,CAAC,GAAG,EAAE;EACVqsB,MAAAA,cAAc,GAAG1Z,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAA;EAC/C,IAAA,QAAQumC,cAAc;EACpB,MAAA,KAAK,OAAO;UACVrsB,CAAC,CAACxZ,KAAK,GAAG,CAAC,CAAA;EACb;EACA,MAAA,KAAK,UAAU,CAAA;EACf,MAAA,KAAK,QAAQ;UACXwZ,CAAC,CAACvZ,GAAG,GAAG,CAAC,CAAA;EACX;EACA,MAAA,KAAK,OAAO,CAAA;EACZ,MAAA,KAAK,MAAM;UACTuZ,CAAC,CAAChZ,IAAI,GAAG,CAAC,CAAA;EACZ;EACA,MAAA,KAAK,OAAO;UACVgZ,CAAC,CAAC/Y,MAAM,GAAG,CAAC,CAAA;EACd;EACA,MAAA,KAAK,SAAS;UACZ+Y,CAAC,CAAC7Y,MAAM,GAAG,CAAC,CAAA;EACd;EACA,MAAA,KAAK,SAAS;UACZ6Y,CAAC,CAAC1S,WAAW,GAAG,CAAC,CAAA;EACjB,QAAA,MAAA;EAGF;EACF,KAAA;;MAEA,IAAI++B,cAAc,KAAK,OAAO,EAAE;EAC9B,MAAA,IAAItT,cAAc,EAAE;UAClB,IAAM1b,WAAW,GAAG,IAAI,CAACpM,GAAG,CAAC6G,cAAc,EAAE,CAAA;EAC7C,QAAA,IAAQlR,OAAO,GAAK,IAAI,CAAhBA,OAAO,CAAA;UACf,IAAIA,OAAO,GAAGyW,WAAW,EAAE;EACzB2C,UAAAA,CAAC,CAACvC,UAAU,GAAG,IAAI,CAACA,UAAU,GAAG,CAAC,CAAA;EACpC,SAAA;UACAuC,CAAC,CAACpZ,OAAO,GAAGyW,WAAW,CAAA;EACzB,OAAC,MAAM;UACL2C,CAAC,CAACpZ,OAAO,GAAG,CAAC,CAAA;EACf,OAAA;EACF,KAAA;MAEA,IAAIylC,cAAc,KAAK,UAAU,EAAE;QACjC,IAAMrJ,CAAC,GAAG/1B,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAChc,KAAK,GAAG,CAAC,CAAC,CAAA;QACnCwZ,CAAC,CAACxZ,KAAK,GAAG,CAACw8B,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;EAC3B,KAAA;EAEA,IAAA,OAAO,IAAI,CAACv4B,GAAG,CAACuV,CAAC,CAAC,CAAA;EACpB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA1X,MAAA,CAYAgkC,KAAK,GAAL,SAAAA,MAAMxmC,IAAI,EAAE4C,IAAI,EAAE;EAAA,IAAA,IAAA6jC,UAAA,CAAA;EAChB,IAAA,OAAO,IAAI,CAAC5iB,OAAO,GACf,IAAI,CAAC9W,IAAI,EAAA05B,UAAA,GAAAA,EAAAA,EAAAA,UAAA,CAAIzmC,IAAI,IAAG,CAAC,EAAAymC,UAAA,EAAG,CACrBzT,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CACnButB,KAAK,CAAC,CAAC,CAAC,GACX,IAAI,CAAA;EACV,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA3tB,MAAA,CAYAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAACiF,aAAa,CAACxN,IAAI,CAAC,CAAC,CAAC4gB,wBAAwB,CAAC,IAAI,EAAEpB,GAAG,CAAC,GAClF6J,OAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAlBE;IAAAzpB,MAAA,CAmBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;EAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG3B,UAAkB,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACG,cAAc,CAAC,IAAI,CAAC,GACvEmJ,OAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAzpB,EAAAA,MAAA,CAaAkkC,aAAa,GAAb,SAAAA,aAAAA,CAAc9jC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACmgB,mBAAmB,CAAC,IAAI,CAAC,GACtE,EAAE,CAAA;EACR,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;EAAAvgB,EAAAA,MAAA,CAiBA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAAwH,MAAA,EAOQ;EAAA,IAAA,IAAAQ,KAAA,GAAAR,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA+P,YAAA,GAAAvP,KAAA,CANJt0B,MAAM;EAANA,MAAAA,MAAM,GAAA6jC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,qBAAA,GAAAxP,KAAA,CACnB3H,eAAe;EAAfA,MAAAA,eAAe,GAAAmX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,qBAAA,GAAAzP,KAAA,CACvB5H,oBAAoB;EAApBA,MAAAA,oBAAoB,GAAAqX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,mBAAA,GAAA1P,KAAA,CAC5BzH,aAAa;EAAbA,MAAAA,aAAa,GAAAmX,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,kBAAA,GAAA3P,KAAA,CACpBmJ,YAAY;EAAZA,MAAAA,YAAY,GAAAwG,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;QAAAC,eAAA,GAAA5P,KAAA,CACpBiJ,SAAS;EAATA,MAAAA,SAAS,GAAA2G,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;EAE1B,IAAA,IAAI,CAAC,IAAI,CAACnjB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;EACpC,IAAA,IAAM4G,GAAG,GAAGnkC,MAAM,KAAK,UAAU,CAAA;MAEjC,IAAI0f,CAAC,GAAG6S,UAAS,CAAC,IAAI,EAAE4R,GAAG,EAAE5G,SAAS,CAAC,CAAA;MACvC,IAAI9T,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,EAAE7d,CAAC,IAAI,GAAG,CAAA;EAClDA,IAAAA,CAAC,IAAI6M,UAAS,CACZ,IAAI,EACJ4X,GAAG,EACHxX,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;EACD,IAAA,OAAO7d,CAAC,CAAA;EACV,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAAhgB,EAAAA,MAAA,CAUA6yB,SAAS,GAAT,SAAAA,SAAAA,CAAA8B,MAAA,EAA2D;EAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA+P,YAAA,GAAAxP,KAAA,CAA7C50B,MAAM;EAANA,MAAAA,MAAM,GAAAokC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,eAAA,GAAAzP,KAAA,CAAE2I,SAAS;EAATA,MAAAA,SAAS,GAAA8G,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;EAChD,IAAA,IAAI,CAAC,IAAI,CAACtjB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAEvyB,MAAM,KAAK,UAAU,EAAEqrB,aAAa,CAACkS,SAAS,CAAC,CAAC,CAAA;EACzE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA79B,EAAAA,MAAA,CAKA4kC,aAAa,GAAb,SAAAA,gBAAgB;EACd,IAAA,OAAOjH,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;EAAA39B,EAAAA,MAAA,CAiBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAAoI,MAAA,EAQQ;EAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA4P,qBAAA,GAAArP,KAAA,CAPJxI,oBAAoB;EAApBA,MAAAA,oBAAoB,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,qBAAA,GAAAtP,KAAA,CAC5BvI,eAAe;EAAfA,MAAAA,eAAe,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,mBAAA,GAAAvP,KAAA,CACvBrI,aAAa;EAAbA,MAAAA,aAAa,GAAA4X,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,mBAAA,GAAAxP,KAAA,CACpBtI,aAAa;EAAbA,MAAAA,aAAa,GAAA8X,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;QAAAC,kBAAA,GAAAzP,KAAA,CACrBuI,YAAY;EAAZA,MAAAA,YAAY,GAAAkH,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;QAAAC,YAAA,GAAA1P,KAAA,CACpBl1B,MAAM;EAANA,MAAAA,MAAM,GAAA4kC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,eAAA,GAAA3P,KAAA,CACnBqI,SAAS;EAATA,MAAAA,SAAS,GAAAsH,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;EAE1B,IAAA,IAAI,CAAC,IAAI,CAAC9jB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;EACpC,IAAA,IAAI7d,CAAC,GAAGkN,aAAa,IAAInD,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAA;EACxE,IAAA,OACE7d,CAAC,GACD6M,UAAS,CACP,IAAI,EACJvsB,MAAM,KAAK,UAAU,EACrB2sB,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;EAEL,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA79B,EAAAA,MAAA,CAMAolC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,OAAOzH,YAAY,CAAC,IAAI,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAA;EACnE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA39B,EAAAA,MAAA,CAQAqlC,MAAM,GAAN,SAAAA,SAAS;MACP,OAAO1H,YAAY,CAAC,IAAI,CAAClH,KAAK,EAAE,EAAE,iCAAiC,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAz2B,EAAAA,MAAA,CAKAslC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAACjkB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAC9B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;EAAA7yB,EAAAA,MAAA,CAYAulC,SAAS,GAAT,SAAAA,SAAAA,CAAAhQ,MAAA,EAAyF;EAAA,IAAA,IAAAM,KAAA,GAAAN,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAiQ,mBAAA,GAAA3P,KAAA,CAA3E1I,aAAa;EAAbA,MAAAA,aAAa,GAAAqY,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,iBAAA,GAAA5P,KAAA,CAAE6P,WAAW;EAAXA,MAAAA,WAAW,GAAAD,iBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,iBAAA;QAAAE,qBAAA,GAAA9P,KAAA,CAAE+P,kBAAkB;EAAlBA,MAAAA,kBAAkB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA,CAAA;MAC9E,IAAI/lB,GAAG,GAAG,cAAc,CAAA;MAExB,IAAI8lB,WAAW,IAAIvY,aAAa,EAAE;EAChC,MAAA,IAAIyY,kBAAkB,EAAE;EACtBhmB,QAAAA,GAAG,IAAI,GAAG,CAAA;EACZ,OAAA;EACA,MAAA,IAAI8lB,WAAW,EAAE;EACf9lB,QAAAA,GAAG,IAAI,GAAG,CAAA;SACX,MAAM,IAAIuN,aAAa,EAAE;EACxBvN,QAAAA,GAAG,IAAI,IAAI,CAAA;EACb,OAAA;EACF,KAAA;EAEA,IAAA,OAAO+d,YAAY,CAAC,IAAI,EAAE/d,GAAG,EAAE,IAAI,CAAC,CAAA;EACtC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;EAAA5f,EAAAA,MAAA,CAYA6lC,KAAK,GAAL,SAAAA,KAAAA,CAAMzlC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACb,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;MAEA,OAAU,IAAI,CAACikB,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACC,SAAS,CAACnlC,IAAI,CAAC,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAJ,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAO,IAAI,CAACyR,OAAO,GAAG,IAAI,CAACuL,KAAK,EAAE,GAAGnD,OAAO,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAAzpB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,iBAAA,GAAyB,IAAI,CAACuL,KAAK,EAAE,GAAW,UAAA,GAAA,IAAI,CAAC7oB,IAAI,CAAClD,IAAI,GAAa,YAAA,GAAA,IAAI,CAACK,MAAM,GAAA,IAAA,CAAA;EACxF,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAACosB,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAttB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA/sB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAO,IAAI,CAAC1L,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIA8lC,SAAS,GAAT,SAAAA,YAAY;MACV,OAAO,IAAI,CAACzkB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAG,IAAI,GAAGoE,GAAG,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIA+lC,aAAa,GAAb,SAAAA,gBAAgB;EACd,IAAA,OAAO,IAAI,CAAC1kB,OAAO,GAAG1c,IAAI,CAAC2E,KAAK,CAAC,IAAI,CAACnJ,EAAE,GAAG,IAAI,CAAC,GAAGoE,GAAG,CAAA;EACxD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5sB,EAAAA,MAAA,CAIAgmC,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACp7B,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA5K,EAAAA,MAAA,CAOA2sB,QAAQ,GAAR,SAAAA,QAAAA,CAASvsB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAChB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,EAAE,CAAA;EAE5B,IAAA,IAAMnb,IAAI,GAAAe,QAAA,KAAQ,IAAI,CAAC+Y,CAAC,CAAE,CAAA;MAE1B,IAAI5f,IAAI,CAAC6lC,aAAa,EAAE;EACtB//B,MAAAA,IAAI,CAAC8B,cAAc,GAAG,IAAI,CAACA,cAAc,CAAA;EACzC9B,MAAAA,IAAI,CAAC2B,eAAe,GAAG,IAAI,CAACc,GAAG,CAACd,eAAe,CAAA;EAC/C3B,MAAAA,IAAI,CAAChF,MAAM,GAAG,IAAI,CAACyH,GAAG,CAACzH,MAAM,CAAA;EAC/B,KAAA;EACA,IAAA,OAAOgF,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAlG,EAAAA,MAAA,CAIA4K,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,OAAO,IAAIxJ,IAAI,CAAC,IAAI,CAACigB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAC,CAAA;EAC/C,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;IAAAvE,MAAA,CAeA0wB,IAAI,GAAJ,SAAAA,IAAAA,CAAKwV,aAAa,EAAE1oC,IAAI,EAAmB4C,IAAI,EAAO;EAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAClD,IAAI,CAAC,IAAI,CAACihB,OAAO,IAAI,CAAC6kB,aAAa,CAAC7kB,OAAO,EAAE;EAC3C,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,wCAAwC,CAAC,CAAA;EACnE,KAAA;MAEA,IAAM2a,OAAO,GAAAl/B,QAAA,CAAA;QAAK/F,MAAM,EAAE,IAAI,CAACA,MAAM;QAAE2G,eAAe,EAAE,IAAI,CAACA,eAAAA;EAAe,KAAA,EAAKzH,IAAI,CAAE,CAAA;EAEvF,IAAA,IAAM2c,KAAK,GAAGnF,UAAU,CAACpa,IAAI,CAAC,CAACkN,GAAG,CAAC2f,QAAQ,CAACsB,aAAa,CAAC;QACxDya,YAAY,GAAGF,aAAa,CAAC3Y,OAAO,EAAE,GAAG,IAAI,CAACA,OAAO,EAAE;EACvD+I,MAAAA,OAAO,GAAG8P,YAAY,GAAG,IAAI,GAAGF,aAAa;EAC7C3P,MAAAA,KAAK,GAAG6P,YAAY,GAAGF,aAAa,GAAG,IAAI;QAC3CG,MAAM,GAAG3V,KAAI,CAAC4F,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAEopB,OAAO,CAAC,CAAA;MAE/C,OAAOC,YAAY,GAAGC,MAAM,CAACzY,MAAM,EAAE,GAAGyY,MAAM,CAAA;EAChD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAArmC,MAAA,CAQAsmC,OAAO,GAAP,SAAAA,QAAQ9oC,IAAI,EAAmB4C,IAAI,EAAO;EAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,OAAO,IAAI,CAACswB,IAAI,CAACpoB,QAAQ,CAAC8K,GAAG,EAAE,EAAE5V,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAJ,EAAAA,MAAA,CAKAumC,KAAK,GAAL,SAAAA,KAAAA,CAAML,aAAa,EAAE;EACnB,IAAA,OAAO,IAAI,CAAC7kB,OAAO,GAAGqO,QAAQ,CAACE,aAAa,CAAC,IAAI,EAAEsW,aAAa,CAAC,GAAG,IAAI,CAAA;EAC1E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAlmC,MAAA,CAWA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQuV,aAAa,EAAE1oC,IAAI,EAAE4C,IAAI,EAAE;EACjC,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,KAAK,CAAA;EAE/B,IAAA,IAAMmlB,OAAO,GAAGN,aAAa,CAAC3Y,OAAO,EAAE,CAAA;MACvC,IAAMkZ,cAAc,GAAG,IAAI,CAACn8B,OAAO,CAAC47B,aAAa,CAACniC,IAAI,EAAE;EAAE2yB,MAAAA,aAAa,EAAE,IAAA;EAAK,KAAC,CAAC,CAAA;MAChF,OACE+P,cAAc,CAACjW,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,IAAIomC,OAAO,IAAIA,OAAO,IAAIC,cAAc,CAACzC,KAAK,CAACxmC,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAEhG,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAJ,EAAAA,MAAA,CAOAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;EACZ,IAAA,OACE,IAAI,CAAC0R,OAAO,IACZ1R,KAAK,CAAC0R,OAAO,IACb,IAAI,CAACkM,OAAO,EAAE,KAAK5d,KAAK,CAAC4d,OAAO,EAAE,IAClC,IAAI,CAACxpB,IAAI,CAACvD,MAAM,CAACmP,KAAK,CAAC5L,IAAI,CAAC,IAC5B,IAAI,CAAC4E,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,CAAA;EAE9B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAlBE;EAAA3I,EAAAA,MAAA,CAmBA0mC,UAAU,GAAV,SAAAA,UAAAA,CAAWj/B,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMnb,IAAI,GAAGuB,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;UAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;EAAK,OAAC,CAAC;EACvE4iC,MAAAA,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,IAAI,GAAGzgC,IAAI,GAAG,CAACuB,OAAO,CAACk/B,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,CAAC,CAAA;EACpF,IAAA,IAAI5pB,KAAK,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;EACtE,IAAA,IAAIvf,IAAI,GAAGiK,OAAO,CAACjK,IAAI,CAAA;MACvB,IAAIsa,KAAK,CAACC,OAAO,CAACtQ,OAAO,CAACjK,IAAI,CAAC,EAAE;QAC/Buf,KAAK,GAAGtV,OAAO,CAACjK,IAAI,CAAA;EACpBA,MAAAA,IAAI,GAAGwE,SAAS,CAAA;EAClB,KAAA;EACA,IAAA,OAAOo9B,YAAY,CAACl5B,IAAI,EAAE,IAAI,CAACqE,IAAI,CAACo8B,OAAO,CAAC,EAAA1/B,QAAA,KACvCQ,OAAO,EAAA;EACV8D,MAAAA,OAAO,EAAE,QAAQ;EACjBwR,MAAAA,KAAK,EAALA,KAAK;EACLvf,MAAAA,IAAI,EAAJA,IAAAA;EAAI,KAAA,CACL,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAwC,EAAAA,MAAA,CAaA4mC,kBAAkB,GAAlB,SAAAA,kBAAAA,CAAmBn/B,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,OAAO+d,YAAY,CAAC33B,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;QAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;EAAK,KAAC,CAAC,EAAE,IAAI,EAAAkD,QAAA,KACjFQ,OAAO,EAAA;EACV8D,MAAAA,OAAO,EAAE,MAAM;EACfwR,MAAAA,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC;EAClCsiB,MAAAA,SAAS,EAAE,IAAA;EAAI,KAAA,CAChB,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA/2B,EAAAA,QAAA,CAKOoK,GAAG,GAAV,SAAAA,MAAyB;EAAA,IAAA,KAAA,IAAAqQ,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;MACrB,IAAI,CAACgO,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;EAC3E,KAAA;EACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;OAAE5oB,EAAAA,IAAI,CAAC+N,GAAG,CAAC,CAAA;EACxD,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApK,EAAAA,QAAA,CAKOqK,GAAG,GAAV,SAAAA,MAAyB;EAAA,IAAA,KAAA,IAAA0Q,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAT0N,MAAAA,SAAS,CAAA1N,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,KAAA;MACrB,IAAI,CAAC0N,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;EAC3E,KAAA;EACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;OAAE5oB,EAAAA,IAAI,CAACgO,GAAG,CAAC,CAAA;EACxD,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAArK,QAAA,CAOOw+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyB9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9C,IAAAG,QAAA,GAAkDH,OAAO;QAAAs/B,eAAA,GAAAn/B,QAAA,CAAjD1G,MAAM;EAANA,MAAAA,MAAM,GAAA6lC,eAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,eAAA;QAAAC,qBAAA,GAAAp/B,QAAA,CAAEC,eAAe;EAAfA,MAAAA,eAAe,GAAAm/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CpF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;EACJ,IAAA,OAAO2vB,iBAAiB,CAACoG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC,CAAA;EAClD,GAAA;;EAEA;EACF;EACA,MAFE;IAAAtX,QAAA,CAGO2+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyBjb,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9C,OAAOa,QAAQ,CAACw+B,iBAAiB,CAAC9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,CAAC,CAAA;EACvD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAAa,QAAA,CAYO4+B,iBAAiB,GAAxB,SAAAA,kBAAyBtnB,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MACxC,IAAA0/B,SAAA,GAAkD1/B,OAAO;QAAA2/B,gBAAA,GAAAD,SAAA,CAAjDjmC,MAAM;EAANA,MAAAA,MAAM,GAAAkmC,gBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,gBAAA;QAAAC,qBAAA,GAAAF,SAAA,CAAEt/B,eAAe;EAAfA,MAAAA,eAAe,GAAAw/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CzF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;EACJ,IAAA,OAAO,IAAIuvB,WAAW,CAACwG,WAAW,EAAEhiB,GAAG,CAAC,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;IAAAtX,QAAA,CAUOg/B,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBtb,IAAI,EAAEub,YAAY,EAAEnnC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACnD,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAAC6jC,YAAY,CAAC,EAAE;EAClD,MAAA,MAAM,IAAI9pC,oBAAoB,CAC5B,+DACF,CAAC,CAAA;EACH,KAAA;MACA,IAAA+pC,MAAA,GAAkDpnC,IAAI;QAAAqnC,aAAA,GAAAD,MAAA,CAA9CtmC,MAAM;EAANA,MAAAA,MAAM,GAAAumC,aAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,aAAA;QAAAC,qBAAA,GAAAF,MAAA,CAAE3/B,eAAe;EAAfA,MAAAA,eAAe,GAAA6/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3C9F,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;MAEJ,IAAI,CAAC+1B,WAAW,CAACphC,MAAM,CAAC+mC,YAAY,CAACrmC,MAAM,CAAC,EAAE;QAC5C,MAAM,IAAIzD,oBAAoB,CAC5B,2CAA4CmkC,GAAAA,WAAW,sDACZ2F,YAAY,CAACrmC,MAAM,CAChE,CAAC,CAAA;EACH,KAAA;EAEA,IAAA,IAAAymC,qBAAA,GAAwDJ,YAAY,CAAC/L,iBAAiB,CAACxP,IAAI,CAAC;QAApFrE,MAAM,GAAAggB,qBAAA,CAANhgB,MAAM;QAAE5jB,IAAI,GAAA4jC,qBAAA,CAAJ5jC,IAAI;QAAEy2B,cAAc,GAAAmN,qBAAA,CAAdnN,cAAc;QAAElN,aAAa,GAAAqa,qBAAA,CAAbra,aAAa,CAAA;EAEnD,IAAA,IAAIA,aAAa,EAAE;EACjB,MAAA,OAAOhlB,QAAQ,CAACkjB,OAAO,CAAC8B,aAAa,CAAC,CAAA;EACxC,KAAC,MAAM;EACL,MAAA,OAAOkQ,mBAAmB,CACxB7V,MAAM,EACN5jB,IAAI,EACJ3D,IAAI,EACMmnC,SAAAA,GAAAA,YAAY,CAACjnC,MAAM,EAC7B0rB,IAAI,EACJwO,cACF,CAAC,CAAA;EACH,KAAA;EACF,GAAA;;EAEA;;EAEA;EACF;EACA;EACA,MAHE;EAAA95B,EAAAA,YAAA,CAAA4H,QAAA,EAAA,CAAA;MAAA3H,GAAA,EAAA,SAAA;MAAAC,GAAA,EA3xCA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7qB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAhT,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;EAC9C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAlH,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;QACnB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACX,cAAc,GAAG,IAAI,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAArH,GAAA,EAAA,MAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAAC++B,KAAK,CAAA;EACnB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAh/B,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAAClD,IAAI,GAAG,IAAI,CAAA;EAC7C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAF,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC/hB,IAAI,GAAGsG,GAAG,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG1c,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAC8F,CAAC,CAAC9hB,KAAK,GAAG,CAAC,CAAC,GAAGqG,GAAG,CAAA;EACzD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAY;QACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC9hB,KAAK,GAAGqG,GAAG,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,KAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;QACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC7hB,GAAG,GAAGoG,GAAG,CAAA;EACxC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACthB,IAAI,GAAG6F,GAAG,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACrhB,MAAM,GAAG4F,GAAG,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACnhB,MAAM,GAAG0F,GAAG,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,aAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;QAChB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAChb,WAAW,GAAGT,GAAG,CAAA;EAChD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC7mB,QAAQ,GAAG7Q,GAAG,CAAA;EACnE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC9mB,UAAU,GAAG5Q,GAAG,CAAA;EACrE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAc;QACZ,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC39B,OAAO,GAAGiG,GAAG,CAAA;EAClE,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgB;EACd,MAAA,OAAO,IAAI,CAACygB,OAAO,IAAI,IAAI,CAAC1Y,GAAG,CAAC+G,cAAc,EAAE,CAACzH,QAAQ,CAAC,IAAI,CAAC3J,OAAO,CAAC,CAAA;EACzE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,cAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;QACjB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC59B,OAAO,GAAGiG,GAAG,CAAA;EACvE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC/mB,UAAU,GAAG5Q,GAAG,CAAA;EAC1E,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,eAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC9mB,QAAQ,GAAG7Q,GAAG,CAAA;EACxE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAGxL,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,CAACvL,OAAO,GAAGlQ,GAAG,CAAA;EAChE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,OAAO,EAAE;UAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EACzF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,WAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAgB;QACd,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,MAAM,EAAE;UAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EACxF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,cAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;QACjB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,OAAO,EAAE;UAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EAC7F,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;QAChB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,MAAM,EAAE;UAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EAC5F,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,QAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,CAAC,IAAI,CAAC3J,CAAC,GAAGnT,GAAG,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,IAAI,IAAI,CAACygB,OAAO,EAAE;UAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;EACnCG,UAAAA,MAAM,EAAE,OAAO;YACfY,MAAM,EAAE,IAAI,CAACA,MAAAA;EACf,SAAC,CAAC,CAAA;EACJ,OAAC,MAAM;EACL,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;QACnB,IAAI,IAAI,CAACygB,OAAO,EAAE;UAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;EACnCG,UAAAA,MAAM,EAAE,MAAM;YACdY,MAAM,EAAE,IAAI,CAACA,MAAAA;EACf,SAAC,CAAC,CAAA;EACJ,OAAC,MAAM;EACL,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACF,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAP,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAACyvB,WAAW,GAAG,IAAI,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7yB,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;QACZ,IAAI,IAAI,CAACugB,aAAa,EAAE;EACtB,QAAA,OAAO,KAAK,CAAA;EACd,OAAC,MAAM;EACL,QAAA,OACE,IAAI,CAAC5gB,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;EAAEjE,UAAAA,KAAK,EAAE,CAAC;EAAEC,UAAAA,GAAG,EAAE,CAAA;WAAG,CAAC,CAACoC,MAAM,IACnD,IAAI,CAACA,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;EAAEjE,UAAAA,KAAK,EAAE,CAAA;WAAG,CAAC,CAACqC,MAAM,CAAA;EAE/C,OAAA;EACF,KAAA;EAAC,GAAA,EAAA;MAAAI,GAAA,EAAA,cAAA;MAAAC,GAAA,EA6CD,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO2T,UAAU,CAAC,IAAI,CAACtW,IAAI,CAAC,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA0C,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;QAChB,OAAOwW,WAAW,CAAC,IAAI,CAACnZ,IAAI,EAAE,IAAI,CAACC,KAAK,CAAC,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAG1L,UAAU,CAAC,IAAI,CAAC1X,IAAI,CAAC,GAAGsG,GAAG,CAAA;EACnD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAGhM,eAAe,CAAC,IAAI,CAACD,QAAQ,CAAC,GAAG7Q,GAAG,CAAA;EAC5D,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,sBAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAA2B;QACzB,OAAO,IAAI,CAACygB,OAAO,GACfhM,eAAe,CACb,IAAI,CAACkB,aAAa,EAClB,IAAI,CAAC5N,GAAG,CAAC8G,qBAAqB,EAAE,EAChC,IAAI,CAAC9G,GAAG,CAAC6G,cAAc,EACzB,CAAC,GACDjL,GAAG,CAAA;EACT,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAs4BD,SAAAA,GAAAA,GAAwB;QACtB,OAAO4d,UAAkB,CAAA;EAC3B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsB;QACpB,OAAO4d,QAAgB,CAAA;EACzB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;QACjC,OAAO4d,qBAA6B,CAAA;EACtC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;QACrB,OAAO4d,SAAiB,CAAA;EAC1B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;QACrB,OAAO4d,SAAiB,CAAA;EAC1B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,aAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO4d,WAAmB,CAAA;EAC5B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,mBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA+B;QAC7B,OAAO4d,iBAAyB,CAAA;EAClC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,wBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;QAClC,OAAO4d,sBAA8B,CAAA;EACvC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;QACjC,OAAO4d,qBAA6B,CAAA;EACtC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;QAC1B,OAAO4d,cAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,sBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAkC;QAChC,OAAO4d,oBAA4B,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,0BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsC;QACpC,OAAO4d,wBAAgC,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;QAC1B,OAAO4d,cAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,6BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyC;QACvC,OAAO4d,2BAAmC,CAAA;EAC5C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA0B;QACxB,OAAO4d,YAAoB,CAAA;EAC7B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;QACzB,OAAO4d,aAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,4BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;QACtC,OAAO4d,0BAAkC,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;QACzB,OAAO4d,aAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,4BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;QACtC,OAAO4d,0BAAkC,CAAA;EAC3C,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAlW,QAAA,CAAA;EAAA,CAAA,CAnhBAinB,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,EAAA;EAyhBpC,SAASM,gBAAgBA,CAAC8X,WAAW,EAAE;EAC5C,EAAA,IAAIt/B,QAAQ,CAAC25B,UAAU,CAAC2F,WAAW,CAAC,EAAE;EACpC,IAAA,OAAOA,WAAW,CAAA;EACpB,GAAC,MAAM,IAAIA,WAAW,IAAIA,WAAW,CAACra,OAAO,IAAI7c,QAAQ,CAACk3B,WAAW,CAACra,OAAO,EAAE,CAAC,EAAE;EAChF,IAAA,OAAOjlB,QAAQ,CAACy3B,UAAU,CAAC6H,WAAW,CAAC,CAAA;KACxC,MAAM,IAAIA,WAAW,IAAI,OAAOA,WAAW,KAAK,QAAQ,EAAE;EACzD,IAAA,OAAOt/B,QAAQ,CAACmE,UAAU,CAACm7B,WAAW,CAAC,CAAA;EACzC,GAAC,MAAM;EACL,IAAA,MAAM,IAAInqC,oBAAoB,CAAA,6BAAA,GACEmqC,WAAW,GAAa,YAAA,GAAA,OAAOA,WAC/D,CAAC,CAAA;EACH,GAAA;EACF;;AC/hFMC,MAAAA,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/luxon/build/cjs-browser/luxon.js b/node_modules/luxon/build/cjs-browser/luxon.js
new file mode 100644
index 0000000..679b0ee
--- /dev/null
+++ b/node_modules/luxon/build/cjs-browser/luxon.js
@@ -0,0 +1,8739 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+function _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, _toPropertyKey(descriptor.key), descriptor);
+  }
+}
+function _createClass(Constructor, protoProps, staticProps) {
+  if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+  if (staticProps) _defineProperties(Constructor, staticProps);
+  Object.defineProperty(Constructor, "prototype", {
+    writable: false
+  });
+  return Constructor;
+}
+function _extends() {
+  _extends = Object.assign ? Object.assign.bind() : 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);
+}
+function _inheritsLoose(subClass, superClass) {
+  subClass.prototype = Object.create(superClass.prototype);
+  subClass.prototype.constructor = subClass;
+  _setPrototypeOf(subClass, superClass);
+}
+function _getPrototypeOf(o) {
+  _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {
+    return o.__proto__ || Object.getPrototypeOf(o);
+  };
+  return _getPrototypeOf(o);
+}
+function _setPrototypeOf(o, p) {
+  _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {
+    o.__proto__ = p;
+    return o;
+  };
+  return _setPrototypeOf(o, p);
+}
+function _isNativeReflectConstruct() {
+  if (typeof Reflect === "undefined" || !Reflect.construct) return false;
+  if (Reflect.construct.sham) return false;
+  if (typeof Proxy === "function") return true;
+  try {
+    Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+    return true;
+  } catch (e) {
+    return false;
+  }
+}
+function _construct(Parent, args, Class) {
+  if (_isNativeReflectConstruct()) {
+    _construct = Reflect.construct.bind();
+  } else {
+    _construct = function _construct(Parent, args, Class) {
+      var a = [null];
+      a.push.apply(a, args);
+      var Constructor = Function.bind.apply(Parent, a);
+      var instance = new Constructor();
+      if (Class) _setPrototypeOf(instance, Class.prototype);
+      return instance;
+    };
+  }
+  return _construct.apply(null, arguments);
+}
+function _isNativeFunction(fn) {
+  return Function.toString.call(fn).indexOf("[native code]") !== -1;
+}
+function _wrapNativeSuper(Class) {
+  var _cache = typeof Map === "function" ? new Map() : undefined;
+  _wrapNativeSuper = function _wrapNativeSuper(Class) {
+    if (Class === null || !_isNativeFunction(Class)) return Class;
+    if (typeof Class !== "function") {
+      throw new TypeError("Super expression must either be null or a function");
+    }
+    if (typeof _cache !== "undefined") {
+      if (_cache.has(Class)) return _cache.get(Class);
+      _cache.set(Class, Wrapper);
+    }
+    function Wrapper() {
+      return _construct(Class, arguments, _getPrototypeOf(this).constructor);
+    }
+    Wrapper.prototype = Object.create(Class.prototype, {
+      constructor: {
+        value: Wrapper,
+        enumerable: false,
+        writable: true,
+        configurable: true
+      }
+    });
+    return _setPrototypeOf(Wrapper, Class);
+  };
+  return _wrapNativeSuper(Class);
+}
+function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+  return target;
+}
+function _unsupportedIterableToArray(o, minLen) {
+  if (!o) return;
+  if (typeof o === "string") return _arrayLikeToArray(o, minLen);
+  var n = Object.prototype.toString.call(o).slice(8, -1);
+  if (n === "Object" && o.constructor) n = o.constructor.name;
+  if (n === "Map" || n === "Set") return Array.from(o);
+  if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
+}
+function _arrayLikeToArray(arr, len) {
+  if (len == null || len > arr.length) len = arr.length;
+  for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
+  return arr2;
+}
+function _createForOfIteratorHelperLoose(o, allowArrayLike) {
+  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+  if (it) return (it = it.call(o)).next.bind(it);
+  if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+    if (it) o = it;
+    var i = 0;
+    return function () {
+      if (i >= o.length) return {
+        done: true
+      };
+      return {
+        done: false,
+        value: o[i++]
+      };
+    };
+  }
+  throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function _toPrimitive(input, hint) {
+  if (typeof input !== "object" || input === null) return input;
+  var prim = input[Symbol.toPrimitive];
+  if (prim !== undefined) {
+    var res = prim.call(input, hint || "default");
+    if (typeof res !== "object") return res;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return (hint === "string" ? String : Number)(input);
+}
+function _toPropertyKey(arg) {
+  var key = _toPrimitive(arg, "string");
+  return typeof key === "symbol" ? key : String(key);
+}
+
+// these aren't really private, but nor are they really useful to document
+/**
+ * @private
+ */
+var LuxonError = /*#__PURE__*/function (_Error) {
+  _inheritsLoose(LuxonError, _Error);
+  function LuxonError() {
+    return _Error.apply(this, arguments) || this;
+  }
+  return LuxonError;
+}( /*#__PURE__*/_wrapNativeSuper(Error));
+/**
+ * @private
+ */
+var InvalidDateTimeError = /*#__PURE__*/function (_LuxonError) {
+  _inheritsLoose(InvalidDateTimeError, _LuxonError);
+  function InvalidDateTimeError(reason) {
+    return _LuxonError.call(this, "Invalid DateTime: " + reason.toMessage()) || this;
+  }
+  return InvalidDateTimeError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var InvalidIntervalError = /*#__PURE__*/function (_LuxonError2) {
+  _inheritsLoose(InvalidIntervalError, _LuxonError2);
+  function InvalidIntervalError(reason) {
+    return _LuxonError2.call(this, "Invalid Interval: " + reason.toMessage()) || this;
+  }
+  return InvalidIntervalError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var InvalidDurationError = /*#__PURE__*/function (_LuxonError3) {
+  _inheritsLoose(InvalidDurationError, _LuxonError3);
+  function InvalidDurationError(reason) {
+    return _LuxonError3.call(this, "Invalid Duration: " + reason.toMessage()) || this;
+  }
+  return InvalidDurationError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var ConflictingSpecificationError = /*#__PURE__*/function (_LuxonError4) {
+  _inheritsLoose(ConflictingSpecificationError, _LuxonError4);
+  function ConflictingSpecificationError() {
+    return _LuxonError4.apply(this, arguments) || this;
+  }
+  return ConflictingSpecificationError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var InvalidUnitError = /*#__PURE__*/function (_LuxonError5) {
+  _inheritsLoose(InvalidUnitError, _LuxonError5);
+  function InvalidUnitError(unit) {
+    return _LuxonError5.call(this, "Invalid unit " + unit) || this;
+  }
+  return InvalidUnitError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var InvalidArgumentError = /*#__PURE__*/function (_LuxonError6) {
+  _inheritsLoose(InvalidArgumentError, _LuxonError6);
+  function InvalidArgumentError() {
+    return _LuxonError6.apply(this, arguments) || this;
+  }
+  return InvalidArgumentError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+var ZoneIsAbstractError = /*#__PURE__*/function (_LuxonError7) {
+  _inheritsLoose(ZoneIsAbstractError, _LuxonError7);
+  function ZoneIsAbstractError() {
+    return _LuxonError7.call(this, "Zone is an abstract class") || this;
+  }
+  return ZoneIsAbstractError;
+}(LuxonError);
+
+/**
+ * @private
+ */
+
+var n = "numeric",
+  s = "short",
+  l = "long";
+var DATE_SHORT = {
+  year: n,
+  month: n,
+  day: n
+};
+var DATE_MED = {
+  year: n,
+  month: s,
+  day: n
+};
+var DATE_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s
+};
+var DATE_FULL = {
+  year: n,
+  month: l,
+  day: n
+};
+var DATE_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l
+};
+var TIME_SIMPLE = {
+  hour: n,
+  minute: n
+};
+var TIME_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n
+};
+var TIME_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s
+};
+var TIME_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l
+};
+var TIME_24_SIMPLE = {
+  hour: n,
+  minute: n,
+  hourCycle: "h23"
+};
+var TIME_24_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23"
+};
+var TIME_24_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: s
+};
+var TIME_24_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: l
+};
+var DATETIME_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n
+};
+var DATETIME_SHORT_WITH_SECONDS = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n
+};
+var DATETIME_MED = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n
+};
+var DATETIME_MED_WITH_SECONDS = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n
+};
+var DATETIME_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+  hour: n,
+  minute: n
+};
+var DATETIME_FULL = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  timeZoneName: s
+};
+var DATETIME_FULL_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s
+};
+var DATETIME_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  timeZoneName: l
+};
+var DATETIME_HUGE_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l
+};
+
+/**
+ * @interface
+ */
+var Zone = /*#__PURE__*/function () {
+  function Zone() {}
+  var _proto = Zone.prototype;
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  _proto.offsetName = function offsetName(ts, opts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */;
+  _proto.formatOffset = function formatOffset(ts, format) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */;
+  _proto.offset = function offset(ts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @abstract
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */;
+  _proto.equals = function equals(otherZone) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @abstract
+   * @type {boolean}
+   */;
+  _createClass(Zone, [{
+    key: "type",
+    get:
+    /**
+     * The type of zone
+     * @abstract
+     * @type {string}
+     */
+    function get() {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * The name of this zone.
+     * @abstract
+     * @type {string}
+     */
+  }, {
+    key: "name",
+    get: function get() {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * The IANA name of this zone.
+     * Defaults to `name` if not overwritten by a subclass.
+     * @abstract
+     * @type {string}
+     */
+  }, {
+    key: "ianaName",
+    get: function get() {
+      return this.name;
+    }
+
+    /**
+     * Returns whether the offset is known to be fixed for the whole year.
+     * @abstract
+     * @type {boolean}
+     */
+  }, {
+    key: "isUniversal",
+    get: function get() {
+      throw new ZoneIsAbstractError();
+    }
+  }, {
+    key: "isValid",
+    get: function get() {
+      throw new ZoneIsAbstractError();
+    }
+  }]);
+  return Zone;
+}();
+
+var singleton$1 = null;
+
+/**
+ * Represents the local zone for this JavaScript environment.
+ * @implements {Zone}
+ */
+var SystemZone = /*#__PURE__*/function (_Zone) {
+  _inheritsLoose(SystemZone, _Zone);
+  function SystemZone() {
+    return _Zone.apply(this, arguments) || this;
+  }
+  var _proto = SystemZone.prototype;
+  /** @override **/
+  _proto.offsetName = function offsetName(ts, _ref) {
+    var format = _ref.format,
+      locale = _ref.locale;
+    return parseZoneInfo(ts, format, locale);
+  }
+
+  /** @override **/;
+  _proto.formatOffset = function formatOffset$1(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /** @override **/;
+  _proto.offset = function offset(ts) {
+    return -new Date(ts).getTimezoneOffset();
+  }
+
+  /** @override **/;
+  _proto.equals = function equals(otherZone) {
+    return otherZone.type === "system";
+  }
+
+  /** @override **/;
+  _createClass(SystemZone, [{
+    key: "type",
+    get: /** @override **/
+    function get() {
+      return "system";
+    }
+
+    /** @override **/
+  }, {
+    key: "name",
+    get: function get() {
+      return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+    }
+
+    /** @override **/
+  }, {
+    key: "isUniversal",
+    get: function get() {
+      return false;
+    }
+  }, {
+    key: "isValid",
+    get: function get() {
+      return true;
+    }
+  }], [{
+    key: "instance",
+    get:
+    /**
+     * Get a singleton instance of the local zone
+     * @return {SystemZone}
+     */
+    function get() {
+      if (singleton$1 === null) {
+        singleton$1 = new SystemZone();
+      }
+      return singleton$1;
+    }
+  }]);
+  return SystemZone;
+}(Zone);
+
+var dtfCache = new Map();
+function makeDTF(zoneName) {
+  var dtf = dtfCache.get(zoneName);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat("en-US", {
+      hour12: false,
+      timeZone: zoneName,
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+      second: "2-digit",
+      era: "short"
+    });
+    dtfCache.set(zoneName, dtf);
+  }
+  return dtf;
+}
+var typeToPos = {
+  year: 0,
+  month: 1,
+  day: 2,
+  era: 3,
+  hour: 4,
+  minute: 5,
+  second: 6
+};
+function hackyOffset(dtf, date) {
+  var formatted = dtf.format(date).replace(/\u200E/g, ""),
+    parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+    fMonth = parsed[1],
+    fDay = parsed[2],
+    fYear = parsed[3],
+    fadOrBc = parsed[4],
+    fHour = parsed[5],
+    fMinute = parsed[6],
+    fSecond = parsed[7];
+  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+}
+function partsOffset(dtf, date) {
+  var formatted = dtf.formatToParts(date);
+  var filled = [];
+  for (var i = 0; i < formatted.length; i++) {
+    var _formatted$i = formatted[i],
+      type = _formatted$i.type,
+      value = _formatted$i.value;
+    var pos = typeToPos[type];
+    if (type === "era") {
+      filled[pos] = value;
+    } else if (!isUndefined(pos)) {
+      filled[pos] = parseInt(value, 10);
+    }
+  }
+  return filled;
+}
+var ianaZoneCache = new Map();
+/**
+ * A zone identified by an IANA identifier, like America/New_York
+ * @implements {Zone}
+ */
+var IANAZone = /*#__PURE__*/function (_Zone) {
+  _inheritsLoose(IANAZone, _Zone);
+  /**
+   * @param {string} name - Zone name
+   * @return {IANAZone}
+   */
+  IANAZone.create = function create(name) {
+    var zone = ianaZoneCache.get(name);
+    if (zone === undefined) {
+      ianaZoneCache.set(name, zone = new IANAZone(name));
+    }
+    return zone;
+  }
+
+  /**
+   * Reset local caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */;
+  IANAZone.resetCache = function resetCache() {
+    ianaZoneCache.clear();
+    dtfCache.clear();
+  }
+
+  /**
+   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+   * @param {string} s - The string to check validity on
+   * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+   * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+   * @return {boolean}
+   */;
+  IANAZone.isValidSpecifier = function isValidSpecifier(s) {
+    return this.isValidZone(s);
+  }
+
+  /**
+   * Returns whether the provided string identifies a real zone
+   * @param {string} zone - The string to check
+   * @example IANAZone.isValidZone("America/New_York") //=> true
+   * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+   * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+   * @return {boolean}
+   */;
+  IANAZone.isValidZone = function isValidZone(zone) {
+    if (!zone) {
+      return false;
+    }
+    try {
+      new Intl.DateTimeFormat("en-US", {
+        timeZone: zone
+      }).format();
+      return true;
+    } catch (e) {
+      return false;
+    }
+  };
+  function IANAZone(name) {
+    var _this;
+    _this = _Zone.call(this) || this;
+    /** @private **/
+    _this.zoneName = name;
+    /** @private **/
+    _this.valid = IANAZone.isValidZone(name);
+    return _this;
+  }
+
+  /**
+   * The type of zone. `iana` for all instances of `IANAZone`.
+   * @override
+   * @type {string}
+   */
+  var _proto = IANAZone.prototype;
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  _proto.offsetName = function offsetName(ts, _ref) {
+    var format = _ref.format,
+      locale = _ref.locale;
+    return parseZoneInfo(ts, format, locale, this.name);
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */;
+  _proto.formatOffset = function formatOffset$1(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */;
+  _proto.offset = function offset(ts) {
+    if (!this.valid) return NaN;
+    var date = new Date(ts);
+    if (isNaN(date)) return NaN;
+    var dtf = makeDTF(this.name);
+    var _ref2 = dtf.formatToParts ? partsOffset(dtf, date) : hackyOffset(dtf, date),
+      year = _ref2[0],
+      month = _ref2[1],
+      day = _ref2[2],
+      adOrBc = _ref2[3],
+      hour = _ref2[4],
+      minute = _ref2[5],
+      second = _ref2[6];
+    if (adOrBc === "BC") {
+      year = -Math.abs(year) + 1;
+    }
+
+    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+    var adjustedHour = hour === 24 ? 0 : hour;
+    var asUTC = objToLocalTS({
+      year: year,
+      month: month,
+      day: day,
+      hour: adjustedHour,
+      minute: minute,
+      second: second,
+      millisecond: 0
+    });
+    var asTS = +date;
+    var over = asTS % 1000;
+    asTS -= over >= 0 ? over : 1000 + over;
+    return (asUTC - asTS) / (60 * 1000);
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */;
+  _proto.equals = function equals(otherZone) {
+    return otherZone.type === "iana" && otherZone.name === this.name;
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @override
+   * @type {boolean}
+   */;
+  _createClass(IANAZone, [{
+    key: "type",
+    get: function get() {
+      return "iana";
+    }
+
+    /**
+     * The name of this zone (i.e. the IANA zone name).
+     * @override
+     * @type {string}
+     */
+  }, {
+    key: "name",
+    get: function get() {
+      return this.zoneName;
+    }
+
+    /**
+     * Returns whether the offset is known to be fixed for the whole year:
+     * Always returns false for all IANA zones.
+     * @override
+     * @type {boolean}
+     */
+  }, {
+    key: "isUniversal",
+    get: function get() {
+      return false;
+    }
+  }, {
+    key: "isValid",
+    get: function get() {
+      return this.valid;
+    }
+  }]);
+  return IANAZone;
+}(Zone);
+
+var _excluded = ["base"],
+  _excluded2 = ["padTo", "floor"];
+
+// todo - remap caching
+
+var intlLFCache = {};
+function getCachedLF(locString, opts) {
+  if (opts === void 0) {
+    opts = {};
+  }
+  var key = JSON.stringify([locString, opts]);
+  var dtf = intlLFCache[key];
+  if (!dtf) {
+    dtf = new Intl.ListFormat(locString, opts);
+    intlLFCache[key] = dtf;
+  }
+  return dtf;
+}
+var intlDTCache = new Map();
+function getCachedDTF(locString, opts) {
+  if (opts === void 0) {
+    opts = {};
+  }
+  var key = JSON.stringify([locString, opts]);
+  var dtf = intlDTCache.get(key);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat(locString, opts);
+    intlDTCache.set(key, dtf);
+  }
+  return dtf;
+}
+var intlNumCache = new Map();
+function getCachedINF(locString, opts) {
+  if (opts === void 0) {
+    opts = {};
+  }
+  var key = JSON.stringify([locString, opts]);
+  var inf = intlNumCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.NumberFormat(locString, opts);
+    intlNumCache.set(key, inf);
+  }
+  return inf;
+}
+var intlRelCache = new Map();
+function getCachedRTF(locString, opts) {
+  if (opts === void 0) {
+    opts = {};
+  }
+  var _opts = opts;
+    _opts.base;
+    var cacheKeyOpts = _objectWithoutPropertiesLoose(_opts, _excluded); // exclude `base` from the options
+  var key = JSON.stringify([locString, cacheKeyOpts]);
+  var inf = intlRelCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.RelativeTimeFormat(locString, opts);
+    intlRelCache.set(key, inf);
+  }
+  return inf;
+}
+var sysLocaleCache = null;
+function systemLocale() {
+  if (sysLocaleCache) {
+    return sysLocaleCache;
+  } else {
+    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+    return sysLocaleCache;
+  }
+}
+var intlResolvedOptionsCache = new Map();
+function getCachedIntResolvedOptions(locString) {
+  var opts = intlResolvedOptionsCache.get(locString);
+  if (opts === undefined) {
+    opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+    intlResolvedOptionsCache.set(locString, opts);
+  }
+  return opts;
+}
+var weekInfoCache = new Map();
+function getCachedWeekInfo(locString) {
+  var data = weekInfoCache.get(locString);
+  if (!data) {
+    var locale = new Intl.Locale(locString);
+    // browsers currently implement this as a property, but spec says it should be a getter function
+    data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+    if (!("minimalDays" in data)) {
+      data = _extends({}, fallbackWeekSettings, data);
+    }
+    weekInfoCache.set(locString, data);
+  }
+  return data;
+}
+function parseLocaleString(localeStr) {
+  // I really want to avoid writing a BCP 47 parser
+  // see, e.g. https://github.com/wooorm/bcp-47
+  // Instead, we'll do this:
+
+  // a) if the string has no -u extensions, just leave it alone
+  // b) if it does, use Intl to resolve everything
+  // c) if Intl fails, try again without the -u
+
+  // private subtags and unicode subtags have ordering requirements,
+  // and we're not properly parsing this, so just strip out the
+  // private ones if they exist.
+  var xIndex = localeStr.indexOf("-x-");
+  if (xIndex !== -1) {
+    localeStr = localeStr.substring(0, xIndex);
+  }
+  var uIndex = localeStr.indexOf("-u-");
+  if (uIndex === -1) {
+    return [localeStr];
+  } else {
+    var options;
+    var selectedStr;
+    try {
+      options = getCachedDTF(localeStr).resolvedOptions();
+      selectedStr = localeStr;
+    } catch (e) {
+      var smaller = localeStr.substring(0, uIndex);
+      options = getCachedDTF(smaller).resolvedOptions();
+      selectedStr = smaller;
+    }
+    var _options = options,
+      numberingSystem = _options.numberingSystem,
+      calendar = _options.calendar;
+    return [selectedStr, numberingSystem, calendar];
+  }
+}
+function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+  if (outputCalendar || numberingSystem) {
+    if (!localeStr.includes("-u-")) {
+      localeStr += "-u";
+    }
+    if (outputCalendar) {
+      localeStr += "-ca-" + outputCalendar;
+    }
+    if (numberingSystem) {
+      localeStr += "-nu-" + numberingSystem;
+    }
+    return localeStr;
+  } else {
+    return localeStr;
+  }
+}
+function mapMonths(f) {
+  var ms = [];
+  for (var i = 1; i <= 12; i++) {
+    var dt = DateTime.utc(2009, i, 1);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+function mapWeekdays(f) {
+  var ms = [];
+  for (var i = 1; i <= 7; i++) {
+    var dt = DateTime.utc(2016, 11, 13 + i);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+function listStuff(loc, length, englishFn, intlFn) {
+  var mode = loc.listingMode();
+  if (mode === "error") {
+    return null;
+  } else if (mode === "en") {
+    return englishFn(length);
+  } else {
+    return intlFn(length);
+  }
+}
+function supportsFastNumbers(loc) {
+  if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+    return false;
+  } else {
+    return loc.numberingSystem === "latn" || !loc.locale || loc.locale.startsWith("en") || getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn";
+  }
+}
+
+/**
+ * @private
+ */
+var PolyNumberFormatter = /*#__PURE__*/function () {
+  function PolyNumberFormatter(intl, forceSimple, opts) {
+    this.padTo = opts.padTo || 0;
+    this.floor = opts.floor || false;
+    opts.padTo;
+      opts.floor;
+      var otherOpts = _objectWithoutPropertiesLoose(opts, _excluded2);
+    if (!forceSimple || Object.keys(otherOpts).length > 0) {
+      var intlOpts = _extends({
+        useGrouping: false
+      }, opts);
+      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+      this.inf = getCachedINF(intl, intlOpts);
+    }
+  }
+  var _proto = PolyNumberFormatter.prototype;
+  _proto.format = function format(i) {
+    if (this.inf) {
+      var fixed = this.floor ? Math.floor(i) : i;
+      return this.inf.format(fixed);
+    } else {
+      // to match the browser's numberformatter defaults
+      var _fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+      return padStart(_fixed, this.padTo);
+    }
+  };
+  return PolyNumberFormatter;
+}();
+/**
+ * @private
+ */
+var PolyDateFormatter = /*#__PURE__*/function () {
+  function PolyDateFormatter(dt, intl, opts) {
+    this.opts = opts;
+    this.originalZone = undefined;
+    var z = undefined;
+    if (this.opts.timeZone) {
+      // Don't apply any workarounds if a timeZone is explicitly provided in opts
+      this.dt = dt;
+    } else if (dt.zone.type === "fixed") {
+      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+      // That is why fixed-offset TZ is set to that unless it is:
+      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+      // 2. Unsupported by the browser:
+      //    - some do not support Etc/
+      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+      var gmtOffset = -1 * (dt.offset / 60);
+      var offsetZ = gmtOffset >= 0 ? "Etc/GMT+" + gmtOffset : "Etc/GMT" + gmtOffset;
+      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+        z = offsetZ;
+        this.dt = dt;
+      } else {
+        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+        // we manually apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({
+          minutes: dt.offset
+        });
+        this.originalZone = dt.zone;
+      }
+    } else if (dt.zone.type === "system") {
+      this.dt = dt;
+    } else if (dt.zone.type === "iana") {
+      this.dt = dt;
+      z = dt.zone.name;
+    } else {
+      // Custom zones can have any offset / offsetName so we just manually
+      // apply the offset and substitute the zone as needed.
+      z = "UTC";
+      this.dt = dt.setZone("UTC").plus({
+        minutes: dt.offset
+      });
+      this.originalZone = dt.zone;
+    }
+    var intlOpts = _extends({}, this.opts);
+    intlOpts.timeZone = intlOpts.timeZone || z;
+    this.dtf = getCachedDTF(intl, intlOpts);
+  }
+  var _proto2 = PolyDateFormatter.prototype;
+  _proto2.format = function format() {
+    if (this.originalZone) {
+      // If we have to substitute in the actual zone name, we have to use
+      // formatToParts so that the timezone can be replaced.
+      return this.formatToParts().map(function (_ref) {
+        var value = _ref.value;
+        return value;
+      }).join("");
+    }
+    return this.dtf.format(this.dt.toJSDate());
+  };
+  _proto2.formatToParts = function formatToParts() {
+    var _this = this;
+    var parts = this.dtf.formatToParts(this.dt.toJSDate());
+    if (this.originalZone) {
+      return parts.map(function (part) {
+        if (part.type === "timeZoneName") {
+          var offsetName = _this.originalZone.offsetName(_this.dt.ts, {
+            locale: _this.dt.locale,
+            format: _this.opts.timeZoneName
+          });
+          return _extends({}, part, {
+            value: offsetName
+          });
+        } else {
+          return part;
+        }
+      });
+    }
+    return parts;
+  };
+  _proto2.resolvedOptions = function resolvedOptions() {
+    return this.dtf.resolvedOptions();
+  };
+  return PolyDateFormatter;
+}();
+/**
+ * @private
+ */
+var PolyRelFormatter = /*#__PURE__*/function () {
+  function PolyRelFormatter(intl, isEnglish, opts) {
+    this.opts = _extends({
+      style: "long"
+    }, opts);
+    if (!isEnglish && hasRelative()) {
+      this.rtf = getCachedRTF(intl, opts);
+    }
+  }
+  var _proto3 = PolyRelFormatter.prototype;
+  _proto3.format = function format(count, unit) {
+    if (this.rtf) {
+      return this.rtf.format(count, unit);
+    } else {
+      return formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+    }
+  };
+  _proto3.formatToParts = function formatToParts(count, unit) {
+    if (this.rtf) {
+      return this.rtf.formatToParts(count, unit);
+    } else {
+      return [];
+    }
+  };
+  return PolyRelFormatter;
+}();
+var fallbackWeekSettings = {
+  firstDay: 1,
+  minimalDays: 4,
+  weekend: [6, 7]
+};
+
+/**
+ * @private
+ */
+var Locale = /*#__PURE__*/function () {
+  Locale.fromOpts = function fromOpts(opts) {
+    return Locale.create(opts.locale, opts.numberingSystem, opts.outputCalendar, opts.weekSettings, opts.defaultToEN);
+  };
+  Locale.create = function create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN) {
+    if (defaultToEN === void 0) {
+      defaultToEN = false;
+    }
+    var specifiedLocale = locale || Settings.defaultLocale;
+    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+    var localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+    var numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+    var outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+    var weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+  };
+  Locale.resetCache = function resetCache() {
+    sysLocaleCache = null;
+    intlDTCache.clear();
+    intlNumCache.clear();
+    intlRelCache.clear();
+    intlResolvedOptionsCache.clear();
+    weekInfoCache.clear();
+  };
+  Locale.fromObject = function fromObject(_temp) {
+    var _ref2 = _temp === void 0 ? {} : _temp,
+      locale = _ref2.locale,
+      numberingSystem = _ref2.numberingSystem,
+      outputCalendar = _ref2.outputCalendar,
+      weekSettings = _ref2.weekSettings;
+    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+  };
+  function Locale(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+    var _parseLocaleString = parseLocaleString(locale),
+      parsedLocale = _parseLocaleString[0],
+      parsedNumberingSystem = _parseLocaleString[1],
+      parsedOutputCalendar = _parseLocaleString[2];
+    this.locale = parsedLocale;
+    this.numberingSystem = numbering || parsedNumberingSystem || null;
+    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+    this.weekSettings = weekSettings;
+    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+    this.weekdaysCache = {
+      format: {},
+      standalone: {}
+    };
+    this.monthsCache = {
+      format: {},
+      standalone: {}
+    };
+    this.meridiemCache = null;
+    this.eraCache = {};
+    this.specifiedLocale = specifiedLocale;
+    this.fastNumbersCached = null;
+  }
+  var _proto4 = Locale.prototype;
+  _proto4.listingMode = function listingMode() {
+    var isActuallyEn = this.isEnglish();
+    var hasNoWeirdness = (this.numberingSystem === null || this.numberingSystem === "latn") && (this.outputCalendar === null || this.outputCalendar === "gregory");
+    return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+  };
+  _proto4.clone = function clone(alts) {
+    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+      return this;
+    } else {
+      return Locale.create(alts.locale || this.specifiedLocale, alts.numberingSystem || this.numberingSystem, alts.outputCalendar || this.outputCalendar, validateWeekSettings(alts.weekSettings) || this.weekSettings, alts.defaultToEN || false);
+    }
+  };
+  _proto4.redefaultToEN = function redefaultToEN(alts) {
+    if (alts === void 0) {
+      alts = {};
+    }
+    return this.clone(_extends({}, alts, {
+      defaultToEN: true
+    }));
+  };
+  _proto4.redefaultToSystem = function redefaultToSystem(alts) {
+    if (alts === void 0) {
+      alts = {};
+    }
+    return this.clone(_extends({}, alts, {
+      defaultToEN: false
+    }));
+  };
+  _proto4.months = function months$1(length, format) {
+    var _this2 = this;
+    if (format === void 0) {
+      format = false;
+    }
+    return listStuff(this, length, months, function () {
+      // Workaround for "ja" locale: formatToParts does not label all parts of the month
+      // as "month" and for this locale there is no difference between "format" and "non-format".
+      // As such, just use format() instead of formatToParts() and take the whole string
+      var monthSpecialCase = _this2.intl === "ja" || _this2.intl.startsWith("ja-");
+      format &= !monthSpecialCase;
+      var intl = format ? {
+          month: length,
+          day: "numeric"
+        } : {
+          month: length
+        },
+        formatStr = format ? "format" : "standalone";
+      if (!_this2.monthsCache[formatStr][length]) {
+        var mapper = !monthSpecialCase ? function (dt) {
+          return _this2.extract(dt, intl, "month");
+        } : function (dt) {
+          return _this2.dtFormatter(dt, intl).format();
+        };
+        _this2.monthsCache[formatStr][length] = mapMonths(mapper);
+      }
+      return _this2.monthsCache[formatStr][length];
+    });
+  };
+  _proto4.weekdays = function weekdays$1(length, format) {
+    var _this3 = this;
+    if (format === void 0) {
+      format = false;
+    }
+    return listStuff(this, length, weekdays, function () {
+      var intl = format ? {
+          weekday: length,
+          year: "numeric",
+          month: "long",
+          day: "numeric"
+        } : {
+          weekday: length
+        },
+        formatStr = format ? "format" : "standalone";
+      if (!_this3.weekdaysCache[formatStr][length]) {
+        _this3.weekdaysCache[formatStr][length] = mapWeekdays(function (dt) {
+          return _this3.extract(dt, intl, "weekday");
+        });
+      }
+      return _this3.weekdaysCache[formatStr][length];
+    });
+  };
+  _proto4.meridiems = function meridiems$1() {
+    var _this4 = this;
+    return listStuff(this, undefined, function () {
+      return meridiems;
+    }, function () {
+      // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+      // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+      if (!_this4.meridiemCache) {
+        var intl = {
+          hour: "numeric",
+          hourCycle: "h12"
+        };
+        _this4.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(function (dt) {
+          return _this4.extract(dt, intl, "dayperiod");
+        });
+      }
+      return _this4.meridiemCache;
+    });
+  };
+  _proto4.eras = function eras$1(length) {
+    var _this5 = this;
+    return listStuff(this, length, eras, function () {
+      var intl = {
+        era: length
+      };
+
+      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+      // to definitely enumerate them.
+      if (!_this5.eraCache[length]) {
+        _this5.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map(function (dt) {
+          return _this5.extract(dt, intl, "era");
+        });
+      }
+      return _this5.eraCache[length];
+    });
+  };
+  _proto4.extract = function extract(dt, intlOpts, field) {
+    var df = this.dtFormatter(dt, intlOpts),
+      results = df.formatToParts(),
+      matching = results.find(function (m) {
+        return m.type.toLowerCase() === field;
+      });
+    return matching ? matching.value : null;
+  };
+  _proto4.numberFormatter = function numberFormatter(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+    // (in contrast, the rest of the condition is used heavily)
+    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+  };
+  _proto4.dtFormatter = function dtFormatter(dt, intlOpts) {
+    if (intlOpts === void 0) {
+      intlOpts = {};
+    }
+    return new PolyDateFormatter(dt, this.intl, intlOpts);
+  };
+  _proto4.relFormatter = function relFormatter(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+  };
+  _proto4.listFormatter = function listFormatter(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return getCachedLF(this.intl, opts);
+  };
+  _proto4.isEnglish = function isEnglish() {
+    return this.locale === "en" || this.locale.toLowerCase() === "en-us" || getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us");
+  };
+  _proto4.getWeekSettings = function getWeekSettings() {
+    if (this.weekSettings) {
+      return this.weekSettings;
+    } else if (!hasLocaleWeekInfo()) {
+      return fallbackWeekSettings;
+    } else {
+      return getCachedWeekInfo(this.locale);
+    }
+  };
+  _proto4.getStartOfWeek = function getStartOfWeek() {
+    return this.getWeekSettings().firstDay;
+  };
+  _proto4.getMinDaysInFirstWeek = function getMinDaysInFirstWeek() {
+    return this.getWeekSettings().minimalDays;
+  };
+  _proto4.getWeekendDays = function getWeekendDays() {
+    return this.getWeekSettings().weekend;
+  };
+  _proto4.equals = function equals(other) {
+    return this.locale === other.locale && this.numberingSystem === other.numberingSystem && this.outputCalendar === other.outputCalendar;
+  };
+  _proto4.toString = function toString() {
+    return "Locale(" + this.locale + ", " + this.numberingSystem + ", " + this.outputCalendar + ")";
+  };
+  _createClass(Locale, [{
+    key: "fastNumbers",
+    get: function get() {
+      if (this.fastNumbersCached == null) {
+        this.fastNumbersCached = supportsFastNumbers(this);
+      }
+      return this.fastNumbersCached;
+    }
+  }]);
+  return Locale;
+}();
+
+var singleton = null;
+
+/**
+ * A zone with a fixed offset (meaning no DST)
+ * @implements {Zone}
+ */
+var FixedOffsetZone = /*#__PURE__*/function (_Zone) {
+  _inheritsLoose(FixedOffsetZone, _Zone);
+  /**
+   * Get an instance with a specified offset
+   * @param {number} offset - The offset in minutes
+   * @return {FixedOffsetZone}
+   */
+  FixedOffsetZone.instance = function instance(offset) {
+    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+  }
+
+  /**
+   * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+   * @param {string} s - The offset string to parse
+   * @example FixedOffsetZone.parseSpecifier("UTC+6")
+   * @example FixedOffsetZone.parseSpecifier("UTC+06")
+   * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+   * @return {FixedOffsetZone}
+   */;
+  FixedOffsetZone.parseSpecifier = function parseSpecifier(s) {
+    if (s) {
+      var r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+      if (r) {
+        return new FixedOffsetZone(signedOffset(r[1], r[2]));
+      }
+    }
+    return null;
+  };
+  function FixedOffsetZone(offset) {
+    var _this;
+    _this = _Zone.call(this) || this;
+    /** @private **/
+    _this.fixed = offset;
+    return _this;
+  }
+
+  /**
+   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+   * @override
+   * @type {string}
+   */
+  var _proto = FixedOffsetZone.prototype;
+  /**
+   * Returns the offset's common name at the specified timestamp.
+   *
+   * For fixed offset zones this equals to the zone name.
+   * @override
+   */
+  _proto.offsetName = function offsetName() {
+    return this.name;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */;
+  _proto.formatOffset = function formatOffset$1(ts, format) {
+    return formatOffset(this.fixed, format);
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns true for all fixed offset zones.
+   * @override
+   * @type {boolean}
+   */;
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   *
+   * For fixed offset zones, this is constant and does not depend on a timestamp.
+   * @override
+   * @return {number}
+   */
+  _proto.offset = function offset() {
+    return this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */;
+  _proto.equals = function equals(otherZone) {
+    return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is valid:
+   * All fixed offset zones are valid.
+   * @override
+   * @type {boolean}
+   */;
+  _createClass(FixedOffsetZone, [{
+    key: "type",
+    get: function get() {
+      return "fixed";
+    }
+
+    /**
+     * The name of this zone.
+     * All fixed zones' names always start with "UTC" (plus optional offset)
+     * @override
+     * @type {string}
+     */
+  }, {
+    key: "name",
+    get: function get() {
+      return this.fixed === 0 ? "UTC" : "UTC" + formatOffset(this.fixed, "narrow");
+    }
+
+    /**
+     * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+     *
+     * @override
+     * @type {string}
+     */
+  }, {
+    key: "ianaName",
+    get: function get() {
+      if (this.fixed === 0) {
+        return "Etc/UTC";
+      } else {
+        return "Etc/GMT" + formatOffset(-this.fixed, "narrow");
+      }
+    }
+  }, {
+    key: "isUniversal",
+    get: function get() {
+      return true;
+    }
+  }, {
+    key: "isValid",
+    get: function get() {
+      return true;
+    }
+  }], [{
+    key: "utcInstance",
+    get:
+    /**
+     * Get a singleton instance of UTC
+     * @return {FixedOffsetZone}
+     */
+    function get() {
+      if (singleton === null) {
+        singleton = new FixedOffsetZone(0);
+      }
+      return singleton;
+    }
+  }]);
+  return FixedOffsetZone;
+}(Zone);
+
+/**
+ * A zone that failed to parse. You should never need to instantiate this.
+ * @implements {Zone}
+ */
+var InvalidZone = /*#__PURE__*/function (_Zone) {
+  _inheritsLoose(InvalidZone, _Zone);
+  function InvalidZone(zoneName) {
+    var _this;
+    _this = _Zone.call(this) || this;
+    /**  @private */
+    _this.zoneName = zoneName;
+    return _this;
+  }
+
+  /** @override **/
+  var _proto = InvalidZone.prototype;
+  /** @override **/
+  _proto.offsetName = function offsetName() {
+    return null;
+  }
+
+  /** @override **/;
+  _proto.formatOffset = function formatOffset() {
+    return "";
+  }
+
+  /** @override **/;
+  _proto.offset = function offset() {
+    return NaN;
+  }
+
+  /** @override **/;
+  _proto.equals = function equals() {
+    return false;
+  }
+
+  /** @override **/;
+  _createClass(InvalidZone, [{
+    key: "type",
+    get: function get() {
+      return "invalid";
+    }
+
+    /** @override **/
+  }, {
+    key: "name",
+    get: function get() {
+      return this.zoneName;
+    }
+
+    /** @override **/
+  }, {
+    key: "isUniversal",
+    get: function get() {
+      return false;
+    }
+  }, {
+    key: "isValid",
+    get: function get() {
+      return false;
+    }
+  }]);
+  return InvalidZone;
+}(Zone);
+
+/**
+ * @private
+ */
+function normalizeZone(input, defaultZone) {
+  if (isUndefined(input) || input === null) {
+    return defaultZone;
+  } else if (input instanceof Zone) {
+    return input;
+  } else if (isString(input)) {
+    var lowered = input.toLowerCase();
+    if (lowered === "default") return defaultZone;else if (lowered === "local" || lowered === "system") return SystemZone.instance;else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+  } else if (isNumber(input)) {
+    return FixedOffsetZone.instance(input);
+  } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+    // This is dumb, but the instanceof check above doesn't seem to really work
+    // so we're duck checking it
+    return input;
+  } else {
+    return new InvalidZone(input);
+  }
+}
+
+var numberingSystems = {
+  arab: "[\u0660-\u0669]",
+  arabext: "[\u06F0-\u06F9]",
+  bali: "[\u1B50-\u1B59]",
+  beng: "[\u09E6-\u09EF]",
+  deva: "[\u0966-\u096F]",
+  fullwide: "[\uFF10-\uFF19]",
+  gujr: "[\u0AE6-\u0AEF]",
+  hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+  khmr: "[\u17E0-\u17E9]",
+  knda: "[\u0CE6-\u0CEF]",
+  laoo: "[\u0ED0-\u0ED9]",
+  limb: "[\u1946-\u194F]",
+  mlym: "[\u0D66-\u0D6F]",
+  mong: "[\u1810-\u1819]",
+  mymr: "[\u1040-\u1049]",
+  orya: "[\u0B66-\u0B6F]",
+  tamldec: "[\u0BE6-\u0BEF]",
+  telu: "[\u0C66-\u0C6F]",
+  thai: "[\u0E50-\u0E59]",
+  tibt: "[\u0F20-\u0F29]",
+  latn: "\\d"
+};
+var numberingSystemsUTF16 = {
+  arab: [1632, 1641],
+  arabext: [1776, 1785],
+  bali: [6992, 7001],
+  beng: [2534, 2543],
+  deva: [2406, 2415],
+  fullwide: [65296, 65303],
+  gujr: [2790, 2799],
+  khmr: [6112, 6121],
+  knda: [3302, 3311],
+  laoo: [3792, 3801],
+  limb: [6470, 6479],
+  mlym: [3430, 3439],
+  mong: [6160, 6169],
+  mymr: [4160, 4169],
+  orya: [2918, 2927],
+  tamldec: [3046, 3055],
+  telu: [3174, 3183],
+  thai: [3664, 3673],
+  tibt: [3872, 3881]
+};
+var hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+function parseDigits(str) {
+  var value = parseInt(str, 10);
+  if (isNaN(value)) {
+    value = "";
+    for (var i = 0; i < str.length; i++) {
+      var code = str.charCodeAt(i);
+      if (str[i].search(numberingSystems.hanidec) !== -1) {
+        value += hanidecChars.indexOf(str[i]);
+      } else {
+        for (var key in numberingSystemsUTF16) {
+          var _numberingSystemsUTF = numberingSystemsUTF16[key],
+            min = _numberingSystemsUTF[0],
+            max = _numberingSystemsUTF[1];
+          if (code >= min && code <= max) {
+            value += code - min;
+          }
+        }
+      }
+    }
+    return parseInt(value, 10);
+  } else {
+    return value;
+  }
+}
+
+// cache of {numberingSystem: {append: regex}}
+var digitRegexCache = new Map();
+function resetDigitRegexCache() {
+  digitRegexCache.clear();
+}
+function digitRegex(_ref, append) {
+  var numberingSystem = _ref.numberingSystem;
+  if (append === void 0) {
+    append = "";
+  }
+  var ns = numberingSystem || "latn";
+  var appendCache = digitRegexCache.get(ns);
+  if (appendCache === undefined) {
+    appendCache = new Map();
+    digitRegexCache.set(ns, appendCache);
+  }
+  var regex = appendCache.get(append);
+  if (regex === undefined) {
+    regex = new RegExp("" + numberingSystems[ns] + append);
+    appendCache.set(append, regex);
+  }
+  return regex;
+}
+
+var now = function now() {
+    return Date.now();
+  },
+  defaultZone = "system",
+  defaultLocale = null,
+  defaultNumberingSystem = null,
+  defaultOutputCalendar = null,
+  twoDigitCutoffYear = 60,
+  throwOnInvalid,
+  defaultWeekSettings = null;
+
+/**
+ * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+ */
+var Settings = /*#__PURE__*/function () {
+  function Settings() {}
+  /**
+   * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  Settings.resetCaches = function resetCaches() {
+    Locale.resetCache();
+    IANAZone.resetCache();
+    DateTime.resetCache();
+    resetDigitRegexCache();
+  };
+  _createClass(Settings, null, [{
+    key: "now",
+    get:
+    /**
+     * Get the callback for returning the current timestamp.
+     * @type {function}
+     */
+    function get() {
+      return now;
+    }
+
+    /**
+     * Set the callback for returning the current timestamp.
+     * The function should return a number, which will be interpreted as an Epoch millisecond count
+     * @type {function}
+     * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+     * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+     */,
+    set: function set(n) {
+      now = n;
+    }
+
+    /**
+     * Set the default time zone to create DateTimes in. Does not affect existing instances.
+     * Use the value "system" to reset this value to the system's time zone.
+     * @type {string}
+     */
+  }, {
+    key: "defaultZone",
+    get:
+    /**
+     * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+     * The default value is the system's time zone (the one set on the machine that runs this code).
+     * @type {Zone}
+     */
+    function get() {
+      return normalizeZone(defaultZone, SystemZone.instance);
+    }
+
+    /**
+     * Get the default locale to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */,
+    set: function set(zone) {
+      defaultZone = zone;
+    }
+  }, {
+    key: "defaultLocale",
+    get: function get() {
+      return defaultLocale;
+    }
+
+    /**
+     * Set the default locale to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */,
+    set: function set(locale) {
+      defaultLocale = locale;
+    }
+
+    /**
+     * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */
+  }, {
+    key: "defaultNumberingSystem",
+    get: function get() {
+      return defaultNumberingSystem;
+    }
+
+    /**
+     * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */,
+    set: function set(numberingSystem) {
+      defaultNumberingSystem = numberingSystem;
+    }
+
+    /**
+     * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */
+  }, {
+    key: "defaultOutputCalendar",
+    get: function get() {
+      return defaultOutputCalendar;
+    }
+
+    /**
+     * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+     * @type {string}
+     */,
+    set: function set(outputCalendar) {
+      defaultOutputCalendar = outputCalendar;
+    }
+
+    /**
+     * @typedef {Object} WeekSettings
+     * @property {number} firstDay
+     * @property {number} minimalDays
+     * @property {number[]} weekend
+     */
+
+    /**
+     * @return {WeekSettings|null}
+     */
+  }, {
+    key: "defaultWeekSettings",
+    get: function get() {
+      return defaultWeekSettings;
+    }
+
+    /**
+     * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+     * how many days are required in the first week of a year.
+     * Does not affect existing instances.
+     *
+     * @param {WeekSettings|null} weekSettings
+     */,
+    set: function set(weekSettings) {
+      defaultWeekSettings = validateWeekSettings(weekSettings);
+    }
+
+    /**
+     * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+     * @type {number}
+     */
+  }, {
+    key: "twoDigitCutoffYear",
+    get: function get() {
+      return twoDigitCutoffYear;
+    }
+
+    /**
+     * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+     * @type {number}
+     * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+     * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+     * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+     * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+     * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+     */,
+    set: function set(cutoffYear) {
+      twoDigitCutoffYear = cutoffYear % 100;
+    }
+
+    /**
+     * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+     * @type {boolean}
+     */
+  }, {
+    key: "throwOnInvalid",
+    get: function get() {
+      return throwOnInvalid;
+    }
+
+    /**
+     * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+     * @type {boolean}
+     */,
+    set: function set(t) {
+      throwOnInvalid = t;
+    }
+  }]);
+  return Settings;
+}();
+
+var Invalid = /*#__PURE__*/function () {
+  function Invalid(reason, explanation) {
+    this.reason = reason;
+    this.explanation = explanation;
+  }
+  var _proto = Invalid.prototype;
+  _proto.toMessage = function toMessage() {
+    if (this.explanation) {
+      return this.reason + ": " + this.explanation;
+    } else {
+      return this.reason;
+    }
+  };
+  return Invalid;
+}();
+
+var nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+function unitOutOfRange(unit, value) {
+  return new Invalid("unit out of range", "you specified " + value + " (of type " + typeof value + ") as a " + unit + ", which is invalid");
+}
+function dayOfWeek(year, month, day) {
+  var d = new Date(Date.UTC(year, month - 1, day));
+  if (year < 100 && year >= 0) {
+    d.setUTCFullYear(d.getUTCFullYear() - 1900);
+  }
+  var js = d.getUTCDay();
+  return js === 0 ? 7 : js;
+}
+function computeOrdinal(year, month, day) {
+  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+}
+function uncomputeOrdinal(year, ordinal) {
+  var table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+    month0 = table.findIndex(function (i) {
+      return i < ordinal;
+    }),
+    day = ordinal - table[month0];
+  return {
+    month: month0 + 1,
+    day: day
+  };
+}
+function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+  return (isoWeekday - startOfWeek + 7) % 7 + 1;
+}
+
+/**
+ * @private
+ */
+
+function gregorianToWeek(gregObj, minDaysInFirstWeek, startOfWeek) {
+  if (minDaysInFirstWeek === void 0) {
+    minDaysInFirstWeek = 4;
+  }
+  if (startOfWeek === void 0) {
+    startOfWeek = 1;
+  }
+  var year = gregObj.year,
+    month = gregObj.month,
+    day = gregObj.day,
+    ordinal = computeOrdinal(year, month, day),
+    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+  var weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+    weekYear;
+  if (weekNumber < 1) {
+    weekYear = year - 1;
+    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+    weekYear = year + 1;
+    weekNumber = 1;
+  } else {
+    weekYear = year;
+  }
+  return _extends({
+    weekYear: weekYear,
+    weekNumber: weekNumber,
+    weekday: weekday
+  }, timeObject(gregObj));
+}
+function weekToGregorian(weekData, minDaysInFirstWeek, startOfWeek) {
+  if (minDaysInFirstWeek === void 0) {
+    minDaysInFirstWeek = 4;
+  }
+  if (startOfWeek === void 0) {
+    startOfWeek = 1;
+  }
+  var weekYear = weekData.weekYear,
+    weekNumber = weekData.weekNumber,
+    weekday = weekData.weekday,
+    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+    yearInDays = daysInYear(weekYear);
+  var ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+    year;
+  if (ordinal < 1) {
+    year = weekYear - 1;
+    ordinal += daysInYear(year);
+  } else if (ordinal > yearInDays) {
+    year = weekYear + 1;
+    ordinal -= daysInYear(weekYear);
+  } else {
+    year = weekYear;
+  }
+  var _uncomputeOrdinal = uncomputeOrdinal(year, ordinal),
+    month = _uncomputeOrdinal.month,
+    day = _uncomputeOrdinal.day;
+  return _extends({
+    year: year,
+    month: month,
+    day: day
+  }, timeObject(weekData));
+}
+function gregorianToOrdinal(gregData) {
+  var year = gregData.year,
+    month = gregData.month,
+    day = gregData.day;
+  var ordinal = computeOrdinal(year, month, day);
+  return _extends({
+    year: year,
+    ordinal: ordinal
+  }, timeObject(gregData));
+}
+function ordinalToGregorian(ordinalData) {
+  var year = ordinalData.year,
+    ordinal = ordinalData.ordinal;
+  var _uncomputeOrdinal2 = uncomputeOrdinal(year, ordinal),
+    month = _uncomputeOrdinal2.month,
+    day = _uncomputeOrdinal2.day;
+  return _extends({
+    year: year,
+    month: month,
+    day: day
+  }, timeObject(ordinalData));
+}
+
+/**
+ * Check if local week units like localWeekday are used in obj.
+ * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+ * Modifies obj in-place!
+ * @param obj the object values
+ */
+function usesLocalWeekValues(obj, loc) {
+  var hasLocaleWeekData = !isUndefined(obj.localWeekday) || !isUndefined(obj.localWeekNumber) || !isUndefined(obj.localWeekYear);
+  if (hasLocaleWeekData) {
+    var hasIsoWeekData = !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+    if (hasIsoWeekData) {
+      throw new ConflictingSpecificationError("Cannot mix locale-based week fields with ISO-based week fields");
+    }
+    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+    delete obj.localWeekday;
+    delete obj.localWeekNumber;
+    delete obj.localWeekYear;
+    return {
+      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+      startOfWeek: loc.getStartOfWeek()
+    };
+  } else {
+    return {
+      minDaysInFirstWeek: 4,
+      startOfWeek: 1
+    };
+  }
+}
+function hasInvalidWeekData(obj, minDaysInFirstWeek, startOfWeek) {
+  if (minDaysInFirstWeek === void 0) {
+    minDaysInFirstWeek = 4;
+  }
+  if (startOfWeek === void 0) {
+    startOfWeek = 1;
+  }
+  var validYear = isInteger(obj.weekYear),
+    validWeek = integerBetween(obj.weekNumber, 1, weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)),
+    validWeekday = integerBetween(obj.weekday, 1, 7);
+  if (!validYear) {
+    return unitOutOfRange("weekYear", obj.weekYear);
+  } else if (!validWeek) {
+    return unitOutOfRange("week", obj.weekNumber);
+  } else if (!validWeekday) {
+    return unitOutOfRange("weekday", obj.weekday);
+  } else return false;
+}
+function hasInvalidOrdinalData(obj) {
+  var validYear = isInteger(obj.year),
+    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validOrdinal) {
+    return unitOutOfRange("ordinal", obj.ordinal);
+  } else return false;
+}
+function hasInvalidGregorianData(obj) {
+  var validYear = isInteger(obj.year),
+    validMonth = integerBetween(obj.month, 1, 12),
+    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validMonth) {
+    return unitOutOfRange("month", obj.month);
+  } else if (!validDay) {
+    return unitOutOfRange("day", obj.day);
+  } else return false;
+}
+function hasInvalidTimeData(obj) {
+  var hour = obj.hour,
+    minute = obj.minute,
+    second = obj.second,
+    millisecond = obj.millisecond;
+  var validHour = integerBetween(hour, 0, 23) || hour === 24 && minute === 0 && second === 0 && millisecond === 0,
+    validMinute = integerBetween(minute, 0, 59),
+    validSecond = integerBetween(second, 0, 59),
+    validMillisecond = integerBetween(millisecond, 0, 999);
+  if (!validHour) {
+    return unitOutOfRange("hour", hour);
+  } else if (!validMinute) {
+    return unitOutOfRange("minute", minute);
+  } else if (!validSecond) {
+    return unitOutOfRange("second", second);
+  } else if (!validMillisecond) {
+    return unitOutOfRange("millisecond", millisecond);
+  } else return false;
+}
+
+/**
+ * @private
+ */
+
+// TYPES
+
+function isUndefined(o) {
+  return typeof o === "undefined";
+}
+function isNumber(o) {
+  return typeof o === "number";
+}
+function isInteger(o) {
+  return typeof o === "number" && o % 1 === 0;
+}
+function isString(o) {
+  return typeof o === "string";
+}
+function isDate(o) {
+  return Object.prototype.toString.call(o) === "[object Date]";
+}
+
+// CAPABILITIES
+
+function hasRelative() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+  } catch (e) {
+    return false;
+  }
+}
+function hasLocaleWeekInfo() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.Locale && ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype);
+  } catch (e) {
+    return false;
+  }
+}
+
+// OBJECTS AND ARRAYS
+
+function maybeArray(thing) {
+  return Array.isArray(thing) ? thing : [thing];
+}
+function bestBy(arr, by, compare) {
+  if (arr.length === 0) {
+    return undefined;
+  }
+  return arr.reduce(function (best, next) {
+    var pair = [by(next), next];
+    if (!best) {
+      return pair;
+    } else if (compare(best[0], pair[0]) === best[0]) {
+      return best;
+    } else {
+      return pair;
+    }
+  }, null)[1];
+}
+function pick(obj, keys) {
+  return keys.reduce(function (a, k) {
+    a[k] = obj[k];
+    return a;
+  }, {});
+}
+function hasOwnProperty(obj, prop) {
+  return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+function validateWeekSettings(settings) {
+  if (settings == null) {
+    return null;
+  } else if (typeof settings !== "object") {
+    throw new InvalidArgumentError("Week settings must be an object");
+  } else {
+    if (!integerBetween(settings.firstDay, 1, 7) || !integerBetween(settings.minimalDays, 1, 7) || !Array.isArray(settings.weekend) || settings.weekend.some(function (v) {
+      return !integerBetween(v, 1, 7);
+    })) {
+      throw new InvalidArgumentError("Invalid week settings");
+    }
+    return {
+      firstDay: settings.firstDay,
+      minimalDays: settings.minimalDays,
+      weekend: Array.from(settings.weekend)
+    };
+  }
+}
+
+// NUMBERS AND STRINGS
+
+function integerBetween(thing, bottom, top) {
+  return isInteger(thing) && thing >= bottom && thing <= top;
+}
+
+// x % n but takes the sign of n instead of x
+function floorMod(x, n) {
+  return x - n * Math.floor(x / n);
+}
+function padStart(input, n) {
+  if (n === void 0) {
+    n = 2;
+  }
+  var isNeg = input < 0;
+  var padded;
+  if (isNeg) {
+    padded = "-" + ("" + -input).padStart(n, "0");
+  } else {
+    padded = ("" + input).padStart(n, "0");
+  }
+  return padded;
+}
+function parseInteger(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseInt(string, 10);
+  }
+}
+function parseFloating(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseFloat(string);
+  }
+}
+function parseMillis(fraction) {
+  // Return undefined (instead of 0) in these cases, where fraction is not set
+  if (isUndefined(fraction) || fraction === null || fraction === "") {
+    return undefined;
+  } else {
+    var f = parseFloat("0." + fraction) * 1000;
+    return Math.floor(f);
+  }
+}
+function roundTo(number, digits, rounding) {
+  if (rounding === void 0) {
+    rounding = "round";
+  }
+  var factor = Math.pow(10, digits);
+  switch (rounding) {
+    case "expand":
+      return number > 0 ? Math.ceil(number * factor) / factor : Math.floor(number * factor) / factor;
+    case "trunc":
+      return Math.trunc(number * factor) / factor;
+    case "round":
+      return Math.round(number * factor) / factor;
+    case "floor":
+      return Math.floor(number * factor) / factor;
+    case "ceil":
+      return Math.ceil(number * factor) / factor;
+    default:
+      throw new RangeError("Value rounding " + rounding + " is out of range");
+  }
+}
+
+// DATE BASICS
+
+function isLeapYear(year) {
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+function daysInYear(year) {
+  return isLeapYear(year) ? 366 : 365;
+}
+function daysInMonth(year, month) {
+  var modMonth = floorMod(month - 1, 12) + 1,
+    modYear = year + (month - modMonth) / 12;
+  if (modMonth === 2) {
+    return isLeapYear(modYear) ? 29 : 28;
+  } else {
+    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+  }
+}
+
+// convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+function objToLocalTS(obj) {
+  var d = Date.UTC(obj.year, obj.month - 1, obj.day, obj.hour, obj.minute, obj.second, obj.millisecond);
+
+  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+  if (obj.year < 100 && obj.year >= 0) {
+    d = new Date(d);
+    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+    // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+    // the calculations done by Date.UTC are using year 2000 - which is incorrect
+    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+  }
+  return +d;
+}
+
+// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+  var fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+  return -fwdlw + minDaysInFirstWeek - 1;
+}
+function weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek) {
+  if (minDaysInFirstWeek === void 0) {
+    minDaysInFirstWeek = 4;
+  }
+  if (startOfWeek === void 0) {
+    startOfWeek = 1;
+  }
+  var weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+  var weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+}
+function untruncateYear(year) {
+  if (year > 99) {
+    return year;
+  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+}
+
+// PARSING
+
+function parseZoneInfo(ts, offsetFormat, locale, timeZone) {
+  if (timeZone === void 0) {
+    timeZone = null;
+  }
+  var date = new Date(ts),
+    intlOpts = {
+      hourCycle: "h23",
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit"
+    };
+  if (timeZone) {
+    intlOpts.timeZone = timeZone;
+  }
+  var modified = _extends({
+    timeZoneName: offsetFormat
+  }, intlOpts);
+  var parsed = new Intl.DateTimeFormat(locale, modified).formatToParts(date).find(function (m) {
+    return m.type.toLowerCase() === "timezonename";
+  });
+  return parsed ? parsed.value : null;
+}
+
+// signedOffset('-5', '30') -> -330
+function signedOffset(offHourStr, offMinuteStr) {
+  var offHour = parseInt(offHourStr, 10);
+
+  // don't || this because we want to preserve -0
+  if (Number.isNaN(offHour)) {
+    offHour = 0;
+  }
+  var offMin = parseInt(offMinuteStr, 10) || 0,
+    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+  return offHour * 60 + offMinSigned;
+}
+
+// COERCION
+
+function asNumber(value) {
+  var numericValue = Number(value);
+  if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue)) throw new InvalidArgumentError("Invalid unit value " + value);
+  return numericValue;
+}
+function normalizeObject(obj, normalizer) {
+  var normalized = {};
+  for (var u in obj) {
+    if (hasOwnProperty(obj, u)) {
+      var v = obj[u];
+      if (v === undefined || v === null) continue;
+      normalized[normalizer(u)] = asNumber(v);
+    }
+  }
+  return normalized;
+}
+
+/**
+ * Returns the offset's value as a string
+ * @param {number} ts - Epoch milliseconds for which to get the offset
+ * @param {string} format - What style of offset to return.
+ *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+ * @return {string}
+ */
+function formatOffset(offset, format) {
+  var hours = Math.trunc(Math.abs(offset / 60)),
+    minutes = Math.trunc(Math.abs(offset % 60)),
+    sign = offset >= 0 ? "+" : "-";
+  switch (format) {
+    case "short":
+      return "" + sign + padStart(hours, 2) + ":" + padStart(minutes, 2);
+    case "narrow":
+      return "" + sign + hours + (minutes > 0 ? ":" + minutes : "");
+    case "techie":
+      return "" + sign + padStart(hours, 2) + padStart(minutes, 2);
+    default:
+      throw new RangeError("Value format " + format + " is out of range for property format");
+  }
+}
+function timeObject(obj) {
+  return pick(obj, ["hour", "minute", "second", "millisecond"]);
+}
+
+/**
+ * @private
+ */
+
+var monthsLong = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"];
+var monthsShort = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"];
+var monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+function months(length) {
+  switch (length) {
+    case "narrow":
+      return [].concat(monthsNarrow);
+    case "short":
+      return [].concat(monthsShort);
+    case "long":
+      return [].concat(monthsLong);
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+    case "2-digit":
+      return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+    default:
+      return null;
+  }
+}
+var weekdaysLong = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"];
+var weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+var weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+function weekdays(length) {
+  switch (length) {
+    case "narrow":
+      return [].concat(weekdaysNarrow);
+    case "short":
+      return [].concat(weekdaysShort);
+    case "long":
+      return [].concat(weekdaysLong);
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7"];
+    default:
+      return null;
+  }
+}
+var meridiems = ["AM", "PM"];
+var erasLong = ["Before Christ", "Anno Domini"];
+var erasShort = ["BC", "AD"];
+var erasNarrow = ["B", "A"];
+function eras(length) {
+  switch (length) {
+    case "narrow":
+      return [].concat(erasNarrow);
+    case "short":
+      return [].concat(erasShort);
+    case "long":
+      return [].concat(erasLong);
+    default:
+      return null;
+  }
+}
+function meridiemForDateTime(dt) {
+  return meridiems[dt.hour < 12 ? 0 : 1];
+}
+function weekdayForDateTime(dt, length) {
+  return weekdays(length)[dt.weekday - 1];
+}
+function monthForDateTime(dt, length) {
+  return months(length)[dt.month - 1];
+}
+function eraForDateTime(dt, length) {
+  return eras(length)[dt.year < 0 ? 0 : 1];
+}
+function formatRelativeTime(unit, count, numeric, narrow) {
+  if (numeric === void 0) {
+    numeric = "always";
+  }
+  if (narrow === void 0) {
+    narrow = false;
+  }
+  var units = {
+    years: ["year", "yr."],
+    quarters: ["quarter", "qtr."],
+    months: ["month", "mo."],
+    weeks: ["week", "wk."],
+    days: ["day", "day", "days"],
+    hours: ["hour", "hr."],
+    minutes: ["minute", "min."],
+    seconds: ["second", "sec."]
+  };
+  var lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+  if (numeric === "auto" && lastable) {
+    var isDay = unit === "days";
+    switch (count) {
+      case 1:
+        return isDay ? "tomorrow" : "next " + units[unit][0];
+      case -1:
+        return isDay ? "yesterday" : "last " + units[unit][0];
+      case 0:
+        return isDay ? "today" : "this " + units[unit][0];
+    }
+  }
+
+  var isInPast = Object.is(count, -0) || count < 0,
+    fmtValue = Math.abs(count),
+    singular = fmtValue === 1,
+    lilUnits = units[unit],
+    fmtUnit = narrow ? singular ? lilUnits[1] : lilUnits[2] || lilUnits[1] : singular ? units[unit][0] : unit;
+  return isInPast ? fmtValue + " " + fmtUnit + " ago" : "in " + fmtValue + " " + fmtUnit;
+}
+
+function stringifyTokens(splits, tokenToString) {
+  var s = "";
+  for (var _iterator = _createForOfIteratorHelperLoose(splits), _step; !(_step = _iterator()).done;) {
+    var token = _step.value;
+    if (token.literal) {
+      s += token.val;
+    } else {
+      s += tokenToString(token.val);
+    }
+  }
+  return s;
+}
+var _macroTokenToFormatOpts = {
+  D: DATE_SHORT,
+  DD: DATE_MED,
+  DDD: DATE_FULL,
+  DDDD: DATE_HUGE,
+  t: TIME_SIMPLE,
+  tt: TIME_WITH_SECONDS,
+  ttt: TIME_WITH_SHORT_OFFSET,
+  tttt: TIME_WITH_LONG_OFFSET,
+  T: TIME_24_SIMPLE,
+  TT: TIME_24_WITH_SECONDS,
+  TTT: TIME_24_WITH_SHORT_OFFSET,
+  TTTT: TIME_24_WITH_LONG_OFFSET,
+  f: DATETIME_SHORT,
+  ff: DATETIME_MED,
+  fff: DATETIME_FULL,
+  ffff: DATETIME_HUGE,
+  F: DATETIME_SHORT_WITH_SECONDS,
+  FF: DATETIME_MED_WITH_SECONDS,
+  FFF: DATETIME_FULL_WITH_SECONDS,
+  FFFF: DATETIME_HUGE_WITH_SECONDS
+};
+
+/**
+ * @private
+ */
+var Formatter = /*#__PURE__*/function () {
+  Formatter.create = function create(locale, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return new Formatter(locale, opts);
+  };
+  Formatter.parseFormat = function parseFormat(fmt) {
+    // white-space is always considered a literal in user-provided formats
+    // the " " token has a special meaning (see unitForToken)
+
+    var current = null,
+      currentFull = "",
+      bracketed = false;
+    var splits = [];
+    for (var i = 0; i < fmt.length; i++) {
+      var c = fmt.charAt(i);
+      if (c === "'") {
+        // turn '' into a literal signal quote instead of just skipping the empty literal
+        if (currentFull.length > 0 || bracketed) {
+          splits.push({
+            literal: bracketed || /^\s+$/.test(currentFull),
+            val: currentFull === "" ? "'" : currentFull
+          });
+        }
+        current = null;
+        currentFull = "";
+        bracketed = !bracketed;
+      } else if (bracketed) {
+        currentFull += c;
+      } else if (c === current) {
+        currentFull += c;
+      } else {
+        if (currentFull.length > 0) {
+          splits.push({
+            literal: /^\s+$/.test(currentFull),
+            val: currentFull
+          });
+        }
+        currentFull = c;
+        current = c;
+      }
+    }
+    if (currentFull.length > 0) {
+      splits.push({
+        literal: bracketed || /^\s+$/.test(currentFull),
+        val: currentFull
+      });
+    }
+    return splits;
+  };
+  Formatter.macroTokenToFormatOpts = function macroTokenToFormatOpts(token) {
+    return _macroTokenToFormatOpts[token];
+  };
+  function Formatter(locale, formatOpts) {
+    this.opts = formatOpts;
+    this.loc = locale;
+    this.systemLoc = null;
+  }
+  var _proto = Formatter.prototype;
+  _proto.formatWithSystemDefault = function formatWithSystemDefault(dt, opts) {
+    if (this.systemLoc === null) {
+      this.systemLoc = this.loc.redefaultToSystem();
+    }
+    var df = this.systemLoc.dtFormatter(dt, _extends({}, this.opts, opts));
+    return df.format();
+  };
+  _proto.dtFormatter = function dtFormatter(dt, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.loc.dtFormatter(dt, _extends({}, this.opts, opts));
+  };
+  _proto.formatDateTime = function formatDateTime(dt, opts) {
+    return this.dtFormatter(dt, opts).format();
+  };
+  _proto.formatDateTimeParts = function formatDateTimeParts(dt, opts) {
+    return this.dtFormatter(dt, opts).formatToParts();
+  };
+  _proto.formatInterval = function formatInterval(interval, opts) {
+    var df = this.dtFormatter(interval.start, opts);
+    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+  };
+  _proto.resolvedOptions = function resolvedOptions(dt, opts) {
+    return this.dtFormatter(dt, opts).resolvedOptions();
+  };
+  _proto.num = function num(n, p, signDisplay) {
+    if (p === void 0) {
+      p = 0;
+    }
+    if (signDisplay === void 0) {
+      signDisplay = undefined;
+    }
+    // we get some perf out of doing this here, annoyingly
+    if (this.opts.forceSimple) {
+      return padStart(n, p);
+    }
+    var opts = _extends({}, this.opts);
+    if (p > 0) {
+      opts.padTo = p;
+    }
+    if (signDisplay) {
+      opts.signDisplay = signDisplay;
+    }
+    return this.loc.numberFormatter(opts).format(n);
+  };
+  _proto.formatDateTimeFromString = function formatDateTimeFromString(dt, fmt) {
+    var _this = this;
+    var knownEnglish = this.loc.listingMode() === "en",
+      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+      string = function string(opts, extract) {
+        return _this.loc.extract(dt, opts, extract);
+      },
+      formatOffset = function formatOffset(opts) {
+        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+          return "Z";
+        }
+        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+      },
+      meridiem = function meridiem() {
+        return knownEnglish ? meridiemForDateTime(dt) : string({
+          hour: "numeric",
+          hourCycle: "h12"
+        }, "dayperiod");
+      },
+      month = function month(length, standalone) {
+        return knownEnglish ? monthForDateTime(dt, length) : string(standalone ? {
+          month: length
+        } : {
+          month: length,
+          day: "numeric"
+        }, "month");
+      },
+      weekday = function weekday(length, standalone) {
+        return knownEnglish ? weekdayForDateTime(dt, length) : string(standalone ? {
+          weekday: length
+        } : {
+          weekday: length,
+          month: "long",
+          day: "numeric"
+        }, "weekday");
+      },
+      maybeMacro = function maybeMacro(token) {
+        var formatOpts = Formatter.macroTokenToFormatOpts(token);
+        if (formatOpts) {
+          return _this.formatWithSystemDefault(dt, formatOpts);
+        } else {
+          return token;
+        }
+      },
+      era = function era(length) {
+        return knownEnglish ? eraForDateTime(dt, length) : string({
+          era: length
+        }, "era");
+      },
+      tokenToString = function tokenToString(token) {
+        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+        switch (token) {
+          // ms
+          case "S":
+            return _this.num(dt.millisecond);
+          case "u":
+          // falls through
+          case "SSS":
+            return _this.num(dt.millisecond, 3);
+          // seconds
+          case "s":
+            return _this.num(dt.second);
+          case "ss":
+            return _this.num(dt.second, 2);
+          // fractional seconds
+          case "uu":
+            return _this.num(Math.floor(dt.millisecond / 10), 2);
+          case "uuu":
+            return _this.num(Math.floor(dt.millisecond / 100));
+          // minutes
+          case "m":
+            return _this.num(dt.minute);
+          case "mm":
+            return _this.num(dt.minute, 2);
+          // hours
+          case "h":
+            return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+          case "hh":
+            return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+          case "H":
+            return _this.num(dt.hour);
+          case "HH":
+            return _this.num(dt.hour, 2);
+          // offset
+          case "Z":
+            // like +6
+            return formatOffset({
+              format: "narrow",
+              allowZ: _this.opts.allowZ
+            });
+          case "ZZ":
+            // like +06:00
+            return formatOffset({
+              format: "short",
+              allowZ: _this.opts.allowZ
+            });
+          case "ZZZ":
+            // like +0600
+            return formatOffset({
+              format: "techie",
+              allowZ: _this.opts.allowZ
+            });
+          case "ZZZZ":
+            // like EST
+            return dt.zone.offsetName(dt.ts, {
+              format: "short",
+              locale: _this.loc.locale
+            });
+          case "ZZZZZ":
+            // like Eastern Standard Time
+            return dt.zone.offsetName(dt.ts, {
+              format: "long",
+              locale: _this.loc.locale
+            });
+          // zone
+          case "z":
+            // like America/New_York
+            return dt.zoneName;
+          // meridiems
+          case "a":
+            return meridiem();
+          // dates
+          case "d":
+            return useDateTimeFormatter ? string({
+              day: "numeric"
+            }, "day") : _this.num(dt.day);
+          case "dd":
+            return useDateTimeFormatter ? string({
+              day: "2-digit"
+            }, "day") : _this.num(dt.day, 2);
+          // weekdays - standalone
+          case "c":
+            // like 1
+            return _this.num(dt.weekday);
+          case "ccc":
+            // like 'Tues'
+            return weekday("short", true);
+          case "cccc":
+            // like 'Tuesday'
+            return weekday("long", true);
+          case "ccccc":
+            // like 'T'
+            return weekday("narrow", true);
+          // weekdays - format
+          case "E":
+            // like 1
+            return _this.num(dt.weekday);
+          case "EEE":
+            // like 'Tues'
+            return weekday("short", false);
+          case "EEEE":
+            // like 'Tuesday'
+            return weekday("long", false);
+          case "EEEEE":
+            // like 'T'
+            return weekday("narrow", false);
+          // months - standalone
+          case "L":
+            // like 1
+            return useDateTimeFormatter ? string({
+              month: "numeric",
+              day: "numeric"
+            }, "month") : _this.num(dt.month);
+          case "LL":
+            // like 01, doesn't seem to work
+            return useDateTimeFormatter ? string({
+              month: "2-digit",
+              day: "numeric"
+            }, "month") : _this.num(dt.month, 2);
+          case "LLL":
+            // like Jan
+            return month("short", true);
+          case "LLLL":
+            // like January
+            return month("long", true);
+          case "LLLLL":
+            // like J
+            return month("narrow", true);
+          // months - format
+          case "M":
+            // like 1
+            return useDateTimeFormatter ? string({
+              month: "numeric"
+            }, "month") : _this.num(dt.month);
+          case "MM":
+            // like 01
+            return useDateTimeFormatter ? string({
+              month: "2-digit"
+            }, "month") : _this.num(dt.month, 2);
+          case "MMM":
+            // like Jan
+            return month("short", false);
+          case "MMMM":
+            // like January
+            return month("long", false);
+          case "MMMMM":
+            // like J
+            return month("narrow", false);
+          // years
+          case "y":
+            // like 2014
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : _this.num(dt.year);
+          case "yy":
+            // like 14
+            return useDateTimeFormatter ? string({
+              year: "2-digit"
+            }, "year") : _this.num(dt.year.toString().slice(-2), 2);
+          case "yyyy":
+            // like 0012
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : _this.num(dt.year, 4);
+          case "yyyyyy":
+            // like 000012
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : _this.num(dt.year, 6);
+          // eras
+          case "G":
+            // like AD
+            return era("short");
+          case "GG":
+            // like Anno Domini
+            return era("long");
+          case "GGGGG":
+            return era("narrow");
+          case "kk":
+            return _this.num(dt.weekYear.toString().slice(-2), 2);
+          case "kkkk":
+            return _this.num(dt.weekYear, 4);
+          case "W":
+            return _this.num(dt.weekNumber);
+          case "WW":
+            return _this.num(dt.weekNumber, 2);
+          case "n":
+            return _this.num(dt.localWeekNumber);
+          case "nn":
+            return _this.num(dt.localWeekNumber, 2);
+          case "ii":
+            return _this.num(dt.localWeekYear.toString().slice(-2), 2);
+          case "iiii":
+            return _this.num(dt.localWeekYear, 4);
+          case "o":
+            return _this.num(dt.ordinal);
+          case "ooo":
+            return _this.num(dt.ordinal, 3);
+          case "q":
+            // like 1
+            return _this.num(dt.quarter);
+          case "qq":
+            // like 01
+            return _this.num(dt.quarter, 2);
+          case "X":
+            return _this.num(Math.floor(dt.ts / 1000));
+          case "x":
+            return _this.num(dt.ts);
+          default:
+            return maybeMacro(token);
+        }
+      };
+    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+  };
+  _proto.formatDurationFromString = function formatDurationFromString(dur, fmt) {
+    var _this2 = this;
+    var invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+    var tokenToField = function tokenToField(token) {
+        switch (token[0]) {
+          case "S":
+            return "milliseconds";
+          case "s":
+            return "seconds";
+          case "m":
+            return "minutes";
+          case "h":
+            return "hours";
+          case "d":
+            return "days";
+          case "w":
+            return "weeks";
+          case "M":
+            return "months";
+          case "y":
+            return "years";
+          default:
+            return null;
+        }
+      },
+      tokenToString = function tokenToString(lildur, info) {
+        return function (token) {
+          var mapped = tokenToField(token);
+          if (mapped) {
+            var inversionFactor = info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+            var signDisplay;
+            if (_this2.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+              signDisplay = "never";
+            } else if (_this2.opts.signMode === "all") {
+              signDisplay = "always";
+            } else {
+              // "auto" and "negative" are the same, but "auto" has better support
+              signDisplay = "auto";
+            }
+            return _this2.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+          } else {
+            return token;
+          }
+        };
+      },
+      tokens = Formatter.parseFormat(fmt),
+      realTokens = tokens.reduce(function (found, _ref) {
+        var literal = _ref.literal,
+          val = _ref.val;
+        return literal ? found : found.concat(val);
+      }, []),
+      collapsed = dur.shiftTo.apply(dur, realTokens.map(tokenToField).filter(function (t) {
+        return t;
+      })),
+      durationInfo = {
+        isNegativeDuration: collapsed < 0,
+        // this relies on "collapsed" being based on "shiftTo", which builds up the object
+        // in order
+        largestUnit: Object.keys(collapsed.values)[0]
+      };
+    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+  };
+  return Formatter;
+}();
+
+/*
+ * This file handles parsing for well-specified formats. Here's how it works:
+ * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+ * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+ * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+ * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+ * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+ * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+ */
+
+var ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+function combineRegexes() {
+  for (var _len = arguments.length, regexes = new Array(_len), _key = 0; _key < _len; _key++) {
+    regexes[_key] = arguments[_key];
+  }
+  var full = regexes.reduce(function (f, r) {
+    return f + r.source;
+  }, "");
+  return RegExp("^" + full + "$");
+}
+function combineExtractors() {
+  for (var _len2 = arguments.length, extractors = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    extractors[_key2] = arguments[_key2];
+  }
+  return function (m) {
+    return extractors.reduce(function (_ref, ex) {
+      var mergedVals = _ref[0],
+        mergedZone = _ref[1],
+        cursor = _ref[2];
+      var _ex = ex(m, cursor),
+        val = _ex[0],
+        zone = _ex[1],
+        next = _ex[2];
+      return [_extends({}, mergedVals, val), zone || mergedZone, next];
+    }, [{}, null, 1]).slice(0, 2);
+  };
+}
+function parse(s) {
+  if (s == null) {
+    return [null, null];
+  }
+  for (var _len3 = arguments.length, patterns = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
+    patterns[_key3 - 1] = arguments[_key3];
+  }
+  for (var _i = 0, _patterns = patterns; _i < _patterns.length; _i++) {
+    var _patterns$_i = _patterns[_i],
+      regex = _patterns$_i[0],
+      extractor = _patterns$_i[1];
+    var m = regex.exec(s);
+    if (m) {
+      return extractor(m);
+    }
+  }
+  return [null, null];
+}
+function simpleParse() {
+  for (var _len4 = arguments.length, keys = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {
+    keys[_key4] = arguments[_key4];
+  }
+  return function (match, cursor) {
+    var ret = {};
+    var i;
+    for (i = 0; i < keys.length; i++) {
+      ret[keys[i]] = parseInteger(match[cursor + i]);
+    }
+    return [ret, null, cursor + i];
+  };
+}
+
+// ISO and SQL parsing
+var offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+var isoExtendedZone = "(?:" + offsetRegex.source + "?(?:\\[(" + ianaRegex.source + ")\\])?)?";
+var isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+var isoTimeRegex = RegExp("" + isoTimeBaseRegex.source + isoExtendedZone);
+var isoTimeExtensionRegex = RegExp("(?:[Tt]" + isoTimeRegex.source + ")?");
+var isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+var isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+var isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+var extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+var extractISOOrdinalData = simpleParse("year", "ordinal");
+var sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+var sqlTimeRegex = RegExp(isoTimeBaseRegex.source + " ?(?:" + offsetRegex.source + "|(" + ianaRegex.source + "))?");
+var sqlTimeExtensionRegex = RegExp("(?: " + sqlTimeRegex.source + ")?");
+function int(match, pos, fallback) {
+  var m = match[pos];
+  return isUndefined(m) ? fallback : parseInteger(m);
+}
+function extractISOYmd(match, cursor) {
+  var item = {
+    year: int(match, cursor),
+    month: int(match, cursor + 1, 1),
+    day: int(match, cursor + 2, 1)
+  };
+  return [item, null, cursor + 3];
+}
+function extractISOTime(match, cursor) {
+  var item = {
+    hours: int(match, cursor, 0),
+    minutes: int(match, cursor + 1, 0),
+    seconds: int(match, cursor + 2, 0),
+    milliseconds: parseMillis(match[cursor + 3])
+  };
+  return [item, null, cursor + 4];
+}
+function extractISOOffset(match, cursor) {
+  var local = !match[cursor] && !match[cursor + 1],
+    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+    zone = local ? null : FixedOffsetZone.instance(fullOffset);
+  return [{}, zone, cursor + 3];
+}
+function extractIANAZone(match, cursor) {
+  var zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+  return [{}, zone, cursor + 1];
+}
+
+// ISO time parsing
+
+var isoTimeOnly = RegExp("^T?" + isoTimeBaseRegex.source + "$");
+
+// ISO duration parsing
+
+var isoDuration = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+function extractISODuration(match) {
+  var s = match[0],
+    yearStr = match[1],
+    monthStr = match[2],
+    weekStr = match[3],
+    dayStr = match[4],
+    hourStr = match[5],
+    minuteStr = match[6],
+    secondStr = match[7],
+    millisecondsStr = match[8];
+  var hasNegativePrefix = s[0] === "-";
+  var negativeSeconds = secondStr && secondStr[0] === "-";
+  var maybeNegate = function maybeNegate(num, force) {
+    if (force === void 0) {
+      force = false;
+    }
+    return num !== undefined && (force || num && hasNegativePrefix) ? -num : num;
+  };
+  return [{
+    years: maybeNegate(parseFloating(yearStr)),
+    months: maybeNegate(parseFloating(monthStr)),
+    weeks: maybeNegate(parseFloating(weekStr)),
+    days: maybeNegate(parseFloating(dayStr)),
+    hours: maybeNegate(parseFloating(hourStr)),
+    minutes: maybeNegate(parseFloating(minuteStr)),
+    seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+    milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds)
+  }];
+}
+
+// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+// and not just that we're in -240 *right now*. But since I don't think these are used that often
+// I'm just going to ignore that
+var obsOffsets = {
+  GMT: 0,
+  EDT: -4 * 60,
+  EST: -5 * 60,
+  CDT: -5 * 60,
+  CST: -6 * 60,
+  MDT: -6 * 60,
+  MST: -7 * 60,
+  PDT: -7 * 60,
+  PST: -8 * 60
+};
+function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+  var result = {
+    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+    month: monthsShort.indexOf(monthStr) + 1,
+    day: parseInteger(dayStr),
+    hour: parseInteger(hourStr),
+    minute: parseInteger(minuteStr)
+  };
+  if (secondStr) result.second = parseInteger(secondStr);
+  if (weekdayStr) {
+    result.weekday = weekdayStr.length > 3 ? weekdaysLong.indexOf(weekdayStr) + 1 : weekdaysShort.indexOf(weekdayStr) + 1;
+  }
+  return result;
+}
+
+// RFC 2822/5322
+var rfc2822 = /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+function extractRFC2822(match) {
+  var weekdayStr = match[1],
+    dayStr = match[2],
+    monthStr = match[3],
+    yearStr = match[4],
+    hourStr = match[5],
+    minuteStr = match[6],
+    secondStr = match[7],
+    obsOffset = match[8],
+    milOffset = match[9],
+    offHourStr = match[10],
+    offMinuteStr = match[11],
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  var offset;
+  if (obsOffset) {
+    offset = obsOffsets[obsOffset];
+  } else if (milOffset) {
+    offset = 0;
+  } else {
+    offset = signedOffset(offHourStr, offMinuteStr);
+  }
+  return [result, new FixedOffsetZone(offset)];
+}
+function preprocessRFC2822(s) {
+  // Remove comments and folding whitespace and replace multiple-spaces with a single space
+  return s.replace(/\([^()]*\)|[\n\t]/g, " ").replace(/(\s\s+)/g, " ").trim();
+}
+
+// http date
+
+var rfc1123 = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+  rfc850 = /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+  ascii = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+function extractRFC1123Or850(match) {
+  var weekdayStr = match[1],
+    dayStr = match[2],
+    monthStr = match[3],
+    yearStr = match[4],
+    hourStr = match[5],
+    minuteStr = match[6],
+    secondStr = match[7],
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+function extractASCII(match) {
+  var weekdayStr = match[1],
+    monthStr = match[2],
+    dayStr = match[3],
+    hourStr = match[4],
+    minuteStr = match[5],
+    secondStr = match[6],
+    yearStr = match[7],
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+var isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+var isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+var isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+var isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+var extractISOYmdTimeAndOffset = combineExtractors(extractISOYmd, extractISOTime, extractISOOffset, extractIANAZone);
+var extractISOWeekTimeAndOffset = combineExtractors(extractISOWeekData, extractISOTime, extractISOOffset, extractIANAZone);
+var extractISOOrdinalDateAndTime = combineExtractors(extractISOOrdinalData, extractISOTime, extractISOOffset, extractIANAZone);
+var extractISOTimeAndOffset = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+
+/*
+ * @private
+ */
+
+function parseISODate(s) {
+  return parse(s, [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset], [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime], [isoTimeCombinedRegex, extractISOTimeAndOffset]);
+}
+function parseRFC2822Date(s) {
+  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+}
+function parseHTTPDate(s) {
+  return parse(s, [rfc1123, extractRFC1123Or850], [rfc850, extractRFC1123Or850], [ascii, extractASCII]);
+}
+function parseISODuration(s) {
+  return parse(s, [isoDuration, extractISODuration]);
+}
+var extractISOTimeOnly = combineExtractors(extractISOTime);
+function parseISOTimeOnly(s) {
+  return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+}
+var sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+var sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+var extractISOTimeOffsetAndIANAZone = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+function parseSQL(s) {
+  return parse(s, [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]);
+}
+
+var INVALID$2 = "Invalid Duration";
+
+// unit conversion constants
+var lowOrderMatrix = {
+    weeks: {
+      days: 7,
+      hours: 7 * 24,
+      minutes: 7 * 24 * 60,
+      seconds: 7 * 24 * 60 * 60,
+      milliseconds: 7 * 24 * 60 * 60 * 1000
+    },
+    days: {
+      hours: 24,
+      minutes: 24 * 60,
+      seconds: 24 * 60 * 60,
+      milliseconds: 24 * 60 * 60 * 1000
+    },
+    hours: {
+      minutes: 60,
+      seconds: 60 * 60,
+      milliseconds: 60 * 60 * 1000
+    },
+    minutes: {
+      seconds: 60,
+      milliseconds: 60 * 1000
+    },
+    seconds: {
+      milliseconds: 1000
+    }
+  },
+  casualMatrix = _extends({
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: 52,
+      days: 365,
+      hours: 365 * 24,
+      minutes: 365 * 24 * 60,
+      seconds: 365 * 24 * 60 * 60,
+      milliseconds: 365 * 24 * 60 * 60 * 1000
+    },
+    quarters: {
+      months: 3,
+      weeks: 13,
+      days: 91,
+      hours: 91 * 24,
+      minutes: 91 * 24 * 60,
+      seconds: 91 * 24 * 60 * 60,
+      milliseconds: 91 * 24 * 60 * 60 * 1000
+    },
+    months: {
+      weeks: 4,
+      days: 30,
+      hours: 30 * 24,
+      minutes: 30 * 24 * 60,
+      seconds: 30 * 24 * 60 * 60,
+      milliseconds: 30 * 24 * 60 * 60 * 1000
+    }
+  }, lowOrderMatrix),
+  daysInYearAccurate = 146097.0 / 400,
+  daysInMonthAccurate = 146097.0 / 4800,
+  accurateMatrix = _extends({
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: daysInYearAccurate / 7,
+      days: daysInYearAccurate,
+      hours: daysInYearAccurate * 24,
+      minutes: daysInYearAccurate * 24 * 60,
+      seconds: daysInYearAccurate * 24 * 60 * 60,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000
+    },
+    quarters: {
+      months: 3,
+      weeks: daysInYearAccurate / 28,
+      days: daysInYearAccurate / 4,
+      hours: daysInYearAccurate * 24 / 4,
+      minutes: daysInYearAccurate * 24 * 60 / 4,
+      seconds: daysInYearAccurate * 24 * 60 * 60 / 4,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000 / 4
+    },
+    months: {
+      weeks: daysInMonthAccurate / 7,
+      days: daysInMonthAccurate,
+      hours: daysInMonthAccurate * 24,
+      minutes: daysInMonthAccurate * 24 * 60,
+      seconds: daysInMonthAccurate * 24 * 60 * 60,
+      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000
+    }
+  }, lowOrderMatrix);
+
+// units ordered by size
+var orderedUnits$1 = ["years", "quarters", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds"];
+var reverseUnits = orderedUnits$1.slice(0).reverse();
+
+// clone really means "create another instance just like this one, but with these changes"
+function clone$1(dur, alts, clear) {
+  if (clear === void 0) {
+    clear = false;
+  }
+  // deep merge for vals
+  var conf = {
+    values: clear ? alts.values : _extends({}, dur.values, alts.values || {}),
+    loc: dur.loc.clone(alts.loc),
+    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+    matrix: alts.matrix || dur.matrix
+  };
+  return new Duration(conf);
+}
+function durationToMillis(matrix, vals) {
+  var _vals$milliseconds;
+  var sum = (_vals$milliseconds = vals.milliseconds) != null ? _vals$milliseconds : 0;
+  for (var _iterator = _createForOfIteratorHelperLoose(reverseUnits.slice(1)), _step; !(_step = _iterator()).done;) {
+    var unit = _step.value;
+    if (vals[unit]) {
+      sum += vals[unit] * matrix[unit]["milliseconds"];
+    }
+  }
+  return sum;
+}
+
+// NB: mutates parameters
+function normalizeValues(matrix, vals) {
+  // the logic below assumes the overall value of the duration is positive
+  // if this is not the case, factor is used to make it so
+  var factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+  orderedUnits$1.reduceRight(function (previous, current) {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        var previousVal = vals[previous] * factor;
+        var conv = matrix[current][previous];
+
+        // if (previousVal < 0):
+        // lower order unit is negative (e.g. { years: 2, days: -2 })
+        // normalize this by reducing the higher order unit by the appropriate amount
+        // and increasing the lower order unit
+        // this can never make the higher order unit negative, because this function only operates
+        // on positive durations, so the amount of time represented by the lower order unit cannot
+        // be larger than the higher order unit
+        // else:
+        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+        // in this case we attempt to convert as much as possible from the lower order unit into
+        // the higher order one
+        //
+        // Math.floor takes care of both of these cases, rounding away from 0
+        // if previousVal < 0 it makes the absolute value larger
+        // if previousVal >= it makes the absolute value smaller
+        var rollUp = Math.floor(previousVal / conv);
+        vals[current] += rollUp * factor;
+        vals[previous] -= rollUp * conv * factor;
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+
+  // try to convert any decimals into smaller units if possible
+  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+  orderedUnits$1.reduce(function (previous, current) {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        var fraction = vals[previous] % 1;
+        vals[previous] -= fraction;
+        vals[current] += fraction * matrix[previous][current];
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+}
+
+// Remove all properties with a value of 0 from an object
+function removeZeroes(vals) {
+  var newVals = {};
+  for (var _i = 0, _Object$entries = Object.entries(vals); _i < _Object$entries.length; _i++) {
+    var _Object$entries$_i = _Object$entries[_i],
+      key = _Object$entries$_i[0],
+      value = _Object$entries$_i[1];
+    if (value !== 0) {
+      newVals[key] = value;
+    }
+  }
+  return newVals;
+}
+
+/**
+ * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+ *
+ * Here is a brief overview of commonly used methods and getters in Duration:
+ *
+ * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+ * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+ * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+ * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+ * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+ *
+ * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+ */
+var Duration = /*#__PURE__*/function (_Symbol$for) {
+  /**
+   * @private
+   */
+  function Duration(config) {
+    var accurate = config.conversionAccuracy === "longterm" || false;
+    var matrix = accurate ? accurateMatrix : casualMatrix;
+    if (config.matrix) {
+      matrix = config.matrix;
+    }
+
+    /**
+     * @access private
+     */
+    this.values = config.values;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.conversionAccuracy = accurate ? "longterm" : "casual";
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.matrix = matrix;
+    /**
+     * @access private
+     */
+    this.isLuxonDuration = true;
+  }
+
+  /**
+   * Create Duration from a number of milliseconds.
+   * @param {number} count of milliseconds
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  Duration.fromMillis = function fromMillis(count, opts) {
+    return Duration.fromObject({
+      milliseconds: count
+    }, opts);
+  }
+
+  /**
+   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+   * If this object is empty then a zero milliseconds duration is returned.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.years
+   * @param {number} obj.quarters
+   * @param {number} obj.months
+   * @param {number} obj.weeks
+   * @param {number} obj.days
+   * @param {number} obj.hours
+   * @param {number} obj.minutes
+   * @param {number} obj.seconds
+   * @param {number} obj.milliseconds
+   * @param {Object} [opts=[]] - options for creating this Duration
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the custom conversion system to use
+   * @return {Duration}
+   */;
+  Duration.fromObject = function fromObject(obj, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (obj == null || typeof obj !== "object") {
+      throw new InvalidArgumentError("Duration.fromObject: argument expected to be an object, got " + (obj === null ? "null" : typeof obj));
+    }
+    return new Duration({
+      values: normalizeObject(obj, Duration.normalizeUnit),
+      loc: Locale.fromObject(opts),
+      conversionAccuracy: opts.conversionAccuracy,
+      matrix: opts.matrix
+    });
+  }
+
+  /**
+   * Create a Duration from DurationLike.
+   *
+   * @param {Object | number | Duration} durationLike
+   * One of:
+   * - object with keys like 'years' and 'hours'.
+   * - number representing milliseconds
+   * - Duration instance
+   * @return {Duration}
+   */;
+  Duration.fromDurationLike = function fromDurationLike(durationLike) {
+    if (isNumber(durationLike)) {
+      return Duration.fromMillis(durationLike);
+    } else if (Duration.isDuration(durationLike)) {
+      return durationLike;
+    } else if (typeof durationLike === "object") {
+      return Duration.fromObject(durationLike);
+    } else {
+      throw new InvalidArgumentError("Unknown duration argument " + durationLike + " of type " + typeof durationLike);
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 duration string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the preset conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+   * @return {Duration}
+   */;
+  Duration.fromISO = function fromISO(text, opts) {
+    var _parseISODuration = parseISODuration(text),
+      parsed = _parseISODuration[0];
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 time string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @return {Duration}
+   */;
+  Duration.fromISOTime = function fromISOTime(text, opts) {
+    var _parseISOTimeOnly = parseISOTimeOnly(text),
+      parsed = _parseISOTimeOnly[0];
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+    }
+  }
+
+  /**
+   * Create an invalid Duration.
+   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Duration}
+   */;
+  Duration.invalid = function invalid(reason, explanation) {
+    if (explanation === void 0) {
+      explanation = null;
+    }
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+    }
+    var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDurationError(invalid);
+    } else {
+      return new Duration({
+        invalid: invalid
+      });
+    }
+  }
+
+  /**
+   * @private
+   */;
+  Duration.normalizeUnit = function normalizeUnit(unit) {
+    var normalized = {
+      year: "years",
+      years: "years",
+      quarter: "quarters",
+      quarters: "quarters",
+      month: "months",
+      months: "months",
+      week: "weeks",
+      weeks: "weeks",
+      day: "days",
+      days: "days",
+      hour: "hours",
+      hours: "hours",
+      minute: "minutes",
+      minutes: "minutes",
+      second: "seconds",
+      seconds: "seconds",
+      millisecond: "milliseconds",
+      milliseconds: "milliseconds"
+    }[unit ? unit.toLowerCase() : unit];
+    if (!normalized) throw new InvalidUnitError(unit);
+    return normalized;
+  }
+
+  /**
+   * Check if an object is a Duration. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */;
+  Duration.isDuration = function isDuration(o) {
+    return o && o.isLuxonDuration || false;
+  }
+
+  /**
+   * Get  the locale of a Duration, such 'en-GB'
+   * @type {string}
+   */;
+  var _proto = Duration.prototype;
+  /**
+   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+   * * `S` for milliseconds
+   * * `s` for seconds
+   * * `m` for minutes
+   * * `h` for hours
+   * * `d` for days
+   * * `w` for weeks
+   * * `M` for months
+   * * `y` for years
+   * Notes:
+   * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+   * * Tokens can be escaped by wrapping with single quotes.
+   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - options
+   * @param {boolean} [opts.floor=true] - floor numerical values
+   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+   * @return {string}
+   */
+  _proto.toFormat = function toFormat(fmt, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+    var fmtOpts = _extends({}, opts, {
+      floor: opts.round !== false && opts.floor !== false
+    });
+    return this.isValid ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt) : INVALID$2;
+  }
+
+  /**
+   * Returns a string representation of a Duration with all units included.
+   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+   * @example
+   * ```js
+   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+   * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+   * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+   * ```
+   */;
+  _proto.toHuman = function toHuman(opts) {
+    var _this = this;
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (!this.isValid) return INVALID$2;
+    var showZeros = opts.showZeros !== false;
+    var l = orderedUnits$1.map(function (unit) {
+      var val = _this.values[unit];
+      if (isUndefined(val) || val === 0 && !showZeros) {
+        return null;
+      }
+      return _this.loc.numberFormatter(_extends({
+        style: "unit",
+        unitDisplay: "long"
+      }, opts, {
+        unit: unit.slice(0, -1)
+      })).format(val);
+    }).filter(function (n) {
+      return n;
+    });
+    return this.loc.listFormatter(_extends({
+      type: "conjunction",
+      style: opts.listStyle || "narrow"
+    }, opts)).format(l);
+  }
+
+  /**
+   * Returns a JavaScript object with this Duration's values.
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+   * @return {Object}
+   */;
+  _proto.toObject = function toObject() {
+    if (!this.isValid) return {};
+    return _extends({}, this.values);
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+   * @return {string}
+   */;
+  _proto.toISO = function toISO() {
+    // we could use the formatter, but this is an easier way to get the minimum string
+    if (!this.isValid) return null;
+    var s = "P";
+    if (this.years !== 0) s += this.years + "Y";
+    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+    if (this.weeks !== 0) s += this.weeks + "W";
+    if (this.days !== 0) s += this.days + "D";
+    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0) s += "T";
+    if (this.hours !== 0) s += this.hours + "H";
+    if (this.minutes !== 0) s += this.minutes + "M";
+    if (this.seconds !== 0 || this.milliseconds !== 0)
+      // this will handle "floating point madness" by removing extra decimal places
+      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+    if (s === "P") s += "T0S";
+    return s;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+   * @return {string}
+   */;
+  _proto.toISOTime = function toISOTime(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (!this.isValid) return null;
+    var millis = this.toMillis();
+    if (millis < 0 || millis >= 86400000) return null;
+    opts = _extends({
+      suppressMilliseconds: false,
+      suppressSeconds: false,
+      includePrefix: false,
+      format: "extended"
+    }, opts, {
+      includeOffset: false
+    });
+    var dateTime = DateTime.fromMillis(millis, {
+      zone: "UTC"
+    });
+    return dateTime.toISOTime(opts);
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+   * @return {string}
+   */;
+  _proto.toJSON = function toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+   * @return {string}
+   */;
+  _proto.toString = function toString() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a string representation of this Duration appropriate for the REPL.
+   * @return {string}
+   */;
+  _proto[_Symbol$for] = function () {
+    if (this.isValid) {
+      return "Duration { values: " + JSON.stringify(this.values) + " }";
+    } else {
+      return "Duration { Invalid, reason: " + this.invalidReason + " }";
+    }
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration.
+   * @return {number}
+   */;
+  _proto.toMillis = function toMillis() {
+    if (!this.isValid) return NaN;
+    return durationToMillis(this.matrix, this.values);
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+   * @return {number}
+   */;
+  _proto.valueOf = function valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */;
+  _proto.plus = function plus(duration) {
+    if (!this.isValid) return this;
+    var dur = Duration.fromDurationLike(duration),
+      result = {};
+    for (var _i2 = 0, _orderedUnits = orderedUnits$1; _i2 < _orderedUnits.length; _i2++) {
+      var k = _orderedUnits[_i2];
+      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+        result[k] = dur.get(k) + this.get(k);
+      }
+    }
+    return clone$1(this, {
+      values: result
+    }, true);
+  }
+
+  /**
+   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */;
+  _proto.minus = function minus(duration) {
+    if (!this.isValid) return this;
+    var dur = Duration.fromDurationLike(duration);
+    return this.plus(dur.negate());
+  }
+
+  /**
+   * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+   * @return {Duration}
+   */;
+  _proto.mapUnits = function mapUnits(fn) {
+    if (!this.isValid) return this;
+    var result = {};
+    for (var _i3 = 0, _Object$keys = Object.keys(this.values); _i3 < _Object$keys.length; _i3++) {
+      var k = _Object$keys[_i3];
+      result[k] = asNumber(fn(this.values[k], k));
+    }
+    return clone$1(this, {
+      values: result
+    }, true);
+  }
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+   * @return {number}
+   */;
+  _proto.get = function get(unit) {
+    return this[Duration.normalizeUnit(unit)];
+  }
+
+  /**
+   * "Set" the values of specified units. Return a newly-constructed Duration.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dur.set({ years: 2017 })
+   * @example dur.set({ hours: 8, minutes: 30 })
+   * @return {Duration}
+   */;
+  _proto.set = function set(values) {
+    if (!this.isValid) return this;
+    var mixed = _extends({}, this.values, normalizeObject(values, Duration.normalizeUnit));
+    return clone$1(this, {
+      values: mixed
+    });
+  }
+
+  /**
+   * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+   * @example dur.reconfigure({ locale: 'en-GB' })
+   * @return {Duration}
+   */;
+  _proto.reconfigure = function reconfigure(_temp) {
+    var _ref = _temp === void 0 ? {} : _temp,
+      locale = _ref.locale,
+      numberingSystem = _ref.numberingSystem,
+      conversionAccuracy = _ref.conversionAccuracy,
+      matrix = _ref.matrix;
+    var loc = this.loc.clone({
+      locale: locale,
+      numberingSystem: numberingSystem
+    });
+    var opts = {
+      loc: loc,
+      matrix: matrix,
+      conversionAccuracy: conversionAccuracy
+    };
+    return clone$1(this, opts);
+  }
+
+  /**
+   * Return the length of the duration in the specified unit.
+   * @param {string} unit - a unit such as 'minutes' or 'days'
+   * @example Duration.fromObject({years: 1}).as('days') //=> 365
+   * @example Duration.fromObject({years: 1}).as('months') //=> 12
+   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+   * @return {number}
+   */;
+  _proto.as = function as(unit) {
+    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+  }
+
+  /**
+   * Reduce this Duration to its canonical representation in its current units.
+   * Assuming the overall value of the Duration is positive, this means:
+   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+   *   the overall value would be negative, see third example)
+   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+   *
+   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+   * @return {Duration}
+   */;
+  _proto.normalize = function normalize() {
+    if (!this.isValid) return this;
+    var vals = this.toObject();
+    normalizeValues(this.matrix, vals);
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Rescale units to its largest representation
+   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+   * @return {Duration}
+   */;
+  _proto.rescale = function rescale() {
+    if (!this.isValid) return this;
+    var vals = removeZeroes(this.normalize().shiftToAll().toObject());
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Convert this Duration into its representation in a different set of units.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+   * @return {Duration}
+   */;
+  _proto.shiftTo = function shiftTo() {
+    for (var _len = arguments.length, units = new Array(_len), _key = 0; _key < _len; _key++) {
+      units[_key] = arguments[_key];
+    }
+    if (!this.isValid) return this;
+    if (units.length === 0) {
+      return this;
+    }
+    units = units.map(function (u) {
+      return Duration.normalizeUnit(u);
+    });
+    var built = {},
+      accumulated = {},
+      vals = this.toObject();
+    var lastUnit;
+    for (var _i4 = 0, _orderedUnits2 = orderedUnits$1; _i4 < _orderedUnits2.length; _i4++) {
+      var k = _orderedUnits2[_i4];
+      if (units.indexOf(k) >= 0) {
+        lastUnit = k;
+        var own = 0;
+
+        // anything we haven't boiled down yet should get boiled to this unit
+        for (var ak in accumulated) {
+          own += this.matrix[ak][k] * accumulated[ak];
+          accumulated[ak] = 0;
+        }
+
+        // plus anything that's already in this unit
+        if (isNumber(vals[k])) {
+          own += vals[k];
+        }
+
+        // only keep the integer part for now in the hopes of putting any decimal part
+        // into a smaller unit later
+        var i = Math.trunc(own);
+        built[k] = i;
+        accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+        // otherwise, keep it in the wings to boil it later
+      } else if (isNumber(vals[k])) {
+        accumulated[k] = vals[k];
+      }
+    }
+
+    // anything leftover becomes the decimal for the last unit
+    // lastUnit must be defined since units is not empty
+    for (var key in accumulated) {
+      if (accumulated[key] !== 0) {
+        built[lastUnit] += key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+      }
+    }
+    normalizeValues(this.matrix, built);
+    return clone$1(this, {
+      values: built
+    }, true);
+  }
+
+  /**
+   * Shift this Duration to all available units.
+   * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+   * @return {Duration}
+   */;
+  _proto.shiftToAll = function shiftToAll() {
+    if (!this.isValid) return this;
+    return this.shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds");
+  }
+
+  /**
+   * Return the negative of this Duration.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+   * @return {Duration}
+   */;
+  _proto.negate = function negate() {
+    if (!this.isValid) return this;
+    var negated = {};
+    for (var _i5 = 0, _Object$keys2 = Object.keys(this.values); _i5 < _Object$keys2.length; _i5++) {
+      var k = _Object$keys2[_i5];
+      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+    }
+    return clone$1(this, {
+      values: negated
+    }, true);
+  }
+
+  /**
+   * Removes all units with values equal to 0 from this Duration.
+   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+   * @return {Duration}
+   */;
+  _proto.removeZeros = function removeZeros() {
+    if (!this.isValid) return this;
+    var vals = removeZeroes(this.values);
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Get the years.
+   * @type {number}
+   */;
+  /**
+   * Equality check
+   * Two Durations are equal iff they have the same units and the same values for each unit.
+   * @param {Duration} other
+   * @return {boolean}
+   */
+  _proto.equals = function equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+    if (!this.loc.equals(other.loc)) {
+      return false;
+    }
+    function eq(v1, v2) {
+      // Consider 0 and undefined as equal
+      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+      return v1 === v2;
+    }
+    for (var _i6 = 0, _orderedUnits3 = orderedUnits$1; _i6 < _orderedUnits3.length; _i6++) {
+      var u = _orderedUnits3[_i6];
+      if (!eq(this.values[u], other.values[u])) {
+        return false;
+      }
+    }
+    return true;
+  };
+  _createClass(Duration, [{
+    key: "locale",
+    get: function get() {
+      return this.isValid ? this.loc.locale : null;
+    }
+
+    /**
+     * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+     *
+     * @type {string}
+     */
+  }, {
+    key: "numberingSystem",
+    get: function get() {
+      return this.isValid ? this.loc.numberingSystem : null;
+    }
+  }, {
+    key: "years",
+    get: function get() {
+      return this.isValid ? this.values.years || 0 : NaN;
+    }
+
+    /**
+     * Get the quarters.
+     * @type {number}
+     */
+  }, {
+    key: "quarters",
+    get: function get() {
+      return this.isValid ? this.values.quarters || 0 : NaN;
+    }
+
+    /**
+     * Get the months.
+     * @type {number}
+     */
+  }, {
+    key: "months",
+    get: function get() {
+      return this.isValid ? this.values.months || 0 : NaN;
+    }
+
+    /**
+     * Get the weeks
+     * @type {number}
+     */
+  }, {
+    key: "weeks",
+    get: function get() {
+      return this.isValid ? this.values.weeks || 0 : NaN;
+    }
+
+    /**
+     * Get the days.
+     * @type {number}
+     */
+  }, {
+    key: "days",
+    get: function get() {
+      return this.isValid ? this.values.days || 0 : NaN;
+    }
+
+    /**
+     * Get the hours.
+     * @type {number}
+     */
+  }, {
+    key: "hours",
+    get: function get() {
+      return this.isValid ? this.values.hours || 0 : NaN;
+    }
+
+    /**
+     * Get the minutes.
+     * @type {number}
+     */
+  }, {
+    key: "minutes",
+    get: function get() {
+      return this.isValid ? this.values.minutes || 0 : NaN;
+    }
+
+    /**
+     * Get the seconds.
+     * @return {number}
+     */
+  }, {
+    key: "seconds",
+    get: function get() {
+      return this.isValid ? this.values.seconds || 0 : NaN;
+    }
+
+    /**
+     * Get the milliseconds.
+     * @return {number}
+     */
+  }, {
+    key: "milliseconds",
+    get: function get() {
+      return this.isValid ? this.values.milliseconds || 0 : NaN;
+    }
+
+    /**
+     * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+     * on invalid DateTimes or Intervals.
+     * @return {boolean}
+     */
+  }, {
+    key: "isValid",
+    get: function get() {
+      return this.invalid === null;
+    }
+
+    /**
+     * Returns an error code if this Duration became invalid, or null if the Duration is valid
+     * @return {string}
+     */
+  }, {
+    key: "invalidReason",
+    get: function get() {
+      return this.invalid ? this.invalid.reason : null;
+    }
+
+    /**
+     * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+     * @type {string}
+     */
+  }, {
+    key: "invalidExplanation",
+    get: function get() {
+      return this.invalid ? this.invalid.explanation : null;
+    }
+  }]);
+  return Duration;
+}(Symbol.for("nodejs.util.inspect.custom"));
+
+var INVALID$1 = "Invalid Interval";
+
+// checks if the start is equal to or before the end
+function validateStartEnd(start, end) {
+  if (!start || !start.isValid) {
+    return Interval.invalid("missing or invalid start");
+  } else if (!end || !end.isValid) {
+    return Interval.invalid("missing or invalid end");
+  } else if (end < start) {
+    return Interval.invalid("end before start", "The end of an interval must be after its start, but you had start=" + start.toISO() + " and end=" + end.toISO());
+  } else {
+    return null;
+  }
+}
+
+/**
+ * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+ *
+ * Here is a brief overview of the most commonly used methods and getters in Interval:
+ *
+ * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+ * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+ * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+ * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+ * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+ * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+ */
+var Interval = /*#__PURE__*/function (_Symbol$for) {
+  /**
+   * @private
+   */
+  function Interval(config) {
+    /**
+     * @access private
+     */
+    this.s = config.start;
+    /**
+     * @access private
+     */
+    this.e = config.end;
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.isLuxonInterval = true;
+  }
+
+  /**
+   * Create an invalid Interval.
+   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Interval}
+   */
+  Interval.invalid = function invalid(reason, explanation) {
+    if (explanation === void 0) {
+      explanation = null;
+    }
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+    }
+    var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidIntervalError(invalid);
+    } else {
+      return new Interval({
+        invalid: invalid
+      });
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+   * @param {DateTime|Date|Object} start
+   * @param {DateTime|Date|Object} end
+   * @return {Interval}
+   */;
+  Interval.fromDateTimes = function fromDateTimes(start, end) {
+    var builtStart = friendlyDateTime(start),
+      builtEnd = friendlyDateTime(end);
+    var validateError = validateStartEnd(builtStart, builtEnd);
+    if (validateError == null) {
+      return new Interval({
+        start: builtStart,
+        end: builtEnd
+      });
+    } else {
+      return validateError;
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and a Duration to extend to.
+   * @param {DateTime|Date|Object} start
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */;
+  Interval.after = function after(start, duration) {
+    var dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(start);
+    return Interval.fromDateTimes(dt, dt.plus(dur));
+  }
+
+  /**
+   * Create an Interval from an end DateTime and a Duration to extend backwards to.
+   * @param {DateTime|Date|Object} end
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */;
+  Interval.before = function before(end, duration) {
+    var dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(end);
+    return Interval.fromDateTimes(dt.minus(dur), dt);
+  }
+
+  /**
+   * Create an Interval from an ISO 8601 string.
+   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+   * @param {string} text - the ISO string to parse
+   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {Interval}
+   */;
+  Interval.fromISO = function fromISO(text, opts) {
+    var _split = (text || "").split("/", 2),
+      s = _split[0],
+      e = _split[1];
+    if (s && e) {
+      var start, startIsValid;
+      try {
+        start = DateTime.fromISO(s, opts);
+        startIsValid = start.isValid;
+      } catch (e) {
+        startIsValid = false;
+      }
+      var end, endIsValid;
+      try {
+        end = DateTime.fromISO(e, opts);
+        endIsValid = end.isValid;
+      } catch (e) {
+        endIsValid = false;
+      }
+      if (startIsValid && endIsValid) {
+        return Interval.fromDateTimes(start, end);
+      }
+      if (startIsValid) {
+        var dur = Duration.fromISO(e, opts);
+        if (dur.isValid) {
+          return Interval.after(start, dur);
+        }
+      } else if (endIsValid) {
+        var _dur = Duration.fromISO(s, opts);
+        if (_dur.isValid) {
+          return Interval.before(end, _dur);
+        }
+      }
+    }
+    return Interval.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+  }
+
+  /**
+   * Check if an object is an Interval. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */;
+  Interval.isInterval = function isInterval(o) {
+    return o && o.isLuxonInterval || false;
+  }
+
+  /**
+   * Returns the start of the Interval
+   * @type {DateTime}
+   */;
+  var _proto = Interval.prototype;
+  /**
+   * Returns the length of the Interval in the specified unit.
+   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+   * @return {number}
+   */
+  _proto.length = function length(unit) {
+    if (unit === void 0) {
+      unit = "milliseconds";
+    }
+    return this.isValid ? this.toDuration.apply(this, [unit]).get(unit) : NaN;
+  }
+
+  /**
+   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+   * @param {string} [unit='milliseconds'] - the unit of time to count.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+   * @return {number}
+   */;
+  _proto.count = function count(unit, opts) {
+    if (unit === void 0) {
+      unit = "milliseconds";
+    }
+    if (!this.isValid) return NaN;
+    var start = this.start.startOf(unit, opts);
+    var end;
+    if (opts != null && opts.useLocaleWeeks) {
+      end = this.end.reconfigure({
+        locale: start.locale
+      });
+    } else {
+      end = this.end;
+    }
+    end = end.startOf(unit, opts);
+    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+  }
+
+  /**
+   * Returns whether this Interval's start and end are both in the same unit of time
+   * @param {string} unit - the unit of time to check sameness on
+   * @return {boolean}
+   */;
+  _proto.hasSame = function hasSame(unit) {
+    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end DateTimes.
+   * @return {boolean}
+   */;
+  _proto.isEmpty = function isEmpty() {
+    return this.s.valueOf() === this.e.valueOf();
+  }
+
+  /**
+   * Return whether this Interval's start is after the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */;
+  _proto.isAfter = function isAfter(dateTime) {
+    if (!this.isValid) return false;
+    return this.s > dateTime;
+  }
+
+  /**
+   * Return whether this Interval's end is before the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */;
+  _proto.isBefore = function isBefore(dateTime) {
+    if (!this.isValid) return false;
+    return this.e <= dateTime;
+  }
+
+  /**
+   * Return whether this Interval contains the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */;
+  _proto.contains = function contains(dateTime) {
+    if (!this.isValid) return false;
+    return this.s <= dateTime && this.e > dateTime;
+  }
+
+  /**
+   * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+   * @param {Object} values - the values to set
+   * @param {DateTime} values.start - the starting DateTime
+   * @param {DateTime} values.end - the ending DateTime
+   * @return {Interval}
+   */;
+  _proto.set = function set(_temp) {
+    var _ref = _temp === void 0 ? {} : _temp,
+      start = _ref.start,
+      end = _ref.end;
+    if (!this.isValid) return this;
+    return Interval.fromDateTimes(start || this.s, end || this.e);
+  }
+
+  /**
+   * Split this Interval at each of the specified DateTimes
+   * @param {...DateTime} dateTimes - the unit of time to count.
+   * @return {Array}
+   */;
+  _proto.splitAt = function splitAt() {
+    var _this = this;
+    if (!this.isValid) return [];
+    for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+      dateTimes[_key] = arguments[_key];
+    }
+    var sorted = dateTimes.map(friendlyDateTime).filter(function (d) {
+        return _this.contains(d);
+      }).sort(function (a, b) {
+        return a.toMillis() - b.toMillis();
+      }),
+      results = [];
+    var s = this.s,
+      i = 0;
+    while (s < this.e) {
+      var added = sorted[i] || this.e,
+        next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      i += 1;
+    }
+    return results;
+  }
+
+  /**
+   * Split this Interval into smaller Intervals, each of the specified length.
+   * Left over time is grouped into a smaller interval
+   * @param {Duration|Object|number} duration - The length of each resulting interval.
+   * @return {Array}
+   */;
+  _proto.splitBy = function splitBy(duration) {
+    var dur = Duration.fromDurationLike(duration);
+    if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+      return [];
+    }
+    var s = this.s,
+      idx = 1,
+      next;
+    var results = [];
+    while (s < this.e) {
+      var added = this.start.plus(dur.mapUnits(function (x) {
+        return x * idx;
+      }));
+      next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      idx += 1;
+    }
+    return results;
+  }
+
+  /**
+   * Split this Interval into the specified number of smaller intervals.
+   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+   * @return {Array}
+   */;
+  _proto.divideEqually = function divideEqually(numberOfParts) {
+    if (!this.isValid) return [];
+    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+  }
+
+  /**
+   * Return whether this Interval overlaps with the specified Interval
+   * @param {Interval} other
+   * @return {boolean}
+   */;
+  _proto.overlaps = function overlaps(other) {
+    return this.e > other.s && this.s < other.e;
+  }
+
+  /**
+   * Return whether this Interval's end is adjacent to the specified Interval's start.
+   * @param {Interval} other
+   * @return {boolean}
+   */;
+  _proto.abutsStart = function abutsStart(other) {
+    if (!this.isValid) return false;
+    return +this.e === +other.s;
+  }
+
+  /**
+   * Return whether this Interval's start is adjacent to the specified Interval's end.
+   * @param {Interval} other
+   * @return {boolean}
+   */;
+  _proto.abutsEnd = function abutsEnd(other) {
+    if (!this.isValid) return false;
+    return +other.e === +this.s;
+  }
+
+  /**
+   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+   * @param {Interval} other
+   * @return {boolean}
+   */;
+  _proto.engulfs = function engulfs(other) {
+    if (!this.isValid) return false;
+    return this.s <= other.s && this.e >= other.e;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end as the specified Interval.
+   * @param {Interval} other
+   * @return {boolean}
+   */;
+  _proto.equals = function equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+    return this.s.equals(other.s) && this.e.equals(other.e);
+  }
+
+  /**
+   * Return an Interval representing the intersection of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+   * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+   * @param {Interval} other
+   * @return {Interval}
+   */;
+  _proto.intersection = function intersection(other) {
+    if (!this.isValid) return this;
+    var s = this.s > other.s ? this.s : other.s,
+      e = this.e < other.e ? this.e : other.e;
+    if (s >= e) {
+      return null;
+    } else {
+      return Interval.fromDateTimes(s, e);
+    }
+  }
+
+  /**
+   * Return an Interval representing the union of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+   * @param {Interval} other
+   * @return {Interval}
+   */;
+  _proto.union = function union(other) {
+    if (!this.isValid) return this;
+    var s = this.s < other.s ? this.s : other.s,
+      e = this.e > other.e ? this.e : other.e;
+    return Interval.fromDateTimes(s, e);
+  }
+
+  /**
+   * Merge an array of Intervals into an equivalent minimal set of Intervals.
+   * Combines overlapping and adjacent Intervals.
+   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+   * and ending with the latest.
+   *
+   * @param {Array} intervals
+   * @return {Array}
+   */;
+  Interval.merge = function merge(intervals) {
+    var _intervals$sort$reduc = intervals.sort(function (a, b) {
+        return a.s - b.s;
+      }).reduce(function (_ref2, item) {
+        var sofar = _ref2[0],
+          current = _ref2[1];
+        if (!current) {
+          return [sofar, item];
+        } else if (current.overlaps(item) || current.abutsStart(item)) {
+          return [sofar, current.union(item)];
+        } else {
+          return [sofar.concat([current]), item];
+        }
+      }, [[], null]),
+      found = _intervals$sort$reduc[0],
+      final = _intervals$sort$reduc[1];
+    if (final) {
+      found.push(final);
+    }
+    return found;
+  }
+
+  /**
+   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+   * @param {Array} intervals
+   * @return {Array}
+   */;
+  Interval.xor = function xor(intervals) {
+    var _Array$prototype;
+    var start = null,
+      currentCount = 0;
+    var results = [],
+      ends = intervals.map(function (i) {
+        return [{
+          time: i.s,
+          type: "s"
+        }, {
+          time: i.e,
+          type: "e"
+        }];
+      }),
+      flattened = (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, ends),
+      arr = flattened.sort(function (a, b) {
+        return a.time - b.time;
+      });
+    for (var _iterator = _createForOfIteratorHelperLoose(arr), _step; !(_step = _iterator()).done;) {
+      var i = _step.value;
+      currentCount += i.type === "s" ? 1 : -1;
+      if (currentCount === 1) {
+        start = i.time;
+      } else {
+        if (start && +start !== +i.time) {
+          results.push(Interval.fromDateTimes(start, i.time));
+        }
+        start = null;
+      }
+    }
+    return Interval.merge(results);
+  }
+
+  /**
+   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+   * @param {...Interval} intervals
+   * @return {Array}
+   */;
+  _proto.difference = function difference() {
+    var _this2 = this;
+    for (var _len2 = arguments.length, intervals = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      intervals[_key2] = arguments[_key2];
+    }
+    return Interval.xor([this].concat(intervals)).map(function (i) {
+      return _this2.intersection(i);
+    }).filter(function (i) {
+      return i && !i.isEmpty();
+    });
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for debugging.
+   * @return {string}
+   */;
+  _proto.toString = function toString() {
+    if (!this.isValid) return INVALID$1;
+    return "[" + this.s.toISO() + " \u2013 " + this.e.toISO() + ")";
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for the REPL.
+   * @return {string}
+   */;
+  _proto[_Symbol$for] = function () {
+    if (this.isValid) {
+      return "Interval { start: " + this.s.toISO() + ", end: " + this.e.toISO() + " }";
+    } else {
+      return "Interval { Invalid, reason: " + this.invalidReason + " }";
+    }
+  }
+
+  /**
+   * Returns a localized string representing this Interval. Accepts the same options as the
+   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+   * is browser-specific, but in general it will return an appropriate representation of the
+   * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+   * specified.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+   * Intl.DateTimeFormat constructor options.
+   * @param {Object} opts - Options to override the configuration of the start DateTime.
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+   * @return {string}
+   */;
+  _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+    if (formatOpts === void 0) {
+      formatOpts = DATE_SHORT;
+    }
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.isValid ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this) : INVALID$1;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Interval.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */;
+  _proto.toISO = function toISO(opts) {
+    if (!this.isValid) return INVALID$1;
+    return this.s.toISO(opts) + "/" + this.e.toISO(opts);
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of date of this Interval.
+   * The time components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {string}
+   */;
+  _proto.toISODate = function toISODate() {
+    if (!this.isValid) return INVALID$1;
+    return this.s.toISODate() + "/" + this.e.toISODate();
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of time of this Interval.
+   * The date components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */;
+  _proto.toISOTime = function toISOTime(opts) {
+    if (!this.isValid) return INVALID$1;
+    return this.s.toISOTime(opts) + "/" + this.e.toISOTime(opts);
+  }
+
+  /**
+   * Returns a string representation of this Interval formatted according to the specified format
+   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+   * formatting tool.
+   * @param {string} dateFormat - The format string. This string formats the start and end time.
+   * See {@link DateTime#toFormat} for details.
+   * @param {Object} opts - Options.
+   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+   * representations.
+   * @return {string}
+   */;
+  _proto.toFormat = function toFormat(dateFormat, _temp2) {
+    var _ref3 = _temp2 === void 0 ? {} : _temp2,
+      _ref3$separator = _ref3.separator,
+      separator = _ref3$separator === void 0 ? " – " : _ref3$separator;
+    if (!this.isValid) return INVALID$1;
+    return "" + this.s.toFormat(dateFormat) + separator + this.e.toFormat(dateFormat);
+  }
+
+  /**
+   * Return a Duration representing the time spanned by this interval.
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+   * @return {Duration}
+   */;
+  _proto.toDuration = function toDuration(unit, opts) {
+    if (!this.isValid) {
+      return Duration.invalid(this.invalidReason);
+    }
+    return this.e.diff(this.s, unit, opts);
+  }
+
+  /**
+   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+   * @param {function} mapFn
+   * @return {Interval}
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+   */;
+  _proto.mapEndpoints = function mapEndpoints(mapFn) {
+    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+  };
+  _createClass(Interval, [{
+    key: "start",
+    get: function get() {
+      return this.isValid ? this.s : null;
+    }
+
+    /**
+     * Returns the end of the Interval. This is the first instant which is not part of the interval
+     * (Interval is half-open).
+     * @type {DateTime}
+     */
+  }, {
+    key: "end",
+    get: function get() {
+      return this.isValid ? this.e : null;
+    }
+
+    /**
+     * Returns the last DateTime included in the interval (since end is not part of the interval)
+     * @type {DateTime}
+     */
+  }, {
+    key: "lastDateTime",
+    get: function get() {
+      return this.isValid ? this.e ? this.e.minus(1) : null : null;
+    }
+
+    /**
+     * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+     * @type {boolean}
+     */
+  }, {
+    key: "isValid",
+    get: function get() {
+      return this.invalidReason === null;
+    }
+
+    /**
+     * Returns an error code if this Interval is invalid, or null if the Interval is valid
+     * @type {string}
+     */
+  }, {
+    key: "invalidReason",
+    get: function get() {
+      return this.invalid ? this.invalid.reason : null;
+    }
+
+    /**
+     * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+     * @type {string}
+     */
+  }, {
+    key: "invalidExplanation",
+    get: function get() {
+      return this.invalid ? this.invalid.explanation : null;
+    }
+  }]);
+  return Interval;
+}(Symbol.for("nodejs.util.inspect.custom"));
+
+/**
+ * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+ */
+var Info = /*#__PURE__*/function () {
+  function Info() {}
+  /**
+   * Return whether the specified zone contains a DST.
+   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+   * @return {boolean}
+   */
+  Info.hasDST = function hasDST(zone) {
+    if (zone === void 0) {
+      zone = Settings.defaultZone;
+    }
+    var proto = DateTime.now().setZone(zone).set({
+      month: 12
+    });
+    return !zone.isUniversal && proto.offset !== proto.set({
+      month: 6
+    }).offset;
+  }
+
+  /**
+   * Return whether the specified zone is a valid IANA specifier.
+   * @param {string} zone - Zone to check
+   * @return {boolean}
+   */;
+  Info.isValidIANAZone = function isValidIANAZone(zone) {
+    return IANAZone.isValidZone(zone);
+  }
+
+  /**
+   * Converts the input into a {@link Zone} instance.
+   *
+   * * If `input` is already a Zone instance, it is returned unchanged.
+   * * If `input` is a string containing a valid time zone name, a Zone instance
+   *   with that name is returned.
+   * * If `input` is a string that doesn't refer to a known time zone, a Zone
+   *   instance with {@link Zone#isValid} == false is returned.
+   * * If `input is a number, a Zone instance with the specified fixed offset
+   *   in minutes is returned.
+   * * If `input` is `null` or `undefined`, the default zone is returned.
+   * @param {string|Zone|number} [input] - the value to be converted
+   * @return {Zone}
+   */;
+  Info.normalizeZone = function normalizeZone$1(input) {
+    return normalizeZone(input, Settings.defaultZone);
+  }
+
+  /**
+   * Get the weekday on which the week starts according to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+   */;
+  Info.getStartOfWeek = function getStartOfWeek(_temp) {
+    var _ref = _temp === void 0 ? {} : _temp,
+      _ref$locale = _ref.locale,
+      locale = _ref$locale === void 0 ? null : _ref$locale,
+      _ref$locObj = _ref.locObj,
+      locObj = _ref$locObj === void 0 ? null : _ref$locObj;
+    return (locObj || Locale.create(locale)).getStartOfWeek();
+  }
+
+  /**
+   * Get the minimum number of days necessary in a week before it is considered part of the next year according
+   * to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number}
+   */;
+  Info.getMinimumDaysInFirstWeek = function getMinimumDaysInFirstWeek(_temp2) {
+    var _ref2 = _temp2 === void 0 ? {} : _temp2,
+      _ref2$locale = _ref2.locale,
+      locale = _ref2$locale === void 0 ? null : _ref2$locale,
+      _ref2$locObj = _ref2.locObj,
+      locObj = _ref2$locObj === void 0 ? null : _ref2$locObj;
+    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+  }
+
+  /**
+   * Get the weekdays, which are considered the weekend according to the given locale
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+   */;
+  Info.getWeekendWeekdays = function getWeekendWeekdays(_temp3) {
+    var _ref3 = _temp3 === void 0 ? {} : _temp3,
+      _ref3$locale = _ref3.locale,
+      locale = _ref3$locale === void 0 ? null : _ref3$locale,
+      _ref3$locObj = _ref3.locObj,
+      locObj = _ref3$locObj === void 0 ? null : _ref3$locObj;
+    // copy the array, because we cache it internally
+    return (locObj || Locale.create(locale)).getWeekendDays().slice();
+  }
+
+  /**
+   * Return an array of standalone month names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @example Info.months()[0] //=> 'January'
+   * @example Info.months('short')[0] //=> 'Jan'
+   * @example Info.months('numeric')[0] //=> '1'
+   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+   * @return {Array}
+   */;
+  Info.months = function months(length, _temp4) {
+    if (length === void 0) {
+      length = "long";
+    }
+    var _ref4 = _temp4 === void 0 ? {} : _temp4,
+      _ref4$locale = _ref4.locale,
+      locale = _ref4$locale === void 0 ? null : _ref4$locale,
+      _ref4$numberingSystem = _ref4.numberingSystem,
+      numberingSystem = _ref4$numberingSystem === void 0 ? null : _ref4$numberingSystem,
+      _ref4$locObj = _ref4.locObj,
+      locObj = _ref4$locObj === void 0 ? null : _ref4$locObj,
+      _ref4$outputCalendar = _ref4.outputCalendar,
+      outputCalendar = _ref4$outputCalendar === void 0 ? "gregory" : _ref4$outputCalendar;
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+  }
+
+  /**
+   * Return an array of format month names.
+   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+   * changes the string.
+   * See {@link Info#months}
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @return {Array}
+   */;
+  Info.monthsFormat = function monthsFormat(length, _temp5) {
+    if (length === void 0) {
+      length = "long";
+    }
+    var _ref5 = _temp5 === void 0 ? {} : _temp5,
+      _ref5$locale = _ref5.locale,
+      locale = _ref5$locale === void 0 ? null : _ref5$locale,
+      _ref5$numberingSystem = _ref5.numberingSystem,
+      numberingSystem = _ref5$numberingSystem === void 0 ? null : _ref5$numberingSystem,
+      _ref5$locObj = _ref5.locObj,
+      locObj = _ref5$locObj === void 0 ? null : _ref5$locObj,
+      _ref5$outputCalendar = _ref5.outputCalendar,
+      outputCalendar = _ref5$outputCalendar === void 0 ? "gregory" : _ref5$outputCalendar;
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+  }
+
+  /**
+   * Return an array of standalone week names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @example Info.weekdays()[0] //=> 'Monday'
+   * @example Info.weekdays('short')[0] //=> 'Mon'
+   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+   * @return {Array}
+   */;
+  Info.weekdays = function weekdays(length, _temp6) {
+    if (length === void 0) {
+      length = "long";
+    }
+    var _ref6 = _temp6 === void 0 ? {} : _temp6,
+      _ref6$locale = _ref6.locale,
+      locale = _ref6$locale === void 0 ? null : _ref6$locale,
+      _ref6$numberingSystem = _ref6.numberingSystem,
+      numberingSystem = _ref6$numberingSystem === void 0 ? null : _ref6$numberingSystem,
+      _ref6$locObj = _ref6.locObj,
+      locObj = _ref6$locObj === void 0 ? null : _ref6$locObj;
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+  }
+
+  /**
+   * Return an array of format week names.
+   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+   * changes the string.
+   * See {@link Info#weekdays}
+   * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale=null] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @return {Array}
+   */;
+  Info.weekdaysFormat = function weekdaysFormat(length, _temp7) {
+    if (length === void 0) {
+      length = "long";
+    }
+    var _ref7 = _temp7 === void 0 ? {} : _temp7,
+      _ref7$locale = _ref7.locale,
+      locale = _ref7$locale === void 0 ? null : _ref7$locale,
+      _ref7$numberingSystem = _ref7.numberingSystem,
+      numberingSystem = _ref7$numberingSystem === void 0 ? null : _ref7$numberingSystem,
+      _ref7$locObj = _ref7.locObj,
+      locObj = _ref7$locObj === void 0 ? null : _ref7$locObj;
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+  }
+
+  /**
+   * Return an array of meridiems.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+   * @return {Array}
+   */;
+  Info.meridiems = function meridiems(_temp8) {
+    var _ref8 = _temp8 === void 0 ? {} : _temp8,
+      _ref8$locale = _ref8.locale,
+      locale = _ref8$locale === void 0 ? null : _ref8$locale;
+    return Locale.create(locale).meridiems();
+  }
+
+  /**
+   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+   * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.eras() //=> [ 'BC', 'AD' ]
+   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+   * @return {Array}
+   */;
+  Info.eras = function eras(length, _temp9) {
+    if (length === void 0) {
+      length = "short";
+    }
+    var _ref9 = _temp9 === void 0 ? {} : _temp9,
+      _ref9$locale = _ref9.locale,
+      locale = _ref9$locale === void 0 ? null : _ref9$locale;
+    return Locale.create(locale, null, "gregory").eras(length);
+  }
+
+  /**
+   * Return the set of available features in this environment.
+   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+   * Keys:
+   * * `relative`: whether this environment supports relative time formatting
+   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+   * @example Info.features() //=> { relative: false, localeWeek: true }
+   * @return {Object}
+   */;
+  Info.features = function features() {
+    return {
+      relative: hasRelative(),
+      localeWeek: hasLocaleWeekInfo()
+    };
+  };
+  return Info;
+}();
+
+function dayDiff(earlier, later) {
+  var utcDayStart = function utcDayStart(dt) {
+      return dt.toUTC(0, {
+        keepLocalTime: true
+      }).startOf("day").valueOf();
+    },
+    ms = utcDayStart(later) - utcDayStart(earlier);
+  return Math.floor(Duration.fromMillis(ms).as("days"));
+}
+function highOrderDiffs(cursor, later, units) {
+  var differs = [["years", function (a, b) {
+    return b.year - a.year;
+  }], ["quarters", function (a, b) {
+    return b.quarter - a.quarter + (b.year - a.year) * 4;
+  }], ["months", function (a, b) {
+    return b.month - a.month + (b.year - a.year) * 12;
+  }], ["weeks", function (a, b) {
+    var days = dayDiff(a, b);
+    return (days - days % 7) / 7;
+  }], ["days", dayDiff]];
+  var results = {};
+  var earlier = cursor;
+  var lowestOrder, highWater;
+
+  /* This loop tries to diff using larger units first.
+     If we overshoot, we backtrack and try the next smaller unit.
+     "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+     as we use smaller and smaller units.
+     highWater keeps track of where we would be if we added one more of the smallest unit,
+     this is used later to potentially convert any difference smaller than the smallest higher order unit
+     into a fraction of that smallest higher order unit
+  */
+  for (var _i = 0, _differs = differs; _i < _differs.length; _i++) {
+    var _differs$_i = _differs[_i],
+      unit = _differs$_i[0],
+      differ = _differs$_i[1];
+    if (units.indexOf(unit) >= 0) {
+      lowestOrder = unit;
+      results[unit] = differ(cursor, later);
+      highWater = earlier.plus(results);
+      if (highWater > later) {
+        // we overshot the end point, backtrack cursor by 1
+        results[unit]--;
+        cursor = earlier.plus(results);
+
+        // if we are still overshooting now, we need to backtrack again
+        // this happens in certain situations when diffing times in different zones,
+        // because this calculation ignores time zones
+        if (cursor > later) {
+          // keep the "overshot by 1" around as highWater
+          highWater = cursor;
+          // backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+        }
+      } else {
+        cursor = highWater;
+      }
+    }
+  }
+  return [cursor, results, highWater, lowestOrder];
+}
+function _diff (earlier, later, units, opts) {
+  var _highOrderDiffs = highOrderDiffs(earlier, later, units),
+    cursor = _highOrderDiffs[0],
+    results = _highOrderDiffs[1],
+    highWater = _highOrderDiffs[2],
+    lowestOrder = _highOrderDiffs[3];
+  var remainingMillis = later - cursor;
+  var lowerOrderUnits = units.filter(function (u) {
+    return ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0;
+  });
+  if (lowerOrderUnits.length === 0) {
+    if (highWater < later) {
+      var _cursor$plus;
+      highWater = cursor.plus((_cursor$plus = {}, _cursor$plus[lowestOrder] = 1, _cursor$plus));
+    }
+    if (highWater !== cursor) {
+      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+    }
+  }
+  var duration = Duration.fromObject(results, opts);
+  if (lowerOrderUnits.length > 0) {
+    var _Duration$fromMillis;
+    return (_Duration$fromMillis = Duration.fromMillis(remainingMillis, opts)).shiftTo.apply(_Duration$fromMillis, lowerOrderUnits).plus(duration);
+  } else {
+    return duration;
+  }
+}
+
+var MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+function intUnit(regex, post) {
+  if (post === void 0) {
+    post = function post(i) {
+      return i;
+    };
+  }
+  return {
+    regex: regex,
+    deser: function deser(_ref) {
+      var s = _ref[0];
+      return post(parseDigits(s));
+    }
+  };
+}
+var NBSP = String.fromCharCode(160);
+var spaceOrNBSP = "[ " + NBSP + "]";
+var spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+function fixListRegex(s) {
+  // make dots optional and also make them literal
+  // make space and non breakable space characters interchangeable
+  return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+}
+function stripInsensitivities(s) {
+  return s.replace(/\./g, "") // ignore dots that were made optional
+  .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+  .toLowerCase();
+}
+function oneOf(strings, startIndex) {
+  if (strings === null) {
+    return null;
+  } else {
+    return {
+      regex: RegExp(strings.map(fixListRegex).join("|")),
+      deser: function deser(_ref2) {
+        var s = _ref2[0];
+        return strings.findIndex(function (i) {
+          return stripInsensitivities(s) === stripInsensitivities(i);
+        }) + startIndex;
+      }
+    };
+  }
+}
+function offset(regex, groups) {
+  return {
+    regex: regex,
+    deser: function deser(_ref3) {
+      var h = _ref3[1],
+        m = _ref3[2];
+      return signedOffset(h, m);
+    },
+    groups: groups
+  };
+}
+function simple(regex) {
+  return {
+    regex: regex,
+    deser: function deser(_ref4) {
+      var s = _ref4[0];
+      return s;
+    }
+  };
+}
+function escapeToken(value) {
+  return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+}
+
+/**
+ * @param token
+ * @param {Locale} loc
+ */
+function unitForToken(token, loc) {
+  var one = digitRegex(loc),
+    two = digitRegex(loc, "{2}"),
+    three = digitRegex(loc, "{3}"),
+    four = digitRegex(loc, "{4}"),
+    six = digitRegex(loc, "{6}"),
+    oneOrTwo = digitRegex(loc, "{1,2}"),
+    oneToThree = digitRegex(loc, "{1,3}"),
+    oneToSix = digitRegex(loc, "{1,6}"),
+    oneToNine = digitRegex(loc, "{1,9}"),
+    twoToFour = digitRegex(loc, "{2,4}"),
+    fourToSix = digitRegex(loc, "{4,6}"),
+    literal = function literal(t) {
+      return {
+        regex: RegExp(escapeToken(t.val)),
+        deser: function deser(_ref5) {
+          var s = _ref5[0];
+          return s;
+        },
+        literal: true
+      };
+    },
+    unitate = function unitate(t) {
+      if (token.literal) {
+        return literal(t);
+      }
+      switch (t.val) {
+        // era
+        case "G":
+          return oneOf(loc.eras("short"), 0);
+        case "GG":
+          return oneOf(loc.eras("long"), 0);
+        // years
+        case "y":
+          return intUnit(oneToSix);
+        case "yy":
+          return intUnit(twoToFour, untruncateYear);
+        case "yyyy":
+          return intUnit(four);
+        case "yyyyy":
+          return intUnit(fourToSix);
+        case "yyyyyy":
+          return intUnit(six);
+        // months
+        case "M":
+          return intUnit(oneOrTwo);
+        case "MM":
+          return intUnit(two);
+        case "MMM":
+          return oneOf(loc.months("short", true), 1);
+        case "MMMM":
+          return oneOf(loc.months("long", true), 1);
+        case "L":
+          return intUnit(oneOrTwo);
+        case "LL":
+          return intUnit(two);
+        case "LLL":
+          return oneOf(loc.months("short", false), 1);
+        case "LLLL":
+          return oneOf(loc.months("long", false), 1);
+        // dates
+        case "d":
+          return intUnit(oneOrTwo);
+        case "dd":
+          return intUnit(two);
+        // ordinals
+        case "o":
+          return intUnit(oneToThree);
+        case "ooo":
+          return intUnit(three);
+        // time
+        case "HH":
+          return intUnit(two);
+        case "H":
+          return intUnit(oneOrTwo);
+        case "hh":
+          return intUnit(two);
+        case "h":
+          return intUnit(oneOrTwo);
+        case "mm":
+          return intUnit(two);
+        case "m":
+          return intUnit(oneOrTwo);
+        case "q":
+          return intUnit(oneOrTwo);
+        case "qq":
+          return intUnit(two);
+        case "s":
+          return intUnit(oneOrTwo);
+        case "ss":
+          return intUnit(two);
+        case "S":
+          return intUnit(oneToThree);
+        case "SSS":
+          return intUnit(three);
+        case "u":
+          return simple(oneToNine);
+        case "uu":
+          return simple(oneOrTwo);
+        case "uuu":
+          return intUnit(one);
+        // meridiem
+        case "a":
+          return oneOf(loc.meridiems(), 0);
+        // weekYear (k)
+        case "kkkk":
+          return intUnit(four);
+        case "kk":
+          return intUnit(twoToFour, untruncateYear);
+        // weekNumber (W)
+        case "W":
+          return intUnit(oneOrTwo);
+        case "WW":
+          return intUnit(two);
+        // weekdays
+        case "E":
+        case "c":
+          return intUnit(one);
+        case "EEE":
+          return oneOf(loc.weekdays("short", false), 1);
+        case "EEEE":
+          return oneOf(loc.weekdays("long", false), 1);
+        case "ccc":
+          return oneOf(loc.weekdays("short", true), 1);
+        case "cccc":
+          return oneOf(loc.weekdays("long", true), 1);
+        // offset/zone
+        case "Z":
+        case "ZZ":
+          return offset(new RegExp("([+-]" + oneOrTwo.source + ")(?::(" + two.source + "))?"), 2);
+        case "ZZZ":
+          return offset(new RegExp("([+-]" + oneOrTwo.source + ")(" + two.source + ")?"), 2);
+        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+        // because we don't have any way to figure out what they are
+        case "z":
+          return simple(/[a-z_+-/]{1,256}?/i);
+        // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+        // in this case we accept any non-newline white-space
+        case " ":
+          return simple(/[^\S\n\r]/);
+        default:
+          return literal(t);
+      }
+    };
+  var unit = unitate(token) || {
+    invalidReason: MISSING_FTP
+  };
+  unit.token = token;
+  return unit;
+}
+var partTypeStyleToTokenVal = {
+  year: {
+    "2-digit": "yy",
+    numeric: "yyyyy"
+  },
+  month: {
+    numeric: "M",
+    "2-digit": "MM",
+    short: "MMM",
+    long: "MMMM"
+  },
+  day: {
+    numeric: "d",
+    "2-digit": "dd"
+  },
+  weekday: {
+    short: "EEE",
+    long: "EEEE"
+  },
+  dayperiod: "a",
+  dayPeriod: "a",
+  hour12: {
+    numeric: "h",
+    "2-digit": "hh"
+  },
+  hour24: {
+    numeric: "H",
+    "2-digit": "HH"
+  },
+  minute: {
+    numeric: "m",
+    "2-digit": "mm"
+  },
+  second: {
+    numeric: "s",
+    "2-digit": "ss"
+  },
+  timeZoneName: {
+    long: "ZZZZZ",
+    short: "ZZZ"
+  }
+};
+function tokenForPart(part, formatOpts, resolvedOpts) {
+  var type = part.type,
+    value = part.value;
+  if (type === "literal") {
+    var isSpace = /^\s+$/.test(value);
+    return {
+      literal: !isSpace,
+      val: isSpace ? " " : value
+    };
+  }
+  var style = formatOpts[type];
+
+  // The user might have explicitly specified hour12 or hourCycle
+  // if so, respect their decision
+  // if not, refer back to the resolvedOpts, which are based on the locale
+  var actualType = type;
+  if (type === "hour") {
+    if (formatOpts.hour12 != null) {
+      actualType = formatOpts.hour12 ? "hour12" : "hour24";
+    } else if (formatOpts.hourCycle != null) {
+      if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+        actualType = "hour12";
+      } else {
+        actualType = "hour24";
+      }
+    } else {
+      // tokens only differentiate between 24 hours or not,
+      // so we do not need to check hourCycle here, which is less supported anyways
+      actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+    }
+  }
+  var val = partTypeStyleToTokenVal[actualType];
+  if (typeof val === "object") {
+    val = val[style];
+  }
+  if (val) {
+    return {
+      literal: false,
+      val: val
+    };
+  }
+  return undefined;
+}
+function buildRegex(units) {
+  var re = units.map(function (u) {
+    return u.regex;
+  }).reduce(function (f, r) {
+    return f + "(" + r.source + ")";
+  }, "");
+  return ["^" + re + "$", units];
+}
+function match(input, regex, handlers) {
+  var matches = input.match(regex);
+  if (matches) {
+    var all = {};
+    var matchIndex = 1;
+    for (var i in handlers) {
+      if (hasOwnProperty(handlers, i)) {
+        var h = handlers[i],
+          groups = h.groups ? h.groups + 1 : 1;
+        if (!h.literal && h.token) {
+          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+        }
+        matchIndex += groups;
+      }
+    }
+    return [matches, all];
+  } else {
+    return [matches, {}];
+  }
+}
+function dateTimeFromMatches(matches) {
+  var toField = function toField(token) {
+    switch (token) {
+      case "S":
+        return "millisecond";
+      case "s":
+        return "second";
+      case "m":
+        return "minute";
+      case "h":
+      case "H":
+        return "hour";
+      case "d":
+        return "day";
+      case "o":
+        return "ordinal";
+      case "L":
+      case "M":
+        return "month";
+      case "y":
+        return "year";
+      case "E":
+      case "c":
+        return "weekday";
+      case "W":
+        return "weekNumber";
+      case "k":
+        return "weekYear";
+      case "q":
+        return "quarter";
+      default:
+        return null;
+    }
+  };
+  var zone = null;
+  var specificOffset;
+  if (!isUndefined(matches.z)) {
+    zone = IANAZone.create(matches.z);
+  }
+  if (!isUndefined(matches.Z)) {
+    if (!zone) {
+      zone = new FixedOffsetZone(matches.Z);
+    }
+    specificOffset = matches.Z;
+  }
+  if (!isUndefined(matches.q)) {
+    matches.M = (matches.q - 1) * 3 + 1;
+  }
+  if (!isUndefined(matches.h)) {
+    if (matches.h < 12 && matches.a === 1) {
+      matches.h += 12;
+    } else if (matches.h === 12 && matches.a === 0) {
+      matches.h = 0;
+    }
+  }
+  if (matches.G === 0 && matches.y) {
+    matches.y = -matches.y;
+  }
+  if (!isUndefined(matches.u)) {
+    matches.S = parseMillis(matches.u);
+  }
+  var vals = Object.keys(matches).reduce(function (r, k) {
+    var f = toField(k);
+    if (f) {
+      r[f] = matches[k];
+    }
+    return r;
+  }, {});
+  return [vals, zone, specificOffset];
+}
+var dummyDateTimeCache = null;
+function getDummyDateTime() {
+  if (!dummyDateTimeCache) {
+    dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+  }
+  return dummyDateTimeCache;
+}
+function maybeExpandMacroToken(token, locale) {
+  if (token.literal) {
+    return token;
+  }
+  var formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+  var tokens = formatOptsToTokens(formatOpts, locale);
+  if (tokens == null || tokens.includes(undefined)) {
+    return token;
+  }
+  return tokens;
+}
+function expandMacroTokens(tokens, locale) {
+  var _Array$prototype;
+  return (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, tokens.map(function (t) {
+    return maybeExpandMacroToken(t, locale);
+  }));
+}
+
+/**
+ * @private
+ */
+
+var TokenParser = /*#__PURE__*/function () {
+  function TokenParser(locale, format) {
+    this.locale = locale;
+    this.format = format;
+    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+    this.units = this.tokens.map(function (t) {
+      return unitForToken(t, locale);
+    });
+    this.disqualifyingUnit = this.units.find(function (t) {
+      return t.invalidReason;
+    });
+    if (!this.disqualifyingUnit) {
+      var _buildRegex = buildRegex(this.units),
+        regexString = _buildRegex[0],
+        handlers = _buildRegex[1];
+      this.regex = RegExp(regexString, "i");
+      this.handlers = handlers;
+    }
+  }
+  var _proto = TokenParser.prototype;
+  _proto.explainFromTokens = function explainFromTokens(input) {
+    if (!this.isValid) {
+      return {
+        input: input,
+        tokens: this.tokens,
+        invalidReason: this.invalidReason
+      };
+    } else {
+      var _match = match(input, this.regex, this.handlers),
+        rawMatches = _match[0],
+        matches = _match[1],
+        _ref6 = matches ? dateTimeFromMatches(matches) : [null, null, undefined],
+        result = _ref6[0],
+        zone = _ref6[1],
+        specificOffset = _ref6[2];
+      if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+        throw new ConflictingSpecificationError("Can't include meridiem when specifying 24-hour format");
+      }
+      return {
+        input: input,
+        tokens: this.tokens,
+        regex: this.regex,
+        rawMatches: rawMatches,
+        matches: matches,
+        result: result,
+        zone: zone,
+        specificOffset: specificOffset
+      };
+    }
+  };
+  _createClass(TokenParser, [{
+    key: "isValid",
+    get: function get() {
+      return !this.disqualifyingUnit;
+    }
+  }, {
+    key: "invalidReason",
+    get: function get() {
+      return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+    }
+  }]);
+  return TokenParser;
+}();
+function explainFromTokens(locale, input, format) {
+  var parser = new TokenParser(locale, format);
+  return parser.explainFromTokens(input);
+}
+function parseFromTokens(locale, input, format) {
+  var _explainFromTokens = explainFromTokens(locale, input, format),
+    result = _explainFromTokens.result,
+    zone = _explainFromTokens.zone,
+    specificOffset = _explainFromTokens.specificOffset,
+    invalidReason = _explainFromTokens.invalidReason;
+  return [result, zone, specificOffset, invalidReason];
+}
+function formatOptsToTokens(formatOpts, locale) {
+  if (!formatOpts) {
+    return null;
+  }
+  var formatter = Formatter.create(locale, formatOpts);
+  var df = formatter.dtFormatter(getDummyDateTime());
+  var parts = df.formatToParts();
+  var resolvedOpts = df.resolvedOptions();
+  return parts.map(function (p) {
+    return tokenForPart(p, formatOpts, resolvedOpts);
+  });
+}
+
+var INVALID = "Invalid DateTime";
+var MAX_DATE = 8.64e15;
+function unsupportedZone(zone) {
+  return new Invalid("unsupported zone", "the zone \"" + zone.name + "\" is not supported");
+}
+
+// we cache week data on the DT object and this intermediates the cache
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedWeekData(dt) {
+  if (dt.weekData === null) {
+    dt.weekData = gregorianToWeek(dt.c);
+  }
+  return dt.weekData;
+}
+
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedLocalWeekData(dt) {
+  if (dt.localWeekData === null) {
+    dt.localWeekData = gregorianToWeek(dt.c, dt.loc.getMinDaysInFirstWeek(), dt.loc.getStartOfWeek());
+  }
+  return dt.localWeekData;
+}
+
+// clone really means, "make a new object with these modifications". all "setters" really use this
+// to create a new object while only changing some of the properties
+function clone(inst, alts) {
+  var current = {
+    ts: inst.ts,
+    zone: inst.zone,
+    c: inst.c,
+    o: inst.o,
+    loc: inst.loc,
+    invalid: inst.invalid
+  };
+  return new DateTime(_extends({}, current, alts, {
+    old: current
+  }));
+}
+
+// find the right offset a given local time. The o input is our guess, which determines which
+// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+function fixOffset(localTS, o, tz) {
+  // Our UTC time is just a guess because our offset is just a guess
+  var utcGuess = localTS - o * 60 * 1000;
+
+  // Test whether the zone matches the offset for this ts
+  var o2 = tz.offset(utcGuess);
+
+  // If so, offset didn't change and we're done
+  if (o === o2) {
+    return [utcGuess, o];
+  }
+
+  // If not, change the ts by the difference in the offset
+  utcGuess -= (o2 - o) * 60 * 1000;
+
+  // If that gives us the local time we want, we're done
+  var o3 = tz.offset(utcGuess);
+  if (o2 === o3) {
+    return [utcGuess, o2];
+  }
+
+  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+}
+
+// convert an epoch timestamp into a calendar object with the given offset
+function tsToObj(ts, offset) {
+  ts += offset * 60 * 1000;
+  var d = new Date(ts);
+  return {
+    year: d.getUTCFullYear(),
+    month: d.getUTCMonth() + 1,
+    day: d.getUTCDate(),
+    hour: d.getUTCHours(),
+    minute: d.getUTCMinutes(),
+    second: d.getUTCSeconds(),
+    millisecond: d.getUTCMilliseconds()
+  };
+}
+
+// convert a calendar object to a epoch timestamp
+function objToTS(obj, offset, zone) {
+  return fixOffset(objToLocalTS(obj), offset, zone);
+}
+
+// create a new DT instance by adding a duration, adjusting for DSTs
+function adjustTime(inst, dur) {
+  var oPre = inst.o,
+    year = inst.c.year + Math.trunc(dur.years),
+    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+    c = _extends({}, inst.c, {
+      year: year,
+      month: month,
+      day: Math.min(inst.c.day, daysInMonth(year, month)) + Math.trunc(dur.days) + Math.trunc(dur.weeks) * 7
+    }),
+    millisToAdd = Duration.fromObject({
+      years: dur.years - Math.trunc(dur.years),
+      quarters: dur.quarters - Math.trunc(dur.quarters),
+      months: dur.months - Math.trunc(dur.months),
+      weeks: dur.weeks - Math.trunc(dur.weeks),
+      days: dur.days - Math.trunc(dur.days),
+      hours: dur.hours,
+      minutes: dur.minutes,
+      seconds: dur.seconds,
+      milliseconds: dur.milliseconds
+    }).as("milliseconds"),
+    localTS = objToLocalTS(c);
+  var _fixOffset = fixOffset(localTS, oPre, inst.zone),
+    ts = _fixOffset[0],
+    o = _fixOffset[1];
+  if (millisToAdd !== 0) {
+    ts += millisToAdd;
+    // that could have changed the offset by going over a DST, but we want to keep the ts the same
+    o = inst.zone.offset(ts);
+  }
+  return {
+    ts: ts,
+    o: o
+  };
+}
+
+// helper useful in turning the results of parsing into real dates
+// by handling the zone options
+function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+  var setZone = opts.setZone,
+    zone = opts.zone;
+  if (parsed && Object.keys(parsed).length !== 0 || parsedZone) {
+    var interpretationZone = parsedZone || zone,
+      inst = DateTime.fromObject(parsed, _extends({}, opts, {
+        zone: interpretationZone,
+        specificOffset: specificOffset
+      }));
+    return setZone ? inst : inst.setZone(zone);
+  } else {
+    return DateTime.invalid(new Invalid("unparsable", "the input \"" + text + "\" can't be parsed as " + format));
+  }
+}
+
+// if you want to output a technical format (e.g. RFC 2822), this helper
+// helps handle the details
+function toTechFormat(dt, format, allowZ) {
+  if (allowZ === void 0) {
+    allowZ = true;
+  }
+  return dt.isValid ? Formatter.create(Locale.create("en-US"), {
+    allowZ: allowZ,
+    forceSimple: true
+  }).formatDateTimeFromString(dt, format) : null;
+}
+function _toISODate(o, extended, precision) {
+  var longFormat = o.c.year > 9999 || o.c.year < 0;
+  var c = "";
+  if (longFormat && o.c.year >= 0) c += "+";
+  c += padStart(o.c.year, longFormat ? 6 : 4);
+  if (precision === "year") return c;
+  if (extended) {
+    c += "-";
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+    c += "-";
+  } else {
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+  }
+  c += padStart(o.c.day);
+  return c;
+}
+function _toISOTime(o, extended, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision) {
+  var showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+    c = "";
+  switch (precision) {
+    case "day":
+    case "month":
+    case "year":
+      break;
+    default:
+      c += padStart(o.c.hour);
+      if (precision === "hour") break;
+      if (extended) {
+        c += ":";
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += ":";
+          c += padStart(o.c.second);
+        }
+      } else {
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += padStart(o.c.second);
+        }
+      }
+      if (precision === "second") break;
+      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+        c += ".";
+        c += padStart(o.c.millisecond, 3);
+      }
+  }
+  if (includeOffset) {
+    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+      c += "Z";
+    } else if (o.o < 0) {
+      c += "-";
+      c += padStart(Math.trunc(-o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(-o.o % 60));
+    } else {
+      c += "+";
+      c += padStart(Math.trunc(o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(o.o % 60));
+    }
+  }
+  if (extendedZone) {
+    c += "[" + o.zone.ianaName + "]";
+  }
+  return c;
+}
+
+// defaults for unspecified units in the supported calendars
+var defaultUnitValues = {
+    month: 1,
+    day: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  },
+  defaultWeekUnitValues = {
+    weekNumber: 1,
+    weekday: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  },
+  defaultOrdinalUnitValues = {
+    ordinal: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  };
+
+// Units in the supported calendars, sorted by bigness
+var orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+  orderedWeekUnits = ["weekYear", "weekNumber", "weekday", "hour", "minute", "second", "millisecond"],
+  orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+// standardize case and plurality in units
+function normalizeUnit(unit) {
+  var normalized = {
+    year: "year",
+    years: "year",
+    month: "month",
+    months: "month",
+    day: "day",
+    days: "day",
+    hour: "hour",
+    hours: "hour",
+    minute: "minute",
+    minutes: "minute",
+    quarter: "quarter",
+    quarters: "quarter",
+    second: "second",
+    seconds: "second",
+    millisecond: "millisecond",
+    milliseconds: "millisecond",
+    weekday: "weekday",
+    weekdays: "weekday",
+    weeknumber: "weekNumber",
+    weeksnumber: "weekNumber",
+    weeknumbers: "weekNumber",
+    weekyear: "weekYear",
+    weekyears: "weekYear",
+    ordinal: "ordinal"
+  }[unit.toLowerCase()];
+  if (!normalized) throw new InvalidUnitError(unit);
+  return normalized;
+}
+function normalizeUnitWithLocalWeeks(unit) {
+  switch (unit.toLowerCase()) {
+    case "localweekday":
+    case "localweekdays":
+      return "localWeekday";
+    case "localweeknumber":
+    case "localweeknumbers":
+      return "localWeekNumber";
+    case "localweekyear":
+    case "localweekyears":
+      return "localWeekYear";
+    default:
+      return normalizeUnit(unit);
+  }
+}
+
+// cache offsets for zones based on the current timestamp when this function is
+// first called. When we are handling a datetime from components like (year,
+// month, day, hour) in a time zone, we need a guess about what the timezone
+// offset is so that we can convert into a UTC timestamp. One way is to find the
+// offset of now in the zone. The actual date may have a different offset (for
+// example, if we handle a date in June while we're in December in a zone that
+// observes DST), but we can check and adjust that.
+//
+// When handling many dates, calculating the offset for now every time is
+// expensive. It's just a guess, so we can cache the offset to use even if we
+// are right on a time change boundary (we'll just correct in the other
+// direction). Using a timestamp from first read is a slight optimization for
+// handling dates close to the current date, since those dates will usually be
+// in the same offset (we could set the timestamp statically, instead). We use a
+// single timestamp for all zones to make things a bit more predictable.
+//
+// This is safe for quickDT (used by local() and utc()) because we don't fill in
+// higher-order units from tsNow (as we do in fromObject, this requires that
+// offset is calculated from tsNow).
+/**
+ * @param {Zone} zone
+ * @return {number}
+ */
+function guessOffsetForZone(zone) {
+  if (zoneOffsetTs === undefined) {
+    zoneOffsetTs = Settings.now();
+  }
+
+  // Do not cache anything but IANA zones, because it is not safe to do so.
+  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+  if (zone.type !== "iana") {
+    return zone.offset(zoneOffsetTs);
+  }
+  var zoneName = zone.name;
+  var offsetGuess = zoneOffsetGuessCache.get(zoneName);
+  if (offsetGuess === undefined) {
+    offsetGuess = zone.offset(zoneOffsetTs);
+    zoneOffsetGuessCache.set(zoneName, offsetGuess);
+  }
+  return offsetGuess;
+}
+
+// this is a dumbed down version of fromObject() that runs about 60% faster
+// but doesn't do any validation, makes a bunch of assumptions about what units
+// are present, and so on.
+function quickDT(obj, opts) {
+  var zone = normalizeZone(opts.zone, Settings.defaultZone);
+  if (!zone.isValid) {
+    return DateTime.invalid(unsupportedZone(zone));
+  }
+  var loc = Locale.fromObject(opts);
+  var ts, o;
+
+  // assume we have the higher-order units
+  if (!isUndefined(obj.year)) {
+    for (var _i = 0, _orderedUnits = orderedUnits; _i < _orderedUnits.length; _i++) {
+      var u = _orderedUnits[_i];
+      if (isUndefined(obj[u])) {
+        obj[u] = defaultUnitValues[u];
+      }
+    }
+    var invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+    var offsetProvis = guessOffsetForZone(zone);
+    var _objToTS = objToTS(obj, offsetProvis, zone);
+    ts = _objToTS[0];
+    o = _objToTS[1];
+  } else {
+    ts = Settings.now();
+  }
+  return new DateTime({
+    ts: ts,
+    zone: zone,
+    loc: loc,
+    o: o
+  });
+}
+function diffRelative(start, end, opts) {
+  var round = isUndefined(opts.round) ? true : opts.round,
+    rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+    format = function format(c, unit) {
+      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+      var formatter = end.loc.clone(opts).relFormatter(opts);
+      return formatter.format(c, unit);
+    },
+    differ = function differ(unit) {
+      if (opts.calendary) {
+        if (!end.hasSame(start, unit)) {
+          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+        } else return 0;
+      } else {
+        return end.diff(start, unit).get(unit);
+      }
+    };
+  if (opts.unit) {
+    return format(differ(opts.unit), opts.unit);
+  }
+  for (var _iterator = _createForOfIteratorHelperLoose(opts.units), _step; !(_step = _iterator()).done;) {
+    var unit = _step.value;
+    var count = differ(unit);
+    if (Math.abs(count) >= 1) {
+      return format(count, unit);
+    }
+  }
+  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+}
+function lastOpts(argList) {
+  var opts = {},
+    args;
+  if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+    opts = argList[argList.length - 1];
+    args = Array.from(argList).slice(0, argList.length - 1);
+  } else {
+    args = Array.from(argList);
+  }
+  return [opts, args];
+}
+
+/**
+ * Timestamp to use for cached zone offset guesses (exposed for test)
+ */
+var zoneOffsetTs;
+/**
+ * Cache for zone offset guesses (exposed for test).
+ *
+ * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+ * zone.offset().
+ */
+var zoneOffsetGuessCache = new Map();
+
+/**
+ * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+ *
+ * A DateTime comprises of:
+ * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+ * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+ * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+ *
+ * Here is a brief overview of the most commonly used functionality it provides:
+ *
+ * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+ * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+ * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+ * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+ * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+ * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+ * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+ *
+ * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+ */
+var DateTime = /*#__PURE__*/function (_Symbol$for) {
+  /**
+   * @access private
+   */
+  function DateTime(config) {
+    var zone = config.zone || Settings.defaultZone;
+    var invalid = config.invalid || (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) || (!zone.isValid ? unsupportedZone(zone) : null);
+    /**
+     * @access private
+     */
+    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+    var c = null,
+      o = null;
+    if (!invalid) {
+      var unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+      if (unchanged) {
+        var _ref = [config.old.c, config.old.o];
+        c = _ref[0];
+        o = _ref[1];
+      } else {
+        // If an offset has been passed and we have not been called from
+        // clone(), we can trust it and avoid the offset calculation.
+        var ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+        c = tsToObj(this.ts, ot);
+        invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+        c = invalid ? null : c;
+        o = invalid ? null : ot;
+      }
+    }
+
+    /**
+     * @access private
+     */
+    this._zone = zone;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.invalid = invalid;
+    /**
+     * @access private
+     */
+    this.weekData = null;
+    /**
+     * @access private
+     */
+    this.localWeekData = null;
+    /**
+     * @access private
+     */
+    this.c = c;
+    /**
+     * @access private
+     */
+    this.o = o;
+    /**
+     * @access private
+     */
+    this.isLuxonDateTime = true;
+  }
+
+  // CONSTRUCT
+
+  /**
+   * Create a DateTime for the current instant, in the system's time zone.
+   *
+   * Use Settings to override these default values if needed.
+   * @example DateTime.now().toISO() //~> now in the ISO format
+   * @return {DateTime}
+   */
+  DateTime.now = function now() {
+    return new DateTime({});
+  }
+
+  /**
+   * Create a local DateTime
+   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month, 1-indexed
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @example DateTime.local()                                  //~> now
+   * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+   * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+   * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+   * @return {DateTime}
+   */;
+  DateTime.local = function local() {
+    var _lastOpts = lastOpts(arguments),
+      opts = _lastOpts[0],
+      args = _lastOpts[1],
+      year = args[0],
+      month = args[1],
+      day = args[2],
+      hour = args[3],
+      minute = args[4],
+      second = args[5],
+      millisecond = args[6];
+    return quickDT({
+      year: year,
+      month: month,
+      day: day,
+      hour: hour,
+      minute: minute,
+      second: second,
+      millisecond: millisecond
+    }, opts);
+  }
+
+  /**
+   * Create a DateTime in UTC
+   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.utc()                                              //~> now
+   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+   * @return {DateTime}
+   */;
+  DateTime.utc = function utc() {
+    var _lastOpts2 = lastOpts(arguments),
+      opts = _lastOpts2[0],
+      args = _lastOpts2[1],
+      year = args[0],
+      month = args[1],
+      day = args[2],
+      hour = args[3],
+      minute = args[4],
+      second = args[5],
+      millisecond = args[6];
+    opts.zone = FixedOffsetZone.utcInstance;
+    return quickDT({
+      year: year,
+      month: month,
+      day: day,
+      hour: hour,
+      minute: minute,
+      second: second,
+      millisecond: millisecond
+    }, opts);
+  }
+
+  /**
+   * Create a DateTime from a JavaScript Date object. Uses the default zone.
+   * @param {Date} date - a JavaScript Date object
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @return {DateTime}
+   */;
+  DateTime.fromJSDate = function fromJSDate(date, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    var ts = isDate(date) ? date.valueOf() : NaN;
+    if (Number.isNaN(ts)) {
+      return DateTime.invalid("invalid input");
+    }
+    var zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+    return new DateTime({
+      ts: ts,
+      zone: zoneToUse,
+      loc: Locale.fromObject(options)
+    });
+  }
+
+  /**
+   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */;
+  DateTime.fromMillis = function fromMillis(milliseconds, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    if (!isNumber(milliseconds)) {
+      throw new InvalidArgumentError("fromMillis requires a numerical input, but received a " + typeof milliseconds + " with value " + milliseconds);
+    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+      return DateTime.invalid("Timestamp out of range");
+    } else {
+      return new DateTime({
+        ts: milliseconds,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options)
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} seconds - a number of seconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */;
+  DateTime.fromSeconds = function fromSeconds(seconds, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    if (!isNumber(seconds)) {
+      throw new InvalidArgumentError("fromSeconds requires a numerical input");
+    } else {
+      return new DateTime({
+        ts: seconds * 1000,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options)
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.year - a year, such as 1987
+   * @param {number} obj.month - a month, 1-12
+   * @param {number} obj.day - a day of the month, 1-31, depending on the month
+   * @param {number} obj.ordinal - day of the year, 1-365 or 366
+   * @param {number} obj.weekYear - an ISO week year
+   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+   * @param {number} obj.localWeekYear - a week year, according to the locale
+   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+   * @param {number} obj.hour - hour of the day, 0-23
+   * @param {number} obj.minute - minute of the hour, 0-59
+   * @param {number} obj.second - second of the minute, 0-59
+   * @param {number} obj.millisecond - millisecond of the second, 0-999
+   * @param {Object} opts - options for creating this DateTime
+   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+   * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+   * @return {DateTime}
+   */;
+  DateTime.fromObject = function fromObject(obj, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    obj = obj || {};
+    var zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+    var loc = Locale.fromObject(opts);
+    var normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+    var _usesLocalWeekValues = usesLocalWeekValues(normalized, loc),
+      minDaysInFirstWeek = _usesLocalWeekValues.minDaysInFirstWeek,
+      startOfWeek = _usesLocalWeekValues.startOfWeek;
+    var tsNow = Settings.now(),
+      offsetProvis = !isUndefined(opts.specificOffset) ? opts.specificOffset : zoneToUse.offset(tsNow),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    // cases:
+    // just a weekday -> this week's instance of that weekday, no worries
+    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+    // (gregorian month or day) + ordinal -> error
+    // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+    }
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+    var useWeekData = definiteWeekDef || normalized.weekday && !containsGregor;
+
+    // configure ourselves to deal with gregorian dates or week stuff
+    var units,
+      defaultValues,
+      objNow = tsToObj(tsNow, offsetProvis);
+    if (useWeekData) {
+      units = orderedWeekUnits;
+      defaultValues = defaultWeekUnitValues;
+      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+    } else if (containsOrdinal) {
+      units = orderedOrdinalUnits;
+      defaultValues = defaultOrdinalUnitValues;
+      objNow = gregorianToOrdinal(objNow);
+    } else {
+      units = orderedUnits;
+      defaultValues = defaultUnitValues;
+    }
+
+    // set default values for missing stuff
+    var foundFirst = false;
+    for (var _iterator2 = _createForOfIteratorHelperLoose(units), _step2; !(_step2 = _iterator2()).done;) {
+      var u = _step2.value;
+      var v = normalized[u];
+      if (!isUndefined(v)) {
+        foundFirst = true;
+      } else if (foundFirst) {
+        normalized[u] = defaultValues[u];
+      } else {
+        normalized[u] = objNow[u];
+      }
+    }
+
+    // make sure the values we have are in range
+    var higherOrderInvalid = useWeekData ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? hasInvalidOrdinalData(normalized) : hasInvalidGregorianData(normalized),
+      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    // compute the actual time
+    var gregorian = useWeekData ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? ordinalToGregorian(normalized) : normalized,
+      _objToTS2 = objToTS(gregorian, offsetProvis, zoneToUse),
+      tsFinal = _objToTS2[0],
+      offsetFinal = _objToTS2[1],
+      inst = new DateTime({
+        ts: tsFinal,
+        zone: zoneToUse,
+        o: offsetFinal,
+        loc: loc
+      });
+
+    // gregorian data + weekday serves only to validate
+    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+      return DateTime.invalid("mismatched weekday", "you can't specify both a weekday of " + normalized.weekday + " and a date of " + inst.toISO());
+    }
+    if (!inst.isValid) {
+      return DateTime.invalid(inst.invalid);
+    }
+    return inst;
+  }
+
+  /**
+   * Create a DateTime from an ISO 8601 string
+   * @param {string} text - the ISO string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+   * @example DateTime.fromISO('2016-W05-4')
+   * @return {DateTime}
+   */;
+  DateTime.fromISO = function fromISO(text, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _parseISODate = parseISODate(text),
+      vals = _parseISODate[0],
+      parsedZone = _parseISODate[1];
+    return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+  }
+
+  /**
+   * Create a DateTime from an RFC 2822 string
+   * @param {string} text - the RFC 2822 string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+   * @return {DateTime}
+   */;
+  DateTime.fromRFC2822 = function fromRFC2822(text, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _parseRFC2822Date = parseRFC2822Date(text),
+      vals = _parseRFC2822Date[0],
+      parsedZone = _parseRFC2822Date[1];
+    return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+  }
+
+  /**
+   * Create a DateTime from an HTTP header date
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @param {string} text - the HTTP header date
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+   * @return {DateTime}
+   */;
+  DateTime.fromHTTP = function fromHTTP(text, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _parseHTTPDate = parseHTTPDate(text),
+      vals = _parseHTTPDate[0],
+      parsedZone = _parseHTTPDate[1];
+    return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+  }
+
+  /**
+   * Create a DateTime from an input string and format string.
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @return {DateTime}
+   */;
+  DateTime.fromFormat = function fromFormat(text, fmt, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (isUndefined(text) || isUndefined(fmt)) {
+      throw new InvalidArgumentError("fromFormat requires an input string and a format");
+    }
+    var _opts = opts,
+      _opts$locale = _opts.locale,
+      locale = _opts$locale === void 0 ? null : _opts$locale,
+      _opts$numberingSystem = _opts.numberingSystem,
+      numberingSystem = _opts$numberingSystem === void 0 ? null : _opts$numberingSystem,
+      localeToUse = Locale.fromOpts({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        defaultToEN: true
+      }),
+      _parseFromTokens = parseFromTokens(localeToUse, text, fmt),
+      vals = _parseFromTokens[0],
+      parsedZone = _parseFromTokens[1],
+      specificOffset = _parseFromTokens[2],
+      invalid = _parseFromTokens[3];
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    } else {
+      return parseDataToDateTime(vals, parsedZone, opts, "format " + fmt, text, specificOffset);
+    }
+  }
+
+  /**
+   * @deprecated use fromFormat instead
+   */;
+  DateTime.fromString = function fromString(text, fmt, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return DateTime.fromFormat(text, fmt, opts);
+  }
+
+  /**
+   * Create a DateTime from a SQL date, time, or datetime
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale
+   * @param {string} text - the string to parse
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @example DateTime.fromSQL('2017-05-15')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+   * @example DateTime.fromSQL('09:12:34.342')
+   * @return {DateTime}
+   */;
+  DateTime.fromSQL = function fromSQL(text, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _parseSQL = parseSQL(text),
+      vals = _parseSQL[0],
+      parsedZone = _parseSQL[1];
+    return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+  }
+
+  /**
+   * Create an invalid DateTime.
+   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {DateTime}
+   */;
+  DateTime.invalid = function invalid(reason, explanation) {
+    if (explanation === void 0) {
+      explanation = null;
+    }
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+    }
+    var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDateTimeError(invalid);
+    } else {
+      return new DateTime({
+        invalid: invalid
+      });
+    }
+  }
+
+  /**
+   * Check if an object is an instance of DateTime. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */;
+  DateTime.isDateTime = function isDateTime(o) {
+    return o && o.isLuxonDateTime || false;
+  }
+
+  /**
+   * Produce the format string for a set of options
+   * @param formatOpts
+   * @param localeOpts
+   * @returns {string}
+   */;
+  DateTime.parseFormatForOpts = function parseFormatForOpts(formatOpts, localeOpts) {
+    if (localeOpts === void 0) {
+      localeOpts = {};
+    }
+    var tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+    return !tokenList ? null : tokenList.map(function (t) {
+      return t ? t.val : null;
+    }).join("");
+  }
+
+  /**
+   * Produce the the fully expanded format token for the locale
+   * Does NOT quote characters, so quoted tokens will not round trip correctly
+   * @param fmt
+   * @param localeOpts
+   * @returns {string}
+   */;
+  DateTime.expandFormat = function expandFormat(fmt, localeOpts) {
+    if (localeOpts === void 0) {
+      localeOpts = {};
+    }
+    var expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+    return expanded.map(function (t) {
+      return t.val;
+    }).join("");
+  };
+  DateTime.resetCache = function resetCache() {
+    zoneOffsetTs = undefined;
+    zoneOffsetGuessCache.clear();
+  }
+
+  // INFO
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+   * @return {number}
+   */;
+  var _proto = DateTime.prototype;
+  _proto.get = function get(unit) {
+    return this[unit];
+  }
+
+  /**
+   * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+   * * The DateTime was created by an operation on another invalid date
+   * @type {boolean}
+   */;
+  /**
+   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+   * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+   * @returns {DateTime[]}
+   */
+  _proto.getPossibleOffsets = function getPossibleOffsets() {
+    if (!this.isValid || this.isOffsetFixed) {
+      return [this];
+    }
+    var dayMs = 86400000;
+    var minuteMs = 60000;
+    var localTS = objToLocalTS(this.c);
+    var oEarlier = this.zone.offset(localTS - dayMs);
+    var oLater = this.zone.offset(localTS + dayMs);
+    var o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+    var o2 = this.zone.offset(localTS - oLater * minuteMs);
+    if (o1 === o2) {
+      return [this];
+    }
+    var ts1 = localTS - o1 * minuteMs;
+    var ts2 = localTS - o2 * minuteMs;
+    var c1 = tsToObj(ts1, o1);
+    var c2 = tsToObj(ts2, o2);
+    if (c1.hour === c2.hour && c1.minute === c2.minute && c1.second === c2.second && c1.millisecond === c2.millisecond) {
+      return [clone(this, {
+        ts: ts1
+      }), clone(this, {
+        ts: ts2
+      })];
+    }
+    return [this];
+  }
+
+  /**
+   * Returns true if this DateTime is in a leap year, false otherwise
+   * @example DateTime.local(2016).isInLeapYear //=> true
+   * @example DateTime.local(2013).isInLeapYear //=> false
+   * @type {boolean}
+   */;
+  /**
+   * Returns the resolved Intl options for this DateTime.
+   * This is useful in understanding the behavior of formatting methods
+   * @param {Object} opts - the same options as toLocaleString
+   * @return {Object}
+   */
+  _proto.resolvedLocaleOptions = function resolvedLocaleOptions(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _Formatter$create$res = Formatter.create(this.loc.clone(opts), opts).resolvedOptions(this),
+      locale = _Formatter$create$res.locale,
+      numberingSystem = _Formatter$create$res.numberingSystem,
+      calendar = _Formatter$create$res.calendar;
+    return {
+      locale: locale,
+      numberingSystem: numberingSystem,
+      outputCalendar: calendar
+    };
+  }
+
+  // TRANSFORM
+
+  /**
+   * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to {@link DateTime#setZone}('utc')
+   * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+   * @param {Object} [opts={}] - options to pass to `setZone()`
+   * @return {DateTime}
+   */;
+  _proto.toUTC = function toUTC(offset, opts) {
+    if (offset === void 0) {
+      offset = 0;
+    }
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.setZone(FixedOffsetZone.instance(offset), opts);
+  }
+
+  /**
+   * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to `setZone('local')`
+   * @return {DateTime}
+   */;
+  _proto.toLocal = function toLocal() {
+    return this.setZone(Settings.defaultZone);
+  }
+
+  /**
+   * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+   *
+   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+   * @return {DateTime}
+   */;
+  _proto.setZone = function setZone(zone, _temp) {
+    var _ref2 = _temp === void 0 ? {} : _temp,
+      _ref2$keepLocalTime = _ref2.keepLocalTime,
+      keepLocalTime = _ref2$keepLocalTime === void 0 ? false : _ref2$keepLocalTime,
+      _ref2$keepCalendarTim = _ref2.keepCalendarTime,
+      keepCalendarTime = _ref2$keepCalendarTim === void 0 ? false : _ref2$keepCalendarTim;
+    zone = normalizeZone(zone, Settings.defaultZone);
+    if (zone.equals(this.zone)) {
+      return this;
+    } else if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    } else {
+      var newTS = this.ts;
+      if (keepLocalTime || keepCalendarTime) {
+        var offsetGuess = zone.offset(this.ts);
+        var asObj = this.toObject();
+        var _objToTS3 = objToTS(asObj, offsetGuess, zone);
+        newTS = _objToTS3[0];
+      }
+      return clone(this, {
+        ts: newTS,
+        zone: zone
+      });
+    }
+  }
+
+  /**
+   * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+   * @param {Object} properties - the properties to set
+   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+   * @return {DateTime}
+   */;
+  _proto.reconfigure = function reconfigure(_temp2) {
+    var _ref3 = _temp2 === void 0 ? {} : _temp2,
+      locale = _ref3.locale,
+      numberingSystem = _ref3.numberingSystem,
+      outputCalendar = _ref3.outputCalendar;
+    var loc = this.loc.clone({
+      locale: locale,
+      numberingSystem: numberingSystem,
+      outputCalendar: outputCalendar
+    });
+    return clone(this, {
+      loc: loc
+    });
+  }
+
+  /**
+   * "Set" the locale. Returns a newly-constructed DateTime.
+   * Just a convenient alias for reconfigure({ locale })
+   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+   * @return {DateTime}
+   */;
+  _proto.setLocale = function setLocale(locale) {
+    return this.reconfigure({
+      locale: locale
+    });
+  }
+
+  /**
+   * "Set" the values of specified units. Returns a newly-constructed DateTime.
+   * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+   *
+   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+   * They cannot be mixed with ISO-week units like `weekday`.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dt.set({ year: 2017 })
+   * @example dt.set({ hour: 8, minute: 30 })
+   * @example dt.set({ weekday: 5 })
+   * @example dt.set({ year: 2005, ordinal: 234 })
+   * @return {DateTime}
+   */;
+  _proto.set = function set(values) {
+    if (!this.isValid) return this;
+    var normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+    var _usesLocalWeekValues2 = usesLocalWeekValues(normalized, this.loc),
+      minDaysInFirstWeek = _usesLocalWeekValues2.minDaysInFirstWeek,
+      startOfWeek = _usesLocalWeekValues2.startOfWeek;
+    var settingWeekStuff = !isUndefined(normalized.weekYear) || !isUndefined(normalized.weekNumber) || !isUndefined(normalized.weekday),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+    }
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+    var mixed;
+    if (settingWeekStuff) {
+      mixed = weekToGregorian(_extends({}, gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), normalized), minDaysInFirstWeek, startOfWeek);
+    } else if (!isUndefined(normalized.ordinal)) {
+      mixed = ordinalToGregorian(_extends({}, gregorianToOrdinal(this.c), normalized));
+    } else {
+      mixed = _extends({}, this.toObject(), normalized);
+
+      // if we didn't set the day but we ended up on an overflow date,
+      // use the last day of the right month
+      if (isUndefined(normalized.day)) {
+        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+      }
+    }
+    var _objToTS4 = objToTS(mixed, this.o, this.zone),
+      ts = _objToTS4[0],
+      o = _objToTS4[1];
+    return clone(this, {
+      ts: ts,
+      o: o
+    });
+  }
+
+  /**
+   * Add a period of time to this DateTime and return the resulting DateTime
+   *
+   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @example DateTime.now().plus(123) //~> in 123 milliseconds
+   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+   * @return {DateTime}
+   */;
+  _proto.plus = function plus(duration) {
+    if (!this.isValid) return this;
+    var dur = Duration.fromDurationLike(duration);
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * Subtract a period of time to this DateTime and return the resulting DateTime
+   * See {@link DateTime#plus}
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   @return {DateTime}
+   */;
+  _proto.minus = function minus(duration) {
+    if (!this.isValid) return this;
+    var dur = Duration.fromDurationLike(duration).negate();
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * "Set" this DateTime to the beginning of a unit of time.
+   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+   * @return {DateTime}
+   */;
+  _proto.startOf = function startOf(unit, _temp3) {
+    var _ref4 = _temp3 === void 0 ? {} : _temp3,
+      _ref4$useLocaleWeeks = _ref4.useLocaleWeeks,
+      useLocaleWeeks = _ref4$useLocaleWeeks === void 0 ? false : _ref4$useLocaleWeeks;
+    if (!this.isValid) return this;
+    var o = {},
+      normalizedUnit = Duration.normalizeUnit(unit);
+    switch (normalizedUnit) {
+      case "years":
+        o.month = 1;
+      // falls through
+      case "quarters":
+      case "months":
+        o.day = 1;
+      // falls through
+      case "weeks":
+      case "days":
+        o.hour = 0;
+      // falls through
+      case "hours":
+        o.minute = 0;
+      // falls through
+      case "minutes":
+        o.second = 0;
+      // falls through
+      case "seconds":
+        o.millisecond = 0;
+        break;
+      // no default, invalid units throw in normalizeUnit()
+    }
+
+    if (normalizedUnit === "weeks") {
+      if (useLocaleWeeks) {
+        var startOfWeek = this.loc.getStartOfWeek();
+        var weekday = this.weekday;
+        if (weekday < startOfWeek) {
+          o.weekNumber = this.weekNumber - 1;
+        }
+        o.weekday = startOfWeek;
+      } else {
+        o.weekday = 1;
+      }
+    }
+    if (normalizedUnit === "quarters") {
+      var q = Math.ceil(this.month / 3);
+      o.month = (q - 1) * 3 + 1;
+    }
+    return this.set(o);
+  }
+
+  /**
+   * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+   * @return {DateTime}
+   */;
+  _proto.endOf = function endOf(unit, opts) {
+    var _this$plus;
+    return this.isValid ? this.plus((_this$plus = {}, _this$plus[unit] = 1, _this$plus)).startOf(unit, opts).minus(1) : this;
+  }
+
+  // OUTPUT
+
+  /**
+   * Returns a string representation of this DateTime formatted according to the specified format string.
+   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+   * @return {string}
+   */;
+  _proto.toFormat = function toFormat(fmt, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.isValid ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt) : INVALID;
+  }
+
+  /**
+   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+   * of the DateTime in the assigned locale.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+   * @return {string}
+   */;
+  _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+    if (formatOpts === void 0) {
+      formatOpts = DATE_SHORT;
+    }
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.isValid ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this) : INVALID;
+  }
+
+  /**
+   * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+   * @example DateTime.now().toLocaleParts(); //=> [
+   *                                   //=>   { type: 'day', value: '25' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'month', value: '05' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'year', value: '1982' }
+   *                                   //=> ]
+   */;
+  _proto.toLocaleParts = function toLocaleParts(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.isValid ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this) : [];
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+   * @return {string|null}
+   */;
+  _proto.toISO = function toISO(_temp4) {
+    var _ref5 = _temp4 === void 0 ? {} : _temp4,
+      _ref5$format = _ref5.format,
+      format = _ref5$format === void 0 ? "extended" : _ref5$format,
+      _ref5$suppressSeconds = _ref5.suppressSeconds,
+      suppressSeconds = _ref5$suppressSeconds === void 0 ? false : _ref5$suppressSeconds,
+      _ref5$suppressMillise = _ref5.suppressMilliseconds,
+      suppressMilliseconds = _ref5$suppressMillise === void 0 ? false : _ref5$suppressMillise,
+      _ref5$includeOffset = _ref5.includeOffset,
+      includeOffset = _ref5$includeOffset === void 0 ? true : _ref5$includeOffset,
+      _ref5$extendedZone = _ref5.extendedZone,
+      extendedZone = _ref5$extendedZone === void 0 ? false : _ref5$extendedZone,
+      _ref5$precision = _ref5.precision,
+      precision = _ref5$precision === void 0 ? "milliseconds" : _ref5$precision;
+    if (!this.isValid) {
+      return null;
+    }
+    precision = normalizeUnit(precision);
+    var ext = format === "extended";
+    var c = _toISODate(this, ext, precision);
+    if (orderedUnits.indexOf(precision) >= 3) c += "T";
+    c += _toISOTime(this, ext, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+    return c;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's date component
+   * @param {Object} opts - options
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+   * @return {string|null}
+   */;
+  _proto.toISODate = function toISODate(_temp5) {
+    var _ref6 = _temp5 === void 0 ? {} : _temp5,
+      _ref6$format = _ref6.format,
+      format = _ref6$format === void 0 ? "extended" : _ref6$format,
+      _ref6$precision = _ref6.precision,
+      precision = _ref6$precision === void 0 ? "day" : _ref6$precision;
+    if (!this.isValid) {
+      return null;
+    }
+    return _toISODate(this, format === "extended", normalizeUnit(precision));
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's week date
+   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+   * @return {string}
+   */;
+  _proto.toISOWeekDate = function toISOWeekDate() {
+    return toTechFormat(this, "kkkk-'W'WW-c");
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's time component
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+   * @return {string}
+   */;
+  _proto.toISOTime = function toISOTime(_temp6) {
+    var _ref7 = _temp6 === void 0 ? {} : _temp6,
+      _ref7$suppressMillise = _ref7.suppressMilliseconds,
+      suppressMilliseconds = _ref7$suppressMillise === void 0 ? false : _ref7$suppressMillise,
+      _ref7$suppressSeconds = _ref7.suppressSeconds,
+      suppressSeconds = _ref7$suppressSeconds === void 0 ? false : _ref7$suppressSeconds,
+      _ref7$includeOffset = _ref7.includeOffset,
+      includeOffset = _ref7$includeOffset === void 0 ? true : _ref7$includeOffset,
+      _ref7$includePrefix = _ref7.includePrefix,
+      includePrefix = _ref7$includePrefix === void 0 ? false : _ref7$includePrefix,
+      _ref7$extendedZone = _ref7.extendedZone,
+      extendedZone = _ref7$extendedZone === void 0 ? false : _ref7$extendedZone,
+      _ref7$format = _ref7.format,
+      format = _ref7$format === void 0 ? "extended" : _ref7$format,
+      _ref7$precision = _ref7.precision,
+      precision = _ref7$precision === void 0 ? "milliseconds" : _ref7$precision;
+    if (!this.isValid) {
+      return null;
+    }
+    precision = normalizeUnit(precision);
+    var c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+    return c + _toISOTime(this, format === "extended", suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+  }
+
+  /**
+   * Returns an RFC 2822-compatible string representation of this DateTime
+   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+   * @return {string}
+   */;
+  _proto.toRFC2822 = function toRFC2822() {
+    return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+   * Specifically, the string conforms to RFC 1123.
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+   * @return {string}
+   */;
+  _proto.toHTTP = function toHTTP() {
+    return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Date
+   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+   * @return {string|null}
+   */;
+  _proto.toSQLDate = function toSQLDate() {
+    if (!this.isValid) {
+      return null;
+    }
+    return _toISODate(this, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Time
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+   * @return {string}
+   */;
+  _proto.toSQLTime = function toSQLTime(_temp7) {
+    var _ref8 = _temp7 === void 0 ? {} : _temp7,
+      _ref8$includeOffset = _ref8.includeOffset,
+      includeOffset = _ref8$includeOffset === void 0 ? true : _ref8$includeOffset,
+      _ref8$includeZone = _ref8.includeZone,
+      includeZone = _ref8$includeZone === void 0 ? false : _ref8$includeZone,
+      _ref8$includeOffsetSp = _ref8.includeOffsetSpace,
+      includeOffsetSpace = _ref8$includeOffsetSp === void 0 ? true : _ref8$includeOffsetSp;
+    var fmt = "HH:mm:ss.SSS";
+    if (includeZone || includeOffset) {
+      if (includeOffsetSpace) {
+        fmt += " ";
+      }
+      if (includeZone) {
+        fmt += "z";
+      } else if (includeOffset) {
+        fmt += "ZZ";
+      }
+    }
+    return toTechFormat(this, fmt, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+   * @return {string}
+   */;
+  _proto.toSQL = function toSQL(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (!this.isValid) {
+      return null;
+    }
+    return this.toSQLDate() + " " + this.toSQLTime(opts);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for debugging
+   * @return {string}
+   */;
+  _proto.toString = function toString() {
+    return this.isValid ? this.toISO() : INVALID;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for the REPL.
+   * @return {string}
+   */;
+  _proto[_Symbol$for] = function () {
+    if (this.isValid) {
+      return "DateTime { ts: " + this.toISO() + ", zone: " + this.zone.name + ", locale: " + this.locale + " }";
+    } else {
+      return "DateTime { Invalid, reason: " + this.invalidReason + " }";
+    }
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+   * @return {number}
+   */;
+  _proto.valueOf = function valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime.
+   * @return {number}
+   */;
+  _proto.toMillis = function toMillis() {
+    return this.isValid ? this.ts : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+   * @return {number}
+   */;
+  _proto.toSeconds = function toSeconds() {
+    return this.isValid ? this.ts / 1000 : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (as a whole number) of this DateTime.
+   * @return {number}
+   */;
+  _proto.toUnixInteger = function toUnixInteger() {
+    return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+   * @return {string}
+   */;
+  _proto.toJSON = function toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a BSON serializable equivalent to this DateTime.
+   * @return {Date}
+   */;
+  _proto.toBSON = function toBSON() {
+    return this.toJSDate();
+  }
+
+  /**
+   * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+   * @param opts - options for generating the object
+   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+   * @return {Object}
+   */;
+  _proto.toObject = function toObject(opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (!this.isValid) return {};
+    var base = _extends({}, this.c);
+    if (opts.includeConfig) {
+      base.outputCalendar = this.outputCalendar;
+      base.numberingSystem = this.loc.numberingSystem;
+      base.locale = this.loc.locale;
+    }
+    return base;
+  }
+
+  /**
+   * Returns a JavaScript Date equivalent to this DateTime.
+   * @return {Date}
+   */;
+  _proto.toJSDate = function toJSDate() {
+    return new Date(this.isValid ? this.ts : NaN);
+  }
+
+  // COMPARE
+
+  /**
+   * Return the difference between two DateTimes as a Duration.
+   * @param {DateTime} otherDateTime - the DateTime to compare this one to
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example
+   * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+   *     i2 = DateTime.fromISO('1983-10-14T10:30');
+   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+   * @return {Duration}
+   */;
+  _proto.diff = function diff(otherDateTime, unit, opts) {
+    if (unit === void 0) {
+      unit = "milliseconds";
+    }
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (!this.isValid || !otherDateTime.isValid) {
+      return Duration.invalid("created by diffing an invalid DateTime");
+    }
+    var durOpts = _extends({
+      locale: this.locale,
+      numberingSystem: this.numberingSystem
+    }, opts);
+    var units = maybeArray(unit).map(Duration.normalizeUnit),
+      otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+      earlier = otherIsLater ? this : otherDateTime,
+      later = otherIsLater ? otherDateTime : this,
+      diffed = _diff(earlier, later, units, durOpts);
+    return otherIsLater ? diffed.negate() : diffed;
+  }
+
+  /**
+   * Return the difference between this DateTime and right now.
+   * See {@link DateTime#diff}
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */;
+  _proto.diffNow = function diffNow(unit, opts) {
+    if (unit === void 0) {
+      unit = "milliseconds";
+    }
+    if (opts === void 0) {
+      opts = {};
+    }
+    return this.diff(DateTime.now(), unit, opts);
+  }
+
+  /**
+   * Return an Interval spanning between this DateTime and another DateTime
+   * @param {DateTime} otherDateTime - the other end point of the Interval
+   * @return {Interval|DateTime}
+   */;
+  _proto.until = function until(otherDateTime) {
+    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+  }
+
+  /**
+   * Return whether this DateTime is in the same unit of time as another DateTime.
+   * Higher-order units must also be identical for this function to return `true`.
+   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+   * @param {DateTime} otherDateTime - the other DateTime
+   * @param {string} unit - the unit of time to check sameness on
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+   * @return {boolean}
+   */;
+  _proto.hasSame = function hasSame(otherDateTime, unit, opts) {
+    if (!this.isValid) return false;
+    var inputMs = otherDateTime.valueOf();
+    var adjustedToZone = this.setZone(otherDateTime.zone, {
+      keepLocalTime: true
+    });
+    return adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts);
+  }
+
+  /**
+   * Equality check
+   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+   * To compare just the millisecond values, use `+dt1 === +dt2`.
+   * @param {DateTime} other - the other DateTime
+   * @return {boolean}
+   */;
+  _proto.equals = function equals(other) {
+    return this.isValid && other.isValid && this.valueOf() === other.valueOf() && this.zone.equals(other.zone) && this.loc.equals(other.loc);
+  }
+
+  /**
+   * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+   * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+   * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+   * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+   */;
+  _proto.toRelative = function toRelative(options) {
+    if (options === void 0) {
+      options = {};
+    }
+    if (!this.isValid) return null;
+    var base = options.base || DateTime.fromObject({}, {
+        zone: this.zone
+      }),
+      padding = options.padding ? this < base ? -options.padding : options.padding : 0;
+    var units = ["years", "months", "days", "hours", "minutes", "seconds"];
+    var unit = options.unit;
+    if (Array.isArray(options.unit)) {
+      units = options.unit;
+      unit = undefined;
+    }
+    return diffRelative(base, this.plus(padding), _extends({}, options, {
+      numeric: "always",
+      units: units,
+      unit: unit
+    }));
+  }
+
+  /**
+   * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+   * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+   */;
+  _proto.toRelativeCalendar = function toRelativeCalendar(options) {
+    if (options === void 0) {
+      options = {};
+    }
+    if (!this.isValid) return null;
+    return diffRelative(options.base || DateTime.fromObject({}, {
+      zone: this.zone
+    }), this, _extends({}, options, {
+      numeric: "auto",
+      units: ["years", "months", "days"],
+      calendary: true
+    }));
+  }
+
+  /**
+   * Return the min of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+   * @return {DateTime} the min DateTime, or undefined if called with no argument
+   */;
+  DateTime.min = function min() {
+    for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+      dateTimes[_key] = arguments[_key];
+    }
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("min requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, function (i) {
+      return i.valueOf();
+    }, Math.min);
+  }
+
+  /**
+   * Return the max of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+   * @return {DateTime} the max DateTime, or undefined if called with no argument
+   */;
+  DateTime.max = function max() {
+    for (var _len2 = arguments.length, dateTimes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      dateTimes[_key2] = arguments[_key2];
+    }
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("max requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, function (i) {
+      return i.valueOf();
+    }, Math.max);
+  }
+
+  // MISC
+
+  /**
+   * Explain how a string would be parsed by fromFormat()
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see description)
+   * @param {Object} options - options taken by fromFormat()
+   * @return {Object}
+   */;
+  DateTime.fromFormatExplain = function fromFormatExplain(text, fmt, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    var _options = options,
+      _options$locale = _options.locale,
+      locale = _options$locale === void 0 ? null : _options$locale,
+      _options$numberingSys = _options.numberingSystem,
+      numberingSystem = _options$numberingSys === void 0 ? null : _options$numberingSys,
+      localeToUse = Locale.fromOpts({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        defaultToEN: true
+      });
+    return explainFromTokens(localeToUse, text, fmt);
+  }
+
+  /**
+   * @deprecated use fromFormatExplain instead
+   */;
+  DateTime.fromStringExplain = function fromStringExplain(text, fmt, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    return DateTime.fromFormatExplain(text, fmt, options);
+  }
+
+  /**
+   * Build a parser for `fmt` using the given locale. This parser can be passed
+   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+   * can be used to optimize cases where many dates need to be parsed in a
+   * specific format.
+   *
+   * @param {String} fmt - the format the string is expected to be in (see
+   * description)
+   * @param {Object} options - options used to set locale and numberingSystem
+   * for parser
+   * @returns {TokenParser} - opaque object to be used
+   */;
+  DateTime.buildFormatParser = function buildFormatParser(fmt, options) {
+    if (options === void 0) {
+      options = {};
+    }
+    var _options2 = options,
+      _options2$locale = _options2.locale,
+      locale = _options2$locale === void 0 ? null : _options2$locale,
+      _options2$numberingSy = _options2.numberingSystem,
+      numberingSystem = _options2$numberingSy === void 0 ? null : _options2$numberingSy,
+      localeToUse = Locale.fromOpts({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        defaultToEN: true
+      });
+    return new TokenParser(localeToUse, fmt);
+  }
+
+  /**
+   * Create a DateTime from an input string and format parser.
+   *
+   * The format parser must have been created with the same locale as this call.
+   *
+   * @param {String} text - the string to parse
+   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+   * @param {Object} opts - options taken by fromFormat()
+   * @returns {DateTime}
+   */;
+  DateTime.fromFormatParser = function fromFormatParser(text, formatParser, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    if (isUndefined(text) || isUndefined(formatParser)) {
+      throw new InvalidArgumentError("fromFormatParser requires an input string and a format parser");
+    }
+    var _opts2 = opts,
+      _opts2$locale = _opts2.locale,
+      locale = _opts2$locale === void 0 ? null : _opts2$locale,
+      _opts2$numberingSyste = _opts2.numberingSystem,
+      numberingSystem = _opts2$numberingSyste === void 0 ? null : _opts2$numberingSyste,
+      localeToUse = Locale.fromOpts({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        defaultToEN: true
+      });
+    if (!localeToUse.equals(formatParser.locale)) {
+      throw new InvalidArgumentError("fromFormatParser called with a locale of " + localeToUse + ", " + ("but the format parser was created for " + formatParser.locale));
+    }
+    var _formatParser$explain = formatParser.explainFromTokens(text),
+      result = _formatParser$explain.result,
+      zone = _formatParser$explain.zone,
+      specificOffset = _formatParser$explain.specificOffset,
+      invalidReason = _formatParser$explain.invalidReason;
+    if (invalidReason) {
+      return DateTime.invalid(invalidReason);
+    } else {
+      return parseDataToDateTime(result, zone, opts, "format " + formatParser.format, text, specificOffset);
+    }
+  }
+
+  // FORMAT PRESETS
+
+  /**
+   * {@link DateTime#toLocaleString} format like 10/14/1983
+   * @type {Object}
+   */;
+  _createClass(DateTime, [{
+    key: "isValid",
+    get: function get() {
+      return this.invalid === null;
+    }
+
+    /**
+     * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+     * @type {string}
+     */
+  }, {
+    key: "invalidReason",
+    get: function get() {
+      return this.invalid ? this.invalid.reason : null;
+    }
+
+    /**
+     * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+     * @type {string}
+     */
+  }, {
+    key: "invalidExplanation",
+    get: function get() {
+      return this.invalid ? this.invalid.explanation : null;
+    }
+
+    /**
+     * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+     *
+     * @type {string}
+     */
+  }, {
+    key: "locale",
+    get: function get() {
+      return this.isValid ? this.loc.locale : null;
+    }
+
+    /**
+     * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+     *
+     * @type {string}
+     */
+  }, {
+    key: "numberingSystem",
+    get: function get() {
+      return this.isValid ? this.loc.numberingSystem : null;
+    }
+
+    /**
+     * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+     *
+     * @type {string}
+     */
+  }, {
+    key: "outputCalendar",
+    get: function get() {
+      return this.isValid ? this.loc.outputCalendar : null;
+    }
+
+    /**
+     * Get the time zone associated with this DateTime.
+     * @type {Zone}
+     */
+  }, {
+    key: "zone",
+    get: function get() {
+      return this._zone;
+    }
+
+    /**
+     * Get the name of the time zone.
+     * @type {string}
+     */
+  }, {
+    key: "zoneName",
+    get: function get() {
+      return this.isValid ? this.zone.name : null;
+    }
+
+    /**
+     * Get the year
+     * @example DateTime.local(2017, 5, 25).year //=> 2017
+     * @type {number}
+     */
+  }, {
+    key: "year",
+    get: function get() {
+      return this.isValid ? this.c.year : NaN;
+    }
+
+    /**
+     * Get the quarter
+     * @example DateTime.local(2017, 5, 25).quarter //=> 2
+     * @type {number}
+     */
+  }, {
+    key: "quarter",
+    get: function get() {
+      return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+    }
+
+    /**
+     * Get the month (1-12).
+     * @example DateTime.local(2017, 5, 25).month //=> 5
+     * @type {number}
+     */
+  }, {
+    key: "month",
+    get: function get() {
+      return this.isValid ? this.c.month : NaN;
+    }
+
+    /**
+     * Get the day of the month (1-30ish).
+     * @example DateTime.local(2017, 5, 25).day //=> 25
+     * @type {number}
+     */
+  }, {
+    key: "day",
+    get: function get() {
+      return this.isValid ? this.c.day : NaN;
+    }
+
+    /**
+     * Get the hour of the day (0-23).
+     * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+     * @type {number}
+     */
+  }, {
+    key: "hour",
+    get: function get() {
+      return this.isValid ? this.c.hour : NaN;
+    }
+
+    /**
+     * Get the minute of the hour (0-59).
+     * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+     * @type {number}
+     */
+  }, {
+    key: "minute",
+    get: function get() {
+      return this.isValid ? this.c.minute : NaN;
+    }
+
+    /**
+     * Get the second of the minute (0-59).
+     * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+     * @type {number}
+     */
+  }, {
+    key: "second",
+    get: function get() {
+      return this.isValid ? this.c.second : NaN;
+    }
+
+    /**
+     * Get the millisecond of the second (0-999).
+     * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+     * @type {number}
+     */
+  }, {
+    key: "millisecond",
+    get: function get() {
+      return this.isValid ? this.c.millisecond : NaN;
+    }
+
+    /**
+     * Get the week year
+     * @see https://en.wikipedia.org/wiki/ISO_week_date
+     * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+     * @type {number}
+     */
+  }, {
+    key: "weekYear",
+    get: function get() {
+      return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+    }
+
+    /**
+     * Get the week number of the week year (1-52ish).
+     * @see https://en.wikipedia.org/wiki/ISO_week_date
+     * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+     * @type {number}
+     */
+  }, {
+    key: "weekNumber",
+    get: function get() {
+      return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+    }
+
+    /**
+     * Get the day of the week.
+     * 1 is Monday and 7 is Sunday
+     * @see https://en.wikipedia.org/wiki/ISO_week_date
+     * @example DateTime.local(2014, 11, 31).weekday //=> 4
+     * @type {number}
+     */
+  }, {
+    key: "weekday",
+    get: function get() {
+      return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+    }
+
+    /**
+     * Returns true if this date is on a weekend according to the locale, false otherwise
+     * @returns {boolean}
+     */
+  }, {
+    key: "isWeekend",
+    get: function get() {
+      return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+    }
+
+    /**
+     * Get the day of the week according to the locale.
+     * 1 is the first day of the week and 7 is the last day of the week.
+     * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+     * @returns {number}
+     */
+  }, {
+    key: "localWeekday",
+    get: function get() {
+      return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+    }
+
+    /**
+     * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+     * because the week can start on different days of the week (see localWeekday) and because a different number of days
+     * is required for a week to count as the first week of a year.
+     * @returns {number}
+     */
+  }, {
+    key: "localWeekNumber",
+    get: function get() {
+      return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+    }
+
+    /**
+     * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+     * differently, see localWeekNumber.
+     * @returns {number}
+     */
+  }, {
+    key: "localWeekYear",
+    get: function get() {
+      return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+    }
+
+    /**
+     * Get the ordinal (meaning the day of the year)
+     * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+     * @type {number|DateTime}
+     */
+  }, {
+    key: "ordinal",
+    get: function get() {
+      return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+    }
+
+    /**
+     * Get the human readable short month name, such as 'Oct'.
+     * Defaults to the system's locale if no locale has been specified
+     * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+     * @type {string}
+     */
+  }, {
+    key: "monthShort",
+    get: function get() {
+      return this.isValid ? Info.months("short", {
+        locObj: this.loc
+      })[this.month - 1] : null;
+    }
+
+    /**
+     * Get the human readable long month name, such as 'October'.
+     * Defaults to the system's locale if no locale has been specified
+     * @example DateTime.local(2017, 10, 30).monthLong //=> October
+     * @type {string}
+     */
+  }, {
+    key: "monthLong",
+    get: function get() {
+      return this.isValid ? Info.months("long", {
+        locObj: this.loc
+      })[this.month - 1] : null;
+    }
+
+    /**
+     * Get the human readable short weekday, such as 'Mon'.
+     * Defaults to the system's locale if no locale has been specified
+     * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+     * @type {string}
+     */
+  }, {
+    key: "weekdayShort",
+    get: function get() {
+      return this.isValid ? Info.weekdays("short", {
+        locObj: this.loc
+      })[this.weekday - 1] : null;
+    }
+
+    /**
+     * Get the human readable long weekday, such as 'Monday'.
+     * Defaults to the system's locale if no locale has been specified
+     * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+     * @type {string}
+     */
+  }, {
+    key: "weekdayLong",
+    get: function get() {
+      return this.isValid ? Info.weekdays("long", {
+        locObj: this.loc
+      })[this.weekday - 1] : null;
+    }
+
+    /**
+     * Get the UTC offset of this DateTime in minutes
+     * @example DateTime.now().offset //=> -240
+     * @example DateTime.utc().offset //=> 0
+     * @type {number}
+     */
+  }, {
+    key: "offset",
+    get: function get() {
+      return this.isValid ? +this.o : NaN;
+    }
+
+    /**
+     * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+     * Defaults to the system's locale if no locale has been specified
+     * @type {string}
+     */
+  }, {
+    key: "offsetNameShort",
+    get: function get() {
+      if (this.isValid) {
+        return this.zone.offsetName(this.ts, {
+          format: "short",
+          locale: this.locale
+        });
+      } else {
+        return null;
+      }
+    }
+
+    /**
+     * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+     * Defaults to the system's locale if no locale has been specified
+     * @type {string}
+     */
+  }, {
+    key: "offsetNameLong",
+    get: function get() {
+      if (this.isValid) {
+        return this.zone.offsetName(this.ts, {
+          format: "long",
+          locale: this.locale
+        });
+      } else {
+        return null;
+      }
+    }
+
+    /**
+     * Get whether this zone's offset ever changes, as in a DST.
+     * @type {boolean}
+     */
+  }, {
+    key: "isOffsetFixed",
+    get: function get() {
+      return this.isValid ? this.zone.isUniversal : null;
+    }
+
+    /**
+     * Get whether the DateTime is in a DST.
+     * @type {boolean}
+     */
+  }, {
+    key: "isInDST",
+    get: function get() {
+      if (this.isOffsetFixed) {
+        return false;
+      } else {
+        return this.offset > this.set({
+          month: 1,
+          day: 1
+        }).offset || this.offset > this.set({
+          month: 5
+        }).offset;
+      }
+    }
+  }, {
+    key: "isInLeapYear",
+    get: function get() {
+      return isLeapYear(this.year);
+    }
+
+    /**
+     * Returns the number of days in this DateTime's month
+     * @example DateTime.local(2016, 2).daysInMonth //=> 29
+     * @example DateTime.local(2016, 3).daysInMonth //=> 31
+     * @type {number}
+     */
+  }, {
+    key: "daysInMonth",
+    get: function get() {
+      return daysInMonth(this.year, this.month);
+    }
+
+    /**
+     * Returns the number of days in this DateTime's year
+     * @example DateTime.local(2016).daysInYear //=> 366
+     * @example DateTime.local(2013).daysInYear //=> 365
+     * @type {number}
+     */
+  }, {
+    key: "daysInYear",
+    get: function get() {
+      return this.isValid ? daysInYear(this.year) : NaN;
+    }
+
+    /**
+     * Returns the number of weeks in this DateTime's year
+     * @see https://en.wikipedia.org/wiki/ISO_week_date
+     * @example DateTime.local(2004).weeksInWeekYear //=> 53
+     * @example DateTime.local(2013).weeksInWeekYear //=> 52
+     * @type {number}
+     */
+  }, {
+    key: "weeksInWeekYear",
+    get: function get() {
+      return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+    }
+
+    /**
+     * Returns the number of weeks in this DateTime's local week year
+     * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+     * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+     * @type {number}
+     */
+  }, {
+    key: "weeksInLocalWeekYear",
+    get: function get() {
+      return this.isValid ? weeksInWeekYear(this.localWeekYear, this.loc.getMinDaysInFirstWeek(), this.loc.getStartOfWeek()) : NaN;
+    }
+  }], [{
+    key: "DATE_SHORT",
+    get: function get() {
+      return DATE_SHORT;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+     * @type {Object}
+     */
+  }, {
+    key: "DATE_MED",
+    get: function get() {
+      return DATE_MED;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+     * @type {Object}
+     */
+  }, {
+    key: "DATE_MED_WITH_WEEKDAY",
+    get: function get() {
+      return DATE_MED_WITH_WEEKDAY;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+     * @type {Object}
+     */
+  }, {
+    key: "DATE_FULL",
+    get: function get() {
+      return DATE_FULL;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+     * @type {Object}
+     */
+  }, {
+    key: "DATE_HUGE",
+    get: function get() {
+      return DATE_HUGE;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_SIMPLE",
+    get: function get() {
+      return TIME_SIMPLE;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_WITH_SECONDS",
+    get: function get() {
+      return TIME_WITH_SECONDS;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_WITH_SHORT_OFFSET",
+    get: function get() {
+      return TIME_WITH_SHORT_OFFSET;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_WITH_LONG_OFFSET",
+    get: function get() {
+      return TIME_WITH_LONG_OFFSET;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_24_SIMPLE",
+    get: function get() {
+      return TIME_24_SIMPLE;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_24_WITH_SECONDS",
+    get: function get() {
+      return TIME_24_WITH_SECONDS;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_24_WITH_SHORT_OFFSET",
+    get: function get() {
+      return TIME_24_WITH_SHORT_OFFSET;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+     * @type {Object}
+     */
+  }, {
+    key: "TIME_24_WITH_LONG_OFFSET",
+    get: function get() {
+      return TIME_24_WITH_LONG_OFFSET;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_SHORT",
+    get: function get() {
+      return DATETIME_SHORT;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_SHORT_WITH_SECONDS",
+    get: function get() {
+      return DATETIME_SHORT_WITH_SECONDS;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_MED",
+    get: function get() {
+      return DATETIME_MED;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_MED_WITH_SECONDS",
+    get: function get() {
+      return DATETIME_MED_WITH_SECONDS;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_MED_WITH_WEEKDAY",
+    get: function get() {
+      return DATETIME_MED_WITH_WEEKDAY;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_FULL",
+    get: function get() {
+      return DATETIME_FULL;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_FULL_WITH_SECONDS",
+    get: function get() {
+      return DATETIME_FULL_WITH_SECONDS;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_HUGE",
+    get: function get() {
+      return DATETIME_HUGE;
+    }
+
+    /**
+     * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+     * @type {Object}
+     */
+  }, {
+    key: "DATETIME_HUGE_WITH_SECONDS",
+    get: function get() {
+      return DATETIME_HUGE_WITH_SECONDS;
+    }
+  }]);
+  return DateTime;
+}(Symbol.for("nodejs.util.inspect.custom"));
+function friendlyDateTime(dateTimeish) {
+  if (DateTime.isDateTime(dateTimeish)) {
+    return dateTimeish;
+  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+    return DateTime.fromJSDate(dateTimeish);
+  } else if (dateTimeish && typeof dateTimeish === "object") {
+    return DateTime.fromObject(dateTimeish);
+  } else {
+    throw new InvalidArgumentError("Unknown datetime argument: " + dateTimeish + ", of type " + typeof dateTimeish);
+  }
+}
+
+var VERSION = "3.7.2";
+
+exports.DateTime = DateTime;
+exports.Duration = Duration;
+exports.FixedOffsetZone = FixedOffsetZone;
+exports.IANAZone = IANAZone;
+exports.Info = Info;
+exports.Interval = Interval;
+exports.InvalidZone = InvalidZone;
+exports.Settings = Settings;
+exports.SystemZone = SystemZone;
+exports.VERSION = VERSION;
+exports.Zone = Zone;
+//# sourceMappingURL=luxon.js.map
diff --git a/node_modules/luxon/build/cjs-browser/luxon.js.map b/node_modules/luxon/build/cjs-browser/luxon.js.map
new file mode 100644
index 0000000..e965cb9
--- /dev/null
+++ b/node_modules/luxon/build/cjs-browser/luxon.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"luxon.js","sources":["../../src/errors.js","../../src/impl/formats.js","../../src/zone.js","../../src/zones/systemZone.js","../../src/zones/IANAZone.js","../../src/impl/locale.js","../../src/zones/fixedOffsetZone.js","../../src/zones/invalidZone.js","../../src/impl/zoneUtil.js","../../src/impl/digits.js","../../src/settings.js","../../src/impl/invalid.js","../../src/impl/conversions.js","../../src/impl/util.js","../../src/impl/english.js","../../src/impl/formatter.js","../../src/impl/regexParser.js","../../src/duration.js","../../src/interval.js","../../src/info.js","../../src/impl/diff.js","../../src/impl/tokenParser.js","../../src/datetime.js","../../src/luxon.js"],"sourcesContent":["// these aren't really private, but nor are they really useful to document\n\n/**\n * @private\n */\nclass LuxonError extends Error {}\n\n/**\n * @private\n */\nexport class InvalidDateTimeError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid DateTime: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidIntervalError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Interval: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidDurationError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Duration: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class ConflictingSpecificationError extends LuxonError {}\n\n/**\n * @private\n */\nexport class InvalidUnitError extends LuxonError {\n  constructor(unit) {\n    super(`Invalid unit ${unit}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidArgumentError extends LuxonError {}\n\n/**\n * @private\n */\nexport class ZoneIsAbstractError extends LuxonError {\n  constructor() {\n    super(\"Zone is an abstract class\");\n  }\n}\n","/**\n * @private\n */\n\nconst n = \"numeric\",\n  s = \"short\",\n  l = \"long\";\n\nexport const DATE_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n};\n\nexport const DATE_MED = {\n  year: n,\n  month: s,\n  day: n,\n};\n\nexport const DATE_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n};\n\nexport const DATE_FULL = {\n  year: n,\n  month: l,\n  day: n,\n};\n\nexport const DATE_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n};\n\nexport const TIME_SIMPLE = {\n  hour: n,\n  minute: n,\n};\n\nexport const TIME_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const TIME_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const TIME_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n\nexport const TIME_24_SIMPLE = {\n  hour: n,\n  minute: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: s,\n};\n\nexport const TIME_24_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: l,\n};\n\nexport const DATETIME_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_SHORT_WITH_SECONDS = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_MED_WITH_SECONDS = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_FULL = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_FULL_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  timeZoneName: l,\n};\n\nexport const DATETIME_HUGE_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n","import { ZoneIsAbstractError } from \"./errors.js\";\n\n/**\n * @interface\n */\nexport default class Zone {\n  /**\n   * The type of zone\n   * @abstract\n   * @type {string}\n   */\n  get type() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The name of this zone.\n   * @abstract\n   * @type {string}\n   */\n  get name() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The IANA name of this zone.\n   * Defaults to `name` if not overwritten by a subclass.\n   * @abstract\n   * @type {string}\n   */\n  get ianaName() {\n    return this.name;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year.\n   * @abstract\n   * @type {boolean}\n   */\n  get isUniversal() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, opts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @abstract\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @abstract\n   * @type {boolean}\n   */\n  get isValid() {\n    throw new ZoneIsAbstractError();\n  }\n}\n","import { formatOffset, parseZoneInfo } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * Represents the local zone for this JavaScript environment.\n * @implements {Zone}\n */\nexport default class SystemZone extends Zone {\n  /**\n   * Get a singleton instance of the local zone\n   * @return {SystemZone}\n   */\n  static get instance() {\n    if (singleton === null) {\n      singleton = new SystemZone();\n    }\n    return singleton;\n  }\n\n  /** @override **/\n  get type() {\n    return \"system\";\n  }\n\n  /** @override **/\n  get name() {\n    return new Intl.DateTimeFormat().resolvedOptions().timeZone;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale);\n  }\n\n  /** @override **/\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /** @override **/\n  offset(ts) {\n    return -new Date(ts).getTimezoneOffset();\n  }\n\n  /** @override **/\n  equals(otherZone) {\n    return otherZone.type === \"system\";\n  }\n\n  /** @override **/\n  get isValid() {\n    return true;\n  }\n}\n","import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nconst dtfCache = new Map();\nfunction makeDTF(zoneName) {\n  let dtf = dtfCache.get(zoneName);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(\"en-US\", {\n      hour12: false,\n      timeZone: zoneName,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      era: \"short\",\n    });\n    dtfCache.set(zoneName, dtf);\n  }\n  return dtf;\n}\n\nconst typeToPos = {\n  year: 0,\n  month: 1,\n  day: 2,\n  era: 3,\n  hour: 4,\n  minute: 5,\n  second: 6,\n};\n\nfunction hackyOffset(dtf, date) {\n  const formatted = dtf.format(date).replace(/\\u200E/g, \"\"),\n    parsed = /(\\d+)\\/(\\d+)\\/(\\d+) (AD|BC),? (\\d+):(\\d+):(\\d+)/.exec(formatted),\n    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;\n  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];\n}\n\nfunction partsOffset(dtf, date) {\n  const formatted = dtf.formatToParts(date);\n  const filled = [];\n  for (let i = 0; i < formatted.length; i++) {\n    const { type, value } = formatted[i];\n    const pos = typeToPos[type];\n\n    if (type === \"era\") {\n      filled[pos] = value;\n    } else if (!isUndefined(pos)) {\n      filled[pos] = parseInt(value, 10);\n    }\n  }\n  return filled;\n}\n\nconst ianaZoneCache = new Map();\n/**\n * A zone identified by an IANA identifier, like America/New_York\n * @implements {Zone}\n */\nexport default class IANAZone extends Zone {\n  /**\n   * @param {string} name - Zone name\n   * @return {IANAZone}\n   */\n  static create(name) {\n    let zone = ianaZoneCache.get(name);\n    if (zone === undefined) {\n      ianaZoneCache.set(name, (zone = new IANAZone(name)));\n    }\n    return zone;\n  }\n\n  /**\n   * Reset local caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCache() {\n    ianaZoneCache.clear();\n    dtfCache.clear();\n  }\n\n  /**\n   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.\n   * @param {string} s - The string to check validity on\n   * @example IANAZone.isValidSpecifier(\"America/New_York\") //=> true\n   * @example IANAZone.isValidSpecifier(\"Sport~~blorp\") //=> false\n   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.\n   * @return {boolean}\n   */\n  static isValidSpecifier(s) {\n    return this.isValidZone(s);\n  }\n\n  /**\n   * Returns whether the provided string identifies a real zone\n   * @param {string} zone - The string to check\n   * @example IANAZone.isValidZone(\"America/New_York\") //=> true\n   * @example IANAZone.isValidZone(\"Fantasia/Castle\") //=> false\n   * @example IANAZone.isValidZone(\"Sport~~blorp\") //=> false\n   * @return {boolean}\n   */\n  static isValidZone(zone) {\n    if (!zone) {\n      return false;\n    }\n    try {\n      new Intl.DateTimeFormat(\"en-US\", { timeZone: zone }).format();\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  constructor(name) {\n    super();\n    /** @private **/\n    this.zoneName = name;\n    /** @private **/\n    this.valid = IANAZone.isValidZone(name);\n  }\n\n  /**\n   * The type of zone. `iana` for all instances of `IANAZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"iana\";\n  }\n\n  /**\n   * The name of this zone (i.e. the IANA zone name).\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.zoneName;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns false for all IANA zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return false;\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale, this.name);\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    if (!this.valid) return NaN;\n    const date = new Date(ts);\n\n    if (isNaN(date)) return NaN;\n\n    const dtf = makeDTF(this.name);\n    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts\n      ? partsOffset(dtf, date)\n      : hackyOffset(dtf, date);\n\n    if (adOrBc === \"BC\") {\n      year = -Math.abs(year) + 1;\n    }\n\n    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat\n    const adjustedHour = hour === 24 ? 0 : hour;\n\n    const asUTC = objToLocalTS({\n      year,\n      month,\n      day,\n      hour: adjustedHour,\n      minute,\n      second,\n      millisecond: 0,\n    });\n\n    let asTS = +date;\n    const over = asTS % 1000;\n    asTS -= over >= 0 ? over : 1000 + over;\n    return (asUTC - asTS) / (60 * 1000);\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"iana\" && otherZone.name === this.name;\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.valid;\n  }\n}\n","import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from \"./util.js\";\nimport * as English from \"./english.js\";\nimport Settings from \"../settings.js\";\nimport DateTime from \"../datetime.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n// todo - remap caching\n\nlet intlLFCache = {};\nfunction getCachedLF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlLFCache[key];\n  if (!dtf) {\n    dtf = new Intl.ListFormat(locString, opts);\n    intlLFCache[key] = dtf;\n  }\n  return dtf;\n}\n\nconst intlDTCache = new Map();\nfunction getCachedDTF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlDTCache.get(key);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(locString, opts);\n    intlDTCache.set(key, dtf);\n  }\n  return dtf;\n}\n\nconst intlNumCache = new Map();\nfunction getCachedINF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let inf = intlNumCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.NumberFormat(locString, opts);\n    intlNumCache.set(key, inf);\n  }\n  return inf;\n}\n\nconst intlRelCache = new Map();\nfunction getCachedRTF(locString, opts = {}) {\n  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options\n  const key = JSON.stringify([locString, cacheKeyOpts]);\n  let inf = intlRelCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.RelativeTimeFormat(locString, opts);\n    intlRelCache.set(key, inf);\n  }\n  return inf;\n}\n\nlet sysLocaleCache = null;\nfunction systemLocale() {\n  if (sysLocaleCache) {\n    return sysLocaleCache;\n  } else {\n    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;\n    return sysLocaleCache;\n  }\n}\n\nconst intlResolvedOptionsCache = new Map();\nfunction getCachedIntResolvedOptions(locString) {\n  let opts = intlResolvedOptionsCache.get(locString);\n  if (opts === undefined) {\n    opts = new Intl.DateTimeFormat(locString).resolvedOptions();\n    intlResolvedOptionsCache.set(locString, opts);\n  }\n  return opts;\n}\n\nconst weekInfoCache = new Map();\nfunction getCachedWeekInfo(locString) {\n  let data = weekInfoCache.get(locString);\n  if (!data) {\n    const locale = new Intl.Locale(locString);\n    // browsers currently implement this as a property, but spec says it should be a getter function\n    data = \"getWeekInfo\" in locale ? locale.getWeekInfo() : locale.weekInfo;\n    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86\n    if (!(\"minimalDays\" in data)) {\n      data = { ...fallbackWeekSettings, ...data };\n    }\n    weekInfoCache.set(locString, data);\n  }\n  return data;\n}\n\nfunction parseLocaleString(localeStr) {\n  // I really want to avoid writing a BCP 47 parser\n  // see, e.g. https://github.com/wooorm/bcp-47\n  // Instead, we'll do this:\n\n  // a) if the string has no -u extensions, just leave it alone\n  // b) if it does, use Intl to resolve everything\n  // c) if Intl fails, try again without the -u\n\n  // private subtags and unicode subtags have ordering requirements,\n  // and we're not properly parsing this, so just strip out the\n  // private ones if they exist.\n  const xIndex = localeStr.indexOf(\"-x-\");\n  if (xIndex !== -1) {\n    localeStr = localeStr.substring(0, xIndex);\n  }\n\n  const uIndex = localeStr.indexOf(\"-u-\");\n  if (uIndex === -1) {\n    return [localeStr];\n  } else {\n    let options;\n    let selectedStr;\n    try {\n      options = getCachedDTF(localeStr).resolvedOptions();\n      selectedStr = localeStr;\n    } catch (e) {\n      const smaller = localeStr.substring(0, uIndex);\n      options = getCachedDTF(smaller).resolvedOptions();\n      selectedStr = smaller;\n    }\n\n    const { numberingSystem, calendar } = options;\n    return [selectedStr, numberingSystem, calendar];\n  }\n}\n\nfunction intlConfigString(localeStr, numberingSystem, outputCalendar) {\n  if (outputCalendar || numberingSystem) {\n    if (!localeStr.includes(\"-u-\")) {\n      localeStr += \"-u\";\n    }\n\n    if (outputCalendar) {\n      localeStr += `-ca-${outputCalendar}`;\n    }\n\n    if (numberingSystem) {\n      localeStr += `-nu-${numberingSystem}`;\n    }\n    return localeStr;\n  } else {\n    return localeStr;\n  }\n}\n\nfunction mapMonths(f) {\n  const ms = [];\n  for (let i = 1; i <= 12; i++) {\n    const dt = DateTime.utc(2009, i, 1);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction mapWeekdays(f) {\n  const ms = [];\n  for (let i = 1; i <= 7; i++) {\n    const dt = DateTime.utc(2016, 11, 13 + i);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction listStuff(loc, length, englishFn, intlFn) {\n  const mode = loc.listingMode();\n\n  if (mode === \"error\") {\n    return null;\n  } else if (mode === \"en\") {\n    return englishFn(length);\n  } else {\n    return intlFn(length);\n  }\n}\n\nfunction supportsFastNumbers(loc) {\n  if (loc.numberingSystem && loc.numberingSystem !== \"latn\") {\n    return false;\n  } else {\n    return (\n      loc.numberingSystem === \"latn\" ||\n      !loc.locale ||\n      loc.locale.startsWith(\"en\") ||\n      getCachedIntResolvedOptions(loc.locale).numberingSystem === \"latn\"\n    );\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyNumberFormatter {\n  constructor(intl, forceSimple, opts) {\n    this.padTo = opts.padTo || 0;\n    this.floor = opts.floor || false;\n\n    const { padTo, floor, ...otherOpts } = opts;\n\n    if (!forceSimple || Object.keys(otherOpts).length > 0) {\n      const intlOpts = { useGrouping: false, ...opts };\n      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;\n      this.inf = getCachedINF(intl, intlOpts);\n    }\n  }\n\n  format(i) {\n    if (this.inf) {\n      const fixed = this.floor ? Math.floor(i) : i;\n      return this.inf.format(fixed);\n    } else {\n      // to match the browser's numberformatter defaults\n      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);\n      return padStart(fixed, this.padTo);\n    }\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyDateFormatter {\n  constructor(dt, intl, opts) {\n    this.opts = opts;\n    this.originalZone = undefined;\n\n    let z = undefined;\n    if (this.opts.timeZone) {\n      // Don't apply any workarounds if a timeZone is explicitly provided in opts\n      this.dt = dt;\n    } else if (dt.zone.type === \"fixed\") {\n      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.\n      // That is why fixed-offset TZ is set to that unless it is:\n      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.\n      // 2. Unsupported by the browser:\n      //    - some do not support Etc/\n      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata\n      const gmtOffset = -1 * (dt.offset / 60);\n      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;\n      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {\n        z = offsetZ;\n        this.dt = dt;\n      } else {\n        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so\n        // we manually apply the offset and substitute the zone as needed.\n        z = \"UTC\";\n        this.dt = dt.offset === 0 ? dt : dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n        this.originalZone = dt.zone;\n      }\n    } else if (dt.zone.type === \"system\") {\n      this.dt = dt;\n    } else if (dt.zone.type === \"iana\") {\n      this.dt = dt;\n      z = dt.zone.name;\n    } else {\n      // Custom zones can have any offset / offsetName so we just manually\n      // apply the offset and substitute the zone as needed.\n      z = \"UTC\";\n      this.dt = dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n      this.originalZone = dt.zone;\n    }\n\n    const intlOpts = { ...this.opts };\n    intlOpts.timeZone = intlOpts.timeZone || z;\n    this.dtf = getCachedDTF(intl, intlOpts);\n  }\n\n  format() {\n    if (this.originalZone) {\n      // If we have to substitute in the actual zone name, we have to use\n      // formatToParts so that the timezone can be replaced.\n      return this.formatToParts()\n        .map(({ value }) => value)\n        .join(\"\");\n    }\n    return this.dtf.format(this.dt.toJSDate());\n  }\n\n  formatToParts() {\n    const parts = this.dtf.formatToParts(this.dt.toJSDate());\n    if (this.originalZone) {\n      return parts.map((part) => {\n        if (part.type === \"timeZoneName\") {\n          const offsetName = this.originalZone.offsetName(this.dt.ts, {\n            locale: this.dt.locale,\n            format: this.opts.timeZoneName,\n          });\n          return {\n            ...part,\n            value: offsetName,\n          };\n        } else {\n          return part;\n        }\n      });\n    }\n    return parts;\n  }\n\n  resolvedOptions() {\n    return this.dtf.resolvedOptions();\n  }\n}\n\n/**\n * @private\n */\nclass PolyRelFormatter {\n  constructor(intl, isEnglish, opts) {\n    this.opts = { style: \"long\", ...opts };\n    if (!isEnglish && hasRelative()) {\n      this.rtf = getCachedRTF(intl, opts);\n    }\n  }\n\n  format(count, unit) {\n    if (this.rtf) {\n      return this.rtf.format(count, unit);\n    } else {\n      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== \"long\");\n    }\n  }\n\n  formatToParts(count, unit) {\n    if (this.rtf) {\n      return this.rtf.formatToParts(count, unit);\n    } else {\n      return [];\n    }\n  }\n}\n\nconst fallbackWeekSettings = {\n  firstDay: 1,\n  minimalDays: 4,\n  weekend: [6, 7],\n};\n\n/**\n * @private\n */\nexport default class Locale {\n  static fromOpts(opts) {\n    return Locale.create(\n      opts.locale,\n      opts.numberingSystem,\n      opts.outputCalendar,\n      opts.weekSettings,\n      opts.defaultToEN\n    );\n  }\n\n  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {\n    const specifiedLocale = locale || Settings.defaultLocale;\n    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats\n    const localeR = specifiedLocale || (defaultToEN ? \"en-US\" : systemLocale());\n    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;\n    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;\n    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;\n    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);\n  }\n\n  static resetCache() {\n    sysLocaleCache = null;\n    intlDTCache.clear();\n    intlNumCache.clear();\n    intlRelCache.clear();\n    intlResolvedOptionsCache.clear();\n    weekInfoCache.clear();\n  }\n\n  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {\n    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);\n  }\n\n  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {\n    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);\n\n    this.locale = parsedLocale;\n    this.numberingSystem = numbering || parsedNumberingSystem || null;\n    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;\n    this.weekSettings = weekSettings;\n    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);\n\n    this.weekdaysCache = { format: {}, standalone: {} };\n    this.monthsCache = { format: {}, standalone: {} };\n    this.meridiemCache = null;\n    this.eraCache = {};\n\n    this.specifiedLocale = specifiedLocale;\n    this.fastNumbersCached = null;\n  }\n\n  get fastNumbers() {\n    if (this.fastNumbersCached == null) {\n      this.fastNumbersCached = supportsFastNumbers(this);\n    }\n\n    return this.fastNumbersCached;\n  }\n\n  listingMode() {\n    const isActuallyEn = this.isEnglish();\n    const hasNoWeirdness =\n      (this.numberingSystem === null || this.numberingSystem === \"latn\") &&\n      (this.outputCalendar === null || this.outputCalendar === \"gregory\");\n    return isActuallyEn && hasNoWeirdness ? \"en\" : \"intl\";\n  }\n\n  clone(alts) {\n    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {\n      return this;\n    } else {\n      return Locale.create(\n        alts.locale || this.specifiedLocale,\n        alts.numberingSystem || this.numberingSystem,\n        alts.outputCalendar || this.outputCalendar,\n        validateWeekSettings(alts.weekSettings) || this.weekSettings,\n        alts.defaultToEN || false\n      );\n    }\n  }\n\n  redefaultToEN(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: true });\n  }\n\n  redefaultToSystem(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: false });\n  }\n\n  months(length, format = false) {\n    return listStuff(this, length, English.months, () => {\n      // Workaround for \"ja\" locale: formatToParts does not label all parts of the month\n      // as \"month\" and for this locale there is no difference between \"format\" and \"non-format\".\n      // As such, just use format() instead of formatToParts() and take the whole string\n      const monthSpecialCase = this.intl === \"ja\" || this.intl.startsWith(\"ja-\");\n      format &= !monthSpecialCase;\n      const intl = format ? { month: length, day: \"numeric\" } : { month: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.monthsCache[formatStr][length]) {\n        const mapper = !monthSpecialCase\n          ? (dt) => this.extract(dt, intl, \"month\")\n          : (dt) => this.dtFormatter(dt, intl).format();\n        this.monthsCache[formatStr][length] = mapMonths(mapper);\n      }\n      return this.monthsCache[formatStr][length];\n    });\n  }\n\n  weekdays(length, format = false) {\n    return listStuff(this, length, English.weekdays, () => {\n      const intl = format\n          ? { weekday: length, year: \"numeric\", month: \"long\", day: \"numeric\" }\n          : { weekday: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.weekdaysCache[formatStr][length]) {\n        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>\n          this.extract(dt, intl, \"weekday\")\n        );\n      }\n      return this.weekdaysCache[formatStr][length];\n    });\n  }\n\n  meridiems() {\n    return listStuff(\n      this,\n      undefined,\n      () => English.meridiems,\n      () => {\n        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two\n        // for AM and PM. This is probably wrong, but it's makes parsing way easier.\n        if (!this.meridiemCache) {\n          const intl = { hour: \"numeric\", hourCycle: \"h12\" };\n          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(\n            (dt) => this.extract(dt, intl, \"dayperiod\")\n          );\n        }\n\n        return this.meridiemCache;\n      }\n    );\n  }\n\n  eras(length) {\n    return listStuff(this, length, English.eras, () => {\n      const intl = { era: length };\n\n      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates\n      // to definitely enumerate them.\n      if (!this.eraCache[length]) {\n        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>\n          this.extract(dt, intl, \"era\")\n        );\n      }\n\n      return this.eraCache[length];\n    });\n  }\n\n  extract(dt, intlOpts, field) {\n    const df = this.dtFormatter(dt, intlOpts),\n      results = df.formatToParts(),\n      matching = results.find((m) => m.type.toLowerCase() === field);\n    return matching ? matching.value : null;\n  }\n\n  numberFormatter(opts = {}) {\n    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)\n    // (in contrast, the rest of the condition is used heavily)\n    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);\n  }\n\n  dtFormatter(dt, intlOpts = {}) {\n    return new PolyDateFormatter(dt, this.intl, intlOpts);\n  }\n\n  relFormatter(opts = {}) {\n    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);\n  }\n\n  listFormatter(opts = {}) {\n    return getCachedLF(this.intl, opts);\n  }\n\n  isEnglish() {\n    return (\n      this.locale === \"en\" ||\n      this.locale.toLowerCase() === \"en-us\" ||\n      getCachedIntResolvedOptions(this.intl).locale.startsWith(\"en-us\")\n    );\n  }\n\n  getWeekSettings() {\n    if (this.weekSettings) {\n      return this.weekSettings;\n    } else if (!hasLocaleWeekInfo()) {\n      return fallbackWeekSettings;\n    } else {\n      return getCachedWeekInfo(this.locale);\n    }\n  }\n\n  getStartOfWeek() {\n    return this.getWeekSettings().firstDay;\n  }\n\n  getMinDaysInFirstWeek() {\n    return this.getWeekSettings().minimalDays;\n  }\n\n  getWeekendDays() {\n    return this.getWeekSettings().weekend;\n  }\n\n  equals(other) {\n    return (\n      this.locale === other.locale &&\n      this.numberingSystem === other.numberingSystem &&\n      this.outputCalendar === other.outputCalendar\n    );\n  }\n\n  toString() {\n    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;\n  }\n}\n","import { formatOffset, signedOffset } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * A zone with a fixed offset (meaning no DST)\n * @implements {Zone}\n */\nexport default class FixedOffsetZone extends Zone {\n  /**\n   * Get a singleton instance of UTC\n   * @return {FixedOffsetZone}\n   */\n  static get utcInstance() {\n    if (singleton === null) {\n      singleton = new FixedOffsetZone(0);\n    }\n    return singleton;\n  }\n\n  /**\n   * Get an instance with a specified offset\n   * @param {number} offset - The offset in minutes\n   * @return {FixedOffsetZone}\n   */\n  static instance(offset) {\n    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);\n  }\n\n  /**\n   * Get an instance of FixedOffsetZone from a UTC offset string, like \"UTC+6\"\n   * @param {string} s - The offset string to parse\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+6\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+06\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC-6:00\")\n   * @return {FixedOffsetZone}\n   */\n  static parseSpecifier(s) {\n    if (s) {\n      const r = s.match(/^utc(?:([+-]\\d{1,2})(?::(\\d{2}))?)?$/i);\n      if (r) {\n        return new FixedOffsetZone(signedOffset(r[1], r[2]));\n      }\n    }\n    return null;\n  }\n\n  constructor(offset) {\n    super();\n    /** @private **/\n    this.fixed = offset;\n  }\n\n  /**\n   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"fixed\";\n  }\n\n  /**\n   * The name of this zone.\n   * All fixed zones' names always start with \"UTC\" (plus optional offset)\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.fixed === 0 ? \"UTC\" : `UTC${formatOffset(this.fixed, \"narrow\")}`;\n  }\n\n  /**\n   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`\n   *\n   * @override\n   * @type {string}\n   */\n  get ianaName() {\n    if (this.fixed === 0) {\n      return \"Etc/UTC\";\n    } else {\n      return `Etc/GMT${formatOffset(-this.fixed, \"narrow\")}`;\n    }\n  }\n\n  /**\n   * Returns the offset's common name at the specified timestamp.\n   *\n   * For fixed offset zones this equals to the zone name.\n   * @override\n   */\n  offsetName() {\n    return this.name;\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.fixed, format);\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns true for all fixed offset zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return true;\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   *\n   * For fixed offset zones, this is constant and does not depend on a timestamp.\n   * @override\n   * @return {number}\n   */\n  offset() {\n    return this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"fixed\" && otherZone.fixed === this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is valid:\n   * All fixed offset zones are valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return true;\n  }\n}\n","import Zone from \"../zone.js\";\n\n/**\n * A zone that failed to parse. You should never need to instantiate this.\n * @implements {Zone}\n */\nexport default class InvalidZone extends Zone {\n  constructor(zoneName) {\n    super();\n    /**  @private */\n    this.zoneName = zoneName;\n  }\n\n  /** @override **/\n  get type() {\n    return \"invalid\";\n  }\n\n  /** @override **/\n  get name() {\n    return this.zoneName;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName() {\n    return null;\n  }\n\n  /** @override **/\n  formatOffset() {\n    return \"\";\n  }\n\n  /** @override **/\n  offset() {\n    return NaN;\n  }\n\n  /** @override **/\n  equals() {\n    return false;\n  }\n\n  /** @override **/\n  get isValid() {\n    return false;\n  }\n}\n","/**\n * @private\n */\n\nimport Zone from \"../zone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport InvalidZone from \"../zones/invalidZone.js\";\n\nimport { isUndefined, isString, isNumber } from \"./util.js\";\nimport SystemZone from \"../zones/systemZone.js\";\n\nexport function normalizeZone(input, defaultZone) {\n  let offset;\n  if (isUndefined(input) || input === null) {\n    return defaultZone;\n  } else if (input instanceof Zone) {\n    return input;\n  } else if (isString(input)) {\n    const lowered = input.toLowerCase();\n    if (lowered === \"default\") return defaultZone;\n    else if (lowered === \"local\" || lowered === \"system\") return SystemZone.instance;\n    else if (lowered === \"utc\" || lowered === \"gmt\") return FixedOffsetZone.utcInstance;\n    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);\n  } else if (isNumber(input)) {\n    return FixedOffsetZone.instance(input);\n  } else if (typeof input === \"object\" && \"offset\" in input && typeof input.offset === \"function\") {\n    // This is dumb, but the instanceof check above doesn't seem to really work\n    // so we're duck checking it\n    return input;\n  } else {\n    return new InvalidZone(input);\n  }\n}\n","const numberingSystems = {\n  arab: \"[\\u0660-\\u0669]\",\n  arabext: \"[\\u06F0-\\u06F9]\",\n  bali: \"[\\u1B50-\\u1B59]\",\n  beng: \"[\\u09E6-\\u09EF]\",\n  deva: \"[\\u0966-\\u096F]\",\n  fullwide: \"[\\uFF10-\\uFF19]\",\n  gujr: \"[\\u0AE6-\\u0AEF]\",\n  hanidec: \"[〇|一|二|三|四|五|六|七|八|九]\",\n  khmr: \"[\\u17E0-\\u17E9]\",\n  knda: \"[\\u0CE6-\\u0CEF]\",\n  laoo: \"[\\u0ED0-\\u0ED9]\",\n  limb: \"[\\u1946-\\u194F]\",\n  mlym: \"[\\u0D66-\\u0D6F]\",\n  mong: \"[\\u1810-\\u1819]\",\n  mymr: \"[\\u1040-\\u1049]\",\n  orya: \"[\\u0B66-\\u0B6F]\",\n  tamldec: \"[\\u0BE6-\\u0BEF]\",\n  telu: \"[\\u0C66-\\u0C6F]\",\n  thai: \"[\\u0E50-\\u0E59]\",\n  tibt: \"[\\u0F20-\\u0F29]\",\n  latn: \"\\\\d\",\n};\n\nconst numberingSystemsUTF16 = {\n  arab: [1632, 1641],\n  arabext: [1776, 1785],\n  bali: [6992, 7001],\n  beng: [2534, 2543],\n  deva: [2406, 2415],\n  fullwide: [65296, 65303],\n  gujr: [2790, 2799],\n  khmr: [6112, 6121],\n  knda: [3302, 3311],\n  laoo: [3792, 3801],\n  limb: [6470, 6479],\n  mlym: [3430, 3439],\n  mong: [6160, 6169],\n  mymr: [4160, 4169],\n  orya: [2918, 2927],\n  tamldec: [3046, 3055],\n  telu: [3174, 3183],\n  thai: [3664, 3673],\n  tibt: [3872, 3881],\n};\n\nconst hanidecChars = numberingSystems.hanidec.replace(/[\\[|\\]]/g, \"\").split(\"\");\n\nexport function parseDigits(str) {\n  let value = parseInt(str, 10);\n  if (isNaN(value)) {\n    value = \"\";\n    for (let i = 0; i < str.length; i++) {\n      const code = str.charCodeAt(i);\n\n      if (str[i].search(numberingSystems.hanidec) !== -1) {\n        value += hanidecChars.indexOf(str[i]);\n      } else {\n        for (const key in numberingSystemsUTF16) {\n          const [min, max] = numberingSystemsUTF16[key];\n          if (code >= min && code <= max) {\n            value += code - min;\n          }\n        }\n      }\n    }\n    return parseInt(value, 10);\n  } else {\n    return value;\n  }\n}\n\n// cache of {numberingSystem: {append: regex}}\nconst digitRegexCache = new Map();\nexport function resetDigitRegexCache() {\n  digitRegexCache.clear();\n}\n\nexport function digitRegex({ numberingSystem }, append = \"\") {\n  const ns = numberingSystem || \"latn\";\n\n  let appendCache = digitRegexCache.get(ns);\n  if (appendCache === undefined) {\n    appendCache = new Map();\n    digitRegexCache.set(ns, appendCache);\n  }\n  let regex = appendCache.get(append);\n  if (regex === undefined) {\n    regex = new RegExp(`${numberingSystems[ns]}${append}`);\n    appendCache.set(append, regex);\n  }\n\n  return regex;\n}\n","import SystemZone from \"./zones/systemZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport DateTime from \"./datetime.js\";\n\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport { validateWeekSettings } from \"./impl/util.js\";\nimport { resetDigitRegexCache } from \"./impl/digits.js\";\n\nlet now = () => Date.now(),\n  defaultZone = \"system\",\n  defaultLocale = null,\n  defaultNumberingSystem = null,\n  defaultOutputCalendar = null,\n  twoDigitCutoffYear = 60,\n  throwOnInvalid,\n  defaultWeekSettings = null;\n\n/**\n * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.\n */\nexport default class Settings {\n  /**\n   * Get the callback for returning the current timestamp.\n   * @type {function}\n   */\n  static get now() {\n    return now;\n  }\n\n  /**\n   * Set the callback for returning the current timestamp.\n   * The function should return a number, which will be interpreted as an Epoch millisecond count\n   * @type {function}\n   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future\n   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time\n   */\n  static set now(n) {\n    now = n;\n  }\n\n  /**\n   * Set the default time zone to create DateTimes in. Does not affect existing instances.\n   * Use the value \"system\" to reset this value to the system's time zone.\n   * @type {string}\n   */\n  static set defaultZone(zone) {\n    defaultZone = zone;\n  }\n\n  /**\n   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.\n   * The default value is the system's time zone (the one set on the machine that runs this code).\n   * @type {Zone}\n   */\n  static get defaultZone() {\n    return normalizeZone(defaultZone, SystemZone.instance);\n  }\n\n  /**\n   * Get the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultLocale() {\n    return defaultLocale;\n  }\n\n  /**\n   * Set the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultLocale(locale) {\n    defaultLocale = locale;\n  }\n\n  /**\n   * Get the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultNumberingSystem() {\n    return defaultNumberingSystem;\n  }\n\n  /**\n   * Set the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultNumberingSystem(numberingSystem) {\n    defaultNumberingSystem = numberingSystem;\n  }\n\n  /**\n   * Get the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultOutputCalendar() {\n    return defaultOutputCalendar;\n  }\n\n  /**\n   * Set the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultOutputCalendar(outputCalendar) {\n    defaultOutputCalendar = outputCalendar;\n  }\n\n  /**\n   * @typedef {Object} WeekSettings\n   * @property {number} firstDay\n   * @property {number} minimalDays\n   * @property {number[]} weekend\n   */\n\n  /**\n   * @return {WeekSettings|null}\n   */\n  static get defaultWeekSettings() {\n    return defaultWeekSettings;\n  }\n\n  /**\n   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and\n   * how many days are required in the first week of a year.\n   * Does not affect existing instances.\n   *\n   * @param {WeekSettings|null} weekSettings\n   */\n  static set defaultWeekSettings(weekSettings) {\n    defaultWeekSettings = validateWeekSettings(weekSettings);\n  }\n\n  /**\n   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   */\n  static get twoDigitCutoffYear() {\n    return twoDigitCutoffYear;\n  }\n\n  /**\n   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century\n   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century\n   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950\n   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50\n   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50\n   */\n  static set twoDigitCutoffYear(cutoffYear) {\n    twoDigitCutoffYear = cutoffYear % 100;\n  }\n\n  /**\n   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static get throwOnInvalid() {\n    return throwOnInvalid;\n  }\n\n  /**\n   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static set throwOnInvalid(t) {\n    throwOnInvalid = t;\n  }\n\n  /**\n   * Reset Luxon's global caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCaches() {\n    Locale.resetCache();\n    IANAZone.resetCache();\n    DateTime.resetCache();\n    resetDigitRegexCache();\n  }\n}\n","export default class Invalid {\n  constructor(reason, explanation) {\n    this.reason = reason;\n    this.explanation = explanation;\n  }\n\n  toMessage() {\n    if (this.explanation) {\n      return `${this.reason}: ${this.explanation}`;\n    } else {\n      return this.reason;\n    }\n  }\n}\n","import {\n  integerBetween,\n  isLeapYear,\n  timeObject,\n  daysInYear,\n  daysInMonth,\n  weeksInWeekYear,\n  isInteger,\n  isUndefined,\n} from \"./util.js\";\nimport Invalid from \"./invalid.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],\n  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];\n\nfunction unitOutOfRange(unit, value) {\n  return new Invalid(\n    \"unit out of range\",\n    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`\n  );\n}\n\nexport function dayOfWeek(year, month, day) {\n  const d = new Date(Date.UTC(year, month - 1, day));\n\n  if (year < 100 && year >= 0) {\n    d.setUTCFullYear(d.getUTCFullYear() - 1900);\n  }\n\n  const js = d.getUTCDay();\n\n  return js === 0 ? 7 : js;\n}\n\nfunction computeOrdinal(year, month, day) {\n  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];\n}\n\nfunction uncomputeOrdinal(year, ordinal) {\n  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,\n    month0 = table.findIndex((i) => i < ordinal),\n    day = ordinal - table[month0];\n  return { month: month0 + 1, day };\n}\n\nexport function isoWeekdayToLocal(isoWeekday, startOfWeek) {\n  return ((isoWeekday - startOfWeek + 7) % 7) + 1;\n}\n\n/**\n * @private\n */\n\nexport function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { year, month, day } = gregObj,\n    ordinal = computeOrdinal(year, month, day),\n    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);\n\n  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),\n    weekYear;\n\n  if (weekNumber < 1) {\n    weekYear = year - 1;\n    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);\n  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {\n    weekYear = year + 1;\n    weekNumber = 1;\n  } else {\n    weekYear = year;\n  }\n\n  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };\n}\n\nexport function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { weekYear, weekNumber, weekday } = weekData,\n    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),\n    yearInDays = daysInYear(weekYear);\n\n  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,\n    year;\n\n  if (ordinal < 1) {\n    year = weekYear - 1;\n    ordinal += daysInYear(year);\n  } else if (ordinal > yearInDays) {\n    year = weekYear + 1;\n    ordinal -= daysInYear(weekYear);\n  } else {\n    year = weekYear;\n  }\n\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(weekData) };\n}\n\nexport function gregorianToOrdinal(gregData) {\n  const { year, month, day } = gregData;\n  const ordinal = computeOrdinal(year, month, day);\n  return { year, ordinal, ...timeObject(gregData) };\n}\n\nexport function ordinalToGregorian(ordinalData) {\n  const { year, ordinal } = ordinalData;\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(ordinalData) };\n}\n\n/**\n * Check if local week units like localWeekday are used in obj.\n * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.\n * Modifies obj in-place!\n * @param obj the object values\n */\nexport function usesLocalWeekValues(obj, loc) {\n  const hasLocaleWeekData =\n    !isUndefined(obj.localWeekday) ||\n    !isUndefined(obj.localWeekNumber) ||\n    !isUndefined(obj.localWeekYear);\n  if (hasLocaleWeekData) {\n    const hasIsoWeekData =\n      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);\n\n    if (hasIsoWeekData) {\n      throw new ConflictingSpecificationError(\n        \"Cannot mix locale-based week fields with ISO-based week fields\"\n      );\n    }\n    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;\n    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;\n    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;\n    delete obj.localWeekday;\n    delete obj.localWeekNumber;\n    delete obj.localWeekYear;\n    return {\n      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),\n      startOfWeek: loc.getStartOfWeek(),\n    };\n  } else {\n    return { minDaysInFirstWeek: 4, startOfWeek: 1 };\n  }\n}\n\nexport function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const validYear = isInteger(obj.weekYear),\n    validWeek = integerBetween(\n      obj.weekNumber,\n      1,\n      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)\n    ),\n    validWeekday = integerBetween(obj.weekday, 1, 7);\n\n  if (!validYear) {\n    return unitOutOfRange(\"weekYear\", obj.weekYear);\n  } else if (!validWeek) {\n    return unitOutOfRange(\"week\", obj.weekNumber);\n  } else if (!validWeekday) {\n    return unitOutOfRange(\"weekday\", obj.weekday);\n  } else return false;\n}\n\nexport function hasInvalidOrdinalData(obj) {\n  const validYear = isInteger(obj.year),\n    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validOrdinal) {\n    return unitOutOfRange(\"ordinal\", obj.ordinal);\n  } else return false;\n}\n\nexport function hasInvalidGregorianData(obj) {\n  const validYear = isInteger(obj.year),\n    validMonth = integerBetween(obj.month, 1, 12),\n    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validMonth) {\n    return unitOutOfRange(\"month\", obj.month);\n  } else if (!validDay) {\n    return unitOutOfRange(\"day\", obj.day);\n  } else return false;\n}\n\nexport function hasInvalidTimeData(obj) {\n  const { hour, minute, second, millisecond } = obj;\n  const validHour =\n      integerBetween(hour, 0, 23) ||\n      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),\n    validMinute = integerBetween(minute, 0, 59),\n    validSecond = integerBetween(second, 0, 59),\n    validMillisecond = integerBetween(millisecond, 0, 999);\n\n  if (!validHour) {\n    return unitOutOfRange(\"hour\", hour);\n  } else if (!validMinute) {\n    return unitOutOfRange(\"minute\", minute);\n  } else if (!validSecond) {\n    return unitOutOfRange(\"second\", second);\n  } else if (!validMillisecond) {\n    return unitOutOfRange(\"millisecond\", millisecond);\n  } else return false;\n}\n","/*\n  This is just a junk drawer, containing anything used across multiple classes.\n  Because Luxon is small(ish), this should stay small and we won't worry about splitting\n  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.\n*/\n\nimport { InvalidArgumentError } from \"../errors.js\";\nimport Settings from \"../settings.js\";\nimport { dayOfWeek, isoWeekdayToLocal } from \"./conversions.js\";\n\n/**\n * @private\n */\n\n// TYPES\n\nexport function isUndefined(o) {\n  return typeof o === \"undefined\";\n}\n\nexport function isNumber(o) {\n  return typeof o === \"number\";\n}\n\nexport function isInteger(o) {\n  return typeof o === \"number\" && o % 1 === 0;\n}\n\nexport function isString(o) {\n  return typeof o === \"string\";\n}\n\nexport function isDate(o) {\n  return Object.prototype.toString.call(o) === \"[object Date]\";\n}\n\n// CAPABILITIES\n\nexport function hasRelative() {\n  try {\n    return typeof Intl !== \"undefined\" && !!Intl.RelativeTimeFormat;\n  } catch (e) {\n    return false;\n  }\n}\n\nexport function hasLocaleWeekInfo() {\n  try {\n    return (\n      typeof Intl !== \"undefined\" &&\n      !!Intl.Locale &&\n      (\"weekInfo\" in Intl.Locale.prototype || \"getWeekInfo\" in Intl.Locale.prototype)\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n// OBJECTS AND ARRAYS\n\nexport function maybeArray(thing) {\n  return Array.isArray(thing) ? thing : [thing];\n}\n\nexport function bestBy(arr, by, compare) {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  return arr.reduce((best, next) => {\n    const pair = [by(next), next];\n    if (!best) {\n      return pair;\n    } else if (compare(best[0], pair[0]) === best[0]) {\n      return best;\n    } else {\n      return pair;\n    }\n  }, null)[1];\n}\n\nexport function pick(obj, keys) {\n  return keys.reduce((a, k) => {\n    a[k] = obj[k];\n    return a;\n  }, {});\n}\n\nexport function hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function validateWeekSettings(settings) {\n  if (settings == null) {\n    return null;\n  } else if (typeof settings !== \"object\") {\n    throw new InvalidArgumentError(\"Week settings must be an object\");\n  } else {\n    if (\n      !integerBetween(settings.firstDay, 1, 7) ||\n      !integerBetween(settings.minimalDays, 1, 7) ||\n      !Array.isArray(settings.weekend) ||\n      settings.weekend.some((v) => !integerBetween(v, 1, 7))\n    ) {\n      throw new InvalidArgumentError(\"Invalid week settings\");\n    }\n    return {\n      firstDay: settings.firstDay,\n      minimalDays: settings.minimalDays,\n      weekend: Array.from(settings.weekend),\n    };\n  }\n}\n\n// NUMBERS AND STRINGS\n\nexport function integerBetween(thing, bottom, top) {\n  return isInteger(thing) && thing >= bottom && thing <= top;\n}\n\n// x % n but takes the sign of n instead of x\nexport function floorMod(x, n) {\n  return x - n * Math.floor(x / n);\n}\n\nexport function padStart(input, n = 2) {\n  const isNeg = input < 0;\n  let padded;\n  if (isNeg) {\n    padded = \"-\" + (\"\" + -input).padStart(n, \"0\");\n  } else {\n    padded = (\"\" + input).padStart(n, \"0\");\n  }\n  return padded;\n}\n\nexport function parseInteger(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseInt(string, 10);\n  }\n}\n\nexport function parseFloating(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseFloat(string);\n  }\n}\n\nexport function parseMillis(fraction) {\n  // Return undefined (instead of 0) in these cases, where fraction is not set\n  if (isUndefined(fraction) || fraction === null || fraction === \"\") {\n    return undefined;\n  } else {\n    const f = parseFloat(\"0.\" + fraction) * 1000;\n    return Math.floor(f);\n  }\n}\n\nexport function roundTo(number, digits, rounding = \"round\") {\n  const factor = 10 ** digits;\n  switch (rounding) {\n    case \"expand\":\n      return number > 0\n        ? Math.ceil(number * factor) / factor\n        : Math.floor(number * factor) / factor;\n    case \"trunc\":\n      return Math.trunc(number * factor) / factor;\n    case \"round\":\n      return Math.round(number * factor) / factor;\n    case \"floor\":\n      return Math.floor(number * factor) / factor;\n    case \"ceil\":\n      return Math.ceil(number * factor) / factor;\n    default:\n      throw new RangeError(`Value rounding ${rounding} is out of range`);\n  }\n}\n\n// DATE BASICS\n\nexport function isLeapYear(year) {\n  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n\nexport function daysInYear(year) {\n  return isLeapYear(year) ? 366 : 365;\n}\n\nexport function daysInMonth(year, month) {\n  const modMonth = floorMod(month - 1, 12) + 1,\n    modYear = year + (month - modMonth) / 12;\n\n  if (modMonth === 2) {\n    return isLeapYear(modYear) ? 29 : 28;\n  } else {\n    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];\n  }\n}\n\n// convert a calendar object to a local timestamp (epoch, but with the offset baked in)\nexport function objToLocalTS(obj) {\n  let d = Date.UTC(\n    obj.year,\n    obj.month - 1,\n    obj.day,\n    obj.hour,\n    obj.minute,\n    obj.second,\n    obj.millisecond\n  );\n\n  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that\n  if (obj.year < 100 && obj.year >= 0) {\n    d = new Date(d);\n    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not\n    // so if obj.year is in 99, but obj.day makes it roll over into year 100,\n    // the calculations done by Date.UTC are using year 2000 - which is incorrect\n    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);\n  }\n  return +d;\n}\n\n// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js\nfunction firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {\n  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);\n  return -fwdlw + minDaysInFirstWeek - 1;\n}\n\nexport function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);\n  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);\n  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;\n}\n\nexport function untruncateYear(year) {\n  if (year > 99) {\n    return year;\n  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;\n}\n\n// PARSING\n\nexport function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {\n  const date = new Date(ts),\n    intlOpts = {\n      hourCycle: \"h23\",\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n    };\n\n  if (timeZone) {\n    intlOpts.timeZone = timeZone;\n  }\n\n  const modified = { timeZoneName: offsetFormat, ...intlOpts };\n\n  const parsed = new Intl.DateTimeFormat(locale, modified)\n    .formatToParts(date)\n    .find((m) => m.type.toLowerCase() === \"timezonename\");\n  return parsed ? parsed.value : null;\n}\n\n// signedOffset('-5', '30') -> -330\nexport function signedOffset(offHourStr, offMinuteStr) {\n  let offHour = parseInt(offHourStr, 10);\n\n  // don't || this because we want to preserve -0\n  if (Number.isNaN(offHour)) {\n    offHour = 0;\n  }\n\n  const offMin = parseInt(offMinuteStr, 10) || 0,\n    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;\n  return offHour * 60 + offMinSigned;\n}\n\n// COERCION\n\nexport function asNumber(value) {\n  const numericValue = Number(value);\n  if (typeof value === \"boolean\" || value === \"\" || !Number.isFinite(numericValue))\n    throw new InvalidArgumentError(`Invalid unit value ${value}`);\n  return numericValue;\n}\n\nexport function normalizeObject(obj, normalizer) {\n  const normalized = {};\n  for (const u in obj) {\n    if (hasOwnProperty(obj, u)) {\n      const v = obj[u];\n      if (v === undefined || v === null) continue;\n      normalized[normalizer(u)] = asNumber(v);\n    }\n  }\n  return normalized;\n}\n\n/**\n * Returns the offset's value as a string\n * @param {number} ts - Epoch milliseconds for which to get the offset\n * @param {string} format - What style of offset to return.\n *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n * @return {string}\n */\nexport function formatOffset(offset, format) {\n  const hours = Math.trunc(Math.abs(offset / 60)),\n    minutes = Math.trunc(Math.abs(offset % 60)),\n    sign = offset >= 0 ? \"+\" : \"-\";\n\n  switch (format) {\n    case \"short\":\n      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;\n    case \"narrow\":\n      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : \"\"}`;\n    case \"techie\":\n      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;\n    default:\n      throw new RangeError(`Value format ${format} is out of range for property format`);\n  }\n}\n\nexport function timeObject(obj) {\n  return pick(obj, [\"hour\", \"minute\", \"second\", \"millisecond\"]);\n}\n","import * as Formats from \"./formats.js\";\nimport { pick } from \"./util.js\";\n\nfunction stringify(obj) {\n  return JSON.stringify(obj, Object.keys(obj).sort());\n}\n\n/**\n * @private\n */\n\nexport const monthsLong = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n];\n\nexport const monthsShort = [\n  \"Jan\",\n  \"Feb\",\n  \"Mar\",\n  \"Apr\",\n  \"May\",\n  \"Jun\",\n  \"Jul\",\n  \"Aug\",\n  \"Sep\",\n  \"Oct\",\n  \"Nov\",\n  \"Dec\",\n];\n\nexport const monthsNarrow = [\"J\", \"F\", \"M\", \"A\", \"M\", \"J\", \"J\", \"A\", \"S\", \"O\", \"N\", \"D\"];\n\nexport function months(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...monthsNarrow];\n    case \"short\":\n      return [...monthsShort];\n    case \"long\":\n      return [...monthsLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"11\", \"12\"];\n    case \"2-digit\":\n      return [\"01\", \"02\", \"03\", \"04\", \"05\", \"06\", \"07\", \"08\", \"09\", \"10\", \"11\", \"12\"];\n    default:\n      return null;\n  }\n}\n\nexport const weekdaysLong = [\n  \"Monday\",\n  \"Tuesday\",\n  \"Wednesday\",\n  \"Thursday\",\n  \"Friday\",\n  \"Saturday\",\n  \"Sunday\",\n];\n\nexport const weekdaysShort = [\"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\"];\n\nexport const weekdaysNarrow = [\"M\", \"T\", \"W\", \"T\", \"F\", \"S\", \"S\"];\n\nexport function weekdays(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...weekdaysNarrow];\n    case \"short\":\n      return [...weekdaysShort];\n    case \"long\":\n      return [...weekdaysLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\"];\n    default:\n      return null;\n  }\n}\n\nexport const meridiems = [\"AM\", \"PM\"];\n\nexport const erasLong = [\"Before Christ\", \"Anno Domini\"];\n\nexport const erasShort = [\"BC\", \"AD\"];\n\nexport const erasNarrow = [\"B\", \"A\"];\n\nexport function eras(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...erasNarrow];\n    case \"short\":\n      return [...erasShort];\n    case \"long\":\n      return [...erasLong];\n    default:\n      return null;\n  }\n}\n\nexport function meridiemForDateTime(dt) {\n  return meridiems[dt.hour < 12 ? 0 : 1];\n}\n\nexport function weekdayForDateTime(dt, length) {\n  return weekdays(length)[dt.weekday - 1];\n}\n\nexport function monthForDateTime(dt, length) {\n  return months(length)[dt.month - 1];\n}\n\nexport function eraForDateTime(dt, length) {\n  return eras(length)[dt.year < 0 ? 0 : 1];\n}\n\nexport function formatRelativeTime(unit, count, numeric = \"always\", narrow = false) {\n  const units = {\n    years: [\"year\", \"yr.\"],\n    quarters: [\"quarter\", \"qtr.\"],\n    months: [\"month\", \"mo.\"],\n    weeks: [\"week\", \"wk.\"],\n    days: [\"day\", \"day\", \"days\"],\n    hours: [\"hour\", \"hr.\"],\n    minutes: [\"minute\", \"min.\"],\n    seconds: [\"second\", \"sec.\"],\n  };\n\n  const lastable = [\"hours\", \"minutes\", \"seconds\"].indexOf(unit) === -1;\n\n  if (numeric === \"auto\" && lastable) {\n    const isDay = unit === \"days\";\n    switch (count) {\n      case 1:\n        return isDay ? \"tomorrow\" : `next ${units[unit][0]}`;\n      case -1:\n        return isDay ? \"yesterday\" : `last ${units[unit][0]}`;\n      case 0:\n        return isDay ? \"today\" : `this ${units[unit][0]}`;\n      default: // fall through\n    }\n  }\n\n  const isInPast = Object.is(count, -0) || count < 0,\n    fmtValue = Math.abs(count),\n    singular = fmtValue === 1,\n    lilUnits = units[unit],\n    fmtUnit = narrow\n      ? singular\n        ? lilUnits[1]\n        : lilUnits[2] || lilUnits[1]\n      : singular\n      ? units[unit][0]\n      : unit;\n  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;\n}\n\nexport function formatString(knownFormat) {\n  // these all have the offsets removed because we don't have access to them\n  // without all the intl stuff this is backfilling\n  const filtered = pick(knownFormat, [\n      \"weekday\",\n      \"era\",\n      \"year\",\n      \"month\",\n      \"day\",\n      \"hour\",\n      \"minute\",\n      \"second\",\n      \"timeZoneName\",\n      \"hourCycle\",\n    ]),\n    key = stringify(filtered),\n    dateTimeHuge = \"EEEE, LLLL d, yyyy, h:mm a\";\n  switch (key) {\n    case stringify(Formats.DATE_SHORT):\n      return \"M/d/yyyy\";\n    case stringify(Formats.DATE_MED):\n      return \"LLL d, yyyy\";\n    case stringify(Formats.DATE_MED_WITH_WEEKDAY):\n      return \"EEE, LLL d, yyyy\";\n    case stringify(Formats.DATE_FULL):\n      return \"LLLL d, yyyy\";\n    case stringify(Formats.DATE_HUGE):\n      return \"EEEE, LLLL d, yyyy\";\n    case stringify(Formats.TIME_SIMPLE):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_SECONDS):\n      return \"h:mm:ss a\";\n    case stringify(Formats.TIME_WITH_SHORT_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_LONG_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_24_SIMPLE):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_SECONDS):\n      return \"HH:mm:ss\";\n    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.DATETIME_SHORT):\n      return \"M/d/yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_MED):\n      return \"LLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL):\n      return \"LLLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_HUGE):\n      return dateTimeHuge;\n    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):\n      return \"M/d/yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_SECONDS):\n      return \"LLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):\n      return \"EEE, d LLL yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):\n      return \"LLLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):\n      return \"EEEE, LLLL d, yyyy, h:mm:ss a\";\n    default:\n      return dateTimeHuge;\n  }\n}\n","import * as English from \"./english.js\";\nimport * as Formats from \"./formats.js\";\nimport { padStart } from \"./util.js\";\n\nfunction stringifyTokens(splits, tokenToString) {\n  let s = \"\";\n  for (const token of splits) {\n    if (token.literal) {\n      s += token.val;\n    } else {\n      s += tokenToString(token.val);\n    }\n  }\n  return s;\n}\n\nconst macroTokenToFormatOpts = {\n  D: Formats.DATE_SHORT,\n  DD: Formats.DATE_MED,\n  DDD: Formats.DATE_FULL,\n  DDDD: Formats.DATE_HUGE,\n  t: Formats.TIME_SIMPLE,\n  tt: Formats.TIME_WITH_SECONDS,\n  ttt: Formats.TIME_WITH_SHORT_OFFSET,\n  tttt: Formats.TIME_WITH_LONG_OFFSET,\n  T: Formats.TIME_24_SIMPLE,\n  TT: Formats.TIME_24_WITH_SECONDS,\n  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,\n  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,\n  f: Formats.DATETIME_SHORT,\n  ff: Formats.DATETIME_MED,\n  fff: Formats.DATETIME_FULL,\n  ffff: Formats.DATETIME_HUGE,\n  F: Formats.DATETIME_SHORT_WITH_SECONDS,\n  FF: Formats.DATETIME_MED_WITH_SECONDS,\n  FFF: Formats.DATETIME_FULL_WITH_SECONDS,\n  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,\n};\n\n/**\n * @private\n */\n\nexport default class Formatter {\n  static create(locale, opts = {}) {\n    return new Formatter(locale, opts);\n  }\n\n  static parseFormat(fmt) {\n    // white-space is always considered a literal in user-provided formats\n    // the \" \" token has a special meaning (see unitForToken)\n\n    let current = null,\n      currentFull = \"\",\n      bracketed = false;\n    const splits = [];\n    for (let i = 0; i < fmt.length; i++) {\n      const c = fmt.charAt(i);\n      if (c === \"'\") {\n        // turn '' into a literal signal quote instead of just skipping the empty literal\n        if (currentFull.length > 0 || bracketed) {\n          splits.push({\n            literal: bracketed || /^\\s+$/.test(currentFull),\n            val: currentFull === \"\" ? \"'\" : currentFull,\n          });\n        }\n        current = null;\n        currentFull = \"\";\n        bracketed = !bracketed;\n      } else if (bracketed) {\n        currentFull += c;\n      } else if (c === current) {\n        currentFull += c;\n      } else {\n        if (currentFull.length > 0) {\n          splits.push({ literal: /^\\s+$/.test(currentFull), val: currentFull });\n        }\n        currentFull = c;\n        current = c;\n      }\n    }\n\n    if (currentFull.length > 0) {\n      splits.push({ literal: bracketed || /^\\s+$/.test(currentFull), val: currentFull });\n    }\n\n    return splits;\n  }\n\n  static macroTokenToFormatOpts(token) {\n    return macroTokenToFormatOpts[token];\n  }\n\n  constructor(locale, formatOpts) {\n    this.opts = formatOpts;\n    this.loc = locale;\n    this.systemLoc = null;\n  }\n\n  formatWithSystemDefault(dt, opts) {\n    if (this.systemLoc === null) {\n      this.systemLoc = this.loc.redefaultToSystem();\n    }\n    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });\n    return df.format();\n  }\n\n  dtFormatter(dt, opts = {}) {\n    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });\n  }\n\n  formatDateTime(dt, opts) {\n    return this.dtFormatter(dt, opts).format();\n  }\n\n  formatDateTimeParts(dt, opts) {\n    return this.dtFormatter(dt, opts).formatToParts();\n  }\n\n  formatInterval(interval, opts) {\n    const df = this.dtFormatter(interval.start, opts);\n    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());\n  }\n\n  resolvedOptions(dt, opts) {\n    return this.dtFormatter(dt, opts).resolvedOptions();\n  }\n\n  num(n, p = 0, signDisplay = undefined) {\n    // we get some perf out of doing this here, annoyingly\n    if (this.opts.forceSimple) {\n      return padStart(n, p);\n    }\n\n    const opts = { ...this.opts };\n\n    if (p > 0) {\n      opts.padTo = p;\n    }\n    if (signDisplay) {\n      opts.signDisplay = signDisplay;\n    }\n\n    return this.loc.numberFormatter(opts).format(n);\n  }\n\n  formatDateTimeFromString(dt, fmt) {\n    const knownEnglish = this.loc.listingMode() === \"en\",\n      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== \"gregory\",\n      string = (opts, extract) => this.loc.extract(dt, opts, extract),\n      formatOffset = (opts) => {\n        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {\n          return \"Z\";\n        }\n\n        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : \"\";\n      },\n      meridiem = () =>\n        knownEnglish\n          ? English.meridiemForDateTime(dt)\n          : string({ hour: \"numeric\", hourCycle: \"h12\" }, \"dayperiod\"),\n      month = (length, standalone) =>\n        knownEnglish\n          ? English.monthForDateTime(dt, length)\n          : string(standalone ? { month: length } : { month: length, day: \"numeric\" }, \"month\"),\n      weekday = (length, standalone) =>\n        knownEnglish\n          ? English.weekdayForDateTime(dt, length)\n          : string(\n              standalone ? { weekday: length } : { weekday: length, month: \"long\", day: \"numeric\" },\n              \"weekday\"\n            ),\n      maybeMacro = (token) => {\n        const formatOpts = Formatter.macroTokenToFormatOpts(token);\n        if (formatOpts) {\n          return this.formatWithSystemDefault(dt, formatOpts);\n        } else {\n          return token;\n        }\n      },\n      era = (length) =>\n        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, \"era\"),\n      tokenToString = (token) => {\n        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols\n        switch (token) {\n          // ms\n          case \"S\":\n            return this.num(dt.millisecond);\n          case \"u\":\n          // falls through\n          case \"SSS\":\n            return this.num(dt.millisecond, 3);\n          // seconds\n          case \"s\":\n            return this.num(dt.second);\n          case \"ss\":\n            return this.num(dt.second, 2);\n          // fractional seconds\n          case \"uu\":\n            return this.num(Math.floor(dt.millisecond / 10), 2);\n          case \"uuu\":\n            return this.num(Math.floor(dt.millisecond / 100));\n          // minutes\n          case \"m\":\n            return this.num(dt.minute);\n          case \"mm\":\n            return this.num(dt.minute, 2);\n          // hours\n          case \"h\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);\n          case \"hh\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);\n          case \"H\":\n            return this.num(dt.hour);\n          case \"HH\":\n            return this.num(dt.hour, 2);\n          // offset\n          case \"Z\":\n            // like +6\n            return formatOffset({ format: \"narrow\", allowZ: this.opts.allowZ });\n          case \"ZZ\":\n            // like +06:00\n            return formatOffset({ format: \"short\", allowZ: this.opts.allowZ });\n          case \"ZZZ\":\n            // like +0600\n            return formatOffset({ format: \"techie\", allowZ: this.opts.allowZ });\n          case \"ZZZZ\":\n            // like EST\n            return dt.zone.offsetName(dt.ts, { format: \"short\", locale: this.loc.locale });\n          case \"ZZZZZ\":\n            // like Eastern Standard Time\n            return dt.zone.offsetName(dt.ts, { format: \"long\", locale: this.loc.locale });\n          // zone\n          case \"z\":\n            // like America/New_York\n            return dt.zoneName;\n          // meridiems\n          case \"a\":\n            return meridiem();\n          // dates\n          case \"d\":\n            return useDateTimeFormatter ? string({ day: \"numeric\" }, \"day\") : this.num(dt.day);\n          case \"dd\":\n            return useDateTimeFormatter ? string({ day: \"2-digit\" }, \"day\") : this.num(dt.day, 2);\n          // weekdays - standalone\n          case \"c\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"ccc\":\n            // like 'Tues'\n            return weekday(\"short\", true);\n          case \"cccc\":\n            // like 'Tuesday'\n            return weekday(\"long\", true);\n          case \"ccccc\":\n            // like 'T'\n            return weekday(\"narrow\", true);\n          // weekdays - format\n          case \"E\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"EEE\":\n            // like 'Tues'\n            return weekday(\"short\", false);\n          case \"EEEE\":\n            // like 'Tuesday'\n            return weekday(\"long\", false);\n          case \"EEEEE\":\n            // like 'T'\n            return weekday(\"narrow\", false);\n          // months - standalone\n          case \"L\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"LL\":\n            // like 01, doesn't seem to work\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"LLL\":\n            // like Jan\n            return month(\"short\", true);\n          case \"LLLL\":\n            // like January\n            return month(\"long\", true);\n          case \"LLLLL\":\n            // like J\n            return month(\"narrow\", true);\n          // months - format\n          case \"M\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"MM\":\n            // like 01\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"MMM\":\n            // like Jan\n            return month(\"short\", false);\n          case \"MMMM\":\n            // like January\n            return month(\"long\", false);\n          case \"MMMMM\":\n            // like J\n            return month(\"narrow\", false);\n          // years\n          case \"y\":\n            // like 2014\n            return useDateTimeFormatter ? string({ year: \"numeric\" }, \"year\") : this.num(dt.year);\n          case \"yy\":\n            // like 14\n            return useDateTimeFormatter\n              ? string({ year: \"2-digit\" }, \"year\")\n              : this.num(dt.year.toString().slice(-2), 2);\n          case \"yyyy\":\n            // like 0012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 4);\n          case \"yyyyyy\":\n            // like 000012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 6);\n          // eras\n          case \"G\":\n            // like AD\n            return era(\"short\");\n          case \"GG\":\n            // like Anno Domini\n            return era(\"long\");\n          case \"GGGGG\":\n            return era(\"narrow\");\n          case \"kk\":\n            return this.num(dt.weekYear.toString().slice(-2), 2);\n          case \"kkkk\":\n            return this.num(dt.weekYear, 4);\n          case \"W\":\n            return this.num(dt.weekNumber);\n          case \"WW\":\n            return this.num(dt.weekNumber, 2);\n          case \"n\":\n            return this.num(dt.localWeekNumber);\n          case \"nn\":\n            return this.num(dt.localWeekNumber, 2);\n          case \"ii\":\n            return this.num(dt.localWeekYear.toString().slice(-2), 2);\n          case \"iiii\":\n            return this.num(dt.localWeekYear, 4);\n          case \"o\":\n            return this.num(dt.ordinal);\n          case \"ooo\":\n            return this.num(dt.ordinal, 3);\n          case \"q\":\n            // like 1\n            return this.num(dt.quarter);\n          case \"qq\":\n            // like 01\n            return this.num(dt.quarter, 2);\n          case \"X\":\n            return this.num(Math.floor(dt.ts / 1000));\n          case \"x\":\n            return this.num(dt.ts);\n          default:\n            return maybeMacro(token);\n        }\n      };\n\n    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);\n  }\n\n  formatDurationFromString(dur, fmt) {\n    const invertLargest = this.opts.signMode === \"negativeLargestOnly\" ? -1 : 1;\n    const tokenToField = (token) => {\n        switch (token[0]) {\n          case \"S\":\n            return \"milliseconds\";\n          case \"s\":\n            return \"seconds\";\n          case \"m\":\n            return \"minutes\";\n          case \"h\":\n            return \"hours\";\n          case \"d\":\n            return \"days\";\n          case \"w\":\n            return \"weeks\";\n          case \"M\":\n            return \"months\";\n          case \"y\":\n            return \"years\";\n          default:\n            return null;\n        }\n      },\n      tokenToString = (lildur, info) => (token) => {\n        const mapped = tokenToField(token);\n        if (mapped) {\n          const inversionFactor =\n            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;\n          let signDisplay;\n          if (this.opts.signMode === \"negativeLargestOnly\" && mapped !== info.largestUnit) {\n            signDisplay = \"never\";\n          } else if (this.opts.signMode === \"all\") {\n            signDisplay = \"always\";\n          } else {\n            // \"auto\" and \"negative\" are the same, but \"auto\" has better support\n            signDisplay = \"auto\";\n          }\n          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);\n        } else {\n          return token;\n        }\n      },\n      tokens = Formatter.parseFormat(fmt),\n      realTokens = tokens.reduce(\n        (found, { literal, val }) => (literal ? found : found.concat(val)),\n        []\n      ),\n      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),\n      durationInfo = {\n        isNegativeDuration: collapsed < 0,\n        // this relies on \"collapsed\" being based on \"shiftTo\", which builds up the object\n        // in order\n        largestUnit: Object.keys(collapsed.values)[0],\n      };\n    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));\n  }\n}\n","import {\n  untruncateYear,\n  signedOffset,\n  parseInteger,\n  parseMillis,\n  isUndefined,\n  parseFloating,\n} from \"./util.js\";\nimport * as English from \"./english.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n/*\n * This file handles parsing for well-specified formats. Here's how it works:\n * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.\n * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object\n * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.\n * Extractors can take a \"cursor\" representing the offset in the match to look at. This makes it easy to combine extractors.\n * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.\n * Some extractions are super dumb and simpleParse and fromStrings help DRY them.\n */\n\nconst ianaRegex = /[A-Za-z_+-]{1,256}(?::?\\/[A-Za-z0-9_+-]{1,256}(?:\\/[A-Za-z0-9_+-]{1,256})?)?/;\n\nfunction combineRegexes(...regexes) {\n  const full = regexes.reduce((f, r) => f + r.source, \"\");\n  return RegExp(`^${full}$`);\n}\n\nfunction combineExtractors(...extractors) {\n  return (m) =>\n    extractors\n      .reduce(\n        ([mergedVals, mergedZone, cursor], ex) => {\n          const [val, zone, next] = ex(m, cursor);\n          return [{ ...mergedVals, ...val }, zone || mergedZone, next];\n        },\n        [{}, null, 1]\n      )\n      .slice(0, 2);\n}\n\nfunction parse(s, ...patterns) {\n  if (s == null) {\n    return [null, null];\n  }\n\n  for (const [regex, extractor] of patterns) {\n    const m = regex.exec(s);\n    if (m) {\n      return extractor(m);\n    }\n  }\n  return [null, null];\n}\n\nfunction simpleParse(...keys) {\n  return (match, cursor) => {\n    const ret = {};\n    let i;\n\n    for (i = 0; i < keys.length; i++) {\n      ret[keys[i]] = parseInteger(match[cursor + i]);\n    }\n    return [ret, null, cursor + i];\n  };\n}\n\n// ISO and SQL parsing\nconst offsetRegex = /(?:([Zz])|([+-]\\d\\d)(?::?(\\d\\d))?)/;\nconst isoExtendedZone = `(?:${offsetRegex.source}?(?:\\\\[(${ianaRegex.source})\\\\])?)?`;\nconst isoTimeBaseRegex = /(\\d\\d)(?::?(\\d\\d)(?::?(\\d\\d)(?:[.,](\\d{1,30}))?)?)?/;\nconst isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);\nconst isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);\nconst isoYmdRegex = /([+-]\\d{6}|\\d{4})(?:-?(\\d\\d)(?:-?(\\d\\d))?)?/;\nconst isoWeekRegex = /(\\d{4})-?W(\\d\\d)(?:-?(\\d))?/;\nconst isoOrdinalRegex = /(\\d{4})-?(\\d{3})/;\nconst extractISOWeekData = simpleParse(\"weekYear\", \"weekNumber\", \"weekDay\");\nconst extractISOOrdinalData = simpleParse(\"year\", \"ordinal\");\nconst sqlYmdRegex = /(\\d{4})-(\\d\\d)-(\\d\\d)/; // dumbed-down version of the ISO one\nconst sqlTimeRegex = RegExp(\n  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`\n);\nconst sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);\n\nfunction int(match, pos, fallback) {\n  const m = match[pos];\n  return isUndefined(m) ? fallback : parseInteger(m);\n}\n\nfunction extractISOYmd(match, cursor) {\n  const item = {\n    year: int(match, cursor),\n    month: int(match, cursor + 1, 1),\n    day: int(match, cursor + 2, 1),\n  };\n\n  return [item, null, cursor + 3];\n}\n\nfunction extractISOTime(match, cursor) {\n  const item = {\n    hours: int(match, cursor, 0),\n    minutes: int(match, cursor + 1, 0),\n    seconds: int(match, cursor + 2, 0),\n    milliseconds: parseMillis(match[cursor + 3]),\n  };\n\n  return [item, null, cursor + 4];\n}\n\nfunction extractISOOffset(match, cursor) {\n  const local = !match[cursor] && !match[cursor + 1],\n    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),\n    zone = local ? null : FixedOffsetZone.instance(fullOffset);\n  return [{}, zone, cursor + 3];\n}\n\nfunction extractIANAZone(match, cursor) {\n  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;\n  return [{}, zone, cursor + 1];\n}\n\n// ISO time parsing\n\nconst isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);\n\n// ISO duration parsing\n\nconst isoDuration =\n  /^-?P(?:(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)Y)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)W)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)D)?(?:T(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)H)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20})(?:[.,](-?\\d{1,20}))?S)?)?)$/;\n\nfunction extractISODuration(match) {\n  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =\n    match;\n\n  const hasNegativePrefix = s[0] === \"-\";\n  const negativeSeconds = secondStr && secondStr[0] === \"-\";\n\n  const maybeNegate = (num, force = false) =>\n    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;\n\n  return [\n    {\n      years: maybeNegate(parseFloating(yearStr)),\n      months: maybeNegate(parseFloating(monthStr)),\n      weeks: maybeNegate(parseFloating(weekStr)),\n      days: maybeNegate(parseFloating(dayStr)),\n      hours: maybeNegate(parseFloating(hourStr)),\n      minutes: maybeNegate(parseFloating(minuteStr)),\n      seconds: maybeNegate(parseFloating(secondStr), secondStr === \"-0\"),\n      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),\n    },\n  ];\n}\n\n// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York\n// and not just that we're in -240 *right now*. But since I don't think these are used that often\n// I'm just going to ignore that\nconst obsOffsets = {\n  GMT: 0,\n  EDT: -4 * 60,\n  EST: -5 * 60,\n  CDT: -5 * 60,\n  CST: -6 * 60,\n  MDT: -6 * 60,\n  MST: -7 * 60,\n  PDT: -7 * 60,\n  PST: -8 * 60,\n};\n\nfunction fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {\n  const result = {\n    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),\n    month: English.monthsShort.indexOf(monthStr) + 1,\n    day: parseInteger(dayStr),\n    hour: parseInteger(hourStr),\n    minute: parseInteger(minuteStr),\n  };\n\n  if (secondStr) result.second = parseInteger(secondStr);\n  if (weekdayStr) {\n    result.weekday =\n      weekdayStr.length > 3\n        ? English.weekdaysLong.indexOf(weekdayStr) + 1\n        : English.weekdaysShort.indexOf(weekdayStr) + 1;\n  }\n\n  return result;\n}\n\n// RFC 2822/5322\nconst rfc2822 =\n  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\\d\\d)(\\d\\d)))$/;\n\nfunction extractRFC2822(match) {\n  const [\n      ,\n      weekdayStr,\n      dayStr,\n      monthStr,\n      yearStr,\n      hourStr,\n      minuteStr,\n      secondStr,\n      obsOffset,\n      milOffset,\n      offHourStr,\n      offMinuteStr,\n    ] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n\n  let offset;\n  if (obsOffset) {\n    offset = obsOffsets[obsOffset];\n  } else if (milOffset) {\n    offset = 0;\n  } else {\n    offset = signedOffset(offHourStr, offMinuteStr);\n  }\n\n  return [result, new FixedOffsetZone(offset)];\n}\n\nfunction preprocessRFC2822(s) {\n  // Remove comments and folding whitespace and replace multiple-spaces with a single space\n  return s\n    .replace(/\\([^()]*\\)|[\\n\\t]/g, \" \")\n    .replace(/(\\s\\s+)/g, \" \")\n    .trim();\n}\n\n// http date\n\nconst rfc1123 =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\\d\\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\\d{4}) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  rfc850 =\n    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\\d\\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  ascii =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \\d|\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) (\\d{4})$/;\n\nfunction extractRFC1123Or850(match) {\n  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nfunction extractASCII(match) {\n  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nconst isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);\nconst isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);\nconst isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);\nconst isoTimeCombinedRegex = combineRegexes(isoTimeRegex);\n\nconst extractISOYmdTimeAndOffset = combineExtractors(\n  extractISOYmd,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOWeekTimeAndOffset = combineExtractors(\n  extractISOWeekData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOOrdinalDateAndTime = combineExtractors(\n  extractISOOrdinalData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOTimeAndOffset = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\n/*\n * @private\n */\n\nexport function parseISODate(s) {\n  return parse(\n    s,\n    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],\n    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],\n    [isoTimeCombinedRegex, extractISOTimeAndOffset]\n  );\n}\n\nexport function parseRFC2822Date(s) {\n  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);\n}\n\nexport function parseHTTPDate(s) {\n  return parse(\n    s,\n    [rfc1123, extractRFC1123Or850],\n    [rfc850, extractRFC1123Or850],\n    [ascii, extractASCII]\n  );\n}\n\nexport function parseISODuration(s) {\n  return parse(s, [isoDuration, extractISODuration]);\n}\n\nconst extractISOTimeOnly = combineExtractors(extractISOTime);\n\nexport function parseISOTimeOnly(s) {\n  return parse(s, [isoTimeOnly, extractISOTimeOnly]);\n}\n\nconst sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);\nconst sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);\n\nconst extractISOTimeOffsetAndIANAZone = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\nexport function parseSQL(s) {\n  return parse(\n    s,\n    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]\n  );\n}\n","import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from \"./errors.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Locale from \"./impl/locale.js\";\nimport { parseISODuration, parseISOTimeOnly } from \"./impl/regexParser.js\";\nimport {\n  asNumber,\n  hasOwnProperty,\n  isNumber,\n  isUndefined,\n  normalizeObject,\n  roundTo,\n} from \"./impl/util.js\";\nimport Settings from \"./settings.js\";\nimport DateTime from \"./datetime.js\";\n\nconst INVALID = \"Invalid Duration\";\n\n// unit conversion constants\nexport const lowOrderMatrix = {\n    weeks: {\n      days: 7,\n      hours: 7 * 24,\n      minutes: 7 * 24 * 60,\n      seconds: 7 * 24 * 60 * 60,\n      milliseconds: 7 * 24 * 60 * 60 * 1000,\n    },\n    days: {\n      hours: 24,\n      minutes: 24 * 60,\n      seconds: 24 * 60 * 60,\n      milliseconds: 24 * 60 * 60 * 1000,\n    },\n    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },\n    minutes: { seconds: 60, milliseconds: 60 * 1000 },\n    seconds: { milliseconds: 1000 },\n  },\n  casualMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: 52,\n      days: 365,\n      hours: 365 * 24,\n      minutes: 365 * 24 * 60,\n      seconds: 365 * 24 * 60 * 60,\n      milliseconds: 365 * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: 13,\n      days: 91,\n      hours: 91 * 24,\n      minutes: 91 * 24 * 60,\n      seconds: 91 * 24 * 60 * 60,\n      milliseconds: 91 * 24 * 60 * 60 * 1000,\n    },\n    months: {\n      weeks: 4,\n      days: 30,\n      hours: 30 * 24,\n      minutes: 30 * 24 * 60,\n      seconds: 30 * 24 * 60 * 60,\n      milliseconds: 30 * 24 * 60 * 60 * 1000,\n    },\n\n    ...lowOrderMatrix,\n  },\n  daysInYearAccurate = 146097.0 / 400,\n  daysInMonthAccurate = 146097.0 / 4800,\n  accurateMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: daysInYearAccurate / 7,\n      days: daysInYearAccurate,\n      hours: daysInYearAccurate * 24,\n      minutes: daysInYearAccurate * 24 * 60,\n      seconds: daysInYearAccurate * 24 * 60 * 60,\n      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: daysInYearAccurate / 28,\n      days: daysInYearAccurate / 4,\n      hours: (daysInYearAccurate * 24) / 4,\n      minutes: (daysInYearAccurate * 24 * 60) / 4,\n      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,\n      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,\n    },\n    months: {\n      weeks: daysInMonthAccurate / 7,\n      days: daysInMonthAccurate,\n      hours: daysInMonthAccurate * 24,\n      minutes: daysInMonthAccurate * 24 * 60,\n      seconds: daysInMonthAccurate * 24 * 60 * 60,\n      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,\n    },\n    ...lowOrderMatrix,\n  };\n\n// units ordered by size\nconst orderedUnits = [\n  \"years\",\n  \"quarters\",\n  \"months\",\n  \"weeks\",\n  \"days\",\n  \"hours\",\n  \"minutes\",\n  \"seconds\",\n  \"milliseconds\",\n];\n\nconst reverseUnits = orderedUnits.slice(0).reverse();\n\n// clone really means \"create another instance just like this one, but with these changes\"\nfunction clone(dur, alts, clear = false) {\n  // deep merge for vals\n  const conf = {\n    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },\n    loc: dur.loc.clone(alts.loc),\n    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,\n    matrix: alts.matrix || dur.matrix,\n  };\n  return new Duration(conf);\n}\n\nfunction durationToMillis(matrix, vals) {\n  let sum = vals.milliseconds ?? 0;\n  for (const unit of reverseUnits.slice(1)) {\n    if (vals[unit]) {\n      sum += vals[unit] * matrix[unit][\"milliseconds\"];\n    }\n  }\n  return sum;\n}\n\n// NB: mutates parameters\nfunction normalizeValues(matrix, vals) {\n  // the logic below assumes the overall value of the duration is positive\n  // if this is not the case, factor is used to make it so\n  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;\n\n  orderedUnits.reduceRight((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const previousVal = vals[previous] * factor;\n        const conv = matrix[current][previous];\n\n        // if (previousVal < 0):\n        // lower order unit is negative (e.g. { years: 2, days: -2 })\n        // normalize this by reducing the higher order unit by the appropriate amount\n        // and increasing the lower order unit\n        // this can never make the higher order unit negative, because this function only operates\n        // on positive durations, so the amount of time represented by the lower order unit cannot\n        // be larger than the higher order unit\n        // else:\n        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })\n        // in this case we attempt to convert as much as possible from the lower order unit into\n        // the higher order one\n        //\n        // Math.floor takes care of both of these cases, rounding away from 0\n        // if previousVal < 0 it makes the absolute value larger\n        // if previousVal >= it makes the absolute value smaller\n        const rollUp = Math.floor(previousVal / conv);\n        vals[current] += rollUp * factor;\n        vals[previous] -= rollUp * conv * factor;\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n\n  // try to convert any decimals into smaller units if possible\n  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }\n  orderedUnits.reduce((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const fraction = vals[previous] % 1;\n        vals[previous] -= fraction;\n        vals[current] += fraction * matrix[previous][current];\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n}\n\n// Remove all properties with a value of 0 from an object\nfunction removeZeroes(vals) {\n  const newVals = {};\n  for (const [key, value] of Object.entries(vals)) {\n    if (value !== 0) {\n      newVals[key] = value;\n    }\n  }\n  return newVals;\n}\n\n/**\n * A Duration object represents a period of time, like \"2 months\" or \"1 day, 1 hour\". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.\n *\n * Here is a brief overview of commonly used methods and getters in Duration:\n *\n * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.\n * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.\n * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.\n * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.\n * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}\n *\n * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.\n */\nexport default class Duration {\n  /**\n   * @private\n   */\n  constructor(config) {\n    const accurate = config.conversionAccuracy === \"longterm\" || false;\n    let matrix = accurate ? accurateMatrix : casualMatrix;\n\n    if (config.matrix) {\n      matrix = config.matrix;\n    }\n\n    /**\n     * @access private\n     */\n    this.values = config.values;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.conversionAccuracy = accurate ? \"longterm\" : \"casual\";\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.matrix = matrix;\n    /**\n     * @access private\n     */\n    this.isLuxonDuration = true;\n  }\n\n  /**\n   * Create Duration from a number of milliseconds.\n   * @param {number} count of milliseconds\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  static fromMillis(count, opts) {\n    return Duration.fromObject({ milliseconds: count }, opts);\n  }\n\n  /**\n   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.\n   * If this object is empty then a zero milliseconds duration is returned.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.years\n   * @param {number} obj.quarters\n   * @param {number} obj.months\n   * @param {number} obj.weeks\n   * @param {number} obj.days\n   * @param {number} obj.hours\n   * @param {number} obj.minutes\n   * @param {number} obj.seconds\n   * @param {number} obj.milliseconds\n   * @param {Object} [opts=[]] - options for creating this Duration\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the custom conversion system to use\n   * @return {Duration}\n   */\n  static fromObject(obj, opts = {}) {\n    if (obj == null || typeof obj !== \"object\") {\n      throw new InvalidArgumentError(\n        `Duration.fromObject: argument expected to be an object, got ${\n          obj === null ? \"null\" : typeof obj\n        }`\n      );\n    }\n\n    return new Duration({\n      values: normalizeObject(obj, Duration.normalizeUnit),\n      loc: Locale.fromObject(opts),\n      conversionAccuracy: opts.conversionAccuracy,\n      matrix: opts.matrix,\n    });\n  }\n\n  /**\n   * Create a Duration from DurationLike.\n   *\n   * @param {Object | number | Duration} durationLike\n   * One of:\n   * - object with keys like 'years' and 'hours'.\n   * - number representing milliseconds\n   * - Duration instance\n   * @return {Duration}\n   */\n  static fromDurationLike(durationLike) {\n    if (isNumber(durationLike)) {\n      return Duration.fromMillis(durationLike);\n    } else if (Duration.isDuration(durationLike)) {\n      return durationLike;\n    } else if (typeof durationLike === \"object\") {\n      return Duration.fromObject(durationLike);\n    } else {\n      throw new InvalidArgumentError(\n        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`\n      );\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 duration string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the preset conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }\n   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }\n   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }\n   * @return {Duration}\n   */\n  static fromISO(text, opts) {\n    const [parsed] = parseISODuration(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 time string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }\n   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @return {Duration}\n   */\n  static fromISOTime(text, opts) {\n    const [parsed] = parseISOTimeOnly(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create an invalid Duration.\n   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Duration}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Duration is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDurationError(invalid);\n    } else {\n      return new Duration({ invalid });\n    }\n  }\n\n  /**\n   * @private\n   */\n  static normalizeUnit(unit) {\n    const normalized = {\n      year: \"years\",\n      years: \"years\",\n      quarter: \"quarters\",\n      quarters: \"quarters\",\n      month: \"months\",\n      months: \"months\",\n      week: \"weeks\",\n      weeks: \"weeks\",\n      day: \"days\",\n      days: \"days\",\n      hour: \"hours\",\n      hours: \"hours\",\n      minute: \"minutes\",\n      minutes: \"minutes\",\n      second: \"seconds\",\n      seconds: \"seconds\",\n      millisecond: \"milliseconds\",\n      milliseconds: \"milliseconds\",\n    }[unit ? unit.toLowerCase() : unit];\n\n    if (!normalized) throw new InvalidUnitError(unit);\n\n    return normalized;\n  }\n\n  /**\n   * Check if an object is a Duration. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDuration(o) {\n    return (o && o.isLuxonDuration) || false;\n  }\n\n  /**\n   * Get  the locale of a Duration, such 'en-GB'\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:\n   * * `S` for milliseconds\n   * * `s` for seconds\n   * * `m` for minutes\n   * * `h` for hours\n   * * `d` for days\n   * * `w` for weeks\n   * * `M` for months\n   * * `y` for years\n   * Notes:\n   * * Add padding by repeating the token, e.g. \"yy\" pads the years to two digits, \"hhhh\" pads the hours out to four digits\n   * * Tokens can be escaped by wrapping with single quotes.\n   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - options\n   * @param {boolean} [opts.floor=true] - floor numerical values\n   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"y d s\") //=> \"1 6 2\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"yy dd sss\") //=> \"01 06 002\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"M S\") //=> \"12 518402000\"\n   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"+6 +2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"-6 -2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"negativeLargestOnly\" }) //=> \"-6 2\"\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    // reverse-compat since 1.2; we always round down now, never up, and we do it by default\n    const fmtOpts = {\n      ...opts,\n      floor: opts.round !== false && opts.floor !== false,\n    };\n    return this.isValid\n      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a string representation of a Duration with all units included.\n   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options\n   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.\n   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.\n   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero\n   * @example\n   * ```js\n   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })\n   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'\n   * dur.toHuman({ listStyle: \"long\" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'\n   * dur.toHuman({ unitDisplay: \"short\" }) //=> '1 mth, 0 wks, 5 hr, 6 min'\n   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'\n   * ```\n   */\n  toHuman(opts = {}) {\n    if (!this.isValid) return INVALID;\n\n    const showZeros = opts.showZeros !== false;\n\n    const l = orderedUnits\n      .map((unit) => {\n        const val = this.values[unit];\n        if (isUndefined(val) || (val === 0 && !showZeros)) {\n          return null;\n        }\n        return this.loc\n          .numberFormatter({ style: \"unit\", unitDisplay: \"long\", ...opts, unit: unit.slice(0, -1) })\n          .format(val);\n      })\n      .filter((n) => n);\n\n    return this.loc\n      .listFormatter({ type: \"conjunction\", style: opts.listStyle || \"narrow\", ...opts })\n      .format(l);\n  }\n\n  /**\n   * Returns a JavaScript object with this Duration's values.\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }\n   * @return {Object}\n   */\n  toObject() {\n    if (!this.isValid) return {};\n    return { ...this.values };\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'\n   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'\n   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'\n   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'\n   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'\n   * @return {string}\n   */\n  toISO() {\n    // we could use the formatter, but this is an easier way to get the minimum string\n    if (!this.isValid) return null;\n\n    let s = \"P\";\n    if (this.years !== 0) s += this.years + \"Y\";\n    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + \"M\";\n    if (this.weeks !== 0) s += this.weeks + \"W\";\n    if (this.days !== 0) s += this.days + \"D\";\n    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)\n      s += \"T\";\n    if (this.hours !== 0) s += this.hours + \"H\";\n    if (this.minutes !== 0) s += this.minutes + \"M\";\n    if (this.seconds !== 0 || this.milliseconds !== 0)\n      // this will handle \"floating point madness\" by removing extra decimal places\n      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken\n      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + \"S\";\n    if (s === \"P\") s += \"T0S\";\n    return s;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.\n   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'\n   * @return {string}\n   */\n  toISOTime(opts = {}) {\n    if (!this.isValid) return null;\n\n    const millis = this.toMillis();\n    if (millis < 0 || millis >= 86400000) return null;\n\n    opts = {\n      suppressMilliseconds: false,\n      suppressSeconds: false,\n      includePrefix: false,\n      format: \"extended\",\n      ...opts,\n      includeOffset: false,\n    };\n\n    const dateTime = DateTime.fromMillis(millis, { zone: \"UTC\" });\n    return dateTime.toISOTime(opts);\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.\n   * @return {string}\n   */\n  toString() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a string representation of this Duration appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Duration { values: ${JSON.stringify(this.values)} }`;\n    } else {\n      return `Duration { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration.\n   * @return {number}\n   */\n  toMillis() {\n    if (!this.isValid) return NaN;\n\n    return durationToMillis(this.matrix, this.values);\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration),\n      result = {};\n\n    for (const k of orderedUnits) {\n      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {\n        result[k] = dur.get(k) + this.get(k);\n      }\n    }\n\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration);\n    return this.plus(dur.negate());\n  }\n\n  /**\n   * Scale this Duration by the specified amount. Return a newly-constructed Duration.\n   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === \"hours\" ? x * 2 : x) //=> { hours: 2, minutes: 30 }\n   * @return {Duration}\n   */\n  mapUnits(fn) {\n    if (!this.isValid) return this;\n    const result = {};\n    for (const k of Object.keys(this.values)) {\n      result[k] = asNumber(fn(this.values[k], k));\n    }\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2\n   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0\n   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3\n   * @return {number}\n   */\n  get(unit) {\n    return this[Duration.normalizeUnit(unit)];\n  }\n\n  /**\n   * \"Set\" the values of specified units. Return a newly-constructed Duration.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dur.set({ years: 2017 })\n   * @example dur.set({ hours: 8, minutes: 30 })\n   * @return {Duration}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };\n    return clone(this, { values: mixed });\n  }\n\n  /**\n   * \"Set\" the locale and/or numberingSystem.  Returns a newly-constructed Duration.\n   * @example dur.reconfigure({ locale: 'en-GB' })\n   * @return {Duration}\n   */\n  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem });\n    const opts = { loc, matrix, conversionAccuracy };\n    return clone(this, opts);\n  }\n\n  /**\n   * Return the length of the duration in the specified unit.\n   * @param {string} unit - a unit such as 'minutes' or 'days'\n   * @example Duration.fromObject({years: 1}).as('days') //=> 365\n   * @example Duration.fromObject({years: 1}).as('months') //=> 12\n   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5\n   * @return {number}\n   */\n  as(unit) {\n    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;\n  }\n\n  /**\n   * Reduce this Duration to its canonical representation in its current units.\n   * Assuming the overall value of the Duration is positive, this means:\n   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)\n   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise\n   *   the overall value would be negative, see third example)\n   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)\n   *\n   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.\n   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }\n   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }\n   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }\n   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }\n   * @return {Duration}\n   */\n  normalize() {\n    if (!this.isValid) return this;\n    const vals = this.toObject();\n    normalizeValues(this.matrix, vals);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Rescale units to its largest representation\n   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }\n   * @return {Duration}\n   */\n  rescale() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.normalize().shiftToAll().toObject());\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Convert this Duration into its representation in a different set of units.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }\n   * @return {Duration}\n   */\n  shiftTo(...units) {\n    if (!this.isValid) return this;\n\n    if (units.length === 0) {\n      return this;\n    }\n\n    units = units.map((u) => Duration.normalizeUnit(u));\n\n    const built = {},\n      accumulated = {},\n      vals = this.toObject();\n    let lastUnit;\n\n    for (const k of orderedUnits) {\n      if (units.indexOf(k) >= 0) {\n        lastUnit = k;\n\n        let own = 0;\n\n        // anything we haven't boiled down yet should get boiled to this unit\n        for (const ak in accumulated) {\n          own += this.matrix[ak][k] * accumulated[ak];\n          accumulated[ak] = 0;\n        }\n\n        // plus anything that's already in this unit\n        if (isNumber(vals[k])) {\n          own += vals[k];\n        }\n\n        // only keep the integer part for now in the hopes of putting any decimal part\n        // into a smaller unit later\n        const i = Math.trunc(own);\n        built[k] = i;\n        accumulated[k] = (own * 1000 - i * 1000) / 1000;\n\n        // otherwise, keep it in the wings to boil it later\n      } else if (isNumber(vals[k])) {\n        accumulated[k] = vals[k];\n      }\n    }\n\n    // anything leftover becomes the decimal for the last unit\n    // lastUnit must be defined since units is not empty\n    for (const key in accumulated) {\n      if (accumulated[key] !== 0) {\n        built[lastUnit] +=\n          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];\n      }\n    }\n\n    normalizeValues(this.matrix, built);\n    return clone(this, { values: built }, true);\n  }\n\n  /**\n   * Shift this Duration to all available units.\n   * Same as shiftTo(\"years\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", \"seconds\", \"milliseconds\")\n   * @return {Duration}\n   */\n  shiftToAll() {\n    if (!this.isValid) return this;\n    return this.shiftTo(\n      \"years\",\n      \"months\",\n      \"weeks\",\n      \"days\",\n      \"hours\",\n      \"minutes\",\n      \"seconds\",\n      \"milliseconds\"\n    );\n  }\n\n  /**\n   * Return the negative of this Duration.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }\n   * @return {Duration}\n   */\n  negate() {\n    if (!this.isValid) return this;\n    const negated = {};\n    for (const k of Object.keys(this.values)) {\n      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];\n    }\n    return clone(this, { values: negated }, true);\n  }\n\n  /**\n   * Removes all units with values equal to 0 from this Duration.\n   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }\n   * @return {Duration}\n   */\n  removeZeros() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.values);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Get the years.\n   * @type {number}\n   */\n  get years() {\n    return this.isValid ? this.values.years || 0 : NaN;\n  }\n\n  /**\n   * Get the quarters.\n   * @type {number}\n   */\n  get quarters() {\n    return this.isValid ? this.values.quarters || 0 : NaN;\n  }\n\n  /**\n   * Get the months.\n   * @type {number}\n   */\n  get months() {\n    return this.isValid ? this.values.months || 0 : NaN;\n  }\n\n  /**\n   * Get the weeks\n   * @type {number}\n   */\n  get weeks() {\n    return this.isValid ? this.values.weeks || 0 : NaN;\n  }\n\n  /**\n   * Get the days.\n   * @type {number}\n   */\n  get days() {\n    return this.isValid ? this.values.days || 0 : NaN;\n  }\n\n  /**\n   * Get the hours.\n   * @type {number}\n   */\n  get hours() {\n    return this.isValid ? this.values.hours || 0 : NaN;\n  }\n\n  /**\n   * Get the minutes.\n   * @type {number}\n   */\n  get minutes() {\n    return this.isValid ? this.values.minutes || 0 : NaN;\n  }\n\n  /**\n   * Get the seconds.\n   * @return {number}\n   */\n  get seconds() {\n    return this.isValid ? this.values.seconds || 0 : NaN;\n  }\n\n  /**\n   * Get the milliseconds.\n   * @return {number}\n   */\n  get milliseconds() {\n    return this.isValid ? this.values.milliseconds || 0 : NaN;\n  }\n\n  /**\n   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations\n   * on invalid DateTimes or Intervals.\n   * @return {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this Duration became invalid, or null if the Duration is valid\n   * @return {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Equality check\n   * Two Durations are equal iff they have the same units and the same values for each unit.\n   * @param {Duration} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    if (!this.loc.equals(other.loc)) {\n      return false;\n    }\n\n    function eq(v1, v2) {\n      // Consider 0 and undefined as equal\n      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;\n      return v1 === v2;\n    }\n\n    for (const u of orderedUnits) {\n      if (!eq(this.values[u], other.values[u])) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n","import DateTime, { friendlyDateTime } from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Settings from \"./settings.js\";\nimport { InvalidArgumentError, InvalidIntervalError } from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport * as Formats from \"./impl/formats.js\";\n\nconst INVALID = \"Invalid Interval\";\n\n// checks if the start is equal to or before the end\nfunction validateStartEnd(start, end) {\n  if (!start || !start.isValid) {\n    return Interval.invalid(\"missing or invalid start\");\n  } else if (!end || !end.isValid) {\n    return Interval.invalid(\"missing or invalid end\");\n  } else if (end < start) {\n    return Interval.invalid(\n      \"end before start\",\n      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`\n    );\n  } else {\n    return null;\n  }\n}\n\n/**\n * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.\n *\n * Here is a brief overview of the most commonly used methods and getters in Interval:\n *\n * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.\n * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.\n * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.\n * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.\n * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}\n * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.\n */\nexport default class Interval {\n  /**\n   * @private\n   */\n  constructor(config) {\n    /**\n     * @access private\n     */\n    this.s = config.start;\n    /**\n     * @access private\n     */\n    this.e = config.end;\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.isLuxonInterval = true;\n  }\n\n  /**\n   * Create an invalid Interval.\n   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Interval}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Interval is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidIntervalError(invalid);\n    } else {\n      return new Interval({ invalid });\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.\n   * @param {DateTime|Date|Object} start\n   * @param {DateTime|Date|Object} end\n   * @return {Interval}\n   */\n  static fromDateTimes(start, end) {\n    const builtStart = friendlyDateTime(start),\n      builtEnd = friendlyDateTime(end);\n\n    const validateError = validateStartEnd(builtStart, builtEnd);\n\n    if (validateError == null) {\n      return new Interval({\n        start: builtStart,\n        end: builtEnd,\n      });\n    } else {\n      return validateError;\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and a Duration to extend to.\n   * @param {DateTime|Date|Object} start\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static after(start, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(start);\n    return Interval.fromDateTimes(dt, dt.plus(dur));\n  }\n\n  /**\n   * Create an Interval from an end DateTime and a Duration to extend backwards to.\n   * @param {DateTime|Date|Object} end\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static before(end, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(end);\n    return Interval.fromDateTimes(dt.minus(dur), dt);\n  }\n\n  /**\n   * Create an Interval from an ISO 8601 string.\n   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.\n   * @param {string} text - the ISO string to parse\n   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {Interval}\n   */\n  static fromISO(text, opts) {\n    const [s, e] = (text || \"\").split(\"/\", 2);\n    if (s && e) {\n      let start, startIsValid;\n      try {\n        start = DateTime.fromISO(s, opts);\n        startIsValid = start.isValid;\n      } catch (e) {\n        startIsValid = false;\n      }\n\n      let end, endIsValid;\n      try {\n        end = DateTime.fromISO(e, opts);\n        endIsValid = end.isValid;\n      } catch (e) {\n        endIsValid = false;\n      }\n\n      if (startIsValid && endIsValid) {\n        return Interval.fromDateTimes(start, end);\n      }\n\n      if (startIsValid) {\n        const dur = Duration.fromISO(e, opts);\n        if (dur.isValid) {\n          return Interval.after(start, dur);\n        }\n      } else if (endIsValid) {\n        const dur = Duration.fromISO(s, opts);\n        if (dur.isValid) {\n          return Interval.before(end, dur);\n        }\n      }\n    }\n    return Interval.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n  }\n\n  /**\n   * Check if an object is an Interval. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isInterval(o) {\n    return (o && o.isLuxonInterval) || false;\n  }\n\n  /**\n   * Returns the start of the Interval\n   * @type {DateTime}\n   */\n  get start() {\n    return this.isValid ? this.s : null;\n  }\n\n  /**\n   * Returns the end of the Interval. This is the first instant which is not part of the interval\n   * (Interval is half-open).\n   * @type {DateTime}\n   */\n  get end() {\n    return this.isValid ? this.e : null;\n  }\n\n  /**\n   * Returns the last DateTime included in the interval (since end is not part of the interval)\n   * @type {DateTime}\n   */\n  get lastDateTime() {\n    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;\n  }\n\n  /**\n   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalidReason === null;\n  }\n\n  /**\n   * Returns an error code if this Interval is invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Returns the length of the Interval in the specified unit.\n   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.\n   * @return {number}\n   */\n  length(unit = \"milliseconds\") {\n    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;\n  }\n\n  /**\n   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.\n   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'\n   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'\n   * @param {string} [unit='milliseconds'] - the unit of time to count.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime\n   * @return {number}\n   */\n  count(unit = \"milliseconds\", opts) {\n    if (!this.isValid) return NaN;\n    const start = this.start.startOf(unit, opts);\n    let end;\n    if (opts?.useLocaleWeeks) {\n      end = this.end.reconfigure({ locale: start.locale });\n    } else {\n      end = this.end;\n    }\n    end = end.startOf(unit, opts);\n    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());\n  }\n\n  /**\n   * Returns whether this Interval's start and end are both in the same unit of time\n   * @param {string} unit - the unit of time to check sameness on\n   * @return {boolean}\n   */\n  hasSame(unit) {\n    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end DateTimes.\n   * @return {boolean}\n   */\n  isEmpty() {\n    return this.s.valueOf() === this.e.valueOf();\n  }\n\n  /**\n   * Return whether this Interval's start is after the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isAfter(dateTime) {\n    if (!this.isValid) return false;\n    return this.s > dateTime;\n  }\n\n  /**\n   * Return whether this Interval's end is before the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isBefore(dateTime) {\n    if (!this.isValid) return false;\n    return this.e <= dateTime;\n  }\n\n  /**\n   * Return whether this Interval contains the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  contains(dateTime) {\n    if (!this.isValid) return false;\n    return this.s <= dateTime && this.e > dateTime;\n  }\n\n  /**\n   * \"Sets\" the start and/or end dates. Returns a newly-constructed Interval.\n   * @param {Object} values - the values to set\n   * @param {DateTime} values.start - the starting DateTime\n   * @param {DateTime} values.end - the ending DateTime\n   * @return {Interval}\n   */\n  set({ start, end } = {}) {\n    if (!this.isValid) return this;\n    return Interval.fromDateTimes(start || this.s, end || this.e);\n  }\n\n  /**\n   * Split this Interval at each of the specified DateTimes\n   * @param {...DateTime} dateTimes - the unit of time to count.\n   * @return {Array}\n   */\n  splitAt(...dateTimes) {\n    if (!this.isValid) return [];\n    const sorted = dateTimes\n        .map(friendlyDateTime)\n        .filter((d) => this.contains(d))\n        .sort((a, b) => a.toMillis() - b.toMillis()),\n      results = [];\n    let { s } = this,\n      i = 0;\n\n    while (s < this.e) {\n      const added = sorted[i] || this.e,\n        next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      i += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into smaller Intervals, each of the specified length.\n   * Left over time is grouped into a smaller interval\n   * @param {Duration|Object|number} duration - The length of each resulting interval.\n   * @return {Array}\n   */\n  splitBy(duration) {\n    const dur = Duration.fromDurationLike(duration);\n\n    if (!this.isValid || !dur.isValid || dur.as(\"milliseconds\") === 0) {\n      return [];\n    }\n\n    let { s } = this,\n      idx = 1,\n      next;\n\n    const results = [];\n    while (s < this.e) {\n      const added = this.start.plus(dur.mapUnits((x) => x * idx));\n      next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      idx += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into the specified number of smaller intervals.\n   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.\n   * @return {Array}\n   */\n  divideEqually(numberOfParts) {\n    if (!this.isValid) return [];\n    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);\n  }\n\n  /**\n   * Return whether this Interval overlaps with the specified Interval\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  overlaps(other) {\n    return this.e > other.s && this.s < other.e;\n  }\n\n  /**\n   * Return whether this Interval's end is adjacent to the specified Interval's start.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsStart(other) {\n    if (!this.isValid) return false;\n    return +this.e === +other.s;\n  }\n\n  /**\n   * Return whether this Interval's start is adjacent to the specified Interval's end.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsEnd(other) {\n    if (!this.isValid) return false;\n    return +other.e === +this.s;\n  }\n\n  /**\n   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  engulfs(other) {\n    if (!this.isValid) return false;\n    return this.s <= other.s && this.e >= other.e;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end as the specified Interval.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    return this.s.equals(other.s) && this.e.equals(other.e);\n  }\n\n  /**\n   * Return an Interval representing the intersection of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.\n   * Returns null if the intersection is empty, meaning, the intervals don't intersect.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  intersection(other) {\n    if (!this.isValid) return this;\n    const s = this.s > other.s ? this.s : other.s,\n      e = this.e < other.e ? this.e : other.e;\n\n    if (s >= e) {\n      return null;\n    } else {\n      return Interval.fromDateTimes(s, e);\n    }\n  }\n\n  /**\n   * Return an Interval representing the union of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  union(other) {\n    if (!this.isValid) return this;\n    const s = this.s < other.s ? this.s : other.s,\n      e = this.e > other.e ? this.e : other.e;\n    return Interval.fromDateTimes(s, e);\n  }\n\n  /**\n   * Merge an array of Intervals into an equivalent minimal set of Intervals.\n   * Combines overlapping and adjacent Intervals.\n   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval\n   * and ending with the latest.\n   *\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static merge(intervals) {\n    const [found, final] = intervals\n      .sort((a, b) => a.s - b.s)\n      .reduce(\n        ([sofar, current], item) => {\n          if (!current) {\n            return [sofar, item];\n          } else if (current.overlaps(item) || current.abutsStart(item)) {\n            return [sofar, current.union(item)];\n          } else {\n            return [sofar.concat([current]), item];\n          }\n        },\n        [[], null]\n      );\n    if (final) {\n      found.push(final);\n    }\n    return found;\n  }\n\n  /**\n   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static xor(intervals) {\n    let start = null,\n      currentCount = 0;\n    const results = [],\n      ends = intervals.map((i) => [\n        { time: i.s, type: \"s\" },\n        { time: i.e, type: \"e\" },\n      ]),\n      flattened = Array.prototype.concat(...ends),\n      arr = flattened.sort((a, b) => a.time - b.time);\n\n    for (const i of arr) {\n      currentCount += i.type === \"s\" ? 1 : -1;\n\n      if (currentCount === 1) {\n        start = i.time;\n      } else {\n        if (start && +start !== +i.time) {\n          results.push(Interval.fromDateTimes(start, i.time));\n        }\n\n        start = null;\n      }\n    }\n\n    return Interval.merge(results);\n  }\n\n  /**\n   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.\n   * @param {...Interval} intervals\n   * @return {Array}\n   */\n  difference(...intervals) {\n    return Interval.xor([this].concat(intervals))\n      .map((i) => this.intersection(i))\n      .filter((i) => i && !i.isEmpty());\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for debugging.\n   * @return {string}\n   */\n  toString() {\n    if (!this.isValid) return INVALID;\n    return `[${this.s.toISO()} – ${this.e.toISO()})`;\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;\n    } else {\n      return `Interval { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns a localized string representing this Interval. Accepts the same options as the\n   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as\n   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method\n   * is browser-specific, but in general it will return an appropriate representation of the\n   * Interval in the assigned locale. Defaults to the system's locale if no locale has been\n   * specified.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or\n   * Intl.DateTimeFormat constructor options.\n   * @param {Object} opts - Options to override the configuration of the start DateTime.\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Interval.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISO(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of date of this Interval.\n   * The time components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {string}\n   */\n  toISODate() {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISODate()}/${this.e.toISODate()}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of time of this Interval.\n   * The date components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISOTime(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this Interval formatted according to the specified format\n   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible\n   * formatting tool.\n   * @param {string} dateFormat - The format string. This string formats the start and end time.\n   * See {@link DateTime#toFormat} for details.\n   * @param {Object} opts - Options.\n   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end\n   * representations.\n   * @return {string}\n   */\n  toFormat(dateFormat, { separator = \" – \" } = {}) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;\n  }\n\n  /**\n   * Return a Duration representing the time spanned by this interval.\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }\n   * @return {Duration}\n   */\n  toDuration(unit, opts) {\n    if (!this.isValid) {\n      return Duration.invalid(this.invalidReason);\n    }\n    return this.e.diff(this.s, unit, opts);\n  }\n\n  /**\n   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes\n   * @param {function} mapFn\n   * @return {Interval}\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))\n   */\n  mapEndpoints(mapFn) {\n    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Settings from \"./settings.js\";\nimport Locale from \"./impl/locale.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\n\nimport { hasLocaleWeekInfo, hasRelative } from \"./impl/util.js\";\n\n/**\n * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.\n */\nexport default class Info {\n  /**\n   * Return whether the specified zone contains a DST.\n   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.\n   * @return {boolean}\n   */\n  static hasDST(zone = Settings.defaultZone) {\n    const proto = DateTime.now().setZone(zone).set({ month: 12 });\n\n    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;\n  }\n\n  /**\n   * Return whether the specified zone is a valid IANA specifier.\n   * @param {string} zone - Zone to check\n   * @return {boolean}\n   */\n  static isValidIANAZone(zone) {\n    return IANAZone.isValidZone(zone);\n  }\n\n  /**\n   * Converts the input into a {@link Zone} instance.\n   *\n   * * If `input` is already a Zone instance, it is returned unchanged.\n   * * If `input` is a string containing a valid time zone name, a Zone instance\n   *   with that name is returned.\n   * * If `input` is a string that doesn't refer to a known time zone, a Zone\n   *   instance with {@link Zone#isValid} == false is returned.\n   * * If `input is a number, a Zone instance with the specified fixed offset\n   *   in minutes is returned.\n   * * If `input` is `null` or `undefined`, the default zone is returned.\n   * @param {string|Zone|number} [input] - the value to be converted\n   * @return {Zone}\n   */\n  static normalizeZone(input) {\n    return normalizeZone(input, Settings.defaultZone);\n  }\n\n  /**\n   * Get the weekday on which the week starts according to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday\n   */\n  static getStartOfWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getStartOfWeek();\n  }\n\n  /**\n   * Get the minimum number of days necessary in a week before it is considered part of the next year according\n   * to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number}\n   */\n  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();\n  }\n\n  /**\n   * Get the weekdays, which are considered the weekend according to the given locale\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday\n   */\n  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {\n    // copy the array, because we cache it internally\n    return (locObj || Locale.create(locale)).getWeekendDays().slice();\n  }\n\n  /**\n   * Return an array of standalone month names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @example Info.months()[0] //=> 'January'\n   * @example Info.months('short')[0] //=> 'Jan'\n   * @example Info.months('numeric')[0] //=> '1'\n   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'\n   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'\n   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'\n   * @return {Array}\n   */\n  static months(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);\n  }\n\n  /**\n   * Return an array of format month names.\n   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that\n   * changes the string.\n   * See {@link Info#months}\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @return {Array}\n   */\n  static monthsFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);\n  }\n\n  /**\n   * Return an array of standalone week names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the weekday representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @example Info.weekdays()[0] //=> 'Monday'\n   * @example Info.weekdays('short')[0] //=> 'Mon'\n   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'\n   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'\n   * @return {Array}\n   */\n  static weekdays(length = \"long\", { locale = null, numberingSystem = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);\n  }\n\n  /**\n   * Return an array of format week names.\n   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that\n   * changes the string.\n   * See {@link Info#weekdays}\n   * @param {string} [length='long'] - the length of the month representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale=null] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @return {Array}\n   */\n  static weekdaysFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);\n  }\n\n  /**\n   * Return an array of meridiems.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.meridiems() //=> [ 'AM', 'PM' ]\n   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]\n   * @return {Array}\n   */\n  static meridiems({ locale = null } = {}) {\n    return Locale.create(locale).meridiems();\n  }\n\n  /**\n   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.\n   * @param {string} [length='short'] - the length of the era representation, such as \"short\" or \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.eras() //=> [ 'BC', 'AD' ]\n   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]\n   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]\n   * @return {Array}\n   */\n  static eras(length = \"short\", { locale = null } = {}) {\n    return Locale.create(locale, null, \"gregory\").eras(length);\n  }\n\n  /**\n   * Return the set of available features in this environment.\n   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.\n   * Keys:\n   * * `relative`: whether this environment supports relative time formatting\n   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale\n   * @example Info.features() //=> { relative: false, localeWeek: true }\n   * @return {Object}\n   */\n  static features() {\n    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };\n  }\n}\n","import Duration from \"../duration.js\";\n\nfunction dayDiff(earlier, later) {\n  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf(\"day\").valueOf(),\n    ms = utcDayStart(later) - utcDayStart(earlier);\n  return Math.floor(Duration.fromMillis(ms).as(\"days\"));\n}\n\nfunction highOrderDiffs(cursor, later, units) {\n  const differs = [\n    [\"years\", (a, b) => b.year - a.year],\n    [\"quarters\", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],\n    [\"months\", (a, b) => b.month - a.month + (b.year - a.year) * 12],\n    [\n      \"weeks\",\n      (a, b) => {\n        const days = dayDiff(a, b);\n        return (days - (days % 7)) / 7;\n      },\n    ],\n    [\"days\", dayDiff],\n  ];\n\n  const results = {};\n  const earlier = cursor;\n  let lowestOrder, highWater;\n\n  /* This loop tries to diff using larger units first.\n     If we overshoot, we backtrack and try the next smaller unit.\n     \"cursor\" starts out at the earlier timestamp and moves closer and closer to \"later\"\n     as we use smaller and smaller units.\n     highWater keeps track of where we would be if we added one more of the smallest unit,\n     this is used later to potentially convert any difference smaller than the smallest higher order unit\n     into a fraction of that smallest higher order unit\n  */\n  for (const [unit, differ] of differs) {\n    if (units.indexOf(unit) >= 0) {\n      lowestOrder = unit;\n\n      results[unit] = differ(cursor, later);\n      highWater = earlier.plus(results);\n\n      if (highWater > later) {\n        // we overshot the end point, backtrack cursor by 1\n        results[unit]--;\n        cursor = earlier.plus(results);\n\n        // if we are still overshooting now, we need to backtrack again\n        // this happens in certain situations when diffing times in different zones,\n        // because this calculation ignores time zones\n        if (cursor > later) {\n          // keep the \"overshot by 1\" around as highWater\n          highWater = cursor;\n          // backtrack cursor by 1\n          results[unit]--;\n          cursor = earlier.plus(results);\n        }\n      } else {\n        cursor = highWater;\n      }\n    }\n  }\n\n  return [cursor, results, highWater, lowestOrder];\n}\n\nexport default function (earlier, later, units, opts) {\n  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);\n\n  const remainingMillis = later - cursor;\n\n  const lowerOrderUnits = units.filter(\n    (u) => [\"hours\", \"minutes\", \"seconds\", \"milliseconds\"].indexOf(u) >= 0\n  );\n\n  if (lowerOrderUnits.length === 0) {\n    if (highWater < later) {\n      highWater = cursor.plus({ [lowestOrder]: 1 });\n    }\n\n    if (highWater !== cursor) {\n      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);\n    }\n  }\n\n  const duration = Duration.fromObject(results, opts);\n\n  if (lowerOrderUnits.length > 0) {\n    return Duration.fromMillis(remainingMillis, opts)\n      .shiftTo(...lowerOrderUnits)\n      .plus(duration);\n  } else {\n    return duration;\n  }\n}\n","import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from \"./util.js\";\nimport Formatter from \"./formatter.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport DateTime from \"../datetime.js\";\nimport { digitRegex, parseDigits } from \"./digits.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst MISSING_FTP = \"missing Intl.DateTimeFormat.formatToParts support\";\n\nfunction intUnit(regex, post = (i) => i) {\n  return { regex, deser: ([s]) => post(parseDigits(s)) };\n}\n\nconst NBSP = String.fromCharCode(160);\nconst spaceOrNBSP = `[ ${NBSP}]`;\nconst spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, \"g\");\n\nfunction fixListRegex(s) {\n  // make dots optional and also make them literal\n  // make space and non breakable space characters interchangeable\n  return s.replace(/\\./g, \"\\\\.?\").replace(spaceOrNBSPRegExp, spaceOrNBSP);\n}\n\nfunction stripInsensitivities(s) {\n  return s\n    .replace(/\\./g, \"\") // ignore dots that were made optional\n    .replace(spaceOrNBSPRegExp, \" \") // interchange space and nbsp\n    .toLowerCase();\n}\n\nfunction oneOf(strings, startIndex) {\n  if (strings === null) {\n    return null;\n  } else {\n    return {\n      regex: RegExp(strings.map(fixListRegex).join(\"|\")),\n      deser: ([s]) =>\n        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,\n    };\n  }\n}\n\nfunction offset(regex, groups) {\n  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };\n}\n\nfunction simple(regex) {\n  return { regex, deser: ([s]) => s };\n}\n\nfunction escapeToken(value) {\n  return value.replace(/[\\-\\[\\]{}()*+?.,\\\\\\^$|#\\s]/g, \"\\\\$&\");\n}\n\n/**\n * @param token\n * @param {Locale} loc\n */\nfunction unitForToken(token, loc) {\n  const one = digitRegex(loc),\n    two = digitRegex(loc, \"{2}\"),\n    three = digitRegex(loc, \"{3}\"),\n    four = digitRegex(loc, \"{4}\"),\n    six = digitRegex(loc, \"{6}\"),\n    oneOrTwo = digitRegex(loc, \"{1,2}\"),\n    oneToThree = digitRegex(loc, \"{1,3}\"),\n    oneToSix = digitRegex(loc, \"{1,6}\"),\n    oneToNine = digitRegex(loc, \"{1,9}\"),\n    twoToFour = digitRegex(loc, \"{2,4}\"),\n    fourToSix = digitRegex(loc, \"{4,6}\"),\n    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),\n    unitate = (t) => {\n      if (token.literal) {\n        return literal(t);\n      }\n      switch (t.val) {\n        // era\n        case \"G\":\n          return oneOf(loc.eras(\"short\"), 0);\n        case \"GG\":\n          return oneOf(loc.eras(\"long\"), 0);\n        // years\n        case \"y\":\n          return intUnit(oneToSix);\n        case \"yy\":\n          return intUnit(twoToFour, untruncateYear);\n        case \"yyyy\":\n          return intUnit(four);\n        case \"yyyyy\":\n          return intUnit(fourToSix);\n        case \"yyyyyy\":\n          return intUnit(six);\n        // months\n        case \"M\":\n          return intUnit(oneOrTwo);\n        case \"MM\":\n          return intUnit(two);\n        case \"MMM\":\n          return oneOf(loc.months(\"short\", true), 1);\n        case \"MMMM\":\n          return oneOf(loc.months(\"long\", true), 1);\n        case \"L\":\n          return intUnit(oneOrTwo);\n        case \"LL\":\n          return intUnit(two);\n        case \"LLL\":\n          return oneOf(loc.months(\"short\", false), 1);\n        case \"LLLL\":\n          return oneOf(loc.months(\"long\", false), 1);\n        // dates\n        case \"d\":\n          return intUnit(oneOrTwo);\n        case \"dd\":\n          return intUnit(two);\n        // ordinals\n        case \"o\":\n          return intUnit(oneToThree);\n        case \"ooo\":\n          return intUnit(three);\n        // time\n        case \"HH\":\n          return intUnit(two);\n        case \"H\":\n          return intUnit(oneOrTwo);\n        case \"hh\":\n          return intUnit(two);\n        case \"h\":\n          return intUnit(oneOrTwo);\n        case \"mm\":\n          return intUnit(two);\n        case \"m\":\n          return intUnit(oneOrTwo);\n        case \"q\":\n          return intUnit(oneOrTwo);\n        case \"qq\":\n          return intUnit(two);\n        case \"s\":\n          return intUnit(oneOrTwo);\n        case \"ss\":\n          return intUnit(two);\n        case \"S\":\n          return intUnit(oneToThree);\n        case \"SSS\":\n          return intUnit(three);\n        case \"u\":\n          return simple(oneToNine);\n        case \"uu\":\n          return simple(oneOrTwo);\n        case \"uuu\":\n          return intUnit(one);\n        // meridiem\n        case \"a\":\n          return oneOf(loc.meridiems(), 0);\n        // weekYear (k)\n        case \"kkkk\":\n          return intUnit(four);\n        case \"kk\":\n          return intUnit(twoToFour, untruncateYear);\n        // weekNumber (W)\n        case \"W\":\n          return intUnit(oneOrTwo);\n        case \"WW\":\n          return intUnit(two);\n        // weekdays\n        case \"E\":\n        case \"c\":\n          return intUnit(one);\n        case \"EEE\":\n          return oneOf(loc.weekdays(\"short\", false), 1);\n        case \"EEEE\":\n          return oneOf(loc.weekdays(\"long\", false), 1);\n        case \"ccc\":\n          return oneOf(loc.weekdays(\"short\", true), 1);\n        case \"cccc\":\n          return oneOf(loc.weekdays(\"long\", true), 1);\n        // offset/zone\n        case \"Z\":\n        case \"ZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);\n        case \"ZZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);\n        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing\n        // because we don't have any way to figure out what they are\n        case \"z\":\n          return simple(/[a-z_+-/]{1,256}?/i);\n        // this special-case \"token\" represents a place where a macro-token expanded into a white-space literal\n        // in this case we accept any non-newline white-space\n        case \" \":\n          return simple(/[^\\S\\n\\r]/);\n        default:\n          return literal(t);\n      }\n    };\n\n  const unit = unitate(token) || {\n    invalidReason: MISSING_FTP,\n  };\n\n  unit.token = token;\n\n  return unit;\n}\n\nconst partTypeStyleToTokenVal = {\n  year: {\n    \"2-digit\": \"yy\",\n    numeric: \"yyyyy\",\n  },\n  month: {\n    numeric: \"M\",\n    \"2-digit\": \"MM\",\n    short: \"MMM\",\n    long: \"MMMM\",\n  },\n  day: {\n    numeric: \"d\",\n    \"2-digit\": \"dd\",\n  },\n  weekday: {\n    short: \"EEE\",\n    long: \"EEEE\",\n  },\n  dayperiod: \"a\",\n  dayPeriod: \"a\",\n  hour12: {\n    numeric: \"h\",\n    \"2-digit\": \"hh\",\n  },\n  hour24: {\n    numeric: \"H\",\n    \"2-digit\": \"HH\",\n  },\n  minute: {\n    numeric: \"m\",\n    \"2-digit\": \"mm\",\n  },\n  second: {\n    numeric: \"s\",\n    \"2-digit\": \"ss\",\n  },\n  timeZoneName: {\n    long: \"ZZZZZ\",\n    short: \"ZZZ\",\n  },\n};\n\nfunction tokenForPart(part, formatOpts, resolvedOpts) {\n  const { type, value } = part;\n\n  if (type === \"literal\") {\n    const isSpace = /^\\s+$/.test(value);\n    return {\n      literal: !isSpace,\n      val: isSpace ? \" \" : value,\n    };\n  }\n\n  const style = formatOpts[type];\n\n  // The user might have explicitly specified hour12 or hourCycle\n  // if so, respect their decision\n  // if not, refer back to the resolvedOpts, which are based on the locale\n  let actualType = type;\n  if (type === \"hour\") {\n    if (formatOpts.hour12 != null) {\n      actualType = formatOpts.hour12 ? \"hour12\" : \"hour24\";\n    } else if (formatOpts.hourCycle != null) {\n      if (formatOpts.hourCycle === \"h11\" || formatOpts.hourCycle === \"h12\") {\n        actualType = \"hour12\";\n      } else {\n        actualType = \"hour24\";\n      }\n    } else {\n      // tokens only differentiate between 24 hours or not,\n      // so we do not need to check hourCycle here, which is less supported anyways\n      actualType = resolvedOpts.hour12 ? \"hour12\" : \"hour24\";\n    }\n  }\n  let val = partTypeStyleToTokenVal[actualType];\n  if (typeof val === \"object\") {\n    val = val[style];\n  }\n\n  if (val) {\n    return {\n      literal: false,\n      val,\n    };\n  }\n\n  return undefined;\n}\n\nfunction buildRegex(units) {\n  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, \"\");\n  return [`^${re}$`, units];\n}\n\nfunction match(input, regex, handlers) {\n  const matches = input.match(regex);\n\n  if (matches) {\n    const all = {};\n    let matchIndex = 1;\n    for (const i in handlers) {\n      if (hasOwnProperty(handlers, i)) {\n        const h = handlers[i],\n          groups = h.groups ? h.groups + 1 : 1;\n        if (!h.literal && h.token) {\n          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));\n        }\n        matchIndex += groups;\n      }\n    }\n    return [matches, all];\n  } else {\n    return [matches, {}];\n  }\n}\n\nfunction dateTimeFromMatches(matches) {\n  const toField = (token) => {\n    switch (token) {\n      case \"S\":\n        return \"millisecond\";\n      case \"s\":\n        return \"second\";\n      case \"m\":\n        return \"minute\";\n      case \"h\":\n      case \"H\":\n        return \"hour\";\n      case \"d\":\n        return \"day\";\n      case \"o\":\n        return \"ordinal\";\n      case \"L\":\n      case \"M\":\n        return \"month\";\n      case \"y\":\n        return \"year\";\n      case \"E\":\n      case \"c\":\n        return \"weekday\";\n      case \"W\":\n        return \"weekNumber\";\n      case \"k\":\n        return \"weekYear\";\n      case \"q\":\n        return \"quarter\";\n      default:\n        return null;\n    }\n  };\n\n  let zone = null;\n  let specificOffset;\n  if (!isUndefined(matches.z)) {\n    zone = IANAZone.create(matches.z);\n  }\n\n  if (!isUndefined(matches.Z)) {\n    if (!zone) {\n      zone = new FixedOffsetZone(matches.Z);\n    }\n    specificOffset = matches.Z;\n  }\n\n  if (!isUndefined(matches.q)) {\n    matches.M = (matches.q - 1) * 3 + 1;\n  }\n\n  if (!isUndefined(matches.h)) {\n    if (matches.h < 12 && matches.a === 1) {\n      matches.h += 12;\n    } else if (matches.h === 12 && matches.a === 0) {\n      matches.h = 0;\n    }\n  }\n\n  if (matches.G === 0 && matches.y) {\n    matches.y = -matches.y;\n  }\n\n  if (!isUndefined(matches.u)) {\n    matches.S = parseMillis(matches.u);\n  }\n\n  const vals = Object.keys(matches).reduce((r, k) => {\n    const f = toField(k);\n    if (f) {\n      r[f] = matches[k];\n    }\n\n    return r;\n  }, {});\n\n  return [vals, zone, specificOffset];\n}\n\nlet dummyDateTimeCache = null;\n\nfunction getDummyDateTime() {\n  if (!dummyDateTimeCache) {\n    dummyDateTimeCache = DateTime.fromMillis(1555555555555);\n  }\n\n  return dummyDateTimeCache;\n}\n\nfunction maybeExpandMacroToken(token, locale) {\n  if (token.literal) {\n    return token;\n  }\n\n  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);\n  const tokens = formatOptsToTokens(formatOpts, locale);\n\n  if (tokens == null || tokens.includes(undefined)) {\n    return token;\n  }\n\n  return tokens;\n}\n\nexport function expandMacroTokens(tokens, locale) {\n  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));\n}\n\n/**\n * @private\n */\n\nexport class TokenParser {\n  constructor(locale, format) {\n    this.locale = locale;\n    this.format = format;\n    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);\n    this.units = this.tokens.map((t) => unitForToken(t, locale));\n    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);\n\n    if (!this.disqualifyingUnit) {\n      const [regexString, handlers] = buildRegex(this.units);\n      this.regex = RegExp(regexString, \"i\");\n      this.handlers = handlers;\n    }\n  }\n\n  explainFromTokens(input) {\n    if (!this.isValid) {\n      return { input, tokens: this.tokens, invalidReason: this.invalidReason };\n    } else {\n      const [rawMatches, matches] = match(input, this.regex, this.handlers),\n        [result, zone, specificOffset] = matches\n          ? dateTimeFromMatches(matches)\n          : [null, null, undefined];\n      if (hasOwnProperty(matches, \"a\") && hasOwnProperty(matches, \"H\")) {\n        throw new ConflictingSpecificationError(\n          \"Can't include meridiem when specifying 24-hour format\"\n        );\n      }\n      return {\n        input,\n        tokens: this.tokens,\n        regex: this.regex,\n        rawMatches,\n        matches,\n        result,\n        zone,\n        specificOffset,\n      };\n    }\n  }\n\n  get isValid() {\n    return !this.disqualifyingUnit;\n  }\n\n  get invalidReason() {\n    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;\n  }\n}\n\nexport function explainFromTokens(locale, input, format) {\n  const parser = new TokenParser(locale, format);\n  return parser.explainFromTokens(input);\n}\n\nexport function parseFromTokens(locale, input, format) {\n  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);\n  return [result, zone, specificOffset, invalidReason];\n}\n\nexport function formatOptsToTokens(formatOpts, locale) {\n  if (!formatOpts) {\n    return null;\n  }\n\n  const formatter = Formatter.create(locale, formatOpts);\n  const df = formatter.dtFormatter(getDummyDateTime());\n  const parts = df.formatToParts();\n  const resolvedOpts = df.resolvedOptions();\n  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));\n}\n","import Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Settings from \"./settings.js\";\nimport Info from \"./info.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport {\n  isUndefined,\n  maybeArray,\n  isDate,\n  isNumber,\n  bestBy,\n  daysInMonth,\n  daysInYear,\n  isLeapYear,\n  weeksInWeekYear,\n  normalizeObject,\n  roundTo,\n  objToLocalTS,\n  padStart,\n} from \"./impl/util.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport diff from \"./impl/diff.js\";\nimport { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from \"./impl/regexParser.js\";\nimport {\n  parseFromTokens,\n  explainFromTokens,\n  formatOptsToTokens,\n  expandMacroTokens,\n  TokenParser,\n} from \"./impl/tokenParser.js\";\nimport {\n  gregorianToWeek,\n  weekToGregorian,\n  gregorianToOrdinal,\n  ordinalToGregorian,\n  hasInvalidGregorianData,\n  hasInvalidWeekData,\n  hasInvalidOrdinalData,\n  hasInvalidTimeData,\n  usesLocalWeekValues,\n  isoWeekdayToLocal,\n} from \"./impl/conversions.js\";\nimport * as Formats from \"./impl/formats.js\";\nimport {\n  InvalidArgumentError,\n  ConflictingSpecificationError,\n  InvalidUnitError,\n  InvalidDateTimeError,\n} from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\n\nconst INVALID = \"Invalid DateTime\";\nconst MAX_DATE = 8.64e15;\n\nfunction unsupportedZone(zone) {\n  return new Invalid(\"unsupported zone\", `the zone \"${zone.name}\" is not supported`);\n}\n\n// we cache week data on the DT object and this intermediates the cache\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedWeekData(dt) {\n  if (dt.weekData === null) {\n    dt.weekData = gregorianToWeek(dt.c);\n  }\n  return dt.weekData;\n}\n\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedLocalWeekData(dt) {\n  if (dt.localWeekData === null) {\n    dt.localWeekData = gregorianToWeek(\n      dt.c,\n      dt.loc.getMinDaysInFirstWeek(),\n      dt.loc.getStartOfWeek()\n    );\n  }\n  return dt.localWeekData;\n}\n\n// clone really means, \"make a new object with these modifications\". all \"setters\" really use this\n// to create a new object while only changing some of the properties\nfunction clone(inst, alts) {\n  const current = {\n    ts: inst.ts,\n    zone: inst.zone,\n    c: inst.c,\n    o: inst.o,\n    loc: inst.loc,\n    invalid: inst.invalid,\n  };\n  return new DateTime({ ...current, ...alts, old: current });\n}\n\n// find the right offset a given local time. The o input is our guess, which determines which\n// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)\nfunction fixOffset(localTS, o, tz) {\n  // Our UTC time is just a guess because our offset is just a guess\n  let utcGuess = localTS - o * 60 * 1000;\n\n  // Test whether the zone matches the offset for this ts\n  const o2 = tz.offset(utcGuess);\n\n  // If so, offset didn't change and we're done\n  if (o === o2) {\n    return [utcGuess, o];\n  }\n\n  // If not, change the ts by the difference in the offset\n  utcGuess -= (o2 - o) * 60 * 1000;\n\n  // If that gives us the local time we want, we're done\n  const o3 = tz.offset(utcGuess);\n  if (o2 === o3) {\n    return [utcGuess, o2];\n  }\n\n  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time\n  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];\n}\n\n// convert an epoch timestamp into a calendar object with the given offset\nfunction tsToObj(ts, offset) {\n  ts += offset * 60 * 1000;\n\n  const d = new Date(ts);\n\n  return {\n    year: d.getUTCFullYear(),\n    month: d.getUTCMonth() + 1,\n    day: d.getUTCDate(),\n    hour: d.getUTCHours(),\n    minute: d.getUTCMinutes(),\n    second: d.getUTCSeconds(),\n    millisecond: d.getUTCMilliseconds(),\n  };\n}\n\n// convert a calendar object to a epoch timestamp\nfunction objToTS(obj, offset, zone) {\n  return fixOffset(objToLocalTS(obj), offset, zone);\n}\n\n// create a new DT instance by adding a duration, adjusting for DSTs\nfunction adjustTime(inst, dur) {\n  const oPre = inst.o,\n    year = inst.c.year + Math.trunc(dur.years),\n    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,\n    c = {\n      ...inst.c,\n      year,\n      month,\n      day:\n        Math.min(inst.c.day, daysInMonth(year, month)) +\n        Math.trunc(dur.days) +\n        Math.trunc(dur.weeks) * 7,\n    },\n    millisToAdd = Duration.fromObject({\n      years: dur.years - Math.trunc(dur.years),\n      quarters: dur.quarters - Math.trunc(dur.quarters),\n      months: dur.months - Math.trunc(dur.months),\n      weeks: dur.weeks - Math.trunc(dur.weeks),\n      days: dur.days - Math.trunc(dur.days),\n      hours: dur.hours,\n      minutes: dur.minutes,\n      seconds: dur.seconds,\n      milliseconds: dur.milliseconds,\n    }).as(\"milliseconds\"),\n    localTS = objToLocalTS(c);\n\n  let [ts, o] = fixOffset(localTS, oPre, inst.zone);\n\n  if (millisToAdd !== 0) {\n    ts += millisToAdd;\n    // that could have changed the offset by going over a DST, but we want to keep the ts the same\n    o = inst.zone.offset(ts);\n  }\n\n  return { ts, o };\n}\n\n// helper useful in turning the results of parsing into real dates\n// by handling the zone options\nfunction parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {\n  const { setZone, zone } = opts;\n  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {\n    const interpretationZone = parsedZone || zone,\n      inst = DateTime.fromObject(parsed, {\n        ...opts,\n        zone: interpretationZone,\n        specificOffset,\n      });\n    return setZone ? inst : inst.setZone(zone);\n  } else {\n    return DateTime.invalid(\n      new Invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ${format}`)\n    );\n  }\n}\n\n// if you want to output a technical format (e.g. RFC 2822), this helper\n// helps handle the details\nfunction toTechFormat(dt, format, allowZ = true) {\n  return dt.isValid\n    ? Formatter.create(Locale.create(\"en-US\"), {\n        allowZ,\n        forceSimple: true,\n      }).formatDateTimeFromString(dt, format)\n    : null;\n}\n\nfunction toISODate(o, extended, precision) {\n  const longFormat = o.c.year > 9999 || o.c.year < 0;\n  let c = \"\";\n  if (longFormat && o.c.year >= 0) c += \"+\";\n  c += padStart(o.c.year, longFormat ? 6 : 4);\n  if (precision === \"year\") return c;\n  if (extended) {\n    c += \"-\";\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n    c += \"-\";\n  } else {\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n  }\n  c += padStart(o.c.day);\n  return c;\n}\n\nfunction toISOTime(\n  o,\n  extended,\n  suppressSeconds,\n  suppressMilliseconds,\n  includeOffset,\n  extendedZone,\n  precision\n) {\n  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,\n    c = \"\";\n  switch (precision) {\n    case \"day\":\n    case \"month\":\n    case \"year\":\n      break;\n    default:\n      c += padStart(o.c.hour);\n      if (precision === \"hour\") break;\n      if (extended) {\n        c += \":\";\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += \":\";\n          c += padStart(o.c.second);\n        }\n      } else {\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += padStart(o.c.second);\n        }\n      }\n      if (precision === \"second\") break;\n      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {\n        c += \".\";\n        c += padStart(o.c.millisecond, 3);\n      }\n  }\n\n  if (includeOffset) {\n    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {\n      c += \"Z\";\n    } else if (o.o < 0) {\n      c += \"-\";\n      c += padStart(Math.trunc(-o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(-o.o % 60));\n    } else {\n      c += \"+\";\n      c += padStart(Math.trunc(o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(o.o % 60));\n    }\n  }\n\n  if (extendedZone) {\n    c += \"[\" + o.zone.ianaName + \"]\";\n  }\n  return c;\n}\n\n// defaults for unspecified units in the supported calendars\nconst defaultUnitValues = {\n    month: 1,\n    day: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultWeekUnitValues = {\n    weekNumber: 1,\n    weekday: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultOrdinalUnitValues = {\n    ordinal: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  };\n\n// Units in the supported calendars, sorted by bigness\nconst orderedUnits = [\"year\", \"month\", \"day\", \"hour\", \"minute\", \"second\", \"millisecond\"],\n  orderedWeekUnits = [\n    \"weekYear\",\n    \"weekNumber\",\n    \"weekday\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"millisecond\",\n  ],\n  orderedOrdinalUnits = [\"year\", \"ordinal\", \"hour\", \"minute\", \"second\", \"millisecond\"];\n\n// standardize case and plurality in units\nfunction normalizeUnit(unit) {\n  const normalized = {\n    year: \"year\",\n    years: \"year\",\n    month: \"month\",\n    months: \"month\",\n    day: \"day\",\n    days: \"day\",\n    hour: \"hour\",\n    hours: \"hour\",\n    minute: \"minute\",\n    minutes: \"minute\",\n    quarter: \"quarter\",\n    quarters: \"quarter\",\n    second: \"second\",\n    seconds: \"second\",\n    millisecond: \"millisecond\",\n    milliseconds: \"millisecond\",\n    weekday: \"weekday\",\n    weekdays: \"weekday\",\n    weeknumber: \"weekNumber\",\n    weeksnumber: \"weekNumber\",\n    weeknumbers: \"weekNumber\",\n    weekyear: \"weekYear\",\n    weekyears: \"weekYear\",\n    ordinal: \"ordinal\",\n  }[unit.toLowerCase()];\n\n  if (!normalized) throw new InvalidUnitError(unit);\n\n  return normalized;\n}\n\nfunction normalizeUnitWithLocalWeeks(unit) {\n  switch (unit.toLowerCase()) {\n    case \"localweekday\":\n    case \"localweekdays\":\n      return \"localWeekday\";\n    case \"localweeknumber\":\n    case \"localweeknumbers\":\n      return \"localWeekNumber\";\n    case \"localweekyear\":\n    case \"localweekyears\":\n      return \"localWeekYear\";\n    default:\n      return normalizeUnit(unit);\n  }\n}\n\n// cache offsets for zones based on the current timestamp when this function is\n// first called. When we are handling a datetime from components like (year,\n// month, day, hour) in a time zone, we need a guess about what the timezone\n// offset is so that we can convert into a UTC timestamp. One way is to find the\n// offset of now in the zone. The actual date may have a different offset (for\n// example, if we handle a date in June while we're in December in a zone that\n// observes DST), but we can check and adjust that.\n//\n// When handling many dates, calculating the offset for now every time is\n// expensive. It's just a guess, so we can cache the offset to use even if we\n// are right on a time change boundary (we'll just correct in the other\n// direction). Using a timestamp from first read is a slight optimization for\n// handling dates close to the current date, since those dates will usually be\n// in the same offset (we could set the timestamp statically, instead). We use a\n// single timestamp for all zones to make things a bit more predictable.\n//\n// This is safe for quickDT (used by local() and utc()) because we don't fill in\n// higher-order units from tsNow (as we do in fromObject, this requires that\n// offset is calculated from tsNow).\n/**\n * @param {Zone} zone\n * @return {number}\n */\nfunction guessOffsetForZone(zone) {\n  if (zoneOffsetTs === undefined) {\n    zoneOffsetTs = Settings.now();\n  }\n\n  // Do not cache anything but IANA zones, because it is not safe to do so.\n  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset\n  if (zone.type !== \"iana\") {\n    return zone.offset(zoneOffsetTs);\n  }\n  const zoneName = zone.name;\n  let offsetGuess = zoneOffsetGuessCache.get(zoneName);\n  if (offsetGuess === undefined) {\n    offsetGuess = zone.offset(zoneOffsetTs);\n    zoneOffsetGuessCache.set(zoneName, offsetGuess);\n  }\n  return offsetGuess;\n}\n\n// this is a dumbed down version of fromObject() that runs about 60% faster\n// but doesn't do any validation, makes a bunch of assumptions about what units\n// are present, and so on.\nfunction quickDT(obj, opts) {\n  const zone = normalizeZone(opts.zone, Settings.defaultZone);\n  if (!zone.isValid) {\n    return DateTime.invalid(unsupportedZone(zone));\n  }\n\n  const loc = Locale.fromObject(opts);\n\n  let ts, o;\n\n  // assume we have the higher-order units\n  if (!isUndefined(obj.year)) {\n    for (const u of orderedUnits) {\n      if (isUndefined(obj[u])) {\n        obj[u] = defaultUnitValues[u];\n      }\n    }\n\n    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    const offsetProvis = guessOffsetForZone(zone);\n    [ts, o] = objToTS(obj, offsetProvis, zone);\n  } else {\n    ts = Settings.now();\n  }\n\n  return new DateTime({ ts, zone, loc, o });\n}\n\nfunction diffRelative(start, end, opts) {\n  const round = isUndefined(opts.round) ? true : opts.round,\n    rounding = isUndefined(opts.rounding) ? \"trunc\" : opts.rounding,\n    format = (c, unit) => {\n      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? \"round\" : rounding);\n      const formatter = end.loc.clone(opts).relFormatter(opts);\n      return formatter.format(c, unit);\n    },\n    differ = (unit) => {\n      if (opts.calendary) {\n        if (!end.hasSame(start, unit)) {\n          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);\n        } else return 0;\n      } else {\n        return end.diff(start, unit).get(unit);\n      }\n    };\n\n  if (opts.unit) {\n    return format(differ(opts.unit), opts.unit);\n  }\n\n  for (const unit of opts.units) {\n    const count = differ(unit);\n    if (Math.abs(count) >= 1) {\n      return format(count, unit);\n    }\n  }\n  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);\n}\n\nfunction lastOpts(argList) {\n  let opts = {},\n    args;\n  if (argList.length > 0 && typeof argList[argList.length - 1] === \"object\") {\n    opts = argList[argList.length - 1];\n    args = Array.from(argList).slice(0, argList.length - 1);\n  } else {\n    args = Array.from(argList);\n  }\n  return [opts, args];\n}\n\n/**\n * Timestamp to use for cached zone offset guesses (exposed for test)\n */\nlet zoneOffsetTs;\n/**\n * Cache for zone offset guesses (exposed for test).\n *\n * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of\n * zone.offset().\n */\nconst zoneOffsetGuessCache = new Map();\n\n/**\n * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.\n *\n * A DateTime comprises of:\n * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.\n * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).\n * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.\n *\n * Here is a brief overview of the most commonly used functionality it provides:\n *\n * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.\n * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},\n * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.\n * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.\n * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.\n * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.\n * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.\n *\n * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.\n */\nexport default class DateTime {\n  /**\n   * @access private\n   */\n  constructor(config) {\n    const zone = config.zone || Settings.defaultZone;\n\n    let invalid =\n      config.invalid ||\n      (Number.isNaN(config.ts) ? new Invalid(\"invalid input\") : null) ||\n      (!zone.isValid ? unsupportedZone(zone) : null);\n    /**\n     * @access private\n     */\n    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;\n\n    let c = null,\n      o = null;\n    if (!invalid) {\n      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);\n\n      if (unchanged) {\n        [c, o] = [config.old.c, config.old.o];\n      } else {\n        // If an offset has been passed and we have not been called from\n        // clone(), we can trust it and avoid the offset calculation.\n        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);\n        c = tsToObj(this.ts, ot);\n        invalid = Number.isNaN(c.year) ? new Invalid(\"invalid input\") : null;\n        c = invalid ? null : c;\n        o = invalid ? null : ot;\n      }\n    }\n\n    /**\n     * @access private\n     */\n    this._zone = zone;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.invalid = invalid;\n    /**\n     * @access private\n     */\n    this.weekData = null;\n    /**\n     * @access private\n     */\n    this.localWeekData = null;\n    /**\n     * @access private\n     */\n    this.c = c;\n    /**\n     * @access private\n     */\n    this.o = o;\n    /**\n     * @access private\n     */\n    this.isLuxonDateTime = true;\n  }\n\n  // CONSTRUCT\n\n  /**\n   * Create a DateTime for the current instant, in the system's time zone.\n   *\n   * Use Settings to override these default values if needed.\n   * @example DateTime.now().toISO() //~> now in the ISO format\n   * @return {DateTime}\n   */\n  static now() {\n    return new DateTime({});\n  }\n\n  /**\n   * Create a local DateTime\n   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month, 1-indexed\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @example DateTime.local()                                  //~> now\n   * @example DateTime.local({ zone: \"America/New_York\" })      //~> now, in US east coast time\n   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00\n   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00\n   * @example DateTime.local(2017, 3, 12, { locale: \"fr\" })     //~> 2017-03-12T00:00:00, with a French locale\n   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00\n   * @example DateTime.local(2017, 3, 12, 5, { zone: \"utc\" })   //~> 2017-03-12T05:00:00, in UTC\n   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765\n   * @return {DateTime}\n   */\n  static local() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime in UTC\n   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.utc()                                              //~> now\n   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z\n   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: \"fr\" })          //~> 2017-03-12T05:45:00Z with a French locale\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: \"fr\" }) //~> 2017-03-12T05:45:10.765Z with a French locale\n   * @return {DateTime}\n   */\n  static utc() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n\n    opts.zone = FixedOffsetZone.utcInstance;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime from a JavaScript Date object. Uses the default zone.\n   * @param {Date} date - a JavaScript Date object\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @return {DateTime}\n   */\n  static fromJSDate(date, options = {}) {\n    const ts = isDate(date) ? date.valueOf() : NaN;\n    if (Number.isNaN(ts)) {\n      return DateTime.invalid(\"invalid input\");\n    }\n\n    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    return new DateTime({\n      ts: ts,\n      zone: zoneToUse,\n      loc: Locale.fromObject(options),\n    });\n  }\n\n  /**\n   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} milliseconds - a number of milliseconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromMillis(milliseconds, options = {}) {\n    if (!isNumber(milliseconds)) {\n      throw new InvalidArgumentError(\n        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`\n      );\n    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {\n      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start\n      return DateTime.invalid(\"Timestamp out of range\");\n    } else {\n      return new DateTime({\n        ts: milliseconds,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} seconds - a number of seconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromSeconds(seconds, options = {}) {\n    if (!isNumber(seconds)) {\n      throw new InvalidArgumentError(\"fromSeconds requires a numerical input\");\n    } else {\n      return new DateTime({\n        ts: seconds * 1000,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.year - a year, such as 1987\n   * @param {number} obj.month - a month, 1-12\n   * @param {number} obj.day - a day of the month, 1-31, depending on the month\n   * @param {number} obj.ordinal - day of the year, 1-365 or 366\n   * @param {number} obj.weekYear - an ISO week year\n   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year\n   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday\n   * @param {number} obj.localWeekYear - a week year, according to the locale\n   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale\n   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale\n   * @param {number} obj.hour - hour of the day, 0-23\n   * @param {number} obj.minute - minute of the hour, 0-59\n   * @param {number} obj.second - second of the minute, 0-59\n   * @param {number} obj.millisecond - millisecond of the second, 0-999\n   * @param {Object} opts - options for creating this DateTime\n   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()\n   * @param {string} [opts.locale='system\\'s locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'\n   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })\n   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'\n   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: \"en-US\" }).toISODate() //=> '2021-12-26'\n   * @return {DateTime}\n   */\n  static fromObject(obj, opts = {}) {\n    obj = obj || {};\n    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    const loc = Locale.fromObject(opts);\n    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);\n\n    const tsNow = Settings.now(),\n      offsetProvis = !isUndefined(opts.specificOffset)\n        ? opts.specificOffset\n        : zoneToUse.offset(tsNow),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    // cases:\n    // just a weekday -> this week's instance of that weekday, no worries\n    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error\n    // (gregorian month or day) + ordinal -> error\n    // otherwise just use weeks or ordinals or gregorian, depending on what's specified\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);\n\n    // configure ourselves to deal with gregorian dates or week stuff\n    let units,\n      defaultValues,\n      objNow = tsToObj(tsNow, offsetProvis);\n    if (useWeekData) {\n      units = orderedWeekUnits;\n      defaultValues = defaultWeekUnitValues;\n      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);\n    } else if (containsOrdinal) {\n      units = orderedOrdinalUnits;\n      defaultValues = defaultOrdinalUnitValues;\n      objNow = gregorianToOrdinal(objNow);\n    } else {\n      units = orderedUnits;\n      defaultValues = defaultUnitValues;\n    }\n\n    // set default values for missing stuff\n    let foundFirst = false;\n    for (const u of units) {\n      const v = normalized[u];\n      if (!isUndefined(v)) {\n        foundFirst = true;\n      } else if (foundFirst) {\n        normalized[u] = defaultValues[u];\n      } else {\n        normalized[u] = objNow[u];\n      }\n    }\n\n    // make sure the values we have are in range\n    const higherOrderInvalid = useWeekData\n        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? hasInvalidOrdinalData(normalized)\n        : hasInvalidGregorianData(normalized),\n      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);\n\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    // compute the actual time\n    const gregorian = useWeekData\n        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? ordinalToGregorian(normalized)\n        : normalized,\n      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),\n      inst = new DateTime({\n        ts: tsFinal,\n        zone: zoneToUse,\n        o: offsetFinal,\n        loc,\n      });\n\n    // gregorian data + weekday serves only to validate\n    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {\n      return DateTime.invalid(\n        \"mismatched weekday\",\n        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`\n      );\n    }\n\n    if (!inst.isValid) {\n      return DateTime.invalid(inst.invalid);\n    }\n\n    return inst;\n  }\n\n  /**\n   * Create a DateTime from an ISO 8601 string\n   * @param {string} text - the ISO string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})\n   * @example DateTime.fromISO('2016-W05-4')\n   * @return {DateTime}\n   */\n  static fromISO(text, opts = {}) {\n    const [vals, parsedZone] = parseISODate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"ISO 8601\", text);\n  }\n\n  /**\n   * Create a DateTime from an RFC 2822 string\n   * @param {string} text - the RFC 2822 string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')\n   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')\n   * @return {DateTime}\n   */\n  static fromRFC2822(text, opts = {}) {\n    const [vals, parsedZone] = parseRFC2822Date(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"RFC 2822\", text);\n  }\n\n  /**\n   * Create a DateTime from an HTTP header date\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @param {string} text - the HTTP header date\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')\n   * @return {DateTime}\n   */\n  static fromHTTP(text, opts = {}) {\n    const [vals, parsedZone] = parseHTTPDate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"HTTP\", opts);\n  }\n\n  /**\n   * Create a DateTime from an input string and format string.\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromFormat(text, fmt, opts = {}) {\n    if (isUndefined(text) || isUndefined(fmt)) {\n      throw new InvalidArgumentError(\"fromFormat requires an input string and a format\");\n    }\n\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      }),\n      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    } else {\n      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);\n    }\n  }\n\n  /**\n   * @deprecated use fromFormat instead\n   */\n  static fromString(text, fmt, opts = {}) {\n    return DateTime.fromFormat(text, fmt, opts);\n  }\n\n  /**\n   * Create a DateTime from a SQL date, time, or datetime\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale\n   * @param {string} text - the string to parse\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @example DateTime.fromSQL('2017-05-15')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })\n   * @example DateTime.fromSQL('09:12:34.342')\n   * @return {DateTime}\n   */\n  static fromSQL(text, opts = {}) {\n    const [vals, parsedZone] = parseSQL(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"SQL\", text);\n  }\n\n  /**\n   * Create an invalid DateTime.\n   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {DateTime}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the DateTime is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDateTimeError(invalid);\n    } else {\n      return new DateTime({ invalid });\n    }\n  }\n\n  /**\n   * Check if an object is an instance of DateTime. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDateTime(o) {\n    return (o && o.isLuxonDateTime) || false;\n  }\n\n  /**\n   * Produce the format string for a set of options\n   * @param formatOpts\n   * @param localeOpts\n   * @returns {string}\n   */\n  static parseFormatForOpts(formatOpts, localeOpts = {}) {\n    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));\n    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join(\"\");\n  }\n\n  /**\n   * Produce the the fully expanded format token for the locale\n   * Does NOT quote characters, so quoted tokens will not round trip correctly\n   * @param fmt\n   * @param localeOpts\n   * @returns {string}\n   */\n  static expandFormat(fmt, localeOpts = {}) {\n    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));\n    return expanded.map((t) => t.val).join(\"\");\n  }\n\n  static resetCache() {\n    zoneOffsetTs = undefined;\n    zoneOffsetGuessCache.clear();\n  }\n\n  // INFO\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7\n   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4\n   * @return {number}\n   */\n  get(unit) {\n    return this[unit];\n  }\n\n  /**\n   * Returns whether the DateTime is valid. Invalid DateTimes occur when:\n   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30\n   * * The DateTime was created by an operation on another invalid date\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get outputCalendar() {\n    return this.isValid ? this.loc.outputCalendar : null;\n  }\n\n  /**\n   * Get the time zone associated with this DateTime.\n   * @type {Zone}\n   */\n  get zone() {\n    return this._zone;\n  }\n\n  /**\n   * Get the name of the time zone.\n   * @type {string}\n   */\n  get zoneName() {\n    return this.isValid ? this.zone.name : null;\n  }\n\n  /**\n   * Get the year\n   * @example DateTime.local(2017, 5, 25).year //=> 2017\n   * @type {number}\n   */\n  get year() {\n    return this.isValid ? this.c.year : NaN;\n  }\n\n  /**\n   * Get the quarter\n   * @example DateTime.local(2017, 5, 25).quarter //=> 2\n   * @type {number}\n   */\n  get quarter() {\n    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;\n  }\n\n  /**\n   * Get the month (1-12).\n   * @example DateTime.local(2017, 5, 25).month //=> 5\n   * @type {number}\n   */\n  get month() {\n    return this.isValid ? this.c.month : NaN;\n  }\n\n  /**\n   * Get the day of the month (1-30ish).\n   * @example DateTime.local(2017, 5, 25).day //=> 25\n   * @type {number}\n   */\n  get day() {\n    return this.isValid ? this.c.day : NaN;\n  }\n\n  /**\n   * Get the hour of the day (0-23).\n   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9\n   * @type {number}\n   */\n  get hour() {\n    return this.isValid ? this.c.hour : NaN;\n  }\n\n  /**\n   * Get the minute of the hour (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30\n   * @type {number}\n   */\n  get minute() {\n    return this.isValid ? this.c.minute : NaN;\n  }\n\n  /**\n   * Get the second of the minute (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52\n   * @type {number}\n   */\n  get second() {\n    return this.isValid ? this.c.second : NaN;\n  }\n\n  /**\n   * Get the millisecond of the second (0-999).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654\n   * @type {number}\n   */\n  get millisecond() {\n    return this.isValid ? this.c.millisecond : NaN;\n  }\n\n  /**\n   * Get the week year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015\n   * @type {number}\n   */\n  get weekYear() {\n    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the week number of the week year (1-52ish).\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21\n   * @type {number}\n   */\n  get weekNumber() {\n    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the day of the week.\n   * 1 is Monday and 7 is Sunday\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 11, 31).weekday //=> 4\n   * @type {number}\n   */\n  get weekday() {\n    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Returns true if this date is on a weekend according to the locale, false otherwise\n   * @returns {boolean}\n   */\n  get isWeekend() {\n    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);\n  }\n\n  /**\n   * Get the day of the week according to the locale.\n   * 1 is the first day of the week and 7 is the last day of the week.\n   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,\n   * @returns {number}\n   */\n  get localWeekday() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,\n   * because the week can start on different days of the week (see localWeekday) and because a different number of days\n   * is required for a week to count as the first week of a year.\n   * @returns {number}\n   */\n  get localWeekNumber() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)\n   * differently, see localWeekNumber.\n   * @returns {number}\n   */\n  get localWeekYear() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the ordinal (meaning the day of the year)\n   * @example DateTime.local(2017, 5, 25).ordinal //=> 145\n   * @type {number|DateTime}\n   */\n  get ordinal() {\n    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;\n  }\n\n  /**\n   * Get the human readable short month name, such as 'Oct'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct\n   * @type {string}\n   */\n  get monthShort() {\n    return this.isValid ? Info.months(\"short\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable long month name, such as 'October'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthLong //=> October\n   * @type {string}\n   */\n  get monthLong() {\n    return this.isValid ? Info.months(\"long\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable short weekday, such as 'Mon'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon\n   * @type {string}\n   */\n  get weekdayShort() {\n    return this.isValid ? Info.weekdays(\"short\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the human readable long weekday, such as 'Monday'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday\n   * @type {string}\n   */\n  get weekdayLong() {\n    return this.isValid ? Info.weekdays(\"long\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the UTC offset of this DateTime in minutes\n   * @example DateTime.now().offset //=> -240\n   * @example DateTime.utc().offset //=> 0\n   * @type {number}\n   */\n  get offset() {\n    return this.isValid ? +this.o : NaN;\n  }\n\n  /**\n   * Get the short human name for the zone's current offset, for example \"EST\" or \"EDT\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameShort() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"short\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get the long human name for the zone's current offset, for example \"Eastern Standard Time\" or \"Eastern Daylight Time\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameLong() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"long\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get whether this zone's offset ever changes, as in a DST.\n   * @type {boolean}\n   */\n  get isOffsetFixed() {\n    return this.isValid ? this.zone.isUniversal : null;\n  }\n\n  /**\n   * Get whether the DateTime is in a DST.\n   * @type {boolean}\n   */\n  get isInDST() {\n    if (this.isOffsetFixed) {\n      return false;\n    } else {\n      return (\n        this.offset > this.set({ month: 1, day: 1 }).offset ||\n        this.offset > this.set({ month: 5 }).offset\n      );\n    }\n  }\n\n  /**\n   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC\n   * in this DateTime's zone. During DST changes local time can be ambiguous, for example\n   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.\n   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.\n   * @returns {DateTime[]}\n   */\n  getPossibleOffsets() {\n    if (!this.isValid || this.isOffsetFixed) {\n      return [this];\n    }\n    const dayMs = 86400000;\n    const minuteMs = 60000;\n    const localTS = objToLocalTS(this.c);\n    const oEarlier = this.zone.offset(localTS - dayMs);\n    const oLater = this.zone.offset(localTS + dayMs);\n\n    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);\n    const o2 = this.zone.offset(localTS - oLater * minuteMs);\n    if (o1 === o2) {\n      return [this];\n    }\n    const ts1 = localTS - o1 * minuteMs;\n    const ts2 = localTS - o2 * minuteMs;\n    const c1 = tsToObj(ts1, o1);\n    const c2 = tsToObj(ts2, o2);\n    if (\n      c1.hour === c2.hour &&\n      c1.minute === c2.minute &&\n      c1.second === c2.second &&\n      c1.millisecond === c2.millisecond\n    ) {\n      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];\n    }\n    return [this];\n  }\n\n  /**\n   * Returns true if this DateTime is in a leap year, false otherwise\n   * @example DateTime.local(2016).isInLeapYear //=> true\n   * @example DateTime.local(2013).isInLeapYear //=> false\n   * @type {boolean}\n   */\n  get isInLeapYear() {\n    return isLeapYear(this.year);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's month\n   * @example DateTime.local(2016, 2).daysInMonth //=> 29\n   * @example DateTime.local(2016, 3).daysInMonth //=> 31\n   * @type {number}\n   */\n  get daysInMonth() {\n    return daysInMonth(this.year, this.month);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's year\n   * @example DateTime.local(2016).daysInYear //=> 366\n   * @example DateTime.local(2013).daysInYear //=> 365\n   * @type {number}\n   */\n  get daysInYear() {\n    return this.isValid ? daysInYear(this.year) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2004).weeksInWeekYear //=> 53\n   * @example DateTime.local(2013).weeksInWeekYear //=> 52\n   * @type {number}\n   */\n  get weeksInWeekYear() {\n    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's local week year\n   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52\n   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53\n   * @type {number}\n   */\n  get weeksInLocalWeekYear() {\n    return this.isValid\n      ? weeksInWeekYear(\n          this.localWeekYear,\n          this.loc.getMinDaysInFirstWeek(),\n          this.loc.getStartOfWeek()\n        )\n      : NaN;\n  }\n\n  /**\n   * Returns the resolved Intl options for this DateTime.\n   * This is useful in understanding the behavior of formatting methods\n   * @param {Object} opts - the same options as toLocaleString\n   * @return {Object}\n   */\n  resolvedLocaleOptions(opts = {}) {\n    const { locale, numberingSystem, calendar } = Formatter.create(\n      this.loc.clone(opts),\n      opts\n    ).resolvedOptions(this);\n    return { locale, numberingSystem, outputCalendar: calendar };\n  }\n\n  // TRANSFORM\n\n  /**\n   * \"Set\" the DateTime's zone to UTC. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to {@link DateTime#setZone}('utc')\n   * @param {number} [offset=0] - optionally, an offset from UTC in minutes\n   * @param {Object} [opts={}] - options to pass to `setZone()`\n   * @return {DateTime}\n   */\n  toUTC(offset = 0, opts = {}) {\n    return this.setZone(FixedOffsetZone.instance(offset), opts);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to `setZone('local')`\n   * @return {DateTime}\n   */\n  toLocal() {\n    return this.setZone(Settings.defaultZone);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.\n   *\n   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.\n   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.\n   * @return {DateTime}\n   */\n  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {\n    zone = normalizeZone(zone, Settings.defaultZone);\n    if (zone.equals(this.zone)) {\n      return this;\n    } else if (!zone.isValid) {\n      return DateTime.invalid(unsupportedZone(zone));\n    } else {\n      let newTS = this.ts;\n      if (keepLocalTime || keepCalendarTime) {\n        const offsetGuess = zone.offset(this.ts);\n        const asObj = this.toObject();\n        [newTS] = objToTS(asObj, offsetGuess, zone);\n      }\n      return clone(this, { ts: newTS, zone });\n    }\n  }\n\n  /**\n   * \"Set\" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.\n   * @param {Object} properties - the properties to set\n   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })\n   * @return {DateTime}\n   */\n  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });\n    return clone(this, { loc });\n  }\n\n  /**\n   * \"Set\" the locale. Returns a newly-constructed DateTime.\n   * Just a convenient alias for reconfigure({ locale })\n   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')\n   * @return {DateTime}\n   */\n  setLocale(locale) {\n    return this.reconfigure({ locale });\n  }\n\n  /**\n   * \"Set\" the values of specified units. Returns a newly-constructed DateTime.\n   * You can only set units with this method; for \"setting\" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.\n   *\n   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.\n   * They cannot be mixed with ISO-week units like `weekday`.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dt.set({ year: 2017 })\n   * @example dt.set({ hour: 8, minute: 30 })\n   * @example dt.set({ weekday: 5 })\n   * @example dt.set({ year: 2005, ordinal: 234 })\n   * @return {DateTime}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);\n\n    const settingWeekStuff =\n        !isUndefined(normalized.weekYear) ||\n        !isUndefined(normalized.weekNumber) ||\n        !isUndefined(normalized.weekday),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    let mixed;\n    if (settingWeekStuff) {\n      mixed = weekToGregorian(\n        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },\n        minDaysInFirstWeek,\n        startOfWeek\n      );\n    } else if (!isUndefined(normalized.ordinal)) {\n      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });\n    } else {\n      mixed = { ...this.toObject(), ...normalized };\n\n      // if we didn't set the day but we ended up on an overflow date,\n      // use the last day of the right month\n      if (isUndefined(normalized.day)) {\n        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);\n      }\n    }\n\n    const [ts, o] = objToTS(mixed, this.o, this.zone);\n    return clone(this, { ts, o });\n  }\n\n  /**\n   * Add a period of time to this DateTime and return the resulting DateTime\n   *\n   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @example DateTime.now().plus(123) //~> in 123 milliseconds\n   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes\n   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow\n   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday\n   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min\n   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min\n   * @return {DateTime}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration);\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * Subtract a period of time to this DateTime and return the resulting DateTime\n   * See {@link DateTime#plus}\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   @return {DateTime}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration).negate();\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * \"Set\" this DateTime to the beginning of a unit of time.\n   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'\n   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'\n   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'\n   * @return {DateTime}\n   */\n  startOf(unit, { useLocaleWeeks = false } = {}) {\n    if (!this.isValid) return this;\n\n    const o = {},\n      normalizedUnit = Duration.normalizeUnit(unit);\n    switch (normalizedUnit) {\n      case \"years\":\n        o.month = 1;\n      // falls through\n      case \"quarters\":\n      case \"months\":\n        o.day = 1;\n      // falls through\n      case \"weeks\":\n      case \"days\":\n        o.hour = 0;\n      // falls through\n      case \"hours\":\n        o.minute = 0;\n      // falls through\n      case \"minutes\":\n        o.second = 0;\n      // falls through\n      case \"seconds\":\n        o.millisecond = 0;\n        break;\n      case \"milliseconds\":\n        break;\n      // no default, invalid units throw in normalizeUnit()\n    }\n\n    if (normalizedUnit === \"weeks\") {\n      if (useLocaleWeeks) {\n        const startOfWeek = this.loc.getStartOfWeek();\n        const { weekday } = this;\n        if (weekday < startOfWeek) {\n          o.weekNumber = this.weekNumber - 1;\n        }\n        o.weekday = startOfWeek;\n      } else {\n        o.weekday = 1;\n      }\n    }\n\n    if (normalizedUnit === \"quarters\") {\n      const q = Math.ceil(this.month / 3);\n      o.month = (q - 1) * 3 + 1;\n    }\n\n    return this.set(o);\n  }\n\n  /**\n   * \"Set\" this DateTime to the end (meaning the last millisecond) of a unit of time\n   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'\n   * @return {DateTime}\n   */\n  endOf(unit, opts) {\n    return this.isValid\n      ? this.plus({ [unit]: 1 })\n          .startOf(unit, opts)\n          .minus(1)\n      : this;\n  }\n\n  // OUTPUT\n\n  /**\n   * Returns a string representation of this DateTime formatted according to the specified format string.\n   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'\n   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: \"fr\" }) //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat(\"HH 'hours and' mm 'minutes'\") //=> '20 hours and 55 minutes'\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.\n   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation\n   * of the DateTime in the assigned locale.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toLocaleString(); //=> 4/20/2017\n   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'\n   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'\n   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'\n   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'\n   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'\n   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an array of format \"parts\", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts\n   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.\n   * @example DateTime.now().toLocaleParts(); //=> [\n   *                                   //=>   { type: 'day', value: '25' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'month', value: '05' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'year', value: '1982' }\n   *                                   //=> ]\n   */\n  toLocaleParts(opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)\n      : [];\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'\n   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'\n   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'\n   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'\n   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'\n   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'\n   * @return {string|null}\n   */\n  toISO({\n    format = \"extended\",\n    suppressSeconds = false,\n    suppressMilliseconds = false,\n    includeOffset = true,\n    extendedZone = false,\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    const ext = format === \"extended\";\n\n    let c = toISODate(this, ext, precision);\n    if (orderedUnits.indexOf(precision) >= 3) c += \"T\";\n    c += toISOTime(\n      this,\n      ext,\n      suppressSeconds,\n      suppressMilliseconds,\n      includeOffset,\n      extendedZone,\n      precision\n    );\n    return c;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's date component\n   * @param {Object} opts - options\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.\n   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'\n   * @return {string|null}\n   */\n  toISODate({ format = \"extended\", precision = \"day\" } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, format === \"extended\", normalizeUnit(precision));\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's week date\n   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'\n   * @return {string}\n   */\n  toISOWeekDate() {\n    return toTechFormat(this, \"kkkk-'W'WW-c\");\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's time component\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'\n   * @return {string}\n   */\n  toISOTime({\n    suppressMilliseconds = false,\n    suppressSeconds = false,\n    includeOffset = true,\n    includePrefix = false,\n    extendedZone = false,\n    format = \"extended\",\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? \"T\" : \"\";\n    return (\n      c +\n      toISOTime(\n        this,\n        format === \"extended\",\n        suppressSeconds,\n        suppressMilliseconds,\n        includeOffset,\n        extendedZone,\n        precision\n      )\n    );\n  }\n\n  /**\n   * Returns an RFC 2822-compatible string representation of this DateTime\n   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'\n   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'\n   * @return {string}\n   */\n  toRFC2822() {\n    return toTechFormat(this, \"EEE, dd LLL yyyy HH:mm:ss ZZZ\", false);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.\n   * Specifically, the string conforms to RFC 1123.\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'\n   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'\n   * @return {string}\n   */\n  toHTTP() {\n    return toTechFormat(this.toUTC(), \"EEE, dd LLL yyyy HH:mm:ss 'GMT'\");\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Date\n   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'\n   * @return {string|null}\n   */\n  toSQLDate() {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Time\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc().toSQL() //=> '05:15:16.345'\n   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'\n   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'\n   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'\n   * @return {string}\n   */\n  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {\n    let fmt = \"HH:mm:ss.SSS\";\n\n    if (includeZone || includeOffset) {\n      if (includeOffsetSpace) {\n        fmt += \" \";\n      }\n      if (includeZone) {\n        fmt += \"z\";\n      } else if (includeOffset) {\n        fmt += \"ZZ\";\n      }\n    }\n\n    return toTechFormat(this, fmt, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'\n   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'\n   * @return {string}\n   */\n  toSQL(opts = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for debugging\n   * @return {string}\n   */\n  toString() {\n    return this.isValid ? this.toISO() : INVALID;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;\n    } else {\n      return `DateTime { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime.\n   * @return {number}\n   */\n  toMillis() {\n    return this.isValid ? this.ts : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.\n   * @return {number}\n   */\n  toSeconds() {\n    return this.isValid ? this.ts / 1000 : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (as a whole number) of this DateTime.\n   * @return {number}\n   */\n  toUnixInteger() {\n    return this.isValid ? Math.floor(this.ts / 1000) : NaN;\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a BSON serializable equivalent to this DateTime.\n   * @return {Date}\n   */\n  toBSON() {\n    return this.toJSDate();\n  }\n\n  /**\n   * Returns a JavaScript object with this DateTime's year, month, day, and so on.\n   * @param opts - options for generating the object\n   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output\n   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }\n   * @return {Object}\n   */\n  toObject(opts = {}) {\n    if (!this.isValid) return {};\n\n    const base = { ...this.c };\n\n    if (opts.includeConfig) {\n      base.outputCalendar = this.outputCalendar;\n      base.numberingSystem = this.loc.numberingSystem;\n      base.locale = this.loc.locale;\n    }\n    return base;\n  }\n\n  /**\n   * Returns a JavaScript Date equivalent to this DateTime.\n   * @return {Date}\n   */\n  toJSDate() {\n    return new Date(this.isValid ? this.ts : NaN);\n  }\n\n  // COMPARE\n\n  /**\n   * Return the difference between two DateTimes as a Duration.\n   * @param {DateTime} otherDateTime - the DateTime to compare this one to\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example\n   * var i1 = DateTime.fromISO('1982-05-25T09:45'),\n   *     i2 = DateTime.fromISO('1983-10-14T10:30');\n   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }\n   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }\n   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }\n   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }\n   * @return {Duration}\n   */\n  diff(otherDateTime, unit = \"milliseconds\", opts = {}) {\n    if (!this.isValid || !otherDateTime.isValid) {\n      return Duration.invalid(\"created by diffing an invalid DateTime\");\n    }\n\n    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };\n\n    const units = maybeArray(unit).map(Duration.normalizeUnit),\n      otherIsLater = otherDateTime.valueOf() > this.valueOf(),\n      earlier = otherIsLater ? this : otherDateTime,\n      later = otherIsLater ? otherDateTime : this,\n      diffed = diff(earlier, later, units, durOpts);\n\n    return otherIsLater ? diffed.negate() : diffed;\n  }\n\n  /**\n   * Return the difference between this DateTime and right now.\n   * See {@link DateTime#diff}\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  diffNow(unit = \"milliseconds\", opts = {}) {\n    return this.diff(DateTime.now(), unit, opts);\n  }\n\n  /**\n   * Return an Interval spanning between this DateTime and another DateTime\n   * @param {DateTime} otherDateTime - the other end point of the Interval\n   * @return {Interval|DateTime}\n   */\n  until(otherDateTime) {\n    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;\n  }\n\n  /**\n   * Return whether this DateTime is in the same unit of time as another DateTime.\n   * Higher-order units must also be identical for this function to return `true`.\n   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.\n   * @param {DateTime} otherDateTime - the other DateTime\n   * @param {string} unit - the unit of time to check sameness on\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used\n   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day\n   * @return {boolean}\n   */\n  hasSame(otherDateTime, unit, opts) {\n    if (!this.isValid) return false;\n\n    const inputMs = otherDateTime.valueOf();\n    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });\n    return (\n      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)\n    );\n  }\n\n  /**\n   * Equality check\n   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.\n   * To compare just the millisecond values, use `+dt1 === +dt2`.\n   * @param {DateTime} other - the other DateTime\n   * @return {boolean}\n   */\n  equals(other) {\n    return (\n      this.isValid &&\n      other.isValid &&\n      this.valueOf() === other.valueOf() &&\n      this.zone.equals(other.zone) &&\n      this.loc.equals(other.loc)\n    );\n  }\n\n  /**\n   * Returns a string representation of a this time relative to now, such as \"in two days\". Can only internationalize if your\n   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} [options.style=\"long\"] - the style of units, must be \"long\", \"short\", or \"narrow\"\n   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of \"years\", \"quarters\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", or \"seconds\"\n   * @param {boolean} [options.round=true] - whether to round the numbers in the output.\n   * @param {string} [options.rounding=\"trunc\"] - rounding method to use when rounding the numbers in the output. Can be \"trunc\" (toward zero), \"expand\" (away from zero), \"round\", \"floor\", or \"ceil\".\n   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> \"in 1 day\"\n   * @example DateTime.now().setLocale(\"es\").toRelative({ days: 1 }) //=> \"dentro de 1 día\"\n   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: \"fr\" }) //=> \"dans 23 heures\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> \"2 days ago\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: \"hours\" }) //=> \"48 hours ago\"\n   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> \"1.5 days ago\"\n   */\n  toRelative(options = {}) {\n    if (!this.isValid) return null;\n    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),\n      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;\n    let units = [\"years\", \"months\", \"days\", \"hours\", \"minutes\", \"seconds\"];\n    let unit = options.unit;\n    if (Array.isArray(options.unit)) {\n      units = options.unit;\n      unit = undefined;\n    }\n    return diffRelative(base, this.plus(padding), {\n      ...options,\n      numeric: \"always\",\n      units,\n      unit,\n    });\n  }\n\n  /**\n   * Returns a string representation of this date relative to today, such as \"yesterday\" or \"next month\".\n   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of \"years\", \"quarters\", \"months\", \"weeks\", or \"days\"\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> \"tomorrow\"\n   * @example DateTime.now().setLocale(\"es\").plus({ days: 1 }).toRelative() //=> \"\"mañana\"\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: \"fr\" }) //=> \"demain\"\n   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> \"2 days ago\"\n   */\n  toRelativeCalendar(options = {}) {\n    if (!this.isValid) return null;\n\n    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {\n      ...options,\n      numeric: \"auto\",\n      units: [\"years\", \"months\", \"days\"],\n      calendary: true,\n    });\n  }\n\n  /**\n   * Return the min of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum\n   * @return {DateTime} the min DateTime, or undefined if called with no argument\n   */\n  static min(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"min requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);\n  }\n\n  /**\n   * Return the max of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum\n   * @return {DateTime} the max DateTime, or undefined if called with no argument\n   */\n  static max(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"max requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);\n  }\n\n  // MISC\n\n  /**\n   * Explain how a string would be parsed by fromFormat()\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see description)\n   * @param {Object} options - options taken by fromFormat()\n   * @return {Object}\n   */\n  static fromFormatExplain(text, fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return explainFromTokens(localeToUse, text, fmt);\n  }\n\n  /**\n   * @deprecated use fromFormatExplain instead\n   */\n  static fromStringExplain(text, fmt, options = {}) {\n    return DateTime.fromFormatExplain(text, fmt, options);\n  }\n\n  /**\n   * Build a parser for `fmt` using the given locale. This parser can be passed\n   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This\n   * can be used to optimize cases where many dates need to be parsed in a\n   * specific format.\n   *\n   * @param {String} fmt - the format the string is expected to be in (see\n   * description)\n   * @param {Object} options - options used to set locale and numberingSystem\n   * for parser\n   * @returns {TokenParser} - opaque object to be used\n   */\n  static buildFormatParser(fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return new TokenParser(localeToUse, fmt);\n  }\n\n  /**\n   * Create a DateTime from an input string and format parser.\n   *\n   * The format parser must have been created with the same locale as this call.\n   *\n   * @param {String} text - the string to parse\n   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}\n   * @param {Object} opts - options taken by fromFormat()\n   * @returns {DateTime}\n   */\n  static fromFormatParser(text, formatParser, opts = {}) {\n    if (isUndefined(text) || isUndefined(formatParser)) {\n      throw new InvalidArgumentError(\n        \"fromFormatParser requires an input string and a format parser\"\n      );\n    }\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n\n    if (!localeToUse.equals(formatParser.locale)) {\n      throw new InvalidArgumentError(\n        `fromFormatParser called with a locale of ${localeToUse}, ` +\n          `but the format parser was created for ${formatParser.locale}`\n      );\n    }\n\n    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);\n\n    if (invalidReason) {\n      return DateTime.invalid(invalidReason);\n    } else {\n      return parseDataToDateTime(\n        result,\n        zone,\n        opts,\n        `format ${formatParser.format}`,\n        text,\n        specificOffset\n      );\n    }\n  }\n\n  // FORMAT PRESETS\n\n  /**\n   * {@link DateTime#toLocaleString} format like 10/14/1983\n   * @type {Object}\n   */\n  static get DATE_SHORT() {\n    return Formats.DATE_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED() {\n    return Formats.DATE_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED_WITH_WEEKDAY() {\n    return Formats.DATE_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_FULL() {\n    return Formats.DATE_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_HUGE() {\n    return Formats.DATE_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_SIMPLE() {\n    return Formats.TIME_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SECONDS() {\n    return Formats.TIME_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SHORT_OFFSET() {\n    return Formats.TIME_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_LONG_OFFSET() {\n    return Formats.TIME_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_SIMPLE() {\n    return Formats.TIME_24_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SECONDS() {\n    return Formats.TIME_24_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SHORT_OFFSET() {\n    return Formats.TIME_24_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_LONG_OFFSET() {\n    return Formats.TIME_24_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT() {\n    return Formats.DATETIME_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT_WITH_SECONDS() {\n    return Formats.DATETIME_SHORT_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED() {\n    return Formats.DATETIME_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_SECONDS() {\n    return Formats.DATETIME_MED_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_WEEKDAY() {\n    return Formats.DATETIME_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL() {\n    return Formats.DATETIME_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL_WITH_SECONDS() {\n    return Formats.DATETIME_FULL_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE() {\n    return Formats.DATETIME_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE_WITH_SECONDS() {\n    return Formats.DATETIME_HUGE_WITH_SECONDS;\n  }\n}\n\n/**\n * @private\n */\nexport function friendlyDateTime(dateTimeish) {\n  if (DateTime.isDateTime(dateTimeish)) {\n    return dateTimeish;\n  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {\n    return DateTime.fromJSDate(dateTimeish);\n  } else if (dateTimeish && typeof dateTimeish === \"object\") {\n    return DateTime.fromObject(dateTimeish);\n  } else {\n    throw new InvalidArgumentError(\n      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`\n    );\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Info from \"./info.js\";\nimport Zone from \"./zone.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport InvalidZone from \"./zones/invalidZone.js\";\nimport SystemZone from \"./zones/systemZone.js\";\nimport Settings from \"./settings.js\";\n\nconst VERSION = \"3.7.2\";\n\nexport {\n  VERSION,\n  DateTime,\n  Duration,\n  Interval,\n  Info,\n  Zone,\n  FixedOffsetZone,\n  IANAZone,\n  InvalidZone,\n  SystemZone,\n  Settings,\n};\n"],"names":["LuxonError","_Error","_inheritsLoose","apply","arguments","_wrapNativeSuper","Error","InvalidDateTimeError","_LuxonError","reason","call","toMessage","InvalidIntervalError","_LuxonError2","InvalidDurationError","_LuxonError3","ConflictingSpecificationError","_LuxonError4","InvalidUnitError","_LuxonError5","unit","InvalidArgumentError","_LuxonError6","ZoneIsAbstractError","_LuxonError7","n","s","l","DATE_SHORT","year","month","day","DATE_MED","DATE_MED_WITH_WEEKDAY","weekday","DATE_FULL","DATE_HUGE","TIME_SIMPLE","hour","minute","TIME_WITH_SECONDS","second","TIME_WITH_SHORT_OFFSET","timeZoneName","TIME_WITH_LONG_OFFSET","TIME_24_SIMPLE","hourCycle","TIME_24_WITH_SECONDS","TIME_24_WITH_SHORT_OFFSET","TIME_24_WITH_LONG_OFFSET","DATETIME_SHORT","DATETIME_SHORT_WITH_SECONDS","DATETIME_MED","DATETIME_MED_WITH_SECONDS","DATETIME_MED_WITH_WEEKDAY","DATETIME_FULL","DATETIME_FULL_WITH_SECONDS","DATETIME_HUGE","DATETIME_HUGE_WITH_SECONDS","Zone","_proto","prototype","offsetName","ts","opts","formatOffset","format","offset","equals","otherZone","_createClass","key","get","name","singleton","SystemZone","_Zone","_ref","locale","parseZoneInfo","Date","getTimezoneOffset","type","Intl","DateTimeFormat","resolvedOptions","timeZone","dtfCache","Map","makeDTF","zoneName","dtf","undefined","hour12","era","set","typeToPos","hackyOffset","date","formatted","replace","parsed","exec","fMonth","fDay","fYear","fadOrBc","fHour","fMinute","fSecond","partsOffset","formatToParts","filled","i","length","_formatted$i","value","pos","isUndefined","parseInt","ianaZoneCache","IANAZone","create","zone","resetCache","clear","isValidSpecifier","isValidZone","e","_this","valid","NaN","isNaN","_ref2","adOrBc","Math","abs","adjustedHour","asUTC","objToLocalTS","millisecond","asTS","over","intlLFCache","getCachedLF","locString","JSON","stringify","ListFormat","intlDTCache","getCachedDTF","intlNumCache","getCachedINF","inf","NumberFormat","intlRelCache","getCachedRTF","_opts","base","cacheKeyOpts","_objectWithoutPropertiesLoose","_excluded","RelativeTimeFormat","sysLocaleCache","systemLocale","intlResolvedOptionsCache","getCachedIntResolvedOptions","weekInfoCache","getCachedWeekInfo","data","Locale","getWeekInfo","weekInfo","_extends","fallbackWeekSettings","parseLocaleString","localeStr","xIndex","indexOf","substring","uIndex","options","selectedStr","smaller","_options","numberingSystem","calendar","intlConfigString","outputCalendar","includes","mapMonths","f","ms","dt","DateTime","utc","push","mapWeekdays","listStuff","loc","englishFn","intlFn","mode","listingMode","supportsFastNumbers","startsWith","PolyNumberFormatter","intl","forceSimple","padTo","floor","otherOpts","_excluded2","Object","keys","intlOpts","useGrouping","minimumIntegerDigits","fixed","roundTo","padStart","PolyDateFormatter","originalZone","z","gmtOffset","offsetZ","setZone","plus","minutes","_proto2","map","join","toJSDate","parts","part","PolyRelFormatter","isEnglish","style","hasRelative","rtf","_proto3","count","English","numeric","firstDay","minimalDays","weekend","fromOpts","weekSettings","defaultToEN","specifiedLocale","Settings","defaultLocale","localeR","numberingSystemR","defaultNumberingSystem","outputCalendarR","defaultOutputCalendar","weekSettingsR","validateWeekSettings","defaultWeekSettings","fromObject","_temp","numbering","_parseLocaleString","parsedLocale","parsedNumberingSystem","parsedOutputCalendar","weekdaysCache","standalone","monthsCache","meridiemCache","eraCache","fastNumbersCached","_proto4","isActuallyEn","hasNoWeirdness","clone","alts","getOwnPropertyNames","redefaultToEN","redefaultToSystem","months","_this2","monthSpecialCase","formatStr","mapper","extract","dtFormatter","weekdays","_this3","meridiems","_this4","eras","_this5","field","df","results","matching","find","m","toLowerCase","numberFormatter","fastNumbers","relFormatter","listFormatter","getWeekSettings","hasLocaleWeekInfo","getStartOfWeek","getMinDaysInFirstWeek","getWeekendDays","other","toString","FixedOffsetZone","instance","utcInstance","parseSpecifier","r","match","signedOffset","InvalidZone","normalizeZone","input","defaultZone","isString","lowered","isNumber","numberingSystems","arab","arabext","bali","beng","deva","fullwide","gujr","hanidec","khmr","knda","laoo","limb","mlym","mong","mymr","orya","tamldec","telu","thai","tibt","latn","numberingSystemsUTF16","hanidecChars","split","parseDigits","str","code","charCodeAt","search","_numberingSystemsUTF","min","max","digitRegexCache","resetDigitRegexCache","digitRegex","append","ns","appendCache","regex","RegExp","now","twoDigitCutoffYear","throwOnInvalid","resetCaches","cutoffYear","t","Invalid","explanation","nonLeapLadder","leapLadder","unitOutOfRange","dayOfWeek","d","UTC","setUTCFullYear","getUTCFullYear","js","getUTCDay","computeOrdinal","isLeapYear","uncomputeOrdinal","ordinal","table","month0","findIndex","isoWeekdayToLocal","isoWeekday","startOfWeek","gregorianToWeek","gregObj","minDaysInFirstWeek","weekNumber","weekYear","weeksInWeekYear","timeObject","weekToGregorian","weekData","weekdayOfJan4","yearInDays","daysInYear","_uncomputeOrdinal","gregorianToOrdinal","gregData","ordinalToGregorian","ordinalData","_uncomputeOrdinal2","usesLocalWeekValues","obj","hasLocaleWeekData","localWeekday","localWeekNumber","localWeekYear","hasIsoWeekData","hasInvalidWeekData","validYear","isInteger","validWeek","integerBetween","validWeekday","hasInvalidOrdinalData","validOrdinal","hasInvalidGregorianData","validMonth","validDay","daysInMonth","hasInvalidTimeData","validHour","validMinute","validSecond","validMillisecond","o","isDate","maybeArray","thing","Array","isArray","bestBy","arr","by","compare","reduce","best","next","pair","pick","a","k","hasOwnProperty","prop","settings","some","v","from","bottom","top","floorMod","x","isNeg","padded","parseInteger","string","parseFloating","parseFloat","parseMillis","fraction","number","digits","rounding","factor","pow","ceil","trunc","round","RangeError","modMonth","modYear","firstWeekOffset","fwdlw","weekOffset","weekOffsetNext","untruncateYear","offsetFormat","modified","offHourStr","offMinuteStr","offHour","Number","offMin","offMinSigned","is","asNumber","numericValue","isFinite","normalizeObject","normalizer","normalized","u","hours","sign","monthsLong","monthsShort","monthsNarrow","concat","weekdaysLong","weekdaysShort","weekdaysNarrow","erasLong","erasShort","erasNarrow","meridiemForDateTime","weekdayForDateTime","monthForDateTime","eraForDateTime","formatRelativeTime","narrow","units","years","quarters","weeks","days","seconds","lastable","isDay","isInPast","fmtValue","singular","lilUnits","fmtUnit","stringifyTokens","splits","tokenToString","_iterator","_createForOfIteratorHelperLoose","_step","done","token","literal","val","macroTokenToFormatOpts","D","Formats","DD","DDD","DDDD","tt","ttt","tttt","T","TT","TTT","TTTT","ff","fff","ffff","F","FF","FFF","FFFF","Formatter","parseFormat","fmt","current","currentFull","bracketed","c","charAt","test","formatOpts","systemLoc","formatWithSystemDefault","formatDateTime","formatDateTimeParts","formatInterval","interval","start","formatRange","end","num","p","signDisplay","formatDateTimeFromString","knownEnglish","useDateTimeFormatter","isOffsetFixed","allowZ","isValid","meridiem","maybeMacro","slice","quarter","formatDurationFromString","dur","invertLargest","signMode","tokenToField","lildur","info","mapped","inversionFactor","isNegativeDuration","largestUnit","tokens","realTokens","found","collapsed","shiftTo","filter","durationInfo","values","ianaRegex","combineRegexes","_len","regexes","_key","full","source","combineExtractors","_len2","extractors","_key2","ex","mergedVals","mergedZone","cursor","_ex","parse","_len3","patterns","_key3","_i","_patterns","_patterns$_i","extractor","simpleParse","_len4","_key4","ret","offsetRegex","isoExtendedZone","isoTimeBaseRegex","isoTimeRegex","isoTimeExtensionRegex","isoYmdRegex","isoWeekRegex","isoOrdinalRegex","extractISOWeekData","extractISOOrdinalData","sqlYmdRegex","sqlTimeRegex","sqlTimeExtensionRegex","int","fallback","extractISOYmd","item","extractISOTime","milliseconds","extractISOOffset","local","fullOffset","extractIANAZone","isoTimeOnly","isoDuration","extractISODuration","yearStr","monthStr","weekStr","dayStr","hourStr","minuteStr","secondStr","millisecondsStr","hasNegativePrefix","negativeSeconds","maybeNegate","force","obsOffsets","GMT","EDT","EST","CDT","CST","MDT","MST","PDT","PST","fromStrings","weekdayStr","result","rfc2822","extractRFC2822","obsOffset","milOffset","preprocessRFC2822","trim","rfc1123","rfc850","ascii","extractRFC1123Or850","extractASCII","isoYmdWithTimeExtensionRegex","isoWeekWithTimeExtensionRegex","isoOrdinalWithTimeExtensionRegex","isoTimeCombinedRegex","extractISOYmdTimeAndOffset","extractISOWeekTimeAndOffset","extractISOOrdinalDateAndTime","extractISOTimeAndOffset","parseISODate","parseRFC2822Date","parseHTTPDate","parseISODuration","extractISOTimeOnly","parseISOTimeOnly","sqlYmdWithTimeExtensionRegex","sqlTimeCombinedRegex","extractISOTimeOffsetAndIANAZone","parseSQL","INVALID","lowOrderMatrix","casualMatrix","daysInYearAccurate","daysInMonthAccurate","accurateMatrix","orderedUnits","reverseUnits","reverse","conf","conversionAccuracy","matrix","Duration","durationToMillis","vals","_vals$milliseconds","sum","normalizeValues","reduceRight","previous","previousVal","conv","rollUp","removeZeroes","newVals","_Object$entries","entries","_Object$entries$_i","_Symbol$for","config","accurate","invalid","isLuxonDuration","fromMillis","normalizeUnit","fromDurationLike","durationLike","isDuration","fromISO","text","_parseISODuration","fromISOTime","_parseISOTimeOnly","week","toFormat","fmtOpts","toHuman","showZeros","unitDisplay","listStyle","toObject","toISO","toISOTime","millis","toMillis","suppressMilliseconds","suppressSeconds","includePrefix","includeOffset","dateTime","toJSON","invalidReason","valueOf","duration","_i2","_orderedUnits","minus","negate","mapUnits","fn","_i3","_Object$keys","mixed","reconfigure","as","normalize","rescale","shiftToAll","built","accumulated","lastUnit","_i4","_orderedUnits2","own","ak","negated","_i5","_Object$keys2","removeZeros","eq","v1","v2","_i6","_orderedUnits3","Symbol","for","validateStartEnd","Interval","isLuxonInterval","fromDateTimes","builtStart","friendlyDateTime","builtEnd","validateError","after","before","_split","startIsValid","endIsValid","isInterval","toDuration","startOf","useLocaleWeeks","diff","hasSame","isEmpty","isAfter","isBefore","contains","splitAt","dateTimes","sorted","sort","b","added","splitBy","idx","divideEqually","numberOfParts","overlaps","abutsStart","abutsEnd","engulfs","intersection","union","merge","intervals","_intervals$sort$reduc","sofar","final","xor","_Array$prototype","currentCount","ends","time","flattened","difference","toLocaleString","toISODate","dateFormat","_temp2","_ref3","_ref3$separator","separator","mapEndpoints","mapFn","Info","hasDST","proto","isUniversal","isValidIANAZone","_ref$locale","_ref$locObj","locObj","getMinimumDaysInFirstWeek","_ref2$locale","_ref2$locObj","getWeekendWeekdays","_temp3","_ref3$locale","_ref3$locObj","_temp4","_ref4","_ref4$locale","_ref4$numberingSystem","_ref4$locObj","_ref4$outputCalendar","monthsFormat","_temp5","_ref5","_ref5$locale","_ref5$numberingSystem","_ref5$locObj","_ref5$outputCalendar","_temp6","_ref6","_ref6$locale","_ref6$numberingSystem","_ref6$locObj","weekdaysFormat","_temp7","_ref7","_ref7$locale","_ref7$numberingSystem","_ref7$locObj","_temp8","_ref8","_ref8$locale","_temp9","_ref9","_ref9$locale","features","relative","localeWeek","dayDiff","earlier","later","utcDayStart","toUTC","keepLocalTime","highOrderDiffs","differs","lowestOrder","highWater","_differs","_differs$_i","differ","_highOrderDiffs","remainingMillis","lowerOrderUnits","_cursor$plus","_Duration$fromMillis","MISSING_FTP","intUnit","post","deser","NBSP","String","fromCharCode","spaceOrNBSP","spaceOrNBSPRegExp","fixListRegex","stripInsensitivities","oneOf","strings","startIndex","groups","h","simple","escapeToken","unitForToken","one","two","three","four","six","oneOrTwo","oneToThree","oneToSix","oneToNine","twoToFour","fourToSix","unitate","partTypeStyleToTokenVal","short","long","dayperiod","dayPeriod","hour24","tokenForPart","resolvedOpts","isSpace","actualType","buildRegex","re","handlers","matches","all","matchIndex","dateTimeFromMatches","toField","specificOffset","Z","q","M","G","y","S","dummyDateTimeCache","getDummyDateTime","maybeExpandMacroToken","formatOptsToTokens","expandMacroTokens","TokenParser","disqualifyingUnit","_buildRegex","regexString","explainFromTokens","_match","rawMatches","parser","parseFromTokens","_explainFromTokens","formatter","MAX_DATE","unsupportedZone","possiblyCachedWeekData","possiblyCachedLocalWeekData","localWeekData","inst","old","fixOffset","localTS","tz","utcGuess","o2","o3","tsToObj","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","objToTS","adjustTime","oPre","millisToAdd","_fixOffset","parseDataToDateTime","parsedZone","interpretationZone","toTechFormat","extended","precision","longFormat","extendedZone","showSeconds","ianaName","defaultUnitValues","defaultWeekUnitValues","defaultOrdinalUnitValues","orderedWeekUnits","orderedOrdinalUnits","weeknumber","weeksnumber","weeknumbers","weekyear","weekyears","normalizeUnitWithLocalWeeks","guessOffsetForZone","zoneOffsetTs","offsetGuess","zoneOffsetGuessCache","quickDT","offsetProvis","_objToTS","diffRelative","calendary","lastOpts","argList","args","unchanged","ot","_zone","isLuxonDateTime","_lastOpts","_lastOpts2","fromJSDate","zoneToUse","fromSeconds","_usesLocalWeekValues","tsNow","containsOrdinal","containsGregorYear","containsGregorMD","containsGregor","definiteWeekDef","useWeekData","defaultValues","objNow","foundFirst","_iterator2","_step2","higherOrderInvalid","gregorian","_objToTS2","tsFinal","offsetFinal","_parseISODate","fromRFC2822","_parseRFC2822Date","fromHTTP","_parseHTTPDate","fromFormat","_opts$locale","_opts$numberingSystem","localeToUse","_parseFromTokens","fromString","fromSQL","_parseSQL","isDateTime","parseFormatForOpts","localeOpts","tokenList","expandFormat","expanded","getPossibleOffsets","dayMs","minuteMs","oEarlier","oLater","o1","ts1","ts2","c1","c2","resolvedLocaleOptions","_Formatter$create$res","toLocal","_ref2$keepLocalTime","_ref2$keepCalendarTim","keepCalendarTime","newTS","asObj","_objToTS3","setLocale","_usesLocalWeekValues2","settingWeekStuff","_objToTS4","_ref4$useLocaleWeeks","normalizedUnit","endOf","_this$plus","toLocaleParts","_ref5$format","_ref5$suppressSeconds","_ref5$suppressMillise","_ref5$includeOffset","_ref5$extendedZone","_ref5$precision","ext","_ref6$format","_ref6$precision","toISOWeekDate","_ref7$suppressMillise","_ref7$suppressSeconds","_ref7$includeOffset","_ref7$includePrefix","_ref7$extendedZone","_ref7$format","_ref7$precision","toRFC2822","toHTTP","toSQLDate","toSQLTime","_ref8$includeOffset","_ref8$includeZone","includeZone","_ref8$includeOffsetSp","includeOffsetSpace","toSQL","toSeconds","toUnixInteger","toBSON","includeConfig","otherDateTime","durOpts","otherIsLater","diffed","diffNow","until","inputMs","adjustedToZone","toRelative","padding","toRelativeCalendar","every","fromFormatExplain","_options$locale","_options$numberingSys","fromStringExplain","buildFormatParser","_options2","_options2$locale","_options2$numberingSy","fromFormatParser","formatParser","_opts2","_opts2$locale","_opts2$numberingSyste","_formatParser$explain","dateTimeish","VERSION"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAEA;AACA;AACA;AAFA,IAGMA,UAAU,0BAAAC,MAAA,EAAA;EAAAC,cAAA,CAAAF,UAAA,EAAAC,MAAA,CAAA,CAAA;AAAA,EAAA,SAAAD,UAAA,GAAA;AAAA,IAAA,OAAAC,MAAA,CAAAE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;AAAA,GAAA;AAAA,EAAA,OAAAJ,UAAA,CAAA;AAAA,CAAAK,eAAAA,gBAAA,CAASC,KAAK,CAAA,CAAA,CAAA;AAE9B;AACA;AACA;AACaC,IAAAA,oBAAoB,0BAAAC,WAAA,EAAA;EAAAN,cAAA,CAAAK,oBAAA,EAAAC,WAAA,CAAA,CAAA;EAC/B,SAAAD,oBAAAA,CAAYE,MAAM,EAAE;IAAA,OAClBD,WAAA,CAAAE,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;AAClD,GAAA;AAAC,EAAA,OAAAJ,oBAAA,CAAA;AAAA,CAAA,CAHuCP,UAAU,CAAA,CAAA;;AAMpD;AACA;AACA;AACaY,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;EAAAX,cAAA,CAAAU,oBAAA,EAAAC,YAAA,CAAA,CAAA;EAC/B,SAAAD,oBAAAA,CAAYH,MAAM,EAAE;IAAA,OAClBI,YAAA,CAAAH,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;AAClD,GAAA;AAAC,EAAA,OAAAC,oBAAA,CAAA;AAAA,CAAA,CAHuCZ,UAAU,CAAA,CAAA;;AAMpD;AACA;AACA;AACac,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;EAAAb,cAAA,CAAAY,oBAAA,EAAAC,YAAA,CAAA,CAAA;EAC/B,SAAAD,oBAAAA,CAAYL,MAAM,EAAE;IAAA,OAClBM,YAAA,CAAAL,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;AAClD,GAAA;AAAC,EAAA,OAAAG,oBAAA,CAAA;AAAA,CAAA,CAHuCd,UAAU,CAAA,CAAA;;AAMpD;AACA;AACA;AACagB,IAAAA,6BAA6B,0BAAAC,YAAA,EAAA;EAAAf,cAAA,CAAAc,6BAAA,EAAAC,YAAA,CAAA,CAAA;AAAA,EAAA,SAAAD,6BAAA,GAAA;AAAA,IAAA,OAAAC,YAAA,CAAAd,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;AAAA,GAAA;AAAA,EAAA,OAAAY,6BAAA,CAAA;AAAA,CAAA,CAAShB,UAAU,CAAA,CAAA;;AAE7D;AACA;AACA;AACakB,IAAAA,gBAAgB,0BAAAC,YAAA,EAAA;EAAAjB,cAAA,CAAAgB,gBAAA,EAAAC,YAAA,CAAA,CAAA;EAC3B,SAAAD,gBAAAA,CAAYE,IAAI,EAAE;AAAA,IAAA,OAChBD,YAAA,CAAAT,IAAA,CAAA,IAAA,EAAA,eAAA,GAAsBU,IAAM,CAAC,IAAA,IAAA,CAAA;AAC/B,GAAA;AAAC,EAAA,OAAAF,gBAAA,CAAA;AAAA,CAAA,CAHmClB,UAAU,CAAA,CAAA;;AAMhD;AACA;AACA;AACaqB,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;EAAApB,cAAA,CAAAmB,oBAAA,EAAAC,YAAA,CAAA,CAAA;AAAA,EAAA,SAAAD,oBAAA,GAAA;AAAA,IAAA,OAAAC,YAAA,CAAAnB,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;AAAA,GAAA;AAAA,EAAA,OAAAiB,oBAAA,CAAA;AAAA,CAAA,CAASrB,UAAU,CAAA,CAAA;;AAEpD;AACA;AACA;AACauB,IAAAA,mBAAmB,0BAAAC,YAAA,EAAA;EAAAtB,cAAA,CAAAqB,mBAAA,EAAAC,YAAA,CAAA,CAAA;AAC9B,EAAA,SAAAD,sBAAc;AAAA,IAAA,OACZC,YAAA,CAAAd,IAAA,CAAA,IAAA,EAAM,2BAA2B,CAAC,IAAA,IAAA,CAAA;AACpC,GAAA;AAAC,EAAA,OAAAa,mBAAA,CAAA;AAAA,CAAA,CAHsCvB,UAAU,CAAA;;ACxDnD;AACA;AACA;;AAEA,IAAMyB,CAAC,GAAG,SAAS;AACjBC,EAAAA,CAAC,GAAG,OAAO;AACXC,EAAAA,CAAC,GAAG,MAAM,CAAA;AAEL,IAAMC,UAAU,GAAG;AACxBC,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,IAAMO,QAAQ,GAAG;AACtBH,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,IAAMQ,qBAAqB,GAAG;AACnCJ,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAER,CAAAA;AACX,CAAC,CAAA;AAEM,IAAMS,SAAS,GAAG;AACvBN,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,IAAMW,SAAS,GAAG;AACvBP,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAAA;AACX,CAAC,CAAA;AAEM,IAAMU,WAAW,GAAG;AACzBC,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,IAAMe,iBAAiB,GAAG;AAC/BF,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,IAAMiB,sBAAsB,GAAG;AACpCJ,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAMkB,qBAAqB,GAAG;AACnCN,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAMkB,cAAc,GAAG;AAC5BP,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAA;AACb,CAAC,CAAA;AAEM,IAAMC,oBAAoB,GAAG;AAClCT,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAA;AACb,CAAC,CAAA;AAEM,IAAME,yBAAyB,GAAG;AACvCV,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAK;AAChBH,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAMuB,wBAAwB,GAAG;AACtCX,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAK;AAChBH,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAMuB,cAAc,GAAG;AAC5BrB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,IAAM0B,2BAA2B,GAAG;AACzCtB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,IAAM2B,YAAY,GAAG;AAC1BvB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,IAAM4B,yBAAyB,GAAG;AACvCxB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,IAAM6B,yBAAyB,GAAG;AACvCzB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAER,CAAC;AACVY,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,IAAM8B,aAAa,GAAG;AAC3B1B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAM8B,0BAA0B,GAAG;AACxC3B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAM+B,aAAa,GAAG;AAC3B5B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAC;AACVW,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,IAAM+B,0BAA0B,GAAG;AACxC7B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAC;AACVW,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC;;AC7KD;AACA;AACA;AAFA,IAGqBgC,IAAI,gBAAA,YAAA;AAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;AAAA,EAAA,IAAAC,MAAA,GAAAD,IAAA,CAAAE,SAAA,CAAA;AAsCvB;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAEC,IAAI,EAAE;IACnB,MAAM,IAAIzC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAAqC,MAAA,CAQAK,YAAY,GAAZ,SAAAA,aAAaF,EAAE,EAAEG,MAAM,EAAE;IACvB,MAAM,IAAI3C,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAqC,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;IACT,MAAM,IAAIxC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAqC,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;IAChB,MAAM,IAAI9C,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA+C,EAAAA,YAAA,CAAAX,IAAA,EAAA,CAAA;IAAAY,GAAA,EAAA,MAAA;IAAAC,GAAA;AAlFA;AACF;AACA;AACA;AACA;AACE,IAAA,SAAAA,MAAW;MACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;AACjC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAgD,GAAA,EAAA,MAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;MACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;AACjC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAgD,GAAA,EAAA,UAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;MACb,OAAO,IAAI,CAACC,IAAI,CAAA;AAClB,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAF,GAAA,EAAA,aAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;MAChB,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;AACjC,KAAA;AAAC,GAAA,EAAA;IAAAgD,GAAA,EAAA,SAAA;IAAAC,GAAA,EAoDD,SAAAA,GAAAA,GAAc;MACZ,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;AACjC,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAoC,IAAA,CAAA;AAAA,CAAA;;AC5FH,IAAIe,WAAS,GAAG,IAAI,CAAA;;AAEpB;AACA;AACA;AACA;AACqBC,IAAAA,UAAU,0BAAAC,KAAA,EAAA;EAAA1E,cAAA,CAAAyE,UAAA,EAAAC,KAAA,CAAA,CAAA;AAAA,EAAA,SAAAD,UAAA,GAAA;AAAA,IAAA,OAAAC,KAAA,CAAAzE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;AAAA,GAAA;AAAA,EAAA,IAAAwD,MAAA,GAAAe,UAAA,CAAAd,SAAA,CAAA;AA2B7B;EAAAD,MAAA,CACAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;AAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;MAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;AAC7B,IAAA,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,CAAC,CAAA;AAC1C,GAAA;;AAEA,oBAAA;EAAAlB,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;IACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;AAC9C,GAAA;;AAEA,oBAAA;AAAAN,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;IACT,OAAO,CAAC,IAAIiB,IAAI,CAACjB,EAAE,CAAC,CAACkB,iBAAiB,EAAE,CAAA;AAC1C,GAAA;;AAEA,oBAAA;AAAArB,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,QAAQ,CAAA;AACpC,GAAA;;AAEA,oBAAA;AAAAZ,EAAAA,YAAA,CAAAK,UAAA,EAAA,CAAA;IAAAJ,GAAA,EAAA,MAAA;AAAAC,IAAAA,GAAA;AAlCA,IAAA,SAAAA,MAAW;AACT,MAAA,OAAO,QAAQ,CAAA;AACjB,KAAA;;AAEA;AAAA,GAAA,EAAA;IAAAD,GAAA,EAAA,MAAA;IAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAIW,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACC,QAAQ,CAAA;AAC7D,KAAA;;AAEA;AAAA,GAAA,EAAA;IAAAf,GAAA,EAAA,aAAA;IAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;AAChB,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAAC,GAAA,EAAA;IAAAD,GAAA,EAAA,SAAA;IAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAAC,GAAA,CAAA,EAAA,CAAA;IAAAD,GAAA,EAAA,UAAA;IAAAC,GAAA;AAjDD;AACF;AACA;AACA;AACE,IAAA,SAAAA,MAAsB;MACpB,IAAIE,WAAS,KAAK,IAAI,EAAE;AACtBA,QAAAA,WAAS,GAAG,IAAIC,UAAU,EAAE,CAAA;AAC9B,OAAA;AACA,MAAA,OAAOD,WAAS,CAAA;AAClB,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAC,UAAA,CAAA;AAAA,CAAA,CAVqChB,IAAI;;ACN5C,IAAM4B,QAAQ,GAAG,IAAIC,GAAG,EAAE,CAAA;AAC1B,SAASC,OAAOA,CAACC,QAAQ,EAAE;AACzB,EAAA,IAAIC,GAAG,GAAGJ,QAAQ,CAACf,GAAG,CAACkB,QAAQ,CAAC,CAAA;EAChC,IAAIC,GAAG,KAAKC,SAAS,EAAE;AACrBD,IAAAA,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;AACrCS,MAAAA,MAAM,EAAE,KAAK;AACbP,MAAAA,QAAQ,EAAEI,QAAQ;AAClB7D,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,KAAK,EAAE,SAAS;AAChBC,MAAAA,GAAG,EAAE,SAAS;AACdO,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,MAAM,EAAE,SAAS;AACjBE,MAAAA,MAAM,EAAE,SAAS;AACjBqD,MAAAA,GAAG,EAAE,OAAA;AACP,KAAC,CAAC,CAAA;AACFP,IAAAA,QAAQ,CAACQ,GAAG,CAACL,QAAQ,EAAEC,GAAG,CAAC,CAAA;AAC7B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAMK,SAAS,GAAG;AAChBnE,EAAAA,IAAI,EAAE,CAAC;AACPC,EAAAA,KAAK,EAAE,CAAC;AACRC,EAAAA,GAAG,EAAE,CAAC;AACN+D,EAAAA,GAAG,EAAE,CAAC;AACNxD,EAAAA,IAAI,EAAE,CAAC;AACPC,EAAAA,MAAM,EAAE,CAAC;AACTE,EAAAA,MAAM,EAAE,CAAA;AACV,CAAC,CAAA;AAED,SAASwD,WAAWA,CAACN,GAAG,EAAEO,IAAI,EAAE;AACxB,EAAA,IAAAC,SAAS,GAAGR,GAAG,CAACzB,MAAM,CAACgC,IAAI,CAAC,CAACE,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;AACvDC,IAAAA,MAAM,GAAG,iDAAiD,CAACC,IAAI,CAACH,SAAS,CAAC;AACvEI,IAAAA,MAAM,GAAmDF,MAAM,CAAA,CAAA,CAAA;AAAvDG,IAAAA,IAAI,GAA6CH,MAAM,CAAA,CAAA,CAAA;AAAjDI,IAAAA,KAAK,GAAsCJ,MAAM,CAAA,CAAA,CAAA;AAA1CK,IAAAA,OAAO,GAA6BL,MAAM,CAAA,CAAA,CAAA;AAAjCM,IAAAA,KAAK,GAAsBN,MAAM,CAAA,CAAA,CAAA;AAA1BO,IAAAA,OAAO,GAAaP,MAAM,CAAA,CAAA,CAAA;AAAjBQ,IAAAA,OAAO,GAAIR,MAAM,CAAA,CAAA,CAAA,CAAA;AACpE,EAAA,OAAO,CAACI,KAAK,EAAEF,MAAM,EAAEC,IAAI,EAAEE,OAAO,EAAEC,KAAK,EAAEC,OAAO,EAAEC,OAAO,CAAC,CAAA;AAChE,CAAA;AAEA,SAASC,WAAWA,CAACnB,GAAG,EAAEO,IAAI,EAAE;AAC9B,EAAA,IAAMC,SAAS,GAAGR,GAAG,CAACoB,aAAa,CAACb,IAAI,CAAC,CAAA;EACzC,IAAMc,MAAM,GAAG,EAAE,CAAA;AACjB,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGd,SAAS,CAACe,MAAM,EAAED,CAAC,EAAE,EAAE;AACzC,IAAA,IAAAE,YAAA,GAAwBhB,SAAS,CAACc,CAAC,CAAC;MAA5B/B,IAAI,GAAAiC,YAAA,CAAJjC,IAAI;MAAEkC,KAAK,GAAAD,YAAA,CAALC,KAAK,CAAA;AACnB,IAAA,IAAMC,GAAG,GAAGrB,SAAS,CAACd,IAAI,CAAC,CAAA;IAE3B,IAAIA,IAAI,KAAK,KAAK,EAAE;AAClB8B,MAAAA,MAAM,CAACK,GAAG,CAAC,GAAGD,KAAK,CAAA;AACrB,KAAC,MAAM,IAAI,CAACE,WAAW,CAACD,GAAG,CAAC,EAAE;MAC5BL,MAAM,CAACK,GAAG,CAAC,GAAGE,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;AACnC,KAAA;AACF,GAAA;AACA,EAAA,OAAOJ,MAAM,CAAA;AACf,CAAA;AAEA,IAAMQ,aAAa,GAAG,IAAIhC,GAAG,EAAE,CAAA;AAC/B;AACA;AACA;AACA;AACqBiC,IAAAA,QAAQ,0BAAA7C,KAAA,EAAA;EAAA1E,cAAA,CAAAuH,QAAA,EAAA7C,KAAA,CAAA,CAAA;AAC3B;AACF;AACA;AACA;AAHE6C,EAAAA,QAAA,CAIOC,MAAM,GAAb,SAAAA,MAAAA,CAAcjD,IAAI,EAAE;AAClB,IAAA,IAAIkD,IAAI,GAAGH,aAAa,CAAChD,GAAG,CAACC,IAAI,CAAC,CAAA;IAClC,IAAIkD,IAAI,KAAK/B,SAAS,EAAE;AACtB4B,MAAAA,aAAa,CAACzB,GAAG,CAACtB,IAAI,EAAGkD,IAAI,GAAG,IAAIF,QAAQ,CAAChD,IAAI,CAAE,CAAC,CAAA;AACtD,KAAA;AACA,IAAA,OAAOkD,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAF,EAAAA,QAAA,CAIOG,UAAU,GAAjB,SAAAA,aAAoB;IAClBJ,aAAa,CAACK,KAAK,EAAE,CAAA;IACrBtC,QAAQ,CAACsC,KAAK,EAAE,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAAJ,EAAAA,QAAA,CAQOK,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBpG,CAAC,EAAE;AACzB,IAAA,OAAO,IAAI,CAACqG,WAAW,CAACrG,CAAC,CAAC,CAAA;AAC5B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAA+F,EAAAA,QAAA,CAQOM,WAAW,GAAlB,SAAAA,WAAAA,CAAmBJ,IAAI,EAAE;IACvB,IAAI,CAACA,IAAI,EAAE;AACT,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IACA,IAAI;AACF,MAAA,IAAIxC,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;AAAEE,QAAAA,QAAQ,EAAEqC,IAAAA;AAAK,OAAC,CAAC,CAACzD,MAAM,EAAE,CAAA;AAC7D,MAAA,OAAO,IAAI,CAAA;KACZ,CAAC,OAAO8D,CAAC,EAAE;AACV,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;GACD,CAAA;EAED,SAAAP,QAAAA,CAAYhD,IAAI,EAAE;AAAA,IAAA,IAAAwD,KAAA,CAAA;AAChBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;AACP;IACAuH,KAAA,CAAKvC,QAAQ,GAAGjB,IAAI,CAAA;AACpB;IACAwD,KAAA,CAAKC,KAAK,GAAGT,QAAQ,CAACM,WAAW,CAACtD,IAAI,CAAC,CAAA;AAAC,IAAA,OAAAwD,KAAA,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,EAAA,IAAArE,MAAA,GAAA6D,QAAA,CAAA5D,SAAA,CAAA;AA4BA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;AAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;MAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;IAC7B,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,EAAE,IAAI,CAACL,IAAI,CAAC,CAAA;AACrD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;IACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAN,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;AACT,IAAA,IAAI,CAAC,IAAI,CAACmE,KAAK,EAAE,OAAOC,GAAG,CAAA;AAC3B,IAAA,IAAMjC,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC,CAAA;AAEzB,IAAA,IAAIqE,KAAK,CAAClC,IAAI,CAAC,EAAE,OAAOiC,GAAG,CAAA;AAE3B,IAAA,IAAMxC,GAAG,GAAGF,OAAO,CAAC,IAAI,CAAChB,IAAI,CAAC,CAAA;AAC9B,IAAA,IAAA4D,KAAA,GAAuD1C,GAAG,CAACoB,aAAa,GACpED,WAAW,CAACnB,GAAG,EAAEO,IAAI,CAAC,GACtBD,WAAW,CAACN,GAAG,EAAEO,IAAI,CAAC;AAFrBrE,MAAAA,IAAI,GAAAwG,KAAA,CAAA,CAAA,CAAA;AAAEvG,MAAAA,KAAK,GAAAuG,KAAA,CAAA,CAAA,CAAA;AAAEtG,MAAAA,GAAG,GAAAsG,KAAA,CAAA,CAAA,CAAA;AAAEC,MAAAA,MAAM,GAAAD,KAAA,CAAA,CAAA,CAAA;AAAE/F,MAAAA,IAAI,GAAA+F,KAAA,CAAA,CAAA,CAAA;AAAE9F,MAAAA,MAAM,GAAA8F,KAAA,CAAA,CAAA,CAAA;AAAE5F,MAAAA,MAAM,GAAA4F,KAAA,CAAA,CAAA,CAAA,CAAA;IAInD,IAAIC,MAAM,KAAK,IAAI,EAAE;MACnBzG,IAAI,GAAG,CAAC0G,IAAI,CAACC,GAAG,CAAC3G,IAAI,CAAC,GAAG,CAAC,CAAA;AAC5B,KAAA;;AAEA;IACA,IAAM4G,YAAY,GAAGnG,IAAI,KAAK,EAAE,GAAG,CAAC,GAAGA,IAAI,CAAA;IAE3C,IAAMoG,KAAK,GAAGC,YAAY,CAAC;AACzB9G,MAAAA,IAAI,EAAJA,IAAI;AACJC,MAAAA,KAAK,EAALA,KAAK;AACLC,MAAAA,GAAG,EAAHA,GAAG;AACHO,MAAAA,IAAI,EAAEmG,YAAY;AAClBlG,MAAAA,MAAM,EAANA,MAAM;AACNE,MAAAA,MAAM,EAANA,MAAM;AACNmG,MAAAA,WAAW,EAAE,CAAA;AACf,KAAC,CAAC,CAAA;IAEF,IAAIC,IAAI,GAAG,CAAC3C,IAAI,CAAA;AAChB,IAAA,IAAM4C,IAAI,GAAGD,IAAI,GAAG,IAAI,CAAA;IACxBA,IAAI,IAAIC,IAAI,IAAI,CAAC,GAAGA,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;IACtC,OAAO,CAACJ,KAAK,GAAGG,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAjF,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,MAAM,IAAIb,SAAS,CAACI,IAAI,KAAK,IAAI,CAACA,IAAI,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAH,EAAAA,YAAA,CAAAmD,QAAA,EAAA,CAAA;IAAAlD,GAAA,EAAA,MAAA;IAAAC,GAAA,EAlGA,SAAAA,GAAAA,GAAW;AACT,MAAA,OAAO,MAAM,CAAA;AACf,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAD,GAAA,EAAA,MAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;AACtB,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAnB,GAAA,EAAA,aAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;AAChB,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAAC,GAAA,EAAA;IAAAD,GAAA,EAAA,SAAA;IAAAC,GAAA,EAkFD,SAAAA,GAAAA,GAAc;MACZ,OAAO,IAAI,CAAC0D,KAAK,CAAA;AACnB,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAT,QAAA,CAAA;AAAA,CAAA,CA5KmC9D,IAAI;;;;;ACvD1C;;AAEA,IAAIoF,WAAW,GAAG,EAAE,CAAA;AACpB,SAASC,WAAWA,CAACC,SAAS,EAAEjF,IAAI,EAAO;AAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;IAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,GAAA;EACvC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAI2B,GAAG,GAAGoD,WAAW,CAACxE,GAAG,CAAC,CAAA;EAC1B,IAAI,CAACoB,GAAG,EAAE;IACRA,GAAG,GAAG,IAAIR,IAAI,CAACiE,UAAU,CAACH,SAAS,EAAEjF,IAAI,CAAC,CAAA;AAC1C+E,IAAAA,WAAW,CAACxE,GAAG,CAAC,GAAGoB,GAAG,CAAA;AACxB,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAM0D,WAAW,GAAG,IAAI7D,GAAG,EAAE,CAAA;AAC7B,SAAS8D,YAAYA,CAACL,SAAS,EAAEjF,IAAI,EAAO;AAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;IAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,GAAA;EACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAI2B,GAAG,GAAG0D,WAAW,CAAC7E,GAAG,CAACD,GAAG,CAAC,CAAA;EAC9B,IAAIoB,GAAG,KAAKC,SAAS,EAAE;IACrBD,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC6D,SAAS,EAAEjF,IAAI,CAAC,CAAA;AAC9CqF,IAAAA,WAAW,CAACtD,GAAG,CAACxB,GAAG,EAAEoB,GAAG,CAAC,CAAA;AAC3B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAM4D,YAAY,GAAG,IAAI/D,GAAG,EAAE,CAAA;AAC9B,SAASgE,YAAYA,CAACP,SAAS,EAAEjF,IAAI,EAAO;AAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;IAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,GAAA;EACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAIyF,GAAG,GAAGF,YAAY,CAAC/E,GAAG,CAACD,GAAG,CAAC,CAAA;EAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;IACrB6D,GAAG,GAAG,IAAItE,IAAI,CAACuE,YAAY,CAACT,SAAS,EAAEjF,IAAI,CAAC,CAAA;AAC5CuF,IAAAA,YAAY,CAACxD,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAME,YAAY,GAAG,IAAInE,GAAG,EAAE,CAAA;AAC9B,SAASoE,YAAYA,CAACX,SAAS,EAAEjF,IAAI,EAAO;AAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;IAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,GAAA;EACxC6F,IAAAA,KAAA,GAAkC7F,IAAI,CAAA;IAA1B6F,KAAA,CAAJC,IAAI,CAAA;AAAKC,QAAAA,YAAY,GAAAC,6BAAA,CAAAH,KAAA,EAAAI,SAAA,EAAU;EACvC,IAAM1F,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEc,YAAY,CAAC,CAAC,CAAA;AACrD,EAAA,IAAIN,GAAG,GAAGE,YAAY,CAACnF,GAAG,CAACD,GAAG,CAAC,CAAA;EAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;IACrB6D,GAAG,GAAG,IAAItE,IAAI,CAAC+E,kBAAkB,CAACjB,SAAS,EAAEjF,IAAI,CAAC,CAAA;AAClD2F,IAAAA,YAAY,CAAC5D,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAIU,cAAc,GAAG,IAAI,CAAA;AACzB,SAASC,YAAYA,GAAG;AACtB,EAAA,IAAID,cAAc,EAAE;AAClB,IAAA,OAAOA,cAAc,CAAA;AACvB,GAAC,MAAM;AACLA,IAAAA,cAAc,GAAG,IAAIhF,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACP,MAAM,CAAA;AACnE,IAAA,OAAOqF,cAAc,CAAA;AACvB,GAAA;AACF,CAAA;AAEA,IAAME,wBAAwB,GAAG,IAAI7E,GAAG,EAAE,CAAA;AAC1C,SAAS8E,2BAA2BA,CAACrB,SAAS,EAAE;AAC9C,EAAA,IAAIjF,IAAI,GAAGqG,wBAAwB,CAAC7F,GAAG,CAACyE,SAAS,CAAC,CAAA;EAClD,IAAIjF,IAAI,KAAK4B,SAAS,EAAE;IACtB5B,IAAI,GAAG,IAAImB,IAAI,CAACC,cAAc,CAAC6D,SAAS,CAAC,CAAC5D,eAAe,EAAE,CAAA;AAC3DgF,IAAAA,wBAAwB,CAACtE,GAAG,CAACkD,SAAS,EAAEjF,IAAI,CAAC,CAAA;AAC/C,GAAA;AACA,EAAA,OAAOA,IAAI,CAAA;AACb,CAAA;AAEA,IAAMuG,aAAa,GAAG,IAAI/E,GAAG,EAAE,CAAA;AAC/B,SAASgF,iBAAiBA,CAACvB,SAAS,EAAE;AACpC,EAAA,IAAIwB,IAAI,GAAGF,aAAa,CAAC/F,GAAG,CAACyE,SAAS,CAAC,CAAA;EACvC,IAAI,CAACwB,IAAI,EAAE;IACT,IAAM3F,MAAM,GAAG,IAAIK,IAAI,CAACuF,MAAM,CAACzB,SAAS,CAAC,CAAA;AACzC;AACAwB,IAAAA,IAAI,GAAG,aAAa,IAAI3F,MAAM,GAAGA,MAAM,CAAC6F,WAAW,EAAE,GAAG7F,MAAM,CAAC8F,QAAQ,CAAA;AACvE;AACA,IAAA,IAAI,EAAE,aAAa,IAAIH,IAAI,CAAC,EAAE;AAC5BA,MAAAA,IAAI,GAAAI,QAAA,CAAA,EAAA,EAAQC,oBAAoB,EAAKL,IAAI,CAAE,CAAA;AAC7C,KAAA;AACAF,IAAAA,aAAa,CAACxE,GAAG,CAACkD,SAAS,EAAEwB,IAAI,CAAC,CAAA;AACpC,GAAA;AACA,EAAA,OAAOA,IAAI,CAAA;AACb,CAAA;AAEA,SAASM,iBAAiBA,CAACC,SAAS,EAAE;AACpC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAA,IAAMC,MAAM,GAAGD,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;AACvC,EAAA,IAAID,MAAM,KAAK,CAAC,CAAC,EAAE;IACjBD,SAAS,GAAGA,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEF,MAAM,CAAC,CAAA;AAC5C,GAAA;AAEA,EAAA,IAAMG,MAAM,GAAGJ,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;AACvC,EAAA,IAAIE,MAAM,KAAK,CAAC,CAAC,EAAE;IACjB,OAAO,CAACJ,SAAS,CAAC,CAAA;AACpB,GAAC,MAAM;AACL,IAAA,IAAIK,OAAO,CAAA;AACX,IAAA,IAAIC,WAAW,CAAA;IACf,IAAI;MACFD,OAAO,GAAG/B,YAAY,CAAC0B,SAAS,CAAC,CAAC3F,eAAe,EAAE,CAAA;AACnDiG,MAAAA,WAAW,GAAGN,SAAS,CAAA;KACxB,CAAC,OAAOhD,CAAC,EAAE;MACV,IAAMuD,OAAO,GAAGP,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEC,MAAM,CAAC,CAAA;MAC9CC,OAAO,GAAG/B,YAAY,CAACiC,OAAO,CAAC,CAAClG,eAAe,EAAE,CAAA;AACjDiG,MAAAA,WAAW,GAAGC,OAAO,CAAA;AACvB,KAAA;IAEA,IAAAC,QAAA,GAAsCH,OAAO;MAArCI,eAAe,GAAAD,QAAA,CAAfC,eAAe;MAAEC,QAAQ,GAAAF,QAAA,CAARE,QAAQ,CAAA;AACjC,IAAA,OAAO,CAACJ,WAAW,EAAEG,eAAe,EAAEC,QAAQ,CAAC,CAAA;AACjD,GAAA;AACF,CAAA;AAEA,SAASC,gBAAgBA,CAACX,SAAS,EAAES,eAAe,EAAEG,cAAc,EAAE;EACpE,IAAIA,cAAc,IAAIH,eAAe,EAAE;AACrC,IAAA,IAAI,CAACT,SAAS,CAACa,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC9Bb,MAAAA,SAAS,IAAI,IAAI,CAAA;AACnB,KAAA;AAEA,IAAA,IAAIY,cAAc,EAAE;AAClBZ,MAAAA,SAAS,aAAWY,cAAgB,CAAA;AACtC,KAAA;AAEA,IAAA,IAAIH,eAAe,EAAE;AACnBT,MAAAA,SAAS,aAAWS,eAAiB,CAAA;AACvC,KAAA;AACA,IAAA,OAAOT,SAAS,CAAA;AAClB,GAAC,MAAM;AACL,IAAA,OAAOA,SAAS,CAAA;AAClB,GAAA;AACF,CAAA;AAEA,SAASc,SAASA,CAACC,CAAC,EAAE;EACpB,IAAMC,EAAE,GAAG,EAAE,CAAA;EACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,EAAE,EAAEA,CAAC,EAAE,EAAE;IAC5B,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAElF,CAAC,EAAE,CAAC,CAAC,CAAA;AACnC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;AAChB,GAAA;AACA,EAAA,OAAOD,EAAE,CAAA;AACX,CAAA;AAEA,SAASK,WAAWA,CAACN,CAAC,EAAE;EACtB,IAAMC,EAAE,GAAG,EAAE,CAAA;EACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AAC3B,IAAA,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAGlF,CAAC,CAAC,CAAA;AACzC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;AAChB,GAAA;AACA,EAAA,OAAOD,EAAE,CAAA;AACX,CAAA;AAEA,SAASM,SAASA,CAACC,GAAG,EAAErF,MAAM,EAAEsF,SAAS,EAAEC,MAAM,EAAE;AACjD,EAAA,IAAMC,IAAI,GAAGH,GAAG,CAACI,WAAW,EAAE,CAAA;EAE9B,IAAID,IAAI,KAAK,OAAO,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM,IAAIA,IAAI,KAAK,IAAI,EAAE;IACxB,OAAOF,SAAS,CAACtF,MAAM,CAAC,CAAA;AAC1B,GAAC,MAAM;IACL,OAAOuF,MAAM,CAACvF,MAAM,CAAC,CAAA;AACvB,GAAA;AACF,CAAA;AAEA,SAAS0F,mBAAmBA,CAACL,GAAG,EAAE;EAChC,IAAIA,GAAG,CAACd,eAAe,IAAIc,GAAG,CAACd,eAAe,KAAK,MAAM,EAAE;AACzD,IAAA,OAAO,KAAK,CAAA;AACd,GAAC,MAAM;AACL,IAAA,OACEc,GAAG,CAACd,eAAe,KAAK,MAAM,IAC9B,CAACc,GAAG,CAACzH,MAAM,IACXyH,GAAG,CAACzH,MAAM,CAAC+H,UAAU,CAAC,IAAI,CAAC,IAC3BvC,2BAA2B,CAACiC,GAAG,CAACzH,MAAM,CAAC,CAAC2G,eAAe,KAAK,MAAM,CAAA;AAEtE,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AAFA,IAIMqB,mBAAmB,gBAAA,YAAA;AACvB,EAAA,SAAAA,oBAAYC,IAAI,EAAEC,WAAW,EAAEhJ,IAAI,EAAE;AACnC,IAAA,IAAI,CAACiJ,KAAK,GAAGjJ,IAAI,CAACiJ,KAAK,IAAI,CAAC,CAAA;AAC5B,IAAA,IAAI,CAACC,KAAK,GAAGlJ,IAAI,CAACkJ,KAAK,IAAI,KAAK,CAAA;AAEhC,IAAuClJ,IAAI,CAAnCiJ,KAAK,CAAA;MAA0BjJ,IAAI,CAA5BkJ,KAAK,CAAA;AAAKC,UAAAA,SAAS,GAAAnD,6BAAA,CAAKhG,IAAI,EAAAoJ,UAAA,EAAA;AAE3C,IAAA,IAAI,CAACJ,WAAW,IAAIK,MAAM,CAACC,IAAI,CAACH,SAAS,CAAC,CAACjG,MAAM,GAAG,CAAC,EAAE;MACrD,IAAMqG,QAAQ,GAAA1C,QAAA,CAAA;AAAK2C,QAAAA,WAAW,EAAE,KAAA;AAAK,OAAA,EAAKxJ,IAAI,CAAE,CAAA;AAChD,MAAA,IAAIA,IAAI,CAACiJ,KAAK,GAAG,CAAC,EAAEM,QAAQ,CAACE,oBAAoB,GAAGzJ,IAAI,CAACiJ,KAAK,CAAA;MAC9D,IAAI,CAACxD,GAAG,GAAGD,YAAY,CAACuD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;AAAC,EAAA,IAAA3J,MAAA,GAAAkJ,mBAAA,CAAAjJ,SAAA,CAAA;AAAAD,EAAAA,MAAA,CAEDM,MAAM,GAAN,SAAAA,MAAAA,CAAO+C,CAAC,EAAE;IACR,IAAI,IAAI,CAACwC,GAAG,EAAE;AACZ,MAAA,IAAMiE,KAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAGA,CAAC,CAAA;AAC5C,MAAA,OAAO,IAAI,CAACwC,GAAG,CAACvF,MAAM,CAACwJ,KAAK,CAAC,CAAA;AAC/B,KAAC,MAAM;AACL;AACA,MAAA,IAAMA,MAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAG0G,OAAO,CAAC1G,CAAC,EAAE,CAAC,CAAC,CAAA;AACxD,MAAA,OAAO2G,QAAQ,CAACF,MAAK,EAAE,IAAI,CAACT,KAAK,CAAC,CAAA;AACpC,KAAA;GACD,CAAA;AAAA,EAAA,OAAAH,mBAAA,CAAA;AAAA,CAAA,EAAA,CAAA;AAGH;AACA;AACA;AAFA,IAIMe,iBAAiB,gBAAA,YAAA;AACrB,EAAA,SAAAA,kBAAY5B,EAAE,EAAEc,IAAI,EAAE/I,IAAI,EAAE;IAC1B,IAAI,CAACA,IAAI,GAAGA,IAAI,CAAA;IAChB,IAAI,CAAC8J,YAAY,GAAGlI,SAAS,CAAA;IAE7B,IAAImI,CAAC,GAAGnI,SAAS,CAAA;AACjB,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACsB,QAAQ,EAAE;AACtB;MACA,IAAI,CAAC2G,EAAE,GAAGA,EAAE,CAAA;KACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,OAAO,EAAE;AACnC;AACA;AACA;AACA;AACA;AACA;MACA,IAAM8I,SAAS,GAAG,CAAC,CAAC,IAAI/B,EAAE,CAAC9H,MAAM,GAAG,EAAE,CAAC,CAAA;MACvC,IAAM8J,OAAO,GAAGD,SAAS,IAAI,CAAC,GAAcA,UAAAA,GAAAA,SAAS,eAAeA,SAAW,CAAA;AAC/E,MAAA,IAAI/B,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIsD,QAAQ,CAACC,MAAM,CAACuG,OAAO,CAAC,CAAC/F,KAAK,EAAE;AACrD6F,QAAAA,CAAC,GAAGE,OAAO,CAAA;QACX,IAAI,CAAChC,EAAE,GAAGA,EAAE,CAAA;AACd,OAAC,MAAM;AACL;AACA;AACA8B,QAAAA,CAAC,GAAG,KAAK,CAAA;AACT,QAAA,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAAC9H,MAAM,KAAK,CAAC,GAAG8H,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;UAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;AAAO,SAAC,CAAC,CAAA;AAC/E,QAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;AAC7B,OAAA;KACD,MAAM,IAAIsE,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,QAAQ,EAAE;MACpC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;KACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;MAClC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;AACZ8B,MAAAA,CAAC,GAAG9B,EAAE,CAACtE,IAAI,CAAClD,IAAI,CAAA;AAClB,KAAC,MAAM;AACL;AACA;AACAsJ,MAAAA,CAAC,GAAG,KAAK,CAAA;MACT,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;QAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;AAAO,OAAC,CAAC,CAAA;AACxD,MAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;AAC7B,KAAA;AAEA,IAAA,IAAM4F,QAAQ,GAAA1C,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;AACjCuJ,IAAAA,QAAQ,CAACjI,QAAQ,GAAGiI,QAAQ,CAACjI,QAAQ,IAAIyI,CAAC,CAAA;IAC1C,IAAI,CAACpI,GAAG,GAAG2D,YAAY,CAACyD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;AACzC,GAAA;AAAC,EAAA,IAAAc,OAAA,GAAAR,iBAAA,CAAAhK,SAAA,CAAA;AAAAwK,EAAAA,OAAA,CAEDnK,MAAM,GAAN,SAAAA,SAAS;IACP,IAAI,IAAI,CAAC4J,YAAY,EAAE;AACrB;AACA;MACA,OAAO,IAAI,CAAC/G,aAAa,EAAE,CACxBuH,GAAG,CAAC,UAAAzJ,IAAA,EAAA;AAAA,QAAA,IAAGuC,KAAK,GAAAvC,IAAA,CAALuC,KAAK,CAAA;AAAA,QAAA,OAAOA,KAAK,CAAA;AAAA,OAAA,CAAC,CACzBmH,IAAI,CAAC,EAAE,CAAC,CAAA;AACb,KAAA;AACA,IAAA,OAAO,IAAI,CAAC5I,GAAG,CAACzB,MAAM,CAAC,IAAI,CAAC+H,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;GAC3C,CAAA;AAAAH,EAAAA,OAAA,CAEDtH,aAAa,GAAb,SAAAA,gBAAgB;AAAA,IAAA,IAAAkB,KAAA,GAAA,IAAA,CAAA;AACd,IAAA,IAAMwG,KAAK,GAAG,IAAI,CAAC9I,GAAG,CAACoB,aAAa,CAAC,IAAI,CAACkF,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;IACxD,IAAI,IAAI,CAACV,YAAY,EAAE;AACrB,MAAA,OAAOW,KAAK,CAACH,GAAG,CAAC,UAACI,IAAI,EAAK;AACzB,QAAA,IAAIA,IAAI,CAACxJ,IAAI,KAAK,cAAc,EAAE;AAChC,UAAA,IAAMpB,UAAU,GAAGmE,KAAI,CAAC6F,YAAY,CAAChK,UAAU,CAACmE,KAAI,CAACgE,EAAE,CAAClI,EAAE,EAAE;AAC1De,YAAAA,MAAM,EAAEmD,KAAI,CAACgE,EAAE,CAACnH,MAAM;AACtBZ,YAAAA,MAAM,EAAE+D,KAAI,CAACjE,IAAI,CAACrB,YAAAA;AACpB,WAAC,CAAC,CAAA;UACF,OAAAkI,QAAA,KACK6D,IAAI,EAAA;AACPtH,YAAAA,KAAK,EAAEtD,UAAAA;AAAU,WAAA,CAAA,CAAA;AAErB,SAAC,MAAM;AACL,UAAA,OAAO4K,IAAI,CAAA;AACb,SAAA;AACF,OAAC,CAAC,CAAA;AACJ,KAAA;AACA,IAAA,OAAOD,KAAK,CAAA;GACb,CAAA;AAAAJ,EAAAA,OAAA,CAEDhJ,eAAe,GAAf,SAAAA,kBAAkB;AAChB,IAAA,OAAO,IAAI,CAACM,GAAG,CAACN,eAAe,EAAE,CAAA;GAClC,CAAA;AAAA,EAAA,OAAAwI,iBAAA,CAAA;AAAA,CAAA,EAAA,CAAA;AAGH;AACA;AACA;AAFA,IAGMc,gBAAgB,gBAAA,YAAA;AACpB,EAAA,SAAAA,iBAAY5B,IAAI,EAAE6B,SAAS,EAAE5K,IAAI,EAAE;IACjC,IAAI,CAACA,IAAI,GAAA6G,QAAA,CAAA;AAAKgE,MAAAA,KAAK,EAAE,MAAA;AAAM,KAAA,EAAK7K,IAAI,CAAE,CAAA;AACtC,IAAA,IAAI,CAAC4K,SAAS,IAAIE,WAAW,EAAE,EAAE;MAC/B,IAAI,CAACC,GAAG,GAAGnF,YAAY,CAACmD,IAAI,EAAE/I,IAAI,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;AAAC,EAAA,IAAAgL,OAAA,GAAAL,gBAAA,CAAA9K,SAAA,CAAA;EAAAmL,OAAA,CAED9K,MAAM,GAAN,SAAAA,OAAO+K,KAAK,EAAE7N,IAAI,EAAE;IAClB,IAAI,IAAI,CAAC2N,GAAG,EAAE;MACZ,OAAO,IAAI,CAACA,GAAG,CAAC7K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;AACrC,KAAC,MAAM;MACL,OAAO8N,kBAA0B,CAAC9N,IAAI,EAAE6N,KAAK,EAAE,IAAI,CAACjL,IAAI,CAACmL,OAAO,EAAE,IAAI,CAACnL,IAAI,CAAC6K,KAAK,KAAK,MAAM,CAAC,CAAA;AAC/F,KAAA;GACD,CAAA;EAAAG,OAAA,CAEDjI,aAAa,GAAb,SAAAA,cAAckI,KAAK,EAAE7N,IAAI,EAAE;IACzB,IAAI,IAAI,CAAC2N,GAAG,EAAE;MACZ,OAAO,IAAI,CAACA,GAAG,CAAChI,aAAa,CAACkI,KAAK,EAAE7N,IAAI,CAAC,CAAA;AAC5C,KAAC,MAAM;AACL,MAAA,OAAO,EAAE,CAAA;AACX,KAAA;GACD,CAAA;AAAA,EAAA,OAAAuN,gBAAA,CAAA;AAAA,CAAA,EAAA,CAAA;AAGH,IAAM7D,oBAAoB,GAAG;AAC3BsE,EAAAA,QAAQ,EAAE,CAAC;AACXC,EAAAA,WAAW,EAAE,CAAC;AACdC,EAAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;AAChB,CAAC,CAAA;;AAED;AACA;AACA;AAFA,IAGqB5E,MAAM,gBAAA,YAAA;AAAAA,EAAAA,MAAA,CAClB6E,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvL,IAAI,EAAE;IACpB,OAAO0G,MAAM,CAAChD,MAAM,CAClB1D,IAAI,CAACc,MAAM,EACXd,IAAI,CAACyH,eAAe,EACpBzH,IAAI,CAAC4H,cAAc,EACnB5H,IAAI,CAACwL,YAAY,EACjBxL,IAAI,CAACyL,WACP,CAAC,CAAA;GACF,CAAA;AAAA/E,EAAAA,MAAA,CAEMhD,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,EAAEC,WAAW,EAAU;AAAA,IAAA,IAArBA,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,MAAAA,WAAW,GAAG,KAAK,CAAA;AAAA,KAAA;AACtF,IAAA,IAAMC,eAAe,GAAG5K,MAAM,IAAI6K,QAAQ,CAACC,aAAa,CAAA;AACxD;IACA,IAAMC,OAAO,GAAGH,eAAe,KAAKD,WAAW,GAAG,OAAO,GAAGrF,YAAY,EAAE,CAAC,CAAA;AAC3E,IAAA,IAAM0F,gBAAgB,GAAGrE,eAAe,IAAIkE,QAAQ,CAACI,sBAAsB,CAAA;AAC3E,IAAA,IAAMC,eAAe,GAAGpE,cAAc,IAAI+D,QAAQ,CAACM,qBAAqB,CAAA;IACxE,IAAMC,aAAa,GAAGC,oBAAoB,CAACX,YAAY,CAAC,IAAIG,QAAQ,CAACS,mBAAmB,CAAA;AACxF,IAAA,OAAO,IAAI1F,MAAM,CAACmF,OAAO,EAAEC,gBAAgB,EAAEE,eAAe,EAAEE,aAAa,EAAER,eAAe,CAAC,CAAA;GAC9F,CAAA;AAAAhF,EAAAA,MAAA,CAEM9C,UAAU,GAAjB,SAAAA,aAAoB;AAClBuC,IAAAA,cAAc,GAAG,IAAI,CAAA;IACrBd,WAAW,CAACxB,KAAK,EAAE,CAAA;IACnB0B,YAAY,CAAC1B,KAAK,EAAE,CAAA;IACpB8B,YAAY,CAAC9B,KAAK,EAAE,CAAA;IACpBwC,wBAAwB,CAACxC,KAAK,EAAE,CAAA;IAChC0C,aAAa,CAAC1C,KAAK,EAAE,CAAA;GACtB,CAAA;AAAA6C,EAAAA,MAAA,CAEM2F,UAAU,GAAjB,SAAAA,UAAAA,CAAAC,KAAA,EAAkF;AAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;MAA5DxL,MAAM,GAAAuD,KAAA,CAANvD,MAAM;MAAE2G,eAAe,GAAApD,KAAA,CAAfoD,eAAe;MAAEG,cAAc,GAAAvD,KAAA,CAAduD,cAAc;MAAE4D,YAAY,GAAAnH,KAAA,CAAZmH,YAAY,CAAA;IACvE,OAAO9E,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,CAAC,CAAA;GAC5E,CAAA;EAED,SAAA9E,MAAAA,CAAY5F,MAAM,EAAEyL,SAAS,EAAE3E,cAAc,EAAE4D,YAAY,EAAEE,eAAe,EAAE;AAC5E,IAAA,IAAAc,kBAAA,GAAoEzF,iBAAiB,CAACjG,MAAM,CAAC;AAAtF2L,MAAAA,YAAY,GAAAD,kBAAA,CAAA,CAAA,CAAA;AAAEE,MAAAA,qBAAqB,GAAAF,kBAAA,CAAA,CAAA,CAAA;AAAEG,MAAAA,oBAAoB,GAAAH,kBAAA,CAAA,CAAA,CAAA,CAAA;IAEhE,IAAI,CAAC1L,MAAM,GAAG2L,YAAY,CAAA;AAC1B,IAAA,IAAI,CAAChF,eAAe,GAAG8E,SAAS,IAAIG,qBAAqB,IAAI,IAAI,CAAA;AACjE,IAAA,IAAI,CAAC9E,cAAc,GAAGA,cAAc,IAAI+E,oBAAoB,IAAI,IAAI,CAAA;IACpE,IAAI,CAACnB,YAAY,GAAGA,YAAY,CAAA;AAChC,IAAA,IAAI,CAACzC,IAAI,GAAGpB,gBAAgB,CAAC,IAAI,CAAC7G,MAAM,EAAE,IAAI,CAAC2G,eAAe,EAAE,IAAI,CAACG,cAAc,CAAC,CAAA;IAEpF,IAAI,CAACgF,aAAa,GAAG;MAAE1M,MAAM,EAAE,EAAE;AAAE2M,MAAAA,UAAU,EAAE,EAAC;KAAG,CAAA;IACnD,IAAI,CAACC,WAAW,GAAG;MAAE5M,MAAM,EAAE,EAAE;AAAE2M,MAAAA,UAAU,EAAE,EAAC;KAAG,CAAA;IACjD,IAAI,CAACE,aAAa,GAAG,IAAI,CAAA;AACzB,IAAA,IAAI,CAACC,QAAQ,GAAG,EAAE,CAAA;IAElB,IAAI,CAACtB,eAAe,GAAGA,eAAe,CAAA;IACtC,IAAI,CAACuB,iBAAiB,GAAG,IAAI,CAAA;AAC/B,GAAA;AAAC,EAAA,IAAAC,OAAA,GAAAxG,MAAA,CAAA7G,SAAA,CAAA;AAAAqN,EAAAA,OAAA,CAUDvE,WAAW,GAAX,SAAAA,cAAc;AACZ,IAAA,IAAMwE,YAAY,GAAG,IAAI,CAACvC,SAAS,EAAE,CAAA;IACrC,IAAMwC,cAAc,GAClB,CAAC,IAAI,CAAC3F,eAAe,KAAK,IAAI,IAAI,IAAI,CAACA,eAAe,KAAK,MAAM,MAChE,IAAI,CAACG,cAAc,KAAK,IAAI,IAAI,IAAI,CAACA,cAAc,KAAK,SAAS,CAAC,CAAA;AACrE,IAAA,OAAOuF,YAAY,IAAIC,cAAc,GAAG,IAAI,GAAG,MAAM,CAAA;GACtD,CAAA;AAAAF,EAAAA,OAAA,CAEDG,KAAK,GAAL,SAAAA,KAAAA,CAAMC,IAAI,EAAE;AACV,IAAA,IAAI,CAACA,IAAI,IAAIjE,MAAM,CAACkE,mBAAmB,CAACD,IAAI,CAAC,CAACpK,MAAM,KAAK,CAAC,EAAE;AAC1D,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM;MACL,OAAOwD,MAAM,CAAChD,MAAM,CAClB4J,IAAI,CAACxM,MAAM,IAAI,IAAI,CAAC4K,eAAe,EACnC4B,IAAI,CAAC7F,eAAe,IAAI,IAAI,CAACA,eAAe,EAC5C6F,IAAI,CAAC1F,cAAc,IAAI,IAAI,CAACA,cAAc,EAC1CuE,oBAAoB,CAACmB,IAAI,CAAC9B,YAAY,CAAC,IAAI,IAAI,CAACA,YAAY,EAC5D8B,IAAI,CAAC7B,WAAW,IAAI,KACtB,CAAC,CAAA;AACH,KAAA;GACD,CAAA;AAAAyB,EAAAA,OAAA,CAEDM,aAAa,GAAb,SAAAA,aAAAA,CAAcF,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACrB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;AAAE7B,MAAAA,WAAW,EAAE,IAAA;AAAI,KAAA,CAAE,CAAC,CAAA;GAClD,CAAA;AAAAyB,EAAAA,OAAA,CAEDO,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBH,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACzB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;AAAE7B,MAAAA,WAAW,EAAE,KAAA;AAAK,KAAA,CAAE,CAAC,CAAA;GACnD,CAAA;EAAAyB,OAAA,CAEDQ,MAAM,GAAN,SAAAA,SAAOxK,MAAM,EAAEhD,MAAM,EAAU;AAAA,IAAA,IAAAyN,MAAA,GAAA,IAAA,CAAA;AAAA,IAAA,IAAhBzN,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;AAAA,KAAA;IAC3B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,MAAc,EAAE,YAAM;AACnD;AACA;AACA;AACA,MAAA,IAAM0C,gBAAgB,GAAGD,MAAI,CAAC5E,IAAI,KAAK,IAAI,IAAI4E,MAAI,CAAC5E,IAAI,CAACF,UAAU,CAAC,KAAK,CAAC,CAAA;MAC1E3I,MAAM,IAAI,CAAC0N,gBAAgB,CAAA;MAC3B,IAAM7E,IAAI,GAAG7I,MAAM,GAAG;AAAEpC,UAAAA,KAAK,EAAEoF,MAAM;AAAEnF,UAAAA,GAAG,EAAE,SAAA;AAAU,SAAC,GAAG;AAAED,UAAAA,KAAK,EAAEoF,MAAAA;SAAQ;AACzE2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;MAC9C,IAAI,CAACyN,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;AACxC,QAAA,IAAM4K,MAAM,GAAG,CAACF,gBAAgB,GAC5B,UAAC3F,EAAE,EAAA;UAAA,OAAK0F,MAAI,CAACI,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,OAAO,CAAC,CAAA;AAAA,SAAA,GACvC,UAACd,EAAE,EAAA;UAAA,OAAK0F,MAAI,CAACK,WAAW,CAAC/F,EAAE,EAAEc,IAAI,CAAC,CAAC7I,MAAM,EAAE,CAAA;AAAA,SAAA,CAAA;AAC/CyN,QAAAA,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAG4E,SAAS,CAACgG,MAAM,CAAC,CAAA;AACzD,OAAA;MACA,OAAOH,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;AAC5C,KAAC,CAAC,CAAA;GACH,CAAA;EAAAgK,OAAA,CAEDe,QAAQ,GAAR,SAAAA,WAAS/K,MAAM,EAAEhD,MAAM,EAAU;AAAA,IAAA,IAAAgO,MAAA,GAAA,IAAA,CAAA;AAAA,IAAA,IAAhBhO,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;AAAA,KAAA;IAC7B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,QAAgB,EAAE,YAAM;MACrD,IAAMnC,IAAI,GAAG7I,MAAM,GACb;AAAEhC,UAAAA,OAAO,EAAEgF,MAAM;AAAErF,UAAAA,IAAI,EAAE,SAAS;AAAEC,UAAAA,KAAK,EAAE,MAAM;AAAEC,UAAAA,GAAG,EAAE,SAAA;AAAU,SAAC,GACnE;AAAEG,UAAAA,OAAO,EAAEgF,MAAAA;SAAQ;AACvB2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;MAC9C,IAAI,CAACgO,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;AAC1CgL,QAAAA,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAGmF,WAAW,CAAC,UAACJ,EAAE,EAAA;UAAA,OACrDiG,MAAI,CAACH,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,SAAS,CAAC,CAAA;AAAA,SACnC,CAAC,CAAA;AACH,OAAA;MACA,OAAOmF,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;AAC9C,KAAC,CAAC,CAAA;GACH,CAAA;AAAAgK,EAAAA,OAAA,CAEDiB,SAAS,GAAT,SAAAA,cAAY;AAAA,IAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;AACV,IAAA,OAAO9F,SAAS,CACd,IAAI,EACJ1G,SAAS,EACT,YAAA;MAAA,OAAMsJ,SAAiB,CAAA;AAAA,KAAA,EACvB,YAAM;AACJ;AACA;AACA,MAAA,IAAI,CAACkD,MAAI,CAACrB,aAAa,EAAE;AACvB,QAAA,IAAMhE,IAAI,GAAG;AAAEzK,UAAAA,IAAI,EAAE,SAAS;AAAEQ,UAAAA,SAAS,EAAE,KAAA;SAAO,CAAA;AAClDsP,QAAAA,MAAI,CAACrB,aAAa,GAAG,CAAC7E,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAACmC,GAAG,CACtF,UAACrC,EAAE,EAAA;UAAA,OAAKmG,MAAI,CAACL,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,WAAW,CAAC,CAAA;AAAA,SAC7C,CAAC,CAAA;AACH,OAAA;MAEA,OAAOqF,MAAI,CAACrB,aAAa,CAAA;AAC3B,KACF,CAAC,CAAA;GACF,CAAA;AAAAG,EAAAA,OAAA,CAEDmB,IAAI,GAAJ,SAAAA,MAAAA,CAAKnL,MAAM,EAAE;AAAA,IAAA,IAAAoL,MAAA,GAAA,IAAA,CAAA;IACX,OAAOhG,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,IAAY,EAAE,YAAM;AACjD,MAAA,IAAMnC,IAAI,GAAG;AAAEjH,QAAAA,GAAG,EAAEoB,MAAAA;OAAQ,CAAA;;AAE5B;AACA;AACA,MAAA,IAAI,CAACoL,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,EAAE;AAC1BoL,QAAAA,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,GAAG,CAACgF,QAAQ,CAACC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAACmC,GAAG,CAAC,UAACrC,EAAE,EAAA;UAAA,OACjFqG,MAAI,CAACP,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,KAAK,CAAC,CAAA;AAAA,SAC/B,CAAC,CAAA;AACH,OAAA;AAEA,MAAA,OAAOuF,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,CAAA;AAC9B,KAAC,CAAC,CAAA;GACH,CAAA;EAAAgK,OAAA,CAEDa,OAAO,GAAP,SAAAA,OAAAA,CAAQ9F,EAAE,EAAEsB,QAAQ,EAAEgF,KAAK,EAAE;IAC3B,IAAMC,EAAE,GAAG,IAAI,CAACR,WAAW,CAAC/F,EAAE,EAAEsB,QAAQ,CAAC;AACvCkF,MAAAA,OAAO,GAAGD,EAAE,CAACzL,aAAa,EAAE;AAC5B2L,MAAAA,QAAQ,GAAGD,OAAO,CAACE,IAAI,CAAC,UAACC,CAAC,EAAA;QAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAKN,KAAK,CAAA;OAAC,CAAA,CAAA;AAChE,IAAA,OAAOG,QAAQ,GAAGA,QAAQ,CAACtL,KAAK,GAAG,IAAI,CAAA;GACxC,CAAA;AAAA8J,EAAAA,OAAA,CAED4B,eAAe,GAAf,SAAAA,eAAAA,CAAgB9O,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACvB;AACA;AACA,IAAA,OAAO,IAAI8I,mBAAmB,CAAC,IAAI,CAACC,IAAI,EAAE/I,IAAI,CAACgJ,WAAW,IAAI,IAAI,CAAC+F,WAAW,EAAE/O,IAAI,CAAC,CAAA;GACtF,CAAA;EAAAkN,OAAA,CAEDc,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEsB,QAAQ,EAAO;AAAA,IAAA,IAAfA,QAAQ,KAAA,KAAA,CAAA,EAAA;MAARA,QAAQ,GAAG,EAAE,CAAA;AAAA,KAAA;IAC3B,OAAO,IAAIM,iBAAiB,CAAC5B,EAAE,EAAE,IAAI,CAACc,IAAI,EAAEQ,QAAQ,CAAC,CAAA;GACtD,CAAA;AAAA2D,EAAAA,OAAA,CAED8B,YAAY,GAAZ,SAAAA,YAAAA,CAAahP,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACpB,IAAA,OAAO,IAAI2K,gBAAgB,CAAC,IAAI,CAAC5B,IAAI,EAAE,IAAI,CAAC6B,SAAS,EAAE,EAAE5K,IAAI,CAAC,CAAA;GAC/D,CAAA;AAAAkN,EAAAA,OAAA,CAED+B,aAAa,GAAb,SAAAA,aAAAA,CAAcjP,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACrB,IAAA,OAAOgF,WAAW,CAAC,IAAI,CAAC+D,IAAI,EAAE/I,IAAI,CAAC,CAAA;GACpC,CAAA;AAAAkN,EAAAA,OAAA,CAEDtC,SAAS,GAAT,SAAAA,YAAY;AACV,IAAA,OACE,IAAI,CAAC9J,MAAM,KAAK,IAAI,IACpB,IAAI,CAACA,MAAM,CAAC+N,WAAW,EAAE,KAAK,OAAO,IACrCvI,2BAA2B,CAAC,IAAI,CAACyC,IAAI,CAAC,CAACjI,MAAM,CAAC+H,UAAU,CAAC,OAAO,CAAC,CAAA;GAEpE,CAAA;AAAAqE,EAAAA,OAAA,CAEDgC,eAAe,GAAf,SAAAA,kBAAkB;IAChB,IAAI,IAAI,CAAC1D,YAAY,EAAE;MACrB,OAAO,IAAI,CAACA,YAAY,CAAA;AAC1B,KAAC,MAAM,IAAI,CAAC2D,iBAAiB,EAAE,EAAE;AAC/B,MAAA,OAAOrI,oBAAoB,CAAA;AAC7B,KAAC,MAAM;AACL,MAAA,OAAON,iBAAiB,CAAC,IAAI,CAAC1F,MAAM,CAAC,CAAA;AACvC,KAAA;GACD,CAAA;AAAAoM,EAAAA,OAAA,CAEDkC,cAAc,GAAd,SAAAA,iBAAiB;AACf,IAAA,OAAO,IAAI,CAACF,eAAe,EAAE,CAAC9D,QAAQ,CAAA;GACvC,CAAA;AAAA8B,EAAAA,OAAA,CAEDmC,qBAAqB,GAArB,SAAAA,wBAAwB;AACtB,IAAA,OAAO,IAAI,CAACH,eAAe,EAAE,CAAC7D,WAAW,CAAA;GAC1C,CAAA;AAAA6B,EAAAA,OAAA,CAEDoC,cAAc,GAAd,SAAAA,iBAAiB;AACf,IAAA,OAAO,IAAI,CAACJ,eAAe,EAAE,CAAC5D,OAAO,CAAA;GACtC,CAAA;AAAA4B,EAAAA,OAAA,CAED9M,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;IACZ,OACE,IAAI,CAACzO,MAAM,KAAKyO,KAAK,CAACzO,MAAM,IAC5B,IAAI,CAAC2G,eAAe,KAAK8H,KAAK,CAAC9H,eAAe,IAC9C,IAAI,CAACG,cAAc,KAAK2H,KAAK,CAAC3H,cAAc,CAAA;GAE/C,CAAA;AAAAsF,EAAAA,OAAA,CAEDsC,QAAQ,GAAR,SAAAA,WAAW;IACT,OAAiB,SAAA,GAAA,IAAI,CAAC1O,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC2G,eAAe,GAAA,IAAA,GAAK,IAAI,CAACG,cAAc,GAAA,GAAA,CAAA;GAC9E,CAAA;AAAAtH,EAAAA,YAAA,CAAAoG,MAAA,EAAA,CAAA;IAAAnG,GAAA,EAAA,aAAA;IAAAC,GAAA,EA7KD,SAAAA,GAAAA,GAAkB;AAChB,MAAA,IAAI,IAAI,CAACyM,iBAAiB,IAAI,IAAI,EAAE;AAClC,QAAA,IAAI,CAACA,iBAAiB,GAAGrE,mBAAmB,CAAC,IAAI,CAAC,CAAA;AACpD,OAAA;MAEA,OAAO,IAAI,CAACqE,iBAAiB,CAAA;AAC/B,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAvG,MAAA,CAAA;AAAA,CAAA,EAAA;;AC7YH,IAAIhG,SAAS,GAAG,IAAI,CAAA;;AAEpB;AACA;AACA;AACA;AACqB+O,IAAAA,eAAe,0BAAA7O,KAAA,EAAA;EAAA1E,cAAA,CAAAuT,eAAA,EAAA7O,KAAA,CAAA,CAAA;AAYlC;AACF;AACA;AACA;AACA;AAJE6O,EAAAA,eAAA,CAKOC,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvP,MAAM,EAAE;AACtB,IAAA,OAAOA,MAAM,KAAK,CAAC,GAAGsP,eAAe,CAACE,WAAW,GAAG,IAAIF,eAAe,CAACtP,MAAM,CAAC,CAAA;AACjF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAAsP,EAAAA,eAAA,CAQOG,cAAc,GAArB,SAAAA,cAAAA,CAAsBlS,CAAC,EAAE;AACvB,IAAA,IAAIA,CAAC,EAAE;AACL,MAAA,IAAMmS,CAAC,GAAGnS,CAAC,CAACoS,KAAK,CAAC,uCAAuC,CAAC,CAAA;AAC1D,MAAA,IAAID,CAAC,EAAE;AACL,QAAA,OAAO,IAAIJ,eAAe,CAACM,YAAY,CAACF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,OAAA;AACF,KAAA;AACA,IAAA,OAAO,IAAI,CAAA;GACZ,CAAA;EAED,SAAAJ,eAAAA,CAAYtP,MAAM,EAAE;AAAA,IAAA,IAAA8D,KAAA,CAAA;AAClBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;AACP;IACAuH,KAAA,CAAKyF,KAAK,GAAGvJ,MAAM,CAAA;AAAC,IAAA,OAAA8D,KAAA,CAAA;AACtB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,EAAA,IAAArE,MAAA,GAAA6P,eAAA,CAAA5P,SAAA,CAAA;AAiCA;AACF;AACA;AACA;AACA;AACA;AALED,EAAAA,MAAA,CAMAE,UAAU,GAAV,SAAAA,aAAa;IACX,OAAO,IAAI,CAACW,IAAI,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;AACvB,IAAA,OAAOD,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAExJ,MAAM,CAAC,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAUA;AACF;AACA;AACA;AACA;AACA;AACA;AANEN,EAAAA,MAAA,CAOAO,MAAM,GAAN,SAAAA,SAAS;IACP,OAAO,IAAI,CAACuJ,KAAK,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA9J,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,OAAO,IAAIb,SAAS,CAACqJ,KAAK,KAAK,IAAI,CAACA,KAAK,CAAA;AACrE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAApJ,EAAAA,YAAA,CAAAmP,eAAA,EAAA,CAAA;IAAAlP,GAAA,EAAA,MAAA;IAAAC,GAAA,EAjFA,SAAAA,GAAAA,GAAW;AACT,MAAA,OAAO,OAAO,CAAA;AAChB,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAD,GAAA,EAAA,MAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAW;AACT,MAAA,OAAO,IAAI,CAACkJ,KAAK,KAAK,CAAC,GAAG,KAAK,GAASzJ,KAAAA,GAAAA,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAG,CAAA;AAC9E,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAnJ,GAAA,EAAA,UAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;AACb,MAAA,IAAI,IAAI,CAACkJ,KAAK,KAAK,CAAC,EAAE;AACpB,QAAA,OAAO,SAAS,CAAA;AAClB,OAAC,MAAM;QACL,OAAiBzJ,SAAAA,GAAAA,YAAY,CAAC,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAC,CAAA;AACtD,OAAA;AACF,KAAA;AAAC,GAAA,EAAA;IAAAnJ,GAAA,EAAA,aAAA;IAAAC,GAAA,EA8BD,SAAAA,GAAAA,GAAkB;AAChB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAAC,GAAA,EAAA;IAAAD,GAAA,EAAA,SAAA;IAAAC,GAAA,EA6BD,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAAC,GAAA,CAAA,EAAA,CAAA;IAAAD,GAAA,EAAA,aAAA;IAAAC,GAAA;AA1ID;AACF;AACA;AACA;AACE,IAAA,SAAAA,MAAyB;MACvB,IAAIE,SAAS,KAAK,IAAI,EAAE;AACtBA,QAAAA,SAAS,GAAG,IAAI+O,eAAe,CAAC,CAAC,CAAC,CAAA;AACpC,OAAA;AACA,MAAA,OAAO/O,SAAS,CAAA;AAClB,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAA+O,eAAA,CAAA;AAAA,CAAA,CAV0C9P,IAAI;;ACPjD;AACA;AACA;AACA;AACqBqQ,IAAAA,WAAW,0BAAApP,KAAA,EAAA;EAAA1E,cAAA,CAAA8T,WAAA,EAAApP,KAAA,CAAA,CAAA;EAC9B,SAAAoP,WAAAA,CAAYtO,QAAQ,EAAE;AAAA,IAAA,IAAAuC,KAAA,CAAA;AACpBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;AACP;IACAuH,KAAA,CAAKvC,QAAQ,GAAGA,QAAQ,CAAA;AAAC,IAAA,OAAAuC,KAAA,CAAA;AAC3B,GAAA;;AAEA;AAAA,EAAA,IAAArE,MAAA,GAAAoQ,WAAA,CAAAnQ,SAAA,CAAA;AAeA;AAAAD,EAAAA,MAAA,CACAE,UAAU,GAAV,SAAAA,aAAa;AACX,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;;AAEA,oBAAA;AAAAF,EAAAA,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAe;AACb,IAAA,OAAO,EAAE,CAAA;AACX,GAAA;;AAEA,oBAAA;AAAAL,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,OAAOgE,GAAG,CAAA;AACZ,GAAA;;AAEA,oBAAA;AAAAvE,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA,oBAAA;AAAAE,EAAAA,YAAA,CAAA0P,WAAA,EAAA,CAAA;IAAAzP,GAAA,EAAA,MAAA;IAAAC,GAAA,EAlCA,SAAAA,GAAAA,GAAW;AACT,MAAA,OAAO,SAAS,CAAA;AAClB,KAAA;;AAEA;AAAA,GAAA,EAAA;IAAAD,GAAA,EAAA,MAAA;IAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;AACtB,KAAA;;AAEA;AAAA,GAAA,EAAA;IAAAnB,GAAA,EAAA,aAAA;IAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;AAChB,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAAC,GAAA,EAAA;IAAAD,GAAA,EAAA,SAAA;IAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAwP,WAAA,CAAA;AAAA,CAAA,CA7CsCrQ,IAAI;;ACN7C;AACA;AACA;AAUO,SAASsQ,aAAaA,CAACC,KAAK,EAAEC,WAAW,EAAE;EAEhD,IAAI7M,WAAW,CAAC4M,KAAK,CAAC,IAAIA,KAAK,KAAK,IAAI,EAAE;AACxC,IAAA,OAAOC,WAAW,CAAA;AACpB,GAAC,MAAM,IAAID,KAAK,YAAYvQ,IAAI,EAAE;AAChC,IAAA,OAAOuQ,KAAK,CAAA;AACd,GAAC,MAAM,IAAIE,QAAQ,CAACF,KAAK,CAAC,EAAE;AAC1B,IAAA,IAAMG,OAAO,GAAGH,KAAK,CAACrB,WAAW,EAAE,CAAA;IACnC,IAAIwB,OAAO,KAAK,SAAS,EAAE,OAAOF,WAAW,CAAC,KACzC,IAAIE,OAAO,KAAK,OAAO,IAAIA,OAAO,KAAK,QAAQ,EAAE,OAAO1P,UAAU,CAAC+O,QAAQ,CAAC,KAC5E,IAAIW,OAAO,KAAK,KAAK,IAAIA,OAAO,KAAK,KAAK,EAAE,OAAOZ,eAAe,CAACE,WAAW,CAAC,KAC/E,OAAOF,eAAe,CAACG,cAAc,CAACS,OAAO,CAAC,IAAI5M,QAAQ,CAACC,MAAM,CAACwM,KAAK,CAAC,CAAA;AAC/E,GAAC,MAAM,IAAII,QAAQ,CAACJ,KAAK,CAAC,EAAE;AAC1B,IAAA,OAAOT,eAAe,CAACC,QAAQ,CAACQ,KAAK,CAAC,CAAA;AACxC,GAAC,MAAM,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAIA,KAAK,IAAI,OAAOA,KAAK,CAAC/P,MAAM,KAAK,UAAU,EAAE;AAC/F;AACA;AACA,IAAA,OAAO+P,KAAK,CAAA;AACd,GAAC,MAAM;AACL,IAAA,OAAO,IAAIF,WAAW,CAACE,KAAK,CAAC,CAAA;AAC/B,GAAA;AACF;;ACjCA,IAAMK,gBAAgB,GAAG;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,iBAAiB;AAC1BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,QAAQ,EAAE,iBAAiB;AAC3BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,uBAAuB;AAChCC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,iBAAiB;AAC1BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,KAAA;AACR,CAAC,CAAA;AAED,IAAMC,qBAAqB,GAAG;AAC5BrB,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;AACxBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBE,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAA;AACnB,CAAC,CAAA;AAED,IAAMG,YAAY,GAAGvB,gBAAgB,CAACQ,OAAO,CAAC3O,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC2P,KAAK,CAAC,EAAE,CAAC,CAAA;AAExE,SAASC,WAAWA,CAACC,GAAG,EAAE;AAC/B,EAAA,IAAI7O,KAAK,GAAGG,QAAQ,CAAC0O,GAAG,EAAE,EAAE,CAAC,CAAA;AAC7B,EAAA,IAAI7N,KAAK,CAAChB,KAAK,CAAC,EAAE;AAChBA,IAAAA,KAAK,GAAG,EAAE,CAAA;AACV,IAAA,KAAK,IAAIH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgP,GAAG,CAAC/O,MAAM,EAAED,CAAC,EAAE,EAAE;AACnC,MAAA,IAAMiP,IAAI,GAAGD,GAAG,CAACE,UAAU,CAAClP,CAAC,CAAC,CAAA;AAE9B,MAAA,IAAIgP,GAAG,CAAChP,CAAC,CAAC,CAACmP,MAAM,CAAC7B,gBAAgB,CAACQ,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;QAClD3N,KAAK,IAAI0O,YAAY,CAAC5K,OAAO,CAAC+K,GAAG,CAAChP,CAAC,CAAC,CAAC,CAAA;AACvC,OAAC,MAAM;AACL,QAAA,KAAK,IAAM1C,GAAG,IAAIsR,qBAAqB,EAAE;AACvC,UAAA,IAAAQ,oBAAA,GAAmBR,qBAAqB,CAACtR,GAAG,CAAC;AAAtC+R,YAAAA,GAAG,GAAAD,oBAAA,CAAA,CAAA,CAAA;AAAEE,YAAAA,GAAG,GAAAF,oBAAA,CAAA,CAAA,CAAA,CAAA;AACf,UAAA,IAAIH,IAAI,IAAII,GAAG,IAAIJ,IAAI,IAAIK,GAAG,EAAE;YAC9BnP,KAAK,IAAI8O,IAAI,GAAGI,GAAG,CAAA;AACrB,WAAA;AACF,SAAA;AACF,OAAA;AACF,KAAA;AACA,IAAA,OAAO/O,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;AAC5B,GAAC,MAAM;AACL,IAAA,OAAOA,KAAK,CAAA;AACd,GAAA;AACF,CAAA;;AAEA;AACA,IAAMoP,eAAe,GAAG,IAAIhR,GAAG,EAAE,CAAA;AAC1B,SAASiR,oBAAoBA,GAAG;EACrCD,eAAe,CAAC3O,KAAK,EAAE,CAAA;AACzB,CAAA;AAEO,SAAS6O,UAAUA,CAAA7R,IAAA,EAAsB8R,MAAM,EAAO;AAAA,EAAA,IAAhClL,eAAe,GAAA5G,IAAA,CAAf4G,eAAe,CAAA;AAAA,EAAA,IAAIkL,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,IAAAA,MAAM,GAAG,EAAE,CAAA;AAAA,GAAA;AACzD,EAAA,IAAMC,EAAE,GAAGnL,eAAe,IAAI,MAAM,CAAA;AAEpC,EAAA,IAAIoL,WAAW,GAAGL,eAAe,CAAChS,GAAG,CAACoS,EAAE,CAAC,CAAA;EACzC,IAAIC,WAAW,KAAKjR,SAAS,EAAE;AAC7BiR,IAAAA,WAAW,GAAG,IAAIrR,GAAG,EAAE,CAAA;AACvBgR,IAAAA,eAAe,CAACzQ,GAAG,CAAC6Q,EAAE,EAAEC,WAAW,CAAC,CAAA;AACtC,GAAA;AACA,EAAA,IAAIC,KAAK,GAAGD,WAAW,CAACrS,GAAG,CAACmS,MAAM,CAAC,CAAA;EACnC,IAAIG,KAAK,KAAKlR,SAAS,EAAE;IACvBkR,KAAK,GAAG,IAAIC,MAAM,CAAIxC,EAAAA,GAAAA,gBAAgB,CAACqC,EAAE,CAAC,GAAGD,MAAQ,CAAC,CAAA;AACtDE,IAAAA,WAAW,CAAC9Q,GAAG,CAAC4Q,MAAM,EAAEG,KAAK,CAAC,CAAA;AAChC,GAAA;AAEA,EAAA,OAAOA,KAAK,CAAA;AACd;;ACpFA,IAAIE,GAAG,GAAG,SAAAA,GAAA,GAAA;AAAA,IAAA,OAAMhS,IAAI,CAACgS,GAAG,EAAE,CAAA;AAAA,GAAA;AACxB7C,EAAAA,WAAW,GAAG,QAAQ;AACtBvE,EAAAA,aAAa,GAAG,IAAI;AACpBG,EAAAA,sBAAsB,GAAG,IAAI;AAC7BE,EAAAA,qBAAqB,GAAG,IAAI;AAC5BgH,EAAAA,kBAAkB,GAAG,EAAE;EACvBC,cAAc;AACd9G,EAAAA,mBAAmB,GAAG,IAAI,CAAA;;AAE5B;AACA;AACA;AAFA,IAGqBT,QAAQ,gBAAA,YAAA;AAAA,EAAA,SAAAA,QAAA,GAAA,EAAA;AAoJ3B;AACF;AACA;AACA;AAHEA,EAAAA,QAAA,CAIOwH,WAAW,GAAlB,SAAAA,cAAqB;IACnBzM,MAAM,CAAC9C,UAAU,EAAE,CAAA;IACnBH,QAAQ,CAACG,UAAU,EAAE,CAAA;IACrBsE,QAAQ,CAACtE,UAAU,EAAE,CAAA;AACrB6O,IAAAA,oBAAoB,EAAE,CAAA;GACvB,CAAA;AAAAnS,EAAAA,YAAA,CAAAqL,QAAA,EAAA,IAAA,EAAA,CAAA;IAAApL,GAAA,EAAA,KAAA;IAAAC,GAAA;AA5JD;AACF;AACA;AACA;AACE,IAAA,SAAAA,MAAiB;AACf,MAAA,OAAOwS,GAAG,CAAA;AACZ,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AANEjR,IAAAA,GAAA,EAOA,SAAAA,GAAetE,CAAAA,CAAC,EAAE;AAChBuV,MAAAA,GAAG,GAAGvV,CAAC,CAAA;AACT,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA8C,GAAA,EAAA,aAAA;IAAAC,GAAA;AASA;AACF;AACA;AACA;AACA;AACE,IAAA,SAAAA,MAAyB;AACvB,MAAA,OAAOyP,aAAa,CAACE,WAAW,EAAExP,UAAU,CAAC+O,QAAQ,CAAC,CAAA;AACxD,KAAA;;AAEA;AACF;AACA;AACA;AAHE3N,IAAAA,GAAA,EAbA,SAAAA,GAAuB4B,CAAAA,IAAI,EAAE;AAC3BwM,MAAAA,WAAW,GAAGxM,IAAI,CAAA;AACpB,KAAA;AAAC,GAAA,EAAA;IAAApD,GAAA,EAAA,eAAA;IAAAC,GAAA,EAeD,SAAAA,GAAAA,GAA2B;AACzB,MAAA,OAAOoL,aAAa,CAAA;AACtB,KAAA;;AAEA;AACF;AACA;AACA;AAHE7J,IAAAA,GAAA,EAIA,SAAAA,GAAyBjB,CAAAA,MAAM,EAAE;AAC/B8K,MAAAA,aAAa,GAAG9K,MAAM,CAAA;AACxB,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAP,GAAA,EAAA,wBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;AAClC,MAAA,OAAOuL,sBAAsB,CAAA;AAC/B,KAAA;;AAEA;AACF;AACA;AACA;AAHEhK,IAAAA,GAAA,EAIA,SAAAA,GAAkC0F,CAAAA,eAAe,EAAE;AACjDsE,MAAAA,sBAAsB,GAAGtE,eAAe,CAAA;AAC1C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAlH,GAAA,EAAA,uBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;AACjC,MAAA,OAAOyL,qBAAqB,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AAHElK,IAAAA,GAAA,EAIA,SAAAA,GAAiC6F,CAAAA,cAAc,EAAE;AAC/CqE,MAAAA,qBAAqB,GAAGrE,cAAc,CAAA;AACxC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;;AAEE;AACF;AACA;AAFE,GAAA,EAAA;IAAArH,GAAA,EAAA,qBAAA;IAAAC,GAAA,EAGA,SAAAA,GAAAA,GAAiC;AAC/B,MAAA,OAAO4L,mBAAmB,CAAA;AAC5B,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AANErK,IAAAA,GAAA,EAOA,SAAAA,GAA+ByJ,CAAAA,YAAY,EAAE;AAC3CY,MAAAA,mBAAmB,GAAGD,oBAAoB,CAACX,YAAY,CAAC,CAAA;AAC1D,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAjL,GAAA,EAAA,oBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgC;AAC9B,MAAA,OAAOyS,kBAAkB,CAAA;AAC3B,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AARElR,IAAAA,GAAA,EASA,SAAAA,GAA8BqR,CAAAA,UAAU,EAAE;MACxCH,kBAAkB,GAAGG,UAAU,GAAG,GAAG,CAAA;AACvC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7S,GAAA,EAAA,gBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;AAC1B,MAAA,OAAO0S,cAAc,CAAA;AACvB,KAAA;;AAEA;AACF;AACA;AACA;AAHEnR,IAAAA,GAAA,EAIA,SAAAA,GAA0BsR,CAAAA,CAAC,EAAE;AAC3BH,MAAAA,cAAc,GAAGG,CAAC,CAAA;AACpB,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAA1H,QAAA,CAAA;AAAA,CAAA;;ICvKkB2H,OAAO,gBAAA,YAAA;AAC1B,EAAA,SAAAA,OAAY7W,CAAAA,MAAM,EAAE8W,WAAW,EAAE;IAC/B,IAAI,CAAC9W,MAAM,GAAGA,MAAM,CAAA;IACpB,IAAI,CAAC8W,WAAW,GAAGA,WAAW,CAAA;AAChC,GAAA;AAAC,EAAA,IAAA3T,MAAA,GAAA0T,OAAA,CAAAzT,SAAA,CAAA;AAAAD,EAAAA,MAAA,CAEDjD,SAAS,GAAT,SAAAA,YAAY;IACV,IAAI,IAAI,CAAC4W,WAAW,EAAE;AACpB,MAAA,OAAU,IAAI,CAAC9W,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC8W,WAAW,CAAA;AAC5C,KAAC,MAAM;MACL,OAAO,IAAI,CAAC9W,MAAM,CAAA;AACpB,KAAA;GACD,CAAA;AAAA,EAAA,OAAA6W,OAAA,CAAA;AAAA,CAAA,EAAA;;ACCH,IAAME,aAAa,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;EAC3EC,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAEtE,SAASC,cAAcA,CAACtW,IAAI,EAAEgG,KAAK,EAAE;AACnC,EAAA,OAAO,IAAIkQ,OAAO,CAChB,mBAAmB,EACFlQ,gBAAAA,GAAAA,KAAK,GAAa,YAAA,GAAA,OAAOA,KAAK,GAAA,SAAA,GAAUhG,IAAI,GAAA,oBAC/D,CAAC,CAAA;AACH,CAAA;AAEO,SAASuW,SAASA,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;AAC1C,EAAA,IAAM6V,CAAC,GAAG,IAAI5S,IAAI,CAACA,IAAI,CAAC6S,GAAG,CAAChW,IAAI,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,CAAC,CAAC,CAAA;AAElD,EAAA,IAAIF,IAAI,GAAG,GAAG,IAAIA,IAAI,IAAI,CAAC,EAAE;IAC3B+V,CAAC,CAACE,cAAc,CAACF,CAAC,CAACG,cAAc,EAAE,GAAG,IAAI,CAAC,CAAA;AAC7C,GAAA;AAEA,EAAA,IAAMC,EAAE,GAAGJ,CAAC,CAACK,SAAS,EAAE,CAAA;AAExB,EAAA,OAAOD,EAAE,KAAK,CAAC,GAAG,CAAC,GAAGA,EAAE,CAAA;AAC1B,CAAA;AAEA,SAASE,cAAcA,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;AACxC,EAAA,OAAOA,GAAG,GAAG,CAACoW,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa,EAAE1V,KAAK,GAAG,CAAC,CAAC,CAAA;AACzE,CAAA;AAEA,SAASsW,gBAAgBA,CAACvW,IAAI,EAAEwW,OAAO,EAAE;EACvC,IAAMC,KAAK,GAAGH,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa;AACzDe,IAAAA,MAAM,GAAGD,KAAK,CAACE,SAAS,CAAC,UAACvR,CAAC,EAAA;MAAA,OAAKA,CAAC,GAAGoR,OAAO,CAAA;KAAC,CAAA;AAC5CtW,IAAAA,GAAG,GAAGsW,OAAO,GAAGC,KAAK,CAACC,MAAM,CAAC,CAAA;EAC/B,OAAO;IAAEzW,KAAK,EAAEyW,MAAM,GAAG,CAAC;AAAExW,IAAAA,GAAG,EAAHA,GAAAA;GAAK,CAAA;AACnC,CAAA;AAEO,SAAS0W,iBAAiBA,CAACC,UAAU,EAAEC,WAAW,EAAE;EACzD,OAAQ,CAACD,UAAU,GAAGC,WAAW,GAAG,CAAC,IAAI,CAAC,GAAI,CAAC,CAAA;AACjD,CAAA;;AAEA;AACA;AACA;;AAEO,SAASC,eAAeA,CAACC,OAAO,EAAEC,kBAAkB,EAAMH,WAAW,EAAM;AAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;AAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;AAAA,GAAA;AAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;AAAA,GAAA;AAC9E,EAAA,IAAQ9W,IAAI,GAAiBgX,OAAO,CAA5BhX,IAAI;IAAEC,KAAK,GAAU+W,OAAO,CAAtB/W,KAAK;IAAEC,GAAG,GAAK8W,OAAO,CAAf9W,GAAG;IACtBsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC;AAC1CG,IAAAA,OAAO,GAAGuW,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,EAAE4W,WAAW,CAAC,CAAA;AAEvE,EAAA,IAAII,UAAU,GAAGxQ,IAAI,CAAC2E,KAAK,CAAC,CAACmL,OAAO,GAAGnW,OAAO,GAAG,EAAE,GAAG4W,kBAAkB,IAAI,CAAC,CAAC;IAC5EE,QAAQ,CAAA;EAEV,IAAID,UAAU,GAAG,CAAC,EAAE;IAClBC,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;IACnBkX,UAAU,GAAGE,eAAe,CAACD,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;AACzE,GAAC,MAAM,IAAII,UAAU,GAAGE,eAAe,CAACpX,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,CAAC,EAAE;IAC9EK,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;AACnBkX,IAAAA,UAAU,GAAG,CAAC,CAAA;AAChB,GAAC,MAAM;AACLC,IAAAA,QAAQ,GAAGnX,IAAI,CAAA;AACjB,GAAA;AAEA,EAAA,OAAAgJ,QAAA,CAAA;AAASmO,IAAAA,QAAQ,EAARA,QAAQ;AAAED,IAAAA,UAAU,EAAVA,UAAU;AAAE7W,IAAAA,OAAO,EAAPA,OAAAA;GAAYgX,EAAAA,UAAU,CAACL,OAAO,CAAC,CAAA,CAAA;AAChE,CAAA;AAEO,SAASM,eAAeA,CAACC,QAAQ,EAAEN,kBAAkB,EAAMH,WAAW,EAAM;AAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;AAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;AAAA,GAAA;AAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;AAAA,GAAA;AAC/E,EAAA,IAAQK,QAAQ,GAA0BI,QAAQ,CAA1CJ,QAAQ;IAAED,UAAU,GAAcK,QAAQ,CAAhCL,UAAU;IAAE7W,OAAO,GAAKkX,QAAQ,CAApBlX,OAAO;AACnCmX,IAAAA,aAAa,GAAGZ,iBAAiB,CAACd,SAAS,CAACqB,QAAQ,EAAE,CAAC,EAAEF,kBAAkB,CAAC,EAAEH,WAAW,CAAC;AAC1FW,IAAAA,UAAU,GAAGC,UAAU,CAACP,QAAQ,CAAC,CAAA;AAEnC,EAAA,IAAIX,OAAO,GAAGU,UAAU,GAAG,CAAC,GAAG7W,OAAO,GAAGmX,aAAa,GAAG,CAAC,GAAGP,kBAAkB;IAC7EjX,IAAI,CAAA;EAEN,IAAIwW,OAAO,GAAG,CAAC,EAAE;IACfxW,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;AACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAAC1X,IAAI,CAAC,CAAA;AAC7B,GAAC,MAAM,IAAIwW,OAAO,GAAGiB,UAAU,EAAE;IAC/BzX,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;AACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAACP,QAAQ,CAAC,CAAA;AACjC,GAAC,MAAM;AACLnX,IAAAA,IAAI,GAAGmX,QAAQ,CAAA;AACjB,GAAA;AAEA,EAAA,IAAAQ,iBAAA,GAAuBpB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;IAA9CvW,KAAK,GAAA0X,iBAAA,CAAL1X,KAAK;IAAEC,GAAG,GAAAyX,iBAAA,CAAHzX,GAAG,CAAA;AAClB,EAAA,OAAA8I,QAAA,CAAA;AAAShJ,IAAAA,IAAI,EAAJA,IAAI;AAAEC,IAAAA,KAAK,EAALA,KAAK;AAAEC,IAAAA,GAAG,EAAHA,GAAAA;GAAQmX,EAAAA,UAAU,CAACE,QAAQ,CAAC,CAAA,CAAA;AACpD,CAAA;AAEO,SAASK,kBAAkBA,CAACC,QAAQ,EAAE;AAC3C,EAAA,IAAQ7X,IAAI,GAAiB6X,QAAQ,CAA7B7X,IAAI;IAAEC,KAAK,GAAU4X,QAAQ,CAAvB5X,KAAK;IAAEC,GAAG,GAAK2X,QAAQ,CAAhB3X,GAAG,CAAA;EACxB,IAAMsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,CAAA;AAChD,EAAA,OAAA8I,QAAA,CAAA;AAAShJ,IAAAA,IAAI,EAAJA,IAAI;AAAEwW,IAAAA,OAAO,EAAPA,OAAAA;GAAYa,EAAAA,UAAU,CAACQ,QAAQ,CAAC,CAAA,CAAA;AACjD,CAAA;AAEO,SAASC,kBAAkBA,CAACC,WAAW,EAAE;AAC9C,EAAA,IAAQ/X,IAAI,GAAc+X,WAAW,CAA7B/X,IAAI;IAAEwW,OAAO,GAAKuB,WAAW,CAAvBvB,OAAO,CAAA;AACrB,EAAA,IAAAwB,kBAAA,GAAuBzB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;IAA9CvW,KAAK,GAAA+X,kBAAA,CAAL/X,KAAK;IAAEC,GAAG,GAAA8X,kBAAA,CAAH9X,GAAG,CAAA;AAClB,EAAA,OAAA8I,QAAA,CAAA;AAAShJ,IAAAA,IAAI,EAAJA,IAAI;AAAEC,IAAAA,KAAK,EAALA,KAAK;AAAEC,IAAAA,GAAG,EAAHA,GAAAA;GAAQmX,EAAAA,UAAU,CAACU,WAAW,CAAC,CAAA,CAAA;AACvD,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO,SAASE,mBAAmBA,CAACC,GAAG,EAAExN,GAAG,EAAE;EAC5C,IAAMyN,iBAAiB,GACrB,CAAC1S,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,IAC9B,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,IACjC,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,CAAA;AACjC,EAAA,IAAIH,iBAAiB,EAAE;IACrB,IAAMI,cAAc,GAClB,CAAC9S,WAAW,CAACyS,GAAG,CAAC7X,OAAO,CAAC,IAAI,CAACoF,WAAW,CAACyS,GAAG,CAAChB,UAAU,CAAC,IAAI,CAACzR,WAAW,CAACyS,GAAG,CAACf,QAAQ,CAAC,CAAA;AAEzF,IAAA,IAAIoB,cAAc,EAAE;AAClB,MAAA,MAAM,IAAIpZ,6BAA6B,CACrC,gEACF,CAAC,CAAA;AACH,KAAA;AACA,IAAA,IAAI,CAACsG,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,EAAEF,GAAG,CAAC7X,OAAO,GAAG6X,GAAG,CAACE,YAAY,CAAA;AAClE,IAAA,IAAI,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,EAAEH,GAAG,CAAChB,UAAU,GAAGgB,GAAG,CAACG,eAAe,CAAA;AAC3E,IAAA,IAAI,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,EAAEJ,GAAG,CAACf,QAAQ,GAAGe,GAAG,CAACI,aAAa,CAAA;IACrE,OAAOJ,GAAG,CAACE,YAAY,CAAA;IACvB,OAAOF,GAAG,CAACG,eAAe,CAAA;IAC1B,OAAOH,GAAG,CAACI,aAAa,CAAA;IACxB,OAAO;AACLrB,MAAAA,kBAAkB,EAAEvM,GAAG,CAAC8G,qBAAqB,EAAE;AAC/CsF,MAAAA,WAAW,EAAEpM,GAAG,CAAC6G,cAAc,EAAC;KACjC,CAAA;AACH,GAAC,MAAM;IACL,OAAO;AAAE0F,MAAAA,kBAAkB,EAAE,CAAC;AAAEH,MAAAA,WAAW,EAAE,CAAA;KAAG,CAAA;AAClD,GAAA;AACF,CAAA;AAEO,SAAS0B,kBAAkBA,CAACN,GAAG,EAAEjB,kBAAkB,EAAMH,WAAW,EAAM;AAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;AAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;AAAA,GAAA;AAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;AAAA,GAAA;AAC7E,EAAA,IAAM2B,SAAS,GAAGC,SAAS,CAACR,GAAG,CAACf,QAAQ,CAAC;AACvCwB,IAAAA,SAAS,GAAGC,cAAc,CACxBV,GAAG,CAAChB,UAAU,EACd,CAAC,EACDE,eAAe,CAACc,GAAG,CAACf,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAC/D,CAAC;IACD+B,YAAY,GAAGD,cAAc,CAACV,GAAG,CAAC7X,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EAElD,IAAI,CAACoY,SAAS,EAAE;AACd,IAAA,OAAO5C,cAAc,CAAC,UAAU,EAAEqC,GAAG,CAACf,QAAQ,CAAC,CAAA;AACjD,GAAC,MAAM,IAAI,CAACwB,SAAS,EAAE;AACrB,IAAA,OAAO9C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAChB,UAAU,CAAC,CAAA;AAC/C,GAAC,MAAM,IAAI,CAAC2B,YAAY,EAAE;AACxB,IAAA,OAAOhD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC7X,OAAO,CAAC,CAAA;GAC9C,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAASyY,qBAAqBA,CAACZ,GAAG,EAAE;AACzC,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;AACnC+Y,IAAAA,YAAY,GAAGH,cAAc,CAACV,GAAG,CAAC1B,OAAO,EAAE,CAAC,EAAEkB,UAAU,CAACQ,GAAG,CAAClY,IAAI,CAAC,CAAC,CAAA;EAErE,IAAI,CAACyY,SAAS,EAAE;AACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAAC+Y,YAAY,EAAE;AACxB,IAAA,OAAOlD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC1B,OAAO,CAAC,CAAA;GAC9C,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAASwC,uBAAuBA,CAACd,GAAG,EAAE;AAC3C,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;IACnCiZ,UAAU,GAAGL,cAAc,CAACV,GAAG,CAACjY,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;AAC7CiZ,IAAAA,QAAQ,GAAGN,cAAc,CAACV,GAAG,CAAChY,GAAG,EAAE,CAAC,EAAEiZ,WAAW,CAACjB,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,CAAC,CAAC,CAAA;EAEzE,IAAI,CAACwY,SAAS,EAAE;AACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAACiZ,UAAU,EAAE;AACtB,IAAA,OAAOpD,cAAc,CAAC,OAAO,EAAEqC,GAAG,CAACjY,KAAK,CAAC,CAAA;AAC3C,GAAC,MAAM,IAAI,CAACiZ,QAAQ,EAAE;AACpB,IAAA,OAAOrD,cAAc,CAAC,KAAK,EAAEqC,GAAG,CAAChY,GAAG,CAAC,CAAA;GACtC,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAASkZ,kBAAkBA,CAAClB,GAAG,EAAE;AACtC,EAAA,IAAQzX,IAAI,GAAkCyX,GAAG,CAAzCzX,IAAI;IAAEC,MAAM,GAA0BwX,GAAG,CAAnCxX,MAAM;IAAEE,MAAM,GAAkBsX,GAAG,CAA3BtX,MAAM;IAAEmG,WAAW,GAAKmR,GAAG,CAAnBnR,WAAW,CAAA;EACzC,IAAMsS,SAAS,GACXT,cAAc,CAACnY,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAC1BA,IAAI,KAAK,EAAE,IAAIC,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAC,IAAImG,WAAW,KAAK,CAAE;IACpEuS,WAAW,GAAGV,cAAc,CAAClY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;IAC3C6Y,WAAW,GAAGX,cAAc,CAAChY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;IAC3C4Y,gBAAgB,GAAGZ,cAAc,CAAC7R,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;EAExD,IAAI,CAACsS,SAAS,EAAE;AACd,IAAA,OAAOxD,cAAc,CAAC,MAAM,EAAEpV,IAAI,CAAC,CAAA;AACrC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;AACvB,IAAA,OAAOzD,cAAc,CAAC,QAAQ,EAAEnV,MAAM,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;AACvB,IAAA,OAAO1D,cAAc,CAAC,QAAQ,EAAEjV,MAAM,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAAC4Y,gBAAgB,EAAE;AAC5B,IAAA,OAAO3D,cAAc,CAAC,aAAa,EAAE9O,WAAW,CAAC,CAAA;GAClD,MAAM,OAAO,KAAK,CAAA;AACrB;;ACnMA;AACA;AACA;;AAEA;;AAEO,SAAStB,WAAWA,CAACgU,CAAC,EAAE;EAC7B,OAAO,OAAOA,CAAC,KAAK,WAAW,CAAA;AACjC,CAAA;AAEO,SAAShH,QAAQA,CAACgH,CAAC,EAAE;EAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;AAC9B,CAAA;AAEO,SAASf,SAASA,CAACe,CAAC,EAAE;EAC3B,OAAO,OAAOA,CAAC,KAAK,QAAQ,IAAIA,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAC7C,CAAA;AAEO,SAASlH,QAAQA,CAACkH,CAAC,EAAE;EAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;AAC9B,CAAA;AAEO,SAASC,MAAMA,CAACD,CAAC,EAAE;EACxB,OAAOjO,MAAM,CAACxJ,SAAS,CAAC2P,QAAQ,CAAC9S,IAAI,CAAC4a,CAAC,CAAC,KAAK,eAAe,CAAA;AAC9D,CAAA;;AAEA;;AAEO,SAASxM,WAAWA,GAAG;EAC5B,IAAI;IACF,OAAO,OAAO3J,IAAI,KAAK,WAAW,IAAI,CAAC,CAACA,IAAI,CAAC+E,kBAAkB,CAAA;GAChE,CAAC,OAAOlC,CAAC,EAAE;AACV,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACF,CAAA;AAEO,SAASmL,iBAAiBA,GAAG;EAClC,IAAI;IACF,OACE,OAAOhO,IAAI,KAAK,WAAW,IAC3B,CAAC,CAACA,IAAI,CAACuF,MAAM,KACZ,UAAU,IAAIvF,IAAI,CAACuF,MAAM,CAAC7G,SAAS,IAAI,aAAa,IAAIsB,IAAI,CAACuF,MAAM,CAAC7G,SAAS,CAAC,CAAA;GAElF,CAAC,OAAOmE,CAAC,EAAE;AACV,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASwT,UAAUA,CAACC,KAAK,EAAE;EAChC,OAAOC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAC,CAAA;AAC/C,CAAA;AAEO,SAASG,MAAMA,CAACC,GAAG,EAAEC,EAAE,EAAEC,OAAO,EAAE;AACvC,EAAA,IAAIF,GAAG,CAAC3U,MAAM,KAAK,CAAC,EAAE;AACpB,IAAA,OAAOtB,SAAS,CAAA;AAClB,GAAA;EACA,OAAOiW,GAAG,CAACG,MAAM,CAAC,UAACC,IAAI,EAAEC,IAAI,EAAK;IAChC,IAAMC,IAAI,GAAG,CAACL,EAAE,CAACI,IAAI,CAAC,EAAEA,IAAI,CAAC,CAAA;IAC7B,IAAI,CAACD,IAAI,EAAE;AACT,MAAA,OAAOE,IAAI,CAAA;AACb,KAAC,MAAM,IAAIJ,OAAO,CAACE,IAAI,CAAC,CAAC,CAAC,EAAEE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAKF,IAAI,CAAC,CAAC,CAAC,EAAE;AAChD,MAAA,OAAOA,IAAI,CAAA;AACb,KAAC,MAAM;AACL,MAAA,OAAOE,IAAI,CAAA;AACb,KAAA;AACF,GAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AACb,CAAA;AAEO,SAASC,IAAIA,CAACrC,GAAG,EAAEzM,IAAI,EAAE;EAC9B,OAAOA,IAAI,CAAC0O,MAAM,CAAC,UAACK,CAAC,EAAEC,CAAC,EAAK;AAC3BD,IAAAA,CAAC,CAACC,CAAC,CAAC,GAAGvC,GAAG,CAACuC,CAAC,CAAC,CAAA;AACb,IAAA,OAAOD,CAAC,CAAA;GACT,EAAE,EAAE,CAAC,CAAA;AACR,CAAA;AAEO,SAASE,cAAcA,CAACxC,GAAG,EAAEyC,IAAI,EAAE;EACxC,OAAOnP,MAAM,CAACxJ,SAAS,CAAC0Y,cAAc,CAAC7b,IAAI,CAACqZ,GAAG,EAAEyC,IAAI,CAAC,CAAA;AACxD,CAAA;AAEO,SAASrM,oBAAoBA,CAACsM,QAAQ,EAAE;EAC7C,IAAIA,QAAQ,IAAI,IAAI,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM,IAAI,OAAOA,QAAQ,KAAK,QAAQ,EAAE;AACvC,IAAA,MAAM,IAAIpb,oBAAoB,CAAC,iCAAiC,CAAC,CAAA;AACnE,GAAC,MAAM;AACL,IAAA,IACE,CAACoZ,cAAc,CAACgC,QAAQ,CAACrN,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,IACxC,CAACqL,cAAc,CAACgC,QAAQ,CAACpN,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,IAC3C,CAACqM,KAAK,CAACC,OAAO,CAACc,QAAQ,CAACnN,OAAO,CAAC,IAChCmN,QAAQ,CAACnN,OAAO,CAACoN,IAAI,CAAC,UAACC,CAAC,EAAA;MAAA,OAAK,CAAClC,cAAc,CAACkC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AAAA,KAAA,CAAC,EACtD;AACA,MAAA,MAAM,IAAItb,oBAAoB,CAAC,uBAAuB,CAAC,CAAA;AACzD,KAAA;IACA,OAAO;MACL+N,QAAQ,EAAEqN,QAAQ,CAACrN,QAAQ;MAC3BC,WAAW,EAAEoN,QAAQ,CAACpN,WAAW;AACjCC,MAAAA,OAAO,EAAEoM,KAAK,CAACkB,IAAI,CAACH,QAAQ,CAACnN,OAAO,CAAA;KACrC,CAAA;AACH,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASmL,cAAcA,CAACgB,KAAK,EAAEoB,MAAM,EAAEC,GAAG,EAAE;EACjD,OAAOvC,SAAS,CAACkB,KAAK,CAAC,IAAIA,KAAK,IAAIoB,MAAM,IAAIpB,KAAK,IAAIqB,GAAG,CAAA;AAC5D,CAAA;;AAEA;AACO,SAASC,QAAQA,CAACC,CAAC,EAAEvb,CAAC,EAAE;EAC7B,OAAOub,CAAC,GAAGvb,CAAC,GAAG8G,IAAI,CAAC2E,KAAK,CAAC8P,CAAC,GAAGvb,CAAC,CAAC,CAAA;AAClC,CAAA;AAEO,SAASmM,QAAQA,CAACsG,KAAK,EAAEzS,CAAC,EAAM;AAAA,EAAA,IAAPA,CAAC,KAAA,KAAA,CAAA,EAAA;AAADA,IAAAA,CAAC,GAAG,CAAC,CAAA;AAAA,GAAA;AACnC,EAAA,IAAMwb,KAAK,GAAG/I,KAAK,GAAG,CAAC,CAAA;AACvB,EAAA,IAAIgJ,MAAM,CAAA;AACV,EAAA,IAAID,KAAK,EAAE;AACTC,IAAAA,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,CAAChJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;AAC/C,GAAC,MAAM;IACLyb,MAAM,GAAG,CAAC,EAAE,GAAGhJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;AACxC,GAAA;AACA,EAAA,OAAOyb,MAAM,CAAA;AACf,CAAA;AAEO,SAASC,YAAYA,CAACC,MAAM,EAAE;AACnC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;AAC3D,IAAA,OAAOxX,SAAS,CAAA;AAClB,GAAC,MAAM;AACL,IAAA,OAAO2B,QAAQ,CAAC6V,MAAM,EAAE,EAAE,CAAC,CAAA;AAC7B,GAAA;AACF,CAAA;AAEO,SAASC,aAAaA,CAACD,MAAM,EAAE;AACpC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;AAC3D,IAAA,OAAOxX,SAAS,CAAA;AAClB,GAAC,MAAM;IACL,OAAO0X,UAAU,CAACF,MAAM,CAAC,CAAA;AAC3B,GAAA;AACF,CAAA;AAEO,SAASG,WAAWA,CAACC,QAAQ,EAAE;AACpC;AACA,EAAA,IAAIlW,WAAW,CAACkW,QAAQ,CAAC,IAAIA,QAAQ,KAAK,IAAI,IAAIA,QAAQ,KAAK,EAAE,EAAE;AACjE,IAAA,OAAO5X,SAAS,CAAA;AAClB,GAAC,MAAM;IACL,IAAMmG,CAAC,GAAGuR,UAAU,CAAC,IAAI,GAAGE,QAAQ,CAAC,GAAG,IAAI,CAAA;AAC5C,IAAA,OAAOjV,IAAI,CAAC2E,KAAK,CAACnB,CAAC,CAAC,CAAA;AACtB,GAAA;AACF,CAAA;AAEO,SAAS4B,OAAOA,CAAC8P,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAY;AAAA,EAAA,IAApBA,QAAQ,KAAA,KAAA,CAAA,EAAA;AAARA,IAAAA,QAAQ,GAAG,OAAO,CAAA;AAAA,GAAA;EACxD,IAAMC,MAAM,GAAArV,IAAA,CAAAsV,GAAA,CAAG,EAAE,EAAIH,MAAM,CAAA,CAAA;AAC3B,EAAA,QAAQC,QAAQ;AACd,IAAA,KAAK,QAAQ;MACX,OAAOF,MAAM,GAAG,CAAC,GACblV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,GACnCrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC1C,IAAA,KAAK,OAAO;MACV,OAAOrV,IAAI,CAACwV,KAAK,CAACN,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,OAAO;MACV,OAAOrV,IAAI,CAACyV,KAAK,CAACP,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,OAAO;MACV,OAAOrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,MAAM;MACT,OAAOrV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC5C,IAAA;AACE,MAAA,MAAM,IAAIK,UAAU,CAAmBN,iBAAAA,GAAAA,QAAQ,qBAAkB,CAAC,CAAA;AACtE,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASxF,UAAUA,CAACtW,IAAI,EAAE;AAC/B,EAAA,OAAOA,IAAI,GAAG,CAAC,KAAK,CAAC,KAAKA,IAAI,GAAG,GAAG,KAAK,CAAC,IAAIA,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAA;AACjE,CAAA;AAEO,SAAS0X,UAAUA,CAAC1X,IAAI,EAAE;AAC/B,EAAA,OAAOsW,UAAU,CAACtW,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;AACrC,CAAA;AAEO,SAASmZ,WAAWA,CAACnZ,IAAI,EAAEC,KAAK,EAAE;EACvC,IAAMoc,QAAQ,GAAGnB,QAAQ,CAACjb,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;IAC1Cqc,OAAO,GAAGtc,IAAI,GAAG,CAACC,KAAK,GAAGoc,QAAQ,IAAI,EAAE,CAAA;EAE1C,IAAIA,QAAQ,KAAK,CAAC,EAAE;AAClB,IAAA,OAAO/F,UAAU,CAACgG,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;AACtC,GAAC,MAAM;AACL,IAAA,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAACD,QAAQ,GAAG,CAAC,CAAC,CAAA;AACzE,GAAA;AACF,CAAA;;AAEA;AACO,SAASvV,YAAYA,CAACoR,GAAG,EAAE;AAChC,EAAA,IAAInC,CAAC,GAAG5S,IAAI,CAAC6S,GAAG,CACdkC,GAAG,CAAClY,IAAI,EACRkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EACbiY,GAAG,CAAChY,GAAG,EACPgY,GAAG,CAACzX,IAAI,EACRyX,GAAG,CAACxX,MAAM,EACVwX,GAAG,CAACtX,MAAM,EACVsX,GAAG,CAACnR,WACN,CAAC,CAAA;;AAED;EACA,IAAImR,GAAG,CAAClY,IAAI,GAAG,GAAG,IAAIkY,GAAG,CAAClY,IAAI,IAAI,CAAC,EAAE;AACnC+V,IAAAA,CAAC,GAAG,IAAI5S,IAAI,CAAC4S,CAAC,CAAC,CAAA;AACf;AACA;AACA;AACAA,IAAAA,CAAC,CAACE,cAAc,CAACiC,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EAAEiY,GAAG,CAAChY,GAAG,CAAC,CAAA;AACpD,GAAA;AACA,EAAA,OAAO,CAAC6V,CAAC,CAAA;AACX,CAAA;;AAEA;AACA,SAASwG,eAAeA,CAACvc,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,EAAE;AAC9D,EAAA,IAAM0F,KAAK,GAAG5F,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAE,CAAC,EAAEiX,kBAAkB,CAAC,EAAEH,WAAW,CAAC,CAAA;AACpF,EAAA,OAAO,CAAC0F,KAAK,GAAGvF,kBAAkB,GAAG,CAAC,CAAA;AACxC,CAAA;AAEO,SAASG,eAAeA,CAACD,QAAQ,EAAEF,kBAAkB,EAAMH,WAAW,EAAM;AAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;AAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;AAAA,GAAA;AAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;AAAA,GAAA;EAC/E,IAAM2F,UAAU,GAAGF,eAAe,CAACpF,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EAC7E,IAAM4F,cAAc,GAAGH,eAAe,CAACpF,QAAQ,GAAG,CAAC,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EACrF,OAAO,CAACY,UAAU,CAACP,QAAQ,CAAC,GAAGsF,UAAU,GAAGC,cAAc,IAAI,CAAC,CAAA;AACjE,CAAA;AAEO,SAASC,cAAcA,CAAC3c,IAAI,EAAE;EACnC,IAAIA,IAAI,GAAG,EAAE,EAAE;AACb,IAAA,OAAOA,IAAI,CAAA;AACb,GAAC,MAAM,OAAOA,IAAI,GAAG8N,QAAQ,CAACsH,kBAAkB,GAAG,IAAI,GAAGpV,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;AAC9E,CAAA;;AAEA;;AAEO,SAASkD,aAAaA,CAAChB,EAAE,EAAE0a,YAAY,EAAE3Z,MAAM,EAAEQ,QAAQ,EAAS;AAAA,EAAA,IAAjBA,QAAQ,KAAA,KAAA,CAAA,EAAA;AAARA,IAAAA,QAAQ,GAAG,IAAI,CAAA;AAAA,GAAA;AACrE,EAAA,IAAMY,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC;AACvBwJ,IAAAA,QAAQ,GAAG;AACTzK,MAAAA,SAAS,EAAE,KAAK;AAChBjB,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,KAAK,EAAE,SAAS;AAChBC,MAAAA,GAAG,EAAE,SAAS;AACdO,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,MAAM,EAAE,SAAA;KACT,CAAA;AAEH,EAAA,IAAI+C,QAAQ,EAAE;IACZiI,QAAQ,CAACjI,QAAQ,GAAGA,QAAQ,CAAA;AAC9B,GAAA;EAEA,IAAMoZ,QAAQ,GAAA7T,QAAA,CAAA;AAAKlI,IAAAA,YAAY,EAAE8b,YAAAA;AAAY,GAAA,EAAKlR,QAAQ,CAAE,CAAA;EAE5D,IAAMlH,MAAM,GAAG,IAAIlB,IAAI,CAACC,cAAc,CAACN,MAAM,EAAE4Z,QAAQ,CAAC,CACrD3X,aAAa,CAACb,IAAI,CAAC,CACnByM,IAAI,CAAC,UAACC,CAAC,EAAA;IAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAK,cAAc,CAAA;GAAC,CAAA,CAAA;AACvD,EAAA,OAAOxM,MAAM,GAAGA,MAAM,CAACe,KAAK,GAAG,IAAI,CAAA;AACrC,CAAA;;AAEA;AACO,SAAS2M,YAAYA,CAAC4K,UAAU,EAAEC,YAAY,EAAE;AACrD,EAAA,IAAIC,OAAO,GAAGtX,QAAQ,CAACoX,UAAU,EAAE,EAAE,CAAC,CAAA;;AAEtC;AACA,EAAA,IAAIG,MAAM,CAAC1W,KAAK,CAACyW,OAAO,CAAC,EAAE;AACzBA,IAAAA,OAAO,GAAG,CAAC,CAAA;AACb,GAAA;EAEA,IAAME,MAAM,GAAGxX,QAAQ,CAACqX,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC;AAC5CI,IAAAA,YAAY,GAAGH,OAAO,GAAG,CAAC,IAAIxR,MAAM,CAAC4R,EAAE,CAACJ,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAACE,MAAM,GAAGA,MAAM,CAAA;AACzE,EAAA,OAAOF,OAAO,GAAG,EAAE,GAAGG,YAAY,CAAA;AACpC,CAAA;;AAEA;;AAEO,SAASE,QAAQA,CAAC9X,KAAK,EAAE;AAC9B,EAAA,IAAM+X,YAAY,GAAGL,MAAM,CAAC1X,KAAK,CAAC,CAAA;EAClC,IAAI,OAAOA,KAAK,KAAK,SAAS,IAAIA,KAAK,KAAK,EAAE,IAAI,CAAC0X,MAAM,CAACM,QAAQ,CAACD,YAAY,CAAC,EAC9E,MAAM,IAAI9d,oBAAoB,CAAuB+F,qBAAAA,GAAAA,KAAO,CAAC,CAAA;AAC/D,EAAA,OAAO+X,YAAY,CAAA;AACrB,CAAA;AAEO,SAASE,eAAeA,CAACtF,GAAG,EAAEuF,UAAU,EAAE;EAC/C,IAAMC,UAAU,GAAG,EAAE,CAAA;AACrB,EAAA,KAAK,IAAMC,CAAC,IAAIzF,GAAG,EAAE;AACnB,IAAA,IAAIwC,cAAc,CAACxC,GAAG,EAAEyF,CAAC,CAAC,EAAE;AAC1B,MAAA,IAAM7C,CAAC,GAAG5C,GAAG,CAACyF,CAAC,CAAC,CAAA;AAChB,MAAA,IAAI7C,CAAC,KAAK/W,SAAS,IAAI+W,CAAC,KAAK,IAAI,EAAE,SAAA;MACnC4C,UAAU,CAACD,UAAU,CAACE,CAAC,CAAC,CAAC,GAAGN,QAAQ,CAACvC,CAAC,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;AACA,EAAA,OAAO4C,UAAU,CAAA;AACnB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAStb,YAAYA,CAACE,MAAM,EAAED,MAAM,EAAE;AAC3C,EAAA,IAAMub,KAAK,GAAGlX,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;AAC7CiK,IAAAA,OAAO,GAAG7F,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;AAC3Cub,IAAAA,IAAI,GAAGvb,MAAM,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;AAEhC,EAAA,QAAQD,MAAM;AACZ,IAAA,KAAK,OAAO;AACV,MAAA,OAAA,EAAA,GAAUwb,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAA,GAAA,GAAI7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;AAC7D,IAAA,KAAK,QAAQ;MACX,OAAUsR,EAAAA,GAAAA,IAAI,GAAGD,KAAK,IAAGrR,OAAO,GAAG,CAAC,GAAA,GAAA,GAAOA,OAAO,GAAK,EAAE,CAAA,CAAA;AAC3D,IAAA,KAAK,QAAQ;AACX,MAAA,OAAA,EAAA,GAAUsR,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAG7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;AAC5D,IAAA;AACE,MAAA,MAAM,IAAI6P,UAAU,CAAiB/Z,eAAAA,GAAAA,MAAM,yCAAsC,CAAC,CAAA;AACtF,GAAA;AACF,CAAA;AAEO,SAASgV,UAAUA,CAACa,GAAG,EAAE;AAC9B,EAAA,OAAOqC,IAAI,CAACrC,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAA;AAC/D;;AClUA;AACA;AACA;;AAEO,IAAM4F,UAAU,GAAG,CACxB,SAAS,EACT,UAAU,EACV,OAAO,EACP,OAAO,EACP,KAAK,EACL,MAAM,EACN,MAAM,EACN,QAAQ,EACR,WAAW,EACX,SAAS,EACT,UAAU,EACV,UAAU,CACX,CAAA;AAEM,IAAMC,WAAW,GAAG,CACzB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,CACN,CAAA;AAEM,IAAMC,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAEjF,SAASnO,MAAMA,CAACxK,MAAM,EAAE;AAC7B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWD,YAAY,CAAA,CAAA;AACzB,IAAA,KAAK,OAAO;MACV,OAAAC,EAAAA,CAAAA,MAAA,CAAWF,WAAW,CAAA,CAAA;AACxB,IAAA,KAAK,MAAM;MACT,OAAAE,EAAAA,CAAAA,MAAA,CAAWH,UAAU,CAAA,CAAA;AACvB,IAAA,KAAK,SAAS;MACZ,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACxE,IAAA,KAAK,SAAS;MACZ,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACjF,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,IAAMI,YAAY,GAAG,CAC1B,QAAQ,EACR,SAAS,EACT,WAAW,EACX,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,CACT,CAAA;AAEM,IAAMC,aAAa,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AAEvE,IAAMC,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAE1D,SAAShO,QAAQA,CAAC/K,MAAM,EAAE;AAC/B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWG,cAAc,CAAA,CAAA;AAC3B,IAAA,KAAK,OAAO;MACV,OAAAH,EAAAA,CAAAA,MAAA,CAAWE,aAAa,CAAA,CAAA;AAC1B,IAAA,KAAK,MAAM;MACT,OAAAF,EAAAA,CAAAA,MAAA,CAAWC,YAAY,CAAA,CAAA;AACzB,IAAA,KAAK,SAAS;AACZ,MAAA,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAC5C,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,IAAM5N,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAE9B,IAAM+N,QAAQ,GAAG,CAAC,eAAe,EAAE,aAAa,CAAC,CAAA;AAEjD,IAAMC,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAE9B,IAAMC,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAE7B,SAAS/N,IAAIA,CAACnL,MAAM,EAAE;AAC3B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWM,UAAU,CAAA,CAAA;AACvB,IAAA,KAAK,OAAO;MACV,OAAAN,EAAAA,CAAAA,MAAA,CAAWK,SAAS,CAAA,CAAA;AACtB,IAAA,KAAK,MAAM;MACT,OAAAL,EAAAA,CAAAA,MAAA,CAAWI,QAAQ,CAAA,CAAA;AACrB,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,SAASG,mBAAmBA,CAACpU,EAAE,EAAE;EACtC,OAAOkG,SAAS,CAAClG,EAAE,CAAC3J,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AACxC,CAAA;AAEO,SAASge,kBAAkBA,CAACrU,EAAE,EAAE/E,MAAM,EAAE;EAC7C,OAAO+K,QAAQ,CAAC/K,MAAM,CAAC,CAAC+E,EAAE,CAAC/J,OAAO,GAAG,CAAC,CAAC,CAAA;AACzC,CAAA;AAEO,SAASqe,gBAAgBA,CAACtU,EAAE,EAAE/E,MAAM,EAAE;EAC3C,OAAOwK,MAAM,CAACxK,MAAM,CAAC,CAAC+E,EAAE,CAACnK,KAAK,GAAG,CAAC,CAAC,CAAA;AACrC,CAAA;AAEO,SAAS0e,cAAcA,CAACvU,EAAE,EAAE/E,MAAM,EAAE;AACzC,EAAA,OAAOmL,IAAI,CAACnL,MAAM,CAAC,CAAC+E,EAAE,CAACpK,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC1C,CAAA;AAEO,SAAS4e,kBAAkBA,CAACrf,IAAI,EAAE6N,KAAK,EAAEE,OAAO,EAAauR,MAAM,EAAU;AAAA,EAAA,IAApCvR,OAAO,KAAA,KAAA,CAAA,EAAA;AAAPA,IAAAA,OAAO,GAAG,QAAQ,CAAA;AAAA,GAAA;AAAA,EAAA,IAAEuR,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,IAAAA,MAAM,GAAG,KAAK,CAAA;AAAA,GAAA;AAChF,EAAA,IAAMC,KAAK,GAAG;AACZC,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBC,IAAAA,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;AAC7BnP,IAAAA,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;AACxBoP,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBC,IAAAA,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;AAC5BtB,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBrR,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;AAC3B4S,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAA;GAC3B,CAAA;AAED,EAAA,IAAMC,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC/V,OAAO,CAAC9J,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;AAErE,EAAA,IAAI+N,OAAO,KAAK,MAAM,IAAI8R,QAAQ,EAAE;AAClC,IAAA,IAAMC,KAAK,GAAG9f,IAAI,KAAK,MAAM,CAAA;AAC7B,IAAA,QAAQ6N,KAAK;AACX,MAAA,KAAK,CAAC;QACJ,OAAOiS,KAAK,GAAG,UAAU,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;AACtD,MAAA,KAAK,CAAC,CAAC;QACL,OAAO8f,KAAK,GAAG,WAAW,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;AACvD,MAAA,KAAK,CAAC;QACJ,OAAO8f,KAAK,GAAG,OAAO,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;AAErD,KAAA;AACF,GAAA;;AAEA,EAAA,IAAM+f,QAAQ,GAAG9T,MAAM,CAAC4R,EAAE,CAAChQ,KAAK,EAAE,CAAC,CAAC,CAAC,IAAIA,KAAK,GAAG,CAAC;AAChDmS,IAAAA,QAAQ,GAAG7Y,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC;IAC1BoS,QAAQ,GAAGD,QAAQ,KAAK,CAAC;AACzBE,IAAAA,QAAQ,GAAGX,KAAK,CAACvf,IAAI,CAAC;AACtBmgB,IAAAA,OAAO,GAAGb,MAAM,GACZW,QAAQ,GACNC,QAAQ,CAAC,CAAC,CAAC,GACXA,QAAQ,CAAC,CAAC,CAAC,IAAIA,QAAQ,CAAC,CAAC,CAAC,GAC5BD,QAAQ,GACRV,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAC,GACdA,IAAI,CAAA;EACV,OAAO+f,QAAQ,GAAMC,QAAQ,GAAA,GAAA,GAAIG,OAAO,GAAeH,MAAAA,GAAAA,KAAAA,GAAAA,QAAQ,SAAIG,OAAS,CAAA;AAC9E;;ACjKA,SAASC,eAAeA,CAACC,MAAM,EAAEC,aAAa,EAAE;EAC9C,IAAIhgB,CAAC,GAAG,EAAE,CAAA;AACV,EAAA,KAAA,IAAAigB,SAAA,GAAAC,+BAAA,CAAoBH,MAAM,CAAA,EAAAI,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;AAAA,IAAA,IAAjBC,KAAK,GAAAF,KAAA,CAAAza,KAAA,CAAA;IACd,IAAI2a,KAAK,CAACC,OAAO,EAAE;MACjBtgB,CAAC,IAAIqgB,KAAK,CAACE,GAAG,CAAA;AAChB,KAAC,MAAM;AACLvgB,MAAAA,CAAC,IAAIggB,aAAa,CAACK,KAAK,CAACE,GAAG,CAAC,CAAA;AAC/B,KAAA;AACF,GAAA;AACA,EAAA,OAAOvgB,CAAC,CAAA;AACV,CAAA;AAEA,IAAMwgB,uBAAsB,GAAG;EAC7BC,CAAC,EAAEC,UAAkB;EACrBC,EAAE,EAAED,QAAgB;EACpBE,GAAG,EAAEF,SAAiB;EACtBG,IAAI,EAAEH,SAAiB;EACvB/K,CAAC,EAAE+K,WAAmB;EACtBI,EAAE,EAAEJ,iBAAyB;EAC7BK,GAAG,EAAEL,sBAA8B;EACnCM,IAAI,EAAEN,qBAA6B;EACnCO,CAAC,EAAEP,cAAsB;EACzBQ,EAAE,EAAER,oBAA4B;EAChCS,GAAG,EAAET,yBAAiC;EACtCU,IAAI,EAAEV,wBAAgC;EACtCrW,CAAC,EAAEqW,cAAsB;EACzBW,EAAE,EAAEX,YAAoB;EACxBY,GAAG,EAAEZ,aAAqB;EAC1Ba,IAAI,EAAEb,aAAqB;EAC3Bc,CAAC,EAAEd,2BAAmC;EACtCe,EAAE,EAAEf,yBAAiC;EACrCgB,GAAG,EAAEhB,0BAAkC;EACvCiB,IAAI,EAAEjB,0BAAQ1e;AAChB,CAAC,CAAA;;AAED;AACA;AACA;AAFA,IAIqB4f,SAAS,gBAAA,YAAA;EAAAA,SAAA,CACrB5b,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAEd,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAC7B,IAAA,OAAO,IAAIsf,SAAS,CAACxe,MAAM,EAAEd,IAAI,CAAC,CAAA;GACnC,CAAA;AAAAsf,EAAAA,SAAA,CAEMC,WAAW,GAAlB,SAAAA,WAAAA,CAAmBC,GAAG,EAAE;AACtB;AACA;;IAEA,IAAIC,OAAO,GAAG,IAAI;AAChBC,MAAAA,WAAW,GAAG,EAAE;AAChBC,MAAAA,SAAS,GAAG,KAAK,CAAA;IACnB,IAAMlC,MAAM,GAAG,EAAE,CAAA;AACjB,IAAA,KAAK,IAAIxa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuc,GAAG,CAACtc,MAAM,EAAED,CAAC,EAAE,EAAE;AACnC,MAAA,IAAM2c,CAAC,GAAGJ,GAAG,CAACK,MAAM,CAAC5c,CAAC,CAAC,CAAA;MACvB,IAAI2c,CAAC,KAAK,GAAG,EAAE;AACb;AACA,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,IAAIyc,SAAS,EAAE;UACvClC,MAAM,CAACrV,IAAI,CAAC;YACV4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;AAC/CzB,YAAAA,GAAG,EAAEyB,WAAW,KAAK,EAAE,GAAG,GAAG,GAAGA,WAAAA;AAClC,WAAC,CAAC,CAAA;AACJ,SAAA;AACAD,QAAAA,OAAO,GAAG,IAAI,CAAA;AACdC,QAAAA,WAAW,GAAG,EAAE,CAAA;QAChBC,SAAS,GAAG,CAACA,SAAS,CAAA;OACvB,MAAM,IAAIA,SAAS,EAAE;AACpBD,QAAAA,WAAW,IAAIE,CAAC,CAAA;AAClB,OAAC,MAAM,IAAIA,CAAC,KAAKH,OAAO,EAAE;AACxBC,QAAAA,WAAW,IAAIE,CAAC,CAAA;AAClB,OAAC,MAAM;AACL,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;UAC1Bua,MAAM,CAACrV,IAAI,CAAC;AAAE4V,YAAAA,OAAO,EAAE,OAAO,CAAC8B,IAAI,CAACJ,WAAW,CAAC;AAAEzB,YAAAA,GAAG,EAAEyB,WAAAA;AAAY,WAAC,CAAC,CAAA;AACvE,SAAA;AACAA,QAAAA,WAAW,GAAGE,CAAC,CAAA;AACfH,QAAAA,OAAO,GAAGG,CAAC,CAAA;AACb,OAAA;AACF,KAAA;AAEA,IAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;MAC1Bua,MAAM,CAACrV,IAAI,CAAC;QAAE4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;AAAEzB,QAAAA,GAAG,EAAEyB,WAAAA;AAAY,OAAC,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,OAAOjC,MAAM,CAAA;GACd,CAAA;AAAA6B,EAAAA,SAAA,CAEMpB,sBAAsB,GAA7B,SAAAA,sBAAAA,CAA8BH,KAAK,EAAE;IACnC,OAAOG,uBAAsB,CAACH,KAAK,CAAC,CAAA;GACrC,CAAA;AAED,EAAA,SAAAuB,SAAYxe,CAAAA,MAAM,EAAEif,UAAU,EAAE;IAC9B,IAAI,CAAC/f,IAAI,GAAG+f,UAAU,CAAA;IACtB,IAAI,CAACxX,GAAG,GAAGzH,MAAM,CAAA;IACjB,IAAI,CAACkf,SAAS,GAAG,IAAI,CAAA;AACvB,GAAA;AAAC,EAAA,IAAApgB,MAAA,GAAA0f,SAAA,CAAAzf,SAAA,CAAA;EAAAD,MAAA,CAEDqgB,uBAAuB,GAAvB,SAAAA,wBAAwBhY,EAAE,EAAEjI,IAAI,EAAE;AAChC,IAAA,IAAI,IAAI,CAACggB,SAAS,KAAK,IAAI,EAAE;MAC3B,IAAI,CAACA,SAAS,GAAG,IAAI,CAACzX,GAAG,CAACkF,iBAAiB,EAAE,CAAA;AAC/C,KAAA;AACA,IAAA,IAAMe,EAAE,GAAG,IAAI,CAACwR,SAAS,CAAChS,WAAW,CAAC/F,EAAE,EAAApB,QAAA,KAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;AACpE,IAAA,OAAOwO,EAAE,CAACtO,MAAM,EAAE,CAAA;GACnB,CAAA;EAAAN,MAAA,CAEDoO,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEjI,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACvB,IAAA,OAAO,IAAI,CAACuI,GAAG,CAACyF,WAAW,CAAC/F,EAAE,EAAApB,QAAA,CAAA,EAAA,EAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;GAC3D,CAAA;EAAAJ,MAAA,CAEDsgB,cAAc,GAAd,SAAAA,eAAejY,EAAE,EAAEjI,IAAI,EAAE;IACvB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACE,MAAM,EAAE,CAAA;GAC3C,CAAA;EAAAN,MAAA,CAEDugB,mBAAmB,GAAnB,SAAAA,oBAAoBlY,EAAE,EAAEjI,IAAI,EAAE;IAC5B,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAAC+C,aAAa,EAAE,CAAA;GAClD,CAAA;EAAAnD,MAAA,CAEDwgB,cAAc,GAAd,SAAAA,eAAeC,QAAQ,EAAErgB,IAAI,EAAE;IAC7B,IAAMwO,EAAE,GAAG,IAAI,CAACR,WAAW,CAACqS,QAAQ,CAACC,KAAK,EAAEtgB,IAAI,CAAC,CAAA;IACjD,OAAOwO,EAAE,CAAC7M,GAAG,CAAC4e,WAAW,CAACF,QAAQ,CAACC,KAAK,CAAC9V,QAAQ,EAAE,EAAE6V,QAAQ,CAACG,GAAG,CAAChW,QAAQ,EAAE,CAAC,CAAA;GAC9E,CAAA;EAAA5K,MAAA,CAEDyB,eAAe,GAAf,SAAAA,gBAAgB4G,EAAE,EAAEjI,IAAI,EAAE;IACxB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACqB,eAAe,EAAE,CAAA;GACpD,CAAA;EAAAzB,MAAA,CAED6gB,GAAG,GAAH,SAAAA,GAAAA,CAAIhjB,CAAC,EAAEijB,CAAC,EAAMC,WAAW,EAAc;AAAA,IAAA,IAAhCD,CAAC,KAAA,KAAA,CAAA,EAAA;AAADA,MAAAA,CAAC,GAAG,CAAC,CAAA;AAAA,KAAA;AAAA,IAAA,IAAEC,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,MAAAA,WAAW,GAAG/e,SAAS,CAAA;AAAA,KAAA;AACnC;AACA,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACgJ,WAAW,EAAE;AACzB,MAAA,OAAOY,QAAQ,CAACnM,CAAC,EAAEijB,CAAC,CAAC,CAAA;AACvB,KAAA;AAEA,IAAA,IAAM1gB,IAAI,GAAA6G,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;IAE7B,IAAI0gB,CAAC,GAAG,CAAC,EAAE;MACT1gB,IAAI,CAACiJ,KAAK,GAAGyX,CAAC,CAAA;AAChB,KAAA;AACA,IAAA,IAAIC,WAAW,EAAE;MACf3gB,IAAI,CAAC2gB,WAAW,GAAGA,WAAW,CAAA;AAChC,KAAA;AAEA,IAAA,OAAO,IAAI,CAACpY,GAAG,CAACuG,eAAe,CAAC9O,IAAI,CAAC,CAACE,MAAM,CAACzC,CAAC,CAAC,CAAA;GAChD,CAAA;EAAAmC,MAAA,CAEDghB,wBAAwB,GAAxB,SAAAA,yBAAyB3Y,EAAE,EAAEuX,GAAG,EAAE;AAAA,IAAA,IAAAvb,KAAA,GAAA,IAAA,CAAA;IAChC,IAAM4c,YAAY,GAAG,IAAI,CAACtY,GAAG,CAACI,WAAW,EAAE,KAAK,IAAI;AAClDmY,MAAAA,oBAAoB,GAAG,IAAI,CAACvY,GAAG,CAACX,cAAc,IAAI,IAAI,CAACW,GAAG,CAACX,cAAc,KAAK,SAAS;AACvFwR,MAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIpZ,IAAI,EAAE+N,OAAO,EAAA;QAAA,OAAK9J,KAAI,CAACsE,GAAG,CAACwF,OAAO,CAAC9F,EAAE,EAAEjI,IAAI,EAAE+N,OAAO,CAAC,CAAA;AAAA,OAAA;AAC/D9N,MAAAA,YAAY,GAAG,SAAfA,YAAYA,CAAID,IAAI,EAAK;AACvB,QAAA,IAAIiI,EAAE,CAAC8Y,aAAa,IAAI9Y,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIH,IAAI,CAACghB,MAAM,EAAE;AACtD,UAAA,OAAO,GAAG,CAAA;AACZ,SAAA;AAEA,QAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GAAGhZ,EAAE,CAACtE,IAAI,CAAC1D,YAAY,CAACgI,EAAE,CAAClI,EAAE,EAAEC,IAAI,CAACE,MAAM,CAAC,GAAG,EAAE,CAAA;OAClE;MACDghB,QAAQ,GAAG,SAAXA,QAAQA,GAAA;QAAA,OACNL,YAAY,GACR3V,mBAA2B,CAACjD,EAAE,CAAC,GAC/BmR,MAAM,CAAC;AAAE9a,UAAAA,IAAI,EAAE,SAAS;AAAEQ,UAAAA,SAAS,EAAE,KAAA;SAAO,EAAE,WAAW,CAAC,CAAA;AAAA,OAAA;AAChEhB,MAAAA,KAAK,GAAG,SAARA,KAAKA,CAAIoF,MAAM,EAAE2J,UAAU,EAAA;AAAA,QAAA,OACzBgU,YAAY,GACR3V,gBAAwB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACpCkW,MAAM,CAACvM,UAAU,GAAG;AAAE/O,UAAAA,KAAK,EAAEoF,MAAAA;AAAO,SAAC,GAAG;AAAEpF,UAAAA,KAAK,EAAEoF,MAAM;AAAEnF,UAAAA,GAAG,EAAE,SAAA;SAAW,EAAE,OAAO,CAAC,CAAA;AAAA,OAAA;AACzFG,MAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAIgF,MAAM,EAAE2J,UAAU,EAAA;AAAA,QAAA,OAC3BgU,YAAY,GACR3V,kBAA0B,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACtCkW,MAAM,CACJvM,UAAU,GAAG;AAAE3O,UAAAA,OAAO,EAAEgF,MAAAA;AAAO,SAAC,GAAG;AAAEhF,UAAAA,OAAO,EAAEgF,MAAM;AAAEpF,UAAAA,KAAK,EAAE,MAAM;AAAEC,UAAAA,GAAG,EAAE,SAAA;SAAW,EACrF,SACF,CAAC,CAAA;AAAA,OAAA;AACPojB,MAAAA,UAAU,GAAG,SAAbA,UAAUA,CAAIpD,KAAK,EAAK;AACtB,QAAA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAAC,CAAA;AAC1D,QAAA,IAAIgC,UAAU,EAAE;AACd,UAAA,OAAO9b,KAAI,CAACgc,uBAAuB,CAAChY,EAAE,EAAE8X,UAAU,CAAC,CAAA;AACrD,SAAC,MAAM;AACL,UAAA,OAAOhC,KAAK,CAAA;AACd,SAAA;OACD;AACDjc,MAAAA,GAAG,GAAG,SAANA,GAAGA,CAAIoB,MAAM,EAAA;AAAA,QAAA,OACX2d,YAAY,GAAG3V,cAAsB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GAAGkW,MAAM,CAAC;AAAEtX,UAAAA,GAAG,EAAEoB,MAAAA;SAAQ,EAAE,KAAK,CAAC,CAAA;AAAA,OAAA;AACpFwa,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIK,KAAK,EAAK;AACzB;AACA,QAAA,QAAQA,KAAK;AACX;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO9Z,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,CAAC,CAAA;AACjC,UAAA,KAAK,GAAG,CAAA;AACR;AACA,UAAA,KAAK,KAAK;YACR,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,EAAE,CAAC,CAAC,CAAA;AACpC;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,CAAC,CAAA;AAC5B,UAAA,KAAK,IAAI;YACP,OAAOwF,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,EAAE,CAAC,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,IAAI;AACP,YAAA,OAAOwF,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACrD,UAAA,KAAK,KAAK;AACR,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,GAAG,CAAC,CAAC,CAAA;AACnD;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,CAAC,CAAA;AAC5B,UAAA,KAAK,IAAI;YACP,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,EAAE,CAAC,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,CAAC,CAAA;AACzD,UAAA,KAAK,IAAI;YACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;AAC5D,UAAA,KAAK,GAAG;AACN,YAAA,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,CAAC,CAAA;AAC1B,UAAA,KAAK,IAAI;YACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,EAAE,CAAC,CAAC,CAAA;AAC7B;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO2B,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,QAAQ;AAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;AAAO,aAAC,CAAC,CAAA;AACrE,UAAA,KAAK,IAAI;AACP;AACA,YAAA,OAAO/gB,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,OAAO;AAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;AAAO,aAAC,CAAC,CAAA;AACpE,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAO/gB,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,QAAQ;AAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;AAAO,aAAC,CAAC,CAAA;AACrE,UAAA,KAAK,MAAM;AACT;YACA,OAAO/Y,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;AAAEG,cAAAA,MAAM,EAAE,OAAO;AAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;AAAO,aAAC,CAAC,CAAA;AAChF,UAAA,KAAK,OAAO;AACV;YACA,OAAOmH,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;AAAEG,cAAAA,MAAM,EAAE,MAAM;AAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;AAAO,aAAC,CAAC,CAAA;AAC/E;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOmH,EAAE,CAACvG,QAAQ,CAAA;AACpB;AACA,UAAA,KAAK,GAAG;YACN,OAAOwf,QAAQ,EAAE,CAAA;AACnB;AACA,UAAA,KAAK,GAAG;YACN,OAAOJ,oBAAoB,GAAG1H,MAAM,CAAC;AAAErb,cAAAA,GAAG,EAAE,SAAA;aAAW,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,CAAC,CAAA;AACpF,UAAA,KAAK,IAAI;YACP,OAAO+iB,oBAAoB,GAAG1H,MAAM,CAAC;AAAErb,cAAAA,GAAG,EAAE,SAAA;AAAU,aAAC,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,EAAE,CAAC,CAAC,CAAA;AACvF;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAOkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;AAC/B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;AAC9B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AAChC;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO+F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;AAChC,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC/B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;AACjC;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAO4iB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEtb,cAAAA,KAAK,EAAE,SAAS;AAAEC,cAAAA,GAAG,EAAE,SAAA;aAAW,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;AACxB,UAAA,KAAK,IAAI;AACP;YACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEtb,cAAAA,KAAK,EAAE,SAAS;AAAEC,cAAAA,GAAG,EAAE,SAAA;AAAU,aAAC,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;AAC3B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;AAC7B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;AAC5B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AAC9B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEtb,cAAAA,KAAK,EAAE,SAAA;aAAW,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;AACxB,UAAA,KAAK,IAAI;AACP;YACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEtb,cAAAA,KAAK,EAAE,SAAA;AAAU,aAAC,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;AAC3B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;AAC9B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC7B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOgjB,oBAAoB,GAAG1H,MAAM,CAAC;AAAEvb,cAAAA,IAAI,EAAE,SAAA;aAAW,EAAE,MAAM,CAAC,GAAGoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC,CAAA;AACvF,UAAA,KAAK,IAAI;AACP;YACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEvb,cAAAA,IAAI,EAAE,SAAA;aAAW,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC2R,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/C,UAAA,KAAK,MAAM;AACT;YACA,OAAON,oBAAoB,GACvB1H,MAAM,CAAC;AAAEvb,cAAAA,IAAI,EAAE,SAAA;AAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;AAC1B,UAAA,KAAK,QAAQ;AACX;YACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;AAAEvb,cAAAA,IAAI,EAAE,SAAA;AAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;AAC1B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOiE,GAAG,CAAC,OAAO,CAAC,CAAA;AACrB,UAAA,KAAK,IAAI;AACP;YACA,OAAOA,GAAG,CAAC,MAAM,CAAC,CAAA;AACpB,UAAA,KAAK,OAAO;YACV,OAAOA,GAAG,CAAC,QAAQ,CAAC,CAAA;AACtB,UAAA,KAAK,IAAI;AACP,YAAA,OAAOmC,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,CAACxF,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACtD,UAAA,KAAK,MAAM;YACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,EAAE,CAAC,CAAC,CAAA;AACjC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO/Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,CAAC,CAAA;AAChC,UAAA,KAAK,IAAI;YACP,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,EAAE,CAAC,CAAC,CAAA;AACnC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,CAAC,CAAA;AACrC,UAAA,KAAK,IAAI;YACP,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,EAAE,CAAC,CAAC,CAAA;AACxC,UAAA,KAAK,IAAI;AACP,YAAA,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,CAAC3G,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC3D,UAAA,KAAK,MAAM;YACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,EAAE,CAAC,CAAC,CAAA;AACtC,UAAA,KAAK,GAAG;AACN,YAAA,OAAOlS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;YACR,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,EAAE,CAAC,CAAC,CAAA;AAChC,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,IAAI;AACP;YACA,OAAOpd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,EAAE,CAAC,CAAC,CAAA;AAChC,UAAA,KAAK,GAAG;AACN,YAAA,OAAOpd,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAAClI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;AAC3C,UAAA,KAAK,GAAG;AACN,YAAA,OAAOkE,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClI,EAAE,CAAC,CAAA;AACxB,UAAA;YACE,OAAOohB,UAAU,CAACpD,KAAK,CAAC,CAAA;AAC5B,SAAA;OACD,CAAA;IAEH,OAAOP,eAAe,CAAC8B,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9B,aAAa,CAAC,CAAA;GAClE,CAAA;EAAA9d,MAAA,CAED0hB,wBAAwB,GAAxB,SAAAA,yBAAyBC,GAAG,EAAE/B,GAAG,EAAE;AAAA,IAAA,IAAA7R,MAAA,GAAA,IAAA,CAAA;AACjC,IAAA,IAAM6T,aAAa,GAAG,IAAI,CAACxhB,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AAC3E,IAAA,IAAMC,YAAY,GAAG,SAAfA,YAAYA,CAAI3D,KAAK,EAAK;QAC5B,QAAQA,KAAK,CAAC,CAAC,CAAC;AACd,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,cAAc,CAAA;AACvB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,SAAS,CAAA;AAClB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,SAAS,CAAA;AAClB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,MAAM,CAAA;AACf,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,QAAQ,CAAA;AACjB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA;AACE,YAAA,OAAO,IAAI,CAAA;AACf,SAAA;OACD;AACDL,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIiE,MAAM,EAAEC,IAAI,EAAA;QAAA,OAAK,UAAC7D,KAAK,EAAK;AAC3C,UAAA,IAAM8D,MAAM,GAAGH,YAAY,CAAC3D,KAAK,CAAC,CAAA;AAClC,UAAA,IAAI8D,MAAM,EAAE;AACV,YAAA,IAAMC,eAAe,GACnBF,IAAI,CAACG,kBAAkB,IAAIF,MAAM,KAAKD,IAAI,CAACI,WAAW,GAAGR,aAAa,GAAG,CAAC,CAAA;AAC5E,YAAA,IAAIb,WAAW,CAAA;AACf,YAAA,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,IAAII,MAAM,KAAKD,IAAI,CAACI,WAAW,EAAE;AAC/ErB,cAAAA,WAAW,GAAG,OAAO,CAAA;aACtB,MAAM,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,KAAK,EAAE;AACvCd,cAAAA,WAAW,GAAG,QAAQ,CAAA;AACxB,aAAC,MAAM;AACL;AACAA,cAAAA,WAAW,GAAG,MAAM,CAAA;AACtB,aAAA;AACA,YAAA,OAAOhT,MAAI,CAAC8S,GAAG,CAACkB,MAAM,CAACnhB,GAAG,CAACqhB,MAAM,CAAC,GAAGC,eAAe,EAAE/D,KAAK,CAAC7a,MAAM,EAAEyd,WAAW,CAAC,CAAA;AAClF,WAAC,MAAM;AACL,YAAA,OAAO5C,KAAK,CAAA;AACd,WAAA;SACD,CAAA;AAAA,OAAA;AACDkE,MAAAA,MAAM,GAAG3C,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC;MACnC0C,UAAU,GAAGD,MAAM,CAACjK,MAAM,CACxB,UAACmK,KAAK,EAAAthB,IAAA,EAAA;AAAA,QAAA,IAAImd,OAAO,GAAAnd,IAAA,CAAPmd,OAAO;UAAEC,GAAG,GAAApd,IAAA,CAAHod,GAAG,CAAA;QAAA,OAAQD,OAAO,GAAGmE,KAAK,GAAGA,KAAK,CAACrG,MAAM,CAACmC,GAAG,CAAC,CAAA;OAAC,EAClE,EACF,CAAC;AACDmE,MAAAA,SAAS,GAAGb,GAAG,CAACc,OAAO,CAAAlmB,KAAA,CAAXolB,GAAG,EAAYW,UAAU,CAAC5X,GAAG,CAACoX,YAAY,CAAC,CAACY,MAAM,CAAC,UAACjP,CAAC,EAAA;AAAA,QAAA,OAAKA,CAAC,CAAA;AAAA,OAAA,CAAC,CAAC;AACzEkP,MAAAA,YAAY,GAAG;QACbR,kBAAkB,EAAEK,SAAS,GAAG,CAAC;AACjC;AACA;QACAJ,WAAW,EAAE3Y,MAAM,CAACC,IAAI,CAAC8Y,SAAS,CAACI,MAAM,CAAC,CAAC,CAAC,CAAA;OAC7C,CAAA;IACH,OAAOhF,eAAe,CAACyE,MAAM,EAAEvE,aAAa,CAAC0E,SAAS,EAAEG,YAAY,CAAC,CAAC,CAAA;GACvE,CAAA;AAAA,EAAA,OAAAjD,SAAA,CAAA;AAAA,CAAA,EAAA;;ACpaH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,IAAMmD,SAAS,GAAG,8EAA8E,CAAA;AAEhG,SAASC,cAAcA,GAAa;AAAA,EAAA,KAAA,IAAAC,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAT0f,OAAO,GAAAlL,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;AAAPD,IAAAA,OAAO,CAAAC,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;AAAA,GAAA;EAChC,IAAMC,IAAI,GAAGF,OAAO,CAAC5K,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;AAAA,IAAA,OAAK9H,CAAC,GAAG8H,CAAC,CAACkT,MAAM,CAAA;AAAA,GAAA,EAAE,EAAE,CAAC,CAAA;AACvD,EAAA,OAAOhQ,MAAM,CAAA,GAAA,GAAK+P,IAAI,GAAA,GAAG,CAAC,CAAA;AAC5B,CAAA;AAEA,SAASE,iBAAiBA,GAAgB;AAAA,EAAA,KAAA,IAAAC,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAZggB,UAAU,GAAAxL,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;AAAVD,IAAAA,UAAU,CAAAC,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;AAAA,GAAA;AACtC,EAAA,OAAO,UAACvU,CAAC,EAAA;IAAA,OACPsU,UAAU,CACPlL,MAAM,CACL,UAAAnX,IAAA,EAAmCuiB,EAAE,EAAK;MAAA,IAAxCC,UAAU,GAAAxiB,IAAA,CAAA,CAAA,CAAA;AAAEyiB,QAAAA,UAAU,GAAAziB,IAAA,CAAA,CAAA,CAAA;AAAE0iB,QAAAA,MAAM,GAAA1iB,IAAA,CAAA,CAAA,CAAA,CAAA;AAC9B,MAAA,IAAA2iB,GAAA,GAA0BJ,EAAE,CAACxU,CAAC,EAAE2U,MAAM,CAAC;AAAhCtF,QAAAA,GAAG,GAAAuF,GAAA,CAAA,CAAA,CAAA;AAAE7f,QAAAA,IAAI,GAAA6f,GAAA,CAAA,CAAA,CAAA;AAAEtL,QAAAA,IAAI,GAAAsL,GAAA,CAAA,CAAA,CAAA,CAAA;AACtB,MAAA,OAAO,CAAA3c,QAAA,CAAMwc,EAAAA,EAAAA,UAAU,EAAKpF,GAAG,CAAIta,EAAAA,IAAI,IAAI2f,UAAU,EAAEpL,IAAI,CAAC,CAAA;AAC9D,KAAC,EACD,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CACd,CAAC,CACAkJ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAAA,GAAA,CAAA;AAClB,CAAA;AAEA,SAASqC,KAAKA,CAAC/lB,CAAC,EAAe;EAC7B,IAAIA,CAAC,IAAI,IAAI,EAAE;AACb,IAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACrB,GAAA;EAAC,KAAAgmB,IAAAA,KAAA,GAAAtnB,SAAA,CAAA8G,MAAA,EAHkBygB,QAAQ,OAAAjM,KAAA,CAAAgM,KAAA,GAAAA,CAAAA,GAAAA,KAAA,WAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;AAARD,IAAAA,QAAQ,CAAAC,KAAA,GAAAxnB,CAAAA,CAAAA,GAAAA,SAAA,CAAAwnB,KAAA,CAAA,CAAA;AAAA,GAAA;AAK3B,EAAA,KAAA,IAAAC,EAAA,GAAA,CAAA,EAAAC,SAAA,GAAiCH,QAAQ,EAAAE,EAAA,GAAAC,SAAA,CAAA5gB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;AAAtC,IAAA,IAAAE,YAAA,GAAAD,SAAA,CAAAD,EAAA,CAAA;AAAO/Q,MAAAA,KAAK,GAAAiR,YAAA,CAAA,CAAA,CAAA;AAAEC,MAAAA,SAAS,GAAAD,YAAA,CAAA,CAAA,CAAA,CAAA;AAC1B,IAAA,IAAMnV,CAAC,GAAGkE,KAAK,CAACxQ,IAAI,CAAC5E,CAAC,CAAC,CAAA;AACvB,IAAA,IAAIkR,CAAC,EAAE;MACL,OAAOoV,SAAS,CAACpV,CAAC,CAAC,CAAA;AACrB,KAAA;AACF,GAAA;AACA,EAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACrB,CAAA;AAEA,SAASqV,WAAWA,GAAU;AAAA,EAAA,KAAA,IAAAC,KAAA,GAAA9nB,SAAA,CAAA8G,MAAA,EAANoG,IAAI,GAAAoO,IAAAA,KAAA,CAAAwM,KAAA,GAAAC,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA,EAAA,EAAA;AAAJ7a,IAAAA,IAAI,CAAA6a,KAAA,CAAA/nB,GAAAA,SAAA,CAAA+nB,KAAA,CAAA,CAAA;AAAA,GAAA;AAC1B,EAAA,OAAO,UAACrU,KAAK,EAAEyT,MAAM,EAAK;IACxB,IAAMa,GAAG,GAAG,EAAE,CAAA;AACd,IAAA,IAAInhB,CAAC,CAAA;AAEL,IAAA,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqG,IAAI,CAACpG,MAAM,EAAED,CAAC,EAAE,EAAE;AAChCmhB,MAAAA,GAAG,CAAC9a,IAAI,CAACrG,CAAC,CAAC,CAAC,GAAGkW,YAAY,CAACrJ,KAAK,CAACyT,MAAM,GAAGtgB,CAAC,CAAC,CAAC,CAAA;AAChD,KAAA;IACA,OAAO,CAACmhB,GAAG,EAAE,IAAI,EAAEb,MAAM,GAAGtgB,CAAC,CAAC,CAAA;GAC/B,CAAA;AACH,CAAA;;AAEA;AACA,IAAMohB,WAAW,GAAG,oCAAoC,CAAA;AACxD,IAAMC,eAAe,WAASD,WAAW,CAACtB,MAAM,GAAWN,UAAAA,GAAAA,SAAS,CAACM,MAAM,GAAU,UAAA,CAAA;AACrF,IAAMwB,gBAAgB,GAAG,qDAAqD,CAAA;AAC9E,IAAMC,YAAY,GAAGzR,MAAM,CAAA,EAAA,GAAIwR,gBAAgB,CAACxB,MAAM,GAAGuB,eAAiB,CAAC,CAAA;AAC3E,IAAMG,qBAAqB,GAAG1R,MAAM,CAAA,SAAA,GAAWyR,YAAY,CAACzB,MAAM,OAAI,CAAC,CAAA;AACvE,IAAM2B,WAAW,GAAG,6CAA6C,CAAA;AACjE,IAAMC,YAAY,GAAG,6BAA6B,CAAA;AAClD,IAAMC,eAAe,GAAG,kBAAkB,CAAA;AAC1C,IAAMC,kBAAkB,GAAGZ,WAAW,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAA;AAC3E,IAAMa,qBAAqB,GAAGb,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;AAC5D,IAAMc,WAAW,GAAG,uBAAuB,CAAC;AAC5C,IAAMC,YAAY,GAAGjS,MAAM,CACtBwR,gBAAgB,CAACxB,MAAM,GAAA,OAAA,GAAQsB,WAAW,CAACtB,MAAM,GAAKN,IAAAA,GAAAA,SAAS,CAACM,MAAM,QAC3E,CAAC,CAAA;AACD,IAAMkC,qBAAqB,GAAGlS,MAAM,CAAA,MAAA,GAAQiS,YAAY,CAACjC,MAAM,OAAI,CAAC,CAAA;AAEpE,SAASmC,GAAGA,CAACpV,KAAK,EAAEzM,GAAG,EAAE8hB,QAAQ,EAAE;AACjC,EAAA,IAAMvW,CAAC,GAAGkB,KAAK,CAACzM,GAAG,CAAC,CAAA;EACpB,OAAOC,WAAW,CAACsL,CAAC,CAAC,GAAGuW,QAAQ,GAAGhM,YAAY,CAACvK,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,SAASwW,aAAaA,CAACtV,KAAK,EAAEyT,MAAM,EAAE;AACpC,EAAA,IAAM8B,IAAI,GAAG;AACXxnB,IAAAA,IAAI,EAAEqnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,CAAC;IACxBzlB,KAAK,EAAEonB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAChCxlB,GAAG,EAAEmnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;GAC9B,CAAA;EAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;AACjC,CAAA;AAEA,SAAS+B,cAAcA,CAACxV,KAAK,EAAEyT,MAAM,EAAE;AACrC,EAAA,IAAM8B,IAAI,GAAG;IACX5J,KAAK,EAAEyJ,GAAG,CAACpV,KAAK,EAAEyT,MAAM,EAAE,CAAC,CAAC;IAC5BnZ,OAAO,EAAE8a,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAClCvG,OAAO,EAAEkI,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAClCgC,YAAY,EAAEhM,WAAW,CAACzJ,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAA;GAC5C,CAAA;EAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;AACjC,CAAA;AAEA,SAASiC,gBAAgBA,CAAC1V,KAAK,EAAEyT,MAAM,EAAE;AACvC,EAAA,IAAMkC,KAAK,GAAG,CAAC3V,KAAK,CAACyT,MAAM,CAAC,IAAI,CAACzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC;AAChDmC,IAAAA,UAAU,GAAG3V,YAAY,CAACD,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,EAAEzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/D5f,IAAI,GAAG8hB,KAAK,GAAG,IAAI,GAAGhW,eAAe,CAACC,QAAQ,CAACgW,UAAU,CAAC,CAAA;EAC5D,OAAO,CAAC,EAAE,EAAE/hB,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAA;AAEA,SAASoC,eAAeA,CAAC7V,KAAK,EAAEyT,MAAM,EAAE;AACtC,EAAA,IAAM5f,IAAI,GAAGmM,KAAK,CAACyT,MAAM,CAAC,GAAG9f,QAAQ,CAACC,MAAM,CAACoM,KAAK,CAACyT,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;EAClE,OAAO,CAAC,EAAE,EAAE5f,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAA;;AAEA;;AAEA,IAAMqC,WAAW,GAAG7S,MAAM,CAAA,KAAA,GAAOwR,gBAAgB,CAACxB,MAAM,MAAG,CAAC,CAAA;;AAE5D;;AAEA,IAAM8C,WAAW,GACf,8PAA8P,CAAA;AAEhQ,SAASC,kBAAkBA,CAAChW,KAAK,EAAE;EACjC,IAAOpS,CAAC,GACNoS,KAAK,CAAA,CAAA,CAAA;AADGiW,IAAAA,OAAO,GACfjW,KAAK,CAAA,CAAA,CAAA;AADYkW,IAAAA,QAAQ,GACzBlW,KAAK,CAAA,CAAA,CAAA;AADsBmW,IAAAA,OAAO,GAClCnW,KAAK,CAAA,CAAA,CAAA;AAD+BoW,IAAAA,MAAM,GAC1CpW,KAAK,CAAA,CAAA,CAAA;AADuCqW,IAAAA,OAAO,GACnDrW,KAAK,CAAA,CAAA,CAAA;AADgDsW,IAAAA,SAAS,GAC9DtW,KAAK,CAAA,CAAA,CAAA;AAD2DuW,IAAAA,SAAS,GACzEvW,KAAK,CAAA,CAAA,CAAA;AADsEwW,IAAAA,eAAe,GAC1FxW,KAAK,CAAA,CAAA,CAAA,CAAA;AAEP,EAAA,IAAMyW,iBAAiB,GAAG7oB,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;EACtC,IAAM8oB,eAAe,GAAGH,SAAS,IAAIA,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;AAEzD,EAAA,IAAMI,WAAW,GAAG,SAAdA,WAAWA,CAAIhG,GAAG,EAAEiG,KAAK,EAAA;AAAA,IAAA,IAALA,KAAK,KAAA,KAAA,CAAA,EAAA;AAALA,MAAAA,KAAK,GAAG,KAAK,CAAA;AAAA,KAAA;AAAA,IAAA,OACrCjG,GAAG,KAAK7e,SAAS,KAAK8kB,KAAK,IAAKjG,GAAG,IAAI8F,iBAAkB,CAAC,GAAG,CAAC9F,GAAG,GAAGA,GAAG,CAAA;AAAA,GAAA,CAAA;AAEzE,EAAA,OAAO,CACL;AACE7D,IAAAA,KAAK,EAAE6J,WAAW,CAACpN,aAAa,CAAC0M,OAAO,CAAC,CAAC;AAC1CrY,IAAAA,MAAM,EAAE+Y,WAAW,CAACpN,aAAa,CAAC2M,QAAQ,CAAC,CAAC;AAC5ClJ,IAAAA,KAAK,EAAE2J,WAAW,CAACpN,aAAa,CAAC4M,OAAO,CAAC,CAAC;AAC1ClJ,IAAAA,IAAI,EAAE0J,WAAW,CAACpN,aAAa,CAAC6M,MAAM,CAAC,CAAC;AACxCzK,IAAAA,KAAK,EAAEgL,WAAW,CAACpN,aAAa,CAAC8M,OAAO,CAAC,CAAC;AAC1C/b,IAAAA,OAAO,EAAEqc,WAAW,CAACpN,aAAa,CAAC+M,SAAS,CAAC,CAAC;IAC9CpJ,OAAO,EAAEyJ,WAAW,CAACpN,aAAa,CAACgN,SAAS,CAAC,EAAEA,SAAS,KAAK,IAAI,CAAC;IAClEd,YAAY,EAAEkB,WAAW,CAAClN,WAAW,CAAC+M,eAAe,CAAC,EAAEE,eAAe,CAAA;AACzE,GAAC,CACF,CAAA;AACH,CAAA;;AAEA;AACA;AACA;AACA,IAAMG,UAAU,GAAG;AACjBC,EAAAA,GAAG,EAAE,CAAC;AACNC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAA;AACZ,CAAC,CAAA;AAED,SAASC,WAAWA,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAE;AACzF,EAAA,IAAMkB,MAAM,GAAG;AACb1pB,IAAAA,IAAI,EAAEkoB,OAAO,CAAC7iB,MAAM,KAAK,CAAC,GAAGsX,cAAc,CAACrB,YAAY,CAAC4M,OAAO,CAAC,CAAC,GAAG5M,YAAY,CAAC4M,OAAO,CAAC;IAC1FjoB,KAAK,EAAEoN,WAAmB,CAAChE,OAAO,CAAC8e,QAAQ,CAAC,GAAG,CAAC;AAChDjoB,IAAAA,GAAG,EAAEob,YAAY,CAAC+M,MAAM,CAAC;AACzB5nB,IAAAA,IAAI,EAAE6a,YAAY,CAACgN,OAAO,CAAC;IAC3B5nB,MAAM,EAAE4a,YAAY,CAACiN,SAAS,CAAA;GAC/B,CAAA;EAED,IAAIC,SAAS,EAAEkB,MAAM,CAAC9oB,MAAM,GAAG0a,YAAY,CAACkN,SAAS,CAAC,CAAA;AACtD,EAAA,IAAIiB,UAAU,EAAE;AACdC,IAAAA,MAAM,CAACrpB,OAAO,GACZopB,UAAU,CAACpkB,MAAM,GAAG,CAAC,GACjBgI,YAAoB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,GAC5Cpc,aAAqB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,CAAA;AACrD,GAAA;AAEA,EAAA,OAAOC,MAAM,CAAA;AACf,CAAA;;AAEA;AACA,IAAMC,OAAO,GACX,iMAAiM,CAAA;AAEnM,SAASC,cAAcA,CAAC3X,KAAK,EAAE;EAC7B,IAEIwX,UAAU,GAWRxX,KAAK,CAAA,CAAA,CAAA;AAVPoW,IAAAA,MAAM,GAUJpW,KAAK,CAAA,CAAA,CAAA;AATPkW,IAAAA,QAAQ,GASNlW,KAAK,CAAA,CAAA,CAAA;AARPiW,IAAAA,OAAO,GAQLjW,KAAK,CAAA,CAAA,CAAA;AAPPqW,IAAAA,OAAO,GAOLrW,KAAK,CAAA,CAAA,CAAA;AANPsW,IAAAA,SAAS,GAMPtW,KAAK,CAAA,CAAA,CAAA;AALPuW,IAAAA,SAAS,GAKPvW,KAAK,CAAA,CAAA,CAAA;AAJP4X,IAAAA,SAAS,GAIP5X,KAAK,CAAA,CAAA,CAAA;AAHP6X,IAAAA,SAAS,GAGP7X,KAAK,CAAA,CAAA,CAAA;AAFP6K,IAAAA,UAAU,GAER7K,KAAK,CAAA,EAAA,CAAA;AADP8K,IAAAA,YAAY,GACV9K,KAAK,CAAA,EAAA,CAAA;AACTyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAE5F,EAAA,IAAIlmB,MAAM,CAAA;AACV,EAAA,IAAIunB,SAAS,EAAE;AACbvnB,IAAAA,MAAM,GAAGwmB,UAAU,CAACe,SAAS,CAAC,CAAA;GAC/B,MAAM,IAAIC,SAAS,EAAE;AACpBxnB,IAAAA,MAAM,GAAG,CAAC,CAAA;AACZ,GAAC,MAAM;AACLA,IAAAA,MAAM,GAAG4P,YAAY,CAAC4K,UAAU,EAAEC,YAAY,CAAC,CAAA;AACjD,GAAA;EAEA,OAAO,CAAC2M,MAAM,EAAE,IAAI9X,eAAe,CAACtP,MAAM,CAAC,CAAC,CAAA;AAC9C,CAAA;AAEA,SAASynB,iBAAiBA,CAAClqB,CAAC,EAAE;AAC5B;AACA,EAAA,OAAOA,CAAC,CACL0E,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAClCA,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CACxBylB,IAAI,EAAE,CAAA;AACX,CAAA;;AAEA;;AAEA,IAAMC,OAAO,GACT,4HAA4H;AAC9HC,EAAAA,MAAM,GACJ,wJAAwJ;AAC1JC,EAAAA,KAAK,GACH,2HAA2H,CAAA;AAE/H,SAASC,mBAAmBA,CAACnY,KAAK,EAAE;EAClC,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;AAAjEoW,IAAAA,MAAM,GAAsDpW,KAAK,CAAA,CAAA,CAAA;AAAzDkW,IAAAA,QAAQ,GAA4ClW,KAAK,CAAA,CAAA,CAAA;AAA/CiW,IAAAA,OAAO,GAAmCjW,KAAK,CAAA,CAAA,CAAA;AAAtCqW,IAAAA,OAAO,GAA0BrW,KAAK,CAAA,CAAA,CAAA;AAA7BsW,IAAAA,SAAS,GAAetW,KAAK,CAAA,CAAA,CAAA;AAAlBuW,IAAAA,SAAS,GAAIvW,KAAK,CAAA,CAAA,CAAA;AACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;AAC9C,CAAA;AAEA,SAASuY,YAAYA,CAACpY,KAAK,EAAE;EAC3B,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;AAAjEkW,IAAAA,QAAQ,GAAoDlW,KAAK,CAAA,CAAA,CAAA;AAAvDoW,IAAAA,MAAM,GAA4CpW,KAAK,CAAA,CAAA,CAAA;AAA/CqW,IAAAA,OAAO,GAAmCrW,KAAK,CAAA,CAAA,CAAA;AAAtCsW,IAAAA,SAAS,GAAwBtW,KAAK,CAAA,CAAA,CAAA;AAA3BuW,IAAAA,SAAS,GAAavW,KAAK,CAAA,CAAA,CAAA;AAAhBiW,IAAAA,OAAO,GAAIjW,KAAK,CAAA,CAAA,CAAA;AACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;AAC9C,CAAA;AAEA,IAAMwY,4BAA4B,GAAGzF,cAAc,CAACgC,WAAW,EAAED,qBAAqB,CAAC,CAAA;AACvF,IAAM2D,6BAA6B,GAAG1F,cAAc,CAACiC,YAAY,EAAEF,qBAAqB,CAAC,CAAA;AACzF,IAAM4D,gCAAgC,GAAG3F,cAAc,CAACkC,eAAe,EAAEH,qBAAqB,CAAC,CAAA;AAC/F,IAAM6D,oBAAoB,GAAG5F,cAAc,CAAC8B,YAAY,CAAC,CAAA;AAEzD,IAAM+D,0BAA0B,GAAGvF,iBAAiB,CAClDoC,aAAa,EACbE,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,IAAM6C,2BAA2B,GAAGxF,iBAAiB,CACnD6B,kBAAkB,EAClBS,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,IAAM8C,4BAA4B,GAAGzF,iBAAiB,CACpD8B,qBAAqB,EACrBQ,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,IAAM+C,uBAAuB,GAAG1F,iBAAiB,CAC/CsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;;AAED;AACA;AACA;;AAEO,SAASgD,YAAYA,CAACjrB,CAAC,EAAE;EAC9B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACyqB,4BAA4B,EAAEI,0BAA0B,CAAC,EAC1D,CAACH,6BAA6B,EAAEI,2BAA2B,CAAC,EAC5D,CAACH,gCAAgC,EAAEI,4BAA4B,CAAC,EAChE,CAACH,oBAAoB,EAAEI,uBAAuB,CAChD,CAAC,CAAA;AACH,CAAA;AAEO,SAASE,gBAAgBA,CAAClrB,CAAC,EAAE;AAClC,EAAA,OAAO+lB,KAAK,CAACmE,iBAAiB,CAAClqB,CAAC,CAAC,EAAE,CAAC8pB,OAAO,EAAEC,cAAc,CAAC,CAAC,CAAA;AAC/D,CAAA;AAEO,SAASoB,aAAaA,CAACnrB,CAAC,EAAE;EAC/B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACoqB,OAAO,EAAEG,mBAAmB,CAAC,EAC9B,CAACF,MAAM,EAAEE,mBAAmB,CAAC,EAC7B,CAACD,KAAK,EAAEE,YAAY,CACtB,CAAC,CAAA;AACH,CAAA;AAEO,SAASY,gBAAgBA,CAACprB,CAAC,EAAE;EAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACmoB,WAAW,EAAEC,kBAAkB,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,IAAMiD,kBAAkB,GAAG/F,iBAAiB,CAACsC,cAAc,CAAC,CAAA;AAErD,SAAS0D,gBAAgBA,CAACtrB,CAAC,EAAE;EAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACkoB,WAAW,EAAEmD,kBAAkB,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,IAAME,4BAA4B,GAAGvG,cAAc,CAACqC,WAAW,EAAEE,qBAAqB,CAAC,CAAA;AACvF,IAAMiE,oBAAoB,GAAGxG,cAAc,CAACsC,YAAY,CAAC,CAAA;AAEzD,IAAMmE,+BAA+B,GAAGnG,iBAAiB,CACvDsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AAEM,SAASyD,QAAQA,CAAC1rB,CAAC,EAAE;AAC1B,EAAA,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACurB,4BAA4B,EAAEV,0BAA0B,CAAC,EAC1D,CAACW,oBAAoB,EAAEC,+BAA+B,CACxD,CAAC,CAAA;AACH;;AC9TA,IAAME,SAAO,GAAG,kBAAkB,CAAA;;AAElC;AACO,IAAMC,cAAc,GAAG;AAC1BxM,IAAAA,KAAK,EAAE;AACLC,MAAAA,IAAI,EAAE,CAAC;MACPtB,KAAK,EAAE,CAAC,GAAG,EAAE;AACbrR,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE;AACpB4S,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MACzBuI,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KAClC;AACDxI,IAAAA,IAAI,EAAE;AACJtB,MAAAA,KAAK,EAAE,EAAE;MACTrR,OAAO,EAAE,EAAE,GAAG,EAAE;AAChB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrBuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KAC9B;AACD9J,IAAAA,KAAK,EAAE;AAAErR,MAAAA,OAAO,EAAE,EAAE;MAAE4S,OAAO,EAAE,EAAE,GAAG,EAAE;AAAEuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,IAAA;KAAM;AACtEnb,IAAAA,OAAO,EAAE;AAAE4S,MAAAA,OAAO,EAAE,EAAE;MAAEuI,YAAY,EAAE,EAAE,GAAG,IAAA;KAAM;AACjDvI,IAAAA,OAAO,EAAE;AAAEuI,MAAAA,YAAY,EAAE,IAAA;AAAK,KAAA;GAC/B;AACDgE,EAAAA,YAAY,GAAA1iB,QAAA,CAAA;AACV+V,IAAAA,KAAK,EAAE;AACLC,MAAAA,QAAQ,EAAE,CAAC;AACXnP,MAAAA,MAAM,EAAE,EAAE;AACVoP,MAAAA,KAAK,EAAE,EAAE;AACTC,MAAAA,IAAI,EAAE,GAAG;MACTtB,KAAK,EAAE,GAAG,GAAG,EAAE;AACfrR,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE;AACtB4S,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC3BuI,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACpC;AACD1I,IAAAA,QAAQ,EAAE;AACRnP,MAAAA,MAAM,EAAE,CAAC;AACToP,MAAAA,KAAK,EAAE,EAAE;AACTC,MAAAA,IAAI,EAAE,EAAE;MACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;AACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACnC;AACD7X,IAAAA,MAAM,EAAE;AACNoP,MAAAA,KAAK,EAAE,CAAC;AACRC,MAAAA,IAAI,EAAE,EAAE;MACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;AACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;AACpC,KAAA;AAAC,GAAA,EAEE+D,cAAc,CAClB;EACDE,kBAAkB,GAAG,QAAQ,GAAG,GAAG;EACnCC,mBAAmB,GAAG,QAAQ,GAAG,IAAI;AACrCC,EAAAA,cAAc,GAAA7iB,QAAA,CAAA;AACZ+V,IAAAA,KAAK,EAAE;AACLC,MAAAA,QAAQ,EAAE,CAAC;AACXnP,MAAAA,MAAM,EAAE,EAAE;MACVoP,KAAK,EAAE0M,kBAAkB,GAAG,CAAC;AAC7BzM,MAAAA,IAAI,EAAEyM,kBAAkB;MACxB/N,KAAK,EAAE+N,kBAAkB,GAAG,EAAE;AAC9Bpf,MAAAA,OAAO,EAAEof,kBAAkB,GAAG,EAAE,GAAG,EAAE;AACrCxM,MAAAA,OAAO,EAAEwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1CjE,YAAY,EAAEiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACnD;AACD3M,IAAAA,QAAQ,EAAE;AACRnP,MAAAA,MAAM,EAAE,CAAC;MACToP,KAAK,EAAE0M,kBAAkB,GAAG,EAAE;MAC9BzM,IAAI,EAAEyM,kBAAkB,GAAG,CAAC;AAC5B/N,MAAAA,KAAK,EAAG+N,kBAAkB,GAAG,EAAE,GAAI,CAAC;AACpCpf,MAAAA,OAAO,EAAGof,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;MAC3CxM,OAAO,EAAGwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;MAChDjE,YAAY,EAAGiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,GAAI,CAAA;KAC5D;AACD9b,IAAAA,MAAM,EAAE;MACNoP,KAAK,EAAE2M,mBAAmB,GAAG,CAAC;AAC9B1M,MAAAA,IAAI,EAAE0M,mBAAmB;MACzBhO,KAAK,EAAEgO,mBAAmB,GAAG,EAAE;AAC/Brf,MAAAA,OAAO,EAAEqf,mBAAmB,GAAG,EAAE,GAAG,EAAE;AACtCzM,MAAAA,OAAO,EAAEyM,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC3ClE,YAAY,EAAEkE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;AACrD,KAAA;AAAC,GAAA,EACEH,cAAc,CAClB,CAAA;;AAEH;AACA,IAAMK,cAAY,GAAG,CACnB,OAAO,EACP,UAAU,EACV,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cAAc,CACf,CAAA;AAED,IAAMC,YAAY,GAAGD,cAAY,CAACvI,KAAK,CAAC,CAAC,CAAC,CAACyI,OAAO,EAAE,CAAA;;AAEpD;AACA,SAASxc,OAAKA,CAACkU,GAAG,EAAEjU,IAAI,EAAEzJ,KAAK,EAAU;AAAA,EAAA,IAAfA,KAAK,KAAA,KAAA,CAAA,EAAA;AAALA,IAAAA,KAAK,GAAG,KAAK,CAAA;AAAA,GAAA;AACrC;AACA,EAAA,IAAMimB,IAAI,GAAG;AACXtH,IAAAA,MAAM,EAAE3e,KAAK,GAAGyJ,IAAI,CAACkV,MAAM,GAAA3b,QAAA,CAAA,EAAA,EAAQ0a,GAAG,CAACiB,MAAM,EAAMlV,IAAI,CAACkV,MAAM,IAAI,EAAE,CAAG;IACvEja,GAAG,EAAEgZ,GAAG,CAAChZ,GAAG,CAAC8E,KAAK,CAACC,IAAI,CAAC/E,GAAG,CAAC;AAC5BwhB,IAAAA,kBAAkB,EAAEzc,IAAI,CAACyc,kBAAkB,IAAIxI,GAAG,CAACwI,kBAAkB;AACrEC,IAAAA,MAAM,EAAE1c,IAAI,CAAC0c,MAAM,IAAIzI,GAAG,CAACyI,MAAAA;GAC5B,CAAA;AACD,EAAA,OAAO,IAAIC,QAAQ,CAACH,IAAI,CAAC,CAAA;AAC3B,CAAA;AAEA,SAASI,gBAAgBA,CAACF,MAAM,EAAEG,IAAI,EAAE;AAAA,EAAA,IAAAC,kBAAA,CAAA;EACtC,IAAIC,GAAG,GAAAD,CAAAA,kBAAA,GAAGD,IAAI,CAAC5E,YAAY,KAAA,IAAA,GAAA6E,kBAAA,GAAI,CAAC,CAAA;AAChC,EAAA,KAAA,IAAAzM,SAAA,GAAAC,+BAAA,CAAmBgM,YAAY,CAACxI,KAAK,CAAC,CAAC,CAAC,CAAA,EAAAvD,KAAA,EAAAA,CAAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;AAAA,IAAA,IAA/B1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;AACb,IAAA,IAAI+mB,IAAI,CAAC/sB,IAAI,CAAC,EAAE;AACditB,MAAAA,GAAG,IAAIF,IAAI,CAAC/sB,IAAI,CAAC,GAAG4sB,MAAM,CAAC5sB,IAAI,CAAC,CAAC,cAAc,CAAC,CAAA;AAClD,KAAA;AACF,GAAA;AACA,EAAA,OAAOitB,GAAG,CAAA;AACZ,CAAA;;AAEA;AACA,SAASC,eAAeA,CAACN,MAAM,EAAEG,IAAI,EAAE;AACrC;AACA;AACA,EAAA,IAAMvQ,MAAM,GAAGsQ,gBAAgB,CAACF,MAAM,EAAEG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AAE1DR,EAAAA,cAAY,CAACY,WAAW,CAAC,UAACC,QAAQ,EAAE/K,OAAO,EAAK;IAC9C,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;AAC/B,MAAA,IAAI+K,QAAQ,EAAE;AACZ,QAAA,IAAMC,WAAW,GAAGN,IAAI,CAACK,QAAQ,CAAC,GAAG5Q,MAAM,CAAA;QAC3C,IAAM8Q,IAAI,GAAGV,MAAM,CAACvK,OAAO,CAAC,CAAC+K,QAAQ,CAAC,CAAA;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;QACA,IAAMG,MAAM,GAAGpmB,IAAI,CAAC2E,KAAK,CAACuhB,WAAW,GAAGC,IAAI,CAAC,CAAA;AAC7CP,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIkL,MAAM,GAAG/Q,MAAM,CAAA;QAChCuQ,IAAI,CAACK,QAAQ,CAAC,IAAIG,MAAM,GAAGD,IAAI,GAAG9Q,MAAM,CAAA;AAC1C,OAAA;AACA,MAAA,OAAO6F,OAAO,CAAA;AAChB,KAAC,MAAM;AACL,MAAA,OAAO+K,QAAQ,CAAA;AACjB,KAAA;GACD,EAAE,IAAI,CAAC,CAAA;;AAER;AACA;AACAb,EAAAA,cAAY,CAAC3R,MAAM,CAAC,UAACwS,QAAQ,EAAE/K,OAAO,EAAK;IACzC,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;AAC/B,MAAA,IAAI+K,QAAQ,EAAE;AACZ,QAAA,IAAMhR,QAAQ,GAAG2Q,IAAI,CAACK,QAAQ,CAAC,GAAG,CAAC,CAAA;AACnCL,QAAAA,IAAI,CAACK,QAAQ,CAAC,IAAIhR,QAAQ,CAAA;AAC1B2Q,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIjG,QAAQ,GAAGwQ,MAAM,CAACQ,QAAQ,CAAC,CAAC/K,OAAO,CAAC,CAAA;AACvD,OAAA;AACA,MAAA,OAAOA,OAAO,CAAA;AAChB,KAAC,MAAM;AACL,MAAA,OAAO+K,QAAQ,CAAA;AACjB,KAAA;GACD,EAAE,IAAI,CAAC,CAAA;AACV,CAAA;;AAEA;AACA,SAASI,YAAYA,CAACT,IAAI,EAAE;EAC1B,IAAMU,OAAO,GAAG,EAAE,CAAA;AAClB,EAAA,KAAA,IAAAhH,EAAA,GAAAiH,CAAAA,EAAAA,eAAA,GAA2BzhB,MAAM,CAAC0hB,OAAO,CAACZ,IAAI,CAAC,EAAAtG,EAAA,GAAAiH,eAAA,CAAA5nB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;AAA5C,IAAA,IAAAmH,kBAAA,GAAAF,eAAA,CAAAjH,EAAA,CAAA;AAAOtjB,MAAAA,GAAG,GAAAyqB,kBAAA,CAAA,CAAA,CAAA;AAAE5nB,MAAAA,KAAK,GAAA4nB,kBAAA,CAAA,CAAA,CAAA,CAAA;IACpB,IAAI5nB,KAAK,KAAK,CAAC,EAAE;AACfynB,MAAAA,OAAO,CAACtqB,GAAG,CAAC,GAAG6C,KAAK,CAAA;AACtB,KAAA;AACF,GAAA;AACA,EAAA,OAAOynB,OAAO,CAAA;AAChB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACqBZ,IAAAA,QAAQ,0BAAAgB,WAAA,EAAA;AAC3B;AACF;AACA;EACE,SAAAhB,QAAAA,CAAYiB,MAAM,EAAE;IAClB,IAAMC,QAAQ,GAAGD,MAAM,CAACnB,kBAAkB,KAAK,UAAU,IAAI,KAAK,CAAA;AAClE,IAAA,IAAIC,MAAM,GAAGmB,QAAQ,GAAGzB,cAAc,GAAGH,YAAY,CAAA;IAErD,IAAI2B,MAAM,CAAClB,MAAM,EAAE;MACjBA,MAAM,GAAGkB,MAAM,CAAClB,MAAM,CAAA;AACxB,KAAA;;AAEA;AACJ;AACA;AACI,IAAA,IAAI,CAACxH,MAAM,GAAG0I,MAAM,CAAC1I,MAAM,CAAA;AAC3B;AACJ;AACA;IACI,IAAI,CAACja,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;AACxC;AACJ;AACA;AACI,IAAA,IAAI,CAACqmB,kBAAkB,GAAGoB,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAA;AAC1D;AACJ;AACA;AACI,IAAA,IAAI,CAACC,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;AACrC;AACJ;AACA;IACI,IAAI,CAACpB,MAAM,GAAGA,MAAM,CAAA;AACpB;AACJ;AACA;IACI,IAAI,CAACqB,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EAREpB,QAAA,CASOqB,UAAU,GAAjB,SAAAA,WAAkBrgB,KAAK,EAAEjL,IAAI,EAAE;IAC7B,OAAOiqB,QAAQ,CAAC5d,UAAU,CAAC;AAAEkZ,MAAAA,YAAY,EAAEta,KAAAA;KAAO,EAAEjL,IAAI,CAAC,CAAA;AAC3D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAnBE;EAAAiqB,QAAA,CAoBO5d,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IAC9B,IAAI+V,GAAG,IAAI,IAAI,IAAI,OAAOA,GAAG,KAAK,QAAQ,EAAE;AAC1C,MAAA,MAAM,IAAI1Y,oBAAoB,CAE1B0Y,8DAAAA,IAAAA,GAAG,KAAK,IAAI,GAAG,MAAM,GAAG,OAAOA,GAAG,CAEtC,CAAC,CAAA;AACH,KAAA;IAEA,OAAO,IAAIkU,QAAQ,CAAC;MAClBzH,MAAM,EAAEnH,eAAe,CAACtF,GAAG,EAAEkU,QAAQ,CAACsB,aAAa,CAAC;AACpDhjB,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC;MAC5B+pB,kBAAkB,EAAE/pB,IAAI,CAAC+pB,kBAAkB;MAC3CC,MAAM,EAAEhqB,IAAI,CAACgqB,MAAAA;AACf,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MATE;AAAAC,EAAAA,QAAA,CAUOuB,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBC,YAAY,EAAE;AACpC,IAAA,IAAInb,QAAQ,CAACmb,YAAY,CAAC,EAAE;AAC1B,MAAA,OAAOxB,QAAQ,CAACqB,UAAU,CAACG,YAAY,CAAC,CAAA;KACzC,MAAM,IAAIxB,QAAQ,CAACyB,UAAU,CAACD,YAAY,CAAC,EAAE;AAC5C,MAAA,OAAOA,YAAY,CAAA;AACrB,KAAC,MAAM,IAAI,OAAOA,YAAY,KAAK,QAAQ,EAAE;AAC3C,MAAA,OAAOxB,QAAQ,CAAC5d,UAAU,CAACof,YAAY,CAAC,CAAA;AAC1C,KAAC,MAAM;AACL,MAAA,MAAM,IAAIpuB,oBAAoB,CAAA,4BAAA,GACCouB,YAAY,GAAY,WAAA,GAAA,OAAOA,YAC9D,CAAC,CAAA;AACH,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAbE;EAAAxB,QAAA,CAcO0B,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;AACzB,IAAA,IAAA6rB,iBAAA,GAAiB/C,gBAAgB,CAAC8C,IAAI,CAAC;AAAhCvpB,MAAAA,MAAM,GAAAwpB,iBAAA,CAAA,CAAA,CAAA,CAAA;AACb,IAAA,IAAIxpB,MAAM,EAAE;AACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;AAC1C,KAAC,MAAM;MACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;AAC1F,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAfE;EAAA3B,QAAA,CAgBO6B,WAAW,GAAlB,SAAAA,YAAmBF,IAAI,EAAE5rB,IAAI,EAAE;AAC7B,IAAA,IAAA+rB,iBAAA,GAAiB/C,gBAAgB,CAAC4C,IAAI,CAAC;AAAhCvpB,MAAAA,MAAM,GAAA0pB,iBAAA,CAAA,CAAA,CAAA,CAAA;AACb,IAAA,IAAI1pB,MAAM,EAAE;AACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;AAC1C,KAAC,MAAM;MACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;AAC1F,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAA3B,QAAA,CAMOmB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;AAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;AAAA,KAAA;IACvC,IAAI,CAAC9W,MAAM,EAAE;AACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;IAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAIpW,oBAAoB,CAACsuB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAInB,QAAQ,CAAC;AAAEmB,QAAAA,OAAO,EAAPA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA,MAFE;AAAAnB,EAAAA,QAAA,CAGOsB,aAAa,GAApB,SAAAA,aAAAA,CAAqBnuB,IAAI,EAAE;AACzB,IAAA,IAAMme,UAAU,GAAG;AACjB1d,MAAAA,IAAI,EAAE,OAAO;AACb+e,MAAAA,KAAK,EAAE,OAAO;AACdyE,MAAAA,OAAO,EAAE,UAAU;AACnBxE,MAAAA,QAAQ,EAAE,UAAU;AACpB/e,MAAAA,KAAK,EAAE,QAAQ;AACf4P,MAAAA,MAAM,EAAE,QAAQ;AAChBse,MAAAA,IAAI,EAAE,OAAO;AACblP,MAAAA,KAAK,EAAE,OAAO;AACd/e,MAAAA,GAAG,EAAE,MAAM;AACXgf,MAAAA,IAAI,EAAE,MAAM;AACZze,MAAAA,IAAI,EAAE,OAAO;AACbmd,MAAAA,KAAK,EAAE,OAAO;AACdld,MAAAA,MAAM,EAAE,SAAS;AACjB6L,MAAAA,OAAO,EAAE,SAAS;AAClB3L,MAAAA,MAAM,EAAE,SAAS;AACjBue,MAAAA,OAAO,EAAE,SAAS;AAClBpY,MAAAA,WAAW,EAAE,cAAc;AAC3B2gB,MAAAA,YAAY,EAAE,cAAA;KACf,CAACnoB,IAAI,GAAGA,IAAI,CAACyR,WAAW,EAAE,GAAGzR,IAAI,CAAC,CAAA;IAEnC,IAAI,CAACme,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;AAEjD,IAAA,OAAOme,UAAU,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA0O,EAAAA,QAAA,CAKOyB,UAAU,GAAjB,SAAAA,UAAAA,CAAkBpU,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAAC+T,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA,EAAA,IAAAzrB,MAAA,GAAAqqB,QAAA,CAAApqB,SAAA,CAAA;AAiBA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EAzBED,MAAA,CA0BAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACrB;AACA,IAAA,IAAMksB,OAAO,GAAArlB,QAAA,CAAA,EAAA,EACR7G,IAAI,EAAA;MACPkJ,KAAK,EAAElJ,IAAI,CAACga,KAAK,KAAK,KAAK,IAAIha,IAAI,CAACkJ,KAAK,KAAK,KAAA;KAC/C,CAAA,CAAA;IACD,OAAO,IAAI,CAAC+X,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,EAAE2jB,OAAO,CAAC,CAAC5K,wBAAwB,CAAC,IAAI,EAAE9B,GAAG,CAAC,GACvE6J,SAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAfE;AAAAzpB,EAAAA,MAAA,CAgBAusB,OAAO,GAAP,SAAAA,OAAAA,CAAQnsB,IAAI,EAAO;AAAA,IAAA,IAAAiE,KAAA,GAAA,IAAA,CAAA;AAAA,IAAA,IAAXjE,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACf,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;AAEjC,IAAA,IAAM+C,SAAS,GAAGpsB,IAAI,CAACosB,SAAS,KAAK,KAAK,CAAA;IAE1C,IAAMzuB,CAAC,GAAGgsB,cAAY,CACnBrf,GAAG,CAAC,UAAClN,IAAI,EAAK;AACb,MAAA,IAAM6gB,GAAG,GAAGha,KAAI,CAACue,MAAM,CAACplB,IAAI,CAAC,CAAA;MAC7B,IAAIkG,WAAW,CAAC2a,GAAG,CAAC,IAAKA,GAAG,KAAK,CAAC,IAAI,CAACmO,SAAU,EAAE;AACjD,QAAA,OAAO,IAAI,CAAA;AACb,OAAA;AACA,MAAA,OAAOnoB,KAAI,CAACsE,GAAG,CACZuG,eAAe,CAAAjI,QAAA,CAAA;AAAGgE,QAAAA,KAAK,EAAE,MAAM;AAAEwhB,QAAAA,WAAW,EAAE,MAAA;AAAM,OAAA,EAAKrsB,IAAI,EAAA;QAAE5C,IAAI,EAAEA,IAAI,CAACgkB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAAC,OAAA,CAAE,CAAC,CACzFlhB,MAAM,CAAC+d,GAAG,CAAC,CAAA;AAChB,KAAC,CAAC,CACDqE,MAAM,CAAC,UAAC7kB,CAAC,EAAA;AAAA,MAAA,OAAKA,CAAC,CAAA;KAAC,CAAA,CAAA;AAEnB,IAAA,OAAO,IAAI,CAAC8K,GAAG,CACZ0G,aAAa,CAAApI,QAAA,CAAA;AAAG3F,MAAAA,IAAI,EAAE,aAAa;AAAE2J,MAAAA,KAAK,EAAE7K,IAAI,CAACssB,SAAS,IAAI,QAAA;AAAQ,KAAA,EAAKtsB,IAAI,CAAE,CAAC,CAClFE,MAAM,CAACvC,CAAC,CAAC,CAAA;AACd,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAiC,EAAAA,MAAA,CAKA2sB,QAAQ,GAAR,SAAAA,WAAW;AACT,IAAA,IAAI,CAAC,IAAI,CAACtL,OAAO,EAAE,OAAO,EAAE,CAAA;AAC5B,IAAA,OAAApa,QAAA,CAAA,EAAA,EAAY,IAAI,CAAC2b,MAAM,CAAA,CAAA;AACzB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MATE;AAAA5iB,EAAAA,MAAA,CAUA4sB,KAAK,GAAL,SAAAA,QAAQ;AACN;AACA,IAAA,IAAI,CAAC,IAAI,CAACvL,OAAO,EAAE,OAAO,IAAI,CAAA;IAE9B,IAAIvjB,CAAC,GAAG,GAAG,CAAA;AACX,IAAA,IAAI,IAAI,CAACkf,KAAK,KAAK,CAAC,EAAElf,CAAC,IAAI,IAAI,CAACkf,KAAK,GAAG,GAAG,CAAA;IAC3C,IAAI,IAAI,CAAClP,MAAM,KAAK,CAAC,IAAI,IAAI,CAACmP,QAAQ,KAAK,CAAC,EAAEnf,CAAC,IAAI,IAAI,CAACgQ,MAAM,GAAG,IAAI,CAACmP,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAA;AACxF,IAAA,IAAI,IAAI,CAACC,KAAK,KAAK,CAAC,EAAEpf,CAAC,IAAI,IAAI,CAACof,KAAK,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAI,CAACC,IAAI,KAAK,CAAC,EAAErf,CAAC,IAAI,IAAI,CAACqf,IAAI,GAAG,GAAG,CAAA;IACzC,IAAI,IAAI,CAACtB,KAAK,KAAK,CAAC,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC,EACzF7nB,CAAC,IAAI,GAAG,CAAA;AACV,IAAA,IAAI,IAAI,CAAC+d,KAAK,KAAK,CAAC,EAAE/d,CAAC,IAAI,IAAI,CAAC+d,KAAK,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,EAAE1M,CAAC,IAAI,IAAI,CAAC0M,OAAO,GAAG,GAAG,CAAA;IAC/C,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC;AAC/C;AACA;AACA7nB,MAAAA,CAAC,IAAIiM,OAAO,CAAC,IAAI,CAACqT,OAAO,GAAG,IAAI,CAACuI,YAAY,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;AAChE,IAAA,IAAI7nB,CAAC,KAAK,GAAG,EAAEA,CAAC,IAAI,KAAK,CAAA;AACzB,IAAA,OAAOA,CAAC,CAAA;AACV,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAfE;AAAAkC,EAAAA,MAAA,CAgBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACjB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAMyL,MAAM,GAAG,IAAI,CAACC,QAAQ,EAAE,CAAA;IAC9B,IAAID,MAAM,GAAG,CAAC,IAAIA,MAAM,IAAI,QAAQ,EAAE,OAAO,IAAI,CAAA;AAEjD1sB,IAAAA,IAAI,GAAA6G,QAAA,CAAA;AACF+lB,MAAAA,oBAAoB,EAAE,KAAK;AAC3BC,MAAAA,eAAe,EAAE,KAAK;AACtBC,MAAAA,aAAa,EAAE,KAAK;AACpB5sB,MAAAA,MAAM,EAAE,UAAA;AAAU,KAAA,EACfF,IAAI,EAAA;AACP+sB,MAAAA,aAAa,EAAE,KAAA;KAChB,CAAA,CAAA;AAED,IAAA,IAAMC,QAAQ,GAAG9kB,QAAQ,CAACojB,UAAU,CAACoB,MAAM,EAAE;AAAE/oB,MAAAA,IAAI,EAAE,KAAA;AAAM,KAAC,CAAC,CAAA;AAC7D,IAAA,OAAOqpB,QAAQ,CAACP,SAAS,CAACzsB,IAAI,CAAC,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAJ,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA5sB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;AACT,IAAA,OAAO,IAAI,CAACgd,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA,MAHE;EAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;IAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;AAChB,MAAA,OAAA,qBAAA,GAA6B/b,IAAI,CAACC,SAAS,CAAC,IAAI,CAACqd,MAAM,CAAC,GAAA,IAAA,CAAA;AAC1D,KAAC,MAAM;MACL,OAAsC,8BAAA,GAAA,IAAI,CAAC0K,aAAa,GAAA,IAAA,CAAA;AAC1D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAttB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;AACT,IAAA,IAAI,CAAC,IAAI,CAAC1L,OAAO,EAAE,OAAO9c,GAAG,CAAA;IAE7B,OAAO+lB,gBAAgB,CAAC,IAAI,CAACF,MAAM,EAAE,IAAI,CAACxH,MAAM,CAAC,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA5iB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;AACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA/sB,EAAAA,MAAA,CAKAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;MAC7C7F,MAAM,GAAG,EAAE,CAAA;AAEb,IAAA,KAAA,IAAA8F,GAAA,GAAA,CAAA,EAAAC,aAAA,GAAgB3D,cAAY,EAAA0D,GAAA,GAAAC,aAAA,CAAApqB,MAAA,EAAAmqB,GAAA,EAAE,EAAA;AAAzB,MAAA,IAAM/U,CAAC,GAAAgV,aAAA,CAAAD,GAAA,CAAA,CAAA;AACV,MAAA,IAAI9U,cAAc,CAACgJ,GAAG,CAACiB,MAAM,EAAElK,CAAC,CAAC,IAAIC,cAAc,CAAC,IAAI,CAACiK,MAAM,EAAElK,CAAC,CAAC,EAAE;AACnEiP,QAAAA,MAAM,CAACjP,CAAC,CAAC,GAAGiJ,GAAG,CAAC/gB,GAAG,CAAC8X,CAAC,CAAC,GAAG,IAAI,CAAC9X,GAAG,CAAC8X,CAAC,CAAC,CAAA;AACtC,OAAA;AACF,KAAA;IAEA,OAAOjL,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;KAAQ,EAAE,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA3nB,EAAAA,MAAA,CAKA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;IAC/C,OAAO,IAAI,CAACjjB,IAAI,CAACoX,GAAG,CAACiM,MAAM,EAAE,CAAC,CAAA;AAChC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA5tB,EAAAA,MAAA,CAOA6tB,QAAQ,GAAR,SAAAA,QAAAA,CAASC,EAAE,EAAE;AACX,IAAA,IAAI,CAAC,IAAI,CAACzM,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,IAAMsG,MAAM,GAAG,EAAE,CAAA;IACjB,KAAAoG,IAAAA,GAAA,MAAAC,YAAA,GAAgBvkB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmL,GAAA,GAAAC,YAAA,CAAA1qB,MAAA,EAAAyqB,GAAA,EAAE,EAAA;AAArC,MAAA,IAAMrV,CAAC,GAAAsV,YAAA,CAAAD,GAAA,CAAA,CAAA;AACVpG,MAAAA,MAAM,CAACjP,CAAC,CAAC,GAAG4C,QAAQ,CAACwS,EAAE,CAAC,IAAI,CAAClL,MAAM,CAAClK,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAA;AAC7C,KAAA;IACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;KAAQ,EAAE,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAA3nB,EAAAA,MAAA,CAQAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;IACR,OAAO,IAAI,CAAC6sB,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAAwC,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAM4M,KAAK,GAAAhnB,QAAA,CAAQ,EAAA,EAAA,IAAI,CAAC2b,MAAM,EAAKnH,eAAe,CAACmH,MAAM,EAAEyH,QAAQ,CAACsB,aAAa,CAAC,CAAE,CAAA;IACpF,OAAOle,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAEqL,KAAAA;AAAM,KAAC,CAAC,CAAA;AACvC,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAjuB,EAAAA,MAAA,CAKAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAAxhB,KAAA,EAA0E;AAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;MAA1DxL,MAAM,GAAAD,IAAA,CAANC,MAAM;MAAE2G,eAAe,GAAA5G,IAAA,CAAf4G,eAAe;MAAEsiB,kBAAkB,GAAAlpB,IAAA,CAAlBkpB,kBAAkB;MAAEC,MAAM,GAAAnpB,IAAA,CAANmpB,MAAM,CAAA;AAC/D,IAAA,IAAMzhB,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;AAAEvM,MAAAA,MAAM,EAANA,MAAM;AAAE2G,MAAAA,eAAe,EAAfA,eAAAA;AAAgB,KAAC,CAAC,CAAA;AACvD,IAAA,IAAMzH,IAAI,GAAG;AAAEuI,MAAAA,GAAG,EAAHA,GAAG;AAAEyhB,MAAAA,MAAM,EAANA,MAAM;AAAED,MAAAA,kBAAkB,EAAlBA,kBAAAA;KAAoB,CAAA;AAChD,IAAA,OAAO1c,OAAK,CAAC,IAAI,EAAErN,IAAI,CAAC,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAAJ,EAAAA,MAAA,CAQAmuB,EAAE,GAAF,SAAAA,EAAAA,CAAG3wB,IAAI,EAAE;AACP,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACoB,OAAO,CAACjlB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;AAC1D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAdE;AAAAvE,EAAAA,MAAA,CAeAouB,SAAS,GAAT,SAAAA,YAAY;AACV,IAAA,IAAI,CAAC,IAAI,CAAC/M,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMkJ,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;AAC5BjC,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEG,IAAI,CAAC,CAAA;IAClC,OAAO9c,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAvqB,EAAAA,MAAA,CAKAquB,OAAO,GAAP,SAAAA,UAAU;AACR,IAAA,IAAI,CAAC,IAAI,CAAChN,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACoD,SAAS,EAAE,CAACE,UAAU,EAAE,CAAC3B,QAAQ,EAAE,CAAC,CAAA;IACnE,OAAOlf,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAvqB,EAAAA,MAAA,CAKAyiB,OAAO,GAAP,SAAAA,UAAkB;AAAA,IAAA,KAAA,IAAAM,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAPyZ,KAAK,GAAAjF,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;AAALlG,MAAAA,KAAK,CAAAkG,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;AAAA,KAAA;AACd,IAAA,IAAI,CAAC,IAAI,CAAC5B,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAItE,KAAK,CAACzZ,MAAM,KAAK,CAAC,EAAE;AACtB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEAyZ,IAAAA,KAAK,GAAGA,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;AAAA,MAAA,OAAKyO,QAAQ,CAACsB,aAAa,CAAC/P,CAAC,CAAC,CAAA;KAAC,CAAA,CAAA;IAEnD,IAAM2S,KAAK,GAAG,EAAE;MACdC,WAAW,GAAG,EAAE;AAChBjE,MAAAA,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;AACxB,IAAA,IAAI8B,QAAQ,CAAA;AAEZ,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgB5E,cAAY,EAAA2E,GAAA,GAAAC,cAAA,CAAArrB,MAAA,EAAAorB,GAAA,EAAE,EAAA;AAAzB,MAAA,IAAMhW,CAAC,GAAAiW,cAAA,CAAAD,GAAA,CAAA,CAAA;MACV,IAAI3R,KAAK,CAACzV,OAAO,CAACoR,CAAC,CAAC,IAAI,CAAC,EAAE;AACzB+V,QAAAA,QAAQ,GAAG/V,CAAC,CAAA;QAEZ,IAAIkW,GAAG,GAAG,CAAC,CAAA;;AAEX;AACA,QAAA,KAAK,IAAMC,EAAE,IAAIL,WAAW,EAAE;AAC5BI,UAAAA,GAAG,IAAI,IAAI,CAACxE,MAAM,CAACyE,EAAE,CAAC,CAACnW,CAAC,CAAC,GAAG8V,WAAW,CAACK,EAAE,CAAC,CAAA;AAC3CL,UAAAA,WAAW,CAACK,EAAE,CAAC,GAAG,CAAC,CAAA;AACrB,SAAA;;AAEA;AACA,QAAA,IAAIne,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;AACrBkW,UAAAA,GAAG,IAAIrE,IAAI,CAAC7R,CAAC,CAAC,CAAA;AAChB,SAAA;;AAEA;AACA;AACA,QAAA,IAAMrV,CAAC,GAAGsB,IAAI,CAACwV,KAAK,CAACyU,GAAG,CAAC,CAAA;AACzBL,QAAAA,KAAK,CAAC7V,CAAC,CAAC,GAAGrV,CAAC,CAAA;AACZmrB,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG,CAACkW,GAAG,GAAG,IAAI,GAAGvrB,CAAC,GAAG,IAAI,IAAI,IAAI,CAAA;;AAE/C;OACD,MAAM,IAAIqN,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;AAC5B8V,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG6R,IAAI,CAAC7R,CAAC,CAAC,CAAA;AAC1B,OAAA;AACF,KAAA;;AAEA;AACA;AACA,IAAA,KAAK,IAAM/X,GAAG,IAAI6tB,WAAW,EAAE;AAC7B,MAAA,IAAIA,WAAW,CAAC7tB,GAAG,CAAC,KAAK,CAAC,EAAE;QAC1B4tB,KAAK,CAACE,QAAQ,CAAC,IACb9tB,GAAG,KAAK8tB,QAAQ,GAAGD,WAAW,CAAC7tB,GAAG,CAAC,GAAG6tB,WAAW,CAAC7tB,GAAG,CAAC,GAAG,IAAI,CAACypB,MAAM,CAACqE,QAAQ,CAAC,CAAC9tB,GAAG,CAAC,CAAA;AACvF,OAAA;AACF,KAAA;AAEA+pB,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEmE,KAAK,CAAC,CAAA;IACnC,OAAO9gB,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE2L,KAAAA;KAAO,EAAE,IAAI,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAvuB,EAAAA,MAAA,CAKAsuB,UAAU,GAAV,SAAAA,aAAa;AACX,IAAA,IAAI,CAAC,IAAI,CAACjN,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,OAAO,IAAI,CAACoB,OAAO,CACjB,OAAO,EACP,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cACF,CAAC,CAAA;AACH,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAziB,EAAAA,MAAA,CAKA4tB,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,IAAI,CAAC,IAAI,CAACvM,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,IAAMyN,OAAO,GAAG,EAAE,CAAA;IAClB,KAAAC,IAAAA,GAAA,MAAAC,aAAA,GAAgBvlB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmM,GAAA,GAAAC,aAAA,CAAA1rB,MAAA,EAAAyrB,GAAA,EAAE,EAAA;AAArC,MAAA,IAAMrW,CAAC,GAAAsW,aAAA,CAAAD,GAAA,CAAA,CAAA;MACVD,OAAO,CAACpW,CAAC,CAAC,GAAG,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,CAAA;AACzD,KAAA;IACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAEkM,OAAAA;KAAS,EAAE,IAAI,CAAC,CAAA;AAC/C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA9uB,EAAAA,MAAA,CAKAivB,WAAW,GAAX,SAAAA,cAAc;AACZ,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACpI,MAAM,CAAC,CAAA;IACtC,OAAOnV,OAAK,CAAC,IAAI,EAAE;AAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAiGA;AACF;AACA;AACA;AACA;AACA;AALEvqB,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;IACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;AACnC,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IAEA,IAAI,CAAC,IAAI,CAAC1Y,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,EAAE;AAC/B,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAEA,IAAA,SAASumB,EAAEA,CAACC,EAAE,EAAEC,EAAE,EAAE;AAClB;AACA,MAAA,IAAID,EAAE,KAAKntB,SAAS,IAAImtB,EAAE,KAAK,CAAC,EAAE,OAAOC,EAAE,KAAKptB,SAAS,IAAIotB,EAAE,KAAK,CAAC,CAAA;MACrE,OAAOD,EAAE,KAAKC,EAAE,CAAA;AAClB,KAAA;AAEA,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgBvF,cAAY,EAAAsF,GAAA,GAAAC,cAAA,CAAAhsB,MAAA,EAAA+rB,GAAA,EAAE,EAAA;AAAzB,MAAA,IAAMzT,CAAC,GAAA0T,cAAA,CAAAD,GAAA,CAAA,CAAA;AACV,MAAA,IAAI,CAACH,EAAE,CAAC,IAAI,CAACtM,MAAM,CAAChH,CAAC,CAAC,EAAEjM,KAAK,CAACiT,MAAM,CAAChH,CAAC,CAAC,CAAC,EAAE;AACxC,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACF,KAAA;AACA,IAAA,OAAO,IAAI,CAAA;GACZ,CAAA;AAAAlb,EAAAA,YAAA,CAAA2pB,QAAA,EAAA,CAAA;IAAA1pB,GAAA,EAAA,QAAA;IAAAC,GAAA,EAzjBD,SAAAA,GAAAA,GAAa;MACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;AAC9C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAP,GAAA,EAAA,iBAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;MACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;AACvD,KAAA;AAAC,GAAA,EAAA;IAAAlH,GAAA,EAAA,OAAA;IAAAC,GAAA,EAsbD,SAAAA,GAAAA,GAAY;AACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC5F,KAAK,IAAI,CAAC,GAAGzY,GAAG,CAAA;AACpD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,UAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;AACb,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC3F,QAAQ,IAAI,CAAC,GAAG1Y,GAAG,CAAA;AACvD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,QAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAa;AACX,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC9U,MAAM,IAAI,CAAC,GAAGvJ,GAAG,CAAA;AACrD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,OAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;AACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC1F,KAAK,IAAI,CAAC,GAAG3Y,GAAG,CAAA;AACpD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,MAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;AACT,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACzF,IAAI,IAAI,CAAC,GAAG5Y,GAAG,CAAA;AACnD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,OAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;AACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC/G,KAAK,IAAI,CAAC,GAAGtX,GAAG,CAAA;AACpD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACpY,OAAO,IAAI,CAAC,GAAGjG,GAAG,CAAA;AACtD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACxF,OAAO,IAAI,CAAC,GAAG7Y,GAAG,CAAA;AACtD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,cAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;AACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC+C,YAAY,IAAI,CAAC,GAAGphB,GAAG,CAAA;AAC3D,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7qB,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;AAClD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA8D,GAAA,EAAA,oBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;MACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;AACvD,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAA0W,QAAA,CAAA;AAAA,CAAA,CApWAkF,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ACtmB3C,IAAM/F,SAAO,GAAG,kBAAkB,CAAA;;AAElC;AACA,SAASgG,gBAAgBA,CAAC/O,KAAK,EAAEE,GAAG,EAAE;AACpC,EAAA,IAAI,CAACF,KAAK,IAAI,CAACA,KAAK,CAACW,OAAO,EAAE;AAC5B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,0BAA0B,CAAC,CAAA;GACpD,MAAM,IAAI,CAAC5K,GAAG,IAAI,CAACA,GAAG,CAACS,OAAO,EAAE;AAC/B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACnD,GAAC,MAAM,IAAI5K,GAAG,GAAGF,KAAK,EAAE;AACtB,IAAA,OAAOgP,QAAQ,CAAClE,OAAO,CACrB,kBAAkB,yEACmD9K,KAAK,CAACkM,KAAK,EAAE,GAAYhM,WAAAA,GAAAA,GAAG,CAACgM,KAAK,EACzG,CAAC,CAAA;AACH,GAAC,MAAM;AACL,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACqB8C,IAAAA,QAAQ,0BAAArE,WAAA,EAAA;AAC3B;AACF;AACA;EACE,SAAAqE,QAAAA,CAAYpE,MAAM,EAAE;AAClB;AACJ;AACA;AACI,IAAA,IAAI,CAACxtB,CAAC,GAAGwtB,MAAM,CAAC5K,KAAK,CAAA;AACrB;AACJ;AACA;AACI,IAAA,IAAI,CAACtc,CAAC,GAAGknB,MAAM,CAAC1K,GAAG,CAAA;AACnB;AACJ;AACA;AACI,IAAA,IAAI,CAAC4K,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;AACrC;AACJ;AACA;IACI,IAAI,CAACmE,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EALED,QAAA,CAMOlE,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;AAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;AAAA,KAAA;IACvC,IAAI,CAAC9W,MAAM,EAAE;AACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;IAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAItW,oBAAoB,CAACwuB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAIkE,QAAQ,CAAC;AAAElE,QAAAA,OAAO,EAAPA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAAkE,QAAA,CAMOE,aAAa,GAApB,SAAAA,cAAqBlP,KAAK,EAAEE,GAAG,EAAE;AAC/B,IAAA,IAAMiP,UAAU,GAAGC,gBAAgB,CAACpP,KAAK,CAAC;AACxCqP,MAAAA,QAAQ,GAAGD,gBAAgB,CAAClP,GAAG,CAAC,CAAA;AAElC,IAAA,IAAMoP,aAAa,GAAGP,gBAAgB,CAACI,UAAU,EAAEE,QAAQ,CAAC,CAAA;IAE5D,IAAIC,aAAa,IAAI,IAAI,EAAE;MACzB,OAAO,IAAIN,QAAQ,CAAC;AAClBhP,QAAAA,KAAK,EAAEmP,UAAU;AACjBjP,QAAAA,GAAG,EAAEmP,QAAAA;AACP,OAAC,CAAC,CAAA;AACJ,KAAC,MAAM;AACL,MAAA,OAAOC,aAAa,CAAA;AACtB,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAAN,QAAA,CAMOO,KAAK,GAAZ,SAAAA,MAAavP,KAAK,EAAE8M,QAAQ,EAAE;AAC5B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;AAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAACpP,KAAK,CAAC,CAAA;AAC9B,IAAA,OAAOgP,QAAQ,CAACE,aAAa,CAACvnB,EAAE,EAAEA,EAAE,CAACkC,IAAI,CAACoX,GAAG,CAAC,CAAC,CAAA;AACjD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAA+N,QAAA,CAMOQ,MAAM,GAAb,SAAAA,OAActP,GAAG,EAAE4M,QAAQ,EAAE;AAC3B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;AAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAAClP,GAAG,CAAC,CAAA;AAC5B,IAAA,OAAO8O,QAAQ,CAACE,aAAa,CAACvnB,EAAE,CAACslB,KAAK,CAAChM,GAAG,CAAC,EAAEtZ,EAAE,CAAC,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAAqnB,QAAA,CAQO3D,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;AACzB,IAAA,IAAA+vB,MAAA,GAAe,CAACnE,IAAI,IAAI,EAAE,EAAE7Z,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;AAAlCrU,MAAAA,CAAC,GAAAqyB,MAAA,CAAA,CAAA,CAAA;AAAE/rB,MAAAA,CAAC,GAAA+rB,MAAA,CAAA,CAAA,CAAA,CAAA;IACX,IAAIryB,CAAC,IAAIsG,CAAC,EAAE;MACV,IAAIsc,KAAK,EAAE0P,YAAY,CAAA;MACvB,IAAI;QACF1P,KAAK,GAAGpY,QAAQ,CAACyjB,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;QACjCgwB,YAAY,GAAG1P,KAAK,CAACW,OAAO,CAAA;OAC7B,CAAC,OAAOjd,CAAC,EAAE;AACVgsB,QAAAA,YAAY,GAAG,KAAK,CAAA;AACtB,OAAA;MAEA,IAAIxP,GAAG,EAAEyP,UAAU,CAAA;MACnB,IAAI;QACFzP,GAAG,GAAGtY,QAAQ,CAACyjB,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;QAC/BiwB,UAAU,GAAGzP,GAAG,CAACS,OAAO,CAAA;OACzB,CAAC,OAAOjd,CAAC,EAAE;AACVisB,QAAAA,UAAU,GAAG,KAAK,CAAA;AACpB,OAAA;MAEA,IAAID,YAAY,IAAIC,UAAU,EAAE;AAC9B,QAAA,OAAOX,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAEE,GAAG,CAAC,CAAA;AAC3C,OAAA;AAEA,MAAA,IAAIwP,YAAY,EAAE;QAChB,IAAMzO,GAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;QACrC,IAAIuhB,GAAG,CAACN,OAAO,EAAE;AACf,UAAA,OAAOqO,QAAQ,CAACO,KAAK,CAACvP,KAAK,EAAEiB,GAAG,CAAC,CAAA;AACnC,SAAA;OACD,MAAM,IAAI0O,UAAU,EAAE;QACrB,IAAM1O,IAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;QACrC,IAAIuhB,IAAG,CAACN,OAAO,EAAE;AACf,UAAA,OAAOqO,QAAQ,CAACQ,MAAM,CAACtP,GAAG,EAAEe,IAAG,CAAC,CAAA;AAClC,SAAA;AACF,OAAA;AACF,KAAA;IACA,OAAO+N,QAAQ,CAAClE,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;AAC1F,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA0D,EAAAA,QAAA,CAKOY,UAAU,GAAjB,SAAAA,UAAAA,CAAkB5Y,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACiY,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA,EAAA,IAAA3vB,MAAA,GAAA0vB,QAAA,CAAAzvB,SAAA,CAAA;AAiDA;AACF;AACA;AACA;AACA;AAJED,EAAAA,MAAA,CAKAsD,MAAM,GAAN,SAAAA,MAAAA,CAAO9F,IAAI,EAAmB;AAAA,IAAA,IAAvBA,IAAI,KAAA,KAAA,CAAA,EAAA;AAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;AAAA,KAAA;IAC1B,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACkP,UAAU,CAAAh0B,KAAA,CAAf,IAAI,EAAe,CAACiB,IAAI,CAAC,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MARE;EAAAvE,MAAA,CASAqL,KAAK,GAAL,SAAAA,MAAM7N,IAAI,EAAmB4C,IAAI,EAAE;AAAA,IAAA,IAA7B5C,IAAI,KAAA,KAAA,CAAA,EAAA;AAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;AAAA,KAAA;AACzB,IAAA,IAAI,CAAC,IAAI,CAAC6jB,OAAO,EAAE,OAAO9c,GAAG,CAAA;IAC7B,IAAMmc,KAAK,GAAG,IAAI,CAACA,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC5C,IAAA,IAAIwgB,GAAG,CAAA;AACP,IAAA,IAAIxgB,IAAI,IAAA,IAAA,IAAJA,IAAI,CAAEqwB,cAAc,EAAE;AACxB7P,MAAAA,GAAG,GAAG,IAAI,CAACA,GAAG,CAACsN,WAAW,CAAC;QAAEhtB,MAAM,EAAEwf,KAAK,CAACxf,MAAAA;AAAO,OAAC,CAAC,CAAA;AACtD,KAAC,MAAM;MACL0f,GAAG,GAAG,IAAI,CAACA,GAAG,CAAA;AAChB,KAAA;IACAA,GAAG,GAAGA,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC7B,IAAA,OAAOuE,IAAI,CAAC2E,KAAK,CAACsX,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAC,IAAIojB,GAAG,CAAC2M,OAAO,EAAE,KAAK,IAAI,CAAC3M,GAAG,CAAC2M,OAAO,EAAE,CAAC,CAAA;AAC7F,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAvtB,EAAAA,MAAA,CAKA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQnzB,IAAI,EAAE;AACZ,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACuP,OAAO,EAAE,IAAI,IAAI,CAACxsB,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,CAACgD,OAAO,CAAC,IAAI,CAAC7yB,CAAC,EAAEN,IAAI,CAAC,GAAG,KAAK,CAAA;AACvF,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAwC,EAAAA,MAAA,CAIA4wB,OAAO,GAAP,SAAAA,UAAU;AACR,IAAA,OAAO,IAAI,CAAC9yB,CAAC,CAACyvB,OAAO,EAAE,KAAK,IAAI,CAACnpB,CAAC,CAACmpB,OAAO,EAAE,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAvtB,EAAAA,MAAA,CAKA6wB,OAAO,GAAP,SAAAA,OAAAA,CAAQzD,QAAQ,EAAE;AAChB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,GAAGsvB,QAAQ,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAptB,EAAAA,MAAA,CAKA8wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS1D,QAAQ,EAAE;AACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAACjd,CAAC,IAAIgpB,QAAQ,CAAA;AAC3B,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAptB,EAAAA,MAAA,CAKA+wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS3D,QAAQ,EAAE;AACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,IAAI,CAACvjB,CAAC,IAAIsvB,QAAQ,IAAI,IAAI,CAAChpB,CAAC,GAAGgpB,QAAQ,CAAA;AAChD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAAptB,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAAuK,KAAA,EAAyB;AAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;MAAjBgU,KAAK,GAAAzf,IAAA,CAALyf,KAAK;MAAEE,GAAG,GAAA3f,IAAA,CAAH2f,GAAG,CAAA;AACd,IAAA,IAAI,CAAC,IAAI,CAACS,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,OAAOqO,QAAQ,CAACE,aAAa,CAAClP,KAAK,IAAI,IAAI,CAAC5iB,CAAC,EAAE8iB,GAAG,IAAI,IAAI,CAACxc,CAAC,CAAC,CAAA;AAC/D,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAApE,EAAAA,MAAA,CAKAgxB,OAAO,GAAP,SAAAA,UAAsB;AAAA,IAAA,IAAA3sB,KAAA,GAAA,IAAA,CAAA;AACpB,IAAA,IAAI,CAAC,IAAI,CAACgd,OAAO,EAAE,OAAO,EAAE,CAAA;AAAC,IAAA,KAAA,IAAA0B,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EADpB2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;AAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;AAAA,KAAA;AAElB,IAAA,IAAMiO,MAAM,GAAGD,SAAS,CACnBvmB,GAAG,CAAColB,gBAAgB,CAAC,CACrBpN,MAAM,CAAC,UAAC1O,CAAC,EAAA;AAAA,QAAA,OAAK3P,KAAI,CAAC0sB,QAAQ,CAAC/c,CAAC,CAAC,CAAA;AAAA,OAAA,CAAC,CAC/Bmd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;QAAA,OAAK3Y,CAAC,CAACsU,QAAQ,EAAE,GAAGqE,CAAC,CAACrE,QAAQ,EAAE,CAAA;OAAC,CAAA;AAC9Cle,MAAAA,OAAO,GAAG,EAAE,CAAA;AACV,IAAA,IAAE/Q,CAAC,GAAK,IAAI,CAAVA,CAAC;AACLuF,MAAAA,CAAC,GAAG,CAAC,CAAA;AAEP,IAAA,OAAOvF,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;MACjB,IAAMitB,KAAK,GAAGH,MAAM,CAAC7tB,CAAC,CAAC,IAAI,IAAI,CAACe,CAAC;AAC/BkU,QAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;MAC1CxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;AAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;AACRjV,MAAAA,CAAC,IAAI,CAAC,CAAA;AACR,KAAA;AAEA,IAAA,OAAOwL,OAAO,CAAA;AAChB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA7O,EAAAA,MAAA,CAMAsxB,OAAO,GAAP,SAAAA,OAAAA,CAAQ9D,QAAQ,EAAE;AAChB,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;AAE/C,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,IAAI,CAACM,GAAG,CAACN,OAAO,IAAIM,GAAG,CAACwM,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;AACjE,MAAA,OAAO,EAAE,CAAA;AACX,KAAA;AAEI,IAAA,IAAErwB,CAAC,GAAK,IAAI,CAAVA,CAAC;AACLyzB,MAAAA,GAAG,GAAG,CAAC;MACPjZ,IAAI,CAAA;IAEN,IAAMzJ,OAAO,GAAG,EAAE,CAAA;AAClB,IAAA,OAAO/Q,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;AACjB,MAAA,IAAMitB,KAAK,GAAG,IAAI,CAAC3Q,KAAK,CAACnW,IAAI,CAACoX,GAAG,CAACkM,QAAQ,CAAC,UAACzU,CAAC,EAAA;QAAA,OAAKA,CAAC,GAAGmY,GAAG,CAAA;AAAA,OAAA,CAAC,CAAC,CAAA;AAC3DjZ,MAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;MACxCxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;AAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;AACRiZ,MAAAA,GAAG,IAAI,CAAC,CAAA;AACV,KAAA;AAEA,IAAA,OAAO1iB,OAAO,CAAA;AAChB,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA7O,EAAAA,MAAA,CAKAwxB,aAAa,GAAb,SAAAA,aAAAA,CAAcC,aAAa,EAAE;AAC3B,IAAA,IAAI,CAAC,IAAI,CAACpQ,OAAO,EAAE,OAAO,EAAE,CAAA;AAC5B,IAAA,OAAO,IAAI,CAACiQ,OAAO,CAAC,IAAI,CAAChuB,MAAM,EAAE,GAAGmuB,aAAa,CAAC,CAACjQ,KAAK,CAAC,CAAC,EAAEiQ,aAAa,CAAC,CAAA;AAC5E,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAzxB,EAAAA,MAAA,CAKA0xB,QAAQ,GAAR,SAAAA,QAAAA,CAAS/hB,KAAK,EAAE;AACd,IAAA,OAAO,IAAI,CAACvL,CAAC,GAAGuL,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAACvL,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAApE,EAAAA,MAAA,CAKA2xB,UAAU,GAAV,SAAAA,UAAAA,CAAWhiB,KAAK,EAAE;AAChB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,CAAC,IAAI,CAACjd,CAAC,KAAK,CAACuL,KAAK,CAAC7R,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAkC,EAAAA,MAAA,CAKA4xB,QAAQ,GAAR,SAAAA,QAAAA,CAASjiB,KAAK,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,CAAC1R,KAAK,CAACvL,CAAC,KAAK,CAAC,IAAI,CAACtG,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAkC,EAAAA,MAAA,CAKA6xB,OAAO,GAAP,SAAAA,OAAAA,CAAQliB,KAAK,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,IAAI6R,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACsG,CAAC,IAAIuL,KAAK,CAACvL,CAAC,CAAA;AAC/C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAApE,EAAAA,MAAA,CAKAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;IACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;AACnC,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IAEA,OAAO,IAAI,CAACvjB,CAAC,CAAC0C,MAAM,CAACmP,KAAK,CAAC7R,CAAC,CAAC,IAAI,IAAI,CAACsG,CAAC,CAAC5D,MAAM,CAACmP,KAAK,CAACvL,CAAC,CAAC,CAAA;AACzD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAApE,EAAAA,MAAA,CAOA8xB,YAAY,GAAZ,SAAAA,YAAAA,CAAaniB,KAAK,EAAE;AAClB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;AAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;IAEzC,IAAItG,CAAC,IAAIsG,CAAC,EAAE;AACV,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM;AACL,MAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAApE,EAAAA,MAAA,CAMA+xB,KAAK,GAAL,SAAAA,KAAAA,CAAMpiB,KAAK,EAAE;AACX,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;AAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;AACzC,IAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MARE;AAAAsrB,EAAAA,QAAA,CASOsC,KAAK,GAAZ,SAAAA,KAAAA,CAAaC,SAAS,EAAE;IACtB,IAAAC,qBAAA,GAAuBD,SAAS,CAC7Bd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;AAAA,QAAA,OAAK3Y,CAAC,CAAC3a,CAAC,GAAGszB,CAAC,CAACtzB,CAAC,CAAA;AAAA,OAAA,CAAC,CACzBsa,MAAM,CACL,UAAA3T,KAAA,EAAmBghB,IAAI,EAAK;QAAA,IAA1B0M,KAAK,GAAA1tB,KAAA,CAAA,CAAA,CAAA;AAAEob,UAAAA,OAAO,GAAApb,KAAA,CAAA,CAAA,CAAA,CAAA;QACd,IAAI,CAACob,OAAO,EAAE;AACZ,UAAA,OAAO,CAACsS,KAAK,EAAE1M,IAAI,CAAC,CAAA;AACtB,SAAC,MAAM,IAAI5F,OAAO,CAAC6R,QAAQ,CAACjM,IAAI,CAAC,IAAI5F,OAAO,CAAC8R,UAAU,CAAClM,IAAI,CAAC,EAAE;UAC7D,OAAO,CAAC0M,KAAK,EAAEtS,OAAO,CAACkS,KAAK,CAACtM,IAAI,CAAC,CAAC,CAAA;AACrC,SAAC,MAAM;UACL,OAAO,CAAC0M,KAAK,CAACjW,MAAM,CAAC,CAAC2D,OAAO,CAAC,CAAC,EAAE4F,IAAI,CAAC,CAAA;AACxC,SAAA;AACF,OAAC,EACD,CAAC,EAAE,EAAE,IAAI,CACX,CAAC;AAbIlD,MAAAA,KAAK,GAAA2P,qBAAA,CAAA,CAAA,CAAA;AAAEE,MAAAA,KAAK,GAAAF,qBAAA,CAAA,CAAA,CAAA,CAAA;AAcnB,IAAA,IAAIE,KAAK,EAAE;AACT7P,MAAAA,KAAK,CAAC/Z,IAAI,CAAC4pB,KAAK,CAAC,CAAA;AACnB,KAAA;AACA,IAAA,OAAO7P,KAAK,CAAA;AACd,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAmN,EAAAA,QAAA,CAKO2C,GAAG,GAAV,SAAAA,GAAAA,CAAWJ,SAAS,EAAE;AAAA,IAAA,IAAAK,gBAAA,CAAA;IACpB,IAAI5R,KAAK,GAAG,IAAI;AACd6R,MAAAA,YAAY,GAAG,CAAC,CAAA;IAClB,IAAM1jB,OAAO,GAAG,EAAE;AAChB2jB,MAAAA,IAAI,GAAGP,SAAS,CAACvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;AAAA,QAAA,OAAK,CAC1B;UAAEovB,IAAI,EAAEpvB,CAAC,CAACvF,CAAC;AAAEwD,UAAAA,IAAI,EAAE,GAAA;AAAI,SAAC,EACxB;UAAEmxB,IAAI,EAAEpvB,CAAC,CAACe,CAAC;AAAE9C,UAAAA,IAAI,EAAE,GAAA;AAAI,SAAC,CACzB,CAAA;OAAC,CAAA;AACFoxB,MAAAA,SAAS,GAAG,CAAAJ,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIE,IAAI,CAAC;MAC3Cva,GAAG,GAAGya,SAAS,CAACvB,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;AAAA,QAAA,OAAK3Y,CAAC,CAACga,IAAI,GAAGrB,CAAC,CAACqB,IAAI,CAAA;OAAC,CAAA,CAAA;AAEjD,IAAA,KAAA,IAAA1U,SAAA,GAAAC,+BAAA,CAAgB/F,GAAG,CAAA,EAAAgG,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;AAAA,MAAA,IAAV7a,CAAC,GAAA4a,KAAA,CAAAza,KAAA,CAAA;MACV+uB,YAAY,IAAIlvB,CAAC,CAAC/B,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;MAEvC,IAAIixB,YAAY,KAAK,CAAC,EAAE;QACtB7R,KAAK,GAAGrd,CAAC,CAACovB,IAAI,CAAA;AAChB,OAAC,MAAM;QACL,IAAI/R,KAAK,IAAI,CAACA,KAAK,KAAK,CAACrd,CAAC,CAACovB,IAAI,EAAE;AAC/B5jB,UAAAA,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAErd,CAAC,CAACovB,IAAI,CAAC,CAAC,CAAA;AACrD,SAAA;AAEA/R,QAAAA,KAAK,GAAG,IAAI,CAAA;AACd,OAAA;AACF,KAAA;AAEA,IAAA,OAAOgP,QAAQ,CAACsC,KAAK,CAACnjB,OAAO,CAAC,CAAA;AAChC,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA7O,EAAAA,MAAA,CAKA2yB,UAAU,GAAV,SAAAA,aAAyB;AAAA,IAAA,IAAA5kB,MAAA,GAAA,IAAA,CAAA;AAAA,IAAA,KAAA,IAAAsV,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2uB,SAAS,GAAAna,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;AAAT0O,MAAAA,SAAS,CAAA1O,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;AAAA,KAAA;AACrB,IAAA,OAAOmM,QAAQ,CAAC2C,GAAG,CAAC,CAAC,IAAI,CAAC,CAACnW,MAAM,CAAC+V,SAAS,CAAC,CAAC,CAC1CvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;AAAA,MAAA,OAAK0K,MAAI,CAAC+jB,YAAY,CAACzuB,CAAC,CAAC,CAAA;AAAA,KAAA,CAAC,CAChCqf,MAAM,CAAC,UAACrf,CAAC,EAAA;AAAA,MAAA,OAAKA,CAAC,IAAI,CAACA,CAAC,CAACutB,OAAO,EAAE,CAAA;KAAC,CAAA,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA5wB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;AACT,IAAA,IAAI,CAAC,IAAI,CAACyR,OAAO,EAAE,OAAOoI,SAAO,CAAA;AACjC,IAAA,OAAA,GAAA,GAAW,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,EAAE,GAAM,UAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,GAAA,CAAA;AAC/C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;EAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;IAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;AAChB,MAAA,OAAA,oBAAA,GAA4B,IAAI,CAACvjB,CAAC,CAAC8uB,KAAK,EAAE,GAAU,SAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,IAAA,CAAA;AACpE,KAAC,MAAM;MACL,OAAsC,8BAAA,GAAA,IAAI,CAACU,aAAa,GAAA,IAAA,CAAA;AAC1D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAjBE;EAAAttB,MAAA,CAkBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;AAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;MAAVA,UAAU,GAAG3B,UAAkB,CAAA;AAAA,KAAA;AAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAChG,CAAC,CAAC6K,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACK,cAAc,CAAC,IAAI,CAAC,GACzEiJ,SAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAzpB,EAAAA,MAAA,CAMA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAMxsB,IAAI,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;AACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,CAACxsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACwoB,KAAK,CAACxsB,IAAI,CAAC,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAJ,EAAAA,MAAA,CAMA6yB,SAAS,GAAT,SAAAA,YAAY;AACV,IAAA,IAAI,CAAC,IAAI,CAACxR,OAAO,EAAE,OAAOoI,SAAO,CAAA;AACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+0B,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACzuB,CAAC,CAACyuB,SAAS,EAAE,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA7yB,EAAAA,MAAA,CAOA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;AACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+uB,SAAS,CAACzsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACyoB,SAAS,CAACzsB,IAAI,CAAC,CAAA;AAC5D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAVE;EAAAJ,MAAA,CAWAqsB,QAAQ,GAAR,SAAAA,SAASyG,UAAU,EAAAC,MAAA,EAA8B;AAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAAE,eAAA,GAAAD,KAAA,CAAxBE,SAAS;AAATA,MAAAA,SAAS,GAAAD,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;AACtC,IAAA,IAAI,CAAC,IAAI,CAAC5R,OAAO,EAAE,OAAOoI,SAAO,CAAA;AACjC,IAAA,OAAA,EAAA,GAAU,IAAI,CAAC3rB,CAAC,CAACuuB,QAAQ,CAACyG,UAAU,CAAC,GAAGI,SAAS,GAAG,IAAI,CAAC9uB,CAAC,CAACioB,QAAQ,CAACyG,UAAU,CAAC,CAAA;AACjF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAA9yB,MAAA,CAYAuwB,UAAU,GAAV,SAAAA,WAAW/yB,IAAI,EAAE4C,IAAI,EAAE;AACrB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;AACjB,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,IAAI,CAAC8B,aAAa,CAAC,CAAA;AAC7C,KAAA;AACA,IAAA,OAAO,IAAI,CAAClpB,CAAC,CAACssB,IAAI,CAAC,IAAI,CAAC5yB,CAAC,EAAEN,IAAI,EAAE4C,IAAI,CAAC,CAAA;AACxC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAAJ,EAAAA,MAAA,CAOAmzB,YAAY,GAAZ,SAAAA,YAAAA,CAAaC,KAAK,EAAE;AAClB,IAAA,OAAO1D,QAAQ,CAACE,aAAa,CAACwD,KAAK,CAAC,IAAI,CAACt1B,CAAC,CAAC,EAAEs1B,KAAK,CAAC,IAAI,CAAChvB,CAAC,CAAC,CAAC,CAAA;GAC5D,CAAA;AAAA1D,EAAAA,YAAA,CAAAgvB,QAAA,EAAA,CAAA;IAAA/uB,GAAA,EAAA,OAAA;IAAAC,GAAA,EAjeD,SAAAA,GAAAA,GAAY;MACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACvjB,CAAC,GAAG,IAAI,CAAA;AACrC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA6C,GAAA,EAAA,KAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;MACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACjd,CAAC,GAAG,IAAI,CAAA;AACrC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAzD,GAAA,EAAA,cAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;AACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAI,IAAI,CAACjd,CAAC,GAAG,IAAI,CAACA,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAI,IAAI,CAAA;AAChE,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAhtB,GAAA,EAAA,SAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAAC0sB,aAAa,KAAK,IAAI,CAAA;AACpC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA3sB,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;AAClD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA8D,GAAA,EAAA,oBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;MACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;AACvD,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAA+b,QAAA,CAAA;AAAA,CAAA,CAwUAH,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ACriB3C;AACA;AACA;AAFA,IAGqB6D,IAAI,gBAAA,YAAA;AAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;AACvB;AACF;AACA;AACA;AACA;AAJEA,EAAAA,IAAA,CAKOC,MAAM,GAAb,SAAAA,MAAAA,CAAcvvB,IAAI,EAAyB;AAAA,IAAA,IAA7BA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAGgI,QAAQ,CAACwE,WAAW,CAAA;AAAA,KAAA;AACvC,IAAA,IAAMgjB,KAAK,GAAGjrB,QAAQ,CAAC8K,GAAG,EAAE,CAAC9I,OAAO,CAACvG,IAAI,CAAC,CAAC5B,GAAG,CAAC;AAAEjE,MAAAA,KAAK,EAAE,EAAA;AAAG,KAAC,CAAC,CAAA;AAE7D,IAAA,OAAO,CAAC6F,IAAI,CAACyvB,WAAW,IAAID,KAAK,CAAChzB,MAAM,KAAKgzB,KAAK,CAACpxB,GAAG,CAAC;AAAEjE,MAAAA,KAAK,EAAE,CAAA;KAAG,CAAC,CAACqC,MAAM,CAAA;AAC7E,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA8yB,EAAAA,IAAA,CAKOI,eAAe,GAAtB,SAAAA,eAAAA,CAAuB1vB,IAAI,EAAE;AAC3B,IAAA,OAAOF,QAAQ,CAACM,WAAW,CAACJ,IAAI,CAAC,CAAA;AACnC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAbE;AAAAsvB,EAAAA,IAAA,CAcOhjB,aAAa,GAApB,SAAAA,eAAAA,CAAqBC,KAAK,EAAE;AAC1B,IAAA,OAAOD,aAAa,CAACC,KAAK,EAAEvE,QAAQ,CAACwE,WAAW,CAAC,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA8iB,EAAAA,IAAA,CAOO7jB,cAAc,GAArB,SAAAA,cAAAA,CAAA9C,KAAA,EAA6D;AAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;MAAAgnB,WAAA,GAAAzyB,IAAA,CAAnCC,MAAM;AAANA,MAAAA,MAAM,GAAAwyB,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA;MAAAC,WAAA,GAAA1yB,IAAA,CAAE2yB,MAAM;AAANA,MAAAA,MAAM,GAAAD,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA,CAAA;AAClD,IAAA,OAAO,CAACC,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEsO,cAAc,EAAE,CAAA;AAC3D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAA6jB,EAAAA,IAAA,CAQOQ,yBAAyB,GAAhC,SAAAA,yBAAAA,CAAAd,MAAA,EAAwE;AAAA,IAAA,IAAAtuB,KAAA,GAAAsuB,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAAe,YAAA,GAAArvB,KAAA,CAAnCvD,MAAM;AAANA,MAAAA,MAAM,GAAA4yB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,YAAA,GAAAtvB,KAAA,CAAEmvB,MAAM;AAANA,MAAAA,MAAM,GAAAG,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;AAC7D,IAAA,OAAO,CAACH,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEuO,qBAAqB,EAAE,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA4jB,EAAAA,IAAA,CAOOW,kBAAkB,GAAzB,SAAAA,kBAAAA,CAAAC,MAAA,EAAiE;AAAA,IAAA,IAAAjB,KAAA,GAAAiB,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAAC,YAAA,GAAAlB,KAAA,CAAnC9xB,MAAM;AAANA,MAAAA,MAAM,GAAAgzB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,YAAA,GAAAnB,KAAA,CAAEY,MAAM;AAANA,MAAAA,MAAM,GAAAO,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;AACtD;AACA,IAAA,OAAO,CAACP,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEwO,cAAc,EAAE,CAAC8R,KAAK,EAAE,CAAA;AACnE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAhBE;EAAA6R,IAAA,CAiBOvlB,MAAM,GAAb,SAAAA,OACExK,MAAM,EAAA8wB,MAAA,EAEN;AAAA,IAAA,IAFA9wB,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;AAAA,KAAA;AAAA,IAAA,IAAA+wB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAAvFnzB,MAAM;AAANA,MAAAA,MAAM,GAAAozB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,qBAAA,GAAAF,KAAA,CAAExsB,eAAe;AAAfA,MAAAA,eAAe,GAAA0sB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;MAAAC,YAAA,GAAAH,KAAA,CAAET,MAAM;AAANA,MAAAA,MAAM,GAAAY,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,oBAAA,GAAAJ,KAAA,CAAErsB,cAAc;AAAdA,MAAAA,cAAc,GAAAysB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;AAElF,IAAA,OAAO,CAACb,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,CAAC,CAAA;AAC1F,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAZE;EAAA+vB,IAAA,CAaOqB,YAAY,GAAnB,SAAAA,aACEpxB,MAAM,EAAAqxB,MAAA,EAEN;AAAA,IAAA,IAFArxB,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;AAAA,KAAA;AAAA,IAAA,IAAAsxB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAAvF1zB,MAAM;AAANA,MAAAA,MAAM,GAAA2zB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,qBAAA,GAAAF,KAAA,CAAE/sB,eAAe;AAAfA,MAAAA,eAAe,GAAAitB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;MAAAC,YAAA,GAAAH,KAAA,CAAEhB,MAAM;AAANA,MAAAA,MAAM,GAAAmB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,oBAAA,GAAAJ,KAAA,CAAE5sB,cAAc;AAAdA,MAAAA,cAAc,GAAAgtB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;AAElF,IAAA,OAAO,CAACpB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,EAAE,IAAI,CAAC,CAAA;AAChG,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAbE;EAAA+vB,IAAA,CAcOhlB,QAAQ,GAAf,SAAAA,SAAgB/K,MAAM,EAAA2xB,MAAA,EAA0E;AAAA,IAAA,IAAhF3xB,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;AAAA,KAAA;AAAA,IAAA,IAAA4xB,KAAA,GAAAD,MAAA,cAA6D,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAA3Dh0B,MAAM;AAANA,MAAAA,MAAM,GAAAi0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,qBAAA,GAAAF,KAAA,CAAErtB,eAAe;AAAfA,MAAAA,eAAe,GAAAutB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;MAAAC,YAAA,GAAAH,KAAA,CAAEtB,MAAM;AAANA,MAAAA,MAAM,GAAAyB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;AACrF,IAAA,OAAO,CAACzB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,CAAC,CAAA;AAClF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAA+vB,IAAA,CAYOiC,cAAc,GAArB,SAAAA,eACEhyB,MAAM,EAAAiyB,MAAA,EAEN;AAAA,IAAA,IAFAjyB,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;AAAA,KAAA;AAAA,IAAA,IAAAkyB,KAAA,GAAAD,MAAA,cAC4C,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAA3Dt0B,MAAM;AAANA,MAAAA,MAAM,GAAAu0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,qBAAA,GAAAF,KAAA,CAAE3tB,eAAe;AAAfA,MAAAA,eAAe,GAAA6tB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;MAAAC,YAAA,GAAAH,KAAA,CAAE5B,MAAM;AAANA,MAAAA,MAAM,GAAA+B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;AAEtD,IAAA,OAAO,CAAC/B,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,EAAE,IAAI,CAAC,CAAA;AACxF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAA+vB,EAAAA,IAAA,CAQO9kB,SAAS,GAAhB,SAAAA,SAAAA,CAAAqnB,MAAA,EAAyC;AAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAApB30B,MAAM;AAANA,MAAAA,MAAM,GAAA40B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;IAC9B,OAAOhvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,CAACqN,SAAS,EAAE,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MATE;EAAA8kB,IAAA,CAUO5kB,IAAI,GAAX,SAAAA,KAAYnL,MAAM,EAAAyyB,MAAA,EAAoC;AAAA,IAAA,IAA1CzyB,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,OAAO,CAAA;AAAA,KAAA;AAAA,IAAA,IAAA0yB,KAAA,GAAAD,MAAA,cAAsB,EAAE,GAAAA,MAAA;MAAAE,YAAA,GAAAD,KAAA,CAApB90B,MAAM;AAANA,MAAAA,MAAM,GAAA+0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;AAC3C,IAAA,OAAOnvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAACuN,IAAI,CAACnL,MAAM,CAAC,CAAA;AAC5D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MARE;AAAA+vB,EAAAA,IAAA,CASO6C,QAAQ,GAAf,SAAAA,WAAkB;IAChB,OAAO;MAAEC,QAAQ,EAAEjrB,WAAW,EAAE;MAAEkrB,UAAU,EAAE7mB,iBAAiB,EAAC;KAAG,CAAA;GACpE,CAAA;AAAA,EAAA,OAAA8jB,IAAA,CAAA;AAAA,CAAA;;ACzMH,SAASgD,OAAOA,CAACC,OAAO,EAAEC,KAAK,EAAE;AAC/B,EAAA,IAAMC,WAAW,GAAG,SAAdA,WAAWA,CAAInuB,EAAE,EAAA;AAAA,MAAA,OAAKA,EAAE,CAACouB,KAAK,CAAC,CAAC,EAAE;AAAEC,QAAAA,aAAa,EAAE,IAAA;OAAM,CAAC,CAAClG,OAAO,CAAC,KAAK,CAAC,CAACjD,OAAO,EAAE,CAAA;AAAA,KAAA;IACvFnlB,EAAE,GAAGouB,WAAW,CAACD,KAAK,CAAC,GAAGC,WAAW,CAACF,OAAO,CAAC,CAAA;AAChD,EAAA,OAAO3xB,IAAI,CAAC2E,KAAK,CAAC+gB,QAAQ,CAACqB,UAAU,CAACtjB,EAAE,CAAC,CAAC+lB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAA;AACvD,CAAA;AAEA,SAASwI,cAAcA,CAAChT,MAAM,EAAE4S,KAAK,EAAExZ,KAAK,EAAE;EAC5C,IAAM6Z,OAAO,GAAG,CACd,CAAC,OAAO,EAAE,UAACne,CAAC,EAAE2Y,CAAC,EAAA;AAAA,IAAA,OAAKA,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,CAAA;AAAA,GAAA,CAAC,EACpC,CAAC,UAAU,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;AAAA,IAAA,OAAKA,CAAC,CAAC3P,OAAO,GAAGhJ,CAAC,CAACgJ,OAAO,GAAG,CAAC2P,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,CAAC,CAAA;AAAA,GAAA,CAAC,EACrE,CAAC,QAAQ,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;AAAA,IAAA,OAAKA,CAAC,CAAClzB,KAAK,GAAGua,CAAC,CAACva,KAAK,GAAG,CAACkzB,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,EAAE,CAAA;GAAC,CAAA,EAChE,CACE,OAAO,EACP,UAACwa,CAAC,EAAE2Y,CAAC,EAAK;AACR,IAAA,IAAMjU,IAAI,GAAGkZ,OAAO,CAAC5d,CAAC,EAAE2Y,CAAC,CAAC,CAAA;AAC1B,IAAA,OAAO,CAACjU,IAAI,GAAIA,IAAI,GAAG,CAAE,IAAI,CAAC,CAAA;AAChC,GAAC,CACF,EACD,CAAC,MAAM,EAAEkZ,OAAO,CAAC,CAClB,CAAA;EAED,IAAMxnB,OAAO,GAAG,EAAE,CAAA;EAClB,IAAMynB,OAAO,GAAG3S,MAAM,CAAA;EACtB,IAAIkT,WAAW,EAAEC,SAAS,CAAA;;AAE1B;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,KAAA,IAAA7S,EAAA,GAAA,CAAA,EAAA8S,QAAA,GAA6BH,OAAO,EAAA3S,EAAA,GAAA8S,QAAA,CAAAzzB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;AAAjC,IAAA,IAAA+S,WAAA,GAAAD,QAAA,CAAA9S,EAAA,CAAA;AAAOzmB,MAAAA,IAAI,GAAAw5B,WAAA,CAAA,CAAA,CAAA;AAAEC,MAAAA,MAAM,GAAAD,WAAA,CAAA,CAAA,CAAA,CAAA;IACtB,IAAIja,KAAK,CAACzV,OAAO,CAAC9J,IAAI,CAAC,IAAI,CAAC,EAAE;AAC5Bq5B,MAAAA,WAAW,GAAGr5B,IAAI,CAAA;MAElBqR,OAAO,CAACrR,IAAI,CAAC,GAAGy5B,MAAM,CAACtT,MAAM,EAAE4S,KAAK,CAAC,CAAA;AACrCO,MAAAA,SAAS,GAAGR,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;MAEjC,IAAIioB,SAAS,GAAGP,KAAK,EAAE;AACrB;QACA1nB,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;AACfmmB,QAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;;AAE9B;AACA;AACA;QACA,IAAI8U,MAAM,GAAG4S,KAAK,EAAE;AAClB;AACAO,UAAAA,SAAS,GAAGnT,MAAM,CAAA;AAClB;UACA9U,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;AACfmmB,UAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;AAChC,SAAA;AACF,OAAC,MAAM;AACL8U,QAAAA,MAAM,GAAGmT,SAAS,CAAA;AACpB,OAAA;AACF,KAAA;AACF,GAAA;EAEA,OAAO,CAACnT,MAAM,EAAE9U,OAAO,EAAEioB,SAAS,EAAED,WAAW,CAAC,CAAA;AAClD,CAAA;AAEe,cAAA,EAAUP,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAE3c,IAAI,EAAE;EACpD,IAAA82B,eAAA,GAAgDP,cAAc,CAACL,OAAO,EAAEC,KAAK,EAAExZ,KAAK,CAAC;AAAhF4G,IAAAA,MAAM,GAAAuT,eAAA,CAAA,CAAA,CAAA;AAAEroB,IAAAA,OAAO,GAAAqoB,eAAA,CAAA,CAAA,CAAA;AAAEJ,IAAAA,SAAS,GAAAI,eAAA,CAAA,CAAA,CAAA;AAAEL,IAAAA,WAAW,GAAAK,eAAA,CAAA,CAAA,CAAA,CAAA;AAE5C,EAAA,IAAMC,eAAe,GAAGZ,KAAK,GAAG5S,MAAM,CAAA;AAEtC,EAAA,IAAMyT,eAAe,GAAGra,KAAK,CAAC2F,MAAM,CAClC,UAAC9G,CAAC,EAAA;AAAA,IAAA,OAAK,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAACtU,OAAO,CAACsU,CAAC,CAAC,IAAI,CAAC,CAAA;AAAA,GACxE,CAAC,CAAA;AAED,EAAA,IAAIwb,eAAe,CAAC9zB,MAAM,KAAK,CAAC,EAAE;IAChC,IAAIwzB,SAAS,GAAGP,KAAK,EAAE;AAAA,MAAA,IAAAc,YAAA,CAAA;AACrBP,MAAAA,SAAS,GAAGnT,MAAM,CAACpZ,IAAI,EAAA8sB,YAAA,GAAA,EAAA,EAAAA,YAAA,CAAIR,WAAW,CAAG,GAAA,CAAC,EAAAQ,YAAA,EAAG,CAAA;AAC/C,KAAA;IAEA,IAAIP,SAAS,KAAKnT,MAAM,EAAE;AACxB9U,MAAAA,OAAO,CAACgoB,WAAW,CAAC,GAAG,CAAChoB,OAAO,CAACgoB,WAAW,CAAC,IAAI,CAAC,IAAIM,eAAe,IAAIL,SAAS,GAAGnT,MAAM,CAAC,CAAA;AAC7F,KAAA;AACF,GAAA;EAEA,IAAM6J,QAAQ,GAAGnD,QAAQ,CAAC5d,UAAU,CAACoC,OAAO,EAAEzO,IAAI,CAAC,CAAA;AAEnD,EAAA,IAAIg3B,eAAe,CAAC9zB,MAAM,GAAG,CAAC,EAAE;AAAA,IAAA,IAAAg0B,oBAAA,CAAA;IAC9B,OAAO,CAAAA,oBAAA,GAAAjN,QAAQ,CAACqB,UAAU,CAACyL,eAAe,EAAE/2B,IAAI,CAAC,EAC9CqiB,OAAO,CAAAlmB,KAAA,CAAA+6B,oBAAA,EAAIF,eAAe,CAAC,CAC3B7sB,IAAI,CAACijB,QAAQ,CAAC,CAAA;AACnB,GAAC,MAAM;AACL,IAAA,OAAOA,QAAQ,CAAA;AACjB,GAAA;AACF;;ACtFA,IAAM+J,WAAW,GAAG,mDAAmD,CAAA;AAEvE,SAASC,OAAOA,CAACtkB,KAAK,EAAEukB,IAAI,EAAa;AAAA,EAAA,IAAjBA,IAAI,KAAA,KAAA,CAAA,EAAA;IAAJA,IAAI,GAAG,SAAAA,IAAAA,CAACp0B,CAAC,EAAA;AAAA,MAAA,OAAKA,CAAC,CAAA;AAAA,KAAA,CAAA;AAAA,GAAA;EACrC,OAAO;AAAE6P,IAAAA,KAAK,EAALA,KAAK;IAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAAz2B,IAAA,EAAA;MAAA,IAAEnD,CAAC,GAAAmD,IAAA,CAAA,CAAA,CAAA,CAAA;AAAA,MAAA,OAAMw2B,IAAI,CAACrlB,WAAW,CAACtU,CAAC,CAAC,CAAC,CAAA;AAAA,KAAA;GAAE,CAAA;AACxD,CAAA;AAEA,IAAM65B,IAAI,GAAGC,MAAM,CAACC,YAAY,CAAC,GAAG,CAAC,CAAA;AACrC,IAAMC,WAAW,GAAQH,IAAAA,GAAAA,IAAI,GAAG,GAAA,CAAA;AAChC,IAAMI,iBAAiB,GAAG,IAAI5kB,MAAM,CAAC2kB,WAAW,EAAE,GAAG,CAAC,CAAA;AAEtD,SAASE,YAAYA,CAACl6B,CAAC,EAAE;AACvB;AACA;AACA,EAAA,OAAOA,CAAC,CAAC0E,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAACA,OAAO,CAACu1B,iBAAiB,EAAED,WAAW,CAAC,CAAA;AACzE,CAAA;AAEA,SAASG,oBAAoBA,CAACn6B,CAAC,EAAE;EAC/B,OAAOA,CAAC,CACL0E,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;AAAC,GACnBA,OAAO,CAACu1B,iBAAiB,EAAE,GAAG,CAAC;GAC/B9oB,WAAW,EAAE,CAAA;AAClB,CAAA;AAEA,SAASipB,KAAKA,CAACC,OAAO,EAAEC,UAAU,EAAE;EAClC,IAAID,OAAO,KAAK,IAAI,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM;IACL,OAAO;AACLjlB,MAAAA,KAAK,EAAEC,MAAM,CAACglB,OAAO,CAACztB,GAAG,CAACstB,YAAY,CAAC,CAACrtB,IAAI,CAAC,GAAG,CAAC,CAAC;MAClD+sB,KAAK,EAAE,SAAAA,KAAAA,CAAAjzB,KAAA,EAAA;QAAA,IAAE3G,CAAC,GAAA2G,KAAA,CAAA,CAAA,CAAA,CAAA;AAAA,QAAA,OACR0zB,OAAO,CAACvjB,SAAS,CAAC,UAACvR,CAAC,EAAA;UAAA,OAAK40B,oBAAoB,CAACn6B,CAAC,CAAC,KAAKm6B,oBAAoB,CAAC50B,CAAC,CAAC,CAAA;AAAA,SAAA,CAAC,GAAG+0B,UAAU,CAAA;AAAA,OAAA;KAC7F,CAAA;AACH,GAAA;AACF,CAAA;AAEA,SAAS73B,MAAMA,CAAC2S,KAAK,EAAEmlB,MAAM,EAAE;EAC7B,OAAO;AAAEnlB,IAAAA,KAAK,EAALA,KAAK;IAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAA1E,KAAA,EAAA;MAAA,IAAIsF,CAAC,GAAAtF,KAAA,CAAA,CAAA,CAAA;AAAEhkB,QAAAA,CAAC,GAAAgkB,KAAA,CAAA,CAAA,CAAA,CAAA;AAAA,MAAA,OAAM7iB,YAAY,CAACmoB,CAAC,EAAEtpB,CAAC,CAAC,CAAA;AAAA,KAAA;AAAEqpB,IAAAA,MAAM,EAANA,MAAAA;GAAQ,CAAA;AACnE,CAAA;AAEA,SAASE,MAAMA,CAACrlB,KAAK,EAAE;EACrB,OAAO;AAAEA,IAAAA,KAAK,EAALA,KAAK;IAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAArD,KAAA,EAAA;MAAA,IAAEv2B,CAAC,GAAAu2B,KAAA,CAAA,CAAA,CAAA,CAAA;AAAA,MAAA,OAAMv2B,CAAC,CAAA;AAAA,KAAA;GAAE,CAAA;AACrC,CAAA;AAEA,SAAS06B,WAAWA,CAACh1B,KAAK,EAAE;AAC1B,EAAA,OAAOA,KAAK,CAAChB,OAAO,CAAC,6BAA6B,EAAE,MAAM,CAAC,CAAA;AAC7D,CAAA;;AAEA;AACA;AACA;AACA;AACA,SAASi2B,YAAYA,CAACta,KAAK,EAAExV,GAAG,EAAE;AAChC,EAAA,IAAM+vB,GAAG,GAAG5lB,UAAU,CAACnK,GAAG,CAAC;AACzBgwB,IAAAA,GAAG,GAAG7lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;AAC5BiwB,IAAAA,KAAK,GAAG9lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;AAC9BkwB,IAAAA,IAAI,GAAG/lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;AAC7BmwB,IAAAA,GAAG,GAAGhmB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;AAC5BowB,IAAAA,QAAQ,GAAGjmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACnCqwB,IAAAA,UAAU,GAAGlmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACrCswB,IAAAA,QAAQ,GAAGnmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACnCuwB,IAAAA,SAAS,GAAGpmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACpCwwB,IAAAA,SAAS,GAAGrmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACpCywB,IAAAA,SAAS,GAAGtmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;AACpCyV,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI3K,CAAC,EAAA;MAAA,OAAM;QAAEP,KAAK,EAAEC,MAAM,CAACqlB,WAAW,CAAC/kB,CAAC,CAAC4K,GAAG,CAAC,CAAC;QAAEqZ,KAAK,EAAE,SAAAA,KAAAA,CAAA9C,KAAA,EAAA;UAAA,IAAE92B,CAAC,GAAA82B,KAAA,CAAA,CAAA,CAAA,CAAA;AAAA,UAAA,OAAM92B,CAAC,CAAA;AAAA,SAAA;AAAEsgB,QAAAA,OAAO,EAAE,IAAA;OAAM,CAAA;KAAC;AAC1Fib,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI5lB,CAAC,EAAK;MACf,IAAI0K,KAAK,CAACC,OAAO,EAAE;QACjB,OAAOA,OAAO,CAAC3K,CAAC,CAAC,CAAA;AACnB,OAAA;MACA,QAAQA,CAAC,CAAC4K,GAAG;AACX;AACA,QAAA,KAAK,GAAG;UACN,OAAO6Z,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;AACpC,QAAA,KAAK,IAAI;UACP,OAAOypB,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;AACnC;AACA,QAAA,KAAK,GAAG;UACN,OAAO+oB,OAAO,CAACyB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;AACP,UAAA,OAAOzB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;AAC3C,QAAA,KAAK,MAAM;UACT,OAAO4c,OAAO,CAACqB,IAAI,CAAC,CAAA;AACtB,QAAA,KAAK,OAAO;UACV,OAAOrB,OAAO,CAAC4B,SAAS,CAAC,CAAA;AAC3B,QAAA,KAAK,QAAQ;UACX,OAAO5B,OAAO,CAACsB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOtB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC5C,QAAA,KAAK,MAAM;AACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC3C,QAAA,KAAK,GAAG;UACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC7C,QAAA,KAAK,MAAM;AACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC5C;AACA,QAAA,KAAK,GAAG;UACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;AAC5B,QAAA,KAAK,KAAK;UACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;AACvB;AACA,QAAA,KAAK,IAAI;UACP,OAAOpB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,GAAG;UACN,OAAOvB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;AAC5B,QAAA,KAAK,KAAK;UACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;AACvB,QAAA,KAAK,GAAG;UACN,OAAOL,MAAM,CAACW,SAAS,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOX,MAAM,CAACQ,QAAQ,CAAC,CAAA;AACzB,QAAA,KAAK,KAAK;UACR,OAAOvB,OAAO,CAACkB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOR,KAAK,CAACvvB,GAAG,CAAC4F,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;AAClC;AACA,QAAA,KAAK,MAAM;UACT,OAAOipB,OAAO,CAACqB,IAAI,CAAC,CAAA;AACtB,QAAA,KAAK,IAAI;AACP,UAAA,OAAOrB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;AAC3C;AACA,QAAA,KAAK,GAAG;UACN,OAAO4c,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG,CAAA;AACR,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACkB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOR,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/C,QAAA,KAAK,MAAM;AACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9C,QAAA,KAAK,KAAK;AACR,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9C,QAAA,KAAK,MAAM;AACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC7C;AACA,QAAA,KAAK,GAAG,CAAA;AACR,QAAA,KAAK,IAAI;AACP,UAAA,OAAO9N,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAASwV,QAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/E,QAAA,KAAK,KAAK;AACR,UAAA,OAAO5iB,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAAKwV,IAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1E;AACA;AACA,QAAA,KAAK,GAAG;UACN,OAAOoV,MAAM,CAAC,oBAAoB,CAAC,CAAA;AACrC;AACA;AACA,QAAA,KAAK,GAAG;UACN,OAAOA,MAAM,CAAC,WAAW,CAAC,CAAA;AAC5B,QAAA;UACE,OAAOna,OAAO,CAAC3K,CAAC,CAAC,CAAA;AACrB,OAAA;KACD,CAAA;AAEH,EAAA,IAAMjW,IAAI,GAAG67B,OAAO,CAAClb,KAAK,CAAC,IAAI;AAC7BmP,IAAAA,aAAa,EAAEiK,WAAAA;GAChB,CAAA;EAED/5B,IAAI,CAAC2gB,KAAK,GAAGA,KAAK,CAAA;AAElB,EAAA,OAAO3gB,IAAI,CAAA;AACb,CAAA;AAEA,IAAM87B,uBAAuB,GAAG;AAC9Br7B,EAAAA,IAAI,EAAE;AACJ,IAAA,SAAS,EAAE,IAAI;AACfsN,IAAAA,OAAO,EAAE,OAAA;GACV;AACDrN,EAAAA,KAAK,EAAE;AACLqN,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAI;AACfguB,IAAAA,KAAK,EAAE,KAAK;AACZC,IAAAA,IAAI,EAAE,MAAA;GACP;AACDr7B,EAAAA,GAAG,EAAE;AACHoN,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACDjN,EAAAA,OAAO,EAAE;AACPi7B,IAAAA,KAAK,EAAE,KAAK;AACZC,IAAAA,IAAI,EAAE,MAAA;GACP;AACDC,EAAAA,SAAS,EAAE,GAAG;AACdC,EAAAA,SAAS,EAAE,GAAG;AACdz3B,EAAAA,MAAM,EAAE;AACNsJ,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACDouB,EAAAA,MAAM,EAAE;AACNpuB,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACD5M,EAAAA,MAAM,EAAE;AACN4M,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACD1M,EAAAA,MAAM,EAAE;AACN0M,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACDxM,EAAAA,YAAY,EAAE;AACZy6B,IAAAA,IAAI,EAAE,OAAO;AACbD,IAAAA,KAAK,EAAE,KAAA;AACT,GAAA;AACF,CAAC,CAAA;AAED,SAASK,YAAYA,CAAC9uB,IAAI,EAAEqV,UAAU,EAAE0Z,YAAY,EAAE;AACpD,EAAA,IAAQv4B,IAAI,GAAYwJ,IAAI,CAApBxJ,IAAI;IAAEkC,KAAK,GAAKsH,IAAI,CAAdtH,KAAK,CAAA;EAEnB,IAAIlC,IAAI,KAAK,SAAS,EAAE;AACtB,IAAA,IAAMw4B,OAAO,GAAG,OAAO,CAAC5Z,IAAI,CAAC1c,KAAK,CAAC,CAAA;IACnC,OAAO;MACL4a,OAAO,EAAE,CAAC0b,OAAO;AACjBzb,MAAAA,GAAG,EAAEyb,OAAO,GAAG,GAAG,GAAGt2B,KAAAA;KACtB,CAAA;AACH,GAAA;AAEA,EAAA,IAAMyH,KAAK,GAAGkV,UAAU,CAAC7e,IAAI,CAAC,CAAA;;AAE9B;AACA;AACA;EACA,IAAIy4B,UAAU,GAAGz4B,IAAI,CAAA;EACrB,IAAIA,IAAI,KAAK,MAAM,EAAE;AACnB,IAAA,IAAI6e,UAAU,CAACle,MAAM,IAAI,IAAI,EAAE;AAC7B83B,MAAAA,UAAU,GAAG5Z,UAAU,CAACle,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;AACtD,KAAC,MAAM,IAAIke,UAAU,CAACjhB,SAAS,IAAI,IAAI,EAAE;MACvC,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,EAAE;AACpE66B,QAAAA,UAAU,GAAG,QAAQ,CAAA;AACvB,OAAC,MAAM;AACLA,QAAAA,UAAU,GAAG,QAAQ,CAAA;AACvB,OAAA;AACF,KAAC,MAAM;AACL;AACA;AACAA,MAAAA,UAAU,GAAGF,YAAY,CAAC53B,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;AACxD,KAAA;AACF,GAAA;AACA,EAAA,IAAIoc,GAAG,GAAGib,uBAAuB,CAACS,UAAU,CAAC,CAAA;AAC7C,EAAA,IAAI,OAAO1b,GAAG,KAAK,QAAQ,EAAE;AAC3BA,IAAAA,GAAG,GAAGA,GAAG,CAACpT,KAAK,CAAC,CAAA;AAClB,GAAA;AAEA,EAAA,IAAIoT,GAAG,EAAE;IACP,OAAO;AACLD,MAAAA,OAAO,EAAE,KAAK;AACdC,MAAAA,GAAG,EAAHA,GAAAA;KACD,CAAA;AACH,GAAA;AAEA,EAAA,OAAOrc,SAAS,CAAA;AAClB,CAAA;AAEA,SAASg4B,UAAUA,CAACjd,KAAK,EAAE;AACzB,EAAA,IAAMkd,EAAE,GAAGld,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;IAAA,OAAKA,CAAC,CAAC1I,KAAK,CAAA;AAAA,GAAA,CAAC,CAACkF,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;AAAA,IAAA,OAAQ9H,CAAC,GAAA,GAAA,GAAI8H,CAAC,CAACkT,MAAM,GAAA,GAAA,CAAA;GAAG,EAAE,EAAE,CAAC,CAAA;AAC9E,EAAA,OAAO,CAAK8W,GAAAA,GAAAA,EAAE,GAAKld,GAAAA,EAAAA,KAAK,CAAC,CAAA;AAC3B,CAAA;AAEA,SAAS7M,KAAKA,CAACI,KAAK,EAAE4C,KAAK,EAAEgnB,QAAQ,EAAE;AACrC,EAAA,IAAMC,OAAO,GAAG7pB,KAAK,CAACJ,KAAK,CAACgD,KAAK,CAAC,CAAA;AAElC,EAAA,IAAIinB,OAAO,EAAE;IACX,IAAMC,GAAG,GAAG,EAAE,CAAA;IACd,IAAIC,UAAU,GAAG,CAAC,CAAA;AAClB,IAAA,KAAK,IAAMh3B,CAAC,IAAI62B,QAAQ,EAAE;AACxB,MAAA,IAAIvhB,cAAc,CAACuhB,QAAQ,EAAE72B,CAAC,CAAC,EAAE;AAC/B,QAAA,IAAMi1B,CAAC,GAAG4B,QAAQ,CAAC72B,CAAC,CAAC;UACnBg1B,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;QACtC,IAAI,CAACC,CAAC,CAACla,OAAO,IAAIka,CAAC,CAACna,KAAK,EAAE;UACzBic,GAAG,CAAC9B,CAAC,CAACna,KAAK,CAACE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAGia,CAAC,CAACZ,KAAK,CAACyC,OAAO,CAAC3Y,KAAK,CAAC6Y,UAAU,EAAEA,UAAU,GAAGhC,MAAM,CAAC,CAAC,CAAA;AAC/E,SAAA;AACAgC,QAAAA,UAAU,IAAIhC,MAAM,CAAA;AACtB,OAAA;AACF,KAAA;AACA,IAAA,OAAO,CAAC8B,OAAO,EAAEC,GAAG,CAAC,CAAA;AACvB,GAAC,MAAM;AACL,IAAA,OAAO,CAACD,OAAO,EAAE,EAAE,CAAC,CAAA;AACtB,GAAA;AACF,CAAA;AAEA,SAASG,mBAAmBA,CAACH,OAAO,EAAE;AACpC,EAAA,IAAMI,OAAO,GAAG,SAAVA,OAAOA,CAAIpc,KAAK,EAAK;AACzB,IAAA,QAAQA,KAAK;AACX,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,aAAa,CAAA;AACtB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,QAAQ,CAAA;AACjB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,QAAQ,CAAA;AACjB,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,MAAM,CAAA;AACf,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,KAAK,CAAA;AACd,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,OAAO,CAAA;AAChB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,MAAM,CAAA;AACf,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,YAAY,CAAA;AACrB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,UAAU,CAAA;AACnB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA;AACE,QAAA,OAAO,IAAI,CAAA;AACf,KAAA;GACD,CAAA;EAED,IAAIpa,IAAI,GAAG,IAAI,CAAA;AACf,EAAA,IAAIy2B,cAAc,CAAA;AAClB,EAAA,IAAI,CAAC92B,WAAW,CAACy2B,OAAO,CAAChwB,CAAC,CAAC,EAAE;IAC3BpG,IAAI,GAAGF,QAAQ,CAACC,MAAM,CAACq2B,OAAO,CAAChwB,CAAC,CAAC,CAAA;AACnC,GAAA;AAEA,EAAA,IAAI,CAACzG,WAAW,CAACy2B,OAAO,CAACM,CAAC,CAAC,EAAE;IAC3B,IAAI,CAAC12B,IAAI,EAAE;AACTA,MAAAA,IAAI,GAAG,IAAI8L,eAAe,CAACsqB,OAAO,CAACM,CAAC,CAAC,CAAA;AACvC,KAAA;IACAD,cAAc,GAAGL,OAAO,CAACM,CAAC,CAAA;AAC5B,GAAA;AAEA,EAAA,IAAI,CAAC/2B,WAAW,CAACy2B,OAAO,CAACO,CAAC,CAAC,EAAE;AAC3BP,IAAAA,OAAO,CAACQ,CAAC,GAAG,CAACR,OAAO,CAACO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACrC,GAAA;AAEA,EAAA,IAAI,CAACh3B,WAAW,CAACy2B,OAAO,CAAC7B,CAAC,CAAC,EAAE;IAC3B,IAAI6B,OAAO,CAAC7B,CAAC,GAAG,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;MACrC0hB,OAAO,CAAC7B,CAAC,IAAI,EAAE,CAAA;AACjB,KAAC,MAAM,IAAI6B,OAAO,CAAC7B,CAAC,KAAK,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;MAC9C0hB,OAAO,CAAC7B,CAAC,GAAG,CAAC,CAAA;AACf,KAAA;AACF,GAAA;EAEA,IAAI6B,OAAO,CAACS,CAAC,KAAK,CAAC,IAAIT,OAAO,CAACU,CAAC,EAAE;AAChCV,IAAAA,OAAO,CAACU,CAAC,GAAG,CAACV,OAAO,CAACU,CAAC,CAAA;AACxB,GAAA;AAEA,EAAA,IAAI,CAACn3B,WAAW,CAACy2B,OAAO,CAACve,CAAC,CAAC,EAAE;IAC3Bue,OAAO,CAACW,CAAC,GAAGnhB,WAAW,CAACwgB,OAAO,CAACve,CAAC,CAAC,CAAA;AACpC,GAAA;AAEA,EAAA,IAAM2O,IAAI,GAAG9gB,MAAM,CAACC,IAAI,CAACywB,OAAO,CAAC,CAAC/hB,MAAM,CAAC,UAACnI,CAAC,EAAEyI,CAAC,EAAK;AACjD,IAAA,IAAMvQ,CAAC,GAAGoyB,OAAO,CAAC7hB,CAAC,CAAC,CAAA;AACpB,IAAA,IAAIvQ,CAAC,EAAE;AACL8H,MAAAA,CAAC,CAAC9H,CAAC,CAAC,GAAGgyB,OAAO,CAACzhB,CAAC,CAAC,CAAA;AACnB,KAAA;AAEA,IAAA,OAAOzI,CAAC,CAAA;GACT,EAAE,EAAE,CAAC,CAAA;AAEN,EAAA,OAAO,CAACsa,IAAI,EAAExmB,IAAI,EAAEy2B,cAAc,CAAC,CAAA;AACrC,CAAA;AAEA,IAAIO,kBAAkB,GAAG,IAAI,CAAA;AAE7B,SAASC,gBAAgBA,GAAG;EAC1B,IAAI,CAACD,kBAAkB,EAAE;AACvBA,IAAAA,kBAAkB,GAAGzyB,QAAQ,CAACojB,UAAU,CAAC,aAAa,CAAC,CAAA;AACzD,GAAA;AAEA,EAAA,OAAOqP,kBAAkB,CAAA;AAC3B,CAAA;AAEA,SAASE,qBAAqBA,CAAC9c,KAAK,EAAEjd,MAAM,EAAE;EAC5C,IAAIid,KAAK,CAACC,OAAO,EAAE;AACjB,IAAA,OAAOD,KAAK,CAAA;AACd,GAAA;EAEA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAACE,GAAG,CAAC,CAAA;AAC9D,EAAA,IAAMgE,MAAM,GAAG6Y,kBAAkB,CAAC/a,UAAU,EAAEjf,MAAM,CAAC,CAAA;EAErD,IAAImhB,MAAM,IAAI,IAAI,IAAIA,MAAM,CAACpa,QAAQ,CAACjG,SAAS,CAAC,EAAE;AAChD,IAAA,OAAOmc,KAAK,CAAA;AACd,GAAA;AAEA,EAAA,OAAOkE,MAAM,CAAA;AACf,CAAA;AAEO,SAAS8Y,iBAAiBA,CAAC9Y,MAAM,EAAEnhB,MAAM,EAAE;AAAA,EAAA,IAAAoxB,gBAAA,CAAA;AAChD,EAAA,OAAO,CAAAA,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIjQ,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;AAAA,IAAA,OAAKwnB,qBAAqB,CAACxnB,CAAC,EAAEvS,MAAM,CAAC,CAAA;AAAA,GAAA,CAAC,CAAC,CAAA;AACvF,CAAA;;AAEA;AACA;AACA;;AAEA,IAAak6B,WAAW,gBAAA,YAAA;AACtB,EAAA,SAAAA,WAAYl6B,CAAAA,MAAM,EAAEZ,MAAM,EAAE;IAC1B,IAAI,CAACY,MAAM,GAAGA,MAAM,CAAA;IACpB,IAAI,CAACZ,MAAM,GAAGA,MAAM,CAAA;AACpB,IAAA,IAAI,CAAC+hB,MAAM,GAAG8Y,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACrf,MAAM,CAAC,EAAEY,MAAM,CAAC,CAAA;IACtE,IAAI,CAAC6b,KAAK,GAAG,IAAI,CAACsF,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;AAAA,MAAA,OAAKglB,YAAY,CAAChlB,CAAC,EAAEvS,MAAM,CAAC,CAAA;KAAC,CAAA,CAAA;IAC5D,IAAI,CAACm6B,iBAAiB,GAAG,IAAI,CAACte,KAAK,CAAChO,IAAI,CAAC,UAAC0E,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC6Z,aAAa,CAAA;KAAC,CAAA,CAAA;AAEhE,IAAA,IAAI,CAAC,IAAI,CAAC+N,iBAAiB,EAAE;AAC3B,MAAA,IAAAC,WAAA,GAAgCtB,UAAU,CAAC,IAAI,CAACjd,KAAK,CAAC;AAA/Cwe,QAAAA,WAAW,GAAAD,WAAA,CAAA,CAAA,CAAA;AAAEpB,QAAAA,QAAQ,GAAAoB,WAAA,CAAA,CAAA,CAAA,CAAA;MAC5B,IAAI,CAACpoB,KAAK,GAAGC,MAAM,CAACooB,WAAW,EAAE,GAAG,CAAC,CAAA;MACrC,IAAI,CAACrB,QAAQ,GAAGA,QAAQ,CAAA;AAC1B,KAAA;AACF,GAAA;AAAC,EAAA,IAAAl6B,MAAA,GAAAo7B,WAAA,CAAAn7B,SAAA,CAAA;AAAAD,EAAAA,MAAA,CAEDw7B,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBlrB,KAAK,EAAE;AACvB,IAAA,IAAI,CAAC,IAAI,CAAC+Q,OAAO,EAAE;MACjB,OAAO;AAAE/Q,QAAAA,KAAK,EAALA,KAAK;QAAE+R,MAAM,EAAE,IAAI,CAACA,MAAM;QAAEiL,aAAa,EAAE,IAAI,CAACA,aAAAA;OAAe,CAAA;AAC1E,KAAC,MAAM;AACL,MAAA,IAAAmO,MAAA,GAA8BvrB,KAAK,CAACI,KAAK,EAAE,IAAI,CAAC4C,KAAK,EAAE,IAAI,CAACgnB,QAAQ,CAAC;AAA9DwB,QAAAA,UAAU,GAAAD,MAAA,CAAA,CAAA,CAAA;AAAEtB,QAAAA,OAAO,GAAAsB,MAAA,CAAA,CAAA,CAAA;AAAAvG,QAAAA,KAAA,GACSiF,OAAO,GACpCG,mBAAmB,CAACH,OAAO,CAAC,GAC5B,CAAC,IAAI,EAAE,IAAI,EAAEn4B,SAAS,CAAC;AAF1B2lB,QAAAA,MAAM,GAAAuN,KAAA,CAAA,CAAA,CAAA;AAAEnxB,QAAAA,IAAI,GAAAmxB,KAAA,CAAA,CAAA,CAAA;AAAEsF,QAAAA,cAAc,GAAAtF,KAAA,CAAA,CAAA,CAAA,CAAA;AAG/B,MAAA,IAAIvc,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,IAAIxhB,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,EAAE;AAChE,QAAA,MAAM,IAAI/8B,6BAA6B,CACrC,uDACF,CAAC,CAAA;AACH,OAAA;MACA,OAAO;AACLkT,QAAAA,KAAK,EAALA,KAAK;QACL+R,MAAM,EAAE,IAAI,CAACA,MAAM;QACnBnP,KAAK,EAAE,IAAI,CAACA,KAAK;AACjBwoB,QAAAA,UAAU,EAAVA,UAAU;AACVvB,QAAAA,OAAO,EAAPA,OAAO;AACPxS,QAAAA,MAAM,EAANA,MAAM;AACN5jB,QAAAA,IAAI,EAAJA,IAAI;AACJy2B,QAAAA,cAAc,EAAdA,cAAAA;OACD,CAAA;AACH,KAAA;GACD,CAAA;AAAA95B,EAAAA,YAAA,CAAA06B,WAAA,EAAA,CAAA;IAAAz6B,GAAA,EAAA,SAAA;IAAAC,GAAA,EAED,SAAAA,GAAAA,GAAc;MACZ,OAAO,CAAC,IAAI,CAACy6B,iBAAiB,CAAA;AAChC,KAAA;AAAC,GAAA,EAAA;IAAA16B,GAAA,EAAA,eAAA;IAAAC,GAAA,EAED,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAACy6B,iBAAiB,GAAG,IAAI,CAACA,iBAAiB,CAAC/N,aAAa,GAAG,IAAI,CAAA;AAC7E,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAA8N,WAAA,CAAA;AAAA,CAAA,EAAA,CAAA;AAGI,SAASI,iBAAiBA,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;EACvD,IAAMq7B,MAAM,GAAG,IAAIP,WAAW,CAACl6B,MAAM,EAAEZ,MAAM,CAAC,CAAA;AAC9C,EAAA,OAAOq7B,MAAM,CAACH,iBAAiB,CAAClrB,KAAK,CAAC,CAAA;AACxC,CAAA;AAEO,SAASsrB,eAAeA,CAAC16B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;EACrD,IAAAu7B,kBAAA,GAAwDL,iBAAiB,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,CAAC;IAAxFqnB,MAAM,GAAAkU,kBAAA,CAANlU,MAAM;IAAE5jB,IAAI,GAAA83B,kBAAA,CAAJ93B,IAAI;IAAEy2B,cAAc,GAAAqB,kBAAA,CAAdrB,cAAc;IAAElN,aAAa,GAAAuO,kBAAA,CAAbvO,aAAa,CAAA;EACnD,OAAO,CAAC3F,MAAM,EAAE5jB,IAAI,EAAEy2B,cAAc,EAAElN,aAAa,CAAC,CAAA;AACtD,CAAA;AAEO,SAAS4N,kBAAkBA,CAAC/a,UAAU,EAAEjf,MAAM,EAAE;EACrD,IAAI,CAACif,UAAU,EAAE;AACf,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;EAEA,IAAM2b,SAAS,GAAGpc,SAAS,CAAC5b,MAAM,CAAC5C,MAAM,EAAEif,UAAU,CAAC,CAAA;EACtD,IAAMvR,EAAE,GAAGktB,SAAS,CAAC1tB,WAAW,CAAC4sB,gBAAgB,EAAE,CAAC,CAAA;AACpD,EAAA,IAAMnwB,KAAK,GAAG+D,EAAE,CAACzL,aAAa,EAAE,CAAA;AAChC,EAAA,IAAM02B,YAAY,GAAGjrB,EAAE,CAACnN,eAAe,EAAE,CAAA;AACzC,EAAA,OAAOoJ,KAAK,CAACH,GAAG,CAAC,UAACoW,CAAC,EAAA;AAAA,IAAA,OAAK8Y,YAAY,CAAC9Y,CAAC,EAAEX,UAAU,EAAE0Z,YAAY,CAAC,CAAA;GAAC,CAAA,CAAA;AACpE;;ACncA,IAAMpQ,OAAO,GAAG,kBAAkB,CAAA;AAClC,IAAMsS,QAAQ,GAAG,OAAO,CAAA;AAExB,SAASC,eAAeA,CAACj4B,IAAI,EAAE;EAC7B,OAAO,IAAI2P,OAAO,CAAC,kBAAkB,kBAAe3P,IAAI,CAAClD,IAAI,GAAA,qBAAoB,CAAC,CAAA;AACpF,CAAA;;AAEA;AACA;AACA;AACA;AACA,SAASo7B,sBAAsBA,CAAC5zB,EAAE,EAAE;AAClC,EAAA,IAAIA,EAAE,CAACmN,QAAQ,KAAK,IAAI,EAAE;IACxBnN,EAAE,CAACmN,QAAQ,GAAGR,eAAe,CAAC3M,EAAE,CAAC2X,CAAC,CAAC,CAAA;AACrC,GAAA;EACA,OAAO3X,EAAE,CAACmN,QAAQ,CAAA;AACpB,CAAA;;AAEA;AACA;AACA;AACA,SAAS0mB,2BAA2BA,CAAC7zB,EAAE,EAAE;AACvC,EAAA,IAAIA,EAAE,CAAC8zB,aAAa,KAAK,IAAI,EAAE;IAC7B9zB,EAAE,CAAC8zB,aAAa,GAAGnnB,eAAe,CAChC3M,EAAE,CAAC2X,CAAC,EACJ3X,EAAE,CAACM,GAAG,CAAC8G,qBAAqB,EAAE,EAC9BpH,EAAE,CAACM,GAAG,CAAC6G,cAAc,EACvB,CAAC,CAAA;AACH,GAAA;EACA,OAAOnH,EAAE,CAAC8zB,aAAa,CAAA;AACzB,CAAA;;AAEA;AACA;AACA,SAAS1uB,KAAKA,CAAC2uB,IAAI,EAAE1uB,IAAI,EAAE;AACzB,EAAA,IAAMmS,OAAO,GAAG;IACd1f,EAAE,EAAEi8B,IAAI,CAACj8B,EAAE;IACX4D,IAAI,EAAEq4B,IAAI,CAACr4B,IAAI;IACfic,CAAC,EAAEoc,IAAI,CAACpc,CAAC;IACTtI,CAAC,EAAE0kB,IAAI,CAAC1kB,CAAC;IACT/O,GAAG,EAAEyzB,IAAI,CAACzzB,GAAG;IACb6iB,OAAO,EAAE4Q,IAAI,CAAC5Q,OAAAA;GACf,CAAA;AACD,EAAA,OAAO,IAAIljB,QAAQ,CAAArB,QAAA,CAAM4Y,EAAAA,EAAAA,OAAO,EAAKnS,IAAI,EAAA;AAAE2uB,IAAAA,GAAG,EAAExc,OAAAA;AAAO,GAAA,CAAE,CAAC,CAAA;AAC5D,CAAA;;AAEA;AACA;AACA,SAASyc,SAASA,CAACC,OAAO,EAAE7kB,CAAC,EAAE8kB,EAAE,EAAE;AACjC;EACA,IAAIC,QAAQ,GAAGF,OAAO,GAAG7kB,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;;AAEtC;AACA,EAAA,IAAMglB,EAAE,GAAGF,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;;AAE9B;EACA,IAAI/kB,CAAC,KAAKglB,EAAE,EAAE;AACZ,IAAA,OAAO,CAACD,QAAQ,EAAE/kB,CAAC,CAAC,CAAA;AACtB,GAAA;;AAEA;EACA+kB,QAAQ,IAAI,CAACC,EAAE,GAAGhlB,CAAC,IAAI,EAAE,GAAG,IAAI,CAAA;;AAEhC;AACA,EAAA,IAAMilB,EAAE,GAAGH,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;EAC9B,IAAIC,EAAE,KAAKC,EAAE,EAAE;AACb,IAAA,OAAO,CAACF,QAAQ,EAAEC,EAAE,CAAC,CAAA;AACvB,GAAA;;AAEA;EACA,OAAO,CAACH,OAAO,GAAG53B,IAAI,CAAC+N,GAAG,CAACgqB,EAAE,EAAEC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAEh4B,IAAI,CAACgO,GAAG,CAAC+pB,EAAE,EAAEC,EAAE,CAAC,CAAC,CAAA;AACnE,CAAA;;AAEA;AACA,SAASC,OAAOA,CAACz8B,EAAE,EAAEI,MAAM,EAAE;AAC3BJ,EAAAA,EAAE,IAAII,MAAM,GAAG,EAAE,GAAG,IAAI,CAAA;AAExB,EAAA,IAAMyT,CAAC,GAAG,IAAI5S,IAAI,CAACjB,EAAE,CAAC,CAAA;EAEtB,OAAO;AACLlC,IAAAA,IAAI,EAAE+V,CAAC,CAACG,cAAc,EAAE;AACxBjW,IAAAA,KAAK,EAAE8V,CAAC,CAAC6oB,WAAW,EAAE,GAAG,CAAC;AAC1B1+B,IAAAA,GAAG,EAAE6V,CAAC,CAAC8oB,UAAU,EAAE;AACnBp+B,IAAAA,IAAI,EAAEsV,CAAC,CAAC+oB,WAAW,EAAE;AACrBp+B,IAAAA,MAAM,EAAEqV,CAAC,CAACgpB,aAAa,EAAE;AACzBn+B,IAAAA,MAAM,EAAEmV,CAAC,CAACipB,aAAa,EAAE;AACzBj4B,IAAAA,WAAW,EAAEgP,CAAC,CAACkpB,kBAAkB,EAAC;GACnC,CAAA;AACH,CAAA;;AAEA;AACA,SAASC,OAAOA,CAAChnB,GAAG,EAAE5V,MAAM,EAAEwD,IAAI,EAAE;EAClC,OAAOu4B,SAAS,CAACv3B,YAAY,CAACoR,GAAG,CAAC,EAAE5V,MAAM,EAAEwD,IAAI,CAAC,CAAA;AACnD,CAAA;;AAEA;AACA,SAASq5B,UAAUA,CAAChB,IAAI,EAAEza,GAAG,EAAE;AAC7B,EAAA,IAAM0b,IAAI,GAAGjB,IAAI,CAAC1kB,CAAC;AACjBzZ,IAAAA,IAAI,GAAGm+B,IAAI,CAACpc,CAAC,CAAC/hB,IAAI,GAAG0G,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;IAC1C9e,KAAK,GAAGk+B,IAAI,CAACpc,CAAC,CAAC9hB,KAAK,GAAGyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC,GAAG,CAAC;AAC5E+C,IAAAA,CAAC,GAAA/Y,QAAA,CACIm1B,EAAAA,EAAAA,IAAI,CAACpc,CAAC,EAAA;AACT/hB,MAAAA,IAAI,EAAJA,IAAI;AACJC,MAAAA,KAAK,EAALA,KAAK;AACLC,MAAAA,GAAG,EACDwG,IAAI,CAAC+N,GAAG,CAAC0pB,IAAI,CAACpc,CAAC,CAAC7hB,GAAG,EAAEiZ,WAAW,CAACnZ,IAAI,EAAEC,KAAK,CAAC,CAAC,GAC9CyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC,GACpBxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC,GAAG,CAAA;KAC3B,CAAA;AACDogB,IAAAA,WAAW,GAAGjT,QAAQ,CAAC5d,UAAU,CAAC;AAChCuQ,MAAAA,KAAK,EAAE2E,GAAG,CAAC3E,KAAK,GAAGrY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;AACxCC,MAAAA,QAAQ,EAAE0E,GAAG,CAAC1E,QAAQ,GAAGtY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC;AACjDnP,MAAAA,MAAM,EAAE6T,GAAG,CAAC7T,MAAM,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC;AAC3CoP,MAAAA,KAAK,EAAEyE,GAAG,CAACzE,KAAK,GAAGvY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC;AACxCC,MAAAA,IAAI,EAAEwE,GAAG,CAACxE,IAAI,GAAGxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC;MACrCtB,KAAK,EAAE8F,GAAG,CAAC9F,KAAK;MAChBrR,OAAO,EAAEmX,GAAG,CAACnX,OAAO;MACpB4S,OAAO,EAAEuE,GAAG,CAACvE,OAAO;MACpBuI,YAAY,EAAEhE,GAAG,CAACgE,YAAAA;AACpB,KAAC,CAAC,CAACwI,EAAE,CAAC,cAAc,CAAC;AACrBoO,IAAAA,OAAO,GAAGx3B,YAAY,CAACib,CAAC,CAAC,CAAA;EAE3B,IAAAud,UAAA,GAAcjB,SAAS,CAACC,OAAO,EAAEc,IAAI,EAAEjB,IAAI,CAACr4B,IAAI,CAAC;AAA5C5D,IAAAA,EAAE,GAAAo9B,UAAA,CAAA,CAAA,CAAA;AAAE7lB,IAAAA,CAAC,GAAA6lB,UAAA,CAAA,CAAA,CAAA,CAAA;EAEV,IAAID,WAAW,KAAK,CAAC,EAAE;AACrBn9B,IAAAA,EAAE,IAAIm9B,WAAW,CAAA;AACjB;IACA5lB,CAAC,GAAG0kB,IAAI,CAACr4B,IAAI,CAACxD,MAAM,CAACJ,EAAE,CAAC,CAAA;AAC1B,GAAA;EAEA,OAAO;AAAEA,IAAAA,EAAE,EAAFA,EAAE;AAAEuX,IAAAA,CAAC,EAADA,CAAAA;GAAG,CAAA;AAClB,CAAA;;AAEA;AACA;AACA,SAAS8lB,mBAAmBA,CAAC/6B,MAAM,EAAEg7B,UAAU,EAAEr9B,IAAI,EAAEE,MAAM,EAAE0rB,IAAI,EAAEwO,cAAc,EAAE;AACnF,EAAA,IAAQlwB,OAAO,GAAWlK,IAAI,CAAtBkK,OAAO;IAAEvG,IAAI,GAAK3D,IAAI,CAAb2D,IAAI,CAAA;AACrB,EAAA,IAAKtB,MAAM,IAAIgH,MAAM,CAACC,IAAI,CAACjH,MAAM,CAAC,CAACa,MAAM,KAAK,CAAC,IAAKm6B,UAAU,EAAE;AAC9D,IAAA,IAAMC,kBAAkB,GAAGD,UAAU,IAAI15B,IAAI;MAC3Cq4B,IAAI,GAAG9zB,QAAQ,CAACmE,UAAU,CAAChK,MAAM,EAAAwE,QAAA,CAAA,EAAA,EAC5B7G,IAAI,EAAA;AACP2D,QAAAA,IAAI,EAAE25B,kBAAkB;AACxBlD,QAAAA,cAAc,EAAdA,cAAAA;AAAc,OAAA,CACf,CAAC,CAAA;IACJ,OAAOlwB,OAAO,GAAG8xB,IAAI,GAAGA,IAAI,CAAC9xB,OAAO,CAACvG,IAAI,CAAC,CAAA;AAC5C,GAAC,MAAM;AACL,IAAA,OAAOuE,QAAQ,CAACkjB,OAAO,CACrB,IAAI9X,OAAO,CAAC,YAAY,EAAgBsY,cAAAA,GAAAA,IAAI,GAAwB1rB,wBAAAA,GAAAA,MAAQ,CAC9E,CAAC,CAAA;AACH,GAAA;AACF,CAAA;;AAEA;AACA;AACA,SAASq9B,YAAYA,CAACt1B,EAAE,EAAE/H,MAAM,EAAE8gB,MAAM,EAAS;AAAA,EAAA,IAAfA,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,IAAAA,MAAM,GAAG,IAAI,CAAA;AAAA,GAAA;AAC7C,EAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GACb3B,SAAS,CAAC5b,MAAM,CAACgD,MAAM,CAAChD,MAAM,CAAC,OAAO,CAAC,EAAE;AACvCsd,IAAAA,MAAM,EAANA,MAAM;AACNhY,IAAAA,WAAW,EAAE,IAAA;GACd,CAAC,CAAC4X,wBAAwB,CAAC3Y,EAAE,EAAE/H,MAAM,CAAC,GACvC,IAAI,CAAA;AACV,CAAA;AAEA,SAASuyB,UAASA,CAACnb,CAAC,EAAEkmB,QAAQ,EAAEC,SAAS,EAAE;AACzC,EAAA,IAAMC,UAAU,GAAGpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,IAAI,IAAIyZ,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,CAAC,CAAA;EAClD,IAAI+hB,CAAC,GAAG,EAAE,CAAA;AACV,EAAA,IAAI8d,UAAU,IAAIpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,IAAI,CAAC,EAAE+hB,CAAC,IAAI,GAAG,CAAA;AACzCA,EAAAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,EAAE6/B,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC3C,EAAA,IAAID,SAAS,KAAK,MAAM,EAAE,OAAO7d,CAAC,CAAA;AAClC,EAAA,IAAI4d,QAAQ,EAAE;AACZ5d,IAAAA,CAAC,IAAI,GAAG,CAAA;IACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;AACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;AACnCA,IAAAA,CAAC,IAAI,GAAG,CAAA;AACV,GAAC,MAAM;IACLA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;AACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;AACrC,GAAA;EACAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC7hB,GAAG,CAAC,CAAA;AACtB,EAAA,OAAO6hB,CAAC,CAAA;AACV,CAAA;AAEA,SAAS6M,UAASA,CAChBnV,CAAC,EACDkmB,QAAQ,EACR3Q,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SAAS,EACT;AACA,EAAA,IAAIG,WAAW,GAAG,CAAC/Q,eAAe,IAAIvV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,IAAI0S,CAAC,CAACsI,CAAC,CAACnhB,MAAM,KAAK,CAAC;AAC7EmhB,IAAAA,CAAC,GAAG,EAAE,CAAA;AACR,EAAA,QAAQ6d,SAAS;AACf,IAAA,KAAK,KAAK,CAAA;AACV,IAAA,KAAK,OAAO,CAAA;AACZ,IAAA,KAAK,MAAM;AACT,MAAA,MAAA;AACF,IAAA;MACE7d,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACthB,IAAI,CAAC,CAAA;MACvB,IAAIm/B,SAAS,KAAK,MAAM,EAAE,MAAA;AAC1B,MAAA,IAAID,QAAQ,EAAE;AACZ5d,QAAAA,CAAC,IAAI,GAAG,CAAA;QACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;QACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,QAAA,IAAIG,WAAW,EAAE;AACfhe,UAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;AAC3B,SAAA;AACF,OAAC,MAAM;QACLmhB,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;QACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,QAAA,IAAIG,WAAW,EAAE;UACfhe,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;AAC3B,SAAA;AACF,OAAA;MACA,IAAIg/B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,MAAA,IAAIG,WAAW,KAAK,CAAChR,oBAAoB,IAAItV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,CAAC,EAAE;AACnEgb,QAAAA,CAAC,IAAI,GAAG,CAAA;QACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAChb,WAAW,EAAE,CAAC,CAAC,CAAA;AACnC,OAAA;AACJ,GAAA;AAEA,EAAA,IAAImoB,aAAa,EAAE;AACjB,IAAA,IAAIzV,CAAC,CAACyJ,aAAa,IAAIzJ,CAAC,CAACnX,MAAM,KAAK,CAAC,IAAI,CAACw9B,YAAY,EAAE;AACtD/d,MAAAA,CAAC,IAAI,GAAG,CAAA;AACV,KAAC,MAAM,IAAItI,CAAC,CAACA,CAAC,GAAG,CAAC,EAAE;AAClBsI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACpCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACtC,KAAC,MAAM;AACLsI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACnCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;AAEA,EAAA,IAAIqmB,YAAY,EAAE;IAChB/d,CAAC,IAAI,GAAG,GAAGtI,CAAC,CAAC3T,IAAI,CAACk6B,QAAQ,GAAG,GAAG,CAAA;AAClC,GAAA;AACA,EAAA,OAAOje,CAAC,CAAA;AACV,CAAA;;AAEA;AACA,IAAMke,iBAAiB,GAAG;AACtBhgC,IAAAA,KAAK,EAAE,CAAC;AACRC,IAAAA,GAAG,EAAE,CAAC;AACNO,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACTmG,IAAAA,WAAW,EAAE,CAAA;GACd;AACDm5B,EAAAA,qBAAqB,GAAG;AACtBhpB,IAAAA,UAAU,EAAE,CAAC;AACb7W,IAAAA,OAAO,EAAE,CAAC;AACVI,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACTmG,IAAAA,WAAW,EAAE,CAAA;GACd;AACDo5B,EAAAA,wBAAwB,GAAG;AACzB3pB,IAAAA,OAAO,EAAE,CAAC;AACV/V,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACTmG,IAAAA,WAAW,EAAE,CAAA;GACd,CAAA;;AAEH;AACA,IAAM+kB,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC;AACtFsU,EAAAA,gBAAgB,GAAG,CACjB,UAAU,EACV,YAAY,EACZ,SAAS,EACT,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,CACd;AACDC,EAAAA,mBAAmB,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;;AAEtF;AACA,SAAS3S,aAAaA,CAACnuB,IAAI,EAAE;AAC3B,EAAA,IAAMme,UAAU,GAAG;AACjB1d,IAAAA,IAAI,EAAE,MAAM;AACZ+e,IAAAA,KAAK,EAAE,MAAM;AACb9e,IAAAA,KAAK,EAAE,OAAO;AACd4P,IAAAA,MAAM,EAAE,OAAO;AACf3P,IAAAA,GAAG,EAAE,KAAK;AACVgf,IAAAA,IAAI,EAAE,KAAK;AACXze,IAAAA,IAAI,EAAE,MAAM;AACZmd,IAAAA,KAAK,EAAE,MAAM;AACbld,IAAAA,MAAM,EAAE,QAAQ;AAChB6L,IAAAA,OAAO,EAAE,QAAQ;AACjBiX,IAAAA,OAAO,EAAE,SAAS;AAClBxE,IAAAA,QAAQ,EAAE,SAAS;AACnBpe,IAAAA,MAAM,EAAE,QAAQ;AAChBue,IAAAA,OAAO,EAAE,QAAQ;AACjBpY,IAAAA,WAAW,EAAE,aAAa;AAC1B2gB,IAAAA,YAAY,EAAE,aAAa;AAC3BrnB,IAAAA,OAAO,EAAE,SAAS;AAClB+P,IAAAA,QAAQ,EAAE,SAAS;AACnBkwB,IAAAA,UAAU,EAAE,YAAY;AACxBC,IAAAA,WAAW,EAAE,YAAY;AACzBC,IAAAA,WAAW,EAAE,YAAY;AACzBC,IAAAA,QAAQ,EAAE,UAAU;AACpBC,IAAAA,SAAS,EAAE,UAAU;AACrBlqB,IAAAA,OAAO,EAAE,SAAA;AACX,GAAC,CAACjX,IAAI,CAACyR,WAAW,EAAE,CAAC,CAAA;EAErB,IAAI,CAAC0M,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;AAEjD,EAAA,OAAOme,UAAU,CAAA;AACnB,CAAA;AAEA,SAASijB,2BAA2BA,CAACphC,IAAI,EAAE;AACzC,EAAA,QAAQA,IAAI,CAACyR,WAAW,EAAE;AACxB,IAAA,KAAK,cAAc,CAAA;AACnB,IAAA,KAAK,eAAe;AAClB,MAAA,OAAO,cAAc,CAAA;AACvB,IAAA,KAAK,iBAAiB,CAAA;AACtB,IAAA,KAAK,kBAAkB;AACrB,MAAA,OAAO,iBAAiB,CAAA;AAC1B,IAAA,KAAK,eAAe,CAAA;AACpB,IAAA,KAAK,gBAAgB;AACnB,MAAA,OAAO,eAAe,CAAA;AACxB,IAAA;MACE,OAAO0c,aAAa,CAACnuB,IAAI,CAAC,CAAA;AAC9B,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqhC,kBAAkBA,CAAC96B,IAAI,EAAE;EAChC,IAAI+6B,YAAY,KAAK98B,SAAS,EAAE;AAC9B88B,IAAAA,YAAY,GAAG/yB,QAAQ,CAACqH,GAAG,EAAE,CAAA;AAC/B,GAAA;;AAEA;AACA;AACA,EAAA,IAAIrP,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;AACxB,IAAA,OAAOyC,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;AAClC,GAAA;AACA,EAAA,IAAMh9B,QAAQ,GAAGiC,IAAI,CAAClD,IAAI,CAAA;AAC1B,EAAA,IAAIk+B,WAAW,GAAGC,oBAAoB,CAACp+B,GAAG,CAACkB,QAAQ,CAAC,CAAA;EACpD,IAAIi9B,WAAW,KAAK/8B,SAAS,EAAE;AAC7B+8B,IAAAA,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;AACvCE,IAAAA,oBAAoB,CAAC78B,GAAG,CAACL,QAAQ,EAAEi9B,WAAW,CAAC,CAAA;AACjD,GAAA;AACA,EAAA,OAAOA,WAAW,CAAA;AACpB,CAAA;;AAEA;AACA;AACA;AACA,SAASE,OAAOA,CAAC9oB,GAAG,EAAE/V,IAAI,EAAE;EAC1B,IAAM2D,IAAI,GAAGsM,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;AAC3D,EAAA,IAAI,CAACxM,IAAI,CAACsd,OAAO,EAAE;IACjB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;AAChD,GAAA;AAEA,EAAA,IAAM4E,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;EAEnC,IAAID,EAAE,EAAEuX,CAAC,CAAA;;AAET;AACA,EAAA,IAAI,CAAChU,WAAW,CAACyS,GAAG,CAAClY,IAAI,CAAC,EAAE;AAC1B,IAAA,KAAA,IAAAgmB,EAAA,GAAA,CAAA,EAAAyJ,aAAA,GAAgB3D,YAAY,EAAA9F,EAAA,GAAAyJ,aAAA,CAAApqB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;AAAzB,MAAA,IAAMrI,CAAC,GAAA8R,aAAA,CAAAzJ,EAAA,CAAA,CAAA;AACV,MAAA,IAAIvgB,WAAW,CAACyS,GAAG,CAACyF,CAAC,CAAC,CAAC,EAAE;AACvBzF,QAAAA,GAAG,CAACyF,CAAC,CAAC,GAAGsiB,iBAAiB,CAACtiB,CAAC,CAAC,CAAA;AAC/B,OAAA;AACF,KAAA;IAEA,IAAM4P,OAAO,GAAGvU,uBAAuB,CAACd,GAAG,CAAC,IAAIkB,kBAAkB,CAAClB,GAAG,CAAC,CAAA;AACvE,IAAA,IAAIqV,OAAO,EAAE;AACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAA;AAEA,IAAA,IAAM0T,YAAY,GAAGL,kBAAkB,CAAC96B,IAAI,CAAC,CAAA;IAAC,IAAAo7B,QAAA,GACpChC,OAAO,CAAChnB,GAAG,EAAE+oB,YAAY,EAAEn7B,IAAI,CAAC,CAAA;AAAzC5D,IAAAA,EAAE,GAAAg/B,QAAA,CAAA,CAAA,CAAA,CAAA;AAAEznB,IAAAA,CAAC,GAAAynB,QAAA,CAAA,CAAA,CAAA,CAAA;AACR,GAAC,MAAM;AACLh/B,IAAAA,EAAE,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,CAAA;AACrB,GAAA;EAEA,OAAO,IAAI9K,QAAQ,CAAC;AAAEnI,IAAAA,EAAE,EAAFA,EAAE;AAAE4D,IAAAA,IAAI,EAAJA,IAAI;AAAE4E,IAAAA,GAAG,EAAHA,GAAG;AAAE+O,IAAAA,CAAC,EAADA,CAAAA;AAAE,GAAC,CAAC,CAAA;AAC3C,CAAA;AAEA,SAAS0nB,YAAYA,CAAC1e,KAAK,EAAEE,GAAG,EAAExgB,IAAI,EAAE;AACtC,EAAA,IAAMga,KAAK,GAAG1W,WAAW,CAACtD,IAAI,CAACga,KAAK,CAAC,GAAG,IAAI,GAAGha,IAAI,CAACga,KAAK;AACvDL,IAAAA,QAAQ,GAAGrW,WAAW,CAACtD,IAAI,CAAC2Z,QAAQ,CAAC,GAAG,OAAO,GAAG3Z,IAAI,CAAC2Z,QAAQ;AAC/DzZ,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAI0f,CAAC,EAAExiB,IAAI,EAAK;MACpBwiB,CAAC,GAAGjW,OAAO,CAACiW,CAAC,EAAE5F,KAAK,IAAIha,IAAI,CAACi/B,SAAS,GAAG,CAAC,GAAG,CAAC,EAAEj/B,IAAI,CAACi/B,SAAS,GAAG,OAAO,GAAGtlB,QAAQ,CAAC,CAAA;AACpF,MAAA,IAAM+hB,SAAS,GAAGlb,GAAG,CAACjY,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,CAACgP,YAAY,CAAChP,IAAI,CAAC,CAAA;AACxD,MAAA,OAAO07B,SAAS,CAACx7B,MAAM,CAAC0f,CAAC,EAAExiB,IAAI,CAAC,CAAA;KACjC;AACDy5B,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIz5B,IAAI,EAAK;MACjB,IAAI4C,IAAI,CAACi/B,SAAS,EAAE;QAClB,IAAI,CAACze,GAAG,CAAC+P,OAAO,CAACjQ,KAAK,EAAEljB,IAAI,CAAC,EAAE;UAC7B,OAAOojB,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,CAAC,CAACkzB,IAAI,CAAChQ,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;SACnE,MAAM,OAAO,CAAC,CAAA;AACjB,OAAC,MAAM;AACL,QAAA,OAAOojB,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;AACxC,OAAA;KACD,CAAA;EAEH,IAAI4C,IAAI,CAAC5C,IAAI,EAAE;AACb,IAAA,OAAO8C,MAAM,CAAC22B,MAAM,CAAC72B,IAAI,CAAC5C,IAAI,CAAC,EAAE4C,IAAI,CAAC5C,IAAI,CAAC,CAAA;AAC7C,GAAA;AAEA,EAAA,KAAA,IAAAugB,SAAA,GAAAC,+BAAA,CAAmB5d,IAAI,CAAC2c,KAAK,CAAAkB,EAAAA,KAAA,IAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;AAAA,IAAA,IAApB1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;AACb,IAAA,IAAM6H,KAAK,GAAG4rB,MAAM,CAACz5B,IAAI,CAAC,CAAA;IAC1B,IAAImH,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC,IAAI,CAAC,EAAE;AACxB,MAAA,OAAO/K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;AAC5B,KAAA;AACF,GAAA;EACA,OAAO8C,MAAM,CAACogB,KAAK,GAAGE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAExgB,IAAI,CAAC2c,KAAK,CAAC3c,IAAI,CAAC2c,KAAK,CAACzZ,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;AACxE,CAAA;AAEA,SAASg8B,QAAQA,CAACC,OAAO,EAAE;EACzB,IAAIn/B,IAAI,GAAG,EAAE;IACXo/B,IAAI,CAAA;AACN,EAAA,IAAID,OAAO,CAACj8B,MAAM,GAAG,CAAC,IAAI,OAAOi8B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE;IACzElD,IAAI,GAAGm/B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;AAClCk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAC/d,KAAK,CAAC,CAAC,EAAE+d,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;AACzD,GAAC,MAAM;AACLk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAO,CAACn/B,IAAI,EAAEo/B,IAAI,CAAC,CAAA;AACrB,CAAA;;AAEA;AACA;AACA;AACA,IAAIV,YAAY,CAAA;AAChB;AACA;AACA;AACA;AACA;AACA;AACA,IAAME,oBAAoB,GAAG,IAAIp9B,GAAG,EAAE,CAAA;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACqB0G,IAAAA,QAAQ,0BAAA+iB,WAAA,EAAA;AAC3B;AACF;AACA;EACE,SAAA/iB,QAAAA,CAAYgjB,MAAM,EAAE;IAClB,IAAMvnB,IAAI,GAAGunB,MAAM,CAACvnB,IAAI,IAAIgI,QAAQ,CAACwE,WAAW,CAAA;AAEhD,IAAA,IAAIib,OAAO,GACTF,MAAM,CAACE,OAAO,KACbtQ,MAAM,CAAC1W,KAAK,CAAC8mB,MAAM,CAACnrB,EAAE,CAAC,GAAG,IAAIuT,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,KAC9D,CAAC3P,IAAI,CAACsd,OAAO,GAAG2a,eAAe,CAACj4B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;AAChD;AACJ;AACA;AACI,IAAA,IAAI,CAAC5D,EAAE,GAAGuD,WAAW,CAAC4nB,MAAM,CAACnrB,EAAE,CAAC,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,GAAGkY,MAAM,CAACnrB,EAAE,CAAA;IAE7D,IAAI6f,CAAC,GAAG,IAAI;AACVtI,MAAAA,CAAC,GAAG,IAAI,CAAA;IACV,IAAI,CAAC8T,OAAO,EAAE;MACZ,IAAMiU,SAAS,GAAGnU,MAAM,CAAC+Q,GAAG,IAAI/Q,MAAM,CAAC+Q,GAAG,CAACl8B,EAAE,KAAK,IAAI,CAACA,EAAE,IAAImrB,MAAM,CAAC+Q,GAAG,CAACt4B,IAAI,CAACvD,MAAM,CAACuD,IAAI,CAAC,CAAA;AAEzF,MAAA,IAAI07B,SAAS,EAAE;AAAA,QAAA,IAAAx+B,IAAA,GACJ,CAACqqB,MAAM,CAAC+Q,GAAG,CAACrc,CAAC,EAAEsL,MAAM,CAAC+Q,GAAG,CAAC3kB,CAAC,CAAC,CAAA;AAApCsI,QAAAA,CAAC,GAAA/e,IAAA,CAAA,CAAA,CAAA,CAAA;AAAEyW,QAAAA,CAAC,GAAAzW,IAAA,CAAA,CAAA,CAAA,CAAA;AACP,OAAC,MAAM;AACL;AACA;QACA,IAAMy+B,EAAE,GAAGhvB,QAAQ,CAAC4a,MAAM,CAAC5T,CAAC,CAAC,IAAI,CAAC4T,MAAM,CAAC+Q,GAAG,GAAG/Q,MAAM,CAAC5T,CAAC,GAAG3T,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;QAC9E6f,CAAC,GAAG4c,OAAO,CAAC,IAAI,CAACz8B,EAAE,EAAEu/B,EAAE,CAAC,CAAA;AACxBlU,QAAAA,OAAO,GAAGtQ,MAAM,CAAC1W,KAAK,CAACwb,CAAC,CAAC/hB,IAAI,CAAC,GAAG,IAAIyV,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAA;AACpEsM,QAAAA,CAAC,GAAGwL,OAAO,GAAG,IAAI,GAAGxL,CAAC,CAAA;AACtBtI,QAAAA,CAAC,GAAG8T,OAAO,GAAG,IAAI,GAAGkU,EAAE,CAAA;AACzB,OAAA;AACF,KAAA;;AAEA;AACJ;AACA;IACI,IAAI,CAACC,KAAK,GAAG57B,IAAI,CAAA;AACjB;AACJ;AACA;IACI,IAAI,CAAC4E,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;AACxC;AACJ;AACA;IACI,IAAI,CAAC0nB,OAAO,GAAGA,OAAO,CAAA;AACtB;AACJ;AACA;IACI,IAAI,CAAChW,QAAQ,GAAG,IAAI,CAAA;AACpB;AACJ;AACA;IACI,IAAI,CAAC2mB,aAAa,GAAG,IAAI,CAAA;AACzB;AACJ;AACA;IACI,IAAI,CAACnc,CAAC,GAAGA,CAAC,CAAA;AACV;AACJ;AACA;IACI,IAAI,CAACtI,CAAC,GAAGA,CAAC,CAAA;AACV;AACJ;AACA;IACI,IAAI,CAACkoB,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AANEt3B,EAAAA,QAAA,CAOO8K,GAAG,GAAV,SAAAA,MAAa;AACX,IAAA,OAAO,IAAI9K,QAAQ,CAAC,EAAE,CAAC,CAAA;AACzB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MApBE;AAAAA,EAAAA,QAAA,CAqBOud,KAAK,GAAZ,SAAAA,QAAe;AACb,IAAA,IAAAga,SAAA,GAAqBP,QAAQ,CAAC9iC,SAAS,CAAC;AAAjC4D,MAAAA,IAAI,GAAAy/B,SAAA,CAAA,CAAA,CAAA;AAAEL,MAAAA,IAAI,GAAAK,SAAA,CAAA,CAAA,CAAA;AACd5hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;AAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;AAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;AAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;AAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;AAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;AAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;AAC9D,IAAA,OAAOP,OAAO,CAAC;AAAEhhC,MAAAA,IAAI,EAAJA,IAAI;AAAEC,MAAAA,KAAK,EAALA,KAAK;AAAEC,MAAAA,GAAG,EAAHA,GAAG;AAAEO,MAAAA,IAAI,EAAJA,IAAI;AAAEC,MAAAA,MAAM,EAANA,MAAM;AAAEE,MAAAA,MAAM,EAANA,MAAM;AAAEmG,MAAAA,WAAW,EAAXA,WAAAA;KAAa,EAAE5E,IAAI,CAAC,CAAA;AAC/E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAxBE;AAAAkI,EAAAA,QAAA,CAyBOC,GAAG,GAAV,SAAAA,MAAa;AACX,IAAA,IAAAu3B,UAAA,GAAqBR,QAAQ,CAAC9iC,SAAS,CAAC;AAAjC4D,MAAAA,IAAI,GAAA0/B,UAAA,CAAA,CAAA,CAAA;AAAEN,MAAAA,IAAI,GAAAM,UAAA,CAAA,CAAA,CAAA;AACd7hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;AAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;AAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;AAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;AAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;AAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;AAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;AAE9Dp/B,IAAAA,IAAI,CAAC2D,IAAI,GAAG8L,eAAe,CAACE,WAAW,CAAA;AACvC,IAAA,OAAOkvB,OAAO,CAAC;AAAEhhC,MAAAA,IAAI,EAAJA,IAAI;AAAEC,MAAAA,KAAK,EAALA,KAAK;AAAEC,MAAAA,GAAG,EAAHA,GAAG;AAAEO,MAAAA,IAAI,EAAJA,IAAI;AAAEC,MAAAA,MAAM,EAANA,MAAM;AAAEE,MAAAA,MAAM,EAANA,MAAM;AAAEmG,MAAAA,WAAW,EAAXA,WAAAA;KAAa,EAAE5E,IAAI,CAAC,CAAA;AAC/E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;EAAAkI,QAAA,CAOOy3B,UAAU,GAAjB,SAAAA,WAAkBz9B,IAAI,EAAEmF,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;AAClC,IAAA,IAAMtH,EAAE,GAAGwX,MAAM,CAACrV,IAAI,CAAC,GAAGA,IAAI,CAACirB,OAAO,EAAE,GAAGhpB,GAAG,CAAA;AAC9C,IAAA,IAAI2W,MAAM,CAAC1W,KAAK,CAACrE,EAAE,CAAC,EAAE;AACpB,MAAA,OAAOmI,QAAQ,CAACkjB,OAAO,CAAC,eAAe,CAAC,CAAA;AAC1C,KAAA;IAEA,IAAMwU,SAAS,GAAG3vB,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;AACnE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;MACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;AACrD,KAAA;IAEA,OAAO,IAAI13B,QAAQ,CAAC;AAClBnI,MAAAA,EAAE,EAAEA,EAAE;AACN4D,MAAAA,IAAI,EAAEi8B,SAAS;AACfr3B,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;AAChC,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAVE;EAAAa,QAAA,CAWOojB,UAAU,GAAjB,SAAAA,WAAkB/F,YAAY,EAAEle,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;AAC1C,IAAA,IAAI,CAACiJ,QAAQ,CAACiV,YAAY,CAAC,EAAE;AAC3B,MAAA,MAAM,IAAIloB,oBAAoB,CAAA,wDAAA,GAC6B,OAAOkoB,YAAY,GAAA,cAAA,GAAeA,YAC7F,CAAC,CAAA;KACF,MAAM,IAAIA,YAAY,GAAG,CAACoW,QAAQ,IAAIpW,YAAY,GAAGoW,QAAQ,EAAE;AAC9D;AACA,MAAA,OAAOzzB,QAAQ,CAACkjB,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACnD,KAAC,MAAM;MACL,OAAO,IAAIljB,QAAQ,CAAC;AAClBnI,QAAAA,EAAE,EAAEwlB,YAAY;QAChB5hB,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;AACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;AAChC,OAAC,CAAC,CAAA;AACJ,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAVE;EAAAa,QAAA,CAWO23B,WAAW,GAAlB,SAAAA,YAAmB7iB,OAAO,EAAE3V,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;AACtC,IAAA,IAAI,CAACiJ,QAAQ,CAAC0M,OAAO,CAAC,EAAE;AACtB,MAAA,MAAM,IAAI3f,oBAAoB,CAAC,wCAAwC,CAAC,CAAA;AAC1E,KAAC,MAAM;MACL,OAAO,IAAI6K,QAAQ,CAAC;QAClBnI,EAAE,EAAEid,OAAO,GAAG,IAAI;QAClBrZ,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;AACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;AAChC,OAAC,CAAC,CAAA;AACJ,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAhCE;EAAAa,QAAA,CAiCOmE,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAC9B+V,IAAAA,GAAG,GAAGA,GAAG,IAAI,EAAE,CAAA;IACf,IAAM6pB,SAAS,GAAG3vB,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;AAChE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;MACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;AACrD,KAAA;AAEA,IAAA,IAAMr3B,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;AACnC,IAAA,IAAMub,UAAU,GAAGF,eAAe,CAACtF,GAAG,EAAEyoB,2BAA2B,CAAC,CAAA;AACpE,IAAA,IAAAsB,oBAAA,GAA4ChqB,mBAAmB,CAACyF,UAAU,EAAEhT,GAAG,CAAC;MAAxEuM,kBAAkB,GAAAgrB,oBAAA,CAAlBhrB,kBAAkB;MAAEH,WAAW,GAAAmrB,oBAAA,CAAXnrB,WAAW,CAAA;AAEvC,IAAA,IAAMorB,KAAK,GAAGp0B,QAAQ,CAACqH,GAAG,EAAE;AAC1B8rB,MAAAA,YAAY,GAAG,CAACx7B,WAAW,CAACtD,IAAI,CAACo6B,cAAc,CAAC,GAC5Cp6B,IAAI,CAACo6B,cAAc,GACnBwF,SAAS,CAACz/B,MAAM,CAAC4/B,KAAK,CAAC;AAC3BC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;AAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;AAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;MACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;AACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;;AAEhE;AACA;AACA;AACA;AACA;;AAEA,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;AAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;AACH,KAAA;IAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;AACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;AACnF,KAAA;IAEA,IAAMqjC,WAAW,GAAGD,eAAe,IAAK7kB,UAAU,CAACrd,OAAO,IAAI,CAACiiC,cAAe,CAAA;;AAE9E;AACA,IAAA,IAAIxjB,KAAK;MACP2jB,aAAa;AACbC,MAAAA,MAAM,GAAG/D,OAAO,CAACuD,KAAK,EAAEjB,YAAY,CAAC,CAAA;AACvC,IAAA,IAAIuB,WAAW,EAAE;AACf1jB,MAAAA,KAAK,GAAGshB,gBAAgB,CAAA;AACxBqC,MAAAA,aAAa,GAAGvC,qBAAqB,CAAA;MACrCwC,MAAM,GAAG3rB,eAAe,CAAC2rB,MAAM,EAAEzrB,kBAAkB,EAAEH,WAAW,CAAC,CAAA;KAClE,MAAM,IAAIqrB,eAAe,EAAE;AAC1BrjB,MAAAA,KAAK,GAAGuhB,mBAAmB,CAAA;AAC3BoC,MAAAA,aAAa,GAAGtC,wBAAwB,CAAA;AACxCuC,MAAAA,MAAM,GAAG9qB,kBAAkB,CAAC8qB,MAAM,CAAC,CAAA;AACrC,KAAC,MAAM;AACL5jB,MAAAA,KAAK,GAAGgN,YAAY,CAAA;AACpB2W,MAAAA,aAAa,GAAGxC,iBAAiB,CAAA;AACnC,KAAA;;AAEA;IACA,IAAI0C,UAAU,GAAG,KAAK,CAAA;AACtB,IAAA,KAAA,IAAAC,UAAA,GAAA7iB,+BAAA,CAAgBjB,KAAK,CAAA,EAAA+jB,MAAA,EAAA,CAAA,CAAAA,MAAA,GAAAD,UAAA,EAAA,EAAA3iB,IAAA,GAAE;AAAA,MAAA,IAAZtC,CAAC,GAAAklB,MAAA,CAAAt9B,KAAA,CAAA;AACV,MAAA,IAAMuV,CAAC,GAAG4C,UAAU,CAACC,CAAC,CAAC,CAAA;AACvB,MAAA,IAAI,CAAClY,WAAW,CAACqV,CAAC,CAAC,EAAE;AACnB6nB,QAAAA,UAAU,GAAG,IAAI,CAAA;OAClB,MAAM,IAAIA,UAAU,EAAE;AACrBjlB,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG8kB,aAAa,CAAC9kB,CAAC,CAAC,CAAA;AAClC,OAAC,MAAM;AACLD,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG+kB,MAAM,CAAC/kB,CAAC,CAAC,CAAA;AAC3B,OAAA;AACF,KAAA;;AAEA;IACA,IAAMmlB,kBAAkB,GAAGN,WAAW,GAChChqB,kBAAkB,CAACkF,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC/DqrB,eAAe,GACfrpB,qBAAqB,CAAC4E,UAAU,CAAC,GACjC1E,uBAAuB,CAAC0E,UAAU,CAAC;AACvC6P,MAAAA,OAAO,GAAGuV,kBAAkB,IAAI1pB,kBAAkB,CAACsE,UAAU,CAAC,CAAA;AAEhE,IAAA,IAAI6P,OAAO,EAAE;AACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAA;;AAEA;IACM,IAAAwV,SAAS,GAAGP,WAAW,GACvBlrB,eAAe,CAACoG,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC5DqrB,eAAe,GACfrqB,kBAAkB,CAAC4F,UAAU,CAAC,GAC9BA,UAAU;MAAAslB,SAAA,GACW9D,OAAO,CAAC6D,SAAS,EAAE9B,YAAY,EAAEc,SAAS,CAAC;AAAnEkB,MAAAA,OAAO,GAAAD,SAAA,CAAA,CAAA,CAAA;AAAEE,MAAAA,WAAW,GAAAF,SAAA,CAAA,CAAA,CAAA;MACrB7E,IAAI,GAAG,IAAI9zB,QAAQ,CAAC;AAClBnI,QAAAA,EAAE,EAAE+gC,OAAO;AACXn9B,QAAAA,IAAI,EAAEi8B,SAAS;AACftoB,QAAAA,CAAC,EAAEypB,WAAW;AACdx4B,QAAAA,GAAG,EAAHA,GAAAA;AACF,OAAC,CAAC,CAAA;;AAEJ;AACA,IAAA,IAAIgT,UAAU,CAACrd,OAAO,IAAIiiC,cAAc,IAAIpqB,GAAG,CAAC7X,OAAO,KAAK89B,IAAI,CAAC99B,OAAO,EAAE;AACxE,MAAA,OAAOgK,QAAQ,CAACkjB,OAAO,CACrB,oBAAoB,EACmB7P,sCAAAA,GAAAA,UAAU,CAACrd,OAAO,uBAAkB89B,IAAI,CAACxP,KAAK,EACvF,CAAC,CAAA;AACH,KAAA;AAEA,IAAA,IAAI,CAACwP,IAAI,CAAC/a,OAAO,EAAE;AACjB,MAAA,OAAO/Y,QAAQ,CAACkjB,OAAO,CAAC4Q,IAAI,CAAC5Q,OAAO,CAAC,CAAA;AACvC,KAAA;AAEA,IAAA,OAAO4Q,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAhBE;EAAA9zB,QAAA,CAiBOyjB,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAC5B,IAAA,IAAAghC,aAAA,GAA2BrY,YAAY,CAACiD,IAAI,CAAC;AAAtCzB,MAAAA,IAAI,GAAA6W,aAAA,CAAA,CAAA,CAAA;AAAE3D,MAAAA,UAAU,GAAA2D,aAAA,CAAA,CAAA,CAAA,CAAA;IACvB,OAAO5D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAdE;EAAA1jB,QAAA,CAeO+4B,WAAW,GAAlB,SAAAA,YAAmBrV,IAAI,EAAE5rB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAChC,IAAA,IAAAkhC,iBAAA,GAA2BtY,gBAAgB,CAACgD,IAAI,CAAC;AAA1CzB,MAAAA,IAAI,GAAA+W,iBAAA,CAAA,CAAA,CAAA;AAAE7D,MAAAA,UAAU,GAAA6D,iBAAA,CAAA,CAAA,CAAA,CAAA;IACvB,OAAO9D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAfE;EAAA1jB,QAAA,CAgBOi5B,QAAQ,GAAf,SAAAA,SAAgBvV,IAAI,EAAE5rB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAC7B,IAAA,IAAAohC,cAAA,GAA2BvY,aAAa,CAAC+C,IAAI,CAAC;AAAvCzB,MAAAA,IAAI,GAAAiX,cAAA,CAAA,CAAA,CAAA;AAAE/D,MAAAA,UAAU,GAAA+D,cAAA,CAAA,CAAA,CAAA,CAAA;IACvB,OAAOhE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,MAAM,EAAEA,IAAI,CAAC,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAbE;EAAAkI,QAAA,CAcOm5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACpC,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAACkc,GAAG,CAAC,EAAE;AACzC,MAAA,MAAM,IAAIniB,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;IAEA,IAAAwI,KAAA,GAAkD7F,IAAI;MAAAshC,YAAA,GAAAz7B,KAAA,CAA9C/E,MAAM;AAANA,MAAAA,MAAM,GAAAwgC,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;MAAAC,qBAAA,GAAA17B,KAAA,CAAE4B,eAAe;AAAfA,MAAAA,eAAe,GAAA85B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;AAC3CC,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;AAC5BzK,QAAAA,MAAM,EAANA,MAAM;AACN2G,QAAAA,eAAe,EAAfA,eAAe;AACfgE,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC;MAAAg2B,gBAAA,GAC4CjG,eAAe,CAACgG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC;AAApF2K,MAAAA,IAAI,GAAAsX,gBAAA,CAAA,CAAA,CAAA;AAAEpE,MAAAA,UAAU,GAAAoE,gBAAA,CAAA,CAAA,CAAA;AAAErH,MAAAA,cAAc,GAAAqH,gBAAA,CAAA,CAAA,CAAA;AAAErW,MAAAA,OAAO,GAAAqW,gBAAA,CAAA,CAAA,CAAA,CAAA;AAC5C,IAAA,IAAIrW,OAAO,EAAE;AACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAC,MAAM;AACL,MAAA,OAAOgS,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAA,SAAA,GAAYwf,GAAG,EAAIoM,IAAI,EAAEwO,cAAc,CAAC,CAAA;AAC3F,KAAA;AACF,GAAA;;AAEA;AACF;AACA,MAFE;EAAAlyB,QAAA,CAGOw5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkB9V,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACpC,OAAOkI,QAAQ,CAACm5B,UAAU,CAACzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MApBE;EAAAkI,QAAA,CAqBOy5B,OAAO,GAAd,SAAAA,QAAe/V,IAAI,EAAE5rB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAC5B,IAAA,IAAA4hC,SAAA,GAA2BxY,QAAQ,CAACwC,IAAI,CAAC;AAAlCzB,MAAAA,IAAI,GAAAyX,SAAA,CAAA,CAAA,CAAA;AAAEvE,MAAAA,UAAU,GAAAuE,SAAA,CAAA,CAAA,CAAA,CAAA;IACvB,OAAOxE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,KAAK,EAAE4rB,IAAI,CAAC,CAAA;AACjE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAA1jB,QAAA,CAMOkjB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;AAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;AAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;AAAA,KAAA;IACvC,IAAI,CAAC9W,MAAM,EAAE;AACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;IAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAI3W,oBAAoB,CAAC6uB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAIljB,QAAQ,CAAC;AAAEkjB,QAAAA,OAAO,EAAPA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAljB,EAAAA,QAAA,CAKO25B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBvqB,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACkoB,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;EAAAt3B,QAAA,CAMO45B,kBAAkB,GAAzB,SAAAA,mBAA0B/hB,UAAU,EAAEgiB,UAAU,EAAO;AAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;MAAVA,UAAU,GAAG,EAAE,CAAA;AAAA,KAAA;AACnD,IAAA,IAAMC,SAAS,GAAGlH,kBAAkB,CAAC/a,UAAU,EAAErZ,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;IAC/E,OAAO,CAACC,SAAS,GAAG,IAAI,GAAGA,SAAS,CAAC13B,GAAG,CAAC,UAAC+I,CAAC,EAAA;AAAA,MAAA,OAAMA,CAAC,GAAGA,CAAC,CAAC4K,GAAG,GAAG,IAAI,CAAA;AAAA,KAAC,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;AAC9E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;EAAArC,QAAA,CAOO+5B,YAAY,GAAnB,SAAAA,aAAoBziB,GAAG,EAAEuiB,UAAU,EAAO;AAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;MAAVA,UAAU,GAAG,EAAE,CAAA;AAAA,KAAA;AACtC,IAAA,IAAMG,QAAQ,GAAGnH,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9Y,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;AAC7F,IAAA,OAAOG,QAAQ,CAAC53B,GAAG,CAAC,UAAC+I,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC4K,GAAG,CAAA;AAAA,KAAA,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;GAC3C,CAAA;AAAArC,EAAAA,QAAA,CAEMtE,UAAU,GAAjB,SAAAA,aAAoB;AAClB86B,IAAAA,YAAY,GAAG98B,SAAS,CAAA;IACxBg9B,oBAAoB,CAAC/6B,KAAK,EAAE,CAAA;AAC9B,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA,EAAA,IAAAjE,MAAA,GAAAsI,QAAA,CAAArI,SAAA,CAAA;AAAAD,EAAAA,MAAA,CAOAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;IACR,OAAO,IAAI,CAACA,IAAI,CAAC,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAmUA;AACF;AACA;AACA;AACA;AACA;AACA;AANEwC,EAAAA,MAAA,CAOAuiC,kBAAkB,GAAlB,SAAAA,qBAAqB;IACnB,IAAI,CAAC,IAAI,CAAClhB,OAAO,IAAI,IAAI,CAACF,aAAa,EAAE;MACvC,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,KAAA;IACA,IAAMqhB,KAAK,GAAG,QAAQ,CAAA;IACtB,IAAMC,QAAQ,GAAG,KAAK,CAAA;AACtB,IAAA,IAAMlG,OAAO,GAAGx3B,YAAY,CAAC,IAAI,CAACib,CAAC,CAAC,CAAA;IACpC,IAAM0iB,QAAQ,GAAG,IAAI,CAAC3+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;IAClD,IAAMG,MAAM,GAAG,IAAI,CAAC5+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;AAEhD,IAAA,IAAMI,EAAE,GAAG,IAAI,CAAC7+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGmG,QAAQ,GAAGD,QAAQ,CAAC,CAAA;AAC1D,IAAA,IAAM/F,EAAE,GAAG,IAAI,CAAC34B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGoG,MAAM,GAAGF,QAAQ,CAAC,CAAA;IACxD,IAAIG,EAAE,KAAKlG,EAAE,EAAE;MACb,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,KAAA;AACA,IAAA,IAAMmG,GAAG,GAAGtG,OAAO,GAAGqG,EAAE,GAAGH,QAAQ,CAAA;AACnC,IAAA,IAAMK,GAAG,GAAGvG,OAAO,GAAGG,EAAE,GAAG+F,QAAQ,CAAA;AACnC,IAAA,IAAMM,EAAE,GAAGnG,OAAO,CAACiG,GAAG,EAAED,EAAE,CAAC,CAAA;AAC3B,IAAA,IAAMI,EAAE,GAAGpG,OAAO,CAACkG,GAAG,EAAEpG,EAAE,CAAC,CAAA;AAC3B,IAAA,IACEqG,EAAE,CAACrkC,IAAI,KAAKskC,EAAE,CAACtkC,IAAI,IACnBqkC,EAAE,CAACpkC,MAAM,KAAKqkC,EAAE,CAACrkC,MAAM,IACvBokC,EAAE,CAAClkC,MAAM,KAAKmkC,EAAE,CAACnkC,MAAM,IACvBkkC,EAAE,CAAC/9B,WAAW,KAAKg+B,EAAE,CAACh+B,WAAW,EACjC;AACA,MAAA,OAAO,CAACyI,KAAK,CAAC,IAAI,EAAE;AAAEtN,QAAAA,EAAE,EAAE0iC,GAAAA;AAAI,OAAC,CAAC,EAAEp1B,KAAK,CAAC,IAAI,EAAE;AAAEtN,QAAAA,EAAE,EAAE2iC,GAAAA;AAAI,OAAC,CAAC,CAAC,CAAA;AAC7D,KAAA;IACA,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAyDA;AACF;AACA;AACA;AACA;AACA;AALE9iC,EAAAA,MAAA,CAMAijC,qBAAqB,GAArB,SAAAA,qBAAAA,CAAsB7iC,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IAC7B,IAAA8iC,qBAAA,GAA8CxjB,SAAS,CAAC5b,MAAM,CAC5D,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EACpBA,IACF,CAAC,CAACqB,eAAe,CAAC,IAAI,CAAC;MAHfP,MAAM,GAAAgiC,qBAAA,CAANhiC,MAAM;MAAE2G,eAAe,GAAAq7B,qBAAA,CAAfr7B,eAAe;MAAEC,QAAQ,GAAAo7B,qBAAA,CAARp7B,QAAQ,CAAA;IAIzC,OAAO;AAAE5G,MAAAA,MAAM,EAANA,MAAM;AAAE2G,MAAAA,eAAe,EAAfA,eAAe;AAAEG,MAAAA,cAAc,EAAEF,QAAAA;KAAU,CAAA;AAC9D,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAA9H,MAAA,CAQAy2B,KAAK,GAAL,SAAAA,MAAMl2B,MAAM,EAAMH,IAAI,EAAO;AAAA,IAAA,IAAvBG,MAAM,KAAA,KAAA,CAAA,EAAA;AAANA,MAAAA,MAAM,GAAG,CAAC,CAAA;AAAA,KAAA;AAAA,IAAA,IAAEH,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACzB,IAAA,OAAO,IAAI,CAACkK,OAAO,CAACuF,eAAe,CAACC,QAAQ,CAACvP,MAAM,CAAC,EAAEH,IAAI,CAAC,CAAA;AAC7D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAAJ,EAAAA,MAAA,CAMAmjC,OAAO,GAAP,SAAAA,UAAU;AACR,IAAA,OAAO,IAAI,CAAC74B,OAAO,CAACyB,QAAQ,CAACwE,WAAW,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MARE;EAAAvQ,MAAA,CASAsK,OAAO,GAAP,SAAAA,QAAQvG,IAAI,EAAA2I,KAAA,EAA4D;AAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;MAAA02B,mBAAA,GAAA3+B,KAAA,CAAtDiyB,aAAa;AAAbA,MAAAA,aAAa,GAAA0M,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;MAAAC,qBAAA,GAAA5+B,KAAA,CAAE6+B,gBAAgB;AAAhBA,MAAAA,gBAAgB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA,CAAA;IAC7Dt/B,IAAI,GAAGsM,aAAa,CAACtM,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;IAChD,IAAIxM,IAAI,CAACvD,MAAM,CAAC,IAAI,CAACuD,IAAI,CAAC,EAAE;AAC1B,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM,IAAI,CAACA,IAAI,CAACsd,OAAO,EAAE;MACxB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;AAChD,KAAC,MAAM;AACL,MAAA,IAAIw/B,KAAK,GAAG,IAAI,CAACpjC,EAAE,CAAA;MACnB,IAAIu2B,aAAa,IAAI4M,gBAAgB,EAAE;QACrC,IAAMvE,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;AACxC,QAAA,IAAMqjC,KAAK,GAAG,IAAI,CAAC7W,QAAQ,EAAE,CAAA;QAAC,IAAA8W,SAAA,GACpBtG,OAAO,CAACqG,KAAK,EAAEzE,WAAW,EAAEh7B,IAAI,CAAC,CAAA;AAA1Cw/B,QAAAA,KAAK,GAAAE,SAAA,CAAA,CAAA,CAAA,CAAA;AACR,OAAA;MACA,OAAOh2B,KAAK,CAAC,IAAI,EAAE;AAAEtN,QAAAA,EAAE,EAAEojC,KAAK;AAAEx/B,QAAAA,IAAI,EAAJA,IAAAA;AAAK,OAAC,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA/D,EAAAA,MAAA,CAMAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAA6E,MAAA,EAA8D;AAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAA9C7xB,MAAM,GAAA8xB,KAAA,CAAN9xB,MAAM;MAAE2G,eAAe,GAAAmrB,KAAA,CAAfnrB,eAAe;MAAEG,cAAc,GAAAgrB,KAAA,CAAdhrB,cAAc,CAAA;AACnD,IAAA,IAAMW,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;AAAEvM,MAAAA,MAAM,EAANA,MAAM;AAAE2G,MAAAA,eAAe,EAAfA,eAAe;AAAEG,MAAAA,cAAc,EAAdA,cAAAA;AAAe,KAAC,CAAC,CAAA;IACvE,OAAOyF,KAAK,CAAC,IAAI,EAAE;AAAE9E,MAAAA,GAAG,EAAHA,GAAAA;AAAI,KAAC,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA3I,EAAAA,MAAA,CAMA0jC,SAAS,GAAT,SAAAA,SAAAA,CAAUxiC,MAAM,EAAE;IAChB,OAAO,IAAI,CAACgtB,WAAW,CAAC;AAAEhtB,MAAAA,MAAM,EAANA,MAAAA;AAAO,KAAC,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAZE;AAAAlB,EAAAA,MAAA,CAaAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAM1F,UAAU,GAAGF,eAAe,CAACmH,MAAM,EAAEgc,2BAA2B,CAAC,CAAA;IACvE,IAAA+E,qBAAA,GAA4CztB,mBAAmB,CAACyF,UAAU,EAAE,IAAI,CAAChT,GAAG,CAAC;MAA7EuM,kBAAkB,GAAAyuB,qBAAA,CAAlBzuB,kBAAkB;MAAEH,WAAW,GAAA4uB,qBAAA,CAAX5uB,WAAW,CAAA;IAEvC,IAAM6uB,gBAAgB,GAClB,CAAClgC,WAAW,CAACiY,UAAU,CAACvG,QAAQ,CAAC,IACjC,CAAC1R,WAAW,CAACiY,UAAU,CAACxG,UAAU,CAAC,IACnC,CAACzR,WAAW,CAACiY,UAAU,CAACrd,OAAO,CAAC;AAClC8hC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;AAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;AAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;MACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;AACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;AAEhE,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;AAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;AACH,KAAA;IAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;AACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;AACnF,KAAA;AAEA,IAAA,IAAI6wB,KAAK,CAAA;AACT,IAAA,IAAI2V,gBAAgB,EAAE;MACpB3V,KAAK,GAAG1Y,eAAe,CAAAtO,QAAA,KAChB+N,eAAe,CAAC,IAAI,CAACgL,CAAC,EAAE9K,kBAAkB,EAAEH,WAAW,CAAC,EAAK4G,UAAU,CAC5EzG,EAAAA,kBAAkB,EAClBH,WACF,CAAC,CAAA;KACF,MAAM,IAAI,CAACrR,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC,EAAE;AAC3CwZ,MAAAA,KAAK,GAAGlY,kBAAkB,CAAA9O,QAAA,KAAM4O,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,EAAKrE,UAAU,CAAE,CAAC,CAAA;AAC9E,KAAC,MAAM;MACLsS,KAAK,GAAAhnB,QAAA,CAAA,EAAA,EAAQ,IAAI,CAAC0lB,QAAQ,EAAE,EAAKhR,UAAU,CAAE,CAAA;;AAE7C;AACA;AACA,MAAA,IAAIjY,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC,EAAE;QAC/B8vB,KAAK,CAAC9vB,GAAG,GAAGwG,IAAI,CAAC+N,GAAG,CAAC0E,WAAW,CAAC6W,KAAK,CAAChwB,IAAI,EAAEgwB,KAAK,CAAC/vB,KAAK,CAAC,EAAE+vB,KAAK,CAAC9vB,GAAG,CAAC,CAAA;AACvE,OAAA;AACF,KAAA;AAEA,IAAA,IAAA0lC,SAAA,GAAgB1G,OAAO,CAAClP,KAAK,EAAE,IAAI,CAACvW,CAAC,EAAE,IAAI,CAAC3T,IAAI,CAAC;AAA1C5D,MAAAA,EAAE,GAAA0jC,SAAA,CAAA,CAAA,CAAA;AAAEnsB,MAAAA,CAAC,GAAAmsB,SAAA,CAAA,CAAA,CAAA,CAAA;IACZ,OAAOp2B,KAAK,CAAC,IAAI,EAAE;AAAEtN,MAAAA,EAAE,EAAFA,EAAE;AAAEuX,MAAAA,CAAC,EAADA,CAAAA;AAAE,KAAC,CAAC,CAAA;AAC/B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAZE;AAAA1X,EAAAA,MAAA,CAaAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;IAC/C,OAAO/f,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA3hB,EAAAA,MAAA,CAMA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAACI,MAAM,EAAE,CAAA;IACxD,OAAOngB,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAA3hB,MAAA,CAYAwwB,OAAO,GAAP,SAAAA,QAAQhzB,IAAI,EAAAy2B,MAAA,EAAmC;AAAA,IAAA,IAAAI,KAAA,GAAAJ,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAA6P,oBAAA,GAAAzP,KAAA,CAA7B5D,cAAc;AAAdA,MAAAA,cAAc,GAAAqT,oBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,oBAAA,CAAA;AACpC,IAAA,IAAI,CAAC,IAAI,CAACziB,OAAO,EAAE,OAAO,IAAI,CAAA;IAE9B,IAAM3J,CAAC,GAAG,EAAE;AACVqsB,MAAAA,cAAc,GAAG1Z,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAA;AAC/C,IAAA,QAAQumC,cAAc;AACpB,MAAA,KAAK,OAAO;QACVrsB,CAAC,CAACxZ,KAAK,GAAG,CAAC,CAAA;AACb;AACA,MAAA,KAAK,UAAU,CAAA;AACf,MAAA,KAAK,QAAQ;QACXwZ,CAAC,CAACvZ,GAAG,GAAG,CAAC,CAAA;AACX;AACA,MAAA,KAAK,OAAO,CAAA;AACZ,MAAA,KAAK,MAAM;QACTuZ,CAAC,CAAChZ,IAAI,GAAG,CAAC,CAAA;AACZ;AACA,MAAA,KAAK,OAAO;QACVgZ,CAAC,CAAC/Y,MAAM,GAAG,CAAC,CAAA;AACd;AACA,MAAA,KAAK,SAAS;QACZ+Y,CAAC,CAAC7Y,MAAM,GAAG,CAAC,CAAA;AACd;AACA,MAAA,KAAK,SAAS;QACZ6Y,CAAC,CAAC1S,WAAW,GAAG,CAAC,CAAA;AACjB,QAAA,MAAA;AAGF;AACF,KAAA;;IAEA,IAAI++B,cAAc,KAAK,OAAO,EAAE;AAC9B,MAAA,IAAItT,cAAc,EAAE;QAClB,IAAM1b,WAAW,GAAG,IAAI,CAACpM,GAAG,CAAC6G,cAAc,EAAE,CAAA;AAC7C,QAAA,IAAQlR,OAAO,GAAK,IAAI,CAAhBA,OAAO,CAAA;QACf,IAAIA,OAAO,GAAGyW,WAAW,EAAE;AACzB2C,UAAAA,CAAC,CAACvC,UAAU,GAAG,IAAI,CAACA,UAAU,GAAG,CAAC,CAAA;AACpC,SAAA;QACAuC,CAAC,CAACpZ,OAAO,GAAGyW,WAAW,CAAA;AACzB,OAAC,MAAM;QACL2C,CAAC,CAACpZ,OAAO,GAAG,CAAC,CAAA;AACf,OAAA;AACF,KAAA;IAEA,IAAIylC,cAAc,KAAK,UAAU,EAAE;MACjC,IAAMrJ,CAAC,GAAG/1B,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAChc,KAAK,GAAG,CAAC,CAAC,CAAA;MACnCwZ,CAAC,CAACxZ,KAAK,GAAG,CAACw8B,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC3B,KAAA;AAEA,IAAA,OAAO,IAAI,CAACv4B,GAAG,CAACuV,CAAC,CAAC,CAAA;AACpB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAA1X,MAAA,CAYAgkC,KAAK,GAAL,SAAAA,MAAMxmC,IAAI,EAAE4C,IAAI,EAAE;AAAA,IAAA,IAAA6jC,UAAA,CAAA;AAChB,IAAA,OAAO,IAAI,CAAC5iB,OAAO,GACf,IAAI,CAAC9W,IAAI,EAAA05B,UAAA,GAAAA,EAAAA,EAAAA,UAAA,CAAIzmC,IAAI,IAAG,CAAC,EAAAymC,UAAA,EAAG,CACrBzT,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CACnButB,KAAK,CAAC,CAAC,CAAC,GACX,IAAI,CAAA;AACV,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAA3tB,MAAA,CAYAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAACiF,aAAa,CAACxN,IAAI,CAAC,CAAC,CAAC4gB,wBAAwB,CAAC,IAAI,EAAEpB,GAAG,CAAC,GAClF6J,OAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAlBE;EAAAzpB,MAAA,CAmBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;AAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;MAAVA,UAAU,GAAG3B,UAAkB,CAAA;AAAA,KAAA;AAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACG,cAAc,CAAC,IAAI,CAAC,GACvEmJ,OAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAZE;AAAAzpB,EAAAA,MAAA,CAaAkkC,aAAa,GAAb,SAAAA,aAAAA,CAAc9jC,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACmgB,mBAAmB,CAAC,IAAI,CAAC,GACtE,EAAE,CAAA;AACR,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAhBE;AAAAvgB,EAAAA,MAAA,CAiBA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAAwH,MAAA,EAOQ;AAAA,IAAA,IAAAQ,KAAA,GAAAR,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAA+P,YAAA,GAAAvP,KAAA,CANJt0B,MAAM;AAANA,MAAAA,MAAM,GAAA6jC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;MAAAC,qBAAA,GAAAxP,KAAA,CACnB3H,eAAe;AAAfA,MAAAA,eAAe,GAAAmX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;MAAAC,qBAAA,GAAAzP,KAAA,CACvB5H,oBAAoB;AAApBA,MAAAA,oBAAoB,GAAAqX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;MAAAC,mBAAA,GAAA1P,KAAA,CAC5BzH,aAAa;AAAbA,MAAAA,aAAa,GAAAmX,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;MAAAC,kBAAA,GAAA3P,KAAA,CACpBmJ,YAAY;AAAZA,MAAAA,YAAY,GAAAwG,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;MAAAC,eAAA,GAAA5P,KAAA,CACpBiJ,SAAS;AAATA,MAAAA,SAAS,GAAA2G,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;AAE1B,IAAA,IAAI,CAAC,IAAI,CAACnjB,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;AACpC,IAAA,IAAM4G,GAAG,GAAGnkC,MAAM,KAAK,UAAU,CAAA;IAEjC,IAAI0f,CAAC,GAAG6S,UAAS,CAAC,IAAI,EAAE4R,GAAG,EAAE5G,SAAS,CAAC,CAAA;IACvC,IAAI9T,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,EAAE7d,CAAC,IAAI,GAAG,CAAA;AAClDA,IAAAA,CAAC,IAAI6M,UAAS,CACZ,IAAI,EACJ4X,GAAG,EACHxX,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;AACD,IAAA,OAAO7d,CAAC,CAAA;AACV,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MATE;AAAAhgB,EAAAA,MAAA,CAUA6yB,SAAS,GAAT,SAAAA,SAAAA,CAAA8B,MAAA,EAA2D;AAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAA+P,YAAA,GAAAxP,KAAA,CAA7C50B,MAAM;AAANA,MAAAA,MAAM,GAAAokC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;MAAAC,eAAA,GAAAzP,KAAA,CAAE2I,SAAS;AAATA,MAAAA,SAAS,GAAA8G,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;AAChD,IAAA,IAAI,CAAC,IAAI,CAACtjB,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAEvyB,MAAM,KAAK,UAAU,EAAEqrB,aAAa,CAACkS,SAAS,CAAC,CAAC,CAAA;AACzE,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA79B,EAAAA,MAAA,CAKA4kC,aAAa,GAAb,SAAAA,gBAAgB;AACd,IAAA,OAAOjH,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAhBE;AAAA39B,EAAAA,MAAA,CAiBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAAoI,MAAA,EAQQ;AAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAA4P,qBAAA,GAAArP,KAAA,CAPJxI,oBAAoB;AAApBA,MAAAA,oBAAoB,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;MAAAC,qBAAA,GAAAtP,KAAA,CAC5BvI,eAAe;AAAfA,MAAAA,eAAe,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;MAAAC,mBAAA,GAAAvP,KAAA,CACvBrI,aAAa;AAAbA,MAAAA,aAAa,GAAA4X,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;MAAAC,mBAAA,GAAAxP,KAAA,CACpBtI,aAAa;AAAbA,MAAAA,aAAa,GAAA8X,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;MAAAC,kBAAA,GAAAzP,KAAA,CACrBuI,YAAY;AAAZA,MAAAA,YAAY,GAAAkH,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;MAAAC,YAAA,GAAA1P,KAAA,CACpBl1B,MAAM;AAANA,MAAAA,MAAM,GAAA4kC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;MAAAC,eAAA,GAAA3P,KAAA,CACnBqI,SAAS;AAATA,MAAAA,SAAS,GAAAsH,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;AAE1B,IAAA,IAAI,CAAC,IAAI,CAAC9jB,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;AACpC,IAAA,IAAI7d,CAAC,GAAGkN,aAAa,IAAInD,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAA;AACxE,IAAA,OACE7d,CAAC,GACD6M,UAAS,CACP,IAAI,EACJvsB,MAAM,KAAK,UAAU,EACrB2sB,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;AAEL,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA,MALE;AAAA79B,EAAAA,MAAA,CAMAolC,SAAS,GAAT,SAAAA,YAAY;AACV,IAAA,OAAOzH,YAAY,CAAC,IAAI,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAA;AACnE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;AAAA39B,EAAAA,MAAA,CAQAqlC,MAAM,GAAN,SAAAA,SAAS;IACP,OAAO1H,YAAY,CAAC,IAAI,CAAClH,KAAK,EAAE,EAAE,iCAAiC,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAz2B,EAAAA,MAAA,CAKAslC,SAAS,GAAT,SAAAA,YAAY;AACV,IAAA,IAAI,CAAC,IAAI,CAACjkB,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;AAAA7yB,EAAAA,MAAA,CAYAulC,SAAS,GAAT,SAAAA,SAAAA,CAAAhQ,MAAA,EAAyF;AAAA,IAAA,IAAAM,KAAA,GAAAN,MAAA,cAAJ,EAAE,GAAAA,MAAA;MAAAiQ,mBAAA,GAAA3P,KAAA,CAA3E1I,aAAa;AAAbA,MAAAA,aAAa,GAAAqY,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;MAAAC,iBAAA,GAAA5P,KAAA,CAAE6P,WAAW;AAAXA,MAAAA,WAAW,GAAAD,iBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,iBAAA;MAAAE,qBAAA,GAAA9P,KAAA,CAAE+P,kBAAkB;AAAlBA,MAAAA,kBAAkB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA,CAAA;IAC9E,IAAI/lB,GAAG,GAAG,cAAc,CAAA;IAExB,IAAI8lB,WAAW,IAAIvY,aAAa,EAAE;AAChC,MAAA,IAAIyY,kBAAkB,EAAE;AACtBhmB,QAAAA,GAAG,IAAI,GAAG,CAAA;AACZ,OAAA;AACA,MAAA,IAAI8lB,WAAW,EAAE;AACf9lB,QAAAA,GAAG,IAAI,GAAG,CAAA;OACX,MAAM,IAAIuN,aAAa,EAAE;AACxBvN,QAAAA,GAAG,IAAI,IAAI,CAAA;AACb,OAAA;AACF,KAAA;AAEA,IAAA,OAAO+d,YAAY,CAAC,IAAI,EAAE/d,GAAG,EAAE,IAAI,CAAC,CAAA;AACtC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;AAAA5f,EAAAA,MAAA,CAYA6lC,KAAK,GAAL,SAAAA,KAAAA,CAAMzlC,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACb,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;IAEA,OAAU,IAAI,CAACikB,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACC,SAAS,CAACnlC,IAAI,CAAC,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAJ,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;IACT,OAAO,IAAI,CAACyR,OAAO,GAAG,IAAI,CAACuL,KAAK,EAAE,GAAGnD,OAAO,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;EAAAzpB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;IAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;AAChB,MAAA,OAAA,iBAAA,GAAyB,IAAI,CAACuL,KAAK,EAAE,GAAW,UAAA,GAAA,IAAI,CAAC7oB,IAAI,CAAClD,IAAI,GAAa,YAAA,GAAA,IAAI,CAACK,MAAM,GAAA,IAAA,CAAA;AACxF,KAAC,MAAM;MACL,OAAsC,8BAAA,GAAA,IAAI,CAACosB,aAAa,GAAA,IAAA,CAAA;AAC1D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAttB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;AACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA/sB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;IACT,OAAO,IAAI,CAAC1L,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAvE,EAAAA,MAAA,CAIA8lC,SAAS,GAAT,SAAAA,YAAY;IACV,OAAO,IAAI,CAACzkB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAG,IAAI,GAAGoE,GAAG,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAvE,EAAAA,MAAA,CAIA+lC,aAAa,GAAb,SAAAA,gBAAgB;AACd,IAAA,OAAO,IAAI,CAAC1kB,OAAO,GAAG1c,IAAI,CAAC2E,KAAK,CAAC,IAAI,CAACnJ,EAAE,GAAG,IAAI,CAAC,GAAGoE,GAAG,CAAA;AACxD,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAvE,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAA5sB,EAAAA,MAAA,CAIAgmC,MAAM,GAAN,SAAAA,SAAS;AACP,IAAA,OAAO,IAAI,CAACp7B,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAA5K,EAAAA,MAAA,CAOA2sB,QAAQ,GAAR,SAAAA,QAAAA,CAASvsB,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AAChB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,EAAE,CAAA;AAE5B,IAAA,IAAMnb,IAAI,GAAAe,QAAA,KAAQ,IAAI,CAAC+Y,CAAC,CAAE,CAAA;IAE1B,IAAI5f,IAAI,CAAC6lC,aAAa,EAAE;AACtB//B,MAAAA,IAAI,CAAC8B,cAAc,GAAG,IAAI,CAACA,cAAc,CAAA;AACzC9B,MAAAA,IAAI,CAAC2B,eAAe,GAAG,IAAI,CAACc,GAAG,CAACd,eAAe,CAAA;AAC/C3B,MAAAA,IAAI,CAAChF,MAAM,GAAG,IAAI,CAACyH,GAAG,CAACzH,MAAM,CAAA;AAC/B,KAAA;AACA,IAAA,OAAOgF,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA,MAHE;AAAAlG,EAAAA,MAAA,CAIA4K,QAAQ,GAAR,SAAAA,WAAW;AACT,IAAA,OAAO,IAAIxJ,IAAI,CAAC,IAAI,CAACigB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAC,CAAA;AAC/C,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAdE;EAAAvE,MAAA,CAeA0wB,IAAI,GAAJ,SAAAA,IAAAA,CAAKwV,aAAa,EAAE1oC,IAAI,EAAmB4C,IAAI,EAAO;AAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;AAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;AAAA,KAAA;AAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IAClD,IAAI,CAAC,IAAI,CAACihB,OAAO,IAAI,CAAC6kB,aAAa,CAAC7kB,OAAO,EAAE;AAC3C,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,wCAAwC,CAAC,CAAA;AACnE,KAAA;IAEA,IAAM2a,OAAO,GAAAl/B,QAAA,CAAA;MAAK/F,MAAM,EAAE,IAAI,CAACA,MAAM;MAAE2G,eAAe,EAAE,IAAI,CAACA,eAAAA;AAAe,KAAA,EAAKzH,IAAI,CAAE,CAAA;AAEvF,IAAA,IAAM2c,KAAK,GAAGnF,UAAU,CAACpa,IAAI,CAAC,CAACkN,GAAG,CAAC2f,QAAQ,CAACsB,aAAa,CAAC;MACxDya,YAAY,GAAGF,aAAa,CAAC3Y,OAAO,EAAE,GAAG,IAAI,CAACA,OAAO,EAAE;AACvD+I,MAAAA,OAAO,GAAG8P,YAAY,GAAG,IAAI,GAAGF,aAAa;AAC7C3P,MAAAA,KAAK,GAAG6P,YAAY,GAAGF,aAAa,GAAG,IAAI;MAC3CG,MAAM,GAAG3V,KAAI,CAAC4F,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAEopB,OAAO,CAAC,CAAA;IAE/C,OAAOC,YAAY,GAAGC,MAAM,CAACzY,MAAM,EAAE,GAAGyY,MAAM,CAAA;AAChD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA,MAPE;EAAArmC,MAAA,CAQAsmC,OAAO,GAAP,SAAAA,QAAQ9oC,IAAI,EAAmB4C,IAAI,EAAO;AAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;AAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;AAAA,KAAA;AAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;AACtC,IAAA,OAAO,IAAI,CAACswB,IAAI,CAACpoB,QAAQ,CAAC8K,GAAG,EAAE,EAAE5V,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAAJ,EAAAA,MAAA,CAKAumC,KAAK,GAAL,SAAAA,KAAAA,CAAML,aAAa,EAAE;AACnB,IAAA,OAAO,IAAI,CAAC7kB,OAAO,GAAGqO,QAAQ,CAACE,aAAa,CAAC,IAAI,EAAEsW,aAAa,CAAC,GAAG,IAAI,CAAA;AAC1E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAVE;EAAAlmC,MAAA,CAWA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQuV,aAAa,EAAE1oC,IAAI,EAAE4C,IAAI,EAAE;AACjC,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,KAAK,CAAA;AAE/B,IAAA,IAAMmlB,OAAO,GAAGN,aAAa,CAAC3Y,OAAO,EAAE,CAAA;IACvC,IAAMkZ,cAAc,GAAG,IAAI,CAACn8B,OAAO,CAAC47B,aAAa,CAACniC,IAAI,EAAE;AAAE2yB,MAAAA,aAAa,EAAE,IAAA;AAAK,KAAC,CAAC,CAAA;IAChF,OACE+P,cAAc,CAACjW,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,IAAIomC,OAAO,IAAIA,OAAO,IAAIC,cAAc,CAACzC,KAAK,CAACxmC,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAEhG,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;AAAAJ,EAAAA,MAAA,CAOAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;AACZ,IAAA,OACE,IAAI,CAAC0R,OAAO,IACZ1R,KAAK,CAAC0R,OAAO,IACb,IAAI,CAACkM,OAAO,EAAE,KAAK5d,KAAK,CAAC4d,OAAO,EAAE,IAClC,IAAI,CAACxpB,IAAI,CAACvD,MAAM,CAACmP,KAAK,CAAC5L,IAAI,CAAC,IAC5B,IAAI,CAAC4E,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,CAAA;AAE9B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAlBE;AAAA3I,EAAAA,MAAA,CAmBA0mC,UAAU,GAAV,SAAAA,UAAAA,CAAWj/B,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;AACrB,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,IAAMnb,IAAI,GAAGuB,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;QAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;AAAK,OAAC,CAAC;AACvE4iC,MAAAA,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,IAAI,GAAGzgC,IAAI,GAAG,CAACuB,OAAO,CAACk/B,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,CAAC,CAAA;AACpF,IAAA,IAAI5pB,KAAK,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;AACtE,IAAA,IAAIvf,IAAI,GAAGiK,OAAO,CAACjK,IAAI,CAAA;IACvB,IAAIsa,KAAK,CAACC,OAAO,CAACtQ,OAAO,CAACjK,IAAI,CAAC,EAAE;MAC/Buf,KAAK,GAAGtV,OAAO,CAACjK,IAAI,CAAA;AACpBA,MAAAA,IAAI,GAAGwE,SAAS,CAAA;AAClB,KAAA;AACA,IAAA,OAAOo9B,YAAY,CAACl5B,IAAI,EAAE,IAAI,CAACqE,IAAI,CAACo8B,OAAO,CAAC,EAAA1/B,QAAA,KACvCQ,OAAO,EAAA;AACV8D,MAAAA,OAAO,EAAE,QAAQ;AACjBwR,MAAAA,KAAK,EAALA,KAAK;AACLvf,MAAAA,IAAI,EAAJA,IAAAA;AAAI,KAAA,CACL,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAZE;AAAAwC,EAAAA,MAAA,CAaA4mC,kBAAkB,GAAlB,SAAAA,kBAAAA,CAAmBn/B,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;AAC7B,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,OAAO+d,YAAY,CAAC33B,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;MAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;AAAK,KAAC,CAAC,EAAE,IAAI,EAAAkD,QAAA,KACjFQ,OAAO,EAAA;AACV8D,MAAAA,OAAO,EAAE,MAAM;AACfwR,MAAAA,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC;AAClCsiB,MAAAA,SAAS,EAAE,IAAA;AAAI,KAAA,CAChB,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAA/2B,EAAAA,QAAA,CAKOoK,GAAG,GAAV,SAAAA,MAAyB;AAAA,IAAA,KAAA,IAAAqQ,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;AAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;AAAA,KAAA;IACrB,IAAI,CAACgO,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;AACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;AAC3E,KAAA;AACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;AAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;KAAE5oB,EAAAA,IAAI,CAAC+N,GAAG,CAAC,CAAA;AACxD,GAAA;;AAEA;AACF;AACA;AACA;AACA,MAJE;AAAApK,EAAAA,QAAA,CAKOqK,GAAG,GAAV,SAAAA,MAAyB;AAAA,IAAA,KAAA,IAAA0Q,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;AAAT0N,MAAAA,SAAS,CAAA1N,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;AAAA,KAAA;IACrB,IAAI,CAAC0N,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;AACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;AAC3E,KAAA;AACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;AAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;KAAE5oB,EAAAA,IAAI,CAACgO,GAAG,CAAC,CAAA;AACxD,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA,MANE;EAAArK,QAAA,CAOOw+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyB9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;IAC9C,IAAAG,QAAA,GAAkDH,OAAO;MAAAs/B,eAAA,GAAAn/B,QAAA,CAAjD1G,MAAM;AAANA,MAAAA,MAAM,GAAA6lC,eAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,eAAA;MAAAC,qBAAA,GAAAp/B,QAAA,CAAEC,eAAe;AAAfA,MAAAA,eAAe,GAAAm/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;AAC3CpF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;AAC5BzK,QAAAA,MAAM,EAANA,MAAM;AACN2G,QAAAA,eAAe,EAAfA,eAAe;AACfgE,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;AACJ,IAAA,OAAO2vB,iBAAiB,CAACoG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC,CAAA;AAClD,GAAA;;AAEA;AACF;AACA,MAFE;EAAAtX,QAAA,CAGO2+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyBjb,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;IAC9C,OAAOa,QAAQ,CAACw+B,iBAAiB,CAAC9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,CAAC,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAXE;EAAAa,QAAA,CAYO4+B,iBAAiB,GAAxB,SAAAA,kBAAyBtnB,GAAG,EAAEnY,OAAO,EAAO;AAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;MAAPA,OAAO,GAAG,EAAE,CAAA;AAAA,KAAA;IACxC,IAAA0/B,SAAA,GAAkD1/B,OAAO;MAAA2/B,gBAAA,GAAAD,SAAA,CAAjDjmC,MAAM;AAANA,MAAAA,MAAM,GAAAkmC,gBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,gBAAA;MAAAC,qBAAA,GAAAF,SAAA,CAAEt/B,eAAe;AAAfA,MAAAA,eAAe,GAAAw/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;AAC3CzF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;AAC5BzK,QAAAA,MAAM,EAANA,MAAM;AACN2G,QAAAA,eAAe,EAAfA,eAAe;AACfgE,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;AACJ,IAAA,OAAO,IAAIuvB,WAAW,CAACwG,WAAW,EAAEhiB,GAAG,CAAC,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MATE;EAAAtX,QAAA,CAUOg/B,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBtb,IAAI,EAAEub,YAAY,EAAEnnC,IAAI,EAAO;AAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;AAAA,KAAA;IACnD,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAAC6jC,YAAY,CAAC,EAAE;AAClD,MAAA,MAAM,IAAI9pC,oBAAoB,CAC5B,+DACF,CAAC,CAAA;AACH,KAAA;IACA,IAAA+pC,MAAA,GAAkDpnC,IAAI;MAAAqnC,aAAA,GAAAD,MAAA,CAA9CtmC,MAAM;AAANA,MAAAA,MAAM,GAAAumC,aAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,aAAA;MAAAC,qBAAA,GAAAF,MAAA,CAAE3/B,eAAe;AAAfA,MAAAA,eAAe,GAAA6/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;AAC3C9F,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;AAC5BzK,QAAAA,MAAM,EAANA,MAAM;AACN2G,QAAAA,eAAe,EAAfA,eAAe;AACfgE,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;IAEJ,IAAI,CAAC+1B,WAAW,CAACphC,MAAM,CAAC+mC,YAAY,CAACrmC,MAAM,CAAC,EAAE;MAC5C,MAAM,IAAIzD,oBAAoB,CAC5B,2CAA4CmkC,GAAAA,WAAW,sDACZ2F,YAAY,CAACrmC,MAAM,CAChE,CAAC,CAAA;AACH,KAAA;AAEA,IAAA,IAAAymC,qBAAA,GAAwDJ,YAAY,CAAC/L,iBAAiB,CAACxP,IAAI,CAAC;MAApFrE,MAAM,GAAAggB,qBAAA,CAANhgB,MAAM;MAAE5jB,IAAI,GAAA4jC,qBAAA,CAAJ5jC,IAAI;MAAEy2B,cAAc,GAAAmN,qBAAA,CAAdnN,cAAc;MAAElN,aAAa,GAAAqa,qBAAA,CAAbra,aAAa,CAAA;AAEnD,IAAA,IAAIA,aAAa,EAAE;AACjB,MAAA,OAAOhlB,QAAQ,CAACkjB,OAAO,CAAC8B,aAAa,CAAC,CAAA;AACxC,KAAC,MAAM;AACL,MAAA,OAAOkQ,mBAAmB,CACxB7V,MAAM,EACN5jB,IAAI,EACJ3D,IAAI,EACMmnC,SAAAA,GAAAA,YAAY,CAACjnC,MAAM,EAC7B0rB,IAAI,EACJwO,cACF,CAAC,CAAA;AACH,KAAA;AACF,GAAA;;AAEA;;AAEA;AACF;AACA;AACA,MAHE;AAAA95B,EAAAA,YAAA,CAAA4H,QAAA,EAAA,CAAA;IAAA3H,GAAA,EAAA,SAAA;IAAAC,GAAA,EA3xCA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7qB,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;AAClD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA8D,GAAA,EAAA,oBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;MACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;AACvD,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAhT,GAAA,EAAA,QAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;MACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;AAC9C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAP,GAAA,EAAA,iBAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;MACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;AACvD,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAlH,GAAA,EAAA,gBAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;MACnB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACX,cAAc,GAAG,IAAI,CAAA;AACtD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAArH,GAAA,EAAA,MAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAI,CAAC++B,KAAK,CAAA;AACnB,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAh/B,GAAA,EAAA,UAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;MACb,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAAClD,IAAI,GAAG,IAAI,CAAA;AAC7C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAF,GAAA,EAAA,MAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC/hB,IAAI,GAAGsG,GAAG,CAAA;AACzC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG1c,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAC8F,CAAC,CAAC9hB,KAAK,GAAG,CAAC,CAAC,GAAGqG,GAAG,CAAA;AACzD,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,OAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAY;MACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC9hB,KAAK,GAAGqG,GAAG,CAAA;AAC1C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,KAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;MACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC7hB,GAAG,GAAGoG,GAAG,CAAA;AACxC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,MAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;MACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACthB,IAAI,GAAG6F,GAAG,CAAA;AACzC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,QAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;MACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACrhB,MAAM,GAAG4F,GAAG,CAAA;AAC3C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,QAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;MACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACnhB,MAAM,GAAG0F,GAAG,CAAA;AAC3C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,aAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;MAChB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAChb,WAAW,GAAGT,GAAG,CAAA;AAChD,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA5D,GAAA,EAAA,UAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;MACb,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC7mB,QAAQ,GAAG7Q,GAAG,CAAA;AACnE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA5D,GAAA,EAAA,YAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;MACf,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC9mB,UAAU,GAAG5Q,GAAG,CAAA;AACrE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AANE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAc;MACZ,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC39B,OAAO,GAAGiG,GAAG,CAAA;AAClE,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA5D,GAAA,EAAA,WAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgB;AACd,MAAA,OAAO,IAAI,CAACygB,OAAO,IAAI,IAAI,CAAC1Y,GAAG,CAAC+G,cAAc,EAAE,CAACzH,QAAQ,CAAC,IAAI,CAAC3J,OAAO,CAAC,CAAA;AACzE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAqC,GAAA,EAAA,cAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;MACjB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC59B,OAAO,GAAGiG,GAAG,CAAA;AACvE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA5D,GAAA,EAAA,iBAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAsB;MACpB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC/mB,UAAU,GAAG5Q,GAAG,CAAA;AAC1E,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,eAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC9mB,QAAQ,GAAG7Q,GAAG,CAAA;AACxE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,SAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;AACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAGxL,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,CAACvL,OAAO,GAAGlQ,GAAG,CAAA;AAChE,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA5D,GAAA,EAAA,YAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;MACf,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,OAAO,EAAE;QAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;OAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AACzF,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAyC,GAAA,EAAA,WAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAgB;MACd,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,MAAM,EAAE;QAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;OAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AACxF,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAyC,GAAA,EAAA,cAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;MACjB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,OAAO,EAAE;QAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;OAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AAC7F,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAqC,GAAA,EAAA,aAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;MAChB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,MAAM,EAAE;QAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;OAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AAC5F,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAqC,GAAA,EAAA,QAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAa;MACX,OAAO,IAAI,CAACygB,OAAO,GAAG,CAAC,IAAI,CAAC3J,CAAC,GAAGnT,GAAG,CAAA;AACrC,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAA5D,GAAA,EAAA,iBAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;MACpB,IAAI,IAAI,CAACygB,OAAO,EAAE;QAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;AACnCG,UAAAA,MAAM,EAAE,OAAO;UACfY,MAAM,EAAE,IAAI,CAACA,MAAAA;AACf,SAAC,CAAC,CAAA;AACJ,OAAC,MAAM;AACL,QAAA,OAAO,IAAI,CAAA;AACb,OAAA;AACF,KAAA;;AAEA;AACF;AACA;AACA;AACA;AAJE,GAAA,EAAA;IAAAP,GAAA,EAAA,gBAAA;IAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;MACnB,IAAI,IAAI,CAACygB,OAAO,EAAE;QAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;AACnCG,UAAAA,MAAM,EAAE,MAAM;UACdY,MAAM,EAAE,IAAI,CAACA,MAAAA;AACf,SAAC,CAAC,CAAA;AACJ,OAAC,MAAM;AACL,QAAA,OAAO,IAAI,CAAA;AACb,OAAA;AACF,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAAP,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;MAClB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAACyvB,WAAW,GAAG,IAAI,CAAA;AACpD,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7yB,GAAA,EAAA,SAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;MACZ,IAAI,IAAI,CAACugB,aAAa,EAAE;AACtB,QAAA,OAAO,KAAK,CAAA;AACd,OAAC,MAAM;AACL,QAAA,OACE,IAAI,CAAC5gB,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;AAAEjE,UAAAA,KAAK,EAAE,CAAC;AAAEC,UAAAA,GAAG,EAAE,CAAA;SAAG,CAAC,CAACoC,MAAM,IACnD,IAAI,CAACA,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;AAAEjE,UAAAA,KAAK,EAAE,CAAA;SAAG,CAAC,CAACqC,MAAM,CAAA;AAE/C,OAAA;AACF,KAAA;AAAC,GAAA,EAAA;IAAAI,GAAA,EAAA,cAAA;IAAAC,GAAA,EA6CD,SAAAA,GAAAA,GAAmB;AACjB,MAAA,OAAO2T,UAAU,CAAC,IAAI,CAACtW,IAAI,CAAC,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA0C,GAAA,EAAA,aAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;MAChB,OAAOwW,WAAW,CAAC,IAAI,CAACnZ,IAAI,EAAE,IAAI,CAACC,KAAK,CAAC,CAAA;AAC3C,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAAyC,GAAA,EAAA,YAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;MACf,OAAO,IAAI,CAACygB,OAAO,GAAG1L,UAAU,CAAC,IAAI,CAAC1X,IAAI,CAAC,GAAGsG,GAAG,CAAA;AACnD,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AANE,GAAA,EAAA;IAAA5D,GAAA,EAAA,iBAAA;IAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAsB;MACpB,OAAO,IAAI,CAACygB,OAAO,GAAGhM,eAAe,CAAC,IAAI,CAACD,QAAQ,CAAC,GAAG7Q,GAAG,CAAA;AAC5D,KAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AALE,GAAA,EAAA;IAAA5D,GAAA,EAAA,sBAAA;IAAAC,GAAA,EAMA,SAAAA,GAAAA,GAA2B;MACzB,OAAO,IAAI,CAACygB,OAAO,GACfhM,eAAe,CACb,IAAI,CAACkB,aAAa,EAClB,IAAI,CAAC5N,GAAG,CAAC8G,qBAAqB,EAAE,EAChC,IAAI,CAAC9G,GAAG,CAAC6G,cAAc,EACzB,CAAC,GACDjL,GAAG,CAAA;AACT,KAAA;AAAC,GAAA,CAAA,EAAA,CAAA;IAAA5D,GAAA,EAAA,YAAA;IAAAC,GAAA,EAs4BD,SAAAA,GAAAA,GAAwB;MACtB,OAAO4d,UAAkB,CAAA;AAC3B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,UAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsB;MACpB,OAAO4d,QAAgB,CAAA;AACzB,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,uBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;MACjC,OAAO4d,qBAA6B,CAAA;AACtC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,WAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;MACrB,OAAO4d,SAAiB,CAAA;AAC1B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,WAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;MACrB,OAAO4d,SAAiB,CAAA;AAC1B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,aAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;MACvB,OAAO4d,WAAmB,CAAA;AAC5B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,mBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA+B;MAC7B,OAAO4d,iBAAyB,CAAA;AAClC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,wBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;MAClC,OAAO4d,sBAA8B,CAAA;AACvC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,uBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;MACjC,OAAO4d,qBAA6B,CAAA;AACtC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,gBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;MAC1B,OAAO4d,cAAsB,CAAA;AAC/B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,sBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAkC;MAChC,OAAO4d,oBAA4B,CAAA;AACrC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,2BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;MACrC,OAAO4d,yBAAiC,CAAA;AAC1C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,0BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsC;MACpC,OAAO4d,wBAAgC,CAAA;AACzC,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,gBAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;MAC1B,OAAO4d,cAAsB,CAAA;AAC/B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,6BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyC;MACvC,OAAO4d,2BAAmC,CAAA;AAC5C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,cAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA0B;MACxB,OAAO4d,YAAoB,CAAA;AAC7B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,2BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;MACrC,OAAO4d,yBAAiC,CAAA;AAC1C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,2BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;MACrC,OAAO4d,yBAAiC,CAAA;AAC1C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;MACzB,OAAO4d,aAAqB,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,4BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;MACtC,OAAO4d,0BAAkC,CAAA;AAC3C,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,eAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;MACzB,OAAO4d,aAAqB,CAAA;AAC9B,KAAA;;AAEA;AACF;AACA;AACA;AAHE,GAAA,EAAA;IAAA7d,GAAA,EAAA,4BAAA;IAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;MACtC,OAAO4d,0BAAkC,CAAA;AAC3C,KAAA;AAAC,GAAA,CAAA,CAAA,CAAA;AAAA,EAAA,OAAAlW,QAAA,CAAA;AAAA,CAAA,CAnhBAinB,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,EAAA;AAyhBpC,SAASM,gBAAgBA,CAAC8X,WAAW,EAAE;AAC5C,EAAA,IAAIt/B,QAAQ,CAAC25B,UAAU,CAAC2F,WAAW,CAAC,EAAE;AACpC,IAAA,OAAOA,WAAW,CAAA;AACpB,GAAC,MAAM,IAAIA,WAAW,IAAIA,WAAW,CAACra,OAAO,IAAI7c,QAAQ,CAACk3B,WAAW,CAACra,OAAO,EAAE,CAAC,EAAE;AAChF,IAAA,OAAOjlB,QAAQ,CAACy3B,UAAU,CAAC6H,WAAW,CAAC,CAAA;GACxC,MAAM,IAAIA,WAAW,IAAI,OAAOA,WAAW,KAAK,QAAQ,EAAE;AACzD,IAAA,OAAOt/B,QAAQ,CAACmE,UAAU,CAACm7B,WAAW,CAAC,CAAA;AACzC,GAAC,MAAM;AACL,IAAA,MAAM,IAAInqC,oBAAoB,CAAA,6BAAA,GACEmqC,WAAW,GAAa,YAAA,GAAA,OAAOA,WAC/D,CAAC,CAAA;AACH,GAAA;AACF;;AC/hFMC,IAAAA,OAAO,GAAG;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/luxon/build/es6/luxon.mjs b/node_modules/luxon/build/es6/luxon.mjs
new file mode 100644
index 0000000..06e1d6c
--- /dev/null
+++ b/node_modules/luxon/build/es6/luxon.mjs
@@ -0,0 +1,8133 @@
+// these aren't really private, but nor are they really useful to document
+
+/**
+ * @private
+ */
+class LuxonError extends Error {}
+
+/**
+ * @private
+ */
+class InvalidDateTimeError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid DateTime: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidIntervalError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Interval: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidDurationError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Duration: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class ConflictingSpecificationError extends LuxonError {}
+
+/**
+ * @private
+ */
+class InvalidUnitError extends LuxonError {
+  constructor(unit) {
+    super(`Invalid unit ${unit}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidArgumentError extends LuxonError {}
+
+/**
+ * @private
+ */
+class ZoneIsAbstractError extends LuxonError {
+  constructor() {
+    super("Zone is an abstract class");
+  }
+}
+
+/**
+ * @private
+ */
+
+const n = "numeric",
+  s = "short",
+  l = "long";
+
+const DATE_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+};
+
+const DATE_MED = {
+  year: n,
+  month: s,
+  day: n,
+};
+
+const DATE_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+};
+
+const DATE_FULL = {
+  year: n,
+  month: l,
+  day: n,
+};
+
+const DATE_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+};
+
+const TIME_SIMPLE = {
+  hour: n,
+  minute: n,
+};
+
+const TIME_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+const TIME_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s,
+};
+
+const TIME_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l,
+};
+
+const TIME_24_SIMPLE = {
+  hour: n,
+  minute: n,
+  hourCycle: "h23",
+};
+
+const TIME_24_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+};
+
+const TIME_24_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: s,
+};
+
+const TIME_24_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: l,
+};
+
+const DATETIME_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+};
+
+const DATETIME_SHORT_WITH_SECONDS = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+const DATETIME_MED = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+};
+
+const DATETIME_MED_WITH_SECONDS = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+const DATETIME_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+  hour: n,
+  minute: n,
+};
+
+const DATETIME_FULL = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  timeZoneName: s,
+};
+
+const DATETIME_FULL_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s,
+};
+
+const DATETIME_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  timeZoneName: l,
+};
+
+const DATETIME_HUGE_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l,
+};
+
+/**
+ * @interface
+ */
+class Zone {
+  /**
+   * The type of zone
+   * @abstract
+   * @type {string}
+   */
+  get type() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The name of this zone.
+   * @abstract
+   * @type {string}
+   */
+  get name() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The IANA name of this zone.
+   * Defaults to `name` if not overwritten by a subclass.
+   * @abstract
+   * @type {string}
+   */
+  get ianaName() {
+    return this.name;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year.
+   * @abstract
+   * @type {boolean}
+   */
+  get isUniversal() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, opts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @abstract
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @abstract
+   * @type {boolean}
+   */
+  get isValid() {
+    throw new ZoneIsAbstractError();
+  }
+}
+
+let singleton$1 = null;
+
+/**
+ * Represents the local zone for this JavaScript environment.
+ * @implements {Zone}
+ */
+class SystemZone extends Zone {
+  /**
+   * Get a singleton instance of the local zone
+   * @return {SystemZone}
+   */
+  static get instance() {
+    if (singleton$1 === null) {
+      singleton$1 = new SystemZone();
+    }
+    return singleton$1;
+  }
+
+  /** @override **/
+  get type() {
+    return "system";
+  }
+
+  /** @override **/
+  get name() {
+    return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName(ts, { format, locale }) {
+    return parseZoneInfo(ts, format, locale);
+  }
+
+  /** @override **/
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /** @override **/
+  offset(ts) {
+    return -new Date(ts).getTimezoneOffset();
+  }
+
+  /** @override **/
+  equals(otherZone) {
+    return otherZone.type === "system";
+  }
+
+  /** @override **/
+  get isValid() {
+    return true;
+  }
+}
+
+const dtfCache = new Map();
+function makeDTF(zoneName) {
+  let dtf = dtfCache.get(zoneName);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat("en-US", {
+      hour12: false,
+      timeZone: zoneName,
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+      second: "2-digit",
+      era: "short",
+    });
+    dtfCache.set(zoneName, dtf);
+  }
+  return dtf;
+}
+
+const typeToPos = {
+  year: 0,
+  month: 1,
+  day: 2,
+  era: 3,
+  hour: 4,
+  minute: 5,
+  second: 6,
+};
+
+function hackyOffset(dtf, date) {
+  const formatted = dtf.format(date).replace(/\u200E/g, ""),
+    parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;
+  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+}
+
+function partsOffset(dtf, date) {
+  const formatted = dtf.formatToParts(date);
+  const filled = [];
+  for (let i = 0; i < formatted.length; i++) {
+    const { type, value } = formatted[i];
+    const pos = typeToPos[type];
+
+    if (type === "era") {
+      filled[pos] = value;
+    } else if (!isUndefined(pos)) {
+      filled[pos] = parseInt(value, 10);
+    }
+  }
+  return filled;
+}
+
+const ianaZoneCache = new Map();
+/**
+ * A zone identified by an IANA identifier, like America/New_York
+ * @implements {Zone}
+ */
+class IANAZone extends Zone {
+  /**
+   * @param {string} name - Zone name
+   * @return {IANAZone}
+   */
+  static create(name) {
+    let zone = ianaZoneCache.get(name);
+    if (zone === undefined) {
+      ianaZoneCache.set(name, (zone = new IANAZone(name)));
+    }
+    return zone;
+  }
+
+  /**
+   * Reset local caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCache() {
+    ianaZoneCache.clear();
+    dtfCache.clear();
+  }
+
+  /**
+   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+   * @param {string} s - The string to check validity on
+   * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+   * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+   * @return {boolean}
+   */
+  static isValidSpecifier(s) {
+    return this.isValidZone(s);
+  }
+
+  /**
+   * Returns whether the provided string identifies a real zone
+   * @param {string} zone - The string to check
+   * @example IANAZone.isValidZone("America/New_York") //=> true
+   * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+   * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+   * @return {boolean}
+   */
+  static isValidZone(zone) {
+    if (!zone) {
+      return false;
+    }
+    try {
+      new Intl.DateTimeFormat("en-US", { timeZone: zone }).format();
+      return true;
+    } catch (e) {
+      return false;
+    }
+  }
+
+  constructor(name) {
+    super();
+    /** @private **/
+    this.zoneName = name;
+    /** @private **/
+    this.valid = IANAZone.isValidZone(name);
+  }
+
+  /**
+   * The type of zone. `iana` for all instances of `IANAZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "iana";
+  }
+
+  /**
+   * The name of this zone (i.e. the IANA zone name).
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.zoneName;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns false for all IANA zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return false;
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, { format, locale }) {
+    return parseZoneInfo(ts, format, locale, this.name);
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    if (!this.valid) return NaN;
+    const date = new Date(ts);
+
+    if (isNaN(date)) return NaN;
+
+    const dtf = makeDTF(this.name);
+    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts
+      ? partsOffset(dtf, date)
+      : hackyOffset(dtf, date);
+
+    if (adOrBc === "BC") {
+      year = -Math.abs(year) + 1;
+    }
+
+    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+    const adjustedHour = hour === 24 ? 0 : hour;
+
+    const asUTC = objToLocalTS({
+      year,
+      month,
+      day,
+      hour: adjustedHour,
+      minute,
+      second,
+      millisecond: 0,
+    });
+
+    let asTS = +date;
+    const over = asTS % 1000;
+    asTS -= over >= 0 ? over : 1000 + over;
+    return (asUTC - asTS) / (60 * 1000);
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "iana" && otherZone.name === this.name;
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.valid;
+  }
+}
+
+// todo - remap caching
+
+let intlLFCache = {};
+function getCachedLF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlLFCache[key];
+  if (!dtf) {
+    dtf = new Intl.ListFormat(locString, opts);
+    intlLFCache[key] = dtf;
+  }
+  return dtf;
+}
+
+const intlDTCache = new Map();
+function getCachedDTF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlDTCache.get(key);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat(locString, opts);
+    intlDTCache.set(key, dtf);
+  }
+  return dtf;
+}
+
+const intlNumCache = new Map();
+function getCachedINF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let inf = intlNumCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.NumberFormat(locString, opts);
+    intlNumCache.set(key, inf);
+  }
+  return inf;
+}
+
+const intlRelCache = new Map();
+function getCachedRTF(locString, opts = {}) {
+  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options
+  const key = JSON.stringify([locString, cacheKeyOpts]);
+  let inf = intlRelCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.RelativeTimeFormat(locString, opts);
+    intlRelCache.set(key, inf);
+  }
+  return inf;
+}
+
+let sysLocaleCache = null;
+function systemLocale() {
+  if (sysLocaleCache) {
+    return sysLocaleCache;
+  } else {
+    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+    return sysLocaleCache;
+  }
+}
+
+const intlResolvedOptionsCache = new Map();
+function getCachedIntResolvedOptions(locString) {
+  let opts = intlResolvedOptionsCache.get(locString);
+  if (opts === undefined) {
+    opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+    intlResolvedOptionsCache.set(locString, opts);
+  }
+  return opts;
+}
+
+const weekInfoCache = new Map();
+function getCachedWeekInfo(locString) {
+  let data = weekInfoCache.get(locString);
+  if (!data) {
+    const locale = new Intl.Locale(locString);
+    // browsers currently implement this as a property, but spec says it should be a getter function
+    data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+    if (!("minimalDays" in data)) {
+      data = { ...fallbackWeekSettings, ...data };
+    }
+    weekInfoCache.set(locString, data);
+  }
+  return data;
+}
+
+function parseLocaleString(localeStr) {
+  // I really want to avoid writing a BCP 47 parser
+  // see, e.g. https://github.com/wooorm/bcp-47
+  // Instead, we'll do this:
+
+  // a) if the string has no -u extensions, just leave it alone
+  // b) if it does, use Intl to resolve everything
+  // c) if Intl fails, try again without the -u
+
+  // private subtags and unicode subtags have ordering requirements,
+  // and we're not properly parsing this, so just strip out the
+  // private ones if they exist.
+  const xIndex = localeStr.indexOf("-x-");
+  if (xIndex !== -1) {
+    localeStr = localeStr.substring(0, xIndex);
+  }
+
+  const uIndex = localeStr.indexOf("-u-");
+  if (uIndex === -1) {
+    return [localeStr];
+  } else {
+    let options;
+    let selectedStr;
+    try {
+      options = getCachedDTF(localeStr).resolvedOptions();
+      selectedStr = localeStr;
+    } catch (e) {
+      const smaller = localeStr.substring(0, uIndex);
+      options = getCachedDTF(smaller).resolvedOptions();
+      selectedStr = smaller;
+    }
+
+    const { numberingSystem, calendar } = options;
+    return [selectedStr, numberingSystem, calendar];
+  }
+}
+
+function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+  if (outputCalendar || numberingSystem) {
+    if (!localeStr.includes("-u-")) {
+      localeStr += "-u";
+    }
+
+    if (outputCalendar) {
+      localeStr += `-ca-${outputCalendar}`;
+    }
+
+    if (numberingSystem) {
+      localeStr += `-nu-${numberingSystem}`;
+    }
+    return localeStr;
+  } else {
+    return localeStr;
+  }
+}
+
+function mapMonths(f) {
+  const ms = [];
+  for (let i = 1; i <= 12; i++) {
+    const dt = DateTime.utc(2009, i, 1);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+
+function mapWeekdays(f) {
+  const ms = [];
+  for (let i = 1; i <= 7; i++) {
+    const dt = DateTime.utc(2016, 11, 13 + i);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+
+function listStuff(loc, length, englishFn, intlFn) {
+  const mode = loc.listingMode();
+
+  if (mode === "error") {
+    return null;
+  } else if (mode === "en") {
+    return englishFn(length);
+  } else {
+    return intlFn(length);
+  }
+}
+
+function supportsFastNumbers(loc) {
+  if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+    return false;
+  } else {
+    return (
+      loc.numberingSystem === "latn" ||
+      !loc.locale ||
+      loc.locale.startsWith("en") ||
+      getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn"
+    );
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyNumberFormatter {
+  constructor(intl, forceSimple, opts) {
+    this.padTo = opts.padTo || 0;
+    this.floor = opts.floor || false;
+
+    const { padTo, floor, ...otherOpts } = opts;
+
+    if (!forceSimple || Object.keys(otherOpts).length > 0) {
+      const intlOpts = { useGrouping: false, ...opts };
+      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+      this.inf = getCachedINF(intl, intlOpts);
+    }
+  }
+
+  format(i) {
+    if (this.inf) {
+      const fixed = this.floor ? Math.floor(i) : i;
+      return this.inf.format(fixed);
+    } else {
+      // to match the browser's numberformatter defaults
+      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+      return padStart(fixed, this.padTo);
+    }
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyDateFormatter {
+  constructor(dt, intl, opts) {
+    this.opts = opts;
+    this.originalZone = undefined;
+
+    let z = undefined;
+    if (this.opts.timeZone) {
+      // Don't apply any workarounds if a timeZone is explicitly provided in opts
+      this.dt = dt;
+    } else if (dt.zone.type === "fixed") {
+      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+      // That is why fixed-offset TZ is set to that unless it is:
+      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+      // 2. Unsupported by the browser:
+      //    - some do not support Etc/
+      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+      const gmtOffset = -1 * (dt.offset / 60);
+      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;
+      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+        z = offsetZ;
+        this.dt = dt;
+      } else {
+        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+        // we manually apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({ minutes: dt.offset });
+        this.originalZone = dt.zone;
+      }
+    } else if (dt.zone.type === "system") {
+      this.dt = dt;
+    } else if (dt.zone.type === "iana") {
+      this.dt = dt;
+      z = dt.zone.name;
+    } else {
+      // Custom zones can have any offset / offsetName so we just manually
+      // apply the offset and substitute the zone as needed.
+      z = "UTC";
+      this.dt = dt.setZone("UTC").plus({ minutes: dt.offset });
+      this.originalZone = dt.zone;
+    }
+
+    const intlOpts = { ...this.opts };
+    intlOpts.timeZone = intlOpts.timeZone || z;
+    this.dtf = getCachedDTF(intl, intlOpts);
+  }
+
+  format() {
+    if (this.originalZone) {
+      // If we have to substitute in the actual zone name, we have to use
+      // formatToParts so that the timezone can be replaced.
+      return this.formatToParts()
+        .map(({ value }) => value)
+        .join("");
+    }
+    return this.dtf.format(this.dt.toJSDate());
+  }
+
+  formatToParts() {
+    const parts = this.dtf.formatToParts(this.dt.toJSDate());
+    if (this.originalZone) {
+      return parts.map((part) => {
+        if (part.type === "timeZoneName") {
+          const offsetName = this.originalZone.offsetName(this.dt.ts, {
+            locale: this.dt.locale,
+            format: this.opts.timeZoneName,
+          });
+          return {
+            ...part,
+            value: offsetName,
+          };
+        } else {
+          return part;
+        }
+      });
+    }
+    return parts;
+  }
+
+  resolvedOptions() {
+    return this.dtf.resolvedOptions();
+  }
+}
+
+/**
+ * @private
+ */
+class PolyRelFormatter {
+  constructor(intl, isEnglish, opts) {
+    this.opts = { style: "long", ...opts };
+    if (!isEnglish && hasRelative()) {
+      this.rtf = getCachedRTF(intl, opts);
+    }
+  }
+
+  format(count, unit) {
+    if (this.rtf) {
+      return this.rtf.format(count, unit);
+    } else {
+      return formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+    }
+  }
+
+  formatToParts(count, unit) {
+    if (this.rtf) {
+      return this.rtf.formatToParts(count, unit);
+    } else {
+      return [];
+    }
+  }
+}
+
+const fallbackWeekSettings = {
+  firstDay: 1,
+  minimalDays: 4,
+  weekend: [6, 7],
+};
+
+/**
+ * @private
+ */
+class Locale {
+  static fromOpts(opts) {
+    return Locale.create(
+      opts.locale,
+      opts.numberingSystem,
+      opts.outputCalendar,
+      opts.weekSettings,
+      opts.defaultToEN
+    );
+  }
+
+  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {
+    const specifiedLocale = locale || Settings.defaultLocale;
+    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+    const localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+  }
+
+  static resetCache() {
+    sysLocaleCache = null;
+    intlDTCache.clear();
+    intlNumCache.clear();
+    intlRelCache.clear();
+    intlResolvedOptionsCache.clear();
+    weekInfoCache.clear();
+  }
+
+  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {
+    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+  }
+
+  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);
+
+    this.locale = parsedLocale;
+    this.numberingSystem = numbering || parsedNumberingSystem || null;
+    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+    this.weekSettings = weekSettings;
+    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+
+    this.weekdaysCache = { format: {}, standalone: {} };
+    this.monthsCache = { format: {}, standalone: {} };
+    this.meridiemCache = null;
+    this.eraCache = {};
+
+    this.specifiedLocale = specifiedLocale;
+    this.fastNumbersCached = null;
+  }
+
+  get fastNumbers() {
+    if (this.fastNumbersCached == null) {
+      this.fastNumbersCached = supportsFastNumbers(this);
+    }
+
+    return this.fastNumbersCached;
+  }
+
+  listingMode() {
+    const isActuallyEn = this.isEnglish();
+    const hasNoWeirdness =
+      (this.numberingSystem === null || this.numberingSystem === "latn") &&
+      (this.outputCalendar === null || this.outputCalendar === "gregory");
+    return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+  }
+
+  clone(alts) {
+    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+      return this;
+    } else {
+      return Locale.create(
+        alts.locale || this.specifiedLocale,
+        alts.numberingSystem || this.numberingSystem,
+        alts.outputCalendar || this.outputCalendar,
+        validateWeekSettings(alts.weekSettings) || this.weekSettings,
+        alts.defaultToEN || false
+      );
+    }
+  }
+
+  redefaultToEN(alts = {}) {
+    return this.clone({ ...alts, defaultToEN: true });
+  }
+
+  redefaultToSystem(alts = {}) {
+    return this.clone({ ...alts, defaultToEN: false });
+  }
+
+  months(length, format = false) {
+    return listStuff(this, length, months, () => {
+      // Workaround for "ja" locale: formatToParts does not label all parts of the month
+      // as "month" and for this locale there is no difference between "format" and "non-format".
+      // As such, just use format() instead of formatToParts() and take the whole string
+      const monthSpecialCase = this.intl === "ja" || this.intl.startsWith("ja-");
+      format &= !monthSpecialCase;
+      const intl = format ? { month: length, day: "numeric" } : { month: length },
+        formatStr = format ? "format" : "standalone";
+      if (!this.monthsCache[formatStr][length]) {
+        const mapper = !monthSpecialCase
+          ? (dt) => this.extract(dt, intl, "month")
+          : (dt) => this.dtFormatter(dt, intl).format();
+        this.monthsCache[formatStr][length] = mapMonths(mapper);
+      }
+      return this.monthsCache[formatStr][length];
+    });
+  }
+
+  weekdays(length, format = false) {
+    return listStuff(this, length, weekdays, () => {
+      const intl = format
+          ? { weekday: length, year: "numeric", month: "long", day: "numeric" }
+          : { weekday: length },
+        formatStr = format ? "format" : "standalone";
+      if (!this.weekdaysCache[formatStr][length]) {
+        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>
+          this.extract(dt, intl, "weekday")
+        );
+      }
+      return this.weekdaysCache[formatStr][length];
+    });
+  }
+
+  meridiems() {
+    return listStuff(
+      this,
+      undefined,
+      () => meridiems,
+      () => {
+        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+        // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+        if (!this.meridiemCache) {
+          const intl = { hour: "numeric", hourCycle: "h12" };
+          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(
+            (dt) => this.extract(dt, intl, "dayperiod")
+          );
+        }
+
+        return this.meridiemCache;
+      }
+    );
+  }
+
+  eras(length) {
+    return listStuff(this, length, eras, () => {
+      const intl = { era: length };
+
+      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+      // to definitely enumerate them.
+      if (!this.eraCache[length]) {
+        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>
+          this.extract(dt, intl, "era")
+        );
+      }
+
+      return this.eraCache[length];
+    });
+  }
+
+  extract(dt, intlOpts, field) {
+    const df = this.dtFormatter(dt, intlOpts),
+      results = df.formatToParts(),
+      matching = results.find((m) => m.type.toLowerCase() === field);
+    return matching ? matching.value : null;
+  }
+
+  numberFormatter(opts = {}) {
+    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+    // (in contrast, the rest of the condition is used heavily)
+    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+  }
+
+  dtFormatter(dt, intlOpts = {}) {
+    return new PolyDateFormatter(dt, this.intl, intlOpts);
+  }
+
+  relFormatter(opts = {}) {
+    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+  }
+
+  listFormatter(opts = {}) {
+    return getCachedLF(this.intl, opts);
+  }
+
+  isEnglish() {
+    return (
+      this.locale === "en" ||
+      this.locale.toLowerCase() === "en-us" ||
+      getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us")
+    );
+  }
+
+  getWeekSettings() {
+    if (this.weekSettings) {
+      return this.weekSettings;
+    } else if (!hasLocaleWeekInfo()) {
+      return fallbackWeekSettings;
+    } else {
+      return getCachedWeekInfo(this.locale);
+    }
+  }
+
+  getStartOfWeek() {
+    return this.getWeekSettings().firstDay;
+  }
+
+  getMinDaysInFirstWeek() {
+    return this.getWeekSettings().minimalDays;
+  }
+
+  getWeekendDays() {
+    return this.getWeekSettings().weekend;
+  }
+
+  equals(other) {
+    return (
+      this.locale === other.locale &&
+      this.numberingSystem === other.numberingSystem &&
+      this.outputCalendar === other.outputCalendar
+    );
+  }
+
+  toString() {
+    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;
+  }
+}
+
+let singleton = null;
+
+/**
+ * A zone with a fixed offset (meaning no DST)
+ * @implements {Zone}
+ */
+class FixedOffsetZone extends Zone {
+  /**
+   * Get a singleton instance of UTC
+   * @return {FixedOffsetZone}
+   */
+  static get utcInstance() {
+    if (singleton === null) {
+      singleton = new FixedOffsetZone(0);
+    }
+    return singleton;
+  }
+
+  /**
+   * Get an instance with a specified offset
+   * @param {number} offset - The offset in minutes
+   * @return {FixedOffsetZone}
+   */
+  static instance(offset) {
+    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+  }
+
+  /**
+   * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+   * @param {string} s - The offset string to parse
+   * @example FixedOffsetZone.parseSpecifier("UTC+6")
+   * @example FixedOffsetZone.parseSpecifier("UTC+06")
+   * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+   * @return {FixedOffsetZone}
+   */
+  static parseSpecifier(s) {
+    if (s) {
+      const r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+      if (r) {
+        return new FixedOffsetZone(signedOffset(r[1], r[2]));
+      }
+    }
+    return null;
+  }
+
+  constructor(offset) {
+    super();
+    /** @private **/
+    this.fixed = offset;
+  }
+
+  /**
+   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "fixed";
+  }
+
+  /**
+   * The name of this zone.
+   * All fixed zones' names always start with "UTC" (plus optional offset)
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.fixed === 0 ? "UTC" : `UTC${formatOffset(this.fixed, "narrow")}`;
+  }
+
+  /**
+   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+   *
+   * @override
+   * @type {string}
+   */
+  get ianaName() {
+    if (this.fixed === 0) {
+      return "Etc/UTC";
+    } else {
+      return `Etc/GMT${formatOffset(-this.fixed, "narrow")}`;
+    }
+  }
+
+  /**
+   * Returns the offset's common name at the specified timestamp.
+   *
+   * For fixed offset zones this equals to the zone name.
+   * @override
+   */
+  offsetName() {
+    return this.name;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.fixed, format);
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns true for all fixed offset zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return true;
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   *
+   * For fixed offset zones, this is constant and does not depend on a timestamp.
+   * @override
+   * @return {number}
+   */
+  offset() {
+    return this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is valid:
+   * All fixed offset zones are valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return true;
+  }
+}
+
+/**
+ * A zone that failed to parse. You should never need to instantiate this.
+ * @implements {Zone}
+ */
+class InvalidZone extends Zone {
+  constructor(zoneName) {
+    super();
+    /**  @private */
+    this.zoneName = zoneName;
+  }
+
+  /** @override **/
+  get type() {
+    return "invalid";
+  }
+
+  /** @override **/
+  get name() {
+    return this.zoneName;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName() {
+    return null;
+  }
+
+  /** @override **/
+  formatOffset() {
+    return "";
+  }
+
+  /** @override **/
+  offset() {
+    return NaN;
+  }
+
+  /** @override **/
+  equals() {
+    return false;
+  }
+
+  /** @override **/
+  get isValid() {
+    return false;
+  }
+}
+
+/**
+ * @private
+ */
+
+function normalizeZone(input, defaultZone) {
+  if (isUndefined(input) || input === null) {
+    return defaultZone;
+  } else if (input instanceof Zone) {
+    return input;
+  } else if (isString(input)) {
+    const lowered = input.toLowerCase();
+    if (lowered === "default") return defaultZone;
+    else if (lowered === "local" || lowered === "system") return SystemZone.instance;
+    else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;
+    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+  } else if (isNumber(input)) {
+    return FixedOffsetZone.instance(input);
+  } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+    // This is dumb, but the instanceof check above doesn't seem to really work
+    // so we're duck checking it
+    return input;
+  } else {
+    return new InvalidZone(input);
+  }
+}
+
+const numberingSystems = {
+  arab: "[\u0660-\u0669]",
+  arabext: "[\u06F0-\u06F9]",
+  bali: "[\u1B50-\u1B59]",
+  beng: "[\u09E6-\u09EF]",
+  deva: "[\u0966-\u096F]",
+  fullwide: "[\uFF10-\uFF19]",
+  gujr: "[\u0AE6-\u0AEF]",
+  hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+  khmr: "[\u17E0-\u17E9]",
+  knda: "[\u0CE6-\u0CEF]",
+  laoo: "[\u0ED0-\u0ED9]",
+  limb: "[\u1946-\u194F]",
+  mlym: "[\u0D66-\u0D6F]",
+  mong: "[\u1810-\u1819]",
+  mymr: "[\u1040-\u1049]",
+  orya: "[\u0B66-\u0B6F]",
+  tamldec: "[\u0BE6-\u0BEF]",
+  telu: "[\u0C66-\u0C6F]",
+  thai: "[\u0E50-\u0E59]",
+  tibt: "[\u0F20-\u0F29]",
+  latn: "\\d",
+};
+
+const numberingSystemsUTF16 = {
+  arab: [1632, 1641],
+  arabext: [1776, 1785],
+  bali: [6992, 7001],
+  beng: [2534, 2543],
+  deva: [2406, 2415],
+  fullwide: [65296, 65303],
+  gujr: [2790, 2799],
+  khmr: [6112, 6121],
+  knda: [3302, 3311],
+  laoo: [3792, 3801],
+  limb: [6470, 6479],
+  mlym: [3430, 3439],
+  mong: [6160, 6169],
+  mymr: [4160, 4169],
+  orya: [2918, 2927],
+  tamldec: [3046, 3055],
+  telu: [3174, 3183],
+  thai: [3664, 3673],
+  tibt: [3872, 3881],
+};
+
+const hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+
+function parseDigits(str) {
+  let value = parseInt(str, 10);
+  if (isNaN(value)) {
+    value = "";
+    for (let i = 0; i < str.length; i++) {
+      const code = str.charCodeAt(i);
+
+      if (str[i].search(numberingSystems.hanidec) !== -1) {
+        value += hanidecChars.indexOf(str[i]);
+      } else {
+        for (const key in numberingSystemsUTF16) {
+          const [min, max] = numberingSystemsUTF16[key];
+          if (code >= min && code <= max) {
+            value += code - min;
+          }
+        }
+      }
+    }
+    return parseInt(value, 10);
+  } else {
+    return value;
+  }
+}
+
+// cache of {numberingSystem: {append: regex}}
+const digitRegexCache = new Map();
+function resetDigitRegexCache() {
+  digitRegexCache.clear();
+}
+
+function digitRegex({ numberingSystem }, append = "") {
+  const ns = numberingSystem || "latn";
+
+  let appendCache = digitRegexCache.get(ns);
+  if (appendCache === undefined) {
+    appendCache = new Map();
+    digitRegexCache.set(ns, appendCache);
+  }
+  let regex = appendCache.get(append);
+  if (regex === undefined) {
+    regex = new RegExp(`${numberingSystems[ns]}${append}`);
+    appendCache.set(append, regex);
+  }
+
+  return regex;
+}
+
+let now = () => Date.now(),
+  defaultZone = "system",
+  defaultLocale = null,
+  defaultNumberingSystem = null,
+  defaultOutputCalendar = null,
+  twoDigitCutoffYear = 60,
+  throwOnInvalid,
+  defaultWeekSettings = null;
+
+/**
+ * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+ */
+class Settings {
+  /**
+   * Get the callback for returning the current timestamp.
+   * @type {function}
+   */
+  static get now() {
+    return now;
+  }
+
+  /**
+   * Set the callback for returning the current timestamp.
+   * The function should return a number, which will be interpreted as an Epoch millisecond count
+   * @type {function}
+   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+   */
+  static set now(n) {
+    now = n;
+  }
+
+  /**
+   * Set the default time zone to create DateTimes in. Does not affect existing instances.
+   * Use the value "system" to reset this value to the system's time zone.
+   * @type {string}
+   */
+  static set defaultZone(zone) {
+    defaultZone = zone;
+  }
+
+  /**
+   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+   * The default value is the system's time zone (the one set on the machine that runs this code).
+   * @type {Zone}
+   */
+  static get defaultZone() {
+    return normalizeZone(defaultZone, SystemZone.instance);
+  }
+
+  /**
+   * Get the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultLocale() {
+    return defaultLocale;
+  }
+
+  /**
+   * Set the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultLocale(locale) {
+    defaultLocale = locale;
+  }
+
+  /**
+   * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultNumberingSystem() {
+    return defaultNumberingSystem;
+  }
+
+  /**
+   * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultNumberingSystem(numberingSystem) {
+    defaultNumberingSystem = numberingSystem;
+  }
+
+  /**
+   * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultOutputCalendar() {
+    return defaultOutputCalendar;
+  }
+
+  /**
+   * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultOutputCalendar(outputCalendar) {
+    defaultOutputCalendar = outputCalendar;
+  }
+
+  /**
+   * @typedef {Object} WeekSettings
+   * @property {number} firstDay
+   * @property {number} minimalDays
+   * @property {number[]} weekend
+   */
+
+  /**
+   * @return {WeekSettings|null}
+   */
+  static get defaultWeekSettings() {
+    return defaultWeekSettings;
+  }
+
+  /**
+   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+   * how many days are required in the first week of a year.
+   * Does not affect existing instances.
+   *
+   * @param {WeekSettings|null} weekSettings
+   */
+  static set defaultWeekSettings(weekSettings) {
+    defaultWeekSettings = validateWeekSettings(weekSettings);
+  }
+
+  /**
+   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   */
+  static get twoDigitCutoffYear() {
+    return twoDigitCutoffYear;
+  }
+
+  /**
+   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+   */
+  static set twoDigitCutoffYear(cutoffYear) {
+    twoDigitCutoffYear = cutoffYear % 100;
+  }
+
+  /**
+   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static get throwOnInvalid() {
+    return throwOnInvalid;
+  }
+
+  /**
+   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static set throwOnInvalid(t) {
+    throwOnInvalid = t;
+  }
+
+  /**
+   * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCaches() {
+    Locale.resetCache();
+    IANAZone.resetCache();
+    DateTime.resetCache();
+    resetDigitRegexCache();
+  }
+}
+
+class Invalid {
+  constructor(reason, explanation) {
+    this.reason = reason;
+    this.explanation = explanation;
+  }
+
+  toMessage() {
+    if (this.explanation) {
+      return `${this.reason}: ${this.explanation}`;
+    } else {
+      return this.reason;
+    }
+  }
+}
+
+const nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+
+function unitOutOfRange(unit, value) {
+  return new Invalid(
+    "unit out of range",
+    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`
+  );
+}
+
+function dayOfWeek(year, month, day) {
+  const d = new Date(Date.UTC(year, month - 1, day));
+
+  if (year < 100 && year >= 0) {
+    d.setUTCFullYear(d.getUTCFullYear() - 1900);
+  }
+
+  const js = d.getUTCDay();
+
+  return js === 0 ? 7 : js;
+}
+
+function computeOrdinal(year, month, day) {
+  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+}
+
+function uncomputeOrdinal(year, ordinal) {
+  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+    month0 = table.findIndex((i) => i < ordinal),
+    day = ordinal - table[month0];
+  return { month: month0 + 1, day };
+}
+
+function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+  return ((isoWeekday - startOfWeek + 7) % 7) + 1;
+}
+
+/**
+ * @private
+ */
+
+function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const { year, month, day } = gregObj,
+    ordinal = computeOrdinal(year, month, day),
+    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+
+  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+    weekYear;
+
+  if (weekNumber < 1) {
+    weekYear = year - 1;
+    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+    weekYear = year + 1;
+    weekNumber = 1;
+  } else {
+    weekYear = year;
+  }
+
+  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };
+}
+
+function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const { weekYear, weekNumber, weekday } = weekData,
+    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+    yearInDays = daysInYear(weekYear);
+
+  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+    year;
+
+  if (ordinal < 1) {
+    year = weekYear - 1;
+    ordinal += daysInYear(year);
+  } else if (ordinal > yearInDays) {
+    year = weekYear + 1;
+    ordinal -= daysInYear(weekYear);
+  } else {
+    year = weekYear;
+  }
+
+  const { month, day } = uncomputeOrdinal(year, ordinal);
+  return { year, month, day, ...timeObject(weekData) };
+}
+
+function gregorianToOrdinal(gregData) {
+  const { year, month, day } = gregData;
+  const ordinal = computeOrdinal(year, month, day);
+  return { year, ordinal, ...timeObject(gregData) };
+}
+
+function ordinalToGregorian(ordinalData) {
+  const { year, ordinal } = ordinalData;
+  const { month, day } = uncomputeOrdinal(year, ordinal);
+  return { year, month, day, ...timeObject(ordinalData) };
+}
+
+/**
+ * Check if local week units like localWeekday are used in obj.
+ * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+ * Modifies obj in-place!
+ * @param obj the object values
+ */
+function usesLocalWeekValues(obj, loc) {
+  const hasLocaleWeekData =
+    !isUndefined(obj.localWeekday) ||
+    !isUndefined(obj.localWeekNumber) ||
+    !isUndefined(obj.localWeekYear);
+  if (hasLocaleWeekData) {
+    const hasIsoWeekData =
+      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+
+    if (hasIsoWeekData) {
+      throw new ConflictingSpecificationError(
+        "Cannot mix locale-based week fields with ISO-based week fields"
+      );
+    }
+    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+    delete obj.localWeekday;
+    delete obj.localWeekNumber;
+    delete obj.localWeekYear;
+    return {
+      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+      startOfWeek: loc.getStartOfWeek(),
+    };
+  } else {
+    return { minDaysInFirstWeek: 4, startOfWeek: 1 };
+  }
+}
+
+function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const validYear = isInteger(obj.weekYear),
+    validWeek = integerBetween(
+      obj.weekNumber,
+      1,
+      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)
+    ),
+    validWeekday = integerBetween(obj.weekday, 1, 7);
+
+  if (!validYear) {
+    return unitOutOfRange("weekYear", obj.weekYear);
+  } else if (!validWeek) {
+    return unitOutOfRange("week", obj.weekNumber);
+  } else if (!validWeekday) {
+    return unitOutOfRange("weekday", obj.weekday);
+  } else return false;
+}
+
+function hasInvalidOrdinalData(obj) {
+  const validYear = isInteger(obj.year),
+    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validOrdinal) {
+    return unitOutOfRange("ordinal", obj.ordinal);
+  } else return false;
+}
+
+function hasInvalidGregorianData(obj) {
+  const validYear = isInteger(obj.year),
+    validMonth = integerBetween(obj.month, 1, 12),
+    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validMonth) {
+    return unitOutOfRange("month", obj.month);
+  } else if (!validDay) {
+    return unitOutOfRange("day", obj.day);
+  } else return false;
+}
+
+function hasInvalidTimeData(obj) {
+  const { hour, minute, second, millisecond } = obj;
+  const validHour =
+      integerBetween(hour, 0, 23) ||
+      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),
+    validMinute = integerBetween(minute, 0, 59),
+    validSecond = integerBetween(second, 0, 59),
+    validMillisecond = integerBetween(millisecond, 0, 999);
+
+  if (!validHour) {
+    return unitOutOfRange("hour", hour);
+  } else if (!validMinute) {
+    return unitOutOfRange("minute", minute);
+  } else if (!validSecond) {
+    return unitOutOfRange("second", second);
+  } else if (!validMillisecond) {
+    return unitOutOfRange("millisecond", millisecond);
+  } else return false;
+}
+
+/*
+  This is just a junk drawer, containing anything used across multiple classes.
+  Because Luxon is small(ish), this should stay small and we won't worry about splitting
+  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.
+*/
+
+/**
+ * @private
+ */
+
+// TYPES
+
+function isUndefined(o) {
+  return typeof o === "undefined";
+}
+
+function isNumber(o) {
+  return typeof o === "number";
+}
+
+function isInteger(o) {
+  return typeof o === "number" && o % 1 === 0;
+}
+
+function isString(o) {
+  return typeof o === "string";
+}
+
+function isDate(o) {
+  return Object.prototype.toString.call(o) === "[object Date]";
+}
+
+// CAPABILITIES
+
+function hasRelative() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+  } catch (e) {
+    return false;
+  }
+}
+
+function hasLocaleWeekInfo() {
+  try {
+    return (
+      typeof Intl !== "undefined" &&
+      !!Intl.Locale &&
+      ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype)
+    );
+  } catch (e) {
+    return false;
+  }
+}
+
+// OBJECTS AND ARRAYS
+
+function maybeArray(thing) {
+  return Array.isArray(thing) ? thing : [thing];
+}
+
+function bestBy(arr, by, compare) {
+  if (arr.length === 0) {
+    return undefined;
+  }
+  return arr.reduce((best, next) => {
+    const pair = [by(next), next];
+    if (!best) {
+      return pair;
+    } else if (compare(best[0], pair[0]) === best[0]) {
+      return best;
+    } else {
+      return pair;
+    }
+  }, null)[1];
+}
+
+function pick(obj, keys) {
+  return keys.reduce((a, k) => {
+    a[k] = obj[k];
+    return a;
+  }, {});
+}
+
+function hasOwnProperty(obj, prop) {
+  return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+
+function validateWeekSettings(settings) {
+  if (settings == null) {
+    return null;
+  } else if (typeof settings !== "object") {
+    throw new InvalidArgumentError("Week settings must be an object");
+  } else {
+    if (
+      !integerBetween(settings.firstDay, 1, 7) ||
+      !integerBetween(settings.minimalDays, 1, 7) ||
+      !Array.isArray(settings.weekend) ||
+      settings.weekend.some((v) => !integerBetween(v, 1, 7))
+    ) {
+      throw new InvalidArgumentError("Invalid week settings");
+    }
+    return {
+      firstDay: settings.firstDay,
+      minimalDays: settings.minimalDays,
+      weekend: Array.from(settings.weekend),
+    };
+  }
+}
+
+// NUMBERS AND STRINGS
+
+function integerBetween(thing, bottom, top) {
+  return isInteger(thing) && thing >= bottom && thing <= top;
+}
+
+// x % n but takes the sign of n instead of x
+function floorMod(x, n) {
+  return x - n * Math.floor(x / n);
+}
+
+function padStart(input, n = 2) {
+  const isNeg = input < 0;
+  let padded;
+  if (isNeg) {
+    padded = "-" + ("" + -input).padStart(n, "0");
+  } else {
+    padded = ("" + input).padStart(n, "0");
+  }
+  return padded;
+}
+
+function parseInteger(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseInt(string, 10);
+  }
+}
+
+function parseFloating(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseFloat(string);
+  }
+}
+
+function parseMillis(fraction) {
+  // Return undefined (instead of 0) in these cases, where fraction is not set
+  if (isUndefined(fraction) || fraction === null || fraction === "") {
+    return undefined;
+  } else {
+    const f = parseFloat("0." + fraction) * 1000;
+    return Math.floor(f);
+  }
+}
+
+function roundTo(number, digits, rounding = "round") {
+  const factor = 10 ** digits;
+  switch (rounding) {
+    case "expand":
+      return number > 0
+        ? Math.ceil(number * factor) / factor
+        : Math.floor(number * factor) / factor;
+    case "trunc":
+      return Math.trunc(number * factor) / factor;
+    case "round":
+      return Math.round(number * factor) / factor;
+    case "floor":
+      return Math.floor(number * factor) / factor;
+    case "ceil":
+      return Math.ceil(number * factor) / factor;
+    default:
+      throw new RangeError(`Value rounding ${rounding} is out of range`);
+  }
+}
+
+// DATE BASICS
+
+function isLeapYear(year) {
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+
+function daysInYear(year) {
+  return isLeapYear(year) ? 366 : 365;
+}
+
+function daysInMonth(year, month) {
+  const modMonth = floorMod(month - 1, 12) + 1,
+    modYear = year + (month - modMonth) / 12;
+
+  if (modMonth === 2) {
+    return isLeapYear(modYear) ? 29 : 28;
+  } else {
+    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+  }
+}
+
+// convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+function objToLocalTS(obj) {
+  let d = Date.UTC(
+    obj.year,
+    obj.month - 1,
+    obj.day,
+    obj.hour,
+    obj.minute,
+    obj.second,
+    obj.millisecond
+  );
+
+  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+  if (obj.year < 100 && obj.year >= 0) {
+    d = new Date(d);
+    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+    // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+    // the calculations done by Date.UTC are using year 2000 - which is incorrect
+    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+  }
+  return +d;
+}
+
+// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+  return -fwdlw + minDaysInFirstWeek - 1;
+}
+
+function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+}
+
+function untruncateYear(year) {
+  if (year > 99) {
+    return year;
+  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+}
+
+// PARSING
+
+function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {
+  const date = new Date(ts),
+    intlOpts = {
+      hourCycle: "h23",
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+    };
+
+  if (timeZone) {
+    intlOpts.timeZone = timeZone;
+  }
+
+  const modified = { timeZoneName: offsetFormat, ...intlOpts };
+
+  const parsed = new Intl.DateTimeFormat(locale, modified)
+    .formatToParts(date)
+    .find((m) => m.type.toLowerCase() === "timezonename");
+  return parsed ? parsed.value : null;
+}
+
+// signedOffset('-5', '30') -> -330
+function signedOffset(offHourStr, offMinuteStr) {
+  let offHour = parseInt(offHourStr, 10);
+
+  // don't || this because we want to preserve -0
+  if (Number.isNaN(offHour)) {
+    offHour = 0;
+  }
+
+  const offMin = parseInt(offMinuteStr, 10) || 0,
+    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+  return offHour * 60 + offMinSigned;
+}
+
+// COERCION
+
+function asNumber(value) {
+  const numericValue = Number(value);
+  if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue))
+    throw new InvalidArgumentError(`Invalid unit value ${value}`);
+  return numericValue;
+}
+
+function normalizeObject(obj, normalizer) {
+  const normalized = {};
+  for (const u in obj) {
+    if (hasOwnProperty(obj, u)) {
+      const v = obj[u];
+      if (v === undefined || v === null) continue;
+      normalized[normalizer(u)] = asNumber(v);
+    }
+  }
+  return normalized;
+}
+
+/**
+ * Returns the offset's value as a string
+ * @param {number} ts - Epoch milliseconds for which to get the offset
+ * @param {string} format - What style of offset to return.
+ *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+ * @return {string}
+ */
+function formatOffset(offset, format) {
+  const hours = Math.trunc(Math.abs(offset / 60)),
+    minutes = Math.trunc(Math.abs(offset % 60)),
+    sign = offset >= 0 ? "+" : "-";
+
+  switch (format) {
+    case "short":
+      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;
+    case "narrow":
+      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : ""}`;
+    case "techie":
+      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;
+    default:
+      throw new RangeError(`Value format ${format} is out of range for property format`);
+  }
+}
+
+function timeObject(obj) {
+  return pick(obj, ["hour", "minute", "second", "millisecond"]);
+}
+
+/**
+ * @private
+ */
+
+const monthsLong = [
+  "January",
+  "February",
+  "March",
+  "April",
+  "May",
+  "June",
+  "July",
+  "August",
+  "September",
+  "October",
+  "November",
+  "December",
+];
+
+const monthsShort = [
+  "Jan",
+  "Feb",
+  "Mar",
+  "Apr",
+  "May",
+  "Jun",
+  "Jul",
+  "Aug",
+  "Sep",
+  "Oct",
+  "Nov",
+  "Dec",
+];
+
+const monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+
+function months(length) {
+  switch (length) {
+    case "narrow":
+      return [...monthsNarrow];
+    case "short":
+      return [...monthsShort];
+    case "long":
+      return [...monthsLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+    case "2-digit":
+      return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+    default:
+      return null;
+  }
+}
+
+const weekdaysLong = [
+  "Monday",
+  "Tuesday",
+  "Wednesday",
+  "Thursday",
+  "Friday",
+  "Saturday",
+  "Sunday",
+];
+
+const weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+
+const weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+
+function weekdays(length) {
+  switch (length) {
+    case "narrow":
+      return [...weekdaysNarrow];
+    case "short":
+      return [...weekdaysShort];
+    case "long":
+      return [...weekdaysLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7"];
+    default:
+      return null;
+  }
+}
+
+const meridiems = ["AM", "PM"];
+
+const erasLong = ["Before Christ", "Anno Domini"];
+
+const erasShort = ["BC", "AD"];
+
+const erasNarrow = ["B", "A"];
+
+function eras(length) {
+  switch (length) {
+    case "narrow":
+      return [...erasNarrow];
+    case "short":
+      return [...erasShort];
+    case "long":
+      return [...erasLong];
+    default:
+      return null;
+  }
+}
+
+function meridiemForDateTime(dt) {
+  return meridiems[dt.hour < 12 ? 0 : 1];
+}
+
+function weekdayForDateTime(dt, length) {
+  return weekdays(length)[dt.weekday - 1];
+}
+
+function monthForDateTime(dt, length) {
+  return months(length)[dt.month - 1];
+}
+
+function eraForDateTime(dt, length) {
+  return eras(length)[dt.year < 0 ? 0 : 1];
+}
+
+function formatRelativeTime(unit, count, numeric = "always", narrow = false) {
+  const units = {
+    years: ["year", "yr."],
+    quarters: ["quarter", "qtr."],
+    months: ["month", "mo."],
+    weeks: ["week", "wk."],
+    days: ["day", "day", "days"],
+    hours: ["hour", "hr."],
+    minutes: ["minute", "min."],
+    seconds: ["second", "sec."],
+  };
+
+  const lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+
+  if (numeric === "auto" && lastable) {
+    const isDay = unit === "days";
+    switch (count) {
+      case 1:
+        return isDay ? "tomorrow" : `next ${units[unit][0]}`;
+      case -1:
+        return isDay ? "yesterday" : `last ${units[unit][0]}`;
+      case 0:
+        return isDay ? "today" : `this ${units[unit][0]}`;
+    }
+  }
+
+  const isInPast = Object.is(count, -0) || count < 0,
+    fmtValue = Math.abs(count),
+    singular = fmtValue === 1,
+    lilUnits = units[unit],
+    fmtUnit = narrow
+      ? singular
+        ? lilUnits[1]
+        : lilUnits[2] || lilUnits[1]
+      : singular
+      ? units[unit][0]
+      : unit;
+  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;
+}
+
+function stringifyTokens(splits, tokenToString) {
+  let s = "";
+  for (const token of splits) {
+    if (token.literal) {
+      s += token.val;
+    } else {
+      s += tokenToString(token.val);
+    }
+  }
+  return s;
+}
+
+const macroTokenToFormatOpts = {
+  D: DATE_SHORT,
+  DD: DATE_MED,
+  DDD: DATE_FULL,
+  DDDD: DATE_HUGE,
+  t: TIME_SIMPLE,
+  tt: TIME_WITH_SECONDS,
+  ttt: TIME_WITH_SHORT_OFFSET,
+  tttt: TIME_WITH_LONG_OFFSET,
+  T: TIME_24_SIMPLE,
+  TT: TIME_24_WITH_SECONDS,
+  TTT: TIME_24_WITH_SHORT_OFFSET,
+  TTTT: TIME_24_WITH_LONG_OFFSET,
+  f: DATETIME_SHORT,
+  ff: DATETIME_MED,
+  fff: DATETIME_FULL,
+  ffff: DATETIME_HUGE,
+  F: DATETIME_SHORT_WITH_SECONDS,
+  FF: DATETIME_MED_WITH_SECONDS,
+  FFF: DATETIME_FULL_WITH_SECONDS,
+  FFFF: DATETIME_HUGE_WITH_SECONDS,
+};
+
+/**
+ * @private
+ */
+
+class Formatter {
+  static create(locale, opts = {}) {
+    return new Formatter(locale, opts);
+  }
+
+  static parseFormat(fmt) {
+    // white-space is always considered a literal in user-provided formats
+    // the " " token has a special meaning (see unitForToken)
+
+    let current = null,
+      currentFull = "",
+      bracketed = false;
+    const splits = [];
+    for (let i = 0; i < fmt.length; i++) {
+      const c = fmt.charAt(i);
+      if (c === "'") {
+        // turn '' into a literal signal quote instead of just skipping the empty literal
+        if (currentFull.length > 0 || bracketed) {
+          splits.push({
+            literal: bracketed || /^\s+$/.test(currentFull),
+            val: currentFull === "" ? "'" : currentFull,
+          });
+        }
+        current = null;
+        currentFull = "";
+        bracketed = !bracketed;
+      } else if (bracketed) {
+        currentFull += c;
+      } else if (c === current) {
+        currentFull += c;
+      } else {
+        if (currentFull.length > 0) {
+          splits.push({ literal: /^\s+$/.test(currentFull), val: currentFull });
+        }
+        currentFull = c;
+        current = c;
+      }
+    }
+
+    if (currentFull.length > 0) {
+      splits.push({ literal: bracketed || /^\s+$/.test(currentFull), val: currentFull });
+    }
+
+    return splits;
+  }
+
+  static macroTokenToFormatOpts(token) {
+    return macroTokenToFormatOpts[token];
+  }
+
+  constructor(locale, formatOpts) {
+    this.opts = formatOpts;
+    this.loc = locale;
+    this.systemLoc = null;
+  }
+
+  formatWithSystemDefault(dt, opts) {
+    if (this.systemLoc === null) {
+      this.systemLoc = this.loc.redefaultToSystem();
+    }
+    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });
+    return df.format();
+  }
+
+  dtFormatter(dt, opts = {}) {
+    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });
+  }
+
+  formatDateTime(dt, opts) {
+    return this.dtFormatter(dt, opts).format();
+  }
+
+  formatDateTimeParts(dt, opts) {
+    return this.dtFormatter(dt, opts).formatToParts();
+  }
+
+  formatInterval(interval, opts) {
+    const df = this.dtFormatter(interval.start, opts);
+    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+  }
+
+  resolvedOptions(dt, opts) {
+    return this.dtFormatter(dt, opts).resolvedOptions();
+  }
+
+  num(n, p = 0, signDisplay = undefined) {
+    // we get some perf out of doing this here, annoyingly
+    if (this.opts.forceSimple) {
+      return padStart(n, p);
+    }
+
+    const opts = { ...this.opts };
+
+    if (p > 0) {
+      opts.padTo = p;
+    }
+    if (signDisplay) {
+      opts.signDisplay = signDisplay;
+    }
+
+    return this.loc.numberFormatter(opts).format(n);
+  }
+
+  formatDateTimeFromString(dt, fmt) {
+    const knownEnglish = this.loc.listingMode() === "en",
+      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+      string = (opts, extract) => this.loc.extract(dt, opts, extract),
+      formatOffset = (opts) => {
+        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+          return "Z";
+        }
+
+        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+      },
+      meridiem = () =>
+        knownEnglish
+          ? meridiemForDateTime(dt)
+          : string({ hour: "numeric", hourCycle: "h12" }, "dayperiod"),
+      month = (length, standalone) =>
+        knownEnglish
+          ? monthForDateTime(dt, length)
+          : string(standalone ? { month: length } : { month: length, day: "numeric" }, "month"),
+      weekday = (length, standalone) =>
+        knownEnglish
+          ? weekdayForDateTime(dt, length)
+          : string(
+              standalone ? { weekday: length } : { weekday: length, month: "long", day: "numeric" },
+              "weekday"
+            ),
+      maybeMacro = (token) => {
+        const formatOpts = Formatter.macroTokenToFormatOpts(token);
+        if (formatOpts) {
+          return this.formatWithSystemDefault(dt, formatOpts);
+        } else {
+          return token;
+        }
+      },
+      era = (length) =>
+        knownEnglish ? eraForDateTime(dt, length) : string({ era: length }, "era"),
+      tokenToString = (token) => {
+        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+        switch (token) {
+          // ms
+          case "S":
+            return this.num(dt.millisecond);
+          case "u":
+          // falls through
+          case "SSS":
+            return this.num(dt.millisecond, 3);
+          // seconds
+          case "s":
+            return this.num(dt.second);
+          case "ss":
+            return this.num(dt.second, 2);
+          // fractional seconds
+          case "uu":
+            return this.num(Math.floor(dt.millisecond / 10), 2);
+          case "uuu":
+            return this.num(Math.floor(dt.millisecond / 100));
+          // minutes
+          case "m":
+            return this.num(dt.minute);
+          case "mm":
+            return this.num(dt.minute, 2);
+          // hours
+          case "h":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+          case "hh":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+          case "H":
+            return this.num(dt.hour);
+          case "HH":
+            return this.num(dt.hour, 2);
+          // offset
+          case "Z":
+            // like +6
+            return formatOffset({ format: "narrow", allowZ: this.opts.allowZ });
+          case "ZZ":
+            // like +06:00
+            return formatOffset({ format: "short", allowZ: this.opts.allowZ });
+          case "ZZZ":
+            // like +0600
+            return formatOffset({ format: "techie", allowZ: this.opts.allowZ });
+          case "ZZZZ":
+            // like EST
+            return dt.zone.offsetName(dt.ts, { format: "short", locale: this.loc.locale });
+          case "ZZZZZ":
+            // like Eastern Standard Time
+            return dt.zone.offsetName(dt.ts, { format: "long", locale: this.loc.locale });
+          // zone
+          case "z":
+            // like America/New_York
+            return dt.zoneName;
+          // meridiems
+          case "a":
+            return meridiem();
+          // dates
+          case "d":
+            return useDateTimeFormatter ? string({ day: "numeric" }, "day") : this.num(dt.day);
+          case "dd":
+            return useDateTimeFormatter ? string({ day: "2-digit" }, "day") : this.num(dt.day, 2);
+          // weekdays - standalone
+          case "c":
+            // like 1
+            return this.num(dt.weekday);
+          case "ccc":
+            // like 'Tues'
+            return weekday("short", true);
+          case "cccc":
+            // like 'Tuesday'
+            return weekday("long", true);
+          case "ccccc":
+            // like 'T'
+            return weekday("narrow", true);
+          // weekdays - format
+          case "E":
+            // like 1
+            return this.num(dt.weekday);
+          case "EEE":
+            // like 'Tues'
+            return weekday("short", false);
+          case "EEEE":
+            // like 'Tuesday'
+            return weekday("long", false);
+          case "EEEEE":
+            // like 'T'
+            return weekday("narrow", false);
+          // months - standalone
+          case "L":
+            // like 1
+            return useDateTimeFormatter
+              ? string({ month: "numeric", day: "numeric" }, "month")
+              : this.num(dt.month);
+          case "LL":
+            // like 01, doesn't seem to work
+            return useDateTimeFormatter
+              ? string({ month: "2-digit", day: "numeric" }, "month")
+              : this.num(dt.month, 2);
+          case "LLL":
+            // like Jan
+            return month("short", true);
+          case "LLLL":
+            // like January
+            return month("long", true);
+          case "LLLLL":
+            // like J
+            return month("narrow", true);
+          // months - format
+          case "M":
+            // like 1
+            return useDateTimeFormatter
+              ? string({ month: "numeric" }, "month")
+              : this.num(dt.month);
+          case "MM":
+            // like 01
+            return useDateTimeFormatter
+              ? string({ month: "2-digit" }, "month")
+              : this.num(dt.month, 2);
+          case "MMM":
+            // like Jan
+            return month("short", false);
+          case "MMMM":
+            // like January
+            return month("long", false);
+          case "MMMMM":
+            // like J
+            return month("narrow", false);
+          // years
+          case "y":
+            // like 2014
+            return useDateTimeFormatter ? string({ year: "numeric" }, "year") : this.num(dt.year);
+          case "yy":
+            // like 14
+            return useDateTimeFormatter
+              ? string({ year: "2-digit" }, "year")
+              : this.num(dt.year.toString().slice(-2), 2);
+          case "yyyy":
+            // like 0012
+            return useDateTimeFormatter
+              ? string({ year: "numeric" }, "year")
+              : this.num(dt.year, 4);
+          case "yyyyyy":
+            // like 000012
+            return useDateTimeFormatter
+              ? string({ year: "numeric" }, "year")
+              : this.num(dt.year, 6);
+          // eras
+          case "G":
+            // like AD
+            return era("short");
+          case "GG":
+            // like Anno Domini
+            return era("long");
+          case "GGGGG":
+            return era("narrow");
+          case "kk":
+            return this.num(dt.weekYear.toString().slice(-2), 2);
+          case "kkkk":
+            return this.num(dt.weekYear, 4);
+          case "W":
+            return this.num(dt.weekNumber);
+          case "WW":
+            return this.num(dt.weekNumber, 2);
+          case "n":
+            return this.num(dt.localWeekNumber);
+          case "nn":
+            return this.num(dt.localWeekNumber, 2);
+          case "ii":
+            return this.num(dt.localWeekYear.toString().slice(-2), 2);
+          case "iiii":
+            return this.num(dt.localWeekYear, 4);
+          case "o":
+            return this.num(dt.ordinal);
+          case "ooo":
+            return this.num(dt.ordinal, 3);
+          case "q":
+            // like 1
+            return this.num(dt.quarter);
+          case "qq":
+            // like 01
+            return this.num(dt.quarter, 2);
+          case "X":
+            return this.num(Math.floor(dt.ts / 1000));
+          case "x":
+            return this.num(dt.ts);
+          default:
+            return maybeMacro(token);
+        }
+      };
+
+    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+  }
+
+  formatDurationFromString(dur, fmt) {
+    const invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+    const tokenToField = (token) => {
+        switch (token[0]) {
+          case "S":
+            return "milliseconds";
+          case "s":
+            return "seconds";
+          case "m":
+            return "minutes";
+          case "h":
+            return "hours";
+          case "d":
+            return "days";
+          case "w":
+            return "weeks";
+          case "M":
+            return "months";
+          case "y":
+            return "years";
+          default:
+            return null;
+        }
+      },
+      tokenToString = (lildur, info) => (token) => {
+        const mapped = tokenToField(token);
+        if (mapped) {
+          const inversionFactor =
+            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+          let signDisplay;
+          if (this.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+            signDisplay = "never";
+          } else if (this.opts.signMode === "all") {
+            signDisplay = "always";
+          } else {
+            // "auto" and "negative" are the same, but "auto" has better support
+            signDisplay = "auto";
+          }
+          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+        } else {
+          return token;
+        }
+      },
+      tokens = Formatter.parseFormat(fmt),
+      realTokens = tokens.reduce(
+        (found, { literal, val }) => (literal ? found : found.concat(val)),
+        []
+      ),
+      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),
+      durationInfo = {
+        isNegativeDuration: collapsed < 0,
+        // this relies on "collapsed" being based on "shiftTo", which builds up the object
+        // in order
+        largestUnit: Object.keys(collapsed.values)[0],
+      };
+    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+  }
+}
+
+/*
+ * This file handles parsing for well-specified formats. Here's how it works:
+ * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+ * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+ * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+ * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+ * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+ * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+ */
+
+const ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+
+function combineRegexes(...regexes) {
+  const full = regexes.reduce((f, r) => f + r.source, "");
+  return RegExp(`^${full}$`);
+}
+
+function combineExtractors(...extractors) {
+  return (m) =>
+    extractors
+      .reduce(
+        ([mergedVals, mergedZone, cursor], ex) => {
+          const [val, zone, next] = ex(m, cursor);
+          return [{ ...mergedVals, ...val }, zone || mergedZone, next];
+        },
+        [{}, null, 1]
+      )
+      .slice(0, 2);
+}
+
+function parse(s, ...patterns) {
+  if (s == null) {
+    return [null, null];
+  }
+
+  for (const [regex, extractor] of patterns) {
+    const m = regex.exec(s);
+    if (m) {
+      return extractor(m);
+    }
+  }
+  return [null, null];
+}
+
+function simpleParse(...keys) {
+  return (match, cursor) => {
+    const ret = {};
+    let i;
+
+    for (i = 0; i < keys.length; i++) {
+      ret[keys[i]] = parseInteger(match[cursor + i]);
+    }
+    return [ret, null, cursor + i];
+  };
+}
+
+// ISO and SQL parsing
+const offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+const isoExtendedZone = `(?:${offsetRegex.source}?(?:\\[(${ianaRegex.source})\\])?)?`;
+const isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+const isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);
+const isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);
+const isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+const isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+const isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+const extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+const extractISOOrdinalData = simpleParse("year", "ordinal");
+const sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+const sqlTimeRegex = RegExp(
+  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`
+);
+const sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);
+
+function int(match, pos, fallback) {
+  const m = match[pos];
+  return isUndefined(m) ? fallback : parseInteger(m);
+}
+
+function extractISOYmd(match, cursor) {
+  const item = {
+    year: int(match, cursor),
+    month: int(match, cursor + 1, 1),
+    day: int(match, cursor + 2, 1),
+  };
+
+  return [item, null, cursor + 3];
+}
+
+function extractISOTime(match, cursor) {
+  const item = {
+    hours: int(match, cursor, 0),
+    minutes: int(match, cursor + 1, 0),
+    seconds: int(match, cursor + 2, 0),
+    milliseconds: parseMillis(match[cursor + 3]),
+  };
+
+  return [item, null, cursor + 4];
+}
+
+function extractISOOffset(match, cursor) {
+  const local = !match[cursor] && !match[cursor + 1],
+    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+    zone = local ? null : FixedOffsetZone.instance(fullOffset);
+  return [{}, zone, cursor + 3];
+}
+
+function extractIANAZone(match, cursor) {
+  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+  return [{}, zone, cursor + 1];
+}
+
+// ISO time parsing
+
+const isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);
+
+// ISO duration parsing
+
+const isoDuration =
+  /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+
+function extractISODuration(match) {
+  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =
+    match;
+
+  const hasNegativePrefix = s[0] === "-";
+  const negativeSeconds = secondStr && secondStr[0] === "-";
+
+  const maybeNegate = (num, force = false) =>
+    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;
+
+  return [
+    {
+      years: maybeNegate(parseFloating(yearStr)),
+      months: maybeNegate(parseFloating(monthStr)),
+      weeks: maybeNegate(parseFloating(weekStr)),
+      days: maybeNegate(parseFloating(dayStr)),
+      hours: maybeNegate(parseFloating(hourStr)),
+      minutes: maybeNegate(parseFloating(minuteStr)),
+      seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),
+    },
+  ];
+}
+
+// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+// and not just that we're in -240 *right now*. But since I don't think these are used that often
+// I'm just going to ignore that
+const obsOffsets = {
+  GMT: 0,
+  EDT: -4 * 60,
+  EST: -5 * 60,
+  CDT: -5 * 60,
+  CST: -6 * 60,
+  MDT: -6 * 60,
+  MST: -7 * 60,
+  PDT: -7 * 60,
+  PST: -8 * 60,
+};
+
+function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+  const result = {
+    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+    month: monthsShort.indexOf(monthStr) + 1,
+    day: parseInteger(dayStr),
+    hour: parseInteger(hourStr),
+    minute: parseInteger(minuteStr),
+  };
+
+  if (secondStr) result.second = parseInteger(secondStr);
+  if (weekdayStr) {
+    result.weekday =
+      weekdayStr.length > 3
+        ? weekdaysLong.indexOf(weekdayStr) + 1
+        : weekdaysShort.indexOf(weekdayStr) + 1;
+  }
+
+  return result;
+}
+
+// RFC 2822/5322
+const rfc2822 =
+  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+
+function extractRFC2822(match) {
+  const [
+      ,
+      weekdayStr,
+      dayStr,
+      monthStr,
+      yearStr,
+      hourStr,
+      minuteStr,
+      secondStr,
+      obsOffset,
+      milOffset,
+      offHourStr,
+      offMinuteStr,
+    ] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+
+  let offset;
+  if (obsOffset) {
+    offset = obsOffsets[obsOffset];
+  } else if (milOffset) {
+    offset = 0;
+  } else {
+    offset = signedOffset(offHourStr, offMinuteStr);
+  }
+
+  return [result, new FixedOffsetZone(offset)];
+}
+
+function preprocessRFC2822(s) {
+  // Remove comments and folding whitespace and replace multiple-spaces with a single space
+  return s
+    .replace(/\([^()]*\)|[\n\t]/g, " ")
+    .replace(/(\s\s+)/g, " ")
+    .trim();
+}
+
+// http date
+
+const rfc1123 =
+    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+  rfc850 =
+    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+  ascii =
+    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+
+function extractRFC1123Or850(match) {
+  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+
+function extractASCII(match) {
+  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+
+const isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+const isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+const isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+const isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+
+const extractISOYmdTimeAndOffset = combineExtractors(
+  extractISOYmd,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOWeekTimeAndOffset = combineExtractors(
+  extractISOWeekData,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOOrdinalDateAndTime = combineExtractors(
+  extractISOOrdinalData,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOTimeAndOffset = combineExtractors(
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+
+/*
+ * @private
+ */
+
+function parseISODate(s) {
+  return parse(
+    s,
+    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],
+    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],
+    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],
+    [isoTimeCombinedRegex, extractISOTimeAndOffset]
+  );
+}
+
+function parseRFC2822Date(s) {
+  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+}
+
+function parseHTTPDate(s) {
+  return parse(
+    s,
+    [rfc1123, extractRFC1123Or850],
+    [rfc850, extractRFC1123Or850],
+    [ascii, extractASCII]
+  );
+}
+
+function parseISODuration(s) {
+  return parse(s, [isoDuration, extractISODuration]);
+}
+
+const extractISOTimeOnly = combineExtractors(extractISOTime);
+
+function parseISOTimeOnly(s) {
+  return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+}
+
+const sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+const sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+
+const extractISOTimeOffsetAndIANAZone = combineExtractors(
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+
+function parseSQL(s) {
+  return parse(
+    s,
+    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],
+    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]
+  );
+}
+
+const INVALID$2 = "Invalid Duration";
+
+// unit conversion constants
+const lowOrderMatrix = {
+    weeks: {
+      days: 7,
+      hours: 7 * 24,
+      minutes: 7 * 24 * 60,
+      seconds: 7 * 24 * 60 * 60,
+      milliseconds: 7 * 24 * 60 * 60 * 1000,
+    },
+    days: {
+      hours: 24,
+      minutes: 24 * 60,
+      seconds: 24 * 60 * 60,
+      milliseconds: 24 * 60 * 60 * 1000,
+    },
+    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },
+    minutes: { seconds: 60, milliseconds: 60 * 1000 },
+    seconds: { milliseconds: 1000 },
+  },
+  casualMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: 52,
+      days: 365,
+      hours: 365 * 24,
+      minutes: 365 * 24 * 60,
+      seconds: 365 * 24 * 60 * 60,
+      milliseconds: 365 * 24 * 60 * 60 * 1000,
+    },
+    quarters: {
+      months: 3,
+      weeks: 13,
+      days: 91,
+      hours: 91 * 24,
+      minutes: 91 * 24 * 60,
+      seconds: 91 * 24 * 60 * 60,
+      milliseconds: 91 * 24 * 60 * 60 * 1000,
+    },
+    months: {
+      weeks: 4,
+      days: 30,
+      hours: 30 * 24,
+      minutes: 30 * 24 * 60,
+      seconds: 30 * 24 * 60 * 60,
+      milliseconds: 30 * 24 * 60 * 60 * 1000,
+    },
+
+    ...lowOrderMatrix,
+  },
+  daysInYearAccurate = 146097.0 / 400,
+  daysInMonthAccurate = 146097.0 / 4800,
+  accurateMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: daysInYearAccurate / 7,
+      days: daysInYearAccurate,
+      hours: daysInYearAccurate * 24,
+      minutes: daysInYearAccurate * 24 * 60,
+      seconds: daysInYearAccurate * 24 * 60 * 60,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,
+    },
+    quarters: {
+      months: 3,
+      weeks: daysInYearAccurate / 28,
+      days: daysInYearAccurate / 4,
+      hours: (daysInYearAccurate * 24) / 4,
+      minutes: (daysInYearAccurate * 24 * 60) / 4,
+      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,
+      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,
+    },
+    months: {
+      weeks: daysInMonthAccurate / 7,
+      days: daysInMonthAccurate,
+      hours: daysInMonthAccurate * 24,
+      minutes: daysInMonthAccurate * 24 * 60,
+      seconds: daysInMonthAccurate * 24 * 60 * 60,
+      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,
+    },
+    ...lowOrderMatrix,
+  };
+
+// units ordered by size
+const orderedUnits$1 = [
+  "years",
+  "quarters",
+  "months",
+  "weeks",
+  "days",
+  "hours",
+  "minutes",
+  "seconds",
+  "milliseconds",
+];
+
+const reverseUnits = orderedUnits$1.slice(0).reverse();
+
+// clone really means "create another instance just like this one, but with these changes"
+function clone$1(dur, alts, clear = false) {
+  // deep merge for vals
+  const conf = {
+    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },
+    loc: dur.loc.clone(alts.loc),
+    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+    matrix: alts.matrix || dur.matrix,
+  };
+  return new Duration(conf);
+}
+
+function durationToMillis(matrix, vals) {
+  let sum = vals.milliseconds ?? 0;
+  for (const unit of reverseUnits.slice(1)) {
+    if (vals[unit]) {
+      sum += vals[unit] * matrix[unit]["milliseconds"];
+    }
+  }
+  return sum;
+}
+
+// NB: mutates parameters
+function normalizeValues(matrix, vals) {
+  // the logic below assumes the overall value of the duration is positive
+  // if this is not the case, factor is used to make it so
+  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+
+  orderedUnits$1.reduceRight((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const previousVal = vals[previous] * factor;
+        const conv = matrix[current][previous];
+
+        // if (previousVal < 0):
+        // lower order unit is negative (e.g. { years: 2, days: -2 })
+        // normalize this by reducing the higher order unit by the appropriate amount
+        // and increasing the lower order unit
+        // this can never make the higher order unit negative, because this function only operates
+        // on positive durations, so the amount of time represented by the lower order unit cannot
+        // be larger than the higher order unit
+        // else:
+        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+        // in this case we attempt to convert as much as possible from the lower order unit into
+        // the higher order one
+        //
+        // Math.floor takes care of both of these cases, rounding away from 0
+        // if previousVal < 0 it makes the absolute value larger
+        // if previousVal >= it makes the absolute value smaller
+        const rollUp = Math.floor(previousVal / conv);
+        vals[current] += rollUp * factor;
+        vals[previous] -= rollUp * conv * factor;
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+
+  // try to convert any decimals into smaller units if possible
+  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+  orderedUnits$1.reduce((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const fraction = vals[previous] % 1;
+        vals[previous] -= fraction;
+        vals[current] += fraction * matrix[previous][current];
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+}
+
+// Remove all properties with a value of 0 from an object
+function removeZeroes(vals) {
+  const newVals = {};
+  for (const [key, value] of Object.entries(vals)) {
+    if (value !== 0) {
+      newVals[key] = value;
+    }
+  }
+  return newVals;
+}
+
+/**
+ * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+ *
+ * Here is a brief overview of commonly used methods and getters in Duration:
+ *
+ * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+ * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+ * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+ * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+ * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+ *
+ * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+ */
+class Duration {
+  /**
+   * @private
+   */
+  constructor(config) {
+    const accurate = config.conversionAccuracy === "longterm" || false;
+    let matrix = accurate ? accurateMatrix : casualMatrix;
+
+    if (config.matrix) {
+      matrix = config.matrix;
+    }
+
+    /**
+     * @access private
+     */
+    this.values = config.values;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.conversionAccuracy = accurate ? "longterm" : "casual";
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.matrix = matrix;
+    /**
+     * @access private
+     */
+    this.isLuxonDuration = true;
+  }
+
+  /**
+   * Create Duration from a number of milliseconds.
+   * @param {number} count of milliseconds
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  static fromMillis(count, opts) {
+    return Duration.fromObject({ milliseconds: count }, opts);
+  }
+
+  /**
+   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+   * If this object is empty then a zero milliseconds duration is returned.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.years
+   * @param {number} obj.quarters
+   * @param {number} obj.months
+   * @param {number} obj.weeks
+   * @param {number} obj.days
+   * @param {number} obj.hours
+   * @param {number} obj.minutes
+   * @param {number} obj.seconds
+   * @param {number} obj.milliseconds
+   * @param {Object} [opts=[]] - options for creating this Duration
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the custom conversion system to use
+   * @return {Duration}
+   */
+  static fromObject(obj, opts = {}) {
+    if (obj == null || typeof obj !== "object") {
+      throw new InvalidArgumentError(
+        `Duration.fromObject: argument expected to be an object, got ${
+          obj === null ? "null" : typeof obj
+        }`
+      );
+    }
+
+    return new Duration({
+      values: normalizeObject(obj, Duration.normalizeUnit),
+      loc: Locale.fromObject(opts),
+      conversionAccuracy: opts.conversionAccuracy,
+      matrix: opts.matrix,
+    });
+  }
+
+  /**
+   * Create a Duration from DurationLike.
+   *
+   * @param {Object | number | Duration} durationLike
+   * One of:
+   * - object with keys like 'years' and 'hours'.
+   * - number representing milliseconds
+   * - Duration instance
+   * @return {Duration}
+   */
+  static fromDurationLike(durationLike) {
+    if (isNumber(durationLike)) {
+      return Duration.fromMillis(durationLike);
+    } else if (Duration.isDuration(durationLike)) {
+      return durationLike;
+    } else if (typeof durationLike === "object") {
+      return Duration.fromObject(durationLike);
+    } else {
+      throw new InvalidArgumentError(
+        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`
+      );
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 duration string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the preset conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+   * @return {Duration}
+   */
+  static fromISO(text, opts) {
+    const [parsed] = parseISODuration(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 time string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @return {Duration}
+   */
+  static fromISOTime(text, opts) {
+    const [parsed] = parseISOTimeOnly(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create an invalid Duration.
+   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Duration}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDurationError(invalid);
+    } else {
+      return new Duration({ invalid });
+    }
+  }
+
+  /**
+   * @private
+   */
+  static normalizeUnit(unit) {
+    const normalized = {
+      year: "years",
+      years: "years",
+      quarter: "quarters",
+      quarters: "quarters",
+      month: "months",
+      months: "months",
+      week: "weeks",
+      weeks: "weeks",
+      day: "days",
+      days: "days",
+      hour: "hours",
+      hours: "hours",
+      minute: "minutes",
+      minutes: "minutes",
+      second: "seconds",
+      seconds: "seconds",
+      millisecond: "milliseconds",
+      milliseconds: "milliseconds",
+    }[unit ? unit.toLowerCase() : unit];
+
+    if (!normalized) throw new InvalidUnitError(unit);
+
+    return normalized;
+  }
+
+  /**
+   * Check if an object is a Duration. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDuration(o) {
+    return (o && o.isLuxonDuration) || false;
+  }
+
+  /**
+   * Get  the locale of a Duration, such 'en-GB'
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+   * * `S` for milliseconds
+   * * `s` for seconds
+   * * `m` for minutes
+   * * `h` for hours
+   * * `d` for days
+   * * `w` for weeks
+   * * `M` for months
+   * * `y` for years
+   * Notes:
+   * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+   * * Tokens can be escaped by wrapping with single quotes.
+   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - options
+   * @param {boolean} [opts.floor=true] - floor numerical values
+   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+    const fmtOpts = {
+      ...opts,
+      floor: opts.round !== false && opts.floor !== false,
+    };
+    return this.isValid
+      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)
+      : INVALID$2;
+  }
+
+  /**
+   * Returns a string representation of a Duration with all units included.
+   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+   * @example
+   * ```js
+   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+   * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+   * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+   * ```
+   */
+  toHuman(opts = {}) {
+    if (!this.isValid) return INVALID$2;
+
+    const showZeros = opts.showZeros !== false;
+
+    const l = orderedUnits$1
+      .map((unit) => {
+        const val = this.values[unit];
+        if (isUndefined(val) || (val === 0 && !showZeros)) {
+          return null;
+        }
+        return this.loc
+          .numberFormatter({ style: "unit", unitDisplay: "long", ...opts, unit: unit.slice(0, -1) })
+          .format(val);
+      })
+      .filter((n) => n);
+
+    return this.loc
+      .listFormatter({ type: "conjunction", style: opts.listStyle || "narrow", ...opts })
+      .format(l);
+  }
+
+  /**
+   * Returns a JavaScript object with this Duration's values.
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+   * @return {Object}
+   */
+  toObject() {
+    if (!this.isValid) return {};
+    return { ...this.values };
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+   * @return {string}
+   */
+  toISO() {
+    // we could use the formatter, but this is an easier way to get the minimum string
+    if (!this.isValid) return null;
+
+    let s = "P";
+    if (this.years !== 0) s += this.years + "Y";
+    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+    if (this.weeks !== 0) s += this.weeks + "W";
+    if (this.days !== 0) s += this.days + "D";
+    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)
+      s += "T";
+    if (this.hours !== 0) s += this.hours + "H";
+    if (this.minutes !== 0) s += this.minutes + "M";
+    if (this.seconds !== 0 || this.milliseconds !== 0)
+      // this will handle "floating point madness" by removing extra decimal places
+      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+    if (s === "P") s += "T0S";
+    return s;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+   * @return {string}
+   */
+  toISOTime(opts = {}) {
+    if (!this.isValid) return null;
+
+    const millis = this.toMillis();
+    if (millis < 0 || millis >= 86400000) return null;
+
+    opts = {
+      suppressMilliseconds: false,
+      suppressSeconds: false,
+      includePrefix: false,
+      format: "extended",
+      ...opts,
+      includeOffset: false,
+    };
+
+    const dateTime = DateTime.fromMillis(millis, { zone: "UTC" });
+    return dateTime.toISOTime(opts);
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+   * @return {string}
+   */
+  toString() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a string representation of this Duration appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Duration { values: ${JSON.stringify(this.values)} }`;
+    } else {
+      return `Duration { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration.
+   * @return {number}
+   */
+  toMillis() {
+    if (!this.isValid) return NaN;
+
+    return durationToMillis(this.matrix, this.values);
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+
+    const dur = Duration.fromDurationLike(duration),
+      result = {};
+
+    for (const k of orderedUnits$1) {
+      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+        result[k] = dur.get(k) + this.get(k);
+      }
+    }
+
+    return clone$1(this, { values: result }, true);
+  }
+
+  /**
+   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+
+    const dur = Duration.fromDurationLike(duration);
+    return this.plus(dur.negate());
+  }
+
+  /**
+   * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+   * @return {Duration}
+   */
+  mapUnits(fn) {
+    if (!this.isValid) return this;
+    const result = {};
+    for (const k of Object.keys(this.values)) {
+      result[k] = asNumber(fn(this.values[k], k));
+    }
+    return clone$1(this, { values: result }, true);
+  }
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+   * @return {number}
+   */
+  get(unit) {
+    return this[Duration.normalizeUnit(unit)];
+  }
+
+  /**
+   * "Set" the values of specified units. Return a newly-constructed Duration.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dur.set({ years: 2017 })
+   * @example dur.set({ hours: 8, minutes: 30 })
+   * @return {Duration}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+
+    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };
+    return clone$1(this, { values: mixed });
+  }
+
+  /**
+   * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+   * @example dur.reconfigure({ locale: 'en-GB' })
+   * @return {Duration}
+   */
+  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {
+    const loc = this.loc.clone({ locale, numberingSystem });
+    const opts = { loc, matrix, conversionAccuracy };
+    return clone$1(this, opts);
+  }
+
+  /**
+   * Return the length of the duration in the specified unit.
+   * @param {string} unit - a unit such as 'minutes' or 'days'
+   * @example Duration.fromObject({years: 1}).as('days') //=> 365
+   * @example Duration.fromObject({years: 1}).as('months') //=> 12
+   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+   * @return {number}
+   */
+  as(unit) {
+    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+  }
+
+  /**
+   * Reduce this Duration to its canonical representation in its current units.
+   * Assuming the overall value of the Duration is positive, this means:
+   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+   *   the overall value would be negative, see third example)
+   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+   *
+   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+   * @return {Duration}
+   */
+  normalize() {
+    if (!this.isValid) return this;
+    const vals = this.toObject();
+    normalizeValues(this.matrix, vals);
+    return clone$1(this, { values: vals }, true);
+  }
+
+  /**
+   * Rescale units to its largest representation
+   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+   * @return {Duration}
+   */
+  rescale() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.normalize().shiftToAll().toObject());
+    return clone$1(this, { values: vals }, true);
+  }
+
+  /**
+   * Convert this Duration into its representation in a different set of units.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+   * @return {Duration}
+   */
+  shiftTo(...units) {
+    if (!this.isValid) return this;
+
+    if (units.length === 0) {
+      return this;
+    }
+
+    units = units.map((u) => Duration.normalizeUnit(u));
+
+    const built = {},
+      accumulated = {},
+      vals = this.toObject();
+    let lastUnit;
+
+    for (const k of orderedUnits$1) {
+      if (units.indexOf(k) >= 0) {
+        lastUnit = k;
+
+        let own = 0;
+
+        // anything we haven't boiled down yet should get boiled to this unit
+        for (const ak in accumulated) {
+          own += this.matrix[ak][k] * accumulated[ak];
+          accumulated[ak] = 0;
+        }
+
+        // plus anything that's already in this unit
+        if (isNumber(vals[k])) {
+          own += vals[k];
+        }
+
+        // only keep the integer part for now in the hopes of putting any decimal part
+        // into a smaller unit later
+        const i = Math.trunc(own);
+        built[k] = i;
+        accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+        // otherwise, keep it in the wings to boil it later
+      } else if (isNumber(vals[k])) {
+        accumulated[k] = vals[k];
+      }
+    }
+
+    // anything leftover becomes the decimal for the last unit
+    // lastUnit must be defined since units is not empty
+    for (const key in accumulated) {
+      if (accumulated[key] !== 0) {
+        built[lastUnit] +=
+          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+      }
+    }
+
+    normalizeValues(this.matrix, built);
+    return clone$1(this, { values: built }, true);
+  }
+
+  /**
+   * Shift this Duration to all available units.
+   * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+   * @return {Duration}
+   */
+  shiftToAll() {
+    if (!this.isValid) return this;
+    return this.shiftTo(
+      "years",
+      "months",
+      "weeks",
+      "days",
+      "hours",
+      "minutes",
+      "seconds",
+      "milliseconds"
+    );
+  }
+
+  /**
+   * Return the negative of this Duration.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+   * @return {Duration}
+   */
+  negate() {
+    if (!this.isValid) return this;
+    const negated = {};
+    for (const k of Object.keys(this.values)) {
+      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+    }
+    return clone$1(this, { values: negated }, true);
+  }
+
+  /**
+   * Removes all units with values equal to 0 from this Duration.
+   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+   * @return {Duration}
+   */
+  removeZeros() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.values);
+    return clone$1(this, { values: vals }, true);
+  }
+
+  /**
+   * Get the years.
+   * @type {number}
+   */
+  get years() {
+    return this.isValid ? this.values.years || 0 : NaN;
+  }
+
+  /**
+   * Get the quarters.
+   * @type {number}
+   */
+  get quarters() {
+    return this.isValid ? this.values.quarters || 0 : NaN;
+  }
+
+  /**
+   * Get the months.
+   * @type {number}
+   */
+  get months() {
+    return this.isValid ? this.values.months || 0 : NaN;
+  }
+
+  /**
+   * Get the weeks
+   * @type {number}
+   */
+  get weeks() {
+    return this.isValid ? this.values.weeks || 0 : NaN;
+  }
+
+  /**
+   * Get the days.
+   * @type {number}
+   */
+  get days() {
+    return this.isValid ? this.values.days || 0 : NaN;
+  }
+
+  /**
+   * Get the hours.
+   * @type {number}
+   */
+  get hours() {
+    return this.isValid ? this.values.hours || 0 : NaN;
+  }
+
+  /**
+   * Get the minutes.
+   * @type {number}
+   */
+  get minutes() {
+    return this.isValid ? this.values.minutes || 0 : NaN;
+  }
+
+  /**
+   * Get the seconds.
+   * @return {number}
+   */
+  get seconds() {
+    return this.isValid ? this.values.seconds || 0 : NaN;
+  }
+
+  /**
+   * Get the milliseconds.
+   * @return {number}
+   */
+  get milliseconds() {
+    return this.isValid ? this.values.milliseconds || 0 : NaN;
+  }
+
+  /**
+   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+   * on invalid DateTimes or Intervals.
+   * @return {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this Duration became invalid, or null if the Duration is valid
+   * @return {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Equality check
+   * Two Durations are equal iff they have the same units and the same values for each unit.
+   * @param {Duration} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+
+    if (!this.loc.equals(other.loc)) {
+      return false;
+    }
+
+    function eq(v1, v2) {
+      // Consider 0 and undefined as equal
+      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+      return v1 === v2;
+    }
+
+    for (const u of orderedUnits$1) {
+      if (!eq(this.values[u], other.values[u])) {
+        return false;
+      }
+    }
+    return true;
+  }
+}
+
+const INVALID$1 = "Invalid Interval";
+
+// checks if the start is equal to or before the end
+function validateStartEnd(start, end) {
+  if (!start || !start.isValid) {
+    return Interval.invalid("missing or invalid start");
+  } else if (!end || !end.isValid) {
+    return Interval.invalid("missing or invalid end");
+  } else if (end < start) {
+    return Interval.invalid(
+      "end before start",
+      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`
+    );
+  } else {
+    return null;
+  }
+}
+
+/**
+ * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+ *
+ * Here is a brief overview of the most commonly used methods and getters in Interval:
+ *
+ * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+ * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+ * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+ * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+ * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+ * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+ */
+class Interval {
+  /**
+   * @private
+   */
+  constructor(config) {
+    /**
+     * @access private
+     */
+    this.s = config.start;
+    /**
+     * @access private
+     */
+    this.e = config.end;
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.isLuxonInterval = true;
+  }
+
+  /**
+   * Create an invalid Interval.
+   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Interval}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidIntervalError(invalid);
+    } else {
+      return new Interval({ invalid });
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+   * @param {DateTime|Date|Object} start
+   * @param {DateTime|Date|Object} end
+   * @return {Interval}
+   */
+  static fromDateTimes(start, end) {
+    const builtStart = friendlyDateTime(start),
+      builtEnd = friendlyDateTime(end);
+
+    const validateError = validateStartEnd(builtStart, builtEnd);
+
+    if (validateError == null) {
+      return new Interval({
+        start: builtStart,
+        end: builtEnd,
+      });
+    } else {
+      return validateError;
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and a Duration to extend to.
+   * @param {DateTime|Date|Object} start
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static after(start, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(start);
+    return Interval.fromDateTimes(dt, dt.plus(dur));
+  }
+
+  /**
+   * Create an Interval from an end DateTime and a Duration to extend backwards to.
+   * @param {DateTime|Date|Object} end
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static before(end, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(end);
+    return Interval.fromDateTimes(dt.minus(dur), dt);
+  }
+
+  /**
+   * Create an Interval from an ISO 8601 string.
+   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+   * @param {string} text - the ISO string to parse
+   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {Interval}
+   */
+  static fromISO(text, opts) {
+    const [s, e] = (text || "").split("/", 2);
+    if (s && e) {
+      let start, startIsValid;
+      try {
+        start = DateTime.fromISO(s, opts);
+        startIsValid = start.isValid;
+      } catch (e) {
+        startIsValid = false;
+      }
+
+      let end, endIsValid;
+      try {
+        end = DateTime.fromISO(e, opts);
+        endIsValid = end.isValid;
+      } catch (e) {
+        endIsValid = false;
+      }
+
+      if (startIsValid && endIsValid) {
+        return Interval.fromDateTimes(start, end);
+      }
+
+      if (startIsValid) {
+        const dur = Duration.fromISO(e, opts);
+        if (dur.isValid) {
+          return Interval.after(start, dur);
+        }
+      } else if (endIsValid) {
+        const dur = Duration.fromISO(s, opts);
+        if (dur.isValid) {
+          return Interval.before(end, dur);
+        }
+      }
+    }
+    return Interval.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+  }
+
+  /**
+   * Check if an object is an Interval. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isInterval(o) {
+    return (o && o.isLuxonInterval) || false;
+  }
+
+  /**
+   * Returns the start of the Interval
+   * @type {DateTime}
+   */
+  get start() {
+    return this.isValid ? this.s : null;
+  }
+
+  /**
+   * Returns the end of the Interval. This is the first instant which is not part of the interval
+   * (Interval is half-open).
+   * @type {DateTime}
+   */
+  get end() {
+    return this.isValid ? this.e : null;
+  }
+
+  /**
+   * Returns the last DateTime included in the interval (since end is not part of the interval)
+   * @type {DateTime}
+   */
+  get lastDateTime() {
+    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;
+  }
+
+  /**
+   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalidReason === null;
+  }
+
+  /**
+   * Returns an error code if this Interval is invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Returns the length of the Interval in the specified unit.
+   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+   * @return {number}
+   */
+  length(unit = "milliseconds") {
+    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;
+  }
+
+  /**
+   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+   * @param {string} [unit='milliseconds'] - the unit of time to count.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+   * @return {number}
+   */
+  count(unit = "milliseconds", opts) {
+    if (!this.isValid) return NaN;
+    const start = this.start.startOf(unit, opts);
+    let end;
+    if (opts?.useLocaleWeeks) {
+      end = this.end.reconfigure({ locale: start.locale });
+    } else {
+      end = this.end;
+    }
+    end = end.startOf(unit, opts);
+    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+  }
+
+  /**
+   * Returns whether this Interval's start and end are both in the same unit of time
+   * @param {string} unit - the unit of time to check sameness on
+   * @return {boolean}
+   */
+  hasSame(unit) {
+    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end DateTimes.
+   * @return {boolean}
+   */
+  isEmpty() {
+    return this.s.valueOf() === this.e.valueOf();
+  }
+
+  /**
+   * Return whether this Interval's start is after the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isAfter(dateTime) {
+    if (!this.isValid) return false;
+    return this.s > dateTime;
+  }
+
+  /**
+   * Return whether this Interval's end is before the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isBefore(dateTime) {
+    if (!this.isValid) return false;
+    return this.e <= dateTime;
+  }
+
+  /**
+   * Return whether this Interval contains the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  contains(dateTime) {
+    if (!this.isValid) return false;
+    return this.s <= dateTime && this.e > dateTime;
+  }
+
+  /**
+   * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+   * @param {Object} values - the values to set
+   * @param {DateTime} values.start - the starting DateTime
+   * @param {DateTime} values.end - the ending DateTime
+   * @return {Interval}
+   */
+  set({ start, end } = {}) {
+    if (!this.isValid) return this;
+    return Interval.fromDateTimes(start || this.s, end || this.e);
+  }
+
+  /**
+   * Split this Interval at each of the specified DateTimes
+   * @param {...DateTime} dateTimes - the unit of time to count.
+   * @return {Array}
+   */
+  splitAt(...dateTimes) {
+    if (!this.isValid) return [];
+    const sorted = dateTimes
+        .map(friendlyDateTime)
+        .filter((d) => this.contains(d))
+        .sort((a, b) => a.toMillis() - b.toMillis()),
+      results = [];
+    let { s } = this,
+      i = 0;
+
+    while (s < this.e) {
+      const added = sorted[i] || this.e,
+        next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      i += 1;
+    }
+
+    return results;
+  }
+
+  /**
+   * Split this Interval into smaller Intervals, each of the specified length.
+   * Left over time is grouped into a smaller interval
+   * @param {Duration|Object|number} duration - The length of each resulting interval.
+   * @return {Array}
+   */
+  splitBy(duration) {
+    const dur = Duration.fromDurationLike(duration);
+
+    if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+      return [];
+    }
+
+    let { s } = this,
+      idx = 1,
+      next;
+
+    const results = [];
+    while (s < this.e) {
+      const added = this.start.plus(dur.mapUnits((x) => x * idx));
+      next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      idx += 1;
+    }
+
+    return results;
+  }
+
+  /**
+   * Split this Interval into the specified number of smaller intervals.
+   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+   * @return {Array}
+   */
+  divideEqually(numberOfParts) {
+    if (!this.isValid) return [];
+    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+  }
+
+  /**
+   * Return whether this Interval overlaps with the specified Interval
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  overlaps(other) {
+    return this.e > other.s && this.s < other.e;
+  }
+
+  /**
+   * Return whether this Interval's end is adjacent to the specified Interval's start.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsStart(other) {
+    if (!this.isValid) return false;
+    return +this.e === +other.s;
+  }
+
+  /**
+   * Return whether this Interval's start is adjacent to the specified Interval's end.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsEnd(other) {
+    if (!this.isValid) return false;
+    return +other.e === +this.s;
+  }
+
+  /**
+   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  engulfs(other) {
+    if (!this.isValid) return false;
+    return this.s <= other.s && this.e >= other.e;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end as the specified Interval.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+
+    return this.s.equals(other.s) && this.e.equals(other.e);
+  }
+
+  /**
+   * Return an Interval representing the intersection of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+   * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  intersection(other) {
+    if (!this.isValid) return this;
+    const s = this.s > other.s ? this.s : other.s,
+      e = this.e < other.e ? this.e : other.e;
+
+    if (s >= e) {
+      return null;
+    } else {
+      return Interval.fromDateTimes(s, e);
+    }
+  }
+
+  /**
+   * Return an Interval representing the union of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  union(other) {
+    if (!this.isValid) return this;
+    const s = this.s < other.s ? this.s : other.s,
+      e = this.e > other.e ? this.e : other.e;
+    return Interval.fromDateTimes(s, e);
+  }
+
+  /**
+   * Merge an array of Intervals into an equivalent minimal set of Intervals.
+   * Combines overlapping and adjacent Intervals.
+   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+   * and ending with the latest.
+   *
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static merge(intervals) {
+    const [found, final] = intervals
+      .sort((a, b) => a.s - b.s)
+      .reduce(
+        ([sofar, current], item) => {
+          if (!current) {
+            return [sofar, item];
+          } else if (current.overlaps(item) || current.abutsStart(item)) {
+            return [sofar, current.union(item)];
+          } else {
+            return [sofar.concat([current]), item];
+          }
+        },
+        [[], null]
+      );
+    if (final) {
+      found.push(final);
+    }
+    return found;
+  }
+
+  /**
+   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static xor(intervals) {
+    let start = null,
+      currentCount = 0;
+    const results = [],
+      ends = intervals.map((i) => [
+        { time: i.s, type: "s" },
+        { time: i.e, type: "e" },
+      ]),
+      flattened = Array.prototype.concat(...ends),
+      arr = flattened.sort((a, b) => a.time - b.time);
+
+    for (const i of arr) {
+      currentCount += i.type === "s" ? 1 : -1;
+
+      if (currentCount === 1) {
+        start = i.time;
+      } else {
+        if (start && +start !== +i.time) {
+          results.push(Interval.fromDateTimes(start, i.time));
+        }
+
+        start = null;
+      }
+    }
+
+    return Interval.merge(results);
+  }
+
+  /**
+   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+   * @param {...Interval} intervals
+   * @return {Array}
+   */
+  difference(...intervals) {
+    return Interval.xor([this].concat(intervals))
+      .map((i) => this.intersection(i))
+      .filter((i) => i && !i.isEmpty());
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for debugging.
+   * @return {string}
+   */
+  toString() {
+    if (!this.isValid) return INVALID$1;
+    return `[${this.s.toISO()} – ${this.e.toISO()})`;
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;
+    } else {
+      return `Interval { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns a localized string representing this Interval. Accepts the same options as the
+   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+   * is browser-specific, but in general it will return an appropriate representation of the
+   * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+   * specified.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+   * Intl.DateTimeFormat constructor options.
+   * @param {Object} opts - Options to override the configuration of the start DateTime.
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+   * @return {string}
+   */
+  toLocaleString(formatOpts = DATE_SHORT, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)
+      : INVALID$1;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Interval.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISO(opts) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of date of this Interval.
+   * The time components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {string}
+   */
+  toISODate() {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISODate()}/${this.e.toISODate()}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of time of this Interval.
+   * The date components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISOTime(opts) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this Interval formatted according to the specified format
+   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+   * formatting tool.
+   * @param {string} dateFormat - The format string. This string formats the start and end time.
+   * See {@link DateTime#toFormat} for details.
+   * @param {Object} opts - Options.
+   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+   * representations.
+   * @return {string}
+   */
+  toFormat(dateFormat, { separator = " – " } = {}) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;
+  }
+
+  /**
+   * Return a Duration representing the time spanned by this interval.
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+   * @return {Duration}
+   */
+  toDuration(unit, opts) {
+    if (!this.isValid) {
+      return Duration.invalid(this.invalidReason);
+    }
+    return this.e.diff(this.s, unit, opts);
+  }
+
+  /**
+   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+   * @param {function} mapFn
+   * @return {Interval}
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+   */
+  mapEndpoints(mapFn) {
+    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+  }
+}
+
+/**
+ * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+ */
+class Info {
+  /**
+   * Return whether the specified zone contains a DST.
+   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+   * @return {boolean}
+   */
+  static hasDST(zone = Settings.defaultZone) {
+    const proto = DateTime.now().setZone(zone).set({ month: 12 });
+
+    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;
+  }
+
+  /**
+   * Return whether the specified zone is a valid IANA specifier.
+   * @param {string} zone - Zone to check
+   * @return {boolean}
+   */
+  static isValidIANAZone(zone) {
+    return IANAZone.isValidZone(zone);
+  }
+
+  /**
+   * Converts the input into a {@link Zone} instance.
+   *
+   * * If `input` is already a Zone instance, it is returned unchanged.
+   * * If `input` is a string containing a valid time zone name, a Zone instance
+   *   with that name is returned.
+   * * If `input` is a string that doesn't refer to a known time zone, a Zone
+   *   instance with {@link Zone#isValid} == false is returned.
+   * * If `input is a number, a Zone instance with the specified fixed offset
+   *   in minutes is returned.
+   * * If `input` is `null` or `undefined`, the default zone is returned.
+   * @param {string|Zone|number} [input] - the value to be converted
+   * @return {Zone}
+   */
+  static normalizeZone(input) {
+    return normalizeZone(input, Settings.defaultZone);
+  }
+
+  /**
+   * Get the weekday on which the week starts according to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+   */
+  static getStartOfWeek({ locale = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale)).getStartOfWeek();
+  }
+
+  /**
+   * Get the minimum number of days necessary in a week before it is considered part of the next year according
+   * to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number}
+   */
+  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+  }
+
+  /**
+   * Get the weekdays, which are considered the weekend according to the given locale
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+   */
+  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {
+    // copy the array, because we cache it internally
+    return (locObj || Locale.create(locale)).getWeekendDays().slice();
+  }
+
+  /**
+   * Return an array of standalone month names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @example Info.months()[0] //=> 'January'
+   * @example Info.months('short')[0] //=> 'Jan'
+   * @example Info.months('numeric')[0] //=> '1'
+   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+   * @return {Array}
+   */
+  static months(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null, outputCalendar = "gregory" } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+  }
+
+  /**
+   * Return an array of format month names.
+   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+   * changes the string.
+   * See {@link Info#months}
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @return {Array}
+   */
+  static monthsFormat(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null, outputCalendar = "gregory" } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+  }
+
+  /**
+   * Return an array of standalone week names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @example Info.weekdays()[0] //=> 'Monday'
+   * @example Info.weekdays('short')[0] //=> 'Mon'
+   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+   * @return {Array}
+   */
+  static weekdays(length = "long", { locale = null, numberingSystem = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+  }
+
+  /**
+   * Return an array of format week names.
+   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+   * changes the string.
+   * See {@link Info#weekdays}
+   * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale=null] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @return {Array}
+   */
+  static weekdaysFormat(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+  }
+
+  /**
+   * Return an array of meridiems.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+   * @return {Array}
+   */
+  static meridiems({ locale = null } = {}) {
+    return Locale.create(locale).meridiems();
+  }
+
+  /**
+   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+   * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.eras() //=> [ 'BC', 'AD' ]
+   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+   * @return {Array}
+   */
+  static eras(length = "short", { locale = null } = {}) {
+    return Locale.create(locale, null, "gregory").eras(length);
+  }
+
+  /**
+   * Return the set of available features in this environment.
+   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+   * Keys:
+   * * `relative`: whether this environment supports relative time formatting
+   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+   * @example Info.features() //=> { relative: false, localeWeek: true }
+   * @return {Object}
+   */
+  static features() {
+    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };
+  }
+}
+
+function dayDiff(earlier, later) {
+  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf("day").valueOf(),
+    ms = utcDayStart(later) - utcDayStart(earlier);
+  return Math.floor(Duration.fromMillis(ms).as("days"));
+}
+
+function highOrderDiffs(cursor, later, units) {
+  const differs = [
+    ["years", (a, b) => b.year - a.year],
+    ["quarters", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],
+    ["months", (a, b) => b.month - a.month + (b.year - a.year) * 12],
+    [
+      "weeks",
+      (a, b) => {
+        const days = dayDiff(a, b);
+        return (days - (days % 7)) / 7;
+      },
+    ],
+    ["days", dayDiff],
+  ];
+
+  const results = {};
+  const earlier = cursor;
+  let lowestOrder, highWater;
+
+  /* This loop tries to diff using larger units first.
+     If we overshoot, we backtrack and try the next smaller unit.
+     "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+     as we use smaller and smaller units.
+     highWater keeps track of where we would be if we added one more of the smallest unit,
+     this is used later to potentially convert any difference smaller than the smallest higher order unit
+     into a fraction of that smallest higher order unit
+  */
+  for (const [unit, differ] of differs) {
+    if (units.indexOf(unit) >= 0) {
+      lowestOrder = unit;
+
+      results[unit] = differ(cursor, later);
+      highWater = earlier.plus(results);
+
+      if (highWater > later) {
+        // we overshot the end point, backtrack cursor by 1
+        results[unit]--;
+        cursor = earlier.plus(results);
+
+        // if we are still overshooting now, we need to backtrack again
+        // this happens in certain situations when diffing times in different zones,
+        // because this calculation ignores time zones
+        if (cursor > later) {
+          // keep the "overshot by 1" around as highWater
+          highWater = cursor;
+          // backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+        }
+      } else {
+        cursor = highWater;
+      }
+    }
+  }
+
+  return [cursor, results, highWater, lowestOrder];
+}
+
+function diff (earlier, later, units, opts) {
+  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);
+
+  const remainingMillis = later - cursor;
+
+  const lowerOrderUnits = units.filter(
+    (u) => ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0
+  );
+
+  if (lowerOrderUnits.length === 0) {
+    if (highWater < later) {
+      highWater = cursor.plus({ [lowestOrder]: 1 });
+    }
+
+    if (highWater !== cursor) {
+      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+    }
+  }
+
+  const duration = Duration.fromObject(results, opts);
+
+  if (lowerOrderUnits.length > 0) {
+    return Duration.fromMillis(remainingMillis, opts)
+      .shiftTo(...lowerOrderUnits)
+      .plus(duration);
+  } else {
+    return duration;
+  }
+}
+
+const MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+
+function intUnit(regex, post = (i) => i) {
+  return { regex, deser: ([s]) => post(parseDigits(s)) };
+}
+
+const NBSP = String.fromCharCode(160);
+const spaceOrNBSP = `[ ${NBSP}]`;
+const spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+
+function fixListRegex(s) {
+  // make dots optional and also make them literal
+  // make space and non breakable space characters interchangeable
+  return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+}
+
+function stripInsensitivities(s) {
+  return s
+    .replace(/\./g, "") // ignore dots that were made optional
+    .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+    .toLowerCase();
+}
+
+function oneOf(strings, startIndex) {
+  if (strings === null) {
+    return null;
+  } else {
+    return {
+      regex: RegExp(strings.map(fixListRegex).join("|")),
+      deser: ([s]) =>
+        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,
+    };
+  }
+}
+
+function offset(regex, groups) {
+  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };
+}
+
+function simple(regex) {
+  return { regex, deser: ([s]) => s };
+}
+
+function escapeToken(value) {
+  return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+}
+
+/**
+ * @param token
+ * @param {Locale} loc
+ */
+function unitForToken(token, loc) {
+  const one = digitRegex(loc),
+    two = digitRegex(loc, "{2}"),
+    three = digitRegex(loc, "{3}"),
+    four = digitRegex(loc, "{4}"),
+    six = digitRegex(loc, "{6}"),
+    oneOrTwo = digitRegex(loc, "{1,2}"),
+    oneToThree = digitRegex(loc, "{1,3}"),
+    oneToSix = digitRegex(loc, "{1,6}"),
+    oneToNine = digitRegex(loc, "{1,9}"),
+    twoToFour = digitRegex(loc, "{2,4}"),
+    fourToSix = digitRegex(loc, "{4,6}"),
+    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),
+    unitate = (t) => {
+      if (token.literal) {
+        return literal(t);
+      }
+      switch (t.val) {
+        // era
+        case "G":
+          return oneOf(loc.eras("short"), 0);
+        case "GG":
+          return oneOf(loc.eras("long"), 0);
+        // years
+        case "y":
+          return intUnit(oneToSix);
+        case "yy":
+          return intUnit(twoToFour, untruncateYear);
+        case "yyyy":
+          return intUnit(four);
+        case "yyyyy":
+          return intUnit(fourToSix);
+        case "yyyyyy":
+          return intUnit(six);
+        // months
+        case "M":
+          return intUnit(oneOrTwo);
+        case "MM":
+          return intUnit(two);
+        case "MMM":
+          return oneOf(loc.months("short", true), 1);
+        case "MMMM":
+          return oneOf(loc.months("long", true), 1);
+        case "L":
+          return intUnit(oneOrTwo);
+        case "LL":
+          return intUnit(two);
+        case "LLL":
+          return oneOf(loc.months("short", false), 1);
+        case "LLLL":
+          return oneOf(loc.months("long", false), 1);
+        // dates
+        case "d":
+          return intUnit(oneOrTwo);
+        case "dd":
+          return intUnit(two);
+        // ordinals
+        case "o":
+          return intUnit(oneToThree);
+        case "ooo":
+          return intUnit(three);
+        // time
+        case "HH":
+          return intUnit(two);
+        case "H":
+          return intUnit(oneOrTwo);
+        case "hh":
+          return intUnit(two);
+        case "h":
+          return intUnit(oneOrTwo);
+        case "mm":
+          return intUnit(two);
+        case "m":
+          return intUnit(oneOrTwo);
+        case "q":
+          return intUnit(oneOrTwo);
+        case "qq":
+          return intUnit(two);
+        case "s":
+          return intUnit(oneOrTwo);
+        case "ss":
+          return intUnit(two);
+        case "S":
+          return intUnit(oneToThree);
+        case "SSS":
+          return intUnit(three);
+        case "u":
+          return simple(oneToNine);
+        case "uu":
+          return simple(oneOrTwo);
+        case "uuu":
+          return intUnit(one);
+        // meridiem
+        case "a":
+          return oneOf(loc.meridiems(), 0);
+        // weekYear (k)
+        case "kkkk":
+          return intUnit(four);
+        case "kk":
+          return intUnit(twoToFour, untruncateYear);
+        // weekNumber (W)
+        case "W":
+          return intUnit(oneOrTwo);
+        case "WW":
+          return intUnit(two);
+        // weekdays
+        case "E":
+        case "c":
+          return intUnit(one);
+        case "EEE":
+          return oneOf(loc.weekdays("short", false), 1);
+        case "EEEE":
+          return oneOf(loc.weekdays("long", false), 1);
+        case "ccc":
+          return oneOf(loc.weekdays("short", true), 1);
+        case "cccc":
+          return oneOf(loc.weekdays("long", true), 1);
+        // offset/zone
+        case "Z":
+        case "ZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);
+        case "ZZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);
+        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+        // because we don't have any way to figure out what they are
+        case "z":
+          return simple(/[a-z_+-/]{1,256}?/i);
+        // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+        // in this case we accept any non-newline white-space
+        case " ":
+          return simple(/[^\S\n\r]/);
+        default:
+          return literal(t);
+      }
+    };
+
+  const unit = unitate(token) || {
+    invalidReason: MISSING_FTP,
+  };
+
+  unit.token = token;
+
+  return unit;
+}
+
+const partTypeStyleToTokenVal = {
+  year: {
+    "2-digit": "yy",
+    numeric: "yyyyy",
+  },
+  month: {
+    numeric: "M",
+    "2-digit": "MM",
+    short: "MMM",
+    long: "MMMM",
+  },
+  day: {
+    numeric: "d",
+    "2-digit": "dd",
+  },
+  weekday: {
+    short: "EEE",
+    long: "EEEE",
+  },
+  dayperiod: "a",
+  dayPeriod: "a",
+  hour12: {
+    numeric: "h",
+    "2-digit": "hh",
+  },
+  hour24: {
+    numeric: "H",
+    "2-digit": "HH",
+  },
+  minute: {
+    numeric: "m",
+    "2-digit": "mm",
+  },
+  second: {
+    numeric: "s",
+    "2-digit": "ss",
+  },
+  timeZoneName: {
+    long: "ZZZZZ",
+    short: "ZZZ",
+  },
+};
+
+function tokenForPart(part, formatOpts, resolvedOpts) {
+  const { type, value } = part;
+
+  if (type === "literal") {
+    const isSpace = /^\s+$/.test(value);
+    return {
+      literal: !isSpace,
+      val: isSpace ? " " : value,
+    };
+  }
+
+  const style = formatOpts[type];
+
+  // The user might have explicitly specified hour12 or hourCycle
+  // if so, respect their decision
+  // if not, refer back to the resolvedOpts, which are based on the locale
+  let actualType = type;
+  if (type === "hour") {
+    if (formatOpts.hour12 != null) {
+      actualType = formatOpts.hour12 ? "hour12" : "hour24";
+    } else if (formatOpts.hourCycle != null) {
+      if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+        actualType = "hour12";
+      } else {
+        actualType = "hour24";
+      }
+    } else {
+      // tokens only differentiate between 24 hours or not,
+      // so we do not need to check hourCycle here, which is less supported anyways
+      actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+    }
+  }
+  let val = partTypeStyleToTokenVal[actualType];
+  if (typeof val === "object") {
+    val = val[style];
+  }
+
+  if (val) {
+    return {
+      literal: false,
+      val,
+    };
+  }
+
+  return undefined;
+}
+
+function buildRegex(units) {
+  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, "");
+  return [`^${re}$`, units];
+}
+
+function match(input, regex, handlers) {
+  const matches = input.match(regex);
+
+  if (matches) {
+    const all = {};
+    let matchIndex = 1;
+    for (const i in handlers) {
+      if (hasOwnProperty(handlers, i)) {
+        const h = handlers[i],
+          groups = h.groups ? h.groups + 1 : 1;
+        if (!h.literal && h.token) {
+          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+        }
+        matchIndex += groups;
+      }
+    }
+    return [matches, all];
+  } else {
+    return [matches, {}];
+  }
+}
+
+function dateTimeFromMatches(matches) {
+  const toField = (token) => {
+    switch (token) {
+      case "S":
+        return "millisecond";
+      case "s":
+        return "second";
+      case "m":
+        return "minute";
+      case "h":
+      case "H":
+        return "hour";
+      case "d":
+        return "day";
+      case "o":
+        return "ordinal";
+      case "L":
+      case "M":
+        return "month";
+      case "y":
+        return "year";
+      case "E":
+      case "c":
+        return "weekday";
+      case "W":
+        return "weekNumber";
+      case "k":
+        return "weekYear";
+      case "q":
+        return "quarter";
+      default:
+        return null;
+    }
+  };
+
+  let zone = null;
+  let specificOffset;
+  if (!isUndefined(matches.z)) {
+    zone = IANAZone.create(matches.z);
+  }
+
+  if (!isUndefined(matches.Z)) {
+    if (!zone) {
+      zone = new FixedOffsetZone(matches.Z);
+    }
+    specificOffset = matches.Z;
+  }
+
+  if (!isUndefined(matches.q)) {
+    matches.M = (matches.q - 1) * 3 + 1;
+  }
+
+  if (!isUndefined(matches.h)) {
+    if (matches.h < 12 && matches.a === 1) {
+      matches.h += 12;
+    } else if (matches.h === 12 && matches.a === 0) {
+      matches.h = 0;
+    }
+  }
+
+  if (matches.G === 0 && matches.y) {
+    matches.y = -matches.y;
+  }
+
+  if (!isUndefined(matches.u)) {
+    matches.S = parseMillis(matches.u);
+  }
+
+  const vals = Object.keys(matches).reduce((r, k) => {
+    const f = toField(k);
+    if (f) {
+      r[f] = matches[k];
+    }
+
+    return r;
+  }, {});
+
+  return [vals, zone, specificOffset];
+}
+
+let dummyDateTimeCache = null;
+
+function getDummyDateTime() {
+  if (!dummyDateTimeCache) {
+    dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+  }
+
+  return dummyDateTimeCache;
+}
+
+function maybeExpandMacroToken(token, locale) {
+  if (token.literal) {
+    return token;
+  }
+
+  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+  const tokens = formatOptsToTokens(formatOpts, locale);
+
+  if (tokens == null || tokens.includes(undefined)) {
+    return token;
+  }
+
+  return tokens;
+}
+
+function expandMacroTokens(tokens, locale) {
+  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));
+}
+
+/**
+ * @private
+ */
+
+class TokenParser {
+  constructor(locale, format) {
+    this.locale = locale;
+    this.format = format;
+    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+    this.units = this.tokens.map((t) => unitForToken(t, locale));
+    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);
+
+    if (!this.disqualifyingUnit) {
+      const [regexString, handlers] = buildRegex(this.units);
+      this.regex = RegExp(regexString, "i");
+      this.handlers = handlers;
+    }
+  }
+
+  explainFromTokens(input) {
+    if (!this.isValid) {
+      return { input, tokens: this.tokens, invalidReason: this.invalidReason };
+    } else {
+      const [rawMatches, matches] = match(input, this.regex, this.handlers),
+        [result, zone, specificOffset] = matches
+          ? dateTimeFromMatches(matches)
+          : [null, null, undefined];
+      if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+        throw new ConflictingSpecificationError(
+          "Can't include meridiem when specifying 24-hour format"
+        );
+      }
+      return {
+        input,
+        tokens: this.tokens,
+        regex: this.regex,
+        rawMatches,
+        matches,
+        result,
+        zone,
+        specificOffset,
+      };
+    }
+  }
+
+  get isValid() {
+    return !this.disqualifyingUnit;
+  }
+
+  get invalidReason() {
+    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+  }
+}
+
+function explainFromTokens(locale, input, format) {
+  const parser = new TokenParser(locale, format);
+  return parser.explainFromTokens(input);
+}
+
+function parseFromTokens(locale, input, format) {
+  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);
+  return [result, zone, specificOffset, invalidReason];
+}
+
+function formatOptsToTokens(formatOpts, locale) {
+  if (!formatOpts) {
+    return null;
+  }
+
+  const formatter = Formatter.create(locale, formatOpts);
+  const df = formatter.dtFormatter(getDummyDateTime());
+  const parts = df.formatToParts();
+  const resolvedOpts = df.resolvedOptions();
+  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));
+}
+
+const INVALID = "Invalid DateTime";
+const MAX_DATE = 8.64e15;
+
+function unsupportedZone(zone) {
+  return new Invalid("unsupported zone", `the zone "${zone.name}" is not supported`);
+}
+
+// we cache week data on the DT object and this intermediates the cache
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedWeekData(dt) {
+  if (dt.weekData === null) {
+    dt.weekData = gregorianToWeek(dt.c);
+  }
+  return dt.weekData;
+}
+
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedLocalWeekData(dt) {
+  if (dt.localWeekData === null) {
+    dt.localWeekData = gregorianToWeek(
+      dt.c,
+      dt.loc.getMinDaysInFirstWeek(),
+      dt.loc.getStartOfWeek()
+    );
+  }
+  return dt.localWeekData;
+}
+
+// clone really means, "make a new object with these modifications". all "setters" really use this
+// to create a new object while only changing some of the properties
+function clone(inst, alts) {
+  const current = {
+    ts: inst.ts,
+    zone: inst.zone,
+    c: inst.c,
+    o: inst.o,
+    loc: inst.loc,
+    invalid: inst.invalid,
+  };
+  return new DateTime({ ...current, ...alts, old: current });
+}
+
+// find the right offset a given local time. The o input is our guess, which determines which
+// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+function fixOffset(localTS, o, tz) {
+  // Our UTC time is just a guess because our offset is just a guess
+  let utcGuess = localTS - o * 60 * 1000;
+
+  // Test whether the zone matches the offset for this ts
+  const o2 = tz.offset(utcGuess);
+
+  // If so, offset didn't change and we're done
+  if (o === o2) {
+    return [utcGuess, o];
+  }
+
+  // If not, change the ts by the difference in the offset
+  utcGuess -= (o2 - o) * 60 * 1000;
+
+  // If that gives us the local time we want, we're done
+  const o3 = tz.offset(utcGuess);
+  if (o2 === o3) {
+    return [utcGuess, o2];
+  }
+
+  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+}
+
+// convert an epoch timestamp into a calendar object with the given offset
+function tsToObj(ts, offset) {
+  ts += offset * 60 * 1000;
+
+  const d = new Date(ts);
+
+  return {
+    year: d.getUTCFullYear(),
+    month: d.getUTCMonth() + 1,
+    day: d.getUTCDate(),
+    hour: d.getUTCHours(),
+    minute: d.getUTCMinutes(),
+    second: d.getUTCSeconds(),
+    millisecond: d.getUTCMilliseconds(),
+  };
+}
+
+// convert a calendar object to a epoch timestamp
+function objToTS(obj, offset, zone) {
+  return fixOffset(objToLocalTS(obj), offset, zone);
+}
+
+// create a new DT instance by adding a duration, adjusting for DSTs
+function adjustTime(inst, dur) {
+  const oPre = inst.o,
+    year = inst.c.year + Math.trunc(dur.years),
+    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+    c = {
+      ...inst.c,
+      year,
+      month,
+      day:
+        Math.min(inst.c.day, daysInMonth(year, month)) +
+        Math.trunc(dur.days) +
+        Math.trunc(dur.weeks) * 7,
+    },
+    millisToAdd = Duration.fromObject({
+      years: dur.years - Math.trunc(dur.years),
+      quarters: dur.quarters - Math.trunc(dur.quarters),
+      months: dur.months - Math.trunc(dur.months),
+      weeks: dur.weeks - Math.trunc(dur.weeks),
+      days: dur.days - Math.trunc(dur.days),
+      hours: dur.hours,
+      minutes: dur.minutes,
+      seconds: dur.seconds,
+      milliseconds: dur.milliseconds,
+    }).as("milliseconds"),
+    localTS = objToLocalTS(c);
+
+  let [ts, o] = fixOffset(localTS, oPre, inst.zone);
+
+  if (millisToAdd !== 0) {
+    ts += millisToAdd;
+    // that could have changed the offset by going over a DST, but we want to keep the ts the same
+    o = inst.zone.offset(ts);
+  }
+
+  return { ts, o };
+}
+
+// helper useful in turning the results of parsing into real dates
+// by handling the zone options
+function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+  const { setZone, zone } = opts;
+  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {
+    const interpretationZone = parsedZone || zone,
+      inst = DateTime.fromObject(parsed, {
+        ...opts,
+        zone: interpretationZone,
+        specificOffset,
+      });
+    return setZone ? inst : inst.setZone(zone);
+  } else {
+    return DateTime.invalid(
+      new Invalid("unparsable", `the input "${text}" can't be parsed as ${format}`)
+    );
+  }
+}
+
+// if you want to output a technical format (e.g. RFC 2822), this helper
+// helps handle the details
+function toTechFormat(dt, format, allowZ = true) {
+  return dt.isValid
+    ? Formatter.create(Locale.create("en-US"), {
+        allowZ,
+        forceSimple: true,
+      }).formatDateTimeFromString(dt, format)
+    : null;
+}
+
+function toISODate(o, extended, precision) {
+  const longFormat = o.c.year > 9999 || o.c.year < 0;
+  let c = "";
+  if (longFormat && o.c.year >= 0) c += "+";
+  c += padStart(o.c.year, longFormat ? 6 : 4);
+  if (precision === "year") return c;
+  if (extended) {
+    c += "-";
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+    c += "-";
+  } else {
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+  }
+  c += padStart(o.c.day);
+  return c;
+}
+
+function toISOTime(
+  o,
+  extended,
+  suppressSeconds,
+  suppressMilliseconds,
+  includeOffset,
+  extendedZone,
+  precision
+) {
+  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+    c = "";
+  switch (precision) {
+    case "day":
+    case "month":
+    case "year":
+      break;
+    default:
+      c += padStart(o.c.hour);
+      if (precision === "hour") break;
+      if (extended) {
+        c += ":";
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += ":";
+          c += padStart(o.c.second);
+        }
+      } else {
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += padStart(o.c.second);
+        }
+      }
+      if (precision === "second") break;
+      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+        c += ".";
+        c += padStart(o.c.millisecond, 3);
+      }
+  }
+
+  if (includeOffset) {
+    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+      c += "Z";
+    } else if (o.o < 0) {
+      c += "-";
+      c += padStart(Math.trunc(-o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(-o.o % 60));
+    } else {
+      c += "+";
+      c += padStart(Math.trunc(o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(o.o % 60));
+    }
+  }
+
+  if (extendedZone) {
+    c += "[" + o.zone.ianaName + "]";
+  }
+  return c;
+}
+
+// defaults for unspecified units in the supported calendars
+const defaultUnitValues = {
+    month: 1,
+    day: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  },
+  defaultWeekUnitValues = {
+    weekNumber: 1,
+    weekday: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  },
+  defaultOrdinalUnitValues = {
+    ordinal: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  };
+
+// Units in the supported calendars, sorted by bigness
+const orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+  orderedWeekUnits = [
+    "weekYear",
+    "weekNumber",
+    "weekday",
+    "hour",
+    "minute",
+    "second",
+    "millisecond",
+  ],
+  orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+// standardize case and plurality in units
+function normalizeUnit(unit) {
+  const normalized = {
+    year: "year",
+    years: "year",
+    month: "month",
+    months: "month",
+    day: "day",
+    days: "day",
+    hour: "hour",
+    hours: "hour",
+    minute: "minute",
+    minutes: "minute",
+    quarter: "quarter",
+    quarters: "quarter",
+    second: "second",
+    seconds: "second",
+    millisecond: "millisecond",
+    milliseconds: "millisecond",
+    weekday: "weekday",
+    weekdays: "weekday",
+    weeknumber: "weekNumber",
+    weeksnumber: "weekNumber",
+    weeknumbers: "weekNumber",
+    weekyear: "weekYear",
+    weekyears: "weekYear",
+    ordinal: "ordinal",
+  }[unit.toLowerCase()];
+
+  if (!normalized) throw new InvalidUnitError(unit);
+
+  return normalized;
+}
+
+function normalizeUnitWithLocalWeeks(unit) {
+  switch (unit.toLowerCase()) {
+    case "localweekday":
+    case "localweekdays":
+      return "localWeekday";
+    case "localweeknumber":
+    case "localweeknumbers":
+      return "localWeekNumber";
+    case "localweekyear":
+    case "localweekyears":
+      return "localWeekYear";
+    default:
+      return normalizeUnit(unit);
+  }
+}
+
+// cache offsets for zones based on the current timestamp when this function is
+// first called. When we are handling a datetime from components like (year,
+// month, day, hour) in a time zone, we need a guess about what the timezone
+// offset is so that we can convert into a UTC timestamp. One way is to find the
+// offset of now in the zone. The actual date may have a different offset (for
+// example, if we handle a date in June while we're in December in a zone that
+// observes DST), but we can check and adjust that.
+//
+// When handling many dates, calculating the offset for now every time is
+// expensive. It's just a guess, so we can cache the offset to use even if we
+// are right on a time change boundary (we'll just correct in the other
+// direction). Using a timestamp from first read is a slight optimization for
+// handling dates close to the current date, since those dates will usually be
+// in the same offset (we could set the timestamp statically, instead). We use a
+// single timestamp for all zones to make things a bit more predictable.
+//
+// This is safe for quickDT (used by local() and utc()) because we don't fill in
+// higher-order units from tsNow (as we do in fromObject, this requires that
+// offset is calculated from tsNow).
+/**
+ * @param {Zone} zone
+ * @return {number}
+ */
+function guessOffsetForZone(zone) {
+  if (zoneOffsetTs === undefined) {
+    zoneOffsetTs = Settings.now();
+  }
+
+  // Do not cache anything but IANA zones, because it is not safe to do so.
+  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+  if (zone.type !== "iana") {
+    return zone.offset(zoneOffsetTs);
+  }
+  const zoneName = zone.name;
+  let offsetGuess = zoneOffsetGuessCache.get(zoneName);
+  if (offsetGuess === undefined) {
+    offsetGuess = zone.offset(zoneOffsetTs);
+    zoneOffsetGuessCache.set(zoneName, offsetGuess);
+  }
+  return offsetGuess;
+}
+
+// this is a dumbed down version of fromObject() that runs about 60% faster
+// but doesn't do any validation, makes a bunch of assumptions about what units
+// are present, and so on.
+function quickDT(obj, opts) {
+  const zone = normalizeZone(opts.zone, Settings.defaultZone);
+  if (!zone.isValid) {
+    return DateTime.invalid(unsupportedZone(zone));
+  }
+
+  const loc = Locale.fromObject(opts);
+
+  let ts, o;
+
+  // assume we have the higher-order units
+  if (!isUndefined(obj.year)) {
+    for (const u of orderedUnits) {
+      if (isUndefined(obj[u])) {
+        obj[u] = defaultUnitValues[u];
+      }
+    }
+
+    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    const offsetProvis = guessOffsetForZone(zone);
+    [ts, o] = objToTS(obj, offsetProvis, zone);
+  } else {
+    ts = Settings.now();
+  }
+
+  return new DateTime({ ts, zone, loc, o });
+}
+
+function diffRelative(start, end, opts) {
+  const round = isUndefined(opts.round) ? true : opts.round,
+    rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+    format = (c, unit) => {
+      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+      const formatter = end.loc.clone(opts).relFormatter(opts);
+      return formatter.format(c, unit);
+    },
+    differ = (unit) => {
+      if (opts.calendary) {
+        if (!end.hasSame(start, unit)) {
+          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+        } else return 0;
+      } else {
+        return end.diff(start, unit).get(unit);
+      }
+    };
+
+  if (opts.unit) {
+    return format(differ(opts.unit), opts.unit);
+  }
+
+  for (const unit of opts.units) {
+    const count = differ(unit);
+    if (Math.abs(count) >= 1) {
+      return format(count, unit);
+    }
+  }
+  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+}
+
+function lastOpts(argList) {
+  let opts = {},
+    args;
+  if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+    opts = argList[argList.length - 1];
+    args = Array.from(argList).slice(0, argList.length - 1);
+  } else {
+    args = Array.from(argList);
+  }
+  return [opts, args];
+}
+
+/**
+ * Timestamp to use for cached zone offset guesses (exposed for test)
+ */
+let zoneOffsetTs;
+/**
+ * Cache for zone offset guesses (exposed for test).
+ *
+ * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+ * zone.offset().
+ */
+const zoneOffsetGuessCache = new Map();
+
+/**
+ * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+ *
+ * A DateTime comprises of:
+ * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+ * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+ * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+ *
+ * Here is a brief overview of the most commonly used functionality it provides:
+ *
+ * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+ * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+ * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+ * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+ * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+ * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+ * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+ *
+ * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+ */
+class DateTime {
+  /**
+   * @access private
+   */
+  constructor(config) {
+    const zone = config.zone || Settings.defaultZone;
+
+    let invalid =
+      config.invalid ||
+      (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) ||
+      (!zone.isValid ? unsupportedZone(zone) : null);
+    /**
+     * @access private
+     */
+    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+
+    let c = null,
+      o = null;
+    if (!invalid) {
+      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+
+      if (unchanged) {
+        [c, o] = [config.old.c, config.old.o];
+      } else {
+        // If an offset has been passed and we have not been called from
+        // clone(), we can trust it and avoid the offset calculation.
+        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+        c = tsToObj(this.ts, ot);
+        invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+        c = invalid ? null : c;
+        o = invalid ? null : ot;
+      }
+    }
+
+    /**
+     * @access private
+     */
+    this._zone = zone;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.invalid = invalid;
+    /**
+     * @access private
+     */
+    this.weekData = null;
+    /**
+     * @access private
+     */
+    this.localWeekData = null;
+    /**
+     * @access private
+     */
+    this.c = c;
+    /**
+     * @access private
+     */
+    this.o = o;
+    /**
+     * @access private
+     */
+    this.isLuxonDateTime = true;
+  }
+
+  // CONSTRUCT
+
+  /**
+   * Create a DateTime for the current instant, in the system's time zone.
+   *
+   * Use Settings to override these default values if needed.
+   * @example DateTime.now().toISO() //~> now in the ISO format
+   * @return {DateTime}
+   */
+  static now() {
+    return new DateTime({});
+  }
+
+  /**
+   * Create a local DateTime
+   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month, 1-indexed
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @example DateTime.local()                                  //~> now
+   * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+   * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+   * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+   * @return {DateTime}
+   */
+  static local() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);
+  }
+
+  /**
+   * Create a DateTime in UTC
+   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.utc()                                              //~> now
+   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+   * @return {DateTime}
+   */
+  static utc() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+
+    opts.zone = FixedOffsetZone.utcInstance;
+    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);
+  }
+
+  /**
+   * Create a DateTime from a JavaScript Date object. Uses the default zone.
+   * @param {Date} date - a JavaScript Date object
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @return {DateTime}
+   */
+  static fromJSDate(date, options = {}) {
+    const ts = isDate(date) ? date.valueOf() : NaN;
+    if (Number.isNaN(ts)) {
+      return DateTime.invalid("invalid input");
+    }
+
+    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+
+    return new DateTime({
+      ts: ts,
+      zone: zoneToUse,
+      loc: Locale.fromObject(options),
+    });
+  }
+
+  /**
+   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromMillis(milliseconds, options = {}) {
+    if (!isNumber(milliseconds)) {
+      throw new InvalidArgumentError(
+        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`
+      );
+    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+      return DateTime.invalid("Timestamp out of range");
+    } else {
+      return new DateTime({
+        ts: milliseconds,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options),
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} seconds - a number of seconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromSeconds(seconds, options = {}) {
+    if (!isNumber(seconds)) {
+      throw new InvalidArgumentError("fromSeconds requires a numerical input");
+    } else {
+      return new DateTime({
+        ts: seconds * 1000,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options),
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.year - a year, such as 1987
+   * @param {number} obj.month - a month, 1-12
+   * @param {number} obj.day - a day of the month, 1-31, depending on the month
+   * @param {number} obj.ordinal - day of the year, 1-365 or 366
+   * @param {number} obj.weekYear - an ISO week year
+   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+   * @param {number} obj.localWeekYear - a week year, according to the locale
+   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+   * @param {number} obj.hour - hour of the day, 0-23
+   * @param {number} obj.minute - minute of the hour, 0-59
+   * @param {number} obj.second - second of the minute, 0-59
+   * @param {number} obj.millisecond - millisecond of the second, 0-999
+   * @param {Object} opts - options for creating this DateTime
+   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+   * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+   * @return {DateTime}
+   */
+  static fromObject(obj, opts = {}) {
+    obj = obj || {};
+    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+
+    const loc = Locale.fromObject(opts);
+    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);
+
+    const tsNow = Settings.now(),
+      offsetProvis = !isUndefined(opts.specificOffset)
+        ? opts.specificOffset
+        : zoneToUse.offset(tsNow),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    // cases:
+    // just a weekday -> this week's instance of that weekday, no worries
+    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+    // (gregorian month or day) + ordinal -> error
+    // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError(
+        "Can't mix weekYear/weekNumber units with year/month/day or ordinals"
+      );
+    }
+
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+
+    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);
+
+    // configure ourselves to deal with gregorian dates or week stuff
+    let units,
+      defaultValues,
+      objNow = tsToObj(tsNow, offsetProvis);
+    if (useWeekData) {
+      units = orderedWeekUnits;
+      defaultValues = defaultWeekUnitValues;
+      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+    } else if (containsOrdinal) {
+      units = orderedOrdinalUnits;
+      defaultValues = defaultOrdinalUnitValues;
+      objNow = gregorianToOrdinal(objNow);
+    } else {
+      units = orderedUnits;
+      defaultValues = defaultUnitValues;
+    }
+
+    // set default values for missing stuff
+    let foundFirst = false;
+    for (const u of units) {
+      const v = normalized[u];
+      if (!isUndefined(v)) {
+        foundFirst = true;
+      } else if (foundFirst) {
+        normalized[u] = defaultValues[u];
+      } else {
+        normalized[u] = objNow[u];
+      }
+    }
+
+    // make sure the values we have are in range
+    const higherOrderInvalid = useWeekData
+        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)
+        : containsOrdinal
+        ? hasInvalidOrdinalData(normalized)
+        : hasInvalidGregorianData(normalized),
+      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    // compute the actual time
+    const gregorian = useWeekData
+        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)
+        : containsOrdinal
+        ? ordinalToGregorian(normalized)
+        : normalized,
+      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),
+      inst = new DateTime({
+        ts: tsFinal,
+        zone: zoneToUse,
+        o: offsetFinal,
+        loc,
+      });
+
+    // gregorian data + weekday serves only to validate
+    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+      return DateTime.invalid(
+        "mismatched weekday",
+        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`
+      );
+    }
+
+    if (!inst.isValid) {
+      return DateTime.invalid(inst.invalid);
+    }
+
+    return inst;
+  }
+
+  /**
+   * Create a DateTime from an ISO 8601 string
+   * @param {string} text - the ISO string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+   * @example DateTime.fromISO('2016-W05-4')
+   * @return {DateTime}
+   */
+  static fromISO(text, opts = {}) {
+    const [vals, parsedZone] = parseISODate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+  }
+
+  /**
+   * Create a DateTime from an RFC 2822 string
+   * @param {string} text - the RFC 2822 string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+   * @return {DateTime}
+   */
+  static fromRFC2822(text, opts = {}) {
+    const [vals, parsedZone] = parseRFC2822Date(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+  }
+
+  /**
+   * Create a DateTime from an HTTP header date
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @param {string} text - the HTTP header date
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+   * @return {DateTime}
+   */
+  static fromHTTP(text, opts = {}) {
+    const [vals, parsedZone] = parseHTTPDate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+  }
+
+  /**
+   * Create a DateTime from an input string and format string.
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromFormat(text, fmt, opts = {}) {
+    if (isUndefined(text) || isUndefined(fmt)) {
+      throw new InvalidArgumentError("fromFormat requires an input string and a format");
+    }
+
+    const { locale = null, numberingSystem = null } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      }),
+      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    } else {
+      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);
+    }
+  }
+
+  /**
+   * @deprecated use fromFormat instead
+   */
+  static fromString(text, fmt, opts = {}) {
+    return DateTime.fromFormat(text, fmt, opts);
+  }
+
+  /**
+   * Create a DateTime from a SQL date, time, or datetime
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale
+   * @param {string} text - the string to parse
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @example DateTime.fromSQL('2017-05-15')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+   * @example DateTime.fromSQL('09:12:34.342')
+   * @return {DateTime}
+   */
+  static fromSQL(text, opts = {}) {
+    const [vals, parsedZone] = parseSQL(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+  }
+
+  /**
+   * Create an invalid DateTime.
+   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {DateTime}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDateTimeError(invalid);
+    } else {
+      return new DateTime({ invalid });
+    }
+  }
+
+  /**
+   * Check if an object is an instance of DateTime. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDateTime(o) {
+    return (o && o.isLuxonDateTime) || false;
+  }
+
+  /**
+   * Produce the format string for a set of options
+   * @param formatOpts
+   * @param localeOpts
+   * @returns {string}
+   */
+  static parseFormatForOpts(formatOpts, localeOpts = {}) {
+    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join("");
+  }
+
+  /**
+   * Produce the the fully expanded format token for the locale
+   * Does NOT quote characters, so quoted tokens will not round trip correctly
+   * @param fmt
+   * @param localeOpts
+   * @returns {string}
+   */
+  static expandFormat(fmt, localeOpts = {}) {
+    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+    return expanded.map((t) => t.val).join("");
+  }
+
+  static resetCache() {
+    zoneOffsetTs = undefined;
+    zoneOffsetGuessCache.clear();
+  }
+
+  // INFO
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+   * @return {number}
+   */
+  get(unit) {
+    return this[unit];
+  }
+
+  /**
+   * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+   * * The DateTime was created by an operation on another invalid date
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get outputCalendar() {
+    return this.isValid ? this.loc.outputCalendar : null;
+  }
+
+  /**
+   * Get the time zone associated with this DateTime.
+   * @type {Zone}
+   */
+  get zone() {
+    return this._zone;
+  }
+
+  /**
+   * Get the name of the time zone.
+   * @type {string}
+   */
+  get zoneName() {
+    return this.isValid ? this.zone.name : null;
+  }
+
+  /**
+   * Get the year
+   * @example DateTime.local(2017, 5, 25).year //=> 2017
+   * @type {number}
+   */
+  get year() {
+    return this.isValid ? this.c.year : NaN;
+  }
+
+  /**
+   * Get the quarter
+   * @example DateTime.local(2017, 5, 25).quarter //=> 2
+   * @type {number}
+   */
+  get quarter() {
+    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+  }
+
+  /**
+   * Get the month (1-12).
+   * @example DateTime.local(2017, 5, 25).month //=> 5
+   * @type {number}
+   */
+  get month() {
+    return this.isValid ? this.c.month : NaN;
+  }
+
+  /**
+   * Get the day of the month (1-30ish).
+   * @example DateTime.local(2017, 5, 25).day //=> 25
+   * @type {number}
+   */
+  get day() {
+    return this.isValid ? this.c.day : NaN;
+  }
+
+  /**
+   * Get the hour of the day (0-23).
+   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+   * @type {number}
+   */
+  get hour() {
+    return this.isValid ? this.c.hour : NaN;
+  }
+
+  /**
+   * Get the minute of the hour (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+   * @type {number}
+   */
+  get minute() {
+    return this.isValid ? this.c.minute : NaN;
+  }
+
+  /**
+   * Get the second of the minute (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+   * @type {number}
+   */
+  get second() {
+    return this.isValid ? this.c.second : NaN;
+  }
+
+  /**
+   * Get the millisecond of the second (0-999).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+   * @type {number}
+   */
+  get millisecond() {
+    return this.isValid ? this.c.millisecond : NaN;
+  }
+
+  /**
+   * Get the week year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+   * @type {number}
+   */
+  get weekYear() {
+    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the week number of the week year (1-52ish).
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+   * @type {number}
+   */
+  get weekNumber() {
+    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the day of the week.
+   * 1 is Monday and 7 is Sunday
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 11, 31).weekday //=> 4
+   * @type {number}
+   */
+  get weekday() {
+    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Returns true if this date is on a weekend according to the locale, false otherwise
+   * @returns {boolean}
+   */
+  get isWeekend() {
+    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+  }
+
+  /**
+   * Get the day of the week according to the locale.
+   * 1 is the first day of the week and 7 is the last day of the week.
+   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+   * @returns {number}
+   */
+  get localWeekday() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+   * because the week can start on different days of the week (see localWeekday) and because a different number of days
+   * is required for a week to count as the first week of a year.
+   * @returns {number}
+   */
+  get localWeekNumber() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+   * differently, see localWeekNumber.
+   * @returns {number}
+   */
+  get localWeekYear() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the ordinal (meaning the day of the year)
+   * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+   * @type {number|DateTime}
+   */
+  get ordinal() {
+    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+  }
+
+  /**
+   * Get the human readable short month name, such as 'Oct'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+   * @type {string}
+   */
+  get monthShort() {
+    return this.isValid ? Info.months("short", { locObj: this.loc })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable long month name, such as 'October'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthLong //=> October
+   * @type {string}
+   */
+  get monthLong() {
+    return this.isValid ? Info.months("long", { locObj: this.loc })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable short weekday, such as 'Mon'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+   * @type {string}
+   */
+  get weekdayShort() {
+    return this.isValid ? Info.weekdays("short", { locObj: this.loc })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the human readable long weekday, such as 'Monday'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+   * @type {string}
+   */
+  get weekdayLong() {
+    return this.isValid ? Info.weekdays("long", { locObj: this.loc })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the UTC offset of this DateTime in minutes
+   * @example DateTime.now().offset //=> -240
+   * @example DateTime.utc().offset //=> 0
+   * @type {number}
+   */
+  get offset() {
+    return this.isValid ? +this.o : NaN;
+  }
+
+  /**
+   * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameShort() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "short",
+        locale: this.locale,
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameLong() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "long",
+        locale: this.locale,
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get whether this zone's offset ever changes, as in a DST.
+   * @type {boolean}
+   */
+  get isOffsetFixed() {
+    return this.isValid ? this.zone.isUniversal : null;
+  }
+
+  /**
+   * Get whether the DateTime is in a DST.
+   * @type {boolean}
+   */
+  get isInDST() {
+    if (this.isOffsetFixed) {
+      return false;
+    } else {
+      return (
+        this.offset > this.set({ month: 1, day: 1 }).offset ||
+        this.offset > this.set({ month: 5 }).offset
+      );
+    }
+  }
+
+  /**
+   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+   * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+   * @returns {DateTime[]}
+   */
+  getPossibleOffsets() {
+    if (!this.isValid || this.isOffsetFixed) {
+      return [this];
+    }
+    const dayMs = 86400000;
+    const minuteMs = 60000;
+    const localTS = objToLocalTS(this.c);
+    const oEarlier = this.zone.offset(localTS - dayMs);
+    const oLater = this.zone.offset(localTS + dayMs);
+
+    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+    const o2 = this.zone.offset(localTS - oLater * minuteMs);
+    if (o1 === o2) {
+      return [this];
+    }
+    const ts1 = localTS - o1 * minuteMs;
+    const ts2 = localTS - o2 * minuteMs;
+    const c1 = tsToObj(ts1, o1);
+    const c2 = tsToObj(ts2, o2);
+    if (
+      c1.hour === c2.hour &&
+      c1.minute === c2.minute &&
+      c1.second === c2.second &&
+      c1.millisecond === c2.millisecond
+    ) {
+      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];
+    }
+    return [this];
+  }
+
+  /**
+   * Returns true if this DateTime is in a leap year, false otherwise
+   * @example DateTime.local(2016).isInLeapYear //=> true
+   * @example DateTime.local(2013).isInLeapYear //=> false
+   * @type {boolean}
+   */
+  get isInLeapYear() {
+    return isLeapYear(this.year);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's month
+   * @example DateTime.local(2016, 2).daysInMonth //=> 29
+   * @example DateTime.local(2016, 3).daysInMonth //=> 31
+   * @type {number}
+   */
+  get daysInMonth() {
+    return daysInMonth(this.year, this.month);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's year
+   * @example DateTime.local(2016).daysInYear //=> 366
+   * @example DateTime.local(2013).daysInYear //=> 365
+   * @type {number}
+   */
+  get daysInYear() {
+    return this.isValid ? daysInYear(this.year) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2004).weeksInWeekYear //=> 53
+   * @example DateTime.local(2013).weeksInWeekYear //=> 52
+   * @type {number}
+   */
+  get weeksInWeekYear() {
+    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's local week year
+   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+   * @type {number}
+   */
+  get weeksInLocalWeekYear() {
+    return this.isValid
+      ? weeksInWeekYear(
+          this.localWeekYear,
+          this.loc.getMinDaysInFirstWeek(),
+          this.loc.getStartOfWeek()
+        )
+      : NaN;
+  }
+
+  /**
+   * Returns the resolved Intl options for this DateTime.
+   * This is useful in understanding the behavior of formatting methods
+   * @param {Object} opts - the same options as toLocaleString
+   * @return {Object}
+   */
+  resolvedLocaleOptions(opts = {}) {
+    const { locale, numberingSystem, calendar } = Formatter.create(
+      this.loc.clone(opts),
+      opts
+    ).resolvedOptions(this);
+    return { locale, numberingSystem, outputCalendar: calendar };
+  }
+
+  // TRANSFORM
+
+  /**
+   * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to {@link DateTime#setZone}('utc')
+   * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+   * @param {Object} [opts={}] - options to pass to `setZone()`
+   * @return {DateTime}
+   */
+  toUTC(offset = 0, opts = {}) {
+    return this.setZone(FixedOffsetZone.instance(offset), opts);
+  }
+
+  /**
+   * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to `setZone('local')`
+   * @return {DateTime}
+   */
+  toLocal() {
+    return this.setZone(Settings.defaultZone);
+  }
+
+  /**
+   * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+   *
+   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+   * @return {DateTime}
+   */
+  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {
+    zone = normalizeZone(zone, Settings.defaultZone);
+    if (zone.equals(this.zone)) {
+      return this;
+    } else if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    } else {
+      let newTS = this.ts;
+      if (keepLocalTime || keepCalendarTime) {
+        const offsetGuess = zone.offset(this.ts);
+        const asObj = this.toObject();
+        [newTS] = objToTS(asObj, offsetGuess, zone);
+      }
+      return clone(this, { ts: newTS, zone });
+    }
+  }
+
+  /**
+   * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+   * @param {Object} properties - the properties to set
+   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+   * @return {DateTime}
+   */
+  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {
+    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });
+    return clone(this, { loc });
+  }
+
+  /**
+   * "Set" the locale. Returns a newly-constructed DateTime.
+   * Just a convenient alias for reconfigure({ locale })
+   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+   * @return {DateTime}
+   */
+  setLocale(locale) {
+    return this.reconfigure({ locale });
+  }
+
+  /**
+   * "Set" the values of specified units. Returns a newly-constructed DateTime.
+   * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+   *
+   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+   * They cannot be mixed with ISO-week units like `weekday`.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dt.set({ year: 2017 })
+   * @example dt.set({ hour: 8, minute: 30 })
+   * @example dt.set({ weekday: 5 })
+   * @example dt.set({ year: 2005, ordinal: 234 })
+   * @return {DateTime}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+
+    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);
+
+    const settingWeekStuff =
+        !isUndefined(normalized.weekYear) ||
+        !isUndefined(normalized.weekNumber) ||
+        !isUndefined(normalized.weekday),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError(
+        "Can't mix weekYear/weekNumber units with year/month/day or ordinals"
+      );
+    }
+
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+
+    let mixed;
+    if (settingWeekStuff) {
+      mixed = weekToGregorian(
+        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },
+        minDaysInFirstWeek,
+        startOfWeek
+      );
+    } else if (!isUndefined(normalized.ordinal)) {
+      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });
+    } else {
+      mixed = { ...this.toObject(), ...normalized };
+
+      // if we didn't set the day but we ended up on an overflow date,
+      // use the last day of the right month
+      if (isUndefined(normalized.day)) {
+        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+      }
+    }
+
+    const [ts, o] = objToTS(mixed, this.o, this.zone);
+    return clone(this, { ts, o });
+  }
+
+  /**
+   * Add a period of time to this DateTime and return the resulting DateTime
+   *
+   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @example DateTime.now().plus(123) //~> in 123 milliseconds
+   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+   * @return {DateTime}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration);
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * Subtract a period of time to this DateTime and return the resulting DateTime
+   * See {@link DateTime#plus}
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   @return {DateTime}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration).negate();
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * "Set" this DateTime to the beginning of a unit of time.
+   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+   * @return {DateTime}
+   */
+  startOf(unit, { useLocaleWeeks = false } = {}) {
+    if (!this.isValid) return this;
+
+    const o = {},
+      normalizedUnit = Duration.normalizeUnit(unit);
+    switch (normalizedUnit) {
+      case "years":
+        o.month = 1;
+      // falls through
+      case "quarters":
+      case "months":
+        o.day = 1;
+      // falls through
+      case "weeks":
+      case "days":
+        o.hour = 0;
+      // falls through
+      case "hours":
+        o.minute = 0;
+      // falls through
+      case "minutes":
+        o.second = 0;
+      // falls through
+      case "seconds":
+        o.millisecond = 0;
+        break;
+      // no default, invalid units throw in normalizeUnit()
+    }
+
+    if (normalizedUnit === "weeks") {
+      if (useLocaleWeeks) {
+        const startOfWeek = this.loc.getStartOfWeek();
+        const { weekday } = this;
+        if (weekday < startOfWeek) {
+          o.weekNumber = this.weekNumber - 1;
+        }
+        o.weekday = startOfWeek;
+      } else {
+        o.weekday = 1;
+      }
+    }
+
+    if (normalizedUnit === "quarters") {
+      const q = Math.ceil(this.month / 3);
+      o.month = (q - 1) * 3 + 1;
+    }
+
+    return this.set(o);
+  }
+
+  /**
+   * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+   * @return {DateTime}
+   */
+  endOf(unit, opts) {
+    return this.isValid
+      ? this.plus({ [unit]: 1 })
+          .startOf(unit, opts)
+          .minus(1)
+      : this;
+  }
+
+  // OUTPUT
+
+  /**
+   * Returns a string representation of this DateTime formatted according to the specified format string.
+   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)
+      : INVALID;
+  }
+
+  /**
+   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+   * of the DateTime in the assigned locale.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+   * @return {string}
+   */
+  toLocaleString(formatOpts = DATE_SHORT, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)
+      : INVALID;
+  }
+
+  /**
+   * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+   * @example DateTime.now().toLocaleParts(); //=> [
+   *                                   //=>   { type: 'day', value: '25' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'month', value: '05' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'year', value: '1982' }
+   *                                   //=> ]
+   */
+  toLocaleParts(opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)
+      : [];
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+   * @return {string|null}
+   */
+  toISO({
+    format = "extended",
+    suppressSeconds = false,
+    suppressMilliseconds = false,
+    includeOffset = true,
+    extendedZone = false,
+    precision = "milliseconds",
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    precision = normalizeUnit(precision);
+    const ext = format === "extended";
+
+    let c = toISODate(this, ext, precision);
+    if (orderedUnits.indexOf(precision) >= 3) c += "T";
+    c += toISOTime(
+      this,
+      ext,
+      suppressSeconds,
+      suppressMilliseconds,
+      includeOffset,
+      extendedZone,
+      precision
+    );
+    return c;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's date component
+   * @param {Object} opts - options
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+   * @return {string|null}
+   */
+  toISODate({ format = "extended", precision = "day" } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, format === "extended", normalizeUnit(precision));
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's week date
+   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+   * @return {string}
+   */
+  toISOWeekDate() {
+    return toTechFormat(this, "kkkk-'W'WW-c");
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's time component
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+   * @return {string}
+   */
+  toISOTime({
+    suppressMilliseconds = false,
+    suppressSeconds = false,
+    includeOffset = true,
+    includePrefix = false,
+    extendedZone = false,
+    format = "extended",
+    precision = "milliseconds",
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    precision = normalizeUnit(precision);
+    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+    return (
+      c +
+      toISOTime(
+        this,
+        format === "extended",
+        suppressSeconds,
+        suppressMilliseconds,
+        includeOffset,
+        extendedZone,
+        precision
+      )
+    );
+  }
+
+  /**
+   * Returns an RFC 2822-compatible string representation of this DateTime
+   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+   * @return {string}
+   */
+  toRFC2822() {
+    return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+   * Specifically, the string conforms to RFC 1123.
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+   * @return {string}
+   */
+  toHTTP() {
+    return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Date
+   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+   * @return {string|null}
+   */
+  toSQLDate() {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Time
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+   * @return {string}
+   */
+  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {
+    let fmt = "HH:mm:ss.SSS";
+
+    if (includeZone || includeOffset) {
+      if (includeOffsetSpace) {
+        fmt += " ";
+      }
+      if (includeZone) {
+        fmt += "z";
+      } else if (includeOffset) {
+        fmt += "ZZ";
+      }
+    }
+
+    return toTechFormat(this, fmt, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+   * @return {string}
+   */
+  toSQL(opts = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for debugging
+   * @return {string}
+   */
+  toString() {
+    return this.isValid ? this.toISO() : INVALID;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;
+    } else {
+      return `DateTime { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime.
+   * @return {number}
+   */
+  toMillis() {
+    return this.isValid ? this.ts : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+   * @return {number}
+   */
+  toSeconds() {
+    return this.isValid ? this.ts / 1000 : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (as a whole number) of this DateTime.
+   * @return {number}
+   */
+  toUnixInteger() {
+    return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a BSON serializable equivalent to this DateTime.
+   * @return {Date}
+   */
+  toBSON() {
+    return this.toJSDate();
+  }
+
+  /**
+   * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+   * @param opts - options for generating the object
+   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+   * @return {Object}
+   */
+  toObject(opts = {}) {
+    if (!this.isValid) return {};
+
+    const base = { ...this.c };
+
+    if (opts.includeConfig) {
+      base.outputCalendar = this.outputCalendar;
+      base.numberingSystem = this.loc.numberingSystem;
+      base.locale = this.loc.locale;
+    }
+    return base;
+  }
+
+  /**
+   * Returns a JavaScript Date equivalent to this DateTime.
+   * @return {Date}
+   */
+  toJSDate() {
+    return new Date(this.isValid ? this.ts : NaN);
+  }
+
+  // COMPARE
+
+  /**
+   * Return the difference between two DateTimes as a Duration.
+   * @param {DateTime} otherDateTime - the DateTime to compare this one to
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example
+   * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+   *     i2 = DateTime.fromISO('1983-10-14T10:30');
+   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+   * @return {Duration}
+   */
+  diff(otherDateTime, unit = "milliseconds", opts = {}) {
+    if (!this.isValid || !otherDateTime.isValid) {
+      return Duration.invalid("created by diffing an invalid DateTime");
+    }
+
+    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };
+
+    const units = maybeArray(unit).map(Duration.normalizeUnit),
+      otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+      earlier = otherIsLater ? this : otherDateTime,
+      later = otherIsLater ? otherDateTime : this,
+      diffed = diff(earlier, later, units, durOpts);
+
+    return otherIsLater ? diffed.negate() : diffed;
+  }
+
+  /**
+   * Return the difference between this DateTime and right now.
+   * See {@link DateTime#diff}
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  diffNow(unit = "milliseconds", opts = {}) {
+    return this.diff(DateTime.now(), unit, opts);
+  }
+
+  /**
+   * Return an Interval spanning between this DateTime and another DateTime
+   * @param {DateTime} otherDateTime - the other end point of the Interval
+   * @return {Interval|DateTime}
+   */
+  until(otherDateTime) {
+    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+  }
+
+  /**
+   * Return whether this DateTime is in the same unit of time as another DateTime.
+   * Higher-order units must also be identical for this function to return `true`.
+   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+   * @param {DateTime} otherDateTime - the other DateTime
+   * @param {string} unit - the unit of time to check sameness on
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+   * @return {boolean}
+   */
+  hasSame(otherDateTime, unit, opts) {
+    if (!this.isValid) return false;
+
+    const inputMs = otherDateTime.valueOf();
+    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });
+    return (
+      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)
+    );
+  }
+
+  /**
+   * Equality check
+   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+   * To compare just the millisecond values, use `+dt1 === +dt2`.
+   * @param {DateTime} other - the other DateTime
+   * @return {boolean}
+   */
+  equals(other) {
+    return (
+      this.isValid &&
+      other.isValid &&
+      this.valueOf() === other.valueOf() &&
+      this.zone.equals(other.zone) &&
+      this.loc.equals(other.loc)
+    );
+  }
+
+  /**
+   * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+   * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+   * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+   * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+   */
+  toRelative(options = {}) {
+    if (!this.isValid) return null;
+    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),
+      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;
+    let units = ["years", "months", "days", "hours", "minutes", "seconds"];
+    let unit = options.unit;
+    if (Array.isArray(options.unit)) {
+      units = options.unit;
+      unit = undefined;
+    }
+    return diffRelative(base, this.plus(padding), {
+      ...options,
+      numeric: "always",
+      units,
+      unit,
+    });
+  }
+
+  /**
+   * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+   * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+   */
+  toRelativeCalendar(options = {}) {
+    if (!this.isValid) return null;
+
+    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {
+      ...options,
+      numeric: "auto",
+      units: ["years", "months", "days"],
+      calendary: true,
+    });
+  }
+
+  /**
+   * Return the min of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+   * @return {DateTime} the min DateTime, or undefined if called with no argument
+   */
+  static min(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("min requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);
+  }
+
+  /**
+   * Return the max of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+   * @return {DateTime} the max DateTime, or undefined if called with no argument
+   */
+  static max(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("max requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);
+  }
+
+  // MISC
+
+  /**
+   * Explain how a string would be parsed by fromFormat()
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see description)
+   * @param {Object} options - options taken by fromFormat()
+   * @return {Object}
+   */
+  static fromFormatExplain(text, fmt, options = {}) {
+    const { locale = null, numberingSystem = null } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+    return explainFromTokens(localeToUse, text, fmt);
+  }
+
+  /**
+   * @deprecated use fromFormatExplain instead
+   */
+  static fromStringExplain(text, fmt, options = {}) {
+    return DateTime.fromFormatExplain(text, fmt, options);
+  }
+
+  /**
+   * Build a parser for `fmt` using the given locale. This parser can be passed
+   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+   * can be used to optimize cases where many dates need to be parsed in a
+   * specific format.
+   *
+   * @param {String} fmt - the format the string is expected to be in (see
+   * description)
+   * @param {Object} options - options used to set locale and numberingSystem
+   * for parser
+   * @returns {TokenParser} - opaque object to be used
+   */
+  static buildFormatParser(fmt, options = {}) {
+    const { locale = null, numberingSystem = null } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+    return new TokenParser(localeToUse, fmt);
+  }
+
+  /**
+   * Create a DateTime from an input string and format parser.
+   *
+   * The format parser must have been created with the same locale as this call.
+   *
+   * @param {String} text - the string to parse
+   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+   * @param {Object} opts - options taken by fromFormat()
+   * @returns {DateTime}
+   */
+  static fromFormatParser(text, formatParser, opts = {}) {
+    if (isUndefined(text) || isUndefined(formatParser)) {
+      throw new InvalidArgumentError(
+        "fromFormatParser requires an input string and a format parser"
+      );
+    }
+    const { locale = null, numberingSystem = null } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+
+    if (!localeToUse.equals(formatParser.locale)) {
+      throw new InvalidArgumentError(
+        `fromFormatParser called with a locale of ${localeToUse}, ` +
+          `but the format parser was created for ${formatParser.locale}`
+      );
+    }
+
+    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);
+
+    if (invalidReason) {
+      return DateTime.invalid(invalidReason);
+    } else {
+      return parseDataToDateTime(
+        result,
+        zone,
+        opts,
+        `format ${formatParser.format}`,
+        text,
+        specificOffset
+      );
+    }
+  }
+
+  // FORMAT PRESETS
+
+  /**
+   * {@link DateTime#toLocaleString} format like 10/14/1983
+   * @type {Object}
+   */
+  static get DATE_SHORT() {
+    return DATE_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED() {
+    return DATE_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED_WITH_WEEKDAY() {
+    return DATE_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_FULL() {
+    return DATE_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_HUGE() {
+    return DATE_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_SIMPLE() {
+    return TIME_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SECONDS() {
+    return TIME_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SHORT_OFFSET() {
+    return TIME_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_LONG_OFFSET() {
+    return TIME_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_SIMPLE() {
+    return TIME_24_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SECONDS() {
+    return TIME_24_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SHORT_OFFSET() {
+    return TIME_24_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_LONG_OFFSET() {
+    return TIME_24_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT() {
+    return DATETIME_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT_WITH_SECONDS() {
+    return DATETIME_SHORT_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED() {
+    return DATETIME_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_SECONDS() {
+    return DATETIME_MED_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_WEEKDAY() {
+    return DATETIME_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL() {
+    return DATETIME_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL_WITH_SECONDS() {
+    return DATETIME_FULL_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE() {
+    return DATETIME_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE_WITH_SECONDS() {
+    return DATETIME_HUGE_WITH_SECONDS;
+  }
+}
+
+/**
+ * @private
+ */
+function friendlyDateTime(dateTimeish) {
+  if (DateTime.isDateTime(dateTimeish)) {
+    return dateTimeish;
+  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+    return DateTime.fromJSDate(dateTimeish);
+  } else if (dateTimeish && typeof dateTimeish === "object") {
+    return DateTime.fromObject(dateTimeish);
+  } else {
+    throw new InvalidArgumentError(
+      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`
+    );
+  }
+}
+
+const VERSION = "3.7.2";
+
+export { DateTime, Duration, FixedOffsetZone, IANAZone, Info, Interval, InvalidZone, Settings, SystemZone, VERSION, Zone };
+//# sourceMappingURL=luxon.mjs.map
diff --git a/node_modules/luxon/build/es6/luxon.mjs.map b/node_modules/luxon/build/es6/luxon.mjs.map
new file mode 100644
index 0000000..68f1cf7
--- /dev/null
+++ b/node_modules/luxon/build/es6/luxon.mjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"luxon.mjs","sources":["../../src/errors.js","../../src/impl/formats.js","../../src/zone.js","../../src/zones/systemZone.js","../../src/zones/IANAZone.js","../../src/impl/locale.js","../../src/zones/fixedOffsetZone.js","../../src/zones/invalidZone.js","../../src/impl/zoneUtil.js","../../src/impl/digits.js","../../src/settings.js","../../src/impl/invalid.js","../../src/impl/conversions.js","../../src/impl/util.js","../../src/impl/english.js","../../src/impl/formatter.js","../../src/impl/regexParser.js","../../src/duration.js","../../src/interval.js","../../src/info.js","../../src/impl/diff.js","../../src/impl/tokenParser.js","../../src/datetime.js","../../src/luxon.js"],"sourcesContent":["// these aren't really private, but nor are they really useful to document\n\n/**\n * @private\n */\nclass LuxonError extends Error {}\n\n/**\n * @private\n */\nexport class InvalidDateTimeError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid DateTime: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidIntervalError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Interval: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidDurationError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Duration: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class ConflictingSpecificationError extends LuxonError {}\n\n/**\n * @private\n */\nexport class InvalidUnitError extends LuxonError {\n  constructor(unit) {\n    super(`Invalid unit ${unit}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidArgumentError extends LuxonError {}\n\n/**\n * @private\n */\nexport class ZoneIsAbstractError extends LuxonError {\n  constructor() {\n    super(\"Zone is an abstract class\");\n  }\n}\n","/**\n * @private\n */\n\nconst n = \"numeric\",\n  s = \"short\",\n  l = \"long\";\n\nexport const DATE_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n};\n\nexport const DATE_MED = {\n  year: n,\n  month: s,\n  day: n,\n};\n\nexport const DATE_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n};\n\nexport const DATE_FULL = {\n  year: n,\n  month: l,\n  day: n,\n};\n\nexport const DATE_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n};\n\nexport const TIME_SIMPLE = {\n  hour: n,\n  minute: n,\n};\n\nexport const TIME_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const TIME_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const TIME_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n\nexport const TIME_24_SIMPLE = {\n  hour: n,\n  minute: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: s,\n};\n\nexport const TIME_24_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: l,\n};\n\nexport const DATETIME_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_SHORT_WITH_SECONDS = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_MED_WITH_SECONDS = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_FULL = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_FULL_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  timeZoneName: l,\n};\n\nexport const DATETIME_HUGE_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n","import { ZoneIsAbstractError } from \"./errors.js\";\n\n/**\n * @interface\n */\nexport default class Zone {\n  /**\n   * The type of zone\n   * @abstract\n   * @type {string}\n   */\n  get type() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The name of this zone.\n   * @abstract\n   * @type {string}\n   */\n  get name() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The IANA name of this zone.\n   * Defaults to `name` if not overwritten by a subclass.\n   * @abstract\n   * @type {string}\n   */\n  get ianaName() {\n    return this.name;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year.\n   * @abstract\n   * @type {boolean}\n   */\n  get isUniversal() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, opts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @abstract\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @abstract\n   * @type {boolean}\n   */\n  get isValid() {\n    throw new ZoneIsAbstractError();\n  }\n}\n","import { formatOffset, parseZoneInfo } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * Represents the local zone for this JavaScript environment.\n * @implements {Zone}\n */\nexport default class SystemZone extends Zone {\n  /**\n   * Get a singleton instance of the local zone\n   * @return {SystemZone}\n   */\n  static get instance() {\n    if (singleton === null) {\n      singleton = new SystemZone();\n    }\n    return singleton;\n  }\n\n  /** @override **/\n  get type() {\n    return \"system\";\n  }\n\n  /** @override **/\n  get name() {\n    return new Intl.DateTimeFormat().resolvedOptions().timeZone;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale);\n  }\n\n  /** @override **/\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /** @override **/\n  offset(ts) {\n    return -new Date(ts).getTimezoneOffset();\n  }\n\n  /** @override **/\n  equals(otherZone) {\n    return otherZone.type === \"system\";\n  }\n\n  /** @override **/\n  get isValid() {\n    return true;\n  }\n}\n","import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nconst dtfCache = new Map();\nfunction makeDTF(zoneName) {\n  let dtf = dtfCache.get(zoneName);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(\"en-US\", {\n      hour12: false,\n      timeZone: zoneName,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      era: \"short\",\n    });\n    dtfCache.set(zoneName, dtf);\n  }\n  return dtf;\n}\n\nconst typeToPos = {\n  year: 0,\n  month: 1,\n  day: 2,\n  era: 3,\n  hour: 4,\n  minute: 5,\n  second: 6,\n};\n\nfunction hackyOffset(dtf, date) {\n  const formatted = dtf.format(date).replace(/\\u200E/g, \"\"),\n    parsed = /(\\d+)\\/(\\d+)\\/(\\d+) (AD|BC),? (\\d+):(\\d+):(\\d+)/.exec(formatted),\n    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;\n  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];\n}\n\nfunction partsOffset(dtf, date) {\n  const formatted = dtf.formatToParts(date);\n  const filled = [];\n  for (let i = 0; i < formatted.length; i++) {\n    const { type, value } = formatted[i];\n    const pos = typeToPos[type];\n\n    if (type === \"era\") {\n      filled[pos] = value;\n    } else if (!isUndefined(pos)) {\n      filled[pos] = parseInt(value, 10);\n    }\n  }\n  return filled;\n}\n\nconst ianaZoneCache = new Map();\n/**\n * A zone identified by an IANA identifier, like America/New_York\n * @implements {Zone}\n */\nexport default class IANAZone extends Zone {\n  /**\n   * @param {string} name - Zone name\n   * @return {IANAZone}\n   */\n  static create(name) {\n    let zone = ianaZoneCache.get(name);\n    if (zone === undefined) {\n      ianaZoneCache.set(name, (zone = new IANAZone(name)));\n    }\n    return zone;\n  }\n\n  /**\n   * Reset local caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCache() {\n    ianaZoneCache.clear();\n    dtfCache.clear();\n  }\n\n  /**\n   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.\n   * @param {string} s - The string to check validity on\n   * @example IANAZone.isValidSpecifier(\"America/New_York\") //=> true\n   * @example IANAZone.isValidSpecifier(\"Sport~~blorp\") //=> false\n   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.\n   * @return {boolean}\n   */\n  static isValidSpecifier(s) {\n    return this.isValidZone(s);\n  }\n\n  /**\n   * Returns whether the provided string identifies a real zone\n   * @param {string} zone - The string to check\n   * @example IANAZone.isValidZone(\"America/New_York\") //=> true\n   * @example IANAZone.isValidZone(\"Fantasia/Castle\") //=> false\n   * @example IANAZone.isValidZone(\"Sport~~blorp\") //=> false\n   * @return {boolean}\n   */\n  static isValidZone(zone) {\n    if (!zone) {\n      return false;\n    }\n    try {\n      new Intl.DateTimeFormat(\"en-US\", { timeZone: zone }).format();\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  constructor(name) {\n    super();\n    /** @private **/\n    this.zoneName = name;\n    /** @private **/\n    this.valid = IANAZone.isValidZone(name);\n  }\n\n  /**\n   * The type of zone. `iana` for all instances of `IANAZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"iana\";\n  }\n\n  /**\n   * The name of this zone (i.e. the IANA zone name).\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.zoneName;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns false for all IANA zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return false;\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale, this.name);\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    if (!this.valid) return NaN;\n    const date = new Date(ts);\n\n    if (isNaN(date)) return NaN;\n\n    const dtf = makeDTF(this.name);\n    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts\n      ? partsOffset(dtf, date)\n      : hackyOffset(dtf, date);\n\n    if (adOrBc === \"BC\") {\n      year = -Math.abs(year) + 1;\n    }\n\n    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat\n    const adjustedHour = hour === 24 ? 0 : hour;\n\n    const asUTC = objToLocalTS({\n      year,\n      month,\n      day,\n      hour: adjustedHour,\n      minute,\n      second,\n      millisecond: 0,\n    });\n\n    let asTS = +date;\n    const over = asTS % 1000;\n    asTS -= over >= 0 ? over : 1000 + over;\n    return (asUTC - asTS) / (60 * 1000);\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"iana\" && otherZone.name === this.name;\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.valid;\n  }\n}\n","import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from \"./util.js\";\nimport * as English from \"./english.js\";\nimport Settings from \"../settings.js\";\nimport DateTime from \"../datetime.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n// todo - remap caching\n\nlet intlLFCache = {};\nfunction getCachedLF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlLFCache[key];\n  if (!dtf) {\n    dtf = new Intl.ListFormat(locString, opts);\n    intlLFCache[key] = dtf;\n  }\n  return dtf;\n}\n\nconst intlDTCache = new Map();\nfunction getCachedDTF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlDTCache.get(key);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(locString, opts);\n    intlDTCache.set(key, dtf);\n  }\n  return dtf;\n}\n\nconst intlNumCache = new Map();\nfunction getCachedINF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let inf = intlNumCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.NumberFormat(locString, opts);\n    intlNumCache.set(key, inf);\n  }\n  return inf;\n}\n\nconst intlRelCache = new Map();\nfunction getCachedRTF(locString, opts = {}) {\n  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options\n  const key = JSON.stringify([locString, cacheKeyOpts]);\n  let inf = intlRelCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.RelativeTimeFormat(locString, opts);\n    intlRelCache.set(key, inf);\n  }\n  return inf;\n}\n\nlet sysLocaleCache = null;\nfunction systemLocale() {\n  if (sysLocaleCache) {\n    return sysLocaleCache;\n  } else {\n    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;\n    return sysLocaleCache;\n  }\n}\n\nconst intlResolvedOptionsCache = new Map();\nfunction getCachedIntResolvedOptions(locString) {\n  let opts = intlResolvedOptionsCache.get(locString);\n  if (opts === undefined) {\n    opts = new Intl.DateTimeFormat(locString).resolvedOptions();\n    intlResolvedOptionsCache.set(locString, opts);\n  }\n  return opts;\n}\n\nconst weekInfoCache = new Map();\nfunction getCachedWeekInfo(locString) {\n  let data = weekInfoCache.get(locString);\n  if (!data) {\n    const locale = new Intl.Locale(locString);\n    // browsers currently implement this as a property, but spec says it should be a getter function\n    data = \"getWeekInfo\" in locale ? locale.getWeekInfo() : locale.weekInfo;\n    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86\n    if (!(\"minimalDays\" in data)) {\n      data = { ...fallbackWeekSettings, ...data };\n    }\n    weekInfoCache.set(locString, data);\n  }\n  return data;\n}\n\nfunction parseLocaleString(localeStr) {\n  // I really want to avoid writing a BCP 47 parser\n  // see, e.g. https://github.com/wooorm/bcp-47\n  // Instead, we'll do this:\n\n  // a) if the string has no -u extensions, just leave it alone\n  // b) if it does, use Intl to resolve everything\n  // c) if Intl fails, try again without the -u\n\n  // private subtags and unicode subtags have ordering requirements,\n  // and we're not properly parsing this, so just strip out the\n  // private ones if they exist.\n  const xIndex = localeStr.indexOf(\"-x-\");\n  if (xIndex !== -1) {\n    localeStr = localeStr.substring(0, xIndex);\n  }\n\n  const uIndex = localeStr.indexOf(\"-u-\");\n  if (uIndex === -1) {\n    return [localeStr];\n  } else {\n    let options;\n    let selectedStr;\n    try {\n      options = getCachedDTF(localeStr).resolvedOptions();\n      selectedStr = localeStr;\n    } catch (e) {\n      const smaller = localeStr.substring(0, uIndex);\n      options = getCachedDTF(smaller).resolvedOptions();\n      selectedStr = smaller;\n    }\n\n    const { numberingSystem, calendar } = options;\n    return [selectedStr, numberingSystem, calendar];\n  }\n}\n\nfunction intlConfigString(localeStr, numberingSystem, outputCalendar) {\n  if (outputCalendar || numberingSystem) {\n    if (!localeStr.includes(\"-u-\")) {\n      localeStr += \"-u\";\n    }\n\n    if (outputCalendar) {\n      localeStr += `-ca-${outputCalendar}`;\n    }\n\n    if (numberingSystem) {\n      localeStr += `-nu-${numberingSystem}`;\n    }\n    return localeStr;\n  } else {\n    return localeStr;\n  }\n}\n\nfunction mapMonths(f) {\n  const ms = [];\n  for (let i = 1; i <= 12; i++) {\n    const dt = DateTime.utc(2009, i, 1);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction mapWeekdays(f) {\n  const ms = [];\n  for (let i = 1; i <= 7; i++) {\n    const dt = DateTime.utc(2016, 11, 13 + i);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction listStuff(loc, length, englishFn, intlFn) {\n  const mode = loc.listingMode();\n\n  if (mode === \"error\") {\n    return null;\n  } else if (mode === \"en\") {\n    return englishFn(length);\n  } else {\n    return intlFn(length);\n  }\n}\n\nfunction supportsFastNumbers(loc) {\n  if (loc.numberingSystem && loc.numberingSystem !== \"latn\") {\n    return false;\n  } else {\n    return (\n      loc.numberingSystem === \"latn\" ||\n      !loc.locale ||\n      loc.locale.startsWith(\"en\") ||\n      getCachedIntResolvedOptions(loc.locale).numberingSystem === \"latn\"\n    );\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyNumberFormatter {\n  constructor(intl, forceSimple, opts) {\n    this.padTo = opts.padTo || 0;\n    this.floor = opts.floor || false;\n\n    const { padTo, floor, ...otherOpts } = opts;\n\n    if (!forceSimple || Object.keys(otherOpts).length > 0) {\n      const intlOpts = { useGrouping: false, ...opts };\n      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;\n      this.inf = getCachedINF(intl, intlOpts);\n    }\n  }\n\n  format(i) {\n    if (this.inf) {\n      const fixed = this.floor ? Math.floor(i) : i;\n      return this.inf.format(fixed);\n    } else {\n      // to match the browser's numberformatter defaults\n      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);\n      return padStart(fixed, this.padTo);\n    }\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyDateFormatter {\n  constructor(dt, intl, opts) {\n    this.opts = opts;\n    this.originalZone = undefined;\n\n    let z = undefined;\n    if (this.opts.timeZone) {\n      // Don't apply any workarounds if a timeZone is explicitly provided in opts\n      this.dt = dt;\n    } else if (dt.zone.type === \"fixed\") {\n      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.\n      // That is why fixed-offset TZ is set to that unless it is:\n      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.\n      // 2. Unsupported by the browser:\n      //    - some do not support Etc/\n      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata\n      const gmtOffset = -1 * (dt.offset / 60);\n      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;\n      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {\n        z = offsetZ;\n        this.dt = dt;\n      } else {\n        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so\n        // we manually apply the offset and substitute the zone as needed.\n        z = \"UTC\";\n        this.dt = dt.offset === 0 ? dt : dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n        this.originalZone = dt.zone;\n      }\n    } else if (dt.zone.type === \"system\") {\n      this.dt = dt;\n    } else if (dt.zone.type === \"iana\") {\n      this.dt = dt;\n      z = dt.zone.name;\n    } else {\n      // Custom zones can have any offset / offsetName so we just manually\n      // apply the offset and substitute the zone as needed.\n      z = \"UTC\";\n      this.dt = dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n      this.originalZone = dt.zone;\n    }\n\n    const intlOpts = { ...this.opts };\n    intlOpts.timeZone = intlOpts.timeZone || z;\n    this.dtf = getCachedDTF(intl, intlOpts);\n  }\n\n  format() {\n    if (this.originalZone) {\n      // If we have to substitute in the actual zone name, we have to use\n      // formatToParts so that the timezone can be replaced.\n      return this.formatToParts()\n        .map(({ value }) => value)\n        .join(\"\");\n    }\n    return this.dtf.format(this.dt.toJSDate());\n  }\n\n  formatToParts() {\n    const parts = this.dtf.formatToParts(this.dt.toJSDate());\n    if (this.originalZone) {\n      return parts.map((part) => {\n        if (part.type === \"timeZoneName\") {\n          const offsetName = this.originalZone.offsetName(this.dt.ts, {\n            locale: this.dt.locale,\n            format: this.opts.timeZoneName,\n          });\n          return {\n            ...part,\n            value: offsetName,\n          };\n        } else {\n          return part;\n        }\n      });\n    }\n    return parts;\n  }\n\n  resolvedOptions() {\n    return this.dtf.resolvedOptions();\n  }\n}\n\n/**\n * @private\n */\nclass PolyRelFormatter {\n  constructor(intl, isEnglish, opts) {\n    this.opts = { style: \"long\", ...opts };\n    if (!isEnglish && hasRelative()) {\n      this.rtf = getCachedRTF(intl, opts);\n    }\n  }\n\n  format(count, unit) {\n    if (this.rtf) {\n      return this.rtf.format(count, unit);\n    } else {\n      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== \"long\");\n    }\n  }\n\n  formatToParts(count, unit) {\n    if (this.rtf) {\n      return this.rtf.formatToParts(count, unit);\n    } else {\n      return [];\n    }\n  }\n}\n\nconst fallbackWeekSettings = {\n  firstDay: 1,\n  minimalDays: 4,\n  weekend: [6, 7],\n};\n\n/**\n * @private\n */\nexport default class Locale {\n  static fromOpts(opts) {\n    return Locale.create(\n      opts.locale,\n      opts.numberingSystem,\n      opts.outputCalendar,\n      opts.weekSettings,\n      opts.defaultToEN\n    );\n  }\n\n  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {\n    const specifiedLocale = locale || Settings.defaultLocale;\n    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats\n    const localeR = specifiedLocale || (defaultToEN ? \"en-US\" : systemLocale());\n    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;\n    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;\n    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;\n    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);\n  }\n\n  static resetCache() {\n    sysLocaleCache = null;\n    intlDTCache.clear();\n    intlNumCache.clear();\n    intlRelCache.clear();\n    intlResolvedOptionsCache.clear();\n    weekInfoCache.clear();\n  }\n\n  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {\n    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);\n  }\n\n  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {\n    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);\n\n    this.locale = parsedLocale;\n    this.numberingSystem = numbering || parsedNumberingSystem || null;\n    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;\n    this.weekSettings = weekSettings;\n    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);\n\n    this.weekdaysCache = { format: {}, standalone: {} };\n    this.monthsCache = { format: {}, standalone: {} };\n    this.meridiemCache = null;\n    this.eraCache = {};\n\n    this.specifiedLocale = specifiedLocale;\n    this.fastNumbersCached = null;\n  }\n\n  get fastNumbers() {\n    if (this.fastNumbersCached == null) {\n      this.fastNumbersCached = supportsFastNumbers(this);\n    }\n\n    return this.fastNumbersCached;\n  }\n\n  listingMode() {\n    const isActuallyEn = this.isEnglish();\n    const hasNoWeirdness =\n      (this.numberingSystem === null || this.numberingSystem === \"latn\") &&\n      (this.outputCalendar === null || this.outputCalendar === \"gregory\");\n    return isActuallyEn && hasNoWeirdness ? \"en\" : \"intl\";\n  }\n\n  clone(alts) {\n    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {\n      return this;\n    } else {\n      return Locale.create(\n        alts.locale || this.specifiedLocale,\n        alts.numberingSystem || this.numberingSystem,\n        alts.outputCalendar || this.outputCalendar,\n        validateWeekSettings(alts.weekSettings) || this.weekSettings,\n        alts.defaultToEN || false\n      );\n    }\n  }\n\n  redefaultToEN(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: true });\n  }\n\n  redefaultToSystem(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: false });\n  }\n\n  months(length, format = false) {\n    return listStuff(this, length, English.months, () => {\n      // Workaround for \"ja\" locale: formatToParts does not label all parts of the month\n      // as \"month\" and for this locale there is no difference between \"format\" and \"non-format\".\n      // As such, just use format() instead of formatToParts() and take the whole string\n      const monthSpecialCase = this.intl === \"ja\" || this.intl.startsWith(\"ja-\");\n      format &= !monthSpecialCase;\n      const intl = format ? { month: length, day: \"numeric\" } : { month: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.monthsCache[formatStr][length]) {\n        const mapper = !monthSpecialCase\n          ? (dt) => this.extract(dt, intl, \"month\")\n          : (dt) => this.dtFormatter(dt, intl).format();\n        this.monthsCache[formatStr][length] = mapMonths(mapper);\n      }\n      return this.monthsCache[formatStr][length];\n    });\n  }\n\n  weekdays(length, format = false) {\n    return listStuff(this, length, English.weekdays, () => {\n      const intl = format\n          ? { weekday: length, year: \"numeric\", month: \"long\", day: \"numeric\" }\n          : { weekday: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.weekdaysCache[formatStr][length]) {\n        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>\n          this.extract(dt, intl, \"weekday\")\n        );\n      }\n      return this.weekdaysCache[formatStr][length];\n    });\n  }\n\n  meridiems() {\n    return listStuff(\n      this,\n      undefined,\n      () => English.meridiems,\n      () => {\n        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two\n        // for AM and PM. This is probably wrong, but it's makes parsing way easier.\n        if (!this.meridiemCache) {\n          const intl = { hour: \"numeric\", hourCycle: \"h12\" };\n          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(\n            (dt) => this.extract(dt, intl, \"dayperiod\")\n          );\n        }\n\n        return this.meridiemCache;\n      }\n    );\n  }\n\n  eras(length) {\n    return listStuff(this, length, English.eras, () => {\n      const intl = { era: length };\n\n      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates\n      // to definitely enumerate them.\n      if (!this.eraCache[length]) {\n        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>\n          this.extract(dt, intl, \"era\")\n        );\n      }\n\n      return this.eraCache[length];\n    });\n  }\n\n  extract(dt, intlOpts, field) {\n    const df = this.dtFormatter(dt, intlOpts),\n      results = df.formatToParts(),\n      matching = results.find((m) => m.type.toLowerCase() === field);\n    return matching ? matching.value : null;\n  }\n\n  numberFormatter(opts = {}) {\n    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)\n    // (in contrast, the rest of the condition is used heavily)\n    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);\n  }\n\n  dtFormatter(dt, intlOpts = {}) {\n    return new PolyDateFormatter(dt, this.intl, intlOpts);\n  }\n\n  relFormatter(opts = {}) {\n    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);\n  }\n\n  listFormatter(opts = {}) {\n    return getCachedLF(this.intl, opts);\n  }\n\n  isEnglish() {\n    return (\n      this.locale === \"en\" ||\n      this.locale.toLowerCase() === \"en-us\" ||\n      getCachedIntResolvedOptions(this.intl).locale.startsWith(\"en-us\")\n    );\n  }\n\n  getWeekSettings() {\n    if (this.weekSettings) {\n      return this.weekSettings;\n    } else if (!hasLocaleWeekInfo()) {\n      return fallbackWeekSettings;\n    } else {\n      return getCachedWeekInfo(this.locale);\n    }\n  }\n\n  getStartOfWeek() {\n    return this.getWeekSettings().firstDay;\n  }\n\n  getMinDaysInFirstWeek() {\n    return this.getWeekSettings().minimalDays;\n  }\n\n  getWeekendDays() {\n    return this.getWeekSettings().weekend;\n  }\n\n  equals(other) {\n    return (\n      this.locale === other.locale &&\n      this.numberingSystem === other.numberingSystem &&\n      this.outputCalendar === other.outputCalendar\n    );\n  }\n\n  toString() {\n    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;\n  }\n}\n","import { formatOffset, signedOffset } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * A zone with a fixed offset (meaning no DST)\n * @implements {Zone}\n */\nexport default class FixedOffsetZone extends Zone {\n  /**\n   * Get a singleton instance of UTC\n   * @return {FixedOffsetZone}\n   */\n  static get utcInstance() {\n    if (singleton === null) {\n      singleton = new FixedOffsetZone(0);\n    }\n    return singleton;\n  }\n\n  /**\n   * Get an instance with a specified offset\n   * @param {number} offset - The offset in minutes\n   * @return {FixedOffsetZone}\n   */\n  static instance(offset) {\n    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);\n  }\n\n  /**\n   * Get an instance of FixedOffsetZone from a UTC offset string, like \"UTC+6\"\n   * @param {string} s - The offset string to parse\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+6\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+06\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC-6:00\")\n   * @return {FixedOffsetZone}\n   */\n  static parseSpecifier(s) {\n    if (s) {\n      const r = s.match(/^utc(?:([+-]\\d{1,2})(?::(\\d{2}))?)?$/i);\n      if (r) {\n        return new FixedOffsetZone(signedOffset(r[1], r[2]));\n      }\n    }\n    return null;\n  }\n\n  constructor(offset) {\n    super();\n    /** @private **/\n    this.fixed = offset;\n  }\n\n  /**\n   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"fixed\";\n  }\n\n  /**\n   * The name of this zone.\n   * All fixed zones' names always start with \"UTC\" (plus optional offset)\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.fixed === 0 ? \"UTC\" : `UTC${formatOffset(this.fixed, \"narrow\")}`;\n  }\n\n  /**\n   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`\n   *\n   * @override\n   * @type {string}\n   */\n  get ianaName() {\n    if (this.fixed === 0) {\n      return \"Etc/UTC\";\n    } else {\n      return `Etc/GMT${formatOffset(-this.fixed, \"narrow\")}`;\n    }\n  }\n\n  /**\n   * Returns the offset's common name at the specified timestamp.\n   *\n   * For fixed offset zones this equals to the zone name.\n   * @override\n   */\n  offsetName() {\n    return this.name;\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.fixed, format);\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns true for all fixed offset zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return true;\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   *\n   * For fixed offset zones, this is constant and does not depend on a timestamp.\n   * @override\n   * @return {number}\n   */\n  offset() {\n    return this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"fixed\" && otherZone.fixed === this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is valid:\n   * All fixed offset zones are valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return true;\n  }\n}\n","import Zone from \"../zone.js\";\n\n/**\n * A zone that failed to parse. You should never need to instantiate this.\n * @implements {Zone}\n */\nexport default class InvalidZone extends Zone {\n  constructor(zoneName) {\n    super();\n    /**  @private */\n    this.zoneName = zoneName;\n  }\n\n  /** @override **/\n  get type() {\n    return \"invalid\";\n  }\n\n  /** @override **/\n  get name() {\n    return this.zoneName;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName() {\n    return null;\n  }\n\n  /** @override **/\n  formatOffset() {\n    return \"\";\n  }\n\n  /** @override **/\n  offset() {\n    return NaN;\n  }\n\n  /** @override **/\n  equals() {\n    return false;\n  }\n\n  /** @override **/\n  get isValid() {\n    return false;\n  }\n}\n","/**\n * @private\n */\n\nimport Zone from \"../zone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport InvalidZone from \"../zones/invalidZone.js\";\n\nimport { isUndefined, isString, isNumber } from \"./util.js\";\nimport SystemZone from \"../zones/systemZone.js\";\n\nexport function normalizeZone(input, defaultZone) {\n  let offset;\n  if (isUndefined(input) || input === null) {\n    return defaultZone;\n  } else if (input instanceof Zone) {\n    return input;\n  } else if (isString(input)) {\n    const lowered = input.toLowerCase();\n    if (lowered === \"default\") return defaultZone;\n    else if (lowered === \"local\" || lowered === \"system\") return SystemZone.instance;\n    else if (lowered === \"utc\" || lowered === \"gmt\") return FixedOffsetZone.utcInstance;\n    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);\n  } else if (isNumber(input)) {\n    return FixedOffsetZone.instance(input);\n  } else if (typeof input === \"object\" && \"offset\" in input && typeof input.offset === \"function\") {\n    // This is dumb, but the instanceof check above doesn't seem to really work\n    // so we're duck checking it\n    return input;\n  } else {\n    return new InvalidZone(input);\n  }\n}\n","const numberingSystems = {\n  arab: \"[\\u0660-\\u0669]\",\n  arabext: \"[\\u06F0-\\u06F9]\",\n  bali: \"[\\u1B50-\\u1B59]\",\n  beng: \"[\\u09E6-\\u09EF]\",\n  deva: \"[\\u0966-\\u096F]\",\n  fullwide: \"[\\uFF10-\\uFF19]\",\n  gujr: \"[\\u0AE6-\\u0AEF]\",\n  hanidec: \"[〇|一|二|三|四|五|六|七|八|九]\",\n  khmr: \"[\\u17E0-\\u17E9]\",\n  knda: \"[\\u0CE6-\\u0CEF]\",\n  laoo: \"[\\u0ED0-\\u0ED9]\",\n  limb: \"[\\u1946-\\u194F]\",\n  mlym: \"[\\u0D66-\\u0D6F]\",\n  mong: \"[\\u1810-\\u1819]\",\n  mymr: \"[\\u1040-\\u1049]\",\n  orya: \"[\\u0B66-\\u0B6F]\",\n  tamldec: \"[\\u0BE6-\\u0BEF]\",\n  telu: \"[\\u0C66-\\u0C6F]\",\n  thai: \"[\\u0E50-\\u0E59]\",\n  tibt: \"[\\u0F20-\\u0F29]\",\n  latn: \"\\\\d\",\n};\n\nconst numberingSystemsUTF16 = {\n  arab: [1632, 1641],\n  arabext: [1776, 1785],\n  bali: [6992, 7001],\n  beng: [2534, 2543],\n  deva: [2406, 2415],\n  fullwide: [65296, 65303],\n  gujr: [2790, 2799],\n  khmr: [6112, 6121],\n  knda: [3302, 3311],\n  laoo: [3792, 3801],\n  limb: [6470, 6479],\n  mlym: [3430, 3439],\n  mong: [6160, 6169],\n  mymr: [4160, 4169],\n  orya: [2918, 2927],\n  tamldec: [3046, 3055],\n  telu: [3174, 3183],\n  thai: [3664, 3673],\n  tibt: [3872, 3881],\n};\n\nconst hanidecChars = numberingSystems.hanidec.replace(/[\\[|\\]]/g, \"\").split(\"\");\n\nexport function parseDigits(str) {\n  let value = parseInt(str, 10);\n  if (isNaN(value)) {\n    value = \"\";\n    for (let i = 0; i < str.length; i++) {\n      const code = str.charCodeAt(i);\n\n      if (str[i].search(numberingSystems.hanidec) !== -1) {\n        value += hanidecChars.indexOf(str[i]);\n      } else {\n        for (const key in numberingSystemsUTF16) {\n          const [min, max] = numberingSystemsUTF16[key];\n          if (code >= min && code <= max) {\n            value += code - min;\n          }\n        }\n      }\n    }\n    return parseInt(value, 10);\n  } else {\n    return value;\n  }\n}\n\n// cache of {numberingSystem: {append: regex}}\nconst digitRegexCache = new Map();\nexport function resetDigitRegexCache() {\n  digitRegexCache.clear();\n}\n\nexport function digitRegex({ numberingSystem }, append = \"\") {\n  const ns = numberingSystem || \"latn\";\n\n  let appendCache = digitRegexCache.get(ns);\n  if (appendCache === undefined) {\n    appendCache = new Map();\n    digitRegexCache.set(ns, appendCache);\n  }\n  let regex = appendCache.get(append);\n  if (regex === undefined) {\n    regex = new RegExp(`${numberingSystems[ns]}${append}`);\n    appendCache.set(append, regex);\n  }\n\n  return regex;\n}\n","import SystemZone from \"./zones/systemZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport DateTime from \"./datetime.js\";\n\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport { validateWeekSettings } from \"./impl/util.js\";\nimport { resetDigitRegexCache } from \"./impl/digits.js\";\n\nlet now = () => Date.now(),\n  defaultZone = \"system\",\n  defaultLocale = null,\n  defaultNumberingSystem = null,\n  defaultOutputCalendar = null,\n  twoDigitCutoffYear = 60,\n  throwOnInvalid,\n  defaultWeekSettings = null;\n\n/**\n * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.\n */\nexport default class Settings {\n  /**\n   * Get the callback for returning the current timestamp.\n   * @type {function}\n   */\n  static get now() {\n    return now;\n  }\n\n  /**\n   * Set the callback for returning the current timestamp.\n   * The function should return a number, which will be interpreted as an Epoch millisecond count\n   * @type {function}\n   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future\n   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time\n   */\n  static set now(n) {\n    now = n;\n  }\n\n  /**\n   * Set the default time zone to create DateTimes in. Does not affect existing instances.\n   * Use the value \"system\" to reset this value to the system's time zone.\n   * @type {string}\n   */\n  static set defaultZone(zone) {\n    defaultZone = zone;\n  }\n\n  /**\n   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.\n   * The default value is the system's time zone (the one set on the machine that runs this code).\n   * @type {Zone}\n   */\n  static get defaultZone() {\n    return normalizeZone(defaultZone, SystemZone.instance);\n  }\n\n  /**\n   * Get the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultLocale() {\n    return defaultLocale;\n  }\n\n  /**\n   * Set the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultLocale(locale) {\n    defaultLocale = locale;\n  }\n\n  /**\n   * Get the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultNumberingSystem() {\n    return defaultNumberingSystem;\n  }\n\n  /**\n   * Set the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultNumberingSystem(numberingSystem) {\n    defaultNumberingSystem = numberingSystem;\n  }\n\n  /**\n   * Get the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultOutputCalendar() {\n    return defaultOutputCalendar;\n  }\n\n  /**\n   * Set the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultOutputCalendar(outputCalendar) {\n    defaultOutputCalendar = outputCalendar;\n  }\n\n  /**\n   * @typedef {Object} WeekSettings\n   * @property {number} firstDay\n   * @property {number} minimalDays\n   * @property {number[]} weekend\n   */\n\n  /**\n   * @return {WeekSettings|null}\n   */\n  static get defaultWeekSettings() {\n    return defaultWeekSettings;\n  }\n\n  /**\n   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and\n   * how many days are required in the first week of a year.\n   * Does not affect existing instances.\n   *\n   * @param {WeekSettings|null} weekSettings\n   */\n  static set defaultWeekSettings(weekSettings) {\n    defaultWeekSettings = validateWeekSettings(weekSettings);\n  }\n\n  /**\n   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   */\n  static get twoDigitCutoffYear() {\n    return twoDigitCutoffYear;\n  }\n\n  /**\n   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century\n   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century\n   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950\n   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50\n   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50\n   */\n  static set twoDigitCutoffYear(cutoffYear) {\n    twoDigitCutoffYear = cutoffYear % 100;\n  }\n\n  /**\n   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static get throwOnInvalid() {\n    return throwOnInvalid;\n  }\n\n  /**\n   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static set throwOnInvalid(t) {\n    throwOnInvalid = t;\n  }\n\n  /**\n   * Reset Luxon's global caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCaches() {\n    Locale.resetCache();\n    IANAZone.resetCache();\n    DateTime.resetCache();\n    resetDigitRegexCache();\n  }\n}\n","export default class Invalid {\n  constructor(reason, explanation) {\n    this.reason = reason;\n    this.explanation = explanation;\n  }\n\n  toMessage() {\n    if (this.explanation) {\n      return `${this.reason}: ${this.explanation}`;\n    } else {\n      return this.reason;\n    }\n  }\n}\n","import {\n  integerBetween,\n  isLeapYear,\n  timeObject,\n  daysInYear,\n  daysInMonth,\n  weeksInWeekYear,\n  isInteger,\n  isUndefined,\n} from \"./util.js\";\nimport Invalid from \"./invalid.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],\n  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];\n\nfunction unitOutOfRange(unit, value) {\n  return new Invalid(\n    \"unit out of range\",\n    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`\n  );\n}\n\nexport function dayOfWeek(year, month, day) {\n  const d = new Date(Date.UTC(year, month - 1, day));\n\n  if (year < 100 && year >= 0) {\n    d.setUTCFullYear(d.getUTCFullYear() - 1900);\n  }\n\n  const js = d.getUTCDay();\n\n  return js === 0 ? 7 : js;\n}\n\nfunction computeOrdinal(year, month, day) {\n  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];\n}\n\nfunction uncomputeOrdinal(year, ordinal) {\n  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,\n    month0 = table.findIndex((i) => i < ordinal),\n    day = ordinal - table[month0];\n  return { month: month0 + 1, day };\n}\n\nexport function isoWeekdayToLocal(isoWeekday, startOfWeek) {\n  return ((isoWeekday - startOfWeek + 7) % 7) + 1;\n}\n\n/**\n * @private\n */\n\nexport function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { year, month, day } = gregObj,\n    ordinal = computeOrdinal(year, month, day),\n    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);\n\n  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),\n    weekYear;\n\n  if (weekNumber < 1) {\n    weekYear = year - 1;\n    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);\n  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {\n    weekYear = year + 1;\n    weekNumber = 1;\n  } else {\n    weekYear = year;\n  }\n\n  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };\n}\n\nexport function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { weekYear, weekNumber, weekday } = weekData,\n    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),\n    yearInDays = daysInYear(weekYear);\n\n  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,\n    year;\n\n  if (ordinal < 1) {\n    year = weekYear - 1;\n    ordinal += daysInYear(year);\n  } else if (ordinal > yearInDays) {\n    year = weekYear + 1;\n    ordinal -= daysInYear(weekYear);\n  } else {\n    year = weekYear;\n  }\n\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(weekData) };\n}\n\nexport function gregorianToOrdinal(gregData) {\n  const { year, month, day } = gregData;\n  const ordinal = computeOrdinal(year, month, day);\n  return { year, ordinal, ...timeObject(gregData) };\n}\n\nexport function ordinalToGregorian(ordinalData) {\n  const { year, ordinal } = ordinalData;\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(ordinalData) };\n}\n\n/**\n * Check if local week units like localWeekday are used in obj.\n * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.\n * Modifies obj in-place!\n * @param obj the object values\n */\nexport function usesLocalWeekValues(obj, loc) {\n  const hasLocaleWeekData =\n    !isUndefined(obj.localWeekday) ||\n    !isUndefined(obj.localWeekNumber) ||\n    !isUndefined(obj.localWeekYear);\n  if (hasLocaleWeekData) {\n    const hasIsoWeekData =\n      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);\n\n    if (hasIsoWeekData) {\n      throw new ConflictingSpecificationError(\n        \"Cannot mix locale-based week fields with ISO-based week fields\"\n      );\n    }\n    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;\n    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;\n    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;\n    delete obj.localWeekday;\n    delete obj.localWeekNumber;\n    delete obj.localWeekYear;\n    return {\n      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),\n      startOfWeek: loc.getStartOfWeek(),\n    };\n  } else {\n    return { minDaysInFirstWeek: 4, startOfWeek: 1 };\n  }\n}\n\nexport function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const validYear = isInteger(obj.weekYear),\n    validWeek = integerBetween(\n      obj.weekNumber,\n      1,\n      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)\n    ),\n    validWeekday = integerBetween(obj.weekday, 1, 7);\n\n  if (!validYear) {\n    return unitOutOfRange(\"weekYear\", obj.weekYear);\n  } else if (!validWeek) {\n    return unitOutOfRange(\"week\", obj.weekNumber);\n  } else if (!validWeekday) {\n    return unitOutOfRange(\"weekday\", obj.weekday);\n  } else return false;\n}\n\nexport function hasInvalidOrdinalData(obj) {\n  const validYear = isInteger(obj.year),\n    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validOrdinal) {\n    return unitOutOfRange(\"ordinal\", obj.ordinal);\n  } else return false;\n}\n\nexport function hasInvalidGregorianData(obj) {\n  const validYear = isInteger(obj.year),\n    validMonth = integerBetween(obj.month, 1, 12),\n    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validMonth) {\n    return unitOutOfRange(\"month\", obj.month);\n  } else if (!validDay) {\n    return unitOutOfRange(\"day\", obj.day);\n  } else return false;\n}\n\nexport function hasInvalidTimeData(obj) {\n  const { hour, minute, second, millisecond } = obj;\n  const validHour =\n      integerBetween(hour, 0, 23) ||\n      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),\n    validMinute = integerBetween(minute, 0, 59),\n    validSecond = integerBetween(second, 0, 59),\n    validMillisecond = integerBetween(millisecond, 0, 999);\n\n  if (!validHour) {\n    return unitOutOfRange(\"hour\", hour);\n  } else if (!validMinute) {\n    return unitOutOfRange(\"minute\", minute);\n  } else if (!validSecond) {\n    return unitOutOfRange(\"second\", second);\n  } else if (!validMillisecond) {\n    return unitOutOfRange(\"millisecond\", millisecond);\n  } else return false;\n}\n","/*\n  This is just a junk drawer, containing anything used across multiple classes.\n  Because Luxon is small(ish), this should stay small and we won't worry about splitting\n  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.\n*/\n\nimport { InvalidArgumentError } from \"../errors.js\";\nimport Settings from \"../settings.js\";\nimport { dayOfWeek, isoWeekdayToLocal } from \"./conversions.js\";\n\n/**\n * @private\n */\n\n// TYPES\n\nexport function isUndefined(o) {\n  return typeof o === \"undefined\";\n}\n\nexport function isNumber(o) {\n  return typeof o === \"number\";\n}\n\nexport function isInteger(o) {\n  return typeof o === \"number\" && o % 1 === 0;\n}\n\nexport function isString(o) {\n  return typeof o === \"string\";\n}\n\nexport function isDate(o) {\n  return Object.prototype.toString.call(o) === \"[object Date]\";\n}\n\n// CAPABILITIES\n\nexport function hasRelative() {\n  try {\n    return typeof Intl !== \"undefined\" && !!Intl.RelativeTimeFormat;\n  } catch (e) {\n    return false;\n  }\n}\n\nexport function hasLocaleWeekInfo() {\n  try {\n    return (\n      typeof Intl !== \"undefined\" &&\n      !!Intl.Locale &&\n      (\"weekInfo\" in Intl.Locale.prototype || \"getWeekInfo\" in Intl.Locale.prototype)\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n// OBJECTS AND ARRAYS\n\nexport function maybeArray(thing) {\n  return Array.isArray(thing) ? thing : [thing];\n}\n\nexport function bestBy(arr, by, compare) {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  return arr.reduce((best, next) => {\n    const pair = [by(next), next];\n    if (!best) {\n      return pair;\n    } else if (compare(best[0], pair[0]) === best[0]) {\n      return best;\n    } else {\n      return pair;\n    }\n  }, null)[1];\n}\n\nexport function pick(obj, keys) {\n  return keys.reduce((a, k) => {\n    a[k] = obj[k];\n    return a;\n  }, {});\n}\n\nexport function hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function validateWeekSettings(settings) {\n  if (settings == null) {\n    return null;\n  } else if (typeof settings !== \"object\") {\n    throw new InvalidArgumentError(\"Week settings must be an object\");\n  } else {\n    if (\n      !integerBetween(settings.firstDay, 1, 7) ||\n      !integerBetween(settings.minimalDays, 1, 7) ||\n      !Array.isArray(settings.weekend) ||\n      settings.weekend.some((v) => !integerBetween(v, 1, 7))\n    ) {\n      throw new InvalidArgumentError(\"Invalid week settings\");\n    }\n    return {\n      firstDay: settings.firstDay,\n      minimalDays: settings.minimalDays,\n      weekend: Array.from(settings.weekend),\n    };\n  }\n}\n\n// NUMBERS AND STRINGS\n\nexport function integerBetween(thing, bottom, top) {\n  return isInteger(thing) && thing >= bottom && thing <= top;\n}\n\n// x % n but takes the sign of n instead of x\nexport function floorMod(x, n) {\n  return x - n * Math.floor(x / n);\n}\n\nexport function padStart(input, n = 2) {\n  const isNeg = input < 0;\n  let padded;\n  if (isNeg) {\n    padded = \"-\" + (\"\" + -input).padStart(n, \"0\");\n  } else {\n    padded = (\"\" + input).padStart(n, \"0\");\n  }\n  return padded;\n}\n\nexport function parseInteger(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseInt(string, 10);\n  }\n}\n\nexport function parseFloating(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseFloat(string);\n  }\n}\n\nexport function parseMillis(fraction) {\n  // Return undefined (instead of 0) in these cases, where fraction is not set\n  if (isUndefined(fraction) || fraction === null || fraction === \"\") {\n    return undefined;\n  } else {\n    const f = parseFloat(\"0.\" + fraction) * 1000;\n    return Math.floor(f);\n  }\n}\n\nexport function roundTo(number, digits, rounding = \"round\") {\n  const factor = 10 ** digits;\n  switch (rounding) {\n    case \"expand\":\n      return number > 0\n        ? Math.ceil(number * factor) / factor\n        : Math.floor(number * factor) / factor;\n    case \"trunc\":\n      return Math.trunc(number * factor) / factor;\n    case \"round\":\n      return Math.round(number * factor) / factor;\n    case \"floor\":\n      return Math.floor(number * factor) / factor;\n    case \"ceil\":\n      return Math.ceil(number * factor) / factor;\n    default:\n      throw new RangeError(`Value rounding ${rounding} is out of range`);\n  }\n}\n\n// DATE BASICS\n\nexport function isLeapYear(year) {\n  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n\nexport function daysInYear(year) {\n  return isLeapYear(year) ? 366 : 365;\n}\n\nexport function daysInMonth(year, month) {\n  const modMonth = floorMod(month - 1, 12) + 1,\n    modYear = year + (month - modMonth) / 12;\n\n  if (modMonth === 2) {\n    return isLeapYear(modYear) ? 29 : 28;\n  } else {\n    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];\n  }\n}\n\n// convert a calendar object to a local timestamp (epoch, but with the offset baked in)\nexport function objToLocalTS(obj) {\n  let d = Date.UTC(\n    obj.year,\n    obj.month - 1,\n    obj.day,\n    obj.hour,\n    obj.minute,\n    obj.second,\n    obj.millisecond\n  );\n\n  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that\n  if (obj.year < 100 && obj.year >= 0) {\n    d = new Date(d);\n    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not\n    // so if obj.year is in 99, but obj.day makes it roll over into year 100,\n    // the calculations done by Date.UTC are using year 2000 - which is incorrect\n    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);\n  }\n  return +d;\n}\n\n// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js\nfunction firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {\n  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);\n  return -fwdlw + minDaysInFirstWeek - 1;\n}\n\nexport function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);\n  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);\n  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;\n}\n\nexport function untruncateYear(year) {\n  if (year > 99) {\n    return year;\n  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;\n}\n\n// PARSING\n\nexport function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {\n  const date = new Date(ts),\n    intlOpts = {\n      hourCycle: \"h23\",\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n    };\n\n  if (timeZone) {\n    intlOpts.timeZone = timeZone;\n  }\n\n  const modified = { timeZoneName: offsetFormat, ...intlOpts };\n\n  const parsed = new Intl.DateTimeFormat(locale, modified)\n    .formatToParts(date)\n    .find((m) => m.type.toLowerCase() === \"timezonename\");\n  return parsed ? parsed.value : null;\n}\n\n// signedOffset('-5', '30') -> -330\nexport function signedOffset(offHourStr, offMinuteStr) {\n  let offHour = parseInt(offHourStr, 10);\n\n  // don't || this because we want to preserve -0\n  if (Number.isNaN(offHour)) {\n    offHour = 0;\n  }\n\n  const offMin = parseInt(offMinuteStr, 10) || 0,\n    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;\n  return offHour * 60 + offMinSigned;\n}\n\n// COERCION\n\nexport function asNumber(value) {\n  const numericValue = Number(value);\n  if (typeof value === \"boolean\" || value === \"\" || !Number.isFinite(numericValue))\n    throw new InvalidArgumentError(`Invalid unit value ${value}`);\n  return numericValue;\n}\n\nexport function normalizeObject(obj, normalizer) {\n  const normalized = {};\n  for (const u in obj) {\n    if (hasOwnProperty(obj, u)) {\n      const v = obj[u];\n      if (v === undefined || v === null) continue;\n      normalized[normalizer(u)] = asNumber(v);\n    }\n  }\n  return normalized;\n}\n\n/**\n * Returns the offset's value as a string\n * @param {number} ts - Epoch milliseconds for which to get the offset\n * @param {string} format - What style of offset to return.\n *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n * @return {string}\n */\nexport function formatOffset(offset, format) {\n  const hours = Math.trunc(Math.abs(offset / 60)),\n    minutes = Math.trunc(Math.abs(offset % 60)),\n    sign = offset >= 0 ? \"+\" : \"-\";\n\n  switch (format) {\n    case \"short\":\n      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;\n    case \"narrow\":\n      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : \"\"}`;\n    case \"techie\":\n      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;\n    default:\n      throw new RangeError(`Value format ${format} is out of range for property format`);\n  }\n}\n\nexport function timeObject(obj) {\n  return pick(obj, [\"hour\", \"minute\", \"second\", \"millisecond\"]);\n}\n","import * as Formats from \"./formats.js\";\nimport { pick } from \"./util.js\";\n\nfunction stringify(obj) {\n  return JSON.stringify(obj, Object.keys(obj).sort());\n}\n\n/**\n * @private\n */\n\nexport const monthsLong = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n];\n\nexport const monthsShort = [\n  \"Jan\",\n  \"Feb\",\n  \"Mar\",\n  \"Apr\",\n  \"May\",\n  \"Jun\",\n  \"Jul\",\n  \"Aug\",\n  \"Sep\",\n  \"Oct\",\n  \"Nov\",\n  \"Dec\",\n];\n\nexport const monthsNarrow = [\"J\", \"F\", \"M\", \"A\", \"M\", \"J\", \"J\", \"A\", \"S\", \"O\", \"N\", \"D\"];\n\nexport function months(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...monthsNarrow];\n    case \"short\":\n      return [...monthsShort];\n    case \"long\":\n      return [...monthsLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"11\", \"12\"];\n    case \"2-digit\":\n      return [\"01\", \"02\", \"03\", \"04\", \"05\", \"06\", \"07\", \"08\", \"09\", \"10\", \"11\", \"12\"];\n    default:\n      return null;\n  }\n}\n\nexport const weekdaysLong = [\n  \"Monday\",\n  \"Tuesday\",\n  \"Wednesday\",\n  \"Thursday\",\n  \"Friday\",\n  \"Saturday\",\n  \"Sunday\",\n];\n\nexport const weekdaysShort = [\"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\"];\n\nexport const weekdaysNarrow = [\"M\", \"T\", \"W\", \"T\", \"F\", \"S\", \"S\"];\n\nexport function weekdays(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...weekdaysNarrow];\n    case \"short\":\n      return [...weekdaysShort];\n    case \"long\":\n      return [...weekdaysLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\"];\n    default:\n      return null;\n  }\n}\n\nexport const meridiems = [\"AM\", \"PM\"];\n\nexport const erasLong = [\"Before Christ\", \"Anno Domini\"];\n\nexport const erasShort = [\"BC\", \"AD\"];\n\nexport const erasNarrow = [\"B\", \"A\"];\n\nexport function eras(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...erasNarrow];\n    case \"short\":\n      return [...erasShort];\n    case \"long\":\n      return [...erasLong];\n    default:\n      return null;\n  }\n}\n\nexport function meridiemForDateTime(dt) {\n  return meridiems[dt.hour < 12 ? 0 : 1];\n}\n\nexport function weekdayForDateTime(dt, length) {\n  return weekdays(length)[dt.weekday - 1];\n}\n\nexport function monthForDateTime(dt, length) {\n  return months(length)[dt.month - 1];\n}\n\nexport function eraForDateTime(dt, length) {\n  return eras(length)[dt.year < 0 ? 0 : 1];\n}\n\nexport function formatRelativeTime(unit, count, numeric = \"always\", narrow = false) {\n  const units = {\n    years: [\"year\", \"yr.\"],\n    quarters: [\"quarter\", \"qtr.\"],\n    months: [\"month\", \"mo.\"],\n    weeks: [\"week\", \"wk.\"],\n    days: [\"day\", \"day\", \"days\"],\n    hours: [\"hour\", \"hr.\"],\n    minutes: [\"minute\", \"min.\"],\n    seconds: [\"second\", \"sec.\"],\n  };\n\n  const lastable = [\"hours\", \"minutes\", \"seconds\"].indexOf(unit) === -1;\n\n  if (numeric === \"auto\" && lastable) {\n    const isDay = unit === \"days\";\n    switch (count) {\n      case 1:\n        return isDay ? \"tomorrow\" : `next ${units[unit][0]}`;\n      case -1:\n        return isDay ? \"yesterday\" : `last ${units[unit][0]}`;\n      case 0:\n        return isDay ? \"today\" : `this ${units[unit][0]}`;\n      default: // fall through\n    }\n  }\n\n  const isInPast = Object.is(count, -0) || count < 0,\n    fmtValue = Math.abs(count),\n    singular = fmtValue === 1,\n    lilUnits = units[unit],\n    fmtUnit = narrow\n      ? singular\n        ? lilUnits[1]\n        : lilUnits[2] || lilUnits[1]\n      : singular\n      ? units[unit][0]\n      : unit;\n  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;\n}\n\nexport function formatString(knownFormat) {\n  // these all have the offsets removed because we don't have access to them\n  // without all the intl stuff this is backfilling\n  const filtered = pick(knownFormat, [\n      \"weekday\",\n      \"era\",\n      \"year\",\n      \"month\",\n      \"day\",\n      \"hour\",\n      \"minute\",\n      \"second\",\n      \"timeZoneName\",\n      \"hourCycle\",\n    ]),\n    key = stringify(filtered),\n    dateTimeHuge = \"EEEE, LLLL d, yyyy, h:mm a\";\n  switch (key) {\n    case stringify(Formats.DATE_SHORT):\n      return \"M/d/yyyy\";\n    case stringify(Formats.DATE_MED):\n      return \"LLL d, yyyy\";\n    case stringify(Formats.DATE_MED_WITH_WEEKDAY):\n      return \"EEE, LLL d, yyyy\";\n    case stringify(Formats.DATE_FULL):\n      return \"LLLL d, yyyy\";\n    case stringify(Formats.DATE_HUGE):\n      return \"EEEE, LLLL d, yyyy\";\n    case stringify(Formats.TIME_SIMPLE):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_SECONDS):\n      return \"h:mm:ss a\";\n    case stringify(Formats.TIME_WITH_SHORT_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_LONG_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_24_SIMPLE):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_SECONDS):\n      return \"HH:mm:ss\";\n    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.DATETIME_SHORT):\n      return \"M/d/yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_MED):\n      return \"LLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL):\n      return \"LLLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_HUGE):\n      return dateTimeHuge;\n    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):\n      return \"M/d/yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_SECONDS):\n      return \"LLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):\n      return \"EEE, d LLL yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):\n      return \"LLLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):\n      return \"EEEE, LLLL d, yyyy, h:mm:ss a\";\n    default:\n      return dateTimeHuge;\n  }\n}\n","import * as English from \"./english.js\";\nimport * as Formats from \"./formats.js\";\nimport { padStart } from \"./util.js\";\n\nfunction stringifyTokens(splits, tokenToString) {\n  let s = \"\";\n  for (const token of splits) {\n    if (token.literal) {\n      s += token.val;\n    } else {\n      s += tokenToString(token.val);\n    }\n  }\n  return s;\n}\n\nconst macroTokenToFormatOpts = {\n  D: Formats.DATE_SHORT,\n  DD: Formats.DATE_MED,\n  DDD: Formats.DATE_FULL,\n  DDDD: Formats.DATE_HUGE,\n  t: Formats.TIME_SIMPLE,\n  tt: Formats.TIME_WITH_SECONDS,\n  ttt: Formats.TIME_WITH_SHORT_OFFSET,\n  tttt: Formats.TIME_WITH_LONG_OFFSET,\n  T: Formats.TIME_24_SIMPLE,\n  TT: Formats.TIME_24_WITH_SECONDS,\n  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,\n  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,\n  f: Formats.DATETIME_SHORT,\n  ff: Formats.DATETIME_MED,\n  fff: Formats.DATETIME_FULL,\n  ffff: Formats.DATETIME_HUGE,\n  F: Formats.DATETIME_SHORT_WITH_SECONDS,\n  FF: Formats.DATETIME_MED_WITH_SECONDS,\n  FFF: Formats.DATETIME_FULL_WITH_SECONDS,\n  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,\n};\n\n/**\n * @private\n */\n\nexport default class Formatter {\n  static create(locale, opts = {}) {\n    return new Formatter(locale, opts);\n  }\n\n  static parseFormat(fmt) {\n    // white-space is always considered a literal in user-provided formats\n    // the \" \" token has a special meaning (see unitForToken)\n\n    let current = null,\n      currentFull = \"\",\n      bracketed = false;\n    const splits = [];\n    for (let i = 0; i < fmt.length; i++) {\n      const c = fmt.charAt(i);\n      if (c === \"'\") {\n        // turn '' into a literal signal quote instead of just skipping the empty literal\n        if (currentFull.length > 0 || bracketed) {\n          splits.push({\n            literal: bracketed || /^\\s+$/.test(currentFull),\n            val: currentFull === \"\" ? \"'\" : currentFull,\n          });\n        }\n        current = null;\n        currentFull = \"\";\n        bracketed = !bracketed;\n      } else if (bracketed) {\n        currentFull += c;\n      } else if (c === current) {\n        currentFull += c;\n      } else {\n        if (currentFull.length > 0) {\n          splits.push({ literal: /^\\s+$/.test(currentFull), val: currentFull });\n        }\n        currentFull = c;\n        current = c;\n      }\n    }\n\n    if (currentFull.length > 0) {\n      splits.push({ literal: bracketed || /^\\s+$/.test(currentFull), val: currentFull });\n    }\n\n    return splits;\n  }\n\n  static macroTokenToFormatOpts(token) {\n    return macroTokenToFormatOpts[token];\n  }\n\n  constructor(locale, formatOpts) {\n    this.opts = formatOpts;\n    this.loc = locale;\n    this.systemLoc = null;\n  }\n\n  formatWithSystemDefault(dt, opts) {\n    if (this.systemLoc === null) {\n      this.systemLoc = this.loc.redefaultToSystem();\n    }\n    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });\n    return df.format();\n  }\n\n  dtFormatter(dt, opts = {}) {\n    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });\n  }\n\n  formatDateTime(dt, opts) {\n    return this.dtFormatter(dt, opts).format();\n  }\n\n  formatDateTimeParts(dt, opts) {\n    return this.dtFormatter(dt, opts).formatToParts();\n  }\n\n  formatInterval(interval, opts) {\n    const df = this.dtFormatter(interval.start, opts);\n    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());\n  }\n\n  resolvedOptions(dt, opts) {\n    return this.dtFormatter(dt, opts).resolvedOptions();\n  }\n\n  num(n, p = 0, signDisplay = undefined) {\n    // we get some perf out of doing this here, annoyingly\n    if (this.opts.forceSimple) {\n      return padStart(n, p);\n    }\n\n    const opts = { ...this.opts };\n\n    if (p > 0) {\n      opts.padTo = p;\n    }\n    if (signDisplay) {\n      opts.signDisplay = signDisplay;\n    }\n\n    return this.loc.numberFormatter(opts).format(n);\n  }\n\n  formatDateTimeFromString(dt, fmt) {\n    const knownEnglish = this.loc.listingMode() === \"en\",\n      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== \"gregory\",\n      string = (opts, extract) => this.loc.extract(dt, opts, extract),\n      formatOffset = (opts) => {\n        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {\n          return \"Z\";\n        }\n\n        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : \"\";\n      },\n      meridiem = () =>\n        knownEnglish\n          ? English.meridiemForDateTime(dt)\n          : string({ hour: \"numeric\", hourCycle: \"h12\" }, \"dayperiod\"),\n      month = (length, standalone) =>\n        knownEnglish\n          ? English.monthForDateTime(dt, length)\n          : string(standalone ? { month: length } : { month: length, day: \"numeric\" }, \"month\"),\n      weekday = (length, standalone) =>\n        knownEnglish\n          ? English.weekdayForDateTime(dt, length)\n          : string(\n              standalone ? { weekday: length } : { weekday: length, month: \"long\", day: \"numeric\" },\n              \"weekday\"\n            ),\n      maybeMacro = (token) => {\n        const formatOpts = Formatter.macroTokenToFormatOpts(token);\n        if (formatOpts) {\n          return this.formatWithSystemDefault(dt, formatOpts);\n        } else {\n          return token;\n        }\n      },\n      era = (length) =>\n        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, \"era\"),\n      tokenToString = (token) => {\n        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols\n        switch (token) {\n          // ms\n          case \"S\":\n            return this.num(dt.millisecond);\n          case \"u\":\n          // falls through\n          case \"SSS\":\n            return this.num(dt.millisecond, 3);\n          // seconds\n          case \"s\":\n            return this.num(dt.second);\n          case \"ss\":\n            return this.num(dt.second, 2);\n          // fractional seconds\n          case \"uu\":\n            return this.num(Math.floor(dt.millisecond / 10), 2);\n          case \"uuu\":\n            return this.num(Math.floor(dt.millisecond / 100));\n          // minutes\n          case \"m\":\n            return this.num(dt.minute);\n          case \"mm\":\n            return this.num(dt.minute, 2);\n          // hours\n          case \"h\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);\n          case \"hh\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);\n          case \"H\":\n            return this.num(dt.hour);\n          case \"HH\":\n            return this.num(dt.hour, 2);\n          // offset\n          case \"Z\":\n            // like +6\n            return formatOffset({ format: \"narrow\", allowZ: this.opts.allowZ });\n          case \"ZZ\":\n            // like +06:00\n            return formatOffset({ format: \"short\", allowZ: this.opts.allowZ });\n          case \"ZZZ\":\n            // like +0600\n            return formatOffset({ format: \"techie\", allowZ: this.opts.allowZ });\n          case \"ZZZZ\":\n            // like EST\n            return dt.zone.offsetName(dt.ts, { format: \"short\", locale: this.loc.locale });\n          case \"ZZZZZ\":\n            // like Eastern Standard Time\n            return dt.zone.offsetName(dt.ts, { format: \"long\", locale: this.loc.locale });\n          // zone\n          case \"z\":\n            // like America/New_York\n            return dt.zoneName;\n          // meridiems\n          case \"a\":\n            return meridiem();\n          // dates\n          case \"d\":\n            return useDateTimeFormatter ? string({ day: \"numeric\" }, \"day\") : this.num(dt.day);\n          case \"dd\":\n            return useDateTimeFormatter ? string({ day: \"2-digit\" }, \"day\") : this.num(dt.day, 2);\n          // weekdays - standalone\n          case \"c\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"ccc\":\n            // like 'Tues'\n            return weekday(\"short\", true);\n          case \"cccc\":\n            // like 'Tuesday'\n            return weekday(\"long\", true);\n          case \"ccccc\":\n            // like 'T'\n            return weekday(\"narrow\", true);\n          // weekdays - format\n          case \"E\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"EEE\":\n            // like 'Tues'\n            return weekday(\"short\", false);\n          case \"EEEE\":\n            // like 'Tuesday'\n            return weekday(\"long\", false);\n          case \"EEEEE\":\n            // like 'T'\n            return weekday(\"narrow\", false);\n          // months - standalone\n          case \"L\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"LL\":\n            // like 01, doesn't seem to work\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"LLL\":\n            // like Jan\n            return month(\"short\", true);\n          case \"LLLL\":\n            // like January\n            return month(\"long\", true);\n          case \"LLLLL\":\n            // like J\n            return month(\"narrow\", true);\n          // months - format\n          case \"M\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"MM\":\n            // like 01\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"MMM\":\n            // like Jan\n            return month(\"short\", false);\n          case \"MMMM\":\n            // like January\n            return month(\"long\", false);\n          case \"MMMMM\":\n            // like J\n            return month(\"narrow\", false);\n          // years\n          case \"y\":\n            // like 2014\n            return useDateTimeFormatter ? string({ year: \"numeric\" }, \"year\") : this.num(dt.year);\n          case \"yy\":\n            // like 14\n            return useDateTimeFormatter\n              ? string({ year: \"2-digit\" }, \"year\")\n              : this.num(dt.year.toString().slice(-2), 2);\n          case \"yyyy\":\n            // like 0012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 4);\n          case \"yyyyyy\":\n            // like 000012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 6);\n          // eras\n          case \"G\":\n            // like AD\n            return era(\"short\");\n          case \"GG\":\n            // like Anno Domini\n            return era(\"long\");\n          case \"GGGGG\":\n            return era(\"narrow\");\n          case \"kk\":\n            return this.num(dt.weekYear.toString().slice(-2), 2);\n          case \"kkkk\":\n            return this.num(dt.weekYear, 4);\n          case \"W\":\n            return this.num(dt.weekNumber);\n          case \"WW\":\n            return this.num(dt.weekNumber, 2);\n          case \"n\":\n            return this.num(dt.localWeekNumber);\n          case \"nn\":\n            return this.num(dt.localWeekNumber, 2);\n          case \"ii\":\n            return this.num(dt.localWeekYear.toString().slice(-2), 2);\n          case \"iiii\":\n            return this.num(dt.localWeekYear, 4);\n          case \"o\":\n            return this.num(dt.ordinal);\n          case \"ooo\":\n            return this.num(dt.ordinal, 3);\n          case \"q\":\n            // like 1\n            return this.num(dt.quarter);\n          case \"qq\":\n            // like 01\n            return this.num(dt.quarter, 2);\n          case \"X\":\n            return this.num(Math.floor(dt.ts / 1000));\n          case \"x\":\n            return this.num(dt.ts);\n          default:\n            return maybeMacro(token);\n        }\n      };\n\n    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);\n  }\n\n  formatDurationFromString(dur, fmt) {\n    const invertLargest = this.opts.signMode === \"negativeLargestOnly\" ? -1 : 1;\n    const tokenToField = (token) => {\n        switch (token[0]) {\n          case \"S\":\n            return \"milliseconds\";\n          case \"s\":\n            return \"seconds\";\n          case \"m\":\n            return \"minutes\";\n          case \"h\":\n            return \"hours\";\n          case \"d\":\n            return \"days\";\n          case \"w\":\n            return \"weeks\";\n          case \"M\":\n            return \"months\";\n          case \"y\":\n            return \"years\";\n          default:\n            return null;\n        }\n      },\n      tokenToString = (lildur, info) => (token) => {\n        const mapped = tokenToField(token);\n        if (mapped) {\n          const inversionFactor =\n            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;\n          let signDisplay;\n          if (this.opts.signMode === \"negativeLargestOnly\" && mapped !== info.largestUnit) {\n            signDisplay = \"never\";\n          } else if (this.opts.signMode === \"all\") {\n            signDisplay = \"always\";\n          } else {\n            // \"auto\" and \"negative\" are the same, but \"auto\" has better support\n            signDisplay = \"auto\";\n          }\n          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);\n        } else {\n          return token;\n        }\n      },\n      tokens = Formatter.parseFormat(fmt),\n      realTokens = tokens.reduce(\n        (found, { literal, val }) => (literal ? found : found.concat(val)),\n        []\n      ),\n      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),\n      durationInfo = {\n        isNegativeDuration: collapsed < 0,\n        // this relies on \"collapsed\" being based on \"shiftTo\", which builds up the object\n        // in order\n        largestUnit: Object.keys(collapsed.values)[0],\n      };\n    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));\n  }\n}\n","import {\n  untruncateYear,\n  signedOffset,\n  parseInteger,\n  parseMillis,\n  isUndefined,\n  parseFloating,\n} from \"./util.js\";\nimport * as English from \"./english.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n/*\n * This file handles parsing for well-specified formats. Here's how it works:\n * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.\n * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object\n * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.\n * Extractors can take a \"cursor\" representing the offset in the match to look at. This makes it easy to combine extractors.\n * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.\n * Some extractions are super dumb and simpleParse and fromStrings help DRY them.\n */\n\nconst ianaRegex = /[A-Za-z_+-]{1,256}(?::?\\/[A-Za-z0-9_+-]{1,256}(?:\\/[A-Za-z0-9_+-]{1,256})?)?/;\n\nfunction combineRegexes(...regexes) {\n  const full = regexes.reduce((f, r) => f + r.source, \"\");\n  return RegExp(`^${full}$`);\n}\n\nfunction combineExtractors(...extractors) {\n  return (m) =>\n    extractors\n      .reduce(\n        ([mergedVals, mergedZone, cursor], ex) => {\n          const [val, zone, next] = ex(m, cursor);\n          return [{ ...mergedVals, ...val }, zone || mergedZone, next];\n        },\n        [{}, null, 1]\n      )\n      .slice(0, 2);\n}\n\nfunction parse(s, ...patterns) {\n  if (s == null) {\n    return [null, null];\n  }\n\n  for (const [regex, extractor] of patterns) {\n    const m = regex.exec(s);\n    if (m) {\n      return extractor(m);\n    }\n  }\n  return [null, null];\n}\n\nfunction simpleParse(...keys) {\n  return (match, cursor) => {\n    const ret = {};\n    let i;\n\n    for (i = 0; i < keys.length; i++) {\n      ret[keys[i]] = parseInteger(match[cursor + i]);\n    }\n    return [ret, null, cursor + i];\n  };\n}\n\n// ISO and SQL parsing\nconst offsetRegex = /(?:([Zz])|([+-]\\d\\d)(?::?(\\d\\d))?)/;\nconst isoExtendedZone = `(?:${offsetRegex.source}?(?:\\\\[(${ianaRegex.source})\\\\])?)?`;\nconst isoTimeBaseRegex = /(\\d\\d)(?::?(\\d\\d)(?::?(\\d\\d)(?:[.,](\\d{1,30}))?)?)?/;\nconst isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);\nconst isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);\nconst isoYmdRegex = /([+-]\\d{6}|\\d{4})(?:-?(\\d\\d)(?:-?(\\d\\d))?)?/;\nconst isoWeekRegex = /(\\d{4})-?W(\\d\\d)(?:-?(\\d))?/;\nconst isoOrdinalRegex = /(\\d{4})-?(\\d{3})/;\nconst extractISOWeekData = simpleParse(\"weekYear\", \"weekNumber\", \"weekDay\");\nconst extractISOOrdinalData = simpleParse(\"year\", \"ordinal\");\nconst sqlYmdRegex = /(\\d{4})-(\\d\\d)-(\\d\\d)/; // dumbed-down version of the ISO one\nconst sqlTimeRegex = RegExp(\n  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`\n);\nconst sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);\n\nfunction int(match, pos, fallback) {\n  const m = match[pos];\n  return isUndefined(m) ? fallback : parseInteger(m);\n}\n\nfunction extractISOYmd(match, cursor) {\n  const item = {\n    year: int(match, cursor),\n    month: int(match, cursor + 1, 1),\n    day: int(match, cursor + 2, 1),\n  };\n\n  return [item, null, cursor + 3];\n}\n\nfunction extractISOTime(match, cursor) {\n  const item = {\n    hours: int(match, cursor, 0),\n    minutes: int(match, cursor + 1, 0),\n    seconds: int(match, cursor + 2, 0),\n    milliseconds: parseMillis(match[cursor + 3]),\n  };\n\n  return [item, null, cursor + 4];\n}\n\nfunction extractISOOffset(match, cursor) {\n  const local = !match[cursor] && !match[cursor + 1],\n    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),\n    zone = local ? null : FixedOffsetZone.instance(fullOffset);\n  return [{}, zone, cursor + 3];\n}\n\nfunction extractIANAZone(match, cursor) {\n  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;\n  return [{}, zone, cursor + 1];\n}\n\n// ISO time parsing\n\nconst isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);\n\n// ISO duration parsing\n\nconst isoDuration =\n  /^-?P(?:(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)Y)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)W)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)D)?(?:T(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)H)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20})(?:[.,](-?\\d{1,20}))?S)?)?)$/;\n\nfunction extractISODuration(match) {\n  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =\n    match;\n\n  const hasNegativePrefix = s[0] === \"-\";\n  const negativeSeconds = secondStr && secondStr[0] === \"-\";\n\n  const maybeNegate = (num, force = false) =>\n    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;\n\n  return [\n    {\n      years: maybeNegate(parseFloating(yearStr)),\n      months: maybeNegate(parseFloating(monthStr)),\n      weeks: maybeNegate(parseFloating(weekStr)),\n      days: maybeNegate(parseFloating(dayStr)),\n      hours: maybeNegate(parseFloating(hourStr)),\n      minutes: maybeNegate(parseFloating(minuteStr)),\n      seconds: maybeNegate(parseFloating(secondStr), secondStr === \"-0\"),\n      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),\n    },\n  ];\n}\n\n// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York\n// and not just that we're in -240 *right now*. But since I don't think these are used that often\n// I'm just going to ignore that\nconst obsOffsets = {\n  GMT: 0,\n  EDT: -4 * 60,\n  EST: -5 * 60,\n  CDT: -5 * 60,\n  CST: -6 * 60,\n  MDT: -6 * 60,\n  MST: -7 * 60,\n  PDT: -7 * 60,\n  PST: -8 * 60,\n};\n\nfunction fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {\n  const result = {\n    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),\n    month: English.monthsShort.indexOf(monthStr) + 1,\n    day: parseInteger(dayStr),\n    hour: parseInteger(hourStr),\n    minute: parseInteger(minuteStr),\n  };\n\n  if (secondStr) result.second = parseInteger(secondStr);\n  if (weekdayStr) {\n    result.weekday =\n      weekdayStr.length > 3\n        ? English.weekdaysLong.indexOf(weekdayStr) + 1\n        : English.weekdaysShort.indexOf(weekdayStr) + 1;\n  }\n\n  return result;\n}\n\n// RFC 2822/5322\nconst rfc2822 =\n  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\\d\\d)(\\d\\d)))$/;\n\nfunction extractRFC2822(match) {\n  const [\n      ,\n      weekdayStr,\n      dayStr,\n      monthStr,\n      yearStr,\n      hourStr,\n      minuteStr,\n      secondStr,\n      obsOffset,\n      milOffset,\n      offHourStr,\n      offMinuteStr,\n    ] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n\n  let offset;\n  if (obsOffset) {\n    offset = obsOffsets[obsOffset];\n  } else if (milOffset) {\n    offset = 0;\n  } else {\n    offset = signedOffset(offHourStr, offMinuteStr);\n  }\n\n  return [result, new FixedOffsetZone(offset)];\n}\n\nfunction preprocessRFC2822(s) {\n  // Remove comments and folding whitespace and replace multiple-spaces with a single space\n  return s\n    .replace(/\\([^()]*\\)|[\\n\\t]/g, \" \")\n    .replace(/(\\s\\s+)/g, \" \")\n    .trim();\n}\n\n// http date\n\nconst rfc1123 =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\\d\\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\\d{4}) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  rfc850 =\n    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\\d\\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  ascii =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \\d|\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) (\\d{4})$/;\n\nfunction extractRFC1123Or850(match) {\n  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nfunction extractASCII(match) {\n  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nconst isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);\nconst isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);\nconst isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);\nconst isoTimeCombinedRegex = combineRegexes(isoTimeRegex);\n\nconst extractISOYmdTimeAndOffset = combineExtractors(\n  extractISOYmd,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOWeekTimeAndOffset = combineExtractors(\n  extractISOWeekData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOOrdinalDateAndTime = combineExtractors(\n  extractISOOrdinalData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOTimeAndOffset = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\n/*\n * @private\n */\n\nexport function parseISODate(s) {\n  return parse(\n    s,\n    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],\n    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],\n    [isoTimeCombinedRegex, extractISOTimeAndOffset]\n  );\n}\n\nexport function parseRFC2822Date(s) {\n  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);\n}\n\nexport function parseHTTPDate(s) {\n  return parse(\n    s,\n    [rfc1123, extractRFC1123Or850],\n    [rfc850, extractRFC1123Or850],\n    [ascii, extractASCII]\n  );\n}\n\nexport function parseISODuration(s) {\n  return parse(s, [isoDuration, extractISODuration]);\n}\n\nconst extractISOTimeOnly = combineExtractors(extractISOTime);\n\nexport function parseISOTimeOnly(s) {\n  return parse(s, [isoTimeOnly, extractISOTimeOnly]);\n}\n\nconst sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);\nconst sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);\n\nconst extractISOTimeOffsetAndIANAZone = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\nexport function parseSQL(s) {\n  return parse(\n    s,\n    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]\n  );\n}\n","import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from \"./errors.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Locale from \"./impl/locale.js\";\nimport { parseISODuration, parseISOTimeOnly } from \"./impl/regexParser.js\";\nimport {\n  asNumber,\n  hasOwnProperty,\n  isNumber,\n  isUndefined,\n  normalizeObject,\n  roundTo,\n} from \"./impl/util.js\";\nimport Settings from \"./settings.js\";\nimport DateTime from \"./datetime.js\";\n\nconst INVALID = \"Invalid Duration\";\n\n// unit conversion constants\nexport const lowOrderMatrix = {\n    weeks: {\n      days: 7,\n      hours: 7 * 24,\n      minutes: 7 * 24 * 60,\n      seconds: 7 * 24 * 60 * 60,\n      milliseconds: 7 * 24 * 60 * 60 * 1000,\n    },\n    days: {\n      hours: 24,\n      minutes: 24 * 60,\n      seconds: 24 * 60 * 60,\n      milliseconds: 24 * 60 * 60 * 1000,\n    },\n    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },\n    minutes: { seconds: 60, milliseconds: 60 * 1000 },\n    seconds: { milliseconds: 1000 },\n  },\n  casualMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: 52,\n      days: 365,\n      hours: 365 * 24,\n      minutes: 365 * 24 * 60,\n      seconds: 365 * 24 * 60 * 60,\n      milliseconds: 365 * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: 13,\n      days: 91,\n      hours: 91 * 24,\n      minutes: 91 * 24 * 60,\n      seconds: 91 * 24 * 60 * 60,\n      milliseconds: 91 * 24 * 60 * 60 * 1000,\n    },\n    months: {\n      weeks: 4,\n      days: 30,\n      hours: 30 * 24,\n      minutes: 30 * 24 * 60,\n      seconds: 30 * 24 * 60 * 60,\n      milliseconds: 30 * 24 * 60 * 60 * 1000,\n    },\n\n    ...lowOrderMatrix,\n  },\n  daysInYearAccurate = 146097.0 / 400,\n  daysInMonthAccurate = 146097.0 / 4800,\n  accurateMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: daysInYearAccurate / 7,\n      days: daysInYearAccurate,\n      hours: daysInYearAccurate * 24,\n      minutes: daysInYearAccurate * 24 * 60,\n      seconds: daysInYearAccurate * 24 * 60 * 60,\n      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: daysInYearAccurate / 28,\n      days: daysInYearAccurate / 4,\n      hours: (daysInYearAccurate * 24) / 4,\n      minutes: (daysInYearAccurate * 24 * 60) / 4,\n      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,\n      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,\n    },\n    months: {\n      weeks: daysInMonthAccurate / 7,\n      days: daysInMonthAccurate,\n      hours: daysInMonthAccurate * 24,\n      minutes: daysInMonthAccurate * 24 * 60,\n      seconds: daysInMonthAccurate * 24 * 60 * 60,\n      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,\n    },\n    ...lowOrderMatrix,\n  };\n\n// units ordered by size\nconst orderedUnits = [\n  \"years\",\n  \"quarters\",\n  \"months\",\n  \"weeks\",\n  \"days\",\n  \"hours\",\n  \"minutes\",\n  \"seconds\",\n  \"milliseconds\",\n];\n\nconst reverseUnits = orderedUnits.slice(0).reverse();\n\n// clone really means \"create another instance just like this one, but with these changes\"\nfunction clone(dur, alts, clear = false) {\n  // deep merge for vals\n  const conf = {\n    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },\n    loc: dur.loc.clone(alts.loc),\n    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,\n    matrix: alts.matrix || dur.matrix,\n  };\n  return new Duration(conf);\n}\n\nfunction durationToMillis(matrix, vals) {\n  let sum = vals.milliseconds ?? 0;\n  for (const unit of reverseUnits.slice(1)) {\n    if (vals[unit]) {\n      sum += vals[unit] * matrix[unit][\"milliseconds\"];\n    }\n  }\n  return sum;\n}\n\n// NB: mutates parameters\nfunction normalizeValues(matrix, vals) {\n  // the logic below assumes the overall value of the duration is positive\n  // if this is not the case, factor is used to make it so\n  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;\n\n  orderedUnits.reduceRight((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const previousVal = vals[previous] * factor;\n        const conv = matrix[current][previous];\n\n        // if (previousVal < 0):\n        // lower order unit is negative (e.g. { years: 2, days: -2 })\n        // normalize this by reducing the higher order unit by the appropriate amount\n        // and increasing the lower order unit\n        // this can never make the higher order unit negative, because this function only operates\n        // on positive durations, so the amount of time represented by the lower order unit cannot\n        // be larger than the higher order unit\n        // else:\n        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })\n        // in this case we attempt to convert as much as possible from the lower order unit into\n        // the higher order one\n        //\n        // Math.floor takes care of both of these cases, rounding away from 0\n        // if previousVal < 0 it makes the absolute value larger\n        // if previousVal >= it makes the absolute value smaller\n        const rollUp = Math.floor(previousVal / conv);\n        vals[current] += rollUp * factor;\n        vals[previous] -= rollUp * conv * factor;\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n\n  // try to convert any decimals into smaller units if possible\n  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }\n  orderedUnits.reduce((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const fraction = vals[previous] % 1;\n        vals[previous] -= fraction;\n        vals[current] += fraction * matrix[previous][current];\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n}\n\n// Remove all properties with a value of 0 from an object\nfunction removeZeroes(vals) {\n  const newVals = {};\n  for (const [key, value] of Object.entries(vals)) {\n    if (value !== 0) {\n      newVals[key] = value;\n    }\n  }\n  return newVals;\n}\n\n/**\n * A Duration object represents a period of time, like \"2 months\" or \"1 day, 1 hour\". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.\n *\n * Here is a brief overview of commonly used methods and getters in Duration:\n *\n * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.\n * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.\n * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.\n * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.\n * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}\n *\n * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.\n */\nexport default class Duration {\n  /**\n   * @private\n   */\n  constructor(config) {\n    const accurate = config.conversionAccuracy === \"longterm\" || false;\n    let matrix = accurate ? accurateMatrix : casualMatrix;\n\n    if (config.matrix) {\n      matrix = config.matrix;\n    }\n\n    /**\n     * @access private\n     */\n    this.values = config.values;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.conversionAccuracy = accurate ? \"longterm\" : \"casual\";\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.matrix = matrix;\n    /**\n     * @access private\n     */\n    this.isLuxonDuration = true;\n  }\n\n  /**\n   * Create Duration from a number of milliseconds.\n   * @param {number} count of milliseconds\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  static fromMillis(count, opts) {\n    return Duration.fromObject({ milliseconds: count }, opts);\n  }\n\n  /**\n   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.\n   * If this object is empty then a zero milliseconds duration is returned.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.years\n   * @param {number} obj.quarters\n   * @param {number} obj.months\n   * @param {number} obj.weeks\n   * @param {number} obj.days\n   * @param {number} obj.hours\n   * @param {number} obj.minutes\n   * @param {number} obj.seconds\n   * @param {number} obj.milliseconds\n   * @param {Object} [opts=[]] - options for creating this Duration\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the custom conversion system to use\n   * @return {Duration}\n   */\n  static fromObject(obj, opts = {}) {\n    if (obj == null || typeof obj !== \"object\") {\n      throw new InvalidArgumentError(\n        `Duration.fromObject: argument expected to be an object, got ${\n          obj === null ? \"null\" : typeof obj\n        }`\n      );\n    }\n\n    return new Duration({\n      values: normalizeObject(obj, Duration.normalizeUnit),\n      loc: Locale.fromObject(opts),\n      conversionAccuracy: opts.conversionAccuracy,\n      matrix: opts.matrix,\n    });\n  }\n\n  /**\n   * Create a Duration from DurationLike.\n   *\n   * @param {Object | number | Duration} durationLike\n   * One of:\n   * - object with keys like 'years' and 'hours'.\n   * - number representing milliseconds\n   * - Duration instance\n   * @return {Duration}\n   */\n  static fromDurationLike(durationLike) {\n    if (isNumber(durationLike)) {\n      return Duration.fromMillis(durationLike);\n    } else if (Duration.isDuration(durationLike)) {\n      return durationLike;\n    } else if (typeof durationLike === \"object\") {\n      return Duration.fromObject(durationLike);\n    } else {\n      throw new InvalidArgumentError(\n        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`\n      );\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 duration string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the preset conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }\n   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }\n   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }\n   * @return {Duration}\n   */\n  static fromISO(text, opts) {\n    const [parsed] = parseISODuration(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 time string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }\n   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @return {Duration}\n   */\n  static fromISOTime(text, opts) {\n    const [parsed] = parseISOTimeOnly(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create an invalid Duration.\n   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Duration}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Duration is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDurationError(invalid);\n    } else {\n      return new Duration({ invalid });\n    }\n  }\n\n  /**\n   * @private\n   */\n  static normalizeUnit(unit) {\n    const normalized = {\n      year: \"years\",\n      years: \"years\",\n      quarter: \"quarters\",\n      quarters: \"quarters\",\n      month: \"months\",\n      months: \"months\",\n      week: \"weeks\",\n      weeks: \"weeks\",\n      day: \"days\",\n      days: \"days\",\n      hour: \"hours\",\n      hours: \"hours\",\n      minute: \"minutes\",\n      minutes: \"minutes\",\n      second: \"seconds\",\n      seconds: \"seconds\",\n      millisecond: \"milliseconds\",\n      milliseconds: \"milliseconds\",\n    }[unit ? unit.toLowerCase() : unit];\n\n    if (!normalized) throw new InvalidUnitError(unit);\n\n    return normalized;\n  }\n\n  /**\n   * Check if an object is a Duration. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDuration(o) {\n    return (o && o.isLuxonDuration) || false;\n  }\n\n  /**\n   * Get  the locale of a Duration, such 'en-GB'\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:\n   * * `S` for milliseconds\n   * * `s` for seconds\n   * * `m` for minutes\n   * * `h` for hours\n   * * `d` for days\n   * * `w` for weeks\n   * * `M` for months\n   * * `y` for years\n   * Notes:\n   * * Add padding by repeating the token, e.g. \"yy\" pads the years to two digits, \"hhhh\" pads the hours out to four digits\n   * * Tokens can be escaped by wrapping with single quotes.\n   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - options\n   * @param {boolean} [opts.floor=true] - floor numerical values\n   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"y d s\") //=> \"1 6 2\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"yy dd sss\") //=> \"01 06 002\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"M S\") //=> \"12 518402000\"\n   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"+6 +2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"-6 -2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"negativeLargestOnly\" }) //=> \"-6 2\"\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    // reverse-compat since 1.2; we always round down now, never up, and we do it by default\n    const fmtOpts = {\n      ...opts,\n      floor: opts.round !== false && opts.floor !== false,\n    };\n    return this.isValid\n      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a string representation of a Duration with all units included.\n   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options\n   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.\n   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.\n   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero\n   * @example\n   * ```js\n   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })\n   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'\n   * dur.toHuman({ listStyle: \"long\" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'\n   * dur.toHuman({ unitDisplay: \"short\" }) //=> '1 mth, 0 wks, 5 hr, 6 min'\n   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'\n   * ```\n   */\n  toHuman(opts = {}) {\n    if (!this.isValid) return INVALID;\n\n    const showZeros = opts.showZeros !== false;\n\n    const l = orderedUnits\n      .map((unit) => {\n        const val = this.values[unit];\n        if (isUndefined(val) || (val === 0 && !showZeros)) {\n          return null;\n        }\n        return this.loc\n          .numberFormatter({ style: \"unit\", unitDisplay: \"long\", ...opts, unit: unit.slice(0, -1) })\n          .format(val);\n      })\n      .filter((n) => n);\n\n    return this.loc\n      .listFormatter({ type: \"conjunction\", style: opts.listStyle || \"narrow\", ...opts })\n      .format(l);\n  }\n\n  /**\n   * Returns a JavaScript object with this Duration's values.\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }\n   * @return {Object}\n   */\n  toObject() {\n    if (!this.isValid) return {};\n    return { ...this.values };\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'\n   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'\n   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'\n   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'\n   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'\n   * @return {string}\n   */\n  toISO() {\n    // we could use the formatter, but this is an easier way to get the minimum string\n    if (!this.isValid) return null;\n\n    let s = \"P\";\n    if (this.years !== 0) s += this.years + \"Y\";\n    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + \"M\";\n    if (this.weeks !== 0) s += this.weeks + \"W\";\n    if (this.days !== 0) s += this.days + \"D\";\n    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)\n      s += \"T\";\n    if (this.hours !== 0) s += this.hours + \"H\";\n    if (this.minutes !== 0) s += this.minutes + \"M\";\n    if (this.seconds !== 0 || this.milliseconds !== 0)\n      // this will handle \"floating point madness\" by removing extra decimal places\n      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken\n      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + \"S\";\n    if (s === \"P\") s += \"T0S\";\n    return s;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.\n   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'\n   * @return {string}\n   */\n  toISOTime(opts = {}) {\n    if (!this.isValid) return null;\n\n    const millis = this.toMillis();\n    if (millis < 0 || millis >= 86400000) return null;\n\n    opts = {\n      suppressMilliseconds: false,\n      suppressSeconds: false,\n      includePrefix: false,\n      format: \"extended\",\n      ...opts,\n      includeOffset: false,\n    };\n\n    const dateTime = DateTime.fromMillis(millis, { zone: \"UTC\" });\n    return dateTime.toISOTime(opts);\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.\n   * @return {string}\n   */\n  toString() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a string representation of this Duration appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Duration { values: ${JSON.stringify(this.values)} }`;\n    } else {\n      return `Duration { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration.\n   * @return {number}\n   */\n  toMillis() {\n    if (!this.isValid) return NaN;\n\n    return durationToMillis(this.matrix, this.values);\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration),\n      result = {};\n\n    for (const k of orderedUnits) {\n      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {\n        result[k] = dur.get(k) + this.get(k);\n      }\n    }\n\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration);\n    return this.plus(dur.negate());\n  }\n\n  /**\n   * Scale this Duration by the specified amount. Return a newly-constructed Duration.\n   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === \"hours\" ? x * 2 : x) //=> { hours: 2, minutes: 30 }\n   * @return {Duration}\n   */\n  mapUnits(fn) {\n    if (!this.isValid) return this;\n    const result = {};\n    for (const k of Object.keys(this.values)) {\n      result[k] = asNumber(fn(this.values[k], k));\n    }\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2\n   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0\n   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3\n   * @return {number}\n   */\n  get(unit) {\n    return this[Duration.normalizeUnit(unit)];\n  }\n\n  /**\n   * \"Set\" the values of specified units. Return a newly-constructed Duration.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dur.set({ years: 2017 })\n   * @example dur.set({ hours: 8, minutes: 30 })\n   * @return {Duration}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };\n    return clone(this, { values: mixed });\n  }\n\n  /**\n   * \"Set\" the locale and/or numberingSystem.  Returns a newly-constructed Duration.\n   * @example dur.reconfigure({ locale: 'en-GB' })\n   * @return {Duration}\n   */\n  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem });\n    const opts = { loc, matrix, conversionAccuracy };\n    return clone(this, opts);\n  }\n\n  /**\n   * Return the length of the duration in the specified unit.\n   * @param {string} unit - a unit such as 'minutes' or 'days'\n   * @example Duration.fromObject({years: 1}).as('days') //=> 365\n   * @example Duration.fromObject({years: 1}).as('months') //=> 12\n   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5\n   * @return {number}\n   */\n  as(unit) {\n    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;\n  }\n\n  /**\n   * Reduce this Duration to its canonical representation in its current units.\n   * Assuming the overall value of the Duration is positive, this means:\n   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)\n   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise\n   *   the overall value would be negative, see third example)\n   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)\n   *\n   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.\n   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }\n   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }\n   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }\n   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }\n   * @return {Duration}\n   */\n  normalize() {\n    if (!this.isValid) return this;\n    const vals = this.toObject();\n    normalizeValues(this.matrix, vals);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Rescale units to its largest representation\n   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }\n   * @return {Duration}\n   */\n  rescale() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.normalize().shiftToAll().toObject());\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Convert this Duration into its representation in a different set of units.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }\n   * @return {Duration}\n   */\n  shiftTo(...units) {\n    if (!this.isValid) return this;\n\n    if (units.length === 0) {\n      return this;\n    }\n\n    units = units.map((u) => Duration.normalizeUnit(u));\n\n    const built = {},\n      accumulated = {},\n      vals = this.toObject();\n    let lastUnit;\n\n    for (const k of orderedUnits) {\n      if (units.indexOf(k) >= 0) {\n        lastUnit = k;\n\n        let own = 0;\n\n        // anything we haven't boiled down yet should get boiled to this unit\n        for (const ak in accumulated) {\n          own += this.matrix[ak][k] * accumulated[ak];\n          accumulated[ak] = 0;\n        }\n\n        // plus anything that's already in this unit\n        if (isNumber(vals[k])) {\n          own += vals[k];\n        }\n\n        // only keep the integer part for now in the hopes of putting any decimal part\n        // into a smaller unit later\n        const i = Math.trunc(own);\n        built[k] = i;\n        accumulated[k] = (own * 1000 - i * 1000) / 1000;\n\n        // otherwise, keep it in the wings to boil it later\n      } else if (isNumber(vals[k])) {\n        accumulated[k] = vals[k];\n      }\n    }\n\n    // anything leftover becomes the decimal for the last unit\n    // lastUnit must be defined since units is not empty\n    for (const key in accumulated) {\n      if (accumulated[key] !== 0) {\n        built[lastUnit] +=\n          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];\n      }\n    }\n\n    normalizeValues(this.matrix, built);\n    return clone(this, { values: built }, true);\n  }\n\n  /**\n   * Shift this Duration to all available units.\n   * Same as shiftTo(\"years\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", \"seconds\", \"milliseconds\")\n   * @return {Duration}\n   */\n  shiftToAll() {\n    if (!this.isValid) return this;\n    return this.shiftTo(\n      \"years\",\n      \"months\",\n      \"weeks\",\n      \"days\",\n      \"hours\",\n      \"minutes\",\n      \"seconds\",\n      \"milliseconds\"\n    );\n  }\n\n  /**\n   * Return the negative of this Duration.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }\n   * @return {Duration}\n   */\n  negate() {\n    if (!this.isValid) return this;\n    const negated = {};\n    for (const k of Object.keys(this.values)) {\n      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];\n    }\n    return clone(this, { values: negated }, true);\n  }\n\n  /**\n   * Removes all units with values equal to 0 from this Duration.\n   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }\n   * @return {Duration}\n   */\n  removeZeros() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.values);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Get the years.\n   * @type {number}\n   */\n  get years() {\n    return this.isValid ? this.values.years || 0 : NaN;\n  }\n\n  /**\n   * Get the quarters.\n   * @type {number}\n   */\n  get quarters() {\n    return this.isValid ? this.values.quarters || 0 : NaN;\n  }\n\n  /**\n   * Get the months.\n   * @type {number}\n   */\n  get months() {\n    return this.isValid ? this.values.months || 0 : NaN;\n  }\n\n  /**\n   * Get the weeks\n   * @type {number}\n   */\n  get weeks() {\n    return this.isValid ? this.values.weeks || 0 : NaN;\n  }\n\n  /**\n   * Get the days.\n   * @type {number}\n   */\n  get days() {\n    return this.isValid ? this.values.days || 0 : NaN;\n  }\n\n  /**\n   * Get the hours.\n   * @type {number}\n   */\n  get hours() {\n    return this.isValid ? this.values.hours || 0 : NaN;\n  }\n\n  /**\n   * Get the minutes.\n   * @type {number}\n   */\n  get minutes() {\n    return this.isValid ? this.values.minutes || 0 : NaN;\n  }\n\n  /**\n   * Get the seconds.\n   * @return {number}\n   */\n  get seconds() {\n    return this.isValid ? this.values.seconds || 0 : NaN;\n  }\n\n  /**\n   * Get the milliseconds.\n   * @return {number}\n   */\n  get milliseconds() {\n    return this.isValid ? this.values.milliseconds || 0 : NaN;\n  }\n\n  /**\n   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations\n   * on invalid DateTimes or Intervals.\n   * @return {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this Duration became invalid, or null if the Duration is valid\n   * @return {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Equality check\n   * Two Durations are equal iff they have the same units and the same values for each unit.\n   * @param {Duration} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    if (!this.loc.equals(other.loc)) {\n      return false;\n    }\n\n    function eq(v1, v2) {\n      // Consider 0 and undefined as equal\n      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;\n      return v1 === v2;\n    }\n\n    for (const u of orderedUnits) {\n      if (!eq(this.values[u], other.values[u])) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n","import DateTime, { friendlyDateTime } from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Settings from \"./settings.js\";\nimport { InvalidArgumentError, InvalidIntervalError } from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport * as Formats from \"./impl/formats.js\";\n\nconst INVALID = \"Invalid Interval\";\n\n// checks if the start is equal to or before the end\nfunction validateStartEnd(start, end) {\n  if (!start || !start.isValid) {\n    return Interval.invalid(\"missing or invalid start\");\n  } else if (!end || !end.isValid) {\n    return Interval.invalid(\"missing or invalid end\");\n  } else if (end < start) {\n    return Interval.invalid(\n      \"end before start\",\n      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`\n    );\n  } else {\n    return null;\n  }\n}\n\n/**\n * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.\n *\n * Here is a brief overview of the most commonly used methods and getters in Interval:\n *\n * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.\n * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.\n * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.\n * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.\n * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}\n * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.\n */\nexport default class Interval {\n  /**\n   * @private\n   */\n  constructor(config) {\n    /**\n     * @access private\n     */\n    this.s = config.start;\n    /**\n     * @access private\n     */\n    this.e = config.end;\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.isLuxonInterval = true;\n  }\n\n  /**\n   * Create an invalid Interval.\n   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Interval}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Interval is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidIntervalError(invalid);\n    } else {\n      return new Interval({ invalid });\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.\n   * @param {DateTime|Date|Object} start\n   * @param {DateTime|Date|Object} end\n   * @return {Interval}\n   */\n  static fromDateTimes(start, end) {\n    const builtStart = friendlyDateTime(start),\n      builtEnd = friendlyDateTime(end);\n\n    const validateError = validateStartEnd(builtStart, builtEnd);\n\n    if (validateError == null) {\n      return new Interval({\n        start: builtStart,\n        end: builtEnd,\n      });\n    } else {\n      return validateError;\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and a Duration to extend to.\n   * @param {DateTime|Date|Object} start\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static after(start, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(start);\n    return Interval.fromDateTimes(dt, dt.plus(dur));\n  }\n\n  /**\n   * Create an Interval from an end DateTime and a Duration to extend backwards to.\n   * @param {DateTime|Date|Object} end\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static before(end, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(end);\n    return Interval.fromDateTimes(dt.minus(dur), dt);\n  }\n\n  /**\n   * Create an Interval from an ISO 8601 string.\n   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.\n   * @param {string} text - the ISO string to parse\n   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {Interval}\n   */\n  static fromISO(text, opts) {\n    const [s, e] = (text || \"\").split(\"/\", 2);\n    if (s && e) {\n      let start, startIsValid;\n      try {\n        start = DateTime.fromISO(s, opts);\n        startIsValid = start.isValid;\n      } catch (e) {\n        startIsValid = false;\n      }\n\n      let end, endIsValid;\n      try {\n        end = DateTime.fromISO(e, opts);\n        endIsValid = end.isValid;\n      } catch (e) {\n        endIsValid = false;\n      }\n\n      if (startIsValid && endIsValid) {\n        return Interval.fromDateTimes(start, end);\n      }\n\n      if (startIsValid) {\n        const dur = Duration.fromISO(e, opts);\n        if (dur.isValid) {\n          return Interval.after(start, dur);\n        }\n      } else if (endIsValid) {\n        const dur = Duration.fromISO(s, opts);\n        if (dur.isValid) {\n          return Interval.before(end, dur);\n        }\n      }\n    }\n    return Interval.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n  }\n\n  /**\n   * Check if an object is an Interval. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isInterval(o) {\n    return (o && o.isLuxonInterval) || false;\n  }\n\n  /**\n   * Returns the start of the Interval\n   * @type {DateTime}\n   */\n  get start() {\n    return this.isValid ? this.s : null;\n  }\n\n  /**\n   * Returns the end of the Interval. This is the first instant which is not part of the interval\n   * (Interval is half-open).\n   * @type {DateTime}\n   */\n  get end() {\n    return this.isValid ? this.e : null;\n  }\n\n  /**\n   * Returns the last DateTime included in the interval (since end is not part of the interval)\n   * @type {DateTime}\n   */\n  get lastDateTime() {\n    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;\n  }\n\n  /**\n   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalidReason === null;\n  }\n\n  /**\n   * Returns an error code if this Interval is invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Returns the length of the Interval in the specified unit.\n   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.\n   * @return {number}\n   */\n  length(unit = \"milliseconds\") {\n    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;\n  }\n\n  /**\n   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.\n   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'\n   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'\n   * @param {string} [unit='milliseconds'] - the unit of time to count.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime\n   * @return {number}\n   */\n  count(unit = \"milliseconds\", opts) {\n    if (!this.isValid) return NaN;\n    const start = this.start.startOf(unit, opts);\n    let end;\n    if (opts?.useLocaleWeeks) {\n      end = this.end.reconfigure({ locale: start.locale });\n    } else {\n      end = this.end;\n    }\n    end = end.startOf(unit, opts);\n    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());\n  }\n\n  /**\n   * Returns whether this Interval's start and end are both in the same unit of time\n   * @param {string} unit - the unit of time to check sameness on\n   * @return {boolean}\n   */\n  hasSame(unit) {\n    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end DateTimes.\n   * @return {boolean}\n   */\n  isEmpty() {\n    return this.s.valueOf() === this.e.valueOf();\n  }\n\n  /**\n   * Return whether this Interval's start is after the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isAfter(dateTime) {\n    if (!this.isValid) return false;\n    return this.s > dateTime;\n  }\n\n  /**\n   * Return whether this Interval's end is before the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isBefore(dateTime) {\n    if (!this.isValid) return false;\n    return this.e <= dateTime;\n  }\n\n  /**\n   * Return whether this Interval contains the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  contains(dateTime) {\n    if (!this.isValid) return false;\n    return this.s <= dateTime && this.e > dateTime;\n  }\n\n  /**\n   * \"Sets\" the start and/or end dates. Returns a newly-constructed Interval.\n   * @param {Object} values - the values to set\n   * @param {DateTime} values.start - the starting DateTime\n   * @param {DateTime} values.end - the ending DateTime\n   * @return {Interval}\n   */\n  set({ start, end } = {}) {\n    if (!this.isValid) return this;\n    return Interval.fromDateTimes(start || this.s, end || this.e);\n  }\n\n  /**\n   * Split this Interval at each of the specified DateTimes\n   * @param {...DateTime} dateTimes - the unit of time to count.\n   * @return {Array}\n   */\n  splitAt(...dateTimes) {\n    if (!this.isValid) return [];\n    const sorted = dateTimes\n        .map(friendlyDateTime)\n        .filter((d) => this.contains(d))\n        .sort((a, b) => a.toMillis() - b.toMillis()),\n      results = [];\n    let { s } = this,\n      i = 0;\n\n    while (s < this.e) {\n      const added = sorted[i] || this.e,\n        next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      i += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into smaller Intervals, each of the specified length.\n   * Left over time is grouped into a smaller interval\n   * @param {Duration|Object|number} duration - The length of each resulting interval.\n   * @return {Array}\n   */\n  splitBy(duration) {\n    const dur = Duration.fromDurationLike(duration);\n\n    if (!this.isValid || !dur.isValid || dur.as(\"milliseconds\") === 0) {\n      return [];\n    }\n\n    let { s } = this,\n      idx = 1,\n      next;\n\n    const results = [];\n    while (s < this.e) {\n      const added = this.start.plus(dur.mapUnits((x) => x * idx));\n      next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      idx += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into the specified number of smaller intervals.\n   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.\n   * @return {Array}\n   */\n  divideEqually(numberOfParts) {\n    if (!this.isValid) return [];\n    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);\n  }\n\n  /**\n   * Return whether this Interval overlaps with the specified Interval\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  overlaps(other) {\n    return this.e > other.s && this.s < other.e;\n  }\n\n  /**\n   * Return whether this Interval's end is adjacent to the specified Interval's start.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsStart(other) {\n    if (!this.isValid) return false;\n    return +this.e === +other.s;\n  }\n\n  /**\n   * Return whether this Interval's start is adjacent to the specified Interval's end.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsEnd(other) {\n    if (!this.isValid) return false;\n    return +other.e === +this.s;\n  }\n\n  /**\n   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  engulfs(other) {\n    if (!this.isValid) return false;\n    return this.s <= other.s && this.e >= other.e;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end as the specified Interval.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    return this.s.equals(other.s) && this.e.equals(other.e);\n  }\n\n  /**\n   * Return an Interval representing the intersection of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.\n   * Returns null if the intersection is empty, meaning, the intervals don't intersect.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  intersection(other) {\n    if (!this.isValid) return this;\n    const s = this.s > other.s ? this.s : other.s,\n      e = this.e < other.e ? this.e : other.e;\n\n    if (s >= e) {\n      return null;\n    } else {\n      return Interval.fromDateTimes(s, e);\n    }\n  }\n\n  /**\n   * Return an Interval representing the union of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  union(other) {\n    if (!this.isValid) return this;\n    const s = this.s < other.s ? this.s : other.s,\n      e = this.e > other.e ? this.e : other.e;\n    return Interval.fromDateTimes(s, e);\n  }\n\n  /**\n   * Merge an array of Intervals into an equivalent minimal set of Intervals.\n   * Combines overlapping and adjacent Intervals.\n   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval\n   * and ending with the latest.\n   *\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static merge(intervals) {\n    const [found, final] = intervals\n      .sort((a, b) => a.s - b.s)\n      .reduce(\n        ([sofar, current], item) => {\n          if (!current) {\n            return [sofar, item];\n          } else if (current.overlaps(item) || current.abutsStart(item)) {\n            return [sofar, current.union(item)];\n          } else {\n            return [sofar.concat([current]), item];\n          }\n        },\n        [[], null]\n      );\n    if (final) {\n      found.push(final);\n    }\n    return found;\n  }\n\n  /**\n   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static xor(intervals) {\n    let start = null,\n      currentCount = 0;\n    const results = [],\n      ends = intervals.map((i) => [\n        { time: i.s, type: \"s\" },\n        { time: i.e, type: \"e\" },\n      ]),\n      flattened = Array.prototype.concat(...ends),\n      arr = flattened.sort((a, b) => a.time - b.time);\n\n    for (const i of arr) {\n      currentCount += i.type === \"s\" ? 1 : -1;\n\n      if (currentCount === 1) {\n        start = i.time;\n      } else {\n        if (start && +start !== +i.time) {\n          results.push(Interval.fromDateTimes(start, i.time));\n        }\n\n        start = null;\n      }\n    }\n\n    return Interval.merge(results);\n  }\n\n  /**\n   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.\n   * @param {...Interval} intervals\n   * @return {Array}\n   */\n  difference(...intervals) {\n    return Interval.xor([this].concat(intervals))\n      .map((i) => this.intersection(i))\n      .filter((i) => i && !i.isEmpty());\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for debugging.\n   * @return {string}\n   */\n  toString() {\n    if (!this.isValid) return INVALID;\n    return `[${this.s.toISO()} – ${this.e.toISO()})`;\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;\n    } else {\n      return `Interval { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns a localized string representing this Interval. Accepts the same options as the\n   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as\n   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method\n   * is browser-specific, but in general it will return an appropriate representation of the\n   * Interval in the assigned locale. Defaults to the system's locale if no locale has been\n   * specified.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or\n   * Intl.DateTimeFormat constructor options.\n   * @param {Object} opts - Options to override the configuration of the start DateTime.\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Interval.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISO(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of date of this Interval.\n   * The time components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {string}\n   */\n  toISODate() {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISODate()}/${this.e.toISODate()}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of time of this Interval.\n   * The date components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISOTime(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this Interval formatted according to the specified format\n   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible\n   * formatting tool.\n   * @param {string} dateFormat - The format string. This string formats the start and end time.\n   * See {@link DateTime#toFormat} for details.\n   * @param {Object} opts - Options.\n   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end\n   * representations.\n   * @return {string}\n   */\n  toFormat(dateFormat, { separator = \" – \" } = {}) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;\n  }\n\n  /**\n   * Return a Duration representing the time spanned by this interval.\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }\n   * @return {Duration}\n   */\n  toDuration(unit, opts) {\n    if (!this.isValid) {\n      return Duration.invalid(this.invalidReason);\n    }\n    return this.e.diff(this.s, unit, opts);\n  }\n\n  /**\n   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes\n   * @param {function} mapFn\n   * @return {Interval}\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))\n   */\n  mapEndpoints(mapFn) {\n    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Settings from \"./settings.js\";\nimport Locale from \"./impl/locale.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\n\nimport { hasLocaleWeekInfo, hasRelative } from \"./impl/util.js\";\n\n/**\n * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.\n */\nexport default class Info {\n  /**\n   * Return whether the specified zone contains a DST.\n   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.\n   * @return {boolean}\n   */\n  static hasDST(zone = Settings.defaultZone) {\n    const proto = DateTime.now().setZone(zone).set({ month: 12 });\n\n    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;\n  }\n\n  /**\n   * Return whether the specified zone is a valid IANA specifier.\n   * @param {string} zone - Zone to check\n   * @return {boolean}\n   */\n  static isValidIANAZone(zone) {\n    return IANAZone.isValidZone(zone);\n  }\n\n  /**\n   * Converts the input into a {@link Zone} instance.\n   *\n   * * If `input` is already a Zone instance, it is returned unchanged.\n   * * If `input` is a string containing a valid time zone name, a Zone instance\n   *   with that name is returned.\n   * * If `input` is a string that doesn't refer to a known time zone, a Zone\n   *   instance with {@link Zone#isValid} == false is returned.\n   * * If `input is a number, a Zone instance with the specified fixed offset\n   *   in minutes is returned.\n   * * If `input` is `null` or `undefined`, the default zone is returned.\n   * @param {string|Zone|number} [input] - the value to be converted\n   * @return {Zone}\n   */\n  static normalizeZone(input) {\n    return normalizeZone(input, Settings.defaultZone);\n  }\n\n  /**\n   * Get the weekday on which the week starts according to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday\n   */\n  static getStartOfWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getStartOfWeek();\n  }\n\n  /**\n   * Get the minimum number of days necessary in a week before it is considered part of the next year according\n   * to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number}\n   */\n  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();\n  }\n\n  /**\n   * Get the weekdays, which are considered the weekend according to the given locale\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday\n   */\n  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {\n    // copy the array, because we cache it internally\n    return (locObj || Locale.create(locale)).getWeekendDays().slice();\n  }\n\n  /**\n   * Return an array of standalone month names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @example Info.months()[0] //=> 'January'\n   * @example Info.months('short')[0] //=> 'Jan'\n   * @example Info.months('numeric')[0] //=> '1'\n   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'\n   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'\n   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'\n   * @return {Array}\n   */\n  static months(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);\n  }\n\n  /**\n   * Return an array of format month names.\n   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that\n   * changes the string.\n   * See {@link Info#months}\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @return {Array}\n   */\n  static monthsFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);\n  }\n\n  /**\n   * Return an array of standalone week names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the weekday representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @example Info.weekdays()[0] //=> 'Monday'\n   * @example Info.weekdays('short')[0] //=> 'Mon'\n   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'\n   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'\n   * @return {Array}\n   */\n  static weekdays(length = \"long\", { locale = null, numberingSystem = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);\n  }\n\n  /**\n   * Return an array of format week names.\n   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that\n   * changes the string.\n   * See {@link Info#weekdays}\n   * @param {string} [length='long'] - the length of the month representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale=null] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @return {Array}\n   */\n  static weekdaysFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);\n  }\n\n  /**\n   * Return an array of meridiems.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.meridiems() //=> [ 'AM', 'PM' ]\n   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]\n   * @return {Array}\n   */\n  static meridiems({ locale = null } = {}) {\n    return Locale.create(locale).meridiems();\n  }\n\n  /**\n   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.\n   * @param {string} [length='short'] - the length of the era representation, such as \"short\" or \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.eras() //=> [ 'BC', 'AD' ]\n   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]\n   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]\n   * @return {Array}\n   */\n  static eras(length = \"short\", { locale = null } = {}) {\n    return Locale.create(locale, null, \"gregory\").eras(length);\n  }\n\n  /**\n   * Return the set of available features in this environment.\n   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.\n   * Keys:\n   * * `relative`: whether this environment supports relative time formatting\n   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale\n   * @example Info.features() //=> { relative: false, localeWeek: true }\n   * @return {Object}\n   */\n  static features() {\n    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };\n  }\n}\n","import Duration from \"../duration.js\";\n\nfunction dayDiff(earlier, later) {\n  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf(\"day\").valueOf(),\n    ms = utcDayStart(later) - utcDayStart(earlier);\n  return Math.floor(Duration.fromMillis(ms).as(\"days\"));\n}\n\nfunction highOrderDiffs(cursor, later, units) {\n  const differs = [\n    [\"years\", (a, b) => b.year - a.year],\n    [\"quarters\", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],\n    [\"months\", (a, b) => b.month - a.month + (b.year - a.year) * 12],\n    [\n      \"weeks\",\n      (a, b) => {\n        const days = dayDiff(a, b);\n        return (days - (days % 7)) / 7;\n      },\n    ],\n    [\"days\", dayDiff],\n  ];\n\n  const results = {};\n  const earlier = cursor;\n  let lowestOrder, highWater;\n\n  /* This loop tries to diff using larger units first.\n     If we overshoot, we backtrack and try the next smaller unit.\n     \"cursor\" starts out at the earlier timestamp and moves closer and closer to \"later\"\n     as we use smaller and smaller units.\n     highWater keeps track of where we would be if we added one more of the smallest unit,\n     this is used later to potentially convert any difference smaller than the smallest higher order unit\n     into a fraction of that smallest higher order unit\n  */\n  for (const [unit, differ] of differs) {\n    if (units.indexOf(unit) >= 0) {\n      lowestOrder = unit;\n\n      results[unit] = differ(cursor, later);\n      highWater = earlier.plus(results);\n\n      if (highWater > later) {\n        // we overshot the end point, backtrack cursor by 1\n        results[unit]--;\n        cursor = earlier.plus(results);\n\n        // if we are still overshooting now, we need to backtrack again\n        // this happens in certain situations when diffing times in different zones,\n        // because this calculation ignores time zones\n        if (cursor > later) {\n          // keep the \"overshot by 1\" around as highWater\n          highWater = cursor;\n          // backtrack cursor by 1\n          results[unit]--;\n          cursor = earlier.plus(results);\n        }\n      } else {\n        cursor = highWater;\n      }\n    }\n  }\n\n  return [cursor, results, highWater, lowestOrder];\n}\n\nexport default function (earlier, later, units, opts) {\n  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);\n\n  const remainingMillis = later - cursor;\n\n  const lowerOrderUnits = units.filter(\n    (u) => [\"hours\", \"minutes\", \"seconds\", \"milliseconds\"].indexOf(u) >= 0\n  );\n\n  if (lowerOrderUnits.length === 0) {\n    if (highWater < later) {\n      highWater = cursor.plus({ [lowestOrder]: 1 });\n    }\n\n    if (highWater !== cursor) {\n      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);\n    }\n  }\n\n  const duration = Duration.fromObject(results, opts);\n\n  if (lowerOrderUnits.length > 0) {\n    return Duration.fromMillis(remainingMillis, opts)\n      .shiftTo(...lowerOrderUnits)\n      .plus(duration);\n  } else {\n    return duration;\n  }\n}\n","import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from \"./util.js\";\nimport Formatter from \"./formatter.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport DateTime from \"../datetime.js\";\nimport { digitRegex, parseDigits } from \"./digits.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst MISSING_FTP = \"missing Intl.DateTimeFormat.formatToParts support\";\n\nfunction intUnit(regex, post = (i) => i) {\n  return { regex, deser: ([s]) => post(parseDigits(s)) };\n}\n\nconst NBSP = String.fromCharCode(160);\nconst spaceOrNBSP = `[ ${NBSP}]`;\nconst spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, \"g\");\n\nfunction fixListRegex(s) {\n  // make dots optional and also make them literal\n  // make space and non breakable space characters interchangeable\n  return s.replace(/\\./g, \"\\\\.?\").replace(spaceOrNBSPRegExp, spaceOrNBSP);\n}\n\nfunction stripInsensitivities(s) {\n  return s\n    .replace(/\\./g, \"\") // ignore dots that were made optional\n    .replace(spaceOrNBSPRegExp, \" \") // interchange space and nbsp\n    .toLowerCase();\n}\n\nfunction oneOf(strings, startIndex) {\n  if (strings === null) {\n    return null;\n  } else {\n    return {\n      regex: RegExp(strings.map(fixListRegex).join(\"|\")),\n      deser: ([s]) =>\n        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,\n    };\n  }\n}\n\nfunction offset(regex, groups) {\n  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };\n}\n\nfunction simple(regex) {\n  return { regex, deser: ([s]) => s };\n}\n\nfunction escapeToken(value) {\n  return value.replace(/[\\-\\[\\]{}()*+?.,\\\\\\^$|#\\s]/g, \"\\\\$&\");\n}\n\n/**\n * @param token\n * @param {Locale} loc\n */\nfunction unitForToken(token, loc) {\n  const one = digitRegex(loc),\n    two = digitRegex(loc, \"{2}\"),\n    three = digitRegex(loc, \"{3}\"),\n    four = digitRegex(loc, \"{4}\"),\n    six = digitRegex(loc, \"{6}\"),\n    oneOrTwo = digitRegex(loc, \"{1,2}\"),\n    oneToThree = digitRegex(loc, \"{1,3}\"),\n    oneToSix = digitRegex(loc, \"{1,6}\"),\n    oneToNine = digitRegex(loc, \"{1,9}\"),\n    twoToFour = digitRegex(loc, \"{2,4}\"),\n    fourToSix = digitRegex(loc, \"{4,6}\"),\n    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),\n    unitate = (t) => {\n      if (token.literal) {\n        return literal(t);\n      }\n      switch (t.val) {\n        // era\n        case \"G\":\n          return oneOf(loc.eras(\"short\"), 0);\n        case \"GG\":\n          return oneOf(loc.eras(\"long\"), 0);\n        // years\n        case \"y\":\n          return intUnit(oneToSix);\n        case \"yy\":\n          return intUnit(twoToFour, untruncateYear);\n        case \"yyyy\":\n          return intUnit(four);\n        case \"yyyyy\":\n          return intUnit(fourToSix);\n        case \"yyyyyy\":\n          return intUnit(six);\n        // months\n        case \"M\":\n          return intUnit(oneOrTwo);\n        case \"MM\":\n          return intUnit(two);\n        case \"MMM\":\n          return oneOf(loc.months(\"short\", true), 1);\n        case \"MMMM\":\n          return oneOf(loc.months(\"long\", true), 1);\n        case \"L\":\n          return intUnit(oneOrTwo);\n        case \"LL\":\n          return intUnit(two);\n        case \"LLL\":\n          return oneOf(loc.months(\"short\", false), 1);\n        case \"LLLL\":\n          return oneOf(loc.months(\"long\", false), 1);\n        // dates\n        case \"d\":\n          return intUnit(oneOrTwo);\n        case \"dd\":\n          return intUnit(two);\n        // ordinals\n        case \"o\":\n          return intUnit(oneToThree);\n        case \"ooo\":\n          return intUnit(three);\n        // time\n        case \"HH\":\n          return intUnit(two);\n        case \"H\":\n          return intUnit(oneOrTwo);\n        case \"hh\":\n          return intUnit(two);\n        case \"h\":\n          return intUnit(oneOrTwo);\n        case \"mm\":\n          return intUnit(two);\n        case \"m\":\n          return intUnit(oneOrTwo);\n        case \"q\":\n          return intUnit(oneOrTwo);\n        case \"qq\":\n          return intUnit(two);\n        case \"s\":\n          return intUnit(oneOrTwo);\n        case \"ss\":\n          return intUnit(two);\n        case \"S\":\n          return intUnit(oneToThree);\n        case \"SSS\":\n          return intUnit(three);\n        case \"u\":\n          return simple(oneToNine);\n        case \"uu\":\n          return simple(oneOrTwo);\n        case \"uuu\":\n          return intUnit(one);\n        // meridiem\n        case \"a\":\n          return oneOf(loc.meridiems(), 0);\n        // weekYear (k)\n        case \"kkkk\":\n          return intUnit(four);\n        case \"kk\":\n          return intUnit(twoToFour, untruncateYear);\n        // weekNumber (W)\n        case \"W\":\n          return intUnit(oneOrTwo);\n        case \"WW\":\n          return intUnit(two);\n        // weekdays\n        case \"E\":\n        case \"c\":\n          return intUnit(one);\n        case \"EEE\":\n          return oneOf(loc.weekdays(\"short\", false), 1);\n        case \"EEEE\":\n          return oneOf(loc.weekdays(\"long\", false), 1);\n        case \"ccc\":\n          return oneOf(loc.weekdays(\"short\", true), 1);\n        case \"cccc\":\n          return oneOf(loc.weekdays(\"long\", true), 1);\n        // offset/zone\n        case \"Z\":\n        case \"ZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);\n        case \"ZZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);\n        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing\n        // because we don't have any way to figure out what they are\n        case \"z\":\n          return simple(/[a-z_+-/]{1,256}?/i);\n        // this special-case \"token\" represents a place where a macro-token expanded into a white-space literal\n        // in this case we accept any non-newline white-space\n        case \" \":\n          return simple(/[^\\S\\n\\r]/);\n        default:\n          return literal(t);\n      }\n    };\n\n  const unit = unitate(token) || {\n    invalidReason: MISSING_FTP,\n  };\n\n  unit.token = token;\n\n  return unit;\n}\n\nconst partTypeStyleToTokenVal = {\n  year: {\n    \"2-digit\": \"yy\",\n    numeric: \"yyyyy\",\n  },\n  month: {\n    numeric: \"M\",\n    \"2-digit\": \"MM\",\n    short: \"MMM\",\n    long: \"MMMM\",\n  },\n  day: {\n    numeric: \"d\",\n    \"2-digit\": \"dd\",\n  },\n  weekday: {\n    short: \"EEE\",\n    long: \"EEEE\",\n  },\n  dayperiod: \"a\",\n  dayPeriod: \"a\",\n  hour12: {\n    numeric: \"h\",\n    \"2-digit\": \"hh\",\n  },\n  hour24: {\n    numeric: \"H\",\n    \"2-digit\": \"HH\",\n  },\n  minute: {\n    numeric: \"m\",\n    \"2-digit\": \"mm\",\n  },\n  second: {\n    numeric: \"s\",\n    \"2-digit\": \"ss\",\n  },\n  timeZoneName: {\n    long: \"ZZZZZ\",\n    short: \"ZZZ\",\n  },\n};\n\nfunction tokenForPart(part, formatOpts, resolvedOpts) {\n  const { type, value } = part;\n\n  if (type === \"literal\") {\n    const isSpace = /^\\s+$/.test(value);\n    return {\n      literal: !isSpace,\n      val: isSpace ? \" \" : value,\n    };\n  }\n\n  const style = formatOpts[type];\n\n  // The user might have explicitly specified hour12 or hourCycle\n  // if so, respect their decision\n  // if not, refer back to the resolvedOpts, which are based on the locale\n  let actualType = type;\n  if (type === \"hour\") {\n    if (formatOpts.hour12 != null) {\n      actualType = formatOpts.hour12 ? \"hour12\" : \"hour24\";\n    } else if (formatOpts.hourCycle != null) {\n      if (formatOpts.hourCycle === \"h11\" || formatOpts.hourCycle === \"h12\") {\n        actualType = \"hour12\";\n      } else {\n        actualType = \"hour24\";\n      }\n    } else {\n      // tokens only differentiate between 24 hours or not,\n      // so we do not need to check hourCycle here, which is less supported anyways\n      actualType = resolvedOpts.hour12 ? \"hour12\" : \"hour24\";\n    }\n  }\n  let val = partTypeStyleToTokenVal[actualType];\n  if (typeof val === \"object\") {\n    val = val[style];\n  }\n\n  if (val) {\n    return {\n      literal: false,\n      val,\n    };\n  }\n\n  return undefined;\n}\n\nfunction buildRegex(units) {\n  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, \"\");\n  return [`^${re}$`, units];\n}\n\nfunction match(input, regex, handlers) {\n  const matches = input.match(regex);\n\n  if (matches) {\n    const all = {};\n    let matchIndex = 1;\n    for (const i in handlers) {\n      if (hasOwnProperty(handlers, i)) {\n        const h = handlers[i],\n          groups = h.groups ? h.groups + 1 : 1;\n        if (!h.literal && h.token) {\n          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));\n        }\n        matchIndex += groups;\n      }\n    }\n    return [matches, all];\n  } else {\n    return [matches, {}];\n  }\n}\n\nfunction dateTimeFromMatches(matches) {\n  const toField = (token) => {\n    switch (token) {\n      case \"S\":\n        return \"millisecond\";\n      case \"s\":\n        return \"second\";\n      case \"m\":\n        return \"minute\";\n      case \"h\":\n      case \"H\":\n        return \"hour\";\n      case \"d\":\n        return \"day\";\n      case \"o\":\n        return \"ordinal\";\n      case \"L\":\n      case \"M\":\n        return \"month\";\n      case \"y\":\n        return \"year\";\n      case \"E\":\n      case \"c\":\n        return \"weekday\";\n      case \"W\":\n        return \"weekNumber\";\n      case \"k\":\n        return \"weekYear\";\n      case \"q\":\n        return \"quarter\";\n      default:\n        return null;\n    }\n  };\n\n  let zone = null;\n  let specificOffset;\n  if (!isUndefined(matches.z)) {\n    zone = IANAZone.create(matches.z);\n  }\n\n  if (!isUndefined(matches.Z)) {\n    if (!zone) {\n      zone = new FixedOffsetZone(matches.Z);\n    }\n    specificOffset = matches.Z;\n  }\n\n  if (!isUndefined(matches.q)) {\n    matches.M = (matches.q - 1) * 3 + 1;\n  }\n\n  if (!isUndefined(matches.h)) {\n    if (matches.h < 12 && matches.a === 1) {\n      matches.h += 12;\n    } else if (matches.h === 12 && matches.a === 0) {\n      matches.h = 0;\n    }\n  }\n\n  if (matches.G === 0 && matches.y) {\n    matches.y = -matches.y;\n  }\n\n  if (!isUndefined(matches.u)) {\n    matches.S = parseMillis(matches.u);\n  }\n\n  const vals = Object.keys(matches).reduce((r, k) => {\n    const f = toField(k);\n    if (f) {\n      r[f] = matches[k];\n    }\n\n    return r;\n  }, {});\n\n  return [vals, zone, specificOffset];\n}\n\nlet dummyDateTimeCache = null;\n\nfunction getDummyDateTime() {\n  if (!dummyDateTimeCache) {\n    dummyDateTimeCache = DateTime.fromMillis(1555555555555);\n  }\n\n  return dummyDateTimeCache;\n}\n\nfunction maybeExpandMacroToken(token, locale) {\n  if (token.literal) {\n    return token;\n  }\n\n  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);\n  const tokens = formatOptsToTokens(formatOpts, locale);\n\n  if (tokens == null || tokens.includes(undefined)) {\n    return token;\n  }\n\n  return tokens;\n}\n\nexport function expandMacroTokens(tokens, locale) {\n  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));\n}\n\n/**\n * @private\n */\n\nexport class TokenParser {\n  constructor(locale, format) {\n    this.locale = locale;\n    this.format = format;\n    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);\n    this.units = this.tokens.map((t) => unitForToken(t, locale));\n    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);\n\n    if (!this.disqualifyingUnit) {\n      const [regexString, handlers] = buildRegex(this.units);\n      this.regex = RegExp(regexString, \"i\");\n      this.handlers = handlers;\n    }\n  }\n\n  explainFromTokens(input) {\n    if (!this.isValid) {\n      return { input, tokens: this.tokens, invalidReason: this.invalidReason };\n    } else {\n      const [rawMatches, matches] = match(input, this.regex, this.handlers),\n        [result, zone, specificOffset] = matches\n          ? dateTimeFromMatches(matches)\n          : [null, null, undefined];\n      if (hasOwnProperty(matches, \"a\") && hasOwnProperty(matches, \"H\")) {\n        throw new ConflictingSpecificationError(\n          \"Can't include meridiem when specifying 24-hour format\"\n        );\n      }\n      return {\n        input,\n        tokens: this.tokens,\n        regex: this.regex,\n        rawMatches,\n        matches,\n        result,\n        zone,\n        specificOffset,\n      };\n    }\n  }\n\n  get isValid() {\n    return !this.disqualifyingUnit;\n  }\n\n  get invalidReason() {\n    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;\n  }\n}\n\nexport function explainFromTokens(locale, input, format) {\n  const parser = new TokenParser(locale, format);\n  return parser.explainFromTokens(input);\n}\n\nexport function parseFromTokens(locale, input, format) {\n  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);\n  return [result, zone, specificOffset, invalidReason];\n}\n\nexport function formatOptsToTokens(formatOpts, locale) {\n  if (!formatOpts) {\n    return null;\n  }\n\n  const formatter = Formatter.create(locale, formatOpts);\n  const df = formatter.dtFormatter(getDummyDateTime());\n  const parts = df.formatToParts();\n  const resolvedOpts = df.resolvedOptions();\n  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));\n}\n","import Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Settings from \"./settings.js\";\nimport Info from \"./info.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport {\n  isUndefined,\n  maybeArray,\n  isDate,\n  isNumber,\n  bestBy,\n  daysInMonth,\n  daysInYear,\n  isLeapYear,\n  weeksInWeekYear,\n  normalizeObject,\n  roundTo,\n  objToLocalTS,\n  padStart,\n} from \"./impl/util.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport diff from \"./impl/diff.js\";\nimport { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from \"./impl/regexParser.js\";\nimport {\n  parseFromTokens,\n  explainFromTokens,\n  formatOptsToTokens,\n  expandMacroTokens,\n  TokenParser,\n} from \"./impl/tokenParser.js\";\nimport {\n  gregorianToWeek,\n  weekToGregorian,\n  gregorianToOrdinal,\n  ordinalToGregorian,\n  hasInvalidGregorianData,\n  hasInvalidWeekData,\n  hasInvalidOrdinalData,\n  hasInvalidTimeData,\n  usesLocalWeekValues,\n  isoWeekdayToLocal,\n} from \"./impl/conversions.js\";\nimport * as Formats from \"./impl/formats.js\";\nimport {\n  InvalidArgumentError,\n  ConflictingSpecificationError,\n  InvalidUnitError,\n  InvalidDateTimeError,\n} from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\n\nconst INVALID = \"Invalid DateTime\";\nconst MAX_DATE = 8.64e15;\n\nfunction unsupportedZone(zone) {\n  return new Invalid(\"unsupported zone\", `the zone \"${zone.name}\" is not supported`);\n}\n\n// we cache week data on the DT object and this intermediates the cache\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedWeekData(dt) {\n  if (dt.weekData === null) {\n    dt.weekData = gregorianToWeek(dt.c);\n  }\n  return dt.weekData;\n}\n\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedLocalWeekData(dt) {\n  if (dt.localWeekData === null) {\n    dt.localWeekData = gregorianToWeek(\n      dt.c,\n      dt.loc.getMinDaysInFirstWeek(),\n      dt.loc.getStartOfWeek()\n    );\n  }\n  return dt.localWeekData;\n}\n\n// clone really means, \"make a new object with these modifications\". all \"setters\" really use this\n// to create a new object while only changing some of the properties\nfunction clone(inst, alts) {\n  const current = {\n    ts: inst.ts,\n    zone: inst.zone,\n    c: inst.c,\n    o: inst.o,\n    loc: inst.loc,\n    invalid: inst.invalid,\n  };\n  return new DateTime({ ...current, ...alts, old: current });\n}\n\n// find the right offset a given local time. The o input is our guess, which determines which\n// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)\nfunction fixOffset(localTS, o, tz) {\n  // Our UTC time is just a guess because our offset is just a guess\n  let utcGuess = localTS - o * 60 * 1000;\n\n  // Test whether the zone matches the offset for this ts\n  const o2 = tz.offset(utcGuess);\n\n  // If so, offset didn't change and we're done\n  if (o === o2) {\n    return [utcGuess, o];\n  }\n\n  // If not, change the ts by the difference in the offset\n  utcGuess -= (o2 - o) * 60 * 1000;\n\n  // If that gives us the local time we want, we're done\n  const o3 = tz.offset(utcGuess);\n  if (o2 === o3) {\n    return [utcGuess, o2];\n  }\n\n  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time\n  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];\n}\n\n// convert an epoch timestamp into a calendar object with the given offset\nfunction tsToObj(ts, offset) {\n  ts += offset * 60 * 1000;\n\n  const d = new Date(ts);\n\n  return {\n    year: d.getUTCFullYear(),\n    month: d.getUTCMonth() + 1,\n    day: d.getUTCDate(),\n    hour: d.getUTCHours(),\n    minute: d.getUTCMinutes(),\n    second: d.getUTCSeconds(),\n    millisecond: d.getUTCMilliseconds(),\n  };\n}\n\n// convert a calendar object to a epoch timestamp\nfunction objToTS(obj, offset, zone) {\n  return fixOffset(objToLocalTS(obj), offset, zone);\n}\n\n// create a new DT instance by adding a duration, adjusting for DSTs\nfunction adjustTime(inst, dur) {\n  const oPre = inst.o,\n    year = inst.c.year + Math.trunc(dur.years),\n    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,\n    c = {\n      ...inst.c,\n      year,\n      month,\n      day:\n        Math.min(inst.c.day, daysInMonth(year, month)) +\n        Math.trunc(dur.days) +\n        Math.trunc(dur.weeks) * 7,\n    },\n    millisToAdd = Duration.fromObject({\n      years: dur.years - Math.trunc(dur.years),\n      quarters: dur.quarters - Math.trunc(dur.quarters),\n      months: dur.months - Math.trunc(dur.months),\n      weeks: dur.weeks - Math.trunc(dur.weeks),\n      days: dur.days - Math.trunc(dur.days),\n      hours: dur.hours,\n      minutes: dur.minutes,\n      seconds: dur.seconds,\n      milliseconds: dur.milliseconds,\n    }).as(\"milliseconds\"),\n    localTS = objToLocalTS(c);\n\n  let [ts, o] = fixOffset(localTS, oPre, inst.zone);\n\n  if (millisToAdd !== 0) {\n    ts += millisToAdd;\n    // that could have changed the offset by going over a DST, but we want to keep the ts the same\n    o = inst.zone.offset(ts);\n  }\n\n  return { ts, o };\n}\n\n// helper useful in turning the results of parsing into real dates\n// by handling the zone options\nfunction parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {\n  const { setZone, zone } = opts;\n  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {\n    const interpretationZone = parsedZone || zone,\n      inst = DateTime.fromObject(parsed, {\n        ...opts,\n        zone: interpretationZone,\n        specificOffset,\n      });\n    return setZone ? inst : inst.setZone(zone);\n  } else {\n    return DateTime.invalid(\n      new Invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ${format}`)\n    );\n  }\n}\n\n// if you want to output a technical format (e.g. RFC 2822), this helper\n// helps handle the details\nfunction toTechFormat(dt, format, allowZ = true) {\n  return dt.isValid\n    ? Formatter.create(Locale.create(\"en-US\"), {\n        allowZ,\n        forceSimple: true,\n      }).formatDateTimeFromString(dt, format)\n    : null;\n}\n\nfunction toISODate(o, extended, precision) {\n  const longFormat = o.c.year > 9999 || o.c.year < 0;\n  let c = \"\";\n  if (longFormat && o.c.year >= 0) c += \"+\";\n  c += padStart(o.c.year, longFormat ? 6 : 4);\n  if (precision === \"year\") return c;\n  if (extended) {\n    c += \"-\";\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n    c += \"-\";\n  } else {\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n  }\n  c += padStart(o.c.day);\n  return c;\n}\n\nfunction toISOTime(\n  o,\n  extended,\n  suppressSeconds,\n  suppressMilliseconds,\n  includeOffset,\n  extendedZone,\n  precision\n) {\n  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,\n    c = \"\";\n  switch (precision) {\n    case \"day\":\n    case \"month\":\n    case \"year\":\n      break;\n    default:\n      c += padStart(o.c.hour);\n      if (precision === \"hour\") break;\n      if (extended) {\n        c += \":\";\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += \":\";\n          c += padStart(o.c.second);\n        }\n      } else {\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += padStart(o.c.second);\n        }\n      }\n      if (precision === \"second\") break;\n      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {\n        c += \".\";\n        c += padStart(o.c.millisecond, 3);\n      }\n  }\n\n  if (includeOffset) {\n    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {\n      c += \"Z\";\n    } else if (o.o < 0) {\n      c += \"-\";\n      c += padStart(Math.trunc(-o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(-o.o % 60));\n    } else {\n      c += \"+\";\n      c += padStart(Math.trunc(o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(o.o % 60));\n    }\n  }\n\n  if (extendedZone) {\n    c += \"[\" + o.zone.ianaName + \"]\";\n  }\n  return c;\n}\n\n// defaults for unspecified units in the supported calendars\nconst defaultUnitValues = {\n    month: 1,\n    day: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultWeekUnitValues = {\n    weekNumber: 1,\n    weekday: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultOrdinalUnitValues = {\n    ordinal: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  };\n\n// Units in the supported calendars, sorted by bigness\nconst orderedUnits = [\"year\", \"month\", \"day\", \"hour\", \"minute\", \"second\", \"millisecond\"],\n  orderedWeekUnits = [\n    \"weekYear\",\n    \"weekNumber\",\n    \"weekday\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"millisecond\",\n  ],\n  orderedOrdinalUnits = [\"year\", \"ordinal\", \"hour\", \"minute\", \"second\", \"millisecond\"];\n\n// standardize case and plurality in units\nfunction normalizeUnit(unit) {\n  const normalized = {\n    year: \"year\",\n    years: \"year\",\n    month: \"month\",\n    months: \"month\",\n    day: \"day\",\n    days: \"day\",\n    hour: \"hour\",\n    hours: \"hour\",\n    minute: \"minute\",\n    minutes: \"minute\",\n    quarter: \"quarter\",\n    quarters: \"quarter\",\n    second: \"second\",\n    seconds: \"second\",\n    millisecond: \"millisecond\",\n    milliseconds: \"millisecond\",\n    weekday: \"weekday\",\n    weekdays: \"weekday\",\n    weeknumber: \"weekNumber\",\n    weeksnumber: \"weekNumber\",\n    weeknumbers: \"weekNumber\",\n    weekyear: \"weekYear\",\n    weekyears: \"weekYear\",\n    ordinal: \"ordinal\",\n  }[unit.toLowerCase()];\n\n  if (!normalized) throw new InvalidUnitError(unit);\n\n  return normalized;\n}\n\nfunction normalizeUnitWithLocalWeeks(unit) {\n  switch (unit.toLowerCase()) {\n    case \"localweekday\":\n    case \"localweekdays\":\n      return \"localWeekday\";\n    case \"localweeknumber\":\n    case \"localweeknumbers\":\n      return \"localWeekNumber\";\n    case \"localweekyear\":\n    case \"localweekyears\":\n      return \"localWeekYear\";\n    default:\n      return normalizeUnit(unit);\n  }\n}\n\n// cache offsets for zones based on the current timestamp when this function is\n// first called. When we are handling a datetime from components like (year,\n// month, day, hour) in a time zone, we need a guess about what the timezone\n// offset is so that we can convert into a UTC timestamp. One way is to find the\n// offset of now in the zone. The actual date may have a different offset (for\n// example, if we handle a date in June while we're in December in a zone that\n// observes DST), but we can check and adjust that.\n//\n// When handling many dates, calculating the offset for now every time is\n// expensive. It's just a guess, so we can cache the offset to use even if we\n// are right on a time change boundary (we'll just correct in the other\n// direction). Using a timestamp from first read is a slight optimization for\n// handling dates close to the current date, since those dates will usually be\n// in the same offset (we could set the timestamp statically, instead). We use a\n// single timestamp for all zones to make things a bit more predictable.\n//\n// This is safe for quickDT (used by local() and utc()) because we don't fill in\n// higher-order units from tsNow (as we do in fromObject, this requires that\n// offset is calculated from tsNow).\n/**\n * @param {Zone} zone\n * @return {number}\n */\nfunction guessOffsetForZone(zone) {\n  if (zoneOffsetTs === undefined) {\n    zoneOffsetTs = Settings.now();\n  }\n\n  // Do not cache anything but IANA zones, because it is not safe to do so.\n  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset\n  if (zone.type !== \"iana\") {\n    return zone.offset(zoneOffsetTs);\n  }\n  const zoneName = zone.name;\n  let offsetGuess = zoneOffsetGuessCache.get(zoneName);\n  if (offsetGuess === undefined) {\n    offsetGuess = zone.offset(zoneOffsetTs);\n    zoneOffsetGuessCache.set(zoneName, offsetGuess);\n  }\n  return offsetGuess;\n}\n\n// this is a dumbed down version of fromObject() that runs about 60% faster\n// but doesn't do any validation, makes a bunch of assumptions about what units\n// are present, and so on.\nfunction quickDT(obj, opts) {\n  const zone = normalizeZone(opts.zone, Settings.defaultZone);\n  if (!zone.isValid) {\n    return DateTime.invalid(unsupportedZone(zone));\n  }\n\n  const loc = Locale.fromObject(opts);\n\n  let ts, o;\n\n  // assume we have the higher-order units\n  if (!isUndefined(obj.year)) {\n    for (const u of orderedUnits) {\n      if (isUndefined(obj[u])) {\n        obj[u] = defaultUnitValues[u];\n      }\n    }\n\n    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    const offsetProvis = guessOffsetForZone(zone);\n    [ts, o] = objToTS(obj, offsetProvis, zone);\n  } else {\n    ts = Settings.now();\n  }\n\n  return new DateTime({ ts, zone, loc, o });\n}\n\nfunction diffRelative(start, end, opts) {\n  const round = isUndefined(opts.round) ? true : opts.round,\n    rounding = isUndefined(opts.rounding) ? \"trunc\" : opts.rounding,\n    format = (c, unit) => {\n      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? \"round\" : rounding);\n      const formatter = end.loc.clone(opts).relFormatter(opts);\n      return formatter.format(c, unit);\n    },\n    differ = (unit) => {\n      if (opts.calendary) {\n        if (!end.hasSame(start, unit)) {\n          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);\n        } else return 0;\n      } else {\n        return end.diff(start, unit).get(unit);\n      }\n    };\n\n  if (opts.unit) {\n    return format(differ(opts.unit), opts.unit);\n  }\n\n  for (const unit of opts.units) {\n    const count = differ(unit);\n    if (Math.abs(count) >= 1) {\n      return format(count, unit);\n    }\n  }\n  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);\n}\n\nfunction lastOpts(argList) {\n  let opts = {},\n    args;\n  if (argList.length > 0 && typeof argList[argList.length - 1] === \"object\") {\n    opts = argList[argList.length - 1];\n    args = Array.from(argList).slice(0, argList.length - 1);\n  } else {\n    args = Array.from(argList);\n  }\n  return [opts, args];\n}\n\n/**\n * Timestamp to use for cached zone offset guesses (exposed for test)\n */\nlet zoneOffsetTs;\n/**\n * Cache for zone offset guesses (exposed for test).\n *\n * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of\n * zone.offset().\n */\nconst zoneOffsetGuessCache = new Map();\n\n/**\n * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.\n *\n * A DateTime comprises of:\n * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.\n * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).\n * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.\n *\n * Here is a brief overview of the most commonly used functionality it provides:\n *\n * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.\n * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},\n * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.\n * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.\n * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.\n * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.\n * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.\n *\n * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.\n */\nexport default class DateTime {\n  /**\n   * @access private\n   */\n  constructor(config) {\n    const zone = config.zone || Settings.defaultZone;\n\n    let invalid =\n      config.invalid ||\n      (Number.isNaN(config.ts) ? new Invalid(\"invalid input\") : null) ||\n      (!zone.isValid ? unsupportedZone(zone) : null);\n    /**\n     * @access private\n     */\n    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;\n\n    let c = null,\n      o = null;\n    if (!invalid) {\n      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);\n\n      if (unchanged) {\n        [c, o] = [config.old.c, config.old.o];\n      } else {\n        // If an offset has been passed and we have not been called from\n        // clone(), we can trust it and avoid the offset calculation.\n        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);\n        c = tsToObj(this.ts, ot);\n        invalid = Number.isNaN(c.year) ? new Invalid(\"invalid input\") : null;\n        c = invalid ? null : c;\n        o = invalid ? null : ot;\n      }\n    }\n\n    /**\n     * @access private\n     */\n    this._zone = zone;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.invalid = invalid;\n    /**\n     * @access private\n     */\n    this.weekData = null;\n    /**\n     * @access private\n     */\n    this.localWeekData = null;\n    /**\n     * @access private\n     */\n    this.c = c;\n    /**\n     * @access private\n     */\n    this.o = o;\n    /**\n     * @access private\n     */\n    this.isLuxonDateTime = true;\n  }\n\n  // CONSTRUCT\n\n  /**\n   * Create a DateTime for the current instant, in the system's time zone.\n   *\n   * Use Settings to override these default values if needed.\n   * @example DateTime.now().toISO() //~> now in the ISO format\n   * @return {DateTime}\n   */\n  static now() {\n    return new DateTime({});\n  }\n\n  /**\n   * Create a local DateTime\n   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month, 1-indexed\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @example DateTime.local()                                  //~> now\n   * @example DateTime.local({ zone: \"America/New_York\" })      //~> now, in US east coast time\n   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00\n   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00\n   * @example DateTime.local(2017, 3, 12, { locale: \"fr\" })     //~> 2017-03-12T00:00:00, with a French locale\n   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00\n   * @example DateTime.local(2017, 3, 12, 5, { zone: \"utc\" })   //~> 2017-03-12T05:00:00, in UTC\n   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765\n   * @return {DateTime}\n   */\n  static local() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime in UTC\n   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.utc()                                              //~> now\n   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z\n   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: \"fr\" })          //~> 2017-03-12T05:45:00Z with a French locale\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: \"fr\" }) //~> 2017-03-12T05:45:10.765Z with a French locale\n   * @return {DateTime}\n   */\n  static utc() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n\n    opts.zone = FixedOffsetZone.utcInstance;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime from a JavaScript Date object. Uses the default zone.\n   * @param {Date} date - a JavaScript Date object\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @return {DateTime}\n   */\n  static fromJSDate(date, options = {}) {\n    const ts = isDate(date) ? date.valueOf() : NaN;\n    if (Number.isNaN(ts)) {\n      return DateTime.invalid(\"invalid input\");\n    }\n\n    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    return new DateTime({\n      ts: ts,\n      zone: zoneToUse,\n      loc: Locale.fromObject(options),\n    });\n  }\n\n  /**\n   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} milliseconds - a number of milliseconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromMillis(milliseconds, options = {}) {\n    if (!isNumber(milliseconds)) {\n      throw new InvalidArgumentError(\n        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`\n      );\n    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {\n      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start\n      return DateTime.invalid(\"Timestamp out of range\");\n    } else {\n      return new DateTime({\n        ts: milliseconds,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} seconds - a number of seconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromSeconds(seconds, options = {}) {\n    if (!isNumber(seconds)) {\n      throw new InvalidArgumentError(\"fromSeconds requires a numerical input\");\n    } else {\n      return new DateTime({\n        ts: seconds * 1000,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.year - a year, such as 1987\n   * @param {number} obj.month - a month, 1-12\n   * @param {number} obj.day - a day of the month, 1-31, depending on the month\n   * @param {number} obj.ordinal - day of the year, 1-365 or 366\n   * @param {number} obj.weekYear - an ISO week year\n   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year\n   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday\n   * @param {number} obj.localWeekYear - a week year, according to the locale\n   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale\n   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale\n   * @param {number} obj.hour - hour of the day, 0-23\n   * @param {number} obj.minute - minute of the hour, 0-59\n   * @param {number} obj.second - second of the minute, 0-59\n   * @param {number} obj.millisecond - millisecond of the second, 0-999\n   * @param {Object} opts - options for creating this DateTime\n   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()\n   * @param {string} [opts.locale='system\\'s locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'\n   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })\n   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'\n   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: \"en-US\" }).toISODate() //=> '2021-12-26'\n   * @return {DateTime}\n   */\n  static fromObject(obj, opts = {}) {\n    obj = obj || {};\n    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    const loc = Locale.fromObject(opts);\n    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);\n\n    const tsNow = Settings.now(),\n      offsetProvis = !isUndefined(opts.specificOffset)\n        ? opts.specificOffset\n        : zoneToUse.offset(tsNow),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    // cases:\n    // just a weekday -> this week's instance of that weekday, no worries\n    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error\n    // (gregorian month or day) + ordinal -> error\n    // otherwise just use weeks or ordinals or gregorian, depending on what's specified\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);\n\n    // configure ourselves to deal with gregorian dates or week stuff\n    let units,\n      defaultValues,\n      objNow = tsToObj(tsNow, offsetProvis);\n    if (useWeekData) {\n      units = orderedWeekUnits;\n      defaultValues = defaultWeekUnitValues;\n      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);\n    } else if (containsOrdinal) {\n      units = orderedOrdinalUnits;\n      defaultValues = defaultOrdinalUnitValues;\n      objNow = gregorianToOrdinal(objNow);\n    } else {\n      units = orderedUnits;\n      defaultValues = defaultUnitValues;\n    }\n\n    // set default values for missing stuff\n    let foundFirst = false;\n    for (const u of units) {\n      const v = normalized[u];\n      if (!isUndefined(v)) {\n        foundFirst = true;\n      } else if (foundFirst) {\n        normalized[u] = defaultValues[u];\n      } else {\n        normalized[u] = objNow[u];\n      }\n    }\n\n    // make sure the values we have are in range\n    const higherOrderInvalid = useWeekData\n        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? hasInvalidOrdinalData(normalized)\n        : hasInvalidGregorianData(normalized),\n      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);\n\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    // compute the actual time\n    const gregorian = useWeekData\n        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? ordinalToGregorian(normalized)\n        : normalized,\n      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),\n      inst = new DateTime({\n        ts: tsFinal,\n        zone: zoneToUse,\n        o: offsetFinal,\n        loc,\n      });\n\n    // gregorian data + weekday serves only to validate\n    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {\n      return DateTime.invalid(\n        \"mismatched weekday\",\n        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`\n      );\n    }\n\n    if (!inst.isValid) {\n      return DateTime.invalid(inst.invalid);\n    }\n\n    return inst;\n  }\n\n  /**\n   * Create a DateTime from an ISO 8601 string\n   * @param {string} text - the ISO string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})\n   * @example DateTime.fromISO('2016-W05-4')\n   * @return {DateTime}\n   */\n  static fromISO(text, opts = {}) {\n    const [vals, parsedZone] = parseISODate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"ISO 8601\", text);\n  }\n\n  /**\n   * Create a DateTime from an RFC 2822 string\n   * @param {string} text - the RFC 2822 string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')\n   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')\n   * @return {DateTime}\n   */\n  static fromRFC2822(text, opts = {}) {\n    const [vals, parsedZone] = parseRFC2822Date(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"RFC 2822\", text);\n  }\n\n  /**\n   * Create a DateTime from an HTTP header date\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @param {string} text - the HTTP header date\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')\n   * @return {DateTime}\n   */\n  static fromHTTP(text, opts = {}) {\n    const [vals, parsedZone] = parseHTTPDate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"HTTP\", opts);\n  }\n\n  /**\n   * Create a DateTime from an input string and format string.\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromFormat(text, fmt, opts = {}) {\n    if (isUndefined(text) || isUndefined(fmt)) {\n      throw new InvalidArgumentError(\"fromFormat requires an input string and a format\");\n    }\n\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      }),\n      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    } else {\n      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);\n    }\n  }\n\n  /**\n   * @deprecated use fromFormat instead\n   */\n  static fromString(text, fmt, opts = {}) {\n    return DateTime.fromFormat(text, fmt, opts);\n  }\n\n  /**\n   * Create a DateTime from a SQL date, time, or datetime\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale\n   * @param {string} text - the string to parse\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @example DateTime.fromSQL('2017-05-15')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })\n   * @example DateTime.fromSQL('09:12:34.342')\n   * @return {DateTime}\n   */\n  static fromSQL(text, opts = {}) {\n    const [vals, parsedZone] = parseSQL(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"SQL\", text);\n  }\n\n  /**\n   * Create an invalid DateTime.\n   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {DateTime}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the DateTime is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDateTimeError(invalid);\n    } else {\n      return new DateTime({ invalid });\n    }\n  }\n\n  /**\n   * Check if an object is an instance of DateTime. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDateTime(o) {\n    return (o && o.isLuxonDateTime) || false;\n  }\n\n  /**\n   * Produce the format string for a set of options\n   * @param formatOpts\n   * @param localeOpts\n   * @returns {string}\n   */\n  static parseFormatForOpts(formatOpts, localeOpts = {}) {\n    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));\n    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join(\"\");\n  }\n\n  /**\n   * Produce the the fully expanded format token for the locale\n   * Does NOT quote characters, so quoted tokens will not round trip correctly\n   * @param fmt\n   * @param localeOpts\n   * @returns {string}\n   */\n  static expandFormat(fmt, localeOpts = {}) {\n    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));\n    return expanded.map((t) => t.val).join(\"\");\n  }\n\n  static resetCache() {\n    zoneOffsetTs = undefined;\n    zoneOffsetGuessCache.clear();\n  }\n\n  // INFO\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7\n   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4\n   * @return {number}\n   */\n  get(unit) {\n    return this[unit];\n  }\n\n  /**\n   * Returns whether the DateTime is valid. Invalid DateTimes occur when:\n   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30\n   * * The DateTime was created by an operation on another invalid date\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get outputCalendar() {\n    return this.isValid ? this.loc.outputCalendar : null;\n  }\n\n  /**\n   * Get the time zone associated with this DateTime.\n   * @type {Zone}\n   */\n  get zone() {\n    return this._zone;\n  }\n\n  /**\n   * Get the name of the time zone.\n   * @type {string}\n   */\n  get zoneName() {\n    return this.isValid ? this.zone.name : null;\n  }\n\n  /**\n   * Get the year\n   * @example DateTime.local(2017, 5, 25).year //=> 2017\n   * @type {number}\n   */\n  get year() {\n    return this.isValid ? this.c.year : NaN;\n  }\n\n  /**\n   * Get the quarter\n   * @example DateTime.local(2017, 5, 25).quarter //=> 2\n   * @type {number}\n   */\n  get quarter() {\n    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;\n  }\n\n  /**\n   * Get the month (1-12).\n   * @example DateTime.local(2017, 5, 25).month //=> 5\n   * @type {number}\n   */\n  get month() {\n    return this.isValid ? this.c.month : NaN;\n  }\n\n  /**\n   * Get the day of the month (1-30ish).\n   * @example DateTime.local(2017, 5, 25).day //=> 25\n   * @type {number}\n   */\n  get day() {\n    return this.isValid ? this.c.day : NaN;\n  }\n\n  /**\n   * Get the hour of the day (0-23).\n   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9\n   * @type {number}\n   */\n  get hour() {\n    return this.isValid ? this.c.hour : NaN;\n  }\n\n  /**\n   * Get the minute of the hour (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30\n   * @type {number}\n   */\n  get minute() {\n    return this.isValid ? this.c.minute : NaN;\n  }\n\n  /**\n   * Get the second of the minute (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52\n   * @type {number}\n   */\n  get second() {\n    return this.isValid ? this.c.second : NaN;\n  }\n\n  /**\n   * Get the millisecond of the second (0-999).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654\n   * @type {number}\n   */\n  get millisecond() {\n    return this.isValid ? this.c.millisecond : NaN;\n  }\n\n  /**\n   * Get the week year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015\n   * @type {number}\n   */\n  get weekYear() {\n    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the week number of the week year (1-52ish).\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21\n   * @type {number}\n   */\n  get weekNumber() {\n    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the day of the week.\n   * 1 is Monday and 7 is Sunday\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 11, 31).weekday //=> 4\n   * @type {number}\n   */\n  get weekday() {\n    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Returns true if this date is on a weekend according to the locale, false otherwise\n   * @returns {boolean}\n   */\n  get isWeekend() {\n    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);\n  }\n\n  /**\n   * Get the day of the week according to the locale.\n   * 1 is the first day of the week and 7 is the last day of the week.\n   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,\n   * @returns {number}\n   */\n  get localWeekday() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,\n   * because the week can start on different days of the week (see localWeekday) and because a different number of days\n   * is required for a week to count as the first week of a year.\n   * @returns {number}\n   */\n  get localWeekNumber() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)\n   * differently, see localWeekNumber.\n   * @returns {number}\n   */\n  get localWeekYear() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the ordinal (meaning the day of the year)\n   * @example DateTime.local(2017, 5, 25).ordinal //=> 145\n   * @type {number|DateTime}\n   */\n  get ordinal() {\n    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;\n  }\n\n  /**\n   * Get the human readable short month name, such as 'Oct'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct\n   * @type {string}\n   */\n  get monthShort() {\n    return this.isValid ? Info.months(\"short\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable long month name, such as 'October'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthLong //=> October\n   * @type {string}\n   */\n  get monthLong() {\n    return this.isValid ? Info.months(\"long\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable short weekday, such as 'Mon'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon\n   * @type {string}\n   */\n  get weekdayShort() {\n    return this.isValid ? Info.weekdays(\"short\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the human readable long weekday, such as 'Monday'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday\n   * @type {string}\n   */\n  get weekdayLong() {\n    return this.isValid ? Info.weekdays(\"long\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the UTC offset of this DateTime in minutes\n   * @example DateTime.now().offset //=> -240\n   * @example DateTime.utc().offset //=> 0\n   * @type {number}\n   */\n  get offset() {\n    return this.isValid ? +this.o : NaN;\n  }\n\n  /**\n   * Get the short human name for the zone's current offset, for example \"EST\" or \"EDT\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameShort() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"short\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get the long human name for the zone's current offset, for example \"Eastern Standard Time\" or \"Eastern Daylight Time\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameLong() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"long\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get whether this zone's offset ever changes, as in a DST.\n   * @type {boolean}\n   */\n  get isOffsetFixed() {\n    return this.isValid ? this.zone.isUniversal : null;\n  }\n\n  /**\n   * Get whether the DateTime is in a DST.\n   * @type {boolean}\n   */\n  get isInDST() {\n    if (this.isOffsetFixed) {\n      return false;\n    } else {\n      return (\n        this.offset > this.set({ month: 1, day: 1 }).offset ||\n        this.offset > this.set({ month: 5 }).offset\n      );\n    }\n  }\n\n  /**\n   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC\n   * in this DateTime's zone. During DST changes local time can be ambiguous, for example\n   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.\n   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.\n   * @returns {DateTime[]}\n   */\n  getPossibleOffsets() {\n    if (!this.isValid || this.isOffsetFixed) {\n      return [this];\n    }\n    const dayMs = 86400000;\n    const minuteMs = 60000;\n    const localTS = objToLocalTS(this.c);\n    const oEarlier = this.zone.offset(localTS - dayMs);\n    const oLater = this.zone.offset(localTS + dayMs);\n\n    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);\n    const o2 = this.zone.offset(localTS - oLater * minuteMs);\n    if (o1 === o2) {\n      return [this];\n    }\n    const ts1 = localTS - o1 * minuteMs;\n    const ts2 = localTS - o2 * minuteMs;\n    const c1 = tsToObj(ts1, o1);\n    const c2 = tsToObj(ts2, o2);\n    if (\n      c1.hour === c2.hour &&\n      c1.minute === c2.minute &&\n      c1.second === c2.second &&\n      c1.millisecond === c2.millisecond\n    ) {\n      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];\n    }\n    return [this];\n  }\n\n  /**\n   * Returns true if this DateTime is in a leap year, false otherwise\n   * @example DateTime.local(2016).isInLeapYear //=> true\n   * @example DateTime.local(2013).isInLeapYear //=> false\n   * @type {boolean}\n   */\n  get isInLeapYear() {\n    return isLeapYear(this.year);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's month\n   * @example DateTime.local(2016, 2).daysInMonth //=> 29\n   * @example DateTime.local(2016, 3).daysInMonth //=> 31\n   * @type {number}\n   */\n  get daysInMonth() {\n    return daysInMonth(this.year, this.month);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's year\n   * @example DateTime.local(2016).daysInYear //=> 366\n   * @example DateTime.local(2013).daysInYear //=> 365\n   * @type {number}\n   */\n  get daysInYear() {\n    return this.isValid ? daysInYear(this.year) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2004).weeksInWeekYear //=> 53\n   * @example DateTime.local(2013).weeksInWeekYear //=> 52\n   * @type {number}\n   */\n  get weeksInWeekYear() {\n    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's local week year\n   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52\n   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53\n   * @type {number}\n   */\n  get weeksInLocalWeekYear() {\n    return this.isValid\n      ? weeksInWeekYear(\n          this.localWeekYear,\n          this.loc.getMinDaysInFirstWeek(),\n          this.loc.getStartOfWeek()\n        )\n      : NaN;\n  }\n\n  /**\n   * Returns the resolved Intl options for this DateTime.\n   * This is useful in understanding the behavior of formatting methods\n   * @param {Object} opts - the same options as toLocaleString\n   * @return {Object}\n   */\n  resolvedLocaleOptions(opts = {}) {\n    const { locale, numberingSystem, calendar } = Formatter.create(\n      this.loc.clone(opts),\n      opts\n    ).resolvedOptions(this);\n    return { locale, numberingSystem, outputCalendar: calendar };\n  }\n\n  // TRANSFORM\n\n  /**\n   * \"Set\" the DateTime's zone to UTC. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to {@link DateTime#setZone}('utc')\n   * @param {number} [offset=0] - optionally, an offset from UTC in minutes\n   * @param {Object} [opts={}] - options to pass to `setZone()`\n   * @return {DateTime}\n   */\n  toUTC(offset = 0, opts = {}) {\n    return this.setZone(FixedOffsetZone.instance(offset), opts);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to `setZone('local')`\n   * @return {DateTime}\n   */\n  toLocal() {\n    return this.setZone(Settings.defaultZone);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.\n   *\n   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.\n   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.\n   * @return {DateTime}\n   */\n  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {\n    zone = normalizeZone(zone, Settings.defaultZone);\n    if (zone.equals(this.zone)) {\n      return this;\n    } else if (!zone.isValid) {\n      return DateTime.invalid(unsupportedZone(zone));\n    } else {\n      let newTS = this.ts;\n      if (keepLocalTime || keepCalendarTime) {\n        const offsetGuess = zone.offset(this.ts);\n        const asObj = this.toObject();\n        [newTS] = objToTS(asObj, offsetGuess, zone);\n      }\n      return clone(this, { ts: newTS, zone });\n    }\n  }\n\n  /**\n   * \"Set\" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.\n   * @param {Object} properties - the properties to set\n   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })\n   * @return {DateTime}\n   */\n  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });\n    return clone(this, { loc });\n  }\n\n  /**\n   * \"Set\" the locale. Returns a newly-constructed DateTime.\n   * Just a convenient alias for reconfigure({ locale })\n   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')\n   * @return {DateTime}\n   */\n  setLocale(locale) {\n    return this.reconfigure({ locale });\n  }\n\n  /**\n   * \"Set\" the values of specified units. Returns a newly-constructed DateTime.\n   * You can only set units with this method; for \"setting\" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.\n   *\n   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.\n   * They cannot be mixed with ISO-week units like `weekday`.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dt.set({ year: 2017 })\n   * @example dt.set({ hour: 8, minute: 30 })\n   * @example dt.set({ weekday: 5 })\n   * @example dt.set({ year: 2005, ordinal: 234 })\n   * @return {DateTime}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);\n\n    const settingWeekStuff =\n        !isUndefined(normalized.weekYear) ||\n        !isUndefined(normalized.weekNumber) ||\n        !isUndefined(normalized.weekday),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    let mixed;\n    if (settingWeekStuff) {\n      mixed = weekToGregorian(\n        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },\n        minDaysInFirstWeek,\n        startOfWeek\n      );\n    } else if (!isUndefined(normalized.ordinal)) {\n      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });\n    } else {\n      mixed = { ...this.toObject(), ...normalized };\n\n      // if we didn't set the day but we ended up on an overflow date,\n      // use the last day of the right month\n      if (isUndefined(normalized.day)) {\n        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);\n      }\n    }\n\n    const [ts, o] = objToTS(mixed, this.o, this.zone);\n    return clone(this, { ts, o });\n  }\n\n  /**\n   * Add a period of time to this DateTime and return the resulting DateTime\n   *\n   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @example DateTime.now().plus(123) //~> in 123 milliseconds\n   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes\n   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow\n   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday\n   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min\n   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min\n   * @return {DateTime}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration);\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * Subtract a period of time to this DateTime and return the resulting DateTime\n   * See {@link DateTime#plus}\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   @return {DateTime}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration).negate();\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * \"Set\" this DateTime to the beginning of a unit of time.\n   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'\n   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'\n   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'\n   * @return {DateTime}\n   */\n  startOf(unit, { useLocaleWeeks = false } = {}) {\n    if (!this.isValid) return this;\n\n    const o = {},\n      normalizedUnit = Duration.normalizeUnit(unit);\n    switch (normalizedUnit) {\n      case \"years\":\n        o.month = 1;\n      // falls through\n      case \"quarters\":\n      case \"months\":\n        o.day = 1;\n      // falls through\n      case \"weeks\":\n      case \"days\":\n        o.hour = 0;\n      // falls through\n      case \"hours\":\n        o.minute = 0;\n      // falls through\n      case \"minutes\":\n        o.second = 0;\n      // falls through\n      case \"seconds\":\n        o.millisecond = 0;\n        break;\n      case \"milliseconds\":\n        break;\n      // no default, invalid units throw in normalizeUnit()\n    }\n\n    if (normalizedUnit === \"weeks\") {\n      if (useLocaleWeeks) {\n        const startOfWeek = this.loc.getStartOfWeek();\n        const { weekday } = this;\n        if (weekday < startOfWeek) {\n          o.weekNumber = this.weekNumber - 1;\n        }\n        o.weekday = startOfWeek;\n      } else {\n        o.weekday = 1;\n      }\n    }\n\n    if (normalizedUnit === \"quarters\") {\n      const q = Math.ceil(this.month / 3);\n      o.month = (q - 1) * 3 + 1;\n    }\n\n    return this.set(o);\n  }\n\n  /**\n   * \"Set\" this DateTime to the end (meaning the last millisecond) of a unit of time\n   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'\n   * @return {DateTime}\n   */\n  endOf(unit, opts) {\n    return this.isValid\n      ? this.plus({ [unit]: 1 })\n          .startOf(unit, opts)\n          .minus(1)\n      : this;\n  }\n\n  // OUTPUT\n\n  /**\n   * Returns a string representation of this DateTime formatted according to the specified format string.\n   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'\n   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: \"fr\" }) //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat(\"HH 'hours and' mm 'minutes'\") //=> '20 hours and 55 minutes'\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.\n   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation\n   * of the DateTime in the assigned locale.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toLocaleString(); //=> 4/20/2017\n   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'\n   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'\n   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'\n   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'\n   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'\n   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an array of format \"parts\", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts\n   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.\n   * @example DateTime.now().toLocaleParts(); //=> [\n   *                                   //=>   { type: 'day', value: '25' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'month', value: '05' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'year', value: '1982' }\n   *                                   //=> ]\n   */\n  toLocaleParts(opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)\n      : [];\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'\n   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'\n   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'\n   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'\n   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'\n   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'\n   * @return {string|null}\n   */\n  toISO({\n    format = \"extended\",\n    suppressSeconds = false,\n    suppressMilliseconds = false,\n    includeOffset = true,\n    extendedZone = false,\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    const ext = format === \"extended\";\n\n    let c = toISODate(this, ext, precision);\n    if (orderedUnits.indexOf(precision) >= 3) c += \"T\";\n    c += toISOTime(\n      this,\n      ext,\n      suppressSeconds,\n      suppressMilliseconds,\n      includeOffset,\n      extendedZone,\n      precision\n    );\n    return c;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's date component\n   * @param {Object} opts - options\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.\n   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'\n   * @return {string|null}\n   */\n  toISODate({ format = \"extended\", precision = \"day\" } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, format === \"extended\", normalizeUnit(precision));\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's week date\n   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'\n   * @return {string}\n   */\n  toISOWeekDate() {\n    return toTechFormat(this, \"kkkk-'W'WW-c\");\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's time component\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'\n   * @return {string}\n   */\n  toISOTime({\n    suppressMilliseconds = false,\n    suppressSeconds = false,\n    includeOffset = true,\n    includePrefix = false,\n    extendedZone = false,\n    format = \"extended\",\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? \"T\" : \"\";\n    return (\n      c +\n      toISOTime(\n        this,\n        format === \"extended\",\n        suppressSeconds,\n        suppressMilliseconds,\n        includeOffset,\n        extendedZone,\n        precision\n      )\n    );\n  }\n\n  /**\n   * Returns an RFC 2822-compatible string representation of this DateTime\n   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'\n   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'\n   * @return {string}\n   */\n  toRFC2822() {\n    return toTechFormat(this, \"EEE, dd LLL yyyy HH:mm:ss ZZZ\", false);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.\n   * Specifically, the string conforms to RFC 1123.\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'\n   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'\n   * @return {string}\n   */\n  toHTTP() {\n    return toTechFormat(this.toUTC(), \"EEE, dd LLL yyyy HH:mm:ss 'GMT'\");\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Date\n   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'\n   * @return {string|null}\n   */\n  toSQLDate() {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Time\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc().toSQL() //=> '05:15:16.345'\n   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'\n   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'\n   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'\n   * @return {string}\n   */\n  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {\n    let fmt = \"HH:mm:ss.SSS\";\n\n    if (includeZone || includeOffset) {\n      if (includeOffsetSpace) {\n        fmt += \" \";\n      }\n      if (includeZone) {\n        fmt += \"z\";\n      } else if (includeOffset) {\n        fmt += \"ZZ\";\n      }\n    }\n\n    return toTechFormat(this, fmt, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'\n   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'\n   * @return {string}\n   */\n  toSQL(opts = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for debugging\n   * @return {string}\n   */\n  toString() {\n    return this.isValid ? this.toISO() : INVALID;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;\n    } else {\n      return `DateTime { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime.\n   * @return {number}\n   */\n  toMillis() {\n    return this.isValid ? this.ts : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.\n   * @return {number}\n   */\n  toSeconds() {\n    return this.isValid ? this.ts / 1000 : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (as a whole number) of this DateTime.\n   * @return {number}\n   */\n  toUnixInteger() {\n    return this.isValid ? Math.floor(this.ts / 1000) : NaN;\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a BSON serializable equivalent to this DateTime.\n   * @return {Date}\n   */\n  toBSON() {\n    return this.toJSDate();\n  }\n\n  /**\n   * Returns a JavaScript object with this DateTime's year, month, day, and so on.\n   * @param opts - options for generating the object\n   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output\n   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }\n   * @return {Object}\n   */\n  toObject(opts = {}) {\n    if (!this.isValid) return {};\n\n    const base = { ...this.c };\n\n    if (opts.includeConfig) {\n      base.outputCalendar = this.outputCalendar;\n      base.numberingSystem = this.loc.numberingSystem;\n      base.locale = this.loc.locale;\n    }\n    return base;\n  }\n\n  /**\n   * Returns a JavaScript Date equivalent to this DateTime.\n   * @return {Date}\n   */\n  toJSDate() {\n    return new Date(this.isValid ? this.ts : NaN);\n  }\n\n  // COMPARE\n\n  /**\n   * Return the difference between two DateTimes as a Duration.\n   * @param {DateTime} otherDateTime - the DateTime to compare this one to\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example\n   * var i1 = DateTime.fromISO('1982-05-25T09:45'),\n   *     i2 = DateTime.fromISO('1983-10-14T10:30');\n   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }\n   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }\n   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }\n   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }\n   * @return {Duration}\n   */\n  diff(otherDateTime, unit = \"milliseconds\", opts = {}) {\n    if (!this.isValid || !otherDateTime.isValid) {\n      return Duration.invalid(\"created by diffing an invalid DateTime\");\n    }\n\n    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };\n\n    const units = maybeArray(unit).map(Duration.normalizeUnit),\n      otherIsLater = otherDateTime.valueOf() > this.valueOf(),\n      earlier = otherIsLater ? this : otherDateTime,\n      later = otherIsLater ? otherDateTime : this,\n      diffed = diff(earlier, later, units, durOpts);\n\n    return otherIsLater ? diffed.negate() : diffed;\n  }\n\n  /**\n   * Return the difference between this DateTime and right now.\n   * See {@link DateTime#diff}\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  diffNow(unit = \"milliseconds\", opts = {}) {\n    return this.diff(DateTime.now(), unit, opts);\n  }\n\n  /**\n   * Return an Interval spanning between this DateTime and another DateTime\n   * @param {DateTime} otherDateTime - the other end point of the Interval\n   * @return {Interval|DateTime}\n   */\n  until(otherDateTime) {\n    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;\n  }\n\n  /**\n   * Return whether this DateTime is in the same unit of time as another DateTime.\n   * Higher-order units must also be identical for this function to return `true`.\n   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.\n   * @param {DateTime} otherDateTime - the other DateTime\n   * @param {string} unit - the unit of time to check sameness on\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used\n   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day\n   * @return {boolean}\n   */\n  hasSame(otherDateTime, unit, opts) {\n    if (!this.isValid) return false;\n\n    const inputMs = otherDateTime.valueOf();\n    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });\n    return (\n      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)\n    );\n  }\n\n  /**\n   * Equality check\n   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.\n   * To compare just the millisecond values, use `+dt1 === +dt2`.\n   * @param {DateTime} other - the other DateTime\n   * @return {boolean}\n   */\n  equals(other) {\n    return (\n      this.isValid &&\n      other.isValid &&\n      this.valueOf() === other.valueOf() &&\n      this.zone.equals(other.zone) &&\n      this.loc.equals(other.loc)\n    );\n  }\n\n  /**\n   * Returns a string representation of a this time relative to now, such as \"in two days\". Can only internationalize if your\n   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} [options.style=\"long\"] - the style of units, must be \"long\", \"short\", or \"narrow\"\n   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of \"years\", \"quarters\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", or \"seconds\"\n   * @param {boolean} [options.round=true] - whether to round the numbers in the output.\n   * @param {string} [options.rounding=\"trunc\"] - rounding method to use when rounding the numbers in the output. Can be \"trunc\" (toward zero), \"expand\" (away from zero), \"round\", \"floor\", or \"ceil\".\n   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> \"in 1 day\"\n   * @example DateTime.now().setLocale(\"es\").toRelative({ days: 1 }) //=> \"dentro de 1 día\"\n   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: \"fr\" }) //=> \"dans 23 heures\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> \"2 days ago\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: \"hours\" }) //=> \"48 hours ago\"\n   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> \"1.5 days ago\"\n   */\n  toRelative(options = {}) {\n    if (!this.isValid) return null;\n    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),\n      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;\n    let units = [\"years\", \"months\", \"days\", \"hours\", \"minutes\", \"seconds\"];\n    let unit = options.unit;\n    if (Array.isArray(options.unit)) {\n      units = options.unit;\n      unit = undefined;\n    }\n    return diffRelative(base, this.plus(padding), {\n      ...options,\n      numeric: \"always\",\n      units,\n      unit,\n    });\n  }\n\n  /**\n   * Returns a string representation of this date relative to today, such as \"yesterday\" or \"next month\".\n   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of \"years\", \"quarters\", \"months\", \"weeks\", or \"days\"\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> \"tomorrow\"\n   * @example DateTime.now().setLocale(\"es\").plus({ days: 1 }).toRelative() //=> \"\"mañana\"\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: \"fr\" }) //=> \"demain\"\n   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> \"2 days ago\"\n   */\n  toRelativeCalendar(options = {}) {\n    if (!this.isValid) return null;\n\n    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {\n      ...options,\n      numeric: \"auto\",\n      units: [\"years\", \"months\", \"days\"],\n      calendary: true,\n    });\n  }\n\n  /**\n   * Return the min of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum\n   * @return {DateTime} the min DateTime, or undefined if called with no argument\n   */\n  static min(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"min requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);\n  }\n\n  /**\n   * Return the max of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum\n   * @return {DateTime} the max DateTime, or undefined if called with no argument\n   */\n  static max(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"max requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);\n  }\n\n  // MISC\n\n  /**\n   * Explain how a string would be parsed by fromFormat()\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see description)\n   * @param {Object} options - options taken by fromFormat()\n   * @return {Object}\n   */\n  static fromFormatExplain(text, fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return explainFromTokens(localeToUse, text, fmt);\n  }\n\n  /**\n   * @deprecated use fromFormatExplain instead\n   */\n  static fromStringExplain(text, fmt, options = {}) {\n    return DateTime.fromFormatExplain(text, fmt, options);\n  }\n\n  /**\n   * Build a parser for `fmt` using the given locale. This parser can be passed\n   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This\n   * can be used to optimize cases where many dates need to be parsed in a\n   * specific format.\n   *\n   * @param {String} fmt - the format the string is expected to be in (see\n   * description)\n   * @param {Object} options - options used to set locale and numberingSystem\n   * for parser\n   * @returns {TokenParser} - opaque object to be used\n   */\n  static buildFormatParser(fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return new TokenParser(localeToUse, fmt);\n  }\n\n  /**\n   * Create a DateTime from an input string and format parser.\n   *\n   * The format parser must have been created with the same locale as this call.\n   *\n   * @param {String} text - the string to parse\n   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}\n   * @param {Object} opts - options taken by fromFormat()\n   * @returns {DateTime}\n   */\n  static fromFormatParser(text, formatParser, opts = {}) {\n    if (isUndefined(text) || isUndefined(formatParser)) {\n      throw new InvalidArgumentError(\n        \"fromFormatParser requires an input string and a format parser\"\n      );\n    }\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n\n    if (!localeToUse.equals(formatParser.locale)) {\n      throw new InvalidArgumentError(\n        `fromFormatParser called with a locale of ${localeToUse}, ` +\n          `but the format parser was created for ${formatParser.locale}`\n      );\n    }\n\n    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);\n\n    if (invalidReason) {\n      return DateTime.invalid(invalidReason);\n    } else {\n      return parseDataToDateTime(\n        result,\n        zone,\n        opts,\n        `format ${formatParser.format}`,\n        text,\n        specificOffset\n      );\n    }\n  }\n\n  // FORMAT PRESETS\n\n  /**\n   * {@link DateTime#toLocaleString} format like 10/14/1983\n   * @type {Object}\n   */\n  static get DATE_SHORT() {\n    return Formats.DATE_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED() {\n    return Formats.DATE_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED_WITH_WEEKDAY() {\n    return Formats.DATE_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_FULL() {\n    return Formats.DATE_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_HUGE() {\n    return Formats.DATE_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_SIMPLE() {\n    return Formats.TIME_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SECONDS() {\n    return Formats.TIME_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SHORT_OFFSET() {\n    return Formats.TIME_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_LONG_OFFSET() {\n    return Formats.TIME_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_SIMPLE() {\n    return Formats.TIME_24_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SECONDS() {\n    return Formats.TIME_24_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SHORT_OFFSET() {\n    return Formats.TIME_24_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_LONG_OFFSET() {\n    return Formats.TIME_24_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT() {\n    return Formats.DATETIME_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT_WITH_SECONDS() {\n    return Formats.DATETIME_SHORT_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED() {\n    return Formats.DATETIME_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_SECONDS() {\n    return Formats.DATETIME_MED_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_WEEKDAY() {\n    return Formats.DATETIME_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL() {\n    return Formats.DATETIME_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL_WITH_SECONDS() {\n    return Formats.DATETIME_FULL_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE() {\n    return Formats.DATETIME_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE_WITH_SECONDS() {\n    return Formats.DATETIME_HUGE_WITH_SECONDS;\n  }\n}\n\n/**\n * @private\n */\nexport function friendlyDateTime(dateTimeish) {\n  if (DateTime.isDateTime(dateTimeish)) {\n    return dateTimeish;\n  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {\n    return DateTime.fromJSDate(dateTimeish);\n  } else if (dateTimeish && typeof dateTimeish === \"object\") {\n    return DateTime.fromObject(dateTimeish);\n  } else {\n    throw new InvalidArgumentError(\n      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`\n    );\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Info from \"./info.js\";\nimport Zone from \"./zone.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport InvalidZone from \"./zones/invalidZone.js\";\nimport SystemZone from \"./zones/systemZone.js\";\nimport Settings from \"./settings.js\";\n\nconst VERSION = \"3.7.2\";\n\nexport {\n  VERSION,\n  DateTime,\n  Duration,\n  Interval,\n  Info,\n  Zone,\n  FixedOffsetZone,\n  IANAZone,\n  InvalidZone,\n  SystemZone,\n  Settings,\n};\n"],"names":["singleton","English.formatRelativeTime","English.months","English.weekdays","English.meridiems","English.eras","Formats.DATE_SHORT","Formats.DATE_MED","Formats.DATE_FULL","Formats.DATE_HUGE","Formats.TIME_SIMPLE","Formats.TIME_WITH_SECONDS","Formats.TIME_WITH_SHORT_OFFSET","Formats.TIME_WITH_LONG_OFFSET","Formats.TIME_24_SIMPLE","Formats.TIME_24_WITH_SECONDS","Formats.TIME_24_WITH_SHORT_OFFSET","Formats.TIME_24_WITH_LONG_OFFSET","Formats.DATETIME_SHORT","Formats.DATETIME_MED","Formats.DATETIME_FULL","Formats.DATETIME_HUGE","Formats.DATETIME_SHORT_WITH_SECONDS","Formats.DATETIME_MED_WITH_SECONDS","Formats.DATETIME_FULL_WITH_SECONDS","Formats.DATETIME_HUGE_WITH_SECONDS","English.meridiemForDateTime","English.monthForDateTime","English.weekdayForDateTime","English.eraForDateTime","English.monthsShort","English.weekdaysLong","English.weekdaysShort","INVALID","orderedUnits","clone","Formats.DATE_MED_WITH_WEEKDAY","Formats.DATETIME_MED_WITH_WEEKDAY"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA,MAAM,UAAU,SAAS,KAAK,CAAC,EAAE;AACjC;AACA;AACA;AACA;AACO,MAAM,oBAAoB,SAAS,UAAU,CAAC;AACrD,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,KAAK,CAAC,CAAC,kBAAkB,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;AACrD,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,MAAM,oBAAoB,SAAS,UAAU,CAAC;AACrD,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,KAAK,CAAC,CAAC,kBAAkB,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;AACrD,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,MAAM,oBAAoB,SAAS,UAAU,CAAC;AACrD,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,KAAK,CAAC,CAAC,kBAAkB,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;AACrD,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,MAAM,6BAA6B,SAAS,UAAU,CAAC,EAAE;AAChE;AACA;AACA;AACA;AACO,MAAM,gBAAgB,SAAS,UAAU,CAAC;AACjD,EAAE,WAAW,CAAC,IAAI,EAAE;AACpB,IAAI,KAAK,CAAC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAClC,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,MAAM,oBAAoB,SAAS,UAAU,CAAC,EAAE;AACvD;AACA;AACA;AACA;AACO,MAAM,mBAAmB,SAAS,UAAU,CAAC;AACpD,EAAE,WAAW,GAAG;AAChB,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;AACvC,GAAG;AACH;;AC5DA;AACA;AACA;AACA;AACA,MAAM,CAAC,GAAG,SAAS;AACnB,EAAE,CAAC,GAAG,OAAO;AACb,EAAE,CAAC,GAAG,MAAM,CAAC;AACb;AACO,MAAM,UAAU,GAAG;AAC1B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,CAAC,CAAC;AACF;AACO,MAAM,QAAQ,GAAG;AACxB,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,CAAC,CAAC;AACF;AACO,MAAM,qBAAqB,GAAG;AACrC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AACF;AACO,MAAM,SAAS,GAAG;AACzB,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,CAAC,CAAC;AACF;AACO,MAAM,SAAS,GAAG;AACzB,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AACF;AACO,MAAM,WAAW,GAAG;AAC3B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,iBAAiB,GAAG;AACjC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,sBAAsB,GAAG;AACtC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,qBAAqB,GAAG;AACrC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,cAAc,GAAG;AAC9B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,SAAS,EAAE,KAAK;AAClB,CAAC,CAAC;AACF;AACO,MAAM,oBAAoB,GAAG;AACpC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,SAAS,EAAE,KAAK;AAClB,CAAC,CAAC;AACF;AACO,MAAM,yBAAyB,GAAG;AACzC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,SAAS,EAAE,KAAK;AAClB,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,wBAAwB,GAAG;AACxC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,SAAS,EAAE,KAAK;AAClB,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,cAAc,GAAG;AAC9B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,2BAA2B,GAAG;AAC3C,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,YAAY,GAAG;AAC5B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,yBAAyB,GAAG;AACzC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,yBAAyB,GAAG;AACzC,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,OAAO,EAAE,CAAC;AACZ,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACO,MAAM,aAAa,GAAG;AAC7B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,0BAA0B,GAAG;AAC1C,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,aAAa,GAAG;AAC7B,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,OAAO,EAAE,CAAC;AACZ,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC,CAAC;AACF;AACO,MAAM,0BAA0B,GAAG;AAC1C,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,OAAO,EAAE,CAAC;AACZ,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,YAAY,EAAE,CAAC;AACjB,CAAC;;AC7KD;AACA;AACA;AACe,MAAM,IAAI,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,QAAQ,GAAG;AACjB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC;AACrB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,EAAE,EAAE,IAAI,EAAE;AACvB,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE;AAC3B,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,EAAE,EAAE;AACb,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,SAAS,EAAE;AACpB,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,MAAM,IAAI,mBAAmB,EAAE,CAAC;AACpC,GAAG;AACH;;AC7FA,IAAIA,WAAS,GAAG,IAAI,CAAC;AACrB;AACA;AACA;AACA;AACA;AACe,MAAM,UAAU,SAAS,IAAI,CAAC;AAC7C;AACA;AACA;AACA;AACA,EAAE,WAAW,QAAQ,GAAG;AACxB,IAAI,IAAIA,WAAS,KAAK,IAAI,EAAE;AAC5B,MAAMA,WAAS,GAAG,IAAI,UAAU,EAAE,CAAC;AACnC,KAAK;AACL,IAAI,OAAOA,WAAS,CAAC;AACrB,GAAG;AACH;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,QAAQ,CAAC;AACpB,GAAG;AACH;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;AAChE,GAAG;AACH;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA,EAAE,UAAU,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;AACrC,IAAI,OAAO,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAC7C,GAAG;AACH;AACA;AACA,EAAE,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE;AAC3B,IAAI,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;AACjD,GAAG;AACH;AACA;AACA,EAAE,MAAM,CAAC,EAAE,EAAE;AACb,IAAI,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,iBAAiB,EAAE,CAAC;AAC7C,GAAG;AACH;AACA;AACA,EAAE,MAAM,CAAC,SAAS,EAAE;AACpB,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,QAAQ,CAAC;AACvC,GAAG;AACH;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;;ACzDA,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;AAC3B,SAAS,OAAO,CAAC,QAAQ,EAAE;AAC3B,EAAE,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AACnC,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE;AACzB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE;AAC3C,MAAM,MAAM,EAAE,KAAK;AACnB,MAAM,QAAQ,EAAE,QAAQ;AACxB,MAAM,IAAI,EAAE,SAAS;AACrB,MAAM,KAAK,EAAE,SAAS;AACtB,MAAM,GAAG,EAAE,SAAS;AACpB,MAAM,IAAI,EAAE,SAAS;AACrB,MAAM,MAAM,EAAE,SAAS;AACvB,MAAM,MAAM,EAAE,SAAS;AACvB,MAAM,GAAG,EAAE,OAAO;AAClB,KAAK,CAAC,CAAC;AACP,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAChC,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA,MAAM,SAAS,GAAG;AAClB,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,KAAK,EAAE,CAAC;AACV,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,IAAI,EAAE,CAAC;AACT,EAAE,MAAM,EAAE,CAAC;AACX,EAAE,MAAM,EAAE,CAAC;AACX,CAAC,CAAC;AACF;AACA,SAAS,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE;AAChC,EAAE,MAAM,SAAS,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;AAC3D,IAAI,MAAM,GAAG,iDAAiD,CAAC,IAAI,CAAC,SAAS,CAAC;AAC9E,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC;AACvE,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AACjE,CAAC;AACD;AACA,SAAS,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE;AAChC,EAAE,MAAM,SAAS,GAAG,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;AAC5C,EAAE,MAAM,MAAM,GAAG,EAAE,CAAC;AACpB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,IAAI,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AACzC,IAAI,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;AAChC;AACA,IAAI,IAAI,IAAI,KAAK,KAAK,EAAE;AACxB,MAAM,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAC1B,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;AAClC,MAAM,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AACxC,KAAK;AACL,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACA,MAAM,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;AAChC;AACA;AACA;AACA;AACe,MAAM,QAAQ,SAAS,IAAI,CAAC;AAC3C;AACA;AACA;AACA;AACA,EAAE,OAAO,MAAM,CAAC,IAAI,EAAE;AACtB,IAAI,IAAI,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACvC,IAAI,IAAI,IAAI,KAAK,SAAS,EAAE;AAC5B,MAAM,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3D,KAAK;AACL,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,GAAG;AACtB,IAAI,aAAa,CAAC,KAAK,EAAE,CAAC;AAC1B,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;AACrB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,gBAAgB,CAAC,CAAC,EAAE;AAC7B,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;AAC/B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,WAAW,CAAC,IAAI,EAAE;AAC3B,IAAI,IAAI,CAAC,IAAI,EAAE;AACf,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK;AACL,IAAI,IAAI;AACR,MAAM,IAAI,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC;AACpE,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,CAAC,OAAO,CAAC,EAAE;AAChB,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK;AACL,GAAG;AACH;AACA,EAAE,WAAW,CAAC,IAAI,EAAE;AACpB,IAAI,KAAK,EAAE,CAAC;AACZ;AACA,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;AACzB;AACA,IAAI,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AAC5C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC;AACzB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;AACrC,IAAI,OAAO,aAAa,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACxD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE;AAC3B,IAAI,OAAO,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,EAAE,EAAE;AACb,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,GAAG,CAAC;AAChC,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;AAC9B;AACA,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,GAAG,CAAC;AAChC;AACA,IAAI,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACnC,IAAI,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,aAAa;AAC5E,QAAQ,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC;AAC9B,QAAQ,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AAC/B;AACA,IAAI,IAAI,MAAM,KAAK,IAAI,EAAE;AACzB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACjC,KAAK;AACL;AACA;AACA,IAAI,MAAM,YAAY,GAAG,IAAI,KAAK,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC;AAChD;AACA,IAAI,MAAM,KAAK,GAAG,YAAY,CAAC;AAC/B,MAAM,IAAI;AACV,MAAM,KAAK;AACX,MAAM,GAAG;AACT,MAAM,IAAI,EAAE,YAAY;AACxB,MAAM,MAAM;AACZ,MAAM,MAAM;AACZ,MAAM,WAAW,EAAE,CAAC;AACpB,KAAK,CAAC,CAAC;AACP;AACA,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;AACrB,IAAI,MAAM,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAC7B,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAC3C,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,SAAS,EAAE;AACpB,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,MAAM,IAAI,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;AACrE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC;AACtB,GAAG;AACH;;ACpOA;AACA;AACA,IAAI,WAAW,GAAG,EAAE,CAAC;AACrB,SAAS,WAAW,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE;AAC3C,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,EAAE,IAAI,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;AAC7B,EAAE,IAAI,CAAC,GAAG,EAAE;AACZ,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAC/C,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;AAC3B,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,SAAS,YAAY,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE;AAC5C,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,EAAE,IAAI,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACjC,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE;AACzB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACnD,IAAI,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9B,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;AAC/B,SAAS,YAAY,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE;AAC5C,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;AAChD,EAAE,IAAI,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAClC,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE;AACzB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACjD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/B,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA,MAAM,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;AAC/B,SAAS,YAAY,CAAC,SAAS,EAAE,IAAI,GAAG,EAAE,EAAE;AAC5C,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,YAAY,EAAE,GAAG,IAAI,CAAC;AACzC,EAAE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AACxD,EAAE,IAAI,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAClC,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE;AACzB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACvD,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/B,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA,IAAI,cAAc,GAAG,IAAI,CAAC;AAC1B,SAAS,YAAY,GAAG;AACxB,EAAE,IAAI,cAAc,EAAE;AACtB,IAAI,OAAO,cAAc,CAAC;AAC1B,GAAG,MAAM;AACT,IAAI,cAAc,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC,eAAe,EAAE,CAAC,MAAM,CAAC;AACxE,IAAI,OAAO,cAAc,CAAC;AAC1B,GAAG;AACH,CAAC;AACD;AACA,MAAM,wBAAwB,GAAG,IAAI,GAAG,EAAE,CAAC;AAC3C,SAAS,2BAA2B,CAAC,SAAS,EAAE;AAChD,EAAE,IAAI,IAAI,GAAG,wBAAwB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AACrD,EAAE,IAAI,IAAI,KAAK,SAAS,EAAE;AAC1B,IAAI,IAAI,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,eAAe,EAAE,CAAC;AAChE,IAAI,wBAAwB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAClD,GAAG;AACH,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;AACD;AACA,MAAM,aAAa,GAAG,IAAI,GAAG,EAAE,CAAC;AAChC,SAAS,iBAAiB,CAAC,SAAS,EAAE;AACtC,EAAE,IAAI,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;AAC1C,EAAE,IAAI,CAAC,IAAI,EAAE;AACb,IAAI,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AAC9C;AACA,IAAI,IAAI,GAAG,aAAa,IAAI,MAAM,GAAG,MAAM,CAAC,WAAW,EAAE,GAAG,MAAM,CAAC,QAAQ,CAAC;AAC5E;AACA,IAAI,IAAI,EAAE,aAAa,IAAI,IAAI,CAAC,EAAE;AAClC,MAAM,IAAI,GAAG,EAAE,GAAG,oBAAoB,EAAE,GAAG,IAAI,EAAE,CAAC;AAClD,KAAK;AACL,IAAI,aAAa,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACvC,GAAG;AACH,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;AACD;AACA,SAAS,iBAAiB,CAAC,SAAS,EAAE;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1C,EAAE,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE;AACrB,IAAI,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC/C,GAAG;AACH;AACA,EAAE,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1C,EAAE,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE;AACrB,IAAI,OAAO,CAAC,SAAS,CAAC,CAAC;AACvB,GAAG,MAAM;AACT,IAAI,IAAI,OAAO,CAAC;AAChB,IAAI,IAAI,WAAW,CAAC;AACpB,IAAI,IAAI;AACR,MAAM,OAAO,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,eAAe,EAAE,CAAC;AAC1D,MAAM,WAAW,GAAG,SAAS,CAAC;AAC9B,KAAK,CAAC,OAAO,CAAC,EAAE;AAChB,MAAM,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACrD,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,eAAe,EAAE,CAAC;AACxD,MAAM,WAAW,GAAG,OAAO,CAAC;AAC5B,KAAK;AACL;AACA,IAAI,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;AAClD,IAAI,OAAO,CAAC,WAAW,EAAE,eAAe,EAAE,QAAQ,CAAC,CAAC;AACpD,GAAG;AACH,CAAC;AACD;AACA,SAAS,gBAAgB,CAAC,SAAS,EAAE,eAAe,EAAE,cAAc,EAAE;AACtE,EAAE,IAAI,cAAc,IAAI,eAAe,EAAE;AACzC,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;AACpC,MAAM,SAAS,IAAI,IAAI,CAAC;AACxB,KAAK;AACL;AACA,IAAI,IAAI,cAAc,EAAE;AACxB,MAAM,SAAS,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC;AAC3C,KAAK;AACL;AACA,IAAI,IAAI,eAAe,EAAE;AACzB,MAAM,SAAS,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC;AAC5C,KAAK;AACL,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG,MAAM;AACT,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG;AACH,CAAC;AACD;AACA,SAAS,SAAS,CAAC,CAAC,EAAE;AACtB,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AAChB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnB,GAAG;AACH,EAAE,OAAO,EAAE,CAAC;AACZ,CAAC;AACD;AACA,SAAS,WAAW,CAAC,CAAC,EAAE;AACxB,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AAChB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC/B,IAAI,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;AAC9C,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnB,GAAG;AACH,EAAE,OAAO,EAAE,CAAC;AACZ,CAAC;AACD;AACA,SAAS,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE;AACnD,EAAE,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;AACjC;AACA,EAAE,IAAI,IAAI,KAAK,OAAO,EAAE;AACxB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,MAAM,IAAI,IAAI,KAAK,IAAI,EAAE;AAC5B,IAAI,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;AAC7B,GAAG,MAAM;AACT,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC;AAC1B,GAAG;AACH,CAAC;AACD;AACA,SAAS,mBAAmB,CAAC,GAAG,EAAE;AAClC,EAAE,IAAI,GAAG,CAAC,eAAe,IAAI,GAAG,CAAC,eAAe,KAAK,MAAM,EAAE;AAC7D,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,MAAM;AACT,IAAI;AACJ,MAAM,GAAG,CAAC,eAAe,KAAK,MAAM;AACpC,MAAM,CAAC,GAAG,CAAC,MAAM;AACjB,MAAM,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC;AACjC,MAAM,2BAA2B,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,eAAe,KAAK,MAAM;AACxE,MAAM;AACN,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,MAAM,mBAAmB,CAAC;AAC1B,EAAE,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE;AACvC,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;AACjC,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC;AACrC;AACA,IAAI,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC;AAChD;AACA,IAAI,IAAI,CAAC,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC3D,MAAM,MAAM,QAAQ,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,CAAC;AACvD,MAAM,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAAC;AACrE,MAAM,IAAI,CAAC,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC9C,KAAK;AACL,GAAG;AACH;AACA,EAAE,MAAM,CAAC,CAAC,EAAE;AACZ,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE;AAClB,MAAM,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACnD,MAAM,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACpC,KAAK,MAAM;AACX;AACA,MAAM,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/D,MAAM,OAAO,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AACzC,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,MAAM,iBAAiB,CAAC;AACxB,EAAE,WAAW,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;AAC9B,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACrB,IAAI,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;AAClC;AACA,IAAI,IAAI,CAAC,GAAG,SAAS,CAAC;AACtB,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;AAC5B;AACA,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;AACnB,KAAK,MAAM,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAC9C,MAAM,MAAM,OAAO,GAAG,SAAS,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;AACtF,MAAM,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE;AAC7D,QAAQ,CAAC,GAAG,OAAO,CAAC;AACpB,QAAQ,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;AACrB,OAAO,MAAM;AACb;AACA;AACA,QAAQ,CAAC,GAAG,KAAK,CAAC;AAClB,QAAQ,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;AACxF,QAAQ,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC,IAAI,CAAC;AACpC,OAAO;AACP,KAAK,MAAM,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;AAC1C,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;AACnB,KAAK,MAAM,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE;AACxC,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;AACnB,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;AACvB,KAAK,MAAM;AACX;AACA;AACA,MAAM,CAAC,GAAG,KAAK,CAAC;AAChB,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;AAC/D,MAAM,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC,IAAI,CAAC;AAClC,KAAK;AACL;AACA,IAAI,MAAM,QAAQ,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;AACtC,IAAI,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,IAAI,CAAC,CAAC;AAC/C,IAAI,IAAI,CAAC,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC5C,GAAG;AACH;AACA,EAAE,MAAM,GAAG;AACX,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;AAC3B;AACA;AACA,MAAM,OAAO,IAAI,CAAC,aAAa,EAAE;AACjC,SAAS,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,KAAK,CAAC;AAClC,SAAS,IAAI,CAAC,EAAE,CAAC,CAAC;AAClB,KAAK;AACL,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;AAC/C,GAAG;AACH;AACA,EAAE,aAAa,GAAG;AAClB,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;AAC7D,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;AAC3B,MAAM,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK;AACjC,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE;AAC1C,UAAU,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACtE,YAAY,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM;AAClC,YAAY,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY;AAC1C,WAAW,CAAC,CAAC;AACb,UAAU,OAAO;AACjB,YAAY,GAAG,IAAI;AACnB,YAAY,KAAK,EAAE,UAAU;AAC7B,WAAW,CAAC;AACZ,SAAS,MAAM;AACf,UAAU,OAAO,IAAI,CAAC;AACtB,SAAS;AACT,OAAO,CAAC,CAAC;AACT,KAAK;AACL,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA,EAAE,eAAe,GAAG;AACpB,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,CAAC;AACtC,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA,MAAM,gBAAgB,CAAC;AACvB,EAAE,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE;AACrC,IAAI,IAAI,CAAC,IAAI,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC;AAC3C,IAAI,IAAI,CAAC,SAAS,IAAI,WAAW,EAAE,EAAE;AACrC,MAAM,IAAI,CAAC,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC1C,KAAK;AACL,GAAG;AACH;AACA,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE;AACtB,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE;AAClB,MAAM,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAC1C,KAAK,MAAM;AACX,MAAM,OAAOC,kBAA0B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,MAAM,CAAC,CAAC;AACpG,KAAK;AACL,GAAG;AACH;AACA,EAAE,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE;AAC7B,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE;AAClB,MAAM,OAAO,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACjD,KAAK,MAAM;AACX,MAAM,OAAO,EAAE,CAAC;AAChB,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA,MAAM,oBAAoB,GAAG;AAC7B,EAAE,QAAQ,EAAE,CAAC;AACb,EAAE,WAAW,EAAE,CAAC;AAChB,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACjB,CAAC,CAAC;AACF;AACA;AACA;AACA;AACe,MAAM,MAAM,CAAC;AAC5B,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE;AACxB,IAAI,OAAO,MAAM,CAAC,MAAM;AACxB,MAAM,IAAI,CAAC,MAAM;AACjB,MAAM,IAAI,CAAC,eAAe;AAC1B,MAAM,IAAI,CAAC,cAAc;AACzB,MAAM,IAAI,CAAC,YAAY;AACvB,MAAM,IAAI,CAAC,WAAW;AACtB,KAAK,CAAC;AACN,GAAG;AACH;AACA,EAAE,OAAO,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,YAAY,EAAE,WAAW,GAAG,KAAK,EAAE;AAC5F,IAAI,MAAM,eAAe,GAAG,MAAM,IAAI,QAAQ,CAAC,aAAa,CAAC;AAC7D;AACA,IAAI,MAAM,OAAO,GAAG,eAAe,KAAK,WAAW,GAAG,OAAO,GAAG,YAAY,EAAE,CAAC,CAAC;AAChF,IAAI,MAAM,gBAAgB,GAAG,eAAe,IAAI,QAAQ,CAAC,sBAAsB,CAAC;AAChF,IAAI,MAAM,eAAe,GAAG,cAAc,IAAI,QAAQ,CAAC,qBAAqB,CAAC;AAC7E,IAAI,MAAM,aAAa,GAAG,oBAAoB,CAAC,YAAY,CAAC,IAAI,QAAQ,CAAC,mBAAmB,CAAC;AAC7F,IAAI,OAAO,IAAI,MAAM,CAAC,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,aAAa,EAAE,eAAe,CAAC,CAAC;AAClG,GAAG;AACH;AACA,EAAE,OAAO,UAAU,GAAG;AACtB,IAAI,cAAc,GAAG,IAAI,CAAC;AAC1B,IAAI,WAAW,CAAC,KAAK,EAAE,CAAC;AACxB,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;AACzB,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;AACzB,IAAI,wBAAwB,CAAC,KAAK,EAAE,CAAC;AACrC,IAAI,aAAa,CAAC,KAAK,EAAE,CAAC;AAC1B,GAAG;AACH;AACA,EAAE,OAAO,UAAU,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,EAAE,EAAE;AACpF,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;AAChF,GAAG;AACH;AACA,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,YAAY,EAAE,eAAe,EAAE;AAChF,IAAI,MAAM,CAAC,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;AAClG;AACA,IAAI,IAAI,CAAC,MAAM,GAAG,YAAY,CAAC;AAC/B,IAAI,IAAI,CAAC,eAAe,GAAG,SAAS,IAAI,qBAAqB,IAAI,IAAI,CAAC;AACtE,IAAI,IAAI,CAAC,cAAc,GAAG,cAAc,IAAI,oBAAoB,IAAI,IAAI,CAAC;AACzE,IAAI,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;AACrC,IAAI,IAAI,CAAC,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,eAAe,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;AACzF;AACA,IAAI,IAAI,CAAC,aAAa,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AACxD,IAAI,IAAI,CAAC,WAAW,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AACtD,IAAI,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;AAC9B,IAAI,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;AACvB;AACA,IAAI,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;AAC3C,IAAI,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAClC,GAAG;AACH;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,EAAE;AACxC,MAAM,IAAI,CAAC,iBAAiB,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC;AACzD,KAAK;AACL;AACA,IAAI,OAAO,IAAI,CAAC,iBAAiB,CAAC;AAClC,GAAG;AACH;AACA,EAAE,WAAW,GAAG;AAChB,IAAI,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;AAC1C,IAAI,MAAM,cAAc;AACxB,MAAM,CAAC,IAAI,CAAC,eAAe,KAAK,IAAI,IAAI,IAAI,CAAC,eAAe,KAAK,MAAM;AACvE,OAAO,IAAI,CAAC,cAAc,KAAK,IAAI,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC;AAC1E,IAAI,OAAO,YAAY,IAAI,cAAc,GAAG,IAAI,GAAG,MAAM,CAAC;AAC1D,GAAG;AACH;AACA,EAAE,KAAK,CAAC,IAAI,EAAE;AACd,IAAI,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;AAChE,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,MAAM;AACX,MAAM,OAAO,MAAM,CAAC,MAAM;AAC1B,QAAQ,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,eAAe;AAC3C,QAAQ,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,eAAe;AACpD,QAAQ,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,cAAc;AAClD,QAAQ,oBAAoB,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,YAAY;AACpE,QAAQ,IAAI,CAAC,WAAW,IAAI,KAAK;AACjC,OAAO,CAAC;AACR,KAAK;AACL,GAAG;AACH;AACA,EAAE,aAAa,CAAC,IAAI,GAAG,EAAE,EAAE;AAC3B,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;AACtD,GAAG;AACH;AACA,EAAE,iBAAiB,CAAC,IAAI,GAAG,EAAE,EAAE;AAC/B,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;AACvD,GAAG;AACH;AACA,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE;AACjC,IAAI,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,EAAEC,MAAc,EAAE,MAAM;AACzD;AACA;AACA;AACA,MAAM,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;AACjF,MAAM,MAAM,IAAI,CAAC,gBAAgB,CAAC;AAClC,MAAM,MAAM,IAAI,GAAG,MAAM,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE;AACjF,QAAQ,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAC;AACrD,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,EAAE;AAChD,QAAQ,MAAM,MAAM,GAAG,CAAC,gBAAgB;AACxC,YAAY,CAAC,EAAE,KAAK,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC;AACnD,YAAY,CAAC,EAAE,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;AACxD,QAAQ,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AAChE,OAAO;AACP,MAAM,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA,EAAE,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,EAAE;AACnC,IAAI,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,EAAEC,QAAgB,EAAE,MAAM;AAC3D,MAAM,MAAM,IAAI,GAAG,MAAM;AACzB,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE;AAC/E,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE;AAC/B,QAAQ,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAC;AACrD,MAAM,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,EAAE;AAClD,QAAQ,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,EAAE;AAC/D,UAAU,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC;AAC3C,SAAS,CAAC;AACV,OAAO;AACP,MAAM,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC;AACnD,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA,EAAE,SAAS,GAAG;AACd,IAAI,OAAO,SAAS;AACpB,MAAM,IAAI;AACV,MAAM,SAAS;AACf,MAAM,MAAMC,SAAiB;AAC7B,MAAM,MAAM;AACZ;AACA;AACA,QAAQ,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;AACjC,UAAU,MAAM,IAAI,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;AAC7D,UAAU,IAAI,CAAC,aAAa,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG;AAClG,YAAY,CAAC,EAAE,KAAK,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC;AACvD,WAAW,CAAC;AACZ,SAAS;AACT;AACA,QAAQ,OAAO,IAAI,CAAC,aAAa,CAAC;AAClC,OAAO;AACP,KAAK,CAAC;AACN,GAAG;AACH;AACA,EAAE,IAAI,CAAC,MAAM,EAAE;AACf,IAAI,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,EAAEC,IAAY,EAAE,MAAM;AACvD,MAAM,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;AACnC;AACA;AACA;AACA,MAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;AAClC,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;AAC3F,UAAU,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC;AACvC,SAAS,CAAC;AACV,OAAO;AACP;AACA,MAAM,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AACnC,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE;AAC/B,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC;AAC7C,MAAM,OAAO,GAAG,EAAE,CAAC,aAAa,EAAE;AAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,CAAC;AACrE,IAAI,OAAO,QAAQ,GAAG,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC;AAC5C,GAAG;AACH;AACA,EAAE,eAAe,CAAC,IAAI,GAAG,EAAE,EAAE;AAC7B;AACA;AACA,IAAI,OAAO,IAAI,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;AAC1F,GAAG;AACH;AACA,EAAE,WAAW,CAAC,EAAE,EAAE,QAAQ,GAAG,EAAE,EAAE;AACjC,IAAI,OAAO,IAAI,iBAAiB,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAC1D,GAAG;AACH;AACA,EAAE,YAAY,CAAC,IAAI,GAAG,EAAE,EAAE;AAC1B,IAAI,OAAO,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;AACnE,GAAG;AACH;AACA,EAAE,aAAa,CAAC,IAAI,GAAG,EAAE,EAAE;AAC3B,IAAI,OAAO,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACxC,GAAG;AACH;AACA,EAAE,SAAS,GAAG;AACd,IAAI;AACJ,MAAM,IAAI,CAAC,MAAM,KAAK,IAAI;AAC1B,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,KAAK,OAAO;AAC3C,MAAM,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC;AACvE,MAAM;AACN,GAAG;AACH;AACA,EAAE,eAAe,GAAG;AACpB,IAAI,IAAI,IAAI,CAAC,YAAY,EAAE;AAC3B,MAAM,OAAO,IAAI,CAAC,YAAY,CAAC;AAC/B,KAAK,MAAM,IAAI,CAAC,iBAAiB,EAAE,EAAE;AACrC,MAAM,OAAO,oBAAoB,CAAC;AAClC,KAAK,MAAM;AACX,MAAM,OAAO,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC5C,KAAK;AACL,GAAG;AACH;AACA,EAAE,cAAc,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC,QAAQ,CAAC;AAC3C,GAAG;AACH;AACA,EAAE,qBAAqB,GAAG;AAC1B,IAAI,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC,WAAW,CAAC;AAC9C,GAAG;AACH;AACA,EAAE,cAAc,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC,OAAO,CAAC;AAC1C,GAAG;AACH;AACA,EAAE,MAAM,CAAC,KAAK,EAAE;AAChB,IAAI;AACJ,MAAM,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;AAClC,MAAM,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,eAAe;AACpD,MAAM,IAAI,CAAC,cAAc,KAAK,KAAK,CAAC,cAAc;AAClD,MAAM;AACN,GAAG;AACH;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;AACrF,GAAG;AACH;;ACrjBA,IAAI,SAAS,GAAG,IAAI,CAAC;AACrB;AACA;AACA;AACA;AACA;AACe,MAAM,eAAe,SAAS,IAAI,CAAC;AAClD;AACA;AACA;AACA;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,IAAI,SAAS,KAAK,IAAI,EAAE;AAC5B,MAAM,SAAS,GAAG,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC;AACzC,KAAK;AACL,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,QAAQ,CAAC,MAAM,EAAE;AAC1B,IAAI,OAAO,MAAM,KAAK,CAAC,GAAG,eAAe,CAAC,WAAW,GAAG,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;AACpF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,cAAc,CAAC,CAAC,EAAE;AAC3B,IAAI,IAAI,CAAC,EAAE;AACX,MAAM,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,uCAAuC,CAAC,CAAC;AACjE,MAAM,IAAI,CAAC,EAAE;AACb,QAAQ,OAAO,IAAI,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,OAAO;AACP,KAAK;AACL,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,KAAK,EAAE,CAAC;AACZ;AACA,IAAI,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC;AACxB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,OAAO,CAAC;AACnB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,EAAE,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AACjF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,QAAQ,GAAG;AACjB,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;AAC1B,MAAM,OAAO,SAAS,CAAC;AACvB,KAAK,MAAM;AACX,MAAM,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC7D,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC;AACrB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE;AAC3B,IAAI,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC5C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,SAAS,EAAE;AACpB,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,OAAO,IAAI,SAAS,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC;AACxE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;;ACnJA;AACA;AACA;AACA;AACe,MAAM,WAAW,SAAS,IAAI,CAAC;AAC9C,EAAE,WAAW,CAAC,QAAQ,EAAE;AACxB,IAAI,KAAK,EAAE,CAAC;AACZ;AACA,IAAI,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAC7B,GAAG;AACH;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG;AACH;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC;AACzB,GAAG;AACH;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA,EAAE,UAAU,GAAG;AACf,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA;AACA,EAAE,YAAY,GAAG;AACjB,IAAI,OAAO,EAAE,CAAC;AACd,GAAG;AACH;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,GAAG,CAAC;AACf,GAAG;AACH;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;;ACpDA;AACA;AACA;AASA;AACO,SAAS,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE;AAElD,EAAE,IAAI,WAAW,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE;AAC5C,IAAI,OAAO,WAAW,CAAC;AACvB,GAAG,MAAM,IAAI,KAAK,YAAY,IAAI,EAAE;AACpC,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC9B,IAAI,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;AACxC,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE,OAAO,WAAW,CAAC;AAClD,SAAS,IAAI,OAAO,KAAK,OAAO,IAAI,OAAO,KAAK,QAAQ,EAAE,OAAO,UAAU,CAAC,QAAQ,CAAC;AACrF,SAAS,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,KAAK,KAAK,EAAE,OAAO,eAAe,CAAC,WAAW,CAAC;AACxF,SAAS,OAAO,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAClF,GAAG,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC9B,IAAI,OAAO,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC3C,GAAG,MAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,MAAM,KAAK,UAAU,EAAE;AACnG;AACA;AACA,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,MAAM;AACT,IAAI,OAAO,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC;AAClC,GAAG;AACH;;ACjCA,MAAM,gBAAgB,GAAG;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,OAAO,EAAE,iBAAiB;AAC5B,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,QAAQ,EAAE,iBAAiB;AAC7B,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,OAAO,EAAE,uBAAuB;AAClC,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,OAAO,EAAE,iBAAiB;AAC5B,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,iBAAiB;AACzB,EAAE,IAAI,EAAE,KAAK;AACb,CAAC,CAAC;AACF;AACA,MAAM,qBAAqB,GAAG;AAC9B,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACvB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;AAC1B,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACvB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,EAAE,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,CAAC,CAAC;AACF;AACA,MAAM,YAAY,GAAG,gBAAgB,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;AAChF;AACO,SAAS,WAAW,CAAC,GAAG,EAAE;AACjC,EAAE,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAChC,EAAE,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE;AACpB,IAAI,KAAK,GAAG,EAAE,CAAC;AACf,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,MAAM,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACrC;AACA,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;AAC1D,QAAQ,KAAK,IAAI,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9C,OAAO,MAAM;AACb,QAAQ,KAAK,MAAM,GAAG,IAAI,qBAAqB,EAAE;AACjD,UAAU,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC;AACxD,UAAU,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE;AAC1C,YAAY,KAAK,IAAI,IAAI,GAAG,GAAG,CAAC;AAChC,WAAW;AACX,SAAS;AACT,OAAO;AACP,KAAK;AACL,IAAI,OAAO,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC/B,GAAG,MAAM;AACT,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,CAAC;AACD;AACA;AACA,MAAM,eAAe,GAAG,IAAI,GAAG,EAAE,CAAC;AAC3B,SAAS,oBAAoB,GAAG;AACvC,EAAE,eAAe,CAAC,KAAK,EAAE,CAAC;AAC1B,CAAC;AACD;AACO,SAAS,UAAU,CAAC,EAAE,eAAe,EAAE,EAAE,MAAM,GAAG,EAAE,EAAE;AAC7D,EAAE,MAAM,EAAE,GAAG,eAAe,IAAI,MAAM,CAAC;AACvC;AACA,EAAE,IAAI,WAAW,GAAG,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AAC5C,EAAE,IAAI,WAAW,KAAK,SAAS,EAAE;AACjC,IAAI,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAC5B,IAAI,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;AACzC,GAAG;AACH,EAAE,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACtC,EAAE,IAAI,KAAK,KAAK,SAAS,EAAE;AAC3B,IAAI,KAAK,GAAG,IAAI,MAAM,CAAC,CAAC,EAAE,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AAC3D,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACnC,GAAG;AACH;AACA,EAAE,OAAO,KAAK,CAAC;AACf;;ACpFA,IAAI,GAAG,GAAG,MAAM,IAAI,CAAC,GAAG,EAAE;AAC1B,EAAE,WAAW,GAAG,QAAQ;AACxB,EAAE,aAAa,GAAG,IAAI;AACtB,EAAE,sBAAsB,GAAG,IAAI;AAC/B,EAAE,qBAAqB,GAAG,IAAI;AAC9B,EAAE,kBAAkB,GAAG,EAAE;AACzB,EAAE,cAAc;AAChB,EAAE,mBAAmB,GAAG,IAAI,CAAC;AAC7B;AACA;AACA;AACA;AACe,MAAM,QAAQ,CAAC;AAC9B;AACA;AACA;AACA;AACA,EAAE,WAAW,GAAG,GAAG;AACnB,IAAI,OAAO,GAAG,CAAC;AACf,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,GAAG,CAAC,CAAC,EAAE;AACpB,IAAI,GAAG,GAAG,CAAC,CAAC;AACZ,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,WAAW,CAAC,IAAI,EAAE;AAC/B,IAAI,WAAW,GAAG,IAAI,CAAC;AACvB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAO,aAAa,CAAC,WAAW,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;AAC3D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,aAAa,GAAG;AAC7B,IAAI,OAAO,aAAa,CAAC;AACzB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,aAAa,CAAC,MAAM,EAAE;AACnC,IAAI,aAAa,GAAG,MAAM,CAAC;AAC3B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,sBAAsB,GAAG;AACtC,IAAI,OAAO,sBAAsB,CAAC;AAClC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,sBAAsB,CAAC,eAAe,EAAE;AACrD,IAAI,sBAAsB,GAAG,eAAe,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,qBAAqB,GAAG;AACrC,IAAI,OAAO,qBAAqB,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,qBAAqB,CAAC,cAAc,EAAE;AACnD,IAAI,qBAAqB,GAAG,cAAc,CAAC;AAC3C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,mBAAmB,GAAG;AACnC,IAAI,OAAO,mBAAmB,CAAC;AAC/B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,mBAAmB,CAAC,YAAY,EAAE;AAC/C,IAAI,mBAAmB,GAAG,oBAAoB,CAAC,YAAY,CAAC,CAAC;AAC7D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,kBAAkB,GAAG;AAClC,IAAI,OAAO,kBAAkB,CAAC;AAC9B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,kBAAkB,CAAC,UAAU,EAAE;AAC5C,IAAI,kBAAkB,GAAG,UAAU,GAAG,GAAG,CAAC;AAC1C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,cAAc,GAAG;AAC9B,IAAI,OAAO,cAAc,CAAC;AAC1B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,cAAc,CAAC,CAAC,EAAE;AAC/B,IAAI,cAAc,GAAG,CAAC,CAAC;AACvB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,WAAW,GAAG;AACvB,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;AACxB,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;AAC1B,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;AAC1B,IAAI,oBAAoB,EAAE,CAAC;AAC3B,GAAG;AACH;;ACnLe,MAAM,OAAO,CAAC;AAC7B,EAAE,WAAW,CAAC,MAAM,EAAE,WAAW,EAAE;AACnC,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,IAAI,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;AACnC,GAAG;AACH;AACA,EAAE,SAAS,GAAG;AACd,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE;AAC1B,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AACnD,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,CAAC,MAAM,CAAC;AACzB,KAAK;AACL,GAAG;AACH;;ACAA,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7E,EAAE,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACvE;AACA,SAAS,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE;AACrC,EAAE,OAAO,IAAI,OAAO;AACpB,IAAI,mBAAmB;AACvB,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,UAAU,EAAE,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,kBAAkB,CAAC;AACrF,GAAG,CAAC;AACJ,CAAC;AACD;AACO,SAAS,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE;AAC5C,EAAE,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AACrD;AACA,EAAE,IAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,CAAC,EAAE;AAC/B,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,CAAC;AAChD,GAAG;AACH;AACA,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;AAC3B;AACA,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;AAC3B,CAAC;AACD;AACA,SAAS,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE;AAC1C,EAAE,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,GAAG,aAAa,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AAC1E,CAAC;AACD;AACA,SAAS,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE;AACzC,EAAE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,GAAG,aAAa;AAC7D,IAAI,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;AAChD,IAAI,GAAG,GAAG,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;AAClC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC;AACpC,CAAC;AACD;AACO,SAAS,iBAAiB,CAAC,UAAU,EAAE,WAAW,EAAE;AAC3D,EAAE,OAAO,CAAC,CAAC,UAAU,GAAG,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAClD,CAAC;AACD;AACA;AACA;AACA;AACA;AACO,SAAS,eAAe,CAAC,OAAO,EAAE,kBAAkB,GAAG,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE;AAClF,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,OAAO;AACtC,IAAI,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC;AAC9C,IAAI,OAAO,GAAG,iBAAiB,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;AAC1E;AACA,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,OAAO,GAAG,EAAE,GAAG,kBAAkB,IAAI,CAAC,CAAC;AAChF,IAAI,QAAQ,CAAC;AACb;AACA,EAAE,IAAI,UAAU,GAAG,CAAC,EAAE;AACtB,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC;AACxB,IAAI,UAAU,GAAG,eAAe,CAAC,QAAQ,EAAE,kBAAkB,EAAE,WAAW,CAAC,CAAC;AAC5E,GAAG,MAAM,IAAI,UAAU,GAAG,eAAe,CAAC,IAAI,EAAE,kBAAkB,EAAE,WAAW,CAAC,EAAE;AAClF,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC;AACxB,IAAI,UAAU,GAAG,CAAC,CAAC;AACnB,GAAG,MAAM;AACT,IAAI,QAAQ,GAAG,IAAI,CAAC;AACpB,GAAG;AACH;AACA,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;AACnE,CAAC;AACD;AACO,SAAS,eAAe,CAAC,QAAQ,EAAE,kBAAkB,GAAG,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE;AACnF,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,QAAQ;AACpD,IAAI,aAAa,GAAG,iBAAiB,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,kBAAkB,CAAC,EAAE,WAAW,CAAC;AAC9F,IAAI,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,OAAO,GAAG,UAAU,GAAG,CAAC,GAAG,OAAO,GAAG,aAAa,GAAG,CAAC,GAAG,kBAAkB;AACjF,IAAI,IAAI,CAAC;AACT;AACA,EAAE,IAAI,OAAO,GAAG,CAAC,EAAE;AACnB,IAAI,IAAI,GAAG,QAAQ,GAAG,CAAC,CAAC;AACxB,IAAI,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC;AAChC,GAAG,MAAM,IAAI,OAAO,GAAG,UAAU,EAAE;AACnC,IAAI,IAAI,GAAG,QAAQ,GAAG,CAAC,CAAC;AACxB,IAAI,OAAO,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;AACpC,GAAG,MAAM;AACT,IAAI,IAAI,GAAG,QAAQ,CAAC;AACpB,GAAG;AACH;AACA,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AACzD,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;AACvD,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,QAAQ,EAAE;AAC7C,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC;AACxC,EAAE,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;AACnD,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;AACpD,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,WAAW,EAAE;AAChD,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,WAAW,CAAC;AACxC,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AACzD,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;AAC1D,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,mBAAmB,CAAC,GAAG,EAAE,GAAG,EAAE;AAC9C,EAAE,MAAM,iBAAiB;AACzB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC;AAClC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC;AACrC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;AACpC,EAAE,IAAI,iBAAiB,EAAE;AACzB,IAAI,MAAM,cAAc;AACxB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AAC9F;AACA,IAAI,IAAI,cAAc,EAAE;AACxB,MAAM,MAAM,IAAI,6BAA6B;AAC7C,QAAQ,gEAAgE;AACxE,OAAO,CAAC;AACR,KAAK;AACL,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,YAAY,CAAC;AACvE,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,GAAG,CAAC,UAAU,GAAG,GAAG,CAAC,eAAe,CAAC;AAChF,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,QAAQ,GAAG,GAAG,CAAC,aAAa,CAAC;AAC1E,IAAI,OAAO,GAAG,CAAC,YAAY,CAAC;AAC5B,IAAI,OAAO,GAAG,CAAC,eAAe,CAAC;AAC/B,IAAI,OAAO,GAAG,CAAC,aAAa,CAAC;AAC7B,IAAI,OAAO;AACX,MAAM,kBAAkB,EAAE,GAAG,CAAC,qBAAqB,EAAE;AACrD,MAAM,WAAW,EAAE,GAAG,CAAC,cAAc,EAAE;AACvC,KAAK,CAAC;AACN,GAAG,MAAM;AACT,IAAI,OAAO,EAAE,kBAAkB,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;AACrD,GAAG;AACH,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,GAAG,EAAE,kBAAkB,GAAG,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE;AACjF,EAAE,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;AAC3C,IAAI,SAAS,GAAG,cAAc;AAC9B,MAAM,GAAG,CAAC,UAAU;AACpB,MAAM,CAAC;AACP,MAAM,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,kBAAkB,EAAE,WAAW,CAAC;AACpE,KAAK;AACL,IAAI,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACrD;AACA,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,IAAI,OAAO,cAAc,CAAC,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;AACpD,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE;AACzB,IAAI,OAAO,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AAClD,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE;AAC5B,IAAI,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;AAClD,GAAG,MAAM,OAAO,KAAK,CAAC;AACtB,CAAC;AACD;AACO,SAAS,qBAAqB,CAAC,GAAG,EAAE;AAC3C,EAAE,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,IAAI,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;AACxE;AACA,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,IAAI,OAAO,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5C,GAAG,MAAM,IAAI,CAAC,YAAY,EAAE;AAC5B,IAAI,OAAO,cAAc,CAAC,SAAS,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;AAClD,GAAG,MAAM,OAAO,KAAK,CAAC;AACtB,CAAC;AACD;AACO,SAAS,uBAAuB,CAAC,GAAG,EAAE;AAC7C,EAAE,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;AACvC,IAAI,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;AACjD,IAAI,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5E;AACA,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,IAAI,OAAO,cAAc,CAAC,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;AAC5C,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE;AAC1B,IAAI,OAAO,cAAc,CAAC,OAAO,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AAC9C,GAAG,MAAM,IAAI,CAAC,QAAQ,EAAE;AACxB,IAAI,OAAO,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;AAC1C,GAAG,MAAM,OAAO,KAAK,CAAC;AACtB,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,GAAG,EAAE;AACxC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,GAAG,CAAC;AACpD,EAAE,MAAM,SAAS;AACjB,MAAM,cAAc,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;AACjC,OAAO,IAAI,KAAK,EAAE,IAAI,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,CAAC;AACxE,IAAI,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;AAC/C,IAAI,WAAW,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;AAC/C,IAAI,gBAAgB,GAAG,cAAc,CAAC,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3D;AACA,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,IAAI,OAAO,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACxC,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE;AAC3B,IAAI,OAAO,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC5C,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE;AAC3B,IAAI,OAAO,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC5C,GAAG,MAAM,IAAI,CAAC,gBAAgB,EAAE;AAChC,IAAI,OAAO,cAAc,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;AACtD,GAAG,MAAM,OAAO,KAAK,CAAC;AACtB;;AC7MA;AACA;AACA;AACA;AACA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,WAAW,CAAC,CAAC,EAAE;AAC/B,EAAE,OAAO,OAAO,CAAC,KAAK,WAAW,CAAC;AAClC,CAAC;AACD;AACO,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC5B,EAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC/B,CAAC;AACD;AACO,SAAS,SAAS,CAAC,CAAC,EAAE;AAC7B,EAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC9C,CAAC;AACD;AACO,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC5B,EAAE,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;AAC/B,CAAC;AACD;AACO,SAAS,MAAM,CAAC,CAAC,EAAE;AAC1B,EAAE,OAAO,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,eAAe,CAAC;AAC/D,CAAC;AACD;AACA;AACA;AACO,SAAS,WAAW,GAAG;AAC9B,EAAE,IAAI;AACN,IAAI,OAAO,OAAO,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC;AACpE,GAAG,CAAC,OAAO,CAAC,EAAE;AACd,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,CAAC;AACD;AACO,SAAS,iBAAiB,GAAG;AACpC,EAAE,IAAI;AACN,IAAI;AACJ,MAAM,OAAO,IAAI,KAAK,WAAW;AACjC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM;AACnB,OAAO,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;AACrF,MAAM;AACN,GAAG,CAAC,OAAO,CAAC,EAAE;AACd,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH,CAAC;AACD;AACA;AACA;AACO,SAAS,UAAU,CAAC,KAAK,EAAE;AAClC,EAAE,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;AAChD,CAAC;AACD;AACO,SAAS,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,EAAE;AACzC,EAAE,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE;AACxB,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG;AACH,EAAE,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK;AACpC,IAAI,MAAM,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AAClC,IAAI,IAAI,CAAC,IAAI,EAAE;AACf,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE;AACtD,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACd,CAAC;AACD;AACO,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE;AAChC,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK;AAC/B,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAClB,IAAI,OAAO,CAAC,CAAC;AACb,GAAG,EAAE,EAAE,CAAC,CAAC;AACT,CAAC;AACD;AACO,SAAS,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE;AAC1C,EAAE,OAAO,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;AACzD,CAAC;AACD;AACO,SAAS,oBAAoB,CAAC,QAAQ,EAAE;AAC/C,EAAE,IAAI,QAAQ,IAAI,IAAI,EAAE;AACxB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,MAAM,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;AAC3C,IAAI,MAAM,IAAI,oBAAoB,CAAC,iCAAiC,CAAC,CAAC;AACtE,GAAG,MAAM;AACT,IAAI;AACJ,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;AAC9C,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;AACjD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;AACtC,MAAM,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5D,MAAM;AACN,MAAM,MAAM,IAAI,oBAAoB,CAAC,uBAAuB,CAAC,CAAC;AAC9D,KAAK;AACL,IAAI,OAAO;AACX,MAAM,QAAQ,EAAE,QAAQ,CAAC,QAAQ;AACjC,MAAM,WAAW,EAAE,QAAQ,CAAC,WAAW;AACvC,MAAM,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;AAC3C,KAAK,CAAC;AACN,GAAG;AACH,CAAC;AACD;AACA;AACA;AACO,SAAS,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE;AACnD,EAAE,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,IAAI,GAAG,CAAC;AAC7D,CAAC;AACD;AACA;AACO,SAAS,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE;AAC/B,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACnC,CAAC;AACD;AACO,SAAS,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE;AACvC,EAAE,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;AAC1B,EAAE,IAAI,MAAM,CAAC;AACb,EAAE,IAAI,KAAK,EAAE;AACb,IAAI,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAClD,GAAG,MAAM;AACT,IAAI,MAAM,GAAG,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC3C,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACO,SAAS,YAAY,CAAC,MAAM,EAAE;AACrC,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,EAAE,EAAE;AAC/D,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG,MAAM;AACT,IAAI,OAAO,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAChC,GAAG;AACH,CAAC;AACD;AACO,SAAS,aAAa,CAAC,MAAM,EAAE;AACtC,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,EAAE,EAAE;AAC/D,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG,MAAM;AACT,IAAI,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC;AAC9B,GAAG;AACH,CAAC;AACD;AACO,SAAS,WAAW,CAAC,QAAQ,EAAE;AACtC;AACA,EAAE,IAAI,WAAW,CAAC,QAAQ,CAAC,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,EAAE,EAAE;AACrE,IAAI,OAAO,SAAS,CAAC;AACrB,GAAG,MAAM;AACT,IAAI,MAAM,CAAC,GAAG,UAAU,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC;AACjD,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACzB,GAAG;AACH,CAAC;AACD;AACO,SAAS,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAG,OAAO,EAAE;AAC5D,EAAE,MAAM,MAAM,GAAG,EAAE,IAAI,MAAM,CAAC;AAC9B,EAAE,QAAQ,QAAQ;AAClB,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,MAAM,GAAG,CAAC;AACvB,UAAU,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM;AAC7C,UAAU,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAC/C,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAClD,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAClD,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AAClD,IAAI,KAAK,MAAM;AACf,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AACjD,IAAI;AACJ,MAAM,MAAM,IAAI,UAAU,CAAC,CAAC,eAAe,EAAE,QAAQ,CAAC,gBAAgB,CAAC,CAAC,CAAC;AACzE,GAAG;AACH,CAAC;AACD;AACA;AACA;AACO,SAAS,UAAU,CAAC,IAAI,EAAE;AACjC,EAAE,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;AAClE,CAAC;AACD;AACO,SAAS,UAAU,CAAC,IAAI,EAAE;AACjC,EAAE,OAAO,UAAU,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;AACtC,CAAC;AACD;AACO,SAAS,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE;AACzC,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;AAC9C,IAAI,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,GAAG,QAAQ,IAAI,EAAE,CAAC;AAC7C;AACA,EAAE,IAAI,QAAQ,KAAK,CAAC,EAAE;AACtB,IAAI,OAAO,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;AACzC,GAAG,MAAM;AACT,IAAI,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;AAC5E,GAAG;AACH,CAAC;AACD;AACA;AACO,SAAS,YAAY,CAAC,GAAG,EAAE;AAClC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;AAClB,IAAI,GAAG,CAAC,IAAI;AACZ,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC;AACjB,IAAI,GAAG,CAAC,GAAG;AACX,IAAI,GAAG,CAAC,IAAI;AACZ,IAAI,GAAG,CAAC,MAAM;AACd,IAAI,GAAG,CAAC,MAAM;AACd,IAAI,GAAG,CAAC,WAAW;AACnB,GAAG,CAAC;AACJ;AACA;AACA,EAAE,IAAI,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,EAAE;AACvC,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AACpB;AACA;AACA;AACA,IAAI,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;AACvD,GAAG;AACH,EAAE,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AACD;AACA;AACA,SAAS,eAAe,CAAC,IAAI,EAAE,kBAAkB,EAAE,WAAW,EAAE;AAChE,EAAE,MAAM,KAAK,GAAG,iBAAiB,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,kBAAkB,CAAC,EAAE,WAAW,CAAC,CAAC;AACvF,EAAE,OAAO,CAAC,KAAK,GAAG,kBAAkB,GAAG,CAAC,CAAC;AACzC,CAAC;AACD;AACO,SAAS,eAAe,CAAC,QAAQ,EAAE,kBAAkB,GAAG,CAAC,EAAE,WAAW,GAAG,CAAC,EAAE;AACnF,EAAE,MAAM,UAAU,GAAG,eAAe,CAAC,QAAQ,EAAE,kBAAkB,EAAE,WAAW,CAAC,CAAC;AAChF,EAAE,MAAM,cAAc,GAAG,eAAe,CAAC,QAAQ,GAAG,CAAC,EAAE,kBAAkB,EAAE,WAAW,CAAC,CAAC;AACxF,EAAE,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,UAAU,GAAG,cAAc,IAAI,CAAC,CAAC;AAClE,CAAC;AACD;AACO,SAAS,cAAc,CAAC,IAAI,EAAE;AACrC,EAAE,IAAI,IAAI,GAAG,EAAE,EAAE;AACjB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,MAAM,OAAO,IAAI,GAAG,QAAQ,CAAC,kBAAkB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;AAC/E,CAAC;AACD;AACA;AACA;AACO,SAAS,aAAa,CAAC,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,EAAE;AACzE,EAAE,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;AAC3B,IAAI,QAAQ,GAAG;AACf,MAAM,SAAS,EAAE,KAAK;AACtB,MAAM,IAAI,EAAE,SAAS;AACrB,MAAM,KAAK,EAAE,SAAS;AACtB,MAAM,GAAG,EAAE,SAAS;AACpB,MAAM,IAAI,EAAE,SAAS;AACrB,MAAM,MAAM,EAAE,SAAS;AACvB,KAAK,CAAC;AACN;AACA,EAAE,IAAI,QAAQ,EAAE;AAChB,IAAI,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC;AACjC,GAAG;AACH;AACA,EAAE,MAAM,QAAQ,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,GAAG,QAAQ,EAAE,CAAC;AAC/D;AACA,EAAE,MAAM,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC;AAC1D,KAAK,aAAa,CAAC,IAAI,CAAC;AACxB,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,cAAc,CAAC,CAAC;AAC1D,EAAE,OAAO,MAAM,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;AACtC,CAAC;AACD;AACA;AACO,SAAS,YAAY,CAAC,UAAU,EAAE,YAAY,EAAE;AACvD,EAAE,IAAI,OAAO,GAAG,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;AACzC;AACA;AACA,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE;AAC7B,IAAI,OAAO,GAAG,CAAC,CAAC;AAChB,GAAG;AACH;AACA,EAAE,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC;AAChD,IAAI,YAAY,GAAG,OAAO,GAAG,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC;AAC5E,EAAE,OAAO,OAAO,GAAG,EAAE,GAAG,YAAY,CAAC;AACrC,CAAC;AACD;AACA;AACA;AACO,SAAS,QAAQ,CAAC,KAAK,EAAE;AAChC,EAAE,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;AACrC,EAAE,IAAI,OAAO,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC;AAClF,IAAI,MAAM,IAAI,oBAAoB,CAAC,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;AAClE,EAAE,OAAO,YAAY,CAAC;AACtB,CAAC;AACD;AACO,SAAS,eAAe,CAAC,GAAG,EAAE,UAAU,EAAE;AACjD,EAAE,MAAM,UAAU,GAAG,EAAE,CAAC;AACxB,EAAE,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;AACvB,IAAI,IAAI,cAAc,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE;AAChC,MAAM,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AACvB,MAAM,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,EAAE,SAAS;AAClD,MAAM,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC9C,KAAK;AACL,GAAG;AACH,EAAE,OAAO,UAAU,CAAC;AACpB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE;AAC7C,EAAE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AACjD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAC/C,IAAI,IAAI,GAAG,MAAM,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;AACnC;AACA,EAAE,QAAQ,MAAM;AAChB,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACpE,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,EAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAClE,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACnE,IAAI;AACJ,MAAM,MAAM,IAAI,UAAU,CAAC,CAAC,aAAa,EAAE,MAAM,CAAC,oCAAoC,CAAC,CAAC,CAAC;AACzF,GAAG;AACH,CAAC;AACD;AACO,SAAS,UAAU,CAAC,GAAG,EAAE;AAChC,EAAE,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC;AAChE;;AClUA;AACA;AACA;AACA;AACO,MAAM,UAAU,GAAG;AAC1B,EAAE,SAAS;AACX,EAAE,UAAU;AACZ,EAAE,OAAO;AACT,EAAE,OAAO;AACT,EAAE,KAAK;AACP,EAAE,MAAM;AACR,EAAE,MAAM;AACR,EAAE,QAAQ;AACV,EAAE,WAAW;AACb,EAAE,SAAS;AACX,EAAE,UAAU;AACZ,EAAE,UAAU;AACZ,CAAC,CAAC;AACF;AACO,MAAM,WAAW,GAAG;AAC3B,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,EAAE,KAAK;AACP,CAAC,CAAC;AACF;AACO,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACzF;AACO,SAAS,MAAM,CAAC,MAAM,EAAE;AAC/B,EAAE,QAAQ,MAAM;AAChB,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC;AAC/B,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC;AAC9B,IAAI,KAAK,MAAM;AACf,MAAM,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC;AAC7B,IAAI,KAAK,SAAS;AAClB,MAAM,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAC7E,IAAI,KAAK,SAAS;AAClB,MAAM,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACtF,IAAI;AACJ,MAAM,OAAO,IAAI,CAAC;AAClB,GAAG;AACH,CAAC;AACD;AACO,MAAM,YAAY,GAAG;AAC5B,EAAE,QAAQ;AACV,EAAE,SAAS;AACX,EAAE,WAAW;AACb,EAAE,UAAU;AACZ,EAAE,QAAQ;AACV,EAAE,UAAU;AACZ,EAAE,QAAQ;AACV,CAAC,CAAC;AACF;AACO,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AAC/E;AACO,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAClE;AACO,SAAS,QAAQ,CAAC,MAAM,EAAE;AACjC,EAAE,QAAQ,MAAM;AAChB,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,CAAC,GAAG,cAAc,CAAC,CAAC;AACjC,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,CAAC,GAAG,aAAa,CAAC,CAAC;AAChC,IAAI,KAAK,MAAM;AACf,MAAM,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC;AAC/B,IAAI,KAAK,SAAS;AAClB,MAAM,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AACjD,IAAI;AACJ,MAAM,OAAO,IAAI,CAAC;AAClB,GAAG;AACH,CAAC;AACD;AACO,MAAM,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACtC;AACO,MAAM,QAAQ,GAAG,CAAC,eAAe,EAAE,aAAa,CAAC,CAAC;AACzD;AACO,MAAM,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACtC;AACO,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACrC;AACO,SAAS,IAAI,CAAC,MAAM,EAAE;AAC7B,EAAE,QAAQ,MAAM;AAChB,IAAI,KAAK,QAAQ;AACjB,MAAM,OAAO,CAAC,GAAG,UAAU,CAAC,CAAC;AAC7B,IAAI,KAAK,OAAO;AAChB,MAAM,OAAO,CAAC,GAAG,SAAS,CAAC,CAAC;AAC5B,IAAI,KAAK,MAAM;AACf,MAAM,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;AAC3B,IAAI;AACJ,MAAM,OAAO,IAAI,CAAC;AAClB,GAAG;AACH,CAAC;AACD;AACO,SAAS,mBAAmB,CAAC,EAAE,EAAE;AACxC,EAAE,OAAO,SAAS,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE;AAC/C,EAAE,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;AAC1C,CAAC;AACD;AACO,SAAS,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE;AAC7C,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AACtC,CAAC;AACD;AACO,SAAS,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE;AAC3C,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,QAAQ,EAAE,MAAM,GAAG,KAAK,EAAE;AACpF,EAAE,MAAM,KAAK,GAAG;AAChB,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AAC1B,IAAI,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;AACjC,IAAI,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;AAC5B,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AAC1B,IAAI,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;AAChC,IAAI,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AAC1B,IAAI,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;AAC/B,IAAI,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;AAC/B,GAAG,CAAC;AACJ;AACA,EAAE,MAAM,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACxE;AACA,EAAE,IAAI,OAAO,KAAK,MAAM,IAAI,QAAQ,EAAE;AACtC,IAAI,MAAM,KAAK,GAAG,IAAI,KAAK,MAAM,CAAC;AAClC,IAAI,QAAQ,KAAK;AACjB,MAAM,KAAK,CAAC;AACZ,QAAQ,OAAO,KAAK,GAAG,UAAU,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,MAAM,KAAK,CAAC,CAAC;AACb,QAAQ,OAAO,KAAK,GAAG,WAAW,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,MAAM,KAAK,CAAC;AACZ,QAAQ,OAAO,KAAK,GAAG,OAAO,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAE1D,KAAK;AACL,GAAG;AACH;AACA,EAAE,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;AACpD,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;AAC9B,IAAI,QAAQ,GAAG,QAAQ,KAAK,CAAC;AAC7B,IAAI,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC;AAC1B,IAAI,OAAO,GAAG,MAAM;AACpB,QAAQ,QAAQ;AAChB,UAAU,QAAQ,CAAC,CAAC,CAAC;AACrB,UAAU,QAAQ,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;AACpC,QAAQ,QAAQ;AAChB,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtB,QAAQ,IAAI,CAAC;AACb,EAAE,OAAO,QAAQ,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/E;;ACjKA,SAAS,eAAe,CAAC,MAAM,EAAE,aAAa,EAAE;AAChD,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;AACb,EAAE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;AAC9B,IAAI,IAAI,KAAK,CAAC,OAAO,EAAE;AACvB,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC;AACrB,KAAK,MAAM;AACX,MAAM,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACpC,KAAK;AACL,GAAG;AACH,EAAE,OAAO,CAAC,CAAC;AACX,CAAC;AACD;AACA,MAAM,sBAAsB,GAAG;AAC/B,EAAE,CAAC,EAAEC,UAAkB;AACvB,EAAE,EAAE,EAAEC,QAAgB;AACtB,EAAE,GAAG,EAAEC,SAAiB;AACxB,EAAE,IAAI,EAAEC,SAAiB;AACzB,EAAE,CAAC,EAAEC,WAAmB;AACxB,EAAE,EAAE,EAAEC,iBAAyB;AAC/B,EAAE,GAAG,EAAEC,sBAA8B;AACrC,EAAE,IAAI,EAAEC,qBAA6B;AACrC,EAAE,CAAC,EAAEC,cAAsB;AAC3B,EAAE,EAAE,EAAEC,oBAA4B;AAClC,EAAE,GAAG,EAAEC,yBAAiC;AACxC,EAAE,IAAI,EAAEC,wBAAgC;AACxC,EAAE,CAAC,EAAEC,cAAsB;AAC3B,EAAE,EAAE,EAAEC,YAAoB;AAC1B,EAAE,GAAG,EAAEC,aAAqB;AAC5B,EAAE,IAAI,EAAEC,aAAqB;AAC7B,EAAE,CAAC,EAAEC,2BAAmC;AACxC,EAAE,EAAE,EAAEC,yBAAiC;AACvC,EAAE,GAAG,EAAEC,0BAAkC;AACzC,EAAE,IAAI,EAAEC,0BAAkC;AAC1C,CAAC,CAAC;AACF;AACA;AACA;AACA;AACA;AACe,MAAM,SAAS,CAAC;AAC/B,EAAE,OAAO,MAAM,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE;AACnC,IAAI,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACvC,GAAG;AACH;AACA,EAAE,OAAO,WAAW,CAAC,GAAG,EAAE;AAC1B;AACA;AACA;AACA,IAAI,IAAI,OAAO,GAAG,IAAI;AACtB,MAAM,WAAW,GAAG,EAAE;AACtB,MAAM,SAAS,GAAG,KAAK,CAAC;AACxB,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,MAAM,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC9B,MAAM,IAAI,CAAC,KAAK,GAAG,EAAE;AACrB;AACA,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE;AACjD,UAAU,MAAM,CAAC,IAAI,CAAC;AACtB,YAAY,OAAO,EAAE,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;AAC3D,YAAY,GAAG,EAAE,WAAW,KAAK,EAAE,GAAG,GAAG,GAAG,WAAW;AACvD,WAAW,CAAC,CAAC;AACb,SAAS;AACT,QAAQ,OAAO,GAAG,IAAI,CAAC;AACvB,QAAQ,WAAW,GAAG,EAAE,CAAC;AACzB,QAAQ,SAAS,GAAG,CAAC,SAAS,CAAC;AAC/B,OAAO,MAAM,IAAI,SAAS,EAAE;AAC5B,QAAQ,WAAW,IAAI,CAAC,CAAC;AACzB,OAAO,MAAM,IAAI,CAAC,KAAK,OAAO,EAAE;AAChC,QAAQ,WAAW,IAAI,CAAC,CAAC;AACzB,OAAO,MAAM;AACb,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;AACpC,UAAU,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC;AAChF,SAAS;AACT,QAAQ,WAAW,GAAG,CAAC,CAAC;AACxB,QAAQ,OAAO,GAAG,CAAC,CAAC;AACpB,OAAO;AACP,KAAK;AACL;AACA,IAAI,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,MAAM,MAAM,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,SAAS,IAAI,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC;AACzF,KAAK;AACL;AACA,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG;AACH;AACA,EAAE,OAAO,sBAAsB,CAAC,KAAK,EAAE;AACvC,IAAI,OAAO,sBAAsB,CAAC,KAAK,CAAC,CAAC;AACzC,GAAG;AACH;AACA,EAAE,WAAW,CAAC,MAAM,EAAE,UAAU,EAAE;AAClC,IAAI,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;AAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC;AACtB,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;AAC1B,GAAG;AACH;AACA,EAAE,uBAAuB,CAAC,EAAE,EAAE,IAAI,EAAE;AACpC,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE;AACjC,MAAM,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,CAAC;AACpD,KAAK;AACL,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;AACzE,IAAI,OAAO,EAAE,CAAC,MAAM,EAAE,CAAC;AACvB,GAAG;AACH;AACA,EAAE,WAAW,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE;AAC7B,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;AAC/D,GAAG;AACH;AACA,EAAE,cAAc,CAAC,EAAE,EAAE,IAAI,EAAE;AAC3B,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;AAC/C,GAAG;AACH;AACA,EAAE,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE;AAChC,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;AACtD,GAAG;AACH;AACA,EAAE,cAAc,CAAC,QAAQ,EAAE,IAAI,EAAE;AACjC,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACtD,IAAI,OAAO,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;AAClF,GAAG;AACH;AACA,EAAE,eAAe,CAAC,EAAE,EAAE,IAAI,EAAE;AAC5B,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,eAAe,EAAE,CAAC;AACxD,GAAG;AACH;AACA,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,GAAG,SAAS,EAAE;AACzC;AACA,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE;AAC/B,MAAM,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5B,KAAK;AACL;AACA,IAAI,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;AAClC;AACA,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE;AACf,MAAM,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;AACrB,KAAK;AACL,IAAI,IAAI,WAAW,EAAE;AACrB,MAAM,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;AACrC,KAAK;AACL;AACA,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACpD,GAAG;AACH;AACA,EAAE,wBAAwB,CAAC,EAAE,EAAE,GAAG,EAAE;AACpC,IAAI,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,IAAI;AACxD,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,KAAK,SAAS;AAC7F,MAAM,MAAM,GAAG,CAAC,IAAI,EAAE,OAAO,KAAK,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,CAAC;AACrE,MAAM,YAAY,GAAG,CAAC,IAAI,KAAK;AAC/B,QAAQ,IAAI,EAAE,CAAC,aAAa,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;AAChE,UAAU,OAAO,GAAG,CAAC;AACrB,SAAS;AACT;AACA,QAAQ,OAAO,EAAE,CAAC,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;AAC1E,OAAO;AACP,MAAM,QAAQ,GAAG;AACjB,QAAQ,YAAY;AACpB,YAAYC,mBAA2B,CAAC,EAAE,CAAC;AAC3C,YAAY,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,WAAW,CAAC;AACtE,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,UAAU;AACjC,QAAQ,YAAY;AACpB,YAAYC,gBAAwB,CAAC,EAAE,EAAE,MAAM,CAAC;AAChD,YAAY,MAAM,CAAC,UAAU,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,OAAO,CAAC;AAC/F,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,UAAU;AACnC,QAAQ,YAAY;AACpB,YAAYC,kBAA0B,CAAC,EAAE,EAAE,MAAM,CAAC;AAClD,YAAY,MAAM;AAClB,cAAc,UAAU,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE;AACnG,cAAc,SAAS;AACvB,aAAa;AACb,MAAM,UAAU,GAAG,CAAC,KAAK,KAAK;AAC9B,QAAQ,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;AACnE,QAAQ,IAAI,UAAU,EAAE;AACxB,UAAU,OAAO,IAAI,CAAC,uBAAuB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;AAC9D,SAAS,MAAM;AACf,UAAU,OAAO,KAAK,CAAC;AACvB,SAAS;AACT,OAAO;AACP,MAAM,GAAG,GAAG,CAAC,MAAM;AACnB,QAAQ,YAAY,GAAGC,cAAsB,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,KAAK,CAAC;AAC1F,MAAM,aAAa,GAAG,CAAC,KAAK,KAAK;AACjC;AACA,QAAQ,QAAQ,KAAK;AACrB;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC;AAC5C,UAAU,KAAK,GAAG,CAAC;AACnB;AACA,UAAU,KAAK,KAAK;AACpB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AAC/C;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;AACvC,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC1C;AACA,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAChE,UAAU,KAAK,KAAK;AACpB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC;AAC9D;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;AACvC,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAC1C;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;AACpE,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AACvE,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;AACrC,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACxC;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,YAAY,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAChF,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,YAAY,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAC/E,UAAU,KAAK,KAAK;AACpB;AACA,YAAY,OAAO,YAAY,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAChF,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3F,UAAU,KAAK,OAAO;AACtB;AACA,YAAY,OAAO,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAC1F;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,EAAE,CAAC,QAAQ,CAAC;AAC/B;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,QAAQ,EAAE,CAAC;AAC9B;AACA,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,oBAAoB,GAAG,MAAM,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC/F,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,oBAAoB,GAAG,MAAM,CAAC,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAClG;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;AACxC,UAAU,KAAK,KAAK;AACpB;AACA,YAAY,OAAO,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AAC1C,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACzC,UAAU,KAAK,OAAO;AACtB;AACA,YAAY,OAAO,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AAC3C;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;AACxC,UAAU,KAAK,KAAK;AACpB;AACA,YAAY,OAAO,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AAC3C,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC1C,UAAU,KAAK,OAAO;AACtB;AACA,YAAY,OAAO,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC5C;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,OAAO,CAAC;AACrE,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AACnC,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,OAAO,CAAC;AACrE,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACtC,UAAU,KAAK,KAAK;AACpB;AACA,YAAY,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACxC,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACvC,UAAU,KAAK,OAAO;AACtB;AACA,YAAY,OAAO,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;AACzC;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,OAAO,CAAC;AACrD,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AACnC,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,OAAO,CAAC;AACrD,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AACtC,UAAU,KAAK,KAAK;AACpB;AACA,YAAY,OAAO,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AACzC,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACxC,UAAU,KAAK,OAAO;AACtB;AACA,YAAY,OAAO,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC1C;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,oBAAoB,GAAG,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;AAClG,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC;AACnD,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1D,UAAU,KAAK,MAAM;AACrB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC;AACnD,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACrC,UAAU,KAAK,QAAQ;AACvB;AACA,YAAY,OAAO,oBAAoB;AACvC,gBAAgB,MAAM,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC;AACnD,gBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACrC;AACA,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,GAAG,CAAC,OAAO,CAAC,CAAC;AAChC,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC;AAC/B,UAAU,KAAK,OAAO;AACtB,YAAY,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC;AACjC,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjE,UAAU,KAAK,MAAM;AACrB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;AAC5C,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;AAC3C,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;AAC9C,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,CAAC,CAAC;AAChD,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;AACnD,UAAU,KAAK,IAAI;AACnB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtE,UAAU,KAAK,MAAM;AACrB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;AACjD,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;AACxC,UAAU,KAAK,KAAK;AACpB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AAC3C,UAAU,KAAK,GAAG;AAClB;AACA,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;AACxC,UAAU,KAAK,IAAI;AACnB;AACA,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AAC3C,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AACtD,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACnC,UAAU;AACV,YAAY,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AACrC,SAAS;AACT,OAAO,CAAC;AACR;AACA,IAAI,OAAO,eAAe,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,aAAa,CAAC,CAAC;AACtE,GAAG;AACH;AACA,EAAE,wBAAwB,CAAC,GAAG,EAAE,GAAG,EAAE;AACrC,IAAI,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAChF,IAAI,MAAM,YAAY,GAAG,CAAC,KAAK,KAAK;AACpC,QAAQ,QAAQ,KAAK,CAAC,CAAC,CAAC;AACxB,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,cAAc,CAAC;AAClC,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,SAAS,CAAC;AAC7B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,SAAS,CAAC;AAC7B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,OAAO,CAAC;AAC3B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,MAAM,CAAC;AAC1B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,OAAO,CAAC;AAC3B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,QAAQ,CAAC;AAC5B,UAAU,KAAK,GAAG;AAClB,YAAY,OAAO,OAAO,CAAC;AAC3B,UAAU;AACV,YAAY,OAAO,IAAI,CAAC;AACxB,SAAS;AACT,OAAO;AACP,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,KAAK,KAAK;AACnD,QAAQ,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;AAC3C,QAAQ,IAAI,MAAM,EAAE;AACpB,UAAU,MAAM,eAAe;AAC/B,YAAY,IAAI,CAAC,kBAAkB,IAAI,MAAM,KAAK,IAAI,CAAC,WAAW,GAAG,aAAa,GAAG,CAAC,CAAC;AACvF,UAAU,IAAI,WAAW,CAAC;AAC1B,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,qBAAqB,IAAI,MAAM,KAAK,IAAI,CAAC,WAAW,EAAE;AAC3F,YAAY,WAAW,GAAG,OAAO,CAAC;AAClC,WAAW,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,EAAE;AACnD,YAAY,WAAW,GAAG,QAAQ,CAAC;AACnC,WAAW,MAAM;AACjB;AACA,YAAY,WAAW,GAAG,MAAM,CAAC;AACjC,WAAW;AACX,UAAU,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,eAAe,EAAE,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC3F,SAAS,MAAM;AACf,UAAU,OAAO,KAAK,CAAC;AACvB,SAAS;AACT,OAAO;AACP,MAAM,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC;AACzC,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM;AAChC,QAAQ,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,GAAG,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC1E,QAAQ,EAAE;AACV,OAAO;AACP,MAAM,SAAS,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAC/E,MAAM,YAAY,GAAG;AACrB,QAAQ,kBAAkB,EAAE,SAAS,GAAG,CAAC;AACzC;AACA;AACA,QAAQ,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD,OAAO,CAAC;AACR,IAAI,OAAO,eAAe,CAAC,MAAM,EAAE,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AAC3E,GAAG;AACH;;ACraA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,SAAS,GAAG,8EAA8E,CAAC;AACjG;AACA,SAAS,cAAc,CAAC,GAAG,OAAO,EAAE;AACpC,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;AAC1D,EAAE,OAAO,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7B,CAAC;AACD;AACA,SAAS,iBAAiB,CAAC,GAAG,UAAU,EAAE;AAC1C,EAAE,OAAO,CAAC,CAAC;AACX,IAAI,UAAU;AACd,OAAO,MAAM;AACb,QAAQ,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK;AAClD,UAAU,MAAM,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAClD,UAAU,OAAO,CAAC,EAAE,GAAG,UAAU,EAAE,GAAG,GAAG,EAAE,EAAE,IAAI,IAAI,UAAU,EAAE,IAAI,CAAC,CAAC;AACvE,SAAS;AACT,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AACrB,OAAO;AACP,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnB,CAAC;AACD;AACA,SAAS,KAAK,CAAC,CAAC,EAAE,GAAG,QAAQ,EAAE;AAC/B,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;AACjB,IAAI,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACxB,GAAG;AACH;AACA,EAAE,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,QAAQ,EAAE;AAC7C,IAAI,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,EAAE;AACX,MAAM,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AAC1B,KAAK;AACL,GAAG;AACH,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACtB,CAAC;AACD;AACA,SAAS,WAAW,CAAC,GAAG,IAAI,EAAE;AAC9B,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,KAAK;AAC5B,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;AACnB,IAAI,IAAI,CAAC,CAAC;AACV;AACA,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACtC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACrD,KAAK;AACL,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AACnC,GAAG,CAAC;AACJ,CAAC;AACD;AACA;AACA,MAAM,WAAW,GAAG,oCAAoC,CAAC;AACzD,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACtF,MAAM,gBAAgB,GAAG,qDAAqD,CAAC;AAC/E,MAAM,YAAY,GAAG,MAAM,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC;AAC5E,MAAM,qBAAqB,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACxE,MAAM,WAAW,GAAG,6CAA6C,CAAC;AAClE,MAAM,YAAY,GAAG,6BAA6B,CAAC;AACnD,MAAM,eAAe,GAAG,kBAAkB,CAAC;AAC3C,MAAM,kBAAkB,GAAG,WAAW,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;AAC5E,MAAM,qBAAqB,GAAG,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAC7D,MAAM,WAAW,GAAG,uBAAuB,CAAC;AAC5C,MAAM,YAAY,GAAG,MAAM;AAC3B,EAAE,CAAC,EAAE,gBAAgB,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC;AAChF,CAAC,CAAC;AACF,MAAM,qBAAqB,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AACrE;AACA,SAAS,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE;AACnC,EAAE,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;AACvB,EAAE,OAAO,WAAW,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AACD;AACA,SAAS,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE;AACtC,EAAE,MAAM,IAAI,GAAG;AACf,IAAI,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC;AAC5B,IAAI,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;AACpC,IAAI,GAAG,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;AAClC,GAAG,CAAC;AACJ;AACA,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAClC,CAAC;AACD;AACA,SAAS,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE;AACvC,EAAE,MAAM,IAAI,GAAG;AACf,IAAI,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AAChC,IAAI,OAAO,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;AACtC,IAAI,OAAO,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;AACtC,IAAI,YAAY,EAAE,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAChD,GAAG,CAAC;AACJ;AACA,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAClC,CAAC;AACD;AACA,SAAS,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE;AACzC,EAAE,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACpD,IAAI,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACnE,IAAI,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,eAAe,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;AAC/D,EAAE,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAChC,CAAC;AACD;AACA,SAAS,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE;AACxC,EAAE,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;AACrE,EAAE,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAChC,CAAC;AACD;AACA;AACA;AACA,MAAM,WAAW,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D;AACA;AACA;AACA,MAAM,WAAW;AACjB,EAAE,8PAA8P,CAAC;AACjQ;AACA,SAAS,kBAAkB,CAAC,KAAK,EAAE;AACnC,EAAE,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,eAAe,CAAC;AAC/F,IAAI,KAAK,CAAC;AACV;AACA,EAAE,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;AACzC,EAAE,MAAM,eAAe,GAAG,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;AAC5D;AACA,EAAE,MAAM,WAAW,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,KAAK;AACzC,IAAI,GAAG,KAAK,SAAS,KAAK,KAAK,KAAK,GAAG,IAAI,iBAAiB,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;AAC5E;AACA,EAAE,OAAO;AACT,IAAI;AACJ,MAAM,KAAK,EAAE,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;AAChD,MAAM,MAAM,EAAE,WAAW,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;AAClD,MAAM,KAAK,EAAE,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;AAChD,MAAM,IAAI,EAAE,WAAW,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;AAC9C,MAAM,KAAK,EAAE,WAAW,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;AAChD,MAAM,OAAO,EAAE,WAAW,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;AACpD,MAAM,OAAO,EAAE,WAAW,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,SAAS,KAAK,IAAI,CAAC;AACxE,MAAM,YAAY,EAAE,WAAW,CAAC,WAAW,CAAC,eAAe,CAAC,EAAE,eAAe,CAAC;AAC9E,KAAK;AACL,GAAG,CAAC;AACJ,CAAC;AACD;AACA;AACA;AACA;AACA,MAAM,UAAU,GAAG;AACnB,EAAE,GAAG,EAAE,CAAC;AACR,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACd,CAAC,CAAC;AACF;AACA,SAAS,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE;AAC3F,EAAE,MAAM,MAAM,GAAG;AACjB,IAAI,IAAI,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,GAAG,cAAc,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,OAAO,CAAC;AAC9F,IAAI,KAAK,EAAEC,WAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC;AACpD,IAAI,GAAG,EAAE,YAAY,CAAC,MAAM,CAAC;AAC7B,IAAI,IAAI,EAAE,YAAY,CAAC,OAAO,CAAC;AAC/B,IAAI,MAAM,EAAE,YAAY,CAAC,SAAS,CAAC;AACnC,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,SAAS,EAAE,MAAM,CAAC,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC;AACzD,EAAE,IAAI,UAAU,EAAE;AAClB,IAAI,MAAM,CAAC,OAAO;AAClB,MAAM,UAAU,CAAC,MAAM,GAAG,CAAC;AAC3B,UAAUC,YAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC;AACtD,UAAUC,aAAqB,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AACxD,GAAG;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACA;AACA,MAAM,OAAO;AACb,EAAE,iMAAiM,CAAC;AACpM;AACA,SAAS,cAAc,CAAC,KAAK,EAAE;AAC/B,EAAE,MAAM;AACR;AACA,MAAM,UAAU;AAChB,MAAM,MAAM;AACZ,MAAM,QAAQ;AACd,MAAM,OAAO;AACb,MAAM,OAAO;AACb,MAAM,SAAS;AACf,MAAM,SAAS;AACf,MAAM,SAAS;AACf,MAAM,SAAS;AACf,MAAM,UAAU;AAChB,MAAM,YAAY;AAClB,KAAK,GAAG,KAAK;AACb,IAAI,MAAM,GAAG,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC/F;AACA,EAAE,IAAI,MAAM,CAAC;AACb,EAAE,IAAI,SAAS,EAAE;AACjB,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;AACnC,GAAG,MAAM,IAAI,SAAS,EAAE;AACxB,IAAI,MAAM,GAAG,CAAC,CAAC;AACf,GAAG,MAAM;AACT,IAAI,MAAM,GAAG,YAAY,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;AACpD,GAAG;AACH;AACA,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;AAC/C,CAAC;AACD;AACA,SAAS,iBAAiB,CAAC,CAAC,EAAE;AAC9B;AACA,EAAE,OAAO,CAAC;AACV,KAAK,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC;AACvC,KAAK,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;AAC7B,KAAK,IAAI,EAAE,CAAC;AACZ,CAAC;AACD;AACA;AACA;AACA,MAAM,OAAO;AACb,IAAI,4HAA4H;AAChI,EAAE,MAAM;AACR,IAAI,wJAAwJ;AAC5J,EAAE,KAAK;AACP,IAAI,2HAA2H,CAAC;AAChI;AACA,SAAS,mBAAmB,CAAC,KAAK,EAAE;AACpC,EAAE,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,GAAG,KAAK;AACxF,IAAI,MAAM,GAAG,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC/F,EAAE,OAAO,CAAC,MAAM,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC;AAC/C,CAAC;AACD;AACA,SAAS,YAAY,CAAC,KAAK,EAAE;AAC7B,EAAE,MAAM,GAAG,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,GAAG,KAAK;AACxF,IAAI,MAAM,GAAG,WAAW,CAAC,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC/F,EAAE,OAAO,CAAC,MAAM,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC;AAC/C,CAAC;AACD;AACA,MAAM,4BAA4B,GAAG,cAAc,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAC;AACxF,MAAM,6BAA6B,GAAG,cAAc,CAAC,YAAY,EAAE,qBAAqB,CAAC,CAAC;AAC1F,MAAM,gCAAgC,GAAG,cAAc,CAAC,eAAe,EAAE,qBAAqB,CAAC,CAAC;AAChG,MAAM,oBAAoB,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;AAC1D;AACA,MAAM,0BAA0B,GAAG,iBAAiB;AACpD,EAAE,aAAa;AACf,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,eAAe;AACjB,CAAC,CAAC;AACF,MAAM,2BAA2B,GAAG,iBAAiB;AACrD,EAAE,kBAAkB;AACpB,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,eAAe;AACjB,CAAC,CAAC;AACF,MAAM,4BAA4B,GAAG,iBAAiB;AACtD,EAAE,qBAAqB;AACvB,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,eAAe;AACjB,CAAC,CAAC;AACF,MAAM,uBAAuB,GAAG,iBAAiB;AACjD,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,eAAe;AACjB,CAAC,CAAC;AACF;AACA;AACA;AACA;AACA;AACO,SAAS,YAAY,CAAC,CAAC,EAAE;AAChC,EAAE,OAAO,KAAK;AACd,IAAI,CAAC;AACL,IAAI,CAAC,4BAA4B,EAAE,0BAA0B,CAAC;AAC9D,IAAI,CAAC,6BAA6B,EAAE,2BAA2B,CAAC;AAChE,IAAI,CAAC,gCAAgC,EAAE,4BAA4B,CAAC;AACpE,IAAI,CAAC,oBAAoB,EAAE,uBAAuB,CAAC;AACnD,GAAG,CAAC;AACJ,CAAC;AACD;AACO,SAAS,gBAAgB,CAAC,CAAC,EAAE;AACpC,EAAE,OAAO,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC;AAChE,CAAC;AACD;AACO,SAAS,aAAa,CAAC,CAAC,EAAE;AACjC,EAAE,OAAO,KAAK;AACd,IAAI,CAAC;AACL,IAAI,CAAC,OAAO,EAAE,mBAAmB,CAAC;AAClC,IAAI,CAAC,MAAM,EAAE,mBAAmB,CAAC;AACjC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC;AACzB,GAAG,CAAC;AACJ,CAAC;AACD;AACO,SAAS,gBAAgB,CAAC,CAAC,EAAE;AACpC,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC,CAAC;AACrD,CAAC;AACD;AACA,MAAM,kBAAkB,GAAG,iBAAiB,CAAC,cAAc,CAAC,CAAC;AAC7D;AACO,SAAS,gBAAgB,CAAC,CAAC,EAAE;AACpC,EAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,kBAAkB,CAAC,CAAC,CAAC;AACrD,CAAC;AACD;AACA,MAAM,4BAA4B,GAAG,cAAc,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAC;AACxF,MAAM,oBAAoB,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;AAC1D;AACA,MAAM,+BAA+B,GAAG,iBAAiB;AACzD,EAAE,cAAc;AAChB,EAAE,gBAAgB;AAClB,EAAE,eAAe;AACjB,CAAC,CAAC;AACF;AACO,SAAS,QAAQ,CAAC,CAAC,EAAE;AAC5B,EAAE,OAAO,KAAK;AACd,IAAI,CAAC;AACL,IAAI,CAAC,4BAA4B,EAAE,0BAA0B,CAAC;AAC9D,IAAI,CAAC,oBAAoB,EAAE,+BAA+B,CAAC;AAC3D,GAAG,CAAC;AACJ;;AC9TA,MAAMC,SAAO,GAAG,kBAAkB,CAAC;AACnC;AACA;AACO,MAAM,cAAc,GAAG;AAC9B,IAAI,KAAK,EAAE;AACX,MAAM,IAAI,EAAE,CAAC;AACb,MAAM,KAAK,EAAE,CAAC,GAAG,EAAE;AACnB,MAAM,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE;AAC1B,MAAM,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAC/B,MAAM,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC3C,KAAK;AACL,IAAI,IAAI,EAAE;AACV,MAAM,KAAK,EAAE,EAAE;AACf,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE;AACtB,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAC3B,MAAM,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AACvC,KAAK;AACL,IAAI,KAAK,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE;AAC1E,IAAI,OAAO,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,GAAG,IAAI,EAAE;AACrD,IAAI,OAAO,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE;AACnC,GAAG;AACH,EAAE,YAAY,GAAG;AACjB,IAAI,KAAK,EAAE;AACX,MAAM,QAAQ,EAAE,CAAC;AACjB,MAAM,MAAM,EAAE,EAAE;AAChB,MAAM,KAAK,EAAE,EAAE;AACf,MAAM,IAAI,EAAE,GAAG;AACf,MAAM,KAAK,EAAE,GAAG,GAAG,EAAE;AACrB,MAAM,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE;AAC5B,MAAM,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACjC,MAAM,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC7C,KAAK;AACL,IAAI,QAAQ,EAAE;AACd,MAAM,MAAM,EAAE,CAAC;AACf,MAAM,KAAK,EAAE,EAAE;AACf,MAAM,IAAI,EAAE,EAAE;AACd,MAAM,KAAK,EAAE,EAAE,GAAG,EAAE;AACpB,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAC3B,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChC,MAAM,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC5C,KAAK;AACL,IAAI,MAAM,EAAE;AACZ,MAAM,KAAK,EAAE,CAAC;AACd,MAAM,IAAI,EAAE,EAAE;AACd,MAAM,KAAK,EAAE,EAAE,GAAG,EAAE;AACpB,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAC3B,MAAM,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChC,MAAM,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC5C,KAAK;AACL;AACA,IAAI,GAAG,cAAc;AACrB,GAAG;AACH,EAAE,kBAAkB,GAAG,QAAQ,GAAG,GAAG;AACrC,EAAE,mBAAmB,GAAG,QAAQ,GAAG,IAAI;AACvC,EAAE,cAAc,GAAG;AACnB,IAAI,KAAK,EAAE;AACX,MAAM,QAAQ,EAAE,CAAC;AACjB,MAAM,MAAM,EAAE,EAAE;AAChB,MAAM,KAAK,EAAE,kBAAkB,GAAG,CAAC;AACnC,MAAM,IAAI,EAAE,kBAAkB;AAC9B,MAAM,KAAK,EAAE,kBAAkB,GAAG,EAAE;AACpC,MAAM,OAAO,EAAE,kBAAkB,GAAG,EAAE,GAAG,EAAE;AAC3C,MAAM,OAAO,EAAE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AAChD,MAAM,YAAY,EAAE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC5D,KAAK;AACL,IAAI,QAAQ,EAAE;AACd,MAAM,MAAM,EAAE,CAAC;AACf,MAAM,KAAK,EAAE,kBAAkB,GAAG,EAAE;AACpC,MAAM,IAAI,EAAE,kBAAkB,GAAG,CAAC;AAClC,MAAM,KAAK,EAAE,CAAC,kBAAkB,GAAG,EAAE,IAAI,CAAC;AAC1C,MAAM,OAAO,EAAE,CAAC,kBAAkB,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC;AACjD,MAAM,OAAO,EAAE,CAAC,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC;AACtD,MAAM,YAAY,EAAE,CAAC,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,IAAI,CAAC;AAClE,KAAK;AACL,IAAI,MAAM,EAAE;AACZ,MAAM,KAAK,EAAE,mBAAmB,GAAG,CAAC;AACpC,MAAM,IAAI,EAAE,mBAAmB;AAC/B,MAAM,KAAK,EAAE,mBAAmB,GAAG,EAAE;AACrC,MAAM,OAAO,EAAE,mBAAmB,GAAG,EAAE,GAAG,EAAE;AAC5C,MAAM,OAAO,EAAE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;AACjD,MAAM,YAAY,EAAE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI;AAC7D,KAAK;AACL,IAAI,GAAG,cAAc;AACrB,GAAG,CAAC;AACJ;AACA;AACA,MAAMC,cAAY,GAAG;AACrB,EAAE,OAAO;AACT,EAAE,UAAU;AACZ,EAAE,QAAQ;AACV,EAAE,OAAO;AACT,EAAE,MAAM;AACR,EAAE,OAAO;AACT,EAAE,SAAS;AACX,EAAE,SAAS;AACX,EAAE,cAAc;AAChB,CAAC,CAAC;AACF;AACA,MAAM,YAAY,GAAGA,cAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;AACrD;AACA;AACA,SAASC,OAAK,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,GAAG,KAAK,EAAE;AACzC;AACA,EAAE,MAAM,IAAI,GAAG;AACf,IAAI,MAAM,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE;AAC3E,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;AAChC,IAAI,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,IAAI,GAAG,CAAC,kBAAkB;AACzE,IAAI,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM;AACrC,GAAG,CAAC;AACJ,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AACD;AACA,SAAS,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE;AACxC,EAAE,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;AACnC,EAAE,KAAK,MAAM,IAAI,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;AAC5C,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AACpB,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC,CAAC;AACvD,KAAK;AACL,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,CAAC;AACD;AACA;AACA,SAAS,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE;AACvC;AACA;AACA,EAAE,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC7D;AACA,EAAED,cAAY,CAAC,WAAW,CAAC,CAAC,QAAQ,EAAE,OAAO,KAAK;AAClD,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE;AACrC,MAAM,IAAI,QAAQ,EAAE;AACpB,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;AACpD,QAAQ,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,CAAC;AACtD,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC;AACzC,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;AACjD,OAAO;AACP,MAAM,OAAO,OAAO,CAAC;AACrB,KAAK,MAAM;AACX,MAAM,OAAO,QAAQ,CAAC;AACtB,KAAK;AACL,GAAG,EAAE,IAAI,CAAC,CAAC;AACX;AACA;AACA;AACA,EAAEA,cAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,OAAO,KAAK;AAC7C,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE;AACrC,MAAM,IAAI,QAAQ,EAAE;AACpB,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC5C,QAAQ,IAAI,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;AACnC,QAAQ,IAAI,CAAC,OAAO,CAAC,IAAI,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC;AAC9D,OAAO;AACP,MAAM,OAAO,OAAO,CAAC;AACrB,KAAK,MAAM;AACX,MAAM,OAAO,QAAQ,CAAC;AACtB,KAAK;AACL,GAAG,EAAE,IAAI,CAAC,CAAC;AACX,CAAC;AACD;AACA;AACA,SAAS,YAAY,CAAC,IAAI,EAAE;AAC5B,EAAE,MAAM,OAAO,GAAG,EAAE,CAAC;AACrB,EAAE,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AACnD,IAAI,IAAI,KAAK,KAAK,CAAC,EAAE;AACrB,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAC3B,KAAK;AACL,GAAG;AACH,EAAE,OAAO,OAAO,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAM,QAAQ,CAAC;AAC9B;AACA;AACA;AACA,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,KAAK,UAAU,IAAI,KAAK,CAAC;AACvE,IAAI,IAAI,MAAM,GAAG,QAAQ,GAAG,cAAc,GAAG,YAAY,CAAC;AAC1D;AACA,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE;AACvB,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AAC7B,KAAK;AACL;AACA;AACA;AACA;AACA,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AAChC;AACA;AACA;AACA,IAAI,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;AAC7C;AACA;AACA;AACA,IAAI,IAAI,CAAC,kBAAkB,GAAG,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAC;AAC/D;AACA;AACA;AACA,IAAI,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC;AAC1C;AACA;AACA;AACA,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB;AACA;AACA;AACA,IAAI,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE;AACjC,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;AAC9D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AACpC,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;AAChD,MAAM,MAAM,IAAI,oBAAoB;AACpC,QAAQ,CAAC,4DAA4D;AACrE,UAAU,GAAG,KAAK,IAAI,GAAG,MAAM,GAAG,OAAO,GAAG;AAC5C,SAAS,CAAC;AACV,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,OAAO,IAAI,QAAQ,CAAC;AACxB,MAAM,MAAM,EAAE,eAAe,CAAC,GAAG,EAAE,QAAQ,CAAC,aAAa,CAAC;AAC1D,MAAM,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC;AAClC,MAAM,kBAAkB,EAAE,IAAI,CAAC,kBAAkB;AACjD,MAAM,MAAM,EAAE,IAAI,CAAC,MAAM;AACzB,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,gBAAgB,CAAC,YAAY,EAAE;AACxC,IAAI,IAAI,QAAQ,CAAC,YAAY,CAAC,EAAE;AAChC,MAAM,OAAO,QAAQ,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;AAC/C,KAAK,MAAM,IAAI,QAAQ,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE;AAClD,MAAM,OAAO,YAAY,CAAC;AAC1B,KAAK,MAAM,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE;AACjD,MAAM,OAAO,QAAQ,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;AAC/C,KAAK,MAAM;AACX,MAAM,MAAM,IAAI,oBAAoB;AACpC,QAAQ,CAAC,0BAA0B,EAAE,YAAY,CAAC,SAAS,EAAE,OAAO,YAAY,CAAC,CAAC;AAClF,OAAO,CAAC;AACR,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE;AAC7B,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;AAC5C,IAAI,IAAI,MAAM,EAAE;AAChB,MAAM,OAAO,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC/C,KAAK,MAAM;AACX,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,WAAW,EAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC,CAAC;AAC/F,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE;AACjC,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;AAC5C,IAAI,IAAI,MAAM,EAAE;AAChB,MAAM,OAAO,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC/C,KAAK,MAAM;AACX,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,WAAW,EAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC,CAAC;AAC/F,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,EAAE;AAC7C,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,MAAM,IAAI,oBAAoB,CAAC,kDAAkD,CAAC,CAAC;AACzF,KAAK;AACL;AACA,IAAI,MAAM,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC1F;AACA,IAAI,IAAI,QAAQ,CAAC,cAAc,EAAE;AACjC,MAAM,MAAM,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC;AAC9C,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;AACvC,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,OAAO,aAAa,CAAC,IAAI,EAAE;AAC7B,IAAI,MAAM,UAAU,GAAG;AACvB,MAAM,IAAI,EAAE,OAAO;AACnB,MAAM,KAAK,EAAE,OAAO;AACpB,MAAM,OAAO,EAAE,UAAU;AACzB,MAAM,QAAQ,EAAE,UAAU;AAC1B,MAAM,KAAK,EAAE,QAAQ;AACrB,MAAM,MAAM,EAAE,QAAQ;AACtB,MAAM,IAAI,EAAE,OAAO;AACnB,MAAM,KAAK,EAAE,OAAO;AACpB,MAAM,GAAG,EAAE,MAAM;AACjB,MAAM,IAAI,EAAE,MAAM;AAClB,MAAM,IAAI,EAAE,OAAO;AACnB,MAAM,KAAK,EAAE,OAAO;AACpB,MAAM,MAAM,EAAE,SAAS;AACvB,MAAM,OAAO,EAAE,SAAS;AACxB,MAAM,MAAM,EAAE,SAAS;AACvB,MAAM,OAAO,EAAE,SAAS;AACxB,MAAM,WAAW,EAAE,cAAc;AACjC,MAAM,YAAY,EAAE,cAAc;AAClC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC,CAAC;AACxC;AACA,IAAI,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC;AACtD;AACA,IAAI,OAAO,UAAU,CAAC;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,CAAC,EAAE;AACvB,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,eAAe,GAAG;AACxB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,IAAI,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AAC3B;AACA,IAAI,MAAM,OAAO,GAAG;AACpB,MAAM,GAAG,IAAI;AACb,MAAM,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,KAAK;AACzD,KAAK,CAAC;AACN,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,wBAAwB,CAAC,IAAI,EAAE,GAAG,CAAC;AAC/E,QAAQD,SAAO,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,IAAI,GAAG,EAAE,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC;AACA,IAAI,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC;AAC/C;AACA,IAAI,MAAM,CAAC,GAAGC,cAAY;AAC1B,OAAO,GAAG,CAAC,CAAC,IAAI,KAAK;AACrB,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AACtC,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE;AAC3D,UAAU,OAAO,IAAI,CAAC;AACtB,SAAS;AACT,QAAQ,OAAO,IAAI,CAAC,GAAG;AACvB,WAAW,eAAe,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AACpG,WAAW,MAAM,CAAC,GAAG,CAAC,CAAC;AACvB,OAAO,CAAC;AACR,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACxB;AACA,IAAI,OAAO,IAAI,CAAC,GAAG;AACnB,OAAO,aAAa,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,IAAI,QAAQ,EAAE,GAAG,IAAI,EAAE,CAAC;AACzF,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACjB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;AACjC,IAAI,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;AAC9B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,GAAG;AACV;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC;AAChB,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AAChD,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC;AAC7F,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AAChD,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;AAC9C,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC;AAC/F,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AAChD,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;AACpD,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC;AACrD;AACA;AACA,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;AACrE,IAAI,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,KAAK,CAAC;AAC9B,IAAI,OAAO,CAAC,CAAC;AACb,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE,EAAE;AACvB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;AACnC,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,QAAQ,EAAE,OAAO,IAAI,CAAC;AACtD;AACA,IAAI,IAAI,GAAG;AACX,MAAM,oBAAoB,EAAE,KAAK;AACjC,MAAM,eAAe,EAAE,KAAK;AAC5B,MAAM,aAAa,EAAE,KAAK;AAC1B,MAAM,MAAM,EAAE,UAAU;AACxB,MAAM,GAAG,IAAI;AACb,MAAM,aAAa,EAAE,KAAK;AAC1B,KAAK,CAAC;AACN;AACA,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;AAClE,IAAI,OAAO,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;AACpC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;AACxB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;AACxB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC,GAAG;AAC/C,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AACtB,MAAM,OAAO,CAAC,mBAAmB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;AACnE,KAAK,MAAM;AACX,MAAM,OAAO,CAAC,4BAA4B,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;AACnE,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC;AAClC;AACA,IAAI,OAAO,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;AACtD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC3B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,CAAC,QAAQ,EAAE;AACjB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC;AACnD,MAAM,MAAM,GAAG,EAAE,CAAC;AAClB;AACA,IAAI,KAAK,MAAM,CAAC,IAAIA,cAAY,EAAE;AAClC,MAAM,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE;AAC3E,QAAQ,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7C,OAAO;AACP,KAAK;AACL;AACA,IAAI,OAAOC,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,QAAQ,EAAE;AAClB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;AACpD,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AACnC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,EAAE,EAAE;AACf,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;AAC9C,MAAM,MAAM,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAClD,KAAK;AACL,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,CAAC,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,IAAI,EAAE;AACZ,IAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,MAAM,EAAE;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;AACzF,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;AAC1C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE;AAC5E,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;AAC5D,IAAI,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,kBAAkB,EAAE,CAAC;AACrD,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC7B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,EAAE,CAAC,IAAI,EAAE;AACX,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AAC7D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,GAAG;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;AACjC,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACvC,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;AAC/C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG;AACZ,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,UAAU,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;AACxE,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;AAC/C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,GAAG,KAAK,EAAE;AACpB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;AAC5B,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL;AACA,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;AACxD;AACA,IAAI,MAAM,KAAK,GAAG,EAAE;AACpB,MAAM,WAAW,GAAG,EAAE;AACtB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC7B,IAAI,IAAI,QAAQ,CAAC;AACjB;AACA,IAAI,KAAK,MAAM,CAAC,IAAID,cAAY,EAAE;AAClC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;AACjC,QAAQ,QAAQ,GAAG,CAAC,CAAC;AACrB;AACA,QAAQ,IAAI,GAAG,GAAG,CAAC,CAAC;AACpB;AACA;AACA,QAAQ,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE;AACtC,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;AACtD,UAAU,WAAW,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;AAC9B,SAAS;AACT;AACA;AACA,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;AAC/B,UAAU,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AACzB,SAAS;AACT;AACA;AACA;AACA,QAAQ,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAClC,QAAQ,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACrB,QAAQ,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;AACxD;AACA;AACA,OAAO,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;AACpC,QAAQ,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACjC,OAAO;AACP,KAAK;AACL;AACA;AACA;AACA,IAAI,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE;AACnC,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;AAClC,QAAQ,KAAK,CAAC,QAAQ,CAAC;AACvB,UAAU,GAAG,KAAK,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC;AAC9F,OAAO;AACP,KAAK;AACL;AACA,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AACxC,IAAI,OAAOC,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;AAChD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,GAAG;AACf,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,MAAM,OAAO;AACb,MAAM,QAAQ;AACd,MAAM,OAAO;AACb,MAAM,MAAM;AACZ,MAAM,OAAO;AACb,MAAM,SAAS;AACf,MAAM,SAAS;AACf,MAAM,cAAc;AACpB,KAAK,CAAC;AACN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,OAAO,GAAG,EAAE,CAAC;AACvB,IAAI,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;AAC9C,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AAC9D,KAAK;AACL,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC;AAClD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,GAAG;AAChB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC3C,IAAI,OAAOA,OAAK,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC;AAC/C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,KAAK,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC;AACvD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,QAAQ,GAAG;AACjB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,GAAG,GAAG,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,GAAG,GAAG,CAAC;AACxD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,KAAK,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC;AACvD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC;AACtD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,KAAK,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC;AACvD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,GAAG,GAAG,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,GAAG,GAAG,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,YAAY,GAAG;AACrB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,IAAI,CAAC,GAAG,GAAG,CAAC;AAC9D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,kBAAkB,GAAG;AAC3B,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,KAAK,EAAE;AAChB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;AACzC,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK;AACL;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;AACrC,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK;AACL;AACA,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE;AACxB;AACA,MAAM,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,EAAE,OAAO,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,CAAC,CAAC;AAC5E,MAAM,OAAO,EAAE,KAAK,EAAE,CAAC;AACvB,KAAK;AACL;AACA,IAAI,KAAK,MAAM,CAAC,IAAID,cAAY,EAAE;AAClC,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;AAChD,QAAQ,OAAO,KAAK,CAAC;AACrB,OAAO;AACP,KAAK;AACL,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;;ACx+BA,MAAMD,SAAO,GAAG,kBAAkB,CAAC;AACnC;AACA;AACA,SAAS,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE;AACtC,EAAE,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;AAChC,IAAI,OAAO,QAAQ,CAAC,OAAO,CAAC,0BAA0B,CAAC,CAAC;AACxD,GAAG,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE;AACnC,IAAI,OAAO,QAAQ,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC;AACtD,GAAG,MAAM,IAAI,GAAG,GAAG,KAAK,EAAE;AAC1B,IAAI,OAAO,QAAQ,CAAC,OAAO;AAC3B,MAAM,kBAAkB;AACxB,MAAM,CAAC,kEAAkE,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,SAAS,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;AACjH,KAAK,CAAC;AACN,GAAG,MAAM;AACT,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAM,QAAQ,CAAC;AAC9B;AACA;AACA;AACA,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB;AACA;AACA;AACA,IAAI,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;AAC1B;AACA;AACA;AACA,IAAI,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;AACxB;AACA;AACA;AACA,IAAI,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC;AAC1C;AACA;AACA;AACA,IAAI,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,EAAE;AAC7C,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,MAAM,IAAI,oBAAoB,CAAC,kDAAkD,CAAC,CAAC;AACzF,KAAK;AACL;AACA,IAAI,MAAM,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC1F;AACA,IAAI,IAAI,QAAQ,CAAC,cAAc,EAAE;AACjC,MAAM,MAAM,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC;AAC9C,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;AACvC,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE;AACnC,IAAI,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC;AAC9C,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;AACvC;AACA,IAAI,MAAM,aAAa,GAAG,gBAAgB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;AACjE;AACA,IAAI,IAAI,aAAa,IAAI,IAAI,EAAE;AAC/B,MAAM,OAAO,IAAI,QAAQ,CAAC;AAC1B,QAAQ,KAAK,EAAE,UAAU;AACzB,QAAQ,GAAG,EAAE,QAAQ;AACrB,OAAO,CAAC,CAAC;AACT,KAAK,MAAM;AACX,MAAM,OAAO,aAAa,CAAC;AAC3B,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE;AAChC,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC;AACnD,MAAM,EAAE,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;AACnC,IAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACpD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,MAAM,CAAC,GAAG,EAAE,QAAQ,EAAE;AAC/B,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC;AACnD,MAAM,EAAE,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;AACjC,IAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE;AAC7B,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC9C,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AAChB,MAAM,IAAI,KAAK,EAAE,YAAY,CAAC;AAC9B,MAAM,IAAI;AACV,QAAQ,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC1C,QAAQ,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC;AACrC,OAAO,CAAC,OAAO,CAAC,EAAE;AAClB,QAAQ,YAAY,GAAG,KAAK,CAAC;AAC7B,OAAO;AACP;AACA,MAAM,IAAI,GAAG,EAAE,UAAU,CAAC;AAC1B,MAAM,IAAI;AACV,QAAQ,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACxC,QAAQ,UAAU,GAAG,GAAG,CAAC,OAAO,CAAC;AACjC,OAAO,CAAC,OAAO,CAAC,EAAE;AAClB,QAAQ,UAAU,GAAG,KAAK,CAAC;AAC3B,OAAO;AACP;AACA,MAAM,IAAI,YAAY,IAAI,UAAU,EAAE;AACtC,QAAQ,OAAO,QAAQ,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAClD,OAAO;AACP;AACA,MAAM,IAAI,YAAY,EAAE;AACxB,QAAQ,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC9C,QAAQ,IAAI,GAAG,CAAC,OAAO,EAAE;AACzB,UAAU,OAAO,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC5C,SAAS;AACT,OAAO,MAAM,IAAI,UAAU,EAAE;AAC7B,QAAQ,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC9C,QAAQ,IAAI,GAAG,CAAC,OAAO,EAAE;AACzB,UAAU,OAAO,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC3C,SAAS;AACT,OAAO;AACP,KAAK;AACL,IAAI,OAAO,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC,WAAW,EAAE,IAAI,CAAC,6BAA6B,CAAC,CAAC,CAAC;AAC7F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,CAAC,EAAE;AACvB,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,KAAK,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,GAAG,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,YAAY,GAAG;AACrB,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC;AACnE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC;AACvC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,kBAAkB,GAAG;AAC3B,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,IAAI,GAAG,cAAc,EAAE;AAChC,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AACrE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,IAAI,GAAG,cAAc,EAAE,IAAI,EAAE;AACrC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,CAAC;AAClC,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjD,IAAI,IAAI,GAAG,CAAC;AACZ,IAAI,IAAI,IAAI,EAAE,cAAc,EAAE;AAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3D,KAAK,MAAM;AACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;AACrB,KAAK;AACL,IAAI,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAClC,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;AAChG,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,IAAI,EAAE;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC;AAC1F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,QAAQ,EAAE;AACpB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC;AAC7B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,QAAQ,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC;AAC9B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,QAAQ,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC;AACnD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;AAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;AAClE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,GAAG,SAAS,EAAE;AACxB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;AACjC,IAAI,MAAM,MAAM,GAAG,SAAS;AAC5B,SAAS,GAAG,CAAC,gBAAgB,CAAC;AAC9B,SAAS,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AACxC,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC;AACpD,MAAM,OAAO,GAAG,EAAE,CAAC;AACnB,IAAI,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI;AACpB,MAAM,CAAC,GAAG,CAAC,CAAC;AACZ;AACA,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE;AACvB,MAAM,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AACvC,QAAQ,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;AACjD,MAAM,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACpD,MAAM,CAAC,GAAG,IAAI,CAAC;AACf,MAAM,CAAC,IAAI,CAAC,CAAC;AACb,KAAK;AACL;AACA,IAAI,OAAO,OAAO,CAAC;AACnB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,QAAQ,EAAE;AACpB,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;AACpD;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;AACvE,MAAM,OAAO,EAAE,CAAC;AAChB,KAAK;AACL;AACA,IAAI,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI;AACpB,MAAM,GAAG,GAAG,CAAC;AACb,MAAM,IAAI,CAAC;AACX;AACA,IAAI,MAAM,OAAO,GAAG,EAAE,CAAC;AACvB,IAAI,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE;AACvB,MAAM,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAClE,MAAM,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;AAC/C,MAAM,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AACpD,MAAM,CAAC,GAAG,IAAI,CAAC;AACf,MAAM,GAAG,IAAI,CAAC,CAAC;AACf,KAAK;AACL;AACA,IAAI,OAAO,OAAO,CAAC;AACnB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,aAAa,CAAC,aAAa,EAAE;AAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;AACjC,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;AAC/E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,KAAK,EAAE;AAClB,IAAI,OAAO,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAChD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,KAAK,EAAE;AACpB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,KAAK,EAAE;AAClB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,KAAK,EAAE;AACjB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC,IAAI,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;AAClD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,KAAK,EAAE;AAChB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;AACzC,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK;AACL;AACA,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC5D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,YAAY,CAAC,KAAK,EAAE;AACtB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AACjD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAC9C;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE;AAChB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,MAAM;AACX,MAAM,OAAO,QAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,KAAK,EAAE;AACf,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;AACjD,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAC9C,IAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,KAAK,CAAC,SAAS,EAAE;AAC1B,IAAI,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,SAAS;AACpC,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,OAAO,MAAM;AACb,QAAQ,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,IAAI,KAAK;AACpC,UAAU,IAAI,CAAC,OAAO,EAAE;AACxB,YAAY,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACjC,WAAW,MAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;AACzE,YAAY,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AAChD,WAAW,MAAM;AACjB,YAAY,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACnD,WAAW;AACX,SAAS;AACT,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC;AAClB,OAAO,CAAC;AACR,IAAI,IAAI,KAAK,EAAE;AACf,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACxB,KAAK;AACL,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG,CAAC,SAAS,EAAE;AACxB,IAAI,IAAI,KAAK,GAAG,IAAI;AACpB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,IAAI,MAAM,OAAO,GAAG,EAAE;AACtB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK;AAClC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE;AAChC,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE;AAChC,OAAO,CAAC;AACR,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;AACjD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACtD;AACA,IAAI,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE;AACzB,MAAM,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9C;AACA,MAAM,IAAI,YAAY,KAAK,CAAC,EAAE;AAC9B,QAAQ,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;AACvB,OAAO,MAAM;AACb,QAAQ,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE;AACzC,UAAU,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9D,SAAS;AACT;AACA,QAAQ,KAAK,GAAG,IAAI,CAAC;AACrB,OAAO;AACP,KAAK;AACL;AACA,IAAI,OAAO,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;AACnC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,GAAG,SAAS,EAAE;AAC3B,IAAI,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AACjD,OAAO,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;AACvC,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC,IAAI,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC,GAAG;AAC/C,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AACtB,MAAM,OAAO,CAAC,kBAAkB,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7E,KAAK,MAAM;AACX,MAAM,OAAO,CAAC,4BAA4B,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;AACnE,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,cAAc,CAAC,UAAU,GAAG3B,UAAkB,EAAE,IAAI,GAAG,EAAE,EAAE;AAC7D,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC;AACjF,QAAQ2B,SAAO,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,IAAI,EAAE;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,GAAG;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC,IAAI,EAAE;AAClB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACjE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,UAAU,EAAE,EAAE,SAAS,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE;AACnD,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAOA,SAAO,CAAC;AACtC,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACtF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE;AACzB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;AAClD,KAAK;AACL,IAAI,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAC3C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,YAAY,CAAC,KAAK,EAAE;AACtB,IAAI,OAAO,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAChE,GAAG;AACH;;ACppBA;AACA;AACA;AACe,MAAM,IAAI,CAAC;AAC1B;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,MAAM,CAAC,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE;AAC7C,IAAI,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;AAClE;AACA,IAAI,OAAO,CAAC,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;AAChF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,eAAe,CAAC,IAAI,EAAE;AAC/B,IAAI,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;AACtC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,aAAa,CAAC,KAAK,EAAE;AAC9B,IAAI,OAAO,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;AACtD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AAC/D,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;AAC9D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,yBAAyB,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AAC1E,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,qBAAqB,EAAE,CAAC;AACrE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,kBAAkB,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AACnE;AACA,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC,KAAK,EAAE,CAAC;AACtE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,MAAM;AACf,IAAI,MAAM,GAAG,MAAM;AACnB,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,cAAc,GAAG,SAAS,EAAE,GAAG,EAAE;AAC7F,IAAI;AACJ,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;AAC7F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,YAAY;AACrB,IAAI,MAAM,GAAG,MAAM;AACnB,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,cAAc,GAAG,SAAS,EAAE,GAAG,EAAE;AAC7F,IAAI;AACJ,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACnG,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,MAAM,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AAClG,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;AACrF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,cAAc;AACvB,IAAI,MAAM,GAAG,MAAM;AACnB,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE;AACjE,IAAI;AACJ,IAAI,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AAC3F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AAC3C,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,IAAI,CAAC,MAAM,GAAG,OAAO,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AACxD,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC/D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,QAAQ,GAAG;AACpB,IAAI,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,CAAC;AACxE,GAAG;AACH;;AC1MA,SAAS,OAAO,CAAC,OAAO,EAAE,KAAK,EAAE;AACjC,EAAE,MAAM,WAAW,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE;AAC3F,IAAI,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;AACnD,EAAE,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;AACxD,CAAC;AACD;AACA,SAAS,cAAc,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE;AAC9C,EAAE,MAAM,OAAO,GAAG;AAClB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;AACxC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AACzE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;AACpE,IAAI;AACJ,MAAM,OAAO;AACb,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK;AAChB,QAAQ,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,QAAQ,OAAO,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;AACvC,OAAO;AACP,KAAK;AACL,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;AACrB,GAAG,CAAC;AACJ;AACA,EAAE,MAAM,OAAO,GAAG,EAAE,CAAC;AACrB,EAAE,MAAM,OAAO,GAAG,MAAM,CAAC;AACzB,EAAE,IAAI,WAAW,EAAE,SAAS,CAAC;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,OAAO,EAAE;AACxC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AAClC,MAAM,WAAW,GAAG,IAAI,CAAC;AACzB;AACA,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC5C,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACxC;AACA,MAAM,IAAI,SAAS,GAAG,KAAK,EAAE;AAC7B;AACA,QAAQ,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;AACxB,QAAQ,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACvC;AACA;AACA;AACA;AACA,QAAQ,IAAI,MAAM,GAAG,KAAK,EAAE;AAC5B;AACA,UAAU,SAAS,GAAG,MAAM,CAAC;AAC7B;AACA,UAAU,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;AAC1B,UAAU,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACzC,SAAS;AACT,OAAO,MAAM;AACb,QAAQ,MAAM,GAAG,SAAS,CAAC;AAC3B,OAAO;AACP,KAAK;AACL,GAAG;AACH;AACA,EAAE,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;AACnD,CAAC;AACD;AACe,aAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;AACtD,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,CAAC,GAAG,cAAc,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;AACxF;AACA,EAAE,MAAM,eAAe,GAAG,KAAK,GAAG,MAAM,CAAC;AACzC;AACA,EAAE,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM;AACtC,IAAI,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1E,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE;AACpC,IAAI,IAAI,SAAS,GAAG,KAAK,EAAE;AAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC,CAAC;AACpD,KAAK;AACL;AACA,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE;AAC9B,MAAM,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,eAAe,IAAI,SAAS,GAAG,MAAM,CAAC,CAAC;AAClG,KAAK;AACL,GAAG;AACH;AACA,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACtD;AACA,EAAE,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;AAClC,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,EAAE,IAAI,CAAC;AACrD,OAAO,OAAO,CAAC,GAAG,eAAe,CAAC;AAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC;AACtB,GAAG,MAAM;AACT,IAAI,OAAO,QAAQ,CAAC;AACpB,GAAG;AACH;;ACtFA,MAAM,WAAW,GAAG,mDAAmD,CAAC;AACxE;AACA,SAAS,OAAO,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;AACzC,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACzD,CAAC;AACD;AACA,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;AACtC,MAAM,WAAW,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AACjC,MAAM,iBAAiB,GAAG,IAAI,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AACvD;AACA,SAAS,YAAY,CAAC,CAAC,EAAE;AACzB;AACA;AACA,EAAE,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,iBAAiB,EAAE,WAAW,CAAC,CAAC;AAC1E,CAAC;AACD;AACA,SAAS,oBAAoB,CAAC,CAAC,EAAE;AACjC,EAAE,OAAO,CAAC;AACV,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;AACvB,KAAK,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;AACpC,KAAK,WAAW,EAAE,CAAC;AACnB,CAAC;AACD;AACA,SAAS,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE;AACpC,EAAE,IAAI,OAAO,KAAK,IAAI,EAAE;AACxB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG,MAAM;AACT,IAAI,OAAO;AACX,MAAM,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxD,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;AACjB,QAAQ,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,oBAAoB,CAAC,CAAC,CAAC,KAAK,oBAAoB,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU;AAClG,KAAK,CAAC;AACN,GAAG;AACH,CAAC;AACD;AACA,SAAS,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE;AAC/B,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;AACpE,CAAC;AACD;AACA,SAAS,MAAM,CAAC,KAAK,EAAE;AACvB,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;AACtC,CAAC;AACD;AACA,SAAS,WAAW,CAAC,KAAK,EAAE;AAC5B,EAAE,OAAO,KAAK,CAAC,OAAO,CAAC,6BAA6B,EAAE,MAAM,CAAC,CAAC;AAC9D,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE;AAClC,EAAE,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC;AAC7B,IAAI,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;AAChC,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;AAClC,IAAI,IAAI,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;AACjC,IAAI,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;AAChC,IAAI,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACvC,IAAI,UAAU,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACzC,IAAI,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACvC,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACxC,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACxC,IAAI,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC;AACxC,IAAI,OAAO,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC9F,IAAI,OAAO,GAAG,CAAC,CAAC,KAAK;AACrB,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE;AACzB,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AAC1B,OAAO;AACP,MAAM,QAAQ,CAAC,CAAC,GAAG;AACnB;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7C,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5C;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;AACpD,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;AAC/B,QAAQ,KAAK,OAAO;AACpB,UAAU,OAAO,OAAO,CAAC,SAAS,CAAC,CAAC;AACpC,QAAQ,KAAK,QAAQ;AACrB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACrD,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACrD;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,UAAU,CAAC,CAAC;AACrC,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAChC;AACA,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,UAAU,CAAC,CAAC;AACrC,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAChC,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC;AAClC,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;AAC3C;AACA,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;AAC/B,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;AACpD;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AACnC,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B;AACA,QAAQ,KAAK,GAAG,CAAC;AACjB,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACxD,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,QAAQ,KAAK,MAAM;AACnB,UAAU,OAAO,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;AACtD;AACA,QAAQ,KAAK,GAAG,CAAC;AACjB,QAAQ,KAAK,IAAI;AACjB,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxF,QAAQ,KAAK,KAAK;AAClB,UAAU,OAAO,MAAM,CAAC,IAAI,MAAM,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnF;AACA;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,MAAM,CAAC,oBAAoB,CAAC,CAAC;AAC9C;AACA;AACA,QAAQ,KAAK,GAAG;AAChB,UAAU,OAAO,MAAM,CAAC,WAAW,CAAC,CAAC;AACrC,QAAQ;AACR,UAAU,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AAC5B,OAAO;AACP,KAAK,CAAC;AACN;AACA,EAAE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI;AACjC,IAAI,aAAa,EAAE,WAAW;AAC9B,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;AACrB;AACA,EAAE,OAAO,IAAI,CAAC;AACd,CAAC;AACD;AACA,MAAM,uBAAuB,GAAG;AAChC,EAAE,IAAI,EAAE;AACR,IAAI,SAAS,EAAE,IAAI;AACnB,IAAI,OAAO,EAAE,OAAO;AACpB,GAAG;AACH,EAAE,KAAK,EAAE;AACT,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,IAAI,KAAK,EAAE,KAAK;AAChB,IAAI,IAAI,EAAE,MAAM;AAChB,GAAG;AACH,EAAE,GAAG,EAAE;AACP,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,GAAG;AACH,EAAE,OAAO,EAAE;AACX,IAAI,KAAK,EAAE,KAAK;AAChB,IAAI,IAAI,EAAE,MAAM;AAChB,GAAG;AACH,EAAE,SAAS,EAAE,GAAG;AAChB,EAAE,SAAS,EAAE,GAAG;AAChB,EAAE,MAAM,EAAE;AACV,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,GAAG;AACH,EAAE,MAAM,EAAE;AACV,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,GAAG;AACH,EAAE,MAAM,EAAE;AACV,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,GAAG;AACH,EAAE,MAAM,EAAE;AACV,IAAI,OAAO,EAAE,GAAG;AAChB,IAAI,SAAS,EAAE,IAAI;AACnB,GAAG;AACH,EAAE,YAAY,EAAE;AAChB,IAAI,IAAI,EAAE,OAAO;AACjB,IAAI,KAAK,EAAE,KAAK;AAChB,GAAG;AACH,CAAC,CAAC;AACF;AACA,SAAS,YAAY,CAAC,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE;AACtD,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;AAC/B;AACA,EAAE,IAAI,IAAI,KAAK,SAAS,EAAE;AAC1B,IAAI,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACxC,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,CAAC,OAAO;AACvB,MAAM,GAAG,EAAE,OAAO,GAAG,GAAG,GAAG,KAAK;AAChC,KAAK,CAAC;AACN,GAAG;AACH;AACA,EAAE,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;AACjC;AACA;AACA;AACA;AACA,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC;AACxB,EAAE,IAAI,IAAI,KAAK,MAAM,EAAE;AACvB,IAAI,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,EAAE;AACnC,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAC3D,KAAK,MAAM,IAAI,UAAU,CAAC,SAAS,IAAI,IAAI,EAAE;AAC7C,MAAM,IAAI,UAAU,CAAC,SAAS,KAAK,KAAK,IAAI,UAAU,CAAC,SAAS,KAAK,KAAK,EAAE;AAC5E,QAAQ,UAAU,GAAG,QAAQ,CAAC;AAC9B,OAAO,MAAM;AACb,QAAQ,UAAU,GAAG,QAAQ,CAAC;AAC9B,OAAO;AACP,KAAK,MAAM;AACX;AACA;AACA,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAC7D,KAAK;AACL,GAAG;AACH,EAAE,IAAI,GAAG,GAAG,uBAAuB,CAAC,UAAU,CAAC,CAAC;AAChD,EAAE,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;AAC/B,IAAI,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AACrB,GAAG;AACH;AACA,EAAE,IAAI,GAAG,EAAE;AACX,IAAI,OAAO;AACX,MAAM,OAAO,EAAE,KAAK;AACpB,MAAM,GAAG;AACT,KAAK,CAAC;AACN,GAAG;AACH;AACA,EAAE,OAAO,SAAS,CAAC;AACnB,CAAC;AACD;AACA,SAAS,UAAU,CAAC,KAAK,EAAE;AAC3B,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACjF,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAC5B,CAAC;AACD;AACA,SAAS,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE;AACvC,EAAE,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AACrC;AACA,EAAE,IAAI,OAAO,EAAE;AACf,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;AACnB,IAAI,IAAI,UAAU,GAAG,CAAC,CAAC;AACvB,IAAI,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;AAC9B,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE;AACvC,QAAQ,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC7B,UAAU,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;AAC/C,QAAQ,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,KAAK,EAAE;AACnC,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC;AACxF,SAAS;AACT,QAAQ,UAAU,IAAI,MAAM,CAAC;AAC7B,OAAO;AACP,KAAK;AACL,IAAI,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;AAC1B,GAAG,MAAM;AACT,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACzB,GAAG;AACH,CAAC;AACD;AACA,SAAS,mBAAmB,CAAC,OAAO,EAAE;AACtC,EAAE,MAAM,OAAO,GAAG,CAAC,KAAK,KAAK;AAC7B,IAAI,QAAQ,KAAK;AACjB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,aAAa,CAAC;AAC7B,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,QAAQ,CAAC;AACxB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,QAAQ,CAAC;AACxB,MAAM,KAAK,GAAG,CAAC;AACf,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,MAAM,CAAC;AACtB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,KAAK,CAAC;AACrB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,SAAS,CAAC;AACzB,MAAM,KAAK,GAAG,CAAC;AACf,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,OAAO,CAAC;AACvB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,MAAM,CAAC;AACtB,MAAM,KAAK,GAAG,CAAC;AACf,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,SAAS,CAAC;AACzB,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,YAAY,CAAC;AAC5B,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,UAAU,CAAC;AAC1B,MAAM,KAAK,GAAG;AACd,QAAQ,OAAO,SAAS,CAAC;AACzB,MAAM;AACN,QAAQ,OAAO,IAAI,CAAC;AACpB,KAAK;AACL,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC;AAClB,EAAE,IAAI,cAAc,CAAC;AACrB,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC/B,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACtC,GAAG;AACH;AACA,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC/B,IAAI,IAAI,CAAC,IAAI,EAAE;AACf,MAAM,IAAI,GAAG,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AAC5C,KAAK;AACL,IAAI,cAAc,GAAG,OAAO,CAAC,CAAC,CAAC;AAC/B,GAAG;AACH;AACA,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC/B,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxC,GAAG;AACH;AACA,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC/B,IAAI,IAAI,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE;AAC3C,MAAM,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;AACtB,KAAK,MAAM,IAAI,OAAO,CAAC,CAAC,KAAK,EAAE,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE;AACpD,MAAM,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;AACpB,KAAK;AACL,GAAG;AACH;AACA,EAAE,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE;AACpC,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;AAC3B,GAAG;AACH;AACA,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AAC/B,IAAI,OAAO,CAAC,CAAC,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACvC,GAAG;AACH;AACA,EAAE,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK;AACrD,IAAI,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AACzB,IAAI,IAAI,CAAC,EAAE;AACX,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AACxB,KAAK;AACL;AACA,IAAI,OAAO,CAAC,CAAC;AACb,GAAG,EAAE,EAAE,CAAC,CAAC;AACT;AACA,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;AACtC,CAAC;AACD;AACA,IAAI,kBAAkB,GAAG,IAAI,CAAC;AAC9B;AACA,SAAS,gBAAgB,GAAG;AAC5B,EAAE,IAAI,CAAC,kBAAkB,EAAE;AAC3B,IAAI,kBAAkB,GAAG,QAAQ,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;AAC5D,GAAG;AACH;AACA,EAAE,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AACD;AACA,SAAS,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE;AAC9C,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE;AACrB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA,EAAE,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACjE,EAAE,MAAM,MAAM,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;AACxD;AACA,EAAE,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;AACpD,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,CAAC;AACD;AACO,SAAS,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE;AAClD,EAAE,OAAO,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,qBAAqB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;AACxF,CAAC;AACD;AACA;AACA;AACA;AACA;AACO,MAAM,WAAW,CAAC;AACzB,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE;AAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,IAAI,IAAI,CAAC,MAAM,GAAG,iBAAiB,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;AAC3E,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACjE,IAAI,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,CAAC;AACrE;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE;AACjC,MAAM,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC7D,MAAM,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AAC5C,MAAM,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAC/B,KAAK;AACL,GAAG;AACH;AACA,EAAE,iBAAiB,CAAC,KAAK,EAAE;AAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC;AAC/E,KAAK,MAAM;AACX,MAAM,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC;AAC3E,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,GAAG,OAAO;AAChD,YAAY,mBAAmB,CAAC,OAAO,CAAC;AACxC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AACpC,MAAM,IAAI,cAAc,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;AACxE,QAAQ,MAAM,IAAI,6BAA6B;AAC/C,UAAU,uDAAuD;AACjE,SAAS,CAAC;AACV,OAAO;AACP,MAAM,OAAO;AACb,QAAQ,KAAK;AACb,QAAQ,MAAM,EAAE,IAAI,CAAC,MAAM;AAC3B,QAAQ,KAAK,EAAE,IAAI,CAAC,KAAK;AACzB,QAAQ,UAAU;AAClB,QAAQ,OAAO;AACf,QAAQ,MAAM;AACd,QAAQ,IAAI;AACZ,QAAQ,cAAc;AACtB,OAAO,CAAC;AACR,KAAK;AACL,GAAG;AACH;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC;AACnC,GAAG;AACH;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC,aAAa,GAAG,IAAI,CAAC;AAChF,GAAG;AACH,CAAC;AACD;AACO,SAAS,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;AACzD,EAAE,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACjD,EAAE,OAAO,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;AACzC,CAAC;AACD;AACO,SAAS,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;AACvD,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,EAAE,GAAG,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;AACnG,EAAE,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,CAAC,CAAC;AACvD,CAAC;AACD;AACO,SAAS,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE;AACvD,EAAE,IAAI,CAAC,UAAU,EAAE;AACnB,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA,EAAE,MAAM,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AACzD,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,gBAAgB,EAAE,CAAC,CAAC;AACvD,EAAE,MAAM,KAAK,GAAG,EAAE,CAAC,aAAa,EAAE,CAAC;AACnC,EAAE,MAAM,YAAY,GAAG,EAAE,CAAC,eAAe,EAAE,CAAC;AAC5C,EAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC,CAAC;AACrE;;ACncA,MAAM,OAAO,GAAG,kBAAkB,CAAC;AACnC,MAAM,QAAQ,GAAG,OAAO,CAAC;AACzB;AACA,SAAS,eAAe,CAAC,IAAI,EAAE;AAC/B,EAAE,OAAO,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;AACrF,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,SAAS,sBAAsB,CAAC,EAAE,EAAE;AACpC,EAAE,IAAI,EAAE,CAAC,QAAQ,KAAK,IAAI,EAAE;AAC5B,IAAI,EAAE,CAAC,QAAQ,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACxC,GAAG;AACH,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC;AACrB,CAAC;AACD;AACA;AACA;AACA;AACA,SAAS,2BAA2B,CAAC,EAAE,EAAE;AACzC,EAAE,IAAI,EAAE,CAAC,aAAa,KAAK,IAAI,EAAE;AACjC,IAAI,EAAE,CAAC,aAAa,GAAG,eAAe;AACtC,MAAM,EAAE,CAAC,CAAC;AACV,MAAM,EAAE,CAAC,GAAG,CAAC,qBAAqB,EAAE;AACpC,MAAM,EAAE,CAAC,GAAG,CAAC,cAAc,EAAE;AAC7B,KAAK,CAAC;AACN,GAAG;AACH,EAAE,OAAO,EAAE,CAAC,aAAa,CAAC;AAC1B,CAAC;AACD;AACA;AACA;AACA,SAAS,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE;AAC3B,EAAE,MAAM,OAAO,GAAG;AAClB,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE;AACf,IAAI,IAAI,EAAE,IAAI,CAAC,IAAI;AACnB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AACb,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;AACb,IAAI,GAAG,EAAE,IAAI,CAAC,GAAG;AACjB,IAAI,OAAO,EAAE,IAAI,CAAC,OAAO;AACzB,GAAG,CAAC;AACJ,EAAE,OAAO,IAAI,QAAQ,CAAC,EAAE,GAAG,OAAO,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;AAC7D,CAAC;AACD;AACA;AACA;AACA,SAAS,SAAS,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE;AACnC;AACA,EAAE,IAAI,QAAQ,GAAG,OAAO,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;AACzC;AACA;AACA,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC;AACA;AACA,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE;AAChB,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;AACzB,GAAG;AACH;AACA;AACA,EAAE,QAAQ,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC;AACnC;AACA;AACA,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;AACjC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;AACjB,IAAI,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;AAC1B,GAAG;AACH;AACA;AACA,EAAE,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AACpE,CAAC;AACD;AACA;AACA,SAAS,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE;AAC7B,EAAE,EAAE,IAAI,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC;AAC3B;AACA,EAAE,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC;AACzB;AACA,EAAE,OAAO;AACT,IAAI,IAAI,EAAE,CAAC,CAAC,cAAc,EAAE;AAC5B,IAAI,KAAK,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC;AAC9B,IAAI,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE;AACvB,IAAI,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE;AACzB,IAAI,MAAM,EAAE,CAAC,CAAC,aAAa,EAAE;AAC7B,IAAI,MAAM,EAAE,CAAC,CAAC,aAAa,EAAE;AAC7B,IAAI,WAAW,EAAE,CAAC,CAAC,kBAAkB,EAAE;AACvC,GAAG,CAAC;AACJ,CAAC;AACD;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;AACpC,EAAE,OAAO,SAAS,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AACpD,CAAC;AACD;AACA;AACA,SAAS,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE;AAC/B,EAAE,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC;AACrB,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;AAC9C,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC;AAChF,IAAI,CAAC,GAAG;AACR,MAAM,GAAG,IAAI,CAAC,CAAC;AACf,MAAM,IAAI;AACV,MAAM,KAAK;AACX,MAAM,GAAG;AACT,QAAQ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AACtD,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AAC5B,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;AACjC,KAAK;AACL,IAAI,WAAW,GAAG,QAAQ,CAAC,UAAU,CAAC;AACtC,MAAM,KAAK,EAAE,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;AAC9C,MAAM,QAAQ,EAAE,GAAG,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;AACvD,MAAM,MAAM,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;AACjD,MAAM,KAAK,EAAE,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;AAC9C,MAAM,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;AAC3C,MAAM,KAAK,EAAE,GAAG,CAAC,KAAK;AACtB,MAAM,OAAO,EAAE,GAAG,CAAC,OAAO;AAC1B,MAAM,OAAO,EAAE,GAAG,CAAC,OAAO;AAC1B,MAAM,YAAY,EAAE,GAAG,CAAC,YAAY;AACpC,KAAK,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC;AACzB,IAAI,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;AAC9B;AACA,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACpD;AACA,EAAE,IAAI,WAAW,KAAK,CAAC,EAAE;AACzB,IAAI,EAAE,IAAI,WAAW,CAAC;AACtB;AACA,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC7B,GAAG;AACH;AACA,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;AACnB,CAAC;AACD;AACA;AACA;AACA,SAAS,mBAAmB,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE;AACrF,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AACjC,EAAE,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,KAAK,UAAU,EAAE;AAClE,IAAI,MAAM,kBAAkB,GAAG,UAAU,IAAI,IAAI;AACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,EAAE;AACzC,QAAQ,GAAG,IAAI;AACf,QAAQ,IAAI,EAAE,kBAAkB;AAChC,QAAQ,cAAc;AACtB,OAAO,CAAC,CAAC;AACT,IAAI,OAAO,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC/C,GAAG,MAAM;AACT,IAAI,OAAO,QAAQ,CAAC,OAAO;AAC3B,MAAM,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC,WAAW,EAAE,IAAI,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC,CAAC;AACnF,KAAK,CAAC;AACN,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA,SAAS,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE;AACjD,EAAE,OAAO,EAAE,CAAC,OAAO;AACnB,MAAM,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;AAC/C,QAAQ,MAAM;AACd,QAAQ,WAAW,EAAE,IAAI;AACzB,OAAO,CAAC,CAAC,wBAAwB,CAAC,EAAE,EAAE,MAAM,CAAC;AAC7C,MAAM,IAAI,CAAC;AACX,CAAC;AACD;AACA,SAAS,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE;AAC3C,EAAE,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACrD,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC;AACb,EAAE,IAAI,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC;AAC5C,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9C,EAAE,IAAI,SAAS,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC;AACrC,EAAE,IAAI,QAAQ,EAAE;AAChB,IAAI,CAAC,IAAI,GAAG,CAAC;AACb,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAC7B,IAAI,IAAI,SAAS,KAAK,OAAO,EAAE,OAAO,CAAC,CAAC;AACxC,IAAI,CAAC,IAAI,GAAG,CAAC;AACb,GAAG,MAAM;AACT,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAC7B,IAAI,IAAI,SAAS,KAAK,OAAO,EAAE,OAAO,CAAC,CAAC;AACxC,GAAG;AACH,EAAE,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACzB,EAAE,OAAO,CAAC,CAAC;AACX,CAAC;AACD;AACA,SAAS,SAAS;AAClB,EAAE,CAAC;AACH,EAAE,QAAQ;AACV,EAAE,eAAe;AACjB,EAAE,oBAAoB;AACtB,EAAE,aAAa;AACf,EAAE,YAAY;AACd,EAAE,SAAS;AACX,EAAE;AACF,EAAE,IAAI,WAAW,GAAG,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;AACjF,IAAI,CAAC,GAAG,EAAE,CAAC;AACX,EAAE,QAAQ,SAAS;AACnB,IAAI,KAAK,KAAK,CAAC;AACf,IAAI,KAAK,OAAO,CAAC;AACjB,IAAI,KAAK,MAAM;AACf,MAAM,MAAM;AACZ,IAAI;AACJ,MAAM,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC9B,MAAM,IAAI,SAAS,KAAK,MAAM,EAAE,MAAM;AACtC,MAAM,IAAI,QAAQ,EAAE;AACpB,QAAQ,CAAC,IAAI,GAAG,CAAC;AACjB,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAClC,QAAQ,IAAI,SAAS,KAAK,QAAQ,EAAE,MAAM;AAC1C,QAAQ,IAAI,WAAW,EAAE;AACzB,UAAU,CAAC,IAAI,GAAG,CAAC;AACnB,UAAU,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,SAAS;AACT,OAAO,MAAM;AACb,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAClC,QAAQ,IAAI,SAAS,KAAK,QAAQ,EAAE,MAAM;AAC1C,QAAQ,IAAI,WAAW,EAAE;AACzB,UAAU,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACpC,SAAS;AACT,OAAO;AACP,MAAM,IAAI,SAAS,KAAK,QAAQ,EAAE,MAAM;AACxC,MAAM,IAAI,WAAW,KAAK,CAAC,oBAAoB,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,EAAE;AAC3E,QAAQ,CAAC,IAAI,GAAG,CAAC;AACjB,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;AAC1C,OAAO;AACP,GAAG;AACH;AACA,EAAE,IAAI,aAAa,EAAE;AACrB,IAAI,IAAI,CAAC,CAAC,aAAa,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE;AAC5D,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;AACxB,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,MAAM,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC3C,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,MAAM,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC3C,KAAK,MAAM;AACX,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,MAAM,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC1C,MAAM,CAAC,IAAI,GAAG,CAAC;AACf,MAAM,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC1C,KAAK;AACL,GAAG;AACH;AACA,EAAE,IAAI,YAAY,EAAE;AACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;AACrC,GAAG;AACH,EAAE,OAAO,CAAC,CAAC;AACX,CAAC;AACD;AACA;AACA,MAAM,iBAAiB,GAAG;AAC1B,IAAI,KAAK,EAAE,CAAC;AACZ,IAAI,GAAG,EAAE,CAAC;AACV,IAAI,IAAI,EAAE,CAAC;AACX,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,WAAW,EAAE,CAAC;AAClB,GAAG;AACH,EAAE,qBAAqB,GAAG;AAC1B,IAAI,UAAU,EAAE,CAAC;AACjB,IAAI,OAAO,EAAE,CAAC;AACd,IAAI,IAAI,EAAE,CAAC;AACX,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,WAAW,EAAE,CAAC;AAClB,GAAG;AACH,EAAE,wBAAwB,GAAG;AAC7B,IAAI,OAAO,EAAE,CAAC;AACd,IAAI,IAAI,EAAE,CAAC;AACX,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,MAAM,EAAE,CAAC;AACb,IAAI,WAAW,EAAE,CAAC;AAClB,GAAG,CAAC;AACJ;AACA;AACA,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC;AACxF,EAAE,gBAAgB,GAAG;AACrB,IAAI,UAAU;AACd,IAAI,YAAY;AAChB,IAAI,SAAS;AACb,IAAI,MAAM;AACV,IAAI,QAAQ;AACZ,IAAI,QAAQ;AACZ,IAAI,aAAa;AACjB,GAAG;AACH,EAAE,mBAAmB,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;AACvF;AACA;AACA,SAAS,aAAa,CAAC,IAAI,EAAE;AAC7B,EAAE,MAAM,UAAU,GAAG;AACrB,IAAI,IAAI,EAAE,MAAM;AAChB,IAAI,KAAK,EAAE,MAAM;AACjB,IAAI,KAAK,EAAE,OAAO;AAClB,IAAI,MAAM,EAAE,OAAO;AACnB,IAAI,GAAG,EAAE,KAAK;AACd,IAAI,IAAI,EAAE,KAAK;AACf,IAAI,IAAI,EAAE,MAAM;AAChB,IAAI,KAAK,EAAE,MAAM;AACjB,IAAI,MAAM,EAAE,QAAQ;AACpB,IAAI,OAAO,EAAE,QAAQ;AACrB,IAAI,OAAO,EAAE,SAAS;AACtB,IAAI,QAAQ,EAAE,SAAS;AACvB,IAAI,MAAM,EAAE,QAAQ;AACpB,IAAI,OAAO,EAAE,QAAQ;AACrB,IAAI,WAAW,EAAE,aAAa;AAC9B,IAAI,YAAY,EAAE,aAAa;AAC/B,IAAI,OAAO,EAAE,SAAS;AACtB,IAAI,QAAQ,EAAE,SAAS;AACvB,IAAI,UAAU,EAAE,YAAY;AAC5B,IAAI,WAAW,EAAE,YAAY;AAC7B,IAAI,WAAW,EAAE,YAAY;AAC7B,IAAI,QAAQ,EAAE,UAAU;AACxB,IAAI,SAAS,EAAE,UAAU;AACzB,IAAI,OAAO,EAAE,SAAS;AACtB,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;AACxB;AACA,EAAE,IAAI,CAAC,UAAU,EAAE,MAAM,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC;AACpD;AACA,EAAE,OAAO,UAAU,CAAC;AACpB,CAAC;AACD;AACA,SAAS,2BAA2B,CAAC,IAAI,EAAE;AAC3C,EAAE,QAAQ,IAAI,CAAC,WAAW,EAAE;AAC5B,IAAI,KAAK,cAAc,CAAC;AACxB,IAAI,KAAK,eAAe;AACxB,MAAM,OAAO,cAAc,CAAC;AAC5B,IAAI,KAAK,iBAAiB,CAAC;AAC3B,IAAI,KAAK,kBAAkB;AAC3B,MAAM,OAAO,iBAAiB,CAAC;AAC/B,IAAI,KAAK,eAAe,CAAC;AACzB,IAAI,KAAK,gBAAgB;AACzB,MAAM,OAAO,eAAe,CAAC;AAC7B,IAAI;AACJ,MAAM,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC;AACjC,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,kBAAkB,CAAC,IAAI,EAAE;AAClC,EAAE,IAAI,YAAY,KAAK,SAAS,EAAE;AAClC,IAAI,YAAY,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;AAClC,GAAG;AACH;AACA;AACA;AACA,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE;AAC5B,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;AACrC,GAAG;AACH,EAAE,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;AAC7B,EAAE,IAAI,WAAW,GAAG,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;AACvD,EAAE,IAAI,WAAW,KAAK,SAAS,EAAE;AACjC,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;AAC5C,IAAI,oBAAoB,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AACpD,GAAG;AACH,EAAE,OAAO,WAAW,CAAC;AACrB,CAAC;AACD;AACA;AACA;AACA;AACA,SAAS,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE;AAC5B,EAAE,MAAM,IAAI,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC9D,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACrB,IAAI,OAAO,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;AACnD,GAAG;AACH;AACA,EAAE,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;AACtC;AACA,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AACZ;AACA;AACA,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;AAC9B,IAAI,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE;AAClC,MAAM,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;AAC/B,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;AACtC,OAAO;AACP,KAAK;AACL;AACA,IAAI,MAAM,OAAO,GAAG,uBAAuB,CAAC,GAAG,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;AAC5E,IAAI,IAAI,OAAO,EAAE;AACjB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AACvC,KAAK;AACL;AACA,IAAI,MAAM,YAAY,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAClD,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;AAC/C,GAAG,MAAM;AACT,IAAI,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;AACxB,GAAG;AACH;AACA,EAAE,OAAO,IAAI,QAAQ,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC5C,CAAC;AACD;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE;AACxC,EAAE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK;AAC3D,IAAI,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,OAAO,GAAG,IAAI,CAAC,QAAQ;AACnE,IAAI,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK;AAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,GAAG,OAAO,GAAG,QAAQ,CAAC,CAAC;AAC3F,MAAM,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;AAC/D,MAAM,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AACvC,KAAK;AACL,IAAI,MAAM,GAAG,CAAC,IAAI,KAAK;AACvB,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE;AAC1B,QAAQ,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;AACvC,UAAU,OAAO,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC7E,SAAS,MAAM,OAAO,CAAC,CAAC;AACxB,OAAO,MAAM;AACb,QAAQ,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC/C,OAAO;AACP,KAAK,CAAC;AACN;AACA,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE;AACjB,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AAChD,GAAG;AACH;AACA,EAAE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AACjC,IAAI,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;AAC/B,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;AAC9B,MAAM,OAAO,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACjC,KAAK;AACL,GAAG;AACH,EAAE,OAAO,MAAM,CAAC,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC;AACD;AACA,SAAS,QAAQ,CAAC,OAAO,EAAE;AAC3B,EAAE,IAAI,IAAI,GAAG,EAAE;AACf,IAAI,IAAI,CAAC;AACT,EAAE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE;AAC7E,IAAI,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACvC,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC5D,GAAG,MAAM;AACT,IAAI,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC/B,GAAG;AACH,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACtB,CAAC;AACD;AACA;AACA;AACA;AACA,IAAI,YAAY,CAAC;AACjB;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAE,CAAC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAM,QAAQ,CAAC;AAC9B;AACA;AACA;AACA,EAAE,WAAW,CAAC,MAAM,EAAE;AACtB,IAAI,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,QAAQ,CAAC,WAAW,CAAC;AACrD;AACA,IAAI,IAAI,OAAO;AACf,MAAM,MAAM,CAAC,OAAO;AACpB,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC;AACrE,OAAO,CAAC,IAAI,CAAC,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;AACrD;AACA;AACA;AACA,IAAI,IAAI,CAAC,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;AAClE;AACA,IAAI,IAAI,CAAC,GAAG,IAAI;AAChB,MAAM,CAAC,GAAG,IAAI,CAAC;AACf,IAAI,IAAI,CAAC,OAAO,EAAE;AAClB,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAChG;AACA,MAAM,IAAI,SAAS,EAAE;AACrB,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC9C,OAAO,MAAM;AACb;AACA;AACA,QAAQ,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACvF,QAAQ,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACjC,QAAQ,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC;AAC7E,QAAQ,CAAC,GAAG,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC;AAC/B,QAAQ,CAAC,GAAG,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAChC,OAAO;AACP,KAAK;AACL;AACA;AACA;AACA;AACA,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;AACtB;AACA;AACA;AACA,IAAI,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;AAC7C;AACA;AACA;AACA,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;AAC3B;AACA;AACA;AACA,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;AACzB;AACA;AACA;AACA,IAAI,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;AAC9B;AACA;AACA;AACA,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACf;AACA;AACA;AACA,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACf;AACA;AACA;AACA,IAAI,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG,GAAG;AACf,IAAI,OAAO,IAAI,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC5B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,KAAK,GAAG;AACjB,IAAI,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC;AAC5C,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC;AACnE,IAAI,OAAO,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,IAAI,CAAC,CAAC;AAClF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG,GAAG;AACf,IAAI,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC;AAC5C,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC;AACnE;AACA,IAAI,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC,WAAW,CAAC;AAC5C,IAAI,OAAO,OAAO,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,IAAI,CAAC,CAAC;AAClF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,OAAO,GAAG,EAAE,EAAE;AACxC,IAAI,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,GAAG,CAAC;AACnD,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;AAC1B,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;AAC/C,KAAK;AACL;AACA,IAAI,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;AACxE,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;AAC5B,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;AAC1D,KAAK;AACL;AACA,IAAI,OAAO,IAAI,QAAQ,CAAC;AACxB,MAAM,EAAE,EAAE,EAAE;AACZ,MAAM,IAAI,EAAE,SAAS;AACrB,MAAM,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC;AACrC,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,YAAY,EAAE,OAAO,GAAG,EAAE,EAAE;AAChD,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE;AACjC,MAAM,MAAM,IAAI,oBAAoB;AACpC,QAAQ,CAAC,sDAAsD,EAAE,OAAO,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;AACjH,OAAO,CAAC;AACR,KAAK,MAAM,IAAI,YAAY,GAAG,CAAC,QAAQ,IAAI,YAAY,GAAG,QAAQ,EAAE;AACpE;AACA,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC;AACxD,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,QAAQ,CAAC;AAC1B,QAAQ,EAAE,EAAE,YAAY;AACxB,QAAQ,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC;AAC/D,QAAQ,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC;AACvC,OAAO,CAAC,CAAC;AACT,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,WAAW,CAAC,OAAO,EAAE,OAAO,GAAG,EAAE,EAAE;AAC5C,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE;AAC5B,MAAM,MAAM,IAAI,oBAAoB,CAAC,wCAAwC,CAAC,CAAC;AAC/E,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,QAAQ,CAAC;AAC1B,QAAQ,EAAE,EAAE,OAAO,GAAG,IAAI;AAC1B,QAAQ,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC;AAC/D,QAAQ,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC;AACvC,OAAO,CAAC,CAAC;AACT,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AACpC,IAAI,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC;AACpB,IAAI,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;AACrE,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE;AAC5B,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC;AAC1D,KAAK;AACL;AACA,IAAI,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;AACxC,IAAI,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,EAAE,2BAA2B,CAAC,CAAC;AACzE,IAAI,MAAM,EAAE,kBAAkB,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;AACrF;AACA,IAAI,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,EAAE;AAChC,MAAM,YAAY,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC;AACtD,UAAU,IAAI,CAAC,cAAc;AAC7B,UAAU,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;AACjC,MAAM,eAAe,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC;AACxD,MAAM,kBAAkB,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC;AACxD,MAAM,gBAAgB,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC;AACvF,MAAM,cAAc,GAAG,kBAAkB,IAAI,gBAAgB;AAC7D,MAAM,eAAe,GAAG,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,UAAU,CAAC;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,IAAI,CAAC,cAAc,IAAI,eAAe,KAAK,eAAe,EAAE;AAChE,MAAM,MAAM,IAAI,6BAA6B;AAC7C,QAAQ,qEAAqE;AAC7E,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,IAAI,gBAAgB,IAAI,eAAe,EAAE;AAC7C,MAAM,MAAM,IAAI,6BAA6B,CAAC,wCAAwC,CAAC,CAAC;AACxF,KAAK;AACL;AACA,IAAI,MAAM,WAAW,GAAG,eAAe,KAAK,UAAU,CAAC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC;AACnF;AACA;AACA,IAAI,IAAI,KAAK;AACb,MAAM,aAAa;AACnB,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;AAC5C,IAAI,IAAI,WAAW,EAAE;AACrB,MAAM,KAAK,GAAG,gBAAgB,CAAC;AAC/B,MAAM,aAAa,GAAG,qBAAqB,CAAC;AAC5C,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,kBAAkB,EAAE,WAAW,CAAC,CAAC;AACxE,KAAK,MAAM,IAAI,eAAe,EAAE;AAChC,MAAM,KAAK,GAAG,mBAAmB,CAAC;AAClC,MAAM,aAAa,GAAG,wBAAwB,CAAC;AAC/C,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;AAC1C,KAAK,MAAM;AACX,MAAM,KAAK,GAAG,YAAY,CAAC;AAC3B,MAAM,aAAa,GAAG,iBAAiB,CAAC;AACxC,KAAK;AACL;AACA;AACA,IAAI,IAAI,UAAU,GAAG,KAAK,CAAC;AAC3B,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;AAC3B,MAAM,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAC9B,MAAM,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE;AAC3B,QAAQ,UAAU,GAAG,IAAI,CAAC;AAC1B,OAAO,MAAM,IAAI,UAAU,EAAE;AAC7B,QAAQ,UAAU,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AACzC,OAAO,MAAM;AACb,QAAQ,UAAU,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAClC,OAAO;AACP,KAAK;AACL;AACA;AACA,IAAI,MAAM,kBAAkB,GAAG,WAAW;AAC1C,UAAU,kBAAkB,CAAC,UAAU,EAAE,kBAAkB,EAAE,WAAW,CAAC;AACzE,UAAU,eAAe;AACzB,UAAU,qBAAqB,CAAC,UAAU,CAAC;AAC3C,UAAU,uBAAuB,CAAC,UAAU,CAAC;AAC7C,MAAM,OAAO,GAAG,kBAAkB,IAAI,kBAAkB,CAAC,UAAU,CAAC,CAAC;AACrE;AACA,IAAI,IAAI,OAAO,EAAE;AACjB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AACvC,KAAK;AACL;AACA;AACA,IAAI,MAAM,SAAS,GAAG,WAAW;AACjC,UAAU,eAAe,CAAC,UAAU,EAAE,kBAAkB,EAAE,WAAW,CAAC;AACtE,UAAU,eAAe;AACzB,UAAU,kBAAkB,CAAC,UAAU,CAAC;AACxC,UAAU,UAAU;AACpB,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC;AAC1E,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC;AAC1B,QAAQ,EAAE,EAAE,OAAO;AACnB,QAAQ,IAAI,EAAE,SAAS;AACvB,QAAQ,CAAC,EAAE,WAAW;AACtB,QAAQ,GAAG;AACX,OAAO,CAAC,CAAC;AACT;AACA;AACA,IAAI,IAAI,UAAU,CAAC,OAAO,IAAI,cAAc,IAAI,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAAE;AAC9E,MAAM,OAAO,QAAQ,CAAC,OAAO;AAC7B,QAAQ,oBAAoB;AAC5B,QAAQ,CAAC,oCAAoC,EAAE,UAAU,CAAC,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;AACjG,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC5C,KAAK;AACL;AACA,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE;AAClC,IAAI,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;AAClD,IAAI,OAAO,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;AACzE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE;AACtC,IAAI,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;AACtD,IAAI,OAAO,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;AACzE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE;AACnC,IAAI,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;AACnD,IAAI,OAAO,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AACrE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AAC1C,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE;AAC/C,MAAM,MAAM,IAAI,oBAAoB,CAAC,kDAAkD,CAAC,CAAC;AACzF,KAAK;AACL;AACA,IAAI,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,GAAG,IAAI;AAC1D,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;AACpC,QAAQ,MAAM;AACd,QAAQ,eAAe;AACvB,QAAQ,WAAW,EAAE,IAAI;AACzB,OAAO,CAAC;AACR,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,OAAO,CAAC,GAAG,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC5F,IAAI,IAAI,OAAO,EAAE;AACjB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AACvC,KAAK,MAAM;AACX,MAAM,OAAO,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;AAChG,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AAC1C,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AAChD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE;AAClC,IAAI,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC9C,IAAI,OAAO,mBAAmB,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AACpE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,OAAO,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI,EAAE;AAC7C,IAAI,IAAI,CAAC,MAAM,EAAE;AACjB,MAAM,MAAM,IAAI,oBAAoB,CAAC,kDAAkD,CAAC,CAAC;AACzF,KAAK;AACL;AACA,IAAI,MAAM,OAAO,GAAG,MAAM,YAAY,OAAO,GAAG,MAAM,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAC1F;AACA,IAAI,IAAI,QAAQ,CAAC,cAAc,EAAE;AACjC,MAAM,MAAM,IAAI,oBAAoB,CAAC,OAAO,CAAC,CAAC;AAC9C,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;AACvC,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,UAAU,CAAC,CAAC,EAAE;AACvB,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,kBAAkB,CAAC,UAAU,EAAE,UAAU,GAAG,EAAE,EAAE;AACzD,IAAI,MAAM,SAAS,GAAG,kBAAkB,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;AACpF,IAAI,OAAO,CAAC,SAAS,GAAG,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjF,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,YAAY,CAAC,GAAG,EAAE,UAAU,GAAG,EAAE,EAAE;AAC5C,IAAI,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;AAClG,IAAI,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/C,GAAG;AACH;AACA,EAAE,OAAO,UAAU,GAAG;AACtB,IAAI,YAAY,GAAG,SAAS,CAAC;AAC7B,IAAI,oBAAoB,CAAC,KAAK,EAAE,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,IAAI,EAAE;AACZ,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,kBAAkB,GAAG;AAC3B,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,eAAe,GAAG;AACxB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,IAAI,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,cAAc,GAAG;AACvB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,KAAK,CAAC;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,QAAQ,GAAG;AACjB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AAChD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;AAC5C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;AAC5D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,KAAK,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,GAAG,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;AAC3C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,IAAI,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC;AAC5C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,WAAW,GAAG,GAAG,CAAC;AACnD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,QAAQ,GAAG;AACjB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;AACtE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,UAAU,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;AACxE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC;AACrE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,SAAS,GAAG;AAClB,IAAI,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC5E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,YAAY,GAAG;AACrB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC;AAC1E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,eAAe,GAAG;AACxB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC;AAC7E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC;AAC3E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC;AACnE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,UAAU,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;AAC5F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,SAAS,GAAG;AAClB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;AAC3F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,YAAY,GAAG;AACrB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;AAChG,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC;AAC/F,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,MAAM,GAAG;AACf,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,eAAe,GAAG;AACxB,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AACtB,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE;AAC3C,QAAQ,MAAM,EAAE,OAAO;AACvB,QAAQ,MAAM,EAAE,IAAI,CAAC,MAAM;AAC3B,OAAO,CAAC,CAAC;AACT,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,cAAc,GAAG;AACvB,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AACtB,MAAM,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE;AAC3C,QAAQ,MAAM,EAAE,MAAM;AACtB,QAAQ,MAAM,EAAE,IAAI,CAAC,MAAM;AAC3B,OAAO,CAAC,CAAC;AACT,KAAK,MAAM;AACX,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,aAAa,GAAG;AACtB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;AACvD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,OAAO,GAAG;AAChB,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE;AAC5B,MAAM,OAAO,KAAK,CAAC;AACnB,KAAK,MAAM;AACX,MAAM;AACN,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM;AAC3D,QAAQ,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM;AACnD,QAAQ;AACR,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,kBAAkB,GAAG;AACvB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,aAAa,EAAE;AAC7C,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;AACpB,KAAK;AACL,IAAI,MAAM,KAAK,GAAG,QAAQ,CAAC;AAC3B,IAAI,MAAM,QAAQ,GAAG,KAAK,CAAC;AAC3B,IAAI,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACzC,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;AACvD,IAAI,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;AACrD;AACA,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC/D,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,MAAM,GAAG,QAAQ,CAAC,CAAC;AAC7D,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE;AACnB,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;AACpB,KAAK;AACL,IAAI,MAAM,GAAG,GAAG,OAAO,GAAG,EAAE,GAAG,QAAQ,CAAC;AACxC,IAAI,MAAM,GAAG,GAAG,OAAO,GAAG,EAAE,GAAG,QAAQ,CAAC;AACxC,IAAI,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAChC,IAAI,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAChC,IAAI;AACJ,MAAM,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;AACzB,MAAM,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;AAC7B,MAAM,EAAE,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM;AAC7B,MAAM,EAAE,CAAC,WAAW,KAAK,EAAE,CAAC,WAAW;AACvC,MAAM;AACN,MAAM,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;AAClE,KAAK;AACL,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;AAClB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,YAAY,GAAG;AACrB,IAAI,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,WAAW,GAAG;AACpB,IAAI,OAAO,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,UAAU,GAAG;AACnB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AACtD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,eAAe,GAAG;AACxB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;AAC/D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,oBAAoB,GAAG;AAC7B,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,eAAe;AACvB,UAAU,IAAI,CAAC,aAAa;AAC5B,UAAU,IAAI,CAAC,GAAG,CAAC,qBAAqB,EAAE;AAC1C,UAAU,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE;AACnC,SAAS;AACT,QAAQ,GAAG,CAAC;AACZ,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,qBAAqB,CAAC,IAAI,GAAG,EAAE,EAAE;AACnC,IAAI,MAAM,EAAE,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,GAAG,SAAS,CAAC,MAAM;AAClE,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;AAC1B,MAAM,IAAI;AACV,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;AAC5B,IAAI,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,QAAQ,EAAE,CAAC;AACjE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE;AAC/B,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;AAChE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,aAAa,GAAG,KAAK,EAAE,gBAAgB,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE;AAC1E,IAAI,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;AACrD,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;AAChC,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AAC9B,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;AACrD,KAAK,MAAM;AACX,MAAM,IAAI,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC;AAC1B,MAAM,IAAI,aAAa,IAAI,gBAAgB,EAAE;AAC7C,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjD,QAAQ,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;AACtC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;AACpD,OAAO;AACP,MAAM,OAAO,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAC9C,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,GAAG,EAAE,EAAE;AAChE,IAAI,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC,CAAC;AAC5E,IAAI,OAAO,KAAK,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC,MAAM,EAAE;AACpB,IAAI,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,GAAG,CAAC,MAAM,EAAE;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,EAAE,2BAA2B,CAAC,CAAC;AAC5E,IAAI,MAAM,EAAE,kBAAkB,EAAE,WAAW,EAAE,GAAG,mBAAmB,CAAC,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1F;AACA,IAAI,MAAM,gBAAgB;AAC1B,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC;AACzC,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC;AAC3C,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC;AACxC,MAAM,eAAe,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC;AACxD,MAAM,kBAAkB,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC;AACxD,MAAM,gBAAgB,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC;AACvF,MAAM,cAAc,GAAG,kBAAkB,IAAI,gBAAgB;AAC7D,MAAM,eAAe,GAAG,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,UAAU,CAAC;AACrE;AACA,IAAI,IAAI,CAAC,cAAc,IAAI,eAAe,KAAK,eAAe,EAAE;AAChE,MAAM,MAAM,IAAI,6BAA6B;AAC7C,QAAQ,qEAAqE;AAC7E,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,IAAI,gBAAgB,IAAI,eAAe,EAAE;AAC7C,MAAM,MAAM,IAAI,6BAA6B,CAAC,wCAAwC,CAAC,CAAC;AACxF,KAAK;AACL;AACA,IAAI,IAAI,KAAK,CAAC;AACd,IAAI,IAAI,gBAAgB,EAAE;AAC1B,MAAM,KAAK,GAAG,eAAe;AAC7B,QAAQ,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,kBAAkB,EAAE,WAAW,CAAC,EAAE,GAAG,UAAU,EAAE;AACtF,QAAQ,kBAAkB;AAC1B,QAAQ,WAAW;AACnB,OAAO,CAAC;AACR,KAAK,MAAM,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE;AACjD,MAAM,KAAK,GAAG,kBAAkB,CAAC,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,CAAC,CAAC;AACnF,KAAK,MAAM;AACX,MAAM,KAAK,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,GAAG,UAAU,EAAE,CAAC;AACpD;AACA;AACA;AACA,MAAM,IAAI,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;AACvC,QAAQ,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAC9E,OAAO;AACP,KAAK;AACL;AACA,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACtD,IAAI,OAAO,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;AAClC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,CAAC,QAAQ,EAAE;AACjB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;AACpD,IAAI,OAAO,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,QAAQ,EAAE;AAClB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,GAAG,GAAG,QAAQ,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC;AAC7D,IAAI,OAAO,KAAK,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,cAAc,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE;AACjD,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,MAAM,CAAC,GAAG,EAAE;AAChB,MAAM,cAAc,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;AACpD,IAAI,QAAQ,cAAc;AAC1B,MAAM,KAAK,OAAO;AAClB,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;AACpB;AACA,MAAM,KAAK,UAAU,CAAC;AACtB,MAAM,KAAK,QAAQ;AACnB,QAAQ,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;AAClB;AACA,MAAM,KAAK,OAAO,CAAC;AACnB,MAAM,KAAK,MAAM;AACjB,QAAQ,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;AACnB;AACA,MAAM,KAAK,OAAO;AAClB,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB;AACA,MAAM,KAAK,SAAS;AACpB,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;AACrB;AACA,MAAM,KAAK,SAAS;AACpB,QAAQ,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;AAC1B,QAAQ,MAAM;AAGd;AACA,KAAK;AACL;AACA,IAAI,IAAI,cAAc,KAAK,OAAO,EAAE;AACpC,MAAM,IAAI,cAAc,EAAE;AAC1B,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC;AACtD,QAAQ,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;AACjC,QAAQ,IAAI,OAAO,GAAG,WAAW,EAAE;AACnC,UAAU,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;AAC7C,SAAS;AACT,QAAQ,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC;AAChC,OAAO,MAAM;AACb,QAAQ,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;AACtB,OAAO;AACP,KAAK;AACL;AACA,IAAI,IAAI,cAAc,KAAK,UAAU,EAAE;AACvC,MAAM,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC1C,MAAM,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAChC,KAAK;AACL;AACA,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACvB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE;AACpB,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;AAChC,WAAW,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;AAC9B,WAAW,KAAK,CAAC,CAAC,CAAC;AACnB,QAAQ,IAAI,CAAC;AACb,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,EAAE;AAC3B,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,wBAAwB,CAAC,IAAI,EAAE,GAAG,CAAC;AAC1F,QAAQ,OAAO,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,cAAc,CAAC,UAAU,GAAG3B,UAAkB,EAAE,IAAI,GAAG,EAAE,EAAE;AAC7D,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC;AAC/E,QAAQ,OAAO,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,aAAa,CAAC,IAAI,GAAG,EAAE,EAAE;AAC3B,IAAI,OAAO,IAAI,CAAC,OAAO;AACvB,QAAQ,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC;AAC9E,QAAQ,EAAE,CAAC;AACX,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC;AACR,IAAI,MAAM,GAAG,UAAU;AACvB,IAAI,eAAe,GAAG,KAAK;AAC3B,IAAI,oBAAoB,GAAG,KAAK;AAChC,IAAI,aAAa,GAAG,IAAI;AACxB,IAAI,YAAY,GAAG,KAAK;AACxB,IAAI,SAAS,GAAG,cAAc;AAC9B,GAAG,GAAG,EAAE,EAAE;AACV,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL;AACA,IAAI,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;AACzC,IAAI,MAAM,GAAG,GAAG,MAAM,KAAK,UAAU,CAAC;AACtC;AACA,IAAI,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;AAC5C,IAAI,IAAI,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC;AACvD,IAAI,CAAC,IAAI,SAAS;AAClB,MAAM,IAAI;AACV,MAAM,GAAG;AACT,MAAM,eAAe;AACrB,MAAM,oBAAoB;AAC1B,MAAM,aAAa;AACnB,MAAM,YAAY;AAClB,MAAM,SAAS;AACf,KAAK,CAAC;AACN,IAAI,OAAO,CAAC,CAAC;AACb,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,UAAU,EAAE,SAAS,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE;AAC7D,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL,IAAI,OAAO,SAAS,CAAC,IAAI,EAAE,MAAM,KAAK,UAAU,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;AAC5E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,aAAa,GAAG;AAClB,IAAI,OAAO,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC;AACZ,IAAI,oBAAoB,GAAG,KAAK;AAChC,IAAI,eAAe,GAAG,KAAK;AAC3B,IAAI,aAAa,GAAG,IAAI;AACxB,IAAI,aAAa,GAAG,KAAK;AACzB,IAAI,YAAY,GAAG,KAAK;AACxB,IAAI,MAAM,GAAG,UAAU;AACvB,IAAI,SAAS,GAAG,cAAc;AAC9B,GAAG,GAAG,EAAE,EAAE;AACV,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL;AACA,IAAI,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;AACzC,IAAI,IAAI,CAAC,GAAG,aAAa,IAAI,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;AAC7E,IAAI;AACJ,MAAM,CAAC;AACP,MAAM,SAAS;AACf,QAAQ,IAAI;AACZ,QAAQ,MAAM,KAAK,UAAU;AAC7B,QAAQ,eAAe;AACvB,QAAQ,oBAAoB;AAC5B,QAAQ,aAAa;AACrB,QAAQ,YAAY;AACpB,QAAQ,SAAS;AACjB,OAAO;AACP,MAAM;AACN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,GAAG;AACd,IAAI,OAAO,YAAY,CAAC,IAAI,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAC;AACtE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,iCAAiC,CAAC,CAAC;AACzE,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,GAAG;AACd,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL,IAAI,OAAO,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,CAAC,EAAE,aAAa,GAAG,IAAI,EAAE,WAAW,GAAG,KAAK,EAAE,kBAAkB,GAAG,IAAI,EAAE,GAAG,EAAE,EAAE;AAC3F,IAAI,IAAI,GAAG,GAAG,cAAc,CAAC;AAC7B;AACA,IAAI,IAAI,WAAW,IAAI,aAAa,EAAE;AACtC,MAAM,IAAI,kBAAkB,EAAE;AAC9B,QAAQ,GAAG,IAAI,GAAG,CAAC;AACnB,OAAO;AACP,MAAM,IAAI,WAAW,EAAE;AACvB,QAAQ,GAAG,IAAI,GAAG,CAAC;AACnB,OAAO,MAAM,IAAI,aAAa,EAAE;AAChC,QAAQ,GAAG,IAAI,IAAI,CAAC;AACpB,OAAO;AACP,KAAK;AACL;AACA,IAAI,OAAO,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AACzC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE,EAAE;AACnB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AACvB,MAAM,OAAO,IAAI,CAAC;AAClB,KAAK;AACL;AACA,IAAI,OAAO,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACzD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC,GAAG;AAC/C,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE;AACtB,MAAM,OAAO,CAAC,eAAe,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACjG,KAAK,MAAM;AACX,MAAM,OAAO,CAAC,4BAA4B,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;AACnE,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG;AACZ,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC3B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,SAAS,GAAG;AACd,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,GAAG,CAAC;AAC/C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,aAAa,GAAG;AAClB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;AAC3D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;AACxB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,GAAG;AACX,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;AAC3B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,CAAC,IAAI,GAAG,EAAE,EAAE;AACtB,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC;AACjC;AACA,IAAI,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;AAC/B;AACA,IAAI,IAAI,IAAI,CAAC,aAAa,EAAE;AAC5B,MAAM,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC;AAChD,MAAM,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC;AACtD,MAAM,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;AACpC,KAAK;AACL,IAAI,OAAO,IAAI,CAAC;AAChB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,QAAQ,GAAG;AACb,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;AAClD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,CAAC,aAAa,EAAE,IAAI,GAAG,cAAc,EAAE,IAAI,GAAG,EAAE,EAAE;AACxD,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE;AACjD,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC;AACxE,KAAK;AACL;AACA,IAAI,MAAM,OAAO,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,IAAI,EAAE,CAAC;AAC5F;AACA,IAAI,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,aAAa,CAAC;AAC9D,MAAM,YAAY,GAAG,aAAa,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE;AAC7D,MAAM,OAAO,GAAG,YAAY,GAAG,IAAI,GAAG,aAAa;AACnD,MAAM,KAAK,GAAG,YAAY,GAAG,aAAa,GAAG,IAAI;AACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;AACpD;AACA,IAAI,OAAO,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,MAAM,CAAC;AACnD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,IAAI,GAAG,cAAc,EAAE,IAAI,GAAG,EAAE,EAAE;AAC5C,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACjD,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,KAAK,CAAC,aAAa,EAAE;AACvB,IAAI,OAAO,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC;AAC7E,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,CAAC,aAAa,EAAE,IAAI,EAAE,IAAI,EAAE;AACrC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,KAAK,CAAC;AACpC;AACA,IAAI,MAAM,OAAO,GAAG,aAAa,CAAC,OAAO,EAAE,CAAC;AAC5C,IAAI,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;AACrF,IAAI;AACJ,MAAM,cAAc,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,OAAO,IAAI,OAAO,IAAI,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC;AAClG,MAAM;AACN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,MAAM,CAAC,KAAK,EAAE;AAChB,IAAI;AACJ,MAAM,IAAI,CAAC,OAAO;AAClB,MAAM,KAAK,CAAC,OAAO;AACnB,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,KAAK,CAAC,OAAO,EAAE;AACxC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC;AAClC,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;AAChC,MAAM;AACN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,UAAU,CAAC,OAAO,GAAG,EAAE,EAAE;AAC3B,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC,IAAI,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;AAC7E,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,CAAC,CAAC;AACzF,IAAI,IAAI,KAAK,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;AAC3E,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;AAC5B,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AACrC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC;AAC3B,MAAM,IAAI,GAAG,SAAS,CAAC;AACvB,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;AAClD,MAAM,GAAG,OAAO;AAChB,MAAM,OAAO,EAAE,QAAQ;AACvB,MAAM,KAAK;AACX,MAAM,IAAI;AACV,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,kBAAkB,CAAC,OAAO,GAAG,EAAE,EAAE;AACnC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,IAAI,CAAC;AACnC;AACA,IAAI,OAAO,YAAY,CAAC,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE;AAC5F,MAAM,GAAG,OAAO;AAChB,MAAM,OAAO,EAAE,MAAM;AACrB,MAAM,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC;AACxC,MAAM,SAAS,EAAE,IAAI;AACrB,KAAK,CAAC,CAAC;AACP,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG,CAAC,GAAG,SAAS,EAAE;AAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;AAC/C,MAAM,MAAM,IAAI,oBAAoB,CAAC,yCAAyC,CAAC,CAAC;AAChF,KAAK;AACL,IAAI,OAAO,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;AAC3D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,GAAG,CAAC,GAAG,SAAS,EAAE;AAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;AAC/C,MAAM,MAAM,IAAI,oBAAoB,CAAC,yCAAyC,CAAC,CAAC;AAChF,KAAK;AACL,IAAI,OAAO,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;AAC3D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,GAAG,EAAE,EAAE;AACpD,IAAI,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,GAAG,OAAO;AAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;AACpC,QAAQ,MAAM;AACd,QAAQ,eAAe;AACvB,QAAQ,WAAW,EAAE,IAAI;AACzB,OAAO,CAAC,CAAC;AACT,IAAI,OAAO,iBAAiB,CAAC,WAAW,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AACrD,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,GAAG,EAAE,EAAE;AACpD,IAAI,OAAO,QAAQ,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;AAC1D,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,iBAAiB,CAAC,GAAG,EAAE,OAAO,GAAG,EAAE,EAAE;AAC9C,IAAI,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,GAAG,OAAO;AAC7D,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;AACpC,QAAQ,MAAM;AACd,QAAQ,eAAe;AACvB,QAAQ,WAAW,EAAE,IAAI;AACzB,OAAO,CAAC,CAAC;AACT,IAAI,OAAO,IAAI,WAAW,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO,gBAAgB,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE;AACzD,IAAI,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,YAAY,CAAC,EAAE;AACxD,MAAM,MAAM,IAAI,oBAAoB;AACpC,QAAQ,+DAA+D;AACvE,OAAO,CAAC;AACR,KAAK;AACL,IAAI,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,eAAe,GAAG,IAAI,EAAE,GAAG,IAAI;AAC1D,MAAM,WAAW,GAAG,MAAM,CAAC,QAAQ,CAAC;AACpC,QAAQ,MAAM;AACd,QAAQ,eAAe;AACvB,QAAQ,WAAW,EAAE,IAAI;AACzB,OAAO,CAAC,CAAC;AACT;AACA,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE;AAClD,MAAM,MAAM,IAAI,oBAAoB;AACpC,QAAQ,CAAC,yCAAyC,EAAE,WAAW,CAAC,EAAE,CAAC;AACnE,UAAU,CAAC,sCAAsC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACxE,OAAO,CAAC;AACR,KAAK;AACL;AACA,IAAI,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,EAAE,aAAa,EAAE,GAAG,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;AACjG;AACA,IAAI,IAAI,aAAa,EAAE;AACvB,MAAM,OAAO,QAAQ,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;AAC7C,KAAK,MAAM;AACX,MAAM,OAAO,mBAAmB;AAChC,QAAQ,MAAM;AACd,QAAQ,IAAI;AACZ,QAAQ,IAAI;AACZ,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;AACvC,QAAQ,IAAI;AACZ,QAAQ,cAAc;AACtB,OAAO,CAAC;AACR,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,UAAU,GAAG;AAC1B,IAAI,OAAOA,UAAkB,CAAC;AAC9B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,QAAQ,GAAG;AACxB,IAAI,OAAOC,QAAgB,CAAC;AAC5B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,qBAAqB,GAAG;AACrC,IAAI,OAAO6B,qBAA6B,CAAC;AACzC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,SAAS,GAAG;AACzB,IAAI,OAAO5B,SAAiB,CAAC;AAC7B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,SAAS,GAAG;AACzB,IAAI,OAAOC,SAAiB,CAAC;AAC7B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,WAAW,GAAG;AAC3B,IAAI,OAAOC,WAAmB,CAAC;AAC/B,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,iBAAiB,GAAG;AACjC,IAAI,OAAOC,iBAAyB,CAAC;AACrC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,sBAAsB,GAAG;AACtC,IAAI,OAAOC,sBAA8B,CAAC;AAC1C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,qBAAqB,GAAG;AACrC,IAAI,OAAOC,qBAA6B,CAAC;AACzC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,cAAc,GAAG;AAC9B,IAAI,OAAOC,cAAsB,CAAC;AAClC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,oBAAoB,GAAG;AACpC,IAAI,OAAOC,oBAA4B,CAAC;AACxC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,yBAAyB,GAAG;AACzC,IAAI,OAAOC,yBAAiC,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,wBAAwB,GAAG;AACxC,IAAI,OAAOC,wBAAgC,CAAC;AAC5C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,cAAc,GAAG;AAC9B,IAAI,OAAOC,cAAsB,CAAC;AAClC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,2BAA2B,GAAG;AAC3C,IAAI,OAAOI,2BAAmC,CAAC;AAC/C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,YAAY,GAAG;AAC5B,IAAI,OAAOH,YAAoB,CAAC;AAChC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,yBAAyB,GAAG;AACzC,IAAI,OAAOI,yBAAiC,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,yBAAyB,GAAG;AACzC,IAAI,OAAOc,yBAAiC,CAAC;AAC7C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,aAAa,GAAG;AAC7B,IAAI,OAAOjB,aAAqB,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,0BAA0B,GAAG;AAC1C,IAAI,OAAOI,0BAAkC,CAAC;AAC9C,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,aAAa,GAAG;AAC7B,IAAI,OAAOH,aAAqB,CAAC;AACjC,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE,WAAW,0BAA0B,GAAG;AAC1C,IAAI,OAAOI,0BAAkC,CAAC;AAC9C,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACO,SAAS,gBAAgB,CAAC,WAAW,EAAE;AAC9C,EAAE,IAAI,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE;AACxC,IAAI,OAAO,WAAW,CAAC;AACvB,GAAG,MAAM,IAAI,WAAW,IAAI,WAAW,CAAC,OAAO,IAAI,QAAQ,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE;AACpF,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AAC5C,GAAG,MAAM,IAAI,WAAW,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE;AAC7D,IAAI,OAAO,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;AAC5C,GAAG,MAAM;AACT,IAAI,MAAM,IAAI,oBAAoB;AAClC,MAAM,CAAC,2BAA2B,EAAE,WAAW,CAAC,UAAU,EAAE,OAAO,WAAW,CAAC,CAAC;AAChF,KAAK,CAAC;AACN,GAAG;AACH;;AC/hFK,MAAC,OAAO,GAAG;;;;"}
\ No newline at end of file
diff --git a/node_modules/luxon/build/global/luxon.js b/node_modules/luxon/build/global/luxon.js
new file mode 100644
index 0000000..7d059e1
--- /dev/null
+++ b/node_modules/luxon/build/global/luxon.js
@@ -0,0 +1,8744 @@
+var luxon = (function (exports) {
+  'use strict';
+
+  function _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, _toPropertyKey(descriptor.key), descriptor);
+    }
+  }
+  function _createClass(Constructor, protoProps, staticProps) {
+    if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+    if (staticProps) _defineProperties(Constructor, staticProps);
+    Object.defineProperty(Constructor, "prototype", {
+      writable: false
+    });
+    return Constructor;
+  }
+  function _extends() {
+    _extends = Object.assign ? Object.assign.bind() : 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);
+  }
+  function _inheritsLoose(subClass, superClass) {
+    subClass.prototype = Object.create(superClass.prototype);
+    subClass.prototype.constructor = subClass;
+    _setPrototypeOf(subClass, superClass);
+  }
+  function _getPrototypeOf(o) {
+    _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {
+      return o.__proto__ || Object.getPrototypeOf(o);
+    };
+    return _getPrototypeOf(o);
+  }
+  function _setPrototypeOf(o, p) {
+    _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {
+      o.__proto__ = p;
+      return o;
+    };
+    return _setPrototypeOf(o, p);
+  }
+  function _isNativeReflectConstruct() {
+    if (typeof Reflect === "undefined" || !Reflect.construct) return false;
+    if (Reflect.construct.sham) return false;
+    if (typeof Proxy === "function") return true;
+    try {
+      Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {}));
+      return true;
+    } catch (e) {
+      return false;
+    }
+  }
+  function _construct(Parent, args, Class) {
+    if (_isNativeReflectConstruct()) {
+      _construct = Reflect.construct.bind();
+    } else {
+      _construct = function _construct(Parent, args, Class) {
+        var a = [null];
+        a.push.apply(a, args);
+        var Constructor = Function.bind.apply(Parent, a);
+        var instance = new Constructor();
+        if (Class) _setPrototypeOf(instance, Class.prototype);
+        return instance;
+      };
+    }
+    return _construct.apply(null, arguments);
+  }
+  function _isNativeFunction(fn) {
+    return Function.toString.call(fn).indexOf("[native code]") !== -1;
+  }
+  function _wrapNativeSuper(Class) {
+    var _cache = typeof Map === "function" ? new Map() : undefined;
+    _wrapNativeSuper = function _wrapNativeSuper(Class) {
+      if (Class === null || !_isNativeFunction(Class)) return Class;
+      if (typeof Class !== "function") {
+        throw new TypeError("Super expression must either be null or a function");
+      }
+      if (typeof _cache !== "undefined") {
+        if (_cache.has(Class)) return _cache.get(Class);
+        _cache.set(Class, Wrapper);
+      }
+      function Wrapper() {
+        return _construct(Class, arguments, _getPrototypeOf(this).constructor);
+      }
+      Wrapper.prototype = Object.create(Class.prototype, {
+        constructor: {
+          value: Wrapper,
+          enumerable: false,
+          writable: true,
+          configurable: true
+        }
+      });
+      return _setPrototypeOf(Wrapper, Class);
+    };
+    return _wrapNativeSuper(Class);
+  }
+  function _objectWithoutPropertiesLoose(source, excluded) {
+    if (source == null) return {};
+    var target = {};
+    var sourceKeys = Object.keys(source);
+    var key, i;
+    for (i = 0; i < sourceKeys.length; i++) {
+      key = sourceKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      target[key] = source[key];
+    }
+    return target;
+  }
+  function _unsupportedIterableToArray(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _arrayLikeToArray(o, minLen);
+    var n = Object.prototype.toString.call(o).slice(8, -1);
+    if (n === "Object" && o.constructor) n = o.constructor.name;
+    if (n === "Map" || n === "Set") return Array.from(o);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
+  }
+  function _arrayLikeToArray(arr, len) {
+    if (len == null || len > arr.length) len = arr.length;
+    for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
+    return arr2;
+  }
+  function _createForOfIteratorHelperLoose(o, allowArrayLike) {
+    var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+    if (it) return (it = it.call(o)).next.bind(it);
+    if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+      if (it) o = it;
+      var i = 0;
+      return function () {
+        if (i >= o.length) return {
+          done: true
+        };
+        return {
+          done: false,
+          value: o[i++]
+        };
+      };
+    }
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+  function _toPrimitive(input, hint) {
+    if (typeof input !== "object" || input === null) return input;
+    var prim = input[Symbol.toPrimitive];
+    if (prim !== undefined) {
+      var res = prim.call(input, hint || "default");
+      if (typeof res !== "object") return res;
+      throw new TypeError("@@toPrimitive must return a primitive value.");
+    }
+    return (hint === "string" ? String : Number)(input);
+  }
+  function _toPropertyKey(arg) {
+    var key = _toPrimitive(arg, "string");
+    return typeof key === "symbol" ? key : String(key);
+  }
+
+  // these aren't really private, but nor are they really useful to document
+  /**
+   * @private
+   */
+  var LuxonError = /*#__PURE__*/function (_Error) {
+    _inheritsLoose(LuxonError, _Error);
+    function LuxonError() {
+      return _Error.apply(this, arguments) || this;
+    }
+    return LuxonError;
+  }( /*#__PURE__*/_wrapNativeSuper(Error));
+  /**
+   * @private
+   */
+  var InvalidDateTimeError = /*#__PURE__*/function (_LuxonError) {
+    _inheritsLoose(InvalidDateTimeError, _LuxonError);
+    function InvalidDateTimeError(reason) {
+      return _LuxonError.call(this, "Invalid DateTime: " + reason.toMessage()) || this;
+    }
+    return InvalidDateTimeError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidIntervalError = /*#__PURE__*/function (_LuxonError2) {
+    _inheritsLoose(InvalidIntervalError, _LuxonError2);
+    function InvalidIntervalError(reason) {
+      return _LuxonError2.call(this, "Invalid Interval: " + reason.toMessage()) || this;
+    }
+    return InvalidIntervalError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidDurationError = /*#__PURE__*/function (_LuxonError3) {
+    _inheritsLoose(InvalidDurationError, _LuxonError3);
+    function InvalidDurationError(reason) {
+      return _LuxonError3.call(this, "Invalid Duration: " + reason.toMessage()) || this;
+    }
+    return InvalidDurationError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var ConflictingSpecificationError = /*#__PURE__*/function (_LuxonError4) {
+    _inheritsLoose(ConflictingSpecificationError, _LuxonError4);
+    function ConflictingSpecificationError() {
+      return _LuxonError4.apply(this, arguments) || this;
+    }
+    return ConflictingSpecificationError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidUnitError = /*#__PURE__*/function (_LuxonError5) {
+    _inheritsLoose(InvalidUnitError, _LuxonError5);
+    function InvalidUnitError(unit) {
+      return _LuxonError5.call(this, "Invalid unit " + unit) || this;
+    }
+    return InvalidUnitError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var InvalidArgumentError = /*#__PURE__*/function (_LuxonError6) {
+    _inheritsLoose(InvalidArgumentError, _LuxonError6);
+    function InvalidArgumentError() {
+      return _LuxonError6.apply(this, arguments) || this;
+    }
+    return InvalidArgumentError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+  var ZoneIsAbstractError = /*#__PURE__*/function (_LuxonError7) {
+    _inheritsLoose(ZoneIsAbstractError, _LuxonError7);
+    function ZoneIsAbstractError() {
+      return _LuxonError7.call(this, "Zone is an abstract class") || this;
+    }
+    return ZoneIsAbstractError;
+  }(LuxonError);
+
+  /**
+   * @private
+   */
+
+  var n = "numeric",
+    s = "short",
+    l = "long";
+  var DATE_SHORT = {
+    year: n,
+    month: n,
+    day: n
+  };
+  var DATE_MED = {
+    year: n,
+    month: s,
+    day: n
+  };
+  var DATE_MED_WITH_WEEKDAY = {
+    year: n,
+    month: s,
+    day: n,
+    weekday: s
+  };
+  var DATE_FULL = {
+    year: n,
+    month: l,
+    day: n
+  };
+  var DATE_HUGE = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l
+  };
+  var TIME_SIMPLE = {
+    hour: n,
+    minute: n
+  };
+  var TIME_WITH_SECONDS = {
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var TIME_WITH_SHORT_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: s
+  };
+  var TIME_WITH_LONG_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: l
+  };
+  var TIME_24_SIMPLE = {
+    hour: n,
+    minute: n,
+    hourCycle: "h23"
+  };
+  var TIME_24_WITH_SECONDS = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23"
+  };
+  var TIME_24_WITH_SHORT_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23",
+    timeZoneName: s
+  };
+  var TIME_24_WITH_LONG_OFFSET = {
+    hour: n,
+    minute: n,
+    second: n,
+    hourCycle: "h23",
+    timeZoneName: l
+  };
+  var DATETIME_SHORT = {
+    year: n,
+    month: n,
+    day: n,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_SHORT_WITH_SECONDS = {
+    year: n,
+    month: n,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var DATETIME_MED = {
+    year: n,
+    month: s,
+    day: n,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_MED_WITH_SECONDS = {
+    year: n,
+    month: s,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n
+  };
+  var DATETIME_MED_WITH_WEEKDAY = {
+    year: n,
+    month: s,
+    day: n,
+    weekday: s,
+    hour: n,
+    minute: n
+  };
+  var DATETIME_FULL = {
+    year: n,
+    month: l,
+    day: n,
+    hour: n,
+    minute: n,
+    timeZoneName: s
+  };
+  var DATETIME_FULL_WITH_SECONDS = {
+    year: n,
+    month: l,
+    day: n,
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: s
+  };
+  var DATETIME_HUGE = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l,
+    hour: n,
+    minute: n,
+    timeZoneName: l
+  };
+  var DATETIME_HUGE_WITH_SECONDS = {
+    year: n,
+    month: l,
+    day: n,
+    weekday: l,
+    hour: n,
+    minute: n,
+    second: n,
+    timeZoneName: l
+  };
+
+  /**
+   * @interface
+   */
+  var Zone = /*#__PURE__*/function () {
+    function Zone() {}
+    var _proto = Zone.prototype;
+    /**
+     * Returns the offset's common name (such as EST) at the specified timestamp
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to get the name
+     * @param {Object} opts - Options to affect the format
+     * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+     * @param {string} opts.locale - What locale to return the offset name in.
+     * @return {string}
+     */
+    _proto.offsetName = function offsetName(ts, opts) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset(ts, format) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     * @abstract
+     * @param {number} ts - Epoch milliseconds for which to compute the offset
+     * @return {number}
+     */;
+    _proto.offset = function offset(ts) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone
+     * @abstract
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      throw new ZoneIsAbstractError();
+    }
+
+    /**
+     * Return whether this Zone is valid.
+     * @abstract
+     * @type {boolean}
+     */;
+    _createClass(Zone, [{
+      key: "type",
+      get:
+      /**
+       * The type of zone
+       * @abstract
+       * @type {string}
+       */
+      function get() {
+        throw new ZoneIsAbstractError();
+      }
+
+      /**
+       * The name of this zone.
+       * @abstract
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+
+      /**
+       * The IANA name of this zone.
+       * Defaults to `name` if not overwritten by a subclass.
+       * @abstract
+       * @type {string}
+       */
+    }, {
+      key: "ianaName",
+      get: function get() {
+        return this.name;
+      }
+
+      /**
+       * Returns whether the offset is known to be fixed for the whole year.
+       * @abstract
+       * @type {boolean}
+       */
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        throw new ZoneIsAbstractError();
+      }
+    }]);
+    return Zone;
+  }();
+
+  var singleton$1 = null;
+
+  /**
+   * Represents the local zone for this JavaScript environment.
+   * @implements {Zone}
+   */
+  var SystemZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(SystemZone, _Zone);
+    function SystemZone() {
+      return _Zone.apply(this, arguments) || this;
+    }
+    var _proto = SystemZone.prototype;
+    /** @override **/
+    _proto.offsetName = function offsetName(ts, _ref) {
+      var format = _ref.format,
+        locale = _ref.locale;
+      return parseZoneInfo(ts, format, locale);
+    }
+
+    /** @override **/;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.offset(ts), format);
+    }
+
+    /** @override **/;
+    _proto.offset = function offset(ts) {
+      return -new Date(ts).getTimezoneOffset();
+    }
+
+    /** @override **/;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "system";
+    }
+
+    /** @override **/;
+    _createClass(SystemZone, [{
+      key: "type",
+      get: /** @override **/
+      function get() {
+        return "system";
+      }
+
+      /** @override **/
+    }, {
+      key: "name",
+      get: function get() {
+        return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+      }
+
+      /** @override **/
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return true;
+      }
+    }], [{
+      key: "instance",
+      get:
+      /**
+       * Get a singleton instance of the local zone
+       * @return {SystemZone}
+       */
+      function get() {
+        if (singleton$1 === null) {
+          singleton$1 = new SystemZone();
+        }
+        return singleton$1;
+      }
+    }]);
+    return SystemZone;
+  }(Zone);
+
+  var dtfCache = new Map();
+  function makeDTF(zoneName) {
+    var dtf = dtfCache.get(zoneName);
+    if (dtf === undefined) {
+      dtf = new Intl.DateTimeFormat("en-US", {
+        hour12: false,
+        timeZone: zoneName,
+        year: "numeric",
+        month: "2-digit",
+        day: "2-digit",
+        hour: "2-digit",
+        minute: "2-digit",
+        second: "2-digit",
+        era: "short"
+      });
+      dtfCache.set(zoneName, dtf);
+    }
+    return dtf;
+  }
+  var typeToPos = {
+    year: 0,
+    month: 1,
+    day: 2,
+    era: 3,
+    hour: 4,
+    minute: 5,
+    second: 6
+  };
+  function hackyOffset(dtf, date) {
+    var formatted = dtf.format(date).replace(/\u200E/g, ""),
+      parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+      fMonth = parsed[1],
+      fDay = parsed[2],
+      fYear = parsed[3],
+      fadOrBc = parsed[4],
+      fHour = parsed[5],
+      fMinute = parsed[6],
+      fSecond = parsed[7];
+    return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+  }
+  function partsOffset(dtf, date) {
+    var formatted = dtf.formatToParts(date);
+    var filled = [];
+    for (var i = 0; i < formatted.length; i++) {
+      var _formatted$i = formatted[i],
+        type = _formatted$i.type,
+        value = _formatted$i.value;
+      var pos = typeToPos[type];
+      if (type === "era") {
+        filled[pos] = value;
+      } else if (!isUndefined(pos)) {
+        filled[pos] = parseInt(value, 10);
+      }
+    }
+    return filled;
+  }
+  var ianaZoneCache = new Map();
+  /**
+   * A zone identified by an IANA identifier, like America/New_York
+   * @implements {Zone}
+   */
+  var IANAZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(IANAZone, _Zone);
+    /**
+     * @param {string} name - Zone name
+     * @return {IANAZone}
+     */
+    IANAZone.create = function create(name) {
+      var zone = ianaZoneCache.get(name);
+      if (zone === undefined) {
+        ianaZoneCache.set(name, zone = new IANAZone(name));
+      }
+      return zone;
+    }
+
+    /**
+     * Reset local caches. Should only be necessary in testing scenarios.
+     * @return {void}
+     */;
+    IANAZone.resetCache = function resetCache() {
+      ianaZoneCache.clear();
+      dtfCache.clear();
+    }
+
+    /**
+     * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+     * @param {string} s - The string to check validity on
+     * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+     * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+     * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+     * @return {boolean}
+     */;
+    IANAZone.isValidSpecifier = function isValidSpecifier(s) {
+      return this.isValidZone(s);
+    }
+
+    /**
+     * Returns whether the provided string identifies a real zone
+     * @param {string} zone - The string to check
+     * @example IANAZone.isValidZone("America/New_York") //=> true
+     * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+     * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+     * @return {boolean}
+     */;
+    IANAZone.isValidZone = function isValidZone(zone) {
+      if (!zone) {
+        return false;
+      }
+      try {
+        new Intl.DateTimeFormat("en-US", {
+          timeZone: zone
+        }).format();
+        return true;
+      } catch (e) {
+        return false;
+      }
+    };
+    function IANAZone(name) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /** @private **/
+      _this.zoneName = name;
+      /** @private **/
+      _this.valid = IANAZone.isValidZone(name);
+      return _this;
+    }
+
+    /**
+     * The type of zone. `iana` for all instances of `IANAZone`.
+     * @override
+     * @type {string}
+     */
+    var _proto = IANAZone.prototype;
+    /**
+     * Returns the offset's common name (such as EST) at the specified timestamp
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the name
+     * @param {Object} opts - Options to affect the format
+     * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+     * @param {string} opts.locale - What locale to return the offset name in.
+     * @return {string}
+     */
+    _proto.offsetName = function offsetName(ts, _ref) {
+      var format = _ref.format,
+        locale = _ref.locale;
+      return parseZoneInfo(ts, format, locale, this.name);
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.offset(ts), format);
+    }
+
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to compute the offset
+     * @return {number}
+     */;
+    _proto.offset = function offset(ts) {
+      if (!this.valid) return NaN;
+      var date = new Date(ts);
+      if (isNaN(date)) return NaN;
+      var dtf = makeDTF(this.name);
+      var _ref2 = dtf.formatToParts ? partsOffset(dtf, date) : hackyOffset(dtf, date),
+        year = _ref2[0],
+        month = _ref2[1],
+        day = _ref2[2],
+        adOrBc = _ref2[3],
+        hour = _ref2[4],
+        minute = _ref2[5],
+        second = _ref2[6];
+      if (adOrBc === "BC") {
+        year = -Math.abs(year) + 1;
+      }
+
+      // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+      var adjustedHour = hour === 24 ? 0 : hour;
+      var asUTC = objToLocalTS({
+        year: year,
+        month: month,
+        day: day,
+        hour: adjustedHour,
+        minute: minute,
+        second: second,
+        millisecond: 0
+      });
+      var asTS = +date;
+      var over = asTS % 1000;
+      asTS -= over >= 0 ? over : 1000 + over;
+      return (asUTC - asTS) / (60 * 1000);
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone
+     * @override
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "iana" && otherZone.name === this.name;
+    }
+
+    /**
+     * Return whether this Zone is valid.
+     * @override
+     * @type {boolean}
+     */;
+    _createClass(IANAZone, [{
+      key: "type",
+      get: function get() {
+        return "iana";
+      }
+
+      /**
+       * The name of this zone (i.e. the IANA zone name).
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        return this.zoneName;
+      }
+
+      /**
+       * Returns whether the offset is known to be fixed for the whole year:
+       * Always returns false for all IANA zones.
+       * @override
+       * @type {boolean}
+       */
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.valid;
+      }
+    }]);
+    return IANAZone;
+  }(Zone);
+
+  var _excluded = ["base"],
+    _excluded2 = ["padTo", "floor"];
+
+  // todo - remap caching
+
+  var intlLFCache = {};
+  function getCachedLF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var dtf = intlLFCache[key];
+    if (!dtf) {
+      dtf = new Intl.ListFormat(locString, opts);
+      intlLFCache[key] = dtf;
+    }
+    return dtf;
+  }
+  var intlDTCache = new Map();
+  function getCachedDTF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var dtf = intlDTCache.get(key);
+    if (dtf === undefined) {
+      dtf = new Intl.DateTimeFormat(locString, opts);
+      intlDTCache.set(key, dtf);
+    }
+    return dtf;
+  }
+  var intlNumCache = new Map();
+  function getCachedINF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var key = JSON.stringify([locString, opts]);
+    var inf = intlNumCache.get(key);
+    if (inf === undefined) {
+      inf = new Intl.NumberFormat(locString, opts);
+      intlNumCache.set(key, inf);
+    }
+    return inf;
+  }
+  var intlRelCache = new Map();
+  function getCachedRTF(locString, opts) {
+    if (opts === void 0) {
+      opts = {};
+    }
+    var _opts = opts;
+      _opts.base;
+      var cacheKeyOpts = _objectWithoutPropertiesLoose(_opts, _excluded); // exclude `base` from the options
+    var key = JSON.stringify([locString, cacheKeyOpts]);
+    var inf = intlRelCache.get(key);
+    if (inf === undefined) {
+      inf = new Intl.RelativeTimeFormat(locString, opts);
+      intlRelCache.set(key, inf);
+    }
+    return inf;
+  }
+  var sysLocaleCache = null;
+  function systemLocale() {
+    if (sysLocaleCache) {
+      return sysLocaleCache;
+    } else {
+      sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+      return sysLocaleCache;
+    }
+  }
+  var intlResolvedOptionsCache = new Map();
+  function getCachedIntResolvedOptions(locString) {
+    var opts = intlResolvedOptionsCache.get(locString);
+    if (opts === undefined) {
+      opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+      intlResolvedOptionsCache.set(locString, opts);
+    }
+    return opts;
+  }
+  var weekInfoCache = new Map();
+  function getCachedWeekInfo(locString) {
+    var data = weekInfoCache.get(locString);
+    if (!data) {
+      var locale = new Intl.Locale(locString);
+      // browsers currently implement this as a property, but spec says it should be a getter function
+      data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+      // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+      if (!("minimalDays" in data)) {
+        data = _extends({}, fallbackWeekSettings, data);
+      }
+      weekInfoCache.set(locString, data);
+    }
+    return data;
+  }
+  function parseLocaleString(localeStr) {
+    // I really want to avoid writing a BCP 47 parser
+    // see, e.g. https://github.com/wooorm/bcp-47
+    // Instead, we'll do this:
+
+    // a) if the string has no -u extensions, just leave it alone
+    // b) if it does, use Intl to resolve everything
+    // c) if Intl fails, try again without the -u
+
+    // private subtags and unicode subtags have ordering requirements,
+    // and we're not properly parsing this, so just strip out the
+    // private ones if they exist.
+    var xIndex = localeStr.indexOf("-x-");
+    if (xIndex !== -1) {
+      localeStr = localeStr.substring(0, xIndex);
+    }
+    var uIndex = localeStr.indexOf("-u-");
+    if (uIndex === -1) {
+      return [localeStr];
+    } else {
+      var options;
+      var selectedStr;
+      try {
+        options = getCachedDTF(localeStr).resolvedOptions();
+        selectedStr = localeStr;
+      } catch (e) {
+        var smaller = localeStr.substring(0, uIndex);
+        options = getCachedDTF(smaller).resolvedOptions();
+        selectedStr = smaller;
+      }
+      var _options = options,
+        numberingSystem = _options.numberingSystem,
+        calendar = _options.calendar;
+      return [selectedStr, numberingSystem, calendar];
+    }
+  }
+  function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+    if (outputCalendar || numberingSystem) {
+      if (!localeStr.includes("-u-")) {
+        localeStr += "-u";
+      }
+      if (outputCalendar) {
+        localeStr += "-ca-" + outputCalendar;
+      }
+      if (numberingSystem) {
+        localeStr += "-nu-" + numberingSystem;
+      }
+      return localeStr;
+    } else {
+      return localeStr;
+    }
+  }
+  function mapMonths(f) {
+    var ms = [];
+    for (var i = 1; i <= 12; i++) {
+      var dt = DateTime.utc(2009, i, 1);
+      ms.push(f(dt));
+    }
+    return ms;
+  }
+  function mapWeekdays(f) {
+    var ms = [];
+    for (var i = 1; i <= 7; i++) {
+      var dt = DateTime.utc(2016, 11, 13 + i);
+      ms.push(f(dt));
+    }
+    return ms;
+  }
+  function listStuff(loc, length, englishFn, intlFn) {
+    var mode = loc.listingMode();
+    if (mode === "error") {
+      return null;
+    } else if (mode === "en") {
+      return englishFn(length);
+    } else {
+      return intlFn(length);
+    }
+  }
+  function supportsFastNumbers(loc) {
+    if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+      return false;
+    } else {
+      return loc.numberingSystem === "latn" || !loc.locale || loc.locale.startsWith("en") || getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn";
+    }
+  }
+
+  /**
+   * @private
+   */
+  var PolyNumberFormatter = /*#__PURE__*/function () {
+    function PolyNumberFormatter(intl, forceSimple, opts) {
+      this.padTo = opts.padTo || 0;
+      this.floor = opts.floor || false;
+      opts.padTo;
+        opts.floor;
+        var otherOpts = _objectWithoutPropertiesLoose(opts, _excluded2);
+      if (!forceSimple || Object.keys(otherOpts).length > 0) {
+        var intlOpts = _extends({
+          useGrouping: false
+        }, opts);
+        if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+        this.inf = getCachedINF(intl, intlOpts);
+      }
+    }
+    var _proto = PolyNumberFormatter.prototype;
+    _proto.format = function format(i) {
+      if (this.inf) {
+        var fixed = this.floor ? Math.floor(i) : i;
+        return this.inf.format(fixed);
+      } else {
+        // to match the browser's numberformatter defaults
+        var _fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+        return padStart(_fixed, this.padTo);
+      }
+    };
+    return PolyNumberFormatter;
+  }();
+  /**
+   * @private
+   */
+  var PolyDateFormatter = /*#__PURE__*/function () {
+    function PolyDateFormatter(dt, intl, opts) {
+      this.opts = opts;
+      this.originalZone = undefined;
+      var z = undefined;
+      if (this.opts.timeZone) {
+        // Don't apply any workarounds if a timeZone is explicitly provided in opts
+        this.dt = dt;
+      } else if (dt.zone.type === "fixed") {
+        // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+        // That is why fixed-offset TZ is set to that unless it is:
+        // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+        // 2. Unsupported by the browser:
+        //    - some do not support Etc/
+        //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+        var gmtOffset = -1 * (dt.offset / 60);
+        var offsetZ = gmtOffset >= 0 ? "Etc/GMT+" + gmtOffset : "Etc/GMT" + gmtOffset;
+        if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+          z = offsetZ;
+          this.dt = dt;
+        } else {
+          // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+          // we manually apply the offset and substitute the zone as needed.
+          z = "UTC";
+          this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({
+            minutes: dt.offset
+          });
+          this.originalZone = dt.zone;
+        }
+      } else if (dt.zone.type === "system") {
+        this.dt = dt;
+      } else if (dt.zone.type === "iana") {
+        this.dt = dt;
+        z = dt.zone.name;
+      } else {
+        // Custom zones can have any offset / offsetName so we just manually
+        // apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.setZone("UTC").plus({
+          minutes: dt.offset
+        });
+        this.originalZone = dt.zone;
+      }
+      var intlOpts = _extends({}, this.opts);
+      intlOpts.timeZone = intlOpts.timeZone || z;
+      this.dtf = getCachedDTF(intl, intlOpts);
+    }
+    var _proto2 = PolyDateFormatter.prototype;
+    _proto2.format = function format() {
+      if (this.originalZone) {
+        // If we have to substitute in the actual zone name, we have to use
+        // formatToParts so that the timezone can be replaced.
+        return this.formatToParts().map(function (_ref) {
+          var value = _ref.value;
+          return value;
+        }).join("");
+      }
+      return this.dtf.format(this.dt.toJSDate());
+    };
+    _proto2.formatToParts = function formatToParts() {
+      var _this = this;
+      var parts = this.dtf.formatToParts(this.dt.toJSDate());
+      if (this.originalZone) {
+        return parts.map(function (part) {
+          if (part.type === "timeZoneName") {
+            var offsetName = _this.originalZone.offsetName(_this.dt.ts, {
+              locale: _this.dt.locale,
+              format: _this.opts.timeZoneName
+            });
+            return _extends({}, part, {
+              value: offsetName
+            });
+          } else {
+            return part;
+          }
+        });
+      }
+      return parts;
+    };
+    _proto2.resolvedOptions = function resolvedOptions() {
+      return this.dtf.resolvedOptions();
+    };
+    return PolyDateFormatter;
+  }();
+  /**
+   * @private
+   */
+  var PolyRelFormatter = /*#__PURE__*/function () {
+    function PolyRelFormatter(intl, isEnglish, opts) {
+      this.opts = _extends({
+        style: "long"
+      }, opts);
+      if (!isEnglish && hasRelative()) {
+        this.rtf = getCachedRTF(intl, opts);
+      }
+    }
+    var _proto3 = PolyRelFormatter.prototype;
+    _proto3.format = function format(count, unit) {
+      if (this.rtf) {
+        return this.rtf.format(count, unit);
+      } else {
+        return formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+      }
+    };
+    _proto3.formatToParts = function formatToParts(count, unit) {
+      if (this.rtf) {
+        return this.rtf.formatToParts(count, unit);
+      } else {
+        return [];
+      }
+    };
+    return PolyRelFormatter;
+  }();
+  var fallbackWeekSettings = {
+    firstDay: 1,
+    minimalDays: 4,
+    weekend: [6, 7]
+  };
+
+  /**
+   * @private
+   */
+  var Locale = /*#__PURE__*/function () {
+    Locale.fromOpts = function fromOpts(opts) {
+      return Locale.create(opts.locale, opts.numberingSystem, opts.outputCalendar, opts.weekSettings, opts.defaultToEN);
+    };
+    Locale.create = function create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN) {
+      if (defaultToEN === void 0) {
+        defaultToEN = false;
+      }
+      var specifiedLocale = locale || Settings.defaultLocale;
+      // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+      var localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+      var numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+      var outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+      var weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+      return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+    };
+    Locale.resetCache = function resetCache() {
+      sysLocaleCache = null;
+      intlDTCache.clear();
+      intlNumCache.clear();
+      intlRelCache.clear();
+      intlResolvedOptionsCache.clear();
+      weekInfoCache.clear();
+    };
+    Locale.fromObject = function fromObject(_temp) {
+      var _ref2 = _temp === void 0 ? {} : _temp,
+        locale = _ref2.locale,
+        numberingSystem = _ref2.numberingSystem,
+        outputCalendar = _ref2.outputCalendar,
+        weekSettings = _ref2.weekSettings;
+      return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+    };
+    function Locale(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+      var _parseLocaleString = parseLocaleString(locale),
+        parsedLocale = _parseLocaleString[0],
+        parsedNumberingSystem = _parseLocaleString[1],
+        parsedOutputCalendar = _parseLocaleString[2];
+      this.locale = parsedLocale;
+      this.numberingSystem = numbering || parsedNumberingSystem || null;
+      this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+      this.weekSettings = weekSettings;
+      this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+      this.weekdaysCache = {
+        format: {},
+        standalone: {}
+      };
+      this.monthsCache = {
+        format: {},
+        standalone: {}
+      };
+      this.meridiemCache = null;
+      this.eraCache = {};
+      this.specifiedLocale = specifiedLocale;
+      this.fastNumbersCached = null;
+    }
+    var _proto4 = Locale.prototype;
+    _proto4.listingMode = function listingMode() {
+      var isActuallyEn = this.isEnglish();
+      var hasNoWeirdness = (this.numberingSystem === null || this.numberingSystem === "latn") && (this.outputCalendar === null || this.outputCalendar === "gregory");
+      return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+    };
+    _proto4.clone = function clone(alts) {
+      if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+        return this;
+      } else {
+        return Locale.create(alts.locale || this.specifiedLocale, alts.numberingSystem || this.numberingSystem, alts.outputCalendar || this.outputCalendar, validateWeekSettings(alts.weekSettings) || this.weekSettings, alts.defaultToEN || false);
+      }
+    };
+    _proto4.redefaultToEN = function redefaultToEN(alts) {
+      if (alts === void 0) {
+        alts = {};
+      }
+      return this.clone(_extends({}, alts, {
+        defaultToEN: true
+      }));
+    };
+    _proto4.redefaultToSystem = function redefaultToSystem(alts) {
+      if (alts === void 0) {
+        alts = {};
+      }
+      return this.clone(_extends({}, alts, {
+        defaultToEN: false
+      }));
+    };
+    _proto4.months = function months$1(length, format) {
+      var _this2 = this;
+      if (format === void 0) {
+        format = false;
+      }
+      return listStuff(this, length, months, function () {
+        // Workaround for "ja" locale: formatToParts does not label all parts of the month
+        // as "month" and for this locale there is no difference between "format" and "non-format".
+        // As such, just use format() instead of formatToParts() and take the whole string
+        var monthSpecialCase = _this2.intl === "ja" || _this2.intl.startsWith("ja-");
+        format &= !monthSpecialCase;
+        var intl = format ? {
+            month: length,
+            day: "numeric"
+          } : {
+            month: length
+          },
+          formatStr = format ? "format" : "standalone";
+        if (!_this2.monthsCache[formatStr][length]) {
+          var mapper = !monthSpecialCase ? function (dt) {
+            return _this2.extract(dt, intl, "month");
+          } : function (dt) {
+            return _this2.dtFormatter(dt, intl).format();
+          };
+          _this2.monthsCache[formatStr][length] = mapMonths(mapper);
+        }
+        return _this2.monthsCache[formatStr][length];
+      });
+    };
+    _proto4.weekdays = function weekdays$1(length, format) {
+      var _this3 = this;
+      if (format === void 0) {
+        format = false;
+      }
+      return listStuff(this, length, weekdays, function () {
+        var intl = format ? {
+            weekday: length,
+            year: "numeric",
+            month: "long",
+            day: "numeric"
+          } : {
+            weekday: length
+          },
+          formatStr = format ? "format" : "standalone";
+        if (!_this3.weekdaysCache[formatStr][length]) {
+          _this3.weekdaysCache[formatStr][length] = mapWeekdays(function (dt) {
+            return _this3.extract(dt, intl, "weekday");
+          });
+        }
+        return _this3.weekdaysCache[formatStr][length];
+      });
+    };
+    _proto4.meridiems = function meridiems$1() {
+      var _this4 = this;
+      return listStuff(this, undefined, function () {
+        return meridiems;
+      }, function () {
+        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+        // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+        if (!_this4.meridiemCache) {
+          var intl = {
+            hour: "numeric",
+            hourCycle: "h12"
+          };
+          _this4.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(function (dt) {
+            return _this4.extract(dt, intl, "dayperiod");
+          });
+        }
+        return _this4.meridiemCache;
+      });
+    };
+    _proto4.eras = function eras$1(length) {
+      var _this5 = this;
+      return listStuff(this, length, eras, function () {
+        var intl = {
+          era: length
+        };
+
+        // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+        // to definitely enumerate them.
+        if (!_this5.eraCache[length]) {
+          _this5.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map(function (dt) {
+            return _this5.extract(dt, intl, "era");
+          });
+        }
+        return _this5.eraCache[length];
+      });
+    };
+    _proto4.extract = function extract(dt, intlOpts, field) {
+      var df = this.dtFormatter(dt, intlOpts),
+        results = df.formatToParts(),
+        matching = results.find(function (m) {
+          return m.type.toLowerCase() === field;
+        });
+      return matching ? matching.value : null;
+    };
+    _proto4.numberFormatter = function numberFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+      // (in contrast, the rest of the condition is used heavily)
+      return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+    };
+    _proto4.dtFormatter = function dtFormatter(dt, intlOpts) {
+      if (intlOpts === void 0) {
+        intlOpts = {};
+      }
+      return new PolyDateFormatter(dt, this.intl, intlOpts);
+    };
+    _proto4.relFormatter = function relFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+    };
+    _proto4.listFormatter = function listFormatter(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return getCachedLF(this.intl, opts);
+    };
+    _proto4.isEnglish = function isEnglish() {
+      return this.locale === "en" || this.locale.toLowerCase() === "en-us" || getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us");
+    };
+    _proto4.getWeekSettings = function getWeekSettings() {
+      if (this.weekSettings) {
+        return this.weekSettings;
+      } else if (!hasLocaleWeekInfo()) {
+        return fallbackWeekSettings;
+      } else {
+        return getCachedWeekInfo(this.locale);
+      }
+    };
+    _proto4.getStartOfWeek = function getStartOfWeek() {
+      return this.getWeekSettings().firstDay;
+    };
+    _proto4.getMinDaysInFirstWeek = function getMinDaysInFirstWeek() {
+      return this.getWeekSettings().minimalDays;
+    };
+    _proto4.getWeekendDays = function getWeekendDays() {
+      return this.getWeekSettings().weekend;
+    };
+    _proto4.equals = function equals(other) {
+      return this.locale === other.locale && this.numberingSystem === other.numberingSystem && this.outputCalendar === other.outputCalendar;
+    };
+    _proto4.toString = function toString() {
+      return "Locale(" + this.locale + ", " + this.numberingSystem + ", " + this.outputCalendar + ")";
+    };
+    _createClass(Locale, [{
+      key: "fastNumbers",
+      get: function get() {
+        if (this.fastNumbersCached == null) {
+          this.fastNumbersCached = supportsFastNumbers(this);
+        }
+        return this.fastNumbersCached;
+      }
+    }]);
+    return Locale;
+  }();
+
+  var singleton = null;
+
+  /**
+   * A zone with a fixed offset (meaning no DST)
+   * @implements {Zone}
+   */
+  var FixedOffsetZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(FixedOffsetZone, _Zone);
+    /**
+     * Get an instance with a specified offset
+     * @param {number} offset - The offset in minutes
+     * @return {FixedOffsetZone}
+     */
+    FixedOffsetZone.instance = function instance(offset) {
+      return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+    }
+
+    /**
+     * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+     * @param {string} s - The offset string to parse
+     * @example FixedOffsetZone.parseSpecifier("UTC+6")
+     * @example FixedOffsetZone.parseSpecifier("UTC+06")
+     * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+     * @return {FixedOffsetZone}
+     */;
+    FixedOffsetZone.parseSpecifier = function parseSpecifier(s) {
+      if (s) {
+        var r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+        if (r) {
+          return new FixedOffsetZone(signedOffset(r[1], r[2]));
+        }
+      }
+      return null;
+    };
+    function FixedOffsetZone(offset) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /** @private **/
+      _this.fixed = offset;
+      return _this;
+    }
+
+    /**
+     * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+     * @override
+     * @type {string}
+     */
+    var _proto = FixedOffsetZone.prototype;
+    /**
+     * Returns the offset's common name at the specified timestamp.
+     *
+     * For fixed offset zones this equals to the zone name.
+     * @override
+     */
+    _proto.offsetName = function offsetName() {
+      return this.name;
+    }
+
+    /**
+     * Returns the offset's value as a string
+     * @override
+     * @param {number} ts - Epoch milliseconds for which to get the offset
+     * @param {string} format - What style of offset to return.
+     *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+     * @return {string}
+     */;
+    _proto.formatOffset = function formatOffset$1(ts, format) {
+      return formatOffset(this.fixed, format);
+    }
+
+    /**
+     * Returns whether the offset is known to be fixed for the whole year:
+     * Always returns true for all fixed offset zones.
+     * @override
+     * @type {boolean}
+     */;
+    /**
+     * Return the offset in minutes for this zone at the specified timestamp.
+     *
+     * For fixed offset zones, this is constant and does not depend on a timestamp.
+     * @override
+     * @return {number}
+     */
+    _proto.offset = function offset() {
+      return this.fixed;
+    }
+
+    /**
+     * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+     * @override
+     * @param {Zone} otherZone - the zone to compare
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(otherZone) {
+      return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+    }
+
+    /**
+     * Return whether this Zone is valid:
+     * All fixed offset zones are valid.
+     * @override
+     * @type {boolean}
+     */;
+    _createClass(FixedOffsetZone, [{
+      key: "type",
+      get: function get() {
+        return "fixed";
+      }
+
+      /**
+       * The name of this zone.
+       * All fixed zones' names always start with "UTC" (plus optional offset)
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "name",
+      get: function get() {
+        return this.fixed === 0 ? "UTC" : "UTC" + formatOffset(this.fixed, "narrow");
+      }
+
+      /**
+       * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+       *
+       * @override
+       * @type {string}
+       */
+    }, {
+      key: "ianaName",
+      get: function get() {
+        if (this.fixed === 0) {
+          return "Etc/UTC";
+        } else {
+          return "Etc/GMT" + formatOffset(-this.fixed, "narrow");
+        }
+      }
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return true;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return true;
+      }
+    }], [{
+      key: "utcInstance",
+      get:
+      /**
+       * Get a singleton instance of UTC
+       * @return {FixedOffsetZone}
+       */
+      function get() {
+        if (singleton === null) {
+          singleton = new FixedOffsetZone(0);
+        }
+        return singleton;
+      }
+    }]);
+    return FixedOffsetZone;
+  }(Zone);
+
+  /**
+   * A zone that failed to parse. You should never need to instantiate this.
+   * @implements {Zone}
+   */
+  var InvalidZone = /*#__PURE__*/function (_Zone) {
+    _inheritsLoose(InvalidZone, _Zone);
+    function InvalidZone(zoneName) {
+      var _this;
+      _this = _Zone.call(this) || this;
+      /**  @private */
+      _this.zoneName = zoneName;
+      return _this;
+    }
+
+    /** @override **/
+    var _proto = InvalidZone.prototype;
+    /** @override **/
+    _proto.offsetName = function offsetName() {
+      return null;
+    }
+
+    /** @override **/;
+    _proto.formatOffset = function formatOffset() {
+      return "";
+    }
+
+    /** @override **/;
+    _proto.offset = function offset() {
+      return NaN;
+    }
+
+    /** @override **/;
+    _proto.equals = function equals() {
+      return false;
+    }
+
+    /** @override **/;
+    _createClass(InvalidZone, [{
+      key: "type",
+      get: function get() {
+        return "invalid";
+      }
+
+      /** @override **/
+    }, {
+      key: "name",
+      get: function get() {
+        return this.zoneName;
+      }
+
+      /** @override **/
+    }, {
+      key: "isUniversal",
+      get: function get() {
+        return false;
+      }
+    }, {
+      key: "isValid",
+      get: function get() {
+        return false;
+      }
+    }]);
+    return InvalidZone;
+  }(Zone);
+
+  /**
+   * @private
+   */
+  function normalizeZone(input, defaultZone) {
+    if (isUndefined(input) || input === null) {
+      return defaultZone;
+    } else if (input instanceof Zone) {
+      return input;
+    } else if (isString(input)) {
+      var lowered = input.toLowerCase();
+      if (lowered === "default") return defaultZone;else if (lowered === "local" || lowered === "system") return SystemZone.instance;else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+    } else if (isNumber(input)) {
+      return FixedOffsetZone.instance(input);
+    } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+      // This is dumb, but the instanceof check above doesn't seem to really work
+      // so we're duck checking it
+      return input;
+    } else {
+      return new InvalidZone(input);
+    }
+  }
+
+  var numberingSystems = {
+    arab: "[\u0660-\u0669]",
+    arabext: "[\u06F0-\u06F9]",
+    bali: "[\u1B50-\u1B59]",
+    beng: "[\u09E6-\u09EF]",
+    deva: "[\u0966-\u096F]",
+    fullwide: "[\uFF10-\uFF19]",
+    gujr: "[\u0AE6-\u0AEF]",
+    hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+    khmr: "[\u17E0-\u17E9]",
+    knda: "[\u0CE6-\u0CEF]",
+    laoo: "[\u0ED0-\u0ED9]",
+    limb: "[\u1946-\u194F]",
+    mlym: "[\u0D66-\u0D6F]",
+    mong: "[\u1810-\u1819]",
+    mymr: "[\u1040-\u1049]",
+    orya: "[\u0B66-\u0B6F]",
+    tamldec: "[\u0BE6-\u0BEF]",
+    telu: "[\u0C66-\u0C6F]",
+    thai: "[\u0E50-\u0E59]",
+    tibt: "[\u0F20-\u0F29]",
+    latn: "\\d"
+  };
+  var numberingSystemsUTF16 = {
+    arab: [1632, 1641],
+    arabext: [1776, 1785],
+    bali: [6992, 7001],
+    beng: [2534, 2543],
+    deva: [2406, 2415],
+    fullwide: [65296, 65303],
+    gujr: [2790, 2799],
+    khmr: [6112, 6121],
+    knda: [3302, 3311],
+    laoo: [3792, 3801],
+    limb: [6470, 6479],
+    mlym: [3430, 3439],
+    mong: [6160, 6169],
+    mymr: [4160, 4169],
+    orya: [2918, 2927],
+    tamldec: [3046, 3055],
+    telu: [3174, 3183],
+    thai: [3664, 3673],
+    tibt: [3872, 3881]
+  };
+  var hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+  function parseDigits(str) {
+    var value = parseInt(str, 10);
+    if (isNaN(value)) {
+      value = "";
+      for (var i = 0; i < str.length; i++) {
+        var code = str.charCodeAt(i);
+        if (str[i].search(numberingSystems.hanidec) !== -1) {
+          value += hanidecChars.indexOf(str[i]);
+        } else {
+          for (var key in numberingSystemsUTF16) {
+            var _numberingSystemsUTF = numberingSystemsUTF16[key],
+              min = _numberingSystemsUTF[0],
+              max = _numberingSystemsUTF[1];
+            if (code >= min && code <= max) {
+              value += code - min;
+            }
+          }
+        }
+      }
+      return parseInt(value, 10);
+    } else {
+      return value;
+    }
+  }
+
+  // cache of {numberingSystem: {append: regex}}
+  var digitRegexCache = new Map();
+  function resetDigitRegexCache() {
+    digitRegexCache.clear();
+  }
+  function digitRegex(_ref, append) {
+    var numberingSystem = _ref.numberingSystem;
+    if (append === void 0) {
+      append = "";
+    }
+    var ns = numberingSystem || "latn";
+    var appendCache = digitRegexCache.get(ns);
+    if (appendCache === undefined) {
+      appendCache = new Map();
+      digitRegexCache.set(ns, appendCache);
+    }
+    var regex = appendCache.get(append);
+    if (regex === undefined) {
+      regex = new RegExp("" + numberingSystems[ns] + append);
+      appendCache.set(append, regex);
+    }
+    return regex;
+  }
+
+  var now = function now() {
+      return Date.now();
+    },
+    defaultZone = "system",
+    defaultLocale = null,
+    defaultNumberingSystem = null,
+    defaultOutputCalendar = null,
+    twoDigitCutoffYear = 60,
+    throwOnInvalid,
+    defaultWeekSettings = null;
+
+  /**
+   * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+   */
+  var Settings = /*#__PURE__*/function () {
+    function Settings() {}
+    /**
+     * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+     * @return {void}
+     */
+    Settings.resetCaches = function resetCaches() {
+      Locale.resetCache();
+      IANAZone.resetCache();
+      DateTime.resetCache();
+      resetDigitRegexCache();
+    };
+    _createClass(Settings, null, [{
+      key: "now",
+      get:
+      /**
+       * Get the callback for returning the current timestamp.
+       * @type {function}
+       */
+      function get() {
+        return now;
+      }
+
+      /**
+       * Set the callback for returning the current timestamp.
+       * The function should return a number, which will be interpreted as an Epoch millisecond count
+       * @type {function}
+       * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+       * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+       */,
+      set: function set(n) {
+        now = n;
+      }
+
+      /**
+       * Set the default time zone to create DateTimes in. Does not affect existing instances.
+       * Use the value "system" to reset this value to the system's time zone.
+       * @type {string}
+       */
+    }, {
+      key: "defaultZone",
+      get:
+      /**
+       * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+       * The default value is the system's time zone (the one set on the machine that runs this code).
+       * @type {Zone}
+       */
+      function get() {
+        return normalizeZone(defaultZone, SystemZone.instance);
+      }
+
+      /**
+       * Get the default locale to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(zone) {
+        defaultZone = zone;
+      }
+    }, {
+      key: "defaultLocale",
+      get: function get() {
+        return defaultLocale;
+      }
+
+      /**
+       * Set the default locale to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(locale) {
+        defaultLocale = locale;
+      }
+
+      /**
+       * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */
+    }, {
+      key: "defaultNumberingSystem",
+      get: function get() {
+        return defaultNumberingSystem;
+      }
+
+      /**
+       * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(numberingSystem) {
+        defaultNumberingSystem = numberingSystem;
+      }
+
+      /**
+       * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */
+    }, {
+      key: "defaultOutputCalendar",
+      get: function get() {
+        return defaultOutputCalendar;
+      }
+
+      /**
+       * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+       * @type {string}
+       */,
+      set: function set(outputCalendar) {
+        defaultOutputCalendar = outputCalendar;
+      }
+
+      /**
+       * @typedef {Object} WeekSettings
+       * @property {number} firstDay
+       * @property {number} minimalDays
+       * @property {number[]} weekend
+       */
+
+      /**
+       * @return {WeekSettings|null}
+       */
+    }, {
+      key: "defaultWeekSettings",
+      get: function get() {
+        return defaultWeekSettings;
+      }
+
+      /**
+       * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+       * how many days are required in the first week of a year.
+       * Does not affect existing instances.
+       *
+       * @param {WeekSettings|null} weekSettings
+       */,
+      set: function set(weekSettings) {
+        defaultWeekSettings = validateWeekSettings(weekSettings);
+      }
+
+      /**
+       * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+       * @type {number}
+       */
+    }, {
+      key: "twoDigitCutoffYear",
+      get: function get() {
+        return twoDigitCutoffYear;
+      }
+
+      /**
+       * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+       * @type {number}
+       * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+       * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+       * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+       * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+       * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+       */,
+      set: function set(cutoffYear) {
+        twoDigitCutoffYear = cutoffYear % 100;
+      }
+
+      /**
+       * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+       * @type {boolean}
+       */
+    }, {
+      key: "throwOnInvalid",
+      get: function get() {
+        return throwOnInvalid;
+      }
+
+      /**
+       * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+       * @type {boolean}
+       */,
+      set: function set(t) {
+        throwOnInvalid = t;
+      }
+    }]);
+    return Settings;
+  }();
+
+  var Invalid = /*#__PURE__*/function () {
+    function Invalid(reason, explanation) {
+      this.reason = reason;
+      this.explanation = explanation;
+    }
+    var _proto = Invalid.prototype;
+    _proto.toMessage = function toMessage() {
+      if (this.explanation) {
+        return this.reason + ": " + this.explanation;
+      } else {
+        return this.reason;
+      }
+    };
+    return Invalid;
+  }();
+
+  var nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+    leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+  function unitOutOfRange(unit, value) {
+    return new Invalid("unit out of range", "you specified " + value + " (of type " + typeof value + ") as a " + unit + ", which is invalid");
+  }
+  function dayOfWeek(year, month, day) {
+    var d = new Date(Date.UTC(year, month - 1, day));
+    if (year < 100 && year >= 0) {
+      d.setUTCFullYear(d.getUTCFullYear() - 1900);
+    }
+    var js = d.getUTCDay();
+    return js === 0 ? 7 : js;
+  }
+  function computeOrdinal(year, month, day) {
+    return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+  }
+  function uncomputeOrdinal(year, ordinal) {
+    var table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+      month0 = table.findIndex(function (i) {
+        return i < ordinal;
+      }),
+      day = ordinal - table[month0];
+    return {
+      month: month0 + 1,
+      day: day
+    };
+  }
+  function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+    return (isoWeekday - startOfWeek + 7) % 7 + 1;
+  }
+
+  /**
+   * @private
+   */
+
+  function gregorianToWeek(gregObj, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var year = gregObj.year,
+      month = gregObj.month,
+      day = gregObj.day,
+      ordinal = computeOrdinal(year, month, day),
+      weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+    var weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+      weekYear;
+    if (weekNumber < 1) {
+      weekYear = year - 1;
+      weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+    } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+      weekYear = year + 1;
+      weekNumber = 1;
+    } else {
+      weekYear = year;
+    }
+    return _extends({
+      weekYear: weekYear,
+      weekNumber: weekNumber,
+      weekday: weekday
+    }, timeObject(gregObj));
+  }
+  function weekToGregorian(weekData, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var weekYear = weekData.weekYear,
+      weekNumber = weekData.weekNumber,
+      weekday = weekData.weekday,
+      weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+      yearInDays = daysInYear(weekYear);
+    var ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+      year;
+    if (ordinal < 1) {
+      year = weekYear - 1;
+      ordinal += daysInYear(year);
+    } else if (ordinal > yearInDays) {
+      year = weekYear + 1;
+      ordinal -= daysInYear(weekYear);
+    } else {
+      year = weekYear;
+    }
+    var _uncomputeOrdinal = uncomputeOrdinal(year, ordinal),
+      month = _uncomputeOrdinal.month,
+      day = _uncomputeOrdinal.day;
+    return _extends({
+      year: year,
+      month: month,
+      day: day
+    }, timeObject(weekData));
+  }
+  function gregorianToOrdinal(gregData) {
+    var year = gregData.year,
+      month = gregData.month,
+      day = gregData.day;
+    var ordinal = computeOrdinal(year, month, day);
+    return _extends({
+      year: year,
+      ordinal: ordinal
+    }, timeObject(gregData));
+  }
+  function ordinalToGregorian(ordinalData) {
+    var year = ordinalData.year,
+      ordinal = ordinalData.ordinal;
+    var _uncomputeOrdinal2 = uncomputeOrdinal(year, ordinal),
+      month = _uncomputeOrdinal2.month,
+      day = _uncomputeOrdinal2.day;
+    return _extends({
+      year: year,
+      month: month,
+      day: day
+    }, timeObject(ordinalData));
+  }
+
+  /**
+   * Check if local week units like localWeekday are used in obj.
+   * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+   * Modifies obj in-place!
+   * @param obj the object values
+   */
+  function usesLocalWeekValues(obj, loc) {
+    var hasLocaleWeekData = !isUndefined(obj.localWeekday) || !isUndefined(obj.localWeekNumber) || !isUndefined(obj.localWeekYear);
+    if (hasLocaleWeekData) {
+      var hasIsoWeekData = !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+      if (hasIsoWeekData) {
+        throw new ConflictingSpecificationError("Cannot mix locale-based week fields with ISO-based week fields");
+      }
+      if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+      if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+      if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+      delete obj.localWeekday;
+      delete obj.localWeekNumber;
+      delete obj.localWeekYear;
+      return {
+        minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+        startOfWeek: loc.getStartOfWeek()
+      };
+    } else {
+      return {
+        minDaysInFirstWeek: 4,
+        startOfWeek: 1
+      };
+    }
+  }
+  function hasInvalidWeekData(obj, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var validYear = isInteger(obj.weekYear),
+      validWeek = integerBetween(obj.weekNumber, 1, weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)),
+      validWeekday = integerBetween(obj.weekday, 1, 7);
+    if (!validYear) {
+      return unitOutOfRange("weekYear", obj.weekYear);
+    } else if (!validWeek) {
+      return unitOutOfRange("week", obj.weekNumber);
+    } else if (!validWeekday) {
+      return unitOutOfRange("weekday", obj.weekday);
+    } else return false;
+  }
+  function hasInvalidOrdinalData(obj) {
+    var validYear = isInteger(obj.year),
+      validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+    if (!validYear) {
+      return unitOutOfRange("year", obj.year);
+    } else if (!validOrdinal) {
+      return unitOutOfRange("ordinal", obj.ordinal);
+    } else return false;
+  }
+  function hasInvalidGregorianData(obj) {
+    var validYear = isInteger(obj.year),
+      validMonth = integerBetween(obj.month, 1, 12),
+      validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+    if (!validYear) {
+      return unitOutOfRange("year", obj.year);
+    } else if (!validMonth) {
+      return unitOutOfRange("month", obj.month);
+    } else if (!validDay) {
+      return unitOutOfRange("day", obj.day);
+    } else return false;
+  }
+  function hasInvalidTimeData(obj) {
+    var hour = obj.hour,
+      minute = obj.minute,
+      second = obj.second,
+      millisecond = obj.millisecond;
+    var validHour = integerBetween(hour, 0, 23) || hour === 24 && minute === 0 && second === 0 && millisecond === 0,
+      validMinute = integerBetween(minute, 0, 59),
+      validSecond = integerBetween(second, 0, 59),
+      validMillisecond = integerBetween(millisecond, 0, 999);
+    if (!validHour) {
+      return unitOutOfRange("hour", hour);
+    } else if (!validMinute) {
+      return unitOutOfRange("minute", minute);
+    } else if (!validSecond) {
+      return unitOutOfRange("second", second);
+    } else if (!validMillisecond) {
+      return unitOutOfRange("millisecond", millisecond);
+    } else return false;
+  }
+
+  /**
+   * @private
+   */
+
+  // TYPES
+
+  function isUndefined(o) {
+    return typeof o === "undefined";
+  }
+  function isNumber(o) {
+    return typeof o === "number";
+  }
+  function isInteger(o) {
+    return typeof o === "number" && o % 1 === 0;
+  }
+  function isString(o) {
+    return typeof o === "string";
+  }
+  function isDate(o) {
+    return Object.prototype.toString.call(o) === "[object Date]";
+  }
+
+  // CAPABILITIES
+
+  function hasRelative() {
+    try {
+      return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+    } catch (e) {
+      return false;
+    }
+  }
+  function hasLocaleWeekInfo() {
+    try {
+      return typeof Intl !== "undefined" && !!Intl.Locale && ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype);
+    } catch (e) {
+      return false;
+    }
+  }
+
+  // OBJECTS AND ARRAYS
+
+  function maybeArray(thing) {
+    return Array.isArray(thing) ? thing : [thing];
+  }
+  function bestBy(arr, by, compare) {
+    if (arr.length === 0) {
+      return undefined;
+    }
+    return arr.reduce(function (best, next) {
+      var pair = [by(next), next];
+      if (!best) {
+        return pair;
+      } else if (compare(best[0], pair[0]) === best[0]) {
+        return best;
+      } else {
+        return pair;
+      }
+    }, null)[1];
+  }
+  function pick(obj, keys) {
+    return keys.reduce(function (a, k) {
+      a[k] = obj[k];
+      return a;
+    }, {});
+  }
+  function hasOwnProperty(obj, prop) {
+    return Object.prototype.hasOwnProperty.call(obj, prop);
+  }
+  function validateWeekSettings(settings) {
+    if (settings == null) {
+      return null;
+    } else if (typeof settings !== "object") {
+      throw new InvalidArgumentError("Week settings must be an object");
+    } else {
+      if (!integerBetween(settings.firstDay, 1, 7) || !integerBetween(settings.minimalDays, 1, 7) || !Array.isArray(settings.weekend) || settings.weekend.some(function (v) {
+        return !integerBetween(v, 1, 7);
+      })) {
+        throw new InvalidArgumentError("Invalid week settings");
+      }
+      return {
+        firstDay: settings.firstDay,
+        minimalDays: settings.minimalDays,
+        weekend: Array.from(settings.weekend)
+      };
+    }
+  }
+
+  // NUMBERS AND STRINGS
+
+  function integerBetween(thing, bottom, top) {
+    return isInteger(thing) && thing >= bottom && thing <= top;
+  }
+
+  // x % n but takes the sign of n instead of x
+  function floorMod(x, n) {
+    return x - n * Math.floor(x / n);
+  }
+  function padStart(input, n) {
+    if (n === void 0) {
+      n = 2;
+    }
+    var isNeg = input < 0;
+    var padded;
+    if (isNeg) {
+      padded = "-" + ("" + -input).padStart(n, "0");
+    } else {
+      padded = ("" + input).padStart(n, "0");
+    }
+    return padded;
+  }
+  function parseInteger(string) {
+    if (isUndefined(string) || string === null || string === "") {
+      return undefined;
+    } else {
+      return parseInt(string, 10);
+    }
+  }
+  function parseFloating(string) {
+    if (isUndefined(string) || string === null || string === "") {
+      return undefined;
+    } else {
+      return parseFloat(string);
+    }
+  }
+  function parseMillis(fraction) {
+    // Return undefined (instead of 0) in these cases, where fraction is not set
+    if (isUndefined(fraction) || fraction === null || fraction === "") {
+      return undefined;
+    } else {
+      var f = parseFloat("0." + fraction) * 1000;
+      return Math.floor(f);
+    }
+  }
+  function roundTo(number, digits, rounding) {
+    if (rounding === void 0) {
+      rounding = "round";
+    }
+    var factor = Math.pow(10, digits);
+    switch (rounding) {
+      case "expand":
+        return number > 0 ? Math.ceil(number * factor) / factor : Math.floor(number * factor) / factor;
+      case "trunc":
+        return Math.trunc(number * factor) / factor;
+      case "round":
+        return Math.round(number * factor) / factor;
+      case "floor":
+        return Math.floor(number * factor) / factor;
+      case "ceil":
+        return Math.ceil(number * factor) / factor;
+      default:
+        throw new RangeError("Value rounding " + rounding + " is out of range");
+    }
+  }
+
+  // DATE BASICS
+
+  function isLeapYear(year) {
+    return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+  }
+  function daysInYear(year) {
+    return isLeapYear(year) ? 366 : 365;
+  }
+  function daysInMonth(year, month) {
+    var modMonth = floorMod(month - 1, 12) + 1,
+      modYear = year + (month - modMonth) / 12;
+    if (modMonth === 2) {
+      return isLeapYear(modYear) ? 29 : 28;
+    } else {
+      return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+    }
+  }
+
+  // convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+  function objToLocalTS(obj) {
+    var d = Date.UTC(obj.year, obj.month - 1, obj.day, obj.hour, obj.minute, obj.second, obj.millisecond);
+
+    // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+    if (obj.year < 100 && obj.year >= 0) {
+      d = new Date(d);
+      // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+      // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+      // the calculations done by Date.UTC are using year 2000 - which is incorrect
+      d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+    }
+    return +d;
+  }
+
+  // adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+  function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+    var fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+    return -fwdlw + minDaysInFirstWeek - 1;
+  }
+  function weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek) {
+    if (minDaysInFirstWeek === void 0) {
+      minDaysInFirstWeek = 4;
+    }
+    if (startOfWeek === void 0) {
+      startOfWeek = 1;
+    }
+    var weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+    var weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+    return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+  }
+  function untruncateYear(year) {
+    if (year > 99) {
+      return year;
+    } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+  }
+
+  // PARSING
+
+  function parseZoneInfo(ts, offsetFormat, locale, timeZone) {
+    if (timeZone === void 0) {
+      timeZone = null;
+    }
+    var date = new Date(ts),
+      intlOpts = {
+        hourCycle: "h23",
+        year: "numeric",
+        month: "2-digit",
+        day: "2-digit",
+        hour: "2-digit",
+        minute: "2-digit"
+      };
+    if (timeZone) {
+      intlOpts.timeZone = timeZone;
+    }
+    var modified = _extends({
+      timeZoneName: offsetFormat
+    }, intlOpts);
+    var parsed = new Intl.DateTimeFormat(locale, modified).formatToParts(date).find(function (m) {
+      return m.type.toLowerCase() === "timezonename";
+    });
+    return parsed ? parsed.value : null;
+  }
+
+  // signedOffset('-5', '30') -> -330
+  function signedOffset(offHourStr, offMinuteStr) {
+    var offHour = parseInt(offHourStr, 10);
+
+    // don't || this because we want to preserve -0
+    if (Number.isNaN(offHour)) {
+      offHour = 0;
+    }
+    var offMin = parseInt(offMinuteStr, 10) || 0,
+      offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+    return offHour * 60 + offMinSigned;
+  }
+
+  // COERCION
+
+  function asNumber(value) {
+    var numericValue = Number(value);
+    if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue)) throw new InvalidArgumentError("Invalid unit value " + value);
+    return numericValue;
+  }
+  function normalizeObject(obj, normalizer) {
+    var normalized = {};
+    for (var u in obj) {
+      if (hasOwnProperty(obj, u)) {
+        var v = obj[u];
+        if (v === undefined || v === null) continue;
+        normalized[normalizer(u)] = asNumber(v);
+      }
+    }
+    return normalized;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  function formatOffset(offset, format) {
+    var hours = Math.trunc(Math.abs(offset / 60)),
+      minutes = Math.trunc(Math.abs(offset % 60)),
+      sign = offset >= 0 ? "+" : "-";
+    switch (format) {
+      case "short":
+        return "" + sign + padStart(hours, 2) + ":" + padStart(minutes, 2);
+      case "narrow":
+        return "" + sign + hours + (minutes > 0 ? ":" + minutes : "");
+      case "techie":
+        return "" + sign + padStart(hours, 2) + padStart(minutes, 2);
+      default:
+        throw new RangeError("Value format " + format + " is out of range for property format");
+    }
+  }
+  function timeObject(obj) {
+    return pick(obj, ["hour", "minute", "second", "millisecond"]);
+  }
+
+  /**
+   * @private
+   */
+
+  var monthsLong = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"];
+  var monthsShort = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"];
+  var monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+  function months(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(monthsNarrow);
+      case "short":
+        return [].concat(monthsShort);
+      case "long":
+        return [].concat(monthsLong);
+      case "numeric":
+        return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+      case "2-digit":
+        return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+      default:
+        return null;
+    }
+  }
+  var weekdaysLong = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"];
+  var weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+  var weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+  function weekdays(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(weekdaysNarrow);
+      case "short":
+        return [].concat(weekdaysShort);
+      case "long":
+        return [].concat(weekdaysLong);
+      case "numeric":
+        return ["1", "2", "3", "4", "5", "6", "7"];
+      default:
+        return null;
+    }
+  }
+  var meridiems = ["AM", "PM"];
+  var erasLong = ["Before Christ", "Anno Domini"];
+  var erasShort = ["BC", "AD"];
+  var erasNarrow = ["B", "A"];
+  function eras(length) {
+    switch (length) {
+      case "narrow":
+        return [].concat(erasNarrow);
+      case "short":
+        return [].concat(erasShort);
+      case "long":
+        return [].concat(erasLong);
+      default:
+        return null;
+    }
+  }
+  function meridiemForDateTime(dt) {
+    return meridiems[dt.hour < 12 ? 0 : 1];
+  }
+  function weekdayForDateTime(dt, length) {
+    return weekdays(length)[dt.weekday - 1];
+  }
+  function monthForDateTime(dt, length) {
+    return months(length)[dt.month - 1];
+  }
+  function eraForDateTime(dt, length) {
+    return eras(length)[dt.year < 0 ? 0 : 1];
+  }
+  function formatRelativeTime(unit, count, numeric, narrow) {
+    if (numeric === void 0) {
+      numeric = "always";
+    }
+    if (narrow === void 0) {
+      narrow = false;
+    }
+    var units = {
+      years: ["year", "yr."],
+      quarters: ["quarter", "qtr."],
+      months: ["month", "mo."],
+      weeks: ["week", "wk."],
+      days: ["day", "day", "days"],
+      hours: ["hour", "hr."],
+      minutes: ["minute", "min."],
+      seconds: ["second", "sec."]
+    };
+    var lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+    if (numeric === "auto" && lastable) {
+      var isDay = unit === "days";
+      switch (count) {
+        case 1:
+          return isDay ? "tomorrow" : "next " + units[unit][0];
+        case -1:
+          return isDay ? "yesterday" : "last " + units[unit][0];
+        case 0:
+          return isDay ? "today" : "this " + units[unit][0];
+      }
+    }
+
+    var isInPast = Object.is(count, -0) || count < 0,
+      fmtValue = Math.abs(count),
+      singular = fmtValue === 1,
+      lilUnits = units[unit],
+      fmtUnit = narrow ? singular ? lilUnits[1] : lilUnits[2] || lilUnits[1] : singular ? units[unit][0] : unit;
+    return isInPast ? fmtValue + " " + fmtUnit + " ago" : "in " + fmtValue + " " + fmtUnit;
+  }
+
+  function stringifyTokens(splits, tokenToString) {
+    var s = "";
+    for (var _iterator = _createForOfIteratorHelperLoose(splits), _step; !(_step = _iterator()).done;) {
+      var token = _step.value;
+      if (token.literal) {
+        s += token.val;
+      } else {
+        s += tokenToString(token.val);
+      }
+    }
+    return s;
+  }
+  var _macroTokenToFormatOpts = {
+    D: DATE_SHORT,
+    DD: DATE_MED,
+    DDD: DATE_FULL,
+    DDDD: DATE_HUGE,
+    t: TIME_SIMPLE,
+    tt: TIME_WITH_SECONDS,
+    ttt: TIME_WITH_SHORT_OFFSET,
+    tttt: TIME_WITH_LONG_OFFSET,
+    T: TIME_24_SIMPLE,
+    TT: TIME_24_WITH_SECONDS,
+    TTT: TIME_24_WITH_SHORT_OFFSET,
+    TTTT: TIME_24_WITH_LONG_OFFSET,
+    f: DATETIME_SHORT,
+    ff: DATETIME_MED,
+    fff: DATETIME_FULL,
+    ffff: DATETIME_HUGE,
+    F: DATETIME_SHORT_WITH_SECONDS,
+    FF: DATETIME_MED_WITH_SECONDS,
+    FFF: DATETIME_FULL_WITH_SECONDS,
+    FFFF: DATETIME_HUGE_WITH_SECONDS
+  };
+
+  /**
+   * @private
+   */
+  var Formatter = /*#__PURE__*/function () {
+    Formatter.create = function create(locale, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return new Formatter(locale, opts);
+    };
+    Formatter.parseFormat = function parseFormat(fmt) {
+      // white-space is always considered a literal in user-provided formats
+      // the " " token has a special meaning (see unitForToken)
+
+      var current = null,
+        currentFull = "",
+        bracketed = false;
+      var splits = [];
+      for (var i = 0; i < fmt.length; i++) {
+        var c = fmt.charAt(i);
+        if (c === "'") {
+          // turn '' into a literal signal quote instead of just skipping the empty literal
+          if (currentFull.length > 0 || bracketed) {
+            splits.push({
+              literal: bracketed || /^\s+$/.test(currentFull),
+              val: currentFull === "" ? "'" : currentFull
+            });
+          }
+          current = null;
+          currentFull = "";
+          bracketed = !bracketed;
+        } else if (bracketed) {
+          currentFull += c;
+        } else if (c === current) {
+          currentFull += c;
+        } else {
+          if (currentFull.length > 0) {
+            splits.push({
+              literal: /^\s+$/.test(currentFull),
+              val: currentFull
+            });
+          }
+          currentFull = c;
+          current = c;
+        }
+      }
+      if (currentFull.length > 0) {
+        splits.push({
+          literal: bracketed || /^\s+$/.test(currentFull),
+          val: currentFull
+        });
+      }
+      return splits;
+    };
+    Formatter.macroTokenToFormatOpts = function macroTokenToFormatOpts(token) {
+      return _macroTokenToFormatOpts[token];
+    };
+    function Formatter(locale, formatOpts) {
+      this.opts = formatOpts;
+      this.loc = locale;
+      this.systemLoc = null;
+    }
+    var _proto = Formatter.prototype;
+    _proto.formatWithSystemDefault = function formatWithSystemDefault(dt, opts) {
+      if (this.systemLoc === null) {
+        this.systemLoc = this.loc.redefaultToSystem();
+      }
+      var df = this.systemLoc.dtFormatter(dt, _extends({}, this.opts, opts));
+      return df.format();
+    };
+    _proto.dtFormatter = function dtFormatter(dt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.loc.dtFormatter(dt, _extends({}, this.opts, opts));
+    };
+    _proto.formatDateTime = function formatDateTime(dt, opts) {
+      return this.dtFormatter(dt, opts).format();
+    };
+    _proto.formatDateTimeParts = function formatDateTimeParts(dt, opts) {
+      return this.dtFormatter(dt, opts).formatToParts();
+    };
+    _proto.formatInterval = function formatInterval(interval, opts) {
+      var df = this.dtFormatter(interval.start, opts);
+      return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+    };
+    _proto.resolvedOptions = function resolvedOptions(dt, opts) {
+      return this.dtFormatter(dt, opts).resolvedOptions();
+    };
+    _proto.num = function num(n, p, signDisplay) {
+      if (p === void 0) {
+        p = 0;
+      }
+      if (signDisplay === void 0) {
+        signDisplay = undefined;
+      }
+      // we get some perf out of doing this here, annoyingly
+      if (this.opts.forceSimple) {
+        return padStart(n, p);
+      }
+      var opts = _extends({}, this.opts);
+      if (p > 0) {
+        opts.padTo = p;
+      }
+      if (signDisplay) {
+        opts.signDisplay = signDisplay;
+      }
+      return this.loc.numberFormatter(opts).format(n);
+    };
+    _proto.formatDateTimeFromString = function formatDateTimeFromString(dt, fmt) {
+      var _this = this;
+      var knownEnglish = this.loc.listingMode() === "en",
+        useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+        string = function string(opts, extract) {
+          return _this.loc.extract(dt, opts, extract);
+        },
+        formatOffset = function formatOffset(opts) {
+          if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+            return "Z";
+          }
+          return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+        },
+        meridiem = function meridiem() {
+          return knownEnglish ? meridiemForDateTime(dt) : string({
+            hour: "numeric",
+            hourCycle: "h12"
+          }, "dayperiod");
+        },
+        month = function month(length, standalone) {
+          return knownEnglish ? monthForDateTime(dt, length) : string(standalone ? {
+            month: length
+          } : {
+            month: length,
+            day: "numeric"
+          }, "month");
+        },
+        weekday = function weekday(length, standalone) {
+          return knownEnglish ? weekdayForDateTime(dt, length) : string(standalone ? {
+            weekday: length
+          } : {
+            weekday: length,
+            month: "long",
+            day: "numeric"
+          }, "weekday");
+        },
+        maybeMacro = function maybeMacro(token) {
+          var formatOpts = Formatter.macroTokenToFormatOpts(token);
+          if (formatOpts) {
+            return _this.formatWithSystemDefault(dt, formatOpts);
+          } else {
+            return token;
+          }
+        },
+        era = function era(length) {
+          return knownEnglish ? eraForDateTime(dt, length) : string({
+            era: length
+          }, "era");
+        },
+        tokenToString = function tokenToString(token) {
+          // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+          switch (token) {
+            // ms
+            case "S":
+              return _this.num(dt.millisecond);
+            case "u":
+            // falls through
+            case "SSS":
+              return _this.num(dt.millisecond, 3);
+            // seconds
+            case "s":
+              return _this.num(dt.second);
+            case "ss":
+              return _this.num(dt.second, 2);
+            // fractional seconds
+            case "uu":
+              return _this.num(Math.floor(dt.millisecond / 10), 2);
+            case "uuu":
+              return _this.num(Math.floor(dt.millisecond / 100));
+            // minutes
+            case "m":
+              return _this.num(dt.minute);
+            case "mm":
+              return _this.num(dt.minute, 2);
+            // hours
+            case "h":
+              return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+            case "hh":
+              return _this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+            case "H":
+              return _this.num(dt.hour);
+            case "HH":
+              return _this.num(dt.hour, 2);
+            // offset
+            case "Z":
+              // like +6
+              return formatOffset({
+                format: "narrow",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZ":
+              // like +06:00
+              return formatOffset({
+                format: "short",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZZ":
+              // like +0600
+              return formatOffset({
+                format: "techie",
+                allowZ: _this.opts.allowZ
+              });
+            case "ZZZZ":
+              // like EST
+              return dt.zone.offsetName(dt.ts, {
+                format: "short",
+                locale: _this.loc.locale
+              });
+            case "ZZZZZ":
+              // like Eastern Standard Time
+              return dt.zone.offsetName(dt.ts, {
+                format: "long",
+                locale: _this.loc.locale
+              });
+            // zone
+            case "z":
+              // like America/New_York
+              return dt.zoneName;
+            // meridiems
+            case "a":
+              return meridiem();
+            // dates
+            case "d":
+              return useDateTimeFormatter ? string({
+                day: "numeric"
+              }, "day") : _this.num(dt.day);
+            case "dd":
+              return useDateTimeFormatter ? string({
+                day: "2-digit"
+              }, "day") : _this.num(dt.day, 2);
+            // weekdays - standalone
+            case "c":
+              // like 1
+              return _this.num(dt.weekday);
+            case "ccc":
+              // like 'Tues'
+              return weekday("short", true);
+            case "cccc":
+              // like 'Tuesday'
+              return weekday("long", true);
+            case "ccccc":
+              // like 'T'
+              return weekday("narrow", true);
+            // weekdays - format
+            case "E":
+              // like 1
+              return _this.num(dt.weekday);
+            case "EEE":
+              // like 'Tues'
+              return weekday("short", false);
+            case "EEEE":
+              // like 'Tuesday'
+              return weekday("long", false);
+            case "EEEEE":
+              // like 'T'
+              return weekday("narrow", false);
+            // months - standalone
+            case "L":
+              // like 1
+              return useDateTimeFormatter ? string({
+                month: "numeric",
+                day: "numeric"
+              }, "month") : _this.num(dt.month);
+            case "LL":
+              // like 01, doesn't seem to work
+              return useDateTimeFormatter ? string({
+                month: "2-digit",
+                day: "numeric"
+              }, "month") : _this.num(dt.month, 2);
+            case "LLL":
+              // like Jan
+              return month("short", true);
+            case "LLLL":
+              // like January
+              return month("long", true);
+            case "LLLLL":
+              // like J
+              return month("narrow", true);
+            // months - format
+            case "M":
+              // like 1
+              return useDateTimeFormatter ? string({
+                month: "numeric"
+              }, "month") : _this.num(dt.month);
+            case "MM":
+              // like 01
+              return useDateTimeFormatter ? string({
+                month: "2-digit"
+              }, "month") : _this.num(dt.month, 2);
+            case "MMM":
+              // like Jan
+              return month("short", false);
+            case "MMMM":
+              // like January
+              return month("long", false);
+            case "MMMMM":
+              // like J
+              return month("narrow", false);
+            // years
+            case "y":
+              // like 2014
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year);
+            case "yy":
+              // like 14
+              return useDateTimeFormatter ? string({
+                year: "2-digit"
+              }, "year") : _this.num(dt.year.toString().slice(-2), 2);
+            case "yyyy":
+              // like 0012
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year, 4);
+            case "yyyyyy":
+              // like 000012
+              return useDateTimeFormatter ? string({
+                year: "numeric"
+              }, "year") : _this.num(dt.year, 6);
+            // eras
+            case "G":
+              // like AD
+              return era("short");
+            case "GG":
+              // like Anno Domini
+              return era("long");
+            case "GGGGG":
+              return era("narrow");
+            case "kk":
+              return _this.num(dt.weekYear.toString().slice(-2), 2);
+            case "kkkk":
+              return _this.num(dt.weekYear, 4);
+            case "W":
+              return _this.num(dt.weekNumber);
+            case "WW":
+              return _this.num(dt.weekNumber, 2);
+            case "n":
+              return _this.num(dt.localWeekNumber);
+            case "nn":
+              return _this.num(dt.localWeekNumber, 2);
+            case "ii":
+              return _this.num(dt.localWeekYear.toString().slice(-2), 2);
+            case "iiii":
+              return _this.num(dt.localWeekYear, 4);
+            case "o":
+              return _this.num(dt.ordinal);
+            case "ooo":
+              return _this.num(dt.ordinal, 3);
+            case "q":
+              // like 1
+              return _this.num(dt.quarter);
+            case "qq":
+              // like 01
+              return _this.num(dt.quarter, 2);
+            case "X":
+              return _this.num(Math.floor(dt.ts / 1000));
+            case "x":
+              return _this.num(dt.ts);
+            default:
+              return maybeMacro(token);
+          }
+        };
+      return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+    };
+    _proto.formatDurationFromString = function formatDurationFromString(dur, fmt) {
+      var _this2 = this;
+      var invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+      var tokenToField = function tokenToField(token) {
+          switch (token[0]) {
+            case "S":
+              return "milliseconds";
+            case "s":
+              return "seconds";
+            case "m":
+              return "minutes";
+            case "h":
+              return "hours";
+            case "d":
+              return "days";
+            case "w":
+              return "weeks";
+            case "M":
+              return "months";
+            case "y":
+              return "years";
+            default:
+              return null;
+          }
+        },
+        tokenToString = function tokenToString(lildur, info) {
+          return function (token) {
+            var mapped = tokenToField(token);
+            if (mapped) {
+              var inversionFactor = info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+              var signDisplay;
+              if (_this2.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+                signDisplay = "never";
+              } else if (_this2.opts.signMode === "all") {
+                signDisplay = "always";
+              } else {
+                // "auto" and "negative" are the same, but "auto" has better support
+                signDisplay = "auto";
+              }
+              return _this2.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+            } else {
+              return token;
+            }
+          };
+        },
+        tokens = Formatter.parseFormat(fmt),
+        realTokens = tokens.reduce(function (found, _ref) {
+          var literal = _ref.literal,
+            val = _ref.val;
+          return literal ? found : found.concat(val);
+        }, []),
+        collapsed = dur.shiftTo.apply(dur, realTokens.map(tokenToField).filter(function (t) {
+          return t;
+        })),
+        durationInfo = {
+          isNegativeDuration: collapsed < 0,
+          // this relies on "collapsed" being based on "shiftTo", which builds up the object
+          // in order
+          largestUnit: Object.keys(collapsed.values)[0]
+        };
+      return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+    };
+    return Formatter;
+  }();
+
+  /*
+   * This file handles parsing for well-specified formats. Here's how it works:
+   * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+   * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+   * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+   * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+   * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+   * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+   */
+
+  var ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+  function combineRegexes() {
+    for (var _len = arguments.length, regexes = new Array(_len), _key = 0; _key < _len; _key++) {
+      regexes[_key] = arguments[_key];
+    }
+    var full = regexes.reduce(function (f, r) {
+      return f + r.source;
+    }, "");
+    return RegExp("^" + full + "$");
+  }
+  function combineExtractors() {
+    for (var _len2 = arguments.length, extractors = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+      extractors[_key2] = arguments[_key2];
+    }
+    return function (m) {
+      return extractors.reduce(function (_ref, ex) {
+        var mergedVals = _ref[0],
+          mergedZone = _ref[1],
+          cursor = _ref[2];
+        var _ex = ex(m, cursor),
+          val = _ex[0],
+          zone = _ex[1],
+          next = _ex[2];
+        return [_extends({}, mergedVals, val), zone || mergedZone, next];
+      }, [{}, null, 1]).slice(0, 2);
+    };
+  }
+  function parse(s) {
+    if (s == null) {
+      return [null, null];
+    }
+    for (var _len3 = arguments.length, patterns = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
+      patterns[_key3 - 1] = arguments[_key3];
+    }
+    for (var _i = 0, _patterns = patterns; _i < _patterns.length; _i++) {
+      var _patterns$_i = _patterns[_i],
+        regex = _patterns$_i[0],
+        extractor = _patterns$_i[1];
+      var m = regex.exec(s);
+      if (m) {
+        return extractor(m);
+      }
+    }
+    return [null, null];
+  }
+  function simpleParse() {
+    for (var _len4 = arguments.length, keys = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {
+      keys[_key4] = arguments[_key4];
+    }
+    return function (match, cursor) {
+      var ret = {};
+      var i;
+      for (i = 0; i < keys.length; i++) {
+        ret[keys[i]] = parseInteger(match[cursor + i]);
+      }
+      return [ret, null, cursor + i];
+    };
+  }
+
+  // ISO and SQL parsing
+  var offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+  var isoExtendedZone = "(?:" + offsetRegex.source + "?(?:\\[(" + ianaRegex.source + ")\\])?)?";
+  var isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+  var isoTimeRegex = RegExp("" + isoTimeBaseRegex.source + isoExtendedZone);
+  var isoTimeExtensionRegex = RegExp("(?:[Tt]" + isoTimeRegex.source + ")?");
+  var isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+  var isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+  var isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+  var extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+  var extractISOOrdinalData = simpleParse("year", "ordinal");
+  var sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+  var sqlTimeRegex = RegExp(isoTimeBaseRegex.source + " ?(?:" + offsetRegex.source + "|(" + ianaRegex.source + "))?");
+  var sqlTimeExtensionRegex = RegExp("(?: " + sqlTimeRegex.source + ")?");
+  function int(match, pos, fallback) {
+    var m = match[pos];
+    return isUndefined(m) ? fallback : parseInteger(m);
+  }
+  function extractISOYmd(match, cursor) {
+    var item = {
+      year: int(match, cursor),
+      month: int(match, cursor + 1, 1),
+      day: int(match, cursor + 2, 1)
+    };
+    return [item, null, cursor + 3];
+  }
+  function extractISOTime(match, cursor) {
+    var item = {
+      hours: int(match, cursor, 0),
+      minutes: int(match, cursor + 1, 0),
+      seconds: int(match, cursor + 2, 0),
+      milliseconds: parseMillis(match[cursor + 3])
+    };
+    return [item, null, cursor + 4];
+  }
+  function extractISOOffset(match, cursor) {
+    var local = !match[cursor] && !match[cursor + 1],
+      fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+      zone = local ? null : FixedOffsetZone.instance(fullOffset);
+    return [{}, zone, cursor + 3];
+  }
+  function extractIANAZone(match, cursor) {
+    var zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+    return [{}, zone, cursor + 1];
+  }
+
+  // ISO time parsing
+
+  var isoTimeOnly = RegExp("^T?" + isoTimeBaseRegex.source + "$");
+
+  // ISO duration parsing
+
+  var isoDuration = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+  function extractISODuration(match) {
+    var s = match[0],
+      yearStr = match[1],
+      monthStr = match[2],
+      weekStr = match[3],
+      dayStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      millisecondsStr = match[8];
+    var hasNegativePrefix = s[0] === "-";
+    var negativeSeconds = secondStr && secondStr[0] === "-";
+    var maybeNegate = function maybeNegate(num, force) {
+      if (force === void 0) {
+        force = false;
+      }
+      return num !== undefined && (force || num && hasNegativePrefix) ? -num : num;
+    };
+    return [{
+      years: maybeNegate(parseFloating(yearStr)),
+      months: maybeNegate(parseFloating(monthStr)),
+      weeks: maybeNegate(parseFloating(weekStr)),
+      days: maybeNegate(parseFloating(dayStr)),
+      hours: maybeNegate(parseFloating(hourStr)),
+      minutes: maybeNegate(parseFloating(minuteStr)),
+      seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds)
+    }];
+  }
+
+  // These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+  // and not just that we're in -240 *right now*. But since I don't think these are used that often
+  // I'm just going to ignore that
+  var obsOffsets = {
+    GMT: 0,
+    EDT: -4 * 60,
+    EST: -5 * 60,
+    CDT: -5 * 60,
+    CST: -6 * 60,
+    MDT: -6 * 60,
+    MST: -7 * 60,
+    PDT: -7 * 60,
+    PST: -8 * 60
+  };
+  function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+    var result = {
+      year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+      month: monthsShort.indexOf(monthStr) + 1,
+      day: parseInteger(dayStr),
+      hour: parseInteger(hourStr),
+      minute: parseInteger(minuteStr)
+    };
+    if (secondStr) result.second = parseInteger(secondStr);
+    if (weekdayStr) {
+      result.weekday = weekdayStr.length > 3 ? weekdaysLong.indexOf(weekdayStr) + 1 : weekdaysShort.indexOf(weekdayStr) + 1;
+    }
+    return result;
+  }
+
+  // RFC 2822/5322
+  var rfc2822 = /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+  function extractRFC2822(match) {
+    var weekdayStr = match[1],
+      dayStr = match[2],
+      monthStr = match[3],
+      yearStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      obsOffset = match[8],
+      milOffset = match[9],
+      offHourStr = match[10],
+      offMinuteStr = match[11],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    var offset;
+    if (obsOffset) {
+      offset = obsOffsets[obsOffset];
+    } else if (milOffset) {
+      offset = 0;
+    } else {
+      offset = signedOffset(offHourStr, offMinuteStr);
+    }
+    return [result, new FixedOffsetZone(offset)];
+  }
+  function preprocessRFC2822(s) {
+    // Remove comments and folding whitespace and replace multiple-spaces with a single space
+    return s.replace(/\([^()]*\)|[\n\t]/g, " ").replace(/(\s\s+)/g, " ").trim();
+  }
+
+  // http date
+
+  var rfc1123 = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+    rfc850 = /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+    ascii = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+  function extractRFC1123Or850(match) {
+    var weekdayStr = match[1],
+      dayStr = match[2],
+      monthStr = match[3],
+      yearStr = match[4],
+      hourStr = match[5],
+      minuteStr = match[6],
+      secondStr = match[7],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    return [result, FixedOffsetZone.utcInstance];
+  }
+  function extractASCII(match) {
+    var weekdayStr = match[1],
+      monthStr = match[2],
+      dayStr = match[3],
+      hourStr = match[4],
+      minuteStr = match[5],
+      secondStr = match[6],
+      yearStr = match[7],
+      result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+    return [result, FixedOffsetZone.utcInstance];
+  }
+  var isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+  var isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+  var isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+  var isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+  var extractISOYmdTimeAndOffset = combineExtractors(extractISOYmd, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOWeekTimeAndOffset = combineExtractors(extractISOWeekData, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOOrdinalDateAndTime = combineExtractors(extractISOOrdinalData, extractISOTime, extractISOOffset, extractIANAZone);
+  var extractISOTimeAndOffset = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+
+  /*
+   * @private
+   */
+
+  function parseISODate(s) {
+    return parse(s, [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset], [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime], [isoTimeCombinedRegex, extractISOTimeAndOffset]);
+  }
+  function parseRFC2822Date(s) {
+    return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+  }
+  function parseHTTPDate(s) {
+    return parse(s, [rfc1123, extractRFC1123Or850], [rfc850, extractRFC1123Or850], [ascii, extractASCII]);
+  }
+  function parseISODuration(s) {
+    return parse(s, [isoDuration, extractISODuration]);
+  }
+  var extractISOTimeOnly = combineExtractors(extractISOTime);
+  function parseISOTimeOnly(s) {
+    return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+  }
+  var sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+  var sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+  var extractISOTimeOffsetAndIANAZone = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+  function parseSQL(s) {
+    return parse(s, [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]);
+  }
+
+  var INVALID$2 = "Invalid Duration";
+
+  // unit conversion constants
+  var lowOrderMatrix = {
+      weeks: {
+        days: 7,
+        hours: 7 * 24,
+        minutes: 7 * 24 * 60,
+        seconds: 7 * 24 * 60 * 60,
+        milliseconds: 7 * 24 * 60 * 60 * 1000
+      },
+      days: {
+        hours: 24,
+        minutes: 24 * 60,
+        seconds: 24 * 60 * 60,
+        milliseconds: 24 * 60 * 60 * 1000
+      },
+      hours: {
+        minutes: 60,
+        seconds: 60 * 60,
+        milliseconds: 60 * 60 * 1000
+      },
+      minutes: {
+        seconds: 60,
+        milliseconds: 60 * 1000
+      },
+      seconds: {
+        milliseconds: 1000
+      }
+    },
+    casualMatrix = _extends({
+      years: {
+        quarters: 4,
+        months: 12,
+        weeks: 52,
+        days: 365,
+        hours: 365 * 24,
+        minutes: 365 * 24 * 60,
+        seconds: 365 * 24 * 60 * 60,
+        milliseconds: 365 * 24 * 60 * 60 * 1000
+      },
+      quarters: {
+        months: 3,
+        weeks: 13,
+        days: 91,
+        hours: 91 * 24,
+        minutes: 91 * 24 * 60,
+        seconds: 91 * 24 * 60 * 60,
+        milliseconds: 91 * 24 * 60 * 60 * 1000
+      },
+      months: {
+        weeks: 4,
+        days: 30,
+        hours: 30 * 24,
+        minutes: 30 * 24 * 60,
+        seconds: 30 * 24 * 60 * 60,
+        milliseconds: 30 * 24 * 60 * 60 * 1000
+      }
+    }, lowOrderMatrix),
+    daysInYearAccurate = 146097.0 / 400,
+    daysInMonthAccurate = 146097.0 / 4800,
+    accurateMatrix = _extends({
+      years: {
+        quarters: 4,
+        months: 12,
+        weeks: daysInYearAccurate / 7,
+        days: daysInYearAccurate,
+        hours: daysInYearAccurate * 24,
+        minutes: daysInYearAccurate * 24 * 60,
+        seconds: daysInYearAccurate * 24 * 60 * 60,
+        milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000
+      },
+      quarters: {
+        months: 3,
+        weeks: daysInYearAccurate / 28,
+        days: daysInYearAccurate / 4,
+        hours: daysInYearAccurate * 24 / 4,
+        minutes: daysInYearAccurate * 24 * 60 / 4,
+        seconds: daysInYearAccurate * 24 * 60 * 60 / 4,
+        milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000 / 4
+      },
+      months: {
+        weeks: daysInMonthAccurate / 7,
+        days: daysInMonthAccurate,
+        hours: daysInMonthAccurate * 24,
+        minutes: daysInMonthAccurate * 24 * 60,
+        seconds: daysInMonthAccurate * 24 * 60 * 60,
+        milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000
+      }
+    }, lowOrderMatrix);
+
+  // units ordered by size
+  var orderedUnits$1 = ["years", "quarters", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds"];
+  var reverseUnits = orderedUnits$1.slice(0).reverse();
+
+  // clone really means "create another instance just like this one, but with these changes"
+  function clone$1(dur, alts, clear) {
+    if (clear === void 0) {
+      clear = false;
+    }
+    // deep merge for vals
+    var conf = {
+      values: clear ? alts.values : _extends({}, dur.values, alts.values || {}),
+      loc: dur.loc.clone(alts.loc),
+      conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+      matrix: alts.matrix || dur.matrix
+    };
+    return new Duration(conf);
+  }
+  function durationToMillis(matrix, vals) {
+    var _vals$milliseconds;
+    var sum = (_vals$milliseconds = vals.milliseconds) != null ? _vals$milliseconds : 0;
+    for (var _iterator = _createForOfIteratorHelperLoose(reverseUnits.slice(1)), _step; !(_step = _iterator()).done;) {
+      var unit = _step.value;
+      if (vals[unit]) {
+        sum += vals[unit] * matrix[unit]["milliseconds"];
+      }
+    }
+    return sum;
+  }
+
+  // NB: mutates parameters
+  function normalizeValues(matrix, vals) {
+    // the logic below assumes the overall value of the duration is positive
+    // if this is not the case, factor is used to make it so
+    var factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+    orderedUnits$1.reduceRight(function (previous, current) {
+      if (!isUndefined(vals[current])) {
+        if (previous) {
+          var previousVal = vals[previous] * factor;
+          var conv = matrix[current][previous];
+
+          // if (previousVal < 0):
+          // lower order unit is negative (e.g. { years: 2, days: -2 })
+          // normalize this by reducing the higher order unit by the appropriate amount
+          // and increasing the lower order unit
+          // this can never make the higher order unit negative, because this function only operates
+          // on positive durations, so the amount of time represented by the lower order unit cannot
+          // be larger than the higher order unit
+          // else:
+          // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+          // in this case we attempt to convert as much as possible from the lower order unit into
+          // the higher order one
+          //
+          // Math.floor takes care of both of these cases, rounding away from 0
+          // if previousVal < 0 it makes the absolute value larger
+          // if previousVal >= it makes the absolute value smaller
+          var rollUp = Math.floor(previousVal / conv);
+          vals[current] += rollUp * factor;
+          vals[previous] -= rollUp * conv * factor;
+        }
+        return current;
+      } else {
+        return previous;
+      }
+    }, null);
+
+    // try to convert any decimals into smaller units if possible
+    // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+    orderedUnits$1.reduce(function (previous, current) {
+      if (!isUndefined(vals[current])) {
+        if (previous) {
+          var fraction = vals[previous] % 1;
+          vals[previous] -= fraction;
+          vals[current] += fraction * matrix[previous][current];
+        }
+        return current;
+      } else {
+        return previous;
+      }
+    }, null);
+  }
+
+  // Remove all properties with a value of 0 from an object
+  function removeZeroes(vals) {
+    var newVals = {};
+    for (var _i = 0, _Object$entries = Object.entries(vals); _i < _Object$entries.length; _i++) {
+      var _Object$entries$_i = _Object$entries[_i],
+        key = _Object$entries$_i[0],
+        value = _Object$entries$_i[1];
+      if (value !== 0) {
+        newVals[key] = value;
+      }
+    }
+    return newVals;
+  }
+
+  /**
+   * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+   *
+   * Here is a brief overview of commonly used methods and getters in Duration:
+   *
+   * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+   * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+   * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+   * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+   * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+   *
+   * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+   */
+  var Duration = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @private
+     */
+    function Duration(config) {
+      var accurate = config.conversionAccuracy === "longterm" || false;
+      var matrix = accurate ? accurateMatrix : casualMatrix;
+      if (config.matrix) {
+        matrix = config.matrix;
+      }
+
+      /**
+       * @access private
+       */
+      this.values = config.values;
+      /**
+       * @access private
+       */
+      this.loc = config.loc || Locale.create();
+      /**
+       * @access private
+       */
+      this.conversionAccuracy = accurate ? "longterm" : "casual";
+      /**
+       * @access private
+       */
+      this.invalid = config.invalid || null;
+      /**
+       * @access private
+       */
+      this.matrix = matrix;
+      /**
+       * @access private
+       */
+      this.isLuxonDuration = true;
+    }
+
+    /**
+     * Create Duration from a number of milliseconds.
+     * @param {number} count of milliseconds
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @return {Duration}
+     */
+    Duration.fromMillis = function fromMillis(count, opts) {
+      return Duration.fromObject({
+        milliseconds: count
+      }, opts);
+    }
+
+    /**
+     * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+     * If this object is empty then a zero milliseconds duration is returned.
+     * @param {Object} obj - the object to create the DateTime from
+     * @param {number} obj.years
+     * @param {number} obj.quarters
+     * @param {number} obj.months
+     * @param {number} obj.weeks
+     * @param {number} obj.days
+     * @param {number} obj.hours
+     * @param {number} obj.minutes
+     * @param {number} obj.seconds
+     * @param {number} obj.milliseconds
+     * @param {Object} [opts=[]] - options for creating this Duration
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the custom conversion system to use
+     * @return {Duration}
+     */;
+    Duration.fromObject = function fromObject(obj, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (obj == null || typeof obj !== "object") {
+        throw new InvalidArgumentError("Duration.fromObject: argument expected to be an object, got " + (obj === null ? "null" : typeof obj));
+      }
+      return new Duration({
+        values: normalizeObject(obj, Duration.normalizeUnit),
+        loc: Locale.fromObject(opts),
+        conversionAccuracy: opts.conversionAccuracy,
+        matrix: opts.matrix
+      });
+    }
+
+    /**
+     * Create a Duration from DurationLike.
+     *
+     * @param {Object | number | Duration} durationLike
+     * One of:
+     * - object with keys like 'years' and 'hours'.
+     * - number representing milliseconds
+     * - Duration instance
+     * @return {Duration}
+     */;
+    Duration.fromDurationLike = function fromDurationLike(durationLike) {
+      if (isNumber(durationLike)) {
+        return Duration.fromMillis(durationLike);
+      } else if (Duration.isDuration(durationLike)) {
+        return durationLike;
+      } else if (typeof durationLike === "object") {
+        return Duration.fromObject(durationLike);
+      } else {
+        throw new InvalidArgumentError("Unknown duration argument " + durationLike + " of type " + typeof durationLike);
+      }
+    }
+
+    /**
+     * Create a Duration from an ISO 8601 duration string.
+     * @param {string} text - text to parse
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the preset conversion system to use
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+     * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+     * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+     * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+     * @return {Duration}
+     */;
+    Duration.fromISO = function fromISO(text, opts) {
+      var _parseISODuration = parseISODuration(text),
+        parsed = _parseISODuration[0];
+      if (parsed) {
+        return Duration.fromObject(parsed, opts);
+      } else {
+        return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+      }
+    }
+
+    /**
+     * Create a Duration from an ISO 8601 time string.
+     * @param {string} text - text to parse
+     * @param {Object} opts - options for parsing
+     * @param {string} [opts.locale='en-US'] - the locale to use
+     * @param {string} opts.numberingSystem - the numbering system to use
+     * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+     * @param {string} [opts.matrix=Object] - the conversion system to use
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+     * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+     * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+     * @return {Duration}
+     */;
+    Duration.fromISOTime = function fromISOTime(text, opts) {
+      var _parseISOTimeOnly = parseISOTimeOnly(text),
+        parsed = _parseISOTimeOnly[0];
+      if (parsed) {
+        return Duration.fromObject(parsed, opts);
+      } else {
+        return Duration.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+      }
+    }
+
+    /**
+     * Create an invalid Duration.
+     * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {Duration}
+     */;
+    Duration.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidDurationError(invalid);
+      } else {
+        return new Duration({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * @private
+     */;
+    Duration.normalizeUnit = function normalizeUnit(unit) {
+      var normalized = {
+        year: "years",
+        years: "years",
+        quarter: "quarters",
+        quarters: "quarters",
+        month: "months",
+        months: "months",
+        week: "weeks",
+        weeks: "weeks",
+        day: "days",
+        days: "days",
+        hour: "hours",
+        hours: "hours",
+        minute: "minutes",
+        minutes: "minutes",
+        second: "seconds",
+        seconds: "seconds",
+        millisecond: "milliseconds",
+        milliseconds: "milliseconds"
+      }[unit ? unit.toLowerCase() : unit];
+      if (!normalized) throw new InvalidUnitError(unit);
+      return normalized;
+    }
+
+    /**
+     * Check if an object is a Duration. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    Duration.isDuration = function isDuration(o) {
+      return o && o.isLuxonDuration || false;
+    }
+
+    /**
+     * Get  the locale of a Duration, such 'en-GB'
+     * @type {string}
+     */;
+    var _proto = Duration.prototype;
+    /**
+     * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+     * * `S` for milliseconds
+     * * `s` for seconds
+     * * `m` for minutes
+     * * `h` for hours
+     * * `d` for days
+     * * `w` for weeks
+     * * `M` for months
+     * * `y` for years
+     * Notes:
+     * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+     * * Tokens can be escaped by wrapping with single quotes.
+     * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+     * @param {string} fmt - the format string
+     * @param {Object} opts - options
+     * @param {boolean} [opts.floor=true] - floor numerical values
+     * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+     * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+     * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+     * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+     * @return {string}
+     */
+    _proto.toFormat = function toFormat(fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+      var fmtOpts = _extends({}, opts, {
+        floor: opts.round !== false && opts.floor !== false
+      });
+      return this.isValid ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt) : INVALID$2;
+    }
+
+    /**
+     * Returns a string representation of a Duration with all units included.
+     * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+     * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+     * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+     * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+     * @example
+     * ```js
+     * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+     * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+     * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+     * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+     * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+     * ```
+     */;
+    _proto.toHuman = function toHuman(opts) {
+      var _this = this;
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return INVALID$2;
+      var showZeros = opts.showZeros !== false;
+      var l = orderedUnits$1.map(function (unit) {
+        var val = _this.values[unit];
+        if (isUndefined(val) || val === 0 && !showZeros) {
+          return null;
+        }
+        return _this.loc.numberFormatter(_extends({
+          style: "unit",
+          unitDisplay: "long"
+        }, opts, {
+          unit: unit.slice(0, -1)
+        })).format(val);
+      }).filter(function (n) {
+        return n;
+      });
+      return this.loc.listFormatter(_extends({
+        type: "conjunction",
+        style: opts.listStyle || "narrow"
+      }, opts)).format(l);
+    }
+
+    /**
+     * Returns a JavaScript object with this Duration's values.
+     * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+     * @return {Object}
+     */;
+    _proto.toObject = function toObject() {
+      if (!this.isValid) return {};
+      return _extends({}, this.values);
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Duration.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+     * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+     * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+     * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+     * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+     * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+     * @return {string}
+     */;
+    _proto.toISO = function toISO() {
+      // we could use the formatter, but this is an easier way to get the minimum string
+      if (!this.isValid) return null;
+      var s = "P";
+      if (this.years !== 0) s += this.years + "Y";
+      if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+      if (this.weeks !== 0) s += this.weeks + "W";
+      if (this.days !== 0) s += this.days + "D";
+      if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0) s += "T";
+      if (this.hours !== 0) s += this.hours + "H";
+      if (this.minutes !== 0) s += this.minutes + "M";
+      if (this.seconds !== 0 || this.milliseconds !== 0)
+        // this will handle "floating point madness" by removing extra decimal places
+        // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+        s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+      if (s === "P") s += "T0S";
+      return s;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+     * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+     * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return null;
+      var millis = this.toMillis();
+      if (millis < 0 || millis >= 86400000) return null;
+      opts = _extends({
+        suppressMilliseconds: false,
+        suppressSeconds: false,
+        includePrefix: false,
+        format: "extended"
+      }, opts, {
+        includeOffset: false
+      });
+      var dateTime = DateTime.fromMillis(millis, {
+        zone: "UTC"
+      });
+      return dateTime.toISOTime(opts);
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+     * @return {string}
+     */;
+    _proto.toJSON = function toJSON() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns a string representation of this Duration appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "Duration { values: " + JSON.stringify(this.values) + " }";
+      } else {
+        return "Duration { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns an milliseconds value of this Duration.
+     * @return {number}
+     */;
+    _proto.toMillis = function toMillis() {
+      if (!this.isValid) return NaN;
+      return durationToMillis(this.matrix, this.values);
+    }
+
+    /**
+     * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+     * @return {number}
+     */;
+    _proto.valueOf = function valueOf() {
+      return this.toMillis();
+    }
+
+    /**
+     * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+     * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @return {Duration}
+     */;
+    _proto.plus = function plus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration),
+        result = {};
+      for (var _i2 = 0, _orderedUnits = orderedUnits$1; _i2 < _orderedUnits.length; _i2++) {
+        var k = _orderedUnits[_i2];
+        if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+          result[k] = dur.get(k) + this.get(k);
+        }
+      }
+      return clone$1(this, {
+        values: result
+      }, true);
+    }
+
+    /**
+     * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+     * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @return {Duration}
+     */;
+    _proto.minus = function minus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration);
+      return this.plus(dur.negate());
+    }
+
+    /**
+     * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+     * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+     * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+     * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+     * @return {Duration}
+     */;
+    _proto.mapUnits = function mapUnits(fn) {
+      if (!this.isValid) return this;
+      var result = {};
+      for (var _i3 = 0, _Object$keys = Object.keys(this.values); _i3 < _Object$keys.length; _i3++) {
+        var k = _Object$keys[_i3];
+        result[k] = asNumber(fn(this.values[k], k));
+      }
+      return clone$1(this, {
+        values: result
+      }, true);
+    }
+
+    /**
+     * Get the value of unit.
+     * @param {string} unit - a unit such as 'minute' or 'day'
+     * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+     * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+     * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+     * @return {number}
+     */;
+    _proto.get = function get(unit) {
+      return this[Duration.normalizeUnit(unit)];
+    }
+
+    /**
+     * "Set" the values of specified units. Return a newly-constructed Duration.
+     * @param {Object} values - a mapping of units to numbers
+     * @example dur.set({ years: 2017 })
+     * @example dur.set({ hours: 8, minutes: 30 })
+     * @return {Duration}
+     */;
+    _proto.set = function set(values) {
+      if (!this.isValid) return this;
+      var mixed = _extends({}, this.values, normalizeObject(values, Duration.normalizeUnit));
+      return clone$1(this, {
+        values: mixed
+      });
+    }
+
+    /**
+     * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+     * @example dur.reconfigure({ locale: 'en-GB' })
+     * @return {Duration}
+     */;
+    _proto.reconfigure = function reconfigure(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        locale = _ref.locale,
+        numberingSystem = _ref.numberingSystem,
+        conversionAccuracy = _ref.conversionAccuracy,
+        matrix = _ref.matrix;
+      var loc = this.loc.clone({
+        locale: locale,
+        numberingSystem: numberingSystem
+      });
+      var opts = {
+        loc: loc,
+        matrix: matrix,
+        conversionAccuracy: conversionAccuracy
+      };
+      return clone$1(this, opts);
+    }
+
+    /**
+     * Return the length of the duration in the specified unit.
+     * @param {string} unit - a unit such as 'minutes' or 'days'
+     * @example Duration.fromObject({years: 1}).as('days') //=> 365
+     * @example Duration.fromObject({years: 1}).as('months') //=> 12
+     * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+     * @return {number}
+     */;
+    _proto.as = function as(unit) {
+      return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+    }
+
+    /**
+     * Reduce this Duration to its canonical representation in its current units.
+     * Assuming the overall value of the Duration is positive, this means:
+     * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+     * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+     *   the overall value would be negative, see third example)
+     * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+     *
+     * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+     * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+     * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+     * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+     * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+     * @return {Duration}
+     */;
+    _proto.normalize = function normalize() {
+      if (!this.isValid) return this;
+      var vals = this.toObject();
+      normalizeValues(this.matrix, vals);
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Rescale units to its largest representation
+     * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+     * @return {Duration}
+     */;
+    _proto.rescale = function rescale() {
+      if (!this.isValid) return this;
+      var vals = removeZeroes(this.normalize().shiftToAll().toObject());
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Convert this Duration into its representation in a different set of units.
+     * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+     * @return {Duration}
+     */;
+    _proto.shiftTo = function shiftTo() {
+      for (var _len = arguments.length, units = new Array(_len), _key = 0; _key < _len; _key++) {
+        units[_key] = arguments[_key];
+      }
+      if (!this.isValid) return this;
+      if (units.length === 0) {
+        return this;
+      }
+      units = units.map(function (u) {
+        return Duration.normalizeUnit(u);
+      });
+      var built = {},
+        accumulated = {},
+        vals = this.toObject();
+      var lastUnit;
+      for (var _i4 = 0, _orderedUnits2 = orderedUnits$1; _i4 < _orderedUnits2.length; _i4++) {
+        var k = _orderedUnits2[_i4];
+        if (units.indexOf(k) >= 0) {
+          lastUnit = k;
+          var own = 0;
+
+          // anything we haven't boiled down yet should get boiled to this unit
+          for (var ak in accumulated) {
+            own += this.matrix[ak][k] * accumulated[ak];
+            accumulated[ak] = 0;
+          }
+
+          // plus anything that's already in this unit
+          if (isNumber(vals[k])) {
+            own += vals[k];
+          }
+
+          // only keep the integer part for now in the hopes of putting any decimal part
+          // into a smaller unit later
+          var i = Math.trunc(own);
+          built[k] = i;
+          accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+          // otherwise, keep it in the wings to boil it later
+        } else if (isNumber(vals[k])) {
+          accumulated[k] = vals[k];
+        }
+      }
+
+      // anything leftover becomes the decimal for the last unit
+      // lastUnit must be defined since units is not empty
+      for (var key in accumulated) {
+        if (accumulated[key] !== 0) {
+          built[lastUnit] += key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+        }
+      }
+      normalizeValues(this.matrix, built);
+      return clone$1(this, {
+        values: built
+      }, true);
+    }
+
+    /**
+     * Shift this Duration to all available units.
+     * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+     * @return {Duration}
+     */;
+    _proto.shiftToAll = function shiftToAll() {
+      if (!this.isValid) return this;
+      return this.shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds");
+    }
+
+    /**
+     * Return the negative of this Duration.
+     * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+     * @return {Duration}
+     */;
+    _proto.negate = function negate() {
+      if (!this.isValid) return this;
+      var negated = {};
+      for (var _i5 = 0, _Object$keys2 = Object.keys(this.values); _i5 < _Object$keys2.length; _i5++) {
+        var k = _Object$keys2[_i5];
+        negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+      }
+      return clone$1(this, {
+        values: negated
+      }, true);
+    }
+
+    /**
+     * Removes all units with values equal to 0 from this Duration.
+     * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+     * @return {Duration}
+     */;
+    _proto.removeZeros = function removeZeros() {
+      if (!this.isValid) return this;
+      var vals = removeZeroes(this.values);
+      return clone$1(this, {
+        values: vals
+      }, true);
+    }
+
+    /**
+     * Get the years.
+     * @type {number}
+     */;
+    /**
+     * Equality check
+     * Two Durations are equal iff they have the same units and the same values for each unit.
+     * @param {Duration} other
+     * @return {boolean}
+     */
+    _proto.equals = function equals(other) {
+      if (!this.isValid || !other.isValid) {
+        return false;
+      }
+      if (!this.loc.equals(other.loc)) {
+        return false;
+      }
+      function eq(v1, v2) {
+        // Consider 0 and undefined as equal
+        if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+        return v1 === v2;
+      }
+      for (var _i6 = 0, _orderedUnits3 = orderedUnits$1; _i6 < _orderedUnits3.length; _i6++) {
+        var u = _orderedUnits3[_i6];
+        if (!eq(this.values[u], other.values[u])) {
+          return false;
+        }
+      }
+      return true;
+    };
+    _createClass(Duration, [{
+      key: "locale",
+      get: function get() {
+        return this.isValid ? this.loc.locale : null;
+      }
+
+      /**
+       * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+       *
+       * @type {string}
+       */
+    }, {
+      key: "numberingSystem",
+      get: function get() {
+        return this.isValid ? this.loc.numberingSystem : null;
+      }
+    }, {
+      key: "years",
+      get: function get() {
+        return this.isValid ? this.values.years || 0 : NaN;
+      }
+
+      /**
+       * Get the quarters.
+       * @type {number}
+       */
+    }, {
+      key: "quarters",
+      get: function get() {
+        return this.isValid ? this.values.quarters || 0 : NaN;
+      }
+
+      /**
+       * Get the months.
+       * @type {number}
+       */
+    }, {
+      key: "months",
+      get: function get() {
+        return this.isValid ? this.values.months || 0 : NaN;
+      }
+
+      /**
+       * Get the weeks
+       * @type {number}
+       */
+    }, {
+      key: "weeks",
+      get: function get() {
+        return this.isValid ? this.values.weeks || 0 : NaN;
+      }
+
+      /**
+       * Get the days.
+       * @type {number}
+       */
+    }, {
+      key: "days",
+      get: function get() {
+        return this.isValid ? this.values.days || 0 : NaN;
+      }
+
+      /**
+       * Get the hours.
+       * @type {number}
+       */
+    }, {
+      key: "hours",
+      get: function get() {
+        return this.isValid ? this.values.hours || 0 : NaN;
+      }
+
+      /**
+       * Get the minutes.
+       * @type {number}
+       */
+    }, {
+      key: "minutes",
+      get: function get() {
+        return this.isValid ? this.values.minutes || 0 : NaN;
+      }
+
+      /**
+       * Get the seconds.
+       * @return {number}
+       */
+    }, {
+      key: "seconds",
+      get: function get() {
+        return this.isValid ? this.values.seconds || 0 : NaN;
+      }
+
+      /**
+       * Get the milliseconds.
+       * @return {number}
+       */
+    }, {
+      key: "milliseconds",
+      get: function get() {
+        return this.isValid ? this.values.milliseconds || 0 : NaN;
+      }
+
+      /**
+       * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+       * on invalid DateTimes or Intervals.
+       * @return {boolean}
+       */
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.invalid === null;
+      }
+
+      /**
+       * Returns an error code if this Duration became invalid, or null if the Duration is valid
+       * @return {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+    }]);
+    return Duration;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+
+  var INVALID$1 = "Invalid Interval";
+
+  // checks if the start is equal to or before the end
+  function validateStartEnd(start, end) {
+    if (!start || !start.isValid) {
+      return Interval.invalid("missing or invalid start");
+    } else if (!end || !end.isValid) {
+      return Interval.invalid("missing or invalid end");
+    } else if (end < start) {
+      return Interval.invalid("end before start", "The end of an interval must be after its start, but you had start=" + start.toISO() + " and end=" + end.toISO());
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+   *
+   * Here is a brief overview of the most commonly used methods and getters in Interval:
+   *
+   * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+   * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+   * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+   * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+   * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+   * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+   */
+  var Interval = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @private
+     */
+    function Interval(config) {
+      /**
+       * @access private
+       */
+      this.s = config.start;
+      /**
+       * @access private
+       */
+      this.e = config.end;
+      /**
+       * @access private
+       */
+      this.invalid = config.invalid || null;
+      /**
+       * @access private
+       */
+      this.isLuxonInterval = true;
+    }
+
+    /**
+     * Create an invalid Interval.
+     * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {Interval}
+     */
+    Interval.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidIntervalError(invalid);
+      } else {
+        return new Interval({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+     * @param {DateTime|Date|Object} start
+     * @param {DateTime|Date|Object} end
+     * @return {Interval}
+     */;
+    Interval.fromDateTimes = function fromDateTimes(start, end) {
+      var builtStart = friendlyDateTime(start),
+        builtEnd = friendlyDateTime(end);
+      var validateError = validateStartEnd(builtStart, builtEnd);
+      if (validateError == null) {
+        return new Interval({
+          start: builtStart,
+          end: builtEnd
+        });
+      } else {
+        return validateError;
+      }
+    }
+
+    /**
+     * Create an Interval from a start DateTime and a Duration to extend to.
+     * @param {DateTime|Date|Object} start
+     * @param {Duration|Object|number} duration - the length of the Interval.
+     * @return {Interval}
+     */;
+    Interval.after = function after(start, duration) {
+      var dur = Duration.fromDurationLike(duration),
+        dt = friendlyDateTime(start);
+      return Interval.fromDateTimes(dt, dt.plus(dur));
+    }
+
+    /**
+     * Create an Interval from an end DateTime and a Duration to extend backwards to.
+     * @param {DateTime|Date|Object} end
+     * @param {Duration|Object|number} duration - the length of the Interval.
+     * @return {Interval}
+     */;
+    Interval.before = function before(end, duration) {
+      var dur = Duration.fromDurationLike(duration),
+        dt = friendlyDateTime(end);
+      return Interval.fromDateTimes(dt.minus(dur), dt);
+    }
+
+    /**
+     * Create an Interval from an ISO 8601 string.
+     * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+     * @param {string} text - the ISO string to parse
+     * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @return {Interval}
+     */;
+    Interval.fromISO = function fromISO(text, opts) {
+      var _split = (text || "").split("/", 2),
+        s = _split[0],
+        e = _split[1];
+      if (s && e) {
+        var start, startIsValid;
+        try {
+          start = DateTime.fromISO(s, opts);
+          startIsValid = start.isValid;
+        } catch (e) {
+          startIsValid = false;
+        }
+        var end, endIsValid;
+        try {
+          end = DateTime.fromISO(e, opts);
+          endIsValid = end.isValid;
+        } catch (e) {
+          endIsValid = false;
+        }
+        if (startIsValid && endIsValid) {
+          return Interval.fromDateTimes(start, end);
+        }
+        if (startIsValid) {
+          var dur = Duration.fromISO(e, opts);
+          if (dur.isValid) {
+            return Interval.after(start, dur);
+          }
+        } else if (endIsValid) {
+          var _dur = Duration.fromISO(s, opts);
+          if (_dur.isValid) {
+            return Interval.before(end, _dur);
+          }
+        }
+      }
+      return Interval.invalid("unparsable", "the input \"" + text + "\" can't be parsed as ISO 8601");
+    }
+
+    /**
+     * Check if an object is an Interval. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    Interval.isInterval = function isInterval(o) {
+      return o && o.isLuxonInterval || false;
+    }
+
+    /**
+     * Returns the start of the Interval
+     * @type {DateTime}
+     */;
+    var _proto = Interval.prototype;
+    /**
+     * Returns the length of the Interval in the specified unit.
+     * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+     * @return {number}
+     */
+    _proto.length = function length(unit) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      return this.isValid ? this.toDuration.apply(this, [unit]).get(unit) : NaN;
+    }
+
+    /**
+     * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+     * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+     * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+     * @param {string} [unit='milliseconds'] - the unit of time to count.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+     * @return {number}
+     */;
+    _proto.count = function count(unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (!this.isValid) return NaN;
+      var start = this.start.startOf(unit, opts);
+      var end;
+      if (opts != null && opts.useLocaleWeeks) {
+        end = this.end.reconfigure({
+          locale: start.locale
+        });
+      } else {
+        end = this.end;
+      }
+      end = end.startOf(unit, opts);
+      return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+    }
+
+    /**
+     * Returns whether this Interval's start and end are both in the same unit of time
+     * @param {string} unit - the unit of time to check sameness on
+     * @return {boolean}
+     */;
+    _proto.hasSame = function hasSame(unit) {
+      return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+    }
+
+    /**
+     * Return whether this Interval has the same start and end DateTimes.
+     * @return {boolean}
+     */;
+    _proto.isEmpty = function isEmpty() {
+      return this.s.valueOf() === this.e.valueOf();
+    }
+
+    /**
+     * Return whether this Interval's start is after the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.isAfter = function isAfter(dateTime) {
+      if (!this.isValid) return false;
+      return this.s > dateTime;
+    }
+
+    /**
+     * Return whether this Interval's end is before the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.isBefore = function isBefore(dateTime) {
+      if (!this.isValid) return false;
+      return this.e <= dateTime;
+    }
+
+    /**
+     * Return whether this Interval contains the specified DateTime.
+     * @param {DateTime} dateTime
+     * @return {boolean}
+     */;
+    _proto.contains = function contains(dateTime) {
+      if (!this.isValid) return false;
+      return this.s <= dateTime && this.e > dateTime;
+    }
+
+    /**
+     * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+     * @param {Object} values - the values to set
+     * @param {DateTime} values.start - the starting DateTime
+     * @param {DateTime} values.end - the ending DateTime
+     * @return {Interval}
+     */;
+    _proto.set = function set(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        start = _ref.start,
+        end = _ref.end;
+      if (!this.isValid) return this;
+      return Interval.fromDateTimes(start || this.s, end || this.e);
+    }
+
+    /**
+     * Split this Interval at each of the specified DateTimes
+     * @param {...DateTime} dateTimes - the unit of time to count.
+     * @return {Array}
+     */;
+    _proto.splitAt = function splitAt() {
+      var _this = this;
+      if (!this.isValid) return [];
+      for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+        dateTimes[_key] = arguments[_key];
+      }
+      var sorted = dateTimes.map(friendlyDateTime).filter(function (d) {
+          return _this.contains(d);
+        }).sort(function (a, b) {
+          return a.toMillis() - b.toMillis();
+        }),
+        results = [];
+      var s = this.s,
+        i = 0;
+      while (s < this.e) {
+        var added = sorted[i] || this.e,
+          next = +added > +this.e ? this.e : added;
+        results.push(Interval.fromDateTimes(s, next));
+        s = next;
+        i += 1;
+      }
+      return results;
+    }
+
+    /**
+     * Split this Interval into smaller Intervals, each of the specified length.
+     * Left over time is grouped into a smaller interval
+     * @param {Duration|Object|number} duration - The length of each resulting interval.
+     * @return {Array}
+     */;
+    _proto.splitBy = function splitBy(duration) {
+      var dur = Duration.fromDurationLike(duration);
+      if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+        return [];
+      }
+      var s = this.s,
+        idx = 1,
+        next;
+      var results = [];
+      while (s < this.e) {
+        var added = this.start.plus(dur.mapUnits(function (x) {
+          return x * idx;
+        }));
+        next = +added > +this.e ? this.e : added;
+        results.push(Interval.fromDateTimes(s, next));
+        s = next;
+        idx += 1;
+      }
+      return results;
+    }
+
+    /**
+     * Split this Interval into the specified number of smaller intervals.
+     * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+     * @return {Array}
+     */;
+    _proto.divideEqually = function divideEqually(numberOfParts) {
+      if (!this.isValid) return [];
+      return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+    }
+
+    /**
+     * Return whether this Interval overlaps with the specified Interval
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.overlaps = function overlaps(other) {
+      return this.e > other.s && this.s < other.e;
+    }
+
+    /**
+     * Return whether this Interval's end is adjacent to the specified Interval's start.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.abutsStart = function abutsStart(other) {
+      if (!this.isValid) return false;
+      return +this.e === +other.s;
+    }
+
+    /**
+     * Return whether this Interval's start is adjacent to the specified Interval's end.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.abutsEnd = function abutsEnd(other) {
+      if (!this.isValid) return false;
+      return +other.e === +this.s;
+    }
+
+    /**
+     * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.engulfs = function engulfs(other) {
+      if (!this.isValid) return false;
+      return this.s <= other.s && this.e >= other.e;
+    }
+
+    /**
+     * Return whether this Interval has the same start and end as the specified Interval.
+     * @param {Interval} other
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(other) {
+      if (!this.isValid || !other.isValid) {
+        return false;
+      }
+      return this.s.equals(other.s) && this.e.equals(other.e);
+    }
+
+    /**
+     * Return an Interval representing the intersection of this Interval and the specified Interval.
+     * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+     * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+     * @param {Interval} other
+     * @return {Interval}
+     */;
+    _proto.intersection = function intersection(other) {
+      if (!this.isValid) return this;
+      var s = this.s > other.s ? this.s : other.s,
+        e = this.e < other.e ? this.e : other.e;
+      if (s >= e) {
+        return null;
+      } else {
+        return Interval.fromDateTimes(s, e);
+      }
+    }
+
+    /**
+     * Return an Interval representing the union of this Interval and the specified Interval.
+     * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+     * @param {Interval} other
+     * @return {Interval}
+     */;
+    _proto.union = function union(other) {
+      if (!this.isValid) return this;
+      var s = this.s < other.s ? this.s : other.s,
+        e = this.e > other.e ? this.e : other.e;
+      return Interval.fromDateTimes(s, e);
+    }
+
+    /**
+     * Merge an array of Intervals into an equivalent minimal set of Intervals.
+     * Combines overlapping and adjacent Intervals.
+     * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+     * and ending with the latest.
+     *
+     * @param {Array} intervals
+     * @return {Array}
+     */;
+    Interval.merge = function merge(intervals) {
+      var _intervals$sort$reduc = intervals.sort(function (a, b) {
+          return a.s - b.s;
+        }).reduce(function (_ref2, item) {
+          var sofar = _ref2[0],
+            current = _ref2[1];
+          if (!current) {
+            return [sofar, item];
+          } else if (current.overlaps(item) || current.abutsStart(item)) {
+            return [sofar, current.union(item)];
+          } else {
+            return [sofar.concat([current]), item];
+          }
+        }, [[], null]),
+        found = _intervals$sort$reduc[0],
+        final = _intervals$sort$reduc[1];
+      if (final) {
+        found.push(final);
+      }
+      return found;
+    }
+
+    /**
+     * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+     * @param {Array} intervals
+     * @return {Array}
+     */;
+    Interval.xor = function xor(intervals) {
+      var _Array$prototype;
+      var start = null,
+        currentCount = 0;
+      var results = [],
+        ends = intervals.map(function (i) {
+          return [{
+            time: i.s,
+            type: "s"
+          }, {
+            time: i.e,
+            type: "e"
+          }];
+        }),
+        flattened = (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, ends),
+        arr = flattened.sort(function (a, b) {
+          return a.time - b.time;
+        });
+      for (var _iterator = _createForOfIteratorHelperLoose(arr), _step; !(_step = _iterator()).done;) {
+        var i = _step.value;
+        currentCount += i.type === "s" ? 1 : -1;
+        if (currentCount === 1) {
+          start = i.time;
+        } else {
+          if (start && +start !== +i.time) {
+            results.push(Interval.fromDateTimes(start, i.time));
+          }
+          start = null;
+        }
+      }
+      return Interval.merge(results);
+    }
+
+    /**
+     * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+     * @param {...Interval} intervals
+     * @return {Array}
+     */;
+    _proto.difference = function difference() {
+      var _this2 = this;
+      for (var _len2 = arguments.length, intervals = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        intervals[_key2] = arguments[_key2];
+      }
+      return Interval.xor([this].concat(intervals)).map(function (i) {
+        return _this2.intersection(i);
+      }).filter(function (i) {
+        return i && !i.isEmpty();
+      });
+    }
+
+    /**
+     * Returns a string representation of this Interval appropriate for debugging.
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      if (!this.isValid) return INVALID$1;
+      return "[" + this.s.toISO() + " \u2013 " + this.e.toISO() + ")";
+    }
+
+    /**
+     * Returns a string representation of this Interval appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "Interval { start: " + this.s.toISO() + ", end: " + this.e.toISO() + " }";
+      } else {
+        return "Interval { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns a localized string representing this Interval. Accepts the same options as the
+     * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+     * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+     * is browser-specific, but in general it will return an appropriate representation of the
+     * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+     * specified.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+     * Intl.DateTimeFormat constructor options.
+     * @param {Object} opts - Options to override the configuration of the start DateTime.
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+     * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+     * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+     * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+     * @return {string}
+     */;
+    _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+      if (formatOpts === void 0) {
+        formatOpts = DATE_SHORT;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this) : INVALID$1;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this Interval.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @param {Object} opts - The same options as {@link DateTime#toISO}
+     * @return {string}
+     */;
+    _proto.toISO = function toISO(opts) {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISO(opts) + "/" + this.e.toISO(opts);
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of date of this Interval.
+     * The time components are ignored.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @return {string}
+     */;
+    _proto.toISODate = function toISODate() {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISODate() + "/" + this.e.toISODate();
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of time of this Interval.
+     * The date components are ignored.
+     * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+     * @param {Object} opts - The same options as {@link DateTime#toISO}
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(opts) {
+      if (!this.isValid) return INVALID$1;
+      return this.s.toISOTime(opts) + "/" + this.e.toISOTime(opts);
+    }
+
+    /**
+     * Returns a string representation of this Interval formatted according to the specified format
+     * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+     * formatting tool.
+     * @param {string} dateFormat - The format string. This string formats the start and end time.
+     * See {@link DateTime#toFormat} for details.
+     * @param {Object} opts - Options.
+     * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+     * representations.
+     * @return {string}
+     */;
+    _proto.toFormat = function toFormat(dateFormat, _temp2) {
+      var _ref3 = _temp2 === void 0 ? {} : _temp2,
+        _ref3$separator = _ref3.separator,
+        separator = _ref3$separator === void 0 ? " – " : _ref3$separator;
+      if (!this.isValid) return INVALID$1;
+      return "" + this.s.toFormat(dateFormat) + separator + this.e.toFormat(dateFormat);
+    }
+
+    /**
+     * Return a Duration representing the time spanned by this interval.
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+     * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+     * @return {Duration}
+     */;
+    _proto.toDuration = function toDuration(unit, opts) {
+      if (!this.isValid) {
+        return Duration.invalid(this.invalidReason);
+      }
+      return this.e.diff(this.s, unit, opts);
+    }
+
+    /**
+     * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+     * @param {function} mapFn
+     * @return {Interval}
+     * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+     * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+     */;
+    _proto.mapEndpoints = function mapEndpoints(mapFn) {
+      return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+    };
+    _createClass(Interval, [{
+      key: "start",
+      get: function get() {
+        return this.isValid ? this.s : null;
+      }
+
+      /**
+       * Returns the end of the Interval. This is the first instant which is not part of the interval
+       * (Interval is half-open).
+       * @type {DateTime}
+       */
+    }, {
+      key: "end",
+      get: function get() {
+        return this.isValid ? this.e : null;
+      }
+
+      /**
+       * Returns the last DateTime included in the interval (since end is not part of the interval)
+       * @type {DateTime}
+       */
+    }, {
+      key: "lastDateTime",
+      get: function get() {
+        return this.isValid ? this.e ? this.e.minus(1) : null : null;
+      }
+
+      /**
+       * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+       * @type {boolean}
+       */
+    }, {
+      key: "isValid",
+      get: function get() {
+        return this.invalidReason === null;
+      }
+
+      /**
+       * Returns an error code if this Interval is invalid, or null if the Interval is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+    }]);
+    return Interval;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+
+  /**
+   * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+   */
+  var Info = /*#__PURE__*/function () {
+    function Info() {}
+    /**
+     * Return whether the specified zone contains a DST.
+     * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+     * @return {boolean}
+     */
+    Info.hasDST = function hasDST(zone) {
+      if (zone === void 0) {
+        zone = Settings.defaultZone;
+      }
+      var proto = DateTime.now().setZone(zone).set({
+        month: 12
+      });
+      return !zone.isUniversal && proto.offset !== proto.set({
+        month: 6
+      }).offset;
+    }
+
+    /**
+     * Return whether the specified zone is a valid IANA specifier.
+     * @param {string} zone - Zone to check
+     * @return {boolean}
+     */;
+    Info.isValidIANAZone = function isValidIANAZone(zone) {
+      return IANAZone.isValidZone(zone);
+    }
+
+    /**
+     * Converts the input into a {@link Zone} instance.
+     *
+     * * If `input` is already a Zone instance, it is returned unchanged.
+     * * If `input` is a string containing a valid time zone name, a Zone instance
+     *   with that name is returned.
+     * * If `input` is a string that doesn't refer to a known time zone, a Zone
+     *   instance with {@link Zone#isValid} == false is returned.
+     * * If `input is a number, a Zone instance with the specified fixed offset
+     *   in minutes is returned.
+     * * If `input` is `null` or `undefined`, the default zone is returned.
+     * @param {string|Zone|number} [input] - the value to be converted
+     * @return {Zone}
+     */;
+    Info.normalizeZone = function normalizeZone$1(input) {
+      return normalizeZone(input, Settings.defaultZone);
+    }
+
+    /**
+     * Get the weekday on which the week starts according to the given locale.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+     */;
+    Info.getStartOfWeek = function getStartOfWeek(_temp) {
+      var _ref = _temp === void 0 ? {} : _temp,
+        _ref$locale = _ref.locale,
+        locale = _ref$locale === void 0 ? null : _ref$locale,
+        _ref$locObj = _ref.locObj,
+        locObj = _ref$locObj === void 0 ? null : _ref$locObj;
+      return (locObj || Locale.create(locale)).getStartOfWeek();
+    }
+
+    /**
+     * Get the minimum number of days necessary in a week before it is considered part of the next year according
+     * to the given locale.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number}
+     */;
+    Info.getMinimumDaysInFirstWeek = function getMinimumDaysInFirstWeek(_temp2) {
+      var _ref2 = _temp2 === void 0 ? {} : _temp2,
+        _ref2$locale = _ref2.locale,
+        locale = _ref2$locale === void 0 ? null : _ref2$locale,
+        _ref2$locObj = _ref2.locObj,
+        locObj = _ref2$locObj === void 0 ? null : _ref2$locObj;
+      return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+    }
+
+    /**
+     * Get the weekdays, which are considered the weekend according to the given locale
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+     */;
+    Info.getWeekendWeekdays = function getWeekendWeekdays(_temp3) {
+      var _ref3 = _temp3 === void 0 ? {} : _temp3,
+        _ref3$locale = _ref3.locale,
+        locale = _ref3$locale === void 0 ? null : _ref3$locale,
+        _ref3$locObj = _ref3.locObj,
+        locObj = _ref3$locObj === void 0 ? null : _ref3$locObj;
+      // copy the array, because we cache it internally
+      return (locObj || Locale.create(locale)).getWeekendDays().slice();
+    }
+
+    /**
+     * Return an array of standalone month names.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @param {string} [opts.outputCalendar='gregory'] - the calendar
+     * @example Info.months()[0] //=> 'January'
+     * @example Info.months('short')[0] //=> 'Jan'
+     * @example Info.months('numeric')[0] //=> '1'
+     * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+     * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+     * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+     * @return {Array}
+     */;
+    Info.months = function months(length, _temp4) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref4 = _temp4 === void 0 ? {} : _temp4,
+        _ref4$locale = _ref4.locale,
+        locale = _ref4$locale === void 0 ? null : _ref4$locale,
+        _ref4$numberingSystem = _ref4.numberingSystem,
+        numberingSystem = _ref4$numberingSystem === void 0 ? null : _ref4$numberingSystem,
+        _ref4$locObj = _ref4.locObj,
+        locObj = _ref4$locObj === void 0 ? null : _ref4$locObj,
+        _ref4$outputCalendar = _ref4.outputCalendar,
+        outputCalendar = _ref4$outputCalendar === void 0 ? "gregory" : _ref4$outputCalendar;
+      return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+    }
+
+    /**
+     * Return an array of format month names.
+     * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+     * changes the string.
+     * See {@link Info#months}
+     * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @param {string} [opts.outputCalendar='gregory'] - the calendar
+     * @return {Array}
+     */;
+    Info.monthsFormat = function monthsFormat(length, _temp5) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref5 = _temp5 === void 0 ? {} : _temp5,
+        _ref5$locale = _ref5.locale,
+        locale = _ref5$locale === void 0 ? null : _ref5$locale,
+        _ref5$numberingSystem = _ref5.numberingSystem,
+        numberingSystem = _ref5$numberingSystem === void 0 ? null : _ref5$numberingSystem,
+        _ref5$locObj = _ref5.locObj,
+        locObj = _ref5$locObj === void 0 ? null : _ref5$locObj,
+        _ref5$outputCalendar = _ref5.outputCalendar,
+        outputCalendar = _ref5$outputCalendar === void 0 ? "gregory" : _ref5$outputCalendar;
+      return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+    }
+
+    /**
+     * Return an array of standalone week names.
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @example Info.weekdays()[0] //=> 'Monday'
+     * @example Info.weekdays('short')[0] //=> 'Mon'
+     * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+     * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+     * @return {Array}
+     */;
+    Info.weekdays = function weekdays(length, _temp6) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref6 = _temp6 === void 0 ? {} : _temp6,
+        _ref6$locale = _ref6.locale,
+        locale = _ref6$locale === void 0 ? null : _ref6$locale,
+        _ref6$numberingSystem = _ref6.numberingSystem,
+        numberingSystem = _ref6$numberingSystem === void 0 ? null : _ref6$numberingSystem,
+        _ref6$locObj = _ref6.locObj,
+        locObj = _ref6$locObj === void 0 ? null : _ref6$locObj;
+      return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+    }
+
+    /**
+     * Return an array of format week names.
+     * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+     * changes the string.
+     * See {@link Info#weekdays}
+     * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale=null] - the locale code
+     * @param {string} [opts.numberingSystem=null] - the numbering system
+     * @param {string} [opts.locObj=null] - an existing locale object to use
+     * @return {Array}
+     */;
+    Info.weekdaysFormat = function weekdaysFormat(length, _temp7) {
+      if (length === void 0) {
+        length = "long";
+      }
+      var _ref7 = _temp7 === void 0 ? {} : _temp7,
+        _ref7$locale = _ref7.locale,
+        locale = _ref7$locale === void 0 ? null : _ref7$locale,
+        _ref7$numberingSystem = _ref7.numberingSystem,
+        numberingSystem = _ref7$numberingSystem === void 0 ? null : _ref7$numberingSystem,
+        _ref7$locObj = _ref7.locObj,
+        locObj = _ref7$locObj === void 0 ? null : _ref7$locObj;
+      return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+    }
+
+    /**
+     * Return an array of meridiems.
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+     * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+     * @return {Array}
+     */;
+    Info.meridiems = function meridiems(_temp8) {
+      var _ref8 = _temp8 === void 0 ? {} : _temp8,
+        _ref8$locale = _ref8.locale,
+        locale = _ref8$locale === void 0 ? null : _ref8$locale;
+      return Locale.create(locale).meridiems();
+    }
+
+    /**
+     * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+     * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+     * @param {Object} opts - options
+     * @param {string} [opts.locale] - the locale code
+     * @example Info.eras() //=> [ 'BC', 'AD' ]
+     * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+     * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+     * @return {Array}
+     */;
+    Info.eras = function eras(length, _temp9) {
+      if (length === void 0) {
+        length = "short";
+      }
+      var _ref9 = _temp9 === void 0 ? {} : _temp9,
+        _ref9$locale = _ref9.locale,
+        locale = _ref9$locale === void 0 ? null : _ref9$locale;
+      return Locale.create(locale, null, "gregory").eras(length);
+    }
+
+    /**
+     * Return the set of available features in this environment.
+     * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+     * Keys:
+     * * `relative`: whether this environment supports relative time formatting
+     * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+     * @example Info.features() //=> { relative: false, localeWeek: true }
+     * @return {Object}
+     */;
+    Info.features = function features() {
+      return {
+        relative: hasRelative(),
+        localeWeek: hasLocaleWeekInfo()
+      };
+    };
+    return Info;
+  }();
+
+  function dayDiff(earlier, later) {
+    var utcDayStart = function utcDayStart(dt) {
+        return dt.toUTC(0, {
+          keepLocalTime: true
+        }).startOf("day").valueOf();
+      },
+      ms = utcDayStart(later) - utcDayStart(earlier);
+    return Math.floor(Duration.fromMillis(ms).as("days"));
+  }
+  function highOrderDiffs(cursor, later, units) {
+    var differs = [["years", function (a, b) {
+      return b.year - a.year;
+    }], ["quarters", function (a, b) {
+      return b.quarter - a.quarter + (b.year - a.year) * 4;
+    }], ["months", function (a, b) {
+      return b.month - a.month + (b.year - a.year) * 12;
+    }], ["weeks", function (a, b) {
+      var days = dayDiff(a, b);
+      return (days - days % 7) / 7;
+    }], ["days", dayDiff]];
+    var results = {};
+    var earlier = cursor;
+    var lowestOrder, highWater;
+
+    /* This loop tries to diff using larger units first.
+       If we overshoot, we backtrack and try the next smaller unit.
+       "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+       as we use smaller and smaller units.
+       highWater keeps track of where we would be if we added one more of the smallest unit,
+       this is used later to potentially convert any difference smaller than the smallest higher order unit
+       into a fraction of that smallest higher order unit
+    */
+    for (var _i = 0, _differs = differs; _i < _differs.length; _i++) {
+      var _differs$_i = _differs[_i],
+        unit = _differs$_i[0],
+        differ = _differs$_i[1];
+      if (units.indexOf(unit) >= 0) {
+        lowestOrder = unit;
+        results[unit] = differ(cursor, later);
+        highWater = earlier.plus(results);
+        if (highWater > later) {
+          // we overshot the end point, backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+
+          // if we are still overshooting now, we need to backtrack again
+          // this happens in certain situations when diffing times in different zones,
+          // because this calculation ignores time zones
+          if (cursor > later) {
+            // keep the "overshot by 1" around as highWater
+            highWater = cursor;
+            // backtrack cursor by 1
+            results[unit]--;
+            cursor = earlier.plus(results);
+          }
+        } else {
+          cursor = highWater;
+        }
+      }
+    }
+    return [cursor, results, highWater, lowestOrder];
+  }
+  function _diff (earlier, later, units, opts) {
+    var _highOrderDiffs = highOrderDiffs(earlier, later, units),
+      cursor = _highOrderDiffs[0],
+      results = _highOrderDiffs[1],
+      highWater = _highOrderDiffs[2],
+      lowestOrder = _highOrderDiffs[3];
+    var remainingMillis = later - cursor;
+    var lowerOrderUnits = units.filter(function (u) {
+      return ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0;
+    });
+    if (lowerOrderUnits.length === 0) {
+      if (highWater < later) {
+        var _cursor$plus;
+        highWater = cursor.plus((_cursor$plus = {}, _cursor$plus[lowestOrder] = 1, _cursor$plus));
+      }
+      if (highWater !== cursor) {
+        results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+      }
+    }
+    var duration = Duration.fromObject(results, opts);
+    if (lowerOrderUnits.length > 0) {
+      var _Duration$fromMillis;
+      return (_Duration$fromMillis = Duration.fromMillis(remainingMillis, opts)).shiftTo.apply(_Duration$fromMillis, lowerOrderUnits).plus(duration);
+    } else {
+      return duration;
+    }
+  }
+
+  var MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+  function intUnit(regex, post) {
+    if (post === void 0) {
+      post = function post(i) {
+        return i;
+      };
+    }
+    return {
+      regex: regex,
+      deser: function deser(_ref) {
+        var s = _ref[0];
+        return post(parseDigits(s));
+      }
+    };
+  }
+  var NBSP = String.fromCharCode(160);
+  var spaceOrNBSP = "[ " + NBSP + "]";
+  var spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+  function fixListRegex(s) {
+    // make dots optional and also make them literal
+    // make space and non breakable space characters interchangeable
+    return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+  }
+  function stripInsensitivities(s) {
+    return s.replace(/\./g, "") // ignore dots that were made optional
+    .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+    .toLowerCase();
+  }
+  function oneOf(strings, startIndex) {
+    if (strings === null) {
+      return null;
+    } else {
+      return {
+        regex: RegExp(strings.map(fixListRegex).join("|")),
+        deser: function deser(_ref2) {
+          var s = _ref2[0];
+          return strings.findIndex(function (i) {
+            return stripInsensitivities(s) === stripInsensitivities(i);
+          }) + startIndex;
+        }
+      };
+    }
+  }
+  function offset(regex, groups) {
+    return {
+      regex: regex,
+      deser: function deser(_ref3) {
+        var h = _ref3[1],
+          m = _ref3[2];
+        return signedOffset(h, m);
+      },
+      groups: groups
+    };
+  }
+  function simple(regex) {
+    return {
+      regex: regex,
+      deser: function deser(_ref4) {
+        var s = _ref4[0];
+        return s;
+      }
+    };
+  }
+  function escapeToken(value) {
+    return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+  }
+
+  /**
+   * @param token
+   * @param {Locale} loc
+   */
+  function unitForToken(token, loc) {
+    var one = digitRegex(loc),
+      two = digitRegex(loc, "{2}"),
+      three = digitRegex(loc, "{3}"),
+      four = digitRegex(loc, "{4}"),
+      six = digitRegex(loc, "{6}"),
+      oneOrTwo = digitRegex(loc, "{1,2}"),
+      oneToThree = digitRegex(loc, "{1,3}"),
+      oneToSix = digitRegex(loc, "{1,6}"),
+      oneToNine = digitRegex(loc, "{1,9}"),
+      twoToFour = digitRegex(loc, "{2,4}"),
+      fourToSix = digitRegex(loc, "{4,6}"),
+      literal = function literal(t) {
+        return {
+          regex: RegExp(escapeToken(t.val)),
+          deser: function deser(_ref5) {
+            var s = _ref5[0];
+            return s;
+          },
+          literal: true
+        };
+      },
+      unitate = function unitate(t) {
+        if (token.literal) {
+          return literal(t);
+        }
+        switch (t.val) {
+          // era
+          case "G":
+            return oneOf(loc.eras("short"), 0);
+          case "GG":
+            return oneOf(loc.eras("long"), 0);
+          // years
+          case "y":
+            return intUnit(oneToSix);
+          case "yy":
+            return intUnit(twoToFour, untruncateYear);
+          case "yyyy":
+            return intUnit(four);
+          case "yyyyy":
+            return intUnit(fourToSix);
+          case "yyyyyy":
+            return intUnit(six);
+          // months
+          case "M":
+            return intUnit(oneOrTwo);
+          case "MM":
+            return intUnit(two);
+          case "MMM":
+            return oneOf(loc.months("short", true), 1);
+          case "MMMM":
+            return oneOf(loc.months("long", true), 1);
+          case "L":
+            return intUnit(oneOrTwo);
+          case "LL":
+            return intUnit(two);
+          case "LLL":
+            return oneOf(loc.months("short", false), 1);
+          case "LLLL":
+            return oneOf(loc.months("long", false), 1);
+          // dates
+          case "d":
+            return intUnit(oneOrTwo);
+          case "dd":
+            return intUnit(two);
+          // ordinals
+          case "o":
+            return intUnit(oneToThree);
+          case "ooo":
+            return intUnit(three);
+          // time
+          case "HH":
+            return intUnit(two);
+          case "H":
+            return intUnit(oneOrTwo);
+          case "hh":
+            return intUnit(two);
+          case "h":
+            return intUnit(oneOrTwo);
+          case "mm":
+            return intUnit(two);
+          case "m":
+            return intUnit(oneOrTwo);
+          case "q":
+            return intUnit(oneOrTwo);
+          case "qq":
+            return intUnit(two);
+          case "s":
+            return intUnit(oneOrTwo);
+          case "ss":
+            return intUnit(two);
+          case "S":
+            return intUnit(oneToThree);
+          case "SSS":
+            return intUnit(three);
+          case "u":
+            return simple(oneToNine);
+          case "uu":
+            return simple(oneOrTwo);
+          case "uuu":
+            return intUnit(one);
+          // meridiem
+          case "a":
+            return oneOf(loc.meridiems(), 0);
+          // weekYear (k)
+          case "kkkk":
+            return intUnit(four);
+          case "kk":
+            return intUnit(twoToFour, untruncateYear);
+          // weekNumber (W)
+          case "W":
+            return intUnit(oneOrTwo);
+          case "WW":
+            return intUnit(two);
+          // weekdays
+          case "E":
+          case "c":
+            return intUnit(one);
+          case "EEE":
+            return oneOf(loc.weekdays("short", false), 1);
+          case "EEEE":
+            return oneOf(loc.weekdays("long", false), 1);
+          case "ccc":
+            return oneOf(loc.weekdays("short", true), 1);
+          case "cccc":
+            return oneOf(loc.weekdays("long", true), 1);
+          // offset/zone
+          case "Z":
+          case "ZZ":
+            return offset(new RegExp("([+-]" + oneOrTwo.source + ")(?::(" + two.source + "))?"), 2);
+          case "ZZZ":
+            return offset(new RegExp("([+-]" + oneOrTwo.source + ")(" + two.source + ")?"), 2);
+          // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+          // because we don't have any way to figure out what they are
+          case "z":
+            return simple(/[a-z_+-/]{1,256}?/i);
+          // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+          // in this case we accept any non-newline white-space
+          case " ":
+            return simple(/[^\S\n\r]/);
+          default:
+            return literal(t);
+        }
+      };
+    var unit = unitate(token) || {
+      invalidReason: MISSING_FTP
+    };
+    unit.token = token;
+    return unit;
+  }
+  var partTypeStyleToTokenVal = {
+    year: {
+      "2-digit": "yy",
+      numeric: "yyyyy"
+    },
+    month: {
+      numeric: "M",
+      "2-digit": "MM",
+      short: "MMM",
+      long: "MMMM"
+    },
+    day: {
+      numeric: "d",
+      "2-digit": "dd"
+    },
+    weekday: {
+      short: "EEE",
+      long: "EEEE"
+    },
+    dayperiod: "a",
+    dayPeriod: "a",
+    hour12: {
+      numeric: "h",
+      "2-digit": "hh"
+    },
+    hour24: {
+      numeric: "H",
+      "2-digit": "HH"
+    },
+    minute: {
+      numeric: "m",
+      "2-digit": "mm"
+    },
+    second: {
+      numeric: "s",
+      "2-digit": "ss"
+    },
+    timeZoneName: {
+      long: "ZZZZZ",
+      short: "ZZZ"
+    }
+  };
+  function tokenForPart(part, formatOpts, resolvedOpts) {
+    var type = part.type,
+      value = part.value;
+    if (type === "literal") {
+      var isSpace = /^\s+$/.test(value);
+      return {
+        literal: !isSpace,
+        val: isSpace ? " " : value
+      };
+    }
+    var style = formatOpts[type];
+
+    // The user might have explicitly specified hour12 or hourCycle
+    // if so, respect their decision
+    // if not, refer back to the resolvedOpts, which are based on the locale
+    var actualType = type;
+    if (type === "hour") {
+      if (formatOpts.hour12 != null) {
+        actualType = formatOpts.hour12 ? "hour12" : "hour24";
+      } else if (formatOpts.hourCycle != null) {
+        if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+          actualType = "hour12";
+        } else {
+          actualType = "hour24";
+        }
+      } else {
+        // tokens only differentiate between 24 hours or not,
+        // so we do not need to check hourCycle here, which is less supported anyways
+        actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+      }
+    }
+    var val = partTypeStyleToTokenVal[actualType];
+    if (typeof val === "object") {
+      val = val[style];
+    }
+    if (val) {
+      return {
+        literal: false,
+        val: val
+      };
+    }
+    return undefined;
+  }
+  function buildRegex(units) {
+    var re = units.map(function (u) {
+      return u.regex;
+    }).reduce(function (f, r) {
+      return f + "(" + r.source + ")";
+    }, "");
+    return ["^" + re + "$", units];
+  }
+  function match(input, regex, handlers) {
+    var matches = input.match(regex);
+    if (matches) {
+      var all = {};
+      var matchIndex = 1;
+      for (var i in handlers) {
+        if (hasOwnProperty(handlers, i)) {
+          var h = handlers[i],
+            groups = h.groups ? h.groups + 1 : 1;
+          if (!h.literal && h.token) {
+            all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+          }
+          matchIndex += groups;
+        }
+      }
+      return [matches, all];
+    } else {
+      return [matches, {}];
+    }
+  }
+  function dateTimeFromMatches(matches) {
+    var toField = function toField(token) {
+      switch (token) {
+        case "S":
+          return "millisecond";
+        case "s":
+          return "second";
+        case "m":
+          return "minute";
+        case "h":
+        case "H":
+          return "hour";
+        case "d":
+          return "day";
+        case "o":
+          return "ordinal";
+        case "L":
+        case "M":
+          return "month";
+        case "y":
+          return "year";
+        case "E":
+        case "c":
+          return "weekday";
+        case "W":
+          return "weekNumber";
+        case "k":
+          return "weekYear";
+        case "q":
+          return "quarter";
+        default:
+          return null;
+      }
+    };
+    var zone = null;
+    var specificOffset;
+    if (!isUndefined(matches.z)) {
+      zone = IANAZone.create(matches.z);
+    }
+    if (!isUndefined(matches.Z)) {
+      if (!zone) {
+        zone = new FixedOffsetZone(matches.Z);
+      }
+      specificOffset = matches.Z;
+    }
+    if (!isUndefined(matches.q)) {
+      matches.M = (matches.q - 1) * 3 + 1;
+    }
+    if (!isUndefined(matches.h)) {
+      if (matches.h < 12 && matches.a === 1) {
+        matches.h += 12;
+      } else if (matches.h === 12 && matches.a === 0) {
+        matches.h = 0;
+      }
+    }
+    if (matches.G === 0 && matches.y) {
+      matches.y = -matches.y;
+    }
+    if (!isUndefined(matches.u)) {
+      matches.S = parseMillis(matches.u);
+    }
+    var vals = Object.keys(matches).reduce(function (r, k) {
+      var f = toField(k);
+      if (f) {
+        r[f] = matches[k];
+      }
+      return r;
+    }, {});
+    return [vals, zone, specificOffset];
+  }
+  var dummyDateTimeCache = null;
+  function getDummyDateTime() {
+    if (!dummyDateTimeCache) {
+      dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+    }
+    return dummyDateTimeCache;
+  }
+  function maybeExpandMacroToken(token, locale) {
+    if (token.literal) {
+      return token;
+    }
+    var formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+    var tokens = formatOptsToTokens(formatOpts, locale);
+    if (tokens == null || tokens.includes(undefined)) {
+      return token;
+    }
+    return tokens;
+  }
+  function expandMacroTokens(tokens, locale) {
+    var _Array$prototype;
+    return (_Array$prototype = Array.prototype).concat.apply(_Array$prototype, tokens.map(function (t) {
+      return maybeExpandMacroToken(t, locale);
+    }));
+  }
+
+  /**
+   * @private
+   */
+
+  var TokenParser = /*#__PURE__*/function () {
+    function TokenParser(locale, format) {
+      this.locale = locale;
+      this.format = format;
+      this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+      this.units = this.tokens.map(function (t) {
+        return unitForToken(t, locale);
+      });
+      this.disqualifyingUnit = this.units.find(function (t) {
+        return t.invalidReason;
+      });
+      if (!this.disqualifyingUnit) {
+        var _buildRegex = buildRegex(this.units),
+          regexString = _buildRegex[0],
+          handlers = _buildRegex[1];
+        this.regex = RegExp(regexString, "i");
+        this.handlers = handlers;
+      }
+    }
+    var _proto = TokenParser.prototype;
+    _proto.explainFromTokens = function explainFromTokens(input) {
+      if (!this.isValid) {
+        return {
+          input: input,
+          tokens: this.tokens,
+          invalidReason: this.invalidReason
+        };
+      } else {
+        var _match = match(input, this.regex, this.handlers),
+          rawMatches = _match[0],
+          matches = _match[1],
+          _ref6 = matches ? dateTimeFromMatches(matches) : [null, null, undefined],
+          result = _ref6[0],
+          zone = _ref6[1],
+          specificOffset = _ref6[2];
+        if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+          throw new ConflictingSpecificationError("Can't include meridiem when specifying 24-hour format");
+        }
+        return {
+          input: input,
+          tokens: this.tokens,
+          regex: this.regex,
+          rawMatches: rawMatches,
+          matches: matches,
+          result: result,
+          zone: zone,
+          specificOffset: specificOffset
+        };
+      }
+    };
+    _createClass(TokenParser, [{
+      key: "isValid",
+      get: function get() {
+        return !this.disqualifyingUnit;
+      }
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+      }
+    }]);
+    return TokenParser;
+  }();
+  function explainFromTokens(locale, input, format) {
+    var parser = new TokenParser(locale, format);
+    return parser.explainFromTokens(input);
+  }
+  function parseFromTokens(locale, input, format) {
+    var _explainFromTokens = explainFromTokens(locale, input, format),
+      result = _explainFromTokens.result,
+      zone = _explainFromTokens.zone,
+      specificOffset = _explainFromTokens.specificOffset,
+      invalidReason = _explainFromTokens.invalidReason;
+    return [result, zone, specificOffset, invalidReason];
+  }
+  function formatOptsToTokens(formatOpts, locale) {
+    if (!formatOpts) {
+      return null;
+    }
+    var formatter = Formatter.create(locale, formatOpts);
+    var df = formatter.dtFormatter(getDummyDateTime());
+    var parts = df.formatToParts();
+    var resolvedOpts = df.resolvedOptions();
+    return parts.map(function (p) {
+      return tokenForPart(p, formatOpts, resolvedOpts);
+    });
+  }
+
+  var INVALID = "Invalid DateTime";
+  var MAX_DATE = 8.64e15;
+  function unsupportedZone(zone) {
+    return new Invalid("unsupported zone", "the zone \"" + zone.name + "\" is not supported");
+  }
+
+  // we cache week data on the DT object and this intermediates the cache
+  /**
+   * @param {DateTime} dt
+   */
+  function possiblyCachedWeekData(dt) {
+    if (dt.weekData === null) {
+      dt.weekData = gregorianToWeek(dt.c);
+    }
+    return dt.weekData;
+  }
+
+  /**
+   * @param {DateTime} dt
+   */
+  function possiblyCachedLocalWeekData(dt) {
+    if (dt.localWeekData === null) {
+      dt.localWeekData = gregorianToWeek(dt.c, dt.loc.getMinDaysInFirstWeek(), dt.loc.getStartOfWeek());
+    }
+    return dt.localWeekData;
+  }
+
+  // clone really means, "make a new object with these modifications". all "setters" really use this
+  // to create a new object while only changing some of the properties
+  function clone(inst, alts) {
+    var current = {
+      ts: inst.ts,
+      zone: inst.zone,
+      c: inst.c,
+      o: inst.o,
+      loc: inst.loc,
+      invalid: inst.invalid
+    };
+    return new DateTime(_extends({}, current, alts, {
+      old: current
+    }));
+  }
+
+  // find the right offset a given local time. The o input is our guess, which determines which
+  // offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+  function fixOffset(localTS, o, tz) {
+    // Our UTC time is just a guess because our offset is just a guess
+    var utcGuess = localTS - o * 60 * 1000;
+
+    // Test whether the zone matches the offset for this ts
+    var o2 = tz.offset(utcGuess);
+
+    // If so, offset didn't change and we're done
+    if (o === o2) {
+      return [utcGuess, o];
+    }
+
+    // If not, change the ts by the difference in the offset
+    utcGuess -= (o2 - o) * 60 * 1000;
+
+    // If that gives us the local time we want, we're done
+    var o3 = tz.offset(utcGuess);
+    if (o2 === o3) {
+      return [utcGuess, o2];
+    }
+
+    // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+    return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+  }
+
+  // convert an epoch timestamp into a calendar object with the given offset
+  function tsToObj(ts, offset) {
+    ts += offset * 60 * 1000;
+    var d = new Date(ts);
+    return {
+      year: d.getUTCFullYear(),
+      month: d.getUTCMonth() + 1,
+      day: d.getUTCDate(),
+      hour: d.getUTCHours(),
+      minute: d.getUTCMinutes(),
+      second: d.getUTCSeconds(),
+      millisecond: d.getUTCMilliseconds()
+    };
+  }
+
+  // convert a calendar object to a epoch timestamp
+  function objToTS(obj, offset, zone) {
+    return fixOffset(objToLocalTS(obj), offset, zone);
+  }
+
+  // create a new DT instance by adding a duration, adjusting for DSTs
+  function adjustTime(inst, dur) {
+    var oPre = inst.o,
+      year = inst.c.year + Math.trunc(dur.years),
+      month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+      c = _extends({}, inst.c, {
+        year: year,
+        month: month,
+        day: Math.min(inst.c.day, daysInMonth(year, month)) + Math.trunc(dur.days) + Math.trunc(dur.weeks) * 7
+      }),
+      millisToAdd = Duration.fromObject({
+        years: dur.years - Math.trunc(dur.years),
+        quarters: dur.quarters - Math.trunc(dur.quarters),
+        months: dur.months - Math.trunc(dur.months),
+        weeks: dur.weeks - Math.trunc(dur.weeks),
+        days: dur.days - Math.trunc(dur.days),
+        hours: dur.hours,
+        minutes: dur.minutes,
+        seconds: dur.seconds,
+        milliseconds: dur.milliseconds
+      }).as("milliseconds"),
+      localTS = objToLocalTS(c);
+    var _fixOffset = fixOffset(localTS, oPre, inst.zone),
+      ts = _fixOffset[0],
+      o = _fixOffset[1];
+    if (millisToAdd !== 0) {
+      ts += millisToAdd;
+      // that could have changed the offset by going over a DST, but we want to keep the ts the same
+      o = inst.zone.offset(ts);
+    }
+    return {
+      ts: ts,
+      o: o
+    };
+  }
+
+  // helper useful in turning the results of parsing into real dates
+  // by handling the zone options
+  function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+    var setZone = opts.setZone,
+      zone = opts.zone;
+    if (parsed && Object.keys(parsed).length !== 0 || parsedZone) {
+      var interpretationZone = parsedZone || zone,
+        inst = DateTime.fromObject(parsed, _extends({}, opts, {
+          zone: interpretationZone,
+          specificOffset: specificOffset
+        }));
+      return setZone ? inst : inst.setZone(zone);
+    } else {
+      return DateTime.invalid(new Invalid("unparsable", "the input \"" + text + "\" can't be parsed as " + format));
+    }
+  }
+
+  // if you want to output a technical format (e.g. RFC 2822), this helper
+  // helps handle the details
+  function toTechFormat(dt, format, allowZ) {
+    if (allowZ === void 0) {
+      allowZ = true;
+    }
+    return dt.isValid ? Formatter.create(Locale.create("en-US"), {
+      allowZ: allowZ,
+      forceSimple: true
+    }).formatDateTimeFromString(dt, format) : null;
+  }
+  function _toISODate(o, extended, precision) {
+    var longFormat = o.c.year > 9999 || o.c.year < 0;
+    var c = "";
+    if (longFormat && o.c.year >= 0) c += "+";
+    c += padStart(o.c.year, longFormat ? 6 : 4);
+    if (precision === "year") return c;
+    if (extended) {
+      c += "-";
+      c += padStart(o.c.month);
+      if (precision === "month") return c;
+      c += "-";
+    } else {
+      c += padStart(o.c.month);
+      if (precision === "month") return c;
+    }
+    c += padStart(o.c.day);
+    return c;
+  }
+  function _toISOTime(o, extended, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision) {
+    var showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+      c = "";
+    switch (precision) {
+      case "day":
+      case "month":
+      case "year":
+        break;
+      default:
+        c += padStart(o.c.hour);
+        if (precision === "hour") break;
+        if (extended) {
+          c += ":";
+          c += padStart(o.c.minute);
+          if (precision === "minute") break;
+          if (showSeconds) {
+            c += ":";
+            c += padStart(o.c.second);
+          }
+        } else {
+          c += padStart(o.c.minute);
+          if (precision === "minute") break;
+          if (showSeconds) {
+            c += padStart(o.c.second);
+          }
+        }
+        if (precision === "second") break;
+        if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+          c += ".";
+          c += padStart(o.c.millisecond, 3);
+        }
+    }
+    if (includeOffset) {
+      if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+        c += "Z";
+      } else if (o.o < 0) {
+        c += "-";
+        c += padStart(Math.trunc(-o.o / 60));
+        c += ":";
+        c += padStart(Math.trunc(-o.o % 60));
+      } else {
+        c += "+";
+        c += padStart(Math.trunc(o.o / 60));
+        c += ":";
+        c += padStart(Math.trunc(o.o % 60));
+      }
+    }
+    if (extendedZone) {
+      c += "[" + o.zone.ianaName + "]";
+    }
+    return c;
+  }
+
+  // defaults for unspecified units in the supported calendars
+  var defaultUnitValues = {
+      month: 1,
+      day: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    },
+    defaultWeekUnitValues = {
+      weekNumber: 1,
+      weekday: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    },
+    defaultOrdinalUnitValues = {
+      ordinal: 1,
+      hour: 0,
+      minute: 0,
+      second: 0,
+      millisecond: 0
+    };
+
+  // Units in the supported calendars, sorted by bigness
+  var orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+    orderedWeekUnits = ["weekYear", "weekNumber", "weekday", "hour", "minute", "second", "millisecond"],
+    orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+  // standardize case and plurality in units
+  function normalizeUnit(unit) {
+    var normalized = {
+      year: "year",
+      years: "year",
+      month: "month",
+      months: "month",
+      day: "day",
+      days: "day",
+      hour: "hour",
+      hours: "hour",
+      minute: "minute",
+      minutes: "minute",
+      quarter: "quarter",
+      quarters: "quarter",
+      second: "second",
+      seconds: "second",
+      millisecond: "millisecond",
+      milliseconds: "millisecond",
+      weekday: "weekday",
+      weekdays: "weekday",
+      weeknumber: "weekNumber",
+      weeksnumber: "weekNumber",
+      weeknumbers: "weekNumber",
+      weekyear: "weekYear",
+      weekyears: "weekYear",
+      ordinal: "ordinal"
+    }[unit.toLowerCase()];
+    if (!normalized) throw new InvalidUnitError(unit);
+    return normalized;
+  }
+  function normalizeUnitWithLocalWeeks(unit) {
+    switch (unit.toLowerCase()) {
+      case "localweekday":
+      case "localweekdays":
+        return "localWeekday";
+      case "localweeknumber":
+      case "localweeknumbers":
+        return "localWeekNumber";
+      case "localweekyear":
+      case "localweekyears":
+        return "localWeekYear";
+      default:
+        return normalizeUnit(unit);
+    }
+  }
+
+  // cache offsets for zones based on the current timestamp when this function is
+  // first called. When we are handling a datetime from components like (year,
+  // month, day, hour) in a time zone, we need a guess about what the timezone
+  // offset is so that we can convert into a UTC timestamp. One way is to find the
+  // offset of now in the zone. The actual date may have a different offset (for
+  // example, if we handle a date in June while we're in December in a zone that
+  // observes DST), but we can check and adjust that.
+  //
+  // When handling many dates, calculating the offset for now every time is
+  // expensive. It's just a guess, so we can cache the offset to use even if we
+  // are right on a time change boundary (we'll just correct in the other
+  // direction). Using a timestamp from first read is a slight optimization for
+  // handling dates close to the current date, since those dates will usually be
+  // in the same offset (we could set the timestamp statically, instead). We use a
+  // single timestamp for all zones to make things a bit more predictable.
+  //
+  // This is safe for quickDT (used by local() and utc()) because we don't fill in
+  // higher-order units from tsNow (as we do in fromObject, this requires that
+  // offset is calculated from tsNow).
+  /**
+   * @param {Zone} zone
+   * @return {number}
+   */
+  function guessOffsetForZone(zone) {
+    if (zoneOffsetTs === undefined) {
+      zoneOffsetTs = Settings.now();
+    }
+
+    // Do not cache anything but IANA zones, because it is not safe to do so.
+    // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+    if (zone.type !== "iana") {
+      return zone.offset(zoneOffsetTs);
+    }
+    var zoneName = zone.name;
+    var offsetGuess = zoneOffsetGuessCache.get(zoneName);
+    if (offsetGuess === undefined) {
+      offsetGuess = zone.offset(zoneOffsetTs);
+      zoneOffsetGuessCache.set(zoneName, offsetGuess);
+    }
+    return offsetGuess;
+  }
+
+  // this is a dumbed down version of fromObject() that runs about 60% faster
+  // but doesn't do any validation, makes a bunch of assumptions about what units
+  // are present, and so on.
+  function quickDT(obj, opts) {
+    var zone = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    }
+    var loc = Locale.fromObject(opts);
+    var ts, o;
+
+    // assume we have the higher-order units
+    if (!isUndefined(obj.year)) {
+      for (var _i = 0, _orderedUnits = orderedUnits; _i < _orderedUnits.length; _i++) {
+        var u = _orderedUnits[_i];
+        if (isUndefined(obj[u])) {
+          obj[u] = defaultUnitValues[u];
+        }
+      }
+      var invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      }
+      var offsetProvis = guessOffsetForZone(zone);
+      var _objToTS = objToTS(obj, offsetProvis, zone);
+      ts = _objToTS[0];
+      o = _objToTS[1];
+    } else {
+      ts = Settings.now();
+    }
+    return new DateTime({
+      ts: ts,
+      zone: zone,
+      loc: loc,
+      o: o
+    });
+  }
+  function diffRelative(start, end, opts) {
+    var round = isUndefined(opts.round) ? true : opts.round,
+      rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+      format = function format(c, unit) {
+        c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+        var formatter = end.loc.clone(opts).relFormatter(opts);
+        return formatter.format(c, unit);
+      },
+      differ = function differ(unit) {
+        if (opts.calendary) {
+          if (!end.hasSame(start, unit)) {
+            return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+          } else return 0;
+        } else {
+          return end.diff(start, unit).get(unit);
+        }
+      };
+    if (opts.unit) {
+      return format(differ(opts.unit), opts.unit);
+    }
+    for (var _iterator = _createForOfIteratorHelperLoose(opts.units), _step; !(_step = _iterator()).done;) {
+      var unit = _step.value;
+      var count = differ(unit);
+      if (Math.abs(count) >= 1) {
+        return format(count, unit);
+      }
+    }
+    return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+  }
+  function lastOpts(argList) {
+    var opts = {},
+      args;
+    if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+      opts = argList[argList.length - 1];
+      args = Array.from(argList).slice(0, argList.length - 1);
+    } else {
+      args = Array.from(argList);
+    }
+    return [opts, args];
+  }
+
+  /**
+   * Timestamp to use for cached zone offset guesses (exposed for test)
+   */
+  var zoneOffsetTs;
+  /**
+   * Cache for zone offset guesses (exposed for test).
+   *
+   * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+   * zone.offset().
+   */
+  var zoneOffsetGuessCache = new Map();
+
+  /**
+   * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+   *
+   * A DateTime comprises of:
+   * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+   * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+   * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+   *
+   * Here is a brief overview of the most commonly used functionality it provides:
+   *
+   * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+   * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+   * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+   * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+   * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+   * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+   * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+   *
+   * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+   */
+  var DateTime = /*#__PURE__*/function (_Symbol$for) {
+    /**
+     * @access private
+     */
+    function DateTime(config) {
+      var zone = config.zone || Settings.defaultZone;
+      var invalid = config.invalid || (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) || (!zone.isValid ? unsupportedZone(zone) : null);
+      /**
+       * @access private
+       */
+      this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+      var c = null,
+        o = null;
+      if (!invalid) {
+        var unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+        if (unchanged) {
+          var _ref = [config.old.c, config.old.o];
+          c = _ref[0];
+          o = _ref[1];
+        } else {
+          // If an offset has been passed and we have not been called from
+          // clone(), we can trust it and avoid the offset calculation.
+          var ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+          c = tsToObj(this.ts, ot);
+          invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+          c = invalid ? null : c;
+          o = invalid ? null : ot;
+        }
+      }
+
+      /**
+       * @access private
+       */
+      this._zone = zone;
+      /**
+       * @access private
+       */
+      this.loc = config.loc || Locale.create();
+      /**
+       * @access private
+       */
+      this.invalid = invalid;
+      /**
+       * @access private
+       */
+      this.weekData = null;
+      /**
+       * @access private
+       */
+      this.localWeekData = null;
+      /**
+       * @access private
+       */
+      this.c = c;
+      /**
+       * @access private
+       */
+      this.o = o;
+      /**
+       * @access private
+       */
+      this.isLuxonDateTime = true;
+    }
+
+    // CONSTRUCT
+
+    /**
+     * Create a DateTime for the current instant, in the system's time zone.
+     *
+     * Use Settings to override these default values if needed.
+     * @example DateTime.now().toISO() //~> now in the ISO format
+     * @return {DateTime}
+     */
+    DateTime.now = function now() {
+      return new DateTime({});
+    }
+
+    /**
+     * Create a local DateTime
+     * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+     * @param {number} [month=1] - The month, 1-indexed
+     * @param {number} [day=1] - The day of the month, 1-indexed
+     * @param {number} [hour=0] - The hour of the day, in 24-hour time
+     * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+     * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+     * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+     * @example DateTime.local()                                  //~> now
+     * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+     * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+     * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+     * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+     * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+     * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+     * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+     * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+     * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+     * @return {DateTime}
+     */;
+    DateTime.local = function local() {
+      var _lastOpts = lastOpts(arguments),
+        opts = _lastOpts[0],
+        args = _lastOpts[1],
+        year = args[0],
+        month = args[1],
+        day = args[2],
+        hour = args[3],
+        minute = args[4],
+        second = args[5],
+        millisecond = args[6];
+      return quickDT({
+        year: year,
+        month: month,
+        day: day,
+        hour: hour,
+        minute: minute,
+        second: second,
+        millisecond: millisecond
+      }, opts);
+    }
+
+    /**
+     * Create a DateTime in UTC
+     * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+     * @param {number} [month=1] - The month, 1-indexed
+     * @param {number} [day=1] - The day of the month
+     * @param {number} [hour=0] - The hour of the day, in 24-hour time
+     * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+     * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+     * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+     * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+     * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+     * @example DateTime.utc()                                              //~> now
+     * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+     * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+     * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+     * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+     * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+     * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+     * @return {DateTime}
+     */;
+    DateTime.utc = function utc() {
+      var _lastOpts2 = lastOpts(arguments),
+        opts = _lastOpts2[0],
+        args = _lastOpts2[1],
+        year = args[0],
+        month = args[1],
+        day = args[2],
+        hour = args[3],
+        minute = args[4],
+        second = args[5],
+        millisecond = args[6];
+      opts.zone = FixedOffsetZone.utcInstance;
+      return quickDT({
+        year: year,
+        month: month,
+        day: day,
+        hour: hour,
+        minute: minute,
+        second: second,
+        millisecond: millisecond
+      }, opts);
+    }
+
+    /**
+     * Create a DateTime from a JavaScript Date object. Uses the default zone.
+     * @param {Date} date - a JavaScript Date object
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @return {DateTime}
+     */;
+    DateTime.fromJSDate = function fromJSDate(date, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var ts = isDate(date) ? date.valueOf() : NaN;
+      if (Number.isNaN(ts)) {
+        return DateTime.invalid("invalid input");
+      }
+      var zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+      if (!zoneToUse.isValid) {
+        return DateTime.invalid(unsupportedZone(zoneToUse));
+      }
+      return new DateTime({
+        ts: ts,
+        zone: zoneToUse,
+        loc: Locale.fromObject(options)
+      });
+    }
+
+    /**
+     * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+     * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromMillis = function fromMillis(milliseconds, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!isNumber(milliseconds)) {
+        throw new InvalidArgumentError("fromMillis requires a numerical input, but received a " + typeof milliseconds + " with value " + milliseconds);
+      } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+        // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+        return DateTime.invalid("Timestamp out of range");
+      } else {
+        return new DateTime({
+          ts: milliseconds,
+          zone: normalizeZone(options.zone, Settings.defaultZone),
+          loc: Locale.fromObject(options)
+        });
+      }
+    }
+
+    /**
+     * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+     * @param {number} seconds - a number of seconds since 1970 UTC
+     * @param {Object} options - configuration options for the DateTime
+     * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+     * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+     * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromSeconds = function fromSeconds(seconds, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!isNumber(seconds)) {
+        throw new InvalidArgumentError("fromSeconds requires a numerical input");
+      } else {
+        return new DateTime({
+          ts: seconds * 1000,
+          zone: normalizeZone(options.zone, Settings.defaultZone),
+          loc: Locale.fromObject(options)
+        });
+      }
+    }
+
+    /**
+     * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+     * @param {Object} obj - the object to create the DateTime from
+     * @param {number} obj.year - a year, such as 1987
+     * @param {number} obj.month - a month, 1-12
+     * @param {number} obj.day - a day of the month, 1-31, depending on the month
+     * @param {number} obj.ordinal - day of the year, 1-365 or 366
+     * @param {number} obj.weekYear - an ISO week year
+     * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+     * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+     * @param {number} obj.localWeekYear - a week year, according to the locale
+     * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+     * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+     * @param {number} obj.hour - hour of the day, 0-23
+     * @param {number} obj.minute - minute of the hour, 0-59
+     * @param {number} obj.second - second of the minute, 0-59
+     * @param {number} obj.millisecond - millisecond of the second, 0-999
+     * @param {Object} opts - options for creating this DateTime
+     * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+     * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+     * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+     * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+     * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+     * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+     * @return {DateTime}
+     */;
+    DateTime.fromObject = function fromObject(obj, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      obj = obj || {};
+      var zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+      if (!zoneToUse.isValid) {
+        return DateTime.invalid(unsupportedZone(zoneToUse));
+      }
+      var loc = Locale.fromObject(opts);
+      var normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+      var _usesLocalWeekValues = usesLocalWeekValues(normalized, loc),
+        minDaysInFirstWeek = _usesLocalWeekValues.minDaysInFirstWeek,
+        startOfWeek = _usesLocalWeekValues.startOfWeek;
+      var tsNow = Settings.now(),
+        offsetProvis = !isUndefined(opts.specificOffset) ? opts.specificOffset : zoneToUse.offset(tsNow),
+        containsOrdinal = !isUndefined(normalized.ordinal),
+        containsGregorYear = !isUndefined(normalized.year),
+        containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+        containsGregor = containsGregorYear || containsGregorMD,
+        definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+      // cases:
+      // just a weekday -> this week's instance of that weekday, no worries
+      // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+      // (gregorian month or day) + ordinal -> error
+      // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+      if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+        throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+      }
+      if (containsGregorMD && containsOrdinal) {
+        throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+      }
+      var useWeekData = definiteWeekDef || normalized.weekday && !containsGregor;
+
+      // configure ourselves to deal with gregorian dates or week stuff
+      var units,
+        defaultValues,
+        objNow = tsToObj(tsNow, offsetProvis);
+      if (useWeekData) {
+        units = orderedWeekUnits;
+        defaultValues = defaultWeekUnitValues;
+        objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+      } else if (containsOrdinal) {
+        units = orderedOrdinalUnits;
+        defaultValues = defaultOrdinalUnitValues;
+        objNow = gregorianToOrdinal(objNow);
+      } else {
+        units = orderedUnits;
+        defaultValues = defaultUnitValues;
+      }
+
+      // set default values for missing stuff
+      var foundFirst = false;
+      for (var _iterator2 = _createForOfIteratorHelperLoose(units), _step2; !(_step2 = _iterator2()).done;) {
+        var u = _step2.value;
+        var v = normalized[u];
+        if (!isUndefined(v)) {
+          foundFirst = true;
+        } else if (foundFirst) {
+          normalized[u] = defaultValues[u];
+        } else {
+          normalized[u] = objNow[u];
+        }
+      }
+
+      // make sure the values we have are in range
+      var higherOrderInvalid = useWeekData ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? hasInvalidOrdinalData(normalized) : hasInvalidGregorianData(normalized),
+        invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      }
+
+      // compute the actual time
+      var gregorian = useWeekData ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? ordinalToGregorian(normalized) : normalized,
+        _objToTS2 = objToTS(gregorian, offsetProvis, zoneToUse),
+        tsFinal = _objToTS2[0],
+        offsetFinal = _objToTS2[1],
+        inst = new DateTime({
+          ts: tsFinal,
+          zone: zoneToUse,
+          o: offsetFinal,
+          loc: loc
+        });
+
+      // gregorian data + weekday serves only to validate
+      if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+        return DateTime.invalid("mismatched weekday", "you can't specify both a weekday of " + normalized.weekday + " and a date of " + inst.toISO());
+      }
+      if (!inst.isValid) {
+        return DateTime.invalid(inst.invalid);
+      }
+      return inst;
+    }
+
+    /**
+     * Create a DateTime from an ISO 8601 string
+     * @param {string} text - the ISO string
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+     * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+     * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+     * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+     * @example DateTime.fromISO('2016-W05-4')
+     * @return {DateTime}
+     */;
+    DateTime.fromISO = function fromISO(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseISODate = parseISODate(text),
+        vals = _parseISODate[0],
+        parsedZone = _parseISODate[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+    }
+
+    /**
+     * Create a DateTime from an RFC 2822 string
+     * @param {string} text - the RFC 2822 string
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+     * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+     * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+     * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+     * @return {DateTime}
+     */;
+    DateTime.fromRFC2822 = function fromRFC2822(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseRFC2822Date = parseRFC2822Date(text),
+        vals = _parseRFC2822Date[0],
+        parsedZone = _parseRFC2822Date[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+    }
+
+    /**
+     * Create a DateTime from an HTTP header date
+     * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+     * @param {string} text - the HTTP header date
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+     * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+     * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+     * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+     * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+     * @return {DateTime}
+     */;
+    DateTime.fromHTTP = function fromHTTP(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseHTTPDate = parseHTTPDate(text),
+        vals = _parseHTTPDate[0],
+        parsedZone = _parseHTTPDate[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+    }
+
+    /**
+     * Create a DateTime from an input string and format string.
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+     * @param {string} text - the string to parse
+     * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+     * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @return {DateTime}
+     */;
+    DateTime.fromFormat = function fromFormat(text, fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (isUndefined(text) || isUndefined(fmt)) {
+        throw new InvalidArgumentError("fromFormat requires an input string and a format");
+      }
+      var _opts = opts,
+        _opts$locale = _opts.locale,
+        locale = _opts$locale === void 0 ? null : _opts$locale,
+        _opts$numberingSystem = _opts.numberingSystem,
+        numberingSystem = _opts$numberingSystem === void 0 ? null : _opts$numberingSystem,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        }),
+        _parseFromTokens = parseFromTokens(localeToUse, text, fmt),
+        vals = _parseFromTokens[0],
+        parsedZone = _parseFromTokens[1],
+        specificOffset = _parseFromTokens[2],
+        invalid = _parseFromTokens[3];
+      if (invalid) {
+        return DateTime.invalid(invalid);
+      } else {
+        return parseDataToDateTime(vals, parsedZone, opts, "format " + fmt, text, specificOffset);
+      }
+    }
+
+    /**
+     * @deprecated use fromFormat instead
+     */;
+    DateTime.fromString = function fromString(text, fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return DateTime.fromFormat(text, fmt, opts);
+    }
+
+    /**
+     * Create a DateTime from a SQL date, time, or datetime
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale
+     * @param {string} text - the string to parse
+     * @param {Object} opts - options to affect the creation
+     * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+     * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+     * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+     * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+     * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+     * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+     * @example DateTime.fromSQL('2017-05-15')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+     * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+     * @example DateTime.fromSQL('09:12:34.342')
+     * @return {DateTime}
+     */;
+    DateTime.fromSQL = function fromSQL(text, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _parseSQL = parseSQL(text),
+        vals = _parseSQL[0],
+        parsedZone = _parseSQL[1];
+      return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+    }
+
+    /**
+     * Create an invalid DateTime.
+     * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+     * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+     * @return {DateTime}
+     */;
+    DateTime.invalid = function invalid(reason, explanation) {
+      if (explanation === void 0) {
+        explanation = null;
+      }
+      if (!reason) {
+        throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+      }
+      var invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+      if (Settings.throwOnInvalid) {
+        throw new InvalidDateTimeError(invalid);
+      } else {
+        return new DateTime({
+          invalid: invalid
+        });
+      }
+    }
+
+    /**
+     * Check if an object is an instance of DateTime. Works across context boundaries
+     * @param {object} o
+     * @return {boolean}
+     */;
+    DateTime.isDateTime = function isDateTime(o) {
+      return o && o.isLuxonDateTime || false;
+    }
+
+    /**
+     * Produce the format string for a set of options
+     * @param formatOpts
+     * @param localeOpts
+     * @returns {string}
+     */;
+    DateTime.parseFormatForOpts = function parseFormatForOpts(formatOpts, localeOpts) {
+      if (localeOpts === void 0) {
+        localeOpts = {};
+      }
+      var tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+      return !tokenList ? null : tokenList.map(function (t) {
+        return t ? t.val : null;
+      }).join("");
+    }
+
+    /**
+     * Produce the the fully expanded format token for the locale
+     * Does NOT quote characters, so quoted tokens will not round trip correctly
+     * @param fmt
+     * @param localeOpts
+     * @returns {string}
+     */;
+    DateTime.expandFormat = function expandFormat(fmt, localeOpts) {
+      if (localeOpts === void 0) {
+        localeOpts = {};
+      }
+      var expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+      return expanded.map(function (t) {
+        return t.val;
+      }).join("");
+    };
+    DateTime.resetCache = function resetCache() {
+      zoneOffsetTs = undefined;
+      zoneOffsetGuessCache.clear();
+    }
+
+    // INFO
+
+    /**
+     * Get the value of unit.
+     * @param {string} unit - a unit such as 'minute' or 'day'
+     * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+     * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+     * @return {number}
+     */;
+    var _proto = DateTime.prototype;
+    _proto.get = function get(unit) {
+      return this[unit];
+    }
+
+    /**
+     * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+     * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+     * * The DateTime was created by an operation on another invalid date
+     * @type {boolean}
+     */;
+    /**
+     * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+     * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+     * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+     * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+     * @returns {DateTime[]}
+     */
+    _proto.getPossibleOffsets = function getPossibleOffsets() {
+      if (!this.isValid || this.isOffsetFixed) {
+        return [this];
+      }
+      var dayMs = 86400000;
+      var minuteMs = 60000;
+      var localTS = objToLocalTS(this.c);
+      var oEarlier = this.zone.offset(localTS - dayMs);
+      var oLater = this.zone.offset(localTS + dayMs);
+      var o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+      var o2 = this.zone.offset(localTS - oLater * minuteMs);
+      if (o1 === o2) {
+        return [this];
+      }
+      var ts1 = localTS - o1 * minuteMs;
+      var ts2 = localTS - o2 * minuteMs;
+      var c1 = tsToObj(ts1, o1);
+      var c2 = tsToObj(ts2, o2);
+      if (c1.hour === c2.hour && c1.minute === c2.minute && c1.second === c2.second && c1.millisecond === c2.millisecond) {
+        return [clone(this, {
+          ts: ts1
+        }), clone(this, {
+          ts: ts2
+        })];
+      }
+      return [this];
+    }
+
+    /**
+     * Returns true if this DateTime is in a leap year, false otherwise
+     * @example DateTime.local(2016).isInLeapYear //=> true
+     * @example DateTime.local(2013).isInLeapYear //=> false
+     * @type {boolean}
+     */;
+    /**
+     * Returns the resolved Intl options for this DateTime.
+     * This is useful in understanding the behavior of formatting methods
+     * @param {Object} opts - the same options as toLocaleString
+     * @return {Object}
+     */
+    _proto.resolvedLocaleOptions = function resolvedLocaleOptions(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      var _Formatter$create$res = Formatter.create(this.loc.clone(opts), opts).resolvedOptions(this),
+        locale = _Formatter$create$res.locale,
+        numberingSystem = _Formatter$create$res.numberingSystem,
+        calendar = _Formatter$create$res.calendar;
+      return {
+        locale: locale,
+        numberingSystem: numberingSystem,
+        outputCalendar: calendar
+      };
+    }
+
+    // TRANSFORM
+
+    /**
+     * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+     *
+     * Equivalent to {@link DateTime#setZone}('utc')
+     * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+     * @param {Object} [opts={}] - options to pass to `setZone()`
+     * @return {DateTime}
+     */;
+    _proto.toUTC = function toUTC(offset, opts) {
+      if (offset === void 0) {
+        offset = 0;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.setZone(FixedOffsetZone.instance(offset), opts);
+    }
+
+    /**
+     * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+     *
+     * Equivalent to `setZone('local')`
+     * @return {DateTime}
+     */;
+    _proto.toLocal = function toLocal() {
+      return this.setZone(Settings.defaultZone);
+    }
+
+    /**
+     * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+     *
+     * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+     * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+     * @return {DateTime}
+     */;
+    _proto.setZone = function setZone(zone, _temp) {
+      var _ref2 = _temp === void 0 ? {} : _temp,
+        _ref2$keepLocalTime = _ref2.keepLocalTime,
+        keepLocalTime = _ref2$keepLocalTime === void 0 ? false : _ref2$keepLocalTime,
+        _ref2$keepCalendarTim = _ref2.keepCalendarTime,
+        keepCalendarTime = _ref2$keepCalendarTim === void 0 ? false : _ref2$keepCalendarTim;
+      zone = normalizeZone(zone, Settings.defaultZone);
+      if (zone.equals(this.zone)) {
+        return this;
+      } else if (!zone.isValid) {
+        return DateTime.invalid(unsupportedZone(zone));
+      } else {
+        var newTS = this.ts;
+        if (keepLocalTime || keepCalendarTime) {
+          var offsetGuess = zone.offset(this.ts);
+          var asObj = this.toObject();
+          var _objToTS3 = objToTS(asObj, offsetGuess, zone);
+          newTS = _objToTS3[0];
+        }
+        return clone(this, {
+          ts: newTS,
+          zone: zone
+        });
+      }
+    }
+
+    /**
+     * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+     * @param {Object} properties - the properties to set
+     * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+     * @return {DateTime}
+     */;
+    _proto.reconfigure = function reconfigure(_temp2) {
+      var _ref3 = _temp2 === void 0 ? {} : _temp2,
+        locale = _ref3.locale,
+        numberingSystem = _ref3.numberingSystem,
+        outputCalendar = _ref3.outputCalendar;
+      var loc = this.loc.clone({
+        locale: locale,
+        numberingSystem: numberingSystem,
+        outputCalendar: outputCalendar
+      });
+      return clone(this, {
+        loc: loc
+      });
+    }
+
+    /**
+     * "Set" the locale. Returns a newly-constructed DateTime.
+     * Just a convenient alias for reconfigure({ locale })
+     * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+     * @return {DateTime}
+     */;
+    _proto.setLocale = function setLocale(locale) {
+      return this.reconfigure({
+        locale: locale
+      });
+    }
+
+    /**
+     * "Set" the values of specified units. Returns a newly-constructed DateTime.
+     * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+     *
+     * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+     * They cannot be mixed with ISO-week units like `weekday`.
+     * @param {Object} values - a mapping of units to numbers
+     * @example dt.set({ year: 2017 })
+     * @example dt.set({ hour: 8, minute: 30 })
+     * @example dt.set({ weekday: 5 })
+     * @example dt.set({ year: 2005, ordinal: 234 })
+     * @return {DateTime}
+     */;
+    _proto.set = function set(values) {
+      if (!this.isValid) return this;
+      var normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+      var _usesLocalWeekValues2 = usesLocalWeekValues(normalized, this.loc),
+        minDaysInFirstWeek = _usesLocalWeekValues2.minDaysInFirstWeek,
+        startOfWeek = _usesLocalWeekValues2.startOfWeek;
+      var settingWeekStuff = !isUndefined(normalized.weekYear) || !isUndefined(normalized.weekNumber) || !isUndefined(normalized.weekday),
+        containsOrdinal = !isUndefined(normalized.ordinal),
+        containsGregorYear = !isUndefined(normalized.year),
+        containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+        containsGregor = containsGregorYear || containsGregorMD,
+        definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+      if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+        throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+      }
+      if (containsGregorMD && containsOrdinal) {
+        throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+      }
+      var mixed;
+      if (settingWeekStuff) {
+        mixed = weekToGregorian(_extends({}, gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), normalized), minDaysInFirstWeek, startOfWeek);
+      } else if (!isUndefined(normalized.ordinal)) {
+        mixed = ordinalToGregorian(_extends({}, gregorianToOrdinal(this.c), normalized));
+      } else {
+        mixed = _extends({}, this.toObject(), normalized);
+
+        // if we didn't set the day but we ended up on an overflow date,
+        // use the last day of the right month
+        if (isUndefined(normalized.day)) {
+          mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+        }
+      }
+      var _objToTS4 = objToTS(mixed, this.o, this.zone),
+        ts = _objToTS4[0],
+        o = _objToTS4[1];
+      return clone(this, {
+        ts: ts,
+        o: o
+      });
+    }
+
+    /**
+     * Add a period of time to this DateTime and return the resulting DateTime
+     *
+     * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+     * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     * @example DateTime.now().plus(123) //~> in 123 milliseconds
+     * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+     * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+     * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+     * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+     * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+     * @return {DateTime}
+     */;
+    _proto.plus = function plus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration);
+      return clone(this, adjustTime(this, dur));
+    }
+
+    /**
+     * Subtract a period of time to this DateTime and return the resulting DateTime
+     * See {@link DateTime#plus}
+     * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+     @return {DateTime}
+     */;
+    _proto.minus = function minus(duration) {
+      if (!this.isValid) return this;
+      var dur = Duration.fromDurationLike(duration).negate();
+      return clone(this, adjustTime(this, dur));
+    }
+
+    /**
+     * "Set" this DateTime to the beginning of a unit of time.
+     * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+     * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+     * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+     * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+     * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+     * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+     * @return {DateTime}
+     */;
+    _proto.startOf = function startOf(unit, _temp3) {
+      var _ref4 = _temp3 === void 0 ? {} : _temp3,
+        _ref4$useLocaleWeeks = _ref4.useLocaleWeeks,
+        useLocaleWeeks = _ref4$useLocaleWeeks === void 0 ? false : _ref4$useLocaleWeeks;
+      if (!this.isValid) return this;
+      var o = {},
+        normalizedUnit = Duration.normalizeUnit(unit);
+      switch (normalizedUnit) {
+        case "years":
+          o.month = 1;
+        // falls through
+        case "quarters":
+        case "months":
+          o.day = 1;
+        // falls through
+        case "weeks":
+        case "days":
+          o.hour = 0;
+        // falls through
+        case "hours":
+          o.minute = 0;
+        // falls through
+        case "minutes":
+          o.second = 0;
+        // falls through
+        case "seconds":
+          o.millisecond = 0;
+          break;
+        // no default, invalid units throw in normalizeUnit()
+      }
+
+      if (normalizedUnit === "weeks") {
+        if (useLocaleWeeks) {
+          var startOfWeek = this.loc.getStartOfWeek();
+          var weekday = this.weekday;
+          if (weekday < startOfWeek) {
+            o.weekNumber = this.weekNumber - 1;
+          }
+          o.weekday = startOfWeek;
+        } else {
+          o.weekday = 1;
+        }
+      }
+      if (normalizedUnit === "quarters") {
+        var q = Math.ceil(this.month / 3);
+        o.month = (q - 1) * 3 + 1;
+      }
+      return this.set(o);
+    }
+
+    /**
+     * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+     * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+     * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+     * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+     * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+     * @return {DateTime}
+     */;
+    _proto.endOf = function endOf(unit, opts) {
+      var _this$plus;
+      return this.isValid ? this.plus((_this$plus = {}, _this$plus[unit] = 1, _this$plus)).startOf(unit, opts).minus(1) : this;
+    }
+
+    // OUTPUT
+
+    /**
+     * Returns a string representation of this DateTime formatted according to the specified format string.
+     * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+     * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+     * @param {string} fmt - the format string
+     * @param {Object} opts - opts to override the configuration options on this DateTime
+     * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+     * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+     * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+     * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+     * @return {string}
+     */;
+    _proto.toFormat = function toFormat(fmt, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt) : INVALID;
+    }
+
+    /**
+     * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+     * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+     * of the DateTime in the assigned locale.
+     * Defaults to the system's locale if no locale has been specified
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+     * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+     * @param {Object} opts - opts to override the configuration options on this DateTime
+     * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+     * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+     * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+     * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+     * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+     * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+     * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+     * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+     * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+     * @return {string}
+     */;
+    _proto.toLocaleString = function toLocaleString(formatOpts, opts) {
+      if (formatOpts === void 0) {
+        formatOpts = DATE_SHORT;
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this) : INVALID;
+    }
+
+    /**
+     * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+     * Defaults to the system's locale if no locale has been specified
+     * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+     * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+     * @example DateTime.now().toLocaleParts(); //=> [
+     *                                   //=>   { type: 'day', value: '25' },
+     *                                   //=>   { type: 'literal', value: '/' },
+     *                                   //=>   { type: 'month', value: '05' },
+     *                                   //=>   { type: 'literal', value: '/' },
+     *                                   //=>   { type: 'year', value: '1982' }
+     *                                   //=> ]
+     */;
+    _proto.toLocaleParts = function toLocaleParts(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.isValid ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this) : [];
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+     * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+     * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+     * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+     * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+     * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+     * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+     * @return {string|null}
+     */;
+    _proto.toISO = function toISO(_temp4) {
+      var _ref5 = _temp4 === void 0 ? {} : _temp4,
+        _ref5$format = _ref5.format,
+        format = _ref5$format === void 0 ? "extended" : _ref5$format,
+        _ref5$suppressSeconds = _ref5.suppressSeconds,
+        suppressSeconds = _ref5$suppressSeconds === void 0 ? false : _ref5$suppressSeconds,
+        _ref5$suppressMillise = _ref5.suppressMilliseconds,
+        suppressMilliseconds = _ref5$suppressMillise === void 0 ? false : _ref5$suppressMillise,
+        _ref5$includeOffset = _ref5.includeOffset,
+        includeOffset = _ref5$includeOffset === void 0 ? true : _ref5$includeOffset,
+        _ref5$extendedZone = _ref5.extendedZone,
+        extendedZone = _ref5$extendedZone === void 0 ? false : _ref5$extendedZone,
+        _ref5$precision = _ref5.precision,
+        precision = _ref5$precision === void 0 ? "milliseconds" : _ref5$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      precision = normalizeUnit(precision);
+      var ext = format === "extended";
+      var c = _toISODate(this, ext, precision);
+      if (orderedUnits.indexOf(precision) >= 3) c += "T";
+      c += _toISOTime(this, ext, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+      return c;
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's date component
+     * @param {Object} opts - options
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+     * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+     * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+     * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+     * @return {string|null}
+     */;
+    _proto.toISODate = function toISODate(_temp5) {
+      var _ref6 = _temp5 === void 0 ? {} : _temp5,
+        _ref6$format = _ref6.format,
+        format = _ref6$format === void 0 ? "extended" : _ref6$format,
+        _ref6$precision = _ref6.precision,
+        precision = _ref6$precision === void 0 ? "day" : _ref6$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      return _toISODate(this, format === "extended", normalizeUnit(precision));
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's week date
+     * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+     * @return {string}
+     */;
+    _proto.toISOWeekDate = function toISOWeekDate() {
+      return toTechFormat(this, "kkkk-'W'WW-c");
+    }
+
+    /**
+     * Returns an ISO 8601-compliant string representation of this DateTime's time component
+     * @param {Object} opts - options
+     * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+     * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+     * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+     * @param {string} [opts.format='extended'] - choose between the basic and extended format
+     * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+     * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+     * @return {string}
+     */;
+    _proto.toISOTime = function toISOTime(_temp6) {
+      var _ref7 = _temp6 === void 0 ? {} : _temp6,
+        _ref7$suppressMillise = _ref7.suppressMilliseconds,
+        suppressMilliseconds = _ref7$suppressMillise === void 0 ? false : _ref7$suppressMillise,
+        _ref7$suppressSeconds = _ref7.suppressSeconds,
+        suppressSeconds = _ref7$suppressSeconds === void 0 ? false : _ref7$suppressSeconds,
+        _ref7$includeOffset = _ref7.includeOffset,
+        includeOffset = _ref7$includeOffset === void 0 ? true : _ref7$includeOffset,
+        _ref7$includePrefix = _ref7.includePrefix,
+        includePrefix = _ref7$includePrefix === void 0 ? false : _ref7$includePrefix,
+        _ref7$extendedZone = _ref7.extendedZone,
+        extendedZone = _ref7$extendedZone === void 0 ? false : _ref7$extendedZone,
+        _ref7$format = _ref7.format,
+        format = _ref7$format === void 0 ? "extended" : _ref7$format,
+        _ref7$precision = _ref7.precision,
+        precision = _ref7$precision === void 0 ? "milliseconds" : _ref7$precision;
+      if (!this.isValid) {
+        return null;
+      }
+      precision = normalizeUnit(precision);
+      var c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+      return c + _toISOTime(this, format === "extended", suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+    }
+
+    /**
+     * Returns an RFC 2822-compatible string representation of this DateTime
+     * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+     * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+     * @return {string}
+     */;
+    _proto.toRFC2822 = function toRFC2822() {
+      return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+     * Specifically, the string conforms to RFC 1123.
+     * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+     * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+     * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+     * @return {string}
+     */;
+    _proto.toHTTP = function toHTTP() {
+      return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL Date
+     * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+     * @return {string|null}
+     */;
+    _proto.toSQLDate = function toSQLDate() {
+      if (!this.isValid) {
+        return null;
+      }
+      return _toISODate(this, true);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL Time
+     * @param {Object} opts - options
+     * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+     * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+     * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+     * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+     * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+     * @return {string}
+     */;
+    _proto.toSQLTime = function toSQLTime(_temp7) {
+      var _ref8 = _temp7 === void 0 ? {} : _temp7,
+        _ref8$includeOffset = _ref8.includeOffset,
+        includeOffset = _ref8$includeOffset === void 0 ? true : _ref8$includeOffset,
+        _ref8$includeZone = _ref8.includeZone,
+        includeZone = _ref8$includeZone === void 0 ? false : _ref8$includeZone,
+        _ref8$includeOffsetSp = _ref8.includeOffsetSpace,
+        includeOffsetSpace = _ref8$includeOffsetSp === void 0 ? true : _ref8$includeOffsetSp;
+      var fmt = "HH:mm:ss.SSS";
+      if (includeZone || includeOffset) {
+        if (includeOffsetSpace) {
+          fmt += " ";
+        }
+        if (includeZone) {
+          fmt += "z";
+        } else if (includeOffset) {
+          fmt += "ZZ";
+        }
+      }
+      return toTechFormat(this, fmt, true);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+     * @param {Object} opts - options
+     * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+     * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+     * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+     * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+     * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+     * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+     * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+     * @return {string}
+     */;
+    _proto.toSQL = function toSQL(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) {
+        return null;
+      }
+      return this.toSQLDate() + " " + this.toSQLTime(opts);
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for debugging
+     * @return {string}
+     */;
+    _proto.toString = function toString() {
+      return this.isValid ? this.toISO() : INVALID;
+    }
+
+    /**
+     * Returns a string representation of this DateTime appropriate for the REPL.
+     * @return {string}
+     */;
+    _proto[_Symbol$for] = function () {
+      if (this.isValid) {
+        return "DateTime { ts: " + this.toISO() + ", zone: " + this.zone.name + ", locale: " + this.locale + " }";
+      } else {
+        return "DateTime { Invalid, reason: " + this.invalidReason + " }";
+      }
+    }
+
+    /**
+     * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+     * @return {number}
+     */;
+    _proto.valueOf = function valueOf() {
+      return this.toMillis();
+    }
+
+    /**
+     * Returns the epoch milliseconds of this DateTime.
+     * @return {number}
+     */;
+    _proto.toMillis = function toMillis() {
+      return this.isValid ? this.ts : NaN;
+    }
+
+    /**
+     * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+     * @return {number}
+     */;
+    _proto.toSeconds = function toSeconds() {
+      return this.isValid ? this.ts / 1000 : NaN;
+    }
+
+    /**
+     * Returns the epoch seconds (as a whole number) of this DateTime.
+     * @return {number}
+     */;
+    _proto.toUnixInteger = function toUnixInteger() {
+      return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+    }
+
+    /**
+     * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+     * @return {string}
+     */;
+    _proto.toJSON = function toJSON() {
+      return this.toISO();
+    }
+
+    /**
+     * Returns a BSON serializable equivalent to this DateTime.
+     * @return {Date}
+     */;
+    _proto.toBSON = function toBSON() {
+      return this.toJSDate();
+    }
+
+    /**
+     * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+     * @param opts - options for generating the object
+     * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+     * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+     * @return {Object}
+     */;
+    _proto.toObject = function toObject(opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid) return {};
+      var base = _extends({}, this.c);
+      if (opts.includeConfig) {
+        base.outputCalendar = this.outputCalendar;
+        base.numberingSystem = this.loc.numberingSystem;
+        base.locale = this.loc.locale;
+      }
+      return base;
+    }
+
+    /**
+     * Returns a JavaScript Date equivalent to this DateTime.
+     * @return {Date}
+     */;
+    _proto.toJSDate = function toJSDate() {
+      return new Date(this.isValid ? this.ts : NaN);
+    }
+
+    // COMPARE
+
+    /**
+     * Return the difference between two DateTimes as a Duration.
+     * @param {DateTime} otherDateTime - the DateTime to compare this one to
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @example
+     * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+     *     i2 = DateTime.fromISO('1983-10-14T10:30');
+     * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+     * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+     * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+     * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+     * @return {Duration}
+     */;
+    _proto.diff = function diff(otherDateTime, unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (!this.isValid || !otherDateTime.isValid) {
+        return Duration.invalid("created by diffing an invalid DateTime");
+      }
+      var durOpts = _extends({
+        locale: this.locale,
+        numberingSystem: this.numberingSystem
+      }, opts);
+      var units = maybeArray(unit).map(Duration.normalizeUnit),
+        otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+        earlier = otherIsLater ? this : otherDateTime,
+        later = otherIsLater ? otherDateTime : this,
+        diffed = _diff(earlier, later, units, durOpts);
+      return otherIsLater ? diffed.negate() : diffed;
+    }
+
+    /**
+     * Return the difference between this DateTime and right now.
+     * See {@link DateTime#diff}
+     * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+     * @param {Object} opts - options that affect the creation of the Duration
+     * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+     * @return {Duration}
+     */;
+    _proto.diffNow = function diffNow(unit, opts) {
+      if (unit === void 0) {
+        unit = "milliseconds";
+      }
+      if (opts === void 0) {
+        opts = {};
+      }
+      return this.diff(DateTime.now(), unit, opts);
+    }
+
+    /**
+     * Return an Interval spanning between this DateTime and another DateTime
+     * @param {DateTime} otherDateTime - the other end point of the Interval
+     * @return {Interval|DateTime}
+     */;
+    _proto.until = function until(otherDateTime) {
+      return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+    }
+
+    /**
+     * Return whether this DateTime is in the same unit of time as another DateTime.
+     * Higher-order units must also be identical for this function to return `true`.
+     * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+     * @param {DateTime} otherDateTime - the other DateTime
+     * @param {string} unit - the unit of time to check sameness on
+     * @param {Object} opts - options
+     * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+     * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+     * @return {boolean}
+     */;
+    _proto.hasSame = function hasSame(otherDateTime, unit, opts) {
+      if (!this.isValid) return false;
+      var inputMs = otherDateTime.valueOf();
+      var adjustedToZone = this.setZone(otherDateTime.zone, {
+        keepLocalTime: true
+      });
+      return adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts);
+    }
+
+    /**
+     * Equality check
+     * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+     * To compare just the millisecond values, use `+dt1 === +dt2`.
+     * @param {DateTime} other - the other DateTime
+     * @return {boolean}
+     */;
+    _proto.equals = function equals(other) {
+      return this.isValid && other.isValid && this.valueOf() === other.valueOf() && this.zone.equals(other.zone) && this.loc.equals(other.loc);
+    }
+
+    /**
+     * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+     * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+     * @param {Object} options - options that affect the output
+     * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+     * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+     * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+     * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+     * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+     * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+     * @param {string} options.locale - override the locale of this DateTime
+     * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+     * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+     * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+     * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+     * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+     * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+     * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+     */;
+    _proto.toRelative = function toRelative(options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!this.isValid) return null;
+      var base = options.base || DateTime.fromObject({}, {
+          zone: this.zone
+        }),
+        padding = options.padding ? this < base ? -options.padding : options.padding : 0;
+      var units = ["years", "months", "days", "hours", "minutes", "seconds"];
+      var unit = options.unit;
+      if (Array.isArray(options.unit)) {
+        units = options.unit;
+        unit = undefined;
+      }
+      return diffRelative(base, this.plus(padding), _extends({}, options, {
+        numeric: "always",
+        units: units,
+        unit: unit
+      }));
+    }
+
+    /**
+     * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+     * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+     * @param {Object} options - options that affect the output
+     * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+     * @param {string} options.locale - override the locale of this DateTime
+     * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+     * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+     * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+     * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+     * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+     * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+     */;
+    _proto.toRelativeCalendar = function toRelativeCalendar(options) {
+      if (options === void 0) {
+        options = {};
+      }
+      if (!this.isValid) return null;
+      return diffRelative(options.base || DateTime.fromObject({}, {
+        zone: this.zone
+      }), this, _extends({}, options, {
+        numeric: "auto",
+        units: ["years", "months", "days"],
+        calendary: true
+      }));
+    }
+
+    /**
+     * Return the min of several date times
+     * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+     * @return {DateTime} the min DateTime, or undefined if called with no argument
+     */;
+    DateTime.min = function min() {
+      for (var _len = arguments.length, dateTimes = new Array(_len), _key = 0; _key < _len; _key++) {
+        dateTimes[_key] = arguments[_key];
+      }
+      if (!dateTimes.every(DateTime.isDateTime)) {
+        throw new InvalidArgumentError("min requires all arguments be DateTimes");
+      }
+      return bestBy(dateTimes, function (i) {
+        return i.valueOf();
+      }, Math.min);
+    }
+
+    /**
+     * Return the max of several date times
+     * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+     * @return {DateTime} the max DateTime, or undefined if called with no argument
+     */;
+    DateTime.max = function max() {
+      for (var _len2 = arguments.length, dateTimes = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        dateTimes[_key2] = arguments[_key2];
+      }
+      if (!dateTimes.every(DateTime.isDateTime)) {
+        throw new InvalidArgumentError("max requires all arguments be DateTimes");
+      }
+      return bestBy(dateTimes, function (i) {
+        return i.valueOf();
+      }, Math.max);
+    }
+
+    // MISC
+
+    /**
+     * Explain how a string would be parsed by fromFormat()
+     * @param {string} text - the string to parse
+     * @param {string} fmt - the format the string is expected to be in (see description)
+     * @param {Object} options - options taken by fromFormat()
+     * @return {Object}
+     */;
+    DateTime.fromFormatExplain = function fromFormatExplain(text, fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var _options = options,
+        _options$locale = _options.locale,
+        locale = _options$locale === void 0 ? null : _options$locale,
+        _options$numberingSys = _options.numberingSystem,
+        numberingSystem = _options$numberingSys === void 0 ? null : _options$numberingSys,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      return explainFromTokens(localeToUse, text, fmt);
+    }
+
+    /**
+     * @deprecated use fromFormatExplain instead
+     */;
+    DateTime.fromStringExplain = function fromStringExplain(text, fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      return DateTime.fromFormatExplain(text, fmt, options);
+    }
+
+    /**
+     * Build a parser for `fmt` using the given locale. This parser can be passed
+     * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+     * can be used to optimize cases where many dates need to be parsed in a
+     * specific format.
+     *
+     * @param {String} fmt - the format the string is expected to be in (see
+     * description)
+     * @param {Object} options - options used to set locale and numberingSystem
+     * for parser
+     * @returns {TokenParser} - opaque object to be used
+     */;
+    DateTime.buildFormatParser = function buildFormatParser(fmt, options) {
+      if (options === void 0) {
+        options = {};
+      }
+      var _options2 = options,
+        _options2$locale = _options2.locale,
+        locale = _options2$locale === void 0 ? null : _options2$locale,
+        _options2$numberingSy = _options2.numberingSystem,
+        numberingSystem = _options2$numberingSy === void 0 ? null : _options2$numberingSy,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      return new TokenParser(localeToUse, fmt);
+    }
+
+    /**
+     * Create a DateTime from an input string and format parser.
+     *
+     * The format parser must have been created with the same locale as this call.
+     *
+     * @param {String} text - the string to parse
+     * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+     * @param {Object} opts - options taken by fromFormat()
+     * @returns {DateTime}
+     */;
+    DateTime.fromFormatParser = function fromFormatParser(text, formatParser, opts) {
+      if (opts === void 0) {
+        opts = {};
+      }
+      if (isUndefined(text) || isUndefined(formatParser)) {
+        throw new InvalidArgumentError("fromFormatParser requires an input string and a format parser");
+      }
+      var _opts2 = opts,
+        _opts2$locale = _opts2.locale,
+        locale = _opts2$locale === void 0 ? null : _opts2$locale,
+        _opts2$numberingSyste = _opts2.numberingSystem,
+        numberingSystem = _opts2$numberingSyste === void 0 ? null : _opts2$numberingSyste,
+        localeToUse = Locale.fromOpts({
+          locale: locale,
+          numberingSystem: numberingSystem,
+          defaultToEN: true
+        });
+      if (!localeToUse.equals(formatParser.locale)) {
+        throw new InvalidArgumentError("fromFormatParser called with a locale of " + localeToUse + ", " + ("but the format parser was created for " + formatParser.locale));
+      }
+      var _formatParser$explain = formatParser.explainFromTokens(text),
+        result = _formatParser$explain.result,
+        zone = _formatParser$explain.zone,
+        specificOffset = _formatParser$explain.specificOffset,
+        invalidReason = _formatParser$explain.invalidReason;
+      if (invalidReason) {
+        return DateTime.invalid(invalidReason);
+      } else {
+        return parseDataToDateTime(result, zone, opts, "format " + formatParser.format, text, specificOffset);
+      }
+    }
+
+    // FORMAT PRESETS
+
+    /**
+     * {@link DateTime#toLocaleString} format like 10/14/1983
+     * @type {Object}
+     */;
+    _createClass(DateTime, [{
+      key: "isValid",
+      get: function get() {
+        return this.invalid === null;
+      }
+
+      /**
+       * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidReason",
+      get: function get() {
+        return this.invalid ? this.invalid.reason : null;
+      }
+
+      /**
+       * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+       * @type {string}
+       */
+    }, {
+      key: "invalidExplanation",
+      get: function get() {
+        return this.invalid ? this.invalid.explanation : null;
+      }
+
+      /**
+       * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "locale",
+      get: function get() {
+        return this.isValid ? this.loc.locale : null;
+      }
+
+      /**
+       * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "numberingSystem",
+      get: function get() {
+        return this.isValid ? this.loc.numberingSystem : null;
+      }
+
+      /**
+       * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+       *
+       * @type {string}
+       */
+    }, {
+      key: "outputCalendar",
+      get: function get() {
+        return this.isValid ? this.loc.outputCalendar : null;
+      }
+
+      /**
+       * Get the time zone associated with this DateTime.
+       * @type {Zone}
+       */
+    }, {
+      key: "zone",
+      get: function get() {
+        return this._zone;
+      }
+
+      /**
+       * Get the name of the time zone.
+       * @type {string}
+       */
+    }, {
+      key: "zoneName",
+      get: function get() {
+        return this.isValid ? this.zone.name : null;
+      }
+
+      /**
+       * Get the year
+       * @example DateTime.local(2017, 5, 25).year //=> 2017
+       * @type {number}
+       */
+    }, {
+      key: "year",
+      get: function get() {
+        return this.isValid ? this.c.year : NaN;
+      }
+
+      /**
+       * Get the quarter
+       * @example DateTime.local(2017, 5, 25).quarter //=> 2
+       * @type {number}
+       */
+    }, {
+      key: "quarter",
+      get: function get() {
+        return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+      }
+
+      /**
+       * Get the month (1-12).
+       * @example DateTime.local(2017, 5, 25).month //=> 5
+       * @type {number}
+       */
+    }, {
+      key: "month",
+      get: function get() {
+        return this.isValid ? this.c.month : NaN;
+      }
+
+      /**
+       * Get the day of the month (1-30ish).
+       * @example DateTime.local(2017, 5, 25).day //=> 25
+       * @type {number}
+       */
+    }, {
+      key: "day",
+      get: function get() {
+        return this.isValid ? this.c.day : NaN;
+      }
+
+      /**
+       * Get the hour of the day (0-23).
+       * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+       * @type {number}
+       */
+    }, {
+      key: "hour",
+      get: function get() {
+        return this.isValid ? this.c.hour : NaN;
+      }
+
+      /**
+       * Get the minute of the hour (0-59).
+       * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+       * @type {number}
+       */
+    }, {
+      key: "minute",
+      get: function get() {
+        return this.isValid ? this.c.minute : NaN;
+      }
+
+      /**
+       * Get the second of the minute (0-59).
+       * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+       * @type {number}
+       */
+    }, {
+      key: "second",
+      get: function get() {
+        return this.isValid ? this.c.second : NaN;
+      }
+
+      /**
+       * Get the millisecond of the second (0-999).
+       * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+       * @type {number}
+       */
+    }, {
+      key: "millisecond",
+      get: function get() {
+        return this.isValid ? this.c.millisecond : NaN;
+      }
+
+      /**
+       * Get the week year
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+       * @type {number}
+       */
+    }, {
+      key: "weekYear",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+      }
+
+      /**
+       * Get the week number of the week year (1-52ish).
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+       * @type {number}
+       */
+    }, {
+      key: "weekNumber",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+      }
+
+      /**
+       * Get the day of the week.
+       * 1 is Monday and 7 is Sunday
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2014, 11, 31).weekday //=> 4
+       * @type {number}
+       */
+    }, {
+      key: "weekday",
+      get: function get() {
+        return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+      }
+
+      /**
+       * Returns true if this date is on a weekend according to the locale, false otherwise
+       * @returns {boolean}
+       */
+    }, {
+      key: "isWeekend",
+      get: function get() {
+        return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+      }
+
+      /**
+       * Get the day of the week according to the locale.
+       * 1 is the first day of the week and 7 is the last day of the week.
+       * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekday",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+      }
+
+      /**
+       * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+       * because the week can start on different days of the week (see localWeekday) and because a different number of days
+       * is required for a week to count as the first week of a year.
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekNumber",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+      }
+
+      /**
+       * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+       * differently, see localWeekNumber.
+       * @returns {number}
+       */
+    }, {
+      key: "localWeekYear",
+      get: function get() {
+        return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+      }
+
+      /**
+       * Get the ordinal (meaning the day of the year)
+       * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+       * @type {number|DateTime}
+       */
+    }, {
+      key: "ordinal",
+      get: function get() {
+        return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+      }
+
+      /**
+       * Get the human readable short month name, such as 'Oct'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+       * @type {string}
+       */
+    }, {
+      key: "monthShort",
+      get: function get() {
+        return this.isValid ? Info.months("short", {
+          locObj: this.loc
+        })[this.month - 1] : null;
+      }
+
+      /**
+       * Get the human readable long month name, such as 'October'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).monthLong //=> October
+       * @type {string}
+       */
+    }, {
+      key: "monthLong",
+      get: function get() {
+        return this.isValid ? Info.months("long", {
+          locObj: this.loc
+        })[this.month - 1] : null;
+      }
+
+      /**
+       * Get the human readable short weekday, such as 'Mon'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+       * @type {string}
+       */
+    }, {
+      key: "weekdayShort",
+      get: function get() {
+        return this.isValid ? Info.weekdays("short", {
+          locObj: this.loc
+        })[this.weekday - 1] : null;
+      }
+
+      /**
+       * Get the human readable long weekday, such as 'Monday'.
+       * Defaults to the system's locale if no locale has been specified
+       * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+       * @type {string}
+       */
+    }, {
+      key: "weekdayLong",
+      get: function get() {
+        return this.isValid ? Info.weekdays("long", {
+          locObj: this.loc
+        })[this.weekday - 1] : null;
+      }
+
+      /**
+       * Get the UTC offset of this DateTime in minutes
+       * @example DateTime.now().offset //=> -240
+       * @example DateTime.utc().offset //=> 0
+       * @type {number}
+       */
+    }, {
+      key: "offset",
+      get: function get() {
+        return this.isValid ? +this.o : NaN;
+      }
+
+      /**
+       * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+       * Defaults to the system's locale if no locale has been specified
+       * @type {string}
+       */
+    }, {
+      key: "offsetNameShort",
+      get: function get() {
+        if (this.isValid) {
+          return this.zone.offsetName(this.ts, {
+            format: "short",
+            locale: this.locale
+          });
+        } else {
+          return null;
+        }
+      }
+
+      /**
+       * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+       * Defaults to the system's locale if no locale has been specified
+       * @type {string}
+       */
+    }, {
+      key: "offsetNameLong",
+      get: function get() {
+        if (this.isValid) {
+          return this.zone.offsetName(this.ts, {
+            format: "long",
+            locale: this.locale
+          });
+        } else {
+          return null;
+        }
+      }
+
+      /**
+       * Get whether this zone's offset ever changes, as in a DST.
+       * @type {boolean}
+       */
+    }, {
+      key: "isOffsetFixed",
+      get: function get() {
+        return this.isValid ? this.zone.isUniversal : null;
+      }
+
+      /**
+       * Get whether the DateTime is in a DST.
+       * @type {boolean}
+       */
+    }, {
+      key: "isInDST",
+      get: function get() {
+        if (this.isOffsetFixed) {
+          return false;
+        } else {
+          return this.offset > this.set({
+            month: 1,
+            day: 1
+          }).offset || this.offset > this.set({
+            month: 5
+          }).offset;
+        }
+      }
+    }, {
+      key: "isInLeapYear",
+      get: function get() {
+        return isLeapYear(this.year);
+      }
+
+      /**
+       * Returns the number of days in this DateTime's month
+       * @example DateTime.local(2016, 2).daysInMonth //=> 29
+       * @example DateTime.local(2016, 3).daysInMonth //=> 31
+       * @type {number}
+       */
+    }, {
+      key: "daysInMonth",
+      get: function get() {
+        return daysInMonth(this.year, this.month);
+      }
+
+      /**
+       * Returns the number of days in this DateTime's year
+       * @example DateTime.local(2016).daysInYear //=> 366
+       * @example DateTime.local(2013).daysInYear //=> 365
+       * @type {number}
+       */
+    }, {
+      key: "daysInYear",
+      get: function get() {
+        return this.isValid ? daysInYear(this.year) : NaN;
+      }
+
+      /**
+       * Returns the number of weeks in this DateTime's year
+       * @see https://en.wikipedia.org/wiki/ISO_week_date
+       * @example DateTime.local(2004).weeksInWeekYear //=> 53
+       * @example DateTime.local(2013).weeksInWeekYear //=> 52
+       * @type {number}
+       */
+    }, {
+      key: "weeksInWeekYear",
+      get: function get() {
+        return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+      }
+
+      /**
+       * Returns the number of weeks in this DateTime's local week year
+       * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+       * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+       * @type {number}
+       */
+    }, {
+      key: "weeksInLocalWeekYear",
+      get: function get() {
+        return this.isValid ? weeksInWeekYear(this.localWeekYear, this.loc.getMinDaysInFirstWeek(), this.loc.getStartOfWeek()) : NaN;
+      }
+    }], [{
+      key: "DATE_SHORT",
+      get: function get() {
+        return DATE_SHORT;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_MED",
+      get: function get() {
+        return DATE_MED;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_MED_WITH_WEEKDAY",
+      get: function get() {
+        return DATE_MED_WITH_WEEKDAY;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_FULL",
+      get: function get() {
+        return DATE_FULL;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+       * @type {Object}
+       */
+    }, {
+      key: "DATE_HUGE",
+      get: function get() {
+        return DATE_HUGE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_SIMPLE",
+      get: function get() {
+        return TIME_SIMPLE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_SECONDS",
+      get: function get() {
+        return TIME_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_SHORT_OFFSET",
+      get: function get() {
+        return TIME_WITH_SHORT_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_WITH_LONG_OFFSET",
+      get: function get() {
+        return TIME_WITH_LONG_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_SIMPLE",
+      get: function get() {
+        return TIME_24_SIMPLE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_SECONDS",
+      get: function get() {
+        return TIME_24_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_SHORT_OFFSET",
+      get: function get() {
+        return TIME_24_WITH_SHORT_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+       * @type {Object}
+       */
+    }, {
+      key: "TIME_24_WITH_LONG_OFFSET",
+      get: function get() {
+        return TIME_24_WITH_LONG_OFFSET;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_SHORT",
+      get: function get() {
+        return DATETIME_SHORT;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_SHORT_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_SHORT_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED",
+      get: function get() {
+        return DATETIME_MED;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_MED_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_MED_WITH_WEEKDAY",
+      get: function get() {
+        return DATETIME_MED_WITH_WEEKDAY;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_FULL",
+      get: function get() {
+        return DATETIME_FULL;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_FULL_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_FULL_WITH_SECONDS;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_HUGE",
+      get: function get() {
+        return DATETIME_HUGE;
+      }
+
+      /**
+       * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+       * @type {Object}
+       */
+    }, {
+      key: "DATETIME_HUGE_WITH_SECONDS",
+      get: function get() {
+        return DATETIME_HUGE_WITH_SECONDS;
+      }
+    }]);
+    return DateTime;
+  }(Symbol.for("nodejs.util.inspect.custom"));
+  function friendlyDateTime(dateTimeish) {
+    if (DateTime.isDateTime(dateTimeish)) {
+      return dateTimeish;
+    } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+      return DateTime.fromJSDate(dateTimeish);
+    } else if (dateTimeish && typeof dateTimeish === "object") {
+      return DateTime.fromObject(dateTimeish);
+    } else {
+      throw new InvalidArgumentError("Unknown datetime argument: " + dateTimeish + ", of type " + typeof dateTimeish);
+    }
+  }
+
+  var VERSION = "3.7.2";
+
+  exports.DateTime = DateTime;
+  exports.Duration = Duration;
+  exports.FixedOffsetZone = FixedOffsetZone;
+  exports.IANAZone = IANAZone;
+  exports.Info = Info;
+  exports.Interval = Interval;
+  exports.InvalidZone = InvalidZone;
+  exports.Settings = Settings;
+  exports.SystemZone = SystemZone;
+  exports.VERSION = VERSION;
+  exports.Zone = Zone;
+
+  Object.defineProperty(exports, '__esModule', { value: true });
+
+  return exports;
+
+})({});
+//# sourceMappingURL=luxon.js.map
diff --git a/node_modules/luxon/build/global/luxon.js.map b/node_modules/luxon/build/global/luxon.js.map
new file mode 100644
index 0000000..a7bbf8d
--- /dev/null
+++ b/node_modules/luxon/build/global/luxon.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"luxon.js","sources":["../../src/errors.js","../../src/impl/formats.js","../../src/zone.js","../../src/zones/systemZone.js","../../src/zones/IANAZone.js","../../src/impl/locale.js","../../src/zones/fixedOffsetZone.js","../../src/zones/invalidZone.js","../../src/impl/zoneUtil.js","../../src/impl/digits.js","../../src/settings.js","../../src/impl/invalid.js","../../src/impl/conversions.js","../../src/impl/util.js","../../src/impl/english.js","../../src/impl/formatter.js","../../src/impl/regexParser.js","../../src/duration.js","../../src/interval.js","../../src/info.js","../../src/impl/diff.js","../../src/impl/tokenParser.js","../../src/datetime.js","../../src/luxon.js"],"sourcesContent":["// these aren't really private, but nor are they really useful to document\n\n/**\n * @private\n */\nclass LuxonError extends Error {}\n\n/**\n * @private\n */\nexport class InvalidDateTimeError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid DateTime: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidIntervalError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Interval: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidDurationError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Duration: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class ConflictingSpecificationError extends LuxonError {}\n\n/**\n * @private\n */\nexport class InvalidUnitError extends LuxonError {\n  constructor(unit) {\n    super(`Invalid unit ${unit}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidArgumentError extends LuxonError {}\n\n/**\n * @private\n */\nexport class ZoneIsAbstractError extends LuxonError {\n  constructor() {\n    super(\"Zone is an abstract class\");\n  }\n}\n","/**\n * @private\n */\n\nconst n = \"numeric\",\n  s = \"short\",\n  l = \"long\";\n\nexport const DATE_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n};\n\nexport const DATE_MED = {\n  year: n,\n  month: s,\n  day: n,\n};\n\nexport const DATE_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n};\n\nexport const DATE_FULL = {\n  year: n,\n  month: l,\n  day: n,\n};\n\nexport const DATE_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n};\n\nexport const TIME_SIMPLE = {\n  hour: n,\n  minute: n,\n};\n\nexport const TIME_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const TIME_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const TIME_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n\nexport const TIME_24_SIMPLE = {\n  hour: n,\n  minute: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: s,\n};\n\nexport const TIME_24_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: l,\n};\n\nexport const DATETIME_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_SHORT_WITH_SECONDS = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_MED_WITH_SECONDS = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_FULL = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_FULL_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  timeZoneName: l,\n};\n\nexport const DATETIME_HUGE_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n","import { ZoneIsAbstractError } from \"./errors.js\";\n\n/**\n * @interface\n */\nexport default class Zone {\n  /**\n   * The type of zone\n   * @abstract\n   * @type {string}\n   */\n  get type() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The name of this zone.\n   * @abstract\n   * @type {string}\n   */\n  get name() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The IANA name of this zone.\n   * Defaults to `name` if not overwritten by a subclass.\n   * @abstract\n   * @type {string}\n   */\n  get ianaName() {\n    return this.name;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year.\n   * @abstract\n   * @type {boolean}\n   */\n  get isUniversal() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, opts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @abstract\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @abstract\n   * @type {boolean}\n   */\n  get isValid() {\n    throw new ZoneIsAbstractError();\n  }\n}\n","import { formatOffset, parseZoneInfo } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * Represents the local zone for this JavaScript environment.\n * @implements {Zone}\n */\nexport default class SystemZone extends Zone {\n  /**\n   * Get a singleton instance of the local zone\n   * @return {SystemZone}\n   */\n  static get instance() {\n    if (singleton === null) {\n      singleton = new SystemZone();\n    }\n    return singleton;\n  }\n\n  /** @override **/\n  get type() {\n    return \"system\";\n  }\n\n  /** @override **/\n  get name() {\n    return new Intl.DateTimeFormat().resolvedOptions().timeZone;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale);\n  }\n\n  /** @override **/\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /** @override **/\n  offset(ts) {\n    return -new Date(ts).getTimezoneOffset();\n  }\n\n  /** @override **/\n  equals(otherZone) {\n    return otherZone.type === \"system\";\n  }\n\n  /** @override **/\n  get isValid() {\n    return true;\n  }\n}\n","import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nconst dtfCache = new Map();\nfunction makeDTF(zoneName) {\n  let dtf = dtfCache.get(zoneName);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(\"en-US\", {\n      hour12: false,\n      timeZone: zoneName,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      era: \"short\",\n    });\n    dtfCache.set(zoneName, dtf);\n  }\n  return dtf;\n}\n\nconst typeToPos = {\n  year: 0,\n  month: 1,\n  day: 2,\n  era: 3,\n  hour: 4,\n  minute: 5,\n  second: 6,\n};\n\nfunction hackyOffset(dtf, date) {\n  const formatted = dtf.format(date).replace(/\\u200E/g, \"\"),\n    parsed = /(\\d+)\\/(\\d+)\\/(\\d+) (AD|BC),? (\\d+):(\\d+):(\\d+)/.exec(formatted),\n    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;\n  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];\n}\n\nfunction partsOffset(dtf, date) {\n  const formatted = dtf.formatToParts(date);\n  const filled = [];\n  for (let i = 0; i < formatted.length; i++) {\n    const { type, value } = formatted[i];\n    const pos = typeToPos[type];\n\n    if (type === \"era\") {\n      filled[pos] = value;\n    } else if (!isUndefined(pos)) {\n      filled[pos] = parseInt(value, 10);\n    }\n  }\n  return filled;\n}\n\nconst ianaZoneCache = new Map();\n/**\n * A zone identified by an IANA identifier, like America/New_York\n * @implements {Zone}\n */\nexport default class IANAZone extends Zone {\n  /**\n   * @param {string} name - Zone name\n   * @return {IANAZone}\n   */\n  static create(name) {\n    let zone = ianaZoneCache.get(name);\n    if (zone === undefined) {\n      ianaZoneCache.set(name, (zone = new IANAZone(name)));\n    }\n    return zone;\n  }\n\n  /**\n   * Reset local caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCache() {\n    ianaZoneCache.clear();\n    dtfCache.clear();\n  }\n\n  /**\n   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.\n   * @param {string} s - The string to check validity on\n   * @example IANAZone.isValidSpecifier(\"America/New_York\") //=> true\n   * @example IANAZone.isValidSpecifier(\"Sport~~blorp\") //=> false\n   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.\n   * @return {boolean}\n   */\n  static isValidSpecifier(s) {\n    return this.isValidZone(s);\n  }\n\n  /**\n   * Returns whether the provided string identifies a real zone\n   * @param {string} zone - The string to check\n   * @example IANAZone.isValidZone(\"America/New_York\") //=> true\n   * @example IANAZone.isValidZone(\"Fantasia/Castle\") //=> false\n   * @example IANAZone.isValidZone(\"Sport~~blorp\") //=> false\n   * @return {boolean}\n   */\n  static isValidZone(zone) {\n    if (!zone) {\n      return false;\n    }\n    try {\n      new Intl.DateTimeFormat(\"en-US\", { timeZone: zone }).format();\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  constructor(name) {\n    super();\n    /** @private **/\n    this.zoneName = name;\n    /** @private **/\n    this.valid = IANAZone.isValidZone(name);\n  }\n\n  /**\n   * The type of zone. `iana` for all instances of `IANAZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"iana\";\n  }\n\n  /**\n   * The name of this zone (i.e. the IANA zone name).\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.zoneName;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns false for all IANA zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return false;\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale, this.name);\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    if (!this.valid) return NaN;\n    const date = new Date(ts);\n\n    if (isNaN(date)) return NaN;\n\n    const dtf = makeDTF(this.name);\n    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts\n      ? partsOffset(dtf, date)\n      : hackyOffset(dtf, date);\n\n    if (adOrBc === \"BC\") {\n      year = -Math.abs(year) + 1;\n    }\n\n    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat\n    const adjustedHour = hour === 24 ? 0 : hour;\n\n    const asUTC = objToLocalTS({\n      year,\n      month,\n      day,\n      hour: adjustedHour,\n      minute,\n      second,\n      millisecond: 0,\n    });\n\n    let asTS = +date;\n    const over = asTS % 1000;\n    asTS -= over >= 0 ? over : 1000 + over;\n    return (asUTC - asTS) / (60 * 1000);\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"iana\" && otherZone.name === this.name;\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.valid;\n  }\n}\n","import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from \"./util.js\";\nimport * as English from \"./english.js\";\nimport Settings from \"../settings.js\";\nimport DateTime from \"../datetime.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n// todo - remap caching\n\nlet intlLFCache = {};\nfunction getCachedLF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlLFCache[key];\n  if (!dtf) {\n    dtf = new Intl.ListFormat(locString, opts);\n    intlLFCache[key] = dtf;\n  }\n  return dtf;\n}\n\nconst intlDTCache = new Map();\nfunction getCachedDTF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlDTCache.get(key);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(locString, opts);\n    intlDTCache.set(key, dtf);\n  }\n  return dtf;\n}\n\nconst intlNumCache = new Map();\nfunction getCachedINF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let inf = intlNumCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.NumberFormat(locString, opts);\n    intlNumCache.set(key, inf);\n  }\n  return inf;\n}\n\nconst intlRelCache = new Map();\nfunction getCachedRTF(locString, opts = {}) {\n  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options\n  const key = JSON.stringify([locString, cacheKeyOpts]);\n  let inf = intlRelCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.RelativeTimeFormat(locString, opts);\n    intlRelCache.set(key, inf);\n  }\n  return inf;\n}\n\nlet sysLocaleCache = null;\nfunction systemLocale() {\n  if (sysLocaleCache) {\n    return sysLocaleCache;\n  } else {\n    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;\n    return sysLocaleCache;\n  }\n}\n\nconst intlResolvedOptionsCache = new Map();\nfunction getCachedIntResolvedOptions(locString) {\n  let opts = intlResolvedOptionsCache.get(locString);\n  if (opts === undefined) {\n    opts = new Intl.DateTimeFormat(locString).resolvedOptions();\n    intlResolvedOptionsCache.set(locString, opts);\n  }\n  return opts;\n}\n\nconst weekInfoCache = new Map();\nfunction getCachedWeekInfo(locString) {\n  let data = weekInfoCache.get(locString);\n  if (!data) {\n    const locale = new Intl.Locale(locString);\n    // browsers currently implement this as a property, but spec says it should be a getter function\n    data = \"getWeekInfo\" in locale ? locale.getWeekInfo() : locale.weekInfo;\n    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86\n    if (!(\"minimalDays\" in data)) {\n      data = { ...fallbackWeekSettings, ...data };\n    }\n    weekInfoCache.set(locString, data);\n  }\n  return data;\n}\n\nfunction parseLocaleString(localeStr) {\n  // I really want to avoid writing a BCP 47 parser\n  // see, e.g. https://github.com/wooorm/bcp-47\n  // Instead, we'll do this:\n\n  // a) if the string has no -u extensions, just leave it alone\n  // b) if it does, use Intl to resolve everything\n  // c) if Intl fails, try again without the -u\n\n  // private subtags and unicode subtags have ordering requirements,\n  // and we're not properly parsing this, so just strip out the\n  // private ones if they exist.\n  const xIndex = localeStr.indexOf(\"-x-\");\n  if (xIndex !== -1) {\n    localeStr = localeStr.substring(0, xIndex);\n  }\n\n  const uIndex = localeStr.indexOf(\"-u-\");\n  if (uIndex === -1) {\n    return [localeStr];\n  } else {\n    let options;\n    let selectedStr;\n    try {\n      options = getCachedDTF(localeStr).resolvedOptions();\n      selectedStr = localeStr;\n    } catch (e) {\n      const smaller = localeStr.substring(0, uIndex);\n      options = getCachedDTF(smaller).resolvedOptions();\n      selectedStr = smaller;\n    }\n\n    const { numberingSystem, calendar } = options;\n    return [selectedStr, numberingSystem, calendar];\n  }\n}\n\nfunction intlConfigString(localeStr, numberingSystem, outputCalendar) {\n  if (outputCalendar || numberingSystem) {\n    if (!localeStr.includes(\"-u-\")) {\n      localeStr += \"-u\";\n    }\n\n    if (outputCalendar) {\n      localeStr += `-ca-${outputCalendar}`;\n    }\n\n    if (numberingSystem) {\n      localeStr += `-nu-${numberingSystem}`;\n    }\n    return localeStr;\n  } else {\n    return localeStr;\n  }\n}\n\nfunction mapMonths(f) {\n  const ms = [];\n  for (let i = 1; i <= 12; i++) {\n    const dt = DateTime.utc(2009, i, 1);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction mapWeekdays(f) {\n  const ms = [];\n  for (let i = 1; i <= 7; i++) {\n    const dt = DateTime.utc(2016, 11, 13 + i);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction listStuff(loc, length, englishFn, intlFn) {\n  const mode = loc.listingMode();\n\n  if (mode === \"error\") {\n    return null;\n  } else if (mode === \"en\") {\n    return englishFn(length);\n  } else {\n    return intlFn(length);\n  }\n}\n\nfunction supportsFastNumbers(loc) {\n  if (loc.numberingSystem && loc.numberingSystem !== \"latn\") {\n    return false;\n  } else {\n    return (\n      loc.numberingSystem === \"latn\" ||\n      !loc.locale ||\n      loc.locale.startsWith(\"en\") ||\n      getCachedIntResolvedOptions(loc.locale).numberingSystem === \"latn\"\n    );\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyNumberFormatter {\n  constructor(intl, forceSimple, opts) {\n    this.padTo = opts.padTo || 0;\n    this.floor = opts.floor || false;\n\n    const { padTo, floor, ...otherOpts } = opts;\n\n    if (!forceSimple || Object.keys(otherOpts).length > 0) {\n      const intlOpts = { useGrouping: false, ...opts };\n      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;\n      this.inf = getCachedINF(intl, intlOpts);\n    }\n  }\n\n  format(i) {\n    if (this.inf) {\n      const fixed = this.floor ? Math.floor(i) : i;\n      return this.inf.format(fixed);\n    } else {\n      // to match the browser's numberformatter defaults\n      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);\n      return padStart(fixed, this.padTo);\n    }\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyDateFormatter {\n  constructor(dt, intl, opts) {\n    this.opts = opts;\n    this.originalZone = undefined;\n\n    let z = undefined;\n    if (this.opts.timeZone) {\n      // Don't apply any workarounds if a timeZone is explicitly provided in opts\n      this.dt = dt;\n    } else if (dt.zone.type === \"fixed\") {\n      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.\n      // That is why fixed-offset TZ is set to that unless it is:\n      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.\n      // 2. Unsupported by the browser:\n      //    - some do not support Etc/\n      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata\n      const gmtOffset = -1 * (dt.offset / 60);\n      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;\n      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {\n        z = offsetZ;\n        this.dt = dt;\n      } else {\n        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so\n        // we manually apply the offset and substitute the zone as needed.\n        z = \"UTC\";\n        this.dt = dt.offset === 0 ? dt : dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n        this.originalZone = dt.zone;\n      }\n    } else if (dt.zone.type === \"system\") {\n      this.dt = dt;\n    } else if (dt.zone.type === \"iana\") {\n      this.dt = dt;\n      z = dt.zone.name;\n    } else {\n      // Custom zones can have any offset / offsetName so we just manually\n      // apply the offset and substitute the zone as needed.\n      z = \"UTC\";\n      this.dt = dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n      this.originalZone = dt.zone;\n    }\n\n    const intlOpts = { ...this.opts };\n    intlOpts.timeZone = intlOpts.timeZone || z;\n    this.dtf = getCachedDTF(intl, intlOpts);\n  }\n\n  format() {\n    if (this.originalZone) {\n      // If we have to substitute in the actual zone name, we have to use\n      // formatToParts so that the timezone can be replaced.\n      return this.formatToParts()\n        .map(({ value }) => value)\n        .join(\"\");\n    }\n    return this.dtf.format(this.dt.toJSDate());\n  }\n\n  formatToParts() {\n    const parts = this.dtf.formatToParts(this.dt.toJSDate());\n    if (this.originalZone) {\n      return parts.map((part) => {\n        if (part.type === \"timeZoneName\") {\n          const offsetName = this.originalZone.offsetName(this.dt.ts, {\n            locale: this.dt.locale,\n            format: this.opts.timeZoneName,\n          });\n          return {\n            ...part,\n            value: offsetName,\n          };\n        } else {\n          return part;\n        }\n      });\n    }\n    return parts;\n  }\n\n  resolvedOptions() {\n    return this.dtf.resolvedOptions();\n  }\n}\n\n/**\n * @private\n */\nclass PolyRelFormatter {\n  constructor(intl, isEnglish, opts) {\n    this.opts = { style: \"long\", ...opts };\n    if (!isEnglish && hasRelative()) {\n      this.rtf = getCachedRTF(intl, opts);\n    }\n  }\n\n  format(count, unit) {\n    if (this.rtf) {\n      return this.rtf.format(count, unit);\n    } else {\n      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== \"long\");\n    }\n  }\n\n  formatToParts(count, unit) {\n    if (this.rtf) {\n      return this.rtf.formatToParts(count, unit);\n    } else {\n      return [];\n    }\n  }\n}\n\nconst fallbackWeekSettings = {\n  firstDay: 1,\n  minimalDays: 4,\n  weekend: [6, 7],\n};\n\n/**\n * @private\n */\nexport default class Locale {\n  static fromOpts(opts) {\n    return Locale.create(\n      opts.locale,\n      opts.numberingSystem,\n      opts.outputCalendar,\n      opts.weekSettings,\n      opts.defaultToEN\n    );\n  }\n\n  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {\n    const specifiedLocale = locale || Settings.defaultLocale;\n    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats\n    const localeR = specifiedLocale || (defaultToEN ? \"en-US\" : systemLocale());\n    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;\n    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;\n    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;\n    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);\n  }\n\n  static resetCache() {\n    sysLocaleCache = null;\n    intlDTCache.clear();\n    intlNumCache.clear();\n    intlRelCache.clear();\n    intlResolvedOptionsCache.clear();\n    weekInfoCache.clear();\n  }\n\n  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {\n    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);\n  }\n\n  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {\n    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);\n\n    this.locale = parsedLocale;\n    this.numberingSystem = numbering || parsedNumberingSystem || null;\n    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;\n    this.weekSettings = weekSettings;\n    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);\n\n    this.weekdaysCache = { format: {}, standalone: {} };\n    this.monthsCache = { format: {}, standalone: {} };\n    this.meridiemCache = null;\n    this.eraCache = {};\n\n    this.specifiedLocale = specifiedLocale;\n    this.fastNumbersCached = null;\n  }\n\n  get fastNumbers() {\n    if (this.fastNumbersCached == null) {\n      this.fastNumbersCached = supportsFastNumbers(this);\n    }\n\n    return this.fastNumbersCached;\n  }\n\n  listingMode() {\n    const isActuallyEn = this.isEnglish();\n    const hasNoWeirdness =\n      (this.numberingSystem === null || this.numberingSystem === \"latn\") &&\n      (this.outputCalendar === null || this.outputCalendar === \"gregory\");\n    return isActuallyEn && hasNoWeirdness ? \"en\" : \"intl\";\n  }\n\n  clone(alts) {\n    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {\n      return this;\n    } else {\n      return Locale.create(\n        alts.locale || this.specifiedLocale,\n        alts.numberingSystem || this.numberingSystem,\n        alts.outputCalendar || this.outputCalendar,\n        validateWeekSettings(alts.weekSettings) || this.weekSettings,\n        alts.defaultToEN || false\n      );\n    }\n  }\n\n  redefaultToEN(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: true });\n  }\n\n  redefaultToSystem(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: false });\n  }\n\n  months(length, format = false) {\n    return listStuff(this, length, English.months, () => {\n      // Workaround for \"ja\" locale: formatToParts does not label all parts of the month\n      // as \"month\" and for this locale there is no difference between \"format\" and \"non-format\".\n      // As such, just use format() instead of formatToParts() and take the whole string\n      const monthSpecialCase = this.intl === \"ja\" || this.intl.startsWith(\"ja-\");\n      format &= !monthSpecialCase;\n      const intl = format ? { month: length, day: \"numeric\" } : { month: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.monthsCache[formatStr][length]) {\n        const mapper = !monthSpecialCase\n          ? (dt) => this.extract(dt, intl, \"month\")\n          : (dt) => this.dtFormatter(dt, intl).format();\n        this.monthsCache[formatStr][length] = mapMonths(mapper);\n      }\n      return this.monthsCache[formatStr][length];\n    });\n  }\n\n  weekdays(length, format = false) {\n    return listStuff(this, length, English.weekdays, () => {\n      const intl = format\n          ? { weekday: length, year: \"numeric\", month: \"long\", day: \"numeric\" }\n          : { weekday: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.weekdaysCache[formatStr][length]) {\n        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>\n          this.extract(dt, intl, \"weekday\")\n        );\n      }\n      return this.weekdaysCache[formatStr][length];\n    });\n  }\n\n  meridiems() {\n    return listStuff(\n      this,\n      undefined,\n      () => English.meridiems,\n      () => {\n        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two\n        // for AM and PM. This is probably wrong, but it's makes parsing way easier.\n        if (!this.meridiemCache) {\n          const intl = { hour: \"numeric\", hourCycle: \"h12\" };\n          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(\n            (dt) => this.extract(dt, intl, \"dayperiod\")\n          );\n        }\n\n        return this.meridiemCache;\n      }\n    );\n  }\n\n  eras(length) {\n    return listStuff(this, length, English.eras, () => {\n      const intl = { era: length };\n\n      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates\n      // to definitely enumerate them.\n      if (!this.eraCache[length]) {\n        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>\n          this.extract(dt, intl, \"era\")\n        );\n      }\n\n      return this.eraCache[length];\n    });\n  }\n\n  extract(dt, intlOpts, field) {\n    const df = this.dtFormatter(dt, intlOpts),\n      results = df.formatToParts(),\n      matching = results.find((m) => m.type.toLowerCase() === field);\n    return matching ? matching.value : null;\n  }\n\n  numberFormatter(opts = {}) {\n    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)\n    // (in contrast, the rest of the condition is used heavily)\n    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);\n  }\n\n  dtFormatter(dt, intlOpts = {}) {\n    return new PolyDateFormatter(dt, this.intl, intlOpts);\n  }\n\n  relFormatter(opts = {}) {\n    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);\n  }\n\n  listFormatter(opts = {}) {\n    return getCachedLF(this.intl, opts);\n  }\n\n  isEnglish() {\n    return (\n      this.locale === \"en\" ||\n      this.locale.toLowerCase() === \"en-us\" ||\n      getCachedIntResolvedOptions(this.intl).locale.startsWith(\"en-us\")\n    );\n  }\n\n  getWeekSettings() {\n    if (this.weekSettings) {\n      return this.weekSettings;\n    } else if (!hasLocaleWeekInfo()) {\n      return fallbackWeekSettings;\n    } else {\n      return getCachedWeekInfo(this.locale);\n    }\n  }\n\n  getStartOfWeek() {\n    return this.getWeekSettings().firstDay;\n  }\n\n  getMinDaysInFirstWeek() {\n    return this.getWeekSettings().minimalDays;\n  }\n\n  getWeekendDays() {\n    return this.getWeekSettings().weekend;\n  }\n\n  equals(other) {\n    return (\n      this.locale === other.locale &&\n      this.numberingSystem === other.numberingSystem &&\n      this.outputCalendar === other.outputCalendar\n    );\n  }\n\n  toString() {\n    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;\n  }\n}\n","import { formatOffset, signedOffset } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * A zone with a fixed offset (meaning no DST)\n * @implements {Zone}\n */\nexport default class FixedOffsetZone extends Zone {\n  /**\n   * Get a singleton instance of UTC\n   * @return {FixedOffsetZone}\n   */\n  static get utcInstance() {\n    if (singleton === null) {\n      singleton = new FixedOffsetZone(0);\n    }\n    return singleton;\n  }\n\n  /**\n   * Get an instance with a specified offset\n   * @param {number} offset - The offset in minutes\n   * @return {FixedOffsetZone}\n   */\n  static instance(offset) {\n    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);\n  }\n\n  /**\n   * Get an instance of FixedOffsetZone from a UTC offset string, like \"UTC+6\"\n   * @param {string} s - The offset string to parse\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+6\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+06\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC-6:00\")\n   * @return {FixedOffsetZone}\n   */\n  static parseSpecifier(s) {\n    if (s) {\n      const r = s.match(/^utc(?:([+-]\\d{1,2})(?::(\\d{2}))?)?$/i);\n      if (r) {\n        return new FixedOffsetZone(signedOffset(r[1], r[2]));\n      }\n    }\n    return null;\n  }\n\n  constructor(offset) {\n    super();\n    /** @private **/\n    this.fixed = offset;\n  }\n\n  /**\n   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"fixed\";\n  }\n\n  /**\n   * The name of this zone.\n   * All fixed zones' names always start with \"UTC\" (plus optional offset)\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.fixed === 0 ? \"UTC\" : `UTC${formatOffset(this.fixed, \"narrow\")}`;\n  }\n\n  /**\n   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`\n   *\n   * @override\n   * @type {string}\n   */\n  get ianaName() {\n    if (this.fixed === 0) {\n      return \"Etc/UTC\";\n    } else {\n      return `Etc/GMT${formatOffset(-this.fixed, \"narrow\")}`;\n    }\n  }\n\n  /**\n   * Returns the offset's common name at the specified timestamp.\n   *\n   * For fixed offset zones this equals to the zone name.\n   * @override\n   */\n  offsetName() {\n    return this.name;\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.fixed, format);\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns true for all fixed offset zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return true;\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   *\n   * For fixed offset zones, this is constant and does not depend on a timestamp.\n   * @override\n   * @return {number}\n   */\n  offset() {\n    return this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"fixed\" && otherZone.fixed === this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is valid:\n   * All fixed offset zones are valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return true;\n  }\n}\n","import Zone from \"../zone.js\";\n\n/**\n * A zone that failed to parse. You should never need to instantiate this.\n * @implements {Zone}\n */\nexport default class InvalidZone extends Zone {\n  constructor(zoneName) {\n    super();\n    /**  @private */\n    this.zoneName = zoneName;\n  }\n\n  /** @override **/\n  get type() {\n    return \"invalid\";\n  }\n\n  /** @override **/\n  get name() {\n    return this.zoneName;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName() {\n    return null;\n  }\n\n  /** @override **/\n  formatOffset() {\n    return \"\";\n  }\n\n  /** @override **/\n  offset() {\n    return NaN;\n  }\n\n  /** @override **/\n  equals() {\n    return false;\n  }\n\n  /** @override **/\n  get isValid() {\n    return false;\n  }\n}\n","/**\n * @private\n */\n\nimport Zone from \"../zone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport InvalidZone from \"../zones/invalidZone.js\";\n\nimport { isUndefined, isString, isNumber } from \"./util.js\";\nimport SystemZone from \"../zones/systemZone.js\";\n\nexport function normalizeZone(input, defaultZone) {\n  let offset;\n  if (isUndefined(input) || input === null) {\n    return defaultZone;\n  } else if (input instanceof Zone) {\n    return input;\n  } else if (isString(input)) {\n    const lowered = input.toLowerCase();\n    if (lowered === \"default\") return defaultZone;\n    else if (lowered === \"local\" || lowered === \"system\") return SystemZone.instance;\n    else if (lowered === \"utc\" || lowered === \"gmt\") return FixedOffsetZone.utcInstance;\n    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);\n  } else if (isNumber(input)) {\n    return FixedOffsetZone.instance(input);\n  } else if (typeof input === \"object\" && \"offset\" in input && typeof input.offset === \"function\") {\n    // This is dumb, but the instanceof check above doesn't seem to really work\n    // so we're duck checking it\n    return input;\n  } else {\n    return new InvalidZone(input);\n  }\n}\n","const numberingSystems = {\n  arab: \"[\\u0660-\\u0669]\",\n  arabext: \"[\\u06F0-\\u06F9]\",\n  bali: \"[\\u1B50-\\u1B59]\",\n  beng: \"[\\u09E6-\\u09EF]\",\n  deva: \"[\\u0966-\\u096F]\",\n  fullwide: \"[\\uFF10-\\uFF19]\",\n  gujr: \"[\\u0AE6-\\u0AEF]\",\n  hanidec: \"[〇|一|二|三|四|五|六|七|八|九]\",\n  khmr: \"[\\u17E0-\\u17E9]\",\n  knda: \"[\\u0CE6-\\u0CEF]\",\n  laoo: \"[\\u0ED0-\\u0ED9]\",\n  limb: \"[\\u1946-\\u194F]\",\n  mlym: \"[\\u0D66-\\u0D6F]\",\n  mong: \"[\\u1810-\\u1819]\",\n  mymr: \"[\\u1040-\\u1049]\",\n  orya: \"[\\u0B66-\\u0B6F]\",\n  tamldec: \"[\\u0BE6-\\u0BEF]\",\n  telu: \"[\\u0C66-\\u0C6F]\",\n  thai: \"[\\u0E50-\\u0E59]\",\n  tibt: \"[\\u0F20-\\u0F29]\",\n  latn: \"\\\\d\",\n};\n\nconst numberingSystemsUTF16 = {\n  arab: [1632, 1641],\n  arabext: [1776, 1785],\n  bali: [6992, 7001],\n  beng: [2534, 2543],\n  deva: [2406, 2415],\n  fullwide: [65296, 65303],\n  gujr: [2790, 2799],\n  khmr: [6112, 6121],\n  knda: [3302, 3311],\n  laoo: [3792, 3801],\n  limb: [6470, 6479],\n  mlym: [3430, 3439],\n  mong: [6160, 6169],\n  mymr: [4160, 4169],\n  orya: [2918, 2927],\n  tamldec: [3046, 3055],\n  telu: [3174, 3183],\n  thai: [3664, 3673],\n  tibt: [3872, 3881],\n};\n\nconst hanidecChars = numberingSystems.hanidec.replace(/[\\[|\\]]/g, \"\").split(\"\");\n\nexport function parseDigits(str) {\n  let value = parseInt(str, 10);\n  if (isNaN(value)) {\n    value = \"\";\n    for (let i = 0; i < str.length; i++) {\n      const code = str.charCodeAt(i);\n\n      if (str[i].search(numberingSystems.hanidec) !== -1) {\n        value += hanidecChars.indexOf(str[i]);\n      } else {\n        for (const key in numberingSystemsUTF16) {\n          const [min, max] = numberingSystemsUTF16[key];\n          if (code >= min && code <= max) {\n            value += code - min;\n          }\n        }\n      }\n    }\n    return parseInt(value, 10);\n  } else {\n    return value;\n  }\n}\n\n// cache of {numberingSystem: {append: regex}}\nconst digitRegexCache = new Map();\nexport function resetDigitRegexCache() {\n  digitRegexCache.clear();\n}\n\nexport function digitRegex({ numberingSystem }, append = \"\") {\n  const ns = numberingSystem || \"latn\";\n\n  let appendCache = digitRegexCache.get(ns);\n  if (appendCache === undefined) {\n    appendCache = new Map();\n    digitRegexCache.set(ns, appendCache);\n  }\n  let regex = appendCache.get(append);\n  if (regex === undefined) {\n    regex = new RegExp(`${numberingSystems[ns]}${append}`);\n    appendCache.set(append, regex);\n  }\n\n  return regex;\n}\n","import SystemZone from \"./zones/systemZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport DateTime from \"./datetime.js\";\n\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport { validateWeekSettings } from \"./impl/util.js\";\nimport { resetDigitRegexCache } from \"./impl/digits.js\";\n\nlet now = () => Date.now(),\n  defaultZone = \"system\",\n  defaultLocale = null,\n  defaultNumberingSystem = null,\n  defaultOutputCalendar = null,\n  twoDigitCutoffYear = 60,\n  throwOnInvalid,\n  defaultWeekSettings = null;\n\n/**\n * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.\n */\nexport default class Settings {\n  /**\n   * Get the callback for returning the current timestamp.\n   * @type {function}\n   */\n  static get now() {\n    return now;\n  }\n\n  /**\n   * Set the callback for returning the current timestamp.\n   * The function should return a number, which will be interpreted as an Epoch millisecond count\n   * @type {function}\n   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future\n   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time\n   */\n  static set now(n) {\n    now = n;\n  }\n\n  /**\n   * Set the default time zone to create DateTimes in. Does not affect existing instances.\n   * Use the value \"system\" to reset this value to the system's time zone.\n   * @type {string}\n   */\n  static set defaultZone(zone) {\n    defaultZone = zone;\n  }\n\n  /**\n   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.\n   * The default value is the system's time zone (the one set on the machine that runs this code).\n   * @type {Zone}\n   */\n  static get defaultZone() {\n    return normalizeZone(defaultZone, SystemZone.instance);\n  }\n\n  /**\n   * Get the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultLocale() {\n    return defaultLocale;\n  }\n\n  /**\n   * Set the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultLocale(locale) {\n    defaultLocale = locale;\n  }\n\n  /**\n   * Get the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultNumberingSystem() {\n    return defaultNumberingSystem;\n  }\n\n  /**\n   * Set the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultNumberingSystem(numberingSystem) {\n    defaultNumberingSystem = numberingSystem;\n  }\n\n  /**\n   * Get the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultOutputCalendar() {\n    return defaultOutputCalendar;\n  }\n\n  /**\n   * Set the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultOutputCalendar(outputCalendar) {\n    defaultOutputCalendar = outputCalendar;\n  }\n\n  /**\n   * @typedef {Object} WeekSettings\n   * @property {number} firstDay\n   * @property {number} minimalDays\n   * @property {number[]} weekend\n   */\n\n  /**\n   * @return {WeekSettings|null}\n   */\n  static get defaultWeekSettings() {\n    return defaultWeekSettings;\n  }\n\n  /**\n   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and\n   * how many days are required in the first week of a year.\n   * Does not affect existing instances.\n   *\n   * @param {WeekSettings|null} weekSettings\n   */\n  static set defaultWeekSettings(weekSettings) {\n    defaultWeekSettings = validateWeekSettings(weekSettings);\n  }\n\n  /**\n   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   */\n  static get twoDigitCutoffYear() {\n    return twoDigitCutoffYear;\n  }\n\n  /**\n   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century\n   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century\n   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950\n   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50\n   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50\n   */\n  static set twoDigitCutoffYear(cutoffYear) {\n    twoDigitCutoffYear = cutoffYear % 100;\n  }\n\n  /**\n   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static get throwOnInvalid() {\n    return throwOnInvalid;\n  }\n\n  /**\n   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static set throwOnInvalid(t) {\n    throwOnInvalid = t;\n  }\n\n  /**\n   * Reset Luxon's global caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCaches() {\n    Locale.resetCache();\n    IANAZone.resetCache();\n    DateTime.resetCache();\n    resetDigitRegexCache();\n  }\n}\n","export default class Invalid {\n  constructor(reason, explanation) {\n    this.reason = reason;\n    this.explanation = explanation;\n  }\n\n  toMessage() {\n    if (this.explanation) {\n      return `${this.reason}: ${this.explanation}`;\n    } else {\n      return this.reason;\n    }\n  }\n}\n","import {\n  integerBetween,\n  isLeapYear,\n  timeObject,\n  daysInYear,\n  daysInMonth,\n  weeksInWeekYear,\n  isInteger,\n  isUndefined,\n} from \"./util.js\";\nimport Invalid from \"./invalid.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],\n  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];\n\nfunction unitOutOfRange(unit, value) {\n  return new Invalid(\n    \"unit out of range\",\n    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`\n  );\n}\n\nexport function dayOfWeek(year, month, day) {\n  const d = new Date(Date.UTC(year, month - 1, day));\n\n  if (year < 100 && year >= 0) {\n    d.setUTCFullYear(d.getUTCFullYear() - 1900);\n  }\n\n  const js = d.getUTCDay();\n\n  return js === 0 ? 7 : js;\n}\n\nfunction computeOrdinal(year, month, day) {\n  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];\n}\n\nfunction uncomputeOrdinal(year, ordinal) {\n  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,\n    month0 = table.findIndex((i) => i < ordinal),\n    day = ordinal - table[month0];\n  return { month: month0 + 1, day };\n}\n\nexport function isoWeekdayToLocal(isoWeekday, startOfWeek) {\n  return ((isoWeekday - startOfWeek + 7) % 7) + 1;\n}\n\n/**\n * @private\n */\n\nexport function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { year, month, day } = gregObj,\n    ordinal = computeOrdinal(year, month, day),\n    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);\n\n  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),\n    weekYear;\n\n  if (weekNumber < 1) {\n    weekYear = year - 1;\n    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);\n  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {\n    weekYear = year + 1;\n    weekNumber = 1;\n  } else {\n    weekYear = year;\n  }\n\n  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };\n}\n\nexport function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { weekYear, weekNumber, weekday } = weekData,\n    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),\n    yearInDays = daysInYear(weekYear);\n\n  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,\n    year;\n\n  if (ordinal < 1) {\n    year = weekYear - 1;\n    ordinal += daysInYear(year);\n  } else if (ordinal > yearInDays) {\n    year = weekYear + 1;\n    ordinal -= daysInYear(weekYear);\n  } else {\n    year = weekYear;\n  }\n\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(weekData) };\n}\n\nexport function gregorianToOrdinal(gregData) {\n  const { year, month, day } = gregData;\n  const ordinal = computeOrdinal(year, month, day);\n  return { year, ordinal, ...timeObject(gregData) };\n}\n\nexport function ordinalToGregorian(ordinalData) {\n  const { year, ordinal } = ordinalData;\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(ordinalData) };\n}\n\n/**\n * Check if local week units like localWeekday are used in obj.\n * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.\n * Modifies obj in-place!\n * @param obj the object values\n */\nexport function usesLocalWeekValues(obj, loc) {\n  const hasLocaleWeekData =\n    !isUndefined(obj.localWeekday) ||\n    !isUndefined(obj.localWeekNumber) ||\n    !isUndefined(obj.localWeekYear);\n  if (hasLocaleWeekData) {\n    const hasIsoWeekData =\n      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);\n\n    if (hasIsoWeekData) {\n      throw new ConflictingSpecificationError(\n        \"Cannot mix locale-based week fields with ISO-based week fields\"\n      );\n    }\n    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;\n    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;\n    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;\n    delete obj.localWeekday;\n    delete obj.localWeekNumber;\n    delete obj.localWeekYear;\n    return {\n      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),\n      startOfWeek: loc.getStartOfWeek(),\n    };\n  } else {\n    return { minDaysInFirstWeek: 4, startOfWeek: 1 };\n  }\n}\n\nexport function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const validYear = isInteger(obj.weekYear),\n    validWeek = integerBetween(\n      obj.weekNumber,\n      1,\n      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)\n    ),\n    validWeekday = integerBetween(obj.weekday, 1, 7);\n\n  if (!validYear) {\n    return unitOutOfRange(\"weekYear\", obj.weekYear);\n  } else if (!validWeek) {\n    return unitOutOfRange(\"week\", obj.weekNumber);\n  } else if (!validWeekday) {\n    return unitOutOfRange(\"weekday\", obj.weekday);\n  } else return false;\n}\n\nexport function hasInvalidOrdinalData(obj) {\n  const validYear = isInteger(obj.year),\n    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validOrdinal) {\n    return unitOutOfRange(\"ordinal\", obj.ordinal);\n  } else return false;\n}\n\nexport function hasInvalidGregorianData(obj) {\n  const validYear = isInteger(obj.year),\n    validMonth = integerBetween(obj.month, 1, 12),\n    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validMonth) {\n    return unitOutOfRange(\"month\", obj.month);\n  } else if (!validDay) {\n    return unitOutOfRange(\"day\", obj.day);\n  } else return false;\n}\n\nexport function hasInvalidTimeData(obj) {\n  const { hour, minute, second, millisecond } = obj;\n  const validHour =\n      integerBetween(hour, 0, 23) ||\n      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),\n    validMinute = integerBetween(minute, 0, 59),\n    validSecond = integerBetween(second, 0, 59),\n    validMillisecond = integerBetween(millisecond, 0, 999);\n\n  if (!validHour) {\n    return unitOutOfRange(\"hour\", hour);\n  } else if (!validMinute) {\n    return unitOutOfRange(\"minute\", minute);\n  } else if (!validSecond) {\n    return unitOutOfRange(\"second\", second);\n  } else if (!validMillisecond) {\n    return unitOutOfRange(\"millisecond\", millisecond);\n  } else return false;\n}\n","/*\n  This is just a junk drawer, containing anything used across multiple classes.\n  Because Luxon is small(ish), this should stay small and we won't worry about splitting\n  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.\n*/\n\nimport { InvalidArgumentError } from \"../errors.js\";\nimport Settings from \"../settings.js\";\nimport { dayOfWeek, isoWeekdayToLocal } from \"./conversions.js\";\n\n/**\n * @private\n */\n\n// TYPES\n\nexport function isUndefined(o) {\n  return typeof o === \"undefined\";\n}\n\nexport function isNumber(o) {\n  return typeof o === \"number\";\n}\n\nexport function isInteger(o) {\n  return typeof o === \"number\" && o % 1 === 0;\n}\n\nexport function isString(o) {\n  return typeof o === \"string\";\n}\n\nexport function isDate(o) {\n  return Object.prototype.toString.call(o) === \"[object Date]\";\n}\n\n// CAPABILITIES\n\nexport function hasRelative() {\n  try {\n    return typeof Intl !== \"undefined\" && !!Intl.RelativeTimeFormat;\n  } catch (e) {\n    return false;\n  }\n}\n\nexport function hasLocaleWeekInfo() {\n  try {\n    return (\n      typeof Intl !== \"undefined\" &&\n      !!Intl.Locale &&\n      (\"weekInfo\" in Intl.Locale.prototype || \"getWeekInfo\" in Intl.Locale.prototype)\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n// OBJECTS AND ARRAYS\n\nexport function maybeArray(thing) {\n  return Array.isArray(thing) ? thing : [thing];\n}\n\nexport function bestBy(arr, by, compare) {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  return arr.reduce((best, next) => {\n    const pair = [by(next), next];\n    if (!best) {\n      return pair;\n    } else if (compare(best[0], pair[0]) === best[0]) {\n      return best;\n    } else {\n      return pair;\n    }\n  }, null)[1];\n}\n\nexport function pick(obj, keys) {\n  return keys.reduce((a, k) => {\n    a[k] = obj[k];\n    return a;\n  }, {});\n}\n\nexport function hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function validateWeekSettings(settings) {\n  if (settings == null) {\n    return null;\n  } else if (typeof settings !== \"object\") {\n    throw new InvalidArgumentError(\"Week settings must be an object\");\n  } else {\n    if (\n      !integerBetween(settings.firstDay, 1, 7) ||\n      !integerBetween(settings.minimalDays, 1, 7) ||\n      !Array.isArray(settings.weekend) ||\n      settings.weekend.some((v) => !integerBetween(v, 1, 7))\n    ) {\n      throw new InvalidArgumentError(\"Invalid week settings\");\n    }\n    return {\n      firstDay: settings.firstDay,\n      minimalDays: settings.minimalDays,\n      weekend: Array.from(settings.weekend),\n    };\n  }\n}\n\n// NUMBERS AND STRINGS\n\nexport function integerBetween(thing, bottom, top) {\n  return isInteger(thing) && thing >= bottom && thing <= top;\n}\n\n// x % n but takes the sign of n instead of x\nexport function floorMod(x, n) {\n  return x - n * Math.floor(x / n);\n}\n\nexport function padStart(input, n = 2) {\n  const isNeg = input < 0;\n  let padded;\n  if (isNeg) {\n    padded = \"-\" + (\"\" + -input).padStart(n, \"0\");\n  } else {\n    padded = (\"\" + input).padStart(n, \"0\");\n  }\n  return padded;\n}\n\nexport function parseInteger(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseInt(string, 10);\n  }\n}\n\nexport function parseFloating(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseFloat(string);\n  }\n}\n\nexport function parseMillis(fraction) {\n  // Return undefined (instead of 0) in these cases, where fraction is not set\n  if (isUndefined(fraction) || fraction === null || fraction === \"\") {\n    return undefined;\n  } else {\n    const f = parseFloat(\"0.\" + fraction) * 1000;\n    return Math.floor(f);\n  }\n}\n\nexport function roundTo(number, digits, rounding = \"round\") {\n  const factor = 10 ** digits;\n  switch (rounding) {\n    case \"expand\":\n      return number > 0\n        ? Math.ceil(number * factor) / factor\n        : Math.floor(number * factor) / factor;\n    case \"trunc\":\n      return Math.trunc(number * factor) / factor;\n    case \"round\":\n      return Math.round(number * factor) / factor;\n    case \"floor\":\n      return Math.floor(number * factor) / factor;\n    case \"ceil\":\n      return Math.ceil(number * factor) / factor;\n    default:\n      throw new RangeError(`Value rounding ${rounding} is out of range`);\n  }\n}\n\n// DATE BASICS\n\nexport function isLeapYear(year) {\n  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n\nexport function daysInYear(year) {\n  return isLeapYear(year) ? 366 : 365;\n}\n\nexport function daysInMonth(year, month) {\n  const modMonth = floorMod(month - 1, 12) + 1,\n    modYear = year + (month - modMonth) / 12;\n\n  if (modMonth === 2) {\n    return isLeapYear(modYear) ? 29 : 28;\n  } else {\n    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];\n  }\n}\n\n// convert a calendar object to a local timestamp (epoch, but with the offset baked in)\nexport function objToLocalTS(obj) {\n  let d = Date.UTC(\n    obj.year,\n    obj.month - 1,\n    obj.day,\n    obj.hour,\n    obj.minute,\n    obj.second,\n    obj.millisecond\n  );\n\n  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that\n  if (obj.year < 100 && obj.year >= 0) {\n    d = new Date(d);\n    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not\n    // so if obj.year is in 99, but obj.day makes it roll over into year 100,\n    // the calculations done by Date.UTC are using year 2000 - which is incorrect\n    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);\n  }\n  return +d;\n}\n\n// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js\nfunction firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {\n  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);\n  return -fwdlw + minDaysInFirstWeek - 1;\n}\n\nexport function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);\n  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);\n  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;\n}\n\nexport function untruncateYear(year) {\n  if (year > 99) {\n    return year;\n  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;\n}\n\n// PARSING\n\nexport function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {\n  const date = new Date(ts),\n    intlOpts = {\n      hourCycle: \"h23\",\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n    };\n\n  if (timeZone) {\n    intlOpts.timeZone = timeZone;\n  }\n\n  const modified = { timeZoneName: offsetFormat, ...intlOpts };\n\n  const parsed = new Intl.DateTimeFormat(locale, modified)\n    .formatToParts(date)\n    .find((m) => m.type.toLowerCase() === \"timezonename\");\n  return parsed ? parsed.value : null;\n}\n\n// signedOffset('-5', '30') -> -330\nexport function signedOffset(offHourStr, offMinuteStr) {\n  let offHour = parseInt(offHourStr, 10);\n\n  // don't || this because we want to preserve -0\n  if (Number.isNaN(offHour)) {\n    offHour = 0;\n  }\n\n  const offMin = parseInt(offMinuteStr, 10) || 0,\n    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;\n  return offHour * 60 + offMinSigned;\n}\n\n// COERCION\n\nexport function asNumber(value) {\n  const numericValue = Number(value);\n  if (typeof value === \"boolean\" || value === \"\" || !Number.isFinite(numericValue))\n    throw new InvalidArgumentError(`Invalid unit value ${value}`);\n  return numericValue;\n}\n\nexport function normalizeObject(obj, normalizer) {\n  const normalized = {};\n  for (const u in obj) {\n    if (hasOwnProperty(obj, u)) {\n      const v = obj[u];\n      if (v === undefined || v === null) continue;\n      normalized[normalizer(u)] = asNumber(v);\n    }\n  }\n  return normalized;\n}\n\n/**\n * Returns the offset's value as a string\n * @param {number} ts - Epoch milliseconds for which to get the offset\n * @param {string} format - What style of offset to return.\n *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n * @return {string}\n */\nexport function formatOffset(offset, format) {\n  const hours = Math.trunc(Math.abs(offset / 60)),\n    minutes = Math.trunc(Math.abs(offset % 60)),\n    sign = offset >= 0 ? \"+\" : \"-\";\n\n  switch (format) {\n    case \"short\":\n      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;\n    case \"narrow\":\n      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : \"\"}`;\n    case \"techie\":\n      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;\n    default:\n      throw new RangeError(`Value format ${format} is out of range for property format`);\n  }\n}\n\nexport function timeObject(obj) {\n  return pick(obj, [\"hour\", \"minute\", \"second\", \"millisecond\"]);\n}\n","import * as Formats from \"./formats.js\";\nimport { pick } from \"./util.js\";\n\nfunction stringify(obj) {\n  return JSON.stringify(obj, Object.keys(obj).sort());\n}\n\n/**\n * @private\n */\n\nexport const monthsLong = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n];\n\nexport const monthsShort = [\n  \"Jan\",\n  \"Feb\",\n  \"Mar\",\n  \"Apr\",\n  \"May\",\n  \"Jun\",\n  \"Jul\",\n  \"Aug\",\n  \"Sep\",\n  \"Oct\",\n  \"Nov\",\n  \"Dec\",\n];\n\nexport const monthsNarrow = [\"J\", \"F\", \"M\", \"A\", \"M\", \"J\", \"J\", \"A\", \"S\", \"O\", \"N\", \"D\"];\n\nexport function months(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...monthsNarrow];\n    case \"short\":\n      return [...monthsShort];\n    case \"long\":\n      return [...monthsLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"11\", \"12\"];\n    case \"2-digit\":\n      return [\"01\", \"02\", \"03\", \"04\", \"05\", \"06\", \"07\", \"08\", \"09\", \"10\", \"11\", \"12\"];\n    default:\n      return null;\n  }\n}\n\nexport const weekdaysLong = [\n  \"Monday\",\n  \"Tuesday\",\n  \"Wednesday\",\n  \"Thursday\",\n  \"Friday\",\n  \"Saturday\",\n  \"Sunday\",\n];\n\nexport const weekdaysShort = [\"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\"];\n\nexport const weekdaysNarrow = [\"M\", \"T\", \"W\", \"T\", \"F\", \"S\", \"S\"];\n\nexport function weekdays(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...weekdaysNarrow];\n    case \"short\":\n      return [...weekdaysShort];\n    case \"long\":\n      return [...weekdaysLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\"];\n    default:\n      return null;\n  }\n}\n\nexport const meridiems = [\"AM\", \"PM\"];\n\nexport const erasLong = [\"Before Christ\", \"Anno Domini\"];\n\nexport const erasShort = [\"BC\", \"AD\"];\n\nexport const erasNarrow = [\"B\", \"A\"];\n\nexport function eras(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...erasNarrow];\n    case \"short\":\n      return [...erasShort];\n    case \"long\":\n      return [...erasLong];\n    default:\n      return null;\n  }\n}\n\nexport function meridiemForDateTime(dt) {\n  return meridiems[dt.hour < 12 ? 0 : 1];\n}\n\nexport function weekdayForDateTime(dt, length) {\n  return weekdays(length)[dt.weekday - 1];\n}\n\nexport function monthForDateTime(dt, length) {\n  return months(length)[dt.month - 1];\n}\n\nexport function eraForDateTime(dt, length) {\n  return eras(length)[dt.year < 0 ? 0 : 1];\n}\n\nexport function formatRelativeTime(unit, count, numeric = \"always\", narrow = false) {\n  const units = {\n    years: [\"year\", \"yr.\"],\n    quarters: [\"quarter\", \"qtr.\"],\n    months: [\"month\", \"mo.\"],\n    weeks: [\"week\", \"wk.\"],\n    days: [\"day\", \"day\", \"days\"],\n    hours: [\"hour\", \"hr.\"],\n    minutes: [\"minute\", \"min.\"],\n    seconds: [\"second\", \"sec.\"],\n  };\n\n  const lastable = [\"hours\", \"minutes\", \"seconds\"].indexOf(unit) === -1;\n\n  if (numeric === \"auto\" && lastable) {\n    const isDay = unit === \"days\";\n    switch (count) {\n      case 1:\n        return isDay ? \"tomorrow\" : `next ${units[unit][0]}`;\n      case -1:\n        return isDay ? \"yesterday\" : `last ${units[unit][0]}`;\n      case 0:\n        return isDay ? \"today\" : `this ${units[unit][0]}`;\n      default: // fall through\n    }\n  }\n\n  const isInPast = Object.is(count, -0) || count < 0,\n    fmtValue = Math.abs(count),\n    singular = fmtValue === 1,\n    lilUnits = units[unit],\n    fmtUnit = narrow\n      ? singular\n        ? lilUnits[1]\n        : lilUnits[2] || lilUnits[1]\n      : singular\n      ? units[unit][0]\n      : unit;\n  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;\n}\n\nexport function formatString(knownFormat) {\n  // these all have the offsets removed because we don't have access to them\n  // without all the intl stuff this is backfilling\n  const filtered = pick(knownFormat, [\n      \"weekday\",\n      \"era\",\n      \"year\",\n      \"month\",\n      \"day\",\n      \"hour\",\n      \"minute\",\n      \"second\",\n      \"timeZoneName\",\n      \"hourCycle\",\n    ]),\n    key = stringify(filtered),\n    dateTimeHuge = \"EEEE, LLLL d, yyyy, h:mm a\";\n  switch (key) {\n    case stringify(Formats.DATE_SHORT):\n      return \"M/d/yyyy\";\n    case stringify(Formats.DATE_MED):\n      return \"LLL d, yyyy\";\n    case stringify(Formats.DATE_MED_WITH_WEEKDAY):\n      return \"EEE, LLL d, yyyy\";\n    case stringify(Formats.DATE_FULL):\n      return \"LLLL d, yyyy\";\n    case stringify(Formats.DATE_HUGE):\n      return \"EEEE, LLLL d, yyyy\";\n    case stringify(Formats.TIME_SIMPLE):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_SECONDS):\n      return \"h:mm:ss a\";\n    case stringify(Formats.TIME_WITH_SHORT_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_LONG_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_24_SIMPLE):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_SECONDS):\n      return \"HH:mm:ss\";\n    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.DATETIME_SHORT):\n      return \"M/d/yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_MED):\n      return \"LLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL):\n      return \"LLLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_HUGE):\n      return dateTimeHuge;\n    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):\n      return \"M/d/yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_SECONDS):\n      return \"LLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):\n      return \"EEE, d LLL yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):\n      return \"LLLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):\n      return \"EEEE, LLLL d, yyyy, h:mm:ss a\";\n    default:\n      return dateTimeHuge;\n  }\n}\n","import * as English from \"./english.js\";\nimport * as Formats from \"./formats.js\";\nimport { padStart } from \"./util.js\";\n\nfunction stringifyTokens(splits, tokenToString) {\n  let s = \"\";\n  for (const token of splits) {\n    if (token.literal) {\n      s += token.val;\n    } else {\n      s += tokenToString(token.val);\n    }\n  }\n  return s;\n}\n\nconst macroTokenToFormatOpts = {\n  D: Formats.DATE_SHORT,\n  DD: Formats.DATE_MED,\n  DDD: Formats.DATE_FULL,\n  DDDD: Formats.DATE_HUGE,\n  t: Formats.TIME_SIMPLE,\n  tt: Formats.TIME_WITH_SECONDS,\n  ttt: Formats.TIME_WITH_SHORT_OFFSET,\n  tttt: Formats.TIME_WITH_LONG_OFFSET,\n  T: Formats.TIME_24_SIMPLE,\n  TT: Formats.TIME_24_WITH_SECONDS,\n  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,\n  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,\n  f: Formats.DATETIME_SHORT,\n  ff: Formats.DATETIME_MED,\n  fff: Formats.DATETIME_FULL,\n  ffff: Formats.DATETIME_HUGE,\n  F: Formats.DATETIME_SHORT_WITH_SECONDS,\n  FF: Formats.DATETIME_MED_WITH_SECONDS,\n  FFF: Formats.DATETIME_FULL_WITH_SECONDS,\n  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,\n};\n\n/**\n * @private\n */\n\nexport default class Formatter {\n  static create(locale, opts = {}) {\n    return new Formatter(locale, opts);\n  }\n\n  static parseFormat(fmt) {\n    // white-space is always considered a literal in user-provided formats\n    // the \" \" token has a special meaning (see unitForToken)\n\n    let current = null,\n      currentFull = \"\",\n      bracketed = false;\n    const splits = [];\n    for (let i = 0; i < fmt.length; i++) {\n      const c = fmt.charAt(i);\n      if (c === \"'\") {\n        // turn '' into a literal signal quote instead of just skipping the empty literal\n        if (currentFull.length > 0 || bracketed) {\n          splits.push({\n            literal: bracketed || /^\\s+$/.test(currentFull),\n            val: currentFull === \"\" ? \"'\" : currentFull,\n          });\n        }\n        current = null;\n        currentFull = \"\";\n        bracketed = !bracketed;\n      } else if (bracketed) {\n        currentFull += c;\n      } else if (c === current) {\n        currentFull += c;\n      } else {\n        if (currentFull.length > 0) {\n          splits.push({ literal: /^\\s+$/.test(currentFull), val: currentFull });\n        }\n        currentFull = c;\n        current = c;\n      }\n    }\n\n    if (currentFull.length > 0) {\n      splits.push({ literal: bracketed || /^\\s+$/.test(currentFull), val: currentFull });\n    }\n\n    return splits;\n  }\n\n  static macroTokenToFormatOpts(token) {\n    return macroTokenToFormatOpts[token];\n  }\n\n  constructor(locale, formatOpts) {\n    this.opts = formatOpts;\n    this.loc = locale;\n    this.systemLoc = null;\n  }\n\n  formatWithSystemDefault(dt, opts) {\n    if (this.systemLoc === null) {\n      this.systemLoc = this.loc.redefaultToSystem();\n    }\n    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });\n    return df.format();\n  }\n\n  dtFormatter(dt, opts = {}) {\n    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });\n  }\n\n  formatDateTime(dt, opts) {\n    return this.dtFormatter(dt, opts).format();\n  }\n\n  formatDateTimeParts(dt, opts) {\n    return this.dtFormatter(dt, opts).formatToParts();\n  }\n\n  formatInterval(interval, opts) {\n    const df = this.dtFormatter(interval.start, opts);\n    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());\n  }\n\n  resolvedOptions(dt, opts) {\n    return this.dtFormatter(dt, opts).resolvedOptions();\n  }\n\n  num(n, p = 0, signDisplay = undefined) {\n    // we get some perf out of doing this here, annoyingly\n    if (this.opts.forceSimple) {\n      return padStart(n, p);\n    }\n\n    const opts = { ...this.opts };\n\n    if (p > 0) {\n      opts.padTo = p;\n    }\n    if (signDisplay) {\n      opts.signDisplay = signDisplay;\n    }\n\n    return this.loc.numberFormatter(opts).format(n);\n  }\n\n  formatDateTimeFromString(dt, fmt) {\n    const knownEnglish = this.loc.listingMode() === \"en\",\n      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== \"gregory\",\n      string = (opts, extract) => this.loc.extract(dt, opts, extract),\n      formatOffset = (opts) => {\n        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {\n          return \"Z\";\n        }\n\n        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : \"\";\n      },\n      meridiem = () =>\n        knownEnglish\n          ? English.meridiemForDateTime(dt)\n          : string({ hour: \"numeric\", hourCycle: \"h12\" }, \"dayperiod\"),\n      month = (length, standalone) =>\n        knownEnglish\n          ? English.monthForDateTime(dt, length)\n          : string(standalone ? { month: length } : { month: length, day: \"numeric\" }, \"month\"),\n      weekday = (length, standalone) =>\n        knownEnglish\n          ? English.weekdayForDateTime(dt, length)\n          : string(\n              standalone ? { weekday: length } : { weekday: length, month: \"long\", day: \"numeric\" },\n              \"weekday\"\n            ),\n      maybeMacro = (token) => {\n        const formatOpts = Formatter.macroTokenToFormatOpts(token);\n        if (formatOpts) {\n          return this.formatWithSystemDefault(dt, formatOpts);\n        } else {\n          return token;\n        }\n      },\n      era = (length) =>\n        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, \"era\"),\n      tokenToString = (token) => {\n        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols\n        switch (token) {\n          // ms\n          case \"S\":\n            return this.num(dt.millisecond);\n          case \"u\":\n          // falls through\n          case \"SSS\":\n            return this.num(dt.millisecond, 3);\n          // seconds\n          case \"s\":\n            return this.num(dt.second);\n          case \"ss\":\n            return this.num(dt.second, 2);\n          // fractional seconds\n          case \"uu\":\n            return this.num(Math.floor(dt.millisecond / 10), 2);\n          case \"uuu\":\n            return this.num(Math.floor(dt.millisecond / 100));\n          // minutes\n          case \"m\":\n            return this.num(dt.minute);\n          case \"mm\":\n            return this.num(dt.minute, 2);\n          // hours\n          case \"h\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);\n          case \"hh\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);\n          case \"H\":\n            return this.num(dt.hour);\n          case \"HH\":\n            return this.num(dt.hour, 2);\n          // offset\n          case \"Z\":\n            // like +6\n            return formatOffset({ format: \"narrow\", allowZ: this.opts.allowZ });\n          case \"ZZ\":\n            // like +06:00\n            return formatOffset({ format: \"short\", allowZ: this.opts.allowZ });\n          case \"ZZZ\":\n            // like +0600\n            return formatOffset({ format: \"techie\", allowZ: this.opts.allowZ });\n          case \"ZZZZ\":\n            // like EST\n            return dt.zone.offsetName(dt.ts, { format: \"short\", locale: this.loc.locale });\n          case \"ZZZZZ\":\n            // like Eastern Standard Time\n            return dt.zone.offsetName(dt.ts, { format: \"long\", locale: this.loc.locale });\n          // zone\n          case \"z\":\n            // like America/New_York\n            return dt.zoneName;\n          // meridiems\n          case \"a\":\n            return meridiem();\n          // dates\n          case \"d\":\n            return useDateTimeFormatter ? string({ day: \"numeric\" }, \"day\") : this.num(dt.day);\n          case \"dd\":\n            return useDateTimeFormatter ? string({ day: \"2-digit\" }, \"day\") : this.num(dt.day, 2);\n          // weekdays - standalone\n          case \"c\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"ccc\":\n            // like 'Tues'\n            return weekday(\"short\", true);\n          case \"cccc\":\n            // like 'Tuesday'\n            return weekday(\"long\", true);\n          case \"ccccc\":\n            // like 'T'\n            return weekday(\"narrow\", true);\n          // weekdays - format\n          case \"E\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"EEE\":\n            // like 'Tues'\n            return weekday(\"short\", false);\n          case \"EEEE\":\n            // like 'Tuesday'\n            return weekday(\"long\", false);\n          case \"EEEEE\":\n            // like 'T'\n            return weekday(\"narrow\", false);\n          // months - standalone\n          case \"L\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"LL\":\n            // like 01, doesn't seem to work\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"LLL\":\n            // like Jan\n            return month(\"short\", true);\n          case \"LLLL\":\n            // like January\n            return month(\"long\", true);\n          case \"LLLLL\":\n            // like J\n            return month(\"narrow\", true);\n          // months - format\n          case \"M\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"MM\":\n            // like 01\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"MMM\":\n            // like Jan\n            return month(\"short\", false);\n          case \"MMMM\":\n            // like January\n            return month(\"long\", false);\n          case \"MMMMM\":\n            // like J\n            return month(\"narrow\", false);\n          // years\n          case \"y\":\n            // like 2014\n            return useDateTimeFormatter ? string({ year: \"numeric\" }, \"year\") : this.num(dt.year);\n          case \"yy\":\n            // like 14\n            return useDateTimeFormatter\n              ? string({ year: \"2-digit\" }, \"year\")\n              : this.num(dt.year.toString().slice(-2), 2);\n          case \"yyyy\":\n            // like 0012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 4);\n          case \"yyyyyy\":\n            // like 000012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 6);\n          // eras\n          case \"G\":\n            // like AD\n            return era(\"short\");\n          case \"GG\":\n            // like Anno Domini\n            return era(\"long\");\n          case \"GGGGG\":\n            return era(\"narrow\");\n          case \"kk\":\n            return this.num(dt.weekYear.toString().slice(-2), 2);\n          case \"kkkk\":\n            return this.num(dt.weekYear, 4);\n          case \"W\":\n            return this.num(dt.weekNumber);\n          case \"WW\":\n            return this.num(dt.weekNumber, 2);\n          case \"n\":\n            return this.num(dt.localWeekNumber);\n          case \"nn\":\n            return this.num(dt.localWeekNumber, 2);\n          case \"ii\":\n            return this.num(dt.localWeekYear.toString().slice(-2), 2);\n          case \"iiii\":\n            return this.num(dt.localWeekYear, 4);\n          case \"o\":\n            return this.num(dt.ordinal);\n          case \"ooo\":\n            return this.num(dt.ordinal, 3);\n          case \"q\":\n            // like 1\n            return this.num(dt.quarter);\n          case \"qq\":\n            // like 01\n            return this.num(dt.quarter, 2);\n          case \"X\":\n            return this.num(Math.floor(dt.ts / 1000));\n          case \"x\":\n            return this.num(dt.ts);\n          default:\n            return maybeMacro(token);\n        }\n      };\n\n    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);\n  }\n\n  formatDurationFromString(dur, fmt) {\n    const invertLargest = this.opts.signMode === \"negativeLargestOnly\" ? -1 : 1;\n    const tokenToField = (token) => {\n        switch (token[0]) {\n          case \"S\":\n            return \"milliseconds\";\n          case \"s\":\n            return \"seconds\";\n          case \"m\":\n            return \"minutes\";\n          case \"h\":\n            return \"hours\";\n          case \"d\":\n            return \"days\";\n          case \"w\":\n            return \"weeks\";\n          case \"M\":\n            return \"months\";\n          case \"y\":\n            return \"years\";\n          default:\n            return null;\n        }\n      },\n      tokenToString = (lildur, info) => (token) => {\n        const mapped = tokenToField(token);\n        if (mapped) {\n          const inversionFactor =\n            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;\n          let signDisplay;\n          if (this.opts.signMode === \"negativeLargestOnly\" && mapped !== info.largestUnit) {\n            signDisplay = \"never\";\n          } else if (this.opts.signMode === \"all\") {\n            signDisplay = \"always\";\n          } else {\n            // \"auto\" and \"negative\" are the same, but \"auto\" has better support\n            signDisplay = \"auto\";\n          }\n          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);\n        } else {\n          return token;\n        }\n      },\n      tokens = Formatter.parseFormat(fmt),\n      realTokens = tokens.reduce(\n        (found, { literal, val }) => (literal ? found : found.concat(val)),\n        []\n      ),\n      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),\n      durationInfo = {\n        isNegativeDuration: collapsed < 0,\n        // this relies on \"collapsed\" being based on \"shiftTo\", which builds up the object\n        // in order\n        largestUnit: Object.keys(collapsed.values)[0],\n      };\n    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));\n  }\n}\n","import {\n  untruncateYear,\n  signedOffset,\n  parseInteger,\n  parseMillis,\n  isUndefined,\n  parseFloating,\n} from \"./util.js\";\nimport * as English from \"./english.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n/*\n * This file handles parsing for well-specified formats. Here's how it works:\n * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.\n * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object\n * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.\n * Extractors can take a \"cursor\" representing the offset in the match to look at. This makes it easy to combine extractors.\n * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.\n * Some extractions are super dumb and simpleParse and fromStrings help DRY them.\n */\n\nconst ianaRegex = /[A-Za-z_+-]{1,256}(?::?\\/[A-Za-z0-9_+-]{1,256}(?:\\/[A-Za-z0-9_+-]{1,256})?)?/;\n\nfunction combineRegexes(...regexes) {\n  const full = regexes.reduce((f, r) => f + r.source, \"\");\n  return RegExp(`^${full}$`);\n}\n\nfunction combineExtractors(...extractors) {\n  return (m) =>\n    extractors\n      .reduce(\n        ([mergedVals, mergedZone, cursor], ex) => {\n          const [val, zone, next] = ex(m, cursor);\n          return [{ ...mergedVals, ...val }, zone || mergedZone, next];\n        },\n        [{}, null, 1]\n      )\n      .slice(0, 2);\n}\n\nfunction parse(s, ...patterns) {\n  if (s == null) {\n    return [null, null];\n  }\n\n  for (const [regex, extractor] of patterns) {\n    const m = regex.exec(s);\n    if (m) {\n      return extractor(m);\n    }\n  }\n  return [null, null];\n}\n\nfunction simpleParse(...keys) {\n  return (match, cursor) => {\n    const ret = {};\n    let i;\n\n    for (i = 0; i < keys.length; i++) {\n      ret[keys[i]] = parseInteger(match[cursor + i]);\n    }\n    return [ret, null, cursor + i];\n  };\n}\n\n// ISO and SQL parsing\nconst offsetRegex = /(?:([Zz])|([+-]\\d\\d)(?::?(\\d\\d))?)/;\nconst isoExtendedZone = `(?:${offsetRegex.source}?(?:\\\\[(${ianaRegex.source})\\\\])?)?`;\nconst isoTimeBaseRegex = /(\\d\\d)(?::?(\\d\\d)(?::?(\\d\\d)(?:[.,](\\d{1,30}))?)?)?/;\nconst isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);\nconst isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);\nconst isoYmdRegex = /([+-]\\d{6}|\\d{4})(?:-?(\\d\\d)(?:-?(\\d\\d))?)?/;\nconst isoWeekRegex = /(\\d{4})-?W(\\d\\d)(?:-?(\\d))?/;\nconst isoOrdinalRegex = /(\\d{4})-?(\\d{3})/;\nconst extractISOWeekData = simpleParse(\"weekYear\", \"weekNumber\", \"weekDay\");\nconst extractISOOrdinalData = simpleParse(\"year\", \"ordinal\");\nconst sqlYmdRegex = /(\\d{4})-(\\d\\d)-(\\d\\d)/; // dumbed-down version of the ISO one\nconst sqlTimeRegex = RegExp(\n  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`\n);\nconst sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);\n\nfunction int(match, pos, fallback) {\n  const m = match[pos];\n  return isUndefined(m) ? fallback : parseInteger(m);\n}\n\nfunction extractISOYmd(match, cursor) {\n  const item = {\n    year: int(match, cursor),\n    month: int(match, cursor + 1, 1),\n    day: int(match, cursor + 2, 1),\n  };\n\n  return [item, null, cursor + 3];\n}\n\nfunction extractISOTime(match, cursor) {\n  const item = {\n    hours: int(match, cursor, 0),\n    minutes: int(match, cursor + 1, 0),\n    seconds: int(match, cursor + 2, 0),\n    milliseconds: parseMillis(match[cursor + 3]),\n  };\n\n  return [item, null, cursor + 4];\n}\n\nfunction extractISOOffset(match, cursor) {\n  const local = !match[cursor] && !match[cursor + 1],\n    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),\n    zone = local ? null : FixedOffsetZone.instance(fullOffset);\n  return [{}, zone, cursor + 3];\n}\n\nfunction extractIANAZone(match, cursor) {\n  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;\n  return [{}, zone, cursor + 1];\n}\n\n// ISO time parsing\n\nconst isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);\n\n// ISO duration parsing\n\nconst isoDuration =\n  /^-?P(?:(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)Y)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)W)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)D)?(?:T(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)H)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20})(?:[.,](-?\\d{1,20}))?S)?)?)$/;\n\nfunction extractISODuration(match) {\n  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =\n    match;\n\n  const hasNegativePrefix = s[0] === \"-\";\n  const negativeSeconds = secondStr && secondStr[0] === \"-\";\n\n  const maybeNegate = (num, force = false) =>\n    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;\n\n  return [\n    {\n      years: maybeNegate(parseFloating(yearStr)),\n      months: maybeNegate(parseFloating(monthStr)),\n      weeks: maybeNegate(parseFloating(weekStr)),\n      days: maybeNegate(parseFloating(dayStr)),\n      hours: maybeNegate(parseFloating(hourStr)),\n      minutes: maybeNegate(parseFloating(minuteStr)),\n      seconds: maybeNegate(parseFloating(secondStr), secondStr === \"-0\"),\n      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),\n    },\n  ];\n}\n\n// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York\n// and not just that we're in -240 *right now*. But since I don't think these are used that often\n// I'm just going to ignore that\nconst obsOffsets = {\n  GMT: 0,\n  EDT: -4 * 60,\n  EST: -5 * 60,\n  CDT: -5 * 60,\n  CST: -6 * 60,\n  MDT: -6 * 60,\n  MST: -7 * 60,\n  PDT: -7 * 60,\n  PST: -8 * 60,\n};\n\nfunction fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {\n  const result = {\n    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),\n    month: English.monthsShort.indexOf(monthStr) + 1,\n    day: parseInteger(dayStr),\n    hour: parseInteger(hourStr),\n    minute: parseInteger(minuteStr),\n  };\n\n  if (secondStr) result.second = parseInteger(secondStr);\n  if (weekdayStr) {\n    result.weekday =\n      weekdayStr.length > 3\n        ? English.weekdaysLong.indexOf(weekdayStr) + 1\n        : English.weekdaysShort.indexOf(weekdayStr) + 1;\n  }\n\n  return result;\n}\n\n// RFC 2822/5322\nconst rfc2822 =\n  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\\d\\d)(\\d\\d)))$/;\n\nfunction extractRFC2822(match) {\n  const [\n      ,\n      weekdayStr,\n      dayStr,\n      monthStr,\n      yearStr,\n      hourStr,\n      minuteStr,\n      secondStr,\n      obsOffset,\n      milOffset,\n      offHourStr,\n      offMinuteStr,\n    ] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n\n  let offset;\n  if (obsOffset) {\n    offset = obsOffsets[obsOffset];\n  } else if (milOffset) {\n    offset = 0;\n  } else {\n    offset = signedOffset(offHourStr, offMinuteStr);\n  }\n\n  return [result, new FixedOffsetZone(offset)];\n}\n\nfunction preprocessRFC2822(s) {\n  // Remove comments and folding whitespace and replace multiple-spaces with a single space\n  return s\n    .replace(/\\([^()]*\\)|[\\n\\t]/g, \" \")\n    .replace(/(\\s\\s+)/g, \" \")\n    .trim();\n}\n\n// http date\n\nconst rfc1123 =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\\d\\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\\d{4}) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  rfc850 =\n    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\\d\\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  ascii =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \\d|\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) (\\d{4})$/;\n\nfunction extractRFC1123Or850(match) {\n  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nfunction extractASCII(match) {\n  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nconst isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);\nconst isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);\nconst isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);\nconst isoTimeCombinedRegex = combineRegexes(isoTimeRegex);\n\nconst extractISOYmdTimeAndOffset = combineExtractors(\n  extractISOYmd,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOWeekTimeAndOffset = combineExtractors(\n  extractISOWeekData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOOrdinalDateAndTime = combineExtractors(\n  extractISOOrdinalData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOTimeAndOffset = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\n/*\n * @private\n */\n\nexport function parseISODate(s) {\n  return parse(\n    s,\n    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],\n    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],\n    [isoTimeCombinedRegex, extractISOTimeAndOffset]\n  );\n}\n\nexport function parseRFC2822Date(s) {\n  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);\n}\n\nexport function parseHTTPDate(s) {\n  return parse(\n    s,\n    [rfc1123, extractRFC1123Or850],\n    [rfc850, extractRFC1123Or850],\n    [ascii, extractASCII]\n  );\n}\n\nexport function parseISODuration(s) {\n  return parse(s, [isoDuration, extractISODuration]);\n}\n\nconst extractISOTimeOnly = combineExtractors(extractISOTime);\n\nexport function parseISOTimeOnly(s) {\n  return parse(s, [isoTimeOnly, extractISOTimeOnly]);\n}\n\nconst sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);\nconst sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);\n\nconst extractISOTimeOffsetAndIANAZone = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\nexport function parseSQL(s) {\n  return parse(\n    s,\n    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]\n  );\n}\n","import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from \"./errors.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Locale from \"./impl/locale.js\";\nimport { parseISODuration, parseISOTimeOnly } from \"./impl/regexParser.js\";\nimport {\n  asNumber,\n  hasOwnProperty,\n  isNumber,\n  isUndefined,\n  normalizeObject,\n  roundTo,\n} from \"./impl/util.js\";\nimport Settings from \"./settings.js\";\nimport DateTime from \"./datetime.js\";\n\nconst INVALID = \"Invalid Duration\";\n\n// unit conversion constants\nexport const lowOrderMatrix = {\n    weeks: {\n      days: 7,\n      hours: 7 * 24,\n      minutes: 7 * 24 * 60,\n      seconds: 7 * 24 * 60 * 60,\n      milliseconds: 7 * 24 * 60 * 60 * 1000,\n    },\n    days: {\n      hours: 24,\n      minutes: 24 * 60,\n      seconds: 24 * 60 * 60,\n      milliseconds: 24 * 60 * 60 * 1000,\n    },\n    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },\n    minutes: { seconds: 60, milliseconds: 60 * 1000 },\n    seconds: { milliseconds: 1000 },\n  },\n  casualMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: 52,\n      days: 365,\n      hours: 365 * 24,\n      minutes: 365 * 24 * 60,\n      seconds: 365 * 24 * 60 * 60,\n      milliseconds: 365 * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: 13,\n      days: 91,\n      hours: 91 * 24,\n      minutes: 91 * 24 * 60,\n      seconds: 91 * 24 * 60 * 60,\n      milliseconds: 91 * 24 * 60 * 60 * 1000,\n    },\n    months: {\n      weeks: 4,\n      days: 30,\n      hours: 30 * 24,\n      minutes: 30 * 24 * 60,\n      seconds: 30 * 24 * 60 * 60,\n      milliseconds: 30 * 24 * 60 * 60 * 1000,\n    },\n\n    ...lowOrderMatrix,\n  },\n  daysInYearAccurate = 146097.0 / 400,\n  daysInMonthAccurate = 146097.0 / 4800,\n  accurateMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: daysInYearAccurate / 7,\n      days: daysInYearAccurate,\n      hours: daysInYearAccurate * 24,\n      minutes: daysInYearAccurate * 24 * 60,\n      seconds: daysInYearAccurate * 24 * 60 * 60,\n      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: daysInYearAccurate / 28,\n      days: daysInYearAccurate / 4,\n      hours: (daysInYearAccurate * 24) / 4,\n      minutes: (daysInYearAccurate * 24 * 60) / 4,\n      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,\n      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,\n    },\n    months: {\n      weeks: daysInMonthAccurate / 7,\n      days: daysInMonthAccurate,\n      hours: daysInMonthAccurate * 24,\n      minutes: daysInMonthAccurate * 24 * 60,\n      seconds: daysInMonthAccurate * 24 * 60 * 60,\n      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,\n    },\n    ...lowOrderMatrix,\n  };\n\n// units ordered by size\nconst orderedUnits = [\n  \"years\",\n  \"quarters\",\n  \"months\",\n  \"weeks\",\n  \"days\",\n  \"hours\",\n  \"minutes\",\n  \"seconds\",\n  \"milliseconds\",\n];\n\nconst reverseUnits = orderedUnits.slice(0).reverse();\n\n// clone really means \"create another instance just like this one, but with these changes\"\nfunction clone(dur, alts, clear = false) {\n  // deep merge for vals\n  const conf = {\n    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },\n    loc: dur.loc.clone(alts.loc),\n    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,\n    matrix: alts.matrix || dur.matrix,\n  };\n  return new Duration(conf);\n}\n\nfunction durationToMillis(matrix, vals) {\n  let sum = vals.milliseconds ?? 0;\n  for (const unit of reverseUnits.slice(1)) {\n    if (vals[unit]) {\n      sum += vals[unit] * matrix[unit][\"milliseconds\"];\n    }\n  }\n  return sum;\n}\n\n// NB: mutates parameters\nfunction normalizeValues(matrix, vals) {\n  // the logic below assumes the overall value of the duration is positive\n  // if this is not the case, factor is used to make it so\n  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;\n\n  orderedUnits.reduceRight((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const previousVal = vals[previous] * factor;\n        const conv = matrix[current][previous];\n\n        // if (previousVal < 0):\n        // lower order unit is negative (e.g. { years: 2, days: -2 })\n        // normalize this by reducing the higher order unit by the appropriate amount\n        // and increasing the lower order unit\n        // this can never make the higher order unit negative, because this function only operates\n        // on positive durations, so the amount of time represented by the lower order unit cannot\n        // be larger than the higher order unit\n        // else:\n        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })\n        // in this case we attempt to convert as much as possible from the lower order unit into\n        // the higher order one\n        //\n        // Math.floor takes care of both of these cases, rounding away from 0\n        // if previousVal < 0 it makes the absolute value larger\n        // if previousVal >= it makes the absolute value smaller\n        const rollUp = Math.floor(previousVal / conv);\n        vals[current] += rollUp * factor;\n        vals[previous] -= rollUp * conv * factor;\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n\n  // try to convert any decimals into smaller units if possible\n  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }\n  orderedUnits.reduce((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const fraction = vals[previous] % 1;\n        vals[previous] -= fraction;\n        vals[current] += fraction * matrix[previous][current];\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n}\n\n// Remove all properties with a value of 0 from an object\nfunction removeZeroes(vals) {\n  const newVals = {};\n  for (const [key, value] of Object.entries(vals)) {\n    if (value !== 0) {\n      newVals[key] = value;\n    }\n  }\n  return newVals;\n}\n\n/**\n * A Duration object represents a period of time, like \"2 months\" or \"1 day, 1 hour\". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.\n *\n * Here is a brief overview of commonly used methods and getters in Duration:\n *\n * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.\n * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.\n * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.\n * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.\n * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}\n *\n * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.\n */\nexport default class Duration {\n  /**\n   * @private\n   */\n  constructor(config) {\n    const accurate = config.conversionAccuracy === \"longterm\" || false;\n    let matrix = accurate ? accurateMatrix : casualMatrix;\n\n    if (config.matrix) {\n      matrix = config.matrix;\n    }\n\n    /**\n     * @access private\n     */\n    this.values = config.values;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.conversionAccuracy = accurate ? \"longterm\" : \"casual\";\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.matrix = matrix;\n    /**\n     * @access private\n     */\n    this.isLuxonDuration = true;\n  }\n\n  /**\n   * Create Duration from a number of milliseconds.\n   * @param {number} count of milliseconds\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  static fromMillis(count, opts) {\n    return Duration.fromObject({ milliseconds: count }, opts);\n  }\n\n  /**\n   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.\n   * If this object is empty then a zero milliseconds duration is returned.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.years\n   * @param {number} obj.quarters\n   * @param {number} obj.months\n   * @param {number} obj.weeks\n   * @param {number} obj.days\n   * @param {number} obj.hours\n   * @param {number} obj.minutes\n   * @param {number} obj.seconds\n   * @param {number} obj.milliseconds\n   * @param {Object} [opts=[]] - options for creating this Duration\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the custom conversion system to use\n   * @return {Duration}\n   */\n  static fromObject(obj, opts = {}) {\n    if (obj == null || typeof obj !== \"object\") {\n      throw new InvalidArgumentError(\n        `Duration.fromObject: argument expected to be an object, got ${\n          obj === null ? \"null\" : typeof obj\n        }`\n      );\n    }\n\n    return new Duration({\n      values: normalizeObject(obj, Duration.normalizeUnit),\n      loc: Locale.fromObject(opts),\n      conversionAccuracy: opts.conversionAccuracy,\n      matrix: opts.matrix,\n    });\n  }\n\n  /**\n   * Create a Duration from DurationLike.\n   *\n   * @param {Object | number | Duration} durationLike\n   * One of:\n   * - object with keys like 'years' and 'hours'.\n   * - number representing milliseconds\n   * - Duration instance\n   * @return {Duration}\n   */\n  static fromDurationLike(durationLike) {\n    if (isNumber(durationLike)) {\n      return Duration.fromMillis(durationLike);\n    } else if (Duration.isDuration(durationLike)) {\n      return durationLike;\n    } else if (typeof durationLike === \"object\") {\n      return Duration.fromObject(durationLike);\n    } else {\n      throw new InvalidArgumentError(\n        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`\n      );\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 duration string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the preset conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }\n   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }\n   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }\n   * @return {Duration}\n   */\n  static fromISO(text, opts) {\n    const [parsed] = parseISODuration(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 time string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }\n   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @return {Duration}\n   */\n  static fromISOTime(text, opts) {\n    const [parsed] = parseISOTimeOnly(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create an invalid Duration.\n   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Duration}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Duration is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDurationError(invalid);\n    } else {\n      return new Duration({ invalid });\n    }\n  }\n\n  /**\n   * @private\n   */\n  static normalizeUnit(unit) {\n    const normalized = {\n      year: \"years\",\n      years: \"years\",\n      quarter: \"quarters\",\n      quarters: \"quarters\",\n      month: \"months\",\n      months: \"months\",\n      week: \"weeks\",\n      weeks: \"weeks\",\n      day: \"days\",\n      days: \"days\",\n      hour: \"hours\",\n      hours: \"hours\",\n      minute: \"minutes\",\n      minutes: \"minutes\",\n      second: \"seconds\",\n      seconds: \"seconds\",\n      millisecond: \"milliseconds\",\n      milliseconds: \"milliseconds\",\n    }[unit ? unit.toLowerCase() : unit];\n\n    if (!normalized) throw new InvalidUnitError(unit);\n\n    return normalized;\n  }\n\n  /**\n   * Check if an object is a Duration. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDuration(o) {\n    return (o && o.isLuxonDuration) || false;\n  }\n\n  /**\n   * Get  the locale of a Duration, such 'en-GB'\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:\n   * * `S` for milliseconds\n   * * `s` for seconds\n   * * `m` for minutes\n   * * `h` for hours\n   * * `d` for days\n   * * `w` for weeks\n   * * `M` for months\n   * * `y` for years\n   * Notes:\n   * * Add padding by repeating the token, e.g. \"yy\" pads the years to two digits, \"hhhh\" pads the hours out to four digits\n   * * Tokens can be escaped by wrapping with single quotes.\n   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - options\n   * @param {boolean} [opts.floor=true] - floor numerical values\n   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"y d s\") //=> \"1 6 2\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"yy dd sss\") //=> \"01 06 002\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"M S\") //=> \"12 518402000\"\n   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"+6 +2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"-6 -2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"negativeLargestOnly\" }) //=> \"-6 2\"\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    // reverse-compat since 1.2; we always round down now, never up, and we do it by default\n    const fmtOpts = {\n      ...opts,\n      floor: opts.round !== false && opts.floor !== false,\n    };\n    return this.isValid\n      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a string representation of a Duration with all units included.\n   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options\n   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.\n   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.\n   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero\n   * @example\n   * ```js\n   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })\n   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'\n   * dur.toHuman({ listStyle: \"long\" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'\n   * dur.toHuman({ unitDisplay: \"short\" }) //=> '1 mth, 0 wks, 5 hr, 6 min'\n   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'\n   * ```\n   */\n  toHuman(opts = {}) {\n    if (!this.isValid) return INVALID;\n\n    const showZeros = opts.showZeros !== false;\n\n    const l = orderedUnits\n      .map((unit) => {\n        const val = this.values[unit];\n        if (isUndefined(val) || (val === 0 && !showZeros)) {\n          return null;\n        }\n        return this.loc\n          .numberFormatter({ style: \"unit\", unitDisplay: \"long\", ...opts, unit: unit.slice(0, -1) })\n          .format(val);\n      })\n      .filter((n) => n);\n\n    return this.loc\n      .listFormatter({ type: \"conjunction\", style: opts.listStyle || \"narrow\", ...opts })\n      .format(l);\n  }\n\n  /**\n   * Returns a JavaScript object with this Duration's values.\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }\n   * @return {Object}\n   */\n  toObject() {\n    if (!this.isValid) return {};\n    return { ...this.values };\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'\n   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'\n   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'\n   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'\n   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'\n   * @return {string}\n   */\n  toISO() {\n    // we could use the formatter, but this is an easier way to get the minimum string\n    if (!this.isValid) return null;\n\n    let s = \"P\";\n    if (this.years !== 0) s += this.years + \"Y\";\n    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + \"M\";\n    if (this.weeks !== 0) s += this.weeks + \"W\";\n    if (this.days !== 0) s += this.days + \"D\";\n    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)\n      s += \"T\";\n    if (this.hours !== 0) s += this.hours + \"H\";\n    if (this.minutes !== 0) s += this.minutes + \"M\";\n    if (this.seconds !== 0 || this.milliseconds !== 0)\n      // this will handle \"floating point madness\" by removing extra decimal places\n      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken\n      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + \"S\";\n    if (s === \"P\") s += \"T0S\";\n    return s;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.\n   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'\n   * @return {string}\n   */\n  toISOTime(opts = {}) {\n    if (!this.isValid) return null;\n\n    const millis = this.toMillis();\n    if (millis < 0 || millis >= 86400000) return null;\n\n    opts = {\n      suppressMilliseconds: false,\n      suppressSeconds: false,\n      includePrefix: false,\n      format: \"extended\",\n      ...opts,\n      includeOffset: false,\n    };\n\n    const dateTime = DateTime.fromMillis(millis, { zone: \"UTC\" });\n    return dateTime.toISOTime(opts);\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.\n   * @return {string}\n   */\n  toString() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a string representation of this Duration appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Duration { values: ${JSON.stringify(this.values)} }`;\n    } else {\n      return `Duration { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration.\n   * @return {number}\n   */\n  toMillis() {\n    if (!this.isValid) return NaN;\n\n    return durationToMillis(this.matrix, this.values);\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration),\n      result = {};\n\n    for (const k of orderedUnits) {\n      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {\n        result[k] = dur.get(k) + this.get(k);\n      }\n    }\n\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration);\n    return this.plus(dur.negate());\n  }\n\n  /**\n   * Scale this Duration by the specified amount. Return a newly-constructed Duration.\n   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === \"hours\" ? x * 2 : x) //=> { hours: 2, minutes: 30 }\n   * @return {Duration}\n   */\n  mapUnits(fn) {\n    if (!this.isValid) return this;\n    const result = {};\n    for (const k of Object.keys(this.values)) {\n      result[k] = asNumber(fn(this.values[k], k));\n    }\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2\n   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0\n   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3\n   * @return {number}\n   */\n  get(unit) {\n    return this[Duration.normalizeUnit(unit)];\n  }\n\n  /**\n   * \"Set\" the values of specified units. Return a newly-constructed Duration.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dur.set({ years: 2017 })\n   * @example dur.set({ hours: 8, minutes: 30 })\n   * @return {Duration}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };\n    return clone(this, { values: mixed });\n  }\n\n  /**\n   * \"Set\" the locale and/or numberingSystem.  Returns a newly-constructed Duration.\n   * @example dur.reconfigure({ locale: 'en-GB' })\n   * @return {Duration}\n   */\n  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem });\n    const opts = { loc, matrix, conversionAccuracy };\n    return clone(this, opts);\n  }\n\n  /**\n   * Return the length of the duration in the specified unit.\n   * @param {string} unit - a unit such as 'minutes' or 'days'\n   * @example Duration.fromObject({years: 1}).as('days') //=> 365\n   * @example Duration.fromObject({years: 1}).as('months') //=> 12\n   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5\n   * @return {number}\n   */\n  as(unit) {\n    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;\n  }\n\n  /**\n   * Reduce this Duration to its canonical representation in its current units.\n   * Assuming the overall value of the Duration is positive, this means:\n   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)\n   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise\n   *   the overall value would be negative, see third example)\n   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)\n   *\n   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.\n   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }\n   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }\n   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }\n   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }\n   * @return {Duration}\n   */\n  normalize() {\n    if (!this.isValid) return this;\n    const vals = this.toObject();\n    normalizeValues(this.matrix, vals);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Rescale units to its largest representation\n   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }\n   * @return {Duration}\n   */\n  rescale() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.normalize().shiftToAll().toObject());\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Convert this Duration into its representation in a different set of units.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }\n   * @return {Duration}\n   */\n  shiftTo(...units) {\n    if (!this.isValid) return this;\n\n    if (units.length === 0) {\n      return this;\n    }\n\n    units = units.map((u) => Duration.normalizeUnit(u));\n\n    const built = {},\n      accumulated = {},\n      vals = this.toObject();\n    let lastUnit;\n\n    for (const k of orderedUnits) {\n      if (units.indexOf(k) >= 0) {\n        lastUnit = k;\n\n        let own = 0;\n\n        // anything we haven't boiled down yet should get boiled to this unit\n        for (const ak in accumulated) {\n          own += this.matrix[ak][k] * accumulated[ak];\n          accumulated[ak] = 0;\n        }\n\n        // plus anything that's already in this unit\n        if (isNumber(vals[k])) {\n          own += vals[k];\n        }\n\n        // only keep the integer part for now in the hopes of putting any decimal part\n        // into a smaller unit later\n        const i = Math.trunc(own);\n        built[k] = i;\n        accumulated[k] = (own * 1000 - i * 1000) / 1000;\n\n        // otherwise, keep it in the wings to boil it later\n      } else if (isNumber(vals[k])) {\n        accumulated[k] = vals[k];\n      }\n    }\n\n    // anything leftover becomes the decimal for the last unit\n    // lastUnit must be defined since units is not empty\n    for (const key in accumulated) {\n      if (accumulated[key] !== 0) {\n        built[lastUnit] +=\n          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];\n      }\n    }\n\n    normalizeValues(this.matrix, built);\n    return clone(this, { values: built }, true);\n  }\n\n  /**\n   * Shift this Duration to all available units.\n   * Same as shiftTo(\"years\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", \"seconds\", \"milliseconds\")\n   * @return {Duration}\n   */\n  shiftToAll() {\n    if (!this.isValid) return this;\n    return this.shiftTo(\n      \"years\",\n      \"months\",\n      \"weeks\",\n      \"days\",\n      \"hours\",\n      \"minutes\",\n      \"seconds\",\n      \"milliseconds\"\n    );\n  }\n\n  /**\n   * Return the negative of this Duration.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }\n   * @return {Duration}\n   */\n  negate() {\n    if (!this.isValid) return this;\n    const negated = {};\n    for (const k of Object.keys(this.values)) {\n      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];\n    }\n    return clone(this, { values: negated }, true);\n  }\n\n  /**\n   * Removes all units with values equal to 0 from this Duration.\n   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }\n   * @return {Duration}\n   */\n  removeZeros() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.values);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Get the years.\n   * @type {number}\n   */\n  get years() {\n    return this.isValid ? this.values.years || 0 : NaN;\n  }\n\n  /**\n   * Get the quarters.\n   * @type {number}\n   */\n  get quarters() {\n    return this.isValid ? this.values.quarters || 0 : NaN;\n  }\n\n  /**\n   * Get the months.\n   * @type {number}\n   */\n  get months() {\n    return this.isValid ? this.values.months || 0 : NaN;\n  }\n\n  /**\n   * Get the weeks\n   * @type {number}\n   */\n  get weeks() {\n    return this.isValid ? this.values.weeks || 0 : NaN;\n  }\n\n  /**\n   * Get the days.\n   * @type {number}\n   */\n  get days() {\n    return this.isValid ? this.values.days || 0 : NaN;\n  }\n\n  /**\n   * Get the hours.\n   * @type {number}\n   */\n  get hours() {\n    return this.isValid ? this.values.hours || 0 : NaN;\n  }\n\n  /**\n   * Get the minutes.\n   * @type {number}\n   */\n  get minutes() {\n    return this.isValid ? this.values.minutes || 0 : NaN;\n  }\n\n  /**\n   * Get the seconds.\n   * @return {number}\n   */\n  get seconds() {\n    return this.isValid ? this.values.seconds || 0 : NaN;\n  }\n\n  /**\n   * Get the milliseconds.\n   * @return {number}\n   */\n  get milliseconds() {\n    return this.isValid ? this.values.milliseconds || 0 : NaN;\n  }\n\n  /**\n   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations\n   * on invalid DateTimes or Intervals.\n   * @return {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this Duration became invalid, or null if the Duration is valid\n   * @return {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Equality check\n   * Two Durations are equal iff they have the same units and the same values for each unit.\n   * @param {Duration} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    if (!this.loc.equals(other.loc)) {\n      return false;\n    }\n\n    function eq(v1, v2) {\n      // Consider 0 and undefined as equal\n      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;\n      return v1 === v2;\n    }\n\n    for (const u of orderedUnits) {\n      if (!eq(this.values[u], other.values[u])) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n","import DateTime, { friendlyDateTime } from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Settings from \"./settings.js\";\nimport { InvalidArgumentError, InvalidIntervalError } from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport * as Formats from \"./impl/formats.js\";\n\nconst INVALID = \"Invalid Interval\";\n\n// checks if the start is equal to or before the end\nfunction validateStartEnd(start, end) {\n  if (!start || !start.isValid) {\n    return Interval.invalid(\"missing or invalid start\");\n  } else if (!end || !end.isValid) {\n    return Interval.invalid(\"missing or invalid end\");\n  } else if (end < start) {\n    return Interval.invalid(\n      \"end before start\",\n      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`\n    );\n  } else {\n    return null;\n  }\n}\n\n/**\n * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.\n *\n * Here is a brief overview of the most commonly used methods and getters in Interval:\n *\n * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.\n * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.\n * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.\n * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.\n * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}\n * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.\n */\nexport default class Interval {\n  /**\n   * @private\n   */\n  constructor(config) {\n    /**\n     * @access private\n     */\n    this.s = config.start;\n    /**\n     * @access private\n     */\n    this.e = config.end;\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.isLuxonInterval = true;\n  }\n\n  /**\n   * Create an invalid Interval.\n   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Interval}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Interval is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidIntervalError(invalid);\n    } else {\n      return new Interval({ invalid });\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.\n   * @param {DateTime|Date|Object} start\n   * @param {DateTime|Date|Object} end\n   * @return {Interval}\n   */\n  static fromDateTimes(start, end) {\n    const builtStart = friendlyDateTime(start),\n      builtEnd = friendlyDateTime(end);\n\n    const validateError = validateStartEnd(builtStart, builtEnd);\n\n    if (validateError == null) {\n      return new Interval({\n        start: builtStart,\n        end: builtEnd,\n      });\n    } else {\n      return validateError;\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and a Duration to extend to.\n   * @param {DateTime|Date|Object} start\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static after(start, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(start);\n    return Interval.fromDateTimes(dt, dt.plus(dur));\n  }\n\n  /**\n   * Create an Interval from an end DateTime and a Duration to extend backwards to.\n   * @param {DateTime|Date|Object} end\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static before(end, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(end);\n    return Interval.fromDateTimes(dt.minus(dur), dt);\n  }\n\n  /**\n   * Create an Interval from an ISO 8601 string.\n   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.\n   * @param {string} text - the ISO string to parse\n   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {Interval}\n   */\n  static fromISO(text, opts) {\n    const [s, e] = (text || \"\").split(\"/\", 2);\n    if (s && e) {\n      let start, startIsValid;\n      try {\n        start = DateTime.fromISO(s, opts);\n        startIsValid = start.isValid;\n      } catch (e) {\n        startIsValid = false;\n      }\n\n      let end, endIsValid;\n      try {\n        end = DateTime.fromISO(e, opts);\n        endIsValid = end.isValid;\n      } catch (e) {\n        endIsValid = false;\n      }\n\n      if (startIsValid && endIsValid) {\n        return Interval.fromDateTimes(start, end);\n      }\n\n      if (startIsValid) {\n        const dur = Duration.fromISO(e, opts);\n        if (dur.isValid) {\n          return Interval.after(start, dur);\n        }\n      } else if (endIsValid) {\n        const dur = Duration.fromISO(s, opts);\n        if (dur.isValid) {\n          return Interval.before(end, dur);\n        }\n      }\n    }\n    return Interval.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n  }\n\n  /**\n   * Check if an object is an Interval. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isInterval(o) {\n    return (o && o.isLuxonInterval) || false;\n  }\n\n  /**\n   * Returns the start of the Interval\n   * @type {DateTime}\n   */\n  get start() {\n    return this.isValid ? this.s : null;\n  }\n\n  /**\n   * Returns the end of the Interval. This is the first instant which is not part of the interval\n   * (Interval is half-open).\n   * @type {DateTime}\n   */\n  get end() {\n    return this.isValid ? this.e : null;\n  }\n\n  /**\n   * Returns the last DateTime included in the interval (since end is not part of the interval)\n   * @type {DateTime}\n   */\n  get lastDateTime() {\n    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;\n  }\n\n  /**\n   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalidReason === null;\n  }\n\n  /**\n   * Returns an error code if this Interval is invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Returns the length of the Interval in the specified unit.\n   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.\n   * @return {number}\n   */\n  length(unit = \"milliseconds\") {\n    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;\n  }\n\n  /**\n   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.\n   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'\n   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'\n   * @param {string} [unit='milliseconds'] - the unit of time to count.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime\n   * @return {number}\n   */\n  count(unit = \"milliseconds\", opts) {\n    if (!this.isValid) return NaN;\n    const start = this.start.startOf(unit, opts);\n    let end;\n    if (opts?.useLocaleWeeks) {\n      end = this.end.reconfigure({ locale: start.locale });\n    } else {\n      end = this.end;\n    }\n    end = end.startOf(unit, opts);\n    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());\n  }\n\n  /**\n   * Returns whether this Interval's start and end are both in the same unit of time\n   * @param {string} unit - the unit of time to check sameness on\n   * @return {boolean}\n   */\n  hasSame(unit) {\n    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end DateTimes.\n   * @return {boolean}\n   */\n  isEmpty() {\n    return this.s.valueOf() === this.e.valueOf();\n  }\n\n  /**\n   * Return whether this Interval's start is after the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isAfter(dateTime) {\n    if (!this.isValid) return false;\n    return this.s > dateTime;\n  }\n\n  /**\n   * Return whether this Interval's end is before the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isBefore(dateTime) {\n    if (!this.isValid) return false;\n    return this.e <= dateTime;\n  }\n\n  /**\n   * Return whether this Interval contains the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  contains(dateTime) {\n    if (!this.isValid) return false;\n    return this.s <= dateTime && this.e > dateTime;\n  }\n\n  /**\n   * \"Sets\" the start and/or end dates. Returns a newly-constructed Interval.\n   * @param {Object} values - the values to set\n   * @param {DateTime} values.start - the starting DateTime\n   * @param {DateTime} values.end - the ending DateTime\n   * @return {Interval}\n   */\n  set({ start, end } = {}) {\n    if (!this.isValid) return this;\n    return Interval.fromDateTimes(start || this.s, end || this.e);\n  }\n\n  /**\n   * Split this Interval at each of the specified DateTimes\n   * @param {...DateTime} dateTimes - the unit of time to count.\n   * @return {Array}\n   */\n  splitAt(...dateTimes) {\n    if (!this.isValid) return [];\n    const sorted = dateTimes\n        .map(friendlyDateTime)\n        .filter((d) => this.contains(d))\n        .sort((a, b) => a.toMillis() - b.toMillis()),\n      results = [];\n    let { s } = this,\n      i = 0;\n\n    while (s < this.e) {\n      const added = sorted[i] || this.e,\n        next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      i += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into smaller Intervals, each of the specified length.\n   * Left over time is grouped into a smaller interval\n   * @param {Duration|Object|number} duration - The length of each resulting interval.\n   * @return {Array}\n   */\n  splitBy(duration) {\n    const dur = Duration.fromDurationLike(duration);\n\n    if (!this.isValid || !dur.isValid || dur.as(\"milliseconds\") === 0) {\n      return [];\n    }\n\n    let { s } = this,\n      idx = 1,\n      next;\n\n    const results = [];\n    while (s < this.e) {\n      const added = this.start.plus(dur.mapUnits((x) => x * idx));\n      next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      idx += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into the specified number of smaller intervals.\n   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.\n   * @return {Array}\n   */\n  divideEqually(numberOfParts) {\n    if (!this.isValid) return [];\n    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);\n  }\n\n  /**\n   * Return whether this Interval overlaps with the specified Interval\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  overlaps(other) {\n    return this.e > other.s && this.s < other.e;\n  }\n\n  /**\n   * Return whether this Interval's end is adjacent to the specified Interval's start.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsStart(other) {\n    if (!this.isValid) return false;\n    return +this.e === +other.s;\n  }\n\n  /**\n   * Return whether this Interval's start is adjacent to the specified Interval's end.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsEnd(other) {\n    if (!this.isValid) return false;\n    return +other.e === +this.s;\n  }\n\n  /**\n   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  engulfs(other) {\n    if (!this.isValid) return false;\n    return this.s <= other.s && this.e >= other.e;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end as the specified Interval.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    return this.s.equals(other.s) && this.e.equals(other.e);\n  }\n\n  /**\n   * Return an Interval representing the intersection of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.\n   * Returns null if the intersection is empty, meaning, the intervals don't intersect.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  intersection(other) {\n    if (!this.isValid) return this;\n    const s = this.s > other.s ? this.s : other.s,\n      e = this.e < other.e ? this.e : other.e;\n\n    if (s >= e) {\n      return null;\n    } else {\n      return Interval.fromDateTimes(s, e);\n    }\n  }\n\n  /**\n   * Return an Interval representing the union of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  union(other) {\n    if (!this.isValid) return this;\n    const s = this.s < other.s ? this.s : other.s,\n      e = this.e > other.e ? this.e : other.e;\n    return Interval.fromDateTimes(s, e);\n  }\n\n  /**\n   * Merge an array of Intervals into an equivalent minimal set of Intervals.\n   * Combines overlapping and adjacent Intervals.\n   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval\n   * and ending with the latest.\n   *\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static merge(intervals) {\n    const [found, final] = intervals\n      .sort((a, b) => a.s - b.s)\n      .reduce(\n        ([sofar, current], item) => {\n          if (!current) {\n            return [sofar, item];\n          } else if (current.overlaps(item) || current.abutsStart(item)) {\n            return [sofar, current.union(item)];\n          } else {\n            return [sofar.concat([current]), item];\n          }\n        },\n        [[], null]\n      );\n    if (final) {\n      found.push(final);\n    }\n    return found;\n  }\n\n  /**\n   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static xor(intervals) {\n    let start = null,\n      currentCount = 0;\n    const results = [],\n      ends = intervals.map((i) => [\n        { time: i.s, type: \"s\" },\n        { time: i.e, type: \"e\" },\n      ]),\n      flattened = Array.prototype.concat(...ends),\n      arr = flattened.sort((a, b) => a.time - b.time);\n\n    for (const i of arr) {\n      currentCount += i.type === \"s\" ? 1 : -1;\n\n      if (currentCount === 1) {\n        start = i.time;\n      } else {\n        if (start && +start !== +i.time) {\n          results.push(Interval.fromDateTimes(start, i.time));\n        }\n\n        start = null;\n      }\n    }\n\n    return Interval.merge(results);\n  }\n\n  /**\n   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.\n   * @param {...Interval} intervals\n   * @return {Array}\n   */\n  difference(...intervals) {\n    return Interval.xor([this].concat(intervals))\n      .map((i) => this.intersection(i))\n      .filter((i) => i && !i.isEmpty());\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for debugging.\n   * @return {string}\n   */\n  toString() {\n    if (!this.isValid) return INVALID;\n    return `[${this.s.toISO()} – ${this.e.toISO()})`;\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;\n    } else {\n      return `Interval { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns a localized string representing this Interval. Accepts the same options as the\n   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as\n   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method\n   * is browser-specific, but in general it will return an appropriate representation of the\n   * Interval in the assigned locale. Defaults to the system's locale if no locale has been\n   * specified.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or\n   * Intl.DateTimeFormat constructor options.\n   * @param {Object} opts - Options to override the configuration of the start DateTime.\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Interval.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISO(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of date of this Interval.\n   * The time components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {string}\n   */\n  toISODate() {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISODate()}/${this.e.toISODate()}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of time of this Interval.\n   * The date components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISOTime(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this Interval formatted according to the specified format\n   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible\n   * formatting tool.\n   * @param {string} dateFormat - The format string. This string formats the start and end time.\n   * See {@link DateTime#toFormat} for details.\n   * @param {Object} opts - Options.\n   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end\n   * representations.\n   * @return {string}\n   */\n  toFormat(dateFormat, { separator = \" – \" } = {}) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;\n  }\n\n  /**\n   * Return a Duration representing the time spanned by this interval.\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }\n   * @return {Duration}\n   */\n  toDuration(unit, opts) {\n    if (!this.isValid) {\n      return Duration.invalid(this.invalidReason);\n    }\n    return this.e.diff(this.s, unit, opts);\n  }\n\n  /**\n   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes\n   * @param {function} mapFn\n   * @return {Interval}\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))\n   */\n  mapEndpoints(mapFn) {\n    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Settings from \"./settings.js\";\nimport Locale from \"./impl/locale.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\n\nimport { hasLocaleWeekInfo, hasRelative } from \"./impl/util.js\";\n\n/**\n * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.\n */\nexport default class Info {\n  /**\n   * Return whether the specified zone contains a DST.\n   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.\n   * @return {boolean}\n   */\n  static hasDST(zone = Settings.defaultZone) {\n    const proto = DateTime.now().setZone(zone).set({ month: 12 });\n\n    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;\n  }\n\n  /**\n   * Return whether the specified zone is a valid IANA specifier.\n   * @param {string} zone - Zone to check\n   * @return {boolean}\n   */\n  static isValidIANAZone(zone) {\n    return IANAZone.isValidZone(zone);\n  }\n\n  /**\n   * Converts the input into a {@link Zone} instance.\n   *\n   * * If `input` is already a Zone instance, it is returned unchanged.\n   * * If `input` is a string containing a valid time zone name, a Zone instance\n   *   with that name is returned.\n   * * If `input` is a string that doesn't refer to a known time zone, a Zone\n   *   instance with {@link Zone#isValid} == false is returned.\n   * * If `input is a number, a Zone instance with the specified fixed offset\n   *   in minutes is returned.\n   * * If `input` is `null` or `undefined`, the default zone is returned.\n   * @param {string|Zone|number} [input] - the value to be converted\n   * @return {Zone}\n   */\n  static normalizeZone(input) {\n    return normalizeZone(input, Settings.defaultZone);\n  }\n\n  /**\n   * Get the weekday on which the week starts according to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday\n   */\n  static getStartOfWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getStartOfWeek();\n  }\n\n  /**\n   * Get the minimum number of days necessary in a week before it is considered part of the next year according\n   * to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number}\n   */\n  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();\n  }\n\n  /**\n   * Get the weekdays, which are considered the weekend according to the given locale\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday\n   */\n  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {\n    // copy the array, because we cache it internally\n    return (locObj || Locale.create(locale)).getWeekendDays().slice();\n  }\n\n  /**\n   * Return an array of standalone month names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @example Info.months()[0] //=> 'January'\n   * @example Info.months('short')[0] //=> 'Jan'\n   * @example Info.months('numeric')[0] //=> '1'\n   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'\n   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'\n   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'\n   * @return {Array}\n   */\n  static months(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);\n  }\n\n  /**\n   * Return an array of format month names.\n   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that\n   * changes the string.\n   * See {@link Info#months}\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @return {Array}\n   */\n  static monthsFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);\n  }\n\n  /**\n   * Return an array of standalone week names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the weekday representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @example Info.weekdays()[0] //=> 'Monday'\n   * @example Info.weekdays('short')[0] //=> 'Mon'\n   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'\n   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'\n   * @return {Array}\n   */\n  static weekdays(length = \"long\", { locale = null, numberingSystem = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);\n  }\n\n  /**\n   * Return an array of format week names.\n   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that\n   * changes the string.\n   * See {@link Info#weekdays}\n   * @param {string} [length='long'] - the length of the month representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale=null] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @return {Array}\n   */\n  static weekdaysFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);\n  }\n\n  /**\n   * Return an array of meridiems.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.meridiems() //=> [ 'AM', 'PM' ]\n   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]\n   * @return {Array}\n   */\n  static meridiems({ locale = null } = {}) {\n    return Locale.create(locale).meridiems();\n  }\n\n  /**\n   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.\n   * @param {string} [length='short'] - the length of the era representation, such as \"short\" or \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.eras() //=> [ 'BC', 'AD' ]\n   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]\n   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]\n   * @return {Array}\n   */\n  static eras(length = \"short\", { locale = null } = {}) {\n    return Locale.create(locale, null, \"gregory\").eras(length);\n  }\n\n  /**\n   * Return the set of available features in this environment.\n   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.\n   * Keys:\n   * * `relative`: whether this environment supports relative time formatting\n   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale\n   * @example Info.features() //=> { relative: false, localeWeek: true }\n   * @return {Object}\n   */\n  static features() {\n    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };\n  }\n}\n","import Duration from \"../duration.js\";\n\nfunction dayDiff(earlier, later) {\n  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf(\"day\").valueOf(),\n    ms = utcDayStart(later) - utcDayStart(earlier);\n  return Math.floor(Duration.fromMillis(ms).as(\"days\"));\n}\n\nfunction highOrderDiffs(cursor, later, units) {\n  const differs = [\n    [\"years\", (a, b) => b.year - a.year],\n    [\"quarters\", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],\n    [\"months\", (a, b) => b.month - a.month + (b.year - a.year) * 12],\n    [\n      \"weeks\",\n      (a, b) => {\n        const days = dayDiff(a, b);\n        return (days - (days % 7)) / 7;\n      },\n    ],\n    [\"days\", dayDiff],\n  ];\n\n  const results = {};\n  const earlier = cursor;\n  let lowestOrder, highWater;\n\n  /* This loop tries to diff using larger units first.\n     If we overshoot, we backtrack and try the next smaller unit.\n     \"cursor\" starts out at the earlier timestamp and moves closer and closer to \"later\"\n     as we use smaller and smaller units.\n     highWater keeps track of where we would be if we added one more of the smallest unit,\n     this is used later to potentially convert any difference smaller than the smallest higher order unit\n     into a fraction of that smallest higher order unit\n  */\n  for (const [unit, differ] of differs) {\n    if (units.indexOf(unit) >= 0) {\n      lowestOrder = unit;\n\n      results[unit] = differ(cursor, later);\n      highWater = earlier.plus(results);\n\n      if (highWater > later) {\n        // we overshot the end point, backtrack cursor by 1\n        results[unit]--;\n        cursor = earlier.plus(results);\n\n        // if we are still overshooting now, we need to backtrack again\n        // this happens in certain situations when diffing times in different zones,\n        // because this calculation ignores time zones\n        if (cursor > later) {\n          // keep the \"overshot by 1\" around as highWater\n          highWater = cursor;\n          // backtrack cursor by 1\n          results[unit]--;\n          cursor = earlier.plus(results);\n        }\n      } else {\n        cursor = highWater;\n      }\n    }\n  }\n\n  return [cursor, results, highWater, lowestOrder];\n}\n\nexport default function (earlier, later, units, opts) {\n  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);\n\n  const remainingMillis = later - cursor;\n\n  const lowerOrderUnits = units.filter(\n    (u) => [\"hours\", \"minutes\", \"seconds\", \"milliseconds\"].indexOf(u) >= 0\n  );\n\n  if (lowerOrderUnits.length === 0) {\n    if (highWater < later) {\n      highWater = cursor.plus({ [lowestOrder]: 1 });\n    }\n\n    if (highWater !== cursor) {\n      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);\n    }\n  }\n\n  const duration = Duration.fromObject(results, opts);\n\n  if (lowerOrderUnits.length > 0) {\n    return Duration.fromMillis(remainingMillis, opts)\n      .shiftTo(...lowerOrderUnits)\n      .plus(duration);\n  } else {\n    return duration;\n  }\n}\n","import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from \"./util.js\";\nimport Formatter from \"./formatter.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport DateTime from \"../datetime.js\";\nimport { digitRegex, parseDigits } from \"./digits.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst MISSING_FTP = \"missing Intl.DateTimeFormat.formatToParts support\";\n\nfunction intUnit(regex, post = (i) => i) {\n  return { regex, deser: ([s]) => post(parseDigits(s)) };\n}\n\nconst NBSP = String.fromCharCode(160);\nconst spaceOrNBSP = `[ ${NBSP}]`;\nconst spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, \"g\");\n\nfunction fixListRegex(s) {\n  // make dots optional and also make them literal\n  // make space and non breakable space characters interchangeable\n  return s.replace(/\\./g, \"\\\\.?\").replace(spaceOrNBSPRegExp, spaceOrNBSP);\n}\n\nfunction stripInsensitivities(s) {\n  return s\n    .replace(/\\./g, \"\") // ignore dots that were made optional\n    .replace(spaceOrNBSPRegExp, \" \") // interchange space and nbsp\n    .toLowerCase();\n}\n\nfunction oneOf(strings, startIndex) {\n  if (strings === null) {\n    return null;\n  } else {\n    return {\n      regex: RegExp(strings.map(fixListRegex).join(\"|\")),\n      deser: ([s]) =>\n        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,\n    };\n  }\n}\n\nfunction offset(regex, groups) {\n  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };\n}\n\nfunction simple(regex) {\n  return { regex, deser: ([s]) => s };\n}\n\nfunction escapeToken(value) {\n  return value.replace(/[\\-\\[\\]{}()*+?.,\\\\\\^$|#\\s]/g, \"\\\\$&\");\n}\n\n/**\n * @param token\n * @param {Locale} loc\n */\nfunction unitForToken(token, loc) {\n  const one = digitRegex(loc),\n    two = digitRegex(loc, \"{2}\"),\n    three = digitRegex(loc, \"{3}\"),\n    four = digitRegex(loc, \"{4}\"),\n    six = digitRegex(loc, \"{6}\"),\n    oneOrTwo = digitRegex(loc, \"{1,2}\"),\n    oneToThree = digitRegex(loc, \"{1,3}\"),\n    oneToSix = digitRegex(loc, \"{1,6}\"),\n    oneToNine = digitRegex(loc, \"{1,9}\"),\n    twoToFour = digitRegex(loc, \"{2,4}\"),\n    fourToSix = digitRegex(loc, \"{4,6}\"),\n    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),\n    unitate = (t) => {\n      if (token.literal) {\n        return literal(t);\n      }\n      switch (t.val) {\n        // era\n        case \"G\":\n          return oneOf(loc.eras(\"short\"), 0);\n        case \"GG\":\n          return oneOf(loc.eras(\"long\"), 0);\n        // years\n        case \"y\":\n          return intUnit(oneToSix);\n        case \"yy\":\n          return intUnit(twoToFour, untruncateYear);\n        case \"yyyy\":\n          return intUnit(four);\n        case \"yyyyy\":\n          return intUnit(fourToSix);\n        case \"yyyyyy\":\n          return intUnit(six);\n        // months\n        case \"M\":\n          return intUnit(oneOrTwo);\n        case \"MM\":\n          return intUnit(two);\n        case \"MMM\":\n          return oneOf(loc.months(\"short\", true), 1);\n        case \"MMMM\":\n          return oneOf(loc.months(\"long\", true), 1);\n        case \"L\":\n          return intUnit(oneOrTwo);\n        case \"LL\":\n          return intUnit(two);\n        case \"LLL\":\n          return oneOf(loc.months(\"short\", false), 1);\n        case \"LLLL\":\n          return oneOf(loc.months(\"long\", false), 1);\n        // dates\n        case \"d\":\n          return intUnit(oneOrTwo);\n        case \"dd\":\n          return intUnit(two);\n        // ordinals\n        case \"o\":\n          return intUnit(oneToThree);\n        case \"ooo\":\n          return intUnit(three);\n        // time\n        case \"HH\":\n          return intUnit(two);\n        case \"H\":\n          return intUnit(oneOrTwo);\n        case \"hh\":\n          return intUnit(two);\n        case \"h\":\n          return intUnit(oneOrTwo);\n        case \"mm\":\n          return intUnit(two);\n        case \"m\":\n          return intUnit(oneOrTwo);\n        case \"q\":\n          return intUnit(oneOrTwo);\n        case \"qq\":\n          return intUnit(two);\n        case \"s\":\n          return intUnit(oneOrTwo);\n        case \"ss\":\n          return intUnit(two);\n        case \"S\":\n          return intUnit(oneToThree);\n        case \"SSS\":\n          return intUnit(three);\n        case \"u\":\n          return simple(oneToNine);\n        case \"uu\":\n          return simple(oneOrTwo);\n        case \"uuu\":\n          return intUnit(one);\n        // meridiem\n        case \"a\":\n          return oneOf(loc.meridiems(), 0);\n        // weekYear (k)\n        case \"kkkk\":\n          return intUnit(four);\n        case \"kk\":\n          return intUnit(twoToFour, untruncateYear);\n        // weekNumber (W)\n        case \"W\":\n          return intUnit(oneOrTwo);\n        case \"WW\":\n          return intUnit(two);\n        // weekdays\n        case \"E\":\n        case \"c\":\n          return intUnit(one);\n        case \"EEE\":\n          return oneOf(loc.weekdays(\"short\", false), 1);\n        case \"EEEE\":\n          return oneOf(loc.weekdays(\"long\", false), 1);\n        case \"ccc\":\n          return oneOf(loc.weekdays(\"short\", true), 1);\n        case \"cccc\":\n          return oneOf(loc.weekdays(\"long\", true), 1);\n        // offset/zone\n        case \"Z\":\n        case \"ZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);\n        case \"ZZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);\n        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing\n        // because we don't have any way to figure out what they are\n        case \"z\":\n          return simple(/[a-z_+-/]{1,256}?/i);\n        // this special-case \"token\" represents a place where a macro-token expanded into a white-space literal\n        // in this case we accept any non-newline white-space\n        case \" \":\n          return simple(/[^\\S\\n\\r]/);\n        default:\n          return literal(t);\n      }\n    };\n\n  const unit = unitate(token) || {\n    invalidReason: MISSING_FTP,\n  };\n\n  unit.token = token;\n\n  return unit;\n}\n\nconst partTypeStyleToTokenVal = {\n  year: {\n    \"2-digit\": \"yy\",\n    numeric: \"yyyyy\",\n  },\n  month: {\n    numeric: \"M\",\n    \"2-digit\": \"MM\",\n    short: \"MMM\",\n    long: \"MMMM\",\n  },\n  day: {\n    numeric: \"d\",\n    \"2-digit\": \"dd\",\n  },\n  weekday: {\n    short: \"EEE\",\n    long: \"EEEE\",\n  },\n  dayperiod: \"a\",\n  dayPeriod: \"a\",\n  hour12: {\n    numeric: \"h\",\n    \"2-digit\": \"hh\",\n  },\n  hour24: {\n    numeric: \"H\",\n    \"2-digit\": \"HH\",\n  },\n  minute: {\n    numeric: \"m\",\n    \"2-digit\": \"mm\",\n  },\n  second: {\n    numeric: \"s\",\n    \"2-digit\": \"ss\",\n  },\n  timeZoneName: {\n    long: \"ZZZZZ\",\n    short: \"ZZZ\",\n  },\n};\n\nfunction tokenForPart(part, formatOpts, resolvedOpts) {\n  const { type, value } = part;\n\n  if (type === \"literal\") {\n    const isSpace = /^\\s+$/.test(value);\n    return {\n      literal: !isSpace,\n      val: isSpace ? \" \" : value,\n    };\n  }\n\n  const style = formatOpts[type];\n\n  // The user might have explicitly specified hour12 or hourCycle\n  // if so, respect their decision\n  // if not, refer back to the resolvedOpts, which are based on the locale\n  let actualType = type;\n  if (type === \"hour\") {\n    if (formatOpts.hour12 != null) {\n      actualType = formatOpts.hour12 ? \"hour12\" : \"hour24\";\n    } else if (formatOpts.hourCycle != null) {\n      if (formatOpts.hourCycle === \"h11\" || formatOpts.hourCycle === \"h12\") {\n        actualType = \"hour12\";\n      } else {\n        actualType = \"hour24\";\n      }\n    } else {\n      // tokens only differentiate between 24 hours or not,\n      // so we do not need to check hourCycle here, which is less supported anyways\n      actualType = resolvedOpts.hour12 ? \"hour12\" : \"hour24\";\n    }\n  }\n  let val = partTypeStyleToTokenVal[actualType];\n  if (typeof val === \"object\") {\n    val = val[style];\n  }\n\n  if (val) {\n    return {\n      literal: false,\n      val,\n    };\n  }\n\n  return undefined;\n}\n\nfunction buildRegex(units) {\n  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, \"\");\n  return [`^${re}$`, units];\n}\n\nfunction match(input, regex, handlers) {\n  const matches = input.match(regex);\n\n  if (matches) {\n    const all = {};\n    let matchIndex = 1;\n    for (const i in handlers) {\n      if (hasOwnProperty(handlers, i)) {\n        const h = handlers[i],\n          groups = h.groups ? h.groups + 1 : 1;\n        if (!h.literal && h.token) {\n          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));\n        }\n        matchIndex += groups;\n      }\n    }\n    return [matches, all];\n  } else {\n    return [matches, {}];\n  }\n}\n\nfunction dateTimeFromMatches(matches) {\n  const toField = (token) => {\n    switch (token) {\n      case \"S\":\n        return \"millisecond\";\n      case \"s\":\n        return \"second\";\n      case \"m\":\n        return \"minute\";\n      case \"h\":\n      case \"H\":\n        return \"hour\";\n      case \"d\":\n        return \"day\";\n      case \"o\":\n        return \"ordinal\";\n      case \"L\":\n      case \"M\":\n        return \"month\";\n      case \"y\":\n        return \"year\";\n      case \"E\":\n      case \"c\":\n        return \"weekday\";\n      case \"W\":\n        return \"weekNumber\";\n      case \"k\":\n        return \"weekYear\";\n      case \"q\":\n        return \"quarter\";\n      default:\n        return null;\n    }\n  };\n\n  let zone = null;\n  let specificOffset;\n  if (!isUndefined(matches.z)) {\n    zone = IANAZone.create(matches.z);\n  }\n\n  if (!isUndefined(matches.Z)) {\n    if (!zone) {\n      zone = new FixedOffsetZone(matches.Z);\n    }\n    specificOffset = matches.Z;\n  }\n\n  if (!isUndefined(matches.q)) {\n    matches.M = (matches.q - 1) * 3 + 1;\n  }\n\n  if (!isUndefined(matches.h)) {\n    if (matches.h < 12 && matches.a === 1) {\n      matches.h += 12;\n    } else if (matches.h === 12 && matches.a === 0) {\n      matches.h = 0;\n    }\n  }\n\n  if (matches.G === 0 && matches.y) {\n    matches.y = -matches.y;\n  }\n\n  if (!isUndefined(matches.u)) {\n    matches.S = parseMillis(matches.u);\n  }\n\n  const vals = Object.keys(matches).reduce((r, k) => {\n    const f = toField(k);\n    if (f) {\n      r[f] = matches[k];\n    }\n\n    return r;\n  }, {});\n\n  return [vals, zone, specificOffset];\n}\n\nlet dummyDateTimeCache = null;\n\nfunction getDummyDateTime() {\n  if (!dummyDateTimeCache) {\n    dummyDateTimeCache = DateTime.fromMillis(1555555555555);\n  }\n\n  return dummyDateTimeCache;\n}\n\nfunction maybeExpandMacroToken(token, locale) {\n  if (token.literal) {\n    return token;\n  }\n\n  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);\n  const tokens = formatOptsToTokens(formatOpts, locale);\n\n  if (tokens == null || tokens.includes(undefined)) {\n    return token;\n  }\n\n  return tokens;\n}\n\nexport function expandMacroTokens(tokens, locale) {\n  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));\n}\n\n/**\n * @private\n */\n\nexport class TokenParser {\n  constructor(locale, format) {\n    this.locale = locale;\n    this.format = format;\n    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);\n    this.units = this.tokens.map((t) => unitForToken(t, locale));\n    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);\n\n    if (!this.disqualifyingUnit) {\n      const [regexString, handlers] = buildRegex(this.units);\n      this.regex = RegExp(regexString, \"i\");\n      this.handlers = handlers;\n    }\n  }\n\n  explainFromTokens(input) {\n    if (!this.isValid) {\n      return { input, tokens: this.tokens, invalidReason: this.invalidReason };\n    } else {\n      const [rawMatches, matches] = match(input, this.regex, this.handlers),\n        [result, zone, specificOffset] = matches\n          ? dateTimeFromMatches(matches)\n          : [null, null, undefined];\n      if (hasOwnProperty(matches, \"a\") && hasOwnProperty(matches, \"H\")) {\n        throw new ConflictingSpecificationError(\n          \"Can't include meridiem when specifying 24-hour format\"\n        );\n      }\n      return {\n        input,\n        tokens: this.tokens,\n        regex: this.regex,\n        rawMatches,\n        matches,\n        result,\n        zone,\n        specificOffset,\n      };\n    }\n  }\n\n  get isValid() {\n    return !this.disqualifyingUnit;\n  }\n\n  get invalidReason() {\n    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;\n  }\n}\n\nexport function explainFromTokens(locale, input, format) {\n  const parser = new TokenParser(locale, format);\n  return parser.explainFromTokens(input);\n}\n\nexport function parseFromTokens(locale, input, format) {\n  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);\n  return [result, zone, specificOffset, invalidReason];\n}\n\nexport function formatOptsToTokens(formatOpts, locale) {\n  if (!formatOpts) {\n    return null;\n  }\n\n  const formatter = Formatter.create(locale, formatOpts);\n  const df = formatter.dtFormatter(getDummyDateTime());\n  const parts = df.formatToParts();\n  const resolvedOpts = df.resolvedOptions();\n  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));\n}\n","import Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Settings from \"./settings.js\";\nimport Info from \"./info.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport {\n  isUndefined,\n  maybeArray,\n  isDate,\n  isNumber,\n  bestBy,\n  daysInMonth,\n  daysInYear,\n  isLeapYear,\n  weeksInWeekYear,\n  normalizeObject,\n  roundTo,\n  objToLocalTS,\n  padStart,\n} from \"./impl/util.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport diff from \"./impl/diff.js\";\nimport { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from \"./impl/regexParser.js\";\nimport {\n  parseFromTokens,\n  explainFromTokens,\n  formatOptsToTokens,\n  expandMacroTokens,\n  TokenParser,\n} from \"./impl/tokenParser.js\";\nimport {\n  gregorianToWeek,\n  weekToGregorian,\n  gregorianToOrdinal,\n  ordinalToGregorian,\n  hasInvalidGregorianData,\n  hasInvalidWeekData,\n  hasInvalidOrdinalData,\n  hasInvalidTimeData,\n  usesLocalWeekValues,\n  isoWeekdayToLocal,\n} from \"./impl/conversions.js\";\nimport * as Formats from \"./impl/formats.js\";\nimport {\n  InvalidArgumentError,\n  ConflictingSpecificationError,\n  InvalidUnitError,\n  InvalidDateTimeError,\n} from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\n\nconst INVALID = \"Invalid DateTime\";\nconst MAX_DATE = 8.64e15;\n\nfunction unsupportedZone(zone) {\n  return new Invalid(\"unsupported zone\", `the zone \"${zone.name}\" is not supported`);\n}\n\n// we cache week data on the DT object and this intermediates the cache\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedWeekData(dt) {\n  if (dt.weekData === null) {\n    dt.weekData = gregorianToWeek(dt.c);\n  }\n  return dt.weekData;\n}\n\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedLocalWeekData(dt) {\n  if (dt.localWeekData === null) {\n    dt.localWeekData = gregorianToWeek(\n      dt.c,\n      dt.loc.getMinDaysInFirstWeek(),\n      dt.loc.getStartOfWeek()\n    );\n  }\n  return dt.localWeekData;\n}\n\n// clone really means, \"make a new object with these modifications\". all \"setters\" really use this\n// to create a new object while only changing some of the properties\nfunction clone(inst, alts) {\n  const current = {\n    ts: inst.ts,\n    zone: inst.zone,\n    c: inst.c,\n    o: inst.o,\n    loc: inst.loc,\n    invalid: inst.invalid,\n  };\n  return new DateTime({ ...current, ...alts, old: current });\n}\n\n// find the right offset a given local time. The o input is our guess, which determines which\n// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)\nfunction fixOffset(localTS, o, tz) {\n  // Our UTC time is just a guess because our offset is just a guess\n  let utcGuess = localTS - o * 60 * 1000;\n\n  // Test whether the zone matches the offset for this ts\n  const o2 = tz.offset(utcGuess);\n\n  // If so, offset didn't change and we're done\n  if (o === o2) {\n    return [utcGuess, o];\n  }\n\n  // If not, change the ts by the difference in the offset\n  utcGuess -= (o2 - o) * 60 * 1000;\n\n  // If that gives us the local time we want, we're done\n  const o3 = tz.offset(utcGuess);\n  if (o2 === o3) {\n    return [utcGuess, o2];\n  }\n\n  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time\n  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];\n}\n\n// convert an epoch timestamp into a calendar object with the given offset\nfunction tsToObj(ts, offset) {\n  ts += offset * 60 * 1000;\n\n  const d = new Date(ts);\n\n  return {\n    year: d.getUTCFullYear(),\n    month: d.getUTCMonth() + 1,\n    day: d.getUTCDate(),\n    hour: d.getUTCHours(),\n    minute: d.getUTCMinutes(),\n    second: d.getUTCSeconds(),\n    millisecond: d.getUTCMilliseconds(),\n  };\n}\n\n// convert a calendar object to a epoch timestamp\nfunction objToTS(obj, offset, zone) {\n  return fixOffset(objToLocalTS(obj), offset, zone);\n}\n\n// create a new DT instance by adding a duration, adjusting for DSTs\nfunction adjustTime(inst, dur) {\n  const oPre = inst.o,\n    year = inst.c.year + Math.trunc(dur.years),\n    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,\n    c = {\n      ...inst.c,\n      year,\n      month,\n      day:\n        Math.min(inst.c.day, daysInMonth(year, month)) +\n        Math.trunc(dur.days) +\n        Math.trunc(dur.weeks) * 7,\n    },\n    millisToAdd = Duration.fromObject({\n      years: dur.years - Math.trunc(dur.years),\n      quarters: dur.quarters - Math.trunc(dur.quarters),\n      months: dur.months - Math.trunc(dur.months),\n      weeks: dur.weeks - Math.trunc(dur.weeks),\n      days: dur.days - Math.trunc(dur.days),\n      hours: dur.hours,\n      minutes: dur.minutes,\n      seconds: dur.seconds,\n      milliseconds: dur.milliseconds,\n    }).as(\"milliseconds\"),\n    localTS = objToLocalTS(c);\n\n  let [ts, o] = fixOffset(localTS, oPre, inst.zone);\n\n  if (millisToAdd !== 0) {\n    ts += millisToAdd;\n    // that could have changed the offset by going over a DST, but we want to keep the ts the same\n    o = inst.zone.offset(ts);\n  }\n\n  return { ts, o };\n}\n\n// helper useful in turning the results of parsing into real dates\n// by handling the zone options\nfunction parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {\n  const { setZone, zone } = opts;\n  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {\n    const interpretationZone = parsedZone || zone,\n      inst = DateTime.fromObject(parsed, {\n        ...opts,\n        zone: interpretationZone,\n        specificOffset,\n      });\n    return setZone ? inst : inst.setZone(zone);\n  } else {\n    return DateTime.invalid(\n      new Invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ${format}`)\n    );\n  }\n}\n\n// if you want to output a technical format (e.g. RFC 2822), this helper\n// helps handle the details\nfunction toTechFormat(dt, format, allowZ = true) {\n  return dt.isValid\n    ? Formatter.create(Locale.create(\"en-US\"), {\n        allowZ,\n        forceSimple: true,\n      }).formatDateTimeFromString(dt, format)\n    : null;\n}\n\nfunction toISODate(o, extended, precision) {\n  const longFormat = o.c.year > 9999 || o.c.year < 0;\n  let c = \"\";\n  if (longFormat && o.c.year >= 0) c += \"+\";\n  c += padStart(o.c.year, longFormat ? 6 : 4);\n  if (precision === \"year\") return c;\n  if (extended) {\n    c += \"-\";\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n    c += \"-\";\n  } else {\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n  }\n  c += padStart(o.c.day);\n  return c;\n}\n\nfunction toISOTime(\n  o,\n  extended,\n  suppressSeconds,\n  suppressMilliseconds,\n  includeOffset,\n  extendedZone,\n  precision\n) {\n  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,\n    c = \"\";\n  switch (precision) {\n    case \"day\":\n    case \"month\":\n    case \"year\":\n      break;\n    default:\n      c += padStart(o.c.hour);\n      if (precision === \"hour\") break;\n      if (extended) {\n        c += \":\";\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += \":\";\n          c += padStart(o.c.second);\n        }\n      } else {\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += padStart(o.c.second);\n        }\n      }\n      if (precision === \"second\") break;\n      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {\n        c += \".\";\n        c += padStart(o.c.millisecond, 3);\n      }\n  }\n\n  if (includeOffset) {\n    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {\n      c += \"Z\";\n    } else if (o.o < 0) {\n      c += \"-\";\n      c += padStart(Math.trunc(-o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(-o.o % 60));\n    } else {\n      c += \"+\";\n      c += padStart(Math.trunc(o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(o.o % 60));\n    }\n  }\n\n  if (extendedZone) {\n    c += \"[\" + o.zone.ianaName + \"]\";\n  }\n  return c;\n}\n\n// defaults for unspecified units in the supported calendars\nconst defaultUnitValues = {\n    month: 1,\n    day: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultWeekUnitValues = {\n    weekNumber: 1,\n    weekday: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultOrdinalUnitValues = {\n    ordinal: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  };\n\n// Units in the supported calendars, sorted by bigness\nconst orderedUnits = [\"year\", \"month\", \"day\", \"hour\", \"minute\", \"second\", \"millisecond\"],\n  orderedWeekUnits = [\n    \"weekYear\",\n    \"weekNumber\",\n    \"weekday\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"millisecond\",\n  ],\n  orderedOrdinalUnits = [\"year\", \"ordinal\", \"hour\", \"minute\", \"second\", \"millisecond\"];\n\n// standardize case and plurality in units\nfunction normalizeUnit(unit) {\n  const normalized = {\n    year: \"year\",\n    years: \"year\",\n    month: \"month\",\n    months: \"month\",\n    day: \"day\",\n    days: \"day\",\n    hour: \"hour\",\n    hours: \"hour\",\n    minute: \"minute\",\n    minutes: \"minute\",\n    quarter: \"quarter\",\n    quarters: \"quarter\",\n    second: \"second\",\n    seconds: \"second\",\n    millisecond: \"millisecond\",\n    milliseconds: \"millisecond\",\n    weekday: \"weekday\",\n    weekdays: \"weekday\",\n    weeknumber: \"weekNumber\",\n    weeksnumber: \"weekNumber\",\n    weeknumbers: \"weekNumber\",\n    weekyear: \"weekYear\",\n    weekyears: \"weekYear\",\n    ordinal: \"ordinal\",\n  }[unit.toLowerCase()];\n\n  if (!normalized) throw new InvalidUnitError(unit);\n\n  return normalized;\n}\n\nfunction normalizeUnitWithLocalWeeks(unit) {\n  switch (unit.toLowerCase()) {\n    case \"localweekday\":\n    case \"localweekdays\":\n      return \"localWeekday\";\n    case \"localweeknumber\":\n    case \"localweeknumbers\":\n      return \"localWeekNumber\";\n    case \"localweekyear\":\n    case \"localweekyears\":\n      return \"localWeekYear\";\n    default:\n      return normalizeUnit(unit);\n  }\n}\n\n// cache offsets for zones based on the current timestamp when this function is\n// first called. When we are handling a datetime from components like (year,\n// month, day, hour) in a time zone, we need a guess about what the timezone\n// offset is so that we can convert into a UTC timestamp. One way is to find the\n// offset of now in the zone. The actual date may have a different offset (for\n// example, if we handle a date in June while we're in December in a zone that\n// observes DST), but we can check and adjust that.\n//\n// When handling many dates, calculating the offset for now every time is\n// expensive. It's just a guess, so we can cache the offset to use even if we\n// are right on a time change boundary (we'll just correct in the other\n// direction). Using a timestamp from first read is a slight optimization for\n// handling dates close to the current date, since those dates will usually be\n// in the same offset (we could set the timestamp statically, instead). We use a\n// single timestamp for all zones to make things a bit more predictable.\n//\n// This is safe for quickDT (used by local() and utc()) because we don't fill in\n// higher-order units from tsNow (as we do in fromObject, this requires that\n// offset is calculated from tsNow).\n/**\n * @param {Zone} zone\n * @return {number}\n */\nfunction guessOffsetForZone(zone) {\n  if (zoneOffsetTs === undefined) {\n    zoneOffsetTs = Settings.now();\n  }\n\n  // Do not cache anything but IANA zones, because it is not safe to do so.\n  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset\n  if (zone.type !== \"iana\") {\n    return zone.offset(zoneOffsetTs);\n  }\n  const zoneName = zone.name;\n  let offsetGuess = zoneOffsetGuessCache.get(zoneName);\n  if (offsetGuess === undefined) {\n    offsetGuess = zone.offset(zoneOffsetTs);\n    zoneOffsetGuessCache.set(zoneName, offsetGuess);\n  }\n  return offsetGuess;\n}\n\n// this is a dumbed down version of fromObject() that runs about 60% faster\n// but doesn't do any validation, makes a bunch of assumptions about what units\n// are present, and so on.\nfunction quickDT(obj, opts) {\n  const zone = normalizeZone(opts.zone, Settings.defaultZone);\n  if (!zone.isValid) {\n    return DateTime.invalid(unsupportedZone(zone));\n  }\n\n  const loc = Locale.fromObject(opts);\n\n  let ts, o;\n\n  // assume we have the higher-order units\n  if (!isUndefined(obj.year)) {\n    for (const u of orderedUnits) {\n      if (isUndefined(obj[u])) {\n        obj[u] = defaultUnitValues[u];\n      }\n    }\n\n    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    const offsetProvis = guessOffsetForZone(zone);\n    [ts, o] = objToTS(obj, offsetProvis, zone);\n  } else {\n    ts = Settings.now();\n  }\n\n  return new DateTime({ ts, zone, loc, o });\n}\n\nfunction diffRelative(start, end, opts) {\n  const round = isUndefined(opts.round) ? true : opts.round,\n    rounding = isUndefined(opts.rounding) ? \"trunc\" : opts.rounding,\n    format = (c, unit) => {\n      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? \"round\" : rounding);\n      const formatter = end.loc.clone(opts).relFormatter(opts);\n      return formatter.format(c, unit);\n    },\n    differ = (unit) => {\n      if (opts.calendary) {\n        if (!end.hasSame(start, unit)) {\n          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);\n        } else return 0;\n      } else {\n        return end.diff(start, unit).get(unit);\n      }\n    };\n\n  if (opts.unit) {\n    return format(differ(opts.unit), opts.unit);\n  }\n\n  for (const unit of opts.units) {\n    const count = differ(unit);\n    if (Math.abs(count) >= 1) {\n      return format(count, unit);\n    }\n  }\n  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);\n}\n\nfunction lastOpts(argList) {\n  let opts = {},\n    args;\n  if (argList.length > 0 && typeof argList[argList.length - 1] === \"object\") {\n    opts = argList[argList.length - 1];\n    args = Array.from(argList).slice(0, argList.length - 1);\n  } else {\n    args = Array.from(argList);\n  }\n  return [opts, args];\n}\n\n/**\n * Timestamp to use for cached zone offset guesses (exposed for test)\n */\nlet zoneOffsetTs;\n/**\n * Cache for zone offset guesses (exposed for test).\n *\n * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of\n * zone.offset().\n */\nconst zoneOffsetGuessCache = new Map();\n\n/**\n * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.\n *\n * A DateTime comprises of:\n * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.\n * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).\n * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.\n *\n * Here is a brief overview of the most commonly used functionality it provides:\n *\n * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.\n * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},\n * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.\n * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.\n * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.\n * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.\n * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.\n *\n * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.\n */\nexport default class DateTime {\n  /**\n   * @access private\n   */\n  constructor(config) {\n    const zone = config.zone || Settings.defaultZone;\n\n    let invalid =\n      config.invalid ||\n      (Number.isNaN(config.ts) ? new Invalid(\"invalid input\") : null) ||\n      (!zone.isValid ? unsupportedZone(zone) : null);\n    /**\n     * @access private\n     */\n    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;\n\n    let c = null,\n      o = null;\n    if (!invalid) {\n      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);\n\n      if (unchanged) {\n        [c, o] = [config.old.c, config.old.o];\n      } else {\n        // If an offset has been passed and we have not been called from\n        // clone(), we can trust it and avoid the offset calculation.\n        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);\n        c = tsToObj(this.ts, ot);\n        invalid = Number.isNaN(c.year) ? new Invalid(\"invalid input\") : null;\n        c = invalid ? null : c;\n        o = invalid ? null : ot;\n      }\n    }\n\n    /**\n     * @access private\n     */\n    this._zone = zone;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.invalid = invalid;\n    /**\n     * @access private\n     */\n    this.weekData = null;\n    /**\n     * @access private\n     */\n    this.localWeekData = null;\n    /**\n     * @access private\n     */\n    this.c = c;\n    /**\n     * @access private\n     */\n    this.o = o;\n    /**\n     * @access private\n     */\n    this.isLuxonDateTime = true;\n  }\n\n  // CONSTRUCT\n\n  /**\n   * Create a DateTime for the current instant, in the system's time zone.\n   *\n   * Use Settings to override these default values if needed.\n   * @example DateTime.now().toISO() //~> now in the ISO format\n   * @return {DateTime}\n   */\n  static now() {\n    return new DateTime({});\n  }\n\n  /**\n   * Create a local DateTime\n   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month, 1-indexed\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @example DateTime.local()                                  //~> now\n   * @example DateTime.local({ zone: \"America/New_York\" })      //~> now, in US east coast time\n   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00\n   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00\n   * @example DateTime.local(2017, 3, 12, { locale: \"fr\" })     //~> 2017-03-12T00:00:00, with a French locale\n   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00\n   * @example DateTime.local(2017, 3, 12, 5, { zone: \"utc\" })   //~> 2017-03-12T05:00:00, in UTC\n   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765\n   * @return {DateTime}\n   */\n  static local() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime in UTC\n   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.utc()                                              //~> now\n   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z\n   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: \"fr\" })          //~> 2017-03-12T05:45:00Z with a French locale\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: \"fr\" }) //~> 2017-03-12T05:45:10.765Z with a French locale\n   * @return {DateTime}\n   */\n  static utc() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n\n    opts.zone = FixedOffsetZone.utcInstance;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime from a JavaScript Date object. Uses the default zone.\n   * @param {Date} date - a JavaScript Date object\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @return {DateTime}\n   */\n  static fromJSDate(date, options = {}) {\n    const ts = isDate(date) ? date.valueOf() : NaN;\n    if (Number.isNaN(ts)) {\n      return DateTime.invalid(\"invalid input\");\n    }\n\n    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    return new DateTime({\n      ts: ts,\n      zone: zoneToUse,\n      loc: Locale.fromObject(options),\n    });\n  }\n\n  /**\n   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} milliseconds - a number of milliseconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromMillis(milliseconds, options = {}) {\n    if (!isNumber(milliseconds)) {\n      throw new InvalidArgumentError(\n        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`\n      );\n    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {\n      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start\n      return DateTime.invalid(\"Timestamp out of range\");\n    } else {\n      return new DateTime({\n        ts: milliseconds,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} seconds - a number of seconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromSeconds(seconds, options = {}) {\n    if (!isNumber(seconds)) {\n      throw new InvalidArgumentError(\"fromSeconds requires a numerical input\");\n    } else {\n      return new DateTime({\n        ts: seconds * 1000,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.year - a year, such as 1987\n   * @param {number} obj.month - a month, 1-12\n   * @param {number} obj.day - a day of the month, 1-31, depending on the month\n   * @param {number} obj.ordinal - day of the year, 1-365 or 366\n   * @param {number} obj.weekYear - an ISO week year\n   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year\n   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday\n   * @param {number} obj.localWeekYear - a week year, according to the locale\n   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale\n   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale\n   * @param {number} obj.hour - hour of the day, 0-23\n   * @param {number} obj.minute - minute of the hour, 0-59\n   * @param {number} obj.second - second of the minute, 0-59\n   * @param {number} obj.millisecond - millisecond of the second, 0-999\n   * @param {Object} opts - options for creating this DateTime\n   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()\n   * @param {string} [opts.locale='system\\'s locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'\n   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })\n   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'\n   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: \"en-US\" }).toISODate() //=> '2021-12-26'\n   * @return {DateTime}\n   */\n  static fromObject(obj, opts = {}) {\n    obj = obj || {};\n    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    const loc = Locale.fromObject(opts);\n    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);\n\n    const tsNow = Settings.now(),\n      offsetProvis = !isUndefined(opts.specificOffset)\n        ? opts.specificOffset\n        : zoneToUse.offset(tsNow),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    // cases:\n    // just a weekday -> this week's instance of that weekday, no worries\n    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error\n    // (gregorian month or day) + ordinal -> error\n    // otherwise just use weeks or ordinals or gregorian, depending on what's specified\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);\n\n    // configure ourselves to deal with gregorian dates or week stuff\n    let units,\n      defaultValues,\n      objNow = tsToObj(tsNow, offsetProvis);\n    if (useWeekData) {\n      units = orderedWeekUnits;\n      defaultValues = defaultWeekUnitValues;\n      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);\n    } else if (containsOrdinal) {\n      units = orderedOrdinalUnits;\n      defaultValues = defaultOrdinalUnitValues;\n      objNow = gregorianToOrdinal(objNow);\n    } else {\n      units = orderedUnits;\n      defaultValues = defaultUnitValues;\n    }\n\n    // set default values for missing stuff\n    let foundFirst = false;\n    for (const u of units) {\n      const v = normalized[u];\n      if (!isUndefined(v)) {\n        foundFirst = true;\n      } else if (foundFirst) {\n        normalized[u] = defaultValues[u];\n      } else {\n        normalized[u] = objNow[u];\n      }\n    }\n\n    // make sure the values we have are in range\n    const higherOrderInvalid = useWeekData\n        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? hasInvalidOrdinalData(normalized)\n        : hasInvalidGregorianData(normalized),\n      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);\n\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    // compute the actual time\n    const gregorian = useWeekData\n        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? ordinalToGregorian(normalized)\n        : normalized,\n      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),\n      inst = new DateTime({\n        ts: tsFinal,\n        zone: zoneToUse,\n        o: offsetFinal,\n        loc,\n      });\n\n    // gregorian data + weekday serves only to validate\n    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {\n      return DateTime.invalid(\n        \"mismatched weekday\",\n        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`\n      );\n    }\n\n    if (!inst.isValid) {\n      return DateTime.invalid(inst.invalid);\n    }\n\n    return inst;\n  }\n\n  /**\n   * Create a DateTime from an ISO 8601 string\n   * @param {string} text - the ISO string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})\n   * @example DateTime.fromISO('2016-W05-4')\n   * @return {DateTime}\n   */\n  static fromISO(text, opts = {}) {\n    const [vals, parsedZone] = parseISODate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"ISO 8601\", text);\n  }\n\n  /**\n   * Create a DateTime from an RFC 2822 string\n   * @param {string} text - the RFC 2822 string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')\n   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')\n   * @return {DateTime}\n   */\n  static fromRFC2822(text, opts = {}) {\n    const [vals, parsedZone] = parseRFC2822Date(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"RFC 2822\", text);\n  }\n\n  /**\n   * Create a DateTime from an HTTP header date\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @param {string} text - the HTTP header date\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')\n   * @return {DateTime}\n   */\n  static fromHTTP(text, opts = {}) {\n    const [vals, parsedZone] = parseHTTPDate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"HTTP\", opts);\n  }\n\n  /**\n   * Create a DateTime from an input string and format string.\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromFormat(text, fmt, opts = {}) {\n    if (isUndefined(text) || isUndefined(fmt)) {\n      throw new InvalidArgumentError(\"fromFormat requires an input string and a format\");\n    }\n\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      }),\n      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    } else {\n      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);\n    }\n  }\n\n  /**\n   * @deprecated use fromFormat instead\n   */\n  static fromString(text, fmt, opts = {}) {\n    return DateTime.fromFormat(text, fmt, opts);\n  }\n\n  /**\n   * Create a DateTime from a SQL date, time, or datetime\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale\n   * @param {string} text - the string to parse\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @example DateTime.fromSQL('2017-05-15')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })\n   * @example DateTime.fromSQL('09:12:34.342')\n   * @return {DateTime}\n   */\n  static fromSQL(text, opts = {}) {\n    const [vals, parsedZone] = parseSQL(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"SQL\", text);\n  }\n\n  /**\n   * Create an invalid DateTime.\n   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {DateTime}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the DateTime is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDateTimeError(invalid);\n    } else {\n      return new DateTime({ invalid });\n    }\n  }\n\n  /**\n   * Check if an object is an instance of DateTime. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDateTime(o) {\n    return (o && o.isLuxonDateTime) || false;\n  }\n\n  /**\n   * Produce the format string for a set of options\n   * @param formatOpts\n   * @param localeOpts\n   * @returns {string}\n   */\n  static parseFormatForOpts(formatOpts, localeOpts = {}) {\n    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));\n    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join(\"\");\n  }\n\n  /**\n   * Produce the the fully expanded format token for the locale\n   * Does NOT quote characters, so quoted tokens will not round trip correctly\n   * @param fmt\n   * @param localeOpts\n   * @returns {string}\n   */\n  static expandFormat(fmt, localeOpts = {}) {\n    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));\n    return expanded.map((t) => t.val).join(\"\");\n  }\n\n  static resetCache() {\n    zoneOffsetTs = undefined;\n    zoneOffsetGuessCache.clear();\n  }\n\n  // INFO\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7\n   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4\n   * @return {number}\n   */\n  get(unit) {\n    return this[unit];\n  }\n\n  /**\n   * Returns whether the DateTime is valid. Invalid DateTimes occur when:\n   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30\n   * * The DateTime was created by an operation on another invalid date\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get outputCalendar() {\n    return this.isValid ? this.loc.outputCalendar : null;\n  }\n\n  /**\n   * Get the time zone associated with this DateTime.\n   * @type {Zone}\n   */\n  get zone() {\n    return this._zone;\n  }\n\n  /**\n   * Get the name of the time zone.\n   * @type {string}\n   */\n  get zoneName() {\n    return this.isValid ? this.zone.name : null;\n  }\n\n  /**\n   * Get the year\n   * @example DateTime.local(2017, 5, 25).year //=> 2017\n   * @type {number}\n   */\n  get year() {\n    return this.isValid ? this.c.year : NaN;\n  }\n\n  /**\n   * Get the quarter\n   * @example DateTime.local(2017, 5, 25).quarter //=> 2\n   * @type {number}\n   */\n  get quarter() {\n    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;\n  }\n\n  /**\n   * Get the month (1-12).\n   * @example DateTime.local(2017, 5, 25).month //=> 5\n   * @type {number}\n   */\n  get month() {\n    return this.isValid ? this.c.month : NaN;\n  }\n\n  /**\n   * Get the day of the month (1-30ish).\n   * @example DateTime.local(2017, 5, 25).day //=> 25\n   * @type {number}\n   */\n  get day() {\n    return this.isValid ? this.c.day : NaN;\n  }\n\n  /**\n   * Get the hour of the day (0-23).\n   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9\n   * @type {number}\n   */\n  get hour() {\n    return this.isValid ? this.c.hour : NaN;\n  }\n\n  /**\n   * Get the minute of the hour (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30\n   * @type {number}\n   */\n  get minute() {\n    return this.isValid ? this.c.minute : NaN;\n  }\n\n  /**\n   * Get the second of the minute (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52\n   * @type {number}\n   */\n  get second() {\n    return this.isValid ? this.c.second : NaN;\n  }\n\n  /**\n   * Get the millisecond of the second (0-999).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654\n   * @type {number}\n   */\n  get millisecond() {\n    return this.isValid ? this.c.millisecond : NaN;\n  }\n\n  /**\n   * Get the week year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015\n   * @type {number}\n   */\n  get weekYear() {\n    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the week number of the week year (1-52ish).\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21\n   * @type {number}\n   */\n  get weekNumber() {\n    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the day of the week.\n   * 1 is Monday and 7 is Sunday\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 11, 31).weekday //=> 4\n   * @type {number}\n   */\n  get weekday() {\n    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Returns true if this date is on a weekend according to the locale, false otherwise\n   * @returns {boolean}\n   */\n  get isWeekend() {\n    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);\n  }\n\n  /**\n   * Get the day of the week according to the locale.\n   * 1 is the first day of the week and 7 is the last day of the week.\n   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,\n   * @returns {number}\n   */\n  get localWeekday() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,\n   * because the week can start on different days of the week (see localWeekday) and because a different number of days\n   * is required for a week to count as the first week of a year.\n   * @returns {number}\n   */\n  get localWeekNumber() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)\n   * differently, see localWeekNumber.\n   * @returns {number}\n   */\n  get localWeekYear() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the ordinal (meaning the day of the year)\n   * @example DateTime.local(2017, 5, 25).ordinal //=> 145\n   * @type {number|DateTime}\n   */\n  get ordinal() {\n    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;\n  }\n\n  /**\n   * Get the human readable short month name, such as 'Oct'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct\n   * @type {string}\n   */\n  get monthShort() {\n    return this.isValid ? Info.months(\"short\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable long month name, such as 'October'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthLong //=> October\n   * @type {string}\n   */\n  get monthLong() {\n    return this.isValid ? Info.months(\"long\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable short weekday, such as 'Mon'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon\n   * @type {string}\n   */\n  get weekdayShort() {\n    return this.isValid ? Info.weekdays(\"short\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the human readable long weekday, such as 'Monday'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday\n   * @type {string}\n   */\n  get weekdayLong() {\n    return this.isValid ? Info.weekdays(\"long\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the UTC offset of this DateTime in minutes\n   * @example DateTime.now().offset //=> -240\n   * @example DateTime.utc().offset //=> 0\n   * @type {number}\n   */\n  get offset() {\n    return this.isValid ? +this.o : NaN;\n  }\n\n  /**\n   * Get the short human name for the zone's current offset, for example \"EST\" or \"EDT\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameShort() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"short\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get the long human name for the zone's current offset, for example \"Eastern Standard Time\" or \"Eastern Daylight Time\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameLong() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"long\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get whether this zone's offset ever changes, as in a DST.\n   * @type {boolean}\n   */\n  get isOffsetFixed() {\n    return this.isValid ? this.zone.isUniversal : null;\n  }\n\n  /**\n   * Get whether the DateTime is in a DST.\n   * @type {boolean}\n   */\n  get isInDST() {\n    if (this.isOffsetFixed) {\n      return false;\n    } else {\n      return (\n        this.offset > this.set({ month: 1, day: 1 }).offset ||\n        this.offset > this.set({ month: 5 }).offset\n      );\n    }\n  }\n\n  /**\n   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC\n   * in this DateTime's zone. During DST changes local time can be ambiguous, for example\n   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.\n   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.\n   * @returns {DateTime[]}\n   */\n  getPossibleOffsets() {\n    if (!this.isValid || this.isOffsetFixed) {\n      return [this];\n    }\n    const dayMs = 86400000;\n    const minuteMs = 60000;\n    const localTS = objToLocalTS(this.c);\n    const oEarlier = this.zone.offset(localTS - dayMs);\n    const oLater = this.zone.offset(localTS + dayMs);\n\n    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);\n    const o2 = this.zone.offset(localTS - oLater * minuteMs);\n    if (o1 === o2) {\n      return [this];\n    }\n    const ts1 = localTS - o1 * minuteMs;\n    const ts2 = localTS - o2 * minuteMs;\n    const c1 = tsToObj(ts1, o1);\n    const c2 = tsToObj(ts2, o2);\n    if (\n      c1.hour === c2.hour &&\n      c1.minute === c2.minute &&\n      c1.second === c2.second &&\n      c1.millisecond === c2.millisecond\n    ) {\n      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];\n    }\n    return [this];\n  }\n\n  /**\n   * Returns true if this DateTime is in a leap year, false otherwise\n   * @example DateTime.local(2016).isInLeapYear //=> true\n   * @example DateTime.local(2013).isInLeapYear //=> false\n   * @type {boolean}\n   */\n  get isInLeapYear() {\n    return isLeapYear(this.year);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's month\n   * @example DateTime.local(2016, 2).daysInMonth //=> 29\n   * @example DateTime.local(2016, 3).daysInMonth //=> 31\n   * @type {number}\n   */\n  get daysInMonth() {\n    return daysInMonth(this.year, this.month);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's year\n   * @example DateTime.local(2016).daysInYear //=> 366\n   * @example DateTime.local(2013).daysInYear //=> 365\n   * @type {number}\n   */\n  get daysInYear() {\n    return this.isValid ? daysInYear(this.year) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2004).weeksInWeekYear //=> 53\n   * @example DateTime.local(2013).weeksInWeekYear //=> 52\n   * @type {number}\n   */\n  get weeksInWeekYear() {\n    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's local week year\n   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52\n   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53\n   * @type {number}\n   */\n  get weeksInLocalWeekYear() {\n    return this.isValid\n      ? weeksInWeekYear(\n          this.localWeekYear,\n          this.loc.getMinDaysInFirstWeek(),\n          this.loc.getStartOfWeek()\n        )\n      : NaN;\n  }\n\n  /**\n   * Returns the resolved Intl options for this DateTime.\n   * This is useful in understanding the behavior of formatting methods\n   * @param {Object} opts - the same options as toLocaleString\n   * @return {Object}\n   */\n  resolvedLocaleOptions(opts = {}) {\n    const { locale, numberingSystem, calendar } = Formatter.create(\n      this.loc.clone(opts),\n      opts\n    ).resolvedOptions(this);\n    return { locale, numberingSystem, outputCalendar: calendar };\n  }\n\n  // TRANSFORM\n\n  /**\n   * \"Set\" the DateTime's zone to UTC. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to {@link DateTime#setZone}('utc')\n   * @param {number} [offset=0] - optionally, an offset from UTC in minutes\n   * @param {Object} [opts={}] - options to pass to `setZone()`\n   * @return {DateTime}\n   */\n  toUTC(offset = 0, opts = {}) {\n    return this.setZone(FixedOffsetZone.instance(offset), opts);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to `setZone('local')`\n   * @return {DateTime}\n   */\n  toLocal() {\n    return this.setZone(Settings.defaultZone);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.\n   *\n   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.\n   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.\n   * @return {DateTime}\n   */\n  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {\n    zone = normalizeZone(zone, Settings.defaultZone);\n    if (zone.equals(this.zone)) {\n      return this;\n    } else if (!zone.isValid) {\n      return DateTime.invalid(unsupportedZone(zone));\n    } else {\n      let newTS = this.ts;\n      if (keepLocalTime || keepCalendarTime) {\n        const offsetGuess = zone.offset(this.ts);\n        const asObj = this.toObject();\n        [newTS] = objToTS(asObj, offsetGuess, zone);\n      }\n      return clone(this, { ts: newTS, zone });\n    }\n  }\n\n  /**\n   * \"Set\" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.\n   * @param {Object} properties - the properties to set\n   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })\n   * @return {DateTime}\n   */\n  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });\n    return clone(this, { loc });\n  }\n\n  /**\n   * \"Set\" the locale. Returns a newly-constructed DateTime.\n   * Just a convenient alias for reconfigure({ locale })\n   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')\n   * @return {DateTime}\n   */\n  setLocale(locale) {\n    return this.reconfigure({ locale });\n  }\n\n  /**\n   * \"Set\" the values of specified units. Returns a newly-constructed DateTime.\n   * You can only set units with this method; for \"setting\" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.\n   *\n   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.\n   * They cannot be mixed with ISO-week units like `weekday`.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dt.set({ year: 2017 })\n   * @example dt.set({ hour: 8, minute: 30 })\n   * @example dt.set({ weekday: 5 })\n   * @example dt.set({ year: 2005, ordinal: 234 })\n   * @return {DateTime}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);\n\n    const settingWeekStuff =\n        !isUndefined(normalized.weekYear) ||\n        !isUndefined(normalized.weekNumber) ||\n        !isUndefined(normalized.weekday),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    let mixed;\n    if (settingWeekStuff) {\n      mixed = weekToGregorian(\n        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },\n        minDaysInFirstWeek,\n        startOfWeek\n      );\n    } else if (!isUndefined(normalized.ordinal)) {\n      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });\n    } else {\n      mixed = { ...this.toObject(), ...normalized };\n\n      // if we didn't set the day but we ended up on an overflow date,\n      // use the last day of the right month\n      if (isUndefined(normalized.day)) {\n        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);\n      }\n    }\n\n    const [ts, o] = objToTS(mixed, this.o, this.zone);\n    return clone(this, { ts, o });\n  }\n\n  /**\n   * Add a period of time to this DateTime and return the resulting DateTime\n   *\n   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @example DateTime.now().plus(123) //~> in 123 milliseconds\n   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes\n   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow\n   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday\n   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min\n   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min\n   * @return {DateTime}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration);\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * Subtract a period of time to this DateTime and return the resulting DateTime\n   * See {@link DateTime#plus}\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   @return {DateTime}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration).negate();\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * \"Set\" this DateTime to the beginning of a unit of time.\n   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'\n   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'\n   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'\n   * @return {DateTime}\n   */\n  startOf(unit, { useLocaleWeeks = false } = {}) {\n    if (!this.isValid) return this;\n\n    const o = {},\n      normalizedUnit = Duration.normalizeUnit(unit);\n    switch (normalizedUnit) {\n      case \"years\":\n        o.month = 1;\n      // falls through\n      case \"quarters\":\n      case \"months\":\n        o.day = 1;\n      // falls through\n      case \"weeks\":\n      case \"days\":\n        o.hour = 0;\n      // falls through\n      case \"hours\":\n        o.minute = 0;\n      // falls through\n      case \"minutes\":\n        o.second = 0;\n      // falls through\n      case \"seconds\":\n        o.millisecond = 0;\n        break;\n      case \"milliseconds\":\n        break;\n      // no default, invalid units throw in normalizeUnit()\n    }\n\n    if (normalizedUnit === \"weeks\") {\n      if (useLocaleWeeks) {\n        const startOfWeek = this.loc.getStartOfWeek();\n        const { weekday } = this;\n        if (weekday < startOfWeek) {\n          o.weekNumber = this.weekNumber - 1;\n        }\n        o.weekday = startOfWeek;\n      } else {\n        o.weekday = 1;\n      }\n    }\n\n    if (normalizedUnit === \"quarters\") {\n      const q = Math.ceil(this.month / 3);\n      o.month = (q - 1) * 3 + 1;\n    }\n\n    return this.set(o);\n  }\n\n  /**\n   * \"Set\" this DateTime to the end (meaning the last millisecond) of a unit of time\n   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'\n   * @return {DateTime}\n   */\n  endOf(unit, opts) {\n    return this.isValid\n      ? this.plus({ [unit]: 1 })\n          .startOf(unit, opts)\n          .minus(1)\n      : this;\n  }\n\n  // OUTPUT\n\n  /**\n   * Returns a string representation of this DateTime formatted according to the specified format string.\n   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'\n   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: \"fr\" }) //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat(\"HH 'hours and' mm 'minutes'\") //=> '20 hours and 55 minutes'\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.\n   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation\n   * of the DateTime in the assigned locale.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toLocaleString(); //=> 4/20/2017\n   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'\n   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'\n   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'\n   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'\n   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'\n   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an array of format \"parts\", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts\n   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.\n   * @example DateTime.now().toLocaleParts(); //=> [\n   *                                   //=>   { type: 'day', value: '25' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'month', value: '05' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'year', value: '1982' }\n   *                                   //=> ]\n   */\n  toLocaleParts(opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)\n      : [];\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'\n   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'\n   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'\n   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'\n   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'\n   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'\n   * @return {string|null}\n   */\n  toISO({\n    format = \"extended\",\n    suppressSeconds = false,\n    suppressMilliseconds = false,\n    includeOffset = true,\n    extendedZone = false,\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    const ext = format === \"extended\";\n\n    let c = toISODate(this, ext, precision);\n    if (orderedUnits.indexOf(precision) >= 3) c += \"T\";\n    c += toISOTime(\n      this,\n      ext,\n      suppressSeconds,\n      suppressMilliseconds,\n      includeOffset,\n      extendedZone,\n      precision\n    );\n    return c;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's date component\n   * @param {Object} opts - options\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.\n   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'\n   * @return {string|null}\n   */\n  toISODate({ format = \"extended\", precision = \"day\" } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, format === \"extended\", normalizeUnit(precision));\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's week date\n   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'\n   * @return {string}\n   */\n  toISOWeekDate() {\n    return toTechFormat(this, \"kkkk-'W'WW-c\");\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's time component\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'\n   * @return {string}\n   */\n  toISOTime({\n    suppressMilliseconds = false,\n    suppressSeconds = false,\n    includeOffset = true,\n    includePrefix = false,\n    extendedZone = false,\n    format = \"extended\",\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? \"T\" : \"\";\n    return (\n      c +\n      toISOTime(\n        this,\n        format === \"extended\",\n        suppressSeconds,\n        suppressMilliseconds,\n        includeOffset,\n        extendedZone,\n        precision\n      )\n    );\n  }\n\n  /**\n   * Returns an RFC 2822-compatible string representation of this DateTime\n   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'\n   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'\n   * @return {string}\n   */\n  toRFC2822() {\n    return toTechFormat(this, \"EEE, dd LLL yyyy HH:mm:ss ZZZ\", false);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.\n   * Specifically, the string conforms to RFC 1123.\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'\n   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'\n   * @return {string}\n   */\n  toHTTP() {\n    return toTechFormat(this.toUTC(), \"EEE, dd LLL yyyy HH:mm:ss 'GMT'\");\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Date\n   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'\n   * @return {string|null}\n   */\n  toSQLDate() {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Time\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc().toSQL() //=> '05:15:16.345'\n   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'\n   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'\n   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'\n   * @return {string}\n   */\n  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {\n    let fmt = \"HH:mm:ss.SSS\";\n\n    if (includeZone || includeOffset) {\n      if (includeOffsetSpace) {\n        fmt += \" \";\n      }\n      if (includeZone) {\n        fmt += \"z\";\n      } else if (includeOffset) {\n        fmt += \"ZZ\";\n      }\n    }\n\n    return toTechFormat(this, fmt, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'\n   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'\n   * @return {string}\n   */\n  toSQL(opts = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for debugging\n   * @return {string}\n   */\n  toString() {\n    return this.isValid ? this.toISO() : INVALID;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;\n    } else {\n      return `DateTime { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime.\n   * @return {number}\n   */\n  toMillis() {\n    return this.isValid ? this.ts : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.\n   * @return {number}\n   */\n  toSeconds() {\n    return this.isValid ? this.ts / 1000 : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (as a whole number) of this DateTime.\n   * @return {number}\n   */\n  toUnixInteger() {\n    return this.isValid ? Math.floor(this.ts / 1000) : NaN;\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a BSON serializable equivalent to this DateTime.\n   * @return {Date}\n   */\n  toBSON() {\n    return this.toJSDate();\n  }\n\n  /**\n   * Returns a JavaScript object with this DateTime's year, month, day, and so on.\n   * @param opts - options for generating the object\n   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output\n   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }\n   * @return {Object}\n   */\n  toObject(opts = {}) {\n    if (!this.isValid) return {};\n\n    const base = { ...this.c };\n\n    if (opts.includeConfig) {\n      base.outputCalendar = this.outputCalendar;\n      base.numberingSystem = this.loc.numberingSystem;\n      base.locale = this.loc.locale;\n    }\n    return base;\n  }\n\n  /**\n   * Returns a JavaScript Date equivalent to this DateTime.\n   * @return {Date}\n   */\n  toJSDate() {\n    return new Date(this.isValid ? this.ts : NaN);\n  }\n\n  // COMPARE\n\n  /**\n   * Return the difference between two DateTimes as a Duration.\n   * @param {DateTime} otherDateTime - the DateTime to compare this one to\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example\n   * var i1 = DateTime.fromISO('1982-05-25T09:45'),\n   *     i2 = DateTime.fromISO('1983-10-14T10:30');\n   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }\n   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }\n   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }\n   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }\n   * @return {Duration}\n   */\n  diff(otherDateTime, unit = \"milliseconds\", opts = {}) {\n    if (!this.isValid || !otherDateTime.isValid) {\n      return Duration.invalid(\"created by diffing an invalid DateTime\");\n    }\n\n    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };\n\n    const units = maybeArray(unit).map(Duration.normalizeUnit),\n      otherIsLater = otherDateTime.valueOf() > this.valueOf(),\n      earlier = otherIsLater ? this : otherDateTime,\n      later = otherIsLater ? otherDateTime : this,\n      diffed = diff(earlier, later, units, durOpts);\n\n    return otherIsLater ? diffed.negate() : diffed;\n  }\n\n  /**\n   * Return the difference between this DateTime and right now.\n   * See {@link DateTime#diff}\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  diffNow(unit = \"milliseconds\", opts = {}) {\n    return this.diff(DateTime.now(), unit, opts);\n  }\n\n  /**\n   * Return an Interval spanning between this DateTime and another DateTime\n   * @param {DateTime} otherDateTime - the other end point of the Interval\n   * @return {Interval|DateTime}\n   */\n  until(otherDateTime) {\n    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;\n  }\n\n  /**\n   * Return whether this DateTime is in the same unit of time as another DateTime.\n   * Higher-order units must also be identical for this function to return `true`.\n   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.\n   * @param {DateTime} otherDateTime - the other DateTime\n   * @param {string} unit - the unit of time to check sameness on\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used\n   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day\n   * @return {boolean}\n   */\n  hasSame(otherDateTime, unit, opts) {\n    if (!this.isValid) return false;\n\n    const inputMs = otherDateTime.valueOf();\n    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });\n    return (\n      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)\n    );\n  }\n\n  /**\n   * Equality check\n   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.\n   * To compare just the millisecond values, use `+dt1 === +dt2`.\n   * @param {DateTime} other - the other DateTime\n   * @return {boolean}\n   */\n  equals(other) {\n    return (\n      this.isValid &&\n      other.isValid &&\n      this.valueOf() === other.valueOf() &&\n      this.zone.equals(other.zone) &&\n      this.loc.equals(other.loc)\n    );\n  }\n\n  /**\n   * Returns a string representation of a this time relative to now, such as \"in two days\". Can only internationalize if your\n   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} [options.style=\"long\"] - the style of units, must be \"long\", \"short\", or \"narrow\"\n   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of \"years\", \"quarters\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", or \"seconds\"\n   * @param {boolean} [options.round=true] - whether to round the numbers in the output.\n   * @param {string} [options.rounding=\"trunc\"] - rounding method to use when rounding the numbers in the output. Can be \"trunc\" (toward zero), \"expand\" (away from zero), \"round\", \"floor\", or \"ceil\".\n   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> \"in 1 day\"\n   * @example DateTime.now().setLocale(\"es\").toRelative({ days: 1 }) //=> \"dentro de 1 día\"\n   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: \"fr\" }) //=> \"dans 23 heures\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> \"2 days ago\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: \"hours\" }) //=> \"48 hours ago\"\n   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> \"1.5 days ago\"\n   */\n  toRelative(options = {}) {\n    if (!this.isValid) return null;\n    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),\n      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;\n    let units = [\"years\", \"months\", \"days\", \"hours\", \"minutes\", \"seconds\"];\n    let unit = options.unit;\n    if (Array.isArray(options.unit)) {\n      units = options.unit;\n      unit = undefined;\n    }\n    return diffRelative(base, this.plus(padding), {\n      ...options,\n      numeric: \"always\",\n      units,\n      unit,\n    });\n  }\n\n  /**\n   * Returns a string representation of this date relative to today, such as \"yesterday\" or \"next month\".\n   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of \"years\", \"quarters\", \"months\", \"weeks\", or \"days\"\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> \"tomorrow\"\n   * @example DateTime.now().setLocale(\"es\").plus({ days: 1 }).toRelative() //=> \"\"mañana\"\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: \"fr\" }) //=> \"demain\"\n   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> \"2 days ago\"\n   */\n  toRelativeCalendar(options = {}) {\n    if (!this.isValid) return null;\n\n    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {\n      ...options,\n      numeric: \"auto\",\n      units: [\"years\", \"months\", \"days\"],\n      calendary: true,\n    });\n  }\n\n  /**\n   * Return the min of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum\n   * @return {DateTime} the min DateTime, or undefined if called with no argument\n   */\n  static min(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"min requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);\n  }\n\n  /**\n   * Return the max of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum\n   * @return {DateTime} the max DateTime, or undefined if called with no argument\n   */\n  static max(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"max requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);\n  }\n\n  // MISC\n\n  /**\n   * Explain how a string would be parsed by fromFormat()\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see description)\n   * @param {Object} options - options taken by fromFormat()\n   * @return {Object}\n   */\n  static fromFormatExplain(text, fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return explainFromTokens(localeToUse, text, fmt);\n  }\n\n  /**\n   * @deprecated use fromFormatExplain instead\n   */\n  static fromStringExplain(text, fmt, options = {}) {\n    return DateTime.fromFormatExplain(text, fmt, options);\n  }\n\n  /**\n   * Build a parser for `fmt` using the given locale. This parser can be passed\n   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This\n   * can be used to optimize cases where many dates need to be parsed in a\n   * specific format.\n   *\n   * @param {String} fmt - the format the string is expected to be in (see\n   * description)\n   * @param {Object} options - options used to set locale and numberingSystem\n   * for parser\n   * @returns {TokenParser} - opaque object to be used\n   */\n  static buildFormatParser(fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return new TokenParser(localeToUse, fmt);\n  }\n\n  /**\n   * Create a DateTime from an input string and format parser.\n   *\n   * The format parser must have been created with the same locale as this call.\n   *\n   * @param {String} text - the string to parse\n   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}\n   * @param {Object} opts - options taken by fromFormat()\n   * @returns {DateTime}\n   */\n  static fromFormatParser(text, formatParser, opts = {}) {\n    if (isUndefined(text) || isUndefined(formatParser)) {\n      throw new InvalidArgumentError(\n        \"fromFormatParser requires an input string and a format parser\"\n      );\n    }\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n\n    if (!localeToUse.equals(formatParser.locale)) {\n      throw new InvalidArgumentError(\n        `fromFormatParser called with a locale of ${localeToUse}, ` +\n          `but the format parser was created for ${formatParser.locale}`\n      );\n    }\n\n    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);\n\n    if (invalidReason) {\n      return DateTime.invalid(invalidReason);\n    } else {\n      return parseDataToDateTime(\n        result,\n        zone,\n        opts,\n        `format ${formatParser.format}`,\n        text,\n        specificOffset\n      );\n    }\n  }\n\n  // FORMAT PRESETS\n\n  /**\n   * {@link DateTime#toLocaleString} format like 10/14/1983\n   * @type {Object}\n   */\n  static get DATE_SHORT() {\n    return Formats.DATE_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED() {\n    return Formats.DATE_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED_WITH_WEEKDAY() {\n    return Formats.DATE_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_FULL() {\n    return Formats.DATE_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_HUGE() {\n    return Formats.DATE_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_SIMPLE() {\n    return Formats.TIME_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SECONDS() {\n    return Formats.TIME_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SHORT_OFFSET() {\n    return Formats.TIME_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_LONG_OFFSET() {\n    return Formats.TIME_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_SIMPLE() {\n    return Formats.TIME_24_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SECONDS() {\n    return Formats.TIME_24_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SHORT_OFFSET() {\n    return Formats.TIME_24_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_LONG_OFFSET() {\n    return Formats.TIME_24_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT() {\n    return Formats.DATETIME_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT_WITH_SECONDS() {\n    return Formats.DATETIME_SHORT_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED() {\n    return Formats.DATETIME_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_SECONDS() {\n    return Formats.DATETIME_MED_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_WEEKDAY() {\n    return Formats.DATETIME_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL() {\n    return Formats.DATETIME_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL_WITH_SECONDS() {\n    return Formats.DATETIME_FULL_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE() {\n    return Formats.DATETIME_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE_WITH_SECONDS() {\n    return Formats.DATETIME_HUGE_WITH_SECONDS;\n  }\n}\n\n/**\n * @private\n */\nexport function friendlyDateTime(dateTimeish) {\n  if (DateTime.isDateTime(dateTimeish)) {\n    return dateTimeish;\n  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {\n    return DateTime.fromJSDate(dateTimeish);\n  } else if (dateTimeish && typeof dateTimeish === \"object\") {\n    return DateTime.fromObject(dateTimeish);\n  } else {\n    throw new InvalidArgumentError(\n      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`\n    );\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Info from \"./info.js\";\nimport Zone from \"./zone.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport InvalidZone from \"./zones/invalidZone.js\";\nimport SystemZone from \"./zones/systemZone.js\";\nimport Settings from \"./settings.js\";\n\nconst VERSION = \"3.7.2\";\n\nexport {\n  VERSION,\n  DateTime,\n  Duration,\n  Interval,\n  Info,\n  Zone,\n  FixedOffsetZone,\n  IANAZone,\n  InvalidZone,\n  SystemZone,\n  Settings,\n};\n"],"names":["LuxonError","_Error","_inheritsLoose","apply","arguments","_wrapNativeSuper","Error","InvalidDateTimeError","_LuxonError","reason","call","toMessage","InvalidIntervalError","_LuxonError2","InvalidDurationError","_LuxonError3","ConflictingSpecificationError","_LuxonError4","InvalidUnitError","_LuxonError5","unit","InvalidArgumentError","_LuxonError6","ZoneIsAbstractError","_LuxonError7","n","s","l","DATE_SHORT","year","month","day","DATE_MED","DATE_MED_WITH_WEEKDAY","weekday","DATE_FULL","DATE_HUGE","TIME_SIMPLE","hour","minute","TIME_WITH_SECONDS","second","TIME_WITH_SHORT_OFFSET","timeZoneName","TIME_WITH_LONG_OFFSET","TIME_24_SIMPLE","hourCycle","TIME_24_WITH_SECONDS","TIME_24_WITH_SHORT_OFFSET","TIME_24_WITH_LONG_OFFSET","DATETIME_SHORT","DATETIME_SHORT_WITH_SECONDS","DATETIME_MED","DATETIME_MED_WITH_SECONDS","DATETIME_MED_WITH_WEEKDAY","DATETIME_FULL","DATETIME_FULL_WITH_SECONDS","DATETIME_HUGE","DATETIME_HUGE_WITH_SECONDS","Zone","_proto","prototype","offsetName","ts","opts","formatOffset","format","offset","equals","otherZone","_createClass","key","get","name","singleton","SystemZone","_Zone","_ref","locale","parseZoneInfo","Date","getTimezoneOffset","type","Intl","DateTimeFormat","resolvedOptions","timeZone","dtfCache","Map","makeDTF","zoneName","dtf","undefined","hour12","era","set","typeToPos","hackyOffset","date","formatted","replace","parsed","exec","fMonth","fDay","fYear","fadOrBc","fHour","fMinute","fSecond","partsOffset","formatToParts","filled","i","length","_formatted$i","value","pos","isUndefined","parseInt","ianaZoneCache","IANAZone","create","zone","resetCache","clear","isValidSpecifier","isValidZone","e","_this","valid","NaN","isNaN","_ref2","adOrBc","Math","abs","adjustedHour","asUTC","objToLocalTS","millisecond","asTS","over","intlLFCache","getCachedLF","locString","JSON","stringify","ListFormat","intlDTCache","getCachedDTF","intlNumCache","getCachedINF","inf","NumberFormat","intlRelCache","getCachedRTF","_opts","base","cacheKeyOpts","_objectWithoutPropertiesLoose","_excluded","RelativeTimeFormat","sysLocaleCache","systemLocale","intlResolvedOptionsCache","getCachedIntResolvedOptions","weekInfoCache","getCachedWeekInfo","data","Locale","getWeekInfo","weekInfo","_extends","fallbackWeekSettings","parseLocaleString","localeStr","xIndex","indexOf","substring","uIndex","options","selectedStr","smaller","_options","numberingSystem","calendar","intlConfigString","outputCalendar","includes","mapMonths","f","ms","dt","DateTime","utc","push","mapWeekdays","listStuff","loc","englishFn","intlFn","mode","listingMode","supportsFastNumbers","startsWith","PolyNumberFormatter","intl","forceSimple","padTo","floor","otherOpts","_excluded2","Object","keys","intlOpts","useGrouping","minimumIntegerDigits","fixed","roundTo","padStart","PolyDateFormatter","originalZone","z","gmtOffset","offsetZ","setZone","plus","minutes","_proto2","map","join","toJSDate","parts","part","PolyRelFormatter","isEnglish","style","hasRelative","rtf","_proto3","count","English","numeric","firstDay","minimalDays","weekend","fromOpts","weekSettings","defaultToEN","specifiedLocale","Settings","defaultLocale","localeR","numberingSystemR","defaultNumberingSystem","outputCalendarR","defaultOutputCalendar","weekSettingsR","validateWeekSettings","defaultWeekSettings","fromObject","_temp","numbering","_parseLocaleString","parsedLocale","parsedNumberingSystem","parsedOutputCalendar","weekdaysCache","standalone","monthsCache","meridiemCache","eraCache","fastNumbersCached","_proto4","isActuallyEn","hasNoWeirdness","clone","alts","getOwnPropertyNames","redefaultToEN","redefaultToSystem","months","_this2","monthSpecialCase","formatStr","mapper","extract","dtFormatter","weekdays","_this3","meridiems","_this4","eras","_this5","field","df","results","matching","find","m","toLowerCase","numberFormatter","fastNumbers","relFormatter","listFormatter","getWeekSettings","hasLocaleWeekInfo","getStartOfWeek","getMinDaysInFirstWeek","getWeekendDays","other","toString","FixedOffsetZone","instance","utcInstance","parseSpecifier","r","match","signedOffset","InvalidZone","normalizeZone","input","defaultZone","isString","lowered","isNumber","numberingSystems","arab","arabext","bali","beng","deva","fullwide","gujr","hanidec","khmr","knda","laoo","limb","mlym","mong","mymr","orya","tamldec","telu","thai","tibt","latn","numberingSystemsUTF16","hanidecChars","split","parseDigits","str","code","charCodeAt","search","_numberingSystemsUTF","min","max","digitRegexCache","resetDigitRegexCache","digitRegex","append","ns","appendCache","regex","RegExp","now","twoDigitCutoffYear","throwOnInvalid","resetCaches","cutoffYear","t","Invalid","explanation","nonLeapLadder","leapLadder","unitOutOfRange","dayOfWeek","d","UTC","setUTCFullYear","getUTCFullYear","js","getUTCDay","computeOrdinal","isLeapYear","uncomputeOrdinal","ordinal","table","month0","findIndex","isoWeekdayToLocal","isoWeekday","startOfWeek","gregorianToWeek","gregObj","minDaysInFirstWeek","weekNumber","weekYear","weeksInWeekYear","timeObject","weekToGregorian","weekData","weekdayOfJan4","yearInDays","daysInYear","_uncomputeOrdinal","gregorianToOrdinal","gregData","ordinalToGregorian","ordinalData","_uncomputeOrdinal2","usesLocalWeekValues","obj","hasLocaleWeekData","localWeekday","localWeekNumber","localWeekYear","hasIsoWeekData","hasInvalidWeekData","validYear","isInteger","validWeek","integerBetween","validWeekday","hasInvalidOrdinalData","validOrdinal","hasInvalidGregorianData","validMonth","validDay","daysInMonth","hasInvalidTimeData","validHour","validMinute","validSecond","validMillisecond","o","isDate","maybeArray","thing","Array","isArray","bestBy","arr","by","compare","reduce","best","next","pair","pick","a","k","hasOwnProperty","prop","settings","some","v","from","bottom","top","floorMod","x","isNeg","padded","parseInteger","string","parseFloating","parseFloat","parseMillis","fraction","number","digits","rounding","factor","pow","ceil","trunc","round","RangeError","modMonth","modYear","firstWeekOffset","fwdlw","weekOffset","weekOffsetNext","untruncateYear","offsetFormat","modified","offHourStr","offMinuteStr","offHour","Number","offMin","offMinSigned","is","asNumber","numericValue","isFinite","normalizeObject","normalizer","normalized","u","hours","sign","monthsLong","monthsShort","monthsNarrow","concat","weekdaysLong","weekdaysShort","weekdaysNarrow","erasLong","erasShort","erasNarrow","meridiemForDateTime","weekdayForDateTime","monthForDateTime","eraForDateTime","formatRelativeTime","narrow","units","years","quarters","weeks","days","seconds","lastable","isDay","isInPast","fmtValue","singular","lilUnits","fmtUnit","stringifyTokens","splits","tokenToString","_iterator","_createForOfIteratorHelperLoose","_step","done","token","literal","val","macroTokenToFormatOpts","D","Formats","DD","DDD","DDDD","tt","ttt","tttt","T","TT","TTT","TTTT","ff","fff","ffff","F","FF","FFF","FFFF","Formatter","parseFormat","fmt","current","currentFull","bracketed","c","charAt","test","formatOpts","systemLoc","formatWithSystemDefault","formatDateTime","formatDateTimeParts","formatInterval","interval","start","formatRange","end","num","p","signDisplay","formatDateTimeFromString","knownEnglish","useDateTimeFormatter","isOffsetFixed","allowZ","isValid","meridiem","maybeMacro","slice","quarter","formatDurationFromString","dur","invertLargest","signMode","tokenToField","lildur","info","mapped","inversionFactor","isNegativeDuration","largestUnit","tokens","realTokens","found","collapsed","shiftTo","filter","durationInfo","values","ianaRegex","combineRegexes","_len","regexes","_key","full","source","combineExtractors","_len2","extractors","_key2","ex","mergedVals","mergedZone","cursor","_ex","parse","_len3","patterns","_key3","_i","_patterns","_patterns$_i","extractor","simpleParse","_len4","_key4","ret","offsetRegex","isoExtendedZone","isoTimeBaseRegex","isoTimeRegex","isoTimeExtensionRegex","isoYmdRegex","isoWeekRegex","isoOrdinalRegex","extractISOWeekData","extractISOOrdinalData","sqlYmdRegex","sqlTimeRegex","sqlTimeExtensionRegex","int","fallback","extractISOYmd","item","extractISOTime","milliseconds","extractISOOffset","local","fullOffset","extractIANAZone","isoTimeOnly","isoDuration","extractISODuration","yearStr","monthStr","weekStr","dayStr","hourStr","minuteStr","secondStr","millisecondsStr","hasNegativePrefix","negativeSeconds","maybeNegate","force","obsOffsets","GMT","EDT","EST","CDT","CST","MDT","MST","PDT","PST","fromStrings","weekdayStr","result","rfc2822","extractRFC2822","obsOffset","milOffset","preprocessRFC2822","trim","rfc1123","rfc850","ascii","extractRFC1123Or850","extractASCII","isoYmdWithTimeExtensionRegex","isoWeekWithTimeExtensionRegex","isoOrdinalWithTimeExtensionRegex","isoTimeCombinedRegex","extractISOYmdTimeAndOffset","extractISOWeekTimeAndOffset","extractISOOrdinalDateAndTime","extractISOTimeAndOffset","parseISODate","parseRFC2822Date","parseHTTPDate","parseISODuration","extractISOTimeOnly","parseISOTimeOnly","sqlYmdWithTimeExtensionRegex","sqlTimeCombinedRegex","extractISOTimeOffsetAndIANAZone","parseSQL","INVALID","lowOrderMatrix","casualMatrix","daysInYearAccurate","daysInMonthAccurate","accurateMatrix","orderedUnits","reverseUnits","reverse","conf","conversionAccuracy","matrix","Duration","durationToMillis","vals","_vals$milliseconds","sum","normalizeValues","reduceRight","previous","previousVal","conv","rollUp","removeZeroes","newVals","_Object$entries","entries","_Object$entries$_i","_Symbol$for","config","accurate","invalid","isLuxonDuration","fromMillis","normalizeUnit","fromDurationLike","durationLike","isDuration","fromISO","text","_parseISODuration","fromISOTime","_parseISOTimeOnly","week","toFormat","fmtOpts","toHuman","showZeros","unitDisplay","listStyle","toObject","toISO","toISOTime","millis","toMillis","suppressMilliseconds","suppressSeconds","includePrefix","includeOffset","dateTime","toJSON","invalidReason","valueOf","duration","_i2","_orderedUnits","minus","negate","mapUnits","fn","_i3","_Object$keys","mixed","reconfigure","as","normalize","rescale","shiftToAll","built","accumulated","lastUnit","_i4","_orderedUnits2","own","ak","negated","_i5","_Object$keys2","removeZeros","eq","v1","v2","_i6","_orderedUnits3","Symbol","for","validateStartEnd","Interval","isLuxonInterval","fromDateTimes","builtStart","friendlyDateTime","builtEnd","validateError","after","before","_split","startIsValid","endIsValid","isInterval","toDuration","startOf","useLocaleWeeks","diff","hasSame","isEmpty","isAfter","isBefore","contains","splitAt","dateTimes","sorted","sort","b","added","splitBy","idx","divideEqually","numberOfParts","overlaps","abutsStart","abutsEnd","engulfs","intersection","union","merge","intervals","_intervals$sort$reduc","sofar","final","xor","_Array$prototype","currentCount","ends","time","flattened","difference","toLocaleString","toISODate","dateFormat","_temp2","_ref3","_ref3$separator","separator","mapEndpoints","mapFn","Info","hasDST","proto","isUniversal","isValidIANAZone","_ref$locale","_ref$locObj","locObj","getMinimumDaysInFirstWeek","_ref2$locale","_ref2$locObj","getWeekendWeekdays","_temp3","_ref3$locale","_ref3$locObj","_temp4","_ref4","_ref4$locale","_ref4$numberingSystem","_ref4$locObj","_ref4$outputCalendar","monthsFormat","_temp5","_ref5","_ref5$locale","_ref5$numberingSystem","_ref5$locObj","_ref5$outputCalendar","_temp6","_ref6","_ref6$locale","_ref6$numberingSystem","_ref6$locObj","weekdaysFormat","_temp7","_ref7","_ref7$locale","_ref7$numberingSystem","_ref7$locObj","_temp8","_ref8","_ref8$locale","_temp9","_ref9","_ref9$locale","features","relative","localeWeek","dayDiff","earlier","later","utcDayStart","toUTC","keepLocalTime","highOrderDiffs","differs","lowestOrder","highWater","_differs","_differs$_i","differ","_highOrderDiffs","remainingMillis","lowerOrderUnits","_cursor$plus","_Duration$fromMillis","MISSING_FTP","intUnit","post","deser","NBSP","String","fromCharCode","spaceOrNBSP","spaceOrNBSPRegExp","fixListRegex","stripInsensitivities","oneOf","strings","startIndex","groups","h","simple","escapeToken","unitForToken","one","two","three","four","six","oneOrTwo","oneToThree","oneToSix","oneToNine","twoToFour","fourToSix","unitate","partTypeStyleToTokenVal","short","long","dayperiod","dayPeriod","hour24","tokenForPart","resolvedOpts","isSpace","actualType","buildRegex","re","handlers","matches","all","matchIndex","dateTimeFromMatches","toField","specificOffset","Z","q","M","G","y","S","dummyDateTimeCache","getDummyDateTime","maybeExpandMacroToken","formatOptsToTokens","expandMacroTokens","TokenParser","disqualifyingUnit","_buildRegex","regexString","explainFromTokens","_match","rawMatches","parser","parseFromTokens","_explainFromTokens","formatter","MAX_DATE","unsupportedZone","possiblyCachedWeekData","possiblyCachedLocalWeekData","localWeekData","inst","old","fixOffset","localTS","tz","utcGuess","o2","o3","tsToObj","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","objToTS","adjustTime","oPre","millisToAdd","_fixOffset","parseDataToDateTime","parsedZone","interpretationZone","toTechFormat","extended","precision","longFormat","extendedZone","showSeconds","ianaName","defaultUnitValues","defaultWeekUnitValues","defaultOrdinalUnitValues","orderedWeekUnits","orderedOrdinalUnits","weeknumber","weeksnumber","weeknumbers","weekyear","weekyears","normalizeUnitWithLocalWeeks","guessOffsetForZone","zoneOffsetTs","offsetGuess","zoneOffsetGuessCache","quickDT","offsetProvis","_objToTS","diffRelative","calendary","lastOpts","argList","args","unchanged","ot","_zone","isLuxonDateTime","_lastOpts","_lastOpts2","fromJSDate","zoneToUse","fromSeconds","_usesLocalWeekValues","tsNow","containsOrdinal","containsGregorYear","containsGregorMD","containsGregor","definiteWeekDef","useWeekData","defaultValues","objNow","foundFirst","_iterator2","_step2","higherOrderInvalid","gregorian","_objToTS2","tsFinal","offsetFinal","_parseISODate","fromRFC2822","_parseRFC2822Date","fromHTTP","_parseHTTPDate","fromFormat","_opts$locale","_opts$numberingSystem","localeToUse","_parseFromTokens","fromString","fromSQL","_parseSQL","isDateTime","parseFormatForOpts","localeOpts","tokenList","expandFormat","expanded","getPossibleOffsets","dayMs","minuteMs","oEarlier","oLater","o1","ts1","ts2","c1","c2","resolvedLocaleOptions","_Formatter$create$res","toLocal","_ref2$keepLocalTime","_ref2$keepCalendarTim","keepCalendarTime","newTS","asObj","_objToTS3","setLocale","_usesLocalWeekValues2","settingWeekStuff","_objToTS4","_ref4$useLocaleWeeks","normalizedUnit","endOf","_this$plus","toLocaleParts","_ref5$format","_ref5$suppressSeconds","_ref5$suppressMillise","_ref5$includeOffset","_ref5$extendedZone","_ref5$precision","ext","_ref6$format","_ref6$precision","toISOWeekDate","_ref7$suppressMillise","_ref7$suppressSeconds","_ref7$includeOffset","_ref7$includePrefix","_ref7$extendedZone","_ref7$format","_ref7$precision","toRFC2822","toHTTP","toSQLDate","toSQLTime","_ref8$includeOffset","_ref8$includeZone","includeZone","_ref8$includeOffsetSp","includeOffsetSpace","toSQL","toSeconds","toUnixInteger","toBSON","includeConfig","otherDateTime","durOpts","otherIsLater","diffed","diffNow","until","inputMs","adjustedToZone","toRelative","padding","toRelativeCalendar","every","fromFormatExplain","_options$locale","_options$numberingSys","fromStringExplain","buildFormatParser","_options2","_options2$locale","_options2$numberingSy","fromFormatParser","formatParser","_opts2","_opts2$locale","_opts2$numberingSyste","_formatParser$explain","dateTimeish","VERSION"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAAA;EAEA;EACA;EACA;EAFA,IAGMA,UAAU,0BAAAC,MAAA,EAAA;IAAAC,cAAA,CAAAF,UAAA,EAAAC,MAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,UAAA,GAAA;EAAA,IAAA,OAAAC,MAAA,CAAAE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAJ,UAAA,CAAA;EAAA,CAAAK,eAAAA,gBAAA,CAASC,KAAK,CAAA,CAAA,CAAA;EAE9B;EACA;EACA;EACaC,IAAAA,oBAAoB,0BAAAC,WAAA,EAAA;IAAAN,cAAA,CAAAK,oBAAA,EAAAC,WAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYE,MAAM,EAAE;MAAA,OAClBD,WAAA,CAAAE,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAJ,oBAAA,CAAA;EAAA,CAAA,CAHuCP,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACaY,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAAX,cAAA,CAAAU,oBAAA,EAAAC,YAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYH,MAAM,EAAE;MAAA,OAClBI,YAAA,CAAAH,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAC,oBAAA,CAAA;EAAA,CAAA,CAHuCZ,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACac,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAAb,cAAA,CAAAY,oBAAA,EAAAC,YAAA,CAAA,CAAA;IAC/B,SAAAD,oBAAAA,CAAYL,MAAM,EAAE;MAAA,OAClBM,YAAA,CAAAL,IAAA,CAAA,IAAA,EAAA,oBAAA,GAA2BD,MAAM,CAACE,SAAS,EAAI,CAAC,IAAA,IAAA,CAAA;EAClD,GAAA;EAAC,EAAA,OAAAG,oBAAA,CAAA;EAAA,CAAA,CAHuCd,UAAU,CAAA,CAAA;;EAMpD;EACA;EACA;EACagB,IAAAA,6BAA6B,0BAAAC,YAAA,EAAA;IAAAf,cAAA,CAAAc,6BAAA,EAAAC,YAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,6BAAA,GAAA;EAAA,IAAA,OAAAC,YAAA,CAAAd,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAY,6BAAA,CAAA;EAAA,CAAA,CAAShB,UAAU,CAAA,CAAA;;EAE7D;EACA;EACA;EACakB,IAAAA,gBAAgB,0BAAAC,YAAA,EAAA;IAAAjB,cAAA,CAAAgB,gBAAA,EAAAC,YAAA,CAAA,CAAA;IAC3B,SAAAD,gBAAAA,CAAYE,IAAI,EAAE;EAAA,IAAA,OAChBD,YAAA,CAAAT,IAAA,CAAA,IAAA,EAAA,eAAA,GAAsBU,IAAM,CAAC,IAAA,IAAA,CAAA;EAC/B,GAAA;EAAC,EAAA,OAAAF,gBAAA,CAAA;EAAA,CAAA,CAHmClB,UAAU,CAAA,CAAA;;EAMhD;EACA;EACA;EACaqB,IAAAA,oBAAoB,0BAAAC,YAAA,EAAA;IAAApB,cAAA,CAAAmB,oBAAA,EAAAC,YAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,oBAAA,GAAA;EAAA,IAAA,OAAAC,YAAA,CAAAnB,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,OAAAiB,oBAAA,CAAA;EAAA,CAAA,CAASrB,UAAU,CAAA,CAAA;;EAEpD;EACA;EACA;EACauB,IAAAA,mBAAmB,0BAAAC,YAAA,EAAA;IAAAtB,cAAA,CAAAqB,mBAAA,EAAAC,YAAA,CAAA,CAAA;EAC9B,EAAA,SAAAD,sBAAc;EAAA,IAAA,OACZC,YAAA,CAAAd,IAAA,CAAA,IAAA,EAAM,2BAA2B,CAAC,IAAA,IAAA,CAAA;EACpC,GAAA;EAAC,EAAA,OAAAa,mBAAA,CAAA;EAAA,CAAA,CAHsCvB,UAAU,CAAA;;ECxDnD;EACA;EACA;;EAEA,IAAMyB,CAAC,GAAG,SAAS;EACjBC,EAAAA,CAAC,GAAG,OAAO;EACXC,EAAAA,CAAC,GAAG,MAAM,CAAA;EAEL,IAAMC,UAAU,GAAG;EACxBC,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMO,QAAQ,GAAG;EACtBH,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMQ,qBAAqB,GAAG;EACnCJ,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAER,CAAAA;EACX,CAAC,CAAA;EAEM,IAAMS,SAAS,GAAG;EACvBN,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAAA;EACP,CAAC,CAAA;EAEM,IAAMW,SAAS,GAAG;EACvBP,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAAA;EACX,CAAC,CAAA;EAEM,IAAMU,WAAW,GAAG;EACzBC,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAMe,iBAAiB,GAAG;EAC/BF,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAMiB,sBAAsB,GAAG;EACpCJ,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMkB,qBAAqB,GAAG;EACnCN,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMkB,cAAc,GAAG;EAC5BP,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAA;EACb,CAAC,CAAA;EAEM,IAAMC,oBAAoB,GAAG;EAClCT,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAA;EACb,CAAC,CAAA;EAEM,IAAME,yBAAyB,GAAG;EACvCV,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAK;EAChBH,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMuB,wBAAwB,GAAG;EACtCX,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTqB,EAAAA,SAAS,EAAE,KAAK;EAChBH,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAMuB,cAAc,GAAG;EAC5BrB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM0B,2BAA2B,GAAG;EACzCtB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEL,CAAC;EACRM,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM2B,YAAY,GAAG;EAC1BvB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM4B,yBAAyB,GAAG;EACvCxB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM6B,yBAAyB,GAAG;EACvCzB,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEJ,CAAC;EACRK,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAER,CAAC;EACVY,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAAA;EACV,CAAC,CAAA;EAEM,IAAM8B,aAAa,GAAG;EAC3B1B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM8B,0BAA0B,GAAG;EACxC3B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNa,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEjB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM+B,aAAa,GAAG;EAC3B5B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAC;EACVW,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC,CAAA;EAEM,IAAM+B,0BAA0B,GAAG;EACxC7B,EAAAA,IAAI,EAAEJ,CAAC;EACPK,EAAAA,KAAK,EAAEH,CAAC;EACRI,EAAAA,GAAG,EAAEN,CAAC;EACNS,EAAAA,OAAO,EAAEP,CAAC;EACVW,EAAAA,IAAI,EAAEb,CAAC;EACPc,EAAAA,MAAM,EAAEd,CAAC;EACTgB,EAAAA,MAAM,EAAEhB,CAAC;EACTkB,EAAAA,YAAY,EAAEhB,CAAAA;EAChB,CAAC;;EC7KD;EACA;EACA;AAFA,MAGqBgC,IAAI,gBAAA,YAAA;EAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;EAAA,EAAA,IAAAC,MAAA,GAAAD,IAAA,CAAAE,SAAA,CAAA;EAsCvB;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAEC,IAAI,EAAE;MACnB,MAAM,IAAIzC,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAqC,MAAA,CAQAK,YAAY,GAAZ,SAAAA,aAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,MAAM,IAAI3C,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAqC,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;MACT,MAAM,IAAIxC,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAqC,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;MAChB,MAAM,IAAI9C,mBAAmB,EAAE,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA+C,EAAAA,YAAA,CAAAX,IAAA,EAAA,CAAA;MAAAY,GAAA,EAAA,MAAA;MAAAC,GAAA;EAlFA;EACF;EACA;EACA;EACA;EACE,IAAA,SAAAA,MAAW;QACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAgD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAgD,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACC,IAAI,CAAA;EAClB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAF,GAAA,EAAA,aAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;QAChB,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;EAAC,GAAA,EAAA;MAAAgD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAoDD,SAAAA,GAAAA,GAAc;QACZ,MAAM,IAAIjD,mBAAmB,EAAE,CAAA;EACjC,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAoC,IAAA,CAAA;EAAA,CAAA;;EC5FH,IAAIe,WAAS,GAAG,IAAI,CAAA;;EAEpB;EACA;EACA;EACA;AACqBC,MAAAA,UAAU,0BAAAC,KAAA,EAAA;IAAA1E,cAAA,CAAAyE,UAAA,EAAAC,KAAA,CAAA,CAAA;EAAA,EAAA,SAAAD,UAAA,GAAA;EAAA,IAAA,OAAAC,KAAA,CAAAzE,KAAA,CAAA,IAAA,EAAAC,SAAA,CAAA,IAAA,IAAA,CAAA;EAAA,GAAA;EAAA,EAAA,IAAAwD,MAAA,GAAAe,UAAA,CAAAd,SAAA,CAAA;EA2B7B;IAAAD,MAAA,CACAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;EAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;QAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;EAC7B,IAAA,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,CAAC,CAAA;EAC1C,GAAA;;EAEA,oBAAA;IAAAlB,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;EAC9C,GAAA;;EAEA,oBAAA;EAAAN,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;MACT,OAAO,CAAC,IAAIiB,IAAI,CAACjB,EAAE,CAAC,CAACkB,iBAAiB,EAAE,CAAA;EAC1C,GAAA;;EAEA,oBAAA;EAAArB,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,QAAQ,CAAA;EACpC,GAAA;;EAEA,oBAAA;EAAAZ,EAAAA,YAAA,CAAAK,UAAA,EAAA,CAAA;MAAAJ,GAAA,EAAA,MAAA;EAAAC,IAAAA,GAAA;EAlCA,IAAA,SAAAA,MAAW;EACT,MAAA,OAAO,QAAQ,CAAA;EACjB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAIW,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACC,QAAQ,CAAA;EAC7D,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAf,GAAA,EAAA,aAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAAD,GAAA,EAAA,UAAA;MAAAC,GAAA;EAjDD;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAsB;QACpB,IAAIE,WAAS,KAAK,IAAI,EAAE;EACtBA,QAAAA,WAAS,GAAG,IAAIC,UAAU,EAAE,CAAA;EAC9B,OAAA;EACA,MAAA,OAAOD,WAAS,CAAA;EAClB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAC,UAAA,CAAA;EAAA,CAAA,CAVqChB,IAAI;;ECN5C,IAAM4B,QAAQ,GAAG,IAAIC,GAAG,EAAE,CAAA;EAC1B,SAASC,OAAOA,CAACC,QAAQ,EAAE;EACzB,EAAA,IAAIC,GAAG,GAAGJ,QAAQ,CAACf,GAAG,CAACkB,QAAQ,CAAC,CAAA;IAChC,IAAIC,GAAG,KAAKC,SAAS,EAAE;EACrBD,IAAAA,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;EACrCS,MAAAA,MAAM,EAAE,KAAK;EACbP,MAAAA,QAAQ,EAAEI,QAAQ;EAClB7D,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,KAAK,EAAE,SAAS;EAChBC,MAAAA,GAAG,EAAE,SAAS;EACdO,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,MAAM,EAAE,SAAS;EACjBE,MAAAA,MAAM,EAAE,SAAS;EACjBqD,MAAAA,GAAG,EAAE,OAAA;EACP,KAAC,CAAC,CAAA;EACFP,IAAAA,QAAQ,CAACQ,GAAG,CAACL,QAAQ,EAAEC,GAAG,CAAC,CAAA;EAC7B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAMK,SAAS,GAAG;EAChBnE,EAAAA,IAAI,EAAE,CAAC;EACPC,EAAAA,KAAK,EAAE,CAAC;EACRC,EAAAA,GAAG,EAAE,CAAC;EACN+D,EAAAA,GAAG,EAAE,CAAC;EACNxD,EAAAA,IAAI,EAAE,CAAC;EACPC,EAAAA,MAAM,EAAE,CAAC;EACTE,EAAAA,MAAM,EAAE,CAAA;EACV,CAAC,CAAA;EAED,SAASwD,WAAWA,CAACN,GAAG,EAAEO,IAAI,EAAE;EACxB,EAAA,IAAAC,SAAS,GAAGR,GAAG,CAACzB,MAAM,CAACgC,IAAI,CAAC,CAACE,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;EACvDC,IAAAA,MAAM,GAAG,iDAAiD,CAACC,IAAI,CAACH,SAAS,CAAC;EACvEI,IAAAA,MAAM,GAAmDF,MAAM,CAAA,CAAA,CAAA;EAAvDG,IAAAA,IAAI,GAA6CH,MAAM,CAAA,CAAA,CAAA;EAAjDI,IAAAA,KAAK,GAAsCJ,MAAM,CAAA,CAAA,CAAA;EAA1CK,IAAAA,OAAO,GAA6BL,MAAM,CAAA,CAAA,CAAA;EAAjCM,IAAAA,KAAK,GAAsBN,MAAM,CAAA,CAAA,CAAA;EAA1BO,IAAAA,OAAO,GAAaP,MAAM,CAAA,CAAA,CAAA;EAAjBQ,IAAAA,OAAO,GAAIR,MAAM,CAAA,CAAA,CAAA,CAAA;EACpE,EAAA,OAAO,CAACI,KAAK,EAAEF,MAAM,EAAEC,IAAI,EAAEE,OAAO,EAAEC,KAAK,EAAEC,OAAO,EAAEC,OAAO,CAAC,CAAA;EAChE,CAAA;EAEA,SAASC,WAAWA,CAACnB,GAAG,EAAEO,IAAI,EAAE;EAC9B,EAAA,IAAMC,SAAS,GAAGR,GAAG,CAACoB,aAAa,CAACb,IAAI,CAAC,CAAA;IACzC,IAAMc,MAAM,GAAG,EAAE,CAAA;EACjB,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGd,SAAS,CAACe,MAAM,EAAED,CAAC,EAAE,EAAE;EACzC,IAAA,IAAAE,YAAA,GAAwBhB,SAAS,CAACc,CAAC,CAAC;QAA5B/B,IAAI,GAAAiC,YAAA,CAAJjC,IAAI;QAAEkC,KAAK,GAAAD,YAAA,CAALC,KAAK,CAAA;EACnB,IAAA,IAAMC,GAAG,GAAGrB,SAAS,CAACd,IAAI,CAAC,CAAA;MAE3B,IAAIA,IAAI,KAAK,KAAK,EAAE;EAClB8B,MAAAA,MAAM,CAACK,GAAG,CAAC,GAAGD,KAAK,CAAA;EACrB,KAAC,MAAM,IAAI,CAACE,WAAW,CAACD,GAAG,CAAC,EAAE;QAC5BL,MAAM,CAACK,GAAG,CAAC,GAAGE,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;EACnC,KAAA;EACF,GAAA;EACA,EAAA,OAAOJ,MAAM,CAAA;EACf,CAAA;EAEA,IAAMQ,aAAa,GAAG,IAAIhC,GAAG,EAAE,CAAA;EAC/B;EACA;EACA;EACA;AACqBiC,MAAAA,QAAQ,0BAAA7C,KAAA,EAAA;IAAA1E,cAAA,CAAAuH,QAAA,EAAA7C,KAAA,CAAA,CAAA;EAC3B;EACF;EACA;EACA;EAHE6C,EAAAA,QAAA,CAIOC,MAAM,GAAb,SAAAA,MAAAA,CAAcjD,IAAI,EAAE;EAClB,IAAA,IAAIkD,IAAI,GAAGH,aAAa,CAAChD,GAAG,CAACC,IAAI,CAAC,CAAA;MAClC,IAAIkD,IAAI,KAAK/B,SAAS,EAAE;EACtB4B,MAAAA,aAAa,CAACzB,GAAG,CAACtB,IAAI,EAAGkD,IAAI,GAAG,IAAIF,QAAQ,CAAChD,IAAI,CAAE,CAAC,CAAA;EACtD,KAAA;EACA,IAAA,OAAOkD,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAF,EAAAA,QAAA,CAIOG,UAAU,GAAjB,SAAAA,aAAoB;MAClBJ,aAAa,CAACK,KAAK,EAAE,CAAA;MACrBtC,QAAQ,CAACsC,KAAK,EAAE,CAAA;EAClB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAJ,EAAAA,QAAA,CAQOK,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBpG,CAAC,EAAE;EACzB,IAAA,OAAO,IAAI,CAACqG,WAAW,CAACrG,CAAC,CAAC,CAAA;EAC5B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA+F,EAAAA,QAAA,CAQOM,WAAW,GAAlB,SAAAA,WAAAA,CAAmBJ,IAAI,EAAE;MACvB,IAAI,CAACA,IAAI,EAAE;EACT,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MACA,IAAI;EACF,MAAA,IAAIxC,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;EAAEE,QAAAA,QAAQ,EAAEqC,IAAAA;EAAK,OAAC,CAAC,CAACzD,MAAM,EAAE,CAAA;EAC7D,MAAA,OAAO,IAAI,CAAA;OACZ,CAAC,OAAO8D,CAAC,EAAE;EACV,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;KACD,CAAA;IAED,SAAAP,QAAAA,CAAYhD,IAAI,EAAE;EAAA,IAAA,IAAAwD,KAAA,CAAA;EAChBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKvC,QAAQ,GAAGjB,IAAI,CAAA;EACpB;MACAwD,KAAA,CAAKC,KAAK,GAAGT,QAAQ,CAACM,WAAW,CAACtD,IAAI,CAAC,CAAA;EAAC,IAAA,OAAAwD,KAAA,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,EAAA,IAAArE,MAAA,GAAA6D,QAAA,CAAA5D,SAAA,CAAA;EA4BA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IARED,MAAA,CASAE,UAAU,GAAV,SAAAA,WAAWC,EAAE,EAAAc,IAAA,EAAsB;EAAA,IAAA,IAAlBX,MAAM,GAAAW,IAAA,CAANX,MAAM;QAAEY,MAAM,GAAAD,IAAA,CAANC,MAAM,CAAA;MAC7B,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,EAAE,IAAI,CAACL,IAAI,CAAC,CAAA;EACrD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;MACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAN,EAAAA,MAAA,CAMAO,MAAM,GAAN,SAAAA,MAAAA,CAAOJ,EAAE,EAAE;EACT,IAAA,IAAI,CAAC,IAAI,CAACmE,KAAK,EAAE,OAAOC,GAAG,CAAA;EAC3B,IAAA,IAAMjC,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC,CAAA;EAEzB,IAAA,IAAIqE,KAAK,CAAClC,IAAI,CAAC,EAAE,OAAOiC,GAAG,CAAA;EAE3B,IAAA,IAAMxC,GAAG,GAAGF,OAAO,CAAC,IAAI,CAAChB,IAAI,CAAC,CAAA;EAC9B,IAAA,IAAA4D,KAAA,GAAuD1C,GAAG,CAACoB,aAAa,GACpED,WAAW,CAACnB,GAAG,EAAEO,IAAI,CAAC,GACtBD,WAAW,CAACN,GAAG,EAAEO,IAAI,CAAC;EAFrBrE,MAAAA,IAAI,GAAAwG,KAAA,CAAA,CAAA,CAAA;EAAEvG,MAAAA,KAAK,GAAAuG,KAAA,CAAA,CAAA,CAAA;EAAEtG,MAAAA,GAAG,GAAAsG,KAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,MAAM,GAAAD,KAAA,CAAA,CAAA,CAAA;EAAE/F,MAAAA,IAAI,GAAA+F,KAAA,CAAA,CAAA,CAAA;EAAE9F,MAAAA,MAAM,GAAA8F,KAAA,CAAA,CAAA,CAAA;EAAE5F,MAAAA,MAAM,GAAA4F,KAAA,CAAA,CAAA,CAAA,CAAA;MAInD,IAAIC,MAAM,KAAK,IAAI,EAAE;QACnBzG,IAAI,GAAG,CAAC0G,IAAI,CAACC,GAAG,CAAC3G,IAAI,CAAC,GAAG,CAAC,CAAA;EAC5B,KAAA;;EAEA;MACA,IAAM4G,YAAY,GAAGnG,IAAI,KAAK,EAAE,GAAG,CAAC,GAAGA,IAAI,CAAA;MAE3C,IAAMoG,KAAK,GAAGC,YAAY,CAAC;EACzB9G,MAAAA,IAAI,EAAJA,IAAI;EACJC,MAAAA,KAAK,EAALA,KAAK;EACLC,MAAAA,GAAG,EAAHA,GAAG;EACHO,MAAAA,IAAI,EAAEmG,YAAY;EAClBlG,MAAAA,MAAM,EAANA,MAAM;EACNE,MAAAA,MAAM,EAANA,MAAM;EACNmG,MAAAA,WAAW,EAAE,CAAA;EACf,KAAC,CAAC,CAAA;MAEF,IAAIC,IAAI,GAAG,CAAC3C,IAAI,CAAA;EAChB,IAAA,IAAM4C,IAAI,GAAGD,IAAI,GAAG,IAAI,CAAA;MACxBA,IAAI,IAAIC,IAAI,IAAI,CAAC,GAAGA,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;MACtC,OAAO,CAACJ,KAAK,GAAGG,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAjF,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,MAAM,IAAIb,SAAS,CAACI,IAAI,KAAK,IAAI,CAACA,IAAI,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAH,EAAAA,YAAA,CAAAmD,QAAA,EAAA,CAAA;MAAAlD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAlGA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,MAAM,CAAA;EACf,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;EACtB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAnB,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAkFD,SAAAA,GAAAA,GAAc;QACZ,OAAO,IAAI,CAAC0D,KAAK,CAAA;EACnB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAT,QAAA,CAAA;EAAA,CAAA,CA5KmC9D,IAAI;;;;;ECvD1C;;EAEA,IAAIoF,WAAW,GAAG,EAAE,CAAA;EACpB,SAASC,WAAWA,CAACC,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACvC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAI2B,GAAG,GAAGoD,WAAW,CAACxE,GAAG,CAAC,CAAA;IAC1B,IAAI,CAACoB,GAAG,EAAE;MACRA,GAAG,GAAG,IAAIR,IAAI,CAACiE,UAAU,CAACH,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC1C+E,IAAAA,WAAW,CAACxE,GAAG,CAAC,GAAGoB,GAAG,CAAA;EACxB,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAM0D,WAAW,GAAG,IAAI7D,GAAG,EAAE,CAAA;EAC7B,SAAS8D,YAAYA,CAACL,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAI2B,GAAG,GAAG0D,WAAW,CAAC7E,GAAG,CAACD,GAAG,CAAC,CAAA;IAC9B,IAAIoB,GAAG,KAAKC,SAAS,EAAE;MACrBD,GAAG,GAAG,IAAIR,IAAI,CAACC,cAAc,CAAC6D,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC9CqF,IAAAA,WAAW,CAACtD,GAAG,CAACxB,GAAG,EAAEoB,GAAG,CAAC,CAAA;EAC3B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAM4D,YAAY,GAAG,IAAI/D,GAAG,EAAE,CAAA;EAC9B,SAASgE,YAAYA,CAACP,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC,IAAMO,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEjF,IAAI,CAAC,CAAC,CAAA;EAC7C,EAAA,IAAIyF,GAAG,GAAGF,YAAY,CAAC/E,GAAG,CAACD,GAAG,CAAC,CAAA;IAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;MACrB6D,GAAG,GAAG,IAAItE,IAAI,CAACuE,YAAY,CAACT,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC5CuF,IAAAA,YAAY,CAACxD,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAME,YAAY,GAAG,IAAInE,GAAG,EAAE,CAAA;EAC9B,SAASoE,YAAYA,CAACX,SAAS,EAAEjF,IAAI,EAAO;EAAA,EAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,GAAA;IACxC6F,IAAAA,KAAA,GAAkC7F,IAAI,CAAA;MAA1B6F,KAAA,CAAJC,IAAI,CAAA;EAAKC,QAAAA,YAAY,GAAAC,6BAAA,CAAAH,KAAA,EAAAI,SAAA,EAAU;IACvC,IAAM1F,GAAG,GAAG2E,IAAI,CAACC,SAAS,CAAC,CAACF,SAAS,EAAEc,YAAY,CAAC,CAAC,CAAA;EACrD,EAAA,IAAIN,GAAG,GAAGE,YAAY,CAACnF,GAAG,CAACD,GAAG,CAAC,CAAA;IAC/B,IAAIkF,GAAG,KAAK7D,SAAS,EAAE;MACrB6D,GAAG,GAAG,IAAItE,IAAI,CAAC+E,kBAAkB,CAACjB,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAClD2F,IAAAA,YAAY,CAAC5D,GAAG,CAACxB,GAAG,EAAEkF,GAAG,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAOA,GAAG,CAAA;EACZ,CAAA;EAEA,IAAIU,cAAc,GAAG,IAAI,CAAA;EACzB,SAASC,YAAYA,GAAG;EACtB,EAAA,IAAID,cAAc,EAAE;EAClB,IAAA,OAAOA,cAAc,CAAA;EACvB,GAAC,MAAM;EACLA,IAAAA,cAAc,GAAG,IAAIhF,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACP,MAAM,CAAA;EACnE,IAAA,OAAOqF,cAAc,CAAA;EACvB,GAAA;EACF,CAAA;EAEA,IAAME,wBAAwB,GAAG,IAAI7E,GAAG,EAAE,CAAA;EAC1C,SAAS8E,2BAA2BA,CAACrB,SAAS,EAAE;EAC9C,EAAA,IAAIjF,IAAI,GAAGqG,wBAAwB,CAAC7F,GAAG,CAACyE,SAAS,CAAC,CAAA;IAClD,IAAIjF,IAAI,KAAK4B,SAAS,EAAE;MACtB5B,IAAI,GAAG,IAAImB,IAAI,CAACC,cAAc,CAAC6D,SAAS,CAAC,CAAC5D,eAAe,EAAE,CAAA;EAC3DgF,IAAAA,wBAAwB,CAACtE,GAAG,CAACkD,SAAS,EAAEjF,IAAI,CAAC,CAAA;EAC/C,GAAA;EACA,EAAA,OAAOA,IAAI,CAAA;EACb,CAAA;EAEA,IAAMuG,aAAa,GAAG,IAAI/E,GAAG,EAAE,CAAA;EAC/B,SAASgF,iBAAiBA,CAACvB,SAAS,EAAE;EACpC,EAAA,IAAIwB,IAAI,GAAGF,aAAa,CAAC/F,GAAG,CAACyE,SAAS,CAAC,CAAA;IACvC,IAAI,CAACwB,IAAI,EAAE;MACT,IAAM3F,MAAM,GAAG,IAAIK,IAAI,CAACuF,MAAM,CAACzB,SAAS,CAAC,CAAA;EACzC;EACAwB,IAAAA,IAAI,GAAG,aAAa,IAAI3F,MAAM,GAAGA,MAAM,CAAC6F,WAAW,EAAE,GAAG7F,MAAM,CAAC8F,QAAQ,CAAA;EACvE;EACA,IAAA,IAAI,EAAE,aAAa,IAAIH,IAAI,CAAC,EAAE;EAC5BA,MAAAA,IAAI,GAAAI,QAAA,CAAA,EAAA,EAAQC,oBAAoB,EAAKL,IAAI,CAAE,CAAA;EAC7C,KAAA;EACAF,IAAAA,aAAa,CAACxE,GAAG,CAACkD,SAAS,EAAEwB,IAAI,CAAC,CAAA;EACpC,GAAA;EACA,EAAA,OAAOA,IAAI,CAAA;EACb,CAAA;EAEA,SAASM,iBAAiBA,CAACC,SAAS,EAAE;EACpC;EACA;EACA;;EAEA;EACA;EACA;;EAEA;EACA;EACA;EACA,EAAA,IAAMC,MAAM,GAAGD,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;EACvC,EAAA,IAAID,MAAM,KAAK,CAAC,CAAC,EAAE;MACjBD,SAAS,GAAGA,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEF,MAAM,CAAC,CAAA;EAC5C,GAAA;EAEA,EAAA,IAAMG,MAAM,GAAGJ,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;EACvC,EAAA,IAAIE,MAAM,KAAK,CAAC,CAAC,EAAE;MACjB,OAAO,CAACJ,SAAS,CAAC,CAAA;EACpB,GAAC,MAAM;EACL,IAAA,IAAIK,OAAO,CAAA;EACX,IAAA,IAAIC,WAAW,CAAA;MACf,IAAI;QACFD,OAAO,GAAG/B,YAAY,CAAC0B,SAAS,CAAC,CAAC3F,eAAe,EAAE,CAAA;EACnDiG,MAAAA,WAAW,GAAGN,SAAS,CAAA;OACxB,CAAC,OAAOhD,CAAC,EAAE;QACV,IAAMuD,OAAO,GAAGP,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEC,MAAM,CAAC,CAAA;QAC9CC,OAAO,GAAG/B,YAAY,CAACiC,OAAO,CAAC,CAAClG,eAAe,EAAE,CAAA;EACjDiG,MAAAA,WAAW,GAAGC,OAAO,CAAA;EACvB,KAAA;MAEA,IAAAC,QAAA,GAAsCH,OAAO;QAArCI,eAAe,GAAAD,QAAA,CAAfC,eAAe;QAAEC,QAAQ,GAAAF,QAAA,CAARE,QAAQ,CAAA;EACjC,IAAA,OAAO,CAACJ,WAAW,EAAEG,eAAe,EAAEC,QAAQ,CAAC,CAAA;EACjD,GAAA;EACF,CAAA;EAEA,SAASC,gBAAgBA,CAACX,SAAS,EAAES,eAAe,EAAEG,cAAc,EAAE;IACpE,IAAIA,cAAc,IAAIH,eAAe,EAAE;EACrC,IAAA,IAAI,CAACT,SAAS,CAACa,QAAQ,CAAC,KAAK,CAAC,EAAE;EAC9Bb,MAAAA,SAAS,IAAI,IAAI,CAAA;EACnB,KAAA;EAEA,IAAA,IAAIY,cAAc,EAAE;EAClBZ,MAAAA,SAAS,aAAWY,cAAgB,CAAA;EACtC,KAAA;EAEA,IAAA,IAAIH,eAAe,EAAE;EACnBT,MAAAA,SAAS,aAAWS,eAAiB,CAAA;EACvC,KAAA;EACA,IAAA,OAAOT,SAAS,CAAA;EAClB,GAAC,MAAM;EACL,IAAA,OAAOA,SAAS,CAAA;EAClB,GAAA;EACF,CAAA;EAEA,SAASc,SAASA,CAACC,CAAC,EAAE;IACpB,IAAMC,EAAE,GAAG,EAAE,CAAA;IACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,EAAE,EAAEA,CAAC,EAAE,EAAE;MAC5B,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAElF,CAAC,EAAE,CAAC,CAAC,CAAA;EACnC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;EAChB,GAAA;EACA,EAAA,OAAOD,EAAE,CAAA;EACX,CAAA;EAEA,SAASK,WAAWA,CAACN,CAAC,EAAE;IACtB,IAAMC,EAAE,GAAG,EAAE,CAAA;IACb,KAAK,IAAI/E,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;EAC3B,IAAA,IAAMgF,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAGlF,CAAC,CAAC,CAAA;EACzC+E,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;EAChB,GAAA;EACA,EAAA,OAAOD,EAAE,CAAA;EACX,CAAA;EAEA,SAASM,SAASA,CAACC,GAAG,EAAErF,MAAM,EAAEsF,SAAS,EAAEC,MAAM,EAAE;EACjD,EAAA,IAAMC,IAAI,GAAGH,GAAG,CAACI,WAAW,EAAE,CAAA;IAE9B,IAAID,IAAI,KAAK,OAAO,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM,IAAIA,IAAI,KAAK,IAAI,EAAE;MACxB,OAAOF,SAAS,CAACtF,MAAM,CAAC,CAAA;EAC1B,GAAC,MAAM;MACL,OAAOuF,MAAM,CAACvF,MAAM,CAAC,CAAA;EACvB,GAAA;EACF,CAAA;EAEA,SAAS0F,mBAAmBA,CAACL,GAAG,EAAE;IAChC,IAAIA,GAAG,CAACd,eAAe,IAAIc,GAAG,CAACd,eAAe,KAAK,MAAM,EAAE;EACzD,IAAA,OAAO,KAAK,CAAA;EACd,GAAC,MAAM;EACL,IAAA,OACEc,GAAG,CAACd,eAAe,KAAK,MAAM,IAC9B,CAACc,GAAG,CAACzH,MAAM,IACXyH,GAAG,CAACzH,MAAM,CAAC+H,UAAU,CAAC,IAAI,CAAC,IAC3BvC,2BAA2B,CAACiC,GAAG,CAACzH,MAAM,CAAC,CAAC2G,eAAe,KAAK,MAAM,CAAA;EAEtE,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EAFA,IAIMqB,mBAAmB,gBAAA,YAAA;EACvB,EAAA,SAAAA,oBAAYC,IAAI,EAAEC,WAAW,EAAEhJ,IAAI,EAAE;EACnC,IAAA,IAAI,CAACiJ,KAAK,GAAGjJ,IAAI,CAACiJ,KAAK,IAAI,CAAC,CAAA;EAC5B,IAAA,IAAI,CAACC,KAAK,GAAGlJ,IAAI,CAACkJ,KAAK,IAAI,KAAK,CAAA;EAEhC,IAAuClJ,IAAI,CAAnCiJ,KAAK,CAAA;QAA0BjJ,IAAI,CAA5BkJ,KAAK,CAAA;EAAKC,UAAAA,SAAS,GAAAnD,6BAAA,CAAKhG,IAAI,EAAAoJ,UAAA,EAAA;EAE3C,IAAA,IAAI,CAACJ,WAAW,IAAIK,MAAM,CAACC,IAAI,CAACH,SAAS,CAAC,CAACjG,MAAM,GAAG,CAAC,EAAE;QACrD,IAAMqG,QAAQ,GAAA1C,QAAA,CAAA;EAAK2C,QAAAA,WAAW,EAAE,KAAA;EAAK,OAAA,EAAKxJ,IAAI,CAAE,CAAA;EAChD,MAAA,IAAIA,IAAI,CAACiJ,KAAK,GAAG,CAAC,EAAEM,QAAQ,CAACE,oBAAoB,GAAGzJ,IAAI,CAACiJ,KAAK,CAAA;QAC9D,IAAI,CAACxD,GAAG,GAAGD,YAAY,CAACuD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;EAAC,EAAA,IAAA3J,MAAA,GAAAkJ,mBAAA,CAAAjJ,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDM,MAAM,GAAN,SAAAA,MAAAA,CAAO+C,CAAC,EAAE;MACR,IAAI,IAAI,CAACwC,GAAG,EAAE;EACZ,MAAA,IAAMiE,KAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAGA,CAAC,CAAA;EAC5C,MAAA,OAAO,IAAI,CAACwC,GAAG,CAACvF,MAAM,CAACwJ,KAAK,CAAC,CAAA;EAC/B,KAAC,MAAM;EACL;EACA,MAAA,IAAMA,MAAK,GAAG,IAAI,CAACR,KAAK,GAAG3E,IAAI,CAAC2E,KAAK,CAACjG,CAAC,CAAC,GAAG0G,OAAO,CAAC1G,CAAC,EAAE,CAAC,CAAC,CAAA;EACxD,MAAA,OAAO2G,QAAQ,CAACF,MAAK,EAAE,IAAI,CAACT,KAAK,CAAC,CAAA;EACpC,KAAA;KACD,CAAA;EAAA,EAAA,OAAAH,mBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH;EACA;EACA;EAFA,IAIMe,iBAAiB,gBAAA,YAAA;EACrB,EAAA,SAAAA,kBAAY5B,EAAE,EAAEc,IAAI,EAAE/I,IAAI,EAAE;MAC1B,IAAI,CAACA,IAAI,GAAGA,IAAI,CAAA;MAChB,IAAI,CAAC8J,YAAY,GAAGlI,SAAS,CAAA;MAE7B,IAAImI,CAAC,GAAGnI,SAAS,CAAA;EACjB,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACsB,QAAQ,EAAE;EACtB;QACA,IAAI,CAAC2G,EAAE,GAAGA,EAAE,CAAA;OACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,OAAO,EAAE;EACnC;EACA;EACA;EACA;EACA;EACA;QACA,IAAM8I,SAAS,GAAG,CAAC,CAAC,IAAI/B,EAAE,CAAC9H,MAAM,GAAG,EAAE,CAAC,CAAA;QACvC,IAAM8J,OAAO,GAAGD,SAAS,IAAI,CAAC,GAAcA,UAAAA,GAAAA,SAAS,eAAeA,SAAW,CAAA;EAC/E,MAAA,IAAI/B,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIsD,QAAQ,CAACC,MAAM,CAACuG,OAAO,CAAC,CAAC/F,KAAK,EAAE;EACrD6F,QAAAA,CAAC,GAAGE,OAAO,CAAA;UACX,IAAI,CAAChC,EAAE,GAAGA,EAAE,CAAA;EACd,OAAC,MAAM;EACL;EACA;EACA8B,QAAAA,CAAC,GAAG,KAAK,CAAA;EACT,QAAA,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAAC9H,MAAM,KAAK,CAAC,GAAG8H,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;YAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;EAAO,SAAC,CAAC,CAAA;EAC/E,QAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;EAC7B,OAAA;OACD,MAAM,IAAIsE,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,QAAQ,EAAE;QACpC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;OACb,MAAM,IAAIA,EAAE,CAACtE,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;QAClC,IAAI,CAAC+G,EAAE,GAAGA,EAAE,CAAA;EACZ8B,MAAAA,CAAC,GAAG9B,EAAE,CAACtE,IAAI,CAAClD,IAAI,CAAA;EAClB,KAAC,MAAM;EACL;EACA;EACAsJ,MAAAA,CAAC,GAAG,KAAK,CAAA;QACT,IAAI,CAAC9B,EAAE,GAAGA,EAAE,CAACiC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;UAAEC,OAAO,EAAEnC,EAAE,CAAC9H,MAAAA;EAAO,OAAC,CAAC,CAAA;EACxD,MAAA,IAAI,CAAC2J,YAAY,GAAG7B,EAAE,CAACtE,IAAI,CAAA;EAC7B,KAAA;EAEA,IAAA,IAAM4F,QAAQ,GAAA1C,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;EACjCuJ,IAAAA,QAAQ,CAACjI,QAAQ,GAAGiI,QAAQ,CAACjI,QAAQ,IAAIyI,CAAC,CAAA;MAC1C,IAAI,CAACpI,GAAG,GAAG2D,YAAY,CAACyD,IAAI,EAAEQ,QAAQ,CAAC,CAAA;EACzC,GAAA;EAAC,EAAA,IAAAc,OAAA,GAAAR,iBAAA,CAAAhK,SAAA,CAAA;EAAAwK,EAAAA,OAAA,CAEDnK,MAAM,GAAN,SAAAA,SAAS;MACP,IAAI,IAAI,CAAC4J,YAAY,EAAE;EACrB;EACA;QACA,OAAO,IAAI,CAAC/G,aAAa,EAAE,CACxBuH,GAAG,CAAC,UAAAzJ,IAAA,EAAA;EAAA,QAAA,IAAGuC,KAAK,GAAAvC,IAAA,CAALuC,KAAK,CAAA;EAAA,QAAA,OAAOA,KAAK,CAAA;EAAA,OAAA,CAAC,CACzBmH,IAAI,CAAC,EAAE,CAAC,CAAA;EACb,KAAA;EACA,IAAA,OAAO,IAAI,CAAC5I,GAAG,CAACzB,MAAM,CAAC,IAAI,CAAC+H,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;KAC3C,CAAA;EAAAH,EAAAA,OAAA,CAEDtH,aAAa,GAAb,SAAAA,gBAAgB;EAAA,IAAA,IAAAkB,KAAA,GAAA,IAAA,CAAA;EACd,IAAA,IAAMwG,KAAK,GAAG,IAAI,CAAC9I,GAAG,CAACoB,aAAa,CAAC,IAAI,CAACkF,EAAE,CAACuC,QAAQ,EAAE,CAAC,CAAA;MACxD,IAAI,IAAI,CAACV,YAAY,EAAE;EACrB,MAAA,OAAOW,KAAK,CAACH,GAAG,CAAC,UAACI,IAAI,EAAK;EACzB,QAAA,IAAIA,IAAI,CAACxJ,IAAI,KAAK,cAAc,EAAE;EAChC,UAAA,IAAMpB,UAAU,GAAGmE,KAAI,CAAC6F,YAAY,CAAChK,UAAU,CAACmE,KAAI,CAACgE,EAAE,CAAClI,EAAE,EAAE;EAC1De,YAAAA,MAAM,EAAEmD,KAAI,CAACgE,EAAE,CAACnH,MAAM;EACtBZ,YAAAA,MAAM,EAAE+D,KAAI,CAACjE,IAAI,CAACrB,YAAAA;EACpB,WAAC,CAAC,CAAA;YACF,OAAAkI,QAAA,KACK6D,IAAI,EAAA;EACPtH,YAAAA,KAAK,EAAEtD,UAAAA;EAAU,WAAA,CAAA,CAAA;EAErB,SAAC,MAAM;EACL,UAAA,OAAO4K,IAAI,CAAA;EACb,SAAA;EACF,OAAC,CAAC,CAAA;EACJ,KAAA;EACA,IAAA,OAAOD,KAAK,CAAA;KACb,CAAA;EAAAJ,EAAAA,OAAA,CAEDhJ,eAAe,GAAf,SAAAA,kBAAkB;EAChB,IAAA,OAAO,IAAI,CAACM,GAAG,CAACN,eAAe,EAAE,CAAA;KAClC,CAAA;EAAA,EAAA,OAAAwI,iBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH;EACA;EACA;EAFA,IAGMc,gBAAgB,gBAAA,YAAA;EACpB,EAAA,SAAAA,iBAAY5B,IAAI,EAAE6B,SAAS,EAAE5K,IAAI,EAAE;MACjC,IAAI,CAACA,IAAI,GAAA6G,QAAA,CAAA;EAAKgE,MAAAA,KAAK,EAAE,MAAA;EAAM,KAAA,EAAK7K,IAAI,CAAE,CAAA;EACtC,IAAA,IAAI,CAAC4K,SAAS,IAAIE,WAAW,EAAE,EAAE;QAC/B,IAAI,CAACC,GAAG,GAAGnF,YAAY,CAACmD,IAAI,EAAE/I,IAAI,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;EAAC,EAAA,IAAAgL,OAAA,GAAAL,gBAAA,CAAA9K,SAAA,CAAA;IAAAmL,OAAA,CAED9K,MAAM,GAAN,SAAAA,OAAO+K,KAAK,EAAE7N,IAAI,EAAE;MAClB,IAAI,IAAI,CAAC2N,GAAG,EAAE;QACZ,OAAO,IAAI,CAACA,GAAG,CAAC7K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;EACrC,KAAC,MAAM;QACL,OAAO8N,kBAA0B,CAAC9N,IAAI,EAAE6N,KAAK,EAAE,IAAI,CAACjL,IAAI,CAACmL,OAAO,EAAE,IAAI,CAACnL,IAAI,CAAC6K,KAAK,KAAK,MAAM,CAAC,CAAA;EAC/F,KAAA;KACD,CAAA;IAAAG,OAAA,CAEDjI,aAAa,GAAb,SAAAA,cAAckI,KAAK,EAAE7N,IAAI,EAAE;MACzB,IAAI,IAAI,CAAC2N,GAAG,EAAE;QACZ,OAAO,IAAI,CAACA,GAAG,CAAChI,aAAa,CAACkI,KAAK,EAAE7N,IAAI,CAAC,CAAA;EAC5C,KAAC,MAAM;EACL,MAAA,OAAO,EAAE,CAAA;EACX,KAAA;KACD,CAAA;EAAA,EAAA,OAAAuN,gBAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGH,IAAM7D,oBAAoB,GAAG;EAC3BsE,EAAAA,QAAQ,EAAE,CAAC;EACXC,EAAAA,WAAW,EAAE,CAAC;EACdC,EAAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;EAChB,CAAC,CAAA;;EAED;EACA;EACA;EAFA,IAGqB5E,MAAM,gBAAA,YAAA;EAAAA,EAAAA,MAAA,CAClB6E,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvL,IAAI,EAAE;MACpB,OAAO0G,MAAM,CAAChD,MAAM,CAClB1D,IAAI,CAACc,MAAM,EACXd,IAAI,CAACyH,eAAe,EACpBzH,IAAI,CAAC4H,cAAc,EACnB5H,IAAI,CAACwL,YAAY,EACjBxL,IAAI,CAACyL,WACP,CAAC,CAAA;KACF,CAAA;EAAA/E,EAAAA,MAAA,CAEMhD,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,EAAEC,WAAW,EAAU;EAAA,IAAA,IAArBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,KAAK,CAAA;EAAA,KAAA;EACtF,IAAA,IAAMC,eAAe,GAAG5K,MAAM,IAAI6K,QAAQ,CAACC,aAAa,CAAA;EACxD;MACA,IAAMC,OAAO,GAAGH,eAAe,KAAKD,WAAW,GAAG,OAAO,GAAGrF,YAAY,EAAE,CAAC,CAAA;EAC3E,IAAA,IAAM0F,gBAAgB,GAAGrE,eAAe,IAAIkE,QAAQ,CAACI,sBAAsB,CAAA;EAC3E,IAAA,IAAMC,eAAe,GAAGpE,cAAc,IAAI+D,QAAQ,CAACM,qBAAqB,CAAA;MACxE,IAAMC,aAAa,GAAGC,oBAAoB,CAACX,YAAY,CAAC,IAAIG,QAAQ,CAACS,mBAAmB,CAAA;EACxF,IAAA,OAAO,IAAI1F,MAAM,CAACmF,OAAO,EAAEC,gBAAgB,EAAEE,eAAe,EAAEE,aAAa,EAAER,eAAe,CAAC,CAAA;KAC9F,CAAA;EAAAhF,EAAAA,MAAA,CAEM9C,UAAU,GAAjB,SAAAA,aAAoB;EAClBuC,IAAAA,cAAc,GAAG,IAAI,CAAA;MACrBd,WAAW,CAACxB,KAAK,EAAE,CAAA;MACnB0B,YAAY,CAAC1B,KAAK,EAAE,CAAA;MACpB8B,YAAY,CAAC9B,KAAK,EAAE,CAAA;MACpBwC,wBAAwB,CAACxC,KAAK,EAAE,CAAA;MAChC0C,aAAa,CAAC1C,KAAK,EAAE,CAAA;KACtB,CAAA;EAAA6C,EAAAA,MAAA,CAEM2F,UAAU,GAAjB,SAAAA,UAAAA,CAAAC,KAAA,EAAkF;EAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAA5DxL,MAAM,GAAAuD,KAAA,CAANvD,MAAM;QAAE2G,eAAe,GAAApD,KAAA,CAAfoD,eAAe;QAAEG,cAAc,GAAAvD,KAAA,CAAduD,cAAc;QAAE4D,YAAY,GAAAnH,KAAA,CAAZmH,YAAY,CAAA;MACvE,OAAO9E,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,EAAE4D,YAAY,CAAC,CAAA;KAC5E,CAAA;IAED,SAAA9E,MAAAA,CAAY5F,MAAM,EAAEyL,SAAS,EAAE3E,cAAc,EAAE4D,YAAY,EAAEE,eAAe,EAAE;EAC5E,IAAA,IAAAc,kBAAA,GAAoEzF,iBAAiB,CAACjG,MAAM,CAAC;EAAtF2L,MAAAA,YAAY,GAAAD,kBAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,qBAAqB,GAAAF,kBAAA,CAAA,CAAA,CAAA;EAAEG,MAAAA,oBAAoB,GAAAH,kBAAA,CAAA,CAAA,CAAA,CAAA;MAEhE,IAAI,CAAC1L,MAAM,GAAG2L,YAAY,CAAA;EAC1B,IAAA,IAAI,CAAChF,eAAe,GAAG8E,SAAS,IAAIG,qBAAqB,IAAI,IAAI,CAAA;EACjE,IAAA,IAAI,CAAC9E,cAAc,GAAGA,cAAc,IAAI+E,oBAAoB,IAAI,IAAI,CAAA;MACpE,IAAI,CAACnB,YAAY,GAAGA,YAAY,CAAA;EAChC,IAAA,IAAI,CAACzC,IAAI,GAAGpB,gBAAgB,CAAC,IAAI,CAAC7G,MAAM,EAAE,IAAI,CAAC2G,eAAe,EAAE,IAAI,CAACG,cAAc,CAAC,CAAA;MAEpF,IAAI,CAACgF,aAAa,GAAG;QAAE1M,MAAM,EAAE,EAAE;EAAE2M,MAAAA,UAAU,EAAE,EAAC;OAAG,CAAA;MACnD,IAAI,CAACC,WAAW,GAAG;QAAE5M,MAAM,EAAE,EAAE;EAAE2M,MAAAA,UAAU,EAAE,EAAC;OAAG,CAAA;MACjD,IAAI,CAACE,aAAa,GAAG,IAAI,CAAA;EACzB,IAAA,IAAI,CAACC,QAAQ,GAAG,EAAE,CAAA;MAElB,IAAI,CAACtB,eAAe,GAAGA,eAAe,CAAA;MACtC,IAAI,CAACuB,iBAAiB,GAAG,IAAI,CAAA;EAC/B,GAAA;EAAC,EAAA,IAAAC,OAAA,GAAAxG,MAAA,CAAA7G,SAAA,CAAA;EAAAqN,EAAAA,OAAA,CAUDvE,WAAW,GAAX,SAAAA,cAAc;EACZ,IAAA,IAAMwE,YAAY,GAAG,IAAI,CAACvC,SAAS,EAAE,CAAA;MACrC,IAAMwC,cAAc,GAClB,CAAC,IAAI,CAAC3F,eAAe,KAAK,IAAI,IAAI,IAAI,CAACA,eAAe,KAAK,MAAM,MAChE,IAAI,CAACG,cAAc,KAAK,IAAI,IAAI,IAAI,CAACA,cAAc,KAAK,SAAS,CAAC,CAAA;EACrE,IAAA,OAAOuF,YAAY,IAAIC,cAAc,GAAG,IAAI,GAAG,MAAM,CAAA;KACtD,CAAA;EAAAF,EAAAA,OAAA,CAEDG,KAAK,GAAL,SAAAA,KAAAA,CAAMC,IAAI,EAAE;EACV,IAAA,IAAI,CAACA,IAAI,IAAIjE,MAAM,CAACkE,mBAAmB,CAACD,IAAI,CAAC,CAACpK,MAAM,KAAK,CAAC,EAAE;EAC1D,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM;QACL,OAAOwD,MAAM,CAAChD,MAAM,CAClB4J,IAAI,CAACxM,MAAM,IAAI,IAAI,CAAC4K,eAAe,EACnC4B,IAAI,CAAC7F,eAAe,IAAI,IAAI,CAACA,eAAe,EAC5C6F,IAAI,CAAC1F,cAAc,IAAI,IAAI,CAACA,cAAc,EAC1CuE,oBAAoB,CAACmB,IAAI,CAAC9B,YAAY,CAAC,IAAI,IAAI,CAACA,YAAY,EAC5D8B,IAAI,CAAC7B,WAAW,IAAI,KACtB,CAAC,CAAA;EACH,KAAA;KACD,CAAA;EAAAyB,EAAAA,OAAA,CAEDM,aAAa,GAAb,SAAAA,aAAAA,CAAcF,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;EAAE7B,MAAAA,WAAW,EAAE,IAAA;EAAI,KAAA,CAAE,CAAC,CAAA;KAClD,CAAA;EAAAyB,EAAAA,OAAA,CAEDO,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBH,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACzB,IAAA,OAAO,IAAI,CAACD,KAAK,CAAAxG,QAAA,KAAMyG,IAAI,EAAA;EAAE7B,MAAAA,WAAW,EAAE,KAAA;EAAK,KAAA,CAAE,CAAC,CAAA;KACnD,CAAA;IAAAyB,OAAA,CAEDQ,MAAM,GAAN,SAAAA,SAAOxK,MAAM,EAAEhD,MAAM,EAAU;EAAA,IAAA,IAAAyN,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAhBzN,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,KAAA;MAC3B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,MAAc,EAAE,YAAM;EACnD;EACA;EACA;EACA,MAAA,IAAM0C,gBAAgB,GAAGD,MAAI,CAAC5E,IAAI,KAAK,IAAI,IAAI4E,MAAI,CAAC5E,IAAI,CAACF,UAAU,CAAC,KAAK,CAAC,CAAA;QAC1E3I,MAAM,IAAI,CAAC0N,gBAAgB,CAAA;QAC3B,IAAM7E,IAAI,GAAG7I,MAAM,GAAG;EAAEpC,UAAAA,KAAK,EAAEoF,MAAM;EAAEnF,UAAAA,GAAG,EAAE,SAAA;EAAU,SAAC,GAAG;EAAED,UAAAA,KAAK,EAAEoF,MAAAA;WAAQ;EACzE2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;QAC9C,IAAI,CAACyN,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;EACxC,QAAA,IAAM4K,MAAM,GAAG,CAACF,gBAAgB,GAC5B,UAAC3F,EAAE,EAAA;YAAA,OAAK0F,MAAI,CAACI,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,OAAO,CAAC,CAAA;EAAA,SAAA,GACvC,UAACd,EAAE,EAAA;YAAA,OAAK0F,MAAI,CAACK,WAAW,CAAC/F,EAAE,EAAEc,IAAI,CAAC,CAAC7I,MAAM,EAAE,CAAA;EAAA,SAAA,CAAA;EAC/CyN,QAAAA,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAG4E,SAAS,CAACgG,MAAM,CAAC,CAAA;EACzD,OAAA;QACA,OAAOH,MAAI,CAACb,WAAW,CAACe,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;EAC5C,KAAC,CAAC,CAAA;KACH,CAAA;IAAAgK,OAAA,CAEDe,QAAQ,GAAR,SAAAA,WAAS/K,MAAM,EAAEhD,MAAM,EAAU;EAAA,IAAA,IAAAgO,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAhBhO,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,KAAA;MAC7B,OAAOoI,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,QAAgB,EAAE,YAAM;QACrD,IAAMnC,IAAI,GAAG7I,MAAM,GACb;EAAEhC,UAAAA,OAAO,EAAEgF,MAAM;EAAErF,UAAAA,IAAI,EAAE,SAAS;EAAEC,UAAAA,KAAK,EAAE,MAAM;EAAEC,UAAAA,GAAG,EAAE,SAAA;EAAU,SAAC,GACnE;EAAEG,UAAAA,OAAO,EAAEgF,MAAAA;WAAQ;EACvB2K,QAAAA,SAAS,GAAG3N,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;QAC9C,IAAI,CAACgO,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,EAAE;EAC1CgL,QAAAA,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,GAAGmF,WAAW,CAAC,UAACJ,EAAE,EAAA;YAAA,OACrDiG,MAAI,CAACH,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,SAAS,CAAC,CAAA;EAAA,SACnC,CAAC,CAAA;EACH,OAAA;QACA,OAAOmF,MAAI,CAACtB,aAAa,CAACiB,SAAS,CAAC,CAAC3K,MAAM,CAAC,CAAA;EAC9C,KAAC,CAAC,CAAA;KACH,CAAA;EAAAgK,EAAAA,OAAA,CAEDiB,SAAS,GAAT,SAAAA,cAAY;EAAA,IAAA,IAAAC,MAAA,GAAA,IAAA,CAAA;EACV,IAAA,OAAO9F,SAAS,CACd,IAAI,EACJ1G,SAAS,EACT,YAAA;QAAA,OAAMsJ,SAAiB,CAAA;EAAA,KAAA,EACvB,YAAM;EACJ;EACA;EACA,MAAA,IAAI,CAACkD,MAAI,CAACrB,aAAa,EAAE;EACvB,QAAA,IAAMhE,IAAI,GAAG;EAAEzK,UAAAA,IAAI,EAAE,SAAS;EAAEQ,UAAAA,SAAS,EAAE,KAAA;WAAO,CAAA;EAClDsP,QAAAA,MAAI,CAACrB,aAAa,GAAG,CAAC7E,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAACmC,GAAG,CACtF,UAACrC,EAAE,EAAA;YAAA,OAAKmG,MAAI,CAACL,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,WAAW,CAAC,CAAA;EAAA,SAC7C,CAAC,CAAA;EACH,OAAA;QAEA,OAAOqF,MAAI,CAACrB,aAAa,CAAA;EAC3B,KACF,CAAC,CAAA;KACF,CAAA;EAAAG,EAAAA,OAAA,CAEDmB,IAAI,GAAJ,SAAAA,MAAAA,CAAKnL,MAAM,EAAE;EAAA,IAAA,IAAAoL,MAAA,GAAA,IAAA,CAAA;MACX,OAAOhG,SAAS,CAAC,IAAI,EAAEpF,MAAM,EAAEgI,IAAY,EAAE,YAAM;EACjD,MAAA,IAAMnC,IAAI,GAAG;EAAEjH,QAAAA,GAAG,EAAEoB,MAAAA;SAAQ,CAAA;;EAE5B;EACA;EACA,MAAA,IAAI,CAACoL,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,EAAE;EAC1BoL,QAAAA,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,GAAG,CAACgF,QAAQ,CAACC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAACmC,GAAG,CAAC,UAACrC,EAAE,EAAA;YAAA,OACjFqG,MAAI,CAACP,OAAO,CAAC9F,EAAE,EAAEc,IAAI,EAAE,KAAK,CAAC,CAAA;EAAA,SAC/B,CAAC,CAAA;EACH,OAAA;EAEA,MAAA,OAAOuF,MAAI,CAACtB,QAAQ,CAAC9J,MAAM,CAAC,CAAA;EAC9B,KAAC,CAAC,CAAA;KACH,CAAA;IAAAgK,OAAA,CAEDa,OAAO,GAAP,SAAAA,OAAAA,CAAQ9F,EAAE,EAAEsB,QAAQ,EAAEgF,KAAK,EAAE;MAC3B,IAAMC,EAAE,GAAG,IAAI,CAACR,WAAW,CAAC/F,EAAE,EAAEsB,QAAQ,CAAC;EACvCkF,MAAAA,OAAO,GAAGD,EAAE,CAACzL,aAAa,EAAE;EAC5B2L,MAAAA,QAAQ,GAAGD,OAAO,CAACE,IAAI,CAAC,UAACC,CAAC,EAAA;UAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAKN,KAAK,CAAA;SAAC,CAAA,CAAA;EAChE,IAAA,OAAOG,QAAQ,GAAGA,QAAQ,CAACtL,KAAK,GAAG,IAAI,CAAA;KACxC,CAAA;EAAA8J,EAAAA,OAAA,CAED4B,eAAe,GAAf,SAAAA,eAAAA,CAAgB9O,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACvB;EACA;EACA,IAAA,OAAO,IAAI8I,mBAAmB,CAAC,IAAI,CAACC,IAAI,EAAE/I,IAAI,CAACgJ,WAAW,IAAI,IAAI,CAAC+F,WAAW,EAAE/O,IAAI,CAAC,CAAA;KACtF,CAAA;IAAAkN,OAAA,CAEDc,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEsB,QAAQ,EAAO;EAAA,IAAA,IAAfA,QAAQ,KAAA,KAAA,CAAA,EAAA;QAARA,QAAQ,GAAG,EAAE,CAAA;EAAA,KAAA;MAC3B,OAAO,IAAIM,iBAAiB,CAAC5B,EAAE,EAAE,IAAI,CAACc,IAAI,EAAEQ,QAAQ,CAAC,CAAA;KACtD,CAAA;EAAA2D,EAAAA,OAAA,CAED8B,YAAY,GAAZ,SAAAA,YAAAA,CAAahP,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACpB,IAAA,OAAO,IAAI2K,gBAAgB,CAAC,IAAI,CAAC5B,IAAI,EAAE,IAAI,CAAC6B,SAAS,EAAE,EAAE5K,IAAI,CAAC,CAAA;KAC/D,CAAA;EAAAkN,EAAAA,OAAA,CAED+B,aAAa,GAAb,SAAAA,aAAAA,CAAcjP,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,OAAOgF,WAAW,CAAC,IAAI,CAAC+D,IAAI,EAAE/I,IAAI,CAAC,CAAA;KACpC,CAAA;EAAAkN,EAAAA,OAAA,CAEDtC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,OACE,IAAI,CAAC9J,MAAM,KAAK,IAAI,IACpB,IAAI,CAACA,MAAM,CAAC+N,WAAW,EAAE,KAAK,OAAO,IACrCvI,2BAA2B,CAAC,IAAI,CAACyC,IAAI,CAAC,CAACjI,MAAM,CAAC+H,UAAU,CAAC,OAAO,CAAC,CAAA;KAEpE,CAAA;EAAAqE,EAAAA,OAAA,CAEDgC,eAAe,GAAf,SAAAA,kBAAkB;MAChB,IAAI,IAAI,CAAC1D,YAAY,EAAE;QACrB,OAAO,IAAI,CAACA,YAAY,CAAA;EAC1B,KAAC,MAAM,IAAI,CAAC2D,iBAAiB,EAAE,EAAE;EAC/B,MAAA,OAAOrI,oBAAoB,CAAA;EAC7B,KAAC,MAAM;EACL,MAAA,OAAON,iBAAiB,CAAC,IAAI,CAAC1F,MAAM,CAAC,CAAA;EACvC,KAAA;KACD,CAAA;EAAAoM,EAAAA,OAAA,CAEDkC,cAAc,GAAd,SAAAA,iBAAiB;EACf,IAAA,OAAO,IAAI,CAACF,eAAe,EAAE,CAAC9D,QAAQ,CAAA;KACvC,CAAA;EAAA8B,EAAAA,OAAA,CAEDmC,qBAAqB,GAArB,SAAAA,wBAAwB;EACtB,IAAA,OAAO,IAAI,CAACH,eAAe,EAAE,CAAC7D,WAAW,CAAA;KAC1C,CAAA;EAAA6B,EAAAA,OAAA,CAEDoC,cAAc,GAAd,SAAAA,iBAAiB;EACf,IAAA,OAAO,IAAI,CAACJ,eAAe,EAAE,CAAC5D,OAAO,CAAA;KACtC,CAAA;EAAA4B,EAAAA,OAAA,CAED9M,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,OACE,IAAI,CAACzO,MAAM,KAAKyO,KAAK,CAACzO,MAAM,IAC5B,IAAI,CAAC2G,eAAe,KAAK8H,KAAK,CAAC9H,eAAe,IAC9C,IAAI,CAACG,cAAc,KAAK2H,KAAK,CAAC3H,cAAc,CAAA;KAE/C,CAAA;EAAAsF,EAAAA,OAAA,CAEDsC,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAiB,SAAA,GAAA,IAAI,CAAC1O,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC2G,eAAe,GAAA,IAAA,GAAK,IAAI,CAACG,cAAc,GAAA,GAAA,CAAA;KAC9E,CAAA;EAAAtH,EAAAA,YAAA,CAAAoG,MAAA,EAAA,CAAA;MAAAnG,GAAA,EAAA,aAAA;MAAAC,GAAA,EA7KD,SAAAA,GAAAA,GAAkB;EAChB,MAAA,IAAI,IAAI,CAACyM,iBAAiB,IAAI,IAAI,EAAE;EAClC,QAAA,IAAI,CAACA,iBAAiB,GAAGrE,mBAAmB,CAAC,IAAI,CAAC,CAAA;EACpD,OAAA;QAEA,OAAO,IAAI,CAACqE,iBAAiB,CAAA;EAC/B,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAvG,MAAA,CAAA;EAAA,CAAA,EAAA;;EC7YH,IAAIhG,SAAS,GAAG,IAAI,CAAA;;EAEpB;EACA;EACA;EACA;AACqB+O,MAAAA,eAAe,0BAAA7O,KAAA,EAAA;IAAA1E,cAAA,CAAAuT,eAAA,EAAA7O,KAAA,CAAA,CAAA;EAYlC;EACF;EACA;EACA;EACA;EAJE6O,EAAAA,eAAA,CAKOC,QAAQ,GAAf,SAAAA,QAAAA,CAAgBvP,MAAM,EAAE;EACtB,IAAA,OAAOA,MAAM,KAAK,CAAC,GAAGsP,eAAe,CAACE,WAAW,GAAG,IAAIF,eAAe,CAACtP,MAAM,CAAC,CAAA;EACjF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAsP,EAAAA,eAAA,CAQOG,cAAc,GAArB,SAAAA,cAAAA,CAAsBlS,CAAC,EAAE;EACvB,IAAA,IAAIA,CAAC,EAAE;EACL,MAAA,IAAMmS,CAAC,GAAGnS,CAAC,CAACoS,KAAK,CAAC,uCAAuC,CAAC,CAAA;EAC1D,MAAA,IAAID,CAAC,EAAE;EACL,QAAA,OAAO,IAAIJ,eAAe,CAACM,YAAY,CAACF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;EACtD,OAAA;EACF,KAAA;EACA,IAAA,OAAO,IAAI,CAAA;KACZ,CAAA;IAED,SAAAJ,eAAAA,CAAYtP,MAAM,EAAE;EAAA,IAAA,IAAA8D,KAAA,CAAA;EAClBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKyF,KAAK,GAAGvJ,MAAM,CAAA;EAAC,IAAA,OAAA8D,KAAA,CAAA;EACtB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,EAAA,IAAArE,MAAA,GAAA6P,eAAA,CAAA5P,SAAA,CAAA;EAiCA;EACF;EACA;EACA;EACA;EACA;EALED,EAAAA,MAAA,CAMAE,UAAU,GAAV,SAAAA,aAAa;MACX,OAAO,IAAI,CAACW,IAAI,CAAA;EAClB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAb,MAAA,CAQAK,YAAY,GAAZ,SAAAA,eAAaF,EAAE,EAAEG,MAAM,EAAE;EACvB,IAAA,OAAOD,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAExJ,MAAM,CAAC,CAAA;EACzC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAUA;EACF;EACA;EACA;EACA;EACA;EACA;EANEN,EAAAA,MAAA,CAOAO,MAAM,GAAN,SAAAA,SAAS;MACP,OAAO,IAAI,CAACuJ,KAAK,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA9J,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOC,SAAS,EAAE;EAChB,IAAA,OAAOA,SAAS,CAACa,IAAI,KAAK,OAAO,IAAIb,SAAS,CAACqJ,KAAK,KAAK,IAAI,CAACA,KAAK,CAAA;EACrE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAApJ,EAAAA,YAAA,CAAAmP,eAAA,EAAA,CAAA;MAAAlP,GAAA,EAAA,MAAA;MAAAC,GAAA,EAjFA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,OAAO,CAAA;EAChB,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,IAAI,CAACkJ,KAAK,KAAK,CAAC,GAAG,KAAK,GAASzJ,KAAAA,GAAAA,YAAY,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAG,CAAA;EAC9E,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAnJ,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;EACb,MAAA,IAAI,IAAI,CAACkJ,KAAK,KAAK,CAAC,EAAE;EACpB,QAAA,OAAO,SAAS,CAAA;EAClB,OAAC,MAAM;UACL,OAAiBzJ,SAAAA,GAAAA,YAAY,CAAC,CAAC,IAAI,CAACyJ,KAAK,EAAE,QAAQ,CAAC,CAAA;EACtD,OAAA;EACF,KAAA;EAAC,GAAA,EAAA;MAAAnJ,GAAA,EAAA,aAAA;MAAAC,GAAA,EA8BD,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EA6BD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAAD,GAAA,EAAA,aAAA;MAAAC,GAAA;EA1ID;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAyB;QACvB,IAAIE,SAAS,KAAK,IAAI,EAAE;EACtBA,QAAAA,SAAS,GAAG,IAAI+O,eAAe,CAAC,CAAC,CAAC,CAAA;EACpC,OAAA;EACA,MAAA,OAAO/O,SAAS,CAAA;EAClB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA+O,eAAA,CAAA;EAAA,CAAA,CAV0C9P,IAAI;;ECPjD;EACA;EACA;EACA;AACqBqQ,MAAAA,WAAW,0BAAApP,KAAA,EAAA;IAAA1E,cAAA,CAAA8T,WAAA,EAAApP,KAAA,CAAA,CAAA;IAC9B,SAAAoP,WAAAA,CAAYtO,QAAQ,EAAE;EAAA,IAAA,IAAAuC,KAAA,CAAA;EACpBA,IAAAA,KAAA,GAAArD,KAAA,CAAAlE,IAAA,KAAM,CAAC,IAAA,IAAA,CAAA;EACP;MACAuH,KAAA,CAAKvC,QAAQ,GAAGA,QAAQ,CAAA;EAAC,IAAA,OAAAuC,KAAA,CAAA;EAC3B,GAAA;;EAEA;EAAA,EAAA,IAAArE,MAAA,GAAAoQ,WAAA,CAAAnQ,SAAA,CAAA;EAeA;EAAAD,EAAAA,MAAA,CACAE,UAAU,GAAV,SAAAA,aAAa;EACX,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;;EAEA,oBAAA;EAAAF,EAAAA,MAAA,CACAK,YAAY,GAAZ,SAAAA,eAAe;EACb,IAAA,OAAO,EAAE,CAAA;EACX,GAAA;;EAEA,oBAAA;EAAAL,EAAAA,MAAA,CACAO,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAOgE,GAAG,CAAA;EACZ,GAAA;;EAEA,oBAAA;EAAAvE,EAAAA,MAAA,CACAQ,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;;EAEA,oBAAA;EAAAE,EAAAA,YAAA,CAAA0P,WAAA,EAAA,CAAA;MAAAzP,GAAA,EAAA,MAAA;MAAAC,GAAA,EAlCA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,SAAS,CAAA;EAClB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAD,GAAA,EAAA,MAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACkB,QAAQ,CAAA;EACtB,KAAA;;EAEA;EAAA,GAAA,EAAA;MAAAnB,GAAA,EAAA,aAAA;MAAAC,GAAA,EACA,SAAAA,GAAAA,GAAkB;EAChB,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,EAAA;MAAAD,GAAA,EAAA,SAAA;MAAAC,GAAA,EAuBD,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAwP,WAAA,CAAA;EAAA,CAAA,CA7CsCrQ,IAAI;;ECN7C;EACA;EACA;EAUO,SAASsQ,aAAaA,CAACC,KAAK,EAAEC,WAAW,EAAE;IAEhD,IAAI7M,WAAW,CAAC4M,KAAK,CAAC,IAAIA,KAAK,KAAK,IAAI,EAAE;EACxC,IAAA,OAAOC,WAAW,CAAA;EACpB,GAAC,MAAM,IAAID,KAAK,YAAYvQ,IAAI,EAAE;EAChC,IAAA,OAAOuQ,KAAK,CAAA;EACd,GAAC,MAAM,IAAIE,QAAQ,CAACF,KAAK,CAAC,EAAE;EAC1B,IAAA,IAAMG,OAAO,GAAGH,KAAK,CAACrB,WAAW,EAAE,CAAA;MACnC,IAAIwB,OAAO,KAAK,SAAS,EAAE,OAAOF,WAAW,CAAC,KACzC,IAAIE,OAAO,KAAK,OAAO,IAAIA,OAAO,KAAK,QAAQ,EAAE,OAAO1P,UAAU,CAAC+O,QAAQ,CAAC,KAC5E,IAAIW,OAAO,KAAK,KAAK,IAAIA,OAAO,KAAK,KAAK,EAAE,OAAOZ,eAAe,CAACE,WAAW,CAAC,KAC/E,OAAOF,eAAe,CAACG,cAAc,CAACS,OAAO,CAAC,IAAI5M,QAAQ,CAACC,MAAM,CAACwM,KAAK,CAAC,CAAA;EAC/E,GAAC,MAAM,IAAII,QAAQ,CAACJ,KAAK,CAAC,EAAE;EAC1B,IAAA,OAAOT,eAAe,CAACC,QAAQ,CAACQ,KAAK,CAAC,CAAA;EACxC,GAAC,MAAM,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAIA,KAAK,IAAI,OAAOA,KAAK,CAAC/P,MAAM,KAAK,UAAU,EAAE;EAC/F;EACA;EACA,IAAA,OAAO+P,KAAK,CAAA;EACd,GAAC,MAAM;EACL,IAAA,OAAO,IAAIF,WAAW,CAACE,KAAK,CAAC,CAAA;EAC/B,GAAA;EACF;;ECjCA,IAAMK,gBAAgB,GAAG;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,iBAAiB;EAC1BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,QAAQ,EAAE,iBAAiB;EAC3BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,uBAAuB;EAChCC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,OAAO,EAAE,iBAAiB;EAC1BC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,iBAAiB;EACvBC,EAAAA,IAAI,EAAE,KAAA;EACR,CAAC,CAAA;EAED,IAAMC,qBAAqB,GAAG;EAC5BrB,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;EACxBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBE,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;EAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAA;EACnB,CAAC,CAAA;EAED,IAAMG,YAAY,GAAGvB,gBAAgB,CAACQ,OAAO,CAAC3O,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC2P,KAAK,CAAC,EAAE,CAAC,CAAA;EAExE,SAASC,WAAWA,CAACC,GAAG,EAAE;EAC/B,EAAA,IAAI7O,KAAK,GAAGG,QAAQ,CAAC0O,GAAG,EAAE,EAAE,CAAC,CAAA;EAC7B,EAAA,IAAI7N,KAAK,CAAChB,KAAK,CAAC,EAAE;EAChBA,IAAAA,KAAK,GAAG,EAAE,CAAA;EACV,IAAA,KAAK,IAAIH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgP,GAAG,CAAC/O,MAAM,EAAED,CAAC,EAAE,EAAE;EACnC,MAAA,IAAMiP,IAAI,GAAGD,GAAG,CAACE,UAAU,CAAClP,CAAC,CAAC,CAAA;EAE9B,MAAA,IAAIgP,GAAG,CAAChP,CAAC,CAAC,CAACmP,MAAM,CAAC7B,gBAAgB,CAACQ,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;UAClD3N,KAAK,IAAI0O,YAAY,CAAC5K,OAAO,CAAC+K,GAAG,CAAChP,CAAC,CAAC,CAAC,CAAA;EACvC,OAAC,MAAM;EACL,QAAA,KAAK,IAAM1C,GAAG,IAAIsR,qBAAqB,EAAE;EACvC,UAAA,IAAAQ,oBAAA,GAAmBR,qBAAqB,CAACtR,GAAG,CAAC;EAAtC+R,YAAAA,GAAG,GAAAD,oBAAA,CAAA,CAAA,CAAA;EAAEE,YAAAA,GAAG,GAAAF,oBAAA,CAAA,CAAA,CAAA,CAAA;EACf,UAAA,IAAIH,IAAI,IAAII,GAAG,IAAIJ,IAAI,IAAIK,GAAG,EAAE;cAC9BnP,KAAK,IAAI8O,IAAI,GAAGI,GAAG,CAAA;EACrB,WAAA;EACF,SAAA;EACF,OAAA;EACF,KAAA;EACA,IAAA,OAAO/O,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;EAC5B,GAAC,MAAM;EACL,IAAA,OAAOA,KAAK,CAAA;EACd,GAAA;EACF,CAAA;;EAEA;EACA,IAAMoP,eAAe,GAAG,IAAIhR,GAAG,EAAE,CAAA;EAC1B,SAASiR,oBAAoBA,GAAG;IACrCD,eAAe,CAAC3O,KAAK,EAAE,CAAA;EACzB,CAAA;EAEO,SAAS6O,UAAUA,CAAA7R,IAAA,EAAsB8R,MAAM,EAAO;EAAA,EAAA,IAAhClL,eAAe,GAAA5G,IAAA,CAAf4G,eAAe,CAAA;EAAA,EAAA,IAAIkL,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,EAAE,CAAA;EAAA,GAAA;EACzD,EAAA,IAAMC,EAAE,GAAGnL,eAAe,IAAI,MAAM,CAAA;EAEpC,EAAA,IAAIoL,WAAW,GAAGL,eAAe,CAAChS,GAAG,CAACoS,EAAE,CAAC,CAAA;IACzC,IAAIC,WAAW,KAAKjR,SAAS,EAAE;EAC7BiR,IAAAA,WAAW,GAAG,IAAIrR,GAAG,EAAE,CAAA;EACvBgR,IAAAA,eAAe,CAACzQ,GAAG,CAAC6Q,EAAE,EAAEC,WAAW,CAAC,CAAA;EACtC,GAAA;EACA,EAAA,IAAIC,KAAK,GAAGD,WAAW,CAACrS,GAAG,CAACmS,MAAM,CAAC,CAAA;IACnC,IAAIG,KAAK,KAAKlR,SAAS,EAAE;MACvBkR,KAAK,GAAG,IAAIC,MAAM,CAAIxC,EAAAA,GAAAA,gBAAgB,CAACqC,EAAE,CAAC,GAAGD,MAAQ,CAAC,CAAA;EACtDE,IAAAA,WAAW,CAAC9Q,GAAG,CAAC4Q,MAAM,EAAEG,KAAK,CAAC,CAAA;EAChC,GAAA;EAEA,EAAA,OAAOA,KAAK,CAAA;EACd;;ECpFA,IAAIE,GAAG,GAAG,SAAAA,GAAA,GAAA;EAAA,IAAA,OAAMhS,IAAI,CAACgS,GAAG,EAAE,CAAA;EAAA,GAAA;EACxB7C,EAAAA,WAAW,GAAG,QAAQ;EACtBvE,EAAAA,aAAa,GAAG,IAAI;EACpBG,EAAAA,sBAAsB,GAAG,IAAI;EAC7BE,EAAAA,qBAAqB,GAAG,IAAI;EAC5BgH,EAAAA,kBAAkB,GAAG,EAAE;IACvBC,cAAc;EACd9G,EAAAA,mBAAmB,GAAG,IAAI,CAAA;;EAE5B;EACA;EACA;AAFA,MAGqBT,QAAQ,gBAAA,YAAA;EAAA,EAAA,SAAAA,QAAA,GAAA,EAAA;EAoJ3B;EACF;EACA;EACA;EAHEA,EAAAA,QAAA,CAIOwH,WAAW,GAAlB,SAAAA,cAAqB;MACnBzM,MAAM,CAAC9C,UAAU,EAAE,CAAA;MACnBH,QAAQ,CAACG,UAAU,EAAE,CAAA;MACrBsE,QAAQ,CAACtE,UAAU,EAAE,CAAA;EACrB6O,IAAAA,oBAAoB,EAAE,CAAA;KACvB,CAAA;EAAAnS,EAAAA,YAAA,CAAAqL,QAAA,EAAA,IAAA,EAAA,CAAA;MAAApL,GAAA,EAAA,KAAA;MAAAC,GAAA;EA5JD;EACF;EACA;EACA;EACE,IAAA,SAAAA,MAAiB;EACf,MAAA,OAAOwS,GAAG,CAAA;EACZ,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANEjR,IAAAA,GAAA,EAOA,SAAAA,GAAetE,CAAAA,CAAC,EAAE;EAChBuV,MAAAA,GAAG,GAAGvV,CAAC,CAAA;EACT,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA8C,GAAA,EAAA,aAAA;MAAAC,GAAA;EASA;EACF;EACA;EACA;EACA;EACE,IAAA,SAAAA,MAAyB;EACvB,MAAA,OAAOyP,aAAa,CAACE,WAAW,EAAExP,UAAU,CAAC+O,QAAQ,CAAC,CAAA;EACxD,KAAA;;EAEA;EACF;EACA;EACA;EAHE3N,IAAAA,GAAA,EAbA,SAAAA,GAAuB4B,CAAAA,IAAI,EAAE;EAC3BwM,MAAAA,WAAW,GAAGxM,IAAI,CAAA;EACpB,KAAA;EAAC,GAAA,EAAA;MAAApD,GAAA,EAAA,eAAA;MAAAC,GAAA,EAeD,SAAAA,GAAAA,GAA2B;EACzB,MAAA,OAAOoL,aAAa,CAAA;EACtB,KAAA;;EAEA;EACF;EACA;EACA;EAHE7J,IAAAA,GAAA,EAIA,SAAAA,GAAyBjB,CAAAA,MAAM,EAAE;EAC/B8K,MAAAA,aAAa,GAAG9K,MAAM,CAAA;EACxB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAP,GAAA,EAAA,wBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;EAClC,MAAA,OAAOuL,sBAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHEhK,IAAAA,GAAA,EAIA,SAAAA,GAAkC0F,CAAAA,eAAe,EAAE;EACjDsE,MAAAA,sBAAsB,GAAGtE,eAAe,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAlH,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;EACjC,MAAA,OAAOyL,qBAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHElK,IAAAA,GAAA,EAIA,SAAAA,GAAiC6F,CAAAA,cAAc,EAAE;EAC/CqE,MAAAA,qBAAqB,GAAGrE,cAAc,CAAA;EACxC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;;EAEE;EACF;EACA;EAFE,GAAA,EAAA;MAAArH,GAAA,EAAA,qBAAA;MAAAC,GAAA,EAGA,SAAAA,GAAAA,GAAiC;EAC/B,MAAA,OAAO4L,mBAAmB,CAAA;EAC5B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANErK,IAAAA,GAAA,EAOA,SAAAA,GAA+ByJ,CAAAA,YAAY,EAAE;EAC3CY,MAAAA,mBAAmB,GAAGD,oBAAoB,CAACX,YAAY,CAAC,CAAA;EAC1D,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAjL,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgC;EAC9B,MAAA,OAAOyS,kBAAkB,CAAA;EAC3B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EARElR,IAAAA,GAAA,EASA,SAAAA,GAA8BqR,CAAAA,UAAU,EAAE;QACxCH,kBAAkB,GAAGG,UAAU,GAAG,GAAG,CAAA;EACvC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7S,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;EAC1B,MAAA,OAAO0S,cAAc,CAAA;EACvB,KAAA;;EAEA;EACF;EACA;EACA;EAHEnR,IAAAA,GAAA,EAIA,SAAAA,GAA0BsR,CAAAA,CAAC,EAAE;EAC3BH,MAAAA,cAAc,GAAGG,CAAC,CAAA;EACpB,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA1H,QAAA,CAAA;EAAA,CAAA;;MCvKkB2H,OAAO,gBAAA,YAAA;EAC1B,EAAA,SAAAA,OAAY7W,CAAAA,MAAM,EAAE8W,WAAW,EAAE;MAC/B,IAAI,CAAC9W,MAAM,GAAGA,MAAM,CAAA;MACpB,IAAI,CAAC8W,WAAW,GAAGA,WAAW,CAAA;EAChC,GAAA;EAAC,EAAA,IAAA3T,MAAA,GAAA0T,OAAA,CAAAzT,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDjD,SAAS,GAAT,SAAAA,YAAY;MACV,IAAI,IAAI,CAAC4W,WAAW,EAAE;EACpB,MAAA,OAAU,IAAI,CAAC9W,MAAM,GAAK,IAAA,GAAA,IAAI,CAAC8W,WAAW,CAAA;EAC5C,KAAC,MAAM;QACL,OAAO,IAAI,CAAC9W,MAAM,CAAA;EACpB,KAAA;KACD,CAAA;EAAA,EAAA,OAAA6W,OAAA,CAAA;EAAA,CAAA,EAAA;;ECCH,IAAME,aAAa,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC3EC,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAEtE,SAASC,cAAcA,CAACtW,IAAI,EAAEgG,KAAK,EAAE;EACnC,EAAA,OAAO,IAAIkQ,OAAO,CAChB,mBAAmB,EACFlQ,gBAAAA,GAAAA,KAAK,GAAa,YAAA,GAAA,OAAOA,KAAK,GAAA,SAAA,GAAUhG,IAAI,GAAA,oBAC/D,CAAC,CAAA;EACH,CAAA;EAEO,SAASuW,SAASA,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;EAC1C,EAAA,IAAM6V,CAAC,GAAG,IAAI5S,IAAI,CAACA,IAAI,CAAC6S,GAAG,CAAChW,IAAI,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,CAAC,CAAC,CAAA;EAElD,EAAA,IAAIF,IAAI,GAAG,GAAG,IAAIA,IAAI,IAAI,CAAC,EAAE;MAC3B+V,CAAC,CAACE,cAAc,CAACF,CAAC,CAACG,cAAc,EAAE,GAAG,IAAI,CAAC,CAAA;EAC7C,GAAA;EAEA,EAAA,IAAMC,EAAE,GAAGJ,CAAC,CAACK,SAAS,EAAE,CAAA;EAExB,EAAA,OAAOD,EAAE,KAAK,CAAC,GAAG,CAAC,GAAGA,EAAE,CAAA;EAC1B,CAAA;EAEA,SAASE,cAAcA,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;EACxC,EAAA,OAAOA,GAAG,GAAG,CAACoW,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa,EAAE1V,KAAK,GAAG,CAAC,CAAC,CAAA;EACzE,CAAA;EAEA,SAASsW,gBAAgBA,CAACvW,IAAI,EAAEwW,OAAO,EAAE;IACvC,IAAMC,KAAK,GAAGH,UAAU,CAACtW,IAAI,CAAC,GAAG4V,UAAU,GAAGD,aAAa;EACzDe,IAAAA,MAAM,GAAGD,KAAK,CAACE,SAAS,CAAC,UAACvR,CAAC,EAAA;QAAA,OAAKA,CAAC,GAAGoR,OAAO,CAAA;OAAC,CAAA;EAC5CtW,IAAAA,GAAG,GAAGsW,OAAO,GAAGC,KAAK,CAACC,MAAM,CAAC,CAAA;IAC/B,OAAO;MAAEzW,KAAK,EAAEyW,MAAM,GAAG,CAAC;EAAExW,IAAAA,GAAG,EAAHA,GAAAA;KAAK,CAAA;EACnC,CAAA;EAEO,SAAS0W,iBAAiBA,CAACC,UAAU,EAAEC,WAAW,EAAE;IACzD,OAAQ,CAACD,UAAU,GAAGC,WAAW,GAAG,CAAC,IAAI,CAAC,GAAI,CAAC,CAAA;EACjD,CAAA;;EAEA;EACA;EACA;;EAEO,SAASC,eAAeA,CAACC,OAAO,EAAEC,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC9E,EAAA,IAAQ9W,IAAI,GAAiBgX,OAAO,CAA5BhX,IAAI;MAAEC,KAAK,GAAU+W,OAAO,CAAtB/W,KAAK;MAAEC,GAAG,GAAK8W,OAAO,CAAf9W,GAAG;MACtBsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC;EAC1CG,IAAAA,OAAO,GAAGuW,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,EAAE4W,WAAW,CAAC,CAAA;EAEvE,EAAA,IAAII,UAAU,GAAGxQ,IAAI,CAAC2E,KAAK,CAAC,CAACmL,OAAO,GAAGnW,OAAO,GAAG,EAAE,GAAG4W,kBAAkB,IAAI,CAAC,CAAC;MAC5EE,QAAQ,CAAA;IAEV,IAAID,UAAU,GAAG,CAAC,EAAE;MAClBC,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;MACnBkX,UAAU,GAAGE,eAAe,CAACD,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EACzE,GAAC,MAAM,IAAII,UAAU,GAAGE,eAAe,CAACpX,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,CAAC,EAAE;MAC9EK,QAAQ,GAAGnX,IAAI,GAAG,CAAC,CAAA;EACnBkX,IAAAA,UAAU,GAAG,CAAC,CAAA;EAChB,GAAC,MAAM;EACLC,IAAAA,QAAQ,GAAGnX,IAAI,CAAA;EACjB,GAAA;EAEA,EAAA,OAAAgJ,QAAA,CAAA;EAASmO,IAAAA,QAAQ,EAARA,QAAQ;EAAED,IAAAA,UAAU,EAAVA,UAAU;EAAE7W,IAAAA,OAAO,EAAPA,OAAAA;KAAYgX,EAAAA,UAAU,CAACL,OAAO,CAAC,CAAA,CAAA;EAChE,CAAA;EAEO,SAASM,eAAeA,CAACC,QAAQ,EAAEN,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC/E,EAAA,IAAQK,QAAQ,GAA0BI,QAAQ,CAA1CJ,QAAQ;MAAED,UAAU,GAAcK,QAAQ,CAAhCL,UAAU;MAAE7W,OAAO,GAAKkX,QAAQ,CAApBlX,OAAO;EACnCmX,IAAAA,aAAa,GAAGZ,iBAAiB,CAACd,SAAS,CAACqB,QAAQ,EAAE,CAAC,EAAEF,kBAAkB,CAAC,EAAEH,WAAW,CAAC;EAC1FW,IAAAA,UAAU,GAAGC,UAAU,CAACP,QAAQ,CAAC,CAAA;EAEnC,EAAA,IAAIX,OAAO,GAAGU,UAAU,GAAG,CAAC,GAAG7W,OAAO,GAAGmX,aAAa,GAAG,CAAC,GAAGP,kBAAkB;MAC7EjX,IAAI,CAAA;IAEN,IAAIwW,OAAO,GAAG,CAAC,EAAE;MACfxW,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;EACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAAC1X,IAAI,CAAC,CAAA;EAC7B,GAAC,MAAM,IAAIwW,OAAO,GAAGiB,UAAU,EAAE;MAC/BzX,IAAI,GAAGmX,QAAQ,GAAG,CAAC,CAAA;EACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAACP,QAAQ,CAAC,CAAA;EACjC,GAAC,MAAM;EACLnX,IAAAA,IAAI,GAAGmX,QAAQ,CAAA;EACjB,GAAA;EAEA,EAAA,IAAAQ,iBAAA,GAAuBpB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;MAA9CvW,KAAK,GAAA0X,iBAAA,CAAL1X,KAAK;MAAEC,GAAG,GAAAyX,iBAAA,CAAHzX,GAAG,CAAA;EAClB,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEC,IAAAA,KAAK,EAALA,KAAK;EAAEC,IAAAA,GAAG,EAAHA,GAAAA;KAAQmX,EAAAA,UAAU,CAACE,QAAQ,CAAC,CAAA,CAAA;EACpD,CAAA;EAEO,SAASK,kBAAkBA,CAACC,QAAQ,EAAE;EAC3C,EAAA,IAAQ7X,IAAI,GAAiB6X,QAAQ,CAA7B7X,IAAI;MAAEC,KAAK,GAAU4X,QAAQ,CAAvB5X,KAAK;MAAEC,GAAG,GAAK2X,QAAQ,CAAhB3X,GAAG,CAAA;IACxB,IAAMsW,OAAO,GAAGH,cAAc,CAACrW,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,CAAA;EAChD,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEwW,IAAAA,OAAO,EAAPA,OAAAA;KAAYa,EAAAA,UAAU,CAACQ,QAAQ,CAAC,CAAA,CAAA;EACjD,CAAA;EAEO,SAASC,kBAAkBA,CAACC,WAAW,EAAE;EAC9C,EAAA,IAAQ/X,IAAI,GAAc+X,WAAW,CAA7B/X,IAAI;MAAEwW,OAAO,GAAKuB,WAAW,CAAvBvB,OAAO,CAAA;EACrB,EAAA,IAAAwB,kBAAA,GAAuBzB,gBAAgB,CAACvW,IAAI,EAAEwW,OAAO,CAAC;MAA9CvW,KAAK,GAAA+X,kBAAA,CAAL/X,KAAK;MAAEC,GAAG,GAAA8X,kBAAA,CAAH9X,GAAG,CAAA;EAClB,EAAA,OAAA8I,QAAA,CAAA;EAAShJ,IAAAA,IAAI,EAAJA,IAAI;EAAEC,IAAAA,KAAK,EAALA,KAAK;EAAEC,IAAAA,GAAG,EAAHA,GAAAA;KAAQmX,EAAAA,UAAU,CAACU,WAAW,CAAC,CAAA,CAAA;EACvD,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACO,SAASE,mBAAmBA,CAACC,GAAG,EAAExN,GAAG,EAAE;IAC5C,IAAMyN,iBAAiB,GACrB,CAAC1S,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,IAC9B,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,IACjC,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,CAAA;EACjC,EAAA,IAAIH,iBAAiB,EAAE;MACrB,IAAMI,cAAc,GAClB,CAAC9S,WAAW,CAACyS,GAAG,CAAC7X,OAAO,CAAC,IAAI,CAACoF,WAAW,CAACyS,GAAG,CAAChB,UAAU,CAAC,IAAI,CAACzR,WAAW,CAACyS,GAAG,CAACf,QAAQ,CAAC,CAAA;EAEzF,IAAA,IAAIoB,cAAc,EAAE;EAClB,MAAA,MAAM,IAAIpZ,6BAA6B,CACrC,gEACF,CAAC,CAAA;EACH,KAAA;EACA,IAAA,IAAI,CAACsG,WAAW,CAACyS,GAAG,CAACE,YAAY,CAAC,EAAEF,GAAG,CAAC7X,OAAO,GAAG6X,GAAG,CAACE,YAAY,CAAA;EAClE,IAAA,IAAI,CAAC3S,WAAW,CAACyS,GAAG,CAACG,eAAe,CAAC,EAAEH,GAAG,CAAChB,UAAU,GAAGgB,GAAG,CAACG,eAAe,CAAA;EAC3E,IAAA,IAAI,CAAC5S,WAAW,CAACyS,GAAG,CAACI,aAAa,CAAC,EAAEJ,GAAG,CAACf,QAAQ,GAAGe,GAAG,CAACI,aAAa,CAAA;MACrE,OAAOJ,GAAG,CAACE,YAAY,CAAA;MACvB,OAAOF,GAAG,CAACG,eAAe,CAAA;MAC1B,OAAOH,GAAG,CAACI,aAAa,CAAA;MACxB,OAAO;EACLrB,MAAAA,kBAAkB,EAAEvM,GAAG,CAAC8G,qBAAqB,EAAE;EAC/CsF,MAAAA,WAAW,EAAEpM,GAAG,CAAC6G,cAAc,EAAC;OACjC,CAAA;EACH,GAAC,MAAM;MACL,OAAO;EAAE0F,MAAAA,kBAAkB,EAAE,CAAC;EAAEH,MAAAA,WAAW,EAAE,CAAA;OAAG,CAAA;EAClD,GAAA;EACF,CAAA;EAEO,SAAS0B,kBAAkBA,CAACN,GAAG,EAAEjB,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;EAC7E,EAAA,IAAM2B,SAAS,GAAGC,SAAS,CAACR,GAAG,CAACf,QAAQ,CAAC;EACvCwB,IAAAA,SAAS,GAAGC,cAAc,CACxBV,GAAG,CAAChB,UAAU,EACd,CAAC,EACDE,eAAe,CAACc,GAAG,CAACf,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAC/D,CAAC;MACD+B,YAAY,GAAGD,cAAc,CAACV,GAAG,CAAC7X,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAElD,IAAI,CAACoY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,UAAU,EAAEqC,GAAG,CAACf,QAAQ,CAAC,CAAA;EACjD,GAAC,MAAM,IAAI,CAACwB,SAAS,EAAE;EACrB,IAAA,OAAO9C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAChB,UAAU,CAAC,CAAA;EAC/C,GAAC,MAAM,IAAI,CAAC2B,YAAY,EAAE;EACxB,IAAA,OAAOhD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC7X,OAAO,CAAC,CAAA;KAC9C,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASyY,qBAAqBA,CAACZ,GAAG,EAAE;EACzC,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;EACnC+Y,IAAAA,YAAY,GAAGH,cAAc,CAACV,GAAG,CAAC1B,OAAO,EAAE,CAAC,EAAEkB,UAAU,CAACQ,GAAG,CAAClY,IAAI,CAAC,CAAC,CAAA;IAErE,IAAI,CAACyY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC+Y,YAAY,EAAE;EACxB,IAAA,OAAOlD,cAAc,CAAC,SAAS,EAAEqC,GAAG,CAAC1B,OAAO,CAAC,CAAA;KAC9C,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASwC,uBAAuBA,CAACd,GAAG,EAAE;EAC3C,EAAA,IAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAClY,IAAI,CAAC;MACnCiZ,UAAU,GAAGL,cAAc,CAACV,GAAG,CAACjY,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;EAC7CiZ,IAAAA,QAAQ,GAAGN,cAAc,CAACV,GAAG,CAAChY,GAAG,EAAE,CAAC,EAAEiZ,WAAW,CAACjB,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,CAAC,CAAC,CAAA;IAEzE,IAAI,CAACwY,SAAS,EAAE;EACd,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEqC,GAAG,CAAClY,IAAI,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAACiZ,UAAU,EAAE;EACtB,IAAA,OAAOpD,cAAc,CAAC,OAAO,EAAEqC,GAAG,CAACjY,KAAK,CAAC,CAAA;EAC3C,GAAC,MAAM,IAAI,CAACiZ,QAAQ,EAAE;EACpB,IAAA,OAAOrD,cAAc,CAAC,KAAK,EAAEqC,GAAG,CAAChY,GAAG,CAAC,CAAA;KACtC,MAAM,OAAO,KAAK,CAAA;EACrB,CAAA;EAEO,SAASkZ,kBAAkBA,CAAClB,GAAG,EAAE;EACtC,EAAA,IAAQzX,IAAI,GAAkCyX,GAAG,CAAzCzX,IAAI;MAAEC,MAAM,GAA0BwX,GAAG,CAAnCxX,MAAM;MAAEE,MAAM,GAAkBsX,GAAG,CAA3BtX,MAAM;MAAEmG,WAAW,GAAKmR,GAAG,CAAnBnR,WAAW,CAAA;IACzC,IAAMsS,SAAS,GACXT,cAAc,CAACnY,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAC1BA,IAAI,KAAK,EAAE,IAAIC,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAC,IAAImG,WAAW,KAAK,CAAE;MACpEuS,WAAW,GAAGV,cAAc,CAAClY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;MAC3C6Y,WAAW,GAAGX,cAAc,CAAChY,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;MAC3C4Y,gBAAgB,GAAGZ,cAAc,CAAC7R,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;IAExD,IAAI,CAACsS,SAAS,EAAE;EACd,IAAA,OAAOxD,cAAc,CAAC,MAAM,EAAEpV,IAAI,CAAC,CAAA;EACrC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;EACvB,IAAA,OAAOzD,cAAc,CAAC,QAAQ,EAAEnV,MAAM,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC6Y,WAAW,EAAE;EACvB,IAAA,OAAO1D,cAAc,CAAC,QAAQ,EAAEjV,MAAM,CAAC,CAAA;EACzC,GAAC,MAAM,IAAI,CAAC4Y,gBAAgB,EAAE;EAC5B,IAAA,OAAO3D,cAAc,CAAC,aAAa,EAAE9O,WAAW,CAAC,CAAA;KAClD,MAAM,OAAO,KAAK,CAAA;EACrB;;ECnMA;EACA;EACA;;EAEA;;EAEO,SAAStB,WAAWA,CAACgU,CAAC,EAAE;IAC7B,OAAO,OAAOA,CAAC,KAAK,WAAW,CAAA;EACjC,CAAA;EAEO,SAAShH,QAAQA,CAACgH,CAAC,EAAE;IAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;EAC9B,CAAA;EAEO,SAASf,SAASA,CAACe,CAAC,EAAE;IAC3B,OAAO,OAAOA,CAAC,KAAK,QAAQ,IAAIA,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;EAC7C,CAAA;EAEO,SAASlH,QAAQA,CAACkH,CAAC,EAAE;IAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;EAC9B,CAAA;EAEO,SAASC,MAAMA,CAACD,CAAC,EAAE;IACxB,OAAOjO,MAAM,CAACxJ,SAAS,CAAC2P,QAAQ,CAAC9S,IAAI,CAAC4a,CAAC,CAAC,KAAK,eAAe,CAAA;EAC9D,CAAA;;EAEA;;EAEO,SAASxM,WAAWA,GAAG;IAC5B,IAAI;MACF,OAAO,OAAO3J,IAAI,KAAK,WAAW,IAAI,CAAC,CAACA,IAAI,CAAC+E,kBAAkB,CAAA;KAChE,CAAC,OAAOlC,CAAC,EAAE;EACV,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;EACF,CAAA;EAEO,SAASmL,iBAAiBA,GAAG;IAClC,IAAI;MACF,OACE,OAAOhO,IAAI,KAAK,WAAW,IAC3B,CAAC,CAACA,IAAI,CAACuF,MAAM,KACZ,UAAU,IAAIvF,IAAI,CAACuF,MAAM,CAAC7G,SAAS,IAAI,aAAa,IAAIsB,IAAI,CAACuF,MAAM,CAAC7G,SAAS,CAAC,CAAA;KAElF,CAAC,OAAOmE,CAAC,EAAE;EACV,IAAA,OAAO,KAAK,CAAA;EACd,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASwT,UAAUA,CAACC,KAAK,EAAE;IAChC,OAAOC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAC,CAAA;EAC/C,CAAA;EAEO,SAASG,MAAMA,CAACC,GAAG,EAAEC,EAAE,EAAEC,OAAO,EAAE;EACvC,EAAA,IAAIF,GAAG,CAAC3U,MAAM,KAAK,CAAC,EAAE;EACpB,IAAA,OAAOtB,SAAS,CAAA;EAClB,GAAA;IACA,OAAOiW,GAAG,CAACG,MAAM,CAAC,UAACC,IAAI,EAAEC,IAAI,EAAK;MAChC,IAAMC,IAAI,GAAG,CAACL,EAAE,CAACI,IAAI,CAAC,EAAEA,IAAI,CAAC,CAAA;MAC7B,IAAI,CAACD,IAAI,EAAE;EACT,MAAA,OAAOE,IAAI,CAAA;EACb,KAAC,MAAM,IAAIJ,OAAO,CAACE,IAAI,CAAC,CAAC,CAAC,EAAEE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAKF,IAAI,CAAC,CAAC,CAAC,EAAE;EAChD,MAAA,OAAOA,IAAI,CAAA;EACb,KAAC,MAAM;EACL,MAAA,OAAOE,IAAI,CAAA;EACb,KAAA;EACF,GAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;EACb,CAAA;EAEO,SAASC,IAAIA,CAACrC,GAAG,EAAEzM,IAAI,EAAE;IAC9B,OAAOA,IAAI,CAAC0O,MAAM,CAAC,UAACK,CAAC,EAAEC,CAAC,EAAK;EAC3BD,IAAAA,CAAC,CAACC,CAAC,CAAC,GAAGvC,GAAG,CAACuC,CAAC,CAAC,CAAA;EACb,IAAA,OAAOD,CAAC,CAAA;KACT,EAAE,EAAE,CAAC,CAAA;EACR,CAAA;EAEO,SAASE,cAAcA,CAACxC,GAAG,EAAEyC,IAAI,EAAE;IACxC,OAAOnP,MAAM,CAACxJ,SAAS,CAAC0Y,cAAc,CAAC7b,IAAI,CAACqZ,GAAG,EAAEyC,IAAI,CAAC,CAAA;EACxD,CAAA;EAEO,SAASrM,oBAAoBA,CAACsM,QAAQ,EAAE;IAC7C,IAAIA,QAAQ,IAAI,IAAI,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM,IAAI,OAAOA,QAAQ,KAAK,QAAQ,EAAE;EACvC,IAAA,MAAM,IAAIpb,oBAAoB,CAAC,iCAAiC,CAAC,CAAA;EACnE,GAAC,MAAM;EACL,IAAA,IACE,CAACoZ,cAAc,CAACgC,QAAQ,CAACrN,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,IACxC,CAACqL,cAAc,CAACgC,QAAQ,CAACpN,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,IAC3C,CAACqM,KAAK,CAACC,OAAO,CAACc,QAAQ,CAACnN,OAAO,CAAC,IAChCmN,QAAQ,CAACnN,OAAO,CAACoN,IAAI,CAAC,UAACC,CAAC,EAAA;QAAA,OAAK,CAAClC,cAAc,CAACkC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EAAA,KAAA,CAAC,EACtD;EACA,MAAA,MAAM,IAAItb,oBAAoB,CAAC,uBAAuB,CAAC,CAAA;EACzD,KAAA;MACA,OAAO;QACL+N,QAAQ,EAAEqN,QAAQ,CAACrN,QAAQ;QAC3BC,WAAW,EAAEoN,QAAQ,CAACpN,WAAW;EACjCC,MAAAA,OAAO,EAAEoM,KAAK,CAACkB,IAAI,CAACH,QAAQ,CAACnN,OAAO,CAAA;OACrC,CAAA;EACH,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASmL,cAAcA,CAACgB,KAAK,EAAEoB,MAAM,EAAEC,GAAG,EAAE;IACjD,OAAOvC,SAAS,CAACkB,KAAK,CAAC,IAAIA,KAAK,IAAIoB,MAAM,IAAIpB,KAAK,IAAIqB,GAAG,CAAA;EAC5D,CAAA;;EAEA;EACO,SAASC,QAAQA,CAACC,CAAC,EAAEvb,CAAC,EAAE;IAC7B,OAAOub,CAAC,GAAGvb,CAAC,GAAG8G,IAAI,CAAC2E,KAAK,CAAC8P,CAAC,GAAGvb,CAAC,CAAC,CAAA;EAClC,CAAA;EAEO,SAASmM,QAAQA,CAACsG,KAAK,EAAEzS,CAAC,EAAM;EAAA,EAAA,IAAPA,CAAC,KAAA,KAAA,CAAA,EAAA;EAADA,IAAAA,CAAC,GAAG,CAAC,CAAA;EAAA,GAAA;EACnC,EAAA,IAAMwb,KAAK,GAAG/I,KAAK,GAAG,CAAC,CAAA;EACvB,EAAA,IAAIgJ,MAAM,CAAA;EACV,EAAA,IAAID,KAAK,EAAE;EACTC,IAAAA,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,CAAChJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;EAC/C,GAAC,MAAM;MACLyb,MAAM,GAAG,CAAC,EAAE,GAAGhJ,KAAK,EAAEtG,QAAQ,CAACnM,CAAC,EAAE,GAAG,CAAC,CAAA;EACxC,GAAA;EACA,EAAA,OAAOyb,MAAM,CAAA;EACf,CAAA;EAEO,SAASC,YAAYA,CAACC,MAAM,EAAE;EACnC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;EAC3D,IAAA,OAAOxX,SAAS,CAAA;EAClB,GAAC,MAAM;EACL,IAAA,OAAO2B,QAAQ,CAAC6V,MAAM,EAAE,EAAE,CAAC,CAAA;EAC7B,GAAA;EACF,CAAA;EAEO,SAASC,aAAaA,CAACD,MAAM,EAAE;EACpC,EAAA,IAAI9V,WAAW,CAAC8V,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;EAC3D,IAAA,OAAOxX,SAAS,CAAA;EAClB,GAAC,MAAM;MACL,OAAO0X,UAAU,CAACF,MAAM,CAAC,CAAA;EAC3B,GAAA;EACF,CAAA;EAEO,SAASG,WAAWA,CAACC,QAAQ,EAAE;EACpC;EACA,EAAA,IAAIlW,WAAW,CAACkW,QAAQ,CAAC,IAAIA,QAAQ,KAAK,IAAI,IAAIA,QAAQ,KAAK,EAAE,EAAE;EACjE,IAAA,OAAO5X,SAAS,CAAA;EAClB,GAAC,MAAM;MACL,IAAMmG,CAAC,GAAGuR,UAAU,CAAC,IAAI,GAAGE,QAAQ,CAAC,GAAG,IAAI,CAAA;EAC5C,IAAA,OAAOjV,IAAI,CAAC2E,KAAK,CAACnB,CAAC,CAAC,CAAA;EACtB,GAAA;EACF,CAAA;EAEO,SAAS4B,OAAOA,CAAC8P,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAY;EAAA,EAAA,IAApBA,QAAQ,KAAA,KAAA,CAAA,EAAA;EAARA,IAAAA,QAAQ,GAAG,OAAO,CAAA;EAAA,GAAA;IACxD,IAAMC,MAAM,GAAArV,IAAA,CAAAsV,GAAA,CAAG,EAAE,EAAIH,MAAM,CAAA,CAAA;EAC3B,EAAA,QAAQC,QAAQ;EACd,IAAA,KAAK,QAAQ;QACX,OAAOF,MAAM,GAAG,CAAC,GACblV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,GACnCrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC1C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAACwV,KAAK,CAACN,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAACyV,KAAK,CAACP,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,OAAO;QACV,OAAOrV,IAAI,CAAC2E,KAAK,CAACuQ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC7C,IAAA,KAAK,MAAM;QACT,OAAOrV,IAAI,CAACuV,IAAI,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;EAC5C,IAAA;EACE,MAAA,MAAM,IAAIK,UAAU,CAAmBN,iBAAAA,GAAAA,QAAQ,qBAAkB,CAAC,CAAA;EACtE,GAAA;EACF,CAAA;;EAEA;;EAEO,SAASxF,UAAUA,CAACtW,IAAI,EAAE;EAC/B,EAAA,OAAOA,IAAI,GAAG,CAAC,KAAK,CAAC,KAAKA,IAAI,GAAG,GAAG,KAAK,CAAC,IAAIA,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAA;EACjE,CAAA;EAEO,SAAS0X,UAAUA,CAAC1X,IAAI,EAAE;EAC/B,EAAA,OAAOsW,UAAU,CAACtW,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;EACrC,CAAA;EAEO,SAASmZ,WAAWA,CAACnZ,IAAI,EAAEC,KAAK,EAAE;IACvC,IAAMoc,QAAQ,GAAGnB,QAAQ,CAACjb,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;MAC1Cqc,OAAO,GAAGtc,IAAI,GAAG,CAACC,KAAK,GAAGoc,QAAQ,IAAI,EAAE,CAAA;IAE1C,IAAIA,QAAQ,KAAK,CAAC,EAAE;EAClB,IAAA,OAAO/F,UAAU,CAACgG,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;EACtC,GAAC,MAAM;EACL,IAAA,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAACD,QAAQ,GAAG,CAAC,CAAC,CAAA;EACzE,GAAA;EACF,CAAA;;EAEA;EACO,SAASvV,YAAYA,CAACoR,GAAG,EAAE;EAChC,EAAA,IAAInC,CAAC,GAAG5S,IAAI,CAAC6S,GAAG,CACdkC,GAAG,CAAClY,IAAI,EACRkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EACbiY,GAAG,CAAChY,GAAG,EACPgY,GAAG,CAACzX,IAAI,EACRyX,GAAG,CAACxX,MAAM,EACVwX,GAAG,CAACtX,MAAM,EACVsX,GAAG,CAACnR,WACN,CAAC,CAAA;;EAED;IACA,IAAImR,GAAG,CAAClY,IAAI,GAAG,GAAG,IAAIkY,GAAG,CAAClY,IAAI,IAAI,CAAC,EAAE;EACnC+V,IAAAA,CAAC,GAAG,IAAI5S,IAAI,CAAC4S,CAAC,CAAC,CAAA;EACf;EACA;EACA;EACAA,IAAAA,CAAC,CAACE,cAAc,CAACiC,GAAG,CAAClY,IAAI,EAAEkY,GAAG,CAACjY,KAAK,GAAG,CAAC,EAAEiY,GAAG,CAAChY,GAAG,CAAC,CAAA;EACpD,GAAA;EACA,EAAA,OAAO,CAAC6V,CAAC,CAAA;EACX,CAAA;;EAEA;EACA,SAASwG,eAAeA,CAACvc,IAAI,EAAEiX,kBAAkB,EAAEH,WAAW,EAAE;EAC9D,EAAA,IAAM0F,KAAK,GAAG5F,iBAAiB,CAACd,SAAS,CAAC9V,IAAI,EAAE,CAAC,EAAEiX,kBAAkB,CAAC,EAAEH,WAAW,CAAC,CAAA;EACpF,EAAA,OAAO,CAAC0F,KAAK,GAAGvF,kBAAkB,GAAG,CAAC,CAAA;EACxC,CAAA;EAEO,SAASG,eAAeA,CAACD,QAAQ,EAAEF,kBAAkB,EAAMH,WAAW,EAAM;EAAA,EAAA,IAAzCG,kBAAkB,KAAA,KAAA,CAAA,EAAA;EAAlBA,IAAAA,kBAAkB,GAAG,CAAC,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEH,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,IAAAA,WAAW,GAAG,CAAC,CAAA;EAAA,GAAA;IAC/E,IAAM2F,UAAU,GAAGF,eAAe,CAACpF,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;IAC7E,IAAM4F,cAAc,GAAGH,eAAe,CAACpF,QAAQ,GAAG,CAAC,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;IACrF,OAAO,CAACY,UAAU,CAACP,QAAQ,CAAC,GAAGsF,UAAU,GAAGC,cAAc,IAAI,CAAC,CAAA;EACjE,CAAA;EAEO,SAASC,cAAcA,CAAC3c,IAAI,EAAE;IACnC,IAAIA,IAAI,GAAG,EAAE,EAAE;EACb,IAAA,OAAOA,IAAI,CAAA;EACb,GAAC,MAAM,OAAOA,IAAI,GAAG8N,QAAQ,CAACsH,kBAAkB,GAAG,IAAI,GAAGpV,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;EAC9E,CAAA;;EAEA;;EAEO,SAASkD,aAAaA,CAAChB,EAAE,EAAE0a,YAAY,EAAE3Z,MAAM,EAAEQ,QAAQ,EAAS;EAAA,EAAA,IAAjBA,QAAQ,KAAA,KAAA,CAAA,EAAA;EAARA,IAAAA,QAAQ,GAAG,IAAI,CAAA;EAAA,GAAA;EACrE,EAAA,IAAMY,IAAI,GAAG,IAAIlB,IAAI,CAACjB,EAAE,CAAC;EACvBwJ,IAAAA,QAAQ,GAAG;EACTzK,MAAAA,SAAS,EAAE,KAAK;EAChBjB,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,KAAK,EAAE,SAAS;EAChBC,MAAAA,GAAG,EAAE,SAAS;EACdO,MAAAA,IAAI,EAAE,SAAS;EACfC,MAAAA,MAAM,EAAE,SAAA;OACT,CAAA;EAEH,EAAA,IAAI+C,QAAQ,EAAE;MACZiI,QAAQ,CAACjI,QAAQ,GAAGA,QAAQ,CAAA;EAC9B,GAAA;IAEA,IAAMoZ,QAAQ,GAAA7T,QAAA,CAAA;EAAKlI,IAAAA,YAAY,EAAE8b,YAAAA;EAAY,GAAA,EAAKlR,QAAQ,CAAE,CAAA;IAE5D,IAAMlH,MAAM,GAAG,IAAIlB,IAAI,CAACC,cAAc,CAACN,MAAM,EAAE4Z,QAAQ,CAAC,CACrD3X,aAAa,CAACb,IAAI,CAAC,CACnByM,IAAI,CAAC,UAACC,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC1N,IAAI,CAAC2N,WAAW,EAAE,KAAK,cAAc,CAAA;KAAC,CAAA,CAAA;EACvD,EAAA,OAAOxM,MAAM,GAAGA,MAAM,CAACe,KAAK,GAAG,IAAI,CAAA;EACrC,CAAA;;EAEA;EACO,SAAS2M,YAAYA,CAAC4K,UAAU,EAAEC,YAAY,EAAE;EACrD,EAAA,IAAIC,OAAO,GAAGtX,QAAQ,CAACoX,UAAU,EAAE,EAAE,CAAC,CAAA;;EAEtC;EACA,EAAA,IAAIG,MAAM,CAAC1W,KAAK,CAACyW,OAAO,CAAC,EAAE;EACzBA,IAAAA,OAAO,GAAG,CAAC,CAAA;EACb,GAAA;IAEA,IAAME,MAAM,GAAGxX,QAAQ,CAACqX,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC;EAC5CI,IAAAA,YAAY,GAAGH,OAAO,GAAG,CAAC,IAAIxR,MAAM,CAAC4R,EAAE,CAACJ,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAACE,MAAM,GAAGA,MAAM,CAAA;EACzE,EAAA,OAAOF,OAAO,GAAG,EAAE,GAAGG,YAAY,CAAA;EACpC,CAAA;;EAEA;;EAEO,SAASE,QAAQA,CAAC9X,KAAK,EAAE;EAC9B,EAAA,IAAM+X,YAAY,GAAGL,MAAM,CAAC1X,KAAK,CAAC,CAAA;IAClC,IAAI,OAAOA,KAAK,KAAK,SAAS,IAAIA,KAAK,KAAK,EAAE,IAAI,CAAC0X,MAAM,CAACM,QAAQ,CAACD,YAAY,CAAC,EAC9E,MAAM,IAAI9d,oBAAoB,CAAuB+F,qBAAAA,GAAAA,KAAO,CAAC,CAAA;EAC/D,EAAA,OAAO+X,YAAY,CAAA;EACrB,CAAA;EAEO,SAASE,eAAeA,CAACtF,GAAG,EAAEuF,UAAU,EAAE;IAC/C,IAAMC,UAAU,GAAG,EAAE,CAAA;EACrB,EAAA,KAAK,IAAMC,CAAC,IAAIzF,GAAG,EAAE;EACnB,IAAA,IAAIwC,cAAc,CAACxC,GAAG,EAAEyF,CAAC,CAAC,EAAE;EAC1B,MAAA,IAAM7C,CAAC,GAAG5C,GAAG,CAACyF,CAAC,CAAC,CAAA;EAChB,MAAA,IAAI7C,CAAC,KAAK/W,SAAS,IAAI+W,CAAC,KAAK,IAAI,EAAE,SAAA;QACnC4C,UAAU,CAACD,UAAU,CAACE,CAAC,CAAC,CAAC,GAAGN,QAAQ,CAACvC,CAAC,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;EACA,EAAA,OAAO4C,UAAU,CAAA;EACnB,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACO,SAAStb,YAAYA,CAACE,MAAM,EAAED,MAAM,EAAE;EAC3C,EAAA,IAAMub,KAAK,GAAGlX,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;EAC7CiK,IAAAA,OAAO,GAAG7F,IAAI,CAACwV,KAAK,CAACxV,IAAI,CAACC,GAAG,CAACrE,MAAM,GAAG,EAAE,CAAC,CAAC;EAC3Cub,IAAAA,IAAI,GAAGvb,MAAM,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;EAEhC,EAAA,QAAQD,MAAM;EACZ,IAAA,KAAK,OAAO;EACV,MAAA,OAAA,EAAA,GAAUwb,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAA,GAAA,GAAI7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;EAC7D,IAAA,KAAK,QAAQ;QACX,OAAUsR,EAAAA,GAAAA,IAAI,GAAGD,KAAK,IAAGrR,OAAO,GAAG,CAAC,GAAA,GAAA,GAAOA,OAAO,GAAK,EAAE,CAAA,CAAA;EAC3D,IAAA,KAAK,QAAQ;EACX,MAAA,OAAA,EAAA,GAAUsR,IAAI,GAAG9R,QAAQ,CAAC6R,KAAK,EAAE,CAAC,CAAC,GAAG7R,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAC,CAAA;EAC5D,IAAA;EACE,MAAA,MAAM,IAAI6P,UAAU,CAAiB/Z,eAAAA,GAAAA,MAAM,yCAAsC,CAAC,CAAA;EACtF,GAAA;EACF,CAAA;EAEO,SAASgV,UAAUA,CAACa,GAAG,EAAE;EAC9B,EAAA,OAAOqC,IAAI,CAACrC,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAA;EAC/D;;EClUA;EACA;EACA;;EAEO,IAAM4F,UAAU,GAAG,CACxB,SAAS,EACT,UAAU,EACV,OAAO,EACP,OAAO,EACP,KAAK,EACL,MAAM,EACN,MAAM,EACN,QAAQ,EACR,WAAW,EACX,SAAS,EACT,UAAU,EACV,UAAU,CACX,CAAA;EAEM,IAAMC,WAAW,GAAG,CACzB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,CACN,CAAA;EAEM,IAAMC,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAEjF,SAASnO,MAAMA,CAACxK,MAAM,EAAE;EAC7B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWD,YAAY,CAAA,CAAA;EACzB,IAAA,KAAK,OAAO;QACV,OAAAC,EAAAA,CAAAA,MAAA,CAAWF,WAAW,CAAA,CAAA;EACxB,IAAA,KAAK,MAAM;QACT,OAAAE,EAAAA,CAAAA,MAAA,CAAWH,UAAU,CAAA,CAAA;EACvB,IAAA,KAAK,SAAS;QACZ,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;EACxE,IAAA,KAAK,SAAS;QACZ,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;EACjF,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,IAAMI,YAAY,GAAG,CAC1B,QAAQ,EACR,SAAS,EACT,WAAW,EACX,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,CACT,CAAA;EAEM,IAAMC,aAAa,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;EAEvE,IAAMC,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAE1D,SAAShO,QAAQA,CAAC/K,MAAM,EAAE;EAC/B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWG,cAAc,CAAA,CAAA;EAC3B,IAAA,KAAK,OAAO;QACV,OAAAH,EAAAA,CAAAA,MAAA,CAAWE,aAAa,CAAA,CAAA;EAC1B,IAAA,KAAK,MAAM;QACT,OAAAF,EAAAA,CAAAA,MAAA,CAAWC,YAAY,CAAA,CAAA;EACzB,IAAA,KAAK,SAAS;EACZ,MAAA,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;EAC5C,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,IAAM5N,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAE9B,IAAM+N,QAAQ,GAAG,CAAC,eAAe,EAAE,aAAa,CAAC,CAAA;EAEjD,IAAMC,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAE9B,IAAMC,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;EAE7B,SAAS/N,IAAIA,CAACnL,MAAM,EAAE;EAC3B,EAAA,QAAQA,MAAM;EACZ,IAAA,KAAK,QAAQ;QACX,OAAA4Y,EAAAA,CAAAA,MAAA,CAAWM,UAAU,CAAA,CAAA;EACvB,IAAA,KAAK,OAAO;QACV,OAAAN,EAAAA,CAAAA,MAAA,CAAWK,SAAS,CAAA,CAAA;EACtB,IAAA,KAAK,MAAM;QACT,OAAAL,EAAAA,CAAAA,MAAA,CAAWI,QAAQ,CAAA,CAAA;EACrB,IAAA;EACE,MAAA,OAAO,IAAI,CAAA;EACf,GAAA;EACF,CAAA;EAEO,SAASG,mBAAmBA,CAACpU,EAAE,EAAE;IACtC,OAAOkG,SAAS,CAAClG,EAAE,CAAC3J,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EACxC,CAAA;EAEO,SAASge,kBAAkBA,CAACrU,EAAE,EAAE/E,MAAM,EAAE;IAC7C,OAAO+K,QAAQ,CAAC/K,MAAM,CAAC,CAAC+E,EAAE,CAAC/J,OAAO,GAAG,CAAC,CAAC,CAAA;EACzC,CAAA;EAEO,SAASqe,gBAAgBA,CAACtU,EAAE,EAAE/E,MAAM,EAAE;IAC3C,OAAOwK,MAAM,CAACxK,MAAM,CAAC,CAAC+E,EAAE,CAACnK,KAAK,GAAG,CAAC,CAAC,CAAA;EACrC,CAAA;EAEO,SAAS0e,cAAcA,CAACvU,EAAE,EAAE/E,MAAM,EAAE;EACzC,EAAA,OAAOmL,IAAI,CAACnL,MAAM,CAAC,CAAC+E,EAAE,CAACpK,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EAC1C,CAAA;EAEO,SAAS4e,kBAAkBA,CAACrf,IAAI,EAAE6N,KAAK,EAAEE,OAAO,EAAauR,MAAM,EAAU;EAAA,EAAA,IAApCvR,OAAO,KAAA,KAAA,CAAA,EAAA;EAAPA,IAAAA,OAAO,GAAG,QAAQ,CAAA;EAAA,GAAA;EAAA,EAAA,IAAEuR,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,KAAK,CAAA;EAAA,GAAA;EAChF,EAAA,IAAMC,KAAK,GAAG;EACZC,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBC,IAAAA,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;EAC7BnP,IAAAA,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;EACxBoP,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBC,IAAAA,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;EAC5BtB,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;EACtBrR,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;EAC3B4S,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAA;KAC3B,CAAA;EAED,EAAA,IAAMC,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC/V,OAAO,CAAC9J,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;EAErE,EAAA,IAAI+N,OAAO,KAAK,MAAM,IAAI8R,QAAQ,EAAE;EAClC,IAAA,IAAMC,KAAK,GAAG9f,IAAI,KAAK,MAAM,CAAA;EAC7B,IAAA,QAAQ6N,KAAK;EACX,MAAA,KAAK,CAAC;UACJ,OAAOiS,KAAK,GAAG,UAAU,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EACtD,MAAA,KAAK,CAAC,CAAC;UACL,OAAO8f,KAAK,GAAG,WAAW,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EACvD,MAAA,KAAK,CAAC;UACJ,OAAO8f,KAAK,GAAG,OAAO,GAAWP,OAAAA,GAAAA,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAG,CAAA;EAErD,KAAA;EACF,GAAA;;EAEA,EAAA,IAAM+f,QAAQ,GAAG9T,MAAM,CAAC4R,EAAE,CAAChQ,KAAK,EAAE,CAAC,CAAC,CAAC,IAAIA,KAAK,GAAG,CAAC;EAChDmS,IAAAA,QAAQ,GAAG7Y,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC;MAC1BoS,QAAQ,GAAGD,QAAQ,KAAK,CAAC;EACzBE,IAAAA,QAAQ,GAAGX,KAAK,CAACvf,IAAI,CAAC;EACtBmgB,IAAAA,OAAO,GAAGb,MAAM,GACZW,QAAQ,GACNC,QAAQ,CAAC,CAAC,CAAC,GACXA,QAAQ,CAAC,CAAC,CAAC,IAAIA,QAAQ,CAAC,CAAC,CAAC,GAC5BD,QAAQ,GACRV,KAAK,CAACvf,IAAI,CAAC,CAAC,CAAC,CAAC,GACdA,IAAI,CAAA;IACV,OAAO+f,QAAQ,GAAMC,QAAQ,GAAA,GAAA,GAAIG,OAAO,GAAeH,MAAAA,GAAAA,KAAAA,GAAAA,QAAQ,SAAIG,OAAS,CAAA;EAC9E;;ECjKA,SAASC,eAAeA,CAACC,MAAM,EAAEC,aAAa,EAAE;IAC9C,IAAIhgB,CAAC,GAAG,EAAE,CAAA;EACV,EAAA,KAAA,IAAAigB,SAAA,GAAAC,+BAAA,CAAoBH,MAAM,CAAA,EAAAI,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAAjBC,KAAK,GAAAF,KAAA,CAAAza,KAAA,CAAA;MACd,IAAI2a,KAAK,CAACC,OAAO,EAAE;QACjBtgB,CAAC,IAAIqgB,KAAK,CAACE,GAAG,CAAA;EAChB,KAAC,MAAM;EACLvgB,MAAAA,CAAC,IAAIggB,aAAa,CAACK,KAAK,CAACE,GAAG,CAAC,CAAA;EAC/B,KAAA;EACF,GAAA;EACA,EAAA,OAAOvgB,CAAC,CAAA;EACV,CAAA;EAEA,IAAMwgB,uBAAsB,GAAG;IAC7BC,CAAC,EAAEC,UAAkB;IACrBC,EAAE,EAAED,QAAgB;IACpBE,GAAG,EAAEF,SAAiB;IACtBG,IAAI,EAAEH,SAAiB;IACvB/K,CAAC,EAAE+K,WAAmB;IACtBI,EAAE,EAAEJ,iBAAyB;IAC7BK,GAAG,EAAEL,sBAA8B;IACnCM,IAAI,EAAEN,qBAA6B;IACnCO,CAAC,EAAEP,cAAsB;IACzBQ,EAAE,EAAER,oBAA4B;IAChCS,GAAG,EAAET,yBAAiC;IACtCU,IAAI,EAAEV,wBAAgC;IACtCrW,CAAC,EAAEqW,cAAsB;IACzBW,EAAE,EAAEX,YAAoB;IACxBY,GAAG,EAAEZ,aAAqB;IAC1Ba,IAAI,EAAEb,aAAqB;IAC3Bc,CAAC,EAAEd,2BAAmC;IACtCe,EAAE,EAAEf,yBAAiC;IACrCgB,GAAG,EAAEhB,0BAAkC;IACvCiB,IAAI,EAAEjB,0BAAQ1e;EAChB,CAAC,CAAA;;EAED;EACA;EACA;EAFA,IAIqB4f,SAAS,gBAAA,YAAA;IAAAA,SAAA,CACrB5b,MAAM,GAAb,SAAAA,OAAc5C,MAAM,EAAEd,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,OAAO,IAAIsf,SAAS,CAACxe,MAAM,EAAEd,IAAI,CAAC,CAAA;KACnC,CAAA;EAAAsf,EAAAA,SAAA,CAEMC,WAAW,GAAlB,SAAAA,WAAAA,CAAmBC,GAAG,EAAE;EACtB;EACA;;MAEA,IAAIC,OAAO,GAAG,IAAI;EAChBC,MAAAA,WAAW,GAAG,EAAE;EAChBC,MAAAA,SAAS,GAAG,KAAK,CAAA;MACnB,IAAMlC,MAAM,GAAG,EAAE,CAAA;EACjB,IAAA,KAAK,IAAIxa,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGuc,GAAG,CAACtc,MAAM,EAAED,CAAC,EAAE,EAAE;EACnC,MAAA,IAAM2c,CAAC,GAAGJ,GAAG,CAACK,MAAM,CAAC5c,CAAC,CAAC,CAAA;QACvB,IAAI2c,CAAC,KAAK,GAAG,EAAE;EACb;EACA,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,IAAIyc,SAAS,EAAE;YACvClC,MAAM,CAACrV,IAAI,CAAC;cACV4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;EAC/CzB,YAAAA,GAAG,EAAEyB,WAAW,KAAK,EAAE,GAAG,GAAG,GAAGA,WAAAA;EAClC,WAAC,CAAC,CAAA;EACJ,SAAA;EACAD,QAAAA,OAAO,GAAG,IAAI,CAAA;EACdC,QAAAA,WAAW,GAAG,EAAE,CAAA;UAChBC,SAAS,GAAG,CAACA,SAAS,CAAA;SACvB,MAAM,IAAIA,SAAS,EAAE;EACpBD,QAAAA,WAAW,IAAIE,CAAC,CAAA;EAClB,OAAC,MAAM,IAAIA,CAAC,KAAKH,OAAO,EAAE;EACxBC,QAAAA,WAAW,IAAIE,CAAC,CAAA;EAClB,OAAC,MAAM;EACL,QAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;YAC1Bua,MAAM,CAACrV,IAAI,CAAC;EAAE4V,YAAAA,OAAO,EAAE,OAAO,CAAC8B,IAAI,CAACJ,WAAW,CAAC;EAAEzB,YAAAA,GAAG,EAAEyB,WAAAA;EAAY,WAAC,CAAC,CAAA;EACvE,SAAA;EACAA,QAAAA,WAAW,GAAGE,CAAC,CAAA;EACfH,QAAAA,OAAO,GAAGG,CAAC,CAAA;EACb,OAAA;EACF,KAAA;EAEA,IAAA,IAAIF,WAAW,CAACxc,MAAM,GAAG,CAAC,EAAE;QAC1Bua,MAAM,CAACrV,IAAI,CAAC;UAAE4V,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;EAAEzB,QAAAA,GAAG,EAAEyB,WAAAA;EAAY,OAAC,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,OAAOjC,MAAM,CAAA;KACd,CAAA;EAAA6B,EAAAA,SAAA,CAEMpB,sBAAsB,GAA7B,SAAAA,sBAAAA,CAA8BH,KAAK,EAAE;MACnC,OAAOG,uBAAsB,CAACH,KAAK,CAAC,CAAA;KACrC,CAAA;EAED,EAAA,SAAAuB,SAAYxe,CAAAA,MAAM,EAAEif,UAAU,EAAE;MAC9B,IAAI,CAAC/f,IAAI,GAAG+f,UAAU,CAAA;MACtB,IAAI,CAACxX,GAAG,GAAGzH,MAAM,CAAA;MACjB,IAAI,CAACkf,SAAS,GAAG,IAAI,CAAA;EACvB,GAAA;EAAC,EAAA,IAAApgB,MAAA,GAAA0f,SAAA,CAAAzf,SAAA,CAAA;IAAAD,MAAA,CAEDqgB,uBAAuB,GAAvB,SAAAA,wBAAwBhY,EAAE,EAAEjI,IAAI,EAAE;EAChC,IAAA,IAAI,IAAI,CAACggB,SAAS,KAAK,IAAI,EAAE;QAC3B,IAAI,CAACA,SAAS,GAAG,IAAI,CAACzX,GAAG,CAACkF,iBAAiB,EAAE,CAAA;EAC/C,KAAA;EACA,IAAA,IAAMe,EAAE,GAAG,IAAI,CAACwR,SAAS,CAAChS,WAAW,CAAC/F,EAAE,EAAApB,QAAA,KAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;EACpE,IAAA,OAAOwO,EAAE,CAACtO,MAAM,EAAE,CAAA;KACnB,CAAA;IAAAN,MAAA,CAEDoO,WAAW,GAAX,SAAAA,YAAY/F,EAAE,EAAEjI,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACvB,IAAA,OAAO,IAAI,CAACuI,GAAG,CAACyF,WAAW,CAAC/F,EAAE,EAAApB,QAAA,CAAA,EAAA,EAAO,IAAI,CAAC7G,IAAI,EAAKA,IAAI,CAAE,CAAC,CAAA;KAC3D,CAAA;IAAAJ,MAAA,CAEDsgB,cAAc,GAAd,SAAAA,eAAejY,EAAE,EAAEjI,IAAI,EAAE;MACvB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACE,MAAM,EAAE,CAAA;KAC3C,CAAA;IAAAN,MAAA,CAEDugB,mBAAmB,GAAnB,SAAAA,oBAAoBlY,EAAE,EAAEjI,IAAI,EAAE;MAC5B,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAAC+C,aAAa,EAAE,CAAA;KAClD,CAAA;IAAAnD,MAAA,CAEDwgB,cAAc,GAAd,SAAAA,eAAeC,QAAQ,EAAErgB,IAAI,EAAE;MAC7B,IAAMwO,EAAE,GAAG,IAAI,CAACR,WAAW,CAACqS,QAAQ,CAACC,KAAK,EAAEtgB,IAAI,CAAC,CAAA;MACjD,OAAOwO,EAAE,CAAC7M,GAAG,CAAC4e,WAAW,CAACF,QAAQ,CAACC,KAAK,CAAC9V,QAAQ,EAAE,EAAE6V,QAAQ,CAACG,GAAG,CAAChW,QAAQ,EAAE,CAAC,CAAA;KAC9E,CAAA;IAAA5K,MAAA,CAEDyB,eAAe,GAAf,SAAAA,gBAAgB4G,EAAE,EAAEjI,IAAI,EAAE;MACxB,OAAO,IAAI,CAACgO,WAAW,CAAC/F,EAAE,EAAEjI,IAAI,CAAC,CAACqB,eAAe,EAAE,CAAA;KACpD,CAAA;IAAAzB,MAAA,CAED6gB,GAAG,GAAH,SAAAA,GAAAA,CAAIhjB,CAAC,EAAEijB,CAAC,EAAMC,WAAW,EAAc;EAAA,IAAA,IAAhCD,CAAC,KAAA,KAAA,CAAA,EAAA;EAADA,MAAAA,CAAC,GAAG,CAAC,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEC,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG/e,SAAS,CAAA;EAAA,KAAA;EACnC;EACA,IAAA,IAAI,IAAI,CAAC5B,IAAI,CAACgJ,WAAW,EAAE;EACzB,MAAA,OAAOY,QAAQ,CAACnM,CAAC,EAAEijB,CAAC,CAAC,CAAA;EACvB,KAAA;EAEA,IAAA,IAAM1gB,IAAI,GAAA6G,QAAA,KAAQ,IAAI,CAAC7G,IAAI,CAAE,CAAA;MAE7B,IAAI0gB,CAAC,GAAG,CAAC,EAAE;QACT1gB,IAAI,CAACiJ,KAAK,GAAGyX,CAAC,CAAA;EAChB,KAAA;EACA,IAAA,IAAIC,WAAW,EAAE;QACf3gB,IAAI,CAAC2gB,WAAW,GAAGA,WAAW,CAAA;EAChC,KAAA;EAEA,IAAA,OAAO,IAAI,CAACpY,GAAG,CAACuG,eAAe,CAAC9O,IAAI,CAAC,CAACE,MAAM,CAACzC,CAAC,CAAC,CAAA;KAChD,CAAA;IAAAmC,MAAA,CAEDghB,wBAAwB,GAAxB,SAAAA,yBAAyB3Y,EAAE,EAAEuX,GAAG,EAAE;EAAA,IAAA,IAAAvb,KAAA,GAAA,IAAA,CAAA;MAChC,IAAM4c,YAAY,GAAG,IAAI,CAACtY,GAAG,CAACI,WAAW,EAAE,KAAK,IAAI;EAClDmY,MAAAA,oBAAoB,GAAG,IAAI,CAACvY,GAAG,CAACX,cAAc,IAAI,IAAI,CAACW,GAAG,CAACX,cAAc,KAAK,SAAS;EACvFwR,MAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIpZ,IAAI,EAAE+N,OAAO,EAAA;UAAA,OAAK9J,KAAI,CAACsE,GAAG,CAACwF,OAAO,CAAC9F,EAAE,EAAEjI,IAAI,EAAE+N,OAAO,CAAC,CAAA;EAAA,OAAA;EAC/D9N,MAAAA,YAAY,GAAG,SAAfA,YAAYA,CAAID,IAAI,EAAK;EACvB,QAAA,IAAIiI,EAAE,CAAC8Y,aAAa,IAAI9Y,EAAE,CAAC9H,MAAM,KAAK,CAAC,IAAIH,IAAI,CAACghB,MAAM,EAAE;EACtD,UAAA,OAAO,GAAG,CAAA;EACZ,SAAA;EAEA,QAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GAAGhZ,EAAE,CAACtE,IAAI,CAAC1D,YAAY,CAACgI,EAAE,CAAClI,EAAE,EAAEC,IAAI,CAACE,MAAM,CAAC,GAAG,EAAE,CAAA;SAClE;QACDghB,QAAQ,GAAG,SAAXA,QAAQA,GAAA;UAAA,OACNL,YAAY,GACR3V,mBAA2B,CAACjD,EAAE,CAAC,GAC/BmR,MAAM,CAAC;EAAE9a,UAAAA,IAAI,EAAE,SAAS;EAAEQ,UAAAA,SAAS,EAAE,KAAA;WAAO,EAAE,WAAW,CAAC,CAAA;EAAA,OAAA;EAChEhB,MAAAA,KAAK,GAAG,SAARA,KAAKA,CAAIoF,MAAM,EAAE2J,UAAU,EAAA;EAAA,QAAA,OACzBgU,YAAY,GACR3V,gBAAwB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACpCkW,MAAM,CAACvM,UAAU,GAAG;EAAE/O,UAAAA,KAAK,EAAEoF,MAAAA;EAAO,SAAC,GAAG;EAAEpF,UAAAA,KAAK,EAAEoF,MAAM;EAAEnF,UAAAA,GAAG,EAAE,SAAA;WAAW,EAAE,OAAO,CAAC,CAAA;EAAA,OAAA;EACzFG,MAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAIgF,MAAM,EAAE2J,UAAU,EAAA;EAAA,QAAA,OAC3BgU,YAAY,GACR3V,kBAA0B,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GACtCkW,MAAM,CACJvM,UAAU,GAAG;EAAE3O,UAAAA,OAAO,EAAEgF,MAAAA;EAAO,SAAC,GAAG;EAAEhF,UAAAA,OAAO,EAAEgF,MAAM;EAAEpF,UAAAA,KAAK,EAAE,MAAM;EAAEC,UAAAA,GAAG,EAAE,SAAA;WAAW,EACrF,SACF,CAAC,CAAA;EAAA,OAAA;EACPojB,MAAAA,UAAU,GAAG,SAAbA,UAAUA,CAAIpD,KAAK,EAAK;EACtB,QAAA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAAC,CAAA;EAC1D,QAAA,IAAIgC,UAAU,EAAE;EACd,UAAA,OAAO9b,KAAI,CAACgc,uBAAuB,CAAChY,EAAE,EAAE8X,UAAU,CAAC,CAAA;EACrD,SAAC,MAAM;EACL,UAAA,OAAOhC,KAAK,CAAA;EACd,SAAA;SACD;EACDjc,MAAAA,GAAG,GAAG,SAANA,GAAGA,CAAIoB,MAAM,EAAA;EAAA,QAAA,OACX2d,YAAY,GAAG3V,cAAsB,CAACjD,EAAE,EAAE/E,MAAM,CAAC,GAAGkW,MAAM,CAAC;EAAEtX,UAAAA,GAAG,EAAEoB,MAAAA;WAAQ,EAAE,KAAK,CAAC,CAAA;EAAA,OAAA;EACpFwa,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIK,KAAK,EAAK;EACzB;EACA,QAAA,QAAQA,KAAK;EACX;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAO9Z,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,CAAC,CAAA;EACjC,UAAA,KAAK,GAAG,CAAA;EACR;EACA,UAAA,KAAK,KAAK;cACR,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACrD,WAAW,EAAE,CAAC,CAAC,CAAA;EACpC;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,CAAC,CAAA;EAC5B,UAAA,KAAK,IAAI;cACP,OAAOwF,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACxJ,MAAM,EAAE,CAAC,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,IAAI;EACP,YAAA,OAAOwF,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EACrD,UAAA,KAAK,KAAK;EACR,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAACrD,WAAW,GAAG,GAAG,CAAC,CAAC,CAAA;EACnD;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAOX,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,CAAC,CAAA;EAC5B,UAAA,KAAK,IAAI;cACP,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC1J,MAAM,EAAE,CAAC,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,GAAG;EACN,YAAA,OAAO0F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,CAAC,CAAA;EACzD,UAAA,KAAK,IAAI;cACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG2J,EAAE,CAAC3J,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;EAC5D,UAAA,KAAK,GAAG;EACN,YAAA,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,CAAC,CAAA;EAC1B,UAAA,KAAK,IAAI;cACP,OAAO2F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC3J,IAAI,EAAE,CAAC,CAAC,CAAA;EAC7B;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAO2B,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,QAAQ;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACrE,UAAA,KAAK,IAAI;EACP;EACA,YAAA,OAAO/gB,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,OAAO;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACpE,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAO/gB,YAAY,CAAC;EAAEC,cAAAA,MAAM,EAAE,QAAQ;EAAE8gB,cAAAA,MAAM,EAAE/c,KAAI,CAACjE,IAAI,CAACghB,MAAAA;EAAO,aAAC,CAAC,CAAA;EACrE,UAAA,KAAK,MAAM;EACT;cACA,OAAO/Y,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;EAAEG,cAAAA,MAAM,EAAE,OAAO;EAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;EAAO,aAAC,CAAC,CAAA;EAChF,UAAA,KAAK,OAAO;EACV;cACA,OAAOmH,EAAE,CAACtE,IAAI,CAAC7D,UAAU,CAACmI,EAAE,CAAClI,EAAE,EAAE;EAAEG,cAAAA,MAAM,EAAE,MAAM;EAAEY,cAAAA,MAAM,EAAEmD,KAAI,CAACsE,GAAG,CAACzH,MAAAA;EAAO,aAAC,CAAC,CAAA;EAC/E;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOmH,EAAE,CAACvG,QAAQ,CAAA;EACpB;EACA,UAAA,KAAK,GAAG;cACN,OAAOwf,QAAQ,EAAE,CAAA;EACnB;EACA,UAAA,KAAK,GAAG;cACN,OAAOJ,oBAAoB,GAAG1H,MAAM,CAAC;EAAErb,cAAAA,GAAG,EAAE,SAAA;eAAW,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,CAAC,CAAA;EACpF,UAAA,KAAK,IAAI;cACP,OAAO+iB,oBAAoB,GAAG1H,MAAM,CAAC;EAAErb,cAAAA,GAAG,EAAE,SAAA;EAAU,aAAC,EAAE,KAAK,CAAC,GAAGkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClK,GAAG,EAAE,CAAC,CAAC,CAAA;EACvF;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAOkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;EAC/B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;EAC9B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;EAChC;EACA,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAO+F,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC/J,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;EAChC,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;EAC/B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;EACjC;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAO4iB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAS;EAAEC,cAAAA,GAAG,EAAE,SAAA;eAAW,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;EACxB,UAAA,KAAK,IAAI;EACP;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAS;EAAEC,cAAAA,GAAG,EAAE,SAAA;EAAU,aAAC,EAAE,OAAO,CAAC,GACrDkG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;EAC3B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;EAC7B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;EAC5B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;EAC9B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAA;eAAW,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,CAAC,CAAA;EACxB,UAAA,KAAK,IAAI;EACP;cACA,OAAOgjB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEtb,cAAAA,KAAK,EAAE,SAAA;EAAU,aAAC,EAAE,OAAO,CAAC,GACrCmG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACnK,KAAK,EAAE,CAAC,CAAC,CAAA;EAC3B,UAAA,KAAK,KAAK;EACR;EACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;EAC9B,UAAA,KAAK,MAAM;EACT;EACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;EAC7B,UAAA,KAAK,OAAO;EACV;EACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;EAC/B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOgjB,oBAAoB,GAAG1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;eAAW,EAAE,MAAM,CAAC,GAAGoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC,CAAA;EACvF,UAAA,KAAK,IAAI;EACP;cACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;eAAW,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,CAAC2R,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/C,UAAA,KAAK,MAAM;EACT;cACA,OAAON,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;EAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;EAC1B,UAAA,KAAK,QAAQ;EACX;cACA,OAAOijB,oBAAoB,GACvB1H,MAAM,CAAC;EAAEvb,cAAAA,IAAI,EAAE,SAAA;EAAU,aAAC,EAAE,MAAM,CAAC,GACnCoG,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACpK,IAAI,EAAE,CAAC,CAAC,CAAA;EAC1B;EACA,UAAA,KAAK,GAAG;EACN;cACA,OAAOiE,GAAG,CAAC,OAAO,CAAC,CAAA;EACrB,UAAA,KAAK,IAAI;EACP;cACA,OAAOA,GAAG,CAAC,MAAM,CAAC,CAAA;EACpB,UAAA,KAAK,OAAO;cACV,OAAOA,GAAG,CAAC,QAAQ,CAAC,CAAA;EACtB,UAAA,KAAK,IAAI;EACP,YAAA,OAAOmC,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,CAACxF,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EACtD,UAAA,KAAK,MAAM;cACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC+M,QAAQ,EAAE,CAAC,CAAC,CAAA;EACjC,UAAA,KAAK,GAAG;EACN,YAAA,OAAO/Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,CAAC,CAAA;EAChC,UAAA,KAAK,IAAI;cACP,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAC8M,UAAU,EAAE,CAAC,CAAC,CAAA;EACnC,UAAA,KAAK,GAAG;EACN,YAAA,OAAO9Q,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,CAAC,CAAA;EACrC,UAAA,KAAK,IAAI;cACP,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACiO,eAAe,EAAE,CAAC,CAAC,CAAA;EACxC,UAAA,KAAK,IAAI;EACP,YAAA,OAAOjS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,CAAC3G,QAAQ,EAAE,CAAC4R,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAC3D,UAAA,KAAK,MAAM;cACT,OAAOnd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACkO,aAAa,EAAE,CAAC,CAAC,CAAA;EACtC,UAAA,KAAK,GAAG;EACN,YAAA,OAAOlS,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,KAAK;cACR,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoM,OAAO,EAAE,CAAC,CAAC,CAAA;EAChC,UAAA,KAAK,GAAG;EACN;EACA,YAAA,OAAOpQ,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,CAAC,CAAA;EAC7B,UAAA,KAAK,IAAI;EACP;cACA,OAAOpd,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAACoZ,OAAO,EAAE,CAAC,CAAC,CAAA;EAChC,UAAA,KAAK,GAAG;EACN,YAAA,OAAOpd,KAAI,CAACwc,GAAG,CAAClc,IAAI,CAAC2E,KAAK,CAACjB,EAAE,CAAClI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;EAC3C,UAAA,KAAK,GAAG;EACN,YAAA,OAAOkE,KAAI,CAACwc,GAAG,CAACxY,EAAE,CAAClI,EAAE,CAAC,CAAA;EACxB,UAAA;cACE,OAAOohB,UAAU,CAACpD,KAAK,CAAC,CAAA;EAC5B,SAAA;SACD,CAAA;MAEH,OAAOP,eAAe,CAAC8B,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9B,aAAa,CAAC,CAAA;KAClE,CAAA;IAAA9d,MAAA,CAED0hB,wBAAwB,GAAxB,SAAAA,yBAAyBC,GAAG,EAAE/B,GAAG,EAAE;EAAA,IAAA,IAAA7R,MAAA,GAAA,IAAA,CAAA;EACjC,IAAA,IAAM6T,aAAa,GAAG,IAAI,CAACxhB,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;EAC3E,IAAA,IAAMC,YAAY,GAAG,SAAfA,YAAYA,CAAI3D,KAAK,EAAK;UAC5B,QAAQA,KAAK,CAAC,CAAC,CAAC;EACd,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,cAAc,CAAA;EACvB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,SAAS,CAAA;EAClB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,SAAS,CAAA;EAClB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,MAAM,CAAA;EACf,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,QAAQ,CAAA;EACjB,UAAA,KAAK,GAAG;EACN,YAAA,OAAO,OAAO,CAAA;EAChB,UAAA;EACE,YAAA,OAAO,IAAI,CAAA;EACf,SAAA;SACD;EACDL,MAAAA,aAAa,GAAG,SAAhBA,aAAaA,CAAIiE,MAAM,EAAEC,IAAI,EAAA;UAAA,OAAK,UAAC7D,KAAK,EAAK;EAC3C,UAAA,IAAM8D,MAAM,GAAGH,YAAY,CAAC3D,KAAK,CAAC,CAAA;EAClC,UAAA,IAAI8D,MAAM,EAAE;EACV,YAAA,IAAMC,eAAe,GACnBF,IAAI,CAACG,kBAAkB,IAAIF,MAAM,KAAKD,IAAI,CAACI,WAAW,GAAGR,aAAa,GAAG,CAAC,CAAA;EAC5E,YAAA,IAAIb,WAAW,CAAA;EACf,YAAA,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,qBAAqB,IAAII,MAAM,KAAKD,IAAI,CAACI,WAAW,EAAE;EAC/ErB,cAAAA,WAAW,GAAG,OAAO,CAAA;eACtB,MAAM,IAAIhT,MAAI,CAAC3N,IAAI,CAACyhB,QAAQ,KAAK,KAAK,EAAE;EACvCd,cAAAA,WAAW,GAAG,QAAQ,CAAA;EACxB,aAAC,MAAM;EACL;EACAA,cAAAA,WAAW,GAAG,MAAM,CAAA;EACtB,aAAA;EACA,YAAA,OAAOhT,MAAI,CAAC8S,GAAG,CAACkB,MAAM,CAACnhB,GAAG,CAACqhB,MAAM,CAAC,GAAGC,eAAe,EAAE/D,KAAK,CAAC7a,MAAM,EAAEyd,WAAW,CAAC,CAAA;EAClF,WAAC,MAAM;EACL,YAAA,OAAO5C,KAAK,CAAA;EACd,WAAA;WACD,CAAA;EAAA,OAAA;EACDkE,MAAAA,MAAM,GAAG3C,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC;QACnC0C,UAAU,GAAGD,MAAM,CAACjK,MAAM,CACxB,UAACmK,KAAK,EAAAthB,IAAA,EAAA;EAAA,QAAA,IAAImd,OAAO,GAAAnd,IAAA,CAAPmd,OAAO;YAAEC,GAAG,GAAApd,IAAA,CAAHod,GAAG,CAAA;UAAA,OAAQD,OAAO,GAAGmE,KAAK,GAAGA,KAAK,CAACrG,MAAM,CAACmC,GAAG,CAAC,CAAA;SAAC,EAClE,EACF,CAAC;EACDmE,MAAAA,SAAS,GAAGb,GAAG,CAACc,OAAO,CAAAlmB,KAAA,CAAXolB,GAAG,EAAYW,UAAU,CAAC5X,GAAG,CAACoX,YAAY,CAAC,CAACY,MAAM,CAAC,UAACjP,CAAC,EAAA;EAAA,QAAA,OAAKA,CAAC,CAAA;EAAA,OAAA,CAAC,CAAC;EACzEkP,MAAAA,YAAY,GAAG;UACbR,kBAAkB,EAAEK,SAAS,GAAG,CAAC;EACjC;EACA;UACAJ,WAAW,EAAE3Y,MAAM,CAACC,IAAI,CAAC8Y,SAAS,CAACI,MAAM,CAAC,CAAC,CAAC,CAAA;SAC7C,CAAA;MACH,OAAOhF,eAAe,CAACyE,MAAM,EAAEvE,aAAa,CAAC0E,SAAS,EAAEG,YAAY,CAAC,CAAC,CAAA;KACvE,CAAA;EAAA,EAAA,OAAAjD,SAAA,CAAA;EAAA,CAAA,EAAA;;ECpaH;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA,IAAMmD,SAAS,GAAG,8EAA8E,CAAA;EAEhG,SAASC,cAAcA,GAAa;EAAA,EAAA,KAAA,IAAAC,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAT0f,OAAO,GAAAlL,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAAPD,IAAAA,OAAO,CAAAC,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,GAAA;IAChC,IAAMC,IAAI,GAAGF,OAAO,CAAC5K,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;EAAA,IAAA,OAAK9H,CAAC,GAAG8H,CAAC,CAACkT,MAAM,CAAA;EAAA,GAAA,EAAE,EAAE,CAAC,CAAA;EACvD,EAAA,OAAOhQ,MAAM,CAAA,GAAA,GAAK+P,IAAI,GAAA,GAAG,CAAC,CAAA;EAC5B,CAAA;EAEA,SAASE,iBAAiBA,GAAgB;EAAA,EAAA,KAAA,IAAAC,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAZggB,UAAU,GAAAxL,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAVD,IAAAA,UAAU,CAAAC,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,GAAA;EACtC,EAAA,OAAO,UAACvU,CAAC,EAAA;MAAA,OACPsU,UAAU,CACPlL,MAAM,CACL,UAAAnX,IAAA,EAAmCuiB,EAAE,EAAK;QAAA,IAAxCC,UAAU,GAAAxiB,IAAA,CAAA,CAAA,CAAA;EAAEyiB,QAAAA,UAAU,GAAAziB,IAAA,CAAA,CAAA,CAAA;EAAE0iB,QAAAA,MAAM,GAAA1iB,IAAA,CAAA,CAAA,CAAA,CAAA;EAC9B,MAAA,IAAA2iB,GAAA,GAA0BJ,EAAE,CAACxU,CAAC,EAAE2U,MAAM,CAAC;EAAhCtF,QAAAA,GAAG,GAAAuF,GAAA,CAAA,CAAA,CAAA;EAAE7f,QAAAA,IAAI,GAAA6f,GAAA,CAAA,CAAA,CAAA;EAAEtL,QAAAA,IAAI,GAAAsL,GAAA,CAAA,CAAA,CAAA,CAAA;EACtB,MAAA,OAAO,CAAA3c,QAAA,CAAMwc,EAAAA,EAAAA,UAAU,EAAKpF,GAAG,CAAIta,EAAAA,IAAI,IAAI2f,UAAU,EAAEpL,IAAI,CAAC,CAAA;EAC9D,KAAC,EACD,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CACd,CAAC,CACAkJ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAAA,GAAA,CAAA;EAClB,CAAA;EAEA,SAASqC,KAAKA,CAAC/lB,CAAC,EAAe;IAC7B,IAAIA,CAAC,IAAI,IAAI,EAAE;EACb,IAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EACrB,GAAA;IAAC,KAAAgmB,IAAAA,KAAA,GAAAtnB,SAAA,CAAA8G,MAAA,EAHkBygB,QAAQ,OAAAjM,KAAA,CAAAgM,KAAA,GAAAA,CAAAA,GAAAA,KAAA,WAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAARD,IAAAA,QAAQ,CAAAC,KAAA,GAAAxnB,CAAAA,CAAAA,GAAAA,SAAA,CAAAwnB,KAAA,CAAA,CAAA;EAAA,GAAA;EAK3B,EAAA,KAAA,IAAAC,EAAA,GAAA,CAAA,EAAAC,SAAA,GAAiCH,QAAQ,EAAAE,EAAA,GAAAC,SAAA,CAAA5gB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAtC,IAAA,IAAAE,YAAA,GAAAD,SAAA,CAAAD,EAAA,CAAA;EAAO/Q,MAAAA,KAAK,GAAAiR,YAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,SAAS,GAAAD,YAAA,CAAA,CAAA,CAAA,CAAA;EAC1B,IAAA,IAAMnV,CAAC,GAAGkE,KAAK,CAACxQ,IAAI,CAAC5E,CAAC,CAAC,CAAA;EACvB,IAAA,IAAIkR,CAAC,EAAE;QACL,OAAOoV,SAAS,CAACpV,CAAC,CAAC,CAAA;EACrB,KAAA;EACF,GAAA;EACA,EAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EACrB,CAAA;EAEA,SAASqV,WAAWA,GAAU;EAAA,EAAA,KAAA,IAAAC,KAAA,GAAA9nB,SAAA,CAAA8G,MAAA,EAANoG,IAAI,GAAAoO,IAAAA,KAAA,CAAAwM,KAAA,GAAAC,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAD,KAAA,EAAAC,KAAA,EAAA,EAAA;EAAJ7a,IAAAA,IAAI,CAAA6a,KAAA,CAAA/nB,GAAAA,SAAA,CAAA+nB,KAAA,CAAA,CAAA;EAAA,GAAA;EAC1B,EAAA,OAAO,UAACrU,KAAK,EAAEyT,MAAM,EAAK;MACxB,IAAMa,GAAG,GAAG,EAAE,CAAA;EACd,IAAA,IAAInhB,CAAC,CAAA;EAEL,IAAA,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqG,IAAI,CAACpG,MAAM,EAAED,CAAC,EAAE,EAAE;EAChCmhB,MAAAA,GAAG,CAAC9a,IAAI,CAACrG,CAAC,CAAC,CAAC,GAAGkW,YAAY,CAACrJ,KAAK,CAACyT,MAAM,GAAGtgB,CAAC,CAAC,CAAC,CAAA;EAChD,KAAA;MACA,OAAO,CAACmhB,GAAG,EAAE,IAAI,EAAEb,MAAM,GAAGtgB,CAAC,CAAC,CAAA;KAC/B,CAAA;EACH,CAAA;;EAEA;EACA,IAAMohB,WAAW,GAAG,oCAAoC,CAAA;EACxD,IAAMC,eAAe,WAASD,WAAW,CAACtB,MAAM,GAAWN,UAAAA,GAAAA,SAAS,CAACM,MAAM,GAAU,UAAA,CAAA;EACrF,IAAMwB,gBAAgB,GAAG,qDAAqD,CAAA;EAC9E,IAAMC,YAAY,GAAGzR,MAAM,CAAA,EAAA,GAAIwR,gBAAgB,CAACxB,MAAM,GAAGuB,eAAiB,CAAC,CAAA;EAC3E,IAAMG,qBAAqB,GAAG1R,MAAM,CAAA,SAAA,GAAWyR,YAAY,CAACzB,MAAM,OAAI,CAAC,CAAA;EACvE,IAAM2B,WAAW,GAAG,6CAA6C,CAAA;EACjE,IAAMC,YAAY,GAAG,6BAA6B,CAAA;EAClD,IAAMC,eAAe,GAAG,kBAAkB,CAAA;EAC1C,IAAMC,kBAAkB,GAAGZ,WAAW,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAA;EAC3E,IAAMa,qBAAqB,GAAGb,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;EAC5D,IAAMc,WAAW,GAAG,uBAAuB,CAAC;EAC5C,IAAMC,YAAY,GAAGjS,MAAM,CACtBwR,gBAAgB,CAACxB,MAAM,GAAA,OAAA,GAAQsB,WAAW,CAACtB,MAAM,GAAKN,IAAAA,GAAAA,SAAS,CAACM,MAAM,QAC3E,CAAC,CAAA;EACD,IAAMkC,qBAAqB,GAAGlS,MAAM,CAAA,MAAA,GAAQiS,YAAY,CAACjC,MAAM,OAAI,CAAC,CAAA;EAEpE,SAASmC,GAAGA,CAACpV,KAAK,EAAEzM,GAAG,EAAE8hB,QAAQ,EAAE;EACjC,EAAA,IAAMvW,CAAC,GAAGkB,KAAK,CAACzM,GAAG,CAAC,CAAA;IACpB,OAAOC,WAAW,CAACsL,CAAC,CAAC,GAAGuW,QAAQ,GAAGhM,YAAY,CAACvK,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,SAASwW,aAAaA,CAACtV,KAAK,EAAEyT,MAAM,EAAE;EACpC,EAAA,IAAM8B,IAAI,GAAG;EACXxnB,IAAAA,IAAI,EAAEqnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,CAAC;MACxBzlB,KAAK,EAAEonB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAChCxlB,GAAG,EAAEmnB,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;KAC9B,CAAA;IAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;EACjC,CAAA;EAEA,SAAS+B,cAAcA,CAACxV,KAAK,EAAEyT,MAAM,EAAE;EACrC,EAAA,IAAM8B,IAAI,GAAG;MACX5J,KAAK,EAAEyJ,GAAG,CAACpV,KAAK,EAAEyT,MAAM,EAAE,CAAC,CAAC;MAC5BnZ,OAAO,EAAE8a,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAClCvG,OAAO,EAAEkI,GAAG,CAACpV,KAAK,EAAEyT,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;MAClCgC,YAAY,EAAEhM,WAAW,CAACzJ,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAA;KAC5C,CAAA;IAED,OAAO,CAAC8B,IAAI,EAAE,IAAI,EAAE9B,MAAM,GAAG,CAAC,CAAC,CAAA;EACjC,CAAA;EAEA,SAASiC,gBAAgBA,CAAC1V,KAAK,EAAEyT,MAAM,EAAE;EACvC,EAAA,IAAMkC,KAAK,GAAG,CAAC3V,KAAK,CAACyT,MAAM,CAAC,IAAI,CAACzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC;EAChDmC,IAAAA,UAAU,GAAG3V,YAAY,CAACD,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,EAAEzT,KAAK,CAACyT,MAAM,GAAG,CAAC,CAAC,CAAC;MAC/D5f,IAAI,GAAG8hB,KAAK,GAAG,IAAI,GAAGhW,eAAe,CAACC,QAAQ,CAACgW,UAAU,CAAC,CAAA;IAC5D,OAAO,CAAC,EAAE,EAAE/hB,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;EAC/B,CAAA;EAEA,SAASoC,eAAeA,CAAC7V,KAAK,EAAEyT,MAAM,EAAE;EACtC,EAAA,IAAM5f,IAAI,GAAGmM,KAAK,CAACyT,MAAM,CAAC,GAAG9f,QAAQ,CAACC,MAAM,CAACoM,KAAK,CAACyT,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;IAClE,OAAO,CAAC,EAAE,EAAE5f,IAAI,EAAE4f,MAAM,GAAG,CAAC,CAAC,CAAA;EAC/B,CAAA;;EAEA;;EAEA,IAAMqC,WAAW,GAAG7S,MAAM,CAAA,KAAA,GAAOwR,gBAAgB,CAACxB,MAAM,MAAG,CAAC,CAAA;;EAE5D;;EAEA,IAAM8C,WAAW,GACf,8PAA8P,CAAA;EAEhQ,SAASC,kBAAkBA,CAAChW,KAAK,EAAE;IACjC,IAAOpS,CAAC,GACNoS,KAAK,CAAA,CAAA,CAAA;EADGiW,IAAAA,OAAO,GACfjW,KAAK,CAAA,CAAA,CAAA;EADYkW,IAAAA,QAAQ,GACzBlW,KAAK,CAAA,CAAA,CAAA;EADsBmW,IAAAA,OAAO,GAClCnW,KAAK,CAAA,CAAA,CAAA;EAD+BoW,IAAAA,MAAM,GAC1CpW,KAAK,CAAA,CAAA,CAAA;EADuCqW,IAAAA,OAAO,GACnDrW,KAAK,CAAA,CAAA,CAAA;EADgDsW,IAAAA,SAAS,GAC9DtW,KAAK,CAAA,CAAA,CAAA;EAD2DuW,IAAAA,SAAS,GACzEvW,KAAK,CAAA,CAAA,CAAA;EADsEwW,IAAAA,eAAe,GAC1FxW,KAAK,CAAA,CAAA,CAAA,CAAA;EAEP,EAAA,IAAMyW,iBAAiB,GAAG7oB,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;IACtC,IAAM8oB,eAAe,GAAGH,SAAS,IAAIA,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;EAEzD,EAAA,IAAMI,WAAW,GAAG,SAAdA,WAAWA,CAAIhG,GAAG,EAAEiG,KAAK,EAAA;EAAA,IAAA,IAALA,KAAK,KAAA,KAAA,CAAA,EAAA;EAALA,MAAAA,KAAK,GAAG,KAAK,CAAA;EAAA,KAAA;EAAA,IAAA,OACrCjG,GAAG,KAAK7e,SAAS,KAAK8kB,KAAK,IAAKjG,GAAG,IAAI8F,iBAAkB,CAAC,GAAG,CAAC9F,GAAG,GAAGA,GAAG,CAAA;EAAA,GAAA,CAAA;EAEzE,EAAA,OAAO,CACL;EACE7D,IAAAA,KAAK,EAAE6J,WAAW,CAACpN,aAAa,CAAC0M,OAAO,CAAC,CAAC;EAC1CrY,IAAAA,MAAM,EAAE+Y,WAAW,CAACpN,aAAa,CAAC2M,QAAQ,CAAC,CAAC;EAC5ClJ,IAAAA,KAAK,EAAE2J,WAAW,CAACpN,aAAa,CAAC4M,OAAO,CAAC,CAAC;EAC1ClJ,IAAAA,IAAI,EAAE0J,WAAW,CAACpN,aAAa,CAAC6M,MAAM,CAAC,CAAC;EACxCzK,IAAAA,KAAK,EAAEgL,WAAW,CAACpN,aAAa,CAAC8M,OAAO,CAAC,CAAC;EAC1C/b,IAAAA,OAAO,EAAEqc,WAAW,CAACpN,aAAa,CAAC+M,SAAS,CAAC,CAAC;MAC9CpJ,OAAO,EAAEyJ,WAAW,CAACpN,aAAa,CAACgN,SAAS,CAAC,EAAEA,SAAS,KAAK,IAAI,CAAC;MAClEd,YAAY,EAAEkB,WAAW,CAAClN,WAAW,CAAC+M,eAAe,CAAC,EAAEE,eAAe,CAAA;EACzE,GAAC,CACF,CAAA;EACH,CAAA;;EAEA;EACA;EACA;EACA,IAAMG,UAAU,GAAG;EACjBC,EAAAA,GAAG,EAAE,CAAC;EACNC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;IACZC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAA;EACZ,CAAC,CAAA;EAED,SAASC,WAAWA,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAE;EACzF,EAAA,IAAMkB,MAAM,GAAG;EACb1pB,IAAAA,IAAI,EAAEkoB,OAAO,CAAC7iB,MAAM,KAAK,CAAC,GAAGsX,cAAc,CAACrB,YAAY,CAAC4M,OAAO,CAAC,CAAC,GAAG5M,YAAY,CAAC4M,OAAO,CAAC;MAC1FjoB,KAAK,EAAEoN,WAAmB,CAAChE,OAAO,CAAC8e,QAAQ,CAAC,GAAG,CAAC;EAChDjoB,IAAAA,GAAG,EAAEob,YAAY,CAAC+M,MAAM,CAAC;EACzB5nB,IAAAA,IAAI,EAAE6a,YAAY,CAACgN,OAAO,CAAC;MAC3B5nB,MAAM,EAAE4a,YAAY,CAACiN,SAAS,CAAA;KAC/B,CAAA;IAED,IAAIC,SAAS,EAAEkB,MAAM,CAAC9oB,MAAM,GAAG0a,YAAY,CAACkN,SAAS,CAAC,CAAA;EACtD,EAAA,IAAIiB,UAAU,EAAE;EACdC,IAAAA,MAAM,CAACrpB,OAAO,GACZopB,UAAU,CAACpkB,MAAM,GAAG,CAAC,GACjBgI,YAAoB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,GAC5Cpc,aAAqB,CAAChE,OAAO,CAACogB,UAAU,CAAC,GAAG,CAAC,CAAA;EACrD,GAAA;EAEA,EAAA,OAAOC,MAAM,CAAA;EACf,CAAA;;EAEA;EACA,IAAMC,OAAO,GACX,iMAAiM,CAAA;EAEnM,SAASC,cAAcA,CAAC3X,KAAK,EAAE;IAC7B,IAEIwX,UAAU,GAWRxX,KAAK,CAAA,CAAA,CAAA;EAVPoW,IAAAA,MAAM,GAUJpW,KAAK,CAAA,CAAA,CAAA;EATPkW,IAAAA,QAAQ,GASNlW,KAAK,CAAA,CAAA,CAAA;EARPiW,IAAAA,OAAO,GAQLjW,KAAK,CAAA,CAAA,CAAA;EAPPqW,IAAAA,OAAO,GAOLrW,KAAK,CAAA,CAAA,CAAA;EANPsW,IAAAA,SAAS,GAMPtW,KAAK,CAAA,CAAA,CAAA;EALPuW,IAAAA,SAAS,GAKPvW,KAAK,CAAA,CAAA,CAAA;EAJP4X,IAAAA,SAAS,GAIP5X,KAAK,CAAA,CAAA,CAAA;EAHP6X,IAAAA,SAAS,GAGP7X,KAAK,CAAA,CAAA,CAAA;EAFP6K,IAAAA,UAAU,GAER7K,KAAK,CAAA,EAAA,CAAA;EADP8K,IAAAA,YAAY,GACV9K,KAAK,CAAA,EAAA,CAAA;EACTyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAE5F,EAAA,IAAIlmB,MAAM,CAAA;EACV,EAAA,IAAIunB,SAAS,EAAE;EACbvnB,IAAAA,MAAM,GAAGwmB,UAAU,CAACe,SAAS,CAAC,CAAA;KAC/B,MAAM,IAAIC,SAAS,EAAE;EACpBxnB,IAAAA,MAAM,GAAG,CAAC,CAAA;EACZ,GAAC,MAAM;EACLA,IAAAA,MAAM,GAAG4P,YAAY,CAAC4K,UAAU,EAAEC,YAAY,CAAC,CAAA;EACjD,GAAA;IAEA,OAAO,CAAC2M,MAAM,EAAE,IAAI9X,eAAe,CAACtP,MAAM,CAAC,CAAC,CAAA;EAC9C,CAAA;EAEA,SAASynB,iBAAiBA,CAAClqB,CAAC,EAAE;EAC5B;EACA,EAAA,OAAOA,CAAC,CACL0E,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAClCA,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CACxBylB,IAAI,EAAE,CAAA;EACX,CAAA;;EAEA;;EAEA,IAAMC,OAAO,GACT,4HAA4H;EAC9HC,EAAAA,MAAM,GACJ,wJAAwJ;EAC1JC,EAAAA,KAAK,GACH,2HAA2H,CAAA;EAE/H,SAASC,mBAAmBA,CAACnY,KAAK,EAAE;IAClC,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;EAAjEoW,IAAAA,MAAM,GAAsDpW,KAAK,CAAA,CAAA,CAAA;EAAzDkW,IAAAA,QAAQ,GAA4ClW,KAAK,CAAA,CAAA,CAAA;EAA/CiW,IAAAA,OAAO,GAAmCjW,KAAK,CAAA,CAAA,CAAA;EAAtCqW,IAAAA,OAAO,GAA0BrW,KAAK,CAAA,CAAA,CAAA;EAA7BsW,IAAAA,SAAS,GAAetW,KAAK,CAAA,CAAA,CAAA;EAAlBuW,IAAAA,SAAS,GAAIvW,KAAK,CAAA,CAAA,CAAA;EACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;EAC9C,CAAA;EAEA,SAASuY,YAAYA,CAACpY,KAAK,EAAE;IAC3B,IAASwX,UAAU,GAA8DxX,KAAK,CAAA,CAAA,CAAA;EAAjEkW,IAAAA,QAAQ,GAAoDlW,KAAK,CAAA,CAAA,CAAA;EAAvDoW,IAAAA,MAAM,GAA4CpW,KAAK,CAAA,CAAA,CAAA;EAA/CqW,IAAAA,OAAO,GAAmCrW,KAAK,CAAA,CAAA,CAAA;EAAtCsW,IAAAA,SAAS,GAAwBtW,KAAK,CAAA,CAAA,CAAA;EAA3BuW,IAAAA,SAAS,GAAavW,KAAK,CAAA,CAAA,CAAA;EAAhBiW,IAAAA,OAAO,GAAIjW,KAAK,CAAA,CAAA,CAAA;EACpFyX,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;EAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE9X,eAAe,CAACE,WAAW,CAAC,CAAA;EAC9C,CAAA;EAEA,IAAMwY,4BAA4B,GAAGzF,cAAc,CAACgC,WAAW,EAAED,qBAAqB,CAAC,CAAA;EACvF,IAAM2D,6BAA6B,GAAG1F,cAAc,CAACiC,YAAY,EAAEF,qBAAqB,CAAC,CAAA;EACzF,IAAM4D,gCAAgC,GAAG3F,cAAc,CAACkC,eAAe,EAAEH,qBAAqB,CAAC,CAAA;EAC/F,IAAM6D,oBAAoB,GAAG5F,cAAc,CAAC8B,YAAY,CAAC,CAAA;EAEzD,IAAM+D,0BAA0B,GAAGvF,iBAAiB,CAClDoC,aAAa,EACbE,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM6C,2BAA2B,GAAGxF,iBAAiB,CACnD6B,kBAAkB,EAClBS,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM8C,4BAA4B,GAAGzF,iBAAiB,CACpD8B,qBAAqB,EACrBQ,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EACD,IAAM+C,uBAAuB,GAAG1F,iBAAiB,CAC/CsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;;EAED;EACA;EACA;;EAEO,SAASgD,YAAYA,CAACjrB,CAAC,EAAE;IAC9B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACyqB,4BAA4B,EAAEI,0BAA0B,CAAC,EAC1D,CAACH,6BAA6B,EAAEI,2BAA2B,CAAC,EAC5D,CAACH,gCAAgC,EAAEI,4BAA4B,CAAC,EAChE,CAACH,oBAAoB,EAAEI,uBAAuB,CAChD,CAAC,CAAA;EACH,CAAA;EAEO,SAASE,gBAAgBA,CAAClrB,CAAC,EAAE;EAClC,EAAA,OAAO+lB,KAAK,CAACmE,iBAAiB,CAAClqB,CAAC,CAAC,EAAE,CAAC8pB,OAAO,EAAEC,cAAc,CAAC,CAAC,CAAA;EAC/D,CAAA;EAEO,SAASoB,aAAaA,CAACnrB,CAAC,EAAE;IAC/B,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACoqB,OAAO,EAAEG,mBAAmB,CAAC,EAC9B,CAACF,MAAM,EAAEE,mBAAmB,CAAC,EAC7B,CAACD,KAAK,EAAEE,YAAY,CACtB,CAAC,CAAA;EACH,CAAA;EAEO,SAASY,gBAAgBA,CAACprB,CAAC,EAAE;IAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACmoB,WAAW,EAAEC,kBAAkB,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,IAAMiD,kBAAkB,GAAG/F,iBAAiB,CAACsC,cAAc,CAAC,CAAA;EAErD,SAAS0D,gBAAgBA,CAACtrB,CAAC,EAAE;IAClC,OAAO+lB,KAAK,CAAC/lB,CAAC,EAAE,CAACkoB,WAAW,EAAEmD,kBAAkB,CAAC,CAAC,CAAA;EACpD,CAAA;EAEA,IAAME,4BAA4B,GAAGvG,cAAc,CAACqC,WAAW,EAAEE,qBAAqB,CAAC,CAAA;EACvF,IAAMiE,oBAAoB,GAAGxG,cAAc,CAACsC,YAAY,CAAC,CAAA;EAEzD,IAAMmE,+BAA+B,GAAGnG,iBAAiB,CACvDsC,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;EAEM,SAASyD,QAAQA,CAAC1rB,CAAC,EAAE;EAC1B,EAAA,OAAO+lB,KAAK,CACV/lB,CAAC,EACD,CAACurB,4BAA4B,EAAEV,0BAA0B,CAAC,EAC1D,CAACW,oBAAoB,EAAEC,+BAA+B,CACxD,CAAC,CAAA;EACH;;EC9TA,IAAME,SAAO,GAAG,kBAAkB,CAAA;;EAElC;EACO,IAAMC,cAAc,GAAG;EAC1BxM,IAAAA,KAAK,EAAE;EACLC,MAAAA,IAAI,EAAE,CAAC;QACPtB,KAAK,EAAE,CAAC,GAAG,EAAE;EACbrR,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE;EACpB4S,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QACzBuI,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OAClC;EACDxI,IAAAA,IAAI,EAAE;EACJtB,MAAAA,KAAK,EAAE,EAAE;QACTrR,OAAO,EAAE,EAAE,GAAG,EAAE;EAChB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrBuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OAC9B;EACD9J,IAAAA,KAAK,EAAE;EAAErR,MAAAA,OAAO,EAAE,EAAE;QAAE4S,OAAO,EAAE,EAAE,GAAG,EAAE;EAAEuI,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,IAAA;OAAM;EACtEnb,IAAAA,OAAO,EAAE;EAAE4S,MAAAA,OAAO,EAAE,EAAE;QAAEuI,YAAY,EAAE,EAAE,GAAG,IAAA;OAAM;EACjDvI,IAAAA,OAAO,EAAE;EAAEuI,MAAAA,YAAY,EAAE,IAAA;EAAK,KAAA;KAC/B;EACDgE,EAAAA,YAAY,GAAA1iB,QAAA,CAAA;EACV+V,IAAAA,KAAK,EAAE;EACLC,MAAAA,QAAQ,EAAE,CAAC;EACXnP,MAAAA,MAAM,EAAE,EAAE;EACVoP,MAAAA,KAAK,EAAE,EAAE;EACTC,MAAAA,IAAI,EAAE,GAAG;QACTtB,KAAK,EAAE,GAAG,GAAG,EAAE;EACfrR,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE;EACtB4S,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC3BuI,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACpC;EACD1I,IAAAA,QAAQ,EAAE;EACRnP,MAAAA,MAAM,EAAE,CAAC;EACToP,MAAAA,KAAK,EAAE,EAAE;EACTC,MAAAA,IAAI,EAAE,EAAE;QACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;EACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACnC;EACD7X,IAAAA,MAAM,EAAE;EACNoP,MAAAA,KAAK,EAAE,CAAC;EACRC,MAAAA,IAAI,EAAE,EAAE;QACRtB,KAAK,EAAE,EAAE,GAAG,EAAE;EACdrR,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;EACrB4S,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1BuI,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;EACpC,KAAA;EAAC,GAAA,EAEE+D,cAAc,CAClB;IACDE,kBAAkB,GAAG,QAAQ,GAAG,GAAG;IACnCC,mBAAmB,GAAG,QAAQ,GAAG,IAAI;EACrCC,EAAAA,cAAc,GAAA7iB,QAAA,CAAA;EACZ+V,IAAAA,KAAK,EAAE;EACLC,MAAAA,QAAQ,EAAE,CAAC;EACXnP,MAAAA,MAAM,EAAE,EAAE;QACVoP,KAAK,EAAE0M,kBAAkB,GAAG,CAAC;EAC7BzM,MAAAA,IAAI,EAAEyM,kBAAkB;QACxB/N,KAAK,EAAE+N,kBAAkB,GAAG,EAAE;EAC9Bpf,MAAAA,OAAO,EAAEof,kBAAkB,GAAG,EAAE,GAAG,EAAE;EACrCxM,MAAAA,OAAO,EAAEwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC1CjE,YAAY,EAAEiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;OACnD;EACD3M,IAAAA,QAAQ,EAAE;EACRnP,MAAAA,MAAM,EAAE,CAAC;QACToP,KAAK,EAAE0M,kBAAkB,GAAG,EAAE;QAC9BzM,IAAI,EAAEyM,kBAAkB,GAAG,CAAC;EAC5B/N,MAAAA,KAAK,EAAG+N,kBAAkB,GAAG,EAAE,GAAI,CAAC;EACpCpf,MAAAA,OAAO,EAAGof,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;QAC3CxM,OAAO,EAAGwM,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;QAChDjE,YAAY,EAAGiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,GAAI,CAAA;OAC5D;EACD9b,IAAAA,MAAM,EAAE;QACNoP,KAAK,EAAE2M,mBAAmB,GAAG,CAAC;EAC9B1M,MAAAA,IAAI,EAAE0M,mBAAmB;QACzBhO,KAAK,EAAEgO,mBAAmB,GAAG,EAAE;EAC/Brf,MAAAA,OAAO,EAAEqf,mBAAmB,GAAG,EAAE,GAAG,EAAE;EACtCzM,MAAAA,OAAO,EAAEyM,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;QAC3ClE,YAAY,EAAEkE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;EACrD,KAAA;EAAC,GAAA,EACEH,cAAc,CAClB,CAAA;;EAEH;EACA,IAAMK,cAAY,GAAG,CACnB,OAAO,EACP,UAAU,EACV,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cAAc,CACf,CAAA;EAED,IAAMC,YAAY,GAAGD,cAAY,CAACvI,KAAK,CAAC,CAAC,CAAC,CAACyI,OAAO,EAAE,CAAA;;EAEpD;EACA,SAASxc,OAAKA,CAACkU,GAAG,EAAEjU,IAAI,EAAEzJ,KAAK,EAAU;EAAA,EAAA,IAAfA,KAAK,KAAA,KAAA,CAAA,EAAA;EAALA,IAAAA,KAAK,GAAG,KAAK,CAAA;EAAA,GAAA;EACrC;EACA,EAAA,IAAMimB,IAAI,GAAG;EACXtH,IAAAA,MAAM,EAAE3e,KAAK,GAAGyJ,IAAI,CAACkV,MAAM,GAAA3b,QAAA,CAAA,EAAA,EAAQ0a,GAAG,CAACiB,MAAM,EAAMlV,IAAI,CAACkV,MAAM,IAAI,EAAE,CAAG;MACvEja,GAAG,EAAEgZ,GAAG,CAAChZ,GAAG,CAAC8E,KAAK,CAACC,IAAI,CAAC/E,GAAG,CAAC;EAC5BwhB,IAAAA,kBAAkB,EAAEzc,IAAI,CAACyc,kBAAkB,IAAIxI,GAAG,CAACwI,kBAAkB;EACrEC,IAAAA,MAAM,EAAE1c,IAAI,CAAC0c,MAAM,IAAIzI,GAAG,CAACyI,MAAAA;KAC5B,CAAA;EACD,EAAA,OAAO,IAAIC,QAAQ,CAACH,IAAI,CAAC,CAAA;EAC3B,CAAA;EAEA,SAASI,gBAAgBA,CAACF,MAAM,EAAEG,IAAI,EAAE;EAAA,EAAA,IAAAC,kBAAA,CAAA;IACtC,IAAIC,GAAG,GAAAD,CAAAA,kBAAA,GAAGD,IAAI,CAAC5E,YAAY,KAAA,IAAA,GAAA6E,kBAAA,GAAI,CAAC,CAAA;EAChC,EAAA,KAAA,IAAAzM,SAAA,GAAAC,+BAAA,CAAmBgM,YAAY,CAACxI,KAAK,CAAC,CAAC,CAAC,CAAA,EAAAvD,KAAA,EAAAA,CAAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAA/B1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;EACb,IAAA,IAAI+mB,IAAI,CAAC/sB,IAAI,CAAC,EAAE;EACditB,MAAAA,GAAG,IAAIF,IAAI,CAAC/sB,IAAI,CAAC,GAAG4sB,MAAM,CAAC5sB,IAAI,CAAC,CAAC,cAAc,CAAC,CAAA;EAClD,KAAA;EACF,GAAA;EACA,EAAA,OAAOitB,GAAG,CAAA;EACZ,CAAA;;EAEA;EACA,SAASC,eAAeA,CAACN,MAAM,EAAEG,IAAI,EAAE;EACrC;EACA;EACA,EAAA,IAAMvQ,MAAM,GAAGsQ,gBAAgB,CAACF,MAAM,EAAEG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;EAE1DR,EAAAA,cAAY,CAACY,WAAW,CAAC,UAACC,QAAQ,EAAE/K,OAAO,EAAK;MAC9C,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;EAC/B,MAAA,IAAI+K,QAAQ,EAAE;EACZ,QAAA,IAAMC,WAAW,GAAGN,IAAI,CAACK,QAAQ,CAAC,GAAG5Q,MAAM,CAAA;UAC3C,IAAM8Q,IAAI,GAAGV,MAAM,CAACvK,OAAO,CAAC,CAAC+K,QAAQ,CAAC,CAAA;;EAEtC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;UACA,IAAMG,MAAM,GAAGpmB,IAAI,CAAC2E,KAAK,CAACuhB,WAAW,GAAGC,IAAI,CAAC,CAAA;EAC7CP,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIkL,MAAM,GAAG/Q,MAAM,CAAA;UAChCuQ,IAAI,CAACK,QAAQ,CAAC,IAAIG,MAAM,GAAGD,IAAI,GAAG9Q,MAAM,CAAA;EAC1C,OAAA;EACA,MAAA,OAAO6F,OAAO,CAAA;EAChB,KAAC,MAAM;EACL,MAAA,OAAO+K,QAAQ,CAAA;EACjB,KAAA;KACD,EAAE,IAAI,CAAC,CAAA;;EAER;EACA;EACAb,EAAAA,cAAY,CAAC3R,MAAM,CAAC,UAACwS,QAAQ,EAAE/K,OAAO,EAAK;MACzC,IAAI,CAACnc,WAAW,CAAC6mB,IAAI,CAAC1K,OAAO,CAAC,CAAC,EAAE;EAC/B,MAAA,IAAI+K,QAAQ,EAAE;EACZ,QAAA,IAAMhR,QAAQ,GAAG2Q,IAAI,CAACK,QAAQ,CAAC,GAAG,CAAC,CAAA;EACnCL,QAAAA,IAAI,CAACK,QAAQ,CAAC,IAAIhR,QAAQ,CAAA;EAC1B2Q,QAAAA,IAAI,CAAC1K,OAAO,CAAC,IAAIjG,QAAQ,GAAGwQ,MAAM,CAACQ,QAAQ,CAAC,CAAC/K,OAAO,CAAC,CAAA;EACvD,OAAA;EACA,MAAA,OAAOA,OAAO,CAAA;EAChB,KAAC,MAAM;EACL,MAAA,OAAO+K,QAAQ,CAAA;EACjB,KAAA;KACD,EAAE,IAAI,CAAC,CAAA;EACV,CAAA;;EAEA;EACA,SAASI,YAAYA,CAACT,IAAI,EAAE;IAC1B,IAAMU,OAAO,GAAG,EAAE,CAAA;EAClB,EAAA,KAAA,IAAAhH,EAAA,GAAAiH,CAAAA,EAAAA,eAAA,GAA2BzhB,MAAM,CAAC0hB,OAAO,CAACZ,IAAI,CAAC,EAAAtG,EAAA,GAAAiH,eAAA,CAAA5nB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAA5C,IAAA,IAAAmH,kBAAA,GAAAF,eAAA,CAAAjH,EAAA,CAAA;EAAOtjB,MAAAA,GAAG,GAAAyqB,kBAAA,CAAA,CAAA,CAAA;EAAE5nB,MAAAA,KAAK,GAAA4nB,kBAAA,CAAA,CAAA,CAAA,CAAA;MACpB,IAAI5nB,KAAK,KAAK,CAAC,EAAE;EACfynB,MAAAA,OAAO,CAACtqB,GAAG,CAAC,GAAG6C,KAAK,CAAA;EACtB,KAAA;EACF,GAAA;EACA,EAAA,OAAOynB,OAAO,CAAA;EAChB,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqBZ,MAAAA,QAAQ,0BAAAgB,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAAhB,QAAAA,CAAYiB,MAAM,EAAE;MAClB,IAAMC,QAAQ,GAAGD,MAAM,CAACnB,kBAAkB,KAAK,UAAU,IAAI,KAAK,CAAA;EAClE,IAAA,IAAIC,MAAM,GAAGmB,QAAQ,GAAGzB,cAAc,GAAGH,YAAY,CAAA;MAErD,IAAI2B,MAAM,CAAClB,MAAM,EAAE;QACjBA,MAAM,GAAGkB,MAAM,CAAClB,MAAM,CAAA;EACxB,KAAA;;EAEA;EACJ;EACA;EACI,IAAA,IAAI,CAACxH,MAAM,GAAG0I,MAAM,CAAC1I,MAAM,CAAA;EAC3B;EACJ;EACA;MACI,IAAI,CAACja,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;EACxC;EACJ;EACA;EACI,IAAA,IAAI,CAACqmB,kBAAkB,GAAGoB,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAA;EAC1D;EACJ;EACA;EACI,IAAA,IAAI,CAACC,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;EACrC;EACJ;EACA;MACI,IAAI,CAACpB,MAAM,GAAGA,MAAM,CAAA;EACpB;EACJ;EACA;MACI,IAAI,CAACqB,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAREpB,QAAA,CASOqB,UAAU,GAAjB,SAAAA,WAAkBrgB,KAAK,EAAEjL,IAAI,EAAE;MAC7B,OAAOiqB,QAAQ,CAAC5d,UAAU,CAAC;EAAEkZ,MAAAA,YAAY,EAAEta,KAAAA;OAAO,EAAEjL,IAAI,CAAC,CAAA;EAC3D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAnBE;IAAAiqB,QAAA,CAoBO5d,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9B,IAAI+V,GAAG,IAAI,IAAI,IAAI,OAAOA,GAAG,KAAK,QAAQ,EAAE;EAC1C,MAAA,MAAM,IAAI1Y,oBAAoB,CAE1B0Y,8DAAAA,IAAAA,GAAG,KAAK,IAAI,GAAG,MAAM,GAAG,OAAOA,GAAG,CAEtC,CAAC,CAAA;EACH,KAAA;MAEA,OAAO,IAAIkU,QAAQ,CAAC;QAClBzH,MAAM,EAAEnH,eAAe,CAACtF,GAAG,EAAEkU,QAAQ,CAACsB,aAAa,CAAC;EACpDhjB,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC;QAC5B+pB,kBAAkB,EAAE/pB,IAAI,CAAC+pB,kBAAkB;QAC3CC,MAAM,EAAEhqB,IAAI,CAACgqB,MAAAA;EACf,KAAC,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAAC,EAAAA,QAAA,CAUOuB,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBC,YAAY,EAAE;EACpC,IAAA,IAAInb,QAAQ,CAACmb,YAAY,CAAC,EAAE;EAC1B,MAAA,OAAOxB,QAAQ,CAACqB,UAAU,CAACG,YAAY,CAAC,CAAA;OACzC,MAAM,IAAIxB,QAAQ,CAACyB,UAAU,CAACD,YAAY,CAAC,EAAE;EAC5C,MAAA,OAAOA,YAAY,CAAA;EACrB,KAAC,MAAM,IAAI,OAAOA,YAAY,KAAK,QAAQ,EAAE;EAC3C,MAAA,OAAOxB,QAAQ,CAAC5d,UAAU,CAACof,YAAY,CAAC,CAAA;EAC1C,KAAC,MAAM;EACL,MAAA,MAAM,IAAIpuB,oBAAoB,CAAA,4BAAA,GACCouB,YAAY,GAAY,WAAA,GAAA,OAAOA,YAC9D,CAAC,CAAA;EACH,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAAxB,QAAA,CAcO0B,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;EACzB,IAAA,IAAA6rB,iBAAA,GAAiB/C,gBAAgB,CAAC8C,IAAI,CAAC;EAAhCvpB,MAAAA,MAAM,GAAAwpB,iBAAA,CAAA,CAAA,CAAA,CAAA;EACb,IAAA,IAAIxpB,MAAM,EAAE;EACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;EAC1C,KAAC,MAAM;QACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;IAAA3B,QAAA,CAgBO6B,WAAW,GAAlB,SAAAA,YAAmBF,IAAI,EAAE5rB,IAAI,EAAE;EAC7B,IAAA,IAAA+rB,iBAAA,GAAiB/C,gBAAgB,CAAC4C,IAAI,CAAC;EAAhCvpB,MAAAA,MAAM,GAAA0pB,iBAAA,CAAA,CAAA,CAAA,CAAA;EACb,IAAA,IAAI1pB,MAAM,EAAE;EACV,MAAA,OAAO4nB,QAAQ,CAAC5d,UAAU,CAAChK,MAAM,EAAErC,IAAI,CAAC,CAAA;EAC1C,KAAC,MAAM;QACL,OAAOiqB,QAAQ,CAACmB,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA3B,QAAA,CAMOmB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAIpW,oBAAoB,CAACsuB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAInB,QAAQ,CAAC;EAAEmB,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA,MAFE;EAAAnB,EAAAA,QAAA,CAGOsB,aAAa,GAApB,SAAAA,aAAAA,CAAqBnuB,IAAI,EAAE;EACzB,IAAA,IAAMme,UAAU,GAAG;EACjB1d,MAAAA,IAAI,EAAE,OAAO;EACb+e,MAAAA,KAAK,EAAE,OAAO;EACdyE,MAAAA,OAAO,EAAE,UAAU;EACnBxE,MAAAA,QAAQ,EAAE,UAAU;EACpB/e,MAAAA,KAAK,EAAE,QAAQ;EACf4P,MAAAA,MAAM,EAAE,QAAQ;EAChBse,MAAAA,IAAI,EAAE,OAAO;EACblP,MAAAA,KAAK,EAAE,OAAO;EACd/e,MAAAA,GAAG,EAAE,MAAM;EACXgf,MAAAA,IAAI,EAAE,MAAM;EACZze,MAAAA,IAAI,EAAE,OAAO;EACbmd,MAAAA,KAAK,EAAE,OAAO;EACdld,MAAAA,MAAM,EAAE,SAAS;EACjB6L,MAAAA,OAAO,EAAE,SAAS;EAClB3L,MAAAA,MAAM,EAAE,SAAS;EACjBue,MAAAA,OAAO,EAAE,SAAS;EAClBpY,MAAAA,WAAW,EAAE,cAAc;EAC3B2gB,MAAAA,YAAY,EAAE,cAAA;OACf,CAACnoB,IAAI,GAAGA,IAAI,CAACyR,WAAW,EAAE,GAAGzR,IAAI,CAAC,CAAA;MAEnC,IAAI,CAACme,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;EAEjD,IAAA,OAAOme,UAAU,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA0O,EAAAA,QAAA,CAKOyB,UAAU,GAAjB,SAAAA,UAAAA,CAAkBpU,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAAC+T,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA,EAAA,IAAAzrB,MAAA,GAAAqqB,QAAA,CAAApqB,SAAA,CAAA;EAiBA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;IAzBED,MAAA,CA0BAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB;EACA,IAAA,IAAMksB,OAAO,GAAArlB,QAAA,CAAA,EAAA,EACR7G,IAAI,EAAA;QACPkJ,KAAK,EAAElJ,IAAI,CAACga,KAAK,KAAK,KAAK,IAAIha,IAAI,CAACkJ,KAAK,KAAK,KAAA;OAC/C,CAAA,CAAA;MACD,OAAO,IAAI,CAAC+X,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,EAAE2jB,OAAO,CAAC,CAAC5K,wBAAwB,CAAC,IAAI,EAAE9B,GAAG,CAAC,GACvE6J,SAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;EAAAzpB,EAAAA,MAAA,CAgBAusB,OAAO,GAAP,SAAAA,OAAAA,CAAQnsB,IAAI,EAAO;EAAA,IAAA,IAAAiE,KAAA,GAAA,IAAA,CAAA;EAAA,IAAA,IAAXjE,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACf,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EAEjC,IAAA,IAAM+C,SAAS,GAAGpsB,IAAI,CAACosB,SAAS,KAAK,KAAK,CAAA;MAE1C,IAAMzuB,CAAC,GAAGgsB,cAAY,CACnBrf,GAAG,CAAC,UAAClN,IAAI,EAAK;EACb,MAAA,IAAM6gB,GAAG,GAAGha,KAAI,CAACue,MAAM,CAACplB,IAAI,CAAC,CAAA;QAC7B,IAAIkG,WAAW,CAAC2a,GAAG,CAAC,IAAKA,GAAG,KAAK,CAAC,IAAI,CAACmO,SAAU,EAAE;EACjD,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACA,MAAA,OAAOnoB,KAAI,CAACsE,GAAG,CACZuG,eAAe,CAAAjI,QAAA,CAAA;EAAGgE,QAAAA,KAAK,EAAE,MAAM;EAAEwhB,QAAAA,WAAW,EAAE,MAAA;EAAM,OAAA,EAAKrsB,IAAI,EAAA;UAAE5C,IAAI,EAAEA,IAAI,CAACgkB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;EAAC,OAAA,CAAE,CAAC,CACzFlhB,MAAM,CAAC+d,GAAG,CAAC,CAAA;EAChB,KAAC,CAAC,CACDqE,MAAM,CAAC,UAAC7kB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAAA;OAAC,CAAA,CAAA;EAEnB,IAAA,OAAO,IAAI,CAAC8K,GAAG,CACZ0G,aAAa,CAAApI,QAAA,CAAA;EAAG3F,MAAAA,IAAI,EAAE,aAAa;EAAE2J,MAAAA,KAAK,EAAE7K,IAAI,CAACssB,SAAS,IAAI,QAAA;EAAQ,KAAA,EAAKtsB,IAAI,CAAE,CAAC,CAClFE,MAAM,CAACvC,CAAC,CAAC,CAAA;EACd,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAiC,EAAAA,MAAA,CAKA2sB,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAACtL,OAAO,EAAE,OAAO,EAAE,CAAA;EAC5B,IAAA,OAAApa,QAAA,CAAA,EAAA,EAAY,IAAI,CAAC2b,MAAM,CAAA,CAAA;EACzB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAA5iB,EAAAA,MAAA,CAUA4sB,KAAK,GAAL,SAAAA,QAAQ;EACN;EACA,IAAA,IAAI,CAAC,IAAI,CAACvL,OAAO,EAAE,OAAO,IAAI,CAAA;MAE9B,IAAIvjB,CAAC,GAAG,GAAG,CAAA;EACX,IAAA,IAAI,IAAI,CAACkf,KAAK,KAAK,CAAC,EAAElf,CAAC,IAAI,IAAI,CAACkf,KAAK,GAAG,GAAG,CAAA;MAC3C,IAAI,IAAI,CAAClP,MAAM,KAAK,CAAC,IAAI,IAAI,CAACmP,QAAQ,KAAK,CAAC,EAAEnf,CAAC,IAAI,IAAI,CAACgQ,MAAM,GAAG,IAAI,CAACmP,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAA;EACxF,IAAA,IAAI,IAAI,CAACC,KAAK,KAAK,CAAC,EAAEpf,CAAC,IAAI,IAAI,CAACof,KAAK,GAAG,GAAG,CAAA;EAC3C,IAAA,IAAI,IAAI,CAACC,IAAI,KAAK,CAAC,EAAErf,CAAC,IAAI,IAAI,CAACqf,IAAI,GAAG,GAAG,CAAA;MACzC,IAAI,IAAI,CAACtB,KAAK,KAAK,CAAC,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC,EACzF7nB,CAAC,IAAI,GAAG,CAAA;EACV,IAAA,IAAI,IAAI,CAAC+d,KAAK,KAAK,CAAC,EAAE/d,CAAC,IAAI,IAAI,CAAC+d,KAAK,GAAG,GAAG,CAAA;EAC3C,IAAA,IAAI,IAAI,CAACrR,OAAO,KAAK,CAAC,EAAE1M,CAAC,IAAI,IAAI,CAAC0M,OAAO,GAAG,GAAG,CAAA;MAC/C,IAAI,IAAI,CAAC4S,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuI,YAAY,KAAK,CAAC;EAC/C;EACA;EACA7nB,MAAAA,CAAC,IAAIiM,OAAO,CAAC,IAAI,CAACqT,OAAO,GAAG,IAAI,CAACuI,YAAY,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;EAChE,IAAA,IAAI7nB,CAAC,KAAK,GAAG,EAAEA,CAAC,IAAI,KAAK,CAAA;EACzB,IAAA,OAAOA,CAAC,CAAA;EACV,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;EAAAkC,EAAAA,MAAA,CAgBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACjB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMyL,MAAM,GAAG,IAAI,CAACC,QAAQ,EAAE,CAAA;MAC9B,IAAID,MAAM,GAAG,CAAC,IAAIA,MAAM,IAAI,QAAQ,EAAE,OAAO,IAAI,CAAA;EAEjD1sB,IAAAA,IAAI,GAAA6G,QAAA,CAAA;EACF+lB,MAAAA,oBAAoB,EAAE,KAAK;EAC3BC,MAAAA,eAAe,EAAE,KAAK;EACtBC,MAAAA,aAAa,EAAE,KAAK;EACpB5sB,MAAAA,MAAM,EAAE,UAAA;EAAU,KAAA,EACfF,IAAI,EAAA;EACP+sB,MAAAA,aAAa,EAAE,KAAA;OAChB,CAAA,CAAA;EAED,IAAA,IAAMC,QAAQ,GAAG9kB,QAAQ,CAACojB,UAAU,CAACoB,MAAM,EAAE;EAAE/oB,MAAAA,IAAI,EAAE,KAAA;EAAM,KAAC,CAAC,CAAA;EAC7D,IAAA,OAAOqpB,QAAQ,CAACP,SAAS,CAACzsB,IAAI,CAAC,CAAA;EACjC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAJ,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5sB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,OAAO,IAAI,CAACgd,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,qBAAA,GAA6B/b,IAAI,CAACC,SAAS,CAAC,IAAI,CAACqd,MAAM,CAAC,GAAA,IAAA,CAAA;EAC1D,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAAC0K,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAttB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAAC1L,OAAO,EAAE,OAAO9c,GAAG,CAAA;MAE7B,OAAO+lB,gBAAgB,CAAC,IAAI,CAACF,MAAM,EAAE,IAAI,CAACxH,MAAM,CAAC,CAAA;EACnD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5iB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA/sB,EAAAA,MAAA,CAKAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;QAC7C7F,MAAM,GAAG,EAAE,CAAA;EAEb,IAAA,KAAA,IAAA8F,GAAA,GAAA,CAAA,EAAAC,aAAA,GAAgB3D,cAAY,EAAA0D,GAAA,GAAAC,aAAA,CAAApqB,MAAA,EAAAmqB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAM/U,CAAC,GAAAgV,aAAA,CAAAD,GAAA,CAAA,CAAA;EACV,MAAA,IAAI9U,cAAc,CAACgJ,GAAG,CAACiB,MAAM,EAAElK,CAAC,CAAC,IAAIC,cAAc,CAAC,IAAI,CAACiK,MAAM,EAAElK,CAAC,CAAC,EAAE;EACnEiP,QAAAA,MAAM,CAACjP,CAAC,CAAC,GAAGiJ,GAAG,CAAC/gB,GAAG,CAAC8X,CAAC,CAAC,GAAG,IAAI,CAAC9X,GAAG,CAAC8X,CAAC,CAAC,CAAA;EACtC,OAAA;EACF,KAAA;MAEA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;OAAQ,EAAE,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA3nB,EAAAA,MAAA,CAKA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;MAC/C,OAAO,IAAI,CAACjjB,IAAI,CAACoX,GAAG,CAACiM,MAAM,EAAE,CAAC,CAAA;EAChC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA5tB,EAAAA,MAAA,CAOA6tB,QAAQ,GAAR,SAAAA,QAAAA,CAASC,EAAE,EAAE;EACX,IAAA,IAAI,CAAC,IAAI,CAACzM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMsG,MAAM,GAAG,EAAE,CAAA;MACjB,KAAAoG,IAAAA,GAAA,MAAAC,YAAA,GAAgBvkB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmL,GAAA,GAAAC,YAAA,CAAA1qB,MAAA,EAAAyqB,GAAA,EAAE,EAAA;EAArC,MAAA,IAAMrV,CAAC,GAAAsV,YAAA,CAAAD,GAAA,CAAA,CAAA;EACVpG,MAAAA,MAAM,CAACjP,CAAC,CAAC,GAAG4C,QAAQ,CAACwS,EAAE,CAAC,IAAI,CAAClL,MAAM,CAAClK,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAA;EAC7C,KAAA;MACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE+E,MAAAA;OAAQ,EAAE,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA3nB,EAAAA,MAAA,CAQAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;MACR,OAAO,IAAI,CAAC6sB,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAwC,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAM4M,KAAK,GAAAhnB,QAAA,CAAQ,EAAA,EAAA,IAAI,CAAC2b,MAAM,EAAKnH,eAAe,CAACmH,MAAM,EAAEyH,QAAQ,CAACsB,aAAa,CAAC,CAAE,CAAA;MACpF,OAAOle,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAEqL,KAAAA;EAAM,KAAC,CAAC,CAAA;EACvC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAjuB,EAAAA,MAAA,CAKAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAAxhB,KAAA,EAA0E;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAA1DxL,MAAM,GAAAD,IAAA,CAANC,MAAM;QAAE2G,eAAe,GAAA5G,IAAA,CAAf4G,eAAe;QAAEsiB,kBAAkB,GAAAlpB,IAAA,CAAlBkpB,kBAAkB;QAAEC,MAAM,GAAAnpB,IAAA,CAANmpB,MAAM,CAAA;EAC/D,IAAA,IAAMzhB,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;EAAEvM,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAAA;EAAgB,KAAC,CAAC,CAAA;EACvD,IAAA,IAAMzH,IAAI,GAAG;EAAEuI,MAAAA,GAAG,EAAHA,GAAG;EAAEyhB,MAAAA,MAAM,EAANA,MAAM;EAAED,MAAAA,kBAAkB,EAAlBA,kBAAAA;OAAoB,CAAA;EAChD,IAAA,OAAO1c,OAAK,CAAC,IAAI,EAAErN,IAAI,CAAC,CAAA;EAC1B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAAJ,EAAAA,MAAA,CAQAmuB,EAAE,GAAF,SAAAA,EAAAA,CAAG3wB,IAAI,EAAE;EACP,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACoB,OAAO,CAACjlB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;EAC1D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;EAAAvE,EAAAA,MAAA,CAeAouB,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAAC/M,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;EAC5BjC,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEG,IAAI,CAAC,CAAA;MAClC,OAAO9c,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvqB,EAAAA,MAAA,CAKAquB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,IAAI,CAAC,IAAI,CAAChN,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACoD,SAAS,EAAE,CAACE,UAAU,EAAE,CAAC3B,QAAQ,EAAE,CAAC,CAAA;MACnE,OAAOlf,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvqB,EAAAA,MAAA,CAKAyiB,OAAO,GAAP,SAAAA,UAAkB;EAAA,IAAA,KAAA,IAAAM,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAPyZ,KAAK,GAAAjF,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAALlG,MAAAA,KAAK,CAAAkG,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;EACd,IAAA,IAAI,CAAC,IAAI,CAAC5B,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAItE,KAAK,CAACzZ,MAAM,KAAK,CAAC,EAAE;EACtB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAyZ,IAAAA,KAAK,GAAGA,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;EAAA,MAAA,OAAKyO,QAAQ,CAACsB,aAAa,CAAC/P,CAAC,CAAC,CAAA;OAAC,CAAA,CAAA;MAEnD,IAAM2S,KAAK,GAAG,EAAE;QACdC,WAAW,GAAG,EAAE;EAChBjE,MAAAA,IAAI,GAAG,IAAI,CAACoC,QAAQ,EAAE,CAAA;EACxB,IAAA,IAAI8B,QAAQ,CAAA;EAEZ,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgB5E,cAAY,EAAA2E,GAAA,GAAAC,cAAA,CAAArrB,MAAA,EAAAorB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAMhW,CAAC,GAAAiW,cAAA,CAAAD,GAAA,CAAA,CAAA;QACV,IAAI3R,KAAK,CAACzV,OAAO,CAACoR,CAAC,CAAC,IAAI,CAAC,EAAE;EACzB+V,QAAAA,QAAQ,GAAG/V,CAAC,CAAA;UAEZ,IAAIkW,GAAG,GAAG,CAAC,CAAA;;EAEX;EACA,QAAA,KAAK,IAAMC,EAAE,IAAIL,WAAW,EAAE;EAC5BI,UAAAA,GAAG,IAAI,IAAI,CAACxE,MAAM,CAACyE,EAAE,CAAC,CAACnW,CAAC,CAAC,GAAG8V,WAAW,CAACK,EAAE,CAAC,CAAA;EAC3CL,UAAAA,WAAW,CAACK,EAAE,CAAC,GAAG,CAAC,CAAA;EACrB,SAAA;;EAEA;EACA,QAAA,IAAIne,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;EACrBkW,UAAAA,GAAG,IAAIrE,IAAI,CAAC7R,CAAC,CAAC,CAAA;EAChB,SAAA;;EAEA;EACA;EACA,QAAA,IAAMrV,CAAC,GAAGsB,IAAI,CAACwV,KAAK,CAACyU,GAAG,CAAC,CAAA;EACzBL,QAAAA,KAAK,CAAC7V,CAAC,CAAC,GAAGrV,CAAC,CAAA;EACZmrB,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG,CAACkW,GAAG,GAAG,IAAI,GAAGvrB,CAAC,GAAG,IAAI,IAAI,IAAI,CAAA;;EAE/C;SACD,MAAM,IAAIqN,QAAQ,CAAC6Z,IAAI,CAAC7R,CAAC,CAAC,CAAC,EAAE;EAC5B8V,QAAAA,WAAW,CAAC9V,CAAC,CAAC,GAAG6R,IAAI,CAAC7R,CAAC,CAAC,CAAA;EAC1B,OAAA;EACF,KAAA;;EAEA;EACA;EACA,IAAA,KAAK,IAAM/X,GAAG,IAAI6tB,WAAW,EAAE;EAC7B,MAAA,IAAIA,WAAW,CAAC7tB,GAAG,CAAC,KAAK,CAAC,EAAE;UAC1B4tB,KAAK,CAACE,QAAQ,CAAC,IACb9tB,GAAG,KAAK8tB,QAAQ,GAAGD,WAAW,CAAC7tB,GAAG,CAAC,GAAG6tB,WAAW,CAAC7tB,GAAG,CAAC,GAAG,IAAI,CAACypB,MAAM,CAACqE,QAAQ,CAAC,CAAC9tB,GAAG,CAAC,CAAA;EACvF,OAAA;EACF,KAAA;EAEA+pB,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEmE,KAAK,CAAC,CAAA;MACnC,OAAO9gB,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2L,KAAAA;OAAO,EAAE,IAAI,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvuB,EAAAA,MAAA,CAKAsuB,UAAU,GAAV,SAAAA,aAAa;EACX,IAAA,IAAI,CAAC,IAAI,CAACjN,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,OAAO,IAAI,CAACoB,OAAO,CACjB,OAAO,EACP,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cACF,CAAC,CAAA;EACH,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAziB,EAAAA,MAAA,CAKA4tB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,IAAI,CAAC,IAAI,CAACvM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMyN,OAAO,GAAG,EAAE,CAAA;MAClB,KAAAC,IAAAA,GAAA,MAAAC,aAAA,GAAgBvlB,MAAM,CAACC,IAAI,CAAC,IAAI,CAACkZ,MAAM,CAAC,EAAAmM,GAAA,GAAAC,aAAA,CAAA1rB,MAAA,EAAAyrB,GAAA,EAAE,EAAA;EAArC,MAAA,IAAMrW,CAAC,GAAAsW,aAAA,CAAAD,GAAA,CAAA,CAAA;QACVD,OAAO,CAACpW,CAAC,CAAC,GAAG,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAACkK,MAAM,CAAClK,CAAC,CAAC,CAAA;EACzD,KAAA;MACA,OAAOjL,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAEkM,OAAAA;OAAS,EAAE,IAAI,CAAC,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA9uB,EAAAA,MAAA,CAKAivB,WAAW,GAAX,SAAAA,cAAc;EACZ,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMkJ,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACpI,MAAM,CAAC,CAAA;MACtC,OAAOnV,OAAK,CAAC,IAAI,EAAE;EAAEmV,MAAAA,MAAM,EAAE2H,IAAAA;OAAM,EAAE,IAAI,CAAC,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAiGA;EACF;EACA;EACA;EACA;EACA;EALEvqB,EAAAA,MAAA,CAMAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;EACnC,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MAEA,IAAI,CAAC,IAAI,CAAC1Y,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,EAAE;EAC/B,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;EAEA,IAAA,SAASumB,EAAEA,CAACC,EAAE,EAAEC,EAAE,EAAE;EAClB;EACA,MAAA,IAAID,EAAE,KAAKntB,SAAS,IAAImtB,EAAE,KAAK,CAAC,EAAE,OAAOC,EAAE,KAAKptB,SAAS,IAAIotB,EAAE,KAAK,CAAC,CAAA;QACrE,OAAOD,EAAE,KAAKC,EAAE,CAAA;EAClB,KAAA;EAEA,IAAA,KAAA,IAAAC,GAAA,GAAA,CAAA,EAAAC,cAAA,GAAgBvF,cAAY,EAAAsF,GAAA,GAAAC,cAAA,CAAAhsB,MAAA,EAAA+rB,GAAA,EAAE,EAAA;EAAzB,MAAA,IAAMzT,CAAC,GAAA0T,cAAA,CAAAD,GAAA,CAAA,CAAA;EACV,MAAA,IAAI,CAACH,EAAE,CAAC,IAAI,CAACtM,MAAM,CAAChH,CAAC,CAAC,EAAEjM,KAAK,CAACiT,MAAM,CAAChH,CAAC,CAAC,CAAC,EAAE;EACxC,QAAA,OAAO,KAAK,CAAA;EACd,OAAA;EACF,KAAA;EACA,IAAA,OAAO,IAAI,CAAA;KACZ,CAAA;EAAAlb,EAAAA,YAAA,CAAA2pB,QAAA,EAAA,CAAA;MAAA1pB,GAAA,EAAA,QAAA;MAAAC,GAAA,EAzjBD,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;EAC9C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,EAAA;MAAAlH,GAAA,EAAA,OAAA;MAAAC,GAAA,EAsbD,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC5F,KAAK,IAAI,CAAC,GAAGzY,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;EACb,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC3F,QAAQ,IAAI,CAAC,GAAG1Y,GAAG,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAa;EACX,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC9U,MAAM,IAAI,CAAC,GAAGvJ,GAAG,CAAA;EACrD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC1F,KAAK,IAAI,CAAC,GAAG3Y,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,MAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;EACT,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACzF,IAAI,IAAI,CAAC,GAAG5Y,GAAG,CAAA;EACnD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAY;EACV,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC/G,KAAK,IAAI,CAAC,GAAGtX,GAAG,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACpY,OAAO,IAAI,CAAC,GAAGjG,GAAG,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAACxF,OAAO,IAAI,CAAC,GAAG7Y,GAAG,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACuB,MAAM,CAAC+C,YAAY,IAAI,CAAC,GAAGphB,GAAG,CAAA;EAC3D,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7qB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA0W,QAAA,CAAA;EAAA,CAAA,CApWAkF,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ECtmB3C,IAAM/F,SAAO,GAAG,kBAAkB,CAAA;;EAElC;EACA,SAASgG,gBAAgBA,CAAC/O,KAAK,EAAEE,GAAG,EAAE;EACpC,EAAA,IAAI,CAACF,KAAK,IAAI,CAACA,KAAK,CAACW,OAAO,EAAE;EAC5B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,0BAA0B,CAAC,CAAA;KACpD,MAAM,IAAI,CAAC5K,GAAG,IAAI,CAACA,GAAG,CAACS,OAAO,EAAE;EAC/B,IAAA,OAAOqO,QAAQ,CAAClE,OAAO,CAAC,wBAAwB,CAAC,CAAA;EACnD,GAAC,MAAM,IAAI5K,GAAG,GAAGF,KAAK,EAAE;EACtB,IAAA,OAAOgP,QAAQ,CAAClE,OAAO,CACrB,kBAAkB,yEACmD9K,KAAK,CAACkM,KAAK,EAAE,GAAYhM,WAAAA,GAAAA,GAAG,CAACgM,KAAK,EACzG,CAAC,CAAA;EACH,GAAC,MAAM;EACL,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqB8C,MAAAA,QAAQ,0BAAArE,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAAqE,QAAAA,CAAYpE,MAAM,EAAE;EAClB;EACJ;EACA;EACI,IAAA,IAAI,CAACxtB,CAAC,GAAGwtB,MAAM,CAAC5K,KAAK,CAAA;EACrB;EACJ;EACA;EACI,IAAA,IAAI,CAACtc,CAAC,GAAGknB,MAAM,CAAC1K,GAAG,CAAA;EACnB;EACJ;EACA;EACI,IAAA,IAAI,CAAC4K,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;EACrC;EACJ;EACA;MACI,IAAI,CAACmE,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;IALED,QAAA,CAMOlE,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAItW,oBAAoB,CAACwuB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAIkE,QAAQ,CAAC;EAAElE,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAkE,QAAA,CAMOE,aAAa,GAApB,SAAAA,cAAqBlP,KAAK,EAAEE,GAAG,EAAE;EAC/B,IAAA,IAAMiP,UAAU,GAAGC,gBAAgB,CAACpP,KAAK,CAAC;EACxCqP,MAAAA,QAAQ,GAAGD,gBAAgB,CAAClP,GAAG,CAAC,CAAA;EAElC,IAAA,IAAMoP,aAAa,GAAGP,gBAAgB,CAACI,UAAU,EAAEE,QAAQ,CAAC,CAAA;MAE5D,IAAIC,aAAa,IAAI,IAAI,EAAE;QACzB,OAAO,IAAIN,QAAQ,CAAC;EAClBhP,QAAAA,KAAK,EAAEmP,UAAU;EACjBjP,QAAAA,GAAG,EAAEmP,QAAAA;EACP,OAAC,CAAC,CAAA;EACJ,KAAC,MAAM;EACL,MAAA,OAAOC,aAAa,CAAA;EACtB,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAN,QAAA,CAMOO,KAAK,GAAZ,SAAAA,MAAavP,KAAK,EAAE8M,QAAQ,EAAE;EAC5B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;EAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAACpP,KAAK,CAAC,CAAA;EAC9B,IAAA,OAAOgP,QAAQ,CAACE,aAAa,CAACvnB,EAAE,EAAEA,EAAE,CAACkC,IAAI,CAACoX,GAAG,CAAC,CAAC,CAAA;EACjD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA+N,QAAA,CAMOQ,MAAM,GAAb,SAAAA,OAActP,GAAG,EAAE4M,QAAQ,EAAE;EAC3B,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC;EAC7CnlB,MAAAA,EAAE,GAAGynB,gBAAgB,CAAClP,GAAG,CAAC,CAAA;EAC5B,IAAA,OAAO8O,QAAQ,CAACE,aAAa,CAACvnB,EAAE,CAACslB,KAAK,CAAChM,GAAG,CAAC,EAAEtZ,EAAE,CAAC,CAAA;EAClD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAAqnB,QAAA,CAQO3D,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAE;EACzB,IAAA,IAAA+vB,MAAA,GAAe,CAACnE,IAAI,IAAI,EAAE,EAAE7Z,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;EAAlCrU,MAAAA,CAAC,GAAAqyB,MAAA,CAAA,CAAA,CAAA;EAAE/rB,MAAAA,CAAC,GAAA+rB,MAAA,CAAA,CAAA,CAAA,CAAA;MACX,IAAIryB,CAAC,IAAIsG,CAAC,EAAE;QACV,IAAIsc,KAAK,EAAE0P,YAAY,CAAA;QACvB,IAAI;UACF1P,KAAK,GAAGpY,QAAQ,CAACyjB,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;UACjCgwB,YAAY,GAAG1P,KAAK,CAACW,OAAO,CAAA;SAC7B,CAAC,OAAOjd,CAAC,EAAE;EACVgsB,QAAAA,YAAY,GAAG,KAAK,CAAA;EACtB,OAAA;QAEA,IAAIxP,GAAG,EAAEyP,UAAU,CAAA;QACnB,IAAI;UACFzP,GAAG,GAAGtY,QAAQ,CAACyjB,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;UAC/BiwB,UAAU,GAAGzP,GAAG,CAACS,OAAO,CAAA;SACzB,CAAC,OAAOjd,CAAC,EAAE;EACVisB,QAAAA,UAAU,GAAG,KAAK,CAAA;EACpB,OAAA;QAEA,IAAID,YAAY,IAAIC,UAAU,EAAE;EAC9B,QAAA,OAAOX,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAEE,GAAG,CAAC,CAAA;EAC3C,OAAA;EAEA,MAAA,IAAIwP,YAAY,EAAE;UAChB,IAAMzO,GAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAAC3nB,CAAC,EAAEhE,IAAI,CAAC,CAAA;UACrC,IAAIuhB,GAAG,CAACN,OAAO,EAAE;EACf,UAAA,OAAOqO,QAAQ,CAACO,KAAK,CAACvP,KAAK,EAAEiB,GAAG,CAAC,CAAA;EACnC,SAAA;SACD,MAAM,IAAI0O,UAAU,EAAE;UACrB,IAAM1O,IAAG,GAAG0I,QAAQ,CAAC0B,OAAO,CAACjuB,CAAC,EAAEsC,IAAI,CAAC,CAAA;UACrC,IAAIuhB,IAAG,CAACN,OAAO,EAAE;EACf,UAAA,OAAOqO,QAAQ,CAACQ,MAAM,CAACtP,GAAG,EAAEe,IAAG,CAAC,CAAA;EAClC,SAAA;EACF,OAAA;EACF,KAAA;MACA,OAAO+N,QAAQ,CAAClE,OAAO,CAAC,YAAY,EAAgBQ,cAAAA,GAAAA,IAAI,mCAA+B,CAAC,CAAA;EAC1F,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA0D,EAAAA,QAAA,CAKOY,UAAU,GAAjB,SAAAA,UAAAA,CAAkB5Y,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACiY,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA,EAAA,IAAA3vB,MAAA,GAAA0vB,QAAA,CAAAzvB,SAAA,CAAA;EAiDA;EACF;EACA;EACA;EACA;EAJED,EAAAA,MAAA,CAKAsD,MAAM,GAAN,SAAAA,MAAAA,CAAO9F,IAAI,EAAmB;EAAA,IAAA,IAAvBA,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;MAC1B,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACkP,UAAU,CAAAh0B,KAAA,CAAf,IAAI,EAAe,CAACiB,IAAI,CAAC,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,GAAG+G,GAAG,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;IAAAvE,MAAA,CASAqL,KAAK,GAAL,SAAAA,MAAM7N,IAAI,EAAmB4C,IAAI,EAAE;EAAA,IAAA,IAA7B5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EACzB,IAAA,IAAI,CAAC,IAAI,CAAC6jB,OAAO,EAAE,OAAO9c,GAAG,CAAA;MAC7B,IAAMmc,KAAK,GAAG,IAAI,CAACA,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC5C,IAAA,IAAIwgB,GAAG,CAAA;EACP,IAAA,IAAIxgB,IAAI,IAAA,IAAA,IAAJA,IAAI,CAAEqwB,cAAc,EAAE;EACxB7P,MAAAA,GAAG,GAAG,IAAI,CAACA,GAAG,CAACsN,WAAW,CAAC;UAAEhtB,MAAM,EAAEwf,KAAK,CAACxf,MAAAA;EAAO,OAAC,CAAC,CAAA;EACtD,KAAC,MAAM;QACL0f,GAAG,GAAG,IAAI,CAACA,GAAG,CAAA;EAChB,KAAA;MACAA,GAAG,GAAGA,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC7B,IAAA,OAAOuE,IAAI,CAAC2E,KAAK,CAACsX,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAC,IAAIojB,GAAG,CAAC2M,OAAO,EAAE,KAAK,IAAI,CAAC3M,GAAG,CAAC2M,OAAO,EAAE,CAAC,CAAA;EAC7F,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvtB,EAAAA,MAAA,CAKA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQnzB,IAAI,EAAE;EACZ,IAAA,OAAO,IAAI,CAAC6jB,OAAO,GAAG,IAAI,CAACuP,OAAO,EAAE,IAAI,IAAI,CAACxsB,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,CAACgD,OAAO,CAAC,IAAI,CAAC7yB,CAAC,EAAEN,IAAI,CAAC,GAAG,KAAK,CAAA;EACvF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAwC,EAAAA,MAAA,CAIA4wB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAAC9yB,CAAC,CAACyvB,OAAO,EAAE,KAAK,IAAI,CAACnpB,CAAC,CAACmpB,OAAO,EAAE,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAvtB,EAAAA,MAAA,CAKA6wB,OAAO,GAAP,SAAAA,OAAAA,CAAQzD,QAAQ,EAAE;EAChB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,GAAGsvB,QAAQ,CAAA;EAC1B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAptB,EAAAA,MAAA,CAKA8wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS1D,QAAQ,EAAE;EACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACjd,CAAC,IAAIgpB,QAAQ,CAAA;EAC3B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAptB,EAAAA,MAAA,CAKA+wB,QAAQ,GAAR,SAAAA,QAAAA,CAAS3D,QAAQ,EAAE;EACjB,IAAA,IAAI,CAAC,IAAI,CAAC/L,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,IAAI,CAACvjB,CAAC,IAAIsvB,QAAQ,IAAI,IAAI,CAAChpB,CAAC,GAAGgpB,QAAQ,CAAA;EAChD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAptB,EAAAA,MAAA,CAOAmC,GAAG,GAAH,SAAAA,GAAAA,CAAAuK,KAAA,EAAyB;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAjBgU,KAAK,GAAAzf,IAAA,CAALyf,KAAK;QAAEE,GAAG,GAAA3f,IAAA,CAAH2f,GAAG,CAAA;EACd,IAAA,IAAI,CAAC,IAAI,CAACS,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,OAAOqO,QAAQ,CAACE,aAAa,CAAClP,KAAK,IAAI,IAAI,CAAC5iB,CAAC,EAAE8iB,GAAG,IAAI,IAAI,CAACxc,CAAC,CAAC,CAAA;EAC/D,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKAgxB,OAAO,GAAP,SAAAA,UAAsB;EAAA,IAAA,IAAA3sB,KAAA,GAAA,IAAA,CAAA;EACpB,IAAA,IAAI,CAAC,IAAI,CAACgd,OAAO,EAAE,OAAO,EAAE,CAAA;EAAC,IAAA,KAAA,IAAA0B,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EADpB2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;EAElB,IAAA,IAAMiO,MAAM,GAAGD,SAAS,CACnBvmB,GAAG,CAAColB,gBAAgB,CAAC,CACrBpN,MAAM,CAAC,UAAC1O,CAAC,EAAA;EAAA,QAAA,OAAK3P,KAAI,CAAC0sB,QAAQ,CAAC/c,CAAC,CAAC,CAAA;EAAA,OAAA,CAAC,CAC/Bmd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;UAAA,OAAK3Y,CAAC,CAACsU,QAAQ,EAAE,GAAGqE,CAAC,CAACrE,QAAQ,EAAE,CAAA;SAAC,CAAA;EAC9Cle,MAAAA,OAAO,GAAG,EAAE,CAAA;EACV,IAAA,IAAE/Q,CAAC,GAAK,IAAI,CAAVA,CAAC;EACLuF,MAAAA,CAAC,GAAG,CAAC,CAAA;EAEP,IAAA,OAAOvF,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;QACjB,IAAMitB,KAAK,GAAGH,MAAM,CAAC7tB,CAAC,CAAC,IAAI,IAAI,CAACe,CAAC;EAC/BkU,QAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;QAC1CxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;EAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;EACRjV,MAAAA,CAAC,IAAI,CAAC,CAAA;EACR,KAAA;EAEA,IAAA,OAAOwL,OAAO,CAAA;EAChB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA7O,EAAAA,MAAA,CAMAsxB,OAAO,GAAP,SAAAA,OAAAA,CAAQ9D,QAAQ,EAAE;EAChB,IAAA,IAAM7L,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;EAE/C,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,IAAI,CAACM,GAAG,CAACN,OAAO,IAAIM,GAAG,CAACwM,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;EACjE,MAAA,OAAO,EAAE,CAAA;EACX,KAAA;EAEI,IAAA,IAAErwB,CAAC,GAAK,IAAI,CAAVA,CAAC;EACLyzB,MAAAA,GAAG,GAAG,CAAC;QACPjZ,IAAI,CAAA;MAEN,IAAMzJ,OAAO,GAAG,EAAE,CAAA;EAClB,IAAA,OAAO/Q,CAAC,GAAG,IAAI,CAACsG,CAAC,EAAE;EACjB,MAAA,IAAMitB,KAAK,GAAG,IAAI,CAAC3Q,KAAK,CAACnW,IAAI,CAACoX,GAAG,CAACkM,QAAQ,CAAC,UAACzU,CAAC,EAAA;UAAA,OAAKA,CAAC,GAAGmY,GAAG,CAAA;EAAA,OAAA,CAAC,CAAC,CAAA;EAC3DjZ,MAAAA,IAAI,GAAG,CAAC+Y,KAAK,GAAG,CAAC,IAAI,CAACjtB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGitB,KAAK,CAAA;QACxCxiB,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEwa,IAAI,CAAC,CAAC,CAAA;EAC7Cxa,MAAAA,CAAC,GAAGwa,IAAI,CAAA;EACRiZ,MAAAA,GAAG,IAAI,CAAC,CAAA;EACV,KAAA;EAEA,IAAA,OAAO1iB,OAAO,CAAA;EAChB,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA7O,EAAAA,MAAA,CAKAwxB,aAAa,GAAb,SAAAA,aAAAA,CAAcC,aAAa,EAAE;EAC3B,IAAA,IAAI,CAAC,IAAI,CAACpQ,OAAO,EAAE,OAAO,EAAE,CAAA;EAC5B,IAAA,OAAO,IAAI,CAACiQ,OAAO,CAAC,IAAI,CAAChuB,MAAM,EAAE,GAAGmuB,aAAa,CAAC,CAACjQ,KAAK,CAAC,CAAC,EAAEiQ,aAAa,CAAC,CAAA;EAC5E,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAzxB,EAAAA,MAAA,CAKA0xB,QAAQ,GAAR,SAAAA,QAAAA,CAAS/hB,KAAK,EAAE;EACd,IAAA,OAAO,IAAI,CAACvL,CAAC,GAAGuL,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAACvL,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKA2xB,UAAU,GAAV,SAAAA,UAAAA,CAAWhiB,KAAK,EAAE;EAChB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,CAAC,IAAI,CAACjd,CAAC,KAAK,CAACuL,KAAK,CAAC7R,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAkC,EAAAA,MAAA,CAKA4xB,QAAQ,GAAR,SAAAA,QAAAA,CAASjiB,KAAK,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;MAC/B,OAAO,CAAC1R,KAAK,CAACvL,CAAC,KAAK,CAAC,IAAI,CAACtG,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAkC,EAAAA,MAAA,CAKA6xB,OAAO,GAAP,SAAAA,OAAAA,CAAQliB,KAAK,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,KAAK,CAAA;EAC/B,IAAA,OAAO,IAAI,CAACvjB,CAAC,IAAI6R,KAAK,CAAC7R,CAAC,IAAI,IAAI,CAACsG,CAAC,IAAIuL,KAAK,CAACvL,CAAC,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApE,EAAAA,MAAA,CAKAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;MACZ,IAAI,CAAC,IAAI,CAAC0R,OAAO,IAAI,CAAC1R,KAAK,CAAC0R,OAAO,EAAE;EACnC,MAAA,OAAO,KAAK,CAAA;EACd,KAAA;MAEA,OAAO,IAAI,CAACvjB,CAAC,CAAC0C,MAAM,CAACmP,KAAK,CAAC7R,CAAC,CAAC,IAAI,IAAI,CAACsG,CAAC,CAAC5D,MAAM,CAACmP,KAAK,CAACvL,CAAC,CAAC,CAAA;EACzD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAApE,EAAAA,MAAA,CAOA8xB,YAAY,GAAZ,SAAAA,YAAAA,CAAaniB,KAAK,EAAE;EAClB,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;EAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;MAEzC,IAAItG,CAAC,IAAIsG,CAAC,EAAE;EACV,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM;EACL,MAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAApE,EAAAA,MAAA,CAMA+xB,KAAK,GAAL,SAAAA,KAAAA,CAAMpiB,KAAK,EAAE;EACX,IAAA,IAAI,CAAC,IAAI,CAAC0R,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMvjB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG6R,KAAK,CAAC7R,CAAC;EAC3CsG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuL,KAAK,CAACvL,CAAC,CAAA;EACzC,IAAA,OAAOsrB,QAAQ,CAACE,aAAa,CAAC9xB,CAAC,EAAEsG,CAAC,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;EAAAsrB,EAAAA,QAAA,CASOsC,KAAK,GAAZ,SAAAA,KAAAA,CAAaC,SAAS,EAAE;MACtB,IAAAC,qBAAA,GAAuBD,SAAS,CAC7Bd,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;EAAA,QAAA,OAAK3Y,CAAC,CAAC3a,CAAC,GAAGszB,CAAC,CAACtzB,CAAC,CAAA;EAAA,OAAA,CAAC,CACzBsa,MAAM,CACL,UAAA3T,KAAA,EAAmBghB,IAAI,EAAK;UAAA,IAA1B0M,KAAK,GAAA1tB,KAAA,CAAA,CAAA,CAAA;EAAEob,UAAAA,OAAO,GAAApb,KAAA,CAAA,CAAA,CAAA,CAAA;UACd,IAAI,CAACob,OAAO,EAAE;EACZ,UAAA,OAAO,CAACsS,KAAK,EAAE1M,IAAI,CAAC,CAAA;EACtB,SAAC,MAAM,IAAI5F,OAAO,CAAC6R,QAAQ,CAACjM,IAAI,CAAC,IAAI5F,OAAO,CAAC8R,UAAU,CAAClM,IAAI,CAAC,EAAE;YAC7D,OAAO,CAAC0M,KAAK,EAAEtS,OAAO,CAACkS,KAAK,CAACtM,IAAI,CAAC,CAAC,CAAA;EACrC,SAAC,MAAM;YACL,OAAO,CAAC0M,KAAK,CAACjW,MAAM,CAAC,CAAC2D,OAAO,CAAC,CAAC,EAAE4F,IAAI,CAAC,CAAA;EACxC,SAAA;EACF,OAAC,EACD,CAAC,EAAE,EAAE,IAAI,CACX,CAAC;EAbIlD,MAAAA,KAAK,GAAA2P,qBAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,KAAK,GAAAF,qBAAA,CAAA,CAAA,CAAA,CAAA;EAcnB,IAAA,IAAIE,KAAK,EAAE;EACT7P,MAAAA,KAAK,CAAC/Z,IAAI,CAAC4pB,KAAK,CAAC,CAAA;EACnB,KAAA;EACA,IAAA,OAAO7P,KAAK,CAAA;EACd,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAmN,EAAAA,QAAA,CAKO2C,GAAG,GAAV,SAAAA,GAAAA,CAAWJ,SAAS,EAAE;EAAA,IAAA,IAAAK,gBAAA,CAAA;MACpB,IAAI5R,KAAK,GAAG,IAAI;EACd6R,MAAAA,YAAY,GAAG,CAAC,CAAA;MAClB,IAAM1jB,OAAO,GAAG,EAAE;EAChB2jB,MAAAA,IAAI,GAAGP,SAAS,CAACvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;EAAA,QAAA,OAAK,CAC1B;YAAEovB,IAAI,EAAEpvB,CAAC,CAACvF,CAAC;EAAEwD,UAAAA,IAAI,EAAE,GAAA;EAAI,SAAC,EACxB;YAAEmxB,IAAI,EAAEpvB,CAAC,CAACe,CAAC;EAAE9C,UAAAA,IAAI,EAAE,GAAA;EAAI,SAAC,CACzB,CAAA;SAAC,CAAA;EACFoxB,MAAAA,SAAS,GAAG,CAAAJ,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIE,IAAI,CAAC;QAC3Cva,GAAG,GAAGya,SAAS,CAACvB,IAAI,CAAC,UAAC1Y,CAAC,EAAE2Y,CAAC,EAAA;EAAA,QAAA,OAAK3Y,CAAC,CAACga,IAAI,GAAGrB,CAAC,CAACqB,IAAI,CAAA;SAAC,CAAA,CAAA;EAEjD,IAAA,KAAA,IAAA1U,SAAA,GAAAC,+BAAA,CAAgB/F,GAAG,CAAA,EAAAgG,KAAA,EAAA,CAAA,CAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,MAAA,IAAV7a,CAAC,GAAA4a,KAAA,CAAAza,KAAA,CAAA;QACV+uB,YAAY,IAAIlvB,CAAC,CAAC/B,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAEvC,IAAIixB,YAAY,KAAK,CAAC,EAAE;UACtB7R,KAAK,GAAGrd,CAAC,CAACovB,IAAI,CAAA;EAChB,OAAC,MAAM;UACL,IAAI/R,KAAK,IAAI,CAACA,KAAK,KAAK,CAACrd,CAAC,CAACovB,IAAI,EAAE;EAC/B5jB,UAAAA,OAAO,CAACrG,IAAI,CAACknB,QAAQ,CAACE,aAAa,CAAClP,KAAK,EAAErd,CAAC,CAACovB,IAAI,CAAC,CAAC,CAAA;EACrD,SAAA;EAEA/R,QAAAA,KAAK,GAAG,IAAI,CAAA;EACd,OAAA;EACF,KAAA;EAEA,IAAA,OAAOgP,QAAQ,CAACsC,KAAK,CAACnjB,OAAO,CAAC,CAAA;EAChC,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA7O,EAAAA,MAAA,CAKA2yB,UAAU,GAAV,SAAAA,aAAyB;EAAA,IAAA,IAAA5kB,MAAA,GAAA,IAAA,CAAA;EAAA,IAAA,KAAA,IAAAsV,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2uB,SAAS,GAAAna,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAT0O,MAAAA,SAAS,CAAA1O,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,KAAA;EACrB,IAAA,OAAOmM,QAAQ,CAAC2C,GAAG,CAAC,CAAC,IAAI,CAAC,CAACnW,MAAM,CAAC+V,SAAS,CAAC,CAAC,CAC1CvnB,GAAG,CAAC,UAACrH,CAAC,EAAA;EAAA,MAAA,OAAK0K,MAAI,CAAC+jB,YAAY,CAACzuB,CAAC,CAAC,CAAA;EAAA,KAAA,CAAC,CAChCqf,MAAM,CAAC,UAACrf,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,IAAI,CAACA,CAAC,CAACutB,OAAO,EAAE,CAAA;OAAC,CAAA,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5wB,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,IAAI,CAAC,IAAI,CAACyR,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAA,GAAA,GAAW,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,EAAE,GAAM,UAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,GAAA,CAAA;EAC/C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAA5sB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,oBAAA,GAA4B,IAAI,CAACvjB,CAAC,CAAC8uB,KAAK,EAAE,GAAU,SAAA,GAAA,IAAI,CAACxoB,CAAC,CAACwoB,KAAK,EAAE,GAAA,IAAA,CAAA;EACpE,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAACU,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAjBE;IAAAttB,MAAA,CAkBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;EAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG3B,UAAkB,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAChG,CAAC,CAAC6K,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACK,cAAc,CAAC,IAAI,CAAC,GACzEiJ,SAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAzpB,EAAAA,MAAA,CAMA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAMxsB,IAAI,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC8uB,KAAK,CAACxsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACwoB,KAAK,CAACxsB,IAAI,CAAC,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAJ,EAAAA,MAAA,CAMA6yB,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAACxR,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+0B,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACzuB,CAAC,CAACyuB,SAAS,EAAE,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA7yB,EAAAA,MAAA,CAOA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAUzsB,IAAI,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAU,IAAI,CAAC3rB,CAAC,CAAC+uB,SAAS,CAACzsB,IAAI,CAAC,GAAI,GAAA,GAAA,IAAI,CAACgE,CAAC,CAACyoB,SAAS,CAACzsB,IAAI,CAAC,CAAA;EAC5D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAJ,MAAA,CAWAqsB,QAAQ,GAAR,SAAAA,SAASyG,UAAU,EAAAC,MAAA,EAA8B;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAE,eAAA,GAAAD,KAAA,CAAxBE,SAAS;EAATA,MAAAA,SAAS,GAAAD,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;EACtC,IAAA,IAAI,CAAC,IAAI,CAAC5R,OAAO,EAAE,OAAOoI,SAAO,CAAA;EACjC,IAAA,OAAA,EAAA,GAAU,IAAI,CAAC3rB,CAAC,CAACuuB,QAAQ,CAACyG,UAAU,CAAC,GAAGI,SAAS,GAAG,IAAI,CAAC9uB,CAAC,CAACioB,QAAQ,CAACyG,UAAU,CAAC,CAAA;EACjF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA9yB,MAAA,CAYAuwB,UAAU,GAAV,SAAAA,WAAW/yB,IAAI,EAAE4C,IAAI,EAAE;EACrB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;EACjB,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,IAAI,CAAC8B,aAAa,CAAC,CAAA;EAC7C,KAAA;EACA,IAAA,OAAO,IAAI,CAAClpB,CAAC,CAACssB,IAAI,CAAC,IAAI,CAAC5yB,CAAC,EAAEN,IAAI,EAAE4C,IAAI,CAAC,CAAA;EACxC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAJ,EAAAA,MAAA,CAOAmzB,YAAY,GAAZ,SAAAA,YAAAA,CAAaC,KAAK,EAAE;EAClB,IAAA,OAAO1D,QAAQ,CAACE,aAAa,CAACwD,KAAK,CAAC,IAAI,CAACt1B,CAAC,CAAC,EAAEs1B,KAAK,CAAC,IAAI,CAAChvB,CAAC,CAAC,CAAC,CAAA;KAC5D,CAAA;EAAA1D,EAAAA,YAAA,CAAAgvB,QAAA,EAAA,CAAA;MAAA/uB,GAAA,EAAA,OAAA;MAAAC,GAAA,EAjeD,SAAAA,GAAAA,GAAY;QACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACvjB,CAAC,GAAG,IAAI,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA6C,GAAA,EAAA,KAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;QACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACjd,CAAC,GAAG,IAAI,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAzD,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAI,IAAI,CAACjd,CAAC,GAAG,IAAI,CAACA,CAAC,CAACupB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAI,IAAI,CAAA;EAChE,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAhtB,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC0sB,aAAa,KAAK,IAAI,CAAA;EACpC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA3sB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA+b,QAAA,CAAA;EAAA,CAAA,CAwUAH,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;;ECriB3C;EACA;EACA;AAFA,MAGqB6D,IAAI,gBAAA,YAAA;EAAA,EAAA,SAAAA,IAAA,GAAA,EAAA;EACvB;EACF;EACA;EACA;EACA;EAJEA,EAAAA,IAAA,CAKOC,MAAM,GAAb,SAAAA,MAAAA,CAAcvvB,IAAI,EAAyB;EAAA,IAAA,IAA7BA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAGgI,QAAQ,CAACwE,WAAW,CAAA;EAAA,KAAA;EACvC,IAAA,IAAMgjB,KAAK,GAAGjrB,QAAQ,CAAC8K,GAAG,EAAE,CAAC9I,OAAO,CAACvG,IAAI,CAAC,CAAC5B,GAAG,CAAC;EAAEjE,MAAAA,KAAK,EAAE,EAAA;EAAG,KAAC,CAAC,CAAA;EAE7D,IAAA,OAAO,CAAC6F,IAAI,CAACyvB,WAAW,IAAID,KAAK,CAAChzB,MAAM,KAAKgzB,KAAK,CAACpxB,GAAG,CAAC;EAAEjE,MAAAA,KAAK,EAAE,CAAA;OAAG,CAAC,CAACqC,MAAM,CAAA;EAC7E,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA8yB,EAAAA,IAAA,CAKOI,eAAe,GAAtB,SAAAA,eAAAA,CAAuB1vB,IAAI,EAAE;EAC3B,IAAA,OAAOF,QAAQ,CAACM,WAAW,CAACJ,IAAI,CAAC,CAAA;EACnC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;EAAAsvB,EAAAA,IAAA,CAcOhjB,aAAa,GAApB,SAAAA,eAAAA,CAAqBC,KAAK,EAAE;EAC1B,IAAA,OAAOD,aAAa,CAACC,KAAK,EAAEvE,QAAQ,CAACwE,WAAW,CAAC,CAAA;EACnD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA8iB,EAAAA,IAAA,CAOO7jB,cAAc,GAArB,SAAAA,cAAAA,CAAA9C,KAAA,EAA6D;EAAA,IAAA,IAAAzL,IAAA,GAAAyL,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAAgnB,WAAA,GAAAzyB,IAAA,CAAnCC,MAAM;EAANA,MAAAA,MAAM,GAAAwyB,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA;QAAAC,WAAA,GAAA1yB,IAAA,CAAE2yB,MAAM;EAANA,MAAAA,MAAM,GAAAD,WAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,WAAA,CAAA;EAClD,IAAA,OAAO,CAACC,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEsO,cAAc,EAAE,CAAA;EAC3D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA6jB,EAAAA,IAAA,CAQOQ,yBAAyB,GAAhC,SAAAA,yBAAAA,CAAAd,MAAA,EAAwE;EAAA,IAAA,IAAAtuB,KAAA,GAAAsuB,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAe,YAAA,GAAArvB,KAAA,CAAnCvD,MAAM;EAANA,MAAAA,MAAM,GAAA4yB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,YAAA,GAAAtvB,KAAA,CAAEmvB,MAAM;EAANA,MAAAA,MAAM,GAAAG,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAC7D,IAAA,OAAO,CAACH,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEuO,qBAAqB,EAAE,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA4jB,EAAAA,IAAA,CAOOW,kBAAkB,GAAzB,SAAAA,kBAAAA,CAAAC,MAAA,EAAiE;EAAA,IAAA,IAAAjB,KAAA,GAAAiB,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAC,YAAA,GAAAlB,KAAA,CAAnC9xB,MAAM;EAANA,MAAAA,MAAM,GAAAgzB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,YAAA,GAAAnB,KAAA,CAAEY,MAAM;EAANA,MAAAA,MAAM,GAAAO,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EACtD;EACA,IAAA,OAAO,CAACP,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,EAAEwO,cAAc,EAAE,CAAC8R,KAAK,EAAE,CAAA;EACnE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;IAAA6R,IAAA,CAiBOvlB,MAAM,GAAb,SAAAA,OACExK,MAAM,EAAA8wB,MAAA,EAEN;EAAA,IAAA,IAFA9wB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA+wB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAAvFnzB,MAAM;EAANA,MAAAA,MAAM,GAAAozB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAExsB,eAAe;EAAfA,MAAAA,eAAe,GAAA0sB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAET,MAAM;EAANA,MAAAA,MAAM,GAAAY,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,oBAAA,GAAAJ,KAAA,CAAErsB,cAAc;EAAdA,MAAAA,cAAc,GAAAysB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;EAElF,IAAA,OAAO,CAACb,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,CAAC,CAAA;EAC1F,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;IAAA+vB,IAAA,CAaOqB,YAAY,GAAnB,SAAAA,aACEpxB,MAAM,EAAAqxB,MAAA,EAEN;EAAA,IAAA,IAFArxB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAAsxB,KAAA,GAAAD,MAAA,cACwE,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAAvF1zB,MAAM;EAANA,MAAAA,MAAM,GAAA2zB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAE/sB,eAAe;EAAfA,MAAAA,eAAe,GAAAitB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAEhB,MAAM;EAANA,MAAAA,MAAM,GAAAmB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,oBAAA,GAAAJ,KAAA,CAAE5sB,cAAc;EAAdA,MAAAA,cAAc,GAAAgtB,oBAAA,KAAG,KAAA,CAAA,GAAA,SAAS,GAAAA,oBAAA,CAAA;EAElF,IAAA,OAAO,CAACpB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAEG,cAAc,CAAC,EAAE8F,MAAM,CAACxK,MAAM,EAAE,IAAI,CAAC,CAAA;EAChG,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAA+vB,IAAA,CAcOhlB,QAAQ,GAAf,SAAAA,SAAgB/K,MAAM,EAAA2xB,MAAA,EAA0E;EAAA,IAAA,IAAhF3xB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA4xB,KAAA,GAAAD,MAAA,cAA6D,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAA3Dh0B,MAAM;EAANA,MAAAA,MAAM,GAAAi0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAErtB,eAAe;EAAfA,MAAAA,eAAe,GAAAutB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAEtB,MAAM;EAANA,MAAAA,MAAM,GAAAyB,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EACrF,IAAA,OAAO,CAACzB,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,CAAC,CAAA;EAClF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA+vB,IAAA,CAYOiC,cAAc,GAArB,SAAAA,eACEhyB,MAAM,EAAAiyB,MAAA,EAEN;EAAA,IAAA,IAFAjyB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,MAAM,CAAA;EAAA,KAAA;EAAA,IAAA,IAAAkyB,KAAA,GAAAD,MAAA,cAC4C,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAA3Dt0B,MAAM;EAANA,MAAAA,MAAM,GAAAu0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAAF,KAAA,CAAE3tB,eAAe;EAAfA,MAAAA,eAAe,GAAA6tB,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;QAAAC,YAAA,GAAAH,KAAA,CAAE5B,MAAM;EAANA,MAAAA,MAAM,GAAA+B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAEtD,IAAA,OAAO,CAAC/B,MAAM,IAAI9sB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE2G,eAAe,EAAE,IAAI,CAAC,EAAEwG,QAAQ,CAAC/K,MAAM,EAAE,IAAI,CAAC,CAAA;EACxF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA+vB,EAAAA,IAAA,CAQO9kB,SAAS,GAAhB,SAAAA,SAAAA,CAAAqnB,MAAA,EAAyC;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAApB30B,MAAM;EAANA,MAAAA,MAAM,GAAA40B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;MAC9B,OAAOhvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,CAAC,CAACqN,SAAS,EAAE,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;IAAA8kB,IAAA,CAUO5kB,IAAI,GAAX,SAAAA,KAAYnL,MAAM,EAAAyyB,MAAA,EAAoC;EAAA,IAAA,IAA1CzyB,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,OAAO,CAAA;EAAA,KAAA;EAAA,IAAA,IAAA0yB,KAAA,GAAAD,MAAA,cAAsB,EAAE,GAAAA,MAAA;QAAAE,YAAA,GAAAD,KAAA,CAApB90B,MAAM;EAANA,MAAAA,MAAM,GAAA+0B,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA,CAAA;EAC3C,IAAA,OAAOnvB,MAAM,CAAChD,MAAM,CAAC5C,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAACuN,IAAI,CAACnL,MAAM,CAAC,CAAA;EAC5D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;EAAA+vB,EAAAA,IAAA,CASO6C,QAAQ,GAAf,SAAAA,WAAkB;MAChB,OAAO;QAAEC,QAAQ,EAAEjrB,WAAW,EAAE;QAAEkrB,UAAU,EAAE7mB,iBAAiB,EAAC;OAAG,CAAA;KACpE,CAAA;EAAA,EAAA,OAAA8jB,IAAA,CAAA;EAAA,CAAA;;ECzMH,SAASgD,OAAOA,CAACC,OAAO,EAAEC,KAAK,EAAE;EAC/B,EAAA,IAAMC,WAAW,GAAG,SAAdA,WAAWA,CAAInuB,EAAE,EAAA;EAAA,MAAA,OAAKA,EAAE,CAACouB,KAAK,CAAC,CAAC,EAAE;EAAEC,QAAAA,aAAa,EAAE,IAAA;SAAM,CAAC,CAAClG,OAAO,CAAC,KAAK,CAAC,CAACjD,OAAO,EAAE,CAAA;EAAA,KAAA;MACvFnlB,EAAE,GAAGouB,WAAW,CAACD,KAAK,CAAC,GAAGC,WAAW,CAACF,OAAO,CAAC,CAAA;EAChD,EAAA,OAAO3xB,IAAI,CAAC2E,KAAK,CAAC+gB,QAAQ,CAACqB,UAAU,CAACtjB,EAAE,CAAC,CAAC+lB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAA;EACvD,CAAA;EAEA,SAASwI,cAAcA,CAAChT,MAAM,EAAE4S,KAAK,EAAExZ,KAAK,EAAE;IAC5C,IAAM6Z,OAAO,GAAG,CACd,CAAC,OAAO,EAAE,UAACne,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,CAAA;EAAA,GAAA,CAAC,EACpC,CAAC,UAAU,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAAC3P,OAAO,GAAGhJ,CAAC,CAACgJ,OAAO,GAAG,CAAC2P,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,CAAC,CAAA;EAAA,GAAA,CAAC,EACrE,CAAC,QAAQ,EAAE,UAACwa,CAAC,EAAE2Y,CAAC,EAAA;EAAA,IAAA,OAAKA,CAAC,CAAClzB,KAAK,GAAGua,CAAC,CAACva,KAAK,GAAG,CAACkzB,CAAC,CAACnzB,IAAI,GAAGwa,CAAC,CAACxa,IAAI,IAAI,EAAE,CAAA;KAAC,CAAA,EAChE,CACE,OAAO,EACP,UAACwa,CAAC,EAAE2Y,CAAC,EAAK;EACR,IAAA,IAAMjU,IAAI,GAAGkZ,OAAO,CAAC5d,CAAC,EAAE2Y,CAAC,CAAC,CAAA;EAC1B,IAAA,OAAO,CAACjU,IAAI,GAAIA,IAAI,GAAG,CAAE,IAAI,CAAC,CAAA;EAChC,GAAC,CACF,EACD,CAAC,MAAM,EAAEkZ,OAAO,CAAC,CAClB,CAAA;IAED,IAAMxnB,OAAO,GAAG,EAAE,CAAA;IAClB,IAAMynB,OAAO,GAAG3S,MAAM,CAAA;IACtB,IAAIkT,WAAW,EAAEC,SAAS,CAAA;;EAE1B;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACE,EAAA,KAAA,IAAA7S,EAAA,GAAA,CAAA,EAAA8S,QAAA,GAA6BH,OAAO,EAAA3S,EAAA,GAAA8S,QAAA,CAAAzzB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAjC,IAAA,IAAA+S,WAAA,GAAAD,QAAA,CAAA9S,EAAA,CAAA;EAAOzmB,MAAAA,IAAI,GAAAw5B,WAAA,CAAA,CAAA,CAAA;EAAEC,MAAAA,MAAM,GAAAD,WAAA,CAAA,CAAA,CAAA,CAAA;MACtB,IAAIja,KAAK,CAACzV,OAAO,CAAC9J,IAAI,CAAC,IAAI,CAAC,EAAE;EAC5Bq5B,MAAAA,WAAW,GAAGr5B,IAAI,CAAA;QAElBqR,OAAO,CAACrR,IAAI,CAAC,GAAGy5B,MAAM,CAACtT,MAAM,EAAE4S,KAAK,CAAC,CAAA;EACrCO,MAAAA,SAAS,GAAGR,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;QAEjC,IAAIioB,SAAS,GAAGP,KAAK,EAAE;EACrB;UACA1nB,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;EACfmmB,QAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;;EAE9B;EACA;EACA;UACA,IAAI8U,MAAM,GAAG4S,KAAK,EAAE;EAClB;EACAO,UAAAA,SAAS,GAAGnT,MAAM,CAAA;EAClB;YACA9U,OAAO,CAACrR,IAAI,CAAC,EAAE,CAAA;EACfmmB,UAAAA,MAAM,GAAG2S,OAAO,CAAC/rB,IAAI,CAACsE,OAAO,CAAC,CAAA;EAChC,SAAA;EACF,OAAC,MAAM;EACL8U,QAAAA,MAAM,GAAGmT,SAAS,CAAA;EACpB,OAAA;EACF,KAAA;EACF,GAAA;IAEA,OAAO,CAACnT,MAAM,EAAE9U,OAAO,EAAEioB,SAAS,EAAED,WAAW,CAAC,CAAA;EAClD,CAAA;EAEe,cAAA,EAAUP,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAE3c,IAAI,EAAE;IACpD,IAAA82B,eAAA,GAAgDP,cAAc,CAACL,OAAO,EAAEC,KAAK,EAAExZ,KAAK,CAAC;EAAhF4G,IAAAA,MAAM,GAAAuT,eAAA,CAAA,CAAA,CAAA;EAAEroB,IAAAA,OAAO,GAAAqoB,eAAA,CAAA,CAAA,CAAA;EAAEJ,IAAAA,SAAS,GAAAI,eAAA,CAAA,CAAA,CAAA;EAAEL,IAAAA,WAAW,GAAAK,eAAA,CAAA,CAAA,CAAA,CAAA;EAE5C,EAAA,IAAMC,eAAe,GAAGZ,KAAK,GAAG5S,MAAM,CAAA;EAEtC,EAAA,IAAMyT,eAAe,GAAGra,KAAK,CAAC2F,MAAM,CAClC,UAAC9G,CAAC,EAAA;EAAA,IAAA,OAAK,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAACtU,OAAO,CAACsU,CAAC,CAAC,IAAI,CAAC,CAAA;EAAA,GACxE,CAAC,CAAA;EAED,EAAA,IAAIwb,eAAe,CAAC9zB,MAAM,KAAK,CAAC,EAAE;MAChC,IAAIwzB,SAAS,GAAGP,KAAK,EAAE;EAAA,MAAA,IAAAc,YAAA,CAAA;EACrBP,MAAAA,SAAS,GAAGnT,MAAM,CAACpZ,IAAI,EAAA8sB,YAAA,GAAA,EAAA,EAAAA,YAAA,CAAIR,WAAW,CAAG,GAAA,CAAC,EAAAQ,YAAA,EAAG,CAAA;EAC/C,KAAA;MAEA,IAAIP,SAAS,KAAKnT,MAAM,EAAE;EACxB9U,MAAAA,OAAO,CAACgoB,WAAW,CAAC,GAAG,CAAChoB,OAAO,CAACgoB,WAAW,CAAC,IAAI,CAAC,IAAIM,eAAe,IAAIL,SAAS,GAAGnT,MAAM,CAAC,CAAA;EAC7F,KAAA;EACF,GAAA;IAEA,IAAM6J,QAAQ,GAAGnD,QAAQ,CAAC5d,UAAU,CAACoC,OAAO,EAAEzO,IAAI,CAAC,CAAA;EAEnD,EAAA,IAAIg3B,eAAe,CAAC9zB,MAAM,GAAG,CAAC,EAAE;EAAA,IAAA,IAAAg0B,oBAAA,CAAA;MAC9B,OAAO,CAAAA,oBAAA,GAAAjN,QAAQ,CAACqB,UAAU,CAACyL,eAAe,EAAE/2B,IAAI,CAAC,EAC9CqiB,OAAO,CAAAlmB,KAAA,CAAA+6B,oBAAA,EAAIF,eAAe,CAAC,CAC3B7sB,IAAI,CAACijB,QAAQ,CAAC,CAAA;EACnB,GAAC,MAAM;EACL,IAAA,OAAOA,QAAQ,CAAA;EACjB,GAAA;EACF;;ECtFA,IAAM+J,WAAW,GAAG,mDAAmD,CAAA;EAEvE,SAASC,OAAOA,CAACtkB,KAAK,EAAEukB,IAAI,EAAa;EAAA,EAAA,IAAjBA,IAAI,KAAA,KAAA,CAAA,EAAA;MAAJA,IAAI,GAAG,SAAAA,IAAAA,CAACp0B,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAAA;EAAA,KAAA,CAAA;EAAA,GAAA;IACrC,OAAO;EAAE6P,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAAz2B,IAAA,EAAA;QAAA,IAAEnD,CAAC,GAAAmD,IAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAMw2B,IAAI,CAACrlB,WAAW,CAACtU,CAAC,CAAC,CAAC,CAAA;EAAA,KAAA;KAAE,CAAA;EACxD,CAAA;EAEA,IAAM65B,IAAI,GAAGC,MAAM,CAACC,YAAY,CAAC,GAAG,CAAC,CAAA;EACrC,IAAMC,WAAW,GAAQH,IAAAA,GAAAA,IAAI,GAAG,GAAA,CAAA;EAChC,IAAMI,iBAAiB,GAAG,IAAI5kB,MAAM,CAAC2kB,WAAW,EAAE,GAAG,CAAC,CAAA;EAEtD,SAASE,YAAYA,CAACl6B,CAAC,EAAE;EACvB;EACA;EACA,EAAA,OAAOA,CAAC,CAAC0E,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAACA,OAAO,CAACu1B,iBAAiB,EAAED,WAAW,CAAC,CAAA;EACzE,CAAA;EAEA,SAASG,oBAAoBA,CAACn6B,CAAC,EAAE;IAC/B,OAAOA,CAAC,CACL0E,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;EAAC,GACnBA,OAAO,CAACu1B,iBAAiB,EAAE,GAAG,CAAC;KAC/B9oB,WAAW,EAAE,CAAA;EAClB,CAAA;EAEA,SAASipB,KAAKA,CAACC,OAAO,EAAEC,UAAU,EAAE;IAClC,IAAID,OAAO,KAAK,IAAI,EAAE;EACpB,IAAA,OAAO,IAAI,CAAA;EACb,GAAC,MAAM;MACL,OAAO;EACLjlB,MAAAA,KAAK,EAAEC,MAAM,CAACglB,OAAO,CAACztB,GAAG,CAACstB,YAAY,CAAC,CAACrtB,IAAI,CAAC,GAAG,CAAC,CAAC;QAClD+sB,KAAK,EAAE,SAAAA,KAAAA,CAAAjzB,KAAA,EAAA;UAAA,IAAE3G,CAAC,GAAA2G,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,QAAA,OACR0zB,OAAO,CAACvjB,SAAS,CAAC,UAACvR,CAAC,EAAA;YAAA,OAAK40B,oBAAoB,CAACn6B,CAAC,CAAC,KAAKm6B,oBAAoB,CAAC50B,CAAC,CAAC,CAAA;EAAA,SAAA,CAAC,GAAG+0B,UAAU,CAAA;EAAA,OAAA;OAC7F,CAAA;EACH,GAAA;EACF,CAAA;EAEA,SAAS73B,MAAMA,CAAC2S,KAAK,EAAEmlB,MAAM,EAAE;IAC7B,OAAO;EAAEnlB,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAA1E,KAAA,EAAA;QAAA,IAAIsF,CAAC,GAAAtF,KAAA,CAAA,CAAA,CAAA;EAAEhkB,QAAAA,CAAC,GAAAgkB,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAM7iB,YAAY,CAACmoB,CAAC,EAAEtpB,CAAC,CAAC,CAAA;EAAA,KAAA;EAAEqpB,IAAAA,MAAM,EAANA,MAAAA;KAAQ,CAAA;EACnE,CAAA;EAEA,SAASE,MAAMA,CAACrlB,KAAK,EAAE;IACrB,OAAO;EAAEA,IAAAA,KAAK,EAALA,KAAK;MAAEwkB,KAAK,EAAE,SAAAA,KAAAA,CAAArD,KAAA,EAAA;QAAA,IAAEv2B,CAAC,GAAAu2B,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,MAAA,OAAMv2B,CAAC,CAAA;EAAA,KAAA;KAAE,CAAA;EACrC,CAAA;EAEA,SAAS06B,WAAWA,CAACh1B,KAAK,EAAE;EAC1B,EAAA,OAAOA,KAAK,CAAChB,OAAO,CAAC,6BAA6B,EAAE,MAAM,CAAC,CAAA;EAC7D,CAAA;;EAEA;EACA;EACA;EACA;EACA,SAASi2B,YAAYA,CAACta,KAAK,EAAExV,GAAG,EAAE;EAChC,EAAA,IAAM+vB,GAAG,GAAG5lB,UAAU,CAACnK,GAAG,CAAC;EACzBgwB,IAAAA,GAAG,GAAG7lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC5BiwB,IAAAA,KAAK,GAAG9lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC9BkwB,IAAAA,IAAI,GAAG/lB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC7BmwB,IAAAA,GAAG,GAAGhmB,UAAU,CAACnK,GAAG,EAAE,KAAK,CAAC;EAC5BowB,IAAAA,QAAQ,GAAGjmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACnCqwB,IAAAA,UAAU,GAAGlmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACrCswB,IAAAA,QAAQ,GAAGnmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACnCuwB,IAAAA,SAAS,GAAGpmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCwwB,IAAAA,SAAS,GAAGrmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCywB,IAAAA,SAAS,GAAGtmB,UAAU,CAACnK,GAAG,EAAE,OAAO,CAAC;EACpCyV,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI3K,CAAC,EAAA;QAAA,OAAM;UAAEP,KAAK,EAAEC,MAAM,CAACqlB,WAAW,CAAC/kB,CAAC,CAAC4K,GAAG,CAAC,CAAC;UAAEqZ,KAAK,EAAE,SAAAA,KAAAA,CAAA9C,KAAA,EAAA;YAAA,IAAE92B,CAAC,GAAA82B,KAAA,CAAA,CAAA,CAAA,CAAA;EAAA,UAAA,OAAM92B,CAAC,CAAA;EAAA,SAAA;EAAEsgB,QAAAA,OAAO,EAAE,IAAA;SAAM,CAAA;OAAC;EAC1Fib,IAAAA,OAAO,GAAG,SAAVA,OAAOA,CAAI5lB,CAAC,EAAK;QACf,IAAI0K,KAAK,CAACC,OAAO,EAAE;UACjB,OAAOA,OAAO,CAAC3K,CAAC,CAAC,CAAA;EACnB,OAAA;QACA,QAAQA,CAAC,CAAC4K,GAAG;EACX;EACA,QAAA,KAAK,GAAG;YACN,OAAO6Z,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;EACpC,QAAA,KAAK,IAAI;YACP,OAAOypB,KAAK,CAACvvB,GAAG,CAAC8F,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;EACnC;EACA,QAAA,KAAK,GAAG;YACN,OAAO+oB,OAAO,CAACyB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;EACP,UAAA,OAAOzB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;EAC3C,QAAA,KAAK,MAAM;YACT,OAAO4c,OAAO,CAACqB,IAAI,CAAC,CAAA;EACtB,QAAA,KAAK,OAAO;YACV,OAAOrB,OAAO,CAAC4B,SAAS,CAAC,CAAA;EAC3B,QAAA,KAAK,QAAQ;YACX,OAAO5B,OAAO,CAACsB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOtB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC5C,QAAA,KAAK,MAAM;EACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC3C,QAAA,KAAK,GAAG;YACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOT,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC7C,QAAA,KAAK,MAAM;EACT,UAAA,OAAOoqB,KAAK,CAACvvB,GAAG,CAACmF,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC5C;EACA,QAAA,KAAK,GAAG;YACN,OAAO0pB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;EAC5B,QAAA,KAAK,KAAK;YACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;EACvB;EACA,QAAA,KAAK,IAAI;YACP,OAAOpB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,GAAG;YACN,OAAOvB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;EAC5B,QAAA,KAAK,KAAK;YACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;EACvB,QAAA,KAAK,GAAG;YACN,OAAOL,MAAM,CAACW,SAAS,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOX,MAAM,CAACQ,QAAQ,CAAC,CAAA;EACzB,QAAA,KAAK,KAAK;YACR,OAAOvB,OAAO,CAACkB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG;YACN,OAAOR,KAAK,CAACvvB,GAAG,CAAC4F,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;EAClC;EACA,QAAA,KAAK,MAAM;YACT,OAAOipB,OAAO,CAACqB,IAAI,CAAC,CAAA;EACtB,QAAA,KAAK,IAAI;EACP,UAAA,OAAOrB,OAAO,CAAC2B,SAAS,EAAEve,cAAc,CAAC,CAAA;EAC3C;EACA,QAAA,KAAK,GAAG;YACN,OAAO4c,OAAO,CAACuB,QAAQ,CAAC,CAAA;EAC1B,QAAA,KAAK,IAAI;YACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;EACrB;EACA,QAAA,KAAK,GAAG,CAAA;EACR,QAAA,KAAK,GAAG;YACN,OAAOnB,OAAO,CAACkB,GAAG,CAAC,CAAA;EACrB,QAAA,KAAK,KAAK;EACR,UAAA,OAAOR,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/C,QAAA,KAAK,MAAM;EACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC9C,QAAA,KAAK,KAAK;EACR,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC9C,QAAA,KAAK,MAAM;EACT,UAAA,OAAO6pB,KAAK,CAACvvB,GAAG,CAAC0F,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC7C;EACA,QAAA,KAAK,GAAG,CAAA;EACR,QAAA,KAAK,IAAI;EACP,UAAA,OAAO9N,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAASwV,QAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;EAC/E,QAAA,KAAK,KAAK;EACR,UAAA,OAAO5iB,MAAM,CAAC,IAAI4S,MAAM,CAAA,OAAA,GAAS4lB,QAAQ,CAAC5V,MAAM,GAAKwV,IAAAA,GAAAA,GAAG,CAACxV,MAAM,GAAA,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;EAC1E;EACA;EACA,QAAA,KAAK,GAAG;YACN,OAAOoV,MAAM,CAAC,oBAAoB,CAAC,CAAA;EACrC;EACA;EACA,QAAA,KAAK,GAAG;YACN,OAAOA,MAAM,CAAC,WAAW,CAAC,CAAA;EAC5B,QAAA;YACE,OAAOna,OAAO,CAAC3K,CAAC,CAAC,CAAA;EACrB,OAAA;OACD,CAAA;EAEH,EAAA,IAAMjW,IAAI,GAAG67B,OAAO,CAAClb,KAAK,CAAC,IAAI;EAC7BmP,IAAAA,aAAa,EAAEiK,WAAAA;KAChB,CAAA;IAED/5B,IAAI,CAAC2gB,KAAK,GAAGA,KAAK,CAAA;EAElB,EAAA,OAAO3gB,IAAI,CAAA;EACb,CAAA;EAEA,IAAM87B,uBAAuB,GAAG;EAC9Br7B,EAAAA,IAAI,EAAE;EACJ,IAAA,SAAS,EAAE,IAAI;EACfsN,IAAAA,OAAO,EAAE,OAAA;KACV;EACDrN,EAAAA,KAAK,EAAE;EACLqN,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAI;EACfguB,IAAAA,KAAK,EAAE,KAAK;EACZC,IAAAA,IAAI,EAAE,MAAA;KACP;EACDr7B,EAAAA,GAAG,EAAE;EACHoN,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDjN,EAAAA,OAAO,EAAE;EACPi7B,IAAAA,KAAK,EAAE,KAAK;EACZC,IAAAA,IAAI,EAAE,MAAA;KACP;EACDC,EAAAA,SAAS,EAAE,GAAG;EACdC,EAAAA,SAAS,EAAE,GAAG;EACdz3B,EAAAA,MAAM,EAAE;EACNsJ,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDouB,EAAAA,MAAM,EAAE;EACNpuB,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACD5M,EAAAA,MAAM,EAAE;EACN4M,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACD1M,EAAAA,MAAM,EAAE;EACN0M,IAAAA,OAAO,EAAE,GAAG;EACZ,IAAA,SAAS,EAAE,IAAA;KACZ;EACDxM,EAAAA,YAAY,EAAE;EACZy6B,IAAAA,IAAI,EAAE,OAAO;EACbD,IAAAA,KAAK,EAAE,KAAA;EACT,GAAA;EACF,CAAC,CAAA;EAED,SAASK,YAAYA,CAAC9uB,IAAI,EAAEqV,UAAU,EAAE0Z,YAAY,EAAE;EACpD,EAAA,IAAQv4B,IAAI,GAAYwJ,IAAI,CAApBxJ,IAAI;MAAEkC,KAAK,GAAKsH,IAAI,CAAdtH,KAAK,CAAA;IAEnB,IAAIlC,IAAI,KAAK,SAAS,EAAE;EACtB,IAAA,IAAMw4B,OAAO,GAAG,OAAO,CAAC5Z,IAAI,CAAC1c,KAAK,CAAC,CAAA;MACnC,OAAO;QACL4a,OAAO,EAAE,CAAC0b,OAAO;EACjBzb,MAAAA,GAAG,EAAEyb,OAAO,GAAG,GAAG,GAAGt2B,KAAAA;OACtB,CAAA;EACH,GAAA;EAEA,EAAA,IAAMyH,KAAK,GAAGkV,UAAU,CAAC7e,IAAI,CAAC,CAAA;;EAE9B;EACA;EACA;IACA,IAAIy4B,UAAU,GAAGz4B,IAAI,CAAA;IACrB,IAAIA,IAAI,KAAK,MAAM,EAAE;EACnB,IAAA,IAAI6e,UAAU,CAACle,MAAM,IAAI,IAAI,EAAE;EAC7B83B,MAAAA,UAAU,GAAG5Z,UAAU,CAACle,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;EACtD,KAAC,MAAM,IAAIke,UAAU,CAACjhB,SAAS,IAAI,IAAI,EAAE;QACvC,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,IAAIihB,UAAU,CAACjhB,SAAS,KAAK,KAAK,EAAE;EACpE66B,QAAAA,UAAU,GAAG,QAAQ,CAAA;EACvB,OAAC,MAAM;EACLA,QAAAA,UAAU,GAAG,QAAQ,CAAA;EACvB,OAAA;EACF,KAAC,MAAM;EACL;EACA;EACAA,MAAAA,UAAU,GAAGF,YAAY,CAAC53B,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;EACxD,KAAA;EACF,GAAA;EACA,EAAA,IAAIoc,GAAG,GAAGib,uBAAuB,CAACS,UAAU,CAAC,CAAA;EAC7C,EAAA,IAAI,OAAO1b,GAAG,KAAK,QAAQ,EAAE;EAC3BA,IAAAA,GAAG,GAAGA,GAAG,CAACpT,KAAK,CAAC,CAAA;EAClB,GAAA;EAEA,EAAA,IAAIoT,GAAG,EAAE;MACP,OAAO;EACLD,MAAAA,OAAO,EAAE,KAAK;EACdC,MAAAA,GAAG,EAAHA,GAAAA;OACD,CAAA;EACH,GAAA;EAEA,EAAA,OAAOrc,SAAS,CAAA;EAClB,CAAA;EAEA,SAASg4B,UAAUA,CAACjd,KAAK,EAAE;EACzB,EAAA,IAAMkd,EAAE,GAAGld,KAAK,CAACrS,GAAG,CAAC,UAACkR,CAAC,EAAA;MAAA,OAAKA,CAAC,CAAC1I,KAAK,CAAA;EAAA,GAAA,CAAC,CAACkF,MAAM,CAAC,UAACjQ,CAAC,EAAE8H,CAAC,EAAA;EAAA,IAAA,OAAQ9H,CAAC,GAAA,GAAA,GAAI8H,CAAC,CAACkT,MAAM,GAAA,GAAA,CAAA;KAAG,EAAE,EAAE,CAAC,CAAA;EAC9E,EAAA,OAAO,CAAK8W,GAAAA,GAAAA,EAAE,GAAKld,GAAAA,EAAAA,KAAK,CAAC,CAAA;EAC3B,CAAA;EAEA,SAAS7M,KAAKA,CAACI,KAAK,EAAE4C,KAAK,EAAEgnB,QAAQ,EAAE;EACrC,EAAA,IAAMC,OAAO,GAAG7pB,KAAK,CAACJ,KAAK,CAACgD,KAAK,CAAC,CAAA;EAElC,EAAA,IAAIinB,OAAO,EAAE;MACX,IAAMC,GAAG,GAAG,EAAE,CAAA;MACd,IAAIC,UAAU,GAAG,CAAC,CAAA;EAClB,IAAA,KAAK,IAAMh3B,CAAC,IAAI62B,QAAQ,EAAE;EACxB,MAAA,IAAIvhB,cAAc,CAACuhB,QAAQ,EAAE72B,CAAC,CAAC,EAAE;EAC/B,QAAA,IAAMi1B,CAAC,GAAG4B,QAAQ,CAAC72B,CAAC,CAAC;YACnBg1B,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;UACtC,IAAI,CAACC,CAAC,CAACla,OAAO,IAAIka,CAAC,CAACna,KAAK,EAAE;YACzBic,GAAG,CAAC9B,CAAC,CAACna,KAAK,CAACE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAGia,CAAC,CAACZ,KAAK,CAACyC,OAAO,CAAC3Y,KAAK,CAAC6Y,UAAU,EAAEA,UAAU,GAAGhC,MAAM,CAAC,CAAC,CAAA;EAC/E,SAAA;EACAgC,QAAAA,UAAU,IAAIhC,MAAM,CAAA;EACtB,OAAA;EACF,KAAA;EACA,IAAA,OAAO,CAAC8B,OAAO,EAAEC,GAAG,CAAC,CAAA;EACvB,GAAC,MAAM;EACL,IAAA,OAAO,CAACD,OAAO,EAAE,EAAE,CAAC,CAAA;EACtB,GAAA;EACF,CAAA;EAEA,SAASG,mBAAmBA,CAACH,OAAO,EAAE;EACpC,EAAA,IAAMI,OAAO,GAAG,SAAVA,OAAOA,CAAIpc,KAAK,EAAK;EACzB,IAAA,QAAQA,KAAK;EACX,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,aAAa,CAAA;EACtB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,QAAQ,CAAA;EACjB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,QAAQ,CAAA;EACjB,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,MAAM,CAAA;EACf,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,KAAK,CAAA;EACd,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,OAAO,CAAA;EAChB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,MAAM,CAAA;EACf,MAAA,KAAK,GAAG,CAAA;EACR,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,YAAY,CAAA;EACrB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,UAAU,CAAA;EACnB,MAAA,KAAK,GAAG;EACN,QAAA,OAAO,SAAS,CAAA;EAClB,MAAA;EACE,QAAA,OAAO,IAAI,CAAA;EACf,KAAA;KACD,CAAA;IAED,IAAIpa,IAAI,GAAG,IAAI,CAAA;EACf,EAAA,IAAIy2B,cAAc,CAAA;EAClB,EAAA,IAAI,CAAC92B,WAAW,CAACy2B,OAAO,CAAChwB,CAAC,CAAC,EAAE;MAC3BpG,IAAI,GAAGF,QAAQ,CAACC,MAAM,CAACq2B,OAAO,CAAChwB,CAAC,CAAC,CAAA;EACnC,GAAA;EAEA,EAAA,IAAI,CAACzG,WAAW,CAACy2B,OAAO,CAACM,CAAC,CAAC,EAAE;MAC3B,IAAI,CAAC12B,IAAI,EAAE;EACTA,MAAAA,IAAI,GAAG,IAAI8L,eAAe,CAACsqB,OAAO,CAACM,CAAC,CAAC,CAAA;EACvC,KAAA;MACAD,cAAc,GAAGL,OAAO,CAACM,CAAC,CAAA;EAC5B,GAAA;EAEA,EAAA,IAAI,CAAC/2B,WAAW,CAACy2B,OAAO,CAACO,CAAC,CAAC,EAAE;EAC3BP,IAAAA,OAAO,CAACQ,CAAC,GAAG,CAACR,OAAO,CAACO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;EACrC,GAAA;EAEA,EAAA,IAAI,CAACh3B,WAAW,CAACy2B,OAAO,CAAC7B,CAAC,CAAC,EAAE;MAC3B,IAAI6B,OAAO,CAAC7B,CAAC,GAAG,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;QACrC0hB,OAAO,CAAC7B,CAAC,IAAI,EAAE,CAAA;EACjB,KAAC,MAAM,IAAI6B,OAAO,CAAC7B,CAAC,KAAK,EAAE,IAAI6B,OAAO,CAAC1hB,CAAC,KAAK,CAAC,EAAE;QAC9C0hB,OAAO,CAAC7B,CAAC,GAAG,CAAC,CAAA;EACf,KAAA;EACF,GAAA;IAEA,IAAI6B,OAAO,CAACS,CAAC,KAAK,CAAC,IAAIT,OAAO,CAACU,CAAC,EAAE;EAChCV,IAAAA,OAAO,CAACU,CAAC,GAAG,CAACV,OAAO,CAACU,CAAC,CAAA;EACxB,GAAA;EAEA,EAAA,IAAI,CAACn3B,WAAW,CAACy2B,OAAO,CAACve,CAAC,CAAC,EAAE;MAC3Bue,OAAO,CAACW,CAAC,GAAGnhB,WAAW,CAACwgB,OAAO,CAACve,CAAC,CAAC,CAAA;EACpC,GAAA;EAEA,EAAA,IAAM2O,IAAI,GAAG9gB,MAAM,CAACC,IAAI,CAACywB,OAAO,CAAC,CAAC/hB,MAAM,CAAC,UAACnI,CAAC,EAAEyI,CAAC,EAAK;EACjD,IAAA,IAAMvQ,CAAC,GAAGoyB,OAAO,CAAC7hB,CAAC,CAAC,CAAA;EACpB,IAAA,IAAIvQ,CAAC,EAAE;EACL8H,MAAAA,CAAC,CAAC9H,CAAC,CAAC,GAAGgyB,OAAO,CAACzhB,CAAC,CAAC,CAAA;EACnB,KAAA;EAEA,IAAA,OAAOzI,CAAC,CAAA;KACT,EAAE,EAAE,CAAC,CAAA;EAEN,EAAA,OAAO,CAACsa,IAAI,EAAExmB,IAAI,EAAEy2B,cAAc,CAAC,CAAA;EACrC,CAAA;EAEA,IAAIO,kBAAkB,GAAG,IAAI,CAAA;EAE7B,SAASC,gBAAgBA,GAAG;IAC1B,IAAI,CAACD,kBAAkB,EAAE;EACvBA,IAAAA,kBAAkB,GAAGzyB,QAAQ,CAACojB,UAAU,CAAC,aAAa,CAAC,CAAA;EACzD,GAAA;EAEA,EAAA,OAAOqP,kBAAkB,CAAA;EAC3B,CAAA;EAEA,SAASE,qBAAqBA,CAAC9c,KAAK,EAAEjd,MAAM,EAAE;IAC5C,IAAIid,KAAK,CAACC,OAAO,EAAE;EACjB,IAAA,OAAOD,KAAK,CAAA;EACd,GAAA;IAEA,IAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAACE,GAAG,CAAC,CAAA;EAC9D,EAAA,IAAMgE,MAAM,GAAG6Y,kBAAkB,CAAC/a,UAAU,EAAEjf,MAAM,CAAC,CAAA;IAErD,IAAImhB,MAAM,IAAI,IAAI,IAAIA,MAAM,CAACpa,QAAQ,CAACjG,SAAS,CAAC,EAAE;EAChD,IAAA,OAAOmc,KAAK,CAAA;EACd,GAAA;EAEA,EAAA,OAAOkE,MAAM,CAAA;EACf,CAAA;EAEO,SAAS8Y,iBAAiBA,CAAC9Y,MAAM,EAAEnhB,MAAM,EAAE;EAAA,EAAA,IAAAoxB,gBAAA,CAAA;EAChD,EAAA,OAAO,CAAAA,gBAAA,GAAAxa,KAAK,CAAC7X,SAAS,EAACic,MAAM,CAAA3f,KAAA,CAAA+1B,gBAAA,EAAIjQ,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,IAAA,OAAKwnB,qBAAqB,CAACxnB,CAAC,EAAEvS,MAAM,CAAC,CAAA;EAAA,GAAA,CAAC,CAAC,CAAA;EACvF,CAAA;;EAEA;EACA;EACA;;EAEA,IAAak6B,WAAW,gBAAA,YAAA;EACtB,EAAA,SAAAA,WAAYl6B,CAAAA,MAAM,EAAEZ,MAAM,EAAE;MAC1B,IAAI,CAACY,MAAM,GAAGA,MAAM,CAAA;MACpB,IAAI,CAACZ,MAAM,GAAGA,MAAM,CAAA;EACpB,IAAA,IAAI,CAAC+hB,MAAM,GAAG8Y,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACrf,MAAM,CAAC,EAAEY,MAAM,CAAC,CAAA;MACtE,IAAI,CAAC6b,KAAK,GAAG,IAAI,CAACsF,MAAM,CAAC3X,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,MAAA,OAAKglB,YAAY,CAAChlB,CAAC,EAAEvS,MAAM,CAAC,CAAA;OAAC,CAAA,CAAA;MAC5D,IAAI,CAACm6B,iBAAiB,GAAG,IAAI,CAACte,KAAK,CAAChO,IAAI,CAAC,UAAC0E,CAAC,EAAA;QAAA,OAAKA,CAAC,CAAC6Z,aAAa,CAAA;OAAC,CAAA,CAAA;EAEhE,IAAA,IAAI,CAAC,IAAI,CAAC+N,iBAAiB,EAAE;EAC3B,MAAA,IAAAC,WAAA,GAAgCtB,UAAU,CAAC,IAAI,CAACjd,KAAK,CAAC;EAA/Cwe,QAAAA,WAAW,GAAAD,WAAA,CAAA,CAAA,CAAA;EAAEpB,QAAAA,QAAQ,GAAAoB,WAAA,CAAA,CAAA,CAAA,CAAA;QAC5B,IAAI,CAACpoB,KAAK,GAAGC,MAAM,CAACooB,WAAW,EAAE,GAAG,CAAC,CAAA;QACrC,IAAI,CAACrB,QAAQ,GAAGA,QAAQ,CAAA;EAC1B,KAAA;EACF,GAAA;EAAC,EAAA,IAAAl6B,MAAA,GAAAo7B,WAAA,CAAAn7B,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAEDw7B,iBAAiB,GAAjB,SAAAA,iBAAAA,CAAkBlrB,KAAK,EAAE;EACvB,IAAA,IAAI,CAAC,IAAI,CAAC+Q,OAAO,EAAE;QACjB,OAAO;EAAE/Q,QAAAA,KAAK,EAALA,KAAK;UAAE+R,MAAM,EAAE,IAAI,CAACA,MAAM;UAAEiL,aAAa,EAAE,IAAI,CAACA,aAAAA;SAAe,CAAA;EAC1E,KAAC,MAAM;EACL,MAAA,IAAAmO,MAAA,GAA8BvrB,KAAK,CAACI,KAAK,EAAE,IAAI,CAAC4C,KAAK,EAAE,IAAI,CAACgnB,QAAQ,CAAC;EAA9DwB,QAAAA,UAAU,GAAAD,MAAA,CAAA,CAAA,CAAA;EAAEtB,QAAAA,OAAO,GAAAsB,MAAA,CAAA,CAAA,CAAA;EAAAvG,QAAAA,KAAA,GACSiF,OAAO,GACpCG,mBAAmB,CAACH,OAAO,CAAC,GAC5B,CAAC,IAAI,EAAE,IAAI,EAAEn4B,SAAS,CAAC;EAF1B2lB,QAAAA,MAAM,GAAAuN,KAAA,CAAA,CAAA,CAAA;EAAEnxB,QAAAA,IAAI,GAAAmxB,KAAA,CAAA,CAAA,CAAA;EAAEsF,QAAAA,cAAc,GAAAtF,KAAA,CAAA,CAAA,CAAA,CAAA;EAG/B,MAAA,IAAIvc,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,IAAIxhB,cAAc,CAACwhB,OAAO,EAAE,GAAG,CAAC,EAAE;EAChE,QAAA,MAAM,IAAI/8B,6BAA6B,CACrC,uDACF,CAAC,CAAA;EACH,OAAA;QACA,OAAO;EACLkT,QAAAA,KAAK,EAALA,KAAK;UACL+R,MAAM,EAAE,IAAI,CAACA,MAAM;UACnBnP,KAAK,EAAE,IAAI,CAACA,KAAK;EACjBwoB,QAAAA,UAAU,EAAVA,UAAU;EACVvB,QAAAA,OAAO,EAAPA,OAAO;EACPxS,QAAAA,MAAM,EAANA,MAAM;EACN5jB,QAAAA,IAAI,EAAJA,IAAI;EACJy2B,QAAAA,cAAc,EAAdA,cAAAA;SACD,CAAA;EACH,KAAA;KACD,CAAA;EAAA95B,EAAAA,YAAA,CAAA06B,WAAA,EAAA,CAAA;MAAAz6B,GAAA,EAAA,SAAA;MAAAC,GAAA,EAED,SAAAA,GAAAA,GAAc;QACZ,OAAO,CAAC,IAAI,CAACy6B,iBAAiB,CAAA;EAChC,KAAA;EAAC,GAAA,EAAA;MAAA16B,GAAA,EAAA,eAAA;MAAAC,GAAA,EAED,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACy6B,iBAAiB,GAAG,IAAI,CAACA,iBAAiB,CAAC/N,aAAa,GAAG,IAAI,CAAA;EAC7E,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAA8N,WAAA,CAAA;EAAA,CAAA,EAAA,CAAA;EAGI,SAASI,iBAAiBA,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;IACvD,IAAMq7B,MAAM,GAAG,IAAIP,WAAW,CAACl6B,MAAM,EAAEZ,MAAM,CAAC,CAAA;EAC9C,EAAA,OAAOq7B,MAAM,CAACH,iBAAiB,CAAClrB,KAAK,CAAC,CAAA;EACxC,CAAA;EAEO,SAASsrB,eAAeA,CAAC16B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,EAAE;IACrD,IAAAu7B,kBAAA,GAAwDL,iBAAiB,CAACt6B,MAAM,EAAEoP,KAAK,EAAEhQ,MAAM,CAAC;MAAxFqnB,MAAM,GAAAkU,kBAAA,CAANlU,MAAM;MAAE5jB,IAAI,GAAA83B,kBAAA,CAAJ93B,IAAI;MAAEy2B,cAAc,GAAAqB,kBAAA,CAAdrB,cAAc;MAAElN,aAAa,GAAAuO,kBAAA,CAAbvO,aAAa,CAAA;IACnD,OAAO,CAAC3F,MAAM,EAAE5jB,IAAI,EAAEy2B,cAAc,EAAElN,aAAa,CAAC,CAAA;EACtD,CAAA;EAEO,SAAS4N,kBAAkBA,CAAC/a,UAAU,EAAEjf,MAAM,EAAE;IACrD,IAAI,CAACif,UAAU,EAAE;EACf,IAAA,OAAO,IAAI,CAAA;EACb,GAAA;IAEA,IAAM2b,SAAS,GAAGpc,SAAS,CAAC5b,MAAM,CAAC5C,MAAM,EAAEif,UAAU,CAAC,CAAA;IACtD,IAAMvR,EAAE,GAAGktB,SAAS,CAAC1tB,WAAW,CAAC4sB,gBAAgB,EAAE,CAAC,CAAA;EACpD,EAAA,IAAMnwB,KAAK,GAAG+D,EAAE,CAACzL,aAAa,EAAE,CAAA;EAChC,EAAA,IAAM02B,YAAY,GAAGjrB,EAAE,CAACnN,eAAe,EAAE,CAAA;EACzC,EAAA,OAAOoJ,KAAK,CAACH,GAAG,CAAC,UAACoW,CAAC,EAAA;EAAA,IAAA,OAAK8Y,YAAY,CAAC9Y,CAAC,EAAEX,UAAU,EAAE0Z,YAAY,CAAC,CAAA;KAAC,CAAA,CAAA;EACpE;;ECncA,IAAMpQ,OAAO,GAAG,kBAAkB,CAAA;EAClC,IAAMsS,QAAQ,GAAG,OAAO,CAAA;EAExB,SAASC,eAAeA,CAACj4B,IAAI,EAAE;IAC7B,OAAO,IAAI2P,OAAO,CAAC,kBAAkB,kBAAe3P,IAAI,CAAClD,IAAI,GAAA,qBAAoB,CAAC,CAAA;EACpF,CAAA;;EAEA;EACA;EACA;EACA;EACA,SAASo7B,sBAAsBA,CAAC5zB,EAAE,EAAE;EAClC,EAAA,IAAIA,EAAE,CAACmN,QAAQ,KAAK,IAAI,EAAE;MACxBnN,EAAE,CAACmN,QAAQ,GAAGR,eAAe,CAAC3M,EAAE,CAAC2X,CAAC,CAAC,CAAA;EACrC,GAAA;IACA,OAAO3X,EAAE,CAACmN,QAAQ,CAAA;EACpB,CAAA;;EAEA;EACA;EACA;EACA,SAAS0mB,2BAA2BA,CAAC7zB,EAAE,EAAE;EACvC,EAAA,IAAIA,EAAE,CAAC8zB,aAAa,KAAK,IAAI,EAAE;MAC7B9zB,EAAE,CAAC8zB,aAAa,GAAGnnB,eAAe,CAChC3M,EAAE,CAAC2X,CAAC,EACJ3X,EAAE,CAACM,GAAG,CAAC8G,qBAAqB,EAAE,EAC9BpH,EAAE,CAACM,GAAG,CAAC6G,cAAc,EACvB,CAAC,CAAA;EACH,GAAA;IACA,OAAOnH,EAAE,CAAC8zB,aAAa,CAAA;EACzB,CAAA;;EAEA;EACA;EACA,SAAS1uB,KAAKA,CAAC2uB,IAAI,EAAE1uB,IAAI,EAAE;EACzB,EAAA,IAAMmS,OAAO,GAAG;MACd1f,EAAE,EAAEi8B,IAAI,CAACj8B,EAAE;MACX4D,IAAI,EAAEq4B,IAAI,CAACr4B,IAAI;MACfic,CAAC,EAAEoc,IAAI,CAACpc,CAAC;MACTtI,CAAC,EAAE0kB,IAAI,CAAC1kB,CAAC;MACT/O,GAAG,EAAEyzB,IAAI,CAACzzB,GAAG;MACb6iB,OAAO,EAAE4Q,IAAI,CAAC5Q,OAAAA;KACf,CAAA;EACD,EAAA,OAAO,IAAIljB,QAAQ,CAAArB,QAAA,CAAM4Y,EAAAA,EAAAA,OAAO,EAAKnS,IAAI,EAAA;EAAE2uB,IAAAA,GAAG,EAAExc,OAAAA;EAAO,GAAA,CAAE,CAAC,CAAA;EAC5D,CAAA;;EAEA;EACA;EACA,SAASyc,SAASA,CAACC,OAAO,EAAE7kB,CAAC,EAAE8kB,EAAE,EAAE;EACjC;IACA,IAAIC,QAAQ,GAAGF,OAAO,GAAG7kB,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;;EAEtC;EACA,EAAA,IAAMglB,EAAE,GAAGF,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;;EAE9B;IACA,IAAI/kB,CAAC,KAAKglB,EAAE,EAAE;EACZ,IAAA,OAAO,CAACD,QAAQ,EAAE/kB,CAAC,CAAC,CAAA;EACtB,GAAA;;EAEA;IACA+kB,QAAQ,IAAI,CAACC,EAAE,GAAGhlB,CAAC,IAAI,EAAE,GAAG,IAAI,CAAA;;EAEhC;EACA,EAAA,IAAMilB,EAAE,GAAGH,EAAE,CAACj8B,MAAM,CAACk8B,QAAQ,CAAC,CAAA;IAC9B,IAAIC,EAAE,KAAKC,EAAE,EAAE;EACb,IAAA,OAAO,CAACF,QAAQ,EAAEC,EAAE,CAAC,CAAA;EACvB,GAAA;;EAEA;IACA,OAAO,CAACH,OAAO,GAAG53B,IAAI,CAAC+N,GAAG,CAACgqB,EAAE,EAAEC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAEh4B,IAAI,CAACgO,GAAG,CAAC+pB,EAAE,EAAEC,EAAE,CAAC,CAAC,CAAA;EACnE,CAAA;;EAEA;EACA,SAASC,OAAOA,CAACz8B,EAAE,EAAEI,MAAM,EAAE;EAC3BJ,EAAAA,EAAE,IAAII,MAAM,GAAG,EAAE,GAAG,IAAI,CAAA;EAExB,EAAA,IAAMyT,CAAC,GAAG,IAAI5S,IAAI,CAACjB,EAAE,CAAC,CAAA;IAEtB,OAAO;EACLlC,IAAAA,IAAI,EAAE+V,CAAC,CAACG,cAAc,EAAE;EACxBjW,IAAAA,KAAK,EAAE8V,CAAC,CAAC6oB,WAAW,EAAE,GAAG,CAAC;EAC1B1+B,IAAAA,GAAG,EAAE6V,CAAC,CAAC8oB,UAAU,EAAE;EACnBp+B,IAAAA,IAAI,EAAEsV,CAAC,CAAC+oB,WAAW,EAAE;EACrBp+B,IAAAA,MAAM,EAAEqV,CAAC,CAACgpB,aAAa,EAAE;EACzBn+B,IAAAA,MAAM,EAAEmV,CAAC,CAACipB,aAAa,EAAE;EACzBj4B,IAAAA,WAAW,EAAEgP,CAAC,CAACkpB,kBAAkB,EAAC;KACnC,CAAA;EACH,CAAA;;EAEA;EACA,SAASC,OAAOA,CAAChnB,GAAG,EAAE5V,MAAM,EAAEwD,IAAI,EAAE;IAClC,OAAOu4B,SAAS,CAACv3B,YAAY,CAACoR,GAAG,CAAC,EAAE5V,MAAM,EAAEwD,IAAI,CAAC,CAAA;EACnD,CAAA;;EAEA;EACA,SAASq5B,UAAUA,CAAChB,IAAI,EAAEza,GAAG,EAAE;EAC7B,EAAA,IAAM0b,IAAI,GAAGjB,IAAI,CAAC1kB,CAAC;EACjBzZ,IAAAA,IAAI,GAAGm+B,IAAI,CAACpc,CAAC,CAAC/hB,IAAI,GAAG0G,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;MAC1C9e,KAAK,GAAGk+B,IAAI,CAACpc,CAAC,CAAC9hB,KAAK,GAAGyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC,GAAG,CAAC;EAC5E+C,IAAAA,CAAC,GAAA/Y,QAAA,CACIm1B,EAAAA,EAAAA,IAAI,CAACpc,CAAC,EAAA;EACT/hB,MAAAA,IAAI,EAAJA,IAAI;EACJC,MAAAA,KAAK,EAALA,KAAK;EACLC,MAAAA,GAAG,EACDwG,IAAI,CAAC+N,GAAG,CAAC0pB,IAAI,CAACpc,CAAC,CAAC7hB,GAAG,EAAEiZ,WAAW,CAACnZ,IAAI,EAAEC,KAAK,CAAC,CAAC,GAC9CyG,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC,GACpBxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC,GAAG,CAAA;OAC3B,CAAA;EACDogB,IAAAA,WAAW,GAAGjT,QAAQ,CAAC5d,UAAU,CAAC;EAChCuQ,MAAAA,KAAK,EAAE2E,GAAG,CAAC3E,KAAK,GAAGrY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC3E,KAAK,CAAC;EACxCC,MAAAA,QAAQ,EAAE0E,GAAG,CAAC1E,QAAQ,GAAGtY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC1E,QAAQ,CAAC;EACjDnP,MAAAA,MAAM,EAAE6T,GAAG,CAAC7T,MAAM,GAAGnJ,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAAC7T,MAAM,CAAC;EAC3CoP,MAAAA,KAAK,EAAEyE,GAAG,CAACzE,KAAK,GAAGvY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACzE,KAAK,CAAC;EACxCC,MAAAA,IAAI,EAAEwE,GAAG,CAACxE,IAAI,GAAGxY,IAAI,CAACwV,KAAK,CAACwH,GAAG,CAACxE,IAAI,CAAC;QACrCtB,KAAK,EAAE8F,GAAG,CAAC9F,KAAK;QAChBrR,OAAO,EAAEmX,GAAG,CAACnX,OAAO;QACpB4S,OAAO,EAAEuE,GAAG,CAACvE,OAAO;QACpBuI,YAAY,EAAEhE,GAAG,CAACgE,YAAAA;EACpB,KAAC,CAAC,CAACwI,EAAE,CAAC,cAAc,CAAC;EACrBoO,IAAAA,OAAO,GAAGx3B,YAAY,CAACib,CAAC,CAAC,CAAA;IAE3B,IAAAud,UAAA,GAAcjB,SAAS,CAACC,OAAO,EAAEc,IAAI,EAAEjB,IAAI,CAACr4B,IAAI,CAAC;EAA5C5D,IAAAA,EAAE,GAAAo9B,UAAA,CAAA,CAAA,CAAA;EAAE7lB,IAAAA,CAAC,GAAA6lB,UAAA,CAAA,CAAA,CAAA,CAAA;IAEV,IAAID,WAAW,KAAK,CAAC,EAAE;EACrBn9B,IAAAA,EAAE,IAAIm9B,WAAW,CAAA;EACjB;MACA5lB,CAAC,GAAG0kB,IAAI,CAACr4B,IAAI,CAACxD,MAAM,CAACJ,EAAE,CAAC,CAAA;EAC1B,GAAA;IAEA,OAAO;EAAEA,IAAAA,EAAE,EAAFA,EAAE;EAAEuX,IAAAA,CAAC,EAADA,CAAAA;KAAG,CAAA;EAClB,CAAA;;EAEA;EACA;EACA,SAAS8lB,mBAAmBA,CAAC/6B,MAAM,EAAEg7B,UAAU,EAAEr9B,IAAI,EAAEE,MAAM,EAAE0rB,IAAI,EAAEwO,cAAc,EAAE;EACnF,EAAA,IAAQlwB,OAAO,GAAWlK,IAAI,CAAtBkK,OAAO;MAAEvG,IAAI,GAAK3D,IAAI,CAAb2D,IAAI,CAAA;EACrB,EAAA,IAAKtB,MAAM,IAAIgH,MAAM,CAACC,IAAI,CAACjH,MAAM,CAAC,CAACa,MAAM,KAAK,CAAC,IAAKm6B,UAAU,EAAE;EAC9D,IAAA,IAAMC,kBAAkB,GAAGD,UAAU,IAAI15B,IAAI;QAC3Cq4B,IAAI,GAAG9zB,QAAQ,CAACmE,UAAU,CAAChK,MAAM,EAAAwE,QAAA,CAAA,EAAA,EAC5B7G,IAAI,EAAA;EACP2D,QAAAA,IAAI,EAAE25B,kBAAkB;EACxBlD,QAAAA,cAAc,EAAdA,cAAAA;EAAc,OAAA,CACf,CAAC,CAAA;MACJ,OAAOlwB,OAAO,GAAG8xB,IAAI,GAAGA,IAAI,CAAC9xB,OAAO,CAACvG,IAAI,CAAC,CAAA;EAC5C,GAAC,MAAM;EACL,IAAA,OAAOuE,QAAQ,CAACkjB,OAAO,CACrB,IAAI9X,OAAO,CAAC,YAAY,EAAgBsY,cAAAA,GAAAA,IAAI,GAAwB1rB,wBAAAA,GAAAA,MAAQ,CAC9E,CAAC,CAAA;EACH,GAAA;EACF,CAAA;;EAEA;EACA;EACA,SAASq9B,YAAYA,CAACt1B,EAAE,EAAE/H,MAAM,EAAE8gB,MAAM,EAAS;EAAA,EAAA,IAAfA,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,IAAAA,MAAM,GAAG,IAAI,CAAA;EAAA,GAAA;EAC7C,EAAA,OAAO/Y,EAAE,CAACgZ,OAAO,GACb3B,SAAS,CAAC5b,MAAM,CAACgD,MAAM,CAAChD,MAAM,CAAC,OAAO,CAAC,EAAE;EACvCsd,IAAAA,MAAM,EAANA,MAAM;EACNhY,IAAAA,WAAW,EAAE,IAAA;KACd,CAAC,CAAC4X,wBAAwB,CAAC3Y,EAAE,EAAE/H,MAAM,CAAC,GACvC,IAAI,CAAA;EACV,CAAA;EAEA,SAASuyB,UAASA,CAACnb,CAAC,EAAEkmB,QAAQ,EAAEC,SAAS,EAAE;EACzC,EAAA,IAAMC,UAAU,GAAGpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,IAAI,IAAIyZ,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,GAAG,CAAC,CAAA;IAClD,IAAI+hB,CAAC,GAAG,EAAE,CAAA;EACV,EAAA,IAAI8d,UAAU,IAAIpmB,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,IAAI,CAAC,EAAE+hB,CAAC,IAAI,GAAG,CAAA;EACzCA,EAAAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC/hB,IAAI,EAAE6/B,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;EAC3C,EAAA,IAAID,SAAS,KAAK,MAAM,EAAE,OAAO7d,CAAC,CAAA;EAClC,EAAA,IAAI4d,QAAQ,EAAE;EACZ5d,IAAAA,CAAC,IAAI,GAAG,CAAA;MACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;EACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;EACnCA,IAAAA,CAAC,IAAI,GAAG,CAAA;EACV,GAAC,MAAM;MACLA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC9hB,KAAK,CAAC,CAAA;EACxB,IAAA,IAAI2/B,SAAS,KAAK,OAAO,EAAE,OAAO7d,CAAC,CAAA;EACrC,GAAA;IACAA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAC7hB,GAAG,CAAC,CAAA;EACtB,EAAA,OAAO6hB,CAAC,CAAA;EACV,CAAA;EAEA,SAAS6M,UAASA,CAChBnV,CAAC,EACDkmB,QAAQ,EACR3Q,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SAAS,EACT;EACA,EAAA,IAAIG,WAAW,GAAG,CAAC/Q,eAAe,IAAIvV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,IAAI0S,CAAC,CAACsI,CAAC,CAACnhB,MAAM,KAAK,CAAC;EAC7EmhB,IAAAA,CAAC,GAAG,EAAE,CAAA;EACR,EAAA,QAAQ6d,SAAS;EACf,IAAA,KAAK,KAAK,CAAA;EACV,IAAA,KAAK,OAAO,CAAA;EACZ,IAAA,KAAK,MAAM;EACT,MAAA,MAAA;EACF,IAAA;QACE7d,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACthB,IAAI,CAAC,CAAA;QACvB,IAAIm/B,SAAS,KAAK,MAAM,EAAE,MAAA;EAC1B,MAAA,IAAID,QAAQ,EAAE;EACZ5d,QAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;UACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,QAAA,IAAIG,WAAW,EAAE;EACfhe,UAAAA,CAAC,IAAI,GAAG,CAAA;YACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;EAC3B,SAAA;EACF,OAAC,MAAM;UACLmhB,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACrhB,MAAM,CAAC,CAAA;UACzB,IAAIk/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,QAAA,IAAIG,WAAW,EAAE;YACfhe,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAACnhB,MAAM,CAAC,CAAA;EAC3B,SAAA;EACF,OAAA;QACA,IAAIg/B,SAAS,KAAK,QAAQ,EAAE,MAAA;EAC5B,MAAA,IAAIG,WAAW,KAAK,CAAChR,oBAAoB,IAAItV,CAAC,CAACsI,CAAC,CAAChb,WAAW,KAAK,CAAC,CAAC,EAAE;EACnEgb,QAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAIhW,QAAQ,CAAC0N,CAAC,CAACsI,CAAC,CAAChb,WAAW,EAAE,CAAC,CAAC,CAAA;EACnC,OAAA;EACJ,GAAA;EAEA,EAAA,IAAImoB,aAAa,EAAE;EACjB,IAAA,IAAIzV,CAAC,CAACyJ,aAAa,IAAIzJ,CAAC,CAACnX,MAAM,KAAK,CAAC,IAAI,CAACw9B,YAAY,EAAE;EACtD/d,MAAAA,CAAC,IAAI,GAAG,CAAA;EACV,KAAC,MAAM,IAAItI,CAAC,CAACA,CAAC,GAAG,CAAC,EAAE;EAClBsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACpCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAAC,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACtC,KAAC,MAAM;EACLsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACnCsI,MAAAA,CAAC,IAAI,GAAG,CAAA;EACRA,MAAAA,CAAC,IAAIhW,QAAQ,CAACrF,IAAI,CAACwV,KAAK,CAACzC,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;EACrC,KAAA;EACF,GAAA;EAEA,EAAA,IAAIqmB,YAAY,EAAE;MAChB/d,CAAC,IAAI,GAAG,GAAGtI,CAAC,CAAC3T,IAAI,CAACk6B,QAAQ,GAAG,GAAG,CAAA;EAClC,GAAA;EACA,EAAA,OAAOje,CAAC,CAAA;EACV,CAAA;;EAEA;EACA,IAAMke,iBAAiB,GAAG;EACtBhgC,IAAAA,KAAK,EAAE,CAAC;EACRC,IAAAA,GAAG,EAAE,CAAC;EACNO,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd;EACDm5B,EAAAA,qBAAqB,GAAG;EACtBhpB,IAAAA,UAAU,EAAE,CAAC;EACb7W,IAAAA,OAAO,EAAE,CAAC;EACVI,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd;EACDo5B,EAAAA,wBAAwB,GAAG;EACzB3pB,IAAAA,OAAO,EAAE,CAAC;EACV/V,IAAAA,IAAI,EAAE,CAAC;EACPC,IAAAA,MAAM,EAAE,CAAC;EACTE,IAAAA,MAAM,EAAE,CAAC;EACTmG,IAAAA,WAAW,EAAE,CAAA;KACd,CAAA;;EAEH;EACA,IAAM+kB,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC;EACtFsU,EAAAA,gBAAgB,GAAG,CACjB,UAAU,EACV,YAAY,EACZ,SAAS,EACT,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,CACd;EACDC,EAAAA,mBAAmB,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;;EAEtF;EACA,SAAS3S,aAAaA,CAACnuB,IAAI,EAAE;EAC3B,EAAA,IAAMme,UAAU,GAAG;EACjB1d,IAAAA,IAAI,EAAE,MAAM;EACZ+e,IAAAA,KAAK,EAAE,MAAM;EACb9e,IAAAA,KAAK,EAAE,OAAO;EACd4P,IAAAA,MAAM,EAAE,OAAO;EACf3P,IAAAA,GAAG,EAAE,KAAK;EACVgf,IAAAA,IAAI,EAAE,KAAK;EACXze,IAAAA,IAAI,EAAE,MAAM;EACZmd,IAAAA,KAAK,EAAE,MAAM;EACbld,IAAAA,MAAM,EAAE,QAAQ;EAChB6L,IAAAA,OAAO,EAAE,QAAQ;EACjBiX,IAAAA,OAAO,EAAE,SAAS;EAClBxE,IAAAA,QAAQ,EAAE,SAAS;EACnBpe,IAAAA,MAAM,EAAE,QAAQ;EAChBue,IAAAA,OAAO,EAAE,QAAQ;EACjBpY,IAAAA,WAAW,EAAE,aAAa;EAC1B2gB,IAAAA,YAAY,EAAE,aAAa;EAC3BrnB,IAAAA,OAAO,EAAE,SAAS;EAClB+P,IAAAA,QAAQ,EAAE,SAAS;EACnBkwB,IAAAA,UAAU,EAAE,YAAY;EACxBC,IAAAA,WAAW,EAAE,YAAY;EACzBC,IAAAA,WAAW,EAAE,YAAY;EACzBC,IAAAA,QAAQ,EAAE,UAAU;EACpBC,IAAAA,SAAS,EAAE,UAAU;EACrBlqB,IAAAA,OAAO,EAAE,SAAA;EACX,GAAC,CAACjX,IAAI,CAACyR,WAAW,EAAE,CAAC,CAAA;IAErB,IAAI,CAAC0M,UAAU,EAAE,MAAM,IAAIre,gBAAgB,CAACE,IAAI,CAAC,CAAA;EAEjD,EAAA,OAAOme,UAAU,CAAA;EACnB,CAAA;EAEA,SAASijB,2BAA2BA,CAACphC,IAAI,EAAE;EACzC,EAAA,QAAQA,IAAI,CAACyR,WAAW,EAAE;EACxB,IAAA,KAAK,cAAc,CAAA;EACnB,IAAA,KAAK,eAAe;EAClB,MAAA,OAAO,cAAc,CAAA;EACvB,IAAA,KAAK,iBAAiB,CAAA;EACtB,IAAA,KAAK,kBAAkB;EACrB,MAAA,OAAO,iBAAiB,CAAA;EAC1B,IAAA,KAAK,eAAe,CAAA;EACpB,IAAA,KAAK,gBAAgB;EACnB,MAAA,OAAO,eAAe,CAAA;EACxB,IAAA;QACE,OAAO0c,aAAa,CAACnuB,IAAI,CAAC,CAAA;EAC9B,GAAA;EACF,CAAA;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,SAASqhC,kBAAkBA,CAAC96B,IAAI,EAAE;IAChC,IAAI+6B,YAAY,KAAK98B,SAAS,EAAE;EAC9B88B,IAAAA,YAAY,GAAG/yB,QAAQ,CAACqH,GAAG,EAAE,CAAA;EAC/B,GAAA;;EAEA;EACA;EACA,EAAA,IAAIrP,IAAI,CAACzC,IAAI,KAAK,MAAM,EAAE;EACxB,IAAA,OAAOyC,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;EAClC,GAAA;EACA,EAAA,IAAMh9B,QAAQ,GAAGiC,IAAI,CAAClD,IAAI,CAAA;EAC1B,EAAA,IAAIk+B,WAAW,GAAGC,oBAAoB,CAACp+B,GAAG,CAACkB,QAAQ,CAAC,CAAA;IACpD,IAAIi9B,WAAW,KAAK/8B,SAAS,EAAE;EAC7B+8B,IAAAA,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAACu+B,YAAY,CAAC,CAAA;EACvCE,IAAAA,oBAAoB,CAAC78B,GAAG,CAACL,QAAQ,EAAEi9B,WAAW,CAAC,CAAA;EACjD,GAAA;EACA,EAAA,OAAOA,WAAW,CAAA;EACpB,CAAA;;EAEA;EACA;EACA;EACA,SAASE,OAAOA,CAAC9oB,GAAG,EAAE/V,IAAI,EAAE;IAC1B,IAAM2D,IAAI,GAAGsM,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAC3D,EAAA,IAAI,CAACxM,IAAI,CAACsd,OAAO,EAAE;MACjB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;EAChD,GAAA;EAEA,EAAA,IAAM4E,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;IAEnC,IAAID,EAAE,EAAEuX,CAAC,CAAA;;EAET;EACA,EAAA,IAAI,CAAChU,WAAW,CAACyS,GAAG,CAAClY,IAAI,CAAC,EAAE;EAC1B,IAAA,KAAA,IAAAgmB,EAAA,GAAA,CAAA,EAAAyJ,aAAA,GAAgB3D,YAAY,EAAA9F,EAAA,GAAAyJ,aAAA,CAAApqB,MAAA,EAAA2gB,EAAA,EAAE,EAAA;EAAzB,MAAA,IAAMrI,CAAC,GAAA8R,aAAA,CAAAzJ,EAAA,CAAA,CAAA;EACV,MAAA,IAAIvgB,WAAW,CAACyS,GAAG,CAACyF,CAAC,CAAC,CAAC,EAAE;EACvBzF,QAAAA,GAAG,CAACyF,CAAC,CAAC,GAAGsiB,iBAAiB,CAACtiB,CAAC,CAAC,CAAA;EAC/B,OAAA;EACF,KAAA;MAEA,IAAM4P,OAAO,GAAGvU,uBAAuB,CAACd,GAAG,CAAC,IAAIkB,kBAAkB,CAAClB,GAAG,CAAC,CAAA;EACvE,IAAA,IAAIqV,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAA;EAEA,IAAA,IAAM0T,YAAY,GAAGL,kBAAkB,CAAC96B,IAAI,CAAC,CAAA;MAAC,IAAAo7B,QAAA,GACpChC,OAAO,CAAChnB,GAAG,EAAE+oB,YAAY,EAAEn7B,IAAI,CAAC,CAAA;EAAzC5D,IAAAA,EAAE,GAAAg/B,QAAA,CAAA,CAAA,CAAA,CAAA;EAAEznB,IAAAA,CAAC,GAAAynB,QAAA,CAAA,CAAA,CAAA,CAAA;EACR,GAAC,MAAM;EACLh/B,IAAAA,EAAE,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,CAAA;EACrB,GAAA;IAEA,OAAO,IAAI9K,QAAQ,CAAC;EAAEnI,IAAAA,EAAE,EAAFA,EAAE;EAAE4D,IAAAA,IAAI,EAAJA,IAAI;EAAE4E,IAAAA,GAAG,EAAHA,GAAG;EAAE+O,IAAAA,CAAC,EAADA,CAAAA;EAAE,GAAC,CAAC,CAAA;EAC3C,CAAA;EAEA,SAAS0nB,YAAYA,CAAC1e,KAAK,EAAEE,GAAG,EAAExgB,IAAI,EAAE;EACtC,EAAA,IAAMga,KAAK,GAAG1W,WAAW,CAACtD,IAAI,CAACga,KAAK,CAAC,GAAG,IAAI,GAAGha,IAAI,CAACga,KAAK;EACvDL,IAAAA,QAAQ,GAAGrW,WAAW,CAACtD,IAAI,CAAC2Z,QAAQ,CAAC,GAAG,OAAO,GAAG3Z,IAAI,CAAC2Z,QAAQ;EAC/DzZ,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAI0f,CAAC,EAAExiB,IAAI,EAAK;QACpBwiB,CAAC,GAAGjW,OAAO,CAACiW,CAAC,EAAE5F,KAAK,IAAIha,IAAI,CAACi/B,SAAS,GAAG,CAAC,GAAG,CAAC,EAAEj/B,IAAI,CAACi/B,SAAS,GAAG,OAAO,GAAGtlB,QAAQ,CAAC,CAAA;EACpF,MAAA,IAAM+hB,SAAS,GAAGlb,GAAG,CAACjY,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,CAACgP,YAAY,CAAChP,IAAI,CAAC,CAAA;EACxD,MAAA,OAAO07B,SAAS,CAACx7B,MAAM,CAAC0f,CAAC,EAAExiB,IAAI,CAAC,CAAA;OACjC;EACDy5B,IAAAA,MAAM,GAAG,SAATA,MAAMA,CAAIz5B,IAAI,EAAK;QACjB,IAAI4C,IAAI,CAACi/B,SAAS,EAAE;UAClB,IAAI,CAACze,GAAG,CAAC+P,OAAO,CAACjQ,KAAK,EAAEljB,IAAI,CAAC,EAAE;YAC7B,OAAOojB,GAAG,CAAC4P,OAAO,CAAChzB,IAAI,CAAC,CAACkzB,IAAI,CAAChQ,KAAK,CAAC8P,OAAO,CAAChzB,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;WACnE,MAAM,OAAO,CAAC,CAAA;EACjB,OAAC,MAAM;EACL,QAAA,OAAOojB,GAAG,CAAC8P,IAAI,CAAChQ,KAAK,EAAEljB,IAAI,CAAC,CAACoD,GAAG,CAACpD,IAAI,CAAC,CAAA;EACxC,OAAA;OACD,CAAA;IAEH,IAAI4C,IAAI,CAAC5C,IAAI,EAAE;EACb,IAAA,OAAO8C,MAAM,CAAC22B,MAAM,CAAC72B,IAAI,CAAC5C,IAAI,CAAC,EAAE4C,IAAI,CAAC5C,IAAI,CAAC,CAAA;EAC7C,GAAA;EAEA,EAAA,KAAA,IAAAugB,SAAA,GAAAC,+BAAA,CAAmB5d,IAAI,CAAC2c,KAAK,CAAAkB,EAAAA,KAAA,IAAAA,KAAA,GAAAF,SAAA,EAAA,EAAAG,IAAA,GAAE;EAAA,IAAA,IAApB1gB,IAAI,GAAAygB,KAAA,CAAAza,KAAA,CAAA;EACb,IAAA,IAAM6H,KAAK,GAAG4rB,MAAM,CAACz5B,IAAI,CAAC,CAAA;MAC1B,IAAImH,IAAI,CAACC,GAAG,CAACyG,KAAK,CAAC,IAAI,CAAC,EAAE;EACxB,MAAA,OAAO/K,MAAM,CAAC+K,KAAK,EAAE7N,IAAI,CAAC,CAAA;EAC5B,KAAA;EACF,GAAA;IACA,OAAO8C,MAAM,CAACogB,KAAK,GAAGE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAExgB,IAAI,CAAC2c,KAAK,CAAC3c,IAAI,CAAC2c,KAAK,CAACzZ,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;EACxE,CAAA;EAEA,SAASg8B,QAAQA,CAACC,OAAO,EAAE;IACzB,IAAIn/B,IAAI,GAAG,EAAE;MACXo/B,IAAI,CAAA;EACN,EAAA,IAAID,OAAO,CAACj8B,MAAM,GAAG,CAAC,IAAI,OAAOi8B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE;MACzElD,IAAI,GAAGm/B,OAAO,CAACA,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;EAClCk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAC/d,KAAK,CAAC,CAAC,EAAE+d,OAAO,CAACj8B,MAAM,GAAG,CAAC,CAAC,CAAA;EACzD,GAAC,MAAM;EACLk8B,IAAAA,IAAI,GAAG1nB,KAAK,CAACkB,IAAI,CAACumB,OAAO,CAAC,CAAA;EAC5B,GAAA;EACA,EAAA,OAAO,CAACn/B,IAAI,EAAEo/B,IAAI,CAAC,CAAA;EACrB,CAAA;;EAEA;EACA;EACA;EACA,IAAIV,YAAY,CAAA;EAChB;EACA;EACA;EACA;EACA;EACA;EACA,IAAME,oBAAoB,GAAG,IAAIp9B,GAAG,EAAE,CAAA;;EAEtC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;AACqB0G,MAAAA,QAAQ,0BAAA+iB,WAAA,EAAA;EAC3B;EACF;EACA;IACE,SAAA/iB,QAAAA,CAAYgjB,MAAM,EAAE;MAClB,IAAMvnB,IAAI,GAAGunB,MAAM,CAACvnB,IAAI,IAAIgI,QAAQ,CAACwE,WAAW,CAAA;EAEhD,IAAA,IAAIib,OAAO,GACTF,MAAM,CAACE,OAAO,KACbtQ,MAAM,CAAC1W,KAAK,CAAC8mB,MAAM,CAACnrB,EAAE,CAAC,GAAG,IAAIuT,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,KAC9D,CAAC3P,IAAI,CAACsd,OAAO,GAAG2a,eAAe,CAACj4B,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;EAChD;EACJ;EACA;EACI,IAAA,IAAI,CAAC5D,EAAE,GAAGuD,WAAW,CAAC4nB,MAAM,CAACnrB,EAAE,CAAC,GAAG4L,QAAQ,CAACqH,GAAG,EAAE,GAAGkY,MAAM,CAACnrB,EAAE,CAAA;MAE7D,IAAI6f,CAAC,GAAG,IAAI;EACVtI,MAAAA,CAAC,GAAG,IAAI,CAAA;MACV,IAAI,CAAC8T,OAAO,EAAE;QACZ,IAAMiU,SAAS,GAAGnU,MAAM,CAAC+Q,GAAG,IAAI/Q,MAAM,CAAC+Q,GAAG,CAACl8B,EAAE,KAAK,IAAI,CAACA,EAAE,IAAImrB,MAAM,CAAC+Q,GAAG,CAACt4B,IAAI,CAACvD,MAAM,CAACuD,IAAI,CAAC,CAAA;EAEzF,MAAA,IAAI07B,SAAS,EAAE;EAAA,QAAA,IAAAx+B,IAAA,GACJ,CAACqqB,MAAM,CAAC+Q,GAAG,CAACrc,CAAC,EAAEsL,MAAM,CAAC+Q,GAAG,CAAC3kB,CAAC,CAAC,CAAA;EAApCsI,QAAAA,CAAC,GAAA/e,IAAA,CAAA,CAAA,CAAA,CAAA;EAAEyW,QAAAA,CAAC,GAAAzW,IAAA,CAAA,CAAA,CAAA,CAAA;EACP,OAAC,MAAM;EACL;EACA;UACA,IAAMy+B,EAAE,GAAGhvB,QAAQ,CAAC4a,MAAM,CAAC5T,CAAC,CAAC,IAAI,CAAC4T,MAAM,CAAC+Q,GAAG,GAAG/Q,MAAM,CAAC5T,CAAC,GAAG3T,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;UAC9E6f,CAAC,GAAG4c,OAAO,CAAC,IAAI,CAACz8B,EAAE,EAAEu/B,EAAE,CAAC,CAAA;EACxBlU,QAAAA,OAAO,GAAGtQ,MAAM,CAAC1W,KAAK,CAACwb,CAAC,CAAC/hB,IAAI,CAAC,GAAG,IAAIyV,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAA;EACpEsM,QAAAA,CAAC,GAAGwL,OAAO,GAAG,IAAI,GAAGxL,CAAC,CAAA;EACtBtI,QAAAA,CAAC,GAAG8T,OAAO,GAAG,IAAI,GAAGkU,EAAE,CAAA;EACzB,OAAA;EACF,KAAA;;EAEA;EACJ;EACA;MACI,IAAI,CAACC,KAAK,GAAG57B,IAAI,CAAA;EACjB;EACJ;EACA;MACI,IAAI,CAAC4E,GAAG,GAAG2iB,MAAM,CAAC3iB,GAAG,IAAI7B,MAAM,CAAChD,MAAM,EAAE,CAAA;EACxC;EACJ;EACA;MACI,IAAI,CAAC0nB,OAAO,GAAGA,OAAO,CAAA;EACtB;EACJ;EACA;MACI,IAAI,CAAChW,QAAQ,GAAG,IAAI,CAAA;EACpB;EACJ;EACA;MACI,IAAI,CAAC2mB,aAAa,GAAG,IAAI,CAAA;EACzB;EACJ;EACA;MACI,IAAI,CAACnc,CAAC,GAAGA,CAAC,CAAA;EACV;EACJ;EACA;MACI,IAAI,CAACtI,CAAC,GAAGA,CAAC,CAAA;EACV;EACJ;EACA;MACI,IAAI,CAACkoB,eAAe,GAAG,IAAI,CAAA;EAC7B,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANEt3B,EAAAA,QAAA,CAOO8K,GAAG,GAAV,SAAAA,MAAa;EACX,IAAA,OAAO,IAAI9K,QAAQ,CAAC,EAAE,CAAC,CAAA;EACzB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MApBE;EAAAA,EAAAA,QAAA,CAqBOud,KAAK,GAAZ,SAAAA,QAAe;EACb,IAAA,IAAAga,SAAA,GAAqBP,QAAQ,CAAC9iC,SAAS,CAAC;EAAjC4D,MAAAA,IAAI,GAAAy/B,SAAA,CAAA,CAAA,CAAA;EAAEL,MAAAA,IAAI,GAAAK,SAAA,CAAA,CAAA,CAAA;EACd5hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;EAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;EAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;EAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;EAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;EAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;EAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;EAC9D,IAAA,OAAOP,OAAO,CAAC;EAAEhhC,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,KAAK,EAALA,KAAK;EAAEC,MAAAA,GAAG,EAAHA,GAAG;EAAEO,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,MAAM,EAANA,MAAM;EAAEE,MAAAA,MAAM,EAANA,MAAM;EAAEmG,MAAAA,WAAW,EAAXA,WAAAA;OAAa,EAAE5E,IAAI,CAAC,CAAA;EAC/E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAxBE;EAAAkI,EAAAA,QAAA,CAyBOC,GAAG,GAAV,SAAAA,MAAa;EACX,IAAA,IAAAu3B,UAAA,GAAqBR,QAAQ,CAAC9iC,SAAS,CAAC;EAAjC4D,MAAAA,IAAI,GAAA0/B,UAAA,CAAA,CAAA,CAAA;EAAEN,MAAAA,IAAI,GAAAM,UAAA,CAAA,CAAA,CAAA;EACd7hC,MAAAA,IAAI,GAAmDuhC,IAAI,CAAA,CAAA,CAAA;EAArDthC,MAAAA,KAAK,GAA4CshC,IAAI,CAAA,CAAA,CAAA;EAA9CrhC,MAAAA,GAAG,GAAuCqhC,IAAI,CAAA,CAAA,CAAA;EAAzC9gC,MAAAA,IAAI,GAAiC8gC,IAAI,CAAA,CAAA,CAAA;EAAnC7gC,MAAAA,MAAM,GAAyB6gC,IAAI,CAAA,CAAA,CAAA;EAA3B3gC,MAAAA,MAAM,GAAiB2gC,IAAI,CAAA,CAAA,CAAA;EAAnBx6B,MAAAA,WAAW,GAAIw6B,IAAI,CAAA,CAAA,CAAA,CAAA;EAE9Dp/B,IAAAA,IAAI,CAAC2D,IAAI,GAAG8L,eAAe,CAACE,WAAW,CAAA;EACvC,IAAA,OAAOkvB,OAAO,CAAC;EAAEhhC,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,KAAK,EAALA,KAAK;EAAEC,MAAAA,GAAG,EAAHA,GAAG;EAAEO,MAAAA,IAAI,EAAJA,IAAI;EAAEC,MAAAA,MAAM,EAANA,MAAM;EAAEE,MAAAA,MAAM,EAANA,MAAM;EAAEmG,MAAAA,WAAW,EAAXA,WAAAA;OAAa,EAAE5E,IAAI,CAAC,CAAA;EAC/E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAAkI,QAAA,CAOOy3B,UAAU,GAAjB,SAAAA,WAAkBz9B,IAAI,EAAEmF,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAClC,IAAA,IAAMtH,EAAE,GAAGwX,MAAM,CAACrV,IAAI,CAAC,GAAGA,IAAI,CAACirB,OAAO,EAAE,GAAGhpB,GAAG,CAAA;EAC9C,IAAA,IAAI2W,MAAM,CAAC1W,KAAK,CAACrE,EAAE,CAAC,EAAE;EACpB,MAAA,OAAOmI,QAAQ,CAACkjB,OAAO,CAAC,eAAe,CAAC,CAAA;EAC1C,KAAA;MAEA,IAAMwU,SAAS,GAAG3vB,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EACnE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;QACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;EACrD,KAAA;MAEA,OAAO,IAAI13B,QAAQ,CAAC;EAClBnI,MAAAA,EAAE,EAAEA,EAAE;EACN4D,MAAAA,IAAI,EAAEi8B,SAAS;EACfr3B,MAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,KAAC,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAa,QAAA,CAWOojB,UAAU,GAAjB,SAAAA,WAAkB/F,YAAY,EAAEle,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAC1C,IAAA,IAAI,CAACiJ,QAAQ,CAACiV,YAAY,CAAC,EAAE;EAC3B,MAAA,MAAM,IAAIloB,oBAAoB,CAAA,wDAAA,GAC6B,OAAOkoB,YAAY,GAAA,cAAA,GAAeA,YAC7F,CAAC,CAAA;OACF,MAAM,IAAIA,YAAY,GAAG,CAACoW,QAAQ,IAAIpW,YAAY,GAAGoW,QAAQ,EAAE;EAC9D;EACA,MAAA,OAAOzzB,QAAQ,CAACkjB,OAAO,CAAC,wBAAwB,CAAC,CAAA;EACnD,KAAC,MAAM;QACL,OAAO,IAAIljB,QAAQ,CAAC;EAClBnI,QAAAA,EAAE,EAAEwlB,YAAY;UAChB5hB,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;EACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,OAAC,CAAC,CAAA;EACJ,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAa,QAAA,CAWO23B,WAAW,GAAlB,SAAAA,YAAmB7iB,OAAO,EAAE3V,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,IAAI,CAACiJ,QAAQ,CAAC0M,OAAO,CAAC,EAAE;EACtB,MAAA,MAAM,IAAI3f,oBAAoB,CAAC,wCAAwC,CAAC,CAAA;EAC1E,KAAC,MAAM;QACL,OAAO,IAAI6K,QAAQ,CAAC;UAClBnI,EAAE,EAAEid,OAAO,GAAG,IAAI;UAClBrZ,IAAI,EAAEsM,aAAa,CAAC5I,OAAO,CAAC1D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC;EACvD5H,QAAAA,GAAG,EAAE7B,MAAM,CAAC2F,UAAU,CAAChF,OAAO,CAAA;EAChC,OAAC,CAAC,CAAA;EACJ,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhCE;IAAAa,QAAA,CAiCOmE,UAAU,GAAjB,SAAAA,WAAkB0J,GAAG,EAAE/V,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC9B+V,IAAAA,GAAG,GAAGA,GAAG,IAAI,EAAE,CAAA;MACf,IAAM6pB,SAAS,GAAG3vB,aAAa,CAACjQ,IAAI,CAAC2D,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAChE,IAAA,IAAI,CAACyvB,SAAS,CAAC3e,OAAO,EAAE;QACtB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACgE,SAAS,CAAC,CAAC,CAAA;EACrD,KAAA;EAEA,IAAA,IAAMr3B,GAAG,GAAG7B,MAAM,CAAC2F,UAAU,CAACrM,IAAI,CAAC,CAAA;EACnC,IAAA,IAAMub,UAAU,GAAGF,eAAe,CAACtF,GAAG,EAAEyoB,2BAA2B,CAAC,CAAA;EACpE,IAAA,IAAAsB,oBAAA,GAA4ChqB,mBAAmB,CAACyF,UAAU,EAAEhT,GAAG,CAAC;QAAxEuM,kBAAkB,GAAAgrB,oBAAA,CAAlBhrB,kBAAkB;QAAEH,WAAW,GAAAmrB,oBAAA,CAAXnrB,WAAW,CAAA;EAEvC,IAAA,IAAMorB,KAAK,GAAGp0B,QAAQ,CAACqH,GAAG,EAAE;EAC1B8rB,MAAAA,YAAY,GAAG,CAACx7B,WAAW,CAACtD,IAAI,CAACo6B,cAAc,CAAC,GAC5Cp6B,IAAI,CAACo6B,cAAc,GACnBwF,SAAS,CAACz/B,MAAM,CAAC4/B,KAAK,CAAC;EAC3BC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;EAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;EAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;QACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;EACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;;EAEhE;EACA;EACA;EACA;EACA;;EAEA,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;EAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;EACH,KAAA;MAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;EACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;EACnF,KAAA;MAEA,IAAMqjC,WAAW,GAAGD,eAAe,IAAK7kB,UAAU,CAACrd,OAAO,IAAI,CAACiiC,cAAe,CAAA;;EAE9E;EACA,IAAA,IAAIxjB,KAAK;QACP2jB,aAAa;EACbC,MAAAA,MAAM,GAAG/D,OAAO,CAACuD,KAAK,EAAEjB,YAAY,CAAC,CAAA;EACvC,IAAA,IAAIuB,WAAW,EAAE;EACf1jB,MAAAA,KAAK,GAAGshB,gBAAgB,CAAA;EACxBqC,MAAAA,aAAa,GAAGvC,qBAAqB,CAAA;QACrCwC,MAAM,GAAG3rB,eAAe,CAAC2rB,MAAM,EAAEzrB,kBAAkB,EAAEH,WAAW,CAAC,CAAA;OAClE,MAAM,IAAIqrB,eAAe,EAAE;EAC1BrjB,MAAAA,KAAK,GAAGuhB,mBAAmB,CAAA;EAC3BoC,MAAAA,aAAa,GAAGtC,wBAAwB,CAAA;EACxCuC,MAAAA,MAAM,GAAG9qB,kBAAkB,CAAC8qB,MAAM,CAAC,CAAA;EACrC,KAAC,MAAM;EACL5jB,MAAAA,KAAK,GAAGgN,YAAY,CAAA;EACpB2W,MAAAA,aAAa,GAAGxC,iBAAiB,CAAA;EACnC,KAAA;;EAEA;MACA,IAAI0C,UAAU,GAAG,KAAK,CAAA;EACtB,IAAA,KAAA,IAAAC,UAAA,GAAA7iB,+BAAA,CAAgBjB,KAAK,CAAA,EAAA+jB,MAAA,EAAA,CAAA,CAAAA,MAAA,GAAAD,UAAA,EAAA,EAAA3iB,IAAA,GAAE;EAAA,MAAA,IAAZtC,CAAC,GAAAklB,MAAA,CAAAt9B,KAAA,CAAA;EACV,MAAA,IAAMuV,CAAC,GAAG4C,UAAU,CAACC,CAAC,CAAC,CAAA;EACvB,MAAA,IAAI,CAAClY,WAAW,CAACqV,CAAC,CAAC,EAAE;EACnB6nB,QAAAA,UAAU,GAAG,IAAI,CAAA;SAClB,MAAM,IAAIA,UAAU,EAAE;EACrBjlB,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG8kB,aAAa,CAAC9kB,CAAC,CAAC,CAAA;EAClC,OAAC,MAAM;EACLD,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG+kB,MAAM,CAAC/kB,CAAC,CAAC,CAAA;EAC3B,OAAA;EACF,KAAA;;EAEA;MACA,IAAMmlB,kBAAkB,GAAGN,WAAW,GAChChqB,kBAAkB,CAACkF,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC/DqrB,eAAe,GACfrpB,qBAAqB,CAAC4E,UAAU,CAAC,GACjC1E,uBAAuB,CAAC0E,UAAU,CAAC;EACvC6P,MAAAA,OAAO,GAAGuV,kBAAkB,IAAI1pB,kBAAkB,CAACsE,UAAU,CAAC,CAAA;EAEhE,IAAA,IAAI6P,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAA;;EAEA;MACM,IAAAwV,SAAS,GAAGP,WAAW,GACvBlrB,eAAe,CAACoG,UAAU,EAAEzG,kBAAkB,EAAEH,WAAW,CAAC,GAC5DqrB,eAAe,GACfrqB,kBAAkB,CAAC4F,UAAU,CAAC,GAC9BA,UAAU;QAAAslB,SAAA,GACW9D,OAAO,CAAC6D,SAAS,EAAE9B,YAAY,EAAEc,SAAS,CAAC;EAAnEkB,MAAAA,OAAO,GAAAD,SAAA,CAAA,CAAA,CAAA;EAAEE,MAAAA,WAAW,GAAAF,SAAA,CAAA,CAAA,CAAA;QACrB7E,IAAI,GAAG,IAAI9zB,QAAQ,CAAC;EAClBnI,QAAAA,EAAE,EAAE+gC,OAAO;EACXn9B,QAAAA,IAAI,EAAEi8B,SAAS;EACftoB,QAAAA,CAAC,EAAEypB,WAAW;EACdx4B,QAAAA,GAAG,EAAHA,GAAAA;EACF,OAAC,CAAC,CAAA;;EAEJ;EACA,IAAA,IAAIgT,UAAU,CAACrd,OAAO,IAAIiiC,cAAc,IAAIpqB,GAAG,CAAC7X,OAAO,KAAK89B,IAAI,CAAC99B,OAAO,EAAE;EACxE,MAAA,OAAOgK,QAAQ,CAACkjB,OAAO,CACrB,oBAAoB,EACmB7P,sCAAAA,GAAAA,UAAU,CAACrd,OAAO,uBAAkB89B,IAAI,CAACxP,KAAK,EACvF,CAAC,CAAA;EACH,KAAA;EAEA,IAAA,IAAI,CAACwP,IAAI,CAAC/a,OAAO,EAAE;EACjB,MAAA,OAAO/Y,QAAQ,CAACkjB,OAAO,CAAC4Q,IAAI,CAAC5Q,OAAO,CAAC,CAAA;EACvC,KAAA;EAEA,IAAA,OAAO4Q,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;IAAA9zB,QAAA,CAiBOyjB,OAAO,GAAd,SAAAA,QAAeC,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC5B,IAAA,IAAAghC,aAAA,GAA2BrY,YAAY,CAACiD,IAAI,CAAC;EAAtCzB,MAAAA,IAAI,GAAA6W,aAAA,CAAA,CAAA,CAAA;EAAE3D,MAAAA,UAAU,GAAA2D,aAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAO5D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;IAAA1jB,QAAA,CAeO+4B,WAAW,GAAlB,SAAAA,YAAmBrV,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAChC,IAAA,IAAAkhC,iBAAA,GAA2BtY,gBAAgB,CAACgD,IAAI,CAAC;EAA1CzB,MAAAA,IAAI,GAAA+W,iBAAA,CAAA,CAAA,CAAA;EAAE7D,MAAAA,UAAU,GAAA6D,iBAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAO9D,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,UAAU,EAAE4rB,IAAI,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAfE;IAAA1jB,QAAA,CAgBOi5B,QAAQ,GAAf,SAAAA,SAAgBvV,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,IAAAohC,cAAA,GAA2BvY,aAAa,CAAC+C,IAAI,CAAC;EAAvCzB,MAAAA,IAAI,GAAAiX,cAAA,CAAA,CAAA,CAAA;EAAE/D,MAAAA,UAAU,GAAA+D,cAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAOhE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,MAAM,EAAEA,IAAI,CAAC,CAAA;EAClE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAbE;IAAAkI,QAAA,CAcOm5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACpC,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAACkc,GAAG,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIniB,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;MAEA,IAAAwI,KAAA,GAAkD7F,IAAI;QAAAshC,YAAA,GAAAz7B,KAAA,CAA9C/E,MAAM;EAANA,MAAAA,MAAM,GAAAwgC,YAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,YAAA;QAAAC,qBAAA,GAAA17B,KAAA,CAAE4B,eAAe;EAAfA,MAAAA,eAAe,GAAA85B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CC,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC;QAAAg2B,gBAAA,GAC4CjG,eAAe,CAACgG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC;EAApF2K,MAAAA,IAAI,GAAAsX,gBAAA,CAAA,CAAA,CAAA;EAAEpE,MAAAA,UAAU,GAAAoE,gBAAA,CAAA,CAAA,CAAA;EAAErH,MAAAA,cAAc,GAAAqH,gBAAA,CAAA,CAAA,CAAA;EAAErW,MAAAA,OAAO,GAAAqW,gBAAA,CAAA,CAAA,CAAA,CAAA;EAC5C,IAAA,IAAIrW,OAAO,EAAE;EACX,MAAA,OAAOljB,QAAQ,CAACkjB,OAAO,CAACA,OAAO,CAAC,CAAA;EAClC,KAAC,MAAM;EACL,MAAA,OAAOgS,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAA,SAAA,GAAYwf,GAAG,EAAIoM,IAAI,EAAEwO,cAAc,CAAC,CAAA;EAC3F,KAAA;EACF,GAAA;;EAEA;EACF;EACA,MAFE;IAAAlyB,QAAA,CAGOw5B,UAAU,GAAjB,SAAAA,UAAAA,CAAkB9V,IAAI,EAAEpM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACpC,OAAOkI,QAAQ,CAACm5B,UAAU,CAACzV,IAAI,EAAEpM,GAAG,EAAExf,IAAI,CAAC,CAAA;EAC7C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MApBE;IAAAkI,QAAA,CAqBOy5B,OAAO,GAAd,SAAAA,QAAe/V,IAAI,EAAE5rB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAC5B,IAAA,IAAA4hC,SAAA,GAA2BxY,QAAQ,CAACwC,IAAI,CAAC;EAAlCzB,MAAAA,IAAI,GAAAyX,SAAA,CAAA,CAAA,CAAA;EAAEvE,MAAAA,UAAU,GAAAuE,SAAA,CAAA,CAAA,CAAA,CAAA;MACvB,OAAOxE,mBAAmB,CAACjT,IAAI,EAAEkT,UAAU,EAAEr9B,IAAI,EAAE,KAAK,EAAE4rB,IAAI,CAAC,CAAA;EACjE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAA1jB,QAAA,CAMOkjB,OAAO,GAAd,SAAAA,QAAe3uB,MAAM,EAAE8W,WAAW,EAAS;EAAA,IAAA,IAApBA,WAAW,KAAA,KAAA,CAAA,EAAA;EAAXA,MAAAA,WAAW,GAAG,IAAI,CAAA;EAAA,KAAA;MACvC,IAAI,CAAC9W,MAAM,EAAE;EACX,MAAA,MAAM,IAAIY,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;EACpF,KAAA;EAEA,IAAA,IAAM+tB,OAAO,GAAG3uB,MAAM,YAAY6W,OAAO,GAAG7W,MAAM,GAAG,IAAI6W,OAAO,CAAC7W,MAAM,EAAE8W,WAAW,CAAC,CAAA;MAErF,IAAI5H,QAAQ,CAACuH,cAAc,EAAE;EAC3B,MAAA,MAAM,IAAI3W,oBAAoB,CAAC6uB,OAAO,CAAC,CAAA;EACzC,KAAC,MAAM;QACL,OAAO,IAAIljB,QAAQ,CAAC;EAAEkjB,QAAAA,OAAO,EAAPA,OAAAA;EAAQ,OAAC,CAAC,CAAA;EAClC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAljB,EAAAA,QAAA,CAKO25B,UAAU,GAAjB,SAAAA,UAAAA,CAAkBvqB,CAAC,EAAE;EACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACkoB,eAAe,IAAK,KAAK,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;IAAAt3B,QAAA,CAMO45B,kBAAkB,GAAzB,SAAAA,mBAA0B/hB,UAAU,EAAEgiB,UAAU,EAAO;EAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG,EAAE,CAAA;EAAA,KAAA;EACnD,IAAA,IAAMC,SAAS,GAAGlH,kBAAkB,CAAC/a,UAAU,EAAErZ,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;MAC/E,OAAO,CAACC,SAAS,GAAG,IAAI,GAAGA,SAAS,CAAC13B,GAAG,CAAC,UAAC+I,CAAC,EAAA;EAAA,MAAA,OAAMA,CAAC,GAAGA,CAAC,CAAC4K,GAAG,GAAG,IAAI,CAAA;EAAA,KAAC,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;EAC9E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAArC,QAAA,CAOO+5B,YAAY,GAAnB,SAAAA,aAAoBziB,GAAG,EAAEuiB,UAAU,EAAO;EAAA,IAAA,IAAjBA,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,IAAMG,QAAQ,GAAGnH,iBAAiB,CAACzb,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE9Y,MAAM,CAAC2F,UAAU,CAAC01B,UAAU,CAAC,CAAC,CAAA;EAC7F,IAAA,OAAOG,QAAQ,CAAC53B,GAAG,CAAC,UAAC+I,CAAC,EAAA;QAAA,OAAKA,CAAC,CAAC4K,GAAG,CAAA;EAAA,KAAA,CAAC,CAAC1T,IAAI,CAAC,EAAE,CAAC,CAAA;KAC3C,CAAA;EAAArC,EAAAA,QAAA,CAEMtE,UAAU,GAAjB,SAAAA,aAAoB;EAClB86B,IAAAA,YAAY,GAAG98B,SAAS,CAAA;MACxBg9B,oBAAoB,CAAC/6B,KAAK,EAAE,CAAA;EAC9B,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA,EAAA,IAAAjE,MAAA,GAAAsI,QAAA,CAAArI,SAAA,CAAA;EAAAD,EAAAA,MAAA,CAOAY,GAAG,GAAH,SAAAA,GAAAA,CAAIpD,IAAI,EAAE;MACR,OAAO,IAAI,CAACA,IAAI,CAAC,CAAA;EACnB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAmUA;EACF;EACA;EACA;EACA;EACA;EACA;EANEwC,EAAAA,MAAA,CAOAuiC,kBAAkB,GAAlB,SAAAA,qBAAqB;MACnB,IAAI,CAAC,IAAI,CAAClhB,OAAO,IAAI,IAAI,CAACF,aAAa,EAAE;QACvC,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,KAAA;MACA,IAAMqhB,KAAK,GAAG,QAAQ,CAAA;MACtB,IAAMC,QAAQ,GAAG,KAAK,CAAA;EACtB,IAAA,IAAMlG,OAAO,GAAGx3B,YAAY,CAAC,IAAI,CAACib,CAAC,CAAC,CAAA;MACpC,IAAM0iB,QAAQ,GAAG,IAAI,CAAC3+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;MAClD,IAAMG,MAAM,GAAG,IAAI,CAAC5+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGiG,KAAK,CAAC,CAAA;EAEhD,IAAA,IAAMI,EAAE,GAAG,IAAI,CAAC7+B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGmG,QAAQ,GAAGD,QAAQ,CAAC,CAAA;EAC1D,IAAA,IAAM/F,EAAE,GAAG,IAAI,CAAC34B,IAAI,CAACxD,MAAM,CAACg8B,OAAO,GAAGoG,MAAM,GAAGF,QAAQ,CAAC,CAAA;MACxD,IAAIG,EAAE,KAAKlG,EAAE,EAAE;QACb,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,KAAA;EACA,IAAA,IAAMmG,GAAG,GAAGtG,OAAO,GAAGqG,EAAE,GAAGH,QAAQ,CAAA;EACnC,IAAA,IAAMK,GAAG,GAAGvG,OAAO,GAAGG,EAAE,GAAG+F,QAAQ,CAAA;EACnC,IAAA,IAAMM,EAAE,GAAGnG,OAAO,CAACiG,GAAG,EAAED,EAAE,CAAC,CAAA;EAC3B,IAAA,IAAMI,EAAE,GAAGpG,OAAO,CAACkG,GAAG,EAAEpG,EAAE,CAAC,CAAA;EAC3B,IAAA,IACEqG,EAAE,CAACrkC,IAAI,KAAKskC,EAAE,CAACtkC,IAAI,IACnBqkC,EAAE,CAACpkC,MAAM,KAAKqkC,EAAE,CAACrkC,MAAM,IACvBokC,EAAE,CAAClkC,MAAM,KAAKmkC,EAAE,CAACnkC,MAAM,IACvBkkC,EAAE,CAAC/9B,WAAW,KAAKg+B,EAAE,CAACh+B,WAAW,EACjC;EACA,MAAA,OAAO,CAACyI,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAE0iC,GAAAA;EAAI,OAAC,CAAC,EAAEp1B,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAE2iC,GAAAA;EAAI,OAAC,CAAC,CAAC,CAAA;EAC7D,KAAA;MACA,OAAO,CAAC,IAAI,CAAC,CAAA;EACf,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAyDA;EACF;EACA;EACA;EACA;EACA;EALE9iC,EAAAA,MAAA,CAMAijC,qBAAqB,GAArB,SAAAA,qBAAAA,CAAsB7iC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAC7B,IAAA8iC,qBAAA,GAA8CxjB,SAAS,CAAC5b,MAAM,CAC5D,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EACpBA,IACF,CAAC,CAACqB,eAAe,CAAC,IAAI,CAAC;QAHfP,MAAM,GAAAgiC,qBAAA,CAANhiC,MAAM;QAAE2G,eAAe,GAAAq7B,qBAAA,CAAfr7B,eAAe;QAAEC,QAAQ,GAAAo7B,qBAAA,CAARp7B,QAAQ,CAAA;MAIzC,OAAO;EAAE5G,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAe;EAAEG,MAAAA,cAAc,EAAEF,QAAAA;OAAU,CAAA;EAC9D,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAA9H,MAAA,CAQAy2B,KAAK,GAAL,SAAAA,MAAMl2B,MAAM,EAAMH,IAAI,EAAO;EAAA,IAAA,IAAvBG,MAAM,KAAA,KAAA,CAAA,EAAA;EAANA,MAAAA,MAAM,GAAG,CAAC,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEH,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACzB,IAAA,OAAO,IAAI,CAACkK,OAAO,CAACuF,eAAe,CAACC,QAAQ,CAACvP,MAAM,CAAC,EAAEH,IAAI,CAAC,CAAA;EAC7D,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAAJ,EAAAA,MAAA,CAMAmjC,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAAC74B,OAAO,CAACyB,QAAQ,CAACwE,WAAW,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MARE;IAAAvQ,MAAA,CASAsK,OAAO,GAAP,SAAAA,QAAQvG,IAAI,EAAA2I,KAAA,EAA4D;EAAA,IAAA,IAAAjI,KAAA,GAAAiI,KAAA,cAAJ,EAAE,GAAAA,KAAA;QAAA02B,mBAAA,GAAA3+B,KAAA,CAAtDiyB,aAAa;EAAbA,MAAAA,aAAa,GAAA0M,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;QAAAC,qBAAA,GAAA5+B,KAAA,CAAE6+B,gBAAgB;EAAhBA,MAAAA,gBAAgB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA,CAAA;MAC7Dt/B,IAAI,GAAGsM,aAAa,CAACtM,IAAI,EAAEgI,QAAQ,CAACwE,WAAW,CAAC,CAAA;MAChD,IAAIxM,IAAI,CAACvD,MAAM,CAAC,IAAI,CAACuD,IAAI,CAAC,EAAE;EAC1B,MAAA,OAAO,IAAI,CAAA;EACb,KAAC,MAAM,IAAI,CAACA,IAAI,CAACsd,OAAO,EAAE;QACxB,OAAO/Y,QAAQ,CAACkjB,OAAO,CAACwQ,eAAe,CAACj4B,IAAI,CAAC,CAAC,CAAA;EAChD,KAAC,MAAM;EACL,MAAA,IAAIw/B,KAAK,GAAG,IAAI,CAACpjC,EAAE,CAAA;QACnB,IAAIu2B,aAAa,IAAI4M,gBAAgB,EAAE;UACrC,IAAMvE,WAAW,GAAGh7B,IAAI,CAACxD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;EACxC,QAAA,IAAMqjC,KAAK,GAAG,IAAI,CAAC7W,QAAQ,EAAE,CAAA;UAAC,IAAA8W,SAAA,GACpBtG,OAAO,CAACqG,KAAK,EAAEzE,WAAW,EAAEh7B,IAAI,CAAC,CAAA;EAA1Cw/B,QAAAA,KAAK,GAAAE,SAAA,CAAA,CAAA,CAAA,CAAA;EACR,OAAA;QACA,OAAOh2B,KAAK,CAAC,IAAI,EAAE;EAAEtN,QAAAA,EAAE,EAAEojC,KAAK;EAAEx/B,QAAAA,IAAI,EAAJA,IAAAA;EAAK,OAAC,CAAC,CAAA;EACzC,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA/D,EAAAA,MAAA,CAMAkuB,WAAW,GAAX,SAAAA,WAAAA,CAAA6E,MAAA,EAA8D;EAAA,IAAA,IAAAC,KAAA,GAAAD,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAA9C7xB,MAAM,GAAA8xB,KAAA,CAAN9xB,MAAM;QAAE2G,eAAe,GAAAmrB,KAAA,CAAfnrB,eAAe;QAAEG,cAAc,GAAAgrB,KAAA,CAAdhrB,cAAc,CAAA;EACnD,IAAA,IAAMW,GAAG,GAAG,IAAI,CAACA,GAAG,CAAC8E,KAAK,CAAC;EAAEvM,MAAAA,MAAM,EAANA,MAAM;EAAE2G,MAAAA,eAAe,EAAfA,eAAe;EAAEG,MAAAA,cAAc,EAAdA,cAAAA;EAAe,KAAC,CAAC,CAAA;MACvE,OAAOyF,KAAK,CAAC,IAAI,EAAE;EAAE9E,MAAAA,GAAG,EAAHA,GAAAA;EAAI,KAAC,CAAC,CAAA;EAC7B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA3I,EAAAA,MAAA,CAMA0jC,SAAS,GAAT,SAAAA,SAAAA,CAAUxiC,MAAM,EAAE;MAChB,OAAO,IAAI,CAACgtB,WAAW,CAAC;EAAEhtB,MAAAA,MAAM,EAANA,MAAAA;EAAO,KAAC,CAAC,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAlB,EAAAA,MAAA,CAaAmC,GAAG,GAAH,SAAAA,GAAAA,CAAIygB,MAAM,EAAE;EACV,IAAA,IAAI,CAAC,IAAI,CAACvB,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,IAAM1F,UAAU,GAAGF,eAAe,CAACmH,MAAM,EAAEgc,2BAA2B,CAAC,CAAA;MACvE,IAAA+E,qBAAA,GAA4CztB,mBAAmB,CAACyF,UAAU,EAAE,IAAI,CAAChT,GAAG,CAAC;QAA7EuM,kBAAkB,GAAAyuB,qBAAA,CAAlBzuB,kBAAkB;QAAEH,WAAW,GAAA4uB,qBAAA,CAAX5uB,WAAW,CAAA;MAEvC,IAAM6uB,gBAAgB,GAClB,CAAClgC,WAAW,CAACiY,UAAU,CAACvG,QAAQ,CAAC,IACjC,CAAC1R,WAAW,CAACiY,UAAU,CAACxG,UAAU,CAAC,IACnC,CAACzR,WAAW,CAACiY,UAAU,CAACrd,OAAO,CAAC;EAClC8hC,MAAAA,eAAe,GAAG,CAAC18B,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC;EAClD4rB,MAAAA,kBAAkB,GAAG,CAAC38B,WAAW,CAACiY,UAAU,CAAC1d,IAAI,CAAC;EAClDqiC,MAAAA,gBAAgB,GAAG,CAAC58B,WAAW,CAACiY,UAAU,CAACzd,KAAK,CAAC,IAAI,CAACwF,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC;QACjFoiC,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;EACvDE,MAAAA,eAAe,GAAG7kB,UAAU,CAACvG,QAAQ,IAAIuG,UAAU,CAACxG,UAAU,CAAA;EAEhE,IAAA,IAAI,CAACorB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;EAC1D,MAAA,MAAM,IAAIpjC,6BAA6B,CACrC,qEACF,CAAC,CAAA;EACH,KAAA;MAEA,IAAIkjC,gBAAgB,IAAIF,eAAe,EAAE;EACvC,MAAA,MAAM,IAAIhjC,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;EACnF,KAAA;EAEA,IAAA,IAAI6wB,KAAK,CAAA;EACT,IAAA,IAAI2V,gBAAgB,EAAE;QACpB3V,KAAK,GAAG1Y,eAAe,CAAAtO,QAAA,KAChB+N,eAAe,CAAC,IAAI,CAACgL,CAAC,EAAE9K,kBAAkB,EAAEH,WAAW,CAAC,EAAK4G,UAAU,CAC5EzG,EAAAA,kBAAkB,EAClBH,WACF,CAAC,CAAA;OACF,MAAM,IAAI,CAACrR,WAAW,CAACiY,UAAU,CAAClH,OAAO,CAAC,EAAE;EAC3CwZ,MAAAA,KAAK,GAAGlY,kBAAkB,CAAA9O,QAAA,KAAM4O,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,EAAKrE,UAAU,CAAE,CAAC,CAAA;EAC9E,KAAC,MAAM;QACLsS,KAAK,GAAAhnB,QAAA,CAAA,EAAA,EAAQ,IAAI,CAAC0lB,QAAQ,EAAE,EAAKhR,UAAU,CAAE,CAAA;;EAE7C;EACA;EACA,MAAA,IAAIjY,WAAW,CAACiY,UAAU,CAACxd,GAAG,CAAC,EAAE;UAC/B8vB,KAAK,CAAC9vB,GAAG,GAAGwG,IAAI,CAAC+N,GAAG,CAAC0E,WAAW,CAAC6W,KAAK,CAAChwB,IAAI,EAAEgwB,KAAK,CAAC/vB,KAAK,CAAC,EAAE+vB,KAAK,CAAC9vB,GAAG,CAAC,CAAA;EACvE,OAAA;EACF,KAAA;EAEA,IAAA,IAAA0lC,SAAA,GAAgB1G,OAAO,CAAClP,KAAK,EAAE,IAAI,CAACvW,CAAC,EAAE,IAAI,CAAC3T,IAAI,CAAC;EAA1C5D,MAAAA,EAAE,GAAA0jC,SAAA,CAAA,CAAA,CAAA;EAAEnsB,MAAAA,CAAC,GAAAmsB,SAAA,CAAA,CAAA,CAAA,CAAA;MACZ,OAAOp2B,KAAK,CAAC,IAAI,EAAE;EAAEtN,MAAAA,EAAE,EAAFA,EAAE;EAAEuX,MAAAA,CAAC,EAADA,CAAAA;EAAE,KAAC,CAAC,CAAA;EAC/B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAA1X,EAAAA,MAAA,CAaAuK,IAAI,GAAJ,SAAAA,IAAAA,CAAKijB,QAAQ,EAAE;EACb,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;MAC/C,OAAO/f,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA3hB,EAAAA,MAAA,CAMA2tB,KAAK,GAAL,SAAAA,KAAAA,CAAMH,QAAQ,EAAE;EACd,IAAA,IAAI,CAAC,IAAI,CAACnM,OAAO,EAAE,OAAO,IAAI,CAAA;MAC9B,IAAMM,GAAG,GAAG0I,QAAQ,CAACuB,gBAAgB,CAAC4B,QAAQ,CAAC,CAACI,MAAM,EAAE,CAAA;MACxD,OAAOngB,KAAK,CAAC,IAAI,EAAE2vB,UAAU,CAAC,IAAI,EAAEzb,GAAG,CAAC,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA3hB,MAAA,CAYAwwB,OAAO,GAAP,SAAAA,QAAQhzB,IAAI,EAAAy2B,MAAA,EAAmC;EAAA,IAAA,IAAAI,KAAA,GAAAJ,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA6P,oBAAA,GAAAzP,KAAA,CAA7B5D,cAAc;EAAdA,MAAAA,cAAc,GAAAqT,oBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,oBAAA,CAAA;EACpC,IAAA,IAAI,CAAC,IAAI,CAACziB,OAAO,EAAE,OAAO,IAAI,CAAA;MAE9B,IAAM3J,CAAC,GAAG,EAAE;EACVqsB,MAAAA,cAAc,GAAG1Z,QAAQ,CAACsB,aAAa,CAACnuB,IAAI,CAAC,CAAA;EAC/C,IAAA,QAAQumC,cAAc;EACpB,MAAA,KAAK,OAAO;UACVrsB,CAAC,CAACxZ,KAAK,GAAG,CAAC,CAAA;EACb;EACA,MAAA,KAAK,UAAU,CAAA;EACf,MAAA,KAAK,QAAQ;UACXwZ,CAAC,CAACvZ,GAAG,GAAG,CAAC,CAAA;EACX;EACA,MAAA,KAAK,OAAO,CAAA;EACZ,MAAA,KAAK,MAAM;UACTuZ,CAAC,CAAChZ,IAAI,GAAG,CAAC,CAAA;EACZ;EACA,MAAA,KAAK,OAAO;UACVgZ,CAAC,CAAC/Y,MAAM,GAAG,CAAC,CAAA;EACd;EACA,MAAA,KAAK,SAAS;UACZ+Y,CAAC,CAAC7Y,MAAM,GAAG,CAAC,CAAA;EACd;EACA,MAAA,KAAK,SAAS;UACZ6Y,CAAC,CAAC1S,WAAW,GAAG,CAAC,CAAA;EACjB,QAAA,MAAA;EAGF;EACF,KAAA;;MAEA,IAAI++B,cAAc,KAAK,OAAO,EAAE;EAC9B,MAAA,IAAItT,cAAc,EAAE;UAClB,IAAM1b,WAAW,GAAG,IAAI,CAACpM,GAAG,CAAC6G,cAAc,EAAE,CAAA;EAC7C,QAAA,IAAQlR,OAAO,GAAK,IAAI,CAAhBA,OAAO,CAAA;UACf,IAAIA,OAAO,GAAGyW,WAAW,EAAE;EACzB2C,UAAAA,CAAC,CAACvC,UAAU,GAAG,IAAI,CAACA,UAAU,GAAG,CAAC,CAAA;EACpC,SAAA;UACAuC,CAAC,CAACpZ,OAAO,GAAGyW,WAAW,CAAA;EACzB,OAAC,MAAM;UACL2C,CAAC,CAACpZ,OAAO,GAAG,CAAC,CAAA;EACf,OAAA;EACF,KAAA;MAEA,IAAIylC,cAAc,KAAK,UAAU,EAAE;QACjC,IAAMrJ,CAAC,GAAG/1B,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAChc,KAAK,GAAG,CAAC,CAAC,CAAA;QACnCwZ,CAAC,CAACxZ,KAAK,GAAG,CAACw8B,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;EAC3B,KAAA;EAEA,IAAA,OAAO,IAAI,CAACv4B,GAAG,CAACuV,CAAC,CAAC,CAAA;EACpB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA1X,MAAA,CAYAgkC,KAAK,GAAL,SAAAA,MAAMxmC,IAAI,EAAE4C,IAAI,EAAE;EAAA,IAAA,IAAA6jC,UAAA,CAAA;EAChB,IAAA,OAAO,IAAI,CAAC5iB,OAAO,GACf,IAAI,CAAC9W,IAAI,EAAA05B,UAAA,GAAAA,EAAAA,EAAAA,UAAA,CAAIzmC,IAAI,IAAG,CAAC,EAAAymC,UAAA,EAAG,CACrBzT,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,CACnButB,KAAK,CAAC,CAAC,CAAC,GACX,IAAI,CAAA;EACV,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAA3tB,MAAA,CAYAqsB,QAAQ,GAAR,SAAAA,SAASzM,GAAG,EAAExf,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAACiF,aAAa,CAACxN,IAAI,CAAC,CAAC,CAAC4gB,wBAAwB,CAAC,IAAI,EAAEpB,GAAG,CAAC,GAClF6J,OAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAlBE;IAAAzpB,MAAA,CAmBA4yB,cAAc,GAAd,SAAAA,eAAezS,UAAU,EAAuB/f,IAAI,EAAO;EAAA,IAAA,IAA5C+f,UAAU,KAAA,KAAA,CAAA,EAAA;QAAVA,UAAU,GAAG3B,UAAkB,CAAA;EAAA,KAAA;EAAA,IAAA,IAAEpe,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACvD,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAE+f,UAAU,CAAC,CAACG,cAAc,CAAC,IAAI,CAAC,GACvEmJ,OAAO,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAzpB,EAAAA,MAAA,CAaAkkC,aAAa,GAAb,SAAAA,aAAAA,CAAc9jC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACrB,OAAO,IAAI,CAACihB,OAAO,GACf3B,SAAS,CAAC5b,MAAM,CAAC,IAAI,CAAC6E,GAAG,CAAC8E,KAAK,CAACrN,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACmgB,mBAAmB,CAAC,IAAI,CAAC,GACtE,EAAE,CAAA;EACR,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;EAAAvgB,EAAAA,MAAA,CAiBA4sB,KAAK,GAAL,SAAAA,KAAAA,CAAAwH,MAAA,EAOQ;EAAA,IAAA,IAAAQ,KAAA,GAAAR,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA+P,YAAA,GAAAvP,KAAA,CANJt0B,MAAM;EAANA,MAAAA,MAAM,GAAA6jC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,qBAAA,GAAAxP,KAAA,CACnB3H,eAAe;EAAfA,MAAAA,eAAe,GAAAmX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,qBAAA,GAAAzP,KAAA,CACvB5H,oBAAoB;EAApBA,MAAAA,oBAAoB,GAAAqX,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,mBAAA,GAAA1P,KAAA,CAC5BzH,aAAa;EAAbA,MAAAA,aAAa,GAAAmX,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,kBAAA,GAAA3P,KAAA,CACpBmJ,YAAY;EAAZA,MAAAA,YAAY,GAAAwG,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;QAAAC,eAAA,GAAA5P,KAAA,CACpBiJ,SAAS;EAATA,MAAAA,SAAS,GAAA2G,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;EAE1B,IAAA,IAAI,CAAC,IAAI,CAACnjB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;EACpC,IAAA,IAAM4G,GAAG,GAAGnkC,MAAM,KAAK,UAAU,CAAA;MAEjC,IAAI0f,CAAC,GAAG6S,UAAS,CAAC,IAAI,EAAE4R,GAAG,EAAE5G,SAAS,CAAC,CAAA;MACvC,IAAI9T,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,EAAE7d,CAAC,IAAI,GAAG,CAAA;EAClDA,IAAAA,CAAC,IAAI6M,UAAS,CACZ,IAAI,EACJ4X,GAAG,EACHxX,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;EACD,IAAA,OAAO7d,CAAC,CAAA;EACV,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;EAAAhgB,EAAAA,MAAA,CAUA6yB,SAAS,GAAT,SAAAA,SAAAA,CAAA8B,MAAA,EAA2D;EAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA+P,YAAA,GAAAxP,KAAA,CAA7C50B,MAAM;EAANA,MAAAA,MAAM,GAAAokC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,eAAA,GAAAzP,KAAA,CAAE2I,SAAS;EAATA,MAAAA,SAAS,GAAA8G,eAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,eAAA,CAAA;EAChD,IAAA,IAAI,CAAC,IAAI,CAACtjB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAEvyB,MAAM,KAAK,UAAU,EAAEqrB,aAAa,CAACkS,SAAS,CAAC,CAAC,CAAA;EACzE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA79B,EAAAA,MAAA,CAKA4kC,aAAa,GAAb,SAAAA,gBAAgB;EACd,IAAA,OAAOjH,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;EAC3C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAhBE;EAAA39B,EAAAA,MAAA,CAiBA6sB,SAAS,GAAT,SAAAA,SAAAA,CAAAoI,MAAA,EAQQ;EAAA,IAAA,IAAAO,KAAA,GAAAP,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAA4P,qBAAA,GAAArP,KAAA,CAPJxI,oBAAoB;EAApBA,MAAAA,oBAAoB,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,qBAAA,GAAAtP,KAAA,CAC5BvI,eAAe;EAAfA,MAAAA,eAAe,GAAA6X,qBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,qBAAA;QAAAC,mBAAA,GAAAvP,KAAA,CACvBrI,aAAa;EAAbA,MAAAA,aAAa,GAAA4X,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,mBAAA,GAAAxP,KAAA,CACpBtI,aAAa;EAAbA,MAAAA,aAAa,GAAA8X,mBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,mBAAA;QAAAC,kBAAA,GAAAzP,KAAA,CACrBuI,YAAY;EAAZA,MAAAA,YAAY,GAAAkH,kBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,kBAAA;QAAAC,YAAA,GAAA1P,KAAA,CACpBl1B,MAAM;EAANA,MAAAA,MAAM,GAAA4kC,YAAA,KAAG,KAAA,CAAA,GAAA,UAAU,GAAAA,YAAA;QAAAC,eAAA,GAAA3P,KAAA,CACnBqI,SAAS;EAATA,MAAAA,SAAS,GAAAsH,eAAA,KAAG,KAAA,CAAA,GAAA,cAAc,GAAAA,eAAA,CAAA;EAE1B,IAAA,IAAI,CAAC,IAAI,CAAC9jB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EAEAwc,IAAAA,SAAS,GAAGlS,aAAa,CAACkS,SAAS,CAAC,CAAA;EACpC,IAAA,IAAI7d,CAAC,GAAGkN,aAAa,IAAInD,YAAY,CAACziB,OAAO,CAACu2B,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAA;EACxE,IAAA,OACE7d,CAAC,GACD6M,UAAS,CACP,IAAI,EACJvsB,MAAM,KAAK,UAAU,EACrB2sB,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACb4Q,YAAY,EACZF,SACF,CAAC,CAAA;EAEL,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA,MALE;EAAA79B,EAAAA,MAAA,CAMAolC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,OAAOzH,YAAY,CAAC,IAAI,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAA;EACnE,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;EAAA39B,EAAAA,MAAA,CAQAqlC,MAAM,GAAN,SAAAA,SAAS;MACP,OAAO1H,YAAY,CAAC,IAAI,CAAClH,KAAK,EAAE,EAAE,iCAAiC,CAAC,CAAA;EACtE,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAz2B,EAAAA,MAAA,CAKAslC,SAAS,GAAT,SAAAA,YAAY;EACV,IAAA,IAAI,CAAC,IAAI,CAACjkB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;EACA,IAAA,OAAOwR,UAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;EAC9B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;EAAA7yB,EAAAA,MAAA,CAYAulC,SAAS,GAAT,SAAAA,SAAAA,CAAAhQ,MAAA,EAAyF;EAAA,IAAA,IAAAM,KAAA,GAAAN,MAAA,cAAJ,EAAE,GAAAA,MAAA;QAAAiQ,mBAAA,GAAA3P,KAAA,CAA3E1I,aAAa;EAAbA,MAAAA,aAAa,GAAAqY,mBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,mBAAA;QAAAC,iBAAA,GAAA5P,KAAA,CAAE6P,WAAW;EAAXA,MAAAA,WAAW,GAAAD,iBAAA,KAAG,KAAA,CAAA,GAAA,KAAK,GAAAA,iBAAA;QAAAE,qBAAA,GAAA9P,KAAA,CAAE+P,kBAAkB;EAAlBA,MAAAA,kBAAkB,GAAAD,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA,CAAA;MAC9E,IAAI/lB,GAAG,GAAG,cAAc,CAAA;MAExB,IAAI8lB,WAAW,IAAIvY,aAAa,EAAE;EAChC,MAAA,IAAIyY,kBAAkB,EAAE;EACtBhmB,QAAAA,GAAG,IAAI,GAAG,CAAA;EACZ,OAAA;EACA,MAAA,IAAI8lB,WAAW,EAAE;EACf9lB,QAAAA,GAAG,IAAI,GAAG,CAAA;SACX,MAAM,IAAIuN,aAAa,EAAE;EACxBvN,QAAAA,GAAG,IAAI,IAAI,CAAA;EACb,OAAA;EACF,KAAA;EAEA,IAAA,OAAO+d,YAAY,CAAC,IAAI,EAAE/d,GAAG,EAAE,IAAI,CAAC,CAAA;EACtC,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;EAAA5f,EAAAA,MAAA,CAYA6lC,KAAK,GAAL,SAAAA,KAAAA,CAAMzlC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACb,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE;EACjB,MAAA,OAAO,IAAI,CAAA;EACb,KAAA;MAEA,OAAU,IAAI,CAACikB,SAAS,EAAE,GAAI,GAAA,GAAA,IAAI,CAACC,SAAS,CAACnlC,IAAI,CAAC,CAAA;EACpD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAJ,EAAAA,MAAA,CAIA4P,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAO,IAAI,CAACyR,OAAO,GAAG,IAAI,CAACuL,KAAK,EAAE,GAAGnD,OAAO,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;IAAAzpB,MAAA,CAAAqrB,WAAA,CAAA,GAIA,YAA6C;MAC3C,IAAI,IAAI,CAAChK,OAAO,EAAE;EAChB,MAAA,OAAA,iBAAA,GAAyB,IAAI,CAACuL,KAAK,EAAE,GAAW,UAAA,GAAA,IAAI,CAAC7oB,IAAI,CAAClD,IAAI,GAAa,YAAA,GAAA,IAAI,CAACK,MAAM,GAAA,IAAA,CAAA;EACxF,KAAC,MAAM;QACL,OAAsC,8BAAA,GAAA,IAAI,CAACosB,aAAa,GAAA,IAAA,CAAA;EAC1D,KAAA;EACF,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAttB,EAAAA,MAAA,CAIAutB,OAAO,GAAP,SAAAA,UAAU;EACR,IAAA,OAAO,IAAI,CAACR,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA/sB,EAAAA,MAAA,CAIA+sB,QAAQ,GAAR,SAAAA,WAAW;MACT,OAAO,IAAI,CAAC1L,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAA;EACrC,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIA8lC,SAAS,GAAT,SAAAA,YAAY;MACV,OAAO,IAAI,CAACzkB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAG,IAAI,GAAGoE,GAAG,CAAA;EAC5C,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIA+lC,aAAa,GAAb,SAAAA,gBAAgB;EACd,IAAA,OAAO,IAAI,CAAC1kB,OAAO,GAAG1c,IAAI,CAAC2E,KAAK,CAAC,IAAI,CAACnJ,EAAE,GAAG,IAAI,CAAC,GAAGoE,GAAG,CAAA;EACxD,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAvE,EAAAA,MAAA,CAIAqtB,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;EACrB,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAA5sB,EAAAA,MAAA,CAIAgmC,MAAM,GAAN,SAAAA,SAAS;EACP,IAAA,OAAO,IAAI,CAACp7B,QAAQ,EAAE,CAAA;EACxB,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAA5K,EAAAA,MAAA,CAOA2sB,QAAQ,GAAR,SAAAA,QAAAA,CAASvsB,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EAChB,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,EAAE,CAAA;EAE5B,IAAA,IAAMnb,IAAI,GAAAe,QAAA,KAAQ,IAAI,CAAC+Y,CAAC,CAAE,CAAA;MAE1B,IAAI5f,IAAI,CAAC6lC,aAAa,EAAE;EACtB//B,MAAAA,IAAI,CAAC8B,cAAc,GAAG,IAAI,CAACA,cAAc,CAAA;EACzC9B,MAAAA,IAAI,CAAC2B,eAAe,GAAG,IAAI,CAACc,GAAG,CAACd,eAAe,CAAA;EAC/C3B,MAAAA,IAAI,CAAChF,MAAM,GAAG,IAAI,CAACyH,GAAG,CAACzH,MAAM,CAAA;EAC/B,KAAA;EACA,IAAA,OAAOgF,IAAI,CAAA;EACb,GAAA;;EAEA;EACF;EACA;EACA,MAHE;EAAAlG,EAAAA,MAAA,CAIA4K,QAAQ,GAAR,SAAAA,WAAW;EACT,IAAA,OAAO,IAAIxJ,IAAI,CAAC,IAAI,CAACigB,OAAO,GAAG,IAAI,CAAClhB,EAAE,GAAGoE,GAAG,CAAC,CAAA;EAC/C,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAdE;IAAAvE,MAAA,CAeA0wB,IAAI,GAAJ,SAAAA,IAAAA,CAAKwV,aAAa,EAAE1oC,IAAI,EAAmB4C,IAAI,EAAO;EAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MAClD,IAAI,CAAC,IAAI,CAACihB,OAAO,IAAI,CAAC6kB,aAAa,CAAC7kB,OAAO,EAAE;EAC3C,MAAA,OAAOgJ,QAAQ,CAACmB,OAAO,CAAC,wCAAwC,CAAC,CAAA;EACnE,KAAA;MAEA,IAAM2a,OAAO,GAAAl/B,QAAA,CAAA;QAAK/F,MAAM,EAAE,IAAI,CAACA,MAAM;QAAE2G,eAAe,EAAE,IAAI,CAACA,eAAAA;EAAe,KAAA,EAAKzH,IAAI,CAAE,CAAA;EAEvF,IAAA,IAAM2c,KAAK,GAAGnF,UAAU,CAACpa,IAAI,CAAC,CAACkN,GAAG,CAAC2f,QAAQ,CAACsB,aAAa,CAAC;QACxDya,YAAY,GAAGF,aAAa,CAAC3Y,OAAO,EAAE,GAAG,IAAI,CAACA,OAAO,EAAE;EACvD+I,MAAAA,OAAO,GAAG8P,YAAY,GAAG,IAAI,GAAGF,aAAa;EAC7C3P,MAAAA,KAAK,GAAG6P,YAAY,GAAGF,aAAa,GAAG,IAAI;QAC3CG,MAAM,GAAG3V,KAAI,CAAC4F,OAAO,EAAEC,KAAK,EAAExZ,KAAK,EAAEopB,OAAO,CAAC,CAAA;MAE/C,OAAOC,YAAY,GAAGC,MAAM,CAACzY,MAAM,EAAE,GAAGyY,MAAM,CAAA;EAChD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA,MAPE;IAAArmC,MAAA,CAQAsmC,OAAO,GAAP,SAAAA,QAAQ9oC,IAAI,EAAmB4C,IAAI,EAAO;EAAA,IAAA,IAAlC5C,IAAI,KAAA,KAAA,CAAA,EAAA;EAAJA,MAAAA,IAAI,GAAG,cAAc,CAAA;EAAA,KAAA;EAAA,IAAA,IAAE4C,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;EACtC,IAAA,OAAO,IAAI,CAACswB,IAAI,CAACpoB,QAAQ,CAAC8K,GAAG,EAAE,EAAE5V,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAC9C,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAAJ,EAAAA,MAAA,CAKAumC,KAAK,GAAL,SAAAA,KAAAA,CAAML,aAAa,EAAE;EACnB,IAAA,OAAO,IAAI,CAAC7kB,OAAO,GAAGqO,QAAQ,CAACE,aAAa,CAAC,IAAI,EAAEsW,aAAa,CAAC,GAAG,IAAI,CAAA;EAC1E,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAVE;IAAAlmC,MAAA,CAWA2wB,OAAO,GAAP,SAAAA,OAAAA,CAAQuV,aAAa,EAAE1oC,IAAI,EAAE4C,IAAI,EAAE;EACjC,IAAA,IAAI,CAAC,IAAI,CAACihB,OAAO,EAAE,OAAO,KAAK,CAAA;EAE/B,IAAA,IAAMmlB,OAAO,GAAGN,aAAa,CAAC3Y,OAAO,EAAE,CAAA;MACvC,IAAMkZ,cAAc,GAAG,IAAI,CAACn8B,OAAO,CAAC47B,aAAa,CAACniC,IAAI,EAAE;EAAE2yB,MAAAA,aAAa,EAAE,IAAA;EAAK,KAAC,CAAC,CAAA;MAChF,OACE+P,cAAc,CAACjW,OAAO,CAAChzB,IAAI,EAAE4C,IAAI,CAAC,IAAIomC,OAAO,IAAIA,OAAO,IAAIC,cAAc,CAACzC,KAAK,CAACxmC,IAAI,EAAE4C,IAAI,CAAC,CAAA;EAEhG,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;EAAAJ,EAAAA,MAAA,CAOAQ,MAAM,GAAN,SAAAA,MAAAA,CAAOmP,KAAK,EAAE;EACZ,IAAA,OACE,IAAI,CAAC0R,OAAO,IACZ1R,KAAK,CAAC0R,OAAO,IACb,IAAI,CAACkM,OAAO,EAAE,KAAK5d,KAAK,CAAC4d,OAAO,EAAE,IAClC,IAAI,CAACxpB,IAAI,CAACvD,MAAM,CAACmP,KAAK,CAAC5L,IAAI,CAAC,IAC5B,IAAI,CAAC4E,GAAG,CAACnI,MAAM,CAACmP,KAAK,CAAChH,GAAG,CAAC,CAAA;EAE9B,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAlBE;EAAA3I,EAAAA,MAAA,CAmBA0mC,UAAU,GAAV,SAAAA,UAAAA,CAAWj/B,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EACrB,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;EAC9B,IAAA,IAAMnb,IAAI,GAAGuB,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;UAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;EAAK,OAAC,CAAC;EACvE4iC,MAAAA,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,IAAI,GAAGzgC,IAAI,GAAG,CAACuB,OAAO,CAACk/B,OAAO,GAAGl/B,OAAO,CAACk/B,OAAO,GAAI,CAAC,CAAA;EACpF,IAAA,IAAI5pB,KAAK,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;EACtE,IAAA,IAAIvf,IAAI,GAAGiK,OAAO,CAACjK,IAAI,CAAA;MACvB,IAAIsa,KAAK,CAACC,OAAO,CAACtQ,OAAO,CAACjK,IAAI,CAAC,EAAE;QAC/Buf,KAAK,GAAGtV,OAAO,CAACjK,IAAI,CAAA;EACpBA,MAAAA,IAAI,GAAGwE,SAAS,CAAA;EAClB,KAAA;EACA,IAAA,OAAOo9B,YAAY,CAACl5B,IAAI,EAAE,IAAI,CAACqE,IAAI,CAACo8B,OAAO,CAAC,EAAA1/B,QAAA,KACvCQ,OAAO,EAAA;EACV8D,MAAAA,OAAO,EAAE,QAAQ;EACjBwR,MAAAA,KAAK,EAALA,KAAK;EACLvf,MAAAA,IAAI,EAAJA,IAAAA;EAAI,KAAA,CACL,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAZE;EAAAwC,EAAAA,MAAA,CAaA4mC,kBAAkB,GAAlB,SAAAA,kBAAAA,CAAmBn/B,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;EAC7B,IAAA,IAAI,CAAC,IAAI,CAAC4Z,OAAO,EAAE,OAAO,IAAI,CAAA;EAE9B,IAAA,OAAO+d,YAAY,CAAC33B,OAAO,CAACvB,IAAI,IAAIoC,QAAQ,CAACmE,UAAU,CAAC,EAAE,EAAE;QAAE1I,IAAI,EAAE,IAAI,CAACA,IAAAA;EAAK,KAAC,CAAC,EAAE,IAAI,EAAAkD,QAAA,KACjFQ,OAAO,EAAA;EACV8D,MAAAA,OAAO,EAAE,MAAM;EACfwR,MAAAA,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC;EAClCsiB,MAAAA,SAAS,EAAE,IAAA;EAAI,KAAA,CAChB,CAAC,CAAA;EACJ,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAA/2B,EAAAA,QAAA,CAKOoK,GAAG,GAAV,SAAAA,MAAyB;EAAA,IAAA,KAAA,IAAAqQ,IAAA,GAAAvmB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAiL,IAAA,GAAAE,IAAA,GAAA,CAAA,EAAAA,IAAA,GAAAF,IAAA,EAAAE,IAAA,EAAA,EAAA;EAATgO,MAAAA,SAAS,CAAAhO,IAAA,CAAAzmB,GAAAA,SAAA,CAAAymB,IAAA,CAAA,CAAA;EAAA,KAAA;MACrB,IAAI,CAACgO,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;EAC3E,KAAA;EACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;OAAE5oB,EAAAA,IAAI,CAAC+N,GAAG,CAAC,CAAA;EACxD,GAAA;;EAEA;EACF;EACA;EACA;EACA,MAJE;EAAApK,EAAAA,QAAA,CAKOqK,GAAG,GAAV,SAAAA,MAAyB;EAAA,IAAA,KAAA,IAAA0Q,KAAA,GAAA7mB,SAAA,CAAA8G,MAAA,EAAX2tB,SAAS,GAAAnZ,IAAAA,KAAA,CAAAuL,KAAA,GAAAE,KAAA,GAAA,CAAA,EAAAA,KAAA,GAAAF,KAAA,EAAAE,KAAA,EAAA,EAAA;EAAT0N,MAAAA,SAAS,CAAA1N,KAAA,CAAA/mB,GAAAA,SAAA,CAAA+mB,KAAA,CAAA,CAAA;EAAA,KAAA;MACrB,IAAI,CAAC0N,SAAS,CAAC4V,KAAK,CAACv+B,QAAQ,CAAC25B,UAAU,CAAC,EAAE;EACzC,MAAA,MAAM,IAAIxkC,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;EAC3E,KAAA;EACA,IAAA,OAAOua,MAAM,CAACiZ,SAAS,EAAE,UAAC5tB,CAAC,EAAA;EAAA,MAAA,OAAKA,CAAC,CAACkqB,OAAO,EAAE,CAAA;OAAE5oB,EAAAA,IAAI,CAACgO,GAAG,CAAC,CAAA;EACxD,GAAA;;EAEA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA,MANE;IAAArK,QAAA,CAOOw+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyB9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9C,IAAAG,QAAA,GAAkDH,OAAO;QAAAs/B,eAAA,GAAAn/B,QAAA,CAAjD1G,MAAM;EAANA,MAAAA,MAAM,GAAA6lC,eAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,eAAA;QAAAC,qBAAA,GAAAp/B,QAAA,CAAEC,eAAe;EAAfA,MAAAA,eAAe,GAAAm/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CpF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;EACJ,IAAA,OAAO2vB,iBAAiB,CAACoG,WAAW,EAAE5V,IAAI,EAAEpM,GAAG,CAAC,CAAA;EAClD,GAAA;;EAEA;EACF;EACA,MAFE;IAAAtX,QAAA,CAGO2+B,iBAAiB,GAAxB,SAAAA,iBAAAA,CAAyBjb,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MAC9C,OAAOa,QAAQ,CAACw+B,iBAAiB,CAAC9a,IAAI,EAAEpM,GAAG,EAAEnY,OAAO,CAAC,CAAA;EACvD,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MAXE;IAAAa,QAAA,CAYO4+B,iBAAiB,GAAxB,SAAAA,kBAAyBtnB,GAAG,EAAEnY,OAAO,EAAO;EAAA,IAAA,IAAdA,OAAO,KAAA,KAAA,CAAA,EAAA;QAAPA,OAAO,GAAG,EAAE,CAAA;EAAA,KAAA;MACxC,IAAA0/B,SAAA,GAAkD1/B,OAAO;QAAA2/B,gBAAA,GAAAD,SAAA,CAAjDjmC,MAAM;EAANA,MAAAA,MAAM,GAAAkmC,gBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,gBAAA;QAAAC,qBAAA,GAAAF,SAAA,CAAEt/B,eAAe;EAAfA,MAAAA,eAAe,GAAAw/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3CzF,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;EACJ,IAAA,OAAO,IAAIuvB,WAAW,CAACwG,WAAW,EAAEhiB,GAAG,CAAC,CAAA;EAC1C,GAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,MATE;IAAAtX,QAAA,CAUOg/B,gBAAgB,GAAvB,SAAAA,gBAAAA,CAAwBtb,IAAI,EAAEub,YAAY,EAAEnnC,IAAI,EAAO;EAAA,IAAA,IAAXA,IAAI,KAAA,KAAA,CAAA,EAAA;QAAJA,IAAI,GAAG,EAAE,CAAA;EAAA,KAAA;MACnD,IAAIsD,WAAW,CAACsoB,IAAI,CAAC,IAAItoB,WAAW,CAAC6jC,YAAY,CAAC,EAAE;EAClD,MAAA,MAAM,IAAI9pC,oBAAoB,CAC5B,+DACF,CAAC,CAAA;EACH,KAAA;MACA,IAAA+pC,MAAA,GAAkDpnC,IAAI;QAAAqnC,aAAA,GAAAD,MAAA,CAA9CtmC,MAAM;EAANA,MAAAA,MAAM,GAAAumC,aAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,aAAA;QAAAC,qBAAA,GAAAF,MAAA,CAAE3/B,eAAe;EAAfA,MAAAA,eAAe,GAAA6/B,qBAAA,KAAG,KAAA,CAAA,GAAA,IAAI,GAAAA,qBAAA;EAC3C9F,MAAAA,WAAW,GAAG96B,MAAM,CAAC6E,QAAQ,CAAC;EAC5BzK,QAAAA,MAAM,EAANA,MAAM;EACN2G,QAAAA,eAAe,EAAfA,eAAe;EACfgE,QAAAA,WAAW,EAAE,IAAA;EACf,OAAC,CAAC,CAAA;MAEJ,IAAI,CAAC+1B,WAAW,CAACphC,MAAM,CAAC+mC,YAAY,CAACrmC,MAAM,CAAC,EAAE;QAC5C,MAAM,IAAIzD,oBAAoB,CAC5B,2CAA4CmkC,GAAAA,WAAW,sDACZ2F,YAAY,CAACrmC,MAAM,CAChE,CAAC,CAAA;EACH,KAAA;EAEA,IAAA,IAAAymC,qBAAA,GAAwDJ,YAAY,CAAC/L,iBAAiB,CAACxP,IAAI,CAAC;QAApFrE,MAAM,GAAAggB,qBAAA,CAANhgB,MAAM;QAAE5jB,IAAI,GAAA4jC,qBAAA,CAAJ5jC,IAAI;QAAEy2B,cAAc,GAAAmN,qBAAA,CAAdnN,cAAc;QAAElN,aAAa,GAAAqa,qBAAA,CAAbra,aAAa,CAAA;EAEnD,IAAA,IAAIA,aAAa,EAAE;EACjB,MAAA,OAAOhlB,QAAQ,CAACkjB,OAAO,CAAC8B,aAAa,CAAC,CAAA;EACxC,KAAC,MAAM;EACL,MAAA,OAAOkQ,mBAAmB,CACxB7V,MAAM,EACN5jB,IAAI,EACJ3D,IAAI,EACMmnC,SAAAA,GAAAA,YAAY,CAACjnC,MAAM,EAC7B0rB,IAAI,EACJwO,cACF,CAAC,CAAA;EACH,KAAA;EACF,GAAA;;EAEA;;EAEA;EACF;EACA;EACA,MAHE;EAAA95B,EAAAA,YAAA,CAAA4H,QAAA,EAAA,CAAA;MAAA3H,GAAA,EAAA,SAAA;MAAAC,GAAA,EA3xCA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAAC4qB,OAAO,KAAK,IAAI,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7qB,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC3uB,MAAM,GAAG,IAAI,CAAA;EAClD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA8D,GAAA,EAAA,oBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO,IAAI,CAAC4qB,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC7X,WAAW,GAAG,IAAI,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAhT,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACzH,MAAM,GAAG,IAAI,CAAA;EAC9C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;EACvD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAlH,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;QACnB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAAC1Y,GAAG,CAACX,cAAc,GAAG,IAAI,CAAA;EACtD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAArH,GAAA,EAAA,MAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAAC++B,KAAK,CAAA;EACnB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAh/B,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAAClD,IAAI,GAAG,IAAI,CAAA;EAC7C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAF,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC/hB,IAAI,GAAGsG,GAAG,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAG1c,IAAI,CAACuV,IAAI,CAAC,IAAI,CAAC8F,CAAC,CAAC9hB,KAAK,GAAG,CAAC,CAAC,GAAGqG,GAAG,CAAA;EACzD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,OAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAY;QACV,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC9hB,KAAK,GAAGqG,GAAG,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,KAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAU;QACR,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAC7hB,GAAG,GAAGoG,GAAG,CAAA;EACxC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,MAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAW;QACT,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACthB,IAAI,GAAG6F,GAAG,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACrhB,MAAM,GAAG4F,GAAG,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,QAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAACnhB,MAAM,GAAG0F,GAAG,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,aAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAkB;QAChB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACrB,CAAC,CAAChb,WAAW,GAAGT,GAAG,CAAA;EAChD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,UAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAe;QACb,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC7mB,QAAQ,GAAG7Q,GAAG,CAAA;EACnE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC9mB,UAAU,GAAG5Q,GAAG,CAAA;EACrE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAc;QACZ,OAAO,IAAI,CAACygB,OAAO,GAAG4a,sBAAsB,CAAC,IAAI,CAAC,CAAC39B,OAAO,GAAGiG,GAAG,CAAA;EAClE,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA5D,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAgB;EACd,MAAA,OAAO,IAAI,CAACygB,OAAO,IAAI,IAAI,CAAC1Y,GAAG,CAAC+G,cAAc,EAAE,CAACzH,QAAQ,CAAC,IAAI,CAAC3J,OAAO,CAAC,CAAA;EACzE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,cAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;QACjB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC59B,OAAO,GAAGiG,GAAG,CAAA;EACvE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC/mB,UAAU,GAAG5Q,GAAG,CAAA;EAC1E,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,eAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACygB,OAAO,GAAG6a,2BAA2B,CAAC,IAAI,CAAC,CAAC9mB,QAAQ,GAAG7Q,GAAG,CAAA;EACxE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,SAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAc;EACZ,MAAA,OAAO,IAAI,CAACygB,OAAO,GAAGxL,kBAAkB,CAAC,IAAI,CAACmK,CAAC,CAAC,CAACvL,OAAO,GAAGlQ,GAAG,CAAA;EAChE,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,OAAO,EAAE;UAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EACzF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,WAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAgB;QACd,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAACvlB,MAAM,CAAC,MAAM,EAAE;UAAE8lB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACzK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EACxF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,cAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAmB;QACjB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,OAAO,EAAE;UAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EAC7F,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;QAChB,OAAO,IAAI,CAACygB,OAAO,GAAGgS,IAAI,CAAChlB,QAAQ,CAAC,MAAM,EAAE;UAAEulB,MAAM,EAAE,IAAI,CAACjrB,GAAAA;SAAK,CAAC,CAAC,IAAI,CAACrK,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;EAC5F,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAqC,GAAA,EAAA,QAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAa;QACX,OAAO,IAAI,CAACygB,OAAO,GAAG,CAAC,IAAI,CAAC3J,CAAC,GAAGnT,GAAG,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAsB;QACpB,IAAI,IAAI,CAACygB,OAAO,EAAE;UAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;EACnCG,UAAAA,MAAM,EAAE,OAAO;YACfY,MAAM,EAAE,IAAI,CAACA,MAAAA;EACf,SAAC,CAAC,CAAA;EACJ,OAAC,MAAM;EACL,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACF,KAAA;;EAEA;EACF;EACA;EACA;EACA;EAJE,GAAA,EAAA;MAAAP,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAKA,SAAAA,GAAAA,GAAqB;QACnB,IAAI,IAAI,CAACygB,OAAO,EAAE;UAChB,OAAO,IAAI,CAACtd,IAAI,CAAC7D,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;EACnCG,UAAAA,MAAM,EAAE,MAAM;YACdY,MAAM,EAAE,IAAI,CAACA,MAAAA;EACf,SAAC,CAAC,CAAA;EACJ,OAAC,MAAM;EACL,QAAA,OAAO,IAAI,CAAA;EACb,OAAA;EACF,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAAP,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoB;QAClB,OAAO,IAAI,CAACygB,OAAO,GAAG,IAAI,CAACtd,IAAI,CAACyvB,WAAW,GAAG,IAAI,CAAA;EACpD,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7yB,GAAA,EAAA,SAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAc;QACZ,IAAI,IAAI,CAACugB,aAAa,EAAE;EACtB,QAAA,OAAO,KAAK,CAAA;EACd,OAAC,MAAM;EACL,QAAA,OACE,IAAI,CAAC5gB,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;EAAEjE,UAAAA,KAAK,EAAE,CAAC;EAAEC,UAAAA,GAAG,EAAE,CAAA;WAAG,CAAC,CAACoC,MAAM,IACnD,IAAI,CAACA,MAAM,GAAG,IAAI,CAAC4B,GAAG,CAAC;EAAEjE,UAAAA,KAAK,EAAE,CAAA;WAAG,CAAC,CAACqC,MAAM,CAAA;EAE/C,OAAA;EACF,KAAA;EAAC,GAAA,EAAA;MAAAI,GAAA,EAAA,cAAA;MAAAC,GAAA,EA6CD,SAAAA,GAAAA,GAAmB;EACjB,MAAA,OAAO2T,UAAU,CAAC,IAAI,CAACtW,IAAI,CAAC,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA0C,GAAA,EAAA,aAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAkB;QAChB,OAAOwW,WAAW,CAAC,IAAI,CAACnZ,IAAI,EAAE,IAAI,CAACC,KAAK,CAAC,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAAyC,GAAA,EAAA,YAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAAiB;QACf,OAAO,IAAI,CAACygB,OAAO,GAAG1L,UAAU,CAAC,IAAI,CAAC1X,IAAI,CAAC,GAAGsG,GAAG,CAAA;EACnD,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EACA;EANE,GAAA,EAAA;MAAA5D,GAAA,EAAA,iBAAA;MAAAC,GAAA,EAOA,SAAAA,GAAAA,GAAsB;QACpB,OAAO,IAAI,CAACygB,OAAO,GAAGhM,eAAe,CAAC,IAAI,CAACD,QAAQ,CAAC,GAAG7Q,GAAG,CAAA;EAC5D,KAAA;;EAEA;EACF;EACA;EACA;EACA;EACA;EALE,GAAA,EAAA;MAAA5D,GAAA,EAAA,sBAAA;MAAAC,GAAA,EAMA,SAAAA,GAAAA,GAA2B;QACzB,OAAO,IAAI,CAACygB,OAAO,GACfhM,eAAe,CACb,IAAI,CAACkB,aAAa,EAClB,IAAI,CAAC5N,GAAG,CAAC8G,qBAAqB,EAAE,EAChC,IAAI,CAAC9G,GAAG,CAAC6G,cAAc,EACzB,CAAC,GACDjL,GAAG,CAAA;EACT,KAAA;EAAC,GAAA,CAAA,EAAA,CAAA;MAAA5D,GAAA,EAAA,YAAA;MAAAC,GAAA,EAs4BD,SAAAA,GAAAA,GAAwB;QACtB,OAAO4d,UAAkB,CAAA;EAC3B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,UAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsB;QACpB,OAAO4d,QAAgB,CAAA;EACzB,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;QACjC,OAAO4d,qBAA6B,CAAA;EACtC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;QACrB,OAAO4d,SAAiB,CAAA;EAC1B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,WAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuB;QACrB,OAAO4d,SAAiB,CAAA;EAC1B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,aAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyB;QACvB,OAAO4d,WAAmB,CAAA;EAC5B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,mBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA+B;QAC7B,OAAO4d,iBAAyB,CAAA;EAClC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,wBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAoC;QAClC,OAAO4d,sBAA8B,CAAA;EACvC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,uBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAmC;QACjC,OAAO4d,qBAA6B,CAAA;EACtC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;QAC1B,OAAO4d,cAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,sBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAkC;QAChC,OAAO4d,oBAA4B,CAAA;EACrC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,0BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAsC;QACpC,OAAO4d,wBAAgC,CAAA;EACzC,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,gBAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA4B;QAC1B,OAAO4d,cAAsB,CAAA;EAC/B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,6BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAyC;QACvC,OAAO4d,2BAAmC,CAAA;EAC5C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,cAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA0B;QACxB,OAAO4d,YAAoB,CAAA;EAC7B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,2BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAuC;QACrC,OAAO4d,yBAAiC,CAAA;EAC1C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;QACzB,OAAO4d,aAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,4BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;QACtC,OAAO4d,0BAAkC,CAAA;EAC3C,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,eAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAA2B;QACzB,OAAO4d,aAAqB,CAAA;EAC9B,KAAA;;EAEA;EACF;EACA;EACA;EAHE,GAAA,EAAA;MAAA7d,GAAA,EAAA,4BAAA;MAAAC,GAAA,EAIA,SAAAA,GAAAA,GAAwC;QACtC,OAAO4d,0BAAkC,CAAA;EAC3C,KAAA;EAAC,GAAA,CAAA,CAAA,CAAA;EAAA,EAAA,OAAAlW,QAAA,CAAA;EAAA,CAAA,CAnhBAinB,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,EAAA;EAyhBpC,SAASM,gBAAgBA,CAAC8X,WAAW,EAAE;EAC5C,EAAA,IAAIt/B,QAAQ,CAAC25B,UAAU,CAAC2F,WAAW,CAAC,EAAE;EACpC,IAAA,OAAOA,WAAW,CAAA;EACpB,GAAC,MAAM,IAAIA,WAAW,IAAIA,WAAW,CAACra,OAAO,IAAI7c,QAAQ,CAACk3B,WAAW,CAACra,OAAO,EAAE,CAAC,EAAE;EAChF,IAAA,OAAOjlB,QAAQ,CAACy3B,UAAU,CAAC6H,WAAW,CAAC,CAAA;KACxC,MAAM,IAAIA,WAAW,IAAI,OAAOA,WAAW,KAAK,QAAQ,EAAE;EACzD,IAAA,OAAOt/B,QAAQ,CAACmE,UAAU,CAACm7B,WAAW,CAAC,CAAA;EACzC,GAAC,MAAM;EACL,IAAA,MAAM,IAAInqC,oBAAoB,CAAA,6BAAA,GACEmqC,WAAW,GAAa,YAAA,GAAA,OAAOA,WAC/D,CAAC,CAAA;EACH,GAAA;EACF;;AC/hFMC,MAAAA,OAAO,GAAG;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/luxon/build/global/luxon.min.js b/node_modules/luxon/build/global/luxon.min.js
new file mode 100644
index 0000000..9b01303
--- /dev/null
+++ b/node_modules/luxon/build/global/luxon.min.js
@@ -0,0 +1 @@
+var luxon=function(e){"use strict";function L(e,t){for(var n=0;n<t.length;n++){var r=t[n];r.enumerable=r.enumerable||!1,r.configurable=!0,"value"in r&&(r.writable=!0),Object.defineProperty(e,function(e){e=function(e,t){if("object"!=typeof e||null===e)return e;var n=e[Symbol.toPrimitive];if(void 0===n)return("string"===t?String:Number)(e);n=n.call(e,t||"default");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}(e,"string");return"symbol"==typeof e?e:String(e)}(r.key),r)}}function i(e,t,n){t&&L(e.prototype,t),n&&L(e,n),Object.defineProperty(e,"prototype",{writable:!1})}function l(){return(l=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n,r=arguments[t];for(n in r)Object.prototype.hasOwnProperty.call(r,n)&&(e[n]=r[n])}return e}).apply(this,arguments)}function o(e,t){e.prototype=Object.create(t.prototype),z(e.prototype.constructor=e,t)}function j(e){return(j=Object.setPrototypeOf?Object.getPrototypeOf.bind():function(e){return e.__proto__||Object.getPrototypeOf(e)})(e)}function z(e,t){return(z=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(e,t){return e.__proto__=t,e})(e,t)}function A(e,t,n){return(A=function(){if("undefined"!=typeof Reflect&&Reflect.construct&&!Reflect.construct.sham){if("function"==typeof Proxy)return 1;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],function(){})),1}catch(e){}}}()?Reflect.construct.bind():function(e,t,n){var r=[null];r.push.apply(r,t);t=new(Function.bind.apply(e,r));return n&&z(t,n.prototype),t}).apply(null,arguments)}function q(e){var n="function"==typeof Map?new Map:void 0;return function(e){if(null===e||-1===Function.toString.call(e).indexOf("[native code]"))return e;if("function"!=typeof e)throw new TypeError("Super expression must either be null or a function");if(void 0!==n){if(n.has(e))return n.get(e);n.set(e,t)}function t(){return A(e,arguments,j(this).constructor)}return t.prototype=Object.create(e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),z(t,e)}(e)}function _(e,t){if(null==e)return{};for(var n,r={},i=Object.keys(e),o=0;o<i.length;o++)n=i[o],0<=t.indexOf(n)||(r[n]=e[n]);return r}function U(e,t){(null==t||t>e.length)&&(t=e.length);for(var n=0,r=new Array(t);n<t;n++)r[n]=e[n];return r}function R(e,t){var n,r="undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"];if(r)return(r=r.call(e)).next.bind(r);if(Array.isArray(e)||(r=function(e,t){var n;if(e)return"string"==typeof e?U(e,t):"Map"===(n="Object"===(n=Object.prototype.toString.call(e).slice(8,-1))&&e.constructor?e.constructor.name:n)||"Set"===n?Array.from(e):"Arguments"===n||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)?U(e,t):void 0}(e))||t&&e&&"number"==typeof e.length)return r&&(e=r),n=0,function(){return n>=e.length?{done:!0}:{done:!1,value:e[n++]}};throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var t=function(e){function t(){return e.apply(this,arguments)||this}return o(t,e),t}(q(Error)),P=function(t){function e(e){return t.call(this,"Invalid DateTime: "+e.toMessage())||this}return o(e,t),e}(t),Y=function(t){function e(e){return t.call(this,"Invalid Interval: "+e.toMessage())||this}return o(e,t),e}(t),H=function(t){function e(e){return t.call(this,"Invalid Duration: "+e.toMessage())||this}return o(e,t),e}(t),w=function(e){function t(){return e.apply(this,arguments)||this}return o(t,e),t}(t),J=function(t){function e(e){return t.call(this,"Invalid unit "+e)||this}return o(e,t),e}(t),u=function(e){function t(){return e.apply(this,arguments)||this}return o(t,e),t}(t),n=function(e){function t(){return e.call(this,"Zone is an abstract class")||this}return o(t,e),t}(t),t="numeric",r="short",a="long",G={year:t,month:t,day:t},$={year:t,month:r,day:t},B={year:t,month:r,day:t,weekday:r},Q={year:t,month:a,day:t},K={year:t,month:a,day:t,weekday:a},X={hour:t,minute:t},ee={hour:t,minute:t,second:t},te={hour:t,minute:t,second:t,timeZoneName:r},ne={hour:t,minute:t,second:t,timeZoneName:a},re={hour:t,minute:t,hourCycle:"h23"},ie={hour:t,minute:t,second:t,hourCycle:"h23"},oe={hour:t,minute:t,second:t,hourCycle:"h23",timeZoneName:r},ae={hour:t,minute:t,second:t,hourCycle:"h23",timeZoneName:a},se={year:t,month:t,day:t,hour:t,minute:t},ue={year:t,month:t,day:t,hour:t,minute:t,second:t},le={year:t,month:r,day:t,hour:t,minute:t},ce={year:t,month:r,day:t,hour:t,minute:t,second:t},fe={year:t,month:r,day:t,weekday:r,hour:t,minute:t},de={year:t,month:a,day:t,hour:t,minute:t,timeZoneName:r},he={year:t,month:a,day:t,hour:t,minute:t,second:t,timeZoneName:r},me={year:t,month:a,day:t,weekday:a,hour:t,minute:t,timeZoneName:a},ye={year:t,month:a,day:t,weekday:a,hour:t,minute:t,second:t,timeZoneName:a},s=function(){function e(){}var t=e.prototype;return t.offsetName=function(e,t){throw new n},t.formatOffset=function(e,t){throw new n},t.offset=function(e){throw new n},t.equals=function(e){throw new n},i(e,[{key:"type",get:function(){throw new n}},{key:"name",get:function(){throw new n}},{key:"ianaName",get:function(){return this.name}},{key:"isUniversal",get:function(){throw new n}},{key:"isValid",get:function(){throw new n}}]),e}(),ve=null,ge=function(e){function t(){return e.apply(this,arguments)||this}o(t,e);var n=t.prototype;return n.offsetName=function(e,t){return Ot(e,t.format,t.locale)},n.formatOffset=function(e,t){return Dt(this.offset(e),t)},n.offset=function(e){return-new Date(e).getTimezoneOffset()},n.equals=function(e){return"system"===e.type},i(t,[{key:"type",get:function(){return"system"}},{key:"name",get:function(){return(new Intl.DateTimeFormat).resolvedOptions().timeZone}},{key:"isUniversal",get:function(){return!1}},{key:"isValid",get:function(){return!0}}],[{key:"instance",get:function(){return ve=null===ve?new t:ve}}]),t}(s),pe=new Map;var ke={year:0,month:1,day:2,era:3,hour:4,minute:5,second:6};var we=new Map,c=function(n){function r(e){var t=n.call(this)||this;return t.zoneName=e,t.valid=r.isValidZone(e),t}o(r,n),r.create=function(e){var t=we.get(e);return void 0===t&&we.set(e,t=new r(e)),t},r.resetCache=function(){we.clear(),pe.clear()},r.isValidSpecifier=function(e){return this.isValidZone(e)},r.isValidZone=function(e){if(!e)return!1;try{return new Intl.DateTimeFormat("en-US",{timeZone:e}).format(),!0}catch(e){return!1}};var e=r.prototype;return e.offsetName=function(e,t){return Ot(e,t.format,t.locale,this.name)},e.formatOffset=function(e,t){return Dt(this.offset(e),t)},e.offset=function(e){var t,n,r,i,o,a,s,u;return!this.valid||(e=new Date(e),isNaN(e))?NaN:(i=this.name,void 0===(o=pe.get(i))&&(o=new Intl.DateTimeFormat("en-US",{hour12:!1,timeZone:i,year:"numeric",month:"2-digit",day:"2-digit",hour:"2-digit",minute:"2-digit",second:"2-digit",era:"short"}),pe.set(i,o)),a=(i=(i=o).formatToParts?function(e,t){for(var n=e.formatToParts(t),r=[],i=0;i<n.length;i++){var o=n[i],a=o.type,o=o.value,s=ke[a];"era"===a?r[s]=o:N(s)||(r[s]=parseInt(o,10))}return r}(i,e):(o=e,i=(i=i).format(o).replace(/\u200E/g,""),i=(o=/(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(i))[1],a=o[2],[o[3],i,a,o[4],o[5],o[6],o[7]]))[0],o=i[1],t=i[2],n=i[3],s=i[4],r=i[5],i=i[6],s=24===s?0:s,u=(e=+e)%1e3,(kt({year:a="BC"===n?1-Math.abs(a):a,month:o,day:t,hour:s,minute:r,second:i,millisecond:0})-(e-=0<=u?u:1e3+u))/6e4)},e.equals=function(e){return"iana"===e.type&&e.name===this.name},i(r,[{key:"type",get:function(){return"iana"}},{key:"name",get:function(){return this.zoneName}},{key:"isUniversal",get:function(){return!1}},{key:"isValid",get:function(){return this.valid}}]),r}(s),be=["base"],Se=["padTo","floor"],Oe={};var Te=new Map;function Ne(e,t){void 0===t&&(t={});var n=JSON.stringify([e,t]),r=Te.get(n);return void 0===r&&(r=new Intl.DateTimeFormat(e,t),Te.set(n,r)),r}var Me=new Map;var De=new Map;var Ie=null;var Ve=new Map;function Ee(e){var t=Ve.get(e);return void 0===t&&(t=new Intl.DateTimeFormat(e).resolvedOptions(),Ve.set(e,t)),t}var xe=new Map;function Fe(e,t,n,r){e=e.listingMode();return"error"===e?null:("en"===e?n:r)(t)}var Ce=function(){function e(e,t,n){this.padTo=n.padTo||0,this.floor=n.floor||!1,n.padTo,n.floor;var r=_(n,Se);(!t||0<Object.keys(r).length)&&(t=l({useGrouping:!1},n),0<n.padTo&&(t.minimumIntegerDigits=n.padTo),this.inf=(r=e,void 0===(n=t)&&(n={}),e=JSON.stringify([r,n]),void 0===(t=Me.get(e))&&(t=new Intl.NumberFormat(r,n),Me.set(e,t)),t))}return e.prototype.format=function(e){var t;return this.inf?(t=this.floor?Math.floor(e):e,this.inf.format(t)):m(this.floor?Math.floor(e):vt(e,3),this.padTo)},e}(),Ze=function(){function e(e,t,n){this.opts=n;var n=this.originalZone=void 0,r=(this.opts.timeZone?this.dt=e:"fixed"===e.zone.type?(r=0<=(r=e.offset/60*-1)?"Etc/GMT+"+r:"Etc/GMT"+r,0!==e.offset&&c.create(r).valid?(n=r,this.dt=e):(n="UTC",this.dt=0===e.offset?e:e.setZone("UTC").plus({minutes:e.offset}),this.originalZone=e.zone)):"system"===e.zone.type?this.dt=e:"iana"===e.zone.type?n=(this.dt=e).zone.name:(this.dt=e.setZone(n="UTC").plus({minutes:e.offset}),this.originalZone=e.zone),l({},this.opts));r.timeZone=r.timeZone||n,this.dtf=Ne(t,r)}var t=e.prototype;return t.format=function(){return this.originalZone?this.formatToParts().map(function(e){return e.value}).join(""):this.dtf.format(this.dt.toJSDate())},t.formatToParts=function(){var t=this,e=this.dtf.formatToParts(this.dt.toJSDate());return this.originalZone?e.map(function(e){return"timeZoneName"===e.type?l({},e,{value:t.originalZone.offsetName(t.dt.ts,{locale:t.dt.locale,format:t.opts.timeZoneName})}):e}):e},t.resolvedOptions=function(){return this.dtf.resolvedOptions()},e}(),We=function(){function e(e,t,n){var r;this.opts=l({style:"long"},n),!t&&ft()&&(this.rtf=(t=e,(n=e=void 0===(e=n)?{}:e).base,n=_(n=e,be),n=JSON.stringify([t,n]),void 0===(r=De.get(n))&&(r=new Intl.RelativeTimeFormat(t,e),De.set(n,r)),r))}var t=e.prototype;return t.format=function(e,t){if(this.rtf)return this.rtf.format(e,t);var n=t,t=e,e=this.opts.numeric,r="long"!==this.opts.style,i=(void 0===e&&(e="always"),void 0===r&&(r=!1),{years:["year","yr."],quarters:["quarter","qtr."],months:["month","mo."],weeks:["week","wk."],days:["day","day","days"],hours:["hour","hr."],minutes:["minute","min."],seconds:["second","sec."]}),o=-1===["hours","minutes","seconds"].indexOf(n);if("auto"===e&&o){var a="days"===n;switch(t){case 1:return a?"tomorrow":"next "+i[n][0];case-1:return a?"yesterday":"last "+i[n][0];case 0:return a?"today":"this "+i[n][0]}}var e=Object.is(t,-0)||t<0,t=1===(o=Math.abs(t)),s=i[n],r=r?!t&&s[2]||s[1]:t?i[n][0]:n;return e?o+" "+r+" ago":"in "+o+" "+r},t.formatToParts=function(e,t){return this.rtf?this.rtf.formatToParts(e,t):[]},e}(),Le={firstDay:1,minimalDays:4,weekend:[6,7]},b=function(){function o(e,t,n,r,i){var e=function(t){var n=t.indexOf("-x-");if(-1===(n=(t=-1!==n?t.substring(0,n):t).indexOf("-u-")))return[t];try{r=Ne(t).resolvedOptions(),i=t}catch(e){var t=t.substring(0,n),r=Ne(t).resolvedOptions(),i=t}return[i,(n=r).numberingSystem,n.calendar]}(e),o=e[0],a=e[1],e=e[2];this.locale=o,this.numberingSystem=t||a||null,this.outputCalendar=n||e||null,this.weekSettings=r,this.intl=(o=this.locale,t=this.numberingSystem,((a=this.outputCalendar)||t)&&(o.includes("-u-")||(o+="-u"),a&&(o+="-ca-"+a),t)&&(o+="-nu-"+t),o),this.weekdaysCache={format:{},standalone:{}},this.monthsCache={format:{},standalone:{}},this.meridiemCache=null,this.eraCache={},this.specifiedLocale=i,this.fastNumbersCached=null}o.fromOpts=function(e){return o.create(e.locale,e.numberingSystem,e.outputCalendar,e.weekSettings,e.defaultToEN)},o.create=function(e,t,n,r,i){void 0===i&&(i=!1);e=e||O.defaultLocale;return new o(e||(i?"en-US":Ie=Ie||(new Intl.DateTimeFormat).resolvedOptions().locale),t||O.defaultNumberingSystem,n||O.defaultOutputCalendar,mt(r)||O.defaultWeekSettings,e)},o.resetCache=function(){Ie=null,Te.clear(),Me.clear(),De.clear(),Ve.clear(),xe.clear()},o.fromObject=function(e){var e=void 0===e?{}:e,t=e.locale,n=e.numberingSystem,r=e.outputCalendar,e=e.weekSettings;return o.create(t,n,r,e)};var e=o.prototype;return e.listingMode=function(){var e=this.isEnglish(),t=!(null!==this.numberingSystem&&"latn"!==this.numberingSystem||null!==this.outputCalendar&&"gregory"!==this.outputCalendar);return e&&t?"en":"intl"},e.clone=function(e){return e&&0!==Object.getOwnPropertyNames(e).length?o.create(e.locale||this.specifiedLocale,e.numberingSystem||this.numberingSystem,e.outputCalendar||this.outputCalendar,mt(e.weekSettings)||this.weekSettings,e.defaultToEN||!1):this},e.redefaultToEN=function(e){return this.clone(l({},e=void 0===e?{}:e,{defaultToEN:!0}))},e.redefaultToSystem=function(e){return this.clone(l({},e=void 0===e?{}:e,{defaultToEN:!1}))},e.months=function(r,i){var o=this;return void 0===i&&(i=!1),Fe(this,r,Ft,function(){var e="ja"===o.intl||o.intl.startsWith("ja-"),t=(i&=!e)?{month:r,day:"numeric"}:{month:r},n=i?"format":"standalone";return o.monthsCache[n][r]||(o.monthsCache[n][r]=function(e){for(var t=[],n=1;n<=12;n++){var r=W.utc(2009,n,1);t.push(e(r))}return t}(e?function(e){return o.dtFormatter(e,t).format()}:function(e){return o.extract(e,t,"month")})),o.monthsCache[n][r]})},e.weekdays=function(n,r){var i=this;return void 0===r&&(r=!1),Fe(this,n,Lt,function(){var t=r?{weekday:n,year:"numeric",month:"long",day:"numeric"}:{weekday:n},e=r?"format":"standalone";return i.weekdaysCache[e][n]||(i.weekdaysCache[e][n]=function(e){for(var t=[],n=1;n<=7;n++){var r=W.utc(2016,11,13+n);t.push(e(r))}return t}(function(e){return i.extract(e,t,"weekday")})),i.weekdaysCache[e][n]})},e.meridiems=function(){var n=this;return Fe(this,void 0,function(){return jt},function(){var t;return n.meridiemCache||(t={hour:"numeric",hourCycle:"h12"},n.meridiemCache=[W.utc(2016,11,13,9),W.utc(2016,11,13,19)].map(function(e){return n.extract(e,t,"dayperiod")})),n.meridiemCache})},e.eras=function(e){var n=this;return Fe(this,e,_t,function(){var t={era:e};return n.eraCache[e]||(n.eraCache[e]=[W.utc(-40,1,1),W.utc(2017,1,1)].map(function(e){return n.extract(e,t,"era")})),n.eraCache[e]})},e.extract=function(e,t,n){e=this.dtFormatter(e,t).formatToParts().find(function(e){return e.type.toLowerCase()===n});return e?e.value:null},e.numberFormatter=function(e){return new Ce(this.intl,(e=void 0===e?{}:e).forceSimple||this.fastNumbers,e)},e.dtFormatter=function(e,t){return new Ze(e,this.intl,t=void 0===t?{}:t)},e.relFormatter=function(e){return void 0===e&&(e={}),new We(this.intl,this.isEnglish(),e)},e.listFormatter=function(e){return void 0===e&&(e={}),t=this.intl,void 0===(e=e)&&(e={}),n=JSON.stringify([t,e]),(r=Oe[n])||(r=new Intl.ListFormat(t,e),Oe[n]=r),r;var t,n,r},e.isEnglish=function(){return"en"===this.locale||"en-us"===this.locale.toLowerCase()||Ee(this.intl).locale.startsWith("en-us")},e.getWeekSettings=function(){return this.weekSettings||(dt()?(e=this.locale,(n=xe.get(e))||("minimalDays"in(n="getWeekInfo"in(t=new Intl.Locale(e))?t.getWeekInfo():t.weekInfo)||(n=l({},Le,n)),xe.set(e,n)),n):Le);var e,t,n},e.getStartOfWeek=function(){return this.getWeekSettings().firstDay},e.getMinDaysInFirstWeek=function(){return this.getWeekSettings().minimalDays},e.getWeekendDays=function(){return this.getWeekSettings().weekend},e.equals=function(e){return this.locale===e.locale&&this.numberingSystem===e.numberingSystem&&this.outputCalendar===e.outputCalendar},e.toString=function(){return"Locale("+this.locale+", "+this.numberingSystem+", "+this.outputCalendar+")"},i(o,[{key:"fastNumbers",get:function(){var e;return null==this.fastNumbersCached&&(this.fastNumbersCached=(!(e=this).numberingSystem||"latn"===e.numberingSystem)&&("latn"===e.numberingSystem||!e.locale||e.locale.startsWith("en")||"latn"===Ee(e.locale).numberingSystem)),this.fastNumbersCached}}]),o}(),je=null,f=function(n){function t(e){var t=n.call(this)||this;return t.fixed=e,t}o(t,n),t.instance=function(e){return 0===e?t.utcInstance:new t(e)},t.parseSpecifier=function(e){if(e){e=e.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);if(e)return new t(Tt(e[1],e[2]))}return null};var e=t.prototype;return e.offsetName=function(){return this.name},e.formatOffset=function(e,t){return Dt(this.fixed,t)},e.offset=function(){return this.fixed},e.equals=function(e){return"fixed"===e.type&&e.fixed===this.fixed},i(t,[{key:"type",get:function(){return"fixed"}},{key:"name",get:function(){return 0===this.fixed?"UTC":"UTC"+Dt(this.fixed,"narrow")}},{key:"ianaName",get:function(){return 0===this.fixed?"Etc/UTC":"Etc/GMT"+Dt(-this.fixed,"narrow")}},{key:"isUniversal",get:function(){return!0}},{key:"isValid",get:function(){return!0}}],[{key:"utcInstance",get:function(){return je=null===je?new t(0):je}}]),t}(s),ze=function(n){function e(e){var t=n.call(this)||this;return t.zoneName=e,t}o(e,n);var t=e.prototype;return t.offsetName=function(){return null},t.formatOffset=function(){return""},t.offset=function(){return NaN},t.equals=function(){return!1},i(e,[{key:"type",get:function(){return"invalid"}},{key:"name",get:function(){return this.zoneName}},{key:"isUniversal",get:function(){return!1}},{key:"isValid",get:function(){return!1}}]),e}(s);function S(e,t){var n;return N(e)||null===e?t:e instanceof s?e:"string"==typeof e?"default"===(n=e.toLowerCase())?t:"local"===n||"system"===n?ge.instance:"utc"===n||"gmt"===n?f.utcInstance:f.parseSpecifier(n)||c.create(e):v(e)?f.instance(e):"object"==typeof e&&"offset"in e&&"function"==typeof e.offset?e:new ze(e)}var Ae={arab:"[٠-٩]",arabext:"[۰-۹]",bali:"[᭐-᭙]",beng:"[০-৯]",deva:"[०-९]",fullwide:"[０-９]",gujr:"[૦-૯]",hanidec:"[〇|一|二|三|四|五|六|七|八|九]",khmr:"[០-៩]",knda:"[೦-೯]",laoo:"[໐-໙]",limb:"[᥆-᥏]",mlym:"[൦-൯]",mong:"[᠐-᠙]",mymr:"[၀-၉]",orya:"[୦-୯]",tamldec:"[௦-௯]",telu:"[౦-౯]",thai:"[๐-๙]",tibt:"[༠-༩]",latn:"\\d"},qe={arab:[1632,1641],arabext:[1776,1785],bali:[6992,7001],beng:[2534,2543],deva:[2406,2415],fullwide:[65296,65303],gujr:[2790,2799],khmr:[6112,6121],knda:[3302,3311],laoo:[3792,3801],limb:[6470,6479],mlym:[3430,3439],mong:[6160,6169],mymr:[4160,4169],orya:[2918,2927],tamldec:[3046,3055],telu:[3174,3183],thai:[3664,3673],tibt:[3872,3881]},_e=Ae.hanidec.replace(/[\[|\]]/g,"").split("");var Ue=new Map;function y(e,t){void 0===t&&(t="");var e=e.numberingSystem||"latn",n=Ue.get(e),r=(void 0===n&&(n=new Map,Ue.set(e,n)),n.get(t));return void 0===r&&(r=new RegExp(""+Ae[e]+t),n.set(t,r)),r}var Re,Pe=function(){return Date.now()},Ye="system",He=null,Je=null,Ge=null,$e=60,Be=null,O=function(){function e(){}return e.resetCaches=function(){b.resetCache(),c.resetCache(),W.resetCache(),Ue.clear()},i(e,null,[{key:"now",get:function(){return Pe},set:function(e){Pe=e}},{key:"defaultZone",get:function(){return S(Ye,ge.instance)},set:function(e){Ye=e}},{key:"defaultLocale",get:function(){return He},set:function(e){He=e}},{key:"defaultNumberingSystem",get:function(){return Je},set:function(e){Je=e}},{key:"defaultOutputCalendar",get:function(){return Ge},set:function(e){Ge=e}},{key:"defaultWeekSettings",get:function(){return Be},set:function(e){Be=mt(e)}},{key:"twoDigitCutoffYear",get:function(){return $e},set:function(e){$e=e%100}},{key:"throwOnInvalid",get:function(){return Re},set:function(e){Re=e}}]),e}(),d=function(){function e(e,t){this.reason=e,this.explanation=t}return e.prototype.toMessage=function(){return this.explanation?this.reason+": "+this.explanation:this.reason},e}(),Qe=[0,31,59,90,120,151,181,212,243,273,304,334],Ke=[0,31,60,91,121,152,182,213,244,274,305,335];function T(e,t){return new d("unit out of range","you specified "+t+" (of type "+typeof t+") as a "+e+", which is invalid")}function Xe(e,t,n){t=new Date(Date.UTC(e,t-1,n)),e<100&&0<=e&&t.setUTCFullYear(t.getUTCFullYear()-1900),n=t.getUTCDay();return 0===n?7:n}function et(e,t,n){return n+(gt(e)?Ke:Qe)[t-1]}function tt(e,t){var e=gt(e)?Ke:Qe,n=e.findIndex(function(e){return e<t});return{month:n+1,day:t-e[n]}}function nt(e,t){return(e-t+7)%7+1}function rt(e,t,n){void 0===t&&(t=4),void 0===n&&(n=1);var r,i=e.year,o=e.month,a=e.day,s=et(i,o,a),o=nt(Xe(i,o,a),n),a=Math.floor((s-o+14-t)/7);return a<1?a=bt(r=i-1,t,n):a>bt(i,t,n)?(r=i+1,a=1):r=i,l({weekYear:r,weekNumber:a,weekday:o},It(e))}function it(e,t,n){void 0===n&&(n=1);var r,i=e.weekYear,o=e.weekNumber,a=e.weekday,n=nt(Xe(i,1,t=void 0===t?4:t),n),s=D(i),o=7*o+a-n-7+t,a=(o<1?o+=D(r=i-1):s<o?(r=i+1,o-=D(i)):r=i,tt(r,o));return l({year:r,month:a.month,day:a.day},It(e))}function ot(e){var t=e.year;return l({year:t,ordinal:et(t,e.month,e.day)},It(e))}function at(e){var t=e.year,n=tt(t,e.ordinal);return l({year:t,month:n.month,day:n.day},It(e))}function st(e,t){if(N(e.localWeekday)&&N(e.localWeekNumber)&&N(e.localWeekYear))return{minDaysInFirstWeek:4,startOfWeek:1};if(N(e.weekday)&&N(e.weekNumber)&&N(e.weekYear))return N(e.localWeekday)||(e.weekday=e.localWeekday),N(e.localWeekNumber)||(e.weekNumber=e.localWeekNumber),N(e.localWeekYear)||(e.weekYear=e.localWeekYear),delete e.localWeekday,delete e.localWeekNumber,delete e.localWeekYear,{minDaysInFirstWeek:t.getMinDaysInFirstWeek(),startOfWeek:t.getStartOfWeek()};throw new w("Cannot mix locale-based week fields with ISO-based week fields")}function ut(e){var t=ct(e.year),n=M(e.month,1,12),r=M(e.day,1,pt(e.year,e.month));return t?n?!r&&T("day",e.day):T("month",e.month):T("year",e.year)}function lt(e){var t=e.hour,n=e.minute,r=e.second,e=e.millisecond,i=M(t,0,23)||24===t&&0===n&&0===r&&0===e,o=M(n,0,59),a=M(r,0,59),s=M(e,0,999);return i?o?a?!s&&T("millisecond",e):T("second",r):T("minute",n):T("hour",t)}function N(e){return void 0===e}function v(e){return"number"==typeof e}function ct(e){return"number"==typeof e&&e%1==0}function ft(){try{return"undefined"!=typeof Intl&&!!Intl.RelativeTimeFormat}catch(e){return!1}}function dt(){try{return"undefined"!=typeof Intl&&!!Intl.Locale&&("weekInfo"in Intl.Locale.prototype||"getWeekInfo"in Intl.Locale.prototype)}catch(e){return!1}}function ht(e,n,r){if(0!==e.length)return e.reduce(function(e,t){t=[n(t),t];return e&&r(e[0],t[0])===e[0]?e:t},null)[1]}function h(e,t){return Object.prototype.hasOwnProperty.call(e,t)}function mt(e){if(null==e)return null;if("object"!=typeof e)throw new u("Week settings must be an object");if(M(e.firstDay,1,7)&&M(e.minimalDays,1,7)&&Array.isArray(e.weekend)&&!e.weekend.some(function(e){return!M(e,1,7)}))return{firstDay:e.firstDay,minimalDays:e.minimalDays,weekend:Array.from(e.weekend)};throw new u("Invalid week settings")}function M(e,t,n){return ct(e)&&t<=e&&e<=n}function m(e,t){void 0===t&&(t=2);e=e<0?"-"+(""+-e).padStart(t,"0"):(""+e).padStart(t,"0");return e}function g(e){if(!N(e)&&null!==e&&""!==e)return parseInt(e,10)}function p(e){if(!N(e)&&null!==e&&""!==e)return parseFloat(e)}function yt(e){if(!N(e)&&null!==e&&""!==e)return e=1e3*parseFloat("0."+e),Math.floor(e)}function vt(e,t,n){void 0===n&&(n="round");var r=Math.pow(10,t);switch(n){case"expand":return 0<e?Math.ceil(e*r)/r:Math.floor(e*r)/r;case"trunc":return Math.trunc(e*r)/r;case"round":return Math.round(e*r)/r;case"floor":return Math.floor(e*r)/r;case"ceil":return Math.ceil(e*r)/r;default:throw new RangeError("Value rounding "+n+" is out of range")}}function gt(e){return e%4==0&&(e%100!=0||e%400==0)}function D(e){return gt(e)?366:365}function pt(e,t){var n,r=(r=t-1)-(n=12)*Math.floor(r/n)+1;return 2==r?gt(e+(t-r)/12)?29:28:[31,null,31,30,31,30,31,31,30,31,30,31][r-1]}function kt(e){var t=Date.UTC(e.year,e.month-1,e.day,e.hour,e.minute,e.second,e.millisecond);return e.year<100&&0<=e.year&&(t=new Date(t)).setUTCFullYear(e.year,e.month-1,e.day),+t}function wt(e,t,n){return-nt(Xe(e,1,t),n)+t-1}function bt(e,t,n){var r=wt(e,t=void 0===t?4:t,n=void 0===n?1:n),t=wt(e+1,t,n);return(D(e)-r+t)/7}function St(e){return 99<e?e:e>O.twoDigitCutoffYear?1900+e:2e3+e}function Ot(e,t,n,r){void 0===r&&(r=null);var e=new Date(e),i={hourCycle:"h23",year:"numeric",month:"2-digit",day:"2-digit",hour:"2-digit",minute:"2-digit"},r=(r&&(i.timeZone=r),l({timeZoneName:t},i)),t=new Intl.DateTimeFormat(n,r).formatToParts(e).find(function(e){return"timezonename"===e.type.toLowerCase()});return t?t.value:null}function Tt(e,t){e=parseInt(e,10),Number.isNaN(e)&&(e=0),t=parseInt(t,10)||0;return 60*e+(e<0||Object.is(e,-0)?-t:t)}function Nt(e){var t=Number(e);if("boolean"!=typeof e&&""!==e&&Number.isFinite(t))return t;throw new u("Invalid unit value "+e)}function Mt(e,t){var n,r,i={};for(n in e)h(e,n)&&null!=(r=e[n])&&(i[t(n)]=Nt(r));return i}function Dt(e,t){var n=Math.trunc(Math.abs(e/60)),r=Math.trunc(Math.abs(e%60)),i=0<=e?"+":"-";switch(t){case"short":return i+m(n,2)+":"+m(r,2);case"narrow":return i+n+(0<r?":"+r:"");case"techie":return i+m(n,2)+m(r,2);default:throw new RangeError("Value format "+t+" is out of range for property format")}}function It(e){return n=e,["hour","minute","second","millisecond"].reduce(function(e,t){return e[t]=n[t],e},{});var n}var Vt=["January","February","March","April","May","June","July","August","September","October","November","December"],Et=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"],xt=["J","F","M","A","M","J","J","A","S","O","N","D"];function Ft(e){switch(e){case"narrow":return[].concat(xt);case"short":return[].concat(Et);case"long":return[].concat(Vt);case"numeric":return["1","2","3","4","5","6","7","8","9","10","11","12"];case"2-digit":return["01","02","03","04","05","06","07","08","09","10","11","12"];default:return null}}var Ct=["Monday","Tuesday","Wednesday","Thursday","Friday","Saturday","Sunday"],Zt=["Mon","Tue","Wed","Thu","Fri","Sat","Sun"],Wt=["M","T","W","T","F","S","S"];function Lt(e){switch(e){case"narrow":return[].concat(Wt);case"short":return[].concat(Zt);case"long":return[].concat(Ct);case"numeric":return["1","2","3","4","5","6","7"];default:return null}}var jt=["AM","PM"],zt=["Before Christ","Anno Domini"],At=["BC","AD"],qt=["B","A"];function _t(e){switch(e){case"narrow":return[].concat(qt);case"short":return[].concat(At);case"long":return[].concat(zt);default:return null}}function Ut(e,t){for(var n="",r=R(e);!(i=r()).done;){var i=i.value;i.literal?n+=i.val:n+=t(i.val)}return n}var Rt={D:G,DD:$,DDD:Q,DDDD:K,t:X,tt:ee,ttt:te,tttt:ne,T:re,TT:ie,TTT:oe,TTTT:ae,f:se,ff:le,fff:de,ffff:me,F:ue,FF:ce,FFF:he,FFFF:ye},I=function(){function d(e,t){this.opts=t,this.loc=e,this.systemLoc=null}d.create=function(e,t){return new d(e,t=void 0===t?{}:t)},d.parseFormat=function(e){for(var t=null,n="",r=!1,i=[],o=0;o<e.length;o++){var a=e.charAt(o);"'"===a?((0<n.length||r)&&i.push({literal:r||/^\s+$/.test(n),val:""===n?"'":n}),t=null,n="",r=!r):r||a===t?n+=a:(0<n.length&&i.push({literal:/^\s+$/.test(n),val:n}),t=n=a)}return 0<n.length&&i.push({literal:r||/^\s+$/.test(n),val:n}),i},d.macroTokenToFormatOpts=function(e){return Rt[e]};var e=d.prototype;return e.formatWithSystemDefault=function(e,t){return null===this.systemLoc&&(this.systemLoc=this.loc.redefaultToSystem()),this.systemLoc.dtFormatter(e,l({},this.opts,t)).format()},e.dtFormatter=function(e,t){return this.loc.dtFormatter(e,l({},this.opts,t=void 0===t?{}:t))},e.formatDateTime=function(e,t){return this.dtFormatter(e,t).format()},e.formatDateTimeParts=function(e,t){return this.dtFormatter(e,t).formatToParts()},e.formatInterval=function(e,t){return this.dtFormatter(e.start,t).dtf.formatRange(e.start.toJSDate(),e.end.toJSDate())},e.resolvedOptions=function(e,t){return this.dtFormatter(e,t).resolvedOptions()},e.num=function(e,t,n){var r;return void 0===t&&(t=0),void 0===n&&(n=void 0),this.opts.forceSimple?m(e,t):(r=l({},this.opts),0<t&&(r.padTo=t),n&&(r.signDisplay=n),this.loc.numberFormatter(r).format(e))},e.formatDateTimeFromString=function(r,e){var n=this,i="en"===this.loc.listingMode(),t=this.loc.outputCalendar&&"gregory"!==this.loc.outputCalendar,o=function(e,t){return n.loc.extract(r,e,t)},a=function(e){return r.isOffsetFixed&&0===r.offset&&e.allowZ?"Z":r.isValid?r.zone.formatOffset(r.ts,e.format):""},s=function(){return i?jt[r.hour<12?0:1]:o({hour:"numeric",hourCycle:"h12"},"dayperiod")},u=function(e,t){return i?(n=r,Ft(e)[n.month-1]):o(t?{month:e}:{month:e,day:"numeric"},"month");var n},l=function(e,t){return i?(n=r,Lt(e)[n.weekday-1]):o(t?{weekday:e}:{weekday:e,month:"long",day:"numeric"},"weekday");var n},c=function(e){var t=d.macroTokenToFormatOpts(e);return t?n.formatWithSystemDefault(r,t):e},f=function(e){return i?(t=r,_t(e)[t.year<0?0:1]):o({era:e},"era");var t};return Ut(d.parseFormat(e),function(e){switch(e){case"S":return n.num(r.millisecond);case"u":case"SSS":return n.num(r.millisecond,3);case"s":return n.num(r.second);case"ss":return n.num(r.second,2);case"uu":return n.num(Math.floor(r.millisecond/10),2);case"uuu":return n.num(Math.floor(r.millisecond/100));case"m":return n.num(r.minute);case"mm":return n.num(r.minute,2);case"h":return n.num(r.hour%12==0?12:r.hour%12);case"hh":return n.num(r.hour%12==0?12:r.hour%12,2);case"H":return n.num(r.hour);case"HH":return n.num(r.hour,2);case"Z":return a({format:"narrow",allowZ:n.opts.allowZ});case"ZZ":return a({format:"short",allowZ:n.opts.allowZ});case"ZZZ":return a({format:"techie",allowZ:n.opts.allowZ});case"ZZZZ":return r.zone.offsetName(r.ts,{format:"short",locale:n.loc.locale});case"ZZZZZ":return r.zone.offsetName(r.ts,{format:"long",locale:n.loc.locale});case"z":return r.zoneName;case"a":return s();case"d":return t?o({day:"numeric"},"day"):n.num(r.day);case"dd":return t?o({day:"2-digit"},"day"):n.num(r.day,2);case"c":return n.num(r.weekday);case"ccc":return l("short",!0);case"cccc":return l("long",!0);case"ccccc":return l("narrow",!0);case"E":return n.num(r.weekday);case"EEE":return l("short",!1);case"EEEE":return l("long",!1);case"EEEEE":return l("narrow",!1);case"L":return t?o({month:"numeric",day:"numeric"},"month"):n.num(r.month);case"LL":return t?o({month:"2-digit",day:"numeric"},"month"):n.num(r.month,2);case"LLL":return u("short",!0);case"LLLL":return u("long",!0);case"LLLLL":return u("narrow",!0);case"M":return t?o({month:"numeric"},"month"):n.num(r.month);case"MM":return t?o({month:"2-digit"},"month"):n.num(r.month,2);case"MMM":return u("short",!1);case"MMMM":return u("long",!1);case"MMMMM":return u("narrow",!1);case"y":return t?o({year:"numeric"},"year"):n.num(r.year);case"yy":return t?o({year:"2-digit"},"year"):n.num(r.year.toString().slice(-2),2);case"yyyy":return t?o({year:"numeric"},"year"):n.num(r.year,4);case"yyyyyy":return t?o({year:"numeric"},"year"):n.num(r.year,6);case"G":return f("short");case"GG":return f("long");case"GGGGG":return f("narrow");case"kk":return n.num(r.weekYear.toString().slice(-2),2);case"kkkk":return n.num(r.weekYear,4);case"W":return n.num(r.weekNumber);case"WW":return n.num(r.weekNumber,2);case"n":return n.num(r.localWeekNumber);case"nn":return n.num(r.localWeekNumber,2);case"ii":return n.num(r.localWeekYear.toString().slice(-2),2);case"iiii":return n.num(r.localWeekYear,4);case"o":return n.num(r.ordinal);case"ooo":return n.num(r.ordinal,3);case"q":return n.num(r.quarter);case"qq":return n.num(r.quarter,2);case"X":return n.num(Math.floor(r.ts/1e3));case"x":return n.num(r.ts);default:return c(e)}})},e.formatDurationFromString=function(e,t){var i,o,a=this,s="negativeLargestOnly"===this.opts.signMode?-1:1,u=function(e){switch(e[0]){case"S":return"milliseconds";case"s":return"seconds";case"m":return"minutes";case"h":return"hours";case"d":return"days";case"w":return"weeks";case"M":return"months";case"y":return"years";default:return null}},t=d.parseFormat(t),n=t.reduce(function(e,t){var n=t.literal,t=t.val;return n?e:e.concat(t)},[]),e=e.shiftTo.apply(e,n.map(u).filter(function(e){return e})),n={isNegativeDuration:e<0,largestUnit:Object.keys(e.values)[0]};return Ut(t,(i=e,o=n,function(e){var t,n,r=u(e);return r?(t=o.isNegativeDuration&&r!==o.largestUnit?s:1,n="negativeLargestOnly"===a.opts.signMode&&r!==o.largestUnit?"never":"all"===a.opts.signMode?"always":"auto",a.num(i.get(r)*t,e.length,n)):e}))},d}(),r=/[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;function Pt(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];var r=t.reduce(function(e,t){return e+t.source},"");return RegExp("^"+r+"$")}function Yt(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];return function(o){return t.reduce(function(e,t){var n=e[0],r=e[1],e=e[2],t=t(o,e),e=t[0],i=t[1],t=t[2];return[l({},n,e),i||r,t]},[{},null,1]).slice(0,2)}}function Ht(e){if(null!=e){for(var t=arguments.length,n=new Array(1<t?t-1:0),r=1;r<t;r++)n[r-1]=arguments[r];for(var i=0,o=n;i<o.length;i++){var a=o[i],s=a[0],a=a[1],s=s.exec(e);if(s)return a(s)}}return[null,null]}function Jt(){for(var e=arguments.length,i=new Array(e),t=0;t<e;t++)i[t]=arguments[t];return function(e,t){for(var n={},r=0;r<i.length;r++)n[i[r]]=g(e[t+r]);return[n,null,t+r]}}var t=/(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/,a=/(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/,Gt=RegExp(a.source+("(?:"+t.source+"?(?:\\[("+r.source+")\\])?)?")),k=RegExp("(?:[Tt]"+Gt.source+")?"),$t=Jt("weekYear","weekNumber","weekDay"),Bt=Jt("year","ordinal"),t=RegExp(a.source+" ?(?:"+t.source+"|("+r.source+"))?"),r=RegExp("(?: "+t.source+")?");function Qt(e,t,n){e=e[t];return N(e)?n:g(e)}function Kt(e,t){return[{hours:Qt(e,t,0),minutes:Qt(e,t+1,0),seconds:Qt(e,t+2,0),milliseconds:yt(e[t+3])},null,t+4]}function Xt(e,t){var n=!e[t]&&!e[t+1],e=Tt(e[t+1],e[t+2]);return[{},n?null:f.instance(e),t+3]}function en(e,t){return[{},e[t]?c.create(e[t]):null,t+1]}var tn=RegExp("^T?"+a.source+"$"),nn=/^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;function rn(e){function t(e,t){return void 0===t&&(t=!1),void 0!==e&&(t||e&&c)?-e:e}var n=e[0],r=e[1],i=e[2],o=e[3],a=e[4],s=e[5],u=e[6],l=e[7],e=e[8],c="-"===n[0],n=l&&"-"===l[0];return[{years:t(p(r)),months:t(p(i)),weeks:t(p(o)),days:t(p(a)),hours:t(p(s)),minutes:t(p(u)),seconds:t(p(l),"-0"===l),milliseconds:t(yt(e),n)}]}var on={GMT:0,EDT:-240,EST:-300,CDT:-300,CST:-360,MDT:-360,MST:-420,PDT:-420,PST:-480};function an(e,t,n,r,i,o,a){t={year:2===t.length?St(g(t)):g(t),month:Et.indexOf(n)+1,day:g(r),hour:g(i),minute:g(o)};return a&&(t.second=g(a)),e&&(t.weekday=3<e.length?Ct.indexOf(e)+1:Zt.indexOf(e)+1),t}var sn=/^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;function un(e){var t=e[1],n=e[2],r=e[3],i=e[4],o=e[5],a=e[6],s=e[7],u=e[8],l=e[9],c=e[10],e=e[11],t=an(t,i,r,n,o,a,s),i=u?on[u]:l?0:Tt(c,e);return[t,new f(i)]}var ln=/^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,cn=/^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,fn=/^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;function dn(e){var t=e[1],n=e[2],r=e[3];return[an(t,e[4],r,n,e[5],e[6],e[7]),f.utcInstance]}function hn(e){var t=e[1],n=e[2],r=e[3],i=e[4],o=e[5],a=e[6];return[an(t,e[7],n,r,i,o,a),f.utcInstance]}var mn=Pt(/([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/,k),yn=Pt(/(\d{4})-?W(\d\d)(?:-?(\d))?/,k),vn=Pt(/(\d{4})-?(\d{3})/,k),gn=Pt(Gt),pn=Yt(function(e,t){return[{year:Qt(e,t),month:Qt(e,t+1,1),day:Qt(e,t+2,1)},null,t+3]},Kt,Xt,en),kn=Yt($t,Kt,Xt,en),wn=Yt(Bt,Kt,Xt,en),bn=Yt(Kt,Xt,en);var Sn=Yt(Kt);var On=Pt(/(\d{4})-(\d\d)-(\d\d)/,r),Tn=Pt(t),Nn=Yt(Kt,Xt,en);var Mn="Invalid Duration",a={weeks:{days:7,hours:168,minutes:10080,seconds:604800,milliseconds:6048e5},days:{hours:24,minutes:1440,seconds:86400,milliseconds:864e5},hours:{minutes:60,seconds:3600,milliseconds:36e5},minutes:{seconds:60,milliseconds:6e4},seconds:{milliseconds:1e3}},Dn=l({years:{quarters:4,months:12,weeks:52,days:365,hours:8760,minutes:525600,seconds:31536e3,milliseconds:31536e6},quarters:{months:3,weeks:13,days:91,hours:2184,minutes:131040,seconds:7862400,milliseconds:78624e5},months:{weeks:4,days:30,hours:720,minutes:43200,seconds:2592e3,milliseconds:2592e6}},a),k=365.2425,Gt=30.436875,In=l({years:{quarters:4,months:12,weeks:k/7,days:k,hours:24*k,minutes:525949.2,seconds:525949.2*60,milliseconds:525949.2*60*1e3},quarters:{months:3,weeks:k/28,days:k/4,hours:24*k/4,minutes:131487.3,seconds:525949.2*60/4,milliseconds:7889237999.999999},months:{weeks:Gt/7,days:Gt,hours:24*Gt,minutes:43829.1,seconds:2629746,milliseconds:2629746e3}},a),V=["years","quarters","months","weeks","days","hours","minutes","seconds","milliseconds"],Vn=V.slice(0).reverse();function E(e,t,n){n={values:(n=void 0===n?!1:n)?t.values:l({},e.values,t.values||{}),loc:e.loc.clone(t.loc),conversionAccuracy:t.conversionAccuracy||e.conversionAccuracy,matrix:t.matrix||e.matrix};return new x(n)}function En(e,t){for(var n,r=null!=(n=t.milliseconds)?n:0,i=R(Vn.slice(1));!(o=i()).done;){var o=o.value;t[o]&&(r+=t[o]*e[o].milliseconds)}return r}function xn(i,o){var a=En(i,o)<0?-1:1;V.reduceRight(function(e,t){var n,r;return N(o[t])?e:(e&&(r=o[e]*a,n=i[t][e],r=Math.floor(r/n),o[t]+=r*a,o[e]-=r*n*a),t)},null),V.reduce(function(e,t){var n;return N(o[t])?e:(e&&(n=o[e]%1,o[e]-=n,o[t]+=n*i[e][t]),t)},null)}function Fn(e){for(var t={},n=0,r=Object.entries(e);n<r.length;n++){var i=r[n],o=i[0],i=i[1];0!==i&&(t[o]=i)}return t}var x=function(e){function m(e){var t="longterm"===e.conversionAccuracy||!1,n=t?In:Dn;e.matrix&&(n=e.matrix),this.values=e.values,this.loc=e.loc||b.create(),this.conversionAccuracy=t?"longterm":"casual",this.invalid=e.invalid||null,this.matrix=n,this.isLuxonDuration=!0}m.fromMillis=function(e,t){return m.fromObject({milliseconds:e},t)},m.fromObject=function(e,t){if(void 0===t&&(t={}),null==e||"object"!=typeof e)throw new u("Duration.fromObject: argument expected to be an object, got "+(null===e?"null":typeof e));return new m({values:Mt(e,m.normalizeUnit),loc:b.fromObject(t),conversionAccuracy:t.conversionAccuracy,matrix:t.matrix})},m.fromDurationLike=function(e){if(v(e))return m.fromMillis(e);if(m.isDuration(e))return e;if("object"==typeof e)return m.fromObject(e);throw new u("Unknown duration argument "+e+" of type "+typeof e)},m.fromISO=function(e,t){var n=Ht(e,[nn,rn])[0];return n?m.fromObject(n,t):m.invalid("unparsable",'the input "'+e+"\" can't be parsed as ISO 8601")},m.fromISOTime=function(e,t){var n=Ht(e,[tn,Sn])[0];return n?m.fromObject(n,t):m.invalid("unparsable",'the input "'+e+"\" can't be parsed as ISO 8601")},m.invalid=function(e,t){if(void 0===t&&(t=null),!e)throw new u("need to specify a reason the Duration is invalid");e=e instanceof d?e:new d(e,t);if(O.throwOnInvalid)throw new H(e);return new m({invalid:e})},m.normalizeUnit=function(e){var t={year:"years",years:"years",quarter:"quarters",quarters:"quarters",month:"months",months:"months",week:"weeks",weeks:"weeks",day:"days",days:"days",hour:"hours",hours:"hours",minute:"minutes",minutes:"minutes",second:"seconds",seconds:"seconds",millisecond:"milliseconds",milliseconds:"milliseconds"}[e&&e.toLowerCase()];if(t)return t;throw new J(e)},m.isDuration=function(e){return e&&e.isLuxonDuration||!1};var t=m.prototype;return t.toFormat=function(e,t){t=l({},t=void 0===t?{}:t,{floor:!1!==t.round&&!1!==t.floor});return this.isValid?I.create(this.loc,t).formatDurationFromString(this,e):Mn},t.toHuman=function(n){var r,e,i=this;return void 0===n&&(n={}),this.isValid?(r=!1!==n.showZeros,e=V.map(function(e){var t=i.values[e];return N(t)||0===t&&!r?null:i.loc.numberFormatter(l({style:"unit",unitDisplay:"long"},n,{unit:e.slice(0,-1)})).format(t)}).filter(function(e){return e}),this.loc.listFormatter(l({type:"conjunction",style:n.listStyle||"narrow"},n)).format(e)):Mn},t.toObject=function(){return this.isValid?l({},this.values):{}},t.toISO=function(){var e;return this.isValid?(e="P",0!==this.years&&(e+=this.years+"Y"),0===this.months&&0===this.quarters||(e+=this.months+3*this.quarters+"M"),0!==this.weeks&&(e+=this.weeks+"W"),0!==this.days&&(e+=this.days+"D"),0===this.hours&&0===this.minutes&&0===this.seconds&&0===this.milliseconds||(e+="T"),0!==this.hours&&(e+=this.hours+"H"),0!==this.minutes&&(e+=this.minutes+"M"),0===this.seconds&&0===this.milliseconds||(e+=vt(this.seconds+this.milliseconds/1e3,3)+"S"),"P"===e&&(e+="T0S"),e):null},t.toISOTime=function(e){var t;return void 0===e&&(e={}),!this.isValid||(t=this.toMillis())<0||864e5<=t?null:(e=l({suppressMilliseconds:!1,suppressSeconds:!1,includePrefix:!1,format:"extended"},e,{includeOffset:!1}),W.fromMillis(t,{zone:"UTC"}).toISOTime(e))},t.toJSON=function(){return this.toISO()},t.toString=function(){return this.toISO()},t[e]=function(){return this.isValid?"Duration { values: "+JSON.stringify(this.values)+" }":"Duration { Invalid, reason: "+this.invalidReason+" }"},t.toMillis=function(){return this.isValid?En(this.matrix,this.values):NaN},t.valueOf=function(){return this.toMillis()},t.plus=function(e){if(!this.isValid)return this;for(var t=m.fromDurationLike(e),n={},r=0,i=V;r<i.length;r++){var o=i[r];(h(t.values,o)||h(this.values,o))&&(n[o]=t.get(o)+this.get(o))}return E(this,{values:n},!0)},t.minus=function(e){return this.isValid?(e=m.fromDurationLike(e),this.plus(e.negate())):this},t.mapUnits=function(e){if(!this.isValid)return this;for(var t={},n=0,r=Object.keys(this.values);n<r.length;n++){var i=r[n];t[i]=Nt(e(this.values[i],i))}return E(this,{values:t},!0)},t.get=function(e){return this[m.normalizeUnit(e)]},t.set=function(e){return this.isValid?E(this,{values:l({},this.values,Mt(e,m.normalizeUnit))}):this},t.reconfigure=function(e){var e=void 0===e?{}:e,t=e.locale,n=e.numberingSystem,r=e.conversionAccuracy,e=e.matrix,t=this.loc.clone({locale:t,numberingSystem:n});return E(this,{loc:t,matrix:e,conversionAccuracy:r})},t.as=function(e){return this.isValid?this.shiftTo(e).get(e):NaN},t.normalize=function(){var e;return this.isValid?(e=this.toObject(),xn(this.matrix,e),E(this,{values:e},!0)):this},t.rescale=function(){var e;return this.isValid?(e=Fn(this.normalize().shiftToAll().toObject()),E(this,{values:e},!0)):this},t.shiftTo=function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];if(!this.isValid)return this;if(0===t.length)return this;for(var r,t=t.map(function(e){return m.normalizeUnit(e)}),i={},o={},a=this.toObject(),s=0,u=V;s<u.length;s++){var l=u[s];if(0<=t.indexOf(l)){var c,f=l,d=0;for(c in o)d+=this.matrix[c][l]*o[c],o[c]=0;v(a[l])&&(d+=a[l]);var h=Math.trunc(d);o[l]=(1e3*d-1e3*(i[l]=h))/1e3}else v(a[l])&&(o[l]=a[l])}for(r in o)0!==o[r]&&(i[f]+=r===f?o[r]:o[r]/this.matrix[f][r]);return xn(this.matrix,i),E(this,{values:i},!0)},t.shiftToAll=function(){return this.isValid?this.shiftTo("years","months","weeks","days","hours","minutes","seconds","milliseconds"):this},t.negate=function(){if(!this.isValid)return this;for(var e={},t=0,n=Object.keys(this.values);t<n.length;t++){var r=n[t];e[r]=0===this.values[r]?0:-this.values[r]}return E(this,{values:e},!0)},t.removeZeros=function(){return this.isValid?E(this,{values:Fn(this.values)},!0):this},t.equals=function(e){if(!this.isValid||!e.isValid)return!1;if(!this.loc.equals(e.loc))return!1;for(var t,n=0,r=V;n<r.length;n++){var i=r[n];if(t=this.values[i],i=e.values[i],!(void 0===t||0===t?void 0===i||0===i:t===i))return!1}return!0},i(m,[{key:"locale",get:function(){return this.isValid?this.loc.locale:null}},{key:"numberingSystem",get:function(){return this.isValid?this.loc.numberingSystem:null}},{key:"years",get:function(){return this.isValid?this.values.years||0:NaN}},{key:"quarters",get:function(){return this.isValid?this.values.quarters||0:NaN}},{key:"months",get:function(){return this.isValid?this.values.months||0:NaN}},{key:"weeks",get:function(){return this.isValid?this.values.weeks||0:NaN}},{key:"days",get:function(){return this.isValid?this.values.days||0:NaN}},{key:"hours",get:function(){return this.isValid?this.values.hours||0:NaN}},{key:"minutes",get:function(){return this.isValid?this.values.minutes||0:NaN}},{key:"seconds",get:function(){return this.isValid?this.values.seconds||0:NaN}},{key:"milliseconds",get:function(){return this.isValid?this.values.milliseconds||0:NaN}},{key:"isValid",get:function(){return null===this.invalid}},{key:"invalidReason",get:function(){return this.invalid?this.invalid.reason:null}},{key:"invalidExplanation",get:function(){return this.invalid?this.invalid.explanation:null}}]),m}(Symbol.for("nodejs.util.inspect.custom")),Cn="Invalid Interval";var Zn=function(e){function l(e){this.s=e.start,this.e=e.end,this.invalid=e.invalid||null,this.isLuxonInterval=!0}l.invalid=function(e,t){if(void 0===t&&(t=null),!e)throw new u("need to specify a reason the Interval is invalid");e=e instanceof d?e:new d(e,t);if(O.throwOnInvalid)throw new Y(e);return new l({invalid:e})},l.fromDateTimes=function(e,t){var n,e=Or(e),t=Or(t),r=(n=t,(r=e)&&r.isValid?n&&n.isValid?n<r?Zn.invalid("end before start","The end of an interval must be after its start, but you had start="+r.toISO()+" and end="+n.toISO()):null:Zn.invalid("missing or invalid end"):Zn.invalid("missing or invalid start"));return null==r?new l({start:e,end:t}):r},l.after=function(e,t){t=x.fromDurationLike(t),e=Or(e);return l.fromDateTimes(e,e.plus(t))},l.before=function(e,t){t=x.fromDurationLike(t),e=Or(e);return l.fromDateTimes(e.minus(t),e)},l.fromISO=function(e,t){var n,r,i,o=(e||"").split("/",2),a=o[0],s=o[1];if(a&&s){try{u=(n=W.fromISO(a,t)).isValid}catch(s){u=!1}try{i=(r=W.fromISO(s,t)).isValid}catch(s){i=!1}if(u&&i)return l.fromDateTimes(n,r);if(u){o=x.fromISO(s,t);if(o.isValid)return l.after(n,o)}else if(i){var u=x.fromISO(a,t);if(u.isValid)return l.before(r,u)}}return l.invalid("unparsable",'the input "'+e+"\" can't be parsed as ISO 8601")},l.isInterval=function(e){return e&&e.isLuxonInterval||!1};var t=l.prototype;return t.length=function(e){return void 0===e&&(e="milliseconds"),this.isValid?this.toDuration.apply(this,[e]).get(e):NaN},t.count=function(e,t){var n,r;return this.isValid?(n=this.start.startOf(e=void 0===e?"milliseconds":e,t),r=(r=null!=t&&t.useLocaleWeeks?this.end.reconfigure({locale:n.locale}):this.end).startOf(e,t),Math.floor(r.diff(n,e).get(e))+(r.valueOf()!==this.end.valueOf())):NaN},t.hasSame=function(e){return!!this.isValid&&(this.isEmpty()||this.e.minus(1).hasSame(this.s,e))},t.isEmpty=function(){return this.s.valueOf()===this.e.valueOf()},t.isAfter=function(e){return!!this.isValid&&this.s>e},t.isBefore=function(e){return!!this.isValid&&this.e<=e},t.contains=function(e){return!!this.isValid&&this.s<=e&&this.e>e},t.set=function(e){var e=void 0===e?{}:e,t=e.start,e=e.end;return this.isValid?l.fromDateTimes(t||this.s,e||this.e):this},t.splitAt=function(){var t=this;if(!this.isValid)return[];for(var e=arguments.length,n=new Array(e),r=0;r<e;r++)n[r]=arguments[r];for(var i=n.map(Or).filter(function(e){return t.contains(e)}).sort(function(e,t){return e.toMillis()-t.toMillis()}),o=[],a=this.s,s=0;a<this.e;){var u=i[s]||this.e,u=+u>+this.e?this.e:u;o.push(l.fromDateTimes(a,u)),a=u,s+=1}return o},t.splitBy=function(e){var t=x.fromDurationLike(e);if(!this.isValid||!t.isValid||0===t.as("milliseconds"))return[];for(var n=this.s,r=1,i=[];n<this.e;){var o=this.start.plus(t.mapUnits(function(e){return e*r})),o=+o>+this.e?this.e:o;i.push(l.fromDateTimes(n,o)),n=o,r+=1}return i},t.divideEqually=function(e){return this.isValid?this.splitBy(this.length()/e).slice(0,e):[]},t.overlaps=function(e){return this.e>e.s&&this.s<e.e},t.abutsStart=function(e){return!!this.isValid&&+this.e==+e.s},t.abutsEnd=function(e){return!!this.isValid&&+e.e==+this.s},t.engulfs=function(e){return!!this.isValid&&this.s<=e.s&&this.e>=e.e},t.equals=function(e){return!(!this.isValid||!e.isValid)&&this.s.equals(e.s)&&this.e.equals(e.e)},t.intersection=function(e){var t;return this.isValid?(t=(this.s>e.s?this:e).s,(e=(this.e<e.e?this:e).e)<=t?null:l.fromDateTimes(t,e)):this},t.union=function(e){var t;return this.isValid?(t=(this.s<e.s?this:e).s,e=(this.e>e.e?this:e).e,l.fromDateTimes(t,e)):this},l.merge=function(e){var e=e.sort(function(e,t){return e.s-t.s}).reduce(function(e,t){var n=e[0],e=e[1];return e?e.overlaps(t)||e.abutsStart(t)?[n,e.union(t)]:[n.concat([e]),t]:[n,t]},[[],null]),t=e[0],e=e[1];return e&&t.push(e),t},l.xor=function(e){for(var t,n=null,r=0,i=[],e=e.map(function(e){return[{time:e.s,type:"s"},{time:e.e,type:"e"}]}),o=R((t=Array.prototype).concat.apply(t,e).sort(function(e,t){return e.time-t.time}));!(a=o()).done;)var a=a.value,n=1===(r+="s"===a.type?1:-1)?a.time:(n&&+n!=+a.time&&i.push(l.fromDateTimes(n,a.time)),null);return l.merge(i)},t.difference=function(){for(var t=this,e=arguments.length,n=new Array(e),r=0;r<e;r++)n[r]=arguments[r];return l.xor([this].concat(n)).map(function(e){return t.intersection(e)}).filter(function(e){return e&&!e.isEmpty()})},t.toString=function(){return this.isValid?"["+this.s.toISO()+" – "+this.e.toISO()+")":Cn},t[e]=function(){return this.isValid?"Interval { start: "+this.s.toISO()+", end: "+this.e.toISO()+" }":"Interval { Invalid, reason: "+this.invalidReason+" }"},t.toLocaleString=function(e,t){return void 0===e&&(e=G),void 0===t&&(t={}),this.isValid?I.create(this.s.loc.clone(t),e).formatInterval(this):Cn},t.toISO=function(e){return this.isValid?this.s.toISO(e)+"/"+this.e.toISO(e):Cn},t.toISODate=function(){return this.isValid?this.s.toISODate()+"/"+this.e.toISODate():Cn},t.toISOTime=function(e){return this.isValid?this.s.toISOTime(e)+"/"+this.e.toISOTime(e):Cn},t.toFormat=function(e,t){t=(void 0===t?{}:t).separator,t=void 0===t?" – ":t;return this.isValid?""+this.s.toFormat(e)+t+this.e.toFormat(e):Cn},t.toDuration=function(e,t){return this.isValid?this.e.diff(this.s,e,t):x.invalid(this.invalidReason)},t.mapEndpoints=function(e){return l.fromDateTimes(e(this.s),e(this.e))},i(l,[{key:"start",get:function(){return this.isValid?this.s:null}},{key:"end",get:function(){return this.isValid?this.e:null}},{key:"lastDateTime",get:function(){return this.isValid&&this.e?this.e.minus(1):null}},{key:"isValid",get:function(){return null===this.invalidReason}},{key:"invalidReason",get:function(){return this.invalid?this.invalid.reason:null}},{key:"invalidExplanation",get:function(){return this.invalid?this.invalid.explanation:null}}]),l}(Symbol.for("nodejs.util.inspect.custom")),Wn=function(){function e(){}return e.hasDST=function(e){void 0===e&&(e=O.defaultZone);var t=W.now().setZone(e).set({month:12});return!e.isUniversal&&t.offset!==t.set({month:6}).offset},e.isValidIANAZone=function(e){return c.isValidZone(e)},e.normalizeZone=function(e){return S(e,O.defaultZone)},e.getStartOfWeek=function(e){var e=void 0===e?{}:e,t=e.locale,e=e.locObj;return((void 0===e?null:e)||b.create(void 0===t?null:t)).getStartOfWeek()},e.getMinimumDaysInFirstWeek=function(e){var e=void 0===e?{}:e,t=e.locale,e=e.locObj;return((void 0===e?null:e)||b.create(void 0===t?null:t)).getMinDaysInFirstWeek()},e.getWeekendWeekdays=function(e){var e=void 0===e?{}:e,t=e.locale,e=e.locObj;return((void 0===e?null:e)||b.create(void 0===t?null:t)).getWeekendDays().slice()},e.months=function(e,t){void 0===e&&(e="long");var t=void 0===t?{}:t,n=t.locale,r=t.numberingSystem,i=t.locObj,i=void 0===i?null:i,t=t.outputCalendar;return(i||b.create(void 0===n?null:n,void 0===r?null:r,void 0===t?"gregory":t)).months(e)},e.monthsFormat=function(e,t){void 0===e&&(e="long");var t=void 0===t?{}:t,n=t.locale,r=t.numberingSystem,i=t.locObj,i=void 0===i?null:i,t=t.outputCalendar;return(i||b.create(void 0===n?null:n,void 0===r?null:r,void 0===t?"gregory":t)).months(e,!0)},e.weekdays=function(e,t){void 0===e&&(e="long");var t=void 0===t?{}:t,n=t.locale,r=t.numberingSystem,t=t.locObj;return((void 0===t?null:t)||b.create(void 0===n?null:n,void 0===r?null:r,null)).weekdays(e)},e.weekdaysFormat=function(e,t){void 0===e&&(e="long");var t=void 0===t?{}:t,n=t.locale,r=t.numberingSystem,t=t.locObj;return((void 0===t?null:t)||b.create(void 0===n?null:n,void 0===r?null:r,null)).weekdays(e,!0)},e.meridiems=function(e){e=(void 0===e?{}:e).locale;return b.create(void 0===e?null:e).meridiems()},e.eras=function(e,t){void 0===e&&(e="short");t=(void 0===t?{}:t).locale;return b.create(void 0===t?null:t,null,"gregory").eras(e)},e.features=function(){return{relative:ft(),localeWeek:dt()}},e}();function Ln(e,t){function n(e){return e.toUTC(0,{keepLocalTime:!0}).startOf("day").valueOf()}t=n(t)-n(e);return Math.floor(x.fromMillis(t).as("days"))}function jn(e,t,n,r){var e=function(e,t,n){for(var r,i,o={},a=e,s=0,u=[["years",function(e,t){return t.year-e.year}],["quarters",function(e,t){return t.quarter-e.quarter+4*(t.year-e.year)}],["months",function(e,t){return t.month-e.month+12*(t.year-e.year)}],["weeks",function(e,t){e=Ln(e,t);return(e-e%7)/7}],["days",Ln]];s<u.length;s++){var l=u[s],c=l[0],l=l[1];0<=n.indexOf(c)&&(o[r=c]=l(e,t),t<(i=a.plus(o))?(o[c]--,t<(e=a.plus(o))&&(i=e,o[c]--,e=a.plus(o))):e=i)}return[e,o,i,r]}(e,t,n),i=e[0],o=e[1],a=e[2],e=e[3],s=t-i,n=n.filter(function(e){return 0<=["hours","minutes","seconds","milliseconds"].indexOf(e)}),t=(0===n.length&&(a=a<t?i.plus(((t={})[e]=1,t)):a)!==i&&(o[e]=(o[e]||0)+s/(a-i)),x.fromObject(o,r));return 0<n.length?(e=x.fromMillis(s,r)).shiftTo.apply(e,n).plus(t):t}var zn="missing Intl.DateTimeFormat.formatToParts support";function F(e,t){return void 0===t&&(t=function(e){return e}),{regex:e,deser:function(e){e=e[0];return t(function(e){var t=parseInt(e,10);if(isNaN(t)){for(var t="",n=0;n<e.length;n++){var r=e.charCodeAt(n);if(-1!==e[n].search(Ae.hanidec))t+=_e.indexOf(e[n]);else for(var i in qe){var i=qe[i],o=i[0],i=i[1];o<=r&&r<=i&&(t+=r-o)}}return parseInt(t,10)}return t}(e))}}}var An="[ "+String.fromCharCode(160)+"]",qn=new RegExp(An,"g");function _n(e){return e.replace(/\./g,"\\.?").replace(qn,An)}function Un(e){return e.replace(/\./g,"").replace(qn," ").toLowerCase()}function C(n,r){return null===n?null:{regex:RegExp(n.map(_n).join("|")),deser:function(e){var t=e[0];return n.findIndex(function(e){return Un(t)===Un(e)})+r}}}function Rn(e,t){return{regex:e,deser:function(e){return Tt(e[1],e[2])},groups:t}}function Pn(e){return{regex:e,deser:function(e){return e[0]}}}function Yn(t,n){function r(e){return{regex:RegExp(e.val.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g,"\\$&")),deser:function(e){return e[0]},literal:!0}}var i=y(n),o=y(n,"{2}"),a=y(n,"{3}"),s=y(n,"{4}"),u=y(n,"{6}"),l=y(n,"{1,2}"),c=y(n,"{1,3}"),f=y(n,"{1,6}"),d=y(n,"{1,9}"),h=y(n,"{2,4}"),m=y(n,"{4,6}"),e=function(e){if(t.literal)return r(e);switch(e.val){case"G":return C(n.eras("short"),0);case"GG":return C(n.eras("long"),0);case"y":return F(f);case"yy":return F(h,St);case"yyyy":return F(s);case"yyyyy":return F(m);case"yyyyyy":return F(u);case"M":return F(l);case"MM":return F(o);case"MMM":return C(n.months("short",!0),1);case"MMMM":return C(n.months("long",!0),1);case"L":return F(l);case"LL":return F(o);case"LLL":return C(n.months("short",!1),1);case"LLLL":return C(n.months("long",!1),1);case"d":return F(l);case"dd":return F(o);case"o":return F(c);case"ooo":return F(a);case"HH":return F(o);case"H":return F(l);case"hh":return F(o);case"h":return F(l);case"mm":return F(o);case"m":case"q":return F(l);case"qq":return F(o);case"s":return F(l);case"ss":return F(o);case"S":return F(c);case"SSS":return F(a);case"u":return Pn(d);case"uu":return Pn(l);case"uuu":return F(i);case"a":return C(n.meridiems(),0);case"kkkk":return F(s);case"kk":return F(h,St);case"W":return F(l);case"WW":return F(o);case"E":case"c":return F(i);case"EEE":return C(n.weekdays("short",!1),1);case"EEEE":return C(n.weekdays("long",!1),1);case"ccc":return C(n.weekdays("short",!0),1);case"cccc":return C(n.weekdays("long",!0),1);case"Z":case"ZZ":return Rn(new RegExp("([+-]"+l.source+")(?::("+o.source+"))?"),2);case"ZZZ":return Rn(new RegExp("([+-]"+l.source+")("+o.source+")?"),2);case"z":return Pn(/[a-z_+-/]{1,256}?/i);case" ":return Pn(/[^\S\n\r]/);default:return r(e)}}(t)||{invalidReason:zn};return e.token=t,e}var Hn={year:{"2-digit":"yy",numeric:"yyyyy"},month:{numeric:"M","2-digit":"MM",short:"MMM",long:"MMMM"},day:{numeric:"d","2-digit":"dd"},weekday:{short:"EEE",long:"EEEE"},dayperiod:"a",dayPeriod:"a",hour12:{numeric:"h","2-digit":"hh"},hour24:{numeric:"H","2-digit":"HH"},minute:{numeric:"m","2-digit":"mm"},second:{numeric:"s","2-digit":"ss"},timeZoneName:{long:"ZZZZZ",short:"ZZZ"}};var Jn=null;function Gn(e,n){var t;return(t=Array.prototype).concat.apply(t,e.map(function(e){return t=n,(e=e).literal||null==(t=Qn(I.macroTokenToFormatOpts(e.val),t))||t.includes(void 0)?e:t;var t}))}var $n=function(){function e(t,e){var n;this.locale=t,this.format=e,this.tokens=Gn(I.parseFormat(e),t),this.units=this.tokens.map(function(e){return Yn(e,t)}),this.disqualifyingUnit=this.units.find(function(e){return e.invalidReason}),this.disqualifyingUnit||(n=(e=["^"+(e=this.units).map(function(e){return e.regex}).reduce(function(e,t){return e+"("+t.source+")"},"")+"$",e])[1],this.regex=RegExp(e[0],"i"),this.handlers=n)}return e.prototype.explainFromTokens=function(e){if(this.isValid){var t=function(e,t,n){var r=e.match(t);if(r){var i,o,a,s={},u=1;for(i in n)h(n,i)&&(a=(o=n[i]).groups?o.groups+1:1,!o.literal&&o.token&&(s[o.token.val[0]]=o.deser(r.slice(u,u+a))),u+=a);return[r,s]}return[r,{}]}(e,this.regex,this.handlers),n=t[0],t=t[1],r=t?(r=null,N((s=t).z)||(r=c.create(s.z)),N(s.Z)||(r=r||new f(s.Z),i=s.Z),N(s.q)||(s.M=3*(s.q-1)+1),N(s.h)||(s.h<12&&1===s.a?s.h+=12:12===s.h&&0===s.a&&(s.h=0)),0===s.G&&s.y&&(s.y=-s.y),N(s.u)||(s.S=yt(s.u)),[Object.keys(s).reduce(function(e,t){var n=function(e){switch(e){case"S":return"millisecond";case"s":return"second";case"m":return"minute";case"h":case"H":return"hour";case"d":return"day";case"o":return"ordinal";case"L":case"M":return"month";case"y":return"year";case"E":case"c":return"weekday";case"W":return"weekNumber";case"k":return"weekYear";case"q":return"quarter";default:return null}}(t);return n&&(e[n]=s[t]),e},{}),r,i]):[null,null,void 0],i=r[0],o=r[1],a=r[2];if(h(t,"a")&&h(t,"H"))throw new w("Can't include meridiem when specifying 24-hour format");return{input:e,tokens:this.tokens,regex:this.regex,rawMatches:n,matches:t,result:i,zone:o,specificOffset:a}}return{input:e,tokens:this.tokens,invalidReason:this.invalidReason};var s,i,r},i(e,[{key:"isValid",get:function(){return!this.disqualifyingUnit}},{key:"invalidReason",get:function(){return this.disqualifyingUnit?this.disqualifyingUnit.invalidReason:null}}]),e}();function Bn(e,t,n){return new $n(e,n).explainFromTokens(t)}function Qn(o,e){var t,a;return o?(t=(e=I.create(e,o).dtFormatter(Jn=Jn||W.fromMillis(1555555555555))).formatToParts(),a=e.resolvedOptions(),t.map(function(e){return t=o,n=a,i=(e=e).type,e=e.value,"literal"===i?{literal:!(r=/^\s+$/.test(e)),val:r?" ":e}:(r=t[i],"hour"===(e=i)&&(e=null!=t.hour12?t.hour12?"hour12":"hour24":null!=t.hourCycle?"h11"===t.hourCycle||"h12"===t.hourCycle?"hour12":"hour24":n.hour12?"hour12":"hour24"),(i="object"==typeof(i=Hn[e])?i[r]:i)?{literal:!1,val:i}:void 0);var t,n,r,i})):null}var Kn="Invalid DateTime";function Xn(e){return new d("unsupported zone",'the zone "'+e.name+'" is not supported')}function er(e){return null===e.weekData&&(e.weekData=rt(e.c)),e.weekData}function tr(e){return null===e.localWeekData&&(e.localWeekData=rt(e.c,e.loc.getMinDaysInFirstWeek(),e.loc.getStartOfWeek())),e.localWeekData}function Z(e,t){e={ts:e.ts,zone:e.zone,c:e.c,o:e.o,loc:e.loc,invalid:e.invalid};return new W(l({},e,t,{old:e}))}function nr(e,t,n){var r=e-60*t*1e3,i=n.offset(r);return t===i?[r,t]:i===(n=n.offset(r-=60*(i-t)*1e3))?[r,i]:[e-60*Math.min(i,n)*1e3,Math.max(i,n)]}function rr(e,t){e+=60*t*1e3;t=new Date(e);return{year:t.getUTCFullYear(),month:t.getUTCMonth()+1,day:t.getUTCDate(),hour:t.getUTCHours(),minute:t.getUTCMinutes(),second:t.getUTCSeconds(),millisecond:t.getUTCMilliseconds()}}function ir(e,t,n){return nr(kt(e),t,n)}function or(e,t){var n=e.o,r=e.c.year+Math.trunc(t.years),i=e.c.month+Math.trunc(t.months)+3*Math.trunc(t.quarters),r=l({},e.c,{year:r,month:i,day:Math.min(e.c.day,pt(r,i))+Math.trunc(t.days)+7*Math.trunc(t.weeks)}),i=x.fromObject({years:t.years-Math.trunc(t.years),quarters:t.quarters-Math.trunc(t.quarters),months:t.months-Math.trunc(t.months),weeks:t.weeks-Math.trunc(t.weeks),days:t.days-Math.trunc(t.days),hours:t.hours,minutes:t.minutes,seconds:t.seconds,milliseconds:t.milliseconds}).as("milliseconds"),t=nr(kt(r),n,e.zone),r=t[0],n=t[1];return 0!==i&&(n=e.zone.offset(r+=i)),{ts:r,o:n}}function ar(e,t,n,r,i,o){var a=n.setZone,s=n.zone;return e&&0!==Object.keys(e).length||t?(e=W.fromObject(e,l({},n,{zone:t||s,specificOffset:o})),a?e:e.setZone(s)):W.invalid(new d("unparsable",'the input "'+i+"\" can't be parsed as "+r))}function sr(e,t,n){return void 0===n&&(n=!0),e.isValid?I.create(b.create("en-US"),{allowZ:n,forceSimple:!0}).formatDateTimeFromString(e,t):null}function ur(e,t,n){var r=9999<e.c.year||e.c.year<0,i="";if(r&&0<=e.c.year&&(i+="+"),i+=m(e.c.year,r?6:4),"year"!==n){if(t){if(i=(i+="-")+m(e.c.month),"month"===n)return i;i+="-"}else if(i+=m(e.c.month),"month"===n)return i;i+=m(e.c.day)}return i}function lr(e,t,n,r,i,o,a){var s=!n||0!==e.c.millisecond||0!==e.c.second,u="";switch(a){case"day":case"month":case"year":break;default:if(u+=m(e.c.hour),"hour"!==a){if(t){if(u=(u+=":")+m(e.c.minute),"minute"===a)break;s&&(u=(u+=":")+m(e.c.second))}else{if(u+=m(e.c.minute),"minute"===a)break;s&&(u+=m(e.c.second))}"second"===a||!s||r&&0===e.c.millisecond||(u=(u+=".")+m(e.c.millisecond,3))}}return i&&(e.isOffsetFixed&&0===e.offset&&!o?u+="Z":u=e.o<0?(u=(u+="-")+m(Math.trunc(-e.o/60))+":")+m(Math.trunc(-e.o%60)):(u=(u+="+")+m(Math.trunc(e.o/60))+":")+m(Math.trunc(e.o%60))),o&&(u+="["+e.zone.ianaName+"]"),u}var cr,fr={month:1,day:1,hour:0,minute:0,second:0,millisecond:0},dr={weekNumber:1,weekday:1,hour:0,minute:0,second:0,millisecond:0},hr={ordinal:1,hour:0,minute:0,second:0,millisecond:0},mr=["year","month","day","hour","minute","second","millisecond"],yr=["weekYear","weekNumber","weekday","hour","minute","second","millisecond"],vr=["year","ordinal","hour","minute","second","millisecond"];function gr(e){var t={year:"year",years:"year",month:"month",months:"month",day:"day",days:"day",hour:"hour",hours:"hour",minute:"minute",minutes:"minute",quarter:"quarter",quarters:"quarter",second:"second",seconds:"second",millisecond:"millisecond",milliseconds:"millisecond",weekday:"weekday",weekdays:"weekday",weeknumber:"weekNumber",weeksnumber:"weekNumber",weeknumbers:"weekNumber",weekyear:"weekYear",weekyears:"weekYear",ordinal:"ordinal"}[e.toLowerCase()];if(t)return t;throw new J(e)}function pr(e){switch(e.toLowerCase()){case"localweekday":case"localweekdays":return"localWeekday";case"localweeknumber":case"localweeknumbers":return"localWeekNumber";case"localweekyear":case"localweekyears":return"localWeekYear";default:return gr(e)}}function kr(e,t){var n=S(t.zone,O.defaultZone);if(!n.isValid)return W.invalid(Xn(n));var r,t=b.fromObject(t);if(N(e.year))u=O.now();else{for(var i=0,o=mr;i<o.length;i++){var a=o[i];N(e[a])&&(e[a]=fr[a])}var s=ut(e)||lt(e);if(s)return W.invalid(s);s=n,void 0===cr&&(cr=O.now());var s=ir(e,"iana"!==s.type?s.offset(cr):(l=s.name,void 0===(r=Sr.get(l))&&(r=s.offset(cr),Sr.set(l,r)),r),n),u=s[0],l=s[1]}return new W({ts:u,zone:n,loc:t,o:l})}function wr(t,n,r){function e(e,t){return e=vt(e,o||r.calendary?0:2,r.calendary?"round":a),n.loc.clone(r).relFormatter(r).format(e,t)}function i(e){return r.calendary?n.hasSame(t,e)?0:n.startOf(e).diff(t.startOf(e),e).get(e):n.diff(t,e).get(e)}var o=!!N(r.round)||r.round,a=N(r.rounding)?"trunc":r.rounding;if(r.unit)return e(i(r.unit),r.unit);for(var s=R(r.units);!(u=s()).done;){var u=u.value,l=i(u);if(1<=Math.abs(l))return e(l,u)}return e(n<t?-0:0,r.units[r.units.length-1])}function br(e){var t={},e=0<e.length&&"object"==typeof e[e.length-1]?(t=e[e.length-1],Array.from(e).slice(0,e.length-1)):Array.from(e);return[t,e]}var Sr=new Map,W=function(e){function k(e){var t,n=e.zone||O.defaultZone,r=e.invalid||(Number.isNaN(e.ts)?new d("invalid input"):null)||(n.isValid?null:Xn(n)),i=(this.ts=N(e.ts)?O.now():e.ts,null),o=null;r||(o=e.old&&e.old.ts===this.ts&&e.old.zone.equals(n)?(i=(t=[e.old.c,e.old.o])[0],t[1]):(t=v(e.o)&&!e.old?e.o:n.offset(this.ts),i=rr(this.ts,t),i=(r=Number.isNaN(i.year)?new d("invalid input"):null)?null:i,r?null:t)),this._zone=n,this.loc=e.loc||b.create(),this.invalid=r,this.weekData=null,this.localWeekData=null,this.c=i,this.o=o,this.isLuxonDateTime=!0}k.now=function(){return new k({})},k.local=function(){var e=br(arguments),t=e[0],e=e[1];return kr({year:e[0],month:e[1],day:e[2],hour:e[3],minute:e[4],second:e[5],millisecond:e[6]},t)},k.utc=function(){var e=br(arguments),t=e[0],e=e[1],n=e[0],r=e[1],i=e[2],o=e[3],a=e[4],s=e[5],e=e[6];return t.zone=f.utcInstance,kr({year:n,month:r,day:i,hour:o,minute:a,second:s,millisecond:e},t)},k.fromJSDate=function(e,t){void 0===t&&(t={});var n,e="[object Date]"===Object.prototype.toString.call(e)?e.valueOf():NaN;return Number.isNaN(e)?k.invalid("invalid input"):(n=S(t.zone,O.defaultZone)).isValid?new k({ts:e,zone:n,loc:b.fromObject(t)}):k.invalid(Xn(n))},k.fromMillis=function(e,t){if(void 0===t&&(t={}),v(e))return e<-864e13||864e13<e?k.invalid("Timestamp out of range"):new k({ts:e,zone:S(t.zone,O.defaultZone),loc:b.fromObject(t)});throw new u("fromMillis requires a numerical input, but received a "+typeof e+" with value "+e)},k.fromSeconds=function(e,t){if(void 0===t&&(t={}),v(e))return new k({ts:1e3*e,zone:S(t.zone,O.defaultZone),loc:b.fromObject(t)});throw new u("fromSeconds requires a numerical input")},k.fromObject=function(e,t){e=e||{};var n=S((t=void 0===t?{}:t).zone,O.defaultZone);if(!n.isValid)return k.invalid(Xn(n));var r=b.fromObject(t),i=Mt(e,pr),o=st(i,r),a=o.minDaysInFirstWeek,o=o.startOfWeek,s=O.now(),t=N(t.specificOffset)?n.offset(s):t.specificOffset,u=!N(i.ordinal),l=!N(i.year),c=!N(i.month)||!N(i.day),l=l||c,f=i.weekYear||i.weekNumber;if((l||u)&&f)throw new w("Can't mix weekYear/weekNumber units with year/month/day or ordinals");if(c&&u)throw new w("Can't mix ordinal dates with month/day");for(var d,c=f||i.weekday&&!l,h=rr(s,t),m=(c?(p=yr,d=dr,h=rt(h,a,o)):u?(p=vr,d=hr,h=ot(h)):(p=mr,d=fr),!1),y=R(p);!(v=y()).done;){var v=v.value;N(i[v])?i[v]=(m?d:h)[v]:m=!0}var g,p=(c?(f=a,s=o,g=ct((p=i).weekYear),f=M(p.weekNumber,1,bt(p.weekYear,f=void 0===f?4:f,s=void 0===s?1:s)),s=M(p.weekday,1,7),g?f?!s&&T("weekday",p.weekday):T("week",p.weekNumber):T("weekYear",p.weekYear)):u?(f=ct((g=i).year),s=M(g.ordinal,1,D(g.year)),f?!s&&T("ordinal",g.ordinal):T("year",g.year)):ut(i))||lt(i);return p?k.invalid(p):(s=new k({ts:(f=ir(c?it(i,a,o):u?at(i):i,t,n))[0],zone:n,o:f[1],loc:r}),i.weekday&&l&&e.weekday!==s.weekday?k.invalid("mismatched weekday","you can't specify both a weekday of "+i.weekday+" and a date of "+s.toISO()):s.isValid?s:k.invalid(s.invalid))},k.fromISO=function(e,t){void 0===t&&(t={});var n=Ht(e,[mn,pn],[yn,kn],[vn,wn],[gn,bn]);return ar(n[0],n[1],t,"ISO 8601",e)},k.fromRFC2822=function(e,t){void 0===t&&(t={});var n=Ht(e.replace(/\([^()]*\)|[\n\t]/g," ").replace(/(\s\s+)/g," ").trim(),[sn,un]);return ar(n[0],n[1],t,"RFC 2822",e)},k.fromHTTP=function(e,t){void 0===t&&(t={});e=Ht(e,[ln,dn],[cn,dn],[fn,hn]);return ar(e[0],e[1],t,"HTTP",t)},k.fromFormat=function(e,t,n){if(void 0===n&&(n={}),N(e)||N(t))throw new u("fromFormat requires an input string and a format");var r=n,i=r.locale,r=r.numberingSystem,i=b.fromOpts({locale:void 0===i?null:i,numberingSystem:void 0===r?null:r,defaultToEN:!0}),i=[(r=Bn(r=i,e,t)).result,r.zone,r.specificOffset,r.invalidReason],r=i[0],o=i[1],a=i[2],i=i[3];return i?k.invalid(i):ar(r,o,n,"format "+t,e,a)},k.fromString=function(e,t,n){return k.fromFormat(e,t,n=void 0===n?{}:n)},k.fromSQL=function(e,t){void 0===t&&(t={});var n=Ht(e,[On,pn],[Tn,Nn]);return ar(n[0],n[1],t,"SQL",e)},k.invalid=function(e,t){if(void 0===t&&(t=null),!e)throw new u("need to specify a reason the DateTime is invalid");e=e instanceof d?e:new d(e,t);if(O.throwOnInvalid)throw new P(e);return new k({invalid:e})},k.isDateTime=function(e){return e&&e.isLuxonDateTime||!1},k.parseFormatForOpts=function(e,t){e=Qn(e,b.fromObject(t=void 0===t?{}:t));return e?e.map(function(e){return e?e.val:null}).join(""):null},k.expandFormat=function(e,t){return void 0===t&&(t={}),Gn(I.parseFormat(e),b.fromObject(t)).map(function(e){return e.val}).join("")},k.resetCache=function(){cr=void 0,Sr.clear()};var t=k.prototype;return t.get=function(e){return this[e]},t.getPossibleOffsets=function(){var e,t,n,r;return this.isValid&&!this.isOffsetFixed&&(e=kt(this.c),n=this.zone.offset(e-864e5),r=this.zone.offset(e+864e5),(n=this.zone.offset(e-6e4*n))!==(r=this.zone.offset(e-6e4*r)))&&(t=e-6e4*r,n=rr(e=e-6e4*n,n),r=rr(t,r),n.hour===r.hour)&&n.minute===r.minute&&n.second===r.second&&n.millisecond===r.millisecond?[Z(this,{ts:e}),Z(this,{ts:t})]:[this]},t.resolvedLocaleOptions=function(e){e=I.create(this.loc.clone(e=void 0===e?{}:e),e).resolvedOptions(this);return{locale:e.locale,numberingSystem:e.numberingSystem,outputCalendar:e.calendar}},t.toUTC=function(e,t){return void 0===t&&(t={}),this.setZone(f.instance(e=void 0===e?0:e),t)},t.toLocal=function(){return this.setZone(O.defaultZone)},t.setZone=function(e,t){var n,t=void 0===t?{}:t,r=t.keepLocalTime,r=void 0!==r&&r,t=t.keepCalendarTime,t=void 0!==t&&t;return(e=S(e,O.defaultZone)).equals(this.zone)?this:e.isValid?(n=this.ts,(r||t)&&(r=e.offset(this.ts),n=ir(this.toObject(),r,e)[0]),Z(this,{ts:n,zone:e})):k.invalid(Xn(e))},t.reconfigure=function(e){var e=void 0===e?{}:e,t=e.locale,n=e.numberingSystem,e=e.outputCalendar,t=this.loc.clone({locale:t,numberingSystem:n,outputCalendar:e});return Z(this,{loc:t})},t.setLocale=function(e){return this.reconfigure({locale:e})},t.set=function(e){if(!this.isValid)return this;var t,e=Mt(e,pr),n=st(e,this.loc),r=n.minDaysInFirstWeek,n=n.startOfWeek,i=!N(e.weekYear)||!N(e.weekNumber)||!N(e.weekday),o=!N(e.ordinal),a=!N(e.year),s=!N(e.month)||!N(e.day),u=e.weekYear||e.weekNumber;if((a||s||o)&&u)throw new w("Can't mix weekYear/weekNumber units with year/month/day or ordinals");if(s&&o)throw new w("Can't mix ordinal dates with month/day");i?t=it(l({},rt(this.c,r,n),e),r,n):N(e.ordinal)?(t=l({},this.toObject(),e),N(e.day)&&(t.day=Math.min(pt(t.year,t.month),t.day))):t=at(l({},ot(this.c),e));a=ir(t,this.o,this.zone);return Z(this,{ts:a[0],o:a[1]})},t.plus=function(e){return this.isValid?Z(this,or(this,x.fromDurationLike(e))):this},t.minus=function(e){return this.isValid?Z(this,or(this,x.fromDurationLike(e).negate())):this},t.startOf=function(e,t){t=(void 0===t?{}:t).useLocaleWeeks,t=void 0!==t&&t;if(!this.isValid)return this;var n={},e=x.normalizeUnit(e);switch(e){case"years":n.month=1;case"quarters":case"months":n.day=1;case"weeks":case"days":n.hour=0;case"hours":n.minute=0;case"minutes":n.second=0;case"seconds":n.millisecond=0}return"weeks"===e&&(t?(t=this.loc.getStartOfWeek(),this.weekday<t&&(n.weekNumber=this.weekNumber-1),n.weekday=t):n.weekday=1),"quarters"===e&&(t=Math.ceil(this.month/3),n.month=3*(t-1)+1),this.set(n)},t.endOf=function(e,t){var n;return this.isValid?this.plus(((n={})[e]=1,n)).startOf(e,t).minus(1):this},t.toFormat=function(e,t){return void 0===t&&(t={}),this.isValid?I.create(this.loc.redefaultToEN(t)).formatDateTimeFromString(this,e):Kn},t.toLocaleString=function(e,t){return void 0===e&&(e=G),void 0===t&&(t={}),this.isValid?I.create(this.loc.clone(t),e).formatDateTime(this):Kn},t.toLocaleParts=function(e){return void 0===e&&(e={}),this.isValid?I.create(this.loc.clone(e),e).formatDateTimeParts(this):[]},t.toISO=function(e){var t,e=void 0===e?{}:e,n=e.format,r=e.suppressSeconds,r=void 0!==r&&r,i=e.suppressMilliseconds,i=void 0!==i&&i,o=e.includeOffset,o=void 0===o||o,a=e.extendedZone,a=void 0!==a&&a,e=e.precision;return this.isValid?(t=ur(this,n="extended"===(void 0===n?"extended":n),e=gr(void 0===e?"milliseconds":e)),3<=mr.indexOf(e)&&(t+="T"),t+lr(this,n,r,i,o,a,e)):null},t.toISODate=function(e){var e=void 0===e?{}:e,t=e.format,e=e.precision;return this.isValid?ur(this,"extended"===(void 0===t?"extended":t),gr(void 0===e?"day":e)):null},t.toISOWeekDate=function(){return sr(this,"kkkk-'W'WW-c")},t.toISOTime=function(e){var e=void 0===e?{}:e,t=e.suppressMilliseconds,t=void 0!==t&&t,n=e.suppressSeconds,n=void 0!==n&&n,r=e.includeOffset,r=void 0===r||r,i=e.includePrefix,i=void 0!==i&&i,o=e.extendedZone,o=void 0!==o&&o,a=e.format,a=void 0===a?"extended":a,e=e.precision;return this.isValid?(e=gr(e=void 0===e?"milliseconds":e),(i&&3<=mr.indexOf(e)?"T":"")+lr(this,"extended"===a,n,t,r,o,e)):null},t.toRFC2822=function(){return sr(this,"EEE, dd LLL yyyy HH:mm:ss ZZZ",!1)},t.toHTTP=function(){return sr(this.toUTC(),"EEE, dd LLL yyyy HH:mm:ss 'GMT'")},t.toSQLDate=function(){return this.isValid?ur(this,!0):null},t.toSQLTime=function(e){var e=void 0===e?{}:e,t=e.includeOffset,t=void 0===t||t,n=e.includeZone,n=void 0!==n&&n,e=e.includeOffsetSpace,r="HH:mm:ss.SSS";return(n||t)&&((void 0===e||e)&&(r+=" "),n?r+="z":t&&(r+="ZZ")),sr(this,r,!0)},t.toSQL=function(e){return void 0===e&&(e={}),this.isValid?this.toSQLDate()+" "+this.toSQLTime(e):null},t.toString=function(){return this.isValid?this.toISO():Kn},t[e]=function(){return this.isValid?"DateTime { ts: "+this.toISO()+", zone: "+this.zone.name+", locale: "+this.locale+" }":"DateTime { Invalid, reason: "+this.invalidReason+" }"},t.valueOf=function(){return this.toMillis()},t.toMillis=function(){return this.isValid?this.ts:NaN},t.toSeconds=function(){return this.isValid?this.ts/1e3:NaN},t.toUnixInteger=function(){return this.isValid?Math.floor(this.ts/1e3):NaN},t.toJSON=function(){return this.toISO()},t.toBSON=function(){return this.toJSDate()},t.toObject=function(e){var t;return void 0===e&&(e={}),this.isValid?(t=l({},this.c),e.includeConfig&&(t.outputCalendar=this.outputCalendar,t.numberingSystem=this.loc.numberingSystem,t.locale=this.loc.locale),t):{}},t.toJSDate=function(){return new Date(this.isValid?this.ts:NaN)},t.diff=function(e,t,n){var r;return void 0===t&&(t="milliseconds"),void 0===n&&(n={}),this.isValid&&e.isValid?(n=l({locale:this.locale,numberingSystem:this.numberingSystem},n),t=t,t=(Array.isArray(t)?t:[t]).map(x.normalizeUnit),e=jn((r=e.valueOf()>this.valueOf())?this:e,r?e:this,t,n),r?e.negate():e):x.invalid("created by diffing an invalid DateTime")},t.diffNow=function(e,t){return void 0===e&&(e="milliseconds"),void 0===t&&(t={}),this.diff(k.now(),e,t)},t.until=function(e){return this.isValid?Zn.fromDateTimes(this,e):this},t.hasSame=function(e,t,n){var r;return!!this.isValid&&(r=e.valueOf(),(e=this.setZone(e.zone,{keepLocalTime:!0})).startOf(t,n)<=r)&&r<=e.endOf(t,n)},t.equals=function(e){return this.isValid&&e.isValid&&this.valueOf()===e.valueOf()&&this.zone.equals(e.zone)&&this.loc.equals(e.loc)},t.toRelative=function(e){var t,n,r,i;return this.isValid?(t=(e=void 0===e?{}:e).base||k.fromObject({},{zone:this.zone}),n=e.padding?this<t?-e.padding:e.padding:0,r=["years","months","days","hours","minutes","seconds"],i=e.unit,Array.isArray(e.unit)&&(r=e.unit,i=void 0),wr(t,this.plus(n),l({},e,{numeric:"always",units:r,unit:i}))):null},t.toRelativeCalendar=function(e){return void 0===e&&(e={}),this.isValid?wr(e.base||k.fromObject({},{zone:this.zone}),this,l({},e,{numeric:"auto",units:["years","months","days"],calendary:!0})):null},k.min=function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];if(t.every(k.isDateTime))return ht(t,function(e){return e.valueOf()},Math.min);throw new u("min requires all arguments be DateTimes")},k.max=function(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];if(t.every(k.isDateTime))return ht(t,function(e){return e.valueOf()},Math.max);throw new u("max requires all arguments be DateTimes")},k.fromFormatExplain=function(e,t,n){var n=n=void 0===n?{}:n,r=n.locale,n=n.numberingSystem;return Bn(b.fromOpts({locale:void 0===r?null:r,numberingSystem:void 0===n?null:n,defaultToEN:!0}),e,t)},k.fromStringExplain=function(e,t,n){return k.fromFormatExplain(e,t,n=void 0===n?{}:n)},k.buildFormatParser=function(e,t){var t=t=void 0===t?{}:t,n=t.locale,t=t.numberingSystem,n=b.fromOpts({locale:void 0===n?null:n,numberingSystem:void 0===t?null:t,defaultToEN:!0});return new $n(n,e)},k.fromFormatParser=function(e,t,n){if(void 0===n&&(n={}),N(e)||N(t))throw new u("fromFormatParser requires an input string and a format parser");var r,i,o,a=n,s=a.locale,a=a.numberingSystem,s=b.fromOpts({locale:void 0===s?null:s,numberingSystem:void 0===a?null:a,defaultToEN:!0});if(s.equals(t.locale))return r=(a=t.explainFromTokens(e)).result,i=a.zone,o=a.specificOffset,(a=a.invalidReason)?k.invalid(a):ar(r,i,n,"format "+t.format,e,o);throw new u("fromFormatParser called with a locale of "+s+", but the format parser was created for "+t.locale)},i(k,[{key:"isValid",get:function(){return null===this.invalid}},{key:"invalidReason",get:function(){return this.invalid?this.invalid.reason:null}},{key:"invalidExplanation",get:function(){return this.invalid?this.invalid.explanation:null}},{key:"locale",get:function(){return this.isValid?this.loc.locale:null}},{key:"numberingSystem",get:function(){return this.isValid?this.loc.numberingSystem:null}},{key:"outputCalendar",get:function(){return this.isValid?this.loc.outputCalendar:null}},{key:"zone",get:function(){return this._zone}},{key:"zoneName",get:function(){return this.isValid?this.zone.name:null}},{key:"year",get:function(){return this.isValid?this.c.year:NaN}},{key:"quarter",get:function(){return this.isValid?Math.ceil(this.c.month/3):NaN}},{key:"month",get:function(){return this.isValid?this.c.month:NaN}},{key:"day",get:function(){return this.isValid?this.c.day:NaN}},{key:"hour",get:function(){return this.isValid?this.c.hour:NaN}},{key:"minute",get:function(){return this.isValid?this.c.minute:NaN}},{key:"second",get:function(){return this.isValid?this.c.second:NaN}},{key:"millisecond",get:function(){return this.isValid?this.c.millisecond:NaN}},{key:"weekYear",get:function(){return this.isValid?er(this).weekYear:NaN}},{key:"weekNumber",get:function(){return this.isValid?er(this).weekNumber:NaN}},{key:"weekday",get:function(){return this.isValid?er(this).weekday:NaN}},{key:"isWeekend",get:function(){return this.isValid&&this.loc.getWeekendDays().includes(this.weekday)}},{key:"localWeekday",get:function(){return this.isValid?tr(this).weekday:NaN}},{key:"localWeekNumber",get:function(){return this.isValid?tr(this).weekNumber:NaN}},{key:"localWeekYear",get:function(){return this.isValid?tr(this).weekYear:NaN}},{key:"ordinal",get:function(){return this.isValid?ot(this.c).ordinal:NaN}},{key:"monthShort",get:function(){return this.isValid?Wn.months("short",{locObj:this.loc})[this.month-1]:null}},{key:"monthLong",get:function(){return this.isValid?Wn.months("long",{locObj:this.loc})[this.month-1]:null}},{key:"weekdayShort",get:function(){return this.isValid?Wn.weekdays("short",{locObj:this.loc})[this.weekday-1]:null}},{key:"weekdayLong",get:function(){return this.isValid?Wn.weekdays("long",{locObj:this.loc})[this.weekday-1]:null}},{key:"offset",get:function(){return this.isValid?+this.o:NaN}},{key:"offsetNameShort",get:function(){return this.isValid?this.zone.offsetName(this.ts,{format:"short",locale:this.locale}):null}},{key:"offsetNameLong",get:function(){return this.isValid?this.zone.offsetName(this.ts,{format:"long",locale:this.locale}):null}},{key:"isOffsetFixed",get:function(){return this.isValid?this.zone.isUniversal:null}},{key:"isInDST",get:function(){return!this.isOffsetFixed&&(this.offset>this.set({month:1,day:1}).offset||this.offset>this.set({month:5}).offset)}},{key:"isInLeapYear",get:function(){return gt(this.year)}},{key:"daysInMonth",get:function(){return pt(this.year,this.month)}},{key:"daysInYear",get:function(){return this.isValid?D(this.year):NaN}},{key:"weeksInWeekYear",get:function(){return this.isValid?bt(this.weekYear):NaN}},{key:"weeksInLocalWeekYear",get:function(){return this.isValid?bt(this.localWeekYear,this.loc.getMinDaysInFirstWeek(),this.loc.getStartOfWeek()):NaN}}],[{key:"DATE_SHORT",get:function(){return G}},{key:"DATE_MED",get:function(){return $}},{key:"DATE_MED_WITH_WEEKDAY",get:function(){return B}},{key:"DATE_FULL",get:function(){return Q}},{key:"DATE_HUGE",get:function(){return K}},{key:"TIME_SIMPLE",get:function(){return X}},{key:"TIME_WITH_SECONDS",get:function(){return ee}},{key:"TIME_WITH_SHORT_OFFSET",get:function(){return te}},{key:"TIME_WITH_LONG_OFFSET",get:function(){return ne}},{key:"TIME_24_SIMPLE",get:function(){return re}},{key:"TIME_24_WITH_SECONDS",get:function(){return ie}},{key:"TIME_24_WITH_SHORT_OFFSET",get:function(){return oe}},{key:"TIME_24_WITH_LONG_OFFSET",get:function(){return ae}},{key:"DATETIME_SHORT",get:function(){return se}},{key:"DATETIME_SHORT_WITH_SECONDS",get:function(){return ue}},{key:"DATETIME_MED",get:function(){return le}},{key:"DATETIME_MED_WITH_SECONDS",get:function(){return ce}},{key:"DATETIME_MED_WITH_WEEKDAY",get:function(){return fe}},{key:"DATETIME_FULL",get:function(){return de}},{key:"DATETIME_FULL_WITH_SECONDS",get:function(){return he}},{key:"DATETIME_HUGE",get:function(){return me}},{key:"DATETIME_HUGE_WITH_SECONDS",get:function(){return ye}}]),k}(Symbol.for("nodejs.util.inspect.custom"));function Or(e){if(W.isDateTime(e))return e;if(e&&e.valueOf&&v(e.valueOf()))return W.fromJSDate(e);if(e&&"object"==typeof e)return W.fromObject(e);throw new u("Unknown datetime argument: "+e+", of type "+typeof e)}return e.DateTime=W,e.Duration=x,e.FixedOffsetZone=f,e.IANAZone=c,e.Info=Wn,e.Interval=Zn,e.InvalidZone=ze,e.Settings=O,e.SystemZone=ge,e.VERSION="3.7.2",e.Zone=s,Object.defineProperty(e,"__esModule",{value:!0}),e}({});
\ No newline at end of file
diff --git a/node_modules/luxon/build/global/luxon.min.js.map b/node_modules/luxon/build/global/luxon.min.js.map
new file mode 100644
index 0000000..64d99aa
--- /dev/null
+++ b/node_modules/luxon/build/global/luxon.min.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"build/global/luxon.js","sources":["0"],"names":["luxon","exports","_defineProperties","target","props","i","length","descriptor","enumerable","configurable","writable","Object","defineProperty","arg","key","input","hint","prim","Symbol","toPrimitive","undefined","String","Number","res","call","TypeError","_createClass","Constructor","protoProps","staticProps","prototype","_extends","assign","bind","arguments","source","hasOwnProperty","apply","this","_inheritsLoose","subClass","superClass","create","_setPrototypeOf","constructor","_getPrototypeOf","o","setPrototypeOf","getPrototypeOf","__proto__","p","_construct","Parent","args","Class","Reflect","construct","sham","Proxy","Boolean","valueOf","e","a","push","instance","Function","_wrapNativeSuper","_cache","Map","toString","indexOf","has","get","set","Wrapper","value","_objectWithoutPropertiesLoose","excluded","sourceKeys","keys","_arrayLikeToArray","arr","len","arr2","Array","_createForOfIteratorHelperLoose","allowArrayLike","it","iterator","next","isArray","minLen","n","slice","name","from","test","done","LuxonError","_Error","Error","InvalidDateTimeError","_LuxonError","reason","toMessage","InvalidIntervalError","_LuxonError2","InvalidDurationError","_LuxonError3","ConflictingSpecificationError","_LuxonError4","InvalidUnitError","_LuxonError5","unit","InvalidArgumentError","_LuxonError6","ZoneIsAbstractError","_LuxonError7","s","l","DATE_SHORT","year","month","day","DATE_MED","DATE_MED_WITH_WEEKDAY","weekday","DATE_FULL","DATE_HUGE","TIME_SIMPLE","hour","minute","TIME_WITH_SECONDS","second","TIME_WITH_SHORT_OFFSET","timeZoneName","TIME_WITH_LONG_OFFSET","TIME_24_SIMPLE","hourCycle","TIME_24_WITH_SECONDS","TIME_24_WITH_SHORT_OFFSET","TIME_24_WITH_LONG_OFFSET","DATETIME_SHORT","DATETIME_SHORT_WITH_SECONDS","DATETIME_MED","DATETIME_MED_WITH_SECONDS","DATETIME_MED_WITH_WEEKDAY","DATETIME_FULL","DATETIME_FULL_WITH_SECONDS","DATETIME_HUGE","DATETIME_HUGE_WITH_SECONDS","Zone","_proto","offsetName","ts","opts","formatOffset","format","offset","equals","otherZone","singleton$1","SystemZone","_Zone","_ref","parseZoneInfo","locale","Date","getTimezoneOffset","type","Intl","DateTimeFormat","resolvedOptions","timeZone","dtfCache","typeToPos","era","ianaZoneCache","IANAZone","_this","zoneName","valid","isValidZone","zone","resetCache","clear","isValidSpecifier","adOrBc","dtf","date","fDay","adjustedHour","over","isNaN","NaN","hour12","_ref2","formatToParts","formatted","filled","_formatted$i","pos","isUndefined","parseInt","replace","fMonth","parsed","exec","asTS","objToLocalTS","Math","abs","millisecond","_excluded","_excluded2","intlLFCache","intlDTCache","getCachedDTF","locString","JSON","stringify","intlNumCache","intlRelCache","sysLocaleCache","intlResolvedOptionsCache","getCachedIntResolvedOptions","weekInfoCache","listStuff","loc","englishFn","intlFn","mode","listingMode","PolyNumberFormatter","intl","forceSimple","padTo","floor","otherOpts","intlOpts","useGrouping","minimumIntegerDigits","inf","NumberFormat","fixed","padStart","roundTo","PolyDateFormatter","dt","z","originalZone","offsetZ","gmtOffset","setZone","plus","minutes","_proto2","map","join","toJSDate","parts","part","PolyRelFormatter","isEnglish","style","hasRelative","rtf","_opts","base","cacheKeyOpts","RelativeTimeFormat","_proto3","count","formatRelativeTime","numeric","narrow","units","years","quarters","months","weeks","days","hours","seconds","lastable","isDay","isInPast","is","singular","fmtValue","lilUnits","fmtUnit","fallbackWeekSettings","firstDay","minimalDays","weekend","Locale","numbering","outputCalendar","weekSettings","specifiedLocale","_parseLocaleString","localeStr","xIndex","uIndex","substring","options","selectedStr","smaller","_options","numberingSystem","calendar","parsedLocale","parsedNumberingSystem","parsedOutputCalendar","includes","weekdaysCache","standalone","monthsCache","meridiemCache","eraCache","fastNumbersCached","fromOpts","defaultToEN","Settings","defaultLocale","defaultNumberingSystem","defaultOutputCalendar","validateWeekSettings","defaultWeekSettings","fromObject","_temp","_proto4","isActuallyEn","hasNoWeirdness","clone","alts","getOwnPropertyNames","redefaultToEN","redefaultToSystem","_this2","monthSpecialCase","startsWith","formatStr","f","ms","DateTime","utc","dtFormatter","extract","weekdays","_this3","meridiems","_this4","eras","_this5","field","matching","find","m","toLowerCase","numberFormatter","fastNumbers","relFormatter","listFormatter","ListFormat","getWeekSettings","hasLocaleWeekInfo","data","getWeekInfo","weekInfo","getStartOfWeek","getMinDaysInFirstWeek","getWeekendDays","other","singleton","FixedOffsetZone","utcInstance","parseSpecifier","r","match","signedOffset","InvalidZone","normalizeZone","defaultZone","lowered","isNumber","numberingSystems","arab","arabext","bali","beng","deva","fullwide","gujr","hanidec","khmr","knda","laoo","limb","mlym","mong","mymr","orya","tamldec","telu","thai","tibt","latn","numberingSystemsUTF16","hanidecChars","split","digitRegexCache","digitRegex","append","ns","appendCache","regex","RegExp","throwOnInvalid","now","twoDigitCutoffYear","resetCaches","cutoffYear","t","Invalid","explanation","nonLeapLadder","leapLadder","unitOutOfRange","dayOfWeek","d","UTC","setUTCFullYear","getUTCFullYear","js","getUTCDay","computeOrdinal","isLeapYear","uncomputeOrdinal","ordinal","table","month0","findIndex","isoWeekdayToLocal","isoWeekday","startOfWeek","gregorianToWeek","gregObj","minDaysInFirstWeek","weekYear","weekNumber","weeksInWeekYear","timeObject","weekToGregorian","weekData","weekdayOfJan4","yearInDays","daysInYear","_uncomputeOrdinal","gregorianToOrdinal","gregData","ordinalToGregorian","ordinalData","_uncomputeOrdinal2","usesLocalWeekValues","obj","localWeekday","localWeekNumber","localWeekYear","hasInvalidGregorianData","validYear","isInteger","validMonth","integerBetween","validDay","daysInMonth","hasInvalidTimeData","validHour","validMinute","validSecond","validMillisecond","bestBy","by","compare","reduce","best","pair","prop","settings","some","v","thing","bottom","top","padded","parseInteger","string","parseFloating","parseFloat","parseMillis","fraction","number","digits","rounding","factor","pow","ceil","trunc","round","RangeError","modMonth","x","firstWeekOffset","weekOffset","weekOffsetNext","untruncateYear","offsetFormat","modified","offHourStr","offMinuteStr","offHour","offMin","asNumber","numericValue","isFinite","normalizeObject","normalizer","u","normalized","sign","k","monthsLong","monthsShort","monthsNarrow","concat","weekdaysLong","weekdaysShort","weekdaysNarrow","erasLong","erasShort","erasNarrow","stringifyTokens","splits","tokenToString","_iterator","_step","token","literal","val","_macroTokenToFormatOpts","D","DD","DDD","DDDD","tt","ttt","tttt","T","TT","TTT","TTTT","ff","fff","ffff","F","FF","FFF","FFFF","Formatter","formatOpts","systemLoc","parseFormat","fmt","current","currentFull","bracketed","c","charAt","macroTokenToFormatOpts","formatWithSystemDefault","formatDateTime","formatDateTimeParts","formatInterval","interval","start","formatRange","end","num","signDisplay","formatDateTimeFromString","knownEnglish","useDateTimeFormatter","isOffsetFixed","allowZ","isValid","meridiem","maybeMacro","quarter","formatDurationFromString","dur","lildur","info","invertLargest","signMode","tokenToField","tokens","realTokens","found","collapsed","shiftTo","filter","durationInfo","isNegativeDuration","largestUnit","values","inversionFactor","mapped","ianaRegex","combineRegexes","_len","regexes","_key","full","combineExtractors","_len2","extractors","_key2","ex","mergedVals","mergedZone","cursor","_ex","parse","_len3","patterns","_key3","_i","_patterns","_patterns$_i","extractor","simpleParse","_len4","_key4","ret","offsetRegex","isoTimeBaseRegex","isoTimeRegex","isoTimeExtensionRegex","extractISOWeekData","extractISOOrdinalData","sqlTimeRegex","sqlTimeExtensionRegex","int","fallback","extractISOTime","milliseconds","extractISOOffset","local","fullOffset","extractIANAZone","isoTimeOnly","isoDuration","extractISODuration","maybeNegate","force","hasNegativePrefix","yearStr","monthStr","weekStr","dayStr","hourStr","minuteStr","secondStr","millisecondsStr","negativeSeconds","obsOffsets","GMT","EDT","EST","CDT","CST","MDT","MST","PDT","PST","fromStrings","weekdayStr","result","rfc2822","extractRFC2822","obsOffset","milOffset","rfc1123","rfc850","ascii","extractRFC1123Or850","extractASCII","isoYmdWithTimeExtensionRegex","isoWeekWithTimeExtensionRegex","isoOrdinalWithTimeExtensionRegex","isoTimeCombinedRegex","extractISOYmdTimeAndOffset","extractISOWeekTimeAndOffset","extractISOOrdinalDateAndTime","extractISOTimeAndOffset","extractISOTimeOnly","sqlYmdWithTimeExtensionRegex","sqlTimeCombinedRegex","extractISOTimeOffsetAndIANAZone","INVALID$2","lowOrderMatrix","casualMatrix","daysInYearAccurate","daysInMonthAccurate","accurateMatrix","orderedUnits$1","reverseUnits","reverse","clone$1","conf","conversionAccuracy","matrix","Duration","durationToMillis","vals","_vals$milliseconds","sum","normalizeValues","reduceRight","previous","conv","rollUp","previousVal","removeZeroes","newVals","_Object$entries","entries","_Object$entries$_i","_Symbol$for","config","accurate","invalid","isLuxonDuration","fromMillis","normalizeUnit","fromDurationLike","durationLike","isDuration","fromISO","text","fromISOTime","week","toFormat","fmtOpts","toHuman","showZeros","unitDisplay","listStyle","toObject","toISO","toISOTime","millis","toMillis","suppressMilliseconds","suppressSeconds","includePrefix","includeOffset","toJSON","invalidReason","duration","_i2","_orderedUnits","minus","negate","mapUnits","fn","_i3","_Object$keys","reconfigure","as","normalize","rescale","shiftToAll","built","accumulated","_i4","_orderedUnits2","ak","lastUnit","own","negated","_i5","_Object$keys2","removeZeros","v1","_i6","_orderedUnits3","v2","for","INVALID$1","Interval","isLuxonInterval","fromDateTimes","builtStart","friendlyDateTime","builtEnd","validateError","after","before","endIsValid","_split","startIsValid","_dur","isInterval","toDuration","startOf","useLocaleWeeks","diff","hasSame","isEmpty","isAfter","dateTime","isBefore","contains","splitAt","dateTimes","sorted","sort","b","results","added","splitBy","idx","divideEqually","numberOfParts","overlaps","abutsStart","abutsEnd","engulfs","intersection","union","merge","intervals","_intervals$sort$reduc","item","sofar","final","xor","_Array$prototype","currentCount","ends","time","difference","toLocaleString","toISODate","dateFormat","_temp2","_ref3$separator","separator","mapEndpoints","mapFn","Info","hasDST","proto","isUniversal","isValidIANAZone","_ref$locale","_ref$locObj","locObj","getMinimumDaysInFirstWeek","_ref2$locale","_ref2$locObj","getWeekendWeekdays","_temp3","_ref3","_ref3$locale","_ref3$locObj","_temp4","_ref4","_ref4$locale","_ref4$numberingSystem","_ref4$locObj","_ref4$outputCalendar","monthsFormat","_temp5","_ref5","_ref5$locale","_ref5$numberingSystem","_ref5$locObj","_ref5$outputCalendar","_temp6","_ref6","_ref6$locale","_ref6$numberingSystem","_ref6$locObj","weekdaysFormat","_temp7","_ref7","_ref7$locale","_ref7$numberingSystem","_ref7$locObj","_temp8","_ref8$locale","_temp9","_ref9$locale","features","relative","localeWeek","dayDiff","earlier","later","utcDayStart","toUTC","keepLocalTime","_diff","_highOrderDiffs","lowestOrder","highWater","_differs","_differs$_i","differ","remainingMillis","lowerOrderUnits","_cursor$plus","_Duration$fromMillis","MISSING_FTP","intUnit","post","deser","str","code","charCodeAt","search","_numberingSystemsUTF","min","max","spaceOrNBSP","fromCharCode","spaceOrNBSPRegExp","fixListRegex","stripInsensitivities","oneOf","strings","startIndex","groups","simple","unitForToken","one","two","three","four","six","oneOrTwo","oneToThree","oneToSix","oneToNine","twoToFour","fourToSix","partTypeStyleToTokenVal","2-digit","short","long","dayperiod","dayPeriod","hour24","dummyDateTimeCache","expandMacroTokens","formatOptsToTokens","TokenParser","handlers","disqualifyingUnit","_buildRegex","explainFromTokens","_match","matches","h","all","matchIndex","rawMatches","Z","specificOffset","q","M","G","y","S","resolvedOpts","df","isSpace","actualType","INVALID","unsupportedZone","possiblyCachedWeekData","possiblyCachedLocalWeekData","localWeekData","inst","old","fixOffset","localTS","tz","utcGuess","o2","o3","tsToObj","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","objToTS","adjustTime","oPre","millisToAdd","_fixOffset","parseDataToDateTime","parsedZone","toTechFormat","_toISODate","extended","precision","longFormat","_toISOTime","extendedZone","showSeconds","ianaName","zoneOffsetTs","defaultUnitValues","defaultWeekUnitValues","defaultOrdinalUnitValues","orderedUnits","orderedWeekUnits","orderedOrdinalUnits","weeknumber","weeksnumber","weeknumbers","weekyear","weekyears","normalizeUnitWithLocalWeeks","quickDT","offsetGuess","_objToTS","zoneOffsetGuessCache","diffRelative","calendary","lastOpts","argList","ot","_zone","isLuxonDateTime","_lastOpts","_lastOpts2","fromJSDate","zoneToUse","fromSeconds","_usesLocalWeekValues","tsNow","offsetProvis","containsOrdinal","containsGregorYear","containsGregorMD","containsGregor","definiteWeekDef","defaultValues","useWeekData","objNow","foundFirst","_iterator2","_step2","validWeek","validWeekday","validOrdinal","_objToTS2","_parseISODate","fromRFC2822","_parseRFC2822Date","trim","fromHTTP","_parseHTTPDate","fromFormat","_opts$locale","_opts$numberingSystem","localeToUse","_parseFromTokens","_explainFromTokens","fromString","fromSQL","_parseSQL","isDateTime","parseFormatForOpts","localeOpts","tokenList","expandFormat","getPossibleOffsets","ts1","ts2","c1","c2","oEarlier","oLater","o1","resolvedLocaleOptions","_Formatter$create$res","toLocal","newTS","_ref2$keepLocalTime","_ref2$keepCalendarTim","keepCalendarTime","setLocale","mixed","_usesLocalWeekValues2","settingWeekStuff","_objToTS4","_ref4$useLocaleWeeks","normalizedUnit","endOf","_this$plus","toLocaleParts","_ref5$format","_ref5$suppressSeconds","_ref5$suppressMillise","_ref5$includeOffset","_ref5$extendedZone","_ref5$precision","ext","_ref6$format","_ref6$precision","toISOWeekDate","_ref7$suppressMillise","_ref7$suppressSeconds","_ref7$includeOffset","_ref7$includePrefix","_ref7$extendedZone","_ref7$format","_ref7$precision","toRFC2822","toHTTP","toSQLDate","toSQLTime","_ref8","_ref8$includeOffset","_ref8$includeZone","includeZone","_ref8$includeOffsetSp","includeOffsetSpace","toSQL","toSeconds","toUnixInteger","toBSON","includeConfig","otherDateTime","otherIsLater","durOpts","diffed","diffNow","until","inputMs","adjustedToZone","toRelative","padding","toRelativeCalendar","every","fromFormatExplain","_options$locale","_options$numberingSys","fromStringExplain","buildFormatParser","_options2","_options2$locale","_options2$numberingSy","fromFormatParser","formatParser","_opts2","_opts2$locale","_opts2$numberingSyste","_formatParser$explain","dateTimeish","VERSION"],"mappings":"AAAA,IAAIA,MAAQ,SAAWC,GACrB,aAEA,SAASC,EAAkBC,EAAQC,GACjC,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAME,OAAQD,CAAC,GAAI,CACrC,IAAIE,EAAaH,EAAMC,GACvBE,EAAWC,WAAaD,EAAWC,YAAc,CAAA,EACjDD,EAAWE,aAAe,CAAA,EACtB,UAAWF,IAAYA,EAAWG,SAAW,CAAA,GACjDC,OAAOC,eAAeT,EAuJ1B,SAAwBU,GAClBC,EAXN,SAAsBC,EAAOC,GAC3B,GAAqB,UAAjB,OAAOD,GAAgC,OAAVA,EAAgB,OAAOA,EACxD,IAAIE,EAAOF,EAAMG,OAAOC,aACxB,GAAaC,KAAAA,IAATH,EAKJ,OAAiB,WAATD,EAAoBK,OAASC,QAAQP,CAAK,EAJ5CQ,EAAMN,EAAKO,KAAKT,EAAOC,GAAQ,SAAS,EAC5C,GAAmB,UAAf,OAAOO,EAAkB,OAAOA,EACpC,MAAM,IAAIE,UAAU,8CAA8C,CAGtE,EAEyBZ,EAAK,QAAQ,EACpC,MAAsB,UAAf,OAAOC,EAAmBA,EAAMO,OAAOP,CAAG,CACnD,EA1JiDP,EAAWO,GAAG,EAAGP,CAAU,CAC1E,CACF,CACA,SAASmB,EAAaC,EAAaC,EAAYC,GACzCD,GAAY1B,EAAkByB,EAAYG,UAAWF,CAAU,EAC/DC,GAAa3B,EAAkByB,EAAaE,CAAW,EAC3DlB,OAAOC,eAAee,EAAa,YAAa,CAC9CjB,SAAU,CAAA,CACZ,CAAC,CAEH,CACA,SAASqB,IAYP,OAXAA,EAAWpB,OAAOqB,OAASrB,OAAOqB,OAAOC,KAAK,EAAI,SAAU9B,GAC1D,IAAK,IAAIE,EAAI,EAAGA,EAAI6B,UAAU5B,OAAQD,CAAC,GAAI,CACzC,IACSS,EADLqB,EAASD,UAAU7B,GACvB,IAASS,KAAOqB,EACVxB,OAAOmB,UAAUM,eAAeZ,KAAKW,EAAQrB,CAAG,IAClDX,EAAOW,GAAOqB,EAAOrB,GAG3B,CACA,OAAOX,CACT,GACgBkC,MAAMC,KAAMJ,SAAS,CACvC,CACA,SAASK,EAAeC,EAAUC,GAChCD,EAASV,UAAYnB,OAAO+B,OAAOD,EAAWX,SAAS,EAEvDa,EADAH,EAASV,UAAUc,YAAcJ,EACPC,CAAU,CACtC,CACA,SAASI,EAAgBC,GAIvB,OAHAD,EAAkBlC,OAAOoC,eAAiBpC,OAAOqC,eAAef,KAAK,EAAI,SAAyBa,GAChG,OAAOA,EAAEG,WAAatC,OAAOqC,eAAeF,CAAC,CAC/C,GACuBA,CAAC,CAC1B,CACA,SAASH,EAAgBG,EAAGI,GAK1B,OAJAP,EAAkBhC,OAAOoC,eAAiBpC,OAAOoC,eAAed,KAAK,EAAI,SAAyBa,EAAGI,GAEnG,OADAJ,EAAEG,UAAYC,EACPJ,CACT,GACuBA,EAAGI,CAAC,CAC7B,CAYA,SAASC,EAAWC,EAAQC,EAAMC,GAahC,OATEH,EAfJ,WACE,GAAuB,aAAnB,OAAOI,SAA4BA,QAAQC,WAC3CD,CAAAA,QAAQC,UAAUC,KAAtB,CACA,GAAqB,YAAjB,OAAOC,MAAsB,OAAO,EACxC,IAEE,OADAC,QAAQ7B,UAAU8B,QAAQpC,KAAK+B,QAAQC,UAAUG,QAAS,GAAI,YAAc,CAAC,EAA7EA,CAIF,CAFE,MAAOE,IAL+B,CAQ1C,EAEgC,EACfN,QAAQC,UAAUvB,KAAK,EAEvB,SAAoBmB,EAAQC,EAAMC,GAC7C,IAAIQ,EAAI,CAAC,MACTA,EAAEC,KAAK1B,MAAMyB,EAAGT,CAAI,EAEhBW,EAAW,IADGC,SAAShC,KAAKI,MAAMe,EAAQU,CAAC,GAG/C,OADIR,GAAOX,EAAgBqB,EAAUV,EAAMxB,SAAS,EAC7CkC,CACT,GAEgB3B,MAAM,KAAMH,SAAS,CACzC,CAIA,SAASgC,EAAiBZ,GACxB,IAAIa,EAAwB,YAAf,OAAOC,IAAqB,IAAIA,IAAQhD,KAAAA,EAuBrD,OAtBmB,SAA0BkC,GAC3C,GAAc,OAAVA,GALyD,CAAC,IAAzDW,SAASI,SAAS7C,KAKkB8B,CALX,EAAEgB,QAAQ,eAAe,EAKN,OAAOhB,EACxD,GAAqB,YAAjB,OAAOA,EACT,MAAM,IAAI7B,UAAU,oDAAoD,EAE1E,GAAsB,KAAA,IAAX0C,EAAwB,CACjC,GAAIA,EAAOI,IAAIjB,CAAK,EAAG,OAAOa,EAAOK,IAAIlB,CAAK,EAC9Ca,EAAOM,IAAInB,EAAOoB,CAAO,CAC3B,CACA,SAASA,IACP,OAAOvB,EAAWG,EAAOpB,UAAWW,EAAgBP,IAAI,EAAEM,WAAW,CACvE,CASA,OARA8B,EAAQ5C,UAAYnB,OAAO+B,OAAOY,EAAMxB,UAAW,CACjDc,YAAa,CACX+B,MAAOD,EACPlE,WAAY,CAAA,EACZE,SAAU,CAAA,EACVD,aAAc,CAAA,CAChB,CACF,CAAC,EACMkC,EAAgB+B,EAASpB,CAAK,CACvC,EACwBA,CAAK,CAC/B,CACA,SAASsB,EAA8BzC,EAAQ0C,GAC7C,GAAc,MAAV1C,EAAgB,MAAO,GAI3B,IAHA,IAEIrB,EAFAX,EAAS,GACT2E,EAAanE,OAAOoE,KAAK5C,CAAM,EAE9B9B,EAAI,EAAGA,EAAIyE,EAAWxE,OAAQD,CAAC,GAClCS,EAAMgE,EAAWzE,GACY,GAAzBwE,EAASP,QAAQxD,CAAG,IACxBX,EAAOW,GAAOqB,EAAOrB,IAEvB,OAAOX,CACT,CASA,SAAS6E,EAAkBC,EAAKC,IACnB,MAAPA,GAAeA,EAAMD,EAAI3E,UAAQ4E,EAAMD,EAAI3E,QAC/C,IAAK,IAAID,EAAI,EAAG8E,EAAO,IAAIC,MAAMF,CAAG,EAAG7E,EAAI6E,EAAK7E,CAAC,GAAI8E,EAAK9E,GAAK4E,EAAI5E,GACnE,OAAO8E,CACT,CACA,SAASE,EAAgCvC,EAAGwC,GAC1C,IAIMjF,EAJFkF,EAAuB,aAAlB,OAAOrE,QAA0B4B,EAAE5B,OAAOsE,WAAa1C,EAAE,cAClE,GAAIyC,EAAI,OAAQA,EAAKA,EAAG/D,KAAKsB,CAAC,GAAG2C,KAAKxD,KAAKsD,CAAE,EAC7C,GAAIH,MAAMM,QAAQ5C,CAAC,IAAMyC,EAhB3B,SAAqCzC,EAAG6C,GACtC,IAEIC,EAFJ,GAAK9C,EACL,MAAiB,UAAb,OAAOA,EAAuBkC,EAAkBlC,EAAG6C,CAAM,EAGnD,SAD2BC,EAA3B,YADNA,EAAIjF,OAAOmB,UAAUuC,SAAS7C,KAAKsB,CAAC,EAAE+C,MAAM,EAAG,CAAC,CAAC,IAC/B/C,EAAEF,YAAiBE,EAAEF,YAAYkD,KACnDF,IAAqB,QAANA,EAAoBR,MAAMW,KAAKjD,CAAC,EACzC,cAAN8C,GAAqB,2CAA2CI,KAAKJ,CAAC,EAAUZ,EAAkBlC,EAAG6C,CAAM,EAA/G,KAAA,CACF,EAS4D7C,CAAC,IAAMwC,GAAkBxC,GAAyB,UAApB,OAAOA,EAAExC,OAG/F,OAFIiF,IAAIzC,EAAIyC,GACRlF,EAAI,EACD,WACL,OAAIA,GAAKyC,EAAExC,OAAe,CACxB2F,KAAM,CAAA,CACR,EACO,CACLA,KAAM,CAAA,EACNtB,MAAO7B,EAAEzC,CAAC,GACZ,CACF,EAEF,MAAM,IAAIoB,UAAU,uIAAuI,CAC7J,CAoBA,IAAIyE,EAA0B,SAAUC,GAEtC,SAASD,IACP,OAAOC,EAAO9D,MAAMC,KAAMJ,SAAS,GAAKI,IAC1C,CACA,OAJAC,EAAe2D,EAAYC,CAAM,EAI1BD,CACT,EAAgBhC,EAAiBkC,KAAK,CAAC,EAInCC,EAAoC,SAAUC,GAEhD,SAASD,EAAqBE,GAC5B,OAAOD,EAAY9E,KAAKc,KAAM,qBAAuBiE,EAAOC,UAAU,CAAC,GAAKlE,IAC9E,CACA,OAJAC,EAAe8D,EAAsBC,CAAW,EAIzCD,CACT,EAAEH,CAAU,EAKRO,EAAoC,SAAUC,GAEhD,SAASD,EAAqBF,GAC5B,OAAOG,EAAalF,KAAKc,KAAM,qBAAuBiE,EAAOC,UAAU,CAAC,GAAKlE,IAC/E,CACA,OAJAC,EAAekE,EAAsBC,CAAY,EAI1CD,CACT,EAAEP,CAAU,EAKRS,EAAoC,SAAUC,GAEhD,SAASD,EAAqBJ,GAC5B,OAAOK,EAAapF,KAAKc,KAAM,qBAAuBiE,EAAOC,UAAU,CAAC,GAAKlE,IAC/E,CACA,OAJAC,EAAeoE,EAAsBC,CAAY,EAI1CD,CACT,EAAET,CAAU,EAKRW,EAA6C,SAAUC,GAEzD,SAASD,IACP,OAAOC,EAAazE,MAAMC,KAAMJ,SAAS,GAAKI,IAChD,CACA,OAJAC,EAAesE,EAA+BC,CAAY,EAInDD,CACT,EAAEX,CAAU,EAKRa,EAAgC,SAAUC,GAE5C,SAASD,EAAiBE,GACxB,OAAOD,EAAaxF,KAAKc,KAAM,gBAAkB2E,CAAI,GAAK3E,IAC5D,CACA,OAJAC,EAAewE,EAAkBC,CAAY,EAItCD,CACT,EAAEb,CAAU,EAKRgB,EAAoC,SAAUC,GAEhD,SAASD,IACP,OAAOC,EAAa9E,MAAMC,KAAMJ,SAAS,GAAKI,IAChD,CACA,OAJAC,EAAe2E,EAAsBC,CAAY,EAI1CD,CACT,EAAEhB,CAAU,EAKRkB,EAAmC,SAAUC,GAE/C,SAASD,IACP,OAAOC,EAAa7F,KAAKc,KAAM,2BAA2B,GAAKA,IACjE,CACA,OAJAC,EAAe6E,EAAqBC,CAAY,EAIzCD,CACT,EAAElB,CAAU,EAMRN,EAAI,UACN0B,EAAI,QACJC,EAAI,OACFC,EAAa,CACfC,KAAM7B,EACN8B,MAAO9B,EACP+B,IAAK/B,CACP,EACIgC,EAAW,CACbH,KAAM7B,EACN8B,MAAOJ,EACPK,IAAK/B,CACP,EACIiC,EAAwB,CAC1BJ,KAAM7B,EACN8B,MAAOJ,EACPK,IAAK/B,EACLkC,QAASR,CACX,EACIS,EAAY,CACdN,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,CACP,EACIoC,EAAY,CACdP,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,EACLkC,QAASP,CACX,EACIU,EAAc,CAChBC,KAAMtC,EACNuC,OAAQvC,CACV,EACIwC,GAAoB,CACtBF,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,CACV,EACI0C,GAAyB,CAC3BJ,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR2C,aAAcjB,CAChB,EACIkB,GAAwB,CAC1BN,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR2C,aAAchB,CAChB,EACIkB,GAAiB,CACnBP,KAAMtC,EACNuC,OAAQvC,EACR8C,UAAW,KACb,EACIC,GAAuB,CACzBT,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR8C,UAAW,KACb,EACIE,GAA4B,CAC9BV,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR8C,UAAW,MACXH,aAAcjB,CAChB,EACIuB,GAA2B,CAC7BX,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR8C,UAAW,MACXH,aAAchB,CAChB,EACIuB,GAAiB,CACnBrB,KAAM7B,EACN8B,MAAO9B,EACP+B,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,CACV,EACImD,GAA8B,CAChCtB,KAAM7B,EACN8B,MAAO9B,EACP+B,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,CACV,EACIoD,GAAe,CACjBvB,KAAM7B,EACN8B,MAAOJ,EACPK,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,CACV,EACIqD,GAA4B,CAC9BxB,KAAM7B,EACN8B,MAAOJ,EACPK,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,CACV,EACIsD,GAA4B,CAC9BzB,KAAM7B,EACN8B,MAAOJ,EACPK,IAAK/B,EACLkC,QAASR,EACTY,KAAMtC,EACNuC,OAAQvC,CACV,EACIuD,GAAgB,CAClB1B,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,EACR2C,aAAcjB,CAChB,EACI8B,GAA6B,CAC/B3B,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,EACLsC,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR2C,aAAcjB,CAChB,EACI+B,GAAgB,CAClB5B,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,EACLkC,QAASP,EACTW,KAAMtC,EACNuC,OAAQvC,EACR2C,aAAchB,CAChB,EACI+B,GAA6B,CAC/B7B,KAAM7B,EACN8B,MAAOH,EACPI,IAAK/B,EACLkC,QAASP,EACTW,KAAMtC,EACNuC,OAAQvC,EACRyC,OAAQzC,EACR2C,aAAchB,CAChB,EAKIgC,EAAoB,WACtB,SAASA,KACT,IAAIC,EAASD,EAAKzH,UAsGlB,OA5FA0H,EAAOC,WAAa,SAAoBC,EAAIC,GAC1C,MAAM,IAAIvC,CACZ,EAUAoC,EAAOI,aAAe,SAAsBF,EAAIG,GAC9C,MAAM,IAAIzC,CACZ,EAQAoC,EAAOM,OAAS,SAAgBJ,GAC9B,MAAM,IAAItC,CACZ,EAQAoC,EAAOO,OAAS,SAAgBC,GAC9B,MAAM,IAAI5C,CACZ,EAOA1F,EAAa6H,EAAM,CAAC,CAClBzI,IAAK,OACL0D,IAMA,WACE,MAAM,IAAI4C,CACZ,CAOF,EAAG,CACDtG,IAAK,OACL0D,IAAK,WACH,MAAM,IAAI4C,CACZ,CAQF,EAAG,CACDtG,IAAK,WACL0D,IAAK,WACH,OAAOlC,KAAKwD,IACd,CAOF,EAAG,CACDhF,IAAK,cACL0D,IAAK,WACH,MAAM,IAAI4C,CACZ,CACF,EAAG,CACDtG,IAAK,UACL0D,IAAK,WACH,MAAM,IAAI4C,CACZ,CACF,EAAE,EACKmC,CACT,EAAE,EAEEU,GAAc,KAMdC,GAA0B,SAAUC,GAEtC,SAASD,IACP,OAAOC,EAAM9H,MAAMC,KAAMJ,SAAS,GAAKI,IACzC,CAHAC,EAAe2H,EAAYC,CAAK,EAIhC,IAAIX,EAASU,EAAWpI,UA+DxB,OA7DA0H,EAAOC,WAAa,SAAoBC,EAAIU,GAG1C,OAAOC,GAAcX,EAFRU,EAAKP,OACPO,EAAKE,MACuB,CACzC,EAGAd,EAAOI,aAAe,SAAwBF,EAAIG,GAChD,OAAOD,GAAatH,KAAKwH,OAAOJ,CAAE,EAAGG,CAAM,CAC7C,EAGAL,EAAOM,OAAS,SAAgBJ,GAC9B,MAAO,CAAC,IAAIa,KAAKb,CAAE,EAAEc,kBAAkB,CACzC,EAGAhB,EAAOO,OAAS,SAAgBC,GAC9B,MAA0B,WAAnBA,EAAUS,IACnB,EAGA/I,EAAawI,EAAY,CAAC,CACxBpJ,IAAK,OACL0D,IACA,WACE,MAAO,QACT,CAGF,EAAG,CACD1D,IAAK,OACL0D,IAAK,WACH,OAAO,IAAIkG,KAAKC,gBAAiBC,gBAAgB,EAAEC,QACrD,CAGF,EAAG,CACD/J,IAAK,cACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,EAAG,CACD1D,IAAK,UACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,GAAI,CAAC,CACH1D,IAAK,WACL0D,IAKA,WAIE,OAFEyF,GADkB,OAAhBA,GACY,IAAIC,EAEbD,EACT,CACF,EAAE,EACKC,CACT,EAAEX,CAAI,EAEFuB,GAAW,IAAI1G,IAmBnB,IAAI2G,GAAY,CACdtD,KAAM,EACNC,MAAO,EACPC,IAAK,EACLqD,IAAK,EACL9C,KAAM,EACNC,OAAQ,EACRE,OAAQ,CACV,EA6BA,IAAI4C,GAAgB,IAAI7G,IAKpB8G,EAAwB,SAAUf,GAwDpC,SAASe,EAASpF,GAChB,IACAqF,EAAQhB,EAAM3I,KAAKc,IAAI,GAAKA,KAK5B,OAHA6I,EAAMC,SAAWtF,EAEjBqF,EAAME,MAAQH,EAASI,YAAYxF,CAAI,EAChCqF,CACT,CA/DA5I,EAAe2I,EAAUf,CAAK,EAK9Be,EAASxI,OAAS,SAAgBoD,GAChC,IAAIyF,EAAON,GAAczG,IAAIsB,CAAI,EAIjC,OAHa1E,KAAAA,IAATmK,GACFN,GAAcxG,IAAIqB,EAAMyF,EAAO,IAAIL,EAASpF,CAAI,CAAC,EAE5CyF,CACT,EAMAL,EAASM,WAAa,WACpBP,GAAcQ,MAAM,EACpBX,GAASW,MAAM,CACjB,EAUAP,EAASQ,iBAAmB,SAA0BpE,GACpD,OAAOhF,KAAKgJ,YAAYhE,CAAC,CAC3B,EAUA4D,EAASI,YAAc,SAAqBC,GAC1C,GAAI,CAACA,EACH,MAAO,CAAA,EAET,IAIE,OAHA,IAAIb,KAAKC,eAAe,QAAS,CAC/BE,SAAUU,CACZ,CAAC,EAAE1B,OAAO,EACH,CAAA,CAGT,CAFE,MAAOhG,GACP,MAAO,CAAA,CACT,CACF,EAgBA,IAAI2F,EAAS0B,EAASpJ,UAqHtB,OA3GA0H,EAAOC,WAAa,SAAoBC,EAAIU,GAG1C,OAAOC,GAAcX,EAFRU,EAAKP,OACPO,EAAKE,OACyBhI,KAAKwD,IAAI,CACpD,EAUA0D,EAAOI,aAAe,SAAwBF,EAAIG,GAChD,OAAOD,GAAatH,KAAKwH,OAAOJ,CAAE,EAAGG,CAAM,CAC7C,EAQAL,EAAOM,OAAS,SAAgBJ,GAC9B,IAOE/B,EACAgE,EAEAxD,EArJeyD,EAAKC,EAItBC,EAwJIC,EAWAC,EA5BJ,MAAK1J,CAAAA,KAAK+I,QACNQ,EAAO,IAAItB,KAAKb,CAAE,EAClBuC,MAAMJ,CAAI,GAFUK,KAtKXd,EAyKK9I,KAAKwD,KAvKb1E,KAAAA,KADRwK,EAAMd,GAAStG,IAAI4G,CAAQ,KAE7BQ,EAAM,IAAIlB,KAAKC,eAAe,QAAS,CACrCwB,OAAQ,CAAA,EACRtB,SAAUO,EACV3D,KAAM,UACNC,MAAO,UACPC,IAAK,UACLO,KAAM,UACNC,OAAQ,UACRE,OAAQ,UACR2C,IAAK,OACP,CAAC,EACDF,GAASrG,IAAI2G,EAAUQ,CAAG,GA6JxBnE,GADE2E,GADAR,EAzJCA,GA0JWS,cAnIpB,SAAqBT,EAAKC,GAGxB,IAFA,IAAIS,EAAYV,EAAIS,cAAcR,CAAI,EAClCU,EAAS,GACJlM,EAAI,EAAGA,EAAIiM,EAAUhM,OAAQD,CAAC,GAAI,CACzC,IAAImM,EAAeF,EAAUjM,GAC3BoK,EAAO+B,EAAa/B,KACpB9F,EAAQ6H,EAAa7H,MACnB8H,EAAM1B,GAAUN,GACP,QAATA,EACF8B,EAAOE,GAAO9H,EACJ+H,EAAYD,CAAG,IACzBF,EAAOE,GAAOE,SAAShI,EAAO,EAAE,EAEpC,CACA,OAAO4H,CACT,EAoHgDX,EAAKC,CAAI,GA/I/BA,EA+IoDA,EA9IxES,GADeV,EA+IoDA,GA9InD/B,OAAOgC,CAAI,EAAEe,QAAQ,UAAW,EAAE,EAEpDC,GAASC,EADA,kDAAkDC,KAAKT,CAAS,GACzD,GAChBR,EAAOgB,EAAO,GAMT,CALGA,EAAO,GAKFD,EAAQf,EAJXgB,EAAO,GACTA,EAAO,GACLA,EAAO,GACPA,EAAO,MAuIF,GACbpF,EAAQ0E,EAAM,GACdzE,EAAMyE,EAAM,GACZT,EAASS,EAAM,GACflE,EAAOkE,EAAM,GACbjE,EAASiE,EAAM,GACf/D,EAAS+D,EAAM,GAMbL,EAAwB,KAAT7D,EAAc,EAAIA,EAWjC8D,GADAgB,EAAO,CAACnB,GACM,KAVNoB,GAAa,CACvBxF,KANAA,EADa,OAAXkE,EACuB,EAAjBuB,KAAKC,IAAI1F,CAAI,EAMfA,EACNC,MAAOA,EACPC,IAAKA,EACLO,KAAM6D,EACN5D,OAAQA,EACRE,OAAQA,EACR+E,YAAa,CACf,CAAC,GAGDJ,GAAgB,GAARhB,EAAYA,EAAO,IAAOA,IACV,IAC1B,EAQAxC,EAAOO,OAAS,SAAgBC,GAC9B,MAA0B,SAAnBA,EAAUS,MAAmBT,EAAUlE,OAASxD,KAAKwD,IAC9D,EAOApE,EAAawJ,EAAU,CAAC,CACtBpK,IAAK,OACL0D,IAAK,WACH,MAAO,MACT,CAOF,EAAG,CACD1D,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAK8I,QACd,CAQF,EAAG,CACDtK,IAAK,cACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,EAAG,CACD1D,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK+I,KACd,CACF,EAAE,EACKH,CACT,EAAE3B,CAAI,EAEF8D,GAAY,CAAC,QACfC,GAAa,CAAC,QAAS,SAIrBC,GAAc,GAalB,IAAIC,GAAc,IAAIpJ,IACtB,SAASqJ,GAAaC,EAAW/D,GAClB,KAAA,IAATA,IACFA,EAAO,IAET,IAAI7I,EAAM6M,KAAKC,UAAU,CAACF,EAAW/D,EAAK,EACtCiC,EAAM4B,GAAYhJ,IAAI1D,CAAG,EAK7B,OAJYM,KAAAA,IAARwK,IACFA,EAAM,IAAIlB,KAAKC,eAAe+C,EAAW/D,CAAI,EAC7C6D,GAAY/I,IAAI3D,EAAK8K,CAAG,GAEnBA,CACT,CACA,IAAIiC,GAAe,IAAIzJ,IAavB,IAAI0J,GAAe,IAAI1J,IAgBvB,IAAI2J,GAAiB,KASrB,IAAIC,GAA2B,IAAI5J,IACnC,SAAS6J,GAA4BP,GACnC,IAAI/D,EAAOqE,GAAyBxJ,IAAIkJ,CAAS,EAKjD,OAJatM,KAAAA,IAATuI,IACFA,EAAO,IAAIe,KAAKC,eAAe+C,CAAS,EAAE9C,gBAAgB,EAC1DoD,GAAyBvJ,IAAIiJ,EAAW/D,CAAI,GAEvCA,CACT,CACA,IAAIuE,GAAgB,IAAI9J,IAmFxB,SAAS+J,GAAUC,EAAK9N,EAAQ+N,EAAWC,GACrCC,EAAOH,EAAII,YAAY,EAC3B,MAAa,UAATD,EACK,MACW,OAATA,EACFF,EAEAC,GAFUhO,CAAM,CAI3B,CAYA,IAAImO,GAAmC,WACrC,SAASA,EAAoBC,EAAMC,EAAahF,GAC9CrH,KAAKsM,MAAQjF,EAAKiF,OAAS,EAC3BtM,KAAKuM,MAAQlF,EAAKkF,OAAS,CAAA,EAC3BlF,EAAKiF,MACHjF,EAAKkF,MACL,IAAIC,EAAYlK,EAA8B+E,EAAM2D,EAAU,GAC5D,CAACqB,GAA+C,EAAhChO,OAAOoE,KAAK+J,CAAS,EAAExO,UACrCyO,EAAWhN,EAAS,CACtBiN,YAAa,CAAA,CACf,EAAGrF,CAAI,EACU,EAAbA,EAAKiF,QAAWG,EAASE,qBAAuBtF,EAAKiF,OACzDtM,KAAK4M,KAlKWxB,EAkKQgB,EAjKf,KAAA,KADkB/E,EAkKGoF,KAhKhCpF,EAAO,IAEL7I,EAAM6M,KAAKC,UAAU,CAACF,EAAW/D,EAAK,EAE9BvI,KAAAA,KADR8N,EAAMrB,GAAarJ,IAAI1D,CAAG,KAE5BoO,EAAM,IAAIxE,KAAKyE,aAAazB,EAAW/D,CAAI,EAC3CkE,GAAapJ,IAAI3D,EAAKoO,CAAG,GAEpBA,GA0JP,CAYA,OAXaT,EAAoB3M,UAC1B+H,OAAS,SAAgBxJ,GAC9B,IACM+O,EADN,OAAI9M,KAAK4M,KACHE,EAAQ9M,KAAKuM,MAAQ3B,KAAK2B,MAAMxO,CAAC,EAAIA,EAClCiC,KAAK4M,IAAIrF,OAAOuF,CAAK,GAIrBC,EADM/M,KAAKuM,MAAQ3B,KAAK2B,MAAMxO,CAAC,EAAIiP,GAAQjP,EAAG,CAAC,EAC9BiC,KAAKsM,KAAK,CAEtC,EACOH,CACT,EAAE,EAIEc,GAAiC,WACnC,SAASA,EAAkBC,EAAId,EAAM/E,GACnCrH,KAAKqH,KAAOA,EAEZ,IAAI8F,EADJnN,KAAKoN,aAAetO,KAAAA,EAwChB2N,GAtCAzM,KAAKqH,KAAKkB,SAEZvI,KAAKkN,GAAKA,EACgB,UAAjBA,EAAGjE,KAAKd,MAQbkF,EAAuB,IADvBC,EAAkBJ,EAAG1F,OAAS,GAAlB,CAAC,GACc,WAAa8F,EAAY,UAAYA,EAClD,IAAdJ,EAAG1F,QAAgBoB,EAASxI,OAAOiN,CAAO,EAAEtE,OAC9CoE,EAAIE,EACJrN,KAAKkN,GAAKA,IAIVC,EAAI,MACJnN,KAAKkN,GAAmB,IAAdA,EAAG1F,OAAe0F,EAAKA,EAAGK,QAAQ,KAAK,EAAEC,KAAK,CACtDC,QAASP,EAAG1F,MACd,CAAC,EACDxH,KAAKoN,aAAeF,EAAGjE,OAEC,WAAjBiE,EAAGjE,KAAKd,KACjBnI,KAAKkN,GAAKA,EACgB,SAAjBA,EAAGjE,KAAKd,KAEjBgF,GADAnN,KAAKkN,GAAKA,GACHjE,KAAKzF,MAKZxD,KAAKkN,GAAKA,EAAGK,QADbJ,EAAI,KACsB,EAAEK,KAAK,CAC/BC,QAASP,EAAG1F,MACd,CAAC,EACDxH,KAAKoN,aAAeF,EAAGjE,MAEVxJ,EAAS,GAAIO,KAAKqH,IAAI,GACrCoF,EAASlE,SAAWkE,EAASlE,UAAY4E,EACzCnN,KAAKsJ,IAAM6B,GAAaiB,EAAMK,CAAQ,CACxC,CACA,IAAIiB,EAAUT,EAAkBzN,UAmChC,OAlCAkO,EAAQnG,OAAS,WACf,OAAIvH,KAAKoN,aAGApN,KAAK+J,cAAc,EAAE4D,IAAI,SAAU7F,GAExC,OADYA,EAAKzF,KAEnB,CAAC,EAAEuL,KAAK,EAAE,EAEL5N,KAAKsJ,IAAI/B,OAAOvH,KAAKkN,GAAGW,SAAS,CAAC,CAC3C,EACAH,EAAQ3D,cAAgB,WACtB,IAAIlB,EAAQ7I,KACR8N,EAAQ9N,KAAKsJ,IAAIS,cAAc/J,KAAKkN,GAAGW,SAAS,CAAC,EACrD,OAAI7N,KAAKoN,aACAU,EAAMH,IAAI,SAAUI,GACzB,MAAkB,iBAAdA,EAAK5F,KAKA1I,EAAS,GAAIsO,EAAM,CACxB1L,MALewG,EAAMuE,aAAajG,WAAW0B,EAAMqE,GAAG9F,GAAI,CAC1DY,OAAQa,EAAMqE,GAAGlF,OACjBT,OAAQsB,EAAMxB,KAAKpB,YACrB,CAAC,CAGD,CAAC,EAEM8H,CAEX,CAAC,EAEID,CACT,EACAJ,EAAQpF,gBAAkB,WACxB,OAAOtI,KAAKsJ,IAAIhB,gBAAgB,CAClC,EACO2E,CACT,EAAE,EAIEe,GAAgC,WAClC,SAASA,EAAiB5B,EAAM6B,EAAW5G,GAhQ7C,IAQMuF,EAyPF5M,KAAKqH,KAAO5H,EAAS,CACnByO,MAAO,MACT,EAAG7G,CAAI,EACH,CAAC4G,GAAaE,GAAY,IAC5BnO,KAAKoO,KArQWhD,EAqQQgB,GAhQ1BiC,EAHAhH,EADW,KAAA,KADkBA,EAqQGA,GAnQzB,GAEGA,GACJiH,KACFC,EAAejM,EAA8B+L,EAJjDhH,EAIwD0D,EAAS,EAC/DvM,EAAM6M,KAAKC,UAAU,CAACF,EAAWmD,EAAa,EAEtCzP,KAAAA,KADR8N,EAAMpB,GAAatJ,IAAI1D,CAAG,KAE5BoO,EAAM,IAAIxE,KAAKoG,mBAAmBpD,EAAW/D,CAAI,EACjDmE,GAAarJ,IAAI3D,EAAKoO,CAAG,GAEpBA,GA0PP,CACA,IAAI6B,EAAUT,EAAiBxO,UAe/B,OAdAiP,EAAQlH,OAAS,SAAgBmH,EAAO/J,GACtC,GAAI3E,KAAKoO,IACP,OAAOpO,KAAKoO,IAAI7G,OAAOmH,EAAO/J,CAAI,EAE3BgK,IA62CehK,EA72CIA,EA62CE+J,EA72CIA,EA62CGE,EA72CI5O,KAAKqH,KAAKuH,QA62CLC,EA72CkC,SAApB7O,KAAKqH,KAAK6G,MAo3CpEY,GANY,KAAA,IAAZF,IACFA,EAAU,UAEG,KAAA,IAAXC,IACFA,EAAS,CAAA,GAEC,CACVE,MAAO,CAAC,OAAQ,OAChBC,SAAU,CAAC,UAAW,QACtBC,OAAQ,CAAC,QAAS,OAClBC,MAAO,CAAC,OAAQ,OAChBC,KAAM,CAAC,MAAO,MAAO,QACrBC,MAAO,CAAC,OAAQ,OAChB3B,QAAS,CAAC,SAAU,QACpB4B,QAAS,CAAC,SAAU,OACtB,GACIC,EAA6D,CAAC,IAAnD,CAAC,QAAS,UAAW,WAAWtN,QAAQ2C,CAAI,EAC3D,GAAgB,SAAZiK,GAAsBU,EAAU,CAClC,IAAIC,EAAiB,SAAT5K,EACZ,OAAQ+J,GACN,KAAK,EACH,OAAOa,EAAQ,WAAa,QAAUT,EAAMnK,GAAM,GACpD,IAAK,CAAC,EACJ,OAAO4K,EAAQ,YAAc,QAAUT,EAAMnK,GAAM,GACrD,KAAK,EACH,OAAO4K,EAAQ,QAAU,QAAUT,EAAMnK,GAAM,EACnD,CACF,CAEA,IAAI6K,EAAWnR,OAAOoR,GAAGf,EAAO,CAAC,CAAC,GAAKA,EAAQ,EAE7CgB,EAAwB,KAAbC,EADA/E,KAAKC,IAAI6D,CAAK,GAEzBkB,EAAWd,EAAMnK,GACjBkL,EAAUhB,EAASa,CAAAA,GAAyBE,EAAS,IAAMA,EAAS,GAAKF,EAAWZ,EAAMnK,GAAM,GAAKA,EACvG,OAAO6K,EAAWG,EAAW,IAAME,EAAU,OAAS,MAAQF,EAAW,IAAME,CA94C/E,EACApB,EAAQ1E,cAAgB,SAAuB2E,EAAO/J,GACpD,OAAI3E,KAAKoO,IACApO,KAAKoO,IAAIrE,cAAc2E,EAAO/J,CAAI,EAElC,EAEX,EACOqJ,CACT,EAAE,EACE8B,GAAuB,CACzBC,SAAU,EACVC,YAAa,EACbC,QAAS,CAAC,EAAG,EACf,EAKIC,EAAsB,WAgCxB,SAASA,EAAOlI,EAAQmI,EAAWC,EAAgBC,EAAcC,GAC/D,IAAIC,EAnRR,SAA2BC,GAYzB,IAAIC,EAASD,EAAUxO,QAAQ,KAAK,EAKpC,GAAe,CAAC,KAAZ0O,GAHFF,EADa,CAAC,IAAZC,EACUD,EAAUG,UAAU,EAAGF,CAAM,EAE9BD,GAAUxO,QAAQ,KAAK,GAElC,MAAO,CAACwO,GAIR,IACEI,EAAUzF,GAAaqF,CAAS,EAAElI,gBAAgB,EAClDuI,EAAcL,CAKhB,CAJE,MAAOjP,GACP,IAAIuP,EAAUN,EAAUG,UAAU,EAAGD,CAAM,EAC3CE,EAAUzF,GAAa2F,CAAO,EAAExI,gBAAgB,EAChDuI,EAAcC,CAChB,CAIA,MAAO,CAACD,GAHJE,EAAWH,GACcI,gBAChBD,EAASE,SAG1B,EAgP+CjJ,CAAM,EAC/CkJ,EAAeX,EAAmB,GAClCY,EAAwBZ,EAAmB,GAC3Ca,EAAuBb,EAAmB,GAC5CvQ,KAAKgI,OAASkJ,EACdlR,KAAKgR,gBAAkBb,GAAagB,GAAyB,KAC7DnR,KAAKoQ,eAAiBA,GAAkBgB,GAAwB,KAChEpR,KAAKqQ,aAAeA,EACpBrQ,KAAKoM,MAvPiBoE,EAuPOxQ,KAAKgI,OAvPDgJ,EAuPShR,KAAKgR,kBAvPGZ,EAuPcpQ,KAAKoQ,iBAtPjDY,KACfR,EAAUa,SAAS,KAAK,IAC3Bb,GAAa,MAEXJ,IACFI,GAAa,OAASJ,GAEpBY,KACFR,GAAa,OAASQ,GAIjBR,GA2OPxQ,KAAKsR,cAAgB,CACnB/J,OAAQ,GACRgK,WAAY,EACd,EACAvR,KAAKwR,YAAc,CACjBjK,OAAQ,GACRgK,WAAY,EACd,EACAvR,KAAKyR,cAAgB,KACrBzR,KAAK0R,SAAW,GAChB1R,KAAKsQ,gBAAkBA,EACvBtQ,KAAK2R,kBAAoB,IAC3B,CArDAzB,EAAO0B,SAAW,SAAkBvK,GAClC,OAAO6I,EAAO9P,OAAOiH,EAAKW,OAAQX,EAAK2J,gBAAiB3J,EAAK+I,eAAgB/I,EAAKgJ,aAAchJ,EAAKwK,WAAW,CAClH,EACA3B,EAAO9P,OAAS,SAAgB4H,EAAQgJ,EAAiBZ,EAAgBC,EAAcwB,GACjE,KAAA,IAAhBA,IACFA,EAAc,CAAA,GAEZvB,EAAkBtI,GAAU8J,EAASC,cAMzC,OAAO,IAAI7B,EAJGI,IAAoBuB,EAAc,QA3R9CpG,GAAAA,KAGe,IAAIrD,KAAKC,gBAAiBC,gBAAgB,EAAEN,QAyRtCgJ,GAAmBc,EAASE,uBAC7B5B,GAAkB0B,EAASG,sBAC7BC,GAAqB7B,CAAY,GAAKyB,EAASK,oBACU7B,CAAe,CAC9F,EACAJ,EAAOhH,WAAa,WAClBuC,GAAiB,KACjBP,GAAY/B,MAAM,EAClBoC,GAAapC,MAAM,EACnBqC,GAAarC,MAAM,EACnBuC,GAAyBvC,MAAM,EAC/ByC,GAAczC,MAAM,CACtB,EACA+G,EAAOkC,WAAa,SAAoBC,GACtC,IAAIvI,EAAkB,KAAA,IAAVuI,EAAmB,GAAKA,EAClCrK,EAAS8B,EAAM9B,OACfgJ,EAAkBlH,EAAMkH,gBACxBZ,EAAiBtG,EAAMsG,eACvBC,EAAevG,EAAMuG,aACvB,OAAOH,EAAO9P,OAAO4H,EAAQgJ,EAAiBZ,EAAgBC,CAAY,CAC5E,EAwBA,IAAIiC,EAAUpC,EAAO1Q,UA2LrB,OA1LA8S,EAAQpG,YAAc,WACpB,IAAIqG,EAAevS,KAAKiO,UAAU,EAC9BuE,EAAiB,EAA0B,OAAzBxS,KAAKgR,iBAAqD,SAAzBhR,KAAKgR,iBAAwD,OAAxBhR,KAAKoQ,gBAAmD,YAAxBpQ,KAAKoQ,gBACjI,OAAOmC,GAAgBC,EAAiB,KAAO,MACjD,EACAF,EAAQG,MAAQ,SAAeC,GAC7B,OAAKA,GAAoD,IAA5CrU,OAAOsU,oBAAoBD,CAAI,EAAE1U,OAGrCkS,EAAO9P,OAAOsS,EAAK1K,QAAUhI,KAAKsQ,gBAAiBoC,EAAK1B,iBAAmBhR,KAAKgR,gBAAiB0B,EAAKtC,gBAAkBpQ,KAAKoQ,eAAgB8B,GAAqBQ,EAAKrC,YAAY,GAAKrQ,KAAKqQ,aAAcqC,EAAKb,aAAe,CAAA,CAAK,EAFpO7R,IAIX,EACAsS,EAAQM,cAAgB,SAAuBF,GAI7C,OAAO1S,KAAKyS,MAAMhT,EAAS,GAFzBiT,EADW,KAAA,IAATA,EACK,GAEsBA,EAAM,CACnCb,YAAa,CAAA,CACf,CAAC,CAAC,CACJ,EACAS,EAAQO,kBAAoB,SAA2BH,GAIrD,OAAO1S,KAAKyS,MAAMhT,EAAS,GAFzBiT,EADW,KAAA,IAATA,EACK,GAEsBA,EAAM,CACnCb,YAAa,CAAA,CACf,CAAC,CAAC,CACJ,EACAS,EAAQrD,OAAS,SAAkBjR,EAAQuJ,GACzC,IAAIuL,EAAS9S,KAIb,OAHe,KAAA,IAAXuH,IACFA,EAAS,CAAA,GAEJsE,GAAU7L,KAAMhC,EAAQiR,GAAQ,WAIrC,IAAI8D,EAAmC,OAAhBD,EAAO1G,MAAiB0G,EAAO1G,KAAK4G,WAAW,KAAK,EAEvE5G,GADJ7E,GAAU,CAACwL,GACS,CAChB3N,MAAOpH,EACPqH,IAAK,SACP,EAAI,CACFD,MAAOpH,CACT,EACAiV,EAAY1L,EAAS,SAAW,aASlC,OARKuL,EAAOtB,YAAYyB,GAAWjV,KAMjC8U,EAAOtB,YAAYyB,GAAWjV,GA1StC,SAAmBkV,GAEjB,IADA,IAAIC,EAAK,GACApV,EAAI,EAAGA,GAAK,GAAIA,CAAC,GAAI,CAC5B,IAAImP,EAAKkG,EAASC,IAAI,KAAMtV,EAAG,CAAC,EAChCoV,EAAG1R,KAAKyR,EAAEhG,CAAE,CAAC,CACf,CACA,OAAOiG,CACT,EA8RsBJ,EAEV,SAAU7F,GACZ,OAAO4F,EAAOQ,YAAYpG,EAAId,CAAI,EAAE7E,OAAO,CAC7C,EAJiC,SAAU2F,GACzC,OAAO4F,EAAOS,QAAQrG,EAAId,EAAM,OAAO,CACzC,CAGwD,GAEnD0G,EAAOtB,YAAYyB,GAAWjV,EACvC,CAAC,CACH,EACAsU,EAAQkB,SAAW,SAAoBxV,EAAQuJ,GAC7C,IAAIkM,EAASzT,KAIb,OAHe,KAAA,IAAXuH,IACFA,EAAS,CAAA,GAEJsE,GAAU7L,KAAMhC,EAAQwV,GAAU,WACvC,IAAIpH,EAAO7E,EAAS,CAChB/B,QAASxH,EACTmH,KAAM,UACNC,MAAO,OACPC,IAAK,SACP,EAAI,CACFG,QAASxH,CACX,EACAiV,EAAY1L,EAAS,SAAW,aAMlC,OALKkM,EAAOnC,cAAc2B,GAAWjV,KACnCyV,EAAOnC,cAAc2B,GAAWjV,GAvTxC,SAAqBkV,GAEnB,IADA,IAAIC,EAAK,GACApV,EAAI,EAAGA,GAAK,EAAGA,CAAC,GAAI,CAC3B,IAAImP,EAAKkG,EAASC,IAAI,KAAM,GAAI,GAAKtV,CAAC,EACtCoV,EAAG1R,KAAKyR,EAAEhG,CAAE,CAAC,CACf,CACA,OAAOiG,CACT,EAgT8D,SAAUjG,GAC9D,OAAOuG,EAAOF,QAAQrG,EAAId,EAAM,SAAS,CAC3C,CAAC,GAEIqH,EAAOnC,cAAc2B,GAAWjV,EACzC,CAAC,CACH,EACAsU,EAAQoB,UAAY,WAClB,IAAIC,EAAS3T,KACb,OAAO6L,GAAU7L,KAAMlB,KAAAA,EAAW,WAChC,OAAO4U,EACT,EAAG,WAGD,IACMtH,EAQN,OATKuH,EAAOlC,gBACNrF,EAAO,CACTxG,KAAM,UACNQ,UAAW,KACb,EACAuN,EAAOlC,cAAgB,CAAC2B,EAASC,IAAI,KAAM,GAAI,GAAI,CAAC,EAAGD,EAASC,IAAI,KAAM,GAAI,GAAI,EAAE,GAAG1F,IAAI,SAAUT,GACnG,OAAOyG,EAAOJ,QAAQrG,EAAId,EAAM,WAAW,CAC7C,CAAC,GAEIuH,EAAOlC,aAChB,CAAC,CACH,EACAa,EAAQsB,KAAO,SAAgB5V,GAC7B,IAAI6V,EAAS7T,KACb,OAAO6L,GAAU7L,KAAMhC,EAAQ4V,GAAM,WACnC,IAAIxH,EAAO,CACT1D,IAAK1K,CACP,EASA,OALK6V,EAAOnC,SAAS1T,KACnB6V,EAAOnC,SAAS1T,GAAU,CAACoV,EAASC,IAAI,CAAC,GAAI,EAAG,CAAC,EAAGD,EAASC,IAAI,KAAM,EAAG,CAAC,GAAG1F,IAAI,SAAUT,GAC1F,OAAO2G,EAAON,QAAQrG,EAAId,EAAM,KAAK,CACvC,CAAC,GAEIyH,EAAOnC,SAAS1T,EACzB,CAAC,CACH,EACAsU,EAAQiB,QAAU,SAAiBrG,EAAIT,EAAUqH,GAG7CC,EAFO/T,KAAKsT,YAAYpG,EAAIT,CAAQ,EACvB1C,cAAc,EACRiK,KAAK,SAAUC,GAChC,OAAOA,EAAE9L,KAAK+L,YAAY,IAAMJ,CAClC,CAAC,EACH,OAAOC,EAAWA,EAAS1R,MAAQ,IACrC,EACAiQ,EAAQ6B,gBAAkB,SAAyB9M,GAMjD,OAAO,IAAI8E,GAAoBnM,KAAKoM,MAJlC/E,EADW,KAAA,IAATA,EACK,GAIiCA,GAAKgF,aAAerM,KAAKoU,YAAa/M,CAAI,CACtF,EACAiL,EAAQgB,YAAc,SAAqBpG,EAAIT,GAI7C,OAAO,IAAIQ,GAAkBC,EAAIlN,KAAKoM,KAFpCK,EADe,KAAA,IAAbA,EACS,GAE+BA,CAAQ,CACtD,EACA6F,EAAQ+B,aAAe,SAAsBhN,GAI3C,OAHa,KAAA,IAATA,IACFA,EAAO,IAEF,IAAI2G,GAAiBhO,KAAKoM,KAAMpM,KAAKiO,UAAU,EAAG5G,CAAI,CAC/D,EACAiL,EAAQgC,cAAgB,SAAuBjN,GAI7C,OAHa,KAAA,IAATA,IACFA,EAAO,IAnhBQ+D,EAqhBEpL,KAAKoM,KAphBb,KAAA,KADiB/E,EAqhBEA,KAnhB9BA,EAAO,IAEL7I,EAAM6M,KAAKC,UAAU,CAACF,EAAW/D,EAAK,GACtCiC,EAAM2B,GAAYzM,MAEpB8K,EAAM,IAAIlB,KAAKmM,WAAWnJ,EAAW/D,CAAI,EACzC4D,GAAYzM,GAAO8K,GAEdA,EAVT,IAAqB8B,EAIf5M,EACA8K,CAihBJ,EACAgJ,EAAQrE,UAAY,WAClB,MAAuB,OAAhBjO,KAAKgI,QAAiD,UAA9BhI,KAAKgI,OAAOkM,YAAY,GAAiBvI,GAA4B3L,KAAKoM,IAAI,EAAEpE,OAAOgL,WAAW,OAAO,CAC1I,EACAV,EAAQkC,gBAAkB,WACxB,OAAIxU,KAAKqQ,eAEGoE,GAAkB,GApdPrJ,EAudIpL,KAAKgI,QAtd9B0M,EAAO9I,GAAc1J,IAAIkJ,CAAS,KAM9B,gBAAiBsJ,EAFhB,gBAFH1M,EAAS,IAAII,KAAK8H,OAAO9E,CAAS,GAELpD,EAAO2M,YAAY,EAAI3M,EAAO4M,YAG7DF,EAAOjV,EAAS,GAAIqQ,GAAsB4E,CAAI,GAEhD9I,GAAczJ,IAAIiJ,EAAWsJ,CAAI,GAE5BA,GAycI5E,IArdb,IAA2B1E,EAGnBpD,EAFF0M,CAwdJ,EACApC,EAAQuC,eAAiB,WACvB,OAAO7U,KAAKwU,gBAAgB,EAAEzE,QAChC,EACAuC,EAAQwC,sBAAwB,WAC9B,OAAO9U,KAAKwU,gBAAgB,EAAExE,WAChC,EACAsC,EAAQyC,eAAiB,WACvB,OAAO/U,KAAKwU,gBAAgB,EAAEvE,OAChC,EACAqC,EAAQ7K,OAAS,SAAgBuN,GAC/B,OAAOhV,KAAKgI,SAAWgN,EAAMhN,QAAUhI,KAAKgR,kBAAoBgE,EAAMhE,iBAAmBhR,KAAKoQ,iBAAmB4E,EAAM5E,cACzH,EACAkC,EAAQvQ,SAAW,WACjB,MAAO,UAAY/B,KAAKgI,OAAS,KAAOhI,KAAKgR,gBAAkB,KAAOhR,KAAKoQ,eAAiB,GAC9F,EACAhR,EAAa8Q,EAAQ,CAAC,CACpB1R,IAAK,cACL0D,IAAK,WA/YT,IAA6B4J,EAmZvB,OAH8B,MAA1B9L,KAAK2R,oBACP3R,KAAK2R,mBAhZP7F,EADuBA,EAiZwB9L,MAhZ3CgR,iBAA2C,SAAxBlF,EAAIkF,mBAGE,SAAxBlF,EAAIkF,iBAA8B,CAAClF,EAAI9D,QAAU8D,EAAI9D,OAAOgL,WAAW,IAAI,GAAiE,SAA5DrH,GAA4BG,EAAI9D,MAAM,EAAEgJ,kBA+YtHhR,KAAK2R,iBACd,CACF,EAAE,EACKzB,CACT,EAAE,EAEE+E,GAAY,KAMZC,EAA+B,SAAUrN,GA4B3C,SAASqN,EAAgB1N,GACvB,IACAqB,EAAQhB,EAAM3I,KAAKc,IAAI,GAAKA,KAG5B,OADA6I,EAAMiE,MAAQtF,EACPqB,CACT,CAjCA5I,EAAeiV,EAAiBrN,CAAK,EAMrCqN,EAAgBxT,SAAW,SAAkB8F,GAC3C,OAAkB,IAAXA,EAAe0N,EAAgBC,YAAc,IAAID,EAAgB1N,CAAM,CAChF,EAUA0N,EAAgBE,eAAiB,SAAwBpQ,GACvD,GAAIA,EAAG,CACDqQ,EAAIrQ,EAAEsQ,MAAM,uCAAuC,EACvD,GAAID,EACF,OAAO,IAAIH,EAAgBK,GAAaF,EAAE,GAAIA,EAAE,EAAE,CAAC,CAEvD,CACA,OAAO,IACT,EAcA,IAAInO,EAASgO,EAAgB1V,UAiH7B,OA1GA0H,EAAOC,WAAa,WAClB,OAAOnH,KAAKwD,IACd,EAUA0D,EAAOI,aAAe,SAAwBF,EAAIG,GAChD,OAAOD,GAAatH,KAAK8M,MAAOvF,CAAM,CACxC,EAeAL,EAAOM,OAAS,WACd,OAAOxH,KAAK8M,KACd,EAQA5F,EAAOO,OAAS,SAAgBC,GAC9B,MAA0B,UAAnBA,EAAUS,MAAoBT,EAAUoF,QAAU9M,KAAK8M,KAChE,EAQA1N,EAAa8V,EAAiB,CAAC,CAC7B1W,IAAK,OACL0D,IAAK,WACH,MAAO,OACT,CAQF,EAAG,CACD1D,IAAK,OACL0D,IAAK,WACH,OAAsB,IAAflC,KAAK8M,MAAc,MAAQ,MAAQxF,GAAatH,KAAK8M,MAAO,QAAQ,CAC7E,CAQF,EAAG,CACDtO,IAAK,WACL0D,IAAK,WACH,OAAmB,IAAflC,KAAK8M,MACA,UAEA,UAAYxF,GAAa,CAACtH,KAAK8M,MAAO,QAAQ,CAEzD,CACF,EAAG,CACDtO,IAAK,cACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,EAAG,CACD1D,IAAK,UACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,GAAI,CAAC,CACH1D,IAAK,cACL0D,IAKA,WAIE,OAFE+S,GADgB,OAAdA,GACU,IAAIC,EAAgB,CAAC,EAE5BD,EACT,CACF,EAAE,EACKC,CACT,EAAEjO,CAAI,EAMFuO,GAA2B,SAAU3N,GAEvC,SAAS2N,EAAY1M,GACnB,IACAD,EAAQhB,EAAM3I,KAAKc,IAAI,GAAKA,KAG5B,OADA6I,EAAMC,SAAWA,EACVD,CACT,CAPA5I,EAAeuV,EAAa3N,CAAK,EAUjC,IAAIX,EAASsO,EAAYhW,UA+CzB,OA7CA0H,EAAOC,WAAa,WAClB,OAAO,IACT,EAGAD,EAAOI,aAAe,WACpB,MAAO,EACT,EAGAJ,EAAOM,OAAS,WACd,OAAOoC,GACT,EAGA1C,EAAOO,OAAS,WACd,MAAO,CAAA,CACT,EAGArI,EAAaoW,EAAa,CAAC,CACzBhX,IAAK,OACL0D,IAAK,WACH,MAAO,SACT,CAGF,EAAG,CACD1D,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAK8I,QACd,CAGF,EAAG,CACDtK,IAAK,cACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,EAAG,CACD1D,IAAK,UACL0D,IAAK,WACH,MAAO,CAAA,CACT,CACF,EAAE,EACKsT,CACT,EAAEvO,CAAI,EAKN,SAASwO,EAAchX,EAAOiX,GAC5B,IAKMC,EALN,OAAIvL,EAAY3L,CAAK,GAAe,OAAVA,EACjBiX,EACEjX,aAAiBwI,EACnBxI,EA8hBW,UAAb,OA7hBaA,EAEF,aADZkX,EAAUlX,EAAMyV,YAAY,GACEwB,EAAiC,UAAZC,GAAmC,WAAZA,EAA6B/N,GAAWlG,SAA8B,QAAZiU,GAAiC,QAAZA,EAA0BT,EAAgBC,YAAwBD,EAAgBE,eAAeO,CAAO,GAAK/M,EAASxI,OAAO3B,CAAK,EACtRmX,EAASnX,CAAK,EAChByW,EAAgBxT,SAASjD,CAAK,EACX,UAAjB,OAAOA,GAAsB,WAAYA,GAAiC,YAAxB,OAAOA,EAAM+I,OAGjE/I,EAEA,IAAI+W,GAAY/W,CAAK,CAEhC,CAEA,IAAIoX,GAAmB,CACrBC,KAAM,QACNC,QAAS,QACTC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,SAAU,QACVC,KAAM,QACNC,QAAS,wBACTC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,QAAS,QACTC,KAAM,QACNC,KAAM,QACNC,KAAM,QACNC,KAAM,KACR,EACIC,GAAwB,CAC1BrB,KAAM,CAAC,KAAM,MACbC,QAAS,CAAC,KAAM,MAChBC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,SAAU,CAAC,MAAO,OAClBC,KAAM,CAAC,KAAM,MACbE,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,QAAS,CAAC,KAAM,MAChBC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,MACbC,KAAM,CAAC,KAAM,KACf,EACIG,GAAevB,GAAiBQ,QAAQ/L,QAAQ,WAAY,EAAE,EAAE+M,MAAM,EAAE,EA2B5E,IAAIC,GAAkB,IAAIxV,IAI1B,SAASyV,EAAWzP,EAAM0P,GAET,KAAA,IAAXA,IACFA,EAAS,IAFX,IAIIC,EAJkB3P,EAAKkJ,iBAIC,OACxB0G,EAAcJ,GAAgBpV,IAAIuV,CAAE,EAKpCE,GAJgB7Y,KAAAA,IAAhB4Y,IACFA,EAAc,IAAI5V,IAClBwV,GAAgBnV,IAAIsV,EAAIC,CAAW,GAEzBA,EAAYxV,IAAIsV,CAAM,GAKlC,OAJc1Y,KAAAA,IAAV6Y,IACFA,EAAQ,IAAIC,OAAO,GAAK/B,GAAiB4B,GAAMD,CAAM,EACrDE,EAAYvV,IAAIqV,EAAQG,CAAK,GAExBA,CACT,CAEA,IAQEE,GAREC,GAAM,WACN,OAAO7P,KAAK6P,IAAI,CAClB,EACApC,GAAc,SACd3D,GAAgB,KAChBC,GAAyB,KACzBC,GAAwB,KACxB8F,GAAqB,GAErB5F,GAAsB,KAKpBL,EAAwB,WAC1B,SAASA,KA+KT,OA1KAA,EAASkG,YAAc,WACrB9H,EAAOhH,WAAW,EAClBN,EAASM,WAAW,EACpBkK,EAASlK,WAAW,EA5CtBoO,GAAgBnO,MAAM,CA8CtB,EACA/J,EAAa0S,EAAU,KAAM,CAAC,CAC5BtT,IAAK,MACL0D,IAKA,WACE,OAAO4V,EACT,EASA3V,IAAK,SAAamB,GAChBwU,GAAMxU,CACR,CAOF,EAAG,CACD9E,IAAK,cACL0D,IAMA,WACE,OAAOuT,EAAcC,GAAa9N,GAAWlG,QAAQ,CACvD,EAMAS,IAAK,SAAa8G,GAChByM,GAAczM,CAChB,CACF,EAAG,CACDzK,IAAK,gBACL0D,IAAK,WACH,OAAO6P,EACT,EAMA5P,IAAK,SAAa6F,GAChB+J,GAAgB/J,CAClB,CAMF,EAAG,CACDxJ,IAAK,yBACL0D,IAAK,WACH,OAAO8P,EACT,EAMA7P,IAAK,SAAa6O,GAChBgB,GAAyBhB,CAC3B,CAMF,EAAG,CACDxS,IAAK,wBACL0D,IAAK,WACH,OAAO+P,EACT,EAMA9P,IAAK,SAAaiO,GAChB6B,GAAwB7B,CAC1B,CAYF,EAAG,CACD5R,IAAK,sBACL0D,IAAK,WACH,OAAOiQ,EACT,EASAhQ,IAAK,SAAakO,GAChB8B,GAAsBD,GAAqB7B,CAAY,CACzD,CAMF,EAAG,CACD7R,IAAK,qBACL0D,IAAK,WACH,OAAO6V,EACT,EAWA5V,IAAK,SAAa8V,GAChBF,GAAqBE,EAAa,GACpC,CAMF,EAAG,CACDzZ,IAAK,iBACL0D,IAAK,WACH,OAAO2V,EACT,EAMA1V,IAAK,SAAa+V,GAChBL,GAAiBK,CACnB,CACF,EAAE,EACKpG,CACT,EAAE,EAEEqG,EAAuB,WACzB,SAASA,EAAQlU,EAAQmU,GACvBpY,KAAKiE,OAASA,EACdjE,KAAKoY,YAAcA,CACrB,CASA,OARaD,EAAQ3Y,UACd0E,UAAY,WACjB,OAAIlE,KAAKoY,YACApY,KAAKiE,OAAS,KAAOjE,KAAKoY,YAE1BpY,KAAKiE,MAEhB,EACOkU,CACT,EAAE,EAEEE,GAAgB,CAAC,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KACrEC,GAAa,CAAC,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAClE,SAASC,EAAe5T,EAAMtC,GAC5B,OAAO,IAAI8V,EAAQ,oBAAqB,iBAAmB9V,EAAQ,aAAe,OAAOA,EAAQ,UAAYsC,EAAO,oBAAoB,CAC1I,CACA,SAAS6T,GAAUrT,EAAMC,EAAOC,GAC1BoT,EAAI,IAAIxQ,KAAKA,KAAKyQ,IAAIvT,EAAMC,EAAQ,EAAGC,CAAG,CAAC,EAC3CF,EAAO,KAAe,GAARA,GAChBsT,EAAEE,eAAeF,EAAEG,eAAe,EAAI,IAAI,EAExCC,EAAKJ,EAAEK,UAAU,EACrB,OAAc,IAAPD,EAAW,EAAIA,CACxB,CACA,SAASE,GAAe5T,EAAMC,EAAOC,GACnC,OAAOA,GAAO2T,GAAW7T,CAAI,EAAImT,GAAaD,IAAejT,EAAQ,EACvE,CACA,SAAS6T,GAAiB9T,EAAM+T,GAC9B,IAAIC,EAAQH,GAAW7T,CAAI,EAAImT,GAAaD,GAC1Ce,EAASD,EAAME,UAAU,SAAUtb,GACjC,OAAOA,EAAImb,CACb,CAAC,EAEH,MAAO,CACL9T,MAAOgU,EAAS,EAChB/T,IAHM6T,EAAUC,EAAMC,EAIxB,CACF,CACA,SAASE,GAAkBC,EAAYC,GACrC,OAAQD,EAAaC,EAAc,GAAK,EAAI,CAC9C,CAMA,SAASC,GAAgBC,EAASC,EAAoBH,GACzB,KAAA,IAAvBG,IACFA,EAAqB,GAEH,KAAA,IAAhBH,IACFA,EAAc,GAEhB,IAMEI,EANEzU,EAAOuU,EAAQvU,KACjBC,EAAQsU,EAAQtU,MAChBC,EAAMqU,EAAQrU,IACd6T,EAAUH,GAAe5T,EAAMC,EAAOC,CAAG,EACzCG,EAAU8T,GAAkBd,GAAUrT,EAAMC,EAAOC,CAAG,EAAGmU,CAAW,EAClEK,EAAajP,KAAK2B,OAAO2M,EAAU1T,EAAU,GAAKmU,GAAsB,CAAC,EAW7E,OATIE,EAAa,EAEfA,EAAaC,GADbF,EAAWzU,EAAO,EACqBwU,EAAoBH,CAAW,EAC7DK,EAAaC,GAAgB3U,EAAMwU,EAAoBH,CAAW,GAC3EI,EAAWzU,EAAO,EAClB0U,EAAa,GAEbD,EAAWzU,EAEN1F,EAAS,CACdma,SAAUA,EACVC,WAAYA,EACZrU,QAASA,CACX,EAAGuU,GAAWL,CAAO,CAAC,CACxB,CACA,SAASM,GAAgBC,EAAUN,EAAoBH,GAIjC,KAAA,IAAhBA,IACFA,EAAc,GAEhB,IAMErU,EANEyU,EAAWK,EAASL,SACtBC,EAAaI,EAASJ,WACtBrU,EAAUyU,EAASzU,QACnB0U,EAAgBZ,GAAkBd,GAAUoB,EAAU,EARtDD,EADyB,KAAA,IAAvBA,EACmB,EAQoCA,CAAkB,EAAGH,CAAW,EACzFW,EAAaC,EAAWR,CAAQ,EAC9BV,EAAuB,EAAbW,EAAiBrU,EAAU0U,EAAgB,EAAIP,EAWzDU,GATAnB,EAAU,EAEZA,GAAWkB,EADXjV,EAAOyU,EAAW,CACQ,EACPO,EAAVjB,GACT/T,EAAOyU,EAAW,EAClBV,GAAWkB,EAAWR,CAAQ,GAE9BzU,EAAOyU,EAEeX,GAAiB9T,EAAM+T,CAAO,GAGtD,OAAOzZ,EAAS,CACd0F,KAAMA,EACNC,MAJQiV,EAAkBjV,MAK1BC,IAJMgV,EAAkBhV,GAK1B,EAAG0U,GAAWE,CAAQ,CAAC,CACzB,CACA,SAASK,GAAmBC,GAC1B,IAAIpV,EAAOoV,EAASpV,KAIpB,OAAO1F,EAAS,CACd0F,KAAMA,EACN+T,QAHYH,GAAe5T,EAFnBoV,EAASnV,MACXmV,EAASlV,GAC4B,CAI7C,EAAG0U,GAAWQ,CAAQ,CAAC,CACzB,CACA,SAASC,GAAmBC,GAC1B,IAAItV,EAAOsV,EAAYtV,KAEnBuV,EAAqBzB,GAAiB9T,EAD9BsV,EAAYvB,OAC+B,EAGvD,OAAOzZ,EAAS,CACd0F,KAAMA,EACNC,MAJQsV,EAAmBtV,MAK3BC,IAJMqV,EAAmBrV,GAK3B,EAAG0U,GAAWU,CAAW,CAAC,CAC5B,CAQA,SAASE,GAAoBC,EAAK9O,GAEhC,GADyB1B,EAAYwQ,EAAIC,YAAY,GAAMzQ,EAAYwQ,EAAIE,eAAe,GAAM1Q,EAAYwQ,EAAIG,aAAa,EAiB3H,MAAO,CACLpB,mBAAoB,EACpBH,YAAa,CACf,EAjBA,GADsBpP,EAAYwQ,EAAIpV,OAAO,GAAM4E,EAAYwQ,EAAIf,UAAU,GAAMzP,EAAYwQ,EAAIhB,QAAQ,EAU3G,OANKxP,EAAYwQ,EAAIC,YAAY,IAAGD,EAAIpV,QAAUoV,EAAIC,cACjDzQ,EAAYwQ,EAAIE,eAAe,IAAGF,EAAIf,WAAae,EAAIE,iBACvD1Q,EAAYwQ,EAAIG,aAAa,IAAGH,EAAIhB,SAAWgB,EAAIG,eACxD,OAAOH,EAAIC,aACX,OAAOD,EAAIE,gBACX,OAAOF,EAAIG,cACJ,CACLpB,mBAAoB7N,EAAIgJ,sBAAsB,EAC9C0E,YAAa1N,EAAI+I,eAAe,CAClC,EAXE,MAAM,IAAItQ,EAA8B,gEAAgE,CAkB9G,CA4BA,SAASyW,GAAwBJ,GAC/B,IAAIK,EAAYC,GAAUN,EAAIzV,IAAI,EAChCgW,EAAaC,EAAeR,EAAIxV,MAAO,EAAG,EAAE,EAC5CiW,EAAWD,EAAeR,EAAIvV,IAAK,EAAGiW,GAAYV,EAAIzV,KAAMyV,EAAIxV,KAAK,CAAC,EACxE,OAAK6V,EAEOE,EAEAE,CAAAA,GACH9C,EAAe,MAAOqC,EAAIvV,GAAG,EAF7BkT,EAAe,QAASqC,EAAIxV,KAAK,EAFjCmT,EAAe,OAAQqC,EAAIzV,IAAI,CAM1C,CACA,SAASoW,GAAmBX,GAC1B,IAAIhV,EAAOgV,EAAIhV,KACbC,EAAS+U,EAAI/U,OACbE,EAAS6U,EAAI7U,OACb+E,EAAc8P,EAAI9P,YAChB0Q,EAAYJ,EAAexV,EAAM,EAAG,EAAE,GAAc,KAATA,GAA0B,IAAXC,GAA2B,IAAXE,GAAgC,IAAhB+E,EAC5F2Q,EAAcL,EAAevV,EAAQ,EAAG,EAAE,EAC1C6V,EAAcN,EAAerV,EAAQ,EAAG,EAAE,EAC1C4V,EAAmBP,EAAetQ,EAAa,EAAG,GAAG,EACvD,OAAK0Q,EAEOC,EAEAC,EAEAC,CAAAA,GACHpD,EAAe,cAAezN,CAAW,EAFzCyN,EAAe,SAAUxS,CAAM,EAF/BwS,EAAe,SAAU1S,CAAM,EAF/B0S,EAAe,OAAQ3S,CAAI,CAQtC,CAQA,SAASwE,EAAY5J,GACnB,OAAoB,KAAA,IAANA,CAChB,CACA,SAASoV,EAASpV,GAChB,MAAoB,UAAb,OAAOA,CAChB,CACA,SAAS0a,GAAU1a,GACjB,MAAoB,UAAb,OAAOA,GAAkBA,EAAI,GAAM,CAC5C,CAUA,SAAS2N,KACP,IACE,MAAuB,aAAhB,OAAO/F,MAAwB,CAAC,CAACA,KAAKoG,kBAG/C,CAFE,MAAOjN,GACP,MAAO,CAAA,CACT,CACF,CACA,SAASkT,KACP,IACE,MAAuB,aAAhB,OAAOrM,MAAwB,CAAC,CAACA,KAAK8H,SAAW,aAAc9H,KAAK8H,OAAO1Q,WAAa,gBAAiB4I,KAAK8H,OAAO1Q,UAG9H,CAFE,MAAO+B,GACP,MAAO,CAAA,CACT,CACF,CAOA,SAASqa,GAAOjZ,EAAKkZ,EAAIC,GACvB,GAAmB,IAAfnZ,EAAI3E,OAGR,OAAO2E,EAAIoZ,OAAO,SAAUC,EAAM7Y,GAC5B8Y,EAAO,CAACJ,EAAG1Y,CAAI,EAAGA,GACtB,OAAK6Y,GAEMF,EAAQE,EAAK,GAAIC,EAAK,EAAE,IAAMD,EAAK,GACrCA,EAFAC,CAMX,EAAG,IAAI,EAAE,EACX,CAOA,SAASnc,EAAe8a,EAAKsB,GAC3B,OAAO7d,OAAOmB,UAAUM,eAAeZ,KAAK0b,EAAKsB,CAAI,CACvD,CACA,SAAShK,GAAqBiK,GAC5B,GAAgB,MAAZA,EACF,OAAO,KACF,GAAwB,UAApB,OAAOA,EAChB,MAAM,IAAIvX,EAAqB,iCAAiC,EAEhE,GAAKwW,EAAee,EAASpM,SAAU,EAAG,CAAC,GAAMqL,EAAee,EAASnM,YAAa,EAAG,CAAC,GAAMlN,MAAMM,QAAQ+Y,EAASlM,OAAO,GAAKkM,CAAAA,EAASlM,QAAQmM,KAAK,SAAUC,GACjK,MAAO,CAACjB,EAAeiB,EAAG,EAAG,CAAC,CAChC,CAAC,EAGD,MAAO,CACLtM,SAAUoM,EAASpM,SACnBC,YAAamM,EAASnM,YACtBC,QAASnN,MAAMW,KAAK0Y,EAASlM,OAAO,CACtC,EANE,MAAM,IAAIrL,EAAqB,uBAAuB,CAQ5D,CAIA,SAASwW,EAAekB,EAAOC,EAAQC,GACrC,OAAOtB,GAAUoB,CAAK,GAAcC,GAATD,GAAmBA,GAASE,CACzD,CAMA,SAASzP,EAAStO,EAAO6E,GACb,KAAA,IAANA,IACFA,EAAI,GAKJmZ,EAHUhe,EAAQ,EAGT,KAAO,GAAK,CAACA,GAAOsO,SAASzJ,EAAG,GAAG,GAElC,GAAK7E,GAAOsO,SAASzJ,EAAG,GAAG,EAEvC,OAAOmZ,CACT,CACA,SAASC,EAAaC,GACpB,GAAIvS,CAAAA,EAAYuS,CAAM,GAAgB,OAAXA,GAA8B,KAAXA,EAG5C,OAAOtS,SAASsS,EAAQ,EAAE,CAE9B,CACA,SAASC,EAAcD,GACrB,GAAIvS,CAAAA,EAAYuS,CAAM,GAAgB,OAAXA,GAA8B,KAAXA,EAG5C,OAAOE,WAAWF,CAAM,CAE5B,CACA,SAASG,GAAYC,GAEnB,GAAI3S,CAAAA,EAAY2S,CAAQ,GAAkB,OAAbA,GAAkC,KAAbA,EAIhD,OADI7J,EAAkC,IAA9B2J,WAAW,KAAOE,CAAQ,EAC3BnS,KAAK2B,MAAM2G,CAAC,CAEvB,CACA,SAASlG,GAAQgQ,EAAQC,EAAQC,GACd,KAAA,IAAbA,IACFA,EAAW,SAEb,IAAIC,EAASvS,KAAKwS,IAAI,GAAIH,CAAM,EAChC,OAAQC,GACN,IAAK,SACH,OAAgB,EAATF,EAAapS,KAAKyS,KAAKL,EAASG,CAAM,EAAIA,EAASvS,KAAK2B,MAAMyQ,EAASG,CAAM,EAAIA,EAC1F,IAAK,QACH,OAAOvS,KAAK0S,MAAMN,EAASG,CAAM,EAAIA,EACvC,IAAK,QACH,OAAOvS,KAAK2S,MAAMP,EAASG,CAAM,EAAIA,EACvC,IAAK,QACH,OAAOvS,KAAK2B,MAAMyQ,EAASG,CAAM,EAAIA,EACvC,IAAK,OACH,OAAOvS,KAAKyS,KAAKL,EAASG,CAAM,EAAIA,EACtC,QACE,MAAM,IAAIK,WAAW,kBAAoBN,EAAW,kBAAkB,CAC1E,CACF,CAIA,SAASlE,GAAW7T,GAClB,OAAOA,EAAO,GAAM,IAAMA,EAAO,KAAQ,GAAKA,EAAO,KAAQ,EAC/D,CACA,SAASiV,EAAWjV,GAClB,OAAO6T,GAAW7T,CAAI,EAAI,IAAM,GAClC,CACA,SAASmW,GAAYnW,EAAMC,GACzB,IArEmB9B,EAqEfma,GArEYC,EAqEQtY,EAAQ,IArEb9B,EAqEgB,IApEpBsH,KAAK2B,MAAMmR,EAAIpa,CAAC,EAoEU,EAEzC,OAAiB,GAAbma,EACKzE,GAFG7T,GAAQC,EAAQqY,GAAY,EAEb,EAAI,GAAK,GAE3B,CAAC,GAAI,KAAM,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAIA,EAAW,EAEzE,CAGA,SAAS9S,GAAaiQ,GACpB,IAAInC,EAAIxQ,KAAKyQ,IAAIkC,EAAIzV,KAAMyV,EAAIxV,MAAQ,EAAGwV,EAAIvV,IAAKuV,EAAIhV,KAAMgV,EAAI/U,OAAQ+U,EAAI7U,OAAQ6U,EAAI9P,WAAW,EAUpG,OAPI8P,EAAIzV,KAAO,KAAmB,GAAZyV,EAAIzV,OACxBsT,EAAI,IAAIxQ,KAAKwQ,CAAC,GAIZE,eAAeiC,EAAIzV,KAAMyV,EAAIxV,MAAQ,EAAGwV,EAAIvV,GAAG,EAE5C,CAACoT,CACV,CAGA,SAASkF,GAAgBxY,EAAMwU,EAAoBH,GAEjD,MAAO,CADKF,GAAkBd,GAAUrT,EAAM,EAAGwU,CAAkB,EAAGH,CAAW,EACjEG,EAAqB,CACvC,CACA,SAASG,GAAgBF,EAAUD,EAAoBH,GAOrD,IAAIoE,EAAaD,GAAgB/D,EAL/BD,EADyB,KAAA,IAAvBA,EACmB,EAKoBA,EAFzCH,EADkB,KAAA,IAAhBA,EACY,EAE+CA,CAAW,EACtEqE,EAAiBF,GAAgB/D,EAAW,EAAGD,EAAoBH,CAAW,EAClF,OAAQY,EAAWR,CAAQ,EAAIgE,EAAaC,GAAkB,CAChE,CACA,SAASC,GAAe3Y,GACtB,OAAW,GAAPA,EACKA,EACKA,EAAO2M,EAASiG,mBAAqB,KAAO5S,EAAO,IAAOA,CAC1E,CAIA,SAAS4C,GAAcX,EAAI2W,EAAc/V,EAAQO,GAC9B,KAAA,IAAbA,IACFA,EAAW,MAEb,IAAIgB,EAAO,IAAItB,KAAKb,CAAE,EACpBqF,EAAW,CACTrG,UAAW,MACXjB,KAAM,UACNC,MAAO,UACPC,IAAK,UACLO,KAAM,UACNC,OAAQ,SACV,EAIEmY,GAHAzV,IACFkE,EAASlE,SAAWA,GAEP9I,EAAS,CACtBwG,aAAc8X,CAChB,EAAGtR,CAAQ,GACPjC,EAAS,IAAIpC,KAAKC,eAAeL,EAAQgW,CAAQ,EAAEjU,cAAcR,CAAI,EAAEyK,KAAK,SAAUC,GACxF,MAAgC,iBAAzBA,EAAE9L,KAAK+L,YAAY,CAC5B,CAAC,EACD,OAAO1J,EAASA,EAAOnI,MAAQ,IACjC,CAGA,SAASkT,GAAa0I,EAAYC,GAC5BC,EAAU9T,SAAS4T,EAAY,EAAE,EAGjCjf,OAAO2K,MAAMwU,CAAO,IACtBA,EAAU,GAERC,EAAS/T,SAAS6T,EAAc,EAAE,GAAK,EAE3C,OAAiB,GAAVC,GADUA,EAAU,GAAK9f,OAAOoR,GAAG0O,EAAS,CAAC,CAAC,EAAI,CAACC,EAASA,EAErE,CAIA,SAASC,GAAShc,GAChB,IAAIic,EAAetf,OAAOqD,CAAK,EAC/B,GAAqB,WAAjB,OAAOA,GAAiC,KAAVA,GAAiBrD,OAAOuf,SAASD,CAAY,EAC/E,OAAOA,EAD2E,MAAM,IAAI1Z,EAAqB,sBAAwBvC,CAAK,CAEhJ,CACA,SAASmc,GAAgB5D,EAAK6D,GAC5B,IACSC,EAEDrC,EAHJsC,EAAa,GACjB,IAASD,KAAK9D,EACR9a,EAAe8a,EAAK8D,CAAC,GAEnBrC,OADAA,EAAIzB,EAAI8D,MAEZC,EAAWF,EAAWC,CAAC,GAAKL,GAAShC,CAAC,GAG1C,OAAOsC,CACT,CASA,SAASrX,GAAaE,EAAQD,GAC5B,IAAI6H,EAAQxE,KAAK0S,MAAM1S,KAAKC,IAAIrD,EAAS,EAAE,CAAC,EAC1CiG,EAAU7C,KAAK0S,MAAM1S,KAAKC,IAAIrD,EAAS,EAAE,CAAC,EAC1CoX,EAAiB,GAAVpX,EAAc,IAAM,IAC7B,OAAQD,GACN,IAAK,QACH,OAAYqX,EAAO7R,EAASqC,EAAO,CAAC,EAAI,IAAMrC,EAASU,EAAS,CAAC,EACnE,IAAK,SACH,OAAYmR,EAAOxP,GAAmB,EAAV3B,EAAc,IAAMA,EAAU,IAC5D,IAAK,SACH,OAAYmR,EAAO7R,EAASqC,EAAO,CAAC,EAAIrC,EAASU,EAAS,CAAC,EAC7D,QACE,MAAM,IAAI+P,WAAW,gBAAkBjW,EAAS,sCAAsC,CAC1F,CACF,CACA,SAASwS,GAAWa,GAClB,OAxOYA,EAwOAA,EAAK,CAAC,OAAQ,SAAU,SAAU,eAvOlCmB,OAAO,SAAUva,EAAGqd,GAE9B,OADArd,EAAEqd,GAAKjE,EAAIiE,GACJrd,CACT,EAAG,EAAE,EAJP,IAAcoZ,CAyOd,CAMA,IAAIkE,GAAa,CAAC,UAAW,WAAY,QAAS,QAAS,MAAO,OAAQ,OAAQ,SAAU,YAAa,UAAW,WAAY,YAC5HC,GAAc,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC5FC,GAAe,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAC3E,SAAS/P,GAAOjR,GACd,OAAQA,GACN,IAAK,SACH,MAAO,GAAGihB,OAAOD,EAAY,EAC/B,IAAK,QACH,MAAO,GAAGC,OAAOF,EAAW,EAC9B,IAAK,OACH,MAAO,GAAGE,OAAOH,EAAU,EAC7B,IAAK,UACH,MAAO,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,MACnE,IAAK,UACH,MAAO,CAAC,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,KAAM,MAC5E,QACE,OAAO,IACX,CACF,CACA,IAAII,GAAe,CAAC,SAAU,UAAW,YAAa,WAAY,SAAU,WAAY,UACpFC,GAAgB,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,OAC3DC,GAAiB,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KACpD,SAAS5L,GAASxV,GAChB,OAAQA,GACN,IAAK,SACH,MAAO,GAAGihB,OAAOG,EAAc,EACjC,IAAK,QACH,MAAO,GAAGH,OAAOE,EAAa,EAChC,IAAK,OACH,MAAO,GAAGF,OAAOC,EAAY,EAC/B,IAAK,UACH,MAAO,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KACxC,QACE,OAAO,IACX,CACF,CACA,IAAIxL,GAAY,CAAC,KAAM,MACnB2L,GAAW,CAAC,gBAAiB,eAC7BC,GAAY,CAAC,KAAM,MACnBC,GAAa,CAAC,IAAK,KACvB,SAAS3L,GAAK5V,GACZ,OAAQA,GACN,IAAK,SACH,MAAO,GAAGihB,OAAOM,EAAU,EAC7B,IAAK,QACH,MAAO,GAAGN,OAAOK,EAAS,EAC5B,IAAK,OACH,MAAO,GAAGL,OAAOI,EAAQ,EAC3B,QACE,OAAO,IACX,CACF,CAmDA,SAASG,GAAgBC,EAAQC,GAE/B,IADA,IAAI1a,EAAI,GACC2a,EAAY5c,EAAgC0c,CAAM,EAAU,EAAEG,EAAQD,EAAU,GAAGhc,MAAO,CACjG,IAAIkc,EAAQD,EAAMvd,MACdwd,EAAMC,QACR9a,GAAK6a,EAAME,IAEX/a,GAAK0a,EAAcG,EAAME,GAAG,CAEhC,CACA,OAAO/a,CACT,CACA,IAAIgb,GAA0B,CAC5BC,EAAG/a,EACHgb,GAAI5a,EACJ6a,IAAK1a,EACL2a,KAAM1a,EACNwS,EAAGvS,EACH0a,GAAIva,GACJwa,IAAKta,GACLua,KAAMra,GACNsa,EAAGra,GACHsa,GAAIpa,GACJqa,IAAKpa,GACLqa,KAAMpa,GACN2M,EAAG1M,GACHoa,GAAIla,GACJma,IAAKha,GACLia,KAAM/Z,GACNga,EAAGta,GACHua,GAAIra,GACJsa,IAAKna,GACLoa,KAAMla,EACR,EAKIma,EAAyB,WAsD3B,SAASA,EAAUnZ,EAAQoZ,GACzBphB,KAAKqH,KAAO+Z,EACZphB,KAAK8L,IAAM9D,EACXhI,KAAKqhB,UAAY,IACnB,CAzDAF,EAAU/gB,OAAS,SAAgB4H,EAAQX,GAIzC,OAAO,IAAI8Z,EAAUnZ,EAFnBX,EADW,KAAA,IAATA,EACK,GAEoBA,CAAI,CACnC,EACA8Z,EAAUG,YAAc,SAAqBC,GAQ3C,IAJA,IAAIC,EAAU,KACZC,EAAc,GACdC,EAAY,CAAA,EACVjC,EAAS,GACJ1hB,EAAI,EAAGA,EAAIwjB,EAAIvjB,OAAQD,CAAC,GAAI,CACnC,IAAI4jB,EAAIJ,EAAIK,OAAO7jB,CAAC,EACV,MAAN4jB,IAEuB,EAArBF,EAAYzjB,QAAc0jB,IAC5BjC,EAAOhe,KAAK,CACVqe,QAAS4B,GAAa,QAAQhe,KAAK+d,CAAW,EAC9C1B,IAAqB,KAAhB0B,EAAqB,IAAMA,CAClC,CAAC,EAEHD,EAAU,KACVC,EAAc,GACdC,EAAY,CAACA,GACJA,GAEAC,IAAMH,EACfC,GAAeE,GAEU,EAArBF,EAAYzjB,QACdyhB,EAAOhe,KAAK,CACVqe,QAAS,QAAQpc,KAAK+d,CAAW,EACjC1B,IAAK0B,CACP,CAAC,EAGHD,EADAC,EAAcE,EAGlB,CAOA,OANyB,EAArBF,EAAYzjB,QACdyhB,EAAOhe,KAAK,CACVqe,QAAS4B,GAAa,QAAQhe,KAAK+d,CAAW,EAC9C1B,IAAK0B,CACP,CAAC,EAEIhC,CACT,EACA0B,EAAUU,uBAAyB,SAAgChC,GACjE,OAAOG,GAAwBH,EACjC,EAMA,IAAI3Y,EAASia,EAAU3hB,UAqXvB,OApXA0H,EAAO4a,wBAA0B,SAAiC5U,EAAI7F,GAKpE,OAJuB,OAAnBrH,KAAKqhB,YACPrhB,KAAKqhB,UAAYrhB,KAAK8L,IAAI+G,kBAAkB,GAErC7S,KAAKqhB,UAAU/N,YAAYpG,EAAIzN,EAAS,GAAIO,KAAKqH,KAAMA,CAAI,CAAC,EAC3DE,OAAO,CACnB,EACAL,EAAOoM,YAAc,SAAqBpG,EAAI7F,GAI5C,OAAOrH,KAAK8L,IAAIwH,YAAYpG,EAAIzN,EAAS,GAAIO,KAAKqH,KAFhDA,EADW,KAAA,IAATA,EACK,GAE+CA,CAAI,CAAC,CAC/D,EACAH,EAAO6a,eAAiB,SAAwB7U,EAAI7F,GAClD,OAAOrH,KAAKsT,YAAYpG,EAAI7F,CAAI,EAAEE,OAAO,CAC3C,EACAL,EAAO8a,oBAAsB,SAA6B9U,EAAI7F,GAC5D,OAAOrH,KAAKsT,YAAYpG,EAAI7F,CAAI,EAAE0C,cAAc,CAClD,EACA7C,EAAO+a,eAAiB,SAAwBC,EAAU7a,GAExD,OADSrH,KAAKsT,YAAY4O,EAASC,MAAO9a,CAAI,EACpCiC,IAAI8Y,YAAYF,EAASC,MAAMtU,SAAS,EAAGqU,EAASG,IAAIxU,SAAS,CAAC,CAC9E,EACA3G,EAAOoB,gBAAkB,SAAyB4E,EAAI7F,GACpD,OAAOrH,KAAKsT,YAAYpG,EAAI7F,CAAI,EAAEiB,gBAAgB,CACpD,EACApB,EAAOob,IAAM,SAAahf,EAAG1C,EAAG2hB,GAQ9B,IAGIlb,EAHJ,OAPU,KAAA,IAANzG,IACFA,EAAI,GAEc,KAAA,IAAhB2hB,IACFA,EAAczjB,KAAAA,GAGZkB,KAAKqH,KAAKgF,YACLU,EAASzJ,EAAG1C,CAAC,GAElByG,EAAO5H,EAAS,GAAIO,KAAKqH,IAAI,EACzB,EAAJzG,IACFyG,EAAKiF,MAAQ1L,GAEX2hB,IACFlb,EAAKkb,YAAcA,GAEdviB,KAAK8L,IAAIqI,gBAAgB9M,CAAI,EAAEE,OAAOjE,CAAC,EAChD,EACA4D,EAAOsb,yBAA2B,SAAkCtV,EAAIqU,GACtE,IAAI1Y,EAAQ7I,KACRyiB,EAA0C,OAA3BziB,KAAK8L,IAAII,YAAY,EACtCwW,EAAuB1iB,KAAK8L,IAAIsE,gBAA8C,YAA5BpQ,KAAK8L,IAAIsE,eAC3DuM,EAAS,SAAgBtV,EAAMkM,GAC7B,OAAO1K,EAAMiD,IAAIyH,QAAQrG,EAAI7F,EAAMkM,CAAO,CAC5C,EACAjM,EAAe,SAAsBD,GACnC,OAAI6F,EAAGyV,eAA+B,IAAdzV,EAAG1F,QAAgBH,EAAKub,OACvC,IAEF1V,EAAG2V,QAAU3V,EAAGjE,KAAK3B,aAAa4F,EAAG9F,GAAIC,EAAKE,MAAM,EAAI,EACjE,EACAub,EAAW,WACT,OAAOL,EA/MN/O,GA+MyCxG,EA/M5BtH,KAAO,GAAK,EAAI,GA+MkB+W,EAAO,CACrD/W,KAAM,UACNQ,UAAW,KACb,EAAG,WAAW,CAChB,EACAhB,EAAQ,SAAepH,EAAQuT,GAC7B,OAAOkR,GAhNWvV,EAgNqBA,EA/MtC+B,GA+M0CjR,CA/M7B,EAAEkP,EAAG9H,MAAQ,IA+M0BuX,EAAOpL,EAAa,CACvEnM,MAAOpH,CACT,EAAI,CACFoH,MAAOpH,EACPqH,IAAK,SACP,EAAG,OAAO,EArNlB,IAA0B6H,CAsNpB,EACA1H,EAAU,SAAiBxH,EAAQuT,GACjC,OAAOkR,GA3NavV,EA2NqBA,EA1NxCsG,GA0N4CxV,CA1N7B,EAAEkP,EAAG1H,QAAU,IA0NwBmX,EAAOpL,EAAa,CACzE/L,QAASxH,CACX,EAAI,CACFwH,QAASxH,EACToH,MAAO,OACPC,IAAK,SACP,EAAG,SAAS,EAjOpB,IAA4B6H,CAkOtB,EACA6V,EAAa,SAAoBlD,GAC/B,IAAIuB,EAAaD,EAAUU,uBAAuBhC,CAAK,EACvD,OAAIuB,EACKvY,EAAMiZ,wBAAwB5U,EAAIkU,CAAU,EAE5CvB,CAEX,EACAnX,EAAM,SAAa1K,GACjB,OAAOykB,GAtOSvV,EAsOqBA,EArOpC0G,GAqOwC5V,CArO7B,EAAEkP,EAAG/H,KAAO,EAAI,EAAI,IAqOmBwX,EAAO,CACxDjU,IAAK1K,CACP,EAAG,KAAK,EAxOhB,IAAwBkP,CAyOlB,EAsNF,OAAOsS,GAAgB2B,EAAUG,YAAYC,CAAG,EArN9B,SAAuB1B,GAErC,OAAQA,GAEN,IAAK,IACH,OAAOhX,EAAMyZ,IAAIpV,EAAGpC,WAAW,EACjC,IAAK,IAEL,IAAK,MACH,OAAOjC,EAAMyZ,IAAIpV,EAAGpC,YAAa,CAAC,EAEpC,IAAK,IACH,OAAOjC,EAAMyZ,IAAIpV,EAAGnH,MAAM,EAC5B,IAAK,KACH,OAAO8C,EAAMyZ,IAAIpV,EAAGnH,OAAQ,CAAC,EAE/B,IAAK,KACH,OAAO8C,EAAMyZ,IAAI1X,KAAK2B,MAAMW,EAAGpC,YAAc,EAAE,EAAG,CAAC,EACrD,IAAK,MACH,OAAOjC,EAAMyZ,IAAI1X,KAAK2B,MAAMW,EAAGpC,YAAc,GAAG,CAAC,EAEnD,IAAK,IACH,OAAOjC,EAAMyZ,IAAIpV,EAAGrH,MAAM,EAC5B,IAAK,KACH,OAAOgD,EAAMyZ,IAAIpV,EAAGrH,OAAQ,CAAC,EAE/B,IAAK,IACH,OAAOgD,EAAMyZ,IAAIpV,EAAGtH,KAAO,IAAO,EAAI,GAAKsH,EAAGtH,KAAO,EAAE,EACzD,IAAK,KACH,OAAOiD,EAAMyZ,IAAIpV,EAAGtH,KAAO,IAAO,EAAI,GAAKsH,EAAGtH,KAAO,GAAI,CAAC,EAC5D,IAAK,IACH,OAAOiD,EAAMyZ,IAAIpV,EAAGtH,IAAI,EAC1B,IAAK,KACH,OAAOiD,EAAMyZ,IAAIpV,EAAGtH,KAAM,CAAC,EAE7B,IAAK,IAEH,OAAO0B,EAAa,CAClBC,OAAQ,SACRqb,OAAQ/Z,EAAMxB,KAAKub,MACrB,CAAC,EACH,IAAK,KAEH,OAAOtb,EAAa,CAClBC,OAAQ,QACRqb,OAAQ/Z,EAAMxB,KAAKub,MACrB,CAAC,EACH,IAAK,MAEH,OAAOtb,EAAa,CAClBC,OAAQ,SACRqb,OAAQ/Z,EAAMxB,KAAKub,MACrB,CAAC,EACH,IAAK,OAEH,OAAO1V,EAAGjE,KAAK9B,WAAW+F,EAAG9F,GAAI,CAC/BG,OAAQ,QACRS,OAAQa,EAAMiD,IAAI9D,MACpB,CAAC,EACH,IAAK,QAEH,OAAOkF,EAAGjE,KAAK9B,WAAW+F,EAAG9F,GAAI,CAC/BG,OAAQ,OACRS,OAAQa,EAAMiD,IAAI9D,MACpB,CAAC,EAEH,IAAK,IAEH,OAAOkF,EAAGpE,SAEZ,IAAK,IACH,OAAOga,EAAS,EAElB,IAAK,IACH,OAAOJ,EAAuB/F,EAAO,CACnCtX,IAAK,SACP,EAAG,KAAK,EAAIwD,EAAMyZ,IAAIpV,EAAG7H,GAAG,EAC9B,IAAK,KACH,OAAOqd,EAAuB/F,EAAO,CACnCtX,IAAK,SACP,EAAG,KAAK,EAAIwD,EAAMyZ,IAAIpV,EAAG7H,IAAK,CAAC,EAEjC,IAAK,IAEH,OAAOwD,EAAMyZ,IAAIpV,EAAG1H,OAAO,EAC7B,IAAK,MAEH,OAAOA,EAAQ,QAAS,CAAA,CAAI,EAC9B,IAAK,OAEH,OAAOA,EAAQ,OAAQ,CAAA,CAAI,EAC7B,IAAK,QAEH,OAAOA,EAAQ,SAAU,CAAA,CAAI,EAE/B,IAAK,IAEH,OAAOqD,EAAMyZ,IAAIpV,EAAG1H,OAAO,EAC7B,IAAK,MAEH,OAAOA,EAAQ,QAAS,CAAA,CAAK,EAC/B,IAAK,OAEH,OAAOA,EAAQ,OAAQ,CAAA,CAAK,EAC9B,IAAK,QAEH,OAAOA,EAAQ,SAAU,CAAA,CAAK,EAEhC,IAAK,IAEH,OAAOkd,EAAuB/F,EAAO,CACnCvX,MAAO,UACPC,IAAK,SACP,EAAG,OAAO,EAAIwD,EAAMyZ,IAAIpV,EAAG9H,KAAK,EAClC,IAAK,KAEH,OAAOsd,EAAuB/F,EAAO,CACnCvX,MAAO,UACPC,IAAK,SACP,EAAG,OAAO,EAAIwD,EAAMyZ,IAAIpV,EAAG9H,MAAO,CAAC,EACrC,IAAK,MAEH,OAAOA,EAAM,QAAS,CAAA,CAAI,EAC5B,IAAK,OAEH,OAAOA,EAAM,OAAQ,CAAA,CAAI,EAC3B,IAAK,QAEH,OAAOA,EAAM,SAAU,CAAA,CAAI,EAE7B,IAAK,IAEH,OAAOsd,EAAuB/F,EAAO,CACnCvX,MAAO,SACT,EAAG,OAAO,EAAIyD,EAAMyZ,IAAIpV,EAAG9H,KAAK,EAClC,IAAK,KAEH,OAAOsd,EAAuB/F,EAAO,CACnCvX,MAAO,SACT,EAAG,OAAO,EAAIyD,EAAMyZ,IAAIpV,EAAG9H,MAAO,CAAC,EACrC,IAAK,MAEH,OAAOA,EAAM,QAAS,CAAA,CAAK,EAC7B,IAAK,OAEH,OAAOA,EAAM,OAAQ,CAAA,CAAK,EAC5B,IAAK,QAEH,OAAOA,EAAM,SAAU,CAAA,CAAK,EAE9B,IAAK,IAEH,OAAOsd,EAAuB/F,EAAO,CACnCxX,KAAM,SACR,EAAG,MAAM,EAAI0D,EAAMyZ,IAAIpV,EAAG/H,IAAI,EAChC,IAAK,KAEH,OAAOud,EAAuB/F,EAAO,CACnCxX,KAAM,SACR,EAAG,MAAM,EAAI0D,EAAMyZ,IAAIpV,EAAG/H,KAAKpD,SAAS,EAAEwB,MAAM,CAAC,CAAC,EAAG,CAAC,EACxD,IAAK,OAEH,OAAOmf,EAAuB/F,EAAO,CACnCxX,KAAM,SACR,EAAG,MAAM,EAAI0D,EAAMyZ,IAAIpV,EAAG/H,KAAM,CAAC,EACnC,IAAK,SAEH,OAAOud,EAAuB/F,EAAO,CACnCxX,KAAM,SACR,EAAG,MAAM,EAAI0D,EAAMyZ,IAAIpV,EAAG/H,KAAM,CAAC,EAEnC,IAAK,IAEH,OAAOuD,EAAI,OAAO,EACpB,IAAK,KAEH,OAAOA,EAAI,MAAM,EACnB,IAAK,QACH,OAAOA,EAAI,QAAQ,EACrB,IAAK,KACH,OAAOG,EAAMyZ,IAAIpV,EAAG0M,SAAS7X,SAAS,EAAEwB,MAAM,CAAC,CAAC,EAAG,CAAC,EACtD,IAAK,OACH,OAAOsF,EAAMyZ,IAAIpV,EAAG0M,SAAU,CAAC,EACjC,IAAK,IACH,OAAO/Q,EAAMyZ,IAAIpV,EAAG2M,UAAU,EAChC,IAAK,KACH,OAAOhR,EAAMyZ,IAAIpV,EAAG2M,WAAY,CAAC,EACnC,IAAK,IACH,OAAOhR,EAAMyZ,IAAIpV,EAAG4N,eAAe,EACrC,IAAK,KACH,OAAOjS,EAAMyZ,IAAIpV,EAAG4N,gBAAiB,CAAC,EACxC,IAAK,KACH,OAAOjS,EAAMyZ,IAAIpV,EAAG6N,cAAchZ,SAAS,EAAEwB,MAAM,CAAC,CAAC,EAAG,CAAC,EAC3D,IAAK,OACH,OAAOsF,EAAMyZ,IAAIpV,EAAG6N,cAAe,CAAC,EACtC,IAAK,IACH,OAAOlS,EAAMyZ,IAAIpV,EAAGgM,OAAO,EAC7B,IAAK,MACH,OAAOrQ,EAAMyZ,IAAIpV,EAAGgM,QAAS,CAAC,EAChC,IAAK,IAEH,OAAOrQ,EAAMyZ,IAAIpV,EAAG8V,OAAO,EAC7B,IAAK,KAEH,OAAOna,EAAMyZ,IAAIpV,EAAG8V,QAAS,CAAC,EAChC,IAAK,IACH,OAAOna,EAAMyZ,IAAI1X,KAAK2B,MAAMW,EAAG9F,GAAK,GAAI,CAAC,EAC3C,IAAK,IACH,OAAOyB,EAAMyZ,IAAIpV,EAAG9F,EAAE,EACxB,QACE,OAAO2b,EAAWlD,CAAK,CAC3B,CACF,CAC8D,CAClE,EACA3Y,EAAO+b,yBAA2B,SAAkCC,EAAK3B,GACvE,IAwByC4B,EAAQC,EAxB7CtQ,EAAS9S,KACTqjB,EAAuC,wBAAvBrjB,KAAKqH,KAAKic,SAAqC,CAAC,EAAI,EACpEC,EAAe,SAAsB1D,GACrC,OAAQA,EAAM,IACZ,IAAK,IACH,MAAO,eACT,IAAK,IACH,MAAO,UACT,IAAK,IACH,MAAO,UACT,IAAK,IACH,MAAO,QACT,IAAK,IACH,MAAO,OACT,IAAK,IACH,MAAO,QACT,IAAK,IACH,MAAO,SACT,IAAK,IACH,MAAO,QACT,QACE,OAAO,IACX,CACF,EAqBA2D,EAASrC,EAAUG,YAAYC,CAAG,EAClCkC,EAAaD,EAAOzH,OAAO,SAAU2H,EAAO5b,GAC1C,IAAIgY,EAAUhY,EAAKgY,QACjBC,EAAMjY,EAAKiY,IACb,OAAOD,EAAU4D,EAAQA,EAAMzE,OAAOc,CAAG,CAC3C,EAAG,EAAE,EACL4D,EAAYT,EAAIU,QAAQ7jB,MAAMmjB,EAAKO,EAAW9V,IAAI4V,CAAY,EAAEM,OAAO,SAAU3L,GAC/E,OAAOA,CACT,CAAC,CAAC,EACF4L,EAAe,CACbC,mBAAoBJ,EAAY,EAGhCK,YAAa3lB,OAAOoE,KAAKkhB,EAAUM,MAAM,EAAE,EAC7C,EACF,OAAOzE,GAAgBgE,GAnCkBL,EAmCIQ,EAnCIP,EAmCOU,EAlC7C,SAAUjE,GACf,IAEMqE,EAGF3B,EALA4B,EAASZ,EAAa1D,CAAK,EAC/B,OAAIsE,GACED,EAAkBd,EAAKW,oBAAsBI,IAAWf,EAAKY,YAAcX,EAAgB,EAG7Fd,EAD2B,wBAAzBzP,EAAOzL,KAAKic,UAAsCa,IAAWf,EAAKY,YACtD,QACoB,QAAzBlR,EAAOzL,KAAKic,SACP,SAGA,OAETxQ,EAAOwP,IAAIa,EAAOjhB,IAAIiiB,CAAM,EAAID,EAAiBrE,EAAM7hB,OAAQukB,CAAW,GAE1E1C,CAEX,EAiBiE,CACvE,EACOsB,CACT,EAAE,EAYEiD,EAAY,+EAChB,SAASC,KACP,IAAK,IAAIC,EAAO1kB,UAAU5B,OAAQumB,EAAU,IAAIzhB,MAAMwhB,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,CAAI,GACtFD,EAAQC,GAAQ5kB,UAAU4kB,GAE5B,IAAIC,EAAOF,EAAQxI,OAAO,SAAU7I,EAAGmC,GACrC,OAAOnC,EAAImC,EAAExV,MACf,EAAG,EAAE,EACL,OAAO+X,OAAO,IAAM6M,EAAO,GAAG,CAChC,CACA,SAASC,KACP,IAAK,IAAIC,EAAQ/kB,UAAU5B,OAAQ4mB,EAAa,IAAI9hB,MAAM6hB,CAAK,EAAGE,EAAQ,EAAGA,EAAQF,EAAOE,CAAK,GAC/FD,EAAWC,GAASjlB,UAAUilB,GAEhC,OAAO,SAAU5Q,GACf,OAAO2Q,EAAW7I,OAAO,SAAUjU,EAAMgd,GACvC,IAAIC,EAAajd,EAAK,GACpBkd,EAAald,EAAK,GAClBmd,EAASnd,EAAK,GACZod,EAAMJ,EAAG7Q,EAAGgR,CAAM,EACpBlF,EAAMmF,EAAI,GACVjc,EAAOic,EAAI,GACX/hB,EAAO+hB,EAAI,GACb,MAAO,CAACzlB,EAAS,GAAIslB,EAAYhF,CAAG,EAAG9W,GAAQ+b,EAAY7hB,EAC7D,EAAG,CAAC,GAAI,KAAM,EAAE,EAAEI,MAAM,EAAG,CAAC,CAC9B,CACF,CACA,SAAS4hB,GAAMngB,GACb,GAAS,MAALA,EAAJ,CAGA,IAAK,IAAIogB,EAAQxlB,UAAU5B,OAAQqnB,EAAW,IAAIviB,MAAc,EAARsiB,EAAYA,EAAQ,EAAI,CAAC,EAAGE,EAAQ,EAAGA,EAAQF,EAAOE,CAAK,GACjHD,EAASC,EAAQ,GAAK1lB,UAAU0lB,GAElC,IAAK,IAAIC,EAAK,EAAGC,EAAYH,EAAUE,EAAKC,EAAUxnB,OAAQunB,CAAE,GAAI,CAClE,IAAIE,EAAeD,EAAUD,GAC3B5N,EAAQ8N,EAAa,GACrBC,EAAYD,EAAa,GACvBxR,EAAI0D,EAAMlN,KAAKzF,CAAC,EACpB,GAAIiP,EACF,OAAOyR,EAAUzR,CAAC,CAEtB,CAZA,CAaA,MAAO,CAAC,KAAM,KAChB,CACA,SAAS0R,KACP,IAAK,IAAIC,EAAQhmB,UAAU5B,OAAQyE,EAAO,IAAIK,MAAM8iB,CAAK,EAAGC,EAAQ,EAAGA,EAAQD,EAAOC,CAAK,GACzFpjB,EAAKojB,GAASjmB,UAAUimB,GAE1B,OAAO,SAAUvQ,EAAO2P,GAGtB,IAFA,IAAIa,EAAM,GAEL/nB,EAAI,EAAGA,EAAI0E,EAAKzE,OAAQD,CAAC,GAC5B+nB,EAAIrjB,EAAK1E,IAAM2e,EAAapH,EAAM2P,EAASlnB,EAAE,EAE/C,MAAO,CAAC+nB,EAAK,KAAMb,EAASlnB,EAC9B,CACF,CAGA,IAAIgoB,EAAc,qCAEdC,EAAmB,sDACnBC,GAAerO,OAAYoO,EAAiBnmB,QAF1B,MAAQkmB,EAAYlmB,OAAS,WAAaukB,EAAUvkB,OAAS,WAEX,EACpEqmB,EAAwBtO,OAAO,UAAYqO,GAAapmB,OAAS,IAAI,EAIrEsmB,GAAqBR,GAAY,WAAY,aAAc,SAAS,EACpES,GAAwBT,GAAY,OAAQ,SAAS,EAErDU,EAAezO,OAAOoO,EAAiBnmB,OAAS,QAAUkmB,EAAYlmB,OAAS,KAAOukB,EAAUvkB,OAAS,KAAK,EAC9GymB,EAAwB1O,OAAO,OAASyO,EAAaxmB,OAAS,IAAI,EACtE,SAAS0mB,GAAIjR,EAAOnL,EAAKqc,GACnBvS,EAAIqB,EAAMnL,GACd,OAAOC,EAAY6J,CAAC,EAAIuS,EAAW9J,EAAazI,CAAC,CACnD,CASA,SAASwS,GAAenR,EAAO2P,GAO7B,MAAO,CANI,CACT7V,MAAOmX,GAAIjR,EAAO2P,EAAQ,CAAC,EAC3BxX,QAAS8Y,GAAIjR,EAAO2P,EAAS,EAAG,CAAC,EACjC5V,QAASkX,GAAIjR,EAAO2P,EAAS,EAAG,CAAC,EACjCyB,aAAc5J,GAAYxH,EAAM2P,EAAS,EAAE,CAC7C,EACc,KAAMA,EAAS,EAC/B,CACA,SAAS0B,GAAiBrR,EAAO2P,GAC/B,IAAI2B,EAAQ,CAACtR,EAAM2P,IAAW,CAAC3P,EAAM2P,EAAS,GAC5C4B,EAAatR,GAAaD,EAAM2P,EAAS,GAAI3P,EAAM2P,EAAS,EAAE,EAEhE,MAAO,CAAC,GADC2B,EAAQ,KAAO1R,EAAgBxT,SAASmlB,CAAU,EACzC5B,EAAS,EAC7B,CACA,SAAS6B,GAAgBxR,EAAO2P,GAE9B,MAAO,CAAC,GADG3P,EAAM2P,GAAUrc,EAASxI,OAAOkV,EAAM2P,EAAO,EAAI,KAC1CA,EAAS,EAC7B,CAIA,IAAI8B,GAAcnP,OAAO,MAAQoO,EAAiBnmB,OAAS,GAAG,EAI1DmnB,GAAc,+PAClB,SAASC,GAAmB3R,GAYR,SAAd4R,EAAmC5E,EAAK6E,GAI1C,OAHc,KAAA,IAAVA,IACFA,EAAQ,CAAA,GAEKroB,KAAAA,IAARwjB,IAAsB6E,GAAS7E,GAAO8E,GAAqB,CAAC9E,EAAMA,CAC3E,CAhBA,IAAItd,EAAIsQ,EAAM,GACZ+R,EAAU/R,EAAM,GAChBgS,EAAWhS,EAAM,GACjBiS,EAAUjS,EAAM,GAChBkS,EAASlS,EAAM,GACfmS,EAAUnS,EAAM,GAChBoS,EAAYpS,EAAM,GAClBqS,EAAYrS,EAAM,GAClBsS,EAAkBtS,EAAM,GACtB8R,EAA6B,MAATpiB,EAAE,GACtB6iB,EAAkBF,GAA8B,MAAjBA,EAAU,GAO7C,MAAO,CAAC,CACN5Y,MAAOmY,EAAYtK,EAAcyK,CAAO,CAAC,EACzCpY,OAAQiY,EAAYtK,EAAc0K,CAAQ,CAAC,EAC3CpY,MAAOgY,EAAYtK,EAAc2K,CAAO,CAAC,EACzCpY,KAAM+X,EAAYtK,EAAc4K,CAAM,CAAC,EACvCpY,MAAO8X,EAAYtK,EAAc6K,CAAO,CAAC,EACzCha,QAASyZ,EAAYtK,EAAc8K,CAAS,CAAC,EAC7CrY,QAAS6X,EAAYtK,EAAc+K,CAAS,EAAiB,OAAdA,CAAkB,EACjEjB,aAAcQ,EAAYpK,GAAY8K,CAAe,EAAGC,CAAe,CACzE,EACF,CAKA,IAAIC,GAAa,CACfC,IAAK,EACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,IACLC,IAAK,CAAA,GACP,EACA,SAASC,GAAYC,EAAYpB,EAASC,EAAUE,EAAQC,EAASC,EAAWC,GAC1Ee,EAAS,CACXvjB,KAAyB,IAAnBkiB,EAAQrpB,OAAe8f,GAAepB,EAAa2K,CAAO,CAAC,EAAI3K,EAAa2K,CAAO,EACzFjiB,MAAO2Z,GAAY/c,QAAQslB,CAAQ,EAAI,EACvCjiB,IAAKqX,EAAa8K,CAAM,EACxB5hB,KAAM8W,EAAa+K,CAAO,EAC1B5hB,OAAQ6W,EAAagL,CAAS,CAChC,EAKA,OAJIC,IAAWe,EAAO3iB,OAAS2W,EAAaiL,CAAS,GACjDc,IACFC,EAAOljB,QAA8B,EAApBijB,EAAWzqB,OAAakhB,GAAald,QAAQymB,CAAU,EAAI,EAAItJ,GAAcnd,QAAQymB,CAAU,EAAI,GAE/GC,CACT,CAGA,IAAIC,GAAU,kMACd,SAASC,GAAetT,GACtB,IAAImT,EAAanT,EAAM,GACrBkS,EAASlS,EAAM,GACfgS,EAAWhS,EAAM,GACjB+R,EAAU/R,EAAM,GAChBmS,EAAUnS,EAAM,GAChBoS,EAAYpS,EAAM,GAClBqS,EAAYrS,EAAM,GAClBuT,EAAYvT,EAAM,GAClBwT,EAAYxT,EAAM,GAClB2I,EAAa3I,EAAM,IACnB4I,EAAe5I,EAAM,IACrBoT,EAASF,GAAYC,EAAYpB,EAASC,EAAUE,EAAQC,EAASC,EAAWC,CAAS,EAGzFngB,EADEqhB,EACOf,GAAWe,GACXC,EACA,EAEAvT,GAAa0I,EAAYC,CAAY,EAEhD,MAAO,CAACwK,EAAQ,IAAIxT,EAAgB1N,CAAM,EAC5C,CAQA,IAAIuhB,GAAU,6HACZC,GAAS,yJACTC,GAAQ,4HACV,SAASC,GAAoB5T,GAC3B,IAAImT,EAAanT,EAAM,GACrBkS,EAASlS,EAAM,GACfgS,EAAWhS,EAAM,GAMnB,MAAO,CADIkT,GAAYC,EAJXnT,EAAM,GAI0BgS,EAAUE,EAH1ClS,EAAM,GACJA,EAAM,GACNA,EAAM,EACuE,EAC3EJ,EAAgBC,YAClC,CACA,SAASgU,GAAa7T,GACpB,IAAImT,EAAanT,EAAM,GACrBgS,EAAWhS,EAAM,GACjBkS,EAASlS,EAAM,GACfmS,EAAUnS,EAAM,GAChBoS,EAAYpS,EAAM,GAClBqS,EAAYrS,EAAM,GAGpB,MAAO,CADIkT,GAAYC,EADXnT,EAAM,GAC0BgS,EAAUE,EAAQC,EAASC,EAAWC,CAAS,EAC3EzS,EAAgBC,YAClC,CACA,IAAIiU,GAA+B/E,GAnKjB,8CAmK6C6B,CAAqB,EAChFmD,GAAgChF,GAnKjB,8BAmK8C6B,CAAqB,EAClFoD,GAAmCjF,GAnKjB,mBAmKiD6B,CAAqB,EACxFqD,GAAuBlF,GAAe4B,EAAY,EAClDuD,GAA6B9E,GA3JjC,SAAuBpP,EAAO2P,GAM5B,MAAO,CALI,CACT9f,KAAMohB,GAAIjR,EAAO2P,CAAM,EACvB7f,MAAOmhB,GAAIjR,EAAO2P,EAAS,EAAG,CAAC,EAC/B5f,IAAKkhB,GAAIjR,EAAO2P,EAAS,EAAG,CAAC,CAC/B,EACc,KAAMA,EAAS,EAC/B,EAoJkEwB,GAAgBE,GAAkBG,EAAe,EAC/G2C,GAA8B/E,GAAkByB,GAAoBM,GAAgBE,GAAkBG,EAAe,EACrH4C,GAA+BhF,GAAkB0B,GAAuBK,GAAgBE,GAAkBG,EAAe,EACzH6C,GAA0BjF,GAAkB+B,GAAgBE,GAAkBG,EAAe,EAkBjG,IAAI8C,GAAqBlF,GAAkB+B,EAAc,EAIzD,IAAIoD,GAA+BxF,GA3LjB,wBA2L6CiC,CAAqB,EAChFwD,GAAuBzF,GAAegC,CAAY,EAClD0D,GAAkCrF,GAAkB+B,GAAgBE,GAAkBG,EAAe,EAKzG,IAAIkD,GAAY,mBAGZC,EAAiB,CACjB/a,MAAO,CACLC,KAAM,EACNC,MAAO,IACP3B,QAAS,MACT4B,QAAS,OACTqX,aAAc,MAChB,EACAvX,KAAM,CACJC,MAAO,GACP3B,QAAS,KACT4B,QAAS,MACTqX,aAAc,KAChB,EACAtX,MAAO,CACL3B,QAAS,GACT4B,QAAS,KACTqX,aAAc,IAChB,EACAjZ,QAAS,CACP4B,QAAS,GACTqX,aAAc,GAChB,EACArX,QAAS,CACPqX,aAAc,GAChB,CACF,EACAwD,GAAezqB,EAAS,CACtBsP,MAAO,CACLC,SAAU,EACVC,OAAQ,GACRC,MAAO,GACPC,KAAM,IACNC,MAAO,KACP3B,QAAS,OACT4B,QAAS,QACTqX,aAAc,OAChB,EACA1X,SAAU,CACRC,OAAQ,EACRC,MAAO,GACPC,KAAM,GACNC,MAAO,KACP3B,QAAS,OACT4B,QAAS,QACTqX,aAAc,OAChB,EACAzX,OAAQ,CACNC,MAAO,EACPC,KAAM,GACNC,MAAO,IACP3B,QAAS,MACT4B,QAAS,OACTqX,aAAc,MAChB,CACF,EAAGuD,CAAc,EACjBE,EAAqB,SACrBC,GAAsB,UACtBC,GAAiB5qB,EAAS,CACxBsP,MAAO,CACLC,SAAU,EACVC,OAAQ,GACRC,MAAOib,EAAqB,EAC5Bhb,KAAMgb,EACN/a,MAA4B,GAArB+a,EACP1c,QAAS0c,SACT9a,QAAS8a,SAA+B,GACxCzD,aAAcyD,SAA+B,GAAK,GACpD,EACAnb,SAAU,CACRC,OAAQ,EACRC,MAAOib,EAAqB,GAC5Bhb,KAAMgb,EAAqB,EAC3B/a,MAA4B,GAArB+a,EAA0B,EACjC1c,QAAS0c,SACT9a,QAAS8a,SAA+B,GAAK,EAC7CzD,aAAcyD,iBAChB,EACAlb,OAAQ,CACNC,MAAOkb,GAAsB,EAC7Bjb,KAAMib,GACNhb,MAA6B,GAAtBgb,GACP3c,QAAS2c,QACT/a,QAAS+a,QACT1D,aAAc0D,SAChB,CACF,EAAGH,CAAc,EAGfK,EAAiB,CAAC,QAAS,WAAY,SAAU,QAAS,OAAQ,QAAS,UAAW,UAAW,gBACjGC,GAAeD,EAAe/mB,MAAM,CAAC,EAAEinB,QAAQ,EAGnD,SAASC,EAAQvH,EAAKxQ,EAAMvJ,GAKtBuhB,EAAO,CACTzG,QAJA9a,EADY,KAAA,IAAVA,EACM,CAAA,EAIAA,GAAQuJ,EAAKuR,OAASxkB,EAAS,GAAIyjB,EAAIe,OAAQvR,EAAKuR,QAAU,EAAE,EACxEnY,IAAKoX,EAAIpX,IAAI2G,MAAMC,EAAK5G,GAAG,EAC3B6e,mBAAoBjY,EAAKiY,oBAAsBzH,EAAIyH,mBACnDC,OAAQlY,EAAKkY,QAAU1H,EAAI0H,MAC7B,EACA,OAAO,IAAIC,EAASH,CAAI,CAC1B,CACA,SAASI,GAAiBF,EAAQG,GAGhC,IAFA,IAAIC,EACAC,EAAkD,OAA3CD,EAAqBD,EAAKrE,cAAwBsE,EAAqB,EACzErL,EAAY5c,EAAgCwnB,GAAahnB,MAAM,CAAC,CAAC,EAAU,EAAEqc,EAAQD,EAAU,GAAGhc,MAAO,CAChH,IAAIgB,EAAOib,EAAMvd,MACb0oB,EAAKpmB,KACPsmB,GAAOF,EAAKpmB,GAAQimB,EAAOjmB,GAAoB,aAEnD,CACA,OAAOsmB,CACT,CAGA,SAASC,GAAgBN,EAAQG,GAG/B,IAAI5N,EAAS2N,GAAiBF,EAAQG,CAAI,EAAI,EAAI,CAAC,EAAI,EACvDT,EAAea,YAAY,SAAUC,EAAU5J,GAC7C,IAGQ6J,EAiBAC,EApBR,OAAKlhB,EAAY2gB,EAAKvJ,EAAQ,EA0BrB4J,GAzBHA,IACEG,EAAcR,EAAKK,GAAYjO,EAC/BkO,EAAOT,EAAOpJ,GAAS4J,GAiBvBE,EAAS1gB,KAAK2B,MAAMgf,EAAcF,CAAI,EAC1CN,EAAKvJ,IAAY8J,EAASnO,EAC1B4N,EAAKK,IAAaE,EAASD,EAAOlO,GAE7BqE,EAIX,EAAG,IAAI,EAIP8I,EAAevO,OAAO,SAAUqP,EAAU5J,GACxC,IAEQzE,EAFR,OAAK3S,EAAY2gB,EAAKvJ,EAAQ,EAQrB4J,GAPHA,IACErO,EAAWgO,EAAKK,GAAY,EAChCL,EAAKK,IAAarO,EAClBgO,EAAKvJ,IAAYzE,EAAW6N,EAAOQ,GAAU5J,IAExCA,EAIX,EAAG,IAAI,CACT,CAGA,SAASgK,GAAaT,GAEpB,IADA,IAAIU,EAAU,GACLlG,EAAK,EAAGmG,EAAkBrtB,OAAOstB,QAAQZ,CAAI,EAAGxF,EAAKmG,EAAgB1tB,OAAQunB,CAAE,GAAI,CAC1F,IAAIqG,EAAqBF,EAAgBnG,GACvC/mB,EAAMotB,EAAmB,GACzBvpB,EAAQupB,EAAmB,GACf,IAAVvpB,IACFopB,EAAQjtB,GAAO6D,EAEnB,CACA,OAAOopB,CACT,CAeA,IAAIZ,EAAwB,SAAUgB,GAIpC,SAAShB,EAASiB,GAChB,IAAIC,EAAyC,aAA9BD,EAAOnB,oBAAqC,CAAA,EACvDC,EAASmB,EAAW1B,GAAiBH,GACrC4B,EAAOlB,SACTA,EAASkB,EAAOlB,QAMlB5qB,KAAKikB,OAAS6H,EAAO7H,OAIrBjkB,KAAK8L,IAAMggB,EAAOhgB,KAAOoE,EAAO9P,OAAO,EAIvCJ,KAAK2qB,mBAAqBoB,EAAW,WAAa,SAIlD/rB,KAAKgsB,QAAUF,EAAOE,SAAW,KAIjChsB,KAAK4qB,OAASA,EAId5qB,KAAKisB,gBAAkB,CAAA,CACzB,CAWApB,EAASqB,WAAa,SAAoBxd,EAAOrH,GAC/C,OAAOwjB,EAASzY,WAAW,CACzBsU,aAAchY,CAChB,EAAGrH,CAAI,CACT,EAsBAwjB,EAASzY,WAAa,SAAoBwI,EAAKvT,GAI7C,GAHa,KAAA,IAATA,IACFA,EAAO,IAEE,MAAPuT,GAA8B,UAAf,OAAOA,EACxB,MAAM,IAAIhW,EAAqB,gEAA0E,OAARgW,EAAe,OAAS,OAAOA,EAAI,EAEtI,OAAO,IAAIiQ,EAAS,CAClB5G,OAAQzF,GAAgB5D,EAAKiQ,EAASsB,aAAa,EACnDrgB,IAAKoE,EAAOkC,WAAW/K,CAAI,EAC3BsjB,mBAAoBtjB,EAAKsjB,mBACzBC,OAAQvjB,EAAKujB,MACf,CAAC,CACH,EAYAC,EAASuB,iBAAmB,SAA0BC,GACpD,GAAIzW,EAASyW,CAAY,EACvB,OAAOxB,EAASqB,WAAWG,CAAY,EAClC,GAAIxB,EAASyB,WAAWD,CAAY,EACzC,OAAOA,EACF,GAA4B,UAAxB,OAAOA,EAChB,OAAOxB,EAASzY,WAAWia,CAAY,EAEvC,MAAM,IAAIznB,EAAqB,6BAA+BynB,EAAe,YAAc,OAAOA,CAAY,CAElH,EAgBAxB,EAAS0B,QAAU,SAAiBC,EAAMnlB,GACxC,IACEmD,EAlVG2a,GAiVoCqH,EAjV3B,CAACxF,GAAaC,GAAmB,EAkVlB,GAC7B,OAAIzc,EACKqgB,EAASzY,WAAW5H,EAAQnD,CAAI,EAEhCwjB,EAASmB,QAAQ,aAAc,cAAiBQ,EAAO,gCAAgC,CAElG,EAkBA3B,EAAS4B,YAAc,SAAqBD,EAAMnlB,GAChD,IACEmD,EAxWG2a,GAuWoCqH,EAvW3B,CAACzF,GAAa6C,GAAmB,EAwWlB,GAC7B,OAAIpf,EACKqgB,EAASzY,WAAW5H,EAAQnD,CAAI,EAEhCwjB,EAASmB,QAAQ,aAAc,cAAiBQ,EAAO,gCAAgC,CAElG,EAQA3B,EAASmB,QAAU,SAAiB/nB,EAAQmU,GAI1C,GAHoB,KAAA,IAAhBA,IACFA,EAAc,MAEZ,CAACnU,EACH,MAAM,IAAIW,EAAqB,kDAAkD,EAE/EonB,EAAU/nB,aAAkBkU,EAAUlU,EAAS,IAAIkU,EAAQlU,EAAQmU,CAAW,EAClF,GAAItG,EAAS+F,eACX,MAAM,IAAIxT,EAAqB2nB,CAAO,EAEtC,OAAO,IAAInB,EAAS,CAClBmB,QAASA,CACX,CAAC,CAEL,EAKAnB,EAASsB,cAAgB,SAAuBxnB,GAC9C,IAAIga,EAAa,CACfxZ,KAAM,QACN4J,MAAO,QACPiU,QAAS,WACThU,SAAU,WACV5J,MAAO,SACP6J,OAAQ,SACRyd,KAAM,QACNxd,MAAO,QACP7J,IAAK,OACL8J,KAAM,OACNvJ,KAAM,QACNwJ,MAAO,QACPvJ,OAAQ,UACR4H,QAAS,UACT1H,OAAQ,UACRsJ,QAAS,UACTvE,YAAa,eACb4b,aAAc,cAChB,EAAE/hB,GAAOA,EAAKuP,YAAY,GAC1B,GAAKyK,EACL,OAAOA,EADU,MAAM,IAAIla,EAAiBE,CAAI,CAElD,EAOAkmB,EAASyB,WAAa,SAAoB9rB,GACxC,OAAOA,GAAKA,EAAEyrB,iBAAmB,CAAA,CACnC,EAMA,IAAI/kB,EAAS2jB,EAASrrB,UAwmBtB,OA7kBA0H,EAAOylB,SAAW,SAAkBpL,EAAKla,GAKnCulB,EAAUntB,EAAS,GAHrB4H,EADW,KAAA,IAATA,EACK,GAGkBA,EAAM,CAC/BkF,MAAsB,CAAA,IAAflF,EAAKkW,OAAkC,CAAA,IAAflW,EAAKkF,KACtC,CAAC,EACD,OAAOvM,KAAK6iB,QAAU1B,EAAU/gB,OAAOJ,KAAK8L,IAAK8gB,CAAO,EAAE3J,yBAAyBjjB,KAAMuhB,CAAG,EAAIyI,EAClG,EAkBA9iB,EAAO2lB,QAAU,SAAiBxlB,GAChC,IAKIylB,EACA7nB,EANA4D,EAAQ7I,KAIZ,OAHa,KAAA,IAATqH,IACFA,EAAO,IAEJrH,KAAK6iB,SACNiK,EAA+B,CAAA,IAAnBzlB,EAAKylB,UACjB7nB,EAAIqlB,EAAe3c,IAAI,SAAUhJ,GACnC,IAAIob,EAAMlX,EAAMob,OAAOtf,GACvB,OAAIyF,EAAY2V,CAAG,GAAa,IAARA,GAAa,CAAC+M,EAC7B,KAEFjkB,EAAMiD,IAAIqI,gBAAgB1U,EAAS,CACxCyO,MAAO,OACP6e,YAAa,MACf,EAAG1lB,EAAM,CACP1C,KAAMA,EAAKpB,MAAM,EAAG,CAAC,CAAC,CACxB,CAAC,CAAC,EAAEgE,OAAOwY,CAAG,CAChB,CAAC,EAAE8D,OAAO,SAAUvgB,GAClB,OAAOA,CACT,CAAC,EACMtD,KAAK8L,IAAIwI,cAAc7U,EAAS,CACrC0I,KAAM,cACN+F,MAAO7G,EAAK2lB,WAAa,QAC3B,EAAG3lB,CAAI,CAAC,EAAEE,OAAOtC,CAAC,GAnBQ+kB,EAoB5B,EAOA9iB,EAAO+lB,SAAW,WAChB,OAAKjtB,KAAK6iB,QACHpjB,EAAS,GAAIO,KAAKikB,MAAM,EADL,EAE5B,EAYA/c,EAAOgmB,MAAQ,WAEb,IACIloB,EADJ,OAAKhF,KAAK6iB,SACN7d,EAAI,IACW,IAAfhF,KAAK+O,QAAa/J,GAAKhF,KAAK+O,MAAQ,KACpB,IAAhB/O,KAAKiP,QAAkC,IAAlBjP,KAAKgP,WAAgBhK,GAAKhF,KAAKiP,OAAyB,EAAhBjP,KAAKgP,SAAe,KAClE,IAAfhP,KAAKkP,QAAalK,GAAKhF,KAAKkP,MAAQ,KACtB,IAAdlP,KAAKmP,OAAYnK,GAAKhF,KAAKmP,KAAO,KACnB,IAAfnP,KAAKoP,OAAgC,IAAjBpP,KAAKyN,SAAkC,IAAjBzN,KAAKqP,SAAuC,IAAtBrP,KAAK0mB,eAAoB1hB,GAAK,KAC/E,IAAfhF,KAAKoP,QAAapK,GAAKhF,KAAKoP,MAAQ,KACnB,IAAjBpP,KAAKyN,UAAezI,GAAKhF,KAAKyN,QAAU,KACvB,IAAjBzN,KAAKqP,SAAuC,IAAtBrP,KAAK0mB,eAG7B1hB,GAAKgI,GAAQhN,KAAKqP,QAAUrP,KAAK0mB,aAAe,IAAM,CAAC,EAAI,KACnD,MAAN1hB,IAAWA,GAAK,OACbA,GAdmB,IAe5B,EAkBAkC,EAAOimB,UAAY,SAAmB9lB,GAIpC,IACI+lB,EADJ,OAHa,KAAA,IAAT/lB,IACFA,EAAO,IAEJrH,CAAAA,KAAK6iB,UACNuK,EAASptB,KAAKqtB,SAAS,GACd,GAAe,OAAVD,EAFQ,MAG1B/lB,EAAO5H,EAAS,CACd6tB,qBAAsB,CAAA,EACtBC,gBAAiB,CAAA,EACjBC,cAAe,CAAA,EACfjmB,OAAQ,UACV,EAAGF,EAAM,CACPomB,cAAe,CAAA,CACjB,CAAC,EACcra,EAAS8Y,WAAWkB,EAAQ,CACzCnkB,KAAM,KACR,CAAC,EACekkB,UAAU9lB,CAAI,EAChC,EAMAH,EAAOwmB,OAAS,WACd,OAAO1tB,KAAKktB,MAAM,CACpB,EAMAhmB,EAAOnF,SAAW,WAChB,OAAO/B,KAAKktB,MAAM,CACpB,EAMAhmB,EAAO2kB,GAAe,WACpB,OAAI7rB,KAAK6iB,QACA,sBAAwBxX,KAAKC,UAAUtL,KAAKikB,MAAM,EAAI,KAEtD,+BAAiCjkB,KAAK2tB,cAAgB,IAEjE,EAMAzmB,EAAOmmB,SAAW,WAChB,OAAKrtB,KAAK6iB,QACHiI,GAAiB9qB,KAAK4qB,OAAQ5qB,KAAKikB,MAAM,EADtBra,GAE5B,EAMA1C,EAAO5F,QAAU,WACf,OAAOtB,KAAKqtB,SAAS,CACvB,EAOAnmB,EAAOsG,KAAO,SAAcogB,GAC1B,GAAI,CAAC5tB,KAAK6iB,QAAS,OAAO7iB,KAG1B,IAFA,IAAIkjB,EAAM2H,EAASuB,iBAAiBwB,CAAQ,EAC1ClF,EAAS,GACFmF,EAAM,EAAGC,EAAgBxD,EAAgBuD,EAAMC,EAAc9vB,OAAQ6vB,CAAG,GAAI,CACnF,IAAIhP,EAAIiP,EAAcD,IAClB/tB,EAAeojB,EAAIe,OAAQpF,CAAC,GAAK/e,EAAeE,KAAKikB,OAAQpF,CAAC,KAChE6J,EAAO7J,GAAKqE,EAAIhhB,IAAI2c,CAAC,EAAI7e,KAAKkC,IAAI2c,CAAC,EAEvC,CACA,OAAO4L,EAAQzqB,KAAM,CACnBikB,OAAQyE,CACV,EAAG,CAAA,CAAI,CACT,EAOAxhB,EAAO6mB,MAAQ,SAAeH,GAC5B,OAAK5tB,KAAK6iB,SACNK,EAAM2H,EAASuB,iBAAiBwB,CAAQ,EACrC5tB,KAAKwN,KAAK0V,EAAI8K,OAAO,CAAC,GAFHhuB,IAG5B,EASAkH,EAAO+mB,SAAW,SAAkBC,GAClC,GAAI,CAACluB,KAAK6iB,QAAS,OAAO7iB,KAE1B,IADA,IAAI0oB,EAAS,GACJyF,EAAM,EAAGC,EAAe/vB,OAAOoE,KAAKzC,KAAKikB,MAAM,EAAGkK,EAAMC,EAAapwB,OAAQmwB,CAAG,GAAI,CAC3F,IAAItP,EAAIuP,EAAaD,GACrBzF,EAAO7J,GAAKR,GAAS6P,EAAGluB,KAAKikB,OAAOpF,GAAIA,CAAC,CAAC,CAC5C,CACA,OAAO4L,EAAQzqB,KAAM,CACnBikB,OAAQyE,CACV,EAAG,CAAA,CAAI,CACT,EAUAxhB,EAAOhF,IAAM,SAAayC,GACxB,OAAO3E,KAAK6qB,EAASsB,cAAcxnB,CAAI,EACzC,EASAuC,EAAO/E,IAAM,SAAa8hB,GACxB,OAAKjkB,KAAK6iB,QAEH4H,EAAQzqB,KAAM,CACnBikB,OAFUxkB,EAAS,GAAIO,KAAKikB,OAAQzF,GAAgByF,EAAQ4G,EAASsB,aAAa,CAAC,CAGrF,CAAC,EAJyBnsB,IAK5B,EAOAkH,EAAOmnB,YAAc,SAAqBhc,GACxC,IAAIvK,EAAiB,KAAA,IAAVuK,EAAmB,GAAKA,EACjCrK,EAASF,EAAKE,OACdgJ,EAAkBlJ,EAAKkJ,gBACvB2Z,EAAqB7iB,EAAK6iB,mBAC1BC,EAAS9iB,EAAK8iB,OACZ9e,EAAM9L,KAAK8L,IAAI2G,MAAM,CACvBzK,OAAQA,EACRgJ,gBAAiBA,CACnB,CAAC,EAMD,OAAOyZ,EAAQzqB,KALJ,CACT8L,IAAKA,EACL8e,OAAQA,EACRD,mBAAoBA,CACtB,CACyB,CAC3B,EAUAzjB,EAAOonB,GAAK,SAAY3pB,GACtB,OAAO3E,KAAK6iB,QAAU7iB,KAAK4jB,QAAQjf,CAAI,EAAEzC,IAAIyC,CAAI,EAAIiF,GACvD,EAiBA1C,EAAOqnB,UAAY,WACjB,IACIxD,EADJ,OAAK/qB,KAAK6iB,SACNkI,EAAO/qB,KAAKitB,SAAS,EACzB/B,GAAgBlrB,KAAK4qB,OAAQG,CAAI,EAC1BN,EAAQzqB,KAAM,CACnBikB,OAAQ8G,CACV,EAAG,CAAA,CAAI,GALmB/qB,IAM5B,EAOAkH,EAAOsnB,QAAU,WACf,IACIzD,EADJ,OAAK/qB,KAAK6iB,SACNkI,EAAOS,GAAaxrB,KAAKuuB,UAAU,EAAEE,WAAW,EAAExB,SAAS,CAAC,EACzDxC,EAAQzqB,KAAM,CACnBikB,OAAQ8G,CACV,EAAG,CAAA,CAAI,GAJmB/qB,IAK5B,EAOAkH,EAAO0c,QAAU,WACf,IAAK,IAAIU,EAAO1kB,UAAU5B,OAAQ8Q,EAAQ,IAAIhM,MAAMwhB,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,CAAI,GACpF1V,EAAM0V,GAAQ5kB,UAAU4kB,GAE1B,GAAI,CAACxkB,KAAK6iB,QAAS,OAAO7iB,KAC1B,GAAqB,IAAjB8O,EAAM9Q,OACR,OAAOgC,KAST,IAJA,IAmCSxB,EAtCTsQ,EAAQA,EAAMnB,IAAI,SAAU+Q,GAC1B,OAAOmM,EAASsB,cAAczN,CAAC,CACjC,CAAC,EACGgQ,EAAQ,GACVC,EAAc,GACd5D,EAAO/qB,KAAKitB,SAAS,EAEd2B,EAAM,EAAGC,EAAiBvE,EAAgBsE,EAAMC,EAAe7wB,OAAQ4wB,CAAG,GAAI,CACrF,IAAI/P,EAAIgQ,EAAeD,GACvB,GAAwB,GAApB9f,EAAM9M,QAAQ6c,CAAC,EAAQ,CAEzB,IAGSiQ,EAJTC,EAAWlQ,EACPmQ,EAAM,EAGV,IAASF,KAAMH,EACbK,GAAOhvB,KAAK4qB,OAAOkE,GAAIjQ,GAAK8P,EAAYG,GACxCH,EAAYG,GAAM,EAIhBlZ,EAASmV,EAAKlM,EAAE,IAClBmQ,GAAOjE,EAAKlM,IAKd,IAAI9gB,EAAI6M,KAAK0S,MAAM0R,CAAG,EAEtBL,EAAY9P,IAAY,IAANmQ,EAAiB,KADnCN,EAAM7P,GAAK9gB,IACgC,GAG7C,MAAW6X,EAASmV,EAAKlM,EAAE,IACzB8P,EAAY9P,GAAKkM,EAAKlM,GAE1B,CAIA,IAASrgB,KAAOmwB,EACW,IAArBA,EAAYnwB,KACdkwB,EAAMK,IAAavwB,IAAQuwB,EAAWJ,EAAYnwB,GAAOmwB,EAAYnwB,GAAOwB,KAAK4qB,OAAOmE,GAAUvwB,IAItG,OADA0sB,GAAgBlrB,KAAK4qB,OAAQ8D,CAAK,EAC3BjE,EAAQzqB,KAAM,CACnBikB,OAAQyK,CACV,EAAG,CAAA,CAAI,CACT,EAOAxnB,EAAOunB,WAAa,WAClB,OAAKzuB,KAAK6iB,QACH7iB,KAAK4jB,QAAQ,QAAS,SAAU,QAAS,OAAQ,QAAS,UAAW,UAAW,cAAc,EAD3E5jB,IAE5B,EAOAkH,EAAO8mB,OAAS,WACd,GAAI,CAAChuB,KAAK6iB,QAAS,OAAO7iB,KAE1B,IADA,IAAIivB,EAAU,GACLC,EAAM,EAAGC,EAAgB9wB,OAAOoE,KAAKzC,KAAKikB,MAAM,EAAGiL,EAAMC,EAAcnxB,OAAQkxB,CAAG,GAAI,CAC7F,IAAIrQ,EAAIsQ,EAAcD,GACtBD,EAAQpQ,GAAwB,IAAnB7e,KAAKikB,OAAOpF,GAAW,EAAI,CAAC7e,KAAKikB,OAAOpF,EACvD,CACA,OAAO4L,EAAQzqB,KAAM,CACnBikB,OAAQgL,CACV,EAAG,CAAA,CAAI,CACT,EAOA/nB,EAAOkoB,YAAc,WACnB,OAAKpvB,KAAK6iB,QAEH4H,EAAQzqB,KAAM,CACnBikB,OAFSuH,GAAaxrB,KAAKikB,MAAM,CAGnC,EAAG,CAAA,CAAI,EAJmBjkB,IAK5B,EAYAkH,EAAOO,OAAS,SAAgBuN,GAC9B,GAAI,CAAChV,KAAK6iB,SAAW,CAAC7N,EAAM6N,QAC1B,MAAO,CAAA,EAET,GAAI,CAAC7iB,KAAK8L,IAAIrE,OAAOuN,EAAMlJ,GAAG,EAC5B,MAAO,CAAA,EAOT,IAAK,IALOujB,EAKHC,EAAM,EAAGC,EAAiBjF,EAAgBgF,EAAMC,EAAevxB,OAAQsxB,CAAG,GAAI,CACrF,IAAI5Q,EAAI6Q,EAAeD,GACvB,GAPUD,EAOFrvB,KAAKikB,OAAOvF,GAPN8Q,EAOUxa,EAAMiP,OAAOvF,GAAjC,EALO5f,KAAAA,IAAPuwB,GAA2B,IAAPA,EAAwBvwB,KAAAA,IAAP0wB,GAA2B,IAAPA,EACtDH,IAAOG,GAKZ,MAAO,CAAA,CAEX,CACA,MAAO,CAAA,CACT,EACApwB,EAAayrB,EAAU,CAAC,CACtBrsB,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK8L,IAAI9D,OAAS,IAC1C,CAOF,EAAG,CACDxJ,IAAK,kBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK8L,IAAIkF,gBAAkB,IACnD,CACF,EAAG,CACDxS,IAAK,QACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAOlV,OAAS,EAAInF,GACjD,CAMF,EAAG,CACDpL,IAAK,WACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAOjV,UAAY,EAAIpF,GACpD,CAMF,EAAG,CACDpL,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAOhV,QAAU,EAAIrF,GAClD,CAMF,EAAG,CACDpL,IAAK,QACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAO/U,OAAS,EAAItF,GACjD,CAMF,EAAG,CACDpL,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAO9U,MAAQ,EAAIvF,GAChD,CAMF,EAAG,CACDpL,IAAK,QACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAO7U,OAAS,EAAIxF,GACjD,CAMF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAOxW,SAAW,EAAI7D,GACnD,CAMF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAO5U,SAAW,EAAIzF,GACnD,CAMF,EAAG,CACDpL,IAAK,eACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKikB,OAAOyC,cAAgB,EAAI9c,GACxD,CAOF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAwB,OAAjBlC,KAAKgsB,OACd,CAMF,EAAG,CACDxtB,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ/nB,OAAS,IAC9C,CAMF,EAAG,CACDzF,IAAK,qBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ5T,YAAc,IACnD,CACF,EAAE,EACKyS,CACT,EAAEjsB,OAAO6wB,IAAI,4BAA4B,CAAC,EAEtCC,GAAY,mBA2BhB,IAAIC,GAAwB,SAAU9D,GAIpC,SAAS8D,EAAS7D,GAIhB9rB,KAAKgF,EAAI8mB,EAAO3J,MAIhBniB,KAAKuB,EAAIuqB,EAAOzJ,IAIhBriB,KAAKgsB,QAAUF,EAAOE,SAAW,KAIjChsB,KAAK4vB,gBAAkB,CAAA,CACzB,CAQAD,EAAS3D,QAAU,SAAiB/nB,EAAQmU,GAI1C,GAHoB,KAAA,IAAhBA,IACFA,EAAc,MAEZ,CAACnU,EACH,MAAM,IAAIW,EAAqB,kDAAkD,EAE/EonB,EAAU/nB,aAAkBkU,EAAUlU,EAAS,IAAIkU,EAAQlU,EAAQmU,CAAW,EAClF,GAAItG,EAAS+F,eACX,MAAM,IAAI1T,EAAqB6nB,CAAO,EAEtC,OAAO,IAAI2D,EAAS,CAClB3D,QAASA,CACX,CAAC,CAEL,EAQA2D,EAASE,cAAgB,SAAuB1N,EAAOE,GACrD,IA7E6BA,EA6EzByN,EAAaC,GAAiB5N,CAAK,EACrC6N,EAAWD,GAAiB1N,CAAG,EAC7B4N,GA/EyB5N,EA+EoB2N,GA/E3B7N,EA+Ee2N,IA9ExB3N,EAAMU,QAETR,GAAQA,EAAIQ,QAEbR,EAAMF,EACRwN,GAAS3D,QAAQ,mBAAoB,qEAAuE7J,EAAM+K,MAAM,EAAI,YAAc7K,EAAI6K,MAAM,CAAC,EAErJ,KAJAyC,GAAS3D,QAAQ,wBAAwB,EAFzC2D,GAAS3D,QAAQ,0BAA0B,GA8ElD,OAAqB,MAAjBiE,EACK,IAAIN,EAAS,CAClBxN,MAAO2N,EACPzN,IAAK2N,CACP,CAAC,EAEMC,CAEX,EAQAN,EAASO,MAAQ,SAAe/N,EAAOyL,GACjC1K,EAAM2H,EAASuB,iBAAiBwB,CAAQ,EAC1C1gB,EAAK6iB,GAAiB5N,CAAK,EAC7B,OAAOwN,EAASE,cAAc3iB,EAAIA,EAAGM,KAAK0V,CAAG,CAAC,CAChD,EAQAyM,EAASQ,OAAS,SAAgB9N,EAAKuL,GACjC1K,EAAM2H,EAASuB,iBAAiBwB,CAAQ,EAC1C1gB,EAAK6iB,GAAiB1N,CAAG,EAC3B,OAAOsN,EAASE,cAAc3iB,EAAG6gB,MAAM7K,CAAG,EAAGhW,CAAE,CACjD,EAUAyiB,EAASpD,QAAU,SAAiBC,EAAMnlB,GACxC,IAIM8a,EAOAE,EAAK+N,EAXPC,GAAU7D,GAAQ,IAAInV,MAAM,IAAK,CAAC,EACpCrS,EAAIqrB,EAAO,GACX9uB,EAAI8uB,EAAO,GACb,GAAIrrB,GAAKzD,EAAG,CAEV,IAEE+uB,GADAnO,EAAQ/O,EAASmZ,QAAQvnB,EAAGqC,CAAI,GACXwb,OAGvB,CAFE,MAAOthB,GACP+uB,EAAe,CAAA,CACjB,CAEA,IAEEF,GADA/N,EAAMjP,EAASmZ,QAAQhrB,EAAG8F,CAAI,GACbwb,OAGnB,CAFE,MAAOthB,GACP6uB,EAAa,CAAA,CACf,CACA,GAAIE,GAAgBF,EAClB,OAAOT,EAASE,cAAc1N,EAAOE,CAAG,EAE1C,GAAIiO,EAAc,CACZpN,EAAM2H,EAAS0B,QAAQhrB,EAAG8F,CAAI,EAClC,GAAI6b,EAAIL,QACN,OAAO8M,EAASO,MAAM/N,EAAOe,CAAG,CAEpC,MAAO,GAAIkN,EAAY,CACrB,IAAIG,EAAO1F,EAAS0B,QAAQvnB,EAAGqC,CAAI,EACnC,GAAIkpB,EAAK1N,QACP,OAAO8M,EAASQ,OAAO9N,EAAKkO,CAAI,CAEpC,CACF,CACA,OAAOZ,EAAS3D,QAAQ,aAAc,cAAiBQ,EAAO,gCAAgC,CAChG,EAOAmD,EAASa,WAAa,SAAoBhwB,GACxC,OAAOA,GAAKA,EAAEovB,iBAAmB,CAAA,CACnC,EAMA,IAAI1oB,EAASyoB,EAASnwB,UA4gBtB,OAtgBA0H,EAAOlJ,OAAS,SAAgB2G,GAI9B,OAHa,KAAA,IAATA,IACFA,EAAO,gBAEF3E,KAAK6iB,QAAU7iB,KAAKywB,WAAW1wB,MAAMC,KAAM,CAAC2E,EAAK,EAAEzC,IAAIyC,CAAI,EAAIiF,GACxE,EAWA1C,EAAOwH,MAAQ,SAAe/J,EAAM0C,GAIlC,IACI8a,EAGFE,EAJF,OAAKriB,KAAK6iB,SACNV,EAAQniB,KAAKmiB,MAAMuO,QAHrB/rB,EADW,KAAA,IAATA,EACK,eAGsBA,EAAM0C,CAAI,EASzCgb,GANEA,EADU,MAARhb,GAAgBA,EAAKspB,eACjB3wB,KAAKqiB,IAAIgM,YAAY,CACzBrmB,OAAQma,EAAMna,MAChB,CAAC,EAEKhI,KAAKqiB,KAEHqO,QAAQ/rB,EAAM0C,CAAI,EACrBuD,KAAK2B,MAAM8V,EAAIuO,KAAKzO,EAAOxd,CAAI,EAAEzC,IAAIyC,CAAI,CAAC,GAAK0d,EAAI/gB,QAAQ,IAAMtB,KAAKqiB,IAAI/gB,QAAQ,IAX/DsI,GAY5B,EAOA1C,EAAO2pB,QAAU,SAAiBlsB,GAChC,MAAO3E,CAAAA,CAAAA,KAAK6iB,UAAU7iB,KAAK8wB,QAAQ,GAAK9wB,KAAKuB,EAAEwsB,MAAM,CAAC,EAAE8C,QAAQ7wB,KAAKgF,EAAGL,CAAI,EAC9E,EAMAuC,EAAO4pB,QAAU,WACf,OAAO9wB,KAAKgF,EAAE1D,QAAQ,IAAMtB,KAAKuB,EAAED,QAAQ,CAC7C,EAOA4F,EAAO6pB,QAAU,SAAiBC,GAChC,MAAKhxB,CAAAA,CAAAA,KAAK6iB,SACH7iB,KAAKgF,EAAIgsB,CAClB,EAOA9pB,EAAO+pB,SAAW,SAAkBD,GAClC,MAAKhxB,CAAAA,CAAAA,KAAK6iB,SACH7iB,KAAKuB,GAAKyvB,CACnB,EAOA9pB,EAAOgqB,SAAW,SAAkBF,GAClC,MAAKhxB,CAAAA,CAAAA,KAAK6iB,SACH7iB,KAAKgF,GAAKgsB,GAAYhxB,KAAKuB,EAAIyvB,CACxC,EASA9pB,EAAO/E,IAAM,SAAakQ,GACxB,IAAIvK,EAAiB,KAAA,IAAVuK,EAAmB,GAAKA,EACjC8P,EAAQra,EAAKqa,MACbE,EAAMva,EAAKua,IACb,OAAKriB,KAAK6iB,QACH8M,EAASE,cAAc1N,GAASniB,KAAKgF,EAAGqd,GAAOriB,KAAKuB,CAAC,EADlCvB,IAE5B,EAOAkH,EAAOiqB,QAAU,WACf,IAAItoB,EAAQ7I,KACZ,GAAI,CAACA,KAAK6iB,QAAS,MAAO,GAC1B,IAAK,IAAIyB,EAAO1kB,UAAU5B,OAAQozB,EAAY,IAAItuB,MAAMwhB,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,CAAI,GACxF4M,EAAU5M,GAAQ5kB,UAAU4kB,GAU9B,IARA,IAAI6M,EAASD,EAAUzjB,IAAIoiB,EAAgB,EAAElM,OAAO,SAAUpL,GAC1D,OAAO5P,EAAMqoB,SAASzY,CAAC,CACzB,CAAC,EAAE6Y,KAAK,SAAU9vB,EAAG+vB,GACnB,OAAO/vB,EAAE6rB,SAAS,EAAIkE,EAAElE,SAAS,CACnC,CAAC,EACDmE,EAAU,GACRxsB,EAAIhF,KAAKgF,EACXjH,EAAI,EACCiH,EAAIhF,KAAKuB,GAAG,CACjB,IAAIkwB,EAAQJ,EAAOtzB,IAAMiC,KAAKuB,EAC5B4B,EAAO,CAACsuB,EAAQ,CAACzxB,KAAKuB,EAAIvB,KAAKuB,EAAIkwB,EACrCD,EAAQ/vB,KAAKkuB,EAASE,cAAc7qB,EAAG7B,CAAI,CAAC,EAC5C6B,EAAI7B,EACJpF,GAAK,CACP,CACA,OAAOyzB,CACT,EAQAtqB,EAAOwqB,QAAU,SAAiB9D,GAChC,IAAI1K,EAAM2H,EAASuB,iBAAiBwB,CAAQ,EAC5C,GAAI,CAAC5tB,KAAK6iB,SAAW,CAACK,EAAIL,SAAsC,IAA3BK,EAAIoL,GAAG,cAAc,EACxD,MAAO,GAMT,IAJA,IAAItpB,EAAIhF,KAAKgF,EACX2sB,EAAM,EAEJH,EAAU,GACPxsB,EAAIhF,KAAKuB,GAAG,CACjB,IAAIkwB,EAAQzxB,KAAKmiB,MAAM3U,KAAK0V,EAAI+K,SAAS,SAAUvQ,GACjD,OAAOA,EAAIiU,CACb,CAAC,CAAC,EACFxuB,EAAO,CAACsuB,EAAQ,CAACzxB,KAAKuB,EAAIvB,KAAKuB,EAAIkwB,EACnCD,EAAQ/vB,KAAKkuB,EAASE,cAAc7qB,EAAG7B,CAAI,CAAC,EAC5C6B,EAAI7B,EACJwuB,GAAO,CACT,CACA,OAAOH,CACT,EAOAtqB,EAAO0qB,cAAgB,SAAuBC,GAC5C,OAAK7xB,KAAK6iB,QACH7iB,KAAK0xB,QAAQ1xB,KAAKhC,OAAO,EAAI6zB,CAAa,EAAEtuB,MAAM,EAAGsuB,CAAa,EAD/C,EAE5B,EAOA3qB,EAAO4qB,SAAW,SAAkB9c,GAClC,OAAOhV,KAAKuB,EAAIyT,EAAMhQ,GAAKhF,KAAKgF,EAAIgQ,EAAMzT,CAC5C,EAOA2F,EAAO6qB,WAAa,SAAoB/c,GACtC,MAAKhV,CAAAA,CAAAA,KAAK6iB,SACH,CAAC7iB,KAAKuB,GAAM,CAACyT,EAAMhQ,CAC5B,EAOAkC,EAAO8qB,SAAW,SAAkBhd,GAClC,MAAKhV,CAAAA,CAAAA,KAAK6iB,SACH,CAAC7N,EAAMzT,GAAM,CAACvB,KAAKgF,CAC5B,EAOAkC,EAAO+qB,QAAU,SAAiBjd,GAChC,MAAKhV,CAAAA,CAAAA,KAAK6iB,SACH7iB,KAAKgF,GAAKgQ,EAAMhQ,GAAKhF,KAAKuB,GAAKyT,EAAMzT,CAC9C,EAOA2F,EAAOO,OAAS,SAAgBuN,GAC9B,MAAI,EAAChV,CAAAA,KAAK6iB,SAAY7N,CAAAA,EAAM6N,UAGrB7iB,KAAKgF,EAAEyC,OAAOuN,EAAMhQ,CAAC,GAAKhF,KAAKuB,EAAEkG,OAAOuN,EAAMzT,CAAC,CACxD,EASA2F,EAAOgrB,aAAe,SAAsBld,GAC1C,IACIhQ,EADJ,OAAKhF,KAAK6iB,SACN7d,GAAIhF,KAAKgF,EAAIgQ,EAAMhQ,EAAIhF,KAASgV,GAAJhQ,GAC9BzD,GAAIvB,KAAKuB,EAAIyT,EAAMzT,EAAIvB,KAASgV,GAAJzT,IAC1ByD,EACK,KAEA2qB,EAASE,cAAc7qB,EAAGzD,CAAC,GANVvB,IAQ5B,EAQAkH,EAAOirB,MAAQ,SAAend,GAC5B,IACIhQ,EADJ,OAAKhF,KAAK6iB,SACN7d,GAAIhF,KAAKgF,EAAIgQ,EAAMhQ,EAAIhF,KAASgV,GAAJhQ,EAC9BzD,GAAIvB,KAAKuB,EAAIyT,EAAMzT,EAAIvB,KAASgV,GAAJzT,EACvBouB,EAASE,cAAc7qB,EAAGzD,CAAC,GAHRvB,IAI5B,EAWA2vB,EAASyC,MAAQ,SAAeC,GAC9B,IAAIC,EAAwBD,EAAUf,KAAK,SAAU9vB,EAAG+vB,GACpD,OAAO/vB,EAAEwD,EAAIusB,EAAEvsB,CACjB,CAAC,EAAE+W,OAAO,SAAUjS,EAAOyoB,GACzB,IAAIC,EAAQ1oB,EAAM,GAChB0X,EAAU1X,EAAM,GAClB,OAAK0X,EAEMA,EAAQsQ,SAASS,CAAI,GAAK/Q,EAAQuQ,WAAWQ,CAAI,EACnD,CAACC,EAAOhR,EAAQ2Q,MAAMI,CAAI,GAE1B,CAACC,EAAMvT,OAAO,CAACuC,EAAQ,EAAG+Q,GAJ1B,CAACC,EAAOD,EAMnB,EAAG,CAAC,GAAI,KAAK,EACb7O,EAAQ4O,EAAsB,GAC9BG,EAAQH,EAAsB,GAIhC,OAHIG,GACF/O,EAAMjiB,KAAKgxB,CAAK,EAEX/O,CACT,EAOAiM,EAAS+C,IAAM,SAAaL,GAkB1B,IAjBA,IAAIM,EACAxQ,EAAQ,KACVyQ,EAAe,EACbpB,EAAU,GACZqB,EAAOR,EAAU1kB,IAAI,SAAU5P,GAC7B,MAAO,CAAC,CACN+0B,KAAM/0B,EAAEiH,EACRmD,KAAM,GACR,EAAG,CACD2qB,KAAM/0B,EAAEwD,EACR4G,KAAM,GACR,EACF,CAAC,EAKMwX,EAAY5c,GAJN4vB,EAAmB7vB,MAAMtD,WAAWyf,OAAOlf,MAAM4yB,EAAkBE,CAAI,EACpEvB,KAAK,SAAU9vB,EAAG+vB,GAChC,OAAO/vB,EAAEsxB,KAAOvB,EAAEuB,IACpB,CAAC,CACqD,EAAU,EAAElT,EAAQD,EAAU,GAAGhc,MACvF,IAAI5F,EAAI6hB,EAAMvd,MAGZ8f,EADmB,KADrByQ,GAA2B,MAAX70B,EAAEoK,KAAe,EAAI,CAAC,GAE5BpK,EAAE+0B,MAEN3Q,GAAS,CAACA,GAAU,CAACpkB,EAAE+0B,MACzBtB,EAAQ/vB,KAAKkuB,EAASE,cAAc1N,EAAOpkB,EAAE+0B,IAAI,CAAC,EAE5C,MAGZ,OAAOnD,EAASyC,MAAMZ,CAAO,CAC/B,EAOAtqB,EAAO6rB,WAAa,WAElB,IADA,IAAIjgB,EAAS9S,KACJ2kB,EAAQ/kB,UAAU5B,OAAQq0B,EAAY,IAAIvvB,MAAM6hB,CAAK,EAAGE,EAAQ,EAAGA,EAAQF,EAAOE,CAAK,GAC9FwN,EAAUxN,GAASjlB,UAAUilB,GAE/B,OAAO8K,EAAS+C,IAAI,CAAC1yB,MAAMif,OAAOoT,CAAS,CAAC,EAAE1kB,IAAI,SAAU5P,GAC1D,OAAO+U,EAAOof,aAAan0B,CAAC,CAC9B,CAAC,EAAE8lB,OAAO,SAAU9lB,GAClB,OAAOA,GAAK,CAACA,EAAE+yB,QAAQ,CACzB,CAAC,CACH,EAMA5pB,EAAOnF,SAAW,WAChB,OAAK/B,KAAK6iB,QACH,IAAM7iB,KAAKgF,EAAEkoB,MAAM,EAAI,MAAaltB,KAAKuB,EAAE2rB,MAAM,EAAI,IADlCwC,EAE5B,EAMAxoB,EAAO2kB,GAAe,WACpB,OAAI7rB,KAAK6iB,QACA,qBAAuB7iB,KAAKgF,EAAEkoB,MAAM,EAAI,UAAYltB,KAAKuB,EAAE2rB,MAAM,EAAI,KAErE,+BAAiCltB,KAAK2tB,cAAgB,IAEjE,EAoBAzmB,EAAO8rB,eAAiB,SAAwB5R,EAAY/Z,GAO1D,OANmB,KAAA,IAAf+Z,IACFA,EAAalc,GAEF,KAAA,IAATmC,IACFA,EAAO,IAEFrH,KAAK6iB,QAAU1B,EAAU/gB,OAAOJ,KAAKgF,EAAE8G,IAAI2G,MAAMpL,CAAI,EAAG+Z,CAAU,EAAEa,eAAejiB,IAAI,EAAI0vB,EACpG,EAQAxoB,EAAOgmB,MAAQ,SAAe7lB,GAC5B,OAAKrH,KAAK6iB,QACH7iB,KAAKgF,EAAEkoB,MAAM7lB,CAAI,EAAI,IAAMrH,KAAKuB,EAAE2rB,MAAM7lB,CAAI,EADzBqoB,EAE5B,EAQAxoB,EAAO+rB,UAAY,WACjB,OAAKjzB,KAAK6iB,QACH7iB,KAAKgF,EAAEiuB,UAAU,EAAI,IAAMjzB,KAAKuB,EAAE0xB,UAAU,EADzBvD,EAE5B,EASAxoB,EAAOimB,UAAY,SAAmB9lB,GACpC,OAAKrH,KAAK6iB,QACH7iB,KAAKgF,EAAEmoB,UAAU9lB,CAAI,EAAI,IAAMrH,KAAKuB,EAAE4rB,UAAU9lB,CAAI,EADjCqoB,EAE5B,EAaAxoB,EAAOylB,SAAW,SAAkBuG,EAAYC,GAE5CC,GADqB,KAAA,IAAXD,EAAoB,GAAKA,GACXE,UACxBA,EAAgC,KAAA,IAApBD,EAA6B,MAAQA,EACnD,OAAKpzB,KAAK6iB,QACH,GAAK7iB,KAAKgF,EAAE2nB,SAASuG,CAAU,EAAIG,EAAYrzB,KAAKuB,EAAEorB,SAASuG,CAAU,EADtDxD,EAE5B,EAcAxoB,EAAOupB,WAAa,SAAoB9rB,EAAM0C,GAC5C,OAAKrH,KAAK6iB,QAGH7iB,KAAKuB,EAAEqvB,KAAK5wB,KAAKgF,EAAGL,EAAM0C,CAAI,EAF5BwjB,EAASmB,QAAQhsB,KAAK2tB,aAAa,CAG9C,EASAzmB,EAAOosB,aAAe,SAAsBC,GAC1C,OAAO5D,EAASE,cAAc0D,EAAMvzB,KAAKgF,CAAC,EAAGuuB,EAAMvzB,KAAKuB,CAAC,CAAC,CAC5D,EACAnC,EAAauwB,EAAU,CAAC,CACtBnxB,IAAK,QACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKgF,EAAI,IACjC,CAOF,EAAG,CACDxG,IAAK,MACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKuB,EAAI,IACjC,CAMF,EAAG,CACD/C,IAAK,eACL0D,IAAK,WACH,OAAOlC,KAAK6iB,SAAU7iB,KAAKuB,EAAIvB,KAAKuB,EAAEwsB,MAAM,CAAC,EAAW,IAC1D,CAMF,EAAG,CACDvvB,IAAK,UACL0D,IAAK,WACH,OAA8B,OAAvBlC,KAAK2tB,aACd,CAMF,EAAG,CACDnvB,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ/nB,OAAS,IAC9C,CAMF,EAAG,CACDzF,IAAK,qBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ5T,YAAc,IACnD,CACF,EAAE,EACKuX,CACT,EAAE/wB,OAAO6wB,IAAI,4BAA4B,CAAC,EAKtC+D,GAAoB,WACtB,SAASA,KAqQT,OA/PAA,EAAKC,OAAS,SAAgBxqB,GACf,KAAA,IAATA,IACFA,EAAO6I,EAAS4D,aAElB,IAAIge,EAAQtgB,EAAS0E,IAAI,EAAEvK,QAAQtE,CAAI,EAAE9G,IAAI,CAC3CiD,MAAO,EACT,CAAC,EACD,MAAO,CAAC6D,EAAK0qB,aAAeD,EAAMlsB,SAAWksB,EAAMvxB,IAAI,CACrDiD,MAAO,CACT,CAAC,EAAEoC,MACL,EAOAgsB,EAAKI,gBAAkB,SAAyB3qB,GAC9C,OAAOL,EAASI,YAAYC,CAAI,CAClC,EAgBAuqB,EAAK/d,cAAgB,SAAyBhX,GAC5C,OAAOgX,EAAchX,EAAOqT,EAAS4D,WAAW,CAClD,EASA8d,EAAK3e,eAAiB,SAAwBxC,GAC5C,IAAIvK,EAAiB,KAAA,IAAVuK,EAAmB,GAAKA,EACjCwhB,EAAc/rB,EAAKE,OAEnB8rB,EAAchsB,EAAKisB,OAErB,QAD2B,KAAA,IAAhBD,EAAyB,KAAOA,IACzB5jB,EAAO9P,OAHE,KAAA,IAAhByzB,EAAyB,KAAOA,CAGL,GAAGhf,eAAe,CAC1D,EAUA2e,EAAKQ,0BAA4B,SAAmCb,GAClE,IAAIrpB,EAAmB,KAAA,IAAXqpB,EAAoB,GAAKA,EACnCc,EAAenqB,EAAM9B,OAErBksB,EAAepqB,EAAMiqB,OAEvB,QAD4B,KAAA,IAAjBG,EAA0B,KAAOA,IAC1BhkB,EAAO9P,OAHG,KAAA,IAAjB6zB,EAA0B,KAAOA,CAGN,GAAGnf,sBAAsB,CACjE,EASA0e,EAAKW,mBAAqB,SAA4BC,GACpD,IAAIC,EAAmB,KAAA,IAAXD,EAAoB,GAAKA,EACnCE,EAAeD,EAAMrsB,OAErBusB,EAAeF,EAAMN,OAGvB,QAF4B,KAAA,IAAjBQ,EAA0B,KAAOA,IAE1BrkB,EAAO9P,OAJG,KAAA,IAAjBk0B,EAA0B,KAAOA,CAIN,GAAGvf,eAAe,EAAExR,MAAM,CAClE,EAmBAiwB,EAAKvkB,OAAS,SAAgBjR,EAAQw2B,GACrB,KAAA,IAAXx2B,IACFA,EAAS,QAEX,IAAIy2B,EAAmB,KAAA,IAAXD,EAAoB,GAAKA,EACnCE,EAAeD,EAAMzsB,OAErB2sB,EAAwBF,EAAMzjB,gBAE9B4jB,EAAeH,EAAMV,OACrBA,EAA0B,KAAA,IAAjBa,EAA0B,KAAOA,EAC1CC,EAAuBJ,EAAMrkB,eAE/B,OAAQ2jB,GAAU7jB,EAAO9P,OAPG,KAAA,IAAjBs0B,EAA0B,KAAOA,EAEE,KAAA,IAA1BC,EAAmC,KAAOA,EAIlB,KAAA,IAAzBE,EAAkC,UAAYA,CACM,GAAG5lB,OAAOjR,CAAM,CACzF,EAeAw1B,EAAKsB,aAAe,SAAsB92B,EAAQ+2B,GACjC,KAAA,IAAX/2B,IACFA,EAAS,QAEX,IAAIg3B,EAAmB,KAAA,IAAXD,EAAoB,GAAKA,EACnCE,EAAeD,EAAMhtB,OAErBktB,EAAwBF,EAAMhkB,gBAE9BmkB,EAAeH,EAAMjB,OACrBA,EAA0B,KAAA,IAAjBoB,EAA0B,KAAOA,EAC1CC,EAAuBJ,EAAM5kB,eAE/B,OAAQ2jB,GAAU7jB,EAAO9P,OAPG,KAAA,IAAjB60B,EAA0B,KAAOA,EAEE,KAAA,IAA1BC,EAAmC,KAAOA,EAIlB,KAAA,IAAzBE,EAAkC,UAAYA,CACM,GAAGnmB,OAAOjR,EAAQ,CAAA,CAAI,CAC/F,EAgBAw1B,EAAKhgB,SAAW,SAAkBxV,EAAQq3B,GACzB,KAAA,IAAXr3B,IACFA,EAAS,QAEX,IAAIs3B,EAAmB,KAAA,IAAXD,EAAoB,GAAKA,EACnCE,EAAeD,EAAMttB,OAErBwtB,EAAwBF,EAAMtkB,gBAE9BykB,EAAeH,EAAMvB,OAEvB,QAD4B,KAAA,IAAjB0B,EAA0B,KAAOA,IAC1BvlB,EAAO9P,OALG,KAAA,IAAjBm1B,EAA0B,KAAOA,EAEE,KAAA,IAA1BC,EAAmC,KAAOA,EAGL,IAAI,GAAGhiB,SAASxV,CAAM,CACjF,EAcAw1B,EAAKkC,eAAiB,SAAwB13B,EAAQ23B,GACrC,KAAA,IAAX33B,IACFA,EAAS,QAEX,IAAI43B,EAAmB,KAAA,IAAXD,EAAoB,GAAKA,EACnCE,EAAeD,EAAM5tB,OAErB8tB,EAAwBF,EAAM5kB,gBAE9B+kB,EAAeH,EAAM7B,OAEvB,QAD4B,KAAA,IAAjBgC,EAA0B,KAAOA,IAC1B7lB,EAAO9P,OALG,KAAA,IAAjBy1B,EAA0B,KAAOA,EAEE,KAAA,IAA1BC,EAAmC,KAAOA,EAGL,IAAI,GAAGtiB,SAASxV,EAAQ,CAAA,CAAI,CACvF,EAUAw1B,EAAK9f,UAAY,SAAmBsiB,GAEhCC,GADqB,KAAA,IAAXD,EAAoB,GAAKA,GACdhuB,OAEvB,OAAOkI,EAAO9P,OADc,KAAA,IAAjB61B,EAA0B,KAAOA,CACjB,EAAEviB,UAAU,CACzC,EAYA8f,EAAK5f,KAAO,SAAc5V,EAAQk4B,GACjB,KAAA,IAAXl4B,IACFA,EAAS,SAGTm4B,GADqB,KAAA,IAAXD,EAAoB,GAAKA,GACdluB,OAEvB,OAAOkI,EAAO9P,OADc,KAAA,IAAjB+1B,EAA0B,KAAOA,EACf,KAAM,SAAS,EAAEviB,KAAK5V,CAAM,CAC3D,EAWAw1B,EAAK4C,SAAW,WACd,MAAO,CACLC,SAAUloB,GAAY,EACtBmoB,WAAY7hB,GAAkB,CAChC,CACF,EACO+e,CACT,EAAE,EAEF,SAAS+C,GAAQC,EAASC,GACN,SAAdC,EAAmCxpB,GACnC,OAAOA,EAAGypB,MAAM,EAAG,CACjBC,cAAe,CAAA,CACjB,CAAC,EAAElG,QAAQ,KAAK,EAAEpvB,QAAQ,CAC5B,CACA6R,EAAKujB,EAAYD,CAAK,EAAIC,EAAYF,CAAO,EAC/C,OAAO5rB,KAAK2B,MAAMse,EAASqB,WAAW/Y,CAAE,EAAEmb,GAAG,MAAM,CAAC,CACtD,CAsDA,SAASuI,GAAOL,EAASC,EAAO3nB,EAAOzH,GACrC,IAAIyvB,EAtDN,SAAwB7R,EAAQwR,EAAO3nB,GAuBrC,IAtBA,IAYIioB,EAAaC,EAFbxF,EAAU,GACVgF,EAAUvR,EAWLM,EAAK,EAAG0R,EAtBH,CAAC,CAAC,QAAS,SAAUz1B,EAAG+vB,GACpC,OAAOA,EAAEpsB,KAAO3D,EAAE2D,IACpB,GAAI,CAAC,WAAY,SAAU3D,EAAG+vB,GAC5B,OAAOA,EAAEvO,QAAUxhB,EAAEwhB,QAA8B,GAAnBuO,EAAEpsB,KAAO3D,EAAE2D,KAC7C,GAAI,CAAC,SAAU,SAAU3D,EAAG+vB,GAC1B,OAAOA,EAAEnsB,MAAQ5D,EAAE4D,MAA4B,IAAnBmsB,EAAEpsB,KAAO3D,EAAE2D,KACzC,GAAI,CAAC,QAAS,SAAU3D,EAAG+vB,GACrBpiB,EAAOonB,GAAQ/0B,EAAG+vB,CAAC,EACvB,OAAQpiB,EAAOA,EAAO,GAAK,CAC7B,GAAI,CAAC,OAAQonB,KAawBhR,EAAK0R,EAASj5B,OAAQunB,CAAE,GAAI,CAC/D,IAAI2R,EAAcD,EAAS1R,GACzB5gB,EAAOuyB,EAAY,GACnBC,EAASD,EAAY,GACI,GAAvBpoB,EAAM9M,QAAQ2C,CAAI,IAEpB6sB,EADAuF,EAAcpyB,GACEwyB,EAAOlS,EAAQwR,CAAK,EAEpBA,GADhBO,EAAYR,EAAQhpB,KAAKgkB,CAAO,IAG9BA,EAAQ7sB,EAAK,GAMA8xB,GALbxR,EAASuR,EAAQhpB,KAAKgkB,CAAO,KAO3BwF,EAAY/R,EAEZuM,EAAQ7sB,EAAK,GACbsgB,EAASuR,EAAQhpB,KAAKgkB,CAAO,IAG/BvM,EAAS+R,EAGf,CACA,MAAO,CAAC/R,EAAQuM,EAASwF,EAAWD,EACtC,EAEuCP,EAASC,EAAO3nB,CAAK,EACxDmW,EAAS6R,EAAgB,GACzBtF,EAAUsF,EAAgB,GAC1BE,EAAYF,EAAgB,GAC5BC,EAAcD,EAAgB,GAC5BM,EAAkBX,EAAQxR,EAC1BoS,EAAkBvoB,EAAM+U,OAAO,SAAUnF,GAC3C,OAAqE,GAA9D,CAAC,QAAS,UAAW,UAAW,gBAAgB1c,QAAQ0c,CAAC,CAClE,CAAC,EAUGkP,GAT2B,IAA3ByJ,EAAgBr5B,SAGhBg5B,EAFEA,EAAYP,EAEFxR,EAAOzX,OAAM8pB,EAAe,IAAiBP,GAAe,EAAGO,EAAa,EAEtFN,KAAc/R,IAChBuM,EAAQuF,IAAgBvF,EAAQuF,IAAgB,GAAKK,GAAmBJ,EAAY/R,IAGzE4F,EAASzY,WAAWof,EAASnqB,CAAI,GAChD,OAA6B,EAAzBgwB,EAAgBr5B,QAEVu5B,EAAuB1M,EAASqB,WAAWkL,EAAiB/vB,CAAI,GAAGuc,QAAQ7jB,MAAMw3B,EAAsBF,CAAe,EAAE7pB,KAAKogB,CAAQ,EAEtIA,CAEX,CAEA,IAAI4J,GAAc,oDAClB,SAASC,EAAQ9f,EAAO+f,GAMtB,OALa,KAAA,IAATA,IACFA,EAAO,SAAc35B,GACnB,OAAOA,CACT,GAEK,CACL4Z,MAAOA,EACPggB,MAAO,SAAe7vB,GAChB9C,EAAI8C,EAAK,GACb,OAAO4vB,EA9oHb,SAAqBE,GACnB,IAAIv1B,EAAQgI,SAASutB,EAAK,EAAE,EAC5B,GAAIjuB,MAAMtH,CAAK,EAAG,CAEhB,IAAK,IADLA,EAAQ,GACCtE,EAAI,EAAGA,EAAI65B,EAAI55B,OAAQD,CAAC,GAAI,CACnC,IAAI85B,EAAOD,EAAIE,WAAW/5B,CAAC,EAC3B,GAAgD,CAAC,IAA7C65B,EAAI75B,GAAGg6B,OAAOliB,GAAiBQ,OAAO,EACxChU,GAAS+U,GAAapV,QAAQ41B,EAAI75B,EAAE,OAEpC,IAAK,IAAIS,KAAO2Y,GAAuB,CACrC,IAAI6gB,EAAuB7gB,GAAsB3Y,GAC/Cy5B,EAAMD,EAAqB,GAC3BE,EAAMF,EAAqB,GACjBC,GAARJ,GAAeA,GAAQK,IACzB71B,GAASw1B,EAAOI,EAEpB,CAEJ,CACA,OAAO5tB,SAAShI,EAAO,EAAE,CAC3B,CACE,OAAOA,CAEX,EAunH8B2C,CAAC,CAAC,CAC5B,CACF,CACF,CACA,IACImzB,GAAc,KADPp5B,OAAOq5B,aAAa,GAAG,EACF,IAC5BC,GAAoB,IAAIzgB,OAAOugB,GAAa,GAAG,EACnD,SAASG,GAAatzB,GAGpB,OAAOA,EAAEsF,QAAQ,MAAO,MAAM,EAAEA,QAAQ+tB,GAAmBF,EAAW,CACxE,CACA,SAASI,GAAqBvzB,GAC5B,OAAOA,EAAEsF,QAAQ,MAAO,EAAE,EACzBA,QAAQ+tB,GAAmB,GAAG,EAC9BnkB,YAAY,CACf,CACA,SAASskB,EAAMC,EAASC,GACtB,OAAgB,OAAZD,EACK,KAEA,CACL9gB,MAAOC,OAAO6gB,EAAQ9qB,IAAI2qB,EAAY,EAAE1qB,KAAK,GAAG,CAAC,EACjD+pB,MAAO,SAAe7tB,GACpB,IAAI9E,EAAI8E,EAAM,GACd,OAAO2uB,EAAQpf,UAAU,SAAUtb,GACjC,OAAOw6B,GAAqBvzB,CAAC,IAAMuzB,GAAqBx6B,CAAC,CAC3D,CAAC,EAAI26B,CACP,CACF,CAEJ,CACA,SAASlxB,GAAOmQ,EAAOghB,GACrB,MAAO,CACLhhB,MAAOA,EACPggB,MAAO,SAAetD,GAGpB,OAAO9e,GAFC8e,EAAM,GACRA,EAAM,EACY,CAC1B,EACAsE,OAAQA,CACV,CACF,CACA,SAASC,GAAOjhB,GACd,MAAO,CACLA,MAAOA,EACPggB,MAAO,SAAelD,GAEpB,OADQA,EAAM,EAEhB,CACF,CACF,CASA,SAASoE,GAAahZ,EAAO/T,GAYf,SAAVgU,EAA2B5H,GACzB,MAAO,CACLP,MAAOC,OAAmBM,EAAE6H,IArBrBzV,QAAQ,8BAA+B,MAAM,CAqBpB,EAChCqtB,MAAO,SAAe3C,GAEpB,OADQA,EAAM,EAEhB,EACAlV,QAAS,CAAA,CACX,CACF,CApBF,IAAIgZ,EAAMvhB,EAAWzL,CAAG,EACtBitB,EAAMxhB,EAAWzL,EAAK,KAAK,EAC3BktB,EAAQzhB,EAAWzL,EAAK,KAAK,EAC7BmtB,EAAO1hB,EAAWzL,EAAK,KAAK,EAC5BotB,EAAM3hB,EAAWzL,EAAK,KAAK,EAC3BqtB,EAAW5hB,EAAWzL,EAAK,OAAO,EAClCstB,EAAa7hB,EAAWzL,EAAK,OAAO,EACpCutB,EAAW9hB,EAAWzL,EAAK,OAAO,EAClCwtB,EAAY/hB,EAAWzL,EAAK,OAAO,EACnCytB,EAAYhiB,EAAWzL,EAAK,OAAO,EACnC0tB,EAAYjiB,EAAWzL,EAAK,OAAO,EAqIjCnH,EA1HQ,SAAiBuT,GACzB,GAAI2H,EAAMC,QACR,OAAOA,EAAQ5H,CAAC,EAElB,OAAQA,EAAE6H,KAER,IAAK,IACH,OAAOyY,EAAM1sB,EAAI8H,KAAK,OAAO,EAAG,CAAC,EACnC,IAAK,KACH,OAAO4kB,EAAM1sB,EAAI8H,KAAK,MAAM,EAAG,CAAC,EAElC,IAAK,IACH,OAAO6jB,EAAQ4B,CAAQ,EACzB,IAAK,KACH,OAAO5B,EAAQ8B,EAAWzb,EAAc,EAC1C,IAAK,OACH,OAAO2Z,EAAQwB,CAAI,EACrB,IAAK,QACH,OAAOxB,EAAQ+B,CAAS,EAC1B,IAAK,SACH,OAAO/B,EAAQyB,CAAG,EAEpB,IAAK,IACH,OAAOzB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,MACH,OAAOP,EAAM1sB,EAAImD,OAAO,QAAS,CAAA,CAAI,EAAG,CAAC,EAC3C,IAAK,OACH,OAAOupB,EAAM1sB,EAAImD,OAAO,OAAQ,CAAA,CAAI,EAAG,CAAC,EAC1C,IAAK,IACH,OAAOwoB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,MACH,OAAOP,EAAM1sB,EAAImD,OAAO,QAAS,CAAA,CAAK,EAAG,CAAC,EAC5C,IAAK,OACH,OAAOupB,EAAM1sB,EAAImD,OAAO,OAAQ,CAAA,CAAK,EAAG,CAAC,EAE3C,IAAK,IACH,OAAOwoB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EAEpB,IAAK,IACH,OAAOtB,EAAQ2B,CAAU,EAC3B,IAAK,MACH,OAAO3B,EAAQuB,CAAK,EAEtB,IAAK,KACH,OAAOvB,EAAQsB,CAAG,EACpB,IAAK,IACH,OAAOtB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,IACH,OAAOtB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,IAEL,IAAK,IACH,OAAOtB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,IACH,OAAOtB,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EACpB,IAAK,IACH,OAAOtB,EAAQ2B,CAAU,EAC3B,IAAK,MACH,OAAO3B,EAAQuB,CAAK,EACtB,IAAK,IACH,OAAOJ,GAAOU,CAAS,EACzB,IAAK,KACH,OAAOV,GAAOO,CAAQ,EACxB,IAAK,MACH,OAAO1B,EAAQqB,CAAG,EAEpB,IAAK,IACH,OAAON,EAAM1sB,EAAI4H,UAAU,EAAG,CAAC,EAEjC,IAAK,OACH,OAAO+jB,EAAQwB,CAAI,EACrB,IAAK,KACH,OAAOxB,EAAQ8B,EAAWzb,EAAc,EAE1C,IAAK,IACH,OAAO2Z,EAAQ0B,CAAQ,EACzB,IAAK,KACH,OAAO1B,EAAQsB,CAAG,EAEpB,IAAK,IACL,IAAK,IACH,OAAOtB,EAAQqB,CAAG,EACpB,IAAK,MACH,OAAON,EAAM1sB,EAAI0H,SAAS,QAAS,CAAA,CAAK,EAAG,CAAC,EAC9C,IAAK,OACH,OAAOglB,EAAM1sB,EAAI0H,SAAS,OAAQ,CAAA,CAAK,EAAG,CAAC,EAC7C,IAAK,MACH,OAAOglB,EAAM1sB,EAAI0H,SAAS,QAAS,CAAA,CAAI,EAAG,CAAC,EAC7C,IAAK,OACH,OAAOglB,EAAM1sB,EAAI0H,SAAS,OAAQ,CAAA,CAAI,EAAG,CAAC,EAE5C,IAAK,IACL,IAAK,KACH,OAAOhM,GAAO,IAAIoQ,OAAO,QAAUuhB,EAASt5B,OAAS,SAAWk5B,EAAIl5B,OAAS,KAAK,EAAG,CAAC,EACxF,IAAK,MACH,OAAO2H,GAAO,IAAIoQ,OAAO,QAAUuhB,EAASt5B,OAAS,KAAOk5B,EAAIl5B,OAAS,IAAI,EAAG,CAAC,EAGnF,IAAK,IACH,OAAO+4B,GAAO,oBAAoB,EAGpC,IAAK,IACH,OAAOA,GAAO,WAAW,EAC3B,QACE,OAAO9Y,EAAQ5H,CAAC,CACpB,CACF,EACiB2H,CAAK,GAAK,CAC3B8N,cAAe6J,EACjB,EAEA,OADA7yB,EAAKkb,MAAQA,EACNlb,CACT,CACA,IAAI80B,GAA0B,CAC5Bt0B,KAAM,CACJu0B,UAAW,KACX9qB,QAAS,OACX,EACAxJ,MAAO,CACLwJ,QAAS,IACT8qB,UAAW,KACXC,MAAO,MACPC,KAAM,MACR,EACAv0B,IAAK,CACHuJ,QAAS,IACT8qB,UAAW,IACb,EACAl0B,QAAS,CACPm0B,MAAO,MACPC,KAAM,MACR,EACAC,UAAW,IACXC,UAAW,IACXjwB,OAAQ,CACN+E,QAAS,IACT8qB,UAAW,IACb,EACAK,OAAQ,CACNnrB,QAAS,IACT8qB,UAAW,IACb,EACA7zB,OAAQ,CACN+I,QAAS,IACT8qB,UAAW,IACb,EACA3zB,OAAQ,CACN6I,QAAS,IACT8qB,UAAW,IACb,EACAzzB,aAAc,CACZ2zB,KAAM,QACND,MAAO,KACT,CACF,EA8IA,IAAIK,GAAqB,KAkBzB,SAASC,GAAkBzW,EAAQxb,GACjC,IAAI2qB,EACJ,OAAQA,EAAmB7vB,MAAMtD,WAAWyf,OAAOlf,MAAM4yB,EAAkBnP,EAAO7V,IAAI,SAAUuK,GAC9F,OAdkClQ,EAcFA,GAdL6X,EAcE3H,GAbrB4H,SAKI,OADV0D,EAAS0W,GADI/Y,EAAUU,uBAAuBhC,EAAME,GAAG,EACf/X,CAAM,IAC5Bwb,EAAOnS,SAASvS,KAAAA,CAAS,EACtC+gB,EAEF2D,EATT,IAAsCxb,CAepC,CAAC,CAAC,CACJ,CAMA,IAAImyB,GAA2B,WAC7B,SAASA,EAAYnyB,EAAQT,GAU3B,IAGI6yB,EAZJp6B,KAAKgI,OAASA,EACdhI,KAAKuH,OAASA,EACdvH,KAAKwjB,OAASyW,GAAkB9Y,EAAUG,YAAY/Z,CAAM,EAAGS,CAAM,EACrEhI,KAAK8O,MAAQ9O,KAAKwjB,OAAO7V,IAAI,SAAUuK,GACrC,OAAO2gB,GAAa3gB,EAAGlQ,CAAM,CAC/B,CAAC,EACDhI,KAAKq6B,kBAAoBr6B,KAAK8O,MAAMkF,KAAK,SAAUkE,GACjD,OAAOA,EAAEyV,aACX,CAAC,EACI3tB,KAAKq6B,oBAGND,GAFEE,EArID,CAAC,KANUxrB,EA2Ie9O,KAAK8O,OA1IvBnB,IAAI,SAAU+Q,GAC3B,OAAOA,EAAE/G,KACX,CAAC,EAAEoE,OAAO,SAAU7I,EAAGmC,GACrB,OAAOnC,EAAI,IAAMmC,EAAExV,OAAS,GAC9B,EAAG,EAAE,EACc,IAAKiP,IAuIK,GACzB9O,KAAK2X,MAAQC,OAFG0iB,EAAY,GAEK,GAAG,EACpCt6B,KAAKo6B,SAAWA,EAEpB,CA2CA,OA1CaD,EAAY36B,UAClB+6B,kBAAoB,SAA2B97B,GACpD,GAAKuB,KAAK6iB,QAMH,CACL,IAAI2X,EAnJV,SAAe/7B,EAAOkZ,EAAOyiB,GAC3B,IAAIK,EAAUh8B,EAAM6W,MAAMqC,CAAK,EAC/B,GAAI8iB,EAAS,CACX,IAES18B,EAED28B,EACF/B,EALFgC,EAAM,GACNC,EAAa,EACjB,IAAS78B,KAAKq8B,EACRt6B,EAAes6B,EAAUr8B,CAAC,IAE1B46B,GADE+B,EAAIN,EAASr8B,IACJ46B,OAAS+B,EAAE/B,OAAS,EAAI,EACjC,CAAC+B,EAAE5a,SAAW4a,EAAE7a,QAClB8a,EAAID,EAAE7a,MAAME,IAAI,IAAM2a,EAAE/C,MAAM8C,EAAQl3B,MAAMq3B,EAAYA,EAAajC,CAAM,CAAC,GAE9EiC,GAAcjC,GAGlB,MAAO,CAAC8B,EAASE,EACnB,CACE,MAAO,CAACF,EAAS,GAErB,EAgIyBh8B,EAAOuB,KAAK2X,MAAO3X,KAAKo6B,QAAQ,EACjDS,EAAaL,EAAO,GACpBC,EAAUD,EAAO,GACjBlF,EAAQmF,GAhGVxxB,EAAO,KAENmB,GApCsBqwB,EAkIiBA,GA9FnBttB,CAAC,IACxBlE,EAAOL,EAASxI,OAAOq6B,EAAQttB,CAAC,GAE7B/C,EAAYqwB,EAAQK,CAAC,IACnB7xB,EAAAA,GACI,IAAIiM,EAAgBulB,EAAQK,CAAC,EAEtCC,EAAiBN,EAAQK,GAEtB1wB,EAAYqwB,EAAQO,CAAC,IACxBP,EAAQQ,EAAsB,GAAjBR,EAAQO,EAAI,GAAS,GAE/B5wB,EAAYqwB,EAAQC,CAAC,IACpBD,EAAQC,EAAI,IAAoB,IAAdD,EAAQj5B,EAC5Bi5B,EAAQC,GAAK,GACU,KAAdD,EAAQC,GAA0B,IAAdD,EAAQj5B,IACrCi5B,EAAQC,EAAI,IAGE,IAAdD,EAAQS,GAAWT,EAAQU,IAC7BV,EAAQU,EAAI,CAACV,EAAQU,GAElB/wB,EAAYqwB,EAAQ/b,CAAC,IACxB+b,EAAQW,EAAIte,GAAY2d,EAAQ/b,CAAC,GAS5B,CAPIrgB,OAAOoE,KAAKg4B,CAAO,EAAE1e,OAAO,SAAU1G,EAAGwJ,GAClD,IAAI3L,EA7DQ,SAAiB2M,GAC7B,OAAQA,GACN,IAAK,IACH,MAAO,cACT,IAAK,IACH,MAAO,SACT,IAAK,IACH,MAAO,SACT,IAAK,IACL,IAAK,IACH,MAAO,OACT,IAAK,IACH,MAAO,MACT,IAAK,IACH,MAAO,UACT,IAAK,IACL,IAAK,IACH,MAAO,QACT,IAAK,IACH,MAAO,OACT,IAAK,IACL,IAAK,IACH,MAAO,UACT,IAAK,IACH,MAAO,aACT,IAAK,IACH,MAAO,WACT,IAAK,IACH,MAAO,UACT,QACE,OAAO,IACX,CACF,EA6BkBhB,CAAC,EAIjB,OAHI3L,IACFmC,EAAEnC,GAAKunB,EAAQ5b,IAEVxJ,CACT,EAAG,EAAE,EACSpM,EAAM8xB,IA8DmC,CAAC,KAAM,KAAMj8B,KAAAA,GAC9D4pB,EAAS4M,EAAM,GACfrsB,EAAOqsB,EAAM,GACbyF,EAAiBzF,EAAM,GACzB,GAAIx1B,EAAe26B,EAAS,GAAG,GAAK36B,EAAe26B,EAAS,GAAG,EAC7D,MAAM,IAAIl2B,EAA8B,uDAAuD,EAEjG,MAAO,CACL9F,MAAOA,EACP+kB,OAAQxjB,KAAKwjB,OACb7L,MAAO3X,KAAK2X,MACZkjB,WAAYA,EACZJ,QAASA,EACT/R,OAAQA,EACRzf,KAAMA,EACN8xB,eAAgBA,CAClB,CACF,CA1BE,MAAO,CACLt8B,MAAOA,EACP+kB,OAAQxjB,KAAKwjB,OACbmK,cAAe3tB,KAAK2tB,aACtB,EA7HN,IAA6B8M,EAmCvBM,EADA9xB,CAkHJ,EACA7J,EAAa+6B,EAAa,CAAC,CACzB37B,IAAK,UACL0D,IAAK,WACH,MAAO,CAAClC,KAAKq6B,iBACf,CACF,EAAG,CACD77B,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAKq6B,kBAAoBr6B,KAAKq6B,kBAAkB1M,cAAgB,IACzE,CACF,EAAE,EACKwM,CACT,EAAE,EACF,SAASI,GAAkBvyB,EAAQvJ,EAAO8I,GAExC,OADa,IAAI4yB,GAAYnyB,EAAQT,CAAM,EAC7BgzB,kBAAkB97B,CAAK,CACvC,CASA,SAASy7B,GAAmB9Y,EAAYpZ,GACtC,IAKI8F,EACAutB,EANJ,OAAKja,GAKDtT,GADAwtB,EADYna,EAAU/gB,OAAO4H,EAAQoZ,CAAU,EAChC9N,YA3Gd0mB,GAAAA,IACkB5mB,EAAS8Y,WAAW,aAAa,CA0GP,GAClCniB,cAAc,EACzBsxB,EAAeC,EAAGhzB,gBAAgB,EAC/BwF,EAAMH,IAAI,SAAU/M,GACzB,OA9PwBwgB,EA8PDA,EA9Paia,EA8PDA,EA7PjClzB,GADgB4F,EA8PEnN,GA7PNuH,KACd9F,EAAQ0L,EAAK1L,MACF,YAAT8F,EAEK,CACL2X,QAAS,EAFPyb,EAAU,QAAQ73B,KAAKrB,CAAK,GAG9B0d,IAAKwb,EAAU,IAAMl5B,CACvB,GAEE6L,EAAQkT,EAAWjZ,GAMV,UADTqzB,EAAarzB,KAGbqzB,EADuB,MAArBpa,EAAWvX,OACAuX,EAAWvX,OAAS,SAAW,SACX,MAAxBuX,EAAWhb,UACS,QAAzBgb,EAAWhb,WAAgD,QAAzBgb,EAAWhb,UAClC,SAEA,SAKFi1B,EAAaxxB,OAAS,SAAW,WAKhDkW,EADiB,UAAf,OADAA,EAAM0Z,GAAwB+B,IAE1Bzb,EAAI7R,GAER6R,GACK,CACLD,QAAS,CAAA,EACTC,IAAKA,CACP,EAJF,KAAA,GAnCF,IAA4BqB,EAAYia,EAUlCntB,EATA/F,CA8PJ,CAAC,GARQ,IASX,CAEA,IAAIszB,GAAU,mBAEd,SAASC,GAAgBzyB,GACvB,OAAO,IAAIkP,EAAQ,mBAAoB,aAAgBlP,EAAKzF,KAAO,oBAAqB,CAC1F,CAMA,SAASm4B,GAAuBzuB,GAI9B,OAHoB,OAAhBA,EAAG+M,WACL/M,EAAG+M,SAAWR,GAAgBvM,EAAGyU,CAAC,GAE7BzU,EAAG+M,QACZ,CAKA,SAAS2hB,GAA4B1uB,GAInC,OAHyB,OAArBA,EAAG2uB,gBACL3uB,EAAG2uB,cAAgBpiB,GAAgBvM,EAAGyU,EAAGzU,EAAGpB,IAAIgJ,sBAAsB,EAAG5H,EAAGpB,IAAI+I,eAAe,CAAC,GAE3F3H,EAAG2uB,aACZ,CAIA,SAASppB,EAAMqpB,EAAMppB,GACf8O,EAAU,CACZpa,GAAI00B,EAAK10B,GACT6B,KAAM6yB,EAAK7yB,KACX0Y,EAAGma,EAAKna,EACRnhB,EAAGs7B,EAAKt7B,EACRsL,IAAKgwB,EAAKhwB,IACVkgB,QAAS8P,EAAK9P,OAChB,EACA,OAAO,IAAI5Y,EAAS3T,EAAS,GAAI+hB,EAAS9O,EAAM,CAC9CqpB,IAAKva,CACP,CAAC,CAAC,CACJ,CAIA,SAASwa,GAAUC,EAASz7B,EAAG07B,GAE7B,IAAIC,EAAWF,EAAc,GAAJz7B,EAAS,IAG9B47B,EAAKF,EAAG10B,OAAO20B,CAAQ,EAG3B,OAAI37B,IAAM47B,EACD,CAACD,EAAU37B,GAQhB47B,KADAC,EAAKH,EAAG10B,OAHZ20B,GAAuB,IAAVC,EAAK57B,GAAU,GAGD,GAElB,CAAC27B,EAAUC,GAIb,CAACH,EAA6B,GAAnBrxB,KAAKqtB,IAAImE,EAAIC,CAAE,EAAS,IAAMzxB,KAAKstB,IAAIkE,EAAIC,CAAE,EACjE,CAGA,SAASC,GAAQl1B,EAAII,GACnBJ,GAAe,GAATI,EAAc,IAChBiR,EAAI,IAAIxQ,KAAKb,CAAE,EACnB,MAAO,CACLjC,KAAMsT,EAAEG,eAAe,EACvBxT,MAAOqT,EAAE8jB,YAAY,EAAI,EACzBl3B,IAAKoT,EAAE+jB,WAAW,EAClB52B,KAAM6S,EAAEgkB,YAAY,EACpB52B,OAAQ4S,EAAEikB,cAAc,EACxB32B,OAAQ0S,EAAEkkB,cAAc,EACxB7xB,YAAa2N,EAAEmkB,mBAAmB,CACpC,CACF,CAGA,SAASC,GAAQjiB,EAAKpT,EAAQyB,GAC5B,OAAO+yB,GAAUrxB,GAAaiQ,CAAG,EAAGpT,EAAQyB,CAAI,CAClD,CAGA,SAAS6zB,GAAWhB,EAAM5Y,GACxB,IAAI6Z,EAAOjB,EAAKt7B,EACd2E,EAAO22B,EAAKna,EAAExc,KAAOyF,KAAK0S,MAAM4F,EAAInU,KAAK,EACzC3J,EAAQ02B,EAAKna,EAAEvc,MAAQwF,KAAK0S,MAAM4F,EAAIjU,MAAM,EAA+B,EAA3BrE,KAAK0S,MAAM4F,EAAIlU,QAAQ,EACvE2S,EAAIliB,EAAS,GAAIq8B,EAAKna,EAAG,CACvBxc,KAAMA,EACNC,MAAOA,EACPC,IAAKuF,KAAKqtB,IAAI6D,EAAKna,EAAEtc,IAAKiW,GAAYnW,EAAMC,CAAK,CAAC,EAAIwF,KAAK0S,MAAM4F,EAAI/T,IAAI,EAA4B,EAAxBvE,KAAK0S,MAAM4F,EAAIhU,KAAK,CACnG,CAAC,EACD8tB,EAAcnS,EAASzY,WAAW,CAChCrD,MAAOmU,EAAInU,MAAQnE,KAAK0S,MAAM4F,EAAInU,KAAK,EACvCC,SAAUkU,EAAIlU,SAAWpE,KAAK0S,MAAM4F,EAAIlU,QAAQ,EAChDC,OAAQiU,EAAIjU,OAASrE,KAAK0S,MAAM4F,EAAIjU,MAAM,EAC1CC,MAAOgU,EAAIhU,MAAQtE,KAAK0S,MAAM4F,EAAIhU,KAAK,EACvCC,KAAM+T,EAAI/T,KAAOvE,KAAK0S,MAAM4F,EAAI/T,IAAI,EACpCC,MAAO8T,EAAI9T,MACX3B,QAASyV,EAAIzV,QACb4B,QAAS6T,EAAI7T,QACbqX,aAAcxD,EAAIwD,YACpB,CAAC,EAAE4H,GAAG,cAAc,EAElB2O,EAAajB,GADLrxB,GAAagX,CAAC,EACUob,EAAMjB,EAAK7yB,IAAI,EACjD7B,EAAK61B,EAAW,GAChBz8B,EAAIy8B,EAAW,GAMjB,OALoB,IAAhBD,IAGFx8B,EAAIs7B,EAAK7yB,KAAKzB,OAFdJ,GAAM41B,CAEiB,GAElB,CACL51B,GAAIA,EACJ5G,EAAGA,CACL,CACF,CAIA,SAAS08B,GAAoB1yB,EAAQ2yB,EAAY91B,EAAME,EAAQilB,EAAMuO,GACnE,IAAIxtB,EAAUlG,EAAKkG,QACjBtE,EAAO5B,EAAK4B,KACd,OAAIuB,GAAyC,IAA/BnM,OAAOoE,KAAK+H,CAAM,EAAExM,QAAgBm/B,GAE9CrB,EAAO1oB,EAAShB,WAAW5H,EAAQ/K,EAAS,GAAI4H,EAAM,CACpD4B,KAFqBk0B,GAAcl0B,EAGnC8xB,eAAgBA,CAClB,CAAC,CAAC,EACGxtB,EAAUuuB,EAAOA,EAAKvuB,QAAQtE,CAAI,GAElCmK,EAAS4Y,QAAQ,IAAI7T,EAAQ,aAAc,cAAiBqU,EAAO,yBAA2BjlB,CAAM,CAAC,CAEhH,CAIA,SAAS61B,GAAalwB,EAAI3F,EAAQqb,GAIhC,OAHe,KAAA,IAAXA,IACFA,EAAS,CAAA,GAEJ1V,EAAG2V,QAAU1B,EAAU/gB,OAAO8P,EAAO9P,OAAO,OAAO,EAAG,CAC3DwiB,OAAQA,EACRvW,YAAa,CAAA,CACf,CAAC,EAAEmW,yBAAyBtV,EAAI3F,CAAM,EAAI,IAC5C,CACA,SAAS81B,GAAW78B,EAAG88B,EAAUC,GAC/B,IAAIC,EAAwB,KAAXh9B,EAAEmhB,EAAExc,MAAe3E,EAAEmhB,EAAExc,KAAO,EAC3Cwc,EAAI,GAGR,GAFI6b,GAA0B,GAAZh9B,EAAEmhB,EAAExc,OAAWwc,GAAK,KACtCA,GAAK5U,EAASvM,EAAEmhB,EAAExc,KAAMq4B,EAAa,EAAI,CAAC,EACxB,SAAdD,EAAJ,CACA,GAAID,EAAU,CAGZ,GADA3b,GADAA,GAAK,KACA5U,EAASvM,EAAEmhB,EAAEvc,KAAK,EACL,UAAdm4B,EAAuB,OAAO5b,EAClCA,GAAK,GACP,MAEE,GADAA,GAAK5U,EAASvM,EAAEmhB,EAAEvc,KAAK,EACL,UAAdm4B,EAAuB,OAAO5b,EAEpCA,GAAK5U,EAASvM,EAAEmhB,EAAEtc,GAAG,CAVa,CAWlC,OAAOsc,CACT,CACA,SAAS8b,GAAWj9B,EAAG88B,EAAU/P,EAAiBD,EAAsBG,EAAeiQ,EAAcH,GACnG,IAAII,EAAc,CAACpQ,GAAuC,IAApB/sB,EAAEmhB,EAAE7W,aAAoC,IAAftK,EAAEmhB,EAAE5b,OACjE4b,EAAI,GACN,OAAQ4b,GACN,IAAK,MACL,IAAK,QACL,IAAK,OACH,MACF,QAEE,GADA5b,GAAK5U,EAASvM,EAAEmhB,EAAE/b,IAAI,EACJ,SAAd23B,EAAJ,CACA,GAAID,EAAU,CAGZ,GADA3b,GADAA,GAAK,KACA5U,EAASvM,EAAEmhB,EAAE9b,MAAM,EACN,WAAd03B,EAAwB,MACxBI,IAEFhc,GADAA,GAAK,KACA5U,EAASvM,EAAEmhB,EAAE5b,MAAM,EAE5B,KAAO,CAEL,GADA4b,GAAK5U,EAASvM,EAAEmhB,EAAE9b,MAAM,EACN,WAAd03B,EAAwB,MACxBI,IACFhc,GAAK5U,EAASvM,EAAEmhB,EAAE5b,MAAM,EAE5B,CACkB,WAAdw3B,GACAI,CAAAA,GAAiBrQ,GAA4C,IAApB9sB,EAAEmhB,EAAE7W,cAE/C6W,GADAA,GAAK,KACA5U,EAASvM,EAAEmhB,EAAE7W,YAAa,CAAC,EAnBH,CAqBnC,CAmBA,OAlBI2iB,IACEjtB,EAAEmiB,eAA8B,IAAbniB,EAAEgH,QAAgB,CAACk2B,EACxC/b,GAAK,IAKLA,EAJSnhB,EAAEA,EAAI,GAGfmhB,GAFAA,GAAK,KACA5U,EAASnC,KAAK0S,MAAM,CAAC9c,EAAEA,EAAI,EAAE,CAAC,EAC9B,KACAuM,EAASnC,KAAK0S,MAAM,CAAC9c,EAAEA,EAAI,EAAE,CAAC,GAInCmhB,GAFAA,GAAK,KACA5U,EAASnC,KAAK0S,MAAM9c,EAAEA,EAAI,EAAE,CAAC,EAC7B,KACAuM,EAASnC,KAAK0S,MAAM9c,EAAEA,EAAI,EAAE,CAAC,GAGlCk9B,IACF/b,GAAK,IAAMnhB,EAAEyI,KAAK20B,SAAW,KAExBjc,CACT,CAGA,IAuMIkc,GAvMAC,GAAoB,CACpB14B,MAAO,EACPC,IAAK,EACLO,KAAM,EACNC,OAAQ,EACRE,OAAQ,EACR+E,YAAa,CACf,EACAizB,GAAwB,CACtBlkB,WAAY,EACZrU,QAAS,EACTI,KAAM,EACNC,OAAQ,EACRE,OAAQ,EACR+E,YAAa,CACf,EACAkzB,GAA2B,CACzB9kB,QAAS,EACTtT,KAAM,EACNC,OAAQ,EACRE,OAAQ,EACR+E,YAAa,CACf,EAGEmzB,GAAe,CAAC,OAAQ,QAAS,MAAO,OAAQ,SAAU,SAAU,eACtEC,GAAmB,CAAC,WAAY,aAAc,UAAW,OAAQ,SAAU,SAAU,eACrFC,GAAsB,CAAC,OAAQ,UAAW,OAAQ,SAAU,SAAU,eAGxE,SAAShS,GAAcxnB,GACrB,IAAIga,EAAa,CACfxZ,KAAM,OACN4J,MAAO,OACP3J,MAAO,QACP6J,OAAQ,QACR5J,IAAK,MACL8J,KAAM,MACNvJ,KAAM,OACNwJ,MAAO,OACPvJ,OAAQ,SACR4H,QAAS,SACTuV,QAAS,UACThU,SAAU,UACVjJ,OAAQ,SACRsJ,QAAS,SACTvE,YAAa,cACb4b,aAAc,cACdlhB,QAAS,UACTgO,SAAU,UACV4qB,WAAY,aACZC,YAAa,aACbC,YAAa,aACbC,SAAU,WACVC,UAAW,WACXtlB,QAAS,SACX,EAAEvU,EAAKuP,YAAY,GACnB,GAAKyK,EACL,OAAOA,EADU,MAAM,IAAIla,EAAiBE,CAAI,CAElD,CACA,SAAS85B,GAA4B95B,GACnC,OAAQA,EAAKuP,YAAY,GACvB,IAAK,eACL,IAAK,gBACH,MAAO,eACT,IAAK,kBACL,IAAK,mBACH,MAAO,kBACT,IAAK,gBACL,IAAK,iBACH,MAAO,gBACT,QACE,OAAOiY,GAAcxnB,CAAI,CAC7B,CACF,CA+CA,SAAS+5B,GAAQ9jB,EAAKvT,GACpB,IAAI4B,EAAOwM,EAAcpO,EAAK4B,KAAM6I,EAAS4D,WAAW,EACxD,GAAI,CAACzM,EAAK4Z,QACR,OAAOzP,EAAS4Y,QAAQ0P,GAAgBzyB,CAAI,CAAC,EAE/C,IAhBI01B,EAgBA7yB,EAAMoE,EAAOkC,WAAW/K,CAAI,EAIhC,GAAK+C,EAAYwQ,EAAIzV,IAAI,EAgBvBiC,EAAK0K,EAASgG,IAAI,MAhBQ,CAC1B,IAAK,IAAIyN,EAAK,EAAGuI,EAAgBmQ,GAAc1Y,EAAKuI,EAAc9vB,OAAQunB,CAAE,GAAI,CAC9E,IAAI7G,EAAIoP,EAAcvI,GAClBnb,EAAYwQ,EAAI8D,EAAE,IACpB9D,EAAI8D,GAAKof,GAAkBpf,GAE/B,CACA,IAAIsN,EAAUhR,GAAwBJ,CAAG,GAAKW,GAAmBX,CAAG,EACpE,GAAIoR,EACF,OAAO5Y,EAAS4Y,QAAQA,CAAO,EAxCT/iB,EA0CcA,EAzCnBnK,KAAAA,IAAjB++B,KACFA,GAAe/rB,EAASgG,IAAI,GAwC5B,IACI8mB,EAAW/B,GAAQjiB,EApCP,SAAd3R,EAAKd,KACAc,EAAKzB,OAAOq2B,EAAY,GAE7B/0B,EAAWG,EAAKzF,KAEA1E,KAAAA,KADhB6/B,EAAcE,GAAqB38B,IAAI4G,CAAQ,KAEjD61B,EAAc11B,EAAKzB,OAAOq2B,EAAY,EACtCgB,GAAqB18B,IAAI2G,EAAU61B,CAAW,GAEzCA,GA2BqC11B,CAAI,EAC9C7B,EAAKw3B,EAAS,GACdp+B,EAAIo+B,EAAS,EACf,CAGA,OAAO,IAAIxrB,EAAS,CAClBhM,GAAIA,EACJ6B,KAAMA,EACN6C,IAAKA,EACLtL,EAAGA,CACL,CAAC,CACH,CACA,SAASs+B,GAAa3c,EAAOE,EAAKhb,GAGrB,SAATE,EAAyBoa,EAAGhd,GAG1B,OAFAgd,EAAI3U,GAAQ2U,EAAGpE,GAASlW,EAAK03B,UAAY,EAAI,EAAG13B,EAAK03B,UAAY,QAAU7hB,CAAQ,EACnEmF,EAAIvW,IAAI2G,MAAMpL,CAAI,EAAEgN,aAAahN,CAAI,EACpCE,OAAOoa,EAAGhd,CAAI,CACjC,CACS,SAATwyB,EAAyBxyB,GACvB,OAAI0C,EAAK03B,UACF1c,EAAIwO,QAAQ1O,EAAOxd,CAAI,EAEd,EADL0d,EAAIqO,QAAQ/rB,CAAI,EAAEisB,KAAKzO,EAAMuO,QAAQ/rB,CAAI,EAAGA,CAAI,EAAEzC,IAAIyC,CAAI,EAG5D0d,EAAIuO,KAAKzO,EAAOxd,CAAI,EAAEzC,IAAIyC,CAAI,CAEzC,CAfF,IAAI4Y,EAAQnT,CAAAA,CAAAA,EAAY/C,EAAKkW,KAAK,GAAWlW,EAAKkW,MAChDL,EAAW9S,EAAY/C,EAAK6V,QAAQ,EAAI,QAAU7V,EAAK6V,SAezD,GAAI7V,EAAK1C,KACP,OAAO4C,EAAO4vB,EAAO9vB,EAAK1C,IAAI,EAAG0C,EAAK1C,IAAI,EAE5C,IAAK,IAAIgb,EAAY5c,EAAgCsE,EAAKyH,KAAK,EAAU,EAAE8Q,EAAQD,EAAU,GAAGhc,MAAO,CACrG,IAAIgB,EAAOib,EAAMvd,MACbqM,EAAQyoB,EAAOxyB,CAAI,EACvB,GAAuB,GAAnBiG,KAAKC,IAAI6D,CAAK,EAChB,OAAOnH,EAAOmH,EAAO/J,CAAI,CAE7B,CACA,OAAO4C,EAAe8a,EAARF,EAAc,CAAC,EAAI,EAAG9a,EAAKyH,MAAMzH,EAAKyH,MAAM9Q,OAAS,EAAE,CACvE,CACA,SAASghC,GAASC,GAChB,IAAI53B,EAAO,GAITtG,EAFmB,EAAjBk+B,EAAQjhC,QAAqD,UAAvC,OAAOihC,EAAQA,EAAQjhC,OAAS,IACxDqJ,EAAO43B,EAAQA,EAAQjhC,OAAS,GACzB8E,MAAMW,KAAKw7B,CAAO,EAAE17B,MAAM,EAAG07B,EAAQjhC,OAAS,CAAC,GAE/C8E,MAAMW,KAAKw7B,CAAO,EAE3B,MAAO,CAAC53B,EAAMtG,EAChB,CAYA,IAAI89B,GAAuB,IAAI/8B,IAsB3BsR,EAAwB,SAAUyY,GAIpC,SAASzY,EAAS0Y,GAChB,IAiBQoT,EAjBJj2B,EAAO6iB,EAAO7iB,MAAQ6I,EAAS4D,YAC/BsW,EAAUF,EAAOE,UAAYhtB,OAAO2K,MAAMmiB,EAAO1kB,EAAE,EAAI,IAAI+Q,EAAQ,eAAe,EAAI,QAAWlP,EAAK4Z,QAAkC,KAAxB6Y,GAAgBzyB,CAAI,GAKpI0Y,GADJ3hB,KAAKoH,GAAKgD,EAAY0hB,EAAO1kB,EAAE,EAAI0K,EAASgG,IAAI,EAAIgU,EAAO1kB,GACnD,MACN5G,EAAI,KACDwrB,IAKDxrB,EAJcsrB,EAAOiQ,KAAOjQ,EAAOiQ,IAAI30B,KAAOpH,KAAKoH,IAAM0kB,EAAOiQ,IAAI9yB,KAAKxB,OAAOwB,CAAI,GAGpF0Y,GADI7Z,EAAO,CAACgkB,EAAOiQ,IAAIpa,EAAGmK,EAAOiQ,IAAIv7B,IAC5B,GACLsH,EAAK,KAILo3B,EAAKtpB,EAASkW,EAAOtrB,CAAC,GAAK,CAACsrB,EAAOiQ,IAAMjQ,EAAOtrB,EAAIyI,EAAKzB,OAAOxH,KAAKoH,EAAE,EAC3Eua,EAAI2a,GAAQt8B,KAAKoH,GAAI83B,CAAE,EAEvBvd,GADAqK,EAAUhtB,OAAO2K,MAAMgY,EAAExc,IAAI,EAAI,IAAIgT,EAAQ,eAAe,EAAI,MAClD,KAAOwJ,EACjBqK,EAAU,KAAOkT,IAOzBl/B,KAAKm/B,MAAQl2B,EAIbjJ,KAAK8L,IAAMggB,EAAOhgB,KAAOoE,EAAO9P,OAAO,EAIvCJ,KAAKgsB,QAAUA,EAIfhsB,KAAKia,SAAW,KAIhBja,KAAK67B,cAAgB,KAIrB77B,KAAK2hB,EAAIA,EAIT3hB,KAAKQ,EAAIA,EAITR,KAAKo/B,gBAAkB,CAAA,CACzB,CAWAhsB,EAAS0E,IAAM,WACb,OAAO,IAAI1E,EAAS,EAAE,CACxB,EAuBAA,EAASwT,MAAQ,WACf,IAAIyY,EAAYL,GAASp/B,SAAS,EAChCyH,EAAOg4B,EAAU,GACjBt+B,EAAOs+B,EAAU,GAQnB,OAAOX,GAAQ,CACbv5B,KAROpE,EAAK,GASZqE,MARQrE,EAAK,GASbsE,IARMtE,EAAK,GASX6E,KARO7E,EAAK,GASZ8E,OARS9E,EAAK,GASdgF,OARShF,EAAK,GASd+J,YARc/J,EAAK,EASrB,EAAGsG,CAAI,CACT,EA2BA+L,EAASC,IAAM,WACb,IAAIisB,EAAaN,GAASp/B,SAAS,EACjCyH,EAAOi4B,EAAW,GAClBv+B,EAAOu+B,EAAW,GAClBn6B,EAAOpE,EAAK,GACZqE,EAAQrE,EAAK,GACbsE,EAAMtE,EAAK,GACX6E,EAAO7E,EAAK,GACZ8E,EAAS9E,EAAK,GACdgF,EAAShF,EAAK,GACd+J,EAAc/J,EAAK,GAErB,OADAsG,EAAK4B,KAAOiM,EAAgBC,YACrBupB,GAAQ,CACbv5B,KAAMA,EACNC,MAAOA,EACPC,IAAKA,EACLO,KAAMA,EACNC,OAAQA,EACRE,OAAQA,EACR+E,YAAaA,CACf,EAAGzD,CAAI,CACT,EASA+L,EAASmsB,WAAa,SAAoBh2B,EAAMqH,GAC9B,KAAA,IAAZA,IACFA,EAAU,IAEZ,IAII4uB,EAJAp4B,EAhyIuC,kBAAtC/I,OAAOmB,UAAUuC,SAAS7C,KAgyIfqK,CAhyIqB,EAgyIbA,EAAKjI,QAAQ,EAAIsI,IACzC,OAAI5K,OAAO2K,MAAMvC,CAAE,EACVgM,EAAS4Y,QAAQ,eAAe,GAErCwT,EAAY/pB,EAAc7E,EAAQ3H,KAAM6I,EAAS4D,WAAW,GACjDmN,QAGR,IAAIzP,EAAS,CAClBhM,GAAIA,EACJ6B,KAAMu2B,EACN1zB,IAAKoE,EAAOkC,WAAWxB,CAAO,CAChC,CAAC,EANQwC,EAAS4Y,QAAQ0P,GAAgB8D,CAAS,CAAC,CAOtD,EAaApsB,EAAS8Y,WAAa,SAAoBxF,EAAc9V,GAItD,GAHgB,KAAA,IAAZA,IACFA,EAAU,IAEPgF,EAAS8Q,CAAY,EAEnB,OAAIA,EAAe,CAxpBf,QAAA,OAwpB4BA,EAE9BtT,EAAS4Y,QAAQ,wBAAwB,EAEzC,IAAI5Y,EAAS,CAClBhM,GAAIsf,EACJzd,KAAMwM,EAAc7E,EAAQ3H,KAAM6I,EAAS4D,WAAW,EACtD5J,IAAKoE,EAAOkC,WAAWxB,CAAO,CAChC,CAAC,EATD,MAAM,IAAIhM,EAAqB,yDAA2D,OAAO8hB,EAAe,eAAiBA,CAAY,CAWjJ,EAaAtT,EAASqsB,YAAc,SAAqBpwB,EAASuB,GAInD,GAHgB,KAAA,IAAZA,IACFA,EAAU,IAEPgF,EAASvG,CAAO,EAGnB,OAAO,IAAI+D,EAAS,CAClBhM,GAAc,IAAViI,EACJpG,KAAMwM,EAAc7E,EAAQ3H,KAAM6I,EAAS4D,WAAW,EACtD5J,IAAKoE,EAAOkC,WAAWxB,CAAO,CAChC,CAAC,EAND,MAAM,IAAIhM,EAAqB,wCAAwC,CAQ3E,EAmCAwO,EAAShB,WAAa,SAAoBwI,EAAKvT,GAI7CuT,EAAMA,GAAO,GACb,IAAI4kB,EAAY/pB,GAHdpO,EADW,KAAA,IAATA,EACK,GAGqBA,GAAK4B,KAAM6I,EAAS4D,WAAW,EAC7D,GAAI,CAAC8pB,EAAU3c,QACb,OAAOzP,EAAS4Y,QAAQ0P,GAAgB8D,CAAS,CAAC,EAEpD,IAAI1zB,EAAMoE,EAAOkC,WAAW/K,CAAI,EAC5BsX,EAAaH,GAAgB5D,EAAK6jB,EAA2B,EAC7DiB,EAAuB/kB,GAAoBgE,EAAY7S,CAAG,EAC5D6N,EAAqB+lB,EAAqB/lB,mBAC1CH,EAAckmB,EAAqBlmB,YACjCmmB,EAAQ7tB,EAASgG,IAAI,EACvB8nB,EAAgBx1B,EAAY/C,EAAK0zB,cAAc,EAA0ByE,EAAUh4B,OAAOm4B,CAAK,EAA5Ct4B,EAAK0zB,eACxD8E,EAAkB,CAACz1B,EAAYuU,EAAWzF,OAAO,EACjD4mB,EAAqB,CAAC11B,EAAYuU,EAAWxZ,IAAI,EACjD46B,EAAmB,CAAC31B,EAAYuU,EAAWvZ,KAAK,GAAK,CAACgF,EAAYuU,EAAWtZ,GAAG,EAChF26B,EAAiBF,GAAsBC,EACvCE,EAAkBthB,EAAW/E,UAAY+E,EAAW9E,WAQtD,IAAKmmB,GAAkBH,IAAoBI,EACzC,MAAM,IAAI17B,EAA8B,qEAAqE,EAE/G,GAAIw7B,GAAoBF,EACtB,MAAM,IAAIt7B,EAA8B,wCAAwC,EAuBlF,IArBA,IAIE27B,EAJEC,EAAcF,GAAmBthB,EAAWnZ,SAAW,CAACw6B,EAK1DI,EAAS9D,GAAQqD,EAAOC,CAAY,EAelCS,GAdAF,GACFrxB,EAAQovB,GACRgC,EAAgBnC,GAChBqC,EAAS3mB,GAAgB2mB,EAAQzmB,EAAoBH,CAAW,GACvDqmB,GACT/wB,EAAQqvB,GACR+B,EAAgBlC,GAChBoC,EAAS9lB,GAAmB8lB,CAAM,IAElCtxB,EAAQmvB,GACRiC,EAAgBpC,IAID,CAAA,GACRwC,EAAav9B,EAAgC+L,CAAK,EAAW,EAAEyxB,EAASD,EAAW,GAAG38B,MAAO,CACpG,IAAI+a,EAAI6hB,EAAOl+B,MAEV+H,EADGuU,EAAWD,EACD,EAGhBC,EAAWD,IADF2hB,EACOH,EAEAE,GAFc1hB,GAF9B2hB,EAAa,CAAA,CAMjB,CAGA,IAlhJEplB,EAmhJA+Q,GADuBmU,GAzhJIxmB,EAyhJyCA,EAzhJrBH,EAyhJyCA,EAlhJxFyB,EAAYC,IAPUN,EAyhJkC+D,GAlhJ9B/E,QAAQ,EACpC4mB,EAAYplB,EAAeR,EAAIf,WAAY,EAAGC,GAAgBc,EAAIhB,SANlED,EADyB,KAAA,IAAvBA,EACmB,EAMuDA,EAH5EH,EADkB,KAAA,IAAhBA,EACY,EAGkFA,CAAW,CAAC,EAC5GinB,EAAerlB,EAAeR,EAAIpV,QAAS,EAAG,CAAC,EAC5CyV,EAEOulB,EAEAC,CAAAA,GACHloB,EAAe,UAAWqC,EAAIpV,OAAO,EAFrC+S,EAAe,OAAQqC,EAAIf,UAAU,EAFrCtB,EAAe,WAAYqC,EAAIhB,QAAQ,GA8gJ2DimB,GAtgJvG5kB,EAAYC,IADaN,EAugJsH+D,GAtgJrHxZ,IAAI,EAChCu7B,EAAetlB,EAAeR,EAAI1B,QAAS,EAAGkB,EAAWQ,EAAIzV,IAAI,CAAC,EAC/D8V,EAEOylB,CAAAA,GACHnoB,EAAe,UAAWqC,EAAI1B,OAAO,EAFrCX,EAAe,OAAQqC,EAAIzV,IAAI,GAmgJyH6V,GAAwB2D,CAAU,IAC/JpD,GAAmBoD,CAAU,EAC/D,OAAIqN,EACK5Y,EAAS4Y,QAAQA,CAAO,GAQ/B8P,EAAO,IAAI1oB,EAAS,CAClBhM,IAJFu5B,EAAY9D,GADEsD,EAAcnmB,GAAgB2E,EAAYhF,EAAoBH,CAAW,EAAIqmB,EAAkBrlB,GAAmBmE,CAAU,EAAIA,EAC/GihB,EAAcJ,CAAS,GAClC,GAIlBv2B,KAAMu2B,EACNh/B,EAJYmgC,EAAU,GAKtB70B,IAAKA,CACP,CAAC,EAGC6S,EAAWnZ,SAAWw6B,GAAkBplB,EAAIpV,UAAYs2B,EAAKt2B,QACxD4N,EAAS4Y,QAAQ,qBAAsB,uCAAyCrN,EAAWnZ,QAAU,kBAAoBs2B,EAAK5O,MAAM,CAAC,EAEzI4O,EAAKjZ,QAGHiZ,EAFE1oB,EAAS4Y,QAAQ8P,EAAK9P,OAAO,EAGxC,EAmBA5Y,EAASmZ,QAAU,SAAiBC,EAAMnlB,GAC3B,KAAA,IAATA,IACFA,EAAO,IAET,IAAIu5B,EA16GCzb,GA06G4BqH,EA16GnB,CAACpD,GAA8BI,IAA6B,CAACH,GAA+BI,IAA8B,CAACH,GAAkCI,IAA+B,CAACH,GAAsBI,GAAwB,EA66GzP,OAAOuT,GAFE0D,EAAc,GACRA,EAAc,GACgBv5B,EAAM,WAAYmlB,CAAI,CACrE,EAiBApZ,EAASytB,YAAc,SAAqBrU,EAAMnlB,GACnC,KAAA,IAATA,IACFA,EAAO,IAET,IAAIy5B,EAh8GC3b,GAg8GoCqH,EA/+GlCliB,QAAQ,qBAAsB,GAAG,EAAEA,QAAQ,WAAY,GAAG,EAAEy2B,KAAK,EA+CvC,CAACpY,GAASC,GAAe,EAm8G1D,OAAOsU,GAFE4D,EAAkB,GACZA,EAAkB,GACYz5B,EAAM,WAAYmlB,CAAI,CACrE,EAkBApZ,EAAS4tB,SAAW,SAAkBxU,EAAMnlB,GAC7B,KAAA,IAATA,IACFA,EAAO,IAEL45B,EAv9GC9b,GAu9G8BqH,EAv9GrB,CAACzD,GAASG,IAAsB,CAACF,GAAQE,IAAsB,CAACD,GAAOE,GAAa,EA09GlG,OAAO+T,GAFE+D,EAAe,GACTA,EAAe,GACe55B,EAAM,OAAQA,CAAI,CACjE,EAgBA+L,EAAS8tB,WAAa,SAAoB1U,EAAMjL,EAAKla,GAInD,GAHa,KAAA,IAATA,IACFA,EAAO,IAEL+C,EAAYoiB,CAAI,GAAKpiB,EAAYmX,CAAG,EACtC,MAAM,IAAI3c,EAAqB,kDAAkD,EAEnF,IAAIyJ,EAAQhH,EACV85B,EAAe9yB,EAAMrG,OAErBo5B,EAAwB/yB,EAAM2C,gBAE9BqwB,EAAcnxB,EAAO0B,SAAS,CAC5B5J,OAJwB,KAAA,IAAjBm5B,EAA0B,KAAOA,EAKxCnwB,gBAH0C,KAAA,IAA1BowB,EAAmC,KAAOA,EAI1DvvB,YAAa,CAAA,CACf,CAAC,EACDyvB,EA57BG,EALHC,EAAqBhH,GADFvyB,EAk8BgBq5B,EAAa7U,EAAMjL,CAj8BM,GAClCmH,OACrB6Y,EAAmBt4B,KACTs4B,EAAmBxG,eACpBwG,EAAmB5T,eA87BjC5C,EAAOuW,EAAiB,GACxBnE,EAAamE,EAAiB,GAC9BvG,EAAiBuG,EAAiB,GAClCtV,EAAUsV,EAAiB,GAC7B,OAAItV,EACK5Y,EAAS4Y,QAAQA,CAAO,EAExBkR,GAAoBnS,EAAMoS,EAAY91B,EAAM,UAAYka,EAAKiL,EAAMuO,CAAc,CAE5F,EAKA3nB,EAASouB,WAAa,SAAoBhV,EAAMjL,EAAKla,GAInD,OAAO+L,EAAS8tB,WAAW1U,EAAMjL,EAF/Bla,EADW,KAAA,IAATA,EACK,GAE6BA,CAAI,CAC5C,EAuBA+L,EAASquB,QAAU,SAAiBjV,EAAMnlB,GAC3B,KAAA,IAATA,IACFA,EAAO,IAET,IAAIq6B,EA9hHCvc,GA8hHoBqH,EA9hHX,CAAC3C,GAA8BL,IAA6B,CAACM,GAAsBC,GAAgC,EAiiHjI,OAAOmT,GAFEwE,EAAU,GACJA,EAAU,GACoBr6B,EAAM,MAAOmlB,CAAI,CAChE,EAQApZ,EAAS4Y,QAAU,SAAiB/nB,EAAQmU,GAI1C,GAHoB,KAAA,IAAhBA,IACFA,EAAc,MAEZ,CAACnU,EACH,MAAM,IAAIW,EAAqB,kDAAkD,EAE/EonB,EAAU/nB,aAAkBkU,EAAUlU,EAAS,IAAIkU,EAAQlU,EAAQmU,CAAW,EAClF,GAAItG,EAAS+F,eACX,MAAM,IAAI9T,EAAqBioB,CAAO,EAEtC,OAAO,IAAI5Y,EAAS,CAClB4Y,QAASA,CACX,CAAC,CAEL,EAOA5Y,EAASuuB,WAAa,SAAoBnhC,GACxC,OAAOA,GAAKA,EAAE4+B,iBAAmB,CAAA,CACnC,EAQAhsB,EAASwuB,mBAAqB,SAA4BxgB,EAAYygB,GAIhEC,EAAY5H,GAAmB9Y,EAAYlR,EAAOkC,WAFpDyvB,EADiB,KAAA,IAAfA,EACW,GAEkDA,CAAU,CAAC,EAC5E,OAAQC,EAAmBA,EAAUn0B,IAAI,SAAUuK,GACjD,OAAOA,EAAIA,EAAE6H,IAAM,IACrB,CAAC,EAAEnS,KAAK,EAAE,EAFU,IAGtB,EASAwF,EAAS2uB,aAAe,SAAsBxgB,EAAKsgB,GAKjD,OAJmB,KAAA,IAAfA,IACFA,EAAa,IAEA5H,GAAkB9Y,EAAUG,YAAYC,CAAG,EAAGrR,EAAOkC,WAAWyvB,CAAU,CAAC,EAC1El0B,IAAI,SAAUuK,GAC5B,OAAOA,EAAE6H,GACX,CAAC,EAAEnS,KAAK,EAAE,CACZ,EACAwF,EAASlK,WAAa,WACpB20B,GAAe/+B,KAAAA,EACf+/B,GAAqB11B,MAAM,CAC7B,EAWA,IAAIjC,EAASkM,EAAS5T,UAgpDtB,OA/oDA0H,EAAOhF,IAAM,SAAayC,GACxB,OAAO3E,KAAK2E,EACd,EAeAuC,EAAO86B,mBAAqB,WAC1B,IAaIC,EACAC,EACAC,EACAC,EAhBJ,OAAKpiC,KAAK6iB,SAAW7iB,CAAAA,KAAK2iB,gBAKtBsZ,EAAUtxB,GAAa3K,KAAK2hB,CAAC,EAC7B0gB,EAAWriC,KAAKiJ,KAAKzB,OAAOy0B,EAHpB,KAGmC,EAC3CqG,EAAStiC,KAAKiJ,KAAKzB,OAAOy0B,EAJlB,KAIiC,GACzCsG,EAAKviC,KAAKiJ,KAAKzB,OAAOy0B,EAJX,IAIqBoG,CAAmB,MACnDjG,EAAKp8B,KAAKiJ,KAAKzB,OAAOy0B,EALX,IAKqBqG,CAAiB,MAKjDJ,EAAMjG,EAVK,IAUKG,EAChB+F,EAAK7F,GAFL2F,EAAMhG,EATK,IASKsG,EAEEA,CAAE,EACpBH,EAAK9F,GAAQ4F,EAAK9F,CAAE,EACpB+F,EAAGv8B,OAASw8B,EAAGx8B,OAAQu8B,EAAGt8B,SAAWu8B,EAAGv8B,QAAUs8B,EAAGp8B,SAAWq8B,EAAGr8B,QAAUo8B,EAAGr3B,cAAgBs3B,EAAGt3B,YAC9F,CAAC2H,EAAMzS,KAAM,CAClBoH,GAAI66B,CACN,CAAC,EAAGxvB,EAAMzS,KAAM,CACdoH,GAAI86B,CACN,CAAC,GAEI,CAACliC,KACV,EAcAkH,EAAOs7B,sBAAwB,SAA+Bn7B,GAIxDo7B,EAAwBthB,EAAU/gB,OAAOJ,KAAK8L,IAAI2G,MAFpDpL,EADW,KAAA,IAATA,EACK,GAEmDA,CAAI,EAAGA,CAAI,EAAEiB,gBAAgBtI,IAAI,EAI7F,MAAO,CACLgI,OAJSy6B,EAAsBz6B,OAK/BgJ,gBAJkByxB,EAAsBzxB,gBAKxCZ,eAJWqyB,EAAsBxxB,QAKnC,CACF,EAYA/J,EAAOyvB,MAAQ,SAAenvB,EAAQH,GAOpC,OAHa,KAAA,IAATA,IACFA,EAAO,IAEFrH,KAAKuN,QAAQ2H,EAAgBxT,SALlC8F,EADa,KAAA,IAAXA,EACO,EAKkCA,CAAM,EAAGH,CAAI,CAC5D,EAQAH,EAAOw7B,QAAU,WACf,OAAO1iC,KAAKuN,QAAQuE,EAAS4D,WAAW,CAC1C,EAWAxO,EAAOqG,QAAU,SAAiBtE,EAAMoJ,GACtC,IAgBIswB,EAhBA74B,EAAkB,KAAA,IAAVuI,EAAmB,GAAKA,EAClCuwB,EAAsB94B,EAAM8sB,cAC5BA,EAAwC,KAAA,IAAxBgM,GAAyCA,EACzDC,EAAwB/4B,EAAMg5B,iBAC9BA,EAA6C,KAAA,IAA1BD,GAA2CA,EAEhE,OADA55B,EAAOwM,EAAcxM,EAAM6I,EAAS4D,WAAW,GACtCjO,OAAOzH,KAAKiJ,IAAI,EAChBjJ,KACGiJ,EAAK4Z,SAGX8f,EAAQ3iC,KAAKoH,IACbwvB,GAAiBkM,KACfnE,EAAc11B,EAAKzB,OAAOxH,KAAKoH,EAAE,EAGrCu7B,EADgB9F,GADJ78B,KAAKitB,SAAS,EACK0R,EAAa11B,CAAI,EAC9B,IAEbwJ,EAAMzS,KAAM,CACjBoH,GAAIu7B,EACJ15B,KAAMA,CACR,CAAC,GAZMmK,EAAS4Y,QAAQ0P,GAAgBzyB,CAAI,CAAC,CAcjD,EAQA/B,EAAOmnB,YAAc,SAAqB8E,GACxC,IAAIkB,EAAmB,KAAA,IAAXlB,EAAoB,GAAKA,EACnCnrB,EAASqsB,EAAMrsB,OACfgJ,EAAkBqjB,EAAMrjB,gBACxBZ,EAAiBikB,EAAMjkB,eACrBtE,EAAM9L,KAAK8L,IAAI2G,MAAM,CACvBzK,OAAQA,EACRgJ,gBAAiBA,EACjBZ,eAAgBA,CAClB,CAAC,EACD,OAAOqC,EAAMzS,KAAM,CACjB8L,IAAKA,CACP,CAAC,CACH,EAQA5E,EAAO67B,UAAY,SAAmB/6B,GACpC,OAAOhI,KAAKquB,YAAY,CACtBrmB,OAAQA,CACV,CAAC,CACH,EAeAd,EAAO/E,IAAM,SAAa8hB,GACxB,GAAI,CAACjkB,KAAK6iB,QAAS,OAAO7iB,KAC1B,IAgBIgjC,EAhBArkB,EAAaH,GAAgByF,EAAQwa,EAA2B,EAChEwE,EAAwBtoB,GAAoBgE,EAAY3e,KAAK8L,GAAG,EAClE6N,EAAqBspB,EAAsBtpB,mBAC3CH,EAAcypB,EAAsBzpB,YAClC0pB,EAAmB,CAAC94B,EAAYuU,EAAW/E,QAAQ,GAAK,CAACxP,EAAYuU,EAAW9E,UAAU,GAAK,CAACzP,EAAYuU,EAAWnZ,OAAO,EAChIq6B,EAAkB,CAACz1B,EAAYuU,EAAWzF,OAAO,EACjD4mB,EAAqB,CAAC11B,EAAYuU,EAAWxZ,IAAI,EACjD46B,EAAmB,CAAC31B,EAAYuU,EAAWvZ,KAAK,GAAK,CAACgF,EAAYuU,EAAWtZ,GAAG,EAEhF46B,EAAkBthB,EAAW/E,UAAY+E,EAAW9E,WACtD,IAFmBimB,GAAsBC,GAElBF,IAAoBI,EACzC,MAAM,IAAI17B,EAA8B,qEAAqE,EAE/G,GAAIw7B,GAAoBF,EACtB,MAAM,IAAIt7B,EAA8B,wCAAwC,EAG9E2+B,EACFF,EAAQhpB,GAAgBva,EAAS,GAAIga,GAAgBzZ,KAAK2hB,EAAGhI,EAAoBH,CAAW,EAAGmF,CAAU,EAAGhF,EAAoBH,CAAW,EACjIpP,EAAYuU,EAAWzF,OAAO,GAGxC8pB,EAAQvjC,EAAS,GAAIO,KAAKitB,SAAS,EAAGtO,CAAU,EAI5CvU,EAAYuU,EAAWtZ,GAAG,IAC5B29B,EAAM39B,IAAMuF,KAAKqtB,IAAI3c,GAAY0nB,EAAM79B,KAAM69B,EAAM59B,KAAK,EAAG49B,EAAM39B,GAAG,IAPtE29B,EAAQxoB,GAAmB/a,EAAS,GAAI6a,GAAmBta,KAAK2hB,CAAC,EAAGhD,CAAU,CAAC,EAU7EwkB,EAAYtG,GAAQmG,EAAOhjC,KAAKQ,EAAGR,KAAKiJ,IAAI,EAGhD,OAAOwJ,EAAMzS,KAAM,CACjBoH,GAHK+7B,EAAU,GAIf3iC,EAHI2iC,EAAU,EAIhB,CAAC,CACH,EAeAj8B,EAAOsG,KAAO,SAAcogB,GAC1B,OAAK5tB,KAAK6iB,QAEHpQ,EAAMzS,KAAM88B,GAAW98B,KADpB6qB,EAASuB,iBAAiBwB,CAAQ,CACL,CAAC,EAFd5tB,IAG5B,EAQAkH,EAAO6mB,MAAQ,SAAeH,GAC5B,OAAK5tB,KAAK6iB,QAEHpQ,EAAMzS,KAAM88B,GAAW98B,KADpB6qB,EAASuB,iBAAiBwB,CAAQ,EAAEI,OAAO,CACd,CAAC,EAFdhuB,IAG5B,EAcAkH,EAAOwpB,QAAU,SAAiB/rB,EAAMyvB,GAEpCgP,GADqB,KAAA,IAAXhP,EAAoB,GAAKA,GACNzD,eAC7BA,EAA0C,KAAA,IAAzByS,GAA0CA,EAC7D,GAAI,CAACpjC,KAAK6iB,QAAS,OAAO7iB,KAC1B,IAAIQ,EAAI,GACN6iC,EAAiBxY,EAASsB,cAAcxnB,CAAI,EAC9C,OAAQ0+B,GACN,IAAK,QACH7iC,EAAE4E,MAAQ,EAEZ,IAAK,WACL,IAAK,SACH5E,EAAE6E,IAAM,EAEV,IAAK,QACL,IAAK,OACH7E,EAAEoF,KAAO,EAEX,IAAK,QACHpF,EAAEqF,OAAS,EAEb,IAAK,UACHrF,EAAEuF,OAAS,EAEb,IAAK,UACHvF,EAAEsK,YAAc,CAGpB,CAkBA,MAhBuB,UAAnBu4B,IACE1S,GACEnX,EAAcxZ,KAAK8L,IAAI+I,eAAe,EAC5B7U,KAAKwF,QACLgU,IACZhZ,EAAEqZ,WAAa7Z,KAAK6Z,WAAa,GAEnCrZ,EAAEgF,QAAUgU,GAEZhZ,EAAEgF,QAAU,GAGO,aAAnB69B,IACErI,EAAIpwB,KAAKyS,KAAKrd,KAAKoF,MAAQ,CAAC,EAChC5E,EAAE4E,MAAkB,GAAT41B,EAAI,GAAS,GAEnBh7B,KAAKmC,IAAI3B,CAAC,CACnB,EAcA0G,EAAOo8B,MAAQ,SAAe3+B,EAAM0C,GAClC,IAAIk8B,EACJ,OAAOvjC,KAAK6iB,QAAU7iB,KAAKwN,OAAM+1B,EAAa,IAAe5+B,GAAQ,EAAG4+B,EAAW,EAAE7S,QAAQ/rB,EAAM0C,CAAI,EAAE0mB,MAAM,CAAC,EAAI/tB,IACtH,EAgBAkH,EAAOylB,SAAW,SAAkBpL,EAAKla,GAIvC,OAHa,KAAA,IAATA,IACFA,EAAO,IAEFrH,KAAK6iB,QAAU1B,EAAU/gB,OAAOJ,KAAK8L,IAAI8G,cAAcvL,CAAI,CAAC,EAAEmb,yBAAyBxiB,KAAMuhB,CAAG,EAAIka,EAC7G,EAqBAv0B,EAAO8rB,eAAiB,SAAwB5R,EAAY/Z,GAO1D,OANmB,KAAA,IAAf+Z,IACFA,EAAalc,GAEF,KAAA,IAATmC,IACFA,EAAO,IAEFrH,KAAK6iB,QAAU1B,EAAU/gB,OAAOJ,KAAK8L,IAAI2G,MAAMpL,CAAI,EAAG+Z,CAAU,EAAEW,eAAe/hB,IAAI,EAAIy7B,EAClG,EAeAv0B,EAAOs8B,cAAgB,SAAuBn8B,GAI5C,OAHa,KAAA,IAATA,IACFA,EAAO,IAEFrH,KAAK6iB,QAAU1B,EAAU/gB,OAAOJ,KAAK8L,IAAI2G,MAAMpL,CAAI,EAAGA,CAAI,EAAE2a,oBAAoBhiB,IAAI,EAAI,EACjG,EAmBAkH,EAAOgmB,MAAQ,SAAesH,GAC5B,IAkBI7S,EAlBAqT,EAAmB,KAAA,IAAXR,EAAoB,GAAKA,EACnCiP,EAAezO,EAAMztB,OAErBm8B,EAAwB1O,EAAMzH,gBAC9BA,EAA4C,KAAA,IAA1BmW,GAA2CA,EAC7DC,EAAwB3O,EAAM1H,qBAC9BA,EAAiD,KAAA,IAA1BqW,GAA2CA,EAClEC,EAAsB5O,EAAMvH,cAC5BA,EAAwC,KAAA,IAAxBmW,GAAwCA,EACxDC,EAAqB7O,EAAM0I,aAC3BA,EAAsC,KAAA,IAAvBmG,GAAwCA,EACvDC,EAAkB9O,EAAMuI,UAE1B,OAAKv9B,KAAK6iB,SAKNlB,EAAI0b,GAAWr9B,KADf+jC,EAAiB,cAfO,KAAA,IAAjBN,EAA0B,WAAaA,GAgBpBlG,EAFlBpR,GAJsB,KAAA,IAApB2X,EAA6B,eAAiBA,CAIzB,CAEI,EACA,GAAnC7F,GAAaj8B,QAAQu7B,CAAS,IAAQ5b,GAAK,KAC/CA,EAAK8b,GAAWz9B,KAAM+jC,EAAKxW,EAAiBD,EAAsBG,EAAeiQ,EAAcH,CAAS,GAN/F,IAQX,EAYAr2B,EAAO+rB,UAAY,SAAmB8B,GACpC,IAAIO,EAAmB,KAAA,IAAXP,EAAoB,GAAKA,EACnCiP,EAAe1O,EAAM/tB,OAErB08B,EAAkB3O,EAAMiI,UAE1B,OAAKv9B,KAAK6iB,QAGHwa,GAAWr9B,KAAiB,cANP,KAAA,IAAjBgkC,EAA0B,WAAaA,GAMH7X,GAJb,KAAA,IAApB8X,EAA6B,MAAQA,CAImB,CAAC,EAF9D,IAGX,EAOA/8B,EAAOg9B,cAAgB,WACrB,OAAO9G,GAAap9B,KAAM,cAAc,CAC1C,EAmBAkH,EAAOimB,UAAY,SAAmBkI,GACpC,IAAIO,EAAmB,KAAA,IAAXP,EAAoB,GAAKA,EACnC8O,EAAwBvO,EAAMtI,qBAC9BA,EAAiD,KAAA,IAA1B6W,GAA2CA,EAClEC,EAAwBxO,EAAMrI,gBAC9BA,EAA4C,KAAA,IAA1B6W,GAA2CA,EAC7DC,EAAsBzO,EAAMnI,cAC5BA,EAAwC,KAAA,IAAxB4W,GAAwCA,EACxDC,EAAsB1O,EAAMpI,cAC5BA,EAAwC,KAAA,IAAxB8W,GAAyCA,EACzDC,EAAqB3O,EAAM8H,aAC3BA,EAAsC,KAAA,IAAvB6G,GAAwCA,EACvDC,EAAe5O,EAAMruB,OACrBA,EAA0B,KAAA,IAAjBi9B,EAA0B,WAAaA,EAChDC,EAAkB7O,EAAM2H,UAE1B,OAAKv9B,KAAK6iB,SAGV0a,EAAYpR,GAAcoR,EAJQ,KAAA,IAApBkH,EAA6B,eAAiBA,CAIzB,GAC3BjX,GAAoD,GAAnCyQ,GAAaj8B,QAAQu7B,CAAS,EAAS,IAAM,IAC3DE,GAAWz9B,KAAiB,aAAXuH,EAAuBgmB,EAAiBD,EAAsBG,EAAeiQ,EAAcH,CAAS,GAJvH,IAKX,EAQAr2B,EAAOw9B,UAAY,WACjB,OAAOtH,GAAap9B,KAAM,gCAAiC,CAAA,CAAK,CAClE,EAUAkH,EAAOy9B,OAAS,WACd,OAAOvH,GAAap9B,KAAK22B,MAAM,EAAG,iCAAiC,CACrE,EAOAzvB,EAAO09B,UAAY,WACjB,OAAK5kC,KAAK6iB,QAGHwa,GAAWr9B,KAAM,CAAA,CAAI,EAFnB,IAGX,EAcAkH,EAAO29B,UAAY,SAAmBlP,GACpC,IAAImP,EAAmB,KAAA,IAAXnP,EAAoB,GAAKA,EACnCoP,EAAsBD,EAAMrX,cAC5BA,EAAwC,KAAA,IAAxBsX,GAAwCA,EACxDC,EAAoBF,EAAMG,YAC1BA,EAAoC,KAAA,IAAtBD,GAAuCA,EACrDE,EAAwBJ,EAAMK,mBAE5B5jB,EAAM,eAWV,OAVI0jB,GAAexX,MAF8B,KAAA,IAA1ByX,GAA0CA,KAI7D3jB,GAAO,KAEL0jB,EACF1jB,GAAO,IACEkM,IACTlM,GAAO,OAGJ6b,GAAap9B,KAAMuhB,EAAK,CAAA,CAAI,CACrC,EAcAra,EAAOk+B,MAAQ,SAAe/9B,GAI5B,OAHa,KAAA,IAATA,IACFA,EAAO,IAEJrH,KAAK6iB,QAGH7iB,KAAK4kC,UAAU,EAAI,IAAM5kC,KAAK6kC,UAAUx9B,CAAI,EAF1C,IAGX,EAMAH,EAAOnF,SAAW,WAChB,OAAO/B,KAAK6iB,QAAU7iB,KAAKktB,MAAM,EAAIuO,EACvC,EAMAv0B,EAAO2kB,GAAe,WACpB,OAAI7rB,KAAK6iB,QACA,kBAAoB7iB,KAAKktB,MAAM,EAAI,WAAaltB,KAAKiJ,KAAKzF,KAAO,aAAexD,KAAKgI,OAAS,KAE9F,+BAAiChI,KAAK2tB,cAAgB,IAEjE,EAMAzmB,EAAO5F,QAAU,WACf,OAAOtB,KAAKqtB,SAAS,CACvB,EAMAnmB,EAAOmmB,SAAW,WAChB,OAAOrtB,KAAK6iB,QAAU7iB,KAAKoH,GAAKwC,GAClC,EAMA1C,EAAOm+B,UAAY,WACjB,OAAOrlC,KAAK6iB,QAAU7iB,KAAKoH,GAAK,IAAOwC,GACzC,EAMA1C,EAAOo+B,cAAgB,WACrB,OAAOtlC,KAAK6iB,QAAUjY,KAAK2B,MAAMvM,KAAKoH,GAAK,GAAI,EAAIwC,GACrD,EAMA1C,EAAOwmB,OAAS,WACd,OAAO1tB,KAAKktB,MAAM,CACpB,EAMAhmB,EAAOq+B,OAAS,WACd,OAAOvlC,KAAK6N,SAAS,CACvB,EASA3G,EAAO+lB,SAAW,SAAkB5lB,GAIlC,IACIiH,EADJ,OAHa,KAAA,IAATjH,IACFA,EAAO,IAEJrH,KAAK6iB,SACNvU,EAAO7O,EAAS,GAAIO,KAAK2hB,CAAC,EAC1Bta,EAAKm+B,gBACPl3B,EAAK8B,eAAiBpQ,KAAKoQ,eAC3B9B,EAAK0C,gBAAkBhR,KAAK8L,IAAIkF,gBAChC1C,EAAKtG,OAAShI,KAAK8L,IAAI9D,QAElBsG,GAPmB,EAQ5B,EAMApH,EAAO2G,SAAW,WAChB,OAAO,IAAI5F,KAAKjI,KAAK6iB,QAAU7iB,KAAKoH,GAAKwC,GAAG,CAC9C,EAmBA1C,EAAO0pB,KAAO,SAAc6U,EAAe9gC,EAAM0C,GAO/C,IAQEq+B,EARF,OANa,KAAA,IAAT/gC,IACFA,EAAO,gBAEI,KAAA,IAAT0C,IACFA,EAAO,IAEJrH,KAAK6iB,SAAY4iB,EAAc5iB,SAGhC8iB,EAAUlmC,EAAS,CACrBuI,OAAQhI,KAAKgI,OACbgJ,gBAAiBhR,KAAKgR,eACxB,EAAG3J,CAAI,EAj6KSiV,EAk6KO3X,EAAnBmK,GAj6KChM,MAAMM,QAAQkZ,CAAK,EAAIA,EAAQ,CAACA,IAi6KR3O,IAAIkd,EAASsB,aAAa,EAIrDyZ,EAAS/O,IAHT6O,EAAeD,EAAcnkC,QAAQ,EAAItB,KAAKsB,QAAQ,GAC7BtB,KAAOylC,EACxBC,EAAeD,EAAgBzlC,KACR8O,EAAO62B,CAAO,EACxCD,EAAeE,EAAO5X,OAAO,EAAI4X,GAX/B/a,EAASmB,QAAQ,wCAAwC,CAYpE,EAUA9kB,EAAO2+B,QAAU,SAAiBlhC,EAAM0C,GAOtC,OANa,KAAA,IAAT1C,IACFA,EAAO,gBAEI,KAAA,IAAT0C,IACFA,EAAO,IAEFrH,KAAK4wB,KAAKxd,EAAS0E,IAAI,EAAGnT,EAAM0C,CAAI,CAC7C,EAOAH,EAAO4+B,MAAQ,SAAeL,GAC5B,OAAOzlC,KAAK6iB,QAAU8M,GAASE,cAAc7vB,KAAMylC,CAAa,EAAIzlC,IACtE,EAaAkH,EAAO2pB,QAAU,SAAiB4U,EAAe9gC,EAAM0C,GACrD,IACI0+B,EADJ,MAAK/lC,CAAAA,CAAAA,KAAK6iB,UACNkjB,EAAUN,EAAcnkC,QAAQ,GAChC0kC,EAAiBhmC,KAAKuN,QAAQk4B,EAAcx8B,KAAM,CACpD2tB,cAAe,CAAA,CACjB,CAAC,GACqBlG,QAAQ/rB,EAAM0C,CAAI,GAAK0+B,IAAWA,GAAWC,EAAe1C,MAAM3+B,EAAM0C,CAAI,CACpG,EASAH,EAAOO,OAAS,SAAgBuN,GAC9B,OAAOhV,KAAK6iB,SAAW7N,EAAM6N,SAAW7iB,KAAKsB,QAAQ,IAAM0T,EAAM1T,QAAQ,GAAKtB,KAAKiJ,KAAKxB,OAAOuN,EAAM/L,IAAI,GAAKjJ,KAAK8L,IAAIrE,OAAOuN,EAAMlJ,GAAG,CACzI,EAqBA5E,EAAO++B,WAAa,SAAoBr1B,GAItC,IACItC,EAGF43B,EACEp3B,EACAnK,EANJ,OAAK3E,KAAK6iB,SACNvU,GAHFsC,EADc,KAAA,IAAZA,EACQ,GAGDA,GAAQtC,MAAQ8E,EAAShB,WAAW,GAAI,CAC/CnJ,KAAMjJ,KAAKiJ,IACb,CAAC,EACDi9B,EAAUt1B,EAAQs1B,QAAUlmC,KAAOsO,EAAO,CAACsC,EAAQs1B,QAAUt1B,EAAQs1B,QAAU,EAC7Ep3B,EAAQ,CAAC,QAAS,SAAU,OAAQ,QAAS,UAAW,WACxDnK,EAAOiM,EAAQjM,KACf7B,MAAMM,QAAQwN,EAAQjM,IAAI,IAC5BmK,EAAQ8B,EAAQjM,KAChBA,EAAO7F,KAAAA,GAEFggC,GAAaxwB,EAAMtO,KAAKwN,KAAK04B,CAAO,EAAGzmC,EAAS,GAAImR,EAAS,CAClEhC,QAAS,SACTE,MAAOA,EACPnK,KAAMA,CACR,CAAC,CAAC,GAfwB,IAgB5B,EAeAuC,EAAOi/B,mBAAqB,SAA4Bv1B,GAItD,OAHgB,KAAA,IAAZA,IACFA,EAAU,IAEP5Q,KAAK6iB,QACHic,GAAaluB,EAAQtC,MAAQ8E,EAAShB,WAAW,GAAI,CAC1DnJ,KAAMjJ,KAAKiJ,IACb,CAAC,EAAGjJ,KAAMP,EAAS,GAAImR,EAAS,CAC9BhC,QAAS,OACTE,MAAO,CAAC,QAAS,SAAU,QAC3BiwB,UAAW,CAAA,CACb,CAAC,CAAC,EAPwB,IAQ5B,EAOA3rB,EAAS6kB,IAAM,WACb,IAAK,IAAI3T,EAAO1kB,UAAU5B,OAAQozB,EAAY,IAAItuB,MAAMwhB,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,CAAI,GACxF4M,EAAU5M,GAAQ5kB,UAAU4kB,GAE9B,GAAK4M,EAAUgV,MAAMhzB,EAASuuB,UAAU,EAGxC,OAAO/lB,GAAOwV,EAAW,SAAUrzB,GACjC,OAAOA,EAAEuD,QAAQ,CACnB,EAAGsJ,KAAKqtB,GAAG,EAJT,MAAM,IAAIrzB,EAAqB,yCAAyC,CAK5E,EAOAwO,EAAS8kB,IAAM,WACb,IAAK,IAAIvT,EAAQ/kB,UAAU5B,OAAQozB,EAAY,IAAItuB,MAAM6hB,CAAK,EAAGE,EAAQ,EAAGA,EAAQF,EAAOE,CAAK,GAC9FuM,EAAUvM,GAASjlB,UAAUilB,GAE/B,GAAKuM,EAAUgV,MAAMhzB,EAASuuB,UAAU,EAGxC,OAAO/lB,GAAOwV,EAAW,SAAUrzB,GACjC,OAAOA,EAAEuD,QAAQ,CACnB,EAAGsJ,KAAKstB,GAAG,EAJT,MAAM,IAAItzB,EAAqB,yCAAyC,CAK5E,EAWAwO,EAASizB,kBAAoB,SAA2B7Z,EAAMjL,EAAK3Q,GAIjE,IAAIG,EAFFH,EADc,KAAA,IAAZA,EACQ,GAEGA,EACb01B,EAAkBv1B,EAAS/I,OAE3Bu+B,EAAwBx1B,EAASC,gBAOnC,OAAOupB,GALSrqB,EAAO0B,SAAS,CAC5B5J,OAJ2B,KAAA,IAApBs+B,EAA6B,KAAOA,EAK3Ct1B,gBAH0C,KAAA,IAA1Bu1B,EAAmC,KAAOA,EAI1D10B,YAAa,CAAA,CACf,CAAC,EACmC2a,EAAMjL,CAAG,CACjD,EAKAnO,EAASozB,kBAAoB,SAA2Bha,EAAMjL,EAAK3Q,GAIjE,OAAOwC,EAASizB,kBAAkB7Z,EAAMjL,EAFtC3Q,EADc,KAAA,IAAZA,EACQ,GAEiCA,CAAO,CACtD,EAcAwC,EAASqzB,kBAAoB,SAA2BllB,EAAK3Q,GAI3D,IAAI81B,EAFF91B,EADc,KAAA,IAAZA,EACQ,GAEIA,EACd+1B,EAAmBD,EAAU1+B,OAE7B4+B,EAAwBF,EAAU11B,gBAElCqwB,EAAcnxB,EAAO0B,SAAS,CAC5B5J,OAJ4B,KAAA,IAArB2+B,EAA8B,KAAOA,EAK5C31B,gBAH0C,KAAA,IAA1B41B,EAAmC,KAAOA,EAI1D/0B,YAAa,CAAA,CACf,CAAC,EACH,OAAO,IAAIsoB,GAAYkH,EAAa9f,CAAG,CACzC,EAYAnO,EAASyzB,iBAAmB,SAA0Bra,EAAMsa,EAAcz/B,GAIxE,GAHa,KAAA,IAATA,IACFA,EAAO,IAEL+C,EAAYoiB,CAAI,GAAKpiB,EAAY08B,CAAY,EAC/C,MAAM,IAAIliC,EAAqB,+DAA+D,EAEhG,IAcE8jB,EACAzf,EACA8xB,EAhBEgM,EAAS1/B,EACX2/B,EAAgBD,EAAO/+B,OAEvBi/B,EAAwBF,EAAO/1B,gBAE/BqwB,EAAcnxB,EAAO0B,SAAS,CAC5B5J,OAJyB,KAAA,IAAlBg/B,EAA2B,KAAOA,EAKzCh2B,gBAH0C,KAAA,IAA1Bi2B,EAAmC,KAAOA,EAI1Dp1B,YAAa,CAAA,CACf,CAAC,EACH,GAAKwvB,EAAY55B,OAAOq/B,EAAa9+B,MAAM,EAQ3C,OAJE0gB,GADEwe,EAAwBJ,EAAavM,kBAAkB/N,CAAI,GAC9B9D,OAC/Bzf,EAAOi+B,EAAsBj+B,KAC7B8xB,EAAiBmM,EAAsBnM,gBACvCpN,EAAgBuZ,EAAsBvZ,eAE/Bva,EAAS4Y,QAAQ2B,CAAa,EAE9BuP,GAAoBxU,EAAQzf,EAAM5B,EAAM,UAAYy/B,EAAav/B,OAAQilB,EAAMuO,CAAc,EAVpG,MAAM,IAAIn2B,EAAqB,4CAA8Cy8B,EAAsB,2CAA2CyF,EAAa9+B,MAAO,CAYtK,EAQA5I,EAAagU,EAAU,CAAC,CACtB5U,IAAK,UACL0D,IAAK,WACH,OAAwB,OAAjBlC,KAAKgsB,OACd,CAMF,EAAG,CACDxtB,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ/nB,OAAS,IAC9C,CAMF,EAAG,CACDzF,IAAK,qBACL0D,IAAK,WACH,OAAOlC,KAAKgsB,QAAUhsB,KAAKgsB,QAAQ5T,YAAc,IACnD,CAOF,EAAG,CACD5Z,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK8L,IAAI9D,OAAS,IAC1C,CAOF,EAAG,CACDxJ,IAAK,kBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK8L,IAAIkF,gBAAkB,IACnD,CAOF,EAAG,CACDxS,IAAK,iBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK8L,IAAIsE,eAAiB,IAClD,CAMF,EAAG,CACD5R,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAKm/B,KACd,CAMF,EAAG,CACD3gC,IAAK,WACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKiJ,KAAKzF,KAAO,IACzC,CAOF,EAAG,CACDhF,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAExc,KAAOyE,GACtC,CAOF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAUjY,KAAKyS,KAAKrd,KAAK2hB,EAAEvc,MAAQ,CAAC,EAAIwE,GACtD,CAOF,EAAG,CACDpL,IAAK,QACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAEvc,MAAQwE,GACvC,CAOF,EAAG,CACDpL,IAAK,MACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAEtc,IAAMuE,GACrC,CAOF,EAAG,CACDpL,IAAK,OACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAE/b,KAAOgE,GACtC,CAOF,EAAG,CACDpL,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAE9b,OAAS+D,GACxC,CAOF,EAAG,CACDpL,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAE5b,OAAS6D,GACxC,CAOF,EAAG,CACDpL,IAAK,cACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAK2hB,EAAE7W,YAAclB,GAC7C,CAQF,EAAG,CACDpL,IAAK,WACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU8Y,GAAuB37B,IAAI,EAAE4Z,SAAWhQ,GAChE,CAQF,EAAG,CACDpL,IAAK,aACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU8Y,GAAuB37B,IAAI,EAAE6Z,WAAajQ,GAClE,CASF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU8Y,GAAuB37B,IAAI,EAAEwF,QAAUoE,GAC/D,CAMF,EAAG,CACDpL,IAAK,YACL0D,IAAK,WACH,OAAOlC,KAAK6iB,SAAW7iB,KAAK8L,IAAIiJ,eAAe,EAAE1D,SAASrR,KAAKwF,OAAO,CACxE,CAQF,EAAG,CACDhH,IAAK,eACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU+Y,GAA4B57B,IAAI,EAAEwF,QAAUoE,GACpE,CAQF,EAAG,CACDpL,IAAK,kBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU+Y,GAA4B57B,IAAI,EAAE6Z,WAAajQ,GACvE,CAOF,EAAG,CACDpL,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU+Y,GAA4B57B,IAAI,EAAE4Z,SAAWhQ,GACrE,CAOF,EAAG,CACDpL,IAAK,UACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAUvI,GAAmBta,KAAK2hB,CAAC,EAAEzI,QAAUtP,GAC7D,CAQF,EAAG,CACDpL,IAAK,aACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU2Q,GAAKvkB,OAAO,QAAS,CACzC8kB,OAAQ/zB,KAAK8L,GACf,CAAC,EAAE9L,KAAKoF,MAAQ,GAAK,IACvB,CAQF,EAAG,CACD5G,IAAK,YACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU2Q,GAAKvkB,OAAO,OAAQ,CACxC8kB,OAAQ/zB,KAAK8L,GACf,CAAC,EAAE9L,KAAKoF,MAAQ,GAAK,IACvB,CAQF,EAAG,CACD5G,IAAK,eACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU2Q,GAAKhgB,SAAS,QAAS,CAC3CugB,OAAQ/zB,KAAK8L,GACf,CAAC,EAAE9L,KAAKwF,QAAU,GAAK,IACzB,CAQF,EAAG,CACDhH,IAAK,cACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU2Q,GAAKhgB,SAAS,OAAQ,CAC1CugB,OAAQ/zB,KAAK8L,GACf,CAAC,EAAE9L,KAAKwF,QAAU,GAAK,IACzB,CAQF,EAAG,CACDhH,IAAK,SACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU,CAAC7iB,KAAKQ,EAAIoJ,GAClC,CAOF,EAAG,CACDpL,IAAK,kBACL0D,IAAK,WACH,OAAIlC,KAAK6iB,QACA7iB,KAAKiJ,KAAK9B,WAAWnH,KAAKoH,GAAI,CACnCG,OAAQ,QACRS,OAAQhI,KAAKgI,MACf,CAAC,EAEM,IAEX,CAOF,EAAG,CACDxJ,IAAK,iBACL0D,IAAK,WACH,OAAIlC,KAAK6iB,QACA7iB,KAAKiJ,KAAK9B,WAAWnH,KAAKoH,GAAI,CACnCG,OAAQ,OACRS,OAAQhI,KAAKgI,MACf,CAAC,EAEM,IAEX,CAMF,EAAG,CACDxJ,IAAK,gBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU7iB,KAAKiJ,KAAK0qB,YAAc,IAChD,CAMF,EAAG,CACDn1B,IAAK,UACL0D,IAAK,WACH,MAAIlC,CAAAA,KAAK2iB,gBAGA3iB,KAAKwH,OAASxH,KAAKmC,IAAI,CAC5BiD,MAAO,EACPC,IAAK,CACP,CAAC,EAAEmC,QAAUxH,KAAKwH,OAASxH,KAAKmC,IAAI,CAClCiD,MAAO,CACT,CAAC,EAAEoC,OAEP,CACF,EAAG,CACDhJ,IAAK,eACL0D,IAAK,WACH,OAAO8W,GAAWhZ,KAAKmF,IAAI,CAC7B,CAQF,EAAG,CACD3G,IAAK,cACL0D,IAAK,WACH,OAAOoZ,GAAYtb,KAAKmF,KAAMnF,KAAKoF,KAAK,CAC1C,CAQF,EAAG,CACD5G,IAAK,aACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAUzI,EAAWpa,KAAKmF,IAAI,EAAIyE,GAChD,CASF,EAAG,CACDpL,IAAK,kBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU/I,GAAgB9Z,KAAK4Z,QAAQ,EAAIhQ,GACzD,CAQF,EAAG,CACDpL,IAAK,uBACL0D,IAAK,WACH,OAAOlC,KAAK6iB,QAAU/I,GAAgB9Z,KAAK+a,cAAe/a,KAAK8L,IAAIgJ,sBAAsB,EAAG9U,KAAK8L,IAAI+I,eAAe,CAAC,EAAIjL,GAC3H,CACF,GAAI,CAAC,CACHpL,IAAK,aACL0D,IAAK,WACH,OAAOgD,CACT,CAMF,EAAG,CACD1G,IAAK,WACL0D,IAAK,WACH,OAAOoD,CACT,CAMF,EAAG,CACD9G,IAAK,wBACL0D,IAAK,WACH,OAAOqD,CACT,CAMF,EAAG,CACD/G,IAAK,YACL0D,IAAK,WACH,OAAOuD,CACT,CAMF,EAAG,CACDjH,IAAK,YACL0D,IAAK,WACH,OAAOwD,CACT,CAMF,EAAG,CACDlH,IAAK,cACL0D,IAAK,WACH,OAAOyD,CACT,CAMF,EAAG,CACDnH,IAAK,oBACL0D,IAAK,WACH,OAAO4D,EACT,CAMF,EAAG,CACDtH,IAAK,yBACL0D,IAAK,WACH,OAAO8D,EACT,CAMF,EAAG,CACDxH,IAAK,wBACL0D,IAAK,WACH,OAAOgE,EACT,CAMF,EAAG,CACD1H,IAAK,iBACL0D,IAAK,WACH,OAAOiE,EACT,CAMF,EAAG,CACD3H,IAAK,uBACL0D,IAAK,WACH,OAAOmE,EACT,CAMF,EAAG,CACD7H,IAAK,4BACL0D,IAAK,WACH,OAAOoE,EACT,CAMF,EAAG,CACD9H,IAAK,2BACL0D,IAAK,WACH,OAAOqE,EACT,CAMF,EAAG,CACD/H,IAAK,iBACL0D,IAAK,WACH,OAAOsE,EACT,CAMF,EAAG,CACDhI,IAAK,8BACL0D,IAAK,WACH,OAAOuE,EACT,CAMF,EAAG,CACDjI,IAAK,eACL0D,IAAK,WACH,OAAOwE,EACT,CAMF,EAAG,CACDlI,IAAK,4BACL0D,IAAK,WACH,OAAOyE,EACT,CAMF,EAAG,CACDnI,IAAK,4BACL0D,IAAK,WACH,OAAO0E,EACT,CAMF,EAAG,CACDpI,IAAK,gBACL0D,IAAK,WACH,OAAO2E,EACT,CAMF,EAAG,CACDrI,IAAK,6BACL0D,IAAK,WACH,OAAO4E,EACT,CAMF,EAAG,CACDtI,IAAK,gBACL0D,IAAK,WACH,OAAO6E,EACT,CAMF,EAAG,CACDvI,IAAK,6BACL0D,IAAK,WACH,OAAO8E,EACT,CACF,EAAE,EACKoM,CACT,EAAExU,OAAO6wB,IAAI,4BAA4B,CAAC,EAC1C,SAASM,GAAiBoX,GACxB,GAAI/zB,EAASuuB,WAAWwF,CAAW,EACjC,OAAOA,EACF,GAAIA,GAAeA,EAAY7lC,SAAWsU,EAASuxB,EAAY7lC,QAAQ,CAAC,EAC7E,OAAO8R,EAASmsB,WAAW4H,CAAW,EACjC,GAAIA,GAAsC,UAAvB,OAAOA,EAC/B,OAAO/zB,EAAShB,WAAW+0B,CAAW,EAEtC,MAAM,IAAIviC,EAAqB,8BAAgCuiC,EAAc,aAAe,OAAOA,CAAW,CAElH,CAkBA,OAdAxpC,EAAQyV,SAAWA,EACnBzV,EAAQktB,SAAWA,EACnBltB,EAAQuX,gBAAkBA,EAC1BvX,EAAQiL,SAAWA,EACnBjL,EAAQ61B,KAAOA,GACf71B,EAAQgyB,SAAWA,GACnBhyB,EAAQ6X,YAAcA,GACtB7X,EAAQmU,SAAWA,EACnBnU,EAAQiK,WAAaA,GACrBjK,EAAQypC,QAXM,QAYdzpC,EAAQsJ,KAAOA,EAEf5I,OAAOC,eAAeX,EAAS,aAAc,CAAE0E,MAAO,CAAA,CAAK,CAAC,EAErD1E,CAER,EAAE,EAAE"}
\ No newline at end of file
diff --git a/node_modules/luxon/build/node/luxon.js b/node_modules/luxon/build/node/luxon.js
new file mode 100644
index 0000000..a8ee891
--- /dev/null
+++ b/node_modules/luxon/build/node/luxon.js
@@ -0,0 +1,7792 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+// these aren't really private, but nor are they really useful to document
+
+/**
+ * @private
+ */
+class LuxonError extends Error {}
+
+/**
+ * @private
+ */
+class InvalidDateTimeError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid DateTime: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidIntervalError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Interval: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidDurationError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Duration: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+class ConflictingSpecificationError extends LuxonError {}
+
+/**
+ * @private
+ */
+class InvalidUnitError extends LuxonError {
+  constructor(unit) {
+    super(`Invalid unit ${unit}`);
+  }
+}
+
+/**
+ * @private
+ */
+class InvalidArgumentError extends LuxonError {}
+
+/**
+ * @private
+ */
+class ZoneIsAbstractError extends LuxonError {
+  constructor() {
+    super("Zone is an abstract class");
+  }
+}
+
+/**
+ * @private
+ */
+
+const n = "numeric",
+  s = "short",
+  l = "long";
+const DATE_SHORT = {
+  year: n,
+  month: n,
+  day: n
+};
+const DATE_MED = {
+  year: n,
+  month: s,
+  day: n
+};
+const DATE_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s
+};
+const DATE_FULL = {
+  year: n,
+  month: l,
+  day: n
+};
+const DATE_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l
+};
+const TIME_SIMPLE = {
+  hour: n,
+  minute: n
+};
+const TIME_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n
+};
+const TIME_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s
+};
+const TIME_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l
+};
+const TIME_24_SIMPLE = {
+  hour: n,
+  minute: n,
+  hourCycle: "h23"
+};
+const TIME_24_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23"
+};
+const TIME_24_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: s
+};
+const TIME_24_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: l
+};
+const DATETIME_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n
+};
+const DATETIME_SHORT_WITH_SECONDS = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n
+};
+const DATETIME_MED = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n
+};
+const DATETIME_MED_WITH_SECONDS = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n
+};
+const DATETIME_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+  hour: n,
+  minute: n
+};
+const DATETIME_FULL = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  timeZoneName: s
+};
+const DATETIME_FULL_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s
+};
+const DATETIME_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  timeZoneName: l
+};
+const DATETIME_HUGE_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l
+};
+
+/**
+ * @interface
+ */
+class Zone {
+  /**
+   * The type of zone
+   * @abstract
+   * @type {string}
+   */
+  get type() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The name of this zone.
+   * @abstract
+   * @type {string}
+   */
+  get name() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The IANA name of this zone.
+   * Defaults to `name` if not overwritten by a subclass.
+   * @abstract
+   * @type {string}
+   */
+  get ianaName() {
+    return this.name;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year.
+   * @abstract
+   * @type {boolean}
+   */
+  get isUniversal() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, opts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @abstract
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @abstract
+   * @type {boolean}
+   */
+  get isValid() {
+    throw new ZoneIsAbstractError();
+  }
+}
+
+let singleton$1 = null;
+
+/**
+ * Represents the local zone for this JavaScript environment.
+ * @implements {Zone}
+ */
+class SystemZone extends Zone {
+  /**
+   * Get a singleton instance of the local zone
+   * @return {SystemZone}
+   */
+  static get instance() {
+    if (singleton$1 === null) {
+      singleton$1 = new SystemZone();
+    }
+    return singleton$1;
+  }
+
+  /** @override **/
+  get type() {
+    return "system";
+  }
+
+  /** @override **/
+  get name() {
+    return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName(ts, {
+    format,
+    locale
+  }) {
+    return parseZoneInfo(ts, format, locale);
+  }
+
+  /** @override **/
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /** @override **/
+  offset(ts) {
+    return -new Date(ts).getTimezoneOffset();
+  }
+
+  /** @override **/
+  equals(otherZone) {
+    return otherZone.type === "system";
+  }
+
+  /** @override **/
+  get isValid() {
+    return true;
+  }
+}
+
+const dtfCache = new Map();
+function makeDTF(zoneName) {
+  let dtf = dtfCache.get(zoneName);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat("en-US", {
+      hour12: false,
+      timeZone: zoneName,
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+      second: "2-digit",
+      era: "short"
+    });
+    dtfCache.set(zoneName, dtf);
+  }
+  return dtf;
+}
+const typeToPos = {
+  year: 0,
+  month: 1,
+  day: 2,
+  era: 3,
+  hour: 4,
+  minute: 5,
+  second: 6
+};
+function hackyOffset(dtf, date) {
+  const formatted = dtf.format(date).replace(/\u200E/g, ""),
+    parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;
+  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+}
+function partsOffset(dtf, date) {
+  const formatted = dtf.formatToParts(date);
+  const filled = [];
+  for (let i = 0; i < formatted.length; i++) {
+    const {
+      type,
+      value
+    } = formatted[i];
+    const pos = typeToPos[type];
+    if (type === "era") {
+      filled[pos] = value;
+    } else if (!isUndefined(pos)) {
+      filled[pos] = parseInt(value, 10);
+    }
+  }
+  return filled;
+}
+const ianaZoneCache = new Map();
+/**
+ * A zone identified by an IANA identifier, like America/New_York
+ * @implements {Zone}
+ */
+class IANAZone extends Zone {
+  /**
+   * @param {string} name - Zone name
+   * @return {IANAZone}
+   */
+  static create(name) {
+    let zone = ianaZoneCache.get(name);
+    if (zone === undefined) {
+      ianaZoneCache.set(name, zone = new IANAZone(name));
+    }
+    return zone;
+  }
+
+  /**
+   * Reset local caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCache() {
+    ianaZoneCache.clear();
+    dtfCache.clear();
+  }
+
+  /**
+   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+   * @param {string} s - The string to check validity on
+   * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+   * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+   * @return {boolean}
+   */
+  static isValidSpecifier(s) {
+    return this.isValidZone(s);
+  }
+
+  /**
+   * Returns whether the provided string identifies a real zone
+   * @param {string} zone - The string to check
+   * @example IANAZone.isValidZone("America/New_York") //=> true
+   * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+   * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+   * @return {boolean}
+   */
+  static isValidZone(zone) {
+    if (!zone) {
+      return false;
+    }
+    try {
+      new Intl.DateTimeFormat("en-US", {
+        timeZone: zone
+      }).format();
+      return true;
+    } catch (e) {
+      return false;
+    }
+  }
+  constructor(name) {
+    super();
+    /** @private **/
+    this.zoneName = name;
+    /** @private **/
+    this.valid = IANAZone.isValidZone(name);
+  }
+
+  /**
+   * The type of zone. `iana` for all instances of `IANAZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "iana";
+  }
+
+  /**
+   * The name of this zone (i.e. the IANA zone name).
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.zoneName;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns false for all IANA zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return false;
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, {
+    format,
+    locale
+  }) {
+    return parseZoneInfo(ts, format, locale, this.name);
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    if (!this.valid) return NaN;
+    const date = new Date(ts);
+    if (isNaN(date)) return NaN;
+    const dtf = makeDTF(this.name);
+    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts ? partsOffset(dtf, date) : hackyOffset(dtf, date);
+    if (adOrBc === "BC") {
+      year = -Math.abs(year) + 1;
+    }
+
+    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+    const adjustedHour = hour === 24 ? 0 : hour;
+    const asUTC = objToLocalTS({
+      year,
+      month,
+      day,
+      hour: adjustedHour,
+      minute,
+      second,
+      millisecond: 0
+    });
+    let asTS = +date;
+    const over = asTS % 1000;
+    asTS -= over >= 0 ? over : 1000 + over;
+    return (asUTC - asTS) / (60 * 1000);
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "iana" && otherZone.name === this.name;
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.valid;
+  }
+}
+
+// todo - remap caching
+
+let intlLFCache = {};
+function getCachedLF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlLFCache[key];
+  if (!dtf) {
+    dtf = new Intl.ListFormat(locString, opts);
+    intlLFCache[key] = dtf;
+  }
+  return dtf;
+}
+const intlDTCache = new Map();
+function getCachedDTF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlDTCache.get(key);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat(locString, opts);
+    intlDTCache.set(key, dtf);
+  }
+  return dtf;
+}
+const intlNumCache = new Map();
+function getCachedINF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let inf = intlNumCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.NumberFormat(locString, opts);
+    intlNumCache.set(key, inf);
+  }
+  return inf;
+}
+const intlRelCache = new Map();
+function getCachedRTF(locString, opts = {}) {
+  const {
+    base,
+    ...cacheKeyOpts
+  } = opts; // exclude `base` from the options
+  const key = JSON.stringify([locString, cacheKeyOpts]);
+  let inf = intlRelCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.RelativeTimeFormat(locString, opts);
+    intlRelCache.set(key, inf);
+  }
+  return inf;
+}
+let sysLocaleCache = null;
+function systemLocale() {
+  if (sysLocaleCache) {
+    return sysLocaleCache;
+  } else {
+    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+    return sysLocaleCache;
+  }
+}
+const intlResolvedOptionsCache = new Map();
+function getCachedIntResolvedOptions(locString) {
+  let opts = intlResolvedOptionsCache.get(locString);
+  if (opts === undefined) {
+    opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+    intlResolvedOptionsCache.set(locString, opts);
+  }
+  return opts;
+}
+const weekInfoCache = new Map();
+function getCachedWeekInfo(locString) {
+  let data = weekInfoCache.get(locString);
+  if (!data) {
+    const locale = new Intl.Locale(locString);
+    // browsers currently implement this as a property, but spec says it should be a getter function
+    data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+    if (!("minimalDays" in data)) {
+      data = {
+        ...fallbackWeekSettings,
+        ...data
+      };
+    }
+    weekInfoCache.set(locString, data);
+  }
+  return data;
+}
+function parseLocaleString(localeStr) {
+  // I really want to avoid writing a BCP 47 parser
+  // see, e.g. https://github.com/wooorm/bcp-47
+  // Instead, we'll do this:
+
+  // a) if the string has no -u extensions, just leave it alone
+  // b) if it does, use Intl to resolve everything
+  // c) if Intl fails, try again without the -u
+
+  // private subtags and unicode subtags have ordering requirements,
+  // and we're not properly parsing this, so just strip out the
+  // private ones if they exist.
+  const xIndex = localeStr.indexOf("-x-");
+  if (xIndex !== -1) {
+    localeStr = localeStr.substring(0, xIndex);
+  }
+  const uIndex = localeStr.indexOf("-u-");
+  if (uIndex === -1) {
+    return [localeStr];
+  } else {
+    let options;
+    let selectedStr;
+    try {
+      options = getCachedDTF(localeStr).resolvedOptions();
+      selectedStr = localeStr;
+    } catch (e) {
+      const smaller = localeStr.substring(0, uIndex);
+      options = getCachedDTF(smaller).resolvedOptions();
+      selectedStr = smaller;
+    }
+    const {
+      numberingSystem,
+      calendar
+    } = options;
+    return [selectedStr, numberingSystem, calendar];
+  }
+}
+function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+  if (outputCalendar || numberingSystem) {
+    if (!localeStr.includes("-u-")) {
+      localeStr += "-u";
+    }
+    if (outputCalendar) {
+      localeStr += `-ca-${outputCalendar}`;
+    }
+    if (numberingSystem) {
+      localeStr += `-nu-${numberingSystem}`;
+    }
+    return localeStr;
+  } else {
+    return localeStr;
+  }
+}
+function mapMonths(f) {
+  const ms = [];
+  for (let i = 1; i <= 12; i++) {
+    const dt = DateTime.utc(2009, i, 1);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+function mapWeekdays(f) {
+  const ms = [];
+  for (let i = 1; i <= 7; i++) {
+    const dt = DateTime.utc(2016, 11, 13 + i);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+function listStuff(loc, length, englishFn, intlFn) {
+  const mode = loc.listingMode();
+  if (mode === "error") {
+    return null;
+  } else if (mode === "en") {
+    return englishFn(length);
+  } else {
+    return intlFn(length);
+  }
+}
+function supportsFastNumbers(loc) {
+  if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+    return false;
+  } else {
+    return loc.numberingSystem === "latn" || !loc.locale || loc.locale.startsWith("en") || getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn";
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyNumberFormatter {
+  constructor(intl, forceSimple, opts) {
+    this.padTo = opts.padTo || 0;
+    this.floor = opts.floor || false;
+    const {
+      padTo,
+      floor,
+      ...otherOpts
+    } = opts;
+    if (!forceSimple || Object.keys(otherOpts).length > 0) {
+      const intlOpts = {
+        useGrouping: false,
+        ...opts
+      };
+      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+      this.inf = getCachedINF(intl, intlOpts);
+    }
+  }
+  format(i) {
+    if (this.inf) {
+      const fixed = this.floor ? Math.floor(i) : i;
+      return this.inf.format(fixed);
+    } else {
+      // to match the browser's numberformatter defaults
+      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+      return padStart(fixed, this.padTo);
+    }
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyDateFormatter {
+  constructor(dt, intl, opts) {
+    this.opts = opts;
+    this.originalZone = undefined;
+    let z = undefined;
+    if (this.opts.timeZone) {
+      // Don't apply any workarounds if a timeZone is explicitly provided in opts
+      this.dt = dt;
+    } else if (dt.zone.type === "fixed") {
+      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+      // That is why fixed-offset TZ is set to that unless it is:
+      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+      // 2. Unsupported by the browser:
+      //    - some do not support Etc/
+      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+      const gmtOffset = -1 * (dt.offset / 60);
+      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;
+      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+        z = offsetZ;
+        this.dt = dt;
+      } else {
+        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+        // we manually apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({
+          minutes: dt.offset
+        });
+        this.originalZone = dt.zone;
+      }
+    } else if (dt.zone.type === "system") {
+      this.dt = dt;
+    } else if (dt.zone.type === "iana") {
+      this.dt = dt;
+      z = dt.zone.name;
+    } else {
+      // Custom zones can have any offset / offsetName so we just manually
+      // apply the offset and substitute the zone as needed.
+      z = "UTC";
+      this.dt = dt.setZone("UTC").plus({
+        minutes: dt.offset
+      });
+      this.originalZone = dt.zone;
+    }
+    const intlOpts = {
+      ...this.opts
+    };
+    intlOpts.timeZone = intlOpts.timeZone || z;
+    this.dtf = getCachedDTF(intl, intlOpts);
+  }
+  format() {
+    if (this.originalZone) {
+      // If we have to substitute in the actual zone name, we have to use
+      // formatToParts so that the timezone can be replaced.
+      return this.formatToParts().map(({
+        value
+      }) => value).join("");
+    }
+    return this.dtf.format(this.dt.toJSDate());
+  }
+  formatToParts() {
+    const parts = this.dtf.formatToParts(this.dt.toJSDate());
+    if (this.originalZone) {
+      return parts.map(part => {
+        if (part.type === "timeZoneName") {
+          const offsetName = this.originalZone.offsetName(this.dt.ts, {
+            locale: this.dt.locale,
+            format: this.opts.timeZoneName
+          });
+          return {
+            ...part,
+            value: offsetName
+          };
+        } else {
+          return part;
+        }
+      });
+    }
+    return parts;
+  }
+  resolvedOptions() {
+    return this.dtf.resolvedOptions();
+  }
+}
+
+/**
+ * @private
+ */
+class PolyRelFormatter {
+  constructor(intl, isEnglish, opts) {
+    this.opts = {
+      style: "long",
+      ...opts
+    };
+    if (!isEnglish && hasRelative()) {
+      this.rtf = getCachedRTF(intl, opts);
+    }
+  }
+  format(count, unit) {
+    if (this.rtf) {
+      return this.rtf.format(count, unit);
+    } else {
+      return formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+    }
+  }
+  formatToParts(count, unit) {
+    if (this.rtf) {
+      return this.rtf.formatToParts(count, unit);
+    } else {
+      return [];
+    }
+  }
+}
+const fallbackWeekSettings = {
+  firstDay: 1,
+  minimalDays: 4,
+  weekend: [6, 7]
+};
+
+/**
+ * @private
+ */
+class Locale {
+  static fromOpts(opts) {
+    return Locale.create(opts.locale, opts.numberingSystem, opts.outputCalendar, opts.weekSettings, opts.defaultToEN);
+  }
+  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {
+    const specifiedLocale = locale || Settings.defaultLocale;
+    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+    const localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+  }
+  static resetCache() {
+    sysLocaleCache = null;
+    intlDTCache.clear();
+    intlNumCache.clear();
+    intlRelCache.clear();
+    intlResolvedOptionsCache.clear();
+    weekInfoCache.clear();
+  }
+  static fromObject({
+    locale,
+    numberingSystem,
+    outputCalendar,
+    weekSettings
+  } = {}) {
+    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+  }
+  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);
+    this.locale = parsedLocale;
+    this.numberingSystem = numbering || parsedNumberingSystem || null;
+    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+    this.weekSettings = weekSettings;
+    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+    this.weekdaysCache = {
+      format: {},
+      standalone: {}
+    };
+    this.monthsCache = {
+      format: {},
+      standalone: {}
+    };
+    this.meridiemCache = null;
+    this.eraCache = {};
+    this.specifiedLocale = specifiedLocale;
+    this.fastNumbersCached = null;
+  }
+  get fastNumbers() {
+    if (this.fastNumbersCached == null) {
+      this.fastNumbersCached = supportsFastNumbers(this);
+    }
+    return this.fastNumbersCached;
+  }
+  listingMode() {
+    const isActuallyEn = this.isEnglish();
+    const hasNoWeirdness = (this.numberingSystem === null || this.numberingSystem === "latn") && (this.outputCalendar === null || this.outputCalendar === "gregory");
+    return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+  }
+  clone(alts) {
+    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+      return this;
+    } else {
+      return Locale.create(alts.locale || this.specifiedLocale, alts.numberingSystem || this.numberingSystem, alts.outputCalendar || this.outputCalendar, validateWeekSettings(alts.weekSettings) || this.weekSettings, alts.defaultToEN || false);
+    }
+  }
+  redefaultToEN(alts = {}) {
+    return this.clone({
+      ...alts,
+      defaultToEN: true
+    });
+  }
+  redefaultToSystem(alts = {}) {
+    return this.clone({
+      ...alts,
+      defaultToEN: false
+    });
+  }
+  months(length, format = false) {
+    return listStuff(this, length, months, () => {
+      // Workaround for "ja" locale: formatToParts does not label all parts of the month
+      // as "month" and for this locale there is no difference between "format" and "non-format".
+      // As such, just use format() instead of formatToParts() and take the whole string
+      const monthSpecialCase = this.intl === "ja" || this.intl.startsWith("ja-");
+      format &= !monthSpecialCase;
+      const intl = format ? {
+          month: length,
+          day: "numeric"
+        } : {
+          month: length
+        },
+        formatStr = format ? "format" : "standalone";
+      if (!this.monthsCache[formatStr][length]) {
+        const mapper = !monthSpecialCase ? dt => this.extract(dt, intl, "month") : dt => this.dtFormatter(dt, intl).format();
+        this.monthsCache[formatStr][length] = mapMonths(mapper);
+      }
+      return this.monthsCache[formatStr][length];
+    });
+  }
+  weekdays(length, format = false) {
+    return listStuff(this, length, weekdays, () => {
+      const intl = format ? {
+          weekday: length,
+          year: "numeric",
+          month: "long",
+          day: "numeric"
+        } : {
+          weekday: length
+        },
+        formatStr = format ? "format" : "standalone";
+      if (!this.weekdaysCache[formatStr][length]) {
+        this.weekdaysCache[formatStr][length] = mapWeekdays(dt => this.extract(dt, intl, "weekday"));
+      }
+      return this.weekdaysCache[formatStr][length];
+    });
+  }
+  meridiems() {
+    return listStuff(this, undefined, () => meridiems, () => {
+      // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+      // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+      if (!this.meridiemCache) {
+        const intl = {
+          hour: "numeric",
+          hourCycle: "h12"
+        };
+        this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(dt => this.extract(dt, intl, "dayperiod"));
+      }
+      return this.meridiemCache;
+    });
+  }
+  eras(length) {
+    return listStuff(this, length, eras, () => {
+      const intl = {
+        era: length
+      };
+
+      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+      // to definitely enumerate them.
+      if (!this.eraCache[length]) {
+        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map(dt => this.extract(dt, intl, "era"));
+      }
+      return this.eraCache[length];
+    });
+  }
+  extract(dt, intlOpts, field) {
+    const df = this.dtFormatter(dt, intlOpts),
+      results = df.formatToParts(),
+      matching = results.find(m => m.type.toLowerCase() === field);
+    return matching ? matching.value : null;
+  }
+  numberFormatter(opts = {}) {
+    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+    // (in contrast, the rest of the condition is used heavily)
+    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+  }
+  dtFormatter(dt, intlOpts = {}) {
+    return new PolyDateFormatter(dt, this.intl, intlOpts);
+  }
+  relFormatter(opts = {}) {
+    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+  }
+  listFormatter(opts = {}) {
+    return getCachedLF(this.intl, opts);
+  }
+  isEnglish() {
+    return this.locale === "en" || this.locale.toLowerCase() === "en-us" || getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us");
+  }
+  getWeekSettings() {
+    if (this.weekSettings) {
+      return this.weekSettings;
+    } else if (!hasLocaleWeekInfo()) {
+      return fallbackWeekSettings;
+    } else {
+      return getCachedWeekInfo(this.locale);
+    }
+  }
+  getStartOfWeek() {
+    return this.getWeekSettings().firstDay;
+  }
+  getMinDaysInFirstWeek() {
+    return this.getWeekSettings().minimalDays;
+  }
+  getWeekendDays() {
+    return this.getWeekSettings().weekend;
+  }
+  equals(other) {
+    return this.locale === other.locale && this.numberingSystem === other.numberingSystem && this.outputCalendar === other.outputCalendar;
+  }
+  toString() {
+    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;
+  }
+}
+
+let singleton = null;
+
+/**
+ * A zone with a fixed offset (meaning no DST)
+ * @implements {Zone}
+ */
+class FixedOffsetZone extends Zone {
+  /**
+   * Get a singleton instance of UTC
+   * @return {FixedOffsetZone}
+   */
+  static get utcInstance() {
+    if (singleton === null) {
+      singleton = new FixedOffsetZone(0);
+    }
+    return singleton;
+  }
+
+  /**
+   * Get an instance with a specified offset
+   * @param {number} offset - The offset in minutes
+   * @return {FixedOffsetZone}
+   */
+  static instance(offset) {
+    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+  }
+
+  /**
+   * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+   * @param {string} s - The offset string to parse
+   * @example FixedOffsetZone.parseSpecifier("UTC+6")
+   * @example FixedOffsetZone.parseSpecifier("UTC+06")
+   * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+   * @return {FixedOffsetZone}
+   */
+  static parseSpecifier(s) {
+    if (s) {
+      const r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+      if (r) {
+        return new FixedOffsetZone(signedOffset(r[1], r[2]));
+      }
+    }
+    return null;
+  }
+  constructor(offset) {
+    super();
+    /** @private **/
+    this.fixed = offset;
+  }
+
+  /**
+   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "fixed";
+  }
+
+  /**
+   * The name of this zone.
+   * All fixed zones' names always start with "UTC" (plus optional offset)
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.fixed === 0 ? "UTC" : `UTC${formatOffset(this.fixed, "narrow")}`;
+  }
+
+  /**
+   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+   *
+   * @override
+   * @type {string}
+   */
+  get ianaName() {
+    if (this.fixed === 0) {
+      return "Etc/UTC";
+    } else {
+      return `Etc/GMT${formatOffset(-this.fixed, "narrow")}`;
+    }
+  }
+
+  /**
+   * Returns the offset's common name at the specified timestamp.
+   *
+   * For fixed offset zones this equals to the zone name.
+   * @override
+   */
+  offsetName() {
+    return this.name;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.fixed, format);
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns true for all fixed offset zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return true;
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   *
+   * For fixed offset zones, this is constant and does not depend on a timestamp.
+   * @override
+   * @return {number}
+   */
+  offset() {
+    return this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is valid:
+   * All fixed offset zones are valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return true;
+  }
+}
+
+/**
+ * A zone that failed to parse. You should never need to instantiate this.
+ * @implements {Zone}
+ */
+class InvalidZone extends Zone {
+  constructor(zoneName) {
+    super();
+    /**  @private */
+    this.zoneName = zoneName;
+  }
+
+  /** @override **/
+  get type() {
+    return "invalid";
+  }
+
+  /** @override **/
+  get name() {
+    return this.zoneName;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName() {
+    return null;
+  }
+
+  /** @override **/
+  formatOffset() {
+    return "";
+  }
+
+  /** @override **/
+  offset() {
+    return NaN;
+  }
+
+  /** @override **/
+  equals() {
+    return false;
+  }
+
+  /** @override **/
+  get isValid() {
+    return false;
+  }
+}
+
+/**
+ * @private
+ */
+function normalizeZone(input, defaultZone) {
+  if (isUndefined(input) || input === null) {
+    return defaultZone;
+  } else if (input instanceof Zone) {
+    return input;
+  } else if (isString(input)) {
+    const lowered = input.toLowerCase();
+    if (lowered === "default") return defaultZone;else if (lowered === "local" || lowered === "system") return SystemZone.instance;else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+  } else if (isNumber(input)) {
+    return FixedOffsetZone.instance(input);
+  } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+    // This is dumb, but the instanceof check above doesn't seem to really work
+    // so we're duck checking it
+    return input;
+  } else {
+    return new InvalidZone(input);
+  }
+}
+
+const numberingSystems = {
+  arab: "[\u0660-\u0669]",
+  arabext: "[\u06F0-\u06F9]",
+  bali: "[\u1B50-\u1B59]",
+  beng: "[\u09E6-\u09EF]",
+  deva: "[\u0966-\u096F]",
+  fullwide: "[\uFF10-\uFF19]",
+  gujr: "[\u0AE6-\u0AEF]",
+  hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+  khmr: "[\u17E0-\u17E9]",
+  knda: "[\u0CE6-\u0CEF]",
+  laoo: "[\u0ED0-\u0ED9]",
+  limb: "[\u1946-\u194F]",
+  mlym: "[\u0D66-\u0D6F]",
+  mong: "[\u1810-\u1819]",
+  mymr: "[\u1040-\u1049]",
+  orya: "[\u0B66-\u0B6F]",
+  tamldec: "[\u0BE6-\u0BEF]",
+  telu: "[\u0C66-\u0C6F]",
+  thai: "[\u0E50-\u0E59]",
+  tibt: "[\u0F20-\u0F29]",
+  latn: "\\d"
+};
+const numberingSystemsUTF16 = {
+  arab: [1632, 1641],
+  arabext: [1776, 1785],
+  bali: [6992, 7001],
+  beng: [2534, 2543],
+  deva: [2406, 2415],
+  fullwide: [65296, 65303],
+  gujr: [2790, 2799],
+  khmr: [6112, 6121],
+  knda: [3302, 3311],
+  laoo: [3792, 3801],
+  limb: [6470, 6479],
+  mlym: [3430, 3439],
+  mong: [6160, 6169],
+  mymr: [4160, 4169],
+  orya: [2918, 2927],
+  tamldec: [3046, 3055],
+  telu: [3174, 3183],
+  thai: [3664, 3673],
+  tibt: [3872, 3881]
+};
+const hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+function parseDigits(str) {
+  let value = parseInt(str, 10);
+  if (isNaN(value)) {
+    value = "";
+    for (let i = 0; i < str.length; i++) {
+      const code = str.charCodeAt(i);
+      if (str[i].search(numberingSystems.hanidec) !== -1) {
+        value += hanidecChars.indexOf(str[i]);
+      } else {
+        for (const key in numberingSystemsUTF16) {
+          const [min, max] = numberingSystemsUTF16[key];
+          if (code >= min && code <= max) {
+            value += code - min;
+          }
+        }
+      }
+    }
+    return parseInt(value, 10);
+  } else {
+    return value;
+  }
+}
+
+// cache of {numberingSystem: {append: regex}}
+const digitRegexCache = new Map();
+function resetDigitRegexCache() {
+  digitRegexCache.clear();
+}
+function digitRegex({
+  numberingSystem
+}, append = "") {
+  const ns = numberingSystem || "latn";
+  let appendCache = digitRegexCache.get(ns);
+  if (appendCache === undefined) {
+    appendCache = new Map();
+    digitRegexCache.set(ns, appendCache);
+  }
+  let regex = appendCache.get(append);
+  if (regex === undefined) {
+    regex = new RegExp(`${numberingSystems[ns]}${append}`);
+    appendCache.set(append, regex);
+  }
+  return regex;
+}
+
+let now = () => Date.now(),
+  defaultZone = "system",
+  defaultLocale = null,
+  defaultNumberingSystem = null,
+  defaultOutputCalendar = null,
+  twoDigitCutoffYear = 60,
+  throwOnInvalid,
+  defaultWeekSettings = null;
+
+/**
+ * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+ */
+class Settings {
+  /**
+   * Get the callback for returning the current timestamp.
+   * @type {function}
+   */
+  static get now() {
+    return now;
+  }
+
+  /**
+   * Set the callback for returning the current timestamp.
+   * The function should return a number, which will be interpreted as an Epoch millisecond count
+   * @type {function}
+   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+   */
+  static set now(n) {
+    now = n;
+  }
+
+  /**
+   * Set the default time zone to create DateTimes in. Does not affect existing instances.
+   * Use the value "system" to reset this value to the system's time zone.
+   * @type {string}
+   */
+  static set defaultZone(zone) {
+    defaultZone = zone;
+  }
+
+  /**
+   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+   * The default value is the system's time zone (the one set on the machine that runs this code).
+   * @type {Zone}
+   */
+  static get defaultZone() {
+    return normalizeZone(defaultZone, SystemZone.instance);
+  }
+
+  /**
+   * Get the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultLocale() {
+    return defaultLocale;
+  }
+
+  /**
+   * Set the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultLocale(locale) {
+    defaultLocale = locale;
+  }
+
+  /**
+   * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultNumberingSystem() {
+    return defaultNumberingSystem;
+  }
+
+  /**
+   * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultNumberingSystem(numberingSystem) {
+    defaultNumberingSystem = numberingSystem;
+  }
+
+  /**
+   * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultOutputCalendar() {
+    return defaultOutputCalendar;
+  }
+
+  /**
+   * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultOutputCalendar(outputCalendar) {
+    defaultOutputCalendar = outputCalendar;
+  }
+
+  /**
+   * @typedef {Object} WeekSettings
+   * @property {number} firstDay
+   * @property {number} minimalDays
+   * @property {number[]} weekend
+   */
+
+  /**
+   * @return {WeekSettings|null}
+   */
+  static get defaultWeekSettings() {
+    return defaultWeekSettings;
+  }
+
+  /**
+   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+   * how many days are required in the first week of a year.
+   * Does not affect existing instances.
+   *
+   * @param {WeekSettings|null} weekSettings
+   */
+  static set defaultWeekSettings(weekSettings) {
+    defaultWeekSettings = validateWeekSettings(weekSettings);
+  }
+
+  /**
+   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   */
+  static get twoDigitCutoffYear() {
+    return twoDigitCutoffYear;
+  }
+
+  /**
+   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+   */
+  static set twoDigitCutoffYear(cutoffYear) {
+    twoDigitCutoffYear = cutoffYear % 100;
+  }
+
+  /**
+   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static get throwOnInvalid() {
+    return throwOnInvalid;
+  }
+
+  /**
+   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static set throwOnInvalid(t) {
+    throwOnInvalid = t;
+  }
+
+  /**
+   * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCaches() {
+    Locale.resetCache();
+    IANAZone.resetCache();
+    DateTime.resetCache();
+    resetDigitRegexCache();
+  }
+}
+
+class Invalid {
+  constructor(reason, explanation) {
+    this.reason = reason;
+    this.explanation = explanation;
+  }
+  toMessage() {
+    if (this.explanation) {
+      return `${this.reason}: ${this.explanation}`;
+    } else {
+      return this.reason;
+    }
+  }
+}
+
+const nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+function unitOutOfRange(unit, value) {
+  return new Invalid("unit out of range", `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`);
+}
+function dayOfWeek(year, month, day) {
+  const d = new Date(Date.UTC(year, month - 1, day));
+  if (year < 100 && year >= 0) {
+    d.setUTCFullYear(d.getUTCFullYear() - 1900);
+  }
+  const js = d.getUTCDay();
+  return js === 0 ? 7 : js;
+}
+function computeOrdinal(year, month, day) {
+  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+}
+function uncomputeOrdinal(year, ordinal) {
+  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+    month0 = table.findIndex(i => i < ordinal),
+    day = ordinal - table[month0];
+  return {
+    month: month0 + 1,
+    day
+  };
+}
+function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+  return (isoWeekday - startOfWeek + 7) % 7 + 1;
+}
+
+/**
+ * @private
+ */
+
+function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const {
+      year,
+      month,
+      day
+    } = gregObj,
+    ordinal = computeOrdinal(year, month, day),
+    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+    weekYear;
+  if (weekNumber < 1) {
+    weekYear = year - 1;
+    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+    weekYear = year + 1;
+    weekNumber = 1;
+  } else {
+    weekYear = year;
+  }
+  return {
+    weekYear,
+    weekNumber,
+    weekday,
+    ...timeObject(gregObj)
+  };
+}
+function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const {
+      weekYear,
+      weekNumber,
+      weekday
+    } = weekData,
+    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+    yearInDays = daysInYear(weekYear);
+  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+    year;
+  if (ordinal < 1) {
+    year = weekYear - 1;
+    ordinal += daysInYear(year);
+  } else if (ordinal > yearInDays) {
+    year = weekYear + 1;
+    ordinal -= daysInYear(weekYear);
+  } else {
+    year = weekYear;
+  }
+  const {
+    month,
+    day
+  } = uncomputeOrdinal(year, ordinal);
+  return {
+    year,
+    month,
+    day,
+    ...timeObject(weekData)
+  };
+}
+function gregorianToOrdinal(gregData) {
+  const {
+    year,
+    month,
+    day
+  } = gregData;
+  const ordinal = computeOrdinal(year, month, day);
+  return {
+    year,
+    ordinal,
+    ...timeObject(gregData)
+  };
+}
+function ordinalToGregorian(ordinalData) {
+  const {
+    year,
+    ordinal
+  } = ordinalData;
+  const {
+    month,
+    day
+  } = uncomputeOrdinal(year, ordinal);
+  return {
+    year,
+    month,
+    day,
+    ...timeObject(ordinalData)
+  };
+}
+
+/**
+ * Check if local week units like localWeekday are used in obj.
+ * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+ * Modifies obj in-place!
+ * @param obj the object values
+ */
+function usesLocalWeekValues(obj, loc) {
+  const hasLocaleWeekData = !isUndefined(obj.localWeekday) || !isUndefined(obj.localWeekNumber) || !isUndefined(obj.localWeekYear);
+  if (hasLocaleWeekData) {
+    const hasIsoWeekData = !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+    if (hasIsoWeekData) {
+      throw new ConflictingSpecificationError("Cannot mix locale-based week fields with ISO-based week fields");
+    }
+    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+    delete obj.localWeekday;
+    delete obj.localWeekNumber;
+    delete obj.localWeekYear;
+    return {
+      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+      startOfWeek: loc.getStartOfWeek()
+    };
+  } else {
+    return {
+      minDaysInFirstWeek: 4,
+      startOfWeek: 1
+    };
+  }
+}
+function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const validYear = isInteger(obj.weekYear),
+    validWeek = integerBetween(obj.weekNumber, 1, weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)),
+    validWeekday = integerBetween(obj.weekday, 1, 7);
+  if (!validYear) {
+    return unitOutOfRange("weekYear", obj.weekYear);
+  } else if (!validWeek) {
+    return unitOutOfRange("week", obj.weekNumber);
+  } else if (!validWeekday) {
+    return unitOutOfRange("weekday", obj.weekday);
+  } else return false;
+}
+function hasInvalidOrdinalData(obj) {
+  const validYear = isInteger(obj.year),
+    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validOrdinal) {
+    return unitOutOfRange("ordinal", obj.ordinal);
+  } else return false;
+}
+function hasInvalidGregorianData(obj) {
+  const validYear = isInteger(obj.year),
+    validMonth = integerBetween(obj.month, 1, 12),
+    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validMonth) {
+    return unitOutOfRange("month", obj.month);
+  } else if (!validDay) {
+    return unitOutOfRange("day", obj.day);
+  } else return false;
+}
+function hasInvalidTimeData(obj) {
+  const {
+    hour,
+    minute,
+    second,
+    millisecond
+  } = obj;
+  const validHour = integerBetween(hour, 0, 23) || hour === 24 && minute === 0 && second === 0 && millisecond === 0,
+    validMinute = integerBetween(minute, 0, 59),
+    validSecond = integerBetween(second, 0, 59),
+    validMillisecond = integerBetween(millisecond, 0, 999);
+  if (!validHour) {
+    return unitOutOfRange("hour", hour);
+  } else if (!validMinute) {
+    return unitOutOfRange("minute", minute);
+  } else if (!validSecond) {
+    return unitOutOfRange("second", second);
+  } else if (!validMillisecond) {
+    return unitOutOfRange("millisecond", millisecond);
+  } else return false;
+}
+
+/*
+  This is just a junk drawer, containing anything used across multiple classes.
+  Because Luxon is small(ish), this should stay small and we won't worry about splitting
+  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.
+*/
+
+/**
+ * @private
+ */
+
+// TYPES
+
+function isUndefined(o) {
+  return typeof o === "undefined";
+}
+function isNumber(o) {
+  return typeof o === "number";
+}
+function isInteger(o) {
+  return typeof o === "number" && o % 1 === 0;
+}
+function isString(o) {
+  return typeof o === "string";
+}
+function isDate(o) {
+  return Object.prototype.toString.call(o) === "[object Date]";
+}
+
+// CAPABILITIES
+
+function hasRelative() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+  } catch (e) {
+    return false;
+  }
+}
+function hasLocaleWeekInfo() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.Locale && ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype);
+  } catch (e) {
+    return false;
+  }
+}
+
+// OBJECTS AND ARRAYS
+
+function maybeArray(thing) {
+  return Array.isArray(thing) ? thing : [thing];
+}
+function bestBy(arr, by, compare) {
+  if (arr.length === 0) {
+    return undefined;
+  }
+  return arr.reduce((best, next) => {
+    const pair = [by(next), next];
+    if (!best) {
+      return pair;
+    } else if (compare(best[0], pair[0]) === best[0]) {
+      return best;
+    } else {
+      return pair;
+    }
+  }, null)[1];
+}
+function pick(obj, keys) {
+  return keys.reduce((a, k) => {
+    a[k] = obj[k];
+    return a;
+  }, {});
+}
+function hasOwnProperty(obj, prop) {
+  return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+function validateWeekSettings(settings) {
+  if (settings == null) {
+    return null;
+  } else if (typeof settings !== "object") {
+    throw new InvalidArgumentError("Week settings must be an object");
+  } else {
+    if (!integerBetween(settings.firstDay, 1, 7) || !integerBetween(settings.minimalDays, 1, 7) || !Array.isArray(settings.weekend) || settings.weekend.some(v => !integerBetween(v, 1, 7))) {
+      throw new InvalidArgumentError("Invalid week settings");
+    }
+    return {
+      firstDay: settings.firstDay,
+      minimalDays: settings.minimalDays,
+      weekend: Array.from(settings.weekend)
+    };
+  }
+}
+
+// NUMBERS AND STRINGS
+
+function integerBetween(thing, bottom, top) {
+  return isInteger(thing) && thing >= bottom && thing <= top;
+}
+
+// x % n but takes the sign of n instead of x
+function floorMod(x, n) {
+  return x - n * Math.floor(x / n);
+}
+function padStart(input, n = 2) {
+  const isNeg = input < 0;
+  let padded;
+  if (isNeg) {
+    padded = "-" + ("" + -input).padStart(n, "0");
+  } else {
+    padded = ("" + input).padStart(n, "0");
+  }
+  return padded;
+}
+function parseInteger(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseInt(string, 10);
+  }
+}
+function parseFloating(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseFloat(string);
+  }
+}
+function parseMillis(fraction) {
+  // Return undefined (instead of 0) in these cases, where fraction is not set
+  if (isUndefined(fraction) || fraction === null || fraction === "") {
+    return undefined;
+  } else {
+    const f = parseFloat("0." + fraction) * 1000;
+    return Math.floor(f);
+  }
+}
+function roundTo(number, digits, rounding = "round") {
+  const factor = 10 ** digits;
+  switch (rounding) {
+    case "expand":
+      return number > 0 ? Math.ceil(number * factor) / factor : Math.floor(number * factor) / factor;
+    case "trunc":
+      return Math.trunc(number * factor) / factor;
+    case "round":
+      return Math.round(number * factor) / factor;
+    case "floor":
+      return Math.floor(number * factor) / factor;
+    case "ceil":
+      return Math.ceil(number * factor) / factor;
+    default:
+      throw new RangeError(`Value rounding ${rounding} is out of range`);
+  }
+}
+
+// DATE BASICS
+
+function isLeapYear(year) {
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+function daysInYear(year) {
+  return isLeapYear(year) ? 366 : 365;
+}
+function daysInMonth(year, month) {
+  const modMonth = floorMod(month - 1, 12) + 1,
+    modYear = year + (month - modMonth) / 12;
+  if (modMonth === 2) {
+    return isLeapYear(modYear) ? 29 : 28;
+  } else {
+    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+  }
+}
+
+// convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+function objToLocalTS(obj) {
+  let d = Date.UTC(obj.year, obj.month - 1, obj.day, obj.hour, obj.minute, obj.second, obj.millisecond);
+
+  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+  if (obj.year < 100 && obj.year >= 0) {
+    d = new Date(d);
+    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+    // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+    // the calculations done by Date.UTC are using year 2000 - which is incorrect
+    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+  }
+  return +d;
+}
+
+// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+  return -fwdlw + minDaysInFirstWeek - 1;
+}
+function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+}
+function untruncateYear(year) {
+  if (year > 99) {
+    return year;
+  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+}
+
+// PARSING
+
+function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {
+  const date = new Date(ts),
+    intlOpts = {
+      hourCycle: "h23",
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit"
+    };
+  if (timeZone) {
+    intlOpts.timeZone = timeZone;
+  }
+  const modified = {
+    timeZoneName: offsetFormat,
+    ...intlOpts
+  };
+  const parsed = new Intl.DateTimeFormat(locale, modified).formatToParts(date).find(m => m.type.toLowerCase() === "timezonename");
+  return parsed ? parsed.value : null;
+}
+
+// signedOffset('-5', '30') -> -330
+function signedOffset(offHourStr, offMinuteStr) {
+  let offHour = parseInt(offHourStr, 10);
+
+  // don't || this because we want to preserve -0
+  if (Number.isNaN(offHour)) {
+    offHour = 0;
+  }
+  const offMin = parseInt(offMinuteStr, 10) || 0,
+    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+  return offHour * 60 + offMinSigned;
+}
+
+// COERCION
+
+function asNumber(value) {
+  const numericValue = Number(value);
+  if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue)) throw new InvalidArgumentError(`Invalid unit value ${value}`);
+  return numericValue;
+}
+function normalizeObject(obj, normalizer) {
+  const normalized = {};
+  for (const u in obj) {
+    if (hasOwnProperty(obj, u)) {
+      const v = obj[u];
+      if (v === undefined || v === null) continue;
+      normalized[normalizer(u)] = asNumber(v);
+    }
+  }
+  return normalized;
+}
+
+/**
+ * Returns the offset's value as a string
+ * @param {number} ts - Epoch milliseconds for which to get the offset
+ * @param {string} format - What style of offset to return.
+ *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+ * @return {string}
+ */
+function formatOffset(offset, format) {
+  const hours = Math.trunc(Math.abs(offset / 60)),
+    minutes = Math.trunc(Math.abs(offset % 60)),
+    sign = offset >= 0 ? "+" : "-";
+  switch (format) {
+    case "short":
+      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;
+    case "narrow":
+      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : ""}`;
+    case "techie":
+      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;
+    default:
+      throw new RangeError(`Value format ${format} is out of range for property format`);
+  }
+}
+function timeObject(obj) {
+  return pick(obj, ["hour", "minute", "second", "millisecond"]);
+}
+
+/**
+ * @private
+ */
+
+const monthsLong = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"];
+const monthsShort = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"];
+const monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+function months(length) {
+  switch (length) {
+    case "narrow":
+      return [...monthsNarrow];
+    case "short":
+      return [...monthsShort];
+    case "long":
+      return [...monthsLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+    case "2-digit":
+      return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+    default:
+      return null;
+  }
+}
+const weekdaysLong = ["Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"];
+const weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+const weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+function weekdays(length) {
+  switch (length) {
+    case "narrow":
+      return [...weekdaysNarrow];
+    case "short":
+      return [...weekdaysShort];
+    case "long":
+      return [...weekdaysLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7"];
+    default:
+      return null;
+  }
+}
+const meridiems = ["AM", "PM"];
+const erasLong = ["Before Christ", "Anno Domini"];
+const erasShort = ["BC", "AD"];
+const erasNarrow = ["B", "A"];
+function eras(length) {
+  switch (length) {
+    case "narrow":
+      return [...erasNarrow];
+    case "short":
+      return [...erasShort];
+    case "long":
+      return [...erasLong];
+    default:
+      return null;
+  }
+}
+function meridiemForDateTime(dt) {
+  return meridiems[dt.hour < 12 ? 0 : 1];
+}
+function weekdayForDateTime(dt, length) {
+  return weekdays(length)[dt.weekday - 1];
+}
+function monthForDateTime(dt, length) {
+  return months(length)[dt.month - 1];
+}
+function eraForDateTime(dt, length) {
+  return eras(length)[dt.year < 0 ? 0 : 1];
+}
+function formatRelativeTime(unit, count, numeric = "always", narrow = false) {
+  const units = {
+    years: ["year", "yr."],
+    quarters: ["quarter", "qtr."],
+    months: ["month", "mo."],
+    weeks: ["week", "wk."],
+    days: ["day", "day", "days"],
+    hours: ["hour", "hr."],
+    minutes: ["minute", "min."],
+    seconds: ["second", "sec."]
+  };
+  const lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+  if (numeric === "auto" && lastable) {
+    const isDay = unit === "days";
+    switch (count) {
+      case 1:
+        return isDay ? "tomorrow" : `next ${units[unit][0]}`;
+      case -1:
+        return isDay ? "yesterday" : `last ${units[unit][0]}`;
+      case 0:
+        return isDay ? "today" : `this ${units[unit][0]}`;
+    }
+  }
+
+  const isInPast = Object.is(count, -0) || count < 0,
+    fmtValue = Math.abs(count),
+    singular = fmtValue === 1,
+    lilUnits = units[unit],
+    fmtUnit = narrow ? singular ? lilUnits[1] : lilUnits[2] || lilUnits[1] : singular ? units[unit][0] : unit;
+  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;
+}
+
+function stringifyTokens(splits, tokenToString) {
+  let s = "";
+  for (const token of splits) {
+    if (token.literal) {
+      s += token.val;
+    } else {
+      s += tokenToString(token.val);
+    }
+  }
+  return s;
+}
+const macroTokenToFormatOpts = {
+  D: DATE_SHORT,
+  DD: DATE_MED,
+  DDD: DATE_FULL,
+  DDDD: DATE_HUGE,
+  t: TIME_SIMPLE,
+  tt: TIME_WITH_SECONDS,
+  ttt: TIME_WITH_SHORT_OFFSET,
+  tttt: TIME_WITH_LONG_OFFSET,
+  T: TIME_24_SIMPLE,
+  TT: TIME_24_WITH_SECONDS,
+  TTT: TIME_24_WITH_SHORT_OFFSET,
+  TTTT: TIME_24_WITH_LONG_OFFSET,
+  f: DATETIME_SHORT,
+  ff: DATETIME_MED,
+  fff: DATETIME_FULL,
+  ffff: DATETIME_HUGE,
+  F: DATETIME_SHORT_WITH_SECONDS,
+  FF: DATETIME_MED_WITH_SECONDS,
+  FFF: DATETIME_FULL_WITH_SECONDS,
+  FFFF: DATETIME_HUGE_WITH_SECONDS
+};
+
+/**
+ * @private
+ */
+
+class Formatter {
+  static create(locale, opts = {}) {
+    return new Formatter(locale, opts);
+  }
+  static parseFormat(fmt) {
+    // white-space is always considered a literal in user-provided formats
+    // the " " token has a special meaning (see unitForToken)
+
+    let current = null,
+      currentFull = "",
+      bracketed = false;
+    const splits = [];
+    for (let i = 0; i < fmt.length; i++) {
+      const c = fmt.charAt(i);
+      if (c === "'") {
+        // turn '' into a literal signal quote instead of just skipping the empty literal
+        if (currentFull.length > 0 || bracketed) {
+          splits.push({
+            literal: bracketed || /^\s+$/.test(currentFull),
+            val: currentFull === "" ? "'" : currentFull
+          });
+        }
+        current = null;
+        currentFull = "";
+        bracketed = !bracketed;
+      } else if (bracketed) {
+        currentFull += c;
+      } else if (c === current) {
+        currentFull += c;
+      } else {
+        if (currentFull.length > 0) {
+          splits.push({
+            literal: /^\s+$/.test(currentFull),
+            val: currentFull
+          });
+        }
+        currentFull = c;
+        current = c;
+      }
+    }
+    if (currentFull.length > 0) {
+      splits.push({
+        literal: bracketed || /^\s+$/.test(currentFull),
+        val: currentFull
+      });
+    }
+    return splits;
+  }
+  static macroTokenToFormatOpts(token) {
+    return macroTokenToFormatOpts[token];
+  }
+  constructor(locale, formatOpts) {
+    this.opts = formatOpts;
+    this.loc = locale;
+    this.systemLoc = null;
+  }
+  formatWithSystemDefault(dt, opts) {
+    if (this.systemLoc === null) {
+      this.systemLoc = this.loc.redefaultToSystem();
+    }
+    const df = this.systemLoc.dtFormatter(dt, {
+      ...this.opts,
+      ...opts
+    });
+    return df.format();
+  }
+  dtFormatter(dt, opts = {}) {
+    return this.loc.dtFormatter(dt, {
+      ...this.opts,
+      ...opts
+    });
+  }
+  formatDateTime(dt, opts) {
+    return this.dtFormatter(dt, opts).format();
+  }
+  formatDateTimeParts(dt, opts) {
+    return this.dtFormatter(dt, opts).formatToParts();
+  }
+  formatInterval(interval, opts) {
+    const df = this.dtFormatter(interval.start, opts);
+    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+  }
+  resolvedOptions(dt, opts) {
+    return this.dtFormatter(dt, opts).resolvedOptions();
+  }
+  num(n, p = 0, signDisplay = undefined) {
+    // we get some perf out of doing this here, annoyingly
+    if (this.opts.forceSimple) {
+      return padStart(n, p);
+    }
+    const opts = {
+      ...this.opts
+    };
+    if (p > 0) {
+      opts.padTo = p;
+    }
+    if (signDisplay) {
+      opts.signDisplay = signDisplay;
+    }
+    return this.loc.numberFormatter(opts).format(n);
+  }
+  formatDateTimeFromString(dt, fmt) {
+    const knownEnglish = this.loc.listingMode() === "en",
+      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+      string = (opts, extract) => this.loc.extract(dt, opts, extract),
+      formatOffset = opts => {
+        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+          return "Z";
+        }
+        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+      },
+      meridiem = () => knownEnglish ? meridiemForDateTime(dt) : string({
+        hour: "numeric",
+        hourCycle: "h12"
+      }, "dayperiod"),
+      month = (length, standalone) => knownEnglish ? monthForDateTime(dt, length) : string(standalone ? {
+        month: length
+      } : {
+        month: length,
+        day: "numeric"
+      }, "month"),
+      weekday = (length, standalone) => knownEnglish ? weekdayForDateTime(dt, length) : string(standalone ? {
+        weekday: length
+      } : {
+        weekday: length,
+        month: "long",
+        day: "numeric"
+      }, "weekday"),
+      maybeMacro = token => {
+        const formatOpts = Formatter.macroTokenToFormatOpts(token);
+        if (formatOpts) {
+          return this.formatWithSystemDefault(dt, formatOpts);
+        } else {
+          return token;
+        }
+      },
+      era = length => knownEnglish ? eraForDateTime(dt, length) : string({
+        era: length
+      }, "era"),
+      tokenToString = token => {
+        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+        switch (token) {
+          // ms
+          case "S":
+            return this.num(dt.millisecond);
+          case "u":
+          // falls through
+          case "SSS":
+            return this.num(dt.millisecond, 3);
+          // seconds
+          case "s":
+            return this.num(dt.second);
+          case "ss":
+            return this.num(dt.second, 2);
+          // fractional seconds
+          case "uu":
+            return this.num(Math.floor(dt.millisecond / 10), 2);
+          case "uuu":
+            return this.num(Math.floor(dt.millisecond / 100));
+          // minutes
+          case "m":
+            return this.num(dt.minute);
+          case "mm":
+            return this.num(dt.minute, 2);
+          // hours
+          case "h":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+          case "hh":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+          case "H":
+            return this.num(dt.hour);
+          case "HH":
+            return this.num(dt.hour, 2);
+          // offset
+          case "Z":
+            // like +6
+            return formatOffset({
+              format: "narrow",
+              allowZ: this.opts.allowZ
+            });
+          case "ZZ":
+            // like +06:00
+            return formatOffset({
+              format: "short",
+              allowZ: this.opts.allowZ
+            });
+          case "ZZZ":
+            // like +0600
+            return formatOffset({
+              format: "techie",
+              allowZ: this.opts.allowZ
+            });
+          case "ZZZZ":
+            // like EST
+            return dt.zone.offsetName(dt.ts, {
+              format: "short",
+              locale: this.loc.locale
+            });
+          case "ZZZZZ":
+            // like Eastern Standard Time
+            return dt.zone.offsetName(dt.ts, {
+              format: "long",
+              locale: this.loc.locale
+            });
+          // zone
+          case "z":
+            // like America/New_York
+            return dt.zoneName;
+          // meridiems
+          case "a":
+            return meridiem();
+          // dates
+          case "d":
+            return useDateTimeFormatter ? string({
+              day: "numeric"
+            }, "day") : this.num(dt.day);
+          case "dd":
+            return useDateTimeFormatter ? string({
+              day: "2-digit"
+            }, "day") : this.num(dt.day, 2);
+          // weekdays - standalone
+          case "c":
+            // like 1
+            return this.num(dt.weekday);
+          case "ccc":
+            // like 'Tues'
+            return weekday("short", true);
+          case "cccc":
+            // like 'Tuesday'
+            return weekday("long", true);
+          case "ccccc":
+            // like 'T'
+            return weekday("narrow", true);
+          // weekdays - format
+          case "E":
+            // like 1
+            return this.num(dt.weekday);
+          case "EEE":
+            // like 'Tues'
+            return weekday("short", false);
+          case "EEEE":
+            // like 'Tuesday'
+            return weekday("long", false);
+          case "EEEEE":
+            // like 'T'
+            return weekday("narrow", false);
+          // months - standalone
+          case "L":
+            // like 1
+            return useDateTimeFormatter ? string({
+              month: "numeric",
+              day: "numeric"
+            }, "month") : this.num(dt.month);
+          case "LL":
+            // like 01, doesn't seem to work
+            return useDateTimeFormatter ? string({
+              month: "2-digit",
+              day: "numeric"
+            }, "month") : this.num(dt.month, 2);
+          case "LLL":
+            // like Jan
+            return month("short", true);
+          case "LLLL":
+            // like January
+            return month("long", true);
+          case "LLLLL":
+            // like J
+            return month("narrow", true);
+          // months - format
+          case "M":
+            // like 1
+            return useDateTimeFormatter ? string({
+              month: "numeric"
+            }, "month") : this.num(dt.month);
+          case "MM":
+            // like 01
+            return useDateTimeFormatter ? string({
+              month: "2-digit"
+            }, "month") : this.num(dt.month, 2);
+          case "MMM":
+            // like Jan
+            return month("short", false);
+          case "MMMM":
+            // like January
+            return month("long", false);
+          case "MMMMM":
+            // like J
+            return month("narrow", false);
+          // years
+          case "y":
+            // like 2014
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : this.num(dt.year);
+          case "yy":
+            // like 14
+            return useDateTimeFormatter ? string({
+              year: "2-digit"
+            }, "year") : this.num(dt.year.toString().slice(-2), 2);
+          case "yyyy":
+            // like 0012
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : this.num(dt.year, 4);
+          case "yyyyyy":
+            // like 000012
+            return useDateTimeFormatter ? string({
+              year: "numeric"
+            }, "year") : this.num(dt.year, 6);
+          // eras
+          case "G":
+            // like AD
+            return era("short");
+          case "GG":
+            // like Anno Domini
+            return era("long");
+          case "GGGGG":
+            return era("narrow");
+          case "kk":
+            return this.num(dt.weekYear.toString().slice(-2), 2);
+          case "kkkk":
+            return this.num(dt.weekYear, 4);
+          case "W":
+            return this.num(dt.weekNumber);
+          case "WW":
+            return this.num(dt.weekNumber, 2);
+          case "n":
+            return this.num(dt.localWeekNumber);
+          case "nn":
+            return this.num(dt.localWeekNumber, 2);
+          case "ii":
+            return this.num(dt.localWeekYear.toString().slice(-2), 2);
+          case "iiii":
+            return this.num(dt.localWeekYear, 4);
+          case "o":
+            return this.num(dt.ordinal);
+          case "ooo":
+            return this.num(dt.ordinal, 3);
+          case "q":
+            // like 1
+            return this.num(dt.quarter);
+          case "qq":
+            // like 01
+            return this.num(dt.quarter, 2);
+          case "X":
+            return this.num(Math.floor(dt.ts / 1000));
+          case "x":
+            return this.num(dt.ts);
+          default:
+            return maybeMacro(token);
+        }
+      };
+    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+  }
+  formatDurationFromString(dur, fmt) {
+    const invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+    const tokenToField = token => {
+        switch (token[0]) {
+          case "S":
+            return "milliseconds";
+          case "s":
+            return "seconds";
+          case "m":
+            return "minutes";
+          case "h":
+            return "hours";
+          case "d":
+            return "days";
+          case "w":
+            return "weeks";
+          case "M":
+            return "months";
+          case "y":
+            return "years";
+          default:
+            return null;
+        }
+      },
+      tokenToString = (lildur, info) => token => {
+        const mapped = tokenToField(token);
+        if (mapped) {
+          const inversionFactor = info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+          let signDisplay;
+          if (this.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+            signDisplay = "never";
+          } else if (this.opts.signMode === "all") {
+            signDisplay = "always";
+          } else {
+            // "auto" and "negative" are the same, but "auto" has better support
+            signDisplay = "auto";
+          }
+          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+        } else {
+          return token;
+        }
+      },
+      tokens = Formatter.parseFormat(fmt),
+      realTokens = tokens.reduce((found, {
+        literal,
+        val
+      }) => literal ? found : found.concat(val), []),
+      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter(t => t)),
+      durationInfo = {
+        isNegativeDuration: collapsed < 0,
+        // this relies on "collapsed" being based on "shiftTo", which builds up the object
+        // in order
+        largestUnit: Object.keys(collapsed.values)[0]
+      };
+    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+  }
+}
+
+/*
+ * This file handles parsing for well-specified formats. Here's how it works:
+ * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+ * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+ * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+ * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+ * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+ * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+ */
+
+const ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+function combineRegexes(...regexes) {
+  const full = regexes.reduce((f, r) => f + r.source, "");
+  return RegExp(`^${full}$`);
+}
+function combineExtractors(...extractors) {
+  return m => extractors.reduce(([mergedVals, mergedZone, cursor], ex) => {
+    const [val, zone, next] = ex(m, cursor);
+    return [{
+      ...mergedVals,
+      ...val
+    }, zone || mergedZone, next];
+  }, [{}, null, 1]).slice(0, 2);
+}
+function parse(s, ...patterns) {
+  if (s == null) {
+    return [null, null];
+  }
+  for (const [regex, extractor] of patterns) {
+    const m = regex.exec(s);
+    if (m) {
+      return extractor(m);
+    }
+  }
+  return [null, null];
+}
+function simpleParse(...keys) {
+  return (match, cursor) => {
+    const ret = {};
+    let i;
+    for (i = 0; i < keys.length; i++) {
+      ret[keys[i]] = parseInteger(match[cursor + i]);
+    }
+    return [ret, null, cursor + i];
+  };
+}
+
+// ISO and SQL parsing
+const offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+const isoExtendedZone = `(?:${offsetRegex.source}?(?:\\[(${ianaRegex.source})\\])?)?`;
+const isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+const isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);
+const isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);
+const isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+const isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+const isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+const extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+const extractISOOrdinalData = simpleParse("year", "ordinal");
+const sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+const sqlTimeRegex = RegExp(`${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`);
+const sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);
+function int(match, pos, fallback) {
+  const m = match[pos];
+  return isUndefined(m) ? fallback : parseInteger(m);
+}
+function extractISOYmd(match, cursor) {
+  const item = {
+    year: int(match, cursor),
+    month: int(match, cursor + 1, 1),
+    day: int(match, cursor + 2, 1)
+  };
+  return [item, null, cursor + 3];
+}
+function extractISOTime(match, cursor) {
+  const item = {
+    hours: int(match, cursor, 0),
+    minutes: int(match, cursor + 1, 0),
+    seconds: int(match, cursor + 2, 0),
+    milliseconds: parseMillis(match[cursor + 3])
+  };
+  return [item, null, cursor + 4];
+}
+function extractISOOffset(match, cursor) {
+  const local = !match[cursor] && !match[cursor + 1],
+    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+    zone = local ? null : FixedOffsetZone.instance(fullOffset);
+  return [{}, zone, cursor + 3];
+}
+function extractIANAZone(match, cursor) {
+  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+  return [{}, zone, cursor + 1];
+}
+
+// ISO time parsing
+
+const isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);
+
+// ISO duration parsing
+
+const isoDuration = /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+function extractISODuration(match) {
+  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] = match;
+  const hasNegativePrefix = s[0] === "-";
+  const negativeSeconds = secondStr && secondStr[0] === "-";
+  const maybeNegate = (num, force = false) => num !== undefined && (force || num && hasNegativePrefix) ? -num : num;
+  return [{
+    years: maybeNegate(parseFloating(yearStr)),
+    months: maybeNegate(parseFloating(monthStr)),
+    weeks: maybeNegate(parseFloating(weekStr)),
+    days: maybeNegate(parseFloating(dayStr)),
+    hours: maybeNegate(parseFloating(hourStr)),
+    minutes: maybeNegate(parseFloating(minuteStr)),
+    seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+    milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds)
+  }];
+}
+
+// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+// and not just that we're in -240 *right now*. But since I don't think these are used that often
+// I'm just going to ignore that
+const obsOffsets = {
+  GMT: 0,
+  EDT: -4 * 60,
+  EST: -5 * 60,
+  CDT: -5 * 60,
+  CST: -6 * 60,
+  MDT: -6 * 60,
+  MST: -7 * 60,
+  PDT: -7 * 60,
+  PST: -8 * 60
+};
+function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+  const result = {
+    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+    month: monthsShort.indexOf(monthStr) + 1,
+    day: parseInteger(dayStr),
+    hour: parseInteger(hourStr),
+    minute: parseInteger(minuteStr)
+  };
+  if (secondStr) result.second = parseInteger(secondStr);
+  if (weekdayStr) {
+    result.weekday = weekdayStr.length > 3 ? weekdaysLong.indexOf(weekdayStr) + 1 : weekdaysShort.indexOf(weekdayStr) + 1;
+  }
+  return result;
+}
+
+// RFC 2822/5322
+const rfc2822 = /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+function extractRFC2822(match) {
+  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr, obsOffset, milOffset, offHourStr, offMinuteStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  let offset;
+  if (obsOffset) {
+    offset = obsOffsets[obsOffset];
+  } else if (milOffset) {
+    offset = 0;
+  } else {
+    offset = signedOffset(offHourStr, offMinuteStr);
+  }
+  return [result, new FixedOffsetZone(offset)];
+}
+function preprocessRFC2822(s) {
+  // Remove comments and folding whitespace and replace multiple-spaces with a single space
+  return s.replace(/\([^()]*\)|[\n\t]/g, " ").replace(/(\s\s+)/g, " ").trim();
+}
+
+// http date
+
+const rfc1123 = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+  rfc850 = /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+  ascii = /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+function extractRFC1123Or850(match) {
+  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+function extractASCII(match) {
+  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+const isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+const isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+const isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+const isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+const extractISOYmdTimeAndOffset = combineExtractors(extractISOYmd, extractISOTime, extractISOOffset, extractIANAZone);
+const extractISOWeekTimeAndOffset = combineExtractors(extractISOWeekData, extractISOTime, extractISOOffset, extractIANAZone);
+const extractISOOrdinalDateAndTime = combineExtractors(extractISOOrdinalData, extractISOTime, extractISOOffset, extractIANAZone);
+const extractISOTimeAndOffset = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+
+/*
+ * @private
+ */
+
+function parseISODate(s) {
+  return parse(s, [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset], [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime], [isoTimeCombinedRegex, extractISOTimeAndOffset]);
+}
+function parseRFC2822Date(s) {
+  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+}
+function parseHTTPDate(s) {
+  return parse(s, [rfc1123, extractRFC1123Or850], [rfc850, extractRFC1123Or850], [ascii, extractASCII]);
+}
+function parseISODuration(s) {
+  return parse(s, [isoDuration, extractISODuration]);
+}
+const extractISOTimeOnly = combineExtractors(extractISOTime);
+function parseISOTimeOnly(s) {
+  return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+}
+const sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+const sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+const extractISOTimeOffsetAndIANAZone = combineExtractors(extractISOTime, extractISOOffset, extractIANAZone);
+function parseSQL(s) {
+  return parse(s, [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset], [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]);
+}
+
+const INVALID$2 = "Invalid Duration";
+
+// unit conversion constants
+const lowOrderMatrix = {
+    weeks: {
+      days: 7,
+      hours: 7 * 24,
+      minutes: 7 * 24 * 60,
+      seconds: 7 * 24 * 60 * 60,
+      milliseconds: 7 * 24 * 60 * 60 * 1000
+    },
+    days: {
+      hours: 24,
+      minutes: 24 * 60,
+      seconds: 24 * 60 * 60,
+      milliseconds: 24 * 60 * 60 * 1000
+    },
+    hours: {
+      minutes: 60,
+      seconds: 60 * 60,
+      milliseconds: 60 * 60 * 1000
+    },
+    minutes: {
+      seconds: 60,
+      milliseconds: 60 * 1000
+    },
+    seconds: {
+      milliseconds: 1000
+    }
+  },
+  casualMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: 52,
+      days: 365,
+      hours: 365 * 24,
+      minutes: 365 * 24 * 60,
+      seconds: 365 * 24 * 60 * 60,
+      milliseconds: 365 * 24 * 60 * 60 * 1000
+    },
+    quarters: {
+      months: 3,
+      weeks: 13,
+      days: 91,
+      hours: 91 * 24,
+      minutes: 91 * 24 * 60,
+      seconds: 91 * 24 * 60 * 60,
+      milliseconds: 91 * 24 * 60 * 60 * 1000
+    },
+    months: {
+      weeks: 4,
+      days: 30,
+      hours: 30 * 24,
+      minutes: 30 * 24 * 60,
+      seconds: 30 * 24 * 60 * 60,
+      milliseconds: 30 * 24 * 60 * 60 * 1000
+    },
+    ...lowOrderMatrix
+  },
+  daysInYearAccurate = 146097.0 / 400,
+  daysInMonthAccurate = 146097.0 / 4800,
+  accurateMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: daysInYearAccurate / 7,
+      days: daysInYearAccurate,
+      hours: daysInYearAccurate * 24,
+      minutes: daysInYearAccurate * 24 * 60,
+      seconds: daysInYearAccurate * 24 * 60 * 60,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000
+    },
+    quarters: {
+      months: 3,
+      weeks: daysInYearAccurate / 28,
+      days: daysInYearAccurate / 4,
+      hours: daysInYearAccurate * 24 / 4,
+      minutes: daysInYearAccurate * 24 * 60 / 4,
+      seconds: daysInYearAccurate * 24 * 60 * 60 / 4,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000 / 4
+    },
+    months: {
+      weeks: daysInMonthAccurate / 7,
+      days: daysInMonthAccurate,
+      hours: daysInMonthAccurate * 24,
+      minutes: daysInMonthAccurate * 24 * 60,
+      seconds: daysInMonthAccurate * 24 * 60 * 60,
+      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000
+    },
+    ...lowOrderMatrix
+  };
+
+// units ordered by size
+const orderedUnits$1 = ["years", "quarters", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds"];
+const reverseUnits = orderedUnits$1.slice(0).reverse();
+
+// clone really means "create another instance just like this one, but with these changes"
+function clone$1(dur, alts, clear = false) {
+  // deep merge for vals
+  const conf = {
+    values: clear ? alts.values : {
+      ...dur.values,
+      ...(alts.values || {})
+    },
+    loc: dur.loc.clone(alts.loc),
+    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+    matrix: alts.matrix || dur.matrix
+  };
+  return new Duration(conf);
+}
+function durationToMillis(matrix, vals) {
+  var _vals$milliseconds;
+  let sum = (_vals$milliseconds = vals.milliseconds) != null ? _vals$milliseconds : 0;
+  for (const unit of reverseUnits.slice(1)) {
+    if (vals[unit]) {
+      sum += vals[unit] * matrix[unit]["milliseconds"];
+    }
+  }
+  return sum;
+}
+
+// NB: mutates parameters
+function normalizeValues(matrix, vals) {
+  // the logic below assumes the overall value of the duration is positive
+  // if this is not the case, factor is used to make it so
+  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+  orderedUnits$1.reduceRight((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const previousVal = vals[previous] * factor;
+        const conv = matrix[current][previous];
+
+        // if (previousVal < 0):
+        // lower order unit is negative (e.g. { years: 2, days: -2 })
+        // normalize this by reducing the higher order unit by the appropriate amount
+        // and increasing the lower order unit
+        // this can never make the higher order unit negative, because this function only operates
+        // on positive durations, so the amount of time represented by the lower order unit cannot
+        // be larger than the higher order unit
+        // else:
+        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+        // in this case we attempt to convert as much as possible from the lower order unit into
+        // the higher order one
+        //
+        // Math.floor takes care of both of these cases, rounding away from 0
+        // if previousVal < 0 it makes the absolute value larger
+        // if previousVal >= it makes the absolute value smaller
+        const rollUp = Math.floor(previousVal / conv);
+        vals[current] += rollUp * factor;
+        vals[previous] -= rollUp * conv * factor;
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+
+  // try to convert any decimals into smaller units if possible
+  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+  orderedUnits$1.reduce((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const fraction = vals[previous] % 1;
+        vals[previous] -= fraction;
+        vals[current] += fraction * matrix[previous][current];
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+}
+
+// Remove all properties with a value of 0 from an object
+function removeZeroes(vals) {
+  const newVals = {};
+  for (const [key, value] of Object.entries(vals)) {
+    if (value !== 0) {
+      newVals[key] = value;
+    }
+  }
+  return newVals;
+}
+
+/**
+ * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+ *
+ * Here is a brief overview of commonly used methods and getters in Duration:
+ *
+ * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+ * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+ * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+ * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+ * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+ *
+ * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+ */
+class Duration {
+  /**
+   * @private
+   */
+  constructor(config) {
+    const accurate = config.conversionAccuracy === "longterm" || false;
+    let matrix = accurate ? accurateMatrix : casualMatrix;
+    if (config.matrix) {
+      matrix = config.matrix;
+    }
+
+    /**
+     * @access private
+     */
+    this.values = config.values;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.conversionAccuracy = accurate ? "longterm" : "casual";
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.matrix = matrix;
+    /**
+     * @access private
+     */
+    this.isLuxonDuration = true;
+  }
+
+  /**
+   * Create Duration from a number of milliseconds.
+   * @param {number} count of milliseconds
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  static fromMillis(count, opts) {
+    return Duration.fromObject({
+      milliseconds: count
+    }, opts);
+  }
+
+  /**
+   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+   * If this object is empty then a zero milliseconds duration is returned.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.years
+   * @param {number} obj.quarters
+   * @param {number} obj.months
+   * @param {number} obj.weeks
+   * @param {number} obj.days
+   * @param {number} obj.hours
+   * @param {number} obj.minutes
+   * @param {number} obj.seconds
+   * @param {number} obj.milliseconds
+   * @param {Object} [opts=[]] - options for creating this Duration
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the custom conversion system to use
+   * @return {Duration}
+   */
+  static fromObject(obj, opts = {}) {
+    if (obj == null || typeof obj !== "object") {
+      throw new InvalidArgumentError(`Duration.fromObject: argument expected to be an object, got ${obj === null ? "null" : typeof obj}`);
+    }
+    return new Duration({
+      values: normalizeObject(obj, Duration.normalizeUnit),
+      loc: Locale.fromObject(opts),
+      conversionAccuracy: opts.conversionAccuracy,
+      matrix: opts.matrix
+    });
+  }
+
+  /**
+   * Create a Duration from DurationLike.
+   *
+   * @param {Object | number | Duration} durationLike
+   * One of:
+   * - object with keys like 'years' and 'hours'.
+   * - number representing milliseconds
+   * - Duration instance
+   * @return {Duration}
+   */
+  static fromDurationLike(durationLike) {
+    if (isNumber(durationLike)) {
+      return Duration.fromMillis(durationLike);
+    } else if (Duration.isDuration(durationLike)) {
+      return durationLike;
+    } else if (typeof durationLike === "object") {
+      return Duration.fromObject(durationLike);
+    } else {
+      throw new InvalidArgumentError(`Unknown duration argument ${durationLike} of type ${typeof durationLike}`);
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 duration string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the preset conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+   * @return {Duration}
+   */
+  static fromISO(text, opts) {
+    const [parsed] = parseISODuration(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 time string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @return {Duration}
+   */
+  static fromISOTime(text, opts) {
+    const [parsed] = parseISOTimeOnly(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create an invalid Duration.
+   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Duration}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+    }
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDurationError(invalid);
+    } else {
+      return new Duration({
+        invalid
+      });
+    }
+  }
+
+  /**
+   * @private
+   */
+  static normalizeUnit(unit) {
+    const normalized = {
+      year: "years",
+      years: "years",
+      quarter: "quarters",
+      quarters: "quarters",
+      month: "months",
+      months: "months",
+      week: "weeks",
+      weeks: "weeks",
+      day: "days",
+      days: "days",
+      hour: "hours",
+      hours: "hours",
+      minute: "minutes",
+      minutes: "minutes",
+      second: "seconds",
+      seconds: "seconds",
+      millisecond: "milliseconds",
+      milliseconds: "milliseconds"
+    }[unit ? unit.toLowerCase() : unit];
+    if (!normalized) throw new InvalidUnitError(unit);
+    return normalized;
+  }
+
+  /**
+   * Check if an object is a Duration. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDuration(o) {
+    return o && o.isLuxonDuration || false;
+  }
+
+  /**
+   * Get  the locale of a Duration, such 'en-GB'
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+   * * `S` for milliseconds
+   * * `s` for seconds
+   * * `m` for minutes
+   * * `h` for hours
+   * * `d` for days
+   * * `w` for weeks
+   * * `M` for months
+   * * `y` for years
+   * Notes:
+   * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+   * * Tokens can be escaped by wrapping with single quotes.
+   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - options
+   * @param {boolean} [opts.floor=true] - floor numerical values
+   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+    const fmtOpts = {
+      ...opts,
+      floor: opts.round !== false && opts.floor !== false
+    };
+    return this.isValid ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt) : INVALID$2;
+  }
+
+  /**
+   * Returns a string representation of a Duration with all units included.
+   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+   * @example
+   * ```js
+   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+   * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+   * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+   * ```
+   */
+  toHuman(opts = {}) {
+    if (!this.isValid) return INVALID$2;
+    const showZeros = opts.showZeros !== false;
+    const l = orderedUnits$1.map(unit => {
+      const val = this.values[unit];
+      if (isUndefined(val) || val === 0 && !showZeros) {
+        return null;
+      }
+      return this.loc.numberFormatter({
+        style: "unit",
+        unitDisplay: "long",
+        ...opts,
+        unit: unit.slice(0, -1)
+      }).format(val);
+    }).filter(n => n);
+    return this.loc.listFormatter({
+      type: "conjunction",
+      style: opts.listStyle || "narrow",
+      ...opts
+    }).format(l);
+  }
+
+  /**
+   * Returns a JavaScript object with this Duration's values.
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+   * @return {Object}
+   */
+  toObject() {
+    if (!this.isValid) return {};
+    return {
+      ...this.values
+    };
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+   * @return {string}
+   */
+  toISO() {
+    // we could use the formatter, but this is an easier way to get the minimum string
+    if (!this.isValid) return null;
+    let s = "P";
+    if (this.years !== 0) s += this.years + "Y";
+    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+    if (this.weeks !== 0) s += this.weeks + "W";
+    if (this.days !== 0) s += this.days + "D";
+    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0) s += "T";
+    if (this.hours !== 0) s += this.hours + "H";
+    if (this.minutes !== 0) s += this.minutes + "M";
+    if (this.seconds !== 0 || this.milliseconds !== 0)
+      // this will handle "floating point madness" by removing extra decimal places
+      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+    if (s === "P") s += "T0S";
+    return s;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+   * @return {string}
+   */
+  toISOTime(opts = {}) {
+    if (!this.isValid) return null;
+    const millis = this.toMillis();
+    if (millis < 0 || millis >= 86400000) return null;
+    opts = {
+      suppressMilliseconds: false,
+      suppressSeconds: false,
+      includePrefix: false,
+      format: "extended",
+      ...opts,
+      includeOffset: false
+    };
+    const dateTime = DateTime.fromMillis(millis, {
+      zone: "UTC"
+    });
+    return dateTime.toISOTime(opts);
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+   * @return {string}
+   */
+  toString() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a string representation of this Duration appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Duration { values: ${JSON.stringify(this.values)} }`;
+    } else {
+      return `Duration { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration.
+   * @return {number}
+   */
+  toMillis() {
+    if (!this.isValid) return NaN;
+    return durationToMillis(this.matrix, this.values);
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration),
+      result = {};
+    for (const k of orderedUnits$1) {
+      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+        result[k] = dur.get(k) + this.get(k);
+      }
+    }
+    return clone$1(this, {
+      values: result
+    }, true);
+  }
+
+  /**
+   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration);
+    return this.plus(dur.negate());
+  }
+
+  /**
+   * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+   * @return {Duration}
+   */
+  mapUnits(fn) {
+    if (!this.isValid) return this;
+    const result = {};
+    for (const k of Object.keys(this.values)) {
+      result[k] = asNumber(fn(this.values[k], k));
+    }
+    return clone$1(this, {
+      values: result
+    }, true);
+  }
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+   * @return {number}
+   */
+  get(unit) {
+    return this[Duration.normalizeUnit(unit)];
+  }
+
+  /**
+   * "Set" the values of specified units. Return a newly-constructed Duration.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dur.set({ years: 2017 })
+   * @example dur.set({ hours: 8, minutes: 30 })
+   * @return {Duration}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+    const mixed = {
+      ...this.values,
+      ...normalizeObject(values, Duration.normalizeUnit)
+    };
+    return clone$1(this, {
+      values: mixed
+    });
+  }
+
+  /**
+   * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+   * @example dur.reconfigure({ locale: 'en-GB' })
+   * @return {Duration}
+   */
+  reconfigure({
+    locale,
+    numberingSystem,
+    conversionAccuracy,
+    matrix
+  } = {}) {
+    const loc = this.loc.clone({
+      locale,
+      numberingSystem
+    });
+    const opts = {
+      loc,
+      matrix,
+      conversionAccuracy
+    };
+    return clone$1(this, opts);
+  }
+
+  /**
+   * Return the length of the duration in the specified unit.
+   * @param {string} unit - a unit such as 'minutes' or 'days'
+   * @example Duration.fromObject({years: 1}).as('days') //=> 365
+   * @example Duration.fromObject({years: 1}).as('months') //=> 12
+   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+   * @return {number}
+   */
+  as(unit) {
+    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+  }
+
+  /**
+   * Reduce this Duration to its canonical representation in its current units.
+   * Assuming the overall value of the Duration is positive, this means:
+   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+   *   the overall value would be negative, see third example)
+   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+   *
+   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+   * @return {Duration}
+   */
+  normalize() {
+    if (!this.isValid) return this;
+    const vals = this.toObject();
+    normalizeValues(this.matrix, vals);
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Rescale units to its largest representation
+   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+   * @return {Duration}
+   */
+  rescale() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.normalize().shiftToAll().toObject());
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Convert this Duration into its representation in a different set of units.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+   * @return {Duration}
+   */
+  shiftTo(...units) {
+    if (!this.isValid) return this;
+    if (units.length === 0) {
+      return this;
+    }
+    units = units.map(u => Duration.normalizeUnit(u));
+    const built = {},
+      accumulated = {},
+      vals = this.toObject();
+    let lastUnit;
+    for (const k of orderedUnits$1) {
+      if (units.indexOf(k) >= 0) {
+        lastUnit = k;
+        let own = 0;
+
+        // anything we haven't boiled down yet should get boiled to this unit
+        for (const ak in accumulated) {
+          own += this.matrix[ak][k] * accumulated[ak];
+          accumulated[ak] = 0;
+        }
+
+        // plus anything that's already in this unit
+        if (isNumber(vals[k])) {
+          own += vals[k];
+        }
+
+        // only keep the integer part for now in the hopes of putting any decimal part
+        // into a smaller unit later
+        const i = Math.trunc(own);
+        built[k] = i;
+        accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+        // otherwise, keep it in the wings to boil it later
+      } else if (isNumber(vals[k])) {
+        accumulated[k] = vals[k];
+      }
+    }
+
+    // anything leftover becomes the decimal for the last unit
+    // lastUnit must be defined since units is not empty
+    for (const key in accumulated) {
+      if (accumulated[key] !== 0) {
+        built[lastUnit] += key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+      }
+    }
+    normalizeValues(this.matrix, built);
+    return clone$1(this, {
+      values: built
+    }, true);
+  }
+
+  /**
+   * Shift this Duration to all available units.
+   * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+   * @return {Duration}
+   */
+  shiftToAll() {
+    if (!this.isValid) return this;
+    return this.shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds");
+  }
+
+  /**
+   * Return the negative of this Duration.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+   * @return {Duration}
+   */
+  negate() {
+    if (!this.isValid) return this;
+    const negated = {};
+    for (const k of Object.keys(this.values)) {
+      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+    }
+    return clone$1(this, {
+      values: negated
+    }, true);
+  }
+
+  /**
+   * Removes all units with values equal to 0 from this Duration.
+   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+   * @return {Duration}
+   */
+  removeZeros() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.values);
+    return clone$1(this, {
+      values: vals
+    }, true);
+  }
+
+  /**
+   * Get the years.
+   * @type {number}
+   */
+  get years() {
+    return this.isValid ? this.values.years || 0 : NaN;
+  }
+
+  /**
+   * Get the quarters.
+   * @type {number}
+   */
+  get quarters() {
+    return this.isValid ? this.values.quarters || 0 : NaN;
+  }
+
+  /**
+   * Get the months.
+   * @type {number}
+   */
+  get months() {
+    return this.isValid ? this.values.months || 0 : NaN;
+  }
+
+  /**
+   * Get the weeks
+   * @type {number}
+   */
+  get weeks() {
+    return this.isValid ? this.values.weeks || 0 : NaN;
+  }
+
+  /**
+   * Get the days.
+   * @type {number}
+   */
+  get days() {
+    return this.isValid ? this.values.days || 0 : NaN;
+  }
+
+  /**
+   * Get the hours.
+   * @type {number}
+   */
+  get hours() {
+    return this.isValid ? this.values.hours || 0 : NaN;
+  }
+
+  /**
+   * Get the minutes.
+   * @type {number}
+   */
+  get minutes() {
+    return this.isValid ? this.values.minutes || 0 : NaN;
+  }
+
+  /**
+   * Get the seconds.
+   * @return {number}
+   */
+  get seconds() {
+    return this.isValid ? this.values.seconds || 0 : NaN;
+  }
+
+  /**
+   * Get the milliseconds.
+   * @return {number}
+   */
+  get milliseconds() {
+    return this.isValid ? this.values.milliseconds || 0 : NaN;
+  }
+
+  /**
+   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+   * on invalid DateTimes or Intervals.
+   * @return {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this Duration became invalid, or null if the Duration is valid
+   * @return {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Equality check
+   * Two Durations are equal iff they have the same units and the same values for each unit.
+   * @param {Duration} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+    if (!this.loc.equals(other.loc)) {
+      return false;
+    }
+    function eq(v1, v2) {
+      // Consider 0 and undefined as equal
+      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+      return v1 === v2;
+    }
+    for (const u of orderedUnits$1) {
+      if (!eq(this.values[u], other.values[u])) {
+        return false;
+      }
+    }
+    return true;
+  }
+}
+
+const INVALID$1 = "Invalid Interval";
+
+// checks if the start is equal to or before the end
+function validateStartEnd(start, end) {
+  if (!start || !start.isValid) {
+    return Interval.invalid("missing or invalid start");
+  } else if (!end || !end.isValid) {
+    return Interval.invalid("missing or invalid end");
+  } else if (end < start) {
+    return Interval.invalid("end before start", `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`);
+  } else {
+    return null;
+  }
+}
+
+/**
+ * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+ *
+ * Here is a brief overview of the most commonly used methods and getters in Interval:
+ *
+ * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+ * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+ * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+ * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+ * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+ * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+ */
+class Interval {
+  /**
+   * @private
+   */
+  constructor(config) {
+    /**
+     * @access private
+     */
+    this.s = config.start;
+    /**
+     * @access private
+     */
+    this.e = config.end;
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.isLuxonInterval = true;
+  }
+
+  /**
+   * Create an invalid Interval.
+   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Interval}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+    }
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidIntervalError(invalid);
+    } else {
+      return new Interval({
+        invalid
+      });
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+   * @param {DateTime|Date|Object} start
+   * @param {DateTime|Date|Object} end
+   * @return {Interval}
+   */
+  static fromDateTimes(start, end) {
+    const builtStart = friendlyDateTime(start),
+      builtEnd = friendlyDateTime(end);
+    const validateError = validateStartEnd(builtStart, builtEnd);
+    if (validateError == null) {
+      return new Interval({
+        start: builtStart,
+        end: builtEnd
+      });
+    } else {
+      return validateError;
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and a Duration to extend to.
+   * @param {DateTime|Date|Object} start
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static after(start, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(start);
+    return Interval.fromDateTimes(dt, dt.plus(dur));
+  }
+
+  /**
+   * Create an Interval from an end DateTime and a Duration to extend backwards to.
+   * @param {DateTime|Date|Object} end
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static before(end, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(end);
+    return Interval.fromDateTimes(dt.minus(dur), dt);
+  }
+
+  /**
+   * Create an Interval from an ISO 8601 string.
+   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+   * @param {string} text - the ISO string to parse
+   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {Interval}
+   */
+  static fromISO(text, opts) {
+    const [s, e] = (text || "").split("/", 2);
+    if (s && e) {
+      let start, startIsValid;
+      try {
+        start = DateTime.fromISO(s, opts);
+        startIsValid = start.isValid;
+      } catch (e) {
+        startIsValid = false;
+      }
+      let end, endIsValid;
+      try {
+        end = DateTime.fromISO(e, opts);
+        endIsValid = end.isValid;
+      } catch (e) {
+        endIsValid = false;
+      }
+      if (startIsValid && endIsValid) {
+        return Interval.fromDateTimes(start, end);
+      }
+      if (startIsValid) {
+        const dur = Duration.fromISO(e, opts);
+        if (dur.isValid) {
+          return Interval.after(start, dur);
+        }
+      } else if (endIsValid) {
+        const dur = Duration.fromISO(s, opts);
+        if (dur.isValid) {
+          return Interval.before(end, dur);
+        }
+      }
+    }
+    return Interval.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+  }
+
+  /**
+   * Check if an object is an Interval. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isInterval(o) {
+    return o && o.isLuxonInterval || false;
+  }
+
+  /**
+   * Returns the start of the Interval
+   * @type {DateTime}
+   */
+  get start() {
+    return this.isValid ? this.s : null;
+  }
+
+  /**
+   * Returns the end of the Interval. This is the first instant which is not part of the interval
+   * (Interval is half-open).
+   * @type {DateTime}
+   */
+  get end() {
+    return this.isValid ? this.e : null;
+  }
+
+  /**
+   * Returns the last DateTime included in the interval (since end is not part of the interval)
+   * @type {DateTime}
+   */
+  get lastDateTime() {
+    return this.isValid ? this.e ? this.e.minus(1) : null : null;
+  }
+
+  /**
+   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalidReason === null;
+  }
+
+  /**
+   * Returns an error code if this Interval is invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Returns the length of the Interval in the specified unit.
+   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+   * @return {number}
+   */
+  length(unit = "milliseconds") {
+    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;
+  }
+
+  /**
+   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+   * @param {string} [unit='milliseconds'] - the unit of time to count.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+   * @return {number}
+   */
+  count(unit = "milliseconds", opts) {
+    if (!this.isValid) return NaN;
+    const start = this.start.startOf(unit, opts);
+    let end;
+    if (opts != null && opts.useLocaleWeeks) {
+      end = this.end.reconfigure({
+        locale: start.locale
+      });
+    } else {
+      end = this.end;
+    }
+    end = end.startOf(unit, opts);
+    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+  }
+
+  /**
+   * Returns whether this Interval's start and end are both in the same unit of time
+   * @param {string} unit - the unit of time to check sameness on
+   * @return {boolean}
+   */
+  hasSame(unit) {
+    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end DateTimes.
+   * @return {boolean}
+   */
+  isEmpty() {
+    return this.s.valueOf() === this.e.valueOf();
+  }
+
+  /**
+   * Return whether this Interval's start is after the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isAfter(dateTime) {
+    if (!this.isValid) return false;
+    return this.s > dateTime;
+  }
+
+  /**
+   * Return whether this Interval's end is before the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isBefore(dateTime) {
+    if (!this.isValid) return false;
+    return this.e <= dateTime;
+  }
+
+  /**
+   * Return whether this Interval contains the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  contains(dateTime) {
+    if (!this.isValid) return false;
+    return this.s <= dateTime && this.e > dateTime;
+  }
+
+  /**
+   * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+   * @param {Object} values - the values to set
+   * @param {DateTime} values.start - the starting DateTime
+   * @param {DateTime} values.end - the ending DateTime
+   * @return {Interval}
+   */
+  set({
+    start,
+    end
+  } = {}) {
+    if (!this.isValid) return this;
+    return Interval.fromDateTimes(start || this.s, end || this.e);
+  }
+
+  /**
+   * Split this Interval at each of the specified DateTimes
+   * @param {...DateTime} dateTimes - the unit of time to count.
+   * @return {Array}
+   */
+  splitAt(...dateTimes) {
+    if (!this.isValid) return [];
+    const sorted = dateTimes.map(friendlyDateTime).filter(d => this.contains(d)).sort((a, b) => a.toMillis() - b.toMillis()),
+      results = [];
+    let {
+        s
+      } = this,
+      i = 0;
+    while (s < this.e) {
+      const added = sorted[i] || this.e,
+        next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      i += 1;
+    }
+    return results;
+  }
+
+  /**
+   * Split this Interval into smaller Intervals, each of the specified length.
+   * Left over time is grouped into a smaller interval
+   * @param {Duration|Object|number} duration - The length of each resulting interval.
+   * @return {Array}
+   */
+  splitBy(duration) {
+    const dur = Duration.fromDurationLike(duration);
+    if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+      return [];
+    }
+    let {
+        s
+      } = this,
+      idx = 1,
+      next;
+    const results = [];
+    while (s < this.e) {
+      const added = this.start.plus(dur.mapUnits(x => x * idx));
+      next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      idx += 1;
+    }
+    return results;
+  }
+
+  /**
+   * Split this Interval into the specified number of smaller intervals.
+   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+   * @return {Array}
+   */
+  divideEqually(numberOfParts) {
+    if (!this.isValid) return [];
+    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+  }
+
+  /**
+   * Return whether this Interval overlaps with the specified Interval
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  overlaps(other) {
+    return this.e > other.s && this.s < other.e;
+  }
+
+  /**
+   * Return whether this Interval's end is adjacent to the specified Interval's start.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsStart(other) {
+    if (!this.isValid) return false;
+    return +this.e === +other.s;
+  }
+
+  /**
+   * Return whether this Interval's start is adjacent to the specified Interval's end.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsEnd(other) {
+    if (!this.isValid) return false;
+    return +other.e === +this.s;
+  }
+
+  /**
+   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  engulfs(other) {
+    if (!this.isValid) return false;
+    return this.s <= other.s && this.e >= other.e;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end as the specified Interval.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+    return this.s.equals(other.s) && this.e.equals(other.e);
+  }
+
+  /**
+   * Return an Interval representing the intersection of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+   * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  intersection(other) {
+    if (!this.isValid) return this;
+    const s = this.s > other.s ? this.s : other.s,
+      e = this.e < other.e ? this.e : other.e;
+    if (s >= e) {
+      return null;
+    } else {
+      return Interval.fromDateTimes(s, e);
+    }
+  }
+
+  /**
+   * Return an Interval representing the union of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  union(other) {
+    if (!this.isValid) return this;
+    const s = this.s < other.s ? this.s : other.s,
+      e = this.e > other.e ? this.e : other.e;
+    return Interval.fromDateTimes(s, e);
+  }
+
+  /**
+   * Merge an array of Intervals into an equivalent minimal set of Intervals.
+   * Combines overlapping and adjacent Intervals.
+   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+   * and ending with the latest.
+   *
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static merge(intervals) {
+    const [found, final] = intervals.sort((a, b) => a.s - b.s).reduce(([sofar, current], item) => {
+      if (!current) {
+        return [sofar, item];
+      } else if (current.overlaps(item) || current.abutsStart(item)) {
+        return [sofar, current.union(item)];
+      } else {
+        return [sofar.concat([current]), item];
+      }
+    }, [[], null]);
+    if (final) {
+      found.push(final);
+    }
+    return found;
+  }
+
+  /**
+   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static xor(intervals) {
+    let start = null,
+      currentCount = 0;
+    const results = [],
+      ends = intervals.map(i => [{
+        time: i.s,
+        type: "s"
+      }, {
+        time: i.e,
+        type: "e"
+      }]),
+      flattened = Array.prototype.concat(...ends),
+      arr = flattened.sort((a, b) => a.time - b.time);
+    for (const i of arr) {
+      currentCount += i.type === "s" ? 1 : -1;
+      if (currentCount === 1) {
+        start = i.time;
+      } else {
+        if (start && +start !== +i.time) {
+          results.push(Interval.fromDateTimes(start, i.time));
+        }
+        start = null;
+      }
+    }
+    return Interval.merge(results);
+  }
+
+  /**
+   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+   * @param {...Interval} intervals
+   * @return {Array}
+   */
+  difference(...intervals) {
+    return Interval.xor([this].concat(intervals)).map(i => this.intersection(i)).filter(i => i && !i.isEmpty());
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for debugging.
+   * @return {string}
+   */
+  toString() {
+    if (!this.isValid) return INVALID$1;
+    return `[${this.s.toISO()} – ${this.e.toISO()})`;
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;
+    } else {
+      return `Interval { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns a localized string representing this Interval. Accepts the same options as the
+   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+   * is browser-specific, but in general it will return an appropriate representation of the
+   * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+   * specified.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+   * Intl.DateTimeFormat constructor options.
+   * @param {Object} opts - Options to override the configuration of the start DateTime.
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+   * @return {string}
+   */
+  toLocaleString(formatOpts = DATE_SHORT, opts = {}) {
+    return this.isValid ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this) : INVALID$1;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Interval.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISO(opts) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of date of this Interval.
+   * The time components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {string}
+   */
+  toISODate() {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISODate()}/${this.e.toISODate()}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of time of this Interval.
+   * The date components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISOTime(opts) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this Interval formatted according to the specified format
+   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+   * formatting tool.
+   * @param {string} dateFormat - The format string. This string formats the start and end time.
+   * See {@link DateTime#toFormat} for details.
+   * @param {Object} opts - Options.
+   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+   * representations.
+   * @return {string}
+   */
+  toFormat(dateFormat, {
+    separator = " – "
+  } = {}) {
+    if (!this.isValid) return INVALID$1;
+    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;
+  }
+
+  /**
+   * Return a Duration representing the time spanned by this interval.
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+   * @return {Duration}
+   */
+  toDuration(unit, opts) {
+    if (!this.isValid) {
+      return Duration.invalid(this.invalidReason);
+    }
+    return this.e.diff(this.s, unit, opts);
+  }
+
+  /**
+   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+   * @param {function} mapFn
+   * @return {Interval}
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+   */
+  mapEndpoints(mapFn) {
+    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+  }
+}
+
+/**
+ * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+ */
+class Info {
+  /**
+   * Return whether the specified zone contains a DST.
+   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+   * @return {boolean}
+   */
+  static hasDST(zone = Settings.defaultZone) {
+    const proto = DateTime.now().setZone(zone).set({
+      month: 12
+    });
+    return !zone.isUniversal && proto.offset !== proto.set({
+      month: 6
+    }).offset;
+  }
+
+  /**
+   * Return whether the specified zone is a valid IANA specifier.
+   * @param {string} zone - Zone to check
+   * @return {boolean}
+   */
+  static isValidIANAZone(zone) {
+    return IANAZone.isValidZone(zone);
+  }
+
+  /**
+   * Converts the input into a {@link Zone} instance.
+   *
+   * * If `input` is already a Zone instance, it is returned unchanged.
+   * * If `input` is a string containing a valid time zone name, a Zone instance
+   *   with that name is returned.
+   * * If `input` is a string that doesn't refer to a known time zone, a Zone
+   *   instance with {@link Zone#isValid} == false is returned.
+   * * If `input is a number, a Zone instance with the specified fixed offset
+   *   in minutes is returned.
+   * * If `input` is `null` or `undefined`, the default zone is returned.
+   * @param {string|Zone|number} [input] - the value to be converted
+   * @return {Zone}
+   */
+  static normalizeZone(input) {
+    return normalizeZone(input, Settings.defaultZone);
+  }
+
+  /**
+   * Get the weekday on which the week starts according to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+   */
+  static getStartOfWeek({
+    locale = null,
+    locObj = null
+  } = {}) {
+    return (locObj || Locale.create(locale)).getStartOfWeek();
+  }
+
+  /**
+   * Get the minimum number of days necessary in a week before it is considered part of the next year according
+   * to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number}
+   */
+  static getMinimumDaysInFirstWeek({
+    locale = null,
+    locObj = null
+  } = {}) {
+    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+  }
+
+  /**
+   * Get the weekdays, which are considered the weekend according to the given locale
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+   */
+  static getWeekendWeekdays({
+    locale = null,
+    locObj = null
+  } = {}) {
+    // copy the array, because we cache it internally
+    return (locObj || Locale.create(locale)).getWeekendDays().slice();
+  }
+
+  /**
+   * Return an array of standalone month names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @example Info.months()[0] //=> 'January'
+   * @example Info.months('short')[0] //=> 'Jan'
+   * @example Info.months('numeric')[0] //=> '1'
+   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+   * @return {Array}
+   */
+  static months(length = "long", {
+    locale = null,
+    numberingSystem = null,
+    locObj = null,
+    outputCalendar = "gregory"
+  } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+  }
+
+  /**
+   * Return an array of format month names.
+   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+   * changes the string.
+   * See {@link Info#months}
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @return {Array}
+   */
+  static monthsFormat(length = "long", {
+    locale = null,
+    numberingSystem = null,
+    locObj = null,
+    outputCalendar = "gregory"
+  } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+  }
+
+  /**
+   * Return an array of standalone week names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @example Info.weekdays()[0] //=> 'Monday'
+   * @example Info.weekdays('short')[0] //=> 'Mon'
+   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+   * @return {Array}
+   */
+  static weekdays(length = "long", {
+    locale = null,
+    numberingSystem = null,
+    locObj = null
+  } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+  }
+
+  /**
+   * Return an array of format week names.
+   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+   * changes the string.
+   * See {@link Info#weekdays}
+   * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale=null] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @return {Array}
+   */
+  static weekdaysFormat(length = "long", {
+    locale = null,
+    numberingSystem = null,
+    locObj = null
+  } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+  }
+
+  /**
+   * Return an array of meridiems.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+   * @return {Array}
+   */
+  static meridiems({
+    locale = null
+  } = {}) {
+    return Locale.create(locale).meridiems();
+  }
+
+  /**
+   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+   * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.eras() //=> [ 'BC', 'AD' ]
+   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+   * @return {Array}
+   */
+  static eras(length = "short", {
+    locale = null
+  } = {}) {
+    return Locale.create(locale, null, "gregory").eras(length);
+  }
+
+  /**
+   * Return the set of available features in this environment.
+   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+   * Keys:
+   * * `relative`: whether this environment supports relative time formatting
+   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+   * @example Info.features() //=> { relative: false, localeWeek: true }
+   * @return {Object}
+   */
+  static features() {
+    return {
+      relative: hasRelative(),
+      localeWeek: hasLocaleWeekInfo()
+    };
+  }
+}
+
+function dayDiff(earlier, later) {
+  const utcDayStart = dt => dt.toUTC(0, {
+      keepLocalTime: true
+    }).startOf("day").valueOf(),
+    ms = utcDayStart(later) - utcDayStart(earlier);
+  return Math.floor(Duration.fromMillis(ms).as("days"));
+}
+function highOrderDiffs(cursor, later, units) {
+  const differs = [["years", (a, b) => b.year - a.year], ["quarters", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4], ["months", (a, b) => b.month - a.month + (b.year - a.year) * 12], ["weeks", (a, b) => {
+    const days = dayDiff(a, b);
+    return (days - days % 7) / 7;
+  }], ["days", dayDiff]];
+  const results = {};
+  const earlier = cursor;
+  let lowestOrder, highWater;
+
+  /* This loop tries to diff using larger units first.
+     If we overshoot, we backtrack and try the next smaller unit.
+     "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+     as we use smaller and smaller units.
+     highWater keeps track of where we would be if we added one more of the smallest unit,
+     this is used later to potentially convert any difference smaller than the smallest higher order unit
+     into a fraction of that smallest higher order unit
+  */
+  for (const [unit, differ] of differs) {
+    if (units.indexOf(unit) >= 0) {
+      lowestOrder = unit;
+      results[unit] = differ(cursor, later);
+      highWater = earlier.plus(results);
+      if (highWater > later) {
+        // we overshot the end point, backtrack cursor by 1
+        results[unit]--;
+        cursor = earlier.plus(results);
+
+        // if we are still overshooting now, we need to backtrack again
+        // this happens in certain situations when diffing times in different zones,
+        // because this calculation ignores time zones
+        if (cursor > later) {
+          // keep the "overshot by 1" around as highWater
+          highWater = cursor;
+          // backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+        }
+      } else {
+        cursor = highWater;
+      }
+    }
+  }
+  return [cursor, results, highWater, lowestOrder];
+}
+function diff (earlier, later, units, opts) {
+  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);
+  const remainingMillis = later - cursor;
+  const lowerOrderUnits = units.filter(u => ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0);
+  if (lowerOrderUnits.length === 0) {
+    if (highWater < later) {
+      highWater = cursor.plus({
+        [lowestOrder]: 1
+      });
+    }
+    if (highWater !== cursor) {
+      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+    }
+  }
+  const duration = Duration.fromObject(results, opts);
+  if (lowerOrderUnits.length > 0) {
+    return Duration.fromMillis(remainingMillis, opts).shiftTo(...lowerOrderUnits).plus(duration);
+  } else {
+    return duration;
+  }
+}
+
+const MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+function intUnit(regex, post = i => i) {
+  return {
+    regex,
+    deser: ([s]) => post(parseDigits(s))
+  };
+}
+const NBSP = String.fromCharCode(160);
+const spaceOrNBSP = `[ ${NBSP}]`;
+const spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+function fixListRegex(s) {
+  // make dots optional and also make them literal
+  // make space and non breakable space characters interchangeable
+  return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+}
+function stripInsensitivities(s) {
+  return s.replace(/\./g, "") // ignore dots that were made optional
+  .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+  .toLowerCase();
+}
+function oneOf(strings, startIndex) {
+  if (strings === null) {
+    return null;
+  } else {
+    return {
+      regex: RegExp(strings.map(fixListRegex).join("|")),
+      deser: ([s]) => strings.findIndex(i => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex
+    };
+  }
+}
+function offset(regex, groups) {
+  return {
+    regex,
+    deser: ([, h, m]) => signedOffset(h, m),
+    groups
+  };
+}
+function simple(regex) {
+  return {
+    regex,
+    deser: ([s]) => s
+  };
+}
+function escapeToken(value) {
+  return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+}
+
+/**
+ * @param token
+ * @param {Locale} loc
+ */
+function unitForToken(token, loc) {
+  const one = digitRegex(loc),
+    two = digitRegex(loc, "{2}"),
+    three = digitRegex(loc, "{3}"),
+    four = digitRegex(loc, "{4}"),
+    six = digitRegex(loc, "{6}"),
+    oneOrTwo = digitRegex(loc, "{1,2}"),
+    oneToThree = digitRegex(loc, "{1,3}"),
+    oneToSix = digitRegex(loc, "{1,6}"),
+    oneToNine = digitRegex(loc, "{1,9}"),
+    twoToFour = digitRegex(loc, "{2,4}"),
+    fourToSix = digitRegex(loc, "{4,6}"),
+    literal = t => ({
+      regex: RegExp(escapeToken(t.val)),
+      deser: ([s]) => s,
+      literal: true
+    }),
+    unitate = t => {
+      if (token.literal) {
+        return literal(t);
+      }
+      switch (t.val) {
+        // era
+        case "G":
+          return oneOf(loc.eras("short"), 0);
+        case "GG":
+          return oneOf(loc.eras("long"), 0);
+        // years
+        case "y":
+          return intUnit(oneToSix);
+        case "yy":
+          return intUnit(twoToFour, untruncateYear);
+        case "yyyy":
+          return intUnit(four);
+        case "yyyyy":
+          return intUnit(fourToSix);
+        case "yyyyyy":
+          return intUnit(six);
+        // months
+        case "M":
+          return intUnit(oneOrTwo);
+        case "MM":
+          return intUnit(two);
+        case "MMM":
+          return oneOf(loc.months("short", true), 1);
+        case "MMMM":
+          return oneOf(loc.months("long", true), 1);
+        case "L":
+          return intUnit(oneOrTwo);
+        case "LL":
+          return intUnit(two);
+        case "LLL":
+          return oneOf(loc.months("short", false), 1);
+        case "LLLL":
+          return oneOf(loc.months("long", false), 1);
+        // dates
+        case "d":
+          return intUnit(oneOrTwo);
+        case "dd":
+          return intUnit(two);
+        // ordinals
+        case "o":
+          return intUnit(oneToThree);
+        case "ooo":
+          return intUnit(three);
+        // time
+        case "HH":
+          return intUnit(two);
+        case "H":
+          return intUnit(oneOrTwo);
+        case "hh":
+          return intUnit(two);
+        case "h":
+          return intUnit(oneOrTwo);
+        case "mm":
+          return intUnit(two);
+        case "m":
+          return intUnit(oneOrTwo);
+        case "q":
+          return intUnit(oneOrTwo);
+        case "qq":
+          return intUnit(two);
+        case "s":
+          return intUnit(oneOrTwo);
+        case "ss":
+          return intUnit(two);
+        case "S":
+          return intUnit(oneToThree);
+        case "SSS":
+          return intUnit(three);
+        case "u":
+          return simple(oneToNine);
+        case "uu":
+          return simple(oneOrTwo);
+        case "uuu":
+          return intUnit(one);
+        // meridiem
+        case "a":
+          return oneOf(loc.meridiems(), 0);
+        // weekYear (k)
+        case "kkkk":
+          return intUnit(four);
+        case "kk":
+          return intUnit(twoToFour, untruncateYear);
+        // weekNumber (W)
+        case "W":
+          return intUnit(oneOrTwo);
+        case "WW":
+          return intUnit(two);
+        // weekdays
+        case "E":
+        case "c":
+          return intUnit(one);
+        case "EEE":
+          return oneOf(loc.weekdays("short", false), 1);
+        case "EEEE":
+          return oneOf(loc.weekdays("long", false), 1);
+        case "ccc":
+          return oneOf(loc.weekdays("short", true), 1);
+        case "cccc":
+          return oneOf(loc.weekdays("long", true), 1);
+        // offset/zone
+        case "Z":
+        case "ZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);
+        case "ZZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);
+        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+        // because we don't have any way to figure out what they are
+        case "z":
+          return simple(/[a-z_+-/]{1,256}?/i);
+        // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+        // in this case we accept any non-newline white-space
+        case " ":
+          return simple(/[^\S\n\r]/);
+        default:
+          return literal(t);
+      }
+    };
+  const unit = unitate(token) || {
+    invalidReason: MISSING_FTP
+  };
+  unit.token = token;
+  return unit;
+}
+const partTypeStyleToTokenVal = {
+  year: {
+    "2-digit": "yy",
+    numeric: "yyyyy"
+  },
+  month: {
+    numeric: "M",
+    "2-digit": "MM",
+    short: "MMM",
+    long: "MMMM"
+  },
+  day: {
+    numeric: "d",
+    "2-digit": "dd"
+  },
+  weekday: {
+    short: "EEE",
+    long: "EEEE"
+  },
+  dayperiod: "a",
+  dayPeriod: "a",
+  hour12: {
+    numeric: "h",
+    "2-digit": "hh"
+  },
+  hour24: {
+    numeric: "H",
+    "2-digit": "HH"
+  },
+  minute: {
+    numeric: "m",
+    "2-digit": "mm"
+  },
+  second: {
+    numeric: "s",
+    "2-digit": "ss"
+  },
+  timeZoneName: {
+    long: "ZZZZZ",
+    short: "ZZZ"
+  }
+};
+function tokenForPart(part, formatOpts, resolvedOpts) {
+  const {
+    type,
+    value
+  } = part;
+  if (type === "literal") {
+    const isSpace = /^\s+$/.test(value);
+    return {
+      literal: !isSpace,
+      val: isSpace ? " " : value
+    };
+  }
+  const style = formatOpts[type];
+
+  // The user might have explicitly specified hour12 or hourCycle
+  // if so, respect their decision
+  // if not, refer back to the resolvedOpts, which are based on the locale
+  let actualType = type;
+  if (type === "hour") {
+    if (formatOpts.hour12 != null) {
+      actualType = formatOpts.hour12 ? "hour12" : "hour24";
+    } else if (formatOpts.hourCycle != null) {
+      if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+        actualType = "hour12";
+      } else {
+        actualType = "hour24";
+      }
+    } else {
+      // tokens only differentiate between 24 hours or not,
+      // so we do not need to check hourCycle here, which is less supported anyways
+      actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+    }
+  }
+  let val = partTypeStyleToTokenVal[actualType];
+  if (typeof val === "object") {
+    val = val[style];
+  }
+  if (val) {
+    return {
+      literal: false,
+      val
+    };
+  }
+  return undefined;
+}
+function buildRegex(units) {
+  const re = units.map(u => u.regex).reduce((f, r) => `${f}(${r.source})`, "");
+  return [`^${re}$`, units];
+}
+function match(input, regex, handlers) {
+  const matches = input.match(regex);
+  if (matches) {
+    const all = {};
+    let matchIndex = 1;
+    for (const i in handlers) {
+      if (hasOwnProperty(handlers, i)) {
+        const h = handlers[i],
+          groups = h.groups ? h.groups + 1 : 1;
+        if (!h.literal && h.token) {
+          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+        }
+        matchIndex += groups;
+      }
+    }
+    return [matches, all];
+  } else {
+    return [matches, {}];
+  }
+}
+function dateTimeFromMatches(matches) {
+  const toField = token => {
+    switch (token) {
+      case "S":
+        return "millisecond";
+      case "s":
+        return "second";
+      case "m":
+        return "minute";
+      case "h":
+      case "H":
+        return "hour";
+      case "d":
+        return "day";
+      case "o":
+        return "ordinal";
+      case "L":
+      case "M":
+        return "month";
+      case "y":
+        return "year";
+      case "E":
+      case "c":
+        return "weekday";
+      case "W":
+        return "weekNumber";
+      case "k":
+        return "weekYear";
+      case "q":
+        return "quarter";
+      default:
+        return null;
+    }
+  };
+  let zone = null;
+  let specificOffset;
+  if (!isUndefined(matches.z)) {
+    zone = IANAZone.create(matches.z);
+  }
+  if (!isUndefined(matches.Z)) {
+    if (!zone) {
+      zone = new FixedOffsetZone(matches.Z);
+    }
+    specificOffset = matches.Z;
+  }
+  if (!isUndefined(matches.q)) {
+    matches.M = (matches.q - 1) * 3 + 1;
+  }
+  if (!isUndefined(matches.h)) {
+    if (matches.h < 12 && matches.a === 1) {
+      matches.h += 12;
+    } else if (matches.h === 12 && matches.a === 0) {
+      matches.h = 0;
+    }
+  }
+  if (matches.G === 0 && matches.y) {
+    matches.y = -matches.y;
+  }
+  if (!isUndefined(matches.u)) {
+    matches.S = parseMillis(matches.u);
+  }
+  const vals = Object.keys(matches).reduce((r, k) => {
+    const f = toField(k);
+    if (f) {
+      r[f] = matches[k];
+    }
+    return r;
+  }, {});
+  return [vals, zone, specificOffset];
+}
+let dummyDateTimeCache = null;
+function getDummyDateTime() {
+  if (!dummyDateTimeCache) {
+    dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+  }
+  return dummyDateTimeCache;
+}
+function maybeExpandMacroToken(token, locale) {
+  if (token.literal) {
+    return token;
+  }
+  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+  const tokens = formatOptsToTokens(formatOpts, locale);
+  if (tokens == null || tokens.includes(undefined)) {
+    return token;
+  }
+  return tokens;
+}
+function expandMacroTokens(tokens, locale) {
+  return Array.prototype.concat(...tokens.map(t => maybeExpandMacroToken(t, locale)));
+}
+
+/**
+ * @private
+ */
+
+class TokenParser {
+  constructor(locale, format) {
+    this.locale = locale;
+    this.format = format;
+    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+    this.units = this.tokens.map(t => unitForToken(t, locale));
+    this.disqualifyingUnit = this.units.find(t => t.invalidReason);
+    if (!this.disqualifyingUnit) {
+      const [regexString, handlers] = buildRegex(this.units);
+      this.regex = RegExp(regexString, "i");
+      this.handlers = handlers;
+    }
+  }
+  explainFromTokens(input) {
+    if (!this.isValid) {
+      return {
+        input,
+        tokens: this.tokens,
+        invalidReason: this.invalidReason
+      };
+    } else {
+      const [rawMatches, matches] = match(input, this.regex, this.handlers),
+        [result, zone, specificOffset] = matches ? dateTimeFromMatches(matches) : [null, null, undefined];
+      if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+        throw new ConflictingSpecificationError("Can't include meridiem when specifying 24-hour format");
+      }
+      return {
+        input,
+        tokens: this.tokens,
+        regex: this.regex,
+        rawMatches,
+        matches,
+        result,
+        zone,
+        specificOffset
+      };
+    }
+  }
+  get isValid() {
+    return !this.disqualifyingUnit;
+  }
+  get invalidReason() {
+    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+  }
+}
+function explainFromTokens(locale, input, format) {
+  const parser = new TokenParser(locale, format);
+  return parser.explainFromTokens(input);
+}
+function parseFromTokens(locale, input, format) {
+  const {
+    result,
+    zone,
+    specificOffset,
+    invalidReason
+  } = explainFromTokens(locale, input, format);
+  return [result, zone, specificOffset, invalidReason];
+}
+function formatOptsToTokens(formatOpts, locale) {
+  if (!formatOpts) {
+    return null;
+  }
+  const formatter = Formatter.create(locale, formatOpts);
+  const df = formatter.dtFormatter(getDummyDateTime());
+  const parts = df.formatToParts();
+  const resolvedOpts = df.resolvedOptions();
+  return parts.map(p => tokenForPart(p, formatOpts, resolvedOpts));
+}
+
+const INVALID = "Invalid DateTime";
+const MAX_DATE = 8.64e15;
+function unsupportedZone(zone) {
+  return new Invalid("unsupported zone", `the zone "${zone.name}" is not supported`);
+}
+
+// we cache week data on the DT object and this intermediates the cache
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedWeekData(dt) {
+  if (dt.weekData === null) {
+    dt.weekData = gregorianToWeek(dt.c);
+  }
+  return dt.weekData;
+}
+
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedLocalWeekData(dt) {
+  if (dt.localWeekData === null) {
+    dt.localWeekData = gregorianToWeek(dt.c, dt.loc.getMinDaysInFirstWeek(), dt.loc.getStartOfWeek());
+  }
+  return dt.localWeekData;
+}
+
+// clone really means, "make a new object with these modifications". all "setters" really use this
+// to create a new object while only changing some of the properties
+function clone(inst, alts) {
+  const current = {
+    ts: inst.ts,
+    zone: inst.zone,
+    c: inst.c,
+    o: inst.o,
+    loc: inst.loc,
+    invalid: inst.invalid
+  };
+  return new DateTime({
+    ...current,
+    ...alts,
+    old: current
+  });
+}
+
+// find the right offset a given local time. The o input is our guess, which determines which
+// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+function fixOffset(localTS, o, tz) {
+  // Our UTC time is just a guess because our offset is just a guess
+  let utcGuess = localTS - o * 60 * 1000;
+
+  // Test whether the zone matches the offset for this ts
+  const o2 = tz.offset(utcGuess);
+
+  // If so, offset didn't change and we're done
+  if (o === o2) {
+    return [utcGuess, o];
+  }
+
+  // If not, change the ts by the difference in the offset
+  utcGuess -= (o2 - o) * 60 * 1000;
+
+  // If that gives us the local time we want, we're done
+  const o3 = tz.offset(utcGuess);
+  if (o2 === o3) {
+    return [utcGuess, o2];
+  }
+
+  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+}
+
+// convert an epoch timestamp into a calendar object with the given offset
+function tsToObj(ts, offset) {
+  ts += offset * 60 * 1000;
+  const d = new Date(ts);
+  return {
+    year: d.getUTCFullYear(),
+    month: d.getUTCMonth() + 1,
+    day: d.getUTCDate(),
+    hour: d.getUTCHours(),
+    minute: d.getUTCMinutes(),
+    second: d.getUTCSeconds(),
+    millisecond: d.getUTCMilliseconds()
+  };
+}
+
+// convert a calendar object to a epoch timestamp
+function objToTS(obj, offset, zone) {
+  return fixOffset(objToLocalTS(obj), offset, zone);
+}
+
+// create a new DT instance by adding a duration, adjusting for DSTs
+function adjustTime(inst, dur) {
+  const oPre = inst.o,
+    year = inst.c.year + Math.trunc(dur.years),
+    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+    c = {
+      ...inst.c,
+      year,
+      month,
+      day: Math.min(inst.c.day, daysInMonth(year, month)) + Math.trunc(dur.days) + Math.trunc(dur.weeks) * 7
+    },
+    millisToAdd = Duration.fromObject({
+      years: dur.years - Math.trunc(dur.years),
+      quarters: dur.quarters - Math.trunc(dur.quarters),
+      months: dur.months - Math.trunc(dur.months),
+      weeks: dur.weeks - Math.trunc(dur.weeks),
+      days: dur.days - Math.trunc(dur.days),
+      hours: dur.hours,
+      minutes: dur.minutes,
+      seconds: dur.seconds,
+      milliseconds: dur.milliseconds
+    }).as("milliseconds"),
+    localTS = objToLocalTS(c);
+  let [ts, o] = fixOffset(localTS, oPre, inst.zone);
+  if (millisToAdd !== 0) {
+    ts += millisToAdd;
+    // that could have changed the offset by going over a DST, but we want to keep the ts the same
+    o = inst.zone.offset(ts);
+  }
+  return {
+    ts,
+    o
+  };
+}
+
+// helper useful in turning the results of parsing into real dates
+// by handling the zone options
+function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+  const {
+    setZone,
+    zone
+  } = opts;
+  if (parsed && Object.keys(parsed).length !== 0 || parsedZone) {
+    const interpretationZone = parsedZone || zone,
+      inst = DateTime.fromObject(parsed, {
+        ...opts,
+        zone: interpretationZone,
+        specificOffset
+      });
+    return setZone ? inst : inst.setZone(zone);
+  } else {
+    return DateTime.invalid(new Invalid("unparsable", `the input "${text}" can't be parsed as ${format}`));
+  }
+}
+
+// if you want to output a technical format (e.g. RFC 2822), this helper
+// helps handle the details
+function toTechFormat(dt, format, allowZ = true) {
+  return dt.isValid ? Formatter.create(Locale.create("en-US"), {
+    allowZ,
+    forceSimple: true
+  }).formatDateTimeFromString(dt, format) : null;
+}
+function toISODate(o, extended, precision) {
+  const longFormat = o.c.year > 9999 || o.c.year < 0;
+  let c = "";
+  if (longFormat && o.c.year >= 0) c += "+";
+  c += padStart(o.c.year, longFormat ? 6 : 4);
+  if (precision === "year") return c;
+  if (extended) {
+    c += "-";
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+    c += "-";
+  } else {
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+  }
+  c += padStart(o.c.day);
+  return c;
+}
+function toISOTime(o, extended, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision) {
+  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+    c = "";
+  switch (precision) {
+    case "day":
+    case "month":
+    case "year":
+      break;
+    default:
+      c += padStart(o.c.hour);
+      if (precision === "hour") break;
+      if (extended) {
+        c += ":";
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += ":";
+          c += padStart(o.c.second);
+        }
+      } else {
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += padStart(o.c.second);
+        }
+      }
+      if (precision === "second") break;
+      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+        c += ".";
+        c += padStart(o.c.millisecond, 3);
+      }
+  }
+  if (includeOffset) {
+    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+      c += "Z";
+    } else if (o.o < 0) {
+      c += "-";
+      c += padStart(Math.trunc(-o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(-o.o % 60));
+    } else {
+      c += "+";
+      c += padStart(Math.trunc(o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(o.o % 60));
+    }
+  }
+  if (extendedZone) {
+    c += "[" + o.zone.ianaName + "]";
+  }
+  return c;
+}
+
+// defaults for unspecified units in the supported calendars
+const defaultUnitValues = {
+    month: 1,
+    day: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  },
+  defaultWeekUnitValues = {
+    weekNumber: 1,
+    weekday: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  },
+  defaultOrdinalUnitValues = {
+    ordinal: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0
+  };
+
+// Units in the supported calendars, sorted by bigness
+const orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+  orderedWeekUnits = ["weekYear", "weekNumber", "weekday", "hour", "minute", "second", "millisecond"],
+  orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+// standardize case and plurality in units
+function normalizeUnit(unit) {
+  const normalized = {
+    year: "year",
+    years: "year",
+    month: "month",
+    months: "month",
+    day: "day",
+    days: "day",
+    hour: "hour",
+    hours: "hour",
+    minute: "minute",
+    minutes: "minute",
+    quarter: "quarter",
+    quarters: "quarter",
+    second: "second",
+    seconds: "second",
+    millisecond: "millisecond",
+    milliseconds: "millisecond",
+    weekday: "weekday",
+    weekdays: "weekday",
+    weeknumber: "weekNumber",
+    weeksnumber: "weekNumber",
+    weeknumbers: "weekNumber",
+    weekyear: "weekYear",
+    weekyears: "weekYear",
+    ordinal: "ordinal"
+  }[unit.toLowerCase()];
+  if (!normalized) throw new InvalidUnitError(unit);
+  return normalized;
+}
+function normalizeUnitWithLocalWeeks(unit) {
+  switch (unit.toLowerCase()) {
+    case "localweekday":
+    case "localweekdays":
+      return "localWeekday";
+    case "localweeknumber":
+    case "localweeknumbers":
+      return "localWeekNumber";
+    case "localweekyear":
+    case "localweekyears":
+      return "localWeekYear";
+    default:
+      return normalizeUnit(unit);
+  }
+}
+
+// cache offsets for zones based on the current timestamp when this function is
+// first called. When we are handling a datetime from components like (year,
+// month, day, hour) in a time zone, we need a guess about what the timezone
+// offset is so that we can convert into a UTC timestamp. One way is to find the
+// offset of now in the zone. The actual date may have a different offset (for
+// example, if we handle a date in June while we're in December in a zone that
+// observes DST), but we can check and adjust that.
+//
+// When handling many dates, calculating the offset for now every time is
+// expensive. It's just a guess, so we can cache the offset to use even if we
+// are right on a time change boundary (we'll just correct in the other
+// direction). Using a timestamp from first read is a slight optimization for
+// handling dates close to the current date, since those dates will usually be
+// in the same offset (we could set the timestamp statically, instead). We use a
+// single timestamp for all zones to make things a bit more predictable.
+//
+// This is safe for quickDT (used by local() and utc()) because we don't fill in
+// higher-order units from tsNow (as we do in fromObject, this requires that
+// offset is calculated from tsNow).
+/**
+ * @param {Zone} zone
+ * @return {number}
+ */
+function guessOffsetForZone(zone) {
+  if (zoneOffsetTs === undefined) {
+    zoneOffsetTs = Settings.now();
+  }
+
+  // Do not cache anything but IANA zones, because it is not safe to do so.
+  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+  if (zone.type !== "iana") {
+    return zone.offset(zoneOffsetTs);
+  }
+  const zoneName = zone.name;
+  let offsetGuess = zoneOffsetGuessCache.get(zoneName);
+  if (offsetGuess === undefined) {
+    offsetGuess = zone.offset(zoneOffsetTs);
+    zoneOffsetGuessCache.set(zoneName, offsetGuess);
+  }
+  return offsetGuess;
+}
+
+// this is a dumbed down version of fromObject() that runs about 60% faster
+// but doesn't do any validation, makes a bunch of assumptions about what units
+// are present, and so on.
+function quickDT(obj, opts) {
+  const zone = normalizeZone(opts.zone, Settings.defaultZone);
+  if (!zone.isValid) {
+    return DateTime.invalid(unsupportedZone(zone));
+  }
+  const loc = Locale.fromObject(opts);
+  let ts, o;
+
+  // assume we have the higher-order units
+  if (!isUndefined(obj.year)) {
+    for (const u of orderedUnits) {
+      if (isUndefined(obj[u])) {
+        obj[u] = defaultUnitValues[u];
+      }
+    }
+    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+    const offsetProvis = guessOffsetForZone(zone);
+    [ts, o] = objToTS(obj, offsetProvis, zone);
+  } else {
+    ts = Settings.now();
+  }
+  return new DateTime({
+    ts,
+    zone,
+    loc,
+    o
+  });
+}
+function diffRelative(start, end, opts) {
+  const round = isUndefined(opts.round) ? true : opts.round,
+    rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+    format = (c, unit) => {
+      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+      const formatter = end.loc.clone(opts).relFormatter(opts);
+      return formatter.format(c, unit);
+    },
+    differ = unit => {
+      if (opts.calendary) {
+        if (!end.hasSame(start, unit)) {
+          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+        } else return 0;
+      } else {
+        return end.diff(start, unit).get(unit);
+      }
+    };
+  if (opts.unit) {
+    return format(differ(opts.unit), opts.unit);
+  }
+  for (const unit of opts.units) {
+    const count = differ(unit);
+    if (Math.abs(count) >= 1) {
+      return format(count, unit);
+    }
+  }
+  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+}
+function lastOpts(argList) {
+  let opts = {},
+    args;
+  if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+    opts = argList[argList.length - 1];
+    args = Array.from(argList).slice(0, argList.length - 1);
+  } else {
+    args = Array.from(argList);
+  }
+  return [opts, args];
+}
+
+/**
+ * Timestamp to use for cached zone offset guesses (exposed for test)
+ */
+let zoneOffsetTs;
+/**
+ * Cache for zone offset guesses (exposed for test).
+ *
+ * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+ * zone.offset().
+ */
+const zoneOffsetGuessCache = new Map();
+
+/**
+ * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+ *
+ * A DateTime comprises of:
+ * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+ * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+ * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+ *
+ * Here is a brief overview of the most commonly used functionality it provides:
+ *
+ * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+ * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+ * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+ * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+ * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+ * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+ * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+ *
+ * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+ */
+class DateTime {
+  /**
+   * @access private
+   */
+  constructor(config) {
+    const zone = config.zone || Settings.defaultZone;
+    let invalid = config.invalid || (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) || (!zone.isValid ? unsupportedZone(zone) : null);
+    /**
+     * @access private
+     */
+    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+    let c = null,
+      o = null;
+    if (!invalid) {
+      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+      if (unchanged) {
+        [c, o] = [config.old.c, config.old.o];
+      } else {
+        // If an offset has been passed and we have not been called from
+        // clone(), we can trust it and avoid the offset calculation.
+        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+        c = tsToObj(this.ts, ot);
+        invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+        c = invalid ? null : c;
+        o = invalid ? null : ot;
+      }
+    }
+
+    /**
+     * @access private
+     */
+    this._zone = zone;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.invalid = invalid;
+    /**
+     * @access private
+     */
+    this.weekData = null;
+    /**
+     * @access private
+     */
+    this.localWeekData = null;
+    /**
+     * @access private
+     */
+    this.c = c;
+    /**
+     * @access private
+     */
+    this.o = o;
+    /**
+     * @access private
+     */
+    this.isLuxonDateTime = true;
+  }
+
+  // CONSTRUCT
+
+  /**
+   * Create a DateTime for the current instant, in the system's time zone.
+   *
+   * Use Settings to override these default values if needed.
+   * @example DateTime.now().toISO() //~> now in the ISO format
+   * @return {DateTime}
+   */
+  static now() {
+    return new DateTime({});
+  }
+
+  /**
+   * Create a local DateTime
+   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month, 1-indexed
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @example DateTime.local()                                  //~> now
+   * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+   * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+   * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+   * @return {DateTime}
+   */
+  static local() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+    return quickDT({
+      year,
+      month,
+      day,
+      hour,
+      minute,
+      second,
+      millisecond
+    }, opts);
+  }
+
+  /**
+   * Create a DateTime in UTC
+   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.utc()                                              //~> now
+   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+   * @return {DateTime}
+   */
+  static utc() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+    opts.zone = FixedOffsetZone.utcInstance;
+    return quickDT({
+      year,
+      month,
+      day,
+      hour,
+      minute,
+      second,
+      millisecond
+    }, opts);
+  }
+
+  /**
+   * Create a DateTime from a JavaScript Date object. Uses the default zone.
+   * @param {Date} date - a JavaScript Date object
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @return {DateTime}
+   */
+  static fromJSDate(date, options = {}) {
+    const ts = isDate(date) ? date.valueOf() : NaN;
+    if (Number.isNaN(ts)) {
+      return DateTime.invalid("invalid input");
+    }
+    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+    return new DateTime({
+      ts: ts,
+      zone: zoneToUse,
+      loc: Locale.fromObject(options)
+    });
+  }
+
+  /**
+   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromMillis(milliseconds, options = {}) {
+    if (!isNumber(milliseconds)) {
+      throw new InvalidArgumentError(`fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`);
+    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+      return DateTime.invalid("Timestamp out of range");
+    } else {
+      return new DateTime({
+        ts: milliseconds,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options)
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} seconds - a number of seconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromSeconds(seconds, options = {}) {
+    if (!isNumber(seconds)) {
+      throw new InvalidArgumentError("fromSeconds requires a numerical input");
+    } else {
+      return new DateTime({
+        ts: seconds * 1000,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options)
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.year - a year, such as 1987
+   * @param {number} obj.month - a month, 1-12
+   * @param {number} obj.day - a day of the month, 1-31, depending on the month
+   * @param {number} obj.ordinal - day of the year, 1-365 or 366
+   * @param {number} obj.weekYear - an ISO week year
+   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+   * @param {number} obj.localWeekYear - a week year, according to the locale
+   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+   * @param {number} obj.hour - hour of the day, 0-23
+   * @param {number} obj.minute - minute of the hour, 0-59
+   * @param {number} obj.second - second of the minute, 0-59
+   * @param {number} obj.millisecond - millisecond of the second, 0-999
+   * @param {Object} opts - options for creating this DateTime
+   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+   * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+   * @return {DateTime}
+   */
+  static fromObject(obj, opts = {}) {
+    obj = obj || {};
+    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+    const loc = Locale.fromObject(opts);
+    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+    const {
+      minDaysInFirstWeek,
+      startOfWeek
+    } = usesLocalWeekValues(normalized, loc);
+    const tsNow = Settings.now(),
+      offsetProvis = !isUndefined(opts.specificOffset) ? opts.specificOffset : zoneToUse.offset(tsNow),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    // cases:
+    // just a weekday -> this week's instance of that weekday, no worries
+    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+    // (gregorian month or day) + ordinal -> error
+    // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+    }
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+    const useWeekData = definiteWeekDef || normalized.weekday && !containsGregor;
+
+    // configure ourselves to deal with gregorian dates or week stuff
+    let units,
+      defaultValues,
+      objNow = tsToObj(tsNow, offsetProvis);
+    if (useWeekData) {
+      units = orderedWeekUnits;
+      defaultValues = defaultWeekUnitValues;
+      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+    } else if (containsOrdinal) {
+      units = orderedOrdinalUnits;
+      defaultValues = defaultOrdinalUnitValues;
+      objNow = gregorianToOrdinal(objNow);
+    } else {
+      units = orderedUnits;
+      defaultValues = defaultUnitValues;
+    }
+
+    // set default values for missing stuff
+    let foundFirst = false;
+    for (const u of units) {
+      const v = normalized[u];
+      if (!isUndefined(v)) {
+        foundFirst = true;
+      } else if (foundFirst) {
+        normalized[u] = defaultValues[u];
+      } else {
+        normalized[u] = objNow[u];
+      }
+    }
+
+    // make sure the values we have are in range
+    const higherOrderInvalid = useWeekData ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? hasInvalidOrdinalData(normalized) : hasInvalidGregorianData(normalized),
+      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    // compute the actual time
+    const gregorian = useWeekData ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek) : containsOrdinal ? ordinalToGregorian(normalized) : normalized,
+      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),
+      inst = new DateTime({
+        ts: tsFinal,
+        zone: zoneToUse,
+        o: offsetFinal,
+        loc
+      });
+
+    // gregorian data + weekday serves only to validate
+    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+      return DateTime.invalid("mismatched weekday", `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`);
+    }
+    if (!inst.isValid) {
+      return DateTime.invalid(inst.invalid);
+    }
+    return inst;
+  }
+
+  /**
+   * Create a DateTime from an ISO 8601 string
+   * @param {string} text - the ISO string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+   * @example DateTime.fromISO('2016-W05-4')
+   * @return {DateTime}
+   */
+  static fromISO(text, opts = {}) {
+    const [vals, parsedZone] = parseISODate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+  }
+
+  /**
+   * Create a DateTime from an RFC 2822 string
+   * @param {string} text - the RFC 2822 string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+   * @return {DateTime}
+   */
+  static fromRFC2822(text, opts = {}) {
+    const [vals, parsedZone] = parseRFC2822Date(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+  }
+
+  /**
+   * Create a DateTime from an HTTP header date
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @param {string} text - the HTTP header date
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+   * @return {DateTime}
+   */
+  static fromHTTP(text, opts = {}) {
+    const [vals, parsedZone] = parseHTTPDate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+  }
+
+  /**
+   * Create a DateTime from an input string and format string.
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromFormat(text, fmt, opts = {}) {
+    if (isUndefined(text) || isUndefined(fmt)) {
+      throw new InvalidArgumentError("fromFormat requires an input string and a format");
+    }
+    const {
+        locale = null,
+        numberingSystem = null
+      } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true
+      }),
+      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    } else {
+      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);
+    }
+  }
+
+  /**
+   * @deprecated use fromFormat instead
+   */
+  static fromString(text, fmt, opts = {}) {
+    return DateTime.fromFormat(text, fmt, opts);
+  }
+
+  /**
+   * Create a DateTime from a SQL date, time, or datetime
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale
+   * @param {string} text - the string to parse
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @example DateTime.fromSQL('2017-05-15')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+   * @example DateTime.fromSQL('09:12:34.342')
+   * @return {DateTime}
+   */
+  static fromSQL(text, opts = {}) {
+    const [vals, parsedZone] = parseSQL(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+  }
+
+  /**
+   * Create an invalid DateTime.
+   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {DateTime}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+    }
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDateTimeError(invalid);
+    } else {
+      return new DateTime({
+        invalid
+      });
+    }
+  }
+
+  /**
+   * Check if an object is an instance of DateTime. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDateTime(o) {
+    return o && o.isLuxonDateTime || false;
+  }
+
+  /**
+   * Produce the format string for a set of options
+   * @param formatOpts
+   * @param localeOpts
+   * @returns {string}
+   */
+  static parseFormatForOpts(formatOpts, localeOpts = {}) {
+    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+    return !tokenList ? null : tokenList.map(t => t ? t.val : null).join("");
+  }
+
+  /**
+   * Produce the the fully expanded format token for the locale
+   * Does NOT quote characters, so quoted tokens will not round trip correctly
+   * @param fmt
+   * @param localeOpts
+   * @returns {string}
+   */
+  static expandFormat(fmt, localeOpts = {}) {
+    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+    return expanded.map(t => t.val).join("");
+  }
+  static resetCache() {
+    zoneOffsetTs = undefined;
+    zoneOffsetGuessCache.clear();
+  }
+
+  // INFO
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+   * @return {number}
+   */
+  get(unit) {
+    return this[unit];
+  }
+
+  /**
+   * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+   * * The DateTime was created by an operation on another invalid date
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get outputCalendar() {
+    return this.isValid ? this.loc.outputCalendar : null;
+  }
+
+  /**
+   * Get the time zone associated with this DateTime.
+   * @type {Zone}
+   */
+  get zone() {
+    return this._zone;
+  }
+
+  /**
+   * Get the name of the time zone.
+   * @type {string}
+   */
+  get zoneName() {
+    return this.isValid ? this.zone.name : null;
+  }
+
+  /**
+   * Get the year
+   * @example DateTime.local(2017, 5, 25).year //=> 2017
+   * @type {number}
+   */
+  get year() {
+    return this.isValid ? this.c.year : NaN;
+  }
+
+  /**
+   * Get the quarter
+   * @example DateTime.local(2017, 5, 25).quarter //=> 2
+   * @type {number}
+   */
+  get quarter() {
+    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+  }
+
+  /**
+   * Get the month (1-12).
+   * @example DateTime.local(2017, 5, 25).month //=> 5
+   * @type {number}
+   */
+  get month() {
+    return this.isValid ? this.c.month : NaN;
+  }
+
+  /**
+   * Get the day of the month (1-30ish).
+   * @example DateTime.local(2017, 5, 25).day //=> 25
+   * @type {number}
+   */
+  get day() {
+    return this.isValid ? this.c.day : NaN;
+  }
+
+  /**
+   * Get the hour of the day (0-23).
+   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+   * @type {number}
+   */
+  get hour() {
+    return this.isValid ? this.c.hour : NaN;
+  }
+
+  /**
+   * Get the minute of the hour (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+   * @type {number}
+   */
+  get minute() {
+    return this.isValid ? this.c.minute : NaN;
+  }
+
+  /**
+   * Get the second of the minute (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+   * @type {number}
+   */
+  get second() {
+    return this.isValid ? this.c.second : NaN;
+  }
+
+  /**
+   * Get the millisecond of the second (0-999).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+   * @type {number}
+   */
+  get millisecond() {
+    return this.isValid ? this.c.millisecond : NaN;
+  }
+
+  /**
+   * Get the week year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+   * @type {number}
+   */
+  get weekYear() {
+    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the week number of the week year (1-52ish).
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+   * @type {number}
+   */
+  get weekNumber() {
+    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the day of the week.
+   * 1 is Monday and 7 is Sunday
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 11, 31).weekday //=> 4
+   * @type {number}
+   */
+  get weekday() {
+    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Returns true if this date is on a weekend according to the locale, false otherwise
+   * @returns {boolean}
+   */
+  get isWeekend() {
+    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+  }
+
+  /**
+   * Get the day of the week according to the locale.
+   * 1 is the first day of the week and 7 is the last day of the week.
+   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+   * @returns {number}
+   */
+  get localWeekday() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+   * because the week can start on different days of the week (see localWeekday) and because a different number of days
+   * is required for a week to count as the first week of a year.
+   * @returns {number}
+   */
+  get localWeekNumber() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+   * differently, see localWeekNumber.
+   * @returns {number}
+   */
+  get localWeekYear() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the ordinal (meaning the day of the year)
+   * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+   * @type {number|DateTime}
+   */
+  get ordinal() {
+    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+  }
+
+  /**
+   * Get the human readable short month name, such as 'Oct'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+   * @type {string}
+   */
+  get monthShort() {
+    return this.isValid ? Info.months("short", {
+      locObj: this.loc
+    })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable long month name, such as 'October'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthLong //=> October
+   * @type {string}
+   */
+  get monthLong() {
+    return this.isValid ? Info.months("long", {
+      locObj: this.loc
+    })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable short weekday, such as 'Mon'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+   * @type {string}
+   */
+  get weekdayShort() {
+    return this.isValid ? Info.weekdays("short", {
+      locObj: this.loc
+    })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the human readable long weekday, such as 'Monday'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+   * @type {string}
+   */
+  get weekdayLong() {
+    return this.isValid ? Info.weekdays("long", {
+      locObj: this.loc
+    })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the UTC offset of this DateTime in minutes
+   * @example DateTime.now().offset //=> -240
+   * @example DateTime.utc().offset //=> 0
+   * @type {number}
+   */
+  get offset() {
+    return this.isValid ? +this.o : NaN;
+  }
+
+  /**
+   * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameShort() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "short",
+        locale: this.locale
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameLong() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "long",
+        locale: this.locale
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get whether this zone's offset ever changes, as in a DST.
+   * @type {boolean}
+   */
+  get isOffsetFixed() {
+    return this.isValid ? this.zone.isUniversal : null;
+  }
+
+  /**
+   * Get whether the DateTime is in a DST.
+   * @type {boolean}
+   */
+  get isInDST() {
+    if (this.isOffsetFixed) {
+      return false;
+    } else {
+      return this.offset > this.set({
+        month: 1,
+        day: 1
+      }).offset || this.offset > this.set({
+        month: 5
+      }).offset;
+    }
+  }
+
+  /**
+   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+   * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+   * @returns {DateTime[]}
+   */
+  getPossibleOffsets() {
+    if (!this.isValid || this.isOffsetFixed) {
+      return [this];
+    }
+    const dayMs = 86400000;
+    const minuteMs = 60000;
+    const localTS = objToLocalTS(this.c);
+    const oEarlier = this.zone.offset(localTS - dayMs);
+    const oLater = this.zone.offset(localTS + dayMs);
+    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+    const o2 = this.zone.offset(localTS - oLater * minuteMs);
+    if (o1 === o2) {
+      return [this];
+    }
+    const ts1 = localTS - o1 * minuteMs;
+    const ts2 = localTS - o2 * minuteMs;
+    const c1 = tsToObj(ts1, o1);
+    const c2 = tsToObj(ts2, o2);
+    if (c1.hour === c2.hour && c1.minute === c2.minute && c1.second === c2.second && c1.millisecond === c2.millisecond) {
+      return [clone(this, {
+        ts: ts1
+      }), clone(this, {
+        ts: ts2
+      })];
+    }
+    return [this];
+  }
+
+  /**
+   * Returns true if this DateTime is in a leap year, false otherwise
+   * @example DateTime.local(2016).isInLeapYear //=> true
+   * @example DateTime.local(2013).isInLeapYear //=> false
+   * @type {boolean}
+   */
+  get isInLeapYear() {
+    return isLeapYear(this.year);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's month
+   * @example DateTime.local(2016, 2).daysInMonth //=> 29
+   * @example DateTime.local(2016, 3).daysInMonth //=> 31
+   * @type {number}
+   */
+  get daysInMonth() {
+    return daysInMonth(this.year, this.month);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's year
+   * @example DateTime.local(2016).daysInYear //=> 366
+   * @example DateTime.local(2013).daysInYear //=> 365
+   * @type {number}
+   */
+  get daysInYear() {
+    return this.isValid ? daysInYear(this.year) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2004).weeksInWeekYear //=> 53
+   * @example DateTime.local(2013).weeksInWeekYear //=> 52
+   * @type {number}
+   */
+  get weeksInWeekYear() {
+    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's local week year
+   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+   * @type {number}
+   */
+  get weeksInLocalWeekYear() {
+    return this.isValid ? weeksInWeekYear(this.localWeekYear, this.loc.getMinDaysInFirstWeek(), this.loc.getStartOfWeek()) : NaN;
+  }
+
+  /**
+   * Returns the resolved Intl options for this DateTime.
+   * This is useful in understanding the behavior of formatting methods
+   * @param {Object} opts - the same options as toLocaleString
+   * @return {Object}
+   */
+  resolvedLocaleOptions(opts = {}) {
+    const {
+      locale,
+      numberingSystem,
+      calendar
+    } = Formatter.create(this.loc.clone(opts), opts).resolvedOptions(this);
+    return {
+      locale,
+      numberingSystem,
+      outputCalendar: calendar
+    };
+  }
+
+  // TRANSFORM
+
+  /**
+   * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to {@link DateTime#setZone}('utc')
+   * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+   * @param {Object} [opts={}] - options to pass to `setZone()`
+   * @return {DateTime}
+   */
+  toUTC(offset = 0, opts = {}) {
+    return this.setZone(FixedOffsetZone.instance(offset), opts);
+  }
+
+  /**
+   * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to `setZone('local')`
+   * @return {DateTime}
+   */
+  toLocal() {
+    return this.setZone(Settings.defaultZone);
+  }
+
+  /**
+   * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+   *
+   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+   * @return {DateTime}
+   */
+  setZone(zone, {
+    keepLocalTime = false,
+    keepCalendarTime = false
+  } = {}) {
+    zone = normalizeZone(zone, Settings.defaultZone);
+    if (zone.equals(this.zone)) {
+      return this;
+    } else if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    } else {
+      let newTS = this.ts;
+      if (keepLocalTime || keepCalendarTime) {
+        const offsetGuess = zone.offset(this.ts);
+        const asObj = this.toObject();
+        [newTS] = objToTS(asObj, offsetGuess, zone);
+      }
+      return clone(this, {
+        ts: newTS,
+        zone
+      });
+    }
+  }
+
+  /**
+   * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+   * @param {Object} properties - the properties to set
+   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+   * @return {DateTime}
+   */
+  reconfigure({
+    locale,
+    numberingSystem,
+    outputCalendar
+  } = {}) {
+    const loc = this.loc.clone({
+      locale,
+      numberingSystem,
+      outputCalendar
+    });
+    return clone(this, {
+      loc
+    });
+  }
+
+  /**
+   * "Set" the locale. Returns a newly-constructed DateTime.
+   * Just a convenient alias for reconfigure({ locale })
+   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+   * @return {DateTime}
+   */
+  setLocale(locale) {
+    return this.reconfigure({
+      locale
+    });
+  }
+
+  /**
+   * "Set" the values of specified units. Returns a newly-constructed DateTime.
+   * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+   *
+   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+   * They cannot be mixed with ISO-week units like `weekday`.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dt.set({ year: 2017 })
+   * @example dt.set({ hour: 8, minute: 30 })
+   * @example dt.set({ weekday: 5 })
+   * @example dt.set({ year: 2005, ordinal: 234 })
+   * @return {DateTime}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+    const {
+      minDaysInFirstWeek,
+      startOfWeek
+    } = usesLocalWeekValues(normalized, this.loc);
+    const settingWeekStuff = !isUndefined(normalized.weekYear) || !isUndefined(normalized.weekNumber) || !isUndefined(normalized.weekday),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError("Can't mix weekYear/weekNumber units with year/month/day or ordinals");
+    }
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+    let mixed;
+    if (settingWeekStuff) {
+      mixed = weekToGregorian({
+        ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek),
+        ...normalized
+      }, minDaysInFirstWeek, startOfWeek);
+    } else if (!isUndefined(normalized.ordinal)) {
+      mixed = ordinalToGregorian({
+        ...gregorianToOrdinal(this.c),
+        ...normalized
+      });
+    } else {
+      mixed = {
+        ...this.toObject(),
+        ...normalized
+      };
+
+      // if we didn't set the day but we ended up on an overflow date,
+      // use the last day of the right month
+      if (isUndefined(normalized.day)) {
+        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+      }
+    }
+    const [ts, o] = objToTS(mixed, this.o, this.zone);
+    return clone(this, {
+      ts,
+      o
+    });
+  }
+
+  /**
+   * Add a period of time to this DateTime and return the resulting DateTime
+   *
+   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @example DateTime.now().plus(123) //~> in 123 milliseconds
+   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+   * @return {DateTime}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration);
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * Subtract a period of time to this DateTime and return the resulting DateTime
+   * See {@link DateTime#plus}
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   @return {DateTime}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration).negate();
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * "Set" this DateTime to the beginning of a unit of time.
+   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+   * @return {DateTime}
+   */
+  startOf(unit, {
+    useLocaleWeeks = false
+  } = {}) {
+    if (!this.isValid) return this;
+    const o = {},
+      normalizedUnit = Duration.normalizeUnit(unit);
+    switch (normalizedUnit) {
+      case "years":
+        o.month = 1;
+      // falls through
+      case "quarters":
+      case "months":
+        o.day = 1;
+      // falls through
+      case "weeks":
+      case "days":
+        o.hour = 0;
+      // falls through
+      case "hours":
+        o.minute = 0;
+      // falls through
+      case "minutes":
+        o.second = 0;
+      // falls through
+      case "seconds":
+        o.millisecond = 0;
+        break;
+      // no default, invalid units throw in normalizeUnit()
+    }
+
+    if (normalizedUnit === "weeks") {
+      if (useLocaleWeeks) {
+        const startOfWeek = this.loc.getStartOfWeek();
+        const {
+          weekday
+        } = this;
+        if (weekday < startOfWeek) {
+          o.weekNumber = this.weekNumber - 1;
+        }
+        o.weekday = startOfWeek;
+      } else {
+        o.weekday = 1;
+      }
+    }
+    if (normalizedUnit === "quarters") {
+      const q = Math.ceil(this.month / 3);
+      o.month = (q - 1) * 3 + 1;
+    }
+    return this.set(o);
+  }
+
+  /**
+   * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+   * @return {DateTime}
+   */
+  endOf(unit, opts) {
+    return this.isValid ? this.plus({
+      [unit]: 1
+    }).startOf(unit, opts).minus(1) : this;
+  }
+
+  // OUTPUT
+
+  /**
+   * Returns a string representation of this DateTime formatted according to the specified format string.
+   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    return this.isValid ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt) : INVALID;
+  }
+
+  /**
+   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+   * of the DateTime in the assigned locale.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+   * @return {string}
+   */
+  toLocaleString(formatOpts = DATE_SHORT, opts = {}) {
+    return this.isValid ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this) : INVALID;
+  }
+
+  /**
+   * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+   * @example DateTime.now().toLocaleParts(); //=> [
+   *                                   //=>   { type: 'day', value: '25' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'month', value: '05' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'year', value: '1982' }
+   *                                   //=> ]
+   */
+  toLocaleParts(opts = {}) {
+    return this.isValid ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this) : [];
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+   * @return {string|null}
+   */
+  toISO({
+    format = "extended",
+    suppressSeconds = false,
+    suppressMilliseconds = false,
+    includeOffset = true,
+    extendedZone = false,
+    precision = "milliseconds"
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    precision = normalizeUnit(precision);
+    const ext = format === "extended";
+    let c = toISODate(this, ext, precision);
+    if (orderedUnits.indexOf(precision) >= 3) c += "T";
+    c += toISOTime(this, ext, suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+    return c;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's date component
+   * @param {Object} opts - options
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+   * @return {string|null}
+   */
+  toISODate({
+    format = "extended",
+    precision = "day"
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, format === "extended", normalizeUnit(precision));
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's week date
+   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+   * @return {string}
+   */
+  toISOWeekDate() {
+    return toTechFormat(this, "kkkk-'W'WW-c");
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's time component
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+   * @return {string}
+   */
+  toISOTime({
+    suppressMilliseconds = false,
+    suppressSeconds = false,
+    includeOffset = true,
+    includePrefix = false,
+    extendedZone = false,
+    format = "extended",
+    precision = "milliseconds"
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    precision = normalizeUnit(precision);
+    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+    return c + toISOTime(this, format === "extended", suppressSeconds, suppressMilliseconds, includeOffset, extendedZone, precision);
+  }
+
+  /**
+   * Returns an RFC 2822-compatible string representation of this DateTime
+   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+   * @return {string}
+   */
+  toRFC2822() {
+    return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+   * Specifically, the string conforms to RFC 1123.
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+   * @return {string}
+   */
+  toHTTP() {
+    return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Date
+   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+   * @return {string|null}
+   */
+  toSQLDate() {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Time
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+   * @return {string}
+   */
+  toSQLTime({
+    includeOffset = true,
+    includeZone = false,
+    includeOffsetSpace = true
+  } = {}) {
+    let fmt = "HH:mm:ss.SSS";
+    if (includeZone || includeOffset) {
+      if (includeOffsetSpace) {
+        fmt += " ";
+      }
+      if (includeZone) {
+        fmt += "z";
+      } else if (includeOffset) {
+        fmt += "ZZ";
+      }
+    }
+    return toTechFormat(this, fmt, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+   * @return {string}
+   */
+  toSQL(opts = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for debugging
+   * @return {string}
+   */
+  toString() {
+    return this.isValid ? this.toISO() : INVALID;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;
+    } else {
+      return `DateTime { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime.
+   * @return {number}
+   */
+  toMillis() {
+    return this.isValid ? this.ts : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+   * @return {number}
+   */
+  toSeconds() {
+    return this.isValid ? this.ts / 1000 : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (as a whole number) of this DateTime.
+   * @return {number}
+   */
+  toUnixInteger() {
+    return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a BSON serializable equivalent to this DateTime.
+   * @return {Date}
+   */
+  toBSON() {
+    return this.toJSDate();
+  }
+
+  /**
+   * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+   * @param opts - options for generating the object
+   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+   * @return {Object}
+   */
+  toObject(opts = {}) {
+    if (!this.isValid) return {};
+    const base = {
+      ...this.c
+    };
+    if (opts.includeConfig) {
+      base.outputCalendar = this.outputCalendar;
+      base.numberingSystem = this.loc.numberingSystem;
+      base.locale = this.loc.locale;
+    }
+    return base;
+  }
+
+  /**
+   * Returns a JavaScript Date equivalent to this DateTime.
+   * @return {Date}
+   */
+  toJSDate() {
+    return new Date(this.isValid ? this.ts : NaN);
+  }
+
+  // COMPARE
+
+  /**
+   * Return the difference between two DateTimes as a Duration.
+   * @param {DateTime} otherDateTime - the DateTime to compare this one to
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example
+   * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+   *     i2 = DateTime.fromISO('1983-10-14T10:30');
+   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+   * @return {Duration}
+   */
+  diff(otherDateTime, unit = "milliseconds", opts = {}) {
+    if (!this.isValid || !otherDateTime.isValid) {
+      return Duration.invalid("created by diffing an invalid DateTime");
+    }
+    const durOpts = {
+      locale: this.locale,
+      numberingSystem: this.numberingSystem,
+      ...opts
+    };
+    const units = maybeArray(unit).map(Duration.normalizeUnit),
+      otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+      earlier = otherIsLater ? this : otherDateTime,
+      later = otherIsLater ? otherDateTime : this,
+      diffed = diff(earlier, later, units, durOpts);
+    return otherIsLater ? diffed.negate() : diffed;
+  }
+
+  /**
+   * Return the difference between this DateTime and right now.
+   * See {@link DateTime#diff}
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  diffNow(unit = "milliseconds", opts = {}) {
+    return this.diff(DateTime.now(), unit, opts);
+  }
+
+  /**
+   * Return an Interval spanning between this DateTime and another DateTime
+   * @param {DateTime} otherDateTime - the other end point of the Interval
+   * @return {Interval|DateTime}
+   */
+  until(otherDateTime) {
+    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+  }
+
+  /**
+   * Return whether this DateTime is in the same unit of time as another DateTime.
+   * Higher-order units must also be identical for this function to return `true`.
+   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+   * @param {DateTime} otherDateTime - the other DateTime
+   * @param {string} unit - the unit of time to check sameness on
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+   * @return {boolean}
+   */
+  hasSame(otherDateTime, unit, opts) {
+    if (!this.isValid) return false;
+    const inputMs = otherDateTime.valueOf();
+    const adjustedToZone = this.setZone(otherDateTime.zone, {
+      keepLocalTime: true
+    });
+    return adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts);
+  }
+
+  /**
+   * Equality check
+   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+   * To compare just the millisecond values, use `+dt1 === +dt2`.
+   * @param {DateTime} other - the other DateTime
+   * @return {boolean}
+   */
+  equals(other) {
+    return this.isValid && other.isValid && this.valueOf() === other.valueOf() && this.zone.equals(other.zone) && this.loc.equals(other.loc);
+  }
+
+  /**
+   * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+   * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+   * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+   * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+   */
+  toRelative(options = {}) {
+    if (!this.isValid) return null;
+    const base = options.base || DateTime.fromObject({}, {
+        zone: this.zone
+      }),
+      padding = options.padding ? this < base ? -options.padding : options.padding : 0;
+    let units = ["years", "months", "days", "hours", "minutes", "seconds"];
+    let unit = options.unit;
+    if (Array.isArray(options.unit)) {
+      units = options.unit;
+      unit = undefined;
+    }
+    return diffRelative(base, this.plus(padding), {
+      ...options,
+      numeric: "always",
+      units,
+      unit
+    });
+  }
+
+  /**
+   * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+   * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+   */
+  toRelativeCalendar(options = {}) {
+    if (!this.isValid) return null;
+    return diffRelative(options.base || DateTime.fromObject({}, {
+      zone: this.zone
+    }), this, {
+      ...options,
+      numeric: "auto",
+      units: ["years", "months", "days"],
+      calendary: true
+    });
+  }
+
+  /**
+   * Return the min of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+   * @return {DateTime} the min DateTime, or undefined if called with no argument
+   */
+  static min(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("min requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, i => i.valueOf(), Math.min);
+  }
+
+  /**
+   * Return the max of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+   * @return {DateTime} the max DateTime, or undefined if called with no argument
+   */
+  static max(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("max requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, i => i.valueOf(), Math.max);
+  }
+
+  // MISC
+
+  /**
+   * Explain how a string would be parsed by fromFormat()
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see description)
+   * @param {Object} options - options taken by fromFormat()
+   * @return {Object}
+   */
+  static fromFormatExplain(text, fmt, options = {}) {
+    const {
+        locale = null,
+        numberingSystem = null
+      } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true
+      });
+    return explainFromTokens(localeToUse, text, fmt);
+  }
+
+  /**
+   * @deprecated use fromFormatExplain instead
+   */
+  static fromStringExplain(text, fmt, options = {}) {
+    return DateTime.fromFormatExplain(text, fmt, options);
+  }
+
+  /**
+   * Build a parser for `fmt` using the given locale. This parser can be passed
+   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+   * can be used to optimize cases where many dates need to be parsed in a
+   * specific format.
+   *
+   * @param {String} fmt - the format the string is expected to be in (see
+   * description)
+   * @param {Object} options - options used to set locale and numberingSystem
+   * for parser
+   * @returns {TokenParser} - opaque object to be used
+   */
+  static buildFormatParser(fmt, options = {}) {
+    const {
+        locale = null,
+        numberingSystem = null
+      } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true
+      });
+    return new TokenParser(localeToUse, fmt);
+  }
+
+  /**
+   * Create a DateTime from an input string and format parser.
+   *
+   * The format parser must have been created with the same locale as this call.
+   *
+   * @param {String} text - the string to parse
+   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+   * @param {Object} opts - options taken by fromFormat()
+   * @returns {DateTime}
+   */
+  static fromFormatParser(text, formatParser, opts = {}) {
+    if (isUndefined(text) || isUndefined(formatParser)) {
+      throw new InvalidArgumentError("fromFormatParser requires an input string and a format parser");
+    }
+    const {
+        locale = null,
+        numberingSystem = null
+      } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true
+      });
+    if (!localeToUse.equals(formatParser.locale)) {
+      throw new InvalidArgumentError(`fromFormatParser called with a locale of ${localeToUse}, ` + `but the format parser was created for ${formatParser.locale}`);
+    }
+    const {
+      result,
+      zone,
+      specificOffset,
+      invalidReason
+    } = formatParser.explainFromTokens(text);
+    if (invalidReason) {
+      return DateTime.invalid(invalidReason);
+    } else {
+      return parseDataToDateTime(result, zone, opts, `format ${formatParser.format}`, text, specificOffset);
+    }
+  }
+
+  // FORMAT PRESETS
+
+  /**
+   * {@link DateTime#toLocaleString} format like 10/14/1983
+   * @type {Object}
+   */
+  static get DATE_SHORT() {
+    return DATE_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED() {
+    return DATE_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED_WITH_WEEKDAY() {
+    return DATE_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_FULL() {
+    return DATE_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_HUGE() {
+    return DATE_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_SIMPLE() {
+    return TIME_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SECONDS() {
+    return TIME_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SHORT_OFFSET() {
+    return TIME_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_LONG_OFFSET() {
+    return TIME_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_SIMPLE() {
+    return TIME_24_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SECONDS() {
+    return TIME_24_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SHORT_OFFSET() {
+    return TIME_24_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_LONG_OFFSET() {
+    return TIME_24_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT() {
+    return DATETIME_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT_WITH_SECONDS() {
+    return DATETIME_SHORT_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED() {
+    return DATETIME_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_SECONDS() {
+    return DATETIME_MED_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_WEEKDAY() {
+    return DATETIME_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL() {
+    return DATETIME_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL_WITH_SECONDS() {
+    return DATETIME_FULL_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE() {
+    return DATETIME_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE_WITH_SECONDS() {
+    return DATETIME_HUGE_WITH_SECONDS;
+  }
+}
+
+/**
+ * @private
+ */
+function friendlyDateTime(dateTimeish) {
+  if (DateTime.isDateTime(dateTimeish)) {
+    return dateTimeish;
+  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+    return DateTime.fromJSDate(dateTimeish);
+  } else if (dateTimeish && typeof dateTimeish === "object") {
+    return DateTime.fromObject(dateTimeish);
+  } else {
+    throw new InvalidArgumentError(`Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`);
+  }
+}
+
+const VERSION = "3.7.2";
+
+exports.DateTime = DateTime;
+exports.Duration = Duration;
+exports.FixedOffsetZone = FixedOffsetZone;
+exports.IANAZone = IANAZone;
+exports.Info = Info;
+exports.Interval = Interval;
+exports.InvalidZone = InvalidZone;
+exports.Settings = Settings;
+exports.SystemZone = SystemZone;
+exports.VERSION = VERSION;
+exports.Zone = Zone;
+//# sourceMappingURL=luxon.js.map
diff --git a/node_modules/luxon/build/node/luxon.js.map b/node_modules/luxon/build/node/luxon.js.map
new file mode 100644
index 0000000..bcb0835
--- /dev/null
+++ b/node_modules/luxon/build/node/luxon.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"luxon.js","sources":["../../src/errors.js","../../src/impl/formats.js","../../src/zone.js","../../src/zones/systemZone.js","../../src/zones/IANAZone.js","../../src/impl/locale.js","../../src/zones/fixedOffsetZone.js","../../src/zones/invalidZone.js","../../src/impl/zoneUtil.js","../../src/impl/digits.js","../../src/settings.js","../../src/impl/invalid.js","../../src/impl/conversions.js","../../src/impl/util.js","../../src/impl/english.js","../../src/impl/formatter.js","../../src/impl/regexParser.js","../../src/duration.js","../../src/interval.js","../../src/info.js","../../src/impl/diff.js","../../src/impl/tokenParser.js","../../src/datetime.js","../../src/luxon.js"],"sourcesContent":["// these aren't really private, but nor are they really useful to document\n\n/**\n * @private\n */\nclass LuxonError extends Error {}\n\n/**\n * @private\n */\nexport class InvalidDateTimeError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid DateTime: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidIntervalError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Interval: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidDurationError extends LuxonError {\n  constructor(reason) {\n    super(`Invalid Duration: ${reason.toMessage()}`);\n  }\n}\n\n/**\n * @private\n */\nexport class ConflictingSpecificationError extends LuxonError {}\n\n/**\n * @private\n */\nexport class InvalidUnitError extends LuxonError {\n  constructor(unit) {\n    super(`Invalid unit ${unit}`);\n  }\n}\n\n/**\n * @private\n */\nexport class InvalidArgumentError extends LuxonError {}\n\n/**\n * @private\n */\nexport class ZoneIsAbstractError extends LuxonError {\n  constructor() {\n    super(\"Zone is an abstract class\");\n  }\n}\n","/**\n * @private\n */\n\nconst n = \"numeric\",\n  s = \"short\",\n  l = \"long\";\n\nexport const DATE_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n};\n\nexport const DATE_MED = {\n  year: n,\n  month: s,\n  day: n,\n};\n\nexport const DATE_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n};\n\nexport const DATE_FULL = {\n  year: n,\n  month: l,\n  day: n,\n};\n\nexport const DATE_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n};\n\nexport const TIME_SIMPLE = {\n  hour: n,\n  minute: n,\n};\n\nexport const TIME_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const TIME_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const TIME_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n\nexport const TIME_24_SIMPLE = {\n  hour: n,\n  minute: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SECONDS = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n};\n\nexport const TIME_24_WITH_SHORT_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: s,\n};\n\nexport const TIME_24_WITH_LONG_OFFSET = {\n  hour: n,\n  minute: n,\n  second: n,\n  hourCycle: \"h23\",\n  timeZoneName: l,\n};\n\nexport const DATETIME_SHORT = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_SHORT_WITH_SECONDS = {\n  year: n,\n  month: n,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_MED_WITH_SECONDS = {\n  year: n,\n  month: s,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n};\n\nexport const DATETIME_MED_WITH_WEEKDAY = {\n  year: n,\n  month: s,\n  day: n,\n  weekday: s,\n  hour: n,\n  minute: n,\n};\n\nexport const DATETIME_FULL = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_FULL_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: s,\n};\n\nexport const DATETIME_HUGE = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  timeZoneName: l,\n};\n\nexport const DATETIME_HUGE_WITH_SECONDS = {\n  year: n,\n  month: l,\n  day: n,\n  weekday: l,\n  hour: n,\n  minute: n,\n  second: n,\n  timeZoneName: l,\n};\n","import { ZoneIsAbstractError } from \"./errors.js\";\n\n/**\n * @interface\n */\nexport default class Zone {\n  /**\n   * The type of zone\n   * @abstract\n   * @type {string}\n   */\n  get type() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The name of this zone.\n   * @abstract\n   * @type {string}\n   */\n  get name() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * The IANA name of this zone.\n   * Defaults to `name` if not overwritten by a subclass.\n   * @abstract\n   * @type {string}\n   */\n  get ianaName() {\n    return this.name;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year.\n   * @abstract\n   * @type {boolean}\n   */\n  get isUniversal() {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, opts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @abstract\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @abstract\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    throw new ZoneIsAbstractError();\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @abstract\n   * @type {boolean}\n   */\n  get isValid() {\n    throw new ZoneIsAbstractError();\n  }\n}\n","import { formatOffset, parseZoneInfo } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * Represents the local zone for this JavaScript environment.\n * @implements {Zone}\n */\nexport default class SystemZone extends Zone {\n  /**\n   * Get a singleton instance of the local zone\n   * @return {SystemZone}\n   */\n  static get instance() {\n    if (singleton === null) {\n      singleton = new SystemZone();\n    }\n    return singleton;\n  }\n\n  /** @override **/\n  get type() {\n    return \"system\";\n  }\n\n  /** @override **/\n  get name() {\n    return new Intl.DateTimeFormat().resolvedOptions().timeZone;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale);\n  }\n\n  /** @override **/\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /** @override **/\n  offset(ts) {\n    return -new Date(ts).getTimezoneOffset();\n  }\n\n  /** @override **/\n  equals(otherZone) {\n    return otherZone.type === \"system\";\n  }\n\n  /** @override **/\n  get isValid() {\n    return true;\n  }\n}\n","import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nconst dtfCache = new Map();\nfunction makeDTF(zoneName) {\n  let dtf = dtfCache.get(zoneName);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(\"en-US\", {\n      hour12: false,\n      timeZone: zoneName,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      era: \"short\",\n    });\n    dtfCache.set(zoneName, dtf);\n  }\n  return dtf;\n}\n\nconst typeToPos = {\n  year: 0,\n  month: 1,\n  day: 2,\n  era: 3,\n  hour: 4,\n  minute: 5,\n  second: 6,\n};\n\nfunction hackyOffset(dtf, date) {\n  const formatted = dtf.format(date).replace(/\\u200E/g, \"\"),\n    parsed = /(\\d+)\\/(\\d+)\\/(\\d+) (AD|BC),? (\\d+):(\\d+):(\\d+)/.exec(formatted),\n    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;\n  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];\n}\n\nfunction partsOffset(dtf, date) {\n  const formatted = dtf.formatToParts(date);\n  const filled = [];\n  for (let i = 0; i < formatted.length; i++) {\n    const { type, value } = formatted[i];\n    const pos = typeToPos[type];\n\n    if (type === \"era\") {\n      filled[pos] = value;\n    } else if (!isUndefined(pos)) {\n      filled[pos] = parseInt(value, 10);\n    }\n  }\n  return filled;\n}\n\nconst ianaZoneCache = new Map();\n/**\n * A zone identified by an IANA identifier, like America/New_York\n * @implements {Zone}\n */\nexport default class IANAZone extends Zone {\n  /**\n   * @param {string} name - Zone name\n   * @return {IANAZone}\n   */\n  static create(name) {\n    let zone = ianaZoneCache.get(name);\n    if (zone === undefined) {\n      ianaZoneCache.set(name, (zone = new IANAZone(name)));\n    }\n    return zone;\n  }\n\n  /**\n   * Reset local caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCache() {\n    ianaZoneCache.clear();\n    dtfCache.clear();\n  }\n\n  /**\n   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.\n   * @param {string} s - The string to check validity on\n   * @example IANAZone.isValidSpecifier(\"America/New_York\") //=> true\n   * @example IANAZone.isValidSpecifier(\"Sport~~blorp\") //=> false\n   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.\n   * @return {boolean}\n   */\n  static isValidSpecifier(s) {\n    return this.isValidZone(s);\n  }\n\n  /**\n   * Returns whether the provided string identifies a real zone\n   * @param {string} zone - The string to check\n   * @example IANAZone.isValidZone(\"America/New_York\") //=> true\n   * @example IANAZone.isValidZone(\"Fantasia/Castle\") //=> false\n   * @example IANAZone.isValidZone(\"Sport~~blorp\") //=> false\n   * @return {boolean}\n   */\n  static isValidZone(zone) {\n    if (!zone) {\n      return false;\n    }\n    try {\n      new Intl.DateTimeFormat(\"en-US\", { timeZone: zone }).format();\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }\n\n  constructor(name) {\n    super();\n    /** @private **/\n    this.zoneName = name;\n    /** @private **/\n    this.valid = IANAZone.isValidZone(name);\n  }\n\n  /**\n   * The type of zone. `iana` for all instances of `IANAZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"iana\";\n  }\n\n  /**\n   * The name of this zone (i.e. the IANA zone name).\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.zoneName;\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns false for all IANA zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return false;\n  }\n\n  /**\n   * Returns the offset's common name (such as EST) at the specified timestamp\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the name\n   * @param {Object} opts - Options to affect the format\n   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.\n   * @param {string} opts.locale - What locale to return the offset name in.\n   * @return {string}\n   */\n  offsetName(ts, { format, locale }) {\n    return parseZoneInfo(ts, format, locale, this.name);\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.offset(ts), format);\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to compute the offset\n   * @return {number}\n   */\n  offset(ts) {\n    if (!this.valid) return NaN;\n    const date = new Date(ts);\n\n    if (isNaN(date)) return NaN;\n\n    const dtf = makeDTF(this.name);\n    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts\n      ? partsOffset(dtf, date)\n      : hackyOffset(dtf, date);\n\n    if (adOrBc === \"BC\") {\n      year = -Math.abs(year) + 1;\n    }\n\n    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat\n    const adjustedHour = hour === 24 ? 0 : hour;\n\n    const asUTC = objToLocalTS({\n      year,\n      month,\n      day,\n      hour: adjustedHour,\n      minute,\n      second,\n      millisecond: 0,\n    });\n\n    let asTS = +date;\n    const over = asTS % 1000;\n    asTS -= over >= 0 ? over : 1000 + over;\n    return (asUTC - asTS) / (60 * 1000);\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"iana\" && otherZone.name === this.name;\n  }\n\n  /**\n   * Return whether this Zone is valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.valid;\n  }\n}\n","import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from \"./util.js\";\nimport * as English from \"./english.js\";\nimport Settings from \"../settings.js\";\nimport DateTime from \"../datetime.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n// todo - remap caching\n\nlet intlLFCache = {};\nfunction getCachedLF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlLFCache[key];\n  if (!dtf) {\n    dtf = new Intl.ListFormat(locString, opts);\n    intlLFCache[key] = dtf;\n  }\n  return dtf;\n}\n\nconst intlDTCache = new Map();\nfunction getCachedDTF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let dtf = intlDTCache.get(key);\n  if (dtf === undefined) {\n    dtf = new Intl.DateTimeFormat(locString, opts);\n    intlDTCache.set(key, dtf);\n  }\n  return dtf;\n}\n\nconst intlNumCache = new Map();\nfunction getCachedINF(locString, opts = {}) {\n  const key = JSON.stringify([locString, opts]);\n  let inf = intlNumCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.NumberFormat(locString, opts);\n    intlNumCache.set(key, inf);\n  }\n  return inf;\n}\n\nconst intlRelCache = new Map();\nfunction getCachedRTF(locString, opts = {}) {\n  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options\n  const key = JSON.stringify([locString, cacheKeyOpts]);\n  let inf = intlRelCache.get(key);\n  if (inf === undefined) {\n    inf = new Intl.RelativeTimeFormat(locString, opts);\n    intlRelCache.set(key, inf);\n  }\n  return inf;\n}\n\nlet sysLocaleCache = null;\nfunction systemLocale() {\n  if (sysLocaleCache) {\n    return sysLocaleCache;\n  } else {\n    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;\n    return sysLocaleCache;\n  }\n}\n\nconst intlResolvedOptionsCache = new Map();\nfunction getCachedIntResolvedOptions(locString) {\n  let opts = intlResolvedOptionsCache.get(locString);\n  if (opts === undefined) {\n    opts = new Intl.DateTimeFormat(locString).resolvedOptions();\n    intlResolvedOptionsCache.set(locString, opts);\n  }\n  return opts;\n}\n\nconst weekInfoCache = new Map();\nfunction getCachedWeekInfo(locString) {\n  let data = weekInfoCache.get(locString);\n  if (!data) {\n    const locale = new Intl.Locale(locString);\n    // browsers currently implement this as a property, but spec says it should be a getter function\n    data = \"getWeekInfo\" in locale ? locale.getWeekInfo() : locale.weekInfo;\n    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86\n    if (!(\"minimalDays\" in data)) {\n      data = { ...fallbackWeekSettings, ...data };\n    }\n    weekInfoCache.set(locString, data);\n  }\n  return data;\n}\n\nfunction parseLocaleString(localeStr) {\n  // I really want to avoid writing a BCP 47 parser\n  // see, e.g. https://github.com/wooorm/bcp-47\n  // Instead, we'll do this:\n\n  // a) if the string has no -u extensions, just leave it alone\n  // b) if it does, use Intl to resolve everything\n  // c) if Intl fails, try again without the -u\n\n  // private subtags and unicode subtags have ordering requirements,\n  // and we're not properly parsing this, so just strip out the\n  // private ones if they exist.\n  const xIndex = localeStr.indexOf(\"-x-\");\n  if (xIndex !== -1) {\n    localeStr = localeStr.substring(0, xIndex);\n  }\n\n  const uIndex = localeStr.indexOf(\"-u-\");\n  if (uIndex === -1) {\n    return [localeStr];\n  } else {\n    let options;\n    let selectedStr;\n    try {\n      options = getCachedDTF(localeStr).resolvedOptions();\n      selectedStr = localeStr;\n    } catch (e) {\n      const smaller = localeStr.substring(0, uIndex);\n      options = getCachedDTF(smaller).resolvedOptions();\n      selectedStr = smaller;\n    }\n\n    const { numberingSystem, calendar } = options;\n    return [selectedStr, numberingSystem, calendar];\n  }\n}\n\nfunction intlConfigString(localeStr, numberingSystem, outputCalendar) {\n  if (outputCalendar || numberingSystem) {\n    if (!localeStr.includes(\"-u-\")) {\n      localeStr += \"-u\";\n    }\n\n    if (outputCalendar) {\n      localeStr += `-ca-${outputCalendar}`;\n    }\n\n    if (numberingSystem) {\n      localeStr += `-nu-${numberingSystem}`;\n    }\n    return localeStr;\n  } else {\n    return localeStr;\n  }\n}\n\nfunction mapMonths(f) {\n  const ms = [];\n  for (let i = 1; i <= 12; i++) {\n    const dt = DateTime.utc(2009, i, 1);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction mapWeekdays(f) {\n  const ms = [];\n  for (let i = 1; i <= 7; i++) {\n    const dt = DateTime.utc(2016, 11, 13 + i);\n    ms.push(f(dt));\n  }\n  return ms;\n}\n\nfunction listStuff(loc, length, englishFn, intlFn) {\n  const mode = loc.listingMode();\n\n  if (mode === \"error\") {\n    return null;\n  } else if (mode === \"en\") {\n    return englishFn(length);\n  } else {\n    return intlFn(length);\n  }\n}\n\nfunction supportsFastNumbers(loc) {\n  if (loc.numberingSystem && loc.numberingSystem !== \"latn\") {\n    return false;\n  } else {\n    return (\n      loc.numberingSystem === \"latn\" ||\n      !loc.locale ||\n      loc.locale.startsWith(\"en\") ||\n      getCachedIntResolvedOptions(loc.locale).numberingSystem === \"latn\"\n    );\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyNumberFormatter {\n  constructor(intl, forceSimple, opts) {\n    this.padTo = opts.padTo || 0;\n    this.floor = opts.floor || false;\n\n    const { padTo, floor, ...otherOpts } = opts;\n\n    if (!forceSimple || Object.keys(otherOpts).length > 0) {\n      const intlOpts = { useGrouping: false, ...opts };\n      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;\n      this.inf = getCachedINF(intl, intlOpts);\n    }\n  }\n\n  format(i) {\n    if (this.inf) {\n      const fixed = this.floor ? Math.floor(i) : i;\n      return this.inf.format(fixed);\n    } else {\n      // to match the browser's numberformatter defaults\n      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);\n      return padStart(fixed, this.padTo);\n    }\n  }\n}\n\n/**\n * @private\n */\n\nclass PolyDateFormatter {\n  constructor(dt, intl, opts) {\n    this.opts = opts;\n    this.originalZone = undefined;\n\n    let z = undefined;\n    if (this.opts.timeZone) {\n      // Don't apply any workarounds if a timeZone is explicitly provided in opts\n      this.dt = dt;\n    } else if (dt.zone.type === \"fixed\") {\n      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.\n      // That is why fixed-offset TZ is set to that unless it is:\n      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.\n      // 2. Unsupported by the browser:\n      //    - some do not support Etc/\n      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata\n      const gmtOffset = -1 * (dt.offset / 60);\n      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;\n      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {\n        z = offsetZ;\n        this.dt = dt;\n      } else {\n        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so\n        // we manually apply the offset and substitute the zone as needed.\n        z = \"UTC\";\n        this.dt = dt.offset === 0 ? dt : dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n        this.originalZone = dt.zone;\n      }\n    } else if (dt.zone.type === \"system\") {\n      this.dt = dt;\n    } else if (dt.zone.type === \"iana\") {\n      this.dt = dt;\n      z = dt.zone.name;\n    } else {\n      // Custom zones can have any offset / offsetName so we just manually\n      // apply the offset and substitute the zone as needed.\n      z = \"UTC\";\n      this.dt = dt.setZone(\"UTC\").plus({ minutes: dt.offset });\n      this.originalZone = dt.zone;\n    }\n\n    const intlOpts = { ...this.opts };\n    intlOpts.timeZone = intlOpts.timeZone || z;\n    this.dtf = getCachedDTF(intl, intlOpts);\n  }\n\n  format() {\n    if (this.originalZone) {\n      // If we have to substitute in the actual zone name, we have to use\n      // formatToParts so that the timezone can be replaced.\n      return this.formatToParts()\n        .map(({ value }) => value)\n        .join(\"\");\n    }\n    return this.dtf.format(this.dt.toJSDate());\n  }\n\n  formatToParts() {\n    const parts = this.dtf.formatToParts(this.dt.toJSDate());\n    if (this.originalZone) {\n      return parts.map((part) => {\n        if (part.type === \"timeZoneName\") {\n          const offsetName = this.originalZone.offsetName(this.dt.ts, {\n            locale: this.dt.locale,\n            format: this.opts.timeZoneName,\n          });\n          return {\n            ...part,\n            value: offsetName,\n          };\n        } else {\n          return part;\n        }\n      });\n    }\n    return parts;\n  }\n\n  resolvedOptions() {\n    return this.dtf.resolvedOptions();\n  }\n}\n\n/**\n * @private\n */\nclass PolyRelFormatter {\n  constructor(intl, isEnglish, opts) {\n    this.opts = { style: \"long\", ...opts };\n    if (!isEnglish && hasRelative()) {\n      this.rtf = getCachedRTF(intl, opts);\n    }\n  }\n\n  format(count, unit) {\n    if (this.rtf) {\n      return this.rtf.format(count, unit);\n    } else {\n      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== \"long\");\n    }\n  }\n\n  formatToParts(count, unit) {\n    if (this.rtf) {\n      return this.rtf.formatToParts(count, unit);\n    } else {\n      return [];\n    }\n  }\n}\n\nconst fallbackWeekSettings = {\n  firstDay: 1,\n  minimalDays: 4,\n  weekend: [6, 7],\n};\n\n/**\n * @private\n */\nexport default class Locale {\n  static fromOpts(opts) {\n    return Locale.create(\n      opts.locale,\n      opts.numberingSystem,\n      opts.outputCalendar,\n      opts.weekSettings,\n      opts.defaultToEN\n    );\n  }\n\n  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {\n    const specifiedLocale = locale || Settings.defaultLocale;\n    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats\n    const localeR = specifiedLocale || (defaultToEN ? \"en-US\" : systemLocale());\n    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;\n    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;\n    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;\n    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);\n  }\n\n  static resetCache() {\n    sysLocaleCache = null;\n    intlDTCache.clear();\n    intlNumCache.clear();\n    intlRelCache.clear();\n    intlResolvedOptionsCache.clear();\n    weekInfoCache.clear();\n  }\n\n  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {\n    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);\n  }\n\n  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {\n    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);\n\n    this.locale = parsedLocale;\n    this.numberingSystem = numbering || parsedNumberingSystem || null;\n    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;\n    this.weekSettings = weekSettings;\n    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);\n\n    this.weekdaysCache = { format: {}, standalone: {} };\n    this.monthsCache = { format: {}, standalone: {} };\n    this.meridiemCache = null;\n    this.eraCache = {};\n\n    this.specifiedLocale = specifiedLocale;\n    this.fastNumbersCached = null;\n  }\n\n  get fastNumbers() {\n    if (this.fastNumbersCached == null) {\n      this.fastNumbersCached = supportsFastNumbers(this);\n    }\n\n    return this.fastNumbersCached;\n  }\n\n  listingMode() {\n    const isActuallyEn = this.isEnglish();\n    const hasNoWeirdness =\n      (this.numberingSystem === null || this.numberingSystem === \"latn\") &&\n      (this.outputCalendar === null || this.outputCalendar === \"gregory\");\n    return isActuallyEn && hasNoWeirdness ? \"en\" : \"intl\";\n  }\n\n  clone(alts) {\n    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {\n      return this;\n    } else {\n      return Locale.create(\n        alts.locale || this.specifiedLocale,\n        alts.numberingSystem || this.numberingSystem,\n        alts.outputCalendar || this.outputCalendar,\n        validateWeekSettings(alts.weekSettings) || this.weekSettings,\n        alts.defaultToEN || false\n      );\n    }\n  }\n\n  redefaultToEN(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: true });\n  }\n\n  redefaultToSystem(alts = {}) {\n    return this.clone({ ...alts, defaultToEN: false });\n  }\n\n  months(length, format = false) {\n    return listStuff(this, length, English.months, () => {\n      // Workaround for \"ja\" locale: formatToParts does not label all parts of the month\n      // as \"month\" and for this locale there is no difference between \"format\" and \"non-format\".\n      // As such, just use format() instead of formatToParts() and take the whole string\n      const monthSpecialCase = this.intl === \"ja\" || this.intl.startsWith(\"ja-\");\n      format &= !monthSpecialCase;\n      const intl = format ? { month: length, day: \"numeric\" } : { month: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.monthsCache[formatStr][length]) {\n        const mapper = !monthSpecialCase\n          ? (dt) => this.extract(dt, intl, \"month\")\n          : (dt) => this.dtFormatter(dt, intl).format();\n        this.monthsCache[formatStr][length] = mapMonths(mapper);\n      }\n      return this.monthsCache[formatStr][length];\n    });\n  }\n\n  weekdays(length, format = false) {\n    return listStuff(this, length, English.weekdays, () => {\n      const intl = format\n          ? { weekday: length, year: \"numeric\", month: \"long\", day: \"numeric\" }\n          : { weekday: length },\n        formatStr = format ? \"format\" : \"standalone\";\n      if (!this.weekdaysCache[formatStr][length]) {\n        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>\n          this.extract(dt, intl, \"weekday\")\n        );\n      }\n      return this.weekdaysCache[formatStr][length];\n    });\n  }\n\n  meridiems() {\n    return listStuff(\n      this,\n      undefined,\n      () => English.meridiems,\n      () => {\n        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two\n        // for AM and PM. This is probably wrong, but it's makes parsing way easier.\n        if (!this.meridiemCache) {\n          const intl = { hour: \"numeric\", hourCycle: \"h12\" };\n          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(\n            (dt) => this.extract(dt, intl, \"dayperiod\")\n          );\n        }\n\n        return this.meridiemCache;\n      }\n    );\n  }\n\n  eras(length) {\n    return listStuff(this, length, English.eras, () => {\n      const intl = { era: length };\n\n      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates\n      // to definitely enumerate them.\n      if (!this.eraCache[length]) {\n        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>\n          this.extract(dt, intl, \"era\")\n        );\n      }\n\n      return this.eraCache[length];\n    });\n  }\n\n  extract(dt, intlOpts, field) {\n    const df = this.dtFormatter(dt, intlOpts),\n      results = df.formatToParts(),\n      matching = results.find((m) => m.type.toLowerCase() === field);\n    return matching ? matching.value : null;\n  }\n\n  numberFormatter(opts = {}) {\n    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)\n    // (in contrast, the rest of the condition is used heavily)\n    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);\n  }\n\n  dtFormatter(dt, intlOpts = {}) {\n    return new PolyDateFormatter(dt, this.intl, intlOpts);\n  }\n\n  relFormatter(opts = {}) {\n    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);\n  }\n\n  listFormatter(opts = {}) {\n    return getCachedLF(this.intl, opts);\n  }\n\n  isEnglish() {\n    return (\n      this.locale === \"en\" ||\n      this.locale.toLowerCase() === \"en-us\" ||\n      getCachedIntResolvedOptions(this.intl).locale.startsWith(\"en-us\")\n    );\n  }\n\n  getWeekSettings() {\n    if (this.weekSettings) {\n      return this.weekSettings;\n    } else if (!hasLocaleWeekInfo()) {\n      return fallbackWeekSettings;\n    } else {\n      return getCachedWeekInfo(this.locale);\n    }\n  }\n\n  getStartOfWeek() {\n    return this.getWeekSettings().firstDay;\n  }\n\n  getMinDaysInFirstWeek() {\n    return this.getWeekSettings().minimalDays;\n  }\n\n  getWeekendDays() {\n    return this.getWeekSettings().weekend;\n  }\n\n  equals(other) {\n    return (\n      this.locale === other.locale &&\n      this.numberingSystem === other.numberingSystem &&\n      this.outputCalendar === other.outputCalendar\n    );\n  }\n\n  toString() {\n    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;\n  }\n}\n","import { formatOffset, signedOffset } from \"../impl/util.js\";\nimport Zone from \"../zone.js\";\n\nlet singleton = null;\n\n/**\n * A zone with a fixed offset (meaning no DST)\n * @implements {Zone}\n */\nexport default class FixedOffsetZone extends Zone {\n  /**\n   * Get a singleton instance of UTC\n   * @return {FixedOffsetZone}\n   */\n  static get utcInstance() {\n    if (singleton === null) {\n      singleton = new FixedOffsetZone(0);\n    }\n    return singleton;\n  }\n\n  /**\n   * Get an instance with a specified offset\n   * @param {number} offset - The offset in minutes\n   * @return {FixedOffsetZone}\n   */\n  static instance(offset) {\n    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);\n  }\n\n  /**\n   * Get an instance of FixedOffsetZone from a UTC offset string, like \"UTC+6\"\n   * @param {string} s - The offset string to parse\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+6\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC+06\")\n   * @example FixedOffsetZone.parseSpecifier(\"UTC-6:00\")\n   * @return {FixedOffsetZone}\n   */\n  static parseSpecifier(s) {\n    if (s) {\n      const r = s.match(/^utc(?:([+-]\\d{1,2})(?::(\\d{2}))?)?$/i);\n      if (r) {\n        return new FixedOffsetZone(signedOffset(r[1], r[2]));\n      }\n    }\n    return null;\n  }\n\n  constructor(offset) {\n    super();\n    /** @private **/\n    this.fixed = offset;\n  }\n\n  /**\n   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.\n   * @override\n   * @type {string}\n   */\n  get type() {\n    return \"fixed\";\n  }\n\n  /**\n   * The name of this zone.\n   * All fixed zones' names always start with \"UTC\" (plus optional offset)\n   * @override\n   * @type {string}\n   */\n  get name() {\n    return this.fixed === 0 ? \"UTC\" : `UTC${formatOffset(this.fixed, \"narrow\")}`;\n  }\n\n  /**\n   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`\n   *\n   * @override\n   * @type {string}\n   */\n  get ianaName() {\n    if (this.fixed === 0) {\n      return \"Etc/UTC\";\n    } else {\n      return `Etc/GMT${formatOffset(-this.fixed, \"narrow\")}`;\n    }\n  }\n\n  /**\n   * Returns the offset's common name at the specified timestamp.\n   *\n   * For fixed offset zones this equals to the zone name.\n   * @override\n   */\n  offsetName() {\n    return this.name;\n  }\n\n  /**\n   * Returns the offset's value as a string\n   * @override\n   * @param {number} ts - Epoch milliseconds for which to get the offset\n   * @param {string} format - What style of offset to return.\n   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n   * @return {string}\n   */\n  formatOffset(ts, format) {\n    return formatOffset(this.fixed, format);\n  }\n\n  /**\n   * Returns whether the offset is known to be fixed for the whole year:\n   * Always returns true for all fixed offset zones.\n   * @override\n   * @type {boolean}\n   */\n  get isUniversal() {\n    return true;\n  }\n\n  /**\n   * Return the offset in minutes for this zone at the specified timestamp.\n   *\n   * For fixed offset zones, this is constant and does not depend on a timestamp.\n   * @override\n   * @return {number}\n   */\n  offset() {\n    return this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)\n   * @override\n   * @param {Zone} otherZone - the zone to compare\n   * @return {boolean}\n   */\n  equals(otherZone) {\n    return otherZone.type === \"fixed\" && otherZone.fixed === this.fixed;\n  }\n\n  /**\n   * Return whether this Zone is valid:\n   * All fixed offset zones are valid.\n   * @override\n   * @type {boolean}\n   */\n  get isValid() {\n    return true;\n  }\n}\n","import Zone from \"../zone.js\";\n\n/**\n * A zone that failed to parse. You should never need to instantiate this.\n * @implements {Zone}\n */\nexport default class InvalidZone extends Zone {\n  constructor(zoneName) {\n    super();\n    /**  @private */\n    this.zoneName = zoneName;\n  }\n\n  /** @override **/\n  get type() {\n    return \"invalid\";\n  }\n\n  /** @override **/\n  get name() {\n    return this.zoneName;\n  }\n\n  /** @override **/\n  get isUniversal() {\n    return false;\n  }\n\n  /** @override **/\n  offsetName() {\n    return null;\n  }\n\n  /** @override **/\n  formatOffset() {\n    return \"\";\n  }\n\n  /** @override **/\n  offset() {\n    return NaN;\n  }\n\n  /** @override **/\n  equals() {\n    return false;\n  }\n\n  /** @override **/\n  get isValid() {\n    return false;\n  }\n}\n","/**\n * @private\n */\n\nimport Zone from \"../zone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport InvalidZone from \"../zones/invalidZone.js\";\n\nimport { isUndefined, isString, isNumber } from \"./util.js\";\nimport SystemZone from \"../zones/systemZone.js\";\n\nexport function normalizeZone(input, defaultZone) {\n  let offset;\n  if (isUndefined(input) || input === null) {\n    return defaultZone;\n  } else if (input instanceof Zone) {\n    return input;\n  } else if (isString(input)) {\n    const lowered = input.toLowerCase();\n    if (lowered === \"default\") return defaultZone;\n    else if (lowered === \"local\" || lowered === \"system\") return SystemZone.instance;\n    else if (lowered === \"utc\" || lowered === \"gmt\") return FixedOffsetZone.utcInstance;\n    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);\n  } else if (isNumber(input)) {\n    return FixedOffsetZone.instance(input);\n  } else if (typeof input === \"object\" && \"offset\" in input && typeof input.offset === \"function\") {\n    // This is dumb, but the instanceof check above doesn't seem to really work\n    // so we're duck checking it\n    return input;\n  } else {\n    return new InvalidZone(input);\n  }\n}\n","const numberingSystems = {\n  arab: \"[\\u0660-\\u0669]\",\n  arabext: \"[\\u06F0-\\u06F9]\",\n  bali: \"[\\u1B50-\\u1B59]\",\n  beng: \"[\\u09E6-\\u09EF]\",\n  deva: \"[\\u0966-\\u096F]\",\n  fullwide: \"[\\uFF10-\\uFF19]\",\n  gujr: \"[\\u0AE6-\\u0AEF]\",\n  hanidec: \"[〇|一|二|三|四|五|六|七|八|九]\",\n  khmr: \"[\\u17E0-\\u17E9]\",\n  knda: \"[\\u0CE6-\\u0CEF]\",\n  laoo: \"[\\u0ED0-\\u0ED9]\",\n  limb: \"[\\u1946-\\u194F]\",\n  mlym: \"[\\u0D66-\\u0D6F]\",\n  mong: \"[\\u1810-\\u1819]\",\n  mymr: \"[\\u1040-\\u1049]\",\n  orya: \"[\\u0B66-\\u0B6F]\",\n  tamldec: \"[\\u0BE6-\\u0BEF]\",\n  telu: \"[\\u0C66-\\u0C6F]\",\n  thai: \"[\\u0E50-\\u0E59]\",\n  tibt: \"[\\u0F20-\\u0F29]\",\n  latn: \"\\\\d\",\n};\n\nconst numberingSystemsUTF16 = {\n  arab: [1632, 1641],\n  arabext: [1776, 1785],\n  bali: [6992, 7001],\n  beng: [2534, 2543],\n  deva: [2406, 2415],\n  fullwide: [65296, 65303],\n  gujr: [2790, 2799],\n  khmr: [6112, 6121],\n  knda: [3302, 3311],\n  laoo: [3792, 3801],\n  limb: [6470, 6479],\n  mlym: [3430, 3439],\n  mong: [6160, 6169],\n  mymr: [4160, 4169],\n  orya: [2918, 2927],\n  tamldec: [3046, 3055],\n  telu: [3174, 3183],\n  thai: [3664, 3673],\n  tibt: [3872, 3881],\n};\n\nconst hanidecChars = numberingSystems.hanidec.replace(/[\\[|\\]]/g, \"\").split(\"\");\n\nexport function parseDigits(str) {\n  let value = parseInt(str, 10);\n  if (isNaN(value)) {\n    value = \"\";\n    for (let i = 0; i < str.length; i++) {\n      const code = str.charCodeAt(i);\n\n      if (str[i].search(numberingSystems.hanidec) !== -1) {\n        value += hanidecChars.indexOf(str[i]);\n      } else {\n        for (const key in numberingSystemsUTF16) {\n          const [min, max] = numberingSystemsUTF16[key];\n          if (code >= min && code <= max) {\n            value += code - min;\n          }\n        }\n      }\n    }\n    return parseInt(value, 10);\n  } else {\n    return value;\n  }\n}\n\n// cache of {numberingSystem: {append: regex}}\nconst digitRegexCache = new Map();\nexport function resetDigitRegexCache() {\n  digitRegexCache.clear();\n}\n\nexport function digitRegex({ numberingSystem }, append = \"\") {\n  const ns = numberingSystem || \"latn\";\n\n  let appendCache = digitRegexCache.get(ns);\n  if (appendCache === undefined) {\n    appendCache = new Map();\n    digitRegexCache.set(ns, appendCache);\n  }\n  let regex = appendCache.get(append);\n  if (regex === undefined) {\n    regex = new RegExp(`${numberingSystems[ns]}${append}`);\n    appendCache.set(append, regex);\n  }\n\n  return regex;\n}\n","import SystemZone from \"./zones/systemZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport DateTime from \"./datetime.js\";\n\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport { validateWeekSettings } from \"./impl/util.js\";\nimport { resetDigitRegexCache } from \"./impl/digits.js\";\n\nlet now = () => Date.now(),\n  defaultZone = \"system\",\n  defaultLocale = null,\n  defaultNumberingSystem = null,\n  defaultOutputCalendar = null,\n  twoDigitCutoffYear = 60,\n  throwOnInvalid,\n  defaultWeekSettings = null;\n\n/**\n * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.\n */\nexport default class Settings {\n  /**\n   * Get the callback for returning the current timestamp.\n   * @type {function}\n   */\n  static get now() {\n    return now;\n  }\n\n  /**\n   * Set the callback for returning the current timestamp.\n   * The function should return a number, which will be interpreted as an Epoch millisecond count\n   * @type {function}\n   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future\n   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time\n   */\n  static set now(n) {\n    now = n;\n  }\n\n  /**\n   * Set the default time zone to create DateTimes in. Does not affect existing instances.\n   * Use the value \"system\" to reset this value to the system's time zone.\n   * @type {string}\n   */\n  static set defaultZone(zone) {\n    defaultZone = zone;\n  }\n\n  /**\n   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.\n   * The default value is the system's time zone (the one set on the machine that runs this code).\n   * @type {Zone}\n   */\n  static get defaultZone() {\n    return normalizeZone(defaultZone, SystemZone.instance);\n  }\n\n  /**\n   * Get the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultLocale() {\n    return defaultLocale;\n  }\n\n  /**\n   * Set the default locale to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultLocale(locale) {\n    defaultLocale = locale;\n  }\n\n  /**\n   * Get the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultNumberingSystem() {\n    return defaultNumberingSystem;\n  }\n\n  /**\n   * Set the default numbering system to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultNumberingSystem(numberingSystem) {\n    defaultNumberingSystem = numberingSystem;\n  }\n\n  /**\n   * Get the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static get defaultOutputCalendar() {\n    return defaultOutputCalendar;\n  }\n\n  /**\n   * Set the default output calendar to create DateTimes with. Does not affect existing instances.\n   * @type {string}\n   */\n  static set defaultOutputCalendar(outputCalendar) {\n    defaultOutputCalendar = outputCalendar;\n  }\n\n  /**\n   * @typedef {Object} WeekSettings\n   * @property {number} firstDay\n   * @property {number} minimalDays\n   * @property {number[]} weekend\n   */\n\n  /**\n   * @return {WeekSettings|null}\n   */\n  static get defaultWeekSettings() {\n    return defaultWeekSettings;\n  }\n\n  /**\n   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and\n   * how many days are required in the first week of a year.\n   * Does not affect existing instances.\n   *\n   * @param {WeekSettings|null} weekSettings\n   */\n  static set defaultWeekSettings(weekSettings) {\n    defaultWeekSettings = validateWeekSettings(weekSettings);\n  }\n\n  /**\n   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   */\n  static get twoDigitCutoffYear() {\n    return twoDigitCutoffYear;\n  }\n\n  /**\n   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.\n   * @type {number}\n   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century\n   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century\n   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950\n   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50\n   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50\n   */\n  static set twoDigitCutoffYear(cutoffYear) {\n    twoDigitCutoffYear = cutoffYear % 100;\n  }\n\n  /**\n   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static get throwOnInvalid() {\n    return throwOnInvalid;\n  }\n\n  /**\n   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals\n   * @type {boolean}\n   */\n  static set throwOnInvalid(t) {\n    throwOnInvalid = t;\n  }\n\n  /**\n   * Reset Luxon's global caches. Should only be necessary in testing scenarios.\n   * @return {void}\n   */\n  static resetCaches() {\n    Locale.resetCache();\n    IANAZone.resetCache();\n    DateTime.resetCache();\n    resetDigitRegexCache();\n  }\n}\n","export default class Invalid {\n  constructor(reason, explanation) {\n    this.reason = reason;\n    this.explanation = explanation;\n  }\n\n  toMessage() {\n    if (this.explanation) {\n      return `${this.reason}: ${this.explanation}`;\n    } else {\n      return this.reason;\n    }\n  }\n}\n","import {\n  integerBetween,\n  isLeapYear,\n  timeObject,\n  daysInYear,\n  daysInMonth,\n  weeksInWeekYear,\n  isInteger,\n  isUndefined,\n} from \"./util.js\";\nimport Invalid from \"./invalid.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],\n  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];\n\nfunction unitOutOfRange(unit, value) {\n  return new Invalid(\n    \"unit out of range\",\n    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`\n  );\n}\n\nexport function dayOfWeek(year, month, day) {\n  const d = new Date(Date.UTC(year, month - 1, day));\n\n  if (year < 100 && year >= 0) {\n    d.setUTCFullYear(d.getUTCFullYear() - 1900);\n  }\n\n  const js = d.getUTCDay();\n\n  return js === 0 ? 7 : js;\n}\n\nfunction computeOrdinal(year, month, day) {\n  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];\n}\n\nfunction uncomputeOrdinal(year, ordinal) {\n  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,\n    month0 = table.findIndex((i) => i < ordinal),\n    day = ordinal - table[month0];\n  return { month: month0 + 1, day };\n}\n\nexport function isoWeekdayToLocal(isoWeekday, startOfWeek) {\n  return ((isoWeekday - startOfWeek + 7) % 7) + 1;\n}\n\n/**\n * @private\n */\n\nexport function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { year, month, day } = gregObj,\n    ordinal = computeOrdinal(year, month, day),\n    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);\n\n  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),\n    weekYear;\n\n  if (weekNumber < 1) {\n    weekYear = year - 1;\n    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);\n  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {\n    weekYear = year + 1;\n    weekNumber = 1;\n  } else {\n    weekYear = year;\n  }\n\n  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };\n}\n\nexport function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const { weekYear, weekNumber, weekday } = weekData,\n    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),\n    yearInDays = daysInYear(weekYear);\n\n  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,\n    year;\n\n  if (ordinal < 1) {\n    year = weekYear - 1;\n    ordinal += daysInYear(year);\n  } else if (ordinal > yearInDays) {\n    year = weekYear + 1;\n    ordinal -= daysInYear(weekYear);\n  } else {\n    year = weekYear;\n  }\n\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(weekData) };\n}\n\nexport function gregorianToOrdinal(gregData) {\n  const { year, month, day } = gregData;\n  const ordinal = computeOrdinal(year, month, day);\n  return { year, ordinal, ...timeObject(gregData) };\n}\n\nexport function ordinalToGregorian(ordinalData) {\n  const { year, ordinal } = ordinalData;\n  const { month, day } = uncomputeOrdinal(year, ordinal);\n  return { year, month, day, ...timeObject(ordinalData) };\n}\n\n/**\n * Check if local week units like localWeekday are used in obj.\n * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.\n * Modifies obj in-place!\n * @param obj the object values\n */\nexport function usesLocalWeekValues(obj, loc) {\n  const hasLocaleWeekData =\n    !isUndefined(obj.localWeekday) ||\n    !isUndefined(obj.localWeekNumber) ||\n    !isUndefined(obj.localWeekYear);\n  if (hasLocaleWeekData) {\n    const hasIsoWeekData =\n      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);\n\n    if (hasIsoWeekData) {\n      throw new ConflictingSpecificationError(\n        \"Cannot mix locale-based week fields with ISO-based week fields\"\n      );\n    }\n    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;\n    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;\n    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;\n    delete obj.localWeekday;\n    delete obj.localWeekNumber;\n    delete obj.localWeekYear;\n    return {\n      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),\n      startOfWeek: loc.getStartOfWeek(),\n    };\n  } else {\n    return { minDaysInFirstWeek: 4, startOfWeek: 1 };\n  }\n}\n\nexport function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const validYear = isInteger(obj.weekYear),\n    validWeek = integerBetween(\n      obj.weekNumber,\n      1,\n      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)\n    ),\n    validWeekday = integerBetween(obj.weekday, 1, 7);\n\n  if (!validYear) {\n    return unitOutOfRange(\"weekYear\", obj.weekYear);\n  } else if (!validWeek) {\n    return unitOutOfRange(\"week\", obj.weekNumber);\n  } else if (!validWeekday) {\n    return unitOutOfRange(\"weekday\", obj.weekday);\n  } else return false;\n}\n\nexport function hasInvalidOrdinalData(obj) {\n  const validYear = isInteger(obj.year),\n    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validOrdinal) {\n    return unitOutOfRange(\"ordinal\", obj.ordinal);\n  } else return false;\n}\n\nexport function hasInvalidGregorianData(obj) {\n  const validYear = isInteger(obj.year),\n    validMonth = integerBetween(obj.month, 1, 12),\n    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));\n\n  if (!validYear) {\n    return unitOutOfRange(\"year\", obj.year);\n  } else if (!validMonth) {\n    return unitOutOfRange(\"month\", obj.month);\n  } else if (!validDay) {\n    return unitOutOfRange(\"day\", obj.day);\n  } else return false;\n}\n\nexport function hasInvalidTimeData(obj) {\n  const { hour, minute, second, millisecond } = obj;\n  const validHour =\n      integerBetween(hour, 0, 23) ||\n      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),\n    validMinute = integerBetween(minute, 0, 59),\n    validSecond = integerBetween(second, 0, 59),\n    validMillisecond = integerBetween(millisecond, 0, 999);\n\n  if (!validHour) {\n    return unitOutOfRange(\"hour\", hour);\n  } else if (!validMinute) {\n    return unitOutOfRange(\"minute\", minute);\n  } else if (!validSecond) {\n    return unitOutOfRange(\"second\", second);\n  } else if (!validMillisecond) {\n    return unitOutOfRange(\"millisecond\", millisecond);\n  } else return false;\n}\n","/*\n  This is just a junk drawer, containing anything used across multiple classes.\n  Because Luxon is small(ish), this should stay small and we won't worry about splitting\n  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.\n*/\n\nimport { InvalidArgumentError } from \"../errors.js\";\nimport Settings from \"../settings.js\";\nimport { dayOfWeek, isoWeekdayToLocal } from \"./conversions.js\";\n\n/**\n * @private\n */\n\n// TYPES\n\nexport function isUndefined(o) {\n  return typeof o === \"undefined\";\n}\n\nexport function isNumber(o) {\n  return typeof o === \"number\";\n}\n\nexport function isInteger(o) {\n  return typeof o === \"number\" && o % 1 === 0;\n}\n\nexport function isString(o) {\n  return typeof o === \"string\";\n}\n\nexport function isDate(o) {\n  return Object.prototype.toString.call(o) === \"[object Date]\";\n}\n\n// CAPABILITIES\n\nexport function hasRelative() {\n  try {\n    return typeof Intl !== \"undefined\" && !!Intl.RelativeTimeFormat;\n  } catch (e) {\n    return false;\n  }\n}\n\nexport function hasLocaleWeekInfo() {\n  try {\n    return (\n      typeof Intl !== \"undefined\" &&\n      !!Intl.Locale &&\n      (\"weekInfo\" in Intl.Locale.prototype || \"getWeekInfo\" in Intl.Locale.prototype)\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n// OBJECTS AND ARRAYS\n\nexport function maybeArray(thing) {\n  return Array.isArray(thing) ? thing : [thing];\n}\n\nexport function bestBy(arr, by, compare) {\n  if (arr.length === 0) {\n    return undefined;\n  }\n  return arr.reduce((best, next) => {\n    const pair = [by(next), next];\n    if (!best) {\n      return pair;\n    } else if (compare(best[0], pair[0]) === best[0]) {\n      return best;\n    } else {\n      return pair;\n    }\n  }, null)[1];\n}\n\nexport function pick(obj, keys) {\n  return keys.reduce((a, k) => {\n    a[k] = obj[k];\n    return a;\n  }, {});\n}\n\nexport function hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport function validateWeekSettings(settings) {\n  if (settings == null) {\n    return null;\n  } else if (typeof settings !== \"object\") {\n    throw new InvalidArgumentError(\"Week settings must be an object\");\n  } else {\n    if (\n      !integerBetween(settings.firstDay, 1, 7) ||\n      !integerBetween(settings.minimalDays, 1, 7) ||\n      !Array.isArray(settings.weekend) ||\n      settings.weekend.some((v) => !integerBetween(v, 1, 7))\n    ) {\n      throw new InvalidArgumentError(\"Invalid week settings\");\n    }\n    return {\n      firstDay: settings.firstDay,\n      minimalDays: settings.minimalDays,\n      weekend: Array.from(settings.weekend),\n    };\n  }\n}\n\n// NUMBERS AND STRINGS\n\nexport function integerBetween(thing, bottom, top) {\n  return isInteger(thing) && thing >= bottom && thing <= top;\n}\n\n// x % n but takes the sign of n instead of x\nexport function floorMod(x, n) {\n  return x - n * Math.floor(x / n);\n}\n\nexport function padStart(input, n = 2) {\n  const isNeg = input < 0;\n  let padded;\n  if (isNeg) {\n    padded = \"-\" + (\"\" + -input).padStart(n, \"0\");\n  } else {\n    padded = (\"\" + input).padStart(n, \"0\");\n  }\n  return padded;\n}\n\nexport function parseInteger(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseInt(string, 10);\n  }\n}\n\nexport function parseFloating(string) {\n  if (isUndefined(string) || string === null || string === \"\") {\n    return undefined;\n  } else {\n    return parseFloat(string);\n  }\n}\n\nexport function parseMillis(fraction) {\n  // Return undefined (instead of 0) in these cases, where fraction is not set\n  if (isUndefined(fraction) || fraction === null || fraction === \"\") {\n    return undefined;\n  } else {\n    const f = parseFloat(\"0.\" + fraction) * 1000;\n    return Math.floor(f);\n  }\n}\n\nexport function roundTo(number, digits, rounding = \"round\") {\n  const factor = 10 ** digits;\n  switch (rounding) {\n    case \"expand\":\n      return number > 0\n        ? Math.ceil(number * factor) / factor\n        : Math.floor(number * factor) / factor;\n    case \"trunc\":\n      return Math.trunc(number * factor) / factor;\n    case \"round\":\n      return Math.round(number * factor) / factor;\n    case \"floor\":\n      return Math.floor(number * factor) / factor;\n    case \"ceil\":\n      return Math.ceil(number * factor) / factor;\n    default:\n      throw new RangeError(`Value rounding ${rounding} is out of range`);\n  }\n}\n\n// DATE BASICS\n\nexport function isLeapYear(year) {\n  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n\nexport function daysInYear(year) {\n  return isLeapYear(year) ? 366 : 365;\n}\n\nexport function daysInMonth(year, month) {\n  const modMonth = floorMod(month - 1, 12) + 1,\n    modYear = year + (month - modMonth) / 12;\n\n  if (modMonth === 2) {\n    return isLeapYear(modYear) ? 29 : 28;\n  } else {\n    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];\n  }\n}\n\n// convert a calendar object to a local timestamp (epoch, but with the offset baked in)\nexport function objToLocalTS(obj) {\n  let d = Date.UTC(\n    obj.year,\n    obj.month - 1,\n    obj.day,\n    obj.hour,\n    obj.minute,\n    obj.second,\n    obj.millisecond\n  );\n\n  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that\n  if (obj.year < 100 && obj.year >= 0) {\n    d = new Date(d);\n    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not\n    // so if obj.year is in 99, but obj.day makes it roll over into year 100,\n    // the calculations done by Date.UTC are using year 2000 - which is incorrect\n    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);\n  }\n  return +d;\n}\n\n// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js\nfunction firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {\n  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);\n  return -fwdlw + minDaysInFirstWeek - 1;\n}\n\nexport function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {\n  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);\n  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);\n  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;\n}\n\nexport function untruncateYear(year) {\n  if (year > 99) {\n    return year;\n  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;\n}\n\n// PARSING\n\nexport function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {\n  const date = new Date(ts),\n    intlOpts = {\n      hourCycle: \"h23\",\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n    };\n\n  if (timeZone) {\n    intlOpts.timeZone = timeZone;\n  }\n\n  const modified = { timeZoneName: offsetFormat, ...intlOpts };\n\n  const parsed = new Intl.DateTimeFormat(locale, modified)\n    .formatToParts(date)\n    .find((m) => m.type.toLowerCase() === \"timezonename\");\n  return parsed ? parsed.value : null;\n}\n\n// signedOffset('-5', '30') -> -330\nexport function signedOffset(offHourStr, offMinuteStr) {\n  let offHour = parseInt(offHourStr, 10);\n\n  // don't || this because we want to preserve -0\n  if (Number.isNaN(offHour)) {\n    offHour = 0;\n  }\n\n  const offMin = parseInt(offMinuteStr, 10) || 0,\n    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;\n  return offHour * 60 + offMinSigned;\n}\n\n// COERCION\n\nexport function asNumber(value) {\n  const numericValue = Number(value);\n  if (typeof value === \"boolean\" || value === \"\" || !Number.isFinite(numericValue))\n    throw new InvalidArgumentError(`Invalid unit value ${value}`);\n  return numericValue;\n}\n\nexport function normalizeObject(obj, normalizer) {\n  const normalized = {};\n  for (const u in obj) {\n    if (hasOwnProperty(obj, u)) {\n      const v = obj[u];\n      if (v === undefined || v === null) continue;\n      normalized[normalizer(u)] = asNumber(v);\n    }\n  }\n  return normalized;\n}\n\n/**\n * Returns the offset's value as a string\n * @param {number} ts - Epoch milliseconds for which to get the offset\n * @param {string} format - What style of offset to return.\n *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively\n * @return {string}\n */\nexport function formatOffset(offset, format) {\n  const hours = Math.trunc(Math.abs(offset / 60)),\n    minutes = Math.trunc(Math.abs(offset % 60)),\n    sign = offset >= 0 ? \"+\" : \"-\";\n\n  switch (format) {\n    case \"short\":\n      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;\n    case \"narrow\":\n      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : \"\"}`;\n    case \"techie\":\n      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;\n    default:\n      throw new RangeError(`Value format ${format} is out of range for property format`);\n  }\n}\n\nexport function timeObject(obj) {\n  return pick(obj, [\"hour\", \"minute\", \"second\", \"millisecond\"]);\n}\n","import * as Formats from \"./formats.js\";\nimport { pick } from \"./util.js\";\n\nfunction stringify(obj) {\n  return JSON.stringify(obj, Object.keys(obj).sort());\n}\n\n/**\n * @private\n */\n\nexport const monthsLong = [\n  \"January\",\n  \"February\",\n  \"March\",\n  \"April\",\n  \"May\",\n  \"June\",\n  \"July\",\n  \"August\",\n  \"September\",\n  \"October\",\n  \"November\",\n  \"December\",\n];\n\nexport const monthsShort = [\n  \"Jan\",\n  \"Feb\",\n  \"Mar\",\n  \"Apr\",\n  \"May\",\n  \"Jun\",\n  \"Jul\",\n  \"Aug\",\n  \"Sep\",\n  \"Oct\",\n  \"Nov\",\n  \"Dec\",\n];\n\nexport const monthsNarrow = [\"J\", \"F\", \"M\", \"A\", \"M\", \"J\", \"J\", \"A\", \"S\", \"O\", \"N\", \"D\"];\n\nexport function months(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...monthsNarrow];\n    case \"short\":\n      return [...monthsShort];\n    case \"long\":\n      return [...monthsLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"10\", \"11\", \"12\"];\n    case \"2-digit\":\n      return [\"01\", \"02\", \"03\", \"04\", \"05\", \"06\", \"07\", \"08\", \"09\", \"10\", \"11\", \"12\"];\n    default:\n      return null;\n  }\n}\n\nexport const weekdaysLong = [\n  \"Monday\",\n  \"Tuesday\",\n  \"Wednesday\",\n  \"Thursday\",\n  \"Friday\",\n  \"Saturday\",\n  \"Sunday\",\n];\n\nexport const weekdaysShort = [\"Mon\", \"Tue\", \"Wed\", \"Thu\", \"Fri\", \"Sat\", \"Sun\"];\n\nexport const weekdaysNarrow = [\"M\", \"T\", \"W\", \"T\", \"F\", \"S\", \"S\"];\n\nexport function weekdays(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...weekdaysNarrow];\n    case \"short\":\n      return [...weekdaysShort];\n    case \"long\":\n      return [...weekdaysLong];\n    case \"numeric\":\n      return [\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\"];\n    default:\n      return null;\n  }\n}\n\nexport const meridiems = [\"AM\", \"PM\"];\n\nexport const erasLong = [\"Before Christ\", \"Anno Domini\"];\n\nexport const erasShort = [\"BC\", \"AD\"];\n\nexport const erasNarrow = [\"B\", \"A\"];\n\nexport function eras(length) {\n  switch (length) {\n    case \"narrow\":\n      return [...erasNarrow];\n    case \"short\":\n      return [...erasShort];\n    case \"long\":\n      return [...erasLong];\n    default:\n      return null;\n  }\n}\n\nexport function meridiemForDateTime(dt) {\n  return meridiems[dt.hour < 12 ? 0 : 1];\n}\n\nexport function weekdayForDateTime(dt, length) {\n  return weekdays(length)[dt.weekday - 1];\n}\n\nexport function monthForDateTime(dt, length) {\n  return months(length)[dt.month - 1];\n}\n\nexport function eraForDateTime(dt, length) {\n  return eras(length)[dt.year < 0 ? 0 : 1];\n}\n\nexport function formatRelativeTime(unit, count, numeric = \"always\", narrow = false) {\n  const units = {\n    years: [\"year\", \"yr.\"],\n    quarters: [\"quarter\", \"qtr.\"],\n    months: [\"month\", \"mo.\"],\n    weeks: [\"week\", \"wk.\"],\n    days: [\"day\", \"day\", \"days\"],\n    hours: [\"hour\", \"hr.\"],\n    minutes: [\"minute\", \"min.\"],\n    seconds: [\"second\", \"sec.\"],\n  };\n\n  const lastable = [\"hours\", \"minutes\", \"seconds\"].indexOf(unit) === -1;\n\n  if (numeric === \"auto\" && lastable) {\n    const isDay = unit === \"days\";\n    switch (count) {\n      case 1:\n        return isDay ? \"tomorrow\" : `next ${units[unit][0]}`;\n      case -1:\n        return isDay ? \"yesterday\" : `last ${units[unit][0]}`;\n      case 0:\n        return isDay ? \"today\" : `this ${units[unit][0]}`;\n      default: // fall through\n    }\n  }\n\n  const isInPast = Object.is(count, -0) || count < 0,\n    fmtValue = Math.abs(count),\n    singular = fmtValue === 1,\n    lilUnits = units[unit],\n    fmtUnit = narrow\n      ? singular\n        ? lilUnits[1]\n        : lilUnits[2] || lilUnits[1]\n      : singular\n      ? units[unit][0]\n      : unit;\n  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;\n}\n\nexport function formatString(knownFormat) {\n  // these all have the offsets removed because we don't have access to them\n  // without all the intl stuff this is backfilling\n  const filtered = pick(knownFormat, [\n      \"weekday\",\n      \"era\",\n      \"year\",\n      \"month\",\n      \"day\",\n      \"hour\",\n      \"minute\",\n      \"second\",\n      \"timeZoneName\",\n      \"hourCycle\",\n    ]),\n    key = stringify(filtered),\n    dateTimeHuge = \"EEEE, LLLL d, yyyy, h:mm a\";\n  switch (key) {\n    case stringify(Formats.DATE_SHORT):\n      return \"M/d/yyyy\";\n    case stringify(Formats.DATE_MED):\n      return \"LLL d, yyyy\";\n    case stringify(Formats.DATE_MED_WITH_WEEKDAY):\n      return \"EEE, LLL d, yyyy\";\n    case stringify(Formats.DATE_FULL):\n      return \"LLLL d, yyyy\";\n    case stringify(Formats.DATE_HUGE):\n      return \"EEEE, LLLL d, yyyy\";\n    case stringify(Formats.TIME_SIMPLE):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_SECONDS):\n      return \"h:mm:ss a\";\n    case stringify(Formats.TIME_WITH_SHORT_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_WITH_LONG_OFFSET):\n      return \"h:mm a\";\n    case stringify(Formats.TIME_24_SIMPLE):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_SECONDS):\n      return \"HH:mm:ss\";\n    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):\n      return \"HH:mm\";\n    case stringify(Formats.DATETIME_SHORT):\n      return \"M/d/yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_MED):\n      return \"LLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL):\n      return \"LLLL d, yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_HUGE):\n      return dateTimeHuge;\n    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):\n      return \"M/d/yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_SECONDS):\n      return \"LLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):\n      return \"EEE, d LLL yyyy, h:mm a\";\n    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):\n      return \"LLLL d, yyyy, h:mm:ss a\";\n    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):\n      return \"EEEE, LLLL d, yyyy, h:mm:ss a\";\n    default:\n      return dateTimeHuge;\n  }\n}\n","import * as English from \"./english.js\";\nimport * as Formats from \"./formats.js\";\nimport { padStart } from \"./util.js\";\n\nfunction stringifyTokens(splits, tokenToString) {\n  let s = \"\";\n  for (const token of splits) {\n    if (token.literal) {\n      s += token.val;\n    } else {\n      s += tokenToString(token.val);\n    }\n  }\n  return s;\n}\n\nconst macroTokenToFormatOpts = {\n  D: Formats.DATE_SHORT,\n  DD: Formats.DATE_MED,\n  DDD: Formats.DATE_FULL,\n  DDDD: Formats.DATE_HUGE,\n  t: Formats.TIME_SIMPLE,\n  tt: Formats.TIME_WITH_SECONDS,\n  ttt: Formats.TIME_WITH_SHORT_OFFSET,\n  tttt: Formats.TIME_WITH_LONG_OFFSET,\n  T: Formats.TIME_24_SIMPLE,\n  TT: Formats.TIME_24_WITH_SECONDS,\n  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,\n  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,\n  f: Formats.DATETIME_SHORT,\n  ff: Formats.DATETIME_MED,\n  fff: Formats.DATETIME_FULL,\n  ffff: Formats.DATETIME_HUGE,\n  F: Formats.DATETIME_SHORT_WITH_SECONDS,\n  FF: Formats.DATETIME_MED_WITH_SECONDS,\n  FFF: Formats.DATETIME_FULL_WITH_SECONDS,\n  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,\n};\n\n/**\n * @private\n */\n\nexport default class Formatter {\n  static create(locale, opts = {}) {\n    return new Formatter(locale, opts);\n  }\n\n  static parseFormat(fmt) {\n    // white-space is always considered a literal in user-provided formats\n    // the \" \" token has a special meaning (see unitForToken)\n\n    let current = null,\n      currentFull = \"\",\n      bracketed = false;\n    const splits = [];\n    for (let i = 0; i < fmt.length; i++) {\n      const c = fmt.charAt(i);\n      if (c === \"'\") {\n        // turn '' into a literal signal quote instead of just skipping the empty literal\n        if (currentFull.length > 0 || bracketed) {\n          splits.push({\n            literal: bracketed || /^\\s+$/.test(currentFull),\n            val: currentFull === \"\" ? \"'\" : currentFull,\n          });\n        }\n        current = null;\n        currentFull = \"\";\n        bracketed = !bracketed;\n      } else if (bracketed) {\n        currentFull += c;\n      } else if (c === current) {\n        currentFull += c;\n      } else {\n        if (currentFull.length > 0) {\n          splits.push({ literal: /^\\s+$/.test(currentFull), val: currentFull });\n        }\n        currentFull = c;\n        current = c;\n      }\n    }\n\n    if (currentFull.length > 0) {\n      splits.push({ literal: bracketed || /^\\s+$/.test(currentFull), val: currentFull });\n    }\n\n    return splits;\n  }\n\n  static macroTokenToFormatOpts(token) {\n    return macroTokenToFormatOpts[token];\n  }\n\n  constructor(locale, formatOpts) {\n    this.opts = formatOpts;\n    this.loc = locale;\n    this.systemLoc = null;\n  }\n\n  formatWithSystemDefault(dt, opts) {\n    if (this.systemLoc === null) {\n      this.systemLoc = this.loc.redefaultToSystem();\n    }\n    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });\n    return df.format();\n  }\n\n  dtFormatter(dt, opts = {}) {\n    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });\n  }\n\n  formatDateTime(dt, opts) {\n    return this.dtFormatter(dt, opts).format();\n  }\n\n  formatDateTimeParts(dt, opts) {\n    return this.dtFormatter(dt, opts).formatToParts();\n  }\n\n  formatInterval(interval, opts) {\n    const df = this.dtFormatter(interval.start, opts);\n    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());\n  }\n\n  resolvedOptions(dt, opts) {\n    return this.dtFormatter(dt, opts).resolvedOptions();\n  }\n\n  num(n, p = 0, signDisplay = undefined) {\n    // we get some perf out of doing this here, annoyingly\n    if (this.opts.forceSimple) {\n      return padStart(n, p);\n    }\n\n    const opts = { ...this.opts };\n\n    if (p > 0) {\n      opts.padTo = p;\n    }\n    if (signDisplay) {\n      opts.signDisplay = signDisplay;\n    }\n\n    return this.loc.numberFormatter(opts).format(n);\n  }\n\n  formatDateTimeFromString(dt, fmt) {\n    const knownEnglish = this.loc.listingMode() === \"en\",\n      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== \"gregory\",\n      string = (opts, extract) => this.loc.extract(dt, opts, extract),\n      formatOffset = (opts) => {\n        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {\n          return \"Z\";\n        }\n\n        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : \"\";\n      },\n      meridiem = () =>\n        knownEnglish\n          ? English.meridiemForDateTime(dt)\n          : string({ hour: \"numeric\", hourCycle: \"h12\" }, \"dayperiod\"),\n      month = (length, standalone) =>\n        knownEnglish\n          ? English.monthForDateTime(dt, length)\n          : string(standalone ? { month: length } : { month: length, day: \"numeric\" }, \"month\"),\n      weekday = (length, standalone) =>\n        knownEnglish\n          ? English.weekdayForDateTime(dt, length)\n          : string(\n              standalone ? { weekday: length } : { weekday: length, month: \"long\", day: \"numeric\" },\n              \"weekday\"\n            ),\n      maybeMacro = (token) => {\n        const formatOpts = Formatter.macroTokenToFormatOpts(token);\n        if (formatOpts) {\n          return this.formatWithSystemDefault(dt, formatOpts);\n        } else {\n          return token;\n        }\n      },\n      era = (length) =>\n        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, \"era\"),\n      tokenToString = (token) => {\n        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols\n        switch (token) {\n          // ms\n          case \"S\":\n            return this.num(dt.millisecond);\n          case \"u\":\n          // falls through\n          case \"SSS\":\n            return this.num(dt.millisecond, 3);\n          // seconds\n          case \"s\":\n            return this.num(dt.second);\n          case \"ss\":\n            return this.num(dt.second, 2);\n          // fractional seconds\n          case \"uu\":\n            return this.num(Math.floor(dt.millisecond / 10), 2);\n          case \"uuu\":\n            return this.num(Math.floor(dt.millisecond / 100));\n          // minutes\n          case \"m\":\n            return this.num(dt.minute);\n          case \"mm\":\n            return this.num(dt.minute, 2);\n          // hours\n          case \"h\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);\n          case \"hh\":\n            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);\n          case \"H\":\n            return this.num(dt.hour);\n          case \"HH\":\n            return this.num(dt.hour, 2);\n          // offset\n          case \"Z\":\n            // like +6\n            return formatOffset({ format: \"narrow\", allowZ: this.opts.allowZ });\n          case \"ZZ\":\n            // like +06:00\n            return formatOffset({ format: \"short\", allowZ: this.opts.allowZ });\n          case \"ZZZ\":\n            // like +0600\n            return formatOffset({ format: \"techie\", allowZ: this.opts.allowZ });\n          case \"ZZZZ\":\n            // like EST\n            return dt.zone.offsetName(dt.ts, { format: \"short\", locale: this.loc.locale });\n          case \"ZZZZZ\":\n            // like Eastern Standard Time\n            return dt.zone.offsetName(dt.ts, { format: \"long\", locale: this.loc.locale });\n          // zone\n          case \"z\":\n            // like America/New_York\n            return dt.zoneName;\n          // meridiems\n          case \"a\":\n            return meridiem();\n          // dates\n          case \"d\":\n            return useDateTimeFormatter ? string({ day: \"numeric\" }, \"day\") : this.num(dt.day);\n          case \"dd\":\n            return useDateTimeFormatter ? string({ day: \"2-digit\" }, \"day\") : this.num(dt.day, 2);\n          // weekdays - standalone\n          case \"c\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"ccc\":\n            // like 'Tues'\n            return weekday(\"short\", true);\n          case \"cccc\":\n            // like 'Tuesday'\n            return weekday(\"long\", true);\n          case \"ccccc\":\n            // like 'T'\n            return weekday(\"narrow\", true);\n          // weekdays - format\n          case \"E\":\n            // like 1\n            return this.num(dt.weekday);\n          case \"EEE\":\n            // like 'Tues'\n            return weekday(\"short\", false);\n          case \"EEEE\":\n            // like 'Tuesday'\n            return weekday(\"long\", false);\n          case \"EEEEE\":\n            // like 'T'\n            return weekday(\"narrow\", false);\n          // months - standalone\n          case \"L\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"LL\":\n            // like 01, doesn't seem to work\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\", day: \"numeric\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"LLL\":\n            // like Jan\n            return month(\"short\", true);\n          case \"LLLL\":\n            // like January\n            return month(\"long\", true);\n          case \"LLLLL\":\n            // like J\n            return month(\"narrow\", true);\n          // months - format\n          case \"M\":\n            // like 1\n            return useDateTimeFormatter\n              ? string({ month: \"numeric\" }, \"month\")\n              : this.num(dt.month);\n          case \"MM\":\n            // like 01\n            return useDateTimeFormatter\n              ? string({ month: \"2-digit\" }, \"month\")\n              : this.num(dt.month, 2);\n          case \"MMM\":\n            // like Jan\n            return month(\"short\", false);\n          case \"MMMM\":\n            // like January\n            return month(\"long\", false);\n          case \"MMMMM\":\n            // like J\n            return month(\"narrow\", false);\n          // years\n          case \"y\":\n            // like 2014\n            return useDateTimeFormatter ? string({ year: \"numeric\" }, \"year\") : this.num(dt.year);\n          case \"yy\":\n            // like 14\n            return useDateTimeFormatter\n              ? string({ year: \"2-digit\" }, \"year\")\n              : this.num(dt.year.toString().slice(-2), 2);\n          case \"yyyy\":\n            // like 0012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 4);\n          case \"yyyyyy\":\n            // like 000012\n            return useDateTimeFormatter\n              ? string({ year: \"numeric\" }, \"year\")\n              : this.num(dt.year, 6);\n          // eras\n          case \"G\":\n            // like AD\n            return era(\"short\");\n          case \"GG\":\n            // like Anno Domini\n            return era(\"long\");\n          case \"GGGGG\":\n            return era(\"narrow\");\n          case \"kk\":\n            return this.num(dt.weekYear.toString().slice(-2), 2);\n          case \"kkkk\":\n            return this.num(dt.weekYear, 4);\n          case \"W\":\n            return this.num(dt.weekNumber);\n          case \"WW\":\n            return this.num(dt.weekNumber, 2);\n          case \"n\":\n            return this.num(dt.localWeekNumber);\n          case \"nn\":\n            return this.num(dt.localWeekNumber, 2);\n          case \"ii\":\n            return this.num(dt.localWeekYear.toString().slice(-2), 2);\n          case \"iiii\":\n            return this.num(dt.localWeekYear, 4);\n          case \"o\":\n            return this.num(dt.ordinal);\n          case \"ooo\":\n            return this.num(dt.ordinal, 3);\n          case \"q\":\n            // like 1\n            return this.num(dt.quarter);\n          case \"qq\":\n            // like 01\n            return this.num(dt.quarter, 2);\n          case \"X\":\n            return this.num(Math.floor(dt.ts / 1000));\n          case \"x\":\n            return this.num(dt.ts);\n          default:\n            return maybeMacro(token);\n        }\n      };\n\n    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);\n  }\n\n  formatDurationFromString(dur, fmt) {\n    const invertLargest = this.opts.signMode === \"negativeLargestOnly\" ? -1 : 1;\n    const tokenToField = (token) => {\n        switch (token[0]) {\n          case \"S\":\n            return \"milliseconds\";\n          case \"s\":\n            return \"seconds\";\n          case \"m\":\n            return \"minutes\";\n          case \"h\":\n            return \"hours\";\n          case \"d\":\n            return \"days\";\n          case \"w\":\n            return \"weeks\";\n          case \"M\":\n            return \"months\";\n          case \"y\":\n            return \"years\";\n          default:\n            return null;\n        }\n      },\n      tokenToString = (lildur, info) => (token) => {\n        const mapped = tokenToField(token);\n        if (mapped) {\n          const inversionFactor =\n            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;\n          let signDisplay;\n          if (this.opts.signMode === \"negativeLargestOnly\" && mapped !== info.largestUnit) {\n            signDisplay = \"never\";\n          } else if (this.opts.signMode === \"all\") {\n            signDisplay = \"always\";\n          } else {\n            // \"auto\" and \"negative\" are the same, but \"auto\" has better support\n            signDisplay = \"auto\";\n          }\n          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);\n        } else {\n          return token;\n        }\n      },\n      tokens = Formatter.parseFormat(fmt),\n      realTokens = tokens.reduce(\n        (found, { literal, val }) => (literal ? found : found.concat(val)),\n        []\n      ),\n      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),\n      durationInfo = {\n        isNegativeDuration: collapsed < 0,\n        // this relies on \"collapsed\" being based on \"shiftTo\", which builds up the object\n        // in order\n        largestUnit: Object.keys(collapsed.values)[0],\n      };\n    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));\n  }\n}\n","import {\n  untruncateYear,\n  signedOffset,\n  parseInteger,\n  parseMillis,\n  isUndefined,\n  parseFloating,\n} from \"./util.js\";\nimport * as English from \"./english.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\n\n/*\n * This file handles parsing for well-specified formats. Here's how it works:\n * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.\n * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object\n * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.\n * Extractors can take a \"cursor\" representing the offset in the match to look at. This makes it easy to combine extractors.\n * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.\n * Some extractions are super dumb and simpleParse and fromStrings help DRY them.\n */\n\nconst ianaRegex = /[A-Za-z_+-]{1,256}(?::?\\/[A-Za-z0-9_+-]{1,256}(?:\\/[A-Za-z0-9_+-]{1,256})?)?/;\n\nfunction combineRegexes(...regexes) {\n  const full = regexes.reduce((f, r) => f + r.source, \"\");\n  return RegExp(`^${full}$`);\n}\n\nfunction combineExtractors(...extractors) {\n  return (m) =>\n    extractors\n      .reduce(\n        ([mergedVals, mergedZone, cursor], ex) => {\n          const [val, zone, next] = ex(m, cursor);\n          return [{ ...mergedVals, ...val }, zone || mergedZone, next];\n        },\n        [{}, null, 1]\n      )\n      .slice(0, 2);\n}\n\nfunction parse(s, ...patterns) {\n  if (s == null) {\n    return [null, null];\n  }\n\n  for (const [regex, extractor] of patterns) {\n    const m = regex.exec(s);\n    if (m) {\n      return extractor(m);\n    }\n  }\n  return [null, null];\n}\n\nfunction simpleParse(...keys) {\n  return (match, cursor) => {\n    const ret = {};\n    let i;\n\n    for (i = 0; i < keys.length; i++) {\n      ret[keys[i]] = parseInteger(match[cursor + i]);\n    }\n    return [ret, null, cursor + i];\n  };\n}\n\n// ISO and SQL parsing\nconst offsetRegex = /(?:([Zz])|([+-]\\d\\d)(?::?(\\d\\d))?)/;\nconst isoExtendedZone = `(?:${offsetRegex.source}?(?:\\\\[(${ianaRegex.source})\\\\])?)?`;\nconst isoTimeBaseRegex = /(\\d\\d)(?::?(\\d\\d)(?::?(\\d\\d)(?:[.,](\\d{1,30}))?)?)?/;\nconst isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);\nconst isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);\nconst isoYmdRegex = /([+-]\\d{6}|\\d{4})(?:-?(\\d\\d)(?:-?(\\d\\d))?)?/;\nconst isoWeekRegex = /(\\d{4})-?W(\\d\\d)(?:-?(\\d))?/;\nconst isoOrdinalRegex = /(\\d{4})-?(\\d{3})/;\nconst extractISOWeekData = simpleParse(\"weekYear\", \"weekNumber\", \"weekDay\");\nconst extractISOOrdinalData = simpleParse(\"year\", \"ordinal\");\nconst sqlYmdRegex = /(\\d{4})-(\\d\\d)-(\\d\\d)/; // dumbed-down version of the ISO one\nconst sqlTimeRegex = RegExp(\n  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`\n);\nconst sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);\n\nfunction int(match, pos, fallback) {\n  const m = match[pos];\n  return isUndefined(m) ? fallback : parseInteger(m);\n}\n\nfunction extractISOYmd(match, cursor) {\n  const item = {\n    year: int(match, cursor),\n    month: int(match, cursor + 1, 1),\n    day: int(match, cursor + 2, 1),\n  };\n\n  return [item, null, cursor + 3];\n}\n\nfunction extractISOTime(match, cursor) {\n  const item = {\n    hours: int(match, cursor, 0),\n    minutes: int(match, cursor + 1, 0),\n    seconds: int(match, cursor + 2, 0),\n    milliseconds: parseMillis(match[cursor + 3]),\n  };\n\n  return [item, null, cursor + 4];\n}\n\nfunction extractISOOffset(match, cursor) {\n  const local = !match[cursor] && !match[cursor + 1],\n    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),\n    zone = local ? null : FixedOffsetZone.instance(fullOffset);\n  return [{}, zone, cursor + 3];\n}\n\nfunction extractIANAZone(match, cursor) {\n  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;\n  return [{}, zone, cursor + 1];\n}\n\n// ISO time parsing\n\nconst isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);\n\n// ISO duration parsing\n\nconst isoDuration =\n  /^-?P(?:(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)Y)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)W)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)D)?(?:T(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)H)?(?:(-?\\d{1,20}(?:\\.\\d{1,20})?)M)?(?:(-?\\d{1,20})(?:[.,](-?\\d{1,20}))?S)?)?)$/;\n\nfunction extractISODuration(match) {\n  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =\n    match;\n\n  const hasNegativePrefix = s[0] === \"-\";\n  const negativeSeconds = secondStr && secondStr[0] === \"-\";\n\n  const maybeNegate = (num, force = false) =>\n    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;\n\n  return [\n    {\n      years: maybeNegate(parseFloating(yearStr)),\n      months: maybeNegate(parseFloating(monthStr)),\n      weeks: maybeNegate(parseFloating(weekStr)),\n      days: maybeNegate(parseFloating(dayStr)),\n      hours: maybeNegate(parseFloating(hourStr)),\n      minutes: maybeNegate(parseFloating(minuteStr)),\n      seconds: maybeNegate(parseFloating(secondStr), secondStr === \"-0\"),\n      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),\n    },\n  ];\n}\n\n// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York\n// and not just that we're in -240 *right now*. But since I don't think these are used that often\n// I'm just going to ignore that\nconst obsOffsets = {\n  GMT: 0,\n  EDT: -4 * 60,\n  EST: -5 * 60,\n  CDT: -5 * 60,\n  CST: -6 * 60,\n  MDT: -6 * 60,\n  MST: -7 * 60,\n  PDT: -7 * 60,\n  PST: -8 * 60,\n};\n\nfunction fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {\n  const result = {\n    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),\n    month: English.monthsShort.indexOf(monthStr) + 1,\n    day: parseInteger(dayStr),\n    hour: parseInteger(hourStr),\n    minute: parseInteger(minuteStr),\n  };\n\n  if (secondStr) result.second = parseInteger(secondStr);\n  if (weekdayStr) {\n    result.weekday =\n      weekdayStr.length > 3\n        ? English.weekdaysLong.indexOf(weekdayStr) + 1\n        : English.weekdaysShort.indexOf(weekdayStr) + 1;\n  }\n\n  return result;\n}\n\n// RFC 2822/5322\nconst rfc2822 =\n  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\\s)?(\\d{1,2})\\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\\s(\\d{2,4})\\s(\\d\\d):(\\d\\d)(?::(\\d\\d))?\\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\\d\\d)(\\d\\d)))$/;\n\nfunction extractRFC2822(match) {\n  const [\n      ,\n      weekdayStr,\n      dayStr,\n      monthStr,\n      yearStr,\n      hourStr,\n      minuteStr,\n      secondStr,\n      obsOffset,\n      milOffset,\n      offHourStr,\n      offMinuteStr,\n    ] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n\n  let offset;\n  if (obsOffset) {\n    offset = obsOffsets[obsOffset];\n  } else if (milOffset) {\n    offset = 0;\n  } else {\n    offset = signedOffset(offHourStr, offMinuteStr);\n  }\n\n  return [result, new FixedOffsetZone(offset)];\n}\n\nfunction preprocessRFC2822(s) {\n  // Remove comments and folding whitespace and replace multiple-spaces with a single space\n  return s\n    .replace(/\\([^()]*\\)|[\\n\\t]/g, \" \")\n    .replace(/(\\s\\s+)/g, \" \")\n    .trim();\n}\n\n// http date\n\nconst rfc1123 =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\\d\\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\\d{4}) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  rfc850 =\n    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\\d\\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) GMT$/,\n  ascii =\n    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \\d|\\d\\d) (\\d\\d):(\\d\\d):(\\d\\d) (\\d{4})$/;\n\nfunction extractRFC1123Or850(match) {\n  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nfunction extractASCII(match) {\n  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,\n    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);\n  return [result, FixedOffsetZone.utcInstance];\n}\n\nconst isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);\nconst isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);\nconst isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);\nconst isoTimeCombinedRegex = combineRegexes(isoTimeRegex);\n\nconst extractISOYmdTimeAndOffset = combineExtractors(\n  extractISOYmd,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOWeekTimeAndOffset = combineExtractors(\n  extractISOWeekData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOOrdinalDateAndTime = combineExtractors(\n  extractISOOrdinalData,\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\nconst extractISOTimeAndOffset = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\n/*\n * @private\n */\n\nexport function parseISODate(s) {\n  return parse(\n    s,\n    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],\n    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],\n    [isoTimeCombinedRegex, extractISOTimeAndOffset]\n  );\n}\n\nexport function parseRFC2822Date(s) {\n  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);\n}\n\nexport function parseHTTPDate(s) {\n  return parse(\n    s,\n    [rfc1123, extractRFC1123Or850],\n    [rfc850, extractRFC1123Or850],\n    [ascii, extractASCII]\n  );\n}\n\nexport function parseISODuration(s) {\n  return parse(s, [isoDuration, extractISODuration]);\n}\n\nconst extractISOTimeOnly = combineExtractors(extractISOTime);\n\nexport function parseISOTimeOnly(s) {\n  return parse(s, [isoTimeOnly, extractISOTimeOnly]);\n}\n\nconst sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);\nconst sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);\n\nconst extractISOTimeOffsetAndIANAZone = combineExtractors(\n  extractISOTime,\n  extractISOOffset,\n  extractIANAZone\n);\n\nexport function parseSQL(s) {\n  return parse(\n    s,\n    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],\n    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]\n  );\n}\n","import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from \"./errors.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Locale from \"./impl/locale.js\";\nimport { parseISODuration, parseISOTimeOnly } from \"./impl/regexParser.js\";\nimport {\n  asNumber,\n  hasOwnProperty,\n  isNumber,\n  isUndefined,\n  normalizeObject,\n  roundTo,\n} from \"./impl/util.js\";\nimport Settings from \"./settings.js\";\nimport DateTime from \"./datetime.js\";\n\nconst INVALID = \"Invalid Duration\";\n\n// unit conversion constants\nexport const lowOrderMatrix = {\n    weeks: {\n      days: 7,\n      hours: 7 * 24,\n      minutes: 7 * 24 * 60,\n      seconds: 7 * 24 * 60 * 60,\n      milliseconds: 7 * 24 * 60 * 60 * 1000,\n    },\n    days: {\n      hours: 24,\n      minutes: 24 * 60,\n      seconds: 24 * 60 * 60,\n      milliseconds: 24 * 60 * 60 * 1000,\n    },\n    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },\n    minutes: { seconds: 60, milliseconds: 60 * 1000 },\n    seconds: { milliseconds: 1000 },\n  },\n  casualMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: 52,\n      days: 365,\n      hours: 365 * 24,\n      minutes: 365 * 24 * 60,\n      seconds: 365 * 24 * 60 * 60,\n      milliseconds: 365 * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: 13,\n      days: 91,\n      hours: 91 * 24,\n      minutes: 91 * 24 * 60,\n      seconds: 91 * 24 * 60 * 60,\n      milliseconds: 91 * 24 * 60 * 60 * 1000,\n    },\n    months: {\n      weeks: 4,\n      days: 30,\n      hours: 30 * 24,\n      minutes: 30 * 24 * 60,\n      seconds: 30 * 24 * 60 * 60,\n      milliseconds: 30 * 24 * 60 * 60 * 1000,\n    },\n\n    ...lowOrderMatrix,\n  },\n  daysInYearAccurate = 146097.0 / 400,\n  daysInMonthAccurate = 146097.0 / 4800,\n  accurateMatrix = {\n    years: {\n      quarters: 4,\n      months: 12,\n      weeks: daysInYearAccurate / 7,\n      days: daysInYearAccurate,\n      hours: daysInYearAccurate * 24,\n      minutes: daysInYearAccurate * 24 * 60,\n      seconds: daysInYearAccurate * 24 * 60 * 60,\n      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,\n    },\n    quarters: {\n      months: 3,\n      weeks: daysInYearAccurate / 28,\n      days: daysInYearAccurate / 4,\n      hours: (daysInYearAccurate * 24) / 4,\n      minutes: (daysInYearAccurate * 24 * 60) / 4,\n      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,\n      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,\n    },\n    months: {\n      weeks: daysInMonthAccurate / 7,\n      days: daysInMonthAccurate,\n      hours: daysInMonthAccurate * 24,\n      minutes: daysInMonthAccurate * 24 * 60,\n      seconds: daysInMonthAccurate * 24 * 60 * 60,\n      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,\n    },\n    ...lowOrderMatrix,\n  };\n\n// units ordered by size\nconst orderedUnits = [\n  \"years\",\n  \"quarters\",\n  \"months\",\n  \"weeks\",\n  \"days\",\n  \"hours\",\n  \"minutes\",\n  \"seconds\",\n  \"milliseconds\",\n];\n\nconst reverseUnits = orderedUnits.slice(0).reverse();\n\n// clone really means \"create another instance just like this one, but with these changes\"\nfunction clone(dur, alts, clear = false) {\n  // deep merge for vals\n  const conf = {\n    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },\n    loc: dur.loc.clone(alts.loc),\n    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,\n    matrix: alts.matrix || dur.matrix,\n  };\n  return new Duration(conf);\n}\n\nfunction durationToMillis(matrix, vals) {\n  let sum = vals.milliseconds ?? 0;\n  for (const unit of reverseUnits.slice(1)) {\n    if (vals[unit]) {\n      sum += vals[unit] * matrix[unit][\"milliseconds\"];\n    }\n  }\n  return sum;\n}\n\n// NB: mutates parameters\nfunction normalizeValues(matrix, vals) {\n  // the logic below assumes the overall value of the duration is positive\n  // if this is not the case, factor is used to make it so\n  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;\n\n  orderedUnits.reduceRight((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const previousVal = vals[previous] * factor;\n        const conv = matrix[current][previous];\n\n        // if (previousVal < 0):\n        // lower order unit is negative (e.g. { years: 2, days: -2 })\n        // normalize this by reducing the higher order unit by the appropriate amount\n        // and increasing the lower order unit\n        // this can never make the higher order unit negative, because this function only operates\n        // on positive durations, so the amount of time represented by the lower order unit cannot\n        // be larger than the higher order unit\n        // else:\n        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })\n        // in this case we attempt to convert as much as possible from the lower order unit into\n        // the higher order one\n        //\n        // Math.floor takes care of both of these cases, rounding away from 0\n        // if previousVal < 0 it makes the absolute value larger\n        // if previousVal >= it makes the absolute value smaller\n        const rollUp = Math.floor(previousVal / conv);\n        vals[current] += rollUp * factor;\n        vals[previous] -= rollUp * conv * factor;\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n\n  // try to convert any decimals into smaller units if possible\n  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }\n  orderedUnits.reduce((previous, current) => {\n    if (!isUndefined(vals[current])) {\n      if (previous) {\n        const fraction = vals[previous] % 1;\n        vals[previous] -= fraction;\n        vals[current] += fraction * matrix[previous][current];\n      }\n      return current;\n    } else {\n      return previous;\n    }\n  }, null);\n}\n\n// Remove all properties with a value of 0 from an object\nfunction removeZeroes(vals) {\n  const newVals = {};\n  for (const [key, value] of Object.entries(vals)) {\n    if (value !== 0) {\n      newVals[key] = value;\n    }\n  }\n  return newVals;\n}\n\n/**\n * A Duration object represents a period of time, like \"2 months\" or \"1 day, 1 hour\". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.\n *\n * Here is a brief overview of commonly used methods and getters in Duration:\n *\n * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.\n * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.\n * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.\n * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.\n * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}\n *\n * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.\n */\nexport default class Duration {\n  /**\n   * @private\n   */\n  constructor(config) {\n    const accurate = config.conversionAccuracy === \"longterm\" || false;\n    let matrix = accurate ? accurateMatrix : casualMatrix;\n\n    if (config.matrix) {\n      matrix = config.matrix;\n    }\n\n    /**\n     * @access private\n     */\n    this.values = config.values;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.conversionAccuracy = accurate ? \"longterm\" : \"casual\";\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.matrix = matrix;\n    /**\n     * @access private\n     */\n    this.isLuxonDuration = true;\n  }\n\n  /**\n   * Create Duration from a number of milliseconds.\n   * @param {number} count of milliseconds\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  static fromMillis(count, opts) {\n    return Duration.fromObject({ milliseconds: count }, opts);\n  }\n\n  /**\n   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.\n   * If this object is empty then a zero milliseconds duration is returned.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.years\n   * @param {number} obj.quarters\n   * @param {number} obj.months\n   * @param {number} obj.weeks\n   * @param {number} obj.days\n   * @param {number} obj.hours\n   * @param {number} obj.minutes\n   * @param {number} obj.seconds\n   * @param {number} obj.milliseconds\n   * @param {Object} [opts=[]] - options for creating this Duration\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the custom conversion system to use\n   * @return {Duration}\n   */\n  static fromObject(obj, opts = {}) {\n    if (obj == null || typeof obj !== \"object\") {\n      throw new InvalidArgumentError(\n        `Duration.fromObject: argument expected to be an object, got ${\n          obj === null ? \"null\" : typeof obj\n        }`\n      );\n    }\n\n    return new Duration({\n      values: normalizeObject(obj, Duration.normalizeUnit),\n      loc: Locale.fromObject(opts),\n      conversionAccuracy: opts.conversionAccuracy,\n      matrix: opts.matrix,\n    });\n  }\n\n  /**\n   * Create a Duration from DurationLike.\n   *\n   * @param {Object | number | Duration} durationLike\n   * One of:\n   * - object with keys like 'years' and 'hours'.\n   * - number representing milliseconds\n   * - Duration instance\n   * @return {Duration}\n   */\n  static fromDurationLike(durationLike) {\n    if (isNumber(durationLike)) {\n      return Duration.fromMillis(durationLike);\n    } else if (Duration.isDuration(durationLike)) {\n      return durationLike;\n    } else if (typeof durationLike === \"object\") {\n      return Duration.fromObject(durationLike);\n    } else {\n      throw new InvalidArgumentError(\n        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`\n      );\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 duration string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the preset conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }\n   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }\n   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }\n   * @return {Duration}\n   */\n  static fromISO(text, opts) {\n    const [parsed] = parseISODuration(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create a Duration from an ISO 8601 time string.\n   * @param {string} text - text to parse\n   * @param {Object} opts - options for parsing\n   * @param {string} [opts.locale='en-US'] - the locale to use\n   * @param {string} opts.numberingSystem - the numbering system to use\n   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use\n   * @param {string} [opts.matrix=Object] - the conversion system to use\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }\n   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }\n   * @return {Duration}\n   */\n  static fromISOTime(text, opts) {\n    const [parsed] = parseISOTimeOnly(text);\n    if (parsed) {\n      return Duration.fromObject(parsed, opts);\n    } else {\n      return Duration.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n    }\n  }\n\n  /**\n   * Create an invalid Duration.\n   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Duration}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Duration is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDurationError(invalid);\n    } else {\n      return new Duration({ invalid });\n    }\n  }\n\n  /**\n   * @private\n   */\n  static normalizeUnit(unit) {\n    const normalized = {\n      year: \"years\",\n      years: \"years\",\n      quarter: \"quarters\",\n      quarters: \"quarters\",\n      month: \"months\",\n      months: \"months\",\n      week: \"weeks\",\n      weeks: \"weeks\",\n      day: \"days\",\n      days: \"days\",\n      hour: \"hours\",\n      hours: \"hours\",\n      minute: \"minutes\",\n      minutes: \"minutes\",\n      second: \"seconds\",\n      seconds: \"seconds\",\n      millisecond: \"milliseconds\",\n      milliseconds: \"milliseconds\",\n    }[unit ? unit.toLowerCase() : unit];\n\n    if (!normalized) throw new InvalidUnitError(unit);\n\n    return normalized;\n  }\n\n  /**\n   * Check if an object is a Duration. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDuration(o) {\n    return (o && o.isLuxonDuration) || false;\n  }\n\n  /**\n   * Get  the locale of a Duration, such 'en-GB'\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:\n   * * `S` for milliseconds\n   * * `s` for seconds\n   * * `m` for minutes\n   * * `h` for hours\n   * * `d` for days\n   * * `w` for weeks\n   * * `M` for months\n   * * `y` for years\n   * Notes:\n   * * Add padding by repeating the token, e.g. \"yy\" pads the years to two digits, \"hhhh\" pads the hours out to four digits\n   * * Tokens can be escaped by wrapping with single quotes.\n   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - options\n   * @param {boolean} [opts.floor=true] - floor numerical values\n   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"y d s\") //=> \"1 6 2\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"yy dd sss\") //=> \"01 06 002\"\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat(\"M S\") //=> \"12 518402000\"\n   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"+6 +2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"all\" }) //=> \"-6 -2\"\n   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat(\"d s\", { signMode: \"negativeLargestOnly\" }) //=> \"-6 2\"\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    // reverse-compat since 1.2; we always round down now, never up, and we do it by default\n    const fmtOpts = {\n      ...opts,\n      floor: opts.round !== false && opts.floor !== false,\n    };\n    return this.isValid\n      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a string representation of a Duration with all units included.\n   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options\n   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.\n   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.\n   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero\n   * @example\n   * ```js\n   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })\n   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'\n   * dur.toHuman({ listStyle: \"long\" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'\n   * dur.toHuman({ unitDisplay: \"short\" }) //=> '1 mth, 0 wks, 5 hr, 6 min'\n   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'\n   * ```\n   */\n  toHuman(opts = {}) {\n    if (!this.isValid) return INVALID;\n\n    const showZeros = opts.showZeros !== false;\n\n    const l = orderedUnits\n      .map((unit) => {\n        const val = this.values[unit];\n        if (isUndefined(val) || (val === 0 && !showZeros)) {\n          return null;\n        }\n        return this.loc\n          .numberFormatter({ style: \"unit\", unitDisplay: \"long\", ...opts, unit: unit.slice(0, -1) })\n          .format(val);\n      })\n      .filter((n) => n);\n\n    return this.loc\n      .listFormatter({ type: \"conjunction\", style: opts.listStyle || \"narrow\", ...opts })\n      .format(l);\n  }\n\n  /**\n   * Returns a JavaScript object with this Duration's values.\n   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }\n   * @return {Object}\n   */\n  toObject() {\n    if (!this.isValid) return {};\n    return { ...this.values };\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations\n   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'\n   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'\n   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'\n   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'\n   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'\n   * @return {string}\n   */\n  toISO() {\n    // we could use the formatter, but this is an easier way to get the minimum string\n    if (!this.isValid) return null;\n\n    let s = \"P\";\n    if (this.years !== 0) s += this.years + \"Y\";\n    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + \"M\";\n    if (this.weeks !== 0) s += this.weeks + \"W\";\n    if (this.days !== 0) s += this.days + \"D\";\n    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)\n      s += \"T\";\n    if (this.hours !== 0) s += this.hours + \"H\";\n    if (this.minutes !== 0) s += this.minutes + \"M\";\n    if (this.seconds !== 0 || this.milliseconds !== 0)\n      // this will handle \"floating point madness\" by removing extra decimal places\n      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken\n      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + \"S\";\n    if (s === \"P\") s += \"T0S\";\n    return s;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.\n   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Times\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'\n   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'\n   * @return {string}\n   */\n  toISOTime(opts = {}) {\n    if (!this.isValid) return null;\n\n    const millis = this.toMillis();\n    if (millis < 0 || millis >= 86400000) return null;\n\n    opts = {\n      suppressMilliseconds: false,\n      suppressSeconds: false,\n      includePrefix: false,\n      format: \"extended\",\n      ...opts,\n      includeOffset: false,\n    };\n\n    const dateTime = DateTime.fromMillis(millis, { zone: \"UTC\" });\n    return dateTime.toISOTime(opts);\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.\n   * @return {string}\n   */\n  toString() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a string representation of this Duration appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Duration { values: ${JSON.stringify(this.values)} }`;\n    } else {\n      return `Duration { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration.\n   * @return {number}\n   */\n  toMillis() {\n    if (!this.isValid) return NaN;\n\n    return durationToMillis(this.matrix, this.values);\n  }\n\n  /**\n   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration),\n      result = {};\n\n    for (const k of orderedUnits) {\n      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {\n        result[k] = dur.get(k) + this.get(k);\n      }\n    }\n\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @return {Duration}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n\n    const dur = Duration.fromDurationLike(duration);\n    return this.plus(dur.negate());\n  }\n\n  /**\n   * Scale this Duration by the specified amount. Return a newly-constructed Duration.\n   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }\n   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === \"hours\" ? x * 2 : x) //=> { hours: 2, minutes: 30 }\n   * @return {Duration}\n   */\n  mapUnits(fn) {\n    if (!this.isValid) return this;\n    const result = {};\n    for (const k of Object.keys(this.values)) {\n      result[k] = asNumber(fn(this.values[k], k));\n    }\n    return clone(this, { values: result }, true);\n  }\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2\n   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0\n   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3\n   * @return {number}\n   */\n  get(unit) {\n    return this[Duration.normalizeUnit(unit)];\n  }\n\n  /**\n   * \"Set\" the values of specified units. Return a newly-constructed Duration.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dur.set({ years: 2017 })\n   * @example dur.set({ hours: 8, minutes: 30 })\n   * @return {Duration}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };\n    return clone(this, { values: mixed });\n  }\n\n  /**\n   * \"Set\" the locale and/or numberingSystem.  Returns a newly-constructed Duration.\n   * @example dur.reconfigure({ locale: 'en-GB' })\n   * @return {Duration}\n   */\n  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem });\n    const opts = { loc, matrix, conversionAccuracy };\n    return clone(this, opts);\n  }\n\n  /**\n   * Return the length of the duration in the specified unit.\n   * @param {string} unit - a unit such as 'minutes' or 'days'\n   * @example Duration.fromObject({years: 1}).as('days') //=> 365\n   * @example Duration.fromObject({years: 1}).as('months') //=> 12\n   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5\n   * @return {number}\n   */\n  as(unit) {\n    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;\n  }\n\n  /**\n   * Reduce this Duration to its canonical representation in its current units.\n   * Assuming the overall value of the Duration is positive, this means:\n   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)\n   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise\n   *   the overall value would be negative, see third example)\n   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)\n   *\n   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.\n   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }\n   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }\n   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }\n   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }\n   * @return {Duration}\n   */\n  normalize() {\n    if (!this.isValid) return this;\n    const vals = this.toObject();\n    normalizeValues(this.matrix, vals);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Rescale units to its largest representation\n   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }\n   * @return {Duration}\n   */\n  rescale() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.normalize().shiftToAll().toObject());\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Convert this Duration into its representation in a different set of units.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }\n   * @return {Duration}\n   */\n  shiftTo(...units) {\n    if (!this.isValid) return this;\n\n    if (units.length === 0) {\n      return this;\n    }\n\n    units = units.map((u) => Duration.normalizeUnit(u));\n\n    const built = {},\n      accumulated = {},\n      vals = this.toObject();\n    let lastUnit;\n\n    for (const k of orderedUnits) {\n      if (units.indexOf(k) >= 0) {\n        lastUnit = k;\n\n        let own = 0;\n\n        // anything we haven't boiled down yet should get boiled to this unit\n        for (const ak in accumulated) {\n          own += this.matrix[ak][k] * accumulated[ak];\n          accumulated[ak] = 0;\n        }\n\n        // plus anything that's already in this unit\n        if (isNumber(vals[k])) {\n          own += vals[k];\n        }\n\n        // only keep the integer part for now in the hopes of putting any decimal part\n        // into a smaller unit later\n        const i = Math.trunc(own);\n        built[k] = i;\n        accumulated[k] = (own * 1000 - i * 1000) / 1000;\n\n        // otherwise, keep it in the wings to boil it later\n      } else if (isNumber(vals[k])) {\n        accumulated[k] = vals[k];\n      }\n    }\n\n    // anything leftover becomes the decimal for the last unit\n    // lastUnit must be defined since units is not empty\n    for (const key in accumulated) {\n      if (accumulated[key] !== 0) {\n        built[lastUnit] +=\n          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];\n      }\n    }\n\n    normalizeValues(this.matrix, built);\n    return clone(this, { values: built }, true);\n  }\n\n  /**\n   * Shift this Duration to all available units.\n   * Same as shiftTo(\"years\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", \"seconds\", \"milliseconds\")\n   * @return {Duration}\n   */\n  shiftToAll() {\n    if (!this.isValid) return this;\n    return this.shiftTo(\n      \"years\",\n      \"months\",\n      \"weeks\",\n      \"days\",\n      \"hours\",\n      \"minutes\",\n      \"seconds\",\n      \"milliseconds\"\n    );\n  }\n\n  /**\n   * Return the negative of this Duration.\n   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }\n   * @return {Duration}\n   */\n  negate() {\n    if (!this.isValid) return this;\n    const negated = {};\n    for (const k of Object.keys(this.values)) {\n      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];\n    }\n    return clone(this, { values: negated }, true);\n  }\n\n  /**\n   * Removes all units with values equal to 0 from this Duration.\n   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }\n   * @return {Duration}\n   */\n  removeZeros() {\n    if (!this.isValid) return this;\n    const vals = removeZeroes(this.values);\n    return clone(this, { values: vals }, true);\n  }\n\n  /**\n   * Get the years.\n   * @type {number}\n   */\n  get years() {\n    return this.isValid ? this.values.years || 0 : NaN;\n  }\n\n  /**\n   * Get the quarters.\n   * @type {number}\n   */\n  get quarters() {\n    return this.isValid ? this.values.quarters || 0 : NaN;\n  }\n\n  /**\n   * Get the months.\n   * @type {number}\n   */\n  get months() {\n    return this.isValid ? this.values.months || 0 : NaN;\n  }\n\n  /**\n   * Get the weeks\n   * @type {number}\n   */\n  get weeks() {\n    return this.isValid ? this.values.weeks || 0 : NaN;\n  }\n\n  /**\n   * Get the days.\n   * @type {number}\n   */\n  get days() {\n    return this.isValid ? this.values.days || 0 : NaN;\n  }\n\n  /**\n   * Get the hours.\n   * @type {number}\n   */\n  get hours() {\n    return this.isValid ? this.values.hours || 0 : NaN;\n  }\n\n  /**\n   * Get the minutes.\n   * @type {number}\n   */\n  get minutes() {\n    return this.isValid ? this.values.minutes || 0 : NaN;\n  }\n\n  /**\n   * Get the seconds.\n   * @return {number}\n   */\n  get seconds() {\n    return this.isValid ? this.values.seconds || 0 : NaN;\n  }\n\n  /**\n   * Get the milliseconds.\n   * @return {number}\n   */\n  get milliseconds() {\n    return this.isValid ? this.values.milliseconds || 0 : NaN;\n  }\n\n  /**\n   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations\n   * on invalid DateTimes or Intervals.\n   * @return {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this Duration became invalid, or null if the Duration is valid\n   * @return {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Equality check\n   * Two Durations are equal iff they have the same units and the same values for each unit.\n   * @param {Duration} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    if (!this.loc.equals(other.loc)) {\n      return false;\n    }\n\n    function eq(v1, v2) {\n      // Consider 0 and undefined as equal\n      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;\n      return v1 === v2;\n    }\n\n    for (const u of orderedUnits) {\n      if (!eq(this.values[u], other.values[u])) {\n        return false;\n      }\n    }\n    return true;\n  }\n}\n","import DateTime, { friendlyDateTime } from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Settings from \"./settings.js\";\nimport { InvalidArgumentError, InvalidIntervalError } from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport * as Formats from \"./impl/formats.js\";\n\nconst INVALID = \"Invalid Interval\";\n\n// checks if the start is equal to or before the end\nfunction validateStartEnd(start, end) {\n  if (!start || !start.isValid) {\n    return Interval.invalid(\"missing or invalid start\");\n  } else if (!end || !end.isValid) {\n    return Interval.invalid(\"missing or invalid end\");\n  } else if (end < start) {\n    return Interval.invalid(\n      \"end before start\",\n      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`\n    );\n  } else {\n    return null;\n  }\n}\n\n/**\n * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.\n *\n * Here is a brief overview of the most commonly used methods and getters in Interval:\n *\n * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.\n * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.\n * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.\n * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.\n * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}\n * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.\n */\nexport default class Interval {\n  /**\n   * @private\n   */\n  constructor(config) {\n    /**\n     * @access private\n     */\n    this.s = config.start;\n    /**\n     * @access private\n     */\n    this.e = config.end;\n    /**\n     * @access private\n     */\n    this.invalid = config.invalid || null;\n    /**\n     * @access private\n     */\n    this.isLuxonInterval = true;\n  }\n\n  /**\n   * Create an invalid Interval.\n   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {Interval}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the Interval is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidIntervalError(invalid);\n    } else {\n      return new Interval({ invalid });\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.\n   * @param {DateTime|Date|Object} start\n   * @param {DateTime|Date|Object} end\n   * @return {Interval}\n   */\n  static fromDateTimes(start, end) {\n    const builtStart = friendlyDateTime(start),\n      builtEnd = friendlyDateTime(end);\n\n    const validateError = validateStartEnd(builtStart, builtEnd);\n\n    if (validateError == null) {\n      return new Interval({\n        start: builtStart,\n        end: builtEnd,\n      });\n    } else {\n      return validateError;\n    }\n  }\n\n  /**\n   * Create an Interval from a start DateTime and a Duration to extend to.\n   * @param {DateTime|Date|Object} start\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static after(start, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(start);\n    return Interval.fromDateTimes(dt, dt.plus(dur));\n  }\n\n  /**\n   * Create an Interval from an end DateTime and a Duration to extend backwards to.\n   * @param {DateTime|Date|Object} end\n   * @param {Duration|Object|number} duration - the length of the Interval.\n   * @return {Interval}\n   */\n  static before(end, duration) {\n    const dur = Duration.fromDurationLike(duration),\n      dt = friendlyDateTime(end);\n    return Interval.fromDateTimes(dt.minus(dur), dt);\n  }\n\n  /**\n   * Create an Interval from an ISO 8601 string.\n   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.\n   * @param {string} text - the ISO string to parse\n   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {Interval}\n   */\n  static fromISO(text, opts) {\n    const [s, e] = (text || \"\").split(\"/\", 2);\n    if (s && e) {\n      let start, startIsValid;\n      try {\n        start = DateTime.fromISO(s, opts);\n        startIsValid = start.isValid;\n      } catch (e) {\n        startIsValid = false;\n      }\n\n      let end, endIsValid;\n      try {\n        end = DateTime.fromISO(e, opts);\n        endIsValid = end.isValid;\n      } catch (e) {\n        endIsValid = false;\n      }\n\n      if (startIsValid && endIsValid) {\n        return Interval.fromDateTimes(start, end);\n      }\n\n      if (startIsValid) {\n        const dur = Duration.fromISO(e, opts);\n        if (dur.isValid) {\n          return Interval.after(start, dur);\n        }\n      } else if (endIsValid) {\n        const dur = Duration.fromISO(s, opts);\n        if (dur.isValid) {\n          return Interval.before(end, dur);\n        }\n      }\n    }\n    return Interval.invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ISO 8601`);\n  }\n\n  /**\n   * Check if an object is an Interval. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isInterval(o) {\n    return (o && o.isLuxonInterval) || false;\n  }\n\n  /**\n   * Returns the start of the Interval\n   * @type {DateTime}\n   */\n  get start() {\n    return this.isValid ? this.s : null;\n  }\n\n  /**\n   * Returns the end of the Interval. This is the first instant which is not part of the interval\n   * (Interval is half-open).\n   * @type {DateTime}\n   */\n  get end() {\n    return this.isValid ? this.e : null;\n  }\n\n  /**\n   * Returns the last DateTime included in the interval (since end is not part of the interval)\n   * @type {DateTime}\n   */\n  get lastDateTime() {\n    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;\n  }\n\n  /**\n   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalidReason === null;\n  }\n\n  /**\n   * Returns an error code if this Interval is invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Returns the length of the Interval in the specified unit.\n   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.\n   * @return {number}\n   */\n  length(unit = \"milliseconds\") {\n    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;\n  }\n\n  /**\n   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.\n   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'\n   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'\n   * @param {string} [unit='milliseconds'] - the unit of time to count.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime\n   * @return {number}\n   */\n  count(unit = \"milliseconds\", opts) {\n    if (!this.isValid) return NaN;\n    const start = this.start.startOf(unit, opts);\n    let end;\n    if (opts?.useLocaleWeeks) {\n      end = this.end.reconfigure({ locale: start.locale });\n    } else {\n      end = this.end;\n    }\n    end = end.startOf(unit, opts);\n    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());\n  }\n\n  /**\n   * Returns whether this Interval's start and end are both in the same unit of time\n   * @param {string} unit - the unit of time to check sameness on\n   * @return {boolean}\n   */\n  hasSame(unit) {\n    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end DateTimes.\n   * @return {boolean}\n   */\n  isEmpty() {\n    return this.s.valueOf() === this.e.valueOf();\n  }\n\n  /**\n   * Return whether this Interval's start is after the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isAfter(dateTime) {\n    if (!this.isValid) return false;\n    return this.s > dateTime;\n  }\n\n  /**\n   * Return whether this Interval's end is before the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  isBefore(dateTime) {\n    if (!this.isValid) return false;\n    return this.e <= dateTime;\n  }\n\n  /**\n   * Return whether this Interval contains the specified DateTime.\n   * @param {DateTime} dateTime\n   * @return {boolean}\n   */\n  contains(dateTime) {\n    if (!this.isValid) return false;\n    return this.s <= dateTime && this.e > dateTime;\n  }\n\n  /**\n   * \"Sets\" the start and/or end dates. Returns a newly-constructed Interval.\n   * @param {Object} values - the values to set\n   * @param {DateTime} values.start - the starting DateTime\n   * @param {DateTime} values.end - the ending DateTime\n   * @return {Interval}\n   */\n  set({ start, end } = {}) {\n    if (!this.isValid) return this;\n    return Interval.fromDateTimes(start || this.s, end || this.e);\n  }\n\n  /**\n   * Split this Interval at each of the specified DateTimes\n   * @param {...DateTime} dateTimes - the unit of time to count.\n   * @return {Array}\n   */\n  splitAt(...dateTimes) {\n    if (!this.isValid) return [];\n    const sorted = dateTimes\n        .map(friendlyDateTime)\n        .filter((d) => this.contains(d))\n        .sort((a, b) => a.toMillis() - b.toMillis()),\n      results = [];\n    let { s } = this,\n      i = 0;\n\n    while (s < this.e) {\n      const added = sorted[i] || this.e,\n        next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      i += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into smaller Intervals, each of the specified length.\n   * Left over time is grouped into a smaller interval\n   * @param {Duration|Object|number} duration - The length of each resulting interval.\n   * @return {Array}\n   */\n  splitBy(duration) {\n    const dur = Duration.fromDurationLike(duration);\n\n    if (!this.isValid || !dur.isValid || dur.as(\"milliseconds\") === 0) {\n      return [];\n    }\n\n    let { s } = this,\n      idx = 1,\n      next;\n\n    const results = [];\n    while (s < this.e) {\n      const added = this.start.plus(dur.mapUnits((x) => x * idx));\n      next = +added > +this.e ? this.e : added;\n      results.push(Interval.fromDateTimes(s, next));\n      s = next;\n      idx += 1;\n    }\n\n    return results;\n  }\n\n  /**\n   * Split this Interval into the specified number of smaller intervals.\n   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.\n   * @return {Array}\n   */\n  divideEqually(numberOfParts) {\n    if (!this.isValid) return [];\n    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);\n  }\n\n  /**\n   * Return whether this Interval overlaps with the specified Interval\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  overlaps(other) {\n    return this.e > other.s && this.s < other.e;\n  }\n\n  /**\n   * Return whether this Interval's end is adjacent to the specified Interval's start.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsStart(other) {\n    if (!this.isValid) return false;\n    return +this.e === +other.s;\n  }\n\n  /**\n   * Return whether this Interval's start is adjacent to the specified Interval's end.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  abutsEnd(other) {\n    if (!this.isValid) return false;\n    return +other.e === +this.s;\n  }\n\n  /**\n   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  engulfs(other) {\n    if (!this.isValid) return false;\n    return this.s <= other.s && this.e >= other.e;\n  }\n\n  /**\n   * Return whether this Interval has the same start and end as the specified Interval.\n   * @param {Interval} other\n   * @return {boolean}\n   */\n  equals(other) {\n    if (!this.isValid || !other.isValid) {\n      return false;\n    }\n\n    return this.s.equals(other.s) && this.e.equals(other.e);\n  }\n\n  /**\n   * Return an Interval representing the intersection of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.\n   * Returns null if the intersection is empty, meaning, the intervals don't intersect.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  intersection(other) {\n    if (!this.isValid) return this;\n    const s = this.s > other.s ? this.s : other.s,\n      e = this.e < other.e ? this.e : other.e;\n\n    if (s >= e) {\n      return null;\n    } else {\n      return Interval.fromDateTimes(s, e);\n    }\n  }\n\n  /**\n   * Return an Interval representing the union of this Interval and the specified Interval.\n   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.\n   * @param {Interval} other\n   * @return {Interval}\n   */\n  union(other) {\n    if (!this.isValid) return this;\n    const s = this.s < other.s ? this.s : other.s,\n      e = this.e > other.e ? this.e : other.e;\n    return Interval.fromDateTimes(s, e);\n  }\n\n  /**\n   * Merge an array of Intervals into an equivalent minimal set of Intervals.\n   * Combines overlapping and adjacent Intervals.\n   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval\n   * and ending with the latest.\n   *\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static merge(intervals) {\n    const [found, final] = intervals\n      .sort((a, b) => a.s - b.s)\n      .reduce(\n        ([sofar, current], item) => {\n          if (!current) {\n            return [sofar, item];\n          } else if (current.overlaps(item) || current.abutsStart(item)) {\n            return [sofar, current.union(item)];\n          } else {\n            return [sofar.concat([current]), item];\n          }\n        },\n        [[], null]\n      );\n    if (final) {\n      found.push(final);\n    }\n    return found;\n  }\n\n  /**\n   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.\n   * @param {Array} intervals\n   * @return {Array}\n   */\n  static xor(intervals) {\n    let start = null,\n      currentCount = 0;\n    const results = [],\n      ends = intervals.map((i) => [\n        { time: i.s, type: \"s\" },\n        { time: i.e, type: \"e\" },\n      ]),\n      flattened = Array.prototype.concat(...ends),\n      arr = flattened.sort((a, b) => a.time - b.time);\n\n    for (const i of arr) {\n      currentCount += i.type === \"s\" ? 1 : -1;\n\n      if (currentCount === 1) {\n        start = i.time;\n      } else {\n        if (start && +start !== +i.time) {\n          results.push(Interval.fromDateTimes(start, i.time));\n        }\n\n        start = null;\n      }\n    }\n\n    return Interval.merge(results);\n  }\n\n  /**\n   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.\n   * @param {...Interval} intervals\n   * @return {Array}\n   */\n  difference(...intervals) {\n    return Interval.xor([this].concat(intervals))\n      .map((i) => this.intersection(i))\n      .filter((i) => i && !i.isEmpty());\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for debugging.\n   * @return {string}\n   */\n  toString() {\n    if (!this.isValid) return INVALID;\n    return `[${this.s.toISO()} – ${this.e.toISO()})`;\n  }\n\n  /**\n   * Returns a string representation of this Interval appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;\n    } else {\n      return `Interval { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns a localized string representing this Interval. Accepts the same options as the\n   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as\n   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method\n   * is browser-specific, but in general it will return an appropriate representation of the\n   * Interval in the assigned locale. Defaults to the system's locale if no locale has been\n   * specified.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or\n   * Intl.DateTimeFormat constructor options.\n   * @param {Object} opts - Options to override the configuration of the start DateTime.\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022\n   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM\n   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this Interval.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISO(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of date of this Interval.\n   * The time components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @return {string}\n   */\n  toISODate() {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISODate()}/${this.e.toISODate()}`;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of time of this Interval.\n   * The date components are ignored.\n   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals\n   * @param {Object} opts - The same options as {@link DateTime#toISO}\n   * @return {string}\n   */\n  toISOTime(opts) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this Interval formatted according to the specified format\n   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible\n   * formatting tool.\n   * @param {string} dateFormat - The format string. This string formats the start and end time.\n   * See {@link DateTime#toFormat} for details.\n   * @param {Object} opts - Options.\n   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end\n   * representations.\n   * @return {string}\n   */\n  toFormat(dateFormat, { separator = \" – \" } = {}) {\n    if (!this.isValid) return INVALID;\n    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;\n  }\n\n  /**\n   * Return a Duration representing the time spanned by this interval.\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }\n   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }\n   * @return {Duration}\n   */\n  toDuration(unit, opts) {\n    if (!this.isValid) {\n      return Duration.invalid(this.invalidReason);\n    }\n    return this.e.diff(this.s, unit, opts);\n  }\n\n  /**\n   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes\n   * @param {function} mapFn\n   * @return {Interval}\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())\n   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))\n   */\n  mapEndpoints(mapFn) {\n    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Settings from \"./settings.js\";\nimport Locale from \"./impl/locale.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\n\nimport { hasLocaleWeekInfo, hasRelative } from \"./impl/util.js\";\n\n/**\n * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.\n */\nexport default class Info {\n  /**\n   * Return whether the specified zone contains a DST.\n   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.\n   * @return {boolean}\n   */\n  static hasDST(zone = Settings.defaultZone) {\n    const proto = DateTime.now().setZone(zone).set({ month: 12 });\n\n    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;\n  }\n\n  /**\n   * Return whether the specified zone is a valid IANA specifier.\n   * @param {string} zone - Zone to check\n   * @return {boolean}\n   */\n  static isValidIANAZone(zone) {\n    return IANAZone.isValidZone(zone);\n  }\n\n  /**\n   * Converts the input into a {@link Zone} instance.\n   *\n   * * If `input` is already a Zone instance, it is returned unchanged.\n   * * If `input` is a string containing a valid time zone name, a Zone instance\n   *   with that name is returned.\n   * * If `input` is a string that doesn't refer to a known time zone, a Zone\n   *   instance with {@link Zone#isValid} == false is returned.\n   * * If `input is a number, a Zone instance with the specified fixed offset\n   *   in minutes is returned.\n   * * If `input` is `null` or `undefined`, the default zone is returned.\n   * @param {string|Zone|number} [input] - the value to be converted\n   * @return {Zone}\n   */\n  static normalizeZone(input) {\n    return normalizeZone(input, Settings.defaultZone);\n  }\n\n  /**\n   * Get the weekday on which the week starts according to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday\n   */\n  static getStartOfWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getStartOfWeek();\n  }\n\n  /**\n   * Get the minimum number of days necessary in a week before it is considered part of the next year according\n   * to the given locale.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number}\n   */\n  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();\n  }\n\n  /**\n   * Get the weekdays, which are considered the weekend according to the given locale\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday\n   */\n  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {\n    // copy the array, because we cache it internally\n    return (locObj || Locale.create(locale)).getWeekendDays().slice();\n  }\n\n  /**\n   * Return an array of standalone month names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @example Info.months()[0] //=> 'January'\n   * @example Info.months('short')[0] //=> 'Jan'\n   * @example Info.months('numeric')[0] //=> '1'\n   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'\n   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'\n   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'\n   * @return {Array}\n   */\n  static months(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);\n  }\n\n  /**\n   * Return an array of format month names.\n   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that\n   * changes the string.\n   * See {@link Info#months}\n   * @param {string} [length='long'] - the length of the month representation, such as \"numeric\", \"2-digit\", \"narrow\", \"short\", \"long\"\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @param {string} [opts.outputCalendar='gregory'] - the calendar\n   * @return {Array}\n   */\n  static monthsFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null, outputCalendar = \"gregory\" } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);\n  }\n\n  /**\n   * Return an array of standalone week names.\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param {string} [length='long'] - the length of the weekday representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @example Info.weekdays()[0] //=> 'Monday'\n   * @example Info.weekdays('short')[0] //=> 'Mon'\n   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'\n   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'\n   * @return {Array}\n   */\n  static weekdays(length = \"long\", { locale = null, numberingSystem = null, locObj = null } = {}) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);\n  }\n\n  /**\n   * Return an array of format week names.\n   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that\n   * changes the string.\n   * See {@link Info#weekdays}\n   * @param {string} [length='long'] - the length of the month representation, such as \"narrow\", \"short\", \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale=null] - the locale code\n   * @param {string} [opts.numberingSystem=null] - the numbering system\n   * @param {string} [opts.locObj=null] - an existing locale object to use\n   * @return {Array}\n   */\n  static weekdaysFormat(\n    length = \"long\",\n    { locale = null, numberingSystem = null, locObj = null } = {}\n  ) {\n    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);\n  }\n\n  /**\n   * Return an array of meridiems.\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.meridiems() //=> [ 'AM', 'PM' ]\n   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]\n   * @return {Array}\n   */\n  static meridiems({ locale = null } = {}) {\n    return Locale.create(locale).meridiems();\n  }\n\n  /**\n   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.\n   * @param {string} [length='short'] - the length of the era representation, such as \"short\" or \"long\".\n   * @param {Object} opts - options\n   * @param {string} [opts.locale] - the locale code\n   * @example Info.eras() //=> [ 'BC', 'AD' ]\n   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]\n   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]\n   * @return {Array}\n   */\n  static eras(length = \"short\", { locale = null } = {}) {\n    return Locale.create(locale, null, \"gregory\").eras(length);\n  }\n\n  /**\n   * Return the set of available features in this environment.\n   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.\n   * Keys:\n   * * `relative`: whether this environment supports relative time formatting\n   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale\n   * @example Info.features() //=> { relative: false, localeWeek: true }\n   * @return {Object}\n   */\n  static features() {\n    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };\n  }\n}\n","import Duration from \"../duration.js\";\n\nfunction dayDiff(earlier, later) {\n  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf(\"day\").valueOf(),\n    ms = utcDayStart(later) - utcDayStart(earlier);\n  return Math.floor(Duration.fromMillis(ms).as(\"days\"));\n}\n\nfunction highOrderDiffs(cursor, later, units) {\n  const differs = [\n    [\"years\", (a, b) => b.year - a.year],\n    [\"quarters\", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],\n    [\"months\", (a, b) => b.month - a.month + (b.year - a.year) * 12],\n    [\n      \"weeks\",\n      (a, b) => {\n        const days = dayDiff(a, b);\n        return (days - (days % 7)) / 7;\n      },\n    ],\n    [\"days\", dayDiff],\n  ];\n\n  const results = {};\n  const earlier = cursor;\n  let lowestOrder, highWater;\n\n  /* This loop tries to diff using larger units first.\n     If we overshoot, we backtrack and try the next smaller unit.\n     \"cursor\" starts out at the earlier timestamp and moves closer and closer to \"later\"\n     as we use smaller and smaller units.\n     highWater keeps track of where we would be if we added one more of the smallest unit,\n     this is used later to potentially convert any difference smaller than the smallest higher order unit\n     into a fraction of that smallest higher order unit\n  */\n  for (const [unit, differ] of differs) {\n    if (units.indexOf(unit) >= 0) {\n      lowestOrder = unit;\n\n      results[unit] = differ(cursor, later);\n      highWater = earlier.plus(results);\n\n      if (highWater > later) {\n        // we overshot the end point, backtrack cursor by 1\n        results[unit]--;\n        cursor = earlier.plus(results);\n\n        // if we are still overshooting now, we need to backtrack again\n        // this happens in certain situations when diffing times in different zones,\n        // because this calculation ignores time zones\n        if (cursor > later) {\n          // keep the \"overshot by 1\" around as highWater\n          highWater = cursor;\n          // backtrack cursor by 1\n          results[unit]--;\n          cursor = earlier.plus(results);\n        }\n      } else {\n        cursor = highWater;\n      }\n    }\n  }\n\n  return [cursor, results, highWater, lowestOrder];\n}\n\nexport default function (earlier, later, units, opts) {\n  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);\n\n  const remainingMillis = later - cursor;\n\n  const lowerOrderUnits = units.filter(\n    (u) => [\"hours\", \"minutes\", \"seconds\", \"milliseconds\"].indexOf(u) >= 0\n  );\n\n  if (lowerOrderUnits.length === 0) {\n    if (highWater < later) {\n      highWater = cursor.plus({ [lowestOrder]: 1 });\n    }\n\n    if (highWater !== cursor) {\n      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);\n    }\n  }\n\n  const duration = Duration.fromObject(results, opts);\n\n  if (lowerOrderUnits.length > 0) {\n    return Duration.fromMillis(remainingMillis, opts)\n      .shiftTo(...lowerOrderUnits)\n      .plus(duration);\n  } else {\n    return duration;\n  }\n}\n","import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from \"./util.js\";\nimport Formatter from \"./formatter.js\";\nimport FixedOffsetZone from \"../zones/fixedOffsetZone.js\";\nimport IANAZone from \"../zones/IANAZone.js\";\nimport DateTime from \"../datetime.js\";\nimport { digitRegex, parseDigits } from \"./digits.js\";\nimport { ConflictingSpecificationError } from \"../errors.js\";\n\nconst MISSING_FTP = \"missing Intl.DateTimeFormat.formatToParts support\";\n\nfunction intUnit(regex, post = (i) => i) {\n  return { regex, deser: ([s]) => post(parseDigits(s)) };\n}\n\nconst NBSP = String.fromCharCode(160);\nconst spaceOrNBSP = `[ ${NBSP}]`;\nconst spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, \"g\");\n\nfunction fixListRegex(s) {\n  // make dots optional and also make them literal\n  // make space and non breakable space characters interchangeable\n  return s.replace(/\\./g, \"\\\\.?\").replace(spaceOrNBSPRegExp, spaceOrNBSP);\n}\n\nfunction stripInsensitivities(s) {\n  return s\n    .replace(/\\./g, \"\") // ignore dots that were made optional\n    .replace(spaceOrNBSPRegExp, \" \") // interchange space and nbsp\n    .toLowerCase();\n}\n\nfunction oneOf(strings, startIndex) {\n  if (strings === null) {\n    return null;\n  } else {\n    return {\n      regex: RegExp(strings.map(fixListRegex).join(\"|\")),\n      deser: ([s]) =>\n        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,\n    };\n  }\n}\n\nfunction offset(regex, groups) {\n  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };\n}\n\nfunction simple(regex) {\n  return { regex, deser: ([s]) => s };\n}\n\nfunction escapeToken(value) {\n  return value.replace(/[\\-\\[\\]{}()*+?.,\\\\\\^$|#\\s]/g, \"\\\\$&\");\n}\n\n/**\n * @param token\n * @param {Locale} loc\n */\nfunction unitForToken(token, loc) {\n  const one = digitRegex(loc),\n    two = digitRegex(loc, \"{2}\"),\n    three = digitRegex(loc, \"{3}\"),\n    four = digitRegex(loc, \"{4}\"),\n    six = digitRegex(loc, \"{6}\"),\n    oneOrTwo = digitRegex(loc, \"{1,2}\"),\n    oneToThree = digitRegex(loc, \"{1,3}\"),\n    oneToSix = digitRegex(loc, \"{1,6}\"),\n    oneToNine = digitRegex(loc, \"{1,9}\"),\n    twoToFour = digitRegex(loc, \"{2,4}\"),\n    fourToSix = digitRegex(loc, \"{4,6}\"),\n    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),\n    unitate = (t) => {\n      if (token.literal) {\n        return literal(t);\n      }\n      switch (t.val) {\n        // era\n        case \"G\":\n          return oneOf(loc.eras(\"short\"), 0);\n        case \"GG\":\n          return oneOf(loc.eras(\"long\"), 0);\n        // years\n        case \"y\":\n          return intUnit(oneToSix);\n        case \"yy\":\n          return intUnit(twoToFour, untruncateYear);\n        case \"yyyy\":\n          return intUnit(four);\n        case \"yyyyy\":\n          return intUnit(fourToSix);\n        case \"yyyyyy\":\n          return intUnit(six);\n        // months\n        case \"M\":\n          return intUnit(oneOrTwo);\n        case \"MM\":\n          return intUnit(two);\n        case \"MMM\":\n          return oneOf(loc.months(\"short\", true), 1);\n        case \"MMMM\":\n          return oneOf(loc.months(\"long\", true), 1);\n        case \"L\":\n          return intUnit(oneOrTwo);\n        case \"LL\":\n          return intUnit(two);\n        case \"LLL\":\n          return oneOf(loc.months(\"short\", false), 1);\n        case \"LLLL\":\n          return oneOf(loc.months(\"long\", false), 1);\n        // dates\n        case \"d\":\n          return intUnit(oneOrTwo);\n        case \"dd\":\n          return intUnit(two);\n        // ordinals\n        case \"o\":\n          return intUnit(oneToThree);\n        case \"ooo\":\n          return intUnit(three);\n        // time\n        case \"HH\":\n          return intUnit(two);\n        case \"H\":\n          return intUnit(oneOrTwo);\n        case \"hh\":\n          return intUnit(two);\n        case \"h\":\n          return intUnit(oneOrTwo);\n        case \"mm\":\n          return intUnit(two);\n        case \"m\":\n          return intUnit(oneOrTwo);\n        case \"q\":\n          return intUnit(oneOrTwo);\n        case \"qq\":\n          return intUnit(two);\n        case \"s\":\n          return intUnit(oneOrTwo);\n        case \"ss\":\n          return intUnit(two);\n        case \"S\":\n          return intUnit(oneToThree);\n        case \"SSS\":\n          return intUnit(three);\n        case \"u\":\n          return simple(oneToNine);\n        case \"uu\":\n          return simple(oneOrTwo);\n        case \"uuu\":\n          return intUnit(one);\n        // meridiem\n        case \"a\":\n          return oneOf(loc.meridiems(), 0);\n        // weekYear (k)\n        case \"kkkk\":\n          return intUnit(four);\n        case \"kk\":\n          return intUnit(twoToFour, untruncateYear);\n        // weekNumber (W)\n        case \"W\":\n          return intUnit(oneOrTwo);\n        case \"WW\":\n          return intUnit(two);\n        // weekdays\n        case \"E\":\n        case \"c\":\n          return intUnit(one);\n        case \"EEE\":\n          return oneOf(loc.weekdays(\"short\", false), 1);\n        case \"EEEE\":\n          return oneOf(loc.weekdays(\"long\", false), 1);\n        case \"ccc\":\n          return oneOf(loc.weekdays(\"short\", true), 1);\n        case \"cccc\":\n          return oneOf(loc.weekdays(\"long\", true), 1);\n        // offset/zone\n        case \"Z\":\n        case \"ZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);\n        case \"ZZZ\":\n          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);\n        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing\n        // because we don't have any way to figure out what they are\n        case \"z\":\n          return simple(/[a-z_+-/]{1,256}?/i);\n        // this special-case \"token\" represents a place where a macro-token expanded into a white-space literal\n        // in this case we accept any non-newline white-space\n        case \" \":\n          return simple(/[^\\S\\n\\r]/);\n        default:\n          return literal(t);\n      }\n    };\n\n  const unit = unitate(token) || {\n    invalidReason: MISSING_FTP,\n  };\n\n  unit.token = token;\n\n  return unit;\n}\n\nconst partTypeStyleToTokenVal = {\n  year: {\n    \"2-digit\": \"yy\",\n    numeric: \"yyyyy\",\n  },\n  month: {\n    numeric: \"M\",\n    \"2-digit\": \"MM\",\n    short: \"MMM\",\n    long: \"MMMM\",\n  },\n  day: {\n    numeric: \"d\",\n    \"2-digit\": \"dd\",\n  },\n  weekday: {\n    short: \"EEE\",\n    long: \"EEEE\",\n  },\n  dayperiod: \"a\",\n  dayPeriod: \"a\",\n  hour12: {\n    numeric: \"h\",\n    \"2-digit\": \"hh\",\n  },\n  hour24: {\n    numeric: \"H\",\n    \"2-digit\": \"HH\",\n  },\n  minute: {\n    numeric: \"m\",\n    \"2-digit\": \"mm\",\n  },\n  second: {\n    numeric: \"s\",\n    \"2-digit\": \"ss\",\n  },\n  timeZoneName: {\n    long: \"ZZZZZ\",\n    short: \"ZZZ\",\n  },\n};\n\nfunction tokenForPart(part, formatOpts, resolvedOpts) {\n  const { type, value } = part;\n\n  if (type === \"literal\") {\n    const isSpace = /^\\s+$/.test(value);\n    return {\n      literal: !isSpace,\n      val: isSpace ? \" \" : value,\n    };\n  }\n\n  const style = formatOpts[type];\n\n  // The user might have explicitly specified hour12 or hourCycle\n  // if so, respect their decision\n  // if not, refer back to the resolvedOpts, which are based on the locale\n  let actualType = type;\n  if (type === \"hour\") {\n    if (formatOpts.hour12 != null) {\n      actualType = formatOpts.hour12 ? \"hour12\" : \"hour24\";\n    } else if (formatOpts.hourCycle != null) {\n      if (formatOpts.hourCycle === \"h11\" || formatOpts.hourCycle === \"h12\") {\n        actualType = \"hour12\";\n      } else {\n        actualType = \"hour24\";\n      }\n    } else {\n      // tokens only differentiate between 24 hours or not,\n      // so we do not need to check hourCycle here, which is less supported anyways\n      actualType = resolvedOpts.hour12 ? \"hour12\" : \"hour24\";\n    }\n  }\n  let val = partTypeStyleToTokenVal[actualType];\n  if (typeof val === \"object\") {\n    val = val[style];\n  }\n\n  if (val) {\n    return {\n      literal: false,\n      val,\n    };\n  }\n\n  return undefined;\n}\n\nfunction buildRegex(units) {\n  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, \"\");\n  return [`^${re}$`, units];\n}\n\nfunction match(input, regex, handlers) {\n  const matches = input.match(regex);\n\n  if (matches) {\n    const all = {};\n    let matchIndex = 1;\n    for (const i in handlers) {\n      if (hasOwnProperty(handlers, i)) {\n        const h = handlers[i],\n          groups = h.groups ? h.groups + 1 : 1;\n        if (!h.literal && h.token) {\n          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));\n        }\n        matchIndex += groups;\n      }\n    }\n    return [matches, all];\n  } else {\n    return [matches, {}];\n  }\n}\n\nfunction dateTimeFromMatches(matches) {\n  const toField = (token) => {\n    switch (token) {\n      case \"S\":\n        return \"millisecond\";\n      case \"s\":\n        return \"second\";\n      case \"m\":\n        return \"minute\";\n      case \"h\":\n      case \"H\":\n        return \"hour\";\n      case \"d\":\n        return \"day\";\n      case \"o\":\n        return \"ordinal\";\n      case \"L\":\n      case \"M\":\n        return \"month\";\n      case \"y\":\n        return \"year\";\n      case \"E\":\n      case \"c\":\n        return \"weekday\";\n      case \"W\":\n        return \"weekNumber\";\n      case \"k\":\n        return \"weekYear\";\n      case \"q\":\n        return \"quarter\";\n      default:\n        return null;\n    }\n  };\n\n  let zone = null;\n  let specificOffset;\n  if (!isUndefined(matches.z)) {\n    zone = IANAZone.create(matches.z);\n  }\n\n  if (!isUndefined(matches.Z)) {\n    if (!zone) {\n      zone = new FixedOffsetZone(matches.Z);\n    }\n    specificOffset = matches.Z;\n  }\n\n  if (!isUndefined(matches.q)) {\n    matches.M = (matches.q - 1) * 3 + 1;\n  }\n\n  if (!isUndefined(matches.h)) {\n    if (matches.h < 12 && matches.a === 1) {\n      matches.h += 12;\n    } else if (matches.h === 12 && matches.a === 0) {\n      matches.h = 0;\n    }\n  }\n\n  if (matches.G === 0 && matches.y) {\n    matches.y = -matches.y;\n  }\n\n  if (!isUndefined(matches.u)) {\n    matches.S = parseMillis(matches.u);\n  }\n\n  const vals = Object.keys(matches).reduce((r, k) => {\n    const f = toField(k);\n    if (f) {\n      r[f] = matches[k];\n    }\n\n    return r;\n  }, {});\n\n  return [vals, zone, specificOffset];\n}\n\nlet dummyDateTimeCache = null;\n\nfunction getDummyDateTime() {\n  if (!dummyDateTimeCache) {\n    dummyDateTimeCache = DateTime.fromMillis(1555555555555);\n  }\n\n  return dummyDateTimeCache;\n}\n\nfunction maybeExpandMacroToken(token, locale) {\n  if (token.literal) {\n    return token;\n  }\n\n  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);\n  const tokens = formatOptsToTokens(formatOpts, locale);\n\n  if (tokens == null || tokens.includes(undefined)) {\n    return token;\n  }\n\n  return tokens;\n}\n\nexport function expandMacroTokens(tokens, locale) {\n  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));\n}\n\n/**\n * @private\n */\n\nexport class TokenParser {\n  constructor(locale, format) {\n    this.locale = locale;\n    this.format = format;\n    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);\n    this.units = this.tokens.map((t) => unitForToken(t, locale));\n    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);\n\n    if (!this.disqualifyingUnit) {\n      const [regexString, handlers] = buildRegex(this.units);\n      this.regex = RegExp(regexString, \"i\");\n      this.handlers = handlers;\n    }\n  }\n\n  explainFromTokens(input) {\n    if (!this.isValid) {\n      return { input, tokens: this.tokens, invalidReason: this.invalidReason };\n    } else {\n      const [rawMatches, matches] = match(input, this.regex, this.handlers),\n        [result, zone, specificOffset] = matches\n          ? dateTimeFromMatches(matches)\n          : [null, null, undefined];\n      if (hasOwnProperty(matches, \"a\") && hasOwnProperty(matches, \"H\")) {\n        throw new ConflictingSpecificationError(\n          \"Can't include meridiem when specifying 24-hour format\"\n        );\n      }\n      return {\n        input,\n        tokens: this.tokens,\n        regex: this.regex,\n        rawMatches,\n        matches,\n        result,\n        zone,\n        specificOffset,\n      };\n    }\n  }\n\n  get isValid() {\n    return !this.disqualifyingUnit;\n  }\n\n  get invalidReason() {\n    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;\n  }\n}\n\nexport function explainFromTokens(locale, input, format) {\n  const parser = new TokenParser(locale, format);\n  return parser.explainFromTokens(input);\n}\n\nexport function parseFromTokens(locale, input, format) {\n  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);\n  return [result, zone, specificOffset, invalidReason];\n}\n\nexport function formatOptsToTokens(formatOpts, locale) {\n  if (!formatOpts) {\n    return null;\n  }\n\n  const formatter = Formatter.create(locale, formatOpts);\n  const df = formatter.dtFormatter(getDummyDateTime());\n  const parts = df.formatToParts();\n  const resolvedOpts = df.resolvedOptions();\n  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));\n}\n","import Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Settings from \"./settings.js\";\nimport Info from \"./info.js\";\nimport Formatter from \"./impl/formatter.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport Locale from \"./impl/locale.js\";\nimport {\n  isUndefined,\n  maybeArray,\n  isDate,\n  isNumber,\n  bestBy,\n  daysInMonth,\n  daysInYear,\n  isLeapYear,\n  weeksInWeekYear,\n  normalizeObject,\n  roundTo,\n  objToLocalTS,\n  padStart,\n} from \"./impl/util.js\";\nimport { normalizeZone } from \"./impl/zoneUtil.js\";\nimport diff from \"./impl/diff.js\";\nimport { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from \"./impl/regexParser.js\";\nimport {\n  parseFromTokens,\n  explainFromTokens,\n  formatOptsToTokens,\n  expandMacroTokens,\n  TokenParser,\n} from \"./impl/tokenParser.js\";\nimport {\n  gregorianToWeek,\n  weekToGregorian,\n  gregorianToOrdinal,\n  ordinalToGregorian,\n  hasInvalidGregorianData,\n  hasInvalidWeekData,\n  hasInvalidOrdinalData,\n  hasInvalidTimeData,\n  usesLocalWeekValues,\n  isoWeekdayToLocal,\n} from \"./impl/conversions.js\";\nimport * as Formats from \"./impl/formats.js\";\nimport {\n  InvalidArgumentError,\n  ConflictingSpecificationError,\n  InvalidUnitError,\n  InvalidDateTimeError,\n} from \"./errors.js\";\nimport Invalid from \"./impl/invalid.js\";\n\nconst INVALID = \"Invalid DateTime\";\nconst MAX_DATE = 8.64e15;\n\nfunction unsupportedZone(zone) {\n  return new Invalid(\"unsupported zone\", `the zone \"${zone.name}\" is not supported`);\n}\n\n// we cache week data on the DT object and this intermediates the cache\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedWeekData(dt) {\n  if (dt.weekData === null) {\n    dt.weekData = gregorianToWeek(dt.c);\n  }\n  return dt.weekData;\n}\n\n/**\n * @param {DateTime} dt\n */\nfunction possiblyCachedLocalWeekData(dt) {\n  if (dt.localWeekData === null) {\n    dt.localWeekData = gregorianToWeek(\n      dt.c,\n      dt.loc.getMinDaysInFirstWeek(),\n      dt.loc.getStartOfWeek()\n    );\n  }\n  return dt.localWeekData;\n}\n\n// clone really means, \"make a new object with these modifications\". all \"setters\" really use this\n// to create a new object while only changing some of the properties\nfunction clone(inst, alts) {\n  const current = {\n    ts: inst.ts,\n    zone: inst.zone,\n    c: inst.c,\n    o: inst.o,\n    loc: inst.loc,\n    invalid: inst.invalid,\n  };\n  return new DateTime({ ...current, ...alts, old: current });\n}\n\n// find the right offset a given local time. The o input is our guess, which determines which\n// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)\nfunction fixOffset(localTS, o, tz) {\n  // Our UTC time is just a guess because our offset is just a guess\n  let utcGuess = localTS - o * 60 * 1000;\n\n  // Test whether the zone matches the offset for this ts\n  const o2 = tz.offset(utcGuess);\n\n  // If so, offset didn't change and we're done\n  if (o === o2) {\n    return [utcGuess, o];\n  }\n\n  // If not, change the ts by the difference in the offset\n  utcGuess -= (o2 - o) * 60 * 1000;\n\n  // If that gives us the local time we want, we're done\n  const o3 = tz.offset(utcGuess);\n  if (o2 === o3) {\n    return [utcGuess, o2];\n  }\n\n  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time\n  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];\n}\n\n// convert an epoch timestamp into a calendar object with the given offset\nfunction tsToObj(ts, offset) {\n  ts += offset * 60 * 1000;\n\n  const d = new Date(ts);\n\n  return {\n    year: d.getUTCFullYear(),\n    month: d.getUTCMonth() + 1,\n    day: d.getUTCDate(),\n    hour: d.getUTCHours(),\n    minute: d.getUTCMinutes(),\n    second: d.getUTCSeconds(),\n    millisecond: d.getUTCMilliseconds(),\n  };\n}\n\n// convert a calendar object to a epoch timestamp\nfunction objToTS(obj, offset, zone) {\n  return fixOffset(objToLocalTS(obj), offset, zone);\n}\n\n// create a new DT instance by adding a duration, adjusting for DSTs\nfunction adjustTime(inst, dur) {\n  const oPre = inst.o,\n    year = inst.c.year + Math.trunc(dur.years),\n    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,\n    c = {\n      ...inst.c,\n      year,\n      month,\n      day:\n        Math.min(inst.c.day, daysInMonth(year, month)) +\n        Math.trunc(dur.days) +\n        Math.trunc(dur.weeks) * 7,\n    },\n    millisToAdd = Duration.fromObject({\n      years: dur.years - Math.trunc(dur.years),\n      quarters: dur.quarters - Math.trunc(dur.quarters),\n      months: dur.months - Math.trunc(dur.months),\n      weeks: dur.weeks - Math.trunc(dur.weeks),\n      days: dur.days - Math.trunc(dur.days),\n      hours: dur.hours,\n      minutes: dur.minutes,\n      seconds: dur.seconds,\n      milliseconds: dur.milliseconds,\n    }).as(\"milliseconds\"),\n    localTS = objToLocalTS(c);\n\n  let [ts, o] = fixOffset(localTS, oPre, inst.zone);\n\n  if (millisToAdd !== 0) {\n    ts += millisToAdd;\n    // that could have changed the offset by going over a DST, but we want to keep the ts the same\n    o = inst.zone.offset(ts);\n  }\n\n  return { ts, o };\n}\n\n// helper useful in turning the results of parsing into real dates\n// by handling the zone options\nfunction parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {\n  const { setZone, zone } = opts;\n  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {\n    const interpretationZone = parsedZone || zone,\n      inst = DateTime.fromObject(parsed, {\n        ...opts,\n        zone: interpretationZone,\n        specificOffset,\n      });\n    return setZone ? inst : inst.setZone(zone);\n  } else {\n    return DateTime.invalid(\n      new Invalid(\"unparsable\", `the input \"${text}\" can't be parsed as ${format}`)\n    );\n  }\n}\n\n// if you want to output a technical format (e.g. RFC 2822), this helper\n// helps handle the details\nfunction toTechFormat(dt, format, allowZ = true) {\n  return dt.isValid\n    ? Formatter.create(Locale.create(\"en-US\"), {\n        allowZ,\n        forceSimple: true,\n      }).formatDateTimeFromString(dt, format)\n    : null;\n}\n\nfunction toISODate(o, extended, precision) {\n  const longFormat = o.c.year > 9999 || o.c.year < 0;\n  let c = \"\";\n  if (longFormat && o.c.year >= 0) c += \"+\";\n  c += padStart(o.c.year, longFormat ? 6 : 4);\n  if (precision === \"year\") return c;\n  if (extended) {\n    c += \"-\";\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n    c += \"-\";\n  } else {\n    c += padStart(o.c.month);\n    if (precision === \"month\") return c;\n  }\n  c += padStart(o.c.day);\n  return c;\n}\n\nfunction toISOTime(\n  o,\n  extended,\n  suppressSeconds,\n  suppressMilliseconds,\n  includeOffset,\n  extendedZone,\n  precision\n) {\n  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,\n    c = \"\";\n  switch (precision) {\n    case \"day\":\n    case \"month\":\n    case \"year\":\n      break;\n    default:\n      c += padStart(o.c.hour);\n      if (precision === \"hour\") break;\n      if (extended) {\n        c += \":\";\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += \":\";\n          c += padStart(o.c.second);\n        }\n      } else {\n        c += padStart(o.c.minute);\n        if (precision === \"minute\") break;\n        if (showSeconds) {\n          c += padStart(o.c.second);\n        }\n      }\n      if (precision === \"second\") break;\n      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {\n        c += \".\";\n        c += padStart(o.c.millisecond, 3);\n      }\n  }\n\n  if (includeOffset) {\n    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {\n      c += \"Z\";\n    } else if (o.o < 0) {\n      c += \"-\";\n      c += padStart(Math.trunc(-o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(-o.o % 60));\n    } else {\n      c += \"+\";\n      c += padStart(Math.trunc(o.o / 60));\n      c += \":\";\n      c += padStart(Math.trunc(o.o % 60));\n    }\n  }\n\n  if (extendedZone) {\n    c += \"[\" + o.zone.ianaName + \"]\";\n  }\n  return c;\n}\n\n// defaults for unspecified units in the supported calendars\nconst defaultUnitValues = {\n    month: 1,\n    day: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultWeekUnitValues = {\n    weekNumber: 1,\n    weekday: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  },\n  defaultOrdinalUnitValues = {\n    ordinal: 1,\n    hour: 0,\n    minute: 0,\n    second: 0,\n    millisecond: 0,\n  };\n\n// Units in the supported calendars, sorted by bigness\nconst orderedUnits = [\"year\", \"month\", \"day\", \"hour\", \"minute\", \"second\", \"millisecond\"],\n  orderedWeekUnits = [\n    \"weekYear\",\n    \"weekNumber\",\n    \"weekday\",\n    \"hour\",\n    \"minute\",\n    \"second\",\n    \"millisecond\",\n  ],\n  orderedOrdinalUnits = [\"year\", \"ordinal\", \"hour\", \"minute\", \"second\", \"millisecond\"];\n\n// standardize case and plurality in units\nfunction normalizeUnit(unit) {\n  const normalized = {\n    year: \"year\",\n    years: \"year\",\n    month: \"month\",\n    months: \"month\",\n    day: \"day\",\n    days: \"day\",\n    hour: \"hour\",\n    hours: \"hour\",\n    minute: \"minute\",\n    minutes: \"minute\",\n    quarter: \"quarter\",\n    quarters: \"quarter\",\n    second: \"second\",\n    seconds: \"second\",\n    millisecond: \"millisecond\",\n    milliseconds: \"millisecond\",\n    weekday: \"weekday\",\n    weekdays: \"weekday\",\n    weeknumber: \"weekNumber\",\n    weeksnumber: \"weekNumber\",\n    weeknumbers: \"weekNumber\",\n    weekyear: \"weekYear\",\n    weekyears: \"weekYear\",\n    ordinal: \"ordinal\",\n  }[unit.toLowerCase()];\n\n  if (!normalized) throw new InvalidUnitError(unit);\n\n  return normalized;\n}\n\nfunction normalizeUnitWithLocalWeeks(unit) {\n  switch (unit.toLowerCase()) {\n    case \"localweekday\":\n    case \"localweekdays\":\n      return \"localWeekday\";\n    case \"localweeknumber\":\n    case \"localweeknumbers\":\n      return \"localWeekNumber\";\n    case \"localweekyear\":\n    case \"localweekyears\":\n      return \"localWeekYear\";\n    default:\n      return normalizeUnit(unit);\n  }\n}\n\n// cache offsets for zones based on the current timestamp when this function is\n// first called. When we are handling a datetime from components like (year,\n// month, day, hour) in a time zone, we need a guess about what the timezone\n// offset is so that we can convert into a UTC timestamp. One way is to find the\n// offset of now in the zone. The actual date may have a different offset (for\n// example, if we handle a date in June while we're in December in a zone that\n// observes DST), but we can check and adjust that.\n//\n// When handling many dates, calculating the offset for now every time is\n// expensive. It's just a guess, so we can cache the offset to use even if we\n// are right on a time change boundary (we'll just correct in the other\n// direction). Using a timestamp from first read is a slight optimization for\n// handling dates close to the current date, since those dates will usually be\n// in the same offset (we could set the timestamp statically, instead). We use a\n// single timestamp for all zones to make things a bit more predictable.\n//\n// This is safe for quickDT (used by local() and utc()) because we don't fill in\n// higher-order units from tsNow (as we do in fromObject, this requires that\n// offset is calculated from tsNow).\n/**\n * @param {Zone} zone\n * @return {number}\n */\nfunction guessOffsetForZone(zone) {\n  if (zoneOffsetTs === undefined) {\n    zoneOffsetTs = Settings.now();\n  }\n\n  // Do not cache anything but IANA zones, because it is not safe to do so.\n  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset\n  if (zone.type !== \"iana\") {\n    return zone.offset(zoneOffsetTs);\n  }\n  const zoneName = zone.name;\n  let offsetGuess = zoneOffsetGuessCache.get(zoneName);\n  if (offsetGuess === undefined) {\n    offsetGuess = zone.offset(zoneOffsetTs);\n    zoneOffsetGuessCache.set(zoneName, offsetGuess);\n  }\n  return offsetGuess;\n}\n\n// this is a dumbed down version of fromObject() that runs about 60% faster\n// but doesn't do any validation, makes a bunch of assumptions about what units\n// are present, and so on.\nfunction quickDT(obj, opts) {\n  const zone = normalizeZone(opts.zone, Settings.defaultZone);\n  if (!zone.isValid) {\n    return DateTime.invalid(unsupportedZone(zone));\n  }\n\n  const loc = Locale.fromObject(opts);\n\n  let ts, o;\n\n  // assume we have the higher-order units\n  if (!isUndefined(obj.year)) {\n    for (const u of orderedUnits) {\n      if (isUndefined(obj[u])) {\n        obj[u] = defaultUnitValues[u];\n      }\n    }\n\n    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    const offsetProvis = guessOffsetForZone(zone);\n    [ts, o] = objToTS(obj, offsetProvis, zone);\n  } else {\n    ts = Settings.now();\n  }\n\n  return new DateTime({ ts, zone, loc, o });\n}\n\nfunction diffRelative(start, end, opts) {\n  const round = isUndefined(opts.round) ? true : opts.round,\n    rounding = isUndefined(opts.rounding) ? \"trunc\" : opts.rounding,\n    format = (c, unit) => {\n      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? \"round\" : rounding);\n      const formatter = end.loc.clone(opts).relFormatter(opts);\n      return formatter.format(c, unit);\n    },\n    differ = (unit) => {\n      if (opts.calendary) {\n        if (!end.hasSame(start, unit)) {\n          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);\n        } else return 0;\n      } else {\n        return end.diff(start, unit).get(unit);\n      }\n    };\n\n  if (opts.unit) {\n    return format(differ(opts.unit), opts.unit);\n  }\n\n  for (const unit of opts.units) {\n    const count = differ(unit);\n    if (Math.abs(count) >= 1) {\n      return format(count, unit);\n    }\n  }\n  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);\n}\n\nfunction lastOpts(argList) {\n  let opts = {},\n    args;\n  if (argList.length > 0 && typeof argList[argList.length - 1] === \"object\") {\n    opts = argList[argList.length - 1];\n    args = Array.from(argList).slice(0, argList.length - 1);\n  } else {\n    args = Array.from(argList);\n  }\n  return [opts, args];\n}\n\n/**\n * Timestamp to use for cached zone offset guesses (exposed for test)\n */\nlet zoneOffsetTs;\n/**\n * Cache for zone offset guesses (exposed for test).\n *\n * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of\n * zone.offset().\n */\nconst zoneOffsetGuessCache = new Map();\n\n/**\n * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.\n *\n * A DateTime comprises of:\n * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.\n * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).\n * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.\n *\n * Here is a brief overview of the most commonly used functionality it provides:\n *\n * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.\n * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},\n * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.\n * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.\n * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.\n * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.\n * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.\n *\n * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.\n */\nexport default class DateTime {\n  /**\n   * @access private\n   */\n  constructor(config) {\n    const zone = config.zone || Settings.defaultZone;\n\n    let invalid =\n      config.invalid ||\n      (Number.isNaN(config.ts) ? new Invalid(\"invalid input\") : null) ||\n      (!zone.isValid ? unsupportedZone(zone) : null);\n    /**\n     * @access private\n     */\n    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;\n\n    let c = null,\n      o = null;\n    if (!invalid) {\n      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);\n\n      if (unchanged) {\n        [c, o] = [config.old.c, config.old.o];\n      } else {\n        // If an offset has been passed and we have not been called from\n        // clone(), we can trust it and avoid the offset calculation.\n        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);\n        c = tsToObj(this.ts, ot);\n        invalid = Number.isNaN(c.year) ? new Invalid(\"invalid input\") : null;\n        c = invalid ? null : c;\n        o = invalid ? null : ot;\n      }\n    }\n\n    /**\n     * @access private\n     */\n    this._zone = zone;\n    /**\n     * @access private\n     */\n    this.loc = config.loc || Locale.create();\n    /**\n     * @access private\n     */\n    this.invalid = invalid;\n    /**\n     * @access private\n     */\n    this.weekData = null;\n    /**\n     * @access private\n     */\n    this.localWeekData = null;\n    /**\n     * @access private\n     */\n    this.c = c;\n    /**\n     * @access private\n     */\n    this.o = o;\n    /**\n     * @access private\n     */\n    this.isLuxonDateTime = true;\n  }\n\n  // CONSTRUCT\n\n  /**\n   * Create a DateTime for the current instant, in the system's time zone.\n   *\n   * Use Settings to override these default values if needed.\n   * @example DateTime.now().toISO() //~> now in the ISO format\n   * @return {DateTime}\n   */\n  static now() {\n    return new DateTime({});\n  }\n\n  /**\n   * Create a local DateTime\n   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month, 1-indexed\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @example DateTime.local()                                  //~> now\n   * @example DateTime.local({ zone: \"America/New_York\" })      //~> now, in US east coast time\n   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00\n   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00\n   * @example DateTime.local(2017, 3, 12, { locale: \"fr\" })     //~> 2017-03-12T00:00:00, with a French locale\n   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00\n   * @example DateTime.local(2017, 3, 12, 5, { zone: \"utc\" })   //~> 2017-03-12T05:00:00, in UTC\n   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10\n   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765\n   * @return {DateTime}\n   */\n  static local() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime in UTC\n   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used\n   * @param {number} [month=1] - The month, 1-indexed\n   * @param {number} [day=1] - The day of the month\n   * @param {number} [hour=0] - The hour of the day, in 24-hour time\n   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59\n   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59\n   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.utc()                                              //~> now\n   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z\n   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: \"fr\" })          //~> 2017-03-12T05:45:00Z with a French locale\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z\n   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: \"fr\" }) //~> 2017-03-12T05:45:10.765Z with a French locale\n   * @return {DateTime}\n   */\n  static utc() {\n    const [opts, args] = lastOpts(arguments),\n      [year, month, day, hour, minute, second, millisecond] = args;\n\n    opts.zone = FixedOffsetZone.utcInstance;\n    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);\n  }\n\n  /**\n   * Create a DateTime from a JavaScript Date object. Uses the default zone.\n   * @param {Date} date - a JavaScript Date object\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @return {DateTime}\n   */\n  static fromJSDate(date, options = {}) {\n    const ts = isDate(date) ? date.valueOf() : NaN;\n    if (Number.isNaN(ts)) {\n      return DateTime.invalid(\"invalid input\");\n    }\n\n    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    return new DateTime({\n      ts: ts,\n      zone: zoneToUse,\n      loc: Locale.fromObject(options),\n    });\n  }\n\n  /**\n   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} milliseconds - a number of milliseconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromMillis(milliseconds, options = {}) {\n    if (!isNumber(milliseconds)) {\n      throw new InvalidArgumentError(\n        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`\n      );\n    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {\n      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start\n      return DateTime.invalid(\"Timestamp out of range\");\n    } else {\n      return new DateTime({\n        ts: milliseconds,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.\n   * @param {number} seconds - a number of seconds since 1970 UTC\n   * @param {Object} options - configuration options for the DateTime\n   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into\n   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance\n   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromSeconds(seconds, options = {}) {\n    if (!isNumber(seconds)) {\n      throw new InvalidArgumentError(\"fromSeconds requires a numerical input\");\n    } else {\n      return new DateTime({\n        ts: seconds * 1000,\n        zone: normalizeZone(options.zone, Settings.defaultZone),\n        loc: Locale.fromObject(options),\n      });\n    }\n  }\n\n  /**\n   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.\n   * @param {Object} obj - the object to create the DateTime from\n   * @param {number} obj.year - a year, such as 1987\n   * @param {number} obj.month - a month, 1-12\n   * @param {number} obj.day - a day of the month, 1-31, depending on the month\n   * @param {number} obj.ordinal - day of the year, 1-365 or 366\n   * @param {number} obj.weekYear - an ISO week year\n   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year\n   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday\n   * @param {number} obj.localWeekYear - a week year, according to the locale\n   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale\n   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale\n   * @param {number} obj.hour - hour of the day, 0-23\n   * @param {number} obj.minute - minute of the hour, 0-59\n   * @param {number} obj.second - second of the minute, 0-59\n   * @param {number} obj.millisecond - millisecond of the second, 0-999\n   * @param {Object} opts - options for creating this DateTime\n   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()\n   * @param {string} [opts.locale='system\\'s locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'\n   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })\n   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })\n   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'\n   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: \"en-US\" }).toISODate() //=> '2021-12-26'\n   * @return {DateTime}\n   */\n  static fromObject(obj, opts = {}) {\n    obj = obj || {};\n    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);\n    if (!zoneToUse.isValid) {\n      return DateTime.invalid(unsupportedZone(zoneToUse));\n    }\n\n    const loc = Locale.fromObject(opts);\n    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);\n\n    const tsNow = Settings.now(),\n      offsetProvis = !isUndefined(opts.specificOffset)\n        ? opts.specificOffset\n        : zoneToUse.offset(tsNow),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    // cases:\n    // just a weekday -> this week's instance of that weekday, no worries\n    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error\n    // (gregorian month or day) + ordinal -> error\n    // otherwise just use weeks or ordinals or gregorian, depending on what's specified\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);\n\n    // configure ourselves to deal with gregorian dates or week stuff\n    let units,\n      defaultValues,\n      objNow = tsToObj(tsNow, offsetProvis);\n    if (useWeekData) {\n      units = orderedWeekUnits;\n      defaultValues = defaultWeekUnitValues;\n      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);\n    } else if (containsOrdinal) {\n      units = orderedOrdinalUnits;\n      defaultValues = defaultOrdinalUnitValues;\n      objNow = gregorianToOrdinal(objNow);\n    } else {\n      units = orderedUnits;\n      defaultValues = defaultUnitValues;\n    }\n\n    // set default values for missing stuff\n    let foundFirst = false;\n    for (const u of units) {\n      const v = normalized[u];\n      if (!isUndefined(v)) {\n        foundFirst = true;\n      } else if (foundFirst) {\n        normalized[u] = defaultValues[u];\n      } else {\n        normalized[u] = objNow[u];\n      }\n    }\n\n    // make sure the values we have are in range\n    const higherOrderInvalid = useWeekData\n        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? hasInvalidOrdinalData(normalized)\n        : hasInvalidGregorianData(normalized),\n      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);\n\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    }\n\n    // compute the actual time\n    const gregorian = useWeekData\n        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)\n        : containsOrdinal\n        ? ordinalToGregorian(normalized)\n        : normalized,\n      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),\n      inst = new DateTime({\n        ts: tsFinal,\n        zone: zoneToUse,\n        o: offsetFinal,\n        loc,\n      });\n\n    // gregorian data + weekday serves only to validate\n    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {\n      return DateTime.invalid(\n        \"mismatched weekday\",\n        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`\n      );\n    }\n\n    if (!inst.isValid) {\n      return DateTime.invalid(inst.invalid);\n    }\n\n    return inst;\n  }\n\n  /**\n   * Create a DateTime from an ISO 8601 string\n   * @param {string} text - the ISO string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance\n   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance\n   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})\n   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})\n   * @example DateTime.fromISO('2016-W05-4')\n   * @return {DateTime}\n   */\n  static fromISO(text, opts = {}) {\n    const [vals, parsedZone] = parseISODate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"ISO 8601\", text);\n  }\n\n  /**\n   * Create a DateTime from an RFC 2822 string\n   * @param {string} text - the RFC 2822 string\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')\n   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')\n   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')\n   * @return {DateTime}\n   */\n  static fromRFC2822(text, opts = {}) {\n    const [vals, parsedZone] = parseRFC2822Date(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"RFC 2822\", text);\n  }\n\n  /**\n   * Create a DateTime from an HTTP header date\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @param {string} text - the HTTP header date\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.\n   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.\n   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')\n   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')\n   * @return {DateTime}\n   */\n  static fromHTTP(text, opts = {}) {\n    const [vals, parsedZone] = parseHTTPDate(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"HTTP\", opts);\n  }\n\n  /**\n   * Create a DateTime from an input string and format string.\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @return {DateTime}\n   */\n  static fromFormat(text, fmt, opts = {}) {\n    if (isUndefined(text) || isUndefined(fmt)) {\n      throw new InvalidArgumentError(\"fromFormat requires an input string and a format\");\n    }\n\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      }),\n      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);\n    if (invalid) {\n      return DateTime.invalid(invalid);\n    } else {\n      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);\n    }\n  }\n\n  /**\n   * @deprecated use fromFormat instead\n   */\n  static fromString(text, fmt, opts = {}) {\n    return DateTime.fromFormat(text, fmt, opts);\n  }\n\n  /**\n   * Create a DateTime from a SQL date, time, or datetime\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale\n   * @param {string} text - the string to parse\n   * @param {Object} opts - options to affect the creation\n   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone\n   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one\n   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale\n   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system\n   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance\n   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance\n   * @example DateTime.fromSQL('2017-05-15')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })\n   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })\n   * @example DateTime.fromSQL('09:12:34.342')\n   * @return {DateTime}\n   */\n  static fromSQL(text, opts = {}) {\n    const [vals, parsedZone] = parseSQL(text);\n    return parseDataToDateTime(vals, parsedZone, opts, \"SQL\", text);\n  }\n\n  /**\n   * Create an invalid DateTime.\n   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.\n   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information\n   * @return {DateTime}\n   */\n  static invalid(reason, explanation = null) {\n    if (!reason) {\n      throw new InvalidArgumentError(\"need to specify a reason the DateTime is invalid\");\n    }\n\n    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);\n\n    if (Settings.throwOnInvalid) {\n      throw new InvalidDateTimeError(invalid);\n    } else {\n      return new DateTime({ invalid });\n    }\n  }\n\n  /**\n   * Check if an object is an instance of DateTime. Works across context boundaries\n   * @param {object} o\n   * @return {boolean}\n   */\n  static isDateTime(o) {\n    return (o && o.isLuxonDateTime) || false;\n  }\n\n  /**\n   * Produce the format string for a set of options\n   * @param formatOpts\n   * @param localeOpts\n   * @returns {string}\n   */\n  static parseFormatForOpts(formatOpts, localeOpts = {}) {\n    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));\n    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join(\"\");\n  }\n\n  /**\n   * Produce the the fully expanded format token for the locale\n   * Does NOT quote characters, so quoted tokens will not round trip correctly\n   * @param fmt\n   * @param localeOpts\n   * @returns {string}\n   */\n  static expandFormat(fmt, localeOpts = {}) {\n    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));\n    return expanded.map((t) => t.val).join(\"\");\n  }\n\n  static resetCache() {\n    zoneOffsetTs = undefined;\n    zoneOffsetGuessCache.clear();\n  }\n\n  // INFO\n\n  /**\n   * Get the value of unit.\n   * @param {string} unit - a unit such as 'minute' or 'day'\n   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7\n   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4\n   * @return {number}\n   */\n  get(unit) {\n    return this[unit];\n  }\n\n  /**\n   * Returns whether the DateTime is valid. Invalid DateTimes occur when:\n   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30\n   * * The DateTime was created by an operation on another invalid date\n   * @type {boolean}\n   */\n  get isValid() {\n    return this.invalid === null;\n  }\n\n  /**\n   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidReason() {\n    return this.invalid ? this.invalid.reason : null;\n  }\n\n  /**\n   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid\n   * @type {string}\n   */\n  get invalidExplanation() {\n    return this.invalid ? this.invalid.explanation : null;\n  }\n\n  /**\n   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get locale() {\n    return this.isValid ? this.loc.locale : null;\n  }\n\n  /**\n   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get numberingSystem() {\n    return this.isValid ? this.loc.numberingSystem : null;\n  }\n\n  /**\n   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime\n   *\n   * @type {string}\n   */\n  get outputCalendar() {\n    return this.isValid ? this.loc.outputCalendar : null;\n  }\n\n  /**\n   * Get the time zone associated with this DateTime.\n   * @type {Zone}\n   */\n  get zone() {\n    return this._zone;\n  }\n\n  /**\n   * Get the name of the time zone.\n   * @type {string}\n   */\n  get zoneName() {\n    return this.isValid ? this.zone.name : null;\n  }\n\n  /**\n   * Get the year\n   * @example DateTime.local(2017, 5, 25).year //=> 2017\n   * @type {number}\n   */\n  get year() {\n    return this.isValid ? this.c.year : NaN;\n  }\n\n  /**\n   * Get the quarter\n   * @example DateTime.local(2017, 5, 25).quarter //=> 2\n   * @type {number}\n   */\n  get quarter() {\n    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;\n  }\n\n  /**\n   * Get the month (1-12).\n   * @example DateTime.local(2017, 5, 25).month //=> 5\n   * @type {number}\n   */\n  get month() {\n    return this.isValid ? this.c.month : NaN;\n  }\n\n  /**\n   * Get the day of the month (1-30ish).\n   * @example DateTime.local(2017, 5, 25).day //=> 25\n   * @type {number}\n   */\n  get day() {\n    return this.isValid ? this.c.day : NaN;\n  }\n\n  /**\n   * Get the hour of the day (0-23).\n   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9\n   * @type {number}\n   */\n  get hour() {\n    return this.isValid ? this.c.hour : NaN;\n  }\n\n  /**\n   * Get the minute of the hour (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30\n   * @type {number}\n   */\n  get minute() {\n    return this.isValid ? this.c.minute : NaN;\n  }\n\n  /**\n   * Get the second of the minute (0-59).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52\n   * @type {number}\n   */\n  get second() {\n    return this.isValid ? this.c.second : NaN;\n  }\n\n  /**\n   * Get the millisecond of the second (0-999).\n   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654\n   * @type {number}\n   */\n  get millisecond() {\n    return this.isValid ? this.c.millisecond : NaN;\n  }\n\n  /**\n   * Get the week year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015\n   * @type {number}\n   */\n  get weekYear() {\n    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the week number of the week year (1-52ish).\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21\n   * @type {number}\n   */\n  get weekNumber() {\n    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the day of the week.\n   * 1 is Monday and 7 is Sunday\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2014, 11, 31).weekday //=> 4\n   * @type {number}\n   */\n  get weekday() {\n    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Returns true if this date is on a weekend according to the locale, false otherwise\n   * @returns {boolean}\n   */\n  get isWeekend() {\n    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);\n  }\n\n  /**\n   * Get the day of the week according to the locale.\n   * 1 is the first day of the week and 7 is the last day of the week.\n   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,\n   * @returns {number}\n   */\n  get localWeekday() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;\n  }\n\n  /**\n   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,\n   * because the week can start on different days of the week (see localWeekday) and because a different number of days\n   * is required for a week to count as the first week of a year.\n   * @returns {number}\n   */\n  get localWeekNumber() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;\n  }\n\n  /**\n   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)\n   * differently, see localWeekNumber.\n   * @returns {number}\n   */\n  get localWeekYear() {\n    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;\n  }\n\n  /**\n   * Get the ordinal (meaning the day of the year)\n   * @example DateTime.local(2017, 5, 25).ordinal //=> 145\n   * @type {number|DateTime}\n   */\n  get ordinal() {\n    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;\n  }\n\n  /**\n   * Get the human readable short month name, such as 'Oct'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct\n   * @type {string}\n   */\n  get monthShort() {\n    return this.isValid ? Info.months(\"short\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable long month name, such as 'October'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).monthLong //=> October\n   * @type {string}\n   */\n  get monthLong() {\n    return this.isValid ? Info.months(\"long\", { locObj: this.loc })[this.month - 1] : null;\n  }\n\n  /**\n   * Get the human readable short weekday, such as 'Mon'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon\n   * @type {string}\n   */\n  get weekdayShort() {\n    return this.isValid ? Info.weekdays(\"short\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the human readable long weekday, such as 'Monday'.\n   * Defaults to the system's locale if no locale has been specified\n   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday\n   * @type {string}\n   */\n  get weekdayLong() {\n    return this.isValid ? Info.weekdays(\"long\", { locObj: this.loc })[this.weekday - 1] : null;\n  }\n\n  /**\n   * Get the UTC offset of this DateTime in minutes\n   * @example DateTime.now().offset //=> -240\n   * @example DateTime.utc().offset //=> 0\n   * @type {number}\n   */\n  get offset() {\n    return this.isValid ? +this.o : NaN;\n  }\n\n  /**\n   * Get the short human name for the zone's current offset, for example \"EST\" or \"EDT\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameShort() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"short\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get the long human name for the zone's current offset, for example \"Eastern Standard Time\" or \"Eastern Daylight Time\".\n   * Defaults to the system's locale if no locale has been specified\n   * @type {string}\n   */\n  get offsetNameLong() {\n    if (this.isValid) {\n      return this.zone.offsetName(this.ts, {\n        format: \"long\",\n        locale: this.locale,\n      });\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Get whether this zone's offset ever changes, as in a DST.\n   * @type {boolean}\n   */\n  get isOffsetFixed() {\n    return this.isValid ? this.zone.isUniversal : null;\n  }\n\n  /**\n   * Get whether the DateTime is in a DST.\n   * @type {boolean}\n   */\n  get isInDST() {\n    if (this.isOffsetFixed) {\n      return false;\n    } else {\n      return (\n        this.offset > this.set({ month: 1, day: 1 }).offset ||\n        this.offset > this.set({ month: 5 }).offset\n      );\n    }\n  }\n\n  /**\n   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC\n   * in this DateTime's zone. During DST changes local time can be ambiguous, for example\n   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.\n   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.\n   * @returns {DateTime[]}\n   */\n  getPossibleOffsets() {\n    if (!this.isValid || this.isOffsetFixed) {\n      return [this];\n    }\n    const dayMs = 86400000;\n    const minuteMs = 60000;\n    const localTS = objToLocalTS(this.c);\n    const oEarlier = this.zone.offset(localTS - dayMs);\n    const oLater = this.zone.offset(localTS + dayMs);\n\n    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);\n    const o2 = this.zone.offset(localTS - oLater * minuteMs);\n    if (o1 === o2) {\n      return [this];\n    }\n    const ts1 = localTS - o1 * minuteMs;\n    const ts2 = localTS - o2 * minuteMs;\n    const c1 = tsToObj(ts1, o1);\n    const c2 = tsToObj(ts2, o2);\n    if (\n      c1.hour === c2.hour &&\n      c1.minute === c2.minute &&\n      c1.second === c2.second &&\n      c1.millisecond === c2.millisecond\n    ) {\n      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];\n    }\n    return [this];\n  }\n\n  /**\n   * Returns true if this DateTime is in a leap year, false otherwise\n   * @example DateTime.local(2016).isInLeapYear //=> true\n   * @example DateTime.local(2013).isInLeapYear //=> false\n   * @type {boolean}\n   */\n  get isInLeapYear() {\n    return isLeapYear(this.year);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's month\n   * @example DateTime.local(2016, 2).daysInMonth //=> 29\n   * @example DateTime.local(2016, 3).daysInMonth //=> 31\n   * @type {number}\n   */\n  get daysInMonth() {\n    return daysInMonth(this.year, this.month);\n  }\n\n  /**\n   * Returns the number of days in this DateTime's year\n   * @example DateTime.local(2016).daysInYear //=> 366\n   * @example DateTime.local(2013).daysInYear //=> 365\n   * @type {number}\n   */\n  get daysInYear() {\n    return this.isValid ? daysInYear(this.year) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's year\n   * @see https://en.wikipedia.org/wiki/ISO_week_date\n   * @example DateTime.local(2004).weeksInWeekYear //=> 53\n   * @example DateTime.local(2013).weeksInWeekYear //=> 52\n   * @type {number}\n   */\n  get weeksInWeekYear() {\n    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;\n  }\n\n  /**\n   * Returns the number of weeks in this DateTime's local week year\n   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52\n   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53\n   * @type {number}\n   */\n  get weeksInLocalWeekYear() {\n    return this.isValid\n      ? weeksInWeekYear(\n          this.localWeekYear,\n          this.loc.getMinDaysInFirstWeek(),\n          this.loc.getStartOfWeek()\n        )\n      : NaN;\n  }\n\n  /**\n   * Returns the resolved Intl options for this DateTime.\n   * This is useful in understanding the behavior of formatting methods\n   * @param {Object} opts - the same options as toLocaleString\n   * @return {Object}\n   */\n  resolvedLocaleOptions(opts = {}) {\n    const { locale, numberingSystem, calendar } = Formatter.create(\n      this.loc.clone(opts),\n      opts\n    ).resolvedOptions(this);\n    return { locale, numberingSystem, outputCalendar: calendar };\n  }\n\n  // TRANSFORM\n\n  /**\n   * \"Set\" the DateTime's zone to UTC. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to {@link DateTime#setZone}('utc')\n   * @param {number} [offset=0] - optionally, an offset from UTC in minutes\n   * @param {Object} [opts={}] - options to pass to `setZone()`\n   * @return {DateTime}\n   */\n  toUTC(offset = 0, opts = {}) {\n    return this.setZone(FixedOffsetZone.instance(offset), opts);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.\n   *\n   * Equivalent to `setZone('local')`\n   * @return {DateTime}\n   */\n  toLocal() {\n    return this.setZone(Settings.defaultZone);\n  }\n\n  /**\n   * \"Set\" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.\n   *\n   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.\n   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.\n   * @return {DateTime}\n   */\n  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {\n    zone = normalizeZone(zone, Settings.defaultZone);\n    if (zone.equals(this.zone)) {\n      return this;\n    } else if (!zone.isValid) {\n      return DateTime.invalid(unsupportedZone(zone));\n    } else {\n      let newTS = this.ts;\n      if (keepLocalTime || keepCalendarTime) {\n        const offsetGuess = zone.offset(this.ts);\n        const asObj = this.toObject();\n        [newTS] = objToTS(asObj, offsetGuess, zone);\n      }\n      return clone(this, { ts: newTS, zone });\n    }\n  }\n\n  /**\n   * \"Set\" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.\n   * @param {Object} properties - the properties to set\n   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })\n   * @return {DateTime}\n   */\n  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {\n    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });\n    return clone(this, { loc });\n  }\n\n  /**\n   * \"Set\" the locale. Returns a newly-constructed DateTime.\n   * Just a convenient alias for reconfigure({ locale })\n   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')\n   * @return {DateTime}\n   */\n  setLocale(locale) {\n    return this.reconfigure({ locale });\n  }\n\n  /**\n   * \"Set\" the values of specified units. Returns a newly-constructed DateTime.\n   * You can only set units with this method; for \"setting\" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.\n   *\n   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.\n   * They cannot be mixed with ISO-week units like `weekday`.\n   * @param {Object} values - a mapping of units to numbers\n   * @example dt.set({ year: 2017 })\n   * @example dt.set({ hour: 8, minute: 30 })\n   * @example dt.set({ weekday: 5 })\n   * @example dt.set({ year: 2005, ordinal: 234 })\n   * @return {DateTime}\n   */\n  set(values) {\n    if (!this.isValid) return this;\n\n    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);\n    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);\n\n    const settingWeekStuff =\n        !isUndefined(normalized.weekYear) ||\n        !isUndefined(normalized.weekNumber) ||\n        !isUndefined(normalized.weekday),\n      containsOrdinal = !isUndefined(normalized.ordinal),\n      containsGregorYear = !isUndefined(normalized.year),\n      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),\n      containsGregor = containsGregorYear || containsGregorMD,\n      definiteWeekDef = normalized.weekYear || normalized.weekNumber;\n\n    if ((containsGregor || containsOrdinal) && definiteWeekDef) {\n      throw new ConflictingSpecificationError(\n        \"Can't mix weekYear/weekNumber units with year/month/day or ordinals\"\n      );\n    }\n\n    if (containsGregorMD && containsOrdinal) {\n      throw new ConflictingSpecificationError(\"Can't mix ordinal dates with month/day\");\n    }\n\n    let mixed;\n    if (settingWeekStuff) {\n      mixed = weekToGregorian(\n        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },\n        minDaysInFirstWeek,\n        startOfWeek\n      );\n    } else if (!isUndefined(normalized.ordinal)) {\n      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });\n    } else {\n      mixed = { ...this.toObject(), ...normalized };\n\n      // if we didn't set the day but we ended up on an overflow date,\n      // use the last day of the right month\n      if (isUndefined(normalized.day)) {\n        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);\n      }\n    }\n\n    const [ts, o] = objToTS(mixed, this.o, this.zone);\n    return clone(this, { ts, o });\n  }\n\n  /**\n   * Add a period of time to this DateTime and return the resulting DateTime\n   *\n   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.\n   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   * @example DateTime.now().plus(123) //~> in 123 milliseconds\n   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes\n   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow\n   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday\n   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min\n   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min\n   * @return {DateTime}\n   */\n  plus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration);\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * Subtract a period of time to this DateTime and return the resulting DateTime\n   * See {@link DateTime#plus}\n   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()\n   @return {DateTime}\n   */\n  minus(duration) {\n    if (!this.isValid) return this;\n    const dur = Duration.fromDurationLike(duration).negate();\n    return clone(this, adjustTime(this, dur));\n  }\n\n  /**\n   * \"Set\" this DateTime to the beginning of a unit of time.\n   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'\n   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'\n   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'\n   * @return {DateTime}\n   */\n  startOf(unit, { useLocaleWeeks = false } = {}) {\n    if (!this.isValid) return this;\n\n    const o = {},\n      normalizedUnit = Duration.normalizeUnit(unit);\n    switch (normalizedUnit) {\n      case \"years\":\n        o.month = 1;\n      // falls through\n      case \"quarters\":\n      case \"months\":\n        o.day = 1;\n      // falls through\n      case \"weeks\":\n      case \"days\":\n        o.hour = 0;\n      // falls through\n      case \"hours\":\n        o.minute = 0;\n      // falls through\n      case \"minutes\":\n        o.second = 0;\n      // falls through\n      case \"seconds\":\n        o.millisecond = 0;\n        break;\n      case \"milliseconds\":\n        break;\n      // no default, invalid units throw in normalizeUnit()\n    }\n\n    if (normalizedUnit === \"weeks\") {\n      if (useLocaleWeeks) {\n        const startOfWeek = this.loc.getStartOfWeek();\n        const { weekday } = this;\n        if (weekday < startOfWeek) {\n          o.weekNumber = this.weekNumber - 1;\n        }\n        o.weekday = startOfWeek;\n      } else {\n        o.weekday = 1;\n      }\n    }\n\n    if (normalizedUnit === \"quarters\") {\n      const q = Math.ceil(this.month / 3);\n      o.month = (q - 1) * 3 + 1;\n    }\n\n    return this.set(o);\n  }\n\n  /**\n   * \"Set\" this DateTime to the end (meaning the last millisecond) of a unit of time\n   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week\n   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'\n   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'\n   * @return {DateTime}\n   */\n  endOf(unit, opts) {\n    return this.isValid\n      ? this.plus({ [unit]: 1 })\n          .startOf(unit, opts)\n          .minus(1)\n      : this;\n  }\n\n  // OUTPUT\n\n  /**\n   * Returns a string representation of this DateTime formatted according to the specified format string.\n   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).\n   * Defaults to en-US if no locale has been specified, regardless of the system's locale.\n   * @param {string} fmt - the format string\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'\n   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: \"fr\" }) //=> '2017 avr. 22'\n   * @example DateTime.now().toFormat(\"HH 'hours and' mm 'minutes'\") //=> '20 hours and 55 minutes'\n   * @return {string}\n   */\n  toFormat(fmt, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)\n      : INVALID;\n  }\n\n  /**\n   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.\n   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation\n   * of the DateTime in the assigned locale.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat\n   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options\n   * @param {Object} opts - opts to override the configuration options on this DateTime\n   * @example DateTime.now().toLocaleString(); //=> 4/20/2017\n   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'\n   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'\n   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'\n   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'\n   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'\n   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'\n   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'\n   * @return {string}\n   */\n  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)\n      : INVALID;\n  }\n\n  /**\n   * Returns an array of format \"parts\", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.\n   * Defaults to the system's locale if no locale has been specified\n   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts\n   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.\n   * @example DateTime.now().toLocaleParts(); //=> [\n   *                                   //=>   { type: 'day', value: '25' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'month', value: '05' },\n   *                                   //=>   { type: 'literal', value: '/' },\n   *                                   //=>   { type: 'year', value: '1982' }\n   *                                   //=> ]\n   */\n  toLocaleParts(opts = {}) {\n    return this.isValid\n      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)\n      : [];\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'\n   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'\n   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'\n   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'\n   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'\n   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'\n   * @return {string|null}\n   */\n  toISO({\n    format = \"extended\",\n    suppressSeconds = false,\n    suppressMilliseconds = false,\n    includeOffset = true,\n    extendedZone = false,\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    const ext = format === \"extended\";\n\n    let c = toISODate(this, ext, precision);\n    if (orderedUnits.indexOf(precision) >= 3) c += \"T\";\n    c += toISOTime(\n      this,\n      ext,\n      suppressSeconds,\n      suppressMilliseconds,\n      includeOffset,\n      extendedZone,\n      precision\n    );\n    return c;\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's date component\n   * @param {Object} opts - options\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.\n   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'\n   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'\n   * @return {string|null}\n   */\n  toISODate({ format = \"extended\", precision = \"day\" } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, format === \"extended\", normalizeUnit(precision));\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's week date\n   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'\n   * @return {string}\n   */\n  toISOWeekDate() {\n    return toTechFormat(this, \"kkkk-'W'WW-c\");\n  }\n\n  /**\n   * Returns an ISO 8601-compliant string representation of this DateTime's time component\n   * @param {Object} opts - options\n   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0\n   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension\n   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix\n   * @param {string} [opts.format='extended'] - choose between the basic and extended format\n   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'\n   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'\n   * @return {string}\n   */\n  toISOTime({\n    suppressMilliseconds = false,\n    suppressSeconds = false,\n    includeOffset = true,\n    includePrefix = false,\n    extendedZone = false,\n    format = \"extended\",\n    precision = \"milliseconds\",\n  } = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    precision = normalizeUnit(precision);\n    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? \"T\" : \"\";\n    return (\n      c +\n      toISOTime(\n        this,\n        format === \"extended\",\n        suppressSeconds,\n        suppressMilliseconds,\n        includeOffset,\n        extendedZone,\n        precision\n      )\n    );\n  }\n\n  /**\n   * Returns an RFC 2822-compatible string representation of this DateTime\n   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'\n   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'\n   * @return {string}\n   */\n  toRFC2822() {\n    return toTechFormat(this, \"EEE, dd LLL yyyy HH:mm:ss ZZZ\", false);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.\n   * Specifically, the string conforms to RFC 1123.\n   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1\n   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'\n   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'\n   * @return {string}\n   */\n  toHTTP() {\n    return toTechFormat(this.toUTC(), \"EEE, dd LLL yyyy HH:mm:ss 'GMT'\");\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Date\n   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'\n   * @return {string|null}\n   */\n  toSQLDate() {\n    if (!this.isValid) {\n      return null;\n    }\n    return toISODate(this, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL Time\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc().toSQL() //=> '05:15:16.345'\n   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'\n   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'\n   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'\n   * @return {string}\n   */\n  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {\n    let fmt = \"HH:mm:ss.SSS\";\n\n    if (includeZone || includeOffset) {\n      if (includeOffsetSpace) {\n        fmt += \" \";\n      }\n      if (includeZone) {\n        fmt += \"z\";\n      } else if (includeOffset) {\n        fmt += \"ZZ\";\n      }\n    }\n\n    return toTechFormat(this, fmt, true);\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for use in SQL DateTime\n   * @param {Object} opts - options\n   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.\n   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'\n   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'\n   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'\n   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'\n   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'\n   * @return {string}\n   */\n  toSQL(opts = {}) {\n    if (!this.isValid) {\n      return null;\n    }\n\n    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for debugging\n   * @return {string}\n   */\n  toString() {\n    return this.isValid ? this.toISO() : INVALID;\n  }\n\n  /**\n   * Returns a string representation of this DateTime appropriate for the REPL.\n   * @return {string}\n   */\n  [Symbol.for(\"nodejs.util.inspect.custom\")]() {\n    if (this.isValid) {\n      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;\n    } else {\n      return `DateTime { Invalid, reason: ${this.invalidReason} }`;\n    }\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}\n   * @return {number}\n   */\n  valueOf() {\n    return this.toMillis();\n  }\n\n  /**\n   * Returns the epoch milliseconds of this DateTime.\n   * @return {number}\n   */\n  toMillis() {\n    return this.isValid ? this.ts : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.\n   * @return {number}\n   */\n  toSeconds() {\n    return this.isValid ? this.ts / 1000 : NaN;\n  }\n\n  /**\n   * Returns the epoch seconds (as a whole number) of this DateTime.\n   * @return {number}\n   */\n  toUnixInteger() {\n    return this.isValid ? Math.floor(this.ts / 1000) : NaN;\n  }\n\n  /**\n   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.\n   * @return {string}\n   */\n  toJSON() {\n    return this.toISO();\n  }\n\n  /**\n   * Returns a BSON serializable equivalent to this DateTime.\n   * @return {Date}\n   */\n  toBSON() {\n    return this.toJSDate();\n  }\n\n  /**\n   * Returns a JavaScript object with this DateTime's year, month, day, and so on.\n   * @param opts - options for generating the object\n   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output\n   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }\n   * @return {Object}\n   */\n  toObject(opts = {}) {\n    if (!this.isValid) return {};\n\n    const base = { ...this.c };\n\n    if (opts.includeConfig) {\n      base.outputCalendar = this.outputCalendar;\n      base.numberingSystem = this.loc.numberingSystem;\n      base.locale = this.loc.locale;\n    }\n    return base;\n  }\n\n  /**\n   * Returns a JavaScript Date equivalent to this DateTime.\n   * @return {Date}\n   */\n  toJSDate() {\n    return new Date(this.isValid ? this.ts : NaN);\n  }\n\n  // COMPARE\n\n  /**\n   * Return the difference between two DateTimes as a Duration.\n   * @param {DateTime} otherDateTime - the DateTime to compare this one to\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @example\n   * var i1 = DateTime.fromISO('1982-05-25T09:45'),\n   *     i2 = DateTime.fromISO('1983-10-14T10:30');\n   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }\n   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }\n   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }\n   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }\n   * @return {Duration}\n   */\n  diff(otherDateTime, unit = \"milliseconds\", opts = {}) {\n    if (!this.isValid || !otherDateTime.isValid) {\n      return Duration.invalid(\"created by diffing an invalid DateTime\");\n    }\n\n    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };\n\n    const units = maybeArray(unit).map(Duration.normalizeUnit),\n      otherIsLater = otherDateTime.valueOf() > this.valueOf(),\n      earlier = otherIsLater ? this : otherDateTime,\n      later = otherIsLater ? otherDateTime : this,\n      diffed = diff(earlier, later, units, durOpts);\n\n    return otherIsLater ? diffed.negate() : diffed;\n  }\n\n  /**\n   * Return the difference between this DateTime and right now.\n   * See {@link DateTime#diff}\n   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration\n   * @param {Object} opts - options that affect the creation of the Duration\n   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use\n   * @return {Duration}\n   */\n  diffNow(unit = \"milliseconds\", opts = {}) {\n    return this.diff(DateTime.now(), unit, opts);\n  }\n\n  /**\n   * Return an Interval spanning between this DateTime and another DateTime\n   * @param {DateTime} otherDateTime - the other end point of the Interval\n   * @return {Interval|DateTime}\n   */\n  until(otherDateTime) {\n    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;\n  }\n\n  /**\n   * Return whether this DateTime is in the same unit of time as another DateTime.\n   * Higher-order units must also be identical for this function to return `true`.\n   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.\n   * @param {DateTime} otherDateTime - the other DateTime\n   * @param {string} unit - the unit of time to check sameness on\n   * @param {Object} opts - options\n   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used\n   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day\n   * @return {boolean}\n   */\n  hasSame(otherDateTime, unit, opts) {\n    if (!this.isValid) return false;\n\n    const inputMs = otherDateTime.valueOf();\n    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });\n    return (\n      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)\n    );\n  }\n\n  /**\n   * Equality check\n   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.\n   * To compare just the millisecond values, use `+dt1 === +dt2`.\n   * @param {DateTime} other - the other DateTime\n   * @return {boolean}\n   */\n  equals(other) {\n    return (\n      this.isValid &&\n      other.isValid &&\n      this.valueOf() === other.valueOf() &&\n      this.zone.equals(other.zone) &&\n      this.loc.equals(other.loc)\n    );\n  }\n\n  /**\n   * Returns a string representation of a this time relative to now, such as \"in two days\". Can only internationalize if your\n   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} [options.style=\"long\"] - the style of units, must be \"long\", \"short\", or \"narrow\"\n   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of \"years\", \"quarters\", \"months\", \"weeks\", \"days\", \"hours\", \"minutes\", or \"seconds\"\n   * @param {boolean} [options.round=true] - whether to round the numbers in the output.\n   * @param {string} [options.rounding=\"trunc\"] - rounding method to use when rounding the numbers in the output. Can be \"trunc\" (toward zero), \"expand\" (away from zero), \"round\", \"floor\", or \"ceil\".\n   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> \"in 1 day\"\n   * @example DateTime.now().setLocale(\"es\").toRelative({ days: 1 }) //=> \"dentro de 1 día\"\n   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: \"fr\" }) //=> \"dans 23 heures\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> \"2 days ago\"\n   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: \"hours\" }) //=> \"48 hours ago\"\n   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> \"1.5 days ago\"\n   */\n  toRelative(options = {}) {\n    if (!this.isValid) return null;\n    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),\n      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;\n    let units = [\"years\", \"months\", \"days\", \"hours\", \"minutes\", \"seconds\"];\n    let unit = options.unit;\n    if (Array.isArray(options.unit)) {\n      units = options.unit;\n      unit = undefined;\n    }\n    return diffRelative(base, this.plus(padding), {\n      ...options,\n      numeric: \"always\",\n      units,\n      unit,\n    });\n  }\n\n  /**\n   * Returns a string representation of this date relative to today, such as \"yesterday\" or \"next month\".\n   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.\n   * @param {Object} options - options that affect the output\n   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.\n   * @param {string} options.locale - override the locale of this DateTime\n   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of \"years\", \"quarters\", \"months\", \"weeks\", or \"days\"\n   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> \"tomorrow\"\n   * @example DateTime.now().setLocale(\"es\").plus({ days: 1 }).toRelative() //=> \"\"mañana\"\n   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: \"fr\" }) //=> \"demain\"\n   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> \"2 days ago\"\n   */\n  toRelativeCalendar(options = {}) {\n    if (!this.isValid) return null;\n\n    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {\n      ...options,\n      numeric: \"auto\",\n      units: [\"years\", \"months\", \"days\"],\n      calendary: true,\n    });\n  }\n\n  /**\n   * Return the min of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum\n   * @return {DateTime} the min DateTime, or undefined if called with no argument\n   */\n  static min(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"min requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);\n  }\n\n  /**\n   * Return the max of several date times\n   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum\n   * @return {DateTime} the max DateTime, or undefined if called with no argument\n   */\n  static max(...dateTimes) {\n    if (!dateTimes.every(DateTime.isDateTime)) {\n      throw new InvalidArgumentError(\"max requires all arguments be DateTimes\");\n    }\n    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);\n  }\n\n  // MISC\n\n  /**\n   * Explain how a string would be parsed by fromFormat()\n   * @param {string} text - the string to parse\n   * @param {string} fmt - the format the string is expected to be in (see description)\n   * @param {Object} options - options taken by fromFormat()\n   * @return {Object}\n   */\n  static fromFormatExplain(text, fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return explainFromTokens(localeToUse, text, fmt);\n  }\n\n  /**\n   * @deprecated use fromFormatExplain instead\n   */\n  static fromStringExplain(text, fmt, options = {}) {\n    return DateTime.fromFormatExplain(text, fmt, options);\n  }\n\n  /**\n   * Build a parser for `fmt` using the given locale. This parser can be passed\n   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This\n   * can be used to optimize cases where many dates need to be parsed in a\n   * specific format.\n   *\n   * @param {String} fmt - the format the string is expected to be in (see\n   * description)\n   * @param {Object} options - options used to set locale and numberingSystem\n   * for parser\n   * @returns {TokenParser} - opaque object to be used\n   */\n  static buildFormatParser(fmt, options = {}) {\n    const { locale = null, numberingSystem = null } = options,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n    return new TokenParser(localeToUse, fmt);\n  }\n\n  /**\n   * Create a DateTime from an input string and format parser.\n   *\n   * The format parser must have been created with the same locale as this call.\n   *\n   * @param {String} text - the string to parse\n   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}\n   * @param {Object} opts - options taken by fromFormat()\n   * @returns {DateTime}\n   */\n  static fromFormatParser(text, formatParser, opts = {}) {\n    if (isUndefined(text) || isUndefined(formatParser)) {\n      throw new InvalidArgumentError(\n        \"fromFormatParser requires an input string and a format parser\"\n      );\n    }\n    const { locale = null, numberingSystem = null } = opts,\n      localeToUse = Locale.fromOpts({\n        locale,\n        numberingSystem,\n        defaultToEN: true,\n      });\n\n    if (!localeToUse.equals(formatParser.locale)) {\n      throw new InvalidArgumentError(\n        `fromFormatParser called with a locale of ${localeToUse}, ` +\n          `but the format parser was created for ${formatParser.locale}`\n      );\n    }\n\n    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);\n\n    if (invalidReason) {\n      return DateTime.invalid(invalidReason);\n    } else {\n      return parseDataToDateTime(\n        result,\n        zone,\n        opts,\n        `format ${formatParser.format}`,\n        text,\n        specificOffset\n      );\n    }\n  }\n\n  // FORMAT PRESETS\n\n  /**\n   * {@link DateTime#toLocaleString} format like 10/14/1983\n   * @type {Object}\n   */\n  static get DATE_SHORT() {\n    return Formats.DATE_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED() {\n    return Formats.DATE_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_MED_WITH_WEEKDAY() {\n    return Formats.DATE_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_FULL() {\n    return Formats.DATE_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'\n   * @type {Object}\n   */\n  static get DATE_HUGE() {\n    return Formats.DATE_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_SIMPLE() {\n    return Formats.TIME_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SECONDS() {\n    return Formats.TIME_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_SHORT_OFFSET() {\n    return Formats.TIME_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get TIME_WITH_LONG_OFFSET() {\n    return Formats.TIME_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_SIMPLE() {\n    return Formats.TIME_24_SIMPLE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SECONDS() {\n    return Formats.TIME_24_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_SHORT_OFFSET() {\n    return Formats.TIME_24_WITH_SHORT_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.\n   * @type {Object}\n   */\n  static get TIME_24_WITH_LONG_OFFSET() {\n    return Formats.TIME_24_WITH_LONG_OFFSET;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT() {\n    return Formats.DATETIME_SHORT;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_SHORT_WITH_SECONDS() {\n    return Formats.DATETIME_SHORT_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED() {\n    return Formats.DATETIME_MED;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_SECONDS() {\n    return Formats.DATETIME_MED_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_MED_WITH_WEEKDAY() {\n    return Formats.DATETIME_MED_WITH_WEEKDAY;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL() {\n    return Formats.DATETIME_FULL;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_FULL_WITH_SECONDS() {\n    return Formats.DATETIME_FULL_WITH_SECONDS;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE() {\n    return Formats.DATETIME_HUGE;\n  }\n\n  /**\n   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.\n   * @type {Object}\n   */\n  static get DATETIME_HUGE_WITH_SECONDS() {\n    return Formats.DATETIME_HUGE_WITH_SECONDS;\n  }\n}\n\n/**\n * @private\n */\nexport function friendlyDateTime(dateTimeish) {\n  if (DateTime.isDateTime(dateTimeish)) {\n    return dateTimeish;\n  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {\n    return DateTime.fromJSDate(dateTimeish);\n  } else if (dateTimeish && typeof dateTimeish === \"object\") {\n    return DateTime.fromObject(dateTimeish);\n  } else {\n    throw new InvalidArgumentError(\n      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`\n    );\n  }\n}\n","import DateTime from \"./datetime.js\";\nimport Duration from \"./duration.js\";\nimport Interval from \"./interval.js\";\nimport Info from \"./info.js\";\nimport Zone from \"./zone.js\";\nimport FixedOffsetZone from \"./zones/fixedOffsetZone.js\";\nimport IANAZone from \"./zones/IANAZone.js\";\nimport InvalidZone from \"./zones/invalidZone.js\";\nimport SystemZone from \"./zones/systemZone.js\";\nimport Settings from \"./settings.js\";\n\nconst VERSION = \"3.7.2\";\n\nexport {\n  VERSION,\n  DateTime,\n  Duration,\n  Interval,\n  Info,\n  Zone,\n  FixedOffsetZone,\n  IANAZone,\n  InvalidZone,\n  SystemZone,\n  Settings,\n};\n"],"names":["LuxonError","Error","InvalidDateTimeError","constructor","reason","toMessage","InvalidIntervalError","InvalidDurationError","ConflictingSpecificationError","InvalidUnitError","unit","InvalidArgumentError","ZoneIsAbstractError","n","s","l","DATE_SHORT","year","month","day","DATE_MED","DATE_MED_WITH_WEEKDAY","weekday","DATE_FULL","DATE_HUGE","TIME_SIMPLE","hour","minute","TIME_WITH_SECONDS","second","TIME_WITH_SHORT_OFFSET","timeZoneName","TIME_WITH_LONG_OFFSET","TIME_24_SIMPLE","hourCycle","TIME_24_WITH_SECONDS","TIME_24_WITH_SHORT_OFFSET","TIME_24_WITH_LONG_OFFSET","DATETIME_SHORT","DATETIME_SHORT_WITH_SECONDS","DATETIME_MED","DATETIME_MED_WITH_SECONDS","DATETIME_MED_WITH_WEEKDAY","DATETIME_FULL","DATETIME_FULL_WITH_SECONDS","DATETIME_HUGE","DATETIME_HUGE_WITH_SECONDS","Zone","type","name","ianaName","isUniversal","offsetName","ts","opts","formatOffset","format","offset","equals","otherZone","isValid","singleton","SystemZone","instance","Intl","DateTimeFormat","resolvedOptions","timeZone","locale","parseZoneInfo","Date","getTimezoneOffset","dtfCache","Map","makeDTF","zoneName","dtf","get","undefined","hour12","era","set","typeToPos","hackyOffset","date","formatted","replace","parsed","exec","fMonth","fDay","fYear","fadOrBc","fHour","fMinute","fSecond","partsOffset","formatToParts","filled","i","length","value","pos","isUndefined","parseInt","ianaZoneCache","IANAZone","create","zone","resetCache","clear","isValidSpecifier","isValidZone","e","valid","NaN","isNaN","adOrBc","Math","abs","adjustedHour","asUTC","objToLocalTS","millisecond","asTS","over","intlLFCache","getCachedLF","locString","key","JSON","stringify","ListFormat","intlDTCache","getCachedDTF","intlNumCache","getCachedINF","inf","NumberFormat","intlRelCache","getCachedRTF","base","cacheKeyOpts","RelativeTimeFormat","sysLocaleCache","systemLocale","intlResolvedOptionsCache","getCachedIntResolvedOptions","weekInfoCache","getCachedWeekInfo","data","Locale","getWeekInfo","weekInfo","fallbackWeekSettings","parseLocaleString","localeStr","xIndex","indexOf","substring","uIndex","options","selectedStr","smaller","numberingSystem","calendar","intlConfigString","outputCalendar","includes","mapMonths","f","ms","dt","DateTime","utc","push","mapWeekdays","listStuff","loc","englishFn","intlFn","mode","listingMode","supportsFastNumbers","startsWith","PolyNumberFormatter","intl","forceSimple","padTo","floor","otherOpts","Object","keys","intlOpts","useGrouping","minimumIntegerDigits","fixed","roundTo","padStart","PolyDateFormatter","originalZone","z","gmtOffset","offsetZ","setZone","plus","minutes","map","join","toJSDate","parts","part","PolyRelFormatter","isEnglish","style","hasRelative","rtf","count","English","numeric","firstDay","minimalDays","weekend","fromOpts","weekSettings","defaultToEN","specifiedLocale","Settings","defaultLocale","localeR","numberingSystemR","defaultNumberingSystem","outputCalendarR","defaultOutputCalendar","weekSettingsR","validateWeekSettings","defaultWeekSettings","fromObject","numbering","parsedLocale","parsedNumberingSystem","parsedOutputCalendar","weekdaysCache","standalone","monthsCache","meridiemCache","eraCache","fastNumbersCached","fastNumbers","isActuallyEn","hasNoWeirdness","clone","alts","getOwnPropertyNames","redefaultToEN","redefaultToSystem","months","monthSpecialCase","formatStr","mapper","extract","dtFormatter","weekdays","meridiems","eras","field","df","results","matching","find","m","toLowerCase","numberFormatter","relFormatter","listFormatter","getWeekSettings","hasLocaleWeekInfo","getStartOfWeek","getMinDaysInFirstWeek","getWeekendDays","other","toString","FixedOffsetZone","utcInstance","parseSpecifier","r","match","signedOffset","InvalidZone","normalizeZone","input","defaultZone","isString","lowered","isNumber","numberingSystems","arab","arabext","bali","beng","deva","fullwide","gujr","hanidec","khmr","knda","laoo","limb","mlym","mong","mymr","orya","tamldec","telu","thai","tibt","latn","numberingSystemsUTF16","hanidecChars","split","parseDigits","str","code","charCodeAt","search","min","max","digitRegexCache","resetDigitRegexCache","digitRegex","append","ns","appendCache","regex","RegExp","now","twoDigitCutoffYear","throwOnInvalid","cutoffYear","t","resetCaches","Invalid","explanation","nonLeapLadder","leapLadder","unitOutOfRange","dayOfWeek","d","UTC","setUTCFullYear","getUTCFullYear","js","getUTCDay","computeOrdinal","isLeapYear","uncomputeOrdinal","ordinal","table","month0","findIndex","isoWeekdayToLocal","isoWeekday","startOfWeek","gregorianToWeek","gregObj","minDaysInFirstWeek","weekNumber","weekYear","weeksInWeekYear","timeObject","weekToGregorian","weekData","weekdayOfJan4","yearInDays","daysInYear","gregorianToOrdinal","gregData","ordinalToGregorian","ordinalData","usesLocalWeekValues","obj","hasLocaleWeekData","localWeekday","localWeekNumber","localWeekYear","hasIsoWeekData","hasInvalidWeekData","validYear","isInteger","validWeek","integerBetween","validWeekday","hasInvalidOrdinalData","validOrdinal","hasInvalidGregorianData","validMonth","validDay","daysInMonth","hasInvalidTimeData","validHour","validMinute","validSecond","validMillisecond","o","isDate","prototype","call","maybeArray","thing","Array","isArray","bestBy","arr","by","compare","reduce","best","next","pair","pick","a","k","hasOwnProperty","prop","settings","some","v","from","bottom","top","floorMod","x","isNeg","padded","parseInteger","string","parseFloating","parseFloat","parseMillis","fraction","number","digits","rounding","factor","ceil","trunc","round","RangeError","modMonth","modYear","firstWeekOffset","fwdlw","weekOffset","weekOffsetNext","untruncateYear","offsetFormat","modified","offHourStr","offMinuteStr","offHour","Number","offMin","offMinSigned","is","asNumber","numericValue","isFinite","normalizeObject","normalizer","normalized","u","hours","sign","monthsLong","monthsShort","monthsNarrow","weekdaysLong","weekdaysShort","weekdaysNarrow","erasLong","erasShort","erasNarrow","meridiemForDateTime","weekdayForDateTime","monthForDateTime","eraForDateTime","formatRelativeTime","narrow","units","years","quarters","weeks","days","seconds","lastable","isDay","isInPast","fmtValue","singular","lilUnits","fmtUnit","stringifyTokens","splits","tokenToString","token","literal","val","macroTokenToFormatOpts","D","Formats","DD","DDD","DDDD","tt","ttt","tttt","T","TT","TTT","TTTT","ff","fff","ffff","F","FF","FFF","FFFF","Formatter","parseFormat","fmt","current","currentFull","bracketed","c","charAt","test","formatOpts","systemLoc","formatWithSystemDefault","formatDateTime","formatDateTimeParts","formatInterval","interval","start","formatRange","end","num","p","signDisplay","formatDateTimeFromString","knownEnglish","useDateTimeFormatter","isOffsetFixed","allowZ","meridiem","maybeMacro","slice","quarter","formatDurationFromString","dur","invertLargest","signMode","tokenToField","lildur","info","mapped","inversionFactor","isNegativeDuration","largestUnit","tokens","realTokens","found","concat","collapsed","shiftTo","filter","durationInfo","values","ianaRegex","combineRegexes","regexes","full","source","combineExtractors","extractors","mergedVals","mergedZone","cursor","ex","parse","patterns","extractor","simpleParse","ret","offsetRegex","isoExtendedZone","isoTimeBaseRegex","isoTimeRegex","isoTimeExtensionRegex","isoYmdRegex","isoWeekRegex","isoOrdinalRegex","extractISOWeekData","extractISOOrdinalData","sqlYmdRegex","sqlTimeRegex","sqlTimeExtensionRegex","int","fallback","extractISOYmd","item","extractISOTime","milliseconds","extractISOOffset","local","fullOffset","extractIANAZone","isoTimeOnly","isoDuration","extractISODuration","yearStr","monthStr","weekStr","dayStr","hourStr","minuteStr","secondStr","millisecondsStr","hasNegativePrefix","negativeSeconds","maybeNegate","force","obsOffsets","GMT","EDT","EST","CDT","CST","MDT","MST","PDT","PST","fromStrings","weekdayStr","result","rfc2822","extractRFC2822","obsOffset","milOffset","preprocessRFC2822","trim","rfc1123","rfc850","ascii","extractRFC1123Or850","extractASCII","isoYmdWithTimeExtensionRegex","isoWeekWithTimeExtensionRegex","isoOrdinalWithTimeExtensionRegex","isoTimeCombinedRegex","extractISOYmdTimeAndOffset","extractISOWeekTimeAndOffset","extractISOOrdinalDateAndTime","extractISOTimeAndOffset","parseISODate","parseRFC2822Date","parseHTTPDate","parseISODuration","extractISOTimeOnly","parseISOTimeOnly","sqlYmdWithTimeExtensionRegex","sqlTimeCombinedRegex","extractISOTimeOffsetAndIANAZone","parseSQL","INVALID","lowOrderMatrix","casualMatrix","daysInYearAccurate","daysInMonthAccurate","accurateMatrix","orderedUnits","reverseUnits","reverse","conf","conversionAccuracy","matrix","Duration","durationToMillis","vals","_vals$milliseconds","sum","normalizeValues","reduceRight","previous","previousVal","conv","rollUp","removeZeroes","newVals","entries","config","accurate","invalid","isLuxonDuration","fromMillis","normalizeUnit","fromDurationLike","durationLike","isDuration","fromISO","text","fromISOTime","week","toFormat","fmtOpts","toHuman","showZeros","unitDisplay","listStyle","toObject","toISO","toISOTime","millis","toMillis","suppressMilliseconds","suppressSeconds","includePrefix","includeOffset","dateTime","toJSON","Symbol","for","invalidReason","valueOf","duration","minus","negate","mapUnits","fn","mixed","reconfigure","as","normalize","rescale","shiftToAll","built","accumulated","lastUnit","own","ak","negated","removeZeros","invalidExplanation","eq","v1","v2","validateStartEnd","Interval","isLuxonInterval","fromDateTimes","builtStart","friendlyDateTime","builtEnd","validateError","after","before","startIsValid","endIsValid","isInterval","lastDateTime","toDuration","startOf","useLocaleWeeks","diff","hasSame","isEmpty","isAfter","isBefore","contains","splitAt","dateTimes","sorted","sort","b","added","splitBy","idx","divideEqually","numberOfParts","overlaps","abutsStart","abutsEnd","engulfs","intersection","union","merge","intervals","final","sofar","xor","currentCount","ends","time","flattened","difference","toLocaleString","toISODate","dateFormat","separator","mapEndpoints","mapFn","Info","hasDST","proto","isValidIANAZone","locObj","getMinimumDaysInFirstWeek","getWeekendWeekdays","monthsFormat","weekdaysFormat","features","relative","localeWeek","dayDiff","earlier","later","utcDayStart","toUTC","keepLocalTime","highOrderDiffs","differs","lowestOrder","highWater","differ","remainingMillis","lowerOrderUnits","MISSING_FTP","intUnit","post","deser","NBSP","String","fromCharCode","spaceOrNBSP","spaceOrNBSPRegExp","fixListRegex","stripInsensitivities","oneOf","strings","startIndex","groups","h","simple","escapeToken","unitForToken","one","two","three","four","six","oneOrTwo","oneToThree","oneToSix","oneToNine","twoToFour","fourToSix","unitate","partTypeStyleToTokenVal","short","long","dayperiod","dayPeriod","hour24","tokenForPart","resolvedOpts","isSpace","actualType","buildRegex","re","handlers","matches","all","matchIndex","dateTimeFromMatches","toField","specificOffset","Z","q","M","G","y","S","dummyDateTimeCache","getDummyDateTime","maybeExpandMacroToken","formatOptsToTokens","expandMacroTokens","TokenParser","disqualifyingUnit","regexString","explainFromTokens","rawMatches","parser","parseFromTokens","formatter","MAX_DATE","unsupportedZone","possiblyCachedWeekData","possiblyCachedLocalWeekData","localWeekData","inst","old","fixOffset","localTS","tz","utcGuess","o2","o3","tsToObj","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","getUTCMilliseconds","objToTS","adjustTime","oPre","millisToAdd","parseDataToDateTime","parsedZone","interpretationZone","toTechFormat","extended","precision","longFormat","extendedZone","showSeconds","defaultUnitValues","defaultWeekUnitValues","defaultOrdinalUnitValues","orderedWeekUnits","orderedOrdinalUnits","weeknumber","weeksnumber","weeknumbers","weekyear","weekyears","normalizeUnitWithLocalWeeks","guessOffsetForZone","zoneOffsetTs","offsetGuess","zoneOffsetGuessCache","quickDT","offsetProvis","diffRelative","calendary","lastOpts","argList","args","unchanged","ot","_zone","isLuxonDateTime","arguments","fromJSDate","zoneToUse","fromSeconds","tsNow","containsOrdinal","containsGregorYear","containsGregorMD","containsGregor","definiteWeekDef","useWeekData","defaultValues","objNow","foundFirst","higherOrderInvalid","gregorian","tsFinal","offsetFinal","fromRFC2822","fromHTTP","fromFormat","localeToUse","fromString","fromSQL","isDateTime","parseFormatForOpts","localeOpts","tokenList","expandFormat","expanded","isWeekend","monthShort","monthLong","weekdayShort","weekdayLong","offsetNameShort","offsetNameLong","isInDST","getPossibleOffsets","dayMs","minuteMs","oEarlier","oLater","o1","ts1","ts2","c1","c2","isInLeapYear","weeksInLocalWeekYear","resolvedLocaleOptions","toLocal","keepCalendarTime","newTS","asObj","setLocale","settingWeekStuff","normalizedUnit","endOf","toLocaleParts","ext","toISOWeekDate","toRFC2822","toHTTP","toSQLDate","toSQLTime","includeZone","includeOffsetSpace","toSQL","toSeconds","toUnixInteger","toBSON","includeConfig","otherDateTime","durOpts","otherIsLater","diffed","diffNow","until","inputMs","adjustedToZone","toRelative","padding","toRelativeCalendar","every","fromFormatExplain","fromStringExplain","buildFormatParser","fromFormatParser","formatParser","dateTimeish","VERSION"],"mappings":";;;;AAAA;;AAEA;AACA;AACA;AACA,MAAMA,UAAU,SAASC,KAAK,CAAC,EAAA;;AAE/B;AACA;AACA;AACO,MAAMC,oBAAoB,SAASF,UAAU,CAAC;EACnDG,WAAWA,CAACC,MAAM,EAAE;IAClB,KAAK,CAAE,qBAAoBA,MAAM,CAACC,SAAS,EAAG,EAAC,CAAC,CAAA;AAClD,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACO,MAAMC,oBAAoB,SAASN,UAAU,CAAC;EACnDG,WAAWA,CAACC,MAAM,EAAE;IAClB,KAAK,CAAE,qBAAoBA,MAAM,CAACC,SAAS,EAAG,EAAC,CAAC,CAAA;AAClD,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACO,MAAME,oBAAoB,SAASP,UAAU,CAAC;EACnDG,WAAWA,CAACC,MAAM,EAAE;IAClB,KAAK,CAAE,qBAAoBA,MAAM,CAACC,SAAS,EAAG,EAAC,CAAC,CAAA;AAClD,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACO,MAAMG,6BAA6B,SAASR,UAAU,CAAC,EAAA;;AAE9D;AACA;AACA;AACO,MAAMS,gBAAgB,SAAST,UAAU,CAAC;EAC/CG,WAAWA,CAACO,IAAI,EAAE;AAChB,IAAA,KAAK,CAAE,CAAA,aAAA,EAAeA,IAAK,CAAA,CAAC,CAAC,CAAA;AAC/B,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACO,MAAMC,oBAAoB,SAASX,UAAU,CAAC,EAAA;;AAErD;AACA;AACA;AACO,MAAMY,mBAAmB,SAASZ,UAAU,CAAC;AAClDG,EAAAA,WAAWA,GAAG;IACZ,KAAK,CAAC,2BAA2B,CAAC,CAAA;AACpC,GAAA;AACF;;AC5DA;AACA;AACA;;AAEA,MAAMU,CAAC,GAAG,SAAS;AACjBC,EAAAA,CAAC,GAAG,OAAO;AACXC,EAAAA,CAAC,GAAG,MAAM,CAAA;AAEL,MAAMC,UAAU,GAAG;AACxBC,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,MAAMO,QAAQ,GAAG;AACtBH,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,MAAMQ,qBAAqB,GAAG;AACnCJ,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAER,CAAAA;AACX,CAAC,CAAA;AAEM,MAAMS,SAAS,GAAG;AACvBN,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAAA;AACP,CAAC,CAAA;AAEM,MAAMW,SAAS,GAAG;AACvBP,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAAA;AACX,CAAC,CAAA;AAEM,MAAMU,WAAW,GAAG;AACzBC,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,MAAMe,iBAAiB,GAAG;AAC/BF,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,MAAMiB,sBAAsB,GAAG;AACpCJ,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAMkB,qBAAqB,GAAG;AACnCN,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAMkB,cAAc,GAAG;AAC5BP,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAA;AACb,CAAC,CAAA;AAEM,MAAMC,oBAAoB,GAAG;AAClCT,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAA;AACb,CAAC,CAAA;AAEM,MAAME,yBAAyB,GAAG;AACvCV,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAK;AAChBH,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAMuB,wBAAwB,GAAG;AACtCX,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTqB,EAAAA,SAAS,EAAE,KAAK;AAChBH,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAMuB,cAAc,GAAG;AAC5BrB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,MAAM0B,2BAA2B,GAAG;AACzCtB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEL,CAAC;AACRM,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,MAAM2B,YAAY,GAAG;AAC1BvB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,MAAM4B,yBAAyB,GAAG;AACvCxB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAAA;AACV,CAAC,CAAA;AAEM,MAAM6B,yBAAyB,GAAG;AACvCzB,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEJ,CAAC;AACRK,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAER,CAAC;AACVY,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAAA;AACV,CAAC,CAAA;AAEM,MAAM8B,aAAa,GAAG;AAC3B1B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAM8B,0BAA0B,GAAG;AACxC3B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNa,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEjB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAM+B,aAAa,GAAG;AAC3B5B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAC;AACVW,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC,CAAA;AAEM,MAAM+B,0BAA0B,GAAG;AACxC7B,EAAAA,IAAI,EAAEJ,CAAC;AACPK,EAAAA,KAAK,EAAEH,CAAC;AACRI,EAAAA,GAAG,EAAEN,CAAC;AACNS,EAAAA,OAAO,EAAEP,CAAC;AACVW,EAAAA,IAAI,EAAEb,CAAC;AACPc,EAAAA,MAAM,EAAEd,CAAC;AACTgB,EAAAA,MAAM,EAAEhB,CAAC;AACTkB,EAAAA,YAAY,EAAEhB,CAAAA;AAChB,CAAC;;AC7KD;AACA;AACA;AACe,MAAMgC,IAAI,CAAC;AACxB;AACF;AACA;AACA;AACA;EACE,IAAIC,IAAIA,GAAG;IACT,MAAM,IAAIpC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIqC,IAAIA,GAAG;IACT,MAAM,IAAIrC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIsC,QAAQA,GAAG;IACb,OAAO,IAAI,CAACD,IAAI,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIE,WAAWA,GAAG;IAChB,MAAM,IAAIvC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEwC,EAAAA,UAAUA,CAACC,EAAE,EAAEC,IAAI,EAAE;IACnB,MAAM,IAAI1C,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE2C,EAAAA,YAAYA,CAACF,EAAE,EAAEG,MAAM,EAAE;IACvB,MAAM,IAAI5C,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE6C,MAAMA,CAACJ,EAAE,EAAE;IACT,MAAM,IAAIzC,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE8C,MAAMA,CAACC,SAAS,EAAE;IAChB,MAAM,IAAI/C,mBAAmB,EAAE,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIgD,OAAOA,GAAG;IACZ,MAAM,IAAIhD,mBAAmB,EAAE,CAAA;AACjC,GAAA;AACF;;AC7FA,IAAIiD,WAAS,GAAG,IAAI,CAAA;;AAEpB;AACA;AACA;AACA;AACe,MAAMC,UAAU,SAASf,IAAI,CAAC;AAC3C;AACF;AACA;AACA;EACE,WAAWgB,QAAQA,GAAG;IACpB,IAAIF,WAAS,KAAK,IAAI,EAAE;AACtBA,MAAAA,WAAS,GAAG,IAAIC,UAAU,EAAE,CAAA;AAC9B,KAAA;AACA,IAAA,OAAOD,WAAS,CAAA;AAClB,GAAA;;AAEA;EACA,IAAIb,IAAIA,GAAG;AACT,IAAA,OAAO,QAAQ,CAAA;AACjB,GAAA;;AAEA;EACA,IAAIC,IAAIA,GAAG;IACT,OAAO,IAAIe,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACC,QAAQ,CAAA;AAC7D,GAAA;;AAEA;EACA,IAAIhB,WAAWA,GAAG;AAChB,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;EACAC,UAAUA,CAACC,EAAE,EAAE;IAAEG,MAAM;AAAEY,IAAAA,MAAAA;AAAO,GAAC,EAAE;AACjC,IAAA,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,CAAC,CAAA;AAC1C,GAAA;;AAEA;AACAb,EAAAA,YAAYA,CAACF,EAAE,EAAEG,MAAM,EAAE;IACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;AAC9C,GAAA;;AAEA;EACAC,MAAMA,CAACJ,EAAE,EAAE;IACT,OAAO,CAAC,IAAIiB,IAAI,CAACjB,EAAE,CAAC,CAACkB,iBAAiB,EAAE,CAAA;AAC1C,GAAA;;AAEA;EACAb,MAAMA,CAACC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACX,IAAI,KAAK,QAAQ,CAAA;AACpC,GAAA;;AAEA;EACA,IAAIY,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACF;;ACzDA,MAAMY,QAAQ,GAAG,IAAIC,GAAG,EAAE,CAAA;AAC1B,SAASC,OAAOA,CAACC,QAAQ,EAAE;AACzB,EAAA,IAAIC,GAAG,GAAGJ,QAAQ,CAACK,GAAG,CAACF,QAAQ,CAAC,CAAA;EAChC,IAAIC,GAAG,KAAKE,SAAS,EAAE;AACrBF,IAAAA,GAAG,GAAG,IAAIZ,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;AACrCc,MAAAA,MAAM,EAAE,KAAK;AACbZ,MAAAA,QAAQ,EAAEQ,QAAQ;AAClB1D,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,KAAK,EAAE,SAAS;AAChBC,MAAAA,GAAG,EAAE,SAAS;AACdO,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,MAAM,EAAE,SAAS;AACjBE,MAAAA,MAAM,EAAE,SAAS;AACjBmD,MAAAA,GAAG,EAAE,OAAA;AACP,KAAC,CAAC,CAAA;AACFR,IAAAA,QAAQ,CAACS,GAAG,CAACN,QAAQ,EAAEC,GAAG,CAAC,CAAA;AAC7B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,MAAMM,SAAS,GAAG;AAChBjE,EAAAA,IAAI,EAAE,CAAC;AACPC,EAAAA,KAAK,EAAE,CAAC;AACRC,EAAAA,GAAG,EAAE,CAAC;AACN6D,EAAAA,GAAG,EAAE,CAAC;AACNtD,EAAAA,IAAI,EAAE,CAAC;AACPC,EAAAA,MAAM,EAAE,CAAC;AACTE,EAAAA,MAAM,EAAE,CAAA;AACV,CAAC,CAAA;AAED,SAASsD,WAAWA,CAACP,GAAG,EAAEQ,IAAI,EAAE;AAC9B,EAAA,MAAMC,SAAS,GAAGT,GAAG,CAACpB,MAAM,CAAC4B,IAAI,CAAC,CAACE,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;AACvDC,IAAAA,MAAM,GAAG,iDAAiD,CAACC,IAAI,CAACH,SAAS,CAAC;AAC1E,IAAA,GAAGI,MAAM,EAAEC,IAAI,EAAEC,KAAK,EAAEC,OAAO,EAAEC,KAAK,EAAEC,OAAO,EAAEC,OAAO,CAAC,GAAGR,MAAM,CAAA;AACpE,EAAA,OAAO,CAACI,KAAK,EAAEF,MAAM,EAAEC,IAAI,EAAEE,OAAO,EAAEC,KAAK,EAAEC,OAAO,EAAEC,OAAO,CAAC,CAAA;AAChE,CAAA;AAEA,SAASC,WAAWA,CAACpB,GAAG,EAAEQ,IAAI,EAAE;AAC9B,EAAA,MAAMC,SAAS,GAAGT,GAAG,CAACqB,aAAa,CAACb,IAAI,CAAC,CAAA;EACzC,MAAMc,MAAM,GAAG,EAAE,CAAA;AACjB,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGd,SAAS,CAACe,MAAM,EAAED,CAAC,EAAE,EAAE;IACzC,MAAM;MAAEnD,IAAI;AAAEqD,MAAAA,KAAAA;AAAM,KAAC,GAAGhB,SAAS,CAACc,CAAC,CAAC,CAAA;AACpC,IAAA,MAAMG,GAAG,GAAGpB,SAAS,CAAClC,IAAI,CAAC,CAAA;IAE3B,IAAIA,IAAI,KAAK,KAAK,EAAE;AAClBkD,MAAAA,MAAM,CAACI,GAAG,CAAC,GAAGD,KAAK,CAAA;AACrB,KAAC,MAAM,IAAI,CAACE,WAAW,CAACD,GAAG,CAAC,EAAE;MAC5BJ,MAAM,CAACI,GAAG,CAAC,GAAGE,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;AACnC,KAAA;AACF,GAAA;AACA,EAAA,OAAOH,MAAM,CAAA;AACf,CAAA;AAEA,MAAMO,aAAa,GAAG,IAAIhC,GAAG,EAAE,CAAA;AAC/B;AACA;AACA;AACA;AACe,MAAMiC,QAAQ,SAAS3D,IAAI,CAAC;AACzC;AACF;AACA;AACA;EACE,OAAO4D,MAAMA,CAAC1D,IAAI,EAAE;AAClB,IAAA,IAAI2D,IAAI,GAAGH,aAAa,CAAC5B,GAAG,CAAC5B,IAAI,CAAC,CAAA;IAClC,IAAI2D,IAAI,KAAK9B,SAAS,EAAE;AACtB2B,MAAAA,aAAa,CAACxB,GAAG,CAAChC,IAAI,EAAG2D,IAAI,GAAG,IAAIF,QAAQ,CAACzD,IAAI,CAAE,CAAC,CAAA;AACtD,KAAA;AACA,IAAA,OAAO2D,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;EACE,OAAOC,UAAUA,GAAG;IAClBJ,aAAa,CAACK,KAAK,EAAE,CAAA;IACrBtC,QAAQ,CAACsC,KAAK,EAAE,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOC,gBAAgBA,CAACjG,CAAC,EAAE;AACzB,IAAA,OAAO,IAAI,CAACkG,WAAW,CAAClG,CAAC,CAAC,CAAA;AAC5B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOkG,WAAWA,CAACJ,IAAI,EAAE;IACvB,IAAI,CAACA,IAAI,EAAE;AACT,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IACA,IAAI;AACF,MAAA,IAAI5C,IAAI,CAACC,cAAc,CAAC,OAAO,EAAE;AAAEE,QAAAA,QAAQ,EAAEyC,IAAAA;AAAK,OAAC,CAAC,CAACpD,MAAM,EAAE,CAAA;AAC7D,MAAA,OAAO,IAAI,CAAA;KACZ,CAAC,OAAOyD,CAAC,EAAE;AACV,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AACF,GAAA;EAEA9G,WAAWA,CAAC8C,IAAI,EAAE;AAChB,IAAA,KAAK,EAAE,CAAA;AACP;IACA,IAAI,CAAC0B,QAAQ,GAAG1B,IAAI,CAAA;AACpB;IACA,IAAI,CAACiE,KAAK,GAAGR,QAAQ,CAACM,WAAW,CAAC/D,IAAI,CAAC,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAID,IAAIA,GAAG;AACT,IAAA,OAAO,MAAM,CAAA;AACf,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIC,IAAIA,GAAG;IACT,OAAO,IAAI,CAAC0B,QAAQ,CAAA;AACtB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIxB,WAAWA,GAAG;AAChB,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEC,UAAUA,CAACC,EAAE,EAAE;IAAEG,MAAM;AAAEY,IAAAA,MAAAA;AAAO,GAAC,EAAE;IACjC,OAAOC,aAAa,CAAChB,EAAE,EAAEG,MAAM,EAAEY,MAAM,EAAE,IAAI,CAACnB,IAAI,CAAC,CAAA;AACrD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACEM,EAAAA,YAAYA,CAACF,EAAE,EAAEG,MAAM,EAAE;IACvB,OAAOD,YAAY,CAAC,IAAI,CAACE,MAAM,CAACJ,EAAE,CAAC,EAAEG,MAAM,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEC,MAAMA,CAACJ,EAAE,EAAE;AACT,IAAA,IAAI,CAAC,IAAI,CAAC6D,KAAK,EAAE,OAAOC,GAAG,CAAA;AAC3B,IAAA,MAAM/B,IAAI,GAAG,IAAId,IAAI,CAACjB,EAAE,CAAC,CAAA;AAEzB,IAAA,IAAI+D,KAAK,CAAChC,IAAI,CAAC,EAAE,OAAO+B,GAAG,CAAA;AAE3B,IAAA,MAAMvC,GAAG,GAAGF,OAAO,CAAC,IAAI,CAACzB,IAAI,CAAC,CAAA;AAC9B,IAAA,IAAI,CAAChC,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAEkG,MAAM,EAAE3F,IAAI,EAAEC,MAAM,EAAEE,MAAM,CAAC,GAAG+C,GAAG,CAACqB,aAAa,GACpED,WAAW,CAACpB,GAAG,EAAEQ,IAAI,CAAC,GACtBD,WAAW,CAACP,GAAG,EAAEQ,IAAI,CAAC,CAAA;IAE1B,IAAIiC,MAAM,KAAK,IAAI,EAAE;MACnBpG,IAAI,GAAG,CAACqG,IAAI,CAACC,GAAG,CAACtG,IAAI,CAAC,GAAG,CAAC,CAAA;AAC5B,KAAA;;AAEA;IACA,MAAMuG,YAAY,GAAG9F,IAAI,KAAK,EAAE,GAAG,CAAC,GAAGA,IAAI,CAAA;IAE3C,MAAM+F,KAAK,GAAGC,YAAY,CAAC;MACzBzG,IAAI;MACJC,KAAK;MACLC,GAAG;AACHO,MAAAA,IAAI,EAAE8F,YAAY;MAClB7F,MAAM;MACNE,MAAM;AACN8F,MAAAA,WAAW,EAAE,CAAA;AACf,KAAC,CAAC,CAAA;IAEF,IAAIC,IAAI,GAAG,CAACxC,IAAI,CAAA;AAChB,IAAA,MAAMyC,IAAI,GAAGD,IAAI,GAAG,IAAI,CAAA;IACxBA,IAAI,IAAIC,IAAI,IAAI,CAAC,GAAGA,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;IACtC,OAAO,CAACJ,KAAK,GAAGG,IAAI,KAAK,EAAE,GAAG,IAAI,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACElE,MAAMA,CAACC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACX,IAAI,KAAK,MAAM,IAAIW,SAAS,CAACV,IAAI,KAAK,IAAI,CAACA,IAAI,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIW,OAAOA,GAAG;IACZ,OAAO,IAAI,CAACsD,KAAK,CAAA;AACnB,GAAA;AACF;;ACpOA;;AAEA,IAAIY,WAAW,GAAG,EAAE,CAAA;AACpB,SAASC,WAAWA,CAACC,SAAS,EAAE1E,IAAI,GAAG,EAAE,EAAE;EACzC,MAAM2E,GAAG,GAAGC,IAAI,CAACC,SAAS,CAAC,CAACH,SAAS,EAAE1E,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAIsB,GAAG,GAAGkD,WAAW,CAACG,GAAG,CAAC,CAAA;EAC1B,IAAI,CAACrD,GAAG,EAAE;IACRA,GAAG,GAAG,IAAIZ,IAAI,CAACoE,UAAU,CAACJ,SAAS,EAAE1E,IAAI,CAAC,CAAA;AAC1CwE,IAAAA,WAAW,CAACG,GAAG,CAAC,GAAGrD,GAAG,CAAA;AACxB,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,MAAMyD,WAAW,GAAG,IAAI5D,GAAG,EAAE,CAAA;AAC7B,SAAS6D,YAAYA,CAACN,SAAS,EAAE1E,IAAI,GAAG,EAAE,EAAE;EAC1C,MAAM2E,GAAG,GAAGC,IAAI,CAACC,SAAS,CAAC,CAACH,SAAS,EAAE1E,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAIsB,GAAG,GAAGyD,WAAW,CAACxD,GAAG,CAACoD,GAAG,CAAC,CAAA;EAC9B,IAAIrD,GAAG,KAAKE,SAAS,EAAE;IACrBF,GAAG,GAAG,IAAIZ,IAAI,CAACC,cAAc,CAAC+D,SAAS,EAAE1E,IAAI,CAAC,CAAA;AAC9C+E,IAAAA,WAAW,CAACpD,GAAG,CAACgD,GAAG,EAAErD,GAAG,CAAC,CAAA;AAC3B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,MAAM2D,YAAY,GAAG,IAAI9D,GAAG,EAAE,CAAA;AAC9B,SAAS+D,YAAYA,CAACR,SAAS,EAAE1E,IAAI,GAAG,EAAE,EAAE;EAC1C,MAAM2E,GAAG,GAAGC,IAAI,CAACC,SAAS,CAAC,CAACH,SAAS,EAAE1E,IAAI,CAAC,CAAC,CAAA;AAC7C,EAAA,IAAImF,GAAG,GAAGF,YAAY,CAAC1D,GAAG,CAACoD,GAAG,CAAC,CAAA;EAC/B,IAAIQ,GAAG,KAAK3D,SAAS,EAAE;IACrB2D,GAAG,GAAG,IAAIzE,IAAI,CAAC0E,YAAY,CAACV,SAAS,EAAE1E,IAAI,CAAC,CAAA;AAC5CiF,IAAAA,YAAY,CAACtD,GAAG,CAACgD,GAAG,EAAEQ,GAAG,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,MAAME,YAAY,GAAG,IAAIlE,GAAG,EAAE,CAAA;AAC9B,SAASmE,YAAYA,CAACZ,SAAS,EAAE1E,IAAI,GAAG,EAAE,EAAE;EAC1C,MAAM;IAAEuF,IAAI;IAAE,GAAGC,YAAAA;GAAc,GAAGxF,IAAI,CAAC;EACvC,MAAM2E,GAAG,GAAGC,IAAI,CAACC,SAAS,CAAC,CAACH,SAAS,EAAEc,YAAY,CAAC,CAAC,CAAA;AACrD,EAAA,IAAIL,GAAG,GAAGE,YAAY,CAAC9D,GAAG,CAACoD,GAAG,CAAC,CAAA;EAC/B,IAAIQ,GAAG,KAAK3D,SAAS,EAAE;IACrB2D,GAAG,GAAG,IAAIzE,IAAI,CAAC+E,kBAAkB,CAACf,SAAS,EAAE1E,IAAI,CAAC,CAAA;AAClDqF,IAAAA,YAAY,CAAC1D,GAAG,CAACgD,GAAG,EAAEQ,GAAG,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAOA,GAAG,CAAA;AACZ,CAAA;AAEA,IAAIO,cAAc,GAAG,IAAI,CAAA;AACzB,SAASC,YAAYA,GAAG;AACtB,EAAA,IAAID,cAAc,EAAE;AAClB,IAAA,OAAOA,cAAc,CAAA;AACvB,GAAC,MAAM;AACLA,IAAAA,cAAc,GAAG,IAAIhF,IAAI,CAACC,cAAc,EAAE,CAACC,eAAe,EAAE,CAACE,MAAM,CAAA;AACnE,IAAA,OAAO4E,cAAc,CAAA;AACvB,GAAA;AACF,CAAA;AAEA,MAAME,wBAAwB,GAAG,IAAIzE,GAAG,EAAE,CAAA;AAC1C,SAAS0E,2BAA2BA,CAACnB,SAAS,EAAE;AAC9C,EAAA,IAAI1E,IAAI,GAAG4F,wBAAwB,CAACrE,GAAG,CAACmD,SAAS,CAAC,CAAA;EAClD,IAAI1E,IAAI,KAAKwB,SAAS,EAAE;IACtBxB,IAAI,GAAG,IAAIU,IAAI,CAACC,cAAc,CAAC+D,SAAS,CAAC,CAAC9D,eAAe,EAAE,CAAA;AAC3DgF,IAAAA,wBAAwB,CAACjE,GAAG,CAAC+C,SAAS,EAAE1E,IAAI,CAAC,CAAA;AAC/C,GAAA;AACA,EAAA,OAAOA,IAAI,CAAA;AACb,CAAA;AAEA,MAAM8F,aAAa,GAAG,IAAI3E,GAAG,EAAE,CAAA;AAC/B,SAAS4E,iBAAiBA,CAACrB,SAAS,EAAE;AACpC,EAAA,IAAIsB,IAAI,GAAGF,aAAa,CAACvE,GAAG,CAACmD,SAAS,CAAC,CAAA;EACvC,IAAI,CAACsB,IAAI,EAAE;IACT,MAAMlF,MAAM,GAAG,IAAIJ,IAAI,CAACuF,MAAM,CAACvB,SAAS,CAAC,CAAA;AACzC;AACAsB,IAAAA,IAAI,GAAG,aAAa,IAAIlF,MAAM,GAAGA,MAAM,CAACoF,WAAW,EAAE,GAAGpF,MAAM,CAACqF,QAAQ,CAAA;AACvE;AACA,IAAA,IAAI,EAAE,aAAa,IAAIH,IAAI,CAAC,EAAE;AAC5BA,MAAAA,IAAI,GAAG;AAAE,QAAA,GAAGI,oBAAoB;QAAE,GAAGJ,IAAAA;OAAM,CAAA;AAC7C,KAAA;AACAF,IAAAA,aAAa,CAACnE,GAAG,CAAC+C,SAAS,EAAEsB,IAAI,CAAC,CAAA;AACpC,GAAA;AACA,EAAA,OAAOA,IAAI,CAAA;AACb,CAAA;AAEA,SAASK,iBAAiBA,CAACC,SAAS,EAAE;AACpC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAA,MAAMC,MAAM,GAAGD,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;AACvC,EAAA,IAAID,MAAM,KAAK,CAAC,CAAC,EAAE;IACjBD,SAAS,GAAGA,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEF,MAAM,CAAC,CAAA;AAC5C,GAAA;AAEA,EAAA,MAAMG,MAAM,GAAGJ,SAAS,CAACE,OAAO,CAAC,KAAK,CAAC,CAAA;AACvC,EAAA,IAAIE,MAAM,KAAK,CAAC,CAAC,EAAE;IACjB,OAAO,CAACJ,SAAS,CAAC,CAAA;AACpB,GAAC,MAAM;AACL,IAAA,IAAIK,OAAO,CAAA;AACX,IAAA,IAAIC,WAAW,CAAA;IACf,IAAI;MACFD,OAAO,GAAG3B,YAAY,CAACsB,SAAS,CAAC,CAAC1F,eAAe,EAAE,CAAA;AACnDgG,MAAAA,WAAW,GAAGN,SAAS,CAAA;KACxB,CAAC,OAAO3C,CAAC,EAAE;MACV,MAAMkD,OAAO,GAAGP,SAAS,CAACG,SAAS,CAAC,CAAC,EAAEC,MAAM,CAAC,CAAA;MAC9CC,OAAO,GAAG3B,YAAY,CAAC6B,OAAO,CAAC,CAACjG,eAAe,EAAE,CAAA;AACjDgG,MAAAA,WAAW,GAAGC,OAAO,CAAA;AACvB,KAAA;IAEA,MAAM;MAAEC,eAAe;AAAEC,MAAAA,QAAAA;AAAS,KAAC,GAAGJ,OAAO,CAAA;AAC7C,IAAA,OAAO,CAACC,WAAW,EAAEE,eAAe,EAAEC,QAAQ,CAAC,CAAA;AACjD,GAAA;AACF,CAAA;AAEA,SAASC,gBAAgBA,CAACV,SAAS,EAAEQ,eAAe,EAAEG,cAAc,EAAE;EACpE,IAAIA,cAAc,IAAIH,eAAe,EAAE;AACrC,IAAA,IAAI,CAACR,SAAS,CAACY,QAAQ,CAAC,KAAK,CAAC,EAAE;AAC9BZ,MAAAA,SAAS,IAAI,IAAI,CAAA;AACnB,KAAA;AAEA,IAAA,IAAIW,cAAc,EAAE;MAClBX,SAAS,IAAK,CAAMW,IAAAA,EAAAA,cAAe,CAAC,CAAA,CAAA;AACtC,KAAA;AAEA,IAAA,IAAIH,eAAe,EAAE;MACnBR,SAAS,IAAK,CAAMQ,IAAAA,EAAAA,eAAgB,CAAC,CAAA,CAAA;AACvC,KAAA;AACA,IAAA,OAAOR,SAAS,CAAA;AAClB,GAAC,MAAM;AACL,IAAA,OAAOA,SAAS,CAAA;AAClB,GAAA;AACF,CAAA;AAEA,SAASa,SAASA,CAACC,CAAC,EAAE;EACpB,MAAMC,EAAE,GAAG,EAAE,CAAA;EACb,KAAK,IAAIxE,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,EAAE,EAAEA,CAAC,EAAE,EAAE;IAC5B,MAAMyE,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE3E,CAAC,EAAE,CAAC,CAAC,CAAA;AACnCwE,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;AAChB,GAAA;AACA,EAAA,OAAOD,EAAE,CAAA;AACX,CAAA;AAEA,SAASK,WAAWA,CAACN,CAAC,EAAE;EACtB,MAAMC,EAAE,GAAG,EAAE,CAAA;EACb,KAAK,IAAIxE,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAE;AAC3B,IAAA,MAAMyE,EAAE,GAAGC,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG3E,CAAC,CAAC,CAAA;AACzCwE,IAAAA,EAAE,CAACI,IAAI,CAACL,CAAC,CAACE,EAAE,CAAC,CAAC,CAAA;AAChB,GAAA;AACA,EAAA,OAAOD,EAAE,CAAA;AACX,CAAA;AAEA,SAASM,SAASA,CAACC,GAAG,EAAE9E,MAAM,EAAE+E,SAAS,EAAEC,MAAM,EAAE;AACjD,EAAA,MAAMC,IAAI,GAAGH,GAAG,CAACI,WAAW,EAAE,CAAA;EAE9B,IAAID,IAAI,KAAK,OAAO,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM,IAAIA,IAAI,KAAK,IAAI,EAAE;IACxB,OAAOF,SAAS,CAAC/E,MAAM,CAAC,CAAA;AAC1B,GAAC,MAAM;IACL,OAAOgF,MAAM,CAAChF,MAAM,CAAC,CAAA;AACvB,GAAA;AACF,CAAA;AAEA,SAASmF,mBAAmBA,CAACL,GAAG,EAAE;EAChC,IAAIA,GAAG,CAACd,eAAe,IAAIc,GAAG,CAACd,eAAe,KAAK,MAAM,EAAE;AACzD,IAAA,OAAO,KAAK,CAAA;AACd,GAAC,MAAM;AACL,IAAA,OACEc,GAAG,CAACd,eAAe,KAAK,MAAM,IAC9B,CAACc,GAAG,CAAC9G,MAAM,IACX8G,GAAG,CAAC9G,MAAM,CAACoH,UAAU,CAAC,IAAI,CAAC,IAC3BrC,2BAA2B,CAAC+B,GAAG,CAAC9G,MAAM,CAAC,CAACgG,eAAe,KAAK,MAAM,CAAA;AAEtE,GAAA;AACF,CAAA;;AAEA;AACA;AACA;;AAEA,MAAMqB,mBAAmB,CAAC;AACxBtL,EAAAA,WAAWA,CAACuL,IAAI,EAAEC,WAAW,EAAErI,IAAI,EAAE;AACnC,IAAA,IAAI,CAACsI,KAAK,GAAGtI,IAAI,CAACsI,KAAK,IAAI,CAAC,CAAA;AAC5B,IAAA,IAAI,CAACC,KAAK,GAAGvI,IAAI,CAACuI,KAAK,IAAI,KAAK,CAAA;IAEhC,MAAM;MAAED,KAAK;MAAEC,KAAK;MAAE,GAAGC,SAAAA;AAAU,KAAC,GAAGxI,IAAI,CAAA;AAE3C,IAAA,IAAI,CAACqI,WAAW,IAAII,MAAM,CAACC,IAAI,CAACF,SAAS,CAAC,CAAC1F,MAAM,GAAG,CAAC,EAAE;AACrD,MAAA,MAAM6F,QAAQ,GAAG;AAAEC,QAAAA,WAAW,EAAE,KAAK;QAAE,GAAG5I,IAAAA;OAAM,CAAA;AAChD,MAAA,IAAIA,IAAI,CAACsI,KAAK,GAAG,CAAC,EAAEK,QAAQ,CAACE,oBAAoB,GAAG7I,IAAI,CAACsI,KAAK,CAAA;MAC9D,IAAI,CAACnD,GAAG,GAAGD,YAAY,CAACkD,IAAI,EAAEO,QAAQ,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;EAEAzI,MAAMA,CAAC2C,CAAC,EAAE;IACR,IAAI,IAAI,CAACsC,GAAG,EAAE;AACZ,MAAA,MAAM2D,KAAK,GAAG,IAAI,CAACP,KAAK,GAAGvE,IAAI,CAACuE,KAAK,CAAC1F,CAAC,CAAC,GAAGA,CAAC,CAAA;AAC5C,MAAA,OAAO,IAAI,CAACsC,GAAG,CAACjF,MAAM,CAAC4I,KAAK,CAAC,CAAA;AAC/B,KAAC,MAAM;AACL;AACA,MAAA,MAAMA,KAAK,GAAG,IAAI,CAACP,KAAK,GAAGvE,IAAI,CAACuE,KAAK,CAAC1F,CAAC,CAAC,GAAGkG,OAAO,CAAClG,CAAC,EAAE,CAAC,CAAC,CAAA;AACxD,MAAA,OAAOmG,QAAQ,CAACF,KAAK,EAAE,IAAI,CAACR,KAAK,CAAC,CAAA;AACpC,KAAA;AACF,GAAA;AACF,CAAA;;AAEA;AACA;AACA;;AAEA,MAAMW,iBAAiB,CAAC;AACtBpM,EAAAA,WAAWA,CAACyK,EAAE,EAAEc,IAAI,EAAEpI,IAAI,EAAE;IAC1B,IAAI,CAACA,IAAI,GAAGA,IAAI,CAAA;IAChB,IAAI,CAACkJ,YAAY,GAAG1H,SAAS,CAAA;IAE7B,IAAI2H,CAAC,GAAG3H,SAAS,CAAA;AACjB,IAAA,IAAI,IAAI,CAACxB,IAAI,CAACa,QAAQ,EAAE;AACtB;MACA,IAAI,CAACyG,EAAE,GAAGA,EAAE,CAAA;KACb,MAAM,IAAIA,EAAE,CAAChE,IAAI,CAAC5D,IAAI,KAAK,OAAO,EAAE;AACnC;AACA;AACA;AACA;AACA;AACA;MACA,MAAM0J,SAAS,GAAG,CAAC,CAAC,IAAI9B,EAAE,CAACnH,MAAM,GAAG,EAAE,CAAC,CAAA;AACvC,MAAA,MAAMkJ,OAAO,GAAGD,SAAS,IAAI,CAAC,GAAI,CAAUA,QAAAA,EAAAA,SAAU,CAAC,CAAA,GAAI,CAASA,OAAAA,EAAAA,SAAU,CAAC,CAAA,CAAA;AAC/E,MAAA,IAAI9B,EAAE,CAACnH,MAAM,KAAK,CAAC,IAAIiD,QAAQ,CAACC,MAAM,CAACgG,OAAO,CAAC,CAACzF,KAAK,EAAE;AACrDuF,QAAAA,CAAC,GAAGE,OAAO,CAAA;QACX,IAAI,CAAC/B,EAAE,GAAGA,EAAE,CAAA;AACd,OAAC,MAAM;AACL;AACA;AACA6B,QAAAA,CAAC,GAAG,KAAK,CAAA;AACT,QAAA,IAAI,CAAC7B,EAAE,GAAGA,EAAE,CAACnH,MAAM,KAAK,CAAC,GAAGmH,EAAE,GAAGA,EAAE,CAACgC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;UAAEC,OAAO,EAAElC,EAAE,CAACnH,MAAAA;AAAO,SAAC,CAAC,CAAA;AAC/E,QAAA,IAAI,CAAC+I,YAAY,GAAG5B,EAAE,CAAChE,IAAI,CAAA;AAC7B,OAAA;KACD,MAAM,IAAIgE,EAAE,CAAChE,IAAI,CAAC5D,IAAI,KAAK,QAAQ,EAAE;MACpC,IAAI,CAAC4H,EAAE,GAAGA,EAAE,CAAA;KACb,MAAM,IAAIA,EAAE,CAAChE,IAAI,CAAC5D,IAAI,KAAK,MAAM,EAAE;MAClC,IAAI,CAAC4H,EAAE,GAAGA,EAAE,CAAA;AACZ6B,MAAAA,CAAC,GAAG7B,EAAE,CAAChE,IAAI,CAAC3D,IAAI,CAAA;AAClB,KAAC,MAAM;AACL;AACA;AACAwJ,MAAAA,CAAC,GAAG,KAAK,CAAA;MACT,IAAI,CAAC7B,EAAE,GAAGA,EAAE,CAACgC,OAAO,CAAC,KAAK,CAAC,CAACC,IAAI,CAAC;QAAEC,OAAO,EAAElC,EAAE,CAACnH,MAAAA;AAAO,OAAC,CAAC,CAAA;AACxD,MAAA,IAAI,CAAC+I,YAAY,GAAG5B,EAAE,CAAChE,IAAI,CAAA;AAC7B,KAAA;AAEA,IAAA,MAAMqF,QAAQ,GAAG;AAAE,MAAA,GAAG,IAAI,CAAC3I,IAAAA;KAAM,CAAA;AACjC2I,IAAAA,QAAQ,CAAC9H,QAAQ,GAAG8H,QAAQ,CAAC9H,QAAQ,IAAIsI,CAAC,CAAA;IAC1C,IAAI,CAAC7H,GAAG,GAAG0D,YAAY,CAACoD,IAAI,EAAEO,QAAQ,CAAC,CAAA;AACzC,GAAA;AAEAzI,EAAAA,MAAMA,GAAG;IACP,IAAI,IAAI,CAACgJ,YAAY,EAAE;AACrB;AACA;MACA,OAAO,IAAI,CAACvG,aAAa,EAAE,CACxB8G,GAAG,CAAC,CAAC;AAAE1G,QAAAA,KAAAA;AAAM,OAAC,KAAKA,KAAK,CAAC,CACzB2G,IAAI,CAAC,EAAE,CAAC,CAAA;AACb,KAAA;AACA,IAAA,OAAO,IAAI,CAACpI,GAAG,CAACpB,MAAM,CAAC,IAAI,CAACoH,EAAE,CAACqC,QAAQ,EAAE,CAAC,CAAA;AAC5C,GAAA;AAEAhH,EAAAA,aAAaA,GAAG;AACd,IAAA,MAAMiH,KAAK,GAAG,IAAI,CAACtI,GAAG,CAACqB,aAAa,CAAC,IAAI,CAAC2E,EAAE,CAACqC,QAAQ,EAAE,CAAC,CAAA;IACxD,IAAI,IAAI,CAACT,YAAY,EAAE;AACrB,MAAA,OAAOU,KAAK,CAACH,GAAG,CAAEI,IAAI,IAAK;AACzB,QAAA,IAAIA,IAAI,CAACnK,IAAI,KAAK,cAAc,EAAE;AAChC,UAAA,MAAMI,UAAU,GAAG,IAAI,CAACoJ,YAAY,CAACpJ,UAAU,CAAC,IAAI,CAACwH,EAAE,CAACvH,EAAE,EAAE;AAC1De,YAAAA,MAAM,EAAE,IAAI,CAACwG,EAAE,CAACxG,MAAM;AACtBZ,YAAAA,MAAM,EAAE,IAAI,CAACF,IAAI,CAACvB,YAAAA;AACpB,WAAC,CAAC,CAAA;UACF,OAAO;AACL,YAAA,GAAGoL,IAAI;AACP9G,YAAAA,KAAK,EAAEjD,UAAAA;WACR,CAAA;AACH,SAAC,MAAM;AACL,UAAA,OAAO+J,IAAI,CAAA;AACb,SAAA;AACF,OAAC,CAAC,CAAA;AACJ,KAAA;AACA,IAAA,OAAOD,KAAK,CAAA;AACd,GAAA;AAEAhJ,EAAAA,eAAeA,GAAG;AAChB,IAAA,OAAO,IAAI,CAACU,GAAG,CAACV,eAAe,EAAE,CAAA;AACnC,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACA,MAAMkJ,gBAAgB,CAAC;AACrBjN,EAAAA,WAAWA,CAACuL,IAAI,EAAE2B,SAAS,EAAE/J,IAAI,EAAE;IACjC,IAAI,CAACA,IAAI,GAAG;AAAEgK,MAAAA,KAAK,EAAE,MAAM;MAAE,GAAGhK,IAAAA;KAAM,CAAA;AACtC,IAAA,IAAI,CAAC+J,SAAS,IAAIE,WAAW,EAAE,EAAE;MAC/B,IAAI,CAACC,GAAG,GAAG5E,YAAY,CAAC8C,IAAI,EAAEpI,IAAI,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;AAEAE,EAAAA,MAAMA,CAACiK,KAAK,EAAE/M,IAAI,EAAE;IAClB,IAAI,IAAI,CAAC8M,GAAG,EAAE;MACZ,OAAO,IAAI,CAACA,GAAG,CAAChK,MAAM,CAACiK,KAAK,EAAE/M,IAAI,CAAC,CAAA;AACrC,KAAC,MAAM;MACL,OAAOgN,kBAA0B,CAAChN,IAAI,EAAE+M,KAAK,EAAE,IAAI,CAACnK,IAAI,CAACqK,OAAO,EAAE,IAAI,CAACrK,IAAI,CAACgK,KAAK,KAAK,MAAM,CAAC,CAAA;AAC/F,KAAA;AACF,GAAA;AAEArH,EAAAA,aAAaA,CAACwH,KAAK,EAAE/M,IAAI,EAAE;IACzB,IAAI,IAAI,CAAC8M,GAAG,EAAE;MACZ,OAAO,IAAI,CAACA,GAAG,CAACvH,aAAa,CAACwH,KAAK,EAAE/M,IAAI,CAAC,CAAA;AAC5C,KAAC,MAAM;AACL,MAAA,OAAO,EAAE,CAAA;AACX,KAAA;AACF,GAAA;AACF,CAAA;AAEA,MAAMgJ,oBAAoB,GAAG;AAC3BkE,EAAAA,QAAQ,EAAE,CAAC;AACXC,EAAAA,WAAW,EAAE,CAAC;AACdC,EAAAA,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;AAChB,CAAC,CAAA;;AAED;AACA;AACA;AACe,MAAMvE,MAAM,CAAC;EAC1B,OAAOwE,QAAQA,CAACzK,IAAI,EAAE;IACpB,OAAOiG,MAAM,CAAC5C,MAAM,CAClBrD,IAAI,CAACc,MAAM,EACXd,IAAI,CAAC8G,eAAe,EACpB9G,IAAI,CAACiH,cAAc,EACnBjH,IAAI,CAAC0K,YAAY,EACjB1K,IAAI,CAAC2K,WACP,CAAC,CAAA;AACH,GAAA;AAEA,EAAA,OAAOtH,MAAMA,CAACvC,MAAM,EAAEgG,eAAe,EAAEG,cAAc,EAAEyD,YAAY,EAAEC,WAAW,GAAG,KAAK,EAAE;AACxF,IAAA,MAAMC,eAAe,GAAG9J,MAAM,IAAI+J,QAAQ,CAACC,aAAa,CAAA;AACxD;IACA,MAAMC,OAAO,GAAGH,eAAe,KAAKD,WAAW,GAAG,OAAO,GAAGhF,YAAY,EAAE,CAAC,CAAA;AAC3E,IAAA,MAAMqF,gBAAgB,GAAGlE,eAAe,IAAI+D,QAAQ,CAACI,sBAAsB,CAAA;AAC3E,IAAA,MAAMC,eAAe,GAAGjE,cAAc,IAAI4D,QAAQ,CAACM,qBAAqB,CAAA;IACxE,MAAMC,aAAa,GAAGC,oBAAoB,CAACX,YAAY,CAAC,IAAIG,QAAQ,CAACS,mBAAmB,CAAA;AACxF,IAAA,OAAO,IAAIrF,MAAM,CAAC8E,OAAO,EAAEC,gBAAgB,EAAEE,eAAe,EAAEE,aAAa,EAAER,eAAe,CAAC,CAAA;AAC/F,GAAA;EAEA,OAAOrH,UAAUA,GAAG;AAClBmC,IAAAA,cAAc,GAAG,IAAI,CAAA;IACrBX,WAAW,CAACvB,KAAK,EAAE,CAAA;IACnByB,YAAY,CAACzB,KAAK,EAAE,CAAA;IACpB6B,YAAY,CAAC7B,KAAK,EAAE,CAAA;IACpBoC,wBAAwB,CAACpC,KAAK,EAAE,CAAA;IAChCsC,aAAa,CAACtC,KAAK,EAAE,CAAA;AACvB,GAAA;AAEA,EAAA,OAAO+H,UAAUA,CAAC;IAAEzK,MAAM;IAAEgG,eAAe;IAAEG,cAAc;AAAEyD,IAAAA,YAAAA;GAAc,GAAG,EAAE,EAAE;IAChF,OAAOzE,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAEgG,eAAe,EAAEG,cAAc,EAAEyD,YAAY,CAAC,CAAA;AAC7E,GAAA;EAEA7N,WAAWA,CAACiE,MAAM,EAAE0K,SAAS,EAAEvE,cAAc,EAAEyD,YAAY,EAAEE,eAAe,EAAE;IAC5E,MAAM,CAACa,YAAY,EAAEC,qBAAqB,EAAEC,oBAAoB,CAAC,GAAGtF,iBAAiB,CAACvF,MAAM,CAAC,CAAA;IAE7F,IAAI,CAACA,MAAM,GAAG2K,YAAY,CAAA;AAC1B,IAAA,IAAI,CAAC3E,eAAe,GAAG0E,SAAS,IAAIE,qBAAqB,IAAI,IAAI,CAAA;AACjE,IAAA,IAAI,CAACzE,cAAc,GAAGA,cAAc,IAAI0E,oBAAoB,IAAI,IAAI,CAAA;IACpE,IAAI,CAACjB,YAAY,GAAGA,YAAY,CAAA;AAChC,IAAA,IAAI,CAACtC,IAAI,GAAGpB,gBAAgB,CAAC,IAAI,CAAClG,MAAM,EAAE,IAAI,CAACgG,eAAe,EAAE,IAAI,CAACG,cAAc,CAAC,CAAA;IAEpF,IAAI,CAAC2E,aAAa,GAAG;MAAE1L,MAAM,EAAE,EAAE;AAAE2L,MAAAA,UAAU,EAAE,EAAC;KAAG,CAAA;IACnD,IAAI,CAACC,WAAW,GAAG;MAAE5L,MAAM,EAAE,EAAE;AAAE2L,MAAAA,UAAU,EAAE,EAAC;KAAG,CAAA;IACjD,IAAI,CAACE,aAAa,GAAG,IAAI,CAAA;AACzB,IAAA,IAAI,CAACC,QAAQ,GAAG,EAAE,CAAA;IAElB,IAAI,CAACpB,eAAe,GAAGA,eAAe,CAAA;IACtC,IAAI,CAACqB,iBAAiB,GAAG,IAAI,CAAA;AAC/B,GAAA;EAEA,IAAIC,WAAWA,GAAG;AAChB,IAAA,IAAI,IAAI,CAACD,iBAAiB,IAAI,IAAI,EAAE;AAClC,MAAA,IAAI,CAACA,iBAAiB,GAAGhE,mBAAmB,CAAC,IAAI,CAAC,CAAA;AACpD,KAAA;IAEA,OAAO,IAAI,CAACgE,iBAAiB,CAAA;AAC/B,GAAA;AAEAjE,EAAAA,WAAWA,GAAG;AACZ,IAAA,MAAMmE,YAAY,GAAG,IAAI,CAACpC,SAAS,EAAE,CAAA;IACrC,MAAMqC,cAAc,GAClB,CAAC,IAAI,CAACtF,eAAe,KAAK,IAAI,IAAI,IAAI,CAACA,eAAe,KAAK,MAAM,MAChE,IAAI,CAACG,cAAc,KAAK,IAAI,IAAI,IAAI,CAACA,cAAc,KAAK,SAAS,CAAC,CAAA;AACrE,IAAA,OAAOkF,YAAY,IAAIC,cAAc,GAAG,IAAI,GAAG,MAAM,CAAA;AACvD,GAAA;EAEAC,KAAKA,CAACC,IAAI,EAAE;AACV,IAAA,IAAI,CAACA,IAAI,IAAI7D,MAAM,CAAC8D,mBAAmB,CAACD,IAAI,CAAC,CAACxJ,MAAM,KAAK,CAAC,EAAE;AAC1D,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM;MACL,OAAOmD,MAAM,CAAC5C,MAAM,CAClBiJ,IAAI,CAACxL,MAAM,IAAI,IAAI,CAAC8J,eAAe,EACnC0B,IAAI,CAACxF,eAAe,IAAI,IAAI,CAACA,eAAe,EAC5CwF,IAAI,CAACrF,cAAc,IAAI,IAAI,CAACA,cAAc,EAC1CoE,oBAAoB,CAACiB,IAAI,CAAC5B,YAAY,CAAC,IAAI,IAAI,CAACA,YAAY,EAC5D4B,IAAI,CAAC3B,WAAW,IAAI,KACtB,CAAC,CAAA;AACH,KAAA;AACF,GAAA;AAEA6B,EAAAA,aAAaA,CAACF,IAAI,GAAG,EAAE,EAAE;IACvB,OAAO,IAAI,CAACD,KAAK,CAAC;AAAE,MAAA,GAAGC,IAAI;AAAE3B,MAAAA,WAAW,EAAE,IAAA;AAAK,KAAC,CAAC,CAAA;AACnD,GAAA;AAEA8B,EAAAA,iBAAiBA,CAACH,IAAI,GAAG,EAAE,EAAE;IAC3B,OAAO,IAAI,CAACD,KAAK,CAAC;AAAE,MAAA,GAAGC,IAAI;AAAE3B,MAAAA,WAAW,EAAE,KAAA;AAAM,KAAC,CAAC,CAAA;AACpD,GAAA;AAEA+B,EAAAA,MAAMA,CAAC5J,MAAM,EAAE5C,MAAM,GAAG,KAAK,EAAE;IAC7B,OAAOyH,SAAS,CAAC,IAAI,EAAE7E,MAAM,EAAEsH,MAAc,EAAE,MAAM;AACnD;AACA;AACA;AACA,MAAA,MAAMuC,gBAAgB,GAAG,IAAI,CAACvE,IAAI,KAAK,IAAI,IAAI,IAAI,CAACA,IAAI,CAACF,UAAU,CAAC,KAAK,CAAC,CAAA;MAC1EhI,MAAM,IAAI,CAACyM,gBAAgB,CAAA;MAC3B,MAAMvE,IAAI,GAAGlI,MAAM,GAAG;AAAEtC,UAAAA,KAAK,EAAEkF,MAAM;AAAEjF,UAAAA,GAAG,EAAE,SAAA;AAAU,SAAC,GAAG;AAAED,UAAAA,KAAK,EAAEkF,MAAAA;SAAQ;AACzE8J,QAAAA,SAAS,GAAG1M,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;MAC9C,IAAI,CAAC,IAAI,CAAC4L,WAAW,CAACc,SAAS,CAAC,CAAC9J,MAAM,CAAC,EAAE;AACxC,QAAA,MAAM+J,MAAM,GAAG,CAACF,gBAAgB,GAC3BrF,EAAE,IAAK,IAAI,CAACwF,OAAO,CAACxF,EAAE,EAAEc,IAAI,EAAE,OAAO,CAAC,GACtCd,EAAE,IAAK,IAAI,CAACyF,WAAW,CAACzF,EAAE,EAAEc,IAAI,CAAC,CAAClI,MAAM,EAAE,CAAA;AAC/C,QAAA,IAAI,CAAC4L,WAAW,CAACc,SAAS,CAAC,CAAC9J,MAAM,CAAC,GAAGqE,SAAS,CAAC0F,MAAM,CAAC,CAAA;AACzD,OAAA;MACA,OAAO,IAAI,CAACf,WAAW,CAACc,SAAS,CAAC,CAAC9J,MAAM,CAAC,CAAA;AAC5C,KAAC,CAAC,CAAA;AACJ,GAAA;AAEAkK,EAAAA,QAAQA,CAAClK,MAAM,EAAE5C,MAAM,GAAG,KAAK,EAAE;IAC/B,OAAOyH,SAAS,CAAC,IAAI,EAAE7E,MAAM,EAAEsH,QAAgB,EAAE,MAAM;MACrD,MAAMhC,IAAI,GAAGlI,MAAM,GACb;AAAElC,UAAAA,OAAO,EAAE8E,MAAM;AAAEnF,UAAAA,IAAI,EAAE,SAAS;AAAEC,UAAAA,KAAK,EAAE,MAAM;AAAEC,UAAAA,GAAG,EAAE,SAAA;AAAU,SAAC,GACnE;AAAEG,UAAAA,OAAO,EAAE8E,MAAAA;SAAQ;AACvB8J,QAAAA,SAAS,GAAG1M,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAA;MAC9C,IAAI,CAAC,IAAI,CAAC0L,aAAa,CAACgB,SAAS,CAAC,CAAC9J,MAAM,CAAC,EAAE;QAC1C,IAAI,CAAC8I,aAAa,CAACgB,SAAS,CAAC,CAAC9J,MAAM,CAAC,GAAG4E,WAAW,CAAEJ,EAAE,IACrD,IAAI,CAACwF,OAAO,CAACxF,EAAE,EAAEc,IAAI,EAAE,SAAS,CAClC,CAAC,CAAA;AACH,OAAA;MACA,OAAO,IAAI,CAACwD,aAAa,CAACgB,SAAS,CAAC,CAAC9J,MAAM,CAAC,CAAA;AAC9C,KAAC,CAAC,CAAA;AACJ,GAAA;AAEAmK,EAAAA,SAASA,GAAG;IACV,OAAOtF,SAAS,CACd,IAAI,EACJnG,SAAS,EACT,MAAM4I,SAAiB,EACvB,MAAM;AACJ;AACA;AACA,MAAA,IAAI,CAAC,IAAI,CAAC2B,aAAa,EAAE;AACvB,QAAA,MAAM3D,IAAI,GAAG;AAAEhK,UAAAA,IAAI,EAAE,SAAS;AAAEQ,UAAAA,SAAS,EAAE,KAAA;SAAO,CAAA;QAClD,IAAI,CAACmN,aAAa,GAAG,CAACxE,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAACiC,GAAG,CACrFnC,EAAE,IAAK,IAAI,CAACwF,OAAO,CAACxF,EAAE,EAAEc,IAAI,EAAE,WAAW,CAC5C,CAAC,CAAA;AACH,OAAA;MAEA,OAAO,IAAI,CAAC2D,aAAa,CAAA;AAC3B,KACF,CAAC,CAAA;AACH,GAAA;EAEAmB,IAAIA,CAACpK,MAAM,EAAE;IACX,OAAO6E,SAAS,CAAC,IAAI,EAAE7E,MAAM,EAAEsH,IAAY,EAAE,MAAM;AACjD,MAAA,MAAMhC,IAAI,GAAG;AAAE1G,QAAAA,GAAG,EAAEoB,MAAAA;OAAQ,CAAA;;AAE5B;AACA;AACA,MAAA,IAAI,CAAC,IAAI,CAACkJ,QAAQ,CAAClJ,MAAM,CAAC,EAAE;QAC1B,IAAI,CAACkJ,QAAQ,CAAClJ,MAAM,CAAC,GAAG,CAACyE,QAAQ,CAACC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAED,QAAQ,CAACC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAACiC,GAAG,CAAEnC,EAAE,IACjF,IAAI,CAACwF,OAAO,CAACxF,EAAE,EAAEc,IAAI,EAAE,KAAK,CAC9B,CAAC,CAAA;AACH,OAAA;AAEA,MAAA,OAAO,IAAI,CAAC4D,QAAQ,CAAClJ,MAAM,CAAC,CAAA;AAC9B,KAAC,CAAC,CAAA;AACJ,GAAA;AAEAgK,EAAAA,OAAOA,CAACxF,EAAE,EAAEqB,QAAQ,EAAEwE,KAAK,EAAE;IAC3B,MAAMC,EAAE,GAAG,IAAI,CAACL,WAAW,CAACzF,EAAE,EAAEqB,QAAQ,CAAC;AACvC0E,MAAAA,OAAO,GAAGD,EAAE,CAACzK,aAAa,EAAE;AAC5B2K,MAAAA,QAAQ,GAAGD,OAAO,CAACE,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAAC9N,IAAI,CAAC+N,WAAW,EAAE,KAAKN,KAAK,CAAC,CAAA;AAChE,IAAA,OAAOG,QAAQ,GAAGA,QAAQ,CAACvK,KAAK,GAAG,IAAI,CAAA;AACzC,GAAA;AAEA2K,EAAAA,eAAeA,CAAC1N,IAAI,GAAG,EAAE,EAAE;AACzB;AACA;AACA,IAAA,OAAO,IAAImI,mBAAmB,CAAC,IAAI,CAACC,IAAI,EAAEpI,IAAI,CAACqI,WAAW,IAAI,IAAI,CAAC6D,WAAW,EAAElM,IAAI,CAAC,CAAA;AACvF,GAAA;AAEA+M,EAAAA,WAAWA,CAACzF,EAAE,EAAEqB,QAAQ,GAAG,EAAE,EAAE;IAC7B,OAAO,IAAIM,iBAAiB,CAAC3B,EAAE,EAAE,IAAI,CAACc,IAAI,EAAEO,QAAQ,CAAC,CAAA;AACvD,GAAA;AAEAgF,EAAAA,YAAYA,CAAC3N,IAAI,GAAG,EAAE,EAAE;AACtB,IAAA,OAAO,IAAI8J,gBAAgB,CAAC,IAAI,CAAC1B,IAAI,EAAE,IAAI,CAAC2B,SAAS,EAAE,EAAE/J,IAAI,CAAC,CAAA;AAChE,GAAA;AAEA4N,EAAAA,aAAaA,CAAC5N,IAAI,GAAG,EAAE,EAAE;AACvB,IAAA,OAAOyE,WAAW,CAAC,IAAI,CAAC2D,IAAI,EAAEpI,IAAI,CAAC,CAAA;AACrC,GAAA;AAEA+J,EAAAA,SAASA,GAAG;AACV,IAAA,OACE,IAAI,CAACjJ,MAAM,KAAK,IAAI,IACpB,IAAI,CAACA,MAAM,CAAC2M,WAAW,EAAE,KAAK,OAAO,IACrC5H,2BAA2B,CAAC,IAAI,CAACuC,IAAI,CAAC,CAACtH,MAAM,CAACoH,UAAU,CAAC,OAAO,CAAC,CAAA;AAErE,GAAA;AAEA2F,EAAAA,eAAeA,GAAG;IAChB,IAAI,IAAI,CAACnD,YAAY,EAAE;MACrB,OAAO,IAAI,CAACA,YAAY,CAAA;AAC1B,KAAC,MAAM,IAAI,CAACoD,iBAAiB,EAAE,EAAE;AAC/B,MAAA,OAAO1H,oBAAoB,CAAA;AAC7B,KAAC,MAAM;AACL,MAAA,OAAOL,iBAAiB,CAAC,IAAI,CAACjF,MAAM,CAAC,CAAA;AACvC,KAAA;AACF,GAAA;AAEAiN,EAAAA,cAAcA,GAAG;AACf,IAAA,OAAO,IAAI,CAACF,eAAe,EAAE,CAACvD,QAAQ,CAAA;AACxC,GAAA;AAEA0D,EAAAA,qBAAqBA,GAAG;AACtB,IAAA,OAAO,IAAI,CAACH,eAAe,EAAE,CAACtD,WAAW,CAAA;AAC3C,GAAA;AAEA0D,EAAAA,cAAcA,GAAG;AACf,IAAA,OAAO,IAAI,CAACJ,eAAe,EAAE,CAACrD,OAAO,CAAA;AACvC,GAAA;EAEApK,MAAMA,CAAC8N,KAAK,EAAE;IACZ,OACE,IAAI,CAACpN,MAAM,KAAKoN,KAAK,CAACpN,MAAM,IAC5B,IAAI,CAACgG,eAAe,KAAKoH,KAAK,CAACpH,eAAe,IAC9C,IAAI,CAACG,cAAc,KAAKiH,KAAK,CAACjH,cAAc,CAAA;AAEhD,GAAA;AAEAkH,EAAAA,QAAQA,GAAG;AACT,IAAA,OAAQ,CAAS,OAAA,EAAA,IAAI,CAACrN,MAAO,CAAI,EAAA,EAAA,IAAI,CAACgG,eAAgB,CAAI,EAAA,EAAA,IAAI,CAACG,cAAe,CAAE,CAAA,CAAA,CAAA;AAClF,GAAA;AACF;;ACrjBA,IAAI1G,SAAS,GAAG,IAAI,CAAA;;AAEpB;AACA;AACA;AACA;AACe,MAAM6N,eAAe,SAAS3O,IAAI,CAAC;AAChD;AACF;AACA;AACA;EACE,WAAW4O,WAAWA,GAAG;IACvB,IAAI9N,SAAS,KAAK,IAAI,EAAE;AACtBA,MAAAA,SAAS,GAAG,IAAI6N,eAAe,CAAC,CAAC,CAAC,CAAA;AACpC,KAAA;AACA,IAAA,OAAO7N,SAAS,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAOE,QAAQA,CAACN,MAAM,EAAE;AACtB,IAAA,OAAOA,MAAM,KAAK,CAAC,GAAGiO,eAAe,CAACC,WAAW,GAAG,IAAID,eAAe,CAACjO,MAAM,CAAC,CAAA;AACjF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOmO,cAAcA,CAAC9Q,CAAC,EAAE;AACvB,IAAA,IAAIA,CAAC,EAAE;AACL,MAAA,MAAM+Q,CAAC,GAAG/Q,CAAC,CAACgR,KAAK,CAAC,uCAAuC,CAAC,CAAA;AAC1D,MAAA,IAAID,CAAC,EAAE;AACL,QAAA,OAAO,IAAIH,eAAe,CAACK,YAAY,CAACF,CAAC,CAAC,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACtD,OAAA;AACF,KAAA;AACA,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;EAEA1R,WAAWA,CAACsD,MAAM,EAAE;AAClB,IAAA,KAAK,EAAE,CAAA;AACP;IACA,IAAI,CAAC2I,KAAK,GAAG3I,MAAM,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIT,IAAIA,GAAG;AACT,IAAA,OAAO,OAAO,CAAA;AAChB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIC,IAAIA,GAAG;AACT,IAAA,OAAO,IAAI,CAACmJ,KAAK,KAAK,CAAC,GAAG,KAAK,GAAI,CAAK7I,GAAAA,EAAAA,YAAY,CAAC,IAAI,CAAC6I,KAAK,EAAE,QAAQ,CAAE,CAAC,CAAA,CAAA;AAC9E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIlJ,QAAQA,GAAG;AACb,IAAA,IAAI,IAAI,CAACkJ,KAAK,KAAK,CAAC,EAAE;AACpB,MAAA,OAAO,SAAS,CAAA;AAClB,KAAC,MAAM;MACL,OAAQ,CAAA,OAAA,EAAS7I,YAAY,CAAC,CAAC,IAAI,CAAC6I,KAAK,EAAE,QAAQ,CAAE,CAAC,CAAA,CAAA;AACxD,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACEhJ,EAAAA,UAAUA,GAAG;IACX,OAAO,IAAI,CAACH,IAAI,CAAA;AAClB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACEM,EAAAA,YAAYA,CAACF,EAAE,EAAEG,MAAM,EAAE;AACvB,IAAA,OAAOD,YAAY,CAAC,IAAI,CAAC6I,KAAK,EAAE5I,MAAM,CAAC,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIL,WAAWA,GAAG;AAChB,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACEM,EAAAA,MAAMA,GAAG;IACP,OAAO,IAAI,CAAC2I,KAAK,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE1I,MAAMA,CAACC,SAAS,EAAE;AAChB,IAAA,OAAOA,SAAS,CAACX,IAAI,KAAK,OAAO,IAAIW,SAAS,CAACyI,KAAK,KAAK,IAAI,CAACA,KAAK,CAAA;AACrE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIxI,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACF;;ACnJA;AACA;AACA;AACA;AACe,MAAMoO,WAAW,SAASjP,IAAI,CAAC;EAC5C5C,WAAWA,CAACwE,QAAQ,EAAE;AACpB,IAAA,KAAK,EAAE,CAAA;AACP;IACA,IAAI,CAACA,QAAQ,GAAGA,QAAQ,CAAA;AAC1B,GAAA;;AAEA;EACA,IAAI3B,IAAIA,GAAG;AACT,IAAA,OAAO,SAAS,CAAA;AAClB,GAAA;;AAEA;EACA,IAAIC,IAAIA,GAAG;IACT,OAAO,IAAI,CAAC0B,QAAQ,CAAA;AACtB,GAAA;;AAEA;EACA,IAAIxB,WAAWA,GAAG;AAChB,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;AACAC,EAAAA,UAAUA,GAAG;AACX,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;;AAEA;AACAG,EAAAA,YAAYA,GAAG;AACb,IAAA,OAAO,EAAE,CAAA;AACX,GAAA;;AAEA;AACAE,EAAAA,MAAMA,GAAG;AACP,IAAA,OAAO0D,GAAG,CAAA;AACZ,GAAA;;AAEA;AACAzD,EAAAA,MAAMA,GAAG;AACP,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;;AAEA;EACA,IAAIE,OAAOA,GAAG;AACZ,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACF;;ACpDA;AACA;AACA;AAUO,SAASqO,aAAaA,CAACC,KAAK,EAAEC,WAAW,EAAE;EAEhD,IAAI5L,WAAW,CAAC2L,KAAK,CAAC,IAAIA,KAAK,KAAK,IAAI,EAAE;AACxC,IAAA,OAAOC,WAAW,CAAA;AACpB,GAAC,MAAM,IAAID,KAAK,YAAYnP,IAAI,EAAE;AAChC,IAAA,OAAOmP,KAAK,CAAA;AACd,GAAC,MAAM,IAAIE,QAAQ,CAACF,KAAK,CAAC,EAAE;AAC1B,IAAA,MAAMG,OAAO,GAAGH,KAAK,CAACnB,WAAW,EAAE,CAAA;IACnC,IAAIsB,OAAO,KAAK,SAAS,EAAE,OAAOF,WAAW,CAAC,KACzC,IAAIE,OAAO,KAAK,OAAO,IAAIA,OAAO,KAAK,QAAQ,EAAE,OAAOvO,UAAU,CAACC,QAAQ,CAAC,KAC5E,IAAIsO,OAAO,KAAK,KAAK,IAAIA,OAAO,KAAK,KAAK,EAAE,OAAOX,eAAe,CAACC,WAAW,CAAC,KAC/E,OAAOD,eAAe,CAACE,cAAc,CAACS,OAAO,CAAC,IAAI3L,QAAQ,CAACC,MAAM,CAACuL,KAAK,CAAC,CAAA;AAC/E,GAAC,MAAM,IAAII,QAAQ,CAACJ,KAAK,CAAC,EAAE;AAC1B,IAAA,OAAOR,eAAe,CAAC3N,QAAQ,CAACmO,KAAK,CAAC,CAAA;AACxC,GAAC,MAAM,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,QAAQ,IAAIA,KAAK,IAAI,OAAOA,KAAK,CAACzO,MAAM,KAAK,UAAU,EAAE;AAC/F;AACA;AACA,IAAA,OAAOyO,KAAK,CAAA;AACd,GAAC,MAAM;AACL,IAAA,OAAO,IAAIF,WAAW,CAACE,KAAK,CAAC,CAAA;AAC/B,GAAA;AACF;;ACjCA,MAAMK,gBAAgB,GAAG;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,iBAAiB;AAC1BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,QAAQ,EAAE,iBAAiB;AAC3BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,uBAAuB;AAChCC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,OAAO,EAAE,iBAAiB;AAC1BC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,iBAAiB;AACvBC,EAAAA,IAAI,EAAE,KAAA;AACR,CAAC,CAAA;AAED,MAAMC,qBAAqB,GAAG;AAC5BrB,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC;AACxBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBE,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AACrBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;AAClBC,EAAAA,IAAI,EAAE,CAAC,IAAI,EAAE,IAAI,CAAA;AACnB,CAAC,CAAA;AAED,MAAMG,YAAY,GAAGvB,gBAAgB,CAACQ,OAAO,CAACzN,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAACyO,KAAK,CAAC,EAAE,CAAC,CAAA;AAExE,SAASC,WAAWA,CAACC,GAAG,EAAE;AAC/B,EAAA,IAAI5N,KAAK,GAAGG,QAAQ,CAACyN,GAAG,EAAE,EAAE,CAAC,CAAA;AAC7B,EAAA,IAAI7M,KAAK,CAACf,KAAK,CAAC,EAAE;AAChBA,IAAAA,KAAK,GAAG,EAAE,CAAA;AACV,IAAA,KAAK,IAAIF,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8N,GAAG,CAAC7N,MAAM,EAAED,CAAC,EAAE,EAAE;AACnC,MAAA,MAAM+N,IAAI,GAAGD,GAAG,CAACE,UAAU,CAAChO,CAAC,CAAC,CAAA;AAE9B,MAAA,IAAI8N,GAAG,CAAC9N,CAAC,CAAC,CAACiO,MAAM,CAAC7B,gBAAgB,CAACQ,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE;QAClD1M,KAAK,IAAIyN,YAAY,CAAChK,OAAO,CAACmK,GAAG,CAAC9N,CAAC,CAAC,CAAC,CAAA;AACvC,OAAC,MAAM;AACL,QAAA,KAAK,MAAM8B,GAAG,IAAI4L,qBAAqB,EAAE;UACvC,MAAM,CAACQ,GAAG,EAAEC,GAAG,CAAC,GAAGT,qBAAqB,CAAC5L,GAAG,CAAC,CAAA;AAC7C,UAAA,IAAIiM,IAAI,IAAIG,GAAG,IAAIH,IAAI,IAAII,GAAG,EAAE;YAC9BjO,KAAK,IAAI6N,IAAI,GAAGG,GAAG,CAAA;AACrB,WAAA;AACF,SAAA;AACF,OAAA;AACF,KAAA;AACA,IAAA,OAAO7N,QAAQ,CAACH,KAAK,EAAE,EAAE,CAAC,CAAA;AAC5B,GAAC,MAAM;AACL,IAAA,OAAOA,KAAK,CAAA;AACd,GAAA;AACF,CAAA;;AAEA;AACA,MAAMkO,eAAe,GAAG,IAAI9P,GAAG,EAAE,CAAA;AAC1B,SAAS+P,oBAAoBA,GAAG;EACrCD,eAAe,CAACzN,KAAK,EAAE,CAAA;AACzB,CAAA;AAEO,SAAS2N,UAAUA,CAAC;AAAErK,EAAAA,eAAAA;AAAgB,CAAC,EAAEsK,MAAM,GAAG,EAAE,EAAE;AAC3D,EAAA,MAAMC,EAAE,GAAGvK,eAAe,IAAI,MAAM,CAAA;AAEpC,EAAA,IAAIwK,WAAW,GAAGL,eAAe,CAAC1P,GAAG,CAAC8P,EAAE,CAAC,CAAA;EACzC,IAAIC,WAAW,KAAK9P,SAAS,EAAE;AAC7B8P,IAAAA,WAAW,GAAG,IAAInQ,GAAG,EAAE,CAAA;AACvB8P,IAAAA,eAAe,CAACtP,GAAG,CAAC0P,EAAE,EAAEC,WAAW,CAAC,CAAA;AACtC,GAAA;AACA,EAAA,IAAIC,KAAK,GAAGD,WAAW,CAAC/P,GAAG,CAAC6P,MAAM,CAAC,CAAA;EACnC,IAAIG,KAAK,KAAK/P,SAAS,EAAE;AACvB+P,IAAAA,KAAK,GAAG,IAAIC,MAAM,CAAE,CAAEvC,EAAAA,gBAAgB,CAACoC,EAAE,CAAE,CAAA,EAAED,MAAO,CAAA,CAAC,CAAC,CAAA;AACtDE,IAAAA,WAAW,CAAC3P,GAAG,CAACyP,MAAM,EAAEG,KAAK,CAAC,CAAA;AAChC,GAAA;AAEA,EAAA,OAAOA,KAAK,CAAA;AACd;;ACpFA,IAAIE,GAAG,GAAGA,MAAMzQ,IAAI,CAACyQ,GAAG,EAAE;AACxB5C,EAAAA,WAAW,GAAG,QAAQ;AACtB/D,EAAAA,aAAa,GAAG,IAAI;AACpBG,EAAAA,sBAAsB,GAAG,IAAI;AAC7BE,EAAAA,qBAAqB,GAAG,IAAI;AAC5BuG,EAAAA,kBAAkB,GAAG,EAAE;EACvBC,cAAc;AACdrG,EAAAA,mBAAmB,GAAG,IAAI,CAAA;;AAE5B;AACA;AACA;AACe,MAAMT,QAAQ,CAAC;AAC5B;AACF;AACA;AACA;EACE,WAAW4G,GAAGA,GAAG;AACf,IAAA,OAAOA,GAAG,CAAA;AACZ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,WAAWA,GAAGA,CAAClU,CAAC,EAAE;AAChBkU,IAAAA,GAAG,GAAGlU,CAAC,CAAA;AACT,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,WAAWsR,WAAWA,CAACvL,IAAI,EAAE;AAC3BuL,IAAAA,WAAW,GAAGvL,IAAI,CAAA;AACpB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,WAAWuL,WAAWA,GAAG;AACvB,IAAA,OAAOF,aAAa,CAACE,WAAW,EAAErO,UAAU,CAACC,QAAQ,CAAC,CAAA;AACxD,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWqK,aAAaA,GAAG;AACzB,IAAA,OAAOA,aAAa,CAAA;AACtB,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWA,aAAaA,CAAChK,MAAM,EAAE;AAC/BgK,IAAAA,aAAa,GAAGhK,MAAM,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWmK,sBAAsBA,GAAG;AAClC,IAAA,OAAOA,sBAAsB,CAAA;AAC/B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWA,sBAAsBA,CAACnE,eAAe,EAAE;AACjDmE,IAAAA,sBAAsB,GAAGnE,eAAe,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWqE,qBAAqBA,GAAG;AACjC,IAAA,OAAOA,qBAAqB,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWA,qBAAqBA,CAAClE,cAAc,EAAE;AAC/CkE,IAAAA,qBAAqB,GAAGlE,cAAc,CAAA;AACxC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;;AAEE;AACF;AACA;EACE,WAAWqE,mBAAmBA,GAAG;AAC/B,IAAA,OAAOA,mBAAmB,CAAA;AAC5B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,WAAWA,mBAAmBA,CAACZ,YAAY,EAAE;AAC3CY,IAAAA,mBAAmB,GAAGD,oBAAoB,CAACX,YAAY,CAAC,CAAA;AAC1D,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWgH,kBAAkBA,GAAG;AAC9B,IAAA,OAAOA,kBAAkB,CAAA;AAC3B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,WAAWA,kBAAkBA,CAACE,UAAU,EAAE;IACxCF,kBAAkB,GAAGE,UAAU,GAAG,GAAG,CAAA;AACvC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWD,cAAcA,GAAG;AAC1B,IAAA,OAAOA,cAAc,CAAA;AACvB,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWA,cAAcA,CAACE,CAAC,EAAE;AAC3BF,IAAAA,cAAc,GAAGE,CAAC,CAAA;AACpB,GAAA;;AAEA;AACF;AACA;AACA;EACE,OAAOC,WAAWA,GAAG;IACnB7L,MAAM,CAAC1C,UAAU,EAAE,CAAA;IACnBH,QAAQ,CAACG,UAAU,EAAE,CAAA;IACrBgE,QAAQ,CAAChE,UAAU,EAAE,CAAA;AACrB2N,IAAAA,oBAAoB,EAAE,CAAA;AACxB,GAAA;AACF;;ACnLe,MAAMa,OAAO,CAAC;AAC3BlV,EAAAA,WAAWA,CAACC,MAAM,EAAEkV,WAAW,EAAE;IAC/B,IAAI,CAAClV,MAAM,GAAGA,MAAM,CAAA;IACpB,IAAI,CAACkV,WAAW,GAAGA,WAAW,CAAA;AAChC,GAAA;AAEAjV,EAAAA,SAASA,GAAG;IACV,IAAI,IAAI,CAACiV,WAAW,EAAE;MACpB,OAAQ,CAAA,EAAE,IAAI,CAAClV,MAAO,KAAI,IAAI,CAACkV,WAAY,CAAC,CAAA,CAAA;AAC9C,KAAC,MAAM;MACL,OAAO,IAAI,CAAClV,MAAM,CAAA;AACpB,KAAA;AACF,GAAA;AACF;;ACAA,MAAMmV,aAAa,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;EAC3EC,UAAU,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAEtE,SAASC,cAAcA,CAAC/U,IAAI,EAAE2F,KAAK,EAAE;AACnC,EAAA,OAAO,IAAIgP,OAAO,CAChB,mBAAmB,EAClB,CAAA,cAAA,EAAgBhP,KAAM,CAAA,UAAA,EAAY,OAAOA,KAAM,CAAS3F,OAAAA,EAAAA,IAAK,oBAChE,CAAC,CAAA;AACH,CAAA;AAEO,SAASgV,SAASA,CAACzU,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;AAC1C,EAAA,MAAMwU,CAAC,GAAG,IAAIrR,IAAI,CAACA,IAAI,CAACsR,GAAG,CAAC3U,IAAI,EAAEC,KAAK,GAAG,CAAC,EAAEC,GAAG,CAAC,CAAC,CAAA;AAElD,EAAA,IAAIF,IAAI,GAAG,GAAG,IAAIA,IAAI,IAAI,CAAC,EAAE;IAC3B0U,CAAC,CAACE,cAAc,CAACF,CAAC,CAACG,cAAc,EAAE,GAAG,IAAI,CAAC,CAAA;AAC7C,GAAA;AAEA,EAAA,MAAMC,EAAE,GAAGJ,CAAC,CAACK,SAAS,EAAE,CAAA;AAExB,EAAA,OAAOD,EAAE,KAAK,CAAC,GAAG,CAAC,GAAGA,EAAE,CAAA;AAC1B,CAAA;AAEA,SAASE,cAAcA,CAAChV,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAE;AACxC,EAAA,OAAOA,GAAG,GAAG,CAAC+U,UAAU,CAACjV,IAAI,CAAC,GAAGuU,UAAU,GAAGD,aAAa,EAAErU,KAAK,GAAG,CAAC,CAAC,CAAA;AACzE,CAAA;AAEA,SAASiV,gBAAgBA,CAAClV,IAAI,EAAEmV,OAAO,EAAE;EACvC,MAAMC,KAAK,GAAGH,UAAU,CAACjV,IAAI,CAAC,GAAGuU,UAAU,GAAGD,aAAa;IACzDe,MAAM,GAAGD,KAAK,CAACE,SAAS,CAAEpQ,CAAC,IAAKA,CAAC,GAAGiQ,OAAO,CAAC;AAC5CjV,IAAAA,GAAG,GAAGiV,OAAO,GAAGC,KAAK,CAACC,MAAM,CAAC,CAAA;EAC/B,OAAO;IAAEpV,KAAK,EAAEoV,MAAM,GAAG,CAAC;AAAEnV,IAAAA,GAAAA;GAAK,CAAA;AACnC,CAAA;AAEO,SAASqV,iBAAiBA,CAACC,UAAU,EAAEC,WAAW,EAAE;EACzD,OAAQ,CAACD,UAAU,GAAGC,WAAW,GAAG,CAAC,IAAI,CAAC,GAAI,CAAC,CAAA;AACjD,CAAA;;AAEA;AACA;AACA;;AAEO,SAASC,eAAeA,CAACC,OAAO,EAAEC,kBAAkB,GAAG,CAAC,EAAEH,WAAW,GAAG,CAAC,EAAE;EAChF,MAAM;MAAEzV,IAAI;MAAEC,KAAK;AAAEC,MAAAA,GAAAA;AAAI,KAAC,GAAGyV,OAAO;IAClCR,OAAO,GAAGH,cAAc,CAAChV,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC;AAC1CG,IAAAA,OAAO,GAAGkV,iBAAiB,CAACd,SAAS,CAACzU,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,EAAEuV,WAAW,CAAC,CAAA;AAEvE,EAAA,IAAII,UAAU,GAAGxP,IAAI,CAACuE,KAAK,CAAC,CAACuK,OAAO,GAAG9U,OAAO,GAAG,EAAE,GAAGuV,kBAAkB,IAAI,CAAC,CAAC;IAC5EE,QAAQ,CAAA;EAEV,IAAID,UAAU,GAAG,CAAC,EAAE;IAClBC,QAAQ,GAAG9V,IAAI,GAAG,CAAC,CAAA;IACnB6V,UAAU,GAAGE,eAAe,CAACD,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;AACzE,GAAC,MAAM,IAAII,UAAU,GAAGE,eAAe,CAAC/V,IAAI,EAAE4V,kBAAkB,EAAEH,WAAW,CAAC,EAAE;IAC9EK,QAAQ,GAAG9V,IAAI,GAAG,CAAC,CAAA;AACnB6V,IAAAA,UAAU,GAAG,CAAC,CAAA;AAChB,GAAC,MAAM;AACLC,IAAAA,QAAQ,GAAG9V,IAAI,CAAA;AACjB,GAAA;EAEA,OAAO;IAAE8V,QAAQ;IAAED,UAAU;IAAExV,OAAO;IAAE,GAAG2V,UAAU,CAACL,OAAO,CAAA;GAAG,CAAA;AAClE,CAAA;AAEO,SAASM,eAAeA,CAACC,QAAQ,EAAEN,kBAAkB,GAAG,CAAC,EAAEH,WAAW,GAAG,CAAC,EAAE;EACjF,MAAM;MAAEK,QAAQ;MAAED,UAAU;AAAExV,MAAAA,OAAAA;AAAQ,KAAC,GAAG6V,QAAQ;AAChDC,IAAAA,aAAa,GAAGZ,iBAAiB,CAACd,SAAS,CAACqB,QAAQ,EAAE,CAAC,EAAEF,kBAAkB,CAAC,EAAEH,WAAW,CAAC;AAC1FW,IAAAA,UAAU,GAAGC,UAAU,CAACP,QAAQ,CAAC,CAAA;AAEnC,EAAA,IAAIX,OAAO,GAAGU,UAAU,GAAG,CAAC,GAAGxV,OAAO,GAAG8V,aAAa,GAAG,CAAC,GAAGP,kBAAkB;IAC7E5V,IAAI,CAAA;EAEN,IAAImV,OAAO,GAAG,CAAC,EAAE;IACfnV,IAAI,GAAG8V,QAAQ,GAAG,CAAC,CAAA;AACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAACrW,IAAI,CAAC,CAAA;AAC7B,GAAC,MAAM,IAAImV,OAAO,GAAGiB,UAAU,EAAE;IAC/BpW,IAAI,GAAG8V,QAAQ,GAAG,CAAC,CAAA;AACnBX,IAAAA,OAAO,IAAIkB,UAAU,CAACP,QAAQ,CAAC,CAAA;AACjC,GAAC,MAAM;AACL9V,IAAAA,IAAI,GAAG8V,QAAQ,CAAA;AACjB,GAAA;EAEA,MAAM;IAAE7V,KAAK;AAAEC,IAAAA,GAAAA;AAAI,GAAC,GAAGgV,gBAAgB,CAAClV,IAAI,EAAEmV,OAAO,CAAC,CAAA;EACtD,OAAO;IAAEnV,IAAI;IAAEC,KAAK;IAAEC,GAAG;IAAE,GAAG8V,UAAU,CAACE,QAAQ,CAAA;GAAG,CAAA;AACtD,CAAA;AAEO,SAASI,kBAAkBA,CAACC,QAAQ,EAAE;EAC3C,MAAM;IAAEvW,IAAI;IAAEC,KAAK;AAAEC,IAAAA,GAAAA;AAAI,GAAC,GAAGqW,QAAQ,CAAA;EACrC,MAAMpB,OAAO,GAAGH,cAAc,CAAChV,IAAI,EAAEC,KAAK,EAAEC,GAAG,CAAC,CAAA;EAChD,OAAO;IAAEF,IAAI;IAAEmV,OAAO;IAAE,GAAGa,UAAU,CAACO,QAAQ,CAAA;GAAG,CAAA;AACnD,CAAA;AAEO,SAASC,kBAAkBA,CAACC,WAAW,EAAE;EAC9C,MAAM;IAAEzW,IAAI;AAAEmV,IAAAA,OAAAA;AAAQ,GAAC,GAAGsB,WAAW,CAAA;EACrC,MAAM;IAAExW,KAAK;AAAEC,IAAAA,GAAAA;AAAI,GAAC,GAAGgV,gBAAgB,CAAClV,IAAI,EAAEmV,OAAO,CAAC,CAAA;EACtD,OAAO;IAAEnV,IAAI;IAAEC,KAAK;IAAEC,GAAG;IAAE,GAAG8V,UAAU,CAACS,WAAW,CAAA;GAAG,CAAA;AACzD,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,mBAAmBA,CAACC,GAAG,EAAE1M,GAAG,EAAE;EAC5C,MAAM2M,iBAAiB,GACrB,CAACtR,WAAW,CAACqR,GAAG,CAACE,YAAY,CAAC,IAC9B,CAACvR,WAAW,CAACqR,GAAG,CAACG,eAAe,CAAC,IACjC,CAACxR,WAAW,CAACqR,GAAG,CAACI,aAAa,CAAC,CAAA;AACjC,EAAA,IAAIH,iBAAiB,EAAE;IACrB,MAAMI,cAAc,GAClB,CAAC1R,WAAW,CAACqR,GAAG,CAACtW,OAAO,CAAC,IAAI,CAACiF,WAAW,CAACqR,GAAG,CAACd,UAAU,CAAC,IAAI,CAACvQ,WAAW,CAACqR,GAAG,CAACb,QAAQ,CAAC,CAAA;AAEzF,IAAA,IAAIkB,cAAc,EAAE;AAClB,MAAA,MAAM,IAAIzX,6BAA6B,CACrC,gEACF,CAAC,CAAA;AACH,KAAA;AACA,IAAA,IAAI,CAAC+F,WAAW,CAACqR,GAAG,CAACE,YAAY,CAAC,EAAEF,GAAG,CAACtW,OAAO,GAAGsW,GAAG,CAACE,YAAY,CAAA;AAClE,IAAA,IAAI,CAACvR,WAAW,CAACqR,GAAG,CAACG,eAAe,CAAC,EAAEH,GAAG,CAACd,UAAU,GAAGc,GAAG,CAACG,eAAe,CAAA;AAC3E,IAAA,IAAI,CAACxR,WAAW,CAACqR,GAAG,CAACI,aAAa,CAAC,EAAEJ,GAAG,CAACb,QAAQ,GAAGa,GAAG,CAACI,aAAa,CAAA;IACrE,OAAOJ,GAAG,CAACE,YAAY,CAAA;IACvB,OAAOF,GAAG,CAACG,eAAe,CAAA;IAC1B,OAAOH,GAAG,CAACI,aAAa,CAAA;IACxB,OAAO;AACLnB,MAAAA,kBAAkB,EAAE3L,GAAG,CAACoG,qBAAqB,EAAE;AAC/CoF,MAAAA,WAAW,EAAExL,GAAG,CAACmG,cAAc,EAAC;KACjC,CAAA;AACH,GAAC,MAAM;IACL,OAAO;AAAEwF,MAAAA,kBAAkB,EAAE,CAAC;AAAEH,MAAAA,WAAW,EAAE,CAAA;KAAG,CAAA;AAClD,GAAA;AACF,CAAA;AAEO,SAASwB,kBAAkBA,CAACN,GAAG,EAAEf,kBAAkB,GAAG,CAAC,EAAEH,WAAW,GAAG,CAAC,EAAE;AAC/E,EAAA,MAAMyB,SAAS,GAAGC,SAAS,CAACR,GAAG,CAACb,QAAQ,CAAC;AACvCsB,IAAAA,SAAS,GAAGC,cAAc,CACxBV,GAAG,CAACd,UAAU,EACd,CAAC,EACDE,eAAe,CAACY,GAAG,CAACb,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAC/D,CAAC;IACD6B,YAAY,GAAGD,cAAc,CAACV,GAAG,CAACtW,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;EAElD,IAAI,CAAC6W,SAAS,EAAE;AACd,IAAA,OAAO1C,cAAc,CAAC,UAAU,EAAEmC,GAAG,CAACb,QAAQ,CAAC,CAAA;AACjD,GAAC,MAAM,IAAI,CAACsB,SAAS,EAAE;AACrB,IAAA,OAAO5C,cAAc,CAAC,MAAM,EAAEmC,GAAG,CAACd,UAAU,CAAC,CAAA;AAC/C,GAAC,MAAM,IAAI,CAACyB,YAAY,EAAE;AACxB,IAAA,OAAO9C,cAAc,CAAC,SAAS,EAAEmC,GAAG,CAACtW,OAAO,CAAC,CAAA;GAC9C,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAASkX,qBAAqBA,CAACZ,GAAG,EAAE;AACzC,EAAA,MAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAC3W,IAAI,CAAC;AACnCwX,IAAAA,YAAY,GAAGH,cAAc,CAACV,GAAG,CAACxB,OAAO,EAAE,CAAC,EAAEkB,UAAU,CAACM,GAAG,CAAC3W,IAAI,CAAC,CAAC,CAAA;EAErE,IAAI,CAACkX,SAAS,EAAE;AACd,IAAA,OAAO1C,cAAc,CAAC,MAAM,EAAEmC,GAAG,CAAC3W,IAAI,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAACwX,YAAY,EAAE;AACxB,IAAA,OAAOhD,cAAc,CAAC,SAAS,EAAEmC,GAAG,CAACxB,OAAO,CAAC,CAAA;GAC9C,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAASsC,uBAAuBA,CAACd,GAAG,EAAE;AAC3C,EAAA,MAAMO,SAAS,GAAGC,SAAS,CAACR,GAAG,CAAC3W,IAAI,CAAC;IACnC0X,UAAU,GAAGL,cAAc,CAACV,GAAG,CAAC1W,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;AAC7C0X,IAAAA,QAAQ,GAAGN,cAAc,CAACV,GAAG,CAACzW,GAAG,EAAE,CAAC,EAAE0X,WAAW,CAACjB,GAAG,CAAC3W,IAAI,EAAE2W,GAAG,CAAC1W,KAAK,CAAC,CAAC,CAAA;EAEzE,IAAI,CAACiX,SAAS,EAAE;AACd,IAAA,OAAO1C,cAAc,CAAC,MAAM,EAAEmC,GAAG,CAAC3W,IAAI,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAAC0X,UAAU,EAAE;AACtB,IAAA,OAAOlD,cAAc,CAAC,OAAO,EAAEmC,GAAG,CAAC1W,KAAK,CAAC,CAAA;AAC3C,GAAC,MAAM,IAAI,CAAC0X,QAAQ,EAAE;AACpB,IAAA,OAAOnD,cAAc,CAAC,KAAK,EAAEmC,GAAG,CAACzW,GAAG,CAAC,CAAA;GACtC,MAAM,OAAO,KAAK,CAAA;AACrB,CAAA;AAEO,SAAS2X,kBAAkBA,CAAClB,GAAG,EAAE;EACtC,MAAM;IAAElW,IAAI;IAAEC,MAAM;IAAEE,MAAM;AAAE8F,IAAAA,WAAAA;AAAY,GAAC,GAAGiQ,GAAG,CAAA;EACjD,MAAMmB,SAAS,GACXT,cAAc,CAAC5W,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAC1BA,IAAI,KAAK,EAAE,IAAIC,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAC,IAAI8F,WAAW,KAAK,CAAE;IACpEqR,WAAW,GAAGV,cAAc,CAAC3W,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;IAC3CsX,WAAW,GAAGX,cAAc,CAACzW,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;IAC3CqX,gBAAgB,GAAGZ,cAAc,CAAC3Q,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;EAExD,IAAI,CAACoR,SAAS,EAAE;AACd,IAAA,OAAOtD,cAAc,CAAC,MAAM,EAAE/T,IAAI,CAAC,CAAA;AACrC,GAAC,MAAM,IAAI,CAACsX,WAAW,EAAE;AACvB,IAAA,OAAOvD,cAAc,CAAC,QAAQ,EAAE9T,MAAM,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAACsX,WAAW,EAAE;AACvB,IAAA,OAAOxD,cAAc,CAAC,QAAQ,EAAE5T,MAAM,CAAC,CAAA;AACzC,GAAC,MAAM,IAAI,CAACqX,gBAAgB,EAAE;AAC5B,IAAA,OAAOzD,cAAc,CAAC,aAAa,EAAE9N,WAAW,CAAC,CAAA;GAClD,MAAM,OAAO,KAAK,CAAA;AACrB;;AC7MA;AACA;AACA;AACA;AACA;;AAMA;AACA;AACA;;AAEA;;AAEO,SAASpB,WAAWA,CAAC4S,CAAC,EAAE;EAC7B,OAAO,OAAOA,CAAC,KAAK,WAAW,CAAA;AACjC,CAAA;AAEO,SAAS7G,QAAQA,CAAC6G,CAAC,EAAE;EAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;AAC9B,CAAA;AAEO,SAASf,SAASA,CAACe,CAAC,EAAE;EAC3B,OAAO,OAAOA,CAAC,KAAK,QAAQ,IAAIA,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;AAC7C,CAAA;AAEO,SAAS/G,QAAQA,CAAC+G,CAAC,EAAE;EAC1B,OAAO,OAAOA,CAAC,KAAK,QAAQ,CAAA;AAC9B,CAAA;AAEO,SAASC,MAAMA,CAACD,CAAC,EAAE;EACxB,OAAOpN,MAAM,CAACsN,SAAS,CAAC5H,QAAQ,CAAC6H,IAAI,CAACH,CAAC,CAAC,KAAK,eAAe,CAAA;AAC9D,CAAA;;AAEA;;AAEO,SAAS5L,WAAWA,GAAG;EAC5B,IAAI;IACF,OAAO,OAAOvJ,IAAI,KAAK,WAAW,IAAI,CAAC,CAACA,IAAI,CAAC+E,kBAAkB,CAAA;GAChE,CAAC,OAAO9B,CAAC,EAAE;AACV,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACF,CAAA;AAEO,SAASmK,iBAAiBA,GAAG;EAClC,IAAI;IACF,OACE,OAAOpN,IAAI,KAAK,WAAW,IAC3B,CAAC,CAACA,IAAI,CAACuF,MAAM,KACZ,UAAU,IAAIvF,IAAI,CAACuF,MAAM,CAAC8P,SAAS,IAAI,aAAa,IAAIrV,IAAI,CAACuF,MAAM,CAAC8P,SAAS,CAAC,CAAA;GAElF,CAAC,OAAOpS,CAAC,EAAE;AACV,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASsS,UAAUA,CAACC,KAAK,EAAE;EAChC,OAAOC,KAAK,CAACC,OAAO,CAACF,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAC,CAAA;AAC/C,CAAA;AAEO,SAASG,MAAMA,CAACC,GAAG,EAAEC,EAAE,EAAEC,OAAO,EAAE;AACvC,EAAA,IAAIF,GAAG,CAACxT,MAAM,KAAK,CAAC,EAAE;AACpB,IAAA,OAAOtB,SAAS,CAAA;AAClB,GAAA;EACA,OAAO8U,GAAG,CAACG,MAAM,CAAC,CAACC,IAAI,EAAEC,IAAI,KAAK;IAChC,MAAMC,IAAI,GAAG,CAACL,EAAE,CAACI,IAAI,CAAC,EAAEA,IAAI,CAAC,CAAA;IAC7B,IAAI,CAACD,IAAI,EAAE;AACT,MAAA,OAAOE,IAAI,CAAA;AACb,KAAC,MAAM,IAAIJ,OAAO,CAACE,IAAI,CAAC,CAAC,CAAC,EAAEE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAKF,IAAI,CAAC,CAAC,CAAC,EAAE;AAChD,MAAA,OAAOA,IAAI,CAAA;AACb,KAAC,MAAM;AACL,MAAA,OAAOE,IAAI,CAAA;AACb,KAAA;AACF,GAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AACb,CAAA;AAEO,SAASC,IAAIA,CAACvC,GAAG,EAAE5L,IAAI,EAAE;EAC9B,OAAOA,IAAI,CAAC+N,MAAM,CAAC,CAACK,CAAC,EAAEC,CAAC,KAAK;AAC3BD,IAAAA,CAAC,CAACC,CAAC,CAAC,GAAGzC,GAAG,CAACyC,CAAC,CAAC,CAAA;AACb,IAAA,OAAOD,CAAC,CAAA;GACT,EAAE,EAAE,CAAC,CAAA;AACR,CAAA;AAEO,SAASE,cAAcA,CAAC1C,GAAG,EAAE2C,IAAI,EAAE;EACxC,OAAOxO,MAAM,CAACsN,SAAS,CAACiB,cAAc,CAAChB,IAAI,CAAC1B,GAAG,EAAE2C,IAAI,CAAC,CAAA;AACxD,CAAA;AAEO,SAAS5L,oBAAoBA,CAAC6L,QAAQ,EAAE;EAC7C,IAAIA,QAAQ,IAAI,IAAI,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM,IAAI,OAAOA,QAAQ,KAAK,QAAQ,EAAE;AACvC,IAAA,MAAM,IAAI7Z,oBAAoB,CAAC,iCAAiC,CAAC,CAAA;AACnE,GAAC,MAAM;IACL,IACE,CAAC2X,cAAc,CAACkC,QAAQ,CAAC5M,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,IACxC,CAAC0K,cAAc,CAACkC,QAAQ,CAAC3M,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,IAC3C,CAAC4L,KAAK,CAACC,OAAO,CAACc,QAAQ,CAAC1M,OAAO,CAAC,IAChC0M,QAAQ,CAAC1M,OAAO,CAAC2M,IAAI,CAAEC,CAAC,IAAK,CAACpC,cAAc,CAACoC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EACtD;AACA,MAAA,MAAM,IAAI/Z,oBAAoB,CAAC,uBAAuB,CAAC,CAAA;AACzD,KAAA;IACA,OAAO;MACLiN,QAAQ,EAAE4M,QAAQ,CAAC5M,QAAQ;MAC3BC,WAAW,EAAE2M,QAAQ,CAAC3M,WAAW;AACjCC,MAAAA,OAAO,EAAE2L,KAAK,CAACkB,IAAI,CAACH,QAAQ,CAAC1M,OAAO,CAAA;KACrC,CAAA;AACH,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASwK,cAAcA,CAACkB,KAAK,EAAEoB,MAAM,EAAEC,GAAG,EAAE;EACjD,OAAOzC,SAAS,CAACoB,KAAK,CAAC,IAAIA,KAAK,IAAIoB,MAAM,IAAIpB,KAAK,IAAIqB,GAAG,CAAA;AAC5D,CAAA;;AAEA;AACO,SAASC,QAAQA,CAACC,CAAC,EAAEla,CAAC,EAAE;EAC7B,OAAOka,CAAC,GAAGla,CAAC,GAAGyG,IAAI,CAACuE,KAAK,CAACkP,CAAC,GAAGla,CAAC,CAAC,CAAA;AAClC,CAAA;AAEO,SAASyL,QAAQA,CAAC4F,KAAK,EAAErR,CAAC,GAAG,CAAC,EAAE;AACrC,EAAA,MAAMma,KAAK,GAAG9I,KAAK,GAAG,CAAC,CAAA;AACvB,EAAA,IAAI+I,MAAM,CAAA;AACV,EAAA,IAAID,KAAK,EAAE;AACTC,IAAAA,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC/I,KAAK,EAAE5F,QAAQ,CAACzL,CAAC,EAAE,GAAG,CAAC,CAAA;AAC/C,GAAC,MAAM;IACLoa,MAAM,GAAG,CAAC,EAAE,GAAG/I,KAAK,EAAE5F,QAAQ,CAACzL,CAAC,EAAE,GAAG,CAAC,CAAA;AACxC,GAAA;AACA,EAAA,OAAOoa,MAAM,CAAA;AACf,CAAA;AAEO,SAASC,YAAYA,CAACC,MAAM,EAAE;AACnC,EAAA,IAAI5U,WAAW,CAAC4U,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;AAC3D,IAAA,OAAOrW,SAAS,CAAA;AAClB,GAAC,MAAM;AACL,IAAA,OAAO0B,QAAQ,CAAC2U,MAAM,EAAE,EAAE,CAAC,CAAA;AAC7B,GAAA;AACF,CAAA;AAEO,SAASC,aAAaA,CAACD,MAAM,EAAE;AACpC,EAAA,IAAI5U,WAAW,CAAC4U,MAAM,CAAC,IAAIA,MAAM,KAAK,IAAI,IAAIA,MAAM,KAAK,EAAE,EAAE;AAC3D,IAAA,OAAOrW,SAAS,CAAA;AAClB,GAAC,MAAM;IACL,OAAOuW,UAAU,CAACF,MAAM,CAAC,CAAA;AAC3B,GAAA;AACF,CAAA;AAEO,SAASG,WAAWA,CAACC,QAAQ,EAAE;AACpC;AACA,EAAA,IAAIhV,WAAW,CAACgV,QAAQ,CAAC,IAAIA,QAAQ,KAAK,IAAI,IAAIA,QAAQ,KAAK,EAAE,EAAE;AACjE,IAAA,OAAOzW,SAAS,CAAA;AAClB,GAAC,MAAM;IACL,MAAM4F,CAAC,GAAG2Q,UAAU,CAAC,IAAI,GAAGE,QAAQ,CAAC,GAAG,IAAI,CAAA;AAC5C,IAAA,OAAOjU,IAAI,CAACuE,KAAK,CAACnB,CAAC,CAAC,CAAA;AACtB,GAAA;AACF,CAAA;AAEO,SAAS2B,OAAOA,CAACmP,MAAM,EAAEC,MAAM,EAAEC,QAAQ,GAAG,OAAO,EAAE;AAC1D,EAAA,MAAMC,MAAM,GAAG,EAAE,IAAIF,MAAM,CAAA;AAC3B,EAAA,QAAQC,QAAQ;AACd,IAAA,KAAK,QAAQ;MACX,OAAOF,MAAM,GAAG,CAAC,GACblU,IAAI,CAACsU,IAAI,CAACJ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,GACnCrU,IAAI,CAACuE,KAAK,CAAC2P,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC1C,IAAA,KAAK,OAAO;MACV,OAAOrU,IAAI,CAACuU,KAAK,CAACL,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,OAAO;MACV,OAAOrU,IAAI,CAACwU,KAAK,CAACN,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,OAAO;MACV,OAAOrU,IAAI,CAACuE,KAAK,CAAC2P,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC7C,IAAA,KAAK,MAAM;MACT,OAAOrU,IAAI,CAACsU,IAAI,CAACJ,MAAM,GAAGG,MAAM,CAAC,GAAGA,MAAM,CAAA;AAC5C,IAAA;AACE,MAAA,MAAM,IAAII,UAAU,CAAE,CAAiBL,eAAAA,EAAAA,QAAS,kBAAiB,CAAC,CAAA;AACtE,GAAA;AACF,CAAA;;AAEA;;AAEO,SAASxF,UAAUA,CAACjV,IAAI,EAAE;AAC/B,EAAA,OAAOA,IAAI,GAAG,CAAC,KAAK,CAAC,KAAKA,IAAI,GAAG,GAAG,KAAK,CAAC,IAAIA,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAA;AACjE,CAAA;AAEO,SAASqW,UAAUA,CAACrW,IAAI,EAAE;AAC/B,EAAA,OAAOiV,UAAU,CAACjV,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;AACrC,CAAA;AAEO,SAAS4X,WAAWA,CAAC5X,IAAI,EAAEC,KAAK,EAAE;EACvC,MAAM8a,QAAQ,GAAGlB,QAAQ,CAAC5Z,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;IAC1C+a,OAAO,GAAGhb,IAAI,GAAG,CAACC,KAAK,GAAG8a,QAAQ,IAAI,EAAE,CAAA;EAE1C,IAAIA,QAAQ,KAAK,CAAC,EAAE;AAClB,IAAA,OAAO9F,UAAU,CAAC+F,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,CAAA;AACtC,GAAC,MAAM;AACL,IAAA,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAACD,QAAQ,GAAG,CAAC,CAAC,CAAA;AACzE,GAAA;AACF,CAAA;;AAEA;AACO,SAAStU,YAAYA,CAACkQ,GAAG,EAAE;AAChC,EAAA,IAAIjC,CAAC,GAAGrR,IAAI,CAACsR,GAAG,CACdgC,GAAG,CAAC3W,IAAI,EACR2W,GAAG,CAAC1W,KAAK,GAAG,CAAC,EACb0W,GAAG,CAACzW,GAAG,EACPyW,GAAG,CAAClW,IAAI,EACRkW,GAAG,CAACjW,MAAM,EACViW,GAAG,CAAC/V,MAAM,EACV+V,GAAG,CAACjQ,WACN,CAAC,CAAA;;AAED;EACA,IAAIiQ,GAAG,CAAC3W,IAAI,GAAG,GAAG,IAAI2W,GAAG,CAAC3W,IAAI,IAAI,CAAC,EAAE;AACnC0U,IAAAA,CAAC,GAAG,IAAIrR,IAAI,CAACqR,CAAC,CAAC,CAAA;AACf;AACA;AACA;AACAA,IAAAA,CAAC,CAACE,cAAc,CAAC+B,GAAG,CAAC3W,IAAI,EAAE2W,GAAG,CAAC1W,KAAK,GAAG,CAAC,EAAE0W,GAAG,CAACzW,GAAG,CAAC,CAAA;AACpD,GAAA;AACA,EAAA,OAAO,CAACwU,CAAC,CAAA;AACX,CAAA;;AAEA;AACA,SAASuG,eAAeA,CAACjb,IAAI,EAAE4V,kBAAkB,EAAEH,WAAW,EAAE;AAC9D,EAAA,MAAMyF,KAAK,GAAG3F,iBAAiB,CAACd,SAAS,CAACzU,IAAI,EAAE,CAAC,EAAE4V,kBAAkB,CAAC,EAAEH,WAAW,CAAC,CAAA;AACpF,EAAA,OAAO,CAACyF,KAAK,GAAGtF,kBAAkB,GAAG,CAAC,CAAA;AACxC,CAAA;AAEO,SAASG,eAAeA,CAACD,QAAQ,EAAEF,kBAAkB,GAAG,CAAC,EAAEH,WAAW,GAAG,CAAC,EAAE;EACjF,MAAM0F,UAAU,GAAGF,eAAe,CAACnF,QAAQ,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EAC7E,MAAM2F,cAAc,GAAGH,eAAe,CAACnF,QAAQ,GAAG,CAAC,EAAEF,kBAAkB,EAAEH,WAAW,CAAC,CAAA;EACrF,OAAO,CAACY,UAAU,CAACP,QAAQ,CAAC,GAAGqF,UAAU,GAAGC,cAAc,IAAI,CAAC,CAAA;AACjE,CAAA;AAEO,SAASC,cAAcA,CAACrb,IAAI,EAAE;EACnC,IAAIA,IAAI,GAAG,EAAE,EAAE;AACb,IAAA,OAAOA,IAAI,CAAA;AACb,GAAC,MAAM,OAAOA,IAAI,GAAGkN,QAAQ,CAAC6G,kBAAkB,GAAG,IAAI,GAAG/T,IAAI,GAAG,IAAI,GAAGA,IAAI,CAAA;AAC9E,CAAA;;AAEA;;AAEO,SAASoD,aAAaA,CAAChB,EAAE,EAAEkZ,YAAY,EAAEnY,MAAM,EAAED,QAAQ,GAAG,IAAI,EAAE;AACvE,EAAA,MAAMiB,IAAI,GAAG,IAAId,IAAI,CAACjB,EAAE,CAAC;AACvB4I,IAAAA,QAAQ,GAAG;AACT/J,MAAAA,SAAS,EAAE,KAAK;AAChBjB,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,KAAK,EAAE,SAAS;AAChBC,MAAAA,GAAG,EAAE,SAAS;AACdO,MAAAA,IAAI,EAAE,SAAS;AACfC,MAAAA,MAAM,EAAE,SAAA;KACT,CAAA;AAEH,EAAA,IAAIwC,QAAQ,EAAE;IACZ8H,QAAQ,CAAC9H,QAAQ,GAAGA,QAAQ,CAAA;AAC9B,GAAA;AAEA,EAAA,MAAMqY,QAAQ,GAAG;AAAEza,IAAAA,YAAY,EAAEwa,YAAY;IAAE,GAAGtQ,QAAAA;GAAU,CAAA;AAE5D,EAAA,MAAM1G,MAAM,GAAG,IAAIvB,IAAI,CAACC,cAAc,CAACG,MAAM,EAAEoY,QAAQ,CAAC,CACrDvW,aAAa,CAACb,IAAI,CAAC,CACnByL,IAAI,CAAEC,CAAC,IAAKA,CAAC,CAAC9N,IAAI,CAAC+N,WAAW,EAAE,KAAK,cAAc,CAAC,CAAA;AACvD,EAAA,OAAOxL,MAAM,GAAGA,MAAM,CAACc,KAAK,GAAG,IAAI,CAAA;AACrC,CAAA;;AAEA;AACO,SAAS0L,YAAYA,CAAC0K,UAAU,EAAEC,YAAY,EAAE;AACrD,EAAA,IAAIC,OAAO,GAAGnW,QAAQ,CAACiW,UAAU,EAAE,EAAE,CAAC,CAAA;;AAEtC;AACA,EAAA,IAAIG,MAAM,CAACxV,KAAK,CAACuV,OAAO,CAAC,EAAE;AACzBA,IAAAA,OAAO,GAAG,CAAC,CAAA;AACb,GAAA;EAEA,MAAME,MAAM,GAAGrW,QAAQ,CAACkW,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC;AAC5CI,IAAAA,YAAY,GAAGH,OAAO,GAAG,CAAC,IAAI5Q,MAAM,CAACgR,EAAE,CAACJ,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAACE,MAAM,GAAGA,MAAM,CAAA;AACzE,EAAA,OAAOF,OAAO,GAAG,EAAE,GAAGG,YAAY,CAAA;AACpC,CAAA;;AAEA;;AAEO,SAASE,QAAQA,CAAC3W,KAAK,EAAE;AAC9B,EAAA,MAAM4W,YAAY,GAAGL,MAAM,CAACvW,KAAK,CAAC,CAAA;EAClC,IAAI,OAAOA,KAAK,KAAK,SAAS,IAAIA,KAAK,KAAK,EAAE,IAAI,CAACuW,MAAM,CAACM,QAAQ,CAACD,YAAY,CAAC,EAC9E,MAAM,IAAItc,oBAAoB,CAAE,CAAA,mBAAA,EAAqB0F,KAAM,CAAA,CAAC,CAAC,CAAA;AAC/D,EAAA,OAAO4W,YAAY,CAAA;AACrB,CAAA;AAEO,SAASE,eAAeA,CAACvF,GAAG,EAAEwF,UAAU,EAAE;EAC/C,MAAMC,UAAU,GAAG,EAAE,CAAA;AACrB,EAAA,KAAK,MAAMC,CAAC,IAAI1F,GAAG,EAAE;AACnB,IAAA,IAAI0C,cAAc,CAAC1C,GAAG,EAAE0F,CAAC,CAAC,EAAE;AAC1B,MAAA,MAAM5C,CAAC,GAAG9C,GAAG,CAAC0F,CAAC,CAAC,CAAA;AAChB,MAAA,IAAI5C,CAAC,KAAK5V,SAAS,IAAI4V,CAAC,KAAK,IAAI,EAAE,SAAA;MACnC2C,UAAU,CAACD,UAAU,CAACE,CAAC,CAAC,CAAC,GAAGN,QAAQ,CAACtC,CAAC,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;AACA,EAAA,OAAO2C,UAAU,CAAA;AACnB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS9Z,YAAYA,CAACE,MAAM,EAAED,MAAM,EAAE;AAC3C,EAAA,MAAM+Z,KAAK,GAAGjW,IAAI,CAACuU,KAAK,CAACvU,IAAI,CAACC,GAAG,CAAC9D,MAAM,GAAG,EAAE,CAAC,CAAC;AAC7CqJ,IAAAA,OAAO,GAAGxF,IAAI,CAACuU,KAAK,CAACvU,IAAI,CAACC,GAAG,CAAC9D,MAAM,GAAG,EAAE,CAAC,CAAC;AAC3C+Z,IAAAA,IAAI,GAAG/Z,MAAM,IAAI,CAAC,GAAG,GAAG,GAAG,GAAG,CAAA;AAEhC,EAAA,QAAQD,MAAM;AACZ,IAAA,KAAK,OAAO;AACV,MAAA,OAAQ,GAAEga,IAAK,CAAA,EAAElR,QAAQ,CAACiR,KAAK,EAAE,CAAC,CAAE,CAAA,CAAA,EAAGjR,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAE,CAAC,CAAA,CAAA;AAC/D,IAAA,KAAK,QAAQ;AACX,MAAA,OAAQ,CAAE0Q,EAAAA,IAAK,CAAED,EAAAA,KAAM,GAAEzQ,OAAO,GAAG,CAAC,GAAI,CAAGA,CAAAA,EAAAA,OAAQ,CAAC,CAAA,GAAG,EAAG,CAAC,CAAA,CAAA;AAC7D,IAAA,KAAK,QAAQ;AACX,MAAA,OAAQ,GAAE0Q,IAAK,CAAA,EAAElR,QAAQ,CAACiR,KAAK,EAAE,CAAC,CAAE,CAAA,EAAEjR,QAAQ,CAACQ,OAAO,EAAE,CAAC,CAAE,CAAC,CAAA,CAAA;AAC9D,IAAA;AACE,MAAA,MAAM,IAAIiP,UAAU,CAAE,CAAevY,aAAAA,EAAAA,MAAO,sCAAqC,CAAC,CAAA;AACtF,GAAA;AACF,CAAA;AAEO,SAASyT,UAAUA,CAACW,GAAG,EAAE;AAC9B,EAAA,OAAOuC,IAAI,CAACvC,GAAG,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAA;AAC/D;;AClUA;AACA;AACA;;AAEO,MAAM6F,UAAU,GAAG,CACxB,SAAS,EACT,UAAU,EACV,OAAO,EACP,OAAO,EACP,KAAK,EACL,MAAM,EACN,MAAM,EACN,QAAQ,EACR,WAAW,EACX,SAAS,EACT,UAAU,EACV,UAAU,CACX,CAAA;AAEM,MAAMC,WAAW,GAAG,CACzB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,CACN,CAAA;AAEM,MAAMC,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAEjF,SAAS3N,MAAMA,CAAC5J,MAAM,EAAE;AAC7B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAO,CAAC,GAAGuX,YAAY,CAAC,CAAA;AAC1B,IAAA,KAAK,OAAO;MACV,OAAO,CAAC,GAAGD,WAAW,CAAC,CAAA;AACzB,IAAA,KAAK,MAAM;MACT,OAAO,CAAC,GAAGD,UAAU,CAAC,CAAA;AACxB,IAAA,KAAK,SAAS;MACZ,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACxE,IAAA,KAAK,SAAS;MACZ,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACjF,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,MAAMG,YAAY,GAAG,CAC1B,QAAQ,EACR,SAAS,EACT,WAAW,EACX,UAAU,EACV,QAAQ,EACR,UAAU,EACV,QAAQ,CACT,CAAA;AAEM,MAAMC,aAAa,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;AAEvE,MAAMC,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAE1D,SAASxN,QAAQA,CAAClK,MAAM,EAAE;AAC/B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAO,CAAC,GAAG0X,cAAc,CAAC,CAAA;AAC5B,IAAA,KAAK,OAAO;MACV,OAAO,CAAC,GAAGD,aAAa,CAAC,CAAA;AAC3B,IAAA,KAAK,MAAM;MACT,OAAO,CAAC,GAAGD,YAAY,CAAC,CAAA;AAC1B,IAAA,KAAK,SAAS;AACZ,MAAA,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAA;AAC5C,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,MAAMrN,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAE9B,MAAMwN,QAAQ,GAAG,CAAC,eAAe,EAAE,aAAa,CAAC,CAAA;AAEjD,MAAMC,SAAS,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAE9B,MAAMC,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAE7B,SAASzN,IAAIA,CAACpK,MAAM,EAAE;AAC3B,EAAA,QAAQA,MAAM;AACZ,IAAA,KAAK,QAAQ;MACX,OAAO,CAAC,GAAG6X,UAAU,CAAC,CAAA;AACxB,IAAA,KAAK,OAAO;MACV,OAAO,CAAC,GAAGD,SAAS,CAAC,CAAA;AACvB,IAAA,KAAK,MAAM;MACT,OAAO,CAAC,GAAGD,QAAQ,CAAC,CAAA;AACtB,IAAA;AACE,MAAA,OAAO,IAAI,CAAA;AACf,GAAA;AACF,CAAA;AAEO,SAASG,mBAAmBA,CAACtT,EAAE,EAAE;EACtC,OAAO2F,SAAS,CAAC3F,EAAE,CAAClJ,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AACxC,CAAA;AAEO,SAASyc,kBAAkBA,CAACvT,EAAE,EAAExE,MAAM,EAAE;EAC7C,OAAOkK,QAAQ,CAAClK,MAAM,CAAC,CAACwE,EAAE,CAACtJ,OAAO,GAAG,CAAC,CAAC,CAAA;AACzC,CAAA;AAEO,SAAS8c,gBAAgBA,CAACxT,EAAE,EAAExE,MAAM,EAAE;EAC3C,OAAO4J,MAAM,CAAC5J,MAAM,CAAC,CAACwE,EAAE,CAAC1J,KAAK,GAAG,CAAC,CAAC,CAAA;AACrC,CAAA;AAEO,SAASmd,cAAcA,CAACzT,EAAE,EAAExE,MAAM,EAAE;AACzC,EAAA,OAAOoK,IAAI,CAACpK,MAAM,CAAC,CAACwE,EAAE,CAAC3J,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC1C,CAAA;AAEO,SAASqd,kBAAkBA,CAAC5d,IAAI,EAAE+M,KAAK,EAAEE,OAAO,GAAG,QAAQ,EAAE4Q,MAAM,GAAG,KAAK,EAAE;AAClF,EAAA,MAAMC,KAAK,GAAG;AACZC,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBC,IAAAA,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;AAC7B1O,IAAAA,MAAM,EAAE,CAAC,OAAO,EAAE,KAAK,CAAC;AACxB2O,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBC,IAAAA,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC;AAC5BrB,IAAAA,KAAK,EAAE,CAAC,MAAM,EAAE,KAAK,CAAC;AACtBzQ,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC;AAC3B+R,IAAAA,OAAO,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAA;GAC3B,CAAA;AAED,EAAA,MAAMC,QAAQ,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAChV,OAAO,CAACpJ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;AAErE,EAAA,IAAIiN,OAAO,KAAK,MAAM,IAAImR,QAAQ,EAAE;AAClC,IAAA,MAAMC,KAAK,GAAGre,IAAI,KAAK,MAAM,CAAA;AAC7B,IAAA,QAAQ+M,KAAK;AACX,MAAA,KAAK,CAAC;AACJ,QAAA,OAAOsR,KAAK,GAAG,UAAU,GAAI,CAAOP,KAAAA,EAAAA,KAAK,CAAC9d,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAAA,CAAA;AACtD,MAAA,KAAK,CAAC,CAAC;AACL,QAAA,OAAOqe,KAAK,GAAG,WAAW,GAAI,CAAOP,KAAAA,EAAAA,KAAK,CAAC9d,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAAA,CAAA;AACvD,MAAA,KAAK,CAAC;AACJ,QAAA,OAAOqe,KAAK,GAAG,OAAO,GAAI,CAAOP,KAAAA,EAAAA,KAAK,CAAC9d,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAAA,CAAA;AAErD,KAAA;AACF,GAAA;;AAEA,EAAA,MAAMse,QAAQ,GAAGjT,MAAM,CAACgR,EAAE,CAACtP,KAAK,EAAE,CAAC,CAAC,CAAC,IAAIA,KAAK,GAAG,CAAC;AAChDwR,IAAAA,QAAQ,GAAG3X,IAAI,CAACC,GAAG,CAACkG,KAAK,CAAC;IAC1ByR,QAAQ,GAAGD,QAAQ,KAAK,CAAC;AACzBE,IAAAA,QAAQ,GAAGX,KAAK,CAAC9d,IAAI,CAAC;AACtB0e,IAAAA,OAAO,GAAGb,MAAM,GACZW,QAAQ,GACNC,QAAQ,CAAC,CAAC,CAAC,GACXA,QAAQ,CAAC,CAAC,CAAC,IAAIA,QAAQ,CAAC,CAAC,CAAC,GAC5BD,QAAQ,GACRV,KAAK,CAAC9d,IAAI,CAAC,CAAC,CAAC,CAAC,GACdA,IAAI,CAAA;AACV,EAAA,OAAOse,QAAQ,GAAI,CAAEC,EAAAA,QAAS,CAAGG,CAAAA,EAAAA,OAAQ,CAAK,IAAA,CAAA,GAAI,CAAKH,GAAAA,EAAAA,QAAS,CAAGG,CAAAA,EAAAA,OAAQ,CAAC,CAAA,CAAA;AAC9E;;ACjKA,SAASC,eAAeA,CAACC,MAAM,EAAEC,aAAa,EAAE;EAC9C,IAAIze,CAAC,GAAG,EAAE,CAAA;AACV,EAAA,KAAK,MAAM0e,KAAK,IAAIF,MAAM,EAAE;IAC1B,IAAIE,KAAK,CAACC,OAAO,EAAE;MACjB3e,CAAC,IAAI0e,KAAK,CAACE,GAAG,CAAA;AAChB,KAAC,MAAM;AACL5e,MAAAA,CAAC,IAAIye,aAAa,CAACC,KAAK,CAACE,GAAG,CAAC,CAAA;AAC/B,KAAA;AACF,GAAA;AACA,EAAA,OAAO5e,CAAC,CAAA;AACV,CAAA;AAEA,MAAM6e,sBAAsB,GAAG;EAC7BC,CAAC,EAAEC,UAAkB;EACrBC,EAAE,EAAED,QAAgB;EACpBE,GAAG,EAAEF,SAAiB;EACtBG,IAAI,EAAEH,SAAiB;EACvB1K,CAAC,EAAE0K,WAAmB;EACtBI,EAAE,EAAEJ,iBAAyB;EAC7BK,GAAG,EAAEL,sBAA8B;EACnCM,IAAI,EAAEN,qBAA6B;EACnCO,CAAC,EAAEP,cAAsB;EACzBQ,EAAE,EAAER,oBAA4B;EAChCS,GAAG,EAAET,yBAAiC;EACtCU,IAAI,EAAEV,wBAAgC;EACtCnV,CAAC,EAAEmV,cAAsB;EACzBW,EAAE,EAAEX,YAAoB;EACxBY,GAAG,EAAEZ,aAAqB;EAC1Ba,IAAI,EAAEb,aAAqB;EAC3Bc,CAAC,EAAEd,2BAAmC;EACtCe,EAAE,EAAEf,yBAAiC;EACrCgB,GAAG,EAAEhB,0BAAkC;EACvCiB,IAAI,EAAEjB,0BAAQ/c;AAChB,CAAC,CAAA;;AAED;AACA;AACA;;AAEe,MAAMie,SAAS,CAAC;EAC7B,OAAOpa,MAAMA,CAACvC,MAAM,EAAEd,IAAI,GAAG,EAAE,EAAE;AAC/B,IAAA,OAAO,IAAIyd,SAAS,CAAC3c,MAAM,EAAEd,IAAI,CAAC,CAAA;AACpC,GAAA;EAEA,OAAO0d,WAAWA,CAACC,GAAG,EAAE;AACtB;AACA;;IAEA,IAAIC,OAAO,GAAG,IAAI;AAChBC,MAAAA,WAAW,GAAG,EAAE;AAChBC,MAAAA,SAAS,GAAG,KAAK,CAAA;IACnB,MAAM9B,MAAM,GAAG,EAAE,CAAA;AACjB,IAAA,KAAK,IAAInZ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG8a,GAAG,CAAC7a,MAAM,EAAED,CAAC,EAAE,EAAE;AACnC,MAAA,MAAMkb,CAAC,GAAGJ,GAAG,CAACK,MAAM,CAACnb,CAAC,CAAC,CAAA;MACvB,IAAIkb,CAAC,KAAK,GAAG,EAAE;AACb;AACA,QAAA,IAAIF,WAAW,CAAC/a,MAAM,GAAG,CAAC,IAAIgb,SAAS,EAAE;UACvC9B,MAAM,CAACvU,IAAI,CAAC;YACV0U,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;AAC/CzB,YAAAA,GAAG,EAAEyB,WAAW,KAAK,EAAE,GAAG,GAAG,GAAGA,WAAAA;AAClC,WAAC,CAAC,CAAA;AACJ,SAAA;AACAD,QAAAA,OAAO,GAAG,IAAI,CAAA;AACdC,QAAAA,WAAW,GAAG,EAAE,CAAA;QAChBC,SAAS,GAAG,CAACA,SAAS,CAAA;OACvB,MAAM,IAAIA,SAAS,EAAE;AACpBD,QAAAA,WAAW,IAAIE,CAAC,CAAA;AAClB,OAAC,MAAM,IAAIA,CAAC,KAAKH,OAAO,EAAE;AACxBC,QAAAA,WAAW,IAAIE,CAAC,CAAA;AAClB,OAAC,MAAM;AACL,QAAA,IAAIF,WAAW,CAAC/a,MAAM,GAAG,CAAC,EAAE;UAC1BkZ,MAAM,CAACvU,IAAI,CAAC;AAAE0U,YAAAA,OAAO,EAAE,OAAO,CAAC8B,IAAI,CAACJ,WAAW,CAAC;AAAEzB,YAAAA,GAAG,EAAEyB,WAAAA;AAAY,WAAC,CAAC,CAAA;AACvE,SAAA;AACAA,QAAAA,WAAW,GAAGE,CAAC,CAAA;AACfH,QAAAA,OAAO,GAAGG,CAAC,CAAA;AACb,OAAA;AACF,KAAA;AAEA,IAAA,IAAIF,WAAW,CAAC/a,MAAM,GAAG,CAAC,EAAE;MAC1BkZ,MAAM,CAACvU,IAAI,CAAC;QAAE0U,OAAO,EAAE2B,SAAS,IAAI,OAAO,CAACG,IAAI,CAACJ,WAAW,CAAC;AAAEzB,QAAAA,GAAG,EAAEyB,WAAAA;AAAY,OAAC,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,OAAO7B,MAAM,CAAA;AACf,GAAA;EAEA,OAAOK,sBAAsBA,CAACH,KAAK,EAAE;IACnC,OAAOG,sBAAsB,CAACH,KAAK,CAAC,CAAA;AACtC,GAAA;AAEArf,EAAAA,WAAWA,CAACiE,MAAM,EAAEod,UAAU,EAAE;IAC9B,IAAI,CAACle,IAAI,GAAGke,UAAU,CAAA;IACtB,IAAI,CAACtW,GAAG,GAAG9G,MAAM,CAAA;IACjB,IAAI,CAACqd,SAAS,GAAG,IAAI,CAAA;AACvB,GAAA;AAEAC,EAAAA,uBAAuBA,CAAC9W,EAAE,EAAEtH,IAAI,EAAE;AAChC,IAAA,IAAI,IAAI,CAACme,SAAS,KAAK,IAAI,EAAE;MAC3B,IAAI,CAACA,SAAS,GAAG,IAAI,CAACvW,GAAG,CAAC6E,iBAAiB,EAAE,CAAA;AAC/C,KAAA;IACA,MAAMW,EAAE,GAAG,IAAI,CAAC+Q,SAAS,CAACpR,WAAW,CAACzF,EAAE,EAAE;MAAE,GAAG,IAAI,CAACtH,IAAI;MAAE,GAAGA,IAAAA;AAAK,KAAC,CAAC,CAAA;AACpE,IAAA,OAAOoN,EAAE,CAAClN,MAAM,EAAE,CAAA;AACpB,GAAA;AAEA6M,EAAAA,WAAWA,CAACzF,EAAE,EAAEtH,IAAI,GAAG,EAAE,EAAE;AACzB,IAAA,OAAO,IAAI,CAAC4H,GAAG,CAACmF,WAAW,CAACzF,EAAE,EAAE;MAAE,GAAG,IAAI,CAACtH,IAAI;MAAE,GAAGA,IAAAA;AAAK,KAAC,CAAC,CAAA;AAC5D,GAAA;AAEAqe,EAAAA,cAAcA,CAAC/W,EAAE,EAAEtH,IAAI,EAAE;IACvB,OAAO,IAAI,CAAC+M,WAAW,CAACzF,EAAE,EAAEtH,IAAI,CAAC,CAACE,MAAM,EAAE,CAAA;AAC5C,GAAA;AAEAoe,EAAAA,mBAAmBA,CAAChX,EAAE,EAAEtH,IAAI,EAAE;IAC5B,OAAO,IAAI,CAAC+M,WAAW,CAACzF,EAAE,EAAEtH,IAAI,CAAC,CAAC2C,aAAa,EAAE,CAAA;AACnD,GAAA;AAEA4b,EAAAA,cAAcA,CAACC,QAAQ,EAAExe,IAAI,EAAE;IAC7B,MAAMoN,EAAE,GAAG,IAAI,CAACL,WAAW,CAACyR,QAAQ,CAACC,KAAK,EAAEze,IAAI,CAAC,CAAA;IACjD,OAAOoN,EAAE,CAAC9L,GAAG,CAACod,WAAW,CAACF,QAAQ,CAACC,KAAK,CAAC9U,QAAQ,EAAE,EAAE6U,QAAQ,CAACG,GAAG,CAAChV,QAAQ,EAAE,CAAC,CAAA;AAC/E,GAAA;AAEA/I,EAAAA,eAAeA,CAAC0G,EAAE,EAAEtH,IAAI,EAAE;IACxB,OAAO,IAAI,CAAC+M,WAAW,CAACzF,EAAE,EAAEtH,IAAI,CAAC,CAACY,eAAe,EAAE,CAAA;AACrD,GAAA;EAEAge,GAAGA,CAACrhB,CAAC,EAAEshB,CAAC,GAAG,CAAC,EAAEC,WAAW,GAAGtd,SAAS,EAAE;AACrC;AACA,IAAA,IAAI,IAAI,CAACxB,IAAI,CAACqI,WAAW,EAAE;AACzB,MAAA,OAAOW,QAAQ,CAACzL,CAAC,EAAEshB,CAAC,CAAC,CAAA;AACvB,KAAA;AAEA,IAAA,MAAM7e,IAAI,GAAG;AAAE,MAAA,GAAG,IAAI,CAACA,IAAAA;KAAM,CAAA;IAE7B,IAAI6e,CAAC,GAAG,CAAC,EAAE;MACT7e,IAAI,CAACsI,KAAK,GAAGuW,CAAC,CAAA;AAChB,KAAA;AACA,IAAA,IAAIC,WAAW,EAAE;MACf9e,IAAI,CAAC8e,WAAW,GAAGA,WAAW,CAAA;AAChC,KAAA;AAEA,IAAA,OAAO,IAAI,CAAClX,GAAG,CAAC8F,eAAe,CAAC1N,IAAI,CAAC,CAACE,MAAM,CAAC3C,CAAC,CAAC,CAAA;AACjD,GAAA;AAEAwhB,EAAAA,wBAAwBA,CAACzX,EAAE,EAAEqW,GAAG,EAAE;IAChC,MAAMqB,YAAY,GAAG,IAAI,CAACpX,GAAG,CAACI,WAAW,EAAE,KAAK,IAAI;AAClDiX,MAAAA,oBAAoB,GAAG,IAAI,CAACrX,GAAG,CAACX,cAAc,IAAI,IAAI,CAACW,GAAG,CAACX,cAAc,KAAK,SAAS;AACvF4Q,MAAAA,MAAM,GAAGA,CAAC7X,IAAI,EAAE8M,OAAO,KAAK,IAAI,CAAClF,GAAG,CAACkF,OAAO,CAACxF,EAAE,EAAEtH,IAAI,EAAE8M,OAAO,CAAC;MAC/D7M,YAAY,GAAID,IAAI,IAAK;AACvB,QAAA,IAAIsH,EAAE,CAAC4X,aAAa,IAAI5X,EAAE,CAACnH,MAAM,KAAK,CAAC,IAAIH,IAAI,CAACmf,MAAM,EAAE;AACtD,UAAA,OAAO,GAAG,CAAA;AACZ,SAAA;AAEA,QAAA,OAAO7X,EAAE,CAAChH,OAAO,GAAGgH,EAAE,CAAChE,IAAI,CAACrD,YAAY,CAACqH,EAAE,CAACvH,EAAE,EAAEC,IAAI,CAACE,MAAM,CAAC,GAAG,EAAE,CAAA;OAClE;AACDkf,MAAAA,QAAQ,GAAGA,MACTJ,YAAY,GACR5U,mBAA2B,CAAC9C,EAAE,CAAC,GAC/BuQ,MAAM,CAAC;AAAEzZ,QAAAA,IAAI,EAAE,SAAS;AAAEQ,QAAAA,SAAS,EAAE,KAAA;OAAO,EAAE,WAAW,CAAC;MAChEhB,KAAK,GAAGA,CAACkF,MAAM,EAAE+I,UAAU,KACzBmT,YAAY,GACR5U,gBAAwB,CAAC9C,EAAE,EAAExE,MAAM,CAAC,GACpC+U,MAAM,CAAChM,UAAU,GAAG;AAAEjO,QAAAA,KAAK,EAAEkF,MAAAA;AAAO,OAAC,GAAG;AAAElF,QAAAA,KAAK,EAAEkF,MAAM;AAAEjF,QAAAA,GAAG,EAAE,SAAA;OAAW,EAAE,OAAO,CAAC;MACzFG,OAAO,GAAGA,CAAC8E,MAAM,EAAE+I,UAAU,KAC3BmT,YAAY,GACR5U,kBAA0B,CAAC9C,EAAE,EAAExE,MAAM,CAAC,GACtC+U,MAAM,CACJhM,UAAU,GAAG;AAAE7N,QAAAA,OAAO,EAAE8E,MAAAA;AAAO,OAAC,GAAG;AAAE9E,QAAAA,OAAO,EAAE8E,MAAM;AAAElF,QAAAA,KAAK,EAAE,MAAM;AAAEC,QAAAA,GAAG,EAAE,SAAA;OAAW,EACrF,SACF,CAAC;MACPwhB,UAAU,GAAInD,KAAK,IAAK;AACtB,QAAA,MAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAAC,CAAA;AAC1D,QAAA,IAAIgC,UAAU,EAAE;AACd,UAAA,OAAO,IAAI,CAACE,uBAAuB,CAAC9W,EAAE,EAAE4W,UAAU,CAAC,CAAA;AACrD,SAAC,MAAM;AACL,UAAA,OAAOhC,KAAK,CAAA;AACd,SAAA;OACD;AACDxa,MAAAA,GAAG,GAAIoB,MAAM,IACXkc,YAAY,GAAG5U,cAAsB,CAAC9C,EAAE,EAAExE,MAAM,CAAC,GAAG+U,MAAM,CAAC;AAAEnW,QAAAA,GAAG,EAAEoB,MAAAA;OAAQ,EAAE,KAAK,CAAC;MACpFmZ,aAAa,GAAIC,KAAK,IAAK;AACzB;AACA,QAAA,QAAQA,KAAK;AACX;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAAC0C,GAAG,CAACtX,EAAE,CAACjD,WAAW,CAAC,CAAA;AACjC,UAAA,KAAK,GAAG,CAAA;AACR;AACA,UAAA,KAAK,KAAK;YACR,OAAO,IAAI,CAACua,GAAG,CAACtX,EAAE,CAACjD,WAAW,EAAE,CAAC,CAAC,CAAA;AACpC;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACua,GAAG,CAACtX,EAAE,CAAC/I,MAAM,CAAC,CAAA;AAC5B,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACqgB,GAAG,CAACtX,EAAE,CAAC/I,MAAM,EAAE,CAAC,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,IAAI;AACP,YAAA,OAAO,IAAI,CAACqgB,GAAG,CAAC5a,IAAI,CAACuE,KAAK,CAACjB,EAAE,CAACjD,WAAW,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AACrD,UAAA,KAAK,KAAK;AACR,YAAA,OAAO,IAAI,CAACua,GAAG,CAAC5a,IAAI,CAACuE,KAAK,CAACjB,EAAE,CAACjD,WAAW,GAAG,GAAG,CAAC,CAAC,CAAA;AACnD;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACua,GAAG,CAACtX,EAAE,CAACjJ,MAAM,CAAC,CAAA;AAC5B,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACugB,GAAG,CAACtX,EAAE,CAACjJ,MAAM,EAAE,CAAC,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACugB,GAAG,CAACtX,EAAE,CAAClJ,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAGkJ,EAAE,CAAClJ,IAAI,GAAG,EAAE,CAAC,CAAA;AACzD,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACwgB,GAAG,CAACtX,EAAE,CAAClJ,IAAI,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,GAAGkJ,EAAE,CAAClJ,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;AAC5D,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACwgB,GAAG,CAACtX,EAAE,CAAClJ,IAAI,CAAC,CAAA;AAC1B,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACwgB,GAAG,CAACtX,EAAE,CAAClJ,IAAI,EAAE,CAAC,CAAC,CAAA;AAC7B;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO6B,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,QAAQ;AAAEif,cAAAA,MAAM,EAAE,IAAI,CAACnf,IAAI,CAACmf,MAAAA;AAAO,aAAC,CAAC,CAAA;AACrE,UAAA,KAAK,IAAI;AACP;AACA,YAAA,OAAOlf,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,OAAO;AAAEif,cAAAA,MAAM,EAAE,IAAI,CAACnf,IAAI,CAACmf,MAAAA;AAAO,aAAC,CAAC,CAAA;AACpE,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOlf,YAAY,CAAC;AAAEC,cAAAA,MAAM,EAAE,QAAQ;AAAEif,cAAAA,MAAM,EAAE,IAAI,CAACnf,IAAI,CAACmf,MAAAA;AAAO,aAAC,CAAC,CAAA;AACrE,UAAA,KAAK,MAAM;AACT;YACA,OAAO7X,EAAE,CAAChE,IAAI,CAACxD,UAAU,CAACwH,EAAE,CAACvH,EAAE,EAAE;AAAEG,cAAAA,MAAM,EAAE,OAAO;AAAEY,cAAAA,MAAM,EAAE,IAAI,CAAC8G,GAAG,CAAC9G,MAAAA;AAAO,aAAC,CAAC,CAAA;AAChF,UAAA,KAAK,OAAO;AACV;YACA,OAAOwG,EAAE,CAAChE,IAAI,CAACxD,UAAU,CAACwH,EAAE,CAACvH,EAAE,EAAE;AAAEG,cAAAA,MAAM,EAAE,MAAM;AAAEY,cAAAA,MAAM,EAAE,IAAI,CAAC8G,GAAG,CAAC9G,MAAAA;AAAO,aAAC,CAAC,CAAA;AAC/E;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOwG,EAAE,CAACjG,QAAQ,CAAA;AACpB;AACA,UAAA,KAAK,GAAG;YACN,OAAO+d,QAAQ,EAAE,CAAA;AACnB;AACA,UAAA,KAAK,GAAG;YACN,OAAOH,oBAAoB,GAAGpH,MAAM,CAAC;AAAEha,cAAAA,GAAG,EAAE,SAAA;aAAW,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC+gB,GAAG,CAACtX,EAAE,CAACzJ,GAAG,CAAC,CAAA;AACpF,UAAA,KAAK,IAAI;YACP,OAAOohB,oBAAoB,GAAGpH,MAAM,CAAC;AAAEha,cAAAA,GAAG,EAAE,SAAA;AAAU,aAAC,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC+gB,GAAG,CAACtX,EAAE,CAACzJ,GAAG,EAAE,CAAC,CAAC,CAAA;AACvF;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO,IAAI,CAAC+gB,GAAG,CAACtX,EAAE,CAACtJ,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;AAC/B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;AAC9B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AAChC;AACA,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO,IAAI,CAAC4gB,GAAG,CAACtX,EAAE,CAACtJ,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,OAAO,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;AAChC,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC/B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;AACjC;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOihB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEja,cAAAA,KAAK,EAAE,SAAS;AAAEC,cAAAA,GAAG,EAAE,SAAA;aAAW,EAAE,OAAO,CAAC,GACrD,IAAI,CAAC+gB,GAAG,CAACtX,EAAE,CAAC1J,KAAK,CAAC,CAAA;AACxB,UAAA,KAAK,IAAI;AACP;YACA,OAAOqhB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEja,cAAAA,KAAK,EAAE,SAAS;AAAEC,cAAAA,GAAG,EAAE,SAAA;AAAU,aAAC,EAAE,OAAO,CAAC,GACrD,IAAI,CAAC+gB,GAAG,CAACtX,EAAE,CAAC1J,KAAK,EAAE,CAAC,CAAC,CAAA;AAC3B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;AAC7B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;AAC5B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;AAC9B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOqhB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEja,cAAAA,KAAK,EAAE,SAAA;aAAW,EAAE,OAAO,CAAC,GACrC,IAAI,CAACghB,GAAG,CAACtX,EAAE,CAAC1J,KAAK,CAAC,CAAA;AACxB,UAAA,KAAK,IAAI;AACP;YACA,OAAOqhB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEja,cAAAA,KAAK,EAAE,SAAA;AAAU,aAAC,EAAE,OAAO,CAAC,GACrC,IAAI,CAACghB,GAAG,CAACtX,EAAE,CAAC1J,KAAK,EAAE,CAAC,CAAC,CAAA;AAC3B,UAAA,KAAK,KAAK;AACR;AACA,YAAA,OAAOA,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;AAC9B,UAAA,KAAK,MAAM;AACT;AACA,YAAA,OAAOA,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;AAC7B,UAAA,KAAK,OAAO;AACV;AACA,YAAA,OAAOA,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;AAC/B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAOqhB,oBAAoB,GAAGpH,MAAM,CAAC;AAAEla,cAAAA,IAAI,EAAE,SAAA;aAAW,EAAE,MAAM,CAAC,GAAG,IAAI,CAACihB,GAAG,CAACtX,EAAE,CAAC3J,IAAI,CAAC,CAAA;AACvF,UAAA,KAAK,IAAI;AACP;YACA,OAAOshB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEla,cAAAA,IAAI,EAAE,SAAA;aAAW,EAAE,MAAM,CAAC,GACnC,IAAI,CAACihB,GAAG,CAACtX,EAAE,CAAC3J,IAAI,CAACwQ,QAAQ,EAAE,CAACmR,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/C,UAAA,KAAK,MAAM;AACT;YACA,OAAOL,oBAAoB,GACvBpH,MAAM,CAAC;AAAEla,cAAAA,IAAI,EAAE,SAAA;AAAU,aAAC,EAAE,MAAM,CAAC,GACnC,IAAI,CAACihB,GAAG,CAACtX,EAAE,CAAC3J,IAAI,EAAE,CAAC,CAAC,CAAA;AAC1B,UAAA,KAAK,QAAQ;AACX;YACA,OAAOshB,oBAAoB,GACvBpH,MAAM,CAAC;AAAEla,cAAAA,IAAI,EAAE,SAAA;AAAU,aAAC,EAAE,MAAM,CAAC,GACnC,IAAI,CAACihB,GAAG,CAACtX,EAAE,CAAC3J,IAAI,EAAE,CAAC,CAAC,CAAA;AAC1B;AACA,UAAA,KAAK,GAAG;AACN;YACA,OAAO+D,GAAG,CAAC,OAAO,CAAC,CAAA;AACrB,UAAA,KAAK,IAAI;AACP;YACA,OAAOA,GAAG,CAAC,MAAM,CAAC,CAAA;AACpB,UAAA,KAAK,OAAO;YACV,OAAOA,GAAG,CAAC,QAAQ,CAAC,CAAA;AACtB,UAAA,KAAK,IAAI;AACP,YAAA,OAAO,IAAI,CAACkd,GAAG,CAACtX,EAAE,CAACmM,QAAQ,CAACtF,QAAQ,EAAE,CAACmR,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AACtD,UAAA,KAAK,MAAM;YACT,OAAO,IAAI,CAACV,GAAG,CAACtX,EAAE,CAACmM,QAAQ,EAAE,CAAC,CAAC,CAAA;AACjC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACmL,GAAG,CAACtX,EAAE,CAACkM,UAAU,CAAC,CAAA;AAChC,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACoL,GAAG,CAACtX,EAAE,CAACkM,UAAU,EAAE,CAAC,CAAC,CAAA;AACnC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACoL,GAAG,CAACtX,EAAE,CAACmN,eAAe,CAAC,CAAA;AACrC,UAAA,KAAK,IAAI;YACP,OAAO,IAAI,CAACmK,GAAG,CAACtX,EAAE,CAACmN,eAAe,EAAE,CAAC,CAAC,CAAA;AACxC,UAAA,KAAK,IAAI;AACP,YAAA,OAAO,IAAI,CAACmK,GAAG,CAACtX,EAAE,CAACoN,aAAa,CAACvG,QAAQ,EAAE,CAACmR,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAC3D,UAAA,KAAK,MAAM;YACT,OAAO,IAAI,CAACV,GAAG,CAACtX,EAAE,CAACoN,aAAa,EAAE,CAAC,CAAC,CAAA;AACtC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACkK,GAAG,CAACtX,EAAE,CAACwL,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,KAAK;YACR,OAAO,IAAI,CAAC8L,GAAG,CAACtX,EAAE,CAACwL,OAAO,EAAE,CAAC,CAAC,CAAA;AAChC,UAAA,KAAK,GAAG;AACN;AACA,YAAA,OAAO,IAAI,CAAC8L,GAAG,CAACtX,EAAE,CAACiY,OAAO,CAAC,CAAA;AAC7B,UAAA,KAAK,IAAI;AACP;YACA,OAAO,IAAI,CAACX,GAAG,CAACtX,EAAE,CAACiY,OAAO,EAAE,CAAC,CAAC,CAAA;AAChC,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAACX,GAAG,CAAC5a,IAAI,CAACuE,KAAK,CAACjB,EAAE,CAACvH,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;AAC3C,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,IAAI,CAAC6e,GAAG,CAACtX,EAAE,CAACvH,EAAE,CAAC,CAAA;AACxB,UAAA;YACE,OAAOsf,UAAU,CAACnD,KAAK,CAAC,CAAA;AAC5B,SAAA;OACD,CAAA;IAEH,OAAOH,eAAe,CAAC0B,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE1B,aAAa,CAAC,CAAA;AACnE,GAAA;AAEAuD,EAAAA,wBAAwBA,CAACC,GAAG,EAAE9B,GAAG,EAAE;AACjC,IAAA,MAAM+B,aAAa,GAAG,IAAI,CAAC1f,IAAI,CAAC2f,QAAQ,KAAK,qBAAqB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;IAC3E,MAAMC,YAAY,GAAI1D,KAAK,IAAK;QAC5B,QAAQA,KAAK,CAAC,CAAC,CAAC;AACd,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,cAAc,CAAA;AACvB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,SAAS,CAAA;AAClB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,SAAS,CAAA;AAClB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,MAAM,CAAA;AACf,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,QAAQ,CAAA;AACjB,UAAA,KAAK,GAAG;AACN,YAAA,OAAO,OAAO,CAAA;AAChB,UAAA;AACE,YAAA,OAAO,IAAI,CAAA;AACf,SAAA;OACD;AACDD,MAAAA,aAAa,GAAGA,CAAC4D,MAAM,EAAEC,IAAI,KAAM5D,KAAK,IAAK;AAC3C,QAAA,MAAM6D,MAAM,GAAGH,YAAY,CAAC1D,KAAK,CAAC,CAAA;AAClC,QAAA,IAAI6D,MAAM,EAAE;AACV,UAAA,MAAMC,eAAe,GACnBF,IAAI,CAACG,kBAAkB,IAAIF,MAAM,KAAKD,IAAI,CAACI,WAAW,GAAGR,aAAa,GAAG,CAAC,CAAA;AAC5E,UAAA,IAAIZ,WAAW,CAAA;AACf,UAAA,IAAI,IAAI,CAAC9e,IAAI,CAAC2f,QAAQ,KAAK,qBAAqB,IAAII,MAAM,KAAKD,IAAI,CAACI,WAAW,EAAE;AAC/EpB,YAAAA,WAAW,GAAG,OAAO,CAAA;WACtB,MAAM,IAAI,IAAI,CAAC9e,IAAI,CAAC2f,QAAQ,KAAK,KAAK,EAAE;AACvCb,YAAAA,WAAW,GAAG,QAAQ,CAAA;AACxB,WAAC,MAAM;AACL;AACAA,YAAAA,WAAW,GAAG,MAAM,CAAA;AACtB,WAAA;AACA,UAAA,OAAO,IAAI,CAACF,GAAG,CAACiB,MAAM,CAACte,GAAG,CAACwe,MAAM,CAAC,GAAGC,eAAe,EAAE9D,KAAK,CAACpZ,MAAM,EAAEgc,WAAW,CAAC,CAAA;AAClF,SAAC,MAAM;AACL,UAAA,OAAO5C,KAAK,CAAA;AACd,SAAA;OACD;AACDiE,MAAAA,MAAM,GAAG1C,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC;AACnCyC,MAAAA,UAAU,GAAGD,MAAM,CAAC1J,MAAM,CACxB,CAAC4J,KAAK,EAAE;QAAElE,OAAO;AAAEC,QAAAA,GAAAA;AAAI,OAAC,KAAMD,OAAO,GAAGkE,KAAK,GAAGA,KAAK,CAACC,MAAM,CAAClE,GAAG,CAAE,EAClE,EACF,CAAC;AACDmE,MAAAA,SAAS,GAAGd,GAAG,CAACe,OAAO,CAAC,GAAGJ,UAAU,CAAC3W,GAAG,CAACmW,YAAY,CAAC,CAACa,MAAM,CAAE5O,CAAC,IAAKA,CAAC,CAAC,CAAC;AACzE6O,MAAAA,YAAY,GAAG;QACbT,kBAAkB,EAAEM,SAAS,GAAG,CAAC;AACjC;AACA;QACAL,WAAW,EAAEzX,MAAM,CAACC,IAAI,CAAC6X,SAAS,CAACI,MAAM,CAAC,CAAC,CAAC,CAAA;OAC7C,CAAA;IACH,OAAO5E,eAAe,CAACoE,MAAM,EAAElE,aAAa,CAACsE,SAAS,EAAEG,YAAY,CAAC,CAAC,CAAA;AACxE,GAAA;AACF;;ACraA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAME,SAAS,GAAG,8EAA8E,CAAA;AAEhG,SAASC,cAAcA,CAAC,GAAGC,OAAO,EAAE;AAClC,EAAA,MAAMC,IAAI,GAAGD,OAAO,CAACrK,MAAM,CAAC,CAACrP,CAAC,EAAEmH,CAAC,KAAKnH,CAAC,GAAGmH,CAAC,CAACyS,MAAM,EAAE,EAAE,CAAC,CAAA;AACvD,EAAA,OAAOxP,MAAM,CAAE,CAAGuP,CAAAA,EAAAA,IAAK,GAAE,CAAC,CAAA;AAC5B,CAAA;AAEA,SAASE,iBAAiBA,CAAC,GAAGC,UAAU,EAAE;AACxC,EAAA,OAAQ1T,CAAC,IACP0T,UAAU,CACPzK,MAAM,CACL,CAAC,CAAC0K,UAAU,EAAEC,UAAU,EAAEC,MAAM,CAAC,EAAEC,EAAE,KAAK;AACxC,IAAA,MAAM,CAAClF,GAAG,EAAE9Y,IAAI,EAAEqT,IAAI,CAAC,GAAG2K,EAAE,CAAC9T,CAAC,EAAE6T,MAAM,CAAC,CAAA;AACvC,IAAA,OAAO,CAAC;AAAE,MAAA,GAAGF,UAAU;MAAE,GAAG/E,GAAAA;AAAI,KAAC,EAAE9Y,IAAI,IAAI8d,UAAU,EAAEzK,IAAI,CAAC,CAAA;AAC9D,GAAC,EACD,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CACd,CAAC,CACA2I,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAClB,CAAA;AAEA,SAASiC,KAAKA,CAAC/jB,CAAC,EAAE,GAAGgkB,QAAQ,EAAE;EAC7B,IAAIhkB,CAAC,IAAI,IAAI,EAAE;AACb,IAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACrB,GAAA;EAEA,KAAK,MAAM,CAAC+T,KAAK,EAAEkQ,SAAS,CAAC,IAAID,QAAQ,EAAE;AACzC,IAAA,MAAMhU,CAAC,GAAG+D,KAAK,CAACrP,IAAI,CAAC1E,CAAC,CAAC,CAAA;AACvB,IAAA,IAAIgQ,CAAC,EAAE;MACL,OAAOiU,SAAS,CAACjU,CAAC,CAAC,CAAA;AACrB,KAAA;AACF,GAAA;AACA,EAAA,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACrB,CAAA;AAEA,SAASkU,WAAWA,CAAC,GAAGhZ,IAAI,EAAE;AAC5B,EAAA,OAAO,CAAC8F,KAAK,EAAE6S,MAAM,KAAK;IACxB,MAAMM,GAAG,GAAG,EAAE,CAAA;AACd,IAAA,IAAI9e,CAAC,CAAA;AAEL,IAAA,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG6F,IAAI,CAAC5F,MAAM,EAAED,CAAC,EAAE,EAAE;AAChC8e,MAAAA,GAAG,CAACjZ,IAAI,CAAC7F,CAAC,CAAC,CAAC,GAAG+U,YAAY,CAACpJ,KAAK,CAAC6S,MAAM,GAAGxe,CAAC,CAAC,CAAC,CAAA;AAChD,KAAA;IACA,OAAO,CAAC8e,GAAG,EAAE,IAAI,EAAEN,MAAM,GAAGxe,CAAC,CAAC,CAAA;GAC/B,CAAA;AACH,CAAA;;AAEA;AACA,MAAM+e,WAAW,GAAG,oCAAoC,CAAA;AACxD,MAAMC,eAAe,GAAI,CAAA,GAAA,EAAKD,WAAW,CAACZ,MAAO,CAAUJ,QAAAA,EAAAA,SAAS,CAACI,MAAO,CAAS,QAAA,CAAA,CAAA;AACrF,MAAMc,gBAAgB,GAAG,qDAAqD,CAAA;AAC9E,MAAMC,YAAY,GAAGvQ,MAAM,CAAE,CAAA,EAAEsQ,gBAAgB,CAACd,MAAO,CAAA,EAAEa,eAAgB,CAAA,CAAC,CAAC,CAAA;AAC3E,MAAMG,qBAAqB,GAAGxQ,MAAM,CAAE,UAASuQ,YAAY,CAACf,MAAO,CAAA,EAAA,CAAG,CAAC,CAAA;AACvE,MAAMiB,WAAW,GAAG,6CAA6C,CAAA;AACjE,MAAMC,YAAY,GAAG,6BAA6B,CAAA;AAClD,MAAMC,eAAe,GAAG,kBAAkB,CAAA;AAC1C,MAAMC,kBAAkB,GAAGV,WAAW,CAAC,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAA;AAC3E,MAAMW,qBAAqB,GAAGX,WAAW,CAAC,MAAM,EAAE,SAAS,CAAC,CAAA;AAC5D,MAAMY,WAAW,GAAG,uBAAuB,CAAC;AAC5C,MAAMC,YAAY,GAAG/Q,MAAM,CACxB,CAAA,EAAEsQ,gBAAgB,CAACd,MAAO,CAAOY,KAAAA,EAAAA,WAAW,CAACZ,MAAO,CAAA,EAAA,EAAIJ,SAAS,CAACI,MAAO,KAC5E,CAAC,CAAA;AACD,MAAMwB,qBAAqB,GAAGhR,MAAM,CAAE,OAAM+Q,YAAY,CAACvB,MAAO,CAAA,EAAA,CAAG,CAAC,CAAA;AAEpE,SAASyB,GAAGA,CAACjU,KAAK,EAAExL,GAAG,EAAE0f,QAAQ,EAAE;AACjC,EAAA,MAAMlV,CAAC,GAAGgB,KAAK,CAACxL,GAAG,CAAC,CAAA;EACpB,OAAOC,WAAW,CAACuK,CAAC,CAAC,GAAGkV,QAAQ,GAAG9K,YAAY,CAACpK,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,SAASmV,aAAaA,CAACnU,KAAK,EAAE6S,MAAM,EAAE;AACpC,EAAA,MAAMuB,IAAI,GAAG;AACXjlB,IAAAA,IAAI,EAAE8kB,GAAG,CAACjU,KAAK,EAAE6S,MAAM,CAAC;IACxBzjB,KAAK,EAAE6kB,GAAG,CAACjU,KAAK,EAAE6S,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAChCxjB,GAAG,EAAE4kB,GAAG,CAACjU,KAAK,EAAE6S,MAAM,GAAG,CAAC,EAAE,CAAC,CAAA;GAC9B,CAAA;EAED,OAAO,CAACuB,IAAI,EAAE,IAAI,EAAEvB,MAAM,GAAG,CAAC,CAAC,CAAA;AACjC,CAAA;AAEA,SAASwB,cAAcA,CAACrU,KAAK,EAAE6S,MAAM,EAAE;AACrC,EAAA,MAAMuB,IAAI,GAAG;IACX3I,KAAK,EAAEwI,GAAG,CAACjU,KAAK,EAAE6S,MAAM,EAAE,CAAC,CAAC;IAC5B7X,OAAO,EAAEiZ,GAAG,CAACjU,KAAK,EAAE6S,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAClC9F,OAAO,EAAEkH,GAAG,CAACjU,KAAK,EAAE6S,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;IAClCyB,YAAY,EAAE9K,WAAW,CAACxJ,KAAK,CAAC6S,MAAM,GAAG,CAAC,CAAC,CAAA;GAC5C,CAAA;EAED,OAAO,CAACuB,IAAI,EAAE,IAAI,EAAEvB,MAAM,GAAG,CAAC,CAAC,CAAA;AACjC,CAAA;AAEA,SAAS0B,gBAAgBA,CAACvU,KAAK,EAAE6S,MAAM,EAAE;AACvC,EAAA,MAAM2B,KAAK,GAAG,CAACxU,KAAK,CAAC6S,MAAM,CAAC,IAAI,CAAC7S,KAAK,CAAC6S,MAAM,GAAG,CAAC,CAAC;AAChD4B,IAAAA,UAAU,GAAGxU,YAAY,CAACD,KAAK,CAAC6S,MAAM,GAAG,CAAC,CAAC,EAAE7S,KAAK,CAAC6S,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/D/d,IAAI,GAAG0f,KAAK,GAAG,IAAI,GAAG5U,eAAe,CAAC3N,QAAQ,CAACwiB,UAAU,CAAC,CAAA;EAC5D,OAAO,CAAC,EAAE,EAAE3f,IAAI,EAAE+d,MAAM,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAA;AAEA,SAAS6B,eAAeA,CAAC1U,KAAK,EAAE6S,MAAM,EAAE;AACtC,EAAA,MAAM/d,IAAI,GAAGkL,KAAK,CAAC6S,MAAM,CAAC,GAAGje,QAAQ,CAACC,MAAM,CAACmL,KAAK,CAAC6S,MAAM,CAAC,CAAC,GAAG,IAAI,CAAA;EAClE,OAAO,CAAC,EAAE,EAAE/d,IAAI,EAAE+d,MAAM,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAA;;AAEA;;AAEA,MAAM8B,WAAW,GAAG3R,MAAM,CAAE,MAAKsQ,gBAAgB,CAACd,MAAO,CAAA,CAAA,CAAE,CAAC,CAAA;;AAE5D;;AAEA,MAAMoC,WAAW,GACf,8PAA8P,CAAA;AAEhQ,SAASC,kBAAkBA,CAAC7U,KAAK,EAAE;EACjC,MAAM,CAAChR,CAAC,EAAE8lB,OAAO,EAAEC,QAAQ,EAAEC,OAAO,EAAEC,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAEC,eAAe,CAAC,GAC3FrV,KAAK,CAAA;AAEP,EAAA,MAAMsV,iBAAiB,GAAGtmB,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;EACtC,MAAMumB,eAAe,GAAGH,SAAS,IAAIA,SAAS,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;EAEzD,MAAMI,WAAW,GAAGA,CAACpF,GAAG,EAAEqF,KAAK,GAAG,KAAK,KACrCrF,GAAG,KAAKpd,SAAS,KAAKyiB,KAAK,IAAKrF,GAAG,IAAIkF,iBAAkB,CAAC,GAAG,CAAClF,GAAG,GAAGA,GAAG,CAAA;AAEzE,EAAA,OAAO,CACL;AACEzD,IAAAA,KAAK,EAAE6I,WAAW,CAAClM,aAAa,CAACwL,OAAO,CAAC,CAAC;AAC1C5W,IAAAA,MAAM,EAAEsX,WAAW,CAAClM,aAAa,CAACyL,QAAQ,CAAC,CAAC;AAC5ClI,IAAAA,KAAK,EAAE2I,WAAW,CAAClM,aAAa,CAAC0L,OAAO,CAAC,CAAC;AAC1ClI,IAAAA,IAAI,EAAE0I,WAAW,CAAClM,aAAa,CAAC2L,MAAM,CAAC,CAAC;AACxCxJ,IAAAA,KAAK,EAAE+J,WAAW,CAAClM,aAAa,CAAC4L,OAAO,CAAC,CAAC;AAC1Cla,IAAAA,OAAO,EAAEwa,WAAW,CAAClM,aAAa,CAAC6L,SAAS,CAAC,CAAC;IAC9CpI,OAAO,EAAEyI,WAAW,CAAClM,aAAa,CAAC8L,SAAS,CAAC,EAAEA,SAAS,KAAK,IAAI,CAAC;IAClEd,YAAY,EAAEkB,WAAW,CAAChM,WAAW,CAAC6L,eAAe,CAAC,EAAEE,eAAe,CAAA;AACzE,GAAC,CACF,CAAA;AACH,CAAA;;AAEA;AACA;AACA;AACA,MAAMG,UAAU,GAAG;AACjBC,EAAAA,GAAG,EAAE,CAAC;AACNC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;AACZC,EAAAA,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE;EACZC,GAAG,EAAE,CAAC,CAAC,GAAG,EAAA;AACZ,CAAC,CAAA;AAED,SAASC,WAAWA,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAE;AACzF,EAAA,MAAMkB,MAAM,GAAG;AACbnnB,IAAAA,IAAI,EAAE2lB,OAAO,CAACxgB,MAAM,KAAK,CAAC,GAAGkW,cAAc,CAACpB,YAAY,CAAC0L,OAAO,CAAC,CAAC,GAAG1L,YAAY,CAAC0L,OAAO,CAAC;IAC1F1lB,KAAK,EAAEwM,WAAmB,CAAC5D,OAAO,CAAC+c,QAAQ,CAAC,GAAG,CAAC;AAChD1lB,IAAAA,GAAG,EAAE+Z,YAAY,CAAC6L,MAAM,CAAC;AACzBrlB,IAAAA,IAAI,EAAEwZ,YAAY,CAAC8L,OAAO,CAAC;IAC3BrlB,MAAM,EAAEuZ,YAAY,CAAC+L,SAAS,CAAA;GAC/B,CAAA;EAED,IAAIC,SAAS,EAAEkB,MAAM,CAACvmB,MAAM,GAAGqZ,YAAY,CAACgM,SAAS,CAAC,CAAA;AACtD,EAAA,IAAIiB,UAAU,EAAE;AACdC,IAAAA,MAAM,CAAC9mB,OAAO,GACZ6mB,UAAU,CAAC/hB,MAAM,GAAG,CAAC,GACjBsH,YAAoB,CAAC5D,OAAO,CAACqe,UAAU,CAAC,GAAG,CAAC,GAC5Cza,aAAqB,CAAC5D,OAAO,CAACqe,UAAU,CAAC,GAAG,CAAC,CAAA;AACrD,GAAA;AAEA,EAAA,OAAOC,MAAM,CAAA;AACf,CAAA;;AAEA;AACA,MAAMC,OAAO,GACX,iMAAiM,CAAA;AAEnM,SAASC,cAAcA,CAACxW,KAAK,EAAE;EAC7B,MAAM,GAEFqW,UAAU,EACVpB,MAAM,EACNF,QAAQ,EACRD,OAAO,EACPI,OAAO,EACPC,SAAS,EACTC,SAAS,EACTqB,SAAS,EACTC,SAAS,EACT/L,UAAU,EACVC,YAAY,CACb,GAAG5K,KAAK;AACTsW,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAE5F,EAAA,IAAIzjB,MAAM,CAAA;AACV,EAAA,IAAI8kB,SAAS,EAAE;AACb9kB,IAAAA,MAAM,GAAG+jB,UAAU,CAACe,SAAS,CAAC,CAAA;GAC/B,MAAM,IAAIC,SAAS,EAAE;AACpB/kB,IAAAA,MAAM,GAAG,CAAC,CAAA;AACZ,GAAC,MAAM;AACLA,IAAAA,MAAM,GAAGsO,YAAY,CAAC0K,UAAU,EAAEC,YAAY,CAAC,CAAA;AACjD,GAAA;EAEA,OAAO,CAAC0L,MAAM,EAAE,IAAI1W,eAAe,CAACjO,MAAM,CAAC,CAAC,CAAA;AAC9C,CAAA;AAEA,SAASglB,iBAAiBA,CAAC3nB,CAAC,EAAE;AAC5B;AACA,EAAA,OAAOA,CAAC,CACLwE,OAAO,CAAC,oBAAoB,EAAE,GAAG,CAAC,CAClCA,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CACxBojB,IAAI,EAAE,CAAA;AACX,CAAA;;AAEA;;AAEA,MAAMC,OAAO,GACT,4HAA4H;AAC9HC,EAAAA,MAAM,GACJ,wJAAwJ;AAC1JC,EAAAA,KAAK,GACH,2HAA2H,CAAA;AAE/H,SAASC,mBAAmBA,CAAChX,KAAK,EAAE;AAClC,EAAA,MAAM,GAAGqW,UAAU,EAAEpB,MAAM,EAAEF,QAAQ,EAAED,OAAO,EAAEI,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,GAAGpV,KAAK;AACpFsW,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE1W,eAAe,CAACC,WAAW,CAAC,CAAA;AAC9C,CAAA;AAEA,SAASoX,YAAYA,CAACjX,KAAK,EAAE;AAC3B,EAAA,MAAM,GAAGqW,UAAU,EAAEtB,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,EAAEN,OAAO,CAAC,GAAG9U,KAAK;AACpFsW,IAAAA,MAAM,GAAGF,WAAW,CAACC,UAAU,EAAEvB,OAAO,EAAEC,QAAQ,EAAEE,MAAM,EAAEC,OAAO,EAAEC,SAAS,EAAEC,SAAS,CAAC,CAAA;AAC5F,EAAA,OAAO,CAACkB,MAAM,EAAE1W,eAAe,CAACC,WAAW,CAAC,CAAA;AAC9C,CAAA;AAEA,MAAMqX,4BAA4B,GAAG7E,cAAc,CAACoB,WAAW,EAAED,qBAAqB,CAAC,CAAA;AACvF,MAAM2D,6BAA6B,GAAG9E,cAAc,CAACqB,YAAY,EAAEF,qBAAqB,CAAC,CAAA;AACzF,MAAM4D,gCAAgC,GAAG/E,cAAc,CAACsB,eAAe,EAAEH,qBAAqB,CAAC,CAAA;AAC/F,MAAM6D,oBAAoB,GAAGhF,cAAc,CAACkB,YAAY,CAAC,CAAA;AAEzD,MAAM+D,0BAA0B,GAAG7E,iBAAiB,CAClD0B,aAAa,EACbE,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,MAAM6C,2BAA2B,GAAG9E,iBAAiB,CACnDmB,kBAAkB,EAClBS,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,MAAM8C,4BAA4B,GAAG/E,iBAAiB,CACpDoB,qBAAqB,EACrBQ,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AACD,MAAM+C,uBAAuB,GAAGhF,iBAAiB,CAC/C4B,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;;AAED;AACA;AACA;;AAEO,SAASgD,YAAYA,CAAC1oB,CAAC,EAAE;EAC9B,OAAO+jB,KAAK,CACV/jB,CAAC,EACD,CAACkoB,4BAA4B,EAAEI,0BAA0B,CAAC,EAC1D,CAACH,6BAA6B,EAAEI,2BAA2B,CAAC,EAC5D,CAACH,gCAAgC,EAAEI,4BAA4B,CAAC,EAChE,CAACH,oBAAoB,EAAEI,uBAAuB,CAChD,CAAC,CAAA;AACH,CAAA;AAEO,SAASE,gBAAgBA,CAAC3oB,CAAC,EAAE;AAClC,EAAA,OAAO+jB,KAAK,CAAC4D,iBAAiB,CAAC3nB,CAAC,CAAC,EAAE,CAACunB,OAAO,EAAEC,cAAc,CAAC,CAAC,CAAA;AAC/D,CAAA;AAEO,SAASoB,aAAaA,CAAC5oB,CAAC,EAAE;EAC/B,OAAO+jB,KAAK,CACV/jB,CAAC,EACD,CAAC6nB,OAAO,EAAEG,mBAAmB,CAAC,EAC9B,CAACF,MAAM,EAAEE,mBAAmB,CAAC,EAC7B,CAACD,KAAK,EAAEE,YAAY,CACtB,CAAC,CAAA;AACH,CAAA;AAEO,SAASY,gBAAgBA,CAAC7oB,CAAC,EAAE;EAClC,OAAO+jB,KAAK,CAAC/jB,CAAC,EAAE,CAAC4lB,WAAW,EAAEC,kBAAkB,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,MAAMiD,kBAAkB,GAAGrF,iBAAiB,CAAC4B,cAAc,CAAC,CAAA;AAErD,SAAS0D,gBAAgBA,CAAC/oB,CAAC,EAAE;EAClC,OAAO+jB,KAAK,CAAC/jB,CAAC,EAAE,CAAC2lB,WAAW,EAAEmD,kBAAkB,CAAC,CAAC,CAAA;AACpD,CAAA;AAEA,MAAME,4BAA4B,GAAG3F,cAAc,CAACyB,WAAW,EAAEE,qBAAqB,CAAC,CAAA;AACvF,MAAMiE,oBAAoB,GAAG5F,cAAc,CAAC0B,YAAY,CAAC,CAAA;AAEzD,MAAMmE,+BAA+B,GAAGzF,iBAAiB,CACvD4B,cAAc,EACdE,gBAAgB,EAChBG,eACF,CAAC,CAAA;AAEM,SAASyD,QAAQA,CAACnpB,CAAC,EAAE;AAC1B,EAAA,OAAO+jB,KAAK,CACV/jB,CAAC,EACD,CAACgpB,4BAA4B,EAAEV,0BAA0B,CAAC,EAC1D,CAACW,oBAAoB,EAAEC,+BAA+B,CACxD,CAAC,CAAA;AACH;;AC9TA,MAAME,SAAO,GAAG,kBAAkB,CAAA;;AAElC;AACO,MAAMC,cAAc,GAAG;AAC1BxL,IAAAA,KAAK,EAAE;AACLC,MAAAA,IAAI,EAAE,CAAC;MACPrB,KAAK,EAAE,CAAC,GAAG,EAAE;AACbzQ,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE;AACpB+R,MAAAA,OAAO,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MACzBuH,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KAClC;AACDxH,IAAAA,IAAI,EAAE;AACJrB,MAAAA,KAAK,EAAE,EAAE;MACTzQ,OAAO,EAAE,EAAE,GAAG,EAAE;AAChB+R,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrBuH,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KAC9B;AACD7I,IAAAA,KAAK,EAAE;AAAEzQ,MAAAA,OAAO,EAAE,EAAE;MAAE+R,OAAO,EAAE,EAAE,GAAG,EAAE;AAAEuH,MAAAA,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,IAAA;KAAM;AACtEtZ,IAAAA,OAAO,EAAE;AAAE+R,MAAAA,OAAO,EAAE,EAAE;MAAEuH,YAAY,EAAE,EAAE,GAAG,IAAA;KAAM;AACjDvH,IAAAA,OAAO,EAAE;AAAEuH,MAAAA,YAAY,EAAE,IAAA;AAAK,KAAA;GAC/B;AACDgE,EAAAA,YAAY,GAAG;AACb3L,IAAAA,KAAK,EAAE;AACLC,MAAAA,QAAQ,EAAE,CAAC;AACX1O,MAAAA,MAAM,EAAE,EAAE;AACV2O,MAAAA,KAAK,EAAE,EAAE;AACTC,MAAAA,IAAI,EAAE,GAAG;MACTrB,KAAK,EAAE,GAAG,GAAG,EAAE;AACfzQ,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE;AACtB+R,MAAAA,OAAO,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC3BuH,YAAY,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACpC;AACD1H,IAAAA,QAAQ,EAAE;AACR1O,MAAAA,MAAM,EAAE,CAAC;AACT2O,MAAAA,KAAK,EAAE,EAAE;AACTC,MAAAA,IAAI,EAAE,EAAE;MACRrB,KAAK,EAAE,EAAE,GAAG,EAAE;AACdzQ,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrB+R,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1BuH,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACnC;AACDpW,IAAAA,MAAM,EAAE;AACN2O,MAAAA,KAAK,EAAE,CAAC;AACRC,MAAAA,IAAI,EAAE,EAAE;MACRrB,KAAK,EAAE,EAAE,GAAG,EAAE;AACdzQ,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AACrB+R,MAAAA,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1BuH,YAAY,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACnC;IAED,GAAG+D,cAAAA;GACJ;EACDE,kBAAkB,GAAG,QAAQ,GAAG,GAAG;EACnCC,mBAAmB,GAAG,QAAQ,GAAG,IAAI;AACrCC,EAAAA,cAAc,GAAG;AACf9L,IAAAA,KAAK,EAAE;AACLC,MAAAA,QAAQ,EAAE,CAAC;AACX1O,MAAAA,MAAM,EAAE,EAAE;MACV2O,KAAK,EAAE0L,kBAAkB,GAAG,CAAC;AAC7BzL,MAAAA,IAAI,EAAEyL,kBAAkB;MACxB9M,KAAK,EAAE8M,kBAAkB,GAAG,EAAE;AAC9Bvd,MAAAA,OAAO,EAAEud,kBAAkB,GAAG,EAAE,GAAG,EAAE;AACrCxL,MAAAA,OAAO,EAAEwL,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC1CjE,YAAY,EAAEiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACnD;AACD3L,IAAAA,QAAQ,EAAE;AACR1O,MAAAA,MAAM,EAAE,CAAC;MACT2O,KAAK,EAAE0L,kBAAkB,GAAG,EAAE;MAC9BzL,IAAI,EAAEyL,kBAAkB,GAAG,CAAC;AAC5B9M,MAAAA,KAAK,EAAG8M,kBAAkB,GAAG,EAAE,GAAI,CAAC;AACpCvd,MAAAA,OAAO,EAAGud,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;MAC3CxL,OAAO,EAAGwL,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAI,CAAC;MAChDjE,YAAY,EAAGiE,kBAAkB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,GAAI,CAAA;KAC5D;AACDra,IAAAA,MAAM,EAAE;MACN2O,KAAK,EAAE2L,mBAAmB,GAAG,CAAC;AAC9B1L,MAAAA,IAAI,EAAE0L,mBAAmB;MACzB/M,KAAK,EAAE+M,mBAAmB,GAAG,EAAE;AAC/Bxd,MAAAA,OAAO,EAAEwd,mBAAmB,GAAG,EAAE,GAAG,EAAE;AACtCzL,MAAAA,OAAO,EAAEyL,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;MAC3ClE,YAAY,EAAEkE,mBAAmB,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA;KACpD;IACD,GAAGH,cAAAA;GACJ,CAAA;;AAEH;AACA,MAAMK,cAAY,GAAG,CACnB,OAAO,EACP,UAAU,EACV,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cAAc,CACf,CAAA;AAED,MAAMC,YAAY,GAAGD,cAAY,CAAC5H,KAAK,CAAC,CAAC,CAAC,CAAC8H,OAAO,EAAE,CAAA;;AAEpD;AACA,SAAS/a,OAAKA,CAACoT,GAAG,EAAEnT,IAAI,EAAE9I,KAAK,GAAG,KAAK,EAAE;AACvC;AACA,EAAA,MAAM6jB,IAAI,GAAG;AACX1G,IAAAA,MAAM,EAAEnd,KAAK,GAAG8I,IAAI,CAACqU,MAAM,GAAG;MAAE,GAAGlB,GAAG,CAACkB,MAAM;AAAE,MAAA,IAAIrU,IAAI,CAACqU,MAAM,IAAI,EAAE,CAAA;KAAG;IACvE/Y,GAAG,EAAE6X,GAAG,CAAC7X,GAAG,CAACyE,KAAK,CAACC,IAAI,CAAC1E,GAAG,CAAC;AAC5B0f,IAAAA,kBAAkB,EAAEhb,IAAI,CAACgb,kBAAkB,IAAI7H,GAAG,CAAC6H,kBAAkB;AACrEC,IAAAA,MAAM,EAAEjb,IAAI,CAACib,MAAM,IAAI9H,GAAG,CAAC8H,MAAAA;GAC5B,CAAA;AACD,EAAA,OAAO,IAAIC,QAAQ,CAACH,IAAI,CAAC,CAAA;AAC3B,CAAA;AAEA,SAASI,gBAAgBA,CAACF,MAAM,EAAEG,IAAI,EAAE;AAAA,EAAA,IAAAC,kBAAA,CAAA;EACtC,IAAIC,GAAG,GAAAD,CAAAA,kBAAA,GAAGD,IAAI,CAAC5E,YAAY,KAAA,IAAA,GAAA6E,kBAAA,GAAI,CAAC,CAAA;EAChC,KAAK,MAAMvqB,IAAI,IAAI+pB,YAAY,CAAC7H,KAAK,CAAC,CAAC,CAAC,EAAE;AACxC,IAAA,IAAIoI,IAAI,CAACtqB,IAAI,CAAC,EAAE;AACdwqB,MAAAA,GAAG,IAAIF,IAAI,CAACtqB,IAAI,CAAC,GAAGmqB,MAAM,CAACnqB,IAAI,CAAC,CAAC,cAAc,CAAC,CAAA;AAClD,KAAA;AACF,GAAA;AACA,EAAA,OAAOwqB,GAAG,CAAA;AACZ,CAAA;;AAEA;AACA,SAASC,eAAeA,CAACN,MAAM,EAAEG,IAAI,EAAE;AACrC;AACA;AACA,EAAA,MAAMrP,MAAM,GAAGoP,gBAAgB,CAACF,MAAM,EAAEG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AAE1DR,EAAAA,cAAY,CAACY,WAAW,CAAC,CAACC,QAAQ,EAAEnK,OAAO,KAAK;IAC9C,IAAI,CAAC3a,WAAW,CAACykB,IAAI,CAAC9J,OAAO,CAAC,CAAC,EAAE;AAC/B,MAAA,IAAImK,QAAQ,EAAE;AACZ,QAAA,MAAMC,WAAW,GAAGN,IAAI,CAACK,QAAQ,CAAC,GAAG1P,MAAM,CAAA;QAC3C,MAAM4P,IAAI,GAAGV,MAAM,CAAC3J,OAAO,CAAC,CAACmK,QAAQ,CAAC,CAAA;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;QACA,MAAMG,MAAM,GAAGlkB,IAAI,CAACuE,KAAK,CAACyf,WAAW,GAAGC,IAAI,CAAC,CAAA;AAC7CP,QAAAA,IAAI,CAAC9J,OAAO,CAAC,IAAIsK,MAAM,GAAG7P,MAAM,CAAA;QAChCqP,IAAI,CAACK,QAAQ,CAAC,IAAIG,MAAM,GAAGD,IAAI,GAAG5P,MAAM,CAAA;AAC1C,OAAA;AACA,MAAA,OAAOuF,OAAO,CAAA;AAChB,KAAC,MAAM;AACL,MAAA,OAAOmK,QAAQ,CAAA;AACjB,KAAA;GACD,EAAE,IAAI,CAAC,CAAA;;AAER;AACA;AACAb,EAAAA,cAAY,CAACzQ,MAAM,CAAC,CAACsR,QAAQ,EAAEnK,OAAO,KAAK;IACzC,IAAI,CAAC3a,WAAW,CAACykB,IAAI,CAAC9J,OAAO,CAAC,CAAC,EAAE;AAC/B,MAAA,IAAImK,QAAQ,EAAE;AACZ,QAAA,MAAM9P,QAAQ,GAAGyP,IAAI,CAACK,QAAQ,CAAC,GAAG,CAAC,CAAA;AACnCL,QAAAA,IAAI,CAACK,QAAQ,CAAC,IAAI9P,QAAQ,CAAA;AAC1ByP,QAAAA,IAAI,CAAC9J,OAAO,CAAC,IAAI3F,QAAQ,GAAGsP,MAAM,CAACQ,QAAQ,CAAC,CAACnK,OAAO,CAAC,CAAA;AACvD,OAAA;AACA,MAAA,OAAOA,OAAO,CAAA;AAChB,KAAC,MAAM;AACL,MAAA,OAAOmK,QAAQ,CAAA;AACjB,KAAA;GACD,EAAE,IAAI,CAAC,CAAA;AACV,CAAA;;AAEA;AACA,SAASI,YAAYA,CAACT,IAAI,EAAE;EAC1B,MAAMU,OAAO,GAAG,EAAE,CAAA;AAClB,EAAA,KAAK,MAAM,CAACzjB,GAAG,EAAE5B,KAAK,CAAC,IAAI0F,MAAM,CAAC4f,OAAO,CAACX,IAAI,CAAC,EAAE;IAC/C,IAAI3kB,KAAK,KAAK,CAAC,EAAE;AACfqlB,MAAAA,OAAO,CAACzjB,GAAG,CAAC,GAAG5B,KAAK,CAAA;AACtB,KAAA;AACF,GAAA;AACA,EAAA,OAAOqlB,OAAO,CAAA;AAChB,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAMZ,QAAQ,CAAC;AAC5B;AACF;AACA;EACE3qB,WAAWA,CAACyrB,MAAM,EAAE;IAClB,MAAMC,QAAQ,GAAGD,MAAM,CAAChB,kBAAkB,KAAK,UAAU,IAAI,KAAK,CAAA;AAClE,IAAA,IAAIC,MAAM,GAAGgB,QAAQ,GAAGtB,cAAc,GAAGH,YAAY,CAAA;IAErD,IAAIwB,MAAM,CAACf,MAAM,EAAE;MACjBA,MAAM,GAAGe,MAAM,CAACf,MAAM,CAAA;AACxB,KAAA;;AAEA;AACJ;AACA;AACI,IAAA,IAAI,CAAC5G,MAAM,GAAG2H,MAAM,CAAC3H,MAAM,CAAA;AAC3B;AACJ;AACA;IACI,IAAI,CAAC/Y,GAAG,GAAG0gB,MAAM,CAAC1gB,GAAG,IAAI3B,MAAM,CAAC5C,MAAM,EAAE,CAAA;AACxC;AACJ;AACA;AACI,IAAA,IAAI,CAACikB,kBAAkB,GAAGiB,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAA;AAC1D;AACJ;AACA;AACI,IAAA,IAAI,CAACC,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;AACrC;AACJ;AACA;IACI,IAAI,CAACjB,MAAM,GAAGA,MAAM,CAAA;AACpB;AACJ;AACA;IACI,IAAI,CAACkB,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOC,UAAUA,CAACve,KAAK,EAAEnK,IAAI,EAAE;IAC7B,OAAOwnB,QAAQ,CAACjc,UAAU,CAAC;AAAEuX,MAAAA,YAAY,EAAE3Y,KAAAA;KAAO,EAAEnK,IAAI,CAAC,CAAA;AAC3D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOuL,UAAUA,CAAC+I,GAAG,EAAEtU,IAAI,GAAG,EAAE,EAAE;IAChC,IAAIsU,GAAG,IAAI,IAAI,IAAI,OAAOA,GAAG,KAAK,QAAQ,EAAE;AAC1C,MAAA,MAAM,IAAIjX,oBAAoB,CAC3B,CAAA,4DAAA,EACCiX,GAAG,KAAK,IAAI,GAAG,MAAM,GAAG,OAAOA,GAChC,EACH,CAAC,CAAA;AACH,KAAA;IAEA,OAAO,IAAIkT,QAAQ,CAAC;MAClB7G,MAAM,EAAE9G,eAAe,CAACvF,GAAG,EAAEkT,QAAQ,CAACmB,aAAa,CAAC;AACpD/gB,MAAAA,GAAG,EAAE3B,MAAM,CAACsF,UAAU,CAACvL,IAAI,CAAC;MAC5BsnB,kBAAkB,EAAEtnB,IAAI,CAACsnB,kBAAkB;MAC3CC,MAAM,EAAEvnB,IAAI,CAACunB,MAAAA;AACf,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOqB,gBAAgBA,CAACC,YAAY,EAAE;AACpC,IAAA,IAAI7Z,QAAQ,CAAC6Z,YAAY,CAAC,EAAE;AAC1B,MAAA,OAAOrB,QAAQ,CAACkB,UAAU,CAACG,YAAY,CAAC,CAAA;KACzC,MAAM,IAAIrB,QAAQ,CAACsB,UAAU,CAACD,YAAY,CAAC,EAAE;AAC5C,MAAA,OAAOA,YAAY,CAAA;AACrB,KAAC,MAAM,IAAI,OAAOA,YAAY,KAAK,QAAQ,EAAE;AAC3C,MAAA,OAAOrB,QAAQ,CAACjc,UAAU,CAACsd,YAAY,CAAC,CAAA;AAC1C,KAAC,MAAM;MACL,MAAM,IAAIxrB,oBAAoB,CAC3B,CAAA,0BAAA,EAA4BwrB,YAAa,CAAW,SAAA,EAAA,OAAOA,YAAa,CAAA,CAC3E,CAAC,CAAA;AACH,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOE,OAAOA,CAACC,IAAI,EAAEhpB,IAAI,EAAE;AACzB,IAAA,MAAM,CAACiC,MAAM,CAAC,GAAGokB,gBAAgB,CAAC2C,IAAI,CAAC,CAAA;AACvC,IAAA,IAAI/mB,MAAM,EAAE;AACV,MAAA,OAAOulB,QAAQ,CAACjc,UAAU,CAACtJ,MAAM,EAAEjC,IAAI,CAAC,CAAA;AAC1C,KAAC,MAAM;MACL,OAAOwnB,QAAQ,CAACgB,OAAO,CAAC,YAAY,EAAG,CAAA,WAAA,EAAaQ,IAAK,CAAA,6BAAA,CAA8B,CAAC,CAAA;AAC1F,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOC,WAAWA,CAACD,IAAI,EAAEhpB,IAAI,EAAE;AAC7B,IAAA,MAAM,CAACiC,MAAM,CAAC,GAAGskB,gBAAgB,CAACyC,IAAI,CAAC,CAAA;AACvC,IAAA,IAAI/mB,MAAM,EAAE;AACV,MAAA,OAAOulB,QAAQ,CAACjc,UAAU,CAACtJ,MAAM,EAAEjC,IAAI,CAAC,CAAA;AAC1C,KAAC,MAAM;MACL,OAAOwnB,QAAQ,CAACgB,OAAO,CAAC,YAAY,EAAG,CAAA,WAAA,EAAaQ,IAAK,CAAA,6BAAA,CAA8B,CAAC,CAAA;AAC1F,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOR,OAAOA,CAAC1rB,MAAM,EAAEkV,WAAW,GAAG,IAAI,EAAE;IACzC,IAAI,CAAClV,MAAM,EAAE;AACX,MAAA,MAAM,IAAIO,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,MAAMmrB,OAAO,GAAG1rB,MAAM,YAAYiV,OAAO,GAAGjV,MAAM,GAAG,IAAIiV,OAAO,CAACjV,MAAM,EAAEkV,WAAW,CAAC,CAAA;IAErF,IAAInH,QAAQ,CAAC8G,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAI1U,oBAAoB,CAACurB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAIhB,QAAQ,CAAC;AAAEgB,QAAAA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;EACE,OAAOG,aAAaA,CAACvrB,IAAI,EAAE;AACzB,IAAA,MAAM2c,UAAU,GAAG;AACjBpc,MAAAA,IAAI,EAAE,OAAO;AACbwd,MAAAA,KAAK,EAAE,OAAO;AACdoE,MAAAA,OAAO,EAAE,UAAU;AACnBnE,MAAAA,QAAQ,EAAE,UAAU;AACpBxd,MAAAA,KAAK,EAAE,QAAQ;AACf8O,MAAAA,MAAM,EAAE,QAAQ;AAChBwc,MAAAA,IAAI,EAAE,OAAO;AACb7N,MAAAA,KAAK,EAAE,OAAO;AACdxd,MAAAA,GAAG,EAAE,MAAM;AACXyd,MAAAA,IAAI,EAAE,MAAM;AACZld,MAAAA,IAAI,EAAE,OAAO;AACb6b,MAAAA,KAAK,EAAE,OAAO;AACd5b,MAAAA,MAAM,EAAE,SAAS;AACjBmL,MAAAA,OAAO,EAAE,SAAS;AAClBjL,MAAAA,MAAM,EAAE,SAAS;AACjBgd,MAAAA,OAAO,EAAE,SAAS;AAClBlX,MAAAA,WAAW,EAAE,cAAc;AAC3Bye,MAAAA,YAAY,EAAE,cAAA;KACf,CAAC1lB,IAAI,GAAGA,IAAI,CAACqQ,WAAW,EAAE,GAAGrQ,IAAI,CAAC,CAAA;IAEnC,IAAI,CAAC2c,UAAU,EAAE,MAAM,IAAI5c,gBAAgB,CAACC,IAAI,CAAC,CAAA;AAEjD,IAAA,OAAO2c,UAAU,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAO+O,UAAUA,CAACjT,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAAC4S,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI3nB,MAAMA,GAAG;IACX,OAAO,IAAI,CAACR,OAAO,GAAG,IAAI,CAACsH,GAAG,CAAC9G,MAAM,GAAG,IAAI,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIgG,eAAeA,GAAG;IACpB,OAAO,IAAI,CAACxG,OAAO,GAAG,IAAI,CAACsH,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEqiB,EAAAA,QAAQA,CAACxL,GAAG,EAAE3d,IAAI,GAAG,EAAE,EAAE;AACvB;AACA,IAAA,MAAMopB,OAAO,GAAG;AACd,MAAA,GAAGppB,IAAI;MACPuI,KAAK,EAAEvI,IAAI,CAACwY,KAAK,KAAK,KAAK,IAAIxY,IAAI,CAACuI,KAAK,KAAK,KAAA;KAC/C,CAAA;IACD,OAAO,IAAI,CAACjI,OAAO,GACfmd,SAAS,CAACpa,MAAM,CAAC,IAAI,CAACuE,GAAG,EAAEwhB,OAAO,CAAC,CAAC5J,wBAAwB,CAAC,IAAI,EAAE7B,GAAG,CAAC,GACvEiJ,SAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEyC,EAAAA,OAAOA,CAACrpB,IAAI,GAAG,EAAE,EAAE;AACjB,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAOsmB,SAAO,CAAA;AAEjC,IAAA,MAAM0C,SAAS,GAAGtpB,IAAI,CAACspB,SAAS,KAAK,KAAK,CAAA;AAE1C,IAAA,MAAM7rB,CAAC,GAAGypB,cAAY,CACnBzd,GAAG,CAAErM,IAAI,IAAK;AACb,MAAA,MAAMgf,GAAG,GAAG,IAAI,CAACuE,MAAM,CAACvjB,IAAI,CAAC,CAAA;MAC7B,IAAI6F,WAAW,CAACmZ,GAAG,CAAC,IAAKA,GAAG,KAAK,CAAC,IAAI,CAACkN,SAAU,EAAE;AACjD,QAAA,OAAO,IAAI,CAAA;AACb,OAAA;AACA,MAAA,OAAO,IAAI,CAAC1hB,GAAG,CACZ8F,eAAe,CAAC;AAAE1D,QAAAA,KAAK,EAAE,MAAM;AAAEuf,QAAAA,WAAW,EAAE,MAAM;AAAE,QAAA,GAAGvpB,IAAI;QAAE5C,IAAI,EAAEA,IAAI,CAACkiB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;AAAE,OAAC,CAAC,CACzFpf,MAAM,CAACkc,GAAG,CAAC,CAAA;AAChB,KAAC,CAAC,CACDqE,MAAM,CAAEljB,CAAC,IAAKA,CAAC,CAAC,CAAA;AAEnB,IAAA,OAAO,IAAI,CAACqK,GAAG,CACZgG,aAAa,CAAC;AAAElO,MAAAA,IAAI,EAAE,aAAa;AAAEsK,MAAAA,KAAK,EAAEhK,IAAI,CAACwpB,SAAS,IAAI,QAAQ;MAAE,GAAGxpB,IAAAA;AAAK,KAAC,CAAC,CAClFE,MAAM,CAACzC,CAAC,CAAC,CAAA;AACd,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEgsB,EAAAA,QAAQA,GAAG;AACT,IAAA,IAAI,CAAC,IAAI,CAACnpB,OAAO,EAAE,OAAO,EAAE,CAAA;IAC5B,OAAO;AAAE,MAAA,GAAG,IAAI,CAACqgB,MAAAA;KAAQ,CAAA;AAC3B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE+I,EAAAA,KAAKA,GAAG;AACN;AACA,IAAA,IAAI,CAAC,IAAI,CAACppB,OAAO,EAAE,OAAO,IAAI,CAAA;IAE9B,IAAI9C,CAAC,GAAG,GAAG,CAAA;AACX,IAAA,IAAI,IAAI,CAAC2d,KAAK,KAAK,CAAC,EAAE3d,CAAC,IAAI,IAAI,CAAC2d,KAAK,GAAG,GAAG,CAAA;IAC3C,IAAI,IAAI,CAACzO,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC0O,QAAQ,KAAK,CAAC,EAAE5d,CAAC,IAAI,IAAI,CAACkP,MAAM,GAAG,IAAI,CAAC0O,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAA;AACxF,IAAA,IAAI,IAAI,CAACC,KAAK,KAAK,CAAC,EAAE7d,CAAC,IAAI,IAAI,CAAC6d,KAAK,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAI,CAACC,IAAI,KAAK,CAAC,EAAE9d,CAAC,IAAI,IAAI,CAAC8d,IAAI,GAAG,GAAG,CAAA;IACzC,IAAI,IAAI,CAACrB,KAAK,KAAK,CAAC,IAAI,IAAI,CAACzQ,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC+R,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuH,YAAY,KAAK,CAAC,EACzFtlB,CAAC,IAAI,GAAG,CAAA;AACV,IAAA,IAAI,IAAI,CAACyc,KAAK,KAAK,CAAC,EAAEzc,CAAC,IAAI,IAAI,CAACyc,KAAK,GAAG,GAAG,CAAA;AAC3C,IAAA,IAAI,IAAI,CAACzQ,OAAO,KAAK,CAAC,EAAEhM,CAAC,IAAI,IAAI,CAACgM,OAAO,GAAG,GAAG,CAAA;IAC/C,IAAI,IAAI,CAAC+R,OAAO,KAAK,CAAC,IAAI,IAAI,CAACuH,YAAY,KAAK,CAAC;AAC/C;AACA;AACAtlB,MAAAA,CAAC,IAAIuL,OAAO,CAAC,IAAI,CAACwS,OAAO,GAAG,IAAI,CAACuH,YAAY,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;AAChE,IAAA,IAAItlB,CAAC,KAAK,GAAG,EAAEA,CAAC,IAAI,KAAK,CAAA;AACzB,IAAA,OAAOA,CAAC,CAAA;AACV,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEmsB,EAAAA,SAASA,CAAC3pB,IAAI,GAAG,EAAE,EAAE;AACnB,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,MAAMspB,MAAM,GAAG,IAAI,CAACC,QAAQ,EAAE,CAAA;IAC9B,IAAID,MAAM,GAAG,CAAC,IAAIA,MAAM,IAAI,QAAQ,EAAE,OAAO,IAAI,CAAA;AAEjD5pB,IAAAA,IAAI,GAAG;AACL8pB,MAAAA,oBAAoB,EAAE,KAAK;AAC3BC,MAAAA,eAAe,EAAE,KAAK;AACtBC,MAAAA,aAAa,EAAE,KAAK;AACpB9pB,MAAAA,MAAM,EAAE,UAAU;AAClB,MAAA,GAAGF,IAAI;AACPiqB,MAAAA,aAAa,EAAE,KAAA;KAChB,CAAA;AAED,IAAA,MAAMC,QAAQ,GAAG3iB,QAAQ,CAACmhB,UAAU,CAACkB,MAAM,EAAE;AAAEtmB,MAAAA,IAAI,EAAE,KAAA;AAAM,KAAC,CAAC,CAAA;AAC7D,IAAA,OAAO4mB,QAAQ,CAACP,SAAS,CAAC3pB,IAAI,CAAC,CAAA;AACjC,GAAA;;AAEA;AACF;AACA;AACA;AACEmqB,EAAAA,MAAMA,GAAG;AACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA;AACEvb,EAAAA,QAAQA,GAAG;AACT,IAAA,OAAO,IAAI,CAACub,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA;AACE,EAAA,CAACU,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,CAAI,GAAA;IAC3C,IAAI,IAAI,CAAC/pB,OAAO,EAAE;MAChB,OAAQ,CAAA,mBAAA,EAAqBsE,IAAI,CAACC,SAAS,CAAC,IAAI,CAAC8b,MAAM,CAAE,CAAG,EAAA,CAAA,CAAA;AAC9D,KAAC,MAAM;AACL,MAAA,OAAQ,CAA8B,4BAAA,EAAA,IAAI,CAAC2J,aAAc,CAAG,EAAA,CAAA,CAAA;AAC9D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACET,EAAAA,QAAQA,GAAG;AACT,IAAA,IAAI,CAAC,IAAI,CAACvpB,OAAO,EAAE,OAAOuD,GAAG,CAAA;IAE7B,OAAO4jB,gBAAgB,CAAC,IAAI,CAACF,MAAM,EAAE,IAAI,CAAC5G,MAAM,CAAC,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA;AACE4J,EAAAA,OAAOA,GAAG;AACR,IAAA,OAAO,IAAI,CAACV,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEtgB,IAAIA,CAACihB,QAAQ,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAAClqB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,MAAMmf,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC;MAC7C1F,MAAM,GAAG,EAAE,CAAA;AAEb,IAAA,KAAK,MAAM/N,CAAC,IAAImQ,cAAY,EAAE;AAC5B,MAAA,IAAIlQ,cAAc,CAACyI,GAAG,CAACkB,MAAM,EAAE5J,CAAC,CAAC,IAAIC,cAAc,CAAC,IAAI,CAAC2J,MAAM,EAAE5J,CAAC,CAAC,EAAE;AACnE+N,QAAAA,MAAM,CAAC/N,CAAC,CAAC,GAAG0I,GAAG,CAACle,GAAG,CAACwV,CAAC,CAAC,GAAG,IAAI,CAACxV,GAAG,CAACwV,CAAC,CAAC,CAAA;AACtC,OAAA;AACF,KAAA;IAEA,OAAO1K,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAEmE,MAAAA;KAAQ,EAAE,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE2F,KAAKA,CAACD,QAAQ,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAAClqB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,MAAMmf,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;IAC/C,OAAO,IAAI,CAACjhB,IAAI,CAACkW,GAAG,CAACiL,MAAM,EAAE,CAAC,CAAA;AAChC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEC,QAAQA,CAACC,EAAE,EAAE;AACX,IAAA,IAAI,CAAC,IAAI,CAACtqB,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,MAAMwkB,MAAM,GAAG,EAAE,CAAA;IACjB,KAAK,MAAM/N,CAAC,IAAItO,MAAM,CAACC,IAAI,CAAC,IAAI,CAACiY,MAAM,CAAC,EAAE;AACxCmE,MAAAA,MAAM,CAAC/N,CAAC,CAAC,GAAG2C,QAAQ,CAACkR,EAAE,CAAC,IAAI,CAACjK,MAAM,CAAC5J,CAAC,CAAC,EAAEA,CAAC,CAAC,CAAC,CAAA;AAC7C,KAAA;IACA,OAAO1K,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAEmE,MAAAA;KAAQ,EAAE,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEvjB,GAAGA,CAACnE,IAAI,EAAE;IACR,OAAO,IAAI,CAACoqB,QAAQ,CAACmB,aAAa,CAACvrB,IAAI,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEuE,GAAGA,CAACgf,MAAM,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACrgB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,MAAMuqB,KAAK,GAAG;MAAE,GAAG,IAAI,CAAClK,MAAM;AAAE,MAAA,GAAG9G,eAAe,CAAC8G,MAAM,EAAE6G,QAAQ,CAACmB,aAAa,CAAA;KAAG,CAAA;IACpF,OAAOtc,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAEkK,KAAAA;AAAM,KAAC,CAAC,CAAA;AACvC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEC,EAAAA,WAAWA,CAAC;IAAEhqB,MAAM;IAAEgG,eAAe;IAAEwgB,kBAAkB;AAAEC,IAAAA,MAAAA;GAAQ,GAAG,EAAE,EAAE;AACxE,IAAA,MAAM3f,GAAG,GAAG,IAAI,CAACA,GAAG,CAACyE,KAAK,CAAC;MAAEvL,MAAM;AAAEgG,MAAAA,eAAAA;AAAgB,KAAC,CAAC,CAAA;AACvD,IAAA,MAAM9G,IAAI,GAAG;MAAE4H,GAAG;MAAE2f,MAAM;AAAED,MAAAA,kBAAAA;KAAoB,CAAA;AAChD,IAAA,OAAOjb,OAAK,CAAC,IAAI,EAAErM,IAAI,CAAC,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE+qB,EAAEA,CAAC3tB,IAAI,EAAE;AACP,IAAA,OAAO,IAAI,CAACkD,OAAO,GAAG,IAAI,CAACkgB,OAAO,CAACpjB,IAAI,CAAC,CAACmE,GAAG,CAACnE,IAAI,CAAC,GAAGyG,GAAG,CAAA;AAC1D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEmnB,EAAAA,SAASA,GAAG;AACV,IAAA,IAAI,CAAC,IAAI,CAAC1qB,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAMonB,IAAI,GAAG,IAAI,CAAC+B,QAAQ,EAAE,CAAA;AAC5B5B,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAEG,IAAI,CAAC,CAAA;IAClC,OAAOrb,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAE+G,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEuD,EAAAA,OAAOA,GAAG;AACR,IAAA,IAAI,CAAC,IAAI,CAAC3qB,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAMonB,IAAI,GAAGS,YAAY,CAAC,IAAI,CAAC6C,SAAS,EAAE,CAACE,UAAU,EAAE,CAACzB,QAAQ,EAAE,CAAC,CAAA;IACnE,OAAOpd,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAE+G,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACElH,OAAOA,CAAC,GAAGtF,KAAK,EAAE;AAChB,IAAA,IAAI,CAAC,IAAI,CAAC5a,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,IAAI4a,KAAK,CAACpY,MAAM,KAAK,CAAC,EAAE;AACtB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEAoY,IAAAA,KAAK,GAAGA,KAAK,CAACzR,GAAG,CAAEuQ,CAAC,IAAKwN,QAAQ,CAACmB,aAAa,CAAC3O,CAAC,CAAC,CAAC,CAAA;IAEnD,MAAMmR,KAAK,GAAG,EAAE;MACdC,WAAW,GAAG,EAAE;AAChB1D,MAAAA,IAAI,GAAG,IAAI,CAAC+B,QAAQ,EAAE,CAAA;AACxB,IAAA,IAAI4B,QAAQ,CAAA;AAEZ,IAAA,KAAK,MAAMtU,CAAC,IAAImQ,cAAY,EAAE;MAC5B,IAAIhM,KAAK,CAAC1U,OAAO,CAACuQ,CAAC,CAAC,IAAI,CAAC,EAAE;AACzBsU,QAAAA,QAAQ,GAAGtU,CAAC,CAAA;QAEZ,IAAIuU,GAAG,GAAG,CAAC,CAAA;;AAEX;AACA,QAAA,KAAK,MAAMC,EAAE,IAAIH,WAAW,EAAE;AAC5BE,UAAAA,GAAG,IAAI,IAAI,CAAC/D,MAAM,CAACgE,EAAE,CAAC,CAACxU,CAAC,CAAC,GAAGqU,WAAW,CAACG,EAAE,CAAC,CAAA;AAC3CH,UAAAA,WAAW,CAACG,EAAE,CAAC,GAAG,CAAC,CAAA;AACrB,SAAA;;AAEA;AACA,QAAA,IAAIvc,QAAQ,CAAC0Y,IAAI,CAAC3Q,CAAC,CAAC,CAAC,EAAE;AACrBuU,UAAAA,GAAG,IAAI5D,IAAI,CAAC3Q,CAAC,CAAC,CAAA;AAChB,SAAA;;AAEA;AACA;AACA,QAAA,MAAMlU,CAAC,GAAGmB,IAAI,CAACuU,KAAK,CAAC+S,GAAG,CAAC,CAAA;AACzBH,QAAAA,KAAK,CAACpU,CAAC,CAAC,GAAGlU,CAAC,CAAA;AACZuoB,QAAAA,WAAW,CAACrU,CAAC,CAAC,GAAG,CAACuU,GAAG,GAAG,IAAI,GAAGzoB,CAAC,GAAG,IAAI,IAAI,IAAI,CAAA;;AAE/C;OACD,MAAM,IAAImM,QAAQ,CAAC0Y,IAAI,CAAC3Q,CAAC,CAAC,CAAC,EAAE;AAC5BqU,QAAAA,WAAW,CAACrU,CAAC,CAAC,GAAG2Q,IAAI,CAAC3Q,CAAC,CAAC,CAAA;AAC1B,OAAA;AACF,KAAA;;AAEA;AACA;AACA,IAAA,KAAK,MAAMpS,GAAG,IAAIymB,WAAW,EAAE;AAC7B,MAAA,IAAIA,WAAW,CAACzmB,GAAG,CAAC,KAAK,CAAC,EAAE;QAC1BwmB,KAAK,CAACE,QAAQ,CAAC,IACb1mB,GAAG,KAAK0mB,QAAQ,GAAGD,WAAW,CAACzmB,GAAG,CAAC,GAAGymB,WAAW,CAACzmB,GAAG,CAAC,GAAG,IAAI,CAAC4iB,MAAM,CAAC8D,QAAQ,CAAC,CAAC1mB,GAAG,CAAC,CAAA;AACvF,OAAA;AACF,KAAA;AAEAkjB,IAAAA,eAAe,CAAC,IAAI,CAACN,MAAM,EAAE4D,KAAK,CAAC,CAAA;IACnC,OAAO9e,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAEwK,KAAAA;KAAO,EAAE,IAAI,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACED,EAAAA,UAAUA,GAAG;AACX,IAAA,IAAI,CAAC,IAAI,CAAC5qB,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,OAAO,IAAI,CAACkgB,OAAO,CACjB,OAAO,EACP,QAAQ,EACR,OAAO,EACP,MAAM,EACN,OAAO,EACP,SAAS,EACT,SAAS,EACT,cACF,CAAC,CAAA;AACH,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEkK,EAAAA,MAAMA,GAAG;AACP,IAAA,IAAI,CAAC,IAAI,CAACpqB,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,MAAMkrB,OAAO,GAAG,EAAE,CAAA;IAClB,KAAK,MAAMzU,CAAC,IAAItO,MAAM,CAACC,IAAI,CAAC,IAAI,CAACiY,MAAM,CAAC,EAAE;MACxC6K,OAAO,CAACzU,CAAC,CAAC,GAAG,IAAI,CAAC4J,MAAM,CAAC5J,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC4J,MAAM,CAAC5J,CAAC,CAAC,CAAA;AACzD,KAAA;IACA,OAAO1K,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAE6K,OAAAA;KAAS,EAAE,IAAI,CAAC,CAAA;AAC/C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEC,EAAAA,WAAWA,GAAG;AACZ,IAAA,IAAI,CAAC,IAAI,CAACnrB,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAMonB,IAAI,GAAGS,YAAY,CAAC,IAAI,CAACxH,MAAM,CAAC,CAAA;IACtC,OAAOtU,OAAK,CAAC,IAAI,EAAE;AAAEsU,MAAAA,MAAM,EAAE+G,IAAAA;KAAM,EAAE,IAAI,CAAC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIvM,KAAKA,GAAG;AACV,IAAA,OAAO,IAAI,CAAC7a,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACxF,KAAK,IAAI,CAAC,GAAGtX,GAAG,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIuX,QAAQA,GAAG;AACb,IAAA,OAAO,IAAI,CAAC9a,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACvF,QAAQ,IAAI,CAAC,GAAGvX,GAAG,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI6I,MAAMA,GAAG;AACX,IAAA,OAAO,IAAI,CAACpM,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACjU,MAAM,IAAI,CAAC,GAAG7I,GAAG,CAAA;AACrD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIwX,KAAKA,GAAG;AACV,IAAA,OAAO,IAAI,CAAC/a,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACtF,KAAK,IAAI,CAAC,GAAGxX,GAAG,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIyX,IAAIA,GAAG;AACT,IAAA,OAAO,IAAI,CAAChb,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACrF,IAAI,IAAI,CAAC,GAAGzX,GAAG,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIoW,KAAKA,GAAG;AACV,IAAA,OAAO,IAAI,CAAC3Z,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAAC1G,KAAK,IAAI,CAAC,GAAGpW,GAAG,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI2F,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAAClJ,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACnX,OAAO,IAAI,CAAC,GAAG3F,GAAG,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI0X,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACjb,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACpF,OAAO,IAAI,CAAC,GAAG1X,GAAG,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIif,YAAYA,GAAG;AACjB,IAAA,OAAO,IAAI,CAACxiB,OAAO,GAAG,IAAI,CAACqgB,MAAM,CAACmC,YAAY,IAAI,CAAC,GAAGjf,GAAG,CAAA;AAC3D,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIvD,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACkoB,OAAO,KAAK,IAAI,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI8B,aAAaA,GAAG;IAClB,OAAO,IAAI,CAAC9B,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC1rB,MAAM,GAAG,IAAI,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI4uB,kBAAkBA,GAAG;IACvB,OAAO,IAAI,CAAClD,OAAO,GAAG,IAAI,CAACA,OAAO,CAACxW,WAAW,GAAG,IAAI,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE5R,MAAMA,CAAC8N,KAAK,EAAE;IACZ,IAAI,CAAC,IAAI,CAAC5N,OAAO,IAAI,CAAC4N,KAAK,CAAC5N,OAAO,EAAE;AACnC,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IAEA,IAAI,CAAC,IAAI,CAACsH,GAAG,CAACxH,MAAM,CAAC8N,KAAK,CAACtG,GAAG,CAAC,EAAE;AAC/B,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AAEA,IAAA,SAAS+jB,EAAEA,CAACC,EAAE,EAAEC,EAAE,EAAE;AAClB;AACA,MAAA,IAAID,EAAE,KAAKpqB,SAAS,IAAIoqB,EAAE,KAAK,CAAC,EAAE,OAAOC,EAAE,KAAKrqB,SAAS,IAAIqqB,EAAE,KAAK,CAAC,CAAA;MACrE,OAAOD,EAAE,KAAKC,EAAE,CAAA;AAClB,KAAA;AAEA,IAAA,KAAK,MAAM7R,CAAC,IAAIkN,cAAY,EAAE;AAC5B,MAAA,IAAI,CAACyE,EAAE,CAAC,IAAI,CAAChL,MAAM,CAAC3G,CAAC,CAAC,EAAE9L,KAAK,CAACyS,MAAM,CAAC3G,CAAC,CAAC,CAAC,EAAE;AACxC,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACF,KAAA;AACA,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACF;;ACx+BA,MAAM4M,SAAO,GAAG,kBAAkB,CAAA;;AAElC;AACA,SAASkF,gBAAgBA,CAACrN,KAAK,EAAEE,GAAG,EAAE;AACpC,EAAA,IAAI,CAACF,KAAK,IAAI,CAACA,KAAK,CAACne,OAAO,EAAE;AAC5B,IAAA,OAAOyrB,QAAQ,CAACvD,OAAO,CAAC,0BAA0B,CAAC,CAAA;GACpD,MAAM,IAAI,CAAC7J,GAAG,IAAI,CAACA,GAAG,CAACre,OAAO,EAAE;AAC/B,IAAA,OAAOyrB,QAAQ,CAACvD,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACnD,GAAC,MAAM,IAAI7J,GAAG,GAAGF,KAAK,EAAE;AACtB,IAAA,OAAOsN,QAAQ,CAACvD,OAAO,CACrB,kBAAkB,EACjB,qEAAoE/J,KAAK,CAACiL,KAAK,EAAG,YAAW/K,GAAG,CAAC+K,KAAK,EAAG,EAC5G,CAAC,CAAA;AACH,GAAC,MAAM;AACL,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAMqC,QAAQ,CAAC;AAC5B;AACF;AACA;EACElvB,WAAWA,CAACyrB,MAAM,EAAE;AAClB;AACJ;AACA;AACI,IAAA,IAAI,CAAC9qB,CAAC,GAAG8qB,MAAM,CAAC7J,KAAK,CAAA;AACrB;AACJ;AACA;AACI,IAAA,IAAI,CAAC9a,CAAC,GAAG2kB,MAAM,CAAC3J,GAAG,CAAA;AACnB;AACJ;AACA;AACI,IAAA,IAAI,CAAC6J,OAAO,GAAGF,MAAM,CAACE,OAAO,IAAI,IAAI,CAAA;AACrC;AACJ;AACA;IACI,IAAI,CAACwD,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOxD,OAAOA,CAAC1rB,MAAM,EAAEkV,WAAW,GAAG,IAAI,EAAE;IACzC,IAAI,CAAClV,MAAM,EAAE;AACX,MAAA,MAAM,IAAIO,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,MAAMmrB,OAAO,GAAG1rB,MAAM,YAAYiV,OAAO,GAAGjV,MAAM,GAAG,IAAIiV,OAAO,CAACjV,MAAM,EAAEkV,WAAW,CAAC,CAAA;IAErF,IAAInH,QAAQ,CAAC8G,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAI3U,oBAAoB,CAACwrB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAIuD,QAAQ,CAAC;AAAEvD,QAAAA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOyD,aAAaA,CAACxN,KAAK,EAAEE,GAAG,EAAE;AAC/B,IAAA,MAAMuN,UAAU,GAAGC,gBAAgB,CAAC1N,KAAK,CAAC;AACxC2N,MAAAA,QAAQ,GAAGD,gBAAgB,CAACxN,GAAG,CAAC,CAAA;AAElC,IAAA,MAAM0N,aAAa,GAAGP,gBAAgB,CAACI,UAAU,EAAEE,QAAQ,CAAC,CAAA;IAE5D,IAAIC,aAAa,IAAI,IAAI,EAAE;MACzB,OAAO,IAAIN,QAAQ,CAAC;AAClBtN,QAAAA,KAAK,EAAEyN,UAAU;AACjBvN,QAAAA,GAAG,EAAEyN,QAAAA;AACP,OAAC,CAAC,CAAA;AACJ,KAAC,MAAM;AACL,MAAA,OAAOC,aAAa,CAAA;AACtB,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOC,KAAKA,CAAC7N,KAAK,EAAE+L,QAAQ,EAAE;AAC5B,IAAA,MAAM/K,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC;AAC7CljB,MAAAA,EAAE,GAAG6kB,gBAAgB,CAAC1N,KAAK,CAAC,CAAA;AAC9B,IAAA,OAAOsN,QAAQ,CAACE,aAAa,CAAC3kB,EAAE,EAAEA,EAAE,CAACiC,IAAI,CAACkW,GAAG,CAAC,CAAC,CAAA;AACjD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO8M,MAAMA,CAAC5N,GAAG,EAAE6L,QAAQ,EAAE;AAC3B,IAAA,MAAM/K,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC;AAC7CljB,MAAAA,EAAE,GAAG6kB,gBAAgB,CAACxN,GAAG,CAAC,CAAA;AAC5B,IAAA,OAAOoN,QAAQ,CAACE,aAAa,CAAC3kB,EAAE,CAACmjB,KAAK,CAAChL,GAAG,CAAC,EAAEnY,EAAE,CAAC,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOyhB,OAAOA,CAACC,IAAI,EAAEhpB,IAAI,EAAE;AACzB,IAAA,MAAM,CAACxC,CAAC,EAAEmG,CAAC,CAAC,GAAG,CAACqlB,IAAI,IAAI,EAAE,EAAEvY,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;IACzC,IAAIjT,CAAC,IAAImG,CAAC,EAAE;MACV,IAAI8a,KAAK,EAAE+N,YAAY,CAAA;MACvB,IAAI;QACF/N,KAAK,GAAGlX,QAAQ,CAACwhB,OAAO,CAACvrB,CAAC,EAAEwC,IAAI,CAAC,CAAA;QACjCwsB,YAAY,GAAG/N,KAAK,CAACne,OAAO,CAAA;OAC7B,CAAC,OAAOqD,CAAC,EAAE;AACV6oB,QAAAA,YAAY,GAAG,KAAK,CAAA;AACtB,OAAA;MAEA,IAAI7N,GAAG,EAAE8N,UAAU,CAAA;MACnB,IAAI;QACF9N,GAAG,GAAGpX,QAAQ,CAACwhB,OAAO,CAACplB,CAAC,EAAE3D,IAAI,CAAC,CAAA;QAC/BysB,UAAU,GAAG9N,GAAG,CAACre,OAAO,CAAA;OACzB,CAAC,OAAOqD,CAAC,EAAE;AACV8oB,QAAAA,UAAU,GAAG,KAAK,CAAA;AACpB,OAAA;MAEA,IAAID,YAAY,IAAIC,UAAU,EAAE;AAC9B,QAAA,OAAOV,QAAQ,CAACE,aAAa,CAACxN,KAAK,EAAEE,GAAG,CAAC,CAAA;AAC3C,OAAA;AAEA,MAAA,IAAI6N,YAAY,EAAE;QAChB,MAAM/M,GAAG,GAAG+H,QAAQ,CAACuB,OAAO,CAACplB,CAAC,EAAE3D,IAAI,CAAC,CAAA;QACrC,IAAIyf,GAAG,CAACnf,OAAO,EAAE;AACf,UAAA,OAAOyrB,QAAQ,CAACO,KAAK,CAAC7N,KAAK,EAAEgB,GAAG,CAAC,CAAA;AACnC,SAAA;OACD,MAAM,IAAIgN,UAAU,EAAE;QACrB,MAAMhN,GAAG,GAAG+H,QAAQ,CAACuB,OAAO,CAACvrB,CAAC,EAAEwC,IAAI,CAAC,CAAA;QACrC,IAAIyf,GAAG,CAACnf,OAAO,EAAE;AACf,UAAA,OAAOyrB,QAAQ,CAACQ,MAAM,CAAC5N,GAAG,EAAEc,GAAG,CAAC,CAAA;AAClC,SAAA;AACF,OAAA;AACF,KAAA;IACA,OAAOsM,QAAQ,CAACvD,OAAO,CAAC,YAAY,EAAG,CAAA,WAAA,EAAaQ,IAAK,CAAA,6BAAA,CAA8B,CAAC,CAAA;AAC1F,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAO0D,UAAUA,CAAC7W,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACmW,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIvN,KAAKA,GAAG;IACV,OAAO,IAAI,CAACne,OAAO,GAAG,IAAI,CAAC9C,CAAC,GAAG,IAAI,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAImhB,GAAGA,GAAG;IACR,OAAO,IAAI,CAACre,OAAO,GAAG,IAAI,CAACqD,CAAC,GAAG,IAAI,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIgpB,YAAYA,GAAG;AACjB,IAAA,OAAO,IAAI,CAACrsB,OAAO,GAAI,IAAI,CAACqD,CAAC,GAAG,IAAI,CAACA,CAAC,CAAC8mB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,GAAI,IAAI,CAAA;AAChE,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAInqB,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACgqB,aAAa,KAAK,IAAI,CAAA;AACpC,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIA,aAAaA,GAAG;IAClB,OAAO,IAAI,CAAC9B,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC1rB,MAAM,GAAG,IAAI,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI4uB,kBAAkBA,GAAG;IACvB,OAAO,IAAI,CAAClD,OAAO,GAAG,IAAI,CAACA,OAAO,CAACxW,WAAW,GAAG,IAAI,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACElP,EAAAA,MAAMA,CAAC1F,IAAI,GAAG,cAAc,EAAE;AAC5B,IAAA,OAAO,IAAI,CAACkD,OAAO,GAAG,IAAI,CAACssB,UAAU,CAAC,GAAG,CAACxvB,IAAI,CAAC,CAAC,CAACmE,GAAG,CAACnE,IAAI,CAAC,GAAGyG,GAAG,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEsG,EAAAA,KAAKA,CAAC/M,IAAI,GAAG,cAAc,EAAE4C,IAAI,EAAE;AACjC,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAOuD,GAAG,CAAA;IAC7B,MAAM4a,KAAK,GAAG,IAAI,CAACA,KAAK,CAACoO,OAAO,CAACzvB,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC5C,IAAA,IAAI2e,GAAG,CAAA;AACP,IAAA,IAAI3e,IAAI,IAAA,IAAA,IAAJA,IAAI,CAAE8sB,cAAc,EAAE;AACxBnO,MAAAA,GAAG,GAAG,IAAI,CAACA,GAAG,CAACmM,WAAW,CAAC;QAAEhqB,MAAM,EAAE2d,KAAK,CAAC3d,MAAAA;AAAO,OAAC,CAAC,CAAA;AACtD,KAAC,MAAM;MACL6d,GAAG,GAAG,IAAI,CAACA,GAAG,CAAA;AAChB,KAAA;IACAA,GAAG,GAAGA,GAAG,CAACkO,OAAO,CAACzvB,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC7B,IAAA,OAAOgE,IAAI,CAACuE,KAAK,CAACoW,GAAG,CAACoO,IAAI,CAACtO,KAAK,EAAErhB,IAAI,CAAC,CAACmE,GAAG,CAACnE,IAAI,CAAC,CAAC,IAAIuhB,GAAG,CAAC4L,OAAO,EAAE,KAAK,IAAI,CAAC5L,GAAG,CAAC4L,OAAO,EAAE,CAAC,CAAA;AAC7F,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEyC,OAAOA,CAAC5vB,IAAI,EAAE;AACZ,IAAA,OAAO,IAAI,CAACkD,OAAO,GAAG,IAAI,CAAC2sB,OAAO,EAAE,IAAI,IAAI,CAACtpB,CAAC,CAAC8mB,KAAK,CAAC,CAAC,CAAC,CAACuC,OAAO,CAAC,IAAI,CAACxvB,CAAC,EAAEJ,IAAI,CAAC,GAAG,KAAK,CAAA;AACvF,GAAA;;AAEA;AACF;AACA;AACA;AACE6vB,EAAAA,OAAOA,GAAG;AACR,IAAA,OAAO,IAAI,CAACzvB,CAAC,CAAC+sB,OAAO,EAAE,KAAK,IAAI,CAAC5mB,CAAC,CAAC4mB,OAAO,EAAE,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE2C,OAAOA,CAAChD,QAAQ,EAAE;AAChB,IAAA,IAAI,CAAC,IAAI,CAAC5pB,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAAC9C,CAAC,GAAG0sB,QAAQ,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEiD,QAAQA,CAACjD,QAAQ,EAAE;AACjB,IAAA,IAAI,CAAC,IAAI,CAAC5pB,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAACqD,CAAC,IAAIumB,QAAQ,CAAA;AAC3B,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEkD,QAAQA,CAAClD,QAAQ,EAAE;AACjB,IAAA,IAAI,CAAC,IAAI,CAAC5pB,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,IAAI,CAAC9C,CAAC,IAAI0sB,QAAQ,IAAI,IAAI,CAACvmB,CAAC,GAAGumB,QAAQ,CAAA;AAChD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACEvoB,EAAAA,GAAGA,CAAC;IAAE8c,KAAK;AAAEE,IAAAA,GAAAA;GAAK,GAAG,EAAE,EAAE;AACvB,IAAA,IAAI,CAAC,IAAI,CAACre,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,OAAOyrB,QAAQ,CAACE,aAAa,CAACxN,KAAK,IAAI,IAAI,CAACjhB,CAAC,EAAEmhB,GAAG,IAAI,IAAI,CAAChb,CAAC,CAAC,CAAA;AAC/D,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE0pB,OAAOA,CAAC,GAAGC,SAAS,EAAE;AACpB,IAAA,IAAI,CAAC,IAAI,CAAChtB,OAAO,EAAE,OAAO,EAAE,CAAA;AAC5B,IAAA,MAAMitB,MAAM,GAAGD,SAAS,CACnB7jB,GAAG,CAAC0iB,gBAAgB,CAAC,CACrB1L,MAAM,CAAEpO,CAAC,IAAK,IAAI,CAAC+a,QAAQ,CAAC/a,CAAC,CAAC,CAAC,CAC/Bmb,IAAI,CAAC,CAAC1W,CAAC,EAAE2W,CAAC,KAAK3W,CAAC,CAAC+S,QAAQ,EAAE,GAAG4D,CAAC,CAAC5D,QAAQ,EAAE,CAAC;AAC9Cxc,MAAAA,OAAO,GAAG,EAAE,CAAA;IACd,IAAI;AAAE7P,QAAAA,CAAAA;AAAE,OAAC,GAAG,IAAI;AACdqF,MAAAA,CAAC,GAAG,CAAC,CAAA;AAEP,IAAA,OAAOrF,CAAC,GAAG,IAAI,CAACmG,CAAC,EAAE;MACjB,MAAM+pB,KAAK,GAAGH,MAAM,CAAC1qB,CAAC,CAAC,IAAI,IAAI,CAACc,CAAC;AAC/BgT,QAAAA,IAAI,GAAG,CAAC+W,KAAK,GAAG,CAAC,IAAI,CAAC/pB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG+pB,KAAK,CAAA;MAC1CrgB,OAAO,CAAC5F,IAAI,CAACskB,QAAQ,CAACE,aAAa,CAACzuB,CAAC,EAAEmZ,IAAI,CAAC,CAAC,CAAA;AAC7CnZ,MAAAA,CAAC,GAAGmZ,IAAI,CAAA;AACR9T,MAAAA,CAAC,IAAI,CAAC,CAAA;AACR,KAAA;AAEA,IAAA,OAAOwK,OAAO,CAAA;AAChB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEsgB,OAAOA,CAACnD,QAAQ,EAAE;AAChB,IAAA,MAAM/K,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;AAE/C,IAAA,IAAI,CAAC,IAAI,CAAClqB,OAAO,IAAI,CAACmf,GAAG,CAACnf,OAAO,IAAImf,GAAG,CAACsL,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;AACjE,MAAA,OAAO,EAAE,CAAA;AACX,KAAA;IAEA,IAAI;AAAEvtB,QAAAA,CAAAA;AAAE,OAAC,GAAG,IAAI;AACdowB,MAAAA,GAAG,GAAG,CAAC;MACPjX,IAAI,CAAA;IAEN,MAAMtJ,OAAO,GAAG,EAAE,CAAA;AAClB,IAAA,OAAO7P,CAAC,GAAG,IAAI,CAACmG,CAAC,EAAE;AACjB,MAAA,MAAM+pB,KAAK,GAAG,IAAI,CAACjP,KAAK,CAAClV,IAAI,CAACkW,GAAG,CAACkL,QAAQ,CAAElT,CAAC,IAAKA,CAAC,GAAGmW,GAAG,CAAC,CAAC,CAAA;AAC3DjX,MAAAA,IAAI,GAAG,CAAC+W,KAAK,GAAG,CAAC,IAAI,CAAC/pB,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG+pB,KAAK,CAAA;MACxCrgB,OAAO,CAAC5F,IAAI,CAACskB,QAAQ,CAACE,aAAa,CAACzuB,CAAC,EAAEmZ,IAAI,CAAC,CAAC,CAAA;AAC7CnZ,MAAAA,CAAC,GAAGmZ,IAAI,CAAA;AACRiX,MAAAA,GAAG,IAAI,CAAC,CAAA;AACV,KAAA;AAEA,IAAA,OAAOvgB,OAAO,CAAA;AAChB,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEwgB,aAAaA,CAACC,aAAa,EAAE;AAC3B,IAAA,IAAI,CAAC,IAAI,CAACxtB,OAAO,EAAE,OAAO,EAAE,CAAA;AAC5B,IAAA,OAAO,IAAI,CAACqtB,OAAO,CAAC,IAAI,CAAC7qB,MAAM,EAAE,GAAGgrB,aAAa,CAAC,CAACxO,KAAK,CAAC,CAAC,EAAEwO,aAAa,CAAC,CAAA;AAC5E,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEC,QAAQA,CAAC7f,KAAK,EAAE;AACd,IAAA,OAAO,IAAI,CAACvK,CAAC,GAAGuK,KAAK,CAAC1Q,CAAC,IAAI,IAAI,CAACA,CAAC,GAAG0Q,KAAK,CAACvK,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEqqB,UAAUA,CAAC9f,KAAK,EAAE;AAChB,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,CAAC,IAAI,CAACqD,CAAC,KAAK,CAACuK,KAAK,CAAC1Q,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEywB,QAAQA,CAAC/f,KAAK,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,KAAK,CAAA;IAC/B,OAAO,CAAC4N,KAAK,CAACvK,CAAC,KAAK,CAAC,IAAI,CAACnG,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE0wB,OAAOA,CAAChgB,KAAK,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,KAAK,CAAA;AAC/B,IAAA,OAAO,IAAI,CAAC9C,CAAC,IAAI0Q,KAAK,CAAC1Q,CAAC,IAAI,IAAI,CAACmG,CAAC,IAAIuK,KAAK,CAACvK,CAAC,CAAA;AAC/C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEvD,MAAMA,CAAC8N,KAAK,EAAE;IACZ,IAAI,CAAC,IAAI,CAAC5N,OAAO,IAAI,CAAC4N,KAAK,CAAC5N,OAAO,EAAE;AACnC,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;IAEA,OAAO,IAAI,CAAC9C,CAAC,CAAC4C,MAAM,CAAC8N,KAAK,CAAC1Q,CAAC,CAAC,IAAI,IAAI,CAACmG,CAAC,CAACvD,MAAM,CAAC8N,KAAK,CAACvK,CAAC,CAAC,CAAA;AACzD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEwqB,YAAYA,CAACjgB,KAAK,EAAE;AAClB,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAM9C,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG0Q,KAAK,CAAC1Q,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG0Q,KAAK,CAAC1Q,CAAC;AAC3CmG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuK,KAAK,CAACvK,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuK,KAAK,CAACvK,CAAC,CAAA;IAEzC,IAAInG,CAAC,IAAImG,CAAC,EAAE;AACV,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM;AACL,MAAA,OAAOooB,QAAQ,CAACE,aAAa,CAACzuB,CAAC,EAAEmG,CAAC,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEyqB,KAAKA,CAAClgB,KAAK,EAAE;AACX,IAAA,IAAI,CAAC,IAAI,CAAC5N,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAM9C,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG0Q,KAAK,CAAC1Q,CAAC,GAAG,IAAI,CAACA,CAAC,GAAG0Q,KAAK,CAAC1Q,CAAC;AAC3CmG,MAAAA,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuK,KAAK,CAACvK,CAAC,GAAG,IAAI,CAACA,CAAC,GAAGuK,KAAK,CAACvK,CAAC,CAAA;AACzC,IAAA,OAAOooB,QAAQ,CAACE,aAAa,CAACzuB,CAAC,EAAEmG,CAAC,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAO0qB,KAAKA,CAACC,SAAS,EAAE;AACtB,IAAA,MAAM,CAACjO,KAAK,EAAEkO,KAAK,CAAC,GAAGD,SAAS,CAC7Bd,IAAI,CAAC,CAAC1W,CAAC,EAAE2W,CAAC,KAAK3W,CAAC,CAACtZ,CAAC,GAAGiwB,CAAC,CAACjwB,CAAC,CAAC,CACzBiZ,MAAM,CACL,CAAC,CAAC+X,KAAK,EAAE5Q,OAAO,CAAC,EAAEgF,IAAI,KAAK;MAC1B,IAAI,CAAChF,OAAO,EAAE;AACZ,QAAA,OAAO,CAAC4Q,KAAK,EAAE5L,IAAI,CAAC,CAAA;AACtB,OAAC,MAAM,IAAIhF,OAAO,CAACmQ,QAAQ,CAACnL,IAAI,CAAC,IAAIhF,OAAO,CAACoQ,UAAU,CAACpL,IAAI,CAAC,EAAE;QAC7D,OAAO,CAAC4L,KAAK,EAAE5Q,OAAO,CAACwQ,KAAK,CAACxL,IAAI,CAAC,CAAC,CAAA;AACrC,OAAC,MAAM;QACL,OAAO,CAAC4L,KAAK,CAAClO,MAAM,CAAC,CAAC1C,OAAO,CAAC,CAAC,EAAEgF,IAAI,CAAC,CAAA;AACxC,OAAA;AACF,KAAC,EACD,CAAC,EAAE,EAAE,IAAI,CACX,CAAC,CAAA;AACH,IAAA,IAAI2L,KAAK,EAAE;AACTlO,MAAAA,KAAK,CAAC5Y,IAAI,CAAC8mB,KAAK,CAAC,CAAA;AACnB,KAAA;AACA,IAAA,OAAOlO,KAAK,CAAA;AACd,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAOoO,GAAGA,CAACH,SAAS,EAAE;IACpB,IAAI7P,KAAK,GAAG,IAAI;AACdiQ,MAAAA,YAAY,GAAG,CAAC,CAAA;IAClB,MAAMrhB,OAAO,GAAG,EAAE;AAChBshB,MAAAA,IAAI,GAAGL,SAAS,CAAC7kB,GAAG,CAAE5G,CAAC,IAAK,CAC1B;QAAE+rB,IAAI,EAAE/rB,CAAC,CAACrF,CAAC;AAAEkC,QAAAA,IAAI,EAAE,GAAA;AAAI,OAAC,EACxB;QAAEkvB,IAAI,EAAE/rB,CAAC,CAACc,CAAC;AAAEjE,QAAAA,IAAI,EAAE,GAAA;AAAI,OAAC,CACzB,CAAC;MACFmvB,SAAS,GAAG1Y,KAAK,CAACJ,SAAS,CAACuK,MAAM,CAAC,GAAGqO,IAAI,CAAC;AAC3CrY,MAAAA,GAAG,GAAGuY,SAAS,CAACrB,IAAI,CAAC,CAAC1W,CAAC,EAAE2W,CAAC,KAAK3W,CAAC,CAAC8X,IAAI,GAAGnB,CAAC,CAACmB,IAAI,CAAC,CAAA;AAEjD,IAAA,KAAK,MAAM/rB,CAAC,IAAIyT,GAAG,EAAE;MACnBoY,YAAY,IAAI7rB,CAAC,CAACnD,IAAI,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;MAEvC,IAAIgvB,YAAY,KAAK,CAAC,EAAE;QACtBjQ,KAAK,GAAG5b,CAAC,CAAC+rB,IAAI,CAAA;AAChB,OAAC,MAAM;QACL,IAAInQ,KAAK,IAAI,CAACA,KAAK,KAAK,CAAC5b,CAAC,CAAC+rB,IAAI,EAAE;AAC/BvhB,UAAAA,OAAO,CAAC5F,IAAI,CAACskB,QAAQ,CAACE,aAAa,CAACxN,KAAK,EAAE5b,CAAC,CAAC+rB,IAAI,CAAC,CAAC,CAAA;AACrD,SAAA;AAEAnQ,QAAAA,KAAK,GAAG,IAAI,CAAA;AACd,OAAA;AACF,KAAA;AAEA,IAAA,OAAOsN,QAAQ,CAACsC,KAAK,CAAChhB,OAAO,CAAC,CAAA;AAChC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACEyhB,UAAUA,CAAC,GAAGR,SAAS,EAAE;AACvB,IAAA,OAAOvC,QAAQ,CAAC0C,GAAG,CAAC,CAAC,IAAI,CAAC,CAACnO,MAAM,CAACgO,SAAS,CAAC,CAAC,CAC1C7kB,GAAG,CAAE5G,CAAC,IAAK,IAAI,CAACsrB,YAAY,CAACtrB,CAAC,CAAC,CAAC,CAChC4d,MAAM,CAAE5d,CAAC,IAAKA,CAAC,IAAI,CAACA,CAAC,CAACoqB,OAAO,EAAE,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACE9e,EAAAA,QAAQA,GAAG;AACT,IAAA,IAAI,CAAC,IAAI,CAAC7N,OAAO,EAAE,OAAOsmB,SAAO,CAAA;AACjC,IAAA,OAAQ,IAAG,IAAI,CAACppB,CAAC,CAACksB,KAAK,EAAG,CAAK,GAAA,EAAA,IAAI,CAAC/lB,CAAC,CAAC+lB,KAAK,EAAG,CAAE,CAAA,CAAA,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;AACE,EAAA,CAACU,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,CAAI,GAAA;IAC3C,IAAI,IAAI,CAAC/pB,OAAO,EAAE;AAChB,MAAA,OAAQ,qBAAoB,IAAI,CAAC9C,CAAC,CAACksB,KAAK,EAAG,CAAS,OAAA,EAAA,IAAI,CAAC/lB,CAAC,CAAC+lB,KAAK,EAAG,CAAG,EAAA,CAAA,CAAA;AACxE,KAAC,MAAM;AACL,MAAA,OAAQ,CAA8B,4BAAA,EAAA,IAAI,CAACY,aAAc,CAAG,EAAA,CAAA,CAAA;AAC9D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEyE,cAAcA,CAAC7Q,UAAU,GAAG3B,UAAkB,EAAEvc,IAAI,GAAG,EAAE,EAAE;IACzD,OAAO,IAAI,CAACM,OAAO,GACfmd,SAAS,CAACpa,MAAM,CAAC,IAAI,CAAC7F,CAAC,CAACoK,GAAG,CAACyE,KAAK,CAACrM,IAAI,CAAC,EAAEke,UAAU,CAAC,CAACK,cAAc,CAAC,IAAI,CAAC,GACzEqI,SAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE8C,KAAKA,CAAC1pB,IAAI,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAOsmB,SAAO,CAAA;AACjC,IAAA,OAAQ,GAAE,IAAI,CAACppB,CAAC,CAACksB,KAAK,CAAC1pB,IAAI,CAAE,CAAG,CAAA,EAAA,IAAI,CAAC2D,CAAC,CAAC+lB,KAAK,CAAC1pB,IAAI,CAAE,CAAC,CAAA,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACEgvB,EAAAA,SAASA,GAAG;AACV,IAAA,IAAI,CAAC,IAAI,CAAC1uB,OAAO,EAAE,OAAOsmB,SAAO,CAAA;AACjC,IAAA,OAAQ,GAAE,IAAI,CAACppB,CAAC,CAACwxB,SAAS,EAAG,CAAG,CAAA,EAAA,IAAI,CAACrrB,CAAC,CAACqrB,SAAS,EAAG,CAAC,CAAA,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACErF,SAASA,CAAC3pB,IAAI,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAOsmB,SAAO,CAAA;AACjC,IAAA,OAAQ,GAAE,IAAI,CAACppB,CAAC,CAACmsB,SAAS,CAAC3pB,IAAI,CAAE,CAAG,CAAA,EAAA,IAAI,CAAC2D,CAAC,CAACgmB,SAAS,CAAC3pB,IAAI,CAAE,CAAC,CAAA,CAAA;AAC9D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEmpB,QAAQA,CAAC8F,UAAU,EAAE;AAAEC,IAAAA,SAAS,GAAG,KAAA;GAAO,GAAG,EAAE,EAAE;AAC/C,IAAA,IAAI,CAAC,IAAI,CAAC5uB,OAAO,EAAE,OAAOsmB,SAAO,CAAA;IACjC,OAAQ,CAAA,EAAE,IAAI,CAACppB,CAAC,CAAC2rB,QAAQ,CAAC8F,UAAU,CAAE,CAAA,EAAEC,SAAU,CAAE,EAAA,IAAI,CAACvrB,CAAC,CAACwlB,QAAQ,CAAC8F,UAAU,CAAE,CAAC,CAAA,CAAA;AACnF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACErC,EAAAA,UAAUA,CAACxvB,IAAI,EAAE4C,IAAI,EAAE;AACrB,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE;AACjB,MAAA,OAAOknB,QAAQ,CAACgB,OAAO,CAAC,IAAI,CAAC8B,aAAa,CAAC,CAAA;AAC7C,KAAA;AACA,IAAA,OAAO,IAAI,CAAC3mB,CAAC,CAACopB,IAAI,CAAC,IAAI,CAACvvB,CAAC,EAAEJ,IAAI,EAAE4C,IAAI,CAAC,CAAA;AACxC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEmvB,YAAYA,CAACC,KAAK,EAAE;AAClB,IAAA,OAAOrD,QAAQ,CAACE,aAAa,CAACmD,KAAK,CAAC,IAAI,CAAC5xB,CAAC,CAAC,EAAE4xB,KAAK,CAAC,IAAI,CAACzrB,CAAC,CAAC,CAAC,CAAA;AAC7D,GAAA;AACF;;ACppBA;AACA;AACA;AACe,MAAM0rB,IAAI,CAAC;AACxB;AACF;AACA;AACA;AACA;AACE,EAAA,OAAOC,MAAMA,CAAChsB,IAAI,GAAGuH,QAAQ,CAACgE,WAAW,EAAE;AACzC,IAAA,MAAM0gB,KAAK,GAAGhoB,QAAQ,CAACkK,GAAG,EAAE,CAACnI,OAAO,CAAChG,IAAI,CAAC,CAAC3B,GAAG,CAAC;AAAE/D,MAAAA,KAAK,EAAE,EAAA;AAAG,KAAC,CAAC,CAAA;AAE7D,IAAA,OAAO,CAAC0F,IAAI,CAACzD,WAAW,IAAI0vB,KAAK,CAACpvB,MAAM,KAAKovB,KAAK,CAAC5tB,GAAG,CAAC;AAAE/D,MAAAA,KAAK,EAAE,CAAA;KAAG,CAAC,CAACuC,MAAM,CAAA;AAC7E,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAOqvB,eAAeA,CAAClsB,IAAI,EAAE;AAC3B,IAAA,OAAOF,QAAQ,CAACM,WAAW,CAACJ,IAAI,CAAC,CAAA;AACnC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOqL,aAAaA,CAACC,KAAK,EAAE;AAC1B,IAAA,OAAOD,aAAa,CAACC,KAAK,EAAE/D,QAAQ,CAACgE,WAAW,CAAC,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOd,cAAcA,CAAC;AAAEjN,IAAAA,MAAM,GAAG,IAAI;AAAE2uB,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;AAC3D,IAAA,OAAO,CAACA,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,CAAC,EAAEiN,cAAc,EAAE,CAAA;AAC3D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO2hB,yBAAyBA,CAAC;AAAE5uB,IAAAA,MAAM,GAAG,IAAI;AAAE2uB,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;AACtE,IAAA,OAAO,CAACA,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,CAAC,EAAEkN,qBAAqB,EAAE,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO2hB,kBAAkBA,CAAC;AAAE7uB,IAAAA,MAAM,GAAG,IAAI;AAAE2uB,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;AAC/D;AACA,IAAA,OAAO,CAACA,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,CAAC,EAAEmN,cAAc,EAAE,CAACqR,KAAK,EAAE,CAAA;AACnE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO5S,MAAMA,CACX5J,MAAM,GAAG,MAAM,EACf;AAAEhC,IAAAA,MAAM,GAAG,IAAI;AAAEgG,IAAAA,eAAe,GAAG,IAAI;AAAE2oB,IAAAA,MAAM,GAAG,IAAI;AAAExoB,IAAAA,cAAc,GAAG,SAAA;GAAW,GAAG,EAAE,EACzF;AACA,IAAA,OAAO,CAACwoB,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAEgG,eAAe,EAAEG,cAAc,CAAC,EAAEyF,MAAM,CAAC5J,MAAM,CAAC,CAAA;AAC1F,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO8sB,YAAYA,CACjB9sB,MAAM,GAAG,MAAM,EACf;AAAEhC,IAAAA,MAAM,GAAG,IAAI;AAAEgG,IAAAA,eAAe,GAAG,IAAI;AAAE2oB,IAAAA,MAAM,GAAG,IAAI;AAAExoB,IAAAA,cAAc,GAAG,SAAA;GAAW,GAAG,EAAE,EACzF;AACA,IAAA,OAAO,CAACwoB,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAEgG,eAAe,EAAEG,cAAc,CAAC,EAAEyF,MAAM,CAAC5J,MAAM,EAAE,IAAI,CAAC,CAAA;AAChG,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOkK,QAAQA,CAAClK,MAAM,GAAG,MAAM,EAAE;AAAEhC,IAAAA,MAAM,GAAG,IAAI;AAAEgG,IAAAA,eAAe,GAAG,IAAI;AAAE2oB,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;AAC9F,IAAA,OAAO,CAACA,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAEgG,eAAe,EAAE,IAAI,CAAC,EAAEkG,QAAQ,CAAClK,MAAM,CAAC,CAAA;AAClF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAO+sB,cAAcA,CACnB/sB,MAAM,GAAG,MAAM,EACf;AAAEhC,IAAAA,MAAM,GAAG,IAAI;AAAEgG,IAAAA,eAAe,GAAG,IAAI;AAAE2oB,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAC7D;AACA,IAAA,OAAO,CAACA,MAAM,IAAIxpB,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAEgG,eAAe,EAAE,IAAI,CAAC,EAAEkG,QAAQ,CAAClK,MAAM,EAAE,IAAI,CAAC,CAAA;AACxF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOmK,SAASA,CAAC;AAAEnM,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;IACvC,OAAOmF,MAAM,CAAC5C,MAAM,CAACvC,MAAM,CAAC,CAACmM,SAAS,EAAE,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOC,IAAIA,CAACpK,MAAM,GAAG,OAAO,EAAE;AAAEhC,IAAAA,MAAM,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;AACpD,IAAA,OAAOmF,MAAM,CAAC5C,MAAM,CAACvC,MAAM,EAAE,IAAI,EAAE,SAAS,CAAC,CAACoM,IAAI,CAACpK,MAAM,CAAC,CAAA;AAC5D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOgtB,QAAQA,GAAG;IAChB,OAAO;MAAEC,QAAQ,EAAE9lB,WAAW,EAAE;MAAE+lB,UAAU,EAAEliB,iBAAiB,EAAC;KAAG,CAAA;AACrE,GAAA;AACF;;AC1MA,SAASmiB,OAAOA,CAACC,OAAO,EAAEC,KAAK,EAAE;EAC/B,MAAMC,WAAW,GAAI9oB,EAAE,IAAKA,EAAE,CAAC+oB,KAAK,CAAC,CAAC,EAAE;AAAEC,MAAAA,aAAa,EAAE,IAAA;KAAM,CAAC,CAACzD,OAAO,CAAC,KAAK,CAAC,CAACtC,OAAO,EAAE;IACvFljB,EAAE,GAAG+oB,WAAW,CAACD,KAAK,CAAC,GAAGC,WAAW,CAACF,OAAO,CAAC,CAAA;AAChD,EAAA,OAAOlsB,IAAI,CAACuE,KAAK,CAACif,QAAQ,CAACkB,UAAU,CAACrhB,EAAE,CAAC,CAAC0jB,EAAE,CAAC,MAAM,CAAC,CAAC,CAAA;AACvD,CAAA;AAEA,SAASwF,cAAcA,CAAClP,MAAM,EAAE8O,KAAK,EAAEjV,KAAK,EAAE;AAC5C,EAAA,MAAMsV,OAAO,GAAG,CACd,CAAC,OAAO,EAAE,CAAC1Z,CAAC,EAAE2W,CAAC,KAAKA,CAAC,CAAC9vB,IAAI,GAAGmZ,CAAC,CAACnZ,IAAI,CAAC,EACpC,CAAC,UAAU,EAAE,CAACmZ,CAAC,EAAE2W,CAAC,KAAKA,CAAC,CAAClO,OAAO,GAAGzI,CAAC,CAACyI,OAAO,GAAG,CAACkO,CAAC,CAAC9vB,IAAI,GAAGmZ,CAAC,CAACnZ,IAAI,IAAI,CAAC,CAAC,EACrE,CAAC,QAAQ,EAAE,CAACmZ,CAAC,EAAE2W,CAAC,KAAKA,CAAC,CAAC7vB,KAAK,GAAGkZ,CAAC,CAAClZ,KAAK,GAAG,CAAC6vB,CAAC,CAAC9vB,IAAI,GAAGmZ,CAAC,CAACnZ,IAAI,IAAI,EAAE,CAAC,EAChE,CACE,OAAO,EACP,CAACmZ,CAAC,EAAE2W,CAAC,KAAK;AACR,IAAA,MAAMnS,IAAI,GAAG2U,OAAO,CAACnZ,CAAC,EAAE2W,CAAC,CAAC,CAAA;AAC1B,IAAA,OAAO,CAACnS,IAAI,GAAIA,IAAI,GAAG,CAAE,IAAI,CAAC,CAAA;AAChC,GAAC,CACF,EACD,CAAC,MAAM,EAAE2U,OAAO,CAAC,CAClB,CAAA;EAED,MAAM5iB,OAAO,GAAG,EAAE,CAAA;EAClB,MAAM6iB,OAAO,GAAG7O,MAAM,CAAA;EACtB,IAAIoP,WAAW,EAAEC,SAAS,CAAA;;AAE1B;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,KAAK,MAAM,CAACtzB,IAAI,EAAEuzB,MAAM,CAAC,IAAIH,OAAO,EAAE;IACpC,IAAItV,KAAK,CAAC1U,OAAO,CAACpJ,IAAI,CAAC,IAAI,CAAC,EAAE;AAC5BqzB,MAAAA,WAAW,GAAGrzB,IAAI,CAAA;MAElBiQ,OAAO,CAACjQ,IAAI,CAAC,GAAGuzB,MAAM,CAACtP,MAAM,EAAE8O,KAAK,CAAC,CAAA;AACrCO,MAAAA,SAAS,GAAGR,OAAO,CAAC3mB,IAAI,CAAC8D,OAAO,CAAC,CAAA;MAEjC,IAAIqjB,SAAS,GAAGP,KAAK,EAAE;AACrB;QACA9iB,OAAO,CAACjQ,IAAI,CAAC,EAAE,CAAA;AACfikB,QAAAA,MAAM,GAAG6O,OAAO,CAAC3mB,IAAI,CAAC8D,OAAO,CAAC,CAAA;;AAE9B;AACA;AACA;QACA,IAAIgU,MAAM,GAAG8O,KAAK,EAAE;AAClB;AACAO,UAAAA,SAAS,GAAGrP,MAAM,CAAA;AAClB;UACAhU,OAAO,CAACjQ,IAAI,CAAC,EAAE,CAAA;AACfikB,UAAAA,MAAM,GAAG6O,OAAO,CAAC3mB,IAAI,CAAC8D,OAAO,CAAC,CAAA;AAChC,SAAA;AACF,OAAC,MAAM;AACLgU,QAAAA,MAAM,GAAGqP,SAAS,CAAA;AACpB,OAAA;AACF,KAAA;AACF,GAAA;EAEA,OAAO,CAACrP,MAAM,EAAEhU,OAAO,EAAEqjB,SAAS,EAAED,WAAW,CAAC,CAAA;AAClD,CAAA;AAEe,aAAA,EAAUP,OAAO,EAAEC,KAAK,EAAEjV,KAAK,EAAElb,IAAI,EAAE;AACpD,EAAA,IAAI,CAACqhB,MAAM,EAAEhU,OAAO,EAAEqjB,SAAS,EAAED,WAAW,CAAC,GAAGF,cAAc,CAACL,OAAO,EAAEC,KAAK,EAAEjV,KAAK,CAAC,CAAA;AAErF,EAAA,MAAM0V,eAAe,GAAGT,KAAK,GAAG9O,MAAM,CAAA;EAEtC,MAAMwP,eAAe,GAAG3V,KAAK,CAACuF,MAAM,CACjCzG,CAAC,IAAK,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAACxT,OAAO,CAACwT,CAAC,CAAC,IAAI,CACvE,CAAC,CAAA;AAED,EAAA,IAAI6W,eAAe,CAAC/tB,MAAM,KAAK,CAAC,EAAE;IAChC,IAAI4tB,SAAS,GAAGP,KAAK,EAAE;AACrBO,MAAAA,SAAS,GAAGrP,MAAM,CAAC9X,IAAI,CAAC;AAAE,QAAA,CAACknB,WAAW,GAAG,CAAA;AAAE,OAAC,CAAC,CAAA;AAC/C,KAAA;IAEA,IAAIC,SAAS,KAAKrP,MAAM,EAAE;AACxBhU,MAAAA,OAAO,CAACojB,WAAW,CAAC,GAAG,CAACpjB,OAAO,CAACojB,WAAW,CAAC,IAAI,CAAC,IAAIG,eAAe,IAAIF,SAAS,GAAGrP,MAAM,CAAC,CAAA;AAC7F,KAAA;AACF,GAAA;EAEA,MAAMmJ,QAAQ,GAAGhD,QAAQ,CAACjc,UAAU,CAAC8B,OAAO,EAAErN,IAAI,CAAC,CAAA;AAEnD,EAAA,IAAI6wB,eAAe,CAAC/tB,MAAM,GAAG,CAAC,EAAE;AAC9B,IAAA,OAAO0kB,QAAQ,CAACkB,UAAU,CAACkI,eAAe,EAAE5wB,IAAI,CAAC,CAC9CwgB,OAAO,CAAC,GAAGqQ,eAAe,CAAC,CAC3BtnB,IAAI,CAACihB,QAAQ,CAAC,CAAA;AACnB,GAAC,MAAM;AACL,IAAA,OAAOA,QAAQ,CAAA;AACjB,GAAA;AACF;;ACtFA,MAAMsG,WAAW,GAAG,mDAAmD,CAAA;AAEvE,SAASC,OAAOA,CAACxf,KAAK,EAAEyf,IAAI,GAAInuB,CAAC,IAAKA,CAAC,EAAE;EACvC,OAAO;IAAE0O,KAAK;IAAE0f,KAAK,EAAEA,CAAC,CAACzzB,CAAC,CAAC,KAAKwzB,IAAI,CAACtgB,WAAW,CAAClT,CAAC,CAAC,CAAA;GAAG,CAAA;AACxD,CAAA;AAEA,MAAM0zB,IAAI,GAAGC,MAAM,CAACC,YAAY,CAAC,GAAG,CAAC,CAAA;AACrC,MAAMC,WAAW,GAAI,CAAIH,EAAAA,EAAAA,IAAK,CAAE,CAAA,CAAA,CAAA;AAChC,MAAMI,iBAAiB,GAAG,IAAI9f,MAAM,CAAC6f,WAAW,EAAE,GAAG,CAAC,CAAA;AAEtD,SAASE,YAAYA,CAAC/zB,CAAC,EAAE;AACvB;AACA;AACA,EAAA,OAAOA,CAAC,CAACwE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAACA,OAAO,CAACsvB,iBAAiB,EAAED,WAAW,CAAC,CAAA;AACzE,CAAA;AAEA,SAASG,oBAAoBA,CAACh0B,CAAC,EAAE;EAC/B,OAAOA,CAAC,CACLwE,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;AAAC,GACnBA,OAAO,CAACsvB,iBAAiB,EAAE,GAAG,CAAC;GAC/B7jB,WAAW,EAAE,CAAA;AAClB,CAAA;AAEA,SAASgkB,KAAKA,CAACC,OAAO,EAAEC,UAAU,EAAE;EAClC,IAAID,OAAO,KAAK,IAAI,EAAE;AACpB,IAAA,OAAO,IAAI,CAAA;AACb,GAAC,MAAM;IACL,OAAO;AACLngB,MAAAA,KAAK,EAAEC,MAAM,CAACkgB,OAAO,CAACjoB,GAAG,CAAC8nB,YAAY,CAAC,CAAC7nB,IAAI,CAAC,GAAG,CAAC,CAAC;MAClDunB,KAAK,EAAEA,CAAC,CAACzzB,CAAC,CAAC,KACTk0B,OAAO,CAACze,SAAS,CAAEpQ,CAAC,IAAK2uB,oBAAoB,CAACh0B,CAAC,CAAC,KAAKg0B,oBAAoB,CAAC3uB,CAAC,CAAC,CAAC,GAAG8uB,UAAAA;KACnF,CAAA;AACH,GAAA;AACF,CAAA;AAEA,SAASxxB,MAAMA,CAACoR,KAAK,EAAEqgB,MAAM,EAAE;EAC7B,OAAO;IAAErgB,KAAK;AAAE0f,IAAAA,KAAK,EAAEA,CAAC,GAAGY,CAAC,EAAErkB,CAAC,CAAC,KAAKiB,YAAY,CAACojB,CAAC,EAAErkB,CAAC,CAAC;AAAEokB,IAAAA,MAAAA;GAAQ,CAAA;AACnE,CAAA;AAEA,SAASE,MAAMA,CAACvgB,KAAK,EAAE;EACrB,OAAO;IAAEA,KAAK;AAAE0f,IAAAA,KAAK,EAAEA,CAAC,CAACzzB,CAAC,CAAC,KAAKA,CAAAA;GAAG,CAAA;AACrC,CAAA;AAEA,SAASu0B,WAAWA,CAAChvB,KAAK,EAAE;AAC1B,EAAA,OAAOA,KAAK,CAACf,OAAO,CAAC,6BAA6B,EAAE,MAAM,CAAC,CAAA;AAC7D,CAAA;;AAEA;AACA;AACA;AACA;AACA,SAASgwB,YAAYA,CAAC9V,KAAK,EAAEtU,GAAG,EAAE;AAChC,EAAA,MAAMqqB,GAAG,GAAG9gB,UAAU,CAACvJ,GAAG,CAAC;AACzBsqB,IAAAA,GAAG,GAAG/gB,UAAU,CAACvJ,GAAG,EAAE,KAAK,CAAC;AAC5BuqB,IAAAA,KAAK,GAAGhhB,UAAU,CAACvJ,GAAG,EAAE,KAAK,CAAC;AAC9BwqB,IAAAA,IAAI,GAAGjhB,UAAU,CAACvJ,GAAG,EAAE,KAAK,CAAC;AAC7ByqB,IAAAA,GAAG,GAAGlhB,UAAU,CAACvJ,GAAG,EAAE,KAAK,CAAC;AAC5B0qB,IAAAA,QAAQ,GAAGnhB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;AACnC2qB,IAAAA,UAAU,GAAGphB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;AACrC4qB,IAAAA,QAAQ,GAAGrhB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;AACnC6qB,IAAAA,SAAS,GAAGthB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;AACpC8qB,IAAAA,SAAS,GAAGvhB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;AACpC+qB,IAAAA,SAAS,GAAGxhB,UAAU,CAACvJ,GAAG,EAAE,OAAO,CAAC;IACpCuU,OAAO,GAAItK,CAAC,KAAM;MAAEN,KAAK,EAAEC,MAAM,CAACugB,WAAW,CAAClgB,CAAC,CAACuK,GAAG,CAAC,CAAC;AAAE6U,MAAAA,KAAK,EAAEA,CAAC,CAACzzB,CAAC,CAAC,KAAKA,CAAC;AAAE2e,MAAAA,OAAO,EAAE,IAAA;AAAK,KAAC,CAAC;IAC1FyW,OAAO,GAAI/gB,CAAC,IAAK;MACf,IAAIqK,KAAK,CAACC,OAAO,EAAE;QACjB,OAAOA,OAAO,CAACtK,CAAC,CAAC,CAAA;AACnB,OAAA;MACA,QAAQA,CAAC,CAACuK,GAAG;AACX;AACA,QAAA,KAAK,GAAG;UACN,OAAOqV,KAAK,CAAC7pB,GAAG,CAACsF,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;AACpC,QAAA,KAAK,IAAI;UACP,OAAOukB,KAAK,CAAC7pB,GAAG,CAACsF,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;AACnC;AACA,QAAA,KAAK,GAAG;UACN,OAAO6jB,OAAO,CAACyB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;AACP,UAAA,OAAOzB,OAAO,CAAC2B,SAAS,EAAE1Z,cAAc,CAAC,CAAA;AAC3C,QAAA,KAAK,MAAM;UACT,OAAO+X,OAAO,CAACqB,IAAI,CAAC,CAAA;AACtB,QAAA,KAAK,OAAO;UACV,OAAOrB,OAAO,CAAC4B,SAAS,CAAC,CAAA;AAC3B,QAAA,KAAK,QAAQ;UACX,OAAO5B,OAAO,CAACsB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOtB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOT,KAAK,CAAC7pB,GAAG,CAAC8E,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC5C,QAAA,KAAK,MAAM;AACT,UAAA,OAAO+kB,KAAK,CAAC7pB,GAAG,CAAC8E,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC3C,QAAA,KAAK,GAAG;UACN,OAAOqkB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOT,KAAK,CAAC7pB,GAAG,CAAC8E,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC7C,QAAA,KAAK,MAAM;AACT,UAAA,OAAO+kB,KAAK,CAAC7pB,GAAG,CAAC8E,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC5C;AACA,QAAA,KAAK,GAAG;UACN,OAAOqkB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;AAC5B,QAAA,KAAK,KAAK;UACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;AACvB;AACA,QAAA,KAAK,IAAI;UACP,OAAOpB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,GAAG;UACN,OAAOvB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACwB,UAAU,CAAC,CAAA;AAC5B,QAAA,KAAK,KAAK;UACR,OAAOxB,OAAO,CAACoB,KAAK,CAAC,CAAA;AACvB,QAAA,KAAK,GAAG;UACN,OAAOL,MAAM,CAACW,SAAS,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOX,MAAM,CAACQ,QAAQ,CAAC,CAAA;AACzB,QAAA,KAAK,KAAK;UACR,OAAOvB,OAAO,CAACkB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG;UACN,OAAOR,KAAK,CAAC7pB,GAAG,CAACqF,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;AAClC;AACA,QAAA,KAAK,MAAM;UACT,OAAO8jB,OAAO,CAACqB,IAAI,CAAC,CAAA;AACtB,QAAA,KAAK,IAAI;AACP,UAAA,OAAOrB,OAAO,CAAC2B,SAAS,EAAE1Z,cAAc,CAAC,CAAA;AAC3C;AACA,QAAA,KAAK,GAAG;UACN,OAAO+X,OAAO,CAACuB,QAAQ,CAAC,CAAA;AAC1B,QAAA,KAAK,IAAI;UACP,OAAOvB,OAAO,CAACmB,GAAG,CAAC,CAAA;AACrB;AACA,QAAA,KAAK,GAAG,CAAA;AACR,QAAA,KAAK,GAAG;UACN,OAAOnB,OAAO,CAACkB,GAAG,CAAC,CAAA;AACrB,QAAA,KAAK,KAAK;AACR,UAAA,OAAOR,KAAK,CAAC7pB,GAAG,CAACoF,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/C,QAAA,KAAK,MAAM;AACT,UAAA,OAAOykB,KAAK,CAAC7pB,GAAG,CAACoF,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9C,QAAA,KAAK,KAAK;AACR,UAAA,OAAOykB,KAAK,CAAC7pB,GAAG,CAACoF,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9C,QAAA,KAAK,MAAM;AACT,UAAA,OAAOykB,KAAK,CAAC7pB,GAAG,CAACoF,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC7C;AACA,QAAA,KAAK,GAAG,CAAA;AACR,QAAA,KAAK,IAAI;AACP,UAAA,OAAO7M,MAAM,CAAC,IAAIqR,MAAM,CAAE,QAAO8gB,QAAQ,CAACtR,MAAO,CAAA,MAAA,EAAQkR,GAAG,CAAClR,MAAO,KAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAC/E,QAAA,KAAK,KAAK;AACR,UAAA,OAAO7gB,MAAM,CAAC,IAAIqR,MAAM,CAAE,QAAO8gB,QAAQ,CAACtR,MAAO,CAAA,EAAA,EAAIkR,GAAG,CAAClR,MAAO,IAAG,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1E;AACA;AACA,QAAA,KAAK,GAAG;UACN,OAAO8Q,MAAM,CAAC,oBAAoB,CAAC,CAAA;AACrC;AACA;AACA,QAAA,KAAK,GAAG;UACN,OAAOA,MAAM,CAAC,WAAW,CAAC,CAAA;AAC5B,QAAA;UACE,OAAO3V,OAAO,CAACtK,CAAC,CAAC,CAAA;AACrB,OAAA;KACD,CAAA;AAEH,EAAA,MAAMzU,IAAI,GAAGw1B,OAAO,CAAC1W,KAAK,CAAC,IAAI;AAC7BoO,IAAAA,aAAa,EAAEwG,WAAAA;GAChB,CAAA;EAED1zB,IAAI,CAAC8e,KAAK,GAAGA,KAAK,CAAA;AAElB,EAAA,OAAO9e,IAAI,CAAA;AACb,CAAA;AAEA,MAAMy1B,uBAAuB,GAAG;AAC9Bl1B,EAAAA,IAAI,EAAE;AACJ,IAAA,SAAS,EAAE,IAAI;AACf0M,IAAAA,OAAO,EAAE,OAAA;GACV;AACDzM,EAAAA,KAAK,EAAE;AACLyM,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAI;AACfyoB,IAAAA,KAAK,EAAE,KAAK;AACZC,IAAAA,IAAI,EAAE,MAAA;GACP;AACDl1B,EAAAA,GAAG,EAAE;AACHwM,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACDrM,EAAAA,OAAO,EAAE;AACP80B,IAAAA,KAAK,EAAE,KAAK;AACZC,IAAAA,IAAI,EAAE,MAAA;GACP;AACDC,EAAAA,SAAS,EAAE,GAAG;AACdC,EAAAA,SAAS,EAAE,GAAG;AACdxxB,EAAAA,MAAM,EAAE;AACN4I,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACD6oB,EAAAA,MAAM,EAAE;AACN7oB,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACDhM,EAAAA,MAAM,EAAE;AACNgM,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACD9L,EAAAA,MAAM,EAAE;AACN8L,IAAAA,OAAO,EAAE,GAAG;AACZ,IAAA,SAAS,EAAE,IAAA;GACZ;AACD5L,EAAAA,YAAY,EAAE;AACZs0B,IAAAA,IAAI,EAAE,OAAO;AACbD,IAAAA,KAAK,EAAE,KAAA;AACT,GAAA;AACF,CAAC,CAAA;AAED,SAASK,YAAYA,CAACtpB,IAAI,EAAEqU,UAAU,EAAEkV,YAAY,EAAE;EACpD,MAAM;IAAE1zB,IAAI;AAAEqD,IAAAA,KAAAA;AAAM,GAAC,GAAG8G,IAAI,CAAA;EAE5B,IAAInK,IAAI,KAAK,SAAS,EAAE;AACtB,IAAA,MAAM2zB,OAAO,GAAG,OAAO,CAACpV,IAAI,CAAClb,KAAK,CAAC,CAAA;IACnC,OAAO;MACLoZ,OAAO,EAAE,CAACkX,OAAO;AACjBjX,MAAAA,GAAG,EAAEiX,OAAO,GAAG,GAAG,GAAGtwB,KAAAA;KACtB,CAAA;AACH,GAAA;AAEA,EAAA,MAAMiH,KAAK,GAAGkU,UAAU,CAACxe,IAAI,CAAC,CAAA;;AAE9B;AACA;AACA;EACA,IAAI4zB,UAAU,GAAG5zB,IAAI,CAAA;EACrB,IAAIA,IAAI,KAAK,MAAM,EAAE;AACnB,IAAA,IAAIwe,UAAU,CAACzc,MAAM,IAAI,IAAI,EAAE;AAC7B6xB,MAAAA,UAAU,GAAGpV,UAAU,CAACzc,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;AACtD,KAAC,MAAM,IAAIyc,UAAU,CAACtf,SAAS,IAAI,IAAI,EAAE;MACvC,IAAIsf,UAAU,CAACtf,SAAS,KAAK,KAAK,IAAIsf,UAAU,CAACtf,SAAS,KAAK,KAAK,EAAE;AACpE00B,QAAAA,UAAU,GAAG,QAAQ,CAAA;AACvB,OAAC,MAAM;AACLA,QAAAA,UAAU,GAAG,QAAQ,CAAA;AACvB,OAAA;AACF,KAAC,MAAM;AACL;AACA;AACAA,MAAAA,UAAU,GAAGF,YAAY,CAAC3xB,MAAM,GAAG,QAAQ,GAAG,QAAQ,CAAA;AACxD,KAAA;AACF,GAAA;AACA,EAAA,IAAI2a,GAAG,GAAGyW,uBAAuB,CAACS,UAAU,CAAC,CAAA;AAC7C,EAAA,IAAI,OAAOlX,GAAG,KAAK,QAAQ,EAAE;AAC3BA,IAAAA,GAAG,GAAGA,GAAG,CAACpS,KAAK,CAAC,CAAA;AAClB,GAAA;AAEA,EAAA,IAAIoS,GAAG,EAAE;IACP,OAAO;AACLD,MAAAA,OAAO,EAAE,KAAK;AACdC,MAAAA,GAAAA;KACD,CAAA;AACH,GAAA;AAEA,EAAA,OAAO5a,SAAS,CAAA;AAClB,CAAA;AAEA,SAAS+xB,UAAUA,CAACrY,KAAK,EAAE;AACzB,EAAA,MAAMsY,EAAE,GAAGtY,KAAK,CAACzR,GAAG,CAAEuQ,CAAC,IAAKA,CAAC,CAACzI,KAAK,CAAC,CAACkF,MAAM,CAAC,CAACrP,CAAC,EAAEmH,CAAC,KAAM,CAAEnH,EAAAA,CAAE,CAAGmH,CAAAA,EAAAA,CAAC,CAACyS,MAAO,CAAE,CAAA,CAAA,EAAE,EAAE,CAAC,CAAA;AAC9E,EAAA,OAAO,CAAE,CAAGwS,CAAAA,EAAAA,EAAG,CAAE,CAAA,CAAA,EAAEtY,KAAK,CAAC,CAAA;AAC3B,CAAA;AAEA,SAAS1M,KAAKA,CAACI,KAAK,EAAE2C,KAAK,EAAEkiB,QAAQ,EAAE;AACrC,EAAA,MAAMC,OAAO,GAAG9kB,KAAK,CAACJ,KAAK,CAAC+C,KAAK,CAAC,CAAA;AAElC,EAAA,IAAImiB,OAAO,EAAE;IACX,MAAMC,GAAG,GAAG,EAAE,CAAA;IACd,IAAIC,UAAU,GAAG,CAAC,CAAA;AAClB,IAAA,KAAK,MAAM/wB,CAAC,IAAI4wB,QAAQ,EAAE;AACxB,MAAA,IAAIzc,cAAc,CAACyc,QAAQ,EAAE5wB,CAAC,CAAC,EAAE;AAC/B,QAAA,MAAMgvB,CAAC,GAAG4B,QAAQ,CAAC5wB,CAAC,CAAC;UACnB+uB,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAGC,CAAC,CAACD,MAAM,GAAG,CAAC,GAAG,CAAC,CAAA;QACtC,IAAI,CAACC,CAAC,CAAC1V,OAAO,IAAI0V,CAAC,CAAC3V,KAAK,EAAE;UACzByX,GAAG,CAAC9B,CAAC,CAAC3V,KAAK,CAACE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAGyV,CAAC,CAACZ,KAAK,CAACyC,OAAO,CAACpU,KAAK,CAACsU,UAAU,EAAEA,UAAU,GAAGhC,MAAM,CAAC,CAAC,CAAA;AAC/E,SAAA;AACAgC,QAAAA,UAAU,IAAIhC,MAAM,CAAA;AACtB,OAAA;AACF,KAAA;AACA,IAAA,OAAO,CAAC8B,OAAO,EAAEC,GAAG,CAAC,CAAA;AACvB,GAAC,MAAM;AACL,IAAA,OAAO,CAACD,OAAO,EAAE,EAAE,CAAC,CAAA;AACtB,GAAA;AACF,CAAA;AAEA,SAASG,mBAAmBA,CAACH,OAAO,EAAE;EACpC,MAAMI,OAAO,GAAI5X,KAAK,IAAK;AACzB,IAAA,QAAQA,KAAK;AACX,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,aAAa,CAAA;AACtB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,QAAQ,CAAA;AACjB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,QAAQ,CAAA;AACjB,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,MAAM,CAAA;AACf,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,KAAK,CAAA;AACd,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,OAAO,CAAA;AAChB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,MAAM,CAAA;AACf,MAAA,KAAK,GAAG,CAAA;AACR,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,YAAY,CAAA;AACrB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,UAAU,CAAA;AACnB,MAAA,KAAK,GAAG;AACN,QAAA,OAAO,SAAS,CAAA;AAClB,MAAA;AACE,QAAA,OAAO,IAAI,CAAA;AACf,KAAA;GACD,CAAA;EAED,IAAI5Y,IAAI,GAAG,IAAI,CAAA;AACf,EAAA,IAAIywB,cAAc,CAAA;AAClB,EAAA,IAAI,CAAC9wB,WAAW,CAACywB,OAAO,CAACvqB,CAAC,CAAC,EAAE;IAC3B7F,IAAI,GAAGF,QAAQ,CAACC,MAAM,CAACqwB,OAAO,CAACvqB,CAAC,CAAC,CAAA;AACnC,GAAA;AAEA,EAAA,IAAI,CAAClG,WAAW,CAACywB,OAAO,CAACM,CAAC,CAAC,EAAE;IAC3B,IAAI,CAAC1wB,IAAI,EAAE;AACTA,MAAAA,IAAI,GAAG,IAAI8K,eAAe,CAACslB,OAAO,CAACM,CAAC,CAAC,CAAA;AACvC,KAAA;IACAD,cAAc,GAAGL,OAAO,CAACM,CAAC,CAAA;AAC5B,GAAA;AAEA,EAAA,IAAI,CAAC/wB,WAAW,CAACywB,OAAO,CAACO,CAAC,CAAC,EAAE;AAC3BP,IAAAA,OAAO,CAACQ,CAAC,GAAG,CAACR,OAAO,CAACO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACrC,GAAA;AAEA,EAAA,IAAI,CAAChxB,WAAW,CAACywB,OAAO,CAAC7B,CAAC,CAAC,EAAE;IAC3B,IAAI6B,OAAO,CAAC7B,CAAC,GAAG,EAAE,IAAI6B,OAAO,CAAC5c,CAAC,KAAK,CAAC,EAAE;MACrC4c,OAAO,CAAC7B,CAAC,IAAI,EAAE,CAAA;AACjB,KAAC,MAAM,IAAI6B,OAAO,CAAC7B,CAAC,KAAK,EAAE,IAAI6B,OAAO,CAAC5c,CAAC,KAAK,CAAC,EAAE;MAC9C4c,OAAO,CAAC7B,CAAC,GAAG,CAAC,CAAA;AACf,KAAA;AACF,GAAA;EAEA,IAAI6B,OAAO,CAACS,CAAC,KAAK,CAAC,IAAIT,OAAO,CAACU,CAAC,EAAE;AAChCV,IAAAA,OAAO,CAACU,CAAC,GAAG,CAACV,OAAO,CAACU,CAAC,CAAA;AACxB,GAAA;AAEA,EAAA,IAAI,CAACnxB,WAAW,CAACywB,OAAO,CAAC1Z,CAAC,CAAC,EAAE;IAC3B0Z,OAAO,CAACW,CAAC,GAAGrc,WAAW,CAAC0b,OAAO,CAAC1Z,CAAC,CAAC,CAAA;AACpC,GAAA;AAEA,EAAA,MAAM0N,IAAI,GAAGjf,MAAM,CAACC,IAAI,CAACgrB,OAAO,CAAC,CAACjd,MAAM,CAAC,CAAClI,CAAC,EAAEwI,CAAC,KAAK;AACjD,IAAA,MAAM3P,CAAC,GAAG0sB,OAAO,CAAC/c,CAAC,CAAC,CAAA;AACpB,IAAA,IAAI3P,CAAC,EAAE;AACLmH,MAAAA,CAAC,CAACnH,CAAC,CAAC,GAAGssB,OAAO,CAAC3c,CAAC,CAAC,CAAA;AACnB,KAAA;AAEA,IAAA,OAAOxI,CAAC,CAAA;GACT,EAAE,EAAE,CAAC,CAAA;AAEN,EAAA,OAAO,CAACmZ,IAAI,EAAEpkB,IAAI,EAAEywB,cAAc,CAAC,CAAA;AACrC,CAAA;AAEA,IAAIO,kBAAkB,GAAG,IAAI,CAAA;AAE7B,SAASC,gBAAgBA,GAAG;EAC1B,IAAI,CAACD,kBAAkB,EAAE;AACvBA,IAAAA,kBAAkB,GAAG/sB,QAAQ,CAACmhB,UAAU,CAAC,aAAa,CAAC,CAAA;AACzD,GAAA;AAEA,EAAA,OAAO4L,kBAAkB,CAAA;AAC3B,CAAA;AAEA,SAASE,qBAAqBA,CAACtY,KAAK,EAAEpb,MAAM,EAAE;EAC5C,IAAIob,KAAK,CAACC,OAAO,EAAE;AACjB,IAAA,OAAOD,KAAK,CAAA;AACd,GAAA;EAEA,MAAMgC,UAAU,GAAGT,SAAS,CAACpB,sBAAsB,CAACH,KAAK,CAACE,GAAG,CAAC,CAAA;AAC9D,EAAA,MAAM+D,MAAM,GAAGsU,kBAAkB,CAACvW,UAAU,EAAEpd,MAAM,CAAC,CAAA;EAErD,IAAIqf,MAAM,IAAI,IAAI,IAAIA,MAAM,CAACjZ,QAAQ,CAAC1F,SAAS,CAAC,EAAE;AAChD,IAAA,OAAO0a,KAAK,CAAA;AACd,GAAA;AAEA,EAAA,OAAOiE,MAAM,CAAA;AACf,CAAA;AAEO,SAASuU,iBAAiBA,CAACvU,MAAM,EAAErf,MAAM,EAAE;EAChD,OAAOqV,KAAK,CAACJ,SAAS,CAACuK,MAAM,CAAC,GAAGH,MAAM,CAAC1W,GAAG,CAAEoI,CAAC,IAAK2iB,qBAAqB,CAAC3iB,CAAC,EAAE/Q,MAAM,CAAC,CAAC,CAAC,CAAA;AACvF,CAAA;;AAEA;AACA;AACA;;AAEO,MAAM6zB,WAAW,CAAC;AACvB93B,EAAAA,WAAWA,CAACiE,MAAM,EAAEZ,MAAM,EAAE;IAC1B,IAAI,CAACY,MAAM,GAAGA,MAAM,CAAA;IACpB,IAAI,CAACZ,MAAM,GAAGA,MAAM,CAAA;AACpB,IAAA,IAAI,CAACigB,MAAM,GAAGuU,iBAAiB,CAACjX,SAAS,CAACC,WAAW,CAACxd,MAAM,CAAC,EAAEY,MAAM,CAAC,CAAA;AACtE,IAAA,IAAI,CAACoa,KAAK,GAAG,IAAI,CAACiF,MAAM,CAAC1W,GAAG,CAAEoI,CAAC,IAAKmgB,YAAY,CAACngB,CAAC,EAAE/Q,MAAM,CAAC,CAAC,CAAA;AAC5D,IAAA,IAAI,CAAC8zB,iBAAiB,GAAG,IAAI,CAAC1Z,KAAK,CAAC3N,IAAI,CAAEsE,CAAC,IAAKA,CAAC,CAACyY,aAAa,CAAC,CAAA;AAEhE,IAAA,IAAI,CAAC,IAAI,CAACsK,iBAAiB,EAAE;MAC3B,MAAM,CAACC,WAAW,EAAEpB,QAAQ,CAAC,GAAGF,UAAU,CAAC,IAAI,CAACrY,KAAK,CAAC,CAAA;MACtD,IAAI,CAAC3J,KAAK,GAAGC,MAAM,CAACqjB,WAAW,EAAE,GAAG,CAAC,CAAA;MACrC,IAAI,CAACpB,QAAQ,GAAGA,QAAQ,CAAA;AAC1B,KAAA;AACF,GAAA;EAEAqB,iBAAiBA,CAAClmB,KAAK,EAAE;AACvB,IAAA,IAAI,CAAC,IAAI,CAACtO,OAAO,EAAE;MACjB,OAAO;QAAEsO,KAAK;QAAEuR,MAAM,EAAE,IAAI,CAACA,MAAM;QAAEmK,aAAa,EAAE,IAAI,CAACA,aAAAA;OAAe,CAAA;AAC1E,KAAC,MAAM;AACL,MAAA,MAAM,CAACyK,UAAU,EAAErB,OAAO,CAAC,GAAGllB,KAAK,CAACI,KAAK,EAAE,IAAI,CAAC2C,KAAK,EAAE,IAAI,CAACkiB,QAAQ,CAAC;QACnE,CAAC3O,MAAM,EAAExhB,IAAI,EAAEywB,cAAc,CAAC,GAAGL,OAAO,GACpCG,mBAAmB,CAACH,OAAO,CAAC,GAC5B,CAAC,IAAI,EAAE,IAAI,EAAElyB,SAAS,CAAC,CAAA;AAC7B,MAAA,IAAIwV,cAAc,CAAC0c,OAAO,EAAE,GAAG,CAAC,IAAI1c,cAAc,CAAC0c,OAAO,EAAE,GAAG,CAAC,EAAE;AAChE,QAAA,MAAM,IAAIx2B,6BAA6B,CACrC,uDACF,CAAC,CAAA;AACH,OAAA;MACA,OAAO;QACL0R,KAAK;QACLuR,MAAM,EAAE,IAAI,CAACA,MAAM;QACnB5O,KAAK,EAAE,IAAI,CAACA,KAAK;QACjBwjB,UAAU;QACVrB,OAAO;QACP5O,MAAM;QACNxhB,IAAI;AACJywB,QAAAA,cAAAA;OACD,CAAA;AACH,KAAA;AACF,GAAA;EAEA,IAAIzzB,OAAOA,GAAG;IACZ,OAAO,CAAC,IAAI,CAACs0B,iBAAiB,CAAA;AAChC,GAAA;EAEA,IAAItK,aAAaA,GAAG;IAClB,OAAO,IAAI,CAACsK,iBAAiB,GAAG,IAAI,CAACA,iBAAiB,CAACtK,aAAa,GAAG,IAAI,CAAA;AAC7E,GAAA;AACF,CAAA;AAEO,SAASwK,iBAAiBA,CAACh0B,MAAM,EAAE8N,KAAK,EAAE1O,MAAM,EAAE;EACvD,MAAM80B,MAAM,GAAG,IAAIL,WAAW,CAAC7zB,MAAM,EAAEZ,MAAM,CAAC,CAAA;AAC9C,EAAA,OAAO80B,MAAM,CAACF,iBAAiB,CAAClmB,KAAK,CAAC,CAAA;AACxC,CAAA;AAEO,SAASqmB,eAAeA,CAACn0B,MAAM,EAAE8N,KAAK,EAAE1O,MAAM,EAAE;EACrD,MAAM;IAAE4kB,MAAM;IAAExhB,IAAI;IAAEywB,cAAc;AAAEzJ,IAAAA,aAAAA;GAAe,GAAGwK,iBAAiB,CAACh0B,MAAM,EAAE8N,KAAK,EAAE1O,MAAM,CAAC,CAAA;EAChG,OAAO,CAAC4kB,MAAM,EAAExhB,IAAI,EAAEywB,cAAc,EAAEzJ,aAAa,CAAC,CAAA;AACtD,CAAA;AAEO,SAASmK,kBAAkBA,CAACvW,UAAU,EAAEpd,MAAM,EAAE;EACrD,IAAI,CAACod,UAAU,EAAE;AACf,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;EAEA,MAAMgX,SAAS,GAAGzX,SAAS,CAACpa,MAAM,CAACvC,MAAM,EAAEod,UAAU,CAAC,CAAA;EACtD,MAAM9Q,EAAE,GAAG8nB,SAAS,CAACnoB,WAAW,CAACwnB,gBAAgB,EAAE,CAAC,CAAA;AACpD,EAAA,MAAM3qB,KAAK,GAAGwD,EAAE,CAACzK,aAAa,EAAE,CAAA;AAChC,EAAA,MAAMywB,YAAY,GAAGhmB,EAAE,CAACxM,eAAe,EAAE,CAAA;AACzC,EAAA,OAAOgJ,KAAK,CAACH,GAAG,CAAEoV,CAAC,IAAKsU,YAAY,CAACtU,CAAC,EAAEX,UAAU,EAAEkV,YAAY,CAAC,CAAC,CAAA;AACpE;;ACncA,MAAMxM,OAAO,GAAG,kBAAkB,CAAA;AAClC,MAAMuO,QAAQ,GAAG,OAAO,CAAA;AAExB,SAASC,eAAeA,CAAC9xB,IAAI,EAAE;EAC7B,OAAO,IAAIyO,OAAO,CAAC,kBAAkB,EAAG,aAAYzO,IAAI,CAAC3D,IAAK,CAAA,kBAAA,CAAmB,CAAC,CAAA;AACpF,CAAA;;AAEA;AACA;AACA;AACA;AACA,SAAS01B,sBAAsBA,CAAC/tB,EAAE,EAAE;AAClC,EAAA,IAAIA,EAAE,CAACuM,QAAQ,KAAK,IAAI,EAAE;IACxBvM,EAAE,CAACuM,QAAQ,GAAGR,eAAe,CAAC/L,EAAE,CAACyW,CAAC,CAAC,CAAA;AACrC,GAAA;EACA,OAAOzW,EAAE,CAACuM,QAAQ,CAAA;AACpB,CAAA;;AAEA;AACA;AACA;AACA,SAASyhB,2BAA2BA,CAAChuB,EAAE,EAAE;AACvC,EAAA,IAAIA,EAAE,CAACiuB,aAAa,KAAK,IAAI,EAAE;IAC7BjuB,EAAE,CAACiuB,aAAa,GAAGliB,eAAe,CAChC/L,EAAE,CAACyW,CAAC,EACJzW,EAAE,CAACM,GAAG,CAACoG,qBAAqB,EAAE,EAC9B1G,EAAE,CAACM,GAAG,CAACmG,cAAc,EACvB,CAAC,CAAA;AACH,GAAA;EACA,OAAOzG,EAAE,CAACiuB,aAAa,CAAA;AACzB,CAAA;;AAEA;AACA;AACA,SAASlpB,KAAKA,CAACmpB,IAAI,EAAElpB,IAAI,EAAE;AACzB,EAAA,MAAMsR,OAAO,GAAG;IACd7d,EAAE,EAAEy1B,IAAI,CAACz1B,EAAE;IACXuD,IAAI,EAAEkyB,IAAI,CAAClyB,IAAI;IACfya,CAAC,EAAEyX,IAAI,CAACzX,CAAC;IACTlI,CAAC,EAAE2f,IAAI,CAAC3f,CAAC;IACTjO,GAAG,EAAE4tB,IAAI,CAAC5tB,GAAG;IACb4gB,OAAO,EAAEgN,IAAI,CAAChN,OAAAA;GACf,CAAA;EACD,OAAO,IAAIjhB,QAAQ,CAAC;AAAE,IAAA,GAAGqW,OAAO;AAAE,IAAA,GAAGtR,IAAI;AAAEmpB,IAAAA,GAAG,EAAE7X,OAAAA;AAAQ,GAAC,CAAC,CAAA;AAC5D,CAAA;;AAEA;AACA;AACA,SAAS8X,SAASA,CAACC,OAAO,EAAE9f,CAAC,EAAE+f,EAAE,EAAE;AACjC;EACA,IAAIC,QAAQ,GAAGF,OAAO,GAAG9f,CAAC,GAAG,EAAE,GAAG,IAAI,CAAA;;AAEtC;AACA,EAAA,MAAMigB,EAAE,GAAGF,EAAE,CAACz1B,MAAM,CAAC01B,QAAQ,CAAC,CAAA;;AAE9B;EACA,IAAIhgB,CAAC,KAAKigB,EAAE,EAAE;AACZ,IAAA,OAAO,CAACD,QAAQ,EAAEhgB,CAAC,CAAC,CAAA;AACtB,GAAA;;AAEA;EACAggB,QAAQ,IAAI,CAACC,EAAE,GAAGjgB,CAAC,IAAI,EAAE,GAAG,IAAI,CAAA;;AAEhC;AACA,EAAA,MAAMkgB,EAAE,GAAGH,EAAE,CAACz1B,MAAM,CAAC01B,QAAQ,CAAC,CAAA;EAC9B,IAAIC,EAAE,KAAKC,EAAE,EAAE;AACb,IAAA,OAAO,CAACF,QAAQ,EAAEC,EAAE,CAAC,CAAA;AACvB,GAAA;;AAEA;EACA,OAAO,CAACH,OAAO,GAAG3xB,IAAI,CAAC+M,GAAG,CAAC+kB,EAAE,EAAEC,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE/xB,IAAI,CAACgN,GAAG,CAAC8kB,EAAE,EAAEC,EAAE,CAAC,CAAC,CAAA;AACnE,CAAA;;AAEA;AACA,SAASC,OAAOA,CAACj2B,EAAE,EAAEI,MAAM,EAAE;AAC3BJ,EAAAA,EAAE,IAAII,MAAM,GAAG,EAAE,GAAG,IAAI,CAAA;AAExB,EAAA,MAAMkS,CAAC,GAAG,IAAIrR,IAAI,CAACjB,EAAE,CAAC,CAAA;EAEtB,OAAO;AACLpC,IAAAA,IAAI,EAAE0U,CAAC,CAACG,cAAc,EAAE;AACxB5U,IAAAA,KAAK,EAAEyU,CAAC,CAAC4jB,WAAW,EAAE,GAAG,CAAC;AAC1Bp4B,IAAAA,GAAG,EAAEwU,CAAC,CAAC6jB,UAAU,EAAE;AACnB93B,IAAAA,IAAI,EAAEiU,CAAC,CAAC8jB,WAAW,EAAE;AACrB93B,IAAAA,MAAM,EAAEgU,CAAC,CAAC+jB,aAAa,EAAE;AACzB73B,IAAAA,MAAM,EAAE8T,CAAC,CAACgkB,aAAa,EAAE;AACzBhyB,IAAAA,WAAW,EAAEgO,CAAC,CAACikB,kBAAkB,EAAC;GACnC,CAAA;AACH,CAAA;;AAEA;AACA,SAASC,OAAOA,CAACjiB,GAAG,EAAEnU,MAAM,EAAEmD,IAAI,EAAE;EAClC,OAAOoyB,SAAS,CAACtxB,YAAY,CAACkQ,GAAG,CAAC,EAAEnU,MAAM,EAAEmD,IAAI,CAAC,CAAA;AACnD,CAAA;;AAEA;AACA,SAASkzB,UAAUA,CAAChB,IAAI,EAAE/V,GAAG,EAAE;AAC7B,EAAA,MAAMgX,IAAI,GAAGjB,IAAI,CAAC3f,CAAC;AACjBlY,IAAAA,IAAI,GAAG63B,IAAI,CAACzX,CAAC,CAACpgB,IAAI,GAAGqG,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACtE,KAAK,CAAC;IAC1Cvd,KAAK,GAAG43B,IAAI,CAACzX,CAAC,CAACngB,KAAK,GAAGoG,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAAC/S,MAAM,CAAC,GAAG1I,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACrE,QAAQ,CAAC,GAAG,CAAC;AAC5E2C,IAAAA,CAAC,GAAG;MACF,GAAGyX,IAAI,CAACzX,CAAC;MACTpgB,IAAI;MACJC,KAAK;AACLC,MAAAA,GAAG,EACDmG,IAAI,CAAC+M,GAAG,CAACykB,IAAI,CAACzX,CAAC,CAAClgB,GAAG,EAAE0X,WAAW,CAAC5X,IAAI,EAAEC,KAAK,CAAC,CAAC,GAC9CoG,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACnE,IAAI,CAAC,GACpBtX,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACpE,KAAK,CAAC,GAAG,CAAA;KAC3B;AACDqb,IAAAA,WAAW,GAAGlP,QAAQ,CAACjc,UAAU,CAAC;AAChC4P,MAAAA,KAAK,EAAEsE,GAAG,CAACtE,KAAK,GAAGnX,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACtE,KAAK,CAAC;AACxCC,MAAAA,QAAQ,EAAEqE,GAAG,CAACrE,QAAQ,GAAGpX,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACrE,QAAQ,CAAC;AACjD1O,MAAAA,MAAM,EAAE+S,GAAG,CAAC/S,MAAM,GAAG1I,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAAC/S,MAAM,CAAC;AAC3C2O,MAAAA,KAAK,EAAEoE,GAAG,CAACpE,KAAK,GAAGrX,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACpE,KAAK,CAAC;AACxCC,MAAAA,IAAI,EAAEmE,GAAG,CAACnE,IAAI,GAAGtX,IAAI,CAACuU,KAAK,CAACkH,GAAG,CAACnE,IAAI,CAAC;MACrCrB,KAAK,EAAEwF,GAAG,CAACxF,KAAK;MAChBzQ,OAAO,EAAEiW,GAAG,CAACjW,OAAO;MACpB+R,OAAO,EAAEkE,GAAG,CAAClE,OAAO;MACpBuH,YAAY,EAAErD,GAAG,CAACqD,YAAAA;AACpB,KAAC,CAAC,CAACiI,EAAE,CAAC,cAAc,CAAC;AACrB4K,IAAAA,OAAO,GAAGvxB,YAAY,CAAC2Z,CAAC,CAAC,CAAA;AAE3B,EAAA,IAAI,CAAChe,EAAE,EAAE8V,CAAC,CAAC,GAAG6f,SAAS,CAACC,OAAO,EAAEc,IAAI,EAAEjB,IAAI,CAAClyB,IAAI,CAAC,CAAA;EAEjD,IAAIozB,WAAW,KAAK,CAAC,EAAE;AACrB32B,IAAAA,EAAE,IAAI22B,WAAW,CAAA;AACjB;IACA7gB,CAAC,GAAG2f,IAAI,CAAClyB,IAAI,CAACnD,MAAM,CAACJ,EAAE,CAAC,CAAA;AAC1B,GAAA;EAEA,OAAO;IAAEA,EAAE;AAAE8V,IAAAA,CAAAA;GAAG,CAAA;AAClB,CAAA;;AAEA;AACA;AACA,SAAS8gB,mBAAmBA,CAAC10B,MAAM,EAAE20B,UAAU,EAAE52B,IAAI,EAAEE,MAAM,EAAE8oB,IAAI,EAAE+K,cAAc,EAAE;EACnF,MAAM;IAAEzqB,OAAO;AAAEhG,IAAAA,IAAAA;AAAK,GAAC,GAAGtD,IAAI,CAAA;AAC9B,EAAA,IAAKiC,MAAM,IAAIwG,MAAM,CAACC,IAAI,CAACzG,MAAM,CAAC,CAACa,MAAM,KAAK,CAAC,IAAK8zB,UAAU,EAAE;AAC9D,IAAA,MAAMC,kBAAkB,GAAGD,UAAU,IAAItzB,IAAI;AAC3CkyB,MAAAA,IAAI,GAAGjuB,QAAQ,CAACgE,UAAU,CAACtJ,MAAM,EAAE;AACjC,QAAA,GAAGjC,IAAI;AACPsD,QAAAA,IAAI,EAAEuzB,kBAAkB;AACxB9C,QAAAA,cAAAA;AACF,OAAC,CAAC,CAAA;IACJ,OAAOzqB,OAAO,GAAGksB,IAAI,GAAGA,IAAI,CAAClsB,OAAO,CAAChG,IAAI,CAAC,CAAA;AAC5C,GAAC,MAAM;AACL,IAAA,OAAOiE,QAAQ,CAACihB,OAAO,CACrB,IAAIzW,OAAO,CAAC,YAAY,EAAG,cAAaiX,IAAK,CAAA,qBAAA,EAAuB9oB,MAAO,CAAA,CAAC,CAC9E,CAAC,CAAA;AACH,GAAA;AACF,CAAA;;AAEA;AACA;AACA,SAAS42B,YAAYA,CAACxvB,EAAE,EAAEpH,MAAM,EAAEif,MAAM,GAAG,IAAI,EAAE;AAC/C,EAAA,OAAO7X,EAAE,CAAChH,OAAO,GACbmd,SAAS,CAACpa,MAAM,CAAC4C,MAAM,CAAC5C,MAAM,CAAC,OAAO,CAAC,EAAE;IACvC8b,MAAM;AACN9W,IAAAA,WAAW,EAAE,IAAA;GACd,CAAC,CAAC0W,wBAAwB,CAACzX,EAAE,EAAEpH,MAAM,CAAC,GACvC,IAAI,CAAA;AACV,CAAA;AAEA,SAAS8uB,SAASA,CAACnZ,CAAC,EAAEkhB,QAAQ,EAAEC,SAAS,EAAE;AACzC,EAAA,MAAMC,UAAU,GAAGphB,CAAC,CAACkI,CAAC,CAACpgB,IAAI,GAAG,IAAI,IAAIkY,CAAC,CAACkI,CAAC,CAACpgB,IAAI,GAAG,CAAC,CAAA;EAClD,IAAIogB,CAAC,GAAG,EAAE,CAAA;AACV,EAAA,IAAIkZ,UAAU,IAAIphB,CAAC,CAACkI,CAAC,CAACpgB,IAAI,IAAI,CAAC,EAAEogB,CAAC,IAAI,GAAG,CAAA;AACzCA,EAAAA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAACpgB,IAAI,EAAEs5B,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC3C,EAAA,IAAID,SAAS,KAAK,MAAM,EAAE,OAAOjZ,CAAC,CAAA;AAClC,EAAA,IAAIgZ,QAAQ,EAAE;AACZhZ,IAAAA,CAAC,IAAI,GAAG,CAAA;IACRA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAACngB,KAAK,CAAC,CAAA;AACxB,IAAA,IAAIo5B,SAAS,KAAK,OAAO,EAAE,OAAOjZ,CAAC,CAAA;AACnCA,IAAAA,CAAC,IAAI,GAAG,CAAA;AACV,GAAC,MAAM;IACLA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAACngB,KAAK,CAAC,CAAA;AACxB,IAAA,IAAIo5B,SAAS,KAAK,OAAO,EAAE,OAAOjZ,CAAC,CAAA;AACrC,GAAA;EACAA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAAClgB,GAAG,CAAC,CAAA;AACtB,EAAA,OAAOkgB,CAAC,CAAA;AACV,CAAA;AAEA,SAAS4L,SAASA,CAChB9T,CAAC,EACDkhB,QAAQ,EACRhN,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACbiN,YAAY,EACZF,SAAS,EACT;AACA,EAAA,IAAIG,WAAW,GAAG,CAACpN,eAAe,IAAIlU,CAAC,CAACkI,CAAC,CAAC1Z,WAAW,KAAK,CAAC,IAAIwR,CAAC,CAACkI,CAAC,CAACxf,MAAM,KAAK,CAAC;AAC7Ewf,IAAAA,CAAC,GAAG,EAAE,CAAA;AACR,EAAA,QAAQiZ,SAAS;AACf,IAAA,KAAK,KAAK,CAAA;AACV,IAAA,KAAK,OAAO,CAAA;AACZ,IAAA,KAAK,MAAM;AACT,MAAA,MAAA;AACF,IAAA;MACEjZ,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAAC3f,IAAI,CAAC,CAAA;MACvB,IAAI44B,SAAS,KAAK,MAAM,EAAE,MAAA;AAC1B,MAAA,IAAID,QAAQ,EAAE;AACZhZ,QAAAA,CAAC,IAAI,GAAG,CAAA;QACRA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAAC1f,MAAM,CAAC,CAAA;QACzB,IAAI24B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,QAAA,IAAIG,WAAW,EAAE;AACfpZ,UAAAA,CAAC,IAAI,GAAG,CAAA;UACRA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAACxf,MAAM,CAAC,CAAA;AAC3B,SAAA;AACF,OAAC,MAAM;QACLwf,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAAC1f,MAAM,CAAC,CAAA;QACzB,IAAI24B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,QAAA,IAAIG,WAAW,EAAE;UACfpZ,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAACxf,MAAM,CAAC,CAAA;AAC3B,SAAA;AACF,OAAA;MACA,IAAIy4B,SAAS,KAAK,QAAQ,EAAE,MAAA;AAC5B,MAAA,IAAIG,WAAW,KAAK,CAACrN,oBAAoB,IAAIjU,CAAC,CAACkI,CAAC,CAAC1Z,WAAW,KAAK,CAAC,CAAC,EAAE;AACnE0Z,QAAAA,CAAC,IAAI,GAAG,CAAA;QACRA,CAAC,IAAI/U,QAAQ,CAAC6M,CAAC,CAACkI,CAAC,CAAC1Z,WAAW,EAAE,CAAC,CAAC,CAAA;AACnC,OAAA;AACJ,GAAA;AAEA,EAAA,IAAI4lB,aAAa,EAAE;AACjB,IAAA,IAAIpU,CAAC,CAACqJ,aAAa,IAAIrJ,CAAC,CAAC1V,MAAM,KAAK,CAAC,IAAI,CAAC+2B,YAAY,EAAE;AACtDnZ,MAAAA,CAAC,IAAI,GAAG,CAAA;AACV,KAAC,MAAM,IAAIlI,CAAC,CAACA,CAAC,GAAG,CAAC,EAAE;AAClBkI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAI/U,QAAQ,CAAChF,IAAI,CAACuU,KAAK,CAAC,CAAC1C,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACpCkI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAI/U,QAAQ,CAAChF,IAAI,CAACuU,KAAK,CAAC,CAAC1C,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACtC,KAAC,MAAM;AACLkI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAI/U,QAAQ,CAAChF,IAAI,CAACuU,KAAK,CAAC1C,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACnCkI,MAAAA,CAAC,IAAI,GAAG,CAAA;AACRA,MAAAA,CAAC,IAAI/U,QAAQ,CAAChF,IAAI,CAACuU,KAAK,CAAC1C,CAAC,CAACA,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACrC,KAAA;AACF,GAAA;AAEA,EAAA,IAAIqhB,YAAY,EAAE;IAChBnZ,CAAC,IAAI,GAAG,GAAGlI,CAAC,CAACvS,IAAI,CAAC1D,QAAQ,GAAG,GAAG,CAAA;AAClC,GAAA;AACA,EAAA,OAAOme,CAAC,CAAA;AACV,CAAA;;AAEA;AACA,MAAMqZ,iBAAiB,GAAG;AACtBx5B,IAAAA,KAAK,EAAE,CAAC;AACRC,IAAAA,GAAG,EAAE,CAAC;AACNO,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACT8F,IAAAA,WAAW,EAAE,CAAA;GACd;AACDgzB,EAAAA,qBAAqB,GAAG;AACtB7jB,IAAAA,UAAU,EAAE,CAAC;AACbxV,IAAAA,OAAO,EAAE,CAAC;AACVI,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACT8F,IAAAA,WAAW,EAAE,CAAA;GACd;AACDizB,EAAAA,wBAAwB,GAAG;AACzBxkB,IAAAA,OAAO,EAAE,CAAC;AACV1U,IAAAA,IAAI,EAAE,CAAC;AACPC,IAAAA,MAAM,EAAE,CAAC;AACTE,IAAAA,MAAM,EAAE,CAAC;AACT8F,IAAAA,WAAW,EAAE,CAAA;GACd,CAAA;;AAEH;AACA,MAAM6iB,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC;AACtFqQ,EAAAA,gBAAgB,GAAG,CACjB,UAAU,EACV,YAAY,EACZ,SAAS,EACT,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,aAAa,CACd;AACDC,EAAAA,mBAAmB,GAAG,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAA;;AAEtF;AACA,SAAS7O,aAAaA,CAACvrB,IAAI,EAAE;AAC3B,EAAA,MAAM2c,UAAU,GAAG;AACjBpc,IAAAA,IAAI,EAAE,MAAM;AACZwd,IAAAA,KAAK,EAAE,MAAM;AACbvd,IAAAA,KAAK,EAAE,OAAO;AACd8O,IAAAA,MAAM,EAAE,OAAO;AACf7O,IAAAA,GAAG,EAAE,KAAK;AACVyd,IAAAA,IAAI,EAAE,KAAK;AACXld,IAAAA,IAAI,EAAE,MAAM;AACZ6b,IAAAA,KAAK,EAAE,MAAM;AACb5b,IAAAA,MAAM,EAAE,QAAQ;AAChBmL,IAAAA,OAAO,EAAE,QAAQ;AACjB+V,IAAAA,OAAO,EAAE,SAAS;AAClBnE,IAAAA,QAAQ,EAAE,SAAS;AACnB7c,IAAAA,MAAM,EAAE,QAAQ;AAChBgd,IAAAA,OAAO,EAAE,QAAQ;AACjBlX,IAAAA,WAAW,EAAE,aAAa;AAC1Bye,IAAAA,YAAY,EAAE,aAAa;AAC3B9kB,IAAAA,OAAO,EAAE,SAAS;AAClBgP,IAAAA,QAAQ,EAAE,SAAS;AACnByqB,IAAAA,UAAU,EAAE,YAAY;AACxBC,IAAAA,WAAW,EAAE,YAAY;AACzBC,IAAAA,WAAW,EAAE,YAAY;AACzBC,IAAAA,QAAQ,EAAE,UAAU;AACpBC,IAAAA,SAAS,EAAE,UAAU;AACrB/kB,IAAAA,OAAO,EAAE,SAAA;AACX,GAAC,CAAC1V,IAAI,CAACqQ,WAAW,EAAE,CAAC,CAAA;EAErB,IAAI,CAACsM,UAAU,EAAE,MAAM,IAAI5c,gBAAgB,CAACC,IAAI,CAAC,CAAA;AAEjD,EAAA,OAAO2c,UAAU,CAAA;AACnB,CAAA;AAEA,SAAS+d,2BAA2BA,CAAC16B,IAAI,EAAE;AACzC,EAAA,QAAQA,IAAI,CAACqQ,WAAW,EAAE;AACxB,IAAA,KAAK,cAAc,CAAA;AACnB,IAAA,KAAK,eAAe;AAClB,MAAA,OAAO,cAAc,CAAA;AACvB,IAAA,KAAK,iBAAiB,CAAA;AACtB,IAAA,KAAK,kBAAkB;AACrB,MAAA,OAAO,iBAAiB,CAAA;AAC1B,IAAA,KAAK,eAAe,CAAA;AACpB,IAAA,KAAK,gBAAgB;AACnB,MAAA,OAAO,eAAe,CAAA;AACxB,IAAA;MACE,OAAOkb,aAAa,CAACvrB,IAAI,CAAC,CAAA;AAC9B,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS26B,kBAAkBA,CAACz0B,IAAI,EAAE;EAChC,IAAI00B,YAAY,KAAKx2B,SAAS,EAAE;AAC9Bw2B,IAAAA,YAAY,GAAGntB,QAAQ,CAAC4G,GAAG,EAAE,CAAA;AAC/B,GAAA;;AAEA;AACA;AACA,EAAA,IAAInO,IAAI,CAAC5D,IAAI,KAAK,MAAM,EAAE;AACxB,IAAA,OAAO4D,IAAI,CAACnD,MAAM,CAAC63B,YAAY,CAAC,CAAA;AAClC,GAAA;AACA,EAAA,MAAM32B,QAAQ,GAAGiC,IAAI,CAAC3D,IAAI,CAAA;AAC1B,EAAA,IAAIs4B,WAAW,GAAGC,oBAAoB,CAAC32B,GAAG,CAACF,QAAQ,CAAC,CAAA;EACpD,IAAI42B,WAAW,KAAKz2B,SAAS,EAAE;AAC7By2B,IAAAA,WAAW,GAAG30B,IAAI,CAACnD,MAAM,CAAC63B,YAAY,CAAC,CAAA;AACvCE,IAAAA,oBAAoB,CAACv2B,GAAG,CAACN,QAAQ,EAAE42B,WAAW,CAAC,CAAA;AACjD,GAAA;AACA,EAAA,OAAOA,WAAW,CAAA;AACpB,CAAA;;AAEA;AACA;AACA;AACA,SAASE,OAAOA,CAAC7jB,GAAG,EAAEtU,IAAI,EAAE;EAC1B,MAAMsD,IAAI,GAAGqL,aAAa,CAAC3O,IAAI,CAACsD,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC,CAAA;AAC3D,EAAA,IAAI,CAACvL,IAAI,CAAChD,OAAO,EAAE;IACjB,OAAOiH,QAAQ,CAACihB,OAAO,CAAC4M,eAAe,CAAC9xB,IAAI,CAAC,CAAC,CAAA;AAChD,GAAA;AAEA,EAAA,MAAMsE,GAAG,GAAG3B,MAAM,CAACsF,UAAU,CAACvL,IAAI,CAAC,CAAA;EAEnC,IAAID,EAAE,EAAE8V,CAAC,CAAA;;AAET;AACA,EAAA,IAAI,CAAC5S,WAAW,CAACqR,GAAG,CAAC3W,IAAI,CAAC,EAAE;AAC1B,IAAA,KAAK,MAAMqc,CAAC,IAAIkN,YAAY,EAAE;AAC5B,MAAA,IAAIjkB,WAAW,CAACqR,GAAG,CAAC0F,CAAC,CAAC,CAAC,EAAE;AACvB1F,QAAAA,GAAG,CAAC0F,CAAC,CAAC,GAAGod,iBAAiB,CAACpd,CAAC,CAAC,CAAA;AAC/B,OAAA;AACF,KAAA;IAEA,MAAMwO,OAAO,GAAGpT,uBAAuB,CAACd,GAAG,CAAC,IAAIkB,kBAAkB,CAAClB,GAAG,CAAC,CAAA;AACvE,IAAA,IAAIkU,OAAO,EAAE;AACX,MAAA,OAAOjhB,QAAQ,CAACihB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAA;AAEA,IAAA,MAAM4P,YAAY,GAAGL,kBAAkB,CAACz0B,IAAI,CAAC,CAAA;AAC7C,IAAA,CAACvD,EAAE,EAAE8V,CAAC,CAAC,GAAG0gB,OAAO,CAACjiB,GAAG,EAAE8jB,YAAY,EAAE90B,IAAI,CAAC,CAAA;AAC5C,GAAC,MAAM;AACLvD,IAAAA,EAAE,GAAG8K,QAAQ,CAAC4G,GAAG,EAAE,CAAA;AACrB,GAAA;EAEA,OAAO,IAAIlK,QAAQ,CAAC;IAAExH,EAAE;IAAEuD,IAAI;IAAEsE,GAAG;AAAEiO,IAAAA,CAAAA;AAAE,GAAC,CAAC,CAAA;AAC3C,CAAA;AAEA,SAASwiB,YAAYA,CAAC5Z,KAAK,EAAEE,GAAG,EAAE3e,IAAI,EAAE;AACtC,EAAA,MAAMwY,KAAK,GAAGvV,WAAW,CAACjD,IAAI,CAACwY,KAAK,CAAC,GAAG,IAAI,GAAGxY,IAAI,CAACwY,KAAK;AACvDJ,IAAAA,QAAQ,GAAGnV,WAAW,CAACjD,IAAI,CAACoY,QAAQ,CAAC,GAAG,OAAO,GAAGpY,IAAI,CAACoY,QAAQ;AAC/DlY,IAAAA,MAAM,GAAGA,CAAC6d,CAAC,EAAE3gB,IAAI,KAAK;MACpB2gB,CAAC,GAAGhV,OAAO,CAACgV,CAAC,EAAEvF,KAAK,IAAIxY,IAAI,CAACs4B,SAAS,GAAG,CAAC,GAAG,CAAC,EAAEt4B,IAAI,CAACs4B,SAAS,GAAG,OAAO,GAAGlgB,QAAQ,CAAC,CAAA;AACpF,MAAA,MAAM8c,SAAS,GAAGvW,GAAG,CAAC/W,GAAG,CAACyE,KAAK,CAACrM,IAAI,CAAC,CAAC2N,YAAY,CAAC3N,IAAI,CAAC,CAAA;AACxD,MAAA,OAAOk1B,SAAS,CAACh1B,MAAM,CAAC6d,CAAC,EAAE3gB,IAAI,CAAC,CAAA;KACjC;IACDuzB,MAAM,GAAIvzB,IAAI,IAAK;MACjB,IAAI4C,IAAI,CAACs4B,SAAS,EAAE;QAClB,IAAI,CAAC3Z,GAAG,CAACqO,OAAO,CAACvO,KAAK,EAAErhB,IAAI,CAAC,EAAE;UAC7B,OAAOuhB,GAAG,CAACkO,OAAO,CAACzvB,IAAI,CAAC,CAAC2vB,IAAI,CAACtO,KAAK,CAACoO,OAAO,CAACzvB,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACmE,GAAG,CAACnE,IAAI,CAAC,CAAA;SACnE,MAAM,OAAO,CAAC,CAAA;AACjB,OAAC,MAAM;AACL,QAAA,OAAOuhB,GAAG,CAACoO,IAAI,CAACtO,KAAK,EAAErhB,IAAI,CAAC,CAACmE,GAAG,CAACnE,IAAI,CAAC,CAAA;AACxC,OAAA;KACD,CAAA;EAEH,IAAI4C,IAAI,CAAC5C,IAAI,EAAE;AACb,IAAA,OAAO8C,MAAM,CAACywB,MAAM,CAAC3wB,IAAI,CAAC5C,IAAI,CAAC,EAAE4C,IAAI,CAAC5C,IAAI,CAAC,CAAA;AAC7C,GAAA;AAEA,EAAA,KAAK,MAAMA,IAAI,IAAI4C,IAAI,CAACkb,KAAK,EAAE;AAC7B,IAAA,MAAM/Q,KAAK,GAAGwmB,MAAM,CAACvzB,IAAI,CAAC,CAAA;IAC1B,IAAI4G,IAAI,CAACC,GAAG,CAACkG,KAAK,CAAC,IAAI,CAAC,EAAE;AACxB,MAAA,OAAOjK,MAAM,CAACiK,KAAK,EAAE/M,IAAI,CAAC,CAAA;AAC5B,KAAA;AACF,GAAA;EACA,OAAO8C,MAAM,CAACue,KAAK,GAAGE,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE3e,IAAI,CAACkb,KAAK,CAAClb,IAAI,CAACkb,KAAK,CAACpY,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;AACxE,CAAA;AAEA,SAASy1B,QAAQA,CAACC,OAAO,EAAE;EACzB,IAAIx4B,IAAI,GAAG,EAAE;IACXy4B,IAAI,CAAA;AACN,EAAA,IAAID,OAAO,CAAC11B,MAAM,GAAG,CAAC,IAAI,OAAO01B,OAAO,CAACA,OAAO,CAAC11B,MAAM,GAAG,CAAC,CAAC,KAAK,QAAQ,EAAE;IACzE9C,IAAI,GAAGw4B,OAAO,CAACA,OAAO,CAAC11B,MAAM,GAAG,CAAC,CAAC,CAAA;AAClC21B,IAAAA,IAAI,GAAGtiB,KAAK,CAACkB,IAAI,CAACmhB,OAAO,CAAC,CAAClZ,KAAK,CAAC,CAAC,EAAEkZ,OAAO,CAAC11B,MAAM,GAAG,CAAC,CAAC,CAAA;AACzD,GAAC,MAAM;AACL21B,IAAAA,IAAI,GAAGtiB,KAAK,CAACkB,IAAI,CAACmhB,OAAO,CAAC,CAAA;AAC5B,GAAA;AACA,EAAA,OAAO,CAACx4B,IAAI,EAAEy4B,IAAI,CAAC,CAAA;AACrB,CAAA;;AAEA;AACA;AACA;AACA,IAAIT,YAAY,CAAA;AAChB;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,oBAAoB,GAAG,IAAI/2B,GAAG,EAAE,CAAA;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,MAAMoG,QAAQ,CAAC;AAC5B;AACF;AACA;EACE1K,WAAWA,CAACyrB,MAAM,EAAE;IAClB,MAAMhlB,IAAI,GAAGglB,MAAM,CAAChlB,IAAI,IAAIuH,QAAQ,CAACgE,WAAW,CAAA;AAEhD,IAAA,IAAI2Z,OAAO,GACTF,MAAM,CAACE,OAAO,KACblP,MAAM,CAACxV,KAAK,CAACwkB,MAAM,CAACvoB,EAAE,CAAC,GAAG,IAAIgS,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAC,KAC9D,CAACzO,IAAI,CAAChD,OAAO,GAAG80B,eAAe,CAAC9xB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;AAChD;AACJ;AACA;AACI,IAAA,IAAI,CAACvD,EAAE,GAAGkD,WAAW,CAACqlB,MAAM,CAACvoB,EAAE,CAAC,GAAG8K,QAAQ,CAAC4G,GAAG,EAAE,GAAG6W,MAAM,CAACvoB,EAAE,CAAA;IAE7D,IAAIge,CAAC,GAAG,IAAI;AACVlI,MAAAA,CAAC,GAAG,IAAI,CAAA;IACV,IAAI,CAAC2S,OAAO,EAAE;MACZ,MAAMkQ,SAAS,GAAGpQ,MAAM,CAACmN,GAAG,IAAInN,MAAM,CAACmN,GAAG,CAAC11B,EAAE,KAAK,IAAI,CAACA,EAAE,IAAIuoB,MAAM,CAACmN,GAAG,CAACnyB,IAAI,CAAClD,MAAM,CAACkD,IAAI,CAAC,CAAA;AAEzF,MAAA,IAAIo1B,SAAS,EAAE;AACb,QAAA,CAAC3a,CAAC,EAAElI,CAAC,CAAC,GAAG,CAACyS,MAAM,CAACmN,GAAG,CAAC1X,CAAC,EAAEuK,MAAM,CAACmN,GAAG,CAAC5f,CAAC,CAAC,CAAA;AACvC,OAAC,MAAM;AACL;AACA;QACA,MAAM8iB,EAAE,GAAG3pB,QAAQ,CAACsZ,MAAM,CAACzS,CAAC,CAAC,IAAI,CAACyS,MAAM,CAACmN,GAAG,GAAGnN,MAAM,CAACzS,CAAC,GAAGvS,IAAI,CAACnD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;QAC9Ege,CAAC,GAAGiY,OAAO,CAAC,IAAI,CAACj2B,EAAE,EAAE44B,EAAE,CAAC,CAAA;AACxBnQ,QAAAA,OAAO,GAAGlP,MAAM,CAACxV,KAAK,CAACia,CAAC,CAACpgB,IAAI,CAAC,GAAG,IAAIoU,OAAO,CAAC,eAAe,CAAC,GAAG,IAAI,CAAA;AACpEgM,QAAAA,CAAC,GAAGyK,OAAO,GAAG,IAAI,GAAGzK,CAAC,CAAA;AACtBlI,QAAAA,CAAC,GAAG2S,OAAO,GAAG,IAAI,GAAGmQ,EAAE,CAAA;AACzB,OAAA;AACF,KAAA;;AAEA;AACJ;AACA;IACI,IAAI,CAACC,KAAK,GAAGt1B,IAAI,CAAA;AACjB;AACJ;AACA;IACI,IAAI,CAACsE,GAAG,GAAG0gB,MAAM,CAAC1gB,GAAG,IAAI3B,MAAM,CAAC5C,MAAM,EAAE,CAAA;AACxC;AACJ;AACA;IACI,IAAI,CAACmlB,OAAO,GAAGA,OAAO,CAAA;AACtB;AACJ;AACA;IACI,IAAI,CAAC3U,QAAQ,GAAG,IAAI,CAAA;AACpB;AACJ;AACA;IACI,IAAI,CAAC0hB,aAAa,GAAG,IAAI,CAAA;AACzB;AACJ;AACA;IACI,IAAI,CAACxX,CAAC,GAAGA,CAAC,CAAA;AACV;AACJ;AACA;IACI,IAAI,CAAClI,CAAC,GAAGA,CAAC,CAAA;AACV;AACJ;AACA;IACI,IAAI,CAACgjB,eAAe,GAAG,IAAI,CAAA;AAC7B,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,OAAOpnB,GAAGA,GAAG;AACX,IAAA,OAAO,IAAIlK,QAAQ,CAAC,EAAE,CAAC,CAAA;AACzB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOyb,KAAKA,GAAG;IACb,MAAM,CAAChjB,IAAI,EAAEy4B,IAAI,CAAC,GAAGF,QAAQ,CAACO,SAAS,CAAC;AACtC,MAAA,CAACn7B,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAEO,IAAI,EAAEC,MAAM,EAAEE,MAAM,EAAE8F,WAAW,CAAC,GAAGo0B,IAAI,CAAA;AAC9D,IAAA,OAAON,OAAO,CAAC;MAAEx6B,IAAI;MAAEC,KAAK;MAAEC,GAAG;MAAEO,IAAI;MAAEC,MAAM;MAAEE,MAAM;AAAE8F,MAAAA,WAAAA;KAAa,EAAErE,IAAI,CAAC,CAAA;AAC/E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOwH,GAAGA,GAAG;IACX,MAAM,CAACxH,IAAI,EAAEy4B,IAAI,CAAC,GAAGF,QAAQ,CAACO,SAAS,CAAC;AACtC,MAAA,CAACn7B,IAAI,EAAEC,KAAK,EAAEC,GAAG,EAAEO,IAAI,EAAEC,MAAM,EAAEE,MAAM,EAAE8F,WAAW,CAAC,GAAGo0B,IAAI,CAAA;AAE9Dz4B,IAAAA,IAAI,CAACsD,IAAI,GAAG8K,eAAe,CAACC,WAAW,CAAA;AACvC,IAAA,OAAO8pB,OAAO,CAAC;MAAEx6B,IAAI;MAAEC,KAAK;MAAEC,GAAG;MAAEO,IAAI;MAAEC,MAAM;MAAEE,MAAM;AAAE8F,MAAAA,WAAAA;KAAa,EAAErE,IAAI,CAAC,CAAA;AAC/E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,OAAO+4B,UAAUA,CAACj3B,IAAI,EAAE6E,OAAO,GAAG,EAAE,EAAE;AACpC,IAAA,MAAM5G,EAAE,GAAG+V,MAAM,CAAChU,IAAI,CAAC,GAAGA,IAAI,CAACyoB,OAAO,EAAE,GAAG1mB,GAAG,CAAA;AAC9C,IAAA,IAAIyV,MAAM,CAACxV,KAAK,CAAC/D,EAAE,CAAC,EAAE;AACpB,MAAA,OAAOwH,QAAQ,CAACihB,OAAO,CAAC,eAAe,CAAC,CAAA;AAC1C,KAAA;IAEA,MAAMwQ,SAAS,GAAGrqB,aAAa,CAAChI,OAAO,CAACrD,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC,CAAA;AACnE,IAAA,IAAI,CAACmqB,SAAS,CAAC14B,OAAO,EAAE;MACtB,OAAOiH,QAAQ,CAACihB,OAAO,CAAC4M,eAAe,CAAC4D,SAAS,CAAC,CAAC,CAAA;AACrD,KAAA;IAEA,OAAO,IAAIzxB,QAAQ,CAAC;AAClBxH,MAAAA,EAAE,EAAEA,EAAE;AACNuD,MAAAA,IAAI,EAAE01B,SAAS;AACfpxB,MAAAA,GAAG,EAAE3B,MAAM,CAACsF,UAAU,CAAC5E,OAAO,CAAA;AAChC,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAO+hB,UAAUA,CAAC5F,YAAY,EAAEnc,OAAO,GAAG,EAAE,EAAE;AAC5C,IAAA,IAAI,CAACqI,QAAQ,CAAC8T,YAAY,CAAC,EAAE;MAC3B,MAAM,IAAIzlB,oBAAoB,CAC3B,CAAA,sDAAA,EAAwD,OAAOylB,YAAa,CAAA,YAAA,EAAcA,YAAa,CAAA,CAC1G,CAAC,CAAA;KACF,MAAM,IAAIA,YAAY,GAAG,CAACqS,QAAQ,IAAIrS,YAAY,GAAGqS,QAAQ,EAAE;AAC9D;AACA,MAAA,OAAO5tB,QAAQ,CAACihB,OAAO,CAAC,wBAAwB,CAAC,CAAA;AACnD,KAAC,MAAM;MACL,OAAO,IAAIjhB,QAAQ,CAAC;AAClBxH,QAAAA,EAAE,EAAE+iB,YAAY;QAChBxf,IAAI,EAAEqL,aAAa,CAAChI,OAAO,CAACrD,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC;AACvDjH,QAAAA,GAAG,EAAE3B,MAAM,CAACsF,UAAU,CAAC5E,OAAO,CAAA;AAChC,OAAC,CAAC,CAAA;AACJ,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOsyB,WAAWA,CAAC1d,OAAO,EAAE5U,OAAO,GAAG,EAAE,EAAE;AACxC,IAAA,IAAI,CAACqI,QAAQ,CAACuM,OAAO,CAAC,EAAE;AACtB,MAAA,MAAM,IAAIle,oBAAoB,CAAC,wCAAwC,CAAC,CAAA;AAC1E,KAAC,MAAM;MACL,OAAO,IAAIkK,QAAQ,CAAC;QAClBxH,EAAE,EAAEwb,OAAO,GAAG,IAAI;QAClBjY,IAAI,EAAEqL,aAAa,CAAChI,OAAO,CAACrD,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC;AACvDjH,QAAAA,GAAG,EAAE3B,MAAM,CAACsF,UAAU,CAAC5E,OAAO,CAAA;AAChC,OAAC,CAAC,CAAA;AACJ,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAO4E,UAAUA,CAAC+I,GAAG,EAAEtU,IAAI,GAAG,EAAE,EAAE;AAChCsU,IAAAA,GAAG,GAAGA,GAAG,IAAI,EAAE,CAAA;IACf,MAAM0kB,SAAS,GAAGrqB,aAAa,CAAC3O,IAAI,CAACsD,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC,CAAA;AAChE,IAAA,IAAI,CAACmqB,SAAS,CAAC14B,OAAO,EAAE;MACtB,OAAOiH,QAAQ,CAACihB,OAAO,CAAC4M,eAAe,CAAC4D,SAAS,CAAC,CAAC,CAAA;AACrD,KAAA;AAEA,IAAA,MAAMpxB,GAAG,GAAG3B,MAAM,CAACsF,UAAU,CAACvL,IAAI,CAAC,CAAA;AACnC,IAAA,MAAM+Z,UAAU,GAAGF,eAAe,CAACvF,GAAG,EAAEwjB,2BAA2B,CAAC,CAAA;IACpE,MAAM;MAAEvkB,kBAAkB;AAAEH,MAAAA,WAAAA;AAAY,KAAC,GAAGiB,mBAAmB,CAAC0F,UAAU,EAAEnS,GAAG,CAAC,CAAA;AAEhF,IAAA,MAAMsxB,KAAK,GAAGruB,QAAQ,CAAC4G,GAAG,EAAE;AAC1B2mB,MAAAA,YAAY,GAAG,CAACn1B,WAAW,CAACjD,IAAI,CAAC+zB,cAAc,CAAC,GAC5C/zB,IAAI,CAAC+zB,cAAc,GACnBiF,SAAS,CAAC74B,MAAM,CAAC+4B,KAAK,CAAC;AAC3BC,MAAAA,eAAe,GAAG,CAACl2B,WAAW,CAAC8W,UAAU,CAACjH,OAAO,CAAC;AAClDsmB,MAAAA,kBAAkB,GAAG,CAACn2B,WAAW,CAAC8W,UAAU,CAACpc,IAAI,CAAC;AAClD07B,MAAAA,gBAAgB,GAAG,CAACp2B,WAAW,CAAC8W,UAAU,CAACnc,KAAK,CAAC,IAAI,CAACqF,WAAW,CAAC8W,UAAU,CAAClc,GAAG,CAAC;MACjFy7B,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;AACvDE,MAAAA,eAAe,GAAGxf,UAAU,CAACtG,QAAQ,IAAIsG,UAAU,CAACvG,UAAU,CAAA;;AAEhE;AACA;AACA;AACA;AACA;;AAEA,IAAA,IAAI,CAAC8lB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;AAC1D,MAAA,MAAM,IAAIr8B,6BAA6B,CACrC,qEACF,CAAC,CAAA;AACH,KAAA;IAEA,IAAIm8B,gBAAgB,IAAIF,eAAe,EAAE;AACvC,MAAA,MAAM,IAAIj8B,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;AACnF,KAAA;IAEA,MAAMs8B,WAAW,GAAGD,eAAe,IAAKxf,UAAU,CAAC/b,OAAO,IAAI,CAACs7B,cAAe,CAAA;;AAE9E;AACA,IAAA,IAAIpe,KAAK;MACPue,aAAa;AACbC,MAAAA,MAAM,GAAG1D,OAAO,CAACkD,KAAK,EAAEd,YAAY,CAAC,CAAA;AACvC,IAAA,IAAIoB,WAAW,EAAE;AACfte,MAAAA,KAAK,GAAGqc,gBAAgB,CAAA;AACxBkC,MAAAA,aAAa,GAAGpC,qBAAqB,CAAA;MACrCqC,MAAM,GAAGrmB,eAAe,CAACqmB,MAAM,EAAEnmB,kBAAkB,EAAEH,WAAW,CAAC,CAAA;KAClE,MAAM,IAAI+lB,eAAe,EAAE;AAC1Bje,MAAAA,KAAK,GAAGsc,mBAAmB,CAAA;AAC3BiC,MAAAA,aAAa,GAAGnC,wBAAwB,CAAA;AACxCoC,MAAAA,MAAM,GAAGzlB,kBAAkB,CAACylB,MAAM,CAAC,CAAA;AACrC,KAAC,MAAM;AACLxe,MAAAA,KAAK,GAAGgM,YAAY,CAAA;AACpBuS,MAAAA,aAAa,GAAGrC,iBAAiB,CAAA;AACnC,KAAA;;AAEA;IACA,IAAIuC,UAAU,GAAG,KAAK,CAAA;AACtB,IAAA,KAAK,MAAM3f,CAAC,IAAIkB,KAAK,EAAE;AACrB,MAAA,MAAM9D,CAAC,GAAG2C,UAAU,CAACC,CAAC,CAAC,CAAA;AACvB,MAAA,IAAI,CAAC/W,WAAW,CAACmU,CAAC,CAAC,EAAE;AACnBuiB,QAAAA,UAAU,GAAG,IAAI,CAAA;OAClB,MAAM,IAAIA,UAAU,EAAE;AACrB5f,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAGyf,aAAa,CAACzf,CAAC,CAAC,CAAA;AAClC,OAAC,MAAM;AACLD,QAAAA,UAAU,CAACC,CAAC,CAAC,GAAG0f,MAAM,CAAC1f,CAAC,CAAC,CAAA;AAC3B,OAAA;AACF,KAAA;;AAEA;IACA,MAAM4f,kBAAkB,GAAGJ,WAAW,GAChC5kB,kBAAkB,CAACmF,UAAU,EAAExG,kBAAkB,EAAEH,WAAW,CAAC,GAC/D+lB,eAAe,GACfjkB,qBAAqB,CAAC6E,UAAU,CAAC,GACjC3E,uBAAuB,CAAC2E,UAAU,CAAC;AACvCyO,MAAAA,OAAO,GAAGoR,kBAAkB,IAAIpkB,kBAAkB,CAACuE,UAAU,CAAC,CAAA;AAEhE,IAAA,IAAIyO,OAAO,EAAE;AACX,MAAA,OAAOjhB,QAAQ,CAACihB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAA;;AAEA;IACA,MAAMqR,SAAS,GAAGL,WAAW,GACvB5lB,eAAe,CAACmG,UAAU,EAAExG,kBAAkB,EAAEH,WAAW,CAAC,GAC5D+lB,eAAe,GACfhlB,kBAAkB,CAAC4F,UAAU,CAAC,GAC9BA,UAAU;AACd,MAAA,CAAC+f,OAAO,EAAEC,WAAW,CAAC,GAAGxD,OAAO,CAACsD,SAAS,EAAEzB,YAAY,EAAEY,SAAS,CAAC;MACpExD,IAAI,GAAG,IAAIjuB,QAAQ,CAAC;AAClBxH,QAAAA,EAAE,EAAE+5B,OAAO;AACXx2B,QAAAA,IAAI,EAAE01B,SAAS;AACfnjB,QAAAA,CAAC,EAAEkkB,WAAW;AACdnyB,QAAAA,GAAAA;AACF,OAAC,CAAC,CAAA;;AAEJ;AACA,IAAA,IAAImS,UAAU,CAAC/b,OAAO,IAAIs7B,cAAc,IAAIhlB,GAAG,CAACtW,OAAO,KAAKw3B,IAAI,CAACx3B,OAAO,EAAE;AACxE,MAAA,OAAOuJ,QAAQ,CAACihB,OAAO,CACrB,oBAAoB,EACnB,CAAsCzO,oCAAAA,EAAAA,UAAU,CAAC/b,OAAQ,kBAAiBw3B,IAAI,CAAC9L,KAAK,EAAG,EAC1F,CAAC,CAAA;AACH,KAAA;AAEA,IAAA,IAAI,CAAC8L,IAAI,CAACl1B,OAAO,EAAE;AACjB,MAAA,OAAOiH,QAAQ,CAACihB,OAAO,CAACgN,IAAI,CAAChN,OAAO,CAAC,CAAA;AACvC,KAAA;AAEA,IAAA,OAAOgN,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOzM,OAAOA,CAACC,IAAI,EAAEhpB,IAAI,GAAG,EAAE,EAAE;IAC9B,MAAM,CAAC0nB,IAAI,EAAEkP,UAAU,CAAC,GAAG1Q,YAAY,CAAC8C,IAAI,CAAC,CAAA;IAC7C,OAAO2N,mBAAmB,CAACjP,IAAI,EAAEkP,UAAU,EAAE52B,IAAI,EAAE,UAAU,EAAEgpB,IAAI,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOgR,WAAWA,CAAChR,IAAI,EAAEhpB,IAAI,GAAG,EAAE,EAAE;IAClC,MAAM,CAAC0nB,IAAI,EAAEkP,UAAU,CAAC,GAAGzQ,gBAAgB,CAAC6C,IAAI,CAAC,CAAA;IACjD,OAAO2N,mBAAmB,CAACjP,IAAI,EAAEkP,UAAU,EAAE52B,IAAI,EAAE,UAAU,EAAEgpB,IAAI,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOiR,QAAQA,CAACjR,IAAI,EAAEhpB,IAAI,GAAG,EAAE,EAAE;IAC/B,MAAM,CAAC0nB,IAAI,EAAEkP,UAAU,CAAC,GAAGxQ,aAAa,CAAC4C,IAAI,CAAC,CAAA;IAC9C,OAAO2N,mBAAmB,CAACjP,IAAI,EAAEkP,UAAU,EAAE52B,IAAI,EAAE,MAAM,EAAEA,IAAI,CAAC,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOk6B,UAAUA,CAAClR,IAAI,EAAErL,GAAG,EAAE3d,IAAI,GAAG,EAAE,EAAE;IACtC,IAAIiD,WAAW,CAAC+lB,IAAI,CAAC,IAAI/lB,WAAW,CAAC0a,GAAG,CAAC,EAAE;AACzC,MAAA,MAAM,IAAItgB,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;IAEA,MAAM;AAAEyD,QAAAA,MAAM,GAAG,IAAI;AAAEgG,QAAAA,eAAe,GAAG,IAAA;AAAK,OAAC,GAAG9G,IAAI;AACpDm6B,MAAAA,WAAW,GAAGl0B,MAAM,CAACwE,QAAQ,CAAC;QAC5B3J,MAAM;QACNgG,eAAe;AACf6D,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC;AACF,MAAA,CAAC+c,IAAI,EAAEkP,UAAU,EAAE7C,cAAc,EAAEvL,OAAO,CAAC,GAAGyM,eAAe,CAACkF,WAAW,EAAEnR,IAAI,EAAErL,GAAG,CAAC,CAAA;AACvF,IAAA,IAAI6K,OAAO,EAAE;AACX,MAAA,OAAOjhB,QAAQ,CAACihB,OAAO,CAACA,OAAO,CAAC,CAAA;AAClC,KAAC,MAAM;AACL,MAAA,OAAOmO,mBAAmB,CAACjP,IAAI,EAAEkP,UAAU,EAAE52B,IAAI,EAAG,CAAA,OAAA,EAAS2d,GAAI,CAAC,CAAA,EAAEqL,IAAI,EAAE+K,cAAc,CAAC,CAAA;AAC3F,KAAA;AACF,GAAA;;AAEA;AACF;AACA;EACE,OAAOqG,UAAUA,CAACpR,IAAI,EAAErL,GAAG,EAAE3d,IAAI,GAAG,EAAE,EAAE;IACtC,OAAOuH,QAAQ,CAAC2yB,UAAU,CAAClR,IAAI,EAAErL,GAAG,EAAE3d,IAAI,CAAC,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAOq6B,OAAOA,CAACrR,IAAI,EAAEhpB,IAAI,GAAG,EAAE,EAAE;IAC9B,MAAM,CAAC0nB,IAAI,EAAEkP,UAAU,CAAC,GAAGjQ,QAAQ,CAACqC,IAAI,CAAC,CAAA;IACzC,OAAO2N,mBAAmB,CAACjP,IAAI,EAAEkP,UAAU,EAAE52B,IAAI,EAAE,KAAK,EAAEgpB,IAAI,CAAC,CAAA;AACjE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE,EAAA,OAAOR,OAAOA,CAAC1rB,MAAM,EAAEkV,WAAW,GAAG,IAAI,EAAE;IACzC,IAAI,CAAClV,MAAM,EAAE;AACX,MAAA,MAAM,IAAIO,oBAAoB,CAAC,kDAAkD,CAAC,CAAA;AACpF,KAAA;AAEA,IAAA,MAAMmrB,OAAO,GAAG1rB,MAAM,YAAYiV,OAAO,GAAGjV,MAAM,GAAG,IAAIiV,OAAO,CAACjV,MAAM,EAAEkV,WAAW,CAAC,CAAA;IAErF,IAAInH,QAAQ,CAAC8G,cAAc,EAAE;AAC3B,MAAA,MAAM,IAAI/U,oBAAoB,CAAC4rB,OAAO,CAAC,CAAA;AACzC,KAAC,MAAM;MACL,OAAO,IAAIjhB,QAAQ,CAAC;AAAEihB,QAAAA,OAAAA;AAAQ,OAAC,CAAC,CAAA;AAClC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,OAAO8R,UAAUA,CAACzkB,CAAC,EAAE;AACnB,IAAA,OAAQA,CAAC,IAAIA,CAAC,CAACgjB,eAAe,IAAK,KAAK,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,OAAO0B,kBAAkBA,CAACrc,UAAU,EAAEsc,UAAU,GAAG,EAAE,EAAE;AACrD,IAAA,MAAMC,SAAS,GAAGhG,kBAAkB,CAACvW,UAAU,EAAEjY,MAAM,CAACsF,UAAU,CAACivB,UAAU,CAAC,CAAC,CAAA;IAC/E,OAAO,CAACC,SAAS,GAAG,IAAI,GAAGA,SAAS,CAAChxB,GAAG,CAAEoI,CAAC,IAAMA,CAAC,GAAGA,CAAC,CAACuK,GAAG,GAAG,IAAK,CAAC,CAAC1S,IAAI,CAAC,EAAE,CAAC,CAAA;AAC9E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,OAAOgxB,YAAYA,CAAC/c,GAAG,EAAE6c,UAAU,GAAG,EAAE,EAAE;AACxC,IAAA,MAAMG,QAAQ,GAAGjG,iBAAiB,CAACjX,SAAS,CAACC,WAAW,CAACC,GAAG,CAAC,EAAE1X,MAAM,CAACsF,UAAU,CAACivB,UAAU,CAAC,CAAC,CAAA;AAC7F,IAAA,OAAOG,QAAQ,CAAClxB,GAAG,CAAEoI,CAAC,IAAKA,CAAC,CAACuK,GAAG,CAAC,CAAC1S,IAAI,CAAC,EAAE,CAAC,CAAA;AAC5C,GAAA;EAEA,OAAOnG,UAAUA,GAAG;AAClBy0B,IAAAA,YAAY,GAAGx2B,SAAS,CAAA;IACxB02B,oBAAoB,CAAC10B,KAAK,EAAE,CAAA;AAC9B,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEjC,GAAGA,CAACnE,IAAI,EAAE;IACR,OAAO,IAAI,CAACA,IAAI,CAAC,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIkD,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACkoB,OAAO,KAAK,IAAI,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI8B,aAAaA,GAAG;IAClB,OAAO,IAAI,CAAC9B,OAAO,GAAG,IAAI,CAACA,OAAO,CAAC1rB,MAAM,GAAG,IAAI,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI4uB,kBAAkBA,GAAG;IACvB,OAAO,IAAI,CAAClD,OAAO,GAAG,IAAI,CAACA,OAAO,CAACxW,WAAW,GAAG,IAAI,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIlR,MAAMA,GAAG;IACX,OAAO,IAAI,CAACR,OAAO,GAAG,IAAI,CAACsH,GAAG,CAAC9G,MAAM,GAAG,IAAI,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIgG,eAAeA,GAAG;IACpB,OAAO,IAAI,CAACxG,OAAO,GAAG,IAAI,CAACsH,GAAG,CAACd,eAAe,GAAG,IAAI,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIG,cAAcA,GAAG;IACnB,OAAO,IAAI,CAAC3G,OAAO,GAAG,IAAI,CAACsH,GAAG,CAACX,cAAc,GAAG,IAAI,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI3D,IAAIA,GAAG;IACT,OAAO,IAAI,CAACs1B,KAAK,CAAA;AACnB,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIv3B,QAAQA,GAAG;IACb,OAAO,IAAI,CAACf,OAAO,GAAG,IAAI,CAACgD,IAAI,CAAC3D,IAAI,GAAG,IAAI,CAAA;AAC7C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIhC,IAAIA,GAAG;IACT,OAAO,IAAI,CAAC2C,OAAO,GAAG,IAAI,CAACyd,CAAC,CAACpgB,IAAI,GAAGkG,GAAG,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAI0b,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACjf,OAAO,GAAG0D,IAAI,CAACsU,IAAI,CAAC,IAAI,CAACyF,CAAC,CAACngB,KAAK,GAAG,CAAC,CAAC,GAAGiG,GAAG,CAAA;AACzD,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIjG,KAAKA,GAAG;IACV,OAAO,IAAI,CAAC0C,OAAO,GAAG,IAAI,CAACyd,CAAC,CAACngB,KAAK,GAAGiG,GAAG,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIhG,GAAGA,GAAG;IACR,OAAO,IAAI,CAACyC,OAAO,GAAG,IAAI,CAACyd,CAAC,CAAClgB,GAAG,GAAGgG,GAAG,CAAA;AACxC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIzF,IAAIA,GAAG;IACT,OAAO,IAAI,CAACkC,OAAO,GAAG,IAAI,CAACyd,CAAC,CAAC3f,IAAI,GAAGyF,GAAG,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIxF,MAAMA,GAAG;IACX,OAAO,IAAI,CAACiC,OAAO,GAAG,IAAI,CAACyd,CAAC,CAAC1f,MAAM,GAAGwF,GAAG,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAItF,MAAMA,GAAG;IACX,OAAO,IAAI,CAAC+B,OAAO,GAAG,IAAI,CAACyd,CAAC,CAACxf,MAAM,GAAGsF,GAAG,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIQ,WAAWA,GAAG;IAChB,OAAO,IAAI,CAAC/D,OAAO,GAAG,IAAI,CAACyd,CAAC,CAAC1Z,WAAW,GAAGR,GAAG,CAAA;AAChD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAI4P,QAAQA,GAAG;IACb,OAAO,IAAI,CAACnT,OAAO,GAAG+0B,sBAAsB,CAAC,IAAI,CAAC,CAAC5hB,QAAQ,GAAG5P,GAAG,CAAA;AACnE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAI2P,UAAUA,GAAG;IACf,OAAO,IAAI,CAAClT,OAAO,GAAG+0B,sBAAsB,CAAC,IAAI,CAAC,CAAC7hB,UAAU,GAAG3P,GAAG,CAAA;AACrE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,IAAI7F,OAAOA,GAAG;IACZ,OAAO,IAAI,CAACsC,OAAO,GAAG+0B,sBAAsB,CAAC,IAAI,CAAC,CAACr3B,OAAO,GAAG6F,GAAG,CAAA;AAClE,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAI+2B,SAASA,GAAG;AACd,IAAA,OAAO,IAAI,CAACt6B,OAAO,IAAI,IAAI,CAACsH,GAAG,CAACqG,cAAc,EAAE,CAAC/G,QAAQ,CAAC,IAAI,CAAClJ,OAAO,CAAC,CAAA;AACzE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIwW,YAAYA,GAAG;IACjB,OAAO,IAAI,CAAClU,OAAO,GAAGg1B,2BAA2B,CAAC,IAAI,CAAC,CAACt3B,OAAO,GAAG6F,GAAG,CAAA;AACvE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAI4Q,eAAeA,GAAG;IACpB,OAAO,IAAI,CAACnU,OAAO,GAAGg1B,2BAA2B,CAAC,IAAI,CAAC,CAAC9hB,UAAU,GAAG3P,GAAG,CAAA;AAC1E,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAI6Q,aAAaA,GAAG;IAClB,OAAO,IAAI,CAACpU,OAAO,GAAGg1B,2BAA2B,CAAC,IAAI,CAAC,CAAC7hB,QAAQ,GAAG5P,GAAG,CAAA;AACxE,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIiP,OAAOA,GAAG;AACZ,IAAA,OAAO,IAAI,CAACxS,OAAO,GAAG2T,kBAAkB,CAAC,IAAI,CAAC8J,CAAC,CAAC,CAACjL,OAAO,GAAGjP,GAAG,CAAA;AAChE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIg3B,UAAUA,GAAG;IACf,OAAO,IAAI,CAACv6B,OAAO,GAAG+uB,IAAI,CAAC3iB,MAAM,CAAC,OAAO,EAAE;MAAE+iB,MAAM,EAAE,IAAI,CAAC7nB,GAAAA;KAAK,CAAC,CAAC,IAAI,CAAChK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AACzF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIk9B,SAASA,GAAG;IACd,OAAO,IAAI,CAACx6B,OAAO,GAAG+uB,IAAI,CAAC3iB,MAAM,CAAC,MAAM,EAAE;MAAE+iB,MAAM,EAAE,IAAI,CAAC7nB,GAAAA;KAAK,CAAC,CAAC,IAAI,CAAChK,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AACxF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIm9B,YAAYA,GAAG;IACjB,OAAO,IAAI,CAACz6B,OAAO,GAAG+uB,IAAI,CAACriB,QAAQ,CAAC,OAAO,EAAE;MAAEyiB,MAAM,EAAE,IAAI,CAAC7nB,GAAAA;KAAK,CAAC,CAAC,IAAI,CAAC5J,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AAC7F,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIg9B,WAAWA,GAAG;IAChB,OAAO,IAAI,CAAC16B,OAAO,GAAG+uB,IAAI,CAACriB,QAAQ,CAAC,MAAM,EAAE;MAAEyiB,MAAM,EAAE,IAAI,CAAC7nB,GAAAA;KAAK,CAAC,CAAC,IAAI,CAAC5J,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;AAC5F,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAImC,MAAMA,GAAG;IACX,OAAO,IAAI,CAACG,OAAO,GAAG,CAAC,IAAI,CAACuV,CAAC,GAAGhS,GAAG,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIo3B,eAAeA,GAAG;IACpB,IAAI,IAAI,CAAC36B,OAAO,EAAE;MAChB,OAAO,IAAI,CAACgD,IAAI,CAACxD,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;AACnCG,QAAAA,MAAM,EAAE,OAAO;QACfY,MAAM,EAAE,IAAI,CAACA,MAAAA;AACf,OAAC,CAAC,CAAA;AACJ,KAAC,MAAM;AACL,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE,IAAIo6B,cAAcA,GAAG;IACnB,IAAI,IAAI,CAAC56B,OAAO,EAAE;MAChB,OAAO,IAAI,CAACgD,IAAI,CAACxD,UAAU,CAAC,IAAI,CAACC,EAAE,EAAE;AACnCG,QAAAA,MAAM,EAAE,MAAM;QACdY,MAAM,EAAE,IAAI,CAACA,MAAAA;AACf,OAAC,CAAC,CAAA;AACJ,KAAC,MAAM;AACL,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIoe,aAAaA,GAAG;IAClB,OAAO,IAAI,CAAC5e,OAAO,GAAG,IAAI,CAACgD,IAAI,CAACzD,WAAW,GAAG,IAAI,CAAA;AACpD,GAAA;;AAEA;AACF;AACA;AACA;EACE,IAAIs7B,OAAOA,GAAG;IACZ,IAAI,IAAI,CAACjc,aAAa,EAAE;AACtB,MAAA,OAAO,KAAK,CAAA;AACd,KAAC,MAAM;AACL,MAAA,OACE,IAAI,CAAC/e,MAAM,GAAG,IAAI,CAACwB,GAAG,CAAC;AAAE/D,QAAAA,KAAK,EAAE,CAAC;AAAEC,QAAAA,GAAG,EAAE,CAAA;OAAG,CAAC,CAACsC,MAAM,IACnD,IAAI,CAACA,MAAM,GAAG,IAAI,CAACwB,GAAG,CAAC;AAAE/D,QAAAA,KAAK,EAAE,CAAA;OAAG,CAAC,CAACuC,MAAM,CAAA;AAE/C,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACEi7B,EAAAA,kBAAkBA,GAAG;IACnB,IAAI,CAAC,IAAI,CAAC96B,OAAO,IAAI,IAAI,CAAC4e,aAAa,EAAE;MACvC,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,KAAA;IACA,MAAMmc,KAAK,GAAG,QAAQ,CAAA;IACtB,MAAMC,QAAQ,GAAG,KAAK,CAAA;AACtB,IAAA,MAAM3F,OAAO,GAAGvxB,YAAY,CAAC,IAAI,CAAC2Z,CAAC,CAAC,CAAA;IACpC,MAAMwd,QAAQ,GAAG,IAAI,CAACj4B,IAAI,CAACnD,MAAM,CAACw1B,OAAO,GAAG0F,KAAK,CAAC,CAAA;IAClD,MAAMG,MAAM,GAAG,IAAI,CAACl4B,IAAI,CAACnD,MAAM,CAACw1B,OAAO,GAAG0F,KAAK,CAAC,CAAA;AAEhD,IAAA,MAAMI,EAAE,GAAG,IAAI,CAACn4B,IAAI,CAACnD,MAAM,CAACw1B,OAAO,GAAG4F,QAAQ,GAAGD,QAAQ,CAAC,CAAA;AAC1D,IAAA,MAAMxF,EAAE,GAAG,IAAI,CAACxyB,IAAI,CAACnD,MAAM,CAACw1B,OAAO,GAAG6F,MAAM,GAAGF,QAAQ,CAAC,CAAA;IACxD,IAAIG,EAAE,KAAK3F,EAAE,EAAE;MACb,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,KAAA;AACA,IAAA,MAAM4F,GAAG,GAAG/F,OAAO,GAAG8F,EAAE,GAAGH,QAAQ,CAAA;AACnC,IAAA,MAAMK,GAAG,GAAGhG,OAAO,GAAGG,EAAE,GAAGwF,QAAQ,CAAA;AACnC,IAAA,MAAMM,EAAE,GAAG5F,OAAO,CAAC0F,GAAG,EAAED,EAAE,CAAC,CAAA;AAC3B,IAAA,MAAMI,EAAE,GAAG7F,OAAO,CAAC2F,GAAG,EAAE7F,EAAE,CAAC,CAAA;AAC3B,IAAA,IACE8F,EAAE,CAACx9B,IAAI,KAAKy9B,EAAE,CAACz9B,IAAI,IACnBw9B,EAAE,CAACv9B,MAAM,KAAKw9B,EAAE,CAACx9B,MAAM,IACvBu9B,EAAE,CAACr9B,MAAM,KAAKs9B,EAAE,CAACt9B,MAAM,IACvBq9B,EAAE,CAACv3B,WAAW,KAAKw3B,EAAE,CAACx3B,WAAW,EACjC;AACA,MAAA,OAAO,CAACgI,KAAK,CAAC,IAAI,EAAE;AAAEtM,QAAAA,EAAE,EAAE27B,GAAAA;AAAI,OAAC,CAAC,EAAErvB,KAAK,CAAC,IAAI,EAAE;AAAEtM,QAAAA,EAAE,EAAE47B,GAAAA;AAAI,OAAC,CAAC,CAAC,CAAA;AAC7D,KAAA;IACA,OAAO,CAAC,IAAI,CAAC,CAAA;AACf,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIG,YAAYA,GAAG;AACjB,IAAA,OAAOlpB,UAAU,CAAC,IAAI,CAACjV,IAAI,CAAC,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAI4X,WAAWA,GAAG;IAChB,OAAOA,WAAW,CAAC,IAAI,CAAC5X,IAAI,EAAE,IAAI,CAACC,KAAK,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIoW,UAAUA,GAAG;IACf,OAAO,IAAI,CAAC1T,OAAO,GAAG0T,UAAU,CAAC,IAAI,CAACrW,IAAI,CAAC,GAAGkG,GAAG,CAAA;AACnD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,IAAI6P,eAAeA,GAAG;IACpB,OAAO,IAAI,CAACpT,OAAO,GAAGoT,eAAe,CAAC,IAAI,CAACD,QAAQ,CAAC,GAAG5P,GAAG,CAAA;AAC5D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACE,IAAIk4B,oBAAoBA,GAAG;IACzB,OAAO,IAAI,CAACz7B,OAAO,GACfoT,eAAe,CACb,IAAI,CAACgB,aAAa,EAClB,IAAI,CAAC9M,GAAG,CAACoG,qBAAqB,EAAE,EAChC,IAAI,CAACpG,GAAG,CAACmG,cAAc,EACzB,CAAC,GACDlK,GAAG,CAAA;AACT,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACEm4B,EAAAA,qBAAqBA,CAACh8B,IAAI,GAAG,EAAE,EAAE;IAC/B,MAAM;MAAEc,MAAM;MAAEgG,eAAe;AAAEC,MAAAA,QAAAA;KAAU,GAAG0W,SAAS,CAACpa,MAAM,CAC5D,IAAI,CAACuE,GAAG,CAACyE,KAAK,CAACrM,IAAI,CAAC,EACpBA,IACF,CAAC,CAACY,eAAe,CAAC,IAAI,CAAC,CAAA;IACvB,OAAO;MAAEE,MAAM;MAAEgG,eAAe;AAAEG,MAAAA,cAAc,EAAEF,QAAAA;KAAU,CAAA;AAC9D,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEspB,KAAKA,CAAClwB,MAAM,GAAG,CAAC,EAAEH,IAAI,GAAG,EAAE,EAAE;AAC3B,IAAA,OAAO,IAAI,CAACsJ,OAAO,CAAC8E,eAAe,CAAC3N,QAAQ,CAACN,MAAM,CAAC,EAAEH,IAAI,CAAC,CAAA;AAC7D,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACEi8B,EAAAA,OAAOA,GAAG;AACR,IAAA,OAAO,IAAI,CAAC3yB,OAAO,CAACuB,QAAQ,CAACgE,WAAW,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEvF,OAAOA,CAAChG,IAAI,EAAE;AAAEgtB,IAAAA,aAAa,GAAG,KAAK;AAAE4L,IAAAA,gBAAgB,GAAG,KAAA;GAAO,GAAG,EAAE,EAAE;IACtE54B,IAAI,GAAGqL,aAAa,CAACrL,IAAI,EAAEuH,QAAQ,CAACgE,WAAW,CAAC,CAAA;IAChD,IAAIvL,IAAI,CAAClD,MAAM,CAAC,IAAI,CAACkD,IAAI,CAAC,EAAE;AAC1B,MAAA,OAAO,IAAI,CAAA;AACb,KAAC,MAAM,IAAI,CAACA,IAAI,CAAChD,OAAO,EAAE;MACxB,OAAOiH,QAAQ,CAACihB,OAAO,CAAC4M,eAAe,CAAC9xB,IAAI,CAAC,CAAC,CAAA;AAChD,KAAC,MAAM;AACL,MAAA,IAAI64B,KAAK,GAAG,IAAI,CAACp8B,EAAE,CAAA;MACnB,IAAIuwB,aAAa,IAAI4L,gBAAgB,EAAE;QACrC,MAAMjE,WAAW,GAAG30B,IAAI,CAACnD,MAAM,CAAC,IAAI,CAACJ,EAAE,CAAC,CAAA;AACxC,QAAA,MAAMq8B,KAAK,GAAG,IAAI,CAAC3S,QAAQ,EAAE,CAAA;QAC7B,CAAC0S,KAAK,CAAC,GAAG5F,OAAO,CAAC6F,KAAK,EAAEnE,WAAW,EAAE30B,IAAI,CAAC,CAAA;AAC7C,OAAA;MACA,OAAO+I,KAAK,CAAC,IAAI,EAAE;AAAEtM,QAAAA,EAAE,EAAEo8B,KAAK;AAAE74B,QAAAA,IAAAA;AAAK,OAAC,CAAC,CAAA;AACzC,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACEwnB,EAAAA,WAAWA,CAAC;IAAEhqB,MAAM;IAAEgG,eAAe;AAAEG,IAAAA,cAAAA;GAAgB,GAAG,EAAE,EAAE;AAC5D,IAAA,MAAMW,GAAG,GAAG,IAAI,CAACA,GAAG,CAACyE,KAAK,CAAC;MAAEvL,MAAM;MAAEgG,eAAe;AAAEG,MAAAA,cAAAA;AAAe,KAAC,CAAC,CAAA;IACvE,OAAOoF,KAAK,CAAC,IAAI,EAAE;AAAEzE,MAAAA,GAAAA;AAAI,KAAC,CAAC,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEy0B,SAASA,CAACv7B,MAAM,EAAE;IAChB,OAAO,IAAI,CAACgqB,WAAW,CAAC;AAAEhqB,MAAAA,MAAAA;AAAO,KAAC,CAAC,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEa,GAAGA,CAACgf,MAAM,EAAE;AACV,IAAA,IAAI,CAAC,IAAI,CAACrgB,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,MAAMyZ,UAAU,GAAGF,eAAe,CAAC8G,MAAM,EAAEmX,2BAA2B,CAAC,CAAA;IACvE,MAAM;MAAEvkB,kBAAkB;AAAEH,MAAAA,WAAAA;KAAa,GAAGiB,mBAAmB,CAAC0F,UAAU,EAAE,IAAI,CAACnS,GAAG,CAAC,CAAA;IAErF,MAAM00B,gBAAgB,GAClB,CAACr5B,WAAW,CAAC8W,UAAU,CAACtG,QAAQ,CAAC,IACjC,CAACxQ,WAAW,CAAC8W,UAAU,CAACvG,UAAU,CAAC,IACnC,CAACvQ,WAAW,CAAC8W,UAAU,CAAC/b,OAAO,CAAC;AAClCm7B,MAAAA,eAAe,GAAG,CAACl2B,WAAW,CAAC8W,UAAU,CAACjH,OAAO,CAAC;AAClDsmB,MAAAA,kBAAkB,GAAG,CAACn2B,WAAW,CAAC8W,UAAU,CAACpc,IAAI,CAAC;AAClD07B,MAAAA,gBAAgB,GAAG,CAACp2B,WAAW,CAAC8W,UAAU,CAACnc,KAAK,CAAC,IAAI,CAACqF,WAAW,CAAC8W,UAAU,CAAClc,GAAG,CAAC;MACjFy7B,cAAc,GAAGF,kBAAkB,IAAIC,gBAAgB;AACvDE,MAAAA,eAAe,GAAGxf,UAAU,CAACtG,QAAQ,IAAIsG,UAAU,CAACvG,UAAU,CAAA;AAEhE,IAAA,IAAI,CAAC8lB,cAAc,IAAIH,eAAe,KAAKI,eAAe,EAAE;AAC1D,MAAA,MAAM,IAAIr8B,6BAA6B,CACrC,qEACF,CAAC,CAAA;AACH,KAAA;IAEA,IAAIm8B,gBAAgB,IAAIF,eAAe,EAAE;AACvC,MAAA,MAAM,IAAIj8B,6BAA6B,CAAC,wCAAwC,CAAC,CAAA;AACnF,KAAA;AAEA,IAAA,IAAI2tB,KAAK,CAAA;AACT,IAAA,IAAIyR,gBAAgB,EAAE;MACpBzR,KAAK,GAAGjX,eAAe,CACrB;QAAE,GAAGP,eAAe,CAAC,IAAI,CAAC0K,CAAC,EAAExK,kBAAkB,EAAEH,WAAW,CAAC;QAAE,GAAG2G,UAAAA;AAAW,OAAC,EAC9ExG,kBAAkB,EAClBH,WACF,CAAC,CAAA;KACF,MAAM,IAAI,CAACnQ,WAAW,CAAC8W,UAAU,CAACjH,OAAO,CAAC,EAAE;MAC3C+X,KAAK,GAAG1W,kBAAkB,CAAC;AAAE,QAAA,GAAGF,kBAAkB,CAAC,IAAI,CAAC8J,CAAC,CAAC;QAAE,GAAGhE,UAAAA;AAAW,OAAC,CAAC,CAAA;AAC9E,KAAC,MAAM;AACL8Q,MAAAA,KAAK,GAAG;AAAE,QAAA,GAAG,IAAI,CAACpB,QAAQ,EAAE;QAAE,GAAG1P,UAAAA;OAAY,CAAA;;AAE7C;AACA;AACA,MAAA,IAAI9W,WAAW,CAAC8W,UAAU,CAAClc,GAAG,CAAC,EAAE;QAC/BgtB,KAAK,CAAChtB,GAAG,GAAGmG,IAAI,CAAC+M,GAAG,CAACwE,WAAW,CAACsV,KAAK,CAACltB,IAAI,EAAEktB,KAAK,CAACjtB,KAAK,CAAC,EAAEitB,KAAK,CAAChtB,GAAG,CAAC,CAAA;AACvE,OAAA;AACF,KAAA;AAEA,IAAA,MAAM,CAACkC,EAAE,EAAE8V,CAAC,CAAC,GAAG0gB,OAAO,CAAC1L,KAAK,EAAE,IAAI,CAAChV,CAAC,EAAE,IAAI,CAACvS,IAAI,CAAC,CAAA;IACjD,OAAO+I,KAAK,CAAC,IAAI,EAAE;MAAEtM,EAAE;AAAE8V,MAAAA,CAAAA;AAAE,KAAC,CAAC,CAAA;AAC/B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEtM,IAAIA,CAACihB,QAAQ,EAAE;AACb,IAAA,IAAI,CAAC,IAAI,CAAClqB,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAMmf,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC,CAAA;IAC/C,OAAOne,KAAK,CAAC,IAAI,EAAEmqB,UAAU,CAAC,IAAI,EAAE/W,GAAG,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACEgL,KAAKA,CAACD,QAAQ,EAAE;AACd,IAAA,IAAI,CAAC,IAAI,CAAClqB,OAAO,EAAE,OAAO,IAAI,CAAA;IAC9B,MAAMmf,GAAG,GAAG+H,QAAQ,CAACoB,gBAAgB,CAAC4B,QAAQ,CAAC,CAACE,MAAM,EAAE,CAAA;IACxD,OAAOre,KAAK,CAAC,IAAI,EAAEmqB,UAAU,CAAC,IAAI,EAAE/W,GAAG,CAAC,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEoN,OAAOA,CAACzvB,IAAI,EAAE;AAAE0vB,IAAAA,cAAc,GAAG,KAAA;GAAO,GAAG,EAAE,EAAE;AAC7C,IAAA,IAAI,CAAC,IAAI,CAACxsB,OAAO,EAAE,OAAO,IAAI,CAAA;IAE9B,MAAMuV,CAAC,GAAG,EAAE;AACV0mB,MAAAA,cAAc,GAAG/U,QAAQ,CAACmB,aAAa,CAACvrB,IAAI,CAAC,CAAA;AAC/C,IAAA,QAAQm/B,cAAc;AACpB,MAAA,KAAK,OAAO;QACV1mB,CAAC,CAACjY,KAAK,GAAG,CAAC,CAAA;AACb;AACA,MAAA,KAAK,UAAU,CAAA;AACf,MAAA,KAAK,QAAQ;QACXiY,CAAC,CAAChY,GAAG,GAAG,CAAC,CAAA;AACX;AACA,MAAA,KAAK,OAAO,CAAA;AACZ,MAAA,KAAK,MAAM;QACTgY,CAAC,CAACzX,IAAI,GAAG,CAAC,CAAA;AACZ;AACA,MAAA,KAAK,OAAO;QACVyX,CAAC,CAACxX,MAAM,GAAG,CAAC,CAAA;AACd;AACA,MAAA,KAAK,SAAS;QACZwX,CAAC,CAACtX,MAAM,GAAG,CAAC,CAAA;AACd;AACA,MAAA,KAAK,SAAS;QACZsX,CAAC,CAACxR,WAAW,GAAG,CAAC,CAAA;AACjB,QAAA,MAAA;AAGF;AACF,KAAA;;IAEA,IAAIk4B,cAAc,KAAK,OAAO,EAAE;AAC9B,MAAA,IAAIzP,cAAc,EAAE;QAClB,MAAM1Z,WAAW,GAAG,IAAI,CAACxL,GAAG,CAACmG,cAAc,EAAE,CAAA;QAC7C,MAAM;AAAE/P,UAAAA,OAAAA;AAAQ,SAAC,GAAG,IAAI,CAAA;QACxB,IAAIA,OAAO,GAAGoV,WAAW,EAAE;AACzByC,UAAAA,CAAC,CAACrC,UAAU,GAAG,IAAI,CAACA,UAAU,GAAG,CAAC,CAAA;AACpC,SAAA;QACAqC,CAAC,CAAC7X,OAAO,GAAGoV,WAAW,CAAA;AACzB,OAAC,MAAM;QACLyC,CAAC,CAAC7X,OAAO,GAAG,CAAC,CAAA;AACf,OAAA;AACF,KAAA;IAEA,IAAIu+B,cAAc,KAAK,UAAU,EAAE;MACjC,MAAMtI,CAAC,GAAGjwB,IAAI,CAACsU,IAAI,CAAC,IAAI,CAAC1a,KAAK,GAAG,CAAC,CAAC,CAAA;MACnCiY,CAAC,CAACjY,KAAK,GAAG,CAACq2B,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAC3B,KAAA;AAEA,IAAA,OAAO,IAAI,CAACtyB,GAAG,CAACkU,CAAC,CAAC,CAAA;AACpB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE2mB,EAAAA,KAAKA,CAACp/B,IAAI,EAAE4C,IAAI,EAAE;AAChB,IAAA,OAAO,IAAI,CAACM,OAAO,GACf,IAAI,CAACiJ,IAAI,CAAC;AAAE,MAAA,CAACnM,IAAI,GAAG,CAAA;AAAE,KAAC,CAAC,CACrByvB,OAAO,CAACzvB,IAAI,EAAE4C,IAAI,CAAC,CACnByqB,KAAK,CAAC,CAAC,CAAC,GACX,IAAI,CAAA;AACV,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEtB,EAAAA,QAAQA,CAACxL,GAAG,EAAE3d,IAAI,GAAG,EAAE,EAAE;IACvB,OAAO,IAAI,CAACM,OAAO,GACfmd,SAAS,CAACpa,MAAM,CAAC,IAAI,CAACuE,GAAG,CAAC4E,aAAa,CAACxM,IAAI,CAAC,CAAC,CAAC+e,wBAAwB,CAAC,IAAI,EAAEpB,GAAG,CAAC,GAClFiJ,OAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEmI,cAAcA,CAAC7Q,UAAU,GAAG3B,UAAkB,EAAEvc,IAAI,GAAG,EAAE,EAAE;IACzD,OAAO,IAAI,CAACM,OAAO,GACfmd,SAAS,CAACpa,MAAM,CAAC,IAAI,CAACuE,GAAG,CAACyE,KAAK,CAACrM,IAAI,CAAC,EAAEke,UAAU,CAAC,CAACG,cAAc,CAAC,IAAI,CAAC,GACvEuI,OAAO,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE6V,EAAAA,aAAaA,CAACz8B,IAAI,GAAG,EAAE,EAAE;IACvB,OAAO,IAAI,CAACM,OAAO,GACfmd,SAAS,CAACpa,MAAM,CAAC,IAAI,CAACuE,GAAG,CAACyE,KAAK,CAACrM,IAAI,CAAC,EAAEA,IAAI,CAAC,CAACse,mBAAmB,CAAC,IAAI,CAAC,GACtE,EAAE,CAAA;AACR,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEoL,EAAAA,KAAKA,CAAC;AACJxpB,IAAAA,MAAM,GAAG,UAAU;AACnB6pB,IAAAA,eAAe,GAAG,KAAK;AACvBD,IAAAA,oBAAoB,GAAG,KAAK;AAC5BG,IAAAA,aAAa,GAAG,IAAI;AACpBiN,IAAAA,YAAY,GAAG,KAAK;AACpBF,IAAAA,SAAS,GAAG,cAAA;GACb,GAAG,EAAE,EAAE;AACN,IAAA,IAAI,CAAC,IAAI,CAAC12B,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEA02B,IAAAA,SAAS,GAAGrO,aAAa,CAACqO,SAAS,CAAC,CAAA;AACpC,IAAA,MAAM0F,GAAG,GAAGx8B,MAAM,KAAK,UAAU,CAAA;IAEjC,IAAI6d,CAAC,GAAGiR,SAAS,CAAC,IAAI,EAAE0N,GAAG,EAAE1F,SAAS,CAAC,CAAA;IACvC,IAAI9P,YAAY,CAAC1gB,OAAO,CAACwwB,SAAS,CAAC,IAAI,CAAC,EAAEjZ,CAAC,IAAI,GAAG,CAAA;AAClDA,IAAAA,CAAC,IAAI4L,SAAS,CACZ,IAAI,EACJ+S,GAAG,EACH3S,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACbiN,YAAY,EACZF,SACF,CAAC,CAAA;AACD,IAAA,OAAOjZ,CAAC,CAAA;AACV,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEiR,EAAAA,SAASA,CAAC;AAAE9uB,IAAAA,MAAM,GAAG,UAAU;AAAE82B,IAAAA,SAAS,GAAG,KAAA;GAAO,GAAG,EAAE,EAAE;AACzD,IAAA,IAAI,CAAC,IAAI,CAAC12B,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACA,IAAA,OAAO0uB,SAAS,CAAC,IAAI,EAAE9uB,MAAM,KAAK,UAAU,EAAEyoB,aAAa,CAACqO,SAAS,CAAC,CAAC,CAAA;AACzE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACE2F,EAAAA,aAAaA,GAAG;AACd,IAAA,OAAO7F,YAAY,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEnN,EAAAA,SAASA,CAAC;AACRG,IAAAA,oBAAoB,GAAG,KAAK;AAC5BC,IAAAA,eAAe,GAAG,KAAK;AACvBE,IAAAA,aAAa,GAAG,IAAI;AACpBD,IAAAA,aAAa,GAAG,KAAK;AACrBkN,IAAAA,YAAY,GAAG,KAAK;AACpBh3B,IAAAA,MAAM,GAAG,UAAU;AACnB82B,IAAAA,SAAS,GAAG,cAAA;GACb,GAAG,EAAE,EAAE;AACN,IAAA,IAAI,CAAC,IAAI,CAAC12B,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEA02B,IAAAA,SAAS,GAAGrO,aAAa,CAACqO,SAAS,CAAC,CAAA;AACpC,IAAA,IAAIjZ,CAAC,GAAGiM,aAAa,IAAI9C,YAAY,CAAC1gB,OAAO,CAACwwB,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,EAAE,CAAA;AACxE,IAAA,OACEjZ,CAAC,GACD4L,SAAS,CACP,IAAI,EACJzpB,MAAM,KAAK,UAAU,EACrB6pB,eAAe,EACfD,oBAAoB,EACpBG,aAAa,EACbiN,YAAY,EACZF,SACF,CAAC,CAAA;AAEL,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACE4F,EAAAA,SAASA,GAAG;AACV,IAAA,OAAO9F,YAAY,CAAC,IAAI,EAAE,+BAA+B,EAAE,KAAK,CAAC,CAAA;AACnE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACE+F,EAAAA,MAAMA,GAAG;IACP,OAAO/F,YAAY,CAAC,IAAI,CAACzG,KAAK,EAAE,EAAE,iCAAiC,CAAC,CAAA;AACtE,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACEyM,EAAAA,SAASA,GAAG;AACV,IAAA,IAAI,CAAC,IAAI,CAACx8B,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACA,IAAA,OAAO0uB,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE+N,EAAAA,SAASA,CAAC;AAAE9S,IAAAA,aAAa,GAAG,IAAI;AAAE+S,IAAAA,WAAW,GAAG,KAAK;AAAEC,IAAAA,kBAAkB,GAAG,IAAA;GAAM,GAAG,EAAE,EAAE;IACvF,IAAItf,GAAG,GAAG,cAAc,CAAA;IAExB,IAAIqf,WAAW,IAAI/S,aAAa,EAAE;AAChC,MAAA,IAAIgT,kBAAkB,EAAE;AACtBtf,QAAAA,GAAG,IAAI,GAAG,CAAA;AACZ,OAAA;AACA,MAAA,IAAIqf,WAAW,EAAE;AACfrf,QAAAA,GAAG,IAAI,GAAG,CAAA;OACX,MAAM,IAAIsM,aAAa,EAAE;AACxBtM,QAAAA,GAAG,IAAI,IAAI,CAAA;AACb,OAAA;AACF,KAAA;AAEA,IAAA,OAAOmZ,YAAY,CAAC,IAAI,EAAEnZ,GAAG,EAAE,IAAI,CAAC,CAAA;AACtC,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEuf,EAAAA,KAAKA,CAACl9B,IAAI,GAAG,EAAE,EAAE;AACf,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE;AACjB,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AAEA,IAAA,OAAQ,CAAE,EAAA,IAAI,CAACw8B,SAAS,EAAG,CAAG,CAAA,EAAA,IAAI,CAACC,SAAS,CAAC/8B,IAAI,CAAE,CAAC,CAAA,CAAA;AACtD,GAAA;;AAEA;AACF;AACA;AACA;AACEmO,EAAAA,QAAQA,GAAG;IACT,OAAO,IAAI,CAAC7N,OAAO,GAAG,IAAI,CAACopB,KAAK,EAAE,GAAG9C,OAAO,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACE,EAAA,CAACwD,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC,CAAI,GAAA;IAC3C,IAAI,IAAI,CAAC/pB,OAAO,EAAE;AAChB,MAAA,OAAQ,kBAAiB,IAAI,CAACopB,KAAK,EAAG,CAAU,QAAA,EAAA,IAAI,CAACpmB,IAAI,CAAC3D,IAAK,CAAA,UAAA,EAAY,IAAI,CAACmB,MAAO,CAAG,EAAA,CAAA,CAAA;AAC5F,KAAC,MAAM;AACL,MAAA,OAAQ,CAA8B,4BAAA,EAAA,IAAI,CAACwpB,aAAc,CAAG,EAAA,CAAA,CAAA;AAC9D,KAAA;AACF,GAAA;;AAEA;AACF;AACA;AACA;AACEC,EAAAA,OAAOA,GAAG;AACR,IAAA,OAAO,IAAI,CAACV,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;AACEA,EAAAA,QAAQA,GAAG;IACT,OAAO,IAAI,CAACvpB,OAAO,GAAG,IAAI,CAACP,EAAE,GAAG8D,GAAG,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;AACEs5B,EAAAA,SAASA,GAAG;IACV,OAAO,IAAI,CAAC78B,OAAO,GAAG,IAAI,CAACP,EAAE,GAAG,IAAI,GAAG8D,GAAG,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;AACEu5B,EAAAA,aAAaA,GAAG;AACd,IAAA,OAAO,IAAI,CAAC98B,OAAO,GAAG0D,IAAI,CAACuE,KAAK,CAAC,IAAI,CAACxI,EAAE,GAAG,IAAI,CAAC,GAAG8D,GAAG,CAAA;AACxD,GAAA;;AAEA;AACF;AACA;AACA;AACEsmB,EAAAA,MAAMA,GAAG;AACP,IAAA,OAAO,IAAI,CAACT,KAAK,EAAE,CAAA;AACrB,GAAA;;AAEA;AACF;AACA;AACA;AACE2T,EAAAA,MAAMA,GAAG;AACP,IAAA,OAAO,IAAI,CAAC1zB,QAAQ,EAAE,CAAA;AACxB,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACE8f,EAAAA,QAAQA,CAACzpB,IAAI,GAAG,EAAE,EAAE;AAClB,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAO,EAAE,CAAA;AAE5B,IAAA,MAAMiF,IAAI,GAAG;AAAE,MAAA,GAAG,IAAI,CAACwY,CAAAA;KAAG,CAAA;IAE1B,IAAI/d,IAAI,CAACs9B,aAAa,EAAE;AACtB/3B,MAAAA,IAAI,CAAC0B,cAAc,GAAG,IAAI,CAACA,cAAc,CAAA;AACzC1B,MAAAA,IAAI,CAACuB,eAAe,GAAG,IAAI,CAACc,GAAG,CAACd,eAAe,CAAA;AAC/CvB,MAAAA,IAAI,CAACzE,MAAM,GAAG,IAAI,CAAC8G,GAAG,CAAC9G,MAAM,CAAA;AAC/B,KAAA;AACA,IAAA,OAAOyE,IAAI,CAAA;AACb,GAAA;;AAEA;AACF;AACA;AACA;AACEoE,EAAAA,QAAQA,GAAG;AACT,IAAA,OAAO,IAAI3I,IAAI,CAAC,IAAI,CAACV,OAAO,GAAG,IAAI,CAACP,EAAE,GAAG8D,GAAG,CAAC,CAAA;AAC/C,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEkpB,IAAIA,CAACwQ,aAAa,EAAEngC,IAAI,GAAG,cAAc,EAAE4C,IAAI,GAAG,EAAE,EAAE;IACpD,IAAI,CAAC,IAAI,CAACM,OAAO,IAAI,CAACi9B,aAAa,CAACj9B,OAAO,EAAE;AAC3C,MAAA,OAAOknB,QAAQ,CAACgB,OAAO,CAAC,wCAAwC,CAAC,CAAA;AACnE,KAAA;AAEA,IAAA,MAAMgV,OAAO,GAAG;MAAE18B,MAAM,EAAE,IAAI,CAACA,MAAM;MAAEgG,eAAe,EAAE,IAAI,CAACA,eAAe;MAAE,GAAG9G,IAAAA;KAAM,CAAA;AAEvF,IAAA,MAAMkb,KAAK,GAAGjF,UAAU,CAAC7Y,IAAI,CAAC,CAACqM,GAAG,CAAC+d,QAAQ,CAACmB,aAAa,CAAC;MACxD8U,YAAY,GAAGF,aAAa,CAAChT,OAAO,EAAE,GAAG,IAAI,CAACA,OAAO,EAAE;AACvD2F,MAAAA,OAAO,GAAGuN,YAAY,GAAG,IAAI,GAAGF,aAAa;AAC7CpN,MAAAA,KAAK,GAAGsN,YAAY,GAAGF,aAAa,GAAG,IAAI;MAC3CG,MAAM,GAAG3Q,IAAI,CAACmD,OAAO,EAAEC,KAAK,EAAEjV,KAAK,EAAEsiB,OAAO,CAAC,CAAA;IAE/C,OAAOC,YAAY,GAAGC,MAAM,CAAChT,MAAM,EAAE,GAAGgT,MAAM,CAAA;AAChD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEC,OAAOA,CAACvgC,IAAI,GAAG,cAAc,EAAE4C,IAAI,GAAG,EAAE,EAAE;AACxC,IAAA,OAAO,IAAI,CAAC+sB,IAAI,CAACxlB,QAAQ,CAACkK,GAAG,EAAE,EAAErU,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAC9C,GAAA;;AAEA;AACF;AACA;AACA;AACA;EACE49B,KAAKA,CAACL,aAAa,EAAE;AACnB,IAAA,OAAO,IAAI,CAACj9B,OAAO,GAAGyrB,QAAQ,CAACE,aAAa,CAAC,IAAI,EAAEsR,aAAa,CAAC,GAAG,IAAI,CAAA;AAC1E,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEvQ,EAAAA,OAAOA,CAACuQ,aAAa,EAAEngC,IAAI,EAAE4C,IAAI,EAAE;AACjC,IAAA,IAAI,CAAC,IAAI,CAACM,OAAO,EAAE,OAAO,KAAK,CAAA;AAE/B,IAAA,MAAMu9B,OAAO,GAAGN,aAAa,CAAChT,OAAO,EAAE,CAAA;IACvC,MAAMuT,cAAc,GAAG,IAAI,CAACx0B,OAAO,CAACi0B,aAAa,CAACj6B,IAAI,EAAE;AAAEgtB,MAAAA,aAAa,EAAE,IAAA;AAAK,KAAC,CAAC,CAAA;IAChF,OACEwN,cAAc,CAACjR,OAAO,CAACzvB,IAAI,EAAE4C,IAAI,CAAC,IAAI69B,OAAO,IAAIA,OAAO,IAAIC,cAAc,CAACtB,KAAK,CAACp/B,IAAI,EAAE4C,IAAI,CAAC,CAAA;AAEhG,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEI,MAAMA,CAAC8N,KAAK,EAAE;AACZ,IAAA,OACE,IAAI,CAAC5N,OAAO,IACZ4N,KAAK,CAAC5N,OAAO,IACb,IAAI,CAACiqB,OAAO,EAAE,KAAKrc,KAAK,CAACqc,OAAO,EAAE,IAClC,IAAI,CAACjnB,IAAI,CAAClD,MAAM,CAAC8N,KAAK,CAAC5K,IAAI,CAAC,IAC5B,IAAI,CAACsE,GAAG,CAACxH,MAAM,CAAC8N,KAAK,CAACtG,GAAG,CAAC,CAAA;AAE9B,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACEm2B,EAAAA,UAAUA,CAACp3B,OAAO,GAAG,EAAE,EAAE;AACvB,IAAA,IAAI,CAAC,IAAI,CAACrG,OAAO,EAAE,OAAO,IAAI,CAAA;AAC9B,IAAA,MAAMiF,IAAI,GAAGoB,OAAO,CAACpB,IAAI,IAAIgC,QAAQ,CAACgE,UAAU,CAAC,EAAE,EAAE;QAAEjI,IAAI,EAAE,IAAI,CAACA,IAAAA;AAAK,OAAC,CAAC;AACvE06B,MAAAA,OAAO,GAAGr3B,OAAO,CAACq3B,OAAO,GAAI,IAAI,GAAGz4B,IAAI,GAAG,CAACoB,OAAO,CAACq3B,OAAO,GAAGr3B,OAAO,CAACq3B,OAAO,GAAI,CAAC,CAAA;AACpF,IAAA,IAAI9iB,KAAK,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;AACtE,IAAA,IAAI9d,IAAI,GAAGuJ,OAAO,CAACvJ,IAAI,CAAA;IACvB,IAAI+Y,KAAK,CAACC,OAAO,CAACzP,OAAO,CAACvJ,IAAI,CAAC,EAAE;MAC/B8d,KAAK,GAAGvU,OAAO,CAACvJ,IAAI,CAAA;AACpBA,MAAAA,IAAI,GAAGoE,SAAS,CAAA;AAClB,KAAA;IACA,OAAO62B,YAAY,CAAC9yB,IAAI,EAAE,IAAI,CAACgE,IAAI,CAACy0B,OAAO,CAAC,EAAE;AAC5C,MAAA,GAAGr3B,OAAO;AACV0D,MAAAA,OAAO,EAAE,QAAQ;MACjB6Q,KAAK;AACL9d,MAAAA,IAAAA;AACF,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACE6gC,EAAAA,kBAAkBA,CAACt3B,OAAO,GAAG,EAAE,EAAE;AAC/B,IAAA,IAAI,CAAC,IAAI,CAACrG,OAAO,EAAE,OAAO,IAAI,CAAA;AAE9B,IAAA,OAAO+3B,YAAY,CAAC1xB,OAAO,CAACpB,IAAI,IAAIgC,QAAQ,CAACgE,UAAU,CAAC,EAAE,EAAE;MAAEjI,IAAI,EAAE,IAAI,CAACA,IAAAA;KAAM,CAAC,EAAE,IAAI,EAAE;AACtF,MAAA,GAAGqD,OAAO;AACV0D,MAAAA,OAAO,EAAE,MAAM;AACf6Q,MAAAA,KAAK,EAAE,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC;AAClCod,MAAAA,SAAS,EAAE,IAAA;AACb,KAAC,CAAC,CAAA;AACJ,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACE,EAAA,OAAOvnB,GAAGA,CAAC,GAAGuc,SAAS,EAAE;IACvB,IAAI,CAACA,SAAS,CAAC4Q,KAAK,CAAC32B,QAAQ,CAAC+yB,UAAU,CAAC,EAAE;AACzC,MAAA,MAAM,IAAIj9B,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;AAC3E,KAAA;AACA,IAAA,OAAOgZ,MAAM,CAACiX,SAAS,EAAGzqB,CAAC,IAAKA,CAAC,CAAC0nB,OAAO,EAAE,EAAEvmB,IAAI,CAAC+M,GAAG,CAAC,CAAA;AACxD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACE,EAAA,OAAOC,GAAGA,CAAC,GAAGsc,SAAS,EAAE;IACvB,IAAI,CAACA,SAAS,CAAC4Q,KAAK,CAAC32B,QAAQ,CAAC+yB,UAAU,CAAC,EAAE;AACzC,MAAA,MAAM,IAAIj9B,oBAAoB,CAAC,yCAAyC,CAAC,CAAA;AAC3E,KAAA;AACA,IAAA,OAAOgZ,MAAM,CAACiX,SAAS,EAAGzqB,CAAC,IAAKA,CAAC,CAAC0nB,OAAO,EAAE,EAAEvmB,IAAI,CAACgN,GAAG,CAAC,CAAA;AACxD,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,OAAOmtB,iBAAiBA,CAACnV,IAAI,EAAErL,GAAG,EAAEhX,OAAO,GAAG,EAAE,EAAE;IAChD,MAAM;AAAE7F,QAAAA,MAAM,GAAG,IAAI;AAAEgG,QAAAA,eAAe,GAAG,IAAA;AAAK,OAAC,GAAGH,OAAO;AACvDwzB,MAAAA,WAAW,GAAGl0B,MAAM,CAACwE,QAAQ,CAAC;QAC5B3J,MAAM;QACNgG,eAAe;AACf6D,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;AACJ,IAAA,OAAOmqB,iBAAiB,CAACqF,WAAW,EAAEnR,IAAI,EAAErL,GAAG,CAAC,CAAA;AAClD,GAAA;;AAEA;AACF;AACA;EACE,OAAOygB,iBAAiBA,CAACpV,IAAI,EAAErL,GAAG,EAAEhX,OAAO,GAAG,EAAE,EAAE;IAChD,OAAOY,QAAQ,CAAC42B,iBAAiB,CAACnV,IAAI,EAAErL,GAAG,EAAEhX,OAAO,CAAC,CAAA;AACvD,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAO03B,iBAAiBA,CAAC1gB,GAAG,EAAEhX,OAAO,GAAG,EAAE,EAAE;IAC1C,MAAM;AAAE7F,QAAAA,MAAM,GAAG,IAAI;AAAEgG,QAAAA,eAAe,GAAG,IAAA;AAAK,OAAC,GAAGH,OAAO;AACvDwzB,MAAAA,WAAW,GAAGl0B,MAAM,CAACwE,QAAQ,CAAC;QAC5B3J,MAAM;QACNgG,eAAe;AACf6D,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;AACJ,IAAA,OAAO,IAAIgqB,WAAW,CAACwF,WAAW,EAAExc,GAAG,CAAC,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,OAAO2gB,gBAAgBA,CAACtV,IAAI,EAAEuV,YAAY,EAAEv+B,IAAI,GAAG,EAAE,EAAE;IACrD,IAAIiD,WAAW,CAAC+lB,IAAI,CAAC,IAAI/lB,WAAW,CAACs7B,YAAY,CAAC,EAAE;AAClD,MAAA,MAAM,IAAIlhC,oBAAoB,CAC5B,+DACF,CAAC,CAAA;AACH,KAAA;IACA,MAAM;AAAEyD,QAAAA,MAAM,GAAG,IAAI;AAAEgG,QAAAA,eAAe,GAAG,IAAA;AAAK,OAAC,GAAG9G,IAAI;AACpDm6B,MAAAA,WAAW,GAAGl0B,MAAM,CAACwE,QAAQ,CAAC;QAC5B3J,MAAM;QACNgG,eAAe;AACf6D,QAAAA,WAAW,EAAE,IAAA;AACf,OAAC,CAAC,CAAA;IAEJ,IAAI,CAACwvB,WAAW,CAAC/5B,MAAM,CAACm+B,YAAY,CAACz9B,MAAM,CAAC,EAAE;AAC5C,MAAA,MAAM,IAAIzD,oBAAoB,CAC3B,CAAA,yCAAA,EAA2C88B,WAAY,CAAA,EAAA,CAAG,GACxD,CAAA,sCAAA,EAAwCoE,YAAY,CAACz9B,MAAO,CAAA,CACjE,CAAC,CAAA;AACH,KAAA;IAEA,MAAM;MAAEgkB,MAAM;MAAExhB,IAAI;MAAEywB,cAAc;AAAEzJ,MAAAA,aAAAA;AAAc,KAAC,GAAGiU,YAAY,CAACzJ,iBAAiB,CAAC9L,IAAI,CAAC,CAAA;AAE5F,IAAA,IAAIsB,aAAa,EAAE;AACjB,MAAA,OAAO/iB,QAAQ,CAACihB,OAAO,CAAC8B,aAAa,CAAC,CAAA;AACxC,KAAC,MAAM;AACL,MAAA,OAAOqM,mBAAmB,CACxB7R,MAAM,EACNxhB,IAAI,EACJtD,IAAI,EACH,CAASu+B,OAAAA,EAAAA,YAAY,CAACr+B,MAAO,CAAA,CAAC,EAC/B8oB,IAAI,EACJ+K,cACF,CAAC,CAAA;AACH,KAAA;AACF,GAAA;;AAEA;;AAEA;AACF;AACA;AACA;EACE,WAAWr2B,UAAUA,GAAG;IACtB,OAAO6e,UAAkB,CAAA;AAC3B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWze,QAAQA,GAAG;IACpB,OAAOye,QAAgB,CAAA;AACzB,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWxe,qBAAqBA,GAAG;IACjC,OAAOwe,qBAA6B,CAAA;AACtC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWte,SAASA,GAAG;IACrB,OAAOse,SAAiB,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWre,SAASA,GAAG;IACrB,OAAOqe,SAAiB,CAAA;AAC1B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWpe,WAAWA,GAAG;IACvB,OAAOoe,WAAmB,CAAA;AAC5B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWje,iBAAiBA,GAAG;IAC7B,OAAOie,iBAAyB,CAAA;AAClC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAW/d,sBAAsBA,GAAG;IAClC,OAAO+d,sBAA8B,CAAA;AACvC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAW7d,qBAAqBA,GAAG;IACjC,OAAO6d,qBAA6B,CAAA;AACtC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAW5d,cAAcA,GAAG;IAC1B,OAAO4d,cAAsB,CAAA;AAC/B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAW1d,oBAAoBA,GAAG;IAChC,OAAO0d,oBAA4B,CAAA;AACrC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWzd,yBAAyBA,GAAG;IACrC,OAAOyd,yBAAiC,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWxd,wBAAwBA,GAAG;IACpC,OAAOwd,wBAAgC,CAAA;AACzC,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWvd,cAAcA,GAAG;IAC1B,OAAOud,cAAsB,CAAA;AAC/B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWtd,2BAA2BA,GAAG;IACvC,OAAOsd,2BAAmC,CAAA;AAC5C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWrd,YAAYA,GAAG;IACxB,OAAOqd,YAAoB,CAAA;AAC7B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWpd,yBAAyBA,GAAG;IACrC,OAAOod,yBAAiC,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWnd,yBAAyBA,GAAG;IACrC,OAAOmd,yBAAiC,CAAA;AAC1C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWld,aAAaA,GAAG;IACzB,OAAOkd,aAAqB,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWjd,0BAA0BA,GAAG;IACtC,OAAOid,0BAAkC,CAAA;AAC3C,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAWhd,aAAaA,GAAG;IACzB,OAAOgd,aAAqB,CAAA;AAC9B,GAAA;;AAEA;AACF;AACA;AACA;EACE,WAAW/c,0BAA0BA,GAAG;IACtC,OAAO+c,0BAAkC,CAAA;AAC3C,GAAA;AACF,CAAA;;AAEA;AACA;AACA;AACO,SAAS4P,gBAAgBA,CAACqS,WAAW,EAAE;AAC5C,EAAA,IAAIj3B,QAAQ,CAAC+yB,UAAU,CAACkE,WAAW,CAAC,EAAE;AACpC,IAAA,OAAOA,WAAW,CAAA;AACpB,GAAC,MAAM,IAAIA,WAAW,IAAIA,WAAW,CAACjU,OAAO,IAAIvb,QAAQ,CAACwvB,WAAW,CAACjU,OAAO,EAAE,CAAC,EAAE;AAChF,IAAA,OAAOhjB,QAAQ,CAACwxB,UAAU,CAACyF,WAAW,CAAC,CAAA;GACxC,MAAM,IAAIA,WAAW,IAAI,OAAOA,WAAW,KAAK,QAAQ,EAAE;AACzD,IAAA,OAAOj3B,QAAQ,CAACgE,UAAU,CAACizB,WAAW,CAAC,CAAA;AACzC,GAAC,MAAM;IACL,MAAM,IAAInhC,oBAAoB,CAC3B,CAAA,2BAAA,EAA6BmhC,WAAY,CAAY,UAAA,EAAA,OAAOA,WAAY,CAAA,CAC3E,CAAC,CAAA;AACH,GAAA;AACF;;AC/hFMC,MAAAA,OAAO,GAAG;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/luxon/package.json b/node_modules/luxon/package.json
new file mode 100644
index 0000000..f80269b
--- /dev/null
+++ b/node_modules/luxon/package.json
@@ -0,0 +1,87 @@
+{
+  "name": "luxon",
+  "version": "3.7.2",
+  "description": "Immutable date wrapper",
+  "author": "Isaac Cambron",
+  "keywords": [
+    "date",
+    "immutable"
+  ],
+  "repository": "https://github.com/moment/luxon",
+  "exports": {
+    ".": {
+      "import": "./build/es6/luxon.mjs",
+      "require": "./build/node/luxon.js"
+    },
+    "./package.json": "./package.json"
+  },
+  "scripts": {
+    "build": "babel-node tasks/buildAll.js",
+    "build-node": "babel-node tasks/buildNode.js",
+    "build-global": "babel-node tasks/buildGlobal.js",
+    "jest": "jest",
+    "test": "jest --coverage",
+    "api-docs": "mkdir -p build && documentation build src/luxon.js -f html -o build/api-docs && sed -i.bak 's/<\\/body>/<script src=\"\\..\\/global\\/luxon.js\"><\\/script><script>console.log(\"You can try Luxon right here using the `luxon` global, like `luxon.DateTime.now()`\");<\\/script><\\/body>/g' build/api-docs/index.html && rm build/api-docs/index.html.bak",
+    "copy-site": "mkdir -p build && rsync -a docs/ build/docs && rsync -a site/ build",
+    "site": "npm run api-docs && npm run copy-site",
+    "format": "prettier --write 'src/**/*.js' 'test/**/*.js' 'benchmarks/*.js'",
+    "format-check": "prettier --check 'src/**/*.js' 'test/**/*.js' 'benchmarks/*.js'",
+    "benchmark": "node benchmarks/index.js",
+    "codecov": "codecov",
+    "prepack": "babel-node tasks/buildAll.js",
+    "prepare": "husky install",
+    "show-site": "http-server build"
+  },
+  "lint-staged": {
+    "*.{js,json}": [
+      "prettier --write"
+    ]
+  },
+  "devDependencies": {
+    "@babel/core": "^7.18.6",
+    "@babel/node": "^7.18.6",
+    "@babel/plugin-external-helpers": "^7.18.6",
+    "@babel/preset-env": "^7.18.6",
+    "@rollup/plugin-babel": "^5.3.0",
+    "@rollup/plugin-commonjs": "^19.0.0",
+    "@rollup/plugin-node-resolve": "^13.0.0",
+    "babel-jest": "^28.1.2",
+    "benchmark": "latest",
+    "codecov": "latest",
+    "documentation": "latest",
+    "fs-extra": "^6.0.1",
+    "http-server": "^14.1.1",
+    "husky": "^7.0.0",
+    "jest": "^29.4.3",
+    "lint-staged": "^13.2.1",
+    "prettier": "latest",
+    "rollup": "^2.52.7",
+    "rollup-plugin-terser": "^7.0.2",
+    "uglify-js": "^3.13.10"
+  },
+  "main": "build/node/luxon.js",
+  "module": "src/luxon.js",
+  "browser": "build/cjs-browser/luxon.js",
+  "jsdelivr": "build/global/luxon.min.js",
+  "unpkg": "build/global/luxon.min.js",
+  "engines": {
+    "node": ">=12"
+  },
+  "files": [
+    "build/node/luxon.js",
+    "build/node/luxon.js.map",
+    "build/cjs-browser/luxon.js",
+    "build/cjs-browser/luxon.js.map",
+    "build/amd/luxon.js",
+    "build/amd/luxon.js.map",
+    "build/global/luxon.js",
+    "build/global/luxon.js.map",
+    "build/global/luxon.min.js",
+    "build/global/luxon.min.js.map",
+    "build/es6/luxon.mjs",
+    "build/es6/luxon.mjs.map",
+    "src"
+  ],
+  "license": "MIT",
+  "sideEffects": false
+}
diff --git a/node_modules/luxon/src/datetime.js b/node_modules/luxon/src/datetime.js
new file mode 100644
index 0000000..40a3f55
--- /dev/null
+++ b/node_modules/luxon/src/datetime.js
@@ -0,0 +1,2603 @@
+import Duration from "./duration.js";
+import Interval from "./interval.js";
+import Settings from "./settings.js";
+import Info from "./info.js";
+import Formatter from "./impl/formatter.js";
+import FixedOffsetZone from "./zones/fixedOffsetZone.js";
+import Locale from "./impl/locale.js";
+import {
+  isUndefined,
+  maybeArray,
+  isDate,
+  isNumber,
+  bestBy,
+  daysInMonth,
+  daysInYear,
+  isLeapYear,
+  weeksInWeekYear,
+  normalizeObject,
+  roundTo,
+  objToLocalTS,
+  padStart,
+} from "./impl/util.js";
+import { normalizeZone } from "./impl/zoneUtil.js";
+import diff from "./impl/diff.js";
+import { parseRFC2822Date, parseISODate, parseHTTPDate, parseSQL } from "./impl/regexParser.js";
+import {
+  parseFromTokens,
+  explainFromTokens,
+  formatOptsToTokens,
+  expandMacroTokens,
+  TokenParser,
+} from "./impl/tokenParser.js";
+import {
+  gregorianToWeek,
+  weekToGregorian,
+  gregorianToOrdinal,
+  ordinalToGregorian,
+  hasInvalidGregorianData,
+  hasInvalidWeekData,
+  hasInvalidOrdinalData,
+  hasInvalidTimeData,
+  usesLocalWeekValues,
+  isoWeekdayToLocal,
+} from "./impl/conversions.js";
+import * as Formats from "./impl/formats.js";
+import {
+  InvalidArgumentError,
+  ConflictingSpecificationError,
+  InvalidUnitError,
+  InvalidDateTimeError,
+} from "./errors.js";
+import Invalid from "./impl/invalid.js";
+
+const INVALID = "Invalid DateTime";
+const MAX_DATE = 8.64e15;
+
+function unsupportedZone(zone) {
+  return new Invalid("unsupported zone", `the zone "${zone.name}" is not supported`);
+}
+
+// we cache week data on the DT object and this intermediates the cache
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedWeekData(dt) {
+  if (dt.weekData === null) {
+    dt.weekData = gregorianToWeek(dt.c);
+  }
+  return dt.weekData;
+}
+
+/**
+ * @param {DateTime} dt
+ */
+function possiblyCachedLocalWeekData(dt) {
+  if (dt.localWeekData === null) {
+    dt.localWeekData = gregorianToWeek(
+      dt.c,
+      dt.loc.getMinDaysInFirstWeek(),
+      dt.loc.getStartOfWeek()
+    );
+  }
+  return dt.localWeekData;
+}
+
+// clone really means, "make a new object with these modifications". all "setters" really use this
+// to create a new object while only changing some of the properties
+function clone(inst, alts) {
+  const current = {
+    ts: inst.ts,
+    zone: inst.zone,
+    c: inst.c,
+    o: inst.o,
+    loc: inst.loc,
+    invalid: inst.invalid,
+  };
+  return new DateTime({ ...current, ...alts, old: current });
+}
+
+// find the right offset a given local time. The o input is our guess, which determines which
+// offset we'll pick in ambiguous cases (e.g. there are two 3 AMs b/c Fallback DST)
+function fixOffset(localTS, o, tz) {
+  // Our UTC time is just a guess because our offset is just a guess
+  let utcGuess = localTS - o * 60 * 1000;
+
+  // Test whether the zone matches the offset for this ts
+  const o2 = tz.offset(utcGuess);
+
+  // If so, offset didn't change and we're done
+  if (o === o2) {
+    return [utcGuess, o];
+  }
+
+  // If not, change the ts by the difference in the offset
+  utcGuess -= (o2 - o) * 60 * 1000;
+
+  // If that gives us the local time we want, we're done
+  const o3 = tz.offset(utcGuess);
+  if (o2 === o3) {
+    return [utcGuess, o2];
+  }
+
+  // If it's different, we're in a hole time. The offset has changed, but the we don't adjust the time
+  return [localTS - Math.min(o2, o3) * 60 * 1000, Math.max(o2, o3)];
+}
+
+// convert an epoch timestamp into a calendar object with the given offset
+function tsToObj(ts, offset) {
+  ts += offset * 60 * 1000;
+
+  const d = new Date(ts);
+
+  return {
+    year: d.getUTCFullYear(),
+    month: d.getUTCMonth() + 1,
+    day: d.getUTCDate(),
+    hour: d.getUTCHours(),
+    minute: d.getUTCMinutes(),
+    second: d.getUTCSeconds(),
+    millisecond: d.getUTCMilliseconds(),
+  };
+}
+
+// convert a calendar object to a epoch timestamp
+function objToTS(obj, offset, zone) {
+  return fixOffset(objToLocalTS(obj), offset, zone);
+}
+
+// create a new DT instance by adding a duration, adjusting for DSTs
+function adjustTime(inst, dur) {
+  const oPre = inst.o,
+    year = inst.c.year + Math.trunc(dur.years),
+    month = inst.c.month + Math.trunc(dur.months) + Math.trunc(dur.quarters) * 3,
+    c = {
+      ...inst.c,
+      year,
+      month,
+      day:
+        Math.min(inst.c.day, daysInMonth(year, month)) +
+        Math.trunc(dur.days) +
+        Math.trunc(dur.weeks) * 7,
+    },
+    millisToAdd = Duration.fromObject({
+      years: dur.years - Math.trunc(dur.years),
+      quarters: dur.quarters - Math.trunc(dur.quarters),
+      months: dur.months - Math.trunc(dur.months),
+      weeks: dur.weeks - Math.trunc(dur.weeks),
+      days: dur.days - Math.trunc(dur.days),
+      hours: dur.hours,
+      minutes: dur.minutes,
+      seconds: dur.seconds,
+      milliseconds: dur.milliseconds,
+    }).as("milliseconds"),
+    localTS = objToLocalTS(c);
+
+  let [ts, o] = fixOffset(localTS, oPre, inst.zone);
+
+  if (millisToAdd !== 0) {
+    ts += millisToAdd;
+    // that could have changed the offset by going over a DST, but we want to keep the ts the same
+    o = inst.zone.offset(ts);
+  }
+
+  return { ts, o };
+}
+
+// helper useful in turning the results of parsing into real dates
+// by handling the zone options
+function parseDataToDateTime(parsed, parsedZone, opts, format, text, specificOffset) {
+  const { setZone, zone } = opts;
+  if ((parsed && Object.keys(parsed).length !== 0) || parsedZone) {
+    const interpretationZone = parsedZone || zone,
+      inst = DateTime.fromObject(parsed, {
+        ...opts,
+        zone: interpretationZone,
+        specificOffset,
+      });
+    return setZone ? inst : inst.setZone(zone);
+  } else {
+    return DateTime.invalid(
+      new Invalid("unparsable", `the input "${text}" can't be parsed as ${format}`)
+    );
+  }
+}
+
+// if you want to output a technical format (e.g. RFC 2822), this helper
+// helps handle the details
+function toTechFormat(dt, format, allowZ = true) {
+  return dt.isValid
+    ? Formatter.create(Locale.create("en-US"), {
+        allowZ,
+        forceSimple: true,
+      }).formatDateTimeFromString(dt, format)
+    : null;
+}
+
+function toISODate(o, extended, precision) {
+  const longFormat = o.c.year > 9999 || o.c.year < 0;
+  let c = "";
+  if (longFormat && o.c.year >= 0) c += "+";
+  c += padStart(o.c.year, longFormat ? 6 : 4);
+  if (precision === "year") return c;
+  if (extended) {
+    c += "-";
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+    c += "-";
+  } else {
+    c += padStart(o.c.month);
+    if (precision === "month") return c;
+  }
+  c += padStart(o.c.day);
+  return c;
+}
+
+function toISOTime(
+  o,
+  extended,
+  suppressSeconds,
+  suppressMilliseconds,
+  includeOffset,
+  extendedZone,
+  precision
+) {
+  let showSeconds = !suppressSeconds || o.c.millisecond !== 0 || o.c.second !== 0,
+    c = "";
+  switch (precision) {
+    case "day":
+    case "month":
+    case "year":
+      break;
+    default:
+      c += padStart(o.c.hour);
+      if (precision === "hour") break;
+      if (extended) {
+        c += ":";
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += ":";
+          c += padStart(o.c.second);
+        }
+      } else {
+        c += padStart(o.c.minute);
+        if (precision === "minute") break;
+        if (showSeconds) {
+          c += padStart(o.c.second);
+        }
+      }
+      if (precision === "second") break;
+      if (showSeconds && (!suppressMilliseconds || o.c.millisecond !== 0)) {
+        c += ".";
+        c += padStart(o.c.millisecond, 3);
+      }
+  }
+
+  if (includeOffset) {
+    if (o.isOffsetFixed && o.offset === 0 && !extendedZone) {
+      c += "Z";
+    } else if (o.o < 0) {
+      c += "-";
+      c += padStart(Math.trunc(-o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(-o.o % 60));
+    } else {
+      c += "+";
+      c += padStart(Math.trunc(o.o / 60));
+      c += ":";
+      c += padStart(Math.trunc(o.o % 60));
+    }
+  }
+
+  if (extendedZone) {
+    c += "[" + o.zone.ianaName + "]";
+  }
+  return c;
+}
+
+// defaults for unspecified units in the supported calendars
+const defaultUnitValues = {
+    month: 1,
+    day: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  },
+  defaultWeekUnitValues = {
+    weekNumber: 1,
+    weekday: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  },
+  defaultOrdinalUnitValues = {
+    ordinal: 1,
+    hour: 0,
+    minute: 0,
+    second: 0,
+    millisecond: 0,
+  };
+
+// Units in the supported calendars, sorted by bigness
+const orderedUnits = ["year", "month", "day", "hour", "minute", "second", "millisecond"],
+  orderedWeekUnits = [
+    "weekYear",
+    "weekNumber",
+    "weekday",
+    "hour",
+    "minute",
+    "second",
+    "millisecond",
+  ],
+  orderedOrdinalUnits = ["year", "ordinal", "hour", "minute", "second", "millisecond"];
+
+// standardize case and plurality in units
+function normalizeUnit(unit) {
+  const normalized = {
+    year: "year",
+    years: "year",
+    month: "month",
+    months: "month",
+    day: "day",
+    days: "day",
+    hour: "hour",
+    hours: "hour",
+    minute: "minute",
+    minutes: "minute",
+    quarter: "quarter",
+    quarters: "quarter",
+    second: "second",
+    seconds: "second",
+    millisecond: "millisecond",
+    milliseconds: "millisecond",
+    weekday: "weekday",
+    weekdays: "weekday",
+    weeknumber: "weekNumber",
+    weeksnumber: "weekNumber",
+    weeknumbers: "weekNumber",
+    weekyear: "weekYear",
+    weekyears: "weekYear",
+    ordinal: "ordinal",
+  }[unit.toLowerCase()];
+
+  if (!normalized) throw new InvalidUnitError(unit);
+
+  return normalized;
+}
+
+function normalizeUnitWithLocalWeeks(unit) {
+  switch (unit.toLowerCase()) {
+    case "localweekday":
+    case "localweekdays":
+      return "localWeekday";
+    case "localweeknumber":
+    case "localweeknumbers":
+      return "localWeekNumber";
+    case "localweekyear":
+    case "localweekyears":
+      return "localWeekYear";
+    default:
+      return normalizeUnit(unit);
+  }
+}
+
+// cache offsets for zones based on the current timestamp when this function is
+// first called. When we are handling a datetime from components like (year,
+// month, day, hour) in a time zone, we need a guess about what the timezone
+// offset is so that we can convert into a UTC timestamp. One way is to find the
+// offset of now in the zone. The actual date may have a different offset (for
+// example, if we handle a date in June while we're in December in a zone that
+// observes DST), but we can check and adjust that.
+//
+// When handling many dates, calculating the offset for now every time is
+// expensive. It's just a guess, so we can cache the offset to use even if we
+// are right on a time change boundary (we'll just correct in the other
+// direction). Using a timestamp from first read is a slight optimization for
+// handling dates close to the current date, since those dates will usually be
+// in the same offset (we could set the timestamp statically, instead). We use a
+// single timestamp for all zones to make things a bit more predictable.
+//
+// This is safe for quickDT (used by local() and utc()) because we don't fill in
+// higher-order units from tsNow (as we do in fromObject, this requires that
+// offset is calculated from tsNow).
+/**
+ * @param {Zone} zone
+ * @return {number}
+ */
+function guessOffsetForZone(zone) {
+  if (zoneOffsetTs === undefined) {
+    zoneOffsetTs = Settings.now();
+  }
+
+  // Do not cache anything but IANA zones, because it is not safe to do so.
+  // Guessing an offset which is not present in the zone can cause wrong results from fixOffset
+  if (zone.type !== "iana") {
+    return zone.offset(zoneOffsetTs);
+  }
+  const zoneName = zone.name;
+  let offsetGuess = zoneOffsetGuessCache.get(zoneName);
+  if (offsetGuess === undefined) {
+    offsetGuess = zone.offset(zoneOffsetTs);
+    zoneOffsetGuessCache.set(zoneName, offsetGuess);
+  }
+  return offsetGuess;
+}
+
+// this is a dumbed down version of fromObject() that runs about 60% faster
+// but doesn't do any validation, makes a bunch of assumptions about what units
+// are present, and so on.
+function quickDT(obj, opts) {
+  const zone = normalizeZone(opts.zone, Settings.defaultZone);
+  if (!zone.isValid) {
+    return DateTime.invalid(unsupportedZone(zone));
+  }
+
+  const loc = Locale.fromObject(opts);
+
+  let ts, o;
+
+  // assume we have the higher-order units
+  if (!isUndefined(obj.year)) {
+    for (const u of orderedUnits) {
+      if (isUndefined(obj[u])) {
+        obj[u] = defaultUnitValues[u];
+      }
+    }
+
+    const invalid = hasInvalidGregorianData(obj) || hasInvalidTimeData(obj);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    const offsetProvis = guessOffsetForZone(zone);
+    [ts, o] = objToTS(obj, offsetProvis, zone);
+  } else {
+    ts = Settings.now();
+  }
+
+  return new DateTime({ ts, zone, loc, o });
+}
+
+function diffRelative(start, end, opts) {
+  const round = isUndefined(opts.round) ? true : opts.round,
+    rounding = isUndefined(opts.rounding) ? "trunc" : opts.rounding,
+    format = (c, unit) => {
+      c = roundTo(c, round || opts.calendary ? 0 : 2, opts.calendary ? "round" : rounding);
+      const formatter = end.loc.clone(opts).relFormatter(opts);
+      return formatter.format(c, unit);
+    },
+    differ = (unit) => {
+      if (opts.calendary) {
+        if (!end.hasSame(start, unit)) {
+          return end.startOf(unit).diff(start.startOf(unit), unit).get(unit);
+        } else return 0;
+      } else {
+        return end.diff(start, unit).get(unit);
+      }
+    };
+
+  if (opts.unit) {
+    return format(differ(opts.unit), opts.unit);
+  }
+
+  for (const unit of opts.units) {
+    const count = differ(unit);
+    if (Math.abs(count) >= 1) {
+      return format(count, unit);
+    }
+  }
+  return format(start > end ? -0 : 0, opts.units[opts.units.length - 1]);
+}
+
+function lastOpts(argList) {
+  let opts = {},
+    args;
+  if (argList.length > 0 && typeof argList[argList.length - 1] === "object") {
+    opts = argList[argList.length - 1];
+    args = Array.from(argList).slice(0, argList.length - 1);
+  } else {
+    args = Array.from(argList);
+  }
+  return [opts, args];
+}
+
+/**
+ * Timestamp to use for cached zone offset guesses (exposed for test)
+ */
+let zoneOffsetTs;
+/**
+ * Cache for zone offset guesses (exposed for test).
+ *
+ * This optimizes quickDT via guessOffsetForZone to avoid repeated calls of
+ * zone.offset().
+ */
+const zoneOffsetGuessCache = new Map();
+
+/**
+ * A DateTime is an immutable data structure representing a specific date and time and accompanying methods. It contains class and instance methods for creating, parsing, interrogating, transforming, and formatting them.
+ *
+ * A DateTime comprises of:
+ * * A timestamp. Each DateTime instance refers to a specific millisecond of the Unix epoch.
+ * * A time zone. Each instance is considered in the context of a specific zone (by default the local system's zone).
+ * * Configuration properties that effect how output strings are formatted, such as `locale`, `numberingSystem`, and `outputCalendar`.
+ *
+ * Here is a brief overview of the most commonly used functionality it provides:
+ *
+ * * **Creation**: To create a DateTime from its components, use one of its factory class methods: {@link DateTime.local}, {@link DateTime.utc}, and (most flexibly) {@link DateTime.fromObject}. To create one from a standard string format, use {@link DateTime.fromISO}, {@link DateTime.fromHTTP}, and {@link DateTime.fromRFC2822}. To create one from a custom string format, use {@link DateTime.fromFormat}. To create one from a native JS date, use {@link DateTime.fromJSDate}.
+ * * **Gregorian calendar and time**: To examine the Gregorian properties of a DateTime individually (i.e as opposed to collectively through {@link DateTime#toObject}), use the {@link DateTime#year}, {@link DateTime#month},
+ * {@link DateTime#day}, {@link DateTime#hour}, {@link DateTime#minute}, {@link DateTime#second}, {@link DateTime#millisecond} accessors.
+ * * **Week calendar**: For ISO week calendar attributes, see the {@link DateTime#weekYear}, {@link DateTime#weekNumber}, and {@link DateTime#weekday} accessors.
+ * * **Configuration** See the {@link DateTime#locale} and {@link DateTime#numberingSystem} accessors.
+ * * **Transformation**: To transform the DateTime into other DateTimes, use {@link DateTime#set}, {@link DateTime#reconfigure}, {@link DateTime#setZone}, {@link DateTime#setLocale}, {@link DateTime.plus}, {@link DateTime#minus}, {@link DateTime#endOf}, {@link DateTime#startOf}, {@link DateTime#toUTC}, and {@link DateTime#toLocal}.
+ * * **Output**: To convert the DateTime to other representations, use the {@link DateTime#toRelative}, {@link DateTime#toRelativeCalendar}, {@link DateTime#toJSON}, {@link DateTime#toISO}, {@link DateTime#toHTTP}, {@link DateTime#toObject}, {@link DateTime#toRFC2822}, {@link DateTime#toString}, {@link DateTime#toLocaleString}, {@link DateTime#toFormat}, {@link DateTime#toMillis} and {@link DateTime#toJSDate}.
+ *
+ * There's plenty others documented below. In addition, for more information on subtler topics like internationalization, time zones, alternative calendars, validity, and so on, see the external documentation.
+ */
+export default class DateTime {
+  /**
+   * @access private
+   */
+  constructor(config) {
+    const zone = config.zone || Settings.defaultZone;
+
+    let invalid =
+      config.invalid ||
+      (Number.isNaN(config.ts) ? new Invalid("invalid input") : null) ||
+      (!zone.isValid ? unsupportedZone(zone) : null);
+    /**
+     * @access private
+     */
+    this.ts = isUndefined(config.ts) ? Settings.now() : config.ts;
+
+    let c = null,
+      o = null;
+    if (!invalid) {
+      const unchanged = config.old && config.old.ts === this.ts && config.old.zone.equals(zone);
+
+      if (unchanged) {
+        [c, o] = [config.old.c, config.old.o];
+      } else {
+        // If an offset has been passed and we have not been called from
+        // clone(), we can trust it and avoid the offset calculation.
+        const ot = isNumber(config.o) && !config.old ? config.o : zone.offset(this.ts);
+        c = tsToObj(this.ts, ot);
+        invalid = Number.isNaN(c.year) ? new Invalid("invalid input") : null;
+        c = invalid ? null : c;
+        o = invalid ? null : ot;
+      }
+    }
+
+    /**
+     * @access private
+     */
+    this._zone = zone;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.invalid = invalid;
+    /**
+     * @access private
+     */
+    this.weekData = null;
+    /**
+     * @access private
+     */
+    this.localWeekData = null;
+    /**
+     * @access private
+     */
+    this.c = c;
+    /**
+     * @access private
+     */
+    this.o = o;
+    /**
+     * @access private
+     */
+    this.isLuxonDateTime = true;
+  }
+
+  // CONSTRUCT
+
+  /**
+   * Create a DateTime for the current instant, in the system's time zone.
+   *
+   * Use Settings to override these default values if needed.
+   * @example DateTime.now().toISO() //~> now in the ISO format
+   * @return {DateTime}
+   */
+  static now() {
+    return new DateTime({});
+  }
+
+  /**
+   * Create a local DateTime
+   * @param {number} [year] - The calendar year. If omitted (as in, call `local()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month, 1-indexed
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @example DateTime.local()                                  //~> now
+   * @example DateTime.local({ zone: "America/New_York" })      //~> now, in US east coast time
+   * @example DateTime.local(2017)                              //~> 2017-01-01T00:00:00
+   * @example DateTime.local(2017, 3)                           //~> 2017-03-01T00:00:00
+   * @example DateTime.local(2017, 3, 12, { locale: "fr" })     //~> 2017-03-12T00:00:00, with a French locale
+   * @example DateTime.local(2017, 3, 12, 5)                    //~> 2017-03-12T05:00:00
+   * @example DateTime.local(2017, 3, 12, 5, { zone: "utc" })   //~> 2017-03-12T05:00:00, in UTC
+   * @example DateTime.local(2017, 3, 12, 5, 45)                //~> 2017-03-12T05:45:00
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10)            //~> 2017-03-12T05:45:10
+   * @example DateTime.local(2017, 3, 12, 5, 45, 10, 765)       //~> 2017-03-12T05:45:10.765
+   * @return {DateTime}
+   */
+  static local() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);
+  }
+
+  /**
+   * Create a DateTime in UTC
+   * @param {number} [year] - The calendar year. If omitted (as in, call `utc()` with no arguments), the current time will be used
+   * @param {number} [month=1] - The month, 1-indexed
+   * @param {number} [day=1] - The day of the month
+   * @param {number} [hour=0] - The hour of the day, in 24-hour time
+   * @param {number} [minute=0] - The minute of the hour, meaning a number between 0 and 59
+   * @param {number} [second=0] - The second of the minute, meaning a number between 0 and 59
+   * @param {number} [millisecond=0] - The millisecond of the second, meaning a number between 0 and 999
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} [options.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [options.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [options.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.utc()                                              //~> now
+   * @example DateTime.utc(2017)                                          //~> 2017-01-01T00:00:00Z
+   * @example DateTime.utc(2017, 3)                                       //~> 2017-03-01T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12)                                   //~> 2017-03-12T00:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5)                                //~> 2017-03-12T05:00:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45)                            //~> 2017-03-12T05:45:00Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, { locale: "fr" })          //~> 2017-03-12T05:45:00Z with a French locale
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10)                        //~> 2017-03-12T05:45:10Z
+   * @example DateTime.utc(2017, 3, 12, 5, 45, 10, 765, { locale: "fr" }) //~> 2017-03-12T05:45:10.765Z with a French locale
+   * @return {DateTime}
+   */
+  static utc() {
+    const [opts, args] = lastOpts(arguments),
+      [year, month, day, hour, minute, second, millisecond] = args;
+
+    opts.zone = FixedOffsetZone.utcInstance;
+    return quickDT({ year, month, day, hour, minute, second, millisecond }, opts);
+  }
+
+  /**
+   * Create a DateTime from a JavaScript Date object. Uses the default zone.
+   * @param {Date} date - a JavaScript Date object
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @return {DateTime}
+   */
+  static fromJSDate(date, options = {}) {
+    const ts = isDate(date) ? date.valueOf() : NaN;
+    if (Number.isNaN(ts)) {
+      return DateTime.invalid("invalid input");
+    }
+
+    const zoneToUse = normalizeZone(options.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+
+    return new DateTime({
+      ts: ts,
+      zone: zoneToUse,
+      loc: Locale.fromObject(options),
+    });
+  }
+
+  /**
+   * Create a DateTime from a number of milliseconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} milliseconds - a number of milliseconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromMillis(milliseconds, options = {}) {
+    if (!isNumber(milliseconds)) {
+      throw new InvalidArgumentError(
+        `fromMillis requires a numerical input, but received a ${typeof milliseconds} with value ${milliseconds}`
+      );
+    } else if (milliseconds < -MAX_DATE || milliseconds > MAX_DATE) {
+      // this isn't perfect because we can still end up out of range because of additional shifting, but it's a start
+      return DateTime.invalid("Timestamp out of range");
+    } else {
+      return new DateTime({
+        ts: milliseconds,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options),
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a number of seconds since the epoch (meaning since 1 January 1970 00:00:00 UTC). Uses the default zone.
+   * @param {number} seconds - a number of seconds since 1970 UTC
+   * @param {Object} options - configuration options for the DateTime
+   * @param {string|Zone} [options.zone='local'] - the zone to place the DateTime into
+   * @param {string} [options.locale] - a locale to set on the resulting DateTime instance
+   * @param {string} options.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} options.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} options.weekSettings - the week settings to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromSeconds(seconds, options = {}) {
+    if (!isNumber(seconds)) {
+      throw new InvalidArgumentError("fromSeconds requires a numerical input");
+    } else {
+      return new DateTime({
+        ts: seconds * 1000,
+        zone: normalizeZone(options.zone, Settings.defaultZone),
+        loc: Locale.fromObject(options),
+      });
+    }
+  }
+
+  /**
+   * Create a DateTime from a JavaScript object with keys like 'year' and 'hour' with reasonable defaults.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.year - a year, such as 1987
+   * @param {number} obj.month - a month, 1-12
+   * @param {number} obj.day - a day of the month, 1-31, depending on the month
+   * @param {number} obj.ordinal - day of the year, 1-365 or 366
+   * @param {number} obj.weekYear - an ISO week year
+   * @param {number} obj.weekNumber - an ISO week number, between 1 and 52 or 53, depending on the year
+   * @param {number} obj.weekday - an ISO weekday, 1-7, where 1 is Monday and 7 is Sunday
+   * @param {number} obj.localWeekYear - a week year, according to the locale
+   * @param {number} obj.localWeekNumber - a week number, between 1 and 52 or 53, depending on the year, according to the locale
+   * @param {number} obj.localWeekday - a weekday, 1-7, where 1 is the first and 7 is the last day of the week, according to the locale
+   * @param {number} obj.hour - hour of the day, 0-23
+   * @param {number} obj.minute - minute of the hour, 0-59
+   * @param {number} obj.second - second of the minute, 0-59
+   * @param {number} obj.millisecond - millisecond of the second, 0-999
+   * @param {Object} opts - options for creating this DateTime
+   * @param {string|Zone} [opts.zone='local'] - interpret the numbers in the context of a particular zone. Can take any value taken as the first argument to setZone()
+   * @param {string} [opts.locale='system\'s locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromObject({ year: 1982, month: 5, day: 25}).toISODate() //=> '1982-05-25'
+   * @example DateTime.fromObject({ year: 1982 }).toISODate() //=> '1982-01-01'
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }) //~> today at 10:26:06
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'utc' }),
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'local' })
+   * @example DateTime.fromObject({ hour: 10, minute: 26, second: 6 }, { zone: 'America/New_York' })
+   * @example DateTime.fromObject({ weekYear: 2016, weekNumber: 2, weekday: 3 }).toISODate() //=> '2016-01-13'
+   * @example DateTime.fromObject({ localWeekYear: 2022, localWeekNumber: 1, localWeekday: 1 }, { locale: "en-US" }).toISODate() //=> '2021-12-26'
+   * @return {DateTime}
+   */
+  static fromObject(obj, opts = {}) {
+    obj = obj || {};
+    const zoneToUse = normalizeZone(opts.zone, Settings.defaultZone);
+    if (!zoneToUse.isValid) {
+      return DateTime.invalid(unsupportedZone(zoneToUse));
+    }
+
+    const loc = Locale.fromObject(opts);
+    const normalized = normalizeObject(obj, normalizeUnitWithLocalWeeks);
+    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, loc);
+
+    const tsNow = Settings.now(),
+      offsetProvis = !isUndefined(opts.specificOffset)
+        ? opts.specificOffset
+        : zoneToUse.offset(tsNow),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    // cases:
+    // just a weekday -> this week's instance of that weekday, no worries
+    // (gregorian data or ordinal) + (weekYear or weekNumber) -> error
+    // (gregorian month or day) + ordinal -> error
+    // otherwise just use weeks or ordinals or gregorian, depending on what's specified
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError(
+        "Can't mix weekYear/weekNumber units with year/month/day or ordinals"
+      );
+    }
+
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+
+    const useWeekData = definiteWeekDef || (normalized.weekday && !containsGregor);
+
+    // configure ourselves to deal with gregorian dates or week stuff
+    let units,
+      defaultValues,
+      objNow = tsToObj(tsNow, offsetProvis);
+    if (useWeekData) {
+      units = orderedWeekUnits;
+      defaultValues = defaultWeekUnitValues;
+      objNow = gregorianToWeek(objNow, minDaysInFirstWeek, startOfWeek);
+    } else if (containsOrdinal) {
+      units = orderedOrdinalUnits;
+      defaultValues = defaultOrdinalUnitValues;
+      objNow = gregorianToOrdinal(objNow);
+    } else {
+      units = orderedUnits;
+      defaultValues = defaultUnitValues;
+    }
+
+    // set default values for missing stuff
+    let foundFirst = false;
+    for (const u of units) {
+      const v = normalized[u];
+      if (!isUndefined(v)) {
+        foundFirst = true;
+      } else if (foundFirst) {
+        normalized[u] = defaultValues[u];
+      } else {
+        normalized[u] = objNow[u];
+      }
+    }
+
+    // make sure the values we have are in range
+    const higherOrderInvalid = useWeekData
+        ? hasInvalidWeekData(normalized, minDaysInFirstWeek, startOfWeek)
+        : containsOrdinal
+        ? hasInvalidOrdinalData(normalized)
+        : hasInvalidGregorianData(normalized),
+      invalid = higherOrderInvalid || hasInvalidTimeData(normalized);
+
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    }
+
+    // compute the actual time
+    const gregorian = useWeekData
+        ? weekToGregorian(normalized, minDaysInFirstWeek, startOfWeek)
+        : containsOrdinal
+        ? ordinalToGregorian(normalized)
+        : normalized,
+      [tsFinal, offsetFinal] = objToTS(gregorian, offsetProvis, zoneToUse),
+      inst = new DateTime({
+        ts: tsFinal,
+        zone: zoneToUse,
+        o: offsetFinal,
+        loc,
+      });
+
+    // gregorian data + weekday serves only to validate
+    if (normalized.weekday && containsGregor && obj.weekday !== inst.weekday) {
+      return DateTime.invalid(
+        "mismatched weekday",
+        `you can't specify both a weekday of ${normalized.weekday} and a date of ${inst.toISO()}`
+      );
+    }
+
+    if (!inst.isValid) {
+      return DateTime.invalid(inst.invalid);
+    }
+
+    return inst;
+  }
+
+  /**
+   * Create a DateTime from an ISO 8601 string
+   * @param {string} text - the ISO string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the time to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} [opts.outputCalendar] - the output calendar to set on the resulting DateTime instance
+   * @param {string} [opts.numberingSystem] - the numbering system to set on the resulting DateTime instance
+   * @param {string} [opts.weekSettings] - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00')
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123+06:00', {setZone: true})
+   * @example DateTime.fromISO('2016-05-25T09:08:34.123', {zone: 'utc'})
+   * @example DateTime.fromISO('2016-W05-4')
+   * @return {DateTime}
+   */
+  static fromISO(text, opts = {}) {
+    const [vals, parsedZone] = parseISODate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "ISO 8601", text);
+  }
+
+  /**
+   * Create a DateTime from an RFC 2822 string
+   * @param {string} text - the RFC 2822 string
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since the offset is always specified in the string itself, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with a fixed-offset zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23:12 GMT')
+   * @example DateTime.fromRFC2822('Fri, 25 Nov 2016 13:23:12 +0600')
+   * @example DateTime.fromRFC2822('25 Nov 2016 13:23 Z')
+   * @return {DateTime}
+   */
+  static fromRFC2822(text, opts = {}) {
+    const [vals, parsedZone] = parseRFC2822Date(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "RFC 2822", text);
+  }
+
+  /**
+   * Create a DateTime from an HTTP header date
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @param {string} text - the HTTP header date
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - convert the time to this zone. Since HTTP dates are always in UTC, this has no effect on the interpretation of string, merely the zone the resulting DateTime is expressed in.
+   * @param {boolean} [opts.setZone=false] - override the zone with the fixed-offset zone specified in the string. For HTTP dates, this is always UTC, so this option is equivalent to setting the `zone` option to 'utc', but this option is included for consistency with similar methods.
+   * @param {string} [opts.locale='system's locale'] - a locale to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @param {string} opts.numberingSystem - the numbering system to set on the resulting DateTime instance
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @example DateTime.fromHTTP('Sun, 06 Nov 1994 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sunday, 06-Nov-94 08:49:37 GMT')
+   * @example DateTime.fromHTTP('Sun Nov  6 08:49:37 1994')
+   * @return {DateTime}
+   */
+  static fromHTTP(text, opts = {}) {
+    const [vals, parsedZone] = parseHTTPDate(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "HTTP", opts);
+  }
+
+  /**
+   * Create a DateTime from an input string and format string.
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/parsing?id=table-of-tokens).
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see the link below for the formats)
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @return {DateTime}
+   */
+  static fromFormat(text, fmt, opts = {}) {
+    if (isUndefined(text) || isUndefined(fmt)) {
+      throw new InvalidArgumentError("fromFormat requires an input string and a format");
+    }
+
+    const { locale = null, numberingSystem = null } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      }),
+      [vals, parsedZone, specificOffset, invalid] = parseFromTokens(localeToUse, text, fmt);
+    if (invalid) {
+      return DateTime.invalid(invalid);
+    } else {
+      return parseDataToDateTime(vals, parsedZone, opts, `format ${fmt}`, text, specificOffset);
+    }
+  }
+
+  /**
+   * @deprecated use fromFormat instead
+   */
+  static fromString(text, fmt, opts = {}) {
+    return DateTime.fromFormat(text, fmt, opts);
+  }
+
+  /**
+   * Create a DateTime from a SQL date, time, or datetime
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale
+   * @param {string} text - the string to parse
+   * @param {Object} opts - options to affect the creation
+   * @param {string|Zone} [opts.zone='local'] - use this zone if no offset is specified in the input string itself. Will also convert the DateTime to this zone
+   * @param {boolean} [opts.setZone=false] - override the zone with a zone specified in the string itself, if it specifies one
+   * @param {string} [opts.locale='en-US'] - a locale string to use when parsing. Will also set the DateTime to this locale
+   * @param {string} opts.numberingSystem - the numbering system to use when parsing. Will also set the resulting DateTime to this numbering system
+   * @param {string} opts.weekSettings - the week settings to set on the resulting DateTime instance
+   * @param {string} opts.outputCalendar - the output calendar to set on the resulting DateTime instance
+   * @example DateTime.fromSQL('2017-05-15')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342+06:00')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles')
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342 America/Los_Angeles', { setZone: true })
+   * @example DateTime.fromSQL('2017-05-15 09:12:34.342', { zone: 'America/Los_Angeles' })
+   * @example DateTime.fromSQL('09:12:34.342')
+   * @return {DateTime}
+   */
+  static fromSQL(text, opts = {}) {
+    const [vals, parsedZone] = parseSQL(text);
+    return parseDataToDateTime(vals, parsedZone, opts, "SQL", text);
+  }
+
+  /**
+   * Create an invalid DateTime.
+   * @param {string} reason - simple string of why this DateTime is invalid. Should not contain parameters or anything else data-dependent.
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {DateTime}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the DateTime is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDateTimeError(invalid);
+    } else {
+      return new DateTime({ invalid });
+    }
+  }
+
+  /**
+   * Check if an object is an instance of DateTime. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDateTime(o) {
+    return (o && o.isLuxonDateTime) || false;
+  }
+
+  /**
+   * Produce the format string for a set of options
+   * @param formatOpts
+   * @param localeOpts
+   * @returns {string}
+   */
+  static parseFormatForOpts(formatOpts, localeOpts = {}) {
+    const tokenList = formatOptsToTokens(formatOpts, Locale.fromObject(localeOpts));
+    return !tokenList ? null : tokenList.map((t) => (t ? t.val : null)).join("");
+  }
+
+  /**
+   * Produce the the fully expanded format token for the locale
+   * Does NOT quote characters, so quoted tokens will not round trip correctly
+   * @param fmt
+   * @param localeOpts
+   * @returns {string}
+   */
+  static expandFormat(fmt, localeOpts = {}) {
+    const expanded = expandMacroTokens(Formatter.parseFormat(fmt), Locale.fromObject(localeOpts));
+    return expanded.map((t) => t.val).join("");
+  }
+
+  static resetCache() {
+    zoneOffsetTs = undefined;
+    zoneOffsetGuessCache.clear();
+  }
+
+  // INFO
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example DateTime.local(2017, 7, 4).get('month'); //=> 7
+   * @example DateTime.local(2017, 7, 4).get('day'); //=> 4
+   * @return {number}
+   */
+  get(unit) {
+    return this[unit];
+  }
+
+  /**
+   * Returns whether the DateTime is valid. Invalid DateTimes occur when:
+   * * The DateTime was created from invalid calendar information, such as the 13th month or February 30
+   * * The DateTime was created by an operation on another invalid date
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this DateTime is invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this DateTime became invalid, or null if the DateTime is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Get the locale of a DateTime, such 'en-GB'. The locale is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a DateTime, such 'beng'. The numbering system is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Get the output calendar of a DateTime, such 'islamic'. The output calendar is used when formatting the DateTime
+   *
+   * @type {string}
+   */
+  get outputCalendar() {
+    return this.isValid ? this.loc.outputCalendar : null;
+  }
+
+  /**
+   * Get the time zone associated with this DateTime.
+   * @type {Zone}
+   */
+  get zone() {
+    return this._zone;
+  }
+
+  /**
+   * Get the name of the time zone.
+   * @type {string}
+   */
+  get zoneName() {
+    return this.isValid ? this.zone.name : null;
+  }
+
+  /**
+   * Get the year
+   * @example DateTime.local(2017, 5, 25).year //=> 2017
+   * @type {number}
+   */
+  get year() {
+    return this.isValid ? this.c.year : NaN;
+  }
+
+  /**
+   * Get the quarter
+   * @example DateTime.local(2017, 5, 25).quarter //=> 2
+   * @type {number}
+   */
+  get quarter() {
+    return this.isValid ? Math.ceil(this.c.month / 3) : NaN;
+  }
+
+  /**
+   * Get the month (1-12).
+   * @example DateTime.local(2017, 5, 25).month //=> 5
+   * @type {number}
+   */
+  get month() {
+    return this.isValid ? this.c.month : NaN;
+  }
+
+  /**
+   * Get the day of the month (1-30ish).
+   * @example DateTime.local(2017, 5, 25).day //=> 25
+   * @type {number}
+   */
+  get day() {
+    return this.isValid ? this.c.day : NaN;
+  }
+
+  /**
+   * Get the hour of the day (0-23).
+   * @example DateTime.local(2017, 5, 25, 9).hour //=> 9
+   * @type {number}
+   */
+  get hour() {
+    return this.isValid ? this.c.hour : NaN;
+  }
+
+  /**
+   * Get the minute of the hour (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30).minute //=> 30
+   * @type {number}
+   */
+  get minute() {
+    return this.isValid ? this.c.minute : NaN;
+  }
+
+  /**
+   * Get the second of the minute (0-59).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52).second //=> 52
+   * @type {number}
+   */
+  get second() {
+    return this.isValid ? this.c.second : NaN;
+  }
+
+  /**
+   * Get the millisecond of the second (0-999).
+   * @example DateTime.local(2017, 5, 25, 9, 30, 52, 654).millisecond //=> 654
+   * @type {number}
+   */
+  get millisecond() {
+    return this.isValid ? this.c.millisecond : NaN;
+  }
+
+  /**
+   * Get the week year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 12, 31).weekYear //=> 2015
+   * @type {number}
+   */
+  get weekYear() {
+    return this.isValid ? possiblyCachedWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the week number of the week year (1-52ish).
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2017, 5, 25).weekNumber //=> 21
+   * @type {number}
+   */
+  get weekNumber() {
+    return this.isValid ? possiblyCachedWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the day of the week.
+   * 1 is Monday and 7 is Sunday
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2014, 11, 31).weekday //=> 4
+   * @type {number}
+   */
+  get weekday() {
+    return this.isValid ? possiblyCachedWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Returns true if this date is on a weekend according to the locale, false otherwise
+   * @returns {boolean}
+   */
+  get isWeekend() {
+    return this.isValid && this.loc.getWeekendDays().includes(this.weekday);
+  }
+
+  /**
+   * Get the day of the week according to the locale.
+   * 1 is the first day of the week and 7 is the last day of the week.
+   * If the locale assigns Sunday as the first day of the week, then a date which is a Sunday will return 1,
+   * @returns {number}
+   */
+  get localWeekday() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekday : NaN;
+  }
+
+  /**
+   * Get the week number of the week year according to the locale. Different locales assign week numbers differently,
+   * because the week can start on different days of the week (see localWeekday) and because a different number of days
+   * is required for a week to count as the first week of a year.
+   * @returns {number}
+   */
+  get localWeekNumber() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekNumber : NaN;
+  }
+
+  /**
+   * Get the week year according to the locale. Different locales assign week numbers (and therefor week years)
+   * differently, see localWeekNumber.
+   * @returns {number}
+   */
+  get localWeekYear() {
+    return this.isValid ? possiblyCachedLocalWeekData(this).weekYear : NaN;
+  }
+
+  /**
+   * Get the ordinal (meaning the day of the year)
+   * @example DateTime.local(2017, 5, 25).ordinal //=> 145
+   * @type {number|DateTime}
+   */
+  get ordinal() {
+    return this.isValid ? gregorianToOrdinal(this.c).ordinal : NaN;
+  }
+
+  /**
+   * Get the human readable short month name, such as 'Oct'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthShort //=> Oct
+   * @type {string}
+   */
+  get monthShort() {
+    return this.isValid ? Info.months("short", { locObj: this.loc })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable long month name, such as 'October'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).monthLong //=> October
+   * @type {string}
+   */
+  get monthLong() {
+    return this.isValid ? Info.months("long", { locObj: this.loc })[this.month - 1] : null;
+  }
+
+  /**
+   * Get the human readable short weekday, such as 'Mon'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayShort //=> Mon
+   * @type {string}
+   */
+  get weekdayShort() {
+    return this.isValid ? Info.weekdays("short", { locObj: this.loc })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the human readable long weekday, such as 'Monday'.
+   * Defaults to the system's locale if no locale has been specified
+   * @example DateTime.local(2017, 10, 30).weekdayLong //=> Monday
+   * @type {string}
+   */
+  get weekdayLong() {
+    return this.isValid ? Info.weekdays("long", { locObj: this.loc })[this.weekday - 1] : null;
+  }
+
+  /**
+   * Get the UTC offset of this DateTime in minutes
+   * @example DateTime.now().offset //=> -240
+   * @example DateTime.utc().offset //=> 0
+   * @type {number}
+   */
+  get offset() {
+    return this.isValid ? +this.o : NaN;
+  }
+
+  /**
+   * Get the short human name for the zone's current offset, for example "EST" or "EDT".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameShort() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "short",
+        locale: this.locale,
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get the long human name for the zone's current offset, for example "Eastern Standard Time" or "Eastern Daylight Time".
+   * Defaults to the system's locale if no locale has been specified
+   * @type {string}
+   */
+  get offsetNameLong() {
+    if (this.isValid) {
+      return this.zone.offsetName(this.ts, {
+        format: "long",
+        locale: this.locale,
+      });
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Get whether this zone's offset ever changes, as in a DST.
+   * @type {boolean}
+   */
+  get isOffsetFixed() {
+    return this.isValid ? this.zone.isUniversal : null;
+  }
+
+  /**
+   * Get whether the DateTime is in a DST.
+   * @type {boolean}
+   */
+  get isInDST() {
+    if (this.isOffsetFixed) {
+      return false;
+    } else {
+      return (
+        this.offset > this.set({ month: 1, day: 1 }).offset ||
+        this.offset > this.set({ month: 5 }).offset
+      );
+    }
+  }
+
+  /**
+   * Get those DateTimes which have the same local time as this DateTime, but a different offset from UTC
+   * in this DateTime's zone. During DST changes local time can be ambiguous, for example
+   * `2023-10-29T02:30:00` in `Europe/Berlin` can have offset `+01:00` or `+02:00`.
+   * This method will return both possible DateTimes if this DateTime's local time is ambiguous.
+   * @returns {DateTime[]}
+   */
+  getPossibleOffsets() {
+    if (!this.isValid || this.isOffsetFixed) {
+      return [this];
+    }
+    const dayMs = 86400000;
+    const minuteMs = 60000;
+    const localTS = objToLocalTS(this.c);
+    const oEarlier = this.zone.offset(localTS - dayMs);
+    const oLater = this.zone.offset(localTS + dayMs);
+
+    const o1 = this.zone.offset(localTS - oEarlier * minuteMs);
+    const o2 = this.zone.offset(localTS - oLater * minuteMs);
+    if (o1 === o2) {
+      return [this];
+    }
+    const ts1 = localTS - o1 * minuteMs;
+    const ts2 = localTS - o2 * minuteMs;
+    const c1 = tsToObj(ts1, o1);
+    const c2 = tsToObj(ts2, o2);
+    if (
+      c1.hour === c2.hour &&
+      c1.minute === c2.minute &&
+      c1.second === c2.second &&
+      c1.millisecond === c2.millisecond
+    ) {
+      return [clone(this, { ts: ts1 }), clone(this, { ts: ts2 })];
+    }
+    return [this];
+  }
+
+  /**
+   * Returns true if this DateTime is in a leap year, false otherwise
+   * @example DateTime.local(2016).isInLeapYear //=> true
+   * @example DateTime.local(2013).isInLeapYear //=> false
+   * @type {boolean}
+   */
+  get isInLeapYear() {
+    return isLeapYear(this.year);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's month
+   * @example DateTime.local(2016, 2).daysInMonth //=> 29
+   * @example DateTime.local(2016, 3).daysInMonth //=> 31
+   * @type {number}
+   */
+  get daysInMonth() {
+    return daysInMonth(this.year, this.month);
+  }
+
+  /**
+   * Returns the number of days in this DateTime's year
+   * @example DateTime.local(2016).daysInYear //=> 366
+   * @example DateTime.local(2013).daysInYear //=> 365
+   * @type {number}
+   */
+  get daysInYear() {
+    return this.isValid ? daysInYear(this.year) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's year
+   * @see https://en.wikipedia.org/wiki/ISO_week_date
+   * @example DateTime.local(2004).weeksInWeekYear //=> 53
+   * @example DateTime.local(2013).weeksInWeekYear //=> 52
+   * @type {number}
+   */
+  get weeksInWeekYear() {
+    return this.isValid ? weeksInWeekYear(this.weekYear) : NaN;
+  }
+
+  /**
+   * Returns the number of weeks in this DateTime's local week year
+   * @example DateTime.local(2020, 6, {locale: 'en-US'}).weeksInLocalWeekYear //=> 52
+   * @example DateTime.local(2020, 6, {locale: 'de-DE'}).weeksInLocalWeekYear //=> 53
+   * @type {number}
+   */
+  get weeksInLocalWeekYear() {
+    return this.isValid
+      ? weeksInWeekYear(
+          this.localWeekYear,
+          this.loc.getMinDaysInFirstWeek(),
+          this.loc.getStartOfWeek()
+        )
+      : NaN;
+  }
+
+  /**
+   * Returns the resolved Intl options for this DateTime.
+   * This is useful in understanding the behavior of formatting methods
+   * @param {Object} opts - the same options as toLocaleString
+   * @return {Object}
+   */
+  resolvedLocaleOptions(opts = {}) {
+    const { locale, numberingSystem, calendar } = Formatter.create(
+      this.loc.clone(opts),
+      opts
+    ).resolvedOptions(this);
+    return { locale, numberingSystem, outputCalendar: calendar };
+  }
+
+  // TRANSFORM
+
+  /**
+   * "Set" the DateTime's zone to UTC. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to {@link DateTime#setZone}('utc')
+   * @param {number} [offset=0] - optionally, an offset from UTC in minutes
+   * @param {Object} [opts={}] - options to pass to `setZone()`
+   * @return {DateTime}
+   */
+  toUTC(offset = 0, opts = {}) {
+    return this.setZone(FixedOffsetZone.instance(offset), opts);
+  }
+
+  /**
+   * "Set" the DateTime's zone to the host's local zone. Returns a newly-constructed DateTime.
+   *
+   * Equivalent to `setZone('local')`
+   * @return {DateTime}
+   */
+  toLocal() {
+    return this.setZone(Settings.defaultZone);
+  }
+
+  /**
+   * "Set" the DateTime's zone to specified zone. Returns a newly-constructed DateTime.
+   *
+   * By default, the setter keeps the underlying time the same (as in, the same timestamp), but the new instance will report different local times and consider DSTs when making computations, as with {@link DateTime#plus}. You may wish to use {@link DateTime#toLocal} and {@link DateTime#toUTC} which provide simple convenience wrappers for commonly used zones.
+   * @param {string|Zone} [zone='local'] - a zone identifier. As a string, that can be any IANA zone supported by the host environment, or a fixed-offset name of the form 'UTC+3', or the strings 'local' or 'utc'. You may also supply an instance of a {@link DateTime#Zone} class.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.keepLocalTime=false] - If true, adjust the underlying time so that the local time stays the same, but in the target zone. You should rarely need this.
+   * @return {DateTime}
+   */
+  setZone(zone, { keepLocalTime = false, keepCalendarTime = false } = {}) {
+    zone = normalizeZone(zone, Settings.defaultZone);
+    if (zone.equals(this.zone)) {
+      return this;
+    } else if (!zone.isValid) {
+      return DateTime.invalid(unsupportedZone(zone));
+    } else {
+      let newTS = this.ts;
+      if (keepLocalTime || keepCalendarTime) {
+        const offsetGuess = zone.offset(this.ts);
+        const asObj = this.toObject();
+        [newTS] = objToTS(asObj, offsetGuess, zone);
+      }
+      return clone(this, { ts: newTS, zone });
+    }
+  }
+
+  /**
+   * "Set" the locale, numberingSystem, or outputCalendar. Returns a newly-constructed DateTime.
+   * @param {Object} properties - the properties to set
+   * @example DateTime.local(2017, 5, 25).reconfigure({ locale: 'en-GB' })
+   * @return {DateTime}
+   */
+  reconfigure({ locale, numberingSystem, outputCalendar } = {}) {
+    const loc = this.loc.clone({ locale, numberingSystem, outputCalendar });
+    return clone(this, { loc });
+  }
+
+  /**
+   * "Set" the locale. Returns a newly-constructed DateTime.
+   * Just a convenient alias for reconfigure({ locale })
+   * @example DateTime.local(2017, 5, 25).setLocale('en-GB')
+   * @return {DateTime}
+   */
+  setLocale(locale) {
+    return this.reconfigure({ locale });
+  }
+
+  /**
+   * "Set" the values of specified units. Returns a newly-constructed DateTime.
+   * You can only set units with this method; for "setting" metadata, see {@link DateTime#reconfigure} and {@link DateTime#setZone}.
+   *
+   * This method also supports setting locale-based week units, i.e. `localWeekday`, `localWeekNumber` and `localWeekYear`.
+   * They cannot be mixed with ISO-week units like `weekday`.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dt.set({ year: 2017 })
+   * @example dt.set({ hour: 8, minute: 30 })
+   * @example dt.set({ weekday: 5 })
+   * @example dt.set({ year: 2005, ordinal: 234 })
+   * @return {DateTime}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+
+    const normalized = normalizeObject(values, normalizeUnitWithLocalWeeks);
+    const { minDaysInFirstWeek, startOfWeek } = usesLocalWeekValues(normalized, this.loc);
+
+    const settingWeekStuff =
+        !isUndefined(normalized.weekYear) ||
+        !isUndefined(normalized.weekNumber) ||
+        !isUndefined(normalized.weekday),
+      containsOrdinal = !isUndefined(normalized.ordinal),
+      containsGregorYear = !isUndefined(normalized.year),
+      containsGregorMD = !isUndefined(normalized.month) || !isUndefined(normalized.day),
+      containsGregor = containsGregorYear || containsGregorMD,
+      definiteWeekDef = normalized.weekYear || normalized.weekNumber;
+
+    if ((containsGregor || containsOrdinal) && definiteWeekDef) {
+      throw new ConflictingSpecificationError(
+        "Can't mix weekYear/weekNumber units with year/month/day or ordinals"
+      );
+    }
+
+    if (containsGregorMD && containsOrdinal) {
+      throw new ConflictingSpecificationError("Can't mix ordinal dates with month/day");
+    }
+
+    let mixed;
+    if (settingWeekStuff) {
+      mixed = weekToGregorian(
+        { ...gregorianToWeek(this.c, minDaysInFirstWeek, startOfWeek), ...normalized },
+        minDaysInFirstWeek,
+        startOfWeek
+      );
+    } else if (!isUndefined(normalized.ordinal)) {
+      mixed = ordinalToGregorian({ ...gregorianToOrdinal(this.c), ...normalized });
+    } else {
+      mixed = { ...this.toObject(), ...normalized };
+
+      // if we didn't set the day but we ended up on an overflow date,
+      // use the last day of the right month
+      if (isUndefined(normalized.day)) {
+        mixed.day = Math.min(daysInMonth(mixed.year, mixed.month), mixed.day);
+      }
+    }
+
+    const [ts, o] = objToTS(mixed, this.o, this.zone);
+    return clone(this, { ts, o });
+  }
+
+  /**
+   * Add a period of time to this DateTime and return the resulting DateTime
+   *
+   * Adding hours, minutes, seconds, or milliseconds increases the timestamp by the right number of milliseconds. Adding days, months, or years shifts the calendar, accounting for DSTs and leap years along the way. Thus, `dt.plus({ hours: 24 })` may result in a different time than `dt.plus({ days: 1 })` if there's a DST shift in between.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @example DateTime.now().plus(123) //~> in 123 milliseconds
+   * @example DateTime.now().plus({ minutes: 15 }) //~> in 15 minutes
+   * @example DateTime.now().plus({ days: 1 }) //~> this time tomorrow
+   * @example DateTime.now().plus({ days: -1 }) //~> this time yesterday
+   * @example DateTime.now().plus({ hours: 3, minutes: 13 }) //~> in 3 hr, 13 min
+   * @example DateTime.now().plus(Duration.fromObject({ hours: 3, minutes: 13 })) //~> in 3 hr, 13 min
+   * @return {DateTime}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration);
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * Subtract a period of time to this DateTime and return the resulting DateTime
+   * See {@link DateTime#plus}
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   @return {DateTime}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+    const dur = Duration.fromDurationLike(duration).negate();
+    return clone(this, adjustTime(this, dur));
+  }
+
+  /**
+   * "Set" this DateTime to the beginning of a unit of time.
+   * @param {string} unit - The unit to go to the beginning of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).startOf('month').toISODate(); //=> '2014-03-01'
+   * @example DateTime.local(2014, 3, 3).startOf('year').toISODate(); //=> '2014-01-01'
+   * @example DateTime.local(2014, 3, 3).startOf('week').toISODate(); //=> '2014-03-03', weeks always start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('day').toISOTime(); //=> '00:00.000-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).startOf('hour').toISOTime(); //=> '05:00:00.000-05:00'
+   * @return {DateTime}
+   */
+  startOf(unit, { useLocaleWeeks = false } = {}) {
+    if (!this.isValid) return this;
+
+    const o = {},
+      normalizedUnit = Duration.normalizeUnit(unit);
+    switch (normalizedUnit) {
+      case "years":
+        o.month = 1;
+      // falls through
+      case "quarters":
+      case "months":
+        o.day = 1;
+      // falls through
+      case "weeks":
+      case "days":
+        o.hour = 0;
+      // falls through
+      case "hours":
+        o.minute = 0;
+      // falls through
+      case "minutes":
+        o.second = 0;
+      // falls through
+      case "seconds":
+        o.millisecond = 0;
+        break;
+      case "milliseconds":
+        break;
+      // no default, invalid units throw in normalizeUnit()
+    }
+
+    if (normalizedUnit === "weeks") {
+      if (useLocaleWeeks) {
+        const startOfWeek = this.loc.getStartOfWeek();
+        const { weekday } = this;
+        if (weekday < startOfWeek) {
+          o.weekNumber = this.weekNumber - 1;
+        }
+        o.weekday = startOfWeek;
+      } else {
+        o.weekday = 1;
+      }
+    }
+
+    if (normalizedUnit === "quarters") {
+      const q = Math.ceil(this.month / 3);
+      o.month = (q - 1) * 3 + 1;
+    }
+
+    return this.set(o);
+  }
+
+  /**
+   * "Set" this DateTime to the end (meaning the last millisecond) of a unit of time
+   * @param {string} unit - The unit to go to the end of. Can be 'year', 'quarter', 'month', 'week', 'day', 'hour', 'minute', 'second', or 'millisecond'.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week
+   * @example DateTime.local(2014, 3, 3).endOf('month').toISO(); //=> '2014-03-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('year').toISO(); //=> '2014-12-31T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3).endOf('week').toISO(); // => '2014-03-09T23:59:59.999-05:00', weeks start on Mondays
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('day').toISO(); //=> '2014-03-03T23:59:59.999-05:00'
+   * @example DateTime.local(2014, 3, 3, 5, 30).endOf('hour').toISO(); //=> '2014-03-03T05:59:59.999-05:00'
+   * @return {DateTime}
+   */
+  endOf(unit, opts) {
+    return this.isValid
+      ? this.plus({ [unit]: 1 })
+          .startOf(unit, opts)
+          .minus(1)
+      : this;
+  }
+
+  // OUTPUT
+
+  /**
+   * Returns a string representation of this DateTime formatted according to the specified format string.
+   * **You may not want this.** See {@link DateTime#toLocaleString} for a more flexible formatting tool. For a table of tokens and their interpretations, see [here](https://moment.github.io/luxon/#/formatting?id=table-of-tokens).
+   * Defaults to en-US if no locale has been specified, regardless of the system's locale.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toFormat('yyyy LLL dd') //=> '2017 Apr 22'
+   * @example DateTime.now().setLocale('fr').toFormat('yyyy LLL dd') //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat('yyyy LLL dd', { locale: "fr" }) //=> '2017 avr. 22'
+   * @example DateTime.now().toFormat("HH 'hours and' mm 'minutes'") //=> '20 hours and 55 minutes'
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.redefaultToEN(opts)).formatDateTimeFromString(this, fmt)
+      : INVALID;
+  }
+
+  /**
+   * Returns a localized string representing this date. Accepts the same options as the Intl.DateTimeFormat constructor and any presets defined by Luxon, such as `DateTime.DATE_FULL` or `DateTime.TIME_SIMPLE`.
+   * The exact behavior of this method is browser-specific, but in general it will return an appropriate representation
+   * of the DateTime in the assigned locale.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param formatOpts {Object} - Intl.DateTimeFormat constructor options and configuration options
+   * @param {Object} opts - opts to override the configuration options on this DateTime
+   * @example DateTime.now().toLocaleString(); //=> 4/20/2017
+   * @example DateTime.now().setLocale('en-gb').toLocaleString(); //=> '20/04/2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL); //=> 'April 20, 2017'
+   * @example DateTime.now().toLocaleString(DateTime.DATE_FULL, { locale: 'fr' }); //=> '28 août 2022'
+   * @example DateTime.now().toLocaleString(DateTime.TIME_SIMPLE); //=> '11:32 AM'
+   * @example DateTime.now().toLocaleString(DateTime.DATETIME_SHORT); //=> '4/20/2017, 11:32 AM'
+   * @example DateTime.now().toLocaleString({ weekday: 'long', month: 'long', day: '2-digit' }); //=> 'Thursday, April 20'
+   * @example DateTime.now().toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> 'Thu, Apr 20, 11:27 AM'
+   * @example DateTime.now().toLocaleString({ hour: '2-digit', minute: '2-digit', hourCycle: 'h23' }); //=> '11:32'
+   * @return {string}
+   */
+  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.clone(opts), formatOpts).formatDateTime(this)
+      : INVALID;
+  }
+
+  /**
+   * Returns an array of format "parts", meaning individual tokens along with metadata. This is allows callers to post-process individual sections of the formatted output.
+   * Defaults to the system's locale if no locale has been specified
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat/formatToParts
+   * @param opts {Object} - Intl.DateTimeFormat constructor options, same as `toLocaleString`.
+   * @example DateTime.now().toLocaleParts(); //=> [
+   *                                   //=>   { type: 'day', value: '25' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'month', value: '05' },
+   *                                   //=>   { type: 'literal', value: '/' },
+   *                                   //=>   { type: 'year', value: '1982' }
+   *                                   //=> ]
+   */
+  toLocaleParts(opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.loc.clone(opts), opts).formatDateTimeParts(this)
+      : [];
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=false] - add the time zone format extension
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'years', 'months', 'days', 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc(1983, 5, 25).toISO() //=> '1982-05-25T00:00:00.000Z'
+   * @example DateTime.now().toISO() //=> '2017-04-22T20:47:05.335-04:00'
+   * @example DateTime.now().toISO({ includeOffset: false }) //=> '2017-04-22T20:47:05.335'
+   * @example DateTime.now().toISO({ format: 'basic' }) //=> '20170422T204705.335-0400'
+   * @example DateTime.now().toISO({ precision: 'day' }) //=> '2017-04-22Z'
+   * @example DateTime.now().toISO({ precision: 'minute' }) //=> '2017-04-22T20:47Z'
+   * @return {string|null}
+   */
+  toISO({
+    format = "extended",
+    suppressSeconds = false,
+    suppressMilliseconds = false,
+    includeOffset = true,
+    extendedZone = false,
+    precision = "milliseconds",
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    precision = normalizeUnit(precision);
+    const ext = format === "extended";
+
+    let c = toISODate(this, ext, precision);
+    if (orderedUnits.indexOf(precision) >= 3) c += "T";
+    c += toISOTime(
+      this,
+      ext,
+      suppressSeconds,
+      suppressMilliseconds,
+      includeOffset,
+      extendedZone,
+      precision
+    );
+    return c;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's date component
+   * @param {Object} opts - options
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='day'] - truncate output to desired precision: 'years', 'months', or 'days'.
+   * @example DateTime.utc(1982, 5, 25).toISODate() //=> '1982-05-25'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ format: 'basic' }) //=> '19820525'
+   * @example DateTime.utc(1982, 5, 25).toISODate({ precision: 'month' }) //=> '1982-05'
+   * @return {string|null}
+   */
+  toISODate({ format = "extended", precision = "day" } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, format === "extended", normalizeUnit(precision));
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's week date
+   * @example DateTime.utc(1982, 5, 25).toISOWeekDate() //=> '1982-W21-2'
+   * @return {string}
+   */
+  toISOWeekDate() {
+    return toTechFormat(this, "kkkk-'W'WW-c");
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this DateTime's time component
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.extendedZone=true] - add the time zone format extension
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @param {string} [opts.precision='milliseconds'] - truncate output to desired presicion: 'hours', 'minutes', 'seconds' or 'milliseconds'. When precision and suppressSeconds or suppressMilliseconds are used together, precision sets the maximum unit shown in the output, however seconds or milliseconds will still be suppressed if they are 0.
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime() //=> '07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, seconds: 0, milliseconds: 0 }).toISOTime({ suppressSeconds: true }) //=> '07:34Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ format: 'basic' }) //=> '073419.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34 }).toISOTime({ includePrefix: true }) //=> 'T07:34:19.361Z'
+   * @example DateTime.utc().set({ hour: 7, minute: 34, second: 56 }).toISOTime({ precision: 'minute' }) //=> '07:34Z'
+   * @return {string}
+   */
+  toISOTime({
+    suppressMilliseconds = false,
+    suppressSeconds = false,
+    includeOffset = true,
+    includePrefix = false,
+    extendedZone = false,
+    format = "extended",
+    precision = "milliseconds",
+  } = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    precision = normalizeUnit(precision);
+    let c = includePrefix && orderedUnits.indexOf(precision) >= 3 ? "T" : "";
+    return (
+      c +
+      toISOTime(
+        this,
+        format === "extended",
+        suppressSeconds,
+        suppressMilliseconds,
+        includeOffset,
+        extendedZone,
+        precision
+      )
+    );
+  }
+
+  /**
+   * Returns an RFC 2822-compatible string representation of this DateTime
+   * @example DateTime.utc(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 +0000'
+   * @example DateTime.local(2014, 7, 13).toRFC2822() //=> 'Sun, 13 Jul 2014 00:00:00 -0400'
+   * @return {string}
+   */
+  toRFC2822() {
+    return toTechFormat(this, "EEE, dd LLL yyyy HH:mm:ss ZZZ", false);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in HTTP headers. The output is always expressed in GMT.
+   * Specifically, the string conforms to RFC 1123.
+   * @see https://www.w3.org/Protocols/rfc2616/rfc2616-sec3.html#sec3.3.1
+   * @example DateTime.utc(2014, 7, 13).toHTTP() //=> 'Sun, 13 Jul 2014 00:00:00 GMT'
+   * @example DateTime.utc(2014, 7, 13, 19).toHTTP() //=> 'Sun, 13 Jul 2014 19:00:00 GMT'
+   * @return {string}
+   */
+  toHTTP() {
+    return toTechFormat(this.toUTC(), "EEE, dd LLL yyyy HH:mm:ss 'GMT'");
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Date
+   * @example DateTime.utc(2014, 7, 13).toSQLDate() //=> '2014-07-13'
+   * @return {string|null}
+   */
+  toSQLDate() {
+    if (!this.isValid) {
+      return null;
+    }
+    return toISODate(this, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL Time
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc().toSQL() //=> '05:15:16.345'
+   * @example DateTime.now().toSQL() //=> '05:15:16.345 -04:00'
+   * @example DateTime.now().toSQL({ includeOffset: false }) //=> '05:15:16.345'
+   * @example DateTime.now().toSQL({ includeZone: false }) //=> '05:15:16.345 America/New_York'
+   * @return {string}
+   */
+  toSQLTime({ includeOffset = true, includeZone = false, includeOffsetSpace = true } = {}) {
+    let fmt = "HH:mm:ss.SSS";
+
+    if (includeZone || includeOffset) {
+      if (includeOffsetSpace) {
+        fmt += " ";
+      }
+      if (includeZone) {
+        fmt += "z";
+      } else if (includeOffset) {
+        fmt += "ZZ";
+      }
+    }
+
+    return toTechFormat(this, fmt, true);
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for use in SQL DateTime
+   * @param {Object} opts - options
+   * @param {boolean} [opts.includeZone=false] - include the zone, such as 'America/New_York'. Overrides includeOffset.
+   * @param {boolean} [opts.includeOffset=true] - include the offset, such as 'Z' or '-04:00'
+   * @param {boolean} [opts.includeOffsetSpace=true] - include the space between the time and the offset, such as '05:15:16.345 -04:00'
+   * @example DateTime.utc(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 Z'
+   * @example DateTime.local(2014, 7, 13).toSQL() //=> '2014-07-13 00:00:00.000 -04:00'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeOffset: false }) //=> '2014-07-13 00:00:00.000'
+   * @example DateTime.local(2014, 7, 13).toSQL({ includeZone: true }) //=> '2014-07-13 00:00:00.000 America/New_York'
+   * @return {string}
+   */
+  toSQL(opts = {}) {
+    if (!this.isValid) {
+      return null;
+    }
+
+    return `${this.toSQLDate()} ${this.toSQLTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for debugging
+   * @return {string}
+   */
+  toString() {
+    return this.isValid ? this.toISO() : INVALID;
+  }
+
+  /**
+   * Returns a string representation of this DateTime appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `DateTime { ts: ${this.toISO()}, zone: ${this.zone.name}, locale: ${this.locale} }`;
+    } else {
+      return `DateTime { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime. Alias of {@link DateTime#toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Returns the epoch milliseconds of this DateTime.
+   * @return {number}
+   */
+  toMillis() {
+    return this.isValid ? this.ts : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (including milliseconds in the fractional part) of this DateTime.
+   * @return {number}
+   */
+  toSeconds() {
+    return this.isValid ? this.ts / 1000 : NaN;
+  }
+
+  /**
+   * Returns the epoch seconds (as a whole number) of this DateTime.
+   * @return {number}
+   */
+  toUnixInteger() {
+    return this.isValid ? Math.floor(this.ts / 1000) : NaN;
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this DateTime appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a BSON serializable equivalent to this DateTime.
+   * @return {Date}
+   */
+  toBSON() {
+    return this.toJSDate();
+  }
+
+  /**
+   * Returns a JavaScript object with this DateTime's year, month, day, and so on.
+   * @param opts - options for generating the object
+   * @param {boolean} [opts.includeConfig=false] - include configuration attributes in the output
+   * @example DateTime.now().toObject() //=> { year: 2017, month: 4, day: 22, hour: 20, minute: 49, second: 42, millisecond: 268 }
+   * @return {Object}
+   */
+  toObject(opts = {}) {
+    if (!this.isValid) return {};
+
+    const base = { ...this.c };
+
+    if (opts.includeConfig) {
+      base.outputCalendar = this.outputCalendar;
+      base.numberingSystem = this.loc.numberingSystem;
+      base.locale = this.loc.locale;
+    }
+    return base;
+  }
+
+  /**
+   * Returns a JavaScript Date equivalent to this DateTime.
+   * @return {Date}
+   */
+  toJSDate() {
+    return new Date(this.isValid ? this.ts : NaN);
+  }
+
+  // COMPARE
+
+  /**
+   * Return the difference between two DateTimes as a Duration.
+   * @param {DateTime} otherDateTime - the DateTime to compare this one to
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or array of units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example
+   * var i1 = DateTime.fromISO('1982-05-25T09:45'),
+   *     i2 = DateTime.fromISO('1983-10-14T10:30');
+   * i2.diff(i1).toObject() //=> { milliseconds: 43807500000 }
+   * i2.diff(i1, 'hours').toObject() //=> { hours: 12168.75 }
+   * i2.diff(i1, ['months', 'days']).toObject() //=> { months: 16, days: 19.03125 }
+   * i2.diff(i1, ['months', 'days', 'hours']).toObject() //=> { months: 16, days: 19, hours: 0.75 }
+   * @return {Duration}
+   */
+  diff(otherDateTime, unit = "milliseconds", opts = {}) {
+    if (!this.isValid || !otherDateTime.isValid) {
+      return Duration.invalid("created by diffing an invalid DateTime");
+    }
+
+    const durOpts = { locale: this.locale, numberingSystem: this.numberingSystem, ...opts };
+
+    const units = maybeArray(unit).map(Duration.normalizeUnit),
+      otherIsLater = otherDateTime.valueOf() > this.valueOf(),
+      earlier = otherIsLater ? this : otherDateTime,
+      later = otherIsLater ? otherDateTime : this,
+      diffed = diff(earlier, later, units, durOpts);
+
+    return otherIsLater ? diffed.negate() : diffed;
+  }
+
+  /**
+   * Return the difference between this DateTime and right now.
+   * See {@link DateTime#diff}
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units units (such as 'hours' or 'days') to include in the duration
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  diffNow(unit = "milliseconds", opts = {}) {
+    return this.diff(DateTime.now(), unit, opts);
+  }
+
+  /**
+   * Return an Interval spanning between this DateTime and another DateTime
+   * @param {DateTime} otherDateTime - the other end point of the Interval
+   * @return {Interval|DateTime}
+   */
+  until(otherDateTime) {
+    return this.isValid ? Interval.fromDateTimes(this, otherDateTime) : this;
+  }
+
+  /**
+   * Return whether this DateTime is in the same unit of time as another DateTime.
+   * Higher-order units must also be identical for this function to return `true`.
+   * Note that time zones are **ignored** in this comparison, which compares the **local** calendar time. Use {@link DateTime#setZone} to convert one of the dates if needed.
+   * @param {DateTime} otherDateTime - the other DateTime
+   * @param {string} unit - the unit of time to check sameness on
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; only the locale of this DateTime is used
+   * @example DateTime.now().hasSame(otherDT, 'day'); //~> true if otherDT is in the same current calendar day
+   * @return {boolean}
+   */
+  hasSame(otherDateTime, unit, opts) {
+    if (!this.isValid) return false;
+
+    const inputMs = otherDateTime.valueOf();
+    const adjustedToZone = this.setZone(otherDateTime.zone, { keepLocalTime: true });
+    return (
+      adjustedToZone.startOf(unit, opts) <= inputMs && inputMs <= adjustedToZone.endOf(unit, opts)
+    );
+  }
+
+  /**
+   * Equality check
+   * Two DateTimes are equal if and only if they represent the same millisecond, have the same zone and location, and are both valid.
+   * To compare just the millisecond values, use `+dt1 === +dt2`.
+   * @param {DateTime} other - the other DateTime
+   * @return {boolean}
+   */
+  equals(other) {
+    return (
+      this.isValid &&
+      other.isValid &&
+      this.valueOf() === other.valueOf() &&
+      this.zone.equals(other.zone) &&
+      this.loc.equals(other.loc)
+    );
+  }
+
+  /**
+   * Returns a string representation of a this time relative to now, such as "in two days". Can only internationalize if your
+   * platform supports Intl.RelativeTimeFormat. Rounds towards zero by default.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} [options.style="long"] - the style of units, must be "long", "short", or "narrow"
+   * @param {string|string[]} options.unit - use a specific unit or array of units; if omitted, or an array, the method will pick the best unit. Use an array or one of "years", "quarters", "months", "weeks", "days", "hours", "minutes", or "seconds"
+   * @param {boolean} [options.round=true] - whether to round the numbers in the output.
+   * @param {string} [options.rounding="trunc"] - rounding method to use when rounding the numbers in the output. Can be "trunc" (toward zero), "expand" (away from zero), "round", "floor", or "ceil".
+   * @param {number} [options.padding=0] - padding in milliseconds. This allows you to round up the result if it fits inside the threshold. Don't use in combination with {round: false} because the decimal output will include the padding.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelative() //=> "in 1 day"
+   * @example DateTime.now().setLocale("es").toRelative({ days: 1 }) //=> "dentro de 1 día"
+   * @example DateTime.now().plus({ days: 1 }).toRelative({ locale: "fr" }) //=> "dans 23 heures"
+   * @example DateTime.now().minus({ days: 2 }).toRelative() //=> "2 days ago"
+   * @example DateTime.now().minus({ days: 2 }).toRelative({ unit: "hours" }) //=> "48 hours ago"
+   * @example DateTime.now().minus({ hours: 36 }).toRelative({ round: false }) //=> "1.5 days ago"
+   */
+  toRelative(options = {}) {
+    if (!this.isValid) return null;
+    const base = options.base || DateTime.fromObject({}, { zone: this.zone }),
+      padding = options.padding ? (this < base ? -options.padding : options.padding) : 0;
+    let units = ["years", "months", "days", "hours", "minutes", "seconds"];
+    let unit = options.unit;
+    if (Array.isArray(options.unit)) {
+      units = options.unit;
+      unit = undefined;
+    }
+    return diffRelative(base, this.plus(padding), {
+      ...options,
+      numeric: "always",
+      units,
+      unit,
+    });
+  }
+
+  /**
+   * Returns a string representation of this date relative to today, such as "yesterday" or "next month".
+   * Only internationalizes on platforms that supports Intl.RelativeTimeFormat.
+   * @param {Object} options - options that affect the output
+   * @param {DateTime} [options.base=DateTime.now()] - the DateTime to use as the basis to which this time is compared. Defaults to now.
+   * @param {string} options.locale - override the locale of this DateTime
+   * @param {string} options.unit - use a specific unit; if omitted, the method will pick the unit. Use one of "years", "quarters", "months", "weeks", or "days"
+   * @param {string} options.numberingSystem - override the numberingSystem of this DateTime. The Intl system may choose not to honor this
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar() //=> "tomorrow"
+   * @example DateTime.now().setLocale("es").plus({ days: 1 }).toRelative() //=> ""mañana"
+   * @example DateTime.now().plus({ days: 1 }).toRelativeCalendar({ locale: "fr" }) //=> "demain"
+   * @example DateTime.now().minus({ days: 2 }).toRelativeCalendar() //=> "2 days ago"
+   */
+  toRelativeCalendar(options = {}) {
+    if (!this.isValid) return null;
+
+    return diffRelative(options.base || DateTime.fromObject({}, { zone: this.zone }), this, {
+      ...options,
+      numeric: "auto",
+      units: ["years", "months", "days"],
+      calendary: true,
+    });
+  }
+
+  /**
+   * Return the min of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the minimum
+   * @return {DateTime} the min DateTime, or undefined if called with no argument
+   */
+  static min(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("min requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, (i) => i.valueOf(), Math.min);
+  }
+
+  /**
+   * Return the max of several date times
+   * @param {...DateTime} dateTimes - the DateTimes from which to choose the maximum
+   * @return {DateTime} the max DateTime, or undefined if called with no argument
+   */
+  static max(...dateTimes) {
+    if (!dateTimes.every(DateTime.isDateTime)) {
+      throw new InvalidArgumentError("max requires all arguments be DateTimes");
+    }
+    return bestBy(dateTimes, (i) => i.valueOf(), Math.max);
+  }
+
+  // MISC
+
+  /**
+   * Explain how a string would be parsed by fromFormat()
+   * @param {string} text - the string to parse
+   * @param {string} fmt - the format the string is expected to be in (see description)
+   * @param {Object} options - options taken by fromFormat()
+   * @return {Object}
+   */
+  static fromFormatExplain(text, fmt, options = {}) {
+    const { locale = null, numberingSystem = null } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+    return explainFromTokens(localeToUse, text, fmt);
+  }
+
+  /**
+   * @deprecated use fromFormatExplain instead
+   */
+  static fromStringExplain(text, fmt, options = {}) {
+    return DateTime.fromFormatExplain(text, fmt, options);
+  }
+
+  /**
+   * Build a parser for `fmt` using the given locale. This parser can be passed
+   * to {@link DateTime.fromFormatParser} to a parse a date in this format. This
+   * can be used to optimize cases where many dates need to be parsed in a
+   * specific format.
+   *
+   * @param {String} fmt - the format the string is expected to be in (see
+   * description)
+   * @param {Object} options - options used to set locale and numberingSystem
+   * for parser
+   * @returns {TokenParser} - opaque object to be used
+   */
+  static buildFormatParser(fmt, options = {}) {
+    const { locale = null, numberingSystem = null } = options,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+    return new TokenParser(localeToUse, fmt);
+  }
+
+  /**
+   * Create a DateTime from an input string and format parser.
+   *
+   * The format parser must have been created with the same locale as this call.
+   *
+   * @param {String} text - the string to parse
+   * @param {TokenParser} formatParser - parser from {@link DateTime.buildFormatParser}
+   * @param {Object} opts - options taken by fromFormat()
+   * @returns {DateTime}
+   */
+  static fromFormatParser(text, formatParser, opts = {}) {
+    if (isUndefined(text) || isUndefined(formatParser)) {
+      throw new InvalidArgumentError(
+        "fromFormatParser requires an input string and a format parser"
+      );
+    }
+    const { locale = null, numberingSystem = null } = opts,
+      localeToUse = Locale.fromOpts({
+        locale,
+        numberingSystem,
+        defaultToEN: true,
+      });
+
+    if (!localeToUse.equals(formatParser.locale)) {
+      throw new InvalidArgumentError(
+        `fromFormatParser called with a locale of ${localeToUse}, ` +
+          `but the format parser was created for ${formatParser.locale}`
+      );
+    }
+
+    const { result, zone, specificOffset, invalidReason } = formatParser.explainFromTokens(text);
+
+    if (invalidReason) {
+      return DateTime.invalid(invalidReason);
+    } else {
+      return parseDataToDateTime(
+        result,
+        zone,
+        opts,
+        `format ${formatParser.format}`,
+        text,
+        specificOffset
+      );
+    }
+  }
+
+  // FORMAT PRESETS
+
+  /**
+   * {@link DateTime#toLocaleString} format like 10/14/1983
+   * @type {Object}
+   */
+  static get DATE_SHORT() {
+    return Formats.DATE_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED() {
+    return Formats.DATE_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, Oct 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_MED_WITH_WEEKDAY() {
+    return Formats.DATE_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_FULL() {
+    return Formats.DATE_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Tuesday, October 14, 1983'
+   * @type {Object}
+   */
+  static get DATE_HUGE() {
+    return Formats.DATE_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_SIMPLE() {
+    return Formats.TIME_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SECONDS() {
+    return Formats.TIME_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_SHORT_OFFSET() {
+    return Formats.TIME_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get TIME_WITH_LONG_OFFSET() {
+    return Formats.TIME_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_SIMPLE() {
+    return Formats.TIME_24_SIMPLE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SECONDS() {
+    return Formats.TIME_24_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 EDT', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_SHORT_OFFSET() {
+    return Formats.TIME_24_WITH_SHORT_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '09:30:23 Eastern Daylight Time', always 24-hour.
+   * @type {Object}
+   */
+  static get TIME_24_WITH_LONG_OFFSET() {
+    return Formats.TIME_24_WITH_LONG_OFFSET;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT() {
+    return Formats.DATETIME_SHORT;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like '10/14/1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_SHORT_WITH_SECONDS() {
+    return Formats.DATETIME_SHORT_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED() {
+    return Formats.DATETIME_MED;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Oct 14, 1983, 9:30:33 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_SECONDS() {
+    return Formats.DATETIME_MED_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Fri, 14 Oct 1983, 9:30 AM'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_MED_WITH_WEEKDAY() {
+    return Formats.DATETIME_MED_WITH_WEEKDAY;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL() {
+    return Formats.DATETIME_FULL;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'October 14, 1983, 9:30:33 AM EDT'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_FULL_WITH_SECONDS() {
+    return Formats.DATETIME_FULL_WITH_SECONDS;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE() {
+    return Formats.DATETIME_HUGE;
+  }
+
+  /**
+   * {@link DateTime#toLocaleString} format like 'Friday, October 14, 1983, 9:30:33 AM Eastern Daylight Time'. Only 12-hour if the locale is.
+   * @type {Object}
+   */
+  static get DATETIME_HUGE_WITH_SECONDS() {
+    return Formats.DATETIME_HUGE_WITH_SECONDS;
+  }
+}
+
+/**
+ * @private
+ */
+export function friendlyDateTime(dateTimeish) {
+  if (DateTime.isDateTime(dateTimeish)) {
+    return dateTimeish;
+  } else if (dateTimeish && dateTimeish.valueOf && isNumber(dateTimeish.valueOf())) {
+    return DateTime.fromJSDate(dateTimeish);
+  } else if (dateTimeish && typeof dateTimeish === "object") {
+    return DateTime.fromObject(dateTimeish);
+  } else {
+    throw new InvalidArgumentError(
+      `Unknown datetime argument: ${dateTimeish}, of type ${typeof dateTimeish}`
+    );
+  }
+}
diff --git a/node_modules/luxon/src/duration.js b/node_modules/luxon/src/duration.js
new file mode 100644
index 0000000..72db001
--- /dev/null
+++ b/node_modules/luxon/src/duration.js
@@ -0,0 +1,1009 @@
+import { InvalidArgumentError, InvalidDurationError, InvalidUnitError } from "./errors.js";
+import Formatter from "./impl/formatter.js";
+import Invalid from "./impl/invalid.js";
+import Locale from "./impl/locale.js";
+import { parseISODuration, parseISOTimeOnly } from "./impl/regexParser.js";
+import {
+  asNumber,
+  hasOwnProperty,
+  isNumber,
+  isUndefined,
+  normalizeObject,
+  roundTo,
+} from "./impl/util.js";
+import Settings from "./settings.js";
+import DateTime from "./datetime.js";
+
+const INVALID = "Invalid Duration";
+
+// unit conversion constants
+export const lowOrderMatrix = {
+    weeks: {
+      days: 7,
+      hours: 7 * 24,
+      minutes: 7 * 24 * 60,
+      seconds: 7 * 24 * 60 * 60,
+      milliseconds: 7 * 24 * 60 * 60 * 1000,
+    },
+    days: {
+      hours: 24,
+      minutes: 24 * 60,
+      seconds: 24 * 60 * 60,
+      milliseconds: 24 * 60 * 60 * 1000,
+    },
+    hours: { minutes: 60, seconds: 60 * 60, milliseconds: 60 * 60 * 1000 },
+    minutes: { seconds: 60, milliseconds: 60 * 1000 },
+    seconds: { milliseconds: 1000 },
+  },
+  casualMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: 52,
+      days: 365,
+      hours: 365 * 24,
+      minutes: 365 * 24 * 60,
+      seconds: 365 * 24 * 60 * 60,
+      milliseconds: 365 * 24 * 60 * 60 * 1000,
+    },
+    quarters: {
+      months: 3,
+      weeks: 13,
+      days: 91,
+      hours: 91 * 24,
+      minutes: 91 * 24 * 60,
+      seconds: 91 * 24 * 60 * 60,
+      milliseconds: 91 * 24 * 60 * 60 * 1000,
+    },
+    months: {
+      weeks: 4,
+      days: 30,
+      hours: 30 * 24,
+      minutes: 30 * 24 * 60,
+      seconds: 30 * 24 * 60 * 60,
+      milliseconds: 30 * 24 * 60 * 60 * 1000,
+    },
+
+    ...lowOrderMatrix,
+  },
+  daysInYearAccurate = 146097.0 / 400,
+  daysInMonthAccurate = 146097.0 / 4800,
+  accurateMatrix = {
+    years: {
+      quarters: 4,
+      months: 12,
+      weeks: daysInYearAccurate / 7,
+      days: daysInYearAccurate,
+      hours: daysInYearAccurate * 24,
+      minutes: daysInYearAccurate * 24 * 60,
+      seconds: daysInYearAccurate * 24 * 60 * 60,
+      milliseconds: daysInYearAccurate * 24 * 60 * 60 * 1000,
+    },
+    quarters: {
+      months: 3,
+      weeks: daysInYearAccurate / 28,
+      days: daysInYearAccurate / 4,
+      hours: (daysInYearAccurate * 24) / 4,
+      minutes: (daysInYearAccurate * 24 * 60) / 4,
+      seconds: (daysInYearAccurate * 24 * 60 * 60) / 4,
+      milliseconds: (daysInYearAccurate * 24 * 60 * 60 * 1000) / 4,
+    },
+    months: {
+      weeks: daysInMonthAccurate / 7,
+      days: daysInMonthAccurate,
+      hours: daysInMonthAccurate * 24,
+      minutes: daysInMonthAccurate * 24 * 60,
+      seconds: daysInMonthAccurate * 24 * 60 * 60,
+      milliseconds: daysInMonthAccurate * 24 * 60 * 60 * 1000,
+    },
+    ...lowOrderMatrix,
+  };
+
+// units ordered by size
+const orderedUnits = [
+  "years",
+  "quarters",
+  "months",
+  "weeks",
+  "days",
+  "hours",
+  "minutes",
+  "seconds",
+  "milliseconds",
+];
+
+const reverseUnits = orderedUnits.slice(0).reverse();
+
+// clone really means "create another instance just like this one, but with these changes"
+function clone(dur, alts, clear = false) {
+  // deep merge for vals
+  const conf = {
+    values: clear ? alts.values : { ...dur.values, ...(alts.values || {}) },
+    loc: dur.loc.clone(alts.loc),
+    conversionAccuracy: alts.conversionAccuracy || dur.conversionAccuracy,
+    matrix: alts.matrix || dur.matrix,
+  };
+  return new Duration(conf);
+}
+
+function durationToMillis(matrix, vals) {
+  let sum = vals.milliseconds ?? 0;
+  for (const unit of reverseUnits.slice(1)) {
+    if (vals[unit]) {
+      sum += vals[unit] * matrix[unit]["milliseconds"];
+    }
+  }
+  return sum;
+}
+
+// NB: mutates parameters
+function normalizeValues(matrix, vals) {
+  // the logic below assumes the overall value of the duration is positive
+  // if this is not the case, factor is used to make it so
+  const factor = durationToMillis(matrix, vals) < 0 ? -1 : 1;
+
+  orderedUnits.reduceRight((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const previousVal = vals[previous] * factor;
+        const conv = matrix[current][previous];
+
+        // if (previousVal < 0):
+        // lower order unit is negative (e.g. { years: 2, days: -2 })
+        // normalize this by reducing the higher order unit by the appropriate amount
+        // and increasing the lower order unit
+        // this can never make the higher order unit negative, because this function only operates
+        // on positive durations, so the amount of time represented by the lower order unit cannot
+        // be larger than the higher order unit
+        // else:
+        // lower order unit is positive (e.g. { years: 2, days: 450 } or { years: -2, days: 450 })
+        // in this case we attempt to convert as much as possible from the lower order unit into
+        // the higher order one
+        //
+        // Math.floor takes care of both of these cases, rounding away from 0
+        // if previousVal < 0 it makes the absolute value larger
+        // if previousVal >= it makes the absolute value smaller
+        const rollUp = Math.floor(previousVal / conv);
+        vals[current] += rollUp * factor;
+        vals[previous] -= rollUp * conv * factor;
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+
+  // try to convert any decimals into smaller units if possible
+  // for example for { years: 2.5, days: 0, seconds: 0 } we want to get { years: 2, days: 182, hours: 12 }
+  orderedUnits.reduce((previous, current) => {
+    if (!isUndefined(vals[current])) {
+      if (previous) {
+        const fraction = vals[previous] % 1;
+        vals[previous] -= fraction;
+        vals[current] += fraction * matrix[previous][current];
+      }
+      return current;
+    } else {
+      return previous;
+    }
+  }, null);
+}
+
+// Remove all properties with a value of 0 from an object
+function removeZeroes(vals) {
+  const newVals = {};
+  for (const [key, value] of Object.entries(vals)) {
+    if (value !== 0) {
+      newVals[key] = value;
+    }
+  }
+  return newVals;
+}
+
+/**
+ * A Duration object represents a period of time, like "2 months" or "1 day, 1 hour". Conceptually, it's just a map of units to their quantities, accompanied by some additional configuration and methods for creating, parsing, interrogating, transforming, and formatting them. They can be used on their own or in conjunction with other Luxon types; for example, you can use {@link DateTime#plus} to add a Duration object to a DateTime, producing another DateTime.
+ *
+ * Here is a brief overview of commonly used methods and getters in Duration:
+ *
+ * * **Creation** To create a Duration, use {@link Duration.fromMillis}, {@link Duration.fromObject}, or {@link Duration.fromISO}.
+ * * **Unit values** See the {@link Duration#years}, {@link Duration#months}, {@link Duration#weeks}, {@link Duration#days}, {@link Duration#hours}, {@link Duration#minutes}, {@link Duration#seconds}, {@link Duration#milliseconds} accessors.
+ * * **Configuration** See  {@link Duration#locale} and {@link Duration#numberingSystem} accessors.
+ * * **Transformation** To create new Durations out of old ones use {@link Duration#plus}, {@link Duration#minus}, {@link Duration#normalize}, {@link Duration#set}, {@link Duration#reconfigure}, {@link Duration#shiftTo}, and {@link Duration#negate}.
+ * * **Output** To convert the Duration into other representations, see {@link Duration#as}, {@link Duration#toISO}, {@link Duration#toFormat}, and {@link Duration#toJSON}
+ *
+ * There's are more methods documented below. In addition, for more information on subtler topics like internationalization and validity, see the external documentation.
+ */
+export default class Duration {
+  /**
+   * @private
+   */
+  constructor(config) {
+    const accurate = config.conversionAccuracy === "longterm" || false;
+    let matrix = accurate ? accurateMatrix : casualMatrix;
+
+    if (config.matrix) {
+      matrix = config.matrix;
+    }
+
+    /**
+     * @access private
+     */
+    this.values = config.values;
+    /**
+     * @access private
+     */
+    this.loc = config.loc || Locale.create();
+    /**
+     * @access private
+     */
+    this.conversionAccuracy = accurate ? "longterm" : "casual";
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.matrix = matrix;
+    /**
+     * @access private
+     */
+    this.isLuxonDuration = true;
+  }
+
+  /**
+   * Create Duration from a number of milliseconds.
+   * @param {number} count of milliseconds
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @return {Duration}
+   */
+  static fromMillis(count, opts) {
+    return Duration.fromObject({ milliseconds: count }, opts);
+  }
+
+  /**
+   * Create a Duration from a JavaScript object with keys like 'years' and 'hours'.
+   * If this object is empty then a zero milliseconds duration is returned.
+   * @param {Object} obj - the object to create the DateTime from
+   * @param {number} obj.years
+   * @param {number} obj.quarters
+   * @param {number} obj.months
+   * @param {number} obj.weeks
+   * @param {number} obj.days
+   * @param {number} obj.hours
+   * @param {number} obj.minutes
+   * @param {number} obj.seconds
+   * @param {number} obj.milliseconds
+   * @param {Object} [opts=[]] - options for creating this Duration
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the custom conversion system to use
+   * @return {Duration}
+   */
+  static fromObject(obj, opts = {}) {
+    if (obj == null || typeof obj !== "object") {
+      throw new InvalidArgumentError(
+        `Duration.fromObject: argument expected to be an object, got ${
+          obj === null ? "null" : typeof obj
+        }`
+      );
+    }
+
+    return new Duration({
+      values: normalizeObject(obj, Duration.normalizeUnit),
+      loc: Locale.fromObject(opts),
+      conversionAccuracy: opts.conversionAccuracy,
+      matrix: opts.matrix,
+    });
+  }
+
+  /**
+   * Create a Duration from DurationLike.
+   *
+   * @param {Object | number | Duration} durationLike
+   * One of:
+   * - object with keys like 'years' and 'hours'.
+   * - number representing milliseconds
+   * - Duration instance
+   * @return {Duration}
+   */
+  static fromDurationLike(durationLike) {
+    if (isNumber(durationLike)) {
+      return Duration.fromMillis(durationLike);
+    } else if (Duration.isDuration(durationLike)) {
+      return durationLike;
+    } else if (typeof durationLike === "object") {
+      return Duration.fromObject(durationLike);
+    } else {
+      throw new InvalidArgumentError(
+        `Unknown duration argument ${durationLike} of type ${typeof durationLike}`
+      );
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 duration string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the preset conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromISO('P3Y6M1W4DT12H30M5S').toObject() //=> { years: 3, months: 6, weeks: 1, days: 4, hours: 12, minutes: 30, seconds: 5 }
+   * @example Duration.fromISO('PT23H').toObject() //=> { hours: 23 }
+   * @example Duration.fromISO('P5Y3M').toObject() //=> { years: 5, months: 3 }
+   * @return {Duration}
+   */
+  static fromISO(text, opts) {
+    const [parsed] = parseISODuration(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create a Duration from an ISO 8601 time string.
+   * @param {string} text - text to parse
+   * @param {Object} opts - options for parsing
+   * @param {string} [opts.locale='en-US'] - the locale to use
+   * @param {string} opts.numberingSystem - the numbering system to use
+   * @param {string} [opts.conversionAccuracy='casual'] - the preset conversion system to use
+   * @param {string} [opts.matrix=Object] - the conversion system to use
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @example Duration.fromISOTime('11:22:33.444').toObject() //=> { hours: 11, minutes: 22, seconds: 33, milliseconds: 444 }
+   * @example Duration.fromISOTime('11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T11:00').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @example Duration.fromISOTime('T1100').toObject() //=> { hours: 11, minutes: 0, seconds: 0 }
+   * @return {Duration}
+   */
+  static fromISOTime(text, opts) {
+    const [parsed] = parseISOTimeOnly(text);
+    if (parsed) {
+      return Duration.fromObject(parsed, opts);
+    } else {
+      return Duration.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+    }
+  }
+
+  /**
+   * Create an invalid Duration.
+   * @param {string} reason - simple string of why this datetime is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Duration}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Duration is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidDurationError(invalid);
+    } else {
+      return new Duration({ invalid });
+    }
+  }
+
+  /**
+   * @private
+   */
+  static normalizeUnit(unit) {
+    const normalized = {
+      year: "years",
+      years: "years",
+      quarter: "quarters",
+      quarters: "quarters",
+      month: "months",
+      months: "months",
+      week: "weeks",
+      weeks: "weeks",
+      day: "days",
+      days: "days",
+      hour: "hours",
+      hours: "hours",
+      minute: "minutes",
+      minutes: "minutes",
+      second: "seconds",
+      seconds: "seconds",
+      millisecond: "milliseconds",
+      milliseconds: "milliseconds",
+    }[unit ? unit.toLowerCase() : unit];
+
+    if (!normalized) throw new InvalidUnitError(unit);
+
+    return normalized;
+  }
+
+  /**
+   * Check if an object is a Duration. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isDuration(o) {
+    return (o && o.isLuxonDuration) || false;
+  }
+
+  /**
+   * Get  the locale of a Duration, such 'en-GB'
+   * @type {string}
+   */
+  get locale() {
+    return this.isValid ? this.loc.locale : null;
+  }
+
+  /**
+   * Get the numbering system of a Duration, such 'beng'. The numbering system is used when formatting the Duration
+   *
+   * @type {string}
+   */
+  get numberingSystem() {
+    return this.isValid ? this.loc.numberingSystem : null;
+  }
+
+  /**
+   * Returns a string representation of this Duration formatted according to the specified format string. You may use these tokens:
+   * * `S` for milliseconds
+   * * `s` for seconds
+   * * `m` for minutes
+   * * `h` for hours
+   * * `d` for days
+   * * `w` for weeks
+   * * `M` for months
+   * * `y` for years
+   * Notes:
+   * * Add padding by repeating the token, e.g. "yy" pads the years to two digits, "hhhh" pads the hours out to four digits
+   * * Tokens can be escaped by wrapping with single quotes.
+   * * The duration will be converted to the set of units in the format string using {@link Duration#shiftTo} and the Durations's conversion accuracy setting.
+   * @param {string} fmt - the format string
+   * @param {Object} opts - options
+   * @param {boolean} [opts.floor=true] - floor numerical values
+   * @param {'negative'|'all'|'negativeLargestOnly'} [opts.signMode=negative] - How to handle signs
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("y d s") //=> "1 6 2"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("yy dd sss") //=> "01 06 002"
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toFormat("M S") //=> "12 518402000"
+   * @example Duration.fromObject({ days: 6, seconds: 2 }).toFormat("d s", { signMode: "all" }) //=> "+6 +2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "all" }) //=> "-6 -2"
+   * @example Duration.fromObject({ days: -6, seconds: -2 }).toFormat("d s", { signMode: "negativeLargestOnly" }) //=> "-6 2"
+   * @return {string}
+   */
+  toFormat(fmt, opts = {}) {
+    // reverse-compat since 1.2; we always round down now, never up, and we do it by default
+    const fmtOpts = {
+      ...opts,
+      floor: opts.round !== false && opts.floor !== false,
+    };
+    return this.isValid
+      ? Formatter.create(this.loc, fmtOpts).formatDurationFromString(this, fmt)
+      : INVALID;
+  }
+
+  /**
+   * Returns a string representation of a Duration with all units included.
+   * To modify its behavior, use `listStyle` and any Intl.NumberFormat option, though `unitDisplay` is especially relevant.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Intl/NumberFormat/NumberFormat#options
+   * @param {Object} opts - Formatting options. Accepts the same keys as the options parameter of the native `Intl.NumberFormat` constructor, as well as `listStyle`.
+   * @param {string} [opts.listStyle='narrow'] - How to format the merged list. Corresponds to the `style` property of the options parameter of the native `Intl.ListFormat` constructor.
+   * @param {boolean} [opts.showZeros=true] - Show all units previously used by the duration even if they are zero
+   * @example
+   * ```js
+   * var dur = Duration.fromObject({ months: 1, weeks: 0, hours: 5, minutes: 6 })
+   * dur.toHuman() //=> '1 month, 0 weeks, 5 hours, 6 minutes'
+   * dur.toHuman({ listStyle: "long" }) //=> '1 month, 0 weeks, 5 hours, and 6 minutes'
+   * dur.toHuman({ unitDisplay: "short" }) //=> '1 mth, 0 wks, 5 hr, 6 min'
+   * dur.toHuman({ showZeros: false }) //=> '1 month, 5 hours, 6 minutes'
+   * ```
+   */
+  toHuman(opts = {}) {
+    if (!this.isValid) return INVALID;
+
+    const showZeros = opts.showZeros !== false;
+
+    const l = orderedUnits
+      .map((unit) => {
+        const val = this.values[unit];
+        if (isUndefined(val) || (val === 0 && !showZeros)) {
+          return null;
+        }
+        return this.loc
+          .numberFormatter({ style: "unit", unitDisplay: "long", ...opts, unit: unit.slice(0, -1) })
+          .format(val);
+      })
+      .filter((n) => n);
+
+    return this.loc
+      .listFormatter({ type: "conjunction", style: opts.listStyle || "narrow", ...opts })
+      .format(l);
+  }
+
+  /**
+   * Returns a JavaScript object with this Duration's values.
+   * @example Duration.fromObject({ years: 1, days: 6, seconds: 2 }).toObject() //=> { years: 1, days: 6, seconds: 2 }
+   * @return {Object}
+   */
+  toObject() {
+    if (!this.isValid) return {};
+    return { ...this.values };
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Durations
+   * @example Duration.fromObject({ years: 3, seconds: 45 }).toISO() //=> 'P3YT45S'
+   * @example Duration.fromObject({ months: 4, seconds: 45 }).toISO() //=> 'P4MT45S'
+   * @example Duration.fromObject({ months: 5 }).toISO() //=> 'P5M'
+   * @example Duration.fromObject({ minutes: 5 }).toISO() //=> 'PT5M'
+   * @example Duration.fromObject({ milliseconds: 6 }).toISO() //=> 'PT0.006S'
+   * @return {string}
+   */
+  toISO() {
+    // we could use the formatter, but this is an easier way to get the minimum string
+    if (!this.isValid) return null;
+
+    let s = "P";
+    if (this.years !== 0) s += this.years + "Y";
+    if (this.months !== 0 || this.quarters !== 0) s += this.months + this.quarters * 3 + "M";
+    if (this.weeks !== 0) s += this.weeks + "W";
+    if (this.days !== 0) s += this.days + "D";
+    if (this.hours !== 0 || this.minutes !== 0 || this.seconds !== 0 || this.milliseconds !== 0)
+      s += "T";
+    if (this.hours !== 0) s += this.hours + "H";
+    if (this.minutes !== 0) s += this.minutes + "M";
+    if (this.seconds !== 0 || this.milliseconds !== 0)
+      // this will handle "floating point madness" by removing extra decimal places
+      // https://stackoverflow.com/questions/588004/is-floating-point-math-broken
+      s += roundTo(this.seconds + this.milliseconds / 1000, 3) + "S";
+    if (s === "P") s += "T0S";
+    return s;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Duration, formatted as a time of day.
+   * Note that this will return null if the duration is invalid, negative, or equal to or greater than 24 hours.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Times
+   * @param {Object} opts - options
+   * @param {boolean} [opts.suppressMilliseconds=false] - exclude milliseconds from the format if they're 0
+   * @param {boolean} [opts.suppressSeconds=false] - exclude seconds from the format if they're 0
+   * @param {boolean} [opts.includePrefix=false] - include the `T` prefix
+   * @param {string} [opts.format='extended'] - choose between the basic and extended format
+   * @example Duration.fromObject({ hours: 11 }).toISOTime() //=> '11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressMilliseconds: true }) //=> '11:00:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ suppressSeconds: true }) //=> '11:00'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ includePrefix: true }) //=> 'T11:00:00.000'
+   * @example Duration.fromObject({ hours: 11 }).toISOTime({ format: 'basic' }) //=> '110000.000'
+   * @return {string}
+   */
+  toISOTime(opts = {}) {
+    if (!this.isValid) return null;
+
+    const millis = this.toMillis();
+    if (millis < 0 || millis >= 86400000) return null;
+
+    opts = {
+      suppressMilliseconds: false,
+      suppressSeconds: false,
+      includePrefix: false,
+      format: "extended",
+      ...opts,
+      includeOffset: false,
+    };
+
+    const dateTime = DateTime.fromMillis(millis, { zone: "UTC" });
+    return dateTime.toISOTime(opts);
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in JSON.
+   * @return {string}
+   */
+  toJSON() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns an ISO 8601 representation of this Duration appropriate for use in debugging.
+   * @return {string}
+   */
+  toString() {
+    return this.toISO();
+  }
+
+  /**
+   * Returns a string representation of this Duration appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Duration { values: ${JSON.stringify(this.values)} }`;
+    } else {
+      return `Duration { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration.
+   * @return {number}
+   */
+  toMillis() {
+    if (!this.isValid) return NaN;
+
+    return durationToMillis(this.matrix, this.values);
+  }
+
+  /**
+   * Returns an milliseconds value of this Duration. Alias of {@link toMillis}
+   * @return {number}
+   */
+  valueOf() {
+    return this.toMillis();
+  }
+
+  /**
+   * Make this Duration longer by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to add. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  plus(duration) {
+    if (!this.isValid) return this;
+
+    const dur = Duration.fromDurationLike(duration),
+      result = {};
+
+    for (const k of orderedUnits) {
+      if (hasOwnProperty(dur.values, k) || hasOwnProperty(this.values, k)) {
+        result[k] = dur.get(k) + this.get(k);
+      }
+    }
+
+    return clone(this, { values: result }, true);
+  }
+
+  /**
+   * Make this Duration shorter by the specified amount. Return a newly-constructed Duration.
+   * @param {Duration|Object|number} duration - The amount to subtract. Either a Luxon Duration, a number of milliseconds, the object argument to Duration.fromObject()
+   * @return {Duration}
+   */
+  minus(duration) {
+    if (!this.isValid) return this;
+
+    const dur = Duration.fromDurationLike(duration);
+    return this.plus(dur.negate());
+  }
+
+  /**
+   * Scale this Duration by the specified amount. Return a newly-constructed Duration.
+   * @param {function} fn - The function to apply to each unit. Arity is 1 or 2: the value of the unit and, optionally, the unit name. Must return a number.
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits(x => x * 2) //=> { hours: 2, minutes: 60 }
+   * @example Duration.fromObject({ hours: 1, minutes: 30 }).mapUnits((x, u) => u === "hours" ? x * 2 : x) //=> { hours: 2, minutes: 30 }
+   * @return {Duration}
+   */
+  mapUnits(fn) {
+    if (!this.isValid) return this;
+    const result = {};
+    for (const k of Object.keys(this.values)) {
+      result[k] = asNumber(fn(this.values[k], k));
+    }
+    return clone(this, { values: result }, true);
+  }
+
+  /**
+   * Get the value of unit.
+   * @param {string} unit - a unit such as 'minute' or 'day'
+   * @example Duration.fromObject({years: 2, days: 3}).get('years') //=> 2
+   * @example Duration.fromObject({years: 2, days: 3}).get('months') //=> 0
+   * @example Duration.fromObject({years: 2, days: 3}).get('days') //=> 3
+   * @return {number}
+   */
+  get(unit) {
+    return this[Duration.normalizeUnit(unit)];
+  }
+
+  /**
+   * "Set" the values of specified units. Return a newly-constructed Duration.
+   * @param {Object} values - a mapping of units to numbers
+   * @example dur.set({ years: 2017 })
+   * @example dur.set({ hours: 8, minutes: 30 })
+   * @return {Duration}
+   */
+  set(values) {
+    if (!this.isValid) return this;
+
+    const mixed = { ...this.values, ...normalizeObject(values, Duration.normalizeUnit) };
+    return clone(this, { values: mixed });
+  }
+
+  /**
+   * "Set" the locale and/or numberingSystem.  Returns a newly-constructed Duration.
+   * @example dur.reconfigure({ locale: 'en-GB' })
+   * @return {Duration}
+   */
+  reconfigure({ locale, numberingSystem, conversionAccuracy, matrix } = {}) {
+    const loc = this.loc.clone({ locale, numberingSystem });
+    const opts = { loc, matrix, conversionAccuracy };
+    return clone(this, opts);
+  }
+
+  /**
+   * Return the length of the duration in the specified unit.
+   * @param {string} unit - a unit such as 'minutes' or 'days'
+   * @example Duration.fromObject({years: 1}).as('days') //=> 365
+   * @example Duration.fromObject({years: 1}).as('months') //=> 12
+   * @example Duration.fromObject({hours: 60}).as('days') //=> 2.5
+   * @return {number}
+   */
+  as(unit) {
+    return this.isValid ? this.shiftTo(unit).get(unit) : NaN;
+  }
+
+  /**
+   * Reduce this Duration to its canonical representation in its current units.
+   * Assuming the overall value of the Duration is positive, this means:
+   * - excessive values for lower-order units are converted to higher-order units (if possible, see first and second example)
+   * - negative lower-order units are converted to higher order units (there must be such a higher order unit, otherwise
+   *   the overall value would be negative, see third example)
+   * - fractional values for higher-order units are converted to lower-order units (if possible, see fourth example)
+   *
+   * If the overall value is negative, the result of this method is equivalent to `this.negate().normalize().negate()`.
+   * @example Duration.fromObject({ years: 2, days: 5000 }).normalize().toObject() //=> { years: 15, days: 255 }
+   * @example Duration.fromObject({ days: 5000 }).normalize().toObject() //=> { days: 5000 }
+   * @example Duration.fromObject({ hours: 12, minutes: -45 }).normalize().toObject() //=> { hours: 11, minutes: 15 }
+   * @example Duration.fromObject({ years: 2.5, days: 0, hours: 0 }).normalize().toObject() //=> { years: 2, days: 182, hours: 12 }
+   * @return {Duration}
+   */
+  normalize() {
+    if (!this.isValid) return this;
+    const vals = this.toObject();
+    normalizeValues(this.matrix, vals);
+    return clone(this, { values: vals }, true);
+  }
+
+  /**
+   * Rescale units to its largest representation
+   * @example Duration.fromObject({ milliseconds: 90000 }).rescale().toObject() //=> { minutes: 1, seconds: 30 }
+   * @return {Duration}
+   */
+  rescale() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.normalize().shiftToAll().toObject());
+    return clone(this, { values: vals }, true);
+  }
+
+  /**
+   * Convert this Duration into its representation in a different set of units.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).shiftTo('minutes', 'milliseconds').toObject() //=> { minutes: 60, milliseconds: 30000 }
+   * @return {Duration}
+   */
+  shiftTo(...units) {
+    if (!this.isValid) return this;
+
+    if (units.length === 0) {
+      return this;
+    }
+
+    units = units.map((u) => Duration.normalizeUnit(u));
+
+    const built = {},
+      accumulated = {},
+      vals = this.toObject();
+    let lastUnit;
+
+    for (const k of orderedUnits) {
+      if (units.indexOf(k) >= 0) {
+        lastUnit = k;
+
+        let own = 0;
+
+        // anything we haven't boiled down yet should get boiled to this unit
+        for (const ak in accumulated) {
+          own += this.matrix[ak][k] * accumulated[ak];
+          accumulated[ak] = 0;
+        }
+
+        // plus anything that's already in this unit
+        if (isNumber(vals[k])) {
+          own += vals[k];
+        }
+
+        // only keep the integer part for now in the hopes of putting any decimal part
+        // into a smaller unit later
+        const i = Math.trunc(own);
+        built[k] = i;
+        accumulated[k] = (own * 1000 - i * 1000) / 1000;
+
+        // otherwise, keep it in the wings to boil it later
+      } else if (isNumber(vals[k])) {
+        accumulated[k] = vals[k];
+      }
+    }
+
+    // anything leftover becomes the decimal for the last unit
+    // lastUnit must be defined since units is not empty
+    for (const key in accumulated) {
+      if (accumulated[key] !== 0) {
+        built[lastUnit] +=
+          key === lastUnit ? accumulated[key] : accumulated[key] / this.matrix[lastUnit][key];
+      }
+    }
+
+    normalizeValues(this.matrix, built);
+    return clone(this, { values: built }, true);
+  }
+
+  /**
+   * Shift this Duration to all available units.
+   * Same as shiftTo("years", "months", "weeks", "days", "hours", "minutes", "seconds", "milliseconds")
+   * @return {Duration}
+   */
+  shiftToAll() {
+    if (!this.isValid) return this;
+    return this.shiftTo(
+      "years",
+      "months",
+      "weeks",
+      "days",
+      "hours",
+      "minutes",
+      "seconds",
+      "milliseconds"
+    );
+  }
+
+  /**
+   * Return the negative of this Duration.
+   * @example Duration.fromObject({ hours: 1, seconds: 30 }).negate().toObject() //=> { hours: -1, seconds: -30 }
+   * @return {Duration}
+   */
+  negate() {
+    if (!this.isValid) return this;
+    const negated = {};
+    for (const k of Object.keys(this.values)) {
+      negated[k] = this.values[k] === 0 ? 0 : -this.values[k];
+    }
+    return clone(this, { values: negated }, true);
+  }
+
+  /**
+   * Removes all units with values equal to 0 from this Duration.
+   * @example Duration.fromObject({ years: 2, days: 0, hours: 0, minutes: 0 }).removeZeros().toObject() //=> { years: 2 }
+   * @return {Duration}
+   */
+  removeZeros() {
+    if (!this.isValid) return this;
+    const vals = removeZeroes(this.values);
+    return clone(this, { values: vals }, true);
+  }
+
+  /**
+   * Get the years.
+   * @type {number}
+   */
+  get years() {
+    return this.isValid ? this.values.years || 0 : NaN;
+  }
+
+  /**
+   * Get the quarters.
+   * @type {number}
+   */
+  get quarters() {
+    return this.isValid ? this.values.quarters || 0 : NaN;
+  }
+
+  /**
+   * Get the months.
+   * @type {number}
+   */
+  get months() {
+    return this.isValid ? this.values.months || 0 : NaN;
+  }
+
+  /**
+   * Get the weeks
+   * @type {number}
+   */
+  get weeks() {
+    return this.isValid ? this.values.weeks || 0 : NaN;
+  }
+
+  /**
+   * Get the days.
+   * @type {number}
+   */
+  get days() {
+    return this.isValid ? this.values.days || 0 : NaN;
+  }
+
+  /**
+   * Get the hours.
+   * @type {number}
+   */
+  get hours() {
+    return this.isValid ? this.values.hours || 0 : NaN;
+  }
+
+  /**
+   * Get the minutes.
+   * @type {number}
+   */
+  get minutes() {
+    return this.isValid ? this.values.minutes || 0 : NaN;
+  }
+
+  /**
+   * Get the seconds.
+   * @return {number}
+   */
+  get seconds() {
+    return this.isValid ? this.values.seconds || 0 : NaN;
+  }
+
+  /**
+   * Get the milliseconds.
+   * @return {number}
+   */
+  get milliseconds() {
+    return this.isValid ? this.values.milliseconds || 0 : NaN;
+  }
+
+  /**
+   * Returns whether the Duration is invalid. Invalid durations are returned by diff operations
+   * on invalid DateTimes or Intervals.
+   * @return {boolean}
+   */
+  get isValid() {
+    return this.invalid === null;
+  }
+
+  /**
+   * Returns an error code if this Duration became invalid, or null if the Duration is valid
+   * @return {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Duration became invalid, or null if the Duration is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Equality check
+   * Two Durations are equal iff they have the same units and the same values for each unit.
+   * @param {Duration} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+
+    if (!this.loc.equals(other.loc)) {
+      return false;
+    }
+
+    function eq(v1, v2) {
+      // Consider 0 and undefined as equal
+      if (v1 === undefined || v1 === 0) return v2 === undefined || v2 === 0;
+      return v1 === v2;
+    }
+
+    for (const u of orderedUnits) {
+      if (!eq(this.values[u], other.values[u])) {
+        return false;
+      }
+    }
+    return true;
+  }
+}
diff --git a/node_modules/luxon/src/errors.js b/node_modules/luxon/src/errors.js
new file mode 100644
index 0000000..c1f363e
--- /dev/null
+++ b/node_modules/luxon/src/errors.js
@@ -0,0 +1,61 @@
+// these aren't really private, but nor are they really useful to document
+
+/**
+ * @private
+ */
+class LuxonError extends Error {}
+
+/**
+ * @private
+ */
+export class InvalidDateTimeError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid DateTime: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+export class InvalidIntervalError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Interval: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+export class InvalidDurationError extends LuxonError {
+  constructor(reason) {
+    super(`Invalid Duration: ${reason.toMessage()}`);
+  }
+}
+
+/**
+ * @private
+ */
+export class ConflictingSpecificationError extends LuxonError {}
+
+/**
+ * @private
+ */
+export class InvalidUnitError extends LuxonError {
+  constructor(unit) {
+    super(`Invalid unit ${unit}`);
+  }
+}
+
+/**
+ * @private
+ */
+export class InvalidArgumentError extends LuxonError {}
+
+/**
+ * @private
+ */
+export class ZoneIsAbstractError extends LuxonError {
+  constructor() {
+    super("Zone is an abstract class");
+  }
+}
diff --git a/node_modules/luxon/src/impl/conversions.js b/node_modules/luxon/src/impl/conversions.js
new file mode 100644
index 0000000..4c7d117
--- /dev/null
+++ b/node_modules/luxon/src/impl/conversions.js
@@ -0,0 +1,206 @@
+import {
+  integerBetween,
+  isLeapYear,
+  timeObject,
+  daysInYear,
+  daysInMonth,
+  weeksInWeekYear,
+  isInteger,
+  isUndefined,
+} from "./util.js";
+import Invalid from "./invalid.js";
+import { ConflictingSpecificationError } from "../errors.js";
+
+const nonLeapLadder = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334],
+  leapLadder = [0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335];
+
+function unitOutOfRange(unit, value) {
+  return new Invalid(
+    "unit out of range",
+    `you specified ${value} (of type ${typeof value}) as a ${unit}, which is invalid`
+  );
+}
+
+export function dayOfWeek(year, month, day) {
+  const d = new Date(Date.UTC(year, month - 1, day));
+
+  if (year < 100 && year >= 0) {
+    d.setUTCFullYear(d.getUTCFullYear() - 1900);
+  }
+
+  const js = d.getUTCDay();
+
+  return js === 0 ? 7 : js;
+}
+
+function computeOrdinal(year, month, day) {
+  return day + (isLeapYear(year) ? leapLadder : nonLeapLadder)[month - 1];
+}
+
+function uncomputeOrdinal(year, ordinal) {
+  const table = isLeapYear(year) ? leapLadder : nonLeapLadder,
+    month0 = table.findIndex((i) => i < ordinal),
+    day = ordinal - table[month0];
+  return { month: month0 + 1, day };
+}
+
+export function isoWeekdayToLocal(isoWeekday, startOfWeek) {
+  return ((isoWeekday - startOfWeek + 7) % 7) + 1;
+}
+
+/**
+ * @private
+ */
+
+export function gregorianToWeek(gregObj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const { year, month, day } = gregObj,
+    ordinal = computeOrdinal(year, month, day),
+    weekday = isoWeekdayToLocal(dayOfWeek(year, month, day), startOfWeek);
+
+  let weekNumber = Math.floor((ordinal - weekday + 14 - minDaysInFirstWeek) / 7),
+    weekYear;
+
+  if (weekNumber < 1) {
+    weekYear = year - 1;
+    weekNumber = weeksInWeekYear(weekYear, minDaysInFirstWeek, startOfWeek);
+  } else if (weekNumber > weeksInWeekYear(year, minDaysInFirstWeek, startOfWeek)) {
+    weekYear = year + 1;
+    weekNumber = 1;
+  } else {
+    weekYear = year;
+  }
+
+  return { weekYear, weekNumber, weekday, ...timeObject(gregObj) };
+}
+
+export function weekToGregorian(weekData, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const { weekYear, weekNumber, weekday } = weekData,
+    weekdayOfJan4 = isoWeekdayToLocal(dayOfWeek(weekYear, 1, minDaysInFirstWeek), startOfWeek),
+    yearInDays = daysInYear(weekYear);
+
+  let ordinal = weekNumber * 7 + weekday - weekdayOfJan4 - 7 + minDaysInFirstWeek,
+    year;
+
+  if (ordinal < 1) {
+    year = weekYear - 1;
+    ordinal += daysInYear(year);
+  } else if (ordinal > yearInDays) {
+    year = weekYear + 1;
+    ordinal -= daysInYear(weekYear);
+  } else {
+    year = weekYear;
+  }
+
+  const { month, day } = uncomputeOrdinal(year, ordinal);
+  return { year, month, day, ...timeObject(weekData) };
+}
+
+export function gregorianToOrdinal(gregData) {
+  const { year, month, day } = gregData;
+  const ordinal = computeOrdinal(year, month, day);
+  return { year, ordinal, ...timeObject(gregData) };
+}
+
+export function ordinalToGregorian(ordinalData) {
+  const { year, ordinal } = ordinalData;
+  const { month, day } = uncomputeOrdinal(year, ordinal);
+  return { year, month, day, ...timeObject(ordinalData) };
+}
+
+/**
+ * Check if local week units like localWeekday are used in obj.
+ * If so, validates that they are not mixed with ISO week units and then copies them to the normal week unit properties.
+ * Modifies obj in-place!
+ * @param obj the object values
+ */
+export function usesLocalWeekValues(obj, loc) {
+  const hasLocaleWeekData =
+    !isUndefined(obj.localWeekday) ||
+    !isUndefined(obj.localWeekNumber) ||
+    !isUndefined(obj.localWeekYear);
+  if (hasLocaleWeekData) {
+    const hasIsoWeekData =
+      !isUndefined(obj.weekday) || !isUndefined(obj.weekNumber) || !isUndefined(obj.weekYear);
+
+    if (hasIsoWeekData) {
+      throw new ConflictingSpecificationError(
+        "Cannot mix locale-based week fields with ISO-based week fields"
+      );
+    }
+    if (!isUndefined(obj.localWeekday)) obj.weekday = obj.localWeekday;
+    if (!isUndefined(obj.localWeekNumber)) obj.weekNumber = obj.localWeekNumber;
+    if (!isUndefined(obj.localWeekYear)) obj.weekYear = obj.localWeekYear;
+    delete obj.localWeekday;
+    delete obj.localWeekNumber;
+    delete obj.localWeekYear;
+    return {
+      minDaysInFirstWeek: loc.getMinDaysInFirstWeek(),
+      startOfWeek: loc.getStartOfWeek(),
+    };
+  } else {
+    return { minDaysInFirstWeek: 4, startOfWeek: 1 };
+  }
+}
+
+export function hasInvalidWeekData(obj, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const validYear = isInteger(obj.weekYear),
+    validWeek = integerBetween(
+      obj.weekNumber,
+      1,
+      weeksInWeekYear(obj.weekYear, minDaysInFirstWeek, startOfWeek)
+    ),
+    validWeekday = integerBetween(obj.weekday, 1, 7);
+
+  if (!validYear) {
+    return unitOutOfRange("weekYear", obj.weekYear);
+  } else if (!validWeek) {
+    return unitOutOfRange("week", obj.weekNumber);
+  } else if (!validWeekday) {
+    return unitOutOfRange("weekday", obj.weekday);
+  } else return false;
+}
+
+export function hasInvalidOrdinalData(obj) {
+  const validYear = isInteger(obj.year),
+    validOrdinal = integerBetween(obj.ordinal, 1, daysInYear(obj.year));
+
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validOrdinal) {
+    return unitOutOfRange("ordinal", obj.ordinal);
+  } else return false;
+}
+
+export function hasInvalidGregorianData(obj) {
+  const validYear = isInteger(obj.year),
+    validMonth = integerBetween(obj.month, 1, 12),
+    validDay = integerBetween(obj.day, 1, daysInMonth(obj.year, obj.month));
+
+  if (!validYear) {
+    return unitOutOfRange("year", obj.year);
+  } else if (!validMonth) {
+    return unitOutOfRange("month", obj.month);
+  } else if (!validDay) {
+    return unitOutOfRange("day", obj.day);
+  } else return false;
+}
+
+export function hasInvalidTimeData(obj) {
+  const { hour, minute, second, millisecond } = obj;
+  const validHour =
+      integerBetween(hour, 0, 23) ||
+      (hour === 24 && minute === 0 && second === 0 && millisecond === 0),
+    validMinute = integerBetween(minute, 0, 59),
+    validSecond = integerBetween(second, 0, 59),
+    validMillisecond = integerBetween(millisecond, 0, 999);
+
+  if (!validHour) {
+    return unitOutOfRange("hour", hour);
+  } else if (!validMinute) {
+    return unitOutOfRange("minute", minute);
+  } else if (!validSecond) {
+    return unitOutOfRange("second", second);
+  } else if (!validMillisecond) {
+    return unitOutOfRange("millisecond", millisecond);
+  } else return false;
+}
diff --git a/node_modules/luxon/src/impl/diff.js b/node_modules/luxon/src/impl/diff.js
new file mode 100644
index 0000000..ebd129e
--- /dev/null
+++ b/node_modules/luxon/src/impl/diff.js
@@ -0,0 +1,95 @@
+import Duration from "../duration.js";
+
+function dayDiff(earlier, later) {
+  const utcDayStart = (dt) => dt.toUTC(0, { keepLocalTime: true }).startOf("day").valueOf(),
+    ms = utcDayStart(later) - utcDayStart(earlier);
+  return Math.floor(Duration.fromMillis(ms).as("days"));
+}
+
+function highOrderDiffs(cursor, later, units) {
+  const differs = [
+    ["years", (a, b) => b.year - a.year],
+    ["quarters", (a, b) => b.quarter - a.quarter + (b.year - a.year) * 4],
+    ["months", (a, b) => b.month - a.month + (b.year - a.year) * 12],
+    [
+      "weeks",
+      (a, b) => {
+        const days = dayDiff(a, b);
+        return (days - (days % 7)) / 7;
+      },
+    ],
+    ["days", dayDiff],
+  ];
+
+  const results = {};
+  const earlier = cursor;
+  let lowestOrder, highWater;
+
+  /* This loop tries to diff using larger units first.
+     If we overshoot, we backtrack and try the next smaller unit.
+     "cursor" starts out at the earlier timestamp and moves closer and closer to "later"
+     as we use smaller and smaller units.
+     highWater keeps track of where we would be if we added one more of the smallest unit,
+     this is used later to potentially convert any difference smaller than the smallest higher order unit
+     into a fraction of that smallest higher order unit
+  */
+  for (const [unit, differ] of differs) {
+    if (units.indexOf(unit) >= 0) {
+      lowestOrder = unit;
+
+      results[unit] = differ(cursor, later);
+      highWater = earlier.plus(results);
+
+      if (highWater > later) {
+        // we overshot the end point, backtrack cursor by 1
+        results[unit]--;
+        cursor = earlier.plus(results);
+
+        // if we are still overshooting now, we need to backtrack again
+        // this happens in certain situations when diffing times in different zones,
+        // because this calculation ignores time zones
+        if (cursor > later) {
+          // keep the "overshot by 1" around as highWater
+          highWater = cursor;
+          // backtrack cursor by 1
+          results[unit]--;
+          cursor = earlier.plus(results);
+        }
+      } else {
+        cursor = highWater;
+      }
+    }
+  }
+
+  return [cursor, results, highWater, lowestOrder];
+}
+
+export default function (earlier, later, units, opts) {
+  let [cursor, results, highWater, lowestOrder] = highOrderDiffs(earlier, later, units);
+
+  const remainingMillis = later - cursor;
+
+  const lowerOrderUnits = units.filter(
+    (u) => ["hours", "minutes", "seconds", "milliseconds"].indexOf(u) >= 0
+  );
+
+  if (lowerOrderUnits.length === 0) {
+    if (highWater < later) {
+      highWater = cursor.plus({ [lowestOrder]: 1 });
+    }
+
+    if (highWater !== cursor) {
+      results[lowestOrder] = (results[lowestOrder] || 0) + remainingMillis / (highWater - cursor);
+    }
+  }
+
+  const duration = Duration.fromObject(results, opts);
+
+  if (lowerOrderUnits.length > 0) {
+    return Duration.fromMillis(remainingMillis, opts)
+      .shiftTo(...lowerOrderUnits)
+      .plus(duration);
+  } else {
+    return duration;
+  }
+}
diff --git a/node_modules/luxon/src/impl/digits.js b/node_modules/luxon/src/impl/digits.js
new file mode 100644
index 0000000..db8dcca
--- /dev/null
+++ b/node_modules/luxon/src/impl/digits.js
@@ -0,0 +1,94 @@
+const numberingSystems = {
+  arab: "[\u0660-\u0669]",
+  arabext: "[\u06F0-\u06F9]",
+  bali: "[\u1B50-\u1B59]",
+  beng: "[\u09E6-\u09EF]",
+  deva: "[\u0966-\u096F]",
+  fullwide: "[\uFF10-\uFF19]",
+  gujr: "[\u0AE6-\u0AEF]",
+  hanidec: "[〇|一|二|三|四|五|六|七|八|九]",
+  khmr: "[\u17E0-\u17E9]",
+  knda: "[\u0CE6-\u0CEF]",
+  laoo: "[\u0ED0-\u0ED9]",
+  limb: "[\u1946-\u194F]",
+  mlym: "[\u0D66-\u0D6F]",
+  mong: "[\u1810-\u1819]",
+  mymr: "[\u1040-\u1049]",
+  orya: "[\u0B66-\u0B6F]",
+  tamldec: "[\u0BE6-\u0BEF]",
+  telu: "[\u0C66-\u0C6F]",
+  thai: "[\u0E50-\u0E59]",
+  tibt: "[\u0F20-\u0F29]",
+  latn: "\\d",
+};
+
+const numberingSystemsUTF16 = {
+  arab: [1632, 1641],
+  arabext: [1776, 1785],
+  bali: [6992, 7001],
+  beng: [2534, 2543],
+  deva: [2406, 2415],
+  fullwide: [65296, 65303],
+  gujr: [2790, 2799],
+  khmr: [6112, 6121],
+  knda: [3302, 3311],
+  laoo: [3792, 3801],
+  limb: [6470, 6479],
+  mlym: [3430, 3439],
+  mong: [6160, 6169],
+  mymr: [4160, 4169],
+  orya: [2918, 2927],
+  tamldec: [3046, 3055],
+  telu: [3174, 3183],
+  thai: [3664, 3673],
+  tibt: [3872, 3881],
+};
+
+const hanidecChars = numberingSystems.hanidec.replace(/[\[|\]]/g, "").split("");
+
+export function parseDigits(str) {
+  let value = parseInt(str, 10);
+  if (isNaN(value)) {
+    value = "";
+    for (let i = 0; i < str.length; i++) {
+      const code = str.charCodeAt(i);
+
+      if (str[i].search(numberingSystems.hanidec) !== -1) {
+        value += hanidecChars.indexOf(str[i]);
+      } else {
+        for (const key in numberingSystemsUTF16) {
+          const [min, max] = numberingSystemsUTF16[key];
+          if (code >= min && code <= max) {
+            value += code - min;
+          }
+        }
+      }
+    }
+    return parseInt(value, 10);
+  } else {
+    return value;
+  }
+}
+
+// cache of {numberingSystem: {append: regex}}
+const digitRegexCache = new Map();
+export function resetDigitRegexCache() {
+  digitRegexCache.clear();
+}
+
+export function digitRegex({ numberingSystem }, append = "") {
+  const ns = numberingSystem || "latn";
+
+  let appendCache = digitRegexCache.get(ns);
+  if (appendCache === undefined) {
+    appendCache = new Map();
+    digitRegexCache.set(ns, appendCache);
+  }
+  let regex = appendCache.get(append);
+  if (regex === undefined) {
+    regex = new RegExp(`${numberingSystems[ns]}${append}`);
+    appendCache.set(append, regex);
+  }
+
+  return regex;
+}
diff --git a/node_modules/luxon/src/impl/english.js b/node_modules/luxon/src/impl/english.js
new file mode 100644
index 0000000..cf93798
--- /dev/null
+++ b/node_modules/luxon/src/impl/english.js
@@ -0,0 +1,233 @@
+import * as Formats from "./formats.js";
+import { pick } from "./util.js";
+
+function stringify(obj) {
+  return JSON.stringify(obj, Object.keys(obj).sort());
+}
+
+/**
+ * @private
+ */
+
+export const monthsLong = [
+  "January",
+  "February",
+  "March",
+  "April",
+  "May",
+  "June",
+  "July",
+  "August",
+  "September",
+  "October",
+  "November",
+  "December",
+];
+
+export const monthsShort = [
+  "Jan",
+  "Feb",
+  "Mar",
+  "Apr",
+  "May",
+  "Jun",
+  "Jul",
+  "Aug",
+  "Sep",
+  "Oct",
+  "Nov",
+  "Dec",
+];
+
+export const monthsNarrow = ["J", "F", "M", "A", "M", "J", "J", "A", "S", "O", "N", "D"];
+
+export function months(length) {
+  switch (length) {
+    case "narrow":
+      return [...monthsNarrow];
+    case "short":
+      return [...monthsShort];
+    case "long":
+      return [...monthsLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10", "11", "12"];
+    case "2-digit":
+      return ["01", "02", "03", "04", "05", "06", "07", "08", "09", "10", "11", "12"];
+    default:
+      return null;
+  }
+}
+
+export const weekdaysLong = [
+  "Monday",
+  "Tuesday",
+  "Wednesday",
+  "Thursday",
+  "Friday",
+  "Saturday",
+  "Sunday",
+];
+
+export const weekdaysShort = ["Mon", "Tue", "Wed", "Thu", "Fri", "Sat", "Sun"];
+
+export const weekdaysNarrow = ["M", "T", "W", "T", "F", "S", "S"];
+
+export function weekdays(length) {
+  switch (length) {
+    case "narrow":
+      return [...weekdaysNarrow];
+    case "short":
+      return [...weekdaysShort];
+    case "long":
+      return [...weekdaysLong];
+    case "numeric":
+      return ["1", "2", "3", "4", "5", "6", "7"];
+    default:
+      return null;
+  }
+}
+
+export const meridiems = ["AM", "PM"];
+
+export const erasLong = ["Before Christ", "Anno Domini"];
+
+export const erasShort = ["BC", "AD"];
+
+export const erasNarrow = ["B", "A"];
+
+export function eras(length) {
+  switch (length) {
+    case "narrow":
+      return [...erasNarrow];
+    case "short":
+      return [...erasShort];
+    case "long":
+      return [...erasLong];
+    default:
+      return null;
+  }
+}
+
+export function meridiemForDateTime(dt) {
+  return meridiems[dt.hour < 12 ? 0 : 1];
+}
+
+export function weekdayForDateTime(dt, length) {
+  return weekdays(length)[dt.weekday - 1];
+}
+
+export function monthForDateTime(dt, length) {
+  return months(length)[dt.month - 1];
+}
+
+export function eraForDateTime(dt, length) {
+  return eras(length)[dt.year < 0 ? 0 : 1];
+}
+
+export function formatRelativeTime(unit, count, numeric = "always", narrow = false) {
+  const units = {
+    years: ["year", "yr."],
+    quarters: ["quarter", "qtr."],
+    months: ["month", "mo."],
+    weeks: ["week", "wk."],
+    days: ["day", "day", "days"],
+    hours: ["hour", "hr."],
+    minutes: ["minute", "min."],
+    seconds: ["second", "sec."],
+  };
+
+  const lastable = ["hours", "minutes", "seconds"].indexOf(unit) === -1;
+
+  if (numeric === "auto" && lastable) {
+    const isDay = unit === "days";
+    switch (count) {
+      case 1:
+        return isDay ? "tomorrow" : `next ${units[unit][0]}`;
+      case -1:
+        return isDay ? "yesterday" : `last ${units[unit][0]}`;
+      case 0:
+        return isDay ? "today" : `this ${units[unit][0]}`;
+      default: // fall through
+    }
+  }
+
+  const isInPast = Object.is(count, -0) || count < 0,
+    fmtValue = Math.abs(count),
+    singular = fmtValue === 1,
+    lilUnits = units[unit],
+    fmtUnit = narrow
+      ? singular
+        ? lilUnits[1]
+        : lilUnits[2] || lilUnits[1]
+      : singular
+      ? units[unit][0]
+      : unit;
+  return isInPast ? `${fmtValue} ${fmtUnit} ago` : `in ${fmtValue} ${fmtUnit}`;
+}
+
+export function formatString(knownFormat) {
+  // these all have the offsets removed because we don't have access to them
+  // without all the intl stuff this is backfilling
+  const filtered = pick(knownFormat, [
+      "weekday",
+      "era",
+      "year",
+      "month",
+      "day",
+      "hour",
+      "minute",
+      "second",
+      "timeZoneName",
+      "hourCycle",
+    ]),
+    key = stringify(filtered),
+    dateTimeHuge = "EEEE, LLLL d, yyyy, h:mm a";
+  switch (key) {
+    case stringify(Formats.DATE_SHORT):
+      return "M/d/yyyy";
+    case stringify(Formats.DATE_MED):
+      return "LLL d, yyyy";
+    case stringify(Formats.DATE_MED_WITH_WEEKDAY):
+      return "EEE, LLL d, yyyy";
+    case stringify(Formats.DATE_FULL):
+      return "LLLL d, yyyy";
+    case stringify(Formats.DATE_HUGE):
+      return "EEEE, LLLL d, yyyy";
+    case stringify(Formats.TIME_SIMPLE):
+      return "h:mm a";
+    case stringify(Formats.TIME_WITH_SECONDS):
+      return "h:mm:ss a";
+    case stringify(Formats.TIME_WITH_SHORT_OFFSET):
+      return "h:mm a";
+    case stringify(Formats.TIME_WITH_LONG_OFFSET):
+      return "h:mm a";
+    case stringify(Formats.TIME_24_SIMPLE):
+      return "HH:mm";
+    case stringify(Formats.TIME_24_WITH_SECONDS):
+      return "HH:mm:ss";
+    case stringify(Formats.TIME_24_WITH_SHORT_OFFSET):
+      return "HH:mm";
+    case stringify(Formats.TIME_24_WITH_LONG_OFFSET):
+      return "HH:mm";
+    case stringify(Formats.DATETIME_SHORT):
+      return "M/d/yyyy, h:mm a";
+    case stringify(Formats.DATETIME_MED):
+      return "LLL d, yyyy, h:mm a";
+    case stringify(Formats.DATETIME_FULL):
+      return "LLLL d, yyyy, h:mm a";
+    case stringify(Formats.DATETIME_HUGE):
+      return dateTimeHuge;
+    case stringify(Formats.DATETIME_SHORT_WITH_SECONDS):
+      return "M/d/yyyy, h:mm:ss a";
+    case stringify(Formats.DATETIME_MED_WITH_SECONDS):
+      return "LLL d, yyyy, h:mm:ss a";
+    case stringify(Formats.DATETIME_MED_WITH_WEEKDAY):
+      return "EEE, d LLL yyyy, h:mm a";
+    case stringify(Formats.DATETIME_FULL_WITH_SECONDS):
+      return "LLLL d, yyyy, h:mm:ss a";
+    case stringify(Formats.DATETIME_HUGE_WITH_SECONDS):
+      return "EEEE, LLLL d, yyyy, h:mm:ss a";
+    default:
+      return dateTimeHuge;
+  }
+}
diff --git a/node_modules/luxon/src/impl/formats.js b/node_modules/luxon/src/impl/formats.js
new file mode 100644
index 0000000..f2efaad
--- /dev/null
+++ b/node_modules/luxon/src/impl/formats.js
@@ -0,0 +1,176 @@
+/**
+ * @private
+ */
+
+const n = "numeric",
+  s = "short",
+  l = "long";
+
+export const DATE_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+};
+
+export const DATE_MED = {
+  year: n,
+  month: s,
+  day: n,
+};
+
+export const DATE_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+};
+
+export const DATE_FULL = {
+  year: n,
+  month: l,
+  day: n,
+};
+
+export const DATE_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+};
+
+export const TIME_SIMPLE = {
+  hour: n,
+  minute: n,
+};
+
+export const TIME_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+export const TIME_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s,
+};
+
+export const TIME_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l,
+};
+
+export const TIME_24_SIMPLE = {
+  hour: n,
+  minute: n,
+  hourCycle: "h23",
+};
+
+export const TIME_24_WITH_SECONDS = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+};
+
+export const TIME_24_WITH_SHORT_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: s,
+};
+
+export const TIME_24_WITH_LONG_OFFSET = {
+  hour: n,
+  minute: n,
+  second: n,
+  hourCycle: "h23",
+  timeZoneName: l,
+};
+
+export const DATETIME_SHORT = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+};
+
+export const DATETIME_SHORT_WITH_SECONDS = {
+  year: n,
+  month: n,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+export const DATETIME_MED = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+};
+
+export const DATETIME_MED_WITH_SECONDS = {
+  year: n,
+  month: s,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+};
+
+export const DATETIME_MED_WITH_WEEKDAY = {
+  year: n,
+  month: s,
+  day: n,
+  weekday: s,
+  hour: n,
+  minute: n,
+};
+
+export const DATETIME_FULL = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  timeZoneName: s,
+};
+
+export const DATETIME_FULL_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: s,
+};
+
+export const DATETIME_HUGE = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  timeZoneName: l,
+};
+
+export const DATETIME_HUGE_WITH_SECONDS = {
+  year: n,
+  month: l,
+  day: n,
+  weekday: l,
+  hour: n,
+  minute: n,
+  second: n,
+  timeZoneName: l,
+};
diff --git a/node_modules/luxon/src/impl/formatter.js b/node_modules/luxon/src/impl/formatter.js
new file mode 100644
index 0000000..f7e2d04
--- /dev/null
+++ b/node_modules/luxon/src/impl/formatter.js
@@ -0,0 +1,434 @@
+import * as English from "./english.js";
+import * as Formats from "./formats.js";
+import { padStart } from "./util.js";
+
+function stringifyTokens(splits, tokenToString) {
+  let s = "";
+  for (const token of splits) {
+    if (token.literal) {
+      s += token.val;
+    } else {
+      s += tokenToString(token.val);
+    }
+  }
+  return s;
+}
+
+const macroTokenToFormatOpts = {
+  D: Formats.DATE_SHORT,
+  DD: Formats.DATE_MED,
+  DDD: Formats.DATE_FULL,
+  DDDD: Formats.DATE_HUGE,
+  t: Formats.TIME_SIMPLE,
+  tt: Formats.TIME_WITH_SECONDS,
+  ttt: Formats.TIME_WITH_SHORT_OFFSET,
+  tttt: Formats.TIME_WITH_LONG_OFFSET,
+  T: Formats.TIME_24_SIMPLE,
+  TT: Formats.TIME_24_WITH_SECONDS,
+  TTT: Formats.TIME_24_WITH_SHORT_OFFSET,
+  TTTT: Formats.TIME_24_WITH_LONG_OFFSET,
+  f: Formats.DATETIME_SHORT,
+  ff: Formats.DATETIME_MED,
+  fff: Formats.DATETIME_FULL,
+  ffff: Formats.DATETIME_HUGE,
+  F: Formats.DATETIME_SHORT_WITH_SECONDS,
+  FF: Formats.DATETIME_MED_WITH_SECONDS,
+  FFF: Formats.DATETIME_FULL_WITH_SECONDS,
+  FFFF: Formats.DATETIME_HUGE_WITH_SECONDS,
+};
+
+/**
+ * @private
+ */
+
+export default class Formatter {
+  static create(locale, opts = {}) {
+    return new Formatter(locale, opts);
+  }
+
+  static parseFormat(fmt) {
+    // white-space is always considered a literal in user-provided formats
+    // the " " token has a special meaning (see unitForToken)
+
+    let current = null,
+      currentFull = "",
+      bracketed = false;
+    const splits = [];
+    for (let i = 0; i < fmt.length; i++) {
+      const c = fmt.charAt(i);
+      if (c === "'") {
+        // turn '' into a literal signal quote instead of just skipping the empty literal
+        if (currentFull.length > 0 || bracketed) {
+          splits.push({
+            literal: bracketed || /^\s+$/.test(currentFull),
+            val: currentFull === "" ? "'" : currentFull,
+          });
+        }
+        current = null;
+        currentFull = "";
+        bracketed = !bracketed;
+      } else if (bracketed) {
+        currentFull += c;
+      } else if (c === current) {
+        currentFull += c;
+      } else {
+        if (currentFull.length > 0) {
+          splits.push({ literal: /^\s+$/.test(currentFull), val: currentFull });
+        }
+        currentFull = c;
+        current = c;
+      }
+    }
+
+    if (currentFull.length > 0) {
+      splits.push({ literal: bracketed || /^\s+$/.test(currentFull), val: currentFull });
+    }
+
+    return splits;
+  }
+
+  static macroTokenToFormatOpts(token) {
+    return macroTokenToFormatOpts[token];
+  }
+
+  constructor(locale, formatOpts) {
+    this.opts = formatOpts;
+    this.loc = locale;
+    this.systemLoc = null;
+  }
+
+  formatWithSystemDefault(dt, opts) {
+    if (this.systemLoc === null) {
+      this.systemLoc = this.loc.redefaultToSystem();
+    }
+    const df = this.systemLoc.dtFormatter(dt, { ...this.opts, ...opts });
+    return df.format();
+  }
+
+  dtFormatter(dt, opts = {}) {
+    return this.loc.dtFormatter(dt, { ...this.opts, ...opts });
+  }
+
+  formatDateTime(dt, opts) {
+    return this.dtFormatter(dt, opts).format();
+  }
+
+  formatDateTimeParts(dt, opts) {
+    return this.dtFormatter(dt, opts).formatToParts();
+  }
+
+  formatInterval(interval, opts) {
+    const df = this.dtFormatter(interval.start, opts);
+    return df.dtf.formatRange(interval.start.toJSDate(), interval.end.toJSDate());
+  }
+
+  resolvedOptions(dt, opts) {
+    return this.dtFormatter(dt, opts).resolvedOptions();
+  }
+
+  num(n, p = 0, signDisplay = undefined) {
+    // we get some perf out of doing this here, annoyingly
+    if (this.opts.forceSimple) {
+      return padStart(n, p);
+    }
+
+    const opts = { ...this.opts };
+
+    if (p > 0) {
+      opts.padTo = p;
+    }
+    if (signDisplay) {
+      opts.signDisplay = signDisplay;
+    }
+
+    return this.loc.numberFormatter(opts).format(n);
+  }
+
+  formatDateTimeFromString(dt, fmt) {
+    const knownEnglish = this.loc.listingMode() === "en",
+      useDateTimeFormatter = this.loc.outputCalendar && this.loc.outputCalendar !== "gregory",
+      string = (opts, extract) => this.loc.extract(dt, opts, extract),
+      formatOffset = (opts) => {
+        if (dt.isOffsetFixed && dt.offset === 0 && opts.allowZ) {
+          return "Z";
+        }
+
+        return dt.isValid ? dt.zone.formatOffset(dt.ts, opts.format) : "";
+      },
+      meridiem = () =>
+        knownEnglish
+          ? English.meridiemForDateTime(dt)
+          : string({ hour: "numeric", hourCycle: "h12" }, "dayperiod"),
+      month = (length, standalone) =>
+        knownEnglish
+          ? English.monthForDateTime(dt, length)
+          : string(standalone ? { month: length } : { month: length, day: "numeric" }, "month"),
+      weekday = (length, standalone) =>
+        knownEnglish
+          ? English.weekdayForDateTime(dt, length)
+          : string(
+              standalone ? { weekday: length } : { weekday: length, month: "long", day: "numeric" },
+              "weekday"
+            ),
+      maybeMacro = (token) => {
+        const formatOpts = Formatter.macroTokenToFormatOpts(token);
+        if (formatOpts) {
+          return this.formatWithSystemDefault(dt, formatOpts);
+        } else {
+          return token;
+        }
+      },
+      era = (length) =>
+        knownEnglish ? English.eraForDateTime(dt, length) : string({ era: length }, "era"),
+      tokenToString = (token) => {
+        // Where possible: https://cldr.unicode.org/translation/date-time/date-time-symbols
+        switch (token) {
+          // ms
+          case "S":
+            return this.num(dt.millisecond);
+          case "u":
+          // falls through
+          case "SSS":
+            return this.num(dt.millisecond, 3);
+          // seconds
+          case "s":
+            return this.num(dt.second);
+          case "ss":
+            return this.num(dt.second, 2);
+          // fractional seconds
+          case "uu":
+            return this.num(Math.floor(dt.millisecond / 10), 2);
+          case "uuu":
+            return this.num(Math.floor(dt.millisecond / 100));
+          // minutes
+          case "m":
+            return this.num(dt.minute);
+          case "mm":
+            return this.num(dt.minute, 2);
+          // hours
+          case "h":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12);
+          case "hh":
+            return this.num(dt.hour % 12 === 0 ? 12 : dt.hour % 12, 2);
+          case "H":
+            return this.num(dt.hour);
+          case "HH":
+            return this.num(dt.hour, 2);
+          // offset
+          case "Z":
+            // like +6
+            return formatOffset({ format: "narrow", allowZ: this.opts.allowZ });
+          case "ZZ":
+            // like +06:00
+            return formatOffset({ format: "short", allowZ: this.opts.allowZ });
+          case "ZZZ":
+            // like +0600
+            return formatOffset({ format: "techie", allowZ: this.opts.allowZ });
+          case "ZZZZ":
+            // like EST
+            return dt.zone.offsetName(dt.ts, { format: "short", locale: this.loc.locale });
+          case "ZZZZZ":
+            // like Eastern Standard Time
+            return dt.zone.offsetName(dt.ts, { format: "long", locale: this.loc.locale });
+          // zone
+          case "z":
+            // like America/New_York
+            return dt.zoneName;
+          // meridiems
+          case "a":
+            return meridiem();
+          // dates
+          case "d":
+            return useDateTimeFormatter ? string({ day: "numeric" }, "day") : this.num(dt.day);
+          case "dd":
+            return useDateTimeFormatter ? string({ day: "2-digit" }, "day") : this.num(dt.day, 2);
+          // weekdays - standalone
+          case "c":
+            // like 1
+            return this.num(dt.weekday);
+          case "ccc":
+            // like 'Tues'
+            return weekday("short", true);
+          case "cccc":
+            // like 'Tuesday'
+            return weekday("long", true);
+          case "ccccc":
+            // like 'T'
+            return weekday("narrow", true);
+          // weekdays - format
+          case "E":
+            // like 1
+            return this.num(dt.weekday);
+          case "EEE":
+            // like 'Tues'
+            return weekday("short", false);
+          case "EEEE":
+            // like 'Tuesday'
+            return weekday("long", false);
+          case "EEEEE":
+            // like 'T'
+            return weekday("narrow", false);
+          // months - standalone
+          case "L":
+            // like 1
+            return useDateTimeFormatter
+              ? string({ month: "numeric", day: "numeric" }, "month")
+              : this.num(dt.month);
+          case "LL":
+            // like 01, doesn't seem to work
+            return useDateTimeFormatter
+              ? string({ month: "2-digit", day: "numeric" }, "month")
+              : this.num(dt.month, 2);
+          case "LLL":
+            // like Jan
+            return month("short", true);
+          case "LLLL":
+            // like January
+            return month("long", true);
+          case "LLLLL":
+            // like J
+            return month("narrow", true);
+          // months - format
+          case "M":
+            // like 1
+            return useDateTimeFormatter
+              ? string({ month: "numeric" }, "month")
+              : this.num(dt.month);
+          case "MM":
+            // like 01
+            return useDateTimeFormatter
+              ? string({ month: "2-digit" }, "month")
+              : this.num(dt.month, 2);
+          case "MMM":
+            // like Jan
+            return month("short", false);
+          case "MMMM":
+            // like January
+            return month("long", false);
+          case "MMMMM":
+            // like J
+            return month("narrow", false);
+          // years
+          case "y":
+            // like 2014
+            return useDateTimeFormatter ? string({ year: "numeric" }, "year") : this.num(dt.year);
+          case "yy":
+            // like 14
+            return useDateTimeFormatter
+              ? string({ year: "2-digit" }, "year")
+              : this.num(dt.year.toString().slice(-2), 2);
+          case "yyyy":
+            // like 0012
+            return useDateTimeFormatter
+              ? string({ year: "numeric" }, "year")
+              : this.num(dt.year, 4);
+          case "yyyyyy":
+            // like 000012
+            return useDateTimeFormatter
+              ? string({ year: "numeric" }, "year")
+              : this.num(dt.year, 6);
+          // eras
+          case "G":
+            // like AD
+            return era("short");
+          case "GG":
+            // like Anno Domini
+            return era("long");
+          case "GGGGG":
+            return era("narrow");
+          case "kk":
+            return this.num(dt.weekYear.toString().slice(-2), 2);
+          case "kkkk":
+            return this.num(dt.weekYear, 4);
+          case "W":
+            return this.num(dt.weekNumber);
+          case "WW":
+            return this.num(dt.weekNumber, 2);
+          case "n":
+            return this.num(dt.localWeekNumber);
+          case "nn":
+            return this.num(dt.localWeekNumber, 2);
+          case "ii":
+            return this.num(dt.localWeekYear.toString().slice(-2), 2);
+          case "iiii":
+            return this.num(dt.localWeekYear, 4);
+          case "o":
+            return this.num(dt.ordinal);
+          case "ooo":
+            return this.num(dt.ordinal, 3);
+          case "q":
+            // like 1
+            return this.num(dt.quarter);
+          case "qq":
+            // like 01
+            return this.num(dt.quarter, 2);
+          case "X":
+            return this.num(Math.floor(dt.ts / 1000));
+          case "x":
+            return this.num(dt.ts);
+          default:
+            return maybeMacro(token);
+        }
+      };
+
+    return stringifyTokens(Formatter.parseFormat(fmt), tokenToString);
+  }
+
+  formatDurationFromString(dur, fmt) {
+    const invertLargest = this.opts.signMode === "negativeLargestOnly" ? -1 : 1;
+    const tokenToField = (token) => {
+        switch (token[0]) {
+          case "S":
+            return "milliseconds";
+          case "s":
+            return "seconds";
+          case "m":
+            return "minutes";
+          case "h":
+            return "hours";
+          case "d":
+            return "days";
+          case "w":
+            return "weeks";
+          case "M":
+            return "months";
+          case "y":
+            return "years";
+          default:
+            return null;
+        }
+      },
+      tokenToString = (lildur, info) => (token) => {
+        const mapped = tokenToField(token);
+        if (mapped) {
+          const inversionFactor =
+            info.isNegativeDuration && mapped !== info.largestUnit ? invertLargest : 1;
+          let signDisplay;
+          if (this.opts.signMode === "negativeLargestOnly" && mapped !== info.largestUnit) {
+            signDisplay = "never";
+          } else if (this.opts.signMode === "all") {
+            signDisplay = "always";
+          } else {
+            // "auto" and "negative" are the same, but "auto" has better support
+            signDisplay = "auto";
+          }
+          return this.num(lildur.get(mapped) * inversionFactor, token.length, signDisplay);
+        } else {
+          return token;
+        }
+      },
+      tokens = Formatter.parseFormat(fmt),
+      realTokens = tokens.reduce(
+        (found, { literal, val }) => (literal ? found : found.concat(val)),
+        []
+      ),
+      collapsed = dur.shiftTo(...realTokens.map(tokenToField).filter((t) => t)),
+      durationInfo = {
+        isNegativeDuration: collapsed < 0,
+        // this relies on "collapsed" being based on "shiftTo", which builds up the object
+        // in order
+        largestUnit: Object.keys(collapsed.values)[0],
+      };
+    return stringifyTokens(tokens, tokenToString(collapsed, durationInfo));
+  }
+}
diff --git a/node_modules/luxon/src/impl/invalid.js b/node_modules/luxon/src/impl/invalid.js
new file mode 100644
index 0000000..2a2c95b
--- /dev/null
+++ b/node_modules/luxon/src/impl/invalid.js
@@ -0,0 +1,14 @@
+export default class Invalid {
+  constructor(reason, explanation) {
+    this.reason = reason;
+    this.explanation = explanation;
+  }
+
+  toMessage() {
+    if (this.explanation) {
+      return `${this.reason}: ${this.explanation}`;
+    } else {
+      return this.reason;
+    }
+  }
+}
diff --git a/node_modules/luxon/src/impl/locale.js b/node_modules/luxon/src/impl/locale.js
new file mode 100644
index 0000000..76f08a7
--- /dev/null
+++ b/node_modules/luxon/src/impl/locale.js
@@ -0,0 +1,569 @@
+import { hasLocaleWeekInfo, hasRelative, padStart, roundTo, validateWeekSettings } from "./util.js";
+import * as English from "./english.js";
+import Settings from "../settings.js";
+import DateTime from "../datetime.js";
+import IANAZone from "../zones/IANAZone.js";
+
+// todo - remap caching
+
+let intlLFCache = {};
+function getCachedLF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlLFCache[key];
+  if (!dtf) {
+    dtf = new Intl.ListFormat(locString, opts);
+    intlLFCache[key] = dtf;
+  }
+  return dtf;
+}
+
+const intlDTCache = new Map();
+function getCachedDTF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let dtf = intlDTCache.get(key);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat(locString, opts);
+    intlDTCache.set(key, dtf);
+  }
+  return dtf;
+}
+
+const intlNumCache = new Map();
+function getCachedINF(locString, opts = {}) {
+  const key = JSON.stringify([locString, opts]);
+  let inf = intlNumCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.NumberFormat(locString, opts);
+    intlNumCache.set(key, inf);
+  }
+  return inf;
+}
+
+const intlRelCache = new Map();
+function getCachedRTF(locString, opts = {}) {
+  const { base, ...cacheKeyOpts } = opts; // exclude `base` from the options
+  const key = JSON.stringify([locString, cacheKeyOpts]);
+  let inf = intlRelCache.get(key);
+  if (inf === undefined) {
+    inf = new Intl.RelativeTimeFormat(locString, opts);
+    intlRelCache.set(key, inf);
+  }
+  return inf;
+}
+
+let sysLocaleCache = null;
+function systemLocale() {
+  if (sysLocaleCache) {
+    return sysLocaleCache;
+  } else {
+    sysLocaleCache = new Intl.DateTimeFormat().resolvedOptions().locale;
+    return sysLocaleCache;
+  }
+}
+
+const intlResolvedOptionsCache = new Map();
+function getCachedIntResolvedOptions(locString) {
+  let opts = intlResolvedOptionsCache.get(locString);
+  if (opts === undefined) {
+    opts = new Intl.DateTimeFormat(locString).resolvedOptions();
+    intlResolvedOptionsCache.set(locString, opts);
+  }
+  return opts;
+}
+
+const weekInfoCache = new Map();
+function getCachedWeekInfo(locString) {
+  let data = weekInfoCache.get(locString);
+  if (!data) {
+    const locale = new Intl.Locale(locString);
+    // browsers currently implement this as a property, but spec says it should be a getter function
+    data = "getWeekInfo" in locale ? locale.getWeekInfo() : locale.weekInfo;
+    // minimalDays was removed from WeekInfo: https://github.com/tc39/proposal-intl-locale-info/issues/86
+    if (!("minimalDays" in data)) {
+      data = { ...fallbackWeekSettings, ...data };
+    }
+    weekInfoCache.set(locString, data);
+  }
+  return data;
+}
+
+function parseLocaleString(localeStr) {
+  // I really want to avoid writing a BCP 47 parser
+  // see, e.g. https://github.com/wooorm/bcp-47
+  // Instead, we'll do this:
+
+  // a) if the string has no -u extensions, just leave it alone
+  // b) if it does, use Intl to resolve everything
+  // c) if Intl fails, try again without the -u
+
+  // private subtags and unicode subtags have ordering requirements,
+  // and we're not properly parsing this, so just strip out the
+  // private ones if they exist.
+  const xIndex = localeStr.indexOf("-x-");
+  if (xIndex !== -1) {
+    localeStr = localeStr.substring(0, xIndex);
+  }
+
+  const uIndex = localeStr.indexOf("-u-");
+  if (uIndex === -1) {
+    return [localeStr];
+  } else {
+    let options;
+    let selectedStr;
+    try {
+      options = getCachedDTF(localeStr).resolvedOptions();
+      selectedStr = localeStr;
+    } catch (e) {
+      const smaller = localeStr.substring(0, uIndex);
+      options = getCachedDTF(smaller).resolvedOptions();
+      selectedStr = smaller;
+    }
+
+    const { numberingSystem, calendar } = options;
+    return [selectedStr, numberingSystem, calendar];
+  }
+}
+
+function intlConfigString(localeStr, numberingSystem, outputCalendar) {
+  if (outputCalendar || numberingSystem) {
+    if (!localeStr.includes("-u-")) {
+      localeStr += "-u";
+    }
+
+    if (outputCalendar) {
+      localeStr += `-ca-${outputCalendar}`;
+    }
+
+    if (numberingSystem) {
+      localeStr += `-nu-${numberingSystem}`;
+    }
+    return localeStr;
+  } else {
+    return localeStr;
+  }
+}
+
+function mapMonths(f) {
+  const ms = [];
+  for (let i = 1; i <= 12; i++) {
+    const dt = DateTime.utc(2009, i, 1);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+
+function mapWeekdays(f) {
+  const ms = [];
+  for (let i = 1; i <= 7; i++) {
+    const dt = DateTime.utc(2016, 11, 13 + i);
+    ms.push(f(dt));
+  }
+  return ms;
+}
+
+function listStuff(loc, length, englishFn, intlFn) {
+  const mode = loc.listingMode();
+
+  if (mode === "error") {
+    return null;
+  } else if (mode === "en") {
+    return englishFn(length);
+  } else {
+    return intlFn(length);
+  }
+}
+
+function supportsFastNumbers(loc) {
+  if (loc.numberingSystem && loc.numberingSystem !== "latn") {
+    return false;
+  } else {
+    return (
+      loc.numberingSystem === "latn" ||
+      !loc.locale ||
+      loc.locale.startsWith("en") ||
+      getCachedIntResolvedOptions(loc.locale).numberingSystem === "latn"
+    );
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyNumberFormatter {
+  constructor(intl, forceSimple, opts) {
+    this.padTo = opts.padTo || 0;
+    this.floor = opts.floor || false;
+
+    const { padTo, floor, ...otherOpts } = opts;
+
+    if (!forceSimple || Object.keys(otherOpts).length > 0) {
+      const intlOpts = { useGrouping: false, ...opts };
+      if (opts.padTo > 0) intlOpts.minimumIntegerDigits = opts.padTo;
+      this.inf = getCachedINF(intl, intlOpts);
+    }
+  }
+
+  format(i) {
+    if (this.inf) {
+      const fixed = this.floor ? Math.floor(i) : i;
+      return this.inf.format(fixed);
+    } else {
+      // to match the browser's numberformatter defaults
+      const fixed = this.floor ? Math.floor(i) : roundTo(i, 3);
+      return padStart(fixed, this.padTo);
+    }
+  }
+}
+
+/**
+ * @private
+ */
+
+class PolyDateFormatter {
+  constructor(dt, intl, opts) {
+    this.opts = opts;
+    this.originalZone = undefined;
+
+    let z = undefined;
+    if (this.opts.timeZone) {
+      // Don't apply any workarounds if a timeZone is explicitly provided in opts
+      this.dt = dt;
+    } else if (dt.zone.type === "fixed") {
+      // UTC-8 or Etc/UTC-8 are not part of tzdata, only Etc/GMT+8 and the like.
+      // That is why fixed-offset TZ is set to that unless it is:
+      // 1. Representing offset 0 when UTC is used to maintain previous behavior and does not become GMT.
+      // 2. Unsupported by the browser:
+      //    - some do not support Etc/
+      //    - < Etc/GMT-14, > Etc/GMT+12, and 30-minute or 45-minute offsets are not part of tzdata
+      const gmtOffset = -1 * (dt.offset / 60);
+      const offsetZ = gmtOffset >= 0 ? `Etc/GMT+${gmtOffset}` : `Etc/GMT${gmtOffset}`;
+      if (dt.offset !== 0 && IANAZone.create(offsetZ).valid) {
+        z = offsetZ;
+        this.dt = dt;
+      } else {
+        // Not all fixed-offset zones like Etc/+4:30 are present in tzdata so
+        // we manually apply the offset and substitute the zone as needed.
+        z = "UTC";
+        this.dt = dt.offset === 0 ? dt : dt.setZone("UTC").plus({ minutes: dt.offset });
+        this.originalZone = dt.zone;
+      }
+    } else if (dt.zone.type === "system") {
+      this.dt = dt;
+    } else if (dt.zone.type === "iana") {
+      this.dt = dt;
+      z = dt.zone.name;
+    } else {
+      // Custom zones can have any offset / offsetName so we just manually
+      // apply the offset and substitute the zone as needed.
+      z = "UTC";
+      this.dt = dt.setZone("UTC").plus({ minutes: dt.offset });
+      this.originalZone = dt.zone;
+    }
+
+    const intlOpts = { ...this.opts };
+    intlOpts.timeZone = intlOpts.timeZone || z;
+    this.dtf = getCachedDTF(intl, intlOpts);
+  }
+
+  format() {
+    if (this.originalZone) {
+      // If we have to substitute in the actual zone name, we have to use
+      // formatToParts so that the timezone can be replaced.
+      return this.formatToParts()
+        .map(({ value }) => value)
+        .join("");
+    }
+    return this.dtf.format(this.dt.toJSDate());
+  }
+
+  formatToParts() {
+    const parts = this.dtf.formatToParts(this.dt.toJSDate());
+    if (this.originalZone) {
+      return parts.map((part) => {
+        if (part.type === "timeZoneName") {
+          const offsetName = this.originalZone.offsetName(this.dt.ts, {
+            locale: this.dt.locale,
+            format: this.opts.timeZoneName,
+          });
+          return {
+            ...part,
+            value: offsetName,
+          };
+        } else {
+          return part;
+        }
+      });
+    }
+    return parts;
+  }
+
+  resolvedOptions() {
+    return this.dtf.resolvedOptions();
+  }
+}
+
+/**
+ * @private
+ */
+class PolyRelFormatter {
+  constructor(intl, isEnglish, opts) {
+    this.opts = { style: "long", ...opts };
+    if (!isEnglish && hasRelative()) {
+      this.rtf = getCachedRTF(intl, opts);
+    }
+  }
+
+  format(count, unit) {
+    if (this.rtf) {
+      return this.rtf.format(count, unit);
+    } else {
+      return English.formatRelativeTime(unit, count, this.opts.numeric, this.opts.style !== "long");
+    }
+  }
+
+  formatToParts(count, unit) {
+    if (this.rtf) {
+      return this.rtf.formatToParts(count, unit);
+    } else {
+      return [];
+    }
+  }
+}
+
+const fallbackWeekSettings = {
+  firstDay: 1,
+  minimalDays: 4,
+  weekend: [6, 7],
+};
+
+/**
+ * @private
+ */
+export default class Locale {
+  static fromOpts(opts) {
+    return Locale.create(
+      opts.locale,
+      opts.numberingSystem,
+      opts.outputCalendar,
+      opts.weekSettings,
+      opts.defaultToEN
+    );
+  }
+
+  static create(locale, numberingSystem, outputCalendar, weekSettings, defaultToEN = false) {
+    const specifiedLocale = locale || Settings.defaultLocale;
+    // the system locale is useful for human-readable strings but annoying for parsing/formatting known formats
+    const localeR = specifiedLocale || (defaultToEN ? "en-US" : systemLocale());
+    const numberingSystemR = numberingSystem || Settings.defaultNumberingSystem;
+    const outputCalendarR = outputCalendar || Settings.defaultOutputCalendar;
+    const weekSettingsR = validateWeekSettings(weekSettings) || Settings.defaultWeekSettings;
+    return new Locale(localeR, numberingSystemR, outputCalendarR, weekSettingsR, specifiedLocale);
+  }
+
+  static resetCache() {
+    sysLocaleCache = null;
+    intlDTCache.clear();
+    intlNumCache.clear();
+    intlRelCache.clear();
+    intlResolvedOptionsCache.clear();
+    weekInfoCache.clear();
+  }
+
+  static fromObject({ locale, numberingSystem, outputCalendar, weekSettings } = {}) {
+    return Locale.create(locale, numberingSystem, outputCalendar, weekSettings);
+  }
+
+  constructor(locale, numbering, outputCalendar, weekSettings, specifiedLocale) {
+    const [parsedLocale, parsedNumberingSystem, parsedOutputCalendar] = parseLocaleString(locale);
+
+    this.locale = parsedLocale;
+    this.numberingSystem = numbering || parsedNumberingSystem || null;
+    this.outputCalendar = outputCalendar || parsedOutputCalendar || null;
+    this.weekSettings = weekSettings;
+    this.intl = intlConfigString(this.locale, this.numberingSystem, this.outputCalendar);
+
+    this.weekdaysCache = { format: {}, standalone: {} };
+    this.monthsCache = { format: {}, standalone: {} };
+    this.meridiemCache = null;
+    this.eraCache = {};
+
+    this.specifiedLocale = specifiedLocale;
+    this.fastNumbersCached = null;
+  }
+
+  get fastNumbers() {
+    if (this.fastNumbersCached == null) {
+      this.fastNumbersCached = supportsFastNumbers(this);
+    }
+
+    return this.fastNumbersCached;
+  }
+
+  listingMode() {
+    const isActuallyEn = this.isEnglish();
+    const hasNoWeirdness =
+      (this.numberingSystem === null || this.numberingSystem === "latn") &&
+      (this.outputCalendar === null || this.outputCalendar === "gregory");
+    return isActuallyEn && hasNoWeirdness ? "en" : "intl";
+  }
+
+  clone(alts) {
+    if (!alts || Object.getOwnPropertyNames(alts).length === 0) {
+      return this;
+    } else {
+      return Locale.create(
+        alts.locale || this.specifiedLocale,
+        alts.numberingSystem || this.numberingSystem,
+        alts.outputCalendar || this.outputCalendar,
+        validateWeekSettings(alts.weekSettings) || this.weekSettings,
+        alts.defaultToEN || false
+      );
+    }
+  }
+
+  redefaultToEN(alts = {}) {
+    return this.clone({ ...alts, defaultToEN: true });
+  }
+
+  redefaultToSystem(alts = {}) {
+    return this.clone({ ...alts, defaultToEN: false });
+  }
+
+  months(length, format = false) {
+    return listStuff(this, length, English.months, () => {
+      // Workaround for "ja" locale: formatToParts does not label all parts of the month
+      // as "month" and for this locale there is no difference between "format" and "non-format".
+      // As such, just use format() instead of formatToParts() and take the whole string
+      const monthSpecialCase = this.intl === "ja" || this.intl.startsWith("ja-");
+      format &= !monthSpecialCase;
+      const intl = format ? { month: length, day: "numeric" } : { month: length },
+        formatStr = format ? "format" : "standalone";
+      if (!this.monthsCache[formatStr][length]) {
+        const mapper = !monthSpecialCase
+          ? (dt) => this.extract(dt, intl, "month")
+          : (dt) => this.dtFormatter(dt, intl).format();
+        this.monthsCache[formatStr][length] = mapMonths(mapper);
+      }
+      return this.monthsCache[formatStr][length];
+    });
+  }
+
+  weekdays(length, format = false) {
+    return listStuff(this, length, English.weekdays, () => {
+      const intl = format
+          ? { weekday: length, year: "numeric", month: "long", day: "numeric" }
+          : { weekday: length },
+        formatStr = format ? "format" : "standalone";
+      if (!this.weekdaysCache[formatStr][length]) {
+        this.weekdaysCache[formatStr][length] = mapWeekdays((dt) =>
+          this.extract(dt, intl, "weekday")
+        );
+      }
+      return this.weekdaysCache[formatStr][length];
+    });
+  }
+
+  meridiems() {
+    return listStuff(
+      this,
+      undefined,
+      () => English.meridiems,
+      () => {
+        // In theory there could be aribitrary day periods. We're gonna assume there are exactly two
+        // for AM and PM. This is probably wrong, but it's makes parsing way easier.
+        if (!this.meridiemCache) {
+          const intl = { hour: "numeric", hourCycle: "h12" };
+          this.meridiemCache = [DateTime.utc(2016, 11, 13, 9), DateTime.utc(2016, 11, 13, 19)].map(
+            (dt) => this.extract(dt, intl, "dayperiod")
+          );
+        }
+
+        return this.meridiemCache;
+      }
+    );
+  }
+
+  eras(length) {
+    return listStuff(this, length, English.eras, () => {
+      const intl = { era: length };
+
+      // This is problematic. Different calendars are going to define eras totally differently. What I need is the minimum set of dates
+      // to definitely enumerate them.
+      if (!this.eraCache[length]) {
+        this.eraCache[length] = [DateTime.utc(-40, 1, 1), DateTime.utc(2017, 1, 1)].map((dt) =>
+          this.extract(dt, intl, "era")
+        );
+      }
+
+      return this.eraCache[length];
+    });
+  }
+
+  extract(dt, intlOpts, field) {
+    const df = this.dtFormatter(dt, intlOpts),
+      results = df.formatToParts(),
+      matching = results.find((m) => m.type.toLowerCase() === field);
+    return matching ? matching.value : null;
+  }
+
+  numberFormatter(opts = {}) {
+    // this forcesimple option is never used (the only caller short-circuits on it, but it seems safer to leave)
+    // (in contrast, the rest of the condition is used heavily)
+    return new PolyNumberFormatter(this.intl, opts.forceSimple || this.fastNumbers, opts);
+  }
+
+  dtFormatter(dt, intlOpts = {}) {
+    return new PolyDateFormatter(dt, this.intl, intlOpts);
+  }
+
+  relFormatter(opts = {}) {
+    return new PolyRelFormatter(this.intl, this.isEnglish(), opts);
+  }
+
+  listFormatter(opts = {}) {
+    return getCachedLF(this.intl, opts);
+  }
+
+  isEnglish() {
+    return (
+      this.locale === "en" ||
+      this.locale.toLowerCase() === "en-us" ||
+      getCachedIntResolvedOptions(this.intl).locale.startsWith("en-us")
+    );
+  }
+
+  getWeekSettings() {
+    if (this.weekSettings) {
+      return this.weekSettings;
+    } else if (!hasLocaleWeekInfo()) {
+      return fallbackWeekSettings;
+    } else {
+      return getCachedWeekInfo(this.locale);
+    }
+  }
+
+  getStartOfWeek() {
+    return this.getWeekSettings().firstDay;
+  }
+
+  getMinDaysInFirstWeek() {
+    return this.getWeekSettings().minimalDays;
+  }
+
+  getWeekendDays() {
+    return this.getWeekSettings().weekend;
+  }
+
+  equals(other) {
+    return (
+      this.locale === other.locale &&
+      this.numberingSystem === other.numberingSystem &&
+      this.outputCalendar === other.outputCalendar
+    );
+  }
+
+  toString() {
+    return `Locale(${this.locale}, ${this.numberingSystem}, ${this.outputCalendar})`;
+  }
+}
diff --git a/node_modules/luxon/src/impl/regexParser.js b/node_modules/luxon/src/impl/regexParser.js
new file mode 100644
index 0000000..6710d64
--- /dev/null
+++ b/node_modules/luxon/src/impl/regexParser.js
@@ -0,0 +1,335 @@
+import {
+  untruncateYear,
+  signedOffset,
+  parseInteger,
+  parseMillis,
+  isUndefined,
+  parseFloating,
+} from "./util.js";
+import * as English from "./english.js";
+import FixedOffsetZone from "../zones/fixedOffsetZone.js";
+import IANAZone from "../zones/IANAZone.js";
+
+/*
+ * This file handles parsing for well-specified formats. Here's how it works:
+ * Two things go into parsing: a regex to match with and an extractor to take apart the groups in the match.
+ * An extractor is just a function that takes a regex match array and returns a { year: ..., month: ... } object
+ * parse() does the work of executing the regex and applying the extractor. It takes multiple regex/extractor pairs to try in sequence.
+ * Extractors can take a "cursor" representing the offset in the match to look at. This makes it easy to combine extractors.
+ * combineExtractors() does the work of combining them, keeping track of the cursor through multiple extractions.
+ * Some extractions are super dumb and simpleParse and fromStrings help DRY them.
+ */
+
+const ianaRegex = /[A-Za-z_+-]{1,256}(?::?\/[A-Za-z0-9_+-]{1,256}(?:\/[A-Za-z0-9_+-]{1,256})?)?/;
+
+function combineRegexes(...regexes) {
+  const full = regexes.reduce((f, r) => f + r.source, "");
+  return RegExp(`^${full}$`);
+}
+
+function combineExtractors(...extractors) {
+  return (m) =>
+    extractors
+      .reduce(
+        ([mergedVals, mergedZone, cursor], ex) => {
+          const [val, zone, next] = ex(m, cursor);
+          return [{ ...mergedVals, ...val }, zone || mergedZone, next];
+        },
+        [{}, null, 1]
+      )
+      .slice(0, 2);
+}
+
+function parse(s, ...patterns) {
+  if (s == null) {
+    return [null, null];
+  }
+
+  for (const [regex, extractor] of patterns) {
+    const m = regex.exec(s);
+    if (m) {
+      return extractor(m);
+    }
+  }
+  return [null, null];
+}
+
+function simpleParse(...keys) {
+  return (match, cursor) => {
+    const ret = {};
+    let i;
+
+    for (i = 0; i < keys.length; i++) {
+      ret[keys[i]] = parseInteger(match[cursor + i]);
+    }
+    return [ret, null, cursor + i];
+  };
+}
+
+// ISO and SQL parsing
+const offsetRegex = /(?:([Zz])|([+-]\d\d)(?::?(\d\d))?)/;
+const isoExtendedZone = `(?:${offsetRegex.source}?(?:\\[(${ianaRegex.source})\\])?)?`;
+const isoTimeBaseRegex = /(\d\d)(?::?(\d\d)(?::?(\d\d)(?:[.,](\d{1,30}))?)?)?/;
+const isoTimeRegex = RegExp(`${isoTimeBaseRegex.source}${isoExtendedZone}`);
+const isoTimeExtensionRegex = RegExp(`(?:[Tt]${isoTimeRegex.source})?`);
+const isoYmdRegex = /([+-]\d{6}|\d{4})(?:-?(\d\d)(?:-?(\d\d))?)?/;
+const isoWeekRegex = /(\d{4})-?W(\d\d)(?:-?(\d))?/;
+const isoOrdinalRegex = /(\d{4})-?(\d{3})/;
+const extractISOWeekData = simpleParse("weekYear", "weekNumber", "weekDay");
+const extractISOOrdinalData = simpleParse("year", "ordinal");
+const sqlYmdRegex = /(\d{4})-(\d\d)-(\d\d)/; // dumbed-down version of the ISO one
+const sqlTimeRegex = RegExp(
+  `${isoTimeBaseRegex.source} ?(?:${offsetRegex.source}|(${ianaRegex.source}))?`
+);
+const sqlTimeExtensionRegex = RegExp(`(?: ${sqlTimeRegex.source})?`);
+
+function int(match, pos, fallback) {
+  const m = match[pos];
+  return isUndefined(m) ? fallback : parseInteger(m);
+}
+
+function extractISOYmd(match, cursor) {
+  const item = {
+    year: int(match, cursor),
+    month: int(match, cursor + 1, 1),
+    day: int(match, cursor + 2, 1),
+  };
+
+  return [item, null, cursor + 3];
+}
+
+function extractISOTime(match, cursor) {
+  const item = {
+    hours: int(match, cursor, 0),
+    minutes: int(match, cursor + 1, 0),
+    seconds: int(match, cursor + 2, 0),
+    milliseconds: parseMillis(match[cursor + 3]),
+  };
+
+  return [item, null, cursor + 4];
+}
+
+function extractISOOffset(match, cursor) {
+  const local = !match[cursor] && !match[cursor + 1],
+    fullOffset = signedOffset(match[cursor + 1], match[cursor + 2]),
+    zone = local ? null : FixedOffsetZone.instance(fullOffset);
+  return [{}, zone, cursor + 3];
+}
+
+function extractIANAZone(match, cursor) {
+  const zone = match[cursor] ? IANAZone.create(match[cursor]) : null;
+  return [{}, zone, cursor + 1];
+}
+
+// ISO time parsing
+
+const isoTimeOnly = RegExp(`^T?${isoTimeBaseRegex.source}$`);
+
+// ISO duration parsing
+
+const isoDuration =
+  /^-?P(?:(?:(-?\d{1,20}(?:\.\d{1,20})?)Y)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20}(?:\.\d{1,20})?)W)?(?:(-?\d{1,20}(?:\.\d{1,20})?)D)?(?:T(?:(-?\d{1,20}(?:\.\d{1,20})?)H)?(?:(-?\d{1,20}(?:\.\d{1,20})?)M)?(?:(-?\d{1,20})(?:[.,](-?\d{1,20}))?S)?)?)$/;
+
+function extractISODuration(match) {
+  const [s, yearStr, monthStr, weekStr, dayStr, hourStr, minuteStr, secondStr, millisecondsStr] =
+    match;
+
+  const hasNegativePrefix = s[0] === "-";
+  const negativeSeconds = secondStr && secondStr[0] === "-";
+
+  const maybeNegate = (num, force = false) =>
+    num !== undefined && (force || (num && hasNegativePrefix)) ? -num : num;
+
+  return [
+    {
+      years: maybeNegate(parseFloating(yearStr)),
+      months: maybeNegate(parseFloating(monthStr)),
+      weeks: maybeNegate(parseFloating(weekStr)),
+      days: maybeNegate(parseFloating(dayStr)),
+      hours: maybeNegate(parseFloating(hourStr)),
+      minutes: maybeNegate(parseFloating(minuteStr)),
+      seconds: maybeNegate(parseFloating(secondStr), secondStr === "-0"),
+      milliseconds: maybeNegate(parseMillis(millisecondsStr), negativeSeconds),
+    },
+  ];
+}
+
+// These are a little braindead. EDT *should* tell us that we're in, say, America/New_York
+// and not just that we're in -240 *right now*. But since I don't think these are used that often
+// I'm just going to ignore that
+const obsOffsets = {
+  GMT: 0,
+  EDT: -4 * 60,
+  EST: -5 * 60,
+  CDT: -5 * 60,
+  CST: -6 * 60,
+  MDT: -6 * 60,
+  MST: -7 * 60,
+  PDT: -7 * 60,
+  PST: -8 * 60,
+};
+
+function fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr) {
+  const result = {
+    year: yearStr.length === 2 ? untruncateYear(parseInteger(yearStr)) : parseInteger(yearStr),
+    month: English.monthsShort.indexOf(monthStr) + 1,
+    day: parseInteger(dayStr),
+    hour: parseInteger(hourStr),
+    minute: parseInteger(minuteStr),
+  };
+
+  if (secondStr) result.second = parseInteger(secondStr);
+  if (weekdayStr) {
+    result.weekday =
+      weekdayStr.length > 3
+        ? English.weekdaysLong.indexOf(weekdayStr) + 1
+        : English.weekdaysShort.indexOf(weekdayStr) + 1;
+  }
+
+  return result;
+}
+
+// RFC 2822/5322
+const rfc2822 =
+  /^(?:(Mon|Tue|Wed|Thu|Fri|Sat|Sun),\s)?(\d{1,2})\s(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)\s(\d{2,4})\s(\d\d):(\d\d)(?::(\d\d))?\s(?:(UT|GMT|[ECMP][SD]T)|([Zz])|(?:([+-]\d\d)(\d\d)))$/;
+
+function extractRFC2822(match) {
+  const [
+      ,
+      weekdayStr,
+      dayStr,
+      monthStr,
+      yearStr,
+      hourStr,
+      minuteStr,
+      secondStr,
+      obsOffset,
+      milOffset,
+      offHourStr,
+      offMinuteStr,
+    ] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+
+  let offset;
+  if (obsOffset) {
+    offset = obsOffsets[obsOffset];
+  } else if (milOffset) {
+    offset = 0;
+  } else {
+    offset = signedOffset(offHourStr, offMinuteStr);
+  }
+
+  return [result, new FixedOffsetZone(offset)];
+}
+
+function preprocessRFC2822(s) {
+  // Remove comments and folding whitespace and replace multiple-spaces with a single space
+  return s
+    .replace(/\([^()]*\)|[\n\t]/g, " ")
+    .replace(/(\s\s+)/g, " ")
+    .trim();
+}
+
+// http date
+
+const rfc1123 =
+    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun), (\d\d) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) (\d{4}) (\d\d):(\d\d):(\d\d) GMT$/,
+  rfc850 =
+    /^(Monday|Tuesday|Wednesday|Thursday|Friday|Saturday|Sunday), (\d\d)-(Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec)-(\d\d) (\d\d):(\d\d):(\d\d) GMT$/,
+  ascii =
+    /^(Mon|Tue|Wed|Thu|Fri|Sat|Sun) (Jan|Feb|Mar|Apr|May|Jun|Jul|Aug|Sep|Oct|Nov|Dec) ( \d|\d\d) (\d\d):(\d\d):(\d\d) (\d{4})$/;
+
+function extractRFC1123Or850(match) {
+  const [, weekdayStr, dayStr, monthStr, yearStr, hourStr, minuteStr, secondStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+
+function extractASCII(match) {
+  const [, weekdayStr, monthStr, dayStr, hourStr, minuteStr, secondStr, yearStr] = match,
+    result = fromStrings(weekdayStr, yearStr, monthStr, dayStr, hourStr, minuteStr, secondStr);
+  return [result, FixedOffsetZone.utcInstance];
+}
+
+const isoYmdWithTimeExtensionRegex = combineRegexes(isoYmdRegex, isoTimeExtensionRegex);
+const isoWeekWithTimeExtensionRegex = combineRegexes(isoWeekRegex, isoTimeExtensionRegex);
+const isoOrdinalWithTimeExtensionRegex = combineRegexes(isoOrdinalRegex, isoTimeExtensionRegex);
+const isoTimeCombinedRegex = combineRegexes(isoTimeRegex);
+
+const extractISOYmdTimeAndOffset = combineExtractors(
+  extractISOYmd,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOWeekTimeAndOffset = combineExtractors(
+  extractISOWeekData,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOOrdinalDateAndTime = combineExtractors(
+  extractISOOrdinalData,
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+const extractISOTimeAndOffset = combineExtractors(
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+
+/*
+ * @private
+ */
+
+export function parseISODate(s) {
+  return parse(
+    s,
+    [isoYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],
+    [isoWeekWithTimeExtensionRegex, extractISOWeekTimeAndOffset],
+    [isoOrdinalWithTimeExtensionRegex, extractISOOrdinalDateAndTime],
+    [isoTimeCombinedRegex, extractISOTimeAndOffset]
+  );
+}
+
+export function parseRFC2822Date(s) {
+  return parse(preprocessRFC2822(s), [rfc2822, extractRFC2822]);
+}
+
+export function parseHTTPDate(s) {
+  return parse(
+    s,
+    [rfc1123, extractRFC1123Or850],
+    [rfc850, extractRFC1123Or850],
+    [ascii, extractASCII]
+  );
+}
+
+export function parseISODuration(s) {
+  return parse(s, [isoDuration, extractISODuration]);
+}
+
+const extractISOTimeOnly = combineExtractors(extractISOTime);
+
+export function parseISOTimeOnly(s) {
+  return parse(s, [isoTimeOnly, extractISOTimeOnly]);
+}
+
+const sqlYmdWithTimeExtensionRegex = combineRegexes(sqlYmdRegex, sqlTimeExtensionRegex);
+const sqlTimeCombinedRegex = combineRegexes(sqlTimeRegex);
+
+const extractISOTimeOffsetAndIANAZone = combineExtractors(
+  extractISOTime,
+  extractISOOffset,
+  extractIANAZone
+);
+
+export function parseSQL(s) {
+  return parse(
+    s,
+    [sqlYmdWithTimeExtensionRegex, extractISOYmdTimeAndOffset],
+    [sqlTimeCombinedRegex, extractISOTimeOffsetAndIANAZone]
+  );
+}
diff --git a/node_modules/luxon/src/impl/tokenParser.js b/node_modules/luxon/src/impl/tokenParser.js
new file mode 100644
index 0000000..48a7595
--- /dev/null
+++ b/node_modules/luxon/src/impl/tokenParser.js
@@ -0,0 +1,505 @@
+import { parseMillis, isUndefined, untruncateYear, signedOffset, hasOwnProperty } from "./util.js";
+import Formatter from "./formatter.js";
+import FixedOffsetZone from "../zones/fixedOffsetZone.js";
+import IANAZone from "../zones/IANAZone.js";
+import DateTime from "../datetime.js";
+import { digitRegex, parseDigits } from "./digits.js";
+import { ConflictingSpecificationError } from "../errors.js";
+
+const MISSING_FTP = "missing Intl.DateTimeFormat.formatToParts support";
+
+function intUnit(regex, post = (i) => i) {
+  return { regex, deser: ([s]) => post(parseDigits(s)) };
+}
+
+const NBSP = String.fromCharCode(160);
+const spaceOrNBSP = `[ ${NBSP}]`;
+const spaceOrNBSPRegExp = new RegExp(spaceOrNBSP, "g");
+
+function fixListRegex(s) {
+  // make dots optional and also make them literal
+  // make space and non breakable space characters interchangeable
+  return s.replace(/\./g, "\\.?").replace(spaceOrNBSPRegExp, spaceOrNBSP);
+}
+
+function stripInsensitivities(s) {
+  return s
+    .replace(/\./g, "") // ignore dots that were made optional
+    .replace(spaceOrNBSPRegExp, " ") // interchange space and nbsp
+    .toLowerCase();
+}
+
+function oneOf(strings, startIndex) {
+  if (strings === null) {
+    return null;
+  } else {
+    return {
+      regex: RegExp(strings.map(fixListRegex).join("|")),
+      deser: ([s]) =>
+        strings.findIndex((i) => stripInsensitivities(s) === stripInsensitivities(i)) + startIndex,
+    };
+  }
+}
+
+function offset(regex, groups) {
+  return { regex, deser: ([, h, m]) => signedOffset(h, m), groups };
+}
+
+function simple(regex) {
+  return { regex, deser: ([s]) => s };
+}
+
+function escapeToken(value) {
+  return value.replace(/[\-\[\]{}()*+?.,\\\^$|#\s]/g, "\\$&");
+}
+
+/**
+ * @param token
+ * @param {Locale} loc
+ */
+function unitForToken(token, loc) {
+  const one = digitRegex(loc),
+    two = digitRegex(loc, "{2}"),
+    three = digitRegex(loc, "{3}"),
+    four = digitRegex(loc, "{4}"),
+    six = digitRegex(loc, "{6}"),
+    oneOrTwo = digitRegex(loc, "{1,2}"),
+    oneToThree = digitRegex(loc, "{1,3}"),
+    oneToSix = digitRegex(loc, "{1,6}"),
+    oneToNine = digitRegex(loc, "{1,9}"),
+    twoToFour = digitRegex(loc, "{2,4}"),
+    fourToSix = digitRegex(loc, "{4,6}"),
+    literal = (t) => ({ regex: RegExp(escapeToken(t.val)), deser: ([s]) => s, literal: true }),
+    unitate = (t) => {
+      if (token.literal) {
+        return literal(t);
+      }
+      switch (t.val) {
+        // era
+        case "G":
+          return oneOf(loc.eras("short"), 0);
+        case "GG":
+          return oneOf(loc.eras("long"), 0);
+        // years
+        case "y":
+          return intUnit(oneToSix);
+        case "yy":
+          return intUnit(twoToFour, untruncateYear);
+        case "yyyy":
+          return intUnit(four);
+        case "yyyyy":
+          return intUnit(fourToSix);
+        case "yyyyyy":
+          return intUnit(six);
+        // months
+        case "M":
+          return intUnit(oneOrTwo);
+        case "MM":
+          return intUnit(two);
+        case "MMM":
+          return oneOf(loc.months("short", true), 1);
+        case "MMMM":
+          return oneOf(loc.months("long", true), 1);
+        case "L":
+          return intUnit(oneOrTwo);
+        case "LL":
+          return intUnit(two);
+        case "LLL":
+          return oneOf(loc.months("short", false), 1);
+        case "LLLL":
+          return oneOf(loc.months("long", false), 1);
+        // dates
+        case "d":
+          return intUnit(oneOrTwo);
+        case "dd":
+          return intUnit(two);
+        // ordinals
+        case "o":
+          return intUnit(oneToThree);
+        case "ooo":
+          return intUnit(three);
+        // time
+        case "HH":
+          return intUnit(two);
+        case "H":
+          return intUnit(oneOrTwo);
+        case "hh":
+          return intUnit(two);
+        case "h":
+          return intUnit(oneOrTwo);
+        case "mm":
+          return intUnit(two);
+        case "m":
+          return intUnit(oneOrTwo);
+        case "q":
+          return intUnit(oneOrTwo);
+        case "qq":
+          return intUnit(two);
+        case "s":
+          return intUnit(oneOrTwo);
+        case "ss":
+          return intUnit(two);
+        case "S":
+          return intUnit(oneToThree);
+        case "SSS":
+          return intUnit(three);
+        case "u":
+          return simple(oneToNine);
+        case "uu":
+          return simple(oneOrTwo);
+        case "uuu":
+          return intUnit(one);
+        // meridiem
+        case "a":
+          return oneOf(loc.meridiems(), 0);
+        // weekYear (k)
+        case "kkkk":
+          return intUnit(four);
+        case "kk":
+          return intUnit(twoToFour, untruncateYear);
+        // weekNumber (W)
+        case "W":
+          return intUnit(oneOrTwo);
+        case "WW":
+          return intUnit(two);
+        // weekdays
+        case "E":
+        case "c":
+          return intUnit(one);
+        case "EEE":
+          return oneOf(loc.weekdays("short", false), 1);
+        case "EEEE":
+          return oneOf(loc.weekdays("long", false), 1);
+        case "ccc":
+          return oneOf(loc.weekdays("short", true), 1);
+        case "cccc":
+          return oneOf(loc.weekdays("long", true), 1);
+        // offset/zone
+        case "Z":
+        case "ZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(?::(${two.source}))?`), 2);
+        case "ZZZ":
+          return offset(new RegExp(`([+-]${oneOrTwo.source})(${two.source})?`), 2);
+        // we don't support ZZZZ (PST) or ZZZZZ (Pacific Standard Time) in parsing
+        // because we don't have any way to figure out what they are
+        case "z":
+          return simple(/[a-z_+-/]{1,256}?/i);
+        // this special-case "token" represents a place where a macro-token expanded into a white-space literal
+        // in this case we accept any non-newline white-space
+        case " ":
+          return simple(/[^\S\n\r]/);
+        default:
+          return literal(t);
+      }
+    };
+
+  const unit = unitate(token) || {
+    invalidReason: MISSING_FTP,
+  };
+
+  unit.token = token;
+
+  return unit;
+}
+
+const partTypeStyleToTokenVal = {
+  year: {
+    "2-digit": "yy",
+    numeric: "yyyyy",
+  },
+  month: {
+    numeric: "M",
+    "2-digit": "MM",
+    short: "MMM",
+    long: "MMMM",
+  },
+  day: {
+    numeric: "d",
+    "2-digit": "dd",
+  },
+  weekday: {
+    short: "EEE",
+    long: "EEEE",
+  },
+  dayperiod: "a",
+  dayPeriod: "a",
+  hour12: {
+    numeric: "h",
+    "2-digit": "hh",
+  },
+  hour24: {
+    numeric: "H",
+    "2-digit": "HH",
+  },
+  minute: {
+    numeric: "m",
+    "2-digit": "mm",
+  },
+  second: {
+    numeric: "s",
+    "2-digit": "ss",
+  },
+  timeZoneName: {
+    long: "ZZZZZ",
+    short: "ZZZ",
+  },
+};
+
+function tokenForPart(part, formatOpts, resolvedOpts) {
+  const { type, value } = part;
+
+  if (type === "literal") {
+    const isSpace = /^\s+$/.test(value);
+    return {
+      literal: !isSpace,
+      val: isSpace ? " " : value,
+    };
+  }
+
+  const style = formatOpts[type];
+
+  // The user might have explicitly specified hour12 or hourCycle
+  // if so, respect their decision
+  // if not, refer back to the resolvedOpts, which are based on the locale
+  let actualType = type;
+  if (type === "hour") {
+    if (formatOpts.hour12 != null) {
+      actualType = formatOpts.hour12 ? "hour12" : "hour24";
+    } else if (formatOpts.hourCycle != null) {
+      if (formatOpts.hourCycle === "h11" || formatOpts.hourCycle === "h12") {
+        actualType = "hour12";
+      } else {
+        actualType = "hour24";
+      }
+    } else {
+      // tokens only differentiate between 24 hours or not,
+      // so we do not need to check hourCycle here, which is less supported anyways
+      actualType = resolvedOpts.hour12 ? "hour12" : "hour24";
+    }
+  }
+  let val = partTypeStyleToTokenVal[actualType];
+  if (typeof val === "object") {
+    val = val[style];
+  }
+
+  if (val) {
+    return {
+      literal: false,
+      val,
+    };
+  }
+
+  return undefined;
+}
+
+function buildRegex(units) {
+  const re = units.map((u) => u.regex).reduce((f, r) => `${f}(${r.source})`, "");
+  return [`^${re}$`, units];
+}
+
+function match(input, regex, handlers) {
+  const matches = input.match(regex);
+
+  if (matches) {
+    const all = {};
+    let matchIndex = 1;
+    for (const i in handlers) {
+      if (hasOwnProperty(handlers, i)) {
+        const h = handlers[i],
+          groups = h.groups ? h.groups + 1 : 1;
+        if (!h.literal && h.token) {
+          all[h.token.val[0]] = h.deser(matches.slice(matchIndex, matchIndex + groups));
+        }
+        matchIndex += groups;
+      }
+    }
+    return [matches, all];
+  } else {
+    return [matches, {}];
+  }
+}
+
+function dateTimeFromMatches(matches) {
+  const toField = (token) => {
+    switch (token) {
+      case "S":
+        return "millisecond";
+      case "s":
+        return "second";
+      case "m":
+        return "minute";
+      case "h":
+      case "H":
+        return "hour";
+      case "d":
+        return "day";
+      case "o":
+        return "ordinal";
+      case "L":
+      case "M":
+        return "month";
+      case "y":
+        return "year";
+      case "E":
+      case "c":
+        return "weekday";
+      case "W":
+        return "weekNumber";
+      case "k":
+        return "weekYear";
+      case "q":
+        return "quarter";
+      default:
+        return null;
+    }
+  };
+
+  let zone = null;
+  let specificOffset;
+  if (!isUndefined(matches.z)) {
+    zone = IANAZone.create(matches.z);
+  }
+
+  if (!isUndefined(matches.Z)) {
+    if (!zone) {
+      zone = new FixedOffsetZone(matches.Z);
+    }
+    specificOffset = matches.Z;
+  }
+
+  if (!isUndefined(matches.q)) {
+    matches.M = (matches.q - 1) * 3 + 1;
+  }
+
+  if (!isUndefined(matches.h)) {
+    if (matches.h < 12 && matches.a === 1) {
+      matches.h += 12;
+    } else if (matches.h === 12 && matches.a === 0) {
+      matches.h = 0;
+    }
+  }
+
+  if (matches.G === 0 && matches.y) {
+    matches.y = -matches.y;
+  }
+
+  if (!isUndefined(matches.u)) {
+    matches.S = parseMillis(matches.u);
+  }
+
+  const vals = Object.keys(matches).reduce((r, k) => {
+    const f = toField(k);
+    if (f) {
+      r[f] = matches[k];
+    }
+
+    return r;
+  }, {});
+
+  return [vals, zone, specificOffset];
+}
+
+let dummyDateTimeCache = null;
+
+function getDummyDateTime() {
+  if (!dummyDateTimeCache) {
+    dummyDateTimeCache = DateTime.fromMillis(1555555555555);
+  }
+
+  return dummyDateTimeCache;
+}
+
+function maybeExpandMacroToken(token, locale) {
+  if (token.literal) {
+    return token;
+  }
+
+  const formatOpts = Formatter.macroTokenToFormatOpts(token.val);
+  const tokens = formatOptsToTokens(formatOpts, locale);
+
+  if (tokens == null || tokens.includes(undefined)) {
+    return token;
+  }
+
+  return tokens;
+}
+
+export function expandMacroTokens(tokens, locale) {
+  return Array.prototype.concat(...tokens.map((t) => maybeExpandMacroToken(t, locale)));
+}
+
+/**
+ * @private
+ */
+
+export class TokenParser {
+  constructor(locale, format) {
+    this.locale = locale;
+    this.format = format;
+    this.tokens = expandMacroTokens(Formatter.parseFormat(format), locale);
+    this.units = this.tokens.map((t) => unitForToken(t, locale));
+    this.disqualifyingUnit = this.units.find((t) => t.invalidReason);
+
+    if (!this.disqualifyingUnit) {
+      const [regexString, handlers] = buildRegex(this.units);
+      this.regex = RegExp(regexString, "i");
+      this.handlers = handlers;
+    }
+  }
+
+  explainFromTokens(input) {
+    if (!this.isValid) {
+      return { input, tokens: this.tokens, invalidReason: this.invalidReason };
+    } else {
+      const [rawMatches, matches] = match(input, this.regex, this.handlers),
+        [result, zone, specificOffset] = matches
+          ? dateTimeFromMatches(matches)
+          : [null, null, undefined];
+      if (hasOwnProperty(matches, "a") && hasOwnProperty(matches, "H")) {
+        throw new ConflictingSpecificationError(
+          "Can't include meridiem when specifying 24-hour format"
+        );
+      }
+      return {
+        input,
+        tokens: this.tokens,
+        regex: this.regex,
+        rawMatches,
+        matches,
+        result,
+        zone,
+        specificOffset,
+      };
+    }
+  }
+
+  get isValid() {
+    return !this.disqualifyingUnit;
+  }
+
+  get invalidReason() {
+    return this.disqualifyingUnit ? this.disqualifyingUnit.invalidReason : null;
+  }
+}
+
+export function explainFromTokens(locale, input, format) {
+  const parser = new TokenParser(locale, format);
+  return parser.explainFromTokens(input);
+}
+
+export function parseFromTokens(locale, input, format) {
+  const { result, zone, specificOffset, invalidReason } = explainFromTokens(locale, input, format);
+  return [result, zone, specificOffset, invalidReason];
+}
+
+export function formatOptsToTokens(formatOpts, locale) {
+  if (!formatOpts) {
+    return null;
+  }
+
+  const formatter = Formatter.create(locale, formatOpts);
+  const df = formatter.dtFormatter(getDummyDateTime());
+  const parts = df.formatToParts();
+  const resolvedOpts = df.resolvedOptions();
+  return parts.map((p) => tokenForPart(p, formatOpts, resolvedOpts));
+}
diff --git a/node_modules/luxon/src/impl/util.js b/node_modules/luxon/src/impl/util.js
new file mode 100644
index 0000000..9164250
--- /dev/null
+++ b/node_modules/luxon/src/impl/util.js
@@ -0,0 +1,330 @@
+/*
+  This is just a junk drawer, containing anything used across multiple classes.
+  Because Luxon is small(ish), this should stay small and we won't worry about splitting
+  it up into, say, parsingUtil.js and basicUtil.js and so on. But they are divided up by feature area.
+*/
+
+import { InvalidArgumentError } from "../errors.js";
+import Settings from "../settings.js";
+import { dayOfWeek, isoWeekdayToLocal } from "./conversions.js";
+
+/**
+ * @private
+ */
+
+// TYPES
+
+export function isUndefined(o) {
+  return typeof o === "undefined";
+}
+
+export function isNumber(o) {
+  return typeof o === "number";
+}
+
+export function isInteger(o) {
+  return typeof o === "number" && o % 1 === 0;
+}
+
+export function isString(o) {
+  return typeof o === "string";
+}
+
+export function isDate(o) {
+  return Object.prototype.toString.call(o) === "[object Date]";
+}
+
+// CAPABILITIES
+
+export function hasRelative() {
+  try {
+    return typeof Intl !== "undefined" && !!Intl.RelativeTimeFormat;
+  } catch (e) {
+    return false;
+  }
+}
+
+export function hasLocaleWeekInfo() {
+  try {
+    return (
+      typeof Intl !== "undefined" &&
+      !!Intl.Locale &&
+      ("weekInfo" in Intl.Locale.prototype || "getWeekInfo" in Intl.Locale.prototype)
+    );
+  } catch (e) {
+    return false;
+  }
+}
+
+// OBJECTS AND ARRAYS
+
+export function maybeArray(thing) {
+  return Array.isArray(thing) ? thing : [thing];
+}
+
+export function bestBy(arr, by, compare) {
+  if (arr.length === 0) {
+    return undefined;
+  }
+  return arr.reduce((best, next) => {
+    const pair = [by(next), next];
+    if (!best) {
+      return pair;
+    } else if (compare(best[0], pair[0]) === best[0]) {
+      return best;
+    } else {
+      return pair;
+    }
+  }, null)[1];
+}
+
+export function pick(obj, keys) {
+  return keys.reduce((a, k) => {
+    a[k] = obj[k];
+    return a;
+  }, {});
+}
+
+export function hasOwnProperty(obj, prop) {
+  return Object.prototype.hasOwnProperty.call(obj, prop);
+}
+
+export function validateWeekSettings(settings) {
+  if (settings == null) {
+    return null;
+  } else if (typeof settings !== "object") {
+    throw new InvalidArgumentError("Week settings must be an object");
+  } else {
+    if (
+      !integerBetween(settings.firstDay, 1, 7) ||
+      !integerBetween(settings.minimalDays, 1, 7) ||
+      !Array.isArray(settings.weekend) ||
+      settings.weekend.some((v) => !integerBetween(v, 1, 7))
+    ) {
+      throw new InvalidArgumentError("Invalid week settings");
+    }
+    return {
+      firstDay: settings.firstDay,
+      minimalDays: settings.minimalDays,
+      weekend: Array.from(settings.weekend),
+    };
+  }
+}
+
+// NUMBERS AND STRINGS
+
+export function integerBetween(thing, bottom, top) {
+  return isInteger(thing) && thing >= bottom && thing <= top;
+}
+
+// x % n but takes the sign of n instead of x
+export function floorMod(x, n) {
+  return x - n * Math.floor(x / n);
+}
+
+export function padStart(input, n = 2) {
+  const isNeg = input < 0;
+  let padded;
+  if (isNeg) {
+    padded = "-" + ("" + -input).padStart(n, "0");
+  } else {
+    padded = ("" + input).padStart(n, "0");
+  }
+  return padded;
+}
+
+export function parseInteger(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseInt(string, 10);
+  }
+}
+
+export function parseFloating(string) {
+  if (isUndefined(string) || string === null || string === "") {
+    return undefined;
+  } else {
+    return parseFloat(string);
+  }
+}
+
+export function parseMillis(fraction) {
+  // Return undefined (instead of 0) in these cases, where fraction is not set
+  if (isUndefined(fraction) || fraction === null || fraction === "") {
+    return undefined;
+  } else {
+    const f = parseFloat("0." + fraction) * 1000;
+    return Math.floor(f);
+  }
+}
+
+export function roundTo(number, digits, rounding = "round") {
+  const factor = 10 ** digits;
+  switch (rounding) {
+    case "expand":
+      return number > 0
+        ? Math.ceil(number * factor) / factor
+        : Math.floor(number * factor) / factor;
+    case "trunc":
+      return Math.trunc(number * factor) / factor;
+    case "round":
+      return Math.round(number * factor) / factor;
+    case "floor":
+      return Math.floor(number * factor) / factor;
+    case "ceil":
+      return Math.ceil(number * factor) / factor;
+    default:
+      throw new RangeError(`Value rounding ${rounding} is out of range`);
+  }
+}
+
+// DATE BASICS
+
+export function isLeapYear(year) {
+  return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+
+export function daysInYear(year) {
+  return isLeapYear(year) ? 366 : 365;
+}
+
+export function daysInMonth(year, month) {
+  const modMonth = floorMod(month - 1, 12) + 1,
+    modYear = year + (month - modMonth) / 12;
+
+  if (modMonth === 2) {
+    return isLeapYear(modYear) ? 29 : 28;
+  } else {
+    return [31, null, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][modMonth - 1];
+  }
+}
+
+// convert a calendar object to a local timestamp (epoch, but with the offset baked in)
+export function objToLocalTS(obj) {
+  let d = Date.UTC(
+    obj.year,
+    obj.month - 1,
+    obj.day,
+    obj.hour,
+    obj.minute,
+    obj.second,
+    obj.millisecond
+  );
+
+  // for legacy reasons, years between 0 and 99 are interpreted as 19XX; revert that
+  if (obj.year < 100 && obj.year >= 0) {
+    d = new Date(d);
+    // set the month and day again, this is necessary because year 2000 is a leap year, but year 100 is not
+    // so if obj.year is in 99, but obj.day makes it roll over into year 100,
+    // the calculations done by Date.UTC are using year 2000 - which is incorrect
+    d.setUTCFullYear(obj.year, obj.month - 1, obj.day);
+  }
+  return +d;
+}
+
+// adapted from moment.js: https://github.com/moment/moment/blob/000ac1800e620f770f4eb31b5ae908f6167b0ab2/src/lib/units/week-calendar-utils.js
+function firstWeekOffset(year, minDaysInFirstWeek, startOfWeek) {
+  const fwdlw = isoWeekdayToLocal(dayOfWeek(year, 1, minDaysInFirstWeek), startOfWeek);
+  return -fwdlw + minDaysInFirstWeek - 1;
+}
+
+export function weeksInWeekYear(weekYear, minDaysInFirstWeek = 4, startOfWeek = 1) {
+  const weekOffset = firstWeekOffset(weekYear, minDaysInFirstWeek, startOfWeek);
+  const weekOffsetNext = firstWeekOffset(weekYear + 1, minDaysInFirstWeek, startOfWeek);
+  return (daysInYear(weekYear) - weekOffset + weekOffsetNext) / 7;
+}
+
+export function untruncateYear(year) {
+  if (year > 99) {
+    return year;
+  } else return year > Settings.twoDigitCutoffYear ? 1900 + year : 2000 + year;
+}
+
+// PARSING
+
+export function parseZoneInfo(ts, offsetFormat, locale, timeZone = null) {
+  const date = new Date(ts),
+    intlOpts = {
+      hourCycle: "h23",
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+    };
+
+  if (timeZone) {
+    intlOpts.timeZone = timeZone;
+  }
+
+  const modified = { timeZoneName: offsetFormat, ...intlOpts };
+
+  const parsed = new Intl.DateTimeFormat(locale, modified)
+    .formatToParts(date)
+    .find((m) => m.type.toLowerCase() === "timezonename");
+  return parsed ? parsed.value : null;
+}
+
+// signedOffset('-5', '30') -> -330
+export function signedOffset(offHourStr, offMinuteStr) {
+  let offHour = parseInt(offHourStr, 10);
+
+  // don't || this because we want to preserve -0
+  if (Number.isNaN(offHour)) {
+    offHour = 0;
+  }
+
+  const offMin = parseInt(offMinuteStr, 10) || 0,
+    offMinSigned = offHour < 0 || Object.is(offHour, -0) ? -offMin : offMin;
+  return offHour * 60 + offMinSigned;
+}
+
+// COERCION
+
+export function asNumber(value) {
+  const numericValue = Number(value);
+  if (typeof value === "boolean" || value === "" || !Number.isFinite(numericValue))
+    throw new InvalidArgumentError(`Invalid unit value ${value}`);
+  return numericValue;
+}
+
+export function normalizeObject(obj, normalizer) {
+  const normalized = {};
+  for (const u in obj) {
+    if (hasOwnProperty(obj, u)) {
+      const v = obj[u];
+      if (v === undefined || v === null) continue;
+      normalized[normalizer(u)] = asNumber(v);
+    }
+  }
+  return normalized;
+}
+
+/**
+ * Returns the offset's value as a string
+ * @param {number} ts - Epoch milliseconds for which to get the offset
+ * @param {string} format - What style of offset to return.
+ *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+ * @return {string}
+ */
+export function formatOffset(offset, format) {
+  const hours = Math.trunc(Math.abs(offset / 60)),
+    minutes = Math.trunc(Math.abs(offset % 60)),
+    sign = offset >= 0 ? "+" : "-";
+
+  switch (format) {
+    case "short":
+      return `${sign}${padStart(hours, 2)}:${padStart(minutes, 2)}`;
+    case "narrow":
+      return `${sign}${hours}${minutes > 0 ? `:${minutes}` : ""}`;
+    case "techie":
+      return `${sign}${padStart(hours, 2)}${padStart(minutes, 2)}`;
+    default:
+      throw new RangeError(`Value format ${format} is out of range for property format`);
+  }
+}
+
+export function timeObject(obj) {
+  return pick(obj, ["hour", "minute", "second", "millisecond"]);
+}
diff --git a/node_modules/luxon/src/impl/zoneUtil.js b/node_modules/luxon/src/impl/zoneUtil.js
new file mode 100644
index 0000000..c3151a7
--- /dev/null
+++ b/node_modules/luxon/src/impl/zoneUtil.js
@@ -0,0 +1,34 @@
+/**
+ * @private
+ */
+
+import Zone from "../zone.js";
+import IANAZone from "../zones/IANAZone.js";
+import FixedOffsetZone from "../zones/fixedOffsetZone.js";
+import InvalidZone from "../zones/invalidZone.js";
+
+import { isUndefined, isString, isNumber } from "./util.js";
+import SystemZone from "../zones/systemZone.js";
+
+export function normalizeZone(input, defaultZone) {
+  let offset;
+  if (isUndefined(input) || input === null) {
+    return defaultZone;
+  } else if (input instanceof Zone) {
+    return input;
+  } else if (isString(input)) {
+    const lowered = input.toLowerCase();
+    if (lowered === "default") return defaultZone;
+    else if (lowered === "local" || lowered === "system") return SystemZone.instance;
+    else if (lowered === "utc" || lowered === "gmt") return FixedOffsetZone.utcInstance;
+    else return FixedOffsetZone.parseSpecifier(lowered) || IANAZone.create(input);
+  } else if (isNumber(input)) {
+    return FixedOffsetZone.instance(input);
+  } else if (typeof input === "object" && "offset" in input && typeof input.offset === "function") {
+    // This is dumb, but the instanceof check above doesn't seem to really work
+    // so we're duck checking it
+    return input;
+  } else {
+    return new InvalidZone(input);
+  }
+}
diff --git a/node_modules/luxon/src/info.js b/node_modules/luxon/src/info.js
new file mode 100644
index 0000000..72124b4
--- /dev/null
+++ b/node_modules/luxon/src/info.js
@@ -0,0 +1,205 @@
+import DateTime from "./datetime.js";
+import Settings from "./settings.js";
+import Locale from "./impl/locale.js";
+import IANAZone from "./zones/IANAZone.js";
+import { normalizeZone } from "./impl/zoneUtil.js";
+
+import { hasLocaleWeekInfo, hasRelative } from "./impl/util.js";
+
+/**
+ * The Info class contains static methods for retrieving general time and date related data. For example, it has methods for finding out if a time zone has a DST, for listing the months in any supported locale, and for discovering which of Luxon features are available in the current environment.
+ */
+export default class Info {
+  /**
+   * Return whether the specified zone contains a DST.
+   * @param {string|Zone} [zone='local'] - Zone to check. Defaults to the environment's local zone.
+   * @return {boolean}
+   */
+  static hasDST(zone = Settings.defaultZone) {
+    const proto = DateTime.now().setZone(zone).set({ month: 12 });
+
+    return !zone.isUniversal && proto.offset !== proto.set({ month: 6 }).offset;
+  }
+
+  /**
+   * Return whether the specified zone is a valid IANA specifier.
+   * @param {string} zone - Zone to check
+   * @return {boolean}
+   */
+  static isValidIANAZone(zone) {
+    return IANAZone.isValidZone(zone);
+  }
+
+  /**
+   * Converts the input into a {@link Zone} instance.
+   *
+   * * If `input` is already a Zone instance, it is returned unchanged.
+   * * If `input` is a string containing a valid time zone name, a Zone instance
+   *   with that name is returned.
+   * * If `input` is a string that doesn't refer to a known time zone, a Zone
+   *   instance with {@link Zone#isValid} == false is returned.
+   * * If `input is a number, a Zone instance with the specified fixed offset
+   *   in minutes is returned.
+   * * If `input` is `null` or `undefined`, the default zone is returned.
+   * @param {string|Zone|number} [input] - the value to be converted
+   * @return {Zone}
+   */
+  static normalizeZone(input) {
+    return normalizeZone(input, Settings.defaultZone);
+  }
+
+  /**
+   * Get the weekday on which the week starts according to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number} the start of the week, 1 for Monday through 7 for Sunday
+   */
+  static getStartOfWeek({ locale = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale)).getStartOfWeek();
+  }
+
+  /**
+   * Get the minimum number of days necessary in a week before it is considered part of the next year according
+   * to the given locale.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number}
+   */
+  static getMinimumDaysInFirstWeek({ locale = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale)).getMinDaysInFirstWeek();
+  }
+
+  /**
+   * Get the weekdays, which are considered the weekend according to the given locale
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @returns {number[]} an array of weekdays, 1 for Monday through 7 for Sunday
+   */
+  static getWeekendWeekdays({ locale = null, locObj = null } = {}) {
+    // copy the array, because we cache it internally
+    return (locObj || Locale.create(locale)).getWeekendDays().slice();
+  }
+
+  /**
+   * Return an array of standalone month names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @example Info.months()[0] //=> 'January'
+   * @example Info.months('short')[0] //=> 'Jan'
+   * @example Info.months('numeric')[0] //=> '1'
+   * @example Info.months('short', { locale: 'fr-CA' } )[0] //=> 'janv.'
+   * @example Info.months('numeric', { locale: 'ar' })[0] //=> '١'
+   * @example Info.months('long', { outputCalendar: 'islamic' })[0] //=> 'Rabiʻ I'
+   * @return {Array}
+   */
+  static months(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null, outputCalendar = "gregory" } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length);
+  }
+
+  /**
+   * Return an array of format month names.
+   * Format months differ from standalone months in that they're meant to appear next to the day of the month. In some languages, that
+   * changes the string.
+   * See {@link Info#months}
+   * @param {string} [length='long'] - the length of the month representation, such as "numeric", "2-digit", "narrow", "short", "long"
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @param {string} [opts.outputCalendar='gregory'] - the calendar
+   * @return {Array}
+   */
+  static monthsFormat(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null, outputCalendar = "gregory" } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, outputCalendar)).months(length, true);
+  }
+
+  /**
+   * Return an array of standalone week names.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {string} [length='long'] - the length of the weekday representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @example Info.weekdays()[0] //=> 'Monday'
+   * @example Info.weekdays('short')[0] //=> 'Mon'
+   * @example Info.weekdays('short', { locale: 'fr-CA' })[0] //=> 'lun.'
+   * @example Info.weekdays('short', { locale: 'ar' })[0] //=> 'الاثنين'
+   * @return {Array}
+   */
+  static weekdays(length = "long", { locale = null, numberingSystem = null, locObj = null } = {}) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length);
+  }
+
+  /**
+   * Return an array of format week names.
+   * Format weekdays differ from standalone weekdays in that they're meant to appear next to more date information. In some languages, that
+   * changes the string.
+   * See {@link Info#weekdays}
+   * @param {string} [length='long'] - the length of the month representation, such as "narrow", "short", "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale=null] - the locale code
+   * @param {string} [opts.numberingSystem=null] - the numbering system
+   * @param {string} [opts.locObj=null] - an existing locale object to use
+   * @return {Array}
+   */
+  static weekdaysFormat(
+    length = "long",
+    { locale = null, numberingSystem = null, locObj = null } = {}
+  ) {
+    return (locObj || Locale.create(locale, numberingSystem, null)).weekdays(length, true);
+  }
+
+  /**
+   * Return an array of meridiems.
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.meridiems() //=> [ 'AM', 'PM' ]
+   * @example Info.meridiems({ locale: 'my' }) //=> [ 'နံနက်', 'ညနေ' ]
+   * @return {Array}
+   */
+  static meridiems({ locale = null } = {}) {
+    return Locale.create(locale).meridiems();
+  }
+
+  /**
+   * Return an array of eras, such as ['BC', 'AD']. The locale can be specified, but the calendar system is always Gregorian.
+   * @param {string} [length='short'] - the length of the era representation, such as "short" or "long".
+   * @param {Object} opts - options
+   * @param {string} [opts.locale] - the locale code
+   * @example Info.eras() //=> [ 'BC', 'AD' ]
+   * @example Info.eras('long') //=> [ 'Before Christ', 'Anno Domini' ]
+   * @example Info.eras('long', { locale: 'fr' }) //=> [ 'avant Jésus-Christ', 'après Jésus-Christ' ]
+   * @return {Array}
+   */
+  static eras(length = "short", { locale = null } = {}) {
+    return Locale.create(locale, null, "gregory").eras(length);
+  }
+
+  /**
+   * Return the set of available features in this environment.
+   * Some features of Luxon are not available in all environments. For example, on older browsers, relative time formatting support is not available. Use this function to figure out if that's the case.
+   * Keys:
+   * * `relative`: whether this environment supports relative time formatting
+   * * `localeWeek`: whether this environment supports different weekdays for the start of the week based on the locale
+   * @example Info.features() //=> { relative: false, localeWeek: true }
+   * @return {Object}
+   */
+  static features() {
+    return { relative: hasRelative(), localeWeek: hasLocaleWeekInfo() };
+  }
+}
diff --git a/node_modules/luxon/src/interval.js b/node_modules/luxon/src/interval.js
new file mode 100644
index 0000000..48f9ba4
--- /dev/null
+++ b/node_modules/luxon/src/interval.js
@@ -0,0 +1,669 @@
+import DateTime, { friendlyDateTime } from "./datetime.js";
+import Duration from "./duration.js";
+import Settings from "./settings.js";
+import { InvalidArgumentError, InvalidIntervalError } from "./errors.js";
+import Invalid from "./impl/invalid.js";
+import Formatter from "./impl/formatter.js";
+import * as Formats from "./impl/formats.js";
+
+const INVALID = "Invalid Interval";
+
+// checks if the start is equal to or before the end
+function validateStartEnd(start, end) {
+  if (!start || !start.isValid) {
+    return Interval.invalid("missing or invalid start");
+  } else if (!end || !end.isValid) {
+    return Interval.invalid("missing or invalid end");
+  } else if (end < start) {
+    return Interval.invalid(
+      "end before start",
+      `The end of an interval must be after its start, but you had start=${start.toISO()} and end=${end.toISO()}`
+    );
+  } else {
+    return null;
+  }
+}
+
+/**
+ * An Interval object represents a half-open interval of time, where each endpoint is a {@link DateTime}. Conceptually, it's a container for those two endpoints, accompanied by methods for creating, parsing, interrogating, comparing, transforming, and formatting them.
+ *
+ * Here is a brief overview of the most commonly used methods and getters in Interval:
+ *
+ * * **Creation** To create an Interval, use {@link Interval.fromDateTimes}, {@link Interval.after}, {@link Interval.before}, or {@link Interval.fromISO}.
+ * * **Accessors** Use {@link Interval#start} and {@link Interval#end} to get the start and end.
+ * * **Interrogation** To analyze the Interval, use {@link Interval#count}, {@link Interval#length}, {@link Interval#hasSame}, {@link Interval#contains}, {@link Interval#isAfter}, or {@link Interval#isBefore}.
+ * * **Transformation** To create other Intervals out of this one, use {@link Interval#set}, {@link Interval#splitAt}, {@link Interval#splitBy}, {@link Interval#divideEqually}, {@link Interval.merge}, {@link Interval.xor}, {@link Interval#union}, {@link Interval#intersection}, or {@link Interval#difference}.
+ * * **Comparison** To compare this Interval to another one, use {@link Interval#equals}, {@link Interval#overlaps}, {@link Interval#abutsStart}, {@link Interval#abutsEnd}, {@link Interval#engulfs}
+ * * **Output** To convert the Interval into other representations, see {@link Interval#toString}, {@link Interval#toLocaleString}, {@link Interval#toISO}, {@link Interval#toISODate}, {@link Interval#toISOTime}, {@link Interval#toFormat}, and {@link Interval#toDuration}.
+ */
+export default class Interval {
+  /**
+   * @private
+   */
+  constructor(config) {
+    /**
+     * @access private
+     */
+    this.s = config.start;
+    /**
+     * @access private
+     */
+    this.e = config.end;
+    /**
+     * @access private
+     */
+    this.invalid = config.invalid || null;
+    /**
+     * @access private
+     */
+    this.isLuxonInterval = true;
+  }
+
+  /**
+   * Create an invalid Interval.
+   * @param {string} reason - simple string of why this Interval is invalid. Should not contain parameters or anything else data-dependent
+   * @param {string} [explanation=null] - longer explanation, may include parameters and other useful debugging information
+   * @return {Interval}
+   */
+  static invalid(reason, explanation = null) {
+    if (!reason) {
+      throw new InvalidArgumentError("need to specify a reason the Interval is invalid");
+    }
+
+    const invalid = reason instanceof Invalid ? reason : new Invalid(reason, explanation);
+
+    if (Settings.throwOnInvalid) {
+      throw new InvalidIntervalError(invalid);
+    } else {
+      return new Interval({ invalid });
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and an end DateTime. Inclusive of the start but not the end.
+   * @param {DateTime|Date|Object} start
+   * @param {DateTime|Date|Object} end
+   * @return {Interval}
+   */
+  static fromDateTimes(start, end) {
+    const builtStart = friendlyDateTime(start),
+      builtEnd = friendlyDateTime(end);
+
+    const validateError = validateStartEnd(builtStart, builtEnd);
+
+    if (validateError == null) {
+      return new Interval({
+        start: builtStart,
+        end: builtEnd,
+      });
+    } else {
+      return validateError;
+    }
+  }
+
+  /**
+   * Create an Interval from a start DateTime and a Duration to extend to.
+   * @param {DateTime|Date|Object} start
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static after(start, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(start);
+    return Interval.fromDateTimes(dt, dt.plus(dur));
+  }
+
+  /**
+   * Create an Interval from an end DateTime and a Duration to extend backwards to.
+   * @param {DateTime|Date|Object} end
+   * @param {Duration|Object|number} duration - the length of the Interval.
+   * @return {Interval}
+   */
+  static before(end, duration) {
+    const dur = Duration.fromDurationLike(duration),
+      dt = friendlyDateTime(end);
+    return Interval.fromDateTimes(dt.minus(dur), dt);
+  }
+
+  /**
+   * Create an Interval from an ISO 8601 string.
+   * Accepts `<start>/<end>`, `<start>/<duration>`, and `<duration>/<end>` formats.
+   * @param {string} text - the ISO string to parse
+   * @param {Object} [opts] - options to pass {@link DateTime#fromISO} and optionally {@link Duration#fromISO}
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {Interval}
+   */
+  static fromISO(text, opts) {
+    const [s, e] = (text || "").split("/", 2);
+    if (s && e) {
+      let start, startIsValid;
+      try {
+        start = DateTime.fromISO(s, opts);
+        startIsValid = start.isValid;
+      } catch (e) {
+        startIsValid = false;
+      }
+
+      let end, endIsValid;
+      try {
+        end = DateTime.fromISO(e, opts);
+        endIsValid = end.isValid;
+      } catch (e) {
+        endIsValid = false;
+      }
+
+      if (startIsValid && endIsValid) {
+        return Interval.fromDateTimes(start, end);
+      }
+
+      if (startIsValid) {
+        const dur = Duration.fromISO(e, opts);
+        if (dur.isValid) {
+          return Interval.after(start, dur);
+        }
+      } else if (endIsValid) {
+        const dur = Duration.fromISO(s, opts);
+        if (dur.isValid) {
+          return Interval.before(end, dur);
+        }
+      }
+    }
+    return Interval.invalid("unparsable", `the input "${text}" can't be parsed as ISO 8601`);
+  }
+
+  /**
+   * Check if an object is an Interval. Works across context boundaries
+   * @param {object} o
+   * @return {boolean}
+   */
+  static isInterval(o) {
+    return (o && o.isLuxonInterval) || false;
+  }
+
+  /**
+   * Returns the start of the Interval
+   * @type {DateTime}
+   */
+  get start() {
+    return this.isValid ? this.s : null;
+  }
+
+  /**
+   * Returns the end of the Interval. This is the first instant which is not part of the interval
+   * (Interval is half-open).
+   * @type {DateTime}
+   */
+  get end() {
+    return this.isValid ? this.e : null;
+  }
+
+  /**
+   * Returns the last DateTime included in the interval (since end is not part of the interval)
+   * @type {DateTime}
+   */
+  get lastDateTime() {
+    return this.isValid ? (this.e ? this.e.minus(1) : null) : null;
+  }
+
+  /**
+   * Returns whether this Interval's end is at least its start, meaning that the Interval isn't 'backwards'.
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.invalidReason === null;
+  }
+
+  /**
+   * Returns an error code if this Interval is invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidReason() {
+    return this.invalid ? this.invalid.reason : null;
+  }
+
+  /**
+   * Returns an explanation of why this Interval became invalid, or null if the Interval is valid
+   * @type {string}
+   */
+  get invalidExplanation() {
+    return this.invalid ? this.invalid.explanation : null;
+  }
+
+  /**
+   * Returns the length of the Interval in the specified unit.
+   * @param {string} unit - the unit (such as 'hours' or 'days') to return the length in.
+   * @return {number}
+   */
+  length(unit = "milliseconds") {
+    return this.isValid ? this.toDuration(...[unit]).get(unit) : NaN;
+  }
+
+  /**
+   * Returns the count of minutes, hours, days, months, or years included in the Interval, even in part.
+   * Unlike {@link Interval#length} this counts sections of the calendar, not periods of time, e.g. specifying 'day'
+   * asks 'what dates are included in this interval?', not 'how many days long is this interval?'
+   * @param {string} [unit='milliseconds'] - the unit of time to count.
+   * @param {Object} opts - options
+   * @param {boolean} [opts.useLocaleWeeks=false] - If true, use weeks based on the locale, i.e. use the locale-dependent start of the week; this operation will always use the locale of the start DateTime
+   * @return {number}
+   */
+  count(unit = "milliseconds", opts) {
+    if (!this.isValid) return NaN;
+    const start = this.start.startOf(unit, opts);
+    let end;
+    if (opts?.useLocaleWeeks) {
+      end = this.end.reconfigure({ locale: start.locale });
+    } else {
+      end = this.end;
+    }
+    end = end.startOf(unit, opts);
+    return Math.floor(end.diff(start, unit).get(unit)) + (end.valueOf() !== this.end.valueOf());
+  }
+
+  /**
+   * Returns whether this Interval's start and end are both in the same unit of time
+   * @param {string} unit - the unit of time to check sameness on
+   * @return {boolean}
+   */
+  hasSame(unit) {
+    return this.isValid ? this.isEmpty() || this.e.minus(1).hasSame(this.s, unit) : false;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end DateTimes.
+   * @return {boolean}
+   */
+  isEmpty() {
+    return this.s.valueOf() === this.e.valueOf();
+  }
+
+  /**
+   * Return whether this Interval's start is after the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isAfter(dateTime) {
+    if (!this.isValid) return false;
+    return this.s > dateTime;
+  }
+
+  /**
+   * Return whether this Interval's end is before the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  isBefore(dateTime) {
+    if (!this.isValid) return false;
+    return this.e <= dateTime;
+  }
+
+  /**
+   * Return whether this Interval contains the specified DateTime.
+   * @param {DateTime} dateTime
+   * @return {boolean}
+   */
+  contains(dateTime) {
+    if (!this.isValid) return false;
+    return this.s <= dateTime && this.e > dateTime;
+  }
+
+  /**
+   * "Sets" the start and/or end dates. Returns a newly-constructed Interval.
+   * @param {Object} values - the values to set
+   * @param {DateTime} values.start - the starting DateTime
+   * @param {DateTime} values.end - the ending DateTime
+   * @return {Interval}
+   */
+  set({ start, end } = {}) {
+    if (!this.isValid) return this;
+    return Interval.fromDateTimes(start || this.s, end || this.e);
+  }
+
+  /**
+   * Split this Interval at each of the specified DateTimes
+   * @param {...DateTime} dateTimes - the unit of time to count.
+   * @return {Array}
+   */
+  splitAt(...dateTimes) {
+    if (!this.isValid) return [];
+    const sorted = dateTimes
+        .map(friendlyDateTime)
+        .filter((d) => this.contains(d))
+        .sort((a, b) => a.toMillis() - b.toMillis()),
+      results = [];
+    let { s } = this,
+      i = 0;
+
+    while (s < this.e) {
+      const added = sorted[i] || this.e,
+        next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      i += 1;
+    }
+
+    return results;
+  }
+
+  /**
+   * Split this Interval into smaller Intervals, each of the specified length.
+   * Left over time is grouped into a smaller interval
+   * @param {Duration|Object|number} duration - The length of each resulting interval.
+   * @return {Array}
+   */
+  splitBy(duration) {
+    const dur = Duration.fromDurationLike(duration);
+
+    if (!this.isValid || !dur.isValid || dur.as("milliseconds") === 0) {
+      return [];
+    }
+
+    let { s } = this,
+      idx = 1,
+      next;
+
+    const results = [];
+    while (s < this.e) {
+      const added = this.start.plus(dur.mapUnits((x) => x * idx));
+      next = +added > +this.e ? this.e : added;
+      results.push(Interval.fromDateTimes(s, next));
+      s = next;
+      idx += 1;
+    }
+
+    return results;
+  }
+
+  /**
+   * Split this Interval into the specified number of smaller intervals.
+   * @param {number} numberOfParts - The number of Intervals to divide the Interval into.
+   * @return {Array}
+   */
+  divideEqually(numberOfParts) {
+    if (!this.isValid) return [];
+    return this.splitBy(this.length() / numberOfParts).slice(0, numberOfParts);
+  }
+
+  /**
+   * Return whether this Interval overlaps with the specified Interval
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  overlaps(other) {
+    return this.e > other.s && this.s < other.e;
+  }
+
+  /**
+   * Return whether this Interval's end is adjacent to the specified Interval's start.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsStart(other) {
+    if (!this.isValid) return false;
+    return +this.e === +other.s;
+  }
+
+  /**
+   * Return whether this Interval's start is adjacent to the specified Interval's end.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  abutsEnd(other) {
+    if (!this.isValid) return false;
+    return +other.e === +this.s;
+  }
+
+  /**
+   * Returns true if this Interval fully contains the specified Interval, specifically if the intersect (of this Interval and the other Interval) is equal to the other Interval; false otherwise.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  engulfs(other) {
+    if (!this.isValid) return false;
+    return this.s <= other.s && this.e >= other.e;
+  }
+
+  /**
+   * Return whether this Interval has the same start and end as the specified Interval.
+   * @param {Interval} other
+   * @return {boolean}
+   */
+  equals(other) {
+    if (!this.isValid || !other.isValid) {
+      return false;
+    }
+
+    return this.s.equals(other.s) && this.e.equals(other.e);
+  }
+
+  /**
+   * Return an Interval representing the intersection of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the maximum start time and the minimum end time of the two Intervals.
+   * Returns null if the intersection is empty, meaning, the intervals don't intersect.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  intersection(other) {
+    if (!this.isValid) return this;
+    const s = this.s > other.s ? this.s : other.s,
+      e = this.e < other.e ? this.e : other.e;
+
+    if (s >= e) {
+      return null;
+    } else {
+      return Interval.fromDateTimes(s, e);
+    }
+  }
+
+  /**
+   * Return an Interval representing the union of this Interval and the specified Interval.
+   * Specifically, the resulting Interval has the minimum start time and the maximum end time of the two Intervals.
+   * @param {Interval} other
+   * @return {Interval}
+   */
+  union(other) {
+    if (!this.isValid) return this;
+    const s = this.s < other.s ? this.s : other.s,
+      e = this.e > other.e ? this.e : other.e;
+    return Interval.fromDateTimes(s, e);
+  }
+
+  /**
+   * Merge an array of Intervals into an equivalent minimal set of Intervals.
+   * Combines overlapping and adjacent Intervals.
+   * The resulting array will contain the Intervals in ascending order, that is, starting with the earliest Interval
+   * and ending with the latest.
+   *
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static merge(intervals) {
+    const [found, final] = intervals
+      .sort((a, b) => a.s - b.s)
+      .reduce(
+        ([sofar, current], item) => {
+          if (!current) {
+            return [sofar, item];
+          } else if (current.overlaps(item) || current.abutsStart(item)) {
+            return [sofar, current.union(item)];
+          } else {
+            return [sofar.concat([current]), item];
+          }
+        },
+        [[], null]
+      );
+    if (final) {
+      found.push(final);
+    }
+    return found;
+  }
+
+  /**
+   * Return an array of Intervals representing the spans of time that only appear in one of the specified Intervals.
+   * @param {Array} intervals
+   * @return {Array}
+   */
+  static xor(intervals) {
+    let start = null,
+      currentCount = 0;
+    const results = [],
+      ends = intervals.map((i) => [
+        { time: i.s, type: "s" },
+        { time: i.e, type: "e" },
+      ]),
+      flattened = Array.prototype.concat(...ends),
+      arr = flattened.sort((a, b) => a.time - b.time);
+
+    for (const i of arr) {
+      currentCount += i.type === "s" ? 1 : -1;
+
+      if (currentCount === 1) {
+        start = i.time;
+      } else {
+        if (start && +start !== +i.time) {
+          results.push(Interval.fromDateTimes(start, i.time));
+        }
+
+        start = null;
+      }
+    }
+
+    return Interval.merge(results);
+  }
+
+  /**
+   * Return an Interval representing the span of time in this Interval that doesn't overlap with any of the specified Intervals.
+   * @param {...Interval} intervals
+   * @return {Array}
+   */
+  difference(...intervals) {
+    return Interval.xor([this].concat(intervals))
+      .map((i) => this.intersection(i))
+      .filter((i) => i && !i.isEmpty());
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for debugging.
+   * @return {string}
+   */
+  toString() {
+    if (!this.isValid) return INVALID;
+    return `[${this.s.toISO()} – ${this.e.toISO()})`;
+  }
+
+  /**
+   * Returns a string representation of this Interval appropriate for the REPL.
+   * @return {string}
+   */
+  [Symbol.for("nodejs.util.inspect.custom")]() {
+    if (this.isValid) {
+      return `Interval { start: ${this.s.toISO()}, end: ${this.e.toISO()} }`;
+    } else {
+      return `Interval { Invalid, reason: ${this.invalidReason} }`;
+    }
+  }
+
+  /**
+   * Returns a localized string representing this Interval. Accepts the same options as the
+   * Intl.DateTimeFormat constructor and any presets defined by Luxon, such as
+   * {@link DateTime.DATE_FULL} or {@link DateTime.TIME_SIMPLE}. The exact behavior of this method
+   * is browser-specific, but in general it will return an appropriate representation of the
+   * Interval in the assigned locale. Defaults to the system's locale if no locale has been
+   * specified.
+   * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/DateTimeFormat
+   * @param {Object} [formatOpts=DateTime.DATE_SHORT] - Either a DateTime preset or
+   * Intl.DateTimeFormat constructor options.
+   * @param {Object} opts - Options to override the configuration of the start DateTime.
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(); //=> 11/7/2022 – 11/8/2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL); //=> November 7 – 8, 2022
+   * @example Interval.fromISO('2022-11-07T09:00Z/2022-11-08T09:00Z').toLocaleString(DateTime.DATE_FULL, { locale: 'fr-FR' }); //=> 7–8 novembre 2022
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString(DateTime.TIME_SIMPLE); //=> 6:00 – 8:00 PM
+   * @example Interval.fromISO('2022-11-07T17:00Z/2022-11-07T19:00Z').toLocaleString({ weekday: 'short', month: 'short', day: '2-digit', hour: '2-digit', minute: '2-digit' }); //=> Mon, Nov 07, 6:00 – 8:00 p
+   * @return {string}
+   */
+  toLocaleString(formatOpts = Formats.DATE_SHORT, opts = {}) {
+    return this.isValid
+      ? Formatter.create(this.s.loc.clone(opts), formatOpts).formatInterval(this)
+      : INVALID;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of this Interval.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISO(opts) {
+    if (!this.isValid) return INVALID;
+    return `${this.s.toISO(opts)}/${this.e.toISO(opts)}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of date of this Interval.
+   * The time components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @return {string}
+   */
+  toISODate() {
+    if (!this.isValid) return INVALID;
+    return `${this.s.toISODate()}/${this.e.toISODate()}`;
+  }
+
+  /**
+   * Returns an ISO 8601-compliant string representation of time of this Interval.
+   * The date components are ignored.
+   * @see https://en.wikipedia.org/wiki/ISO_8601#Time_intervals
+   * @param {Object} opts - The same options as {@link DateTime#toISO}
+   * @return {string}
+   */
+  toISOTime(opts) {
+    if (!this.isValid) return INVALID;
+    return `${this.s.toISOTime(opts)}/${this.e.toISOTime(opts)}`;
+  }
+
+  /**
+   * Returns a string representation of this Interval formatted according to the specified format
+   * string. **You may not want this.** See {@link Interval#toLocaleString} for a more flexible
+   * formatting tool.
+   * @param {string} dateFormat - The format string. This string formats the start and end time.
+   * See {@link DateTime#toFormat} for details.
+   * @param {Object} opts - Options.
+   * @param {string} [opts.separator =  ' – '] - A separator to place between the start and end
+   * representations.
+   * @return {string}
+   */
+  toFormat(dateFormat, { separator = " – " } = {}) {
+    if (!this.isValid) return INVALID;
+    return `${this.s.toFormat(dateFormat)}${separator}${this.e.toFormat(dateFormat)}`;
+  }
+
+  /**
+   * Return a Duration representing the time spanned by this interval.
+   * @param {string|string[]} [unit=['milliseconds']] - the unit or units (such as 'hours' or 'days') to include in the duration.
+   * @param {Object} opts - options that affect the creation of the Duration
+   * @param {string} [opts.conversionAccuracy='casual'] - the conversion system to use
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration().toObject() //=> { milliseconds: 88489257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('days').toObject() //=> { days: 1.0241812152777778 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes']).toObject() //=> { hours: 24, minutes: 34.82095 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration(['hours', 'minutes', 'seconds']).toObject() //=> { hours: 24, minutes: 34, seconds: 49.257 }
+   * @example Interval.fromDateTimes(dt1, dt2).toDuration('seconds').toObject() //=> { seconds: 88489.257 }
+   * @return {Duration}
+   */
+  toDuration(unit, opts) {
+    if (!this.isValid) {
+      return Duration.invalid(this.invalidReason);
+    }
+    return this.e.diff(this.s, unit, opts);
+  }
+
+  /**
+   * Run mapFn on the interval start and end, returning a new Interval from the resulting DateTimes
+   * @param {function} mapFn
+   * @return {Interval}
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.toUTC())
+   * @example Interval.fromDateTimes(dt1, dt2).mapEndpoints(endpoint => endpoint.plus({ hours: 2 }))
+   */
+  mapEndpoints(mapFn) {
+    return Interval.fromDateTimes(mapFn(this.s), mapFn(this.e));
+  }
+}
diff --git a/node_modules/luxon/src/luxon.js b/node_modules/luxon/src/luxon.js
new file mode 100644
index 0000000..9cfd39f
--- /dev/null
+++ b/node_modules/luxon/src/luxon.js
@@ -0,0 +1,26 @@
+import DateTime from "./datetime.js";
+import Duration from "./duration.js";
+import Interval from "./interval.js";
+import Info from "./info.js";
+import Zone from "./zone.js";
+import FixedOffsetZone from "./zones/fixedOffsetZone.js";
+import IANAZone from "./zones/IANAZone.js";
+import InvalidZone from "./zones/invalidZone.js";
+import SystemZone from "./zones/systemZone.js";
+import Settings from "./settings.js";
+
+const VERSION = "3.7.2";
+
+export {
+  VERSION,
+  DateTime,
+  Duration,
+  Interval,
+  Info,
+  Zone,
+  FixedOffsetZone,
+  IANAZone,
+  InvalidZone,
+  SystemZone,
+  Settings,
+};
diff --git a/node_modules/luxon/src/package.json b/node_modules/luxon/src/package.json
new file mode 100644
index 0000000..10c2418
--- /dev/null
+++ b/node_modules/luxon/src/package.json
@@ -0,0 +1,4 @@
+{
+  "type": "module",
+  "version": "3.7.2"
+}
diff --git a/node_modules/luxon/src/settings.js b/node_modules/luxon/src/settings.js
new file mode 100644
index 0000000..5356dd6
--- /dev/null
+++ b/node_modules/luxon/src/settings.js
@@ -0,0 +1,180 @@
+import SystemZone from "./zones/systemZone.js";
+import IANAZone from "./zones/IANAZone.js";
+import Locale from "./impl/locale.js";
+import DateTime from "./datetime.js";
+
+import { normalizeZone } from "./impl/zoneUtil.js";
+import { validateWeekSettings } from "./impl/util.js";
+import { resetDigitRegexCache } from "./impl/digits.js";
+
+let now = () => Date.now(),
+  defaultZone = "system",
+  defaultLocale = null,
+  defaultNumberingSystem = null,
+  defaultOutputCalendar = null,
+  twoDigitCutoffYear = 60,
+  throwOnInvalid,
+  defaultWeekSettings = null;
+
+/**
+ * Settings contains static getters and setters that control Luxon's overall behavior. Luxon is a simple library with few options, but the ones it does have live here.
+ */
+export default class Settings {
+  /**
+   * Get the callback for returning the current timestamp.
+   * @type {function}
+   */
+  static get now() {
+    return now;
+  }
+
+  /**
+   * Set the callback for returning the current timestamp.
+   * The function should return a number, which will be interpreted as an Epoch millisecond count
+   * @type {function}
+   * @example Settings.now = () => Date.now() + 3000 // pretend it is 3 seconds in the future
+   * @example Settings.now = () => 0 // always pretend it's Jan 1, 1970 at midnight in UTC time
+   */
+  static set now(n) {
+    now = n;
+  }
+
+  /**
+   * Set the default time zone to create DateTimes in. Does not affect existing instances.
+   * Use the value "system" to reset this value to the system's time zone.
+   * @type {string}
+   */
+  static set defaultZone(zone) {
+    defaultZone = zone;
+  }
+
+  /**
+   * Get the default time zone object currently used to create DateTimes. Does not affect existing instances.
+   * The default value is the system's time zone (the one set on the machine that runs this code).
+   * @type {Zone}
+   */
+  static get defaultZone() {
+    return normalizeZone(defaultZone, SystemZone.instance);
+  }
+
+  /**
+   * Get the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultLocale() {
+    return defaultLocale;
+  }
+
+  /**
+   * Set the default locale to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultLocale(locale) {
+    defaultLocale = locale;
+  }
+
+  /**
+   * Get the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultNumberingSystem() {
+    return defaultNumberingSystem;
+  }
+
+  /**
+   * Set the default numbering system to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultNumberingSystem(numberingSystem) {
+    defaultNumberingSystem = numberingSystem;
+  }
+
+  /**
+   * Get the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static get defaultOutputCalendar() {
+    return defaultOutputCalendar;
+  }
+
+  /**
+   * Set the default output calendar to create DateTimes with. Does not affect existing instances.
+   * @type {string}
+   */
+  static set defaultOutputCalendar(outputCalendar) {
+    defaultOutputCalendar = outputCalendar;
+  }
+
+  /**
+   * @typedef {Object} WeekSettings
+   * @property {number} firstDay
+   * @property {number} minimalDays
+   * @property {number[]} weekend
+   */
+
+  /**
+   * @return {WeekSettings|null}
+   */
+  static get defaultWeekSettings() {
+    return defaultWeekSettings;
+  }
+
+  /**
+   * Allows overriding the default locale week settings, i.e. the start of the week, the weekend and
+   * how many days are required in the first week of a year.
+   * Does not affect existing instances.
+   *
+   * @param {WeekSettings|null} weekSettings
+   */
+  static set defaultWeekSettings(weekSettings) {
+    defaultWeekSettings = validateWeekSettings(weekSettings);
+  }
+
+  /**
+   * Get the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   */
+  static get twoDigitCutoffYear() {
+    return twoDigitCutoffYear;
+  }
+
+  /**
+   * Set the cutoff year for whether a 2-digit year string is interpreted in the current or previous century. Numbers higher than the cutoff will be considered to mean 19xx and numbers lower or equal to the cutoff will be considered 20xx.
+   * @type {number}
+   * @example Settings.twoDigitCutoffYear = 0 // all 'yy' are interpreted as 20th century
+   * @example Settings.twoDigitCutoffYear = 99 // all 'yy' are interpreted as 21st century
+   * @example Settings.twoDigitCutoffYear = 50 // '49' -> 2049; '50' -> 1950
+   * @example Settings.twoDigitCutoffYear = 1950 // interpreted as 50
+   * @example Settings.twoDigitCutoffYear = 2050 // ALSO interpreted as 50
+   */
+  static set twoDigitCutoffYear(cutoffYear) {
+    twoDigitCutoffYear = cutoffYear % 100;
+  }
+
+  /**
+   * Get whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static get throwOnInvalid() {
+    return throwOnInvalid;
+  }
+
+  /**
+   * Set whether Luxon will throw when it encounters invalid DateTimes, Durations, or Intervals
+   * @type {boolean}
+   */
+  static set throwOnInvalid(t) {
+    throwOnInvalid = t;
+  }
+
+  /**
+   * Reset Luxon's global caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCaches() {
+    Locale.resetCache();
+    IANAZone.resetCache();
+    DateTime.resetCache();
+    resetDigitRegexCache();
+  }
+}
diff --git a/node_modules/luxon/src/zone.js b/node_modules/luxon/src/zone.js
new file mode 100644
index 0000000..f91a02e
--- /dev/null
+++ b/node_modules/luxon/src/zone.js
@@ -0,0 +1,97 @@
+import { ZoneIsAbstractError } from "./errors.js";
+
+/**
+ * @interface
+ */
+export default class Zone {
+  /**
+   * The type of zone
+   * @abstract
+   * @type {string}
+   */
+  get type() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The name of this zone.
+   * @abstract
+   * @type {string}
+   */
+  get name() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * The IANA name of this zone.
+   * Defaults to `name` if not overwritten by a subclass.
+   * @abstract
+   * @type {string}
+   */
+  get ianaName() {
+    return this.name;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year.
+   * @abstract
+   * @type {boolean}
+   */
+  get isUniversal() {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, opts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @abstract
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @abstract
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    throw new ZoneIsAbstractError();
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @abstract
+   * @type {boolean}
+   */
+  get isValid() {
+    throw new ZoneIsAbstractError();
+  }
+}
diff --git a/node_modules/luxon/src/zones/IANAZone.js b/node_modules/luxon/src/zones/IANAZone.js
new file mode 100644
index 0000000..aa3d375
--- /dev/null
+++ b/node_modules/luxon/src/zones/IANAZone.js
@@ -0,0 +1,235 @@
+import { formatOffset, parseZoneInfo, isUndefined, objToLocalTS } from "../impl/util.js";
+import Zone from "../zone.js";
+
+const dtfCache = new Map();
+function makeDTF(zoneName) {
+  let dtf = dtfCache.get(zoneName);
+  if (dtf === undefined) {
+    dtf = new Intl.DateTimeFormat("en-US", {
+      hour12: false,
+      timeZone: zoneName,
+      year: "numeric",
+      month: "2-digit",
+      day: "2-digit",
+      hour: "2-digit",
+      minute: "2-digit",
+      second: "2-digit",
+      era: "short",
+    });
+    dtfCache.set(zoneName, dtf);
+  }
+  return dtf;
+}
+
+const typeToPos = {
+  year: 0,
+  month: 1,
+  day: 2,
+  era: 3,
+  hour: 4,
+  minute: 5,
+  second: 6,
+};
+
+function hackyOffset(dtf, date) {
+  const formatted = dtf.format(date).replace(/\u200E/g, ""),
+    parsed = /(\d+)\/(\d+)\/(\d+) (AD|BC),? (\d+):(\d+):(\d+)/.exec(formatted),
+    [, fMonth, fDay, fYear, fadOrBc, fHour, fMinute, fSecond] = parsed;
+  return [fYear, fMonth, fDay, fadOrBc, fHour, fMinute, fSecond];
+}
+
+function partsOffset(dtf, date) {
+  const formatted = dtf.formatToParts(date);
+  const filled = [];
+  for (let i = 0; i < formatted.length; i++) {
+    const { type, value } = formatted[i];
+    const pos = typeToPos[type];
+
+    if (type === "era") {
+      filled[pos] = value;
+    } else if (!isUndefined(pos)) {
+      filled[pos] = parseInt(value, 10);
+    }
+  }
+  return filled;
+}
+
+const ianaZoneCache = new Map();
+/**
+ * A zone identified by an IANA identifier, like America/New_York
+ * @implements {Zone}
+ */
+export default class IANAZone extends Zone {
+  /**
+   * @param {string} name - Zone name
+   * @return {IANAZone}
+   */
+  static create(name) {
+    let zone = ianaZoneCache.get(name);
+    if (zone === undefined) {
+      ianaZoneCache.set(name, (zone = new IANAZone(name)));
+    }
+    return zone;
+  }
+
+  /**
+   * Reset local caches. Should only be necessary in testing scenarios.
+   * @return {void}
+   */
+  static resetCache() {
+    ianaZoneCache.clear();
+    dtfCache.clear();
+  }
+
+  /**
+   * Returns whether the provided string is a valid specifier. This only checks the string's format, not that the specifier identifies a known zone; see isValidZone for that.
+   * @param {string} s - The string to check validity on
+   * @example IANAZone.isValidSpecifier("America/New_York") //=> true
+   * @example IANAZone.isValidSpecifier("Sport~~blorp") //=> false
+   * @deprecated For backward compatibility, this forwards to isValidZone, better use `isValidZone()` directly instead.
+   * @return {boolean}
+   */
+  static isValidSpecifier(s) {
+    return this.isValidZone(s);
+  }
+
+  /**
+   * Returns whether the provided string identifies a real zone
+   * @param {string} zone - The string to check
+   * @example IANAZone.isValidZone("America/New_York") //=> true
+   * @example IANAZone.isValidZone("Fantasia/Castle") //=> false
+   * @example IANAZone.isValidZone("Sport~~blorp") //=> false
+   * @return {boolean}
+   */
+  static isValidZone(zone) {
+    if (!zone) {
+      return false;
+    }
+    try {
+      new Intl.DateTimeFormat("en-US", { timeZone: zone }).format();
+      return true;
+    } catch (e) {
+      return false;
+    }
+  }
+
+  constructor(name) {
+    super();
+    /** @private **/
+    this.zoneName = name;
+    /** @private **/
+    this.valid = IANAZone.isValidZone(name);
+  }
+
+  /**
+   * The type of zone. `iana` for all instances of `IANAZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "iana";
+  }
+
+  /**
+   * The name of this zone (i.e. the IANA zone name).
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.zoneName;
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns false for all IANA zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return false;
+  }
+
+  /**
+   * Returns the offset's common name (such as EST) at the specified timestamp
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the name
+   * @param {Object} opts - Options to affect the format
+   * @param {string} opts.format - What style of offset to return. Accepts 'long' or 'short'.
+   * @param {string} opts.locale - What locale to return the offset name in.
+   * @return {string}
+   */
+  offsetName(ts, { format, locale }) {
+    return parseZoneInfo(ts, format, locale, this.name);
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to compute the offset
+   * @return {number}
+   */
+  offset(ts) {
+    if (!this.valid) return NaN;
+    const date = new Date(ts);
+
+    if (isNaN(date)) return NaN;
+
+    const dtf = makeDTF(this.name);
+    let [year, month, day, adOrBc, hour, minute, second] = dtf.formatToParts
+      ? partsOffset(dtf, date)
+      : hackyOffset(dtf, date);
+
+    if (adOrBc === "BC") {
+      year = -Math.abs(year) + 1;
+    }
+
+    // because we're using hour12 and https://bugs.chromium.org/p/chromium/issues/detail?id=1025564&can=2&q=%2224%3A00%22%20datetimeformat
+    const adjustedHour = hour === 24 ? 0 : hour;
+
+    const asUTC = objToLocalTS({
+      year,
+      month,
+      day,
+      hour: adjustedHour,
+      minute,
+      second,
+      millisecond: 0,
+    });
+
+    let asTS = +date;
+    const over = asTS % 1000;
+    asTS -= over >= 0 ? over : 1000 + over;
+    return (asUTC - asTS) / (60 * 1000);
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "iana" && otherZone.name === this.name;
+  }
+
+  /**
+   * Return whether this Zone is valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return this.valid;
+  }
+}
diff --git a/node_modules/luxon/src/zones/fixedOffsetZone.js b/node_modules/luxon/src/zones/fixedOffsetZone.js
new file mode 100644
index 0000000..b1ab4ab
--- /dev/null
+++ b/node_modules/luxon/src/zones/fixedOffsetZone.js
@@ -0,0 +1,150 @@
+import { formatOffset, signedOffset } from "../impl/util.js";
+import Zone from "../zone.js";
+
+let singleton = null;
+
+/**
+ * A zone with a fixed offset (meaning no DST)
+ * @implements {Zone}
+ */
+export default class FixedOffsetZone extends Zone {
+  /**
+   * Get a singleton instance of UTC
+   * @return {FixedOffsetZone}
+   */
+  static get utcInstance() {
+    if (singleton === null) {
+      singleton = new FixedOffsetZone(0);
+    }
+    return singleton;
+  }
+
+  /**
+   * Get an instance with a specified offset
+   * @param {number} offset - The offset in minutes
+   * @return {FixedOffsetZone}
+   */
+  static instance(offset) {
+    return offset === 0 ? FixedOffsetZone.utcInstance : new FixedOffsetZone(offset);
+  }
+
+  /**
+   * Get an instance of FixedOffsetZone from a UTC offset string, like "UTC+6"
+   * @param {string} s - The offset string to parse
+   * @example FixedOffsetZone.parseSpecifier("UTC+6")
+   * @example FixedOffsetZone.parseSpecifier("UTC+06")
+   * @example FixedOffsetZone.parseSpecifier("UTC-6:00")
+   * @return {FixedOffsetZone}
+   */
+  static parseSpecifier(s) {
+    if (s) {
+      const r = s.match(/^utc(?:([+-]\d{1,2})(?::(\d{2}))?)?$/i);
+      if (r) {
+        return new FixedOffsetZone(signedOffset(r[1], r[2]));
+      }
+    }
+    return null;
+  }
+
+  constructor(offset) {
+    super();
+    /** @private **/
+    this.fixed = offset;
+  }
+
+  /**
+   * The type of zone. `fixed` for all instances of `FixedOffsetZone`.
+   * @override
+   * @type {string}
+   */
+  get type() {
+    return "fixed";
+  }
+
+  /**
+   * The name of this zone.
+   * All fixed zones' names always start with "UTC" (plus optional offset)
+   * @override
+   * @type {string}
+   */
+  get name() {
+    return this.fixed === 0 ? "UTC" : `UTC${formatOffset(this.fixed, "narrow")}`;
+  }
+
+  /**
+   * The IANA name of this zone, i.e. `Etc/UTC` or `Etc/GMT+/-nn`
+   *
+   * @override
+   * @type {string}
+   */
+  get ianaName() {
+    if (this.fixed === 0) {
+      return "Etc/UTC";
+    } else {
+      return `Etc/GMT${formatOffset(-this.fixed, "narrow")}`;
+    }
+  }
+
+  /**
+   * Returns the offset's common name at the specified timestamp.
+   *
+   * For fixed offset zones this equals to the zone name.
+   * @override
+   */
+  offsetName() {
+    return this.name;
+  }
+
+  /**
+   * Returns the offset's value as a string
+   * @override
+   * @param {number} ts - Epoch milliseconds for which to get the offset
+   * @param {string} format - What style of offset to return.
+   *                          Accepts 'narrow', 'short', or 'techie'. Returning '+6', '+06:00', or '+0600' respectively
+   * @return {string}
+   */
+  formatOffset(ts, format) {
+    return formatOffset(this.fixed, format);
+  }
+
+  /**
+   * Returns whether the offset is known to be fixed for the whole year:
+   * Always returns true for all fixed offset zones.
+   * @override
+   * @type {boolean}
+   */
+  get isUniversal() {
+    return true;
+  }
+
+  /**
+   * Return the offset in minutes for this zone at the specified timestamp.
+   *
+   * For fixed offset zones, this is constant and does not depend on a timestamp.
+   * @override
+   * @return {number}
+   */
+  offset() {
+    return this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is equal to another zone (i.e. also fixed and same offset)
+   * @override
+   * @param {Zone} otherZone - the zone to compare
+   * @return {boolean}
+   */
+  equals(otherZone) {
+    return otherZone.type === "fixed" && otherZone.fixed === this.fixed;
+  }
+
+  /**
+   * Return whether this Zone is valid:
+   * All fixed offset zones are valid.
+   * @override
+   * @type {boolean}
+   */
+  get isValid() {
+    return true;
+  }
+}
diff --git a/node_modules/luxon/src/zones/invalidZone.js b/node_modules/luxon/src/zones/invalidZone.js
new file mode 100644
index 0000000..9a1a2d4
--- /dev/null
+++ b/node_modules/luxon/src/zones/invalidZone.js
@@ -0,0 +1,53 @@
+import Zone from "../zone.js";
+
+/**
+ * A zone that failed to parse. You should never need to instantiate this.
+ * @implements {Zone}
+ */
+export default class InvalidZone extends Zone {
+  constructor(zoneName) {
+    super();
+    /**  @private */
+    this.zoneName = zoneName;
+  }
+
+  /** @override **/
+  get type() {
+    return "invalid";
+  }
+
+  /** @override **/
+  get name() {
+    return this.zoneName;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName() {
+    return null;
+  }
+
+  /** @override **/
+  formatOffset() {
+    return "";
+  }
+
+  /** @override **/
+  offset() {
+    return NaN;
+  }
+
+  /** @override **/
+  equals() {
+    return false;
+  }
+
+  /** @override **/
+  get isValid() {
+    return false;
+  }
+}
diff --git a/node_modules/luxon/src/zones/systemZone.js b/node_modules/luxon/src/zones/systemZone.js
new file mode 100644
index 0000000..533e663
--- /dev/null
+++ b/node_modules/luxon/src/zones/systemZone.js
@@ -0,0 +1,61 @@
+import { formatOffset, parseZoneInfo } from "../impl/util.js";
+import Zone from "../zone.js";
+
+let singleton = null;
+
+/**
+ * Represents the local zone for this JavaScript environment.
+ * @implements {Zone}
+ */
+export default class SystemZone extends Zone {
+  /**
+   * Get a singleton instance of the local zone
+   * @return {SystemZone}
+   */
+  static get instance() {
+    if (singleton === null) {
+      singleton = new SystemZone();
+    }
+    return singleton;
+  }
+
+  /** @override **/
+  get type() {
+    return "system";
+  }
+
+  /** @override **/
+  get name() {
+    return new Intl.DateTimeFormat().resolvedOptions().timeZone;
+  }
+
+  /** @override **/
+  get isUniversal() {
+    return false;
+  }
+
+  /** @override **/
+  offsetName(ts, { format, locale }) {
+    return parseZoneInfo(ts, format, locale);
+  }
+
+  /** @override **/
+  formatOffset(ts, format) {
+    return formatOffset(this.offset(ts), format);
+  }
+
+  /** @override **/
+  offset(ts) {
+    return -new Date(ts).getTimezoneOffset();
+  }
+
+  /** @override **/
+  equals(otherZone) {
+    return otherZone.type === "system";
+  }
+
+  /** @override **/
+  get isValid() {
+    return true;
+  }
+}
diff --git a/node_modules/mathjs/CONTRIBUTING.md b/node_modules/mathjs/CONTRIBUTING.md
new file mode 100644
index 0000000..474a34f
--- /dev/null
+++ b/node_modules/mathjs/CONTRIBUTING.md
@@ -0,0 +1,24 @@
+## Contributing
+
+Contributions to the math.js library are very welcome! We can't do this alone. You can contribute in different ways: spread the word, report bugs, come up with ideas and suggestions, and contribute to the code.
+
+### What can I do?
+
+Search through the [issues](https://github.com/josdejong/mathjs/issues) looking for bugs that you can help fix, or look at [discussions/ideas](https://github.com/josdejong/mathjs/discussions/categories/ideas) to see if there is an idea for a new feature that that looks interesting to pick up.
+
+### There are a few preferences regarding code contributions:
+
+- The code of math.js follows the JavaScript Standard Style as described on https://standardjs.com/, powered by `eslint`. Run `npm run lint` to test, and `npm run format` to automatically adjust your code to the code style.
+- Make sure you properly unit test your changes.
+- Before creating a pull request, run the unit tests to make sure they all pass.
+- Only commit changes done in the source files under `src`, not to the generated builds
+  which are located in the folders `dist` and `lib`.
+- Send pull requests to the `develop` branch, not the `master` branch.
+
+### FAQ
+
+- How to implement a new function? Answer: See the section [Implementing a new function](README.md#implementing-a-new-function) in the README.md.
+- Where to find more documentation? Answer: best starting point is the project's [README.md](https://github.com/josdejong/mathjs#readme) file. 
+- I'm not sure how/where to start, what now? Answer: feel free to ask when in doubt, just [open an issue](https://github.com/josdejong/mathjs/issues) and discuss your thoughts and questions.
+
+Thanks!
diff --git a/node_modules/mathjs/HISTORY.md b/node_modules/mathjs/HISTORY.md
new file mode 100644
index 0000000..9cc24ed
--- /dev/null
+++ b/node_modules/mathjs/HISTORY.md
@@ -0,0 +1,3147 @@
+# History
+
+# 2025-10-10, 14.9.1
+
+- Fix: issue in HISTORY.md listing all fixes of `v14.8.2` under `v14.9.0`. 
+
+# 2025-10-10, 14.9.0
+
+- Feat: improve the performance of `map` with multiple arguments (#3526).
+  Thanks @dvd101x.
+- Fix: #3541 throw an error when evaluating a range with a step of zero 
+  (#3548). Thanks @dvd101x.
+
+# 2025-10-03, 14.8.2
+
+- Fix: improve performance in functions like `map` when passing a unary
+  function (#3546). Thanks @dvd101x.
+- Fix: improve the type definition of `abs(complex)` which returns a `number`
+  (#3543). Thanks @joshkel.
+- Fix: add missing type definitions for `ctranspose` (#3545). Thanks @joshkel.
+- Fix: typos in code comments (#3544). Thanks @joshkel.
+
+# 2025-09-26, 14.8.1
+
+- Fix: #3538 `config` printing a warning when using `{ number: 'bigint' }` 
+  (#3540).
+
+# 2025-09-24, 14.8.0
+
+- Feat: #3353 support for the nullish coalescing operator `??` in the
+  expression parser (#3497). Thanks @ikemHood.
+
+# 2025-09-05, 14.7.0
+
+- Feat: faster `DenseMatrix` symbol iterator (#3521). Thanks @dvd101x.
+- Feat: implement serialization support for `Parser`, fixing #3509 (#3525).
+- Fix: #3519, #3368 categories "Core functions" and "Construction functions"
+  missing from the generated function overview.
+- Fix: #3517 `printTransformDependencies` not exported in the type definitions.
+- Fix: add missing type definition for function `diff` (#3520). Thanks @dodokw.
+- Fix: #3396 improve documentation of function `range`.
+- Fix: #3523 cleanup old polyfills from the browser bundle 
+  by removing `core-js` (#3524).
+
+# 2025-07-25, 14.6.0
+
+- Feat: new function `toBest(unit, unitList, offset)`, and corresponding
+  method `unit.toBest(...)` (#3484). Thanks @Mundi93, @EliaAlesiani, and 
+  @HeavyRainLQ.
+- Fix: #3512 `sign` of zero not returning zero in case of a fraction (#3513). 
+  Thanks @kyle-compute.
+
+# 2025-07-02, 14.5.3
+
+- Fix: #2199 parse non-breaking white space `&nbsp;` as white space 
+  (#3487). Thanks donmccurdy.
+- Fix: refine the type definitions of `scope` (#3490). Thanks @JayChang4w.
+- Fix: #3493 type definitions of `unit(number)` (#3495). Thanks @mrft.
+- Fix: #3494 type definitions not supporting `unit.to(unit)` (#3495).
+  Thanks @mrft.
+- Fix: #3499 refine type definitions of `add` and `multiply` to not allow zero
+  or one argument (#3495). Thanks @mrft.
+
+# 2025-05-30, 14.5.2
+
+- Fix: add embedded docs for the deprecated physical constant `coulomb`, 
+  see #3472.
+- Fix: #3469 add `ResultSet` interface and improve `isResultSet` typing 
+  (#3481). Thanks @ranidam.
+
+# 2025-05-28, 14.5.1
+
+- Fix: #3482 mathjs throwing an error related to `BigInt`  when loading in
+  specific environments.
+- Fix: syntax section of function `numeric` (see #3448).
+- Fix: #3472 rename physical constant `coulomb` to `coulombConstant`. The old
+  name is still available for backward compatibility.
+- Fix: support multiplication of arrays with units (#3456). Thanks @Delaney.
+
+# 2025-05-21, 14.5.0
+
+- Feat: improve the performance of the `map` and `forEach` methods of 
+  `DenseMatrix` (#3446). Thanks @dvd101x.
+- Feat: improve the performance of `subset` (#3467). Thanks @dvd101x.
+- Feat: define embedded docs for `compile`, `evaluate`, `parse`, and `parser`,
+  and add tests for the examples in embedded docs (#3413). Thanks @dvd101x.
+- Fix: #3450 support multiplication of valueless units by arbitrary types
+  (#3454).
+- Fix: #3474 correctly parse `(lbf in)` (#3476). Thanks @costerwi.
+
+# 2025-03-28, 14.4.0
+
+- Feat: improve the performance of function `flatten` (#3400). Thanks @dvd101x.
+- Feat: improve the performance of `map` and `forEach` (#3409).
+  Thanks @dvd101x.
+- Feat: add LaTeX representation for fractions (#3434, #3419). Thanks @orelbn.
+- Fix: #3422 allow dot operators after symbol E (#3425).
+- Fix: issue in the `nthRoots` latex function template string (#3427).
+  Thanks @aitee.
+- Fix: upgrade to the latest version of `@babel/runtime`.
+
+# 2025-03-06, 14.3.1
+
+- Fix: #3350 cannot import a constant that is a complex number.
+
+# 2025-02-28, 14.3.0
+
+- Feat: improved performance of function `flatten` (#3354). Thanks @dvd101x.
+- Feat: improved performance of `DenseMatrix` Symbol.iterator (#3395). 
+  Thanks @dvd101x.
+- Feat: improved performance of functions `map` and `forEach` (#3399).
+  Thanks @dvd101x.
+- Fix: #3390 issue in callback optimization and add error handling for invalid
+  argument types (#3394). Thanks @dvd101x.
+- Fix: #3356 add missing eigsDependencies export to TypeScript definitions 
+  (#3397). Thanks @porst17.
+- Fix: #3406 infer the correct type for multi-dimensional arrays in function 
+  `multiply` (#3408). Thanks @orelbn.
+- Fix: #3387 use utility `math.isNaN` for consistent `max` and `min` results 
+  (#3389). Thanks @orelbn.
+
+# 2025-02-05, 14.2.1
+
+- Fix: #3377 remove redundant dependency `@lambdatest/node-tunnel`.
+
+# 2025-01-30, 14.2.0
+
+- Feat: #3041, #3340 rename `apply` to `mapSlices` (#3357). Function
+  `apply` is still available but is now marked deprecated. Thanks @gwhitney.
+- Fix: #3247 don't override type-native floor/ceil within tolerance of value 
+  (#3369). Thanks @gwhitney.
+- Fix: #3360 add bigint support to matrix indices and ranges (#3361).
+  Thanks @gwhitney.
+- Fix: #3115 type definitions for matrixFrom* (#3371). Thanks @Hudsxn 
+  and @gwhitney.
+
+# 2025-01-24, 14.1.0
+
+- Feat: implement `bigint` support in functions `log`, `log2`, `log10`, 
+  `larger`, `smaller`, `max`, `min` (#3345). Thanks @gwhitney.
+- Fix: #3342 hexadecimal input not turned into a `bigint` (#3348).
+- Fix `randomInt()` not working (#3345).
+- Docs: fixed description of `sign` in the embedded docs (#3338). 
+  Thanks @witer33.
+
+# 2024-12-11, 14.0.1
+
+- Fix: make derivative much faster (#3322). Thanks @paulftw.
+- Fix: #3317 export `Fraction` type from the `fraction.js` library instead of
+  using a custom interface (#3330). Thanks @fchu.
+
+# 2024-11-20, 14.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+- Feat: Upgrade to `fraction.js@5`, using `bigint` under the hood (#3283).
+- Feat: Implement support for `Unit` in functions `ceil`, `floor`, and `fix`.
+  Possible breaking changes in the type definitions of arrays and matrices
+  due to the introduction of generics (#3269). Thanks @orelbn.
+- Feat: Implement support for `log(x: Fraction, base: Fraction)`.
+- Fix: #3301 precedence of `%` (mod) being higher than `*` and `/` (#3311).
+  Thanks @nkumawat34.
+- Fix: #3222 prevent `math.import(...)` from overriding units unless you 
+  specify `{ override: true }` (#3225).
+- Fix: #3219 let functions `dotDivide`, `dotPow`, `bitXor`, `xor`, `equal`,
+  `larger`, `largerEq`, `smaller`, `smallerEq`, and `unequal` return a sparse 
+  matrix when the input is two sparse matrices (#3307). Thanks @Aakash-Rana.
+- Fix: Improve type definitions of arrays (#3306). Thanks @orelbn.
+
+# 2024-11-20, 13.2.3
+
+- Fix: #3260 improve type definitions and documentation on the callback 
+  indices of `map`, `filter`, and `forEach`.
+- Fix: #3323 support functions in function `clone`.
+- Docs: fix a broken link in the documentation (#3316). 
+  Thanks @emmanuel-ferdman.
+
+# 2024-11-13, 13.2.2
+
+- Fix: #1455 implicit multiplication of a fraction with unit `in` is incorrect 
+  (#3315). Thanks @nkumawat34.
+
+# 2024-11-06, 13.2.1
+
+- Update to the latest version of `complex.js`.
+- Fix `Index.dimension(dim)` accepting non-numeric input.
+- Fix: #3290 should validate variables names in method `Parser.set` (#3308).
+  Thanks @nkumawat34.
+
+# 2024-10-02, 13.2.0
+
+- Feat: improve performance of functions `map`, `filter` and `forEach` (#3256).
+  Thanks @dvd101x.
+- Feat: improve performance of the methods `map()` and `forEach()`
+  of `DenseMatrix` (#3251). Thanks @Galm007.
+- Fix: #3253 cannot use identifiers containing special characters in function
+  `derivative`.
+- Fix: improve the type definitions of `ConstantNode` to support all data 
+  types (#3257). Thanks @smith120bh.
+- Fix: #3259 function `symbolicEqual` missing in the TypeScript definitions.
+- Fix: #3246 function `leafCount` missing in the TypeScript definitions.
+- Fix: #3267 implicit multiplication with a negative number and unit `in`.
+- Docs: fix broken links on the Configuration page. Thanks @vassudanagunta.
+- Docs: document the syntax of `map` and `forEach` in the expression parser
+  (#3272). Thanks @dvd101x.
+
+# 2024-08-27, 13.1.1
+
+- Fix security vulnerability in the CLI and web API allowing to call functions
+  `import`, `createUnit` and `reviver`, allowing to get access to the internal
+  math namespace and allowing arbitrary code execution. Thanks @StarlightPWN.
+- Fix security vulnerability: when overwriting a `rawArgs` function with a 
+  non-`rawArgs` function, it was still called with raw arguments. This was both
+  a functional issue and a security issue. Thanks @StarlightPWN.
+- Fix security vulnerability: ensure that `ObjectWrappingMap` cannot delete
+  unsafe properties. Thanks @StarlightPWN.
+- Fix: not being able to use methods and properties on arrays inside the
+  expression parser.
+
+# 2024-08-26, 13.1.0
+
+- Feat: support multiple inputs in function `map` (#3228, #3196). 
+  Thanks @dvd101x.
+- Feat: add matrix datatypes in more cases (#3235). Thanks @dvd101x.
+- Feat: export util functions `isMap`, `isPartitionedMap`, and 
+  `isObjectWrappingMap`.
+- Fix: #3241 function `map` not always working with matrices (#3242). 
+  Thanks @dvd101x.
+- Fix: #3244 fix broken link to `ResultSet` in the docs about classes.
+- Docs: add a link to the documentation page about the syntax expression
+  from the function `evaluate` (see #3238).
+- Docs: improve the documentation of `scope` and fix the example
+  `custom_scope_objects.js` (#3150)
+- Docs: spelling fixes in the embedded docs (#3252). Thanks @dvd101x.
+
+# 2024-07-19, 13.0.3
+
+- Fix: #3232 fix type definitions of function `format` to support notations
+  `hex`, `bin`, and `oct`.
+- Fix: use more precise definitions for US liquid volume units (#3229).
+  Thanks @Vistinum.
+- Fix: #2286 types static methods and members for Unit class (#3230).
+  Thanks @orelbn.
+
+# 2024-07-04, 13.0.2
+
+- Fix an error in the type definitions of `quantileSeq` (#3223).
+  Thanks @domdomegg.
+
+# 2024-06-28, 13.0.1
+
+- Fix: #3227 generated bundle containing `catch` blocks without parameters.
+- Fix: #2348 update type definitions of the `Parser` methods (#3226).
+  Thanks @orelbn.
+
+# 2024-05-31, 13.0.0
+
+Breaking changes:
+
+- Change `isZero`, `isPositive`, and `isNegative` to respect `config.epsilon`
+  (#3139, #2838). Thanks @dvd101x.
+- Change the behavior of the internal `nearlyEqual` to align with Python and
+  Julia (#3152, #2838). Thanks @dvd101x.
+- Upgrade to `fraction.js@4.3.7`,
+  see <https://github.com/rawify/Fraction.js/issues/68>.
+- Dropped support for JavaScript engines that do not fully support ES6 or
+  `bigint`, or are not actively maintained. ES2020 is now the minimum required
+  EcmaScript version.
+
+Non-breaking changes:
+
+- Implemented support for `bigint` (#3207, #3207)
+- Implemented a new config option `config.numberFallback` needed for `bigint`
+  (#3207).
+- Internal: refactored tooling to ES modules and upgraded all devDependencies.
+
+# 2024-05-31, 12.4.3
+
+- Fix: serialization of Units without a value, see #1240.
+- Fix: outdated, incorrect documentation about the order of precedence for
+  operator modulus `%`. See #3189.
+- Fix: #3197 improve `quantileSeq` type definitions (#3198). Thanks @domdomegg.
+
+# 2024-04-24, 12.4.2
+
+- Fix #3192: function `isNaN` returns `false` for `NaN` units in a matrix or
+  array (#3193). Thanks @lgerin.
+- Fix: #3180 fix type definitions of functions `add` and `multiply` to allow
+  more than two arguments.
+- Docs: correct the docs about `traverse` returning void (#3177).
+  Thanks @rohildshah.
+
+# 2024-03-13, 12.4.1
+
+- Docs: implement an interactive version of the Lorenz example, and show the
+  chart full screen (#3151). Thanks @dvd101x.
+- Fix #3172: simplify `"true and true"`.
+- Fix #3163: `toTex` wrongly returning `Infinity` for large BigNumbers.
+- Fix #3162: add license information about CSParse (#3164).
+- Fix #3175: cannot delete units using `math.Unit.deleteUnit`.
+- Fix: faster startup time of the CLI and REPL by loading the bundle.
+- Fix: remove using polyfill.io inside the example
+  `pretty_printing_with_mathjax.html` (#3167). Thanks @SukkaW.
+
+# 2024-02-22, 12.4.0
+
+- Feat: implement support for trailing commas in matrices (#3154, #2968).
+  Thanks @dvd101x.
+- Feat: improve the performance of `multiply` a lot by adding matrix type
+  inferencing (#3149). Thanks @RandomGamingDev.
+- Fix: #3100 function `round` not handling round-off errors (#3136).
+  Thanks @BrianFugate.
+- Fix: `PartitionedMap` and `ObjectWrappingMap` missing a property
+  `Symbol.iterator`, causing problems when trying `new Map(scope)` (#3156).
+- Fix: type definitions of function `mode` (#3153). Thanks @rich-martinez.
+- Docs: describe method `getAllAsMap` in the Parser docs (#3158, #3157).
+  Thanks @dvd101x.
+
+# 2024-02-08, 12.3.2
+
+- Improved the performance of custom defined functions in the expression
+  parser (#3150).
+- Fix: #3143 cannot use `and` and `or` inside a function definition.
+  Regression since `v12.1.0` (#3150).
+
+# 2024-02-01, 12.3.1
+
+- Improved the typings of the arguments of `ArrayNode`, `FunctionNode`,
+  `IndexNode`, `OperatorNode`, and `RelationalNode` (#3123). Thanks @sylee957.
+- Added a fully featured code editor example with CodeMirror and Katex (#3027).
+  Thanks @dvd101x.
+- Fix: #3114 build warnings related to a number of wrong `/* #__PURE__ */`
+  annotations.
+- Fix: #3142 support BigNumber values for the options of function `format`:
+  `precision`, `wordSize`, `lowerExp`, `upperExp`. Support BigNumber values
+  for the option `wordSize` in the functions `hex`, `bin`, and `oct`.
+- Fix: #3125 type definitions of function `hypot` (#3144).
+  Thanks @silentmissile.
+- Fix: #3141 `help(config)` altering the actual `config` when evaluating the
+  examples.
+- Docs: #3145 fix documentation about REPL, it does require a build step
+  nowadays.
+
+# 2024-01-12, 12.3.0
+
+- Implement support new metric prefixes: `ronna` (`R`), `quetta` (`Q`),
+  `ronto` (`r`), and `quecto` (`q`) (#3113, #3112). Thanks @AlexEdgcomb.
+- Fix a bug converting a unitless unit (#3117). Thanks @costerwi.
+- Fix: #3097 `toSI()` wrongly converting `degC` (#3118). Thanks @costerwi.
+
+# 2023-12-20, 12.2.1
+
+- Fix #3109: method `Node.toHTML` not accepting a custom `handler`.
+
+# 2023-12-08, 12.2.0
+
+- Feat: lazy evaluation of operators `and`, `or`, `&`, `|` (#3090, #3101,
+  #2766). Thanks @smith120bh.
+- Fix: passing a 4th argument with a scope to raw functions.
+- Fix: #3096 embedded docs of eigs throwing an error.
+
+# 2023-11-17, 12.1.0
+
+- Feat: Extend function `round` with support for units (#2761, #3095).
+- Feat: Extend function `mod` with support for negative divisors in when
+  using `BigNumber` or `Fraction` (#3087).
+- Fix: #3092 a typo in an error message when converting a string into a number.
+- Fix: #3094 function `derivative` mutates the input expression when it fails.
+
+# 2023-10-26, 12.0.0
+
+Breaking changes:
+
+- Fix #2879, #2927, #3014: change the confusing interface of `eigs` (#3037),
+  thanks @gwhitney.
+  Before, functions `eigs` returned an object:
+
+  ```
+  { values: MathCollection; vectors: MathCollection }
+  ```
+
+  where `vectors` was a 2d matrix of which the columns contained the vectors.
+  This is changed to `eigs` returning an object:
+
+  ```
+  { 
+    values: MathCollection
+    eigenvectors: Array<{
+      value: number | BigNumber
+      vector: MathCollection
+    }>
+  }
+  ```
+
+  Where `eigenvectors` is an array containing an object with the corresponding
+  eigenvalue and vector.
+- Refactored the TypeScript type definitions to make them work with a `NodeNext`
+  module resolution (#3079, #2919).
+  - Type `MathJsStatic` is renamed to `MathJsInstance`.
+  - Type `FactoryDependencies` is deprecated, use `MathJsFactory` instead, and
+    import dependency maps directly from the library.
+- Change the assignment operator of `.toTex()` output from `:=` to `=` (see
+  #2980, #2987).
+- Drop official support for Node.js 14 and 16.
+
+Features:
+
+- Function `eigs` now has an option to turn off calculation of eigenvectors
+  (#3057, #2180). Thanks @gwhitney.
+
+Fixes:
+
+- Find eigenvectors of defective matrices (#3037). Thanks @gwhitney.
+
+# 2023-10-26, 11.12.0
+
+- Implemented function `subtractScalar` (#3081, #2643), thanks @vrushaket.
+- Fix #3073: function format not escaping control characters and double
+  quotes (#3082).
+- Fix: function `clone` not throwing an error when passing an unsupported
+  type like a function.
+- Fix: #2960 add type definition of function `symbolicEqual` (#3035),
+  thanks @juancodeaudio.
+
+# 2023-10-11, 11.11.2
+
+- Fix #3025: improve handling of matrices and error handling
+  in function `corr` (#3030). Thanks @vrushaket.
+- Fix #3074: improve error message when using function `max` in `derivative`.
+- Fix #3073: fix parsing quotes inside a string.
+- Fix #2027: cannot use named operators like `to` or `mod` as property name.
+
+# 2023-09-20, 11.11.1
+
+- Fix #2989: use one-based indices in `print` in the parser (#3009).
+  Thanks @dvd101x.
+- Fix #2936: `mod` sometimes giving wrong results due to internal round-off
+  errors (#3011). Thanks @praisennamonu1.
+- Internal refactor of `quantileSeq`, and fixed the embedded help (#3003).
+  Thanks @dvd101x.
+- Updated dependencies and devDependencies.
+
+# 2023-09-05, 11.11.0
+
+- Implement function `corr` to calculate the correlation between two matrices
+  (#3015, #2624). Thanks @vrushaket.
+- Lock `fraction.js` at version `4.3.4` for now, see #3024, 3022,
+  <https://github.com/rawify/Fraction.js/issues/68>.
+
+# 2023-08-31, 11.10.1
+
+- Upgrade to `fraction.js@4.3.4`, see #3022.
+- Fix #3020: `lruQueue` using the global `hasOwnProperty` which may be
+  polluted.
+- Add support for prefixes for the unit `erg`, and restrict prefixes of the
+  unit `joule` to only long prefixes like `kilo` and no short prefixes
+  like `k` (#3019). Thanks @costerwi.
+- Add a new browser example `examples/browser/lorenz.html` that uses `solveODE`
+  and plots the result in a chart (#3018). Thanks @dvd101x.
+
+# 2023-08-23, 11.10.0
+
+- Extend function `quantileSeq` with support for a `dimension` (#3002).
+  Thanks @dvd101x.
+- Implement #2735: Support indexing with an array of booleans, for
+  example `a[[true, false, true]]` and `a[a > 2]` (#2994). Thanks @dvd101x.
+- Implement function `zeta` (#2950, #2975, #2904). Thanks @Bobingstern.
+- Fix #2990: `DenseMatrix` can mutate input arrays (#2991).
+
+# 2023-07-24, 11.9.1
+
+- Fix a security vulnerability in `FunctionNode` and `SymbolNode` allowing
+  arbitrary code execution via `math.evaluate`. Thanks Harry Chen.
+- Fix #3001: mathjs bundle containing `new Function(...)` (CSP issue).
+
+# 2023-07-19, 11.9.0
+
+- Implement function `solveODE` (#2958). Thanks @dvd101x.
+- Implement functions `zpk2tf` and `freqz` (#2988, #2969). Thanks @alykhaled.
+- Implement support for units in function `range` (#2997). Thanks @dvd101x.
+- Fix #2974: `simplify` puts plus and minus signs next to each other (#2981).
+  Thanks @MaybePixem.
+- Fix #2973: fixes and improvements in the embedded docs (#2976).
+  Thanks @dvd101x.
+- Fix #2996: two errors in the examples in the documentation about Expression
+  trees.
+- Fix round-off errors near zero when converting temperatures (#2962).
+  Thanks @costerwi.
+- Refactored function `range`, reducing the amount of code (#2995).
+  Thanks @dvd101x.
+
+# 2023-06-20, 11.8.2
+
+- Fix #2971: improve typings of statistics functions `min`, `max`, `mean`,
+  `median`, `mode`, `std`, `sum`, `prod`, `variance`. Fixes a regression
+  introduced in v11.8.1.
+- Fix #2972: type definitions of `Unit.divide(Unit)` have a wrong return type.
+
+# 2023-06-13, 11.8.1
+
+- Fix #2964: issue in function `distance` when calculate the distance from
+  a point to a line (#2965). Thanks @Kiku-CN.
+- Fix `math.format` not working correctly for `engineering` notation when using
+  BigNumbers and for `fixed` notation with `precision: 0` configured (#2956).
+  Thanks @mgreminger.
+- Fix #2880: not possible to map cube root `cbrt`.
+- Fix #2938: make the syntax description of all functions consistent in the
+  docs (#2941). Thanks @dvd101x.
+- Fix #2954: improve the TypeScript definitions the return type of functions
+  `min` and `max` (#2955). Thanks @Maxim-Mazurok.
+- Fix #2959: typo in an example in the docs. Thanks @kunalagrwl.
+- Drop official support for Node.js 14, has reached end of life.
+
+# 2023-04-03, 11.8.0
+
+- Extended functions `fraction`, `bignumber`, and `number` with support for
+  units, see #2918 (#2926).
+- Implemented aliases `amp` and `amps` for unit `ampere` (#2917).
+  Thanks @veggiesaurus.
+- Improve TypeScript definitions of function `gcd` (#2922). Thanks @brunoSnoww.
+- Fix #2923: improve docs of the function `distance` (#2924). Thanks @tmtron.
+
+# 2023-03-15, 11.7.0
+
+- Implement #2567: accept array as parameter for function `gcd` (#2878).
+  Thanks @jakubriegel.
+- Fix #2908: improvements in the docs and examples of functions
+  `partitionSelect`, `diff`, `expm1`, `round`, `nthRoots`, `sign`,
+  `rigthArithShift`, `setIsSubset`, `setSize`, and the docs about units.
+  Thanks @tmtron.
+- Fix #2907: determinant of empty matrix should be 1.
+- Refactor index.d.ts by writing function declarations using a generic,
+  reducing a lot of repetition (#2913). Thanks @brunoSnoww.
+
+# 2023-02-24, 11.6.0
+
+- Implement broadcasting for the following functions and their corresponding
+  operator: `add`, `dotDivide`, `dotMultiply`, `dotPow`, `gcd`, `lcm`, `mod`,
+  `nthRoot`, `subtract`, `bitAnd`, `bitOr`, `bitXor`, `leftShift`,
+  `rightArithShift`, `rightLogShift`, `and`, `or`, `xor`, `compare`,
+  `compareText`, `equal`, `larger`, `largerEq`, `smaller`, `smallerEq`,
+  `unequal`, `atan2` and `to` (#2895, #2753). Thanks @dvd101x.
+- Implement support for non-power-of-2 fft (#2900, #2577). Thanks @cyavictor88.
+- Fix #2888: update type definitions of function `unit` to allow creating a
+  unit from a fraction or complex number.
+- Fix #2892: an error in the examples of the embedded help of function `sort`.
+- Fix #2891: functions `column` and `row` sometimes returning a scalar number.
+- Fix #2896: define the fourth argument of function `intersect` as optional
+  in the TypeScript definitions. Thanks @wodndb.
+- Fix: quantileSeq not accepting a matrix as second argument `prob` (see #2902).
+- Fix broken examples in functions `to`, `distance`, `getMatrixDataType`,
+  `subset`, and `max` (see #2902).
+
+# 2023-01-31, 11.5.1
+
+- Add type definitions for function `rotationMatrix` (#2860).
+  Thanks @brunoSnoww.
+- Add type signature for `lusolve(LUDecomposition, ...)` (#2864).
+  Thanks @evanmiller.
+- Fix #2873: the rocket_trajectory_optimization.html example being partly
+  broken. Thanks @dvd101x.
+- Fix #2871: coverage report broken (#2877). Thanks @bornova.
+- Fix #2883: update documentation for stat functions, describe missing syntax.
+- Fix #2884: fix examples in the embedded docs of function `pow` and some other
+  functions.
+- Fix type definition of function `complex` for one numeric input (#2886),
+  thanks @ariymarkowitz.
+- Fix type definitions of `map()` and `forEach()` (#2887), thanks @xiaohk.
+- Fix #2606: improve type definitions of `dotMultiply`, `dotPow` and
+  `dotDivide` (#2890). Thanks @brunoSnoww.
+
+# 2022-12-05, 11.5.0
+
+- Improve `simplify` rule matches in non-commutative contexts (#2841).
+  Thanks @samueltlg.
+- Simplify: add rules and restructure tests for non-commutative contexts
+  (#2847). Thanks @samueltlg.
+- Fix function `reshape` mutating the input in case of a matrix (see #2854).
+- Fix TypeScript types for `multiply()` with `number[]` and `number[][]`
+  (#2852). Thanks @hfhchan.
+
+# 2022-11-18, 11.4.0
+
+- Implemented more wildcards to describe rules for `simplify`, making it easier
+  for example to describe unary minus (#1915). Thanks @thatcomputerguy0101.
+- Implemented functions `schur`, `sylvester`, and `lyap` (#2646).
+  Thanks @egidioln.
+- Implemented function `polynomialRoot`, and use it in a benchmark (#2839).
+  Thanks @gwhitney.
+- Fix #2825 partly: improve simplifying operations on constants in
+  non-commutative contexts (#2827). Thanks @samueltlg.
+- Fix #2840: a bug in the docs and type definitions of `Node.traverse` and
+  `Node.forEach`, they do return `void`.
+
+# 2022-11-07, 11.3.3
+
+- Fix #2830: Prevent inserting zero values when creating a `SparseMatrix` from a
+  `DenseMatrix` (#2836). Thanks @AlexandreAlvesDB.
+- Fix #2835: a regression in the type definitions of `FunctionNode`, introduced
+  in `v11.3.2`. See #2733. Thanks @dsteve.
+
+# 2022-10-25, 11.3.2
+
+- Add generics to remaining Node type definitions (#2733). Thanks @mattvague.
+- Allow unit prefixes for (absolute) temperatures `kelvin`, `rankine`,
+  `celsius`, and `fahrenheit` (#2824). Thanks @jfeist
+
+# 2022-10-19, 11.3.1
+
+- Fix #2809: code completion issues in some IDE's (#2812).
+- Fix #2818: throw an error when a function assignment has duplicate
+  parameter names (#2819).
+- Update `decimal.js` to version `10.4.2`.
+
+# 2022-10-11, 11.3.0
+
+- Allow creating new subclasses of `Node` in TypeScript (#2772).
+  Note that this disables being able to narrow MathNodes by using the `.type`
+  property. Use typeguards like `isOperatorNode(...)` instead (see #2810).
+  Thanks @mattvague.
+- Fix #2793: `flatten()` cloning entries of array/Matrix (#2799).
+- Fix #2627: TypeScript definitions of `pinv` missing (#2804).
+  Thanks @HanchaiN.
+- Update dependencies to `decimal.js@10.4.1`.
+
+# 2022-09-13, 11.2.1
+
+- Fix doc generator being broken, not generating a function reference.
+
+# 2022-09-12, 11.2.0
+
+- Implement function `isRelationalNode` (#2731). Thanks @isaacbyr.
+- Added missing types `'largerEq'` and `'or'` in `OperatorNodeMap` in the
+  TypeScript definitions. Thanks @ajinkyac03.
+- Fixed typos in min func type defs (#2768). Thanks @mabdullahadeel.
+- Improved the TypeScript definitions for `pickRandom`. Thanks @mattvague.
+- Fixed documentation of unit `min` which means `minutes`, not `minim` (#2773).
+  Thanks @jasonhornsby.
+
+# 2022-08-23, 11.1.0
+
+- Add Unit constructor from value and pure (valueless) Unit (#2628).
+  Thanks @costerwi
+- Fix #2144: `examples/advanced/custom_loading.js` was broken.
+- Fix JSON `replacer` function missing in the TypeScript definitions.
+  Thanks @mattvague.
+- Update dependencies to `typed-function@4.1.0` and `decimal.js@10.4.0`.
+
+# 2022-07-25, version 11.0.1
+
+- Fix #2632: TypeScript issue of `simplifyConstant` and `simplifyCore`
+  not having a return type defined.
+
+# 2022-07-23, version 11.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+Breaking changes:
+
+- Dropped official support for IE11.
+- Upgraded to `typed-function@3`, see [josdejong/typed-function/HISTORY.md](https://github.com/josdejong/typed-function/blob/develop/HISTORY.md#2022-05-12-version-300). Thanks @gwhitney. Most importantly:
+  - Conversions now have preference over `any`.
+  - The `this` variable is no longer bound to the typed function itself.
+  - The properties `typed.types`, `typed.conversions`, and `typed.ignore`
+      have been removed.
+  - There are new static functions available like `typed.referTo`,
+      `typed.referToSelf`, `typed.addTypes`, `typed.addConversions`.
+- Implement amended "Rule 2" for implicit multiplication (#2370, #2460):
+  when having a division followed by an implicit multiplication, the division
+  gets higher precedence over the implicit multiplication when (a) the
+  numerator is a constant with optionally a prefix operator (`-`, `+`, `~`),
+  and (b) the denominator is a constant. For example: formerly `-1 / 2 x` was
+  interpreted as `-1 / (2 * x)` and now it is interpreted as `(-1 / 2) * x`.
+  Thanks @gwhitney.
+- Drop elementwise matrix support for trigonometric functions, exp, log, gamma,
+  square, sqrt, cube, and cbrt to prevent confusion with standard matrix
+  functions (#2440, #2465). Instead, use `math.map(matrix, fn)`.
+  Thanks @gwhitney.
+- Simplify: convert equivalent function calls into operators, for example,
+  `add(2, x)` will now be simplified into `2 + x` (#2415, #2466).
+  Thanks @gwhitney.
+- Removed the automatic conversion from `number` to `string` (#2482).
+  Thanks @gwhitney.
+- Fix #2412: let function `diff` return an empty matrix when the input contains
+  only one element (#2422).
+- Internal refactoring in the `simplifyCore` logic (#2490, #2484, #2459).
+  The function `simplifyCore` will no longer (partially) merge constants, that
+  behavior has been moved to `simplifyConstant`. The combination of
+  `simplifyConstant` and `simplifyCore` is still close to the old behavior
+  of `simplifyCore`, but there are some differences. To reproduce the same
+  behavior as the old `simplifyCore`, you can use
+  `math.simplify(expr, [math.simplifyCore, math.simplifyConstant])`.
+  Thanks to the refactoring, `simplify` is more thorough in reducing constants.
+  Thanks @gwhitney.
+- Disable support for splitting rest parameters in chained calculations
+  (#2485, #2474). For example: `math.chain(3).max(4, 2).done()` will now throw
+  an error rather than return `4`, because the rest parameter of
+  `math.max(...number)` has been split between the contents of the chain and
+  the arguments to the max call. Thanks @gwhitney.
+- Function `typeOf` now returns `function` (lowercase) for a function instead
+  of `Function` (#2560). Thanks @gwhitney.
+
+Non-breaking changes:
+
+- Fix #2600: improve the TypeScript definitions of `simplify`.
+  Thanks @laureen-m and @mattvague.
+- Fix #2607: improve type definition of `createUnit`. Thanks @egziko.
+- Fix #2608: clarify the docs on the need to configure a smaller `epsilon`
+  when using BigNumbers.
+- Fix #2613: describe matrix methods `get` and `set` in the docs.
+- Fix link to `math.rationalize` in the docs (#2616). Thanks @nukisman.
+- Fix #2621: add TypeScript definitions for `count` (#2622). Thanks @Hansuku.
+- Improved TypeScript definitions of `multiply` (#2623). Thanks @Windrill.
+
+# 2022-06-28, version 10.6.4
+
+- Improve TypeScript definitions of the `factory` function, thanks @mattvague.
+
+# 2022-06-24, version 10.6.3
+
+- Revert the TypeScript definition fixes for `factory` applied in `v10.6.2`,
+  they give some complications.
+
+# 2022-06-24, version 10.6.2
+
+- Improve TypeScript definitions of `ParenthesisNode`. Thanks @mattvague.
+- Change the TypeScript definition of `MathNodeCommon['type']` into a less
+  strict string, so it is possible to extend with new Node classes.
+  Thanks @mattvague.
+- Improve TypeScript definitions of the `factory` function, thanks @mattvague.
+
+# 2022-05-31, version 10.6.1
+
+- Improve the  TypeScript types For `OperatorNode`: you can now define generic
+  types like `OperatorNode<'+', 'add'>`. Thanks @mattvague.
+
+# 2022-05-24, version 10.6.0
+
+- Implementation of Fourier transform functions `fft` and `ifft` (#2540).
+  Thanks @HanchaiN.
+- Fix TypeScript types not being listed in the exported fields (#2569).
+  Thanks @mattvague.
+- Large improvements in TypeScript definitions for chained expressions (#2537).
+  Thanks @mattvague.
+- Fix #2571: improve TypeScript definition of functions `clone` and `cloneDeep`
+  (#2572). Thanks @mattvague.
+- Fix the first argument of `derivative` holding the expression not correctly
+  being converted when using `.toTex()` (#2564). Thanks @mattvague.
+
+# 2022-05-11, version 10.5.3
+
+- Fix #2337: npm package containing examples and docs to solve security
+  vulnerabilities being reported on the examples and their dependencies.
+- Fix core, construction, and some other functions missing in docs.
+- Drop official support for Node.js 12 which has reached its end of life.
+
+# 2022-05-09, version 10.5.2
+
+- Fix #2553: `@types/mocha` defined in `dependencies` instead of
+  `devDependencies`, causing problems in projects that use a different version
+  of this dependency. Thanks @Kolahzary.
+- Fix #2550: remove `examples/node_modules` folder from the npm package.
+- Fix #2528: improve contribution guidelines (#2548).
+- Document `SymbolNode.onUndefinedSymbol` and
+  `FunctionNode.onUndefinedFunction`.
+
+# 2022-05-02, version 10.5.1
+
+- Fix #2526, #2529: improve TypeScript definitions of function `round`, `fix`,
+  `floor`, `ceil`, and `nthRoot`, and improved the number only implementations
+  of those functions  (#2531, #2539). Thanks @simlaticak and @gwhitney.
+- Fix #2532: matrix index symbol `end` not working when used inside
+  a sub-expression.
+- Fix #2524: In generating AUTHORS list, ignore a list of specific commits
+  (e.g., to avoid spurious duplicates in list). (#2543)
+- Add type definitions of function `resolve` (#2536). Thanks @mattvague.
+
+# 2022-04-19, version 10.5.0
+
+- Implement #1563: function `pinv`, Moore–Penrose inverse (#2521).
+  Thanks @HanchaiN.
+- Optimize function `det` for integers by switching to the Bareiss algorithm:
+  no more round-off errors for integer input (#2516). Thanks @HanchaiN.
+- Implement #2463: allow negative integer powers of invertible square matrices
+  (#2517). Thanks @HanchaiN.
+- Implement the `lgamma` function (defined as log(gamma(z))) for number and
+  Complex types. Supersedes #320. (#2417). Thanks @yifanwww.
+- Fix #2523: update to the latest complex.js to improve `sin(z)` for small
+  `im(z)` (#2525). Thanks @gwhitney.
+- Fix #2526: update TypeScript definition of `ceil` (#2531). Thanks @simlaticak
+- Change mocha reporter to 'dot' to avoid excessively long log files. (#2520)
+
+# 2022-04-08, version 10.4.3
+
+- Fix #2508: improve the precision of stirlingS2 (#2509). Thanks @gwhitney.
+- Fix #2514: implement optional argument `base` in the number implementation
+  of function `log` (#2515). Thanks @gwhitney.
+- Improve the documentation on operator `;` (#2512). Thanks @gwhitney.
+
+# 2022-03-29, version 10.4.2
+
+- Fix #2499: different behavior for unit conversion "degC" and "K" (#2501).
+  Also disables getting the sign for units with an offset, which is ambiguous.
+  Thanks @gwhitney.
+- Fix #2503: fix an issue in `log()` for complex numbers in which the imaginary
+  part is much larger in absolute value than the real part, fixed in
+  `complex.js@2.1.0` (#2505), thanks @gwhitney, @infusion.
+- Fix #2493: unclear error message when an entity that is not a function
+  is being called as a function (#2494). Thanks @gwhitney.
+- Some fixes in the docs on units (#2498). Thanks @dvd101x.
+- Add `forEach` example in embedded docs (#2507). Thanks @dvd101x.
+- Correct approx.deepEqual() to accept an epsilon argument giving the
+  comparison tolerance. It was already being called this way, but was
+  silently ignoring the tolerance. Thanks @yifanwww.
+
+# 2022-03-23, version 10.4.1
+
+- Improve TypeScript definitions for function `unit` (#2479).
+  Thanks @SinanAkkoyun.
+- Add tests for type declarations (#2448). Thanks @samestep.
+- Further improvement to TypeScript definitions of `std` and `variance`
+  (make dimension parameter optional, #2474). Thanks @NattapongSiri.
+- Next step (as per #2431) for full publication of "is" functions like
+  `isMatrix` etc: Provide TypeScript definitions of "is" functions and
+  make them type guards. (#2432). Thanks @ChristopherChudzicki.
+- Fix #2491: Multi line object expressions don't work with comments (#2492).
+  Thanks @gwhitney.
+- Fix #2478: a bug in calculating the eigenvectors when dealing with complex
+  numbers (#2496). Thanks @gwhitney.
+- Update project dependencies and devDependencies.
+
+# 2022-03-07, version 10.4.0
+
+- Fix #2461: make sure `simplifyCore` recurses over all binary nodes (#2462).
+  Thanks @gwhitney.
+- Fix #2429: fix the TypeScript definitions of functions `std` and `variance`
+  (#2455). Thanks @NattapongSiri.
+- Fix #1633: implement a `cumsum` function generating cumulative sums of a list
+  of values or a matrix. (#1870). Thanks @hjonasson.
+- Upgrade to the latest version of `Fraction.js`, having more strict input,
+  only accepting an integer numerator and denominator. See #2427.
+- Fix typo in documentation example for `format`. (#2468) Thanks @abranhe.
+- Write unit tests for all jsdoc examples. See #2452. Thanks @gwhitney.
+
+# 2021-03-02, version 10.3.0
+
+- Fix #1260: implement function `symbolicEqual` (#2424). Thanks @gwhitney.
+- Fix #2441, #2442: support passing a function as argument to functions created
+  in the expression parser (#2443). Thanks @gwhitney.
+- Fix #2325: improve documentation of subset indices (#2446). Thanks @gwhitney.
+- Fix #2439: fix a bug in `complexEigs` in which real-valued norms were
+  inadvertently being typed as complex numbers (#2445). Thanks @gwhitney.
+- Fix #2436: improve documentation and error message of function `map` (#2457).
+  Thanks @gwhitney.
+
+# 2022-03-01, version 10.2.0
+
+- Implemented context options to control simplifications allowed in `simplify`,
+  see #2399, #2391. Thanks @gwhitney.
+- Implemented function `leafCount` as a first simple measure of the complexity
+  of an expression, see #2411, #2389. Thanks @gwhitney.
+- Fix #2413: improve `combinations` to return an integer result without rounding
+  errors for larger values, see #2414. Thanks @gwhitney.
+- Fix #2385: function `rotate` missing in TypeScript definitions.
+  Thanks @DIVYA-19.
+- Fix #2450: Add BigNumber to parameter type in `math.unit` and add TypeScript
+  types for `Unit.simplify` and `Unit.units` (#2353). Thanks @joshhansen.
+- Fix #2383: detect infinite loops in `simplify` (#2405). Thanks @gwhitney.
+- Fix #1423: collect like factors and cancel like terms in sums (#2388).
+  Thanks @gwhitney.
+
+# 2022-02-02, version 10.1.1
+
+- Improvements and fixes in function `simplify`, thanks @gwhitney:
+  - Fix #2393: regression bug in `simplify('2-(x+1)')`.
+  - Ad option `consoleDebug` to `simplify` to see what is going on.
+- Fix TypeScript definition of `ConfigOptions`, which was missing option
+  `predictable`.
+
+# 2022-01-15, version 10.1.0
+
+- Implemented function `invmod`, see #2368, #1744. Thanks @thetazero.
+- Improvements and fixes in function `simplify`, thanks @gwhitney:
+  - Fix #1179, #1290: improve collection of non-constant like terms (#2384).
+  - Fix #2152: do not transform strings into numbers (#2372).
+  - Fix #1913: implement support for array and object simplification (#2382).
+- Fix #2379: add embedded documentation for function `print`.
+- Remove broken example from the embedded documentation of function `forEach`.
+
+# 2021-12-29, version 10.0.2
+
+- Fix #2156: simplify expressions like `-1 / (-x)` to `1/x`. Thanks @ony3000.
+- Fix #2363: remove a redundant part of the regex to split a number.
+- Fix #2291: add support for fractions in function `intersect`.
+  Thanks @thetazero.
+- Fix #2358: bug in `SparseMatrix` when replacing a subset of a matrix with
+  a non-consecutive index. Thanks @Al-0.
+
+# 2021-12-22, version 10.0.1
+
+- Fix #1681: function `gamma` giving inaccurate complex results in some cases.
+  Thanks @kmdrGroch.
+- Fixed a typo in an example, see #2366. Thanks @blackwindforce.
+
+# 2021-11-03, version 10.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES IN THE TYPESCRIPT DEFINITIONS !!!
+
+- Improvements to the Typescript typings (commit fc5c202e).
+  Thanks @joshhansen. First introduced in v9.5.1, but reverted because
+  it contains breaking changes.
+  
+  Breaking changes: interface `MathNode` is now renamed to `MathNodeCommon`
+  and the related interfaces are structured in a different way.
+
+- Fixed a typo in the TypeScript definition of toHTML. Thanks @TheToto.
+
+# 2021-11-03, version 9.5.2`
+
+- Revert the improvements to the Typescript typings because they contain
+  breaking changes. The improvements will be published in v10.0.0. See #2339.
+
+# 2021-10-13, version 9.5.1
+
+- Various improvements to the Typescript typings.
+  Thanks @joshhansen and @DianaTdr.
+
+# 2021-09-22, version 9.5.0
+
+- Implemented support for calculations with percentage, see #2303.
+  Thanks @rvramesh.
+- Fix #2319: make the API of `Parser.evaluate` consistent with `math.evaluate`:
+  support a list with expressions as input.
+- Improved documentation of function `setCartesian`. Thanks @fieldfoxWim.
+
+# 2021-09-15, version 9.4.5
+
+- Improved the performance of `Node.equals` by improving the internal
+  function `deepStrictEqual`. Thanks @tomlarkworthy.
+- Fixes in the TypeScript definitions:
+  - Define `hasNumericValue`. Thanks @write2kcl.
+  - Define `MathNode.isRelationalNode`. Thanks @m93a.
+  - Fix typo in `MathNode.isConditionalNode`. Thanks @m93a.
+
+# 2021-07-07, version 9.4.4
+
+- Fixed `ArrayNode.toTex()`: remove the row delimiter on the last row,
+  see #2267. Thanks @davidtranhq.
+- Fix #2269: `intersect`  not returning `null` for matrix input. Thanks @m93a.
+- Fix #2245: mathjs not working in IE11 anymore due to a missing polyfill for
+  `Symbol`. The browser bundle now includes the necessary polyfills (it is
+  larger now because of that, see also #2266). Thanks @m93a.
+- Update dependencies (`complex.js@2.0.15`, `decimal.js@10.3.1`)
+- Drop official support for node.js 10, which has reached end of life.
+  See #2258.
+
+# 2021-06-23, version 9.4.3
+
+- Fix #2222: mathjs polluting the `Decimal` prototype. Thanks @m93a.
+- Fix #2253: expression parser throwing an error when accessing nested object
+  properties named `e`.
+- Fixes in the TypeScript definitions:
+  - function `floor`, #2159, #2246. Thanks @write2kcl.
+  - function `simplify`, see #2252. Thanks @nitroin.
+- Upgraded to `decimal.js@10.3.0`
+
+# 2021-06-05, version 9.4.2
+
+- Implemented iterative eigenvalue finder for `eigs`, making it much more
+  robust. See #2179, #2237. Thanks @m93a.
+- Improved TypeScript definitions of function `parse`. Thanks @OpportunityLiu.
+
+# 2021-05-24, version 9.4.1
+
+- Fix #2100: add TypeScript declaration for `eigs`. Thanks @andrebianchessi.
+- Fix #2220: add TypeScript files to published npm package. Thanks @dhritzkiv.
+- Update readme regarding TypeScript definition files. Thanks @dhritzkiv.
+- Update to `fraction.js@4.1.1`
+
+# 2021-05-16, version 9.4.0
+
+- Implemented support to use objects with a `Map` interface as scope,
+  see #2143, #2166. Thanks @jhugman.
+- Extend `eigs` to support general complex matrices, see #1741. Thanks @m93a.
+- DenseMatrix and SparseMatrix are now iterable, see #1184. Thanks @m93a.
+- Implemented utility functions `matrixFromRows`, `matrixFromColumns`, and
+  `matrixFromFunction`, see #2155, #2153. Thanks @m93a.
+- Added TypeScript definitions to the project, making it redundant to install
+  `@types/mathjs`, and making it easier to improve the definitions. See #2187,
+  #2192. Thanks @CatsMiaow.
+- Upgraded dependencies
+  - `complex.js@2.0.13` (fixing #2211). Thanks @infusion
+  - `fraction.js@4.1.0` (`pow` now supporting rational exponents).
+- Fix #2174: function `pickRandom` having no name. Thanks @HK-SHAO.
+- Fix #2019: VSCode auto import keeps adding import { null } from 'mathjs'.
+- Fix #2185: Fix TypeScript definition of unit division, which can also return
+  a number.
+- Fix #2123: add type definitions for functions `row` and `column`.
+- Fix some files not exposed in the package, see #2213. Thanks @javiermarinros.
+
+# 2021-04-12, version 9.3.2
+
+- Fix #2169: mathjs requesting `@babel/runtime` dependency.
+  Regression introduced in `v9.3.1`.
+
+# 2021-04-10, version 9.3.1
+
+- Fix #2133: strongly improved the performance of `isPrime`, see #2139.
+  Thanks @Yaffle.
+- Fix #2150: give a clear error "Error: Undefined function ..." instead when
+  evaluating a non-existing function.
+- Fix #660: expose internal functions `FunctionNode.onUndefinedFunction(name)`
+  and `SymbolNode.onUndefinedSymbol(name)`, allowing to override the behavior.
+  By default, an Error is thrown.
+
+# 2021-03-10, version 9.3.0
+
+- Implemented support for parsing non decimal numbers with radix point,
+  see #2122, #2121. Thanks @clnhlzmn.
+- Fix #2128: typo in docs of `luSolveAll` and `usolveAll`.
+
+# 2021-02-03, version 9.2.0
+
+- Implemented function `count` to count the total elements in a matrix,
+  see #2085. Thanks @Josef37.
+- Fix #2096: cleanup old reference to external dependency `crypto`.
+- Some refactoring in the code to remove duplications, see #2093.
+  Thanks @Josef37.
+
+# 2021-01-27, version 9.1.0
+
+- Extended function `reshape` with support for a wildcard `-1` to automatically
+  calculate the remaining size, like `reshape([1, 2, 3, 4, 5, 6], [-1, 2])`
+  which will output `[[0, 1], [2, 3], [4, 5]]`. See #2075. Thanks @Josef37.
+- Fix #2087: function `simplify` ignores second argument of `log`, for example
+  in `simplify('log(e, 9)')` . Thanks @quentintruong.
+
+# 2021-01-16, version 9.0.0
+
+- Improved support for bin, hex, and oct literals. See #1996. Thanks @clnhlzmn.
+  - **Breaking change**: parse literals with prefixes `0b`, `0c`, and `0x` are  
+    now unsigned by default. To parse them as signed, you have to specify a
+    suffix specifying the word size such as `i16` or `i32`.
+  - Function `format` now supports more notations: `bin`, 'hex', and `oct`,
+    for example `format(255, {notation: "hex"})`.
+  - The functions `format`, `bin`, `hex`, `oct` now allow specifying a wordSize,
+    like `bin(10, 32)` and `format(10, {notation: "bin", wordSize: 32})`.
+  - BigNumber support for the bin, hex, and oct literals.
+- Extended and improved the example rocket_trajectory_optimization.html.
+  Thanks @Josef37.
+
+# 2020-12-30, version 8.1.1
+
+- Improved the performance of parsing and evaluating units a lot, see #2065.
+  Thanks @flaviut.
+- Upgraded dependency `fraction.js` to `v4.0.13`.
+- Moved continuous integration testing from Travis CI to Github Workflow,
+  see #2024, #2041. Thanks @harrysarson.
+
+# 2020-12-04, version 8.1.0
+
+- Implemented units `kilogramforce` (`kgf`). Thanks @rnd-debug.
+- Fix #2026: Implement a new option `fractionsLimit` for function `simplify`,
+  defaulting to `Infinity`.
+- Improved the documentation of function `clone`. Thanks @redbar0n.
+
+# 2020-11-09, version 8.0.1
+
+- Fix #1979: missing "subset" dependency when using "mathjs/number" entry point.
+- Fix #2022: update pretty printing with MathJax example to the latest version
+  of MathJax. Thanks @pkra.
+
+# 2020-11-06, version 8.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+- You can now use mathjs directly in node.js using ES modules without need for
+  a transpiler (see #1928, #1941, #1962).
+  Automatically loading either commonjs code or ES modules code is improved.
+  All generated code is moved under `/lib`: the browser bundle is moved from
+  `/dist` to `/lib/browser`, ES module files are moved to `/lib/esm`,
+  and commonjs files are moved to `/lib/cjs`. Thanks @GreenImp.
+- Non-minified bundle `dist/math.js` is no longer provided. Either use the
+  minified bundle, or create a bundle yourself.
+- Replaced random library `seed-random` with `seedrandom`, see #1955.
+  Thanks @poppinlp.
+- Breaking changes in `pickRandom`, see #1990, #1976.
+  - Will no longer return the input matrix when the given number is greater
+    than the length of the provided possibles. Instead, the function always
+    returns results with the requested number of picks.
+  - Will now return a `Matrix` as output when input was a `Matrix`.
+  - Introduced a new syntax:
+
+    ```
+    math.pickRandom(array, { weights, number, elementWise })
+    ```
+
+  - Introduced a new option `elementWise`, which is `true` by default.
+    When setting `elementWise` to false, an array containing arrays will return
+    random pick of arrays instead of the elements inside of the nested arrays.
+
+# 2020-11-02, version 7.6.0
+
+- Implemented function `rotate(w, theta)`. See #1992, #1160. Thanks @rnd-debug.
+- Implemented support for custom characters in Units via `Unit.isValidAlpha`.
+  See #1663, #2000. Thanks @rnd-debug.
+
+# 2020-10-10, version 7.5.1
+
+- Fix object pollution vulnerability in `math.config`. Thanks Snyk.
+
+# 2020-10-07, version 7.5.0
+
+- Function `pickRandom` now allows randomly picking elements from matrices
+  with 2 or more dimensions instead of only from a vector, see #1974.
+  Thanks @KonradLinkowski.
+
+# 2020-10-07, version 7.4.0
+
+- Implemented support for passing a precision in functions `ceil`, `floor`,
+  and `fix`, similar to `round`, see #1967, #1901. Thanks @rnd-debug.
+- Implemented function `rotationMatrix`, see #1160, #1984. Thanks @rnd-debug.
+- Implement a clear error message when using `sqrtm` with a matrix having
+  more than two dimensions. Thanks @KonradLinkowski.
+- Update dependency `decimal.js` to `10.2.1`.
+
+# 2020-09-26, version 7.3.0
+
+- Implemented functions `usolveAll` and `lsolveAll`, see #1916. Thanks @m93a.
+- Implemented support for units in functions `std` and `variance`, see #1950.
+  Thanks @rnd-debug.
+- Implemented support for binary, octal, and hexadecimal notation in the
+  expression parser, and implemented functions `bin`, `oct`, and `hex` for
+  formatting. Thanks @clnhlzmn.
+- Fix #1964: inconsistent calculation of negative dividend modulo for
+  `BigNumber` and `Fraction`. Thanks @ovk.
+
+# 2020-08-24, version 7.2.0
+
+- Implemented new function `diff`, see #1634, #1920. Thanks @Veeloxfire.
+- Implemented support for norm 2 for matrices in function `norm`.
+  Thanks @rnd-debug.
+
+# 2020-07-13, version 7.1.0
+
+- Implement support for recursion (self-referencing) of typed-functions,
+  new in `typed-function@2.0.0`. This fixes #1885: functions which where
+  extended with a new data type did not always work. Thanks @nickewing.
+- Fix #1899: documentation on expression trees still using old namespace
+  `math.expression.node.*` instead of `math.*`.
+
+# 2020-06-24, version 7.0.2
+
+- Fix #1882: have `DenseMatrix.resize` and `SparseMatrix.resize` accept
+  `DenseMatrix` and `SparseMatrix` as inputs too, not only `Array`.
+- Fix functions `sum`, `prod`, `min`, and `max` not throwing a conversion error
+  when passing a single string, like `sum("abc")`.
+
+# 2020-05-30, version 7.0.1
+
+- Fix #1844: clarify the documentation of function `eigs`. Thanks @Lazersmoke.
+- Fix #1855: Fix error in the documentation for `math.nthRoots(x)`.  
+- Fix #1856: make the library robust against Object prototype pollution.
+
+# 2020-05-07, version 7.0.0
+
+Breaking changes:
+
+- Improvements in calculation of the `dot` product of complex values.
+  The first argument is now conjugated. See #1761. Thanks @m93a.  
+- Dropped official support for Node.js v8 which has reached end of life.
+- Removed all deprecation warnings introduced in v6.
+  To upgrade smoothly from v5 to v7 or higher, upgrade to v6 first
+  and resolve all deprecation warnings.
+
+# 2020-05-04, version 6.6.5
+
+- Fix #1834: value `Infinity` cannot be serialized and deserialized.
+  This is solved now with a new `math.replacer` function used as
+  `JSON.stringify(value, math.replacer)`.
+- Fix #1842: value `Infinity` not turned into the latex symbol `\\infty`.
+
+# 2020-04-15, version 6.6.4
+
+- Fix published files containing Windows line endings (CRLF instead of LF).  
+
+# 2020-04-10, version 6.6.3
+
+- Fix #1813: bug in engineering notation for numbers of function `format`,
+  sometimes resulting in needless trailing zeros.
+- Fix #1808: methods `.toNumber()` and `.toNumeric()` not working on a
+  unitless unit.
+- Fix #1645: not being able to use named operators `mod`, `and`, `not`, `or`,
+  `xor`, `to`, `in` as object keys. Thanks @Veeloxfire.
+- Fix `eigs` not using `config.epsilon`.
+
+# 2020-03-29, version 6.6.2
+
+- Fix #1789: Function `eigs` not calculating with BigNumber precision
+  when input contains BigNumbers.
+- Run the build script during npm `prepare`, so you can use the library
+  directly when installing directly from git. See #1751. Thanks @cinderblock.
+
+# 2020-02-26, version 6.6.1
+
+- Fix #1725: simplify `a/(b/c)`. Thanks @dbramwell.
+- Fix examples in documentation of `row` and `column`.
+
+# 2020-02-01, version 6.6.0
+
+- Implemented function `eigs`, see #1705, #542 #1175. Thanks @arkajitmandal.
+- Fixed #1727: validate matrix size when creating a `DenseMatrix` using
+  `fromJSON`.
+- Fixed `DenseMatrix.map` copying the size and datatype from the original
+  matrix instead of checking the returned dimensions and type of the callback.
+- Add a caret to dependencies (like) `^1.2.3`) to allow downstream updates
+  without having to await a new release of mathjs.
+
+# 2020-01-08, version 6.5.0
+
+- Implemented `baseName` option for `createUnit`, see #1707.
+  Thanks @ericman314.
+
+# 2020-01-06, version 6.4.0
+
+- Extended function `dimension` with support for n-dimensional points.
+  Thanks @Veeloxfire.
+
+# 2019-12-31, version 6.3.0
+
+- Improved performance of `factorial` for `BigNumber` up to a factor two,
+  see #1687. Thanks @kmdrGroch.
+
+# 2019-11-20, version 6.2.5
+
+- Fixed `IndexNode` using a hardcoded, one-based implementation of `index`,
+  making it impossible to instantiate a zero-based version of the expression
+  parser. See #782.
+
+# 2019-11-20, version 6.2.4
+
+- Fixed #1669: function 'qr' threw an error if the pivot was zero,
+  thanks @kevinkelleher12 and @harrysarson.
+- Resolves #942: remove misleading assert in 'qr'. Thanks @harrysarson.
+- Work around a bug in complex.js where `sign(0)` returns complex NaN.
+  Thanks @harrysarson.
+
+# 2019-10-06, version 6.2.3
+
+- Fixed #1640: function `mean` not working for units. Thanks @clintonc.
+- Fixed #1639: function `min` listed twice in the "See also" section of the
+  embedded docs of function `std`.
+- Improved performance of `isPrime`, see #1641. Thanks @arguiot.
+
+# 2019-09-23, version 6.2.2
+
+- Fixed methods `map` and `clone` not copying the `dotNotation` property of
+  `IndexNode`. Thanks @rianmcguire.
+- Fixed a typo in the documentation of `toHTML`. Thanks @maytanthegeek.
+- Fixed #1615: error in the docs of `isNumeric`.
+- Fixed #1628: Cannot call methods on empty strings or numbers with value `0`.
+
+# 2019-08-31, version 6.2.1
+
+- Fixed #1606: function `format` not working for expressions.
+
+# 2019-08-28, version 6.2.0
+
+- Improved performance of `combinationsWithRep`. Thanks @waseemyusuf.
+- Add unit aliases `bit` and `byte`.
+- Fix docs referring to `bit` and `byte` instead of `bits` and `bytes`.
+- Updated dependency `typed-function@1.1.1`.
+
+# 2019-08-17, version 6.1.0
+
+- Implemented function `combinationsWithRep` (see #1329). Thanks @waseemyusuf.
+
+# 2019-08-05, version 6.0.4
+
+- Fixed #1554, #1565: ES Modules where not transpiled to ES5, giving issues on
+  old browsers. Thanks @mockdeep for helping to find a solution.
+
+# 2019-07-07, version 6.0.3
+
+- Add `unpkg` and `jsdelivr` fields in package.json pointing to UMD build.
+  Thanks @tmcw.
+- Fix #1550: nested user defined function not receiving variables of an
+  outer user defined function.
+
+# 2019-06-11, version 6.0.2
+
+- Fix not being able to set configuration after disabling function `import`
+  (regression since v6.0.0).
+
+# 2019-06-09, version 6.0.1
+
+- Fix function reference not published in npm library.
+- Fix function `evaluate` and `parse` missing in generated docs.
+
+# 2019-06-08, version 6.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+### Most notable changes
+
+1. Full support for **ES modules**. Support for tree-shaking out of the box.
+
+    Load all functions:
+
+    ```js
+    import * as math from 'mathjs'
+    ```
+
+    Use a few functions:
+
+    ```js
+    import { add, multiply } from 'mathjs'
+    ```
+
+    Load all functions with custom configuration:
+
+    ```js
+    import { create, all } from 'mathjs'
+    const config = { number: 'BigNumber' }
+    const math = create(all, config)
+    ```
+
+    Load a few functions with custom configuration:
+
+    ```js
+    import { create, addDependencies, multiplyDependencies } from 'mathjs'
+    const config = { number: 'BigNumber' }
+    const { add, multiply } = create({
+      addDependencies,
+      multiplyDependencies
+    }, config)
+    ```
+
+2. Support for **lightweight, number-only** implementations of all functions:
+
+    ```
+    import { add, multiply } from 'mathjs/number'
+    ```
+
+3. New **dependency injection** solution used under the hood.
+
+### Breaking changes
+
+- Node 6 is no longer supported.
+
+- Functions `config` and `import` are not available anymore in the global
+  context:
+
+  ```js
+  // v5
+  import * as mathjs from 'mathjs'
+  mathjs.config(...) // error in v6.0.0
+  mathjs.import(...) // error in v6.0.0
+  ```
+
+  Instead, create your own mathjs instance and pass config and imports
+  there:
+
+  ```js
+  // v6
+  import { create, all } from 'mathjs'
+  const config = { number: 'BigNumber' }
+  const mathjs = create(all, config)
+  mathjs.import(...)
+  ```
+
+- Renamed function `typeof` to `typeOf`, `var` to `variance`,
+  and `eval` to `evaluate`. (the old function names are reserved keywords
+  which can not be used as a variable name).
+- Deprecated the `Matrix.storage` function. Use `math.matrix` instead to create
+  a matrix.
+- Deprecated function `math.expression.parse`, use `math.parse` instead.
+  Was used before for example to customize supported characters by replacing
+  `math.parse.isAlpha`.
+- Moved all classes like `math.type.Unit` and `math.expression.Parser` to
+  `math.Unit` and `math.Parser` respectively.
+- Fixed #1428: transform iterating over replaced nodes. New behavior
+  is that it stops iterating when a node is replaced.
+- Dropped support for renaming factory functions when importing them.
+- Dropped fake BigNumber support of function `erf`.
+- Removed all index.js files used to load specific functions instead of all, like:
+
+  ```
+  // v5
+  // ... set up empty instance of mathjs, then load a set of functions:
+  math.import(require('mathjs/lib/function/arithmetic'))
+  ```
+
+  Individual functions are now loaded simply like:
+
+  ```js
+  // v6
+  import { add, multiply } from 'mathjs'
+  ```
+
+  To set a specific configuration on the functions:
+
+  ```js
+  // v6
+  import { create, addDependencies, multiplyDependencies } from 'mathjs'
+  const config = { number: 'BigNumber' }
+  const math = create({ addDependencies, multiplyDependencies }, config)
+  ```
+
+  See example `advanced/custom_loading.js`.
+
+- Updated the values of all physical units to their latest official values.
+  See #1529. Thanks @ericman314.
+
+### Non breaking changes
+
+- Implemented units `t`, `tonne`, `bel`, `decibel`, `dB`, and prefixes
+  for `candela`. Thanks @mcvladthegoat.
+- Fixed `epsilon` setting being applied globally to Complex numbers.
+- Fix `math.simplify('add(2, 3)')` throwing an error.
+- Fix #1530: number formatting first applied `lowerExp` and `upperExp`
+  and after that rounded the value instead of the other way around.
+- Fix #1473: remove `'use strict'` in every file, not needed anymore.
+
+# 2019-05-18, version 5.10.3
+
+- Fixed dependency `del` being a dependency instead of devDependency.
+
+# 2019-05-18, version 5.10.2
+
+- Fix #1515, #1516, #1517: broken package due to a naming conflict in
+  the build folder of a util file `typeOf.js` and `typeof.js`.
+  Solved by properly cleaning all build folders before building.
+
+# 2019-05-17, version 5.10.1
+
+- Fix #1512: format using notation `engineering` can give wrong results
+  when the value has less significant digits than the number of digits in
+  the output.
+
+# 2019-05-08, version 5.10.0
+
+- Fix `lib/header.js` not having filled in date and version. Thanks @kevjin.
+- Upgraded dependency `decimal.js@10.2.0`, fixing an issue on node.js 12.
+
+# 2019-04-08, version 5.9.0
+
+- Implemented functions `row` and `column` (see #1413). Thanks @SzechuanSage.
+- Fixed #1459: `engineering` notation of function `format` not available
+  for `BigNumber`.
+- Fixed #1465: `node.toHTML()` not correct for unary operators like
+  `factorial`.
+
+# 2019-03-20, version 5.8.0
+
+- Implemented new function `apply`. Thanks @bnlcas.
+- Implemented passing an optional `dimension` argument to `std` and `var`.
+  Thanks @bnlcas.
+
+# 2019-03-10, version 5.7.0
+
+- Implemented support for `pow()` in `derivative`. Thanks @sam-19.
+- Gracefully handle round-off errors in fix, ceil, floor, and range
+  (Fixes #1429, see also #1434, #1432). Thanks @ericman314.
+
+# 2019-03-02, version 5.6.0
+
+- Upgrade decimal.js to v10.1.1 (#1421).
+- Fixed #1418: missing whitespace when stringifying an expression
+  containing "not".
+
+# 2019-02-20, version 5.5.0
+
+- Fixed #1401: methods `map` and `forEach` of `SparseMatrix` not working
+  correctly when indexes are unordered.
+- Fixed #1404: inconsistent rounding of negative numbers.
+- Upgrade tiny-emitter to v2.1.0 (#1397).
+
+# 2019-01-25, version 5.4.2
+
+- Fixed `math.format` not working for BigNumbers with a precision above
+  1025 digits (see #1385). Thanks @ericman314.
+- Fixed incorrect LaTeX output of `RelationalNode`. Thanks @rianmcguire.
+- Fixed a bug the methods `map`, `forEach`, `traverse`, and `transform`
+  of `FunctionNode`.
+
+# 2019-01-10, version 5.4.1
+
+- Fix #1378: negative bignumbers not formatted correctly.
+- Upgrade fraction.js to version 4.0.12 (#1369).
+
+# 2018-12-09, version 5.4.0
+
+- Extended sum.js to accept a dimension input to calculate the sum over a
+  specific axis. Thanks @bnlcas.
+- Fix #1328: objects can't be written multi-line. Thanks @GHolk.
+- Remove side effects caused by `Unit.format` and `Unit.toString`,
+  making changes to the unit on execution. Thanks @ericman314.
+
+# 2018-12-03, version 5.3.1
+
+- Fixed #1336: Unit.toSI() returning units with prefix like `mm` instead
+  of `m`. Thanks @ericman314.
+
+# 2018-11-29, version 5.3.0
+
+- Implemented function `hasNumericValue`. Thanks @Sathish-kumar-Subramani.
+- Fix #1326: non-ascii character in print.js.
+- Fix #1337: `math.format` not working correctly with `{ precision: 0 }`.
+  Thanks @dkenul.
+
+# 2018-10-30, version 5.2.3
+
+- Fixed #1293: non-unicode characters in `escape-latex` giving issues in some
+  specific cases. Thanks @dangmai.
+- Fixed incorrect LaTeX output of function `bitNot`, see #1299. Thanks @FSMaxB.
+- Fixed #1304: function `pow` not supporting inputs `pow(Unit, BigNumber)`.
+- Upgraded dependencies (`escape-latex@1.2.0`)
+
+# 2018-10-23, version 5.2.2
+
+- Fixed #1286: Fixed unit base recognition and formatting for
+  user-defined units. Thanks @ericman314.
+
+# 2018-10-18, version 5.2.1
+
+- Fixed unit `rod` being defined as `5.02921` instead of `5.0292`.
+  Thanks @ericman314.
+- Upgraded dependencies (`fraction.js@4.0.10`)
+- Upgraded devDependencies (`@babel/core@7.1.2`, `nyc@13.1.0`,
+  `webpack@4.21.0`).
+
+# 2018-10-05, version 5.2.0
+
+- Implemented support for chained conditionals like `10 < x <= 50`.
+  Thanks @ericman314.
+- Add an example showing a proof of concept of using `BigInt` in mathjs.
+- Fixed #1269: Bugfix for BigNumber divided by unit. Thanks @ericman314.
+- Fixed #1240: allow units having just a value and no unit.
+  Thanks @ericman314.
+
+## 2018-09-09, version 5.1.2
+
+- Fixed a typo in the docs of `parse`. Thanks @mathiasvr.
+- Fixed #1222: a typo in the docs of `subset`.
+- Fixed #1236: `quantileSeq` has inconsistent return.
+- Fixed #1237: norm sometimes returning a complex number instead of
+  number.
+- Upgraded dependencies (`fraction.js@4.0.9`)
+- Upgraded devDependencies (`babel@7`, `karma-webpack@3.0.4`,
+  `nyc@13.0.1`, `standard@12.0.0`, `uglify-js@3.4.9`, `webpack@4.17.2`)
+
+## 2018-08-21, version 5.1.1
+
+- Function `isNumeric` now recognizes more types.
+- Fixed #1214: functions `sqrt`, `max`, `min`, `var`, `std`, `mode`, `mad`,
+  `median`, and `partitionSelect` not neatly handling `NaN` inputs. In some
+  cases (`median`, `mad`, and `partitionSelect`) this resulted in an infinite
+  loop.
+- Upgraded dependencies (`escape-latex@1.1.1`)
+- Upgraded devDependencies (`webpack@4.17.0`)
+
+## 2018-08-12, version 5.1.0
+
+- Implemented support for strings enclosed in single quotes.
+  Thanks @jean-emmanuel.
+- Implemented function `getMatrixDataType`. Thanks @JasonShin.
+- Implemented new `options` argument in `simplify`. Thanks @paulobuchsbaum.
+- Bug fixes in `rationalize`, see #1173. Thanks @paulobuchsbaum.
+
+## 2018-07-22, version 5.0.4
+
+- Strongly improved the performance of functions `factorial` for numbers.
+  This improves performance of functions `gamma`, `permutation`, and
+  `combination` too. See #1170. Thanks @honeybar.
+- Strongly improved the performance of function `reshape`, thanks to a
+  friend of @honeybar.
+
+## 2018-07-14, version 5.0.3
+
+- Fixed many functions (for example `add` and `subtract`) not working
+  with matrices having a `datatype` defined.
+- Fixed #1147: bug in `format` with `engineering` notation in outputting
+  the correct number of significant figures. Thanks @ericman314.
+- Fixed #1162: transform functions not being cleaned up when overriding
+  it by importing a factory function with the same name.
+- Fixed broken links in the documentation. Thanks @stropitek.
+- Refactored the code of `parse` into a functional approach.
+  Thanks @harrysarson.
+- Changed `decimal.js` import to ES6. Thanks @weinshel.
+
+## 2018-07-07, version 5.0.2
+
+- Fixed #1136: rocket trajectory example broken (since v4.0.0).
+- Fixed #1137: `simplify` unnecessarily replacing implicit multiplication with
+  explicit multiplication.
+- Fixed #1146: `rationalize` throwing exceptions for some input with decimals.
+  Thanks @maruta.
+- Fixed #1088: function arguments not being passed to `rawArgs` functions.
+- Fixed advanced example `add_new_datatypes`.
+- Fixed mathjs core constants not working without complex numbers.
+  Thanks @ChristopherChudzicki.
+- Fixed a broken link in the documentation on units. Thanks @stropitek.
+- Upgraded dependencies (`typed-function@1.0.4`, `complex.js@2.0.11`).
+- Upgraded devDependencies (`babel-loader@7.1.5`, `uglify-js@3.4.3`,
+  `expr-eval@1.2.2`, `webpack@4.15.1`).
+
+## 2018-07-01, version 5.0.1
+
+- Improved error messaging when converting units. Thanks @gap777.
+- Upgraded devDependencies (`kerma`, `uglify-js`, `webpack`).
+
+## 2018-06-16, version 5.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+- Implemented complex conjugate transpose `math.ctranspose`. See #1097.
+  Thanks @jackschmidt.
+- Changed the behavior of `A'` (transpose) in the expression parser to
+  calculate the complex conjugate transpose. See #1097. Thanks @jackschmidt.
+- Added support for `complex({abs: 1, arg: 1})`, and improved the docs on
+  complex numbers. Thanks @ssaket.
+- Renamed `eye` to `identity`, see #1054.
+- Math.js code can now contain ES6. The ES6 source code is moved from `lib`
+  to `src`, and `lib` now contains the compiled ES5 code.
+- Upgraded dependencies:
+  - `decimal.js` from `9.0.1` to `10.0.1`
+  - Upgraded dev dependencies
+- Changed code style to <https://standardjs.com/>, run linter on `npm test`.
+  See #1110.
+- Dropped support for bower. Use npm or an other package manages instead.
+- Dropped support for (non-primitive) instances of `Number`, `Boolean`, and
+  `String` from functions `clone` and `typeof`.
+- Dropped official support for IE9 (probably still works, but it's not tested).
+- Fixed #851: More consistent behavior of sqrt, nthRoot, and pow.
+  Thanks @dakotablair.
+- Fixed #1103: Calling `toTex` on node that contains `derivative` causing
+  an exception. Thanks @joelhoover.
+
+## 2018-06-02, version 4.4.2
+
+- Drastically improved the performance of `det`. Thanks @ericman314.
+- Fixed #1065, #1121: Fixed wrong documentation of function
+  `compareNatural` and clarified the behavior for strings.
+- Fixed #1122 a regression in function `inv` (since `v4.4.1`).
+  Thanks @ericman314.
+
+## 2018-05-29, version 4.4.1
+
+- Fixed #1109: a bug in `inv` when dealing with values close to zero.
+  Thanks @ericman314.
+
+## 2018-05-28, version 4.4.0
+
+- Implemented functions `equalText` and `compareText`. See #1085.
+
+## 2018-05-21, version 4.3.0
+
+- Implemented matrix exponential `math.expm`. Thanks @ericman314.
+- Fixed #1101: math.js bundle not working when loading in a WebWorker.
+- Upgraded dependencies
+  - `complex.js` from `v2.0.2` to `v2.0.10`.
+  - `fraction.js` from `v4.0.4` to `v4.0.8`.
+- Upgraded devDependencies (`mocha`, `uglify-js`, `webpack`).
+
+## 2018-05-05, version 4.2.2
+
+- Fixed calculating the Frobenius norm of complex matrices correctly,
+  see #1098. Thanks @jackschmidt.
+- Fixed #1076: cannot use mathjs in React VR by updating to
+  `escape-latex@1.0.3`.
+
+## 2018-05-02, version 4.2.1
+
+- Fixed `dist/math.js` being minified.
+
+## 2018-05-02, version 4.2.0
+
+- Implemented function `math.sqrtm`. Thanks @ferrolho.
+- Implemented functions `math.log2`, `math.log1p`, and `math.expm1`.
+  Thanks @BigFav and @harrysarson.
+- Fixed some unit tests broken on nodejs v10.
+- Upgraded development dependencies.
+- Dropped integration testing on nodejs v4.
+
+## 2018-04-18, version 4.1.2
+
+- Fixed #1082: implemented support for unit plurals `decades`, `centuries`,
+  and `millennia`.
+- Fixed #1083: units `decade` and `watt` having a wrong name when stringifying.
+  Thanks @ericman314.
+
+## 2018-04-11, version 4.1.1
+
+- Fixed #1063: derivative not working when resolving a variable with unary
+  minus like `math.derivative('-x', 'x')`.
+
+## 2018-04-08, version 4.1.0
+
+- Extended function `math.print` with support for arrays and matrices.
+  Thanks @jean-emmanuel.
+- Fixed #1077: Serialization/deserialization to JSON with reviver not being
+  supported by nodes.
+- Fixed #1016: Extended `math.typeof` with support for `ResultSet` and nodes
+  like `SymbolNode`.
+- Fixed #1072: Added support for long and short prefixes for the unit `bar`
+  (i.e. `millibar` and `mbar`).
+
+## 2018-03-17, version 4.0.1
+
+- Fixed #1062: mathjs not working on ES5 browsers like IE11 and Safari 9.3.
+- Fixed #1061: `math.unit` not accepting input like `1/s`.
+
+## 2018-02-25, version 4.0.0
+
+!!! BE CAREFUL: BREAKING CHANGES !!!
+
+Breaking changes (see also #682):
+
+- **New expression compiler**
+
+    The compiler of the expression parser is replaced with one that doesn't use
+    `eval` internally. See #1019. This means:
+
+  - a slightly improved performance on most browsers.
+  - less risk of security exploits.
+  - the code of the new compiler is easier to understand, maintain, and debug.
+
+    Breaking change here: When using custom nodes in the expression parser,
+    the syntax of `_compile` has changed. This is an undocumented feature though.
+
+- **Parsed expressions**
+
+  - The class `ConstantNode` is changed such that it just holds a value
+      instead of holding a stringified value and it's type.
+      `ConstantNode(valueStr, valueType`) is now `ConstantNode(value)`
+      Stringification uses `math.format`, which may result in differently
+      formatted numeric output.
+
+  - The constants `true`, `false`, `null`, `undefined`, `NaN`, `Infinity`,
+      and `uninitialized` are now parsed as ConstantNodes instead of
+      SymbolNodes in the expression parser. See #833.
+
+- **Implicit multiplication**
+
+  - Changed the behavior of implicit multiplication to have higher
+      precedence than explicit multiplication and division, except in
+      a number of specific cases. This gives a more natural behavior
+      for implicit multiplications. For example `24h / 6h` now returns `4`,
+      whilst `1/2 kg` evaluates to `0.5 kg`. Thanks @ericman314. See: #792.
+      Detailed documentation: <https://github.com/josdejong/mathjs/blob/v4/docs/expressions/syntax.md#implicit-multiplication>.
+
+  - Immediately invoking a function returned by a function like `partialAdd(2)(3)`
+      is no longer supported, instead these expressions are evaluated as
+      an implicit multiplication `partialAdd(2) * (3)`. See #1035.
+
+- **String formatting**
+
+  - In function `math.format`, the options `{exponential: {lower: number, upper: number}}`
+      (where `lower` and `upper` are values) are replaced with `{lowerExp: number, upperExp: number}`
+      (where `lowerExp` and `upperExp` are exponents). See #676. For example:
+
+      ```js
+      math.format(2000, {exponential: {lower: 1e-2, upper: 1e2}})
+      ```
+
+      is now:
+
+      ```js
+      math.format(2000, {lowerExp: -2, upperExp: 2})
+      ```
+
+  - In function `math.format`, the option `notation: 'fixed'` no longer rounds to
+      zero digits  when no precision is specified: it leaves the digits as is.
+      See #676.
+
+- **String comparison**
+
+    Changed the behavior of relational functions (`compare`, `equal`,
+    `equalScalar`, `larger`, `largerEq`, `smaller`, `smallerEq`, `unequal`)
+    to compare strings by their numeric value they contain instead of
+    alphabetically. This also impacts functions `deepEqual`, `sort`, `min`,
+    `max`, `median`, and `partitionSelect`. Use `compareNatural` if you
+    need to sort an array with text. See #680.
+
+- **Angle units**
+
+    Changed `rad`, `deg`, and `grad` to have short prefixes,
+    and introduced `radian`, `degree`, and `gradian` and their plurals
+    having long prefixes. See #749.
+
+- **Null**
+
+  - `null` is no longer implicitly casted to a number `0`, so input like
+      `math.add(2, null)` is no longer supported. See #830, #353.
+
+  - Dropped constant `uninitialized`, which was used to initialize
+      leave new entries undefined when resizing a matrix is removed.
+      Use `undefined` instead to indicate entries that are not explicitly
+      set. See #833.
+
+- **New typed-function library**
+
+  - The `typed-function` library used to check the input types
+      of functions is completely rewritten and doesn't use `eval` under
+      the hood anymore. This means a reduced security risk, and easier
+      to debug code. The API is the same, but error messages may differ
+      a bit. Performance is comparable but may differ in specific
+      use cases and browsers.
+
+Non breaking changes:
+
+- Thanks to the new expression compiler and `typed-function` implementation,
+  mathjs doesn't use JavaScript's `eval` anymore under the hood.
+  This allows using mathjs in environments with security restrictions.
+  See #401.
+- Implemented additional methods `isUnary()` and `isBinary()` on
+  `OperatorNode`. See #1025.
+- Improved error messages for statistical functions.
+- Upgraded devDependencies.
+- Fixed #1014: `derivative` silently dropping additional arguments
+  from operator nodes with more than two arguments.
+
+## 2018-02-07, version 3.20.2
+
+- Upgraded to `typed-function@0.10.7` (bug-fix release).
+- Fixed option `implicit` not being copied from an `OperatorNode`
+  when applying function `map`. Thanks @HarrySarson.
+- Fixed #995: spaces and underscores not property being escaped
+  in `toTex()`. Thanks @FSMaxB.
+
+## 2018-01-17, version 3.20.1
+
+- Fixed #1018: `simplifyCore` failing in some cases with parentheses.
+  Thanks @firepick1.
+
+## 2018-01-14, version 3.20.0
+
+- Implement support for 3 or more arguments for operators `+` and `*` in
+  `derivative`. Thanks @HarrySarson. See #1002.
+- Fixed `simplify` evalution of `simplify` of functions with more than two
+  arguments wrongly: `simplify('f(x, y, z)') evaluated to`f(f(x, y), z)`
+  instead of `f(x, y, z)`. Thanks @joelhoover.
+- Fixed `simplify` throwing an error in some cases when simplifying unknown
+  functions, for example `simplify('f(4)')`. Thanks @joelhoover.
+- Fixed #1013: `simplify` wrongly simplifing some expressions containing unary
+  minus, like `0 - -x`. Thanks @joelhoover.
+- Fixed an error in an example in the documentation of `xor`. Thanks @denisx.
+
+## 2018-01-06, version 3.19.0
+
+- Extended functions `distance` and `intersect` with support for BigNumbers.
+  Thanks @ovk.
+- Improvements in function `simplify`: added a rule that allows combining
+  of like terms in embedded quantities. Thanks @joelhoover.
+
+## 2017-12-28, version 3.18.1
+
+- Fixed #998: An issue with simplifying an expression containing a subtraction.
+  Thanks @firepick1.
+
+## 2017-12-16, version 3.18.0
+
+- Implemented function `rationalize`. Thanks @paulobuchsbaum.
+- Upgraded dependencies:
+
+  ```
+  decimal.js    7.2.3  →  9.0.1 (no breaking changes affecting mathjs)
+  fraction.js   4.0.2  →  4.0.4
+  tiny-emitter  2.0.0  →  2.0.2
+  ```
+
+- Upgraded dev dependencies.
+- Fixed #975: a wrong example in the docs of lusolve.
+- Fixed #983: `pickRandom` returning an array instead of single value
+  when input was an array with just one value. Clarified docs.
+- Fixed #969: preven issues with yarn autoclean by renaming an
+  interally used folder "docs" to "embeddedDocs".
+
+## 2017-11-18, version 3.17.0
+
+- Improved `simplify` for nested exponentiations. Thanks @IvanVergiliev.
+- Fixed a security issue in `typed-function` allowing arbitrary code execution
+  in the JavaScript engine by creating a typed function with JavaScript code
+  in the name. Thanks Masato Kinugawa.
+- Fixed a security issue where forbidden properties like constructor could be
+  replaced by using unicode characters when creating an object. No known exploit,
+  but could possibly allow arbitrary code execution. Thanks Masato Kinugawa.
+
+## 2017-10-18, version 3.16.5
+
+- Fixed #954: Functions `add` and `multiply` not working when
+  passing three or more arrays or matrices.
+
+## 2017-10-01, version 3.16.4
+
+- Fixed #948, #949: function `simplify` returning wrong results or
+  running into an infinite recursive loop. Thanks @ericman314.
+- Fixed many small issues in the embedded docs.  Thanks @Schnark.
+
+## 2017-08-28, version 3.16.3
+
+- Fixed #934: Wrong simplification of unary minus. Thanks @firepick1.
+- Fixed #933: function `simplify` reordering operations. Thanks @firepick1.
+- Fixed #930: function `isNaN` returning wrong result for complex
+  numbers having just one of their parts (re/im) being `NaN`.
+- Fixed #929: `FibonacciHeap.isEmpty` returning wrong result.
+
+## 2017-08-20, version 3.16.2
+
+- Fixed #924: a regression in `simplify` not accepting the signature
+  `simplify(expr, rules, scope)` anymore. Thanks @firepick1.
+- Fixed missing parenthesis when stringifying expressions containing
+  implicit multiplications (see #922). Thanks @FSMaxB.
+
+## 2017-08-12, version 3.16.1
+
+- For security reasons, type checking is now done in a more strict
+  way using functions like `isComplex(x)` instead of duck type checking
+  like `x && x.isComplex === true`.
+- Fixed #915: No access to property "name".
+- Fixed #901: Simplify units when calling `unit.toNumeric()`.
+  Thanks @AlexanderBeyn.
+- Fixed `toString` of a parsed expression tree containing an
+  immediately invoked function assignment not being wrapped in
+  parenthesis (for example `(f(x) = x^2)(4)`).
+
+## 2017-08-06, version 3.16.0
+
+- Significant performance improvements in `math.simplify`.
+  Thanks @firepick1.
+- Improved API for `math.simplify`, optionally pass a scope with
+  variables which are resolved, see #907. Thanks @firepick1.
+- Fixed #912: math.js didn't work on IE10 anymore (regression
+  since 3.15.0).
+
+## 2017-07-29, version 3.15.0
+
+- Added support for the dollar character `$` in symbol names (see #895).
+- Allow objects with prototypes as scope again in the expression parser,
+  this was disabled for security reasons some time ago. See #888, #899.
+  Thanks @ThomasBrierley.
+- Fixed #846: Issues in the functions `map`, `forEach`, and `filter`
+  when used in the expression parser:
+  - Not being able to use a function assignment as inline expression
+    for the callback function.
+  - Not being able to pass an inline expression as callback for `map`
+    and `forEach`.
+  - Index and original array/matrix not passed in `map` and `filter`.
+
+## 2017-07-05, version 3.14.2
+
+- Upgraded to `fraction.js@4.0.2`
+- Fixed #891 using BigNumbers not working in browser environments.
+
+## 2017-06-30, version 3.14.1
+
+- Reverted to `fraction.js@4.0.0`, there is an issue with `4.0.1`
+  in the browser.
+
+## 2017-06-30, version 3.14.0
+
+- Implemented set methods `setCartesian`, `setDifference`,
+  `setDistinct`, `setIntersect`, `setIsSubset`, `setPowerset`,
+  `setSize`. Thanks @Nekomajin42.
+- Implemented method `toHTML` on nodes. Thanks @Nekomajin42.
+- Implemented `compareNatural` and `sort([...], 'natural')`.
+- Upgraded dependencies to the latest versions:
+  - `complex.js@2.0.4`
+  - `decimal.js@7.2.3`
+  - `fraction.js@4.0.1`
+  - `tiny-emitter@2.0.0`
+  - And all devDependencies.
+- Fixed #865: `splitUnit` can now deal with round-off errors.
+  Thanks @ericman314.
+- Fixed #876: incorrect definition for unit `erg`. Thanks @pjhampton.
+- More informative error message when using single quotes instead of
+  double quotes around a string. Thanks @HarrySarson.
+
+## 2017-05-27, version 3.13.3
+
+- Fixed a bug in function `intersection` of line and plane.
+  Thanks @viclai.
+- Fixed security vulnerabilities.
+
+## 2017-05-26, version 3.13.2
+
+- Disabled function `chain` inside the expression parser for security
+  reasons (it's not needed there anyway).
+- Fixed #856: function `subset` not returning non-primitive scalars
+  from Arrays correctly. (like `math.eval('arr[1]', {arr: [math.bignumber(2)]})`.
+- Fixed #861: physical constants not available in the expression parser.
+
+## 2017-05-12, version 3.13.1
+
+- Fixed creating units with an alias not working within the expression
+  parser.
+- Fixed security vulnerabilities. Thanks Sam.
+
+## 2017-05-12, version 3.13.0
+
+- Command line application can now evaluate inline expressions
+  like `mathjs 1+2`. Thanks @slavaGanzin.
+- Function `derivative` now supports `abs`. Thanks @tetslee.
+- Function `simplify` now supports BigNumbers. Thanks @tetslee.
+- Prevent against endless loops in `simplify`. Thanks @tetslee.
+- Fixed #813: function `simplify` converting small numbers to inexact
+  Fractions. Thanks @tetslee.
+- Fixed #838: Function `simplify` now supports constants like `e`.
+  Thanks @tetslee.
+
+## 2017-05-05, version 3.12.3
+
+- Fixed security vulnerabilities. Thanks Dan and Sam.
+
+## 2017-04-30, version 3.12.2
+
+- Added a rocket trajectory optimization example.
+
+## 2017-04-24, version 3.12.1
+
+- Fixed #804
+  - Improved handling of powers of `Infinity`. Thanks @HarrySarson.
+  - Fixed wrong formatting of complex NaN.
+- Fixed security vulnerabilities in the expression parser.
+  Thanks Sam and Dan.
+
+## 2017-04-17, version 3.12.0
+
+- Implemented QR decomposition, function `math.qr`. Thanks @HarrySarson.
+- Fixed #824: Calling `math.random()` freezes IE and node.js.
+
+## 2017-04-08, version 3.11.5
+
+- More security measures in the expression parser.
+  WARNING: the behavior of the expression parser is now more strict,
+  some undocumented features may not work any longer.
+  - Accessing and assigning properties is now only allowed on plain
+    objects, not on classes, arrays, and functions anymore.
+  - Accessing methods is restricted to a set of known, safe methods.
+
+## 2017-04-03, version 3.11.4
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+## 2017-04-03, version 3.11.3
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+## 2017-04-03, version 3.11.2
+
+- Fixed a security vulnerability in the expression parser. Thanks @xfix.
+
+## 2017-04-02, version 3.11.1
+
+- Fixed security vulnerabilities in the expression parser.
+  Thanks Joe Vennix and @xfix.
+
+## 2017-04-02, version 3.11.0
+
+- Implemented method Unit.toSI() to convert a unit to base SI units.
+  Thanks @ericman314.
+- Fixed #821, #822: security vulnerabilities in the expression parser.
+  Thanks @comex and @xfix.
+
+## 2017-03-31, version 3.10.3
+
+- More security fixes related to the ones fixed in `v3.10.2`.
+
+## 2017-03-31, version 3.10.2
+
+- Fixed a security vulnerability in the expression parser allowing
+  execution of arbitrary JavaScript. Thanks @CapacitorSet and @denvit.
+
+## 2017-03-26, version 3.10.1
+
+- Fixed `xgcd` for negative values. Thanks @litmit.
+- Fixed #807: function transform of existing functions not being removed when
+  overriding such a function.
+
+## 2017-03-05, version 3.10.0
+
+- Implemented function `reshape`. Thanks @patgrasso and @ericman314.
+- Implemented configuration option `seedRandom` for deterministic random
+  numbers. Thanks @morsecodist.
+- Small fixes in the docs. Thanks @HarrySarson.
+- Dropped support for component package manager (which became deprecated about
+  one and a half year ago).
+
+## 2017-02-22, version 3.9.3
+
+- Fixed #797: issue with production builds of React Native projects.
+- Fixed `math.round` not accepting inputs `NaN`, `Infinity`, `-Infinity`.
+- Upgraded all dependencies.
+
+## 2017-02-16, version 3.9.2
+
+- Fixed #795: Parse error in case of a multi-line expression with just comments.
+
+## 2017-02-06, version 3.9.1
+
+- Fixed #789: Math.js not supporting conversion of `string` to `BigNumber`,
+  `Fraction`, or `Complex` number.
+- Fixed #790: Expression parser did not pass function arguments of enclosing
+  functions via `scope` to functions having `rawArgs = true`.
+- Small fixes in the docs. Thanks @HarrySarson.
+
+## 2017-01-23, version 3.9.0
+
+- Implemented support for algebra: powerful new functions `simplify` and
+  `derivative`. Thanks @ericman314, @tetslee, and @BigFav.
+- Implemented Kronecker Product `kron`. Thanks @adamisntdead.
+- Reverted `FunctionNode` not accepting a string as function name anymore.
+- Fixed #765: `FunctionAssignmentNode.toString()` returning a string
+  incompatible with the function assignment syntax.
+
+## 2016-12-15, version 3.8.1
+
+- Implemented function `mad` (median absolute deviation). Thanks @ruhleder.
+- Fixed #762: expression parser failing to invoke a function returned
+  by a function.
+
+## 2016-11-18, version 3.8.0
+
+- Functions `add` and `multiply` now accept more than two arguments. See #739.
+- `OperatorNode` now supports more than two arguments. See #739. Thanks @FSMaxB.
+- Implemented a method `Node.cloneDeep` for the expression nodes. See #745.
+- Fixed a bug in `Node.clone()` not cloning implicit multiplication correctly.
+  Thanks @FSMaxB.
+- Fixed #737: Improved algorithm determining the best prefix for units.
+  It will now retain the original unit like `1 cm` when close enough,
+  instead of returning `10 mm`. Thanks @ericman314.
+- Fixed #732: Allow letter-like unicode characters like Ohm `\u2126`.
+- Fixed #749: Units `rad`, `deg`, and `grad` can now have prefixes like `millirad`.
+- Some fixes in the docs and comments of examples. Thanks @HarrySarson.
+
+## 2016-11-05, version 3.7.0
+
+- Implemented method `Node.equals(other)` for all nodes of the expression parser.
+- Implemented BigNumber support in function `arg()`.
+- Command Line Interface loads faster.
+- Implicit conversions between Fractions and BigNumbers throw a neat error now
+  (See #710).
+
+## 2016-10-21, version 3.6.0
+
+- Implemented function `erf()`. THanks @patgrasso.
+- Extended function `cross()` to support n-d vectors. Thanks @patgrasso.
+- Extended function `pickRandom` with the option to pick multiple values from
+  an array and give the values weights: `pickRandom(possibles, number, weights)`.
+  Thanks @woylie.
+- Parser now exposes test functions like `isAlpha` which can be replaced in
+  order to adjust the allowed characters in variables names (See #715).
+- Fixed #727: Parser not throwing an error for invalid implicit multiplications
+  like `-2 2` and `2^3 4` (right after the second value of an operator).
+- Fixed #688: Describe allowed variable names in the docs.
+
+## 2016-09-21, version 3.5.3
+
+- Some more fixes regarding numbers ending with a decimal mark (like `2.`).
+
+## 2016-09-20, version 3.5.2
+
+- Fixed numbers ending with a decimal mark (like `2.`) not being supported by
+  the parser, solved the underlying ambiguity in the parser. See #707, #711.
+
+## 2016-09-12, version 3.5.1
+
+- Removed a left over console.log statement. Thanks @eknkc.
+
+## 2016-09-07, version 3.5.0
+
+- Comments of expressions are are now stored in the parsed nodes. See #690.
+- Fixed function `print` not accepting an Object with formatting options as
+  third parameter Thanks @ThomasBrierley.
+- Fixed #707: The expression parser no longer accepts numbers ending with a dot
+  like `2.`.
+
+## 2016-08-08, version 3.4.1
+
+- Fixed broken bundle files (`dist/math.js`, `dist/math.min.js`).
+- Fixed some layout issues in the function reference docs.
+
+## 2016-08-07, version 3.4.0
+
+- Implemented support for custom units using `createUnit`. Thanks @ericman314.
+- Implemented function `splitUnits`. Thanks @ericman314.
+- Implemented function `isPrime`. Thanks @MathBunny.
+
+## 2016-07-05, version 3.3.0
+
+- Implemented function `isNaN`.
+- Function `math.filter` now passes three arguments to the callback function:
+  value, index, and array.
+- Removed the check on the number of arguments from functions defined in the
+  expression parser (see #665).
+- Fixed #665: functions `map`, `forEach`, and `filter` now invoke callbacks
+  which are a typed-function with the correct number of arguments.
+
+## 2016-04-26, version 3.2.1
+
+- Fixed #651: unable to perform calculations on "Unit-less" units.
+- Fixed matrix.subset mutating the replacement matrix when unsqueezing it.
+
+## 2016-04-16, version 3.2.0
+
+- Implemented #644: method `Parser.getAll()` to retrieve all defined variables.
+- Upgraded dependencies (decimal.js@5.0.8, fraction.js@3.3.1,
+  typed-function@0.10.4).
+- Fixed #601: Issue with unnamed typed-functions by upgrading to
+  typed-function v0.10.4.
+- Fixed #636: More strict `toTex` templates, reckon with number of arguments.
+- Fixed #641: Bug in expression parser parsing implicit multiplication with
+  wrong precedence in specific cases.
+- Fixed #645: Added documentation about `engineering` notation of function
+  `math.format`.
+
+## 2016-04-03, version 3.1.4
+
+- Using ES6 Math functions like `Math.sinh`, `Math.cbrt`, `Math.sign`, etc when
+  available.
+- Fixed #631: unit aliases `weeks`, `months`, and `years` where missing.
+- Fixed #632: problem with escaped backslashes at the end of strings.
+- Fixed #635: `Node.toString` options where not passed to function arguments.
+- Fixed #629: expression parser throws an error when passing a number with
+  decimal exponent instead of parsing them as implicit multiplication.
+- Fixed #484, #555: inaccuracy of `math.sinh` for values between -1 and 1.
+- Fixed #625: Unit `in` (`inch`) not always working due to ambiguity with
+  the operator `a in b` (alias of `a to b`).
+
+## 2016-03-24, version 3.1.3
+
+- Fix broken bundle.
+
+## 2016-03-24, version 3.1.2
+
+- Fix broken npm release.
+
+## 2016-03-24, version 3.1.1
+
+- Fixed #621: a bug in parsing implicit multiplications like `(2)(3)+4`.
+- Fixed #623: `nthRoot` of zero with a negative root returned `0` instead of
+  `Infinity`.
+- Throw an error when functions `min`, `max`, `mean`, or `median` are invoked
+  with multiple matrices as arguments (see #598).
+
+## 2016-03-19, version 3.1.0
+
+- Hide multiplication operator by default when outputting `toTex` and `toString`
+  for implicit multiplications. Implemented and option to output the operator.
+- Implemented unit `kip` and alias `kips`. Thanks @hgupta9.
+- Added support for prefixes for units `mol` and `mole`. Thanks @stu-blair.
+- Restored support for implicit multiplications like `2(3+4)` and `(2+3)(4+5)`.
+- Some improvements in the docs.
+- Added automatic conversions from `boolean` and `null` to `Fraction`,
+  and conversions from `Fraction` to `Complex`.
+
+## 2016-03-04, version 3.0.0
+
+### breaking changes
+
+- More restricted support for implicit multiplication in the expression
+  parser: `(...)(...)` is now evaluated as a function invocation,
+  and `[...][...]` as a matrix subset.
+- Matrix multiplication no longer squeezes scalar outputs to a scalar value,
+  but leaves them as they are: a vector or matrix containing a single value.
+  See #529.
+- Assignments in the expression parser now return the assigned value rather
+  than the created or updated object (see #533). Example:
+
+  ```
+  A = eye(3)
+  A[1,1] = 2   # this assignment now returns 2 instead of A
+  ```
+
+- Expression parser now supports objects. This involves a refactoring and
+  extension in expression nodes:
+  - Implemented new node `ObjectNode`.
+  - Refactored `AssignmentNode`, `UpdateNode`, and `IndexNode` are refactored
+    into `AccessorNode`, `AssignmentNode`, and `IndexNode` having a different API.
+- Upgraded the used BigNumber library `decimal.js` to v5. Replaced the
+  trigonometric functions of math.js with those provided in decimal.js v5.
+  This can give slightly different behavior qua round-off errors.
+- Replaced the internal `Complex.js` class with the `complex.js` library
+  created by @infusion.
+- Entries in a matrix (typically numbers, BigNumbers, Units, etc) are now
+  considered immutable, they are no longer copied when performing operations on
+  the entries, improving performance.
+- Implemented nearly equal comparison for relational functions (`equal`,
+  `larger`, `smaller`, etc.) when using BigNumbers.
+- Changed the casing of the configuration options `matrix` (`Array` or `Matrix`)
+  and `number` (`number`, `BigNumber`, `Fraction`) such that they now match
+  the type returned by `math.typeof`. Wrong casing gives a console warning but
+  will still work.
+- Changed the default config value for `epsilon` from `1e-14` to `1e-12`,
+  see #561.
+
+### non-breaking changes
+
+- Extended function `pow` to return the real root for cubic roots of negative
+  numbers. See #525, #482, #567.
+- Implemented support for JSON objects in the expression parser and the
+  function `math.format`.
+- Function `math.fraction` now supports `BigNumber`, and function
+  `math.bignumber` now supports `Fraction`.
+- Expression parser now allows function and/or variable assignments inside
+  accessors and conditionals, like `A[x=2]` or `a > 2 ? b="ok" : b="fail"`.
+- Command line interface:
+  - Outputs the variable name of assignments.
+  - Fixed not rounding BigNumbers to 14 digits like numbers.
+  - Fixed non-working autocompletion of user defined variables.
+- Reorganized and extended docs, added docs on classes and more. Thanks @hgupta9.
+- Added new units `acre`, `hectare`, `torr`, `bar`, `mmHg`, `mmH2O`, `cmH2O`,
+  and added new aliases `acres`, `hectares`, `sqfeet`, `sqyard`, `sqmile`,
+  `sqmiles`, `mmhg`, `mmh2o`, `cmh2o`. Thanks @hgupta9.
+- Fixed a bug in the toString method of an IndexNode.
+- Fixed angle units `deg`, `rad`, `grad`, `cycle`, `arcsec`, and `arcmin` not
+  being defined as BigNumbers when configuring to use BigNumbers.
+
+## 2016-02-03, version 2.7.0
+
+- Added more unit aliases for time: `secs`, `mins`, `hr`, `hrs`. See #551.
+- Added support for doing operations with mixed `Fractions` and `BigNumbers`.
+- Fixed #540: `math.intersect()` returning null in some cases. Thanks @void42.
+- Fixed #546: Cannot import BigNumber, Fraction, Matrix, Array.
+  Thanks @brettjurgens.
+
+## 2016-01-08, version 2.6.0
+
+- Implemented (complex) units `VA` and `VAR`.
+- Implemented time units for weeks, months, years, decades, centuries, and
+  millennia. Thanks @owenversteeg.
+- Implemented new notation `engineering` in function `math.format`.
+  Thanks @johnmarinelli.
+- Fixed #523: In some circumstances, matrix subset returned a scalar instead
+  of the correct subset.
+- Fixed #536: A bug in an internal method used for sparse matrices.
+
+## 2015-12-05, version 2.5.0
+
+- Implemented support for numeric types `Fraction` and `BigNumber` in units.
+- Implemented new method `toNumeric` for units.
+- Implemented new units `arcsec`, `arcsecond`, `arcmin`, `arcminute`.
+  Thanks @devdevdata222.
+- Implemented new unit `Herts` (`Hz`). Thanks @SwamWithTurtles.
+- Fixed #485: Scoping issue with variables both used globally as well as in a
+  function definition.
+- Fixed: Function `number` didn't support `Fraction` as input.
+
+## 2015-11-14, version 2.4.2
+
+- Fixed #502: Issue with `format` in some JavaScript engines.
+- Fixed #503: Removed trailing commas and the use of keyword `import` as
+  property, as this gives issues with old JavaScript engines.
+
+## 2015-10-29, version 2.4.1
+
+- Fixed #480: `nthRoot` not working on Internet Explorer (up to IE11).
+- Fixed #490: `nthRoot` returning an error for negative values like
+  `nthRoot(-2, 3)`.
+- Fixed #489: an issue with initializing a sparse matrix without data.
+  Thanks @Retsam.
+- Fixed: #493: function `combinations` did not throw an exception for
+  non-integer values of `k`.
+- Fixed: function `import` did not override typed functions when the option
+  override was set true.
+- Fixed: added functions `math.sparse` and `math.index` to the reference docs,
+  they where missing.
+- Fixed: removed memoization from `gamma` and `factorial` functions, this
+  could blow up memory.
+
+## 2015-10-09, version 2.4.0
+
+- Added support in the expression parser for mathematical alphanumeric symbols
+  in the expression parser: unicode range \u{1D400} to \u{1D7FF} excluding
+  invalid code points.
+- Extended function `distance` with more signatures. Thanks @kv-kunalvyas.
+- Fixed a bug in functions `sin` and `cos`, which gave wrong results for
+  BigNumber integer values around multiples of tau (i.e. `sin(bignumber(7))`).
+- Fixed value of unit `stone`. Thanks @Esvandiary for finding the error.
+
+## 2015-09-19, version 2.3.0
+
+- Implemented function `distance`. Thanks @devanp92.
+- Implemented support for Fractions in function `lcm`. Thanks @infusion.
+- Implemented function `cbrt` for numbers, complex numbers, BigNumbers, Units.
+- Implemented function `hypot`.
+- Upgraded to fraction.js v3.0.0.
+- Fixed #450: issue with non sorted index in sparse matrices.
+- Fixed #463, #322: inconsistent handling of implicit multiplication.
+- Fixed #444: factorial of infinity not returning infinity.
+
+## 2015-08-30, version 2.2.0
+
+- Units with powers (like `m^2` and `s^-1`) now output with the best prefix.
+- Implemented support for units to `abs`, `cube`, `sign`, `sqrt`, `square`.
+  Thanks @ericman314.
+- Implemented function `catalan` (Combinatorics). Thanks @devanp92.
+- Improved the `canDefineProperty` check to return false in case of IE8, which
+  has a broken implementation of `defineProperty`. Thanks @golmansax.
+- Fixed function `to` not working in case of a simplified unit.
+- Fixed #437: an issue with row swapping in `lup`, also affecting `lusolve`.
+
+## 2015-08-12, version 2.1.1
+
+- Fixed wrong values of the physical constants `speedOfLight`, `molarMassC12`,
+  and `magneticFluxQuantum`. Thanks @ericman314 for finding two of them.
+
+## 2015-08-11, version 2.1.0
+
+- Implemented derived units (like `110 km/h in m/s`). Thanks @ericman314.
+- Implemented support for electric units. Thanks @ericman314.
+- Implemented about 50 physical constants like `speedOfLight`, `gravity`, etc.
+- Implemented function `kldivergence` (Kullback-Leibler divergence).
+  Thanks @saromanov.
+- Implemented function `mode`. Thanks @kv-kunalvyas.
+- Added support for unicode characters in the expression parser: greek letters
+  and latin letters with accents. See #265.
+- Internal functions `Unit.parse` and `Complex.parse` now throw an Error
+  instead of returning null when passing invalid input.
+
+## 2015-07-29, version 2.0.1
+
+- Fixed operations with mixed fractions and numbers be converted to numbers
+  instead of fractions.
+
+## 2015-07-28, version 2.0.0
+
+- Large internal refactoring:
+  - performance improvements.
+  - allows to create custom bundles
+  - functions are composed using `typed-function` and are extensible
+- Implemented support for fractions, powered by the library `fraction.js`.
+- Implemented matrix LU decomposition with partial pivoting and a LU based
+  linear equations solver (functions `lup` and `lusolve`). Thanks @rjbaucells.
+- Implemented a new configuration option `predictable`, which can be set to
+  true in order to ensure predictable function output types.
+- Implemented function `intersect`. Thanks @kv-kunalvyas.
+- Implemented support for adding `toTex` properties to custom functions.
+  Thanks @FSMaxB.
+- Implemented support for complex values to `nthRoot`. Thanks @gangachris.
+- Implemented util functions `isInteger`, `isNegative`, `isNumeric`,
+  `isPositive`, and `isZero`.
+
+### breaking changes
+
+- String input is now converted to numbers by default for all functions.
+- Adding two strings will no longer concatenate them, but will convert the
+  strings to numbers and add them.
+- Function `index` does no longer accept an array `[start, end, step]`, but
+  instead accepts an array with arbitrary index values. It also accepts
+  a `Range` object as input.
+- Function `typeof` no longer returns lower case names, but now returns lower
+  case names for primitives (like `number`, `boolean`, `string`), and
+  upper-camel-case for non-primitives (like `Array`, `Complex`, `Function`).
+- Function `import` no longer supports a module name as argument. Instead,
+  modules can be loaded using require: `math.import(require('module-name'))`.
+- Function `import` has a new option `silent` to ignore errors, and throws
+  errors on duplicates by default.
+- Method `Node.compile()` no longer needs `math` to be passed as argument.
+- Reintroduced method `Node.eval([scope])`.
+- Function `sum` now returns zero when input is an empty array. Thanks @FSMAxB.
+- The size of Arrays is no longer validated. Matrices will validate this on
+  creation.
+
+## 2015-07-12, version 1.7.1
+
+- Fixed #397: Inaccuracies in nthRoot for very large values, and wrong results
+  for very small values. (backported from v2)
+- Fixed #405: Parser throws error when defining a function in a multiline
+  expression.
+
+## 2015-05-31, version 1.7.0
+
+- Implemented function `quantileSeq` and `partitionSelect`. Thanks @BigFav.
+- Implemented functions `stirlingS2`, `bellNumbers`, `composition`, and
+  `multinomial`. Thanks @devanp92.
+- Improved the performance of `median` (see #373). Thanks @BigFav.
+- Extended the command line interface with a `mode` option to output either
+  the expressions result, string representation, or tex representation.
+  Thanks @FSMaxB.
+- Fixed #309: Function median mutating the input matrix. Thanks @FSMaxB.
+- Fixed `Node.transform` not recursing over replaced parts of the
+  node tree (see #349).
+- Fixed #381: issue in docs of `randomInt`.
+
+## 2015-04-22, version 1.6.0
+
+- Improvements in `toTex`. Thanks @FSMaxB.
+- Fixed #328: `abs(0 + 0i)` evaluated to `NaN`.
+- Fixed not being able to override lazy loaded constants.
+
+## 2015-04-09, version 1.5.2
+
+- Fixed #313: parsed functions did not handle recursive calls correctly.
+- Fixed #251: binary prefix and SI prefix incorrectly used for byte. Now
+  following SI standards (`1 KiB == 1024 B`, `1 kB == 1000 B`).
+- Performance improvements in parsed functions.
+
+## 2015-04-08, version 1.5.1
+
+- Fixed #316: a bug in rounding values when formatting.
+- Fixed #317, #319: a bug in formatting negative values.
+
+## 2015-03-28, version 1.5.0
+
+- Added unit `stone` (6.35 kg).
+- Implemented support for sparse matrices. Thanks @rjbaucells.
+- Implemented BigNumber support for function `atan2`. Thanks @BigFav.
+- Implemented support for custom LaTeX representations. Thanks @FSMaxB.
+- Improvements and bug fixes in outputting parentheses in `Node.toString` and
+  `Node.toTex` functions. Thanks @FSMaxB.
+- Fixed #291: function `format` sometimes returning exponential notation when
+  it should return a fixed notation.
+
+## 2015-02-28, version 1.4.0
+
+- Implemented trigonometric functions:
+  `acosh`, `acoth`, `acsch`, `asech`, `asinh`, `atanh`, `acot`, `acsc`, `asec`.
+  Thanks @BigFav.
+- Added BigNumber support for functions: `cot`, `csc`, `sec`, `coth`,
+  `csch`, `sech`. Thanks @BigFav.
+- Implemented support for serialization and deserialization of math.js data
+  types.
+- Fixed the calculation of `norm()` and `abs()` for large complex numbers.
+  Thanks @rjbaucells.
+- Fixed #281: improved formatting complex numbers. Round the real or imaginary
+  part to zero when the difference is larger than the configured precision.
+
+## 2015-02-09, version 1.3.0
+
+- Implemented BigNumber implementations of most trigonometric functions: `sin`,
+  `cos`, `tan`, `asin`, `acos`, `atan`, `cosh`, `sinh`, `tanh`. Thanks @BigFav.
+- Implemented function `trace`. Thanks @pcorey.
+- Faster loading of BigNumber configuration with a high precision by lazy
+  loading constants like `pi` and `e`.
+- Fixed constants `NaN` and `Infinity` not being BigNumber objects when
+  BigNumbers are configured.
+- Fixed missing parentheses in the `toTex` representation of function
+  `permutations`.
+- Some minor fixes in the docs. Thanks @KenanY.
+
+## 2014-12-25, version 1.2.0
+
+- Support for bitwise operations `bitAnd`, `bitNot`, `bitOr`, `bitXor`,
+  `leftShift`, `rightArithShift`, and `rightLogShift`. Thanks @BigFav.
+- Support for boolean operations `and`, `not`, `or`, `xor`. Thanks @BigFav.
+- Support for `gamma` function. Thanks @BigFav.
+- Converting a unit without value will now result in a unit *with* value,
+  i.e. `inch in cm` will return `2.54 cm` instead of `cm`.
+- Improved accuracy of `sinh` and complex `cos` and `sin`. Thanks @pavpanchekha.
+- Renamed function `select` to `chain`. The old function `select` will remain
+  functional until math.js v2.0.
+- Upgraded to decimal.js v4.0.1 (BigNumber library).
+
+## 2014-11-22, version 1.1.1
+
+- Fixed Unit divided by Number returning zero.
+- Fixed BigNumber downgrading to Number for a negative base in `pow`.
+- Fixed some typos in error messaging (thanks @andy0130tw) and docs.
+
+## 2014-11-15, version 1.1.0
+
+- Implemented functions `dot` (dot product), `cross` (cross product), and
+  `nthRoot`.
+- Officially opened up the API of expression trees:
+  - Documented the API.
+  - Implemented recursive functions `clone`, `map`, `forEach`, `traverse`,
+    `transform`, and `filter` for expression trees.
+  - Parameter `index` in the callbacks of `map` and `forEach` are now cloned
+    for every callback.
+  - Some internal refactoring inside nodes to make the API consistent:
+    - Renamed `params` to `args` and vice versa to make things consistent.
+    - Renamed `Block.nodes` to `Block.blocks`.
+    - `FunctionNode` now has a `name: string` instead of a `symbol: SymbolNode`.
+    - Changed constructor of `RangeNode` to
+      `new RangeNode(start: Node, end: Node [, step: Node])`.
+    - Nodes for a `BlockNode` must now be passed via the constructor instead
+      of via a function `add`.
+- Fixed `2e` giving a syntax error instead of being parsed as `2 * e`.
+
+## 2014-09-12, version 1.0.1
+
+- Disabled array notation for ranges in a matrix index in the expression parser
+  (it is confusing and redundant there).
+- Fixed a regression in the build of function subset not being able to return
+  a scalar.
+- Fixed some missing docs and broken links in the docs.
+
+## 2014-09-04, version 1.0.0
+
+- Implemented a function `filter(x, test)`.
+- Removed `math.distribution` for now, needs some rethinking.
+- `math.number` can convert units to numbers (requires a second argument)
+- Fixed some precedence issues with the range and conversion operators.
+- Fixed an zero-based issue when getting a matrix subset using an index
+  containing a matrix.
+
+## 2014-08-21, version 0.27.0
+
+- Implemented functions `sort(x [, compare])` and `flatten(x)`.
+- Implemented support for `null` in all functions.
+- Implemented support for "rawArgs" functions in the expression parser. Raw
+  functions are invoked with unevaluated parameters (nodes).
+- Expressions in the expression parser can now be spread over multiple lines,
+  like '2 +\n3'.
+- Changed default value of the option `wrap` of function `math.import` to false.
+- Changed the default value for new entries in a resized matrix when to zero.
+  To leave new entries uninitialized, use the new constant `math.uninitialized`
+  as default value.
+- Renamed transform property from `__transform__` to `transform`, and documented
+  the transform feature.
+- Fixed a bug in `math.import` not applying options when passing a module name.
+- A returned matrix subset is now only squeezed when the `index` consists of
+  scalar values, and no longer for ranges resolving into a single value.
+
+## 2014-08-03, version 0.26.0
+
+- A new instance of math.js can no longer be created like `math([options])`,
+  to prevent side effects from math being a function instead of an object.
+  Instead, use the function `math.create([options])` to create a new instance.
+- Implemented `BigNumber` support for all constants: `pi`, `tau`, `e`, `phi`,
+  `E`, `LN2`, `LN10`, `LOG2E`, `LOG10E`, `PI`, `SQRT1_2`, and `SQRT2`.
+- Implemented `BigNumber` support for functions `gcd`, `xgcd`, and `lcm`.
+- Fixed function `gxcd` returning an Array when math.js was configured
+  as `{matrix: 'matrix'}`.
+- Multi-line expressions now return a `ResultSet` instead of an `Array`.
+- Implemented transforms (used right now to transform one-based indices to
+  zero-based for expressions).
+- When used inside the expression parser, functions `concat`, `min`, `max`,
+  and `mean` expect an one-based dimension number.
+- Functions `map` and `forEach` invoke the callback with one-based indices
+  when used from within the expression parser.
+- When adding or removing dimensions when resizing a matrix, the dimensions
+  are added/removed from the inner side (right) instead of outer side (left).
+- Improved index out of range errors.
+- Fixed function `concat` not accepting a `BigNumber` for parameter `dim`.
+- Function `squeeze` now squeezes both inner and outer singleton dimensions.
+- Output of getting a matrix subset is not automatically squeezed anymore
+  except for scalar output.
+- Renamed `FunctionNode` to `FunctionAssignmentNode`, and renamed `ParamsNode`
+  to `FunctionNode` for more clarity.
+- Fixed broken auto completion in CLI.
+- Some minor fixes.
+
+## 2014-07-01, version 0.25.0
+
+- The library now immediately returns a default instance of mathjs, there is
+  no need to instantiate math.js in a separate step unless one ones to set
+  configuration options:
+
+        // instead of:
+        var mathjs = require('mathjs'),  // load math.js
+            math = mathjs();             // create an instance
+
+        // just do:
+        var math = require('mathjs');
+- Implemented support for implicit multiplication, like `math.eval('2a', {a:3})`
+  and `math.eval('(2+3)(1-3)')`. This changes behavior of matrix indexes as
+  well: an expression like `[...][...]` is not evaluated as taking a subset of
+  the first matrix, but as an implicit multiplication of two matrices.
+- Removed utility function `ifElse`. This function is redundant now the
+  expression parser has a conditional operator `a ? b : c`.
+- Fixed a bug with multiplying a number with a temperature,
+  like `math.eval('10 * celsius')`.
+- Fixed a bug with symbols having value `undefined` not being evaluated.
+
+## 2014-06-20, version 0.24.1
+
+- Something went wrong with publishing on npm.
+
+## 2014-06-20, version 0.24.0
+
+- Added constant `null`.
+- Functions `equal` and `unequal` support `null` and `undefined` now.
+- Function `typeof` now recognizes regular expressions as well.
+- Objects `Complex`, `Unit`, and `Help` now return their string representation
+  when calling `.valueOf()`.
+- Changed the default number of significant digits for BigNumbers from 20 to 64.
+- Changed the behavior of the conditional operator (a ? b : c) to lazy
+  evaluating.
+- Fixed imported, wrapped functions not accepting `null` and `undefined` as
+  function arguments.
+
+## 2014-06-10, version 0.23.0
+
+- Renamed some functions (everything now has a logical, camel case name):
+  - Renamed functions `edivide`, `emultiply`, and `epow` to `dotDivide`,
+    `dotMultiply`, and `dotPow` respectively.
+  - Renamed functions `smallereq` and `largereq` to `smallerEq` and `largerEq`.
+  - Renamed function `unary` to `unaryMinus` and added support for strings.
+- `end` is now a reserved keyword which cannot be used as function or symbol
+  name in the expression parser, and is not allowed in the scope against which
+  an expression is evaluated.
+- Implemented function `unaryPlus` and unary plus operator.
+- Implemented function `deepEqual` for matrix comparisons.
+- Added constant `phi`, the golden ratio (`phi = 1.618...`).
+- Added constant `version`, returning the version number of math.js as string.
+- Added unit `drop` (`gtt`).
+- Fixed not being able to load math.js using AMD/require.js.
+- Changed signature of `math.parse(expr, nodes)` to `math.parse(expr, options)`
+  where `options: {nodes: Object.<String, Node>}`
+- Removed matrix support from conditional function `ifElse`.
+- Removed automatic assignment of expression results to variable `ans`.
+  This functionality can be restored by pre- or postprocessing every evaluation,
+  something like:
+
+        function evalWithAns (expr, scope) {
+          var ans = math.eval(expr, scope);
+          if (scope) {
+            scope.ans = ans;
+          }
+          return ans;
+        }
+
+## 2014-05-22, version 0.22.0
+
+- Implemented support to export expressions to LaTeX. Thanks Niels Heisterkamp
+  (@nheisterkamp).
+- Output of matrix multiplication is now consistently squeezed.
+- Added reference documentation in the section /docs/reference.
+- Fixed a bug in multiplying units without value with a number (like `5 * cm`).
+- Fixed a bug in multiplying two matrices containing vectors (worked fine for
+  arrays).
+- Fixed random functions not accepting Matrix as input, and always returning
+  a Matrix as output.
+
+## 2014-05-13, version 0.21.1
+
+- Removed `crypto` library from the bundle.
+- Deprecated functions `Parser.parse` and `Parser.compile`. Use
+  `math.parse` and `math.compile` instead.
+- Fixed function `add` not adding strings and matrices element wise.
+- Fixed parser not being able to evaluate an exponent followed by a unary minus
+  like `2^-3`, and a transpose followed by an index like `[3]'[1]`.
+
+## 2014-04-24, version 0.21.0
+
+- Implemented trigonometric hyperbolic functions `cosh`, `coth`, `csch`,
+  `sech`, `sinh`, `tanh`. Thanks Rogelio J. Baucells (@rjbaucells).
+- Added property `type` to all expression nodes in an expression tree.
+- Fixed functions `log`, `log10`, `pow`, and `sqrt` not supporting complex
+  results from BigNumber input (like `sqrt(bignumber(-4))`).
+
+## 2014-04-16, version 0.20.0
+
+- Switched to module `decimal.js` for BigNumber support, instead of
+  `bignumber.js`.
+- Implemented support for polar coordinates to the `Complex` datatype.
+  Thanks Finn Pauls (@finnp).
+- Implemented BigNumber support for functions `exp`, `log`, and `log10`.
+- Implemented conditional operator `a ? b : c` in expression parser.
+- Improved floating point comparison: the functions now check whether values
+  are nearly equal, against a configured maximum relative difference `epsilon`.
+  Thanks Rogelio J. Baucells (@rjbaucells).
+- Implemented function `norm`. Thanks Rogelio J. Baucells (@rjbaucells).
+- Improved function `ifElse`, is now specified for special data types too.
+- Improved function `det`. Thanks Bryan Cuccioli (@bcuccioli).
+- Implemented `BigNumber` support for functions `det` and `diag`.
+- Added unit alias `lbs` (pound mass).
+- Changed configuration option `decimals` to `precision` (applies to BigNumbers
+  only).
+- Fixed support for element-wise comparisons between a string and a matrix.
+- Fixed: expression parser now trows IndexErrors with one-based indices instead
+  of zero-based.
+- Minor bug fixes.
+
+## 2014-03-30, version 0.19.0
+
+- Implemented functions `compare`, `sum`, `prod`, `var`, `std`, `median`.
+- Implemented function `ifElse` Thanks @mtraynham.
+- Minor bug fixes.
+
+## 2014-02-15, version 0.18.1
+
+- Added unit `feet`.
+- Implemented function `compile` (shortcut for parsing and then compiling).
+- Improved performance of function `pow` for matrices. Thanks @hamadu.
+- Fixed broken auto completion in the command line interface.
+- Fixed an error in function `combinations` for large numbers, and
+  improved performance of both functions `combinations` and `permutations`.
+
+## 2014-01-18, version 0.18.0
+
+- Changed matrix index notation of expression parser from round brackets to
+  square brackets, for example `A[1, 1:3]` instead of `A(1, 1:3)`.
+- Removed need to use the `function` keyword for function assignments in the
+  expression parser, you can define a function now like `f(x) = x^2`.
+- Implemented a compilation step in the expression parser: expressions are
+  compiled into JavaScript, giving much better performance (easily 10x as fast).
+- Renamed unit conversion function and operator `in` to `to`. Operator `in` is
+  still available in the expression parser as an alias for `to`. Added unit
+  `in`, an abbreviation for `inch`. Thanks Elijah Insua (@tmpvar).
+- Added plurals and aliases for units.
+- Implemented an argument `includeEnd` for function `range` (false by default).
+- Ranges in the expression parser now support big numbers.
+- Implemented functions `permutations` and `combinations`.
+  Thanks Daniel Levin (@daniel-levin).
+- Added lower case abbreviation `l` for unit litre.
+
+## 2013-12-19, version 0.17.1
+
+- Fixed a bug with negative temperatures.
+- Fixed a bug with prefixes of units squared meter `m2` and cubic meter `m3`.
+
+## 2013-12-12, version 0.17.0
+
+- Renamed and flattened configuration settings:
+  - `number.defaultType` is now `number`.
+  - `number.precision` is now `decimals`.
+  - `matrix.defaultType` is now `matrix`.
+- Function `multiply` now consistently outputs a complex number on complex input.
+- Fixed `mod` and `in` not working as function (only as operator).
+- Fixed support for old browsers (IE8 and older), compatible when using es5-shim.
+- Fixed support for Java's ScriptEngine.
+
+## 2013-11-28, version 0.16.0
+
+- Implemented BigNumber support for arbitrary precision calculations.
+  Added settings `number.defaultType` and `number.precision` to configure
+  big numbers.
+- Documentation is extended.
+- Removed utility functions `isScalar`, `toScalar`, `isVector`, `toVector`
+  from `Matrix` and `Range`. Use `math.squeeze` and `math.size` instead.
+- Implemented functions `get` and `set` on `Matrix`, for easier and faster
+  retrieval/replacement of elements in a matrix.
+- Implemented function `resize`, handling matrices, scalars, and strings.
+- Functions `ones` and `zeros` now return an empty matrix instead of a
+  number 1 or 0 when no arguments are provided.
+- Implemented functions `min` and `max` for `Range` and `Index`.
+- Resizing matrices now leaves new elements undefined by default instead of
+  filling them with zeros. Function `resize` now has an extra optional
+  parameter `defaultValue`.
+- Range operator `:` in expression parser has been given a higher precedence.
+- Functions don't allow arguments of unknown type anymore.
+- Options be set when constructing a math.js instance or using the new function
+  `config(options`. Options are no longer accessible via `math.options`.
+- Renamed `scientific` notation to `exponential` in function `format`.
+- Function `format` outputs exponential notation with positive exponents now
+  always with `+` sign, so outputs `2.1e+3` instead of `2.1e3`.
+- Fixed function `squeeze` not being able squeeze into a scalar.
+- Some fixes and performance improvements in the `resize` and `subset`
+  functions.
+- Function `size` now adheres to the option `matrix.defaultType` for scalar
+  input.
+- Minor bug fixes.
+
+## 2013-10-26, version 0.15.0
+
+- Math.js must be instantiated now, static calls are no longer supported. Usage:
+  - node.js: `var math = require('mathjs')();`
+  - browser: `var math = mathjs();`
+- Implemented support for multiplying vectors with matrices.
+- Improved number formatting:
+  - Function `format` now support various options: precision, different
+    notations (`fixed`, `scientific`, `auto`), and more.
+  - Numbers are no longer rounded to 5 digits by default when formatted.
+  - Implemented a function `format` for `Matrix`, `Complex`, `Unit`, `Range`,
+    and `Selector` to format using options.
+  - Function `format` does only stringify values now, and has a new parameter
+    `precision` to round to a specific number of digits.
+  - Removed option `math.options.precision`,
+    use `math.format(value [, precision])` instead.
+  - Fixed formatting numbers as scientific notation in some cases returning
+    a zero digit left from the decimal point. (like "0.33333e8" rather than
+    "3.3333e7"). Thanks @husayt.
+- Implemented a function `print` to interpolate values in a template string,
+  this functionality was moved from the function `format`.
+- Implemented statistics function `mean`. Thanks Guillermo Indalecio Fernandez
+  (@guillermobox).
+- Extended and changed `max` and `min` for multi dimensional matrices: they now
+  return the maximum and minimum of the flattened array. An optional second
+  argument `dim` allows to calculate the `max` or `min` for specified dimension.
+- Renamed option `math.options.matrix.default` to
+  `math.options.matrix.defaultType`.
+- Removed support for comparing complex numbers in functions `smaller`,
+  `smallereq`, `larger`, `largereq`. Complex numbers cannot be ordered.
+
+## 2013-10-08, version 0.14.0
+
+- Introduced an option `math.options.matrix.default` which can have values
+  `matrix` (default) or `array`. This option is used by the functions `eye`,
+  `ones`, `range`, and `zeros`, to determine the type of matrix output.
+- Getting a subset of a matrix will automatically squeeze the resulting subset,
+  setting a subset of a matrix will automatically unsqueeze the given subset.
+- Removed concatenation of nested arrays in the expression parser.
+  You can now input nested arrays like in JavaScript. Matrices can be
+  concatenated using the function `concat`.
+- The matrix syntax `[...]` in the expression parser now creates 1 dimensional
+  matrices by default. `math.eval('[1,2,3,4]')` returns a matrix with
+  size `[4]`, `math.eval('[1,2;3,4]')` returns a matrix with size `[2,2]`.
+- Documentation is restructured and extended.
+- Fixed non working operator `mod` (modulus operator).
+
+## 2013-09-03, version 0.13.0
+
+- Implemented support for booleans in all relevant functions.
+- Implemented functions `map` and `forEach`. Thanks Sebastien Piquemal (@sebpic).
+- All construction functions can be used to convert the type of variables,
+  also element-wise for all elements in an Array or Matrix.
+- Changed matrix indexes of the expression parser to one-based with the
+  upper-bound included, similar to most math applications. Note that on a
+  JavaScript level, math.js uses zero-based indexes with excluded upper-bound.
+- Removed support for scalars in the function `subset`, it now only supports
+  Array, Matrix, and String.
+- Removed the functions `get` and `set` from a selector, they are a duplicate
+  of the function `subset`.
+- Replaced functions `get` and `set` of `Matrix` with a single function
+  `subset`.
+- Some moving around with code and namespaces:
+  - Renamed namespace `math.expr` to `math.expression` (contains Scope, Parser,
+    node objects).
+  - Renamed namespace `math.docs` to `math.expression.docs`.
+  - Moved `math.expr.Selector` to `math.chaining.Selector`.
+- Fixed some edge cases in functions `lcm` and `xgcd`.
+
+## 2013-08-22, version 0.12.1
+
+- Fixed outdated version of README.md.
+- Fixed a broken unit test.
+
+## 2013-08-22, version 0.12.0
+
+- Implemented functions `random([min, max])`, `randomInt([min, max])`,
+  `pickRandom(array)`. Thanks Sebastien Piquemal (@sebpic).
+- Implemented function `distribution(name)`, generating a distribution object
+  with functions `random`, `randomInt`, `pickRandom` for different
+  distributions. Currently supporting `uniform` and `normal`.
+- Changed the behavior of `range` to exclude the upper bound, so `range(1, 4)`
+  now returns `[1, 2, 3]` instead of `[1, 2, 3, 4]`.
+- Changed the syntax of `range`, which is now `range(start, end [, step])`
+  instead of `range(start, [step, ] end)`.
+- Changed the behavior of `ones` and `zeros` to geometric dimensions, for
+  example `ones(3)` returns a vector with length 3, filled with ones, and
+  `ones(3,3)` returns a 2D array with size [3, 3].
+- Changed the return type of `ones` and `zeros`: they now return an Array when
+  arguments are Numbers or an Array, and returns a Matrix when the argument
+  is a Matrix.
+- Change matrix index notation in parser from round brackets to square brackets,
+  for example `A[0, 0:3]`.
+- Removed the feature introduced in v0.10.0 to automatically convert a complex
+  value with an imaginary part equal to zero to a number.
+- Fixed zeros being formatted as null. Thanks @TimKraft.
+
+## 2013-07-23, version 0.11.1
+
+- Fixed missing development dependency
+
+## 2013-07-23, version 0.11.0
+
+- Changed math.js from one-based to zero-based indexes.
+  - Getting and setting matrix subset is now zero-based.
+  - The dimension argument in function `concat` is now zero-based.
+- Improvements in the string output of function help.
+- Added constants `true` and `false`.
+- Added constructor function `boolean`.
+- Fixed function `select` not accepting `0` as input.
+  Thanks Elijah Manor (@elijahmanor).
+- Parser now supports multiple unary minus operators after each other.
+- Fixed not accepting empty matrices like `[[], []]`.
+- Some fixes in the end user documentation.
+
+## 2013-07-08, version 0.10.0
+
+- For complex calculations, all functions now automatically replace results
+  having an imaginary part of zero with a Number. (`2i * 2i` now returns a
+  Number `-4` instead of a Complex `-4 + 0i`).
+- Implemented support for injecting custom node handlers in the parser. Can be
+  used for example to implement a node handler for plotting a graph.
+- Implemented end user documentation and a new `help` function.
+- Functions `size` and `squeeze` now return a Matrix instead of an Array as
+  output on Matrix input.
+- Added a constant tau (2 * pi). Thanks Zak Zibrat (@palimpsests).
+- Renamed function `unaryminus` to `unary`.
+- Fixed a bug in determining node dependencies in function assignments.
+
+## 2013-06-14, version 0.9.1
+
+- Implemented element-wise functions and operators: `emultiply` (`x .* y`),
+  `edivide` (`x ./ y`), `epow` (`x .^ y`).
+- Added constants `Infinity` and `NaN`.
+- Removed support for Workspace to keep the library focused on its core task.
+- Fixed a bug in the Complex constructor, not accepting NaN values.
+- Fixed division by zero in case of pure complex values.
+- Fixed a bug in function multiply multiplying a pure complex value with
+  Infinity.
+
+## 2013-05-29, version 0.9.0
+
+- Implemented function `math.parse(expr [,scope])`. Optional parameter scope can
+  be a plain JavaScript Object containing variables.
+- Extended function `math.expr(expr [, scope])` with an additional parameter
+  `scope`, similar to `parse`. Example: `math.eval('x^a', {x:3, a:2});`.
+- Implemented function `subset`, to get or set a subset from a matrix, string,
+  or other data types.
+- Implemented construction functions number and string (mainly useful inside
+  the parser).
+- Improved function `det`. Thanks Bryan Cuccioli (@bcuccioli).
+- Moved the parse code from prototype math.expr.Parser to function math.parse,
+  simplified Parser a little bit.
+- Strongly simplified the code of Scope and Workspace.
+- Fixed function mod for negative numerators, and added error messages in case
+  of wrong input.
+
+## 2013-05-18, version 0.8.2
+
+- Extended the import function and some other minor improvements.
+- Fixed a bug in merging one dimensional vectors into a matrix.
+- Fixed a bug in function subtract, when subtracting a complex number from a
+  real number.
+
+## 2013-05-10, version 0.8.1
+
+- Fixed an npm warning when installing mathjs globally.
+
+## 2013-05-10, version 0.8.0
+
+- Implemented a command line interface. When math.js is installed globally via
+  npm, the application is available on your system as 'mathjs'.
+- Implemented `end` keyword for index operator, and added support for implicit
+  start and end (expressions like `a(2,:)` and `b(2:end,3:end-1)` are supported
+  now).
+- Function math.eval is more flexible now: it supports variables and multi-line
+  expressions.
+- Removed the read-only option from Parser and Scope.
+- Fixed non-working unequal operator != in the parser.
+- Fixed a bug in resizing matrices when replacing a subset.
+- Fixed a bug in updating a subset of a non-existing variable.
+- Minor bug fixes.
+
+## 2013-05-04, version 0.7.2
+
+- Fixed method unequal, which was checking for equality instead of inequality.
+  Thanks @FJS2.
+
+## 2013-04-27, version 0.7.1
+
+- Improvements in the parser:
+  - Added support for chained arguments.
+  - Added support for chained variable assignments.
+  - Added a function remove(name) to remove a variable from the parsers scope.
+  - Renamed nodes for more consistency and to resolve naming conflicts.
+  - Improved stringification of an expression tree.
+  - Some simplifications in the code.
+  - Minor bug fixes.
+- Fixed a bug in the parser, returning NaN instead of throwing an error for a
+  number with multiple decimal separators like `2.3.4`.
+- Fixed a bug in Workspace.insertAfter.
+- Fixed: math.js now works on IE 6-8 too.
+
+## 2013-04-20, version 0.7.0
+
+- Implemented method `math.eval`, which uses a readonly parser to evaluate
+  expressions.
+- Implemented method `xgcd` (extended eucledian algorithm). Thanks Bart Kiers
+  (@bkiers).
+- Improved math.format, which now rounds values to a maximum number of digits
+  instead of decimals (default is 5 digits, for example `math.format(math.pi)`
+  returns `3.1416`).
+- Added examples.
+- Changed methods square and cube to evaluate matrices element wise (consistent
+  with all other methods).
+- Changed second parameter of method import to an object with options.
+- Fixed method math.typeof on IE.
+- Minor bug fixes and improvements.
+
+## 2013-04-13, version 0.6.0
+
+- Implemented chained operations via method math.select(). For example
+  `math.select(3).add(4).subtract(2).done()` will return `5`.
+- Implemented methods gcd and lcm.
+- Implemented method `Unit.in(unit)`, which creates a clone of the unit with a
+  fixed representation. For example `math.unit('5.08 cm').in('inch')` will
+  return a unit which string representation always is in inch, thus `2 inch`.
+  `Unit.in(unit)` is the same as method `math.in(x, unit)`.
+- Implemented `Unit.toNumber(unit)`, which returns the value of the unit when
+  represented with given unit. For example
+  `math.unit('5.08 cm').toNumber('inch')` returns the number `2`, as the
+  representation of the unit in inches has 2 as value.
+- Improved: method `math.in(x, unit)` now supports a string as second parameter,
+  for example `math.in(math.unit('5.08 cm'), 'inch')`.
+- Split the end user documentation of the parser functions from the source
+  files.
+- Removed function help and the built-in documentation from the core library.
+- Fixed constant i being defined as -1i instead of 1i.
+- Minor bug fixes.
+
+## 2013-04-06, version 0.5.0
+
+- Implemented data types Matrix and Range.
+- Implemented matrix methods clone, concat, det, diag, eye, inv, ones, size,
+  squeeze, transpose, zeros.
+- Implemented range operator `:`, and transpose operator `'` in parser.
+- Changed: created construction methods for easy object creation for all data
+  types and for the parser. For example, a complex value is now created
+  with `math.complex(2, 3)` instead of `new math.Complex(2, 3)`, and a parser
+  is now created with `math.parser()` instead of `new math.parser.Parser()`.
+- Changed: moved all data types under the namespace math.type, and moved the
+  Parser, Workspace, etc. under the namespace math.expr.
+- Changed: changed operator precedence of the power operator:
+  - it is now right associative instead of left associative like most scripting
+    languages. So `2^3^4` is now calculated as `2^(3^4)`.
+  - it has now higher precedence than unary minus most languages, thus `-3^2` is
+    now calculated as `-(3^2)`.
+- Changed: renamed the parsers method 'put' into 'set'.
+- Fixed: method 'in' did not check for units to have the same base.
+
+## 2013-03-16, version 0.4.0
+
+- Implemented Array support for all methods.
+- Implemented Array support in the Parser.
+- Implemented method format.
+- Implemented parser for units, math.Unit.parse(str).
+- Improved parser for complex values math.Complex.parse(str);
+- Improved method help: it now evaluates the examples.
+- Fixed: a scoping issue with the Parser when defining functions.
+- Fixed: method 'typeof' was not working well with minified and mangled code.
+- Fixed: errors in determining the best prefix for a unit.
+
+## 2013-03-09, version 0.3.0
+
+- Implemented Workspace
+- Implemented methods cot, csc, sec.
+- Implemented Array support for methods with one parameter.
+
+## 2013-02-25, version 0.2.0
+
+- Parser, Scope, and expression tree with Nodes implemented.
+- Implemented method import which makes it easy to extend math.js.
+- Implemented methods arg, conj, cube, equal, factorial, im, largereq,
+  log(x, base), log10, mod, re, sign, smallereq, square, unequal.
+
+## 2013-02-18, version 0.1.0
+
+- Reached full compatibility with Javascripts built-in Math library.
+- More functions implemented.
+- Some bugfixes.
+
+## 2013-02-16, version 0.0.2
+
+- All constants of Math implemented, plus the imaginary unit i.
+- Data types Complex and Unit implemented.
+- First set of functions implemented.
+
+## 2013-02-15, version 0.0.1
+
+- First publish of the mathjs package. (package is still empty)
diff --git a/node_modules/mathjs/LICENSE b/node_modules/mathjs/LICENSE
new file mode 100644
index 0000000..9cf8c11
--- /dev/null
+++ b/node_modules/mathjs/LICENSE
@@ -0,0 +1,176 @@
+                               Apache License
+                           Version 2.0, January 2004
+                        https://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/mathjs/NOTICE b/node_modules/mathjs/NOTICE
new file mode 100644
index 0000000..5bd3427
--- /dev/null
+++ b/node_modules/mathjs/NOTICE
@@ -0,0 +1,16 @@
+math.js
+https://github.com/josdejong/mathjs
+
+Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+
+   https://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.
diff --git a/node_modules/mathjs/README.md b/node_modules/mathjs/README.md
new file mode 100644
index 0000000..2811055
--- /dev/null
+++ b/node_modules/mathjs/README.md
@@ -0,0 +1,242 @@
+![math.js](https://raw.githubusercontent.com/josdejong/mathjs/develop/misc/img/mathjs.svg)
+
+[https://mathjs.org](https://mathjs.org)
+
+Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices. Powerful and easy to use.
+
+[![Version](https://img.shields.io/npm/v/mathjs.svg)](https://www.npmjs.com/package/mathjs)
+[![Downloads](https://img.shields.io/npm/dm/mathjs.svg)](https://www.npmjs.com/package/mathjs)
+[![Build Status](https://github.com/josdejong/mathjs/workflows/Node.js%20CI/badge.svg)](https://github.com/josdejong/mathjs/actions)
+[![Maintenance](https://img.shields.io/maintenance/yes/2025.svg)](https://github.com/josdejong/mathjs/graphs/commit-activity)
+[![License](https://img.shields.io/github/license/josdejong/mathjs.svg)](https://github.com/josdejong/mathjs/blob/master/LICENSE)
+[![FOSSA Status](https://app.fossa.io/api/projects/git%2Bgithub.com%2Fjosdejong%2Fmathjs.svg?type=shield)](https://app.fossa.io/projects/git%2Bgithub.com%2Fjosdejong%2Fmathjs?ref=badge_shield)
+[![Codecov](https://codecov.io/gh/josdejong/mathjs/branch/develop/graph/badge.svg)](https://codecov.io/gh/josdejong/mathjs)
+[![Github Sponsor](https://img.shields.io/github/sponsors/josdejong
+)](https://github.com/sponsors/josdejong)
+
+## Features
+
+- Supports numbers, bignumbers, bigints, complex numbers, fractions, units, strings, arrays, and matrices.
+- Is compatible with JavaScript's built-in Math library.
+- Contains a flexible expression parser.
+- Does symbolic computation.
+- Comes with a large set of built-in functions and constants.
+- Can be used as a command line application as well.
+- Runs on any JavaScript engine.
+- Is easily extensible.
+- Open source.
+
+## Usage
+
+Math.js can be used in both node.js and in the browser.
+
+Install math.js using [npm](https://www.npmjs.com/package/mathjs):
+
+    npm install mathjs
+
+Or download mathjs via one of the CDN's listed on the downloads page:
+
+&nbsp;&nbsp;&nbsp;&nbsp;[https://mathjs.org/download.html](https://mathjs.org/download.html#download)
+
+Math.js can be used similar to JavaScript's built-in Math library. Besides that,
+math.js can evaluate
+[expressions](https://mathjs.org/docs/expressions/index.html)
+and supports
+[chained operations](https://mathjs.org/docs/core/chaining.html).
+
+```js
+import {
+  atan2, chain, derivative, e, evaluate, log, pi, pow, round, sqrt
+} from 'mathjs'
+
+// functions and constants
+round(e, 3)                    // 2.718
+atan2(3, -3) / pi              // 0.75
+log(10000, 10)                 // 4
+sqrt(-4)                       // 2i
+pow([[-1, 2], [3, 1]], 2)      // [[7, 0], [0, 7]]
+derivative('x^2 + x', 'x')     // 2 * x + 1
+
+// expressions
+evaluate('12 / (2.3 + 0.7)')   // 4
+evaluate('12.7 cm to inch')    // 5 inch
+evaluate('sin(45 deg) ^ 2')    // 0.5
+evaluate('9 / 3 + 2i')         // 3 + 2i
+evaluate('det([-1, 2; 3, 1])') // -7
+
+// chaining
+chain(3)
+    .add(4)
+    .multiply(2)
+    .done()  // 14
+```
+
+See the [Getting Started](https://mathjs.org/docs/getting_started.html) for a more detailed tutorial.
+
+
+## Browser support
+
+Math.js works on any [ES2020](https://262.ecma-international.org/11.0/) compatible JavaScript engine, including node.js, Chrome, Firefox, Safari, and Edge.
+
+
+## Documentation
+
+- [Getting Started](https://mathjs.org/docs/getting_started.html)
+- [Examples](https://mathjs.org/examples/index.html)
+- [Overview](https://mathjs.org/docs/index.html)
+- [History](https://mathjs.org/history.html)
+
+
+## Build
+
+First clone the project from github:
+
+    git clone git@github.com:josdejong/mathjs.git
+    cd mathjs
+
+Install the project dependencies:
+
+    npm install
+
+Then, the project can be build by executing the build script via npm:
+
+    npm run build
+
+This will build ESM output, CommonJS output, and the bundle math.js
+from the source files and put them in the folder lib.
+
+
+## Develop
+
+When developing new features for mathjs, it is good to be aware of the following background information.
+
+### Code
+
+The code of `mathjs` is written in ES modules, and requires all files to have a real, relative path, meaning the files must have a `*.js` extension. Please configure adding file extensions on auto import in your IDE.
+
+### Architecture
+
+What mathjs tries to achieve is to offer an environment where you can do calculations with mixed data types,
+like multiplying a regular `number` with a `Complex` number or a `BigNumber`, and work with all of those in matrices.
+Mathjs also allows to add a new data type with little effort.
+
+The solution that mathjs uses has two main ingredients:
+
+- **Typed functions**. All functions are created using [`typed-function`](https://github.com/josdejong/typed-function/). This makes it easier to (dynamically) create and extend a single function with new data types, automatically do type conversions on function inputs, etc. So, if you create function multiply for two `number`s, you can extend it with support for multiplying your own data type, say `MyDecimal`. If you define a conversion from `MyDecimal` to `number`, the typed-function will automatically allow you to multiply a `MyDecimal` with a `number`.
+
+- **Dependency injection**. When we have a function `multiply` with support for `MyDecimal`, thanks to the dependency injection, other functions using `multiply` under the hood, like `prod`, will automatically support `MyDecimal` too. This also works the other way around: if you don't need the heavyweight `multiply` (which supports BigNumbers, matrices, etc), and you just need a plain and simple number support, you can use a lightweight implementation of `multiply` just for numbers, and inject that in `prod` and other functions.
+
+At the lowest level, mathjs has immutable factory functions which create immutable functions. The core function `math.create(...)` creates a new instance having functions created from all passed factory functions. A mathjs instance is a collection of created functions. It contains a function like `math.import` to allow extending the instance with new functions, which can then be used in the expression parser.
+
+### Implementing a new function
+
+A common case is to implement a new function. This involves the following steps:
+
+- Implement the function in the right category, for example `./src/function/arithmetic/myNewFunction.js`, where you can replace `arithmetic` with the proper category, and `myNewFunction` with the name of the new function. Add the new function to the index files `./src/factoriesAny.js` and possibly `./src/factoriesNumber.js`.
+- Write documentation on the function in the source code comment of `myNewFunction.js`. This documentation is used to auto generate documentation on the website.
+- Write embedded documentation for the new function in `./src/expression/embeddedDocs/function/arithmetic/myNewFunction.js`. Add the new documentation to the index file `./src/expression/embeddedDocs/embeddedDocs.js`.
+- Write unit tests for the function in `./test/unit-tests/function/arithmetic/myNewFunction.test.js`.
+- Write the necessary TypeScript definitions for the new function in `./types/index.d.ts`, and write tests for it in `./test/typescript-tests/testTypes.ts`. This is described in [./types/EXPLANATION.md](./types/EXPLANATION.md).
+- Ensure the code style is ok by running `npm run lint` (run `npm run format` to fix the code style automatically).
+
+
+### Build scripts
+
+The build script currently generates two types of output:
+
+- **any**, generate entry points to create full versions of all functions
+- **number**: generating and entry points to create lightweight functions just supporting `number`
+
+For each function, an object is generated containing the factory functions of all dependencies of the function. This allows to just load a specific set of functions, and not load or bundle any other functionality. So for example, to just create function `add` you can do `math.create(addDependencies)`.
+
+
+## Test
+
+To execute tests for the library, install the project dependencies once:
+
+    npm install
+
+Then, the tests can be executed:
+
+    npm test
+
+To test the type definitions:
+
+    npm run test:types
+
+Additionally, the tests can be run on FireFox using [headless mode](https://developer.mozilla.org/en-US/Firefox/Headless_mode):
+
+    npm run test:browser
+
+To run the tests remotely on LambdaTest, first set the environment variables `LT_USERNAME` and `LT_ACCESS_KEY` with your username and access key and then execute:
+
+    npm run test:lambdatest
+
+You can separately run the code linter, though it is also executed with `npm test`:
+
+    npm run lint
+
+To automatically fix linting issue, run:
+
+    npm run format
+
+To test code coverage of the tests:
+
+    npm run coverage
+
+To see the coverage results, open the generated report in your browser:
+
+    ./coverage/lcov-report/index.html
+
+
+### Continuous integration testing
+
+Continuous integration tests are run on [Github Actions](https://github.com/josdejong/mathjs/actions) and [LambdaTest](https://www.lambdatest.com) every time a commit is pushed to github. Github Actions runs the tests for different versions of node.js, and LambdaTest runs the tests on all major browsers.
+
+[![LambdaTest](https://raw.github.com/josdejong/mathjs/master/misc/lambdatest.svg)](https://www.lambdatest.com)
+
+Thanks, GitHub Actions and LambdaTest for the generous free hosting of this open source project!
+
+## License
+
+mathjs is published under the Apache 2.0 license:
+
+```
+Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+
+   https://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.
+```
+
+mathjs contains a JavaScript port of the [CSparse](https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source) library, published under the LGPL-2.1+ license:
+
+```
+CSparse: a Concise Sparse matrix package.
+Copyright (c) 2006, Timothy A. Davis.
+http://www.suitesparse.com
+
+--------------------------------------------------------------------------------
+
+CSparse is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+CSparse is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this Module; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+```
diff --git a/node_modules/mathjs/bin/cli.js b/node_modules/mathjs/bin/cli.js
new file mode 100755
index 0000000..fb9d64e
--- /dev/null
+++ b/node_modules/mathjs/bin/cli.js
@@ -0,0 +1,446 @@
+#!/usr/bin/env node
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * Usage:
+ *
+ *     mathjs [scriptfile(s)] {OPTIONS}
+ *
+ * Options:
+ *
+ *     --version, -v       Show application version
+ *     --help,    -h       Show this message
+ *     --tex               Generate LaTeX instead of evaluating
+ *     --string            Generate string instead of evaluating
+ *     --parenthesis=      Set the parenthesis option to
+ *                         either of "keep", "auto" and "all"
+ *
+ * Example usage:
+ *     mathjs                                 Open a command prompt
+ *     mathjs 1+2                             Evaluate expression
+ *     mathjs script.txt                      Run a script file
+ *     mathjs script1.txt script2.txt         Run two script files
+ *     mathjs script.txt > results.txt        Run a script file, output to file
+ *     cat script.txt | mathjs                Run input stream
+ *     cat script.txt | mathjs > results.txt  Run input stream, output to file
+ *
+ * @license
+ * Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+ *
+ * https://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.
+ */
+
+const fs = require('fs')
+const path = require('path')
+const { createEmptyMap } = require('../lib/cjs/utils/map.js')
+let scope = createEmptyMap()
+
+const PRECISION = 14 // decimals
+
+/**
+ * "Lazy" load math.js: only require when we actually start using it.
+ * This ensures the cli application looks like it loads instantly.
+ * When requesting help or version number, math.js isn't even loaded.
+ * @return {{ evalute: function, parse: function, math: Object }}
+ */
+function getMath () {
+  const { create, all } = require('../lib/browser/math.js')
+
+  const math = create(all)
+  const parse = math.parse
+  const evaluate = math.evaluate
+
+  // See https://mathjs.org/docs/expressions/security.html#less-vulnerable-expression-parser
+  math.import({
+    'import':     function () { throw new Error('Function import is disabled') },
+    'createUnit': function () { throw new Error('Function createUnit is disabled') },
+    'reviver':    function () { throw new Error('Function reviver is disabled') }
+  }, { override: true })
+
+  return { math, parse, evaluate }
+}
+
+/**
+ * Helper function to format a value. Regular numbers will be rounded
+ * to 14 digits to prevent round-off errors from showing up.
+ * @param {*} value
+ */
+function format (value) {
+  const { math } = getMath()
+
+  return math.format(value, {
+    fn: function (value) {
+      if (typeof value === 'number') {
+        // round numbers
+        return math.format(value, PRECISION)
+      } else {
+        return math.format(value)
+      }
+    }
+  })
+}
+
+/**
+ * auto complete a text
+ * @param {String} text
+ * @return {[Array, String]} completions
+ */
+function completer (text) {
+  const { math } = getMath()
+  let matches = []
+  let keyword
+  const m = /[a-zA-Z_0-9]+$/.exec(text)
+  if (m) {
+    keyword = m[0]
+
+    // scope variables
+    for (const def in scope.keys()) {
+      if (def.indexOf(keyword) === 0) {
+        matches.push(def)
+      }
+    }
+
+    // commandline keywords
+    ['exit', 'quit', 'clear'].forEach(function (cmd) {
+      if (cmd.indexOf(keyword) === 0) {
+        matches.push(cmd)
+      }
+    })
+
+    // math functions and constants
+    const ignore = ['expr', 'type']
+    for (const func in math.expression.mathWithTransform) {
+      if (hasOwnProperty(math.expression.mathWithTransform, func)) {
+        if (func.indexOf(keyword) === 0 && !ignore.includes(func)) {
+          matches.push(func)
+        }
+      }
+    }
+
+    // units
+    const Unit = math.Unit
+    for (const name in Unit.UNITS) {
+      if (hasOwnProperty(Unit.UNITS, name)) {
+        if (name.indexOf(keyword) === 0) {
+          matches.push(name)
+        }
+      }
+    }
+    for (const name in Unit.PREFIXES) {
+      if (hasOwnProperty(Unit.PREFIXES, name)) {
+        const prefixes = Unit.PREFIXES[name]
+        for (const prefix in prefixes) {
+          if (hasOwnProperty(prefixes, prefix)) {
+            if (prefix.indexOf(keyword) === 0) {
+              matches.push(prefix)
+            } else if (keyword.indexOf(prefix) === 0) {
+              const unitKeyword = keyword.substring(prefix.length)
+              for (const n in Unit.UNITS) {
+                if (hasOwnProperty(Unit.UNITS, n)) {
+                  if (n.indexOf(unitKeyword) === 0 &&
+                      Unit.isValuelessUnit(prefix + n)) {
+                    matches.push(prefix + n)
+                  }
+                }
+              }
+            }
+          }
+        }
+      }
+    }
+
+    // remove duplicates
+    matches = matches.filter(function (elem, pos, arr) {
+      return arr.indexOf(elem) === pos
+    })
+  }
+
+  return [matches, keyword]
+}
+
+/**
+ * Run stream, read and evaluate input and stream that to output.
+ * Text lines read from the input are evaluated, and the results are send to
+ * the output.
+ * @param input   Input stream
+ * @param output  Output stream
+ * @param mode    Output mode
+ * @param parenthesis Parenthesis option
+ */
+function runStream (input, output, mode, parenthesis) {
+  const readline = require('readline')
+  const rl = readline.createInterface({
+    input: input || process.stdin,
+    output: output || process.stdout,
+    completer: completer
+  })
+
+  if (rl.output.isTTY) {
+    rl.setPrompt('> ')
+    rl.prompt()
+  }
+
+  // load math.js now, right *after* loading the prompt.
+  const { math, parse } = getMath()
+
+  // TODO: automatic insertion of 'ans' before operators like +, -, *, /
+
+  rl.on('line', function (line) {
+    const expr = line.trim()
+
+    switch (expr.toLowerCase()) {
+      case 'quit':
+      case 'exit':
+        // exit application
+        rl.close()
+        break
+      case 'clear':
+        // clear memory
+        scope = createEmptyMap()
+        console.log('memory cleared')
+
+        // get next input
+        if (rl.output.isTTY) {
+          rl.prompt()
+        }
+        break
+      default:
+        if (!expr) {
+          break
+        }
+        switch (mode) {
+          case 'evaluate':
+            // evaluate expression
+            try {
+              let node = parse(expr)
+              let res = node.evaluate(scope)
+
+              if (math.isResultSet(res)) {
+                // we can have 0 or 1 results in the ResultSet, as the CLI
+                // does not allow multiple expressions separated by a return
+                res = res.entries[0]
+                node = node.blocks
+                  .filter(function (entry) { return entry.visible })
+                  .map(function (entry) { return entry.node })[0]
+              }
+
+              if (node) {
+                if (math.isAssignmentNode(node)) {
+                  const name = findSymbolName(node)
+                  if (name !== null) {
+                    const value = scope.get(name)
+                    scope.set('ans', value)
+                    console.log(name + ' = ' + format(value))
+                  } else {
+                    scope.set('ans', res)
+                    console.log(format(res))
+                  }
+                } else if (math.isHelp(res)) {
+                  console.log(res.toString())
+                } else {
+                  scope.set('ans', res)
+                  console.log(format(res))
+                }
+              }
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+
+          case 'string':
+            try {
+              const string = math.parse(expr).toString({ parenthesis: parenthesis })
+              console.log(string)
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+
+          case 'tex':
+            try {
+              const tex = math.parse(expr).toTex({ parenthesis: parenthesis })
+              console.log(tex)
+            } catch (err) {
+              console.log(err.toString())
+            }
+            break
+        }
+    }
+
+    // get next input
+    if (rl.output.isTTY) {
+      rl.prompt()
+    }
+  })
+
+  rl.on('close', function () {
+    console.log()
+    process.exit(0)
+  })
+}
+
+/**
+ * Find the symbol name of an AssignmentNode. Recurses into the chain of
+ * objects to the root object.
+ * @param {AssignmentNode} node
+ * @return {string | null} Returns the name when found, else returns null.
+ */
+function findSymbolName (node) {
+  const { math } = getMath()
+  let n = node
+
+  while (n) {
+    if (math.isSymbolNode(n)) {
+      return n.name
+    }
+    n = n.object
+  }
+
+  return null
+}
+
+/**
+ * Output application version number.
+ * Version number is read version from package.json.
+ */
+function outputVersion () {
+  fs.readFile(path.join(__dirname, '/../package.json'), function (err, data) {
+    if (err) {
+      console.log(err.toString())
+    } else {
+      const pkg = JSON.parse(data)
+      const version = pkg && pkg.version ? pkg.version : 'unknown'
+      console.log(version)
+    }
+    process.exit(0)
+  })
+}
+
+/**
+ * Output a help message
+ */
+function outputHelp () {
+  console.log('math.js')
+  console.log('https://mathjs.org')
+  console.log()
+  console.log('Math.js is an extensive math library for JavaScript and Node.js. It features ')
+  console.log('real and complex numbers, units, matrices, a large set of mathematical')
+  console.log('functions, and a flexible expression parser.')
+  console.log()
+  console.log('Usage:')
+  console.log('    mathjs [scriptfile(s)|expression] {OPTIONS}')
+  console.log()
+  console.log('Options:')
+  console.log('    --version, -v       Show application version')
+  console.log('    --help,    -h       Show this message')
+  console.log('    --tex               Generate LaTeX instead of evaluating')
+  console.log('    --string            Generate string instead of evaluating')
+  console.log('    --parenthesis=      Set the parenthesis option to')
+  console.log('                        either of "keep", "auto" and "all"')
+  console.log()
+  console.log('Example usage:')
+  console.log('    mathjs                                Open a command prompt')
+  console.log('    mathjs 1+2                            Evaluate expression')
+  console.log('    mathjs script.txt                     Run a script file')
+  console.log('    mathjs script.txt script2.txt         Run two script files')
+  console.log('    mathjs script.txt > results.txt       Run a script file, output to file')
+  console.log('    cat script.txt | mathjs               Run input stream')
+  console.log('    cat script.txt | mathjs > results.txt Run input stream, output to file')
+  console.log()
+  process.exit(0)
+}
+
+/**
+ * Process input and output, based on the command line arguments
+ */
+const scripts = [] // queue of scripts that need to be processed
+let mode = 'evaluate' // one of 'evaluate', 'tex' or 'string'
+let parenthesis = 'keep'
+let version = false
+let help = false
+
+process.argv.forEach(function (arg, index) {
+  if (index < 2) {
+    return
+  }
+
+  switch (arg) {
+    case '-v':
+    case '--version':
+      version = true
+      break
+
+    case '-h':
+    case '--help':
+      help = true
+      break
+
+    case '--tex':
+      mode = 'tex'
+      break
+
+    case '--string':
+      mode = 'string'
+      break
+
+    case '--parenthesis=keep':
+      parenthesis = 'keep'
+      break
+
+    case '--parenthesis=auto':
+      parenthesis = 'auto'
+      break
+
+    case '--parenthesis=all':
+      parenthesis = 'all'
+      break
+
+      // TODO: implement configuration via command line arguments
+
+    default:
+      scripts.push(arg)
+  }
+})
+
+if (version) {
+  outputVersion()
+} else if (help) {
+  outputHelp()
+} else if (scripts.length === 0) {
+  // run a stream, can be user input or pipe input
+  runStream(process.stdin, process.stdout, mode, parenthesis)
+} else {
+  fs.stat(scripts[0], function (err) {
+    if (err) {
+      const { evaluate } = getMath()
+      console.log(evaluate(scripts.join(' ')).toString())
+    } else {
+    // work through the queue of scripts
+      scripts.forEach(function (arg) {
+        // run a script file
+        runStream(fs.createReadStream(arg), process.stdout, mode, parenthesis)
+      })
+    }
+  })
+}
+
+// helper function to safely check whether an object as a property
+// copy from the function in object.js which is ES6
+function hasOwnProperty (object, property) {
+  return object && Object.hasOwnProperty.call(object, property)
+}
diff --git a/node_modules/mathjs/bin/package.json b/node_modules/mathjs/bin/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/bin/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/bin/repl.js b/node_modules/mathjs/bin/repl.js
new file mode 100644
index 0000000..9ad06fe
--- /dev/null
+++ b/node_modules/mathjs/bin/repl.js
@@ -0,0 +1,10 @@
+#!/usr/bin/env node
+
+/*
+ * This simply preloads mathjs and drops you into a REPL to
+ * help interactive debugging.
+ **/
+global.math = require('../lib/browser/math.js')
+const repl = require('repl')
+
+repl.start({ useGlobal: true })
diff --git a/node_modules/mathjs/lib/browser/math.js b/node_modules/mathjs/lib/browser/math.js
new file mode 100644
index 0000000..dce5009
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/math.js
@@ -0,0 +1,3 @@
+/*! For license information please see math.js.LICENSE.txt */
+!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports.math=t():e.math=t()}(this,(()=>(()=>{var e={31:function(e,t,n){var r;!function(e,i){function o(e){var t=this,n="";t.next=function(){var e=t.x^t.x>>>2;return t.x=t.y,t.y=t.z,t.z=t.w,t.w=t.v,(t.d=t.d+362437|0)+(t.v=t.v^t.v<<4^e^e<<1)|0},t.x=0,t.y=0,t.z=0,t.w=0,t.v=0,e===(0|e)?t.x=e:n+=e;for(var r=0;r<n.length+64;r++)t.x^=0|n.charCodeAt(r),r==n.length&&(t.d=t.x<<10^t.x>>>4),t.next()}function a(e,t){return t.x=e.x,t.y=e.y,t.z=e.z,t.w=e.w,t.v=e.v,t.d=e.d,t}function s(e,t){var n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.xorwow=s}(0,e=n.nmd(e),n.amdD)},67:function(e,t,n){var r;!function(e,i){function o(e){var t=this;t.next=function(){var e,n,r=t.x,i=t.i;return e=r[i],n=(e^=e>>>7)^e<<24,n^=(e=r[i+1&7])^e>>>10,n^=(e=r[i+3&7])^e>>>3,n^=(e=r[i+4&7])^e<<7,e=r[i+7&7],n^=(e^=e<<13)^e<<9,r[i]=n,t.i=i+1&7,n},function(e,t){var n,r=[];if(t===(0|t))r[0]=t;else for(t=""+t,n=0;n<t.length;++n)r[7&n]=r[7&n]<<15^t.charCodeAt(n)+r[n+1&7]<<13;for(;r.length<8;)r.push(0);for(n=0;n<8&&0===r[n];++n);for(8==n?r[7]=-1:r[n],e.x=r,e.i=0,n=256;n>0;--n)e.next()}(t,e)}function a(e,t){return t.x=e.x.slice(),t.i=e.i,t}function s(e,t){null==e&&(e=+new Date);var n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&(r.x&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.xorshift7=s}(0,e=n.nmd(e),n.amdD)},144:e=>{"use strict";var t=Object.assign||function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)Object.prototype.hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e},n={"{":"\\{","}":"\\}","\\":"\\textbackslash{}","#":"\\#",$:"\\$","%":"\\%","&":"\\&","^":"\\textasciicircum{}",_:"\\_","~":"\\textasciitilde{}"},r={"–":"\\--","—":"\\---"," ":"~","\t":"\\qquad{}","\r\n":"\\newline{}","\n":"\\newline{}"},i=function(e,n){return t({},e,n)};e.exports=function(e){for(var o=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},a=o.preserveFormatting,s=void 0!==a&&a,u=o.escapeMapFn,c=void 0===u?i:u,l=String(e),f="",p=c(t({},n),s?t({},r):{}),m=Object.keys(p),d=function(){var e=!1;m.forEach((function(t,n){e||l.length>=t.length&&l.slice(0,t.length)===t&&(f+=p[m[n]],l=l.slice(t.length,l.length),e=!0)})),e||(f+=l.slice(0,1),l=l.slice(1,l.length))};l;)d();return f}},180:function(e,t,n){var r;!function(e,i){function o(e){var t,n=this,r=(t=4022871197,function(e){e=String(e);for(var n=0;n<e.length;n++){var r=.02519603282416938*(t+=e.charCodeAt(n));r-=t=r>>>0,t=(r*=t)>>>0,t+=4294967296*(r-=t)}return 2.3283064365386963e-10*(t>>>0)});n.next=function(){var e=2091639*n.s0+2.3283064365386963e-10*n.c;return n.s0=n.s1,n.s1=n.s2,n.s2=e-(n.c=0|e)},n.c=1,n.s0=r(" "),n.s1=r(" "),n.s2=r(" "),n.s0-=r(e),n.s0<0&&(n.s0+=1),n.s1-=r(e),n.s1<0&&(n.s1+=1),n.s2-=r(e),n.s2<0&&(n.s2+=1),r=null}function a(e,t){return t.c=e.c,t.s0=e.s0,t.s1=e.s1,t.s2=e.s2,t}function s(e,t){var n=new o(e),r=t&&t.state,i=n.next;return i.int32=function(){return 4294967296*n.next()|0},i.double=function(){return i()+11102230246251565e-32*(2097152*i()|0)},i.quick=i,r&&("object"==typeof r&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.alea=s}(0,e=n.nmd(e),n.amdD)},181:function(e,t,n){var r;!function(e,i){function o(e){var t=this,n="";t.x=0,t.y=0,t.z=0,t.w=0,t.next=function(){var e=t.x^t.x<<11;return t.x=t.y,t.y=t.z,t.z=t.w,t.w^=t.w>>>19^e^e>>>8},e===(0|e)?t.x=e:n+=e;for(var r=0;r<n.length+64;r++)t.x^=0|n.charCodeAt(r),t.next()}function a(e,t){return t.x=e.x,t.y=e.y,t.z=e.z,t.w=e.w,t}function s(e,t){var n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.xor128=s}(0,e=n.nmd(e),n.amdD)},234:()=>{},369:function(e){e.exports=function(){"use strict";function e(){return!0}function t(){return!1}function n(){}const r="Argument is not a typed-function.";return function i(){function o(e){return"object"==typeof e&&null!==e&&e.constructor===Object}const a=[{name:"number",test:function(e){return"number"==typeof e}},{name:"string",test:function(e){return"string"==typeof e}},{name:"boolean",test:function(e){return"boolean"==typeof e}},{name:"Function",test:function(e){return"function"==typeof e}},{name:"Array",test:Array.isArray},{name:"Date",test:function(e){return e instanceof Date}},{name:"RegExp",test:function(e){return e instanceof RegExp}},{name:"Object",test:o},{name:"null",test:function(e){return null===e}},{name:"undefined",test:function(e){return void 0===e}}],s={name:"any",test:e,isAny:!0};let u,c,l=0,f={createCount:0};function p(e){const t=u.get(e);if(t)return t;let n='Unknown type "'+e+'"';const r=e.toLowerCase();let i;for(i of c)if(i.toLowerCase()===r){n+='. Did you mean "'+i+'" ?';break}throw new TypeError(n)}function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"any";const n=t?p(t).index:c.length,r=[];for(let t=0;t<e.length;++t){if(!e[t]||"string"!=typeof e[t].name||"function"!=typeof e[t].test)throw new TypeError("Object with properties {name: string, test: function} expected");const i=e[t].name;if(u.has(i))throw new TypeError('Duplicate type name "'+i+'"');r.push(i),u.set(i,{name:i,test:e[t].test,isAny:e[t].isAny,index:n+t,conversionsTo:[]})}const i=c.slice(n);c=c.slice(0,n).concat(r).concat(i);for(let e=n+r.length;e<c.length;++e)u.get(c[e]).index=e}function d(){u=new Map,c=[],l=0,m([s],!1)}function h(e){const t=c.filter((t=>{const n=u.get(t);return!n.isAny&&n.test(e)}));return t.length?t:["any"]}function g(e){return e&&"function"==typeof e&&"_typedFunctionData"in e}function y(e,t,n){if(!g(e))throw new TypeError(r);const i=n&&n.exact,o=N(Array.isArray(t)?t.join(","):t),a=x(o);if(!i||a in e.signatures){const t=e._typedFunctionData.signatureMap.get(a);if(t)return t}const s=o.length;let u,c;if(i){let t;for(t in u=[],e.signatures)u.push(e._typedFunctionData.signatureMap.get(t))}else u=e._typedFunctionData.signatures;for(let e=0;e<s;++e){const t=o[e],n=[];let r;for(r of u){const i=M(r.params,e);if(i&&(!t.restParam||i.restParam)){if(!i.hasAny){const e=v(i);if(t.types.some((t=>!e.has(t.name))))continue}n.push(r)}}if(u=n,0===u.length)break}for(c of u)if(c.params.length<=s)return c;throw new TypeError("Signature not found (signature: "+(e.name||"unnamed")+"("+x(o,", ")+"))")}function x(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:",";return e.map((e=>e.name)).join(t)}function b(e){const t=0===e.indexOf("..."),n=(t?e.length>3?e.slice(3):"any":e).split("|").map((e=>p(e.trim())));let r=!1,i=t?"...":"";return{types:n.map((function(e){return r=e.isAny||r,i+=e.name+"|",{name:e.name,typeIndex:e.index,test:e.test,isAny:e.isAny,conversion:null,conversionIndex:-1}})),name:i.slice(0,-1),hasAny:r,hasConversion:!1,restParam:t}}function w(e){const t=function(e){if(0===e.length)return[];const t=e.map(p);e.length>1&&t.sort(((e,t)=>e.index-t.index));let n=t[0].conversionsTo;if(1===e.length)return n;n=n.concat([]);const r=new Set(e);for(let e=1;e<t.length;++e){let i;for(i of t[e].conversionsTo)r.has(i.from)||(n.push(i),r.add(i.from))}return n}(e.types.map((e=>e.name)));let n=e.hasAny,r=e.name;const i=t.map((function(e){const t=p(e.from);return n=t.isAny||n,r+="|"+e.from,{name:e.from,typeIndex:t.index,test:t.test,isAny:t.isAny,conversion:e,conversionIndex:e.index}}));return{types:e.types.concat(i),name:r,hasAny:n,hasConversion:i.length>0,restParam:e.restParam}}function v(e){return e.typeSet||(e.typeSet=new Set,e.types.forEach((t=>e.typeSet.add(t.name)))),e.typeSet}function N(e){const t=[];if("string"!=typeof e)throw new TypeError("Signatures must be strings");const n=e.trim();if(""===n)return t;const r=n.split(",");for(let e=0;e<r.length;++e){const n=b(r[e].trim());if(n.restParam&&e!==r.length-1)throw new SyntaxError('Unexpected rest parameter "'+r[e]+'": only allowed for the last parameter');if(0===n.types.length)return null;t.push(n)}return t}function A(e){const t=H(e);return!!t&&t.restParam}function E(t){if(t&&0!==t.types.length){if(1===t.types.length)return p(t.types[0].name).test;if(2===t.types.length){const e=p(t.types[0].name).test,n=p(t.types[1].name).test;return function(t){return e(t)||n(t)}}{const e=t.types.map((function(e){return p(e.name).test}));return function(t){for(let n=0;n<e.length;n++)if(e[n](t))return!0;return!1}}}return e}function S(e){let t,n,r;if(A(e)){t=$(e).map(E);const n=t.length,r=E(H(e)),i=function(e){for(let t=n;t<e.length;t++)if(!r(e[t]))return!1;return!0};return function(e){for(let n=0;n<t.length;n++)if(!t[n](e[n]))return!1;return i(e)&&e.length>=n+1}}return 0===e.length?function(e){return 0===e.length}:1===e.length?(n=E(e[0]),function(e){return n(e[0])&&1===e.length}):2===e.length?(n=E(e[0]),r=E(e[1]),function(e){return n(e[0])&&r(e[1])&&2===e.length}):(t=e.map(E),function(e){for(let n=0;n<t.length;n++)if(!t[n](e[n]))return!1;return e.length===t.length})}function M(e,t){return t<e.length?e[t]:A(e)?H(e):null}function C(e,t){const n=M(e,t);return n?v(n):new Set}function T(e){return null===e.conversion||void 0===e.conversion}function B(e,t){const n=new Set;return e.forEach((e=>{const r=C(e.params,t);let i;for(i of r)n.add(i)})),n.has("any")?["any"]:Array.from(n)}function F(e,t,n){let r,i;const o=e||"unnamed";let a,s=n;for(a=0;a<t.length;a++){const e=[];if(s.forEach((n=>{const r=E(M(n.params,a));(a<n.params.length||A(n.params))&&r(t[a])&&e.push(n)})),0===e.length){if(i=B(s,a),i.length>0){const e=h(t[a]);return r=new TypeError("Unexpected type of argument in function "+o+" (expected: "+i.join(" or ")+", actual: "+e.join(" | ")+", index: "+a+")"),r.data={category:"wrongType",fn:o,index:a,actual:e,expected:i},r}}else s=e}const u=s.map((function(e){return A(e.params)?1/0:e.params.length}));if(t.length<Math.min.apply(null,u))return i=B(s,a),r=new TypeError("Too few arguments in function "+o+" (expected: "+i.join(" or ")+", index: "+t.length+")"),r.data={category:"tooFewArgs",fn:o,index:t.length,expected:i},r;const c=Math.max.apply(null,u);if(t.length>c)return r=new TypeError("Too many arguments in function "+o+" (expected: "+c+", actual: "+t.length+")"),r.data={category:"tooManyArgs",fn:o,index:t.length,expectedLength:c},r;const l=[];for(let e=0;e<t.length;++e)l.push(h(t[e]).join("|"));return r=new TypeError('Arguments of type "'+l.join(", ")+'" do not match any of the defined signatures of function '+o+"."),r.data={category:"mismatch",actual:l},r}function D(e){let t=c.length+1;for(let n=0;n<e.types.length;n++)T(e.types[n])&&(t=Math.min(t,e.types[n].typeIndex));return t}function O(e){let t=l+1;for(let n=0;n<e.types.length;n++)T(e.types[n])||(t=Math.min(t,e.types[n].conversionIndex));return t}function _(e,t){if(e.hasAny){if(!t.hasAny)return 1}else if(t.hasAny)return-1;if(e.restParam){if(!t.restParam)return 1}else if(t.restParam)return-1;if(e.hasConversion){if(!t.hasConversion)return 1}else if(t.hasConversion)return-1;const n=D(e)-D(t);if(n<0)return-1;if(n>0)return 1;const r=O(e)-O(t);return r<0?-1:r>0?1:0}function z(e,t){const n=e.params,r=t.params,i=H(n),o=H(r),a=A(n),s=A(r);if(a&&i.hasAny){if(!s||!o.hasAny)return 1}else if(s&&o.hasAny)return-1;let u,c=0,l=0;for(u of n)u.hasAny&&++c,u.hasConversion&&++l;let f=0,p=0;for(u of r)u.hasAny&&++f,u.hasConversion&&++p;if(c!==f)return c-f;if(a&&i.hasConversion){if(!s||!o.hasConversion)return 1}else if(s&&o.hasConversion)return-1;if(l!==p)return l-p;if(a){if(!s)return 1}else if(s)return-1;const m=(n.length-r.length)*(a?-1:1);if(0!==m)return m;const d=[];let h,g=0;for(let e=0;e<n.length;++e){const t=_(n[e],r[e]);d.push(t),g+=t}if(0!==g)return g;for(h of d)if(0!==h)return h;return 0}function q(e,t){let n=t;if(e.some((e=>e.hasConversion))){const r=A(e),i=e.map(I);n=function(){const e=[],n=r?arguments.length-1:arguments.length;for(let t=0;t<n;t++)e[t]=i[t](arguments[t]);return r&&(e[n]=arguments[n].map(i[n])),t.apply(this,e)}}let r=n;if(A(e)){const t=e.length-1;r=function(){return n.apply(this,G(arguments,0,t).concat([G(arguments,t)]))}}return r}function I(e){let t,n,r,i;const o=[],a=[];switch(e.types.forEach((function(e){e.conversion&&(o.push(p(e.conversion.from).test),a.push(e.conversion.convert))})),a.length){case 0:return function(e){return e};case 1:return t=o[0],r=a[0],function(e){return t(e)?r(e):e};case 2:return t=o[0],n=o[1],r=a[0],i=a[1],function(e){return t(e)?r(e):n(e)?i(e):e};default:return function(e){for(let t=0;t<a.length;t++)if(o[t](e))return a[t](e);return e}}}function k(e){return function e(t,n,r){if(n<t.length){const a=t[n];let s=[];if(a.restParam){const e=a.types.filter(T);e.length<a.types.length&&s.push({types:e,name:"..."+e.map((e=>e.name)).join("|"),hasAny:e.some((e=>e.isAny)),hasConversion:!1,restParam:!0}),s.push(a)}else s=a.types.map((function(e){return{types:[e],name:e.name,hasAny:e.isAny,hasConversion:e.conversion,restParam:!1}}));return i=s,o=function(i){return e(t,n+1,r.concat([i]))},Array.prototype.concat.apply([],i.map(o))}var i,o;return[r]}(e,0,[])}function R(e,t){const n=Math.max(e.length,t.length);for(let r=0;r<n;r++){const n=C(e,r),i=C(t,r);let o,a=!1;for(o of i)if(n.has(o)){a=!0;break}if(!a)return!1}const r=e.length,i=t.length,o=A(e),a=A(t);return o?a?r===i:i>=r:a?r>=i:r===i}function P(e,t,n){const r=[];let i;for(i of e){let e=n[i];if("number"!=typeof e)throw new TypeError('No definition for referenced signature "'+i+'"');if(e=t[e],"function"!=typeof e)return!1;r.push(e)}return r}function U(e,t,n){const r=function(e){return e.map((e=>Y(e)?V(e.referToSelf.callback):W(e)?Z(e.referTo.references,e.referTo.callback):e))}(e),i=new Array(r.length).fill(!1);let o=!0;for(;o;){o=!1;let e=!0;for(let a=0;a<r.length;++a){if(i[a])continue;const s=r[a];if(Y(s))r[a]=s.referToSelf.callback(n),r[a].referToSelf=s.referToSelf,i[a]=!0,e=!1;else if(W(s)){const n=P(s.referTo.references,r,t);n?(r[a]=s.referTo.callback.apply(this,n),r[a].referTo=s.referTo,i[a]=!0,e=!1):o=!0}}if(e&&o)throw new SyntaxError("Circular reference detected in resolving typed.referTo")}return r}function j(e,r){if(f.createCount++,0===Object.keys(r).length)throw new SyntaxError("No signatures provided");f.warnAgainstDeprecatedThis&&function(e){const t=/\bthis(\(|\.signatures\b)/;Object.keys(e).forEach((n=>{const r=e[n];if(t.test(r.toString()))throw new SyntaxError("Using `this` to self-reference a function is deprecated since typed-function@3. Use typed.referTo and typed.referToSelf instead.")}))}(r);const i=[],o=[],a={},s=[];let u;for(u in r){if(!Object.prototype.hasOwnProperty.call(r,u))continue;const e=N(u);if(!e)continue;i.forEach((function(t){if(R(t,e))throw new TypeError('Conflicting signatures "'+x(t)+'" and "'+x(e)+'".')})),i.push(e);const t=o.length;o.push(r[u]);const n=e.map(w);let c;for(c of k(n)){const e=x(c);s.push({params:c,name:e,fn:t}),c.every((e=>!e.hasConversion))&&(a[e]=t)}}s.sort(z);const c=U(o,a,se);let l;for(l in a)Object.prototype.hasOwnProperty.call(a,l)&&(a[l]=c[a[l]]);const p=[],m=new Map;for(l of s)m.has(l.name)||(l.fn=c[l.fn],p.push(l),m.set(l.name,l));const d=p[0]&&p[0].params.length<=2&&!A(p[0].params),h=p[1]&&p[1].params.length<=2&&!A(p[1].params),g=p[2]&&p[2].params.length<=2&&!A(p[2].params),y=p[3]&&p[3].params.length<=2&&!A(p[3].params),b=p[4]&&p[4].params.length<=2&&!A(p[4].params),v=p[5]&&p[5].params.length<=2&&!A(p[5].params),M=d&&h&&g&&y&&b&&v;for(let e=0;e<p.length;++e)p[e].test=S(p[e].params);const C=d?E(p[0].params[0]):t,T=h?E(p[1].params[0]):t,B=g?E(p[2].params[0]):t,F=y?E(p[3].params[0]):t,D=b?E(p[4].params[0]):t,O=v?E(p[5].params[0]):t,_=d?E(p[0].params[1]):t,I=h?E(p[1].params[1]):t,P=g?E(p[2].params[1]):t,j=y?E(p[3].params[1]):t,L=b?E(p[4].params[1]):t,$=v?E(p[5].params[1]):t;for(let e=0;e<p.length;++e)p[e].implementation=q(p[e].params,p[e].fn);const H=d?p[0].implementation:n,G=h?p[1].implementation:n,Z=g?p[2].implementation:n,V=y?p[3].implementation:n,W=b?p[4].implementation:n,Y=v?p[5].implementation:n,J=d?p[0].params.length:-1,X=h?p[1].params.length:-1,Q=g?p[2].params.length:-1,K=y?p[3].params.length:-1,ee=b?p[4].params.length:-1,te=v?p[5].params.length:-1,ne=M?6:0,re=p.length,ie=p.map((e=>e.test)),oe=p.map((e=>e.implementation)),ae=function(){for(let e=ne;e<re;e++)if(ie[e](arguments))return oe[e].apply(this,arguments);return f.onMismatch(e,arguments,p)};function se(e,t){return arguments.length===J&&C(e)&&_(t)?H.apply(this,arguments):arguments.length===X&&T(e)&&I(t)?G.apply(this,arguments):arguments.length===Q&&B(e)&&P(t)?Z.apply(this,arguments):arguments.length===K&&F(e)&&j(t)?V.apply(this,arguments):arguments.length===ee&&D(e)&&L(t)?W.apply(this,arguments):arguments.length===te&&O(e)&&$(t)?Y.apply(this,arguments):ae.apply(this,arguments)}try{Object.defineProperty(se,"name",{value:e})}catch(e){}return se.signatures=a,se._typedFunctionData={signatures:p,signatureMap:m},se}function L(e,t,n){throw F(e,t,n)}function $(e){return G(e,0,e.length-1)}function H(e){return e[e.length-1]}function G(e,t,n){return Array.prototype.slice.call(e,t,n)}function Z(e,t){return{referTo:{references:e,callback:t}}}function V(e){if("function"!=typeof e)throw new TypeError("Callback function expected as first argument");return{referToSelf:{callback:e}}}function W(e){return e&&"object"==typeof e.referTo&&Array.isArray(e.referTo.references)&&"function"==typeof e.referTo.callback}function Y(e){return e&&"object"==typeof e.referToSelf&&"function"==typeof e.referToSelf.callback}function J(e,t){if(!e)return t;if(t&&t!==e){const n=new Error("Function names do not match (expected: "+e+", actual: "+t+")");throw n.data={actual:t,expected:e},n}return e}function X(e){let t;for(const n in e)Object.prototype.hasOwnProperty.call(e,n)&&(g(e[n])||"string"==typeof e[n].signature)&&(t=J(t,e[n].name));return t}function Q(e,t){let n;for(n in t)if(Object.prototype.hasOwnProperty.call(t,n)){if(n in e&&t[n]!==e[n]){const r=new Error('Signature "'+n+'" is defined twice');throw r.data={signature:n,sourceFunction:t[n],destFunction:e[n]},r}e[n]=t[n]}}d(),m(a);const K=f;function ee(e){if(!e||"string"!=typeof e.from||"string"!=typeof e.to||"function"!=typeof e.convert)throw new TypeError("Object with properties {from: string, to: string, convert: function} expected");if(e.to===e.from)throw new SyntaxError('Illegal to define conversion from "'+e.from+'" to itself.')}return f=function(e){const t="string"==typeof e;let n=t?e:"";const r={};for(let e=t?1:0;e<arguments.length;++e){const i=arguments[e];let a,s={};if("function"==typeof i?(a=i.name,"string"==typeof i.signature?s[i.signature]=i:g(i)&&(s=i.signatures)):o(i)&&(s=i,t||(a=X(i))),0===Object.keys(s).length){const t=new TypeError("Argument to 'typed' at index "+e+" is not a (typed) function, nor an object with signatures as keys and functions as values.");throw t.data={index:e,argument:i},t}t||(n=J(n,a)),Q(r,s)}return j(n||"",r)},f.create=i,f.createCount=K.createCount,f.onMismatch=L,f.throwMismatchError=L,f.createError=F,f.clear=d,f.clearConversions=function(){let e;for(e of c)u.get(e).conversionsTo=[];l=0},f.addTypes=m,f._findType=p,f.referTo=function(){const e=$(arguments).map((e=>x(N(e)))),t=H(arguments);if("function"!=typeof t)throw new TypeError("Callback function expected as last argument");return Z(e,t)},f.referToSelf=V,f.convert=function(e,t){const n=p(t);if(n.test(e))return e;const r=n.conversionsTo;if(0===r.length)throw new Error("There are no conversions to "+t+" defined.");for(let t=0;t<r.length;t++)if(p(r[t].from).test(e))return r[t].convert(e);throw new Error("Cannot convert "+e+" to "+t)},f.findSignature=y,f.find=function(e,t,n){return y(e,t,n).implementation},f.isTypedFunction=g,f.warnAgainstDeprecatedThis=!0,f.addType=function(e,t){let n="any";!1!==t&&u.has("Object")&&(n="Object"),f.addTypes([e],n)},f.addConversion=function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{override:!1};ee(e);const n=p(e.to),r=n.conversionsTo.find((t=>t.from===e.from));if(r){if(!t||!t.override)throw new Error('There is already a conversion from "'+e.from+'" to "'+n.name+'"');f.removeConversion({from:r.from,to:e.to,convert:r.convert})}n.conversionsTo.push({from:e.from,convert:e.convert,index:l++})},f.addConversions=function(e,t){e.forEach((e=>f.addConversion(e,t)))},f.removeConversion=function(e){ee(e);const t=p(e.to),n=function(e,t){for(let n=0;n<e.length;n++)if(t(e[n]))return e[n]}(t.conversionsTo,(t=>t.from===e.from));if(!n)throw new Error("Attempt to remove nonexistent conversion from "+e.from+" to "+e.to);if(n.convert!==e.convert)throw new Error("Conversion to remove does not match existing conversion");const r=t.conversionsTo.indexOf(n);t.conversionsTo.splice(r,1)},f.resolve=function(e,t){if(!g(e))throw new TypeError(r);const n=e._typedFunctionData.signatures;for(let e=0;e<n.length;++e)if(n[e].test(t))return n[e];return null},f}()}()},391:(e,t,n)=>{var r=n(180),i=n(181),o=n(31),a=n(67),s=n(833),u=n(717),c=n(801);c.alea=r,c.xor128=i,c.xorwow=o,c.xorshift7=a,c.xor4096=s,c.tychei=u,e.exports=c},504:e=>{function t(){}t.prototype={on:function(e,t,n){var r=this.e||(this.e={});return(r[e]||(r[e]=[])).push({fn:t,ctx:n}),this},once:function(e,t,n){var r=this;function i(){r.off(e,i),t.apply(n,arguments)}return i._=t,this.on(e,i,n)},emit:function(e){for(var t=[].slice.call(arguments,1),n=((this.e||(this.e={}))[e]||[]).slice(),r=0,i=n.length;r<i;r++)n[r].fn.apply(n[r].ctx,t);return this},off:function(e,t){var n=this.e||(this.e={}),r=n[e],i=[];if(r&&t)for(var o=0,a=r.length;o<a;o++)r[o].fn!==t&&r[o].fn._!==t&&i.push(r[o]);return i.length?n[e]=i:delete n[e],this}},e.exports=t,e.exports.TinyEmitter=t},717:function(e,t,n){var r;!function(e,i){function o(e){var t=this,n="";t.next=function(){var e=t.b,n=t.c,r=t.d,i=t.a;return e=e<<25^e>>>7^n,n=n-r|0,r=r<<24^r>>>8^i,i=i-e|0,t.b=e=e<<20^e>>>12^n,t.c=n=n-r|0,t.d=r<<16^n>>>16^i,t.a=i-e|0},t.a=0,t.b=0,t.c=-1640531527,t.d=1367130551,e===Math.floor(e)?(t.a=e/4294967296|0,t.b=0|e):n+=e;for(var r=0;r<n.length+20;r++)t.b^=0|n.charCodeAt(r),t.next()}function a(e,t){return t.a=e.a,t.b=e.b,t.c=e.c,t.d=e.d,t}function s(e,t){var n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&("object"==typeof r&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.tychei=s}(0,e=n.nmd(e),n.amdD)},801:function(e,t,n){var r;!function(i,o,a){var s,u=256,c=a.pow(u,6),l=a.pow(2,52),f=2*l,p=255;function m(e,t,n){var r=[],p=y(g((t=1==t?{entropy:!0}:t||{}).entropy?[e,x(o)]:null==e?function(){try{var e;return s&&(e=s.randomBytes)?e=e(u):(e=new Uint8Array(u),(i.crypto||i.msCrypto).getRandomValues(e)),x(e)}catch(e){var t=i.navigator,n=t&&t.plugins;return[+new Date,i,n,i.screen,x(o)]}}():e,3),r),m=new d(r),b=function(){for(var e=m.g(6),t=c,n=0;e<l;)e=(e+n)*u,t*=u,n=m.g(1);for(;e>=f;)e/=2,t/=2,n>>>=1;return(e+n)/t};return b.int32=function(){return 0|m.g(4)},b.quick=function(){return m.g(4)/4294967296},b.double=b,y(x(m.S),o),(t.pass||n||function(e,t,n,r){return r&&(r.S&&h(r,m),e.state=function(){return h(m,{})}),n?(a.random=e,t):e})(b,p,"global"in t?t.global:this==a,t.state)}function d(e){var t,n=e.length,r=this,i=0,o=r.i=r.j=0,a=r.S=[];for(n||(e=[n++]);i<u;)a[i]=i++;for(i=0;i<u;i++)a[i]=a[o=p&o+e[i%n]+(t=a[i])],a[o]=t;(r.g=function(e){for(var t,n=0,i=r.i,o=r.j,a=r.S;e--;)t=a[i=p&i+1],n=n*u+a[p&(a[i]=a[o=p&o+t])+(a[o]=t)];return r.i=i,r.j=o,n})(u)}function h(e,t){return t.i=e.i,t.j=e.j,t.S=e.S.slice(),t}function g(e,t){var n,r=[],i=typeof e;if(t&&"object"==i)for(n in e)try{r.push(g(e[n],t-1))}catch(e){}return r.length?r:"string"==i?e:e+"\0"}function y(e,t){for(var n,r=e+"",i=0;i<r.length;)t[p&i]=p&(n^=19*t[p&i])+r.charCodeAt(i++);return x(t)}function x(e){return String.fromCharCode.apply(0,e)}if(y(a.random(),o),e.exports){e.exports=m;try{s=n(234)}catch(e){}}else void 0===(r=function(){return m}.call(t,n,t,e))||(e.exports=r)}("undefined"!=typeof self?self:this,[],Math)},833:function(e,t,n){var r;!function(e,i){function o(e){var t=this;t.next=function(){var e,n,r=t.w,i=t.X,o=t.i;return t.w=r=r+1640531527|0,n=i[o+34&127],e=i[o=o+1&127],n^=n<<13,e^=e<<17,n^=n>>>15,e^=e>>>12,n=i[o]=n^e,t.i=o,n+(r^r>>>16)|0},function(e,t){var n,r,i,o,a,s=[],u=128;for(t===(0|t)?(r=t,t=null):(t+="\0",r=0,u=Math.max(u,t.length)),i=0,o=-32;o<u;++o)t&&(r^=t.charCodeAt((o+32)%t.length)),0===o&&(a=r),r^=r<<10,r^=r>>>15,r^=r<<4,r^=r>>>13,o>=0&&(a=a+1640531527|0,i=0==(n=s[127&o]^=r+a)?i+1:0);for(i>=128&&(s[127&(t&&t.length||0)]=-1),i=127,o=512;o>0;--o)r=s[i+34&127],n=s[i=i+1&127],r^=r<<13,n^=n<<17,r^=r>>>15,n^=n>>>12,s[i]=r^n;e.w=a,e.X=s,e.i=i}(t,e)}function a(e,t){return t.i=e.i,t.w=e.w,t.X=e.X.slice(),t}function s(e,t){null==e&&(e=+new Date);var n=new o(e),r=t&&t.state,i=function(){return(n.next()>>>0)/4294967296};return i.double=function(){do{var e=((n.next()>>>11)+(n.next()>>>0)/4294967296)/(1<<21)}while(0===e);return e},i.int32=n.next,i.quick=i,r&&(r.X&&a(r,n),i.state=function(){return a(n,{})}),i}i&&i.exports?i.exports=s:n.amdD&&n.amdO?void 0===(r=function(){return s}.call(t,n,t,i))||(i.exports=r):this.xor4096=s}(0,e=n.nmd(e),n.amdD)},880:e=>{e.exports=function e(t,n){"use strict";var r,i,o=/(^([+\-]?(?:0|[1-9]\d*)(?:\.\d*)?(?:[eE][+\-]?\d+)?)?$|^0x[0-9a-f]+$|\d+)/gi,a=/(^[ ]*|[ ]*$)/g,s=/(^([\w ]+,?[\w ]+)?[\w ]+,?[\w ]+\d+:\d+(:\d+)?[\w ]?|^\d{1,4}[\/\-]\d{1,4}[\/\-]\d{1,4}|^\w+, \w+ \d+, \d{4})/,u=/^0x[0-9a-f]+$/i,c=/^0/,l=function(t){return e.insensitive&&(""+t).toLowerCase()||""+t},f=l(t).replace(a,"")||"",p=l(n).replace(a,"")||"",m=f.replace(o,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),d=p.replace(o,"\0$1\0").replace(/\0$/,"").replace(/^\0/,"").split("\0"),h=parseInt(f.match(u),16)||1!==m.length&&f.match(s)&&Date.parse(f),g=parseInt(p.match(u),16)||h&&p.match(s)&&Date.parse(p)||null;if(g){if(h<g)return-1;if(h>g)return 1}for(var y=0,x=Math.max(m.length,d.length);y<x;y++){if(r=!(m[y]||"").match(c)&&parseFloat(m[y])||m[y]||0,i=!(d[y]||"").match(c)&&parseFloat(d[y])||d[y]||0,isNaN(r)!==isNaN(i))return isNaN(r)?1:-1;if(typeof r!=typeof i&&(r+="",i+=""),r<i)return-1;if(r>i)return 1}return 0}}},t={};function n(r){var i=t[r];if(void 0!==i)return i.exports;var o=t[r]={id:r,loaded:!1,exports:{}};return e[r].call(o.exports,o,o.exports,n),o.loaded=!0,o.exports}n.amdD=function(){throw new Error("define cannot be used indirect")},n.amdO={},n.d=(e,t)=>{for(var r in t)n.o(t,r)&&!n.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},n.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),n.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},n.nmd=e=>(e.paths=[],e.children||(e.children=[]),e);var r={};return(()=>{"use strict";n.d(r,{default:()=>hx});var e={};n.r(e),n.d(e,{createAbs:()=>To,createAccessorNode:()=>jp,createAcos:()=>ef,createAcosh:()=>wf,createAcot:()=>Nf,createAcoth:()=>Ef,createAcsc:()=>Mf,createAcsch:()=>Tf,createAdd:()=>Sp,createAddScalar:()=>_o,createAnd:()=>Jc,createAndTransform:()=>ix,createArg:()=>ws,createArrayNode:()=>$p,createAsec:()=>Ff,createAsech:()=>Of,createAsin:()=>zf,createAsinh:()=>qf,createAssignmentNode:()=>Jp,createAtan:()=>If,createAtan2:()=>Rf,createAtanh:()=>Uf,createAtomicMass:()=>ay,createAvogadro:()=>sy,createBellNumbers:()=>zh,createBigNumberClass:()=>On,createBigint:()=>ki,createBignumber:()=>Li,createBin:()=>rc,createBitAnd:()=>ps,createBitAndTransform:()=>sx,createBitNot:()=>ds,createBitOr:()=>gs,createBitOrTransform:()=>ux,createBitXor:()=>bs,createBlockNode:()=>Qp,createBohrMagneton:()=>Ug,createBohrRadius:()=>Zg,createBoltzmann:()=>uy,createBoolean:()=>ji,createCatalan:()=>Ih,createCbrt:()=>ko,createCeil:()=>Go,createChain:()=>pd,createChainClass:()=>od,createClassicalElectronRadius:()=>Vg,createClone:()=>ri,createColumn:()=>Rs,createColumnTransform:()=>Fy,createCombinations:()=>Xd,createCombinationsWithRep:()=>eh,createCompare:()=>Qc,createCompareNatural:()=>nl,createCompareText:()=>ol,createCompile:()=>Dm,createComplex:()=>$i,createComplexClass:()=>jn,createComposition:()=>Rh,createConcat:()=>Is,createConcatTransform:()=>Zy,createConditionalNode:()=>em,createConductanceQuantum:()=>jg,createConj:()=>Ns,createConstantNode:()=>cm,createCorr:()=>Vd,createCos:()=>Lf,createCosh:()=>Hf,createCot:()=>Gf,createCoth:()=>Vf,createCoulomb:()=>kg,createCoulombConstant:()=>Rg,createCount:()=>Us,createCreateUnit:()=>Ql,createCross:()=>Ls,createCsc:()=>Wf,createCsch:()=>Jf,createCtranspose:()=>qu,createCube:()=>Vo,createCumSum:()=>zd,createCumSumTransform:()=>Ky,createDeepEqual:()=>El,createDenseMatrixClass:()=>ti,createDerivative:()=>Qh,createDet:()=>md,createDeuteronMass:()=>Kg,createDiag:()=>Hs,createDiff:()=>su,createDiffTransform:()=>Wy,createDistance:()=>Fd,createDivide:()=>Td,createDivideScalar:()=>yc,createDot:()=>Fp,createDotDivide:()=>Oc,createDotMultiply:()=>Wa,createDotPow:()=>Fc,createE:()=>yg,createEfimovFactor:()=>oy,createEigs:()=>yd,createElectricConstant:()=>qg,createElectronMass:()=>Wg,createElementaryCharge:()=>Pg,createEqual:()=>sl,createEqualScalar:()=>zi,createEqualText:()=>ll,createErf:()=>Lu,createEvaluate:()=>_m,createExp:()=>Wo,createExpm:()=>bd,createExpm1:()=>Jo,createFactorial:()=>mh,createFalse:()=>fg,createFaraday:()=>cy,createFermiCoupling:()=>Yg,createFft:()=>Ru,createFibonacciHeapClass:()=>kl,createFilter:()=>Gs,createFilterTransform:()=>qy,createFineStructure:()=>Jg,createFirstRadiation:()=>ly,createFix:()=>ea,createFlatten:()=>Ws,createFloor:()=>oa,createForEach:()=>Js,createForEachTransform:()=>Iy,createFormat:()=>nc,createFraction:()=>Hi,createFractionClass:()=>ir,createFreqz:()=>ig,createFunctionAssignmentNode:()=>fm,createFunctionNode:()=>Cm,createGamma:()=>ch,createGasConstant:()=>py,createGcd:()=>wa,createGetMatrixDataType:()=>Ks,createGravitationConstant:()=>Dg,createGravity:()=>vy,createHartreeEnergy:()=>Xg,createHasNumericValue:()=>Ai,createHelp:()=>ld,createHelpClass:()=>id,createHex:()=>oc,createHypot:()=>Cp,createI:()=>Sg,createIdentity:()=>tu,createIfft:()=>Uu,createIm:()=>As,createImmutableDenseMatrixClass:()=>zl,createIndex:()=>_p,createIndexClass:()=>ql,createIndexNode:()=>mm,createIndexTransform:()=>ky,createInfinity:()=>mg,createIntersect:()=>Dd,createInv:()=>dd,createInverseConductanceQuantum:()=>Lg,createInvmod:()=>Ga,createIsInteger:()=>pi,createIsNaN:()=>Bi,createIsNegative:()=>bi,createIsNumeric:()=>vi,createIsPositive:()=>Si,createIsPrime:()=>dc,createIsZero:()=>Ci,createKldivergence:()=>hh,createKlitzing:()=>Gg,createKron:()=>ru,createLN10:()=>wg,createLN2:()=>bg,createLOG10E:()=>Ng,createLOG2E:()=>vg,createLarger:()=>xl,createLargerEq:()=>vl,createLcm:()=>Na,createLeafCount:()=>Uh,createLeftShift:()=>Gc,createLgamma:()=>fh,createLog:()=>Ec,createLog10:()=>Ca,createLog1p:()=>Mc,createLog2:()=>Ba,createLoschmidt:()=>fy,createLsolve:()=>qc,createLsolveAll:()=>Pc,createLup:()=>Rm,createLusolve:()=>td,createLyap:()=>Cd,createMad:()=>Pd,createMagneticConstant:()=>zg,createMagneticFluxQuantum:()=>$g,createMap:()=>ou,createMapSlices:()=>Fo,createMapSlicesTransform:()=>By,createMapTransform:()=>Ry,createMatrix:()=>Zi,createMatrixClass:()=>ar,createMatrixFromColumns:()=>Qi,createMatrixFromFunction:()=>Wi,createMatrixFromRows:()=>Ji,createMax:()=>Ol,createMaxTransform:()=>Uy,createMean:()=>Id,createMeanTransform:()=>jy,createMedian:()=>Rd,createMin:()=>_l,createMinTransform:()=>Ly,createMod:()=>pa,createMode:()=>Xu,createMolarMass:()=>by,createMolarMassC12:()=>wy,createMolarPlanckConstant:()=>my,createMolarVolume:()=>dy,createMultinomial:()=>yh,createMultiply:()=>Oa,createMultiplyScalar:()=>Fa,createNaN:()=>dg,createNeutronMass:()=>ey,createNode:()=>qp,createNorm:()=>Bp,createNot:()=>Fs,createNthRoot:()=>za,createNthRoots:()=>Tc,createNuclearMagneton:()=>Hg,createNull:()=>pg,createNullish:()=>Os,createNullishTransform:()=>ax,createNumber:()=>Ii,createNumeric:()=>hc,createObjectNode:()=>hm,createOct:()=>ic,createOnes:()=>uu,createOperatorNode:()=>xm,createOr:()=>_s,createOrTransform:()=>ox,createParenthesisNode:()=>wm,createParse:()=>Bm,createParser:()=>km,createParserClass:()=>zm,createPartitionSelect:()=>Bl,createPermutations:()=>bh,createPhi:()=>xg,createPi:()=>hg,createPickRandom:()=>Sh,createPinv:()=>gd,createPlanckCharge:()=>Sy,createPlanckConstant:()=>Og,createPlanckLength:()=>Ny,createPlanckMass:()=>Ay,createPlanckTemperature:()=>My,createPlanckTime:()=>Ey,createPolynomialRoot:()=>rd,createPow:()=>xc,createPrint:()=>uc,createPrintTransform:()=>rx,createProd:()=>ec,createProtonMass:()=>Qg,createQr:()=>Pm,createQuantileSeq:()=>Hd,createQuantileSeqTransform:()=>Xy,createQuantumOfCirculation:()=>ty,createRandom:()=>Th,createRandomInt:()=>Fh,createRange:()=>mu,createRangeClass:()=>or,createRangeNode:()=>Nm,createRangeTransform:()=>$y,createRationalize:()=>eg,createRe:()=>Es,createReducedPlanckConstant:()=>_g,createRelationalNode:()=>Em,createReplacer:()=>ag,createReshape:()=>hu,createResize:()=>gu,createResolve:()=>Wh,createResultSet:()=>Ve,createReviver:()=>og,createRightArithShift:()=>Vc,createRightLogShift:()=>Yc,createRotate:()=>xu,createRotationMatrix:()=>wu,createRound:()=>vc,createRow:()=>vu,createRowTransform:()=>Hy,createRydberg:()=>ny,createSQRT1_2:()=>Ag,createSQRT2:()=>Eg,createSackurTetrode:()=>hy,createSchur:()=>Sd,createSec:()=>Xf,createSech:()=>Kf,createSecondRadiation:()=>gy,createSetCartesian:()=>ap,createSetDifference:()=>up,createSetDistinct:()=>lp,createSetIntersect:()=>pp,createSetIsSubset:()=>dp,createSetMultiplicity:()=>gp,createSetPowerset:()=>xp,createSetSize:()=>wp,createSetSymDifference:()=>Np,createSetUnion:()=>Ep,createSign:()=>Ia,createSimplify:()=>Hh,createSimplifyConstant:()=>Gh,createSimplifyCore:()=>Vh,createSin:()=>ep,createSinh:()=>np,createSize:()=>Au,createSlu:()=>Qm,createSmaller:()=>pl,createSmallerEq:()=>hl,createSolveODE:()=>ju,createSort:()=>Dl,createSpaClass:()=>Rl,createSparse:()=>Jl,createSparseMatrixClass:()=>qi,createSpeedOfLight:()=>Fg,createSplitUnit:()=>eo,createSqrt:()=>ka,createSqrtm:()=>vd,createSquare:()=>Pa,createSqueeze:()=>Su,createStd:()=>Gd,createStdTransform:()=>Yy,createStefanBoltzmann:()=>yy,createStirlingS2:()=>Oh,createString:()=>Pi,createSubset:()=>Cu,createSubsetTransform:()=>Gy,createSubtract:()=>ja,createSubtractScalar:()=>qo,createSum:()=>Od,createSumTransform:()=>Jy,createSylvester:()=>Ad,createSymbolNode:()=>Sm,createSymbolicEqual:()=>Jh,createTan:()=>rp,createTanh:()=>ip,createTau:()=>gg,createThomsonCrossSection:()=>ry,createTo:()=>lc,createToBest:()=>pc,createTrace:()=>Dp,createTranspose:()=>_u,createTrue:()=>lg,createTypeOf:()=>Di,createTyped:()=>$e,createUnaryMinus:()=>So,createUnaryPlus:()=>Co,createUnequal:()=>Ml,createUnitClass:()=>Zl,createUnitFunction:()=>Wl,createUppercaseE:()=>Cg,createUppercasePi:()=>Mg,createUsolve:()=>kc,createUsolveAll:()=>jc,createVacuumImpedance:()=>Ig,createVariance:()=>Ld,createVarianceTransform:()=>tx,createVersion:()=>Tg,createWeakMixingAngle:()=>iy,createWienDisplacement:()=>xy,createXgcd:()=>$a,createXor:()=>zs,createZeros:()=>ku,createZeta:()=>Yu,createZpk2tf:()=>ng});var t=n(369);function i(e,t){if(a(e,t))return e[t];if("function"==typeof e[t]&&s(e,t))throw new Error('Cannot access method "'+t+'" as a property');throw new Error('No access to property "'+t+'"')}function o(e,t,n){if(a(e,t))return e[t]=n,n;throw new Error('No access to property "'+t+'"')}function a(e,t){return!(!function(e){return"object"==typeof e&&e&&e.constructor===Object}(e)&&!Array.isArray(e)||!me(u,t)&&(t in Object.prototype||t in Function.prototype))}function s(e,t){return!(null==e||"function"!=typeof e[t]||me(e,t)&&Object.getPrototypeOf&&t in Object.getPrototypeOf(e)||!me(c,t)&&(t in Object.prototype||t in Function.prototype))}const u={length:!0,name:!0},c={toString:!0,valueOf:!0,toLocaleString:!0};class l{constructor(e){this.wrappedObject=e,this[Symbol.iterator]=this.entries}keys(){return Object.keys(this.wrappedObject).filter((e=>this.has(e))).values()}get(e){return i(this.wrappedObject,e)}set(e,t){return o(this.wrappedObject,e,t),this}has(e){return a(this.wrappedObject,e)&&e in this.wrappedObject}entries(){return p(this.keys(),(e=>[e,this.get(e)]))}forEach(e){for(const t of this.keys())e(this.get(t),t,this)}delete(e){a(this.wrappedObject,e)&&delete this.wrappedObject[e]}clear(){for(const e of this.keys())this.delete(e)}get size(){return Object.keys(this.wrappedObject).length}}class f{constructor(e,t,n){this.a=e,this.b=t,this.bKeys=n,this[Symbol.iterator]=this.entries}get(e){return this.bKeys.has(e)?this.b.get(e):this.a.get(e)}set(e,t){return this.bKeys.has(e)?this.b.set(e,t):this.a.set(e,t),this}has(e){return this.b.has(e)||this.a.has(e)}keys(){return new Set([...this.a.keys(),...this.b.keys()])[Symbol.iterator]()}entries(){return p(this.keys(),(e=>[e,this.get(e)]))}forEach(e){for(const t of this.keys())e(this.get(t),t,this)}delete(e){return this.bKeys.has(e)?this.b.delete(e):this.a.delete(e)}clear(){this.a.clear(),this.b.clear()}get size(){return[...this.keys()].length}}function p(e,t){return{next:()=>{const n=e.next();return n.done?n:{value:t(n.value),done:!1}}}}function m(){return new Map}function d(e){if(!e)return m();if(I(e))return e;if(q(e))return new l(e);throw new Error("createMap can create maps from objects or Maps")}function h(e){return"number"==typeof e}function g(e){return!(!e||"object"!=typeof e||"function"!=typeof e.constructor)&&(!0===e.isBigNumber&&"object"==typeof e.constructor.prototype&&!0===e.constructor.prototype.isBigNumber||"function"==typeof e.constructor.isDecimal&&!0===e.constructor.isDecimal(e))}function y(e){return"bigint"==typeof e}function x(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isComplex||!1}function b(e){return e&&"object"==typeof e&&!0===Object.getPrototypeOf(e).isFraction||!1}function w(e){return e&&!0===e.constructor.prototype.isUnit||!1}function v(e){return"string"==typeof e}const N=Array.isArray;function A(e){return e&&!0===e.constructor.prototype.isMatrix||!1}function E(e){return Array.isArray(e)||A(e)}function S(e){return e&&e.isDenseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function M(e){return e&&e.isSparseMatrix&&!0===e.constructor.prototype.isMatrix||!1}function C(e){return e&&!0===e.constructor.prototype.isRange||!1}function T(e){return e&&!0===e.constructor.prototype.isIndex||!1}function B(e){return"boolean"==typeof e}function F(e){return e&&!0===e.constructor.prototype.isResultSet||!1}function D(e){return e&&!0===e.constructor.prototype.isHelp||!1}function O(e){return"function"==typeof e}function _(e){return e instanceof Date}function z(e){return e instanceof RegExp}function q(e){return!(!e||"object"!=typeof e||e.constructor!==Object||x(e)||b(e))}function I(e){return!!e&&(e instanceof Map||e instanceof l||"function"==typeof e.set&&"function"==typeof e.get&&"function"==typeof e.keys&&"function"==typeof e.has)}function k(e){return I(e)&&I(e.a)&&I(e.b)}function R(e){return I(e)&&q(e.wrappedObject)}function P(e){return null===e}function U(e){return void 0===e}function j(e){return e&&!0===e.isAccessorNode&&!0===e.constructor.prototype.isNode||!1}function L(e){return e&&!0===e.isArrayNode&&!0===e.constructor.prototype.isNode||!1}function $(e){return e&&!0===e.isAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function H(e){return e&&!0===e.isBlockNode&&!0===e.constructor.prototype.isNode||!1}function G(e){return e&&!0===e.isConditionalNode&&!0===e.constructor.prototype.isNode||!1}function Z(e){return e&&!0===e.isConstantNode&&!0===e.constructor.prototype.isNode||!1}function V(e){return Z(e)||K(e)&&1===e.args.length&&Z(e.args[0])&&"-+~".includes(e.op)}function W(e){return e&&!0===e.isFunctionAssignmentNode&&!0===e.constructor.prototype.isNode||!1}function Y(e){return e&&!0===e.isFunctionNode&&!0===e.constructor.prototype.isNode||!1}function J(e){return e&&!0===e.isIndexNode&&!0===e.constructor.prototype.isNode||!1}function X(e){return e&&!0===e.isNode&&!0===e.constructor.prototype.isNode||!1}function Q(e){return e&&!0===e.isObjectNode&&!0===e.constructor.prototype.isNode||!1}function K(e){return e&&!0===e.isOperatorNode&&!0===e.constructor.prototype.isNode||!1}function ee(e){return e&&!0===e.isParenthesisNode&&!0===e.constructor.prototype.isNode||!1}function te(e){return e&&!0===e.isRangeNode&&!0===e.constructor.prototype.isNode||!1}function ne(e){return e&&!0===e.isRelationalNode&&!0===e.constructor.prototype.isNode||!1}function re(e){return e&&!0===e.isSymbolNode&&!0===e.constructor.prototype.isNode||!1}function ie(e){return e&&!0===e.constructor.prototype.isChain||!1}function oe(e){const t=typeof e;return"object"===t?null===e?"null":g(e)?"BigNumber":e.constructor&&e.constructor.name?e.constructor.name:"Object":t}function ae(e){const t=typeof e;if("number"===t||"bigint"===t||"string"===t||"boolean"===t||null==e)return e;if("function"==typeof e.clone)return e.clone();if(Array.isArray(e))return e.map((function(e){return ae(e)}));if(e instanceof Date)return new Date(e.valueOf());if(g(e))return e;if(q(e))return function(e,t){const n={};for(const r in e)me(e,r)&&(n[r]=t(e[r]));return n}(e,ae);if("function"===t)return e;throw new TypeError(`Cannot clone: unknown type of value (value: ${e})`)}function se(e,t){for(const n in t)me(t,n)&&(e[n]=t[n]);return e}function ue(e,t){if(Array.isArray(t))throw new TypeError("Arrays are not supported by deepExtend");for(const n in t)if(me(t,n)&&!(n in Object.prototype)&&!(n in Function.prototype))if(t[n]&&t[n].constructor===Object)void 0===e[n]&&(e[n]={}),e[n]&&e[n].constructor===Object?ue(e[n],t[n]):e[n]=t[n];else{if(Array.isArray(t[n]))throw new TypeError("Arrays are not supported by deepExtend");e[n]=t[n]}return e}function ce(e,t){let n,r,i;if(Array.isArray(e)){if(!Array.isArray(t))return!1;if(e.length!==t.length)return!1;for(r=0,i=e.length;r<i;r++)if(!ce(e[r],t[r]))return!1;return!0}if("function"==typeof e)return e===t;if(e instanceof Object){if(Array.isArray(t)||!(t instanceof Object))return!1;for(n in e)if(!(n in t)||!ce(e[n],t[n]))return!1;for(n in t)if(!(n in e))return!1;return!0}return e===t}function le(e){const t={};return fe(e,t),t}function fe(e,t){for(const n in e)if(me(e,n)){const r=e[n];"object"==typeof r&&null!==r?fe(r,t):t[n]=r}}function pe(e,t,n){let r,i=!0;Object.defineProperty(e,t,{get:function(){return i&&(r=n(),i=!1),r},set:function(e){r=e,i=!1},configurable:!0,enumerable:!0})}function me(e,t){return e&&Object.hasOwnProperty.call(e,t)}function de(e,t,n,r){function i(r){const i=function(e,t){const n={};for(let r=0;r<t.length;r++){const i=t[r],o=e[i];void 0!==o&&(n[i]=o)}return n}(r,t.map(ge));return function(e,t,n){if(!t.filter((e=>!function(e){return e&&"?"===e[0]}(e))).every((e=>void 0!==n[e]))){const r=t.filter((e=>void 0===n[e]));throw new Error(`Cannot create function "${e}", some dependencies are missing: ${r.map((e=>`"${e}"`)).join(", ")}.`)}}(e,t,r),n(i)}return i.isFactory=!0,i.fn=e,i.dependencies=t.slice().sort(),r&&(i.meta=r),i}function he(e){return"function"==typeof e&&"string"==typeof e.fn&&Array.isArray(e.dependencies)}function ge(e){return e&&"?"===e[0]?e.slice(1):e}function ye(e){return"boolean"==typeof e||!!isFinite(e)&&e===Math.round(e)}function xe(e,t){if("bigint"===t.number)try{BigInt(e)}catch(e){return t.numberFallback}return t.number}const be=Math.sign||function(e){return e>0?1:e<0?-1:0},we=Math.log2||function(e){return Math.log(e)/Math.LN2},ve=Math.log10||function(e){return Math.log(e)/Math.LN10},Ne=Math.log1p||function(e){return Math.log(e+1)},Ae=Math.cbrt||function(e){if(0===e)return e;const t=e<0;let n;return t&&(e=-e),isFinite(e)?(n=Math.exp(Math.log(e)/3),n=(e/(n*n)+2*n)/3):n=e,t?-n:n},Ee=Math.expm1||function(e){return e>=2e-4||e<=-2e-4?Math.exp(e)-1:e+e*e/2+e*e*e/6};function Se(e,t,n){const r={2:"0b",8:"0o",16:"0x"}[t];let i="";if(n){if(n<1)throw new Error("size must be in greater than 0");if(!ye(n))throw new Error("size must be an integer");if(e>2**(n-1)-1||e<-(2**(n-1)))throw new Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!ye(e))throw new Error("Value must be an integer");e<0&&(e+=2**n),i=`i${n}`}let o="";return e<0&&(e=-e,o="-"),`${o}${r}${e.toString(t)}${i}`}function Me(e,t){if("function"==typeof t)return t(e);if(e===1/0)return"Infinity";if(e===-1/0)return"-Infinity";if(isNaN(e))return"NaN";const{notation:n,precision:r,wordSize:i}=Ce(t);switch(n){case"fixed":return Be(e,r);case"exponential":return Fe(e,r);case"engineering":return function(e,t){if(isNaN(e)||!isFinite(e))return String(e);const n=De(Te(e),t),r=n.exponent,i=n.coefficients,o=r%3==0?r:r<0?r-3-r%3:r-r%3;if(h(t))for(;t>i.length||r-o+1>i.length;)i.push(0);else{const e=Math.abs(r-o)-(i.length-1);for(let t=0;t<e;t++)i.push(0)}let a=Math.abs(r-o),s=1;for(;a>0;)s++,a--;const u=i.slice(s).join(""),c=h(t)&&u.length||u.match(/[1-9]/)?"."+u:"",l=i.slice(0,s).join("")+c+"e"+(r>=0?"+":"")+o.toString();return n.sign+l}(e,r);case"bin":return Se(e,2,i);case"oct":return Se(e,8,i);case"hex":return Se(e,16,i);case"auto":return function(e,t,n){if(isNaN(e)||!isFinite(e))return String(e);const r=je(null==n?void 0:n.lowerExp,-3),i=je(null==n?void 0:n.upperExp,5),o=Te(e),a=t?De(o,t):o;if(a.exponent<r||a.exponent>=i)return Fe(e,t);{let e=a.coefficients;const n=a.exponent;e.length<t&&(e=e.concat(Oe(t-e.length))),e=e.concat(Oe(n-e.length+1+(e.length<t?t-e.length:0))),e=Oe(-n).concat(e);const r=n>0?n:0;return r<e.length-1&&e.splice(r+1,0,"."),a.sign+e.join("")}}(e,r,t).replace(/((\.\d*?)(0+))($|e)/,(function(){const e=arguments[2],t=arguments[4];return"."!==e?e+t:t}));default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}function Ce(e){let t,n,r="auto";if(void 0!==e)if(h(e))t=e;else if(g(e))t=e.toNumber();else{if(!q(e))throw new Error("Unsupported type of options, number, BigNumber, or object expected");void 0!==e.precision&&(t=Ue(e.precision,(()=>{throw new Error('Option "precision" must be a number or BigNumber')}))),void 0!==e.wordSize&&(n=Ue(e.wordSize,(()=>{throw new Error('Option "wordSize" must be a number or BigNumber')}))),e.notation&&(r=e.notation)}return{notation:r,precision:t,wordSize:n}}function Te(e){const t=String(e).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);if(!t)throw new SyntaxError("Invalid number "+e);const n=t[1],r=t[2];let i=parseFloat(t[4]||"0");const o=r.indexOf(".");i+=-1!==o?o-1:r.length-1;const a=r.replace(".","").replace(/^0*/,(function(e){return i-=e.length,""})).replace(/0*$/,"").split("").map((function(e){return parseInt(e)}));return 0===a.length&&(a.push(0),i++),{sign:n,coefficients:a,exponent:i}}function Be(e,t){if(isNaN(e)||!isFinite(e))return String(e);const n=Te(e),r="number"==typeof t?De(n,n.exponent+1+t):n;let i=r.coefficients,o=r.exponent+1;const a=o+(t||0);return i.length<a&&(i=i.concat(Oe(a-i.length))),o<0&&(i=Oe(1-o).concat(i),o=1),o<i.length&&i.splice(o,0,0===o?"0.":"."),r.sign+i.join("")}function Fe(e,t){if(isNaN(e)||!isFinite(e))return String(e);const n=Te(e),r=t?De(n,t):n;let i=r.coefficients;const o=r.exponent;i.length<t&&(i=i.concat(Oe(t-i.length)));const a=i.shift();return r.sign+a+(i.length>0?"."+i.join(""):"")+"e"+(o>=0?"+":"")+o}function De(e,t){const n={sign:e.sign,coefficients:e.coefficients,exponent:e.exponent},r=n.coefficients;for(;t<=0;)r.unshift(0),n.exponent++,t++;if(r.length>t&&r.splice(t,r.length-t)[0]>=5){let e=t-1;for(r[e]++;10===r[e];)r.pop(),0===e&&(r.unshift(0),n.exponent++,e++),e--,r[e]++}return n}function Oe(e){const t=[];for(let n=0;n<e;n++)t.push(0);return t}function _e(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:1e-8,r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(n<=0)throw new Error("Relative tolerance must be greater than 0");if(r<0)throw new Error("Absolute tolerance must be at least 0");return!isNaN(e)&&!isNaN(t)&&(isFinite(e)&&isFinite(t)?e===t||Math.abs(e-t)<=Math.max(n*Math.max(Math.abs(e),Math.abs(t)),r):e===t)}const ze=Math.acosh||function(e){return Math.log(Math.sqrt(e*e-1)+e)},qe=Math.asinh||function(e){return Math.log(Math.sqrt(e*e+1)+e)},Ie=Math.atanh||function(e){return Math.log((1+e)/(1-e))/2},ke=Math.cosh||function(e){return(Math.exp(e)+Math.exp(-e))/2},Re=Math.sinh||function(e){return(Math.exp(e)-Math.exp(-e))/2},Pe=Math.tanh||function(e){const t=Math.exp(2*e);return(t-1)/(t+1)};function Ue(e,t){return h(e)?e:g(e)?e.toNumber():void t()}function je(e,t){return h(e)?e:g(e)?e.toNumber():t}let Le=function(){return Le=t.create,t};const $e=de("typed",["?BigNumber","?Complex","?DenseMatrix","?Fraction"],(function(e){let{BigNumber:t,Complex:n,DenseMatrix:r,Fraction:i}=e;const o=Le();return o.clear(),o.addTypes([{name:"number",test:h},{name:"Complex",test:x},{name:"BigNumber",test:g},{name:"bigint",test:y},{name:"Fraction",test:b},{name:"Unit",test:w},{name:"identifier",test:e=>v&&/^[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC\u{10000}-\u{1000B}\u{1000D}-\u{10026}\u{10028}-\u{1003A}\u{1003C}\u{1003D}\u{1003F}-\u{1004D}\u{10050}-\u{1005D}\u{10080}-\u{100FA}\u{10280}-\u{1029C}\u{102A0}-\u{102D0}\u{10300}-\u{1031F}\u{1032D}-\u{10340}\u{10342}-\u{10349}\u{10350}-\u{10375}\u{10380}-\u{1039D}\u{103A0}-\u{103C3}\u{103C8}-\u{103CF}\u{10400}-\u{1049D}\u{104B0}-\u{104D3}\u{104D8}-\u{104FB}\u{10500}-\u{10527}\u{10530}-\u{10563}\u{10570}-\u{1057A}\u{1057C}-\u{1058A}\u{1058C}-\u{10592}\u{10594}\u{10595}\u{10597}-\u{105A1}\u{105A3}-\u{105B1}\u{105B3}-\u{105B9}\u{105BB}\u{105BC}\u{105C0}-\u{105F3}\u{10600}-\u{10736}\u{10740}-\u{10755}\u{10760}-\u{10767}\u{10780}-\u{10785}\u{10787}-\u{107B0}\u{107B2}-\u{107BA}\u{10800}-\u{10805}\u{10808}\u{1080A}-\u{10835}\u{10837}\u{10838}\u{1083C}\u{1083F}-\u{10855}\u{10860}-\u{10876}\u{10880}-\u{1089E}\u{108E0}-\u{108F2}\u{108F4}\u{108F5}\u{10900}-\u{10915}\u{10920}-\u{10939}\u{10980}-\u{109B7}\u{109BE}\u{109BF}\u{10A00}\u{10A10}-\u{10A13}\u{10A15}-\u{10A17}\u{10A19}-\u{10A35}\u{10A60}-\u{10A7C}\u{10A80}-\u{10A9C}\u{10AC0}-\u{10AC7}\u{10AC9}-\u{10AE4}\u{10B00}-\u{10B35}\u{10B40}-\u{10B55}\u{10B60}-\u{10B72}\u{10B80}-\u{10B91}\u{10C00}-\u{10C48}\u{10C80}-\u{10CB2}\u{10CC0}-\u{10CF2}\u{10D00}-\u{10D23}\u{10D4A}-\u{10D65}\u{10D6F}-\u{10D85}\u{10E80}-\u{10EA9}\u{10EB0}\u{10EB1}\u{10EC2}-\u{10EC4}\u{10F00}-\u{10F1C}\u{10F27}\u{10F30}-\u{10F45}\u{10F70}-\u{10F81}\u{10FB0}-\u{10FC4}\u{10FE0}-\u{10FF6}\u{11003}-\u{11037}\u{11071}\u{11072}\u{11075}\u{11083}-\u{110AF}\u{110D0}-\u{110E8}\u{11103}-\u{11126}\u{11144}\u{11147}\u{11150}-\u{11172}\u{11176}\u{11183}-\u{111B2}\u{111C1}-\u{111C4}\u{111DA}\u{111DC}\u{11200}-\u{11211}\u{11213}-\u{1122B}\u{1123F}\u{11240}\u{11280}-\u{11286}\u{11288}\u{1128A}-\u{1128D}\u{1128F}-\u{1129D}\u{1129F}-\u{112A8}\u{112B0}-\u{112DE}\u{11305}-\u{1130C}\u{1130F}\u{11310}\u{11313}-\u{11328}\u{1132A}-\u{11330}\u{11332}\u{11333}\u{11335}-\u{11339}\u{1133D}\u{11350}\u{1135D}-\u{11361}\u{11380}-\u{11389}\u{1138B}\u{1138E}\u{11390}-\u{113B5}\u{113B7}\u{113D1}\u{113D3}\u{11400}-\u{11434}\u{11447}-\u{1144A}\u{1145F}-\u{11461}\u{11480}-\u{114AF}\u{114C4}\u{114C5}\u{114C7}\u{11580}-\u{115AE}\u{115D8}-\u{115DB}\u{11600}-\u{1162F}\u{11644}\u{11680}-\u{116AA}\u{116B8}\u{11700}-\u{1171A}\u{11740}-\u{11746}\u{11800}-\u{1182B}\u{118A0}-\u{118DF}\u{118FF}-\u{11906}\u{11909}\u{1190C}-\u{11913}\u{11915}\u{11916}\u{11918}-\u{1192F}\u{1193F}\u{11941}\u{119A0}-\u{119A7}\u{119AA}-\u{119D0}\u{119E1}\u{119E3}\u{11A00}\u{11A0B}-\u{11A32}\u{11A3A}\u{11A50}\u{11A5C}-\u{11A89}\u{11A9D}\u{11AB0}-\u{11AF8}\u{11BC0}-\u{11BE0}\u{11C00}-\u{11C08}\u{11C0A}-\u{11C2E}\u{11C40}\u{11C72}-\u{11C8F}\u{11D00}-\u{11D06}\u{11D08}\u{11D09}\u{11D0B}-\u{11D30}\u{11D46}\u{11D60}-\u{11D65}\u{11D67}\u{11D68}\u{11D6A}-\u{11D89}\u{11D98}\u{11EE0}-\u{11EF2}\u{11F02}\u{11F04}-\u{11F10}\u{11F12}-\u{11F33}\u{11FB0}\u{12000}-\u{12399}\u{12480}-\u{12543}\u{12F90}-\u{12FF0}\u{13000}-\u{1342F}\u{13441}-\u{13446}\u{13460}-\u{143FA}\u{14400}-\u{14646}\u{16100}-\u{1611D}\u{16800}-\u{16A38}\u{16A40}-\u{16A5E}\u{16A70}-\u{16ABE}\u{16AD0}-\u{16AED}\u{16B00}-\u{16B2F}\u{16B40}-\u{16B43}\u{16B63}-\u{16B77}\u{16B7D}-\u{16B8F}\u{16D40}-\u{16D6C}\u{16E40}-\u{16E7F}\u{16F00}-\u{16F4A}\u{16F50}\u{16F93}-\u{16F9F}\u{16FE0}\u{16FE1}\u{16FE3}\u{17000}-\u{187F7}\u{18800}-\u{18CD5}\u{18CFF}-\u{18D08}\u{1AFF0}-\u{1AFF3}\u{1AFF5}-\u{1AFFB}\u{1AFFD}\u{1AFFE}\u{1B000}-\u{1B122}\u{1B132}\u{1B150}-\u{1B152}\u{1B155}\u{1B164}-\u{1B167}\u{1B170}-\u{1B2FB}\u{1BC00}-\u{1BC6A}\u{1BC70}-\u{1BC7C}\u{1BC80}-\u{1BC88}\u{1BC90}-\u{1BC99}\u{1D400}-\u{1D454}\u{1D456}-\u{1D49C}\u{1D49E}\u{1D49F}\u{1D4A2}\u{1D4A5}\u{1D4A6}\u{1D4A9}-\u{1D4AC}\u{1D4AE}-\u{1D4B9}\u{1D4BB}\u{1D4BD}-\u{1D4C3}\u{1D4C5}-\u{1D505}\u{1D507}-\u{1D50A}\u{1D50D}-\u{1D514}\u{1D516}-\u{1D51C}\u{1D51E}-\u{1D539}\u{1D53B}-\u{1D53E}\u{1D540}-\u{1D544}\u{1D546}\u{1D54A}-\u{1D550}\u{1D552}-\u{1D6A5}\u{1D6A8}-\u{1D6C0}\u{1D6C2}-\u{1D6DA}\u{1D6DC}-\u{1D6FA}\u{1D6FC}-\u{1D714}\u{1D716}-\u{1D734}\u{1D736}-\u{1D74E}\u{1D750}-\u{1D76E}\u{1D770}-\u{1D788}\u{1D78A}-\u{1D7A8}\u{1D7AA}-\u{1D7C2}\u{1D7C4}-\u{1D7CB}\u{1DF00}-\u{1DF1E}\u{1DF25}-\u{1DF2A}\u{1E030}-\u{1E06D}\u{1E100}-\u{1E12C}\u{1E137}-\u{1E13D}\u{1E14E}\u{1E290}-\u{1E2AD}\u{1E2C0}-\u{1E2EB}\u{1E4D0}-\u{1E4EB}\u{1E5D0}-\u{1E5ED}\u{1E5F0}\u{1E7E0}-\u{1E7E6}\u{1E7E8}-\u{1E7EB}\u{1E7ED}\u{1E7EE}\u{1E7F0}-\u{1E7FE}\u{1E800}-\u{1E8C4}\u{1E900}-\u{1E943}\u{1E94B}\u{1EE00}-\u{1EE03}\u{1EE05}-\u{1EE1F}\u{1EE21}\u{1EE22}\u{1EE24}\u{1EE27}\u{1EE29}-\u{1EE32}\u{1EE34}-\u{1EE37}\u{1EE39}\u{1EE3B}\u{1EE42}\u{1EE47}\u{1EE49}\u{1EE4B}\u{1EE4D}-\u{1EE4F}\u{1EE51}\u{1EE52}\u{1EE54}\u{1EE57}\u{1EE59}\u{1EE5B}\u{1EE5D}\u{1EE5F}\u{1EE61}\u{1EE62}\u{1EE64}\u{1EE67}-\u{1EE6A}\u{1EE6C}-\u{1EE72}\u{1EE74}-\u{1EE77}\u{1EE79}-\u{1EE7C}\u{1EE7E}\u{1EE80}-\u{1EE89}\u{1EE8B}-\u{1EE9B}\u{1EEA1}-\u{1EEA3}\u{1EEA5}-\u{1EEA9}\u{1EEAB}-\u{1EEBB}\u{20000}-\u{2A6DF}\u{2A700}-\u{2B739}\u{2B740}-\u{2B81D}\u{2B820}-\u{2CEA1}\u{2CEB0}-\u{2EBE0}\u{2EBF0}-\u{2EE5D}\u{2F800}-\u{2FA1D}\u{30000}-\u{3134A}\u{31350}-\u{323AF}][0-9A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC\u{10000}-\u{1000B}\u{1000D}-\u{10026}\u{10028}-\u{1003A}\u{1003C}\u{1003D}\u{1003F}-\u{1004D}\u{10050}-\u{1005D}\u{10080}-\u{100FA}\u{10280}-\u{1029C}\u{102A0}-\u{102D0}\u{10300}-\u{1031F}\u{1032D}-\u{10340}\u{10342}-\u{10349}\u{10350}-\u{10375}\u{10380}-\u{1039D}\u{103A0}-\u{103C3}\u{103C8}-\u{103CF}\u{10400}-\u{1049D}\u{104B0}-\u{104D3}\u{104D8}-\u{104FB}\u{10500}-\u{10527}\u{10530}-\u{10563}\u{10570}-\u{1057A}\u{1057C}-\u{1058A}\u{1058C}-\u{10592}\u{10594}\u{10595}\u{10597}-\u{105A1}\u{105A3}-\u{105B1}\u{105B3}-\u{105B9}\u{105BB}\u{105BC}\u{105C0}-\u{105F3}\u{10600}-\u{10736}\u{10740}-\u{10755}\u{10760}-\u{10767}\u{10780}-\u{10785}\u{10787}-\u{107B0}\u{107B2}-\u{107BA}\u{10800}-\u{10805}\u{10808}\u{1080A}-\u{10835}\u{10837}\u{10838}\u{1083C}\u{1083F}-\u{10855}\u{10860}-\u{10876}\u{10880}-\u{1089E}\u{108E0}-\u{108F2}\u{108F4}\u{108F5}\u{10900}-\u{10915}\u{10920}-\u{10939}\u{10980}-\u{109B7}\u{109BE}\u{109BF}\u{10A00}\u{10A10}-\u{10A13}\u{10A15}-\u{10A17}\u{10A19}-\u{10A35}\u{10A60}-\u{10A7C}\u{10A80}-\u{10A9C}\u{10AC0}-\u{10AC7}\u{10AC9}-\u{10AE4}\u{10B00}-\u{10B35}\u{10B40}-\u{10B55}\u{10B60}-\u{10B72}\u{10B80}-\u{10B91}\u{10C00}-\u{10C48}\u{10C80}-\u{10CB2}\u{10CC0}-\u{10CF2}\u{10D00}-\u{10D23}\u{10D4A}-\u{10D65}\u{10D6F}-\u{10D85}\u{10E80}-\u{10EA9}\u{10EB0}\u{10EB1}\u{10EC2}-\u{10EC4}\u{10F00}-\u{10F1C}\u{10F27}\u{10F30}-\u{10F45}\u{10F70}-\u{10F81}\u{10FB0}-\u{10FC4}\u{10FE0}-\u{10FF6}\u{11003}-\u{11037}\u{11071}\u{11072}\u{11075}\u{11083}-\u{110AF}\u{110D0}-\u{110E8}\u{11103}-\u{11126}\u{11144}\u{11147}\u{11150}-\u{11172}\u{11176}\u{11183}-\u{111B2}\u{111C1}-\u{111C4}\u{111DA}\u{111DC}\u{11200}-\u{11211}\u{11213}-\u{1122B}\u{1123F}\u{11240}\u{11280}-\u{11286}\u{11288}\u{1128A}-\u{1128D}\u{1128F}-\u{1129D}\u{1129F}-\u{112A8}\u{112B0}-\u{112DE}\u{11305}-\u{1130C}\u{1130F}\u{11310}\u{11313}-\u{11328}\u{1132A}-\u{11330}\u{11332}\u{11333}\u{11335}-\u{11339}\u{1133D}\u{11350}\u{1135D}-\u{11361}\u{11380}-\u{11389}\u{1138B}\u{1138E}\u{11390}-\u{113B5}\u{113B7}\u{113D1}\u{113D3}\u{11400}-\u{11434}\u{11447}-\u{1144A}\u{1145F}-\u{11461}\u{11480}-\u{114AF}\u{114C4}\u{114C5}\u{114C7}\u{11580}-\u{115AE}\u{115D8}-\u{115DB}\u{11600}-\u{1162F}\u{11644}\u{11680}-\u{116AA}\u{116B8}\u{11700}-\u{1171A}\u{11740}-\u{11746}\u{11800}-\u{1182B}\u{118A0}-\u{118DF}\u{118FF}-\u{11906}\u{11909}\u{1190C}-\u{11913}\u{11915}\u{11916}\u{11918}-\u{1192F}\u{1193F}\u{11941}\u{119A0}-\u{119A7}\u{119AA}-\u{119D0}\u{119E1}\u{119E3}\u{11A00}\u{11A0B}-\u{11A32}\u{11A3A}\u{11A50}\u{11A5C}-\u{11A89}\u{11A9D}\u{11AB0}-\u{11AF8}\u{11BC0}-\u{11BE0}\u{11C00}-\u{11C08}\u{11C0A}-\u{11C2E}\u{11C40}\u{11C72}-\u{11C8F}\u{11D00}-\u{11D06}\u{11D08}\u{11D09}\u{11D0B}-\u{11D30}\u{11D46}\u{11D60}-\u{11D65}\u{11D67}\u{11D68}\u{11D6A}-\u{11D89}\u{11D98}\u{11EE0}-\u{11EF2}\u{11F02}\u{11F04}-\u{11F10}\u{11F12}-\u{11F33}\u{11FB0}\u{12000}-\u{12399}\u{12480}-\u{12543}\u{12F90}-\u{12FF0}\u{13000}-\u{1342F}\u{13441}-\u{13446}\u{13460}-\u{143FA}\u{14400}-\u{14646}\u{16100}-\u{1611D}\u{16800}-\u{16A38}\u{16A40}-\u{16A5E}\u{16A70}-\u{16ABE}\u{16AD0}-\u{16AED}\u{16B00}-\u{16B2F}\u{16B40}-\u{16B43}\u{16B63}-\u{16B77}\u{16B7D}-\u{16B8F}\u{16D40}-\u{16D6C}\u{16E40}-\u{16E7F}\u{16F00}-\u{16F4A}\u{16F50}\u{16F93}-\u{16F9F}\u{16FE0}\u{16FE1}\u{16FE3}\u{17000}-\u{187F7}\u{18800}-\u{18CD5}\u{18CFF}-\u{18D08}\u{1AFF0}-\u{1AFF3}\u{1AFF5}-\u{1AFFB}\u{1AFFD}\u{1AFFE}\u{1B000}-\u{1B122}\u{1B132}\u{1B150}-\u{1B152}\u{1B155}\u{1B164}-\u{1B167}\u{1B170}-\u{1B2FB}\u{1BC00}-\u{1BC6A}\u{1BC70}-\u{1BC7C}\u{1BC80}-\u{1BC88}\u{1BC90}-\u{1BC99}\u{1D400}-\u{1D454}\u{1D456}-\u{1D49C}\u{1D49E}\u{1D49F}\u{1D4A2}\u{1D4A5}\u{1D4A6}\u{1D4A9}-\u{1D4AC}\u{1D4AE}-\u{1D4B9}\u{1D4BB}\u{1D4BD}-\u{1D4C3}\u{1D4C5}-\u{1D505}\u{1D507}-\u{1D50A}\u{1D50D}-\u{1D514}\u{1D516}-\u{1D51C}\u{1D51E}-\u{1D539}\u{1D53B}-\u{1D53E}\u{1D540}-\u{1D544}\u{1D546}\u{1D54A}-\u{1D550}\u{1D552}-\u{1D6A5}\u{1D6A8}-\u{1D6C0}\u{1D6C2}-\u{1D6DA}\u{1D6DC}-\u{1D6FA}\u{1D6FC}-\u{1D714}\u{1D716}-\u{1D734}\u{1D736}-\u{1D74E}\u{1D750}-\u{1D76E}\u{1D770}-\u{1D788}\u{1D78A}-\u{1D7A8}\u{1D7AA}-\u{1D7C2}\u{1D7C4}-\u{1D7CB}\u{1DF00}-\u{1DF1E}\u{1DF25}-\u{1DF2A}\u{1E030}-\u{1E06D}\u{1E100}-\u{1E12C}\u{1E137}-\u{1E13D}\u{1E14E}\u{1E290}-\u{1E2AD}\u{1E2C0}-\u{1E2EB}\u{1E4D0}-\u{1E4EB}\u{1E5D0}-\u{1E5ED}\u{1E5F0}\u{1E7E0}-\u{1E7E6}\u{1E7E8}-\u{1E7EB}\u{1E7ED}\u{1E7EE}\u{1E7F0}-\u{1E7FE}\u{1E800}-\u{1E8C4}\u{1E900}-\u{1E943}\u{1E94B}\u{1EE00}-\u{1EE03}\u{1EE05}-\u{1EE1F}\u{1EE21}\u{1EE22}\u{1EE24}\u{1EE27}\u{1EE29}-\u{1EE32}\u{1EE34}-\u{1EE37}\u{1EE39}\u{1EE3B}\u{1EE42}\u{1EE47}\u{1EE49}\u{1EE4B}\u{1EE4D}-\u{1EE4F}\u{1EE51}\u{1EE52}\u{1EE54}\u{1EE57}\u{1EE59}\u{1EE5B}\u{1EE5D}\u{1EE5F}\u{1EE61}\u{1EE62}\u{1EE64}\u{1EE67}-\u{1EE6A}\u{1EE6C}-\u{1EE72}\u{1EE74}-\u{1EE77}\u{1EE79}-\u{1EE7C}\u{1EE7E}\u{1EE80}-\u{1EE89}\u{1EE8B}-\u{1EE9B}\u{1EEA1}-\u{1EEA3}\u{1EEA5}-\u{1EEA9}\u{1EEAB}-\u{1EEBB}\u{20000}-\u{2A6DF}\u{2A700}-\u{2B739}\u{2B740}-\u{2B81D}\u{2B820}-\u{2CEA1}\u{2CEB0}-\u{2EBE0}\u{2EBF0}-\u{2EE5D}\u{2F800}-\u{2FA1D}\u{30000}-\u{3134A}\u{31350}-\u{323AF}]*$/u.test(e)},{name:"string",test:v},{name:"Chain",test:ie},{name:"Array",test:N},{name:"Matrix",test:A},{name:"DenseMatrix",test:S},{name:"SparseMatrix",test:M},{name:"Range",test:C},{name:"Index",test:T},{name:"boolean",test:B},{name:"ResultSet",test:F},{name:"Help",test:D},{name:"function",test:O},{name:"Date",test:_},{name:"RegExp",test:z},{name:"null",test:P},{name:"undefined",test:U},{name:"AccessorNode",test:j},{name:"ArrayNode",test:L},{name:"AssignmentNode",test:$},{name:"BlockNode",test:H},{name:"ConditionalNode",test:G},{name:"ConstantNode",test:Z},{name:"FunctionNode",test:Y},{name:"FunctionAssignmentNode",test:W},{name:"IndexNode",test:J},{name:"Node",test:X},{name:"ObjectNode",test:Q},{name:"OperatorNode",test:K},{name:"ParenthesisNode",test:ee},{name:"RangeNode",test:te},{name:"RelationalNode",test:ne},{name:"SymbolNode",test:re},{name:"Map",test:I},{name:"Object",test:q}]),o.addConversions([{from:"number",to:"BigNumber",convert:function(e){if(t||He(e),e.toExponential().replace(/e.*$/,"").replace(/^0\.?0*|\./,"").length>15)throw new TypeError("Cannot implicitly convert a number with >15 significant digits to BigNumber (value: "+e+"). Use function bignumber(x) to convert to BigNumber.");return new t(e)}},{from:"number",to:"Complex",convert:function(e){return n||Ge(e),new n(e,0)}},{from:"BigNumber",to:"Complex",convert:function(e){return n||Ge(e),new n(e.toNumber(),0)}},{from:"bigint",to:"number",convert:function(e){if(e>Number.MAX_SAFE_INTEGER)throw new TypeError("Cannot implicitly convert bigint to number: value exceeds the max safe integer value (value: "+e+")");return Number(e)}},{from:"bigint",to:"BigNumber",convert:function(e){return t||He(e),new t(e.toString())}},{from:"bigint",to:"Fraction",convert:function(e){return i||Ze(e),new i(e)}},{from:"Fraction",to:"BigNumber",convert:function(e){throw new TypeError("Cannot implicitly convert a Fraction to BigNumber or vice versa. Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.")}},{from:"Fraction",to:"Complex",convert:function(e){return n||Ge(e),new n(e.valueOf(),0)}},{from:"number",to:"Fraction",convert:function(e){i||Ze(e);const t=new i(e);if(t.valueOf()!==e)throw new TypeError("Cannot implicitly convert a number to a Fraction when there will be a loss of precision (value: "+e+"). Use function fraction(x) to convert to Fraction.");return t}},{from:"string",to:"number",convert:function(e){const t=Number(e);if(isNaN(t))throw new Error('Cannot convert "'+e+'" to a number');return t}},{from:"string",to:"BigNumber",convert:function(e){t||He(e);try{return new t(e)}catch(t){throw new Error('Cannot convert "'+e+'" to BigNumber')}}},{from:"string",to:"bigint",convert:function(e){try{return BigInt(e)}catch(t){throw new Error('Cannot convert "'+e+'" to BigInt')}}},{from:"string",to:"Fraction",convert:function(e){i||Ze(e);try{return new i(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Fraction')}}},{from:"string",to:"Complex",convert:function(e){n||Ge(e);try{return new n(e)}catch(t){throw new Error('Cannot convert "'+e+'" to Complex')}}},{from:"boolean",to:"number",convert:function(e){return+e}},{from:"boolean",to:"BigNumber",convert:function(e){return t||He(e),new t(+e)}},{from:"boolean",to:"bigint",convert:function(e){return BigInt(+e)}},{from:"boolean",to:"Fraction",convert:function(e){return i||Ze(e),new i(+e)}},{from:"boolean",to:"string",convert:function(e){return String(e)}},{from:"Array",to:"Matrix",convert:function(e){return r||function(){throw new Error("Cannot convert array into a Matrix: no class 'DenseMatrix' provided")}(),new r(e)}},{from:"Matrix",to:"Array",convert:function(e){return e.valueOf()}}]),o.onMismatch=(e,t,n)=>{const r=o.createError(e,t,n);if(["wrongType","mismatch"].includes(r.data.category)&&1===t.length&&E(t[0])&&n.some((e=>!e.params.includes(",")))){const t=new TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw t.data=r.data,t}throw r},o.onMismatch=(e,t,n)=>{const r=o.createError(e,t,n);if(["wrongType","mismatch"].includes(r.data.category)&&1===t.length&&E(t[0])&&n.some((e=>!e.params.includes(",")))){const t=new TypeError(`Function '${e}' doesn't apply to matrices. To call it elementwise on a matrix 'M', try 'map(M, ${e})'.`);throw t.data=r.data,t}throw r},o}));function He(e){throw new Error(`Cannot convert value ${e} into a BigNumber: no class 'BigNumber' provided`)}function Ge(e){throw new Error(`Cannot convert value ${e} into a Complex number: no class 'Complex' provided`)}function Ze(e){throw new Error(`Cannot convert value ${e} into a Fraction, no class 'Fraction' provided.`)}const Ve=de("ResultSet",[],(()=>{function e(t){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");this.entries=t||[]}return e.prototype.type="ResultSet",e.prototype.isResultSet=!0,e.prototype.valueOf=function(){return this.entries},e.prototype.toString=function(){return"["+this.entries.map(String).join(", ")+"]"},e.prototype.toJSON=function(){return{mathjs:"ResultSet",entries:this.entries}},e.fromJSON=function(t){return new e(t.entries)},e}),{isClass:!0});var We,Ye,Je=9e15,Xe=1e9,Qe="0123456789abcdef",Ke="2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058",et="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789",tt={precision:20,rounding:4,modulo:1,toExpNeg:-7,toExpPos:21,minE:-Je,maxE:Je,crypto:!1},nt=!0,rt="[DecimalError] ",it=rt+"Invalid argument: ",ot=rt+"Precision limit exceeded",at=rt+"crypto unavailable",st="[object Decimal]",ut=Math.floor,ct=Math.pow,lt=/^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,ft=/^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,pt=/^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,mt=/^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,dt=1e7,ht=Ke.length-1,gt=et.length-1,yt={toStringTag:st};function xt(e){var t,n,r,i=e.length-1,o="",a=e[0];if(i>0){for(o+=a,t=1;t<i;t++)(n=7-(r=e[t]+"").length)&&(o+=Bt(n)),o+=r;(n=7-(r=(a=e[t])+"").length)&&(o+=Bt(n))}else if(0===a)return"0";for(;a%10==0;)a/=10;return o+a}function bt(e,t,n){if(e!==~~e||e<t||e>n)throw Error(it+e)}function wt(e,t,n,r){var i,o,a,s;for(o=e[0];o>=10;o/=10)--t;return--t<0?(t+=7,i=0):(i=Math.ceil((t+1)/7),t%=7),o=ct(10,7-t),s=e[i]%o|0,null==r?t<3?(0==t?s=s/100|0:1==t&&(s=s/10|0),a=n<4&&99999==s||n>3&&49999==s||5e4==s||0==s):a=(n<4&&s+1==o||n>3&&s+1==o/2)&&(e[i+1]/o/100|0)==ct(10,t-2)-1||(s==o/2||0==s)&&!(e[i+1]/o/100|0):t<4?(0==t?s=s/1e3|0:1==t?s=s/100|0:2==t&&(s=s/10|0),a=(r||n<4)&&9999==s||!r&&n>3&&4999==s):a=((r||n<4)&&s+1==o||!r&&n>3&&s+1==o/2)&&(e[i+1]/o/1e3|0)==ct(10,t-3)-1,a}function vt(e,t,n){for(var r,i,o=[0],a=0,s=e.length;a<s;){for(i=o.length;i--;)o[i]*=t;for(o[0]+=Qe.indexOf(e.charAt(a++)),r=0;r<o.length;r++)o[r]>n-1&&(void 0===o[r+1]&&(o[r+1]=0),o[r+1]+=o[r]/n|0,o[r]%=n)}return o.reverse()}yt.absoluteValue=yt.abs=function(){var e=new this.constructor(this);return e.s<0&&(e.s=1),At(e)},yt.ceil=function(){return At(new this.constructor(this),this.e+1,2)},yt.clampedTo=yt.clamp=function(e,t){var n=this,r=n.constructor;if(e=new r(e),t=new r(t),!e.s||!t.s)return new r(NaN);if(e.gt(t))throw Error(it+t);return n.cmp(e)<0?e:n.cmp(t)>0?t:new r(n)},yt.comparedTo=yt.cmp=function(e){var t,n,r,i,o=this,a=o.d,s=(e=new o.constructor(e)).d,u=o.s,c=e.s;if(!a||!s)return u&&c?u!==c?u:a===s?0:!a^u<0?1:-1:NaN;if(!a[0]||!s[0])return a[0]?u:s[0]?-c:0;if(u!==c)return u;if(o.e!==e.e)return o.e>e.e^u<0?1:-1;for(t=0,n=(r=a.length)<(i=s.length)?r:i;t<n;++t)if(a[t]!==s[t])return a[t]>s[t]^u<0?1:-1;return r===i?0:r>i^u<0?1:-1},yt.cosine=yt.cos=function(){var e,t,n=this,r=n.constructor;return n.d?n.d[0]?(e=r.precision,t=r.rounding,r.precision=e+Math.max(n.e,n.sd())+7,r.rounding=1,n=function(e,t){var n,r,i;if(t.isZero())return t;(r=t.d.length)<32?i=(1/Pt(4,n=Math.ceil(r/3))).toString():(n=16,i="2.3283064365386962890625e-10"),e.precision+=n,t=Rt(e,1,t.times(i),new e(1));for(var o=n;o--;){var a=t.times(t);t=a.times(a).minus(a).times(8).plus(1)}return e.precision-=n,t}(r,Ut(r,n)),r.precision=e,r.rounding=t,At(2==Ye||3==Ye?n.neg():n,e,t,!0)):new r(1):new r(NaN)},yt.cubeRoot=yt.cbrt=function(){var e,t,n,r,i,o,a,s,u,c,l=this,f=l.constructor;if(!l.isFinite()||l.isZero())return new f(l);for(nt=!1,(o=l.s*ct(l.s*l,1/3))&&Math.abs(o)!=1/0?r=new f(o.toString()):(n=xt(l.d),(o=((e=l.e)-n.length+1)%3)&&(n+=1==o||-2==o?"0":"00"),o=ct(n,1/3),e=ut((e+1)/3)-(e%3==(e<0?-1:2)),(r=new f(n=o==1/0?"5e"+e:(n=o.toExponential()).slice(0,n.indexOf("e")+1)+e)).s=l.s),a=(e=f.precision)+3;;)if(c=(u=(s=r).times(s).times(s)).plus(l),r=Nt(c.plus(l).times(s),c.plus(u),a+2,1),xt(s.d).slice(0,a)===(n=xt(r.d)).slice(0,a)){if("9999"!=(n=n.slice(a-3,a+1))&&(i||"4999"!=n)){+n&&(+n.slice(1)||"5"!=n.charAt(0))||(At(r,e+1,1),t=!r.times(r).times(r).eq(l));break}if(!i&&(At(s,e+1,0),s.times(s).times(s).eq(l))){r=s;break}a+=4,i=1}return nt=!0,At(r,e,f.rounding,t)},yt.decimalPlaces=yt.dp=function(){var e,t=this.d,n=NaN;if(t){if(n=7*((e=t.length-1)-ut(this.e/7)),e=t[e])for(;e%10==0;e/=10)n--;n<0&&(n=0)}return n},yt.dividedBy=yt.div=function(e){return Nt(this,new this.constructor(e))},yt.dividedToIntegerBy=yt.divToInt=function(e){var t=this.constructor;return At(Nt(this,new t(e),0,1,1),t.precision,t.rounding)},yt.equals=yt.eq=function(e){return 0===this.cmp(e)},yt.floor=function(){return At(new this.constructor(this),this.e+1,3)},yt.greaterThan=yt.gt=function(e){return this.cmp(e)>0},yt.greaterThanOrEqualTo=yt.gte=function(e){var t=this.cmp(e);return 1==t||0===t},yt.hyperbolicCosine=yt.cosh=function(){var e,t,n,r,i,o=this,a=o.constructor,s=new a(1);if(!o.isFinite())return new a(o.s?1/0:NaN);if(o.isZero())return s;n=a.precision,r=a.rounding,a.precision=n+Math.max(o.e,o.sd())+4,a.rounding=1,(i=o.d.length)<32?t=(1/Pt(4,e=Math.ceil(i/3))).toString():(e=16,t="2.3283064365386962890625e-10"),o=Rt(a,1,o.times(t),new a(1),!0);for(var u,c=e,l=new a(8);c--;)u=o.times(o),o=s.minus(u.times(l.minus(u.times(l))));return At(o,a.precision=n,a.rounding=r,!0)},yt.hyperbolicSine=yt.sinh=function(){var e,t,n,r,i=this,o=i.constructor;if(!i.isFinite()||i.isZero())return new o(i);if(t=o.precision,n=o.rounding,o.precision=t+Math.max(i.e,i.sd())+4,o.rounding=1,(r=i.d.length)<3)i=Rt(o,2,i,i,!0);else{e=(e=1.4*Math.sqrt(r))>16?16:0|e,i=Rt(o,2,i=i.times(1/Pt(5,e)),i,!0);for(var a,s=new o(5),u=new o(16),c=new o(20);e--;)a=i.times(i),i=i.times(s.plus(a.times(u.times(a).plus(c))))}return o.precision=t,o.rounding=n,At(i,t,n,!0)},yt.hyperbolicTangent=yt.tanh=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+7,r.rounding=1,Nt(n.sinh(),n.cosh(),r.precision=e,r.rounding=t)):new r(n.s)},yt.inverseCosine=yt.acos=function(){var e=this,t=e.constructor,n=e.abs().cmp(1),r=t.precision,i=t.rounding;return-1!==n?0===n?e.isNeg()?Ct(t,r,i):new t(0):new t(NaN):e.isZero()?Ct(t,r+4,i).times(.5):(t.precision=r+6,t.rounding=1,e=new t(1).minus(e).div(e.plus(1)).sqrt().atan(),t.precision=r,t.rounding=i,e.times(2))},yt.inverseHyperbolicCosine=yt.acosh=function(){var e,t,n=this,r=n.constructor;return n.lte(1)?new r(n.eq(1)?0:NaN):n.isFinite()?(e=r.precision,t=r.rounding,r.precision=e+Math.max(Math.abs(n.e),n.sd())+4,r.rounding=1,nt=!1,n=n.times(n).minus(1).sqrt().plus(n),nt=!0,r.precision=e,r.rounding=t,n.ln()):new r(n)},yt.inverseHyperbolicSine=yt.asinh=function(){var e,t,n=this,r=n.constructor;return!n.isFinite()||n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+2*Math.max(Math.abs(n.e),n.sd())+6,r.rounding=1,nt=!1,n=n.times(n).plus(1).sqrt().plus(n),nt=!0,r.precision=e,r.rounding=t,n.ln())},yt.inverseHyperbolicTangent=yt.atanh=function(){var e,t,n,r,i=this,o=i.constructor;return i.isFinite()?i.e>=0?new o(i.abs().eq(1)?i.s/0:i.isZero()?i:NaN):(e=o.precision,t=o.rounding,r=i.sd(),Math.max(r,e)<2*-i.e-1?At(new o(i),e,t,!0):(o.precision=n=r-i.e,i=Nt(i.plus(1),new o(1).minus(i),n+e,1),o.precision=e+4,o.rounding=1,i=i.ln(),o.precision=e,o.rounding=t,i.times(.5))):new o(NaN)},yt.inverseSine=yt.asin=function(){var e,t,n,r,i=this,o=i.constructor;return i.isZero()?new o(i):(t=i.abs().cmp(1),n=o.precision,r=o.rounding,-1!==t?0===t?((e=Ct(o,n+4,r).times(.5)).s=i.s,e):new o(NaN):(o.precision=n+6,o.rounding=1,i=i.div(new o(1).minus(i.times(i)).sqrt().plus(1)).atan(),o.precision=n,o.rounding=r,i.times(2)))},yt.inverseTangent=yt.atan=function(){var e,t,n,r,i,o,a,s,u,c=this,l=c.constructor,f=l.precision,p=l.rounding;if(c.isFinite()){if(c.isZero())return new l(c);if(c.abs().eq(1)&&f+4<=gt)return(a=Ct(l,f+4,p).times(.25)).s=c.s,a}else{if(!c.s)return new l(NaN);if(f+4<=gt)return(a=Ct(l,f+4,p).times(.5)).s=c.s,a}for(l.precision=s=f+10,l.rounding=1,e=n=Math.min(28,s/7+2|0);e;--e)c=c.div(c.times(c).plus(1).sqrt().plus(1));for(nt=!1,t=Math.ceil(s/7),r=1,u=c.times(c),a=new l(c),i=c;-1!==e;)if(i=i.times(u),o=a.minus(i.div(r+=2)),i=i.times(u),void 0!==(a=o.plus(i.div(r+=2))).d[t])for(e=t;a.d[e]===o.d[e]&&e--;);return n&&(a=a.times(2<<n-1)),nt=!0,At(a,l.precision=f,l.rounding=p,!0)},yt.isFinite=function(){return!!this.d},yt.isInteger=yt.isInt=function(){return!!this.d&&ut(this.e/7)>this.d.length-2},yt.isNaN=function(){return!this.s},yt.isNegative=yt.isNeg=function(){return this.s<0},yt.isPositive=yt.isPos=function(){return this.s>0},yt.isZero=function(){return!!this.d&&0===this.d[0]},yt.lessThan=yt.lt=function(e){return this.cmp(e)<0},yt.lessThanOrEqualTo=yt.lte=function(e){return this.cmp(e)<1},yt.logarithm=yt.log=function(e){var t,n,r,i,o,a,s,u,c=this,l=c.constructor,f=l.precision,p=l.rounding;if(null==e)e=new l(10),t=!0;else{if(n=(e=new l(e)).d,e.s<0||!n||!n[0]||e.eq(1))return new l(NaN);t=e.eq(10)}if(n=c.d,c.s<0||!n||!n[0]||c.eq(1))return new l(n&&!n[0]?-1/0:1!=c.s?NaN:n?0:1/0);if(t)if(n.length>1)o=!0;else{for(i=n[0];i%10==0;)i/=10;o=1!==i}if(nt=!1,a=zt(c,s=f+5),r=t?Mt(l,s+10):zt(e,s),wt((u=Nt(a,r,s,1)).d,i=f,p))do{if(a=zt(c,s+=10),r=t?Mt(l,s+10):zt(e,s),u=Nt(a,r,s,1),!o){+xt(u.d).slice(i+1,i+15)+1==1e14&&(u=At(u,f+1,0));break}}while(wt(u.d,i+=10,p));return nt=!0,At(u,f,p)},yt.minus=yt.sub=function(e){var t,n,r,i,o,a,s,u,c,l,f,p,m=this,d=m.constructor;if(e=new d(e),!m.d||!e.d)return m.s&&e.s?m.d?e.s=-e.s:e=new d(e.d||m.s!==e.s?m:NaN):e=new d(NaN),e;if(m.s!=e.s)return e.s=-e.s,m.plus(e);if(c=m.d,p=e.d,s=d.precision,u=d.rounding,!c[0]||!p[0]){if(p[0])e.s=-e.s;else{if(!c[0])return new d(3===u?-0:0);e=new d(m)}return nt?At(e,s,u):e}if(n=ut(e.e/7),l=ut(m.e/7),c=c.slice(),o=l-n){for((f=o<0)?(t=c,o=-o,a=p.length):(t=p,n=l,a=c.length),o>(r=Math.max(Math.ceil(s/7),a)+2)&&(o=r,t.length=1),t.reverse(),r=o;r--;)t.push(0);t.reverse()}else{for((f=(r=c.length)<(a=p.length))&&(a=r),r=0;r<a;r++)if(c[r]!=p[r]){f=c[r]<p[r];break}o=0}for(f&&(t=c,c=p,p=t,e.s=-e.s),a=c.length,r=p.length-a;r>0;--r)c[a++]=0;for(r=p.length;r>o;){if(c[--r]<p[r]){for(i=r;i&&0===c[--i];)c[i]=dt-1;--c[i],c[r]+=dt}c[r]-=p[r]}for(;0===c[--a];)c.pop();for(;0===c[0];c.shift())--n;return c[0]?(e.d=c,e.e=St(c,n),nt?At(e,s,u):e):new d(3===u?-0:0)},yt.modulo=yt.mod=function(e){var t,n=this,r=n.constructor;return e=new r(e),!n.d||!e.s||e.d&&!e.d[0]?new r(NaN):!e.d||n.d&&!n.d[0]?At(new r(n),r.precision,r.rounding):(nt=!1,9==r.modulo?(t=Nt(n,e.abs(),0,3,1)).s*=e.s:t=Nt(n,e,0,r.modulo,1),t=t.times(e),nt=!0,n.minus(t))},yt.naturalExponential=yt.exp=function(){return _t(this)},yt.naturalLogarithm=yt.ln=function(){return zt(this)},yt.negated=yt.neg=function(){var e=new this.constructor(this);return e.s=-e.s,At(e)},yt.plus=yt.add=function(e){var t,n,r,i,o,a,s,u,c,l,f=this,p=f.constructor;if(e=new p(e),!f.d||!e.d)return f.s&&e.s?f.d||(e=new p(e.d||f.s===e.s?f:NaN)):e=new p(NaN),e;if(f.s!=e.s)return e.s=-e.s,f.minus(e);if(c=f.d,l=e.d,s=p.precision,u=p.rounding,!c[0]||!l[0])return l[0]||(e=new p(f)),nt?At(e,s,u):e;if(o=ut(f.e/7),r=ut(e.e/7),c=c.slice(),i=o-r){for(i<0?(n=c,i=-i,a=l.length):(n=l,r=o,a=c.length),i>(a=(o=Math.ceil(s/7))>a?o+1:a+1)&&(i=a,n.length=1),n.reverse();i--;)n.push(0);n.reverse()}for((a=c.length)-(i=l.length)<0&&(i=a,n=l,l=c,c=n),t=0;i;)t=(c[--i]=c[i]+l[i]+t)/dt|0,c[i]%=dt;for(t&&(c.unshift(t),++r),a=c.length;0==c[--a];)c.pop();return e.d=c,e.e=St(c,r),nt?At(e,s,u):e},yt.precision=yt.sd=function(e){var t,n=this;if(void 0!==e&&e!==!!e&&1!==e&&0!==e)throw Error(it+e);return n.d?(t=Tt(n.d),e&&n.e+1>t&&(t=n.e+1)):t=NaN,t},yt.round=function(){var e=this,t=e.constructor;return At(new t(e),e.e+1,t.rounding)},yt.sine=yt.sin=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+Math.max(n.e,n.sd())+7,r.rounding=1,n=function(e,t){var n,r=t.d.length;if(r<3)return t.isZero()?t:Rt(e,2,t,t);n=(n=1.4*Math.sqrt(r))>16?16:0|n,t=Rt(e,2,t=t.times(1/Pt(5,n)),t);for(var i,o=new e(5),a=new e(16),s=new e(20);n--;)i=t.times(t),t=t.times(o.plus(i.times(a.times(i).minus(s))));return t}(r,Ut(r,n)),r.precision=e,r.rounding=t,At(Ye>2?n.neg():n,e,t,!0)):new r(NaN)},yt.squareRoot=yt.sqrt=function(){var e,t,n,r,i,o,a=this,s=a.d,u=a.e,c=a.s,l=a.constructor;if(1!==c||!s||!s[0])return new l(!c||c<0&&(!s||s[0])?NaN:s?a:1/0);for(nt=!1,0==(c=Math.sqrt(+a))||c==1/0?(((t=xt(s)).length+u)%2==0&&(t+="0"),c=Math.sqrt(t),u=ut((u+1)/2)-(u<0||u%2),r=new l(t=c==1/0?"5e"+u:(t=c.toExponential()).slice(0,t.indexOf("e")+1)+u)):r=new l(c.toString()),n=(u=l.precision)+3;;)if(r=(o=r).plus(Nt(a,o,n+2,1)).times(.5),xt(o.d).slice(0,n)===(t=xt(r.d)).slice(0,n)){if("9999"!=(t=t.slice(n-3,n+1))&&(i||"4999"!=t)){+t&&(+t.slice(1)||"5"!=t.charAt(0))||(At(r,u+1,1),e=!r.times(r).eq(a));break}if(!i&&(At(o,u+1,0),o.times(o).eq(a))){r=o;break}n+=4,i=1}return nt=!0,At(r,u,l.rounding,e)},yt.tangent=yt.tan=function(){var e,t,n=this,r=n.constructor;return n.isFinite()?n.isZero()?new r(n):(e=r.precision,t=r.rounding,r.precision=e+10,r.rounding=1,(n=n.sin()).s=1,n=Nt(n,new r(1).minus(n.times(n)).sqrt(),e+10,0),r.precision=e,r.rounding=t,At(2==Ye||4==Ye?n.neg():n,e,t,!0)):new r(NaN)},yt.times=yt.mul=function(e){var t,n,r,i,o,a,s,u,c,l=this,f=l.constructor,p=l.d,m=(e=new f(e)).d;if(e.s*=l.s,!(p&&p[0]&&m&&m[0]))return new f(!e.s||p&&!p[0]&&!m||m&&!m[0]&&!p?NaN:p&&m?0*e.s:e.s/0);for(n=ut(l.e/7)+ut(e.e/7),(u=p.length)<(c=m.length)&&(o=p,p=m,m=o,a=u,u=c,c=a),o=[],r=a=u+c;r--;)o.push(0);for(r=c;--r>=0;){for(t=0,i=u+r;i>r;)s=o[i]+m[r]*p[i-r-1]+t,o[i--]=s%dt|0,t=s/dt|0;o[i]=(o[i]+t)%dt|0}for(;!o[--a];)o.pop();return t?++n:o.shift(),e.d=o,e.e=St(o,n),nt?At(e,f.precision,f.rounding):e},yt.toBinary=function(e,t){return jt(this,2,e,t)},yt.toDecimalPlaces=yt.toDP=function(e,t){var n=this,r=n.constructor;return n=new r(n),void 0===e?n:(bt(e,0,Xe),void 0===t?t=r.rounding:bt(t,0,8),At(n,e+n.e+1,t))},yt.toExponential=function(e,t){var n,r=this,i=r.constructor;return void 0===e?n=Et(r,!0):(bt(e,0,Xe),void 0===t?t=i.rounding:bt(t,0,8),n=Et(r=At(new i(r),e+1,t),!0,e+1)),r.isNeg()&&!r.isZero()?"-"+n:n},yt.toFixed=function(e,t){var n,r,i=this,o=i.constructor;return void 0===e?n=Et(i):(bt(e,0,Xe),void 0===t?t=o.rounding:bt(t,0,8),n=Et(r=At(new o(i),e+i.e+1,t),!1,e+r.e+1)),i.isNeg()&&!i.isZero()?"-"+n:n},yt.toFraction=function(e){var t,n,r,i,o,a,s,u,c,l,f,p,m=this,d=m.d,h=m.constructor;if(!d)return new h(m);if(c=n=new h(1),r=u=new h(0),a=(o=(t=new h(r)).e=Tt(d)-m.e-1)%7,t.d[0]=ct(10,a<0?7+a:a),null==e)e=o>0?t:c;else{if(!(s=new h(e)).isInt()||s.lt(c))throw Error(it+s);e=s.gt(t)?o>0?t:c:s}for(nt=!1,s=new h(xt(d)),l=h.precision,h.precision=o=7*d.length*2;f=Nt(s,t,0,1,1),1!=(i=n.plus(f.times(r))).cmp(e);)n=r,r=i,i=c,c=u.plus(f.times(i)),u=i,i=t,t=s.minus(f.times(i)),s=i;return i=Nt(e.minus(n),r,0,1,1),u=u.plus(i.times(c)),n=n.plus(i.times(r)),u.s=c.s=m.s,p=Nt(c,r,o,1).minus(m).abs().cmp(Nt(u,n,o,1).minus(m).abs())<1?[c,r]:[u,n],h.precision=l,nt=!0,p},yt.toHexadecimal=yt.toHex=function(e,t){return jt(this,16,e,t)},yt.toNearest=function(e,t){var n=this,r=n.constructor;if(n=new r(n),null==e){if(!n.d)return n;e=new r(1),t=r.rounding}else{if(e=new r(e),void 0===t?t=r.rounding:bt(t,0,8),!n.d)return e.s?n:e;if(!e.d)return e.s&&(e.s=n.s),e}return e.d[0]?(nt=!1,n=Nt(n,e,0,t,1).times(e),nt=!0,At(n)):(e.s=n.s,n=e),n},yt.toNumber=function(){return+this},yt.toOctal=function(e,t){return jt(this,8,e,t)},yt.toPower=yt.pow=function(e){var t,n,r,i,o,a,s=this,u=s.constructor,c=+(e=new u(e));if(!(s.d&&e.d&&s.d[0]&&e.d[0]))return new u(ct(+s,c));if((s=new u(s)).eq(1))return s;if(r=u.precision,o=u.rounding,e.eq(1))return At(s,r,o);if((t=ut(e.e/7))>=e.d.length-1&&(n=c<0?-c:c)<=9007199254740991)return i=Ft(u,s,n,r),e.s<0?new u(1).div(i):At(i,r,o);if((a=s.s)<0){if(t<e.d.length-1)return new u(NaN);if(1&e.d[t]||(a=1),0==s.e&&1==s.d[0]&&1==s.d.length)return s.s=a,s}return(t=0!=(n=ct(+s,c))&&isFinite(n)?new u(n+"").e:ut(c*(Math.log("0."+xt(s.d))/Math.LN10+s.e+1)))>u.maxE+1||t<u.minE-1?new u(t>0?a/0:0):(nt=!1,u.rounding=s.s=1,n=Math.min(12,(t+"").length),(i=_t(e.times(zt(s,r+n)),r)).d&&wt((i=At(i,r+5,1)).d,r,o)&&(t=r+10,+xt((i=At(_t(e.times(zt(s,t+n)),t),t+5,1)).d).slice(r+1,r+15)+1==1e14&&(i=At(i,r+1,0))),i.s=a,nt=!0,u.rounding=o,At(i,r,o))},yt.toPrecision=function(e,t){var n,r=this,i=r.constructor;return void 0===e?n=Et(r,r.e<=i.toExpNeg||r.e>=i.toExpPos):(bt(e,1,Xe),void 0===t?t=i.rounding:bt(t,0,8),n=Et(r=At(new i(r),e,t),e<=r.e||r.e<=i.toExpNeg,e)),r.isNeg()&&!r.isZero()?"-"+n:n},yt.toSignificantDigits=yt.toSD=function(e,t){var n=this.constructor;return void 0===e?(e=n.precision,t=n.rounding):(bt(e,1,Xe),void 0===t?t=n.rounding:bt(t,0,8)),At(new n(this),e,t)},yt.toString=function(){var e=this,t=e.constructor,n=Et(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()&&!e.isZero()?"-"+n:n},yt.truncated=yt.trunc=function(){return At(new this.constructor(this),this.e+1,1)},yt.valueOf=yt.toJSON=function(){var e=this,t=e.constructor,n=Et(e,e.e<=t.toExpNeg||e.e>=t.toExpPos);return e.isNeg()?"-"+n:n};var Nt=function(){function e(e,t,n){var r,i=0,o=e.length;for(e=e.slice();o--;)r=e[o]*t+i,e[o]=r%n|0,i=r/n|0;return i&&e.unshift(i),e}function t(e,t,n,r){var i,o;if(n!=r)o=n>r?1:-1;else for(i=o=0;i<n;i++)if(e[i]!=t[i]){o=e[i]>t[i]?1:-1;break}return o}function n(e,t,n,r){for(var i=0;n--;)e[n]-=i,i=e[n]<t[n]?1:0,e[n]=i*r+e[n]-t[n];for(;!e[0]&&e.length>1;)e.shift()}return function(r,i,o,a,s,u){var c,l,f,p,m,d,h,g,y,x,b,w,v,N,A,E,S,M,C,T,B=r.constructor,F=r.s==i.s?1:-1,D=r.d,O=i.d;if(!(D&&D[0]&&O&&O[0]))return new B(r.s&&i.s&&(D?!O||D[0]!=O[0]:O)?D&&0==D[0]||!O?0*F:F/0:NaN);for(u?(m=1,l=r.e-i.e):(u=dt,m=7,l=ut(r.e/m)-ut(i.e/m)),C=O.length,S=D.length,x=(y=new B(F)).d=[],f=0;O[f]==(D[f]||0);f++);if(O[f]>(D[f]||0)&&l--,null==o?(N=o=B.precision,a=B.rounding):N=s?o+(r.e-i.e)+1:o,N<0)x.push(1),d=!0;else{if(N=N/m+2|0,f=0,1==C){for(p=0,O=O[0],N++;(f<S||p)&&N--;f++)A=p*u+(D[f]||0),x[f]=A/O|0,p=A%O|0;d=p||f<S}else{for((p=u/(O[0]+1)|0)>1&&(O=e(O,p,u),D=e(D,p,u),C=O.length,S=D.length),E=C,w=(b=D.slice(0,C)).length;w<C;)b[w++]=0;(T=O.slice()).unshift(0),M=O[0],O[1]>=u/2&&++M;do{p=0,(c=t(O,b,C,w))<0?(v=b[0],C!=w&&(v=v*u+(b[1]||0)),(p=v/M|0)>1?(p>=u&&(p=u-1),1==(c=t(h=e(O,p,u),b,g=h.length,w=b.length))&&(p--,n(h,C<g?T:O,g,u))):(0==p&&(c=p=1),h=O.slice()),(g=h.length)<w&&h.unshift(0),n(b,h,w,u),-1==c&&(c=t(O,b,C,w=b.length))<1&&(p++,n(b,C<w?T:O,w,u)),w=b.length):0===c&&(p++,b=[0]),x[f++]=p,c&&b[0]?b[w++]=D[E]||0:(b=[D[E]],w=1)}while((E++<S||void 0!==b[0])&&N--);d=void 0!==b[0]}x[0]||x.shift()}if(1==m)y.e=l,We=d;else{for(f=1,p=x[0];p>=10;p/=10)f++;y.e=f+l*m-1,At(y,s?o+y.e+1:o,a,d)}return y}}();function At(e,t,n,r){var i,o,a,s,u,c,l,f,p,m=e.constructor;e:if(null!=t){if(!(f=e.d))return e;for(i=1,s=f[0];s>=10;s/=10)i++;if((o=t-i)<0)o+=7,a=t,u=(l=f[p=0])/ct(10,i-a-1)%10|0;else if((p=Math.ceil((o+1)/7))>=(s=f.length)){if(!r)break e;for(;s++<=p;)f.push(0);l=u=0,i=1,a=(o%=7)-7+1}else{for(l=s=f[p],i=1;s>=10;s/=10)i++;u=(a=(o%=7)-7+i)<0?0:l/ct(10,i-a-1)%10|0}if(r=r||t<0||void 0!==f[p+1]||(a<0?l:l%ct(10,i-a-1)),c=n<4?(u||r)&&(0==n||n==(e.s<0?3:2)):u>5||5==u&&(4==n||r||6==n&&(o>0?a>0?l/ct(10,i-a):0:f[p-1])%10&1||n==(e.s<0?8:7)),t<1||!f[0])return f.length=0,c?(t-=e.e+1,f[0]=ct(10,(7-t%7)%7),e.e=-t||0):f[0]=e.e=0,e;if(0==o?(f.length=p,s=1,p--):(f.length=p+1,s=ct(10,7-o),f[p]=a>0?(l/ct(10,i-a)%ct(10,a)|0)*s:0),c)for(;;){if(0==p){for(o=1,a=f[0];a>=10;a/=10)o++;for(a=f[0]+=s,s=1;a>=10;a/=10)s++;o!=s&&(e.e++,f[0]==dt&&(f[0]=1));break}if(f[p]+=s,f[p]!=dt)break;f[p--]=0,s=1}for(o=f.length;0===f[--o];)f.pop()}return nt&&(e.e>m.maxE?(e.d=null,e.e=NaN):e.e<m.minE&&(e.e=0,e.d=[0])),e}function Et(e,t,n){if(!e.isFinite())return qt(e);var r,i=e.e,o=xt(e.d),a=o.length;return t?(n&&(r=n-a)>0?o=o.charAt(0)+"."+o.slice(1)+Bt(r):a>1&&(o=o.charAt(0)+"."+o.slice(1)),o=o+(e.e<0?"e":"e+")+e.e):i<0?(o="0."+Bt(-i-1)+o,n&&(r=n-a)>0&&(o+=Bt(r))):i>=a?(o+=Bt(i+1-a),n&&(r=n-i-1)>0&&(o=o+"."+Bt(r))):((r=i+1)<a&&(o=o.slice(0,r)+"."+o.slice(r)),n&&(r=n-a)>0&&(i+1===a&&(o+="."),o+=Bt(r))),o}function St(e,t){var n=e[0];for(t*=7;n>=10;n/=10)t++;return t}function Mt(e,t,n){if(t>ht)throw nt=!0,n&&(e.precision=n),Error(ot);return At(new e(Ke),t,1,!0)}function Ct(e,t,n){if(t>gt)throw Error(ot);return At(new e(et),t,n,!0)}function Tt(e){var t=e.length-1,n=7*t+1;if(t=e[t]){for(;t%10==0;t/=10)n--;for(t=e[0];t>=10;t/=10)n++}return n}function Bt(e){for(var t="";e--;)t+="0";return t}function Ft(e,t,n,r){var i,o=new e(1),a=Math.ceil(r/7+4);for(nt=!1;;){if(n%2&&Lt((o=o.times(t)).d,a)&&(i=!0),0===(n=ut(n/2))){n=o.d.length-1,i&&0===o.d[n]&&++o.d[n];break}Lt((t=t.times(t)).d,a)}return nt=!0,o}function Dt(e){return 1&e.d[e.d.length-1]}function Ot(e,t,n){for(var r,i,o=new e(t[0]),a=0;++a<t.length;){if(!(i=new e(t[a])).s){o=i;break}((r=o.cmp(i))===n||0===r&&o.s===n)&&(o=i)}return o}function _t(e,t){var n,r,i,o,a,s,u,c=0,l=0,f=0,p=e.constructor,m=p.rounding,d=p.precision;if(!e.d||!e.d[0]||e.e>17)return new p(e.d?e.d[0]?e.s<0?0:1/0:1:e.s?e.s<0?0:e:NaN);for(null==t?(nt=!1,u=d):u=t,s=new p(.03125);e.e>-2;)e=e.times(s),f+=5;for(u+=r=Math.log(ct(2,f))/Math.LN10*2+5|0,n=o=a=new p(1),p.precision=u;;){if(o=At(o.times(e),u,1),n=n.times(++l),xt((s=a.plus(Nt(o,n,u,1))).d).slice(0,u)===xt(a.d).slice(0,u)){for(i=f;i--;)a=At(a.times(a),u,1);if(null!=t)return p.precision=d,a;if(!(c<3&&wt(a.d,u-r,m,c)))return At(a,p.precision=d,m,nt=!0);p.precision=u+=10,n=o=s=new p(1),l=0,c++}a=s}}function zt(e,t){var n,r,i,o,a,s,u,c,l,f,p,m=1,d=e,h=d.d,g=d.constructor,y=g.rounding,x=g.precision;if(d.s<0||!h||!h[0]||!d.e&&1==h[0]&&1==h.length)return new g(h&&!h[0]?-1/0:1!=d.s?NaN:h?0:d);if(null==t?(nt=!1,l=x):l=t,g.precision=l+=10,r=(n=xt(h)).charAt(0),!(Math.abs(o=d.e)<15e14))return c=Mt(g,l+2,x).times(o+""),d=zt(new g(r+"."+n.slice(1)),l-10).plus(c),g.precision=x,null==t?At(d,x,y,nt=!0):d;for(;r<7&&1!=r||1==r&&n.charAt(1)>3;)r=(n=xt((d=d.times(e)).d)).charAt(0),m++;for(o=d.e,r>1?(d=new g("0."+n),o++):d=new g(r+"."+n.slice(1)),f=d,u=a=d=Nt(d.minus(1),d.plus(1),l,1),p=At(d.times(d),l,1),i=3;;){if(a=At(a.times(p),l,1),xt((c=u.plus(Nt(a,new g(i),l,1))).d).slice(0,l)===xt(u.d).slice(0,l)){if(u=u.times(2),0!==o&&(u=u.plus(Mt(g,l+2,x).times(o+""))),u=Nt(u,new g(m),l,1),null!=t)return g.precision=x,u;if(!wt(u.d,l-10,y,s))return At(u,g.precision=x,y,nt=!0);g.precision=l+=10,c=a=d=Nt(f.minus(1),f.plus(1),l,1),p=At(d.times(d),l,1),i=s=1}u=c,i+=2}}function qt(e){return String(e.s*e.s/0)}function It(e,t){var n,r,i;for((n=t.indexOf("."))>-1&&(t=t.replace(".","")),(r=t.search(/e/i))>0?(n<0&&(n=r),n+=+t.slice(r+1),t=t.substring(0,r)):n<0&&(n=t.length),r=0;48===t.charCodeAt(r);r++);for(i=t.length;48===t.charCodeAt(i-1);--i);if(t=t.slice(r,i)){if(i-=r,e.e=n=n-r-1,e.d=[],r=(n+1)%7,n<0&&(r+=7),r<i){for(r&&e.d.push(+t.slice(0,r)),i-=7;r<i;)e.d.push(+t.slice(r,r+=7));r=7-(t=t.slice(r)).length}else r-=i;for(;r--;)t+="0";e.d.push(+t),nt&&(e.e>e.constructor.maxE?(e.d=null,e.e=NaN):e.e<e.constructor.minE&&(e.e=0,e.d=[0]))}else e.e=0,e.d=[0];return e}function kt(e,t){var n,r,i,o,a,s,u,c,l;if(t.indexOf("_")>-1){if(t=t.replace(/(\d)_(?=\d)/g,"$1"),mt.test(t))return It(e,t)}else if("Infinity"===t||"NaN"===t)return+t||(e.s=NaN),e.e=NaN,e.d=null,e;if(ft.test(t))n=16,t=t.toLowerCase();else if(lt.test(t))n=2;else{if(!pt.test(t))throw Error(it+t);n=8}for((o=t.search(/p/i))>0?(u=+t.slice(o+1),t=t.substring(2,o)):t=t.slice(2),a=(o=t.indexOf("."))>=0,r=e.constructor,a&&(o=(s=(t=t.replace(".","")).length)-o,i=Ft(r,new r(n),o,2*o)),o=l=(c=vt(t,n,dt)).length-1;0===c[o];--o)c.pop();return o<0?new r(0*e.s):(e.e=St(c,l),e.d=c,nt=!1,a&&(e=Nt(e,i,4*s)),u&&(e=e.times(Math.abs(u)<54?ct(2,u):Fn.pow(2,u))),nt=!0,e)}function Rt(e,t,n,r,i){var o,a,s,u,c=e.precision,l=Math.ceil(c/7);for(nt=!1,u=n.times(n),s=new e(r);;){if(a=Nt(s.times(u),new e(t++*t++),c,1),s=i?r.plus(a):r.minus(a),r=Nt(a.times(u),new e(t++*t++),c,1),void 0!==(a=s.plus(r)).d[l]){for(o=l;a.d[o]===s.d[o]&&o--;);if(-1==o)break}o=s,s=r,r=a,a=o}return nt=!0,a.d.length=l+1,a}function Pt(e,t){for(var n=e;--t;)n*=e;return n}function Ut(e,t){var n,r=t.s<0,i=Ct(e,e.precision,1),o=i.times(.5);if((t=t.abs()).lte(o))return Ye=r?4:1,t;if((n=t.divToInt(i)).isZero())Ye=r?3:2;else{if((t=t.minus(n.times(i))).lte(o))return Ye=Dt(n)?r?2:3:r?4:1,t;Ye=Dt(n)?r?1:4:r?3:2}return t.minus(i).abs()}function jt(e,t,n,r){var i,o,a,s,u,c,l,f,p,m=e.constructor,d=void 0!==n;if(d?(bt(n,1,Xe),void 0===r?r=m.rounding:bt(r,0,8)):(n=m.precision,r=m.rounding),e.isFinite()){for(d?(i=2,16==t?n=4*n-3:8==t&&(n=3*n-2)):i=t,(a=(l=Et(e)).indexOf("."))>=0&&(l=l.replace(".",""),(p=new m(1)).e=l.length-a,p.d=vt(Et(p),10,i),p.e=p.d.length),o=u=(f=vt(l,10,i)).length;0==f[--u];)f.pop();if(f[0]){if(a<0?o--:((e=new m(e)).d=f,e.e=o,f=(e=Nt(e,p,n,r,0,i)).d,o=e.e,c=We),a=f[n],s=i/2,c=c||void 0!==f[n+1],c=r<4?(void 0!==a||c)&&(0===r||r===(e.s<0?3:2)):a>s||a===s&&(4===r||c||6===r&&1&f[n-1]||r===(e.s<0?8:7)),f.length=n,c)for(;++f[--n]>i-1;)f[n]=0,n||(++o,f.unshift(1));for(u=f.length;!f[u-1];--u);for(a=0,l="";a<u;a++)l+=Qe.charAt(f[a]);if(d){if(u>1)if(16==t||8==t){for(a=16==t?4:3,--u;u%a;u++)l+="0";for(u=(f=vt(l,i,t)).length;!f[u-1];--u);for(a=1,l="1.";a<u;a++)l+=Qe.charAt(f[a])}else l=l.charAt(0)+"."+l.slice(1);l=l+(o<0?"p":"p+")+o}else if(o<0){for(;++o;)l="0"+l;l="0."+l}else if(++o>u)for(o-=u;o--;)l+="0";else o<u&&(l=l.slice(0,o)+"."+l.slice(o))}else l=d?"0p+0":"0";l=(16==t?"0x":2==t?"0b":8==t?"0o":"")+l}else l=qt(e);return e.s<0?"-"+l:l}function Lt(e,t){if(e.length>t)return e.length=t,!0}function $t(e){return new this(e).abs()}function Ht(e){return new this(e).acos()}function Gt(e){return new this(e).acosh()}function Zt(e,t){return new this(e).plus(t)}function Vt(e){return new this(e).asin()}function Wt(e){return new this(e).asinh()}function Yt(e){return new this(e).atan()}function Jt(e){return new this(e).atanh()}function Xt(e,t){e=new this(e),t=new this(t);var n,r=this.precision,i=this.rounding,o=r+4;return e.s&&t.s?e.d||t.d?!t.d||e.isZero()?(n=t.s<0?Ct(this,r,i):new this(0)).s=e.s:!e.d||t.isZero()?(n=Ct(this,o,1).times(.5)).s=e.s:t.s<0?(this.precision=o,this.rounding=1,n=this.atan(Nt(e,t,o,1)),t=Ct(this,o,1),this.precision=r,this.rounding=i,n=e.s<0?n.minus(t):n.plus(t)):n=this.atan(Nt(e,t,o,1)):(n=Ct(this,o,1).times(t.s>0?.25:.75)).s=e.s:n=new this(NaN),n}function Qt(e){return new this(e).cbrt()}function Kt(e){return At(e=new this(e),e.e+1,2)}function en(e,t,n){return new this(e).clamp(t,n)}function tn(e){if(!e||"object"!=typeof e)throw Error(rt+"Object expected");var t,n,r,i=!0===e.defaults,o=["precision",1,Xe,"rounding",0,8,"toExpNeg",-Je,0,"toExpPos",0,Je,"maxE",0,Je,"minE",-Je,0,"modulo",0,9];for(t=0;t<o.length;t+=3)if(n=o[t],i&&(this[n]=tt[n]),void 0!==(r=e[n])){if(!(ut(r)===r&&r>=o[t+1]&&r<=o[t+2]))throw Error(it+n+": "+r);this[n]=r}if(n="crypto",i&&(this[n]=tt[n]),void 0!==(r=e[n])){if(!0!==r&&!1!==r&&0!==r&&1!==r)throw Error(it+n+": "+r);if(r){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw Error(at);this[n]=!0}else this[n]=!1}return this}function nn(e){return new this(e).cos()}function rn(e){return new this(e).cosh()}function on(e,t){return new this(e).div(t)}function an(e){return new this(e).exp()}function sn(e){return At(e=new this(e),e.e+1,3)}function un(){var e,t,n=new this(0);for(nt=!1,e=0;e<arguments.length;)if((t=new this(arguments[e++])).d)n.d&&(n=n.plus(t.times(t)));else{if(t.s)return nt=!0,new this(1/0);n=t}return nt=!0,n.sqrt()}function cn(e){return e instanceof Fn||e&&e.toStringTag===st||!1}function ln(e){return new this(e).ln()}function fn(e,t){return new this(e).log(t)}function pn(e){return new this(e).log(2)}function mn(e){return new this(e).log(10)}function dn(){return Ot(this,arguments,-1)}function hn(){return Ot(this,arguments,1)}function gn(e,t){return new this(e).mod(t)}function yn(e,t){return new this(e).mul(t)}function xn(e,t){return new this(e).pow(t)}function bn(e){var t,n,r,i,o=0,a=new this(1),s=[];if(void 0===e?e=this.precision:bt(e,1,Xe),r=Math.ceil(e/7),this.crypto)if(crypto.getRandomValues)for(t=crypto.getRandomValues(new Uint32Array(r));o<r;)(i=t[o])>=429e7?t[o]=crypto.getRandomValues(new Uint32Array(1))[0]:s[o++]=i%1e7;else{if(!crypto.randomBytes)throw Error(at);for(t=crypto.randomBytes(r*=4);o<r;)(i=t[o]+(t[o+1]<<8)+(t[o+2]<<16)+((127&t[o+3])<<24))>=214e7?crypto.randomBytes(4).copy(t,o):(s.push(i%1e7),o+=4);o=r/4}else for(;o<r;)s[o++]=1e7*Math.random()|0;for(e%=7,(r=s[--o])&&e&&(i=ct(10,7-e),s[o]=(r/i|0)*i);0===s[o];o--)s.pop();if(o<0)n=0,s=[0];else{for(n=-1;0===s[0];n-=7)s.shift();for(r=1,i=s[0];i>=10;i/=10)r++;r<7&&(n-=7-r)}return a.e=n,a.d=s,a}function wn(e){return At(e=new this(e),e.e+1,this.rounding)}function vn(e){return(e=new this(e)).d?e.d[0]?e.s:0*e.s:e.s||NaN}function Nn(e){return new this(e).sin()}function An(e){return new this(e).sinh()}function En(e){return new this(e).sqrt()}function Sn(e,t){return new this(e).sub(t)}function Mn(){var e=0,t=arguments,n=new this(t[e]);for(nt=!1;n.s&&++e<t.length;)n=n.plus(t[e]);return nt=!0,At(n,this.precision,this.rounding)}function Cn(e){return new this(e).tan()}function Tn(e){return new this(e).tanh()}function Bn(e){return At(e=new this(e),e.e+1,1)}yt[Symbol.for("nodejs.util.inspect.custom")]=yt.toString,yt[Symbol.toStringTag]="Decimal";var Fn=yt.constructor=function e(t){var n,r,i;function o(e){var t,n,r,i=this;if(!(i instanceof o))return new o(e);if(i.constructor=o,cn(e))return i.s=e.s,void(nt?!e.d||e.e>o.maxE?(i.e=NaN,i.d=null):e.e<o.minE?(i.e=0,i.d=[0]):(i.e=e.e,i.d=e.d.slice()):(i.e=e.e,i.d=e.d?e.d.slice():e.d));if("number"==(r=typeof e)){if(0===e)return i.s=1/e<0?-1:1,i.e=0,void(i.d=[0]);if(e<0?(e=-e,i.s=-1):i.s=1,e===~~e&&e<1e7){for(t=0,n=e;n>=10;n/=10)t++;return void(nt?t>o.maxE?(i.e=NaN,i.d=null):t<o.minE?(i.e=0,i.d=[0]):(i.e=t,i.d=[e]):(i.e=t,i.d=[e]))}return 0*e!=0?(e||(i.s=NaN),i.e=NaN,void(i.d=null)):It(i,e.toString())}if("string"===r)return 45===(n=e.charCodeAt(0))?(e=e.slice(1),i.s=-1):(43===n&&(e=e.slice(1)),i.s=1),mt.test(e)?It(i,e):kt(i,e);if("bigint"===r)return e<0?(e=-e,i.s=-1):i.s=1,It(i,e.toString());throw Error(it+e)}if(o.prototype=yt,o.ROUND_UP=0,o.ROUND_DOWN=1,o.ROUND_CEIL=2,o.ROUND_FLOOR=3,o.ROUND_HALF_UP=4,o.ROUND_HALF_DOWN=5,o.ROUND_HALF_EVEN=6,o.ROUND_HALF_CEIL=7,o.ROUND_HALF_FLOOR=8,o.EUCLID=9,o.config=o.set=tn,o.clone=e,o.isDecimal=cn,o.abs=$t,o.acos=Ht,o.acosh=Gt,o.add=Zt,o.asin=Vt,o.asinh=Wt,o.atan=Yt,o.atanh=Jt,o.atan2=Xt,o.cbrt=Qt,o.ceil=Kt,o.clamp=en,o.cos=nn,o.cosh=rn,o.div=on,o.exp=an,o.floor=sn,o.hypot=un,o.ln=ln,o.log=fn,o.log10=mn,o.log2=pn,o.max=dn,o.min=hn,o.mod=gn,o.mul=yn,o.pow=xn,o.random=bn,o.round=wn,o.sign=vn,o.sin=Nn,o.sinh=An,o.sqrt=En,o.sub=Sn,o.sum=Mn,o.tan=Cn,o.tanh=Tn,o.trunc=Bn,void 0===t&&(t={}),t&&!0!==t.defaults)for(i=["precision","rounding","toExpNeg","toExpPos","maxE","minE","modulo","crypto"],n=0;n<i.length;)t.hasOwnProperty(r=i[n++])||(t[r]=this[r]);return o.config(t),o}(tt);Ke=new Fn(Ke),et=new Fn(et);const Dn=Fn,On=de("BigNumber",["?on","config"],(e=>{let{on:t,config:n}=e;const r=Dn.clone({precision:n.precision,modulo:Dn.EUCLID});return r.prototype=Object.create(r.prototype),r.prototype.type="BigNumber",r.prototype.isBigNumber=!0,r.prototype.toJSON=function(){return{mathjs:"BigNumber",value:this.toString()}},r.fromJSON=function(e){return new r(e.value)},t&&t("config",(function(e,t){e.precision!==t.precision&&r.config({precision:e.precision})})),r}),{isClass:!0}),_n=Math.cosh||function(e){return Math.abs(e)<1e-9?1-e:.5*(Math.exp(e)+Math.exp(-e))},zn=Math.sinh||function(e){return Math.abs(e)<1e-9?e:.5*(Math.exp(e)-Math.exp(-e))},qn=function(e,t){return(e=Math.abs(e))<(t=Math.abs(t))&&([e,t]=[t,e]),e<1e8?Math.sqrt(e*e+t*t):(t/=e,e*Math.sqrt(1+t*t))},In=function(){throw SyntaxError("Invalid Param")};function kn(e,t){const n=Math.abs(e),r=Math.abs(t);return 0===e?Math.log(r):0===t?Math.log(n):n<3e3&&r<3e3?.5*Math.log(e*e+t*t):(e*=.5,t*=.5,.5*Math.log(e*e+t*t)+Math.LN2)}const Rn={re:0,im:0},Pn=function(e,t){const n=Rn;if(null==e)n.re=n.im=0;else if(void 0!==t)n.re=e,n.im=t;else switch(typeof e){case"object":if("im"in e&&"re"in e)n.re=e.re,n.im=e.im;else if("abs"in e&&"arg"in e){if(!isFinite(e.abs)&&isFinite(e.arg))return Un.INFINITY;n.re=e.abs*Math.cos(e.arg),n.im=e.abs*Math.sin(e.arg)}else if("r"in e&&"phi"in e){if(!isFinite(e.r)&&isFinite(e.phi))return Un.INFINITY;n.re=e.r*Math.cos(e.phi),n.im=e.r*Math.sin(e.phi)}else 2===e.length?(n.re=e[0],n.im=e[1]):In();break;case"string":n.im=n.re=0;const t=e.replace(/_/g,"").match(/\d+\.?\d*e[+-]?\d+|\d+\.?\d*|\.\d+|./g);let r=1,i=0;null===t&&In();for(let e=0;e<t.length;e++){const o=t[e];" "===o||"\t"===o||"\n"===o||("+"===o?r++:"-"===o?i++:"i"===o||"I"===o?(r+i===0&&In()," "===t[e+1]||isNaN(t[e+1])?n.im+=parseFloat((i%2?"-":"")+"1"):(n.im+=parseFloat((i%2?"-":"")+t[e+1]),e++),r=i=0):((r+i===0||isNaN(o))&&In(),"i"===t[e+1]||"I"===t[e+1]?(n.im+=parseFloat((i%2?"-":"")+o),e++):n.re+=parseFloat((i%2?"-":"")+o),r=i=0))}r+i>0&&In();break;case"number":n.im=0,n.re=e;break;default:In()}return isNaN(n.re)||isNaN(n.im),n};function Un(e,t){if(!(this instanceof Un))return new Un(e,t);const n=Pn(e,t);this.re=n.re,this.im=n.im}Un.prototype={re:0,im:0,sign:function(){const e=qn(this.re,this.im);return new Un(this.re/e,this.im/e)},add:function(e,t){const n=Pn(e,t),r=this.isInfinite(),i=!(isFinite(n.re)&&isFinite(n.im));return r||i?r&&i?Un.NAN:Un.INFINITY:new Un(this.re+n.re,this.im+n.im)},sub:function(e,t){const n=Pn(e,t),r=this.isInfinite(),i=!(isFinite(n.re)&&isFinite(n.im));return r||i?r&&i?Un.NAN:Un.INFINITY:new Un(this.re-n.re,this.im-n.im)},mul:function(e,t){const n=Pn(e,t),r=this.isInfinite(),i=!(isFinite(n.re)&&isFinite(n.im)),o=0===this.re&&0===this.im,a=0===n.re&&0===n.im;return r&&a||i&&o?Un.NAN:r||i?Un.INFINITY:0===n.im&&0===this.im?new Un(this.re*n.re,0):new Un(this.re*n.re-this.im*n.im,this.re*n.im+this.im*n.re)},div:function(e,t){const n=Pn(e,t),r=this.isInfinite(),i=!(isFinite(n.re)&&isFinite(n.im)),o=0===this.re&&0===this.im,a=0===n.re&&0===n.im;if(o&&a||r&&i)return Un.NAN;if(a||r)return Un.INFINITY;if(o||i)return Un.ZERO;if(0===n.im)return new Un(this.re/n.re,this.im/n.re);if(Math.abs(n.re)<Math.abs(n.im)){const e=n.re/n.im,t=n.re*e+n.im;return new Un((this.re*e+this.im)/t,(this.im*e-this.re)/t)}{const e=n.im/n.re,t=n.im*e+n.re;return new Un((this.re+this.im*e)/t,(this.im-this.re*e)/t)}},pow:function(e,t){const n=Pn(e,t),r=0===this.re&&0===this.im;if(0===n.re&&0===n.im)return Un.ONE;if(0===n.im){if(0===this.im&&this.re>0)return new Un(Math.pow(this.re,n.re),0);if(0===this.re)switch((n.re%4+4)%4){case 0:return new Un(Math.pow(this.im,n.re),0);case 1:return new Un(0,Math.pow(this.im,n.re));case 2:return new Un(-Math.pow(this.im,n.re),0);case 3:return new Un(0,-Math.pow(this.im,n.re))}}if(r&&n.re>0)return Un.ZERO;const i=Math.atan2(this.im,this.re),o=kn(this.re,this.im);let a=Math.exp(n.re*o-n.im*i),s=n.im*o+n.re*i;return new Un(a*Math.cos(s),a*Math.sin(s))},sqrt:function(){const e=this.re,t=this.im;if(0===t)return e>=0?new Un(Math.sqrt(e),0):new Un(0,Math.sqrt(-e));const n=qn(e,t);let r=Math.sqrt(.5*(n+Math.abs(e))),i=Math.abs(t)/(2*r);return e>=0?new Un(r,t<0?-i:i):new Un(i,t<0?-r:r)},exp:function(){const e=Math.exp(this.re);return 0===this.im?new Un(e,0):new Un(e*Math.cos(this.im),e*Math.sin(this.im))},expm1:function(){const e=this.re,t=this.im;return new Un(Math.expm1(e)*Math.cos(t)+function(e){const t=Math.PI/4;if(-t>e||e>t)return Math.cos(e)-1;const n=e*e;return n*(n*(n*(n*(n*(n*(n*(n/20922789888e3-1/87178291200)+1/479001600)-1/3628800)+1/40320)-1/720)+1/24)-.5)}(t),Math.exp(e)*Math.sin(t))},log:function(){const e=this.re,t=this.im;return 0===t&&e>0?new Un(Math.log(e),0):new Un(kn(e,t),Math.atan2(t,e))},abs:function(){return qn(this.re,this.im)},arg:function(){return Math.atan2(this.im,this.re)},sin:function(){const e=this.re,t=this.im;return new Un(Math.sin(e)*_n(t),Math.cos(e)*zn(t))},cos:function(){const e=this.re,t=this.im;return new Un(Math.cos(e)*_n(t),-Math.sin(e)*zn(t))},tan:function(){const e=2*this.re,t=2*this.im,n=Math.cos(e)+_n(t);return new Un(Math.sin(e)/n,zn(t)/n)},cot:function(){const e=2*this.re,t=2*this.im,n=Math.cos(e)-_n(t);return new Un(-Math.sin(e)/n,zn(t)/n)},sec:function(){const e=this.re,t=this.im,n=.5*_n(2*t)+.5*Math.cos(2*e);return new Un(Math.cos(e)*_n(t)/n,Math.sin(e)*zn(t)/n)},csc:function(){const e=this.re,t=this.im,n=.5*_n(2*t)-.5*Math.cos(2*e);return new Un(Math.sin(e)*_n(t)/n,-Math.cos(e)*zn(t)/n)},asin:function(){const e=this.re,t=this.im,n=new Un(t*t-e*e+1,-2*e*t).sqrt(),r=new Un(n.re-t,n.im+e).log();return new Un(r.im,-r.re)},acos:function(){const e=this.re,t=this.im,n=new Un(t*t-e*e+1,-2*e*t).sqrt(),r=new Un(n.re-t,n.im+e).log();return new Un(Math.PI/2-r.im,r.re)},atan:function(){const e=this.re,t=this.im;if(0===e){if(1===t)return new Un(0,1/0);if(-1===t)return new Un(0,-1/0)}const n=e*e+(1-t)*(1-t),r=new Un((1-t*t-e*e)/n,-2*e/n).log();return new Un(-.5*r.im,.5*r.re)},acot:function(){const e=this.re,t=this.im;if(0===t)return new Un(Math.atan2(1,e),0);const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).atan():new Un(0!==e?e/0:0,0!==t?-t/0:0).atan()},asec:function(){const e=this.re,t=this.im;if(0===e&&0===t)return new Un(0,1/0);const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).acos():new Un(0!==e?e/0:0,0!==t?-t/0:0).acos()},acsc:function(){const e=this.re,t=this.im;if(0===e&&0===t)return new Un(Math.PI/2,1/0);const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).asin():new Un(0!==e?e/0:0,0!==t?-t/0:0).asin()},sinh:function(){const e=this.re,t=this.im;return new Un(zn(e)*Math.cos(t),_n(e)*Math.sin(t))},cosh:function(){const e=this.re,t=this.im;return new Un(_n(e)*Math.cos(t),zn(e)*Math.sin(t))},tanh:function(){const e=2*this.re,t=2*this.im,n=_n(e)+Math.cos(t);return new Un(zn(e)/n,Math.sin(t)/n)},coth:function(){const e=2*this.re,t=2*this.im,n=_n(e)-Math.cos(t);return new Un(zn(e)/n,-Math.sin(t)/n)},csch:function(){const e=this.re,t=this.im,n=Math.cos(2*t)-_n(2*e);return new Un(-2*zn(e)*Math.cos(t)/n,2*_n(e)*Math.sin(t)/n)},sech:function(){const e=this.re,t=this.im,n=Math.cos(2*t)+_n(2*e);return new Un(2*_n(e)*Math.cos(t)/n,-2*zn(e)*Math.sin(t)/n)},asinh:function(){let e=this.im;this.im=-this.re,this.re=e;const t=this.asin();return this.re=-this.im,this.im=e,e=t.re,t.re=-t.im,t.im=e,t},acosh:function(){const e=this.acos();if(e.im<=0){const t=e.re;e.re=-e.im,e.im=t}else{const t=e.im;e.im=-e.re,e.re=t}return e},atanh:function(){const e=this.re,t=this.im,n=e>1&&0===t,r=1-e,i=1+e,o=r*r+t*t,a=0!==o?new Un((i*r-t*t)/o,(t*r+i*t)/o):new Un(-1!==e?e/0:0,0!==t?t/0:0),s=a.re;return a.re=kn(a.re,a.im)/2,a.im=Math.atan2(a.im,s)/2,n&&(a.im=-a.im),a},acoth:function(){const e=this.re,t=this.im;if(0===e&&0===t)return new Un(0,Math.PI/2);const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).atanh():new Un(0!==e?e/0:0,0!==t?-t/0:0).atanh()},acsch:function(){const e=this.re,t=this.im;if(0===t)return new Un(0!==e?Math.log(e+Math.sqrt(e*e+1)):1/0,0);const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).asinh():new Un(0!==e?e/0:0,0!==t?-t/0:0).asinh()},asech:function(){const e=this.re,t=this.im;if(this.isZero())return Un.INFINITY;const n=e*e+t*t;return 0!==n?new Un(e/n,-t/n).acosh():new Un(0!==e?e/0:0,0!==t?-t/0:0).acosh()},inverse:function(){if(this.isZero())return Un.INFINITY;if(this.isInfinite())return Un.ZERO;const e=this.re,t=this.im,n=e*e+t*t;return new Un(e/n,-t/n)},conjugate:function(){return new Un(this.re,-this.im)},neg:function(){return new Un(-this.re,-this.im)},ceil:function(e){return e=Math.pow(10,e||0),new Un(Math.ceil(this.re*e)/e,Math.ceil(this.im*e)/e)},floor:function(e){return e=Math.pow(10,e||0),new Un(Math.floor(this.re*e)/e,Math.floor(this.im*e)/e)},round:function(e){return e=Math.pow(10,e||0),new Un(Math.round(this.re*e)/e,Math.round(this.im*e)/e)},equals:function(e,t){const n=Pn(e,t);return Math.abs(n.re-this.re)<=Un.EPSILON&&Math.abs(n.im-this.im)<=Un.EPSILON},clone:function(){return new Un(this.re,this.im)},toString:function(){let e=this.re,t=this.im,n="";return this.isNaN()?"NaN":this.isInfinite()?"Infinity":(Math.abs(e)<Un.EPSILON&&(e=0),Math.abs(t)<Un.EPSILON&&(t=0),0===t?n+e:(0!==e?(n+=e,n+=" ",t<0?(t=-t,n+="-"):n+="+",n+=" "):t<0&&(t=-t,n+="-"),1!==t&&(n+=t),n+"i"))},toVector:function(){return[this.re,this.im]},valueOf:function(){return 0===this.im?this.re:null},isNaN:function(){return isNaN(this.re)||isNaN(this.im)},isZero:function(){return 0===this.im&&0===this.re},isFinite:function(){return isFinite(this.re)&&isFinite(this.im)},isInfinite:function(){return!this.isFinite()}},Un.ZERO=new Un(0,0),Un.ONE=new Un(1,0),Un.I=new Un(0,1),Un.PI=new Un(Math.PI,0),Un.E=new Un(Math.E,0),Un.INFINITY=new Un(1/0,1/0),Un.NAN=new Un(NaN,NaN),Un.EPSILON=1e-15;const jn=de("Complex",[],(()=>(Object.defineProperty(Un,"name",{value:"Complex"}),Un.prototype.constructor=Un,Un.prototype.type="Complex",Un.prototype.isComplex=!0,Un.prototype.toJSON=function(){return{mathjs:"Complex",re:this.re,im:this.im}},Un.prototype.toPolar=function(){return{r:this.abs(),phi:this.arg()}},Un.prototype.format=function(e){let t="",n=this.im,r=this.re;const i=Me(this.re,e),o=Me(this.im,e),a=h(e)?e:e?e.precision:null;if(null!==a){const e=Math.pow(10,-a);Math.abs(r/n)<e&&(r=0),Math.abs(n/r)<e&&(n=0)}return t=0===n?i:0===r?1===n?"i":-1===n?"-i":o+"i":n<0?-1===n?i+" - i":i+" - "+o.substring(1)+"i":1===n?i+" + i":i+" + "+o+"i",t},Un.fromPolar=function(e){switch(arguments.length){case 1:{const e=arguments[0];if("object"==typeof e)return Un(e);throw new TypeError("Input has to be an object with r and phi keys.")}case 2:{const e=arguments[0];let t=arguments[1];if(h(e)){if(w(t)&&t.hasBase("ANGLE")&&(t=t.toNumber("rad")),h(t))return new Un({r:e,phi:t});throw new TypeError("Phi is not a number nor an angle unit.")}throw new TypeError("Radius r is not a number.")}default:throw new SyntaxError("Wrong number of arguments in function fromPolar")}},Un.prototype.valueOf=Un.prototype.toString,Un.fromJSON=function(e){return new Un(e)},Un.compare=function(e,t){return e.re>t.re?1:e.re<t.re?-1:e.im>t.im?1:e.im<t.im?-1:0},Un)),{isClass:!0});"undefined"==typeof BigInt&&(BigInt=function(e){if(isNaN(e))throw new Error("");return e});const Ln=BigInt(0),$n=BigInt(1),Hn=BigInt(2),Gn=BigInt(5),Zn=BigInt(10),Vn={s:$n,n:Ln,d:$n};function Wn(e,t){try{e=BigInt(e)}catch(e){throw nr()}return e*t}function Yn(e){return"bigint"==typeof e?e:Math.floor(e)}function Jn(e,t){if(t===Ln)throw tr();const n=Object.create(er.prototype);n.s=e<Ln?-$n:$n;const r=Kn(e=e<Ln?-e:e,t);return n.n=e/r,n.d=t/r,n}function Xn(e){const t={};let n=e,r=Hn,i=Gn-$n;for(;i<=n;){for(;n%r===Ln;)n/=r,t[r]=(t[r]||Ln)+$n;i+=$n+Hn*r++}return n!==e?n>1&&(t[n]=(t[n]||Ln)+$n):t[e]=(t[e]||Ln)+$n,t}const Qn=function(e,t){let n=Ln,r=$n,i=$n;if(null==e);else if(void 0!==t){if("bigint"==typeof e)n=e;else{if(isNaN(e))throw nr();if(e%1!=0)throw rr();n=BigInt(e)}if("bigint"==typeof t)r=t;else{if(isNaN(t))throw nr();if(t%1!=0)throw rr();r=BigInt(t)}i=n*r}else if("object"==typeof e){if("d"in e&&"n"in e)n=BigInt(e.n),r=BigInt(e.d),"s"in e&&(n*=BigInt(e.s));else if(0 in e)n=BigInt(e[0]),1 in e&&(r=BigInt(e[1]));else{if("bigint"!=typeof e)throw nr();n=e}i=n*r}else if("number"==typeof e){if(isNaN(e))throw nr();if(e<0&&(i=-$n,e=-e),e%1==0)n=BigInt(e);else{let t=1,i=0,o=1,a=1,s=1,u=1e7;for(e>=1&&(t=10**Math.floor(1+Math.log10(e)),e/=t);o<=u&&s<=u;){let t=(i+a)/(o+s);if(e===t){o+s<=u?(n=i+a,r=o+s):s>o?(n=a,r=s):(n=i,r=o);break}e>t?(i+=a,o+=s):(a+=i,s+=o),o>u?(n=a,r=s):(n=i,r=o)}n=BigInt(n)*BigInt(t),r=BigInt(r)}}else if("string"==typeof e){let t=0,o=Ln,a=Ln,s=Ln,u=$n,c=$n,l=e.replace(/_/g,"").match(/\d+|./g);if(null===l)throw nr();if("-"===l[t]?(i=-$n,t++):"+"===l[t]&&t++,l.length===t+1?a=Wn(l[t++],i):"."===l[t+1]||"."===l[t]?("."!==l[t]&&(o=Wn(l[t++],i)),t++,(t+1===l.length||"("===l[t+1]&&")"===l[t+3]||"'"===l[t+1]&&"'"===l[t+3])&&(a=Wn(l[t],i),u=Zn**BigInt(l[t].length),t++),("("===l[t]&&")"===l[t+2]||"'"===l[t]&&"'"===l[t+2])&&(s=Wn(l[t+1],i),c=Zn**BigInt(l[t+1].length)-$n,t+=3)):"/"===l[t+1]||":"===l[t+1]?(a=Wn(l[t],i),u=Wn(l[t+2],$n),t+=3):"/"===l[t+3]&&" "===l[t+1]&&(o=Wn(l[t],i),a=Wn(l[t+2],i),u=Wn(l[t+4],$n),t+=5),!(l.length<=t))throw nr();r=u*c,i=n=s+r*o+c*a}else{if("bigint"!=typeof e)throw nr();n=e,i=e,r=$n}if(r===Ln)throw tr();Vn.s=i<Ln?-$n:$n,Vn.n=n<Ln?-n:n,Vn.d=r<Ln?-r:r};function Kn(e,t){if(!e)return t;if(!t)return e;for(;;){if(!(e%=t))return t;if(!(t%=e))return e}}function er(e,t){if(Qn(e,t),!(this instanceof er))return Jn(Vn.s*Vn.n,Vn.d);e=Kn(Vn.d,Vn.n),this.s=Vn.s,this.n=Vn.n/e,this.d=Vn.d/e}var tr=function(){return new Error("Division by Zero")},nr=function(){return new Error("Invalid argument")},rr=function(){return new Error("Parameters must be integer")};er.prototype={s:$n,n:Ln,d:$n,abs:function(){return Jn(this.n,this.d)},neg:function(){return Jn(-this.s*this.n,this.d)},add:function(e,t){return Qn(e,t),Jn(this.s*this.n*Vn.d+Vn.s*this.d*Vn.n,this.d*Vn.d)},sub:function(e,t){return Qn(e,t),Jn(this.s*this.n*Vn.d-Vn.s*this.d*Vn.n,this.d*Vn.d)},mul:function(e,t){return Qn(e,t),Jn(this.s*Vn.s*this.n*Vn.n,this.d*Vn.d)},div:function(e,t){return Qn(e,t),Jn(this.s*Vn.s*this.n*Vn.d,this.d*Vn.n)},clone:function(){return Jn(this.s*this.n,this.d)},mod:function(e,t){if(void 0===e)return Jn(this.s*this.n%this.d,$n);if(Qn(e,t),Ln===Vn.n*this.d)throw tr();return Jn(this.s*(Vn.d*this.n)%(Vn.n*this.d),Vn.d*this.d)},gcd:function(e,t){return Qn(e,t),Jn(Kn(Vn.n,this.n)*Kn(Vn.d,this.d),Vn.d*this.d)},lcm:function(e,t){return Qn(e,t),Vn.n===Ln&&this.n===Ln?Jn(Ln,$n):Jn(Vn.n*this.n,Kn(Vn.n,this.n)*Kn(Vn.d,this.d))},inverse:function(){return Jn(this.s*this.d,this.n)},pow:function(e,t){if(Qn(e,t),Vn.d===$n)return Vn.s<Ln?Jn((this.s*this.d)**Vn.n,this.n**Vn.n):Jn((this.s*this.n)**Vn.n,this.d**Vn.n);if(this.s<Ln)return null;let n=Xn(this.n),r=Xn(this.d),i=$n,o=$n;for(let e in n)if("1"!==e){if("0"===e){i=Ln;break}if(n[e]*=Vn.n,n[e]%Vn.d!==Ln)return null;n[e]/=Vn.d,i*=BigInt(e)**n[e]}for(let e in r)if("1"!==e){if(r[e]*=Vn.n,r[e]%Vn.d!==Ln)return null;r[e]/=Vn.d,o*=BigInt(e)**r[e]}return Vn.s<Ln?Jn(o,i):Jn(i,o)},log:function(e,t){if(Qn(e,t),this.s<=Ln||Vn.s<=Ln)return null;const n={},r=Xn(Vn.n),i=Xn(Vn.d),o=Xn(this.n),a=Xn(this.d);for(const e in i)r[e]=(r[e]||Ln)-i[e];for(const e in a)o[e]=(o[e]||Ln)-a[e];for(const e in r)"1"!==e&&(n[e]=!0);for(const e in o)"1"!==e&&(n[e]=!0);let s=null,u=null;for(const e in n){const t=r[e]||Ln,n=o[e]||Ln;if(t===Ln){if(n!==Ln)return null;continue}let i=n,a=t;const c=Kn(i,a);if(i/=c,a/=c,null===s&&null===u)s=i,u=a;else if(i*u!=s*a)return null}return null!==s&&null!==u?Jn(s,u):null},equals:function(e,t){return Qn(e,t),this.s*this.n*Vn.d==Vn.s*Vn.n*this.d},lt:function(e,t){return Qn(e,t),this.s*this.n*Vn.d<Vn.s*Vn.n*this.d},lte:function(e,t){return Qn(e,t),this.s*this.n*Vn.d<=Vn.s*Vn.n*this.d},gt:function(e,t){return Qn(e,t),this.s*this.n*Vn.d>Vn.s*Vn.n*this.d},gte:function(e,t){return Qn(e,t),this.s*this.n*Vn.d>=Vn.s*Vn.n*this.d},compare:function(e,t){Qn(e,t);let n=this.s*this.n*Vn.d-Vn.s*Vn.n*this.d;return(Ln<n)-(n<Ln)},ceil:function(e){return e=Zn**BigInt(e||0),Jn(Yn(this.s*e*this.n/this.d)+(e*this.n%this.d>Ln&&this.s>=Ln?$n:Ln),e)},floor:function(e){return e=Zn**BigInt(e||0),Jn(Yn(this.s*e*this.n/this.d)-(e*this.n%this.d>Ln&&this.s<Ln?$n:Ln),e)},round:function(e){return e=Zn**BigInt(e||0),Jn(Yn(this.s*e*this.n/this.d)+this.s*((this.s>=Ln?$n:Ln)+Hn*(e*this.n%this.d)>this.d?$n:Ln),e)},roundTo:function(e,t){Qn(e,t);const n=this.n*Vn.d,r=this.d*Vn.n,i=n%r;let o=Yn(n/r);return i+i>=r&&o++,Jn(this.s*o*Vn.n,Vn.d)},divisible:function(e,t){return Qn(e,t),!(!(Vn.n*this.d)||this.n*Vn.d%(Vn.n*this.d))},valueOf:function(){return Number(this.s*this.n)/Number(this.d)},toString:function(e){let t=this.n,n=this.d;e=e||15;let r=function(e,t){for(;t%Hn===Ln;t/=Hn);for(;t%Gn===Ln;t/=Gn);if(t===$n)return Ln;let n=Zn%t,r=1;for(;n!==$n;r++)if(n=n*Zn%t,r>2e3)return Ln;return BigInt(r)}(0,n),i=function(e,t,n){let r=$n,i=function(e,t,n){let r=$n;for(;t>Ln;e=e*e%n,t>>=$n)t&$n&&(r=r*e%n);return r}(Zn,n,t);for(let e=0;e<300;e++){if(r===i)return BigInt(e);r=r*Zn%t,i=i*Zn%t}return 0}(0,n,r),o=this.s<Ln?"-":"";if(o+=Yn(t/n),t%=n,t*=Zn,t&&(o+="."),r){for(let e=i;e--;)o+=Yn(t/n),t%=n,t*=Zn;o+="(";for(let e=r;e--;)o+=Yn(t/n),t%=n,t*=Zn;o+=")"}else for(let r=e;t&&r--;)o+=Yn(t/n),t%=n,t*=Zn;return o},toFraction:function(e){let t=this.n,n=this.d,r=this.s<Ln?"-":"";if(n===$n)r+=t;else{let i=Yn(t/n);e&&i>Ln&&(r+=i,r+=" ",t%=n),r+=t,r+="/",r+=n}return r},toLatex:function(e){let t=this.n,n=this.d,r=this.s<Ln?"-":"";if(n===$n)r+=t;else{let i=Yn(t/n);e&&i>Ln&&(r+=i,t%=n),r+="\\frac{",r+=t,r+="}{",r+=n,r+="}"}return r},toContinued:function(){let e=this.n,t=this.d,n=[];do{n.push(Yn(e/t));let r=e%t;e=t,t=r}while(e!==$n);return n},simplify:function(e){const t=BigInt(1/(e||.001)|0),n=this.abs(),r=n.toContinued();for(let e=1;e<r.length;e++){let i=Jn(r[e-1],$n);for(let t=e-2;t>=0;t--)i=i.inverse().add(r[t]);let o=i.sub(n);if(o.n*t<o.d)return i.mul(this.s)}return this}};const ir=de("Fraction",[],(()=>(Object.defineProperty(er,"name",{value:"Fraction"}),er.prototype.constructor=er,er.prototype.type="Fraction",er.prototype.isFraction=!0,er.prototype.toJSON=function(){return{mathjs:"Fraction",n:String(this.s*this.n),d:String(this.d)}},er.fromJSON=function(e){return new er(e)},er)),{isClass:!0}),or=de("Range",[],(()=>{function e(t,n,r){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator");const i=null!=t,o=null!=n,a=null!=r;if(i)if(g(t))t=t.toNumber();else if("number"!=typeof t&&!y(t))throw new TypeError("Parameter start must be a number or bigint");if(o)if(g(n))n=n.toNumber();else if("number"!=typeof n&&!y(n))throw new TypeError("Parameter end must be a number or bigint");if(a)if(g(r))r=r.toNumber();else if("number"!=typeof r&&!y(r))throw new TypeError("Parameter step must be a number or bigint");if(this.start=i?parseFloat(t):0,this.end=o?parseFloat(n):0,this.step=a?parseFloat(r):1,a&&_e(this.step,0))throw new Error("Step must not be zero")}return e.prototype.type="Range",e.prototype.isRange=!0,e.parse=function(t){if("string"!=typeof t)return null;const n=t.split(":").map((function(e){return parseFloat(e)}));if(n.some((function(e){return isNaN(e)})))return null;switch(n.length){case 2:return new e(n[0],n[1]);case 3:return new e(n[0],n[2],n[1]);default:return null}},e.prototype.clone=function(){return new e(this.start,this.end,this.step)},e.prototype.size=function(){let e=0;const t=this.start,n=this.step,r=this.end-t;return be(n)===be(r)?e=Math.ceil(r/n):0===r&&(e=0),isNaN(e)&&(e=0),[e]},e.prototype.min=function(){const e=this.size()[0];return e>0?this.step>0?this.start:this.start+(e-1)*this.step:void 0},e.prototype.max=function(){const e=this.size()[0];return e>0?this.step>0?this.start+(e-1)*this.step:this.start:void 0},e.prototype.forEach=function(e){let t=this.start;const n=this.step,r=this.end;let i=0;if(n>0)for(;t<r;)e(t,[i],this),t+=n,i++;else if(n<0)for(;t>r;)e(t,[i],this),t+=n,i++},e.prototype.map=function(e){const t=[];return this.forEach((function(n,r,i){t[r[0]]=e(n,r,i)})),t},e.prototype.toArray=function(){const e=[];return this.forEach((function(t,n){e[n[0]]=t})),e},e.prototype.valueOf=function(){return this.toArray()},e.prototype.format=function(e){let t=Me(this.start,e);return 1!==this.step&&(t+=":"+Me(this.step,e)),t+=":"+Me(this.end,e),t},e.prototype.toString=function(){return this.format()},e.prototype.toJSON=function(){return{mathjs:"Range",start:this.start,end:this.end,step:this.step}},e.fromJSON=function(t){return new e(t.start,t.end,t.step)},e}),{isClass:!0}),ar=de("Matrix",[],(()=>{function e(){if(!(this instanceof e))throw new SyntaxError("Constructor must be called with the new operator")}return e.prototype.type="Matrix",e.prototype.isMatrix=!0,e.prototype.storage=function(){throw new Error("Cannot invoke storage on a Matrix interface")},e.prototype.datatype=function(){throw new Error("Cannot invoke datatype on a Matrix interface")},e.prototype.create=function(e,t){throw new Error("Cannot invoke create on a Matrix interface")},e.prototype.subset=function(e,t,n){throw new Error("Cannot invoke subset on a Matrix interface")},e.prototype.get=function(e){throw new Error("Cannot invoke get on a Matrix interface")},e.prototype.set=function(e,t,n){throw new Error("Cannot invoke set on a Matrix interface")},e.prototype.resize=function(e,t){throw new Error("Cannot invoke resize on a Matrix interface")},e.prototype.reshape=function(e,t){throw new Error("Cannot invoke reshape on a Matrix interface")},e.prototype.clone=function(){throw new Error("Cannot invoke clone on a Matrix interface")},e.prototype.size=function(){throw new Error("Cannot invoke size on a Matrix interface")},e.prototype.map=function(e,t){throw new Error("Cannot invoke map on a Matrix interface")},e.prototype.forEach=function(e){throw new Error("Cannot invoke forEach on a Matrix interface")},e.prototype[Symbol.iterator]=function(){throw new Error("Cannot iterate a Matrix interface")},e.prototype.toArray=function(){throw new Error("Cannot invoke toArray on a Matrix interface")},e.prototype.valueOf=function(){throw new Error("Cannot invoke valueOf on a Matrix interface")},e.prototype.format=function(e){throw new Error("Cannot invoke format on a Matrix interface")},e.prototype.toString=function(){throw new Error("Cannot invoke toString on a Matrix interface")},e}),{isClass:!0});function sr(){return sr=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var n=arguments[t];for(var r in n)({}).hasOwnProperty.call(n,r)&&(e[r]=n[r])}return e},sr.apply(null,arguments)}function ur(e,t,n){const r=new(0,e.constructor)(2);let i="";if(n){if(n<1)throw new Error("size must be in greater than 0");if(!ye(n))throw new Error("size must be an integer");if(e.greaterThan(r.pow(n-1).sub(1))||e.lessThan(r.pow(n-1).mul(-1)))throw new Error(`Value must be in range [-2^${n-1}, 2^${n-1}-1]`);if(!e.isInteger())throw new Error("Value must be an integer");e.lessThan(0)&&(e=e.add(r.pow(n))),i=`i${n}`}switch(t){case 2:return`${e.toBinary()}${i}`;case 8:return`${e.toOctal()}${i}`;case 16:return`${e.toHexadecimal()}${i}`;default:throw new Error(`Base ${t} not supported `)}}function cr(e,t){return void 0!==t?e.toExponential(t-1):e.toExponential()}function lr(e,t){return h(e)?e:g(e)?e.toNumber():t}function fr(e,t){const n=e.length-t.length,r=e.length;return e.substring(n,r)===t}function pr(e,t){const n=function(e,t){return"number"==typeof e?Me(e,t):g(e)?function(e,t){if("function"==typeof t)return t(e);if(!e.isFinite())return e.isNaN()?"NaN":e.gt(0)?"Infinity":"-Infinity";const{notation:n,precision:r,wordSize:i}=Ce(t);switch(n){case"fixed":return function(e,t){return e.toFixed(t)}(e,r);case"exponential":return cr(e,r);case"engineering":return function(e,t){const n=e.e,r=n%3==0?n:n<0?n-3-n%3:n-n%3;let i=e.mul(Math.pow(10,-r)).toPrecision(t);return i.includes("e")&&(i=new(0,e.constructor)(i).toFixed()),i+"e"+(n>=0?"+":"")+r.toString()}(e,r);case"bin":return ur(e,2,i);case"oct":return ur(e,8,i);case"hex":return ur(e,16,i);case"auto":{const n=lr(null==t?void 0:t.lowerExp,-3),i=lr(null==t?void 0:t.upperExp,5);if(e.isZero())return"0";let o;const a=e.toSignificantDigits(r),s=a.e;return o=s>=n&&s<i?a.toFixed():cr(e,r),o.replace(/((\.\d*?)(0+))($|e)/,(function(){const e=arguments[2],t=arguments[4];return"."!==e?e+t:t}))}default:throw new Error('Unknown notation "'+n+'". Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.')}}(e,t):function(e){return e&&"object"==typeof e&&"bigint"==typeof e.s&&"bigint"==typeof e.n&&"bigint"==typeof e.d||!1}(e)?t&&"decimal"===t.fraction?e.toString():`${e.s*e.n}/${e.d}`:Array.isArray(e)?gr(e,t):v(e)?mr(e):"function"==typeof e?e.syntax?String(e.syntax):"function":e&&"object"==typeof e?"function"==typeof e.format?e.format(t):e&&e.toString(t)!=={}.toString()?e.toString(t):"{"+Object.keys(e).map((n=>mr(n)+": "+pr(e[n],t))).join(", ")+"}":String(e)}(e,t);return t&&"object"==typeof t&&"truncate"in t&&n.length>t.truncate?n.substring(0,t.truncate-3)+"...":n}function mr(e){const t=String(e);let n="",r=0;for(;r<t.length;){const e=t.charAt(r);n+=e in dr?dr[e]:e,r++}return'"'+n+'"'}const dr={'"':'\\"',"\\":"\\\\","\b":"\\b","\f":"\\f","\n":"\\n","\r":"\\r","\t":"\\t"};function hr(e){let t=String(e);return t=t.replace(/&/g,"&amp;").replace(/"/g,"&quot;").replace(/'/g,"&#39;").replace(/</g,"&lt;").replace(/>/g,"&gt;"),t}function gr(e,t){if(Array.isArray(e)){let n="[";const r=e.length;for(let i=0;i<r;i++)0!==i&&(n+=", "),n+=gr(e[i],t);return n+="]",n}return pr(e,t)}function yr(e,t){if(!v(e))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+oe(e)+", index: 0)");if(!v(t))throw new TypeError("Unexpected type of argument in function compareText (expected: string or Array or Matrix, actual: "+oe(t)+", index: 1)");return e===t?0:e>t?1:-1}function xr(e,t,n){if(!(this instanceof xr))throw new SyntaxError("Constructor must be called with the new operator");this.actual=e,this.expected=t,this.relation=n,this.message="Dimension mismatch ("+(Array.isArray(e)?"["+e.join(", ")+"]":e)+" "+(this.relation||"!=")+" "+(Array.isArray(t)?"["+t.join(", ")+"]":t)+")",this.stack=(new Error).stack}function br(e,t,n){if(!(this instanceof br))throw new SyntaxError("Constructor must be called with the new operator");this.index=e,arguments.length<3?(this.min=0,this.max=t):(this.min=t,this.max=n),void 0!==this.min&&this.index<this.min?this.message="Index out of range ("+this.index+" < "+this.min+")":void 0!==this.max&&this.index>=this.max?this.message="Index out of range ("+this.index+" > "+(this.max-1)+")":this.message="Index out of range ("+this.index+")",this.stack=(new Error).stack}function wr(e){const t=[];for(;Array.isArray(e);)t.push(e.length),e=e[0];return t}function vr(e,t,n){let r;const i=e.length;if(i!==t[n])throw new xr(i,t[n]);if(n<t.length-1){const o=n+1;for(r=0;r<i;r++){const n=e[r];if(!Array.isArray(n))throw new xr(t.length-1,t.length,"<");vr(e[r],t,o)}}else for(r=0;r<i;r++)if(Array.isArray(e[r]))throw new xr(t.length+1,t.length,">")}function Nr(e,t){if(0===t.length){if(Array.isArray(e))throw new xr(e.length,0)}else vr(e,t,0)}function Ar(e,t){const n=e.isMatrix?e._size:wr(e);t._sourceSize.forEach(((e,t)=>{if(null!==e&&e!==n[t])throw new xr(e,n[t])}))}function Er(e,t){if(void 0!==e){if(!h(e)||!ye(e))throw new TypeError("Index must be an integer (value: "+e+")");if(e<0||"number"==typeof t&&e>=t)throw new br(e,t)}}function Sr(e){for(let t=0;t<e._dimensions.length;++t){const n=e._dimensions[t];if(n._data&&N(n._data)){if(0===n._size[0])return!0}else if(n.isRange){if(n.start===n.end)return!0}else if(v(n)&&0===n.length)return!0}return!1}function Mr(e,t,n){if(!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new Error("Resizing to scalar is not supported");return t.forEach((function(e){if(!h(e)||!ye(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+pr(t)+")")})),(h(e)||g(e))&&(e=[e]),Cr(e,t,0,void 0!==n?n:0),e}function Cr(e,t,n,r){let i,o;const a=e.length,s=t[n],u=Math.min(a,s);if(e.length=s,n<t.length-1){const a=n+1;for(i=0;i<u;i++)o=e[i],Array.isArray(o)||(o=[o],e[i]=o),Cr(o,t,a,r);for(i=u;i<s;i++)o=[],e[i]=o,Cr(o,t,a,r)}else{for(i=0;i<u;i++)for(;Array.isArray(e[i]);)e[i]=e[i][0];for(i=u;i<s;i++)e[i]=r}}function Tr(e,t){const n=qr(e,!0),r=n.length;if(!Array.isArray(e)||!Array.isArray(t))throw new TypeError("Array expected");if(0===t.length)throw new xr(0,r,"!=");const i=Fr(t=Br(t,r));if(r!==i)throw new xr(i,r,"!=");try{return function(e,t){let n,r=e;for(let e=t.length-1;e>0;e--){const i=t[e];n=[];const o=r.length/i;for(let e=0;e<o;e++)n.push(r.slice(e*i,(e+1)*i));r=n}return r}(n,t)}catch(e){if(e instanceof xr)throw new xr(i,r,"!=");throw e}}function Br(e,t){const n=Fr(e),r=e.slice(),i=e.indexOf(-1);if(e.indexOf(-1,i+1)>=0)throw new Error("More than one wildcard in sizes");if(i>=0){if(t%n!=0)throw new Error("Could not replace wildcard, since "+t+" is no multiple of "+-n);r[i]=-t/n}return r}function Fr(e){return e.reduce(((e,t)=>e*t),1)}function Dr(e,t){const n=t||wr(e);for(;Array.isArray(e)&&1===e.length;)e=e[0],n.shift();let r=n.length;for(;1===n[r-1];)r--;return r<n.length&&(e=Or(e,r,0),n.length=r),e}function Or(e,t,n){let r,i;if(n<t){const o=n+1;for(r=0,i=e.length;r<i;r++)e[r]=Or(e[r],t,o)}else for(;Array.isArray(e);)e=e[0];return e}function _r(e,t,n,r){const i=r||wr(e);if(n)for(let t=0;t<n;t++)e=[e],i.unshift(1);for(e=zr(e,t,0);i.length<t;)i.push(1);return e}function zr(e,t,n){let r,i;if(Array.isArray(e)){const o=n+1;for(r=0,i=e.length;r<i;r++)e[r]=zr(e[r],t,o)}else for(let r=n;r<t;r++)e=[e];return e}function qr(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1];if(!Array.isArray(e))return e;if("boolean"!=typeof t)throw new TypeError("Boolean expected for second argument of flatten");const n=[];return t?function e(t){if(Array.isArray(t[0]))for(let n=0;n<t.length;n++)e(t[n]);else for(let e=0;e<t.length;e++)n.push(t[e])}(e):function e(t){for(let r=0;r<t.length;r++){const i=t[r];Array.isArray(i)?e(i):n.push(i)}}(e),n}function Ir(e,t){return Array.prototype.map.call(e,t)}function kr(e,t){Array.prototype.forEach.call(e,t)}function Rr(e,t){if(1!==wr(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,t)}function Pr(e,t){if(1!==wr(e).length)throw new Error("Only one dimensional matrices supported");return Array.prototype.filter.call(e,(e=>t.test(e)))}function Ur(e,t){return Array.prototype.join.call(e,t)}function jr(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;const t=[];let n=0;t[0]={value:e[0],identifier:0};for(let r=1;r<e.length;r++)e[r]===e[r-1]?n++:n=0,t.push({value:e[r],identifier:n});return t}function Lr(e){if(!Array.isArray(e))throw new TypeError("Array input expected");if(0===e.length)return e;const t=[];for(let n=0;n<e.length;n++)t.push(e[n].value);return t}function $r(e,t){let n,r=0;for(let i=0;i<e.length;i++){const o=e[i],a=Array.isArray(o);if(0===i&&a&&(r=o.length),a&&o.length!==r)return;const s=a?$r(o,t):t(o);if(void 0===n)n=s;else if(n!==s)return"mixed"}return n}function Hr(e,t,n,r){if(r<n){if(e.length!==t.length)throw new xr(e.length,t.length);const i=[];for(let o=0;o<e.length;o++)i[o]=Hr(e[o],t[o],n,r+1);return i}return e.concat(t)}function Gr(){const e=Array.prototype.slice.call(arguments,0,-1),t=Array.prototype.slice.call(arguments,-1);if(1===e.length)return e[0];if(e.length>1)return e.slice(1).reduce((function(e,n){return Hr(e,n,t,0)}),e[0]);throw new Error("Wrong number of arguments in function concat")}function Zr(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];const r=t.map((e=>e.length)),i=Math.max(...r),o=new Array(i).fill(null);for(let e=0;e<t.length;e++){const n=t[e],a=r[e];for(let e=0;e<a;e++){const t=i-a+e;n[e]>o[t]&&(o[t]=n[e])}}for(let e=0;e<t.length;e++)Vr(t[e],o);return o}function Vr(e,t){const n=t.length,r=e.length;for(let i=0;i<r;i++){const o=n-r+i;if(e[i]<t[o]&&e[i]>1||e[i]>t[o])throw new Error(`shape mismatch: mismatch is found in arg with shape (${e}) not possible to broadcast dimension ${r} with size ${e[i]} to size ${t[o]}`)}}function Wr(e,t){let n=wr(e);if(ce(n,t))return e;Vr(n,t);const r=Zr(n,t),i=r.length,o=[...Array(i-n.length).fill(1),...n];let a=function(e){return sr([],e)}(e);n.length<i&&(a=Tr(a,o),n=wr(a));for(let e=0;e<i;e++)n[e]<r[e]&&(s=a,u=r[e],c=e,a=Gr(...Array(u).fill(s),c),n=wr(a));var s,u,c;return a}function Yr(e,t){if(!Array.isArray(e))throw new Error("Array expected");const n=wr(e);if(t.length!==n.length)throw new xr(t.length,n.length);for(let e=0;e<t.length;e++)Er(t[e],n[e]);return t.reduce(((e,t)=>e[t]),e)}function Jr(e,t){let n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if(0===e.length)return[];if(n)return function e(n){if(Array.isArray(n)){const t=n.length,r=Array(t);for(let i=0;i<t;i++)r[i]=e(n[i]);return r}return t(n)}(e);const r=[];return function n(i,o){if(Array.isArray(i)){const e=i.length,t=Array(e);for(let a=0;a<e;a++)r[o]=a,t[a]=n(i[a],o+1);return t}return t(i,r.slice(0,o),e)}(e,0)}function Xr(e,t){let n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if(0===e.length)return;if(n)return void function e(n){if(Array.isArray(n)){const t=n.length;for(let r=0;r<t;r++)e(n[r])}else t(n)}(e);const r=[];!function n(i,o){if(Array.isArray(i)){const e=i.length;for(let t=0;t<e;t++)r[o]=t,n(i[t],o+1)}else t(i,r.slice(0,o),e)}(e,0)}function Qr(e,n,r,i){if(t.isTypedFunction(e)){let o,a;if(i)o=1;else{const r=(n.isMatrix?n.size():wr(n)).map((()=>0)),i=n.isMatrix?n.get(r):Yr(n,r);o=function(e,n,r,i){const o=[n,r,i];for(let n=3;n>0;n--){const r=o.slice(0,n);if(null!==t.resolve(e,r))return n}}(e,i,r,n)}if(n.isMatrix&&"mixed"!==n.dataType&&void 0!==n.dataType){const t=function(e,t){const n=[];if(Object.entries(e.signatures).forEach((e=>{let[r,i]=e;r.split(",").length===t&&n.push(i)})),1===n.length)return n[0]}(e,o);a=void 0!==t?t:e}else a=e;return o>=1&&o<=3?{isUnary:1===o,fn:function(){for(var t=arguments.length,n=new Array(t),i=0;i<t;i++)n[i]=arguments[i];return ei(a,n.slice(0,o),r,e.name)}}:{isUnary:!1,fn:function(){for(var t=arguments.length,n=new Array(t),i=0;i<t;i++)n[i]=arguments[i];return ei(a,n,r,e.name)}}}return void 0===i?{isUnary:Kr(e),fn:e}:{isUnary:i,fn:e}}function Kr(e){if(1!==e.length)return!1;const t=e.toString();if(/arguments/.test(t))return!1;const n=t.match(/\(.*?\)/);return!/\.\.\./.test(n)}function ei(e,t,n,r){try{return e(...t)}catch(e){!function(e,t,n,r){var i;if(e instanceof TypeError&&"wrongType"===(null===(i=e.data)||void 0===i?void 0:i.category)){const e=[];throw e.push(`value: ${oe(t[0])}`),t.length>=2&&e.push(`index: ${oe(t[1])}`),t.length>=3&&e.push(`array: ${oe(t[2])}`),new TypeError(`Function ${n} cannot apply callback arguments ${r}(${e.join(", ")}) at index ${JSON.stringify(t[1])}`)}throw new TypeError(`Function ${n} cannot apply callback arguments to function ${r}: ${e.message}`)}(e,t,n,r)}}xr.prototype=new RangeError,xr.prototype.constructor=RangeError,xr.prototype.name="DimensionError",xr.prototype.isDimensionError=!0,br.prototype=new RangeError,br.prototype.constructor=RangeError,br.prototype.name="IndexError",br.prototype.isIndexError=!0;const ti=de("DenseMatrix",["Matrix"],(e=>{let{Matrix:t}=e;function n(e,t){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!v(t))throw new Error("Invalid datatype: "+t);if(A(e))"DenseMatrix"===e.type?(this._data=ae(e._data),this._size=ae(e._size),this._datatype=t||e._datatype):(this._data=e.toArray(),this._size=e.size(),this._datatype=t||e._datatype);else if(e&&N(e.data)&&N(e.size))this._data=e.data,this._size=e.size,Nr(this._data,this._size),this._datatype=t||e.datatype;else if(N(e))this._data=o(e),this._size=wr(this._data),Nr(this._data,this._size),this._datatype=t;else{if(e)throw new TypeError("Unsupported type of data ("+oe(e)+")");this._data=[],this._size=[0],this._datatype=t}}function r(e,t,n){if(0===t.length){let t=e._data;for(;N(t);)t=t[0];return t}return e._size=t.slice(0),e._data=Mr(e._data,e._size,n),e}function i(e,t,n){const i=e._size.slice(0);let o=!1;for(;i.length<t.length;)i.push(0),o=!0;for(let e=0,n=t.length;e<n;e++)t[e]>i[e]&&(i[e]=t[e],o=!0);o&&r(e,i,n)}function o(e){return A(e)?o(e.valueOf()):N(e)?e.map(o):e}return n.prototype=new t,n.prototype.createDenseMatrix=function(e,t){return new n(e,t)},Object.defineProperty(n,"name",{value:"DenseMatrix"}),n.prototype.constructor=n,n.prototype.type="DenseMatrix",n.prototype.isDenseMatrix=!0,n.prototype.getDataType=function(){return $r(this._data,oe)},n.prototype.storage=function(){return"dense"},n.prototype.datatype=function(){return this._datatype},n.prototype.create=function(e,t){return new n(e,t)},n.prototype.subset=function(e,t,r){switch(arguments.length){case 1:return function(e,t){if(!T(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());{const r=t.size();if(r.length!==e._size.length)throw new xr(r.length,e._size.length);const i=t.min(),o=t.max();for(let t=0,n=e._size.length;t<n;t++)Er(i[t],e._size[t]),Er(o[t],e._size[t]);const a=new n([]),s=function(e,t){const n=t.size().length-1,r=Array(n);return{data:function e(i){let o=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;const a=t.dimension(o);return r[o]=a.size()[0],o<n?a.map((t=>(Er(t,i.length),e(i[t],o+1)))).valueOf():a.map((e=>(Er(e,i.length),i[e]))).valueOf()}(e),size:r}}(e._data,t);return a._size=s.size,a._datatype=e._datatype,a._data=s.data,a}}(this,e);case 2:case 3:return function(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");const o=t.size(),a=t.isScalar();let s;if(A(n)?(s=n.size(),n=n.valueOf()):s=wr(n),a){if(0!==s.length)throw new TypeError("Scalar expected");e.set(t.min(),n,r)}else{if(!ce(s,o))try{s=wr(n=0===s.length?Wr([n],o):Wr(n,o))}catch(e){}if(o.length<e._size.length)throw new xr(o.length,e._size.length,"<");if(s.length<o.length){let e=0,t=0;for(;1===o[e]&&1===s[e];)e++;for(;1===o[e];)t++,e++;n=_r(n,o.length,t,s)}if(!ce(o,s))throw new xr(o,s,">");i(e,t.max().map((function(e){return e+1})),r),function(e,t,n){const r=t.size().length-1;!function e(n,i){let o=arguments.length>2&&void 0!==arguments[2]?arguments[2]:0;const a=t.dimension(o);o<r?a.forEach(((t,r)=>{Er(t,n.length),e(n[t],i[r[0]],o+1)})):a.forEach(((e,t)=>{Er(e,n.length),n[e]=i[t[0]]}))}(e,n)}(e._data,t,n)}return e}(this,e,t,r);default:throw new SyntaxError("Wrong number of arguments")}},n.prototype.get=function(e){return Yr(this._data,e)},n.prototype.set=function(e,t,n){if(!N(e))throw new TypeError("Array expected");if(e.length<this._size.length)throw new xr(e.length,this._size.length,"<");let r,o,a;const s=e.map((function(e){return e+1}));i(this,s,n);let u=this._data;for(r=0,o=e.length-1;r<o;r++)a=e[r],Er(a,u.length),u=u[a];return a=e[e.length-1],Er(a,u.length),u[a]=t,this},n.prototype.resize=function(e,t,n){if(!E(e))throw new TypeError("Array or Matrix expected");const i=e.valueOf().map((e=>Array.isArray(e)&&1===e.length?e[0]:e));return r(n?this.clone():this,i,t)},n.prototype.reshape=function(e,t){const n=t?this.clone():this;n._data=Tr(n._data,e);const r=n._size.reduce(((e,t)=>e*t));return n._size=Br(e,r),n},n.prototype.clone=function(){return new n({data:ae(this._data),size:ae(this._size),datatype:this._datatype})},n.prototype.size=function(){return this._size.slice(0)},n.prototype.map=function(e){let t=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const n=this,r=n._size.length-1;if(r<0)return n.clone();const i=Qr(e,n,"map",t),o=i.fn,a=n.create(void 0,n._datatype);if(a._size=n._size,t||i.isUnary)return a._data=function e(t){let n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;const i=Array(t.length);if(n<r)for(let r=0;r<t.length;r++)i[r]=e(t[r],n+1);else for(let e=0;e<t.length;e++)i[e]=o(t[e]);return i}(n._data),a;if(0===r){const e=n.valueOf(),t=Array(e.length);for(let r=0;r<e.length;r++)t[r]=o(e[r],[r],n);return a._data=t,a}const s=[];return a._data=function e(t){let i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;const a=Array(t.length);if(i<r)for(let n=0;n<t.length;n++)s[i]=n,a[n]=e(t[n],i+1);else for(let e=0;e<t.length;e++)s[i]=e,a[e]=o(t[e],s.slice(),n);return a}(n._data),a},n.prototype.forEach=function(e){let t=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const n=this,r=n._size.length-1;if(r<0)return;const i=Qr(e,n,"map",t),o=i.fn;if(t||i.isUnary)return void function e(t){let n=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;if(n<r)for(let r=0;r<t.length;r++)e(t[r],n+1);else for(let e=0;e<t.length;e++)o(t[e])}(n._data);if(0===r){for(let e=0;e<n._data.length;e++)o(n._data[e],[e],n);return}const a=[];!function e(t){let i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;if(i<r)for(let n=0;n<t.length;n++)a[i]=n,e(t[n],i+1);else for(let e=0;e<t.length;e++)a[i]=e,o(t[e],a.slice(),n)}(n._data)},n.prototype[Symbol.iterator]=function*(){const e=this._size.length-1;if(e<0)return;if(0===e){for(let e=0;e<this._data.length;e++)yield{value:this._data[e],index:[e]};return}const t=Array(e+1).fill(0),n=this._size.reduce(((e,t)=>e*t),1);for(let r=0;r<n;r++){let n=this._data;for(let r=0;r<e;r++)n=n[t[r]];yield{value:n[t[e]],index:t.slice()};for(let n=e;n>=0&&(t[n]++,!(t[n]<this._size[n]));n--)t[n]=0}},n.prototype.rows=function(){const e=[];if(2!==this.size().length)throw new TypeError("Rows can only be returned for a 2D matrix.");const t=this._data;for(const r of t)e.push(new n([r],this._datatype));return e},n.prototype.columns=function(){const e=[],t=this.size();if(2!==t.length)throw new TypeError("Rows can only be returned for a 2D matrix.");const r=this._data;for(let i=0;i<t[1];i++){const t=r.map((e=>[e[i]]));e.push(new n(t,this._datatype))}return e},n.prototype.toArray=function(){return ae(this._data)},n.prototype.valueOf=function(){return this._data},n.prototype.format=function(e){return pr(this._data,e)},n.prototype.toString=function(){return pr(this._data)},n.prototype.toJSON=function(){return{mathjs:"DenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},n.prototype.diagonal=function(e){if(e){if(g(e)&&(e=e.toNumber()),!h(e)||!ye(e))throw new TypeError("The parameter k must be an integer number")}else e=0;const t=e>0?e:0,r=e<0?-e:0,i=this._size[0],o=this._size[1],a=Math.min(i-r,o-t),s=[];for(let e=0;e<a;e++)s[e]=this._data[e+r][e+t];return new n({data:s,size:[a],datatype:this._datatype})},n.diagonal=function(e,t,r,i){if(!N(e))throw new TypeError("Array expected, size parameter");if(2!==e.length)throw new Error("Only two dimensions matrix are supported");if(e=e.map((function(e){if(g(e)&&(e=e.toNumber()),!h(e)||!ye(e)||e<1)throw new Error("Size values must be positive integers");return e})),r){if(g(r)&&(r=r.toNumber()),!h(r)||!ye(r))throw new TypeError("The parameter k must be an integer number")}else r=0;const o=r>0?r:0,a=r<0?-r:0,s=e[0],u=e[1],c=Math.min(s-a,u-o);let l;if(N(t)){if(t.length!==c)throw new Error("Invalid value array length");l=function(e){return t[e]}}else if(A(t)){const e=t.size();if(1!==e.length||e[0]!==c)throw new Error("Invalid matrix length");l=function(e){return t.get([e])}}else l=function(){return t};i||(i=g(l(0))?l(0).mul(0):0);let f=[];if(e.length>0){f=Mr(f,e,i);for(let e=0;e<c;e++)f[e+a][e+o]=l(e)}return new n({data:f,size:[s,u]})},n.fromJSON=function(e){return new n(e)},n.prototype.swapRows=function(e,t){if(!(h(e)&&ye(e)&&h(t)&&ye(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return Er(e,this._size[0]),Er(t,this._size[0]),n._swapRows(e,t,this._data),this},n._swapRows=function(e,t,n){const r=n[e];n[e]=n[t],n[t]=r},n}),{isClass:!0}),ni="clone",ri=de(ni,["typed"],(e=>{let{typed:t}=e;return t(ni,{any:ae})}));function ii(e){const t=e.length,n=e[0].length;let r,i;const o=[];for(i=0;i<n;i++){const n=[];for(r=0;r<t;r++)n.push(e[r][i]);o.push(n)}return o}function oi(e){for(let t=0;t<e.length;t++)if(E(e[t]))return!0;return!1}function ai(e,t){A(e)?e.forEach((e=>t(e)),!1,!0):Xr(e,t,!0)}function si(e,t,n){if(!n)return A(e)?e.map((e=>t(e)),!1,!0):Jr(e,t,!0);const r=e=>0===e?e:t(e);return A(e)?e.map((e=>r(e)),!1,!0):Jr(e,r,!0)}function ui(e,t,n){const r=Array.isArray(e)?wr(e):e.size();if(t<0||t>=r.length)throw new br(t,r.length);return A(e)?e.create(ci(e.valueOf(),t,n),e.datatype()):ci(e,t,n)}function ci(e,t,n){let r,i,o,a;if(t<=0){if(Array.isArray(e[0])){for(a=ii(e),i=[],r=0;r<a.length;r++)i[r]=ci(a[r],t-1,n);return i}for(o=e[0],r=1;r<e.length;r++)o=n(o,e[r]);return o}for(i=[],r=0;r<e.length;r++)i[r]=ci(e[r],t-1,n);return i}function li(e,t,n,r,i,o,a,s,u,c,l){const f=e._values,p=e._index,m=e._ptr;let d,h,g,y;if(r)for(h=m[t],g=m[t+1],d=h;d<g;d++)y=p[d],n[y]!==o?(n[y]=o,a.push(y),c?(r[y]=u?s(f[d],l):s(l,f[d]),i[y]=o):r[y]=f[d]):(r[y]=u?s(f[d],r[y]):s(r[y],f[d]),i[y]=o);else for(h=m[t],g=m[t+1],d=h;d<g;d++)y=p[d],n[y]!==o?(n[y]=o,a.push(y)):i[y]=o}const fi="isInteger",pi=de(fi,["typed"],(e=>{let{typed:t}=e;return t(fi,{number:ye,BigNumber:function(e){return e.isInt()},bigint:function(e){return!0},Fraction:function(e){return 1n===e.d},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),mi="number";function di(e){return e<0}function hi(e){return e>0}function gi(e){return Number.isNaN(e)}function yi(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:1e-9,r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0;if(n<=0)throw new Error("Relative tolerance must be greater than 0");if(r<0)throw new Error("Absolute tolerance must be at least 0");return!e.isNaN()&&!t.isNaN()&&(e.isFinite()&&t.isFinite()?!!e.eq(t)||e.minus(t).abs().lte(e.constructor.max(e.constructor.max(e.abs(),t.abs()).mul(n),r)):e.eq(t))}di.signature=mi,hi.signature=mi,gi.signature=mi;const xi="isNegative",bi=de(xi,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(xi,{number:e=>!_e(e,0,n.relTol,n.absTol)&&di(e),BigNumber:e=>!yi(e,new e.constructor(0),n.relTol,n.absTol)&&e.isNeg()&&!e.isZero()&&!e.isNaN(),bigint:e=>e<0n,Fraction:e=>e.s<0n,Unit:t.referToSelf((e=>n=>t.find(e,n.valueType())(n.value))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),wi="isNumeric",vi=de(wi,["typed"],(e=>{let{typed:t}=e;return t(wi,{"number | BigNumber | bigint | Fraction | boolean":()=>!0,"Complex | Unit | string | null | undefined | Node":()=>!1,"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Ni="hasNumericValue",Ai=de(Ni,["typed","isNumeric"],(e=>{let{typed:t,isNumeric:n}=e;return t(Ni,{boolean:()=>!0,string:function(e){return e.trim().length>0&&!isNaN(Number(e))},any:function(e){return n(e)}})})),Ei="isPositive",Si=de(Ei,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(Ei,{number:e=>!_e(e,0,n.relTol,n.absTol)&&hi(e),BigNumber:e=>!(yi(e,new e.constructor(0),n.relTol,n.absTol)||e.isNeg()||e.isZero()||e.isNaN()),bigint:e=>e>0n,Fraction:e=>e.s>0n&&e.n>0n,Unit:t.referToSelf((e=>n=>t.find(e,n.valueType())(n.value))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Mi="isZero",Ci=de(Mi,["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return t(Mi,{"number | BigNumber | Complex | Fraction":e=>n(e,0),bigint:e=>0n===e,Unit:t.referToSelf((e=>n=>t.find(e,n.valueType())(n.value))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Ti="isNaN",Bi=de(Ti,["typed"],(e=>{let{typed:t}=e;return t(Ti,{number:gi,BigNumber:function(e){return e.isNaN()},bigint:function(e){return!1},Fraction:function(e){return!1},Complex:function(e){return e.isNaN()},Unit:function(e){return Number.isNaN(e.value)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Fi="typeOf",Di=de(Fi,["typed"],(e=>{let{typed:t}=e;return t(Fi,{any:oe})})),Oi=de("compareUnits",["typed"],(e=>{let{typed:t}=e;return{"Unit, Unit":t.referToSelf((e=>(n,r)=>{if(!n.equalBase(r))throw new Error("Cannot compare units with different base");return t.find(e,[n.valueType(),r.valueType()])(n.value,r.value)}))}})),_i="equalScalar",zi=de(_i,["typed","config"],(e=>{let{typed:t,config:n}=e;const r=Oi({typed:t});return t(_i,{"boolean, boolean":function(e,t){return e===t},"number, number":function(e,t){return _e(e,t,n.relTol,n.absTol)},"BigNumber, BigNumber":function(e,t){return e.eq(t)||yi(e,t,n.relTol,n.absTol)},"bigint, bigint":function(e,t){return e===t},"Fraction, Fraction":function(e,t){return e.equals(t)},"Complex, Complex":function(e,t){return function(e,t,n,r){return _e(e.re,t.re,n,r)&&_e(e.im,t.im,n,r)}(e,t,n.relTol,n.absTol)}},r)})),qi=(de(_i,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(_i,{"number, number":function(e,t){return _e(e,t,n.relTol,n.absTol)}})})),de("SparseMatrix",["typed","equalScalar","Matrix"],(e=>{let{typed:t,equalScalar:n,Matrix:r}=e;function i(e,t){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!v(t))throw new Error("Invalid datatype: "+t);if(A(e))!function(e,t,n){"SparseMatrix"===t.type?(e._values=t._values?ae(t._values):void 0,e._index=ae(t._index),e._ptr=ae(t._ptr),e._size=ae(t._size),e._datatype=n||t._datatype):o(e,t.valueOf(),n||t._datatype)}(this,e,t);else if(e&&N(e.index)&&N(e.ptr)&&N(e.size))this._values=e.values,this._index=e.index,this._ptr=e.ptr,this._size=e.size,this._datatype=t||e.datatype;else if(N(e))o(this,e,t);else{if(e)throw new TypeError("Unsupported type of data ("+oe(e)+")");this._values=[],this._index=[],this._ptr=[0],this._size=[0,0],this._datatype=t}}function o(e,r,i){e._values=[],e._index=[],e._ptr=[],e._datatype=i;const o=r.length;let a=0,s=n,u=0;if(v(i)&&(s=t.find(n,[i,i])||n,u=t.convert(0,i)),o>0){let t=0;do{e._ptr.push(e._index.length);for(let n=0;n<o;n++){const i=r[n];if(N(i)){if(0===t&&a<i.length&&(a=i.length),t<i.length){const r=i[t];s(r,u)||(e._values.push(r),e._index.push(n))}}else 0===t&&a<1&&(a=1),s(i,u)||(e._values.push(i),e._index.push(n))}t++}while(t<a)}e._ptr.push(e._index.length),e._size=[o,a]}function a(e,t,n,r){if(n-t==0)return n;for(let i=t;i<n;i++)if(r[i]===e)return i;return t}function s(e,t,n,r,i,o,a){i.splice(e,0,r),o.splice(e,0,t);for(let e=n+1;e<a.length;e++)a[e]++}function u(e,r,i,o){let a=o||0,s=n,u=0;v(e._datatype)&&(s=t.find(n,[e._datatype,e._datatype])||n,u=t.convert(0,e._datatype),a=t.convert(a,e._datatype));const c=!s(a,u),l=e._size[0];let f,p,m,d=e._size[1];if(i>d){for(p=d;p<i;p++)if(e._ptr[p]=e._values.length,c)for(f=0;f<l;f++)e._values.push(a),e._index.push(f);e._ptr[i]=e._values.length}else i<d&&(e._ptr.splice(i+1,d-i),e._values.splice(e._ptr[i],e._values.length),e._index.splice(e._ptr[i],e._index.length));if(d=i,r>l){if(c){let t=0;for(p=0;p<d;p++){e._ptr[p]=e._ptr[p]+t,m=e._ptr[p+1]+t;let n=0;for(f=l;f<r;f++,n++)e._values.splice(m+n,0,a),e._index.splice(m+n,0,f),t++}e._ptr[d]=e._values.length}}else if(r<l){let t=0;for(p=0;p<d;p++){e._ptr[p]=e._ptr[p]-t;const n=e._ptr[p],i=e._ptr[p+1]-t;for(m=n;m<i;m++)f=e._index[m],f>r-1&&(e._values.splice(m,1),e._index.splice(m,1),t++)}e._ptr[p]=e._values.length}return e._size[0]=r,e._size[1]=i,e}function c(e,t,n,r,i){const o=r[0],a=r[1],s=[];let u,c;for(u=0;u<o;u++)for(s[u]=[],c=0;c<a;c++)s[u][c]=0;for(c=0;c<a;c++){const r=n[c],o=n[c+1];for(let n=r;n<o;n++)u=t[n],s[u][c]=e?i?ae(e[n]):e[n]:1}return s}return i.prototype=new r,i.prototype.createSparseMatrix=function(e,t){return new i(e,t)},Object.defineProperty(i,"name",{value:"SparseMatrix"}),i.prototype.constructor=i,i.prototype.type="SparseMatrix",i.prototype.isSparseMatrix=!0,i.prototype.getDataType=function(){return $r(this._values,oe)},i.prototype.storage=function(){return"sparse"},i.prototype.datatype=function(){return this._datatype},i.prototype.create=function(e,t){return new i(e,t)},i.prototype.density=function(){const e=this._size[0],t=this._size[1];return 0!==e&&0!==t?this._index.length/(e*t):0},i.prototype.subset=function(e,t,n){if(!this._values)throw new Error("Cannot invoke subset on a Pattern only matrix");switch(arguments.length){case 1:return function(e,t){if(!T(t))throw new TypeError("Invalid index");if(t.isScalar())return e.get(t.min());const n=t.size();if(n.length!==e._size.length)throw new xr(n.length,e._size.length);let r,o,a,s;const u=t.min(),c=t.max();for(r=0,o=e._size.length;r<o;r++)Er(u[r],e._size[r]),Er(c[r],e._size[r]);const l=e._values,f=e._index,p=e._ptr,m=t.dimension(0),d=t.dimension(1),h=[],g=[];m.forEach((function(e,t){g[e]=t[0],h[e]=!0}));const y=l?[]:void 0,x=[],b=[];return d.forEach((function(e){for(b.push(x.length),a=p[e],s=p[e+1];a<s;a++)r=f[a],!0===h[r]&&(x.push(g[r]),y&&y.push(l[a]))})),b.push(x.length),new i({values:y,index:x,ptr:b,size:n,datatype:e._datatype})}(this,e);case 2:case 3:return function(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Invalid index");const i=t.size(),o=t.isScalar();let a;if(A(n)?(a=n.size(),n=n.toArray()):a=wr(n),o){if(0!==a.length)throw new TypeError("Scalar expected");e.set(t.min(),n,r)}else{if(1!==i.length&&2!==i.length)throw new xr(i.length,e._size.length,"<");if(a.length<i.length){let e=0,t=0;for(;1===i[e]&&1===a[e];)e++;for(;1===i[e];)t++,e++;n=_r(n,i.length,t,a)}if(!ce(i,a))throw new xr(i,a,">");if(1===i.length)t.dimension(0).forEach((function(t,i){Er(t),e.set([t,0],n[i[0]],r)}));else{const i=t.dimension(0),o=t.dimension(1);i.forEach((function(t,i){Er(t),o.forEach((function(o,a){Er(o),e.set([t,o],n[i[0]][a[0]],r)}))}))}}return e}(this,e,t,n);default:throw new SyntaxError("Wrong number of arguments")}},i.prototype.get=function(e){if(!N(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new xr(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke get on a Pattern only matrix");const t=e[0],n=e[1];Er(t,this._size[0]),Er(n,this._size[1]);const r=a(t,this._ptr[n],this._ptr[n+1],this._index);return r<this._ptr[n+1]&&this._index[r]===t?this._values[r]:0},i.prototype.set=function(e,r,i){if(!N(e))throw new TypeError("Array expected");if(e.length!==this._size.length)throw new xr(e.length,this._size.length);if(!this._values)throw new Error("Cannot invoke set on a Pattern only matrix");const o=e[0],c=e[1];let l=this._size[0],f=this._size[1],p=n,m=0;v(this._datatype)&&(p=t.find(n,[this._datatype,this._datatype])||n,m=t.convert(0,this._datatype)),(o>l-1||c>f-1)&&(u(this,Math.max(o+1,l),Math.max(c+1,f),i),l=this._size[0],f=this._size[1]),Er(o,l),Er(c,f);const d=a(o,this._ptr[c],this._ptr[c+1],this._index);return d<this._ptr[c+1]&&this._index[d]===o?p(r,m)?function(e,t,n,r,i){n.splice(e,1),r.splice(e,1);for(let e=t+1;e<i.length;e++)i[e]--}(d,c,this._values,this._index,this._ptr):this._values[d]=r:p(r,m)||s(d,o,c,r,this._values,this._index,this._ptr),this},i.prototype.resize=function(e,t,n){if(!E(e))throw new TypeError("Array or Matrix expected");const r=e.valueOf().map((e=>Array.isArray(e)&&1===e.length?e[0]:e));if(2!==r.length)throw new Error("Only two dimensions matrix are supported");return r.forEach((function(e){if(!h(e)||!ye(e)||e<0)throw new TypeError("Invalid size, must contain positive integers (size: "+pr(r)+")")})),u(n?this.clone():this,r[0],r[1],t)},i.prototype.reshape=function(e,t){if(!N(e))throw new TypeError("Array expected");if(2!==e.length)throw new Error("Sparse matrices can only be reshaped in two dimensions");e.forEach((function(t){if(!h(t)||!ye(t)||t<=-2||0===t)throw new TypeError("Invalid size, must contain positive integers or -1 (size: "+pr(e)+")")}));const n=this._size[0]*this._size[1];if(n!==(e=Br(e,n))[0]*e[1])throw new Error("Reshaping sparse matrix will result in the wrong number of elements");const r=t?this.clone():this;if(this._size[0]===e[0]&&this._size[1]===e[1])return r;const i=[];for(let e=0;e<r._ptr.length;e++)for(let t=0;t<r._ptr[e+1]-r._ptr[e];t++)i.push(e);const o=r._values.slice(),u=r._index.slice();for(let t=0;t<r._index.length;t++){const n=u[t],o=i[t],a=n*r._size[1]+o;i[t]=a%e[1],u[t]=Math.floor(a/e[1])}r._values.length=0,r._index.length=0,r._ptr.length=e[1]+1,r._size=e.slice();for(let e=0;e<r._ptr.length;e++)r._ptr[e]=0;for(let e=0;e<o.length;e++){const t=u[e],n=i[e],c=o[e];s(a(t,r._ptr[n],r._ptr[n+1],r._index),t,n,c,r._values,r._index,r._ptr)}return r},i.prototype.clone=function(){return new i({values:this._values?ae(this._values):void 0,index:ae(this._index),ptr:ae(this._ptr),size:ae(this._size),datatype:this._datatype})},i.prototype.size=function(){return this._size.slice(0)},i.prototype.map=function(e,r){if(!this._values)throw new Error("Cannot invoke map on a Pattern only matrix");const o=this,a=this._size[0],s=this._size[1],u=Qr(e,o,"map");return function(e,r,a,s,c,l,f){const p=[],m=[],d=[];let h=n,g=0;v(e._datatype)&&(h=t.find(n,[e._datatype,e._datatype])||n,g=t.convert(0,e._datatype));const y=function(e,t,n){const r=function(e,t,n){return u.fn(e,[t,n],o)}(e,t,n);h(r,g)||(p.push(r),m.push(t))};for(let t=0;t<=c;t++){d.push(p.length);const n=e._ptr[t],r=e._ptr[t+1];if(f)for(let i=n;i<r;i++){const n=e._index[i];n>=0&&n<=a&&y(e._values[i],n-0,t-0)}else{const i={};for(let t=n;t<r;t++)i[e._index[t]]=e._values[t];for(let e=0;e<=a;e++)y(e in i?i[e]:0,e-0,t-0)}}return d.push(p.length),new i({values:p,index:m,ptr:d,size:[a-0+1,c-0+1]})}(this,0,a-1,0,s-1,0,r)},i.prototype.forEach=function(e,t){if(!this._values)throw new Error("Cannot invoke forEach on a Pattern only matrix");const n=this,r=this._size[0],i=this._size[1],o=Qr(e,n,"forEach");for(let e=0;e<i;e++){const i=this._ptr[e],a=this._ptr[e+1];if(t)for(let t=i;t<a;t++){const r=this._index[t];o.fn(this._values[t],[r,e],n)}else{const t={};for(let e=i;e<a;e++)t[this._index[e]]=this._values[e];for(let i=0;i<r;i++){const r=i in t?t[i]:0;o.fn(r,[i,e],n)}}}},i.prototype[Symbol.iterator]=function*(){if(!this._values)throw new Error("Cannot iterate a Pattern only matrix");const e=this._size[1];for(let t=0;t<e;t++){const e=this._ptr[t],n=this._ptr[t+1];for(let r=e;r<n;r++){const e=this._index[r];yield{value:this._values[r],index:[e,t]}}}},i.prototype.toArray=function(){return c(this._values,this._index,this._ptr,this._size,!0)},i.prototype.valueOf=function(){return c(this._values,this._index,this._ptr,this._size,!1)},i.prototype.format=function(e){const t=this._size[0],n=this._size[1],r=this.density();let i="Sparse Matrix ["+pr(t,e)+" x "+pr(n,e)+"] density: "+pr(r,e)+"\n";for(let t=0;t<n;t++){const n=this._ptr[t],r=this._ptr[t+1];for(let o=n;o<r;o++)i+="\n    ("+pr(this._index[o],e)+", "+pr(t,e)+") ==> "+(this._values?pr(this._values[o],e):"X")}return i},i.prototype.toString=function(){return pr(this.toArray())},i.prototype.toJSON=function(){return{mathjs:"SparseMatrix",values:this._values,index:this._index,ptr:this._ptr,size:this._size,datatype:this._datatype}},i.prototype.diagonal=function(e){if(e){if(g(e)&&(e=e.toNumber()),!h(e)||!ye(e))throw new TypeError("The parameter k must be an integer number")}else e=0;const t=e>0?e:0,n=e<0?-e:0,r=this._size[0],o=this._size[1],a=Math.min(r-n,o-t),s=[],u=[],c=[];c[0]=0;for(let e=t;e<o&&s.length<a;e++){const r=this._ptr[e],i=this._ptr[e+1];for(let o=r;o<i;o++){const r=this._index[o];if(r===e-t+n){s.push(this._values[o]),u[s.length-1]=r-n;break}}}return c.push(s.length),new i({values:s,index:u,ptr:c,size:[a,1]})},i.fromJSON=function(e){return new i(e)},i.diagonal=function(e,r,o,a,s){if(!N(e))throw new TypeError("Array expected, size parameter");if(2!==e.length)throw new Error("Only two dimensions matrix are supported");if(e=e.map((function(e){if(g(e)&&(e=e.toNumber()),!h(e)||!ye(e)||e<1)throw new Error("Size values must be positive integers");return e})),o){if(g(o)&&(o=o.toNumber()),!h(o)||!ye(o))throw new TypeError("The parameter k must be an integer number")}else o=0;let u=n,c=0;v(s)&&(u=t.find(n,[s,s])||n,c=t.convert(0,s));const l=o>0?o:0,f=o<0?-o:0,p=e[0],m=e[1],d=Math.min(p-f,m-l);let y;if(N(r)){if(r.length!==d)throw new Error("Invalid value array length");y=function(e){return r[e]}}else if(A(r)){const e=r.size();if(1!==e.length||e[0]!==d)throw new Error("Invalid matrix length");y=function(e){return r.get([e])}}else y=function(){return r};const x=[],b=[],w=[];for(let e=0;e<m;e++){w.push(x.length);const t=e-l;if(t>=0&&t<d){const e=y(t);u(e,c)||(b.push(t+f),x.push(e))}}return w.push(x.length),new i({values:x,index:b,ptr:w,size:[p,m]})},i.prototype.swapRows=function(e,t){if(!(h(e)&&ye(e)&&h(t)&&ye(t)))throw new Error("Row index must be positive integers");if(2!==this._size.length)throw new Error("Only two dimensional matrix is supported");return Er(e,this._size[0]),Er(t,this._size[0]),i._swapRows(e,t,this._size[1],this._values,this._index,this._ptr),this},i._forEachRow=function(e,t,n,r,i){const o=r[e],a=r[e+1];for(let e=o;e<a;e++)i(n[e],t[e])},i._swapRows=function(e,t,n,r,i,o){for(let s=0;s<n;s++){const n=o[s],u=o[s+1],c=a(e,n,u,i),l=a(t,n,u,i);if(c<u&&l<u&&i[c]===e&&i[l]===t){if(r){const e=r[c];r[c]=r[l],r[l]=e}}else if(c<u&&i[c]===e&&(l>=u||i[l]!==t)){const e=r?r[c]:void 0;i.splice(l,0,t),r&&r.splice(l,0,e),i.splice(l<=c?c+1:c,1),r&&r.splice(l<=c?c+1:c,1)}else if(l<u&&i[l]===t&&(c>=u||i[c]!==e)){const t=r?r[l]:void 0;i.splice(c,0,e),r&&r.splice(c,0,t),i.splice(c<=l?l+1:l,1),r&&r.splice(c<=l?l+1:l,1)}}},i}),{isClass:!0})),Ii=de("number",["typed"],(e=>{let{typed:t}=e;const n=t("number",{"":function(){return 0},number:function(e){return e},string:function(e){if("NaN"===e)return NaN;const t=function(e){const t=e.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);return t?{input:e,radix:{"0b":2,"0o":8,"0x":16}[t[1]],integerPart:t[2],fractionalPart:t[3]}:null}(e);if(t)return function(e){const t=parseInt(e.integerPart,e.radix);let n=0;for(let t=0;t<e.fractionalPart.length;t++)n+=parseInt(e.fractionalPart[t],e.radix)/Math.pow(e.radix,t+1);const r=t+n;if(isNaN(r))throw new SyntaxError('String "'+e.input+'" is not a valid number');return r}(t);let n=0;const r=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);r&&(n=Number(r[2]),e=r[1]);let i=Number(e);if(isNaN(i))throw new SyntaxError('String "'+e+'" is not a valid number');if(r){if(i>2**n-1)throw new SyntaxError(`String "${e}" is out of range`);i>=2**(n-1)&&(i-=2**n)}return i},BigNumber:function(e){return e.toNumber()},bigint:function(e){return Number(e)},Fraction:function(e){return e.valueOf()},Unit:t.referToSelf((e=>t=>{const n=t.clone();return n.value=e(t.value),n})),null:function(e){return 0},"Unit, string | Unit":function(e,t){return e.toNumber(t)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))});return n.fromJSON=function(e){return parseFloat(e.value)},n})),ki=de("bigint",["typed"],(e=>{let{typed:t}=e;const n=t("bigint",{"":function(){return 0n},bigint:function(e){return e},number:function(e){return BigInt(e.toFixed())},BigNumber:function(e){return BigInt(e.round().toString())},Fraction:function(e){return BigInt(e.valueOf().toFixed())},"string | boolean":function(e){return BigInt(e)},null:function(e){return 0n},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))});return n.fromJSON=function(e){return BigInt(e.value)},n})),Ri="string",Pi=de(Ri,["typed"],(e=>{let{typed:t}=e;return t(Ri,{"":function(){return""},number:Me,null:function(e){return"null"},boolean:function(e){return e+""},string:function(e){return e},"Array | Matrix":t.referToSelf((e=>t=>si(t,e))),any:function(e){return String(e)}})})),Ui="boolean",ji=de(Ui,["typed"],(e=>{let{typed:t}=e;return t(Ui,{"":function(){return!1},boolean:function(e){return e},number:function(e){return!!e},null:function(e){return!1},BigNumber:function(e){return!e.isZero()},string:function(e){const t=e.toLowerCase();if("true"===t)return!0;if("false"===t)return!1;const n=Number(e);if(""!==e&&!isNaN(n))return!!n;throw new Error('Cannot convert "'+e+'" to a boolean')},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Li=de("bignumber",["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t("bignumber",{"":function(){return new n(0)},number:function(e){return new n(e+"")},string:function(e){const t=e.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);if(t){const r=t[2],i=n(t[1]),o=new n(2).pow(Number(r));if(i.gt(o.sub(1)))throw new SyntaxError(`String "${e}" is out of range`);const a=new n(2).pow(Number(r)-1);return i.gte(a)?i.sub(o):i}return new n(e)},BigNumber:function(e){return e},bigint:function(e){return new n(e.toString())},Unit:t.referToSelf((e=>t=>{const n=t.clone();return n.value=e(t.value),n})),Fraction:function(e){return new n(String(e.n)).div(String(e.d)).times(String(e.s))},null:function(e){return new n(0)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),$i=de("complex",["typed","Complex"],(e=>{let{typed:t,Complex:n}=e;return t("complex",{"":function(){return n.ZERO},number:function(e){return new n(e,0)},"number, number":function(e,t){return new n(e,t)},"BigNumber, BigNumber":function(e,t){return new n(e.toNumber(),t.toNumber())},Fraction:function(e){return new n(e.valueOf(),0)},Complex:function(e){return e.clone()},string:function(e){return n(e)},null:function(e){return n(0)},Object:function(e){if("re"in e&&"im"in e)return new n(e.re,e.im);if("r"in e&&"phi"in e||"abs"in e&&"arg"in e)return new n(e);throw new Error("Expected object with properties (re and im) or (r and phi) or (abs and arg)")},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Hi=de("fraction",["typed","Fraction"],(e=>{let{typed:t,Fraction:n}=e;return t("fraction",{number:function(e){if(!isFinite(e)||isNaN(e))throw new Error(e+" cannot be represented as a fraction");return new n(e)},string:function(e){return new n(e)},"number, number":function(e,t){return new n(e,t)},"bigint, bigint":function(e,t){return new n(e,t)},null:function(e){return new n(0)},BigNumber:function(e){return new n(e.toString())},bigint:function(e){return new n(e.toString())},Fraction:function(e){return e},Unit:t.referToSelf((e=>t=>{const n=t.clone();return n.value=e(t.value),n})),Object:function(e){return new n(e)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Gi="matrix",Zi=de(Gi,["typed","Matrix","DenseMatrix","SparseMatrix"],(e=>{let{typed:t,Matrix:n,DenseMatrix:r,SparseMatrix:i}=e;return t(Gi,{"":function(){return o([])},string:function(e){return o([],e)},"string, string":function(e,t){return o([],e,t)},Array:function(e){return o(e)},Matrix:function(e){return o(e,e.storage())},"Array | Matrix, string":o,"Array | Matrix, string, string":o});function o(e,t,n){if("dense"===t||"default"===t||void 0===t)return new r(e,n);if("sparse"===t)return new i(e,n);throw new TypeError("Unknown matrix type "+JSON.stringify(t)+".")}})),Vi="matrixFromFunction",Wi=de(Vi,["typed","matrix","isZero"],(e=>{let{typed:t,matrix:n,isZero:r}=e;return t(Vi,{"Array | Matrix, function, string, string":function(e,t,n,r){return i(e,t,n,r)},"Array | Matrix, function, string":function(e,t,n){return i(e,t,n)},"Matrix, function":function(e,t){return i(e,t,"dense")},"Array, function":function(e,t){return i(e,t,"dense").toArray()},"Array | Matrix, string, function":function(e,t,n){return i(e,n,t)},"Array | Matrix, string, string, function":function(e,t,n,r){return i(e,r,t,n)}});function i(e,t,i,o){let a;return a=void 0!==o?n(i,o):n(i),a.resize(e),a.forEach((function(e,n){const i=t(n);r(i)||a.set(n,i)})),a}})),Yi="matrixFromRows",Ji=de(Yi,["typed","matrix","flatten","size"],(e=>{let{typed:t,matrix:n,flatten:r,size:i}=e;return t(Yi,{"...Array":function(e){return o(e)},"...Matrix":function(e){return n(o(e.map((e=>e.toArray()))))}});function o(e){if(0===e.length)throw new TypeError("At least one row is needed to construct a matrix.");const t=a(e[0]),n=[];for(const i of e){const e=a(i);if(e!==t)throw new TypeError("The vectors had different length: "+(0|t)+" ≠ "+(0|e));n.push(r(i))}return n}function a(e){const t=i(e);if(1===t.length)return t[0];if(2===t.length){if(1===t[0])return t[1];if(1===t[1])return t[0];throw new TypeError("At least one of the arguments is not a vector.")}throw new TypeError("Only one- or two-dimensional vectors are supported.")}})),Xi="matrixFromColumns",Qi=de(Xi,["typed","matrix","flatten","size"],(e=>{let{typed:t,matrix:n,flatten:r,size:i}=e;return t(Xi,{"...Array":function(e){return o(e)},"...Matrix":function(e){return n(o(e.map((e=>e.toArray()))))}});function o(e){if(0===e.length)throw new TypeError("At least one column is needed to construct a matrix.");const t=a(e[0]),n=[];for(let e=0;e<t;e++)n[e]=[];for(const i of e){const e=a(i);if(e!==t)throw new TypeError("The vectors had different length: "+(0|t)+" ≠ "+(0|e));const o=r(i);for(let e=0;e<t;e++)n[e].push(o[e])}return n}function a(e){const t=i(e);if(1===t.length)return t[0];if(2===t.length){if(1===t[0])return t[1];if(1===t[1])return t[0];throw new TypeError("At least one of the arguments is not a vector.")}throw new TypeError("Only one- or two-dimensional vectors are supported.")}})),Ki="splitUnit",eo=de(Ki,["typed"],(e=>{let{typed:t}=e;return t(Ki,{"Unit, Array":function(e,t){return e.splitUnit(t)}})})),to="number",no="number, number";function ro(e){return Math.abs(e)}function io(e,t){return e+t}function oo(e,t){return e-t}function ao(e,t){return e*t}function so(e){return-e}function uo(e){return e}function co(e){return Ae(e)}function lo(e){return e*e*e}function fo(e){return Math.exp(e)}function po(e){return Ee(e)}function mo(e,t){if(!ye(e)||!ye(t))throw new Error("Parameters in function lcm must be integer numbers");if(0===e||0===t)return 0;let n;const r=e*t;for(;0!==t;)n=t,t=e%n,e=n;return Math.abs(r/e)}function ho(e,t){return t?Math.log(e)/Math.log(t):Math.log(e)}function go(e){return ve(e)}function yo(e){return we(e)}function xo(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:2;const n=t<0;if(n&&(t=-t),0===t)throw new Error("Root must be non-zero");if(e<0&&Math.abs(t)%2!=1)throw new Error("Root must be odd when a is negative.");if(0===e)return n?1/0:0;if(!isFinite(e))return n?0:e;let r=Math.pow(Math.abs(e),1/t);return r=e<0?-r:r,n?1/r:r}function bo(e){return be(e)}function wo(e){return e*e}function vo(e,t){let n,r,i,o,a=0,s=1,u=1,c=0;if(!ye(e)||!ye(t))throw new Error("Parameters in function xgcd must be integer numbers");for(;t;)r=Math.floor(e/t),i=e-r*t,n=a,a=s-r*a,s=n,n=u,u=c-r*u,c=n,e=t,t=i;return o=e<0?[-e,-s,-c]:[e,e?s:0,c],o}function No(e,t){return e*e<1&&t===1/0||e*e>1&&t===-1/0?0:Math.pow(e,t)}function Ao(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;if(!ye(t)||t<0||t>15)throw new Error("Number of decimals in function round must be an integer from 0 to 15 inclusive");return parseFloat(Be(e,t))}ro.signature=to,io.signature=no,oo.signature=no,ao.signature=no,so.signature=to,uo.signature=to,co.signature=to,lo.signature=to,fo.signature=to,po.signature=to,mo.signature=no,go.signature=to,yo.signature=to,bo.signature=to,wo.signature=to,vo.signature=no,No.signature=no;const Eo="unaryMinus",So=de(Eo,["typed"],(e=>{let{typed:t}=e;return t(Eo,{number:so,"Complex | BigNumber | Fraction":e=>e.neg(),bigint:e=>-e,Unit:t.referToSelf((e=>n=>{const r=n.clone();return r.value=t.find(e,r.valueType())(n.value),r})),"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0)))})})),Mo="unaryPlus",Co=de(Mo,["typed","config","numeric"],(e=>{let{typed:t,config:n,numeric:r}=e;return t(Mo,{number:uo,Complex:function(e){return e},BigNumber:function(e){return e},bigint:function(e){return e},Fraction:function(e){return e},Unit:function(e){return e.clone()},"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),boolean:function(e){return r(e?1:0,n.number)},string:function(e){return r(e,xe(e,n))}})})),To=de("abs",["typed"],(e=>{let{typed:t}=e;return t("abs",{number:ro,"Complex | BigNumber | Fraction | Unit":e=>e.abs(),bigint:e=>e<0n?-e:e,"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0)))})})),Bo="mapSlices",Fo=de(Bo,["typed","isInteger"],(e=>{let{typed:t,isInteger:n}=e;return t(Bo,{"Array | Matrix, number | BigNumber, function":function(e,t,r){if(!n(t))throw new TypeError("Integer number expected for dimension");const i=Array.isArray(e)?wr(e):e.size();if(t<0||t>=i.length)throw new br(t,i.length);return A(e)?e.create(Do(e.valueOf(),t,r),e.datatype()):Do(e,t,r)}})}),{formerly:"apply"});function Do(e,t,n){let r,i,o;if(t<=0){if(Array.isArray(e[0])){for(o=function(e){const t=e.length,n=e[0].length;let r,i;const o=[];for(i=0;i<n;i++){const n=[];for(r=0;r<t;r++)n.push(e[r][i]);o.push(n)}return o}(e),i=[],r=0;r<o.length;r++)i[r]=Do(o[r],t-1,n);return i}return n(e)}for(i=[],r=0;r<e.length;r++)i[r]=Do(e[r],t-1,n);return i}const Oo="addScalar",_o=de(Oo,["typed"],(e=>{let{typed:t}=e;return t(Oo,{"number, number":io,"Complex, Complex":function(e,t){return e.add(t)},"BigNumber, BigNumber":function(e,t){return e.plus(t)},"bigint, bigint":function(e,t){return e+t},"Fraction, Fraction":function(e,t){return e.add(t)},"Unit, Unit":t.referToSelf((e=>(n,r)=>{if(null===n.value||void 0===n.value)throw new Error("Parameter x contains a unit with undefined value");if(null===r.value||void 0===r.value)throw new Error("Parameter y contains a unit with undefined value");if(!n.equalBase(r))throw new Error("Units do not match");const i=n.clone();return i.value=t.find(e,[i.valueType(),r.valueType()])(i.value,r.value),i.fixPrefix=!1,i}))})})),zo="subtractScalar",qo=de(zo,["typed"],(e=>{let{typed:t}=e;return t(zo,{"number, number":oo,"Complex, Complex":function(e,t){return e.sub(t)},"BigNumber, BigNumber":function(e,t){return e.minus(t)},"bigint, bigint":function(e,t){return e-t},"Fraction, Fraction":function(e,t){return e.sub(t)},"Unit, Unit":t.referToSelf((e=>(n,r)=>{if(null===n.value||void 0===n.value)throw new Error("Parameter x contains a unit with undefined value");if(null===r.value||void 0===r.value)throw new Error("Parameter y contains a unit with undefined value");if(!n.equalBase(r))throw new Error("Units do not match");const i=n.clone();return i.value=t.find(e,[i.valueType(),r.valueType()])(i.value,r.value),i.fixPrefix=!1,i}))})})),Io="cbrt",ko=de(Io,["config","typed","isNegative","unaryMinus","matrix","Complex","BigNumber","Fraction"],(e=>{let{config:t,typed:n,isNegative:r,unaryMinus:i,matrix:o,Complex:a,BigNumber:s,Fraction:u}=e;return n(Io,{number:co,Complex:c,"Complex, boolean":c,BigNumber:function(e){return e.cbrt()},Unit:function(e){if(e.value&&x(e.value)){let t=e.clone();return t.value=1,t=t.pow(1/3),t.value=c(e.value),t}{const t=r(e.value);let n;t&&(e.value=i(e.value)),n=g(e.value)?new s(1).div(3):b(e.value)?new u(1,3):1/3;const o=e.pow(n);return t&&(o.value=i(o.value)),o}}});function c(e,n){const r=e.arg()/3,i=e.abs(),s=new a(co(i),0).mul(new a(0,r).exp());if(n){const e=[s,new a(co(i),0).mul(new a(0,r+2*Math.PI/3).exp()),new a(co(i),0).mul(new a(0,r-2*Math.PI/3).exp())];return"Array"===t.matrix?e:o(e)}return s}})),Ro=de("matAlgo11xS0s",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i,o){const a=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!a)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");const f=c[0],p=c[1];let m,d=n,h=0,g=i;"string"==typeof l&&(m=l,d=t.find(n,[m,m]),h=t.convert(0,m),r=t.convert(r,m),g=t.find(i,[m,m]));const y=[],x=[],b=[];for(let e=0;e<p;e++){b[e]=x.length;for(let t=u[e],n=u[e+1],i=t;i<n;i++){const e=s[i],t=o?g(r,a[i]):g(a[i],r);d(t,h)||(x.push(e),y.push(t))}}return b[p]=x.length,e.createSparseMatrix({values:y,index:x,ptr:b,size:[f,p],datatype:m})}})),Po=de("matAlgo12xSfs",["typed","DenseMatrix"],(e=>{let{typed:t,DenseMatrix:n}=e;return function(e,r,i,o){const a=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!a)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");const f=c[0],p=c[1];let m,d=i;"string"==typeof l&&(m=l,r=t.convert(r,m),d=t.find(i,[m,m]));const h=[],g=[],y=[];for(let e=0;e<p;e++){const t=e+1;for(let n=u[e],r=u[e+1],i=n;i<r;i++){const e=s[i];g[e]=a[i],y[e]=t}for(let n=0;n<f;n++)0===e&&(h[n]=[]),y[n]===t?h[n][e]=o?d(r,g[n]):d(g[n],r):h[n][e]=o?d(r,0):d(0,r)}return new n({data:h,size:[f,p],datatype:m})}})),Uo=de("matAlgo14xDs",["typed"],(e=>{let{typed:t}=e;return function(e,r,i,o){const a=e._data,s=e._size,u=e._datatype;let c,l=i;"string"==typeof u&&(c=u,r=t.convert(r,c),l=t.find(i,[c,c]));const f=s.length>0?n(l,0,s,s[0],a,r,o):[];return e.createDenseMatrix({data:f,size:ae(s),datatype:c})};function n(e,t,r,i,o,a,s){const u=[];if(t===r.length-1)for(let t=0;t<i;t++)u[t]=s?e(a,o[t]):e(o[t],a);else for(let c=0;c<i;c++)u[c]=n(e,t+1,r,r[t+1],o[c],a,s);return u}})),jo="ceil",Lo=["typed","config","round","matrix","equalScalar","zeros","DenseMatrix"],$o=new Dn(10),Ho=de(jo,["typed","config","round"],(e=>{let{typed:t,config:n,round:r}=e;function i(e){const t=Math.ceil(e),i=r(e);return t===i?t:_e(e,i,n.relTol,n.absTol)&&!_e(e,t,n.relTol,n.absTol)?i:t}return t(jo,{number:i,"number, number":function(e,t){if(!ye(t))throw new RangeError("number of decimals in function ceil must be an integer");if(t<0||t>15)throw new RangeError("number of decimals in ceil number must be in range 0-15");const n=10**t;return i(e*n)/n}})})),Go=de(jo,Lo,(e=>{let{typed:t,config:n,round:r,matrix:i,equalScalar:o,zeros:a,DenseMatrix:s}=e;const u=Ro({typed:t,equalScalar:o}),c=Po({typed:t,DenseMatrix:s}),l=Uo({typed:t}),f=Ho({typed:t,config:n,round:r});function p(e){const t=(e,t)=>yi(e,t,n.relTol,n.absTol),i=e.ceil(),o=r(e);return i.eq(o)?i:t(e,o)&&!t(e,i)?o:i}return t("ceil",{number:f.signatures.number,"number,number":f.signatures["number,number"],Complex:function(e){return e.ceil()},"Complex, number":function(e,t){return e.ceil(t)},"Complex, BigNumber":function(e,t){return e.ceil(t.toNumber())},BigNumber:p,"BigNumber, BigNumber":function(e,t){const n=$o.pow(t);return p(e.mul(n)).div(n)},bigint:e=>e,"bigint, number":(e,t)=>e,"bigint, BigNumber":(e,t)=>e,Fraction:function(e){return e.ceil()},"Fraction, number":function(e,t){return e.ceil(t)},"Fraction, BigNumber":function(e,t){return e.ceil(t.toNumber())},"Unit, number, Unit":t.referToSelf((e=>function(t,n,r){const i=t.toNumeric(r);return r.multiply(e(i,n))})),"Unit, BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>e(t,n.toNumber(),r))),"Array | Matrix, number | BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>si(t,(t=>e(t,n,r)),!0))),"Array | Matrix | Unit, Unit":t.referToSelf((e=>(t,n)=>e(t,0,n))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),"Array, number | BigNumber":t.referToSelf((e=>(t,n)=>si(t,(t=>e(t,n)),!0))),"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>u(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>l(t,n,e,!1))),"number | Complex | Fraction | BigNumber, Array":t.referToSelf((e=>(t,n)=>l(i(n),t,e,!0).valueOf())),"number | Complex | Fraction | BigNumber, Matrix":t.referToSelf((e=>(t,n)=>o(t,0)?a(n.size(),n.storage()):"dense"===n.storage()?l(n,t,e,!0):c(n,t,e,!0)))})})),Zo="cube",Vo=de(Zo,["typed"],(e=>{let{typed:t}=e;return t(Zo,{number:lo,Complex:function(e){return e.mul(e).mul(e)},BigNumber:function(e){return e.times(e).times(e)},bigint:function(e){return e*e*e},Fraction:function(e){return e.pow(3)},Unit:function(e){return e.pow(3)}})})),Wo=de("exp",["typed"],(e=>{let{typed:t}=e;return t("exp",{number:fo,Complex:function(e){return e.exp()},BigNumber:function(e){return e.exp()}})})),Yo="expm1",Jo=de(Yo,["typed","Complex"],(e=>{let{typed:t,Complex:n}=e;return t(Yo,{number:po,Complex:function(e){const t=Math.exp(e.re);return new n(t*Math.cos(e.im)-1,t*Math.sin(e.im))},BigNumber:function(e){return e.exp().minus(1)}})})),Xo="fix",Qo=["typed","Complex","matrix","ceil","floor","equalScalar","zeros","DenseMatrix"],Ko=de(Xo,["typed","ceil","floor"],(e=>{let{typed:t,ceil:n,floor:r}=e;return t(Xo,{number:function(e){return e>0?r(e):n(e)},"number, number":function(e,t){return e>0?r(e,t):n(e,t)}})})),ea=de(Xo,Qo,(e=>{let{typed:t,Complex:n,matrix:r,ceil:i,floor:o,equalScalar:a,zeros:s,DenseMatrix:u}=e;const c=Po({typed:t,DenseMatrix:u}),l=Uo({typed:t}),f=Ko({typed:t,ceil:i,floor:o});return t("fix",{number:f.signatures.number,"number, number | BigNumber":f.signatures["number,number"],Complex:function(e){return new n(e.re>0?Math.floor(e.re):Math.ceil(e.re),e.im>0?Math.floor(e.im):Math.ceil(e.im))},"Complex, number":function(e,t){return new n(e.re>0?o(e.re,t):i(e.re,t),e.im>0?o(e.im,t):i(e.im,t))},"Complex, BigNumber":function(e,t){const r=t.toNumber();return new n(e.re>0?o(e.re,r):i(e.re,r),e.im>0?o(e.im,r):i(e.im,r))},BigNumber:function(e){return e.isNegative()?i(e):o(e)},"BigNumber, number | BigNumber":function(e,t){return e.isNegative()?i(e,t):o(e,t)},bigint:e=>e,"bigint, number":(e,t)=>e,"bigint, BigNumber":(e,t)=>e,Fraction:function(e){return e.s<0n?e.ceil():e.floor()},"Fraction, number | BigNumber":function(e,t){return e.s<0n?i(e,t):o(e,t)},"Unit, number, Unit":t.referToSelf((e=>function(t,n,r){const i=t.toNumeric(r);return r.multiply(e(i,n))})),"Unit, BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>e(t,n.toNumber(),r))),"Array | Matrix, number | BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>si(t,(t=>e(t,n,r)),!0))),"Array | Matrix | Unit, Unit":t.referToSelf((e=>(t,n)=>e(t,0,n))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),"Array | Matrix, number | BigNumber":t.referToSelf((e=>(t,n)=>si(t,(t=>e(t,n)),!0))),"number | Complex | Fraction | BigNumber, Array":t.referToSelf((e=>(t,n)=>l(r(n),t,e,!0).valueOf())),"number | Complex | Fraction | BigNumber, Matrix":t.referToSelf((e=>(t,n)=>a(t,0)?s(n.size(),n.storage()):"dense"===n.storage()?l(n,t,e,!0):c(n,t,e,!0)))})})),ta="floor",na=["typed","config","round","matrix","equalScalar","zeros","DenseMatrix"],ra=new Dn(10),ia=de(ta,["typed","config","round"],(e=>{let{typed:t,config:n,round:r}=e;function i(e){const t=Math.floor(e),i=r(e);return t===i?t:_e(e,i,n.relTol,n.absTol)&&!_e(e,t,n.relTol,n.absTol)?i:t}return t(ta,{number:i,"number, number":function(e,t){if(!ye(t))throw new RangeError("number of decimals in function floor must be an integer");if(t<0||t>15)throw new RangeError("number of decimals in floor number must be in range 0 - 15");const n=10**t;return i(e*n)/n}})})),oa=de(ta,na,(e=>{let{typed:t,config:n,round:r,matrix:i,equalScalar:o,zeros:a,DenseMatrix:s}=e;const u=Ro({typed:t,equalScalar:o}),c=Po({typed:t,DenseMatrix:s}),l=Uo({typed:t}),f=ia({typed:t,config:n,round:r});function p(e){const t=(e,t)=>yi(e,t,n.relTol,n.absTol),i=e.floor(),o=r(e);return i.eq(o)?i:t(e,o)&&!t(e,i)?o:i}return t("floor",{number:f.signatures.number,"number,number":f.signatures["number,number"],Complex:function(e){return e.floor()},"Complex, number":function(e,t){return e.floor(t)},"Complex, BigNumber":function(e,t){return e.floor(t.toNumber())},BigNumber:p,"BigNumber, BigNumber":function(e,t){const n=ra.pow(t);return p(e.mul(n)).div(n)},bigint:e=>e,"bigint, number":(e,t)=>e,"bigint, BigNumber":(e,t)=>e,Fraction:function(e){return e.floor()},"Fraction, number":function(e,t){return e.floor(t)},"Fraction, BigNumber":function(e,t){return e.floor(t.toNumber())},"Unit, number, Unit":t.referToSelf((e=>function(t,n,r){const i=t.toNumeric(r);return r.multiply(e(i,n))})),"Unit, BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>e(t,n.toNumber(),r))),"Array | Matrix, number | BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>si(t,(t=>e(t,n,r)),!0))),"Array | Matrix | Unit, Unit":t.referToSelf((e=>(t,n)=>e(t,0,n))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),"Array, number | BigNumber":t.referToSelf((e=>(t,n)=>si(t,(t=>e(t,n)),!0))),"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>u(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>l(t,n,e,!1))),"number | Complex | Fraction | BigNumber, Array":t.referToSelf((e=>(t,n)=>l(i(n),t,e,!0).valueOf())),"number | Complex | Fraction | BigNumber, Matrix":t.referToSelf((e=>(t,n)=>o(t,0)?a(n.size(),n.storage()):"dense"===n.storage()?l(n,t,e,!0):c(n,t,e,!0)))})})),aa=de("matAlgo02xDS0",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i,o){const a=e._data,s=e._size,u=e._datatype||e.getDataType(),c=r._values,l=r._index,f=r._ptr,p=r._size,m=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(s.length!==p.length)throw new xr(s.length,p.length);if(s[0]!==p[0]||s[1]!==p[1])throw new RangeError("Dimension mismatch. Matrix A ("+s+") must match Matrix B ("+p+")");if(!c)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");const d=s[0],h=s[1];let g,y=n,x=0,b=i;"string"==typeof u&&u===m&&"mixed"!==u&&(g=u,y=t.find(n,[g,g]),x=t.convert(0,g),b=t.find(i,[g,g]));const w=[],v=[],N=[];for(let e=0;e<h;e++){N[e]=v.length;for(let t=f[e],n=f[e+1],r=t;r<n;r++){const t=l[r],n=o?b(c[r],a[t][e]):b(a[t][e],c[r]);y(n,x)||(v.push(t),w.push(n))}}return N[h]=v.length,r.createSparseMatrix({values:w,index:v,ptr:N,size:[d,h],datatype:u===e._datatype&&m===r._datatype?g:void 0})}})),sa=de("matAlgo03xDSf",["typed"],(e=>{let{typed:t}=e;return function(e,n,r,i){const o=e._data,a=e._size,s=e._datatype||e.getDataType(),u=n._values,c=n._index,l=n._ptr,f=n._size,p=n._datatype||void 0===n._data?n._datatype:n.getDataType();if(a.length!==f.length)throw new xr(a.length,f.length);if(a[0]!==f[0]||a[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+a+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");const m=a[0],d=a[1];let h,g=0,y=r;"string"==typeof s&&s===p&&"mixed"!==s&&(h=s,g=t.convert(0,h),y=t.find(r,[h,h]));const x=[];for(let e=0;e<m;e++)x[e]=[];const b=[],w=[];for(let e=0;e<d;e++){const t=e+1;for(let n=l[e],r=l[e+1],a=n;a<r;a++){const n=c[a];b[n]=i?y(u[a],o[n][e]):y(o[n][e],u[a]),w[n]=t}for(let n=0;n<m;n++)w[n]===t?x[n][e]=b[n]:x[n][e]=i?y(g,o[n][e]):y(o[n][e],g)}return e.createDenseMatrix({data:x,size:[m,d],datatype:s===e._datatype&&p===n._datatype?h:void 0})}})),ua=de("matAlgo05xSfSf",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i){const o=e._values,a=e._index,s=e._ptr,u=e._size,c=e._datatype||void 0===e._data?e._datatype:e.getDataType(),l=r._values,f=r._index,p=r._ptr,m=r._size,d=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(u.length!==m.length)throw new xr(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");const h=u[0],g=u[1];let y,x=n,b=0,w=i;"string"==typeof c&&c===d&&"mixed"!==c&&(y=c,x=t.find(n,[y,y]),b=t.convert(0,y),w=t.find(i,[y,y]));const v=o&&l?[]:void 0,N=[],A=[],E=v?[]:void 0,S=v?[]:void 0,M=[],C=[];let T,B,F,D;for(B=0;B<g;B++){A[B]=N.length;const e=B+1;for(F=s[B],D=s[B+1];F<D;F++)T=a[F],N.push(T),M[T]=e,E&&(E[T]=o[F]);for(F=p[B],D=p[B+1];F<D;F++)T=f[F],M[T]!==e&&N.push(T),C[T]=e,S&&(S[T]=l[F]);if(v)for(F=A[B];F<N.length;){T=N[F];const t=M[T],n=C[T];if(t===e||n===e){const r=w(t===e?E[T]:b,n===e?S[T]:b);x(r,b)?N.splice(F,1):(v.push(r),F++)}}}return A[g]=N.length,e.createSparseMatrix({values:v,index:N,ptr:A,size:[h,g],datatype:c===e._datatype&&d===r._datatype?y:void 0})}})),ca=de("matAlgo13xDD",["typed"],(e=>{let{typed:t}=e;return function(e,r,i){const o=e._data,a=e._size,s=e._datatype,u=r._data,c=r._size,l=r._datatype,f=[];if(a.length!==c.length)throw new xr(a.length,c.length);for(let e=0;e<a.length;e++){if(a[e]!==c[e])throw new RangeError("Dimension mismatch. Matrix A ("+a+") must match Matrix B ("+c+")");f[e]=a[e]}let p,m=i;"string"==typeof s&&s===l&&(p=s,m=t.find(i,[p,p]));const d=f.length>0?n(m,0,f,f[0],o,u):[];return e.createDenseMatrix({data:d,size:f,datatype:p})};function n(e,t,r,i,o,a){const s=[];if(t===r.length-1)for(let t=0;t<i;t++)s[t]=e(o[t],a[t]);else for(let u=0;u<i;u++)s[u]=n(e,t+1,r,r[t+1],o[u],a[u]);return s}}));function la(e,t){if(ce(e.size(),t.size()))return[e,t];const n=Zr(e.size(),t.size());return[e,t].map((e=>function(e,t){return ce(e.size(),t)?e:e.create(Wr(e.valueOf(),t),e.datatype())}(e,n)))}const fa=de("matrixAlgorithmSuite",["typed","matrix"],(e=>{let{typed:t,matrix:n}=e;const r=ca({typed:t}),i=Uo({typed:t});return function(e){const o=e.elop,a=e.SD||e.DS;let s;o?(s={"DenseMatrix, DenseMatrix":(e,t)=>r(...la(e,t),o),"Array, Array":(e,t)=>r(...la(n(e),n(t)),o).valueOf(),"Array, DenseMatrix":(e,t)=>r(...la(n(e),t),o),"DenseMatrix, Array":(e,t)=>r(...la(e,n(t)),o)},e.SS&&(s["SparseMatrix, SparseMatrix"]=(t,n)=>e.SS(...la(t,n),o,!1)),e.DS&&(s["DenseMatrix, SparseMatrix"]=(t,n)=>e.DS(...la(t,n),o,!1),s["Array, SparseMatrix"]=(t,r)=>e.DS(...la(n(t),r),o,!1)),a&&(s["SparseMatrix, DenseMatrix"]=(e,t)=>a(...la(t,e),o,!0),s["SparseMatrix, Array"]=(e,t)=>a(...la(n(t),e),o,!0))):(s={"DenseMatrix, DenseMatrix":t.referToSelf((e=>(t,n)=>r(...la(t,n),e))),"Array, Array":t.referToSelf((e=>(t,i)=>r(...la(n(t),n(i)),e).valueOf())),"Array, DenseMatrix":t.referToSelf((e=>(t,i)=>r(...la(n(t),i),e))),"DenseMatrix, Array":t.referToSelf((e=>(t,i)=>r(...la(t,n(i)),e)))},e.SS&&(s["SparseMatrix, SparseMatrix"]=t.referToSelf((t=>(n,r)=>e.SS(...la(n,r),t,!1)))),e.DS&&(s["DenseMatrix, SparseMatrix"]=t.referToSelf((t=>(n,r)=>e.DS(...la(n,r),t,!1))),s["Array, SparseMatrix"]=t.referToSelf((t=>(r,i)=>e.DS(...la(n(r),i),t,!1)))),a&&(s["SparseMatrix, DenseMatrix"]=t.referToSelf((e=>(t,n)=>a(...la(n,t),e,!0))),s["SparseMatrix, Array"]=t.referToSelf((e=>(t,r)=>a(...la(n(r),t),e,!0)))));const u=e.scalar||"any";(e.Ds||e.Ss)&&(o?(s["DenseMatrix,"+u]=(e,t)=>i(e,t,o,!1),s[u+", DenseMatrix"]=(e,t)=>i(t,e,o,!0),s["Array,"+u]=(e,t)=>i(n(e),t,o,!1).valueOf(),s[u+", Array"]=(e,t)=>i(n(t),e,o,!0).valueOf()):(s["DenseMatrix,"+u]=t.referToSelf((e=>(t,n)=>i(t,n,e,!1))),s[u+", DenseMatrix"]=t.referToSelf((e=>(t,n)=>i(n,t,e,!0))),s["Array,"+u]=t.referToSelf((e=>(t,r)=>i(n(t),r,e,!1).valueOf())),s[u+", Array"]=t.referToSelf((e=>(t,r)=>i(n(r),t,e,!0).valueOf()))));const c=void 0!==e.sS?e.sS:e.Ss;return o?(e.Ss&&(s["SparseMatrix,"+u]=(t,n)=>e.Ss(t,n,o,!1)),c&&(s[u+", SparseMatrix"]=(e,t)=>c(t,e,o,!0))):(e.Ss&&(s["SparseMatrix,"+u]=t.referToSelf((t=>(n,r)=>e.Ss(n,r,t,!1)))),c&&(s[u+", SparseMatrix"]=t.referToSelf((e=>(t,n)=>c(n,t,e,!0))))),o&&o.signatures&&se(s,o.signatures),s}})),pa=de("mod",["typed","config","round","matrix","equalScalar","zeros","DenseMatrix","concat"],(e=>{let{typed:t,config:n,round:r,matrix:i,equalScalar:o,zeros:a,DenseMatrix:s,concat:u}=e;const c=oa({typed:t,config:n,round:r,matrix:i,equalScalar:o,zeros:a,DenseMatrix:s}),l=aa({typed:t,equalScalar:o}),f=sa({typed:t}),p=ua({typed:t,equalScalar:o}),m=Ro({typed:t,equalScalar:o}),d=Po({typed:t,DenseMatrix:s});return t("mod",{"number, number":function(e,t){return 0===t?e:e-t*c(e/t)},"BigNumber, BigNumber":function(e,t){return t.isZero()?e:e.sub(t.mul(c(e.div(t))))},"bigint, bigint":function(e,t){if(0n===t)return e;if(e<0){const n=e%t;return 0n===n?n:n+t}return e%t},"Fraction, Fraction":function(e,t){return t.equals(0)?e:e.sub(t.mul(c(e.div(t))))}},fa({typed:t,matrix:i,concat:u})({SS:p,DS:f,SD:l,Ss:m,sS:d}))})),ma=de("matAlgo01xDSid",["typed"],(e=>{let{typed:t}=e;return function(e,n,r,i){const o=e._data,a=e._size,s=e._datatype||e.getDataType(),u=n._values,c=n._index,l=n._ptr,f=n._size,p=n._datatype||void 0===n._data?n._datatype:n.getDataType();if(a.length!==f.length)throw new xr(a.length,f.length);if(a[0]!==f[0]||a[1]!==f[1])throw new RangeError("Dimension mismatch. Matrix A ("+a+") must match Matrix B ("+f+")");if(!u)throw new Error("Cannot perform operation on Dense Matrix and Pattern Sparse Matrix");const m=a[0],d=a[1],h="string"==typeof s&&"mixed"!==s&&s===p?s:void 0,g=h?t.find(r,[h,h]):r;let y,x;const b=[];for(y=0;y<m;y++)b[y]=[];const w=[],v=[];for(x=0;x<d;x++){const e=x+1;for(let t=l[x],n=l[x+1],r=t;r<n;r++)y=c[r],w[y]=i?g(u[r],o[y][x]):g(o[y][x],u[r]),v[y]=e;for(y=0;y<m;y++)v[y]===e?b[y][x]=w[y]:b[y][x]=o[y][x]}return e.createDenseMatrix({data:b,size:[m,d],datatype:s===e._datatype&&p===n._datatype?h:void 0})}})),da=de("matAlgo04xSidSid",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i){const o=e._values,a=e._index,s=e._ptr,u=e._size,c=e._datatype||void 0===e._data?e._datatype:e.getDataType(),l=r._values,f=r._index,p=r._ptr,m=r._size,d=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(u.length!==m.length)throw new xr(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");const h=u[0],g=u[1];let y,x=n,b=0,w=i;"string"==typeof c&&c===d&&"mixed"!==c&&(y=c,x=t.find(n,[y,y]),b=t.convert(0,y),w=t.find(i,[y,y]));const v=o&&l?[]:void 0,N=[],A=[],E=o&&l?[]:void 0,S=o&&l?[]:void 0,M=[],C=[];let T,B,F,D,O;for(B=0;B<g;B++){A[B]=N.length;const e=B+1;for(D=s[B],O=s[B+1],F=D;F<O;F++)T=a[F],N.push(T),M[T]=e,E&&(E[T]=o[F]);for(D=p[B],O=p[B+1],F=D;F<O;F++)if(T=f[F],M[T]===e){if(E){const e=w(E[T],l[F]);x(e,b)?M[T]=null:E[T]=e}}else N.push(T),C[T]=e,S&&(S[T]=l[F]);if(E&&S)for(F=A[B];F<N.length;)T=N[F],M[T]===e?(v[F]=E[T],F++):C[T]===e?(v[F]=S[T],F++):N.splice(F,1)}return A[g]=N.length,e.createSparseMatrix({values:v,index:N,ptr:A,size:[h,g],datatype:c===e._datatype&&d===r._datatype?y:void 0})}})),ha=de("matAlgo10xSids",["typed","DenseMatrix"],(e=>{let{typed:t,DenseMatrix:n}=e;return function(e,r,i,o){const a=e._values,s=e._index,u=e._ptr,c=e._size,l=e._datatype;if(!a)throw new Error("Cannot perform operation on Pattern Sparse Matrix and Scalar value");const f=c[0],p=c[1];let m,d=i;"string"==typeof l&&(m=l,r=t.convert(r,m),d=t.find(i,[m,m]));const h=[],g=[],y=[];for(let e=0;e<p;e++){const t=e+1;for(let n=u[e],r=u[e+1],i=n;i<r;i++){const e=s[i];g[e]=a[i],y[e]=t}for(let n=0;n<f;n++)0===e&&(h[n]=[]),y[n]===t?h[n][e]=o?d(r,g[n]):d(g[n],r):h[n][e]=r}return new n({data:h,size:[f,p],datatype:m})}}));function ga(e,t,n,r){if(!(this instanceof ga))throw new SyntaxError("Constructor must be called with the new operator");this.fn=e,this.count=t,this.min=n,this.max=r,this.message="Wrong number of arguments in function "+e+" ("+t+" provided, "+n+(null!=r?"-"+r:"")+" expected)",this.stack=(new Error).stack}ga.prototype=new Error,ga.prototype.constructor=Error,ga.prototype.name="ArgumentsError",ga.prototype.isArgumentsError=!0;const ya="number | BigNumber | Fraction | Matrix | Array",xa=`${ya}, ${ya}, ...${ya}`;function ba(e){return!e.some((e=>Array.isArray(e)))}const wa=de("gcd",["typed","config","round","matrix","equalScalar","zeros","BigNumber","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,config:r,round:i,equalScalar:o,zeros:a,BigNumber:s,DenseMatrix:u,concat:c}=e;const l=pa({typed:t,config:r,round:i,matrix:n,equalScalar:o,zeros:a,DenseMatrix:u,concat:c}),f=ma({typed:t}),p=da({typed:t,equalScalar:o}),m=ha({typed:t,DenseMatrix:u});return t("gcd",{"number, number":function(e,t){if(!ye(e)||!ye(t))throw new Error("Parameters in function gcd must be integer numbers");let n;for(;0!==t;)n=l(e,t),e=t,t=n;return e<0?-e:e},"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function gcd must be integer numbers");const n=new s(0);for(;!t.isZero();){const n=l(e,t);e=t,t=n}return e.lt(n)?e.neg():e},"Fraction, Fraction":(e,t)=>e.gcd(t)},fa({typed:t,matrix:n,concat:c})({SS:p,DS:f,Ss:m}),{[xa]:t.referToSelf((e=>(t,n,r)=>{let i=e(t,n);for(let t=0;t<r.length;t++)i=e(i,r[t]);return i})),Array:t.referToSelf((e=>t=>{if(1===t.length&&Array.isArray(t[0])&&ba(t[0]))return e(...t[0]);if(ba(t))return e(...t);throw new ga("gcd() supports only 1d matrices!")})),Matrix:t.referToSelf((e=>t=>e(t.toArray())))})})),va=de("matAlgo06xS0S0",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i){const o=e._values,a=e._size,s=e._datatype||void 0===e._data?e._datatype:e.getDataType(),u=r._values,c=r._size,l=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(a.length!==c.length)throw new xr(a.length,c.length);if(a[0]!==c[0]||a[1]!==c[1])throw new RangeError("Dimension mismatch. Matrix A ("+a+") must match Matrix B ("+c+")");const f=a[0],p=a[1];let m,d=n,h=0,g=i;"string"==typeof s&&s===l&&"mixed"!==s&&(m=s,d=t.find(n,[m,m]),h=t.convert(0,m),g=t.find(i,[m,m]));const y=o&&u?[]:void 0,x=[],b=[],w=y?[]:void 0,v=[],N=[];for(let t=0;t<p;t++){b[t]=x.length;const n=t+1;if(li(e,t,v,w,N,n,x,g),li(r,t,v,w,N,n,x,g),w){let e=b[t];for(;e<x.length;){const t=x[e];if(N[t]===n){const n=w[t];d(n,h)?x.splice(e,1):(y.push(n),e++)}else x.splice(e,1)}}else{let e=b[t];for(;e<x.length;)N[x[e]]!==n?x.splice(e,1):e++}}return b[p]=x.length,e.createSparseMatrix({values:y,index:x,ptr:b,size:[f,p],datatype:s===e._datatype&&l===r._datatype?m:void 0})}})),Na=de("lcm",["typed","matrix","equalScalar","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,concat:i}=e;const o=aa({typed:t,equalScalar:r}),a=va({typed:t,equalScalar:r}),s=Ro({typed:t,equalScalar:r}),u=fa({typed:t,matrix:n,concat:i}),c="number | BigNumber | Fraction | Matrix | Array",l={};return l[`${c}, ${c}, ...${c}`]=t.referToSelf((e=>(t,n,r)=>{let i=e(t,n);for(let t=0;t<r.length;t++)i=e(i,r[t]);return i})),t("lcm",{"number, number":mo,"BigNumber, BigNumber":function(e,t){if(!e.isInt()||!t.isInt())throw new Error("Parameters in function lcm must be integer numbers");if(e.isZero())return e;if(t.isZero())return t;const n=e.times(t);for(;!t.isZero();){const n=t;t=e.mod(n),e=n}return n.div(e).abs()},"Fraction, Fraction":(e,t)=>e.lcm(t)},u({SS:a,DS:o,Ss:s}),l)}));function Aa(e,t,n,r){return function(i){if(i>0||n.predictable){if(i<=0)return NaN;const n=i.toString(16),r=n.substring(0,15);return e*(n.length-r.length)+t(Number("0x"+r))}return r(i.toNumber())}}const Ea="log10",Sa=["typed","config","Complex"],Ma=go(16),Ca=de(Ea,Sa,(e=>{let{typed:t,config:n,Complex:r}=e;function i(e){return e.log().div(Math.LN10)}function o(e){return i(new r(e,0))}return t(Ea,{number:function(e){return e>=0||n.predictable?go(e):o(e)},bigint:Aa(Ma,go,n,o),Complex:i,BigNumber:function(e){return!e.isNegative()||n.predictable?e.log():o(e.toNumber())},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Ta="log2",Ba=de(Ta,["typed","config","Complex"],(e=>{let{typed:t,config:n,Complex:r}=e;function i(e){return o(new r(e,0))}return t(Ta,{number:function(e){return e>=0||n.predictable?yo(e):i(e)},bigint:Aa(4,yo,n,i),Complex:o,BigNumber:function(e){return!e.isNegative()||n.predictable?e.log(2):i(e.toNumber())},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))});function o(e){const t=Math.sqrt(e.re*e.re+e.im*e.im);return new r(Math.log2?Math.log2(t):Math.log(t)/Math.LN2,Math.atan2(e.im,e.re)/Math.LN2)}})),Fa=de("multiplyScalar",["typed"],(e=>{let{typed:t}=e;return t("multiplyScalar",{"number, number":ao,"Complex, Complex":function(e,t){return e.mul(t)},"BigNumber, BigNumber":function(e,t){return e.times(t)},"bigint, bigint":function(e,t){return e*t},"Fraction, Fraction":function(e,t){return e.mul(t)},"number | Fraction | BigNumber | Complex, Unit":(e,t)=>t.multiply(e),"Unit, number | Fraction | BigNumber | Complex | Unit":(e,t)=>e.multiply(t)})})),Da="multiply",Oa=de(Da,["typed","matrix","addScalar","multiplyScalar","equalScalar","dot"],(e=>{let{typed:t,matrix:n,addScalar:r,multiplyScalar:i,equalScalar:o,dot:a}=e;const s=Ro({typed:t,equalScalar:o}),u=Uo({typed:t});function c(e,t){switch(e.length){case 1:switch(t.length){case 1:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vectors must have the same length");break;case 2:if(e[0]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Vector length ("+e[0]+") must match Matrix rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;case 2:switch(t.length){case 1:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix columns ("+e[1]+") must match Vector length ("+t[0]+")");break;case 2:if(e[1]!==t[0])throw new RangeError("Dimension mismatch in multiplication. Matrix A columns ("+e[1]+") must match Matrix B rows ("+t[0]+")");break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix B has "+t.length+" dimensions)")}break;default:throw new Error("Can only multiply a 1 or 2 dimensional matrix (Matrix A has "+e.length+" dimensions)")}}const l=t("_multiplyMatrixVector",{"DenseMatrix, any":function(e,n){const o=e._data,a=e._size,s=e._datatype||e.getDataType(),u=n._data,c=n._datatype||n.getDataType(),l=a[0],f=a[1];let p,m=r,d=i;s&&c&&s===c&&"string"==typeof s&&"mixed"!==s&&(p=s,m=t.find(r,[p,p]),d=t.find(i,[p,p]));const h=[];for(let e=0;e<l;e++){const t=o[e];let n=d(t[0],u[0]);for(let e=1;e<f;e++)n=m(n,d(t[e],u[e]));h[e]=n}return e.createDenseMatrix({data:h,size:[l],datatype:s===e._datatype&&c===n._datatype?p:void 0})},"SparseMatrix, any":function(e,n){const a=e._values,s=e._index,u=e._ptr,c=e._datatype||void 0===e._data?e._datatype:e.getDataType();if(!a)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");const l=n._data,f=n._datatype||n.getDataType(),p=e._size[0],m=n._size[0],d=[],h=[],g=[];let y,x=r,b=i,w=o,v=0;c&&f&&c===f&&"string"==typeof c&&"mixed"!==c&&(y=c,x=t.find(r,[y,y]),b=t.find(i,[y,y]),w=t.find(o,[y,y]),v=t.convert(0,y));const N=[],A=[];g[0]=0;for(let e=0;e<m;e++){const t=l[e];if(!w(t,v))for(let n=u[e],r=u[e+1],i=n;i<r;i++){const e=s[i];A[e]?N[e]=x(N[e],b(t,a[i])):(A[e]=!0,h.push(e),N[e]=b(t,a[i]))}}for(let e=h.length,t=0;t<e;t++){const e=h[t];d[t]=N[e]}return g[1]=h.length,e.createSparseMatrix({values:d,index:h,ptr:g,size:[p,1],datatype:c===e._datatype&&f===n._datatype?y:void 0})}}),f=t("_multiplyMatrixMatrix",{"DenseMatrix, DenseMatrix":function(e,n){const o=e._data,a=e._size,s=e._datatype||e.getDataType(),u=n._data,c=n._size,l=n._datatype||n.getDataType(),f=a[0],p=a[1],m=c[1];let d,h=r,g=i;s&&l&&s===l&&"string"==typeof s&&"mixed"!==s&&"mixed"!==s&&(d=s,h=t.find(r,[d,d]),g=t.find(i,[d,d]));const y=[];for(let e=0;e<f;e++){const t=o[e];y[e]=[];for(let n=0;n<m;n++){let r=g(t[0],u[0][n]);for(let e=1;e<p;e++)r=h(r,g(t[e],u[e][n]));y[e][n]=r}}return e.createDenseMatrix({data:y,size:[f,m],datatype:s===e._datatype&&l===n._datatype?d:void 0})},"DenseMatrix, SparseMatrix":function(e,n){const a=e._data,s=e._size,u=e._datatype||e.getDataType(),c=n._values,l=n._index,f=n._ptr,p=n._size,m=n._datatype||void 0===n._data?n._datatype:n.getDataType();if(!c)throw new Error("Cannot multiply Dense Matrix times Pattern only Matrix");const d=s[0],h=p[1];let g,y=r,x=i,b=o,w=0;u&&m&&u===m&&"string"==typeof u&&"mixed"!==u&&(g=u,y=t.find(r,[g,g]),x=t.find(i,[g,g]),b=t.find(o,[g,g]),w=t.convert(0,g));const v=[],N=[],A=[],E=n.createSparseMatrix({values:v,index:N,ptr:A,size:[d,h],datatype:u===e._datatype&&m===n._datatype?g:void 0});for(let e=0;e<h;e++){A[e]=N.length;const t=f[e],n=f[e+1];if(n>t){let e=0;for(let r=0;r<d;r++){const i=r+1;let o;for(let s=t;s<n;s++){const t=l[s];e!==i?(o=x(a[r][t],c[s]),e=i):o=y(o,x(a[r][t],c[s]))}e!==i||b(o,w)||(N.push(r),v.push(o))}}}return A[h]=N.length,E},"SparseMatrix, DenseMatrix":function(e,n){const a=e._values,s=e._index,u=e._ptr,c=e._datatype||void 0===e._data?e._datatype:e.getDataType();if(!a)throw new Error("Cannot multiply Pattern only Matrix times Dense Matrix");const l=n._data,f=n._datatype||n.getDataType(),p=e._size[0],m=n._size[0],d=n._size[1];let h,g=r,y=i,x=o,b=0;c&&f&&c===f&&"string"==typeof c&&"mixed"!==c&&(h=c,g=t.find(r,[h,h]),y=t.find(i,[h,h]),x=t.find(o,[h,h]),b=t.convert(0,h));const w=[],v=[],N=[],A=e.createSparseMatrix({values:w,index:v,ptr:N,size:[p,d],datatype:c===e._datatype&&f===n._datatype?h:void 0}),E=[],S=[];for(let e=0;e<d;e++){N[e]=v.length;const t=e+1;for(let n=0;n<m;n++){const r=l[n][e];if(!x(r,b))for(let e=u[n],i=u[n+1],o=e;o<i;o++){const e=s[o];S[e]!==t?(S[e]=t,v.push(e),E[e]=y(r,a[o])):E[e]=g(E[e],y(r,a[o]))}}for(let t=N[e],n=v.length,r=t;r<n;r++){const e=v[r];w[r]=E[e]}}return N[d]=v.length,A},"SparseMatrix, SparseMatrix":function(e,n){const o=e._values,a=e._index,s=e._ptr,u=e._datatype||void 0===e._data?e._datatype:e.getDataType(),c=n._values,l=n._index,f=n._ptr,p=n._datatype||void 0===n._data?n._datatype:n.getDataType(),m=e._size[0],d=n._size[1],h=o&&c;let g,y=r,x=i;u&&p&&u===p&&"string"==typeof u&&"mixed"!==u&&(g=u,y=t.find(r,[g,g]),x=t.find(i,[g,g]));const b=h?[]:void 0,w=[],v=[],N=e.createSparseMatrix({values:b,index:w,ptr:v,size:[m,d],datatype:u===e._datatype&&p===n._datatype?g:void 0}),A=h?[]:void 0,E=[];let S,M,C,T,B,F,D,O;for(let e=0;e<d;e++){v[e]=w.length;const t=e+1;for(B=f[e],F=f[e+1],T=B;T<F;T++)if(O=l[T],h)for(M=s[O],C=s[O+1],S=M;S<C;S++)D=a[S],E[D]!==t?(E[D]=t,w.push(D),A[D]=x(c[T],o[S])):A[D]=y(A[D],x(c[T],o[S]));else for(M=s[O],C=s[O+1],S=M;S<C;S++)D=a[S],E[D]!==t&&(E[D]=t,w.push(D));if(h)for(let t=v[e],n=w.length,r=t;r<n;r++){const e=w[r];b[r]=A[e]}}return v[d]=w.length,N}});return t(Da,i,{"Array, Array":t.referTo("Matrix, Matrix",(e=>(t,r)=>{c(wr(t),wr(r));const i=e(n(t),n(r));return A(i)?i.valueOf():i})),"Matrix, Matrix":function(e,n){const o=e.size(),s=n.size();return c(o,s),1===o.length?1===s.length?function(e,t,n){if(0===n)throw new Error("Cannot multiply two empty vectors");return a(e,t)}(e,n,o[0]):function(e,n){if("dense"!==n.storage())throw new Error("Support for SparseMatrix not implemented");return function(e,n){const o=e._data,a=e._size,s=e._datatype||e.getDataType(),u=n._data,c=n._size,l=n._datatype||n.getDataType(),f=a[0],p=c[1];let m,d=r,h=i;s&&l&&s===l&&"string"==typeof s&&"mixed"!==s&&(m=s,d=t.find(r,[m,m]),h=t.find(i,[m,m]));const g=[];for(let e=0;e<p;e++){let t=h(o[0],u[0][e]);for(let n=1;n<f;n++)t=d(t,h(o[n],u[n][e]));g[e]=t}return e.createDenseMatrix({data:g,size:[p],datatype:s===e._datatype&&l===n._datatype?m:void 0})}(e,n)}(e,n):1===s.length?l(e,n):f(e,n)},"Matrix, Array":t.referTo("Matrix,Matrix",(e=>(t,r)=>e(t,n(r)))),"Array, Matrix":t.referToSelf((e=>(t,r)=>e(n(t,r.storage()),r))),"SparseMatrix, any":function(e,t){return s(e,t,i,!1)},"DenseMatrix, any":function(e,t){return u(e,t,i,!1)},"any, SparseMatrix":function(e,t){return s(t,e,i,!0)},"any, DenseMatrix":function(e,t){return u(t,e,i,!0)},"Array, any":function(e,t){return u(n(e),t,i,!1).valueOf()},"any, Array":function(e,t){return u(n(t),e,i,!0).valueOf()},"any, any":i,"any, any, ...any":t.referToSelf((e=>(t,n,r)=>{let i=e(t,n);for(let t=0;t<r.length;t++)i=e(i,r[t]);return i}))})})),_a="nthRoot",za=de(_a,["typed","matrix","equalScalar","BigNumber","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,BigNumber:i,concat:o}=e;const a=ma({typed:t}),s=aa({typed:t,equalScalar:r}),u=va({typed:t,equalScalar:r}),c=Ro({typed:t,equalScalar:r}),l=fa({typed:t,matrix:n,concat:o});function f(){throw new Error("Complex number not supported in function nthRoot. Use nthRoots instead.")}return t(_a,{number:xo,"number, number":xo,BigNumber:e=>p(e,new i(2)),"BigNumber, BigNumber":p,Complex:f,"Complex, number":f,Array:t.referTo("DenseMatrix,number",(e=>t=>e(n(t),2).valueOf())),DenseMatrix:t.referTo("DenseMatrix,number",(e=>t=>e(t,2))),SparseMatrix:t.referTo("SparseMatrix,number",(e=>t=>e(t,2))),"SparseMatrix, SparseMatrix":t.referToSelf((e=>(t,n)=>{if(1===n.density())return u(t,n,e);throw new Error("Root must be non-zero")})),"DenseMatrix, SparseMatrix":t.referToSelf((e=>(t,n)=>{if(1===n.density())return a(t,n,e,!1);throw new Error("Root must be non-zero")})),"Array, SparseMatrix":t.referTo("DenseMatrix,SparseMatrix",(e=>(t,r)=>e(n(t),r))),"number | BigNumber, SparseMatrix":t.referToSelf((e=>(t,n)=>{if(1===n.density())return c(n,t,e,!0);throw new Error("Root must be non-zero")}))},l({scalar:"number | BigNumber",SD:s,Ss:c,sS:!1}));function p(e,t){const n=i.precision,r=i.clone({precision:n+2}),o=new i(0),a=new r(1),s=t.isNegative();if(s&&(t=t.neg()),t.isZero())throw new Error("Root must be non-zero");if(e.isNegative()&&!t.abs().mod(2).equals(1))throw new Error("Root must be odd when a is negative.");if(e.isZero())return s?new r(1/0):0;if(!e.isFinite())return s?o:e;let u=e.abs().pow(a.div(t));return u=e.isNeg()?u.neg():u,new i((s?a.div(u):u).toPrecision(n))}})),qa="sign",Ia=de(qa,["typed","BigNumber","Fraction","complex"],(e=>{let{typed:t,BigNumber:n,complex:r,Fraction:i}=e;return t(qa,{number:bo,Complex:function(e){return 0===e.im?r(bo(e.re)):e.sign()},BigNumber:function(e){return new n(e.cmp(0))},bigint:function(e){return e>0n?1n:e<0n?-1n:0n},Fraction:function(e){return 0n===e.n?new i(0):new i(e.s)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),Unit:t.referToSelf((e=>n=>{if(!n._isDerived()&&0!==n.units[0].unit.offset)throw new TypeError("sign is ambiguous for units with offset");return t.find(e,n.valueType())(n.value)}))})})),ka=de("sqrt",["config","typed","Complex"],(e=>{let{config:t,typed:n,Complex:r}=e;return n("sqrt",{number:i,Complex:function(e){return e.sqrt()},BigNumber:function(e){return!e.isNegative()||t.predictable?e.sqrt():i(e.toNumber())},Unit:function(e){return e.pow(.5)}});function i(e){return isNaN(e)?NaN:e>=0||t.predictable?Math.sqrt(e):new r(e,0).sqrt()}})),Ra="square",Pa=de(Ra,["typed"],(e=>{let{typed:t}=e;return t(Ra,{number:wo,Complex:function(e){return e.mul(e)},BigNumber:function(e){return e.times(e)},bigint:function(e){return e*e},Fraction:function(e){return e.mul(e)},Unit:function(e){return e.pow(2)}})})),Ua="subtract",ja=de(Ua,["typed","matrix","equalScalar","subtractScalar","unaryMinus","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,subtractScalar:i,unaryMinus:o,DenseMatrix:a,concat:s}=e;const u=ma({typed:t}),c=sa({typed:t}),l=ua({typed:t,equalScalar:r}),f=ha({typed:t,DenseMatrix:a}),p=Po({typed:t,DenseMatrix:a}),m=fa({typed:t,matrix:n,concat:s});return t(Ua,{"any, any":i},m({elop:i,SS:l,DS:u,SD:c,Ss:p,sS:f}))})),La="xgcd",$a=de(La,["typed","config","matrix","BigNumber"],(e=>{let{typed:t,config:n,matrix:r,BigNumber:i}=e;return t(La,{"number, number":function(e,t){const i=vo(e,t);return"Array"===n.matrix?i:r(i)},"BigNumber, BigNumber":function(e,t){let o,a,s;const u=new i(0),c=new i(1);let l,f=u,p=c,m=c,d=u;if(!e.isInt()||!t.isInt())throw new Error("Parameters in function xgcd must be integer numbers");for(;!t.isZero();)a=e.div(t).floor(),s=e.mod(t),o=f,f=p.minus(a.times(f)),p=o,o=m,m=d.minus(a.times(m)),d=o,e=t,t=s;return l=e.lt(u)?[e.neg(),p.neg(),d.neg()]:[e,e.isZero()?0:p,d],"Array"===n.matrix?l:r(l)}})})),Ha="invmod",Ga=de(Ha,["typed","config","BigNumber","xgcd","equal","smaller","mod","add","isInteger"],(e=>{let{typed:t,config:n,BigNumber:r,xgcd:i,equal:o,smaller:a,mod:s,add:u,isInteger:c}=e;return t(Ha,{"number, number":l,"BigNumber, BigNumber":l});function l(e,t){if(!c(e)||!c(t))throw new Error("Parameters in function invmod must be integer numbers");if(e=s(e,t),o(t,0))throw new Error("Divisor must be non zero");let n=i(e,t);n=n.valueOf();let[l,f]=n;return o(l,r(1))?(f=s(f,t),a(f,r(0))&&(f=u(f,t)),f):NaN}})),Za=de("matAlgo09xS0Sf",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i){const o=e._values,a=e._index,s=e._ptr,u=e._size,c=e._datatype||void 0===e._data?e._datatype:e.getDataType(),l=r._values,f=r._index,p=r._ptr,m=r._size,d=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(u.length!==m.length)throw new xr(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");const h=u[0],g=u[1];let y,x=n,b=0,w=i;"string"==typeof c&&c===d&&"mixed"!==c&&(y=c,x=t.find(n,[y,y]),b=t.convert(0,y),w=t.find(i,[y,y]));const v=o&&l?[]:void 0,N=[],A=[],E=v?[]:void 0,S=[];let M,C,T,B,F;for(C=0;C<g;C++){A[C]=N.length;const e=C+1;if(E)for(B=p[C],F=p[C+1],T=B;T<F;T++)M=f[T],S[M]=e,E[M]=l[T];for(B=s[C],F=s[C+1],T=B;T<F;T++)if(M=a[T],E){const t=S[M]===e?E[M]:b,n=w(o[T],t);x(n,b)||(N.push(M),v.push(n))}else N.push(M)}return A[g]=N.length,e.createSparseMatrix({values:v,index:N,ptr:A,size:[h,g],datatype:c===e._datatype&&d===r._datatype?y:void 0})}})),Va="dotMultiply",Wa=de(Va,["typed","matrix","equalScalar","multiplyScalar","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,multiplyScalar:i,concat:o}=e;const a=aa({typed:t,equalScalar:r}),s=Za({typed:t,equalScalar:r}),u=Ro({typed:t,equalScalar:r}),c=fa({typed:t,matrix:n,concat:o});return t(Va,c({elop:i,SS:s,DS:a,Ss:u}))}));function Ya(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitAnd");const n=e.constructor;if(e.isNaN()||t.isNaN())return new n(NaN);if(e.isZero()||t.eq(-1)||e.eq(t))return e;if(t.isZero()||e.eq(-1))return t;if(!e.isFinite()||!t.isFinite()){if(!e.isFinite()&&!t.isFinite())return e.isNegative()===t.isNegative()?e:new n(0);if(!e.isFinite())return t.isNegative()?e:e.isNegative()?new n(0):t;if(!t.isFinite())return e.isNegative()?t:t.isNegative()?new n(0):e}return Qa(e,t,(function(e,t){return e&t}))}function Ja(e){if(e.isFinite()&&!e.isInteger())throw new Error("Integer expected in function bitNot");const t=e.constructor,n=t.precision;t.config({precision:1e9});const r=e.plus(new t(1));return r.s=-r.s||null,t.config({precision:n}),r}function Xa(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitOr");const n=e.constructor;if(e.isNaN()||t.isNaN())return new n(NaN);const r=new n(-1);return e.isZero()||t.eq(r)||e.eq(t)?t:t.isZero()||e.eq(r)?e:e.isFinite()&&t.isFinite()?Qa(e,t,(function(e,t){return e|t})):!e.isFinite()&&!e.isNegative()&&t.isNegative()||e.isNegative()&&!t.isNegative()&&!t.isFinite()?r:e.isNegative()&&t.isNegative()?e.isFinite()?e:t:e.isFinite()?t:e}function Qa(e,t,n){const r=e.constructor;let i,o;const a=+(e.s<0),s=+(t.s<0);if(a){i=Ka(Ja(e));for(let e=0;e<i.length;++e)i[e]^=1}else i=Ka(e);if(s){o=Ka(Ja(t));for(let e=0;e<o.length;++e)o[e]^=1}else o=Ka(t);let u,c,l;i.length<=o.length?(u=i,c=o,l=a):(u=o,c=i,l=s);let f=u.length,p=c.length;const m=1^n(a,s);let d=new r(1^m),h=new r(1);const g=new r(2),y=r.precision;for(r.config({precision:1e9});f>0;)n(u[--f],c[--p])===m&&(d=d.plus(h)),h=h.times(g);for(;p>0;)n(l,c[--p])===m&&(d=d.plus(h)),h=h.times(g);return r.config({precision:y}),0===m&&(d.s=-d.s),d}function Ka(e){const t=e.d;let n=t[0]+"";for(let e=1;e<t.length;++e){let r=t[e]+"";for(let e=7-r.length;e--;)r="0"+r;n+=r}let r=n.length;for(;"0"===n.charAt(r);)r--;let i=e.e,o=n.slice(0,r+1||1);const a=o.length;if(i>0)if(++i>a)for(i-=a;i--;)o+="0";else i<a&&(o=o.slice(0,i)+"."+o.slice(i));const s=[0];for(let e=0;e<o.length;){let t=s.length;for(;t--;)s[t]*=10;s[0]+=parseInt(o.charAt(e++));for(let e=0;e<s.length;++e)s[e]>1&&(null!==s[e+1]&&void 0!==s[e+1]||(s[e+1]=0),s[e+1]+=s[e]>>1,s[e]&=1)}return s.reverse()}function es(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function bitXor");const n=e.constructor;if(e.isNaN()||t.isNaN())return new n(NaN);if(e.isZero())return t;if(t.isZero())return e;if(e.eq(t))return new n(0);const r=new n(-1);return e.eq(r)?Ja(t):t.eq(r)?Ja(e):e.isFinite()&&t.isFinite()?Qa(e,t,(function(e,t){return e^t})):e.isFinite()||t.isFinite()?new n(e.isNegative()===t.isNegative()?1/0:-1/0):r}function ts(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function leftShift");const n=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new n(NaN):e.isZero()||t.isZero()?e:e.isFinite()||t.isFinite()?t.lt(55)?e.times(Math.pow(2,t.toNumber())+""):e.times(new n(2).pow(t)):new n(NaN)}function ns(e,t){if(e.isFinite()&&!e.isInteger()||t.isFinite()&&!t.isInteger())throw new Error("Integers expected in function rightArithShift");const n=e.constructor;return e.isNaN()||t.isNaN()||t.isNegative()&&!t.isZero()?new n(NaN):e.isZero()||t.isZero()?e:t.isFinite()?t.lt(55)?e.div(Math.pow(2,t.toNumber())+"").floor():e.div(new n(2).pow(t)).floor():e.isNegative()?new n(-1):e.isFinite()?new n(0):new n(NaN)}const rs="number, number";function is(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function bitAnd");return e&t}function os(e){if(!ye(e))throw new Error("Integer expected in function bitNot");return~e}function as(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function bitOr");return e|t}function ss(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function bitXor");return e^t}function us(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function leftShift");return e<<t}function cs(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function rightArithShift");return e>>t}function ls(e,t){if(!ye(e)||!ye(t))throw new Error("Integers expected in function rightLogShift");return e>>>t}is.signature=rs,os.signature="number",as.signature=rs,ss.signature=rs,us.signature=rs,cs.signature=rs,ls.signature=rs;const fs="bitAnd",ps=de(fs,["typed","matrix","equalScalar","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,concat:i}=e;const o=aa({typed:t,equalScalar:r}),a=va({typed:t,equalScalar:r}),s=Ro({typed:t,equalScalar:r}),u=fa({typed:t,matrix:n,concat:i});return t(fs,{"number, number":is,"BigNumber, BigNumber":Ya,"bigint, bigint":(e,t)=>e&t},u({SS:a,DS:o,Ss:s}))})),ms="bitNot",ds=de(ms,["typed"],(e=>{let{typed:t}=e;return t(ms,{number:os,BigNumber:Ja,bigint:e=>~e,"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),hs="bitOr",gs=de(hs,["typed","matrix","equalScalar","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o}=e;const a=ma({typed:t}),s=da({typed:t,equalScalar:r}),u=ha({typed:t,DenseMatrix:i}),c=fa({typed:t,matrix:n,concat:o});return t(hs,{"number, number":as,"BigNumber, BigNumber":Xa,"bigint, bigint":(e,t)=>e|t},c({SS:s,DS:a,Ss:u}))})),ys=de("matAlgo07xSSf",["typed","SparseMatrix"],(e=>{let{typed:t,SparseMatrix:n}=e;return function(e,i,o){const a=e._size,s=e._datatype||void 0===e._data?e._datatype:e.getDataType(),u=i._size,c=i._datatype||void 0===i._data?i._datatype:i.getDataType();if(a.length!==u.length)throw new xr(a.length,u.length);if(a[0]!==u[0]||a[1]!==u[1])throw new RangeError("Dimension mismatch. Matrix A ("+a+") must match Matrix B ("+u+")");const l=a[0],f=a[1];let p,m=0,d=o;"string"==typeof s&&s===c&&"mixed"!==s&&(p=s,m=t.convert(0,p),d=t.find(o,[p,p]));const h=[],g=[],y=new Array(f+1).fill(0),x=[],b=[],w=[],v=[];for(let t=0;t<f;t++){const n=t+1;let o=0;r(e,t,w,x,n),r(i,t,v,b,n);for(let e=0;e<l;e++){const t=d(w[e]===n?x[e]:m,v[e]===n?b[e]:m);0!==t&&!1!==t&&(g.push(e),h.push(t),o++)}y[t+1]=y[t]+o}return new n({values:h,index:g,ptr:y,size:[l,f],datatype:s===e._datatype&&c===i._datatype?p:void 0})};function r(e,t,n,r,i){const o=e._values,a=e._index,s=e._ptr;for(let e=s[t],u=s[t+1];e<u;e++){const t=a[e];n[t]=i,r[t]=o[e]}}})),xs="bitXor",bs=de(xs,["typed","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,matrix:n,DenseMatrix:r,concat:i,SparseMatrix:o}=e;const a=sa({typed:t}),s=ys({typed:t,SparseMatrix:o}),u=Po({typed:t,DenseMatrix:r}),c=fa({typed:t,matrix:n,concat:i});return t(xs,{"number, number":ss,"BigNumber, BigNumber":es,"bigint, bigint":(e,t)=>e^t},c({SS:s,DS:a,Ss:u}))})),ws=de("arg",["typed"],(e=>{let{typed:t}=e;return t("arg",{number:function(e){return Math.atan2(0,e)},BigNumber:function(e){return e.constructor.atan2(0,e)},Complex:function(e){return e.arg()},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),vs="conj",Ns=de(vs,["typed"],(e=>{let{typed:t}=e;return t(vs,{"number | BigNumber | Fraction":e=>e,Complex:e=>e.conjugate(),Unit:t.referToSelf((e=>t=>new t.constructor(e(t.toNumeric()),t.formatUnits()))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),As=de("im",["typed"],(e=>{let{typed:t}=e;return t("im",{number:()=>0,"BigNumber | Fraction":e=>e.mul(0),Complex:e=>e.im,"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Es=de("re",["typed"],(e=>{let{typed:t}=e;return t("re",{"number | BigNumber | Fraction":e=>e,Complex:e=>e.re,"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Ss="number, number";function Ms(e){return!e}function Cs(e,t){return!(!e&&!t)}function Ts(e,t){return!!e!=!!t}function Bs(e,t){return!(!e||!t)}Ms.signature="number",Cs.signature=Ss,Ts.signature=Ss,Bs.signature=Ss;const Fs=de("not",["typed"],(e=>{let{typed:t}=e;return t("not",{"null | undefined":()=>!0,number:Ms,Complex:function(e){return 0===e.re&&0===e.im},BigNumber:function(e){return e.isZero()||e.isNaN()},bigint:e=>!e,Unit:t.referToSelf((e=>n=>t.find(e,n.valueType())(n.value))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Ds="nullish",Os=de(Ds,["typed","matrix","size","flatten","deepEqual"],(e=>{let{typed:t,matrix:n,size:r,flatten:i,deepEqual:o}=e;const a=sa({typed:t}),s=Uo({typed:t}),u=ca({typed:t});return t(Ds,{"number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any":(e,t)=>e,"null, any":(e,t)=>t,"undefined, any":(e,t)=>t,"SparseMatrix, Array | Matrix":(e,t)=>{const n=i(r(e).valueOf()),a=i(r(t).valueOf());if(o(n,a))return e;throw new xr(n,a)},"DenseMatrix, DenseMatrix":t.referToSelf((e=>(t,n)=>u(t,n,e))),"DenseMatrix, SparseMatrix":t.referToSelf((e=>(t,n)=>a(t,n,e,!1))),"DenseMatrix, Array":t.referToSelf((e=>(t,r)=>u(t,n(r),e))),"DenseMatrix, any":t.referToSelf((e=>(t,n)=>s(t,n,e,!1))),"Array, Array":t.referToSelf((e=>(t,r)=>u(n(t),n(r),e).valueOf())),"Array, DenseMatrix":t.referToSelf((e=>(t,r)=>u(n(t),r,e))),"Array, SparseMatrix":t.referToSelf((e=>(t,r)=>a(n(t),r,e,!1))),"Array, any":t.referToSelf((e=>(t,r)=>s(n(t),r,e,!1).valueOf()))})})),_s=de("or",["typed","matrix","equalScalar","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o}=e;const a=sa({typed:t}),s=ua({typed:t,equalScalar:r}),u=Po({typed:t,DenseMatrix:i}),c=fa({typed:t,matrix:n,concat:o});return t("or",{"number, number":Cs,"Complex, Complex":function(e,t){return 0!==e.re||0!==e.im||0!==t.re||0!==t.im},"BigNumber, BigNumber":function(e,t){return!e.isZero()&&!e.isNaN()||!t.isZero()&&!t.isNaN()},"bigint, bigint":Cs,"Unit, Unit":t.referToSelf((e=>(t,n)=>e(t.value||0,n.value||0)))},c({SS:s,DS:a,Ss:u}))})),zs=de("xor",["typed","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,matrix:n,DenseMatrix:r,concat:i,SparseMatrix:o}=e;const a=sa({typed:t}),s=ys({typed:t,SparseMatrix:o}),u=Po({typed:t,DenseMatrix:r}),c=fa({typed:t,matrix:n,concat:i});return t("xor",{"number, number":Ts,"Complex, Complex":function(e,t){return(0!==e.re||0!==e.im)!=(0!==t.re||0!==t.im)},"bigint, bigint":Ts,"BigNumber, BigNumber":function(e,t){return(!e.isZero()&&!e.isNaN())!=(!t.isZero()&&!t.isNaN())},"Unit, Unit":t.referToSelf((e=>(t,n)=>e(t.value||0,n.value||0)))},c({SS:s,DS:a,Ss:u}))})),qs="concat",Is=de(qs,["typed","matrix","isInteger"],(e=>{let{typed:t,matrix:n,isInteger:r}=e;return t(qs,{"...Array | Matrix | number | BigNumber":function(e){let t;const i=e.length;let o,a=-1,s=!1;const u=[];for(t=0;t<i;t++){const n=e[t];if(A(n)&&(s=!0),h(n)||g(n)){if(t!==i-1)throw new Error("Dimension must be specified as last argument");if(o=a,a=n.valueOf(),!r(a))throw new TypeError("Integer number expected for dimension");if(a<0||t>0&&a>o)throw new br(a,o+1)}else{const e=ae(n).valueOf(),r=wr(e);if(u[t]=e,o=a,a=r.length-1,t>0&&a!==o)throw new xr(o+1,a+1)}}if(0===u.length)throw new SyntaxError("At least one matrix expected");let c=u.shift();for(;u.length;)c=Gr(c,u.shift(),a);return s?n(c):c},"...string":function(e){return e.join("")}})})),ks="column",Rs=de(ks,["typed","Index","matrix","range"],(e=>{let{typed:t,Index:n,matrix:r,range:i}=e;return t(ks,{"Matrix, number":o,"Array, number":function(e,t){return o(r(ae(e)),t).valueOf()}});function o(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");Er(t,e.size()[1]);const o=i(0,e.size()[0]),a=new n(o,t),s=e.subset(a);return A(s)?s:r([[s]])}})),Ps="count",Us=de(Ps,["typed","size","prod"],(e=>{let{typed:t,size:n,prod:r}=e;return t(Ps,{string:function(e){return e.length},"Matrix | Array":function(e){return r(n(e))}})})),js="cross",Ls=de(js,["typed","matrix","subtract","multiply"],(e=>{let{typed:t,matrix:n,subtract:r,multiply:i}=e;return t(js,{"Matrix, Matrix":function(e,t){return n(o(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return n(o(e.toArray(),t))},"Array, Matrix":function(e,t){return n(o(e,t.toArray()))},"Array, Array":o});function o(e,t){const n=Math.max(wr(e).length,wr(t).length);e=Dr(e),t=Dr(t);const o=wr(e),a=wr(t);if(1!==o.length||1!==a.length||3!==o[0]||3!==a[0])throw new RangeError("Vectors with length 3 expected (Size A = ["+o.join(", ")+"], B = ["+a.join(", ")+"])");const s=[r(i(e[1],t[2]),i(e[2],t[1])),r(i(e[2],t[0]),i(e[0],t[2])),r(i(e[0],t[1]),i(e[1],t[0]))];return n>1?[s]:s}})),$s="diag",Hs=de($s,["typed","matrix","DenseMatrix","SparseMatrix"],(e=>{let{typed:t,matrix:n,DenseMatrix:r,SparseMatrix:i}=e;return t($s,{Array:function(e){return o(e,0,wr(e),null)},"Array, number":function(e,t){return o(e,t,wr(e),null)},"Array, BigNumber":function(e,t){return o(e,t.toNumber(),wr(e),null)},"Array, string":function(e,t){return o(e,0,wr(e),t)},"Array, number, string":function(e,t,n){return o(e,t,wr(e),n)},"Array, BigNumber, string":function(e,t,n){return o(e,t.toNumber(),wr(e),n)},Matrix:function(e){return o(e,0,e.size(),e.storage())},"Matrix, number":function(e,t){return o(e,t,e.size(),e.storage())},"Matrix, BigNumber":function(e,t){return o(e,t.toNumber(),e.size(),e.storage())},"Matrix, string":function(e,t){return o(e,0,e.size(),t)},"Matrix, number, string":function(e,t,n){return o(e,t,e.size(),n)},"Matrix, BigNumber, string":function(e,t,n){return o(e,t.toNumber(),e.size(),n)}});function o(e,t,o,a){if(!ye(t))throw new TypeError("Second parameter in function diag must be an integer");const s=t>0?t:0,u=t<0?-t:0;switch(o.length){case 1:return function(e,t,n,o,a,s){const u=[o+a,o+s];if(n&&"sparse"!==n&&"dense"!==n)throw new TypeError(`Unknown matrix type ${n}"`);const c="sparse"===n?i.diagonal(u,e,t):r.diagonal(u,e,t);return null!==n?c:c.valueOf()}(e,t,a,o[0],u,s);case 2:return function(e,t,r,i,o,a){if(A(e)){const i=e.diagonal(t);return null!==r?r!==i.storage()?n(i,r):i:i.valueOf()}const s=Math.min(i[0]-o,i[1]-a),u=[];for(let t=0;t<s;t++)u[t]=e[t+o][t+a];return null!==r?n(u):u}(e,t,a,o,u,s)}throw new RangeError("Matrix for function diag must be 2 dimensional")}})),Gs=de("filter",["typed"],(e=>{let{typed:t}=e;return t("filter",{"Array, function":Zs,"Matrix, function":function(e,t){return e.create(Zs(e.valueOf(),t),e.datatype())},"Array, RegExp":Pr,"Matrix, RegExp":function(e,t){return e.create(Pr(e.valueOf(),t),e.datatype())}})}));function Zs(e,t){const n=Qr(t,e,"filter");return n.isUnary?Rr(e,n.fn):Rr(e,(function(e,t,r){return n.fn(e,[t],r)}))}const Vs="flatten",Ws=de(Vs,["typed"],(e=>{let{typed:t}=e;return t(Vs,{Array:function(e){return qr(e)},Matrix:function(e){return e.create(qr(e.valueOf(),!0),e.datatype())}})})),Ys="forEach",Js=de(Ys,["typed"],(e=>{let{typed:t}=e;return t(Ys,{"Array, function":Xs,"Matrix, function":function(e,t){e.forEach(t)}})}));function Xs(e,t){const n=Qr(t,e,Ys);Xr(e,n.fn,n.isUnary)}const Qs="getMatrixDataType",Ks=de(Qs,["typed"],(e=>{let{typed:t}=e;return t(Qs,{Array:function(e){return $r(e,oe)},Matrix:function(e){return e.getDataType()}})})),eu="identity",tu=de(eu,["typed","config","matrix","BigNumber","DenseMatrix","SparseMatrix"],(e=>{let{typed:t,config:n,matrix:r,BigNumber:i,DenseMatrix:o,SparseMatrix:a}=e;return t(eu,{"":function(){return"Matrix"===n.matrix?r([]):[]},string:function(e){return r(e)},"number | BigNumber":function(e){return u(e,e,"Matrix"===n.matrix?"dense":void 0)},"number | BigNumber, string":function(e,t){return u(e,e,t)},"number | BigNumber, number | BigNumber":function(e,t){return u(e,t,"Matrix"===n.matrix?"dense":void 0)},"number | BigNumber, number | BigNumber, string":function(e,t,n){return u(e,t,n)},Array:function(e){return s(e)},"Array, string":function(e,t){return s(e,t)},Matrix:function(e){return s(e.valueOf(),e.storage())},"Matrix, string":function(e,t){return s(e.valueOf(),t)}});function s(e,t){switch(e.length){case 0:return t?r(t):[];case 1:return u(e[0],e[0],t);case 2:return u(e[0],e[1],t);default:throw new Error("Vector containing two values expected")}}function u(e,t,n){const r=g(e)||g(t)?i:null;if(g(e)&&(e=e.toNumber()),g(t)&&(t=t.toNumber()),!ye(e)||e<1)throw new Error("Parameters in function identity must be positive integers");if(!ye(t)||t<1)throw new Error("Parameters in function identity must be positive integers");const s=r?new i(1):1,u=r?new r(0):0,c=[e,t];if(n){if("sparse"===n)return a.diagonal(c,s,0,u);if("dense"===n)return o.diagonal(c,s,0,u);throw new TypeError(`Unknown matrix type "${n}"`)}const l=Mr([],c,u),f=e<t?e:t;for(let e=0;e<f;e++)l[e][e]=s;return l}})),nu="kron",ru=de(nu,["typed","matrix","multiplyScalar"],(e=>{let{typed:t,matrix:n,multiplyScalar:r}=e;return t(nu,{"Matrix, Matrix":function(e,t){return n(i(e.toArray(),t.toArray()))},"Matrix, Array":function(e,t){return n(i(e.toArray(),t))},"Array, Matrix":function(e,t){return n(i(e,t.toArray()))},"Array, Array":i});function i(e,t){if(1===wr(e).length&&(e=[e]),1===wr(t).length&&(t=[t]),wr(e).length>2||wr(t).length>2)throw new RangeError("Vectors with dimensions greater then 2 are not supported expected (Size x = "+JSON.stringify(e.length)+", y = "+JSON.stringify(t.length)+")");const n=[];let i=[];return e.map((function(e){return t.map((function(t){return i=[],n.push(i),e.map((function(e){return t.map((function(t){return i.push(r(e,t))}))}))}))}))&&n}})),iu="map",ou=de(iu,["typed"],(e=>{let{typed:t}=e;return t(iu,{"Array, function":r,"Matrix, function":function(e,t){return e.map(t)},"Array|Matrix, Array|Matrix, ...Array|Matrix|function":(e,i,o)=>function(e,i){if("function"!=typeof i)throw new Error("Last argument must be a callback function");const o=e[0].isMatrix,a=e.map((e=>e.isMatrix?e.size():wr(e))),s=Zr(...a),u=e.length,c=o?(e,t)=>e.get(t):Yr,l=e.map(((e,t)=>{const n=a[t].map((()=>0));return e.isMatrix?e.get(n):Yr(e,n)})),f=t.isTypedFunction(i)?function(e,n,r,i){return null!==t.resolve(e,[...n,r,...i])?2:null!==t.resolve(e,[...n,r])?1:(t.resolve(e,n),0)}(i,l,s.map((()=>0)),e):function(e,t){const n=e.toString();if(/arguments/.test(n))return 2;const r=n.match(/\(.*?\)/);return/\.\.\./.test(r)||e.length>t+1?2:e.length===t+1?1:0}(i,u);if(f<2){const t=n(f,i,null);return function(e,t){const n=e[0],r=e.map((e=>e.isMatrix?e.valueOf():e)),i=e.map((e=>e.isMatrix?e.size():wr(e))),o=Zr(...i),a=i.map((e=>o.length-e.length)),s=o.length-1,u=t.length>1?[]:null,c=function e(n){let r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0;const i=o[r],c=Array(i);if(r<s)for(let t=0;t<i;t++)u&&(u[r]=t),c[t]=e(n.map(((e,n)=>a[n]>r?e:1===e.length?e[0]:e[t])),r+1);else for(let e=0;e<i;e++)u&&(u[r]=e),c[e]=t(n.map((t=>1===t.length?t[0]:t[e])),u?u.slice():void 0);return c}(r,0);if(n.isMatrix){const e=n.create();return e._data=c,e._size=o,e}return c}(e,t)}const p=o?e.map((t=>t.isMatrix?t.create(Wr(t.toArray(),s),t.datatype()):e[0].create(Wr(t.valueOf(),s)))):e.map((e=>e.isMatrix?Wr(e.toArray(),s):Wr(e,s))),m=n(f,i,p),d=(e,t)=>m([e,...p.slice(1).map((e=>c(e,t)))],t);return o?p[0].map(d):r(p[0],d)}([e,i,...o.slice(0,o.length-1)],o[o.length-1])});function n(e,t,n){switch(e){case 0:return e=>t(...e);case 1:return(e,n)=>t(...e,n);case 2:return(e,r)=>t(...e,r,...n)}}function r(e,t){const n=Qr(t,e,iu);return Jr(e,n.fn,n.isUnary)}})),au="diff",su=de(au,["typed","matrix","subtract","number"],(e=>{let{typed:t,matrix:n,subtract:r,number:i}=e;return t(au,{"Array | Matrix":function(e){return A(e)?n(a(e.toArray())):a(e)},"Array | Matrix, number":function(e,t){if(!ye(t))throw new RangeError("Dimension must be a whole number");return A(e)?n(o(e.toArray(),t)):o(e,t)},"Array, BigNumber":t.referTo("Array,number",(e=>(t,n)=>e(t,i(n)))),"Matrix, BigNumber":t.referTo("Matrix,number",(e=>(t,n)=>e(t,i(n))))});function o(e,t){if(A(e)&&(e=e.toArray()),!Array.isArray(e))throw RangeError("Array/Matrix does not have that many dimensions");if(t>0){const n=[];return e.forEach((e=>{n.push(o(e,t-1))})),n}if(0===t)return a(e);throw RangeError("Cannot have negative dimension")}function a(e){const t=[],n=e.length;for(let r=1;r<n;r++)t.push(s(e[r-1],e[r]));return t}function s(e,t){A(e)&&(e=e.toArray()),A(t)&&(t=t.toArray());const n=Array.isArray(e),i=Array.isArray(t);if(n&&i)return function(e,t){if(e.length!==t.length)throw RangeError("Not all sub-arrays have the same length");const n=[],r=e.length;for(let i=0;i<r;i++)n.push(s(e[i],t[i]));return n}(e,t);if(!n&&!i)return r(t,e);throw TypeError("Cannot calculate difference between 1 array and 1 non-array")}})),uu=de("ones",["typed","config","matrix","BigNumber"],(e=>{let{typed:t,config:n,matrix:r,BigNumber:i}=e;return t("ones",{"":function(){return"Array"===n.matrix?o([]):o([],"default")},"...number | BigNumber | string":function(e){if("string"==typeof e[e.length-1]){const t=e.pop();return o(e,t)}return"Array"===n.matrix?o(e):o(e,"default")},Array:o,Matrix:function(e){const t=e.storage();return o(e.valueOf(),t)},"Array | Matrix, string":function(e,t){return o(e.valueOf(),t)}});function o(e,t){const n=function(e){let t=!1;return e.forEach((function(e,n,r){g(e)&&(t=!0,r[n]=e.toNumber())})),t}(e),o=n?new i(1):1;if(function(e){e.forEach((function(e){if("number"!=typeof e||!ye(e)||e<0)throw new Error("Parameters in function ones must be positive integers")}))}(e),t){const n=r(t);return e.length>0?n.resize(e,o):n}{const t=[];return e.length>0?Mr(t,e,o):t}}}));function cu(){throw new Error('No "bignumber" implementation available')}function lu(){throw new Error('No "fraction" implementation available')}function fu(){throw new Error('No "matrix" implementation available')}const pu="range",mu=de(pu,["typed","config","?matrix","?bignumber","equal","smaller","smallerEq","larger","largerEq","add","isZero","isPositive"],(e=>{let{typed:t,config:n,matrix:r,bignumber:i,smaller:o,smallerEq:a,larger:s,largerEq:u,add:c,isZero:l,isPositive:f}=e;return t(pu,{string:m,"string, boolean":m,number:function(e){throw new TypeError(`Too few arguments to function range(): ${e}`)},boolean:function(e){throw new TypeError(`Unexpected type of argument 1 to function range(): ${e}, number|bigint|BigNumber|Fraction`)},"number, number":function(e,t){return p(d(e,t,1,!1))},"number, number, number":function(e,t,n){return p(d(e,t,n,!1))},"number, number, boolean":function(e,t,n){return p(d(e,t,1,n))},"number, number, number, boolean":function(e,t,n,r){return p(d(e,t,n,r))},"bigint, bigint|number":function(e,t){return p(d(e,t,1n,!1))},"number, bigint":function(e,t){return p(d(BigInt(e),t,1n,!1))},"bigint, bigint|number, bigint|number":function(e,t,n){return p(d(e,t,BigInt(n),!1))},"number, bigint, bigint|number":function(e,t,n){return p(d(BigInt(e),t,BigInt(n),!1))},"bigint, bigint|number, boolean":function(e,t,n){return p(d(e,t,1n,n))},"number, bigint, boolean":function(e,t,n){return p(d(BigInt(e),t,1n,n))},"bigint, bigint|number, bigint|number, boolean":function(e,t,n,r){return p(d(e,t,BigInt(n),r))},"number, bigint, bigint|number, boolean":function(e,t,n,r){return p(d(BigInt(e),t,BigInt(n),r))},"BigNumber, BigNumber":function(e,t){return p(d(e,t,new(0,e.constructor)(1),!1))},"BigNumber, BigNumber, BigNumber":function(e,t,n){return p(d(e,t,n,!1))},"BigNumber, BigNumber, boolean":function(e,t,n){return p(d(e,t,new(0,e.constructor)(1),n))},"BigNumber, BigNumber, BigNumber, boolean":function(e,t,n,r){return p(d(e,t,n,r))},"Fraction, Fraction":function(e,t){return p(d(e,t,1,!1))},"Fraction, Fraction, Fraction":function(e,t,n){return p(d(e,t,n,!1))},"Fraction, Fraction, boolean":function(e,t,n){return p(d(e,t,1,n))},"Fraction, Fraction, Fraction, boolean":function(e,t,n,r){return p(d(e,t,n,r))},"Unit, Unit, Unit":function(e,t,n){return p(d(e,t,n,!1))},"Unit, Unit, Unit, boolean":function(e,t,n,r){return p(d(e,t,n,r))}});function p(e){return"Matrix"===n.matrix?r?r(e):fu():e}function m(e,t){const r=function(e){const t=e.split(":").map((function(e){return Number(e)}));if(t.some((function(e){return isNaN(e)})))return null;switch(t.length){case 2:return{start:t[0],end:t[1],step:1};case 3:return{start:t[0],end:t[2],step:t[1]};default:return null}}(e);if(!r)throw new SyntaxError('String "'+e+'" is no valid range');return"BigNumber"===n.number?(void 0===i&&cu(),p(d(i(r.start),i(r.end),i(r.step)))):p(d(r.start,r.end,r.step,t))}function d(e,t,n,r){const i=[];if(l(n))throw new Error("Step must be non-zero");const p=f(n)?r?a:o:r?u:s;let m=e;for(;p(m,t);)i.push(m),m=c(m,n);return i}})),du="reshape",hu=de(du,["typed","isInteger","matrix"],(e=>{let{typed:t,isInteger:n}=e;return t(du,{"Matrix, Array":function(e,t){return e.reshape(t,!0)},"Array, Array":function(e,t){return t.forEach((function(e){if(!n(e))throw new TypeError("Invalid size for dimension: "+e)})),Tr(e,t)}})})),gu=de("resize",["config","matrix"],(e=>{let{config:t,matrix:n}=e;return function(e,r,i){if(2!==arguments.length&&3!==arguments.length)throw new ga("resize",arguments.length,2,3);if(A(r)&&(r=r.valueOf()),g(r[0])&&(r=r.map((function(e){return g(e)?e.toNumber():e}))),A(e))return e.resize(r,i,!0);if("string"==typeof e)return function(e,t,n){if(void 0!==n){if("string"!=typeof n||1!==n.length)throw new TypeError("Single character expected as defaultValue")}else n=" ";if(1!==t.length)throw new xr(t.length,1);const r=t[0];if("number"!=typeof r||!ye(r))throw new TypeError("Invalid size, must contain positive integers (size: "+pr(t)+")");if(e.length>r)return e.substring(0,r);if(e.length<r){let t=e;for(let i=0,o=r-e.length;i<o;i++)t+=n;return t}return e}(e,r,i);const o=!Array.isArray(e)&&"Array"!==t.matrix;if(0===r.length){for(;Array.isArray(e);)e=e[0];return ae(e)}{Array.isArray(e)||(e=[e]);const t=Mr(e=ae(e),r,i);return o?n(t):t}}})),yu="rotate",xu=de(yu,["typed","multiply","rotationMatrix"],(e=>{let{typed:t,multiply:n,rotationMatrix:r}=e;return t(yu,{"Array , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),n(r(t),e).toArray()},"Matrix , number | BigNumber | Complex | Unit":function(e,t){return i(e,2),n(r(t),e)},"Array, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,o){return i(e,3),n(r(t,o),e)},"Matrix, number | BigNumber | Complex | Unit, Array | Matrix":function(e,t,o){return i(e,3),n(r(t,o),e)}});function i(e,t){const n=Array.isArray(e)?wr(e):e.size();if(n.length>2)throw new RangeError(`Vector must be of dimensions 1x${t}`);if(2===n.length&&1!==n[1])throw new RangeError(`Vector must be of dimensions 1x${t}`);if(n[0]!==t)throw new RangeError(`Vector must be of dimensions 1x${t}`)}})),bu="rotationMatrix",wu=de(bu,["typed","config","multiplyScalar","addScalar","unaryMinus","norm","matrix","BigNumber","DenseMatrix","SparseMatrix","cos","sin"],(e=>{let{typed:t,config:n,multiplyScalar:r,addScalar:i,unaryMinus:o,norm:a,BigNumber:s,matrix:u,DenseMatrix:c,SparseMatrix:l,cos:f,sin:p}=e;return t(bu,{"":function(){return"Matrix"===n.matrix?u([]):[]},string:function(e){return u(e)},"number | BigNumber | Complex | Unit":function(e){return m(e,"Matrix"===n.matrix?"dense":void 0)},"number | BigNumber | Complex | Unit, string":function(e,t){return m(e,t)},"number | BigNumber | Complex | Unit, Array":function(e,t){const n=u(t);return d(n),x(e,n,void 0)},"number | BigNumber | Complex | Unit, Matrix":function(e,t){d(t);const r=t.storage()||("Matrix"===n.matrix?"dense":void 0);return x(e,t,r)},"number | BigNumber | Complex | Unit, Array, string":function(e,t,n){const r=u(t);return d(r),x(e,r,n)},"number | BigNumber | Complex | Unit, Matrix, string":function(e,t,n){return d(t),x(e,t,n)}});function m(e,t){const n=g(e)?new s(-1):-1,i=f(e),o=p(e);return y([[i,r(n,o)],[o,i]],t)}function d(e){const t=e.size();if(t.length<1||3!==t[0])throw new RangeError("Vector must be of dimensions 1x3")}function h(e){return e.reduce(((e,t)=>r(e,t)))}function y(e,t){if(t){if("sparse"===t)return new l(e);if("dense"===t)return new c(e);throw new TypeError(`Unknown matrix type "${t}"`)}return e}function x(e,t,n){const r=a(t);if(0===r)throw new RangeError("Rotation around zero vector");const u=g(e)?s:null,c=u?new u(1):1,l=u?new u(-1):-1,m=u?new u(t.get([0])/r):t.get([0])/r,d=u?new u(t.get([1])/r):t.get([1])/r,x=u?new u(t.get([2])/r):t.get([2])/r,b=f(e),w=i(c,o(b)),v=p(e);return y([[i(b,h([m,m,w])),i(h([m,d,w]),h([l,x,v])),i(h([m,x,w]),h([d,v]))],[i(h([m,d,w]),h([x,v])),i(b,h([d,d,w])),i(h([d,x,w]),h([l,m,v]))],[i(h([m,x,w]),h([l,d,v])),i(h([d,x,w]),h([m,v])),i(b,h([x,x,w]))]],n)}})),vu=de("row",["typed","Index","matrix","range"],(e=>{let{typed:t,Index:n,matrix:r,range:i}=e;return t("row",{"Matrix, number":o,"Array, number":function(e,t){return o(r(ae(e)),t).valueOf()}});function o(e,t){if(2!==e.size().length)throw new Error("Only two dimensional matrix is supported");Er(t,e.size()[0]);const o=i(0,e.size()[1]),a=new n(t,o),s=e.subset(a);return A(s)?s:r([[s]])}})),Nu="size",Au=de(Nu,["typed","config","?matrix"],(e=>{let{typed:t,config:n,matrix:r}=e;return t(Nu,{Matrix:function(e){return e.create(e.size(),"number")},Array:wr,string:function(e){return"Array"===n.matrix?[e.length]:r([e.length],"dense","number")},"number | Complex | BigNumber | Unit | boolean | null":function(e){return"Array"===n.matrix?[]:r?r([],"dense","number"):fu()}})})),Eu="squeeze",Su=de(Eu,["typed"],(e=>{let{typed:t}=e;return t(Eu,{Array:function(e){return Dr(ae(e))},Matrix:function(e){const t=Dr(e.toArray());return Array.isArray(t)?e.create(t,e.datatype()):t},any:function(e){return ae(e)}})})),Mu="subset",Cu=de(Mu,["typed","matrix","zeros","add"],(e=>{let{typed:t,matrix:n,zeros:r,add:i}=e;return t(Mu,{"Matrix, Index":function(e,t){return Sr(t)?n():(Ar(e,t),e.subset(t))},"Array, Index":t.referTo("Matrix, Index",(function(e){return function(t,r){const i=e(n(t),r);return r.isScalar()?i:i.valueOf()}})),"Object, Index":Fu,"string, Index":Tu,"Matrix, Index, any, any":function(e,t,n,o){return Sr(t)?e:(Ar(e,t),e.clone().subset(t,function(e,t){if("string"==typeof e)throw new Error("can't boradcast a string");if(t._isScalar)return e;const n=t.size();if(!n.every((e=>e>0)))return e;try{return i(e,r(n))}catch(t){return e}}(n,t),o))},"Array, Index, any, any":t.referTo("Matrix, Index, any, any",(function(e){return function(t,r,i,o){const a=e(n(t),r,i,o);return a.isMatrix?a.valueOf():a}})),"Array, Index, any":t.referTo("Matrix, Index, any, any",(function(e){return function(t,r,i){return e(n(t),r,i,void 0).valueOf()}})),"Matrix, Index, any":t.referTo("Matrix, Index, any, any",(function(e){return function(t,n,r){return e(t,n,r,void 0)}})),"string, Index, string":Bu,"string, Index, string, string":Bu,"Object, Index, any":Du})}));function Tu(e,t){if(!T(t))throw new TypeError("Index expected");if(Sr(t))return"";if(Ar(Array.from(e),t),1!==t.size().length)throw new xr(t.size().length,1);const n=e.length;Er(t.min()[0],n),Er(t.max()[0],n);const r=t.dimension(0);let i="";return r.forEach((function(t){i+=e.charAt(t)})),i}function Bu(e,t,n,r){if(!t||!0!==t.isIndex)throw new TypeError("Index expected");if(Sr(t))return e;if(Ar(Array.from(e),t),1!==t.size().length)throw new xr(t.size().length,1);if(void 0!==r){if("string"!=typeof r||1!==r.length)throw new TypeError("Single character expected as defaultValue")}else r=" ";const i=t.dimension(0);if(i.size()[0]!==n.length)throw new xr(i.size()[0],n.length);const o=e.length;Er(t.min()[0]),Er(t.max()[0]);const a=[];for(let t=0;t<o;t++)a[t]=e.charAt(t);if(i.forEach((function(e,t){a[e]=n.charAt(t[0])})),a.length>o)for(let e=o-1,t=a.length;e<t;e++)a[e]||(a[e]=r);return a.join("")}function Fu(e,t){if(Sr(t))return;if(1!==t.size().length)throw new xr(t.size(),1);const n=t.dimension(0);if("string"!=typeof n)throw new TypeError("String expected as index to retrieve an object property");return i(e,n)}function Du(e,t,n){if(Sr(t))return e;if(1!==t.size().length)throw new xr(t.size(),1);const r=t.dimension(0);if("string"!=typeof r)throw new TypeError("String expected as index to retrieve an object property");const i=ae(e);return o(i,r,n),i}const Ou="transpose",_u=de(Ou,["typed","matrix"],(e=>{let{typed:t,matrix:n}=e;return t(Ou,{Array:e=>r(n(e)).valueOf(),Matrix:r,any:ae});function r(e){const t=e.size();let n;switch(t.length){case 1:n=e.clone();break;case 2:{const r=t[0],i=t[1];if(0===i)throw new RangeError("Cannot transpose a 2D matrix with no columns (size: "+pr(t)+")");switch(e.storage()){case"dense":n=function(e,t,n){const r=e._data,i=[];let o;for(let e=0;e<n;e++){o=i[e]=[];for(let n=0;n<t;n++)o[n]=ae(r[n][e])}return e.createDenseMatrix({data:i,size:[n,t],datatype:e._datatype})}(e,r,i);break;case"sparse":n=function(e,t,n){const r=e._values,i=e._index,o=e._ptr,a=r?[]:void 0,s=[],u=[],c=[];for(let e=0;e<t;e++)c[e]=0;let l,f,p;for(l=0,f=i.length;l<f;l++)c[i[l]]++;let m=0;for(let e=0;e<t;e++)u.push(m),m+=c[e],c[e]=u[e];for(u.push(m),p=0;p<n;p++)for(let e=o[p],t=o[p+1],n=e;n<t;n++){const e=c[i[n]]++;s[e]=p,r&&(a[e]=ae(r[n]))}return e.createSparseMatrix({values:a,index:s,ptr:u,size:[n,t],datatype:e._datatype})}(e,r,i)}}break;default:throw new RangeError("Matrix must be a vector or two dimensional (size: "+pr(t)+")")}return n}})),zu="ctranspose",qu=de(zu,["typed","transpose","conj"],(e=>{let{typed:t,transpose:n,conj:r}=e;return t(zu,{any:function(e){return r(n(e))}})})),Iu="zeros",ku=de(Iu,["typed","config","matrix","BigNumber"],(e=>{let{typed:t,config:n,matrix:r,BigNumber:i}=e;return t(Iu,{"":function(){return"Array"===n.matrix?o([]):o([],"default")},"...number | BigNumber | string":function(e){if("string"==typeof e[e.length-1]){const t=e.pop();return o(e,t)}return"Array"===n.matrix?o(e):o(e,"default")},Array:o,Matrix:function(e){const t=e.storage();return o(e.valueOf(),t)},"Array | Matrix, string":function(e,t){return o(e.valueOf(),t)}});function o(e,t){const n=function(e){let t=!1;return e.forEach((function(e,n,r){g(e)&&(t=!0,r[n]=e.toNumber())})),t}(e),o=n?new i(0):0;if(function(e){e.forEach((function(e){if("number"!=typeof e||!ye(e)||e<0)throw new Error("Parameters in function zeros must be positive integers")}))}(e),t){const n=r(t);return e.length>0?n.resize(e,o):n}{const t=[];return e.length>0?Mr(t,e,o):t}}})),Ru=de("fft",["typed","matrix","addScalar","multiplyScalar","divideScalar","exp","tau","i","dotDivide","conj","pow","ceil","log2"],(e=>{let{typed:t,matrix:n,addScalar:r,multiplyScalar:i,divideScalar:o,exp:a,tau:s,i:u,dotDivide:c,conj:l,pow:f,ceil:p,log2:m}=e;return t("fft",{Array:d,Matrix:function(e){return e.create(d(e.valueOf()),e.datatype())}});function d(e){const t=wr(e);return 1===t.length?g(e,t[0]):h(e.map((e=>d(e,t.slice(1)))),0)}function h(e,t){const n=wr(e);if(0!==t)return new Array(n[0]).fill(0).map(((n,r)=>h(e[r],t-1)));if(1===n.length)return g(e);function r(e){const t=wr(e);return new Array(t[1]).fill(0).map(((n,r)=>new Array(t[0]).fill(0).map(((t,n)=>e[n][r]))))}return r(h(r(e),1))}function g(e){const t=e.length;if(1===t)return[e[0]];if(t%2==0){const n=[...g(e.filter(((e,t)=>t%2==0))),...g(e.filter(((e,t)=>t%2==1)))];for(let e=0;e<t/2;e++){const c=n[e],l=i(n[e+t/2],a(i(i(s,u),o(-e,t))));n[e]=r(c,l),n[e+t/2]=r(c,i(-1,l))}return n}return function(e){const t=e.length,n=a(o(i(-1,i(u,s)),t)),r=[];for(let e=1-t;e<t;e++)r.push(f(n,o(f(e,2),2)));const h=f(2,p(m(t+t-1))),y=[...new Array(t).fill(0).map(((n,o)=>i(e[o],r[t-1+o]))),...new Array(h-t).fill(0)],x=[...new Array(t+t-1).fill(0).map(((e,t)=>o(1,r[t]))),...new Array(h-(t+t-1)).fill(0)],b=g(y),w=g(x),v=new Array(h).fill(0).map(((e,t)=>i(b[t],w[t]))),N=c(l(d(l(v))),h),A=[];for(let e=t-1;e<t+t-1;e++)A.push(i(N[e],r[e]));return A}(e)}})),Pu="ifft",Uu=de(Pu,["typed","fft","dotDivide","conj"],(e=>{let{typed:t,fft:n,dotDivide:r,conj:i}=e;return t(Pu,{"Array | Matrix":function(e){const t=A(e)?e.size():wr(e);return r(i(n(i(e))),t.reduce(((e,t)=>e*t),1))}})})),ju=de("solveODE",["typed","add","subtract","multiply","divide","max","map","abs","isPositive","isNegative","larger","smaller","matrix","bignumber","unaryMinus"],(e=>{let{typed:t,add:n,subtract:r,multiply:i,divide:o,max:a,map:s,abs:u,isPositive:c,isNegative:l,larger:f,smaller:p,matrix:m,bignumber:d,unaryMinus:y}=e;function x(e){return function(t,m,h,x){if(2!==m.length||!m.every(A)&&!m.every(w))throw new Error('"tspan" must be an Array of two numeric values or two units [tStart, tEnd]');const b=m[0],v=m[1],N=f(v,b),E=x.firstStep;if(void 0!==E&&!c(E))throw new Error('"firstStep" must be positive');const S=x.maxStep;if(void 0!==S&&!c(S))throw new Error('"maxStep" must be positive');const M=x.minStep;if(M&&l(M))throw new Error('"minStep" must be positive or zero');const C=[b,v,E,M,S].filter((e=>void 0!==e));if(!C.every(A)&&!C.every(w))throw new Error('Inconsistent type of "t" dependant variables');const T=x.tol?x.tol:1e-4,B=x.minDelta?x.minDelta:.2,F=x.maxDelta?x.maxDelta:5,D=x.maxIter?x.maxIter:1e4,O=[b,v,...h,S,M].some(g),[_,z,q,I]=O?[d(e.a),d(e.c),d(e.b),d(e.bp)]:[e.a,e.c,e.b,e.bp];let k=E?N?E:y(E):o(r(v,b),1);const R=[b],P=[h],U=r(q,I);let j=0,L=0;const $=function(e){return e?p:f}(N),H=function(e){const t=e?f:p;return function(e,i,o){const a=n(e,o);return t(a,i)?r(i,e):o}}(N);for(;$(R[j],v);){const e=[];k=H(R[j],v,k),e.push(t(R[j],P[j]));for(let r=1;r<z.length;++r)e.push(t(n(R[j],i(z[r],k)),n(P[j],i(k,_[r],e))));const r=a(u(s(i(U,e),(e=>w(e)?e.value:e))));r<T&&T/r>1/4&&(R.push(n(R[j],k)),P.push(n(P[j],i(k,q,e))),j++);let o=.84*(T/r)**.2;if(p(o,B)?o=B:f(o,F)&&(o=F),o=O?d(o):o,k=i(k,o),S&&f(u(k),S)?k=N?S:y(S):M&&p(u(k),M)&&(k=N?M:y(M)),L++,L>D)throw new Error("Maximum number of iterations reached, try changing options")}return{t:R,y:P}}}function b(e,t,n,r){return x({a:[[],[.5],[0,3/4],[2/9,1/3,4/9]],c:[null,.5,3/4,1],b:[2/9,1/3,4/9,0],bp:[7/24,1/4,1/3,1/8]})(e,t,n,r)}function v(e,t,n,r){return x({a:[[],[.2],[3/40,9/40],[44/45,-56/15,32/9],[19372/6561,-25360/2187,64448/6561,-212/729],[9017/3168,-355/33,46732/5247,49/176,-5103/18656],[35/384,0,500/1113,125/192,-2187/6784,11/84]],c:[null,.2,.3,.8,8/9,1,1],b:[35/384,0,500/1113,125/192,-2187/6784,11/84,0],bp:[5179/57600,0,7571/16695,393/640,-92097/339200,187/2100,1/40]})(e,t,n,r)}function N(e,t,n,r){const i=r.method?r.method:"RK45",o={RK23:b,RK45:v};if(i.toUpperCase()in o){const a={...r};return delete a.method,o[i.toUpperCase()](e,t,n,a)}{const e=Object.keys(o).map((e=>`"${e}"`)),t=`${e.slice(0,-1).join(", ")} and ${e.slice(-1)}`;throw new Error(`Unavailable method "${i}". Available methods are ${t}`)}}function A(e){return g(e)||h(e)}function E(e,t,n,r){const i=N(e,t.toArray(),n.toArray(),r);return{t:m(i.t),y:m(i.y)}}return t("solveODE",{"function, Array, Array, Object":N,"function, Matrix, Matrix, Object":E,"function, Array, Array":(e,t,n)=>N(e,t,n,{}),"function, Matrix, Matrix":(e,t,n)=>E(e,t,n,{}),"function, Array, number | BigNumber | Unit":(e,t,n)=>{const r=N(e,t,[n],{});return{t:r.t,y:r.y.map((e=>e[0]))}},"function, Matrix, number | BigNumber | Unit":(e,t,n)=>{const r=N(e,t.toArray(),[n],{});return{t:m(r.t),y:m(r.y.map((e=>e[0])))}},"function, Array, number | BigNumber | Unit, Object":(e,t,n,r)=>{const i=N(e,t,[n],r);return{t:i.t,y:i.y.map((e=>e[0]))}},"function, Matrix, number | BigNumber | Unit, Object":(e,t,n,r)=>{const i=N(e,t.toArray(),[n],r);return{t:m(i.t),y:m(i.y.map((e=>e[0])))}}})})),Lu=de("erf",["typed"],(e=>{let{typed:t}=e;return t("name",{number:function(e){const t=Math.abs(e);return t>=Vu?be(e):t<=$u?be(e)*function(e){const t=e*e;let n,r=Gu[0][4]*t,i=t;for(n=0;n<3;n+=1)r=(r+Gu[0][n])*t,i=(i+Zu[0][n])*t;return e*(r+Gu[0][3])/(i+Zu[0][3])}(t):t<=4?be(e)*(1-function(e){let t,n=Gu[1][8]*e,r=e;for(t=0;t<7;t+=1)n=(n+Gu[1][t])*e,r=(r+Zu[1][t])*e;const i=(n+Gu[1][7])/(r+Zu[1][7]),o=parseInt(16*e)/16,a=(e-o)*(e+o);return Math.exp(-o*o)*Math.exp(-a)*i}(t)):be(e)*(1-function(e){let t,n=1/(e*e),r=Gu[2][5]*n,i=n;for(t=0;t<4;t+=1)r=(r+Gu[2][t])*n,i=(i+Zu[2][t])*n;let o=n*(r+Gu[2][4])/(i+Zu[2][4]);o=(Hu-o)/e,n=parseInt(16*e)/16;const a=(e-n)*(e+n);return Math.exp(-n*n)*Math.exp(-a)*o}(t))},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),$u=.46875,Hu=.5641895835477563,Gu=[[3.1611237438705655,113.86415415105016,377.485237685302,3209.3775891384694,.18577770618460315],[.5641884969886701,8.883149794388377,66.11919063714163,298.6351381974001,881.952221241769,1712.0476126340707,2051.0783778260716,1230.3393547979972,2.1531153547440383e-8],[.30532663496123236,.36034489994980445,.12578172611122926,.016083785148742275,.0006587491615298378,.016315387137302097]],Zu=[[23.601290952344122,244.02463793444417,1282.6165260773723,2844.236833439171],[15.744926110709835,117.6939508913125,537.1811018620099,1621.3895745666903,3290.7992357334597,4362.619090143247,3439.3676741437216,1230.3393548037495],[2.568520192289822,1.8729528499234604,.5279051029514285,.06051834131244132,.0023352049762686918]],Vu=Math.pow(2,53),Wu="zeta",Yu=de(Wu,["typed","config","multiply","pow","divide","factorial","equal","smallerEq","isNegative","gamma","sin","subtract","add","?Complex","?BigNumber","pi"],(e=>{let{typed:t,config:n,multiply:r,pow:i,divide:o,factorial:a,equal:s,smallerEq:u,isNegative:c,gamma:l,sin:f,subtract:p,add:m,Complex:d,BigNumber:h,pi:g}=e;return t(Wu,{number:e=>y(e,(e=>e),(()=>20)),BigNumber:e=>y(e,(e=>new h(e)),(()=>Math.abs(Math.log10(n.relTol)))),Complex:function(e){return 0===e.re&&0===e.im?new d(-.5):1===e.re?new d(NaN,NaN):e.re===1/0&&0===e.im?new d(1):e.im===1/0||e.re===-1/0?new d(NaN,NaN):x(e,(e=>e),(e=>Math.round(19.5+.9*Math.abs(e.im))),(e=>e.re))}});function y(e,t,n){return s(e,0)?t(-.5):s(e,1)?t(NaN):isFinite(e)?x(e,t,n,(e=>e)):c(e)?t(NaN):t(1)}function x(e,t,n,a){const s=n(e);if(a(e)>-(s-1)/2)return function(e,t,n){const a=o(1,r(b(n(0),t),p(1,i(2,p(1,e)))));let s=n(0);for(let a=n(1);u(a,t);a=m(a,1))s=m(s,o(r((-1)**(a-1),b(a,t)),i(a,e)));return r(a,s)}(e,t(s),t);{let s=r(i(2,e),i(t(g),p(e,1)));return s=r(s,f(r(o(t(g),2),e))),s=r(s,l(p(1,e))),r(s,x(p(1,e),t,n,a))}}function b(e,t){let n=e;for(let s=e;u(s,t);s=m(s,1)){const e=o(r(a(m(t,p(s,1))),i(4,s)),r(a(p(t,s)),a(r(2,s))));n=m(n,e)}return r(t,n)}})),Ju="mode",Xu=de(Ju,["typed","isNaN","isNumeric"],(e=>{let{typed:t,isNaN:n,isNumeric:r}=e;return t(Ju,{"Array | Matrix":i,"...":function(e){return i(e)}});function i(e){if(0===(e=qr(e.valueOf())).length)throw new Error("Cannot calculate mode of an empty array");const t={};let i=[],o=0;for(let a=0;a<e.length;a++){const s=e[a];if(r(s)&&n(s))throw new Error("Cannot calculate mode of an array containing NaN values");s in t||(t[s]=0),t[s]++,t[s]===o?i.push(s):t[s]>o&&(o=t[s],i=[s])}return i}}));function Qu(e,t,n){let r;return String(e).includes("Unexpected type")?(r=arguments.length>2?" (type: "+oe(n)+", value: "+JSON.stringify(n)+")":" (type: "+e.data.actual+")",new TypeError("Cannot calculate "+t+", unexpected type of argument"+r)):String(e).includes("complex numbers")?(r=arguments.length>2?" (type: "+oe(n)+", value: "+JSON.stringify(n)+")":"",new TypeError("Cannot calculate "+t+", no ordering relation is defined for complex numbers"+r)):e}const Ku="prod",ec=de(Ku,["typed","config","multiplyScalar","numeric"],(e=>{let{typed:t,config:n,multiplyScalar:r,numeric:i}=e;return t(Ku,{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("prod(A, dim) is not yet supported")},"...":function(e){return o(e)}});function o(e){let t;if(ai(e,(function(e){try{t=void 0===t?e:r(t,e)}catch(t){throw Qu(t,"prod",e)}})),"string"==typeof t&&(t=i(t,xe(t,n))),void 0===t)throw new Error("Cannot calculate prod of an empty array");return t}})),tc="format",nc=de(tc,["typed"],(e=>{let{typed:t}=e;return t(tc,{any:pr,"any, Object | function | number | BigNumber":pr})})),rc=de("bin",["typed","format"],(e=>{let{typed:t,format:n}=e;return t("bin",{"number | BigNumber":function(e){return n(e,{notation:"bin"})},"number | BigNumber, number | BigNumber":function(e,t){return n(e,{notation:"bin",wordSize:t})}})})),ic=de("oct",["typed","format"],(e=>{let{typed:t,format:n}=e;return t("oct",{"number | BigNumber":function(e){return n(e,{notation:"oct"})},"number | BigNumber, number | BigNumber":function(e,t){return n(e,{notation:"oct",wordSize:t})}})})),oc=de("hex",["typed","format"],(e=>{let{typed:t,format:n}=e;return t("hex",{"number | BigNumber":function(e){return n(e,{notation:"hex"})},"number | BigNumber, number | BigNumber":function(e,t){return n(e,{notation:"hex",wordSize:t})}})})),ac=/\$([\w.]+)/g,sc="print",uc=de(sc,["typed"],(e=>{let{typed:t}=e;return t(sc,{"string, Object | Array":cc,"string, Object | Array, number | Object":cc})}));function cc(e,t,n){return e.replace(ac,(function(e,r){const i=r.split(".");let o=t[i.shift()];for(void 0!==o&&o.isMatrix&&(o=o.toArray());i.length&&void 0!==o;){const e=i.shift();o=e?o[e]:o+"."}return void 0!==o?v(o)?o:pr(o,n):e}))}const lc=de("to",["typed","matrix","concat"],(e=>{let{typed:t,matrix:n,concat:r}=e;return t("to",{"Unit, Unit | string":(e,t)=>e.to(t)},fa({typed:t,matrix:n,concat:r})({Ds:!0}))})),fc="toBest",pc=de(fc,["typed"],(e=>{let{typed:t}=e;return t(fc,{Unit:e=>e.toBest(),"Unit, string":(e,t)=>e.toBest(t.split(",")),"Unit, string, Object":(e,t,n)=>e.toBest(t.split(","),n),"Unit, Array":(e,t)=>e.toBest(t),"Unit, Array, Object":(e,t,n)=>e.toBest(t,n)})})),mc="isPrime",dc=de(mc,["typed"],(e=>{let{typed:t}=e;return t(mc,{number:function(e){if(e<=3)return e>1;if(e%2==0||e%3==0)return!1;for(let t=5;t*t<=e;t+=6)if(e%t==0||e%(t+2)==0)return!1;return!0},bigint:function(e){if(e<=3n)return e>1n;if(e%2n===0n||e%3n===0n)return!1;for(let t=5n;t*t<=e;t+=6n)if(e%t===0n||e%(t+2n)===0n)return!1;return!0},BigNumber:function(e){if(e.lte(3))return e.gt(1);if(e.mod(2).eq(0)||e.mod(3).eq(0))return!1;if(e.lt(Math.pow(2,32))){const t=e.toNumber();for(let e=5;e*e<=t;e+=6)if(t%e==0||t%(e+2)==0)return!1;return!0}function t(e,t,n){let r=1;for(;!t.eq(0);)t.mod(2).eq(0)?(t=t.div(2),e=e.mul(e).mod(n)):(t=t.sub(1),r=e.mul(r).mod(n));return r}const n=e.constructor.clone({precision:2*e.toFixed(0).length});let r=0,i=(e=new n(e)).sub(1);for(;i.mod(2).eq(0);)i=i.div(2),r+=1;let o=null;if(e.lt("3317044064679887385961981"))o=[2,3,5,7,11,13,17,19,23,29,31,37,41].filter((t=>t<e));else{const t=Math.min(e.toNumber()-2,Math.floor(2*Math.pow(e.toFixed(0).length*Math.log(10),2)));o=[];for(let e=2;e<=t;e+=1)o.push(t)}for(let n=0;n<o.length;n+=1){const a=o[n],s=t(e.sub(e).add(a),i,e);if(!s.eq(1))for(let t=0,n=s;!n.eq(e.sub(1));t+=1,n=n.mul(n).mod(e))if(t===r-1)return!1}return!0},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),hc=de("numeric",["number","?bignumber","?fraction"],(e=>{let{number:t,bignumber:n,fraction:r}=e;const i={string:!0,number:!0,BigNumber:!0,Fraction:!0},o={number:e=>t(e),BigNumber:n?e=>n(e):cu,bigint:e=>BigInt(e),Fraction:r?e=>r(e):lu};return function(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"number";if(void 0!==(arguments.length>2?arguments[2]:void 0))throw new SyntaxError("numeric() takes one or two arguments");const n=oe(e);if(!(n in i))throw new TypeError("Cannot convert "+e+' of type "'+n+'"; valid input types are '+Object.keys(i).join(", "));if(!(t in o))throw new TypeError("Cannot convert "+e+' to type "'+t+'"; valid output types are '+Object.keys(o).join(", "));return t===n?e:o[t](e)}})),gc="divideScalar",yc=de(gc,["typed","numeric"],(e=>{let{typed:t,numeric:n}=e;return t(gc,{"number, number":function(e,t){return e/t},"Complex, Complex":function(e,t){return e.div(t)},"BigNumber, BigNumber":function(e,t){return e.div(t)},"bigint, bigint":function(e,t){return e/t},"Fraction, Fraction":function(e,t){return e.div(t)},"Unit, number | Complex | Fraction | BigNumber | Unit":(e,t)=>e.divide(t),"number | Fraction | Complex | BigNumber, Unit":(e,t)=>t.divideInto(e)})})),xc=de("pow",["typed","config","identity","multiply","matrix","inv","fraction","number","Complex"],(e=>{let{typed:t,config:n,identity:r,multiply:i,matrix:o,inv:a,number:s,fraction:u,Complex:c}=e;return t("pow",{"number, number":l,"Complex, Complex":function(e,t){return e.pow(t)},"BigNumber, BigNumber":function(e,t){return t.isInteger()||e>=0||n.predictable?e.pow(t):new c(e.toNumber(),0).pow(t.toNumber(),0)},"bigint, bigint":(e,t)=>e**t,"Fraction, Fraction":function(e,t){const r=e.pow(t);if(null!=r)return r;if(n.predictable)throw new Error("Result of pow is non-rational and cannot be expressed as a fraction");return l(e.valueOf(),t.valueOf())},"Array, number":f,"Array, BigNumber":function(e,t){return f(e,t.toNumber())},"Matrix, number":p,"Matrix, BigNumber":function(e,t){return p(e,t.toNumber())},"Unit, number | BigNumber":function(e,t){return e.pow(t)}});function l(e,t){if(n.predictable&&!ye(t)&&e<0)try{const n=u(t),r=s(n);if((t===r||Math.abs((t-r)/t)<1e-14)&&n.d%2n===1n)return(n.n%2n===0n?1:-1)*Math.pow(-e,t)}catch(e){}return n.predictable&&(e<-1&&t===1/0||e>-1&&e<0&&t===-1/0)?NaN:ye(t)||e>=0||n.predictable?No(e,t):e*e<1&&t===1/0||e*e>1&&t===-1/0?0:new c(e,0).pow(t,0)}function f(e,t){if(!ye(t))throw new TypeError("For A^b, b must be an integer (value is "+t+")");const n=wr(e);if(2!==n.length)throw new Error("For A^b, A must be 2 dimensional (A has "+n.length+" dimensions)");if(n[0]!==n[1])throw new Error("For A^b, A must be square (size is "+n[0]+"x"+n[1]+")");if(t<0)try{return f(a(e),-t)}catch(e){if("Cannot calculate inverse, determinant is zero"===e.message)throw new TypeError("For A^b, when A is not invertible, b must be a positive integer (value is "+t+")");throw e}let o=r(n[0]).valueOf(),s=e;for(;t>=1;)1&~t||(o=i(s,o)),t>>=1,s=i(s,s);return o}function p(e,t){return o(f(e.valueOf(),t))}})),bc="Number of decimals in function round must be an integer",wc="round",vc=de(wc,["typed","config","matrix","equalScalar","zeros","BigNumber","DenseMatrix"],(e=>{let{typed:t,config:n,matrix:r,equalScalar:i,zeros:o,BigNumber:a,DenseMatrix:s}=e;const u=Ro({typed:t,equalScalar:i}),c=Po({typed:t,DenseMatrix:s}),l=Uo({typed:t});function f(e){return Math.abs(Te(e).exponent)}return t(wc,{number:function(e){const t=Ao(e,f(n.relTol));return Ao(_e(e,t,n.relTol,n.absTol)?t:e)},"number, number":function(e,t){const r=f(n.relTol);if(t>=r)return Ao(e,t);const i=Ao(e,r);return Ao(_e(e,i,n.relTol,n.absTol)?i:e,t)},"number, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(bc);return new a(e).toDecimalPlaces(t.toNumber())},Complex:function(e){return e.round()},"Complex, number":function(e,t){if(t%1)throw new TypeError(bc);return e.round(t)},"Complex, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(bc);const n=t.toNumber();return e.round(n)},BigNumber:function(e){const t=new a(e).toDecimalPlaces(f(n.relTol));return(yi(e,t,n.relTol,n.absTol)?t:e).toDecimalPlaces(0)},"BigNumber, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(bc);const r=f(n.relTol);if(t>=r)return e.toDecimalPlaces(t.toNumber());const i=e.toDecimalPlaces(r);return(yi(e,i,n.relTol,n.absTol)?i:e).toDecimalPlaces(t.toNumber())},bigint:e=>e,"bigint, number":(e,t)=>e,"bigint, BigNumber":(e,t)=>e,Fraction:function(e){return e.round()},"Fraction, number":function(e,t){if(t%1)throw new TypeError(bc);return e.round(t)},"Fraction, BigNumber":function(e,t){if(!t.isInteger())throw new TypeError(bc);return e.round(t.toNumber())},"Unit, number, Unit":t.referToSelf((e=>function(t,n,r){const i=t.toNumeric(r);return r.multiply(e(i,n))})),"Unit, BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>e(t,n.toNumber(),r))),"Array | Matrix, number | BigNumber, Unit":t.referToSelf((e=>(t,n,r)=>si(t,(t=>e(t,n,r)),!0))),"Array | Matrix | Unit, Unit":t.referToSelf((e=>(t,n)=>e(t,0,n))),"Array | Matrix":t.referToSelf((e=>t=>si(t,e,!0))),"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>u(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>l(t,n,e,!1))),"Array, number | BigNumber":t.referToSelf((e=>(t,n)=>l(r(t),n,e,!1).valueOf())),"number | Complex | BigNumber | Fraction, SparseMatrix":t.referToSelf((e=>(t,n)=>i(t,0)?o(n.size(),n.storage()):c(n,t,e,!0))),"number | Complex | BigNumber | Fraction, DenseMatrix":t.referToSelf((e=>(t,n)=>i(t,0)?o(n.size(),n.storage()):l(n,t,e,!0))),"number | Complex | BigNumber | Fraction, Array":t.referToSelf((e=>(t,n)=>l(r(n),t,e,!0).valueOf()))})})),Nc=["config","typed","typeOf","divideScalar","Complex"],Ac=Math.log(16),Ec=de("log",Nc,(e=>{let{typed:t,typeOf:n,config:r,divideScalar:i,Complex:o}=e;function a(e){return e.log()}function s(e){return a(new o(e,0))}return t("log",{number:function(e){return e>=0||r.predictable?ho(e):s(e)},bigint:Aa(Ac,ho,r,s),Complex:a,BigNumber:function(e){return!e.isNegative()||r.predictable?e.ln():s(e.toNumber())},"any, any":t.referToSelf((e=>(t,r)=>{if("Fraction"===n(t)&&"Fraction"===n(r)){const e=t.log(r);if(null!==e)return e}return i(e(t),e(r))}))})})),Sc="log1p",Mc=de(Sc,["typed","config","divideScalar","log","Complex"],(e=>{let{typed:t,config:n,divideScalar:r,log:i,Complex:o}=e;return t(Sc,{number:function(e){return e>=-1||n.predictable?Ne(e):a(new o(e,0))},Complex:a,BigNumber:function(e){const t=e.plus(1);return!t.isNegative()||n.predictable?t.ln():a(new o(e.toNumber(),0))},"Array | Matrix":t.referToSelf((e=>t=>si(t,e))),"any, any":t.referToSelf((e=>(t,n)=>r(e(t),i(n))))});function a(e){const t=e.re+1;return new o(Math.log(Math.sqrt(t*t+e.im*e.im)),Math.atan2(e.im,t))}})),Cc="nthRoots",Tc=de(Cc,["config","typed","divideScalar","Complex"],(e=>{let{typed:t,config:n,divideScalar:r,Complex:i}=e;const o=[function(e){return new i(e,0)},function(e){return new i(0,e)},function(e){return new i(-e,0)},function(e){return new i(0,-e)}];function a(e,t){if(t<0)throw new Error("Root must be greater than zero");if(0===t)throw new Error("Root must be non-zero");if(t%1!=0)throw new Error("Root must be an integer");if(0===e||0===e.abs())return[new i(0,0)];const n="number"==typeof e;let r;(n||0===e.re||0===e.im)&&(r=n?2*+(e<0):0===e.im?2*+(e.re<0):2*+(e.im<0)+1);const a=e.arg(),s=e.abs(),u=[],c=Math.pow(s,1/t);for(let e=0;e<t;e++){const n=(r+4*e)/t;n!==Math.round(n)?u.push(new i({r:c,phi:(a+2*Math.PI*e)/t})):u.push(o[n%4](c))}return u}return t(Cc,{Complex:function(e){return a(e,2)},"Complex, number":a})})),Bc="dotPow",Fc=de(Bc,["typed","equalScalar","matrix","pow","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,equalScalar:n,matrix:r,pow:i,DenseMatrix:o,concat:a,SparseMatrix:s}=e;const u=sa({typed:t}),c=ys({typed:t,SparseMatrix:s}),l=Ro({typed:t,equalScalar:n}),f=Po({typed:t,DenseMatrix:o}),p=fa({typed:t,matrix:r,concat:a}),m={};for(const e in i.signatures)Object.prototype.hasOwnProperty.call(i.signatures,e)&&(e.includes("Matrix")||e.includes("Array")||(m[e]=i.signatures[e]));const d=t(m);return t(Bc,p({elop:d,SS:c,DS:u,Ss:l,sS:f}))})),Dc="dotDivide",Oc=de(Dc,["typed","matrix","equalScalar","divideScalar","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,matrix:n,equalScalar:r,divideScalar:i,DenseMatrix:o,concat:a,SparseMatrix:s}=e;const u=aa({typed:t,equalScalar:r}),c=sa({typed:t}),l=ys({typed:t,SparseMatrix:s}),f=Ro({typed:t,equalScalar:r}),p=Po({typed:t,DenseMatrix:o}),m=fa({typed:t,matrix:n,concat:a});return t(Dc,m({elop:i,SS:l,DS:c,SD:u,Ss:f,sS:p}))}));function _c(e){let{DenseMatrix:t}=e;return function(e,n,r){const i=e.size();if(2!==i.length)throw new RangeError("Matrix must be two dimensional (size: "+pr(i)+")");const o=i[0];if(o!==i[1])throw new RangeError("Matrix must be square (size: "+pr(i)+")");let a=[];if(A(n)){const e=n.size(),i=n._data;if(1===e.length){if(e[0]!==o)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(let e=0;e<o;e++)a[e]=[i[e]];return new t({data:a,size:[o,1],datatype:n._datatype})}if(2===e.length){if(e[0]!==o||1!==e[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");if(S(n)){if(r){a=[];for(let e=0;e<o;e++)a[e]=[i[e][0]];return new t({data:a,size:[o,1],datatype:n._datatype})}return n}if(M(n)){for(let e=0;e<o;e++)a[e]=[0];const e=n._values,r=n._index,i=n._ptr;for(let t=i[1],n=i[0];n<t;n++)a[r[n]][0]=e[n];return new t({data:a,size:[o,1],datatype:n._datatype})}}throw new RangeError("Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.")}if(N(n)){const e=wr(n);if(1===e.length){if(e[0]!==o)throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(let e=0;e<o;e++)a[e]=[n[e]];return new t({data:a,size:[o,1]})}if(2===e.length){if(e[0]!==o||1!==e[1])throw new RangeError("Dimension mismatch. Matrix columns must match vector length.");for(let e=0;e<o;e++)a[e]=[n[e][0]];return new t({data:a,size:[o,1]})}throw new RangeError("Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.")}}}const zc="lsolve",qc=de(zc,["typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix"],(e=>{let{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtractScalar:o,equalScalar:a,DenseMatrix:s}=e;const u=_c({DenseMatrix:s});return t(zc,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){const n=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=e._values,p=e._index,m=e._ptr,d=[];for(let e=0;e<l;e++){const t=n[e][0]||0;if(a(t,0))d[e]=[0];else{let s=0;const u=[],c=[],l=m[e],h=m[e+1];for(let t=l;t<h;t++){const n=p[t];n===e?s=f[t]:n>e&&(u.push(f[t]),c.push(n))}if(a(s,0))throw new Error("Linear system cannot be solved since matrix is singular");const g=r(t,s);for(let e=0,t=c.length;e<t;e++){const t=c[e];n[t]=[o(n[t][0]||0,i(g,u[e]))]}d[e]=[g]}}return new s({data:d,size:[c,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(n(e),t).valueOf()}});function c(e,t){const n=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=[],p=e._data;for(let e=0;e<l;e++){const t=n[e][0]||0;let s;if(a(t,0))s=0;else{const u=p[e][e];if(a(u,0))throw new Error("Linear system cannot be solved since matrix is singular");s=r(t,u);for(let t=e+1;t<c;t++)n[t]=[o(n[t][0]||0,i(s,p[t][e]))]}f[e]=[s]}return new s({data:f,size:[c,1]})}})),Ic="usolve",kc=de(Ic,["typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix"],(e=>{let{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtractScalar:o,equalScalar:a,DenseMatrix:s}=e;const u=_c({DenseMatrix:s});return t(Ic,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){const n=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=e._values,p=e._index,m=e._ptr,d=[];for(let e=l-1;e>=0;e--){const t=n[e][0]||0;if(a(t,0))d[e]=[0];else{let s=0;const u=[],c=[],l=m[e];for(let t=m[e+1]-1;t>=l;t--){const n=p[t];n===e?s=f[t]:n<e&&(u.push(f[t]),c.push(n))}if(a(s,0))throw new Error("Linear system cannot be solved since matrix is singular");const h=r(t,s);for(let e=0,t=c.length;e<t;e++){const t=c[e];n[t]=[o(n[t][0],i(h,u[e]))]}d[e]=[h]}}return new s({data:d,size:[c,1]})}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(n(e),t).valueOf()}});function c(e,t){const n=(t=u(e,t,!0))._data,c=e._size[0],l=e._size[1],f=[],p=e._data;for(let e=l-1;e>=0;e--){const t=n[e][0]||0;let s;if(a(t,0))s=0;else{const u=p[e][e];if(a(u,0))throw new Error("Linear system cannot be solved since matrix is singular");s=r(t,u);for(let t=e-1;t>=0;t--)n[t]=[o(n[t][0]||0,i(s,p[t][e]))]}f[e]=[s]}return new s({data:f,size:[c,1]})}})),Rc="lsolveAll",Pc=de(Rc,["typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix"],(e=>{let{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtractScalar:o,equalScalar:a,DenseMatrix:s}=e;const u=_c({DenseMatrix:s});return t(Rc,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){const n=[u(e,t,!0)._data.map((e=>e[0]))],c=e._size[0],l=e._size[1],f=e._values,p=e._index,m=e._ptr;for(let e=0;e<l;e++){let t=n.length;for(let s=0;s<t;s++){const u=n[s],c=[],l=[],d=m[e],h=m[e+1];let g=0;for(let t=d;t<h;t++){const n=p[t];n===e?g=f[t]:n>e&&(c.push(f[t]),l.push(n))}if(a(g,0))if(a(u[e],0)){if(0===s){const t=[...u];t[e]=1;for(let e=0,n=l.length;e<n;e++){const n=l[e];t[n]=o(t[n],c[e])}n.push(t)}}else{if(0===s)return[];n.splice(s,1),s-=1,t-=1}else{u[e]=r(u[e],g);for(let t=0,n=l.length;t<n;t++){const n=l[t];u[n]=o(u[n],i(u[e],c[t]))}}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[c,1]})))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(n(e),t).map((e=>e.valueOf()))}});function c(e,t){const n=[u(e,t,!0)._data.map((e=>e[0]))],c=e._data,l=e._size[0],f=e._size[1];for(let e=0;e<f;e++){let t=n.length;for(let s=0;s<t;s++){const u=n[s];if(a(c[e][e],0))if(a(u[e],0)){if(0===s){const t=[...u];t[e]=1;for(let n=e+1;n<f;n++)t[n]=o(t[n],c[n][e]);n.push(t)}}else{if(0===s)return[];n.splice(s,1),s-=1,t-=1}else{u[e]=r(u[e],c[e][e]);for(let t=e+1;t<f;t++)u[t]=o(u[t],i(u[e],c[t][e]))}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}})),Uc="usolveAll",jc=de(Uc,["typed","matrix","divideScalar","multiplyScalar","subtractScalar","equalScalar","DenseMatrix"],(e=>{let{typed:t,matrix:n,divideScalar:r,multiplyScalar:i,subtractScalar:o,equalScalar:a,DenseMatrix:s}=e;const u=_c({DenseMatrix:s});return t(Uc,{"SparseMatrix, Array | Matrix":function(e,t){return function(e,t){const n=[u(e,t,!0)._data.map((e=>e[0]))],c=e._size[0],l=e._size[1],f=e._values,p=e._index,m=e._ptr;for(let e=l-1;e>=0;e--){let t=n.length;for(let s=0;s<t;s++){const u=n[s],c=[],l=[],d=m[e];let h=0;for(let t=m[e+1]-1;t>=d;t--){const n=p[t];n===e?h=f[t]:n<e&&(c.push(f[t]),l.push(n))}if(a(h,0))if(a(u[e],0)){if(0===s){const t=[...u];t[e]=1;for(let e=0,n=l.length;e<n;e++){const n=l[e];t[n]=o(t[n],c[e])}n.push(t)}}else{if(0===s)return[];n.splice(s,1),s-=1,t-=1}else{u[e]=r(u[e],h);for(let t=0,n=l.length;t<n;t++){const n=l[t];u[n]=o(u[n],i(u[e],c[t]))}}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[c,1]})))}(e,t)},"DenseMatrix, Array | Matrix":function(e,t){return c(e,t)},"Array, Array | Matrix":function(e,t){return c(n(e),t).map((e=>e.valueOf()))}});function c(e,t){const n=[u(e,t,!0)._data.map((e=>e[0]))],c=e._data,l=e._size[0];for(let t=e._size[1]-1;t>=0;t--){let e=n.length;for(let s=0;s<e;s++){const u=n[s];if(a(c[t][t],0))if(a(u[t],0)){if(0===s){const e=[...u];e[t]=1;for(let n=t-1;n>=0;n--)e[n]=o(e[n],c[n][t]);n.push(e)}}else{if(0===s)return[];n.splice(s,1),s-=1,e-=1}else{u[t]=r(u[t],c[t][t]);for(let e=t-1;e>=0;e--)u[e]=o(u[e],i(u[t],c[e][t]))}}}return n.map((e=>new s({data:e.map((e=>[e])),size:[l,1]})))}})),Lc=de("matAlgo08xS0Sid",["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return function(e,r,i){const o=e._values,a=e._index,s=e._ptr,u=e._size,c=e._datatype||void 0===e._data?e._datatype:e.getDataType(),l=r._values,f=r._index,p=r._ptr,m=r._size,d=r._datatype||void 0===r._data?r._datatype:r.getDataType();if(u.length!==m.length)throw new xr(u.length,m.length);if(u[0]!==m[0]||u[1]!==m[1])throw new RangeError("Dimension mismatch. Matrix A ("+u+") must match Matrix B ("+m+")");if(!o||!l)throw new Error("Cannot perform operation on Pattern Sparse Matrices");const h=u[0],g=u[1];let y,x=n,b=0,w=i;"string"==typeof c&&c===d&&"mixed"!==c&&(y=c,x=t.find(n,[y,y]),b=t.convert(0,y),w=t.find(i,[y,y]));const v=[],N=[],A=[],E=[],S=[];let M,C,T,B;for(let e=0;e<g;e++){A[e]=N.length;const t=e+1;for(C=s[e],T=s[e+1],M=C;M<T;M++)B=a[M],S[B]=t,E[B]=o[M],N.push(B);for(C=p[e],T=p[e+1],M=C;M<T;M++)B=f[M],S[B]===t&&(E[B]=w(E[B],l[M]));for(M=A[e];M<N.length;){B=N[M];const e=E[B];x(e,b)?N.splice(M,1):(v.push(e),M++)}}return A[g]=N.length,e.createSparseMatrix({values:v,index:N,ptr:A,size:[h,g],datatype:c===e._datatype&&d===r._datatype?y:void 0})}})),$c=de("useMatrixForArrayScalar",["typed","matrix"],(e=>{let{typed:t,matrix:n}=e;return{"Array, number":t.referTo("DenseMatrix, number",(e=>(t,r)=>e(n(t),r).valueOf())),"Array, BigNumber":t.referTo("DenseMatrix, BigNumber",(e=>(t,r)=>e(n(t),r).valueOf())),"number, Array":t.referTo("number, DenseMatrix",(e=>(t,r)=>e(t,n(r)).valueOf())),"BigNumber, Array":t.referTo("BigNumber, DenseMatrix",(e=>(t,r)=>e(t,n(r)).valueOf()))}})),Hc="leftShift",Gc=de(Hc,["typed","matrix","equalScalar","zeros","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:o,concat:a}=e;const s=ma({typed:t}),u=aa({typed:t,equalScalar:r}),c=Lc({typed:t,equalScalar:r}),l=ha({typed:t,DenseMatrix:o}),f=Ro({typed:t,equalScalar:r}),p=Uo({typed:t}),m=fa({typed:t,matrix:n,concat:a}),d=$c({typed:t,matrix:n});return t(Hc,{"number, number":us,"BigNumber, BigNumber":ts,"bigint, bigint":(e,t)=>e<<t,"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():f(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():p(t,n,e,!1))),"number | BigNumber, SparseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):l(n,t,e,!0))),"number | BigNumber, DenseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):p(n,t,e,!0)))},d,m({SS:c,DS:s,SD:u}))})),Zc="rightArithShift",Vc=de(Zc,["typed","matrix","equalScalar","zeros","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:o,concat:a}=e;const s=ma({typed:t}),u=aa({typed:t,equalScalar:r}),c=Lc({typed:t,equalScalar:r}),l=ha({typed:t,DenseMatrix:o}),f=Ro({typed:t,equalScalar:r}),p=Uo({typed:t}),m=fa({typed:t,matrix:n,concat:a}),d=$c({typed:t,matrix:n});return t(Zc,{"number, number":cs,"BigNumber, BigNumber":ns,"bigint, bigint":(e,t)=>e>>t,"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():f(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():p(t,n,e,!1))),"number | BigNumber, SparseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):l(n,t,e,!0))),"number | BigNumber, DenseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):p(n,t,e,!0)))},d,m({SS:c,DS:s,SD:u}))})),Wc="rightLogShift",Yc=de(Wc,["typed","matrix","equalScalar","zeros","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,DenseMatrix:o,concat:a}=e;const s=ma({typed:t}),u=aa({typed:t,equalScalar:r}),c=Lc({typed:t,equalScalar:r}),l=ha({typed:t,DenseMatrix:o}),f=Ro({typed:t,equalScalar:r}),p=Uo({typed:t}),m=fa({typed:t,matrix:n,concat:a}),d=$c({typed:t,matrix:n});return t(Wc,{"number, number":ls,"SparseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():f(t,n,e,!1))),"DenseMatrix, number | BigNumber":t.referToSelf((e=>(t,n)=>r(n,0)?t.clone():p(t,n,e,!1))),"number | BigNumber, SparseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):l(n,t,e,!0))),"number | BigNumber, DenseMatrix":t.referToSelf((e=>(t,n)=>r(t,0)?i(n.size(),n.storage()):p(n,t,e,!0)))},d,m({SS:c,DS:s,SD:u}))})),Jc=de("and",["typed","matrix","equalScalar","zeros","not","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,not:o,concat:a}=e;const s=aa({typed:t,equalScalar:r}),u=va({typed:t,equalScalar:r}),c=Ro({typed:t,equalScalar:r}),l=Uo({typed:t}),f=fa({typed:t,matrix:n,concat:a});return t("and",{"number, number":Bs,"Complex, Complex":function(e,t){return!(0===e.re&&0===e.im||0===t.re&&0===t.im)},"BigNumber, BigNumber":function(e,t){return!(e.isZero()||t.isZero()||e.isNaN()||t.isNaN())},"bigint, bigint":Bs,"Unit, Unit":t.referToSelf((e=>(t,n)=>e(t.value||0,n.value||0))),"SparseMatrix, any":t.referToSelf((e=>(t,n)=>o(n)?i(t.size(),t.storage()):c(t,n,e,!1))),"DenseMatrix, any":t.referToSelf((e=>(t,n)=>o(n)?i(t.size(),t.storage()):l(t,n,e,!1))),"any, SparseMatrix":t.referToSelf((e=>(t,n)=>o(t)?i(t.size(),t.storage()):c(n,t,e,!0))),"any, DenseMatrix":t.referToSelf((e=>(t,n)=>o(t)?i(t.size(),t.storage()):l(n,t,e,!0))),"Array, any":t.referToSelf((e=>(t,r)=>e(n(t),r).valueOf())),"any, Array":t.referToSelf((e=>(t,r)=>e(t,n(r)).valueOf()))},f({SS:u,DS:s}))})),Xc="compare",Qc=de(Xc,["typed","config","matrix","equalScalar","BigNumber","Fraction","DenseMatrix","concat"],(e=>{let{typed:t,config:n,equalScalar:r,matrix:i,BigNumber:o,Fraction:a,DenseMatrix:s,concat:u}=e;const c=sa({typed:t}),l=ua({typed:t,equalScalar:r}),f=Po({typed:t,DenseMatrix:s}),p=fa({typed:t,matrix:i,concat:u}),m=Oi({typed:t});return t(Xc,Kc({typed:t,config:n}),{"boolean, boolean":function(e,t){return e===t?0:e>t?1:-1},"BigNumber, BigNumber":function(e,t){return yi(e,t,n.relTol,n.absTol)?new o(0):new o(e.cmp(t))},"bigint, bigint":function(e,t){return e===t?0n:e>t?1n:-1n},"Fraction, Fraction":function(e,t){return new a(e.compare(t))},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")}},m,p({SS:l,DS:c,Ss:f}))})),Kc=de(Xc,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(Xc,{"number, number":function(e,t){return _e(e,t,n.relTol,n.absTol)?0:e>t?1:-1}})}));var el=n(880);const tl="compareNatural",nl=de(tl,["typed","compare"],(e=>{let{typed:t,compare:n}=e;const r=n.signatures["boolean,boolean"];return t(tl,{"any, any":function e(t,a){const s=oe(t),u=oe(a);let c;if(!("number"!==s&&"BigNumber"!==s&&"Fraction"!==s||"number"!==u&&"BigNumber"!==u&&"Fraction"!==u))return c=n(t,a),"0"!==c.toString()?c>0?1:-1:el(s,u);const l=["Array","DenseMatrix","SparseMatrix"];if(l.includes(s)||l.includes(u))return c=i(e,t,a),0!==c?c:el(s,u);if(s!==u)return el(s,u);if("Complex"===s)return function(e,t){return e.re>t.re?1:e.re<t.re?-1:e.im>t.im?1:e.im<t.im?-1:0}(t,a);if("Unit"===s)return t.equalBase(a)?e(t.value,a.value):o(e,t.formatUnits(),a.formatUnits());if("boolean"===s)return r(t,a);if("string"===s)return el(t,a);if("Object"===s)return function(e,t,n){const r=Object.keys(t),i=Object.keys(n);r.sort(el),i.sort(el);const a=o(e,r,i);if(0!==a)return a;for(let o=0;o<r.length;o++){const a=e(t[r[o]],n[i[o]]);if(0!==a)return a}return 0}(e,t,a);if("null"===s)return 0;if("undefined"===s)return 0;throw new TypeError('Unsupported type of value "'+s+'"')}});function i(e,t,n){return M(t)&&M(n)?o(e,t.toJSON().values,n.toJSON().values):M(t)?i(e,t.toArray(),n):M(n)?i(e,t,n.toArray()):S(t)?i(e,t.toJSON().data,n):S(n)?i(e,t,n.toJSON().data):Array.isArray(t)?Array.isArray(n)?o(e,t,n):i(e,t,[n]):i(e,[t],n)}function o(e,t,n){for(let r=0,i=Math.min(t.length,n.length);r<i;r++){const i=e(t[r],n[r]);if(0!==i)return i}return t.length>n.length?1:t.length<n.length?-1:0}})),rl="compareText",il=["typed","matrix","concat"];yr.signature="any, any";const ol=de(rl,il,(e=>{let{typed:t,matrix:n,concat:r}=e;const i=fa({typed:t,matrix:n,concat:r});return t(rl,yr,i({elop:yr,Ds:!0}))})),al="equal",sl=de(al,["typed","matrix","equalScalar","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o,SparseMatrix:a}=e;const s=sa({typed:t}),u=ys({typed:t,SparseMatrix:a}),c=Po({typed:t,DenseMatrix:i}),l=fa({typed:t,matrix:n,concat:o});return t(al,ul({typed:t,equalScalar:r}),l({elop:r,SS:u,DS:s,Ss:c}))})),ul=de(al,["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return t(al,{"any, any":function(e,t){return null===e?null===t:null===t?null===e:void 0===e?void 0===t:void 0===t?void 0===e:n(e,t)}})})),cl="equalText",ll=de(cl,["typed","compareText","isZero"],(e=>{let{typed:t,compareText:n,isZero:r}=e;return t(cl,{"any, any":function(e,t){return r(n(e,t))}})})),fl="smaller",pl=de(fl,["typed","config","bignumber","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,config:n,bignumber:r,matrix:i,DenseMatrix:o,concat:a,SparseMatrix:s}=e;const u=sa({typed:t}),c=ys({typed:t,SparseMatrix:s}),l=Po({typed:t,DenseMatrix:o}),f=fa({typed:t,matrix:i,concat:a}),p=Oi({typed:t});function m(e,t){return e.lt(t)&&!yi(e,t,n.relTol,n.absTol)}return t(fl,ml({typed:t,config:n}),{"boolean, boolean":(e,t)=>e<t,"BigNumber, BigNumber":m,"bigint, bigint":(e,t)=>e<t,"Fraction, Fraction":(e,t)=>-1===e.compare(t),"Fraction, BigNumber":function(e,t){return m(r(e),t)},"BigNumber, Fraction":function(e,t){return m(e,r(t))},"Complex, Complex":function(e,t){throw new TypeError("No ordering relation is defined for complex numbers")}},p,f({SS:c,DS:u,Ss:l}))})),ml=de(fl,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(fl,{"number, number":function(e,t){return e<t&&!_e(e,t,n.relTol,n.absTol)}})})),dl="smallerEq",hl=de(dl,["typed","config","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,config:n,matrix:r,DenseMatrix:i,concat:o,SparseMatrix:a}=e;const s=sa({typed:t}),u=ys({typed:t,SparseMatrix:a}),c=Po({typed:t,DenseMatrix:i}),l=fa({typed:t,matrix:r,concat:o}),f=Oi({typed:t});return t(dl,gl({typed:t,config:n}),{"boolean, boolean":(e,t)=>e<=t,"BigNumber, BigNumber":function(e,t){return e.lte(t)||yi(e,t,n.relTol,n.absTol)},"bigint, bigint":(e,t)=>e<=t,"Fraction, Fraction":(e,t)=>1!==e.compare(t),"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")}},f,l({SS:u,DS:s,Ss:c}))})),gl=de(dl,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(dl,{"number, number":function(e,t){return e<=t||_e(e,t,n.relTol,n.absTol)}})})),yl="larger",xl=de(yl,["typed","config","bignumber","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,config:n,bignumber:r,matrix:i,DenseMatrix:o,concat:a,SparseMatrix:s}=e;const u=sa({typed:t}),c=ys({typed:t,SparseMatrix:s}),l=Po({typed:t,DenseMatrix:o}),f=fa({typed:t,matrix:i,concat:a}),p=Oi({typed:t});function m(e,t){return e.gt(t)&&!yi(e,t,n.relTol,n.absTol)}return t(yl,bl({typed:t,config:n}),{"boolean, boolean":(e,t)=>e>t,"BigNumber, BigNumber":m,"bigint, bigint":(e,t)=>e>t,"Fraction, Fraction":(e,t)=>1===e.compare(t),"Fraction, BigNumber":function(e,t){return m(r(e),t)},"BigNumber, Fraction":function(e,t){return m(e,r(t))},"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")}},p,f({SS:c,DS:u,Ss:l}))})),bl=de(yl,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(yl,{"number, number":function(e,t){return e>t&&!_e(e,t,n.relTol,n.absTol)}})})),wl="largerEq",vl=de(wl,["typed","config","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,config:n,matrix:r,DenseMatrix:i,concat:o,SparseMatrix:a}=e;const s=sa({typed:t}),u=ys({typed:t,SparseMatrix:a}),c=Po({typed:t,DenseMatrix:i}),l=fa({typed:t,matrix:r,concat:o}),f=Oi({typed:t});return t(wl,Nl({typed:t,config:n}),{"boolean, boolean":(e,t)=>e>=t,"BigNumber, BigNumber":function(e,t){return e.gte(t)||yi(e,t,n.relTol,n.absTol)},"bigint, bigint":function(e,t){return e>=t},"Fraction, Fraction":(e,t)=>-1!==e.compare(t),"Complex, Complex":function(){throw new TypeError("No ordering relation is defined for complex numbers")}},f,l({SS:u,DS:s,Ss:c}))})),Nl=de(wl,["typed","config"],(e=>{let{typed:t,config:n}=e;return t(wl,{"number, number":function(e,t){return e>=t||_e(e,t,n.relTol,n.absTol)}})})),Al="deepEqual",El=de(Al,["typed","equal"],(e=>{let{typed:t,equal:n}=e;return t(Al,{"any, any":function(e,t){return r(e.valueOf(),t.valueOf())}});function r(e,t){if(Array.isArray(e)){if(Array.isArray(t)){const n=e.length;if(n!==t.length)return!1;for(let i=0;i<n;i++)if(!r(e[i],t[i]))return!1;return!0}return!1}return!Array.isArray(t)&&n(e,t)}})),Sl="unequal",Ml=de(Sl,["typed","config","equalScalar","matrix","DenseMatrix","concat","SparseMatrix"],(e=>{let{typed:t,config:n,equalScalar:r,matrix:i,DenseMatrix:o,concat:a,SparseMatrix:s}=e;const u=sa({typed:t}),c=ys({typed:t,SparseMatrix:s}),l=Po({typed:t,DenseMatrix:o}),f=fa({typed:t,matrix:i,concat:a});return t(Sl,Cl({typed:t,equalScalar:r}),f({elop:function(e,t){return!r(e,t)},SS:c,DS:u,Ss:l}))})),Cl=de(Sl,["typed","equalScalar"],(e=>{let{typed:t,equalScalar:n}=e;return t(Sl,{"any, any":function(e,t){return null===e?null!==t:null===t?null!==e:void 0===e?void 0!==t:void 0===t?void 0!==e:!n(e,t)}})})),Tl="partitionSelect",Bl=de(Tl,["typed","isNumeric","isNaN","compare"],(e=>{let{typed:t,isNumeric:n,isNaN:r,compare:i}=e;const o=i,a=(e,t)=>-i(e,t);return t(Tl,{"Array | Matrix, number":function(e,t){return s(e,t,o)},"Array | Matrix, number, string":function(e,t,n){if("asc"===n)return s(e,t,o);if("desc"===n)return s(e,t,a);throw new Error('Compare string must be "asc" or "desc"')},"Array | Matrix, number, function":s});function s(e,t,n){if(!ye(t)||t<0)throw new Error("k must be a non-negative integer");if(A(e)){if(e.size().length>1)throw new Error("Only one dimensional matrices supported");return u(e.valueOf(),t,n)}if(Array.isArray(e))return u(e,t,n)}function u(e,t,i){if(t>=e.length)throw new Error("k out of bounds");for(let t=0;t<e.length;t++)if(n(e[t])&&r(e[t]))return e[t];let o=0,a=e.length-1;for(;o<a;){let n=o,r=a;const s=e[Math.floor(Math.random()*(a-o+1))+o];for(;n<r;)if(i(e[n],s)>=0){const t=e[r];e[r]=e[n],e[n]=t,--r}else++n;i(e[n],s)>0&&--n,t<=n?a=n:o=n+1}return e[t]}})),Fl="sort",Dl=de(Fl,["typed","matrix","compare","compareNatural"],(e=>{let{typed:t,matrix:n,compare:r,compareNatural:i}=e;const o=r,a=(e,t)=>-r(e,t);return t(Fl,{Array:function(e){return u(e),e.sort(o)},Matrix:function(e){return c(e),n(e.toArray().sort(o),e.storage())},"Array, function":function(e,t){return u(e),e.sort(t)},"Matrix, function":function(e,t){return c(e),n(e.toArray().sort(t),e.storage())},"Array, string":function(e,t){return u(e),e.sort(s(t))},"Matrix, string":function(e,t){return c(e),n(e.toArray().sort(s(t)),e.storage())}});function s(e){if("asc"===e)return o;if("desc"===e)return a;if("natural"===e)return i;throw new Error('String "asc", "desc", or "natural" expected')}function u(e){if(1!==wr(e).length)throw new Error("One dimensional array expected")}function c(e){if(1!==e.size().length)throw new Error("One dimensional matrix expected")}})),Ol=de("max",["typed","config","numeric","larger","isNaN"],(e=>{let{typed:t,config:n,numeric:r,larger:i,isNaN:o}=e;return t("max",{"Array | Matrix":s,"Array | Matrix, number | BigNumber":function(e,t){return ui(e,t.valueOf(),a)},"...":function(e){if(oi(e))throw new TypeError("Scalar values expected in function max");return s(e)}});function a(e,t){try{return i(e,t)?e:t}catch(e){throw Qu(e,"max",t)}}function s(e){let t;if(ai(e,(function(e){try{(o(e)||void 0===t||i(e,t))&&(t=e)}catch(t){throw Qu(t,"max",e)}})),void 0===t)throw new Error("Cannot calculate max of an empty array");return"string"==typeof t&&(t=r(t,xe(t,n))),t}})),_l=de("min",["typed","config","numeric","smaller","isNaN"],(e=>{let{typed:t,config:n,numeric:r,smaller:i,isNaN:o}=e;return t("min",{"Array | Matrix":s,"Array | Matrix, number | BigNumber":function(e,t){return ui(e,t.valueOf(),a)},"...":function(e){if(oi(e))throw new TypeError("Scalar values expected in function min");return s(e)}});function a(e,t){try{return i(e,t)?e:t}catch(e){throw Qu(e,"min",t)}}function s(e){let t;if(ai(e,(function(e){try{(o(e)||void 0===t||i(e,t))&&(t=e)}catch(t){throw Qu(t,"min",e)}})),void 0===t)throw new Error("Cannot calculate min of an empty array");return"string"==typeof t&&(t=r(t,xe(t,n))),t}})),zl=de("ImmutableDenseMatrix",["smaller","DenseMatrix"],(e=>{let{smaller:t,DenseMatrix:n}=e;function r(e,t){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");if(t&&!v(t))throw new Error("Invalid datatype: "+t);if(A(e)||N(e)){const r=new n(e,t);this._data=r._data,this._size=r._size,this._datatype=r._datatype,this._min=null,this._max=null}else if(e&&N(e.data)&&N(e.size))this._data=e.data,this._size=e.size,this._datatype=e.datatype,this._min=void 0!==e.min?e.min:null,this._max=void 0!==e.max?e.max:null;else{if(e)throw new TypeError("Unsupported type of data ("+oe(e)+")");this._data=[],this._size=[0],this._datatype=t,this._min=null,this._max=null}}return r.prototype=new n,r.prototype.type="ImmutableDenseMatrix",r.prototype.isImmutableDenseMatrix=!0,r.prototype.subset=function(e){switch(arguments.length){case 1:{const t=n.prototype.subset.call(this,e);return A(t)?new r({data:t._data,size:t._size,datatype:t._datatype}):t}case 2:case 3:throw new Error("Cannot invoke set subset on an Immutable Matrix instance");default:throw new SyntaxError("Wrong number of arguments")}},r.prototype.set=function(){throw new Error("Cannot invoke set on an Immutable Matrix instance")},r.prototype.resize=function(){throw new Error("Cannot invoke resize on an Immutable Matrix instance")},r.prototype.reshape=function(){throw new Error("Cannot invoke reshape on an Immutable Matrix instance")},r.prototype.clone=function(){return new r({data:ae(this._data),size:ae(this._size),datatype:this._datatype})},r.prototype.toJSON=function(){return{mathjs:"ImmutableDenseMatrix",data:this._data,size:this._size,datatype:this._datatype}},r.fromJSON=function(e){return new r(e)},r.prototype.swapRows=function(){throw new Error("Cannot invoke swapRows on an Immutable Matrix instance")},r.prototype.min=function(){if(null===this._min){let e=null;this.forEach((function(n){(null===e||t(n,e))&&(e=n)})),this._min=null!==e?e:void 0}return this._min},r.prototype.max=function(){if(null===this._max){let e=null;this.forEach((function(n){(null===e||t(e,n))&&(e=n)})),this._max=null!==e?e:void 0}return this._max},r}),{isClass:!0}),ql=de("Index",["ImmutableDenseMatrix","getMatrixDataType"],(e=>{let{ImmutableDenseMatrix:t,getMatrixDataType:n}=e;function r(e){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");this._dimensions=[],this._sourceSize=[],this._isScalar=!0;for(let e=0,t=arguments.length;e<t;e++){const t=arguments[e],r=N(t),o=A(t),a=typeof t;let s=null;if(C(t))this._dimensions.push(t),this._isScalar=!1;else if(r||o){let e;"boolean"===n(t)?(r&&(e=i(Il(t).valueOf())),o&&(e=i(Il(t._data).valueOf())),s=t.valueOf().length):e=i(t.valueOf()),this._dimensions.push(e);const a=e.size();1===a.length&&1===a[0]&&null===s||(this._isScalar=!1)}else if("number"===a)this._dimensions.push(i([t]));else if("bigint"===a)this._dimensions.push(i([Number(t)]));else{if("string"!==a)throw new TypeError("Dimension must be an Array, Matrix, number, bigint, string, or Range");this._dimensions.push(t)}this._sourceSize.push(s)}}function i(e){for(let t=0,n=e.length;t<n;t++)if("number"!=typeof e[t]||!ye(e[t]))throw new TypeError("Index parameters must be positive integer numbers");return new t(e)}return r.prototype.type="Index",r.prototype.isIndex=!0,r.prototype.clone=function(){const e=new r;return e._dimensions=ae(this._dimensions),e._isScalar=this._isScalar,e._sourceSize=this._sourceSize,e},r.create=function(e){const t=new r;return r.apply(t,e),t},r.prototype.size=function(){const e=[];for(let t=0,n=this._dimensions.length;t<n;t++){const n=this._dimensions[t];e[t]="string"==typeof n?1:n.size()[0]}return e},r.prototype.max=function(){const e=[];for(let t=0,n=this._dimensions.length;t<n;t++){const n=this._dimensions[t];e[t]="string"==typeof n?n:n.max()}return e},r.prototype.min=function(){const e=[];for(let t=0,n=this._dimensions.length;t<n;t++){const n=this._dimensions[t];e[t]="string"==typeof n?n:n.min()}return e},r.prototype.forEach=function(e){for(let t=0,n=this._dimensions.length;t<n;t++)e(this._dimensions[t],t,this)},r.prototype.dimension=function(e){return"number"!=typeof e?null:this._dimensions[e]||null},r.prototype.isObjectProperty=function(){return 1===this._dimensions.length&&"string"==typeof this._dimensions[0]},r.prototype.getObjectProperty=function(){return this.isObjectProperty()?this._dimensions[0]:null},r.prototype.isScalar=function(){return this._isScalar},r.prototype.toArray=function(){const e=[];for(let t=0,n=this._dimensions.length;t<n;t++){const n=this._dimensions[t];e.push("string"==typeof n?n:n.toArray())}return e},r.prototype.valueOf=r.prototype.toArray,r.prototype.toString=function(){const e=[];for(let t=0,n=this._dimensions.length;t<n;t++){const n=this._dimensions[t];"string"==typeof n?e.push(JSON.stringify(n)):e.push(n.toString())}return"["+e.join(", ")+"]"},r.prototype.toJSON=function(){return{mathjs:"Index",dimensions:this._dimensions}},r.fromJSON=function(e){return r.create(e.dimensions)},r}),{isClass:!0});function Il(e){const t=[];return e.forEach(((e,n)=>{e&&t.push(n)})),t}const kl=de("FibonacciHeap",["smaller","larger"],(e=>{let{smaller:t,larger:n}=e;const r=1/Math.log((1+Math.sqrt(5))/2);function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");this._minimum=null,this._size=0}function o(e,t,n){t.left.right=t.right,t.right.left=t.left,n.degree--,n.child===t&&(n.child=t.right),0===n.degree&&(n.child=null),t.left=e,t.right=e.right,e.right=t,t.right.left=t,t.parent=null,t.mark=!1}function a(e,t){const n=t.parent;n&&(t.mark?(o(e,t,n),a(n)):t.mark=!0)}i.prototype.type="FibonacciHeap",i.prototype.isFibonacciHeap=!0,i.prototype.insert=function(e,n){const r={key:e,value:n,degree:0};if(this._minimum){const n=this._minimum;r.left=n,r.right=n.right,n.right=r,r.right.left=r,t(e,n.key)&&(this._minimum=r)}else r.left=r,r.right=r,this._minimum=r;return this._size++,r},i.prototype.size=function(){return this._size},i.prototype.clear=function(){this._minimum=null,this._size=0},i.prototype.isEmpty=function(){return 0===this._size},i.prototype.extractMinimum=function(){const e=this._minimum;if(null===e)return e;let i=this._minimum,o=e.degree,a=e.child;for(;o>0;){const e=a.right;a.left.right=a.right,a.right.left=a.left,a.left=i,a.right=i.right,i.right=a,a.right.left=a,a.parent=null,a=e,o--}return e.left.right=e.right,e.right.left=e.left,e===e.right?i=null:(i=e.right,i=function(e,i){const o=Math.floor(Math.log(i)*r)+1,a=new Array(o);let u,c=0,l=e;if(l)for(c++,l=l.right;l!==e;)c++,l=l.right;for(;c>0;){let e=l.degree;const t=l.right;for(;u=a[e],u;){if(n(l.key,u.key)){const e=u;u=l,l=e}s(u,l),a[e]=null,e++}a[e]=l,l=t,c--}e=null;for(let n=0;n<o;n++)u=a[n],u&&(e?(u.left.right=u.right,u.right.left=u.left,u.left=e,u.right=e.right,e.right=u,u.right.left=u,t(u.key,e.key)&&(e=u)):e=u);return e}(i,this._size)),this._size--,this._minimum=i,e},i.prototype.remove=function(e){this._minimum=function(e,n){n.key=-1;const r=n.parent;return r&&t(n.key,r.key)&&(o(e,n,r),a(e,r)),t(n.key,e.key)&&(e=n),e}(this._minimum,e),this.extractMinimum()};const s=function(e,t){e.left.right=e.right,e.right.left=e.left,e.parent=t,t.child?(e.left=t.child,e.right=t.child.right,t.child.right=e,e.right.left=e):(t.child=e,e.right=e,e.left=e),t.degree++,e.mark=!1};return i}),{isClass:!0}),Rl=de("Spa",["addScalar","equalScalar","FibonacciHeap"],(e=>{let{addScalar:t,equalScalar:n,FibonacciHeap:r}=e;function i(){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");this._values=[],this._heap=new r}return i.prototype.type="Spa",i.prototype.isSpa=!0,i.prototype.set=function(e,t){if(this._values[e])this._values[e].value=t;else{const n=this._heap.insert(e,t);this._values[e]=n}},i.prototype.get=function(e){const t=this._values[e];return t?t.value:0},i.prototype.accumulate=function(e,n){let r=this._values[e];r?r.value=t(r.value,n):(r=this._heap.insert(e,n),this._values[e]=r)},i.prototype.forEach=function(e,t,r){const i=this._heap,o=this._values,a=[];let s=i.extractMinimum();for(s&&a.push(s);s&&s.key<=t;)s.key>=e&&(n(s.value,0)||r(s.key,s.value,this)),s=i.extractMinimum(),s&&a.push(s);for(let e=0;e<a.length;e++){const t=a[e];s=i.insert(t.key,t.value),o[s.key]=s}},i.prototype.swap=function(e,t){let n=this._values[e],r=this._values[t];if(!n&&r)n=this._heap.insert(e,r.value),this._heap.remove(r),this._values[e]=n,this._values[t]=void 0;else if(n&&!r)r=this._heap.insert(t,n.value),this._heap.remove(n),this._values[t]=r,this._values[e]=void 0;else if(n&&r){const e=n.value;n.value=r.value,r.value=e}},i}),{isClass:!0});function Pl(e){let t=0,n=1,r=Object.create(null),i=Object.create(null),o=0;const a=function(e){const a=i[e];if(a&&(delete r[a],delete i[e],--t,n===a)){if(!t)return o=0,void(n=1);for(;!Object.prototype.hasOwnProperty.call(r,++n););}};return e=Math.abs(e),{hit:function(s){const u=i[s],c=++o;if(r[c]=s,i[s]=c,!u){if(++t,t<=e)return;return s=r[n],a(s),s}if(delete r[u],n===u)for(;!Object.prototype.hasOwnProperty.call(r,++n););},delete:a,clear:function(){t=o=0,n=1,r=Object.create(null),i=Object.create(null)}}}function Ul(e){let{hasher:t,limit:n}=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};return n=null==n?Number.POSITIVE_INFINITY:n,t=null==t?JSON.stringify:t,function r(){"object"!=typeof r.cache&&(r.cache={values:new Map,lru:Pl(n||Number.POSITIVE_INFINITY)});const i=[];for(let e=0;e<arguments.length;e++)i[e]=arguments[e];const o=t(i);if(r.cache.values.has(o))return r.cache.lru.hit(o),r.cache.values.get(o);const a=e.apply(e,i);return r.cache.values.set(o,a),r.cache.values.delete(r.cache.lru.hit(o)),a}}const jl=Ul((function(e){return new e(1).exp()}),{hasher:Gl}),Ll=Ul((function(e){return new e(1).plus(new e(5).sqrt()).div(2)}),{hasher:Gl}),$l=Ul((function(e){return e.acos(-1)}),{hasher:Gl}),Hl=Ul((function(e){return $l(e).times(2)}),{hasher:Gl});function Gl(e){return e[0].precision}const Zl=de("Unit",["?on","config","addScalar","subtractScalar","multiplyScalar","divideScalar","pow","abs","fix","round","equal","isNumeric","format","toBest","number","Complex","BigNumber","Fraction"],(e=>{let{on:t,config:n,addScalar:r,subtractScalar:i,multiplyScalar:o,divideScalar:a,pow:s,abs:u,fix:c,round:l,equal:f,isNumeric:p,format:m,toBest:d,number:h,Complex:g,BigNumber:y,Fraction:b}=e;const v=h;function N(e,t){if(!(this instanceof N))throw new Error("Constructor must be called with the new operator");if(null!=e&&!p(e)&&!x(e))throw new TypeError("First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined");if(this.fixPrefix=!1,this.skipAutomaticSimplification=!0,void 0===t)this.units=[],this.dimensions=R.map((e=>0));else if("string"==typeof t){const e=N.parse(t);this.units=e.units,this.dimensions=e.dimensions}else{if(!w(t)||null!==t.value)throw new TypeError("Second parameter in Unit constructor must be a string or valueless Unit");this.fixPrefix=t.fixPrefix,this.skipAutomaticSimplification=t.skipAutomaticSimplification,this.dimensions=t.dimensions.slice(0),this.units=t.units.map((e=>sr({},e)))}this.value=this._normalize(e)}let A,E,S;function M(){for(;" "===S||"\t"===S;)T()}function C(e){return e>="0"&&e<="9"}function T(){E++,S=A.charAt(E)}function B(e){E=e,S=A.charAt(E)}function F(){let e="";const t=E;if("+"===S?T():"-"===S&&(e+=S,T()),!function(e){return e>="0"&&e<="9"||"."===e}(S))return B(t),null;if("."===S){if(e+=S,T(),!C(S))return B(t),null}else{for(;C(S);)e+=S,T();"."===S&&(e+=S,T())}for(;C(S);)e+=S,T();if("E"===S||"e"===S){let t="";const n=E;if(t+=S,T(),"+"!==S&&"-"!==S||(t+=S,T()),!C(S))return B(n),e;for(e+=t;C(S);)e+=S,T()}return e}function D(){let e="";for(;C(S)||N.isValidAlpha(S);)e+=S,T();const t=e.charAt(0);return N.isValidAlpha(t)?e:null}function O(e){return S===e?(T(),e):null}Object.defineProperty(N,"name",{value:"Unit"}),N.prototype.constructor=N,N.prototype.type="Unit",N.prototype.isUnit=!0,N.parse=function(e,t){if(t=t||{},A=e,E=-1,S="","string"!=typeof A)throw new TypeError("Invalid argument in Unit.parse, string expected");const r=new N;r.units=[];let i=1,o=!1;T(),M();const a=F();let s=null;if(a){if("BigNumber"===n.number)s=new y(a);else if("Fraction"===n.number)try{s=new b(a)}catch(e){s=parseFloat(a)}else s=parseFloat(a);M(),O("*")?(i=1,o=!0):O("/")&&(i=-1,o=!0)}const u=[];let c=1;for(;;){for(M();"("===S;)u.push(i),c*=i,i=1,T(),M();let t;if(!S)break;{const e=S;if(t=D(),null===t)throw new SyntaxError('Unexpected "'+e+'" in "'+A+'" at index '+E.toString())}const n=_(t);if(null===n)throw new SyntaxError('Unit "'+t+'" not found.');let a=i*c;if(M(),O("^")){M();const t=F();if(null===t)throw new SyntaxError('In "'+e+'", "^" must be followed by a floating-point number');a*=t}r.units.push({unit:n.unit,prefix:n.prefix,power:a});for(let e=0;e<R.length;e++)r.dimensions[e]+=(n.unit.dimensions[e]||0)*a;for(M();")"===S;){if(0===u.length)throw new SyntaxError('Unmatched ")" in "'+A+'" at index '+E.toString());c/=u.pop(),T(),M()}if(o=!1,O("*")?(i=1,o=!0):O("/")?(i=-1,o=!0):i=1,n.unit.base){const e=n.unit.base.key;H.auto[e]={unit:n.unit,prefix:n.prefix}}}if(M(),S)throw new SyntaxError('Could not parse: "'+e+'"');if(o)throw new SyntaxError('Trailing characters: "'+e+'"');if(0!==u.length)throw new SyntaxError('Unmatched "(" in "'+A+'"');if(0===r.units.length&&!t.allowNoUnits)throw new SyntaxError('"'+e+'" contains no units');return r.value=void 0!==s?r._normalize(s):null,r},N.prototype.clone=function(){const e=new N;e.fixPrefix=this.fixPrefix,e.skipAutomaticSimplification=this.skipAutomaticSimplification,e.value=ae(this.value),e.dimensions=this.dimensions.slice(0),e.units=[];for(let t=0;t<this.units.length;t++){e.units[t]={};for(const n in this.units[t])me(this.units[t],n)&&(e.units[t][n]=this.units[t][n])}return e},N.prototype.valueType=function(){return oe(this.value)},N.prototype._isDerived=function(){return 0!==this.units.length&&(this.units.length>1||Math.abs(this.units[0].power-1)>1e-15)},N.prototype._normalize=function(e){if(null==e||0===this.units.length)return e;let t=e;const n=N._getNumberConverter(oe(e));for(let e=0;e<this.units.length;e++){const r=n(this.units[e].unit.value),i=n(this.units[e].prefix.value),a=n(this.units[e].power);t=o(t,s(o(r,i),a))}return t},N.prototype._denormalize=function(e,t){if(null==e||0===this.units.length)return e;let n=e;const r=N._getNumberConverter(oe(e));for(let e=0;e<this.units.length;e++){const t=r(this.units[e].unit.value),i=r(this.units[e].prefix.value),u=r(this.units[e].power);n=a(n,s(o(t,i),u))}return n};const _=Ul((e=>{if(me(j,e)){const t=j[e];return{unit:t,prefix:t.prefixes[""]}}for(const t in j)if(me(j,t)&&fr(e,t)){const n=j[t],r=e.length-t.length,i=e.substring(0,r),o=me(n.prefixes,i)?n.prefixes[i]:void 0;if(void 0!==o)return{unit:n,prefix:o}}return null}),{hasher:e=>e[0],limit:100});function z(e){return e.equalBase(P.NONE)&&null!==e.value&&!n.predictable?e.value:e}function q(e){return N._getNumberConverter(oe(e))(1)}function I(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const n=e.skipAutomaticSimplification||null===e.value?e.clone():e.simplify();!function(e){let t=!1;void 0!==e.value&&null!==e.value&&x(e.value)&&(t=Math.abs(e.value.re)<1e-14);for(const n in e.units)me(e.units,n)&&e.units[n].unit&&("VA"===e.units[n].unit.name&&t?e.units[n].unit=j.VAR:"VAR"!==e.units[n].unit.name||t||(e.units[n].unit=j.VA))}(n),function(e,t){1!==e.units.length||e.fixPrefix||Math.abs(e.units[0].power-Math.round(e.units[0].power))<1e-14&&(e.units[0].prefix=e._bestPrefix(t))}(n,t.offset);const r=n._denormalize(n.value),i=null!==n.value?m(r,t||{}):"",o=n.formatUnits();return{simp:n,valueStr:i,unitStr:o}}N.isValuelessUnit=function(e){return null!==_(e)},N.prototype.hasBase=function(e){if("string"==typeof e&&(e=P[e]),!e)return!1;for(let t=0;t<R.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},N.prototype.equalBase=function(e){for(let t=0;t<R.length;t++)if(Math.abs((this.dimensions[t]||0)-(e.dimensions[t]||0))>1e-12)return!1;return!0},N.prototype.equals=function(e){return this.equalBase(e)&&f(this.value,e.value)},N.prototype.multiply=function(e){const t=this.clone(),n=w(e)?e:new N(e);for(let e=0;e<R.length;e++)t.dimensions[e]=(this.dimensions[e]||0)+(n.dimensions[e]||0);for(let e=0;e<n.units.length;e++){const r={...n.units[e]};t.units.push(r)}if(null!==this.value||null!==n.value){const e=null===this.value?this._normalize(q(n.value)):this.value,r=null===n.value?n._normalize(q(this.value)):n.value;t.value=o(e,r)}else t.value=null;return w(e)&&(t.skipAutomaticSimplification=!1),z(t)},N.prototype.divideInto=function(e){return new N(e).divide(this)},N.prototype.divide=function(e){const t=this.clone(),n=w(e)?e:new N(e);for(let e=0;e<R.length;e++)t.dimensions[e]=(this.dimensions[e]||0)-(n.dimensions[e]||0);for(let e=0;e<n.units.length;e++){const r={...n.units[e],power:-n.units[e].power};t.units.push(r)}if(null!==this.value||null!==n.value){const e=null===this.value?this._normalize(q(n.value)):this.value,r=null===n.value?n._normalize(q(this.value)):n.value;t.value=a(e,r)}else t.value=null;return w(e)&&(t.skipAutomaticSimplification=!1),z(t)},N.prototype.pow=function(e){const t=this.clone();for(let n=0;n<R.length;n++)t.dimensions[n]=(this.dimensions[n]||0)*e;for(let n=0;n<t.units.length;n++)t.units[n].power*=e;return null!==t.value?t.value=s(t.value,e):t.value=null,t.skipAutomaticSimplification=!1,z(t)},N.prototype.abs=function(){const e=this.clone();if(null!==e.value)if(e._isDerived()||0===e.units.length||0===e.units[0].unit.offset)e.value=u(e.value);else{const t=e._numberConverter(),n=t(e.units[0].unit.value),a=t(e.units[0].unit.offset),s=o(n,a);e.value=i(u(r(e.value,s)),s)}for(const t in e.units)"VA"!==e.units[t].unit.name&&"VAR"!==e.units[t].unit.name||(e.units[t].unit=j.W);return e},N.prototype.to=function(e){const t=null===this.value?this._normalize(1):this.value;let n;if("string"==typeof e)n=N.parse(e);else{if(!w(e))throw new Error("String or Unit expected as parameter");n=e.clone()}if(!this.equalBase(n))throw new Error(`Units do not match ('${n.toString()}' != '${this.toString()}')`);if(null!==n.value)throw new Error("Cannot convert to a unit with a value");if(null===this.value||this._isDerived()||0===this.units.length||0===n.units.length||this.units[0].unit.offset===n.units[0].unit.offset)n.value=ae(t);else{const e=N._getNumberConverter(oe(t)),a=this.units[0].unit.value,s=this.units[0].unit.offset,u=o(a,s),c=n.units[0].unit.value,l=n.units[0].unit.offset,f=o(c,l);n.value=r(t,e(i(u,f)))}return n.fixPrefix=!0,n.skipAutomaticSimplification=!0,n},N.prototype.toNumber=function(e){return v(this.toNumeric(e))},N.prototype.toNumeric=function(e){let t;return t=e?this.to(e):this.clone(),t._isDerived()||0===t.units.length?t._denormalize(t.value):t._denormalize(t.value,t.units[0].prefix.value)},N.prototype.toString=function(){return this.format()},N.prototype.toJSON=function(){return{mathjs:"Unit",value:this._denormalize(this.value),unit:this.units.length>0?this.formatUnits():null,fixPrefix:this.fixPrefix}},N.fromJSON=function(e){var t;const n=new N(e.value,null!==(t=e.unit)&&void 0!==t?t:void 0);return n.fixPrefix=e.fixPrefix||!1,n},N.prototype.valueOf=N.prototype.toString,N.prototype.simplify=function(){const e=this.clone(),t=[];let n;for(const t in G)if(me(G,t)&&e.hasBase(P[t])){n=t;break}if("NONE"===n)e.units=[];else{let r;if(n&&me(G,n)&&(r=G[n]),r)e.units=[{unit:r.unit,prefix:r.prefix,power:1}];else{let n=!1;for(let r=0;r<R.length;r++){const i=R[r];Math.abs(e.dimensions[r]||0)>1e-12&&(me(G,i)?t.push({unit:G[i].unit,prefix:G[i].prefix,power:e.dimensions[r]||0}):n=!0)}t.length<e.units.length&&!n&&(e.units=t)}}return e},N.prototype.toSI=function(){const e=this.clone(),t=[];for(let n=0;n<R.length;n++){const r=R[n];if(Math.abs(e.dimensions[n]||0)>1e-12){if(!me(H.si,r))throw new Error("Cannot express custom unit "+r+" in SI units");t.push({unit:H.si[r].unit,prefix:H.si[r].prefix,power:e.dimensions[n]||0})}}return e.units=t,e.fixPrefix=!0,e.skipAutomaticSimplification=!0,null!==this.value?(e.value=null,this.to(e)):e},N.prototype.formatUnits=function(){let e="",t="",n=0,r=0;for(let t=0;t<this.units.length;t++)this.units[t].power>0?(n++,e+=" "+this.units[t].prefix.name+this.units[t].unit.name,Math.abs(this.units[t].power-1)>1e-15&&(e+="^"+this.units[t].power)):this.units[t].power<0&&r++;if(r>0)for(let e=0;e<this.units.length;e++)this.units[e].power<0&&(n>0?(t+=" "+this.units[e].prefix.name+this.units[e].unit.name,Math.abs(this.units[e].power+1)>1e-15&&(t+="^"+-this.units[e].power)):(t+=" "+this.units[e].prefix.name+this.units[e].unit.name,t+="^"+this.units[e].power));e=e.substr(1),t=t.substr(1),n>1&&r>0&&(e="("+e+")"),r>1&&n>0&&(t="("+t+")");let i=e;return n>0&&r>0&&(i+=" / "),i+=t,i},N.prototype.toBest=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[],t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(e&&!Array.isArray(e))throw new Error("Invalid unit type. Expected string or Unit.");const n=this.units[0].unit.prefixes;if(e&&e.length>0){const t=e.map((e=>{let t=null;if("string"==typeof e){if(t=N.parse(e),!t)throw new Error("Invalid unit type. Expected compatible string or Unit.")}else if(!w(e))throw new Error("Invalid unit type. Expected compatible string or Unit.");null===t&&(t=e.clone());try{return this.to(t.formatUnits()),t}catch(e){throw new Error("Invalid unit type. Expected compatible string or Unit.")}})).map((e=>e.units[0].prefix));this.units[0].unit.prefixes=t.reduce(((e,t)=>(e[t.name]=t,e)),{}),this.units[0].prefix=t[0]}const r=I(this,t).simp;return this.units[0].unit.prefixes=n,r.fixPrefix=!0,r},N.prototype.format=function(e){const{simp:t,valueStr:n,unitStr:r}=I(this,e);let i=n;return t.value&&x(t.value)&&(i="("+i+")"),r.length>0&&i.length>0&&(i+=" "),i+=r,i},N.prototype._bestPrefix=function(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:1.2;if(1!==this.units.length)throw new Error("Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!");if(Math.abs(this.units[0].power-Math.round(this.units[0].power))>=1e-14)throw new Error("Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!");const t=null!==this.value?u(this.value):0,n=u(this.units[0].unit.value);let r=this.units[0].prefix;if(0===t)return r;const i=this.units[0].power;let o=Math.log(t/Math.pow(r.value*n,i))/Math.LN10-e;if(o>-2.200001&&o<1.800001)return r;o=Math.abs(o);const a=this.units[0].unit.prefixes;for(const s in a)if(me(a,s)){const u=a[s];if(u.scientific){const a=Math.abs(Math.log(t/Math.pow(u.value*n,i))/Math.LN10-e);(a<o||a===o&&u.name.length<r.name.length)&&(r=u,o=a)}}return r},N.prototype.splitUnit=function(e){let t=this.clone();const n=[];for(let r=0;r<e.length&&(t=t.to(e[r]),r!==e.length-1);r++){const o=t.toNumeric(),a=l(o);let s;s=f(a,o)?a:c(t.toNumeric());const u=new N(s,e[r].toString());n.push(u),t=i(t,u)}let o=0;for(let e=0;e<n.length;e++)o=r(o,n[e].value);return f(o,this.value)&&(t.value=0),n.push(t),n};const k={NONE:{"":{name:"",value:1,scientific:!0}},SHORT:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:10,scientific:!1},h:{name:"h",value:100,scientific:!1},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0},R:{name:"R",value:1e27,scientific:!0},Q:{name:"Q",value:1e30,scientific:!0},d:{name:"d",value:.1,scientific:!1},c:{name:"c",value:.01,scientific:!1},m:{name:"m",value:.001,scientific:!0},u:{name:"u",value:1e-6,scientific:!0},n:{name:"n",value:1e-9,scientific:!0},p:{name:"p",value:1e-12,scientific:!0},f:{name:"f",value:1e-15,scientific:!0},a:{name:"a",value:1e-18,scientific:!0},z:{name:"z",value:1e-21,scientific:!0},y:{name:"y",value:1e-24,scientific:!0},r:{name:"r",value:1e-27,scientific:!0},q:{name:"q",value:1e-30,scientific:!0}},LONG:{"":{name:"",value:1,scientific:!0},deca:{name:"deca",value:10,scientific:!1},hecto:{name:"hecto",value:100,scientific:!1},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0},ronna:{name:"ronna",value:1e27,scientific:!0},quetta:{name:"quetta",value:1e30,scientific:!0},deci:{name:"deci",value:.1,scientific:!1},centi:{name:"centi",value:.01,scientific:!1},milli:{name:"milli",value:.001,scientific:!0},micro:{name:"micro",value:1e-6,scientific:!0},nano:{name:"nano",value:1e-9,scientific:!0},pico:{name:"pico",value:1e-12,scientific:!0},femto:{name:"femto",value:1e-15,scientific:!0},atto:{name:"atto",value:1e-18,scientific:!0},zepto:{name:"zepto",value:1e-21,scientific:!0},yocto:{name:"yocto",value:1e-24,scientific:!0},ronto:{name:"ronto",value:1e-27,scientific:!0},quecto:{name:"quecto",value:1e-30,scientific:!0}},SQUARED:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:100,scientific:!1},h:{name:"h",value:1e4,scientific:!1},k:{name:"k",value:1e6,scientific:!0},M:{name:"M",value:1e12,scientific:!0},G:{name:"G",value:1e18,scientific:!0},T:{name:"T",value:1e24,scientific:!0},P:{name:"P",value:1e30,scientific:!0},E:{name:"E",value:1e36,scientific:!0},Z:{name:"Z",value:1e42,scientific:!0},Y:{name:"Y",value:1e48,scientific:!0},R:{name:"R",value:1e54,scientific:!0},Q:{name:"Q",value:1e60,scientific:!0},d:{name:"d",value:.01,scientific:!1},c:{name:"c",value:1e-4,scientific:!1},m:{name:"m",value:1e-6,scientific:!0},u:{name:"u",value:1e-12,scientific:!0},n:{name:"n",value:1e-18,scientific:!0},p:{name:"p",value:1e-24,scientific:!0},f:{name:"f",value:1e-30,scientific:!0},a:{name:"a",value:1e-36,scientific:!0},z:{name:"z",value:1e-42,scientific:!0},y:{name:"y",value:1e-48,scientific:!0},r:{name:"r",value:1e-54,scientific:!0},q:{name:"q",value:1e-60,scientific:!0}},CUBIC:{"":{name:"",value:1,scientific:!0},da:{name:"da",value:1e3,scientific:!1},h:{name:"h",value:1e6,scientific:!1},k:{name:"k",value:1e9,scientific:!0},M:{name:"M",value:1e18,scientific:!0},G:{name:"G",value:1e27,scientific:!0},T:{name:"T",value:1e36,scientific:!0},P:{name:"P",value:1e45,scientific:!0},E:{name:"E",value:1e54,scientific:!0},Z:{name:"Z",value:1e63,scientific:!0},Y:{name:"Y",value:1e72,scientific:!0},R:{name:"R",value:1e81,scientific:!0},Q:{name:"Q",value:1e90,scientific:!0},d:{name:"d",value:.001,scientific:!1},c:{name:"c",value:1e-6,scientific:!1},m:{name:"m",value:1e-9,scientific:!0},u:{name:"u",value:1e-18,scientific:!0},n:{name:"n",value:1e-27,scientific:!0},p:{name:"p",value:1e-36,scientific:!0},f:{name:"f",value:1e-45,scientific:!0},a:{name:"a",value:1e-54,scientific:!0},z:{name:"z",value:1e-63,scientific:!0},y:{name:"y",value:1e-72,scientific:!0},r:{name:"r",value:1e-81,scientific:!0},q:{name:"q",value:1e-90,scientific:!0}},BINARY_SHORT_SI:{"":{name:"",value:1,scientific:!0},k:{name:"k",value:1e3,scientific:!0},M:{name:"M",value:1e6,scientific:!0},G:{name:"G",value:1e9,scientific:!0},T:{name:"T",value:1e12,scientific:!0},P:{name:"P",value:1e15,scientific:!0},E:{name:"E",value:1e18,scientific:!0},Z:{name:"Z",value:1e21,scientific:!0},Y:{name:"Y",value:1e24,scientific:!0}},BINARY_SHORT_IEC:{"":{name:"",value:1,scientific:!0},Ki:{name:"Ki",value:1024,scientific:!0},Mi:{name:"Mi",value:Math.pow(1024,2),scientific:!0},Gi:{name:"Gi",value:Math.pow(1024,3),scientific:!0},Ti:{name:"Ti",value:Math.pow(1024,4),scientific:!0},Pi:{name:"Pi",value:Math.pow(1024,5),scientific:!0},Ei:{name:"Ei",value:Math.pow(1024,6),scientific:!0},Zi:{name:"Zi",value:Math.pow(1024,7),scientific:!0},Yi:{name:"Yi",value:Math.pow(1024,8),scientific:!0}},BINARY_LONG_SI:{"":{name:"",value:1,scientific:!0},kilo:{name:"kilo",value:1e3,scientific:!0},mega:{name:"mega",value:1e6,scientific:!0},giga:{name:"giga",value:1e9,scientific:!0},tera:{name:"tera",value:1e12,scientific:!0},peta:{name:"peta",value:1e15,scientific:!0},exa:{name:"exa",value:1e18,scientific:!0},zetta:{name:"zetta",value:1e21,scientific:!0},yotta:{name:"yotta",value:1e24,scientific:!0}},BINARY_LONG_IEC:{"":{name:"",value:1,scientific:!0},kibi:{name:"kibi",value:1024,scientific:!0},mebi:{name:"mebi",value:Math.pow(1024,2),scientific:!0},gibi:{name:"gibi",value:Math.pow(1024,3),scientific:!0},tebi:{name:"tebi",value:Math.pow(1024,4),scientific:!0},pebi:{name:"pebi",value:Math.pow(1024,5),scientific:!0},exi:{name:"exi",value:Math.pow(1024,6),scientific:!0},zebi:{name:"zebi",value:Math.pow(1024,7),scientific:!0},yobi:{name:"yobi",value:Math.pow(1024,8),scientific:!0}},BTU:{"":{name:"",value:1,scientific:!0},MM:{name:"MM",value:1e6,scientific:!0}}};k.SHORTLONG=sr({},k.SHORT,k.LONG),k.BINARY_SHORT=sr({},k.BINARY_SHORT_SI,k.BINARY_SHORT_IEC),k.BINARY_LONG=sr({},k.BINARY_LONG_SI,k.BINARY_LONG_IEC);const R=["MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","ANGLE","BIT"],P={NONE:{dimensions:[0,0,0,0,0,0,0,0,0]},MASS:{dimensions:[1,0,0,0,0,0,0,0,0]},LENGTH:{dimensions:[0,1,0,0,0,0,0,0,0]},TIME:{dimensions:[0,0,1,0,0,0,0,0,0]},CURRENT:{dimensions:[0,0,0,1,0,0,0,0,0]},TEMPERATURE:{dimensions:[0,0,0,0,1,0,0,0,0]},LUMINOUS_INTENSITY:{dimensions:[0,0,0,0,0,1,0,0,0]},AMOUNT_OF_SUBSTANCE:{dimensions:[0,0,0,0,0,0,1,0,0]},FORCE:{dimensions:[1,1,-2,0,0,0,0,0,0]},SURFACE:{dimensions:[0,2,0,0,0,0,0,0,0]},VOLUME:{dimensions:[0,3,0,0,0,0,0,0,0]},ENERGY:{dimensions:[1,2,-2,0,0,0,0,0,0]},POWER:{dimensions:[1,2,-3,0,0,0,0,0,0]},PRESSURE:{dimensions:[1,-1,-2,0,0,0,0,0,0]},ELECTRIC_CHARGE:{dimensions:[0,0,1,1,0,0,0,0,0]},ELECTRIC_CAPACITANCE:{dimensions:[-1,-2,4,2,0,0,0,0,0]},ELECTRIC_POTENTIAL:{dimensions:[1,2,-3,-1,0,0,0,0,0]},ELECTRIC_RESISTANCE:{dimensions:[1,2,-3,-2,0,0,0,0,0]},ELECTRIC_INDUCTANCE:{dimensions:[1,2,-2,-2,0,0,0,0,0]},ELECTRIC_CONDUCTANCE:{dimensions:[-1,-2,3,2,0,0,0,0,0]},MAGNETIC_FLUX:{dimensions:[1,2,-2,-1,0,0,0,0,0]},MAGNETIC_FLUX_DENSITY:{dimensions:[1,0,-2,-1,0,0,0,0,0]},FREQUENCY:{dimensions:[0,0,-1,0,0,0,0,0,0]},ANGLE:{dimensions:[0,0,0,0,0,0,0,1,0]},BIT:{dimensions:[0,0,0,0,0,0,0,0,1]}};for(const e in P)me(P,e)&&(P[e].key=e);const U={name:"",base:{},value:1,offset:0,dimensions:R.map((e=>0))},j={meter:{name:"meter",base:P.LENGTH,prefixes:k.LONG,value:1,offset:0},inch:{name:"inch",base:P.LENGTH,prefixes:k.NONE,value:.0254,offset:0},foot:{name:"foot",base:P.LENGTH,prefixes:k.NONE,value:.3048,offset:0},yard:{name:"yard",base:P.LENGTH,prefixes:k.NONE,value:.9144,offset:0},mile:{name:"mile",base:P.LENGTH,prefixes:k.NONE,value:1609.344,offset:0},link:{name:"link",base:P.LENGTH,prefixes:k.NONE,value:.201168,offset:0},rod:{name:"rod",base:P.LENGTH,prefixes:k.NONE,value:5.0292,offset:0},chain:{name:"chain",base:P.LENGTH,prefixes:k.NONE,value:20.1168,offset:0},angstrom:{name:"angstrom",base:P.LENGTH,prefixes:k.NONE,value:1e-10,offset:0},m:{name:"m",base:P.LENGTH,prefixes:k.SHORT,value:1,offset:0},in:{name:"in",base:P.LENGTH,prefixes:k.NONE,value:.0254,offset:0},ft:{name:"ft",base:P.LENGTH,prefixes:k.NONE,value:.3048,offset:0},yd:{name:"yd",base:P.LENGTH,prefixes:k.NONE,value:.9144,offset:0},mi:{name:"mi",base:P.LENGTH,prefixes:k.NONE,value:1609.344,offset:0},li:{name:"li",base:P.LENGTH,prefixes:k.NONE,value:.201168,offset:0},rd:{name:"rd",base:P.LENGTH,prefixes:k.NONE,value:5.02921,offset:0},ch:{name:"ch",base:P.LENGTH,prefixes:k.NONE,value:20.1168,offset:0},mil:{name:"mil",base:P.LENGTH,prefixes:k.NONE,value:254e-7,offset:0},m2:{name:"m2",base:P.SURFACE,prefixes:k.SQUARED,value:1,offset:0},sqin:{name:"sqin",base:P.SURFACE,prefixes:k.NONE,value:64516e-8,offset:0},sqft:{name:"sqft",base:P.SURFACE,prefixes:k.NONE,value:.09290304,offset:0},sqyd:{name:"sqyd",base:P.SURFACE,prefixes:k.NONE,value:.83612736,offset:0},sqmi:{name:"sqmi",base:P.SURFACE,prefixes:k.NONE,value:2589988.110336,offset:0},sqrd:{name:"sqrd",base:P.SURFACE,prefixes:k.NONE,value:25.29295,offset:0},sqch:{name:"sqch",base:P.SURFACE,prefixes:k.NONE,value:404.6873,offset:0},sqmil:{name:"sqmil",base:P.SURFACE,prefixes:k.NONE,value:6.4516e-10,offset:0},acre:{name:"acre",base:P.SURFACE,prefixes:k.NONE,value:4046.86,offset:0},hectare:{name:"hectare",base:P.SURFACE,prefixes:k.NONE,value:1e4,offset:0},m3:{name:"m3",base:P.VOLUME,prefixes:k.CUBIC,value:1,offset:0},L:{name:"L",base:P.VOLUME,prefixes:k.SHORT,value:.001,offset:0},l:{name:"l",base:P.VOLUME,prefixes:k.SHORT,value:.001,offset:0},litre:{name:"litre",base:P.VOLUME,prefixes:k.LONG,value:.001,offset:0},cuin:{name:"cuin",base:P.VOLUME,prefixes:k.NONE,value:16387064e-12,offset:0},cuft:{name:"cuft",base:P.VOLUME,prefixes:k.NONE,value:.028316846592,offset:0},cuyd:{name:"cuyd",base:P.VOLUME,prefixes:k.NONE,value:.764554857984,offset:0},teaspoon:{name:"teaspoon",base:P.VOLUME,prefixes:k.NONE,value:5e-6,offset:0},tablespoon:{name:"tablespoon",base:P.VOLUME,prefixes:k.NONE,value:15e-6,offset:0},drop:{name:"drop",base:P.VOLUME,prefixes:k.NONE,value:5e-8,offset:0},gtt:{name:"gtt",base:P.VOLUME,prefixes:k.NONE,value:5e-8,offset:0},minim:{name:"minim",base:P.VOLUME,prefixes:k.NONE,value:6.1611519921875e-8,offset:0},fluiddram:{name:"fluiddram",base:P.VOLUME,prefixes:k.NONE,value:36966911953125e-19,offset:0},fluidounce:{name:"fluidounce",base:P.VOLUME,prefixes:k.NONE,value:295735295625e-16,offset:0},gill:{name:"gill",base:P.VOLUME,prefixes:k.NONE,value:.00011829411825,offset:0},cc:{name:"cc",base:P.VOLUME,prefixes:k.NONE,value:1e-6,offset:0},cup:{name:"cup",base:P.VOLUME,prefixes:k.NONE,value:.0002365882365,offset:0},pint:{name:"pint",base:P.VOLUME,prefixes:k.NONE,value:.000473176473,offset:0},quart:{name:"quart",base:P.VOLUME,prefixes:k.NONE,value:.000946352946,offset:0},gallon:{name:"gallon",base:P.VOLUME,prefixes:k.NONE,value:.003785411784,offset:0},beerbarrel:{name:"beerbarrel",base:P.VOLUME,prefixes:k.NONE,value:.117347765304,offset:0},oilbarrel:{name:"oilbarrel",base:P.VOLUME,prefixes:k.NONE,value:.158987294928,offset:0},hogshead:{name:"hogshead",base:P.VOLUME,prefixes:k.NONE,value:.238480942392,offset:0},g:{name:"g",base:P.MASS,prefixes:k.SHORT,value:.001,offset:0},gram:{name:"gram",base:P.MASS,prefixes:k.LONG,value:.001,offset:0},ton:{name:"ton",base:P.MASS,prefixes:k.SHORT,value:907.18474,offset:0},t:{name:"t",base:P.MASS,prefixes:k.SHORT,value:1e3,offset:0},tonne:{name:"tonne",base:P.MASS,prefixes:k.LONG,value:1e3,offset:0},grain:{name:"grain",base:P.MASS,prefixes:k.NONE,value:6479891e-11,offset:0},dram:{name:"dram",base:P.MASS,prefixes:k.NONE,value:.0017718451953125,offset:0},ounce:{name:"ounce",base:P.MASS,prefixes:k.NONE,value:.028349523125,offset:0},poundmass:{name:"poundmass",base:P.MASS,prefixes:k.NONE,value:.45359237,offset:0},hundredweight:{name:"hundredweight",base:P.MASS,prefixes:k.NONE,value:45.359237,offset:0},stick:{name:"stick",base:P.MASS,prefixes:k.NONE,value:.115,offset:0},stone:{name:"stone",base:P.MASS,prefixes:k.NONE,value:6.35029318,offset:0},gr:{name:"gr",base:P.MASS,prefixes:k.NONE,value:6479891e-11,offset:0},dr:{name:"dr",base:P.MASS,prefixes:k.NONE,value:.0017718451953125,offset:0},oz:{name:"oz",base:P.MASS,prefixes:k.NONE,value:.028349523125,offset:0},lbm:{name:"lbm",base:P.MASS,prefixes:k.NONE,value:.45359237,offset:0},cwt:{name:"cwt",base:P.MASS,prefixes:k.NONE,value:45.359237,offset:0},s:{name:"s",base:P.TIME,prefixes:k.SHORT,value:1,offset:0},min:{name:"min",base:P.TIME,prefixes:k.NONE,value:60,offset:0},h:{name:"h",base:P.TIME,prefixes:k.NONE,value:3600,offset:0},second:{name:"second",base:P.TIME,prefixes:k.LONG,value:1,offset:0},sec:{name:"sec",base:P.TIME,prefixes:k.LONG,value:1,offset:0},minute:{name:"minute",base:P.TIME,prefixes:k.NONE,value:60,offset:0},hour:{name:"hour",base:P.TIME,prefixes:k.NONE,value:3600,offset:0},day:{name:"day",base:P.TIME,prefixes:k.NONE,value:86400,offset:0},week:{name:"week",base:P.TIME,prefixes:k.NONE,value:604800,offset:0},month:{name:"month",base:P.TIME,prefixes:k.NONE,value:2629800,offset:0},year:{name:"year",base:P.TIME,prefixes:k.NONE,value:31557600,offset:0},decade:{name:"decade",base:P.TIME,prefixes:k.NONE,value:315576e3,offset:0},century:{name:"century",base:P.TIME,prefixes:k.NONE,value:315576e4,offset:0},millennium:{name:"millennium",base:P.TIME,prefixes:k.NONE,value:315576e5,offset:0},hertz:{name:"Hertz",base:P.FREQUENCY,prefixes:k.LONG,value:1,offset:0,reciprocal:!0},Hz:{name:"Hz",base:P.FREQUENCY,prefixes:k.SHORT,value:1,offset:0,reciprocal:!0},rad:{name:"rad",base:P.ANGLE,prefixes:k.SHORT,value:1,offset:0},radian:{name:"radian",base:P.ANGLE,prefixes:k.LONG,value:1,offset:0},deg:{name:"deg",base:P.ANGLE,prefixes:k.SHORT,value:null,offset:0},degree:{name:"degree",base:P.ANGLE,prefixes:k.LONG,value:null,offset:0},grad:{name:"grad",base:P.ANGLE,prefixes:k.SHORT,value:null,offset:0},gradian:{name:"gradian",base:P.ANGLE,prefixes:k.LONG,value:null,offset:0},cycle:{name:"cycle",base:P.ANGLE,prefixes:k.NONE,value:null,offset:0},arcsec:{name:"arcsec",base:P.ANGLE,prefixes:k.NONE,value:null,offset:0},arcmin:{name:"arcmin",base:P.ANGLE,prefixes:k.NONE,value:null,offset:0},A:{name:"A",base:P.CURRENT,prefixes:k.SHORT,value:1,offset:0},ampere:{name:"ampere",base:P.CURRENT,prefixes:k.LONG,value:1,offset:0},K:{name:"K",base:P.TEMPERATURE,prefixes:k.SHORT,value:1,offset:0},degC:{name:"degC",base:P.TEMPERATURE,prefixes:k.SHORT,value:1,offset:273.15},degF:{name:"degF",base:P.TEMPERATURE,prefixes:k.SHORT,value:new b(5,9),offset:459.67},degR:{name:"degR",base:P.TEMPERATURE,prefixes:k.SHORT,value:new b(5,9),offset:0},kelvin:{name:"kelvin",base:P.TEMPERATURE,prefixes:k.LONG,value:1,offset:0},celsius:{name:"celsius",base:P.TEMPERATURE,prefixes:k.LONG,value:1,offset:273.15},fahrenheit:{name:"fahrenheit",base:P.TEMPERATURE,prefixes:k.LONG,value:new b(5,9),offset:459.67},rankine:{name:"rankine",base:P.TEMPERATURE,prefixes:k.LONG,value:new b(5,9),offset:0},mol:{name:"mol",base:P.AMOUNT_OF_SUBSTANCE,prefixes:k.SHORT,value:1,offset:0},mole:{name:"mole",base:P.AMOUNT_OF_SUBSTANCE,prefixes:k.LONG,value:1,offset:0},cd:{name:"cd",base:P.LUMINOUS_INTENSITY,prefixes:k.SHORT,value:1,offset:0},candela:{name:"candela",base:P.LUMINOUS_INTENSITY,prefixes:k.LONG,value:1,offset:0},N:{name:"N",base:P.FORCE,prefixes:k.SHORT,value:1,offset:0},newton:{name:"newton",base:P.FORCE,prefixes:k.LONG,value:1,offset:0},dyn:{name:"dyn",base:P.FORCE,prefixes:k.SHORT,value:1e-5,offset:0},dyne:{name:"dyne",base:P.FORCE,prefixes:k.LONG,value:1e-5,offset:0},lbf:{name:"lbf",base:P.FORCE,prefixes:k.NONE,value:4.4482216152605,offset:0},poundforce:{name:"poundforce",base:P.FORCE,prefixes:k.NONE,value:4.4482216152605,offset:0},kip:{name:"kip",base:P.FORCE,prefixes:k.LONG,value:4448.2216,offset:0},kilogramforce:{name:"kilogramforce",base:P.FORCE,prefixes:k.NONE,value:9.80665,offset:0},J:{name:"J",base:P.ENERGY,prefixes:k.SHORT,value:1,offset:0},joule:{name:"joule",base:P.ENERGY,prefixes:k.LONG,value:1,offset:0},erg:{name:"erg",base:P.ENERGY,prefixes:k.SHORTLONG,value:1e-7,offset:0},Wh:{name:"Wh",base:P.ENERGY,prefixes:k.SHORT,value:3600,offset:0},BTU:{name:"BTU",base:P.ENERGY,prefixes:k.BTU,value:1055.05585262,offset:0},eV:{name:"eV",base:P.ENERGY,prefixes:k.SHORT,value:1602176565e-28,offset:0},electronvolt:{name:"electronvolt",base:P.ENERGY,prefixes:k.LONG,value:1602176565e-28,offset:0},W:{name:"W",base:P.POWER,prefixes:k.SHORT,value:1,offset:0},watt:{name:"watt",base:P.POWER,prefixes:k.LONG,value:1,offset:0},hp:{name:"hp",base:P.POWER,prefixes:k.NONE,value:745.6998715386,offset:0},VAR:{name:"VAR",base:P.POWER,prefixes:k.SHORT,value:g.I,offset:0},VA:{name:"VA",base:P.POWER,prefixes:k.SHORT,value:1,offset:0},Pa:{name:"Pa",base:P.PRESSURE,prefixes:k.SHORT,value:1,offset:0},psi:{name:"psi",base:P.PRESSURE,prefixes:k.NONE,value:6894.75729276459,offset:0},atm:{name:"atm",base:P.PRESSURE,prefixes:k.NONE,value:101325,offset:0},bar:{name:"bar",base:P.PRESSURE,prefixes:k.SHORTLONG,value:1e5,offset:0},torr:{name:"torr",base:P.PRESSURE,prefixes:k.NONE,value:133.322,offset:0},mmHg:{name:"mmHg",base:P.PRESSURE,prefixes:k.NONE,value:133.322,offset:0},mmH2O:{name:"mmH2O",base:P.PRESSURE,prefixes:k.NONE,value:9.80665,offset:0},cmH2O:{name:"cmH2O",base:P.PRESSURE,prefixes:k.NONE,value:98.0665,offset:0},coulomb:{name:"coulomb",base:P.ELECTRIC_CHARGE,prefixes:k.LONG,value:1,offset:0},C:{name:"C",base:P.ELECTRIC_CHARGE,prefixes:k.SHORT,value:1,offset:0},farad:{name:"farad",base:P.ELECTRIC_CAPACITANCE,prefixes:k.LONG,value:1,offset:0},F:{name:"F",base:P.ELECTRIC_CAPACITANCE,prefixes:k.SHORT,value:1,offset:0},volt:{name:"volt",base:P.ELECTRIC_POTENTIAL,prefixes:k.LONG,value:1,offset:0},V:{name:"V",base:P.ELECTRIC_POTENTIAL,prefixes:k.SHORT,value:1,offset:0},ohm:{name:"ohm",base:P.ELECTRIC_RESISTANCE,prefixes:k.SHORTLONG,value:1,offset:0},henry:{name:"henry",base:P.ELECTRIC_INDUCTANCE,prefixes:k.LONG,value:1,offset:0},H:{name:"H",base:P.ELECTRIC_INDUCTANCE,prefixes:k.SHORT,value:1,offset:0},siemens:{name:"siemens",base:P.ELECTRIC_CONDUCTANCE,prefixes:k.LONG,value:1,offset:0},S:{name:"S",base:P.ELECTRIC_CONDUCTANCE,prefixes:k.SHORT,value:1,offset:0},weber:{name:"weber",base:P.MAGNETIC_FLUX,prefixes:k.LONG,value:1,offset:0},Wb:{name:"Wb",base:P.MAGNETIC_FLUX,prefixes:k.SHORT,value:1,offset:0},tesla:{name:"tesla",base:P.MAGNETIC_FLUX_DENSITY,prefixes:k.LONG,value:1,offset:0},T:{name:"T",base:P.MAGNETIC_FLUX_DENSITY,prefixes:k.SHORT,value:1,offset:0},b:{name:"b",base:P.BIT,prefixes:k.BINARY_SHORT,value:1,offset:0},bits:{name:"bits",base:P.BIT,prefixes:k.BINARY_LONG,value:1,offset:0},B:{name:"B",base:P.BIT,prefixes:k.BINARY_SHORT,value:8,offset:0},bytes:{name:"bytes",base:P.BIT,prefixes:k.BINARY_LONG,value:8,offset:0}},L={meters:"meter",inches:"inch",feet:"foot",yards:"yard",miles:"mile",links:"link",rods:"rod",chains:"chain",angstroms:"angstrom",lt:"l",litres:"litre",liter:"litre",liters:"litre",teaspoons:"teaspoon",tablespoons:"tablespoon",minims:"minim",fldr:"fluiddram",fluiddrams:"fluiddram",floz:"fluidounce",fluidounces:"fluidounce",gi:"gill",gills:"gill",cp:"cup",cups:"cup",pt:"pint",pints:"pint",qt:"quart",quarts:"quart",gal:"gallon",gallons:"gallon",bbl:"beerbarrel",beerbarrels:"beerbarrel",obl:"oilbarrel",oilbarrels:"oilbarrel",hogsheads:"hogshead",gtts:"gtt",grams:"gram",tons:"ton",tonnes:"tonne",grains:"grain",drams:"dram",ounces:"ounce",poundmasses:"poundmass",hundredweights:"hundredweight",sticks:"stick",lb:"lbm",lbs:"lbm",kips:"kip",kgf:"kilogramforce",acres:"acre",hectares:"hectare",sqfeet:"sqft",sqyard:"sqyd",sqmile:"sqmi",sqmiles:"sqmi",mmhg:"mmHg",mmh2o:"mmH2O",cmh2o:"cmH2O",seconds:"second",secs:"second",minutes:"minute",mins:"minute",hours:"hour",hr:"hour",hrs:"hour",days:"day",weeks:"week",months:"month",years:"year",decades:"decade",centuries:"century",millennia:"millennium",hertz:"hertz",radians:"radian",degrees:"degree",gradians:"gradian",cycles:"cycle",arcsecond:"arcsec",arcseconds:"arcsec",arcminute:"arcmin",arcminutes:"arcmin",BTUs:"BTU",watts:"watt",joules:"joule",amperes:"ampere",amps:"ampere",amp:"ampere",coulombs:"coulomb",volts:"volt",ohms:"ohm",farads:"farad",webers:"weber",teslas:"tesla",electronvolts:"electronvolt",moles:"mole",bit:"bits",byte:"bytes"};function $(e){if("BigNumber"===e.number){const e=$l(y);j.rad.value=new y(1),j.deg.value=e.div(180),j.grad.value=e.div(200),j.cycle.value=e.times(2),j.arcsec.value=e.div(648e3),j.arcmin.value=e.div(10800)}else j.rad.value=1,j.deg.value=Math.PI/180,j.grad.value=Math.PI/200,j.cycle.value=2*Math.PI,j.arcsec.value=Math.PI/648e3,j.arcmin.value=Math.PI/10800;j.radian.value=j.rad.value,j.degree.value=j.deg.value,j.gradian.value=j.grad.value}$(n),t&&t("config",(function(e,t){e.number!==t.number&&$(e)}));const H={si:{NONE:{unit:U,prefix:k.NONE[""]},LENGTH:{unit:j.m,prefix:k.SHORT[""]},MASS:{unit:j.g,prefix:k.SHORT.k},TIME:{unit:j.s,prefix:k.SHORT[""]},CURRENT:{unit:j.A,prefix:k.SHORT[""]},TEMPERATURE:{unit:j.K,prefix:k.SHORT[""]},LUMINOUS_INTENSITY:{unit:j.cd,prefix:k.SHORT[""]},AMOUNT_OF_SUBSTANCE:{unit:j.mol,prefix:k.SHORT[""]},ANGLE:{unit:j.rad,prefix:k.SHORT[""]},BIT:{unit:j.bits,prefix:k.SHORT[""]},FORCE:{unit:j.N,prefix:k.SHORT[""]},ENERGY:{unit:j.J,prefix:k.SHORT[""]},POWER:{unit:j.W,prefix:k.SHORT[""]},PRESSURE:{unit:j.Pa,prefix:k.SHORT[""]},ELECTRIC_CHARGE:{unit:j.C,prefix:k.SHORT[""]},ELECTRIC_CAPACITANCE:{unit:j.F,prefix:k.SHORT[""]},ELECTRIC_POTENTIAL:{unit:j.V,prefix:k.SHORT[""]},ELECTRIC_RESISTANCE:{unit:j.ohm,prefix:k.SHORT[""]},ELECTRIC_INDUCTANCE:{unit:j.H,prefix:k.SHORT[""]},ELECTRIC_CONDUCTANCE:{unit:j.S,prefix:k.SHORT[""]},MAGNETIC_FLUX:{unit:j.Wb,prefix:k.SHORT[""]},MAGNETIC_FLUX_DENSITY:{unit:j.T,prefix:k.SHORT[""]},FREQUENCY:{unit:j.Hz,prefix:k.SHORT[""]}}};H.cgs=JSON.parse(JSON.stringify(H.si)),H.cgs.LENGTH={unit:j.m,prefix:k.SHORT.c},H.cgs.MASS={unit:j.g,prefix:k.SHORT[""]},H.cgs.FORCE={unit:j.dyn,prefix:k.SHORT[""]},H.cgs.ENERGY={unit:j.erg,prefix:k.NONE[""]},H.us=JSON.parse(JSON.stringify(H.si)),H.us.LENGTH={unit:j.ft,prefix:k.NONE[""]},H.us.MASS={unit:j.lbm,prefix:k.NONE[""]},H.us.TEMPERATURE={unit:j.degF,prefix:k.NONE[""]},H.us.FORCE={unit:j.lbf,prefix:k.NONE[""]},H.us.ENERGY={unit:j.BTU,prefix:k.BTU[""]},H.us.POWER={unit:j.hp,prefix:k.NONE[""]},H.us.PRESSURE={unit:j.psi,prefix:k.NONE[""]},H.auto=JSON.parse(JSON.stringify(H.si));let G=H.auto;N.setUnitSystem=function(e){if(!me(H,e))throw new Error("Unit system "+e+" does not exist. Choices are: "+Object.keys(H).join(", "));G=H[e]},N.getUnitSystem=function(){for(const e in H)if(me(H,e)&&H[e]===G)return e},N.typeConverters={BigNumber:function(e){return null!=e&&e.isFraction?new y(String(e.n)).div(String(e.d)).times(String(e.s)):new y(e+"")},Fraction:function(e){return new b(e)},Complex:function(e){return e},number:function(e){return null!=e&&e.isFraction?h(e):e}},N.prototype._numberConverter=function(){const e=N.typeConverters[this.valueType()];if(e)return e;throw new TypeError('Unsupported Unit value type "'+this.valueType()+'"')},N._getNumberConverter=function(e){if(!N.typeConverters[e])throw new TypeError('Unsupported type "'+e+'"');return N.typeConverters[e]};for(const e in j)if(me(j,e)){const t=j[e];t.dimensions=t.base.dimensions}for(const e in L)if(me(L,e)){const t=j[L[e]],n={};for(const e in t)me(t,e)&&(n[e]=t[e]);n.name=e,j[e]=n}return N.isValidAlpha=function(e){return/^[a-zA-Z]$/.test(e)},N.createUnit=function(e,t){if("object"!=typeof e)throw new TypeError("createUnit expects first parameter to be of type 'Object'");if(t&&t.override)for(const t in e)if(me(e,t)&&N.deleteUnit(t),e[t].aliases)for(let n=0;n<e[t].aliases.length;n++)N.deleteUnit(e[t].aliases[n]);let n;for(const t in e)me(e,t)&&(n=N.createUnitSingle(t,e[t]));return n},N.createUnitSingle=function(e,t){if(null==t&&(t={}),"string"!=typeof e)throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");if(me(j,e))throw new Error('Cannot create unit "'+e+'": a unit with that name already exists');!function(e){for(let t=0;t<e.length;t++){if(S=e.charAt(t),0===t&&!N.isValidAlpha(S))throw new Error('Invalid unit name (must begin with alpha character): "'+e+'"');if(t>0&&!N.isValidAlpha(S)&&!C(S))throw new Error('Invalid unit name (only alphanumeric characters are allowed): "'+e+'"')}}(e);let n,r,i,o=null,a=[],s=0;if(t&&"Unit"===t.type)o=t.clone();else if("string"==typeof t)""!==t&&(n=t);else{if("object"!=typeof t)throw new TypeError('Cannot create unit "'+e+'" from "'+t.toString()+'": expecting "string" or "Unit" or "Object"');n=t.definition,r=t.prefixes,s=t.offset,i=t.baseName,t.aliases&&(a=t.aliases.valueOf())}if(a)for(let e=0;e<a.length;e++)if(me(j,a[e]))throw new Error('Cannot create alias "'+a[e]+'": a unit with that name already exists');if(n&&"string"==typeof n&&!o)try{o=N.parse(n,{allowNoUnits:!0})}catch(t){throw t.message='Could not create unit "'+e+'" from "'+n+'": '+t.message,t}else n&&"Unit"===n.type&&(o=n.clone());a=a||[],s=s||0,r=r&&r.toUpperCase&&k[r.toUpperCase()]||k.NONE;let u={};if(o){u={name:e,value:o.value,dimensions:o.dimensions.slice(0),prefixes:r,offset:s};let t=!1;for(const e in P)if(me(P,e)){let n=!0;for(let t=0;t<R.length;t++)if(Math.abs((u.dimensions[t]||0)-(P[e].dimensions[t]||0))>1e-12){n=!1;break}if(n){t=!0,u.base=P[e];break}}if(!t){i=i||e+"_STUFF";const t={dimensions:o.dimensions.slice(0)};t.key=i,P[i]=t,G[i]={unit:u,prefix:k.NONE[""]},u.base=P[i]}}else{if(i=i||e+"_STUFF",R.indexOf(i)>=0)throw new Error('Cannot create new base unit "'+e+'": a base unit with that name already exists (and cannot be overridden)');R.push(i);for(const e in P)me(P,e)&&(P[e].dimensions[R.length-1]=0);const t={dimensions:[]};for(let e=0;e<R.length;e++)t.dimensions[e]=0;t.dimensions[R.length-1]=1,t.key=i,P[i]=t,u={name:e,value:1,dimensions:P[i].dimensions.slice(0),prefixes:r,offset:s,base:P[i]},G[i]={unit:u,prefix:k.NONE[""]}}N.UNITS[e]=u;for(let e=0;e<a.length;e++){const t=a[e],n={};for(const e in u)me(u,e)&&(n[e]=u[e]);n.name=t,N.UNITS[t]=n}return delete _.cache,new N(null,e)},N.deleteUnit=function(e){delete N.UNITS[e],delete _.cache},N.PREFIXES=k,N.BASE_DIMENSIONS=R,N.BASE_UNITS=P,N.UNIT_SYSTEMS=H,N.UNITS=j,N}),{isClass:!0}),Vl="unit",Wl=de(Vl,["typed","Unit"],(e=>{let{typed:t,Unit:n}=e;return t(Vl,{Unit:function(e){return e.clone()},string:function(e){return n.isValuelessUnit(e)?new n(null,e):n.parse(e,{allowNoUnits:!0})},"number | BigNumber | Fraction | Complex, string | Unit":function(e,t){return new n(e,t)},"number | BigNumber | Fraction":function(e){return new n(e)},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),Yl="sparse",Jl=de(Yl,["typed","SparseMatrix"],(e=>{let{typed:t,SparseMatrix:n}=e;return t(Yl,{"":function(){return new n([])},string:function(e){return new n([],e)},"Array | Matrix":function(e){return new n(e)},"Array | Matrix, string":function(e,t){return new n(e,t)}})})),Xl="createUnit",Ql=de(Xl,["typed","Unit"],(e=>{let{typed:t,Unit:n}=e;return t(Xl,{"Object, Object":function(e,t){return n.createUnit(e,t)},Object:function(e){return n.createUnit(e,{})},"string, Unit | string | Object, Object":function(e,t,r){const i={};return i[e]=t,n.createUnit(i,r)},"string, Unit | string | Object":function(e,t){const r={};return r[e]=t,n.createUnit(r,{})},string:function(e){const t={};return t[e]={},n.createUnit(t,{})}})})),Kl="acos",ef=de(Kl,["typed","config","Complex"],(e=>{let{typed:t,config:n,Complex:r}=e;return t(Kl,{number:function(e){return e>=-1&&e<=1||n.predictable?Math.acos(e):new r(e,0).acos()},Complex:function(e){return e.acos()},BigNumber:function(e){return e.acos()}})})),tf="number";function nf(e){return ze(e)}function rf(e){return Math.atan(1/e)}function of(e){return isFinite(e)?(Math.log((e+1)/e)+Math.log(e/(e-1)))/2:0}function af(e){return Math.asin(1/e)}function sf(e){const t=1/e;return Math.log(t+Math.sqrt(t*t+1))}function uf(e){return Math.acos(1/e)}function cf(e){const t=1/e,n=Math.sqrt(t*t-1);return Math.log(n+t)}function lf(e){return qe(e)}function ff(e){return Ie(e)}function pf(e){return 1/Math.tan(e)}function mf(e){const t=Math.exp(2*e);return(t+1)/(t-1)}function df(e){return 1/Math.sin(e)}function hf(e){return 0===e?Number.POSITIVE_INFINITY:Math.abs(2/(Math.exp(e)-Math.exp(-e)))*be(e)}function gf(e){return 1/Math.cos(e)}function yf(e){return 2/(Math.exp(e)+Math.exp(-e))}function xf(e){return Re(e)}nf.signature=tf,rf.signature=tf,of.signature=tf,af.signature=tf,sf.signature=tf,uf.signature=tf,cf.signature=tf,lf.signature=tf,ff.signature=tf,pf.signature=tf,mf.signature=tf,df.signature=tf,hf.signature=tf,gf.signature=tf,yf.signature=tf,xf.signature=tf;const bf="acosh",wf=de(bf,["typed","config","Complex"],(e=>{let{typed:t,config:n,Complex:r}=e;return t(bf,{number:function(e){return e>=1||n.predictable?nf(e):e<=-1?new r(Math.log(Math.sqrt(e*e-1)-e),Math.PI):new r(e,0).acosh()},Complex:function(e){return e.acosh()},BigNumber:function(e){return e.acosh()}})})),vf="acot",Nf=de(vf,["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t(vf,{number:rf,Complex:function(e){return e.acot()},BigNumber:function(e){return new n(1).div(e).atan()}})})),Af="acoth",Ef=de(Af,["typed","config","Complex","BigNumber"],(e=>{let{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(Af,{number:function(e){return e>=1||e<=-1||n.predictable?of(e):new r(e,0).acoth()},Complex:function(e){return e.acoth()},BigNumber:function(e){return new i(1).div(e).atanh()}})})),Sf="acsc",Mf=de(Sf,["typed","config","Complex","BigNumber"],(e=>{let{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(Sf,{number:function(e){return e<=-1||e>=1||n.predictable?af(e):new r(e,0).acsc()},Complex:function(e){return e.acsc()},BigNumber:function(e){return new i(1).div(e).asin()}})})),Cf="acsch",Tf=de(Cf,["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t(Cf,{number:sf,Complex:function(e){return e.acsch()},BigNumber:function(e){return new n(1).div(e).asinh()}})})),Bf="asec",Ff=de(Bf,["typed","config","Complex","BigNumber"],(e=>{let{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(Bf,{number:function(e){return e<=-1||e>=1||n.predictable?uf(e):new r(e,0).asec()},Complex:function(e){return e.asec()},BigNumber:function(e){return new i(1).div(e).acos()}})})),Df="asech",Of=de(Df,["typed","config","Complex","BigNumber"],(e=>{let{typed:t,config:n,Complex:r,BigNumber:i}=e;return t(Df,{number:function(e){if(e<=1&&e>=-1||n.predictable){const t=1/e;if(t>0||n.predictable)return cf(e);const i=Math.sqrt(t*t-1);return new r(Math.log(i-t),Math.PI)}return new r(e,0).asech()},Complex:function(e){return e.asech()},BigNumber:function(e){return new i(1).div(e).acosh()}})})),_f="asin",zf=de(_f,["typed","config","Complex"],(e=>{let{typed:t,config:n,Complex:r}=e;return t(_f,{number:function(e){return e>=-1&&e<=1||n.predictable?Math.asin(e):new r(e,0).asin()},Complex:function(e){return e.asin()},BigNumber:function(e){return e.asin()}})})),qf=de("asinh",["typed"],(e=>{let{typed:t}=e;return t("asinh",{number:lf,Complex:function(e){return e.asinh()},BigNumber:function(e){return e.asinh()}})})),If=de("atan",["typed"],(e=>{let{typed:t}=e;return t("atan",{number:function(e){return Math.atan(e)},Complex:function(e){return e.atan()},BigNumber:function(e){return e.atan()}})})),kf="atan2",Rf=de(kf,["typed","matrix","equalScalar","BigNumber","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,BigNumber:i,DenseMatrix:o,concat:a}=e;const s=aa({typed:t,equalScalar:r}),u=sa({typed:t}),c=Za({typed:t,equalScalar:r}),l=Ro({typed:t,equalScalar:r}),f=Po({typed:t,DenseMatrix:o}),p=fa({typed:t,matrix:n,concat:a});return t(kf,{"number, number":Math.atan2,"BigNumber, BigNumber":(e,t)=>i.atan2(e,t)},p({scalar:"number | BigNumber",SS:c,DS:u,SD:s,Ss:l,sS:f}))})),Pf="atanh",Uf=de(Pf,["typed","config","Complex"],(e=>{let{typed:t,config:n,Complex:r}=e;return t(Pf,{number:function(e){return e<=1&&e>=-1||n.predictable?ff(e):new r(e,0).atanh()},Complex:function(e){return e.atanh()},BigNumber:function(e){return e.atanh()}})})),jf=de("trigUnit",["typed"],(e=>{let{typed:t}=e;return{Unit:t.referToSelf((e=>n=>{if(!n.hasBase(n.constructor.BASE_UNITS.ANGLE))throw new TypeError("Unit in function cot is no angle");return t.find(e,n.valueType())(n.value)}))}})),Lf=de("cos",["typed"],(e=>{let{typed:t}=e;const n=jf({typed:t});return t("cos",{number:Math.cos,"Complex | BigNumber":e=>e.cos()},n)})),$f="cosh",Hf=de($f,["typed"],(e=>{let{typed:t}=e;return t($f,{number:ke,"Complex | BigNumber":e=>e.cosh()})})),Gf=de("cot",["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t("cot",{number:pf,Complex:e=>e.cot(),BigNumber:e=>new n(1).div(e.tan())},jf({typed:t}))})),Zf="coth",Vf=de(Zf,["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t(Zf,{number:mf,Complex:e=>e.coth(),BigNumber:e=>new n(1).div(e.tanh())})})),Wf=de("csc",["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t("csc",{number:df,Complex:e=>e.csc(),BigNumber:e=>new n(1).div(e.sin())},jf({typed:t}))})),Yf="csch",Jf=de(Yf,["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t(Yf,{number:hf,Complex:e=>e.csch(),BigNumber:e=>new n(1).div(e.sinh())})})),Xf=de("sec",["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t("sec",{number:gf,Complex:e=>e.sec(),BigNumber:e=>new n(1).div(e.cos())},jf({typed:t}))})),Qf="sech",Kf=de(Qf,["typed","BigNumber"],(e=>{let{typed:t,BigNumber:n}=e;return t(Qf,{number:yf,Complex:e=>e.sech(),BigNumber:e=>new n(1).div(e.cosh())})})),ep=de("sin",["typed"],(e=>{let{typed:t}=e;const n=jf({typed:t});return t("sin",{number:Math.sin,"Complex | BigNumber":e=>e.sin()},n)})),tp="sinh",np=de(tp,["typed"],(e=>{let{typed:t}=e;return t(tp,{number:xf,"Complex | BigNumber":e=>e.sinh()})})),rp=de("tan",["typed"],(e=>{let{typed:t}=e;const n=jf({typed:t});return t("tan",{number:Math.tan,"Complex | BigNumber":e=>e.tan()},n)})),ip=de("tanh",["typed"],(e=>{let{typed:t}=e;return t("tanh",{number:Pe,"Complex | BigNumber":e=>e.tanh()})})),op="setCartesian",ap=de(op,["typed","size","subset","compareNatural","Index","DenseMatrix"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o,DenseMatrix:a}=e;return t(op,{"Array | Matrix, Array | Matrix":function(e,t){let s=[];if(0!==r(n(e),new o(0))&&0!==r(n(t),new o(0))){const n=qr(Array.isArray(e)?e:e.toArray()).sort(i),r=qr(Array.isArray(t)?t:t.toArray()).sort(i);s=[];for(let e=0;e<n.length;e++)for(let t=0;t<r.length;t++)s.push([n[e],r[t]])}return Array.isArray(e)&&Array.isArray(t)?s:new a(s)}})})),sp="setDifference",up=de(sp,["typed","size","subset","compareNatural","Index","DenseMatrix"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o,DenseMatrix:a}=e;return t(sp,{"Array | Matrix, Array | Matrix":function(e,t){let s;if(0===r(n(e),new o(0)))s=[];else{if(0===r(n(t),new o(0)))return qr(e.toArray());{const n=jr(qr(Array.isArray(e)?e:e.toArray()).sort(i)),r=jr(qr(Array.isArray(t)?t:t.toArray()).sort(i));let o;s=[];for(let e=0;e<n.length;e++){o=!1;for(let t=0;t<r.length;t++)if(0===i(n[e].value,r[t].value)&&n[e].identifier===r[t].identifier){o=!0;break}o||s.push(n[e])}}}return Array.isArray(e)&&Array.isArray(t)?Lr(s):new a(Lr(s))}})})),cp="setDistinct",lp=de(cp,["typed","size","subset","compareNatural","Index","DenseMatrix"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o,DenseMatrix:a}=e;return t(cp,{"Array | Matrix":function(e){let t;if(0===r(n(e),new o(0)))t=[];else{const n=qr(Array.isArray(e)?e:e.toArray()).sort(i);t=[],t.push(n[0]);for(let e=1;e<n.length;e++)0!==i(n[e],n[e-1])&&t.push(n[e])}return Array.isArray(e)?t:new a(t)}})})),fp="setIntersect",pp=de(fp,["typed","size","subset","compareNatural","Index","DenseMatrix"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o,DenseMatrix:a}=e;return t(fp,{"Array | Matrix, Array | Matrix":function(e,t){let s;if(0===r(n(e),new o(0))||0===r(n(t),new o(0)))s=[];else{const n=jr(qr(Array.isArray(e)?e:e.toArray()).sort(i)),r=jr(qr(Array.isArray(t)?t:t.toArray()).sort(i));s=[];for(let e=0;e<n.length;e++)for(let t=0;t<r.length;t++)if(0===i(n[e].value,r[t].value)&&n[e].identifier===r[t].identifier){s.push(n[e]);break}}return Array.isArray(e)&&Array.isArray(t)?Lr(s):new a(Lr(s))}})})),mp="setIsSubset",dp=de(mp,["typed","size","subset","compareNatural","Index"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o}=e;return t(mp,{"Array | Matrix, Array | Matrix":function(e,t){if(0===r(n(e),new o(0)))return!0;if(0===r(n(t),new o(0)))return!1;const a=jr(qr(Array.isArray(e)?e:e.toArray()).sort(i)),s=jr(qr(Array.isArray(t)?t:t.toArray()).sort(i));let u;for(let e=0;e<a.length;e++){u=!1;for(let t=0;t<s.length;t++)if(0===i(a[e].value,s[t].value)&&a[e].identifier===s[t].identifier){u=!0;break}if(!1===u)return!1}return!0}})})),hp="setMultiplicity",gp=de(hp,["typed","size","subset","compareNatural","Index"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o}=e;return t(hp,{"number | BigNumber | Fraction | Complex, Array | Matrix":function(e,t){if(0===r(n(t),new o(0)))return 0;const a=qr(Array.isArray(t)?t:t.toArray());let s=0;for(let t=0;t<a.length;t++)0===i(a[t],e)&&s++;return s}})})),yp="setPowerset",xp=de(yp,["typed","size","subset","compareNatural","Index"],(e=>{let{typed:t,size:n,subset:r,compareNatural:i,Index:o}=e;return t(yp,{"Array | Matrix":function(e){if(0===r(n(e),new o(0)))return[];const t=qr(Array.isArray(e)?e:e.toArray()).sort(i),s=[];let u=0;for(;u.toString(2).length<=t.length;)s.push(a(t,u.toString(2).split("").reverse())),u++;return function(e){let t=[];for(let n=e.length-1;n>0;n--)for(let r=0;r<n;r++)e[r].length>e[r+1].length&&(t=e[r],e[r]=e[r+1],e[r+1]=t);return e}(s)}});function a(e,t){const n=[];for(let r=0;r<t.length;r++)"1"===t[r]&&n.push(e[r]);return n}})),bp="setSize",wp=de(bp,["typed","compareNatural"],(e=>{let{typed:t,compareNatural:n}=e;return t(bp,{"Array | Matrix":function(e){return Array.isArray(e)?qr(e).length:qr(e.toArray()).length},"Array | Matrix, boolean":function(e,t){if(!1===t||0===e.length)return Array.isArray(e)?qr(e).length:qr(e.toArray()).length;{const t=qr(Array.isArray(e)?e:e.toArray()).sort(n);let r=1;for(let e=1;e<t.length;e++)0!==n(t[e],t[e-1])&&r++;return r}}})})),vp="setSymDifference",Np=de(vp,["typed","size","concat","subset","setDifference","Index"],(e=>{let{typed:t,size:n,concat:r,subset:i,setDifference:o,Index:a}=e;return t(vp,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(n(e),new a(0)))return qr(t);if(0===i(n(t),new a(0)))return qr(e);const s=qr(e),u=qr(t);return r(o(s,u),o(u,s))}})})),Ap="setUnion",Ep=de(Ap,["typed","size","concat","subset","setIntersect","setSymDifference","Index"],(e=>{let{typed:t,size:n,concat:r,subset:i,setIntersect:o,setSymDifference:a,Index:s}=e;return t(Ap,{"Array | Matrix, Array | Matrix":function(e,t){if(0===i(n(e),new s(0)))return qr(t);if(0===i(n(t),new s(0)))return qr(e);const u=qr(e),c=qr(t);return r(a(u,c),o(u,c))}})})),Sp=de("add",["typed","matrix","addScalar","equalScalar","DenseMatrix","SparseMatrix","concat"],(e=>{let{typed:t,matrix:n,addScalar:r,equalScalar:i,DenseMatrix:o,SparseMatrix:a,concat:s}=e;const u=ma({typed:t}),c=da({typed:t,equalScalar:i}),l=ha({typed:t,DenseMatrix:o}),f=fa({typed:t,matrix:n,concat:s});return t("add",{"any, any":r,"any, any, ...any":t.referToSelf((e=>(t,n,r)=>{let i=e(t,n);for(let t=0;t<r.length;t++)i=e(i,r[t]);return i}))},f({elop:r,DS:u,SS:c,Ss:l}))})),Mp="hypot",Cp=de(Mp,["typed","abs","addScalar","divideScalar","multiplyScalar","sqrt","smaller","isPositive"],(e=>{let{typed:t,abs:n,addScalar:r,divideScalar:i,multiplyScalar:o,sqrt:a,smaller:s,isPositive:u}=e;return t(Mp,{"... number | BigNumber":c,Array:c,Matrix:e=>c(qr(e.toArray(),!0))});function c(e){let t=0,c=0;for(let a=0;a<e.length;a++){if(x(e[a]))throw new TypeError("Unexpected type of argument to hypot");const l=n(e[a]);s(c,l)?(t=o(t,o(i(c,l),i(c,l))),t=r(t,1),c=l):t=r(t,u(l)?o(i(l,c),i(l,c)):l)}return o(c,a(t))}})),Tp="norm",Bp=de(Tp,["typed","abs","add","pow","conj","sqrt","multiply","equalScalar","larger","smaller","matrix","ctranspose","eigs"],(e=>{let{typed:t,abs:n,add:r,pow:i,conj:o,sqrt:a,multiply:s,equalScalar:u,larger:c,smaller:l,matrix:f,ctranspose:p,eigs:m}=e;return t(Tp,{number:Math.abs,Complex:function(e){return e.abs()},BigNumber:function(e){return e.abs()},boolean:function(e){return Math.abs(e)},Array:function(e){return d(f(e),2)},Matrix:function(e){return d(e,2)},"Array, number | BigNumber | string":function(e,t){return d(f(e),t)},"Matrix, number | BigNumber | string":function(e,t){return d(e,t)}});function d(e,t){const f=e.size();if(1===f.length)return function(e,t){if(t===Number.POSITIVE_INFINITY||"inf"===t)return function(e){let t=0;return e.forEach((function(e){const r=n(e);c(r,t)&&(t=r)}),!0),t}(e);if(t===Number.NEGATIVE_INFINITY||"-inf"===t)return function(e){let t;return e.forEach((function(e){const r=n(e);t&&!l(r,t)||(t=r)}),!0),t||0}(e);if("fro"===t)return d(e,2);if("number"==typeof t&&!isNaN(t)){if(!u(t,0)){let o=0;return e.forEach((function(e){o=r(i(n(e),t),o)}),!0),i(o,1/t)}return Number.POSITIVE_INFINITY}throw new Error("Unsupported parameter value")}(e,t);if(2===f.length){if(f[0]&&f[1])return function(e,t){if(1===t)return function(e){const t=[];let i=0;return e.forEach((function(e,o){const a=o[1],s=r(t[a]||0,n(e));c(s,i)&&(i=s),t[a]=s}),!0),i}(e);if(t===Number.POSITIVE_INFINITY||"inf"===t)return function(e){const t=[];let i=0;return e.forEach((function(e,o){const a=o[0],s=r(t[a]||0,n(e));c(s,i)&&(i=s),t[a]=s}),!0),i}(e);if("fro"===t)return function(e){let t=0;return e.forEach((function(e,n){t=r(t,s(e,o(e)))})),n(a(t))}(e);if(2===t)return function(e){const t=e.size();if(t[0]!==t[1])throw new RangeError("Invalid matrix dimensions");const r=p(e),i=s(r,e),o=m(i).values.toArray(),u=o[o.length-1];return n(a(u))}(e);throw new Error("Unsupported parameter value "+t)}(e,t);throw new RangeError("Invalid matrix dimensions")}}})),Fp=de("dot",["typed","addScalar","multiplyScalar","conj","size"],(e=>{let{typed:t,addScalar:n,multiplyScalar:r,conj:i,size:o}=e;return t("dot",{"Array | DenseMatrix, Array | DenseMatrix":function(e,o){const u=a(e,o),c=A(e)?e._data:e,l=A(e)?e._datatype||e.getDataType():void 0,f=A(o)?o._data:o,p=A(o)?o._datatype||o.getDataType():void 0,m=2===s(e).length,d=2===s(o).length;let h=n,g=r;if(l&&p&&l===p&&"string"==typeof l&&"mixed"!==l){const e=l;h=t.find(n,[e,e]),g=t.find(r,[e,e])}if(!m&&!d){let e=g(i(c[0]),f[0]);for(let t=1;t<u;t++)e=h(e,g(i(c[t]),f[t]));return e}if(!m&&d){let e=g(i(c[0]),f[0][0]);for(let t=1;t<u;t++)e=h(e,g(i(c[t]),f[t][0]));return e}if(m&&!d){let e=g(i(c[0][0]),f[0]);for(let t=1;t<u;t++)e=h(e,g(i(c[t][0]),f[t]));return e}if(m&&d){let e=g(i(c[0][0]),f[0][0]);for(let t=1;t<u;t++)e=h(e,g(i(c[t][0]),f[t][0]));return e}},"SparseMatrix, SparseMatrix":function(e,t){a(e,t);const i=e._index,o=e._values,s=t._index,u=t._values;let c=0;const l=n,f=r;let p=0,m=0;for(;p<i.length&&m<s.length;){const e=i[p],t=s[m];e<t?p++:e>t?m++:e===t&&(c=l(c,f(o[p],u[m])),p++,m++)}return c}});function a(e,t){const n=s(e),r=s(t);let i,o;if(1===n.length)i=n[0];else{if(2!==n.length||1!==n[1])throw new RangeError("Expected a column vector, instead got a matrix of size ("+n.join(", ")+")");i=n[0]}if(1===r.length)o=r[0];else{if(2!==r.length||1!==r[1])throw new RangeError("Expected a column vector, instead got a matrix of size ("+r.join(", ")+")");o=r[0]}if(i!==o)throw new RangeError("Vectors must have equal length ("+i+" != "+o+")");if(0===i)throw new RangeError("Cannot calculate the dot product of empty vectors");return i}function s(e){return A(e)?e.size():o(e)}})),Dp=de("trace",["typed","matrix","add"],(e=>{let{typed:t,matrix:n,add:r}=e;return t("trace",{Array:function(e){return i(n(e))},SparseMatrix:function(e){const t=e._values,n=e._index,i=e._ptr,o=e._size,a=o[0],s=o[1];if(a===s){let e=0;if(t.length>0)for(let o=0;o<s;o++){const a=i[o],s=i[o+1];for(let i=a;i<s;i++){const a=n[i];if(a===o){e=r(e,t[i]);break}if(a>o)break}}return e}throw new RangeError("Matrix must be square (size: "+pr(o)+")")},DenseMatrix:i,any:ae});function i(e){const t=e._size,n=e._data;switch(t.length){case 1:if(1===t[0])return ae(n[0]);throw new RangeError("Matrix must be square (size: "+pr(t)+")");case 2:{const e=t[0];if(e===t[1]){let t=0;for(let i=0;i<e;i++)t=r(t,n[i][i]);return t}throw new RangeError("Matrix must be square (size: "+pr(t)+")")}default:throw new RangeError("Matrix must be two dimensional (size: "+pr(t)+")")}}})),Op="index",_p=de(Op,["typed","Index"],(e=>{let{typed:t,Index:n}=e;return t(Op,{"...number | string | BigNumber | Range | Array | Matrix":function(e){const t=e.map((function(e){return g(e)?e.toNumber():N(e)||A(e)?e.map((function(e){return g(e)?e.toNumber():e})):e})),r=new n;return n.apply(r,t),r}})})),zp=new Set(["end"]),qp=de("Node",["mathWithTransform"],(e=>{let{mathWithTransform:t}=e;return class{get type(){return"Node"}get isNode(){return!0}evaluate(e){return this.compile().evaluate(e)}compile(){const e=this._compile(t,{}),n={};return{evaluate:function(t){const r=d(t);return function(e){for(const t of[...zp])if(e.has(t))throw new Error('Scope contains an illegal symbol, "'+t+'" is a reserved keyword')}(r),e(r,n,null)}}}_compile(e,t){throw new Error("Method _compile must be implemented by type "+this.type)}forEach(e){throw new Error("Cannot run forEach on a Node interface")}map(e){throw new Error("Cannot run map on a Node interface")}_ifNode(e){if(!X(e))throw new TypeError("Callback function must return a Node");return e}traverse(e){e(this,null,null),function e(t,n){t.forEach((function(t,r,i){n(t,r,i),e(t,n)}))}(this,e)}transform(e){return function t(n,r,i){const o=e(n,r,i);return o!==n?o:n.map(t)}(this,null,null)}filter(e){const t=[];return this.traverse((function(n,r,i){e(n,r,i)&&t.push(n)})),t}clone(){throw new Error("Cannot clone a Node interface")}cloneDeep(){return this.map((function(e){return e.cloneDeep()}))}equals(e){return!!e&&this.type===e.type&&ce(this,e)}toString(e){const t=this._getCustomString(e);return void 0!==t?t:this._toString(e)}_toString(){throw new Error("_toString not implemented for "+this.type)}toJSON(){throw new Error("Cannot serialize object: toJSON not implemented by "+this.type)}toHTML(e){const t=this._getCustomString(e);return void 0!==t?t:this._toHTML(e)}_toHTML(){throw new Error("_toHTML not implemented for "+this.type)}toTex(e){const t=this._getCustomString(e);return void 0!==t?t:this._toTex(e)}_toTex(e){throw new Error("_toTex not implemented for "+this.type)}_getCustomString(e){if(e&&"object"==typeof e)switch(typeof e.handler){case"object":case"undefined":return;case"function":return e.handler(this,e);default:throw new TypeError("Object or function expected as callback")}}getIdentifier(){return this.type}getContent(){return this}}}),{isClass:!0,isNode:!0});function Ip(e){return Ip="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol&&e!==Symbol.prototype?"symbol":typeof e},Ip(e)}function kp(e,t,n){return(t=function(e){var t=function(e){if("object"!=Ip(e)||!e)return e;var t=e[Symbol.toPrimitive];if(void 0!==t){var n=t.call(e,"string");if("object"!=Ip(n))return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return String(e)}(e);return"symbol"==Ip(t)?t:t+""}(t))in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function Rp(e){return e&&e.isIndexError?new br(e.index+1,e.min+1,void 0!==e.max?e.max+1:void 0):e}function Pp(e){let{subset:t}=e;return function(e,n){try{if(Array.isArray(e))return t(e,n);if(e&&"function"==typeof e.subset)return e.subset(n);if("string"==typeof e)return t(e,n);if("object"==typeof e){if(!n.isObjectProperty())throw new TypeError("Cannot apply a numeric index as object property");return i(e,n.getObjectProperty())}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw Rp(e)}}}const Up="AccessorNode",jp=de(Up,["subset","Node"],(e=>{let{subset:t,Node:n}=e;const r=Pp({subset:t});function o(e){return!(j(e)||L(e)||Z(e)||Y(e)||Q(e)||ee(e)||re(e))}class a extends n{constructor(e,t){if(super(),!X(e))throw new TypeError('Node expected for parameter "object"');if(!J(t))throw new TypeError('IndexNode expected for parameter "index"');this.object=e,this.index=t}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():"":this.object.name||""}get type(){return Up}get isAccessorNode(){return!0}_compile(e,t){const n=this.object._compile(e,t),o=this.index._compile(e,t);if(this.index.isObjectProperty()){const e=this.index.getObjectProperty();return function(t,r,o){return i(n(t,r,o),e)}}return function(e,t,i){const a=n(e,t,i),s=o(e,t,a);return r(a,s)}}forEach(e){e(this.object,"object",this),e(this.index,"index",this)}map(e){return new a(this._ifNode(e(this.object,"object",this)),this._ifNode(e(this.index,"index",this)))}clone(){return new a(this.object,this.index)}_toString(e){let t=this.object.toString(e);return o(this.object)&&(t="("+t+")"),t+this.index.toString(e)}_toHTML(e){let t=this.object.toHTML(e);return o(this.object)&&(t='<span class="math-parenthesis math-round-parenthesis">(</span>'+t+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t+this.index.toHTML(e)}_toTex(e){let t=this.object.toTex(e);return o(this.object)&&(t="\\left(' + object + '\\right)"),t+this.index.toTex(e)}toJSON(){return{mathjs:Up,object:this.object,index:this.index}}static fromJSON(e){return new a(e.object,e.index)}}return kp(a,"name",Up),a}),{isClass:!0,isNode:!0}),Lp="ArrayNode",$p=de(Lp,["Node"],(e=>{let{Node:t}=e;class n extends t{constructor(e){if(super(),this.items=e||[],!Array.isArray(this.items)||!this.items.every(X))throw new TypeError("Array containing Nodes expected")}get type(){return Lp}get isArrayNode(){return!0}_compile(e,t){const n=Ir(this.items,(function(n){return n._compile(e,t)}));if("Array"!==e.config.matrix){const t=e.matrix;return function(e,r,i){return t(Ir(n,(function(t){return t(e,r,i)})))}}return function(e,t,r){return Ir(n,(function(n){return n(e,t,r)}))}}forEach(e){for(let t=0;t<this.items.length;t++)e(this.items[t],"items["+t+"]",this)}map(e){const t=[];for(let n=0;n<this.items.length;n++)t[n]=this._ifNode(e(this.items[n],"items["+n+"]",this));return new n(t)}clone(){return new n(this.items.slice(0))}_toString(e){return"["+this.items.map((function(t){return t.toString(e)})).join(", ")+"]"}toJSON(){return{mathjs:Lp,items:this.items}}static fromJSON(e){return new n(e.items)}_toHTML(e){return'<span class="math-parenthesis math-square-parenthesis">[</span>'+this.items.map((function(t){return t.toHTML(e)})).join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-square-parenthesis">]</span>'}_toTex(e){return function t(n,r){const i=n.some(L)&&!n.every(L),o=r||i,a=o?"&":"\\\\",s=n.map((function(n){return n.items?t(n.items,!r):n.toTex(e)})).join(a);return i||!o||o&&!r?"\\begin{bmatrix}"+s+"\\end{bmatrix}":s}(this.items,!1)}}return kp(n,"name",Lp),n}),{isClass:!0,isNode:!0}),Hp=[{AssignmentNode:{},FunctionAssignmentNode:{}},{ConditionalNode:{latexLeftParens:!1,latexRightParens:!1,latexParens:!1}},{"OperatorNode:or":{op:"or",associativity:"left",associativeWith:[]}},{"OperatorNode:xor":{op:"xor",associativity:"left",associativeWith:[]}},{"OperatorNode:and":{op:"and",associativity:"left",associativeWith:[]}},{"OperatorNode:bitOr":{op:"|",associativity:"left",associativeWith:[]}},{"OperatorNode:bitXor":{op:"^|",associativity:"left",associativeWith:[]}},{"OperatorNode:bitAnd":{op:"&",associativity:"left",associativeWith:[]}},{"OperatorNode:equal":{op:"==",associativity:"left",associativeWith:[]},"OperatorNode:unequal":{op:"!=",associativity:"left",associativeWith:[]},"OperatorNode:smaller":{op:"<",associativity:"left",associativeWith:[]},"OperatorNode:larger":{op:">",associativity:"left",associativeWith:[]},"OperatorNode:smallerEq":{op:"<=",associativity:"left",associativeWith:[]},"OperatorNode:largerEq":{op:">=",associativity:"left",associativeWith:[]},RelationalNode:{associativity:"left",associativeWith:[]}},{"OperatorNode:leftShift":{op:"<<",associativity:"left",associativeWith:[]},"OperatorNode:rightArithShift":{op:">>",associativity:"left",associativeWith:[]},"OperatorNode:rightLogShift":{op:">>>",associativity:"left",associativeWith:[]}},{"OperatorNode:to":{op:"to",associativity:"left",associativeWith:[]}},{RangeNode:{}},{"OperatorNode:add":{op:"+",associativity:"left",associativeWith:["OperatorNode:add","OperatorNode:subtract"]},"OperatorNode:subtract":{op:"-",associativity:"left",associativeWith:[]}},{"OperatorNode:multiply":{op:"*",associativity:"left",associativeWith:["OperatorNode:multiply","OperatorNode:divide","Operator:dotMultiply","Operator:dotDivide"]},"OperatorNode:divide":{op:"/",associativity:"left",associativeWith:[],latexLeftParens:!1,latexRightParens:!1,latexParens:!1},"OperatorNode:dotMultiply":{op:".*",associativity:"left",associativeWith:["OperatorNode:multiply","OperatorNode:divide","OperatorNode:dotMultiply","OperatorNode:doDivide"]},"OperatorNode:dotDivide":{op:"./",associativity:"left",associativeWith:[]},"OperatorNode:mod":{op:"mod",associativity:"left",associativeWith:[]}},{"OperatorNode:multiply":{associativity:"left",associativeWith:["OperatorNode:multiply","OperatorNode:divide","Operator:dotMultiply","Operator:dotDivide"]}},{"OperatorNode:unaryPlus":{op:"+",associativity:"right"},"OperatorNode:unaryMinus":{op:"-",associativity:"right"},"OperatorNode:bitNot":{op:"~",associativity:"right"},"OperatorNode:not":{op:"not",associativity:"right"}},{"OperatorNode:pow":{op:"^",associativity:"right",associativeWith:[],latexRightParens:!1},"OperatorNode:dotPow":{op:".^",associativity:"right",associativeWith:[]}},{"OperatorNode:nullish":{op:"??",associativity:"left",associativeWith:[]}},{"OperatorNode:factorial":{op:"!",associativity:"left"}},{"OperatorNode:ctranspose":{op:"'",associativity:"left"}}];function Gp(e,t){if(!t||"auto"!==t)return e;let n=e;for(;ee(n);)n=n.content;return n}function Zp(e,t,n,r){let i=e;"keep"!==t&&(i=e.getContent());const o=i.getIdentifier();let a=null;for(let e=0;e<Hp.length;e++)if(o in Hp[e]){a=e;break}if("OperatorNode:multiply"===o&&i.implicit&&"show"!==n){const e=Gp(i.args[0],t);Z(e)&&r&&"OperatorNode:divide"===r.getIdentifier()&&V(Gp(r.args[0],t))||"OperatorNode:divide"===e.getIdentifier()&&V(Gp(e.args[0],t))&&Z(Gp(e.args[1]))||(a+=1)}return a}function Vp(e,t){let n=e;"keep"!==t&&(n=e.getContent());const r=n.getIdentifier(),i=Zp(n,t);if(null===i)return null;const o=Hp[i][r];if(me(o,"associativity")){if("left"===o.associativity)return"left";if("right"===o.associativity)return"right";throw Error("'"+r+"' has the invalid associativity '"+o.associativity+"'.")}return null}function Wp(e,t,n){const r="keep"!==n?e.getContent():e,i="keep"!==n?e.getContent():t,o=r.getIdentifier(),a=i.getIdentifier(),s=Zp(r,n);if(null===s)return null;const u=Hp[s][o];if(me(u,"associativeWith")&&u.associativeWith instanceof Array){for(let e=0;e<u.associativeWith.length;e++)if(u.associativeWith[e]===a)return!0;return!1}return null}const Yp="AssignmentNode",Jp=de(Yp,["subset","?matrix","Node"],(e=>{let{subset:t,matrix:n,Node:r}=e;const a=Pp({subset:t}),s=function(e){let{subset:t,matrix:n}=e;return function(e,r,i){try{if(Array.isArray(e))return n(e).subset(r,i).valueOf().forEach(((t,n)=>{e[n]=t})),e;if(e&&"function"==typeof e.subset)return e.subset(r,i);if("string"==typeof e)return t(e,r,i);if("object"==typeof e){if(!r.isObjectProperty())throw TypeError("Cannot apply a numeric index as object property");return o(e,r.getObjectProperty(),i),e}throw new TypeError("Cannot apply index: unsupported type of object")}catch(e){throw Rp(e)}}}({subset:t,matrix:n});function u(e,t,n){t||(t="keep");const r=Zp(e,t,n),i=Zp(e.value,t,n);return"all"===t||null!==i&&i<=r}class c extends r{constructor(e,t,n){if(super(),this.object=e,this.index=n?t:null,this.value=n||t,!re(e)&&!j(e))throw new TypeError('SymbolNode or AccessorNode expected as "object"');if(re(e)&&"end"===e.name)throw new Error('Cannot assign to symbol "end"');if(this.index&&!J(this.index))throw new TypeError('IndexNode expected as "index"');if(!X(this.value))throw new TypeError('Node expected as "value"')}get name(){return this.index?this.index.isObjectProperty()?this.index.getObjectProperty():"":this.object.name||""}get type(){return Yp}get isAssignmentNode(){return!0}_compile(e,t){const n=this.object._compile(e,t),r=this.index?this.index._compile(e,t):null,u=this.value._compile(e,t),c=this.object.name;if(this.index){if(this.index.isObjectProperty()){const e=this.index.getObjectProperty();return function(t,r,i){const a=n(t,r,i),s=u(t,r,i);return o(a,e,s),s}}if(re(this.object))return function(e,t,i){const o=n(e,t,i),a=u(e,t,i),l=r(e,t,o);return e.set(c,s(o,l,a)),a};{const n=this.object.object._compile(e,t);if(this.object.index.isObjectProperty()){const e=this.object.index.getObjectProperty();return function(t,a,c){const l=n(t,a,c),f=i(l,e),p=r(t,a,f),m=u(t,a,c);return o(l,e,s(f,p,m)),m}}{const i=this.object.index._compile(e,t);return function(e,t,o){const c=n(e,t,o),l=i(e,t,c),f=a(c,l),p=r(e,t,f),m=u(e,t,o);return s(c,l,s(f,p,m)),m}}}}if(!re(this.object))throw new TypeError("SymbolNode expected as object");return function(e,t,n){const r=u(e,t,n);return e.set(c,r),r}}forEach(e){e(this.object,"object",this),this.index&&e(this.index,"index",this),e(this.value,"value",this)}map(e){const t=this._ifNode(e(this.object,"object",this)),n=this.index?this._ifNode(e(this.index,"index",this)):null,r=this._ifNode(e(this.value,"value",this));return new c(t,n,r)}clone(){return new c(this.object,this.index,this.value)}_toString(e){const t=this.object.toString(e),n=this.index?this.index.toString(e):"";let r=this.value.toString(e);return u(this,e&&e.parenthesis,e&&e.implicit)&&(r="("+r+")"),t+n+" = "+r}toJSON(){return{mathjs:Yp,object:this.object,index:this.index,value:this.value}}static fromJSON(e){return new c(e.object,e.index,e.value)}_toHTML(e){const t=this.object.toHTML(e),n=this.index?this.index.toHTML(e):"";let r=this.value.toHTML(e);return u(this,e&&e.parenthesis,e&&e.implicit)&&(r='<span class="math-paranthesis math-round-parenthesis">(</span>'+r+'<span class="math-paranthesis math-round-parenthesis">)</span>'),t+n+'<span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>'+r}_toTex(e){const t=this.object.toTex(e),n=this.index?this.index.toTex(e):"";let r=this.value.toTex(e);return u(this,e&&e.parenthesis,e&&e.implicit)&&(r=`\\left(${r}\\right)`),t+n+"="+r}}return kp(c,"name",Yp),c}),{isClass:!0,isNode:!0}),Xp="BlockNode",Qp=de(Xp,["ResultSet","Node"],(e=>{let{ResultSet:t,Node:n}=e;class r extends n{constructor(e){if(super(),!Array.isArray(e))throw new Error("Array expected");this.blocks=e.map((function(e){const t=e&&e.node,n=!e||void 0===e.visible||e.visible;if(!X(t))throw new TypeError('Property "node" must be a Node');if("boolean"!=typeof n)throw new TypeError('Property "visible" must be a boolean');return{node:t,visible:n}}))}get type(){return Xp}get isBlockNode(){return!0}_compile(e,n){const r=Ir(this.blocks,(function(t){return{evaluate:t.node._compile(e,n),visible:t.visible}}));return function(e,n,i){const o=[];return kr(r,(function(t){const r=t.evaluate(e,n,i);t.visible&&o.push(r)})),new t(o)}}forEach(e){for(let t=0;t<this.blocks.length;t++)e(this.blocks[t].node,"blocks["+t+"].node",this)}map(e){const t=[];for(let n=0;n<this.blocks.length;n++){const r=this.blocks[n],i=this._ifNode(e(r.node,"blocks["+n+"].node",this));t[n]={node:i,visible:r.visible}}return new r(t)}clone(){const e=this.blocks.map((function(e){return{node:e.node,visible:e.visible}}));return new r(e)}_toString(e){return this.blocks.map((function(t){return t.node.toString(e)+(t.visible?"":";")})).join("\n")}toJSON(){return{mathjs:Xp,blocks:this.blocks}}static fromJSON(e){return new r(e.blocks)}_toHTML(e){return this.blocks.map((function(t){return t.node.toHTML(e)+(t.visible?"":'<span class="math-separator">;</span>')})).join('<span class="math-separator"><br /></span>')}_toTex(e){return this.blocks.map((function(t){return t.node.toTex(e)+(t.visible?"":";")})).join("\\;\\;\n")}}return kp(r,"name",Xp),r}),{isClass:!0,isNode:!0}),Kp="ConditionalNode",em=de(Kp,["Node"],(e=>{let{Node:t}=e;class n extends t{constructor(e,t,n){if(super(),!X(e))throw new TypeError("Parameter condition must be a Node");if(!X(t))throw new TypeError("Parameter trueExpr must be a Node");if(!X(n))throw new TypeError("Parameter falseExpr must be a Node");this.condition=e,this.trueExpr=t,this.falseExpr=n}get type(){return Kp}get isConditionalNode(){return!0}_compile(e,t){const n=this.condition._compile(e,t),r=this.trueExpr._compile(e,t),i=this.falseExpr._compile(e,t);return function(e,t,o){return function(e){if("number"==typeof e||"boolean"==typeof e||"string"==typeof e)return!!e;if(e){if(g(e))return!e.isZero();if(x(e))return!(!e.re&&!e.im);if(w(e))return!!e.value}if(null==e)return!1;throw new TypeError('Unsupported type of condition "'+oe(e)+'"')}(n(e,t,o))?r(e,t,o):i(e,t,o)}}forEach(e){e(this.condition,"condition",this),e(this.trueExpr,"trueExpr",this),e(this.falseExpr,"falseExpr",this)}map(e){return new n(this._ifNode(e(this.condition,"condition",this)),this._ifNode(e(this.trueExpr,"trueExpr",this)),this._ifNode(e(this.falseExpr,"falseExpr",this)))}clone(){return new n(this.condition,this.trueExpr,this.falseExpr)}_toString(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=Zp(this,t,e&&e.implicit);let r=this.condition.toString(e);const i=Zp(this.condition,t,e&&e.implicit);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=n)&&(r="("+r+")");let o=this.trueExpr.toString(e);const a=Zp(this.trueExpr,t,e&&e.implicit);("all"===t||"OperatorNode"===this.trueExpr.type||null!==a&&a<=n)&&(o="("+o+")");let s=this.falseExpr.toString(e);const u=Zp(this.falseExpr,t,e&&e.implicit);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=n)&&(s="("+s+")"),r+" ? "+o+" : "+s}toJSON(){return{mathjs:Kp,condition:this.condition,trueExpr:this.trueExpr,falseExpr:this.falseExpr}}static fromJSON(e){return new n(e.condition,e.trueExpr,e.falseExpr)}_toHTML(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=Zp(this,t,e&&e.implicit);let r=this.condition.toHTML(e);const i=Zp(this.condition,t,e&&e.implicit);("all"===t||"OperatorNode"===this.condition.type||null!==i&&i<=n)&&(r='<span class="math-parenthesis math-round-parenthesis">(</span>'+r+'<span class="math-parenthesis math-round-parenthesis">)</span>');let o=this.trueExpr.toHTML(e);const a=Zp(this.trueExpr,t,e&&e.implicit);("all"===t||"OperatorNode"===this.trueExpr.type||null!==a&&a<=n)&&(o='<span class="math-parenthesis math-round-parenthesis">(</span>'+o+'<span class="math-parenthesis math-round-parenthesis">)</span>');let s=this.falseExpr.toHTML(e);const u=Zp(this.falseExpr,t,e&&e.implicit);return("all"===t||"OperatorNode"===this.falseExpr.type||null!==u&&u<=n)&&(s='<span class="math-parenthesis math-round-parenthesis">(</span>'+s+'<span class="math-parenthesis math-round-parenthesis">)</span>'),r+'<span class="math-operator math-conditional-operator">?</span>'+o+'<span class="math-operator math-conditional-operator">:</span>'+s}_toTex(e){return"\\begin{cases} {"+this.trueExpr.toTex(e)+"}, &\\quad{\\text{if }\\;"+this.condition.toTex(e)+"}\\\\{"+this.falseExpr.toTex(e)+"}, &\\quad{\\text{otherwise}}\\end{cases}"}}return kp(n,"name",Kp),n}),{isClass:!0,isNode:!0});var tm=n(144);const nm={Alpha:"A",alpha:"\\alpha",Beta:"B",beta:"\\beta",Gamma:"\\Gamma",gamma:"\\gamma",Delta:"\\Delta",delta:"\\delta",Epsilon:"E",epsilon:"\\epsilon",varepsilon:"\\varepsilon",Zeta:"Z",zeta:"\\zeta",Eta:"H",eta:"\\eta",Theta:"\\Theta",theta:"\\theta",vartheta:"\\vartheta",Iota:"I",iota:"\\iota",Kappa:"K",kappa:"\\kappa",varkappa:"\\varkappa",Lambda:"\\Lambda",lambda:"\\lambda",Mu:"M",mu:"\\mu",Nu:"N",nu:"\\nu",Xi:"\\Xi",xi:"\\xi",Omicron:"O",omicron:"o",Pi:"\\Pi",pi:"\\pi",varpi:"\\varpi",Rho:"P",rho:"\\rho",varrho:"\\varrho",Sigma:"\\Sigma",sigma:"\\sigma",varsigma:"\\varsigma",Tau:"T",tau:"\\tau",Upsilon:"\\Upsilon",upsilon:"\\upsilon",Phi:"\\Phi",phi:"\\phi",varphi:"\\varphi",Chi:"X",chi:"\\chi",Psi:"\\Psi",psi:"\\psi",Omega:"\\Omega",omega:"\\omega",true:"\\mathrm{True}",false:"\\mathrm{False}",i:"i",inf:"\\infty",Inf:"\\infty",infinity:"\\infty",Infinity:"\\infty",oo:"\\infty",lim:"\\lim",undefined:"\\mathbf{?}"},rm={transpose:"^\\top",ctranspose:"^H",factorial:"!",pow:"^",dotPow:".^\\wedge",unaryPlus:"+",unaryMinus:"-",bitNot:"\\~",not:"\\neg",multiply:"\\cdot",divide:"\\frac",dotMultiply:".\\cdot",dotDivide:".:",mod:"\\mod",add:"+",subtract:"-",to:"\\rightarrow",leftShift:"<<",rightArithShift:">>",rightLogShift:">>>",equal:"=",unequal:"\\neq",smaller:"<",larger:">",smallerEq:"\\leq",largerEq:"\\geq",bitAnd:"\\&",bitXor:"\\underline{|}",bitOr:"|",and:"\\wedge",xor:"\\veebar",or:"\\vee"},im={abs:{1:"\\left|${args[0]}\\right|"},add:{2:`\\left(\${args[0]}${rm.add}\${args[1]}\\right)`},cbrt:{1:"\\sqrt[3]{${args[0]}}"},ceil:{1:"\\left\\lceil${args[0]}\\right\\rceil"},cube:{1:"\\left(${args[0]}\\right)^3"},divide:{2:"\\frac{${args[0]}}{${args[1]}}"},dotDivide:{2:`\\left(\${args[0]}${rm.dotDivide}\${args[1]}\\right)`},dotMultiply:{2:`\\left(\${args[0]}${rm.dotMultiply}\${args[1]}\\right)`},dotPow:{2:`\\left(\${args[0]}${rm.dotPow}\${args[1]}\\right)`},exp:{1:"\\exp\\left(${args[0]}\\right)"},expm1:`\\left(e${rm.pow}{\${args[0]}}-1\\right)`,fix:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},floor:{1:"\\left\\lfloor${args[0]}\\right\\rfloor"},fraction:{2:"\\frac{${args[0]}}{${args[1]}}"},gcd:"\\gcd\\left(${args}\\right)",hypot:"\\hypot\\left(${args}\\right)",log:{1:"\\ln\\left(${args[0]}\\right)",2:"\\log_{${args[1]}}\\left(${args[0]}\\right)"},log10:{1:"\\log_{10}\\left(${args[0]}\\right)"},log1p:{1:"\\ln\\left(${args[0]}+1\\right)",2:"\\log_{${args[1]}}\\left(${args[0]}+1\\right)"},log2:"\\log_{2}\\left(${args[0]}\\right)",mod:{2:`\\left(\${args[0]}${rm.mod}\${args[1]}\\right)`},multiply:{2:`\\left(\${args[0]}${rm.multiply}\${args[1]}\\right)`},norm:{1:"\\left\\|${args[0]}\\right\\|",2:void 0},nthRoot:{2:"\\sqrt[${args[1]}]{${args[0]}}"},nthRoots:{2:"\\{y : y^${args[1]} = {${args[0]}}\\}"},pow:{2:`\\left(\${args[0]}\\right)${rm.pow}{\${args[1]}}`},round:{1:"\\left\\lfloor${args[0]}\\right\\rceil",2:void 0},sign:{1:"\\mathrm{${name}}\\left(${args[0]}\\right)"},sqrt:{1:"\\sqrt{${args[0]}}"},square:{1:"\\left(${args[0]}\\right)^2"},subtract:{2:`\\left(\${args[0]}${rm.subtract}\${args[1]}\\right)`},unaryMinus:{1:`${rm.unaryMinus}\\left(\${args[0]}\\right)`},unaryPlus:{1:`${rm.unaryPlus}\\left(\${args[0]}\\right)`},bitAnd:{2:`\\left(\${args[0]}${rm.bitAnd}\${args[1]}\\right)`},bitNot:{1:rm.bitNot+"\\left(${args[0]}\\right)"},bitOr:{2:`\\left(\${args[0]}${rm.bitOr}\${args[1]}\\right)`},bitXor:{2:`\\left(\${args[0]}${rm.bitXor}\${args[1]}\\right)`},leftShift:{2:`\\left(\${args[0]}${rm.leftShift}\${args[1]}\\right)`},rightArithShift:{2:`\\left(\${args[0]}${rm.rightArithShift}\${args[1]}\\right)`},rightLogShift:{2:`\\left(\${args[0]}${rm.rightLogShift}\${args[1]}\\right)`},bellNumbers:{1:"\\mathrm{B}_{${args[0]}}"},catalan:{1:"\\mathrm{C}_{${args[0]}}"},stirlingS2:{2:"\\mathrm{S}\\left(${args}\\right)"},arg:{1:"\\arg\\left(${args[0]}\\right)"},conj:{1:"\\left(${args[0]}\\right)^*"},im:{1:"\\Im\\left\\lbrace${args[0]}\\right\\rbrace"},re:{1:"\\Re\\left\\lbrace${args[0]}\\right\\rbrace"},and:{2:`\\left(\${args[0]}${rm.and}\${args[1]}\\right)`},not:{1:rm.not+"\\left(${args[0]}\\right)"},or:{2:`\\left(\${args[0]}${rm.or}\${args[1]}\\right)`},xor:{2:`\\left(\${args[0]}${rm.xor}\${args[1]}\\right)`},cross:{2:"\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)"},ctranspose:{1:`\\left(\${args[0]}\\right)${rm.ctranspose}`},det:{1:"\\det\\left(${args[0]}\\right)"},dot:{2:"\\left(${args[0]}\\cdot${args[1]}\\right)"},expm:{1:"\\exp\\left(${args[0]}\\right)"},inv:{1:"\\left(${args[0]}\\right)^{-1}"},pinv:{1:"\\left(${args[0]}\\right)^{+}"},sqrtm:{1:`{\${args[0]}}${rm.pow}{\\frac{1}{2}}`},trace:{1:"\\mathrm{tr}\\left(${args[0]}\\right)"},transpose:{1:`\\left(\${args[0]}\\right)${rm.transpose}`},combinations:{2:"\\binom{${args[0]}}{${args[1]}}"},combinationsWithRep:{2:"\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)"},factorial:{1:`\\left(\${args[0]}\\right)${rm.factorial}`},gamma:{1:"\\Gamma\\left(${args[0]}\\right)"},lgamma:{1:"\\ln\\Gamma\\left(${args[0]}\\right)"},equal:{2:`\\left(\${args[0]}${rm.equal}\${args[1]}\\right)`},larger:{2:`\\left(\${args[0]}${rm.larger}\${args[1]}\\right)`},largerEq:{2:`\\left(\${args[0]}${rm.largerEq}\${args[1]}\\right)`},smaller:{2:`\\left(\${args[0]}${rm.smaller}\${args[1]}\\right)`},smallerEq:{2:`\\left(\${args[0]}${rm.smallerEq}\${args[1]}\\right)`},unequal:{2:`\\left(\${args[0]}${rm.unequal}\${args[1]}\\right)`},erf:{1:"erf\\left(${args[0]}\\right)"},max:"\\max\\left(${args}\\right)",min:"\\min\\left(${args}\\right)",variance:"\\mathrm{Var}\\left(${args}\\right)",acos:{1:"\\cos^{-1}\\left(${args[0]}\\right)"},acosh:{1:"\\cosh^{-1}\\left(${args[0]}\\right)"},acot:{1:"\\cot^{-1}\\left(${args[0]}\\right)"},acoth:{1:"\\coth^{-1}\\left(${args[0]}\\right)"},acsc:{1:"\\csc^{-1}\\left(${args[0]}\\right)"},acsch:{1:"\\mathrm{csch}^{-1}\\left(${args[0]}\\right)"},asec:{1:"\\sec^{-1}\\left(${args[0]}\\right)"},asech:{1:"\\mathrm{sech}^{-1}\\left(${args[0]}\\right)"},asin:{1:"\\sin^{-1}\\left(${args[0]}\\right)"},asinh:{1:"\\sinh^{-1}\\left(${args[0]}\\right)"},atan:{1:"\\tan^{-1}\\left(${args[0]}\\right)"},atan2:{2:"\\mathrm{atan2}\\left(${args}\\right)"},atanh:{1:"\\tanh^{-1}\\left(${args[0]}\\right)"},cos:{1:"\\cos\\left(${args[0]}\\right)"},cosh:{1:"\\cosh\\left(${args[0]}\\right)"},cot:{1:"\\cot\\left(${args[0]}\\right)"},coth:{1:"\\coth\\left(${args[0]}\\right)"},csc:{1:"\\csc\\left(${args[0]}\\right)"},csch:{1:"\\mathrm{csch}\\left(${args[0]}\\right)"},sec:{1:"\\sec\\left(${args[0]}\\right)"},sech:{1:"\\mathrm{sech}\\left(${args[0]}\\right)"},sin:{1:"\\sin\\left(${args[0]}\\right)"},sinh:{1:"\\sinh\\left(${args[0]}\\right)"},tan:{1:"\\tan\\left(${args[0]}\\right)"},tanh:{1:"\\tanh\\left(${args[0]}\\right)"},to:{2:`\\left(\${args[0]}${rm.to}\${args[1]}\\right)`},numeric:function(e,t){return e.args[0].toTex()},number:{0:"0",1:"\\left(${args[0]}\\right)",2:"\\left(\\left(${args[0]}\\right)${args[1]}\\right)"},string:{0:'\\mathtt{""}',1:"\\mathrm{string}\\left(${args[0]}\\right)"},bignumber:{0:"0",1:"\\left(${args[0]}\\right)"},bigint:{0:"0",1:"\\left(${args[0]}\\right)"},complex:{0:"0",1:"\\left(${args[0]}\\right)",2:`\\left(\\left(\${args[0]}\\right)+${nm.i}\\cdot\\left(\${args[1]}\\right)\\right)`},matrix:{0:"\\begin{bmatrix}\\end{bmatrix}",1:"\\left(${args[0]}\\right)",2:"\\left(${args[0]}\\right)"},sparse:{0:"\\begin{bsparse}\\end{bsparse}",1:"\\left(${args[0]}\\right)"},unit:{1:"\\left(${args[0]}\\right)",2:"\\left(\\left(${args[0]}\\right)${args[1]}\\right)"}},om={deg:"^\\circ"};function am(e){return tm(e,{preserveFormatting:!0})}function sm(e,t){return(t=void 0!==t&&t)?me(om,e)?om[e]:"\\mathrm{"+am(e)+"}":me(nm,e)?nm[e]:am(e)}const um="ConstantNode",cm=de(um,["Node"],(e=>{let{Node:t}=e;class n extends t{constructor(e){super(),this.value=e}get type(){return um}get isConstantNode(){return!0}_compile(e,t){const n=this.value;return function(){return n}}forEach(e){}map(e){return this.clone()}clone(){return new n(this.value)}_toString(e){return pr(this.value,e)}_toHTML(e){const t=this._toString(e);switch(oe(this.value)){case"number":case"bigint":case"BigNumber":case"Fraction":return'<span class="math-number">'+t+"</span>";case"string":return'<span class="math-string">'+t+"</span>";case"boolean":return'<span class="math-boolean">'+t+"</span>";case"null":return'<span class="math-null-symbol">'+t+"</span>";case"undefined":return'<span class="math-undefined">'+t+"</span>";default:return'<span class="math-symbol">'+t+"</span>"}}toJSON(){return{mathjs:um,value:this.value}}static fromJSON(e){return new n(e.value)}_toTex(e){const t=this._toString(e),n=oe(this.value);switch(n){case"string":return"\\mathtt{"+am(t)+"}";case"number":case"BigNumber":{if(!("BigNumber"===n?this.value.isFinite():isFinite(this.value)))return this.value.valueOf()<0?"-\\infty":"\\infty";const e=t.toLowerCase().indexOf("e");return-1!==e?t.substring(0,e)+"\\cdot10^{"+t.substring(e+1)+"}":t}case"bigint":return t.toString();case"Fraction":return this.value.toLatex();default:return t}}}return kp(n,"name",um),n}),{isClass:!0,isNode:!0}),lm="FunctionAssignmentNode",fm=de(lm,["typed","Node"],(e=>{let{typed:t,Node:n}=e;function r(e,t,n){const r=Zp(e,t,n),i=Zp(e.expr,t,n);return"all"===t||null!==i&&i<=r}class i extends n{constructor(e,t,n){if(super(),"string"!=typeof e)throw new TypeError('String expected for parameter "name"');if(!Array.isArray(t))throw new TypeError('Array containing strings or objects expected for parameter "params"');if(!X(n))throw new TypeError('Node expected for parameter "expr"');if(zp.has(e))throw new Error('Illegal function name, "'+e+'" is a reserved keyword');const r=new Set;for(const e of t){const t="string"==typeof e?e:e.name;if(r.has(t))throw new Error(`Duplicate parameter name "${t}"`);r.add(t)}this.name=e,this.params=t.map((function(e){return e&&e.name||e})),this.types=t.map((function(e){return e&&e.type||"any"})),this.expr=n}get type(){return lm}get isFunctionAssignmentNode(){return!0}_compile(e,n){const r=Object.create(n);kr(this.params,(function(e){r[e]=!0}));const i=this.expr,o=i._compile(e,r),a=this.name,s=this.params,u=Ur(this.types,","),c=a+"("+Ur(this.params,", ")+")";return function(e,n,r){const l={};l[u]=function(){const t=Object.create(n);for(let e=0;e<s.length;e++)t[s[e]]=arguments[e];return o(e,t,r)};const f=t(a,l);return f.syntax=c,f.expr=i.toString(),e.set(a,f),f}}forEach(e){e(this.expr,"expr",this)}map(e){const t=this._ifNode(e(this.expr,"expr",this));return new i(this.name,this.params.slice(0),t)}clone(){return new i(this.name,this.params.slice(0),this.expr)}_toString(e){const t=e&&e.parenthesis?e.parenthesis:"keep";let n=this.expr.toString(e);return r(this,t,e&&e.implicit)&&(n="("+n+")"),this.name+"("+this.params.join(", ")+") = "+n}toJSON(){const e=this.types;return{mathjs:lm,name:this.name,params:this.params.map((function(t,n){return{name:t,type:e[n]}})),expr:this.expr}}static fromJSON(e){return new i(e.name,e.params,e.expr)}_toHTML(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=[];for(let e=0;e<this.params.length;e++)n.push('<span class="math-symbol math-parameter">'+hr(this.params[e])+"</span>");let i=this.expr.toHTML(e);return r(this,t,e&&e.implicit)&&(i='<span class="math-parenthesis math-round-parenthesis">(</span>'+i+'<span class="math-parenthesis math-round-parenthesis">)</span>'),'<span class="math-function">'+hr(this.name)+'</span><span class="math-parenthesis math-round-parenthesis">(</span>'+n.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-round-parenthesis">)</span><span class="math-operator math-assignment-operator math-variable-assignment-operator math-binary-operator">=</span>'+i}_toTex(e){const t=e&&e.parenthesis?e.parenthesis:"keep";let n=this.expr.toTex(e);return r(this,t,e&&e.implicit)&&(n=`\\left(${n}\\right)`),"\\mathrm{"+this.name+"}\\left("+this.params.map(sm).join(",")+"\\right)="+n}}return kp(i,"name",lm),i}),{isClass:!0,isNode:!0}),pm="IndexNode",mm=de(pm,["Node","size"],(e=>{let{Node:t,size:n}=e;class r extends t{constructor(e,t){if(super(),this.dimensions=e,this.dotNotation=t||!1,!Array.isArray(e)||!e.every(X))throw new TypeError('Array containing Nodes expected for parameter "dimensions"');if(this.dotNotation&&!this.isObjectProperty())throw new Error("dotNotation only applicable for object properties")}get type(){return pm}get isIndexNode(){return!0}_compile(e,t){const r=Ir(this.dimensions,(function(r,i){if(r.filter((e=>e.isSymbolNode&&"end"===e.name)).length>0){const o=Object.create(t);o.end=!0;const a=r._compile(e,o);return function(e,t,r){if(!A(r)&&!N(r)&&!v(r))throw new TypeError('Cannot resolve "end": context must be a Matrix, Array, or string but is '+oe(r));const o=n(r).valueOf(),s=Object.create(t);return s.end=o[i],a(e,s,r)}}return r._compile(e,t)})),o=i(e,"index");return function(e,t,n){const i=Ir(r,(function(r){return r(e,t,n)}));return o(...i)}}forEach(e){for(let t=0;t<this.dimensions.length;t++)e(this.dimensions[t],"dimensions["+t+"]",this)}map(e){const t=[];for(let n=0;n<this.dimensions.length;n++)t[n]=this._ifNode(e(this.dimensions[n],"dimensions["+n+"]",this));return new r(t,this.dotNotation)}clone(){return new r(this.dimensions.slice(0),this.dotNotation)}isObjectProperty(){return 1===this.dimensions.length&&Z(this.dimensions[0])&&"string"==typeof this.dimensions[0].value}getObjectProperty(){return this.isObjectProperty()?this.dimensions[0].value:null}_toString(e){return this.dotNotation?"."+this.getObjectProperty():"["+this.dimensions.join(", ")+"]"}toJSON(){return{mathjs:pm,dimensions:this.dimensions,dotNotation:this.dotNotation}}static fromJSON(e){return new r(e.dimensions,e.dotNotation)}_toHTML(e){const t=[];for(let e=0;e<this.dimensions.length;e++)t[e]=this.dimensions[e].toHTML();return this.dotNotation?'<span class="math-operator math-accessor-operator">.</span><span class="math-symbol math-property">'+hr(this.getObjectProperty())+"</span>":'<span class="math-parenthesis math-square-parenthesis">[</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-square-parenthesis">]</span>'}_toTex(e){const t=this.dimensions.map((function(t){return t.toTex(e)}));return this.dotNotation?"."+this.getObjectProperty():"_{"+t.join(",")+"}"}}return kp(r,"name",pm),r}),{isClass:!0,isNode:!0}),dm="ObjectNode",hm=de(dm,["Node"],(e=>{let{Node:t}=e;class n extends t{constructor(e){if(super(),this.properties=e||{},e&&("object"!=typeof e||!Object.keys(e).every((function(t){return X(e[t])}))))throw new TypeError("Object containing Nodes expected")}get type(){return dm}get isObjectNode(){return!0}_compile(e,t){const n={};for(const r in this.properties)if(me(this.properties,r)){const o=mr(r),a=JSON.parse(o),s=i(this.properties,r);n[a]=s._compile(e,t)}return function(e,t,r){const i={};for(const o in n)me(n,o)&&(i[o]=n[o](e,t,r));return i}}forEach(e){for(const t in this.properties)me(this.properties,t)&&e(this.properties[t],"properties["+mr(t)+"]",this)}map(e){const t={};for(const n in this.properties)me(this.properties,n)&&(t[n]=this._ifNode(e(this.properties[n],"properties["+mr(n)+"]",this)));return new n(t)}clone(){const e={};for(const t in this.properties)me(this.properties,t)&&(e[t]=this.properties[t]);return new n(e)}_toString(e){const t=[];for(const n in this.properties)me(this.properties,n)&&t.push(mr(n)+": "+this.properties[n].toString(e));return"{"+t.join(", ")+"}"}toJSON(){return{mathjs:dm,properties:this.properties}}static fromJSON(e){return new n(e.properties)}_toHTML(e){const t=[];for(const n in this.properties)me(this.properties,n)&&t.push('<span class="math-symbol math-property">'+hr(n)+'</span><span class="math-operator math-assignment-operator math-property-assignment-operator math-binary-operator">:</span>'+this.properties[n].toHTML(e));return'<span class="math-parenthesis math-curly-parenthesis">{</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-parenthesis math-curly-parenthesis">}</span>'}_toTex(e){const t=[];for(const n in this.properties)me(this.properties,n)&&t.push("\\mathbf{"+n+":} & "+this.properties[n].toTex(e)+"\\\\");return"\\left\\{\\begin{array}{ll}"+t.join("\n")+"\\end{array}\\right\\}"}}return kp(n,"name",dm),n}),{isClass:!0,isNode:!0});function gm(e,t){return new f(e,new l(t),new Set(Object.keys(t)))}const ym="OperatorNode",xm=de(ym,["Node"],(e=>{let{Node:t}=e;function n(e,t){let r=e;if("auto"===t)for(;ee(r);)r=r.content;return!!Z(r)||!!K(r)&&n(r.args[0],t)}function r(e,t,r,i,o){const a=Zp(e,t,r),s=Vp(e,t);if("all"===t||i.length>2&&"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier())return i.map((function(e){switch(e.getContent().type){case"ArrayNode":case"ConstantNode":case"SymbolNode":case"ParenthesisNode":return!1;default:return!0}}));let u;switch(i.length){case 0:u=[];break;case 1:{const n=Zp(i[0],t,r,e);if(o&&null!==n){let r,o;if("keep"===t?(r=i[0].getIdentifier(),o=e.getIdentifier()):(r=i[0].getContent().getIdentifier(),o=e.getContent().getIdentifier()),!1===Hp[a][o].latexLeftParens){u=[!1];break}if(!1===Hp[n][r].latexParens){u=[!1];break}}if(null===n){u=[!1];break}if(n<=a){u=[!0];break}u=[!1]}break;case 2:{let n;const c=Zp(i[0],t,r,e),l=Wp(e,i[0],t);let f;n=null!==c&&(c===a&&"right"===s&&!l||c<a);const p=Zp(i[1],t,r,e),m=Wp(e,i[1],t);if(f=null!==p&&(p===a&&"left"===s&&!m||p<a),o){let r,i,o;"keep"===t?(r=e.getIdentifier(),i=e.args[0].getIdentifier(),o=e.args[1].getIdentifier()):(r=e.getContent().getIdentifier(),i=e.args[0].getContent().getIdentifier(),o=e.args[1].getContent().getIdentifier()),null!==c&&(!1===Hp[a][r].latexLeftParens&&(n=!1),!1===Hp[c][i].latexParens&&(n=!1)),null!==p&&(!1===Hp[a][r].latexRightParens&&(f=!1),!1===Hp[p][o].latexParens&&(f=!1))}u=[n,f]}break;default:"OperatorNode:add"!==e.getIdentifier()&&"OperatorNode:multiply"!==e.getIdentifier()||(u=i.map((function(n){const i=Zp(n,t,r,e),o=Wp(e,n,t),u=Vp(n,t);return null!==i&&(a===i&&s===u&&!o||i<a)})))}if(i.length>=2&&"OperatorNode:multiply"===e.getIdentifier()&&e.implicit&&"all"!==t&&"hide"===r)for(let e=1;e<u.length;++e)!n(i[e],t)||u[e-1]||"keep"===t&&ee(i[e-1])||(u[e]=!0);return u}class o extends t{constructor(e,t,n,r,i){if(super(),"string"!=typeof e)throw new TypeError('string expected for parameter "op"');if("string"!=typeof t)throw new TypeError('string expected for parameter "fn"');if(!Array.isArray(n)||!n.every(X))throw new TypeError('Array containing Nodes expected for parameter "args"');this.implicit=!0===r,this.isPercentage=!0===i,this.op=e,this.fn=t,this.args=n||[]}get type(){return ym}get isOperatorNode(){return!0}_compile(e,t){if("string"!=typeof this.fn||!s(e,this.fn))throw e[this.fn]?new Error('No access to function "'+this.fn+'"'):new Error("Function "+this.fn+' missing in provided namespace "math"');const n=i(e,this.fn),r=Ir(this.args,(function(n){return n._compile(e,t)}));if("function"==typeof n&&!0===n.rawArgs){const t=this.args;return function(r,i,o){return n(t,e,gm(r,i))}}if(1===r.length){const e=r[0];return function(t,r,i){return n(e(t,r,i))}}if(2===r.length){const e=r[0],t=r[1];return function(r,i,o){return n(e(r,i,o),t(r,i,o))}}return function(e,t,i){return n.apply(null,Ir(r,(function(n){return n(e,t,i)})))}}forEach(e){for(let t=0;t<this.args.length;t++)e(this.args[t],"args["+t+"]",this)}map(e){const t=[];for(let n=0;n<this.args.length;n++)t[n]=this._ifNode(e(this.args[n],"args["+n+"]",this));return new o(this.op,this.fn,t,this.implicit,this.isPercentage)}clone(){return new o(this.op,this.fn,this.args.slice(0),this.implicit,this.isPercentage)}isUnary(){return 1===this.args.length}isBinary(){return 2===this.args.length}_toString(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,o=r(this,t,n,i,!1);if(1===i.length){const n=Vp(this,t);let r=i[0].toString(e);o[0]&&(r="("+r+")");const a=/[a-zA-Z]+/.test(this.op);return"right"===n?this.op+(a?" ":"")+r:"left"===n?r+(a?" ":"")+this.op:r+this.op}if(2===i.length){let t=i[0].toString(e),r=i[1].toString(e);return o[0]&&(t="("+t+")"),o[1]&&(r="("+r+")"),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?t+" "+r:t+" "+this.op+" "+r}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){const t=i.map((function(t,n){return t=t.toString(e),o[n]&&(t="("+t+")"),t}));return this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?t.join(" "):t.join(" "+this.op+" ")}return this.fn+"("+this.args.join(", ")+")"}toJSON(){return{mathjs:ym,op:this.op,fn:this.fn,args:this.args,implicit:this.implicit,isPercentage:this.isPercentage}}static fromJSON(e){return new o(e.op,e.fn,e.args,e.implicit,e.isPercentage)}_toHTML(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,o=r(this,t,n,i,!1);if(1===i.length){const n=Vp(this,t);let r=i[0].toHTML(e);return o[0]&&(r='<span class="math-parenthesis math-round-parenthesis">(</span>'+r+'<span class="math-parenthesis math-round-parenthesis">)</span>'),"right"===n?'<span class="math-operator math-unary-operator math-lefthand-unary-operator">'+hr(this.op)+"</span>"+r:r+'<span class="math-operator math-unary-operator math-righthand-unary-operator">'+hr(this.op)+"</span>"}if(2===i.length){let t=i[0].toHTML(e),r=i[1].toHTML(e);return o[0]&&(t='<span class="math-parenthesis math-round-parenthesis">(</span>'+t+'<span class="math-parenthesis math-round-parenthesis">)</span>'),o[1]&&(r='<span class="math-parenthesis math-round-parenthesis">(</span>'+r+'<span class="math-parenthesis math-round-parenthesis">)</span>'),this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?t+'<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'+r:t+'<span class="math-operator math-binary-operator math-explicit-binary-operator">'+hr(this.op)+"</span>"+r}{const t=i.map((function(t,n){return t=t.toHTML(e),o[n]&&(t='<span class="math-parenthesis math-round-parenthesis">(</span>'+t+'<span class="math-parenthesis math-round-parenthesis">)</span>'),t}));return i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())?this.implicit&&"OperatorNode:multiply"===this.getIdentifier()&&"hide"===n?t.join('<span class="math-operator math-binary-operator math-implicit-binary-operator"></span>'):t.join('<span class="math-operator math-binary-operator math-explicit-binary-operator">'+hr(this.op)+"</span>"):'<span class="math-function">'+hr(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-paranthesis math-round-parenthesis">)</span>'}}_toTex(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=e&&e.implicit?e.implicit:"hide",i=this.args,o=r(this,t,n,i,!0);let a=rm[this.fn];if(a=void 0===a?this.op:a,1===i.length){const n=Vp(this,t);let r=i[0].toTex(e);return o[0]&&(r=`\\left(${r}\\right)`),"right"===n?a+r:r+a}if(2===i.length){const r=i[0];let s=r.toTex(e);o[0]&&(s=`\\left(${s}\\right)`);let u,c=i[1].toTex(e);switch(o[1]&&(c=`\\left(${c}\\right)`),u="keep"===t?r.getIdentifier():r.getContent().getIdentifier(),this.getIdentifier()){case"OperatorNode:divide":return a+"{"+s+"}{"+c+"}";case"OperatorNode:pow":switch(s="{"+s+"}",c="{"+c+"}",u){case"ConditionalNode":case"OperatorNode:divide":s=`\\left(${s}\\right)`}break;case"OperatorNode:multiply":if(this.implicit&&"hide"===n)return s+"~"+c}return s+a+c}if(i.length>2&&("OperatorNode:add"===this.getIdentifier()||"OperatorNode:multiply"===this.getIdentifier())){const t=i.map((function(t,n){return t=t.toTex(e),o[n]&&(t=`\\left(${t}\\right)`),t}));return"OperatorNode:multiply"===this.getIdentifier()&&this.implicit&&"hide"===n?t.join("~"):t.join(a)}return"\\mathrm{"+this.fn+"}\\left("+i.map((function(t){return t.toTex(e)})).join(",")+"\\right)"}getIdentifier(){return this.type+":"+this.fn}}return kp(o,"name",ym),o}),{isClass:!0,isNode:!0}),bm="ParenthesisNode",wm=de(bm,["Node"],(e=>{let{Node:t}=e;class n extends t{constructor(e){if(super(),!X(e))throw new TypeError('Node expected for parameter "content"');this.content=e}get type(){return bm}get isParenthesisNode(){return!0}_compile(e,t){return this.content._compile(e,t)}getContent(){return this.content.getContent()}forEach(e){e(this.content,"content",this)}map(e){const t=e(this.content,"content",this);return new n(t)}clone(){return new n(this.content)}_toString(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?"("+this.content.toString(e)+")":this.content.toString(e)}toJSON(){return{mathjs:bm,content:this.content}}static fromJSON(e){return new n(e.content)}_toHTML(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?'<span class="math-parenthesis math-round-parenthesis">(</span>'+this.content.toHTML(e)+'<span class="math-parenthesis math-round-parenthesis">)</span>':this.content.toHTML(e)}_toTex(e){return!e||e&&!e.parenthesis||e&&"keep"===e.parenthesis?`\\left(${this.content.toTex(e)}\\right)`:this.content.toTex(e)}}return kp(n,"name",bm),n}),{isClass:!0,isNode:!0}),vm="RangeNode",Nm=de(vm,["Node"],(e=>{let{Node:t}=e;function n(e,t,n){const r=Zp(e,t,n),i={},o=Zp(e.start,t,n);if(i.start=null!==o&&o<=r||"all"===t,e.step){const o=Zp(e.step,t,n);i.step=null!==o&&o<=r||"all"===t}const a=Zp(e.end,t,n);return i.end=null!==a&&a<=r||"all"===t,i}class r extends t{constructor(e,t,n){if(super(),!X(e))throw new TypeError("Node expected");if(!X(t))throw new TypeError("Node expected");if(n&&!X(n))throw new TypeError("Node expected");if(arguments.length>3)throw new Error("Too many arguments");this.start=e,this.end=t,this.step=n||null}get type(){return vm}get isRangeNode(){return!0}needsEnd(){return this.filter((function(e){return re(e)&&"end"===e.name})).length>0}_compile(e,t){const n=e.range,r=this.start._compile(e,t),i=this.end._compile(e,t);if(this.step){const o=this.step._compile(e,t);return function(e,t,a){return n(r(e,t,a),i(e,t,a),o(e,t,a))}}return function(e,t,o){return n(r(e,t,o),i(e,t,o))}}forEach(e){e(this.start,"start",this),e(this.end,"end",this),this.step&&e(this.step,"step",this)}map(e){return new r(this._ifNode(e(this.start,"start",this)),this._ifNode(e(this.end,"end",this)),this.step&&this._ifNode(e(this.step,"step",this)))}clone(){return new r(this.start,this.end,this.step&&this.step)}_toString(e){const t=n(this,e&&e.parenthesis?e.parenthesis:"keep",e&&e.implicit);let r,i=this.start.toString(e);if(t.start&&(i="("+i+")"),r=i,this.step){let n=this.step.toString(e);t.step&&(n="("+n+")"),r+=":"+n}let o=this.end.toString(e);return t.end&&(o="("+o+")"),r+=":"+o,r}toJSON(){return{mathjs:vm,start:this.start,end:this.end,step:this.step}}static fromJSON(e){return new r(e.start,e.end,e.step)}_toHTML(e){const t=n(this,e&&e.parenthesis?e.parenthesis:"keep",e&&e.implicit);let r,i=this.start.toHTML(e);if(t.start&&(i='<span class="math-parenthesis math-round-parenthesis">(</span>'+i+'<span class="math-parenthesis math-round-parenthesis">)</span>'),r=i,this.step){let n=this.step.toHTML(e);t.step&&(n='<span class="math-parenthesis math-round-parenthesis">(</span>'+n+'<span class="math-parenthesis math-round-parenthesis">)</span>'),r+='<span class="math-operator math-range-operator">:</span>'+n}let o=this.end.toHTML(e);return t.end&&(o='<span class="math-parenthesis math-round-parenthesis">(</span>'+o+'<span class="math-parenthesis math-round-parenthesis">)</span>'),r+='<span class="math-operator math-range-operator">:</span>'+o,r}_toTex(e){const t=n(this,e&&e.parenthesis?e.parenthesis:"keep",e&&e.implicit);let r=this.start.toTex(e);if(t.start&&(r=`\\left(${r}\\right)`),this.step){let n=this.step.toTex(e);t.step&&(n=`\\left(${n}\\right)`),r+=":"+n}let i=this.end.toTex(e);return t.end&&(i=`\\left(${i}\\right)`),r+=":"+i,r}}return kp(r,"name",vm),r}),{isClass:!0,isNode:!0}),Am="RelationalNode",Em=de(Am,["Node"],(e=>{let{Node:t}=e;const n={equal:"==",unequal:"!=",smaller:"<",larger:">",smallerEq:"<=",largerEq:">="};class r extends t{constructor(e,t){if(super(),!Array.isArray(e))throw new TypeError("Parameter conditionals must be an array");if(!Array.isArray(t))throw new TypeError("Parameter params must be an array");if(e.length!==t.length-1)throw new TypeError("Parameter params must contain exactly one more element than parameter conditionals");this.conditionals=e,this.params=t}get type(){return Am}get isRelationalNode(){return!0}_compile(e,t){const n=this,r=this.params.map((n=>n._compile(e,t)));return function(t,o,a){let s,u=r[0](t,o,a);for(let c=0;c<n.conditionals.length;c++)if(s=u,u=r[c+1](t,o,a),!i(e,n.conditionals[c])(s,u))return!1;return!0}}forEach(e){this.params.forEach(((t,n)=>e(t,"params["+n+"]",this)),this)}map(e){return new r(this.conditionals.slice(),this.params.map(((t,n)=>this._ifNode(e(t,"params["+n+"]",this))),this))}clone(){return new r(this.conditionals,this.params)}_toString(e){const t=e&&e.parenthesis?e.parenthesis:"keep",r=Zp(this,t,e&&e.implicit),i=this.params.map((function(n,i){const o=Zp(n,t,e&&e.implicit);return"all"===t||null!==o&&o<=r?"("+n.toString(e)+")":n.toString(e)}));let o=i[0];for(let e=0;e<this.conditionals.length;e++)o+=" "+n[this.conditionals[e]],o+=" "+i[e+1];return o}toJSON(){return{mathjs:Am,conditionals:this.conditionals,params:this.params}}static fromJSON(e){return new r(e.conditionals,e.params)}_toHTML(e){const t=e&&e.parenthesis?e.parenthesis:"keep",r=Zp(this,t,e&&e.implicit),i=this.params.map((function(n,i){const o=Zp(n,t,e&&e.implicit);return"all"===t||null!==o&&o<=r?'<span class="math-parenthesis math-round-parenthesis">(</span>'+n.toHTML(e)+'<span class="math-parenthesis math-round-parenthesis">)</span>':n.toHTML(e)}));let o=i[0];for(let e=0;e<this.conditionals.length;e++)o+='<span class="math-operator math-binary-operator math-explicit-binary-operator">'+hr(n[this.conditionals[e]])+"</span>"+i[e+1];return o}_toTex(e){const t=e&&e.parenthesis?e.parenthesis:"keep",n=Zp(this,t,e&&e.implicit),r=this.params.map((function(r,i){const o=Zp(r,t,e&&e.implicit);return"all"===t||null!==o&&o<=n?"\\left("+r.toTex(e)+"\right)":r.toTex(e)}));let i=r[0];for(let e=0;e<this.conditionals.length;e++)i+=rm[this.conditionals[e]]+r[e+1];return i}}return kp(r,"name",Am),r}),{isClass:!0,isNode:!0}),Sm=de("SymbolNode",["math","?Unit","Node"],(e=>{let{math:t,Unit:n,Node:r}=e;function o(e){return!!n&&n.isValuelessUnit(e)}class a extends r{constructor(e){if(super(),"string"!=typeof e)throw new TypeError('String expected for parameter "name"');this.name=e}get type(){return"SymbolNode"}get isSymbolNode(){return!0}_compile(e,t){const r=this.name;if(!0===t[r])return function(e,t,n){return i(t,r)};if(r in e)return function(t,n,o){return t.has(r)?t.get(r):i(e,r)};{const e=o(r);return function(t,i,o){return t.has(r)?t.get(r):e?new n(null,r):a.onUndefinedSymbol(r)}}}forEach(e){}map(e){return this.clone()}static onUndefinedSymbol(e){throw new Error("Undefined symbol "+e)}clone(){return new a(this.name)}_toString(e){return this.name}_toHTML(e){const t=hr(this.name);return"true"===t||"false"===t?'<span class="math-symbol math-boolean">'+t+"</span>":"i"===t?'<span class="math-symbol math-imaginary-symbol">'+t+"</span>":"Infinity"===t?'<span class="math-symbol math-infinity-symbol">'+t+"</span>":"NaN"===t?'<span class="math-symbol math-nan-symbol">'+t+"</span>":"null"===t?'<span class="math-symbol math-null-symbol">'+t+"</span>":"undefined"===t?'<span class="math-symbol math-undefined-symbol">'+t+"</span>":'<span class="math-symbol">'+t+"</span>"}toJSON(){return{mathjs:"SymbolNode",name:this.name}}static fromJSON(e){return new a(e.name)}_toTex(e){let n=!1;void 0===t[this.name]&&o(this.name)&&(n=!0);const r=sm(this.name,n);return"\\"===r[0]?r:" "+r}}return a}),{isClass:!0,isNode:!0}),Mm="FunctionNode",Cm=de(Mm,["math","Node","SymbolNode"],(e=>{var t;let{math:n,Node:r,SymbolNode:o}=e;const a=e=>pr(e,{truncate:78});function u(e,t,n){let r="";const i=/\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi;let o,a=0;for(;null!==(o=i.exec(e));)if(r+=e.substring(a,o.index),a=o.index,"$$"===o[0])r+="$",a++;else{a+=o[0].length;const e=t[o[1]];if(!e)throw new ReferenceError("Template: Property "+o[1]+" does not exist.");if(void 0===o[2])switch(typeof e){case"string":r+=e;break;case"object":if(X(e))r+=e.toTex(n);else{if(!Array.isArray(e))throw new TypeError("Template: "+o[1]+" has to be a Node, String or array of Nodes");r+=e.map((function(e,t){if(X(e))return e.toTex(n);throw new TypeError("Template: "+o[1]+"["+t+"] is not a Node.")})).join(",")}break;default:throw new TypeError("Template: "+o[1]+" has to be a Node, String or array of Nodes")}else{if(!X(e[o[2]]&&e[o[2]]))throw new TypeError("Template: "+o[1]+"["+o[2]+"] is not a Node.");r+=e[o[2]].toTex(n)}}return r+=e.slice(a),r}class c extends r{constructor(e,t){if(super(),"string"==typeof e&&(e=new o(e)),!X(e))throw new TypeError('Node expected as parameter "fn"');if(!Array.isArray(t)||!t.every(X))throw new TypeError('Array containing Nodes expected for parameter "args"');this.fn=e,this.args=t||[]}get name(){return this.fn.name||""}get type(){return Mm}get isFunctionNode(){return!0}_compile(e,t){const n=this.args.map((n=>n._compile(e,t)));if(!re(this.fn)){if(j(this.fn)&&J(this.fn.index)&&this.fn.index.isObjectProperty()){const r=this.fn.object._compile(e,t),i=this.fn.index.getObjectProperty(),o=this.args;return function(t,a,u){const c=r(t,a,u),l=function(e,t){if(!s(e,t))throw new Error('No access to method "'+t+'"');return e[t]}(c,i);if(null!=l&&l.rawArgs)return l(o,e,gm(t,a));{const e=n.map((e=>e(t,a,u)));return l.apply(c,e)}}}{const r=this.fn.toString(),i=this.fn._compile(e,t),o=this.args;return function(t,s,u){const c=i(t,s,u);if("function"!=typeof c)throw new TypeError(`Expression '${r}' did not evaluate to a function; value is:\n  ${a(c)}`);if(c.rawArgs)return c(o,e,gm(t,s));{const e=n.map((e=>e(t,s,u)));return c.apply(c,e)}}}}{const r=this.fn.name;if(t[r]){const t=this.args;return function(o,s,u){const c=i(s,r);if("function"!=typeof c)throw new TypeError(`Argument '${r}' was not a function; received: ${a(c)}`);if(c.rawArgs)return c(t,e,gm(o,s));{const e=n.map((e=>e(o,s,u)));return c.apply(c,e)}}}{const t=r in e?i(e,r):void 0,o="function"==typeof t&&!0===t.rawArgs,s=t=>{let n;if(t.has(r))n=t.get(r);else{if(!(r in e))return c.onUndefinedFunction(r);n=i(e,r)}if("function"==typeof n)return n;throw new TypeError(`'${r}' is not a function; its value is:\n  ${a(n)}`)};if(o){const t=this.args;return function(r,i,o){const a=s(r);return!0===a.rawArgs?a(t,e,gm(r,i)):a(...n.map((e=>e(r,i,o))))}}switch(n.length){case 0:return function(e,t,n){return s(e)()};case 1:return function(e,t,r){return s(e)((0,n[0])(e,t,r))};case 2:return function(e,t,r){const i=s(e),o=n[0],a=n[1];return i(o(e,t,r),a(e,t,r))};default:return function(e,t,r){return s(e)(...n.map((n=>n(e,t,r))))}}}}}forEach(e){e(this.fn,"fn",this);for(let t=0;t<this.args.length;t++)e(this.args[t],"args["+t+"]",this)}map(e){const t=this._ifNode(e(this.fn,"fn",this)),n=[];for(let t=0;t<this.args.length;t++)n[t]=this._ifNode(e(this.args[t],"args["+t+"]",this));return new c(t,n)}clone(){return new c(this.fn,this.args.slice(0))}toString(e){let t;const n=this.fn.toString(e);return e&&"object"==typeof e.handler&&me(e.handler,n)&&(t=e.handler[n](this,e)),void 0!==t?t:super.toString(e)}_toString(e){const t=this.args.map((function(t){return t.toString(e)}));return(W(this.fn)?"("+this.fn.toString(e)+")":this.fn.toString(e))+"("+t.join(", ")+")"}toJSON(){return{mathjs:Mm,fn:this.fn,args:this.args}}_toHTML(e){const t=this.args.map((function(t){return t.toHTML(e)}));return'<span class="math-function">'+hr(this.fn)+'</span><span class="math-paranthesis math-round-parenthesis">(</span>'+t.join('<span class="math-separator">,</span>')+'<span class="math-paranthesis math-round-parenthesis">)</span>'}toTex(e){let t;return e&&"object"==typeof e.handler&&me(e.handler,this.name)&&(t=e.handler[this.name](this,e)),void 0!==t?t:super.toTex(e)}_toTex(e){const t=this.args.map((function(t){return t.toTex(e)}));let r,i;switch(im[this.name]&&(r=im[this.name]),!n[this.name]||"function"!=typeof n[this.name].toTex&&"object"!=typeof n[this.name].toTex&&"string"!=typeof n[this.name].toTex||(r=n[this.name].toTex),typeof r){case"function":i=r(this,e);break;case"string":i=u(r,this,e);break;case"object":switch(typeof r[t.length]){case"function":i=r[t.length](this,e);break;case"string":i=u(r[t.length],this,e)}}return void 0!==i?i:u("\\mathrm{${name}}\\left(${args}\\right)",this,e)}getIdentifier(){return this.type+":"+this.name}}return t=c,kp(c,"name",Mm),kp(c,"onUndefinedFunction",(function(e){throw new Error("Undefined function "+e)})),kp(c,"fromJSON",(function(e){return new t(e.fn,e.args)})),c}),{isClass:!0,isNode:!0}),Tm="parse",Bm=de(Tm,["typed","numeric","config","AccessorNode","ArrayNode","AssignmentNode","BlockNode","ConditionalNode","ConstantNode","FunctionAssignmentNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","RangeNode","RelationalNode","SymbolNode"],(e=>{let{typed:t,numeric:n,config:r,AccessorNode:i,ArrayNode:o,AssignmentNode:a,BlockNode:s,ConditionalNode:u,ConstantNode:c,FunctionAssignmentNode:l,FunctionNode:f,IndexNode:p,ObjectNode:m,OperatorNode:d,ParenthesisNode:h,RangeNode:g,RelationalNode:y,SymbolNode:x}=e;const b=t(Tm,{string:function(e){return I(e,{})},"Array | Matrix":function(e){return w(e,{})},"string, Object":function(e,t){return I(e,void 0!==t.nodes?t.nodes:{})},"Array | Matrix, Object":w});function w(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const n=void 0!==t.nodes?t.nodes:{};return si(e,(function(e){if("string"!=typeof e)throw new TypeError("String expected");return I(e,n)}))}const v={NULL:0,DELIMITER:1,NUMBER:2,SYMBOL:3,UNKNOWN:4},N={",":!0,"(":!0,")":!0,"[":!0,"]":!0,"{":!0,"}":!0,'"':!0,"'":!0,";":!0,"+":!0,"-":!0,"*":!0,".*":!0,"/":!0,"./":!0,"%":!0,"^":!0,".^":!0,"~":!0,"!":!0,"&":!0,"|":!0,"^|":!0,"=":!0,":":!0,"?":!0,"??":!0,"==":!0,"!=":!0,"<":!0,">":!0,"<=":!0,">=":!0,"<<":!0,">>":!0,">>>":!0},A={mod:!0,to:!0,in:!0,and:!0,xor:!0,or:!0,not:!0},E={true:!0,false:!1,null:null,undefined:void 0},S=["NaN","Infinity"],M={'"':'"',"'":"'","\\":"\\","/":"/",b:"\b",f:"\f",n:"\n",r:"\r",t:"\t"};function C(e,t){return e.expression.substr(e.index,t)}function T(e){return C(e,1)}function B(e){e.index++}function F(e){return e.expression.charAt(e.index-1)}function D(e){return e.expression.charAt(e.index+1)}function O(e){for(e.tokenType=v.NULL,e.token="",e.comment="";;){if("#"===T(e))for(;"\n"!==T(e)&&""!==T(e);)e.comment+=T(e),B(e);if(!b.isWhitespace(T(e),e.nestingLevel))break;B(e)}if(""===T(e))return void(e.tokenType=v.DELIMITER);if("\n"===T(e)&&!e.nestingLevel)return e.tokenType=v.DELIMITER,e.token=T(e),void B(e);const t=T(e),n=C(e,2),r=C(e,3);if(3===r.length&&N[r])return e.tokenType=v.DELIMITER,e.token=r,B(e),B(e),void B(e);if(2===n.length&&N[n])return e.tokenType=v.DELIMITER,e.token=n,B(e),void B(e);if(N[t])return e.tokenType=v.DELIMITER,e.token=t,void B(e);if(b.isDigitDot(t)){e.tokenType=v.NUMBER;const t=C(e,2);if("0b"===t||"0o"===t||"0x"===t){for(e.token+=T(e),B(e),e.token+=T(e),B(e);b.isHexDigit(T(e));)e.token+=T(e),B(e);if("."===T(e))for(e.token+=".",B(e);b.isHexDigit(T(e));)e.token+=T(e),B(e);else if("i"===T(e))for(e.token+="i",B(e);b.isDigit(T(e));)e.token+=T(e),B(e);return}if("."===T(e)){if(e.token+=T(e),B(e),!b.isDigit(T(e)))return void(e.tokenType=v.DELIMITER)}else{for(;b.isDigit(T(e));)e.token+=T(e),B(e);b.isDecimalMark(T(e),D(e))&&(e.token+=T(e),B(e))}for(;b.isDigit(T(e));)e.token+=T(e),B(e);if("E"===T(e)||"e"===T(e))if(b.isDigit(D(e))||"-"===D(e)||"+"===D(e)){if(e.token+=T(e),B(e),"+"!==T(e)&&"-"!==T(e)||(e.token+=T(e),B(e)),!b.isDigit(T(e)))throw ce(e,'Digit expected, got "'+T(e)+'"');for(;b.isDigit(T(e));)e.token+=T(e),B(e);if(b.isDecimalMark(T(e),D(e)))throw ce(e,'Digit expected, got "'+T(e)+'"')}else if(b.isDecimalMark(D(e),e.expression.charAt(e.index+2)))throw B(e),ce(e,'Digit expected, got "'+T(e)+'"')}else{if(!b.isAlpha(T(e),F(e),D(e))){for(e.tokenType=v.UNKNOWN;""!==T(e);)e.token+=T(e),B(e);throw ce(e,'Syntax error in part "'+e.token+'"')}for(;b.isAlpha(T(e),F(e),D(e))||b.isDigit(T(e));)e.token+=T(e),B(e);me(A,e.token)?e.tokenType=v.DELIMITER:e.tokenType=v.SYMBOL}}function _(e){do{O(e)}while("\n"===e.token)}function z(e){e.nestingLevel++}function q(e){e.nestingLevel--}function I(e,t){const n={extraNodes:{},expression:"",comment:"",index:0,token:"",tokenType:v.NULL,nestingLevel:0,conditionalLevel:null};sr(n,{expression:e,extraNodes:t}),O(n);const r=function(e){let t;const n=[];let r;for(""!==e.token&&"\n"!==e.token&&";"!==e.token&&(t=k(e),e.comment&&(t.comment=e.comment));"\n"===e.token||";"===e.token;)0===n.length&&t&&(r=";"!==e.token,n.push({node:t,visible:r})),O(e),"\n"!==e.token&&";"!==e.token&&""!==e.token&&(t=k(e),e.comment&&(t.comment=e.comment),r=";"!==e.token,n.push({node:t,visible:r}));return n.length>0?new s(n):(t||(t=new c(void 0),e.comment&&(t.comment=e.comment)),t)}(n);if(""!==n.token)throw n.tokenType===v.DELIMITER?le(n,"Unexpected operator "+n.token):ce(n,'Unexpected part "'+n.token+'"');return r}function k(e){let t,n,r,i;const o=function(e){let t=function(e){let t=R(e);for(;"or"===e.token;)_(e),t=new d("or","or",[t,R(e)]);return t}(e);for(;"?"===e.token;){const n=e.conditionalLevel;e.conditionalLevel=e.nestingLevel,_(e);const r=t,i=k(e);if(":"!==e.token)throw ce(e,"False part of conditional expression expected");e.conditionalLevel=null,_(e);const o=k(e);t=new u(r,i,o),e.conditionalLevel=n}return t}(e);if("="===e.token){if(re(o))return t=o.name,_(e),r=k(e),new a(new x(t),r);if(j(o))return _(e),r=k(e),new a(o.object,o.index,r);if(Y(o)&&re(o.fn)&&(i=!0,n=[],t=o.name,o.args.forEach((function(e,t){re(e)?n[t]=e.name:i=!1})),i))return _(e),r=k(e),new l(t,n,r);throw ce(e,"Invalid left hand side of assignment operator =")}return o}function R(e){let t=P(e);for(;"xor"===e.token;)_(e),t=new d("xor","xor",[t,P(e)]);return t}function P(e){let t=U(e);for(;"and"===e.token;)_(e),t=new d("and","and",[t,U(e)]);return t}function U(e){let t=L(e);for(;"|"===e.token;)_(e),t=new d("|","bitOr",[t,L(e)]);return t}function L(e){let t=$(e);for(;"^|"===e.token;)_(e),t=new d("^|","bitXor",[t,$(e)]);return t}function $(e){let t=H(e);for(;"&"===e.token;)_(e),t=new d("&","bitAnd",[t,H(e)]);return t}function H(e){const t=[G(e)],n=[],r={"==":"equal","!=":"unequal","<":"smaller",">":"larger","<=":"smallerEq",">=":"largerEq"};for(;me(r,e.token);){const i={name:e.token,fn:r[e.token]};n.push(i),_(e),t.push(G(e))}return 1===t.length?t[0]:2===t.length?new d(n[0].name,n[0].fn,t):new y(n.map((e=>e.fn)),t)}function G(e){let t,n,r,i;t=W(e);const o={"<<":"leftShift",">>":"rightArithShift",">>>":"rightLogShift"};for(;me(o,e.token);)n=e.token,r=o[n],_(e),i=[t,W(e)],t=new d(n,r,i);return t}function W(e){let t,n,r,i;t=J(e);const o={to:"to",in:"to"};for(;me(o,e.token);)n=e.token,r=o[n],_(e),"in"===n&&"])},;".includes(e.token)?t=new d("*","multiply",[t,new x("in")],!0):(i=[t,J(e)],t=new d(n,r,i));return t}function J(e){let t;const n=[];if(t=":"===e.token?new c(1):X(e),":"===e.token&&e.conditionalLevel!==e.nestingLevel){for(n.push(t);":"===e.token&&n.length<3;)_(e),")"===e.token||"]"===e.token||","===e.token||""===e.token?n.push(new x("end")):n.push(X(e));t=3===n.length?new g(n[0],n[2],n[1]):new g(n[0],n[1])}return t}function X(e){let t,n,r,i;t=Q(e);const o={"+":"add","-":"subtract"};for(;me(o,e.token);){n=e.token,r=o[n],_(e);const a=Q(e);i=a.isPercentage?[t,new d("*","multiply",[t,a])]:[t,a],t=new d(n,r,i)}return t}function Q(e){let t,n,r,i;t=ee(e),n=t;const o={"*":"multiply",".*":"dotMultiply","/":"divide","./":"dotDivide","%":"mod",mod:"mod"};for(;me(o,e.token);)if(r=e.token,i=o[r],_(e),"%"===r&&e.tokenType===v.DELIMITER&&"("!==e.token)if(""!==e.token&&o[e.token]){const a=new d("/","divide",[t,new c(100)],!1,!0);r=e.token,i=o[r],_(e),n=ee(e),t=new d(r,i,[a,n])}else t=new d("/","divide",[t,new c(100)],!1,!0);else n=ee(e),t=new d(r,i,[t,n]);return t}function ee(e){let t,n;for(t=te(e),n=t;e.tokenType===v.SYMBOL||"in"===e.token&&Z(t)||"in"===e.token&&K(t)&&"unaryMinus"===t.fn&&Z(t.args[0])||!(e.tokenType!==v.NUMBER||Z(n)||K(n)&&"!"!==n.op)||"("===e.token;)n=te(e),t=new d("*","multiply",[t,n],!0);return t}function te(e){let t=ne(e),n=t;const r=[];for(;"/"===e.token&&V(n);){if(r.push(sr({},e)),_(e),e.tokenType!==v.NUMBER){sr(e,r.pop());break}if(r.push(sr({},e)),_(e),e.tokenType!==v.SYMBOL&&"("!==e.token&&"in"!==e.token){r.pop(),sr(e,r.pop());break}sr(e,r.pop()),r.pop(),n=ne(e),t=new d("/","divide",[t,n])}return t}function ne(e){let t,n,r;const i={"-":"unaryMinus","+":"unaryPlus","~":"bitNot",not:"not"};return me(i,e.token)?(r=i[e.token],t=e.token,_(e),n=[ne(e)],new d(t,r,n)):function(e){let t,n,r,i;return t=function(e){let t=ie(e);for(;"??"===e.token;)_(e),t=new d("??","nullish",[t,ie(e)]);return t}(e),("^"===e.token||".^"===e.token)&&(n=e.token,r="^"===n?"pow":"dotPow",_(e),i=[t,ne(e)],t=new d(n,r,i)),t}(e)}function ie(e){let t,i,a,s;t=function(e){let t=[];if(e.tokenType===v.SYMBOL&&me(e.extraNodes,e.token)){const n=e.extraNodes[e.token];if(O(e),"("===e.token){if(t=[],z(e),O(e),")"!==e.token)for(t.push(k(e));","===e.token;)O(e),t.push(k(e));if(")"!==e.token)throw ce(e,"Parenthesis ) expected");q(e),O(e)}return new n(t)}return function(e){let t,i;return e.tokenType===v.SYMBOL||e.tokenType===v.DELIMITER&&e.token in A?(i=e.token,O(e),t=me(E,i)?new c(E[i]):S.includes(i)?new c(n(i,"number")):new x(i),t=oe(e,t),t):function(e){let t,i;return'"'===e.token||"'"===e.token?(i=ae(e,e.token),t=new c(i),t=oe(e,t),t):function(e){let t,i,a,s;if("["===e.token){if(z(e),O(e),"]"!==e.token){const n=se(e);if(";"===e.token){for(a=1,i=[n];";"===e.token;)O(e),"]"!==e.token&&(i[a]=se(e),a++);if("]"!==e.token)throw ce(e,"End of matrix ] expected");q(e),O(e),s=i[0].items.length;for(let t=1;t<a;t++)if(i[t].items.length!==s)throw le(e,"Column dimensions mismatch ("+i[t].items.length+" !== "+s+")");t=new o(i)}else{if("]"!==e.token)throw ce(e,"End of matrix ] expected");q(e),O(e),t=n}}else q(e),O(e),t=new o([]);return oe(e,t)}return function(e){if("{"===e.token){let t;z(e);const n={};do{if(O(e),"}"!==e.token){if('"'===e.token||"'"===e.token)t=ae(e,e.token);else{if(!(e.tokenType===v.SYMBOL||e.tokenType===v.DELIMITER&&e.token in A))throw ce(e,"Symbol or string expected as object key");t=e.token,O(e)}if(":"!==e.token)throw ce(e,"Colon : expected after object key");O(e),n[t]=k(e)}}while(","===e.token);if("}"!==e.token)throw ce(e,"Comma , or bracket } expected after object value");q(e),O(e);let r=new m(n);return r=oe(e,r),r}return function(e){let t;if(e.tokenType===v.NUMBER){t=e.token,O(e);const i=xe(t,r),o=n(t,i);return new c(o)}return function(e){let t;if("("===e.token){if(z(e),O(e),t=k(e),")"!==e.token)throw ce(e,"Parenthesis ) expected");return q(e),O(e),t=new h(t),t=oe(e,t),t}return function(e){throw""===e.token?ce(e,"Unexpected end of expression"):ce(e,"Value expected")}(e)}(e)}(e)}(e)}(e)}(e)}(e)}(e);const u={"!":"factorial","'":"ctranspose"};for(;me(u,e.token);)i=e.token,a=u[i],O(e),s=[t],t=new d(i,a,s),t=oe(e,t);return t}function oe(e,t,n){let r;for(;("("===e.token||"["===e.token||"."===e.token)&&(!n||n.includes(e.token));)if(r=[],"("===e.token){if(!re(t)&&!j(t))return t;if(z(e),O(e),")"!==e.token)for(r.push(k(e));","===e.token;)O(e),r.push(k(e));if(")"!==e.token)throw ce(e,"Parenthesis ) expected");q(e),O(e),t=new f(t,r)}else if("["===e.token){if(z(e),O(e),"]"!==e.token)for(r.push(k(e));","===e.token;)O(e),r.push(k(e));if("]"!==e.token)throw ce(e,"Parenthesis ] expected");q(e),O(e),t=new i(t,new p(r))}else{if(O(e),!(e.tokenType===v.SYMBOL||e.tokenType===v.DELIMITER&&e.token in A))throw ce(e,"Property name expected after dot");r.push(new c(e.token)),O(e),t=new i(t,new p(r,!0))}return t}function ae(e,t){let n="";for(;""!==T(e)&&T(e)!==t;)if("\\"===T(e)){B(e);const t=T(e),r=M[t];if(void 0!==r)n+=r,e.index+=1;else{if("u"!==t)throw ce(e,`Bad escape character \\${t}`);{const t=e.expression.slice(e.index+1,e.index+5);if(!/^[0-9A-Fa-f]{4}$/.test(t))throw ce(e,`Invalid unicode character \\u${t}`);n+=String.fromCharCode(parseInt(t,16)),e.index+=5}}}else n+=T(e),B(e);if(O(e),e.token!==t)throw ce(e,`End of string ${t} expected`);return O(e),n}function se(e){const t=[k(e)];let n=1;for(;","===e.token;)O(e),"]"!==e.token&&";"!==e.token&&(t[n]=k(e),n++);return new o(t)}function ue(e){return e.index-e.token.length+1}function ce(e,t){const n=ue(e),r=new SyntaxError(t+" (char "+n+")");return r.char=n,r}function le(e,t){const n=ue(e),r=new SyntaxError(t+" (char "+n+")");return r.char=n,r}return b.isAlpha=function(e,t,n){return b.isValidLatinOrGreek(e)||b.isValidMathSymbol(e,n)||b.isValidMathSymbol(t,e)},b.isValidLatinOrGreek=function(e){return/^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(e)},b.isValidMathSymbol=function(e,t){return/^[\uD835]$/.test(e)&&/^[\uDC00-\uDFFF]$/.test(t)&&/^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(t)},b.isWhitespace=function(e,t){return" "===e||"\t"===e||" "===e||"\n"===e&&t>0},b.isDecimalMark=function(e,t){return"."===e&&"/"!==t&&"*"!==t&&"^"!==t},b.isDigitDot=function(e){return e>="0"&&e<="9"||"."===e},b.isDigit=function(e){return e>="0"&&e<="9"},b.isHexDigit=function(e){return e>="0"&&e<="9"||e>="a"&&e<="f"||e>="A"&&e<="F"},t.addConversion({from:"string",to:"Node",convert:b}),b})),Fm="compile",Dm=de(Fm,["typed","parse"],(e=>{let{typed:t,parse:n}=e;return t(Fm,{string:function(e){return n(e).compile()},"Array | Matrix":function(e){return si(e,(function(e){return n(e).compile()}))}})})),Om="evaluate",_m=de(Om,["typed","parse"],(e=>{let{typed:t,parse:n}=e;return t(Om,{string:function(e){const t=m();return n(e).compile().evaluate(t)},"string, Map | Object":function(e,t){return n(e).compile().evaluate(t)},"Array | Matrix":function(e){const t=m();return si(e,(function(e){return n(e).compile().evaluate(t)}))},"Array | Matrix, Map | Object":function(e,t){return si(e,(function(e){return n(e).compile().evaluate(t)}))}})})),zm=de("Parser",["evaluate","parse"],(e=>{let{evaluate:t,parse:n}=e;function r(){if(!(this instanceof r))throw new SyntaxError("Constructor must be called with the new operator");Object.defineProperty(this,"scope",{value:m(),writable:!1})}return r.prototype.type="Parser",r.prototype.isParser=!0,r.prototype.evaluate=function(e){return t(e,this.scope)},r.prototype.get=function(e){if(this.scope.has(e))return this.scope.get(e)},r.prototype.getAll=function(){return function(e){if(e instanceof l)return e.wrappedObject;const t={};for(const n of e.keys())o(t,n,e.get(n));return t}(this.scope)},r.prototype.getAllAsMap=function(){return this.scope},r.prototype.set=function(e,t){if(!function(e){if(0===e.length)return!1;for(let t=0;t<e.length;t++){const r=e.charAt(t-1),i=e.charAt(t),o=e.charAt(t+1);if(!(n.isAlpha(i,r,o)||t>0&&n.isDigit(i)))return!1}return!0}(e))throw new Error(`Invalid variable name: '${e}'. Variable names must follow the specified rules.`);return this.scope.set(e,t),t},r.prototype.remove=function(e){this.scope.delete(e)},r.prototype.clear=function(){this.scope.clear()},r.prototype.toJSON=function(){const e={mathjs:"Parser",variables:{},functions:{}};for(const[t,n]of this.scope)if(O(n)){if(!qm(n))throw new Error(`Cannot serialize external function ${t}`);e.functions[t]=`${n.syntax} = ${n.expr}`}else e.variables[t]=n;return e},r.fromJSON=function(e){const t=new r;return Object.entries(e.variables).forEach((e=>{let[n,r]=e;return t.set(n,r)})),Object.entries(e.functions).forEach((e=>{let[n,r]=e;return t.evaluate(r)})),t},r}),{isClass:!0});function qm(e){return"function"==typeof e&&"string"==typeof e.syntax&&"string"==typeof e.expr}const Im="parser",km=de(Im,["typed","Parser"],(e=>{let{typed:t,Parser:n}=e;return t(Im,{"":function(){return new n}})})),Rm=de("lup",["typed","matrix","abs","addScalar","divideScalar","multiplyScalar","subtractScalar","larger","equalScalar","unaryMinus","DenseMatrix","SparseMatrix","Spa"],(e=>{let{typed:t,matrix:n,abs:r,addScalar:i,divideScalar:o,multiplyScalar:a,subtractScalar:s,larger:u,equalScalar:c,unaryMinus:l,DenseMatrix:f,SparseMatrix:p,Spa:m}=e;return t("lup",{DenseMatrix:function(e){return d(e)},SparseMatrix:function(e){return function(e){const t=e._size[0],n=e._size[1],i=Math.min(t,n),s=e._values,f=e._index,d=e._ptr,h=[],g=[],y=[],x=[t,i],b=[],w=[],v=[],N=[i,n];let A,E,S;const M=[],C=[];for(A=0;A<t;A++)M[A]=A,C[A]=A;const T=function(e,t){const n=C[e],r=C[t];M[n]=t,M[r]=e,C[e]=r,C[t]=n};for(E=0;E<n;E++){const e=new m;E<t&&(y.push(h.length),h.push(1),g.push(E)),v.push(b.length);const n=d[E],i=d[E+1];for(S=n;S<i;S++)A=f[S],e.set(M[A],s[S]);E>0&&e.forEach(0,E-1,(function(t,n){p._forEachRow(t,h,g,y,(function(r,i){r>t&&e.accumulate(r,l(a(i,n)))}))}));let C=E,B=e.get(E),F=r(B);e.forEach(E+1,t-1,(function(e,t){const n=r(t);u(n,F)&&(C=e,F=n,B=t)})),E!==C&&(p._swapRows(E,C,x[1],h,g,y),p._swapRows(E,C,N[1],b,w,v),e.swap(E,C),T(E,C)),e.forEach(0,t-1,(function(e,t){e<=E?(b.push(t),w.push(e)):(t=o(t,B),c(t,0)||(h.push(t),g.push(e)))}))}return v.push(b.length),y.push(h.length),{L:new p({values:h,index:g,ptr:y,size:x}),U:new p({values:b,index:w,ptr:v,size:N}),p:M,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}(e)},Array:function(e){const t=d(n(e));return{L:t.L.valueOf(),U:t.U.valueOf(),p:t.p}}});function d(e){const t=e._size[0],n=e._size[1];let l=Math.min(t,n);const p=ae(e._data),m=[],d=[t,l],h=[],g=[l,n];let y,x,b;const w=[];for(y=0;y<t;y++)w[y]=y;for(x=0;x<n;x++){if(x>0)for(y=0;y<t;y++){const e=Math.min(y,x);let t=0;for(b=0;b<e;b++)t=i(t,a(p[y][b],p[b][x]));p[y][x]=s(p[y][x],t)}let e=x,n=0,l=0;for(y=x;y<t;y++){const t=p[y][x],i=r(t);u(i,n)&&(e=y,n=i,l=t)}if(x!==e&&(w[x]=[w[e],w[e]=w[x]][0],f._swapRows(x,e,p)),x<t)for(y=x+1;y<t;y++){const e=p[y][x];c(e,0)||(p[y][x]=o(p[y][x],l))}}for(x=0;x<n;x++)for(y=0;y<t;y++)0===x&&(y<n&&(h[y]=[]),m[y]=[]),y<x?(y<n&&(h[y][x]=p[y][x]),x<t&&(m[y][x]=0)):y!==x?(y<n&&(h[y][x]=0),x<t&&(m[y][x]=p[y][x])):(y<n&&(h[y][x]=p[y][x]),x<t&&(m[y][x]=1));const v=new f({data:m,size:d}),N=new f({data:h,size:g}),A=[];for(y=0,l=w.length;y<l;y++)A[w[y]]=y;return{L:v,U:N,p:A,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\nP: "+this.p}}}})),Pm=de("qr",["typed","matrix","zeros","identity","isZero","equal","sign","sqrt","conj","unaryMinus","addScalar","divideScalar","multiplyScalar","subtractScalar","complex"],(e=>{let{typed:t,matrix:n,zeros:r,identity:i,isZero:o,equal:a,sign:s,sqrt:u,conj:c,unaryMinus:l,addScalar:f,divideScalar:p,multiplyScalar:m,subtractScalar:d,complex:h}=e;return sr(t("qr",{DenseMatrix:function(e){return y(e)},SparseMatrix:function(e){return function(){throw new Error("qr not implemented for sparse matrices yet")}()},Array:function(e){const t=y(n(e));return{Q:t.Q.valueOf(),R:t.R.valueOf()}}}),{_denseQRimpl:g});function g(e){const t=e._size[0],n=e._size[1],h=i([t],"dense"),g=h._data,y=e.clone(),x=y._data;let b,w,v;const N=r([t],"");for(v=0;v<Math.min(n,t);++v){const e=x[v][v],r=l(a(e,0)?1:s(e)),i=c(r);let h=0;for(b=v;b<t;b++)h=f(h,m(x[b][v],c(x[b][v])));const y=m(r,u(h));if(!o(y)){const r=d(e,y);for(N[v]=1,b=v+1;b<t;b++)N[b]=p(x[b][v],r);const o=l(c(p(r,y)));let a;for(w=v;w<n;w++){for(a=0,b=v;b<t;b++)a=f(a,m(c(N[b]),x[b][w]));for(a=m(a,o),b=v;b<t;b++)x[b][w]=m(d(x[b][w],m(N[b],a)),i)}for(b=0;b<t;b++){for(a=0,w=v;w<t;w++)a=f(a,m(g[b][w],N[w]));for(a=m(a,o),w=v;w<t;++w)g[b][w]=p(d(g[b][w],m(a,c(N[w]))),i)}}}return{Q:h,R:y,toString:function(){return"Q: "+this.Q.toString()+"\nR: "+this.R.toString()}}}function y(e){const t=g(e),n=t.R._data;if(e._data.length>0){const e="Complex"===n[0][0].type?h(0):0;for(let t=0;t<n.length;++t)for(let r=0;r<t&&r<(n[0]||[]).length;++r)n[t][r]=e}return t}}));function Um(e,t,n,r,i,o,a){let s=0;for(n[a]=e;s>=0;){const e=n[a+s],u=n[r+e];-1===u?(s--,o[t++]=e):(n[r+e]=n[i+u],++s,n[a+s]=u)}return t}function jm(e){return-e-2}const Lm=de("csAmd",["add","multiply","transpose"],(e=>{let{add:t,multiply:n,transpose:r}=e;return function(e,a){if(!a||e<=0||e>3)return null;const s=a._size,u=s[0],c=s[1];let l=0,f=Math.max(16,10*Math.sqrt(c));f=Math.min(c-2,f);const p=function(e,i,o,a,s){const u=r(i);if(1===e&&a===o)return t(i,u);if(2===e){const e=u._index,t=u._ptr;let a=0;for(let n=0;n<o;n++){let r=t[n];if(t[n]=a,!(t[n+1]-r>s))for(const i=t[n+1];r<i;r++)e[a++]=e[r]}return t[o]=a,i=r(u),n(u,i)}return n(u,i)}(e,a,u,c,f);!function(e,t){const n=e._values,r=e._index,i=e._ptr,o=e._size[1];let a=0;for(let e=0;e<o;e++){let o=i[e];for(i[e]=a;o<i[e+1];o++)t(r[o],e,n?n[o]:1,null)&&(r[a]=r[o],n&&(n[a]=n[o]),a++)}i[o]=a,r.splice(a,r.length-a),n&&n.splice(a,n.length-a)}(p,o);const m=p._index,d=p._ptr;let h=d[c];const g=[],y=[],x=c+1,b=2*(c+1),w=3*(c+1),v=4*(c+1),N=5*(c+1),A=6*(c+1),E=7*(c+1),S=g;let M,C,T,B,F,D,O,_,z,q,I,k,R,P,U,j,L=function(e,t,n,r,o,a,s,u,c,l,f,p){for(let r=0;r<e;r++)n[0+r]=t[r+1]-t[r];n[0+e]=0;for(let t=0;t<=e;t++)n[o+t]=-1,a[t]=-1,n[s+t]=-1,n[u+t]=-1,n[c+t]=1,n[l+t]=1,n[f+t]=0,n[p+t]=n[0+t];const m=i(0,0,n,l,e);return n[f+e]=-2,t[e]=-1,n[l+e]=0,m}(c,d,y,0,w,S,b,E,x,A,v,N),$=function(e,t,n,r,i,o,a,s,u,c,l){let f=0;for(let p=0;p<e;p++){const m=n[r+p];if(0===m)n[i+p]=-2,f++,t[p]=-1,n[o+p]=0;else if(m>a)n[s+p]=0,n[i+p]=-1,f++,t[p]=jm(e),n[s+e]++;else{const e=n[u+m];-1!==e&&(c[e]=p),n[l+p]=n[u+m],n[u+m]=p}}return f}(c,d,y,N,v,A,f,x,w,S,b),H=0;for(;$<c;){for(T=-1;H<c&&-1===(T=y[w+H]);H++);-1!==y[b+T]&&(S[y[b+T]]=-1),y[w+H]=y[b+T];const e=y[v+T];let t=y[x+T];$+=t;let n=0;y[x+T]=-t;let r=d[T];const o=0===e?r:h;let a=o;for(B=1;B<=e+1;B++){for(B>e?(D=T,O=r,_=y[0+T]-e):(D=m[r++],O=d[D],_=y[0+D]),F=1;F<=_;F++)M=m[O++],(z=y[x+M])<=0||(n+=z,y[x+M]=-z,m[a++]=M,-1!==y[b+M]&&(S[y[b+M]]=S[M]),-1!==S[M]?y[b+S[M]]=y[b+M]:y[w+y[N+M]]=y[b+M]);D!==T&&(d[D]=jm(T),y[A+D]=0)}for(0!==e&&(h=a),y[N+T]=n,d[T]=o,y[0+T]=a-o,y[v+T]=-2,L=i(L,l,y,A,c),q=o;q<a;q++){if(M=m[q],(I=y[v+M])<=0)continue;z=-y[x+M];const e=L-z;for(r=d[M],k=d[M]+I-1;r<=k;r++)D=m[r],y[A+D]>=L?y[A+D]-=z:0!==y[A+D]&&(y[A+D]=y[N+D]+e)}for(q=o;q<a;q++){for(M=m[q],k=d[M],R=k+y[v+M]-1,P=k,U=0,j=0,r=k;r<=R;r++)if(D=m[r],0!==y[A+D]){const e=y[A+D]-L;e>0?(j+=e,m[P++]=D,U+=D):(d[D]=jm(T),y[A+D]=0)}y[v+M]=P-k+1;const e=P,i=k+y[0+M];for(r=R+1;r<i;r++){C=m[r];const e=y[x+C];e<=0||(j+=e,m[P++]=C,U+=C)}0===j?(d[M]=jm(T),z=-y[x+M],n-=z,t+=z,$+=z,y[x+M]=0,y[v+M]=-1):(y[N+M]=Math.min(y[N+M],j),m[P]=m[e],m[e]=m[k],m[k]=T,y[0+M]=P-k+1,U=(U<0?-U:U)%c,y[b+M]=y[E+U],y[E+U]=M,S[M]=U)}for(y[N+T]=n,l=Math.max(l,n),L=i(L+l,l,y,A,c),q=o;q<a;q++)if(M=m[q],!(y[x+M]>=0))for(U=S[M],M=y[E+U],y[E+U]=-1;-1!==M&&-1!==y[b+M];M=y[b+M],L++){for(_=y[0+M],I=y[v+M],r=d[M]+1;r<=d[M]+_-1;r++)y[A+m[r]]=L;let e=M;for(C=y[b+M];-1!==C;){let t=y[0+C]===_&&y[v+C]===I;for(r=d[C]+1;t&&r<=d[C]+_-1;r++)y[A+m[r]]!==L&&(t=0);t?(d[C]=jm(M),y[x+M]+=y[x+C],y[x+C]=0,y[v+C]=-1,C=y[b+C],y[b+e]=C):(e=C,C=y[b+C])}}for(r=o,q=o;q<a;q++)M=m[q],(z=-y[x+M])<=0||(y[x+M]=z,j=y[N+M]+n-z,j=Math.min(j,c-$-z),-1!==y[w+j]&&(S[y[w+j]]=M),y[b+M]=y[w+j],S[M]=-1,y[w+j]=M,H=Math.min(H,j),y[N+M]=j,m[r++]=M);y[x+T]=t,0==(y[0+T]=r-o)&&(d[T]=-1,y[A+T]=0),0!==e&&(h=r)}for(M=0;M<c;M++)d[M]=jm(d[M]);for(C=0;C<=c;C++)y[w+C]=-1;for(C=c;C>=0;C--)y[x+C]>0||(y[b+C]=y[w+d[C]],y[w+d[C]]=C);for(D=c;D>=0;D--)y[x+D]<=0||-1!==d[D]&&(y[b+D]=y[w+d[D]],y[w+d[D]]=D);for(T=0,M=0;M<=c;M++)-1===d[M]&&(T=Um(M,T,y,w,b,g,A));return g.splice(g.length-1,1),g};function i(e,t,n,r,i){if(e<2||e+t<0){for(let e=0;e<i;e++)0!==n[r+e]&&(n[r+e]=1);e=2}return e}function o(e,t){return e!==t}}));function $m(e,t,n,r,i,o,a){let s,u,c,l=0;if(e<=t||n[r+t]<=n[i+e])return-1;n[i+e]=n[r+t];const f=n[o+e];if(n[o+e]=t,-1===f)l=1,c=e;else{for(l=2,c=f;c!==n[a+c];c=n[a+c]);for(s=f;s!==c;s=u)u=n[a+s],n[a+s]=c}return{jleaf:l,q:c}}const Hm=de("csCounts",["transpose"],(e=>{let{transpose:t}=e;return function(e,n,r,i){if(!e||!n||!r)return null;const o=e._size,a=o[0],s=o[1];let u,c,l,f,p,m,d;const h=4*s+(i?s+a+1:0),g=[],y=s,x=2*s,b=3*s,w=4*s,v=5*s+1;for(l=0;l<h;l++)g[l]=-1;const N=[],A=t(e),E=A._index,S=A._ptr;for(l=0;l<s;l++)for(c=r[l],N[c]=-1===g[b+c]?1:0;-1!==c&&-1===g[b+c];c=n[c])g[b+c]=l;if(i){for(l=0;l<s;l++)g[r[l]]=l;for(u=0;u<a;u++){for(l=s,m=S[u],d=S[u+1],p=m;p<d;p++)l=Math.min(l,g[E[p]]);g[v+u]=g[w+l],g[w+l]=u}}for(u=0;u<s;u++)g[0+u]=u;for(l=0;l<s;l++){for(c=r[l],-1!==n[c]&&N[n[c]]--,f=i?g[w+l]:c;-1!==f;f=i?g[v+f]:-1)for(p=S[f];p<S[f+1];p++){u=E[p];const e=$m(u,c,g,b,y,x,0);e.jleaf>=1&&N[c]++,2===e.jleaf&&N[e.q]--}-1!==n[c]&&(g[0+c]=n[c])}for(c=0;c<s;c++)-1!==n[c]&&(N[n[c]]+=N[c]);return N}})),Gm=de("csSqr",["add","multiply","transpose"],(e=>{let{add:t,multiply:n,transpose:r}=e;const i=Lm({add:t,multiply:n,transpose:r}),o=Hm({transpose:r});return function(e,t,n){const r=t._ptr,a=t._size[1];let s;const u={};if(u.q=i(e,t),e&&!u.q)return null;if(n){const n=e?function(e,t,n){const r=e._values,i=e._index,o=e._ptr,a=e._size,s=e._datatype,u=a[0],c=a[1],l=null,f=[],p=[];let m=0;for(let e=0;e<c;e++){p[e]=m;const t=n?n[e]:e;for(let e=o[t],n=o[t+1],a=e;a<n;a++){const e=i[a];f[m]=e,l&&(l[m]=r[a]),m++}}return p[c]=m,e.createSparseMatrix({values:l,index:f,ptr:p,size:[u,c],datatype:s})}(t,0,u.q):t;u.parent=function(e){if(!e)return null;const t=e._index,n=e._ptr,r=e._size,i=r[0],o=r[1],a=[],s=[],u=o;let c,l;for(c=0;c<i;c++)s[u+c]=-1;for(let e=0;e<o;e++){a[e]=-1,s[0+e]=-1;for(let r=n[e],i=n[e+1],o=r;o<i;o++){const n=t[o];for(c=s[u+n];-1!==c&&c<e;c=l)l=s[0+c],s[0+c]=e,-1===l&&(a[c]=e);s[u+n]=e}}return a}(n);const r=function(e,t){if(!e)return null;let n,r=0;const i=[],o=[],a=t,s=2*t;for(n=0;n<t;n++)o[0+n]=-1;for(n=t-1;n>=0;n--)-1!==e[n]&&(o[a+n]=o[0+e[n]],o[0+e[n]]=n);for(n=0;n<t;n++)-1===e[n]&&(r=Um(n,r,o,0,a,i,s));return i}(u.parent,a);if(u.cp=o(n,u.parent,r,1),n&&u.parent&&u.cp&&function(e,t){const n=e._ptr,r=e._index,i=e._size,o=i[0],a=i[1];t.pinv=[],t.leftmost=[];const s=t.parent,u=t.pinv,c=t.leftmost,l=[],f=o,p=o+a,m=o+2*a;let d,h,g,y,x;for(h=0;h<a;h++)l[f+h]=-1,l[p+h]=-1,l[m+h]=0;for(d=0;d<o;d++)c[d]=-1;for(h=a-1;h>=0;h--)for(y=n[h],x=n[h+1],g=y;g<x;g++)c[r[g]]=h;for(d=o-1;d>=0;d--)u[d]=-1,h=c[d],-1!==h&&(0==l[m+h]++&&(l[p+h]=d),l[0+d]=l[f+h],l[f+h]=d);for(t.lnz=0,t.m2=o,h=0;h<a;h++){if(d=l[f+h],t.lnz++,d<0&&(d=t.m2++),u[d]=h,--m[h]<=0)continue;t.lnz+=l[m+h];const e=s[h];-1!==e&&(0===l[m+e]&&(l[p+e]=l[p+h]),l[0+l[p+h]]=l[f+e],l[f+e]=l[0+d],l[m+e]+=l[m+h])}for(d=0;d<o;d++)u[d]<0&&(u[d]=h++);return!0}(n,u))for(u.unz=0,s=0;s<a;s++)u.unz+=u.cp[s]}else u.unz=4*r[a]+a,u.lnz=u.unz;return u}}));function Zm(e,t){return e[t]<0}function Vm(e,t){e[t]=jm(e[t])}function Wm(e){return e<0?jm(e):e}function Ym(e,t,n,r,i){const o=t._index,a=t._ptr,s=t._size[1];let u,c,l,f=0;for(r[0]=e;f>=0;){e=r[f];const t=i?i[e]:e;Zm(a,e)||(Vm(a,e),r[s+f]=t<0?0:Wm(a[t]));let p=1;for(c=r[s+f],l=t<0?0:Wm(a[t+1]);c<l;c++)if(u=o[c],!Zm(a,u)){r[s+f]=c,r[++f]=u,p=0;break}p&&(f--,r[--n]=e)}return n}const Jm=de("csSpsolve",["divideScalar","multiply","subtract"],(e=>{let{divideScalar:t,multiply:n,subtract:r}=e;return function(e,i,o,a,s,u,c){const l=e._values,f=e._index,p=e._ptr,m=e._size[1],d=i._values,h=i._index,g=i._ptr;let y,x,b,w;const v=function(e,t,n,r,i){const o=e._ptr,a=e._size,s=t._index,u=t._ptr,c=a[1];let l,f,p,m=c;for(f=u[n],p=u[n+1],l=f;l<p;l++){const t=s[l];Zm(o,t)||(m=Ym(t,e,m,r,i))}for(l=m;l<c;l++)Vm(o,r[l]);return m}(e,i,o,a,u);for(y=v;y<m;y++)s[a[y]]=0;for(x=g[o],b=g[o+1],y=x;y<b;y++)s[h[y]]=d[y];for(let e=v;e<m;e++){const i=a[e],o=u?u[i]:i;if(!(o<0))for(x=p[o],b=p[o+1],s[i]=t(s[i],l[c?x:b-1]),y=c?x+1:x,w=c?b:b-1;y<w;y++){const e=f[y];s[e]=r(s[e],n(l[y],s[i]))}}return v}})),Xm=de("csLu",["abs","divideScalar","multiply","subtract","larger","largerEq","SparseMatrix"],(e=>{let{abs:t,divideScalar:n,multiply:r,subtract:i,larger:o,largerEq:a,SparseMatrix:s}=e;const u=Jm({divideScalar:n,multiply:r,subtract:i});return function(e,i,c){if(!e)return null;const l=e._size[1];let f,p=100,m=100;i&&(f=i.q,p=i.lnz||p,m=i.unz||m);const d=[],h=[],g=[],y=new s({values:d,index:h,ptr:g,size:[l,l]}),x=[],b=[],w=[],v=new s({values:x,index:b,ptr:w,size:[l,l]}),N=[];let A,E;const S=[],M=[];for(A=0;A<l;A++)S[A]=0,N[A]=-1,g[A+1]=0;p=0,m=0;for(let i=0;i<l;i++){g[i]=p,w[i]=m;const s=f?f[i]:i,v=u(y,e,s,M,S,N,1);let C=-1,T=-1;for(E=v;E<l;E++)if(A=M[E],N[A]<0){const e=t(S[A]);o(e,T)&&(T=e,C=A)}else b[m]=N[A],x[m++]=S[A];if(-1===C||T<=0)return null;N[s]<0&&a(t(S[s]),r(T,c))&&(C=s);const B=S[C];for(b[m]=i,x[m++]=B,N[C]=i,h[p]=C,d[p++]=1,E=v;E<l;E++)A=M[E],N[A]<0&&(h[p]=A,d[p++]=n(S[A],B)),S[A]=0}for(g[l]=p,w[l]=m,E=0;E<p;E++)h[E]=N[h[E]];return d.splice(p,d.length-p),h.splice(p,h.length-p),x.splice(m,x.length-m),b.splice(m,b.length-m),{L:y,U:v,pinv:N}}})),Qm=de("slu",["typed","abs","add","multiply","transpose","divideScalar","subtract","larger","largerEq","SparseMatrix"],(e=>{let{typed:t,abs:n,add:r,multiply:i,transpose:o,divideScalar:a,subtract:s,larger:u,largerEq:c,SparseMatrix:l}=e;const f=Gm({add:r,multiply:i,transpose:o}),p=Xm({abs:n,divideScalar:a,multiply:i,subtract:s,larger:u,largerEq:c,SparseMatrix:l});return t("slu",{"SparseMatrix, number, number":function(e,t,n){if(!ye(t)||t<0||t>3)throw new Error("Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]");if(n<0||n>1)throw new Error("Partial pivoting threshold must be a number from 0 to 1");const r=f(t,e,!1),i=p(e,r,n);return{L:i.L,U:i.U,p:i.pinv,q:r.q,toString:function(){return"L: "+this.L.toString()+"\nU: "+this.U.toString()+"\np: "+this.p.toString()+(this.q?"\nq: "+this.q.toString():"")+"\n"}}}})}));function Km(e,t){let n;const r=t.length,i=[];if(e)for(n=0;n<r;n++)i[e[n]]=t[n];else for(n=0;n<r;n++)i[n]=t[n];return i}const ed="lusolve",td=de(ed,["typed","matrix","lup","slu","usolve","lsolve","DenseMatrix"],(e=>{let{typed:t,matrix:n,lup:r,slu:i,usolve:o,lsolve:a,DenseMatrix:s}=e;const u=_c({DenseMatrix:s});return t(ed,{"Array, Array | Matrix":function(e,t){e=n(e);const i=r(e);return l(i.L,i.U,i.p,null,t).valueOf()},"DenseMatrix, Array | Matrix":function(e,t){const n=r(e);return l(n.L,n.U,n.p,null,t)},"SparseMatrix, Array | Matrix":function(e,t){const n=r(e);return l(n.L,n.U,n.p,null,t)},"SparseMatrix, Array | Matrix, number, number":function(e,t,n,r){const o=i(e,n,r);return l(o.L,o.U,o.p,o.q,t)},"Object, Array | Matrix":function(e,t){return l(e.L,e.U,e.p,e.q,t)}});function c(e){if(A(e))return e;if(N(e))return n(e);throw new TypeError("Invalid Matrix LU decomposition")}function l(e,t,n,r,i){e=c(e),t=c(t),n&&((i=u(e,i,!0))._data=Km(n,i._data));const s=a(e,i),l=o(t,s);return r&&(l._data=Km(r,l._data)),l}})),nd="polynomialRoot",rd=de(nd,["typed","isZero","equalScalar","add","subtract","multiply","divide","sqrt","unaryMinus","cbrt","typeOf","im","re"],(e=>{let{typed:t,isZero:n,equalScalar:r,add:i,subtract:o,multiply:a,divide:s,sqrt:u,unaryMinus:c,cbrt:l,typeOf:f,im:p,re:m}=e;return t(nd,{"number|Complex, ...number|Complex":(e,t)=>{const d=[e,...t];for(;d.length>0&&n(d[d.length-1]);)d.pop();if(d.length<2)throw new RangeError(`Polynomial [${e}, ${t}] must have a non-zero non-constant coefficient`);switch(d.length){case 2:return[c(s(d[0],d[1]))];case 3:{const[e,t,n]=d,i=a(2,n),l=a(t,t),f=a(4,n,e);if(r(l,f))return[s(c(t),i)];const p=u(o(l,f));return[s(o(p,t),i),s(o(c(p),t),i)]}case 4:{const[e,t,n,h]=d,g=c(a(3,h)),y=a(n,n),x=a(3,h,t),b=i(a(2,n,n,n),a(27,h,h,e)),w=a(9,h,n,t);if(r(y,x)&&r(b,w))return[s(n,g)];const v=o(y,x),N=o(b,w),A=i(a(18,h,n,t,e),a(n,n,t,t)),E=i(a(4,n,n,n,e),a(4,h,t,t,t),a(27,h,h,e,e));if(r(A,E))return[s(o(a(4,h,n,t),i(a(9,h,h,e),a(n,n,n))),a(h,v)),s(o(a(9,h,e),a(n,t)),a(2,v))];let S;return S=r(y,x)?N:s(i(N,u(o(a(N,N),a(4,v,v,v)))),2),l(S,!0).toArray().map((e=>s(i(n,e,s(v,e)),g))).map((e=>"Complex"===f(e)&&r(m(e),m(e)+p(e))?m(e):e))}default:throw new RangeError(`only implemented for cubic or lower-order polynomials, not ${d}`)}}})})),id=de("Help",["evaluate"],(e=>{let{evaluate:t}=e;function n(e){if(!(this instanceof n))throw new SyntaxError("Constructor must be called with the new operator");if(!e)throw new Error('Argument "doc" missing');this.doc=e}return n.prototype.type="Help",n.prototype.isHelp=!0,n.prototype.toString=function(){const e=this.doc||{};let n="\n";if(e.name&&(n+="Name: "+e.name+"\n\n"),e.category&&(n+="Category: "+e.category+"\n\n"),e.description&&(n+="Description:\n    "+e.description+"\n\n"),e.syntax&&(n+="Syntax:\n    "+e.syntax.join("\n    ")+"\n\n"),e.examples){n+="Examples:\n";let r=!1;const i=t("config()"),o={config:e=>(r=!0,t("config(newConfig)",{newConfig:e}))};for(let r=0;r<e.examples.length;r++){const i=e.examples[r];let a;n+="    "+i+"\n";try{a=t(i,o)}catch(e){a=e}void 0===a||D(a)||(n+="        "+pr(a,{precision:14})+"\n")}n+="\n",r&&t("config(originalConfig)",{originalConfig:i})}return e.mayThrow&&e.mayThrow.length&&(n+="Throws: "+e.mayThrow.join(", ")+"\n\n"),e.seealso&&e.seealso.length&&(n+="See also: "+e.seealso.join(", ")+"\n"),n},n.prototype.toJSON=function(){const e=ae(this.doc);return e.mathjs="Help",e},n.fromJSON=function(e){const t={};return Object.keys(e).filter((e=>"mathjs"!==e)).forEach((n=>{t[n]=e[n]})),new n(t)},n.prototype.valueOf=n.prototype.toString,n}),{isClass:!0}),od=de("Chain",["?on","math","typed"],(e=>{let{on:t,math:n,typed:r}=e;function i(e){if(!(this instanceof i))throw new SyntaxError("Constructor must be called with the new operator");ie(e)?this.value=e.value:this.value=e}function o(e,t){pe(i.prototype,e,(function(){const e=t();if("function"==typeof e)return a(e)}))}function a(e){return function(){if(0===arguments.length)return new i(e(this.value));const t=[this.value];for(let e=0;e<arguments.length;e++)t[e+1]=arguments[e];if(r.isTypedFunction(e)){const n=r.resolve(e,t);if(1===n.params.length)throw new Error("chain function "+e.name+" cannot match rest parameter between chain value and additional arguments.");return new i(n.implementation.apply(e,t))}return new i(e.apply(e,t))}}i.prototype.type="Chain",i.prototype.isChain=!0,i.prototype.done=function(){return this.value},i.prototype.valueOf=function(){return this.value},i.prototype.toString=function(){return pr(this.value)},i.prototype.toJSON=function(){return{mathjs:"Chain",value:this.value}},i.fromJSON=function(e){return new i(e.value)},i.createProxy=function(e,t){if("string"==typeof e)n=e,"function"==typeof(r=t)&&(i.prototype[n]=a(r));else for(const t in e)me(e,t)&&void 0===s[t]&&o(t,(()=>e[t]));var n,r};const s={expression:!0,docs:!0,type:!0,classes:!0,json:!0,error:!0,isChain:!0};return i.createProxy(n),t&&t("import",(function(e,t,n){n||o(e,t)})),i}),{isClass:!0}),ad={name:"e",category:"Constants",syntax:["e"],description:"Euler's number, the base of the natural logarithm. Approximately equal to 2.71828",examples:["e","e ^ 2","exp(2)","log(e)"],seealso:["exp"]},sd={name:"pi",category:"Constants",syntax:["pi"],description:"The number pi is a mathematical constant that is the ratio of a circle's circumference to its diameter, and is approximately equal to 3.14159",examples:["pi","sin(pi/2)"],seealso:["tau"]},ud={bignumber:{name:"bignumber",category:"Construction",syntax:["bignumber(x)"],description:"Create a big number from a number or string.",examples:["0.1 + 0.2","bignumber(0.1) + bignumber(0.2)",'bignumber("7.2")','bignumber("7.2e500")',"bignumber([0.1, 0.2, 0.3])"],seealso:["boolean","bigint","complex","fraction","index","matrix","string","unit"]},bigint:{name:"bigint",category:"Construction",syntax:["bigint(x)"],description:"Create a bigint, an integer with an arbitrary number of digits, from a number or string.",examples:["123123123123123123 # a large number will lose digits",'bigint("123123123123123123")','bignumber(["1", "3", "5"])'],seealso:["boolean","bignumber","number","complex","fraction","index","matrix","string","unit"]},boolean:{name:"boolean",category:"Construction",syntax:["x","boolean(x)"],description:"Convert a string or number into a boolean.",examples:["boolean(0)","boolean(1)","boolean(3)",'boolean("true")','boolean("false")',"boolean([1, 0, 1, 1])"],seealso:["bignumber","complex","index","matrix","number","string","unit"]},complex:{name:"complex",category:"Construction",syntax:["complex()","complex(re, im)","complex(string)"],description:"Create a complex number.",examples:["complex()","complex(2, 3)",'complex("7 - 2i")'],seealso:["bignumber","boolean","index","matrix","number","string","unit"]},createUnit:{name:"createUnit",category:"Construction",syntax:["createUnit(definitions)","createUnit(name, definition)"],description:"Create a user-defined unit and register it with the Unit type.",examples:['createUnit("foo")','createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})','createUnit("mph", "1 mile/hour")'],seealso:["unit","splitUnit"]},fraction:{name:"fraction",category:"Construction",syntax:["fraction(num)","fraction(matrix)","fraction(num,den)","fraction({n: num, d: den})"],description:"Create a fraction from a number or from integer numerator and denominator.",examples:["fraction(0.125)","fraction(1, 3) + fraction(2, 5)","fraction({n: 333, d: 53})","fraction([sqrt(9), sqrt(10), sqrt(11)])"],seealso:["bignumber","boolean","complex","index","matrix","string","unit"]},index:{name:"index",category:"Construction",syntax:["[start]","[start:end]","[start:step:end]","[start1, start 2, ...]","[start1:end1, start2:end2, ...]","[start1:step1:end1, start2:step2:end2, ...]"],description:"Create an index to get or replace a subset of a matrix",examples:["A = [1, 2, 3; 4, 5, 6]","A[1, :]","A[1, 2] = 50","A[1:2, 1:2] = 1","B = [1, 2, 3]","B[B>1 and B<3]"],seealso:["bignumber","boolean","complex","matrix","number","range","string","unit"]},matrix:{name:"matrix",category:"Construction",syntax:["[]","[a1, b1, ...; a2, b2, ...]","matrix()",'matrix("dense")',"matrix([...])"],description:"Create a matrix.",examples:["[]","[1, 2, 3]","[1, 2, 3; 4, 5, 6]","matrix()","matrix([3, 4])",'matrix([3, 4; 5, 6], "sparse")','matrix([3, 4; 5, 6], "sparse", "number")'],seealso:["bignumber","boolean","complex","index","number","string","unit","sparse"]},number:{name:"number",category:"Construction",syntax:["x","number(x)","number(unit, valuelessUnit)"],description:"Create a number or convert a string or boolean into a number.",examples:["2","2e3","4.05","number(2)",'number("7.2")',"number(true)","number([true, false, true, true])",'number(unit("52cm"), "m")'],seealso:["bignumber","bigint","boolean","complex","fraction","index","matrix","string","unit"]},sparse:{name:"sparse",category:"Construction",syntax:["sparse()","sparse([a1, b1, ...; a1, b2, ...])",'sparse([a1, b1, ...; a1, b2, ...], "number")'],description:"Create a sparse matrix.",examples:["sparse()","sparse([3, 4; 5, 6])",'sparse([3, 0; 5, 0], "number")'],seealso:["bignumber","boolean","complex","index","number","string","unit","matrix"]},splitUnit:{name:"splitUnit",category:"Construction",syntax:["splitUnit(unit: Unit, parts: Unit[])"],description:"Split a unit in an array of units whose sum is equal to the original unit.",examples:['splitUnit(1 m, ["feet", "inch"])'],seealso:["unit","createUnit"]},string:{name:"string",category:"Construction",syntax:['"text"',"string(x)"],description:"Create a string or convert a value to a string",examples:['"Hello World!"',"string(4.2)","string(3 + 2i)"],seealso:["bignumber","boolean","complex","index","matrix","number","unit"]},unit:{name:"unit",category:"Construction",syntax:["value unit","unit(value, unit)","unit(string)"],description:"Create a unit.",examples:["5.5 mm","3 inch",'unit(7.1, "kilogram")','unit("23 deg")'],seealso:["bignumber","boolean","complex","index","matrix","number","string"]},e:ad,E:ad,false:{name:"false",category:"Constants",syntax:["false"],description:"Boolean value false",examples:["false"],seealso:["true"]},i:{name:"i",category:"Constants",syntax:["i"],description:"Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.",examples:["i","i * i","sqrt(-1)"],seealso:[]},Infinity:{name:"Infinity",category:"Constants",syntax:["Infinity"],description:"Infinity, a number which is larger than the maximum number that can be handled by a floating point number.",examples:["Infinity","1 / 0"],seealso:[]},LN2:{name:"LN2",category:"Constants",syntax:["LN2"],description:"Returns the natural logarithm of 2, approximately equal to 0.693",examples:["LN2","log(2)"],seealso:[]},LN10:{name:"LN10",category:"Constants",syntax:["LN10"],description:"Returns the natural logarithm of 10, approximately equal to 2.302",examples:["LN10","log(10)"],seealso:[]},LOG2E:{name:"LOG2E",category:"Constants",syntax:["LOG2E"],description:"Returns the base-2 logarithm of E, approximately equal to 1.442",examples:["LOG2E","log(e, 2)"],seealso:[]},LOG10E:{name:"LOG10E",category:"Constants",syntax:["LOG10E"],description:"Returns the base-10 logarithm of E, approximately equal to 0.434",examples:["LOG10E","log(e, 10)"],seealso:[]},NaN:{name:"NaN",category:"Constants",syntax:["NaN"],description:"Not a number",examples:["NaN","0 / 0"],seealso:[]},null:{name:"null",category:"Constants",syntax:["null"],description:"Value null",examples:["null"],seealso:["true","false"]},pi:sd,PI:sd,phi:{name:"phi",category:"Constants",syntax:["phi"],description:"Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...",examples:["phi"],seealso:[]},SQRT1_2:{name:"SQRT1_2",category:"Constants",syntax:["SQRT1_2"],description:"Returns the square root of 1/2, approximately equal to 0.707",examples:["SQRT1_2","sqrt(1/2)"],seealso:[]},SQRT2:{name:"SQRT2",category:"Constants",syntax:["SQRT2"],description:"Returns the square root of 2, approximately equal to 1.414",examples:["SQRT2","sqrt(2)"],seealso:[]},tau:{name:"tau",category:"Constants",syntax:["tau"],description:"Tau is the ratio constant of a circle's circumference to radius, equal to 2 * pi, approximately 6.2832.",examples:["tau","2 * pi"],seealso:["pi"]},true:{name:"true",category:"Constants",syntax:["true"],description:"Boolean value true",examples:["true"],seealso:["false"]},version:{name:"version",category:"Constants",syntax:["version"],description:"A string with the version number of math.js",examples:["version"],seealso:[]},speedOfLight:{description:"Speed of light in vacuum",examples:["speedOfLight"]},gravitationConstant:{description:"Newtonian constant of gravitation",examples:["gravitationConstant"]},planckConstant:{description:"Planck constant",examples:["planckConstant"]},reducedPlanckConstant:{description:"Reduced Planck constant",examples:["reducedPlanckConstant"]},magneticConstant:{description:"Magnetic constant (vacuum permeability)",examples:["magneticConstant"]},electricConstant:{description:"Electric constant (vacuum permeability)",examples:["electricConstant"]},vacuumImpedance:{description:"Characteristic impedance of vacuum",examples:["vacuumImpedance"]},coulomb:{description:"Coulomb's constant. Deprecated in favor of coulombConstant",examples:["coulombConstant"]},coulombConstant:{description:"Coulomb's constant",examples:["coulombConstant"]},elementaryCharge:{description:"Elementary charge",examples:["elementaryCharge"]},bohrMagneton:{description:"Bohr magneton",examples:["bohrMagneton"]},conductanceQuantum:{description:"Conductance quantum",examples:["conductanceQuantum"]},inverseConductanceQuantum:{description:"Inverse conductance quantum",examples:["inverseConductanceQuantum"]},magneticFluxQuantum:{description:"Magnetic flux quantum",examples:["magneticFluxQuantum"]},nuclearMagneton:{description:"Nuclear magneton",examples:["nuclearMagneton"]},klitzing:{description:"Von Klitzing constant",examples:["klitzing"]},bohrRadius:{description:"Bohr radius",examples:["bohrRadius"]},classicalElectronRadius:{description:"Classical electron radius",examples:["classicalElectronRadius"]},electronMass:{description:"Electron mass",examples:["electronMass"]},fermiCoupling:{description:"Fermi coupling constant",examples:["fermiCoupling"]},fineStructure:{description:"Fine-structure constant",examples:["fineStructure"]},hartreeEnergy:{description:"Hartree energy",examples:["hartreeEnergy"]},protonMass:{description:"Proton mass",examples:["protonMass"]},deuteronMass:{description:"Deuteron Mass",examples:["deuteronMass"]},neutronMass:{description:"Neutron mass",examples:["neutronMass"]},quantumOfCirculation:{description:"Quantum of circulation",examples:["quantumOfCirculation"]},rydberg:{description:"Rydberg constant",examples:["rydberg"]},thomsonCrossSection:{description:"Thomson cross section",examples:["thomsonCrossSection"]},weakMixingAngle:{description:"Weak mixing angle",examples:["weakMixingAngle"]},efimovFactor:{description:"Efimov factor",examples:["efimovFactor"]},atomicMass:{description:"Atomic mass constant",examples:["atomicMass"]},avogadro:{description:"Avogadro's number",examples:["avogadro"]},boltzmann:{description:"Boltzmann constant",examples:["boltzmann"]},faraday:{description:"Faraday constant",examples:["faraday"]},firstRadiation:{description:"First radiation constant",examples:["firstRadiation"]},loschmidt:{description:"Loschmidt constant at T=273.15 K and p=101.325 kPa",examples:["loschmidt"]},gasConstant:{description:"Gas constant",examples:["gasConstant"]},molarPlanckConstant:{description:"Molar Planck constant",examples:["molarPlanckConstant"]},molarVolume:{description:"Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa",examples:["molarVolume"]},sackurTetrode:{description:"Sackur-Tetrode constant at T=1 K and p=101.325 kPa",examples:["sackurTetrode"]},secondRadiation:{description:"Second radiation constant",examples:["secondRadiation"]},stefanBoltzmann:{description:"Stefan-Boltzmann constant",examples:["stefanBoltzmann"]},wienDisplacement:{description:"Wien displacement law constant",examples:["wienDisplacement"]},molarMass:{description:"Molar mass constant",examples:["molarMass"]},molarMassC12:{description:"Molar mass constant of carbon-12",examples:["molarMassC12"]},gravity:{description:"Standard acceleration of gravity (standard acceleration of free-fall on Earth)",examples:["gravity"]},planckLength:{description:"Planck length",examples:["planckLength"]},planckMass:{description:"Planck mass",examples:["planckMass"]},planckTime:{description:"Planck time",examples:["planckTime"]},planckCharge:{description:"Planck charge",examples:["planckCharge"]},planckTemperature:{description:"Planck temperature",examples:["planckTemperature"]},derivative:{name:"derivative",category:"Algebra",syntax:["derivative(expr, variable)","derivative(expr, variable, {simplify: boolean})"],description:"Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.",examples:['derivative("2x^3", "x")','derivative("2x^3", "x", {simplify: false})','derivative("2x^2 + 3x + 4", "x")','derivative("sin(2x)", "x")','f = parse("x^2 + x")','x = parse("x")',"df = derivative(f, x)","df.evaluate({x: 3})"],seealso:["simplify","parse","evaluate"]},lsolve:{name:"lsolve",category:"Algebra",syntax:["x=lsolve(L, b)"],description:"Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lsolve(a, b)"],seealso:["lsolveAll","lup","lusolve","usolve","matrix","sparse"]},lsolveAll:{name:"lsolveAll",category:"Algebra",syntax:["x=lsolveAll(L, b)"],description:"Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lsolve(a, b)"],seealso:["lsolve","lup","lusolve","usolve","matrix","sparse"]},lup:{name:"lup",category:"Algebra",syntax:["lup(m)"],description:"Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U",examples:["lup([[2, 1], [1, 4]])","lup(matrix([[2, 1], [1, 4]]))","lup(sparse([[2, 1], [1, 4]]))"],seealso:["lusolve","lsolve","usolve","matrix","sparse","slu","qr"]},lusolve:{name:"lusolve",category:"Algebra",syntax:["x=lusolve(A, b)","x=lusolve(lu, b)"],description:"Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.",examples:["a = [-2, 3; 2, 1]","b = [11, 9]","x = lusolve(a, b)"],seealso:["lup","slu","lsolve","usolve","matrix","sparse"]},leafCount:{name:"leafCount",category:"Algebra",syntax:["leafCount(expr)"],description:"Computes the number of leaves in the parse tree of the given expression",examples:['leafCount("e^(i*pi)-1")','leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],seealso:["simplify"]},polynomialRoot:{name:"polynomialRoot",category:"Algebra",syntax:["x=polynomialRoot(-6, 3)","x=polynomialRoot(4, -4, 1)","x=polynomialRoot(-8, 12, -6, 1)"],description:"Finds the roots of a univariate polynomial given by its coefficients starting from constant, linear, and so on, increasing in degree.",examples:["a = polynomialRoot(-6, 11, -6, 1)"],seealso:["cbrt","sqrt"]},resolve:{name:"resolve",category:"Algebra",syntax:["resolve(node, scope)"],description:"Recursively substitute variables in an expression tree.",examples:['resolve(parse("1 + x"), { x: 7 })','resolve(parse("size(text)"), { text: "Hello World" })','resolve(parse("x + y"), { x: parse("3z") })','resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],seealso:["simplify","evaluate"],mayThrow:["ReferenceError"]},simplify:{name:"simplify",category:"Algebra",syntax:["simplify(expr)","simplify(expr, rules)"],description:"Simplify an expression tree.",examples:['simplify("3 + 2 / 4")','simplify("2x + x")','f = parse("x * (x + 2 + x)")',"simplified = simplify(f)","simplified.evaluate({x: 2})"],seealso:["simplifyCore","derivative","evaluate","parse","rationalize","resolve"]},simplifyConstant:{name:"simplifyConstant",category:"Algebra",syntax:["simplifyConstant(expr)","simplifyConstant(expr, options)"],description:"Replace constant subexpressions of node with their values.",examples:['simplifyConstant("(3-3)*x")','simplifyConstant(parse("z-cos(tau/8)"))'],seealso:["simplify","simplifyCore","evaluate"]},simplifyCore:{name:"simplifyCore",category:"Algebra",syntax:["simplifyCore(node)"],description:"Perform simple one-pass simplifications on an expression tree.",examples:['simplifyCore(parse("0*x"))','simplifyCore(parse("(x+0)*2"))'],seealso:["simplify","simplifyConstant","evaluate"]},symbolicEqual:{name:"symbolicEqual",category:"Algebra",syntax:["symbolicEqual(expr1, expr2)","symbolicEqual(expr1, expr2, options)"],description:"Returns true if the difference of the expressions simplifies to 0",examples:['symbolicEqual("x*y","y*x")','symbolicEqual("abs(x^2)", "x^2")','symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],seealso:["simplify","evaluate"]},rationalize:{name:"rationalize",category:"Algebra",syntax:["rationalize(expr)","rationalize(expr, scope)","rationalize(expr, scope, detailed)"],description:"Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.",examples:['rationalize("2x/y - y/(x+1)")','rationalize("2x/y - y/(x+1)", true)'],seealso:["simplify"]},slu:{name:"slu",category:"Algebra",syntax:["slu(A, order, threshold)"],description:"Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U",examples:["slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)"],seealso:["lusolve","lsolve","usolve","matrix","sparse","lup","qr"]},usolve:{name:"usolve",category:"Algebra",syntax:["x=usolve(U, b)"],description:"Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.",examples:["x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])"],seealso:["usolveAll","lup","lusolve","lsolve","matrix","sparse"]},usolveAll:{name:"usolveAll",category:"Algebra",syntax:["x=usolve(U, b)"],description:"Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.",examples:["x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])"],seealso:["usolve","lup","lusolve","lsolve","matrix","sparse"]},qr:{name:"qr",category:"Algebra",syntax:["qr(A)"],description:"Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.",examples:["qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])"],seealso:["lup","slu","matrix"]},abs:{name:"abs",category:"Arithmetic",syntax:["abs(x)"],description:"Compute the absolute value.",examples:["abs(3.5)","abs(-4.2)"],seealso:["sign"]},add:{name:"add",category:"Operators",syntax:["x + y","add(x, y)"],description:"Add two values.",examples:["a = 2.1 + 3.6","a - 3.6","3 + 2i","3 cm + 2 inch",'"2.3" + "4"'],seealso:["subtract"]},cbrt:{name:"cbrt",category:"Arithmetic",syntax:["cbrt(x)","cbrt(x, allRoots)"],description:"Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned",examples:["cbrt(64)","cube(4)","cbrt(-8)","cbrt(2 + 3i)","cbrt(8i)","cbrt(8i, true)","cbrt(27 m^3)"],seealso:["square","sqrt","cube","multiply"]},ceil:{name:"ceil",category:"Arithmetic",syntax:["ceil(x)","ceil(x, n)","ceil(unit, valuelessUnit)","ceil(unit, n, valuelessUnit)"],description:"Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.",examples:["ceil(3.2)","ceil(3.8)","ceil(-4.2)","ceil(3.241cm, cm)","ceil(3.241cm, 2, cm)"],seealso:["floor","fix","round"]},cube:{name:"cube",category:"Arithmetic",syntax:["cube(x)"],description:"Compute the cube of a value. The cube of x is x * x * x.",examples:["cube(2)","2^3","2 * 2 * 2"],seealso:["multiply","square","pow"]},divide:{name:"divide",category:"Operators",syntax:["x / y","divide(x, y)"],description:"Divide two values.",examples:["a = 2 / 3","a * 3","4.5 / 2","3 + 4 / 2","(3 + 4) / 2","18 km / 4.5"],seealso:["multiply"]},dotDivide:{name:"dotDivide",category:"Operators",syntax:["x ./ y","dotDivide(x, y)"],description:"Divide two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a ./ b"],seealso:["multiply","dotMultiply","divide"]},dotMultiply:{name:"dotMultiply",category:"Operators",syntax:["x .* y","dotMultiply(x, y)"],description:"Multiply two values element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","b = [2, 1, 1; 3, 2, 5]","a .* b"],seealso:["multiply","divide","dotDivide"]},dotPow:{name:"dotPow",category:"Operators",syntax:["x .^ y","dotPow(x, y)"],description:"Calculates the power of x to y element wise.",examples:["a = [1, 2, 3; 4, 5, 6]","a .^ 2"],seealso:["pow"]},exp:{name:"exp",category:"Arithmetic",syntax:["exp(x)"],description:"Calculate the exponent of a value.",examples:["exp(1.3)","e ^ 1.3","log(exp(1.3))","x = 2.4","(exp(i*x) == cos(x) + i*sin(x))   # Euler's formula"],seealso:["expm","expm1","pow","log"]},expm:{name:"expm",category:"Arithmetic",syntax:["exp(x)"],description:"Compute the matrix exponential, expm(A) = e^A. The matrix must be square. Not to be confused with exp(a), which performs element-wise exponentiation.",examples:["expm([[0,2],[0,0]])"],seealso:["exp"]},expm1:{name:"expm1",category:"Arithmetic",syntax:["expm1(x)"],description:"Calculate the value of subtracting 1 from the exponential value.",examples:["expm1(2)","pow(e, 2) - 1","log(expm1(2) + 1)"],seealso:["exp","pow","log"]},fix:{name:"fix",category:"Arithmetic",syntax:["fix(x)","fix(x, n)","fix(unit, valuelessUnit)","fix(unit, n, valuelessUnit)"],description:"Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.",examples:["fix(3.2)","fix(3.8)","fix(-4.2)","fix(-4.8)","fix(3.241cm, cm)","fix(3.241cm, 2, cm)"],seealso:["ceil","floor","round"]},floor:{name:"floor",category:"Arithmetic",syntax:["floor(x)","floor(x, n)","floor(unit, valuelessUnit)","floor(unit, n, valuelessUnit)"],description:"Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.",examples:["floor(3.2)","floor(3.8)","floor(-4.2)","floor(3.241cm, cm)","floor(3.241cm, 2, cm)"],seealso:["ceil","fix","round"]},gcd:{name:"gcd",category:"Arithmetic",syntax:["gcd(a, b)","gcd(a, b, c, ...)"],description:"Compute the greatest common divisor.",examples:["gcd(8, 12)","gcd(-4, 6)","gcd(25, 15, -10)"],seealso:["lcm","xgcd"]},hypot:{name:"hypot",category:"Arithmetic",syntax:["hypot(a, b, c, ...)","hypot([a, b, c, ...])"],description:"Calculate the hypotenuse of a list with values.",examples:["hypot(3, 4)","sqrt(3^2 + 4^2)","hypot(-2)","hypot([3, 4, 5])"],seealso:["abs","norm"]},lcm:{name:"lcm",category:"Arithmetic",syntax:["lcm(x, y)"],description:"Compute the least common multiple.",examples:["lcm(4, 6)","lcm(6, 21)","lcm(6, 21, 5)"],seealso:["gcd"]},log:{name:"log",category:"Arithmetic",syntax:["log(x)","log(x, base)"],description:"Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).",examples:["log(3.5)","a = log(2.4)","exp(a)","10 ^ 4","log(10000, 10)","log(10000) / log(10)","b = log(1024, 2)","2 ^ b"],seealso:["exp","log1p","log2","log10"]},log2:{name:"log2",category:"Arithmetic",syntax:["log2(x)"],description:"Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.",examples:["log2(0.03125)","log2(16)","log2(16) / log2(2)","pow(2, 4)"],seealso:["exp","log1p","log","log10"]},log1p:{name:"log1p",category:"Arithmetic",syntax:["log1p(x)","log1p(x, base)"],description:"Calculate the logarithm of a `value+1`",examples:["log1p(2.5)","exp(log1p(1.4))","pow(10, 4)","log1p(9999, 10)","log1p(9999) / log(10)"],seealso:["exp","log","log2","log10"]},log10:{name:"log10",category:"Arithmetic",syntax:["log10(x)"],description:"Compute the 10-base logarithm of a value.",examples:["log10(0.00001)","log10(10000)","10 ^ 4","log(10000) / log(10)","log(10000, 10)"],seealso:["exp","log"]},mod:{name:"mod",category:"Operators",syntax:["x % y","x mod y","mod(x, y)"],description:"Calculates the modulus, the remainder of an integer division.",examples:["7 % 3","11 % 2","10 mod 4","isOdd(x) = x % 2","isOdd(2)","isOdd(3)"],seealso:["divide"]},multiply:{name:"multiply",category:"Operators",syntax:["x * y","multiply(x, y)"],description:"multiply two values.",examples:["a = 2.1 * 3.4","a / 3.4","2 * 3 + 4","2 * (3 + 4)","3 * 2.1 km"],seealso:["divide"]},norm:{name:"norm",category:"Arithmetic",syntax:["norm(x)","norm(x, p)"],description:"Calculate the norm of a number, vector or matrix.",examples:["abs(-3.5)","norm(-3.5)","norm(3 - 4i)","norm([1, 2, -3], Infinity)","norm([1, 2, -3], -Infinity)","norm([3, 4], 2)","norm([[1, 2], [3, 4]], 1)",'norm([[1, 2], [3, 4]], "inf")','norm([[1, 2], [3, 4]], "fro")']},nthRoot:{name:"nthRoot",category:"Arithmetic",syntax:["nthRoot(a)","nthRoot(a, root)"],description:'Calculate the nth root of a value. The principal nth root of a positive real number A, is the positive real solution of the equation "x^root = A".',examples:["4 ^ 3","nthRoot(64, 3)","nthRoot(9, 2)","sqrt(9)"],seealso:["nthRoots","pow","sqrt"]},nthRoots:{name:"nthRoots",category:"Arithmetic",syntax:["nthRoots(A)","nthRoots(A, root)"],description:'Calculate the nth roots of a value. An nth root of a positive real number A, is a positive real solution of the equation "x^root = A". This function returns an array of complex values.',examples:["nthRoots(1)","nthRoots(1, 3)"],seealso:["sqrt","pow","nthRoot"]},pow:{name:"pow",category:"Operators",syntax:["x ^ y","pow(x, y)"],description:"Calculates the power of x to y, x^y.",examples:["2^3","2*2*2","1 + e ^ (pi * i)","pow([[1, 2], [4, 3]], 2)","pow([[1, 2], [4, 3]], -1)"],seealso:["multiply","nthRoot","nthRoots","sqrt"]},round:{name:"round",category:"Arithmetic",syntax:["round(x)","round(x, n)","round(unit, valuelessUnit)","round(unit, n, valuelessUnit)"],description:"round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.",examples:["round(3.2)","round(3.8)","round(-4.2)","round(-4.8)","round(pi, 3)","round(123.45678, 2)","round(3.241cm, 2, cm)","round([3.2, 3.8, -4.7])"],seealso:["ceil","floor","fix"]},sign:{name:"sign",category:"Arithmetic",syntax:["sign(x)"],description:"Compute the sign of a value. The sign of a value x is 1 when x>0, -1 when x<0, and 0 when x=0.",examples:["sign(3.5)","sign(-4.2)","sign(0)"],seealso:["abs"]},sqrt:{name:"sqrt",category:"Arithmetic",syntax:["sqrt(x)"],description:"Compute the square root value. If x = y * y, then y is the square root of x.",examples:["sqrt(25)","5 * 5","sqrt(-1)"],seealso:["square","sqrtm","multiply","nthRoot","nthRoots","pow"]},sqrtm:{name:"sqrtm",category:"Arithmetic",syntax:["sqrtm(x)"],description:"Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.",examples:["sqrtm([[33, 24], [48, 57]])"],seealso:["sqrt","abs","square","multiply"]},square:{name:"square",category:"Arithmetic",syntax:["square(x)"],description:"Compute the square of a value. The square of x is x * x.",examples:["square(3)","sqrt(9)","3^2","3 * 3"],seealso:["multiply","pow","sqrt","cube"]},subtract:{name:"subtract",category:"Operators",syntax:["x - y","subtract(x, y)"],description:"subtract two values.",examples:["a = 5.3 - 2","a + 2","2/3 - 1/6","2 * 3 - 3","2.1 km - 500m"],seealso:["add"]},unaryMinus:{name:"unaryMinus",category:"Operators",syntax:["-x","unaryMinus(x)"],description:"Inverse the sign of a value. Converts booleans and strings to numbers.",examples:["-4.5","-(-5.6)",'-"22"'],seealso:["add","subtract","unaryPlus"]},unaryPlus:{name:"unaryPlus",category:"Operators",syntax:["+x","unaryPlus(x)"],description:"Converts booleans and strings to numbers.",examples:["+true",'+"2"'],seealso:["add","subtract","unaryMinus"]},xgcd:{name:"xgcd",category:"Arithmetic",syntax:["xgcd(a, b)"],description:"Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.",examples:["xgcd(8, 12)","gcd(8, 12)","xgcd(36163, 21199)"],seealso:["gcd","lcm"]},invmod:{name:"invmod",category:"Arithmetic",syntax:["invmod(a, b)"],description:"Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)",examples:["invmod(8, 12)","invmod(7, 13)","invmod(15151, 15122)"],seealso:["gcd","xgcd"]},bitAnd:{name:"bitAnd",category:"Bitwise",syntax:["x & y","bitAnd(x, y)"],description:"Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0",examples:["5 & 3","bitAnd(53, 131)","[1, 12, 31] & 42"],seealso:["bitNot","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]},bitNot:{name:"bitNot",category:"Bitwise",syntax:["~x","bitNot(x)"],description:"Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.",examples:["~1","~2","bitNot([2, -3, 4])"],seealso:["bitAnd","bitOr","bitXor","leftShift","rightArithShift","rightLogShift"]},bitOr:{name:"bitOr",category:"Bitwise",syntax:["x | y","bitOr(x, y)"],description:"Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.",examples:["5 | 3","bitOr([1, 2, 3], 4)"],seealso:["bitAnd","bitNot","bitXor","leftShift","rightArithShift","rightLogShift"]},bitXor:{name:"bitXor",category:"Bitwise",syntax:["bitXor(x, y)"],description:"Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.",examples:["bitOr(1, 2)","bitXor([2, 3, 4], 4)"],seealso:["bitAnd","bitNot","bitOr","leftShift","rightArithShift","rightLogShift"]},leftShift:{name:"leftShift",category:"Bitwise",syntax:["x << y","leftShift(x, y)"],description:"Bitwise left logical shift of a value x by y number of bits.",examples:["4 << 1","8 >> 1"],seealso:["bitAnd","bitNot","bitOr","bitXor","rightArithShift","rightLogShift"]},rightArithShift:{name:"rightArithShift",category:"Bitwise",syntax:["x >> y","rightArithShift(x, y)"],description:"Bitwise right arithmetic shift of a value x by y number of bits.",examples:["8 >> 1","4 << 1","-12 >> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightLogShift"]},rightLogShift:{name:"rightLogShift",category:"Bitwise",syntax:["x >>> y","rightLogShift(x, y)"],description:"Bitwise right logical shift of a value x by y number of bits.",examples:["8 >>> 1","4 << 1","-12 >>> 2"],seealso:["bitAnd","bitNot","bitOr","bitXor","leftShift","rightArithShift"]},bellNumbers:{name:"bellNumbers",category:"Combinatorics",syntax:["bellNumbers(n)"],description:"The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.",examples:["bellNumbers(3)","bellNumbers(8)"],seealso:["stirlingS2"]},catalan:{name:"catalan",category:"Combinatorics",syntax:["catalan(n)"],description:"The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.",examples:["catalan(3)","catalan(8)"],seealso:["bellNumbers"]},composition:{name:"composition",category:"Combinatorics",syntax:["composition(n, k)"],description:"The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.",examples:["composition(5, 3)"],seealso:["combinations"]},stirlingS2:{name:"stirlingS2",category:"Combinatorics",syntax:["stirlingS2(n, k)"],description:"he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.",examples:["stirlingS2(5, 3)"],seealso:["bellNumbers"]},config:{name:"config",category:"Core",syntax:["config()","config(options)"],description:"Get configuration or change configuration.",examples:["config()","1/3 + 1/4",'config({number: "Fraction"})',"1/3 + 1/4"],seealso:[]},import:{name:"import",category:"Core",syntax:["import(functions)","import(functions, options)"],description:"Import functions or constants from an object.",examples:["import({myFn: f(x)=x^2, myConstant: 32 })","myFn(2)","myConstant"],seealso:[]},typed:{name:"typed",category:"Core",syntax:["typed(signatures)","typed(name, signatures)"],description:"Create a typed function.",examples:['double = typed({ "number": f(x)=x+x, "string": f(x)=concat(x,x) })',"double(2)",'double("hello")'],seealso:[]},arg:{name:"arg",category:"Complex",syntax:["arg(x)"],description:"Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).",examples:["arg(2 + 2i)","atan2(3, 2)","arg(2 + 3i)"],seealso:["re","im","conj","abs"]},conj:{name:"conj",category:"Complex",syntax:["conj(x)"],description:"Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.",examples:["conj(2 + 3i)","conj(2 - 3i)","conj(-5.2i)"],seealso:["re","im","abs","arg"]},re:{name:"re",category:"Complex",syntax:["re(x)"],description:"Get the real part of a complex number.",examples:["re(2 + 3i)","im(2 + 3i)","re(-5.2i)","re(2.4)"],seealso:["im","conj","abs","arg"]},im:{name:"im",category:"Complex",syntax:["im(x)"],description:"Get the imaginary part of a complex number.",examples:["im(2 + 3i)","re(2 + 3i)","im(-5.2i)","im(2.4)"],seealso:["re","conj","abs","arg"]},evaluate:{name:"evaluate",category:"Expression",syntax:["evaluate(expression)","evaluate(expression, scope)","evaluate([expr1, expr2, expr3, ...])","evaluate([expr1, expr2, expr3, ...], scope)"],description:"Evaluate an expression or an array with expressions.",examples:['evaluate("2 + 3")','evaluate("sqrt(16)")','evaluate("2 inch to cm")','evaluate("sin(x * pi)", { "x": 1/2 })','evaluate(["width=2", "height=4","width*height"])'],seealso:["parser","parse","compile"]},help:{name:"help",category:"Expression",syntax:["help(object)","help(string)"],description:"Display documentation on a function or data type.",examples:["help(sqrt)",'help("complex")'],seealso:[]},parse:{name:"parse",category:"Expression",syntax:["parse(expr)","parse(expr, options)","parse([expr1, expr2, expr3, ...])","parse([expr1, expr2, expr3, ...], options)"],description:"Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().",examples:['node1 = parse("sqrt(3^2 + 4^2)")',"node1.evaluate()","code1 = node1.compile()","code1.evaluate()","scope = {a: 3, b: 4}",'node2 = parse("a * b")',"node2.evaluate(scope)","code2 = node2.compile()","code2.evaluate(scope)"],seealso:["parser","evaluate","compile"]},parser:{name:"parser",category:"Expression",syntax:["parser()"],description:"Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.",examples:["myParser = parser()",'myParser.evaluate("sqrt(3^2 + 4^2)")','myParser.set("x", 3)','myParser.evaluate("y = x + 3")','myParser.evaluate(["y = x + 3", "y = y + 1"])','myParser.get("y")'],seealso:["evaluate","parse","compile"]},compile:{name:"compile",category:"Expression",syntax:["compile(expr) ","compile([expr1, expr2, expr3, ...])"],description:"Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.",examples:['code1 = compile("sqrt(3^2 + 4^2)")',"code1.evaluate() ",'code2 = compile("a * b")',"code2.evaluate({a: 3, b: 4})"],seealso:["parser","parse","evaluate"]},distance:{name:"distance",category:"Geometry",syntax:["distance([x1, y1], [x2, y2])","distance([[x1, y1], [x2, y2]])"],description:"Calculates the Euclidean distance between two points.",examples:["distance([0,0], [4,4])","distance([[0,0], [4,4]])"],seealso:[]},intersect:{name:"intersect",category:"Geometry",syntax:["intersect(expr1, expr2, expr3, expr4)","intersect(expr1, expr2, expr3)"],description:"Computes the intersection point of lines and/or planes.",examples:["intersect([0, 0], [10, 10], [10, 0], [0, 10])","intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])"],seealso:[]},and:{name:"and",category:"Logical",syntax:["x and y","and(x, y)"],description:"Logical and. Test whether two values are both defined with a nonzero/nonempty value.",examples:["true and false","true and true","2 and 4"],seealso:["not","or","xor"]},not:{name:"not",category:"Logical",syntax:["not x","not(x)"],description:"Logical not. Flips the boolean value of given argument.",examples:["not true","not false","not 2","not 0"],seealso:["and","or","xor"]},nullish:{name:"nullish",category:"Logical",syntax:["x ?? y","nullish(x, y)"],description:"Nullish coalescing operator. Returns the right-hand operand when the left-hand operand is null or undefined, and otherwise returns the left-hand operand.",examples:["null ?? 42","undefined ?? 42","0 ?? 42","false ?? 42","null ?? undefined ?? 42"],seealso:["and","or","not"]},or:{name:"or",category:"Logical",syntax:["x or y","or(x, y)"],description:"Logical or. Test if at least one value is defined with a nonzero/nonempty value.",examples:["true or false","false or false","0 or 4"],seealso:["not","and","xor"]},xor:{name:"xor",category:"Logical",syntax:["x xor y","xor(x, y)"],description:"Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.",examples:["true xor false","false xor false","true xor true","0 xor 4"],seealso:["not","and","or"]},mapSlices:{name:"mapSlices",category:"Matrix",syntax:["mapSlices(A, dim, callback)"],description:"Generate a matrix one dimension less than A by applying callback to each slice of A along dimension dim.",examples:["A = [[1, 2], [3, 4]]","mapSlices(A, 1, sum)","mapSlices(A, 2, prod)"],seealso:["map","forEach"]},concat:{name:"concat",category:"Matrix",syntax:["concat(A, B, C, ...)","concat(A, B, C, ..., dim)"],description:"Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.",examples:["A = [1, 2; 5, 6]","B = [3, 4; 7, 8]","concat(A, B)","concat(A, B, 1)","concat(A, B, 2)"],seealso:["det","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},count:{name:"count",category:"Matrix",syntax:["count(x)"],description:"Count the number of elements of a matrix, array or string.",examples:["a = [1, 2; 3, 4; 5, 6]","count(a)","size(a)",'count("hello world")'],seealso:["size"]},cross:{name:"cross",category:"Matrix",syntax:["cross(A, B)"],description:"Calculate the cross product for two vectors in three dimensional space.",examples:["cross([1, 1, 0],  [0, 1, 1])","cross([3, -3, 1], [4, 9, 2])","cross([2, 3, 4],  [5, 6, 7])"],seealso:["multiply","dot"]},column:{name:"column",category:"Matrix",syntax:["column(x, index)"],description:"Return a column from a matrix or array.",examples:["A = [[1, 2], [3, 4]]","column(A, 1)","column(A, 2)"],seealso:["row","matrixFromColumns"]},ctranspose:{name:"ctranspose",category:"Matrix",syntax:["x'","ctranspose(x)"],description:"Complex Conjugate and Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","ctranspose(a)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","zeros"]},det:{name:"det",category:"Matrix",syntax:["det(x)"],description:"Calculate the determinant of a matrix",examples:["det([1, 2; 3, 4])","det([-2, 2, 3; -1, 1, 3; 2, 0, -1])"],seealso:["concat","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},diag:{name:"diag",category:"Matrix",syntax:["diag(x)","diag(x, k)"],description:"Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.",examples:["diag(1:3)","diag(1:3, 1)","a = [1, 2, 3; 4, 5, 6; 7, 8, 9]","diag(a)"],seealso:["concat","det","identity","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},diff:{name:"diff",category:"Matrix",syntax:["diff(arr)","diff(arr, dim)"],description:["Create a new matrix or array with the difference of the passed matrix or array.","Dim parameter is optional and used to indicate the dimension of the array/matrix to apply the difference","If no dimension parameter is passed it is assumed as dimension 0","Dimension is zero-based in javascript and one-based in the parser","Arrays must be 'rectangular' meaning arrays like [1, 2]","If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays"],examples:["A = [1, 2, 4, 7, 0]","diff(A)","diff(A, 1)","B = [[1, 2], [3, 4]]","diff(B)","diff(B, 1)","diff(B, 2)","diff(B, bignumber(2))","diff([[1, 2], matrix([3, 4])], 2)"],seealso:["subtract","partitionSelect"]},dot:{name:"dot",category:"Matrix",syntax:["dot(A, B)","A * B"],description:"Calculate the dot product of two vectors. The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn",examples:["dot([2, 4, 1], [2, 2, 3])","[2, 4, 1] * [2, 2, 3]"],seealso:["multiply","cross"]},getMatrixDataType:{name:"getMatrixDataType",category:"Matrix",syntax:["getMatrixDataType(x)"],description:'Find the data type of all elements in a matrix or array, for example "number" if all items are a number and "Complex" if all values are complex numbers. If a matrix contains more than one data type, it will return "mixed".',examples:["getMatrixDataType([1, 2, 3])","getMatrixDataType([[5 cm], [2 inch]])",'getMatrixDataType([1, "text"])',"getMatrixDataType([1, bignumber(4)])"],seealso:["matrix","sparse","typeOf"]},identity:{name:"identity",category:"Matrix",syntax:["identity(n)","identity(m, n)","identity([m, n])"],description:"Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.",examples:["identity(3)","identity(3, 5)","a = [1, 2, 3; 4, 5, 6]","identity(size(a))"],seealso:["concat","det","diag","inv","ones","range","size","squeeze","subset","trace","transpose","zeros"]},filter:{name:"filter",category:"Matrix",syntax:["filter(x, test)"],description:"Filter items in a matrix.",examples:["isPositive(x) = x > 0","filter([6, -2, -1, 4, 3], isPositive)","filter([6, -2, 0, 1, 0], x != 0)"],seealso:["sort","map","forEach"]},flatten:{name:"flatten",category:"Matrix",syntax:["flatten(x)"],description:"Flatten a multi dimensional matrix into a single dimensional matrix.",examples:["a = [1, 2, 3; 4, 5, 6]","size(a)","b = flatten(a)","size(b)"],seealso:["concat","resize","size","squeeze"]},forEach:{name:"forEach",category:"Matrix",syntax:["forEach(x, callback)"],description:"Iterates over all elements of a matrix/array, and executes the given callback function.",examples:["numberOfPets = {}","addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;",'forEach(["Dog","Cat","Cat"], addPet)',"numberOfPets"],seealso:["map","sort","filter"]},inv:{name:"inv",category:"Matrix",syntax:["inv(x)"],description:"Calculate the inverse of a matrix",examples:["inv([1, 2; 3, 4])","inv(4)","1 / 4"],seealso:["concat","det","diag","identity","ones","range","size","squeeze","subset","trace","transpose","zeros"]},pinv:{name:"pinv",category:"Matrix",syntax:["pinv(x)"],description:"Calculate the Moore–Penrose inverse of a matrix",examples:["pinv([1, 2; 3, 4])","pinv([[1, 0], [0, 1], [0, 1]])","pinv(4)"],seealso:["inv"]},eigs:{name:"eigs",category:"Matrix",syntax:["eigs(x)"],description:"Calculate the eigenvalues and optionally eigenvectors of a square matrix",examples:["eigs([[5, 2.3], [2.3, 1]])","eigs([[1, 2, 3], [4, 5, 6], [7, 8, 9]], { precision: 1e-6, eigenvectors: false })"],seealso:["inv"]},kron:{name:"kron",category:"Matrix",syntax:["kron(x, y)"],description:"Calculates the Kronecker product of 2 matrices or vectors.",examples:["kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])","kron([1,1], [2,3,4])"],seealso:["multiply","dot","cross"]},matrixFromFunction:{name:"matrixFromFunction",category:"Matrix",syntax:["matrixFromFunction(size, fn)","matrixFromFunction(size, fn, format)","matrixFromFunction(size, fn, format, datatype)","matrixFromFunction(size, format, fn)","matrixFromFunction(size, format, datatype, fn)"],description:"Create a matrix by evaluating a generating function at each index.",examples:["f(I) = I[1] - I[2]","matrixFromFunction([3,3], f)","g(I) = I[1] - I[2] == 1 ? 4 : 0",'matrixFromFunction([100, 100], "sparse", g)',"matrixFromFunction([5], random)"],seealso:["matrix","matrixFromRows","matrixFromColumns","zeros"]},matrixFromRows:{name:"matrixFromRows",category:"Matrix",syntax:["matrixFromRows(...arr)","matrixFromRows(row1, row2)","matrixFromRows(row1, row2, row3)"],description:"Create a dense matrix from vectors as individual rows.",examples:["matrixFromRows([1, 2, 3], [[4],[5],[6]])"],seealso:["matrix","matrixFromColumns","matrixFromFunction","zeros"]},matrixFromColumns:{name:"matrixFromColumns",category:"Matrix",syntax:["matrixFromColumns(...arr)","matrixFromColumns(row1, row2)","matrixFromColumns(row1, row2, row3)"],description:"Create a dense matrix from vectors as individual columns.",examples:["matrixFromColumns([1, 2, 3], [[4],[5],[6]])"],seealso:["matrix","matrixFromRows","matrixFromFunction","zeros"]},map:{name:"map",category:"Matrix",syntax:["map(x, callback)","map(x, y, ..., callback)"],description:"Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array or the matrices/arrays.",examples:["map([1, 2, 3], square)","map([1, 2], [3, 4], f(a,b) = a + b)"],seealso:["filter","forEach"]},ones:{name:"ones",category:"Matrix",syntax:["ones(m)","ones(m, n)","ones(m, n, p, ...)","ones([m])","ones([m, n])","ones([m, n, p, ...])"],description:"Create a matrix containing ones.",examples:["ones(3)","ones(3, 5)","ones([2,3]) * 4.5","a = [1, 2, 3; 4, 5, 6]","ones(size(a))"],seealso:["concat","det","diag","identity","inv","range","size","squeeze","subset","trace","transpose","zeros"]},partitionSelect:{name:"partitionSelect",category:"Matrix",syntax:["partitionSelect(x, k)","partitionSelect(x, k, compare)"],description:"Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.",examples:["partitionSelect([5, 10, 1], 2)",'partitionSelect(["C", "B", "A", "D"], 1, compareText)',"arr = [5, 2, 1]","partitionSelect(arr, 0) # returns 1, arr is now: [1, 2, 5]","arr","partitionSelect(arr, 1, 'desc') # returns 2, arr is now: [5, 2, 1]","arr"],seealso:["sort"]},range:{name:"range",category:"Type",syntax:["start:end","start:step:end","range(start, end)","range(start, end, step)","range(string)"],description:"Create a range. Lower bound of the range is included, upper bound is excluded.",examples:["1:5","3:-1:-3","range(3, 7)","range(0, 12, 2)",'range("4:10")',"range(1m, 1m, 3m)","a = [1, 2, 3, 4; 5, 6, 7, 8]","a[1:2, 1:2]"],seealso:["concat","det","diag","identity","inv","ones","size","squeeze","subset","trace","transpose","zeros"]},resize:{name:"resize",category:"Matrix",syntax:["resize(x, size)","resize(x, size, defaultValue)"],description:"Resize a matrix.",examples:["resize([1,2,3,4,5], [3])","resize([1,2,3], [5])","resize([1,2,3], [5], -1)","resize(2, [2, 3])",'resize("hello", [8], "!")'],seealso:["size","subset","squeeze","reshape"]},reshape:{name:"reshape",category:"Matrix",syntax:["reshape(x, sizes)"],description:"Reshape a multi dimensional array to fit the specified dimensions.",examples:["reshape([1, 2, 3, 4, 5, 6], [2, 3])","reshape([[1, 2], [3, 4]], [1, 4])","reshape([[1, 2], [3, 4]], [4])","reshape([1, 2, 3, 4], [-1, 2])"],seealso:["size","squeeze","resize"]},rotate:{name:"rotate",category:"Matrix",syntax:["rotate(w, theta)","rotate(w, theta, v)"],description:"Returns a 2-D rotation matrix (2x2) for a given angle (in radians). Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.",examples:["rotate([1, 0], pi / 2)",'rotate(matrix([1, 0]), unit("35deg"))','rotate([1, 0, 0], unit("90deg"), [0, 0, 1])','rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],seealso:["matrix","rotationMatrix"]},rotationMatrix:{name:"rotationMatrix",category:"Matrix",syntax:["rotationMatrix(theta)","rotationMatrix(theta, v)","rotationMatrix(theta, v, format)"],description:"Returns a 2-D rotation matrix (2x2) for a given angle (in radians). Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.",examples:["rotationMatrix(pi / 2)",'rotationMatrix(unit("45deg"), [0, 0, 1])','rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],seealso:["cos","sin"]},row:{name:"row",category:"Matrix",syntax:["row(x, index)"],description:"Return a row from a matrix or array.",examples:["A = [[1, 2], [3, 4]]","row(A, 1)","row(A, 2)"],seealso:["column","matrixFromRows"]},size:{name:"size",category:"Matrix",syntax:["size(x)"],description:"Calculate the size of a matrix.",examples:["size(2.3)",'size("hello world")',"a = [1, 2; 3, 4; 5, 6]","size(a)","size(1:6)"],seealso:["concat","count","det","diag","identity","inv","ones","range","squeeze","subset","trace","transpose","zeros"]},sort:{name:"sort",category:"Matrix",syntax:["sort(x)","sort(x, compare)"],description:'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',examples:["sort([5, 10, 1])",'sort(["C", "B", "A", "D"], "natural")',"sortByLength(a, b) = size(a)[1] - size(b)[1]",'sort(["Langdon", "Tom", "Sara"], sortByLength)','sort(["10", "1", "2"], "natural")'],seealso:["map","filter","forEach"]},squeeze:{name:"squeeze",category:"Matrix",syntax:["squeeze(x)"],description:"Remove inner and outer singleton dimensions from a matrix.",examples:["a = zeros(3,2,1)","size(squeeze(a))","b = zeros(1,1,3)","size(squeeze(b))"],seealso:["concat","det","diag","identity","inv","ones","range","size","subset","trace","transpose","zeros"]},subset:{name:"subset",category:"Matrix",syntax:["value(index)","value(index) = replacement","subset(value, [index])","subset(value, [index], replacement)"],description:"Get or set a subset of the entries of a matrix or characters of a string. Indexes are one-based. There should be one index specification for each dimension of the target. Each specification can be a single index, a list of indices, or a range in colon notation `l:u`. In a range, both the lower bound l and upper bound u are included; and if a bound is omitted it defaults to the most extreme valid value. The cartesian product of the indices specified in each dimension determines the target of the operation.",examples:["d = [1, 2; 3, 4]","e = []","e[1, 1:2] = [5, 6]","e[2, :] = [7, 8]","f = d * e","f[2, 1]","f[:, 1]","f[[1,2], [1,3]] = [9, 10; 11, 12]","f"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","trace","transpose","zeros"]},trace:{name:"trace",category:"Matrix",syntax:["trace(A)"],description:"Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.",examples:["A = [1, 2, 3; -1, 2, 3; 2, 0, 3]","trace(A)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","transpose","zeros"]},transpose:{name:"transpose",category:"Matrix",syntax:["x'","transpose(x)"],description:"Transpose a matrix",examples:["a = [1, 2, 3; 4, 5, 6]","a'","transpose(a)"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","zeros"]},zeros:{name:"zeros",category:"Matrix",syntax:["zeros(m)","zeros(m, n)","zeros(m, n, p, ...)","zeros([m])","zeros([m, n])","zeros([m, n, p, ...])"],description:"Create a matrix containing zeros.",examples:["zeros(3)","zeros(3, 5)","a = [1, 2, 3; 4, 5, 6]","zeros(size(a))"],seealso:["concat","det","diag","identity","inv","ones","range","size","squeeze","subset","trace","transpose"]},fft:{name:"fft",category:"Matrix",syntax:["fft(x)"],description:"Calculate N-dimensional Fourier transform",examples:["fft([[1, 0], [1, 0]])"],seealso:["ifft"]},ifft:{name:"ifft",category:"Matrix",syntax:["ifft(x)"],description:"Calculate N-dimensional inverse Fourier transform",examples:["ifft([[2, 2], [0, 0]])"],seealso:["fft"]},sylvester:{name:"sylvester",category:"Algebra",syntax:["sylvester(A,B,C)"],description:"Solves the real-valued Sylvester equation AX+XB=C for X",examples:["sylvester([[-1, -2], [1, 1]], [[-2, 1], [-1, 2]], [[-3, 2], [3, 0]])","A = [[-1, -2], [1, 1]]; B = [[2, -1], [1, -2]]; C = [[-3, 2], [3, 0]]","sylvester(A, B, C)"],seealso:["schur","lyap"]},schur:{name:"schur",category:"Algebra",syntax:["schur(A)"],description:"Performs a real Schur decomposition of the real matrix A = UTU'",examples:["schur([[1, 0], [-4, 3]])","A = [[1, 0], [-4, 3]]","schur(A)"],seealso:["lyap","sylvester"]},lyap:{name:"lyap",category:"Algebra",syntax:["lyap(A,Q)"],description:"Solves the Continuous-time Lyapunov equation AP+PA'+Q=0 for P",examples:["lyap([[-2, 0], [1, -4]], [[3, 1], [1, 3]])","A = [[-2, 0], [1, -4]]","Q = [[3, 1], [1, 3]]","lyap(A,Q)"],seealso:["schur","sylvester"]},solveODE:{name:"solveODE",category:"Numeric",syntax:["solveODE(func, tspan, y0)","solveODE(func, tspan, y0, options)"],description:"Numerical Integration of Ordinary Differential Equations.",examples:["f(t,y) = y","tspan = [0, 4]","solveODE(f, tspan, 1)","solveODE(f, tspan, [1, 2])",'solveODE(f, tspan, 1, { method:"RK23", maxStep:0.1 })'],seealso:["derivative","simplifyCore"]},combinations:{name:"combinations",category:"Probability",syntax:["combinations(n, k)"],description:"Compute the number of combinations of n items taken k at a time",examples:["combinations(7, 5)"],seealso:["combinationsWithRep","permutations","factorial"]},combinationsWithRep:{name:"combinationsWithRep",category:"Probability",syntax:["combinationsWithRep(n, k)"],description:"Compute the number of combinations of n items taken k at a time with replacements.",examples:["combinationsWithRep(7, 5)"],seealso:["combinations","permutations","factorial"]},factorial:{name:"factorial",category:"Probability",syntax:["n!","factorial(n)"],description:"Compute the factorial of a value",examples:["5!","5 * 4 * 3 * 2 * 1","3!"],seealso:["combinations","combinationsWithRep","permutations","gamma"]},gamma:{name:"gamma",category:"Probability",syntax:["gamma(n)"],description:"Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.",examples:["gamma(4)","3!","gamma(1/2)","sqrt(pi)"],seealso:["factorial"]},kldivergence:{name:"kldivergence",category:"Probability",syntax:["kldivergence(x, y)"],description:"Calculate the Kullback-Leibler (KL) divergence  between two distributions.",examples:["kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])"],seealso:[]},lgamma:{name:"lgamma",category:"Probability",syntax:["lgamma(n)"],description:"Logarithm of the gamma function for real, positive numbers and complex numbers, using Lanczos approximation for numbers and Stirling series for complex numbers.",examples:["lgamma(4)","lgamma(1/2)","lgamma(i)","lgamma(complex(1.1, 2))"],seealso:["gamma"]},multinomial:{name:"multinomial",category:"Probability",syntax:["multinomial(A)"],description:"Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.",examples:["multinomial([1, 2, 1])"],seealso:["combinations","factorial"]},permutations:{name:"permutations",category:"Probability",syntax:["permutations(n)","permutations(n, k)"],description:"Compute the number of permutations of n items taken k at a time",examples:["permutations(5)","permutations(5, 3)"],seealso:["combinations","combinationsWithRep","factorial"]},pickRandom:{name:"pickRandom",category:"Probability",syntax:["pickRandom(array)","pickRandom(array, number)","pickRandom(array, weights)","pickRandom(array, number, weights)","pickRandom(array, weights, number)"],description:"Pick a random entry from a given array.",examples:["pickRandom(0:10)","pickRandom([1, 3, 1, 6])","pickRandom([1, 3, 1, 6], 2)","pickRandom([1, 3, 1, 6], [2, 3, 2, 1])","pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])","pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)"],seealso:["random","randomInt"]},random:{name:"random",category:"Probability",syntax:["random()","random(max)","random(min, max)","random(size)","random(size, max)","random(size, min, max)"],description:"Return a random number.",examples:["random()","random(10, 20)","random([2, 3])"],seealso:["pickRandom","randomInt"]},randomInt:{name:"randomInt",category:"Probability",syntax:["randomInt(max)","randomInt(min, max)","randomInt(size)","randomInt(size, max)","randomInt(size, min, max)"],description:"Return a random integer number",examples:["randomInt(10, 20)","randomInt([2, 3], 10)"],seealso:["pickRandom","random"]},compare:{name:"compare",category:"Relational",syntax:["compare(x, y)"],description:"Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:["compare(2, 3)","compare(3, 2)","compare(2, 2)","compare(5cm, 40mm)","compare(2, [1, 2, 3])"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compareNatural","compareText"]},compareNatural:{name:"compareNatural",category:"Relational",syntax:["compareNatural(x, y)"],description:"Compare two values of any type in a deterministic, natural way. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:["compareNatural(2, 3)","compareNatural(3, 2)","compareNatural(2, 2)","compareNatural(5cm, 40mm)",'compareNatural("2", "10")',"compareNatural(2 + 3i, 2 + 4i)","compareNatural([1, 2, 4], [1, 2, 3])","compareNatural([1, 5], [1, 2, 3])","compareNatural([1, 2], [1, 2])","compareNatural({a: 2}, {a: 4})"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare","compareText"]},compareText:{name:"compareText",category:"Relational",syntax:["compareText(x, y)"],description:"Compare two strings lexically. Comparison is case sensitive. Returns 1 when x > y, -1 when x < y, and 0 when x == y.",examples:['compareText("B", "A")','compareText("A", "B")','compareText("A", "A")','compareText("2", "10")','compare("2", "10")',"compare(2, 10)",'compareNatural("2", "10")','compareText("B", ["A", "B", "C"])'],seealso:["compare","compareNatural"]},deepEqual:{name:"deepEqual",category:"Relational",syntax:["deepEqual(x, y)"],description:"Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.",examples:["deepEqual([1,3,4], [1,3,4])","deepEqual([1,3,4], [1,3])"],seealso:["equal","unequal","smaller","larger","smallerEq","largerEq","compare"]},equal:{name:"equal",category:"Relational",syntax:["x == y","equal(x, y)"],description:"Check equality of two values. Returns true if the values are equal, and false if not.",examples:["2+2 == 3","2+2 == 4","a = 3.2","b = 6-2.8","a == b","50cm == 0.5m"],seealso:["unequal","smaller","larger","smallerEq","largerEq","compare","deepEqual","equalText"]},equalText:{name:"equalText",category:"Relational",syntax:["equalText(x, y)"],description:"Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.",examples:['equalText("Hello", "Hello")','equalText("a", "A")','equal("2e3", "2000")','equalText("2e3", "2000")','equalText("B", ["A", "B", "C"])'],seealso:["compare","compareNatural","compareText","equal"]},larger:{name:"larger",category:"Relational",syntax:["x > y","larger(x, y)"],description:"Check if value x is larger than y. Returns true if x is larger than y, and false if not. Comparing a value with NaN returns false.",examples:["2 > 3","5 > 2*2","a = 3.3","b = 6-2.8","(a > b)","(b < a)","5 cm > 2 inch"],seealso:["equal","unequal","smaller","smallerEq","largerEq","compare"]},largerEq:{name:"largerEq",category:"Relational",syntax:["x >= y","largerEq(x, y)"],description:"Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.",examples:["2 >= 1+1","2 > 1+1","a = 3.2","b = 6-2.8","(a >= b)"],seealso:["equal","unequal","smallerEq","smaller","compare"]},smaller:{name:"smaller",category:"Relational",syntax:["x < y","smaller(x, y)"],description:"Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not. Comparing a value with NaN returns false.",examples:["2 < 3","5 < 2*2","a = 3.3","b = 6-2.8","(a < b)","5 cm < 2 inch"],seealso:["equal","unequal","larger","smallerEq","largerEq","compare"]},smallerEq:{name:"smallerEq",category:"Relational",syntax:["x <= y","smallerEq(x, y)"],description:"Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.",examples:["2 <= 1+1","2 < 1+1","a = 3.2","b = 6-2.8","(a <= b)"],seealso:["equal","unequal","larger","smaller","largerEq","compare"]},unequal:{name:"unequal",category:"Relational",syntax:["x != y","unequal(x, y)"],description:"Check unequality of two values. Returns true if the values are unequal, and false if they are equal.",examples:["2+2 != 3","2+2 != 4","a = 3.2","b = 6-2.8","a != b","50cm != 0.5m","5 cm != 2 inch"],seealso:["equal","smaller","larger","smallerEq","largerEq","compare","deepEqual"]},setCartesian:{name:"setCartesian",category:"Set",syntax:["setCartesian(set1, set2)"],description:"Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.",examples:["setCartesian([1, 2], [3, 4])"],seealso:["setUnion","setIntersect","setDifference","setPowerset"]},setDifference:{name:"setDifference",category:"Set",syntax:["setDifference(set1, set2)"],description:"Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setDifference([1, 2, 3, 4], [3, 4, 5, 6])","setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setIntersect","setSymDifference"]},setDistinct:{name:"setDistinct",category:"Set",syntax:["setDistinct(set)"],description:"Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setDistinct([1, 1, 1, 2, 2, 3])"],seealso:["setMultiplicity"]},setIntersect:{name:"setIntersect",category:"Set",syntax:["setIntersect(set1, set2)"],description:"Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setIntersect([1, 2, 3, 4], [3, 4, 5, 6])","setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setDifference"]},setIsSubset:{name:"setIsSubset",category:"Set",syntax:["setIsSubset(set1, set2)"],description:"Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setIsSubset([1, 2], [3, 4, 5, 6])","setIsSubset([3, 4], [3, 4, 5, 6])"],seealso:["setUnion","setIntersect","setDifference"]},setMultiplicity:{name:"setMultiplicity",category:"Set",syntax:["setMultiplicity(element, set)"],description:"Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setMultiplicity(1, [1, 2, 2, 4])","setMultiplicity(2, [1, 2, 2, 4])"],seealso:["setDistinct","setSize"]},setPowerset:{name:"setPowerset",category:"Set",syntax:["setPowerset(set)"],description:"Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.",examples:["setPowerset([1, 2, 3])"],seealso:["setCartesian"]},setSize:{name:"setSize",category:"Set",syntax:["setSize(set)","setSize(set, unique)"],description:'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',examples:["setSize([1, 2, 2, 4])","setSize([1, 2, 2, 4], true)"],seealso:["setUnion","setIntersect","setDifference"]},setSymDifference:{name:"setSymDifference",category:"Set",syntax:["setSymDifference(set1, set2)"],description:"Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])","setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setUnion","setIntersect","setDifference"]},setUnion:{name:"setUnion",category:"Set",syntax:["setUnion(set1, set2)"],description:"Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.",examples:["setUnion([1, 2, 3, 4], [3, 4, 5, 6])","setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])"],seealso:["setIntersect","setDifference"]},zpk2tf:{name:"zpk2tf",category:"Signal",syntax:["zpk2tf(z, p, k)"],description:"Compute the transfer function of a zero-pole-gain model.",examples:["zpk2tf([1, 2], [-1, -2], 1)","zpk2tf([1, 2], [-1, -2])","zpk2tf([1 - 3i, 2 + 2i], [-1, -2])"],seealso:[]},freqz:{name:"freqz",category:"Signal",syntax:["freqz(b, a)","freqz(b, a, w)"],description:"Calculates the frequency response of a filter given its numerator and denominator coefficients.",examples:["freqz([1, 2], [1, 2, 3])","freqz([1, 2], [1, 2, 3], [0, 1])","freqz([1, 2], [1, 2, 3], 512)"],seealso:[]},erf:{name:"erf",category:"Special",syntax:["erf(x)"],description:"Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x",examples:["erf(0.2)","erf(-0.5)","erf(4)"],seealso:[]},zeta:{name:"zeta",category:"Special",syntax:["zeta(s)"],description:"Compute the Riemann Zeta Function using an infinite series and Riemann's Functional Equation for the entire complex plane",examples:["zeta(0.2)","zeta(-0.5)","zeta(4)"],seealso:[]},cumsum:{name:"cumsum",category:"Statistics",syntax:["cumsum(a, b, c, ...)","cumsum(A)"],description:"Compute the cumulative sum of all values.",examples:["cumsum(2, 3, 4, 1)","cumsum([2, 3, 4, 1])","cumsum([1, 2; 3, 4])","cumsum([1, 2; 3, 4], 1)","cumsum([1, 2; 3, 4], 2)"],seealso:["max","mean","median","min","prod","std","sum","variance"]},mad:{name:"mad",category:"Statistics",syntax:["mad(a, b, c, ...)","mad(A)"],description:"Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.",examples:["mad(10, 20, 30)","mad([1, 2, 3])"],seealso:["mean","median","std","abs"]},max:{name:"max",category:"Statistics",syntax:["max(a, b, c, ...)","max(A)","max(A, dimension)"],description:"Compute the maximum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.",examples:["max(2, 3, 4, 1)","max([2, 3, 4, 1])","max([2, 5; 4, 3])","max([2, 5; 4, 3], 1)","max([2, 5; 4, 3], 2)","max(2.7, 7.1, -4.5, 2.0, 4.1)","min(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["mean","median","min","prod","std","sum","variance"]},mean:{name:"mean",category:"Statistics",syntax:["mean(a, b, c, ...)","mean(A)","mean(A, dimension)"],description:"Compute the arithmetic mean of a list of values.",examples:["mean(2, 3, 4, 1)","mean([2, 3, 4, 1])","mean([2, 5; 4, 3])","mean([2, 5; 4, 3], 1)","mean([2, 5; 4, 3], 2)","mean([1.0, 2.7, 3.2, 4.0])"],seealso:["max","median","min","prod","std","sum","variance"]},median:{name:"median",category:"Statistics",syntax:["median(a, b, c, ...)","median(A)"],description:"Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.",examples:["median(5, 2, 7)","median([3, -1, 5, 7])"],seealso:["max","mean","min","prod","std","sum","variance","quantileSeq"]},min:{name:"min",category:"Statistics",syntax:["min(a, b, c, ...)","min(A)","min(A, dimension)"],description:"Compute the minimum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.",examples:["min(2, 3, 4, 1)","min([2, 3, 4, 1])","min([2, 5; 4, 3])","min([2, 5; 4, 3], 1)","min([2, 5; 4, 3], 2)","min(2.7, 7.1, -4.5, 2.0, 4.1)","max(2.7, 7.1, -4.5, 2.0, 4.1)"],seealso:["max","mean","median","prod","std","sum","variance"]},mode:{name:"mode",category:"Statistics",syntax:["mode(a, b, c, ...)","mode(A)","mode(A, a, b, B, c, ...)"],description:"Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.",examples:["mode(2, 1, 4, 3, 1)","mode([1, 2.7, 3.2, 4, 2.7])","mode(1, 4, 6, 1, 6)"],seealso:["max","mean","min","median","prod","std","sum","variance"]},prod:{name:"prod",category:"Statistics",syntax:["prod(a, b, c, ...)","prod(A)"],description:"Compute the product of all values.",examples:["prod(2, 3, 4)","prod([2, 3, 4])","prod([2, 5; 4, 3])"],seealso:["max","mean","min","median","min","std","sum","variance"]},quantileSeq:{name:"quantileSeq",category:"Statistics",syntax:["quantileSeq(A, prob[, sorted])","quantileSeq(A, [prob1, prob2, ...][, sorted])","quantileSeq(A, N[, sorted])"],description:"Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probability are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.",examples:["quantileSeq([3, -1, 5, 7], 0.5)","quantileSeq([3, -1, 5, 7], [1/3, 2/3])","quantileSeq([3, -1, 5, 7], 2)","quantileSeq([-1, 3, 5, 7], 0.5, true)"],seealso:["mean","median","min","max","prod","std","sum","variance"]},std:{name:"std",category:"Statistics",syntax:["std(a, b, c, ...)","std(A)","std(A, dimension)","std(A, normalization)","std(A, dimension, normalization)"],description:'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["std(2, 4, 6)","std([2, 4, 6, 8])",'std([2, 4, 6, 8], "uncorrected")','std([2, 4, 6, 8], "biased")',"std([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","prod","sum","variance"]},sum:{name:"sum",category:"Statistics",syntax:["sum(a, b, c, ...)","sum(A)","sum(A, dimension)"],description:"Compute the sum of all values.",examples:["sum(2, 3, 4, 1)","sum([2, 3, 4, 1])","sum([2, 5; 4, 3])"],seealso:["max","mean","median","min","prod","std","variance"]},variance:{name:"variance",category:"Statistics",syntax:["variance(a, b, c, ...)","variance(A)","variance(A, dimension)","variance(A, normalization)","variance(A, dimension, normalization)"],description:'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',examples:["variance(2, 4, 6)","variance([2, 4, 6, 8])",'variance([2, 4, 6, 8], "uncorrected")','variance([2, 4, 6, 8], "biased")',"variance([1, 2, 3; 4, 5, 6])"],seealso:["max","mean","min","median","min","prod","std","sum"]},corr:{name:"corr",category:"Statistics",syntax:["corr(A,B)"],description:"Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.",examples:["corr([2, 4, 6, 8],[1, 2, 3, 6])","corr(matrix([[1, 2.2, 3, 4.8, 5], [1, 2, 3, 4, 5]]), matrix([[4, 5.3, 6.6, 7, 8], [1, 2, 3, 4, 5]]))"],seealso:["max","mean","min","median","min","prod","std","sum"]},acos:{name:"acos",category:"Trigonometry",syntax:["acos(x)"],description:"Compute the inverse cosine of a value in radians.",examples:["acos(0.5)","acos(cos(2.3))"],seealso:["cos","atan","asin"]},acosh:{name:"acosh",category:"Trigonometry",syntax:["acosh(x)"],description:"Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.",examples:["acosh(1.5)"],seealso:["cosh","asinh","atanh"]},acot:{name:"acot",category:"Trigonometry",syntax:["acot(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acot(0.5)","acot(cot(0.5))","acot(2)"],seealso:["cot","atan"]},acoth:{name:"acoth",category:"Trigonometry",syntax:["acoth(x)"],description:"Calculate the inverse hyperbolic tangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.",examples:["acoth(2)","acoth(0.5)"],seealso:["acsch","asech"]},acsc:{name:"acsc",category:"Trigonometry",syntax:["acsc(x)"],description:"Calculate the inverse cotangent of a value.",examples:["acsc(2)","acsc(csc(0.5))","acsc(0.5)"],seealso:["csc","asin","asec"]},acsch:{name:"acsch",category:"Trigonometry",syntax:["acsch(x)"],description:"Calculate the inverse hyperbolic cosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.",examples:["acsch(0.5)"],seealso:["asech","acoth"]},asec:{name:"asec",category:"Trigonometry",syntax:["asec(x)"],description:"Calculate the inverse secant of a value.",examples:["asec(0.5)","asec(sec(0.5))","asec(2)"],seealso:["acos","acot","acsc"]},asech:{name:"asech",category:"Trigonometry",syntax:["asech(x)"],description:"Calculate the inverse secant of a value.",examples:["asech(0.5)"],seealso:["acsch","acoth"]},asin:{name:"asin",category:"Trigonometry",syntax:["asin(x)"],description:"Compute the inverse sine of a value in radians.",examples:["asin(0.5)","asin(sin(0.5))"],seealso:["sin","acos","atan"]},asinh:{name:"asinh",category:"Trigonometry",syntax:["asinh(x)"],description:"Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.",examples:["asinh(0.5)"],seealso:["acosh","atanh"]},atan:{name:"atan",category:"Trigonometry",syntax:["atan(x)"],description:"Compute the inverse tangent of a value in radians.",examples:["atan(0.5)","atan(tan(0.5))"],seealso:["tan","acos","asin"]},atanh:{name:"atanh",category:"Trigonometry",syntax:["atanh(x)"],description:"Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.",examples:["atanh(0.5)"],seealso:["acosh","asinh"]},atan2:{name:"atan2",category:"Trigonometry",syntax:["atan2(y, x)"],description:"Computes the principal value of the arc tangent of y/x in radians.",examples:["atan2(2, 2) / pi","angle = 60 deg in rad","x = cos(angle)","y = sin(angle)","atan2(y, x)"],seealso:["sin","cos","tan"]},cos:{name:"cos",category:"Trigonometry",syntax:["cos(x)"],description:"Compute the cosine of x in radians.",examples:["cos(2)","cos(pi / 4) ^ 2","cos(180 deg)","cos(60 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["acos","sin","tan"]},cosh:{name:"cosh",category:"Trigonometry",syntax:["cosh(x)"],description:"Compute the hyperbolic cosine of x in radians.",examples:["cosh(0.5)"],seealso:["sinh","tanh","coth"]},cot:{name:"cot",category:"Trigonometry",syntax:["cot(x)"],description:"Compute the cotangent of x in radians. Defined as 1/tan(x)",examples:["cot(2)","1 / tan(2)"],seealso:["sec","csc","tan"]},coth:{name:"coth",category:"Trigonometry",syntax:["coth(x)"],description:"Compute the hyperbolic cotangent of x in radians.",examples:["coth(2)","1 / tanh(2)"],seealso:["sech","csch","tanh"]},csc:{name:"csc",category:"Trigonometry",syntax:["csc(x)"],description:"Compute the cosecant of x in radians. Defined as 1/sin(x)",examples:["csc(2)","1 / sin(2)"],seealso:["sec","cot","sin"]},csch:{name:"csch",category:"Trigonometry",syntax:["csch(x)"],description:"Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)",examples:["csch(2)","1 / sinh(2)"],seealso:["sech","coth","sinh"]},sec:{name:"sec",category:"Trigonometry",syntax:["sec(x)"],description:"Compute the secant of x in radians. Defined as 1/cos(x)",examples:["sec(2)","1 / cos(2)"],seealso:["cot","csc","cos"]},sech:{name:"sech",category:"Trigonometry",syntax:["sech(x)"],description:"Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)",examples:["sech(2)","1 / cosh(2)"],seealso:["coth","csch","cosh"]},sin:{name:"sin",category:"Trigonometry",syntax:["sin(x)"],description:"Compute the sine of x in radians.",examples:["sin(2)","sin(pi / 4) ^ 2","sin(90 deg)","sin(30 deg)","sin(0.2)^2 + cos(0.2)^2"],seealso:["asin","cos","tan"]},sinh:{name:"sinh",category:"Trigonometry",syntax:["sinh(x)"],description:"Compute the hyperbolic sine of x in radians.",examples:["sinh(0.5)"],seealso:["cosh","tanh"]},tan:{name:"tan",category:"Trigonometry",syntax:["tan(x)"],description:"Compute the tangent of x in radians.",examples:["tan(0.5)","sin(0.5) / cos(0.5)","tan(pi / 4)","tan(45 deg)"],seealso:["atan","sin","cos"]},tanh:{name:"tanh",category:"Trigonometry",syntax:["tanh(x)"],description:"Compute the hyperbolic tangent of x in radians.",examples:["tanh(0.5)","sinh(0.5) / cosh(0.5)"],seealso:["sinh","cosh"]},to:{name:"to",category:"Units",syntax:["x to unit","to(x, unit)"],description:"Change the unit of a value.",examples:["5 inch to cm","3.2kg to g","16 bytes in bits"],seealso:[]},toBest:{name:"toBest",category:"Units",syntax:["toBest(x)","toBest(x, unitList)","toBest(x, unitList, options)"],description:"Converts to the most appropriate display unit.",examples:['toBest(unit(5000, "m"))','toBest(unit(3500000, "W"))','toBest(unit(0.000000123, "A"))','toBest(unit(10, "m"), "cm")','toBest(unit(10, "m"), "mm,km", {offset: 1.5})'],seealso:[]},clone:{name:"clone",category:"Utils",syntax:["clone(x)"],description:"Clone a variable. Creates a copy of primitive variables, and a deep copy of matrices",examples:["clone(3.5)","clone(2 - 4i)","clone(45 deg)","clone([1, 2; 3, 4])",'clone("hello world")'],seealso:[]},format:{name:"format",category:"Utils",syntax:["format(value)","format(value, precision)"],description:"Format a value of any type as string.",examples:["format(2.3)","format(3 - 4i)","format([])","format(pi, 3)"],seealso:["print"]},bin:{name:"bin",category:"Utils",syntax:["bin(value)"],description:"Format a number as binary",examples:["bin(2)"],seealso:["oct","hex"]},oct:{name:"oct",category:"Utils",syntax:["oct(value)"],description:"Format a number as octal",examples:["oct(56)"],seealso:["bin","hex"]},hex:{name:"hex",category:"Utils",syntax:["hex(value)"],description:"Format a number as hexadecimal",examples:["hex(240)"],seealso:["bin","oct"]},isNaN:{name:"isNaN",category:"Utils",syntax:["isNaN(x)"],description:"Test whether a value is NaN (not a number)",examples:["isNaN(2)","isNaN(0 / 0)","isNaN(NaN)","isNaN(Infinity)"],seealso:["isNegative","isNumeric","isPositive","isZero"]},isInteger:{name:"isInteger",category:"Utils",syntax:["isInteger(x)"],description:"Test whether a value is an integer number.",examples:["isInteger(2)","isInteger(3.5)","isInteger([3, 0.5, -2])"],seealso:["isNegative","isNumeric","isPositive","isZero"]},isNegative:{name:"isNegative",category:"Utils",syntax:["isNegative(x)"],description:"Test whether a value is negative: smaller than zero.",examples:["isNegative(2)","isNegative(0)","isNegative(-4)","isNegative([3, 0.5, -2])"],seealso:["isInteger","isNumeric","isPositive","isZero"]},isNumeric:{name:"isNumeric",category:"Utils",syntax:["isNumeric(x)"],description:"Test whether a value is a numeric value. Returns true when the input is a number, BigNumber, Fraction, or boolean.",examples:["isNumeric(2)",'isNumeric("2")','hasNumericValue("2")',"isNumeric(0)","isNumeric(bignumber(500))","isNumeric(fraction(0.125))","isNumeric(2 + 3i)",'isNumeric([2.3, "foo", false])'],seealso:["isInteger","isZero","isNegative","isPositive","isNaN","hasNumericValue"]},hasNumericValue:{name:"hasNumericValue",category:"Utils",syntax:["hasNumericValue(x)"],description:"Test whether a value is an numeric value. In case of a string, true is returned if the string contains a numeric value.",examples:["hasNumericValue(2)",'hasNumericValue("2")','isNumeric("2")',"hasNumericValue(0)","hasNumericValue(bignumber(500))","hasNumericValue(fraction(0.125))","hasNumericValue(2 + 3i)",'hasNumericValue([2.3, "foo", false])'],seealso:["isInteger","isZero","isNegative","isPositive","isNaN","isNumeric"]},isPositive:{name:"isPositive",category:"Utils",syntax:["isPositive(x)"],description:"Test whether a value is positive: larger than zero.",examples:["isPositive(2)","isPositive(0)","isPositive(-4)","isPositive([3, 0.5, -2])"],seealso:["isInteger","isNumeric","isNegative","isZero"]},isPrime:{name:"isPrime",category:"Utils",syntax:["isPrime(x)"],description:"Test whether a value is prime: has no divisors other than itself and one.",examples:["isPrime(3)","isPrime(-2)","isPrime([2, 17, 100])"],seealso:["isInteger","isNumeric","isNegative","isZero"]},isZero:{name:"isZero",category:"Utils",syntax:["isZero(x)"],description:"Test whether a value is zero.",examples:["isZero(2)","isZero(0)","isZero(-4)","isZero([3, 0, -2, 0])"],seealso:["isInteger","isNumeric","isNegative","isPositive"]},print:{name:"print",category:"Utils",syntax:["print(template, values)","print(template, values, precision)"],description:"Interpolate values into a string template.",examples:['print("Lucy is $age years old", {age: 5})','print("The value of pi is $pi", {pi: pi}, 3)','print("Hello, $user.name!", {user: {name: "John"}})','print("Values: $1, $2, $3", [6, 9, 4])'],seealso:["format"]},typeOf:{name:"typeOf",category:"Utils",syntax:["typeOf(x)"],description:"Get the type of a variable.",examples:["typeOf(3.5)","typeOf(2 - 4i)","typeOf(45 deg)",'typeOf("hello world")'],seealso:["getMatrixDataType"]},numeric:{name:"numeric",category:"Utils",syntax:["numeric(x)"],description:"Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.",examples:['numeric("4")','numeric("4", "number")','numeric("4", "bigint")','numeric("4", "BigNumber")','numeric("4", "Fraction")','numeric(4, "Fraction")','numeric(fraction(2, 5), "number")'],seealso:["number","bigint","fraction","bignumber","string","format"]}},cd="help",ld=de(cd,["typed","mathWithTransform","Help"],(e=>{let{typed:t,mathWithTransform:n,Help:r}=e;return t(cd,{any:function(e){let t,o=e;if("string"!=typeof e)for(t in n)if(me(n,t)&&e===n[t]){o=t;break}const a=i(ud,o);if(!a){const e="function"==typeof o?o.name:o;throw new Error('No documentation found on "'+e+'"')}return new r(a)}})})),fd="chain",pd=de(fd,["typed","Chain"],(e=>{let{typed:t,Chain:n}=e;return t(fd,{"":function(){return new n},any:function(e){return new n(e)}})})),md=de("det",["typed","matrix","subtractScalar","multiply","divideScalar","isZero","unaryMinus"],(e=>{let{typed:t,matrix:n,subtractScalar:r,multiply:i,divideScalar:o,isZero:a,unaryMinus:s}=e;return t("det",{any:function(e){return ae(e)},"Array | Matrix":function(e){let t;switch(t=A(e)?e.size():Array.isArray(e)?(e=n(e)).size():[],t.length){case 0:return ae(e);case 1:if(1===t[0])return ae(e.valueOf()[0]);if(0===t[0])return 1;throw new RangeError("Matrix must be square (size: "+pr(t)+")");case 2:{const n=t[0],u=t[1];if(n===u)return function(e,t){if(1===t)return ae(e[0][0]);if(2===t)return r(i(e[0][0],e[1][1]),i(e[1][0],e[0][1]));{let n=!1;const u=new Array(t).fill(0).map(((e,t)=>t));for(let s=0;s<t;s++){let c=u[s];if(a(e[c][s])){let r;for(r=s+1;r<t;r++)if(!a(e[u[r]][s])){c=u[r],u[r]=u[s],u[s]=c,n=!n;break}if(r===t)return e[c][s]}const l=e[c][s],f=0===s?1:e[u[s-1]][s-1];for(let n=s+1;n<t;n++){const a=u[n];for(let n=s+1;n<t;n++)e[a][n]=o(r(i(e[a][n],l),i(e[a][s],e[c][n])),f)}}const c=e[u[t-1]][t-1];return n?s(c):c}}(e.clone().valueOf(),n);if(0===u)return 1;throw new RangeError("Matrix must be square (size: "+pr(t)+")")}default:throw new RangeError("Matrix must be two dimensional (size: "+pr(t)+")")}}})})),dd=de("inv",["typed","matrix","divideScalar","addScalar","multiply","unaryMinus","det","identity","abs"],(e=>{let{typed:t,matrix:n,divideScalar:r,addScalar:i,multiply:o,unaryMinus:a,det:s,identity:u,abs:c}=e;return t("inv",{"Array | Matrix":function(e){const t=A(e)?e.size():wr(e);switch(t.length){case 1:if(1===t[0])return A(e)?n([r(1,e.valueOf()[0])]):[r(1,e[0])];throw new RangeError("Matrix must be square (size: "+pr(t)+")");case 2:{const r=t[0],i=t[1];if(r===i)return A(e)?n(l(e.valueOf(),r,i),e.storage()):l(e,r,i);throw new RangeError("Matrix must be square (size: "+pr(t)+")")}default:throw new RangeError("Matrix must be two dimensional (size: "+pr(t)+")")}},any:function(e){return r(1,e)}});function l(e,t,n){let l,f,p,m,d;if(1===t){if(m=e[0][0],0===m)throw Error("Cannot calculate inverse, determinant is zero");return[[r(1,m)]]}if(2===t){const t=s(e);if(0===t)throw Error("Cannot calculate inverse, determinant is zero");return[[r(e[1][1],t),r(a(e[0][1]),t)],[r(a(e[1][0]),t),r(e[0][0],t)]]}{const s=e.concat();for(l=0;l<t;l++)s[l]=s[l].concat();const m=u(t).valueOf();for(let e=0;e<n;e++){let u=c(s[e][e]),h=e;for(l=e+1;l<t;)c(s[l][e])>u&&(u=c(s[l][e]),h=l),l++;if(0===u)throw Error("Cannot calculate inverse, determinant is zero");l=h,l!==e&&(d=s[e],s[e]=s[l],s[l]=d,d=m[e],m[e]=m[l],m[l]=d);const g=s[e],y=m[e];for(l=0;l<t;l++){const t=s[l],u=m[l];if(l!==e){if(0!==t[e]){for(p=r(a(t[e]),g[e]),f=e;f<n;f++)t[f]=i(t[f],o(p,g[f]));for(f=0;f<n;f++)u[f]=i(u[f],o(p,y[f]))}}else{for(p=g[e],f=e;f<n;f++)t[f]=r(t[f],p);for(f=0;f<n;f++)u[f]=r(u[f],p)}}}return m}}})),hd="pinv",gd=de(hd,["typed","matrix","inv","deepEqual","equal","dotDivide","dot","ctranspose","divideScalar","multiply","add","Complex"],(e=>{let{typed:t,matrix:n,inv:r,deepEqual:i,equal:o,dotDivide:a,dot:s,ctranspose:u,divideScalar:c,multiply:l,add:f,Complex:p}=e;return t(hd,{"Array | Matrix":function(e){const t=A(e)?e.size():wr(e);switch(t.length){case 1:return h(e)?u(e):1===t[0]?r(e):a(u(e),s(e,e));case 2:{if(h(e))return u(e);const i=t[0],o=t[1];if(i===o)try{return r(e)}catch(e){if(!(e instanceof Error&&e.message.match(/Cannot calculate inverse, determinant is zero/)))throw e}return A(e)?n(m(e.valueOf(),i,o),e.storage()):m(e,i,o)}default:throw new RangeError("Matrix must be two dimensional (size: "+pr(t)+")")}},any:function(e){return o(e,0)?ae(e):c(1,e)}});function m(e,t,n){const{C:i,F:o}=function(e,t,n){const r=function(e,t,n){const r=ae(e);let i=0;for(let e=0;e<t;e++){if(n<=i)return r;let o=e;for(;d(r[o][i]);)if(o++,t===o&&(o=e,i++,n===i))return r;[r[o],r[e]]=[r[e],r[o]];let s=r[e][i];for(let t=0;t<n;t++)r[e][t]=a(r[e][t],s);for(let o=0;o<t;o++)if(o!==e){s=r[o][i];for(let t=0;t<n;t++)r[o][t]=f(r[o][t],l(-1,l(s,r[e][t])))}i++}return r}(e,t,n);return{C:e.map(((e,n)=>e.filter(((e,n)=>n<t&&!d(s(r[n],r[n])))))),F:r.filter(((e,t)=>!d(s(r[t],r[t]))))}}(e,t,n),c=l(r(l(u(i),i)),u(i)),p=l(u(o),r(l(o,u(o))));return l(p,c)}function d(e){return o(f(e,p(1,1)),f(0,p(1,1)))}function h(e){return i(f(e,p(1,1)),f(l(e,0),p(1,1)))}}));const yd=de("eigs",["config","typed","matrix","addScalar","equal","subtract","abs","atan","cos","sin","multiplyScalar","divideScalar","inv","bignumber","multiply","add","larger","column","flatten","number","complex","sqrt","diag","size","reshape","qr","usolve","usolveAll","im","re","smaller","matrixFromColumns","dot"],(e=>{let{config:t,typed:n,matrix:r,addScalar:i,subtract:o,equal:a,abs:s,atan:u,cos:c,sin:l,multiplyScalar:f,divideScalar:p,inv:m,bignumber:d,multiply:y,add:w,larger:v,column:N,flatten:A,number:E,complex:S,sqrt:M,diag:C,size:T,reshape:B,qr:F,usolve:D,usolveAll:O,im:_,re:z,smaller:q,matrixFromColumns:I,dot:k}=e;const R=function(e){let{config:t,addScalar:n,subtract:r,abs:i,atan:o,cos:a,sin:s,multiplyScalar:u,inv:c,bignumber:l,multiply:f,add:p}=e;function m(e,n,r){const i=n-e;return Math.abs(i)<=t.relTol?Math.PI/4:.5*Math.atan(2*r/(n-e))}function d(e,n,a){const s=r(n,e);return i(s)<=t.relTol?l(-1).acos().div(4):u(.5,o(f(2,a,c(s))))}function h(e,t,n,r){const i=e.length,o=Math.cos(t),a=Math.sin(t),s=Array(i).fill(0),u=Array(i).fill(0);for(let t=0;t<i;t++)s[t]=o*e[t][n]-a*e[t][r],u[t]=a*e[t][n]+o*e[t][r];for(let t=0;t<i;t++)e[t][n]=s[t],e[t][r]=u[t];return e}function g(e,t,i,o){const c=e.length,f=a(t),p=s(t),m=Array(c).fill(l(0)),d=Array(c).fill(l(0));for(let t=0;t<c;t++)m[t]=r(u(f,e[t][i]),u(p,e[t][o])),d[t]=n(u(p,e[t][i]),u(f,e[t][o]));for(let t=0;t<c;t++)e[t][i]=m[t],e[t][o]=d[t];return e}function y(e,t,i,o){const c=e.length,m=l(a(t)),d=l(s(t)),h=u(m,m),g=u(d,d),y=Array(c).fill(l(0)),x=Array(c).fill(l(0)),b=f(l(2),m,d,e[i][o]),w=n(r(u(h,e[i][i]),b),u(g,e[o][o])),v=p(u(g,e[i][i]),b,u(h,e[o][o]));for(let t=0;t<c;t++)y[t]=r(u(m,e[i][t]),u(d,e[o][t])),x[t]=n(u(d,e[i][t]),u(m,e[o][t]));e[i][i]=w,e[o][o]=v,e[i][o]=l(0),e[o][i]=l(0);for(let t=0;t<c;t++)t!==i&&t!==o&&(e[i][t]=y[t],e[t][i]=y[t],e[o][t]=x[t],e[t][o]=x[t]);return e}function x(e,t,n,r){const i=e.length,o=Math.cos(t),a=Math.sin(t),s=o*o,u=a*a,c=Array(i).fill(0),l=Array(i).fill(0),f=s*e[n][n]-2*o*a*e[n][r]+u*e[r][r],p=u*e[n][n]+2*o*a*e[n][r]+s*e[r][r];for(let t=0;t<i;t++)c[t]=o*e[n][t]-a*e[r][t],l[t]=a*e[n][t]+o*e[r][t];e[n][n]=f,e[r][r]=p,e[n][r]=0,e[r][n]=0;for(let t=0;t<i;t++)t!==n&&t!==r&&(e[n][t]=c[t],e[t][n]=c[t],e[r][t]=l[t],e[t][r]=l[t]);return e}function b(e){const t=e.length;let n=0,r=[0,1];for(let i=0;i<t;i++)for(let o=i+1;o<t;o++)Math.abs(n)<Math.abs(e[i][o])&&(n=Math.abs(e[i][o]),r=[i,o]);return[r,n]}function w(e){const t=e.length;let n=0,r=[0,1];for(let o=0;o<t;o++)for(let a=o+1;a<t;a++)i(n)<i(e[o][a])&&(n=i(e[o][a]),r=[o,a]);return[r,n]}function v(e,t,n){const r=e.length,o=Array(r);let a;if(n){a=Array(r);for(let e=0;e<r;e++)a[e]=Array(r)}for(let s=0;s<r;s++){let u=0,c=e[0];for(let t=0;t<e.length;t++)i(e[t])<i(c)&&(u=t,c=e[u]);if(o[s]=e.splice(u,1)[0],n)for(let e=0;e<r;e++)a[s][e]=t[e][u],t[e].splice(u,1)}if(!n)return{values:o};const s=a.map(((e,t)=>({value:o[t],vector:e})));return{values:o,eigenvectors:s}}return function(e,n){let r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:t.relTol,o=arguments.length>3?arguments[3]:void 0,a=arguments.length>4?arguments[4]:void 0;if("number"===o)return function(e,t,n){const r=e.length,i=Math.abs(t/r);let o,a;if(n){a=new Array(r);for(let e=0;e<r;e++)a[e]=Array(r).fill(0),a[e][e]=1}let s=b(e);for(;Math.abs(s[1])>=Math.abs(i);){const t=s[0][0],r=s[0][1];o=m(e[t][t],e[r][r],e[t][r]),e=x(e,o,t,r),n&&(a=h(a,o,t,r)),s=b(e)}const u=Array(r).fill(0);for(let t=0;t<r;t++)u[t]=e[t][t];return v(ae(u),a,n)}(e,r,a);if("BigNumber"===o)return function(e,t,n){const r=e.length,o=i(t/r);let a,s;if(n){s=new Array(r);for(let e=0;e<r;e++)s[e]=Array(r).fill(0),s[e][e]=1}let u=w(e);for(;i(u[1])>=i(o);){const t=u[0][0],r=u[0][1];a=d(e[t][t],e[r][r],e[t][r]),e=y(e,a,t,r),n&&(s=g(s,a,t,r)),u=w(e)}const c=Array(r).fill(0);for(let t=0;t<r;t++)c[t]=e[t][t];return v(ae(c),s,n)}(e,r,a);throw TypeError("Unsupported data type: "+o)}}({config:t,addScalar:i,subtract:o,column:N,flatten:A,equal:a,abs:s,atan:u,cos:c,sin:l,multiplyScalar:f,inv:m,bignumber:d,complex:S,multiply:y,add:w}),P=function(e){let{addScalar:t,subtract:n,flatten:r,multiply:i,multiplyScalar:o,divideScalar:a,sqrt:s,abs:u,bignumber:c,diag:l,size:f,reshape:p,inv:m,qr:d,usolve:h,usolveAll:g,equal:y,complex:x,larger:b,smaller:w,matrixFromColumns:v,dot:N}=e;function A(e,r,i,a){const u=t(e,a),c=n(o(e,a),o(r,i)),l=o(u,.5),f=o(s(n(o(u,u),o(4,c))),.5);return[t(l,f),n(l,f)]}function E(e,t,r,i,o,a,s,l){const f="BigNumber"===l,p="Complex"===l,m=f?c(0):p?x(0):0,d=f?c(1):p?x(1):1;if(w(u(r),s))return[[d,m],[m,d]];if(b(u(n(o,a)),s))return[[n(o,i),n(a,i)],[r,r]];const h=n(e,o),g=n(i,o);return w(u(t),s)&&w(u(g),s)?[[h,d],[r,m]]:[[t,m],[g,d]]}function S(e,t){for(let n=0;n<e.length;n++)e[n].push(...Array(t-e[n].length).fill(0));for(let n=e.length;n<t;n++)e.push(Array(t).fill(0)),e[n][n]=1;return e}function M(e,t,n){for(let r=0;r<e.length;r++)if(n(e[r],t))return r;return-1}function C(e,t,n,r,i){const o="BigNumber"===i?c(1e3):1e3;let a,s=0;for(;s<5;++s){a=T(t,n,i);try{a=h(e,a)}catch(e){continue}if(b(F(a),o))break}if(s>=5)return null;for(s=0;;){const t=h(e,a);if(w(F(B(a,[t])),r))break;if(++s>=10)return null;a=D(t)}return a}function T(e,t,n){const r="BigNumber"===n,i="Complex"===n;let o=Array(e).fill(0).map((e=>2*Math.random()-1));return r&&(o=o.map((e=>c(e)))),i&&(o=o.map((e=>x(e)))),o=B(o,t),D(o,n)}function B(e,t){const r=f(e);for(let o of t)o=p(o,r),e=n(e,i(a(N(o,e),N(o,o)),o));return e}function F(e){return u(s(N(e,e)))}function D(e,t){const n="Complex"===t,r="BigNumber"===t?c(1):n?x(1):1;return i(a(r,F(e)),e)}return function(e,s,f,p){let h=!(arguments.length>4&&void 0!==arguments[4])||arguments[4];const v=function(e,n,r,i,s){const f="BigNumber"===i,p="Complex"===i,m=f?c(0):0,d=f?c(1):p?x(1):1,h=f?c(1):1,g=f?c(10):2,v=o(g,g);let N;s&&(N=Array(n).fill(d));let A=!1;for(;!A;){A=!0;for(let r=0;r<n;r++){let i=m,c=m;for(let o=0;o<n;o++)r!==o&&(i=t(i,u(e[o][r])),c=t(c,u(e[r][o])));if(!y(i,0)&&!y(c,0)){let u=h,l=i;const f=a(c,g),p=o(c,g);for(;w(l,f);)l=o(l,v),u=o(u,g);for(;b(l,p);)l=a(l,v),u=a(u,g);if(w(a(t(l,c),u),o(t(i,c),.95))){A=!1;const t=a(1,u);for(let i=0;i<n;i++)r!==i&&(e[r][i]=o(e[r][i],t),e[i][r]=o(e[i][r],u));s&&(N[r]=o(N[r],t))}}}}return s?l(N):null}(e,s,0,p,h);!function(e,r,i,s,l,f){const p="BigNumber"===s,m="Complex"===s,d=p?c(0):m?x(0):0;p&&(i=c(i));for(let s=0;s<r-2;s++){let c=0,p=d;for(let t=s+1;t<r;t++){const n=e[t][s];w(u(p),u(n))&&(p=n,c=t)}if(!w(u(p),i)){if(c!==s+1){const t=e[c];e[c]=e[s+1],e[s+1]=t;for(let t=0;t<r;t++){const n=e[t][c];e[t][c]=e[t][s+1],e[t][s+1]=n}if(l){const e=f[c];f[c]=f[s+1],f[s+1]=e}}for(let i=s+2;i<r;i++){const u=a(e[i][s],p);if(0!==u){for(let t=0;t<r;t++)e[i][t]=n(e[i][t],o(u,e[s+1][t]));for(let n=0;n<r;n++)e[n][s+1]=t(e[n][s+1],o(u,e[n][i]));if(l)for(let e=0;e<r;e++)f[i][e]=n(f[i][e],o(u,f[s+1][e]))}}}}}(e,s,f,p,h,v);const{values:N,C:T}=function(e,r,o,a,s){const f="BigNumber"===a,p="Complex"===a,m=f?c(1):p?x(1):1;f&&(o=c(o));let h=ae(e);const g=[];let y=r;const b=[];let v=s?l(Array(r).fill(m)):void 0,N=s?l(Array(y).fill(m)):void 0,M=0;for(;M<=100;){M+=1;const e=h[y-1][y-1];for(let t=0;t<y;t++)h[t][t]=n(h[t][t],e);const{Q:c,R:f}=d(h);h=i(f,c);for(let n=0;n<y;n++)h[n][n]=t(h[n][n],e);if(s&&(N=i(N,c)),1===y||w(u(h[y-1][y-2]),o)){M=0,g.push(h[y-1][y-1]),s&&(b.unshift([[1]]),S(N,r),v=i(v,N),y>1&&(N=l(Array(y-1).fill(m)))),y-=1,h.pop();for(let e=0;e<y;e++)h[e].pop()}else if(2===y||w(u(h[y-2][y-3]),o)){M=0;const e=A(h[y-2][y-2],h[y-2][y-1],h[y-1][y-2],h[y-1][y-1]);g.push(...e),s&&(b.unshift(E(h[y-2][y-2],h[y-2][y-1],h[y-1][y-2],h[y-1][y-1],e[0],e[1],o,a)),S(N,r),v=i(v,N),y>2&&(N=l(Array(y-2).fill(m)))),y-=2,h.pop(),h.pop();for(let e=0;e<y;e++)h[e].pop(),h[e].pop()}if(0===y)break}if(g.sort(((e,t)=>+n(u(e),u(t)))),M>100){const e=Error("The eigenvalues failed to converge. Only found these eigenvalues: "+g.join(", "));throw e.values=g,e.vectors=[],e}const C=s?i(v,function(e,t){const n=[];for(let e=0;e<t;e++)n[e]=Array(t).fill(0);let r=0;for(const t of e){const e=t.length;for(let i=0;i<e;i++)for(let o=0;o<e;o++)n[r+i][r+o]=t[i][o];r+=e}return n}(b,r)):void 0;return{values:g,C}}(e,s,f,p,h);if(h){const t=function(e,t,o,a,s,u,f){const p=m(o),d=i(p,e,o),h="BigNumber"===f,b="Complex"===f,w=h?c(0):b?x(0):0,v=h?c(1):b?x(1):1,N=[],A=[];for(const e of s){const t=M(N,e,y);-1===t?(N.push(e),A.push(1)):A[t]+=1}const E=[],S=N.length,T=Array(t).fill(w),B=l(Array(t).fill(v));for(let e=0;e<S;e++){const s=N[e],c=n(d,i(s,B));let l=g(c,T);for(l.shift();l.length<A[e];){const e=C(c,t,l,u,f);if(null===e)break;l.push(e)}const p=i(m(a),o);l=l.map((e=>i(p,e))),E.push(...l.map((e=>({value:s,vector:r(e)}))))}return E}(e,s,T,v,N,f,p);return{values:N,eigenvectors:t}}return{values:N}}}({config:t,addScalar:i,subtract:o,multiply:y,multiplyScalar:f,flatten:A,divideScalar:p,sqrt:M,abs:s,bignumber:d,diag:C,size:T,reshape:B,qr:F,inv:m,usolve:D,usolveAll:O,equal:a,complex:S,larger:v,smaller:q,matrixFromColumns:I,dot:k});return n("eigs",{Array:function(e){return U(r(e))},"Array, number|BigNumber":function(e,t){return U(r(e),{precision:t})},"Array, Object":(e,t)=>U(r(e),t),Matrix:function(e){return U(e,{matricize:!0})},"Matrix, number|BigNumber":function(e,t){return U(e,{precision:t,matricize:!0})},"Matrix, Object":function(e,t){const n={matricize:!0};return sr(n,t),U(e,n)}});function U(e){var n;let i=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const a=!("eigenvectors"in i)||i.eigenvectors,u=function(e,t,n){const r=e.toArray(),i=e.size();if(2!==i.length||i[0]!==i[1])throw new RangeError(`Matrix must be square (size: ${pr(i)})`);const a=i[0];if(function(e,t,n){for(let r=0;r<t;r++)for(let i=0;i<t;i++)if(v(d(s(_(e[r][i]))),n))return!1;return!0}(r,a,t)&&(function(e,t){for(let n=0;n<t;n++)for(let r=0;r<t;r++)e[n][r]=z(e[n][r])}(r,a),function(e,t,n){for(let r=0;r<t;r++)for(let i=r;i<t;i++)if(v(d(s(o(e[r][i],e[i][r]))),n))return!1;return!0}(r,a,t))){const i=j(e,r,a);return R(r,a,t,i,n)}const u=j(e,r,a);return P(r,a,t,u,n)}(e,null!==(n=i.precision)&&void 0!==n?n:t.relTol,a);return i.matricize&&(u.values=r(u.values),a&&(u.eigenvectors=u.eigenvectors.map((e=>{let{value:t,vector:n}=e;return{value:t,vector:r(n)}})))),a&&Object.defineProperty(u,"vectors",{enumerable:!1,get:()=>{throw new Error("eigs(M).vectors replaced with eigs(M).eigenvectors")}}),u}function j(e,t,n){const r=e.datatype();if("number"===r||"BigNumber"===r||"Complex"===r)return r;let i=!1,o=!1,a=!1;for(let e=0;e<n;e++)for(let r=0;r<n;r++){const n=t[e][r];if(h(n)||b(n))i=!0;else if(g(n))o=!0;else{if(!x(n))throw TypeError("Unsupported type in Matrix: "+oe(n));a=!0}}if(o&&a&&console.warn("Complex BigNumbers not supported, this operation will lose precission."),a){for(let e=0;e<n;e++)for(let r=0;r<n;r++)t[e][r]=S(t[e][r]);return"Complex"}if(o){for(let e=0;e<n;e++)for(let r=0;r<n;r++)t[e][r]=d(t[e][r]);return"BigNumber"}if(i){for(let e=0;e<n;e++)for(let r=0;r<n;r++)t[e][r]=E(t[e][r]);return"number"}throw TypeError("Matrix contains unsupported types only.")}})),xd="expm",bd=de(xd,["typed","abs","add","identity","inv","multiply"],(e=>{let{typed:t,abs:n,add:r,identity:i,inv:o,multiply:a}=e;return t(xd,{Matrix:function(e){const t=e.size();if(2!==t.length||t[0]!==t[1])throw new RangeError("Matrix must be square (size: "+pr(t)+")");const u=t[0],c=function(e){const t=e.size()[0];let r=0;for(let i=0;i<t;i++){let o=0;for(let r=0;r<t;r++)o+=n(e.get([i,r]));r=Math.max(o,r)}return r}(e),l=function(e){for(let t=0;t<30;t++)for(let n=0;n<=t;n++){const r=t-n;if(s(e,n,r)<1e-15)return{q:n,j:r}}throw new Error("Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)")}(c),f=l.q,p=l.j,m=a(e,Math.pow(2,-p));let d=i(u),h=i(u),g=1,y=m,x=-1;for(let e=1;e<=f;e++)e>1&&(y=a(y,m),x=-x),g=g*(f-e+1)/((2*f-e+1)*e),d=r(d,a(g,y)),h=r(h,a(g*x,y));let b=a(o(h),d);for(let e=0;e<p;e++)b=a(b,b);return M(e)?e.createSparseMatrix(b):b}});function s(e,t,n){let r=1;for(let e=2;e<=t;e++)r*=e;let i=r;for(let e=t+1;e<=2*t;e++)i*=e;const o=i*(2*t+1);return 8*Math.pow(e/Math.pow(2,n),2*t)*r*r/(i*o)}})),wd="sqrtm",vd=de(wd,["typed","abs","add","multiply","map","sqrt","subtract","inv","size","max","identity"],(e=>{let{typed:t,abs:n,add:r,multiply:i,map:o,sqrt:a,subtract:s,inv:u,size:c,max:l,identity:f}=e;const p=1e-6;function m(e){let t,o=0,a=e,m=f(c(e));do{const e=a;if(a=i(.5,r(e,u(m))),m=i(.5,r(m,u(e))),t=l(n(s(a,e))),t>p&&++o>1e3)throw new Error("computing square root of matrix: iterative method could not converge")}while(t>p);return a}return t(wd,{"Array | Matrix":function(e){const t=A(e)?e.size():wr(e);switch(t.length){case 1:if(1===t[0])return o(e,a);throw new RangeError("Matrix must be square (size: "+pr(t)+")");case 2:if(t[0]===t[1])return m(e);throw new RangeError("Matrix must be square (size: "+pr(t)+")");default:throw new RangeError("Matrix must be at most two dimensional (size: "+pr(t)+")")}}})})),Nd="sylvester",Ad=de(Nd,["typed","schur","matrixFromColumns","matrix","multiply","range","concat","transpose","index","subset","add","subtract","identity","lusolve","abs"],(e=>{let{typed:t,schur:n,matrixFromColumns:r,matrix:i,multiply:o,range:a,concat:s,transpose:u,index:c,subset:l,add:f,subtract:p,identity:m,lusolve:d,abs:h}=e;return t(Nd,{"Matrix, Matrix, Matrix":g,"Array, Matrix, Matrix":function(e,t,n){return g(i(e),t,n)},"Array, Array, Matrix":function(e,t,n){return g(i(e),i(t),n)},"Array, Matrix, Array":function(e,t,n){return g(i(e),t,i(n))},"Matrix, Array, Matrix":function(e,t,n){return g(e,i(t),n)},"Matrix, Array, Array":function(e,t,n){return g(e,i(t),i(n))},"Matrix, Matrix, Array":function(e,t,n){return g(e,t,i(n))},"Array, Array, Array":function(e,t,n){return g(i(e),i(t),i(n)).toArray()}});function g(e,t,g){const y=t.size()[0],x=e.size()[0],b=n(e),w=b.T,v=b.U,N=n(o(-1,t)),A=N.T,E=N.U,S=o(o(u(v),g),E),M=a(0,x),C=[],T=(e,t)=>s(e,t,1),B=(e,t)=>s(e,t,0);for(let e=0;e<y;e++)if(e<y-1&&h(l(A,c(e+1,e)))>1e-5){let t=B(l(S,c(M,e)),l(S,c(M,e+1)));for(let n=0;n<e;n++)t=f(t,B(o(C[n],l(A,c(n,e))),o(C[n],l(A,c(n,e+1)))));const n=o(m(x),o(-1,l(A,c(e,e)))),r=o(m(x),o(-1,l(A,c(e+1,e)))),i=o(m(x),o(-1,l(A,c(e,e+1)))),s=o(m(x),o(-1,l(A,c(e+1,e+1)))),u=B(T(f(w,n),r),T(i,f(w,s))),p=d(u,t);C[e]=p.subset(c(a(0,x),0)),C[e+1]=p.subset(c(a(x,2*x),0)),e++}else{let t=l(S,c(M,e));for(let n=0;n<e;n++)t=f(t,o(C[n],l(A,c(n,e))));const n=l(A,c(e,e)),r=p(w,o(n,m(x)));C[e]=d(r,t)}const F=i(r(...C));return o(v,o(F,u(E)))}})),Ed="schur",Sd=de(Ed,["typed","matrix","identity","multiply","qr","norm","subtract"],(e=>{let{typed:t,matrix:n,identity:r,multiply:i,qr:o,norm:a,subtract:s}=e;return t(Ed,{Array:function(e){const t=u(n(e));return{U:t.U.valueOf(),T:t.T.valueOf()}},Matrix:function(e){return u(e)}});function u(e){const t=e.size()[0];let n,u=e,c=r(t),l=0;do{n=u;const e=o(u),t=e.Q,r=e.R;if(u=i(r,t),c=i(c,t),l++>100)break}while(a(s(u,n))>1e-4);return{U:c,T:u}}})),Md="lyap",Cd=de(Md,["typed","matrix","sylvester","multiply","transpose"],(e=>{let{typed:t,matrix:n,sylvester:r,multiply:i,transpose:o}=e;return t(Md,{"Matrix, Matrix":function(e,t){return r(e,o(e),i(-1,t))},"Array, Matrix":function(e,t){return r(n(e),o(n(e)),i(-1,t))},"Matrix, Array":function(e,t){return r(e,o(n(e)),n(i(-1,t)))},"Array, Array":function(e,t){return r(n(e),o(n(e)),n(i(-1,t))).toArray()}})})),Td=de("divide",["typed","matrix","multiply","equalScalar","divideScalar","inv"],(e=>{let{typed:t,matrix:n,multiply:r,equalScalar:i,divideScalar:o,inv:a}=e;const s=Ro({typed:t,equalScalar:i}),u=Uo({typed:t});return t("divide",se({"Array | Matrix, Array | Matrix":function(e,t){return r(e,a(t))},"DenseMatrix, any":function(e,t){return u(e,t,o,!1)},"SparseMatrix, any":function(e,t){return s(e,t,o,!1)},"Array, any":function(e,t){return u(n(e),t,o,!1).valueOf()},"any, Array | Matrix":function(e,t){return r(e,a(t))}},o.signatures))})),Bd="distance",Fd=de(Bd,["typed","addScalar","subtractScalar","divideScalar","multiplyScalar","deepEqual","sqrt","abs"],(e=>{let{typed:t,addScalar:n,subtractScalar:r,multiplyScalar:i,divideScalar:o,deepEqual:a,sqrt:s,abs:u}=e;return t(Bd,{"Array, Array, Array":function(e,t,n){if(2===e.length&&2===t.length&&2===n.length){if(!l(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!l(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!l(n))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");if(a(t,n))throw new TypeError("LinePoint1 should not be same with LinePoint2");const o=r(n[1],t[1]),s=r(t[0],n[0]),u=r(i(n[0],t[1]),i(t[0],n[1]));return h(e[0],e[1],o,s,u)}throw new TypeError("Invalid Arguments: Try again")},"Object, Object, Object":function(e,t,n){if(2===Object.keys(e).length&&2===Object.keys(t).length&&2===Object.keys(n).length){if(!l(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!l(t))throw new TypeError("Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers");if(!l(n))throw new TypeError("Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers");if(a(d(t),d(n)))throw new TypeError("LinePoint1 should not be same with LinePoint2");if("pointX"in e&&"pointY"in e&&"lineOnePtX"in t&&"lineOnePtY"in t&&"lineTwoPtX"in n&&"lineTwoPtY"in n){const o=r(n.lineTwoPtY,t.lineOnePtY),a=r(t.lineOnePtX,n.lineTwoPtX),s=r(i(n.lineTwoPtX,t.lineOnePtY),i(t.lineOnePtX,n.lineTwoPtY));return h(e.pointX,e.pointY,o,a,s)}throw new TypeError("Key names do not match")}throw new TypeError("Invalid Arguments: Try again")},"Array, Array":function(e,t){if(2===e.length&&3===t.length){if(!l(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!f(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");return h(e[0],e[1],t[0],t[1],t[2])}if(3===e.length&&6===t.length){if(!f(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!m(t))throw new TypeError("Array with 6 numbers or BigNumbers expected for second argument");return y(e[0],e[1],e[2],t[0],t[1],t[2],t[3],t[4],t[5])}if(e.length===t.length&&e.length>0){if(!p(e))throw new TypeError("All values of an array should be numbers or BigNumbers");if(!p(t))throw new TypeError("All values of an array should be numbers or BigNumbers");return x(e,t)}throw new TypeError("Invalid Arguments: Try again")},"Object, Object":function(e,t){if(2===Object.keys(e).length&&3===Object.keys(t).length){if(!l(e))throw new TypeError("Values of pointX and pointY should be numbers or BigNumbers");if(!f(t))throw new TypeError("Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers");if("pointX"in e&&"pointY"in e&&"xCoeffLine"in t&&"yCoeffLine"in t&&"constant"in t)return h(e.pointX,e.pointY,t.xCoeffLine,t.yCoeffLine,t.constant);throw new TypeError("Key names do not match")}if(3===Object.keys(e).length&&6===Object.keys(t).length){if(!f(e))throw new TypeError("Values of pointX, pointY and pointZ should be numbers or BigNumbers");if(!m(t))throw new TypeError("Values of x0, y0, z0, a, b and c should be numbers or BigNumbers");if("pointX"in e&&"pointY"in e&&"x0"in t&&"y0"in t&&"z0"in t&&"a"in t&&"b"in t&&"c"in t)return y(e.pointX,e.pointY,e.pointZ,t.x0,t.y0,t.z0,t.a,t.b,t.c);throw new TypeError("Key names do not match")}if(2===Object.keys(e).length&&2===Object.keys(t).length){if(!l(e))throw new TypeError("Values of pointOneX and pointOneY should be numbers or BigNumbers");if(!l(t))throw new TypeError("Values of pointTwoX and pointTwoY should be numbers or BigNumbers");if("pointOneX"in e&&"pointOneY"in e&&"pointTwoX"in t&&"pointTwoY"in t)return x([e.pointOneX,e.pointOneY],[t.pointTwoX,t.pointTwoY]);throw new TypeError("Key names do not match")}if(3===Object.keys(e).length&&3===Object.keys(t).length){if(!f(e))throw new TypeError("Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers");if(!f(t))throw new TypeError("Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers");if("pointOneX"in e&&"pointOneY"in e&&"pointOneZ"in e&&"pointTwoX"in t&&"pointTwoY"in t&&"pointTwoZ"in t)return x([e.pointOneX,e.pointOneY,e.pointOneZ],[t.pointTwoX,t.pointTwoY,t.pointTwoZ]);throw new TypeError("Key names do not match")}throw new TypeError("Invalid Arguments: Try again")},Array:function(e){if(!function(e){if(2===e[0].length&&c(e[0][0])&&c(e[0][1])){if(e.some((e=>2!==e.length||!c(e[0])||!c(e[1]))))return!1}else{if(!(3===e[0].length&&c(e[0][0])&&c(e[0][1])&&c(e[0][2])))return!1;if(e.some((e=>3!==e.length||!c(e[0])||!c(e[1])||!c(e[2]))))return!1}return!0}(e))throw new TypeError("Incorrect array format entered for pairwise distance calculation");return function(e){const t=[];let n=[],r=[];for(let i=0;i<e.length-1;i++)for(let o=i+1;o<e.length;o++)2===e[0].length?(n=[e[i][0],e[i][1]],r=[e[o][0],e[o][1]]):3===e[0].length&&(n=[e[i][0],e[i][1],e[i][2]],r=[e[o][0],e[o][1],e[o][2]]),t.push(x(n,r));return t}(e)}});function c(e){return"number"==typeof e||g(e)}function l(e){return e.constructor!==Array&&(e=d(e)),c(e[0])&&c(e[1])}function f(e){return e.constructor!==Array&&(e=d(e)),c(e[0])&&c(e[1])&&c(e[2])}function p(e){return Array.isArray(e)||(e=d(e)),e.every(c)}function m(e){return e.constructor!==Array&&(e=d(e)),c(e[0])&&c(e[1])&&c(e[2])&&c(e[3])&&c(e[4])&&c(e[5])}function d(e){const t=Object.keys(e),n=[];for(let r=0;r<t.length;r++)n.push(e[t[r]]);return n}function h(e,t,r,a,c){const l=u(n(n(i(r,e),i(a,t)),c)),f=s(n(i(r,r),i(a,a)));return o(l,f)}function y(e,t,a,u,c,l,f,p,m){let d=[r(i(r(c,t),m),i(r(l,a),p)),r(i(r(l,a),f),i(r(u,e),m)),r(i(r(u,e),p),i(r(c,t),f))];d=s(n(n(i(d[0],d[0]),i(d[1],d[1])),i(d[2],d[2])));const h=s(n(n(i(f,f),i(p,p)),i(m,m)));return o(d,h)}function x(e,t){const o=e.length;let a=0,u=0;for(let s=0;s<o;s++)u=r(e[s],t[s]),a=n(i(u,u),a);return s(a)}})),Dd=de("intersect",["typed","config","abs","add","addScalar","matrix","multiply","multiplyScalar","divideScalar","subtract","smaller","equalScalar","flatten","isZero","isNumeric"],(e=>{let{typed:t,config:n,abs:r,add:i,addScalar:o,matrix:a,multiply:s,multiplyScalar:u,divideScalar:c,subtract:l,smaller:f,equalScalar:p,flatten:m,isZero:d,isNumeric:h}=e;return t("intersect",{"Array, Array, Array":g,"Array, Array, Array, Array":y,"Matrix, Matrix, Matrix":function(e,t,n){const r=g(e.valueOf(),t.valueOf(),n.valueOf());return null===r?null:a(r)},"Matrix, Matrix, Matrix, Matrix":function(e,t,n,r){const i=y(e.valueOf(),t.valueOf(),n.valueOf(),r.valueOf());return null===i?null:a(i)}});function g(e,t,n){if(e=x(e),t=x(t),n=x(n),!w(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!w(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!function(e){return 4===e.length&&h(e[0])&&h(e[1])&&h(e[2])&&h(e[3])}(n))throw new TypeError("Array with 4 numbers expected as third argument");return function(e,t,n,r,i,a,s,f,p,m){const d=u(e,s),h=u(r,s),g=u(t,f),y=u(i,f),x=u(n,p),b=u(a,p),w=l(l(l(m,d),g),x),v=l(l(l(o(o(h,y),b),d),g),x),N=c(w,v);return[o(e,u(N,l(r,e))),o(t,u(N,l(i,t))),o(n,u(N,l(a,n)))]}(e[0],e[1],e[2],t[0],t[1],t[2],n[0],n[1],n[2],n[3])}function y(e,t,a,m){if(e=x(e),t=x(t),a=x(a),m=x(m),2===e.length){if(!b(e))throw new TypeError("Array with 2 numbers or BigNumbers expected for first argument");if(!b(t))throw new TypeError("Array with 2 numbers or BigNumbers expected for second argument");if(!b(a))throw new TypeError("Array with 2 numbers or BigNumbers expected for third argument");if(!b(m))throw new TypeError("Array with 2 numbers or BigNumbers expected for fourth argument");return function(e,t,a,p){const m=e,h=a,g=l(m,t),y=l(h,p),x=l(u(g[0],y[1]),u(y[0],g[1]));if(d(x))return null;if(f(r(x),n.relTol))return null;const b=u(y[0],m[1]),w=u(y[1],m[0]),v=u(y[0],h[1]),N=u(y[1],h[0]),A=c(o(l(l(b,w),v),N),x);return i(s(g,A),m)}(e,t,a,m)}if(3===e.length){if(!w(e))throw new TypeError("Array with 3 numbers or BigNumbers expected for first argument");if(!w(t))throw new TypeError("Array with 3 numbers or BigNumbers expected for second argument");if(!w(a))throw new TypeError("Array with 3 numbers or BigNumbers expected for third argument");if(!w(m))throw new TypeError("Array with 3 numbers or BigNumbers expected for fourth argument");return function(e,t,n,r,i,a,s,f,m,h,g,y){const x=v(e,s,h,s,t,f,g,f,n,m,y,m),b=v(h,s,r,e,g,f,i,t,y,m,a,n),w=v(e,s,r,e,t,f,i,t,n,m,a,n),N=v(h,s,h,s,g,f,g,f,y,m,y,m),A=v(r,e,r,e,i,t,i,t,a,n,a,n),E=l(u(x,b),u(w,N)),S=l(u(A,N),u(b,b));if(d(S))return null;const M=c(E,S),C=c(o(x,u(M,b)),N),T=o(e,u(M,l(r,e))),B=o(t,u(M,l(i,t))),F=o(n,u(M,l(a,n))),D=o(s,u(C,l(h,s))),O=o(f,u(C,l(g,f))),_=o(m,u(C,l(y,m)));return p(T,D)&&p(B,O)&&p(F,_)?[T,B,F]:null}(e[0],e[1],e[2],t[0],t[1],t[2],a[0],a[1],a[2],m[0],m[1],m[2])}throw new TypeError("Arrays with two or thee dimensional points expected")}function x(e){return 1===e.length?e[0]:e.length>1&&Array.isArray(e[0])&&e.every((e=>Array.isArray(e)&&1===e.length))?m(e):e}function b(e){return 2===e.length&&h(e[0])&&h(e[1])}function w(e){return 3===e.length&&h(e[0])&&h(e[1])&&h(e[2])}function v(e,t,n,r,i,a,s,c,f,p,m,d){const h=u(l(e,t),l(n,r)),g=u(l(i,a),l(s,c)),y=u(l(f,p),l(m,d));return o(o(h,g),y)}})),Od=de("sum",["typed","config","add","numeric"],(e=>{let{typed:t,config:n,add:r,numeric:i}=e;return t("sum",{"Array | Matrix":o,"Array | Matrix, number | BigNumber":function(e,t){try{return ui(e,t,r)}catch(e){throw Qu(e,"sum")}},"...":function(e){if(oi(e))throw new TypeError("Scalar values expected in function sum");return o(e)}});function o(e){let t;return ai(e,(function(e){try{t=void 0===t?e:r(t,e)}catch(t){throw Qu(t,"sum",e)}})),void 0===t&&(t=i(0,n.number)),"string"==typeof t&&(t=i(t,xe(t,n))),t}})),_d="cumsum",zd=de(_d,["typed","add","unaryPlus"],(e=>{let{typed:t,add:n,unaryPlus:r}=e;return t(_d,{Array:i,Matrix:function(e){return e.create(i(e.valueOf(),e.datatype()))},"Array, number | BigNumber":a,"Matrix, number | BigNumber":function(e,t){return e.create(a(e.valueOf(),t),e.datatype())},"...":function(e){if(oi(e))throw new TypeError("All values expected to be scalar in function cumsum");return i(e)}});function i(e){try{return o(e)}catch(e){throw Qu(e,_d)}}function o(e){if(0===e.length)return[];const t=[r(e[0])];for(let r=1;r<e.length;++r)t.push(n(t[r-1],e[r]));return t}function a(e,t){const n=wr(e);if(t<0||t>=n.length)throw new br(t,n.length);try{return s(e,t)}catch(e){throw Qu(e,_d)}}function s(e,t){let n,r,i;if(t<=0){const a=e[0][0];if(Array.isArray(a)){for(i=ii(e),r=[],n=0;n<i.length;n++)r[n]=s(i[n],t-1);return r}return o(e)}for(r=[],n=0;n<e.length;n++)r[n]=s(e[n],t-1);return r}})),qd="mean",Id=de(qd,["typed","add","divide"],(e=>{let{typed:t,add:n,divide:r}=e;return t(qd,{"Array | Matrix":i,"Array | Matrix, number | BigNumber":function(e,t){try{const i=ui(e,t,n),o=Array.isArray(e)?wr(e):e.size();return r(i,o[t])}catch(e){throw Qu(e,"mean")}},"...":function(e){if(oi(e))throw new TypeError("Scalar values expected in function mean");return i(e)}});function i(e){let t,i=0;if(ai(e,(function(e){try{t=void 0===t?e:n(t,e),i++}catch(t){throw Qu(t,"mean",e)}})),0===i)throw new Error("Cannot calculate the mean of an empty array");return r(t,i)}})),kd="median",Rd=de(kd,["typed","add","divide","compare","partitionSelect"],(e=>{let{typed:t,add:n,divide:r,compare:i,partitionSelect:o}=e;function a(e){try{const t=(e=qr(e.valueOf())).length;if(0===t)throw new Error("Cannot calculate median of an empty array");if(t%2==0){const n=t/2-1,r=o(e,n+1);let a=e[n];for(let t=0;t<n;++t)i(e[t],a)>0&&(a=e[t]);return u(a,r)}{const n=o(e,(t-1)/2);return s(n)}}catch(e){throw Qu(e,"median")}}const s=t({"number | BigNumber | Complex | Unit":function(e){return e}}),u=t({"number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit":function(e,t){return r(n(e,t),2)}});return t(kd,{"Array | Matrix":a,"Array | Matrix, number | BigNumber":function(e,t){throw new Error("median(A, dim) is not yet supported")},"...":function(e){if(oi(e))throw new TypeError("Scalar values expected in function median");return a(e)}})})),Pd=de("mad",["typed","abs","map","median","subtract"],(e=>{let{typed:t,abs:n,map:r,median:i,subtract:o}=e;return t("mad",{"Array | Matrix":a,"...":function(e){return a(e)}});function a(e){if(0===(e=qr(e.valueOf())).length)throw new Error("Cannot calculate median absolute deviation (mad) of an empty array");try{const t=i(e);return i(r(e,(function(e){return n(o(e,t))})))}catch(e){throw e instanceof TypeError&&e.message.includes("median")?new TypeError(e.message.replace("median","mad")):Qu(e,"mad")}}})),Ud="unbiased",jd="variance",Ld=de(jd,["typed","add","subtract","multiply","divide","mapSlices","isNaN"],(e=>{let{typed:t,add:n,subtract:r,multiply:i,divide:o,mapSlices:a,isNaN:s}=e;return t(jd,{"Array | Matrix":function(e){return u(e,Ud)},"Array | Matrix, string":u,"Array | Matrix, number | BigNumber":function(e,t){return c(e,t,Ud)},"Array | Matrix, number | BigNumber, string":c,"...":function(e){return u(e,Ud)}});function u(e,t){let a,u=0;if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");if(ai(e,(function(e){try{a=void 0===a?e:n(a,e),u++}catch(t){throw Qu(t,"variance",e)}})),0===u)throw new Error("Cannot calculate variance of an empty array");const c=o(a,u);if(a=void 0,ai(e,(function(e){const t=r(e,c);a=void 0===a?i(t,t):n(a,i(t,t))})),s(a))return a;switch(t){case"uncorrected":return o(a,u);case"biased":return o(a,u+1);case"unbiased":{const e=g(a)?a.mul(0):0;return 1===u?e:o(a,u-1)}default:throw new Error('Unknown normalization "'+t+'". Choose "unbiased" (default), "uncorrected", or "biased".')}}function c(e,t,n){try{if(0===e.length)throw new SyntaxError("Function variance requires one or more parameters (0 provided)");return a(e,t,(e=>u(e,n)))}catch(e){throw Qu(e,"variance")}}})),$d="quantileSeq",Hd=de($d,["typed","?bignumber","add","subtract","divide","multiply","partitionSelect","compare","isInteger","smaller","smallerEq","larger","mapSlices"],(e=>{let{typed:t,bignumber:n,add:r,subtract:i,divide:o,multiply:a,partitionSelect:s,compare:u,isInteger:c,smaller:l,smallerEq:f,larger:p,mapSlices:m}=e;return t($d,{"Array | Matrix, number | BigNumber":(e,t)=>g(e,t,!1),"Array | Matrix, number | BigNumber, number":(e,t,n)=>d(e,t,!1,n,g),"Array | Matrix, number | BigNumber, boolean":g,"Array | Matrix, number | BigNumber, boolean, number":(e,t,n,r)=>d(e,t,n,r,g),"Array | Matrix, Array | Matrix":(e,t)=>y(e,t,!1),"Array | Matrix, Array | Matrix, number":(e,t,n)=>d(e,t,!1,n,y),"Array | Matrix, Array | Matrix, boolean":y,"Array | Matrix, Array | Matrix, boolean, number":(e,t,n,r)=>d(e,t,n,r,y)});function d(e,t,n,r,i){return m(e,r,(e=>i(e,t,n)))}function g(e,t,i){let a;const s=e.valueOf();if(l(t,0))throw new Error("N/prob must be non-negative");if(f(t,1))return h(t)?x(s,t,i):n(x(s,t,i));if(p(t,1)){if(!c(t))throw new Error("N must be a positive integer");if(p(t,4294967295))throw new Error("N must be less than or equal to 2^32-1, as that is the maximum length of an Array");const e=r(t,1);a=[];for(let n=0;l(n,t);n++){const t=o(n+1,e);a.push(x(s,t,i))}return h(t)?a:n(a)}}function y(e,t,n){const r=e.valueOf(),i=t.valueOf(),o=[];for(let e=0;e<i.length;++e)o.push(x(r,i[e],n));return o}function x(e,t,n){const o=qr(e),l=o.length;if(0===l)throw new Error("Cannot calculate quantile of an empty sequence");const f=h(t)?t*(l-1):t.times(l-1),p=h(t)?Math.floor(f):f.floor().toNumber(),m=h(t)?f%1:f.minus(p);if(c(f))return n?o[f]:s(o,h(t)?f:f.valueOf());let d,g;if(n)d=o[p],g=o[p+1];else{g=s(o,p+1),d=o[p];for(let e=0;e<p;++e)u(o[e],d)>0&&(d=o[e])}return r(a(d,i(1,m)),a(g,m))}})),Gd=de("std",["typed","map","sqrt","variance"],(e=>{let{typed:t,map:n,sqrt:r,variance:i}=e;return t("std",{"Array | Matrix":o,"Array | Matrix, string":o,"Array | Matrix, number | BigNumber":o,"Array | Matrix, number | BigNumber, string":o,"...":function(e){return o(e)}});function o(e,t){if(0===e.length)throw new SyntaxError("Function std requires one or more parameters (0 provided)");try{const e=i.apply(null,arguments);return E(e)?n(e,r):r(e)}catch(e){throw e instanceof TypeError&&e.message.includes(" variance")?new TypeError(e.message.replace(" variance"," std")):e}}})),Zd="corr",Vd=de(Zd,["typed","matrix","mean","sqrt","sum","add","subtract","multiply","pow","divide"],(e=>{let{typed:t,matrix:n,sqrt:r,sum:i,add:o,subtract:a,multiply:s,pow:u,divide:c}=e;return t(Zd,{"Array, Array":function(e,t){return l(e,t)},"Matrix, Matrix":function(e,t){const r=l(e.toArray(),t.toArray());return Array.isArray(r)?n(r):r}});function l(e,t){const n=[];if(Array.isArray(e[0])&&Array.isArray(t[0])){if(e.length!==t.length)throw new SyntaxError("Dimension mismatch. Array A and B must have the same length.");for(let r=0;r<e.length;r++){if(e[r].length!==t[r].length)throw new SyntaxError("Dimension mismatch. Array A and B must have the same number of elements.");n.push(f(e[r],t[r]))}return n}if(e.length!==t.length)throw new SyntaxError("Dimension mismatch. Array A and B must have the same number of elements.");return f(e,t)}function f(e,t){const n=e.length,l=i(e),f=i(t),p=e.reduce(((e,n,r)=>o(e,s(n,t[r]))),0),m=i(e.map((e=>u(e,2)))),d=i(t.map((e=>u(e,2)))),h=a(s(n,p),s(l,f)),g=r(s(a(s(n,m),u(l,2)),a(s(n,d),u(f,2))));return c(h,g)}}));function Wd(e,t){if(t<e)return 1;if(t===e)return t;const n=t+e>>1;return Wd(e,n)*Wd(n+1,t)}function Yd(e,t){if(!ye(e)||e<0)throw new TypeError("Positive integer value expected in function combinations");if(!ye(t)||t<0)throw new TypeError("Positive integer value expected in function combinations");if(t>e)throw new TypeError("k must be less than or equal to n");const n=e-t;let r=1,i=2;const o=t<n?t:n;for(let a=t<n?n+1:t+1;a<=e;++a)for(r*=a;i<=o&&r%i==0;)r/=i,++i;return i<=o&&(r/=Wd(i,o)),r}Yd.signature="number, number";const Jd="combinations",Xd=de(Jd,["typed"],(e=>{let{typed:t}=e;return t(Jd,{"number, number":Yd,"BigNumber, BigNumber":function(e,t){const n=e.constructor;let r,i;const o=e.minus(t),a=new n(1);if(!Qd(e)||!Qd(t))throw new TypeError("Positive integer value expected in function combinations");if(t.gt(e))throw new TypeError("k must be less than n in function combinations");if(r=a,t.lt(o))for(i=a;i.lte(o);i=i.plus(a))r=r.times(t.plus(i)).dividedBy(i);else for(i=a;i.lte(t);i=i.plus(a))r=r.times(o.plus(i)).dividedBy(i);return r}})}));function Qd(e){return e.isInteger()&&e.gte(0)}const Kd="combinationsWithRep",eh=de(Kd,["typed"],(e=>{let{typed:t}=e;return t(Kd,{"number, number":function(e,t){if(!ye(e)||e<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(!ye(t)||t<0)throw new TypeError("Positive integer value expected in function combinationsWithRep");if(e<1)throw new TypeError("k must be less than or equal to n + k - 1");return t<e-1?Wd(e,e+t-1)/Wd(1,t):Wd(t+1,e+t-1)/Wd(1,e-1)},"BigNumber, BigNumber":function(e,t){let n,r;const i=new(0,e.constructor)(1),o=e.minus(i);if(!th(e)||!th(t))throw new TypeError("Positive integer value expected in function combinationsWithRep");if(e.lt(i))throw new TypeError("k must be less than or equal to n + k - 1 in function combinationsWithRep");if(n=i,t.lt(o))for(r=i;r.lte(o);r=r.plus(i))n=n.times(t.plus(r)).dividedBy(r);else for(r=i;r.lte(t);r=r.plus(i))n=n.times(o.plus(r)).dividedBy(r);return n}})}));function th(e){return e.isInteger()&&e.gte(0)}function nh(e){let t;if(ye(e))return e<=0?isFinite(e)?1/0:NaN:e>171?1/0:Wd(1,e-1);if(e<.5)return Math.PI/(Math.sin(Math.PI*e)*nh(1-e));if(e>=171.35)return 1/0;if(e>85){const t=e*e,n=t*e,r=n*e,i=r*e;return Math.sqrt(2*Math.PI/e)*Math.pow(e/Math.E,e)*(1+1/(12*e)+1/(288*t)-139/(51840*n)-571/(2488320*r)+163879/(209018880*i)+5246819/(75246796800*i*e))}--e,t=ih[0];for(let n=1;n<ih.length;++n)t+=ih[n]/(e+n);const n=e+rh+.5;return Math.sqrt(2*Math.PI)*Math.pow(n,e+.5)*Math.exp(-n)*t}nh.signature="number";const rh=4.7421875,ih=[.9999999999999971,57.15623566586292,-59.59796035547549,14.136097974741746,-.4919138160976202,3399464998481189e-20,4652362892704858e-20,-9837447530487956e-20,.0001580887032249125,-.00021026444172410488,.00021743961811521265,-.0001643181065367639,8441822398385275e-20,-26190838401581408e-21,36899182659531625e-22],oh=.9189385332046728,ah=[1.000000000190015,76.18009172947146,-86.50532032941678,24.01409824083091,-1.231739572450155,.001208650973866179,-5395239384953e-18];function sh(e){if(e<0)return NaN;if(0===e)return 1/0;if(!isFinite(e))return e;if(e<.5)return Math.log(Math.PI/Math.sin(Math.PI*e))-sh(1-e);const t=5+(e-=1)+.5;let n=ah[0];for(let t=6;t>=1;t--)n+=ah[t]/(e+t);return oh+(e+.5)*Math.log(t)-t+Math.log(n)}sh.signature="number";const uh="gamma",ch=de(uh,["typed","config","multiplyScalar","pow","BigNumber","Complex"],(e=>{let{typed:t,config:n,multiplyScalar:r,pow:i,BigNumber:o,Complex:a}=e;return t(uh,{number:nh,Complex:function e(t){if(0===t.im)return nh(t.re);if(t.re<.5){const n=new a(1-t.re,-t.im),r=new a(Math.PI*t.re,Math.PI*t.im);return new a(Math.PI).div(r.sin()).div(e(n))}t=new a(t.re-1,t.im);let n=new a(ih[0],0);for(let e=1;e<ih.length;++e){const r=new a(ih[e],0);n=n.add(r.div(t.add(e)))}const r=new a(t.re+rh+.5,t.im),i=Math.sqrt(2*Math.PI),o=r.pow(t.add(.5)),s=r.neg().exp();return n.mul(i).mul(o).mul(s)},BigNumber:function(e){if(e.isInteger())return e.isNegative()||e.isZero()?new o(1/0):s(e.minus(1));if(!e.isFinite())return new o(e.isNegative()?NaN:1/0);throw new Error("Integer BigNumber expected")}});function s(e){if(e<8)return new o([1,1,2,6,24,120,720,5040][e]);const t=n.precision+(0|Math.log(e.toNumber())),r=o.clone({precision:t});if(e%2==1)return e.times(s(new o(e-1)));let i=e,a=new r(e),u=e.toNumber();for(;i>2;)i-=2,u+=i,a=a.times(u);return new o(a.toPrecision(o.precision))}})),lh="lgamma",fh=de(lh,["Complex","typed"],(e=>{let{Complex:t,typed:n}=e;const r=[-.029550653594771242,.00641025641025641,-.0019175269175269176,.0008417508417508417,-.0005952380952380953,.0007936507936507937,-.002777777777777778,.08333333333333333];return n(lh,{number:sh,Complex:function e(n){if(n.isNaN())return new t(NaN,NaN);if(0===n.im)return new t(sh(n.re),0);if(n.re>=7||Math.abs(n.im)>=7)return i(n);if(n.re<=.1){const i=(r=6.283185307179586,(!0^((a=n.im)>0||!(a<0)&&1/a==1/0)?-r:r)*Math.floor(.5*n.re+.25)),o=n.mul(Math.PI).sin().log(),s=e(new t(1-n.re,-n.im));return new t(1.1447298858494002,i).sub(o).sub(s)}return n.im>=0?o(n):o(n.conjugate()).conjugate();var r,a},BigNumber:function(){throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber")}});function i(e){const n=e.sub(.5).mul(e.log()).sub(e).add(oh),i=new t(1,0).div(e),o=i.div(e);let a=r[0],s=r[1];const u=2*o.re,c=o.re*o.re+o.im*o.im;for(let e=2;e<8;e++){const t=s;s=-c*a+r[e],a=u*a+t}const l=i.mul(o.mul(a).add(s));return n.add(l)}function o(e){let n=0,r=0,o=e;for(e=e.add(1);e.re<=7;){o=o.mul(e);const t=o.im<0?1:0;0!==t&&0===r&&n++,r=t,e=e.add(1)}return i(e).sub(o.log()).sub(new t(0,2*n*Math.PI*1))}})),ph="factorial",mh=de(ph,["typed","gamma"],(e=>{let{typed:t,gamma:n}=e;return t(ph,{number:function(e){if(e<0)throw new Error("Value must be non-negative");return n(e+1)},BigNumber:function(e){if(e.isNegative())throw new Error("Value must be non-negative");return n(e.plus(1))},"Array | Matrix":t.referToSelf((e=>t=>si(t,e)))})})),dh="kldivergence",hh=de(dh,["typed","matrix","divide","sum","multiply","map","dotDivide","log","isNumeric"],(e=>{let{typed:t,matrix:n,divide:r,sum:i,multiply:o,map:a,dotDivide:s,log:u,isNumeric:c}=e;return t(dh,{"Array, Array":function(e,t){return l(n(e),n(t))},"Matrix, Array":function(e,t){return l(e,n(t))},"Array, Matrix":function(e,t){return l(n(e),t)},"Matrix, Matrix":function(e,t){return l(e,t)}});function l(e,t){const n=t.size().length,l=e.size().length;if(n>1)throw new Error("first object must be one dimensional");if(l>1)throw new Error("second object must be one dimensional");if(n!==l)throw new Error("Length of two vectors must be equal");if(0===i(e))throw new Error("Sum of elements in first object must be non zero");if(0===i(t))throw new Error("Sum of elements in second object must be non zero");const f=r(e,i(e)),p=r(t,i(t)),m=i(o(f,a(s(f,p),(e=>u(e)))));return c(m)?m:Number.NaN}})),gh="multinomial",yh=de(gh,["typed","add","divide","multiply","factorial","isInteger","isPositive"],(e=>{let{typed:t,add:n,divide:r,multiply:i,factorial:o,isInteger:a,isPositive:s}=e;return t(gh,{"Array | Matrix":function(e){let t=0,u=1;return ai(e,(function(e){if(!a(e)||!s(e))throw new TypeError("Positive integer value expected in function multinomial");t=n(t,e),u=i(u,o(e))})),r(o(t),u)}})})),xh="permutations",bh=de(xh,["typed","factorial"],(e=>{let{typed:t,factorial:n}=e;return t(xh,{"number | BigNumber":n,"number, number":function(e,t){if(!ye(e)||e<0)throw new TypeError("Positive integer value expected in function permutations");if(!ye(t)||t<0)throw new TypeError("Positive integer value expected in function permutations");if(t>e)throw new TypeError("second argument k must be less than or equal to first argument n");return Wd(e-t+1,e)},"BigNumber, BigNumber":function(e,t){let n,r;if(!wh(e)||!wh(t))throw new TypeError("Positive integer value expected in function permutations");if(t.gt(e))throw new TypeError("second argument k must be less than or equal to first argument n");for(n=e.mul(0).add(1),r=e.minus(t).plus(1);r.lte(e);r=r.plus(1))n=n.times(r);return n}})}));function wh(e){return e.isInteger()&&e.gte(0)}var vh=n(391);const Nh=vh(Date.now());function Ah(e){let t;var n;return t=null===(n=e)?Nh:vh(String(n)),function(){return t()}}const Eh="pickRandom",Sh=de(Eh,["typed","config","?on"],(e=>{let{typed:t,config:n,on:r}=e,i=Ah(n.randomSeed);return r&&r("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Ah(e.randomSeed))})),t(Eh,{"Array | Matrix":function(e){return o(e,{})},"Array | Matrix, Object":function(e,t){return o(e,t)},"Array | Matrix, number":function(e,t){return o(e,{number:t})},"Array | Matrix, Array | Matrix":function(e,t){return o(e,{weights:t})},"Array | Matrix, Array | Matrix, number":function(e,t,n){return o(e,{number:n,weights:t})},"Array | Matrix, number, Array | Matrix":function(e,t,n){return o(e,{number:t,weights:n})}});function o(e,t){let{number:n,weights:r,elementWise:o=!0}=t;const a=void 0===n;a&&(n=1);const s=A(e)?e.create:A(r)?r.create:null;e=e.valueOf(),r&&(r=r.valueOf()),!0===o&&(e=qr(e),r=qr(r));let u=0;if(void 0!==r){if(r.length!==e.length)throw new Error("Weights must have the same length as possibles");for(let e=0,t=r.length;e<t;e++){if(!h(r[e])||r[e]<0)throw new Error("Weights must be an array of positive numbers");u+=r[e]}}const c=e.length,l=[];let f;for(;l.length<n;){if(void 0===r)f=e[Math.floor(i()*c)];else{let t=i()*u;for(let n=0,i=e.length;n<i;n++)if(t-=r[n],t<0){f=e[n];break}}l.push(f)}return a?l[0]:s?s(l):l}}));function Mh(e,t){const n=[];if((e=e.slice(0)).length>1)for(let r=0,i=e.shift();r<i;r++)n.push(Mh(e,t));else for(let r=0,i=e.shift();r<i;r++)n.push(t());return n}const Ch="random",Th=de(Ch,["typed","config","?on"],(e=>{let{typed:t,config:n,on:r}=e,i=Ah(n.randomSeed);return r&&r("config",(function(e,t){e.randomSeed!==t.randomSeed&&(i=Ah(e.randomSeed))})),t(Ch,{"":()=>a(0,1),number:e=>a(0,e),"number, number":(e,t)=>a(e,t),"Array | Matrix":e=>o(e,0,1),"Array | Matrix, number":(e,t)=>o(e,0,t),"Array | Matrix, number, number":(e,t,n)=>o(e,t,n)});function o(e,t,n){const r=Mh(e.valueOf(),(()=>a(t,n)));return A(e)?e.create(r,"number"):r}function a(e,t){return e+i()*(t-e)}})),Bh="randomInt",Fh=de(Bh,["typed","config","log2","?on"],(e=>{let{typed:t,config:n,log2:r,on:i}=e,o=Ah(n.randomSeed);return i&&i("config",(function(e,t){e.randomSeed!==t.randomSeed&&(o=Ah(e.randomSeed))})),t(Bh,{"":()=>s(0,2),number:e=>s(0,e),"number, number":(e,t)=>s(e,t),bigint:e=>u(0n,e),"bigint, bigint":u,"Array | Matrix":e=>a(e,0,1),"Array | Matrix, number":(e,t)=>a(e,0,t),"Array | Matrix, number, number":(e,t,n)=>a(e,t,n)});function a(e,t,n){const r=Mh(e.valueOf(),(()=>s(t,n)));return A(e)?e.create(r,"number"):r}function s(e,t){return Math.floor(e+o()*(t-e))}function u(e,t){const n=t-e;if(n<=2n**30n)return e+BigInt(s(0,Number(n)));const i=r(n);let a=n;for(;a>=n;){a=0n;for(let e=0;e<i;++e)a=2n*a+(o()<.5?0n:1n)}return e+a}})),Dh="stirlingS2",Oh=de(Dh,["typed","addScalar","subtractScalar","multiplyScalar","divideScalar","pow","factorial","combinations","isNegative","isInteger","number","?bignumber","larger"],(e=>{let{typed:t,addScalar:n,subtractScalar:r,multiplyScalar:i,divideScalar:o,pow:a,factorial:s,combinations:u,isNegative:c,isInteger:l,number:f,bignumber:p,larger:m}=e;const d=[],g=[];return t(Dh,{"number | BigNumber, number | BigNumber":function(e,t){if(!l(e)||c(e)||!l(t)||c(t))throw new TypeError("Non-negative integer value expected in function stirlingS2");if(m(t,e))throw new TypeError("k must be less than or equal to n in function stirlingS2");const r=!(h(e)&&h(t)),o=r?g:d,a=r?p:f,s=f(e),u=f(t);if(o[s]&&o[s].length>u)return o[s][u];for(let e=0;e<=s;++e){if(o[e]||(o[e]=[a(0===e?1:0)]),0===e)continue;const t=o[e],r=o[e-1];for(let o=t.length;o<=e&&o<=u;++o)t[o]=o===e?1:n(i(a(o),r[o]),r[o-1])}return o[s][u]}})})),_h="bellNumbers",zh=de(_h,["typed","addScalar","isNegative","isInteger","stirlingS2"],(e=>{let{typed:t,addScalar:n,isNegative:r,isInteger:i,stirlingS2:o}=e;return t(_h,{"number | BigNumber":function(e){if(!i(e)||r(e))throw new TypeError("Non-negative integer value expected in function bellNumbers");let t=0;for(let r=0;r<=e;r++)t=n(t,o(e,r));return t}})})),qh="catalan",Ih=de(qh,["typed","addScalar","divideScalar","multiplyScalar","combinations","isNegative","isInteger"],(e=>{let{typed:t,addScalar:n,divideScalar:r,multiplyScalar:i,combinations:o,isNegative:a,isInteger:s}=e;return t(qh,{"number | BigNumber":function(e){if(!s(e)||a(e))throw new TypeError("Non-negative integer value expected in function catalan");return r(o(i(e,2),e),n(e,1))}})})),kh="composition",Rh=de(kh,["typed","addScalar","combinations","isNegative","isPositive","isInteger","larger"],(e=>{let{typed:t,addScalar:n,combinations:r,isPositive:i,isNegative:o,isInteger:a,larger:s}=e;return t(kh,{"number | BigNumber, number | BigNumber":function(e,t){if(!(a(e)&&i(e)&&a(t)&&i(t)))throw new TypeError("Positive integer value expected in function composition");if(s(t,e))throw new TypeError("k must be less than or equal to n in function composition");return r(n(e,-1),n(t,-1))}})})),Ph="leafCount",Uh=de(Ph,["parse","typed"],(e=>{let{parse:t,typed:n}=e;function r(e){let t=0;return e.forEach((e=>{t+=r(e)})),t||1}return n(Ph,{Node:function(e){return r(e)}})}));function jh(e){return Z(e)||K(e)&&e.isUnary()&&Z(e.args[0])}function Lh(e){return!!Z(e)||!(!Y(e)&&!K(e)||!e.args.every(Lh))||!(!ee(e)||!Lh(e.content))}const $h=de("simplifyUtil",["FunctionNode","OperatorNode","SymbolNode"],(e=>{let{FunctionNode:t,OperatorNode:n,SymbolNode:r}=e;const i=!0,o=!1,a="defaultF",s={add:{trivial:i,total:i,commutative:i,associative:i},unaryPlus:{trivial:i,total:i,commutative:i,associative:i},subtract:{trivial:o,total:i,commutative:o,associative:o},multiply:{trivial:i,total:i,commutative:i,associative:i},divide:{trivial:o,total:i,commutative:o,associative:o},paren:{trivial:i,total:i,commutative:i,associative:o},defaultF:{trivial:o,total:i,commutative:o,associative:o}};function u(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:s,r=a;if("string"==typeof e?r=e:K(e)?r=e.fn.toString():Y(e)?r=e.name:ee(e)&&(r="paren"),me(n,r)){const e=n[r];if(me(e,t))return e[t];if(me(s,r))return s[r][t]}if(me(n,a)){const e=n[a];return me(e,t)?e[t]:s[a][t]}if(me(s,r)){const e=s[r];if(me(e,t))return e[t]}return s[a][t]}function c(e){return u(e,"associative",arguments.length>1&&void 0!==arguments[1]?arguments[1]:s)}function l(e,t){let n;const r=[],i=function(e){for(let t=0;t<e.args.length;t++){const o=e.args[t];K(o)&&n===o.op?i(o):r.push(o)}};return c(e,t)?(n=e.op,i(e),r):e.args}function f(e){return K(e)?function(t){try{return new n(e.op,e.fn,t,e.implicit)}catch(e){return console.error(e),[]}}:function(n){return new t(new r(e.name),n)}}return{createMakeNodeFunction:f,hasProperty:u,isCommutative:function(e){return u(e,"commutative",arguments.length>1&&void 0!==arguments[1]?arguments[1]:s)},isAssociative:c,mergeContext:function(e,t){const n={...e};for(const r in t)me(e,r)?n[r]={...t[r],...e[r]}:n[r]=t[r];return n},flatten:function e(t,n){if(!t.args||0===t.args.length)return t;t.args=l(t,n);for(let r=0;r<t.args.length;r++)e(t.args[r],n)},allChildren:l,unflattenr:function e(t,n){if(!t.args||0===t.args.length)return;const r=f(t),i=t.args.length;for(let r=0;r<i;r++)e(t.args[r],n);if(i>2&&c(t,n)){let e=t.args.pop();for(;t.args.length>0;)e=r([t.args.pop(),e]);t.args=e.args}},unflattenl:function e(t,n){if(!t.args||0===t.args.length)return;const r=f(t),i=t.args.length;for(let r=0;r<i;r++)e(t.args[r],n);if(i>2&&c(t,n)){let e=t.args.shift();for(;t.args.length>0;)e=r([e,t.args.shift()]);t.args=e.args}},defaultContext:s,realContext:{divide:{total:o},log:{total:o}},positiveContext:{subtract:{total:o},abs:{trivial:i},log:{total:i}}}})),Hh=de("simplify",["typed","parse","equal","resolve","simplifyConstant","simplifyCore","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","SymbolNode","replacer"],(e=>{let{typed:t,parse:n,equal:r,resolve:i,simplifyConstant:o,simplifyCore:a,AccessorNode:s,ArrayNode:u,ConstantNode:c,FunctionNode:l,IndexNode:f,ObjectNode:p,OperatorNode:h,ParenthesisNode:g,SymbolNode:y,replacer:x}=e;const{hasProperty:b,isCommutative:w,isAssociative:v,mergeContext:N,flatten:A,unflattenr:E,unflattenl:S,createMakeNodeFunction:M,defaultContext:C,realContext:T,positiveContext:B}=$h({FunctionNode:l,OperatorNode:h,SymbolNode:y});t.addConversion({from:"Object",to:"Map",convert:d});const F=t("simplify",{Node:I,"Node, Map":(e,t)=>I(e,!1,t),"Node, Map, Object":(e,t,n)=>I(e,!1,t,n),"Node, Array":I,"Node, Array, Map":I,"Node, Array, Map, Object":I});function D(e){return e.transform((function(e){return ee(e)?D(e.content):e}))}t.removeConversion({from:"Object",to:"Map",convert:d}),F.defaultContext=C,F.realContext=T,F.positiveContext=B;const O={true:!0,false:!0,e:!0,i:!0,Infinity:!0,LN2:!0,LN10:!0,LOG2E:!0,LOG10E:!0,NaN:!0,phi:!0,pi:!0,SQRT1_2:!0,SQRT2:!0,tau:!0};function _(e,t){const r={};if(e.s){const t=e.s.split("->");if(2!==t.length)throw SyntaxError("Could not parse rule: "+e.s);r.l=t[0],r.r=t[1]}else r.l=e.l,r.r=e.r;r.l=D(n(r.l)),r.r=D(n(r.r));for(const t of["imposeContext","repeat","assuming"])t in e&&(r[t]=e[t]);if(e.evaluate&&(r.evaluate=n(e.evaluate)),v(r.l,t)){const e=!w(r.l,t);let n;e&&(n=q());const i=M(r.l),o=q();r.expanded={},r.expanded.l=i([r.l,o]),A(r.expanded.l,t),E(r.expanded.l,t),r.expanded.r=i([r.r,o]),e&&(r.expandedNC1={},r.expandedNC1.l=i([n,r.l]),r.expandedNC1.r=i([n,r.r]),r.expandedNC2={},r.expandedNC2.l=i([n,r.expanded.l]),r.expandedNC2.r=i([n,r.expanded.r]))}return r}F.rules=[a,{l:"log(e)",r:"1"},{s:"n-n1 -> n+-n1",assuming:{subtract:{total:!0}}},{s:"n-n -> 0",assuming:{subtract:{total:!1}}},{s:"-(cl*v) -> v * (-cl)",assuming:{multiply:{commutative:!0},subtract:{total:!0}}},{s:"-(cl*v) -> (-cl) * v",assuming:{multiply:{commutative:!1},subtract:{total:!0}}},{s:"-(v*cl) -> v * (-cl)",assuming:{multiply:{commutative:!1},subtract:{total:!0}}},{l:"-(n1/n2)",r:"-n1/n2"},{l:"-v",r:"v * (-1)"},{l:"(n1 + n2)*(-1)",r:"n1*(-1) + n2*(-1)",repeat:!0},{l:"n/n1^n2",r:"n*n1^-n2"},{l:"n/n1",r:"n*n1^-1"},{s:"(n1*n2)^n3 -> n1^n3 * n2^n3",assuming:{multiply:{commutative:!0}}},{s:"(n1*n2)^(-1) -> n2^(-1) * n1^(-1)",assuming:{multiply:{commutative:!1}}},{s:"(n ^ n1) ^ n2 -> n ^ (n1 * n2)",assuming:{divide:{total:!0}}},{l:" vd   * ( vd   * n1 + n2)",r:"vd^2       * n1 +  vd   * n2"},{s:" vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2",assuming:{divide:{total:!0}}},{s:"vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2",assuming:{divide:{total:!0}}},{s:"vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2",assuming:{divide:{total:!0}}},{l:"n*n",r:"n^2"},{s:"n * n^n1 -> n^(n1+1)",assuming:{divide:{total:!0}}},{s:"n^n1 * n^n2 -> n^(n1+n2)",assuming:{divide:{total:!0}}},o,{s:"n+n -> 2*n",assuming:{add:{total:!0}}},{l:"n+-n",r:"0"},{l:"vd*n + vd",r:"vd*(n+1)"},{l:"n3*n1 + n3*n2",r:"n3*(n1+n2)"},{l:"n3^(-n4)*n1 +   n3  * n2",r:"n3^(-n4)*(n1 + n3^(n4+1) *n2)"},{l:"n3^(-n4)*n1 + n3^n5 * n2",r:"n3^(-n4)*(n1 + n3^(n4+n5)*n2)"},{s:"n*vd + vd -> (n+1)*vd",assuming:{multiply:{commutative:!1}}},{s:"vd + n*vd -> (1+n)*vd",assuming:{multiply:{commutative:!1}}},{s:"n1*n3 + n2*n3 -> (n1+n2)*n3",assuming:{multiply:{commutative:!1}}},{s:"n^n1 * n -> n^(n1+1)",assuming:{divide:{total:!0},multiply:{commutative:!1}}},{s:"n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)",assuming:{multiply:{commutative:!1}}},{s:"n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)",assuming:{multiply:{commutative:!1}}},{l:"n*cd + cd",r:"(n+1)*cd"},{s:"cd*n + cd -> cd*(n+1)",assuming:{multiply:{commutative:!1}}},{s:"cd + cd*n -> cd*(1+n)",assuming:{multiply:{commutative:!1}}},o,{s:"(-n)*n1 -> -(n*n1)",assuming:{subtract:{total:!0}}},{s:"n1*(-n) -> -(n1*n)",assuming:{subtract:{total:!0},multiply:{commutative:!1}}},{s:"ce+ve -> ve+ce",assuming:{add:{commutative:!0}},imposeContext:{add:{commutative:!1}}},{s:"vd*cd -> cd*vd",assuming:{multiply:{commutative:!0}},imposeContext:{multiply:{commutative:!1}}},{l:"n+-n1",r:"n-n1"},{l:"n+-(n1)",r:"n-(n1)"},{s:"n*(n1^-1) -> n/n1",assuming:{multiply:{commutative:!0}}},{s:"n*n1^-n2 -> n/n1^n2",assuming:{multiply:{commutative:!0}}},{s:"n^-1 -> 1/n",assuming:{multiply:{commutative:!0}}},{l:"n^1",r:"n"},{s:"n*(n1/n2) -> (n*n1)/n2",assuming:{multiply:{associative:!0}}},{s:"n-(n1+n2) -> n-n1-n2",assuming:{addition:{associative:!0,commutative:!0}}},{l:"1*n",r:"n",imposeContext:{multiply:{commutative:!0}}},{s:"n1/(n2/n3) -> (n1*n3)/n2",assuming:{multiply:{associative:!0}}},{l:"n1/(-n2)",r:"-n1/n2"}];let z=0;function q(){return new y("_p"+z++)}function I(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:m(),r=arguments.length>3&&void 0!==arguments[3]?arguments[3]:{};const o=r.consoleDebug;t=function(e,t){const n=[];for(let r=0;r<e.length;r++){let i,o=e[r];const a=typeof o;switch(a){case"string":o={s:o};case"object":i=_(o,t);break;case"function":i=o;break;default:throw TypeError("Unsupported type of rule: "+a)}n.push(i)}return n}(t||F.rules,r.context);let a=i(e,n);a=D(a);const s={};let u=a.toString({parenthesis:"all"});for(;!s[u];){s[u]=!0,z=0;let e=u;o&&console.log("Working on: ",u);for(let n=0;n<t.length;n++){let i="";if("function"==typeof t[n]?(a=t[n](a,r),o&&(i=t[n].name)):(A(a,r.context),a=R(a,t[n],r.context),o&&(i=`${t[n].l.toString()} -> ${t[n].r.toString()}`)),o){const t=a.toString({parenthesis:"all"});t!==e&&(console.log("Applying",i,"produced",t),e=t)}S(a,r.context)}u=a.toString({parenthesis:"all"})}return a}function k(e,t,n){let r=e;if(e)for(let i=0;i<e.length;++i){const o=R(e[i],t,n);o!==e[i]&&(r===e&&(r=e.slice()),r[i]=o)}return r}function R(e,t,n){if(t.assuming)for(const r in t.assuming)for(const i in t.assuming[r])if(b(r,i,n)!==t.assuming[r][i])return e;const r=N(t.imposeContext,n);let i=e;if(i instanceof h||i instanceof l){const e=k(i.args,t,n);e!==i.args&&(i=i.clone(),i.args=e)}else if(i instanceof g){if(i.content){const e=R(i.content,t,n);e!==i.content&&(i=new g(e))}}else if(i instanceof u){const e=k(i.items,t,n);e!==i.items&&(i=new u(e))}else if(i instanceof s){let e=i.object;i.object&&(e=R(i.object,t,n));let r=i.index;i.index&&(r=R(i.index,t,n)),e===i.object&&r===i.index||(i=new s(e,r))}else if(i instanceof f){const e=k(i.dimensions,t,n);e!==i.dimensions&&(i=new f(e))}else if(i instanceof p){let e=!1;const r={};for(const o in i.properties)r[o]=R(i.properties[o],t,n),r[o]!==i.properties[o]&&(e=!0);e&&(i=new p(r))}let o=t.r,a=j(t.l,i,r)[0];if(!a&&t.expanded&&(o=t.expanded.r,a=j(t.expanded.l,i,r)[0]),!a&&t.expandedNC1&&(o=t.expandedNC1.r,a=j(t.expandedNC1.l,i,r)[0],a||(o=t.expandedNC2.r,a=j(t.expandedNC2.l,i,r)[0])),a){const e=i.implicit;i=o.clone(),e&&"implicit"in o&&(i.implicit=!0),i=i.transform((function(e){return e.isSymbolNode&&me(a.placeholders,e.name)?a.placeholders[e.name].clone():e}))}return t.repeat&&i!==e&&(i=R(i,t,n)),i}function P(e,t){const n={placeholders:{}};if(!e.placeholders&&!t.placeholders)return n;if(!e.placeholders)return t;if(!t.placeholders)return e;for(const r in e.placeholders)if(me(e.placeholders,r)&&(n.placeholders[r]=e.placeholders[r],me(t.placeholders,r)&&!L(e.placeholders[r],t.placeholders[r])))return null;for(const e in t.placeholders)me(t.placeholders,e)&&(n.placeholders[e]=t.placeholders[e]);return n}function U(e,t){const n=[];if(0===e.length||0===t.length)return n;let r;for(let i=0;i<e.length;i++)for(let o=0;o<t.length;o++)r=P(e[i],t[o]),r&&n.push(r);return n}function j(e,t,n,i){let o=[{placeholders:{}}];if(e instanceof h&&t instanceof h||e instanceof l&&t instanceof l){if(e instanceof h){if(e.op!==t.op||e.fn!==t.fn)return[]}else if(e instanceof l&&e.name!==t.name)return[];if(!(1===t.args.length&&1===e.args.length||!v(t,n)&&t.args.length===e.args.length||i)){if(t.args.length>=2&&2===e.args.length){const r=function(e,t){const n=[];let r,i;const o=M(e);if(w(e,t))for(let t=0;t<e.args.length;t++)i=e.args.slice(0),i.splice(t,1),r=1===i.length?i[0]:o(i),n.push(o([e.args[t],r]));else for(let t=1;t<e.args.length;t++){let a=e.args[0];t>1&&(a=o(e.args.slice(0,t))),i=e.args.slice(t),r=1===i.length?i[0]:o(i),n.push(o([a,r]))}return n}(t,n);let i=[];for(let t=0;t<r.length;t++){const o=j(e,r[t],n,!0);i=i.concat(o)}return i}if(e.args.length>2)throw Error("Unexpected non-binary associative function: "+e.toString());return[]}{let r=[];for(let i=0;i<e.args.length;i++){const o=j(e.args[i],t.args[i],n);if(0===o.length)break;r.push(o)}if(r.length!==e.args.length){if(!w(t,n)||1===e.args.length)return[];if(e.args.length>2)throw new Error("permuting >2 commutative non-associative rule arguments not yet implemented");const i=j(e.args[0],t.args[1],n);if(0===i.length)return[];const o=j(e.args[1],t.args[0],n);if(0===o.length)return[];r=[i,o]}o=function(e){if(0===e.length)return e;const t=e.reduce(U),n=[],r={};for(let e=0;e<t.length;e++){const i=JSON.stringify(t[e],x);r[i]||(r[i]=!0,n.push(t[e]))}return n}(r)}}else if(e instanceof y){if(0===e.name.length)throw new Error("Symbol in rule has 0 length...!?");if(O[e.name]){if(e.name!==t.name)return[]}else switch(e.name[1]>="a"&&e.name[1]<="z"?e.name.substring(0,2):e.name[0]){case"n":case"_p":o[0].placeholders[e.name]=t;break;case"c":case"cl":if(!Z(t))return[];o[0].placeholders[e.name]=t;break;case"v":if(Z(t))return[];o[0].placeholders[e.name]=t;break;case"vl":if(!re(t))return[];o[0].placeholders[e.name]=t;break;case"cd":if(!jh(t))return[];o[0].placeholders[e.name]=t;break;case"vd":if(jh(t))return[];o[0].placeholders[e.name]=t;break;case"ce":if(!Lh(t))return[];o[0].placeholders[e.name]=t;break;case"ve":if(Lh(t))return[];o[0].placeholders[e.name]=t;break;default:throw new Error("Invalid symbol in rule: "+e.name)}}else{if(!(e instanceof c))return[];if(!r(e.value,t.value))return[]}return o}function L(e,t){if(e instanceof c&&t instanceof c){if(!r(e.value,t.value))return!1}else if(e instanceof y&&t instanceof y){if(e.name!==t.name)return!1}else{if(!(e instanceof h&&t instanceof h||e instanceof l&&t instanceof l))return!1;if(e instanceof h){if(e.op!==t.op||e.fn!==t.fn)return!1}else if(e instanceof l&&e.name!==t.name)return!1;if(e.args.length!==t.args.length)return!1;for(let n=0;n<e.args.length;n++)if(!L(e.args[n],t.args[n]))return!1}return!0}return F})),Gh=de("simplifyConstant",["typed","config","mathWithTransform","matrix","?fraction","?bignumber","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","SymbolNode"],(e=>{let{typed:t,config:n,mathWithTransform:r,matrix:i,fraction:o,bignumber:a,AccessorNode:s,ArrayNode:u,ConstantNode:c,FunctionNode:l,IndexNode:f,ObjectNode:p,OperatorNode:m,SymbolNode:d}=e;const{isCommutative:h,isAssociative:g,allChildren:y,createMakeNodeFunction:x}=$h({FunctionNode:l,OperatorNode:m,SymbolNode:d}),w=t("simplifyConstant",{Node:e=>S(F(e,{})),"Node, Object":function(e,t){return S(F(e,t))}});function v(e){return b(e)?e.valueOf():e instanceof Array?e.map(v):A(e)?i(v(e.valueOf())):e}function N(e,t,n){try{return r[e].apply(null,t)}catch(i){return t=t.map(v),C(r[e].apply(null,t),n)}}const E=t({Fraction:function(e){const t=e=>"BigNumber"===n.number&&a?a(e):Number(e),r=e.s*e.n,i=r<0n?new m("-","unaryMinus",[new c(-t(r))]):new c(t(r));return 1n===e.d?i:new m("/","divide",[i,new c(t(e.d))])},number:function(e){return e<0?T(new c(-e)):new c(e)},BigNumber:function(e){return e<0?T(new c(-e)):new c(e)},bigint:function(e){return e<0n?T(new c(-e)):new c(e)},Complex:function(e){throw new Error("Cannot convert Complex number to Node")},string:function(e){return new c(e)},Matrix:function(e){return new u(e.valueOf().map((e=>E(e))))}});function S(e){return X(e)?e:E(e)}function M(e,t){if(t&&!1!==t.exactFractions&&isFinite(e)&&o){const n=o(e),r=t&&"number"==typeof t.fractionsLimit?t.fractionsLimit:1/0;if(n.valueOf()===e&&n.n<r&&n.d<r)return n}return e}const C=t({"string, Object":function(e,t){const r=xe(e,n);return"BigNumber"===r?(void 0===a&&cu(),a(e)):"bigint"===r?BigInt(e):"Fraction"===r?(void 0===o&&lu(),o(e)):M(parseFloat(e),t)},"Fraction, Object":function(e,t){return e},"BigNumber, Object":function(e,t){return e},"number, Object":function(e,t){return M(e,t)},"bigint, Object":function(e,t){return e},"Complex, Object":function(e,t){return 0!==e.im?e:M(e.re,t)},"Matrix, Object":function(e,t){return i(M(e.valueOf()))},"Array, Object":function(e,t){return e.map(M)}});function T(e){return new m("-","unaryMinus",[e])}function B(e,t,n,r){const i=t.shift(),o=t.reduce(((t,i)=>{if(!X(i)){const n=t.pop();if(X(n))return[n,i];try{return t.push(N(e,[n,i],r)),t}catch(e){t.push(n)}}t.push(S(t.pop()));const o=1===t.length?t[0]:n(t);return[n([o,S(i)])]}),[i]);return 1===o.length?o[0]:n([o[0],E(o[1])])}function F(e,t){switch(e.type){case"SymbolNode":return e;case"ConstantNode":switch(typeof e.value){case"number":case"bigint":return C(e.value,t);case"string":return e.value;default:if(!isNaN(e.value))return C(e.value,t)}return e;case"FunctionNode":if(r[e.name]&&r[e.name].rawArgs)return e;if(!["add","multiply"].includes(e.name)){const n=e.args.map((e=>F(e,t)));if(!n.some(X))try{return N(e.name,n,t)}catch(e){}if("size"===e.name&&1===n.length&&L(n[0])){const e=[];let t=n[0];for(;L(t);)e.push(t.items.length),t=t.items[0];return i(e)}return new l(e.name,n.map(S))}case"OperatorNode":{const n=e.fn.toString();let r,i;const o=x(e);if(K(e)&&e.isUnary())r=[F(e.args[0],t)],i=X(r[0])?o(r):N(n,r,t);else if(g(e,t.context))if(r=y(e,t.context),r=r.map((e=>F(e,t))),h(n,t.context)){const e=[],a=[];for(let t=0;t<r.length;t++)X(r[t])?a.push(r[t]):e.push(r[t]);e.length>1?(i=B(n,e,o,t),a.unshift(i),i=B(n,a,o,t)):i=B(n,r,o,t)}else i=B(n,r,o,t);else r=e.args.map((e=>F(e,t))),i=B(n,r,o,t);return i}case"ParenthesisNode":return F(e.content,t);case"AccessorNode":return function(e,t,n){if(!J(t))return new s(S(e),S(t));if(L(e)||A(e)){const r=Array.from(t.dimensions);for(;r.length>0;)if(Z(r[0])&&"string"!=typeof r[0].value){const t=C(r.shift().value,n);L(e)?e=e.items[t-1]:(e=e.valueOf()[t-1])instanceof Array&&(e=i(e))}else{if(!(r.length>1&&Z(r[1])&&"string"!=typeof r[1].value))break;{const t=C(r[1].value,n),o=[],a=L(e)?e.items:e.valueOf();for(const n of a)if(L(n))o.push(n.items[t-1]);else{if(!A(e))break;o.push(n[t-1])}if(o.length!==a.length)break;e=L(e)?new u(o):i(o),r.splice(1,1)}}return r.length===t.dimensions.length?new s(S(e),t):r.length>0?(t=new f(r),new s(S(e),t)):e}if(Q(e)&&1===t.dimensions.length&&Z(t.dimensions[0])){const n=t.dimensions[0].value;return n in e.properties?e.properties[n]:new c}return new s(S(e),t)}(F(e.object,t),F(e.index,t),t);case"ArrayNode":{const n=e.items.map((e=>F(e,t)));return n.some(X)?new u(n.map(S)):i(n)}case"IndexNode":return new f(e.dimensions.map((e=>w(e,t))));case"ObjectNode":{const n={};for(const r in e.properties)n[r]=w(e.properties[r],t);return new p(n)}default:throw new Error(`Unimplemented node type in simplifyConstant: ${e.type}`)}}return w})),Zh="simplifyCore",Vh=de(Zh,["typed","parse","equal","isZero","add","subtract","multiply","divide","pow","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","ParenthesisNode","SymbolNode"],(e=>{let{typed:t,parse:n,equal:r,isZero:i,add:o,subtract:a,multiply:s,divide:u,pow:c,AccessorNode:l,ArrayNode:f,ConstantNode:p,FunctionNode:m,IndexNode:d,ObjectNode:h,OperatorNode:g,ParenthesisNode:y,SymbolNode:x}=e;const b=new p(0),w=new p(1),v=new p(!0),N=new p(!1);function A(e){return K(e)&&["and","not","or"].includes(e.op)}const{hasProperty:E,isCommutative:S}=$h({FunctionNode:m,OperatorNode:g,SymbolNode:x});function M(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};const n=t?t.context:void 0;if(E(e,"trivial",n)){if(Y(e)&&1===e.args.length)return M(e.args[0],t);let n=!1,r=0;if(e.forEach((e=>{++r,1===r&&(n=M(e,t))})),1===r)return n}let o=e;if(Y(o)){const e=function(e){const t="OperatorNode:"+e;for(const e of Hp)if(t in e)return e[t].op;return null}(o.name);if(!e)return new m(M(o.fn),o.args.map((e=>M(e,t))));if(o.args.length>2&&E(o,"associative",n))for(;o.args.length>2;){const t=o.args.pop(),n=o.args.pop();o.args.push(new g(e,o.name,[t,n]))}o=new g(e,o.name,o.args)}if(K(o)&&o.isUnary()){const e=M(o.args[0],t);if("~"===o.op&&K(e)&&e.isUnary()&&"~"===e.op)return e.args[0];if("not"===o.op&&K(e)&&e.isUnary()&&"not"===e.op&&A(e.args[0]))return e.args[0];let n=!0;if("-"===o.op&&K(e)&&(e.isBinary()&&"subtract"===e.fn&&(o=new g("-","subtract",[e.args[1],e.args[0]]),n=!1),e.isUnary()&&"-"===e.op))return e.args[0];if(n)return new g(o.op,o.fn,[e])}if(K(o)&&o.isBinary()){const e=M(o.args[0],t);let a=M(o.args[1],t);if("+"===o.op){if(Z(e)&&i(e.value))return a;if(Z(a)&&i(a.value))return e;K(a)&&a.isUnary()&&"-"===a.op&&(a=a.args[0],o=new g("-","subtract",[e,a]))}if("-"===o.op)return K(a)&&a.isUnary()&&"-"===a.op?M(new g("+","add",[e,a.args[0]]),t):Z(e)&&i(e.value)?M(new g("-","unaryMinus",[a])):Z(a)&&i(a.value)?e:new g(o.op,o.fn,[e,a]);if("*"===o.op){if(Z(e)){if(i(e.value))return b;if(r(e.value,1))return a}if(Z(a)){if(i(a.value))return b;if(r(a.value,1))return e;if(S(o,n))return new g(o.op,o.fn,[a,e],o.implicit)}return new g(o.op,o.fn,[e,a],o.implicit)}if("/"===o.op)return Z(e)&&i(e.value)?b:Z(a)&&r(a.value,1)?e:new g(o.op,o.fn,[e,a]);if("^"===o.op&&Z(a)){if(i(a.value))return w;if(r(a.value,1))return e}if("and"===o.op){if(Z(e)){if(!e.value)return N;if(A(a))return a;if(Z(a))return a.value?v:N}if(Z(a)){if(!a.value)return N;if(A(e))return e}}if("or"===o.op){if(Z(e)){if(e.value)return v;if(A(a))return a}if(Z(a)){if(a.value)return v;if(A(e))return e}}return new g(o.op,o.fn,[e,a])}if(K(o))return new g(o.op,o.fn,o.args.map((e=>M(e,t))));if(L(o))return new f(o.items.map((e=>M(e,t))));if(j(o))return new l(M(o.object,t),M(o.index,t));if(J(o))return new d(o.dimensions.map((e=>M(e,t))));if(Q(o)){const e={};for(const n in o.properties)e[n]=M(o.properties[n],t);return new h(e)}return o}return t(Zh,{Node:M,"Node,Object":M})})),Wh=de("resolve",["typed","parse","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode"],(e=>{let{typed:t,parse:n,ConstantNode:r,FunctionNode:i,OperatorNode:o,ParenthesisNode:a}=e;function s(e,t){let u=arguments.length>2&&void 0!==arguments[2]?arguments[2]:new Set;if(!t)return e;if(re(e)){if(u.has(e.name)){const e=Array.from(u).join(", ");throw new ReferenceError(`recursive loop of variable definitions among {${e}}`)}const i=t.get(e.name);if(X(i)){const n=new Set(u);return n.add(e.name),s(i,t,n)}return"number"==typeof i?n(String(i)):void 0!==i?new r(i):e}if(K(e)){const n=e.args.map((function(e){return s(e,t,u)}));return new o(e.op,e.fn,n,e.implicit)}if(ee(e))return new a(s(e.content,t,u));if(Y(e)){const n=e.args.map((function(e){return s(e,t,u)}));return new i(e.name,n)}return e.map((e=>s(e,t,u)))}return t("resolve",{Node:s,"Node, Map | null | undefined":s,"Node, Object":(e,t)=>s(e,d(t)),"Array | Matrix":t.referToSelf((e=>t=>t.map((t=>e(t))))),"Array | Matrix, null | undefined":t.referToSelf((e=>t=>t.map((t=>e(t))))),"Array, Object":t.referTo("Array,Map",(e=>(t,n)=>e(t,d(n)))),"Matrix, Object":t.referTo("Matrix,Map",(e=>(t,n)=>e(t,d(n)))),"Array | Matrix, Map":t.referToSelf((e=>(t,n)=>t.map((t=>e(t,n)))))})})),Yh="symbolicEqual",Jh=de(Yh,["parse","simplify","typed","OperatorNode"],(e=>{let{parse:t,simplify:n,typed:r,OperatorNode:i}=e;function o(e,t){let r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{};const o=new i("-","subtract",[e,t]),a=n(o,{},r);return Z(a)&&!a.value}return r(Yh,{"Node, Node":o,"Node, Node, Object":o})})),Xh="derivative",Qh=de(Xh,["typed","config","parse","simplify","equal","isZero","numeric","ConstantNode","FunctionNode","OperatorNode","ParenthesisNode","SymbolNode"],(e=>{let{typed:t,config:n,parse:r,simplify:i,equal:o,isZero:a,numeric:s,ConstantNode:u,FunctionNode:c,OperatorNode:l,ParenthesisNode:f,SymbolNode:p}=e;function m(e,t){let n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{simplify:!0};const r=new Map,o=t.name,a=x(e,(function e(t){const n=r.get(t);if(void 0!==n)return n;const i=y(e,t,o);return r.set(t,i),i}));return n.simplify?i(a):a}function d(e){const t=r(e);if(!t.isSymbolNode)throw new TypeError(`Invalid variable. Cannot parse ${JSON.stringify(e)} into a variable in function derivative`);return t}const h=t(Xh,{"Node, SymbolNode":m,"Node, SymbolNode, Object":m,"Node, string":(e,t)=>m(e,d(t)),"Node, string, Object":(e,t,n)=>m(e,d(t),n)});h._simplify=!0,h.toTex=function(e){return g.apply(null,e.args)};const g=t("_derivTex",{"Node, SymbolNode":function(e,t){return Z(e)&&"string"===oe(e.value)?g(r(e.value).toString(),t.toString(),1):g(e.toTex(),t.toString(),1)},"Node, ConstantNode":function(e,t){if("string"===oe(t.value))return g(e,r(t.value));throw new Error("The second parameter to 'derivative' is a non-string constant")},"Node, SymbolNode, ConstantNode":function(e,t,n){return g(e.toString(),t.name,n.value)},"string, string, number":function(e,t,n){let r;return r=1===n?"{d\\over d"+t+"}":"{d^{"+n+"}\\over d"+t+"^{"+n+"}}",r+`\\left[${e}\\right]`}}),y=t("_isConst",{"function, ConstantNode, string":function(){return!0},"function, SymbolNode, string":function(e,t,n){return t.name!==n},"function, ParenthesisNode, string":function(e,t,n){return e(t.content,n)},"function, FunctionAssignmentNode, string":function(e,t,n){return!t.params.includes(n)||e(t.expr,n)},"function, FunctionNode | OperatorNode, string":function(e,t,n){return t.args.every((t=>e(t,n)))}}),x=t("_derivative",{"ConstantNode, function":function(){return b(0)},"SymbolNode, function":function(e,t){return t(e)?b(0):b(1)},"ParenthesisNode, function":function(e,t){return new f(x(e.content,t))},"FunctionAssignmentNode, function":function(e,t){return t(e)?b(0):x(e.expr,t)},"FunctionNode, function":function(e,t){if(t(e))return b(0);const n=e.args[0];let r,i,o,a,s=!1,u=!1;switch(e.name){case"cbrt":s=!0,i=new l("*","multiply",[b(3),new l("^","pow",[n,new l("/","divide",[b(2),b(3)])])]);break;case"sqrt":case"nthRoot":if(1===e.args.length)s=!0,i=new l("*","multiply",[b(2),new c("sqrt",[n])]);else if(2===e.args.length)return r=new l("/","divide",[b(1),e.args[1]]),x(new l("^","pow",[n,r]),t);break;case"log10":r=b(10);case"log":if(r||1!==e.args.length){if(1===e.args.length&&r||2===e.args.length&&t(e.args[1]))i=new l("*","multiply",[n.clone(),new c("log",[r||e.args[1]])]),s=!0;else if(2===e.args.length)return x(new l("/","divide",[new c("log",[n]),new c("log",[e.args[1]])]),t)}else i=n.clone(),s=!0;break;case"pow":if(2===e.args.length)return x(new l("^","pow",[n,e.args[1]]),t);break;case"exp":i=new c("exp",[n.clone()]);break;case"sin":i=new c("cos",[n.clone()]);break;case"cos":i=new l("-","unaryMinus",[new c("sin",[n.clone()])]);break;case"tan":i=new l("^","pow",[new c("sec",[n.clone()]),b(2)]);break;case"sec":i=new l("*","multiply",[e,new c("tan",[n.clone()])]);break;case"csc":u=!0,i=new l("*","multiply",[e,new c("cot",[n.clone()])]);break;case"cot":u=!0,i=new l("^","pow",[new c("csc",[n.clone()]),b(2)]);break;case"asin":s=!0,i=new c("sqrt",[new l("-","subtract",[b(1),new l("^","pow",[n.clone(),b(2)])])]);break;case"acos":s=!0,u=!0,i=new c("sqrt",[new l("-","subtract",[b(1),new l("^","pow",[n.clone(),b(2)])])]);break;case"atan":s=!0,i=new l("+","add",[new l("^","pow",[n.clone(),b(2)]),b(1)]);break;case"asec":s=!0,i=new l("*","multiply",[new c("abs",[n.clone()]),new c("sqrt",[new l("-","subtract",[new l("^","pow",[n.clone(),b(2)]),b(1)])])]);break;case"acsc":s=!0,u=!0,i=new l("*","multiply",[new c("abs",[n.clone()]),new c("sqrt",[new l("-","subtract",[new l("^","pow",[n.clone(),b(2)]),b(1)])])]);break;case"acot":s=!0,u=!0,i=new l("+","add",[new l("^","pow",[n.clone(),b(2)]),b(1)]);break;case"sinh":i=new c("cosh",[n.clone()]);break;case"cosh":i=new c("sinh",[n.clone()]);break;case"tanh":i=new l("^","pow",[new c("sech",[n.clone()]),b(2)]);break;case"sech":u=!0,i=new l("*","multiply",[e,new c("tanh",[n.clone()])]);break;case"csch":u=!0,i=new l("*","multiply",[e,new c("coth",[n.clone()])]);break;case"coth":u=!0,i=new l("^","pow",[new c("csch",[n.clone()]),b(2)]);break;case"asinh":s=!0,i=new c("sqrt",[new l("+","add",[new l("^","pow",[n.clone(),b(2)]),b(1)])]);break;case"acosh":s=!0,i=new c("sqrt",[new l("-","subtract",[new l("^","pow",[n.clone(),b(2)]),b(1)])]);break;case"atanh":s=!0,i=new l("-","subtract",[b(1),new l("^","pow",[n.clone(),b(2)])]);break;case"asech":s=!0,u=!0,i=new l("*","multiply",[n.clone(),new c("sqrt",[new l("-","subtract",[b(1),new l("^","pow",[n.clone(),b(2)])])])]);break;case"acsch":s=!0,u=!0,i=new l("*","multiply",[new c("abs",[n.clone()]),new c("sqrt",[new l("+","add",[new l("^","pow",[n.clone(),b(2)]),b(1)])])]);break;case"acoth":s=!0,u=!0,i=new l("-","subtract",[b(1),new l("^","pow",[n.clone(),b(2)])]);break;case"abs":i=new l("/","divide",[new c(new p("abs"),[n.clone()]),n.clone()]);break;default:throw new Error('Cannot process function "'+e.name+'" in derivative: the function is not supported, undefined, or the number of arguments passed to it are not supported')}s?(o="/",a="divide"):(o="*",a="multiply");let f=x(n,t);return u&&(f=new l("-","unaryMinus",[f])),new l(o,a,[f,i])},"OperatorNode, function":function(e,t){if(t(e))return b(0);if("+"===e.op)return new l(e.op,e.fn,e.args.map((function(e){return x(e,t)})));if("-"===e.op){if(e.isUnary())return new l(e.op,e.fn,[x(e.args[0],t)]);if(e.isBinary())return new l(e.op,e.fn,[x(e.args[0],t),x(e.args[1],t)])}if("*"===e.op){const n=e.args.filter((function(e){return t(e)}));if(n.length>0){const r=e.args.filter((function(e){return!t(e)})),i=1===r.length?r[0]:new l("*","multiply",r),o=n.concat(x(i,t));return new l("*","multiply",o)}return new l("+","add",e.args.map((function(n){return new l("*","multiply",e.args.map((function(e){return e===n?x(e,t):e.clone()})))})))}if("/"===e.op&&e.isBinary()){const n=e.args[0],r=e.args[1];return t(r)?new l("/","divide",[x(n,t),r]):t(n)?new l("*","multiply",[new l("-","unaryMinus",[n]),new l("/","divide",[x(r,t),new l("^","pow",[r.clone(),b(2)])])]):new l("/","divide",[new l("-","subtract",[new l("*","multiply",[x(n,t),r.clone()]),new l("*","multiply",[n.clone(),x(r,t)])]),new l("^","pow",[r.clone(),b(2)])])}if("^"===e.op&&e.isBinary()){const n=e.args[0],r=e.args[1];if(t(n))return Z(n)&&(a(n.value)||o(n.value,1))?b(0):new l("*","multiply",[e,new l("*","multiply",[new c("log",[n.clone()]),x(r.clone(),t)])]);if(t(r)){if(Z(r)){if(a(r.value))return b(0);if(o(r.value,1))return x(n,t)}const e=new l("^","pow",[n.clone(),new l("-","subtract",[r,b(1)])]);return new l("*","multiply",[r.clone(),new l("*","multiply",[x(n,t),e])])}return new l("*","multiply",[new l("^","pow",[n.clone(),r.clone()]),new l("+","add",[new l("*","multiply",[x(n,t),new l("/","divide",[r.clone(),n.clone()])]),new l("*","multiply",[x(r,t),new c("log",[n.clone()])])])])}throw new Error('Cannot process operator "'+e.op+'" in derivative: the operator is not supported, undefined, or the number of arguments passed to it are not supported')}});function b(e,t){return new u(s(e,t||xe(String(e),n)))}return h})),Kh="rationalize",eg=de(Kh,["config","typed","equal","isZero","add","subtract","multiply","divide","pow","parse","simplifyConstant","simplifyCore","simplify","?bignumber","?fraction","mathWithTransform","matrix","AccessorNode","ArrayNode","ConstantNode","FunctionNode","IndexNode","ObjectNode","OperatorNode","SymbolNode","ParenthesisNode"],(e=>{let{config:t,typed:n,equal:r,isZero:i,add:o,subtract:a,multiply:s,divide:u,pow:c,parse:l,simplifyConstant:f,simplifyCore:p,simplify:m,fraction:d,bignumber:h,mathWithTransform:g,matrix:y,AccessorNode:x,ArrayNode:b,ConstantNode:w,FunctionNode:v,IndexNode:N,ObjectNode:A,OperatorNode:E,SymbolNode:S,ParenthesisNode:M}=e;function C(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},n=arguments.length>2&&void 0!==arguments[2]&&arguments[2];const r=function(){const e=[p,{l:"n+n",r:"2*n"},{l:"n+-n",r:"0"},f,{l:"n*(n1^-1)",r:"n/n1"},{l:"n*n1^-n2",r:"n/n1^n2"},{l:"n1^-1",r:"1/n1"},{l:"n*(n1/n2)",r:"(n*n1)/n2"},{l:"1*n",r:"n"}],t=[{l:"(-n1)/(-n2)",r:"n1/n2"},{l:"(-n1)*(-n2)",r:"n1*n2"},{l:"n1--n2",r:"n1+n2"},{l:"n1-n2",r:"n1+(-n2)"},{l:"(n1+n2)*n3",r:"(n1*n3 + n2*n3)"},{l:"n1*(n2+n3)",r:"(n1*n2+n1*n3)"},{l:"c1*n + c2*n",r:"(c1+c2)*n"},{l:"c1*n + n",r:"(c1+1)*n"},{l:"c1*n - c2*n",r:"(c1-c2)*n"},{l:"c1*n - n",r:"(c1-1)*n"},{l:"v/c",r:"(1/c)*v"},{l:"v/-c",r:"-(1/c)*v"},{l:"-v*-c",r:"c*v"},{l:"-v*c",r:"-c*v"},{l:"v*-c",r:"-c*v"},{l:"v*c",r:"c*v"},{l:"-(-n1*n2)",r:"(n1*n2)"},{l:"-(n1*n2)",r:"(-n1*n2)"},{l:"-(-n1+n2)",r:"(n1-n2)"},{l:"-(n1+n2)",r:"(-n1-n2)"},{l:"(n1^n2)^n3",r:"(n1^(n2*n3))"},{l:"-(-n1/n2)",r:"(n1/n2)"},{l:"-(n1/n2)",r:"(-n1/n2)"}],n=[{l:"(n1/(n2/n3))",r:"((n1*n3)/n2)"},{l:"(n1/n2/n3)",r:"(n1/(n2*n3))"}],r={};return r.firstRules=e.concat(t,n),r.distrDivRules=[{l:"(n1/n2 + n3/n4)",r:"((n1*n4 + n3*n2)/(n2*n4))"},{l:"(n1/n2 + n3)",r:"((n1 + n3*n2)/n2)"},{l:"(n1 + n2/n3)",r:"((n1*n3 + n2)/n3)"}],r.sucDivRules=n,r.firstRulesAgain=e.concat(t),r.finalRules=[p,{l:"n*-n",r:"-n^2"},{l:"n*n",r:"n^2"},f,{l:"n*-n^n1",r:"-n^(n1+1)"},{l:"n*n^n1",r:"n^(n1+1)"},{l:"n^n1*-n^n2",r:"-n^(n1+n2)"},{l:"n^n1*n^n2",r:"n^(n1+n2)"},{l:"n^n1*-n",r:"-n^(n1+1)"},{l:"n^n1*n",r:"n^(n1+1)"},{l:"n^n1/-n",r:"-n^(n1-1)"},{l:"n^n1/n",r:"n^(n1-1)"},{l:"n/-n^n1",r:"-n^(1-n1)"},{l:"n/n^n1",r:"n^(1-n1)"},{l:"n^n1/-n^n2",r:"n^(n1-n2)"},{l:"n^n1/n^n2",r:"n^(n1-n2)"},{l:"n1+(-n2*n3)",r:"n1-n2*n3"},{l:"v*(-c)",r:"-c*v"},{l:"n1+-n2",r:"n1-n2"},{l:"v*c",r:"c*v"},{l:"(n1^n2)^n3",r:"(n1^(n2*n3))"}],r}(),i=function(e,t,n,r){const i=[],o=m(e,r,t,{exactFractions:!1}),a="+-*"+((n=!!n)?"/":"");!function e(t){const n=t.type;if("FunctionNode"===n)throw new Error("There is an unsolved function call");if("OperatorNode"===n)if("^"===t.op){if("ConstantNode"!==t.args[1].type||!ye(parseFloat(t.args[1].value)))throw new Error("There is a non-integer exponent");e(t.args[0])}else{if(!a.includes(t.op))throw new Error("Operator "+t.op+" invalid in polynomial expression");for(let n=0;n<t.args.length;n++)e(t.args[n])}else if("SymbolNode"===n){const e=t.name;-1===i.indexOf(e)&&i.push(e)}else if("ParenthesisNode"===n)e(t.content);else if("ConstantNode"!==n)throw new Error("type "+n+" is not allowed in polynomial expression")}(o);const s={};return s.expression=o,s.variables=i,s}(e,t,!0,r.firstRules),o=i.variables.length,a={exactFractions:!1},s={exactFractions:!0};if(e=i.expression,o>=1){let t,n;e=T(e);let i,o=!0,u=!1;for(e=m(e,r.firstRules,{},a);n=o?r.distrDivRules:r.sucDivRules,o=!o,i=(e=m(e,n,{},s)).toString(),i!==t;)u=!0,t=i;u&&(e=m(e,r.firstRulesAgain,{},a)),e=m(e,r.finalRules,{},a)}const u=[],c={};return"OperatorNode"===e.type&&e.isBinary()&&"/"===e.op?(1===o&&(e.args[0]=B(e.args[0],u),e.args[1]=B(e.args[1])),n&&(c.numerator=e.args[0],c.denominator=e.args[1])):(1===o&&(e=B(e,u)),n&&(c.numerator=e,c.denominator=null)),n?(c.coefficients=u,c.variables=i.variables,c.expression=e,c):e}return n(Kh,{Node:C,"Node, boolean":(e,t)=>C(e,{},t),"Node, Object":C,"Node, Object, boolean":C});function T(e,t,n){const r=e.type,i=arguments.length>1;if("OperatorNode"===r&&e.isBinary()){let r,o=!1;if("^"===e.op&&("ParenthesisNode"!==e.args[0].type&&"OperatorNode"!==e.args[0].type||"ConstantNode"!==e.args[1].type||(r=parseFloat(e.args[1].value),o=r>=2&&ye(r))),o){if(r>2){const t=e.args[0],n=new E("^","pow",[e.args[0].cloneDeep(),new w(r-1)]);e=new E("*","multiply",[t,n])}else e=new E("*","multiply",[e.args[0],e.args[0].cloneDeep()]);i&&("content"===n?t.content=e:t.args[n]=e)}}if("ParenthesisNode"===r)T(e.content,e,"content");else if("ConstantNode"!==r&&"SymbolNode"!==r)for(let t=0;t<e.args.length;t++)T(e.args[t],e,t);if(!i)return e}function B(e,t){void 0===t&&(t=[]),t[0]=0;let n=0,r="";!function e(i,o,a){const s=i.type;if("FunctionNode"===s)throw new Error("There is an unsolved function call");if("OperatorNode"===s){if(!"+-*^".includes(i.op))throw new Error("Operator "+i.op+" invalid");if(null!==o){if(("unaryMinus"===i.fn||"pow"===i.fn)&&"add"!==o.fn&&"subtract"!==o.fn&&"multiply"!==o.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"multiply"===i.fn)&&"add"!==o.fn&&"subtract"!==o.fn)throw new Error("Invalid "+i.op+" placing");if(("subtract"===i.fn||"add"===i.fn||"unaryMinus"===i.fn)&&0!==a.noFil)throw new Error("Invalid "+i.op+" placing")}"^"!==i.op&&"*"!==i.op||(a.fire=i.op);for(let t=0;t<i.args.length;t++)"unaryMinus"===i.fn&&(a.oper="-"),"+"!==i.op&&"subtract"!==i.fn||(a.fire="",a.cte=1,a.oper=0===t?"+":i.op),a.noFil=t,e(i.args[t],i,a)}else if("SymbolNode"===s){if(i.name!==r&&""!==r)throw new Error("There is more than one variable");if(r=i.name,null===o)return void(t[1]=1);if("^"===o.op&&0!==a.noFil)throw new Error("In power the variable should be the first parameter");if("*"===o.op&&1!==a.noFil)throw new Error("In multiply the variable should be the second parameter");""!==a.fire&&"*"!==a.fire||(n<1&&(t[1]=0),t[1]+=a.cte*("+"===a.oper?1:-1),n=Math.max(1,n))}else{if("ConstantNode"!==s)throw new Error("Type "+s+" is not allowed");{const e=parseFloat(i.value);if(null===o)return void(t[0]=e);if("^"===o.op){if(1!==a.noFil)throw new Error("Constant cannot be powered");if(!ye(e)||e<=0)throw new Error("Non-integer exponent is not allowed");for(let r=n+1;r<e;r++)t[r]=0;return e>n&&(t[e]=0),t[e]+=a.cte*("+"===a.oper?1:-1),void(n=Math.max(e,n))}a.cte=e,""===a.fire&&(t[0]+=a.cte*("+"===a.oper?1:-1))}}}(e,null,{cte:1,oper:"+",fire:""}),n=t.length-1;let i,o=!0;for(let e=n;e>=0;e--){if(0===t[e])continue;let n=new w(o?t[e]:Math.abs(t[e]));const a=t[e]<0?"-":"+";if(e>0){let i=new S(r);if(e>1){const t=new w(e);i=new E("^","pow",[i,t])}n=-1===t[e]&&o?new E("-","unaryMinus",[i]):1===Math.abs(t[e])?i:new E("*","multiply",[n,i])}i=o?n:"+"===a?new E("+","add",[i,n]):new E("-","subtract",[i,n]),o=!1}return o?new w(0):i}})),tg="zpk2tf",ng=de(tg,["typed","add","multiply","Complex","number"],(e=>{let{typed:t,add:n,multiply:r,Complex:i,number:o}=e;return t(tg,{"Array,Array,number":function(e,t,n){return a(e,t,n)},"Array,Array":function(e,t){return a(e,t,1)},"Matrix,Matrix,number":function(e,t,n){return a(e.valueOf(),t.valueOf(),n)},"Matrix,Matrix":function(e,t){return a(e.valueOf(),t.valueOf(),1)}});function a(e,t,n){e.some((e=>"BigNumber"===e.type))&&(e=e.map((e=>o(e)))),t.some((e=>"BigNumber"===e.type))&&(t=t.map((e=>o(e))));let a=[i(1,0)],u=[i(1,0)];for(let t=0;t<e.length;t++){let n=e[t];"number"==typeof n&&(n=i(n,0)),a=s(a,[i(1,0),i(-n.re,-n.im)])}for(let e=0;e<t.length;e++){let n=t[e];"number"==typeof n&&(n=i(n,0)),u=s(u,[i(1,0),i(-n.re,-n.im)])}for(let e=0;e<a.length;e++)a[e]=r(a[e],n);return[a,u]}function s(e,t){const o=[];for(let a=0;a<e.length+t.length-1;a++){o[a]=i(0,0);for(let i=0;i<e.length;i++)a-i>=0&&a-i<t.length&&(o[a]=n(o[a],r(e[i],t[a-i])))}return o}})),rg="freqz",ig=de(rg,["typed","add","multiply","Complex","divide","matrix"],(e=>{let{typed:t,add:n,multiply:r,Complex:i,divide:o,matrix:a}=e;return t(rg,{"Array, Array":function(e,t){return s(e,t,u(512))},"Array, Array, Array":function(e,t,n){return s(e,t,n)},"Array, Array, number":function(e,t,n){if(n<0)throw new Error("w must be a positive number");return s(e,t,u(n))},"Matrix, Matrix":function(e,t){const n=u(512),{w:r,h:i}=s(e.valueOf(),t.valueOf(),n);return{w:a(r),h:a(i)}},"Matrix, Matrix, Matrix":function(e,t,n){const{h:r}=s(e.valueOf(),t.valueOf(),n.valueOf());return{h:a(r),w:a(n)}},"Matrix, Matrix, number":function(e,t,n){if(n<0)throw new Error("w must be a positive number");const r=u(n),{h:i}=s(e.valueOf(),t.valueOf(),r);return{h:a(i),w:a(r)}}});function s(e,t,a){const s=[],u=[];for(let o=0;o<a.length;o++){let c=i(0,0),l=i(0,0);for(let t=0;t<e.length;t++)c=n(c,r(e[t],i(Math.cos(-t*a[o]),Math.sin(-t*a[o]))));for(let e=0;e<t.length;e++)l=n(l,r(t[e],i(Math.cos(-e*a[o]),Math.sin(-e*a[o]))));s.push(c),u.push(l)}const c=[];for(let e=0;e<s.length;e++)c.push(o(s[e],u[e]));return{h:c,w:a}}function u(e){const t=[];for(let n=0;n<e;n++)t.push(n/e*Math.PI);return t}})),og=de("reviver",["classes"],(e=>{let{classes:t}=e;return function(e,n){const r=t[n&&n.mathjs];return r&&"function"==typeof r.fromJSON?r.fromJSON(n):n}})),ag=de("replacer",[],(()=>function(e,t){return"number"!=typeof t||isFinite(t)&&!isNaN(t)?"bigint"==typeof t?{mathjs:"bigint",value:String(t)}:t:{mathjs:"number",value:String(t)}})),sg=Math.PI,ug=2*Math.PI,cg=Math.E,lg=de("true",[],(()=>!0)),fg=de("false",[],(()=>!1)),pg=de("null",[],(()=>null)),mg=Bg("Infinity",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1/0):1/0})),dg=Bg("NaN",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(NaN):NaN})),hg=Bg("pi",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?$l(n):sg})),gg=Bg("tau",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?Hl(n):ug})),yg=Bg("e",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?jl(n):cg})),xg=Bg("phi",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?Ll(n):1.618033988749895})),bg=Bg("LN2",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(2).ln():Math.LN2})),wg=Bg("LN10",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(10).ln():Math.LN10})),vg=Bg("LOG2E",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1).div(new n(2).ln()):Math.LOG2E})),Ng=Bg("LOG10E",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(1).div(new n(10).ln()):Math.LOG10E})),Ag=Bg("SQRT1_2",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n("0.5").sqrt():Math.SQRT1_2})),Eg=Bg("SQRT2",["config","?BigNumber"],(e=>{let{config:t,BigNumber:n}=e;return"BigNumber"===t.number?new n(2).sqrt():Math.SQRT2})),Sg=Bg("i",["Complex"],(e=>{let{Complex:t}=e;return t.I})),Mg=de("PI",["pi"],(e=>{let{pi:t}=e;return t})),Cg=de("E",["e"],(e=>{let{e:t}=e;return t})),Tg=de("version",[],(()=>"14.9.1"));function Bg(e,t,n){return de(e,t,n,{recreateOnConfigChange:!0})}const Fg=Cy("speedOfLight","299792458","m s^-1"),Dg=Cy("gravitationConstant","6.67430e-11","m^3 kg^-1 s^-2"),Og=Cy("planckConstant","6.62607015e-34","J s"),_g=Cy("reducedPlanckConstant","1.0545718176461565e-34","J s"),zg=Cy("magneticConstant","1.25663706212e-6","N A^-2"),qg=Cy("electricConstant","8.8541878128e-12","F m^-1"),Ig=Cy("vacuumImpedance","376.730313667","ohm"),kg=Cy("coulomb","8.987551792261171e9","N m^2 C^-2"),Rg=Cy("coulombConstant","8.987551792261171e9","N m^2 C^-2"),Pg=Cy("elementaryCharge","1.602176634e-19","C"),Ug=Cy("bohrMagneton","9.2740100783e-24","J T^-1"),jg=Cy("conductanceQuantum","7.748091729863649e-5","S"),Lg=Cy("inverseConductanceQuantum","12906.403729652257","ohm"),$g=Cy("magneticFluxQuantum","2.0678338484619295e-15","Wb"),Hg=Cy("nuclearMagneton","5.0507837461e-27","J T^-1"),Gg=Cy("klitzing","25812.807459304513","ohm"),Zg=Cy("bohrRadius","5.29177210903e-11","m"),Vg=Cy("classicalElectronRadius","2.8179403262e-15","m"),Wg=Cy("electronMass","9.1093837015e-31","kg"),Yg=Cy("fermiCoupling","1.1663787e-5","GeV^-2"),Jg=Ty("fineStructure",.0072973525693),Xg=Cy("hartreeEnergy","4.3597447222071e-18","J"),Qg=Cy("protonMass","1.67262192369e-27","kg"),Kg=Cy("deuteronMass","3.3435830926e-27","kg"),ey=Cy("neutronMass","1.6749271613e-27","kg"),ty=Cy("quantumOfCirculation","3.6369475516e-4","m^2 s^-1"),ny=Cy("rydberg","10973731.568160","m^-1"),ry=Cy("thomsonCrossSection","6.6524587321e-29","m^2"),iy=Ty("weakMixingAngle",.2229),oy=Ty("efimovFactor",22.7),ay=Cy("atomicMass","1.66053906660e-27","kg"),sy=Cy("avogadro","6.02214076e23","mol^-1"),uy=Cy("boltzmann","1.380649e-23","J K^-1"),cy=Cy("faraday","96485.33212331001","C mol^-1"),ly=Cy("firstRadiation","3.7417718521927573e-16","W m^2"),fy=Cy("loschmidt","2.686780111798444e25","m^-3"),py=Cy("gasConstant","8.31446261815324","J K^-1 mol^-1"),my=Cy("molarPlanckConstant","3.990312712893431e-10","J s mol^-1"),dy=Cy("molarVolume","0.022413969545014137","m^3 mol^-1"),hy=Ty("sackurTetrode",-1.16487052358),gy=Cy("secondRadiation","0.014387768775039337","m K"),yy=Cy("stefanBoltzmann","5.67037441918443e-8","W m^-2 K^-4"),xy=Cy("wienDisplacement","2.897771955e-3","m K"),by=Cy("molarMass","0.99999999965e-3","kg mol^-1"),wy=Cy("molarMassC12","11.9999999958e-3","kg mol^-1"),vy=Cy("gravity","9.80665","m s^-2"),Ny=Cy("planckLength","1.616255e-35","m"),Ay=Cy("planckMass","2.176435e-8","kg"),Ey=Cy("planckTime","5.391245e-44","s"),Sy=Cy("planckCharge","1.87554603778e-18","C"),My=Cy("planckTemperature","1.416785e+32","K");function Cy(e,t,n){return de(e,["config","Unit","BigNumber"],(e=>{let{config:r,Unit:i,BigNumber:o}=e;const a=new i("BigNumber"===r.number?new o(t):parseFloat(t),n);return a.fixPrefix=!0,a}))}function Ty(e,t){return de(e,["config","BigNumber"],(e=>{let{config:n,BigNumber:r}=e;return"BigNumber"===n.number?new r(t):t}))}const By=de("mapSlices",["typed","isInteger"],(e=>{let{typed:t,isInteger:n}=e;const r=Fo({typed:t,isInteger:n});return t("mapSlices",{"...any":function(e){const t=e[1];h(t)?e[1]=t-1:g(t)&&(e[1]=t.minus(1));try{return r.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0,...Fo.meta}),Fy=de("column",["typed","Index","matrix","range"],(e=>{let{typed:t,Index:n,matrix:r,range:i}=e;const o=Rs({typed:t,Index:n,matrix:r,range:i});return t("column",{"...any":function(e){const t=e.length-1,n=e[t];h(n)&&(e[t]=n-1);try{return o.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0});function Dy(e,t,n){const r=e.filter((function(e){return re(e)&&!(e.name in t)&&!n.has(e.name)}))[0];if(!r)throw new Error('No undefined variable found in inline expression "'+e+'"');const i=r.name,o=new Map,a=new f(n,o,new Set([i])),s=e.compile();return function(e){return o.set(i,e),s.evaluate(a)}}const Oy=de("transformCallback",["typed"],(e=>{let{typed:t}=e;return function(e,r){return t.isTypedFunction(e)?n(e,r):_y(e,e.length,r)};function n(e,r){const i=Object.fromEntries(Object.entries(e.signatures).map((e=>{let[i,o]=e;const a=i.split(",").length;return t.isTypedFunction(o)?[i,n(o,r)]:[i,_y(o,a,r)]})));return"string"==typeof e.name?t(e.name,i):t(i)}}));function _y(e,t,n){return t===n?e:t===n+1?function(){for(var t=arguments.length,r=new Array(t),i=0;i<t;i++)r[i]=arguments[i];const o=r.slice(0,n),a=zy(r[n]);return e(...o,a)}:t>n+1?function(){for(var t=arguments.length,r=new Array(t),i=0;i<t;i++)r[i]=arguments[i];const o=r.slice(0,n),a=zy(r[n]),s=r.slice(n+1);return e(...o,a,...s)}:e}function zy(e){return e.map((e=>e+1))}const qy=de("filter",["typed"],(e=>{let{typed:t}=e;function n(e,n,i){const o=Gs({typed:t}),a=Oy({typed:t});if(0===e.length)return o();let s=e[0];if(1===e.length)return o(s);const u=e.length-1;let c=e[u];return s&&(s=r(s,i)),c&&(c=re(c)||W(c)?r(c,i):Dy(c,n,i)),o(s,a(c,u))}function r(e,t){return e.compile().evaluate(t)}return n.rawArgs=!0,n}),{isTransformFunction:!0}),Iy=de("forEach",["typed"],(e=>{let{typed:t}=e;const n=Js({typed:t}),r=Oy({typed:t});function i(e,t,i){if(0===e.length)return n();let a=e[0];if(1===e.length)return n(a);const s=e.length-1;let u=e[s];return a&&(a=o(a,i)),u&&(u=re(u)||W(u)?o(u,i):Dy(u,t,i)),n(a,r(u,s))}function o(e,t){return e.compile().evaluate(t)}return i.rawArgs=!0,i}),{isTransformFunction:!0}),ky=de("index",["Index","getMatrixDataType"],(e=>{let{Index:t,getMatrixDataType:n}=e;return function(){const e=[];for(let t=0,r=arguments.length;t<r;t++){let r=arguments[t];if(C(r))r.start--,r.end-=r.step>0?0:2;else if(r&&!0===r.isSet)r=r.map((function(e){return e-1}));else if(N(r)||A(r))"boolean"!==n(r)&&(r=r.map((function(e){return e-1})));else if(h(r)||y(r))r--;else if(g(r))r=r.toNumber()-1;else if("string"!=typeof r)throw new TypeError("Dimension must be an Array, Matrix, number, bigint, string, or Range");e[t]=r}const r=new t;return t.apply(r,e),r}}),{isTransformFunction:!0}),Ry=de("map",["typed"],(e=>{let{typed:t}=e;const n=ou({typed:t}),r=Oy({typed:t});function i(e,t,i){if(0===e.length)return n();if(1===e.length)return n(e[0]);const o=e.length-1;let a=e.slice(0,o),s=e[o];return a=a.map((e=>u(e,i))),s&&(s=re(s)||W(s)?u(s,i):Dy(s,t,i)),n(...a,r(s,o));function u(e,t){return e.compile().evaluate(t)}}return i.rawArgs=!0,i}),{isTransformFunction:!0});function Py(e){if(2===e.length&&E(e[0])){const n=(e=e.slice())[1];(h(t=n)||g(t))&&(e[1]=function(e){return h(e)?e-1:g(e)?e.minus(1):e}(n))}var t;return e}const Uy=de("max",["typed","config","numeric","larger","isNaN"],(e=>{let{typed:t,config:n,numeric:r,larger:i,isNaN:o}=e;const a=Ol({typed:t,config:n,numeric:r,larger:i,isNaN:o});return t("max",{"...any":function(e){e=Py(e);try{return a.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),jy=de("mean",["typed","add","divide"],(e=>{let{typed:t,add:n,divide:r}=e;const i=Id({typed:t,add:n,divide:r});return t("mean",{"...any":function(e){e=Py(e);try{return i.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Ly=de("min",["typed","config","numeric","smaller","isNaN"],(e=>{let{typed:t,config:n,numeric:r,smaller:i,isNaN:o}=e;const a=_l({typed:t,config:n,numeric:r,smaller:i,isNaN:o});return t("min",{"...any":function(e){e=Py(e);try{return a.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),$y=de("range",["typed","config","?matrix","?bignumber","equal","smaller","smallerEq","larger","largerEq","add","isZero","isPositive"],(e=>{let{typed:t,config:n,matrix:r,bignumber:i,equal:o,smaller:a,smallerEq:s,larger:u,largerEq:c,add:l,isZero:f,isPositive:p}=e;const m=mu({typed:t,config:n,matrix:r,bignumber:i,equal:o,smaller:a,smallerEq:s,larger:u,largerEq:c,add:l,isZero:f,isPositive:p});return t("range",{"...any":function(e){return"boolean"!=typeof e[e.length-1]&&e.push(!0),m.apply(null,e)}})}),{isTransformFunction:!0}),Hy=de("row",["typed","Index","matrix","range"],(e=>{let{typed:t,Index:n,matrix:r,range:i}=e;const o=vu({typed:t,Index:n,matrix:r,range:i});return t("row",{"...any":function(e){const t=e.length-1,n=e[t];h(n)&&(e[t]=n-1);try{return o.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Gy=de("subset",["typed","matrix","zeros","add"],(e=>{let{typed:t,matrix:n,zeros:r,add:i}=e;const o=Cu({typed:t,matrix:n,zeros:r,add:i});return t("subset",{"...any":function(e){try{return o.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Zy=de("concat",["typed","matrix","isInteger"],(e=>{let{typed:t,matrix:n,isInteger:r}=e;const i=Is({typed:t,matrix:n,isInteger:r});return t("concat",{"...any":function(e){const t=e.length-1,n=e[t];h(n)?e[t]=n-1:g(n)&&(e[t]=n.minus(1));try{return i.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Vy="diff",Wy=de(Vy,["typed","matrix","subtract","number","bignumber"],(e=>{let{typed:t,matrix:n,subtract:r,number:i,bignumber:o}=e;const a=su({typed:t,matrix:n,subtract:r,number:i,bignumber:o});return t(Vy,{"...any":function(e){e=Py(e);try{return a.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Yy=de("std",["typed","map","sqrt","variance"],(e=>{let{typed:t,map:n,sqrt:r,variance:i}=e;const o=Gd({typed:t,map:n,sqrt:r,variance:i});return t("std",{"...any":function(e){e=Py(e);try{return o.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Jy=de("sum",["typed","config","add","numeric"],(e=>{let{typed:t,config:n,add:r,numeric:i}=e;const o=Od({typed:t,config:n,add:r,numeric:i});return t("sum",{"...any":function(e){e=Py(e);try{return o.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),Xy=de("quantileSeq",["typed","bignumber","add","subtract","divide","multiply","partitionSelect","compare","isInteger","smaller","smallerEq","larger","mapSlices"],(e=>{let{typed:t,bignumber:n,add:r,subtract:i,divide:o,multiply:a,partitionSelect:s,compare:u,isInteger:c,smaller:l,smallerEq:f,larger:p,mapSlices:m}=e;const d=Hd({typed:t,bignumber:n,add:r,subtract:i,divide:o,multiply:a,partitionSelect:s,compare:u,isInteger:c,smaller:l,smallerEq:f,larger:p,mapSlices:m});return t("quantileSeq",{"Array | Matrix, number | BigNumber":d,"Array | Matrix, number | BigNumber, number":(e,t,n)=>d(e,t,h(n)),"Array | Matrix, number | BigNumber, boolean":d,"Array | Matrix, number | BigNumber, boolean, number":(e,t,n,r)=>d(e,t,n,h(r)),"Array | Matrix, Array | Matrix":d,"Array | Matrix, Array | Matrix, number":(e,t,n)=>d(e,t,h(n)),"Array | Matrix, Array | Matrix, boolean":d,"Array | Matrix, Array | Matrix, boolean, number":(e,t,n,r)=>d(e,t,n,h(r))});function h(e){return Py([[],e])[1]}}),{isTransformFunction:!0}),Qy="cumsum",Ky=de(Qy,["typed","add","unaryPlus"],(e=>{let{typed:t,add:n,unaryPlus:r}=e;const i=zd({typed:t,add:n,unaryPlus:r});return t(Qy,{"...any":function(e){if(2===e.length&&E(e[0])){const t=e[1];h(t)?e[1]=t-1:g(t)&&(e[1]=t.minus(1))}try{return i.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),ex="variance",tx=de(ex,["typed","add","subtract","multiply","divide","mapSlices","isNaN"],(e=>{let{typed:t,add:n,subtract:r,multiply:i,divide:o,mapSlices:a,isNaN:s}=e;const u=Ld({typed:t,add:n,subtract:r,multiply:i,divide:o,mapSlices:a,isNaN:s});return t(ex,{"...any":function(e){e=Py(e);try{return u.apply(null,e)}catch(e){throw Rp(e)}}})}),{isTransformFunction:!0}),nx="print",rx=de(nx,["typed","matrix","zeros","add"],(e=>{let{typed:t,matrix:n,zeros:r,add:i}=e;const o=uc({typed:t,matrix:n,zeros:r,add:i});return t(nx,{"string, Object | Array":function(e,t){return o(a(e),t)},"string, Object | Array, number | Object":function(e,t,n){return o(a(e),t,n)}});function a(e){return e.replace(ac,(e=>"$"+e.slice(1).split(".").map((function(e){return!isNaN(e)&&e.length>0?parseInt(e)-1:e})).join(".")))}}),{isTransformFunction:!0}),ix=de("and",["typed","matrix","zeros","add","equalScalar","not","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,not:o,concat:a}=e;const s=Jc({typed:t,matrix:n,equalScalar:r,zeros:i,not:o,concat:a});function u(e,t,n){const r=e[0].compile().evaluate(n);if(!E(r)&&!s(r,!0))return!1;const i=e[1].compile().evaluate(n);return s(r,i)}return u.rawArgs=!0,u}),{isTransformFunction:!0}),ox=de("or",["typed","matrix","equalScalar","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o}=e;const a=_s({typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o});function s(e,t,n){const r=e[0].compile().evaluate(n);if(!E(r)&&a(r,!1))return!0;const i=e[1].compile().evaluate(n);return a(r,i)}return s.rawArgs=!0,s}),{isTransformFunction:!0}),ax=de("nullish",["typed","matrix","size","flatten","deepEqual"],(e=>{let{typed:t,matrix:n,size:r,flatten:i,deepEqual:o}=e;const a=Os({typed:t,matrix:n,size:r,flatten:i,deepEqual:o});function s(e,t,n){const r=e[0].compile().evaluate(n);if(!E(r)&&null!=r&&void 0!==r)return r;const i=e[1].compile().evaluate(n);return a(r,i)}return s.rawArgs=!0,s}),{isTransformFunction:!0}),sx=de("bitAnd",["typed","matrix","zeros","add","equalScalar","not","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,zeros:i,not:o,concat:a}=e;const s=ps({typed:t,matrix:n,equalScalar:r,zeros:i,not:o,concat:a});function u(e,t,n){const r=e[0].compile().evaluate(n);if(!E(r)){if(isNaN(r))return NaN;if(0===r||!1===r)return 0}const i=e[1].compile().evaluate(n);return s(r,i)}return u.rawArgs=!0,u}),{isTransformFunction:!0}),ux=de("bitOr",["typed","matrix","equalScalar","DenseMatrix","concat"],(e=>{let{typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o}=e;const a=gs({typed:t,matrix:n,equalScalar:r,DenseMatrix:i,concat:o});function s(e,t,n){const r=e[0].compile().evaluate(n);if(!E(r)){if(isNaN(r))return NaN;if(-1===r)return-1;if(!0===r)return 1}const i=e[1].compile().evaluate(n);return a(r,i)}return s.rawArgs=!0,s}),{isTransformFunction:!0});var cx=n(504);const lx={relTol:1e-12,absTol:1e-15,matrix:"Matrix",number:"number",numberFallback:"number",precision:64,predictable:!1,randomSeed:null},fx=["Matrix","Array"],px=["number","BigNumber","bigint","Fraction"];function mx(e,t){function n(r){if(r){if(void 0!==r.epsilon){console.warn('Warning: The configuration option "epsilon" is deprecated. Use "relTol" and "absTol" instead.');const e=ae(r);return e.relTol=r.epsilon,e.absTol=.001*r.epsilon,delete e.epsilon,n(e)}const i=ae(e);dx(r,"matrix",fx),dx(r,"number",px),ue(e,r);const o=ae(e),a=ae(r);return t("config",o,i,a),o}return ae(e)}return n.MATRIX_OPTIONS=fx,n.NUMBER_OPTIONS=px,Object.keys(lx).forEach((t=>{Object.defineProperty(n,t,{get:()=>e[t],enumerable:!0,configurable:!0})})),n}function dx(e,t,n){void 0===e[t]||n.includes(e[t])||console.warn('Warning: Unknown value "'+e[t]+'" for configuration option "'+t+'". Available options: '+n.map((e=>JSON.stringify(e))).join(", ")+".")}const hx=function e(n,r){const i=sr({},lx,r);if("function"!=typeof Object.create)throw new Error("ES5 not supported by this JavaScript engine. Please load the es5-shim and es5-sham library for compatibility.");const o=function(e){const t=new cx;return e.on=t.on.bind(t),e.off=t.off.bind(t),e.once=t.once.bind(t),e.emit=t.emit.bind(t),e}({isNumber:h,isComplex:x,isBigNumber:g,isBigInt:y,isFraction:b,isUnit:w,isString:v,isArray:N,isMatrix:A,isCollection:E,isDenseMatrix:S,isSparseMatrix:M,isRange:C,isIndex:T,isBoolean:B,isResultSet:F,isHelp:D,isFunction:O,isDate:_,isRegExp:z,isObject:q,isMap:I,isPartitionedMap:k,isObjectWrappingMap:R,isNull:P,isUndefined:U,isAccessorNode:j,isArrayNode:L,isAssignmentNode:$,isBlockNode:H,isConditionalNode:G,isConstantNode:Z,isFunctionAssignmentNode:W,isFunctionNode:Y,isIndexNode:J,isNode:X,isObjectNode:Q,isOperatorNode:K,isParenthesisNode:ee,isRangeNode:te,isRelationalNode:ne,isSymbolNode:re,isChain:ie});o.config=mx(i,o.emit),o.expression={transform:{},mathWithTransform:{config:o.config}};const a={};function s(){for(var e=arguments.length,t=new Array(e),n=0;n<e;n++)t[n]=arguments[n];return o.typed.apply(o.typed,t)}s.isTypedFunction=t.isTypedFunction;const u=function(e,t,n,r){function i(t,i,a){var s,u;if(a.wrap&&"function"==typeof i&&(i=function(e){const t=function(){const t=[];for(let e=0,n=arguments.length;e<n;e++){const n=arguments[e];t[e]=n&&n.valueOf()}return e.apply(n,t)};return e.transform&&(t.transform=e.transform),t}(i)),"function"==typeof(u=i)&&"string"==typeof u.signature&&(i=e(t,{[i.signature]:i})),e.isTypedFunction(n[t])&&e.isTypedFunction(i))return i=a.override?e(t,i.signatures):e(n[t],i),n[t]=i,delete r[t],o(t,i),void n.emit("import",t,(function(){return i}));const c=void 0!==n[t],l=null===(s=n.Unit)||void 0===s?void 0:s.isValuelessUnit(t);if(!c&&!l||a.override)return n[t]=i,delete r[t],o(t,i),void n.emit("import",t,(function(){return i}));if(!a.silent)throw new Error('Cannot import "'+t+'": already exists')}function o(e,t){t&&"function"==typeof t.transform?(n.expression.transform[e]=t.transform,u(e)&&(n.expression.mathWithTransform[e]=t.transform)):(delete n.expression.transform[e],u(e)&&(n.expression.mathWithTransform[e]=t))}function a(e){delete n.expression.transform[e],u(e)?n.expression.mathWithTransform[e]=n[e]:delete n.expression.mathWithTransform[e]}function s(t,i){var o,s;let u=arguments.length>2&&void 0!==arguments[2]?arguments[2]:t.fn;if(u.includes("."))throw new Error("Factory name should not contain a nested path. Name: "+JSON.stringify(u));const f=c(t)?n.expression.transform:n,p=u in n.expression.transform,m=me(f,u)?f[u]:void 0,d=function(){const r={};t.dependencies.map(ge).forEach((e=>{if(e.includes("."))throw new Error("Factory dependency should not contain a nested path. Name: "+JSON.stringify(e));"math"===e?r.math=n:"mathWithTransform"===e?r.mathWithTransform=n.expression.mathWithTransform:"classes"===e?r.classes=n:r[e]=n[e]}));const o=t(r);if(o&&"function"==typeof o.transform)throw new Error('Transforms cannot be attached to factory functions. Please create a separate function for it with export const path = "expression.transform"');if(void 0===m||i.override)return o;if(e.isTypedFunction(m)&&e.isTypedFunction(o))return e(m,o);if(i.silent)return m;throw new Error('Cannot import "'+u+'": already exists')},h=null!==(o=null===(s=t.meta)||void 0===s?void 0:s.formerly)&&void 0!==o?o:"",g=c(t)||function(e){return!(e.fn.includes(".")||me(l,e.fn)||e.meta&&e.meta.isClass)}(t),y=n.expression.mathWithTransform;t.meta&&!1===t.meta.lazy?(f[u]=d(),h&&(f[h]=f[u]),m&&p?(a(u),h&&a(h)):g&&(pe(y,u,(()=>f[u])),h&&pe(y,h,(()=>f[u])))):(pe(f,u,d),h&&pe(f,h,d),m&&p?(a(u),h&&a(h)):g&&(pe(y,u,(()=>f[u])),h&&pe(y,h,(()=>f[u])))),r[u]=t,n.emit("import",u,d)}function u(e){return!me(l,e)}function c(e){return void 0!==e&&void 0!==e.meta&&!0===e.meta.isTransformFunction||!1}const l={expression:!0,type:!0,docs:!0,error:!0,json:!0,chain:!0};return function(e,t){const n=arguments.length;if(1!==n&&2!==n)throw new ga("import",n,1,2);t||(t={});const r={};!function e(n,r,i){if(Array.isArray(r))r.forEach((t=>e(n,t)));else if(q(r)||"object"==typeof(o=r)&&"Module"===o[Symbol.toStringTag])for(const t in r)me(r,t)&&e(n,r[t],t);else if(he(r)||void 0!==i){const e=he(r)?c(r)?r.fn+".transform":r.fn:i;if(me(n,e)&&n[e]!==r&&!t.silent)throw new Error('Cannot import "'+e+'" twice');n[e]=r}else if(!t.silent)throw new TypeError("Factory, Object, or Array expected");var o}(r,e);for(const e in r)if(me(r,e)){const n=r[e];if(he(n))s(n,t);else if("function"==typeof(o=n)||"number"==typeof o||"string"==typeof o||"boolean"==typeof o||null===o||w(o)||x(o)||g(o)||b(o)||A(o)||Array.isArray(o))i(e,n,t);else if(!t.silent)throw new TypeError("Factory, Object, or Array expected")}var o}}(s,0,o,a);return o.import=u,o.on("config",(()=>{Object.values(a).forEach((e=>{e&&e.meta&&e.meta.recreateOnConfigChange&&u(e,{override:!0})}))})),o.create=e.bind(null,n),o.factory=de,o.import(Object.values(le(n))),o.ArgumentsError=ga,o.DimensionError=xr,o.IndexError=br,o}(e)})(),r.default})()));
+//# sourceMappingURL=math.js.map
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/browser/math.js.LICENSE.txt b/node_modules/mathjs/lib/browser/math.js.LICENSE.txt
new file mode 100644
index 0000000..87d8ed7
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/math.js.LICENSE.txt
@@ -0,0 +1,34 @@
+/*!
+ *  decimal.js v10.5.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */
+
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version 14.9.1
+ * @date    2025-10-10
+ *
+ * @license
+ * Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+ *
+ * https://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.
+ */
diff --git a/node_modules/mathjs/lib/browser/math.js.map b/node_modules/mathjs/lib/browser/math.js.map
new file mode 100644
index 0000000..f7df0f6
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/math.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"math.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAc,KAAID,IAElBD,EAAW,KAAIC,GAChB,CATD,CASGK,MAAM,I,gCCTT,OAGA,SAAUC,EAAQJ,GAElB,SAASK,EAAOC,GACd,IAAIC,EAAKJ,KAAMK,EAAU,GAGzBD,EAAGE,KAAO,WACR,IAAIC,EAAKH,EAAGI,EAAKJ,EAAGI,IAAM,EAE1B,OADAJ,EAAGI,EAAIJ,EAAGK,EAAGL,EAAGK,EAAIL,EAAGM,EAAGN,EAAGM,EAAIN,EAAGO,EAAGP,EAAGO,EAAIP,EAAGQ,GACzCR,EAAGS,EAAKT,EAAGS,EAAI,OAAS,IAC5BT,EAAGQ,EAAKR,EAAGQ,EAAKR,EAAGQ,GAAK,EAAOL,EAAKA,GAAK,GAAO,CACtD,EAEAH,EAAGI,EAAI,EACPJ,EAAGK,EAAI,EACPL,EAAGM,EAAI,EACPN,EAAGO,EAAI,EACPP,EAAGQ,EAAI,EAEHT,KAAiB,EAAPA,GAEZC,EAAGI,EAAIL,EAGPE,GAAWF,EAIb,IAAK,IAAIW,EAAI,EAAGA,EAAIT,EAAQU,OAAS,GAAID,IACvCV,EAAGI,GAA6B,EAAxBH,EAAQW,WAAWF,GACvBA,GAAKT,EAAQU,SACfX,EAAGS,EAAIT,EAAGI,GAAK,GAAKJ,EAAGI,IAAM,GAE/BJ,EAAGE,MAEP,CAEA,SAASW,EAAKC,EAAGX,GAOf,OANAA,EAAEC,EAAIU,EAAEV,EACRD,EAAEE,EAAIS,EAAET,EACRF,EAAEG,EAAIQ,EAAER,EACRH,EAAEI,EAAIO,EAAEP,EACRJ,EAAEK,EAAIM,EAAEN,EACRL,EAAEM,EAAIK,EAAEL,EACDN,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GAClB,IAAIC,EAAK,IAAInB,EAAOC,GAChBmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGf,SAAW,GAAK,UAAa,EAehE,OAdAiB,EAAKC,OAAS,WACZ,GACE,IAEIC,IAFMJ,EAAGf,SAAW,KACbe,EAAGf,SAAW,GAAK,aACF,GAAK,UACf,IAAXmB,GACT,OAAOA,CACT,EACAF,EAAKG,MAAQL,EAAGf,KAChBiB,EAAKI,MAAQJ,EACTD,IACmB,iBAAX,GAAqBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAEI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAK4B,OAAST,CAGf,CA5ED,CA6EEnB,E,WAEA,O,qBClFF,OAKA,SAAUC,EAAQJ,GAElB,SAASK,EAAOC,GACd,IAAIC,EAAKJ,KAGTI,EAAGE,KAAO,WAER,IAAwBC,EAAGK,EAAvBiB,EAAIzB,EAAGI,EAAGsB,EAAI1B,EAAG0B,EAQrB,OAPAvB,EAAIsB,EAAEC,GAAoBlB,GAAhBL,GAAMA,IAAM,GAAaA,GAAK,GACpBK,IAApBL,EAAIsB,EAAGC,EAAI,EAAK,IAAcvB,IAAM,GAChBK,IAApBL,EAAIsB,EAAGC,EAAI,EAAK,IAAcvB,IAAM,EAChBK,IAApBL,EAAIsB,EAAGC,EAAI,EAAK,IAAcvB,GAAK,EACnCA,EAAIsB,EAAGC,EAAI,EAAK,GAAuBlB,IAAnBL,GAASA,GAAK,IAAeA,GAAK,EACtDsB,EAAEC,GAAKlB,EACPR,EAAG0B,EAAKA,EAAI,EAAK,EACVlB,CACT,EAEA,SAAcR,EAAID,GAChB,IAAI4B,EAAMF,EAAI,GAEd,GAAI1B,KAAiB,EAAPA,GAER0B,EAAE,GAAK1B,OAIX,IADAA,EAAO,GAAKA,EACP4B,EAAI,EAAGA,EAAI5B,EAAKY,SAAUgB,EAC7BF,EAAM,EAAJE,GAAUF,EAAM,EAAJE,IAAU,GACnB5B,EAAKa,WAAWe,GAAKF,EAAGE,EAAI,EAAK,IAAM,GAIhD,KAAOF,EAAEd,OAAS,GAAGc,EAAEG,KAAK,GAC5B,IAAKD,EAAI,EAAGA,EAAI,GAAc,IAATF,EAAEE,KAAYA,GAOnC,IANS,GAALA,EAAYF,EAAE,IAAM,EAAYA,EAAEE,GAEtC3B,EAAGI,EAAIqB,EACPzB,EAAG0B,EAAI,EAGFC,EAAI,IAAKA,EAAI,IAAKA,EACrB3B,EAAGE,MAEP,CAEA2B,CAAK7B,EAAID,EACX,CAEA,SAASc,EAAKC,EAAGX,GAGf,OAFAA,EAAEC,EAAIU,EAAEV,EAAE0B,QACV3B,EAAEuB,EAAIZ,EAAEY,EACDvB,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GACN,MAARjB,IAAcA,GAAQ,IAAKgC,MAC/B,IAAId,EAAK,IAAInB,EAAOC,GAChBmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGf,SAAW,GAAK,UAAa,EAehE,OAdAiB,EAAKC,OAAS,WACZ,GACE,IAEIC,IAFMJ,EAAGf,SAAW,KACbe,EAAGf,SAAW,GAAK,aACF,GAAK,UACf,IAAXmB,GACT,OAAOA,CACT,EACAF,EAAKG,MAAQL,EAAGf,KAChBiB,EAAKI,MAAQJ,EACTD,IACEA,EAAMd,GAAGS,EAAKK,EAAOD,GACzBE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAEI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAKoC,UAAYjB,CAGlB,CAtFD,CAuFEnB,E,WAEA,O,uBCzFF,IAAIqC,EAAWC,OAAOC,QAAU,SAAUC,GAAU,IAAK,IAAIV,EAAI,EAAGA,EAAIW,UAAU1B,OAAQe,IAAK,CAAE,IAAIY,EAASD,UAAUX,GAAI,IAAK,IAAIa,KAAOD,EAAcJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,KAAQH,EAAOG,GAAOD,EAAOC,GAAU,CAAE,OAAOH,CAAQ,EAE3PO,EAAiB,CACnB,IAAK,MACL,IAAK,MACL,KAAM,oBACN,IAAK,MACLC,EAAG,MACH,IAAK,MACL,IAAK,MACL,IAAK,sBACLC,EAAG,MACH,IAAK,sBAEHC,EAAgB,CAClB,IAAU,OACV,IAAU,QACV,IAAK,IACL,KAAM,YACN,OAAQ,cACR,KAAM,eAGJC,EAAqB,SAA4BJ,EAAgBG,GACnE,OAAOb,EAAS,CAAC,EAAGU,EAAgBG,EACtC,EAUArD,EAAOD,QAAU,SAAUwD,GAmCzB,IAlCA,IAAIC,EAAOZ,UAAU1B,OAAS,QAAsBuC,IAAjBb,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAC5Ec,EAAwBF,EAAKG,mBAC7BA,OAA+CF,IAA1BC,GAA8CA,EACnEE,EAAmBJ,EAAKK,YACxBA,OAAmCJ,IAArBG,EAAiCN,EAAqBM,EAEpEE,EAAaC,OAAOR,GACpB3B,EAAS,GAEToC,EAAUH,EAAYrB,EAAS,CAAC,EAAGU,GAAiBS,EAAqBnB,EAAS,CAAC,EAAGa,GAAiB,CAAC,GACxGY,EAAaxB,OAAOyB,KAAKF,GAMzBG,EAAQ,WACV,IAAIC,GAAmB,EACvBH,EAAWI,SAAQ,SAAUvB,EAAKwB,GAC5BF,GAGAN,EAAW5C,QAAU4B,EAAI5B,QAAU4C,EAAWzB,MAAM,EAAGS,EAAI5B,UAAY4B,IACzElB,GAAUoC,EAAQC,EAAWK,IAC7BR,EAAaA,EAAWzB,MAAMS,EAAI5B,OAAQ4C,EAAW5C,QACrDkD,GAAmB,EAEvB,IACKA,IACHxC,GAAUkC,EAAWzB,MAAM,EAAG,GAC9ByB,EAAaA,EAAWzB,MAAM,EAAGyB,EAAW5C,QAEhD,EAEO4C,GACLK,IAEF,OAAOvC,CACT,C,sBC/EA,OA2BA,SAAUxB,EAAQJ,GAElB,SAASuE,EAAKjE,GACZ,IAgDIkE,EAhDAjE,EAAKJ,KAAMsE,GAgDXD,EAAI,WAEG,SAASE,GAClBA,EAAOX,OAAOW,GACd,IAAK,IAAIzC,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAAK,CAEpC,IAAI0C,EAAI,oBADRH,GAAKE,EAAKvD,WAAWc,IAGrB0C,GADAH,EAAIG,IAAM,EAGVH,GADAG,GAAKH,KACK,EAEVA,GAAS,YADTG,GAAKH,EAEP,CACA,OAAmB,wBAAXA,IAAM,EAChB,GA7DAjE,EAAGE,KAAO,WACR,IAAIC,EAAI,QAAUH,EAAGqE,GAAY,uBAAPrE,EAAGsE,EAG7B,OAFAtE,EAAGqE,GAAKrE,EAAGuE,GACXvE,EAAGuE,GAAKvE,EAAGwE,GACJxE,EAAGwE,GAAKrE,GAAKH,EAAGsE,EAAQ,EAAJnE,EAC7B,EAGAH,EAAGsE,EAAI,EACPtE,EAAGqE,GAAKH,EAAK,KACblE,EAAGuE,GAAKL,EAAK,KACblE,EAAGwE,GAAKN,EAAK,KACblE,EAAGqE,IAAMH,EAAKnE,GACVC,EAAGqE,GAAK,IAAKrE,EAAGqE,IAAM,GAC1BrE,EAAGuE,IAAML,EAAKnE,GACVC,EAAGuE,GAAK,IAAKvE,EAAGuE,IAAM,GAC1BvE,EAAGwE,IAAMN,EAAKnE,GACVC,EAAGwE,GAAK,IAAKxE,EAAGwE,IAAM,GAC1BN,EAAO,IACT,CAEA,SAASrD,EAAKC,EAAGX,GAKf,OAJAA,EAAEmE,EAAIxD,EAAEwD,EACRnE,EAAEkE,GAAKvD,EAAEuD,GACTlE,EAAEoE,GAAKzD,EAAEyD,GACTpE,EAAEqE,GAAK1D,EAAE0D,GACFrE,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GAClB,IAAIC,EAAK,IAAI+C,EAAKjE,GACdmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAOF,EAAGf,KAUd,OATAiB,EAAKG,MAAQ,WAAa,OAAoB,WAAZL,EAAGf,OAAwB,CAAG,EAChEiB,EAAKC,OAAS,WACZ,OAAOD,IAAmC,uBAAhB,QAATA,IAAoB,EACvC,EACAA,EAAKI,MAAQJ,EACTD,IACmB,iBAAX,GAAqBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAwBI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAK6E,KAAO1D,CAGb,CAhFD,CAiFEnB,E,WAEA,O,sBC9GF,OAGA,SAAUC,EAAQJ,GAElB,SAASK,EAAOC,GACd,IAAIC,EAAKJ,KAAMK,EAAU,GAEzBD,EAAGI,EAAI,EACPJ,EAAGK,EAAI,EACPL,EAAGM,EAAI,EACPN,EAAGO,EAAI,EAGPP,EAAGE,KAAO,WACR,IAAIC,EAAIH,EAAGI,EAAKJ,EAAGI,GAAK,GAIxB,OAHAJ,EAAGI,EAAIJ,EAAGK,EACVL,EAAGK,EAAIL,EAAGM,EACVN,EAAGM,EAAIN,EAAGO,EACHP,EAAGO,GAAMP,EAAGO,IAAM,GAAMJ,EAAKA,IAAM,CAC5C,EAEIJ,KAAiB,EAAPA,GAEZC,EAAGI,EAAIL,EAGPE,GAAWF,EAIb,IAAK,IAAIW,EAAI,EAAGA,EAAIT,EAAQU,OAAS,GAAID,IACvCV,EAAGI,GAA6B,EAAxBH,EAAQW,WAAWF,GAC3BV,EAAGE,MAEP,CAEA,SAASW,EAAKC,EAAGX,GAKf,OAJAA,EAAEC,EAAIU,EAAEV,EACRD,EAAEE,EAAIS,EAAET,EACRF,EAAEG,EAAIQ,EAAER,EACRH,EAAEI,EAAIO,EAAEP,EACDJ,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GAClB,IAAIC,EAAK,IAAInB,EAAOC,GAChBmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGf,SAAW,GAAK,UAAa,EAehE,OAdAiB,EAAKC,OAAS,WACZ,GACE,IAEIC,IAFMJ,EAAGf,SAAW,KACbe,EAAGf,SAAW,GAAK,aACF,GAAK,UACf,IAAXmB,GACT,OAAOA,CACT,EACAF,EAAKG,MAAQL,EAAGf,KAChBiB,EAAKI,MAAQJ,EACTD,IACmB,iBAAX,GAAqBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAEI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAK8E,OAAS3D,CAGf,CAvED,CAwEEnB,E,WAEA,O,6BC5E+DH,EAAOD,QAG/D,WAAe,aAEtB,SAASmF,IACP,OAAO,CACT,CACA,SAASC,IACP,OAAO,CACT,CACA,SAASC,IAET,CACA,MAAMC,EAAqB,oCAw2D3B,OA9zDA,SAASC,IAMP,SAASC,EAAc5E,GACrB,MAAoB,iBAANA,GAAwB,OAANA,GAAcA,EAAE6E,cAAgB/C,MAClE,CACA,MAAMgD,EAAS,CAAC,CACdC,KAAM,SACNC,KAAM,SAAUhF,GACd,MAAoB,iBAANA,CAChB,GACC,CACD+E,KAAM,SACNC,KAAM,SAAUhF,GACd,MAAoB,iBAANA,CAChB,GACC,CACD+E,KAAM,UACNC,KAAM,SAAUhF,GACd,MAAoB,kBAANA,CAChB,GACC,CACD+E,KAAM,WACNC,KAAM,SAAUhF,GACd,MAAoB,mBAANA,CAChB,GACC,CACD+E,KAAM,QACNC,KAAMC,MAAMC,SACX,CACDH,KAAM,OACNC,KAAM,SAAUhF,GACd,OAAOA,aAAa2B,IACtB,GACC,CACDoD,KAAM,SACNC,KAAM,SAAUhF,GACd,OAAOA,aAAamF,MACtB,GACC,CACDJ,KAAM,SACNC,KAAMJ,GACL,CACDG,KAAM,OACNC,KAAM,SAAUhF,GACd,OAAa,OAANA,CACT,GACC,CACD+E,KAAM,YACNC,KAAM,SAAUhF,GACd,YAAa8C,IAAN9C,CACT,IAEIoF,EAAU,CACdL,KAAM,MACNC,KAAMT,EACNc,OAAO,GAQT,IAAIC,EACAC,EAGAC,EAAe,EAIfC,EAAQ,CACVC,YAAa,GAUf,SAASC,EAASC,GAChB,MAAMC,EAAOP,EAAQQ,IAAIF,GACzB,GAAIC,EACF,OAAOA,EAGT,IAAIE,EAAU,iBAAmBH,EAAW,IAC5C,MAAMb,EAAOa,EAASI,cACtB,IAAIC,EACJ,IAAKA,KAAaV,EAChB,GAAIU,EAAUD,gBAAkBjB,EAAM,CACpCgB,GAAW,mBAAqBE,EAAY,MAC5C,KACF,CAEF,MAAM,IAAIC,UAAUH,EACtB,CAeA,SAASI,EAASC,GAChB,IAAIC,EAAapE,UAAU1B,OAAS,QAAsBuC,IAAjBb,UAAU,GAAmBA,UAAU,GAAK,MACrF,MAAMqE,EAAcD,EAAaV,EAASU,GAAY1C,MAAQ4B,EAAShF,OACjEgG,EAAW,GACjB,IAAK,IAAIjF,EAAI,EAAGA,EAAI8E,EAAM7F,SAAUe,EAAG,CACrC,IAAK8E,EAAM9E,IAA+B,iBAAlB8E,EAAM9E,GAAGyD,MAA8C,mBAAlBqB,EAAM9E,GAAG0D,KACpE,MAAM,IAAIkB,UAAU,kEAEtB,MAAMN,EAAWQ,EAAM9E,GAAGyD,KAC1B,GAAIO,EAAQkB,IAAIZ,GACd,MAAM,IAAIM,UAAU,wBAA0BN,EAAW,KAE3DW,EAAS/E,KAAKoE,GACdN,EAAQmB,IAAIb,EAAU,CACpBb,KAAMa,EACNZ,KAAMoB,EAAM9E,GAAG0D,KACfK,MAAOe,EAAM9E,GAAG+D,MAChB1B,MAAO2C,EAAchF,EACrBoF,cAAe,IAEnB,CAEA,MAAMC,EAAgBpB,EAAS7D,MAAM4E,GACrCf,EAAWA,EAAS7D,MAAM,EAAG4E,GAAaM,OAAOL,GAAUK,OAAOD,GAElE,IAAK,IAAIrF,EAAIgF,EAAcC,EAAShG,OAAQe,EAAIiE,EAAShF,SAAUe,EACjEgE,EAAQQ,IAAIP,EAASjE,IAAIqC,MAAQrC,CAErC,CAQA,SAASuF,IACPvB,EAAU,IAAIwB,IACdvB,EAAW,GACXC,EAAe,EACfW,EAAS,CAACf,IAAU,EACtB,CAuBA,SAAS2B,EAAcC,GACrB,MAAMC,EAAU1B,EAAS2B,QAAOnC,IAC9B,MAAMc,EAAOP,EAAQQ,IAAIf,GACzB,OAAQc,EAAKR,OAASQ,EAAKb,KAAKgC,EAAM,IAExC,OAAIC,EAAQ1G,OACH0G,EAEF,CAAC,MACV,CAOA,SAASE,EAAgBC,GACvB,OAAOA,GAA4B,mBAAXA,GAAyB,uBAAwBA,CAC3E,CAoCA,SAASC,EAAcC,EAAIC,EAAWC,GACpC,IAAKL,EAAgBG,GACnB,MAAM,IAAIpB,UAAUxB,GAItB,MAAM+C,EAAQD,GAAWA,EAAQC,MAE3BC,EAASC,EADS1C,MAAMC,QAAQqC,GAAaA,EAAUK,KAAK,KAAOL,GAEnEM,EAAqBC,EAAgBJ,GAG3C,IAAKD,GAASI,KAAsBP,EAAGS,WAAY,CAEjD,MAAMC,EAAQV,EAAGW,mBAAmBC,aAAapC,IAAI+B,GACrD,GAAIG,EACF,OAAOA,CAEX,CAMA,MAAMG,EAAUT,EAAOnH,OACvB,IAAI6H,EAiCAC,EAhCJ,GAAIZ,EAAO,CAET,IAAI1C,EACJ,IAAKA,KAFLqD,EAAsB,GAETd,EAAGS,WACdK,EAAoB5G,KAAK8F,EAAGW,mBAAmBC,aAAapC,IAAIf,GAEpE,MACEqD,EAAsBd,EAAGW,mBAAmBF,WAE9C,IAAK,IAAIzG,EAAI,EAAGA,EAAI6G,IAAW7G,EAAG,CAChC,MAAMgH,EAAOZ,EAAOpG,GACdiH,EAAqB,GAC3B,IAAIC,EACJ,IAAKA,KAAeJ,EAAqB,CACvC,MAAMK,EAAOC,EAAgBF,EAAYd,OAAQpG,GACjD,GAAKmH,KAAQH,EAAKK,WAAcF,EAAKE,WAArC,CAGA,IAAKF,EAAKG,OAAQ,CAEhB,MAAMC,EAAYC,EAAaL,GAC/B,GAAIH,EAAKlC,MAAM2C,MAAKC,IAAUH,EAAUrC,IAAIwC,EAAMjE,QAChD,QAEJ,CAEAwD,EAAmB/G,KAAKgH,EATxB,CAUF,CAEA,GADAJ,EAAsBG,EACa,IAA/BH,EAAoB7H,OAAc,KACxC,CAGA,IAAK8H,KAAaD,EAChB,GAAIC,EAAUX,OAAOnH,QAAU4H,EAC7B,OAAOE,EAGX,MAAM,IAAInC,UAAU,oCAAsCoB,EAAGvC,MAAQ,WAAa,IAAM+C,EAAgBJ,EAAQ,MAAQ,KAC1H,CA+DA,SAASI,EAAgBJ,GACvB,IAAIuB,EAAYhH,UAAU1B,OAAS,QAAsBuC,IAAjBb,UAAU,GAAmBA,UAAU,GAAK,IACpF,OAAOyF,EAAOwB,KAAIC,GAAKA,EAAEpE,OAAM6C,KAAKqB,EACtC,CAOA,SAASG,EAAWC,GAClB,MAAMV,EAAqC,IAAzBU,EAAMC,QAAQ,OAE1BC,GADSZ,EAAoBU,EAAM9I,OAAS,EAAI8I,EAAM3H,MAAM,GAAK,MAA5C2H,GACJG,MAAM,KAAKN,KAAIO,GAAK9D,EAAS8D,EAAEC,UACtD,IAAId,GAAS,EACTe,EAAYhB,EAAY,MAAQ,GAapC,MAAO,CACLvC,MAbiBmD,EAASL,KAAI,SAAUrD,GAGxC,OAFA+C,EAAS/C,EAAKR,OAASuD,EACvBe,GAAa9D,EAAKd,KAAO,IAClB,CACLA,KAAMc,EAAKd,KACX6E,UAAW/D,EAAKlC,MAChBqB,KAAMa,EAAKb,KACXK,MAAOQ,EAAKR,MACZwE,WAAY,KACZC,iBAAkB,EAEtB,IAGE/E,KAAM4E,EAAUjI,MAAM,GAAI,GAE1BkH,SACAmB,eAAe,EACfpB,YAEJ,CAQA,SAASqB,EAAYX,GACnB,MACMY,EAmgBR,SAA8BC,GAC5B,GAAyB,IAArBA,EAAU3J,OACZ,MAAO,GAET,MAAM6F,EAAQ8D,EAAUhB,IAAIvD,GACxBuE,EAAU3J,OAAS,GACrB6F,EAAM+D,MAAK,CAACC,EAAIC,IAAOD,EAAGzG,MAAQ0G,EAAG1G,QAEvC,IAAIsD,EAAUb,EAAM,GAAGM,cACvB,GAAyB,IAArBwD,EAAU3J,OACZ,OAAO0G,EAETA,EAAUA,EAAQL,OAAO,IAGzB,MAAM0D,EAAa,IAAIC,IAAIL,GAC3B,IAAK,IAAI5I,EAAI,EAAGA,EAAI8E,EAAM7F,SAAUe,EAAG,CACrC,IAAIkJ,EACJ,IAAKA,KAAYpE,EAAM9E,GAAGoF,cACnB4D,EAAW9D,IAAIgE,EAASC,QAC3BxD,EAAQzF,KAAKgJ,GACbF,EAAWI,IAAIF,EAASC,MAG9B,CACA,OAAOxD,CACT,CA7hB8B0D,CADVtB,EAAMjD,MAAM8C,KAAInJ,GAAKA,EAAEgF,QAEzC,IAAI6D,EAASS,EAAMT,OACfgC,EAAUvB,EAAMtE,KACpB,MAAM8F,EAAmBZ,EAAoBf,KAAI,SAAUW,GACzD,MAAMhE,EAAOF,EAASkE,EAAWY,MAGjC,OAFA7B,EAAS/C,EAAKR,OAASuD,EACvBgC,GAAW,IAAMf,EAAWY,KACrB,CACL1F,KAAM8E,EAAWY,KACjBb,UAAW/D,EAAKlC,MAChBqB,KAAMa,EAAKb,KACXK,MAAOQ,EAAKR,MACZwE,aACAC,gBAAiBD,EAAWlG,MAEhC,IACA,MAAO,CACLyC,MAAOiD,EAAMjD,MAAMQ,OAAOiE,GAC1B9F,KAAM6F,EACNhC,SACAmB,cAAec,EAAiBtK,OAAS,EACzCoI,UAAWU,EAAMV,UAErB,CASA,SAASG,EAAaO,GAKpB,OAJKA,EAAMyB,UACTzB,EAAMyB,QAAU,IAAIP,IACpBlB,EAAMjD,MAAM1C,SAAQmC,GAAQwD,EAAMyB,QAAQJ,IAAI7E,EAAKd,SAE9CsE,EAAMyB,OACf,CASA,SAASnD,EAAeoD,GACtB,MAAMrD,EAAS,GACf,GAA4B,iBAAjBqD,EACT,MAAM,IAAI7E,UAAU,8BAEtB,MAAMqB,EAAYwD,EAAarB,OAC/B,GAAkB,KAAdnC,EACF,OAAOG,EAET,MAAMsD,EAAYzD,EAAUiC,MAAM,KAClC,IAAK,IAAIlI,EAAI,EAAGA,EAAI0J,EAAUzK,SAAUe,EAAG,CACzC,MAAM2J,EAAc7B,EAAW4B,EAAU1J,GAAGoI,QAC5C,GAAIuB,EAAYtC,WAAarH,IAAM0J,EAAUzK,OAAS,EACpD,MAAM,IAAI2K,YAAY,8BAAgCF,EAAU1J,GAA1C,0CAGxB,GAAiC,IAA7B2J,EAAY7E,MAAM7F,OACpB,OAAO,KAETmH,EAAOlG,KAAKyJ,EACd,CACA,OAAOvD,CACT,CAOA,SAASyD,EAAazD,GACpB,MAAM2B,EAAQ+B,EAAK1D,GACnB,QAAO2B,GAAQA,EAAMV,SACvB,CAQA,SAAS0C,EAAYhC,GACnB,GAAKA,GAAgC,IAAvBA,EAAMjD,MAAM7F,OAGnB,IAA2B,IAAvB8I,EAAMjD,MAAM7F,OACrB,OAAOoF,EAAS0D,EAAMjD,MAAM,GAAGrB,MAAMC,KAChC,GAA2B,IAAvBqE,EAAMjD,MAAM7F,OAAc,CACnC,MAAM+K,EAAQ3F,EAAS0D,EAAMjD,MAAM,GAAGrB,MAAMC,KACtCuG,EAAQ5F,EAAS0D,EAAMjD,MAAM,GAAGrB,MAAMC,KAC5C,OAAO,SAAYhF,GACjB,OAAOsL,EAAMtL,IAAMuL,EAAMvL,EAC3B,CACF,CAAO,CAEL,MAAMwL,EAAQnC,EAAMjD,MAAM8C,KAAI,SAAUrD,GACtC,OAAOF,EAASE,EAAKd,MAAMC,IAC7B,IACA,OAAO,SAAYhF,GACjB,IAAK,IAAIsB,EAAI,EAAGA,EAAIkK,EAAMjL,OAAQe,IAChC,GAAIkK,EAAMlK,GAAGtB,GACX,OAAO,EAGX,OAAO,CACT,CACF,EAtBE,OAAOuE,CAuBX,CAOA,SAASkH,EAAa/D,GACpB,IAAI8D,EAAOF,EAAOC,EAClB,GAAIJ,EAAazD,GAAS,CAExB8D,EAAQE,EAAQhE,GAAQwB,IAAImC,GAC5B,MAAMM,EAAWH,EAAMjL,OACjBqL,EAAWP,EAAYD,EAAK1D,IAC5BmE,EAAgB,SAAUC,GAC9B,IAAK,IAAIxK,EAAIqK,EAAUrK,EAAIwK,EAAKvL,OAAQe,IACtC,IAAKsK,EAASE,EAAKxK,IACjB,OAAO,EAGX,OAAO,CACT,EACA,OAAO,SAAkBwK,GACvB,IAAK,IAAIxK,EAAI,EAAGA,EAAIkK,EAAMjL,OAAQe,IAChC,IAAKkK,EAAMlK,GAAGwK,EAAKxK,IACjB,OAAO,EAGX,OAAOuK,EAAcC,IAASA,EAAKvL,QAAUoL,EAAW,CAC1D,CACF,CAEE,OAAsB,IAAlBjE,EAAOnH,OACF,SAAkBuL,GACvB,OAAuB,IAAhBA,EAAKvL,MACd,EAC2B,IAAlBmH,EAAOnH,QAChB+K,EAAQD,EAAY3D,EAAO,IACpB,SAAkBoE,GACvB,OAAOR,EAAMQ,EAAK,KAAuB,IAAhBA,EAAKvL,MAChC,GAC2B,IAAlBmH,EAAOnH,QAChB+K,EAAQD,EAAY3D,EAAO,IAC3B6D,EAAQF,EAAY3D,EAAO,IACpB,SAAkBoE,GACvB,OAAOR,EAAMQ,EAAK,KAAOP,EAAMO,EAAK,KAAuB,IAAhBA,EAAKvL,MAClD,IAGAiL,EAAQ9D,EAAOwB,IAAImC,GACZ,SAAkBS,GACvB,IAAK,IAAIxK,EAAI,EAAGA,EAAIkK,EAAMjL,OAAQe,IAChC,IAAKkK,EAAMlK,GAAGwK,EAAKxK,IACjB,OAAO,EAGX,OAAOwK,EAAKvL,SAAWiL,EAAMjL,MAC/B,EAGN,CAUA,SAASmI,EAAgBhB,EAAQ/D,GAC/B,OAAOA,EAAQ+D,EAAOnH,OAASmH,EAAO/D,GAASwH,EAAazD,GAAU0D,EAAK1D,GAAU,IACvF,CAQA,SAASqE,EAAkBrE,EAAQ/D,GACjC,MAAM0F,EAAQX,EAAgBhB,EAAQ/D,GACtC,OAAK0F,EAGEP,EAAaO,GAFX,IAAIkB,GAGf,CAOA,SAASyB,EAAYnG,GACnB,OAA2B,OAApBA,EAAKgE,iBAA2C/G,IAApB+C,EAAKgE,UAC1C,CASA,SAASoC,EAAoBlE,EAAYpE,GACvC,MAAMmH,EAAU,IAAIP,IAQpB,OAPAxC,EAAWrE,SAAQ6D,IACjB,MAAM2E,EAAWH,EAAkBxE,EAAUG,OAAQ/D,GACrD,IAAIoB,EACJ,IAAKA,KAAQmH,EACXpB,EAAQJ,IAAI3F,EACd,IAEK+F,EAAQtE,IAAI,OAAS,CAAC,OAASvB,MAAMwF,KAAKK,EACnD,CAUA,SAASqB,EAAYpH,EAAM+G,EAAM/D,GAC/B,IAAIqE,EAAKC,EACT,MAAMC,EAAQvH,GAAQ,UAGtB,IACIpB,EADA4I,EAAqBxE,EAEzB,IAAKpE,EAAQ,EAAGA,EAAQmI,EAAKvL,OAAQoD,IAAS,CAC5C,MAAM6I,EAAmB,GAQzB,GAPAD,EAAmB7I,SAAQ6D,IACzB,MACMvC,EAAOqG,EADC3C,EAAgBnB,EAAUG,OAAQ/D,KAE3CA,EAAQ4D,EAAUG,OAAOnH,QAAU4K,EAAa5D,EAAUG,UAAY1C,EAAK8G,EAAKnI,KACnF6I,EAAiBhL,KAAK+F,EACxB,IAE8B,IAA5BiF,EAAiBjM,QAGnB,GADA8L,EAAWJ,EAAoBM,EAAoB5I,GAC/C0I,EAAS9L,OAAS,EAAG,CACvB,MAAMkM,EAAc1F,EAAc+E,EAAKnI,IASvC,OARAyI,EAAM,IAAIlG,UAAU,2CAA6CoG,EAAQ,eAAiBD,EAASzE,KAAK,QAAU,aAAe6E,EAAY7E,KAAK,OAAS,YAAcjE,EAAQ,KACjLyI,EAAIrI,KAAO,CACT2I,SAAU,YACVpF,GAAIgF,EACJ3I,QACAgJ,OAAQF,EACRJ,YAEKD,CACT,OAEAG,EAAqBC,CAEzB,CAGA,MAAMI,EAAUL,EAAmBrD,KAAI,SAAU3B,GAC/C,OAAO4D,EAAa5D,EAAUG,QAAUmF,IAAWtF,EAAUG,OAAOnH,MACtE,IACA,GAAIuL,EAAKvL,OAASuM,KAAKC,IAAIC,MAAM,KAAMJ,GASrC,OARAP,EAAWJ,EAAoBM,EAAoB5I,GACnDyI,EAAM,IAAIlG,UAAU,iCAAmCoG,EAAQ,eAAiBD,EAASzE,KAAK,QAAU,YAAckE,EAAKvL,OAAS,KACpI6L,EAAIrI,KAAO,CACT2I,SAAU,aACVpF,GAAIgF,EACJ3I,MAAOmI,EAAKvL,OACZ8L,YAEKD,EAIT,MAAMa,EAAYH,KAAKI,IAAIF,MAAM,KAAMJ,GACvC,GAAId,EAAKvL,OAAS0M,EAQhB,OAPAb,EAAM,IAAIlG,UAAU,kCAAoCoG,EAAQ,eAAiBW,EAAY,aAAenB,EAAKvL,OAAS,KAC1H6L,EAAIrI,KAAO,CACT2I,SAAU,cACVpF,GAAIgF,EACJ3I,MAAOmI,EAAKvL,OACZ4M,eAAgBF,GAEXb,EAIT,MAAMgB,EAAW,GACjB,IAAK,IAAI9L,EAAI,EAAGA,EAAIwK,EAAKvL,SAAUe,EACjC8L,EAAS5L,KAAKuF,EAAc+E,EAAKxK,IAAIsG,KAAK,MAO5C,OALAwE,EAAM,IAAIlG,UAAU,sBAAwBkH,EAASxF,KAAK,MAAQ,4DAA8D0E,EAAQ,KACxIF,EAAIrI,KAAO,CACT2I,SAAU,WACVC,OAAQS,GAEHhB,CACT,CAOA,SAASiB,EAAmBhE,GAC1B,IAAI0D,EAAMxH,EAAShF,OAAS,EAC5B,IAAK,IAAIe,EAAI,EAAGA,EAAI+H,EAAMjD,MAAM7F,OAAQe,IAClC0K,EAAY3C,EAAMjD,MAAM9E,MAC1ByL,EAAMD,KAAKC,IAAIA,EAAK1D,EAAMjD,MAAM9E,GAAGsI,YAGvC,OAAOmD,CACT,CAQA,SAASO,EAAyBjE,GAChC,IAAI0D,EAAMvH,EAAe,EACzB,IAAK,IAAIlE,EAAI,EAAGA,EAAI+H,EAAMjD,MAAM7F,OAAQe,IACjC0K,EAAY3C,EAAMjD,MAAM9E,MAC3ByL,EAAMD,KAAKC,IAAIA,EAAK1D,EAAMjD,MAAM9E,GAAGwI,kBAGvC,OAAOiD,CACT,CAUA,SAASQ,EAAcC,EAAQC,GAG7B,GAAID,EAAO5E,QACT,IAAK6E,EAAO7E,OACV,OAAO,OAEJ,GAAI6E,EAAO7E,OAChB,OAAQ,EAIV,GAAI4E,EAAO7E,WACT,IAAK8E,EAAO9E,UACV,OAAO,OAEJ,GAAI8E,EAAO9E,UAChB,OAAQ,EAIV,GAAI6E,EAAOzD,eACT,IAAK0D,EAAO1D,cACV,OAAO,OAEJ,GAAI0D,EAAO1D,cAChB,OAAQ,EAIV,MAAM2D,EAAWL,EAAmBG,GAAUH,EAAmBI,GACjE,GAAIC,EAAW,EACb,OAAQ,EAEV,GAAIA,EAAW,EACb,OAAO,EAIT,MAAMC,EAAWL,EAAyBE,GAAUF,EAAyBG,GAC7E,OAAIE,EAAW,GACL,EAENA,EAAW,EACN,EAIF,CACT,CAUA,SAASC,EAAkBC,EAAYC,GACrC,MAAMC,EAAQF,EAAWnG,OACnBsG,EAAQF,EAAWpG,OACnBuG,EAAQ7C,EAAK2C,GACbG,EAAQ9C,EAAK4C,GACbG,EAAWhD,EAAa4C,GACxBK,EAAWjD,EAAa6C,GAG9B,GAAIG,GAAYF,EAAMrF,QACpB,IAAKwF,IAAaF,EAAMtF,OACtB,OAAO,OAEJ,GAAIwF,GAAYF,EAAMtF,OAC3B,OAAQ,EAIV,IAEIyF,EAFAC,EAAO,EACPC,EAAQ,EAEZ,IAAKF,KAAON,EACNM,EAAIzF,UAAU0F,EACdD,EAAItE,iBAAiBwE,EAE3B,IAAIC,EAAO,EACPC,EAAQ,EACZ,IAAKJ,KAAOL,EACNK,EAAIzF,UAAU4F,EACdH,EAAItE,iBAAiB0E,EAE3B,GAAIH,IAASE,EACX,OAAOF,EAAOE,EAIhB,GAAIL,GAAYF,EAAMlE,eACpB,IAAKqE,IAAaF,EAAMnE,cACtB,OAAO,OAEJ,GAAIqE,GAAYF,EAAMnE,cAC3B,OAAQ,EAIV,GAAIwE,IAAUE,EACZ,OAAOF,EAAQE,EAIjB,GAAIN,GACF,IAAKC,EACH,OAAO,OAEJ,GAAIA,EACT,OAAQ,EAIV,MAAMM,GAAmBX,EAAMxN,OAASyN,EAAMzN,SAAW4N,GAAY,EAAI,GACzE,GAAwB,IAApBO,EACF,OAAOA,EAOT,MAAMC,EAAc,GACpB,IAcIzK,EAdA0K,EAAK,EACT,IAAK,IAAItN,EAAI,EAAGA,EAAIyM,EAAMxN,SAAUe,EAAG,CACrC,MAAMuN,EAAiBtB,EAAcQ,EAAMzM,GAAI0M,EAAM1M,IACrDqN,EAAYnN,KAAKqN,GACjBD,GAAMC,CACR,CACA,GAAW,IAAPD,EACF,OAAOA,EAQT,IAAK1K,KAAKyK,EACR,GAAU,IAANzK,EACF,OAAOA,EAKX,OAAO,CACT,CA8CA,SAAS4K,EAAyBpH,EAAQJ,GACxC,IAAIyH,EAAYzH,EAIhB,GAAII,EAAOqB,MAAKI,GAAKA,EAAEY,gBAAgB,CACrC,MAAMpB,EAAYwC,EAAazD,GACzBsH,EAAsBtH,EAAOwB,IAAI+F,GACvCF,EAAY,WACV,MAAMjD,EAAO,GACPV,EAAOzC,EAAY1G,UAAU1B,OAAS,EAAI0B,UAAU1B,OAC1D,IAAK,IAAIe,EAAI,EAAGA,EAAI8J,EAAM9J,IACxBwK,EAAKxK,GAAK0N,EAAoB1N,GAAGW,UAAUX,IAK7C,OAHIqH,IACFmD,EAAKV,GAAQnJ,UAAUmJ,GAAMlC,IAAI8F,EAAoB5D,KAEhD9D,EAAG0F,MAAMxN,KAAMsM,EACxB,CACF,CACA,IAAIoD,EAAeH,EACnB,GAAI5D,EAAazD,GAAS,CACxB,MAAMyH,EAASzH,EAAOnH,OAAS,EAC/B2O,EAAe,WACb,OAAOH,EAAU/B,MAAMxN,KAAMkC,EAAMO,UAAW,EAAGkN,GAAQvI,OAAO,CAAClF,EAAMO,UAAWkN,KACpF,CACF,CACA,OAAOD,CACT,CAQA,SAASD,EAAqB5F,GAC5B,IAAIiC,EAAOC,EAAO6D,EAAaC,EAC/B,MAAM7D,EAAQ,GACR8D,EAAc,GASpB,OARAjG,EAAMjD,MAAM1C,SAAQ,SAAUmC,GACxBA,EAAKgE,aACP2B,EAAMhK,KAAKmE,EAASE,EAAKgE,WAAWY,MAAMzF,MAC1CsK,EAAY9N,KAAKqE,EAAKgE,WAAW0F,SAErC,IAGQD,EAAY/O,QAClB,KAAK,EACH,OAAO,SAAoBiP,GACzB,OAAOA,CACT,EACF,KAAK,EAGH,OAFAlE,EAAQE,EAAM,GACd4D,EAAcE,EAAY,GACnB,SAAoBE,GACzB,OAAIlE,EAAMkE,GACDJ,EAAYI,GAEdA,CACT,EACF,KAAK,EAKH,OAJAlE,EAAQE,EAAM,GACdD,EAAQC,EAAM,GACd4D,EAAcE,EAAY,GAC1BD,EAAcC,EAAY,GACnB,SAAoBE,GACzB,OAAIlE,EAAMkE,GACDJ,EAAYI,GAEjBjE,EAAMiE,GACDH,EAAYG,GAEdA,CACT,EACF,QACE,OAAO,SAAoBA,GACzB,IAAK,IAAIlO,EAAI,EAAGA,EAAIgO,EAAY/O,OAAQe,IACtC,GAAIkK,EAAMlK,GAAGkO,GACX,OAAOF,EAAYhO,GAAGkO,GAG1B,OAAOA,CACT,EAEN,CAmBA,SAASC,EAAY/H,GAyCnB,OAxCA,SAASgI,EAAahI,EAAQ/D,EAAOgM,GACnC,GAAIhM,EAAQ+D,EAAOnH,OAAQ,CACzB,MAAM8I,EAAQ3B,EAAO/D,GACrB,IAAIiM,EAAkB,GACtB,GAAIvG,EAAMV,UAAW,CAGnB,MAAMkH,EAAaxG,EAAMjD,MAAMc,OAAO8E,GAClC6D,EAAWtP,OAAS8I,EAAMjD,MAAM7F,QAClCqP,EAAgBpO,KAAK,CACnB4E,MAAOyJ,EACP9K,KAAM,MAAQ8K,EAAW3G,KAAInJ,GAAKA,EAAEgF,OAAM6C,KAAK,KAC/CgB,OAAQiH,EAAW9G,MAAKhJ,GAAKA,EAAEsF,QAC/B0E,eAAe,EACfpB,WAAW,IAGfiH,EAAgBpO,KAAK6H,EACvB,MAEEuG,EAAkBvG,EAAMjD,MAAM8C,KAAI,SAAUrD,GAC1C,MAAO,CACLO,MAAO,CAACP,GACRd,KAAMc,EAAKd,KACX6D,OAAQ/C,EAAKR,MACb0E,cAAelE,EAAKgE,WACpBlB,WAAW,EAEf,IAIF,OA0ZWmH,EA1ZIF,EA0ZCG,EA1ZgB,SAAUC,GACxC,OAAON,EAAahI,EAAQ/D,EAAQ,EAAGgM,EAAY/I,OAAO,CAACoJ,IAC7D,EAyZG/K,MAAM7C,UAAUwE,OAAOoG,MAAM,GAAI8C,EAAI5G,IAAI6G,GAxZ9C,CAuZJ,IAAiBD,EAAKC,EArZhB,MAAO,CAACJ,EAEZ,CACOD,CAAahI,EAAQ,EAAG,GACjC,CAQA,SAASuI,EAAYC,EAASC,GAC5B,MAAMC,EAAKtD,KAAKI,IAAIgD,EAAQ3P,OAAQ4P,EAAQ5P,QAC5C,IAAK,IAAIe,EAAI,EAAGA,EAAI8O,EAAI9O,IAAK,CAC3B,MAAM+O,EAAWtE,EAAkBmE,EAAS5O,GACtCgP,EAAWvE,EAAkBoE,EAAS7O,GAC5C,IACIyD,EADAwL,GAAU,EAEd,IAAKxL,KAAQuL,EACX,GAAID,EAAS7J,IAAIzB,GAAO,CACtBwL,GAAU,EACV,KACF,CAEF,IAAKA,EACH,OAAO,CAEX,CACA,MAAMC,EAAON,EAAQ3P,OACfkQ,EAAON,EAAQ5P,OACfmQ,EAAavF,EAAa+E,GAC1BS,EAAaxF,EAAagF,GAChC,OAAOO,EAAaC,EAAaH,IAASC,EAAOA,GAAQD,EAAOG,EAAaH,GAAQC,EAAOD,IAASC,CACvG,CAiCA,SAASG,EAAmBC,EAAYC,EAAc5I,GACpD,MAAM6I,EAAqB,GAC3B,IAAIC,EACJ,IAAKA,KAAaH,EAAY,CAC5B,IAAII,EAAa/I,EAAa8I,GAC9B,GAA0B,iBAAfC,EACT,MAAM,IAAI/K,UAAU,2CAA6C8K,EAAY,KAG/E,GADAC,EAAaH,EAAaG,GACA,mBAAfA,EACT,OAAO,EAETF,EAAmBvP,KAAKyP,EAC1B,CACA,OAAOF,CACT,CAaA,SAASG,EAAkBJ,EAAc5I,EAAciJ,GACrD,MAAMC,EApDR,SAA0BN,GACxB,OAAOA,EAAa5H,KAAI5B,GAClB+J,EAAc/J,GACTgK,EAAYhK,EAAGgK,YAAYvB,UAEhCwB,EAAUjK,GACLkK,EAAYlK,EAAGmK,QAAQZ,WAAYvJ,EAAGmK,QAAQ1B,UAEhDzI,GAEX,CA0C4BoK,CAAiBZ,GACrCa,EAAa,IAAI1M,MAAMmM,EAAkB7Q,QAAQqR,MAAK,GAC5D,IAAIC,GAAiB,EACrB,KAAOA,GAAgB,CACrBA,GAAiB,EACjB,IAAIC,GAAkB,EACtB,IAAK,IAAIxQ,EAAI,EAAGA,EAAI8P,EAAkB7Q,SAAUe,EAAG,CACjD,GAAIqQ,EAAWrQ,GAAI,SACnB,MAAMgG,EAAK8J,EAAkB9P,GAC7B,GAAI+P,EAAc/J,GAChB8J,EAAkB9P,GAAKgG,EAAGgK,YAAYvB,SAASoB,GAE/CC,EAAkB9P,GAAGgQ,YAAchK,EAAGgK,YACtCK,EAAWrQ,IAAK,EAChBwQ,GAAkB,OACb,GAAIP,EAAUjK,GAAK,CACxB,MAAMyJ,EAAqBH,EAAmBtJ,EAAGmK,QAAQZ,WAAYO,EAAmBlJ,GACpF6I,GACFK,EAAkB9P,GAAKgG,EAAGmK,QAAQ1B,SAAS/C,MAAMxN,KAAMuR,GAEvDK,EAAkB9P,GAAGmQ,QAAUnK,EAAGmK,QAClCE,EAAWrQ,IAAK,EAChBwQ,GAAkB,GAElBD,GAAiB,CAErB,CACF,CACA,GAAIC,GAAmBD,EACrB,MAAM,IAAI3G,YAAY,yDAE1B,CACA,OAAOkG,CACT,CAgCA,SAASW,EAAoBhN,EAAMiN,GAEjC,GADAvM,EAAMC,cACuC,IAAzC5D,OAAOyB,KAAKyO,GAAkBzR,OAChC,MAAM,IAAI2K,YAAY,0BAEpBzF,EAAMwM,2BA5BZ,SAAgCC,GAI9B,MAAMC,EAAsB,4BAC5BrQ,OAAOyB,KAAK2O,GAAexO,SAAQ6D,IACjC,MAAMD,EAAK4K,EAAc3K,GACzB,GAAI4K,EAAoBnN,KAAKsC,EAAG8K,YAC9B,MAAM,IAAIlH,YAAY,mIACxB,GAEJ,CAkBImH,CAAuBL,GAIzB,MAAMM,EAAe,GACfC,EAAoB,GACpBL,EAAgB,CAAC,EACjBM,EAAwB,GAC9B,IAAIjL,EACJ,IAAKA,KAAayK,EAAkB,CAElC,IAAKlQ,OAAOM,UAAUC,eAAeC,KAAK0P,EAAkBzK,GAC1D,SAGF,MAAMG,EAASC,EAAeJ,GAC9B,IAAKG,EAAQ,SAEb4K,EAAa5O,SAAQ,SAAU+O,GAC7B,GAAIxC,EAAYwC,EAAI/K,GAClB,MAAM,IAAIxB,UAAU,2BAA6B4B,EAAgB2K,GAAM,UAAY3K,EAAgBJ,GAAU,KAEjH,IACA4K,EAAa9Q,KAAKkG,GAElB,MAAMgL,EAAgBH,EAAkBhS,OACxCgS,EAAkB/Q,KAAKwQ,EAAiBzK,IACxC,MAAMoL,EAAmBjL,EAAOwB,IAAIc,GAEpC,IAAI4I,EACJ,IAAKA,KAAMnD,EAAYkD,GAAmB,CACxC,MAAME,EAAS/K,EAAgB8K,GAC/BJ,EAAsBhR,KAAK,CACzBkG,OAAQkL,EACR7N,KAAM8N,EACNvL,GAAIoL,IAEFE,EAAGE,OAAM3J,IAAMA,EAAEY,kBACnBmI,EAAcW,GAAUH,EAE5B,CACF,CACAF,EAAsBrI,KAAKyD,GAG3B,MAAMwD,EAAoBF,EAAkBqB,EAAmBL,EAAea,IAG9E,IAAItJ,EACJ,IAAKA,KAAKyI,EACJpQ,OAAOM,UAAUC,eAAeC,KAAK4P,EAAezI,KACtDyI,EAAczI,GAAK2H,EAAkBc,EAAczI,KAGvD,MAAM1B,EAAa,GACbiL,EAAuB,IAAIlM,IACjC,IAAK2C,KAAK+I,EAIHQ,EAAqBxM,IAAIiD,EAAE1E,QAC9B0E,EAAEnC,GAAK8J,EAAkB3H,EAAEnC,IAC3BS,EAAWvG,KAAKiI,GAChBuJ,EAAqBvM,IAAIgD,EAAE1E,KAAM0E,IAKrC,MAAMwJ,EAAMlL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvFwL,EAAMnL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvFyL,EAAMpL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvF0L,EAAMrL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvF2L,EAAMtL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvF4L,EAAMvL,EAAW,IAAMA,EAAW,GAAGL,OAAOnH,QAAU,IAAM4K,EAAapD,EAAW,GAAGL,QACvF6L,EAAQN,GAAOC,GAAOC,GAAOC,GAAOC,GAAOC,EAGjD,IAAK,IAAIhS,EAAI,EAAGA,EAAIyG,EAAWxH,SAAUe,EACvCyG,EAAWzG,GAAG0D,KAAOyG,EAAa1D,EAAWzG,GAAGoG,QAElD,MAAM8L,EAASP,EAAM5H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDiP,EAASP,EAAM7H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDkP,EAASP,EAAM9H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDmP,EAASP,EAAM/H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDoP,EAASP,EAAMhI,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDqP,EAASP,EAAMjI,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDsP,EAASb,EAAM5H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDuP,EAASb,EAAM7H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDwP,EAASb,EAAM9H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtDyP,EAASb,EAAM/H,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtD0P,EAASb,EAAMhI,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EACtD2P,EAASb,EAAMjI,EAAYtD,EAAW,GAAGL,OAAO,IAAMlD,EAG5D,IAAK,IAAIlD,EAAI,EAAGA,EAAIyG,EAAWxH,SAAUe,EACvCyG,EAAWzG,GAAG8S,eAAiBtF,EAAyB/G,EAAWzG,GAAGoG,OAAQK,EAAWzG,GAAGgG,IAE9F,MAAM+M,EAAMpB,EAAMlL,EAAW,GAAGqM,eAAiB3P,EAC3C6P,EAAMpB,EAAMnL,EAAW,GAAGqM,eAAiB3P,EAC3C8P,EAAMpB,EAAMpL,EAAW,GAAGqM,eAAiB3P,EAC3C+P,EAAMpB,EAAMrL,EAAW,GAAGqM,eAAiB3P,EAC3CgQ,EAAMpB,EAAMtL,EAAW,GAAGqM,eAAiB3P,EAC3CiQ,EAAMpB,EAAMvL,EAAW,GAAGqM,eAAiB3P,EAC3CkQ,EAAO1B,EAAMlL,EAAW,GAAGL,OAAOnH,QAAU,EAC5CiQ,EAAO0C,EAAMnL,EAAW,GAAGL,OAAOnH,QAAU,EAC5CkQ,EAAO0C,EAAMpL,EAAW,GAAGL,OAAOnH,QAAU,EAC5CqU,EAAOxB,EAAMrL,EAAW,GAAGL,OAAOnH,QAAU,EAC5CsU,GAAOxB,EAAMtL,EAAW,GAAGL,OAAOnH,QAAU,EAC5CuU,GAAOxB,EAAMvL,EAAW,GAAGL,OAAOnH,QAAU,EAG5CwU,GAASxB,EAAQ,EAAI,EACrByB,GAAOjN,EAAWxH,OAElBiL,GAAQzD,EAAWmB,KAAIO,GAAKA,EAAEzE,OAC9BiQ,GAAMlN,EAAWmB,KAAIO,GAAKA,EAAE2K,iBAC5Bc,GAAU,WAEd,IAAK,IAAI5T,EAAIyT,GAAQzT,EAAI0T,GAAM1T,IAC7B,GAAIkK,GAAMlK,GAAGW,WACX,OAAOgT,GAAI3T,GAAG0L,MAAMxN,KAAMyC,WAG9B,OAAOwD,EAAM0P,WAAWpQ,EAAM9C,UAAW8F,EAC3C,EAIA,SAASgL,GAAWqC,EAAMC,GAExB,OAAIpT,UAAU1B,SAAWoU,GAAQnB,EAAO4B,IAAStB,EAAOuB,GAC/ChB,EAAIrH,MAAMxN,KAAMyC,WAErBA,UAAU1B,SAAWiQ,GAAQiD,EAAO2B,IAASrB,EAAOsB,GAC/Cf,EAAItH,MAAMxN,KAAMyC,WAErBA,UAAU1B,SAAWkQ,GAAQiD,EAAO0B,IAASpB,EAAOqB,GAC/Cd,EAAIvH,MAAMxN,KAAMyC,WAErBA,UAAU1B,SAAWqU,GAAQjB,EAAOyB,IAASnB,EAAOoB,GAC/Cb,EAAIxH,MAAMxN,KAAMyC,WAErBA,UAAU1B,SAAWsU,IAAQjB,EAAOwB,IAASlB,EAAOmB,GAC/CZ,EAAIzH,MAAMxN,KAAMyC,WAErBA,UAAU1B,SAAWuU,IAAQjB,EAAOuB,IAASjB,EAAOkB,GAC/CX,EAAI1H,MAAMxN,KAAMyC,WAElBiT,GAAQlI,MAAMxN,KAAMyC,UAC7B,CAGA,IACEH,OAAOwT,eAAevC,GAAY,OAAQ,CACxC/L,MAAOjC,GAEX,CAAE,MAAOqH,GAIT,CAaA,OARA2G,GAAWhL,WAAamK,EAIxBa,GAAW9K,mBAAqB,CAC9BF,aACAG,aAAc8K,GAETD,EACT,CAQA,SAASwC,EAAYxQ,EAAM+G,EAAM/D,GAC/B,MAAMoE,EAAYpH,EAAM+G,EAAM/D,EAChC,CAOA,SAAS2D,EAAQoE,GACf,OAAOpO,EAAMoO,EAAK,EAAGA,EAAIvP,OAAS,EACpC,CAOA,SAAS6K,EAAK0E,GACZ,OAAOA,EAAIA,EAAIvP,OAAS,EAC1B,CASA,SAASmB,EAAMoO,EAAK0F,EAAOC,GACzB,OAAOxQ,MAAM7C,UAAUV,MAAMY,KAAKwN,EAAK0F,EAAOC,EAChD,CAgDA,SAASjE,EAAYX,EAAYd,GAC/B,MAAO,CACL0B,QAAS,CACPZ,aACAd,YAGN,CAQA,SAASuB,EAAYvB,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAI7J,UAAU,gDAEtB,MAAO,CACLoL,YAAa,CACXvB,YAGN,CASA,SAASwB,EAAUmE,GACjB,OAAOA,GAA4C,iBAAvBA,EAAWjE,SAAwBxM,MAAMC,QAAQwQ,EAAWjE,QAAQZ,aAAsD,mBAAhC6E,EAAWjE,QAAQ1B,QAC3I,CASA,SAASsB,EAAcqE,GACrB,OAAOA,GAAgD,iBAA3BA,EAAWpE,aAAuE,mBAApCoE,EAAWpE,YAAYvB,QACnG,CAUA,SAAS4F,EAAUC,EAAWhL,GAC5B,IAAKgL,EACH,OAAOhL,EAET,GAAIA,GAAWA,IAAYgL,EAAW,CACpC,MAAMxJ,EAAM,IAAIyJ,MAAM,0CAA4CD,EAAY,aAAehL,EAAU,KAKvG,MAJAwB,EAAIrI,KAAO,CACT4I,OAAQ/B,EACRyB,SAAUuJ,GAENxJ,CACR,CACA,OAAOwJ,CACT,CAQA,SAASE,EAAcC,GACrB,IAAIhR,EACJ,IAAK,MAAM5C,KAAO4T,EAGZjU,OAAOM,UAAUC,eAAeC,KAAKyT,EAAK5T,KAASgF,EAAgB4O,EAAI5T,KAAuC,iBAAvB4T,EAAI5T,GAAKoF,aAClGxC,EAAO4Q,EAAU5Q,EAAMgR,EAAI5T,GAAK4C,OAGpC,OAAOA,CACT,CASA,SAASiR,EAAgBC,EAAM/T,GAC7B,IAAIC,EACJ,IAAKA,KAAOD,EACV,GAAIJ,OAAOM,UAAUC,eAAeC,KAAKJ,EAAQC,GAAM,CACrD,GAAIA,KAAO8T,GACL/T,EAAOC,KAAS8T,EAAK9T,GAAM,CAC7B,MAAMiK,EAAM,IAAIyJ,MAAM,cAAgB1T,EAAM,sBAM5C,MALAiK,EAAIrI,KAAO,CACTwD,UAAWpF,EACX+T,eAAgBhU,EAAOC,GACvBgU,aAAcF,EAAK9T,IAEfiK,CACR,CAGF6J,EAAK9T,GAAOD,EAAOC,EACrB,CAEJ,CA78CA0E,IACAV,EAASrB,GA68CT,MAAMsR,EAAY3Q,EAwGlB,SAAS4Q,GAAoBxM,GAC3B,IAAKA,GAAyC,iBAApBA,EAAWY,MAA8C,iBAAlBZ,EAAWyM,IAAiD,mBAAvBzM,EAAW0F,QAC/G,MAAM,IAAIrJ,UAAU,iFAEtB,GAAI2D,EAAWyM,KAAOzM,EAAWY,KAC/B,MAAM,IAAIS,YAAY,sCAAwCrB,EAAWY,KAAO,eAEpF,CA4FA,OAnLAhF,EAAQ,SAAU8Q,GAChB,MAAMC,EAA6B,iBAAdD,EAErB,IAAIxR,EAAOyR,EAAQD,EAAY,GAC/B,MAAME,EAAgB,CAAC,EACvB,IAAK,IAAInV,EAHKkV,EAAQ,EAAI,EAGNlV,EAAIW,UAAU1B,SAAUe,EAAG,CAC7C,MAAMoV,EAAOzU,UAAUX,GACvB,IACIqV,EADAC,EAAkB,CAAC,EAkBvB,GAhBoB,mBAATF,GACTC,EAAWD,EAAK3R,KACc,iBAAnB2R,EAAKnP,UAEdqP,EAAgBF,EAAKnP,WAAamP,EACzBvP,EAAgBuP,KAEzBE,EAAkBF,EAAK3O,aAEhBnD,EAAc8R,KAEvBE,EAAkBF,EACbF,IACHG,EAAWb,EAAcY,KAGe,IAAxC5U,OAAOyB,KAAKqT,GAAiBrW,OAAc,CAC7C,MAAM6L,EAAM,IAAIlG,UAAU,gCAAoC5E,EAApC,8FAK1B,MAJA8K,EAAIrI,KAAO,CACTJ,MAAOrC,EACPuV,SAAUH,GAENtK,CACR,CACKoK,IACHzR,EAAO4Q,EAAU5Q,EAAM4R,IAEzBX,EAAgBS,EAAeG,EACjC,CACA,OAAO7E,EAAoBhN,GAAQ,GAAI0R,EACzC,EACAhR,EAAMd,OAASA,EACfc,EAAMC,YAAc0Q,EAAU1Q,YAC9BD,EAAM0P,WAAaI,EACnB9P,EAAMqR,mBAAqBvB,EAC3B9P,EAAM0G,YAAcA,EACpB1G,EAAMoB,MAAQA,EACdpB,EAAMsR,iBA9gDN,WACE,IAAInR,EACJ,IAAKA,KAAYL,EACfD,EAAQQ,IAAIF,GAAUc,cAAgB,GAExClB,EAAe,CACjB,EAygDAC,EAAMU,SAAWA,EACjBV,EAAMuR,UAAYrR,EAClBF,EAAMgM,QArMN,WACE,MAAMZ,EAAanF,EAAQzJ,WAAWiH,KAAIO,GAAK3B,EAAgBH,EAAe8B,MACxEsG,EAAW3E,EAAKnJ,WACtB,GAAwB,mBAAb8N,EACT,MAAM,IAAI7J,UAAU,+CAEtB,OAAOsL,EAAYX,EAAYd,EACjC,EA+LAtK,EAAM6L,YAAcA,EACpB7L,EAAM8J,QAx2CN,SAAiBvI,EAAOpB,GAEtB,MAAMC,EAAOF,EAASC,GACtB,GAAIC,EAAKb,KAAKgC,GACZ,OAAOA,EAET,MAAMsI,EAAczJ,EAAKa,cACzB,GAA2B,IAAvB4I,EAAY/O,OACd,MAAM,IAAIsV,MAAM,+BAAiCjQ,EAAW,aAE9D,IAAK,IAAItE,EAAI,EAAGA,EAAIgO,EAAY/O,OAAQe,IAEtC,GADiBqE,EAAS2J,EAAYhO,GAAGmJ,MAC5BzF,KAAKgC,GAChB,OAAOsI,EAAYhO,GAAGiO,QAAQvI,GAGlC,MAAM,IAAI6O,MAAM,kBAAoB7O,EAAQ,OAASpB,EACvD,EAw1CAH,EAAM4B,cAAgBA,EACtB5B,EAAMwR,KAp3CN,SAAc3P,EAAIC,EAAWC,GAC3B,OAAOH,EAAcC,EAAIC,EAAWC,GAAS4M,cAC/C,EAm3CA3O,EAAM0B,gBAAkBA,EACxB1B,EAAMwM,2BAA4B,EAUlCxM,EAAMyR,QAAU,SAAUrR,EAAMsR,GAC9B,IAAIC,EAAS,OACY,IAArBD,GAA8B7R,EAAQkB,IAAI,YAC5C4Q,EAAS,UAEX3R,EAAMU,SAAS,CAACN,GAAOuR,EACzB,EA0BA3R,EAAM4R,cAAgB,SAAUxN,GAC9B,IAAIrC,EAAUvF,UAAU1B,OAAS,QAAsBuC,IAAjBb,UAAU,GAAmBA,UAAU,GAAK,CAChFqV,UAAU,GAEZjB,GAAoBxM,GACpB,MAAMyM,EAAK3Q,EAASkE,EAAWyM,IACzBiB,EAAWjB,EAAG5P,cAAcuQ,MAAKO,GAASA,EAAM/M,OAASZ,EAAWY,OAC1E,GAAI8M,EAAU,CACZ,IAAI/P,IAAWA,EAAQ8P,SAOrB,MAAM,IAAIzB,MAAM,uCAAyChM,EAAWY,KAAO,SAAW6L,EAAGvR,KAAO,KANhGU,EAAMgS,iBAAiB,CACrBhN,KAAM8M,EAAS9M,KACf6L,GAAIzM,EAAWyM,GACf/G,QAASgI,EAAShI,SAKxB,CACA+G,EAAG5P,cAAclF,KAAK,CACpBiJ,KAAMZ,EAAWY,KACjB8E,QAAS1F,EAAW0F,QACpB5L,MAAO6B,KAEX,EAUAC,EAAMiS,eAAiB,SAAUpI,EAAa9H,GAC5C8H,EAAY5L,SAAQmG,GAAcpE,EAAM4R,cAAcxN,EAAYrC,IACpE,EAWA/B,EAAMgS,iBAAmB,SAAU5N,GACjCwM,GAAoBxM,GACpB,MAAMyM,EAAK3Q,EAASkE,EAAWyM,IACzBqB,EArUR,SAAqB7H,EAAK9K,GACxB,IAAK,IAAI1D,EAAI,EAAGA,EAAIwO,EAAIvP,OAAQe,IAC9B,GAAI0D,EAAK8K,EAAIxO,IACX,OAAOwO,EAAIxO,EAIjB,CA8T6BsW,CAAYtB,EAAG5P,eAAexC,GAAKA,EAAEuG,OAASZ,EAAWY,OACpF,IAAKkN,EACH,MAAM,IAAI9B,MAAM,iDAAmDhM,EAAWY,KAAO,OAASZ,EAAWyM,IAE3G,GAAIqB,EAAmBpI,UAAY1F,EAAW0F,QAC5C,MAAM,IAAIsG,MAAM,2DAElB,MAAMlS,EAAQ2S,EAAG5P,cAAc4C,QAAQqO,GACvCrB,EAAG5P,cAAcmR,OAAOlU,EAAO,EACjC,EAYA8B,EAAMqS,QAAU,SAAUC,EAAIC,GAC5B,IAAK7Q,EAAgB4Q,GACnB,MAAM,IAAI7R,UAAUxB,GAEtB,MAAMuT,EAAOF,EAAG9P,mBAAmBF,WACnC,IAAK,IAAIzG,EAAI,EAAGA,EAAI2W,EAAK1X,SAAUe,EACjC,GAAI2W,EAAK3W,GAAG0D,KAAKgT,GACf,OAAOC,EAAK3W,GAGhB,OAAO,IACT,EACOmE,CACT,CACoBd,EAIrB,CAx3DiFxF,E,gBCWlF,IAAIkF,EAAO,EAAQ,KAKfC,EAAS,EAAQ,KAKjBlD,EAAS,EAAQ,IAQjBQ,EAAY,EAAQ,IASpBsW,EAAU,EAAQ,KAOlBC,EAAS,EAAQ,KAIjBC,EAAK,EAAQ,KAEjBA,EAAG/T,KAAOA,EACV+T,EAAG9T,OAASA,EACZ8T,EAAGhX,OAASA,EACZgX,EAAGxW,UAAYA,EACfwW,EAAGF,QAAUA,EACbE,EAAGD,OAASA,EAEZ9Y,EAAOD,QAAUgZ,C,UC3DjB,SAASC,IAGT,CAEAA,EAAEjW,UAAY,CACZkW,GAAI,SAAUvT,EAAMgL,EAAUwI,GAC5B,IAAIC,EAAIhZ,KAAKgZ,IAAMhZ,KAAKgZ,EAAI,CAAC,GAO7B,OALCA,EAAEzT,KAAUyT,EAAEzT,GAAQ,KAAKvD,KAAK,CAC/B8F,GAAIyI,EACJwI,IAAKA,IAGA/Y,IACT,EAEAiZ,KAAM,SAAU1T,EAAMgL,EAAUwI,GAC9B,IAAIpH,EAAO3R,KACX,SAASkZ,IACPvH,EAAKwH,IAAI5T,EAAM2T,GACf3I,EAAS/C,MAAMuL,EAAKtW,UACtB,CAGA,OADAyW,EAASjW,EAAIsN,EACNvQ,KAAK8Y,GAAGvT,EAAM2T,EAAUH,EACjC,EAEAK,KAAM,SAAU7T,GAMd,IALA,IAAIhB,EAAO,GAAGrC,MAAMY,KAAKL,UAAW,GAChC4W,IAAWrZ,KAAKgZ,IAAMhZ,KAAKgZ,EAAI,CAAC,IAAIzT,IAAS,IAAIrD,QACjDJ,EAAI,EACJwX,EAAMD,EAAOtY,OAETe,EAAIwX,EAAKxX,IACfuX,EAAOvX,GAAGgG,GAAG0F,MAAM6L,EAAOvX,GAAGiX,IAAKxU,GAGpC,OAAOvE,IACT,EAEAmZ,IAAK,SAAU5T,EAAMgL,GACnB,IAAIyI,EAAIhZ,KAAKgZ,IAAMhZ,KAAKgZ,EAAI,CAAC,GACzBO,EAAOP,EAAEzT,GACTiU,EAAa,GAEjB,GAAID,GAAQhJ,EACV,IAAK,IAAIzO,EAAI,EAAGwX,EAAMC,EAAKxY,OAAQe,EAAIwX,EAAKxX,IACtCyX,EAAKzX,GAAGgG,KAAOyI,GAAYgJ,EAAKzX,GAAGgG,GAAG7E,IAAMsN,GAC9CiJ,EAAWxX,KAAKuX,EAAKzX,IAY3B,OAJC0X,EAAiB,OACdR,EAAEzT,GAAQiU,SACHR,EAAEzT,GAENvF,IACT,GAGFH,EAAOD,QAAUiZ,EACjBhZ,EAAOD,QAAQ6Z,YAAcZ,C,sBClE7B,OAIA,SAAU5Y,EAAQJ,GAElB,SAASK,EAAOC,GACd,IAAIC,EAAKJ,KAAMK,EAAU,GAGzBD,EAAGE,KAAO,WACR,IAAIoZ,EAAItZ,EAAGsZ,EAAGhV,EAAItE,EAAGsE,EAAG7D,EAAIT,EAAGS,EAAG8Y,EAAIvZ,EAAGuZ,EAQzC,OAPAD,EAAKA,GAAK,GAAOA,IAAM,EAAKhV,EAC5BA,EAAKA,EAAI7D,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAK8Y,EAC5BA,EAAKA,EAAID,EAAK,EACdtZ,EAAGsZ,EAAIA,EAAKA,GAAK,GAAOA,IAAM,GAAMhV,EACpCtE,EAAGsE,EAAIA,EAAKA,EAAI7D,EAAK,EACrBT,EAAGS,EAAKA,GAAK,GAAO6D,IAAM,GAAMiV,EACzBvZ,EAAGuZ,EAAKA,EAAID,EAAK,CAC1B,EAkBAtZ,EAAGuZ,EAAI,EACPvZ,EAAGsZ,EAAI,EACPtZ,EAAGsE,GAAI,WACPtE,EAAGS,EAAI,WAEHV,IAASmN,KAAKsM,MAAMzZ,IAEtBC,EAAGuZ,EAAKxZ,EAAO,WAAe,EAC9BC,EAAGsZ,EAAW,EAAPvZ,GAGPE,GAAWF,EAIb,IAAK,IAAIW,EAAI,EAAGA,EAAIT,EAAQU,OAAS,GAAID,IACvCV,EAAGsZ,GAA6B,EAAxBrZ,EAAQW,WAAWF,GAC3BV,EAAGE,MAEP,CAEA,SAASW,EAAKC,EAAGX,GAKf,OAJAA,EAAEoZ,EAAIzY,EAAEyY,EACRpZ,EAAEmZ,EAAIxY,EAAEwY,EACRnZ,EAAEmE,EAAIxD,EAAEwD,EACRnE,EAAEM,EAAIK,EAAEL,EACDN,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GAClB,IAAIC,EAAK,IAAInB,EAAOC,GAChBmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGf,SAAW,GAAK,UAAa,EAehE,OAdAiB,EAAKC,OAAS,WACZ,GACE,IAEIC,IAFMJ,EAAGf,SAAW,KACbe,EAAGf,SAAW,GAAK,aACF,GAAK,UACf,IAAXmB,GACT,OAAOA,CACT,EACAF,EAAKG,MAAQL,EAAGf,KAChBiB,EAAKI,MAAQJ,EACTD,IACmB,iBAAX,GAAqBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAEI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAK2Y,OAASxX,CAGf,CA5FD,CA6FEnB,E,WAEA,O,sBCnGF,OAwBA,SAAWC,EAAQ4Z,EAAMC,GAKzB,IAQIC,EARAC,EAAQ,IAIRC,EAAaH,EAAKI,IAAIF,EAHb,GAITG,EAAeL,EAAKI,IAAI,EAHf,IAITE,EAA0B,EAAfD,EACXE,EAAOL,IAOX,SAASM,EAAWna,EAAM6H,EAASuI,GACjC,IAAI5N,EAAM,GAIN4X,EAAYC,EAAOC,GAHvBzS,EAAsB,GAAXA,EAAmB,CAAE0S,SAAS,GAAU1S,GAAW,CAAC,GAIrD0S,QAAU,CAACva,EAAMwa,EAASd,IACzB,MAAR1Z,EA8IL,WACE,IACE,IAAIya,EAQJ,OAPIb,IAAea,EAAMb,EAAWc,aAElCD,EAAMA,EAAIZ,IAEVY,EAAM,IAAIE,WAAWd,IACpB/Z,EAAO8a,QAAU9a,EAAO+a,UAAUC,gBAAgBL,IAE9CD,EAASC,EAClB,CAAE,MAAO5B,GACP,IAAIkC,EAAUjb,EAAOkb,UACjBC,EAAUF,GAAWA,EAAQE,QACjC,MAAO,EAAE,IAAIjZ,KAAMlC,EAAQmb,EAASnb,EAAOob,OAAQV,EAASd,GAC9D,CACF,CA9JqByB,GAAanb,EAAM,GAAIwC,GAGtC4Y,EAAO,IAAIC,EAAK7Y,GAIhBpB,EAAO,WAIT,IAHA,IAAI8C,EAAIkX,EAAKE,EA5BJ,GA6BL5a,EAAIoZ,EACJzZ,EAAI,EACD6D,EAAI8V,GACT9V,GAAKA,EAAI7D,GAAKwZ,EACdnZ,GAAKmZ,EACLxZ,EAAI+a,EAAKE,EAAE,GAEb,KAAOpX,GAAK+V,GACV/V,GAAK,EACLxD,GAAK,EACLL,KAAO,EAET,OAAQ6D,EAAI7D,GAAKK,CACnB,EAUA,OARAU,EAAKG,MAAQ,WAAa,OAAmB,EAAZ6Z,EAAKE,EAAE,EAAQ,EAChDla,EAAKI,MAAQ,WAAa,OAAO4Z,EAAKE,EAAE,GAAK,UAAa,EAC1Dla,EAAKC,OAASD,EAGdiZ,EAAOG,EAASY,EAAKG,GAAI7B,IAGjB7R,EAAQ2T,MAAQpL,GACpB,SAAShP,EAAMpB,EAAMyb,EAActa,GAUjC,OATIA,IAEEA,EAAMoa,GAAKza,EAAKK,EAAOia,GAE3Bha,EAAKD,MAAQ,WAAa,OAAOL,EAAKsa,EAAM,CAAC,EAAI,GAK/CK,GAAgB9B,EAAY,OAAIvY,EAAapB,GAIrCoB,CACd,GACJA,EACAgZ,EACA,WAAYvS,EAAUA,EAAQ/H,OAAUD,MAAQ8Z,EAChD9R,EAAQ1G,MACV,CAYA,SAASka,EAAK7Y,GACZ,IAAIpC,EAAGsb,EAASlZ,EAAI5B,OAChBX,EAAKJ,KAAM8B,EAAI,EAAGC,EAAI3B,EAAG0B,EAAI1B,EAAG2B,EAAI,EAAGkI,EAAI7J,EAAGsb,EAAI,GAMtD,IAHKG,IAAUlZ,EAAM,CAACkZ,MAGf/Z,EAAIkY,GACT/P,EAAEnI,GAAKA,IAET,IAAKA,EAAI,EAAGA,EAAIkY,EAAOlY,IACrBmI,EAAEnI,GAAKmI,EAAElI,EAAIsY,EAAQtY,EAAIY,EAAIb,EAAI+Z,IAAWtb,EAAI0J,EAAEnI,KAClDmI,EAAElI,GAAKxB,GAIRH,EAAGqb,EAAI,SAASK,GAIf,IAFA,IAAIvb,EAAGwb,EAAI,EACPja,EAAI1B,EAAG0B,EAAGC,EAAI3B,EAAG2B,EAAGkI,EAAI7J,EAAGsb,EACxBI,KACLvb,EAAI0J,EAAEnI,EAAIuY,EAAQvY,EAAI,GACtBia,EAAIA,EAAI/B,EAAQ/P,EAAEoQ,GAASpQ,EAAEnI,GAAKmI,EAAElI,EAAIsY,EAAQtY,EAAIxB,KAAQ0J,EAAElI,GAAKxB,IAGrE,OADAH,EAAG0B,EAAIA,EAAG1B,EAAG2B,EAAIA,EACVga,CAIT,GAAG/B,EACL,CAMA,SAAS/Y,EAAKC,EAAGX,GAIf,OAHAA,EAAEuB,EAAIZ,EAAEY,EACRvB,EAAEwB,EAAIb,EAAEa,EACRxB,EAAEmb,EAAIxa,EAAEwa,EAAExZ,QACH3B,CACT,CAMA,SAASka,EAAQlE,EAAKyF,GACpB,IAAqCC,EAAjCxa,EAAS,GAAIya,SAAc3F,EAC/B,GAAIyF,GAAgB,UAAPE,EACX,IAAKD,KAAQ1F,EACX,IAAM9U,EAAOO,KAAKyY,EAAQlE,EAAI0F,GAAOD,EAAQ,GAAK,CAAE,MAAOhD,GAAI,CAGnE,OAAQvX,EAAOV,OAASU,EAAgB,UAAPya,EAAkB3F,EAAMA,EAAM,IACjE,CAOA,SAASiE,EAAOra,EAAMwC,GAEpB,IADA,IAA4BwZ,EAAxBC,EAAajc,EAAO,GAAW4B,EAAI,EAChCA,EAAIqa,EAAWrb,QACpB4B,EAAI0X,EAAOtY,GACTsY,GAAS8B,GAAyB,GAAhBxZ,EAAI0X,EAAOtY,IAAWqa,EAAWpb,WAAWe,KAElE,OAAO4Y,EAAShY,EAClB,CA6BA,SAASgY,EAAShB,GAChB,OAAO/V,OAAOyY,aAAa7O,MAAM,EAAGmM,EACtC,CAeA,GANAa,EAAOV,EAAKwC,SAAUzC,GAMaha,EAAOD,QAAS,CACjDC,EAAOD,QAAU0a,EAEjB,IACEP,EAAa,EAAQ,IACvB,CAAE,MAAOwC,GAAK,CAChB,WAC0C,KAAxC,aAAoB,OAAOjC,CAAa,+BAQzC,CA9ND,CAiOmB,oBAAT3I,KAAwBA,KAAO3R,KACvC,GACAsN,K,sBC3PF,OAyBA,SAAUrN,EAAQJ,GAElB,SAASK,EAAOC,GACd,IAAIC,EAAKJ,KAGTI,EAAGE,KAAO,WACR,IACwBC,EAAGK,EADvBD,EAAIP,EAAGO,EACPkB,EAAIzB,EAAGyB,EAAGC,EAAI1B,EAAG0B,EAcrB,OAZA1B,EAAGO,EAAIA,EAAKA,EAAI,WAAc,EAE9BC,EAAIiB,EAAGC,EAAI,GAAM,KACjBvB,EAAIsB,EAAEC,EAAMA,EAAI,EAAK,KACrBlB,GAAKA,GAAK,GACVL,GAAKA,GAAK,GACVK,GAAKA,IAAM,GACXL,GAAKA,IAAM,GAEXK,EAAIiB,EAAEC,GAAKlB,EAAIL,EACfH,EAAG0B,EAAIA,EAEClB,GAAKD,EAAKA,IAAM,IAAQ,CAClC,EAEA,SAAcP,EAAID,GAChB,IAAII,EAAGK,EAAGkB,EAAGC,EAAGpB,EAAGkB,EAAI,GAAI2a,EAAQ,IAYnC,IAXIrc,KAAiB,EAAPA,IAEZS,EAAIT,EACJA,EAAO,OAGPA,GAAc,KACdS,EAAI,EACJ4b,EAAQlP,KAAKI,IAAI8O,EAAOrc,EAAKY,SAG1Be,EAAI,EAAGC,GAAK,GAAIA,EAAIya,IAASza,EAE5B5B,IAAMS,GAAKT,EAAKa,YAAYe,EAAI,IAAM5B,EAAKY,SAErC,IAANgB,IAASpB,EAAIC,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPmB,GAAK,IACPpB,EAAKA,EAAI,WAAc,EAEvBmB,EAAK,IADLvB,EAAKsB,EAAM,IAAJE,IAAanB,EAAID,GACTmB,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACPD,EAA+B,KAA5B1B,GAAQA,EAAKY,QAAU,KAAa,GAKzCe,EAAI,IACCC,EAAI,IAASA,EAAI,IAAKA,EACzBnB,EAAIiB,EAAGC,EAAI,GAAM,KACjBvB,EAAIsB,EAAEC,EAAMA,EAAI,EAAK,KACrBlB,GAAKA,GAAK,GACVL,GAAKA,GAAK,GACVK,GAAKA,IAAM,GACXL,GAAKA,IAAM,GACXsB,EAAEC,GAAKlB,EAAIL,EAGbH,EAAGO,EAAIA,EACPP,EAAGyB,EAAIA,EACPzB,EAAG0B,EAAIA,CACT,CAEAG,CAAK7B,EAAID,EACX,CAEA,SAASc,EAAKC,EAAGX,GAIf,OAHAA,EAAEuB,EAAIZ,EAAEY,EACRvB,EAAEI,EAAIO,EAAEP,EACRJ,EAAEsB,EAAIX,EAAEW,EAAEK,QACH3B,CACT,CAEA,SAASY,EAAKhB,EAAMiB,GACN,MAARjB,IAAcA,GAAQ,IAAKgC,MAC/B,IAAId,EAAK,IAAInB,EAAOC,GAChBmB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGf,SAAW,GAAK,UAAa,EAehE,OAdAiB,EAAKC,OAAS,WACZ,GACE,IAEIC,IAFMJ,EAAGf,SAAW,KACbe,EAAGf,SAAW,GAAK,aACF,GAAK,UACf,IAAXmB,GACT,OAAOA,CACT,EACAF,EAAKG,MAAQL,EAAGf,KAChBiB,EAAKI,MAAQJ,EACTD,IACEA,EAAMO,GAAGZ,EAAKK,EAAOD,GACzBE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,CAAC,EAAI,GAE1CE,CACT,CAEI1B,GAAUA,EAAOD,QACnBC,EAAOD,QAAUuB,EACR,QAAU,YACe,KAAlC,aAAoB,OAAOA,CAAO,gCAElCnB,KAAK0Y,QAAUvX,CAGhB,CApHD,CAqHEnB,E,WAEA,O,UC3IFH,EAAOD,QAAU,SAAS6c,EAAa9C,EAAGD,GACzC,aACA,IAeCgD,EAAQC,EAfLC,EAAK,8EACRC,EAAM,iBACNC,EAAM,iHACNC,EAAM,iBACNC,EAAM,KACNlb,EAAI,SAASmI,GAAK,OAAOwS,EAAYQ,cAAgB,GAAKhT,GAAGzD,eAAiB,GAAKyD,CAAG,EAEtFzJ,EAAIsB,EAAE6X,GAAGuD,QAAQL,EAAK,KAAO,GAC7Bpc,EAAIqB,EAAE4X,GAAGwD,QAAQL,EAAK,KAAO,GAE7BM,EAAK3c,EAAE0c,QAAQN,EAAI,UAAUM,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAIlT,MAAM,MACvEoT,EAAK3c,EAAEyc,QAAQN,EAAI,UAAUM,QAAQ,MAAM,IAAIA,QAAQ,MAAM,IAAIlT,MAAM,MAEvEqT,EAAKC,SAAS9c,EAAEgI,MAAMuU,GAAM,KAAsB,IAAdI,EAAGpc,QAAgBP,EAAEgI,MAAMsU,IAAQ3a,KAAKob,MAAM/c,GAClFgd,EAAKF,SAAS7c,EAAE+H,MAAMuU,GAAM,KAAOM,GAAM5c,EAAE+H,MAAMsU,IAAQ3a,KAAKob,MAAM9c,IAAM,KAG3E,GAAI+c,EAAI,CACP,GAAKH,EAAKG,EAAO,OAAQ,EACpB,GAAKH,EAAKG,EAAO,OAAO,CAC9B,CAEA,IAAI,IAAIC,EAAK,EAAGC,EAAKpQ,KAAKI,IAAIyP,EAAGpc,OAAQqc,EAAGrc,QAAS0c,EAAOC,EAAMD,IAAQ,CAKzE,GAHAf,IAAWS,EAAGM,IAAS,IAAIjV,MAAMwU,IAAQW,WAAWR,EAAGM,KAAUN,EAAGM,IAAS,EAC7Ed,IAAWS,EAAGK,IAAS,IAAIjV,MAAMwU,IAAQW,WAAWP,EAAGK,KAAUL,EAAGK,IAAS,EAEzEG,MAAMlB,KAAYkB,MAAMjB,GAAW,OAAQiB,MAAMlB,GAAW,GAAK,EAMrE,UAJgBA,UAAkBC,IACjCD,GAAU,GACVC,GAAU,IAEPD,EAASC,EAAU,OAAQ,EAC/B,GAAID,EAASC,EAAU,OAAO,CAC/B,CACA,OAAO,CACR,C,GC3CIkB,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBza,IAAjB0a,EACH,OAAOA,EAAape,QAGrB,IAAIC,EAASge,EAAyBE,GAAY,CACjDE,GAAIF,EACJG,QAAQ,EACRte,QAAS,CAAC,GAUX,OANAue,EAAoBJ,GAAUjb,KAAKjD,EAAOD,QAASC,EAAQA,EAAOD,QAASke,GAG3Eje,EAAOqe,QAAS,EAGTre,EAAOD,OACf,CCzBAke,EAAoBM,KAAO,WAC1B,MAAM,IAAI/H,MAAM,iCACjB,ECFAyH,EAAoBO,KAAO,CAAC,ECC5BP,EAAoBjd,EAAI,CAACjB,EAAS0e,KACjC,IAAI,IAAI3b,KAAO2b,EACXR,EAAoBS,EAAED,EAAY3b,KAASmb,EAAoBS,EAAE3e,EAAS+C,IAC5EL,OAAOwT,eAAelW,EAAS+C,EAAK,CAAE6b,YAAY,EAAMlY,IAAKgY,EAAW3b,IAE1E,ECNDmb,EAAoBS,EAAI,CAAChI,EAAK0F,IAAU3Z,OAAOM,UAAUC,eAAeC,KAAKyT,EAAK0F,GCClF6B,EAAoB/B,EAAKnc,IACH,oBAAX6e,QAA0BA,OAAOC,aAC1Cpc,OAAOwT,eAAelW,EAAS6e,OAAOC,YAAa,CAAElX,MAAO,WAE7DlF,OAAOwT,eAAelW,EAAS,aAAc,CAAE4H,OAAO,GAAO,ECL9DsW,EAAoBa,IAAO9e,IAC1BA,EAAO+e,MAAQ,GACV/e,EAAOgf,WAAUhf,EAAOgf,SAAW,IACjChf,G,+pQCOR,SAASif,EAAiBC,EAAQ9C,GAEhC,GAAI+C,EAAeD,EAAQ9C,GACzB,OAAO8C,EAAO9C,GAGhB,GAA4B,mBAAjB8C,EAAO9C,IAAwBgD,EAAaF,EAAQ9C,GAC7D,MAAM,IAAI5F,MAAM,yBAA2B4F,EAAO,mBAGpD,MAAM,IAAI5F,MAAM,0BAA4B4F,EAAO,IACrD,CAYA,SAASiD,EAAiBH,EAAQ9C,EAAMzU,GAEtC,GAAIwX,EAAeD,EAAQ9C,GAEzB,OADA8C,EAAO9C,GAAQzU,EACRA,EAGT,MAAM,IAAI6O,MAAM,0BAA4B4F,EAAO,IACrD,CASA,SAAS+C,EAAgBD,EAAQ9C,GAC/B,SAoFF,SAAwB8C,GACtB,MAAyB,iBAAXA,GAAuBA,GAAUA,EAAO1Z,cAAgB/C,MACxE,CAtFO8C,CAAc2Z,KAAYtZ,MAAMC,QAAQqZ,KAKzClc,GAAesc,EAAsBlD,KAKrCA,KAAQ3Z,OAAOM,WAQfqZ,KAAQmD,SAASxc,WAOvB,CAwBA,SAASqc,EAAcF,EAAQM,GAC7B,QAAIN,SAAqE,mBAAnBA,EAAOM,IAMzDxc,GAAekc,EAAQM,IACtB/c,OAAOgd,gBAAmBD,KAAU/c,OAAOgd,eAAeP,KAK3Dlc,GAAe0c,EAAmBF,KAKlCA,KAAU/c,OAAOM,WAQjByc,KAAUD,SAASxc,WAOzB,CAMA,MAAMuc,EAAuB,CAC3Bpe,QAAQ,EACRwE,MAAM,GAGFga,EAAoB,CACxB3M,UAAU,EACV4M,SAAS,EACTC,gBAAgB,GCxIX,MAAMC,EACXra,WAAAA,CAAa0Z,GACX/e,KAAK2f,cAAgBZ,EAErB/e,KAAKye,OAAOmB,UAAY5f,KAAK6f,OAC/B,CAEA9b,IAAAA,GACE,OAAOzB,OAAOyB,KAAK/D,KAAK2f,eACrBjY,QAAO/E,GAAO3C,KAAKgH,IAAIrE,KACvBmd,QACL,CAEAxZ,GAAAA,CAAK3D,GACH,OAAOmc,EAAgB9e,KAAK2f,cAAehd,EAC7C,CAEAsE,GAAAA,CAAKtE,EAAK6E,GAER,OADA0X,EAAgBlf,KAAK2f,cAAehd,EAAK6E,GAClCxH,IACT,CAEAgH,GAAAA,CAAKrE,GACH,OAAOqc,EAAehf,KAAK2f,cAAehd,IAAQA,KAAO3C,KAAK2f,aAChE,CAEAE,OAAAA,GACE,OAAOE,EAAY/f,KAAK+D,QAAQpB,GAAO,CAACA,EAAK3C,KAAKsG,IAAI3D,KACxD,CAEAuB,OAAAA,CAASqM,GACP,IAAK,MAAM5N,KAAO3C,KAAK+D,OACrBwM,EAASvQ,KAAKsG,IAAI3D,GAAMA,EAAK3C,KAEjC,CAEAggB,OAAQrd,GACFqc,EAAehf,KAAK2f,cAAehd,WAC9B3C,KAAK2f,cAAchd,EAE9B,CAEA0E,KAAAA,GACE,IAAK,MAAM1E,KAAO3C,KAAK+D,OACrB/D,KAAKggB,OAAOrd,EAEhB,CAEA,QAAIsd,GACF,OAAO3d,OAAOyB,KAAK/D,KAAK2f,eAAe5e,MACzC,EAiBK,MAAMmf,EAMX7a,WAAAA,CAAasU,EAAGD,EAAGyG,GACjBngB,KAAK2Z,EAAIA,EACT3Z,KAAK0Z,EAAIA,EACT1Z,KAAKmgB,MAAQA,EAEbngB,KAAKye,OAAOmB,UAAY5f,KAAK6f,OAC/B,CAEAvZ,GAAAA,CAAK3D,GACH,OAAO3C,KAAKmgB,MAAMnZ,IAAIrE,GAClB3C,KAAK0Z,EAAEpT,IAAI3D,GACX3C,KAAK2Z,EAAErT,IAAI3D,EACjB,CAEAsE,GAAAA,CAAKtE,EAAK6E,GAMR,OALIxH,KAAKmgB,MAAMnZ,IAAIrE,GACjB3C,KAAK0Z,EAAEzS,IAAItE,EAAK6E,GAEhBxH,KAAK2Z,EAAE1S,IAAItE,EAAK6E,GAEXxH,IACT,CAEAgH,GAAAA,CAAKrE,GACH,OAAO3C,KAAK0Z,EAAE1S,IAAIrE,IAAQ3C,KAAK2Z,EAAE3S,IAAIrE,EACvC,CAEAoB,IAAAA,GACE,OAAO,IAAIgH,IAAI,IACV/K,KAAK2Z,EAAE5V,UACP/D,KAAK0Z,EAAE3V,SACT0a,OAAOmB,WACZ,CAEAC,OAAAA,GACE,OAAOE,EAAY/f,KAAK+D,QAAQpB,GAAO,CAACA,EAAK3C,KAAKsG,IAAI3D,KACxD,CAEAuB,OAAAA,CAASqM,GACP,IAAK,MAAM5N,KAAO3C,KAAK+D,OACrBwM,EAASvQ,KAAKsG,IAAI3D,GAAMA,EAAK3C,KAEjC,CAEAggB,OAAQrd,GACN,OAAO3C,KAAKmgB,MAAMnZ,IAAIrE,GAClB3C,KAAK0Z,EAAEsG,OAAOrd,GACd3C,KAAK2Z,EAAEqG,OAAOrd,EACpB,CAEA0E,KAAAA,GACErH,KAAK2Z,EAAEtS,QACPrH,KAAK0Z,EAAErS,OACT,CAEA,QAAI4Y,GACF,MAAO,IAAIjgB,KAAK+D,QAAQhD,MAC1B,EAMF,SAASgf,EAAaK,EAAI7P,GACxB,MAAO,CACLjQ,KAAMA,KACJ,MAAM+D,EAAI+b,EAAG9f,OACb,OAAQ+D,EAAEgc,KACNhc,EACA,CACEmD,MAAO+I,EAASlM,EAAEmD,OAClB6Y,MAAM,EACP,EAGX,CAOO,SAASC,IACd,OAAO,IAAIhZ,GACb,CAQO,SAASiZ,EAAWC,GACzB,IAAKA,EACH,OAAOF,IAET,GAAIG,EAAMD,GACR,OAAOA,EAET,GAAIE,EAASF,GACX,OAAO,IAAId,EAAkBc,GAG/B,MAAM,IAAInK,MAAM,iDAClB,CC5KO,SAASsK,EAAUngB,GACxB,MAAoB,iBAANA,CAChB,CAEO,SAASogB,EAAapgB,GAC3B,SACGA,GAAkB,iBAANA,GACY,mBAAlBA,EAAE6E,gBAMS,IAAlB7E,EAAEogB,aACiC,iBAA5BpgB,EAAE6E,YAAYzC,YACmB,IAAxCpC,EAAE6E,YAAYzC,UAAUge,aAMW,mBAA5BpgB,EAAE6E,YAAYwb,YACU,IAA/BrgB,EAAE6E,YAAYwb,UAAUrgB,GAM5B,CAEO,SAASsgB,EAAUtgB,GACxB,MAAoB,iBAANA,CAChB,CAEO,SAASugB,EAAWvgB,GACzB,OAAQA,GAAkB,iBAANA,IAAyD,IAAvC8B,OAAOgd,eAAe9e,GAAGugB,YAAuB,CACxF,CAEO,SAASC,EAAYxgB,GAC1B,OAAQA,GAAkB,iBAANA,IAA0D,IAAxC8B,OAAOgd,eAAe9e,GAAGwgB,aAAwB,CACzF,CAEO,SAASC,EAAQzgB,GACtB,OAAQA,IAAwC,IAAnCA,EAAE6E,YAAYzC,UAAUqe,SAAoB,CAC3D,CAEO,SAASC,EAAU1gB,GACxB,MAAoB,iBAANA,CAChB,CAEO,MAAMkF,EAAUD,MAAMC,QAEtB,SAASyb,EAAU3gB,GACxB,OAAQA,IAA0C,IAArCA,EAAE6E,YAAYzC,UAAUue,WAAsB,CAC7D,CAOO,SAASC,EAAc5gB,GAC5B,OAAOiF,MAAMC,QAAQlF,IAAM2gB,EAAS3gB,EACtC,CAEO,SAAS6gB,EAAe7gB,GAC7B,OAAQA,GAAKA,EAAE6gB,gBAAsD,IAArC7gB,EAAE6E,YAAYzC,UAAUue,WAAsB,CAChF,CAEO,SAASG,EAAgB9gB,GAC9B,OAAQA,GAAKA,EAAE8gB,iBAAuD,IAArC9gB,EAAE6E,YAAYzC,UAAUue,WAAsB,CACjF,CAEO,SAASI,EAAS/gB,GACvB,OAAQA,IAAyC,IAApCA,EAAE6E,YAAYzC,UAAU2e,UAAqB,CAC5D,CAEO,SAASC,EAAShhB,GACvB,OAAQA,IAAyC,IAApCA,EAAE6E,YAAYzC,UAAU4e,UAAqB,CAC5D,CAEO,SAASC,EAAWjhB,GACzB,MAAoB,kBAANA,CAChB,CAEO,SAASkhB,EAAalhB,GAC3B,OAAQA,IAA6C,IAAxCA,EAAE6E,YAAYzC,UAAU8e,cAAyB,CAChE,CAEO,SAASC,EAAQnhB,GACtB,OAAQA,IAAwC,IAAnCA,EAAE6E,YAAYzC,UAAU+e,SAAoB,CAC3D,CAEO,SAASC,EAAYphB,GAC1B,MAAoB,mBAANA,CAChB,CAEO,SAASqhB,EAAQrhB,GACtB,OAAOA,aAAa2B,IACtB,CAEO,SAAS2f,EAAUthB,GACxB,OAAOA,aAAamF,MACtB,CAEO,SAAS+a,EAAUlgB,GACxB,SAAUA,GACK,iBAANA,GACPA,EAAE6E,cAAgB/C,QACjBye,EAAUvgB,IACVwgB,EAAWxgB,GAChB,CAUO,SAASigB,EAAO1B,GAGrB,QAAKA,IAGEA,aAAkBzX,KACvByX,aAAkBW,GAEM,mBAAfX,EAAO9X,KACQ,mBAAf8X,EAAOzY,KACS,mBAAhByY,EAAOhb,MACQ,mBAAfgb,EAAO/X,IAEpB,CAEO,SAAS+a,EAAkBhD,GAChC,OAAO0B,EAAM1B,IAAW0B,EAAM1B,EAAOpF,IAAM8G,EAAM1B,EAAOrF,EAC1D,CAEO,SAASsI,EAAqBjD,GACnC,OAAO0B,EAAM1B,IAAW2B,EAAS3B,EAAOY,cAC1C,CAEO,SAASsC,EAAQzhB,GACtB,OAAa,OAANA,CACT,CAEO,SAAS0hB,EAAa1hB,GAC3B,YAAa8C,IAAN9C,CACT,CAEO,SAAS2hB,EAAgB3hB,GAC9B,OAAQA,IAA0B,IAArBA,EAAE2hB,iBAA8D,IAAnC3hB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACxF,CAEO,SAASC,EAAa7hB,GAC3B,OAAQA,IAAuB,IAAlBA,EAAE6hB,cAA2D,IAAnC7hB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACrF,CAEO,SAASE,EAAkB9hB,GAChC,OAAQA,IAA4B,IAAvBA,EAAE8hB,mBAAgE,IAAnC9hB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAC1F,CAEO,SAASG,EAAa/hB,GAC3B,OAAQA,IAAuB,IAAlBA,EAAE+hB,cAA2D,IAAnC/hB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACrF,CAEO,SAASI,EAAmBhiB,GACjC,OAAQA,IAA6B,IAAxBA,EAAEgiB,oBAAiE,IAAnChiB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAC3F,CAEO,SAASK,EAAgBjiB,GAC9B,OAAQA,IAA0B,IAArBA,EAAEiiB,iBAA8D,IAAnCjiB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACxF,CAYO,SAASM,EAAWC,GACzB,OAAOF,EAAeE,IACnBC,EAAeD,IACM,IAArBA,EAAKrW,KAAKvL,QACV0hB,EAAeE,EAAKrW,KAAK,KACzB,MAAMuW,SAASF,EAAKG,GACzB,CAEO,SAASC,EAA0BviB,GACxC,OAAQA,IAAoC,IAA/BA,EAAEuiB,2BAAwE,IAAnCviB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAClG,CAEO,SAASY,EAAgBxiB,GAC9B,OAAQA,IAA0B,IAArBA,EAAEwiB,iBAA8D,IAAnCxiB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACxF,CAEO,SAASa,EAAaziB,GAC3B,OAAQA,IAAuB,IAAlBA,EAAEyiB,cAA2D,IAAnCziB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACrF,CAEO,SAASA,EAAQ5hB,GACtB,OAAQA,IAAkB,IAAbA,EAAE4hB,SAAsD,IAAnC5hB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAChF,CAEO,SAASc,EAAc1iB,GAC5B,OAAQA,IAAwB,IAAnBA,EAAE0iB,eAA4D,IAAnC1iB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACtF,CAEO,SAASQ,EAAgBpiB,GAC9B,OAAQA,IAA0B,IAArBA,EAAEoiB,iBAA8D,IAAnCpiB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACxF,CAEO,SAASe,GAAmB3iB,GACjC,OAAQA,IAA6B,IAAxBA,EAAE2iB,oBAAiE,IAAnC3iB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAC3F,CAEO,SAASgB,GAAa5iB,GAC3B,OAAQA,IAAuB,IAAlBA,EAAE4iB,cAA2D,IAAnC5iB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACrF,CAEO,SAASiB,GAAkB7iB,GAChC,OAAQA,IAA4B,IAAvBA,EAAE6iB,mBAAgE,IAAnC7iB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CAC1F,CAEO,SAASkB,GAAc9iB,GAC5B,OAAQA,IAAwB,IAAnBA,EAAE8iB,eAA4D,IAAnC9iB,EAAE6E,YAAYzC,UAAUwf,SAAoB,CACtF,CAEO,SAASmB,GAAS/iB,GACvB,OAAQA,IAAyC,IAApCA,EAAE6E,YAAYzC,UAAU2gB,UAAqB,CAC5D,CAEO,SAASC,GAAQhjB,GACtB,MAAMD,SAAWC,EAEjB,MAAU,WAAND,EACQ,OAANC,EAAmB,OACnBogB,EAAYpgB,GAAW,YACvBA,EAAE6E,aAAe7E,EAAE6E,YAAYE,KAAa/E,EAAE6E,YAAYE,KAEvD,SAGFhF,CACT,CC9PO,SAASkjB,GAAOjjB,GACrB,MAAM6F,SAAc7F,EAGpB,GAAa,WAAT6F,GAA8B,WAATA,GAA8B,WAATA,GAA8B,YAATA,GAA/DA,MACA7F,EACF,OAAOA,EAIT,GAAuB,mBAAZA,EAAEijB,MACX,OAAOjjB,EAAEijB,QAIX,GAAIhe,MAAMC,QAAQlF,GAChB,OAAOA,EAAEkJ,KAAI,SAAUlC,GACrB,OAAOic,GAAMjc,EACf,IAGF,GAAIhH,aAAa2B,KAAM,OAAO,IAAIA,KAAK3B,EAAEgf,WACzC,GAAIoB,EAAYpgB,GAAI,OAAOA,EAG3B,GAAIkgB,EAASlgB,GACX,OAiBG,SAAoBue,EAAQxO,GACjC,MAAMkT,EAAQ,CAAC,EAEf,IAAK,MAAM9gB,KAAOoc,EACZlc,GAAekc,EAAQpc,KACzB8gB,EAAM9gB,GAAO4N,EAASwO,EAAOpc,KAIjC,OAAO8gB,CACT,CA3BWC,CAAUljB,EAAGijB,IAGtB,GAAa,aAATpd,EAEF,OAAO7F,EAGT,MAAM,IAAIkG,UAAU,+CAA+ClG,KACrE,CA0BO,SAASmjB,GAAQhK,EAAGD,GACzB,IAAK,MAAMuC,KAAQvC,EACb7W,GAAe6W,EAAGuC,KACpBtC,EAAEsC,GAAQvC,EAAEuC,IAGhB,OAAOtC,CACT,CAQO,SAASiK,GAAYjK,EAAGD,GAE7B,GAAIjU,MAAMC,QAAQgU,GAChB,MAAM,IAAIhT,UAAU,0CAGtB,IAAK,MAAMuV,KAAQvC,EAGjB,GAAI7W,GAAe6W,EAAGuC,MAAWA,KAAQ3Z,OAAOM,cAAgBqZ,KAAQmD,SAASxc,WAC/E,GAAI8W,EAAEuC,IAASvC,EAAEuC,GAAM5W,cAAgB/C,YACrBgB,IAAZqW,EAAEsC,KACJtC,EAAEsC,GAAQ,CAAC,GAETtC,EAAEsC,IAAStC,EAAEsC,GAAM5W,cAAgB/C,OACrCshB,GAAWjK,EAAEsC,GAAOvC,EAAEuC,IAEtBtC,EAAEsC,GAAQvC,EAAEuC,OAET,IAAIxW,MAAMC,QAAQgU,EAAEuC,IACzB,MAAM,IAAIvV,UAAU,0CAEpBiT,EAAEsC,GAAQvC,EAAEuC,EACd,CAGJ,OAAOtC,CACT,CASO,SAASkK,GAAiBlK,EAAGD,GAClC,IAAIuC,EAAMna,EAAGwX,EACb,GAAI7T,MAAMC,QAAQiU,GAAI,CACpB,IAAKlU,MAAMC,QAAQgU,GACjB,OAAO,EAGT,GAAIC,EAAE5Y,SAAW2Y,EAAE3Y,OACjB,OAAO,EAGT,IAAKe,EAAI,EAAGwX,EAAMK,EAAE5Y,OAAQe,EAAIwX,EAAKxX,IACnC,IAAK+hB,GAAgBlK,EAAE7X,GAAI4X,EAAE5X,IAC3B,OAAO,EAGX,OAAO,CACT,CAAO,GAAiB,mBAAN6X,EAChB,OAAQA,IAAMD,EACT,GAAIC,aAAarX,OAAQ,CAC9B,GAAImD,MAAMC,QAAQgU,MAAQA,aAAapX,QACrC,OAAO,EAGT,IAAK2Z,KAAQtC,EAEX,KAAMsC,KAAQvC,KAAOmK,GAAgBlK,EAAEsC,GAAOvC,EAAEuC,IAC9C,OAAO,EAGX,IAAKA,KAAQvC,EAEX,KAAMuC,KAAQtC,GACZ,OAAO,EAGX,OAAO,CACT,CACE,OAAQA,IAAMD,CAElB,CAOO,SAASoK,GAAaC,GAC3B,MAAMC,EAAkB,CAAC,EAIzB,OAFAC,GAAaF,EAAcC,GAEpBA,CACT,CAGA,SAASC,GAAcF,EAAcC,GACnC,IAAK,MAAM/H,KAAQ8H,EACjB,GAAIlhB,GAAekhB,EAAc9H,GAAO,CACtC,MAAMzU,EAAQuc,EAAa9H,GACN,iBAAVzU,GAAgC,OAAVA,EAC/Byc,GAAazc,EAAOwc,GAEpBA,EAAgB/H,GAAQzU,CAE5B,CAEJ,CA2BO,SAAS0c,GAAMnF,EAAQ9C,EAAMkI,GAClC,IACIC,EADAC,GAAiB,EAGrB/hB,OAAOwT,eAAeiJ,EAAQ9C,EAAM,CAClC3V,IAAK,WAKH,OAJI+d,IACFD,EAASD,IACTE,GAAiB,GAEZD,CACT,EAEAnd,IAAK,SAAUO,GACb4c,EAAS5c,EACT6c,GAAiB,CACnB,EAEAC,cAAc,EACd9F,YAAY,GAEhB,CAkCO,SAAS3b,GAAgBkc,EAAQwF,GACtC,OAAOxF,GAAUzc,OAAOO,eAAeC,KAAKic,EAAQwF,EACtD,CCvPO,SAAS5kB,GAAS4F,EAAMif,EAAcrf,EAAQsf,GACnD,SAASC,EAAiBC,GAIxB,MAAMC,ED6VH,SAAsB7F,EAAQ8F,GACnC,MAAM5jB,EAAO,CAAC,EAEd,IAAK,IAAIa,EAAI,EAAGA,EAAI+iB,EAAW9jB,OAAQe,IAAK,CAC1C,MAAMa,EAAMkiB,EAAW/iB,GACjB0F,EAAQuX,EAAOpc,QACPW,IAAVkE,IACFvG,EAAK0B,GAAO6E,EAEhB,CAEA,OAAOvG,CACT,CCzWiB6jB,CAAYH,EAAOH,EAAa9a,IAAIqb,KAIjD,OA8FG,SAA6Bxf,EAAMif,EAAcG,GAKtD,IAJmBH,EAChB9c,QAAOsd,IAYL,SAA+BA,GACpC,OAAOA,GAAgC,MAAlBA,EAAW,EAClC,CAd2BC,CAAqBD,KAC3C1R,OAAM0R,QAAoC1hB,IAAtBqhB,EAAMK,KAEZ,CACf,MAAME,EAAsBV,EAAa9c,QAAOsd,QAAoC1hB,IAAtBqhB,EAAMK,KAGpE,MAAM,IAAI3O,MAAM,2BAA2B9Q,sCACP2f,EAAoBxb,KAAI7I,GAAK,IAAIA,OAAMuH,KAAK,SAClF,CACF,CA5GI+c,CAAmB5f,EAAMif,EAAcG,GAEhCxf,EAAOyf,EAChB,CASA,OAPAF,EAAgBU,WAAY,EAC5BV,EAAgB5c,GAAKvC,EACrBmf,EAAgBF,aAAeA,EAAatiB,QAAQyI,OAChD8Z,IACFC,EAAgBD,KAAOA,GAGlBC,CACT,CAoEO,SAASU,GAAW7O,GACzB,MAAsB,mBAARA,GACM,iBAAXA,EAAIzO,IACXrC,MAAMC,QAAQ6Q,EAAIiO,aACtB,CA6BO,SAASO,GAAuBC,GACrC,OAAOA,GAAgC,MAAlBA,EAAW,GAC5BA,EAAW9iB,MAAM,GACjB8iB,CACN,CC/IO,SAASK,GAAW7d,GACzB,MAAqB,kBAAVA,KAIJ8d,SAAS9d,IACXA,IAAU8F,KAAKiY,MAAM/d,EAE5B,CAoBO,SAASge,GAAgBC,EAAWC,GACzC,GAAsB,WAAlBA,EAAOC,OACT,IACEC,OAAOH,EACT,CAAE,MAAAI,GACA,OAAOH,EAAOI,cAChB,CAGF,OAAOJ,EAAOC,MAChB,CAOO,MAAMI,GAAOzY,KAAKyY,MAAQ,SAAUvlB,GACzC,OAAIA,EAAI,EACC,EACEA,EAAI,GACL,EAED,CAEX,EAOawlB,GAAO1Y,KAAK0Y,MAAQ,SAAexlB,GAC9C,OAAO8M,KAAK2Y,IAAIzlB,GAAK8M,KAAK4Y,GAC5B,EAOaC,GAAQ7Y,KAAK6Y,OAAS,SAAgB3lB,GACjD,OAAO8M,KAAK2Y,IAAIzlB,GAAK8M,KAAK8Y,IAC5B,EAOaC,GAAQ/Y,KAAK+Y,OAAS,SAAU7lB,GAC3C,OAAO8M,KAAK2Y,IAAIzlB,EAAI,EACtB,EAWa8lB,GAAOhZ,KAAKgZ,MAAQ,SAAe9lB,GAC9C,GAAU,IAANA,EACF,OAAOA,EAGT,MAAM+lB,EAAS/lB,EAAI,EACnB,IAAIiB,EAaJ,OAZI8kB,IACF/lB,GAAKA,GAGH8kB,SAAS9kB,IACXiB,EAAS6L,KAAKkZ,IAAIlZ,KAAK2Y,IAAIzlB,GAAK,GAEhCiB,GAAUjB,GAAKiB,EAASA,GAAW,EAAIA,GAAW,GAElDA,EAASjB,EAGJ+lB,GAAU9kB,EAASA,CAC5B,EAOaglB,GAAQnZ,KAAKmZ,OAAS,SAAgBjmB,GACjD,OAAQA,GAAK,MAAQA,IAAM,KACvB8M,KAAKkZ,IAAIhmB,GAAK,EACdA,EAAIA,EAAIA,EAAI,EAAIA,EAAIA,EAAIA,EAAI,CAClC,EASA,SAASkmB,GAAoBriB,EAAGsiB,EAAM1G,GACpC,MACM2G,EADW,CAAE,EAAG,KAAM,EAAG,KAAM,GAAI,MACjBD,GACxB,IAAIE,EAAS,GACb,GAAI5G,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI5J,MAAM,kCAElB,IAAKgP,GAAUpF,GACb,MAAM,IAAI5J,MAAM,2BAElB,GAAIhS,EAAI,IAAM4b,EAAO,GAAK,GAAK5b,IAAM,IAAM4b,EAAO,IAChD,MAAM,IAAI5J,MAAM,8BAA8B4J,EAAO,QAAQA,EAAO,QAEtE,IAAKoF,GAAUhhB,GACb,MAAM,IAAIgS,MAAM,4BAEdhS,EAAI,IACNA,GAAQ,GAAK4b,GAEf4G,EAAS,IAAI5G,GACf,CACA,IAAI8F,EAAO,GAKX,OAJI1hB,EAAI,IACNA,GAAKA,EACL0hB,EAAO,KAEF,GAAGA,IAAOa,IAASviB,EAAEuO,SAAS+T,KAAQE,GAC/C,CAsFO,SAASC,GAAQtf,EAAOQ,GAC7B,GAAuB,mBAAZA,EAET,OAAOA,EAAQR,GAIjB,GAAIA,IAAU6F,IACZ,MAAO,WACF,GAAI7F,KAAU,IACnB,MAAO,YACF,GAAIoW,MAAMpW,GACf,MAAO,MAGT,MAAM,SAAEuf,EAAQ,UAAEC,EAAS,SAAEC,GAAaC,GAAuBlf,GAGjE,OAAQ+e,GACN,IAAK,QACH,OAAOI,GAAQ3f,EAAOwf,GAExB,IAAK,cACH,OAAOI,GAAc5f,EAAOwf,GAE9B,IAAK,cACH,OAmHC,SAAwBxf,EAAOwf,GACpC,GAAIpJ,MAAMpW,KAAW8d,SAAS9d,GAC5B,OAAO5D,OAAO4D,GAGhB,MACM6f,EAAUC,GADFC,GAAY/f,GACSwf,GAE7BhO,EAAIqO,EAAQG,SACZ9iB,EAAI2iB,EAAQI,aAGZC,EAAS1O,EAAI,GAAM,EAAIA,EAAKA,EAAI,EAAKA,EAAI,EAAMA,EAAI,EAAKA,EAAKA,EAAI,EAEvE,GAAI2H,EAASqG,GAEX,KAAOA,EAAYtiB,EAAE3D,QAAWiY,EAAI0O,EAAU,EAAIhjB,EAAE3D,QAClD2D,EAAE1C,KAAK,OAEJ,CAGL,MAAM2lB,EAAera,KAAKsa,IAAI5O,EAAI0O,IAAWhjB,EAAE3D,OAAS,GACxD,IAAK,IAAIe,EAAI,EAAGA,EAAI6lB,EAAc7lB,IAChC4C,EAAE1C,KAAK,EAEX,CAGA,IAAI6lB,EAAUva,KAAKsa,IAAI5O,EAAI0O,GACvBI,EAAa,EAGjB,KAAOD,EAAU,GACfC,IACAD,IAKF,MAAME,EAAWrjB,EAAExC,MAAM4lB,GAAY1f,KAAK,IACpC4f,EAAerH,EAASqG,IAAce,EAAShnB,QAAWgnB,EAASvf,MAAM,SAAa,IAAMuf,EAAY,GAExG3kB,EAAMsB,EAAExC,MAAM,EAAG4lB,GAAY1f,KAAK,IACtC4f,EACA,KAAOhP,GAAK,EAAI,IAAM,IAAM0O,EAAO9U,WACrC,OAAOyU,EAAQtB,KAAO3iB,CACxB,CAlKa6kB,CAAczgB,EAAOwf,GAE9B,IAAK,MACH,OAAON,GAAmBlf,EAAO,EAAGyf,GAEtC,IAAK,MACH,OAAOP,GAAmBlf,EAAO,EAAGyf,GAEtC,IAAK,MACH,OAAOP,GAAmBlf,EAAO,GAAIyf,GAEvC,IAAK,OAEH,OAoOC,SAAsBzf,EAAOwf,EAAWhf,GAC7C,GAAI4V,MAAMpW,KAAW8d,SAAS9d,GAC5B,OAAO5D,OAAO4D,GAIhB,MAAM0gB,EAAWC,GAAmBngB,aAAO,EAAPA,EAASkgB,UAAW,GAClDE,EAAWD,GAAmBngB,aAAO,EAAPA,EAASogB,SAAU,GAEjDpe,EAAQud,GAAY/f,GACpB6f,EAAUL,EAAYM,GAAYtd,EAAOgd,GAAahd,EAC5D,GAAIqd,EAAQG,SAAWU,GAAYb,EAAQG,UAAYY,EAErD,OAAOhB,GAAc5f,EAAOwf,GACvB,CACL,IAAItiB,EAAI2iB,EAAQI,aAChB,MAAMzO,EAAIqO,EAAQG,SAGd9iB,EAAE3D,OAASimB,IACbtiB,EAAIA,EAAE0C,OAAOihB,GAAMrB,EAAYtiB,EAAE3D,UAKnC2D,EAAIA,EAAE0C,OAAOihB,GAAMrP,EAAItU,EAAE3D,OAAS,GAC/B2D,EAAE3D,OAASimB,EAAYA,EAAYtiB,EAAE3D,OAAS,KAGjD2D,EAAI2jB,IAAOrP,GAAG5R,OAAO1C,GAErB,MAAM4jB,EAAMtP,EAAI,EAAIA,EAAI,EAKxB,OAJIsP,EAAM5jB,EAAE3D,OAAS,GACnB2D,EAAE2T,OAAOiQ,EAAM,EAAG,EAAG,KAGhBjB,EAAQtB,KAAOrhB,EAAE0D,KAAK,GAC/B,CACF,CA1QamgB,CAAY/gB,EAAOwf,EAAWhf,GAClCkV,QAAQ,uBAAuB,WAC9B,MAAMsL,EAAS/lB,UAAU,GACnBuW,EAAIvW,UAAU,GACpB,MAAmB,MAAX+lB,EAAkBA,EAASxP,EAAIA,CACzC,IAEJ,QACE,MAAM,IAAI3C,MAAM,qBAAuB0Q,EAAvB,oEAGtB,CAUO,SAASG,GAAwBlf,GAEtC,IACIgf,EACAC,EAFAF,EAAW,OAIf,QAAgBzjB,IAAZ0E,EACF,GAAI2Y,EAAS3Y,GACXgf,EAAYhf,OACP,GAAI4Y,EAAY5Y,GACrBgf,EAAYhf,EAAQygB,eACf,KAAI/H,EAAS1Y,GAiBlB,MAAM,IAAIqO,MAAM,2EAhBU/S,IAAtB0E,EAAQgf,YACVA,EAAY0B,GAAiB1gB,EAAQgf,WAAW,KAC9C,MAAM,IAAI3Q,MAAM,mDAAmD,UAI9C/S,IAArB0E,EAAQif,WACVA,EAAWyB,GAAiB1gB,EAAQif,UAAU,KAC5C,MAAM,IAAI5Q,MAAM,kDAAkD,KAIlErO,EAAQ+e,WACVA,EAAW/e,EAAQ+e,SAIvB,CAGF,MAAO,CAAEA,WAAUC,YAAWC,WAChC,CAQO,SAASM,GAAa/f,GAE3B,MAAMgB,EAAQ5E,OAAO4D,GAAOhB,cAAcgC,MAAM,mCAChD,IAAKA,EACH,MAAM,IAAIkD,YAAY,kBAAoBlE,GAG5C,MAAMue,EAAOvd,EAAM,GACbggB,EAAShgB,EAAM,GACrB,IAAIgf,EAAW7J,WAAWnV,EAAM,IAAM,KAEtC,MAAM8f,EAAME,EAAO1e,QAAQ,KAC3B0d,IAAsB,IAATc,EAAeA,EAAM,EAAME,EAAOznB,OAAS,EAExD,MAAM0mB,EAAee,EAClBtL,QAAQ,IAAK,IACbA,QAAQ,OAAO,SAAUmL,GAGxB,OADAb,GAAYa,EAAMtnB,OACX,EACT,IACCmc,QAAQ,MAAO,IACflT,MAAM,IACNN,KAAI,SAAU7I,GACb,OAAOyc,SAASzc,EAClB,IAOF,OAL4B,IAAxB4mB,EAAa1mB,SACf0mB,EAAazlB,KAAK,GAClBwlB,KAGK,CAAEzB,OAAM0B,eAAcD,WAC/B,CA8DO,SAASL,GAAS3f,EAAOwf,GAC9B,GAAIpJ,MAAMpW,KAAW8d,SAAS9d,GAC5B,OAAO5D,OAAO4D,GAGhB,MAAMmhB,EAAapB,GAAY/f,GACzB6f,EAAgC,iBAAdL,EACpBM,GAAYqB,EAAYA,EAAWnB,SAAW,EAAIR,GAClD2B,EACJ,IAAIjkB,EAAI2iB,EAAQI,aACZ9d,EAAI0d,EAAQG,SAAW,EAG3B,MAAMvU,EAAKtJ,GAAKqd,GAAa,GAgB7B,OAfItiB,EAAE3D,OAASkS,IACbvO,EAAIA,EAAE0C,OAAOihB,GAAMpV,EAAKvO,EAAE3D,UAIxB4I,EAAI,IACNjF,EAAI2jB,GAAW,EAAJ1e,GAAOvC,OAAO1C,GACzBiF,EAAI,GAIFA,EAAIjF,EAAE3D,QACR2D,EAAE2T,OAAO1O,EAAG,EAAU,IAANA,EAAW,KAAO,KAG7B0d,EAAQtB,KAAOrhB,EAAE0D,KAAK,GAC/B,CASO,SAASgf,GAAe5f,EAAOwf,GACpC,GAAIpJ,MAAMpW,KAAW8d,SAAS9d,GAC5B,OAAO5D,OAAO4D,GAIhB,MAAMwC,EAAQud,GAAY/f,GACpB6f,EAAUL,EAAYM,GAAYtd,EAAOgd,GAAahd,EAC5D,IAAItF,EAAI2iB,EAAQI,aAChB,MAAMzO,EAAIqO,EAAQG,SAGd9iB,EAAE3D,OAASimB,IACbtiB,EAAIA,EAAE0C,OAAOihB,GAAMrB,EAAYtiB,EAAE3D,UAInC,MAAM6nB,EAAQlkB,EAAEmkB,QAChB,OAAOxB,EAAQtB,KAAO6C,GAASlkB,EAAE3D,OAAS,EAAK,IAAM2D,EAAE0D,KAAK,IAAO,IACjE,KAAO4Q,GAAK,EAAI,IAAM,IAAMA,CAChC,CA4DO,SAASsO,GAAatd,EAAOgd,GAElC,MAAMK,EAAU,CACdtB,KAAM/b,EAAM+b,KACZ0B,aAAczd,EAAMyd,aACpBD,SAAUxd,EAAMwd,UAEZ9iB,EAAI2iB,EAAQI,aAGlB,KAAOT,GAAa,GAClBtiB,EAAEokB,QAAQ,GACVzB,EAAQG,WACRR,IAGF,GAAItiB,EAAE3D,OAASimB,GACGtiB,EAAE2T,OAAO2O,EAAWtiB,EAAE3D,OAASimB,GAEnC,IAAM,EAAG,CACnB,IAAIllB,EAAIklB,EAAY,EAEpB,IADAtiB,EAAE5C,KACc,KAAT4C,EAAE5C,IACP4C,EAAEqkB,MACQ,IAANjnB,IACF4C,EAAEokB,QAAQ,GACVzB,EAAQG,WACR1lB,KAEFA,IACA4C,EAAE5C,IAEN,CAGF,OAAOulB,CACT,CAOA,SAASgB,GAAOtnB,GACd,MAAMuP,EAAM,GACZ,IAAK,IAAIxO,EAAI,EAAGA,EAAIf,EAAQe,IAC1BwO,EAAItO,KAAK,GAEX,OAAOsO,CACT,CAsCO,SAAS0Y,GAAarP,EAAGD,GAA8B,IAA3BuP,EAAMxmB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,KAAMymB,EAAMzmB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACzD,GAAIwmB,GAAU,EACZ,MAAM,IAAI5S,MAAM,6CAGlB,GAAI6S,EAAS,EACX,MAAM,IAAI7S,MAAM,yCAIlB,OAAIuH,MAAMjE,KAAMiE,MAAMlE,KAIjB4L,SAAS3L,IAAO2L,SAAS5L,GAI1BC,IAAMD,GAKHpM,KAAKsa,IAAIjO,EAAID,IAAMpM,KAAKI,IAAIub,EAAS3b,KAAKI,IAAIJ,KAAKsa,IAAIjO,GAAIrM,KAAKsa,IAAIlO,IAAKwP,GARvEvP,IAAMD,EASjB,CAOO,MAAMyP,GAAQ7b,KAAK6b,OAAS,SAAU3oB,GAC3C,OAAO8M,KAAK2Y,IAAI3Y,KAAK8b,KAAK5oB,EAAIA,EAAI,GAAKA,EACzC,EAEa6oB,GAAQ/b,KAAK+b,OAAS,SAAU7oB,GAC3C,OAAO8M,KAAK2Y,IAAI3Y,KAAK8b,KAAK5oB,EAAIA,EAAI,GAAKA,EACzC,EAOa8oB,GAAQhc,KAAKgc,OAAS,SAAU9oB,GAC3C,OAAO8M,KAAK2Y,KAAK,EAAIzlB,IAAM,EAAIA,IAAM,CACvC,EAOa+oB,GAAOjc,KAAKic,MAAQ,SAAU/oB,GACzC,OAAQ8M,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,IAAM,CACxC,EAOagpB,GAAOlc,KAAKkc,MAAQ,SAAUhpB,GACzC,OAAQ8M,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,IAAM,CACxC,EAOaipB,GAAOnc,KAAKmc,MAAQ,SAAUjpB,GACzC,MAAMwY,EAAI1L,KAAKkZ,IAAI,EAAIhmB,GACvB,OAAQwY,EAAI,IAAMA,EAAI,EACxB,EAcA,SAAS0P,GAAkBlhB,EAAOkiB,GAChC,OAAI/I,EAASnZ,GACJA,EACEoZ,EAAYpZ,GACdA,EAAMihB,gBAEbiB,GAEJ,CAEA,SAASvB,GAAoB3gB,EAAOmiB,GAClC,OAAIhJ,EAASnZ,GACJA,EACEoZ,EAAYpZ,GACdA,EAAMihB,WAENkB,CAEX,CCtqBA,IAAIC,GAAe,WAIjB,OADAA,GAAeC,EAAAA,OACRA,CACT,EAEA,MAYaC,GAA8BnqB,GAAQ,QAZ9B,CACnB,aACA,WACA,eACA,cAQwE,SAAoB0D,GAAiD,IAA/C,UAAE0mB,EAAS,QAAEC,EAAO,YAAEC,EAAW,SAAEC,GAAU7mB,EAI3I,MAAM4C,EAAQ2jB,KAqUd,OAhUA3jB,EAAMoB,QACNpB,EAAMU,SAAS,CACb,CAAEpB,KAAM,SAAUC,KAAMmb,GACxB,CAAEpb,KAAM,UAAWC,KAAMub,GACzB,CAAExb,KAAM,YAAaC,KAAMob,GAC3B,CAAErb,KAAM,SAAUC,KAAMsb,GACxB,CAAEvb,KAAM,WAAYC,KAAMwb,GAC1B,CAAEzb,KAAM,OAAQC,KAAMyb,GAMtB,CACE1b,KAAM,aACNC,KAAMyE,GAAKiX,GAAY,srkBAAqB1b,KAAKyE,IAEnD,CAAE1E,KAAM,SAAUC,KAAM0b,GACxB,CAAE3b,KAAM,QAASC,KAAM+d,IACvB,CAAEhe,KAAM,QAASC,KAAME,GACvB,CAAEH,KAAM,SAAUC,KAAM2b,GACxB,CAAE5b,KAAM,cAAeC,KAAM6b,GAC7B,CAAE9b,KAAM,eAAgBC,KAAM8b,GAC9B,CAAE/b,KAAM,QAASC,KAAM+b,GACvB,CAAEhc,KAAM,QAASC,KAAMgc,GACvB,CAAEjc,KAAM,UAAWC,KAAMic,GACzB,CAAElc,KAAM,YAAaC,KAAMkc,GAC3B,CAAEnc,KAAM,OAAQC,KAAMmc,GACtB,CAAEpc,KAAM,WAAYC,KAAMoc,GAC1B,CAAErc,KAAM,OAAQC,KAAMqc,GACtB,CAAEtc,KAAM,SAAUC,KAAMsc,GACxB,CAAEvc,KAAM,OAAQC,KAAMyc,GACtB,CAAE1c,KAAM,YAAaC,KAAM0c,GAE3B,CAAE3c,KAAM,eAAgBC,KAAM2c,GAC9B,CAAE5c,KAAM,YAAaC,KAAM6c,GAC3B,CAAE9c,KAAM,iBAAkBC,KAAM8c,GAChC,CAAE/c,KAAM,YAAaC,KAAM+c,GAC3B,CAAEhd,KAAM,kBAAmBC,KAAMgd,GACjC,CAAEjd,KAAM,eAAgBC,KAAMid,GAC9B,CAAEld,KAAM,eAAgBC,KAAMwd,GAC9B,CAAEzd,KAAM,yBAA0BC,KAAMud,GACxC,CAAExd,KAAM,YAAaC,KAAMyd,GAC3B,CAAE1d,KAAM,OAAQC,KAAM4c,GACtB,CAAE7c,KAAM,aAAcC,KAAM0d,GAC5B,CAAE3d,KAAM,eAAgBC,KAAMod,GAC9B,CAAErd,KAAM,kBAAmBC,KAAM2d,IACjC,CAAE5d,KAAM,YAAaC,KAAM4d,IAC3B,CAAE7d,KAAM,iBAAkBC,KAAM6d,IAChC,CAAE9d,KAAM,aAAcC,KAAM8d,IAE5B,CAAE/d,KAAM,MAAOC,KAAMib,GACrB,CAAElb,KAAM,SAAUC,KAAMkb,KAG1Bza,EAAMiS,eAAe,CACnB,CACEjN,KAAM,SACN6L,GAAI,YACJ/G,QAAS,SAAUvP,GAMjB,GALKupB,GACHI,GAAiB3pB,GAIRA,EDwcd4mB,gBACAlK,QAAQ,OAAQ,IAChBA,QAAQ,aAAc,IACtBnc,OC3cmB,GACd,MAAM,IAAI2F,UAAU,uFACLlG,EADK,yDAItB,OAAO,IAAIupB,EAAUvpB,EACvB,GACC,CACDyK,KAAM,SACN6L,GAAI,UACJ/G,QAAS,SAAUvP,GAKjB,OAJKwpB,GACHI,GAAe5pB,GAGV,IAAIwpB,EAAQxpB,EAAG,EACxB,GACC,CACDyK,KAAM,YACN6L,GAAI,UACJ/G,QAAS,SAAUvP,GAKjB,OAJKwpB,GACHI,GAAe5pB,GAGV,IAAIwpB,EAAQxpB,EAAEioB,WAAY,EACnC,GACC,CACDxd,KAAM,SACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,GAAIA,EAAI6pB,OAAOC,iBACb,MAAM,IAAI5jB,UAAU,gGACoClG,EAAI,KAG9D,OAAO6pB,OAAO7pB,EAChB,GACC,CACDyK,KAAM,SACN6L,GAAI,YACJ/G,QAAS,SAAUvP,GAKjB,OAJKupB,GACHI,GAAiB3pB,GAGZ,IAAIupB,EAAUvpB,EAAEoS,WACzB,GACC,CACD3H,KAAM,SACN6L,GAAI,WACJ/G,QAAS,SAAUvP,GAKjB,OAJK0pB,GACHK,GAAgB/pB,GAGX,IAAI0pB,EAAS1pB,EACtB,GACC,CACDyK,KAAM,WACN6L,GAAI,YACJ/G,QAAS,SAAUvP,GACjB,MAAM,IAAIkG,UAAU,4JAEtB,GACC,CACDuE,KAAM,WACN6L,GAAI,UACJ/G,QAAS,SAAUvP,GAKjB,OAJKwpB,GACHI,GAAe5pB,GAGV,IAAIwpB,EAAQxpB,EAAEgf,UAAW,EAClC,GACC,CACDvU,KAAM,SACN6L,GAAI,WACJ/G,QAAS,SAAUvP,GACZ0pB,GACHK,GAAgB/pB,GAGlB,MAAMU,EAAI,IAAIgpB,EAAS1pB,GACvB,GAAIU,EAAEse,YAAchf,EAClB,MAAM,IAAIkG,UAAU,mGACLlG,EADK,uDAItB,OAAOU,CACT,GACC,CAQD+J,KAAM,SACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,MAAM6D,EAAIgmB,OAAO7pB,GACjB,GAAIod,MAAMvZ,GACR,MAAM,IAAIgS,MAAM,mBAAqB7V,EAAI,iBAE3C,OAAO6D,CACT,GACC,CACD4G,KAAM,SACN6L,GAAI,YACJ/G,QAAS,SAAUvP,GACZupB,GACHI,GAAiB3pB,GAGnB,IACE,OAAO,IAAIupB,EAAUvpB,EACvB,CAAE,MAAOoM,GACP,MAAM,IAAIyJ,MAAM,mBAAqB7V,EAAI,iBAC3C,CACF,GACC,CACDyK,KAAM,SACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,IACE,OAAOolB,OAAOplB,EAChB,CAAE,MAAOoM,GACP,MAAM,IAAIyJ,MAAM,mBAAqB7V,EAAI,cAC3C,CACF,GACC,CACDyK,KAAM,SACN6L,GAAI,WACJ/G,QAAS,SAAUvP,GACZ0pB,GACHK,GAAgB/pB,GAGlB,IACE,OAAO,IAAI0pB,EAAS1pB,EACtB,CAAE,MAAOoM,GACP,MAAM,IAAIyJ,MAAM,mBAAqB7V,EAAI,gBAC3C,CACF,GACC,CACDyK,KAAM,SACN6L,GAAI,UACJ/G,QAAS,SAAUvP,GACZwpB,GACHI,GAAe5pB,GAGjB,IACE,OAAO,IAAIwpB,EAAQxpB,EACrB,CAAE,MAAOoM,GACP,MAAM,IAAIyJ,MAAM,mBAAqB7V,EAAI,eAC3C,CACF,GACC,CACDyK,KAAM,UACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,OAAQA,CACV,GACC,CACDyK,KAAM,UACN6L,GAAI,YACJ/G,QAAS,SAAUvP,GAKjB,OAJKupB,GACHI,GAAiB3pB,GAGZ,IAAIupB,GAAWvpB,EACxB,GACC,CACDyK,KAAM,UACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,OAAOolB,QAAQplB,EACjB,GACC,CACDyK,KAAM,UACN6L,GAAI,WACJ/G,QAAS,SAAUvP,GAKjB,OAJK0pB,GACHK,GAAgB/pB,GAGX,IAAI0pB,GAAU1pB,EACvB,GACC,CACDyK,KAAM,UACN6L,GAAI,SACJ/G,QAAS,SAAUvP,GACjB,OAAOoD,OAAOpD,EAChB,GACC,CACDyK,KAAM,QACN6L,GAAI,SACJ/G,QAAS,SAAUya,GAKjB,OAJKP,GAgEb,WACE,MAAM,IAAI5T,MAAM,sEAClB,CAjEUoU,GAGK,IAAIR,EAAYO,EACzB,GACC,CACDvf,KAAM,SACN6L,GAAI,QACJ/G,QAAS,SAAU2a,GACjB,OAAOA,EAAOlL,SAChB,KAQJvZ,EAAM0P,WAAa,CAACpQ,EAAM+G,EAAM/D,KAC9B,MAAMoiB,EAAa1kB,EAAM0G,YAAYpH,EAAM+G,EAAM/D,GACjD,GAAI,CAAC,YAAa,YAAYsa,SAAS8H,EAAWpmB,KAAK2I,WACnC,IAAhBZ,EAAKvL,QAAgBqgB,EAAa9U,EAAK,KAEvC/D,EAAWgB,MAAKqhB,IAAQA,EAAI1iB,OAAO2a,SAAS,OAAO,CACrD,MAAMjW,EAAM,IAAIlG,UACd,aAAanB,qFACiCA,QAEhD,MADAqH,EAAIrI,KAAOomB,EAAWpmB,KAChBqI,CACR,CACA,MAAM+d,CAAU,EAOlB1kB,EAAM0P,WAAa,CAACpQ,EAAM+G,EAAM/D,KAC9B,MAAMoiB,EAAa1kB,EAAM0G,YAAYpH,EAAM+G,EAAM/D,GACjD,GAAI,CAAC,YAAa,YAAYsa,SAAS8H,EAAWpmB,KAAK2I,WACnC,IAAhBZ,EAAKvL,QAAgBqgB,EAAa9U,EAAK,KAEvC/D,EAAWgB,MAAKqhB,IAAQA,EAAI1iB,OAAO2a,SAAS,OAAO,CACrD,MAAMjW,EAAM,IAAIlG,UACd,aAAanB,qFACiCA,QAEhD,MADAqH,EAAIrI,KAAOomB,EAAWpmB,KAChBqI,CACR,CACA,MAAM+d,CAAU,EAGX1kB,CACT,IAEA,SAASkkB,GAAkB3pB,GACzB,MAAM,IAAI6V,MAAM,wBAAwB7V,oDAC1C,CAEA,SAAS4pB,GAAgB5pB,GACvB,MAAM,IAAI6V,MAAM,wBAAwB7V,uDAC1C,CAMA,SAAS+pB,GAAiB/pB,GACxB,MAAM,IAAI6V,MAAM,wBAAwB7V,mDAC1C,CCjcA,MAGaqqB,GAAkClrB,GAHlC,YACQ,IAEsD,KAOzE,SAASmrB,EAAWjL,GAClB,KAAM7f,gBAAgB8qB,GACpB,MAAM,IAAIpf,YAAY,oDAGxB1L,KAAK6f,QAAUA,GAAW,EAC5B,CAkDA,OA7CAiL,EAAUloB,UAAUyD,KAAO,YAC3BykB,EAAUloB,UAAU8e,aAAc,EAOlCoJ,EAAUloB,UAAU4c,QAAU,WAC5B,OAAOxf,KAAK6f,OACd,EAOAiL,EAAUloB,UAAUgQ,SAAW,WAC7B,MAAO,IAAM5S,KAAK6f,QAAQnW,IAAI9F,QAAQwE,KAAK,MAAQ,GACrD,EAQA0iB,EAAUloB,UAAUmoB,OAAS,WAC3B,MAAO,CACLC,OAAQ,YACRnL,QAAS7f,KAAK6f,QAElB,EASAiL,EAAUG,SAAW,SAAUC,GAC7B,OAAO,IAAIJ,EAAUI,EAAKrL,QAC5B,EAEOiL,CAAS,GACf,CAAEK,SAAS,ICvDd,IAkFEC,GAASC,GAlFPC,GAAY,KAIdC,GAAa,IAGbC,GAAW,mBAGXpF,GAAO,qgCAGPqF,GAAK,qgCAILC,GAAW,CAOT1E,UAAW,GAiBX2E,SAAU,EAeVC,OAAQ,EAIRC,UAAW,EAIXC,SAAW,GAIXC,MAAOT,GAIPU,KAAMV,GAGNvQ,QAAQ,GAQVkR,IAAW,EAEXC,GAAe,kBACfC,GAAkBD,GAAe,qBACjCE,GAAyBF,GAAe,2BACxCG,GAAoBH,GAAe,qBACnCI,GAAM,mBAENC,GAAYjf,KAAKsM,MACjB4S,GAAUlf,KAAK4M,IAEfuS,GAAW,6CACXC,GAAQ,yDACRC,GAAU,gDACV9L,GAAY,qCAEZ+L,GAAO,IAIPC,GAAiBzG,GAAKrlB,OAAS,EAC/B+rB,GAAerB,GAAG1qB,OAAS,EAG3BgsB,GAAI,CAAErO,YAAa4N,IAy1ErB,SAASU,GAAensB,GACtB,IAAIiB,EAAGhB,EAAGmsB,EACRC,EAAkBrsB,EAAEE,OAAS,EAC7BqC,EAAM,GACNzC,EAAIE,EAAE,GAER,GAAIqsB,EAAkB,EAAG,CAEvB,IADA9pB,GAAOzC,EACFmB,EAAI,EAAGA,EAAIorB,EAAiBprB,KAE/BhB,EA12EO,GAy2EPmsB,EAAKpsB,EAAEiB,GAAK,IACMf,UACXqC,GAAO+pB,GAAcrsB,IAC5BsC,GAAO6pB,GAKTnsB,EAj3ES,GAg3ETmsB,GADAtsB,EAAIE,EAAEiB,IACG,IACSf,UACXqC,GAAO+pB,GAAcrsB,GAC9B,MAAO,GAAU,IAANH,EACT,MAAO,IAIT,KAAOA,EAAI,IAAO,GAAIA,GAAK,GAE3B,OAAOyC,EAAMzC,CACf,CAGA,SAASysB,GAAWtrB,EAAGyL,EAAKG,GAC1B,GAAI5L,MAAQA,GAAKA,EAAIyL,GAAOzL,EAAI4L,EAC9B,MAAM2I,MAAM8V,GAAkBrqB,EAElC,CAQA,SAASurB,GAAoBxsB,EAAGiB,EAAGwrB,EAAIC,GACrC,IAAIC,EAAI1sB,EAAGib,EAAG0R,EAGd,IAAK3sB,EAAID,EAAE,GAAIC,GAAK,GAAIA,GAAK,KAAMgB,EAwCnC,QArCMA,EAAI,GACRA,GAl5ES,EAm5ET0rB,EAAK,IAELA,EAAKlgB,KAAKogB,MAAM5rB,EAAI,GAr5EX,GAs5ETA,GAt5ES,GA45EXhB,EAAI0rB,GAAQ,GA55ED,EA45EgB1qB,GAC3B2rB,EAAK5sB,EAAE2sB,GAAM1sB,EAAI,EAEA,MAAbysB,EACEzrB,EAAI,GACG,GAALA,EAAQ2rB,EAAKA,EAAK,IAAM,EACd,GAAL3rB,IAAQ2rB,EAAKA,EAAK,GAAK,GAChC1R,EAAIuR,EAAK,GAAW,OAANG,GAAeH,EAAK,GAAW,OAANG,GAAqB,KAANA,GAAqB,GAANA,GAErE1R,GAAKuR,EAAK,GAAKG,EAAK,GAAK3sB,GAAKwsB,EAAK,GAAKG,EAAK,GAAK3sB,EAAI,KACnDD,EAAE2sB,EAAK,GAAK1sB,EAAI,IAAM,IAAM0rB,GAAQ,GAAI1qB,EAAI,GAAK,IAC/C2rB,GAAM3sB,EAAI,GAAW,GAAN2sB,MAAa5sB,EAAE2sB,EAAK,GAAK1sB,EAAI,IAAM,GAGrDgB,EAAI,GACG,GAALA,EAAQ2rB,EAAKA,EAAK,IAAO,EACf,GAAL3rB,EAAQ2rB,EAAKA,EAAK,IAAM,EACnB,GAAL3rB,IAAQ2rB,EAAKA,EAAK,GAAK,GAChC1R,GAAKwR,GAAaD,EAAK,IAAY,MAANG,IAAeF,GAAaD,EAAK,GAAW,MAANG,GAEnE1R,IAAMwR,GAAaD,EAAK,IAAMG,EAAK,GAAK3sB,IACtCysB,GAAaD,EAAK,GAAMG,EAAK,GAAK3sB,EAAI,KACrCD,EAAE2sB,EAAK,GAAK1sB,EAAI,IAAO,IAAM0rB,GAAQ,GAAI1qB,EAAI,GAAK,EAIlDia,CACT,CAMA,SAAS4R,GAAYvqB,EAAKwqB,EAAQC,GAOhC,IANA,IAAI9rB,EAEF+rB,EADAxd,EAAM,CAAC,GAEPxO,EAAI,EACJisB,EAAO3qB,EAAIrC,OAENe,EAAIisB,GAAO,CAChB,IAAKD,EAAOxd,EAAIvP,OAAQ+sB,KAASxd,EAAIwd,IAASF,EAE9C,IADAtd,EAAI,IAAMkb,GAAS1hB,QAAQ1G,EAAI4qB,OAAOlsB,MACjCC,EAAI,EAAGA,EAAIuO,EAAIvP,OAAQgB,IACtBuO,EAAIvO,GAAK8rB,EAAU,SACF,IAAfvd,EAAIvO,EAAI,KAAeuO,EAAIvO,EAAI,GAAK,GACxCuO,EAAIvO,EAAI,IAAMuO,EAAIvO,GAAK8rB,EAAU,EACjCvd,EAAIvO,IAAM8rB,EAGhB,CAEA,OAAOvd,EAAI2d,SACb,CAh4EAlB,GAAEmB,cAAgBnB,GAAEnF,IAAM,WACxB,IAAIpnB,EAAI,IAAIR,KAAKqF,YAAYrF,MAE7B,OADIQ,EAAEyJ,EAAI,IAAGzJ,EAAEyJ,EAAI,GACZkkB,GAAS3tB,EAClB,EAQAusB,GAAEW,KAAO,WACP,OAAOS,GAAS,IAAInuB,KAAKqF,YAAYrF,MAAOA,KAAKgZ,EAAI,EAAG,EAC1D,EAWA+T,GAAEqB,UAAYrB,GAAEsB,MAAQ,SAAU9gB,EAAKG,GACrC,IACElN,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAGX,GAFAkI,EAAM,IAAI+gB,EAAK/gB,GACfG,EAAM,IAAI4gB,EAAK5gB,IACVH,EAAItD,IAAMyD,EAAIzD,EAAG,OAAO,IAAIqkB,EAAKC,KACtC,GAAIhhB,EAAIihB,GAAG9gB,GAAM,MAAM2I,MAAM8V,GAAkBze,GAE/C,OADIlN,EAAEiuB,IAAIlhB,GACC,EAAIA,EAAM/M,EAAEiuB,IAAI/gB,GAAO,EAAIA,EAAM,IAAI4gB,EAAK9tB,EACvD,EAWAusB,GAAE2B,WAAa3B,GAAE0B,IAAM,SAAUhuB,GAC/B,IAAIqB,EAAGC,EAAG4sB,EAAKC,EACbpuB,EAAIR,KACJ6uB,EAAKruB,EAAEK,EACPiuB,GAAMruB,EAAI,IAAID,EAAE6E,YAAY5E,IAAII,EAChCkuB,EAAKvuB,EAAEyJ,EACP+kB,EAAKvuB,EAAEwJ,EAGT,IAAK4kB,IAAOC,EACV,OAAQC,GAAOC,EAAWD,IAAOC,EAAKD,EAAKF,IAAOC,EAAK,GAAKD,EAAKE,EAAK,EAAI,GAAK,EAA3DR,IAItB,IAAKM,EAAG,KAAOC,EAAG,GAAI,OAAOD,EAAG,GAAKE,EAAKD,EAAG,IAAME,EAAK,EAGxD,GAAID,IAAOC,EAAI,OAAOD,EAGtB,GAAIvuB,EAAEwY,IAAMvY,EAAEuY,EAAG,OAAOxY,EAAEwY,EAAIvY,EAAEuY,EAAI+V,EAAK,EAAI,GAAK,EAMlD,IAAKjtB,EAAI,EAAGC,GAJZ4sB,EAAME,EAAG9tB,SACT6tB,EAAME,EAAG/tB,QAGmB4tB,EAAMC,EAAK9sB,EAAIC,IAAKD,EAC9C,GAAI+sB,EAAG/sB,KAAOgtB,EAAGhtB,GAAI,OAAO+sB,EAAG/sB,GAAKgtB,EAAGhtB,GAAKitB,EAAK,EAAI,GAAK,EAI5D,OAAOJ,IAAQC,EAAM,EAAID,EAAMC,EAAMG,EAAK,EAAI,GAAK,CACrD,EAgBAhC,GAAEkC,OAASlC,GAAEmC,IAAM,WACjB,IAAIC,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAEK,EAGFL,EAAEK,EAAE,IAETsuB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK7hB,KAAKI,IAAIlN,EAAEwY,EAAGxY,EAAE4uB,MA3L3B,EA4LXd,EAAK3C,SAAW,EAEhBnrB,EA2xEF,SAAgB8tB,EAAM9tB,GACpB,IAAIM,EAAGwY,EAAK7Y,EAEZ,GAAID,EAAE6uB,SAAU,OAAO7uB,GAMvB8Y,EAAM9Y,EAAEK,EAAEE,QACA,GAERN,GAAK,EAAI6uB,GAAQ,EADjBxuB,EAAIwM,KAAKogB,KAAKpU,EAAM,KACI1G,YAExB9R,EAAI,GACJL,EAAI,gCAGN6tB,EAAKtH,WAAalmB,EAElBN,EAAI+uB,GAAajB,EAAM,EAAG9tB,EAAEgvB,MAAM/uB,GAAI,IAAI6tB,EAAK,IAG/C,IAAK,IAAIxsB,EAAIhB,EAAGgB,KAAM,CACpB,IAAI2tB,EAAQjvB,EAAEgvB,MAAMhvB,GACpBA,EAAIivB,EAAMD,MAAMC,GAAOC,MAAMD,GAAOD,MAAM,GAAGG,KAAK,EACpD,CAIA,OAFArB,EAAKtH,WAAalmB,EAEXN,CACT,CA1zEMyuB,CAAOX,EAAMsB,GAAiBtB,EAAM9tB,IAExC8tB,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAETa,GAAqB,GAAZ9C,IAA6B,GAAZA,GAAgB7qB,EAAEqvB,MAAQrvB,EAAG2uB,EAAI7B,GAAI,IAZlD,IAAIgB,EAAK,GAHZ,IAAIA,EAAKC,IAgB5B,EAmBAxB,GAAE+C,SAAW/C,GAAEzG,KAAO,WACpB,IAAItN,EAAG+W,EAAG1rB,EAAG0X,EAAGiU,EAAK/lB,EAAGmlB,EAAI7uB,EAAG0vB,EAAIC,EACjC1vB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,IAAK7E,EAAE8kB,YAAc9kB,EAAE6uB,SAAU,OAAO,IAAIf,EAAK9tB,GAoCjD,IAnCAyrB,IAAW,GAGXhiB,EAAIzJ,EAAEyJ,EAAIuiB,GAAQhsB,EAAEyJ,EAAIzJ,EAAG,EAAI,KAIrB8M,KAAKsa,IAAI3d,IAAM,IAqBvB8R,EAAI,IAAIuS,EAAKrkB,EAAE2I,aApBfvO,EAAI2oB,GAAexsB,EAAEK,IAIjBoJ,IAHJ+O,EAAIxY,EAAEwY,GAGO3U,EAAEtD,OAAS,GAAK,KAAGsD,GAAW,GAAL4F,IAAgB,GAANA,EAAU,IAAM,MAChEA,EAAIuiB,GAAQnoB,EAAG,EAAI,GAGnB2U,EAAIuT,IAAWvT,EAAI,GAAK,IAAMA,EAAI,IAAMA,EAAI,GAAK,EAAI,KASrD+C,EAAI,IAAIuS,EANNjqB,EADE4F,GAAK,IACH,KAAO+O,GAEX3U,EAAI4F,EAAEmd,iBACAllB,MAAM,EAAGmC,EAAEyF,QAAQ,KAAO,GAAKkP,IAIrC/O,EAAIzJ,EAAEyJ,GAKVmlB,GAAMpW,EAAIsV,EAAKtH,WAAa,IAW1B,GAJAkJ,GADAD,GADA1vB,EAAIwb,GACGyT,MAAMjvB,GAAGivB,MAAMjvB,IACTovB,KAAKnvB,GAClBub,EAAIoU,GAAOD,EAAQP,KAAKnvB,GAAGgvB,MAAMjvB,GAAI2vB,EAAQP,KAAKM,GAAKb,EAAK,EAAG,GAG3DpC,GAAezsB,EAAEM,GAAGqB,MAAM,EAAGktB,MAAS/qB,EAAI2oB,GAAejR,EAAElb,IAAIqB,MAAM,EAAGktB,GAAK,CAK/E,GAAS,SAJT/qB,EAAIA,EAAEnC,MAAMktB,EAAK,EAAGA,EAAK,MAILY,GAAY,QAAL3rB,GAepB,EAICA,KAAOA,EAAEnC,MAAM,IAAqB,KAAfmC,EAAE2pB,OAAO,MAGlCG,GAASpS,EAAG/C,EAAI,EAAG,GACnB+W,GAAKhU,EAAEyT,MAAMzT,GAAGyT,MAAMzT,GAAGqU,GAAG5vB,IAG9B,KACF,CAvBE,IAAKwvB,IACH7B,GAAS5tB,EAAGyY,EAAI,EAAG,GAEfzY,EAAEivB,MAAMjvB,GAAGivB,MAAMjvB,GAAG6vB,GAAG5vB,IAAI,CAC7Bub,EAAIxb,EACJ,KACF,CAGF6uB,GAAM,EACNY,EAAM,CAcV,CAKF,OAFA/D,IAAW,EAEJkC,GAASpS,EAAG/C,EAAGsV,EAAK3C,SAAUoE,EACvC,EAOAhD,GAAEsD,cAAgBtD,GAAEuD,GAAK,WACvB,IAAI3vB,EACFE,EAAIb,KAAKa,EACTwD,EAAIkqB,IAEN,GAAI1tB,EAAG,CAML,GAJAwD,EA5TS,IA2TT1D,EAAIE,EAAEE,OAAS,GACNwrB,GAAUvsB,KAAKgZ,EA5Tf,IA+TTrY,EAAIE,EAAEF,GACC,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAI0D,IAChCA,EAAI,IAAGA,EAAI,EACjB,CAEA,OAAOA,CACT,EAwBA0oB,GAAEwD,UAAYxD,GAAEyD,IAAM,SAAU/vB,GAC9B,OAAO0vB,GAAOnwB,KAAM,IAAIA,KAAKqF,YAAY5E,GAC3C,EAQAssB,GAAE0D,mBAAqB1D,GAAE2D,SAAW,SAAUjwB,GAC5C,IACE6tB,EADMtuB,KACGqF,YACX,OAAO8oB,GAASgC,GAFRnwB,KAEkB,IAAIsuB,EAAK7tB,GAAI,EAAG,EAAG,GAAI6tB,EAAKtH,UAAWsH,EAAK3C,SACxE,EAOAoB,GAAE4D,OAAS5D,GAAEqD,GAAK,SAAU3vB,GAC1B,OAAuB,IAAhBT,KAAKyuB,IAAIhuB,EAClB,EAQAssB,GAAEnT,MAAQ,WACR,OAAOuU,GAAS,IAAInuB,KAAKqF,YAAYrF,MAAOA,KAAKgZ,EAAI,EAAG,EAC1D,EAQA+T,GAAE6D,YAAc7D,GAAEyB,GAAK,SAAU/tB,GAC/B,OAAOT,KAAKyuB,IAAIhuB,GAAK,CACvB,EAQAssB,GAAE8D,qBAAuB9D,GAAE+D,IAAM,SAAUrwB,GACzC,IAAIK,EAAId,KAAKyuB,IAAIhuB,GACjB,OAAY,GAALK,GAAgB,IAANA,CACnB,EA4BAisB,GAAEgE,iBAAmBhE,GAAExD,KAAO,WAC5B,IAAIzoB,EAAGuD,EAAG8qB,EAAI7B,EAAIhU,EAChB9Y,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YACT2rB,EAAM,IAAI1C,EAAK,GAEjB,IAAK9tB,EAAE8kB,WAAY,OAAO,IAAIgJ,EAAK9tB,EAAEyJ,EAAI,IAAQskB,KACjD,GAAI/tB,EAAE6uB,SAAU,OAAO2B,EAEvB7B,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK7hB,KAAKI,IAAIlN,EAAEwY,EAAGxY,EAAE4uB,MAAQ,EAC9Cd,EAAK3C,SAAW,GAChBrS,EAAM9Y,EAAEK,EAAEE,QAOA,GAERsD,GAAK,EAAIirB,GAAQ,EADjBxuB,EAAIwM,KAAKogB,KAAKpU,EAAM,KACI1G,YAExB9R,EAAI,GACJuD,EAAI,gCAGN7D,EAAI+uB,GAAajB,EAAM,EAAG9tB,EAAEgvB,MAAMnrB,GAAI,IAAIiqB,EAAK,IAAI,GAMnD,IAHA,IAAI2C,EACFnvB,EAAIhB,EACJowB,EAAK,IAAI5C,EAAK,GACTxsB,KACLmvB,EAAUzwB,EAAEgvB,MAAMhvB,GAClBA,EAAIwwB,EAAItB,MAAMuB,EAAQzB,MAAM0B,EAAGxB,MAAMuB,EAAQzB,MAAM0B,MAGrD,OAAO/C,GAAS3tB,EAAG8tB,EAAKtH,UAAYmI,EAAIb,EAAK3C,SAAW2B,GAAI,EAC9D,EAiCAP,GAAEoE,eAAiBpE,GAAEvD,KAAO,WAC1B,IAAI1oB,EAAGquB,EAAI7B,EAAIhU,EACb9Y,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,IAAK7E,EAAE8kB,YAAc9kB,EAAE6uB,SAAU,OAAO,IAAIf,EAAK9tB,GAQjD,GANA2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK7hB,KAAKI,IAAIlN,EAAEwY,EAAGxY,EAAE4uB,MAAQ,EAC9Cd,EAAK3C,SAAW,GAChBrS,EAAM9Y,EAAEK,EAAEE,QAEA,EACRP,EAAI+uB,GAAajB,EAAM,EAAG9tB,EAAGA,GAAG,OAC3B,CAYLM,GADAA,EAAI,IAAMwM,KAAK8b,KAAK9P,IACZ,GAAK,GAAS,EAAJxY,EAGlBN,EAAI+uB,GAAajB,EAAM,EADvB9tB,EAAIA,EAAEgvB,MAAM,EAAIF,GAAQ,EAAGxuB,IACEN,GAAG,GAOhC,IAJA,IAAI4wB,EACFC,EAAK,IAAI/C,EAAK,GACdgD,EAAM,IAAIhD,EAAK,IACfiD,EAAM,IAAIjD,EAAK,IACVxtB,KACLswB,EAAU5wB,EAAEgvB,MAAMhvB,GAClBA,EAAIA,EAAEgvB,MAAM6B,EAAG1B,KAAKyB,EAAQ5B,MAAM8B,EAAI9B,MAAM4B,GAASzB,KAAK4B,KAE9D,CAKA,OAHAjD,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAETa,GAAS3tB,EAAG2uB,EAAI7B,GAAI,EAC7B,EAmBAP,GAAEyE,kBAAoBzE,GAAEtD,KAAO,WAC7B,IAAI0F,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAE8kB,WACH9kB,EAAE6uB,SAAiB,IAAIf,EAAK9tB,IAEhC2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK,EACtBb,EAAK3C,SAAW,EAETwE,GAAO3vB,EAAEgpB,OAAQhpB,EAAE+oB,OAAQ+E,EAAKtH,UAAYmI,EAAIb,EAAK3C,SAAW2B,IAR7C,IAAIgB,EAAK9tB,EAAEyJ,EASvC,EAsBA8iB,GAAE0E,cAAgB1E,GAAE2E,KAAO,WACzB,IAAIlxB,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YACTvE,EAAIN,EAAEonB,MAAM6G,IAAI,GAChBU,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SAEZ,OAAW,IAAP7qB,EACW,IAANA,EAEHN,EAAEmxB,QAAUC,GAAMtD,EAAMa,EAAI7B,GAAM,IAAIgB,EAAK,GAE3C,IAAIA,EAAKC,KAGX/tB,EAAE6uB,SAAiBuC,GAAMtD,EAAMa,EAAK,EAAG7B,GAAIkC,MAAM,KAIrDlB,EAAKtH,UAAYmI,EAAK,EACtBb,EAAK3C,SAAW,EAGhBnrB,EAAI,IAAI8tB,EAAK,GAAGoB,MAAMlvB,GAAGgwB,IAAIhwB,EAAEmvB,KAAK,IAAIvG,OAAOyI,OAE/CvD,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAET9sB,EAAEgvB,MAAM,GACjB,EAsBAzC,GAAE+E,wBAA0B/E,GAAE5D,MAAQ,WACpC,IAAIgG,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAI7E,EAAEuxB,IAAI,GAAW,IAAIzD,EAAK9tB,EAAE4vB,GAAG,GAAK,EAAI7B,KACvC/tB,EAAE8kB,YAEP6J,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK7hB,KAAKI,IAAIJ,KAAKsa,IAAIpnB,EAAEwY,GAAIxY,EAAE4uB,MAAQ,EACxDd,EAAK3C,SAAW,EAChBM,IAAW,EAEXzrB,EAAIA,EAAEgvB,MAAMhvB,GAAGkvB,MAAM,GAAGtG,OAAOuG,KAAKnvB,GAEpCyrB,IAAW,EACXqC,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAET9sB,EAAEwxB,MAdiB,IAAI1D,EAAK9tB,EAerC,EAmBAusB,GAAEkF,sBAAwBlF,GAAE1D,MAAQ,WAClC,IAAI8F,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAE8kB,YAAc9kB,EAAE6uB,SAAiB,IAAIf,EAAK9tB,IAEjD2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK,EAAI7hB,KAAKI,IAAIJ,KAAKsa,IAAIpnB,EAAEwY,GAAIxY,EAAE4uB,MAAQ,EAC5Dd,EAAK3C,SAAW,EAChBM,IAAW,EAEXzrB,EAAIA,EAAEgvB,MAAMhvB,GAAGmvB,KAAK,GAAGvG,OAAOuG,KAAKnvB,GAEnCyrB,IAAW,EACXqC,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAET9sB,EAAEwxB,KACX,EAsBAjF,GAAEmF,yBAA2BnF,GAAEzD,MAAQ,WACrC,IAAI6F,EAAI7B,EAAI6E,EAAKC,EACf5xB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAE8kB,WACH9kB,EAAEwY,GAAK,EAAU,IAAIsV,EAAK9tB,EAAEonB,MAAMwI,GAAG,GAAK5vB,EAAEyJ,EAAI,EAAIzJ,EAAE6uB,SAAW7uB,EAAI+tB,MAEzEY,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACVyG,EAAM5xB,EAAE4uB,KAEJ9hB,KAAKI,IAAI0kB,EAAKjD,GAAM,GAAK3uB,EAAEwY,EAAI,EAAUmV,GAAS,IAAIG,EAAK9tB,GAAI2uB,EAAI7B,GAAI,IAE3EgB,EAAKtH,UAAYmL,EAAMC,EAAM5xB,EAAEwY,EAE/BxY,EAAI2vB,GAAO3vB,EAAEmvB,KAAK,GAAI,IAAIrB,EAAK,GAAGoB,MAAMlvB,GAAI2xB,EAAMhD,EAAI,GAEtDb,EAAKtH,UAAYmI,EAAK,EACtBb,EAAK3C,SAAW,EAEhBnrB,EAAIA,EAAEwxB,KAEN1D,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAET9sB,EAAEgvB,MAAM,MArBW,IAAIlB,EAAKC,IAsBrC,EAwBAxB,GAAEsF,YAActF,GAAEuF,KAAO,WACvB,IAAIC,EAAQzxB,EACVquB,EAAI7B,EACJ9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAI7E,EAAE6uB,SAAiB,IAAIf,EAAK9tB,IAEhCM,EAAIN,EAAEonB,MAAM6G,IAAI,GAChBU,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,UAEC,IAAP7qB,EAGQ,IAANA,IACFyxB,EAASX,GAAMtD,EAAMa,EAAK,EAAG7B,GAAIkC,MAAM,KAChCvlB,EAAIzJ,EAAEyJ,EACNsoB,GAIF,IAAIjE,EAAKC,MAKlBD,EAAKtH,UAAYmI,EAAK,EACtBb,EAAK3C,SAAW,EAEhBnrB,EAAIA,EAAEgwB,IAAI,IAAIlC,EAAK,GAAGoB,MAAMlvB,EAAEgvB,MAAMhvB,IAAI4oB,OAAOuG,KAAK,IAAIkC,OAExDvD,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAET9sB,EAAEgvB,MAAM,IACjB,EAqBAzC,GAAEyF,eAAiBzF,GAAE8E,KAAO,WAC1B,IAAI/vB,EAAGC,EAAGjB,EAAGuD,EAAGouB,EAAIlyB,EAAGwb,EAAGoW,EAAKO,EAC7BlyB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YACT8pB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SAEZ,GAAKnrB,EAAE8kB,WAOA,IAAI9kB,EAAE6uB,SACX,OAAO,IAAIf,EAAK9tB,GACX,GAAIA,EAAEonB,MAAMwI,GAAG,IAAMjB,EAAK,GAAKrC,GAGpC,OAFA/Q,EAAI6V,GAAMtD,EAAMa,EAAK,EAAG7B,GAAIkC,MAAM,MAChCvlB,EAAIzJ,EAAEyJ,EACD8R,CACT,KAbmB,CACjB,IAAKvb,EAAEyJ,EAAG,OAAO,IAAIqkB,EAAKC,KAC1B,GAAIY,EAAK,GAAKrC,GAGZ,OAFA/Q,EAAI6V,GAAMtD,EAAMa,EAAK,EAAG7B,GAAIkC,MAAM,KAChCvlB,EAAIzJ,EAAEyJ,EACD8R,CAEX,CAmBA,IAXAuS,EAAKtH,UAAYmL,EAAMhD,EAAK,GAC5Bb,EAAK3C,SAAW,EAUX7pB,EAFLhB,EAAIwM,KAAKC,IAAI,GAAI4kB,EA92BN,EA82BuB,EAAI,GAE1BrwB,IAAKA,EAAGtB,EAAIA,EAAEgwB,IAAIhwB,EAAEgvB,MAAMhvB,GAAGmvB,KAAK,GAAGvG,OAAOuG,KAAK,IAW7D,IATA1D,IAAW,EAEXlqB,EAAIuL,KAAKogB,KAAKyE,EAp3BH,GAq3BX9tB,EAAI,EACJquB,EAAKlyB,EAAEgvB,MAAMhvB,GACbub,EAAI,IAAIuS,EAAK9tB,GACbiyB,EAAKjyB,GAGS,IAAPsB,GAOL,GANA2wB,EAAKA,EAAGjD,MAAMkD,GACdnyB,EAAIwb,EAAE2T,MAAM+C,EAAGjC,IAAInsB,GAAK,IAExBouB,EAAKA,EAAGjD,MAAMkD,QAGC,KAFf3W,EAAIxb,EAAEovB,KAAK8C,EAAGjC,IAAInsB,GAAK,KAEjBxD,EAAEkB,GAAe,IAAKD,EAAIC,EAAGga,EAAElb,EAAEiB,KAAOvB,EAAEM,EAAEiB,IAAMA,MAO1D,OAJIhB,IAAGib,EAAIA,EAAEyT,MAAM,GAAM1uB,EAAI,IAE7BmrB,IAAW,EAEJkC,GAASpS,EAAGuS,EAAKtH,UAAYmI,EAAIb,EAAK3C,SAAW2B,GAAI,EAC9D,EAOAP,GAAEzH,SAAW,WACX,QAAStlB,KAAKa,CAChB,EAOAksB,GAAE1H,UAAY0H,GAAE4F,MAAQ,WACtB,QAAS3yB,KAAKa,GAAK0rB,GAAUvsB,KAAKgZ,EA35BvB,GA25BuChZ,KAAKa,EAAEE,OAAS,CACpE,EAOAgsB,GAAEnP,MAAQ,WACR,OAAQ5d,KAAKiK,CACf,EAOA8iB,GAAE6F,WAAa7F,GAAE4E,MAAQ,WACvB,OAAO3xB,KAAKiK,EAAI,CAClB,EAOA8iB,GAAE8F,WAAa9F,GAAE+F,MAAQ,WACvB,OAAO9yB,KAAKiK,EAAI,CAClB,EAOA8iB,GAAEsC,OAAS,WACT,QAASrvB,KAAKa,GAAmB,IAAdb,KAAKa,EAAE,EAC5B,EAOAksB,GAAEgG,SAAWhG,GAAEiG,GAAK,SAAUvyB,GAC5B,OAAOT,KAAKyuB,IAAIhuB,GAAK,CACvB,EAOAssB,GAAEkG,kBAAoBlG,GAAEgF,IAAM,SAAUtxB,GACtC,OAAOT,KAAKyuB,IAAIhuB,GAAK,CACvB,EAiCAssB,GAAEmG,UAAYnG,GAAE9G,IAAM,SAAUU,GAC9B,IAAIwM,EAAUtyB,EAAGuyB,EAAatyB,EAAGuyB,EAAKC,EAAKlE,EAAIrT,EAC7C/L,EAAMhQ,KACNsuB,EAAOte,EAAI3K,YACX8pB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SAIZ,GAAY,MAARhF,EACFA,EAAO,IAAI2H,EAAK,IAChB6E,GAAW,MACN,CAKL,GAHAtyB,GADA8lB,EAAO,IAAI2H,EAAK3H,IACP9lB,EAGL8lB,EAAK1c,EAAI,IAAMpJ,IAAMA,EAAE,IAAM8lB,EAAKyJ,GAAG,GAAI,OAAO,IAAI9B,EAAKC,KAE7D4E,EAAWxM,EAAKyJ,GAAG,GACrB,CAKA,GAHAvvB,EAAImP,EAAInP,EAGJmP,EAAI/F,EAAI,IAAMpJ,IAAMA,EAAE,IAAMmP,EAAIogB,GAAG,GACrC,OAAO,IAAI9B,EAAKztB,IAAMA,EAAE,IAAK,IAAkB,GAATmP,EAAI/F,EAASskB,IAAM1tB,EAAI,EAAI,KAKnE,GAAIsyB,EACF,GAAItyB,EAAEE,OAAS,EACbsyB,GAAM,MACD,CACL,IAAKvyB,EAAID,EAAE,GAAIC,EAAI,IAAO,GAAIA,GAAK,GACnCuyB,EAAY,IAANvyB,CACR,CAyBF,GAtBAmrB,IAAW,EAEXqH,EAAMC,GAAiBvjB,EADvBof,EAAKD,EAnCK,GAqCViE,EAAcD,EAAWK,GAAQlF,EAAMc,EAAK,IAAMmE,GAAiB5M,EAAMyI,GAmBrE/B,IAhBJtR,EAAIoU,GAAOmD,EAAKF,EAAahE,EAAI,IAgBPvuB,EAAGC,EAAIquB,EAAI7B,GAEnC,GAME,GAJAgG,EAAMC,GAAiBvjB,EADvBof,GAAM,IAENgE,EAAcD,EAAWK,GAAQlF,EAAMc,EAAK,IAAMmE,GAAiB5M,EAAMyI,GACzErT,EAAIoU,GAAOmD,EAAKF,EAAahE,EAAI,IAE5BiE,EAAK,EAGHrG,GAAejR,EAAElb,GAAGqB,MAAMpB,EAAI,EAAGA,EAAI,IAAM,GAAK,OACnDib,EAAIoS,GAASpS,EAAGoT,EAAK,EAAG,IAG1B,KACF,QACO9B,GAAoBtR,EAAElb,EAAGC,GAAK,GAAIwsB,IAK7C,OAFArB,IAAW,EAEJkC,GAASpS,EAAGoT,EAAI7B,EACzB,EAgDAP,GAAE2C,MAAQ3C,GAAE0G,IAAM,SAAUhzB,GAC1B,IAAII,EAAGmY,EAAGlX,EAAGC,EAAGjB,EAAGwY,EAAK6V,EAAI7B,EAAIuB,EAAI6E,EAAIC,EAAM7E,EAC5CtuB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAKX,GAHA5E,EAAI,IAAI6tB,EAAK7tB,IAGRD,EAAEK,IAAMJ,EAAEI,EAab,OAVKL,EAAEyJ,GAAMxJ,EAAEwJ,EAGNzJ,EAAEK,EAAGJ,EAAEwJ,GAAKxJ,EAAEwJ,EAKlBxJ,EAAI,IAAI6tB,EAAK7tB,EAAEI,GAAKL,EAAEyJ,IAAMxJ,EAAEwJ,EAAIzJ,EAAI+tB,KARzB9tB,EAAI,IAAI6tB,EAAKC,KAUxB9tB,EAIT,GAAID,EAAEyJ,GAAKxJ,EAAEwJ,EAEX,OADAxJ,EAAEwJ,GAAKxJ,EAAEwJ,EACFzJ,EAAEmvB,KAAKlvB,GAShB,GANAouB,EAAKruB,EAAEK,EACPiuB,EAAKruB,EAAEI,EACPsuB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,UAGLkD,EAAG,KAAOC,EAAG,GAAI,CAGpB,GAAIA,EAAG,GAAIruB,EAAEwJ,GAAKxJ,EAAEwJ,MAGf,KAAI4kB,EAAG,GAIP,OAAO,IAAIP,EAAY,IAAPhB,GAAY,EAAI,GAJrB7sB,EAAI,IAAI6tB,EAAK9tB,EAIU,CAEvC,OAAOyrB,GAAWkC,GAAS1tB,EAAG0uB,EAAI7B,GAAM7sB,CAC1C,CAYA,GAPAuY,EAAIuT,GAAU9rB,EAAEuY,EA9qCL,GA+qCX0a,EAAKnH,GAAU/rB,EAAEwY,EA/qCN,GAirCX6V,EAAKA,EAAG3sB,QACRpB,EAAI4yB,EAAK1a,EAGF,CAyBL,KAxBA2a,EAAO7yB,EAAI,IAGTD,EAAIguB,EACJ/tB,GAAKA,EACLwY,EAAMwV,EAAG/tB,SAETF,EAAIiuB,EACJ9V,EAAI0a,EACJpa,EAAMuV,EAAG9tB,QAQPD,GAFJgB,EAAIwL,KAAKI,IAAIJ,KAAKogB,KAAKyB,EArsCd,GAqsC8B7V,GAAO,KAG5CxY,EAAIgB,EACJjB,EAAEE,OAAS,GAIbF,EAAEotB,UACGnsB,EAAIhB,EAAGgB,KAAMjB,EAAEmB,KAAK,GACzBnB,EAAEotB,SAGJ,KAAO,CASL,KAHA0F,GAFA7xB,EAAI+sB,EAAG9tB,SACPuY,EAAMwV,EAAG/tB,WAECuY,EAAMxX,GAEXA,EAAI,EAAGA,EAAIwX,EAAKxX,IACnB,GAAI+sB,EAAG/sB,IAAMgtB,EAAGhtB,GAAI,CAClB6xB,EAAO9E,EAAG/sB,GAAKgtB,EAAGhtB,GAClB,KACF,CAGFhB,EAAI,CACN,CAaA,IAXI6yB,IACF9yB,EAAIguB,EACJA,EAAKC,EACLA,EAAKjuB,EACLJ,EAAEwJ,GAAKxJ,EAAEwJ,GAGXqP,EAAMuV,EAAG9tB,OAIJe,EAAIgtB,EAAG/tB,OAASuY,EAAKxX,EAAI,IAAKA,EAAG+sB,EAAGvV,KAAS,EAGlD,IAAKxX,EAAIgtB,EAAG/tB,OAAQe,EAAIhB,GAAI,CAE1B,GAAI+tB,IAAK/sB,GAAKgtB,EAAGhtB,GAAI,CACnB,IAAKC,EAAID,EAAGC,GAAiB,IAAZ8sB,IAAK9sB,IAAW8sB,EAAG9sB,GAAK6qB,GAAO,IAC9CiC,EAAG9sB,GACL8sB,EAAG/sB,IAAM8qB,EACX,CAEAiC,EAAG/sB,IAAMgtB,EAAGhtB,EACd,CAGA,KAAqB,IAAd+sB,IAAKvV,IAAauV,EAAG9F,MAG5B,KAAiB,IAAV8F,EAAG,GAAUA,EAAGhG,UAAW7P,EAGlC,OAAK6V,EAAG,IAERpuB,EAAEI,EAAIguB,EACNpuB,EAAEuY,EAAI4a,GAAkB/E,EAAI7V,GAErBiT,GAAWkC,GAAS1tB,EAAG0uB,EAAI7B,GAAM7sB,GALrB,IAAI6tB,EAAY,IAAPhB,GAAY,EAAI,EAM9C,EA2BAP,GAAEnB,OAASmB,GAAE8G,IAAM,SAAUpzB,GAC3B,IAAIqzB,EACFtzB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAKX,OAHA5E,EAAI,IAAI6tB,EAAK7tB,IAGRD,EAAEK,IAAMJ,EAAEwJ,GAAKxJ,EAAEI,IAAMJ,EAAEI,EAAE,GAAW,IAAIytB,EAAKC,MAG/C9tB,EAAEI,GAAKL,EAAEK,IAAML,EAAEK,EAAE,GACfstB,GAAS,IAAIG,EAAK9tB,GAAI8tB,EAAKtH,UAAWsH,EAAK3C,WAIpDM,IAAW,EAEQ,GAAfqC,EAAK1C,QAIPkI,EAAI3D,GAAO3vB,EAAGC,EAAEmnB,MAAO,EAAG,EAAG,IAC3B3d,GAAKxJ,EAAEwJ,EAET6pB,EAAI3D,GAAO3vB,EAAGC,EAAG,EAAG6tB,EAAK1C,OAAQ,GAGnCkI,EAAIA,EAAEtE,MAAM/uB,GAEZwrB,IAAW,EAEJzrB,EAAEkvB,MAAMoE,GACjB,EASA/G,GAAEgH,mBAAqBhH,GAAEvG,IAAM,WAC7B,OAAOuN,GAAmB/zB,KAC5B,EAQA+sB,GAAEwG,iBAAmBxG,GAAEiF,GAAK,WAC1B,OAAOuB,GAAiBvzB,KAC1B,EAQA+sB,GAAEiH,QAAUjH,GAAE8C,IAAM,WAClB,IAAIrvB,EAAI,IAAIR,KAAKqF,YAAYrF,MAE7B,OADAQ,EAAEyJ,GAAKzJ,EAAEyJ,EACFkkB,GAAS3tB,EAClB,EAwBAusB,GAAE4C,KAAO5C,GAAE7hB,IAAM,SAAUzK,GACzB,IAAIwzB,EAAOpzB,EAAGmY,EAAGlX,EAAGhB,EAAGwY,EAAK6V,EAAI7B,EAAIuB,EAAIC,EACtCtuB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAKX,GAHA5E,EAAI,IAAI6tB,EAAK7tB,IAGRD,EAAEK,IAAMJ,EAAEI,EAWb,OARKL,EAAEyJ,GAAMxJ,EAAEwJ,EAMLzJ,EAAEK,IAAGJ,EAAI,IAAI6tB,EAAK7tB,EAAEI,GAAKL,EAAEyJ,IAAMxJ,EAAEwJ,EAAIzJ,EAAI+tB,MANnC9tB,EAAI,IAAI6tB,EAAKC,KAQxB9tB,EAIT,GAAID,EAAEyJ,GAAKxJ,EAAEwJ,EAEX,OADAxJ,EAAEwJ,GAAKxJ,EAAEwJ,EACFzJ,EAAEkvB,MAAMjvB,GASjB,GANAouB,EAAKruB,EAAEK,EACPiuB,EAAKruB,EAAEI,EACPsuB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,UAGLkD,EAAG,KAAOC,EAAG,GAMhB,OAFKA,EAAG,KAAIruB,EAAI,IAAI6tB,EAAK9tB,IAElByrB,GAAWkC,GAAS1tB,EAAG0uB,EAAI7B,GAAM7sB,EAa1C,GAPAK,EAAIyrB,GAAU/rB,EAAEwY,EA96CL,GA+6CXA,EAAIuT,GAAU9rB,EAAEuY,EA/6CL,GAi7CX6V,EAAKA,EAAG3sB,QACRJ,EAAIhB,EAAIkY,EAGD,CAuBL,IArBIlX,EAAI,GACNjB,EAAIguB,EACJ/sB,GAAKA,EACLwX,EAAMwV,EAAG/tB,SAETF,EAAIiuB,EACJ9V,EAAIlY,EACJwY,EAAMuV,EAAG9tB,QAOPe,GAFJwX,GADAxY,EAAIwM,KAAKogB,KAAKyB,EAl8CL,IAm8CC7V,EAAMxY,EAAI,EAAIwY,EAAM,KAG5BxX,EAAIwX,EACJzY,EAAEE,OAAS,GAIbF,EAAEotB,UACKnsB,KAAMjB,EAAEmB,KAAK,GACpBnB,EAAEotB,SACJ,CAcA,KAZA3U,EAAMuV,EAAG9tB,SACTe,EAAIgtB,EAAG/tB,QAGO,IACZe,EAAIwX,EACJzY,EAAIiuB,EACJA,EAAKD,EACLA,EAAKhuB,GAIFozB,EAAQ,EAAGnyB,GACdmyB,GAASpF,IAAK/sB,GAAK+sB,EAAG/sB,GAAKgtB,EAAGhtB,GAAKmyB,GAASrH,GAAO,EACnDiC,EAAG/sB,IAAM8qB,GAUX,IAPIqH,IACFpF,EAAG/F,QAAQmL,KACTjb,GAKCM,EAAMuV,EAAG9tB,OAAqB,GAAb8tB,IAAKvV,IAAYuV,EAAG9F,MAK1C,OAHAtoB,EAAEI,EAAIguB,EACNpuB,EAAEuY,EAAI4a,GAAkB/E,EAAI7V,GAErBiT,GAAWkC,GAAS1tB,EAAG0uB,EAAI7B,GAAM7sB,CAC1C,EASAssB,GAAE/F,UAAY+F,GAAEqC,GAAK,SAAU1uB,GAC7B,IAAII,EACFN,EAAIR,KAEN,QAAU,IAANU,GAAgBA,MAAQA,GAAW,IAANA,GAAiB,IAANA,EAAS,MAAM2V,MAAM8V,GAAkBzrB,GASnF,OAPIF,EAAEK,GACJC,EAAIozB,GAAa1zB,EAAEK,GACfH,GAAKF,EAAEwY,EAAI,EAAIlY,IAAGA,EAAIN,EAAEwY,EAAI,IAEhClY,EAAIytB,IAGCztB,CACT,EAQAisB,GAAExH,MAAQ,WACR,IAAI/kB,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YAEX,OAAO8oB,GAAS,IAAIG,EAAK9tB,GAAIA,EAAEwY,EAAI,EAAGsV,EAAK3C,SAC7C,EAkBAoB,GAAEoH,KAAOpH,GAAEqH,IAAM,WACf,IAAIjF,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAE8kB,WACH9kB,EAAE6uB,SAAiB,IAAIf,EAAK9tB,IAEhC2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK7hB,KAAKI,IAAIlN,EAAEwY,EAAGxY,EAAE4uB,MA9iD3B,EA+iDXd,EAAK3C,SAAW,EAEhBnrB,EA67DF,SAAc8tB,EAAM9tB,GAClB,IAAIM,EACFwY,EAAM9Y,EAAEK,EAAEE,OAEZ,GAAIuY,EAAM,EACR,OAAO9Y,EAAE6uB,SAAW7uB,EAAI+uB,GAAajB,EAAM,EAAG9tB,EAAGA,GASnDM,GADAA,EAAI,IAAMwM,KAAK8b,KAAK9P,IACZ,GAAK,GAAS,EAAJxY,EAGlBN,EAAI+uB,GAAajB,EAAM,EADvB9tB,EAAIA,EAAEgvB,MAAM,EAAIF,GAAQ,EAAGxuB,IACEN,GAO7B,IAJA,IAAI6zB,EACFhD,EAAK,IAAI/C,EAAK,GACdgD,EAAM,IAAIhD,EAAK,IACfiD,EAAM,IAAIjD,EAAK,IACVxtB,KACLuzB,EAAS7zB,EAAEgvB,MAAMhvB,GACjBA,EAAIA,EAAEgvB,MAAM6B,EAAG1B,KAAK0E,EAAO7E,MAAM8B,EAAI9B,MAAM6E,GAAQ3E,MAAM6B,MAG3D,OAAO/wB,CACT,CA39DM2zB,CAAK7F,EAAMsB,GAAiBtB,EAAM9tB,IAEtC8tB,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAETa,GAAS9C,GAAW,EAAI7qB,EAAEqvB,MAAQrvB,EAAG2uB,EAAI7B,GAAI,IAb1B,IAAIgB,EAAKC,IAcrC,EAeAxB,GAAEuH,WAAavH,GAAE3D,KAAO,WACtB,IAAI2G,EAAG1rB,EAAG+qB,EAAIrT,EAAGiU,EAAKzvB,EACpBC,EAAIR,KACJa,EAAIL,EAAEK,EACNmY,EAAIxY,EAAEwY,EACN/O,EAAIzJ,EAAEyJ,EACNqkB,EAAO9tB,EAAE6E,YAGX,GAAU,IAAN4E,IAAYpJ,IAAMA,EAAE,GACtB,OAAO,IAAIytB,GAAMrkB,GAAKA,EAAI,KAAOpJ,GAAKA,EAAE,IAAM0tB,IAAM1tB,EAAIL,EAAI,KAgC9D,IA7BAyrB,IAAW,EAOF,IAJThiB,EAAIqD,KAAK8b,MAAM5oB,KAIDyJ,GAAK,OACjB5F,EAAI2oB,GAAensB,IAEZE,OAASiY,GAAK,GAAK,IAAG3U,GAAK,KAClC4F,EAAIqD,KAAK8b,KAAK/kB,GACd2U,EAAIuT,IAAWvT,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS3C+C,EAAI,IAAIuS,EANNjqB,EADE4F,GAAK,IACH,KAAO+O,GAEX3U,EAAI4F,EAAEmd,iBACAllB,MAAM,EAAGmC,EAAEyF,QAAQ,KAAO,GAAKkP,IAKvC+C,EAAI,IAAIuS,EAAKrkB,EAAE2I,YAGjBwc,GAAMpW,EAAIsV,EAAKtH,WAAa,IAQ1B,GAHAjL,GADAxb,EAAIwb,GACE4T,KAAKQ,GAAO3vB,EAAGD,EAAG6uB,EAAK,EAAG,IAAII,MAAM,IAGtCxC,GAAezsB,EAAEM,GAAGqB,MAAM,EAAGktB,MAAS/qB,EAAI2oB,GAAejR,EAAElb,IAAIqB,MAAM,EAAGktB,GAAK,CAK/E,GAAS,SAJT/qB,EAAIA,EAAEnC,MAAMktB,EAAK,EAAGA,EAAK,MAILY,GAAY,QAAL3rB,GAepB,EAICA,KAAOA,EAAEnC,MAAM,IAAqB,KAAfmC,EAAE2pB,OAAO,MAGlCG,GAASpS,EAAG/C,EAAI,EAAG,GACnB+W,GAAKhU,EAAEyT,MAAMzT,GAAGqU,GAAG5vB,IAGrB,KACF,CAvBE,IAAKwvB,IACH7B,GAAS5tB,EAAGyY,EAAI,EAAG,GAEfzY,EAAEivB,MAAMjvB,GAAG6vB,GAAG5vB,IAAI,CACpBub,EAAIxb,EACJ,KACF,CAGF6uB,GAAM,EACNY,EAAM,CAcV,CAKF,OAFA/D,IAAW,EAEJkC,GAASpS,EAAG/C,EAAGsV,EAAK3C,SAAUoE,EACvC,EAgBAhD,GAAEwH,QAAUxH,GAAEyH,IAAM,WAClB,IAAIrF,EAAI7B,EACN9sB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAEX,OAAK7E,EAAE8kB,WACH9kB,EAAE6uB,SAAiB,IAAIf,EAAK9tB,IAEhC2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SACV2C,EAAKtH,UAAYmI,EAAK,GACtBb,EAAK3C,SAAW,GAEhBnrB,EAAIA,EAAE4zB,OACJnqB,EAAI,EACNzJ,EAAI2vB,GAAO3vB,EAAG,IAAI8tB,EAAK,GAAGoB,MAAMlvB,EAAEgvB,MAAMhvB,IAAI4oB,OAAQ+F,EAAK,GAAI,GAE7Db,EAAKtH,UAAYmI,EACjBb,EAAK3C,SAAW2B,EAETa,GAAqB,GAAZ9C,IAA6B,GAAZA,GAAgB7qB,EAAEqvB,MAAQrvB,EAAG2uB,EAAI7B,GAAI,IAf5C,IAAIgB,EAAKC,IAgBrC,EAwBAxB,GAAEyC,MAAQzC,GAAE0H,IAAM,SAAUh0B,GAC1B,IAAIwzB,EAAOjb,EAAGlX,EAAGhB,EAAGib,EAAG2Y,EAAIn0B,EAAGouB,EAAKC,EACjCpuB,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YACTwpB,EAAKruB,EAAEK,EACPiuB,GAAMruB,EAAI,IAAI6tB,EAAK7tB,IAAII,EAKzB,GAHAJ,EAAEwJ,GAAKzJ,EAAEyJ,IAGJ4kB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAIR,GAAM7tB,EAAEwJ,GAAK4kB,IAAOA,EAAG,KAAOC,GAAMA,IAAOA,EAAG,KAAOD,EAI5DN,IAICM,GAAOC,EAAqB,EAANruB,EAAEwJ,EAAZxJ,EAAEwJ,EAAI,GAoBzB,IAjBA+O,EAAIuT,GAAU/rB,EAAEwY,EAhvDL,GAgvDqBuT,GAAU9rB,EAAEuY,EAhvDjC,IAivDX2V,EAAME,EAAG9tB,SACT6tB,EAAME,EAAG/tB,UAIPgb,EAAI8S,EACJA,EAAKC,EACLA,EAAK/S,EACL2Y,EAAK/F,EACLA,EAAMC,EACNA,EAAM8F,GAIR3Y,EAAI,GAECja,EADL4yB,EAAK/F,EAAMC,EACE9sB,KAAMia,EAAE/Z,KAAK,GAG1B,IAAKF,EAAI8sB,IAAO9sB,GAAK,GAAI,CAEvB,IADAmyB,EAAQ,EACHnzB,EAAI6tB,EAAM7sB,EAAGhB,EAAIgB,GACpBvB,EAAIwb,EAAEjb,GAAKguB,EAAGhtB,GAAK+sB,EAAG/tB,EAAIgB,EAAI,GAAKmyB,EACnClY,EAAEjb,KAAOP,EAAIqsB,GAAO,EACpBqH,EAAQ1zB,EAAIqsB,GAAO,EAGrB7Q,EAAEjb,IAAMib,EAAEjb,GAAKmzB,GAASrH,GAAO,CACjC,CAGA,MAAQ7Q,IAAI2Y,IAAM3Y,EAAEgN,MAQpB,OANIkL,IAASjb,EACR+C,EAAE8M,QAEPpoB,EAAEI,EAAIkb,EACNtb,EAAEuY,EAAI4a,GAAkB7X,EAAG/C,GAEpBiT,GAAWkC,GAAS1tB,EAAG6tB,EAAKtH,UAAWsH,EAAK3C,UAAYlrB,CACjE,EAaAssB,GAAE4H,SAAW,SAAUvF,EAAI9B,GACzB,OAAOsH,GAAe50B,KAAM,EAAGovB,EAAI9B,EACrC,EAaAP,GAAE8H,gBAAkB9H,GAAE+H,KAAO,SAAUxE,EAAIhD,GACzC,IAAI9sB,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YAGX,OADA7E,EAAI,IAAI8tB,EAAK9tB,QACF,IAAP8vB,EAAsB9vB,GAE1B4sB,GAAWkD,EAAI,EAAG/E,SAEP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,GAEhBa,GAAS3tB,EAAG8vB,EAAK9vB,EAAEwY,EAAI,EAAGsU,GACnC,EAWAP,GAAE3F,cAAgB,SAAUkJ,EAAIhD,GAC9B,IAAIlqB,EACF5C,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAcX,YAZW,IAAPirB,EACFltB,EAAM2xB,GAAev0B,GAAG,IAExB4sB,GAAWkD,EAAI,EAAG/E,SAEP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,GAGvBlqB,EAAM2xB,GADNv0B,EAAI2tB,GAAS,IAAIG,EAAK9tB,GAAI8vB,EAAK,EAAGhD,IACV,EAAMgD,EAAK,IAG9B9vB,EAAEmxB,UAAYnxB,EAAE6uB,SAAW,IAAMjsB,EAAMA,CAChD,EAmBA2pB,GAAE5F,QAAU,SAAUmJ,EAAIhD,GACxB,IAAIlqB,EAAK3C,EACPD,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAgBX,YAdW,IAAPirB,EACFltB,EAAM2xB,GAAev0B,IAErB4sB,GAAWkD,EAAI,EAAG/E,SAEP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,GAGvBlqB,EAAM2xB,GADNt0B,EAAI0tB,GAAS,IAAIG,EAAK9tB,GAAI8vB,EAAK9vB,EAAEwY,EAAI,EAAGsU,IAChB,EAAOgD,EAAK7vB,EAAEuY,EAAI,IAKrCxY,EAAEmxB,UAAYnxB,EAAE6uB,SAAW,IAAMjsB,EAAMA,CAChD,EAcA2pB,GAAEiI,WAAa,SAAUC,GACvB,IAAIp0B,EAAGq0B,EAAIC,EAAIC,EAAIpc,EAAGlY,EAAGuD,EAAGgxB,EAAIC,EAAInG,EAAI2E,EAAG/X,EACzCvb,EAAIR,KACJ6uB,EAAKruB,EAAEK,EACPytB,EAAO9tB,EAAE6E,YAEX,IAAKwpB,EAAI,OAAO,IAAIP,EAAK9tB,GAUzB,GARA80B,EAAKJ,EAAK,IAAI5G,EAAK,GACnB6G,EAAKE,EAAK,IAAI/G,EAAK,GAInBxtB,GADAkY,GADAnY,EAAI,IAAIytB,EAAK6G,IACPnc,EAAIkb,GAAarF,GAAMruB,EAAEwY,EAAI,GAh6DxB,EAk6DXnY,EAAEA,EAAE,GAAK2rB,GAAQ,GAAI1rB,EAAI,EAl6Dd,EAk6D6BA,EAAIA,GAEhC,MAARm0B,EAGFA,EAAOjc,EAAI,EAAInY,EAAIy0B,MACd,CAEL,KADAjxB,EAAI,IAAIiqB,EAAK2G,IACNtC,SAAWtuB,EAAE2uB,GAAGsC,GAAK,MAAMjf,MAAM8V,GAAkB9nB,GAC1D4wB,EAAO5wB,EAAEmqB,GAAG3tB,GAAMmY,EAAI,EAAInY,EAAIy0B,EAAMjxB,CACtC,CAOA,IALA4nB,IAAW,EACX5nB,EAAI,IAAIiqB,EAAKtB,GAAe6B,IAC5BM,EAAKb,EAAKtH,UACVsH,EAAKtH,UAAYhO,EAj7DN,EAi7DU6V,EAAG9tB,OAAoB,EAG1C+yB,EAAI3D,GAAO9rB,EAAGxD,EAAG,EAAG,EAAG,GAEH,IADpBu0B,EAAKF,EAAGvF,KAAKmE,EAAEtE,MAAM2F,KACd1G,IAAIwG,IACXC,EAAKC,EACLA,EAAKC,EACLA,EAAKE,EACLA,EAAKD,EAAG1F,KAAKmE,EAAEtE,MAAM4F,IACrBC,EAAKD,EACLA,EAAKv0B,EACLA,EAAIwD,EAAEqrB,MAAMoE,EAAEtE,MAAM4F,IACpB/wB,EAAI+wB,EAeN,OAZAA,EAAKjF,GAAO8E,EAAKvF,MAAMwF,GAAKC,EAAI,EAAG,EAAG,GACtCE,EAAKA,EAAG1F,KAAKyF,EAAG5F,MAAM8F,IACtBJ,EAAKA,EAAGvF,KAAKyF,EAAG5F,MAAM2F,IACtBE,EAAGprB,EAAIqrB,EAAGrrB,EAAIzJ,EAAEyJ,EAGhB8R,EAAIoU,GAAOmF,EAAIH,EAAInc,EAAG,GAAG0W,MAAMlvB,GAAGonB,MAAM6G,IAAI0B,GAAOkF,EAAIH,EAAIlc,EAAG,GAAG0W,MAAMlvB,GAAGonB,OAAS,EAC7E,CAAC0N,EAAIH,GAAM,CAACE,EAAIH,GAEtB5G,EAAKtH,UAAYmI,EACjBlD,IAAW,EAEJlQ,CACT,EAaAgR,GAAEwI,cAAgBxI,GAAEyI,MAAQ,SAAUpG,EAAI9B,GACxC,OAAOsH,GAAe50B,KAAM,GAAIovB,EAAI9B,EACtC,EAmBAP,GAAE0I,UAAY,SAAUh1B,EAAG6sB,GACzB,IAAI9sB,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YAIX,GAFA7E,EAAI,IAAI8tB,EAAK9tB,GAEJ,MAALC,EAAW,CAGb,IAAKD,EAAEK,EAAG,OAAOL,EAEjBC,EAAI,IAAI6tB,EAAK,GACbhB,EAAKgB,EAAK3C,QACZ,KAAO,CASL,GARAlrB,EAAI,IAAI6tB,EAAK7tB,QACF,IAAP6sB,EACFA,EAAKgB,EAAK3C,SAEVyB,GAAWE,EAAI,EAAG,IAIf9sB,EAAEK,EAAG,OAAOJ,EAAEwJ,EAAIzJ,EAAIC,EAG3B,IAAKA,EAAEI,EAEL,OADIJ,EAAEwJ,IAAGxJ,EAAEwJ,EAAIzJ,EAAEyJ,GACVxJ,CAEX,CAeA,OAZIA,EAAEI,EAAE,IACNorB,IAAW,EACXzrB,EAAI2vB,GAAO3vB,EAAGC,EAAG,EAAG6sB,EAAI,GAAGkC,MAAM/uB,GACjCwrB,IAAW,EACXkC,GAAS3tB,KAITC,EAAEwJ,EAAIzJ,EAAEyJ,EACRzJ,EAAIC,GAGCD,CACT,EAQAusB,GAAEtE,SAAW,WACX,OAAQzoB,IACV,EAaA+sB,GAAE2I,QAAU,SAAUtG,EAAI9B,GACxB,OAAOsH,GAAe50B,KAAM,EAAGovB,EAAI9B,EACrC,EA8CAP,GAAE4I,QAAU5I,GAAE7S,IAAM,SAAUzZ,GAC5B,IAAIuY,EAAGlY,EAAGquB,EAAIpT,EAAGuR,EAAIrjB,EACnBzJ,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YACTuwB,IAAOn1B,EAAI,IAAI6tB,EAAK7tB,IAGtB,KAAKD,EAAEK,GAAMJ,EAAEI,GAAML,EAAEK,EAAE,IAAOJ,EAAEI,EAAE,IAAI,OAAO,IAAIytB,EAAK9B,IAAShsB,EAAGo1B,IAIpE,IAFAp1B,EAAI,IAAI8tB,EAAK9tB,IAEP4vB,GAAG,GAAI,OAAO5vB,EAKpB,GAHA2uB,EAAKb,EAAKtH,UACVsG,EAAKgB,EAAK3C,SAENlrB,EAAE2vB,GAAG,GAAI,OAAOjC,GAAS3tB,EAAG2uB,EAAI7B,GAMpC,IAHAtU,EAAIuT,GAAU9rB,EAAEuY,EAvnEL,KA0nEFvY,EAAEI,EAAEE,OAAS,IAAMD,EAAI80B,EAAK,GAAKA,EAAKA,IAznE5B,iBA2nEjB,OADA7Z,EAAI8Z,GAAOvH,EAAM9tB,EAAGM,EAAGquB,GAChB1uB,EAAEwJ,EAAI,EAAI,IAAIqkB,EAAK,GAAGkC,IAAIzU,GAAKoS,GAASpS,EAAGoT,EAAI7B,GAMxD,IAHArjB,EAAIzJ,EAAEyJ,GAGE,EAAG,CAGT,GAAI+O,EAAIvY,EAAEI,EAAEE,OAAS,EAAG,OAAO,IAAIutB,EAAKC,KAMxC,GAHc,EAAT9tB,EAAEI,EAAEmY,KAAc/O,EAAI,GAGhB,GAAPzJ,EAAEwY,GAAoB,GAAVxY,EAAEK,EAAE,IAAyB,GAAdL,EAAEK,EAAEE,OAEjC,OADAP,EAAEyJ,EAAIA,EACCzJ,CAEX,CAcA,OAPAwY,EAAS,IADTlY,EAAI0rB,IAAShsB,EAAGo1B,KACDtQ,SAASxkB,GAEpB,IAAIwtB,EAAKxtB,EAAI,IAAIkY,EADjBuT,GAAUqJ,GAAMtoB,KAAK2Y,IAAI,KAAO+G,GAAexsB,EAAEK,IAAMyM,KAAK8Y,KAAO5lB,EAAEwY,EAAI,KAMrEsV,EAAKtC,KAAO,GAAKhT,EAAIsV,EAAKvC,KAAO,EAAU,IAAIuC,EAAKtV,EAAI,EAAI/O,EAAI,EAAI,IAE5EgiB,IAAW,EACXqC,EAAK3C,SAAWnrB,EAAEyJ,EAAI,EAMtBnJ,EAAIwM,KAAKC,IAAI,IAAKyL,EAAI,IAAIjY,SAG1Bgb,EAAIgY,GAAmBtzB,EAAE+uB,MAAM+D,GAAiB/yB,EAAG2uB,EAAKruB,IAAKquB,IAGvDtuB,GAOAwsB,IAJJtR,EAAIoS,GAASpS,EAAGoT,EAAK,EAAG,IAIEtuB,EAAGsuB,EAAI7B,KAC/BtU,EAAImW,EAAK,IAMJnC,IAHLjR,EAAIoS,GAAS4F,GAAmBtzB,EAAE+uB,MAAM+D,GAAiB/yB,EAAGwY,EAAIlY,IAAKkY,GAAIA,EAAI,EAAG,IAG1DnY,GAAGqB,MAAMitB,EAAK,EAAGA,EAAK,IAAM,GAAK,OACrDpT,EAAIoS,GAASpS,EAAGoT,EAAK,EAAG,KAK9BpT,EAAE9R,EAAIA,EACNgiB,IAAW,EACXqC,EAAK3C,SAAW2B,EAETa,GAASpS,EAAGoT,EAAI7B,GACzB,EAcAP,GAAExE,YAAc,SAAU6G,EAAI9B,GAC5B,IAAIlqB,EACF5C,EAAIR,KACJsuB,EAAO9tB,EAAE6E,YAcX,YAZW,IAAP+pB,EACFhsB,EAAM2xB,GAAev0B,EAAGA,EAAEwY,GAAKsV,EAAKzC,UAAYrrB,EAAEwY,GAAKsV,EAAKxC,WAE5DsB,GAAWgC,EAAI,EAAG7D,SAEP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,GAGvBlqB,EAAM2xB,GADNv0B,EAAI2tB,GAAS,IAAIG,EAAK9tB,GAAI4uB,EAAI9B,GACN8B,GAAM5uB,EAAEwY,GAAKxY,EAAEwY,GAAKsV,EAAKzC,SAAUuD,IAGtD5uB,EAAEmxB,UAAYnxB,EAAE6uB,SAAW,IAAMjsB,EAAMA,CAChD,EAiBA2pB,GAAE+I,oBAAsB/I,GAAEgJ,KAAO,SAAU3G,EAAI9B,GAC7C,IACEgB,EADMtuB,KACGqF,YAYX,YAVW,IAAP+pB,GACFA,EAAKd,EAAKtH,UACVsG,EAAKgB,EAAK3C,WAEVyB,GAAWgC,EAAI,EAAG7D,SAEP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,IAGlBa,GAAS,IAAIG,EAbZtuB,MAaqBovB,EAAI9B,EACnC,EAUAP,GAAEna,SAAW,WACX,IAAIpS,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YACTjC,EAAM2xB,GAAev0B,EAAGA,EAAEwY,GAAKsV,EAAKzC,UAAYrrB,EAAEwY,GAAKsV,EAAKxC,UAE9D,OAAOtrB,EAAEmxB,UAAYnxB,EAAE6uB,SAAW,IAAMjsB,EAAMA,CAChD,EAOA2pB,GAAEiJ,UAAYjJ,GAAEkJ,MAAQ,WACtB,OAAO9H,GAAS,IAAInuB,KAAKqF,YAAYrF,MAAOA,KAAKgZ,EAAI,EAAG,EAC1D,EAQA+T,GAAEvN,QAAUuN,GAAEhC,OAAS,WACrB,IAAIvqB,EAAIR,KACNsuB,EAAO9tB,EAAE6E,YACTjC,EAAM2xB,GAAev0B,EAAGA,EAAEwY,GAAKsV,EAAKzC,UAAYrrB,EAAEwY,GAAKsV,EAAKxC,UAE9D,OAAOtrB,EAAEmxB,QAAU,IAAMvuB,EAAMA,CACjC,EAkNA,IAAI+sB,GAAS,WAGX,SAAS+F,EAAgB11B,EAAGM,EAAG6lB,GAC7B,IAAIwP,EACFlC,EAAQ,EACRnyB,EAAItB,EAAEO,OAER,IAAKP,EAAIA,EAAE0B,QAASJ,KAClBq0B,EAAO31B,EAAEsB,GAAKhB,EAAImzB,EAClBzzB,EAAEsB,GAAKq0B,EAAOxP,EAAO,EACrBsN,EAAQkC,EAAOxP,EAAO,EAKxB,OAFIsN,GAAOzzB,EAAEsoB,QAAQmL,GAEdzzB,CACT,CAEA,SAAS41B,EAAQzc,EAAGD,EAAG2c,EAAIC,GACzB,IAAIx0B,EAAGia,EAEP,GAAIsa,GAAMC,EACRva,EAAIsa,EAAKC,EAAK,GAAK,OAEnB,IAAKx0B,EAAIia,EAAI,EAAGja,EAAIu0B,EAAIv0B,IACtB,GAAI6X,EAAE7X,IAAM4X,EAAE5X,GAAI,CAChBia,EAAIpC,EAAE7X,GAAK4X,EAAE5X,GAAK,GAAK,EACvB,KACF,CAIJ,OAAOia,CACT,CAEA,SAASwa,EAAS5c,EAAGD,EAAG2c,EAAI1P,GAI1B,IAHA,IAAI7kB,EAAI,EAGDu0B,KACL1c,EAAE0c,IAAOv0B,EACTA,EAAI6X,EAAE0c,GAAM3c,EAAE2c,GAAM,EAAI,EACxB1c,EAAE0c,GAAMv0B,EAAI6kB,EAAOhN,EAAE0c,GAAM3c,EAAE2c,GAI/B,MAAQ1c,EAAE,IAAMA,EAAE5Y,OAAS,GAAI4Y,EAAEkP,OACnC,CAEA,OAAO,SAAUroB,EAAGC,EAAG0uB,EAAI7B,EAAIgD,EAAI3J,GACjC,IAAI8H,EAAKzV,EAAGlX,EAAGhB,EAAG01B,EAASC,EAAMC,EAAMC,EAAO7C,EAAG8C,EAAIC,EAAKC,EAAMC,EAAM3H,EAAI7uB,EAAGy2B,EAAIC,EAAIC,EACnFC,EAAIC,EACJ9I,EAAO9tB,EAAE6E,YACT0gB,EAAOvlB,EAAEyJ,GAAKxJ,EAAEwJ,EAAI,GAAK,EACzB4kB,EAAKruB,EAAEK,EACPiuB,EAAKruB,EAAEI,EAGT,KAAKguB,GAAOA,EAAG,IAAOC,GAAOA,EAAG,IAE9B,OAAO,IAAIR,EACR9tB,EAAEyJ,GAAMxJ,EAAEwJ,IAAM4kB,GAAKC,GAAMD,EAAG,IAAMC,EAAG,GAAMA,GAG9CD,GAAe,GAATA,EAAG,KAAYC,EAAY,EAAP/I,EAAWA,EAAO,EAHQwI,KAsBxD,IAhBI5H,GACF6P,EAAU,EACVxd,EAAIxY,EAAEwY,EAAIvY,EAAEuY,IAEZ2N,EAAOiG,GACP4J,EAvkFO,EAwkFPxd,EAAIuT,GAAU/rB,EAAEwY,EAAIwd,GAAWjK,GAAU9rB,EAAEuY,EAAIwd,IAGjDW,EAAKrI,EAAG/tB,OACRk2B,EAAKpI,EAAG9tB,OAER61B,GADA9C,EAAI,IAAIxF,EAAKvI,IACNllB,EAAI,GAINiB,EAAI,EAAGgtB,EAAGhtB,KAAO+sB,EAAG/sB,IAAM,GAAIA,KAanC,GAXIgtB,EAAGhtB,IAAM+sB,EAAG/sB,IAAM,IAAIkX,IAEhB,MAANmW,GACFC,EAAKD,EAAKb,EAAKtH,UACfsG,EAAKgB,EAAK3C,UAEVyD,EADSkB,EACJnB,GAAM3uB,EAAEwY,EAAIvY,EAAEuY,GAAK,EAEnBmW,EAGHC,EAAK,EACPwH,EAAG50B,KAAK,GACRy0B,GAAO,MACF,CAOL,GAJArH,EAAKA,EAAKoH,EAAU,EAAI,EACxB10B,EAAI,EAGM,GAANq1B,EAAS,CAMX,IALAr2B,EAAI,EACJguB,EAAKA,EAAG,GACRM,KAGQttB,EAAIm1B,GAAMn2B,IAAMsuB,IAAMttB,IAC5BvB,EAAIO,EAAI6lB,GAAQkI,EAAG/sB,IAAM,GACzB80B,EAAG90B,GAAKvB,EAAIuuB,EAAK,EACjBhuB,EAAIP,EAAIuuB,EAAK,EAGf2H,EAAO31B,GAAKgB,EAAIm1B,CAGlB,KAAO,CAiBL,KAdAn2B,EAAI6lB,GAAQmI,EAAG,GAAK,GAAK,GAEjB,IACNA,EAAKoH,EAAgBpH,EAAIhuB,EAAG6lB,GAC5BkI,EAAKqH,EAAgBrH,EAAI/tB,EAAG6lB,GAC5BwQ,EAAKrI,EAAG/tB,OACRk2B,EAAKpI,EAAG9tB,QAGVi2B,EAAKG,EAELL,GADAD,EAAMhI,EAAG3sB,MAAM,EAAGi1B,IACPp2B,OAGJ+1B,EAAOK,GAAKN,EAAIC,KAAU,GAEjCM,EAAKtI,EAAG5sB,SACL4mB,QAAQ,GACXoO,EAAMpI,EAAG,GAELA,EAAG,IAAMnI,EAAO,KAAKuQ,EAEzB,GACEp2B,EAAI,GAGJ2tB,EAAM2H,EAAQtH,EAAI+H,EAAKM,EAAIL,IAGjB,GAGRC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOpQ,GAAQkQ,EAAI,IAAM,KAGhD/1B,EAAIi2B,EAAOG,EAAM,GAUT,GACFp2B,GAAK6lB,IAAM7lB,EAAI6lB,EAAO,GAWf,IAHX8H,EAAM2H,EALNM,EAAOR,EAAgBpH,EAAIhuB,EAAG6lB,GAKVkQ,EAJpBF,EAAQD,EAAK31B,OACb+1B,EAAOD,EAAI91B,WAOTD,IAGAy1B,EAASG,EAAMS,EAAKR,EAAQS,EAAKtI,EAAI6H,EAAOhQ,MAOrC,GAAL7lB,IAAQ2tB,EAAM3tB,EAAI,GACtB41B,EAAO5H,EAAG5sB,UAGZy0B,EAAQD,EAAK31B,QACD+1B,GAAMJ,EAAK5N,QAAQ,GAG/ByN,EAASM,EAAKH,EAAMI,EAAMnQ,IAGd,GAAR8H,IAIFA,EAAM2H,EAAQtH,EAAI+H,EAAKM,EAHvBL,EAAOD,EAAI91B,SAMD,IACRD,IAGAy1B,EAASM,EAAKM,EAAKL,EAAOM,EAAKtI,EAAIgI,EAAMnQ,IAI7CmQ,EAAOD,EAAI91B,QACM,IAAR0tB,IACT3tB,IACA+1B,EAAM,CAAC,IAITD,EAAG90B,KAAOhB,EAGN2tB,GAAOoI,EAAI,GACbA,EAAIC,KAAUjI,EAAGmI,IAAO,GAExBH,EAAM,CAAChI,EAAGmI,IACVF,EAAO,UAGDE,IAAOC,QAAiB,IAAXJ,EAAI,KAAkBzH,KAE7CqH,OAAkB,IAAXI,EAAI,EACb,CAGKD,EAAG,IAAIA,EAAG/N,OACjB,CAGA,GAAe,GAAX2N,EACF1C,EAAE9a,EAAIA,EACNoS,GAAUqL,MACL,CAGL,IAAK30B,EAAI,EAAGhB,EAAI81B,EAAG,GAAI91B,GAAK,GAAIA,GAAK,GAAIgB,IACzCgyB,EAAE9a,EAAIlX,EAAIkX,EAAIwd,EAAU,EAExBrI,GAAS2F,EAAGxD,EAAKnB,EAAK2E,EAAE9a,EAAI,EAAImW,EAAI7B,EAAImJ,EAC1C,CAEA,OAAO3C,CACT,CACD,CArQY,GA4QZ,SAAS3F,GAAS3tB,EAAG4uB,EAAI9B,EAAI+J,GAC5B,IAAI7O,EAAQ1mB,EAAGC,EAAGjB,EAAG2sB,EAAI6J,EAAS32B,EAAGkuB,EAAI0I,EACvCjJ,EAAO9tB,EAAE6E,YAGXuV,EAAK,GAAU,MAANwU,EAAY,CAInB,KAHAP,EAAKruB,EAAEK,GAGE,OAAOL,EAWhB,IAAKgoB,EAAS,EAAG1nB,EAAI+tB,EAAG,GAAI/tB,GAAK,GAAIA,GAAK,GAAI0nB,IAI9C,IAHA1mB,EAAIstB,EAAK5G,GAGD,EACN1mB,GAnyFO,EAoyFPC,EAAIqtB,EAIJ3B,GAHA9sB,EAAIkuB,EAAG0I,EAAM,IAGJ/K,GAAQ,GAAIhE,EAASzmB,EAAI,GAAK,GAAK,OAI5C,IAFAw1B,EAAMjqB,KAAKogB,MAAM5rB,EAAI,GA1yFd,MA2yFPhB,EAAI+tB,EAAG9tB,QACO,CACZ,IAAIs2B,EASF,MAAMzc,EANN,KAAO9Z,KAAOy2B,GAAM1I,EAAG7sB,KAAK,GAC5BrB,EAAI8sB,EAAK,EACTjF,EAAS,EAETzmB,GADAD,GAnzFG,KAozFgB,CAIvB,KAAO,CAIL,IAHAnB,EAAIG,EAAI+tB,EAAG0I,GAGN/O,EAAS,EAAG1nB,GAAK,GAAIA,GAAK,GAAI0nB,IAUnCiF,GAHA1rB,GAJAD,GA/zFK,KAm0Fc0mB,GAGV,EAAI,EAAI7nB,EAAI6rB,GAAQ,GAAIhE,EAASzmB,EAAI,GAAK,GAAK,CAC1D,CAmBF,GAfAs1B,EAAcA,GAAejI,EAAK,QAChB,IAAhBP,EAAG0I,EAAM,KAAkBx1B,EAAI,EAAIpB,EAAIA,EAAI6rB,GAAQ,GAAIhE,EAASzmB,EAAI,IAMtEu1B,EAAUhK,EAAK,GACVG,GAAM4J,KAAuB,GAAN/J,GAAWA,IAAO9sB,EAAEyJ,EAAI,EAAI,EAAI,IACxDwjB,EAAK,GAAW,GAANA,IAAkB,GAANH,GAAW+J,GAAqB,GAAN/J,IAG9CxrB,EAAI,EAAIC,EAAI,EAAIpB,EAAI6rB,GAAQ,GAAIhE,EAASzmB,GAAK,EAAI8sB,EAAG0I,EAAM,IAAM,GAAM,GACvEjK,IAAO9sB,EAAEyJ,EAAI,EAAI,EAAI,IAEvBmlB,EAAK,IAAMP,EAAG,GAgBhB,OAfAA,EAAG9tB,OAAS,EACRu2B,GAGFlI,GAAM5uB,EAAEwY,EAAI,EAGZ6V,EAAG,GAAKrC,GAAQ,IAl2FX,EAk2F2B4C,EAl2F3B,MAm2FL5uB,EAAEwY,GAAKoW,GAAM,GAIbP,EAAG,GAAKruB,EAAEwY,EAAI,EAGTxY,EAiBT,GAbS,GAALsB,GACF+sB,EAAG9tB,OAASw2B,EACZz2B,EAAI,EACJy2B,MAEA1I,EAAG9tB,OAASw2B,EAAM,EAClBz2B,EAAI0rB,GAAQ,GAp3FL,EAo3FoB1qB,GAI3B+sB,EAAG0I,GAAOx1B,EAAI,GAAKpB,EAAI6rB,GAAQ,GAAIhE,EAASzmB,GAAKyqB,GAAQ,GAAIzqB,GAAK,GAAKjB,EAAI,GAGzEw2B,EACF,OAAS,CAGP,GAAW,GAAPC,EAAU,CAGZ,IAAKz1B,EAAI,EAAGC,EAAI8sB,EAAG,GAAI9sB,GAAK,GAAIA,GAAK,GAAID,IAEzC,IADAC,EAAI8sB,EAAG,IAAM/tB,EACRA,EAAI,EAAGiB,GAAK,GAAIA,GAAK,GAAIjB,IAG1BgB,GAAKhB,IACPN,EAAEwY,IACE6V,EAAG,IAAMjC,KAAMiC,EAAG,GAAK,IAG7B,KACF,CAEE,GADAA,EAAG0I,IAAQz2B,EACP+tB,EAAG0I,IAAQ3K,GAAM,MACrBiC,EAAG0I,KAAS,EACZz2B,EAAI,CAER,CAIF,IAAKgB,EAAI+sB,EAAG9tB,OAAoB,IAAZ8tB,IAAK/sB,IAAW+sB,EAAG9F,KACzC,CAqBA,OAnBIkD,KAGEzrB,EAAEwY,EAAIsV,EAAKtC,MAGbxrB,EAAEK,EAAI,KACNL,EAAEwY,EAAIuV,KAGG/tB,EAAEwY,EAAIsV,EAAKvC,OAGpBvrB,EAAEwY,EAAI,EACNxY,EAAEK,EAAI,CAAC,KAKJL,CACT,CAGA,SAASu0B,GAAev0B,EAAGg3B,EAAOpI,GAChC,IAAK5uB,EAAE8kB,WAAY,OAAOmS,GAAkBj3B,GAC5C,IAAIM,EACFkY,EAAIxY,EAAEwY,EACN5V,EAAM4pB,GAAexsB,EAAEK,GACvByY,EAAMlW,EAAIrC,OAwBZ,OAtBIy2B,GACEpI,IAAOtuB,EAAIsuB,EAAK9V,GAAO,EACzBlW,EAAMA,EAAI4qB,OAAO,GAAK,IAAM5qB,EAAIlB,MAAM,GAAKirB,GAAcrsB,GAChDwY,EAAM,IACflW,EAAMA,EAAI4qB,OAAO,GAAK,IAAM5qB,EAAIlB,MAAM,IAGxCkB,EAAMA,GAAO5C,EAAEwY,EAAI,EAAI,IAAM,MAAQxY,EAAEwY,GAC9BA,EAAI,GACb5V,EAAM,KAAO+pB,IAAenU,EAAI,GAAK5V,EACjCgsB,IAAOtuB,EAAIsuB,EAAK9V,GAAO,IAAGlW,GAAO+pB,GAAcrsB,KAC1CkY,GAAKM,GACdlW,GAAO+pB,GAAcnU,EAAI,EAAIM,GACzB8V,IAAOtuB,EAAIsuB,EAAKpW,EAAI,GAAK,IAAG5V,EAAMA,EAAM,IAAM+pB,GAAcrsB,OAE3DA,EAAIkY,EAAI,GAAKM,IAAKlW,EAAMA,EAAIlB,MAAM,EAAGpB,GAAK,IAAMsC,EAAIlB,MAAMpB,IAC3DsuB,IAAOtuB,EAAIsuB,EAAK9V,GAAO,IACrBN,EAAI,IAAMM,IAAKlW,GAAO,KAC1BA,GAAO+pB,GAAcrsB,KAIlBsC,CACT,CAIA,SAASwwB,GAAkBpL,EAAQxP,GACjC,IAAIrY,EAAI6nB,EAAO,GAGf,IAAMxP,GAv9FK,EAu9FUrY,GAAK,GAAIA,GAAK,GAAIqY,IACvC,OAAOA,CACT,CAGA,SAASwa,GAAQlF,EAAMc,EAAID,GACzB,GAAIC,EAAKvC,GAKP,MAFAZ,IAAW,EACPkD,IAAIb,EAAKtH,UAAYmI,GACnB9Y,MAAM+V,IAEd,OAAO+B,GAAS,IAAIG,EAAKlI,IAAOgJ,EAAI,GAAG,EACzC,CAGA,SAASwC,GAAMtD,EAAMc,EAAI9B,GACvB,GAAI8B,EAAKtC,GAAc,MAAMzW,MAAM+V,IACnC,OAAO+B,GAAS,IAAIG,EAAK7C,IAAK2D,EAAI9B,GAAI,EACxC,CAGA,SAAS4G,GAAa1L,GACpB,IAAI7nB,EAAI6nB,EAAOznB,OAAS,EACtBuY,EAh/FS,EAg/FH3Y,EAAe,EAKvB,GAHAA,EAAI6nB,EAAO7nB,GAGJ,CAGL,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAI2Y,IAG7B,IAAK3Y,EAAI6nB,EAAO,GAAI7nB,GAAK,GAAIA,GAAK,GAAI2Y,GACxC,CAEA,OAAOA,CACT,CAGA,SAAS6T,GAAcrsB,GAErB,IADA,IAAI42B,EAAK,GACF52B,KAAM42B,GAAM,IACnB,OAAOA,CACT,CAUA,SAAS7B,GAAOvH,EAAM9tB,EAAG6D,EAAG8qB,GAC1B,IAAIkI,EACFtb,EAAI,IAAIuS,EAAK,GAIbxtB,EAAIwM,KAAKogB,KAAKyB,EAthGL,EAshGqB,GAIhC,IAFAlD,IAAW,IAEF,CAOP,GANI5nB,EAAI,GAEFszB,IADJ5b,EAAIA,EAAEyT,MAAMhvB,IACGK,EAAGC,KAAIu2B,GAAc,GAI5B,KADVhzB,EAAIkoB,GAAUloB,EAAI,IACL,CAGXA,EAAI0X,EAAElb,EAAEE,OAAS,EACbs2B,GAA0B,IAAXtb,EAAElb,EAAEwD,MAAY0X,EAAElb,EAAEwD,GACvC,KACF,CAGAszB,IADAn3B,EAAIA,EAAEgvB,MAAMhvB,IACDK,EAAGC,EAChB,CAIA,OAFAmrB,IAAW,EAEJlQ,CACT,CAGA,SAAS6b,GAAMvzB,GACb,OAA6B,EAAtBA,EAAExD,EAAEwD,EAAExD,EAAEE,OAAS,EAC1B,CAMA,SAAS82B,GAASvJ,EAAMhiB,EAAMjI,GAK5B,IAJA,IAAIvD,EAAGL,EACLD,EAAI,IAAI8tB,EAAKhiB,EAAK,IAClBxK,EAAI,IAEGA,EAAIwK,EAAKvL,QAAS,CAIzB,KAHAN,EAAI,IAAI6tB,EAAKhiB,EAAKxK,KAGXmI,EAAG,CACRzJ,EAAIC,EACJ,KACF,GAEAK,EAAIN,EAAEiuB,IAAIhuB,MAEA4D,GAAW,IAANvD,GAAWN,EAAEyJ,IAAM5F,KAChC7D,EAAIC,EAER,CAEA,OAAOD,CACT,CAkCA,SAASuzB,GAAmBvzB,EAAG4uB,GAC7B,IAAIgE,EAAa0E,EAAO/1B,EAAGmY,EAAK6d,EAAKx3B,EAAG4xB,EACtCnC,EAAM,EACNluB,EAAI,EACJhB,EAAI,EACJwtB,EAAO9tB,EAAE6E,YACTioB,EAAKgB,EAAK3C,SACVwD,EAAKb,EAAKtH,UAGZ,IAAKxmB,EAAEK,IAAML,EAAEK,EAAE,IAAML,EAAEwY,EAAI,GAE3B,OAAO,IAAIsV,EAAK9tB,EAAEK,EACbL,EAAEK,EAAE,GAASL,EAAEyJ,EAAI,EAAI,EAAI,IAAlB,EACVzJ,EAAEyJ,EAAIzJ,EAAEyJ,EAAI,EAAI,EAAIzJ,EAAI,KAa9B,IAVU,MAAN4uB,GACFnD,IAAW,EACXkG,EAAMhD,GAENgD,EAAM/C,EAGR7uB,EAAI,IAAI+tB,EAAK,QAGN9tB,EAAEwY,GAAK,GAGZxY,EAAIA,EAAEgvB,MAAMjvB,GACZO,GAAK,EAUP,IAJAqxB,GADA2F,EAAQxqB,KAAK2Y,IAAIuG,GAAQ,EAAG1rB,IAAMwM,KAAK8Y,KAAO,EAAI,EAAI,EAEtDgN,EAAclZ,EAAM6d,EAAM,IAAIzJ,EAAK,GACnCA,EAAKtH,UAAYmL,IAER,CAKP,GAJAjY,EAAMiU,GAASjU,EAAIsV,MAAMhvB,GAAI2xB,EAAK,GAClCiB,EAAcA,EAAY5D,QAAQ1tB,GAG9BkrB,IAFJzsB,EAAIw3B,EAAIpI,KAAKQ,GAAOjW,EAAKkZ,EAAajB,EAAK,KAEtBtxB,GAAGqB,MAAM,EAAGiwB,KAASnF,GAAe+K,EAAIl3B,GAAGqB,MAAM,EAAGiwB,GAAM,CAE7E,IADApwB,EAAIjB,EACGiB,KAAKg2B,EAAM5J,GAAS4J,EAAIvI,MAAMuI,GAAM5F,EAAK,GAOhD,GAAU,MAAN/C,EAYF,OADAd,EAAKtH,UAAYmI,EACV4I,EAVP,KAAI/H,EAAM,GAAK3C,GAAoB0K,EAAIl3B,EAAGsxB,EAAM2F,EAAOxK,EAAI0C,IAMzD,OAAO7B,GAAS4J,EAAKzJ,EAAKtH,UAAYmI,EAAI7B,EAAIrB,IAAW,GALzDqC,EAAKtH,UAAYmL,GAAO,GACxBiB,EAAclZ,EAAM3Z,EAAI,IAAI+tB,EAAK,GACjCxsB,EAAI,EACJkuB,GAQN,CAEA+H,EAAMx3B,CACR,CACF,CAkBA,SAASgzB,GAAiB9yB,EAAG2uB,GAC3B,IAAI1qB,EAAGszB,EAAI5E,EAAapa,EAAGif,EAAWjI,EAAK+H,EAAKx3B,EAAG4xB,EAAK+F,EAAIxF,EAC1DruB,EAAI,EAEJ7D,EAAIC,EACJouB,EAAKruB,EAAEK,EACPytB,EAAO9tB,EAAE6E,YACTioB,EAAKgB,EAAK3C,SACVwD,EAAKb,EAAKtH,UAGZ,GAAIxmB,EAAEyJ,EAAI,IAAM4kB,IAAOA,EAAG,KAAOruB,EAAEwY,GAAc,GAAT6V,EAAG,IAAwB,GAAbA,EAAG9tB,OACvD,OAAO,IAAIutB,EAAKO,IAAOA,EAAG,IAAK,IAAgB,GAAPruB,EAAEyJ,EAASskB,IAAMM,EAAK,EAAIruB,GAcpE,GAXU,MAAN4uB,GACFnD,IAAW,EACXkG,EAAMhD,GAENgD,EAAM/C,EAGRd,EAAKtH,UAAYmL,GAnBP,GAqBV6F,GADAtzB,EAAIsoB,GAAe6B,IACZb,OAAO,KAEV1gB,KAAKsa,IAAI5O,EAAIxY,EAAEwY,GAAK,OAqCtB,OAJAzY,EAAIizB,GAAQlF,EAAM6D,EAAM,EAAGhD,GAAIK,MAAMxW,EAAI,IACzCxY,EAAI+yB,GAAiB,IAAIjF,EAAK0J,EAAK,IAAMtzB,EAAExC,MAAM,IAAKiwB,EAzD9C,IAyD2DxC,KAAKpvB,GACxE+tB,EAAKtH,UAAYmI,EAEJ,MAANC,EAAajB,GAAS3tB,EAAG2uB,EAAI7B,EAAIrB,IAAW,GAAQzrB,EAxB3D,KAAOw3B,EAAK,GAAW,GAANA,GAAiB,GAANA,GAAWtzB,EAAEspB,OAAO,GAAK,GAGnDgK,GADAtzB,EAAIsoB,IADJxsB,EAAIA,EAAEgvB,MAAM/uB,IACSI,IACdmtB,OAAO,GACd3pB,IAiCJ,IA9BE2U,EAAIxY,EAAEwY,EAEFgf,EAAK,GACPx3B,EAAI,IAAI8tB,EAAK,KAAO5pB,GACpBsU,KAEAxY,EAAI,IAAI8tB,EAAK0J,EAAK,IAAMtzB,EAAExC,MAAM,IAepCg2B,EAAK13B,EAKLu3B,EAAME,EAAYz3B,EAAI2vB,GAAO3vB,EAAEkvB,MAAM,GAAIlvB,EAAEmvB,KAAK,GAAIwC,EAAK,GACzDO,EAAKvE,GAAS3tB,EAAEgvB,MAAMhvB,GAAI2xB,EAAK,GAC/BiB,EAAc,IAEL,CAIP,GAHA6E,EAAY9J,GAAS8J,EAAUzI,MAAMkD,GAAKP,EAAK,GAG3CnF,IAFJzsB,EAAIw3B,EAAIpI,KAAKQ,GAAO8H,EAAW,IAAI3J,EAAK8E,GAAcjB,EAAK,KAEtCtxB,GAAGqB,MAAM,EAAGiwB,KAASnF,GAAe+K,EAAIl3B,GAAGqB,MAAM,EAAGiwB,GAAM,CAc7E,GAbA4F,EAAMA,EAAIvI,MAAM,GAIN,IAANxW,IAAS+e,EAAMA,EAAIpI,KAAK6D,GAAQlF,EAAM6D,EAAM,EAAGhD,GAAIK,MAAMxW,EAAI,MACjE+e,EAAM5H,GAAO4H,EAAK,IAAIzJ,EAAKjqB,GAAI8tB,EAAK,GAQ1B,MAAN/C,EAWF,OADAd,EAAKtH,UAAYmI,EACV4I,EAVP,IAAI1K,GAAoB0K,EAAIl3B,EAAGsxB,EA5F3B,GA4FwC7E,EAAI0C,GAM9C,OAAO7B,GAAS4J,EAAKzJ,EAAKtH,UAAYmI,EAAI7B,EAAIrB,IAAW,GALzDqC,EAAKtH,UAAYmL,GA7Ff,GA8FF5xB,EAAI03B,EAAYz3B,EAAI2vB,GAAO+H,EAAGxI,MAAM,GAAIwI,EAAGvI,KAAK,GAAIwC,EAAK,GACzDO,EAAKvE,GAAS3tB,EAAEgvB,MAAMhvB,GAAI2xB,EAAK,GAC/BiB,EAAcpD,EAAM,CAQ1B,CAEA+H,EAAMx3B,EACN6yB,GAAe,CACjB,CACF,CAIA,SAASqE,GAAkBj3B,GAEzB,OAAOoD,OAAOpD,EAAEyJ,EAAIzJ,EAAEyJ,EAAI,EAC5B,CAMA,SAASkuB,GAAa33B,EAAG4C,GACvB,IAAI4V,EAAGlX,EAAGwX,EAoBV,KAhBKN,EAAI5V,EAAI0G,QAAQ,OAAS,IAAG1G,EAAMA,EAAI8Z,QAAQ,IAAK,MAGnDpb,EAAIsB,EAAIg1B,OAAO,OAAS,GAGvBpf,EAAI,IAAGA,EAAIlX,GACfkX,IAAM5V,EAAIlB,MAAMJ,EAAI,GACpBsB,EAAMA,EAAIi1B,UAAU,EAAGv2B,IACdkX,EAAI,IAGbA,EAAI5V,EAAIrC,QAILe,EAAI,EAAyB,KAAtBsB,EAAIpC,WAAWc,GAAWA,KAGtC,IAAKwX,EAAMlW,EAAIrC,OAAoC,KAA5BqC,EAAIpC,WAAWsY,EAAM,KAAaA,GAGzD,GAFAlW,EAAMA,EAAIlB,MAAMJ,EAAGwX,GAEV,CAYP,GAXAA,GAAOxX,EACPtB,EAAEwY,EAAIA,EAAIA,EAAIlX,EAAI,EAClBtB,EAAEK,EAAI,GAMNiB,GAAKkX,EAAI,GA/2GA,EAg3GLA,EAAI,IAAGlX,GAh3GF,GAk3GLA,EAAIwX,EAAK,CAEX,IADIxX,GAAGtB,EAAEK,EAAEmB,MAAMoB,EAAIlB,MAAM,EAAGJ,IACzBwX,GAp3GE,EAo3GexX,EAAIwX,GAAM9Y,EAAEK,EAAEmB,MAAMoB,EAAIlB,MAAMJ,EAAGA,GAp3GhD,IAs3GPA,EAt3GO,GAq3GPsB,EAAMA,EAAIlB,MAAMJ,IACGf,MACrB,MACEe,GAAKwX,EAGP,KAAOxX,KAAMsB,GAAO,IACpB5C,EAAEK,EAAEmB,MAAMoB,GAEN6oB,KAGEzrB,EAAEwY,EAAIxY,EAAE6E,YAAY2mB,MAGtBxrB,EAAEK,EAAI,KACNL,EAAEwY,EAAIuV,KAGG/tB,EAAEwY,EAAIxY,EAAE6E,YAAY0mB,OAG7BvrB,EAAEwY,EAAI,EACNxY,EAAEK,EAAI,CAAC,IAIb,MAGEL,EAAEwY,EAAI,EACNxY,EAAEK,EAAI,CAAC,GAGT,OAAOL,CACT,CAMA,SAAS83B,GAAW93B,EAAG4C,GACrB,IAAIujB,EAAM2H,EAAMiK,EAASz2B,EAAG02B,EAASlf,EAAK3P,EAAGklB,EAAI6E,EAEjD,GAAItwB,EAAI0G,QAAQ,MAAQ,GAEtB,GADA1G,EAAMA,EAAI8Z,QAAQ,eAAgB,MAC9B2D,GAAUrb,KAAKpC,GAAM,OAAO+0B,GAAa33B,EAAG4C,QAC3C,GAAY,aAARA,GAA8B,QAARA,EAI/B,OAHMA,IAAK5C,EAAEyJ,EAAIskB,KACjB/tB,EAAEwY,EAAIuV,IACN/tB,EAAEK,EAAI,KACCL,EAGT,GAAIksB,GAAMlnB,KAAKpC,GACbujB,EAAO,GACPvjB,EAAMA,EAAIoD,mBACL,GAAIimB,GAASjnB,KAAKpC,GACvBujB,EAAO,MACF,KAAIgG,GAAQnnB,KAAKpC,GAGtB,MAAMiT,MAAM8V,GAAkB/oB,GAF9BujB,EAAO,CAGT,CA+BA,KA5BA7kB,EAAIsB,EAAIg1B,OAAO,OAEP,GACNzuB,GAAKvG,EAAIlB,MAAMJ,EAAI,GACnBsB,EAAMA,EAAIi1B,UAAU,EAAGv2B,IAEvBsB,EAAMA,EAAIlB,MAAM,GAMlBs2B,GADA12B,EAAIsB,EAAI0G,QAAQ,OACD,EACfwkB,EAAO9tB,EAAE6E,YAELmzB,IAGF12B,GADAwX,GADAlW,EAAMA,EAAI8Z,QAAQ,IAAK,KACbnc,QACAe,EAGVy2B,EAAU1C,GAAOvH,EAAM,IAAIA,EAAK3H,GAAO7kB,EAAO,EAAJA,IAOvCA,EAHL4xB,GADA7E,EAAKlB,GAAYvqB,EAAKujB,EAAMiG,KACpB7rB,OAAS,EAGM,IAAV8tB,EAAG/sB,KAAYA,EAAG+sB,EAAG9F,MAClC,OAAIjnB,EAAI,EAAU,IAAIwsB,EAAW,EAAN9tB,EAAEyJ,IAC7BzJ,EAAEwY,EAAI4a,GAAkB/E,EAAI6E,GAC5BlzB,EAAEK,EAAIguB,EACN5C,IAAW,EAQPuM,IAASh4B,EAAI2vB,GAAO3vB,EAAG+3B,EAAe,EAANjf,IAGhC3P,IAAGnJ,EAAIA,EAAEgvB,MAAMliB,KAAKsa,IAAIje,GAAK,GAAK6iB,GAAQ,EAAG7iB,GAAK8uB,GAAQve,IAAI,EAAGvQ,KACrEsiB,IAAW,EAEJzrB,EACT,CA0CA,SAAS+uB,GAAajB,EAAMjqB,EAAG7D,EAAGC,EAAGi4B,GACnC,IAAI32B,EAAGxB,EAAGo4B,EAAGjG,EAEXvD,EAAKb,EAAKtH,UACVlmB,EAAIwM,KAAKogB,KAAKyB,EAphHL,GA0hHX,IAJAlD,IAAW,EACXyG,EAAKlyB,EAAEgvB,MAAMhvB,GACbm4B,EAAI,IAAIrK,EAAK7tB,KAEJ,CAMP,GALAF,EAAI4vB,GAAOwI,EAAEnJ,MAAMkD,GAAK,IAAIpE,EAAKjqB,IAAMA,KAAM8qB,EAAI,GACjDwJ,EAAID,EAAej4B,EAAEkvB,KAAKpvB,GAAKE,EAAEivB,MAAMnvB,GACvCE,EAAI0vB,GAAO5vB,EAAEivB,MAAMkD,GAAK,IAAIpE,EAAKjqB,IAAMA,KAAM8qB,EAAI,QAGlC,KAFf5uB,EAAIo4B,EAAEhJ,KAAKlvB,IAELI,EAAEC,GAAe,CACrB,IAAKiB,EAAIjB,EAAGP,EAAEM,EAAEkB,KAAO42B,EAAE93B,EAAEkB,IAAMA,MACjC,IAAU,GAANA,EAAS,KACf,CAEAA,EAAI42B,EACJA,EAAIl4B,EACJA,EAAIF,EACJA,EAAIwB,CAEN,CAKA,OAHAkqB,IAAW,EACX1rB,EAAEM,EAAEE,OAASD,EAAI,EAEVP,CACT,CAIA,SAAS+uB,GAAQ5V,EAAGV,GAElB,IADA,IAAI3U,EAAIqV,IACCV,GAAG3U,GAAKqV,EACjB,OAAOrV,CACT,CAIA,SAASurB,GAAiBtB,EAAM9tB,GAC9B,IAAID,EACFoxB,EAAQnxB,EAAEyJ,EAAI,EACd2uB,EAAKhH,GAAMtD,EAAMA,EAAKtH,UAAW,GACjCuL,EAASqG,EAAGpJ,MAAM,IAIpB,IAFAhvB,EAAIA,EAAEonB,OAEAmK,IAAIQ,GAER,OADAlH,GAAWsG,EAAQ,EAAI,EAChBnxB,EAKT,IAFAD,EAAIC,EAAEkwB,SAASkI,IAETvJ,SACJhE,GAAWsG,EAAQ,EAAI,MAClB,CAIL,IAHAnxB,EAAIA,EAAEkvB,MAAMnvB,EAAEivB,MAAMoJ,KAGd7G,IAAIQ,GAER,OADAlH,GAAWuM,GAAMr3B,GAAMoxB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,EAC9CnxB,EAGT6qB,GAAWuM,GAAMr3B,GAAMoxB,EAAQ,EAAI,EAAMA,EAAQ,EAAI,CACvD,CAEA,OAAOnxB,EAAEkvB,MAAMkJ,GAAIhR,KACrB,CAQA,SAASgN,GAAep0B,EAAGqtB,EAASuB,EAAI9B,GACtC,IAAI3G,EAAM3N,EAAGlX,EAAGhB,EAAGwY,EAAKge,EAASl0B,EAAKyrB,EAAIpuB,EACxC6tB,EAAO9tB,EAAE6E,YACTmyB,OAAe,IAAPpI,EAWV,GATIoI,GACFpK,GAAWgC,EAAI,EAAG7D,SACP,IAAP+B,EAAeA,EAAKgB,EAAK3C,SACxByB,GAAWE,EAAI,EAAG,KAEvB8B,EAAKd,EAAKtH,UACVsG,EAAKgB,EAAK3C,UAGPnrB,EAAE8kB,WAEA,CAoCL,IA3BIkS,GACF7Q,EAAO,EACQ,IAAXkH,EACFuB,EAAU,EAALA,EAAS,EACM,GAAXvB,IACTuB,EAAU,EAALA,EAAS,IAGhBzI,EAAOkH,GAfT/rB,GADAsB,EAAM2xB,GAAev0B,IACbsJ,QAAQ,OAsBP,IACP1G,EAAMA,EAAI8Z,QAAQ,IAAK,KACvBzc,EAAI,IAAI6tB,EAAK,IACXtV,EAAI5V,EAAIrC,OAASe,EACnBrB,EAAEI,EAAI8sB,GAAYoH,GAAet0B,GAAI,GAAIkmB,GACzClmB,EAAEuY,EAAIvY,EAAEI,EAAEE,QAIZiY,EAAIM,GADJuV,EAAKlB,GAAYvqB,EAAK,GAAIujB,IACb5lB,OAGO,GAAb8tB,IAAKvV,IAAYuV,EAAG9F,MAE3B,GAAK8F,EAAG,GAED,CAyBL,GAxBI/sB,EAAI,EACNkX,MAEAxY,EAAI,IAAI8tB,EAAK9tB,IACXK,EAAIguB,EACNruB,EAAEwY,EAAIA,EAEN6V,GADAruB,EAAI2vB,GAAO3vB,EAAGC,EAAG2uB,EAAI9B,EAAI,EAAG3G,IACrB9lB,EACPmY,EAAIxY,EAAEwY,EACNse,EAAUlM,IAIZtpB,EAAI+sB,EAAGO,GACPtuB,EAAI6lB,EAAO,EACX2Q,EAAUA,QAA0B,IAAfzI,EAAGO,EAAK,GAE7BkI,EAAUhK,EAAK,QACJ,IAANxrB,GAAgBw1B,KAAoB,IAAPhK,GAAYA,KAAQ9sB,EAAEyJ,EAAI,EAAI,EAAI,IAChEnI,EAAIhB,GAAKgB,IAAMhB,IAAa,IAAPwsB,GAAYgK,GAAkB,IAAPhK,GAAyB,EAAbuB,EAAGO,EAAK,IAChE9B,KAAQ9sB,EAAEyJ,EAAI,EAAI,EAAI,IAE1B4kB,EAAG9tB,OAASquB,EAERkI,EAGF,OAASzI,IAAKO,GAAMzI,EAAO,GACzBkI,EAAGO,GAAM,EACJA,MACDpW,EACF6V,EAAG/F,QAAQ,IAMjB,IAAKxP,EAAMuV,EAAG9tB,QAAS8tB,EAAGvV,EAAM,KAAMA,GAGtC,IAAKxX,EAAI,EAAGsB,EAAM,GAAItB,EAAIwX,EAAKxX,IAAKsB,GAAOooB,GAASwC,OAAOa,EAAG/sB,IAG9D,GAAI01B,EAAO,CACT,GAAIle,EAAM,EACR,GAAe,IAAXuU,GAA4B,GAAXA,EAAc,CAEjC,IADA/rB,EAAe,IAAX+rB,EAAgB,EAAI,IACjBvU,EAAKA,EAAMxX,EAAGwX,IAAOlW,GAAO,IAEnC,IAAKkW,GADLuV,EAAKlB,GAAYvqB,EAAKujB,EAAMkH,IACd9sB,QAAS8tB,EAAGvV,EAAM,KAAMA,GAGtC,IAAKxX,EAAI,EAAGsB,EAAM,KAAMtB,EAAIwX,EAAKxX,IAAKsB,GAAOooB,GAASwC,OAAOa,EAAG/sB,GAClE,MACEsB,EAAMA,EAAI4qB,OAAO,GAAK,IAAM5qB,EAAIlB,MAAM,GAI1CkB,EAAOA,GAAO4V,EAAI,EAAI,IAAM,MAAQA,CACtC,MAAO,GAAIA,EAAI,EAAG,CAChB,OAASA,GAAI5V,EAAM,IAAMA,EACzBA,EAAM,KAAOA,CACf,MACE,KAAM4V,EAAIM,EAAK,IAAKN,GAAKM,EAAKN,KAAO5V,GAAO,SACnC4V,EAAIM,IAAKlW,EAAMA,EAAIlB,MAAM,EAAG8W,GAAK,IAAM5V,EAAIlB,MAAM8W,GAE9D,MApEE5V,EAAMo0B,EAAQ,OAAS,IAsEzBp0B,GAAkB,IAAXyqB,EAAgB,KAAkB,GAAXA,EAAe,KAAkB,GAAXA,EAAe,KAAO,IAAMzqB,CAClF,MA/GEA,EAAMq0B,GAAkBj3B,GAiH1B,OAAOA,EAAEyJ,EAAI,EAAI,IAAM7G,EAAMA,CAC/B,CAIA,SAASu0B,GAASrnB,EAAKgJ,GACrB,GAAIhJ,EAAIvP,OAASuY,EAEf,OADAhJ,EAAIvP,OAASuY,GACN,CAEX,CAyDA,SAASsO,GAAIpnB,GACX,OAAO,IAAIR,KAAKQ,GAAGonB,KACrB,CASA,SAAS8J,GAAKlxB,GACZ,OAAO,IAAIR,KAAKQ,GAAGkxB,MACrB,CAUA,SAAS,GAAMlxB,GACb,OAAO,IAAIR,KAAKQ,GAAG2oB,OACrB,CAWA,SAASje,GAAI1K,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGmvB,KAAKlvB,EAC1B,CAUA,SAAS6xB,GAAK9xB,GACZ,OAAO,IAAIR,KAAKQ,GAAG8xB,MACrB,CAUA,SAAS,GAAM9xB,GACb,OAAO,IAAIR,KAAKQ,GAAG6oB,OACrB,CAUA,SAASwI,GAAKrxB,GACZ,OAAO,IAAIR,KAAKQ,GAAGqxB,MACrB,CAUA,SAAS,GAAMrxB,GACb,OAAO,IAAIR,KAAKQ,GAAG8oB,OACrB,CA4BA,SAASuP,GAAMp4B,EAAGD,GAChBC,EAAI,IAAIT,KAAKS,GACbD,EAAI,IAAIR,KAAKQ,GACb,IAAIub,EACFoT,EAAKnvB,KAAKgnB,UACVsG,EAAKttB,KAAK2rB,SACVwG,EAAMhD,EAAK,EAkCb,OA/BK1uB,EAAEwJ,GAAMzJ,EAAEyJ,EAIHxJ,EAAEI,GAAML,EAAEK,GAKVL,EAAEK,GAAKJ,EAAE4uB,UACnBtT,EAAIvb,EAAEyJ,EAAI,EAAI2nB,GAAM5xB,KAAMmvB,EAAI7B,GAAM,IAAIttB,KAAK,IAC3CiK,EAAIxJ,EAAEwJ,GAGExJ,EAAEI,GAAKL,EAAE6uB,UACnBtT,EAAI6V,GAAM5xB,KAAMmyB,EAAK,GAAG3C,MAAM,KAC5BvlB,EAAIxJ,EAAEwJ,EAGCzJ,EAAEyJ,EAAI,GACfjK,KAAKgnB,UAAYmL,EACjBnyB,KAAK2rB,SAAW,EAChB5P,EAAI/b,KAAK6xB,KAAK1B,GAAO1vB,EAAGD,EAAG2xB,EAAK,IAChC3xB,EAAIoxB,GAAM5xB,KAAMmyB,EAAK,GACrBnyB,KAAKgnB,UAAYmI,EACjBnvB,KAAK2rB,SAAW2B,EAChBvR,EAAItb,EAAEwJ,EAAI,EAAI8R,EAAE2T,MAAMlvB,GAAKub,EAAE4T,KAAKnvB,IAElCub,EAAI/b,KAAK6xB,KAAK1B,GAAO1vB,EAAGD,EAAG2xB,EAAK,KAvBhCpW,EAAI6V,GAAM5xB,KAAMmyB,EAAK,GAAG3C,MAAMhvB,EAAEyJ,EAAI,EAAI,IAAO,MAC7CA,EAAIxJ,EAAEwJ,EALR8R,EAAI,IAAI/b,KAAKuuB,KA8BRxS,CACT,CAUA,SAAS,GAAKvb,GACZ,OAAO,IAAIR,KAAKQ,GAAG8lB,MACrB,CASA,SAASoH,GAAKltB,GACZ,OAAO2tB,GAAS3tB,EAAI,IAAIR,KAAKQ,GAAIA,EAAEwY,EAAI,EAAG,EAC5C,CAWA,SAASqV,GAAM7tB,EAAG+M,EAAKG,GACrB,OAAO,IAAI1N,KAAKQ,GAAG6tB,MAAM9gB,EAAKG,EAChC,CAqBA,SAASgY,GAAOnP,GACd,IAAKA,GAAsB,iBAARA,EAAkB,MAAMF,MAAM6V,GAAe,mBAChE,IAAIpqB,EAAG6H,EAAG/I,EACRk4B,GAA+B,IAAjBviB,EAAIwiB,SAClBC,EAAK,CACH,YAAa,EAAGzN,GAChB,WAAY,EAAG,EACf,YAAaD,GAAW,EACxB,WAAY,EAAGA,GACf,OAAQ,EAAGA,GACX,QAASA,GAAW,EACpB,SAAU,EAAG,GAGjB,IAAKxpB,EAAI,EAAGA,EAAIk3B,EAAGj4B,OAAQe,GAAK,EAE9B,GADI6H,EAAIqvB,EAAGl3B,GAAIg3B,IAAa94B,KAAK2J,GAAK+hB,GAAS/hB,SAC1B,KAAhB/I,EAAI2V,EAAI5M,IAAgB,CAC3B,KAAI4iB,GAAU3rB,KAAOA,GAAKA,GAAKo4B,EAAGl3B,EAAI,IAAMlB,GAAKo4B,EAAGl3B,EAAI,IACnD,MAAMuU,MAAM8V,GAAkBxiB,EAAI,KAAO/I,GADcZ,KAAK2J,GAAK/I,CAExE,CAIF,GADI+I,EAAI,SAAUmvB,IAAa94B,KAAK2J,GAAK+hB,GAAS/hB,SAC7B,KAAhB/I,EAAI2V,EAAI5M,IAAgB,CAC3B,IAAU,IAAN/I,IAAoB,IAANA,GAAqB,IAANA,GAAiB,IAANA,EAY1C,MAAMyV,MAAM8V,GAAkBxiB,EAAI,KAAO/I,GAXzC,GAAIA,EAAG,CACL,GAAqB,oBAAVma,SAAyBA,SACjCA,OAAOE,kBAAmBF,OAAOF,YAGlC,MAAMxE,MAAMgW,IAFZrsB,KAAK2J,IAAK,CAId,MACE3J,KAAK2J,IAAK,CAKhB,CAEA,OAAO3J,IACT,CAUA,SAASkvB,GAAI1uB,GACX,OAAO,IAAIR,KAAKQ,GAAG0uB,KACrB,CAUA,SAAS,GAAK1uB,GACZ,OAAO,IAAIR,KAAKQ,GAAG+oB,MACrB,CAkNA,SAASiH,GAAIhwB,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGgwB,IAAI/vB,EACzB,CAUA,SAAS+lB,GAAIhmB,GACX,OAAO,IAAIR,KAAKQ,GAAGgmB,KACrB,CASA,SAAS5M,GAAMpZ,GACb,OAAO2tB,GAAS3tB,EAAI,IAAIR,KAAKQ,GAAIA,EAAEwY,EAAI,EAAG,EAC5C,CAYA,SAASigB,KACP,IAAIn3B,EAAGuC,EACL9D,EAAI,IAAIP,KAAK,GAIf,IAFAisB,IAAW,EAENnqB,EAAI,EAAGA,EAAIW,UAAU1B,QAExB,IADAsD,EAAI,IAAIrE,KAAKyC,UAAUX,OAChBjB,EAMIN,EAAEM,IACXN,EAAIA,EAAEovB,KAAKtrB,EAAEmrB,MAAMnrB,SAPX,CACR,GAAIA,EAAE4F,EAEJ,OADAgiB,IAAW,EACJ,IAAIjsB,KAAK,KAElBO,EAAI8D,CACN,CAOF,OAFA4nB,IAAW,EAEJ1rB,EAAE6oB,MACX,CAQA,SAAS8P,GAAkB3iB,GACzB,OAAOA,aAAekiB,IAAWliB,GAAOA,EAAImI,cAAgB4N,KAAO,CACrE,CAUA,SAAS0F,GAAGxxB,GACV,OAAO,IAAIR,KAAKQ,GAAGwxB,IACrB,CAaA,SAAS/L,GAAIzlB,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGylB,IAAIxlB,EACzB,CAUA,SAAS,GAAKD,GACZ,OAAO,IAAIR,KAAKQ,GAAGylB,IAAI,EACzB,CAUA,SAAS,GAAMzlB,GACb,OAAO,IAAIR,KAAKQ,GAAGylB,IAAI,GACzB,CASA,SAASvY,KACP,OAAOmqB,GAAS73B,KAAMyC,WAAY,EACpC,CASA,SAAS8K,KACP,OAAOsqB,GAAS73B,KAAMyC,UAAW,EACnC,CAWA,SAASoxB,GAAIrzB,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGqzB,IAAIpzB,EACzB,CAWA,SAASg0B,GAAIj0B,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGi0B,IAAIh0B,EACzB,CAWA,SAASyZ,GAAI1Z,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAG0Z,IAAIzZ,EACzB,CAWA,SAAS6b,GAAO8S,GACd,IAAIvuB,EAAGmY,EAAGlY,EAAGuD,EACXvC,EAAI,EACJia,EAAI,IAAI/b,KAAK,GACbytB,EAAK,GAOP,QALW,IAAP2B,EAAeA,EAAKpvB,KAAKgnB,UACxBoG,GAAWgC,EAAI,EAAG7D,IAEvBzqB,EAAIwM,KAAKogB,KAAK0B,EAr9IH,GAu9INpvB,KAAK+a,OAIH,GAAIA,OAAOE,gBAGhB,IAFApa,EAAIka,OAAOE,gBAAgB,IAAIke,YAAYr4B,IAEpCgB,EAAIhB,IACTuD,EAAIxD,EAAEiB,KAIG,MACPjB,EAAEiB,GAAKiZ,OAAOE,gBAAgB,IAAIke,YAAY,IAAI,GAKlD1L,EAAG3rB,KAAOuC,EAAI,QAKb,KAAI0W,OAAOF,YAwBhB,MAAMxE,MAAMgW,IAnBZ,IAFAxrB,EAAIka,OAAOF,YAAY/Z,GAAK,GAErBgB,EAAIhB,IAGTuD,EAAIxD,EAAEiB,IAAMjB,EAAEiB,EAAI,IAAM,IAAMjB,EAAEiB,EAAI,IAAM,MAAmB,IAAXjB,EAAEiB,EAAI,KAAc,MAG7D,MACPiZ,OAAOF,YAAY,GAAG5Z,KAAKJ,EAAGiB,IAK9B2rB,EAAGzrB,KAAKqC,EAAI,KACZvC,GAAK,GAITA,EAAIhB,EAAI,CAGV,MA/CE,KAAOgB,EAAIhB,GAAI2sB,EAAG3rB,KAAuB,IAAhBwL,KAAKgP,SAAiB,EA2DjD,IATA8S,GA1gJW,GAygJXtuB,EAAI2sB,IAAK3rB,KAIAstB,IACP/qB,EAAImoB,GAAQ,GA9gJH,EA8gJkB4C,GAC3B3B,EAAG3rB,IAAMhB,EAAIuD,EAAI,GAAKA,GAIP,IAAVopB,EAAG3rB,GAAUA,IAAK2rB,EAAG1E,MAG5B,GAAIjnB,EAAI,EACNkX,EAAI,EACJyU,EAAK,CAAC,OACD,CAIL,IAHAzU,GAAK,EAGY,IAAVyU,EAAG,GAAUzU,GA7hJX,EA6hJ0ByU,EAAG5E,QAGtC,IAAK/nB,EAAI,EAAGuD,EAAIopB,EAAG,GAAIppB,GAAK,GAAIA,GAAK,GAAIvD,IAGrCA,EAniJK,IAmiJSkY,GAniJT,EAmiJyBlY,EACpC,CAKA,OAHAib,EAAE/C,EAAIA,EACN+C,EAAElb,EAAI4sB,EAEC1R,CACT,CAWA,SAASwJ,GAAM/kB,GACb,OAAO2tB,GAAS3tB,EAAI,IAAIR,KAAKQ,GAAIA,EAAEwY,EAAI,EAAGhZ,KAAK2rB,SACjD,CAcA,SAAS,GAAKnrB,GAEZ,OADAA,EAAI,IAAIR,KAAKQ,IACJK,EAAKL,EAAEK,EAAE,GAAKL,EAAEyJ,EAAI,EAAIzJ,EAAEyJ,EAAKzJ,EAAEyJ,GAAKskB,GACjD,CAUA,SAAS6F,GAAI5zB,GACX,OAAO,IAAIR,KAAKQ,GAAG4zB,KACrB,CAUA,SAAS,GAAK5zB,GACZ,OAAO,IAAIR,KAAKQ,GAAGgpB,MACrB,CAUA,SAASJ,GAAK5oB,GACZ,OAAO,IAAIR,KAAKQ,GAAG4oB,MACrB,CAWA,SAASqK,GAAIjzB,EAAGC,GACd,OAAO,IAAIT,KAAKQ,GAAGizB,IAAIhzB,EACzB,CAYA,SAASs3B,KACP,IAAIj2B,EAAI,EACNwK,EAAO7J,UACPjC,EAAI,IAAIR,KAAKsM,EAAKxK,IAGpB,IADAmqB,IAAW,EACJzrB,EAAEyJ,KAAOnI,EAAIwK,EAAKvL,QAASP,EAAIA,EAAEmvB,KAAKrjB,EAAKxK,IAGlD,OAFAmqB,IAAW,EAEJkC,GAAS3tB,EAAGR,KAAKgnB,UAAWhnB,KAAK2rB,SAC1C,CAUA,SAAS6I,GAAIh0B,GACX,OAAO,IAAIR,KAAKQ,GAAGg0B,KACrB,CAUA,SAAS,GAAKh0B,GACZ,OAAO,IAAIR,KAAKQ,GAAGipB,MACrB,CASA,SAASwM,GAAMz1B,GACb,OAAO2tB,GAAS3tB,EAAI,IAAIR,KAAKQ,GAAIA,EAAEwY,EAAI,EAAG,EAC5C,CAGA+T,GAAEtO,OAAO2a,IAAI,+BAAiCrM,GAAEna,SAChDma,GAAEtO,OAAOC,aAAe,UAGjB,IAAI+Z,GAAU1L,GAAE1nB,YAvnBvB,SAAS,EAAMkR,GACb,IAAIzU,EAAG6H,EAAGqvB,EASV,SAASP,EAAQ73B,GACf,IAAIoY,EAAGlX,EAAGvB,EACRC,EAAIR,KAGN,KAAMQ,aAAai4B,GAAU,OAAO,IAAIA,EAAQ73B,GAMhD,GAFAJ,EAAE6E,YAAcozB,EAEZS,GAAkBt4B,GAuBpB,OAtBAJ,EAAEyJ,EAAIrJ,EAAEqJ,OAEJgiB,IACGrrB,EAAEC,GAAKD,EAAEoY,EAAIyf,EAAQzM,MAGxBxrB,EAAEwY,EAAIuV,IACN/tB,EAAEK,EAAI,MACGD,EAAEoY,EAAIyf,EAAQ1M,MAGvBvrB,EAAEwY,EAAI,EACNxY,EAAEK,EAAI,CAAC,KAEPL,EAAEwY,EAAIpY,EAAEoY,EACRxY,EAAEK,EAAID,EAAEC,EAAEqB,UAGZ1B,EAAEwY,EAAIpY,EAAEoY,EACRxY,EAAEK,EAAID,EAAEC,EAAID,EAAEC,EAAEqB,QAAUtB,EAAEC,IAQhC,GAAU,WAFVN,SAAWK,GAES,CAClB,GAAU,IAANA,EAIF,OAHAJ,EAAEyJ,EAAI,EAAIrJ,EAAI,GAAK,EAAI,EACvBJ,EAAEwY,EAAI,OACNxY,EAAEK,EAAI,CAAC,IAYT,GARID,EAAI,GACNA,GAAKA,EACLJ,EAAEyJ,GAAK,GAEPzJ,EAAEyJ,EAAI,EAIJrJ,MAAQA,GAAKA,EAAI,IAAK,CACxB,IAAKoY,EAAI,EAAGlX,EAAIlB,EAAGkB,GAAK,GAAIA,GAAK,GAAIkX,IAkBrC,YAhBIiT,GACEjT,EAAIyf,EAAQzM,MACdxrB,EAAEwY,EAAIuV,IACN/tB,EAAEK,EAAI,MACGmY,EAAIyf,EAAQ1M,MACrBvrB,EAAEwY,EAAI,EACNxY,EAAEK,EAAI,CAAC,KAEPL,EAAEwY,EAAIA,EACNxY,EAAEK,EAAI,CAACD,KAGTJ,EAAEwY,EAAIA,EACNxY,EAAEK,EAAI,CAACD,IAIX,CAGA,OAAQ,EAAJA,GAAU,GACPA,IAAGJ,EAAEyJ,EAAIskB,KACd/tB,EAAEwY,EAAIuV,SACN/tB,EAAEK,EAAI,OAIDs3B,GAAa33B,EAAGI,EAAEgS,WAC3B,CAEA,GAAU,WAANrS,EASF,OAR8B,MAAzBuB,EAAIlB,EAAEI,WAAW,KACpBJ,EAAIA,EAAEsB,MAAM,GACZ1B,EAAEyJ,GAAK,IAEG,KAANnI,IAAUlB,EAAIA,EAAEsB,MAAM,IAC1B1B,EAAEyJ,EAAI,GAGD4W,GAAUrb,KAAK5E,GAAKu3B,GAAa33B,EAAGI,GAAK03B,GAAW93B,EAAGI,GAGhE,GAAU,WAANL,EAQF,OAPIK,EAAI,GACNA,GAAKA,EACLJ,EAAEyJ,GAAK,GAEPzJ,EAAEyJ,EAAI,EAGDkuB,GAAa33B,EAAGI,EAAEgS,YAG3B,MAAMyD,MAAM8V,GAAkBvrB,EAChC,CA2DA,GAzDA63B,EAAQ71B,UAAYmqB,GAEpB0L,EAAQY,SAAW,EACnBZ,EAAQa,WAAa,EACrBb,EAAQc,WAAa,EACrBd,EAAQe,YAAc,EACtBf,EAAQgB,cAAgB,EACxBhB,EAAQiB,gBAAkB,EAC1BjB,EAAQkB,gBAAkB,EAC1BlB,EAAQmB,gBAAkB,EAC1BnB,EAAQoB,iBAAmB,EAC3BpB,EAAQqB,OAAS,EAEjBrB,EAAQ/S,OAAS+S,EAAQxxB,IAAMye,GAC/B+S,EAAQhV,MAAQ,EAChBgV,EAAQ5X,UAAYqY,GAEpBT,EAAQ7Q,IAAMA,GACd6Q,EAAQ/G,KAAOA,GACf+G,EAAQtP,MAAQ,GAChBsP,EAAQvtB,IAAMA,GACdutB,EAAQnG,KAAOA,GACfmG,EAAQpP,MAAQ,GAChBoP,EAAQ5G,KAAOA,GACf4G,EAAQnP,MAAQ,GAChBmP,EAAQI,MAAQA,GAChBJ,EAAQnS,KAAO,GACfmS,EAAQ/K,KAAOA,GACf+K,EAAQpK,MAAQA,GAChBoK,EAAQvJ,IAAMA,GACduJ,EAAQlP,KAAO,GACfkP,EAAQjI,IAAMA,GACdiI,EAAQjS,IAAMA,GACdiS,EAAQ7e,MAAQA,GAChB6e,EAAQQ,MAAQA,GAChBR,EAAQzG,GAAKA,GACbyG,EAAQxS,IAAMA,GACdwS,EAAQtS,MAAQ,GAChBsS,EAAQzS,KAAO,GACfyS,EAAQ/qB,IAAMA,GACd+qB,EAAQlrB,IAAMA,GACdkrB,EAAQ5E,IAAMA,GACd4E,EAAQhE,IAAMA,GACdgE,EAAQve,IAAMA,GACdue,EAAQnc,OAASA,GACjBmc,EAAQlT,MAAQA,GAChBkT,EAAQ1S,KAAO,GACf0S,EAAQrE,IAAMA,GACdqE,EAAQjP,KAAO,GACfiP,EAAQrP,KAAOA,GACfqP,EAAQhF,IAAMA,GACdgF,EAAQV,IAAMA,GACdU,EAAQjE,IAAMA,GACdiE,EAAQhP,KAAO,GACfgP,EAAQxC,MAAQA,QAEJ,IAAR1f,IAAgBA,EAAM,CAAC,GACvBA,IACmB,IAAjBA,EAAIwiB,SAEN,IADAC,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5El3B,EAAI,EAAGA,EAAIk3B,EAAGj4B,QAAcwV,EAAI1T,eAAe8G,EAAIqvB,EAAGl3B,QAAOyU,EAAI5M,GAAK3J,KAAK2J,IAMpF,OAFA8uB,EAAQ/S,OAAOnP,GAERkiB,CACT,CAwbqC,CAAM/M,IAG3CtF,GAAO,IAAIqS,GAAQrS,IACnBqF,GAAK,IAAIgN,GAAQhN,IAEjB,YC3yJasO,GAAuCp6B,GAHvC,YACQ,CAAC,MAAO,WAEmD0D,IAAoB,IAAnB,GAAEyV,EAAE,OAAE4M,GAAQriB,EAC7F,MAAM0mB,EAAY0O,GAAQhV,MAAM,CAAEuD,UAAWtB,EAAOsB,UAAW4E,OAAQ6M,GAAQqB,SAyC/E,OAxCA/P,EAAUnnB,UAAYN,OAAO6C,OAAO4kB,EAAUnnB,WAK9CmnB,EAAUnnB,UAAUyD,KAAO,YAC3B0jB,EAAUnnB,UAAUge,aAAc,EAQlCmJ,EAAUnnB,UAAUmoB,OAAS,WAC3B,MAAO,CACLC,OAAQ,YACRxjB,MAAOxH,KAAK4S,WAEhB,EAQAmX,EAAUkB,SAAW,SAAUC,GAC7B,OAAO,IAAInB,EAAUmB,EAAK1jB,MAC5B,EAEIsR,GAEFA,EAAG,UAAU,SAAUkhB,EAAMC,GACvBD,EAAKhT,YAAciT,EAAKjT,WAC1B+C,EAAUrE,OAAO,CAAEsB,UAAWgT,EAAKhT,WAEvC,IAGK+C,CAAS,GACf,CAAEoB,SAAS,IClBR,GAAO7d,KAAKic,MAAQ,SAAU/oB,GAClC,OAAO8M,KAAKsa,IAAIpnB,GAAK,KAAO,EAAIA,EAAmC,IAA9B8M,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,GAC/D,EAEM,GAAO8M,KAAKkc,MAAQ,SAAUhpB,GAClC,OAAO8M,KAAKsa,IAAIpnB,GAAK,KAAOA,EAAmC,IAA9B8M,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,GAC3D,EA6CM,GAAQ,SAAUA,EAAGC,GASzB,OAPAD,EAAI8M,KAAKsa,IAAIpnB,KACbC,EAAI6M,KAAKsa,IAAInnB,OAGDD,EAAGC,GAAK,CAACA,EAAGD,IAGpBA,EAAI,IAAY8M,KAAK8b,KAAK5oB,EAAIA,EAAIC,EAAIA,IAG1CA,GAAKD,EACEA,EAAI8M,KAAK8b,KAAK,EAAI3oB,EAAIA,GAC/B,EAEMy5B,GAAc,WAClB,MAAMxuB,YAAY,gBACpB,EASA,SAASyuB,GAASxgB,EAAGD,GAEnB,MAAM0gB,EAAK9sB,KAAKsa,IAAIjO,GACd0gB,EAAK/sB,KAAKsa,IAAIlO,GAEpB,OAAU,IAANC,EACKrM,KAAK2Y,IAAIoU,GAGR,IAAN3gB,EACKpM,KAAK2Y,IAAImU,GAGdA,EAAK,KAAQC,EAAK,IACa,GAA1B/sB,KAAK2Y,IAAItM,EAAIA,EAAID,EAAIA,IAmC9BC,GAAQ,GACRD,GAAQ,GAED,GAAMpM,KAAK2Y,IAAItM,EAAIA,EAAID,EAAIA,GAAKpM,KAAK4Y,IAC9C,CAEA,MAAM,GAAI,CAAE,GAAM,EAAG,GAAM,GACrB3I,GAAQ,SAAU5D,EAAGD,GAEzB,MAAMhZ,EAAI,GAEV,GAAIiZ,QACFjZ,EAAM,GACJA,EAAM,GAAI,OACP,QAAU4C,IAANoW,EACThZ,EAAM,GAAIiZ,EACVjZ,EAAM,GAAIgZ,OAEV,cAAeC,GAEb,IAAK,SAEH,GAAI,OAAQA,GAAK,OAAQA,EACvBjZ,EAAM,GAAIiZ,EAAM,GAChBjZ,EAAM,GAAIiZ,EAAM,QACX,GAAI,QAASA,GAAK,QAASA,EAAG,CACnC,IAAK2L,SAAS3L,EAAO,MAAM2L,SAAS3L,EAAO,KACzC,OAAOqQ,GAAkB,SAE3BtpB,EAAM,GAAIiZ,EAAO,IAAIrM,KAAK4hB,IAAIvV,EAAO,KACrCjZ,EAAM,GAAIiZ,EAAO,IAAIrM,KAAK8mB,IAAIza,EAAO,IACvC,MAAO,GAAI,MAAOA,GAAK,QAASA,EAAG,CACjC,IAAK2L,SAAS3L,EAAK,IAAM2L,SAAS3L,EAAO,KACvC,OAAOqQ,GAAkB,SAE3BtpB,EAAM,GAAIiZ,EAAK,EAAIrM,KAAK4hB,IAAIvV,EAAO,KACnCjZ,EAAM,GAAIiZ,EAAK,EAAIrM,KAAK8mB,IAAIza,EAAO,IACrC,MAAwB,IAAbA,EAAE5Y,QACXL,EAAM,GAAIiZ,EAAE,GACZjZ,EAAM,GAAIiZ,EAAE,IAEZugB,KAEF,MAEF,IAAK,SAEHx5B,EAAM,GACNA,EAAM,GAAI,EAEV,MAAM45B,EAAS3gB,EAAEuD,QAAQ,KAAM,IAC5B1U,MAAM,yCACT,IAAImnB,EAAO,EACPD,EAAQ,EAEG,OAAX4K,GACFJ,KAGF,IAAK,IAAIp4B,EAAI,EAAGA,EAAIw4B,EAAOv5B,OAAQe,IAAK,CAEtC,MAAM4C,EAAI41B,EAAOx4B,GAEP,MAAN4C,GAAmB,OAANA,GAAoB,OAANA,IAEd,MAANA,EACTirB,IACe,MAANjrB,EACTgrB,IACe,MAANhrB,GAAmB,MAANA,GAElBirB,EAAOD,IAAU,GACnBwK,KAGoB,MAAlBI,EAAOx4B,EAAI,IAAe8b,MAAM0c,EAAOx4B,EAAI,IAI7CpB,EAAM,IAAKid,YAAY+R,EAAQ,EAAI,IAAM,IAAM,MAH/ChvB,EAAM,IAAKid,YAAY+R,EAAQ,EAAI,IAAM,IAAM4K,EAAOx4B,EAAI,IAC1DA,KAIF6tB,EAAOD,EAAQ,KAIXC,EAAOD,IAAU,GAAK9R,MAAMlZ,KAC9Bw1B,KAGoB,MAAlBI,EAAOx4B,EAAI,IAAgC,MAAlBw4B,EAAOx4B,EAAI,IACtCpB,EAAM,IAAKid,YAAY+R,EAAQ,EAAI,IAAM,IAAMhrB,GAC/C5C,KAEApB,EAAM,IAAKid,YAAY+R,EAAQ,EAAI,IAAM,IAAMhrB,GAEjDirB,EAAOD,EAAQ,GAEnB,CAGIC,EAAOD,EAAQ,GACjBwK,KAEF,MAEF,IAAK,SACHx5B,EAAM,GAAI,EACVA,EAAM,GAAIiZ,EACV,MAEF,QACEugB,KAQN,OALItc,MAAMld,EAAM,KAAMkd,MAAMld,EAAM,IAK3BA,CACT,EAMA,SAASspB,GAAQrQ,EAAGD,GAElB,KAAM1Z,gBAAgBgqB,IACpB,OAAO,IAAIA,GAAQrQ,EAAGD,GAGxB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEnB1Z,KAAS,GAAIU,EAAM,GACnBV,KAAS,GAAIU,EAAM,EACrB,CAEAspB,GAAQpnB,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,MAAMglB,EAAM,GAAM5nB,KAAS,GAAGA,KAAS,IAEvC,OAAO,IAAIgqB,GACThqB,KAAS,GAAI4nB,EACb5nB,KAAS,GAAI4nB,EACjB,EAOA,IAAO,SAAUjO,EAAGD,GAElB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEb6gB,EAASv6B,KAAiB,aAC1Bw6B,IAAWlV,SAAS5kB,EAAM,KAAM4kB,SAAS5kB,EAAM,KAErD,OAAI65B,GAAUC,EAERD,GAAUC,EAELxQ,GAAa,IAGfA,GAAkB,SAGpB,IAAIA,GACThqB,KAAS,GAAIU,EAAM,GACnBV,KAAS,GAAIU,EAAM,GACvB,EAOA,IAAO,SAAUiZ,EAAGD,GAElB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEb6gB,EAASv6B,KAAiB,aAC1Bw6B,IAAWlV,SAAS5kB,EAAM,KAAM4kB,SAAS5kB,EAAM,KAErD,OAAI65B,GAAUC,EAERD,GAAUC,EAELxQ,GAAa,IAGfA,GAAkB,SAGpB,IAAIA,GACThqB,KAAS,GAAIU,EAAM,GACnBV,KAAS,GAAIU,EAAM,GACvB,EAOA,IAAO,SAAUiZ,EAAGD,GAElB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEb6gB,EAASv6B,KAAiB,aAC1Bw6B,IAAWlV,SAAS5kB,EAAM,KAAM4kB,SAAS5kB,EAAM,KAC/C+5B,EAAyB,IAAfz6B,KAAS,IAA0B,IAAfA,KAAS,GACvC06B,EAAsB,IAAZh6B,EAAM,IAAuB,IAAZA,EAAM,GAGvC,OAAI65B,GAAUG,GAAWF,GAAUC,EAC1BzQ,GAAa,IAIlBuQ,GAAUC,EACLxQ,GAAkB,SAIX,IAAZtpB,EAAM,IAA0B,IAAfV,KAAS,GACrB,IAAIgqB,GAAQhqB,KAAS,GAAIU,EAAM,GAAG,GAGpC,IAAIspB,GACThqB,KAAS,GAAIU,EAAM,GAAIV,KAAS,GAAIU,EAAM,GAC1CV,KAAS,GAAIU,EAAM,GAAIV,KAAS,GAAIU,EAAM,GAC9C,EAOA,IAAO,SAAUiZ,EAAGD,GAElB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEb6gB,EAASv6B,KAAiB,aAC1Bw6B,IAAWlV,SAAS5kB,EAAM,KAAM4kB,SAAS5kB,EAAM,KAC/C+5B,EAAyB,IAAfz6B,KAAS,IAA0B,IAAfA,KAAS,GACvC06B,EAAsB,IAAZh6B,EAAM,IAAuB,IAAZA,EAAM,GAGvC,GAAI+5B,GAAWC,GAAWH,GAAUC,EAClC,OAAOxQ,GAAa,IAItB,GAAI0Q,GAAWH,EACb,OAAOvQ,GAAkB,SAI3B,GAAIyQ,GAAWD,EACb,OAAOxQ,GAAc,KAGvB,GAAI,IAAMtpB,EAAM,GAEd,OAAO,IAAIspB,GAAQhqB,KAAS,GAAIU,EAAM,GAAGV,KAAS,GAAIU,EAAM,IAG9D,GAAI4M,KAAKsa,IAAIlnB,EAAM,IAAK4M,KAAKsa,IAAIlnB,EAAM,IAAI,CAEzC,MAAMF,EAAIE,EAAM,GAAIA,EAAM,GACpBH,EAAIG,EAAM,GAAIF,EAAIE,EAAM,GAE9B,OAAO,IAAIspB,IACRhqB,KAAS,GAAIQ,EAAIR,KAAS,IAAKO,GAC/BP,KAAS,GAAIQ,EAAIR,KAAS,IAAKO,EAEpC,CAAO,CAEL,MAAMC,EAAIE,EAAM,GAAIA,EAAM,GACpBH,EAAIG,EAAM,GAAIF,EAAIE,EAAM,GAE9B,OAAO,IAAIspB,IACRhqB,KAAS,GAAIA,KAAS,GAAIQ,GAAKD,GAC/BP,KAAS,GAAIA,KAAS,GAAIQ,GAAKD,EACpC,CACF,EAOA,IAAO,SAAUoZ,EAAGD,GAElB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEb+gB,EAAyB,IAAfz6B,KAAS,IAA0B,IAAfA,KAAS,GAG7C,GAF4B,IAAZU,EAAM,IAAuB,IAAZA,EAAM,GAGrC,OAAOspB,GAAa,IAItB,GAAgB,IAAZtpB,EAAM,GAAS,CAEjB,GAAmB,IAAfV,KAAS,IAAWA,KAAS,GAAI,EAEnC,OAAO,IAAIgqB,GAAQ1c,KAAK4M,IAAIla,KAAS,GAAGU,EAAM,IAAI,GAE7C,GAAmB,IAAfV,KAAS,GAElB,QAASU,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAIspB,GAAQ1c,KAAK4M,IAAIla,KAAS,GAAGU,EAAM,IAAI,GACpD,KAAK,EACH,OAAO,IAAIspB,GAAQ,EAAG1c,KAAK4M,IAAIla,KAAS,GAAGU,EAAM,KACnD,KAAK,EACH,OAAO,IAAIspB,IAAS1c,KAAK4M,IAAIla,KAAS,GAAGU,EAAM,IAAI,GACrD,KAAK,EACH,OAAO,IAAIspB,GAAQ,GAAI1c,KAAK4M,IAAIla,KAAS,GAAGU,EAAM,KAG1D,CAqBA,GAAI+5B,GAAW/5B,EAAM,GAAI,EACvB,OAAOspB,GAAc,KAGvB,MAAMha,EAAM1C,KAAKurB,MAAM74B,KAAS,GAAGA,KAAS,IACtC26B,EAAMR,GAASn6B,KAAS,GAAGA,KAAS,IAE1C,IAAI4c,EAAKtP,KAAKkZ,IAAI9lB,EAAM,GAAIi6B,EAAMj6B,EAAM,GAAIsP,GACxC4qB,EAAKl6B,EAAM,GAAIi6B,EAAMj6B,EAAM,GAAIsP,EACnC,OAAO,IAAIga,GACTpN,EAAKtP,KAAK4hB,IAAI0L,GACdhe,EAAKtP,KAAK8mB,IAAIwG,GAClB,EAOA,KAAQ,WAEN,MAAMjhB,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN0Z,EAEF,OAAIC,GAAK,EACA,IAAIqQ,GAAQ1c,KAAK8b,KAAKzP,GAAI,GAE1B,IAAIqQ,GAAQ,EAAG1c,KAAK8b,MAAMzP,IAIrC,MAAMoC,EAAI,GAAMpC,EAAGD,GAEnB,IAAIkD,EAAKtP,KAAK8b,KAAK,IAAOrN,EAAIzO,KAAKsa,IAAIjO,KACnCihB,EAAKttB,KAAKsa,IAAIlO,IAAM,EAAIkD,GAE5B,OAAIjD,GAAK,EACA,IAAIqQ,GAAQpN,EAAIlD,EAAI,GAAKkhB,EAAKA,GAE9B,IAAI5Q,GAAQ4Q,EAAIlhB,EAAI,GAAKkD,EAAKA,EAEzC,EAOA,IAAO,WAEL,MAAMie,EAAKvtB,KAAKkZ,IAAIxmB,KAAS,IAE7B,OAAmB,IAAfA,KAAS,GACJ,IAAIgqB,GAAQ6Q,EAAI,GAElB,IAAI7Q,GACT6Q,EAAKvtB,KAAK4hB,IAAIlvB,KAAS,IACvB66B,EAAKvtB,KAAK8mB,IAAIp0B,KAAS,IAC3B,EAUA,MAAS,WAQP,MAAM2Z,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAO,IAAIgqB,GACT1c,KAAKmZ,MAAM9M,GAAKrM,KAAK4hB,IAAIxV,GAviBjB,SAAUlZ,GAEtB,MAAMkZ,EAAIpM,KAAKme,GAAK,EACpB,IAAK/R,EAAIlZ,GAAKA,EAAIkZ,EAChB,OAAOpM,KAAK4hB,IAAI1uB,GAAK,EAevB,MAAMs6B,EAAKt6B,EAAIA,EACf,OAAOs6B,GACLA,GACEA,GACEA,GACEA,GACEA,GACEA,GACEA,EAAK,cACH,EAAI,aACN,EAAI,WACN,EAAI,SACN,EAAI,OACN,EAAI,KACN,EAAI,IACN,GACN,CAogBoCC,CAAMrhB,GACpCpM,KAAKkZ,IAAI7M,GAAKrM,KAAK8mB,IAAI1a,GAC3B,EAOA,IAAO,WAEL,MAAMC,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAU,IAAN0Z,GAAWC,EAAI,EACV,IAAIqQ,GAAQ1c,KAAK2Y,IAAItM,GAAI,GAG3B,IAAIqQ,GACTmQ,GAASxgB,EAAGD,GACZpM,KAAKurB,MAAMnf,EAAGC,GAClB,EAOA,IAAO,WAEL,OAAO,GAAM3Z,KAAS,GAAGA,KAAS,GACpC,EAOA,IAAO,WAEL,OAAOsN,KAAKurB,MAAM74B,KAAS,GAAGA,KAAS,GACzC,EAOA,IAAO,WAKL,MAAM2Z,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAO,IAAIgqB,GACT1c,KAAK8mB,IAAIza,GAAK,GAAKD,GACnBpM,KAAK4hB,IAAIvV,GAAK,GAAKD,GACvB,EAOA,IAAO,WAKL,MAAMC,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAO,IAAIgqB,GACT1c,KAAK4hB,IAAIvV,GAAK,GAAKD,IAClBpM,KAAK8mB,IAAIza,GAAK,GAAKD,GACxB,EAOA,IAAO,WAOL,MAAMC,EAAI,EAAI3Z,KAAS,GACjB0Z,EAAI,EAAI1Z,KAAS,GACjBa,EAAIyM,KAAK4hB,IAAIvV,GAAK,GAAKD,GAE7B,OAAO,IAAIsQ,GACT1c,KAAK8mB,IAAIza,GAAK9Y,EACd,GAAK6Y,GAAK7Y,EACd,EAOA,IAAO,WAIL,MAAM8Y,EAAI,EAAI3Z,KAAS,GACjB0Z,EAAI,EAAI1Z,KAAS,GACjBa,EAAIyM,KAAK4hB,IAAIvV,GAAK,GAAKD,GAE7B,OAAO,IAAIsQ,IACR1c,KAAK8mB,IAAIza,GAAK9Y,EACf,GAAK6Y,GAAK7Y,EACd,EAOA,IAAO,WAIL,MAAM8Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GACba,EAAI,GAAM,GAAK,EAAI6Y,GAAK,GAAMpM,KAAK4hB,IAAI,EAAIvV,GAEjD,OAAO,IAAIqQ,GACT1c,KAAK4hB,IAAIvV,GAAK,GAAKD,GAAK7Y,EACxByM,KAAK8mB,IAAIza,GAAK,GAAKD,GAAK7Y,EAC5B,EAOA,IAAO,WAIL,MAAM8Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GACba,EAAI,GAAM,GAAK,EAAI6Y,GAAK,GAAMpM,KAAK4hB,IAAI,EAAIvV,GAEjD,OAAO,IAAIqQ,GACT1c,KAAK8mB,IAAIza,GAAK,GAAKD,GAAK7Y,GACvByM,KAAK4hB,IAAIvV,GAAK,GAAKD,GAAK7Y,EAC7B,EAOA,KAAQ,WAIN,MAAM8Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEb4K,EAAK,IAAIof,GACbtQ,EAAIA,EAAIC,EAAIA,EAAI,GACf,EAAIA,EAAID,GAAS,OAEd7O,EAAK,IAAImf,GACbpf,EAAO,GAAI8O,EACX9O,EAAO,GAAI+O,GAAQ,MAErB,OAAO,IAAIqQ,GAAQnf,EAAO,IAAIA,EAAO,GACvC,EAOA,KAAQ,WAIN,MAAM8O,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEb4K,EAAK,IAAIof,GACbtQ,EAAIA,EAAIC,EAAIA,EAAI,GACf,EAAIA,EAAID,GAAS,OAEd7O,EAAK,IAAImf,GACbpf,EAAO,GAAI8O,EACX9O,EAAO,GAAI+O,GAAQ,MAErB,OAAO,IAAIqQ,GAAQ1c,KAAKme,GAAK,EAAI5gB,EAAO,GAAGA,EAAO,GACpD,EAOA,KAAQ,WAIN,MAAM8O,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN2Z,EAAS,CAEX,GAAU,IAAND,EACF,OAAO,IAAIsQ,GAAQ,EAAG3c,KAGxB,IAAW,IAAPqM,EACF,OAAO,IAAIsQ,GAAQ,GAAG,IAE1B,CAEA,MAAMnpB,EAAI8Y,EAAIA,GAAK,EAAMD,IAAM,EAAMA,GAE/B9O,EAAK,IAAIof,IACZ,EAAItQ,EAAIA,EAAIC,EAAIA,GAAK9Y,GACrB,EAAI8Y,EAAI9Y,GAAGolB,MAEd,OAAO,IAAI+D,IAAS,GAAMpf,EAAO,GAAG,GAAMA,EAAO,GACnD,EAOA,KAAQ,WAIN,MAAM+O,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN0Z,EACF,OAAO,IAAIsQ,GAAQ1c,KAAKurB,MAAM,EAAGlf,GAAI,GAGvC,MAAM9Y,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAGgxB,OACR,IAAI7H,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAGmY,MAC9B,EAOA,KAAQ,WAIN,MAAMlY,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN2Z,GAAiB,IAAND,EACb,OAAO,IAAIsQ,GAAQ,EAAG3c,KAGxB,MAAMxM,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAG6wB,OACR,IAAI1H,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAGgY,MAC9B,EAOA,KAAQ,WAIN,MAAM/X,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN2Z,GAAiB,IAAND,EACb,OAAO,IAAIsQ,GAAQ1c,KAAKme,GAAK,EAAGpe,KAGlC,MAAMxM,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAGyxB,OACR,IAAItI,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAG4Y,MAC9B,EAOA,KAAQ,WAIN,MAAM3Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAO,IAAIgqB,GACT,GAAKrQ,GAAKrM,KAAK4hB,IAAIxV,GACnB,GAAKC,GAAKrM,KAAK8mB,IAAI1a,GACvB,EAOA,KAAQ,WAIN,MAAMC,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,OAAO,IAAIgqB,GACT,GAAKrQ,GAAKrM,KAAK4hB,IAAIxV,GACnB,GAAKC,GAAKrM,KAAK8mB,IAAI1a,GACvB,EAOA,KAAQ,WAIN,MAAMC,EAAI,EAAI3Z,KAAS,GACjB0Z,EAAI,EAAI1Z,KAAS,GACjBa,EAAI,GAAK8Y,GAAKrM,KAAK4hB,IAAIxV,GAE7B,OAAO,IAAIsQ,GACT,GAAKrQ,GAAK9Y,EACVyM,KAAK8mB,IAAI1a,GAAK7Y,EAClB,EAOA,KAAQ,WAIN,MAAM8Y,EAAI,EAAI3Z,KAAS,GACjB0Z,EAAI,EAAI1Z,KAAS,GACjBa,EAAI,GAAK8Y,GAAKrM,KAAK4hB,IAAIxV,GAE7B,OAAO,IAAIsQ,GACT,GAAKrQ,GAAK9Y,GACTyM,KAAK8mB,IAAI1a,GAAK7Y,EACnB,EAOA,KAAQ,WAIN,MAAM8Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GACba,EAAIyM,KAAK4hB,IAAI,EAAIxV,GAAK,GAAK,EAAIC,GAErC,OAAO,IAAIqQ,IACR,EAAI,GAAKrQ,GAAKrM,KAAK4hB,IAAIxV,GAAK7Y,EAC7B,EAAI,GAAK8Y,GAAKrM,KAAK8mB,IAAI1a,GAAK7Y,EAChC,EAOA,KAAQ,WAIN,MAAM8Y,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GACba,EAAIyM,KAAK4hB,IAAI,EAAIxV,GAAK,GAAK,EAAIC,GAErC,OAAO,IAAIqQ,GACT,EAAI,GAAKrQ,GAAKrM,KAAK4hB,IAAIxV,GAAK7Y,GAC3B,EAAI,GAAK8Y,GAAKrM,KAAK8mB,IAAI1a,GAAK7Y,EACjC,EAOA,MAAS,WAIP,IAAIm6B,EAAMh7B,KAAS,GACnBA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIg7B,EACb,MAAMC,EAAMj7B,KAAW,OAQvB,OANAA,KAAS,IAAKA,KAAS,GACvBA,KAAS,GAAIg7B,EACbA,EAAMC,EAAQ,GAEdA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAID,EACLC,CACT,EAOA,MAAS,WAIP,MAAMA,EAAMj7B,KAAW,OACvB,GAAIi7B,EAAQ,IAAK,EAAG,CAClB,MAAMD,EAAMC,EAAQ,GACpBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAID,CACd,KAAO,CACL,MAAMA,EAAMC,EAAQ,GACpBA,EAAQ,IAAKA,EAAQ,GACrBA,EAAQ,GAAID,CACd,CACA,OAAOC,CACT,EAOA,MAAS,WAIP,MAAMthB,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEbk7B,EAAOvhB,EAAI,GAAW,IAAND,EAChByhB,EAAW,EAAIxhB,EACfyhB,EAAU,EAAIzhB,EACd9Y,EAAIs6B,EAAWA,EAAWzhB,EAAIA,EAE9BlZ,EAAW,IAANK,EACP,IAAImpB,IACHoR,EAAUD,EAAWzhB,EAAIA,GAAK7Y,GAC9B6Y,EAAIyhB,EAAWC,EAAU1hB,GAAK7Y,GAC/B,IAAImpB,IACI,IAAPrQ,EAAaA,EAAI,EAAK,EAChB,IAAND,EAAYA,EAAI,EAAK,GAEpByc,EAAO31B,EAAM,GAMnB,OALAA,EAAM,GAAI25B,GAAS35B,EAAM,GAAGA,EAAM,IAAK,EACvCA,EAAM,GAAI8M,KAAKurB,MAAMr4B,EAAM,GAAG21B,GAAQ,EAClC+E,IACF16B,EAAM,IAAKA,EAAM,IAEZA,CACT,EAOA,MAAS,WAIP,MAAMmZ,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN2Z,GAAiB,IAAND,EACb,OAAO,IAAIsQ,GAAQ,EAAG1c,KAAKme,GAAK,GAGlC,MAAM5qB,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAGyoB,QACR,IAAIU,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAG4P,OAC9B,EAOA,MAAS,WAIP,MAAM3P,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAU,IAAN0Z,EAEF,OAAO,IAAIsQ,GACF,IAANrQ,EACGrM,KAAK2Y,IAAItM,EAAIrM,KAAK8b,KAAKzP,EAAIA,EAAI,IAC/BtM,IAAU,GAGlB,MAAMxM,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAGwoB,QACR,IAAIW,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAG2P,OAC9B,EAOA,MAAS,WAIP,MAAM1P,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEnB,GAAIA,KAAa,SACf,OAAOgqB,GAAkB,SAG3B,MAAMnpB,EAAI8Y,EAAIA,EAAID,EAAIA,EACtB,OAAc,IAAN7Y,EACJ,IAAImpB,GACJrQ,EAAI9Y,GACH6Y,EAAI7Y,GAAGsoB,QACR,IAAIa,GACG,IAANrQ,EAAWA,EAAI,EAAI,EACb,IAAND,GAAYA,EAAI,EAAI,GAAGyP,OAC9B,EAOA,QAAW,WAGT,GAAInpB,KAAa,SACf,OAAOgqB,GAAkB,SAG3B,GAAIhqB,KAAiB,aACnB,OAAOgqB,GAAc,KAGvB,MAAMrQ,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GAEba,EAAI8Y,EAAIA,EAAID,EAAIA,EAEtB,OAAO,IAAIsQ,GAAQrQ,EAAI9Y,GAAI6Y,EAAI7Y,EACjC,EAOA,UAAa,WAEX,OAAO,IAAImpB,GAAQhqB,KAAS,IAAIA,KAAS,GAC3C,EAOA,IAAO,WAEL,OAAO,IAAIgqB,IAAShqB,KAAS,IAAIA,KAAS,GAC5C,EAOA,KAAQ,SAAUq7B,GAIhB,OAFAA,EAAS/tB,KAAK4M,IAAI,GAAImhB,GAAU,GAEzB,IAAIrR,GACT1c,KAAKogB,KAAK1tB,KAAS,GAAIq7B,GAAUA,EACjC/tB,KAAKogB,KAAK1tB,KAAS,GAAIq7B,GAAUA,EACrC,EAOA,MAAS,SAAUA,GAIjB,OAFAA,EAAS/tB,KAAK4M,IAAI,GAAImhB,GAAU,GAEzB,IAAIrR,GACT1c,KAAKsM,MAAM5Z,KAAS,GAAIq7B,GAAUA,EAClC/tB,KAAKsM,MAAM5Z,KAAS,GAAIq7B,GAAUA,EACtC,EAOA,MAAS,SAAUA,GAIjB,OAFAA,EAAS/tB,KAAK4M,IAAI,GAAImhB,GAAU,GAEzB,IAAIrR,GACT1c,KAAKiY,MAAMvlB,KAAS,GAAIq7B,GAAUA,EAClC/tB,KAAKiY,MAAMvlB,KAAS,GAAIq7B,GAAUA,EACtC,EASA,OAAU,SAAU1hB,EAAGD,GAErB,MAAMhZ,EAAI6c,GAAM5D,EAAGD,GAEnB,OAAOpM,KAAKsa,IAAIlnB,EAAM,GAAIV,KAAS,KAAMgqB,GAAiB,SACxD1c,KAAKsa,IAAIlnB,EAAM,GAAIV,KAAS,KAAMgqB,GAAiB,OACvD,EAOA,MAAS,WAEP,OAAO,IAAIA,GAAQhqB,KAAS,GAAGA,KAAS,GAC1C,EAOA,SAAY,WAEV,IAAI2Z,EAAI3Z,KAAS,GACb0Z,EAAI1Z,KAAS,GACbs7B,EAAM,GAEV,OAAIt7B,KAAY,QACP,MAGLA,KAAiB,aACZ,YAGLsN,KAAKsa,IAAIjO,GAAKqQ,GAAiB,UACjCrQ,EAAI,GAGFrM,KAAKsa,IAAIlO,GAAKsQ,GAAiB,UACjCtQ,EAAI,GAII,IAANA,EACK4hB,EAAM3hB,GAGL,IAANA,GACF2hB,GAAO3hB,EACP2hB,GAAO,IACH5hB,EAAI,GACNA,GAAKA,EACL4hB,GAAO,KAEPA,GAAO,IAETA,GAAO,KACE5hB,EAAI,IACbA,GAAKA,EACL4hB,GAAO,KAGL,IAAM5hB,IACR4hB,GAAO5hB,GAEF4hB,EAAM,KACf,EAOA,SAAY,WAEV,MAAO,CAACt7B,KAAS,GAAGA,KAAS,GAC/B,EAOA,QAAW,WAET,OAAmB,IAAfA,KAAS,GACJA,KAAS,GAEX,IACT,EAOA,MAAS,WACP,OAAO4d,MAAM5d,KAAS,KAAM4d,MAAM5d,KAAS,GAC7C,EAQA,OAAU,WACR,OAAsB,IAAfA,KAAS,IAA0B,IAAfA,KAAS,EACtC,EAQA,SAAY,WACV,OAAOslB,SAAStlB,KAAS,KAAMslB,SAAStlB,KAAS,GACnD,EAQA,WAAc,WACZ,OAAQA,KAAe,UACzB,GAGFgqB,GAAc,KAAI,IAAIA,GAAQ,EAAG,GACjCA,GAAa,IAAI,IAAIA,GAAQ,EAAG,GAChCA,GAAW,EAAI,IAAIA,GAAQ,EAAG,GAC9BA,GAAY,GAAI,IAAIA,GAAQ1c,KAAKme,GAAI,GACrCzB,GAAW,EAAI,IAAIA,GAAQ1c,KAAKuL,EAAG,GACnCmR,GAAkB,SAAI,IAAIA,GAAQ3c,IAAUA,KAC5C2c,GAAa,IAAI,IAAIA,GAAQuE,IAAKA,KAClCvE,GAAiB,QAAI,MC13CrB,MAGauR,GAAqC57B,GAHrC,UACQ,IAEyD,KAI5E2C,OAAOwT,eAAekU,GAAS,OAAQ,CAAExiB,MAAO,YAChDwiB,GAAQpnB,UAAUyC,YAAc2kB,GAChCA,GAAQpnB,UAAUyD,KAAO,UACzB2jB,GAAQpnB,UAAUme,WAAY,EAO9BiJ,GAAQpnB,UAAUmoB,OAAS,WACzB,MAAO,CACLC,OAAQ,UACRpO,GAAI5c,KAAK4c,GACTge,GAAI56B,KAAK46B,GAEb,EAOA5Q,GAAQpnB,UAAU44B,QAAU,WAC1B,MAAO,CACLzf,EAAG/b,KAAK4nB,MACR6T,IAAKz7B,KAAKgQ,MAEd,EAWAga,GAAQpnB,UAAUkkB,OAAS,SAAU9e,GACnC,IAAI5E,EAAM,GACNw3B,EAAK56B,KAAK46B,GACVhe,EAAK5c,KAAK4c,GACd,MAAM8e,EAAQ5U,GAAO9mB,KAAK4c,GAAI5U,GACxB2zB,EAAQ7U,GAAO9mB,KAAK46B,GAAI5yB,GAGxBgf,EAAYrG,EAAS3Y,GAAWA,EAAUA,EAAUA,EAAQgf,UAAY,KAC9E,GAAkB,OAAdA,EAAoB,CACtB,MAAM4U,EAAUtuB,KAAK4M,IAAI,IAAK8M,GAC1B1Z,KAAKsa,IAAIhL,EAAKge,GAAMgB,IACtBhf,EAAK,GAEHtP,KAAKsa,IAAIgT,EAAKhe,GAAMgf,IACtBhB,EAAK,EAET,CA8BA,OA1BEx3B,EAFS,IAAPw3B,EAEIc,EACU,IAAP9e,EAEE,IAAPge,EACI,KACW,IAARA,EACH,KAEAe,EAAQ,IAIZf,EAAK,GACK,IAARA,EACIc,EAAQ,OAERA,EAAQ,MAAQC,EAAMtD,UAAU,GAAK,IAGlC,IAAPuC,EACIc,EAAQ,OAERA,EAAQ,MAAQC,EAAQ,IAI7Bv4B,CACT,EAaA4mB,GAAQ6R,UAAY,SAAUvvB,GAC5B,OAAQ7J,UAAU1B,QAChB,KAAK,EACL,CACE,MAAMiP,EAAMvN,UAAU,GACtB,GAAmB,iBAARuN,EACT,OAAOga,GAAQha,GAEf,MAAM,IAAItJ,UAAU,iDAExB,CACA,KAAK,EACL,CACE,MAAMqV,EAAItZ,UAAU,GACpB,IAAIg5B,EAAMh5B,UAAU,GACpB,GAAIke,EAAS5E,GAAI,CAMf,GALIkF,EAAOwa,IAAQA,EAAIK,QAAQ,WAE7BL,EAAMA,EAAIhT,SAAS,QAGjB9H,EAAS8a,GACX,OAAO,IAAIzR,GAAQ,CAAEjO,IAAG0f,QAG1B,MAAM,IAAI/0B,UAAU,yCACtB,CACE,MAAM,IAAIA,UAAU,4BAExB,CAEA,QACE,MAAM,IAAIgF,YAAY,mDAE5B,EAEAse,GAAQpnB,UAAU4c,QAAUwK,GAAQpnB,UAAUgQ,SAU9CoX,GAAQiB,SAAW,SAAUC,GAC3B,OAAO,IAAIlB,GAAQkB,EACrB,EAiBAlB,GAAQoM,QAAU,SAAUzc,EAAGD,GAC7B,OAAIC,EAAEiD,GAAKlD,EAAEkD,GAAa,EACtBjD,EAAEiD,GAAKlD,EAAEkD,IAAc,EAEvBjD,EAAEihB,GAAKlhB,EAAEkhB,GAAa,EACtBjhB,EAAEihB,GAAKlhB,EAAEkhB,IAAc,EAEpB,CACT,EAEO5Q,KACN,CAAEmB,SAAS,IC5JQ,oBAAXvF,SAAwBA,OAAS,SAAUvhB,GAAK,GAAIuZ,MAAMvZ,GAAI,MAAM,IAAIgS,MAAM,IAAK,OAAOhS,CAAG,GAExG,MAAM03B,GAASnW,OAAO,GAChBoW,GAAQpW,OAAO,GACfqW,GAAQrW,OAAO,GACfsW,GAAStW,OAAO,GAChBuW,GAAQvW,OAAO,IAQf,GAAI,CACR,EAAKoW,GACL,EAAKD,GACL,EAAKC,IAGP,SAAS,GAAO33B,EAAG4F,GAEjB,IACE5F,EAAIuhB,OAAOvhB,EACb,CAAE,MAAO2U,GACP,MAAMojB,IACR,CACA,OAAO/3B,EAAI4F,CACb,CAEA,SAAS,GAAMzJ,GACb,MAAoB,iBAANA,EAAiBA,EAAI8M,KAAKsM,MAAMpZ,EAChD,CAGA,SAAS67B,GAAYh4B,EAAGxD,GAEtB,GAAIA,IAAMk7B,GACR,MAAMO,KAGR,MAAMp7B,EAAIoB,OAAO6C,OAAO+kB,GAAStnB,WACjC1B,EAAK,EAAImD,EAAI03B,IAAUC,GAAQA,GAI/B,MAAMriB,EAAI4iB,GAFVl4B,EAAIA,EAAI03B,IAAU13B,EAAIA,EAELxD,GAIjB,OAFAK,EAAK,EAAImD,EAAIsV,EACbzY,EAAK,EAAIL,EAAI8Y,EACNzY,CACT,CAEA,SAASs7B,GAAUlJ,GAEjB,MAAMmJ,EAAU,CAAC,EAEjB,IAAIp4B,EAAIivB,EACJxxB,EAAIm6B,GACJhyB,EAAIiyB,GAASF,GAEjB,KAAO/xB,GAAK5F,GAAG,CAEb,KAAOA,EAAIvC,IAAMi6B,IACf13B,GAAKvC,EACL26B,EAAQ36B,IAAM26B,EAAQ36B,IAAMi6B,IAAUC,GAExC/xB,GAAK+xB,GAAQC,GAAQn6B,GACvB,CAQA,OANIuC,IAAMivB,EACJjvB,EAAI,IACNo4B,EAAQp4B,IAAMo4B,EAAQp4B,IAAM03B,IAAUC,IAExCS,EAAQnJ,IAAQmJ,EAAQnJ,IAAQyI,IAAUC,GAErCS,CACT,CAEA,MAAM,GAAQ,SAAUC,EAAIC,GAE1B,IAAIt4B,EAAI03B,GAAQl7B,EAAIm7B,GAAO/xB,EAAI+xB,GAE/B,GAAIU,cAEG,QAAWp5B,IAAPq5B,EAAkB,CAE3B,GAAkB,iBAAPD,EACTr4B,EAAIq4B,MACC,IAAI9e,MAAM8e,GACf,MAAMN,KACD,GAAIM,EAAK,GAAM,EACpB,MAAME,KAENv4B,EAAIuhB,OAAO8W,EACb,CAEA,GAAkB,iBAAPC,EACT97B,EAAI87B,MACC,IAAI/e,MAAM+e,GACf,MAAMP,KACD,GAAIO,EAAK,GAAM,EACpB,MAAMC,KAEN/7B,EAAI+kB,OAAO+W,EACb,CAEA1yB,EAAI5F,EAAIxD,CAEV,MAAO,GAAkB,iBAAP67B,EAAiB,CACjC,GAAI,MAAOA,GAAM,MAAOA,EACtBr4B,EAAIuhB,OAAO8W,EAAM,GACjB77B,EAAI+kB,OAAO8W,EAAM,GACb,MAAOA,IACTr4B,GAAKuhB,OAAO8W,EAAM,SACf,GAAI,KAAKA,EACdr4B,EAAIuhB,OAAO8W,EAAG,IACV,KAAKA,IACP77B,EAAI+kB,OAAO8W,EAAG,SACX,IAAkB,iBAAPA,EAGhB,MAAMN,KAFN/3B,EAAIq4B,CAGN,CACAzyB,EAAI5F,EAAIxD,CACV,MAAO,GAAkB,iBAAP67B,EAAiB,CAEjC,GAAI9e,MAAM8e,GACR,MAAMN,KAQR,GALIM,EAAK,IACPzyB,GAAK+xB,GACLU,GAAMA,GAGJA,EAAK,GAAM,EACbr4B,EAAIuhB,OAAO8W,OACN,CAEL,IAAIh8B,EAAI,EAEJm8B,EAAI,EAAGC,EAAI,EACXC,EAAI,EAAGC,EAAI,EAEXC,EAAI,IASR,IAPIP,GAAM,IACRh8B,EAAI,IAAM4M,KAAKsM,MAAM,EAAItM,KAAK6Y,MAAMuW,IACpCA,GAAMh8B,GAKDo8B,GAAKG,GAAKD,GAAKC,GAAG,CACvB,IAAIC,GAAKL,EAAIE,IAAMD,EAAIE,GAEvB,GAAIN,IAAOQ,EAAG,CACRJ,EAAIE,GAAKC,GACX54B,EAAIw4B,EAAIE,EACRl8B,EAAIi8B,EAAIE,GACCA,EAAIF,GACbz4B,EAAI04B,EACJl8B,EAAIm8B,IAEJ34B,EAAIw4B,EACJh8B,EAAIi8B,GAEN,KAEF,CAEMJ,EAAKQ,GACPL,GAAKE,EACLD,GAAKE,IAELD,GAAKF,EACLG,GAAKF,GAGHA,EAAIG,GACN54B,EAAI04B,EACJl8B,EAAIm8B,IAEJ34B,EAAIw4B,EACJh8B,EAAIi8B,EAGV,CACAz4B,EAAIuhB,OAAOvhB,GAAKuhB,OAAOllB,GACvBG,EAAI+kB,OAAO/kB,EACb,CAEF,MAAO,GAAkB,iBAAP67B,EAAiB,CAEjC,IAAIS,EAAM,EAENv8B,EAAIm7B,GAAQp7B,EAAIo7B,GAAQv7B,EAAIu7B,GAAQt7B,EAAIu7B,GAAOt7B,EAAIs7B,GAEnDxzB,EAAQk0B,EAAGxf,QAAQ,KAAM,IAAI1U,MAAM,UAEvC,GAAc,OAAVA,EACF,MAAM4zB,KA2CR,GAzCmB,MAAf5zB,EAAM20B,IACRlzB,GAAK+xB,GACLmB,KACwB,MAAf30B,EAAM20B,IACfA,IAGE30B,EAAMzH,SAAWo8B,EAAM,EACzBx8B,EAAI,GAAO6H,EAAM20B,KAAQlzB,GACG,MAAnBzB,EAAM20B,EAAM,IAA6B,MAAf30B,EAAM20B,IAEtB,MAAf30B,EAAM20B,KACRv8B,EAAI,GAAO4H,EAAM20B,KAAQlzB,IAE3BkzB,KAGIA,EAAM,IAAM30B,EAAMzH,QAA6B,MAAnByH,EAAM20B,EAAM,IAAiC,MAAnB30B,EAAM20B,EAAM,IAAiC,MAAnB30B,EAAM20B,EAAM,IAAiC,MAAnB30B,EAAM20B,EAAM,MACxHx8B,EAAI,GAAO6H,EAAM20B,GAAMlzB,GACvBxJ,EAAI07B,IAASvW,OAAOpd,EAAM20B,GAAKp8B,QAC/Bo8B,MAIiB,MAAf30B,EAAM20B,IAAmC,MAAnB30B,EAAM20B,EAAM,IAA6B,MAAf30B,EAAM20B,IAAmC,MAAnB30B,EAAM20B,EAAM,MACpF38B,EAAI,GAAOgI,EAAM20B,EAAM,GAAIlzB,GAC3BvJ,EAAIy7B,IAASvW,OAAOpd,EAAM20B,EAAM,GAAGp8B,QAAUi7B,GAC7CmB,GAAO,IAGmB,MAAnB30B,EAAM20B,EAAM,IAAiC,MAAnB30B,EAAM20B,EAAM,IAC/Cx8B,EAAI,GAAO6H,EAAM20B,GAAMlzB,GACvBxJ,EAAI,GAAO+H,EAAM20B,EAAM,GAAInB,IAC3BmB,GAAO,GACqB,MAAnB30B,EAAM20B,EAAM,IAAiC,MAAnB30B,EAAM20B,EAAM,KAC/Cv8B,EAAI,GAAO4H,EAAM20B,GAAMlzB,GACvBtJ,EAAI,GAAO6H,EAAM20B,EAAM,GAAIlzB,GAC3BxJ,EAAI,GAAO+H,EAAM20B,EAAM,GAAInB,IAC3BmB,GAAO,KAGL30B,EAAMzH,QAAUo8B,GAKlB,MAAMf,KAJNv7B,EAAIJ,EAAIC,EACRuJ,EACE5F,EAAI7D,EAAIK,EAAID,EAAIF,EAAIC,CAK1B,KAAO,IAAkB,iBAAP+7B,EAKhB,MAAMN,KAJN/3B,EAAIq4B,EACJzyB,EAAIyyB,EACJ77B,EAAIm7B,EAGN,CAEA,GAAIn7B,IAAMk7B,GACR,MAAMO,KAGR,GAAK,EAAIryB,EAAI8xB,IAAUC,GAAQA,GAC/B,GAAK,EAAI33B,EAAI03B,IAAU13B,EAAIA,EAC3B,GAAK,EAAIxD,EAAIk7B,IAAUl7B,EAAIA,CAC7B,EA6DA,SAAS07B,GAAI5iB,EAAGD,GAEd,IAAKC,EACH,OAAOD,EACT,IAAKA,EACH,OAAOC,EAET,OAAU,CAER,KADAA,GAAKD,GAEH,OAAOA,EAET,KADAA,GAAKC,GAEH,OAAOA,CACX,CACF,CASA,SAASuQ,GAASvQ,EAAGD,GAInB,GAFA,GAAMC,EAAGD,KAEL1Z,gBAAgBkqB,IAMlB,OAAOmS,GAAY,GAAK,EAAI,GAAK,EAAG,GAAK,GALzC1iB,EAAI4iB,GAAI,GAAK,EAAG,GAAK,GACrBv8B,KAAQ,EAAI,GAAK,EACjBA,KAAQ,EAAI,GAAK,EAAI2Z,EACrB3Z,KAAQ,EAAI,GAAK,EAAI2Z,CAIzB,CAEA,IAAI2iB,GAAiB,WAAc,OAAO,IAAIjmB,MAAM,mBAAqB,EACrE+lB,GAAmB,WAAc,OAAO,IAAI/lB,MAAM,mBAAqB,EACvEumB,GAAsB,WAAc,OAAO,IAAIvmB,MAAM,6BAA+B,EAExF6T,GAAStnB,UAAY,CAEnB,EAAKo5B,GACL,EAAKD,GACL,EAAKC,GAOL,IAAO,WAEL,OAAOK,GAAYr8B,KAAQ,EAAGA,KAAQ,EACxC,EAOA,IAAO,WAEL,OAAOq8B,IAAar8B,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,EACrD,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF2iB,GACLr8B,KAAQ,EAAIA,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAIA,KAAQ,EAAI,GAAK,EAC3DA,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF2iB,GACLr8B,KAAQ,EAAIA,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAIA,KAAQ,EAAI,GAAK,EAC3DA,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF2iB,GACLr8B,KAAQ,EAAI,GAAK,EAAIA,KAAQ,EAAI,GAAK,EACtCA,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF2iB,GACLr8B,KAAQ,EAAI,GAAK,EAAIA,KAAQ,EAAI,GAAK,EACtCA,KAAQ,EAAI,GAAK,EAErB,EAOA,MAAS,WACP,OAAOq8B,GAAYr8B,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,EACpD,EAQA,IAAO,SAAU2Z,EAAGD,GAElB,QAAUpW,IAANqW,EACF,OAAO0iB,GAAYr8B,KAAQ,EAAIA,KAAQ,EAAIA,KAAQ,EAAGg8B,IAIxD,GADA,GAAMriB,EAAGD,GACLqiB,KAAW,GAAK,EAAI/7B,KAAQ,EAC9B,MAAMs8B,KAcR,OAAOD,GACLr8B,KAAQ,GAAK,GAAK,EAAIA,KAAQ,IAAM,GAAK,EAAIA,KAAQ,GACrD,GAAK,EAAIA,KAAQ,EACrB,EAOA,IAAO,SAAU2Z,EAAGD,GAOlB,OALA,GAAMC,EAAGD,GAKF2iB,GAAYE,GAAI,GAAK,EAAGv8B,KAAQ,GAAKu8B,GAAI,GAAK,EAAGv8B,KAAQ,GAAI,GAAK,EAAIA,KAAQ,EACvF,EAOA,IAAO,SAAU2Z,EAAGD,GAOlB,OALA,GAAMC,EAAGD,GAKL,GAAK,IAAMqiB,IAAU/7B,KAAQ,IAAM+7B,GAC9BM,GAAYN,GAAQC,IAEtBK,GAAY,GAAK,EAAIr8B,KAAQ,EAAGu8B,GAAI,GAAK,EAAGv8B,KAAQ,GAAKu8B,GAAI,GAAK,EAAGv8B,KAAQ,GACtF,EAOA,QAAW,WACT,OAAOq8B,GAAYr8B,KAAQ,EAAIA,KAAQ,EAAGA,KAAQ,EACpD,EAOA,IAAO,SAAU2Z,EAAGD,GAMlB,GAJA,GAAMC,EAAGD,GAIL,GAAK,IAAMsiB,GAEb,OAAI,GAAK,EAAID,GACJM,IAAar8B,KAAQ,EAAIA,KAAQ,IAAM,GAAK,EAAGA,KAAQ,GAAK,GAAK,GAEjEq8B,IAAar8B,KAAQ,EAAIA,KAAQ,IAAM,GAAK,EAAGA,KAAQ,GAAK,GAAK,GAU5E,GAAIA,KAAQ,EAAI+7B,GAAQ,OAAO,KAG/B,IAAIkB,EAAIT,GAAUx8B,KAAQ,GACtBg9B,EAAIR,GAAUx8B,KAAQ,GAGtBqE,EAAI23B,GACJn7B,EAAIm7B,GACR,IAAK,IAAIl7B,KAAKm8B,EACZ,GAAU,MAANn8B,EAAJ,CACA,GAAU,MAANA,EAAW,CACbuD,EAAI03B,GACJ,KACF,CAGA,GAFAkB,EAAEn8B,IAAM,GAAK,EAETm8B,EAAEn8B,GAAK,GAAK,IAAMi7B,GAEf,OAAO,KADZkB,EAAEn8B,IAAM,GAAK,EAEfuD,GAAKuhB,OAAO9kB,IAAMm8B,EAAEn8B,EAVG,CAazB,IAAK,IAAIA,KAAKk8B,EACZ,GAAU,MAANl8B,EAAJ,CAGA,GAFAk8B,EAAEl8B,IAAM,GAAK,EAETk8B,EAAEl8B,GAAK,GAAK,IAAMi7B,GAEf,OAAO,KADZiB,EAAEl8B,IAAM,GAAK,EAEfD,GAAK+kB,OAAO9kB,IAAMk8B,EAAEl8B,EANG,CASzB,OAAI,GAAK,EAAIi7B,GACJM,GAAYx7B,EAAGwD,GAEjBg4B,GAAYh4B,EAAGxD,EACxB,EAOA,IAAO,SAAU8Y,EAAGD,GAIlB,GAFA,GAAMC,EAAGD,GAEL1Z,KAAQ,GAAK+7B,IAAU,GAAK,GAAKA,GAAQ,OAAO,KAEpD,MAAMqB,EAAY,CAAC,EAEbC,EAAcb,GAAU,GAAK,GAC7Bc,EAAKd,GAAU,GAAK,GAEpBe,EAAgBf,GAAUx8B,KAAQ,GAClCw9B,EAAKhB,GAAUx8B,KAAQ,GAE7B,IAAK,MAAMy9B,KAASH,EAClBD,EAAYI,IAAUJ,EAAYI,IAAU1B,IAAUuB,EAAGG,GAE3D,IAAK,MAAMA,KAASD,EAClBD,EAAcE,IAAUF,EAAcE,IAAU1B,IAAUyB,EAAGC,GAG/D,IAAK,MAAMA,KAASJ,EACJ,MAAVI,IACJL,EAAUK,IAAS,GAErB,IAAK,MAAMA,KAASF,EACJ,MAAVE,IACJL,EAAUK,IAAS,GAGrB,IAAIC,EAAO,KACPC,EAAO,KAGX,IAAK,MAAMF,KAASL,EAAW,CAE7B,MAAMQ,EAAeP,EAAYI,IAAU1B,GACrC8B,EAAiBN,EAAcE,IAAU1B,GAE/C,GAAI6B,IAAiB7B,GAAQ,CAC3B,GAAI8B,IAAmB9B,GACrB,OAAO,KAET,QACF,CAGA,IAAI+B,EAAOD,EACPE,EAAOH,EAGX,MAAMI,EAAWzB,GAAIuB,EAAMC,GAK3B,GAJAD,GAAQE,EACRD,GAAQC,EAGK,OAATN,GAA0B,OAATC,EACnBD,EAAOI,EACPH,EAAOI,OACF,GAAID,EAAOH,GAASD,EAAOK,EAChC,OAAO,IAEX,CAEA,OAAgB,OAATL,GAA0B,OAATC,EACpBtB,GAAYqB,EAAMC,GAClB,IACN,EAOA,OAAU,SAAUhkB,EAAGD,GAGrB,OADA,GAAMC,EAAGD,GACF1Z,KAAQ,EAAIA,KAAQ,EAAI,GAAK,GAAM,GAAK,EAAI,GAAK,EAAIA,KAAQ,CACtE,EAOA,GAAM,SAAU2Z,EAAGD,GAGjB,OADA,GAAMC,EAAGD,GACF1Z,KAAQ,EAAIA,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAIA,KAAQ,CACpE,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF1Z,KAAQ,EAAIA,KAAQ,EAAI,GAAK,GAAK,GAAK,EAAI,GAAK,EAAIA,KAAQ,CACrE,EAOA,GAAM,SAAU2Z,EAAGD,GAGjB,OADA,GAAMC,EAAGD,GACF1Z,KAAQ,EAAIA,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAIA,KAAQ,CACpE,EAOA,IAAO,SAAU2Z,EAAGD,GAGlB,OADA,GAAMC,EAAGD,GACF1Z,KAAQ,EAAIA,KAAQ,EAAI,GAAK,GAAK,GAAK,EAAI,GAAK,EAAIA,KAAQ,CACrE,EAUA,QAAW,SAAU2Z,EAAGD,GAEtB,GAAMC,EAAGD,GACT,IAAInZ,EAAIP,KAAQ,EAAIA,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAIA,KAAQ,EAEnE,OAAQ+7B,GAASx7B,IAAMA,EAAIw7B,GAC7B,EAOA,KAAQ,SAAUV,GAIhB,OAFAA,EAASc,IAASvW,OAAOyV,GAAU,GAE5BgB,GAAY,GAAMr8B,KAAQ,EAAIq7B,EAASr7B,KAAQ,EAAIA,KAAQ,IAC/Dq7B,EAASr7B,KAAQ,EAAIA,KAAQ,EAAI+7B,IAAU/7B,KAAQ,GAAK+7B,GAASC,GAAQD,IAC1EV,EACJ,EAOA,MAAS,SAAUA,GAIjB,OAFAA,EAASc,IAASvW,OAAOyV,GAAU,GAE5BgB,GAAY,GAAMr8B,KAAQ,EAAIq7B,EAASr7B,KAAQ,EAAIA,KAAQ,IAC/Dq7B,EAASr7B,KAAQ,EAAIA,KAAQ,EAAI+7B,IAAU/7B,KAAQ,EAAI+7B,GAASC,GAAQD,IACzEV,EACJ,EAOA,MAAS,SAAUA,GAmBjB,OAjBAA,EAASc,IAASvW,OAAOyV,GAAU,GAiB5BgB,GAAY,GAAMr8B,KAAQ,EAAIq7B,EAASr7B,KAAQ,EAAIA,KAAQ,GAChEA,KAAQ,IAAMA,KAAQ,GAAK+7B,GAASC,GAAQD,IAAUE,IAASZ,EAASr7B,KAAQ,EAAIA,KAAQ,GAAKA,KAAQ,EAAIg8B,GAAQD,IACrHV,EACJ,EAOA,QAAW,SAAU1hB,EAAGD,GAStB,GAAMC,EAAGD,GAET,MAAMrV,EAAIrE,KAAQ,EAAI,GAAK,EACrBa,EAAIb,KAAQ,EAAI,GAAK,EACrB+b,EAAI1X,EAAIxD,EAGd,IAAIC,EAAI,GAAMuD,EAAIxD,GAIlB,OAHIkb,EAAIA,GAAKlb,GACXC,IAEKu7B,GAAYr8B,KAAQ,EAAIc,EAAI,GAAK,EAAG,GAAK,EAClD,EAOA,UAAa,SAAU6Y,EAAGD,GAGxB,OADA,GAAMC,EAAGD,OACE,GAAK,EAAI1Z,KAAQ,IAAQA,KAAQ,EAAI,GAAK,GAAM,GAAK,EAAIA,KAAQ,GAC9E,EAOA,QAAW,WAET,OAAOqqB,OAAOrqB,KAAQ,EAAIA,KAAQ,GAAKqqB,OAAOrqB,KAAQ,EACxD,EAOA,SAAY,SAAUi+B,GAEpB,IAAIhB,EAAIj9B,KAAQ,EACZg9B,EAAIh9B,KAAQ,EAEhBi+B,EAAMA,GAAO,GAEb,IAAIC,EAvkBR,SAAkB75B,EAAGxD,GAEnB,KAAOA,EAAIo7B,KAAUF,GACnBl7B,GAAKo7B,IAGP,KAAOp7B,EAAIq7B,KAAWH,GACpBl7B,GAAKq7B,IAGP,GAAIr7B,IAAMm7B,GACR,OAAOD,GAOT,IAAIlF,EAAMsF,GAAQt7B,EACdN,EAAI,EAER,KAAOs2B,IAAQmF,GAAOz7B,IAGpB,GAFAs2B,EAAMA,EAAMsF,GAAQt7B,EAEhBN,EAvSc,IAwShB,OAAOw7B,GAEX,OAAOnW,OAAOrlB,EAChB,CA2iBiB49B,CAASlB,EAAGD,GACrBoB,EA1iBR,SAAoB/5B,EAAGxD,EAAGyY,GAExB,IAAI+kB,EAAOrC,GACPsC,EA7CN,SAAgB5kB,EAAGV,EAAG+W,GAEpB,IAAIhU,EAAIigB,GACR,KAAOhjB,EAAI+iB,GAAQriB,EAAKA,EAAIA,EAAKqW,EAAG/W,IAAMgjB,GAEpChjB,EAAIgjB,KACNjgB,EAAKA,EAAIrC,EAAKqW,GAGlB,OAAOhU,CACT,CAmCawiB,CAAOpC,GAAO7iB,EAAKzY,GAE9B,IAAK,IAAIN,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAG5B,GAAI89B,IAASC,EACX,OAAO1Y,OAAOrlB,GAEhB89B,EAAOA,EAAOlC,GAAQt7B,EACtBy9B,EAAOA,EAAOnC,GAAQt7B,CACxB,CACA,OAAO,CACT,CA2hBiB29B,CAAWvB,EAAGD,EAAGkB,GAE1B96B,EAAMpD,KAAQ,EAAI+7B,GAAS,IAAM,GAWrC,GARA34B,GAAO,GAAM65B,EAAID,GAEjBC,GAAKD,EACLC,GAAKd,GAEDc,IACF75B,GAAO,KAEL86B,EAAQ,CAEV,IAAK,IAAIp8B,EAAIs8B,EAAQt8B,KACnBsB,GAAO,GAAM65B,EAAID,GACjBC,GAAKD,EACLC,GAAKd,GAEP/4B,GAAO,IACP,IAAK,IAAItB,EAAIo8B,EAAQp8B,KACnBsB,GAAO,GAAM65B,EAAID,GACjBC,GAAKD,EACLC,GAAKd,GAEP/4B,GAAO,GACT,MACE,IAAK,IAAItB,EAAIm8B,EAAKhB,GAAKn7B,KACrBsB,GAAO,GAAM65B,EAAID,GACjBC,GAAKD,EACLC,GAAKd,GAGT,OAAO/4B,CACT,EAOA,WAAc,SAAUq7B,GAEtB,IAAIp6B,EAAIrE,KAAQ,EACZa,EAAIb,KAAQ,EACZoD,EAAMpD,KAAQ,EAAI+7B,GAAS,IAAM,GAErC,GAAIl7B,IAAMm7B,GACR54B,GAAOiB,MACF,CACL,IAAIq6B,EAAQ,GAAMr6B,EAAIxD,GAClB49B,GAAaC,EAAQ3C,KACvB34B,GAAOs7B,EACPt7B,GAAO,IACPiB,GAAKxD,GAGPuC,GAAOiB,EACPjB,GAAO,IACPA,GAAOvC,CACT,CACA,OAAOuC,CACT,EAOA,QAAW,SAAUq7B,GAEnB,IAAIp6B,EAAIrE,KAAQ,EACZa,EAAIb,KAAQ,EACZoD,EAAMpD,KAAQ,EAAI+7B,GAAS,IAAM,GAErC,GAAIl7B,IAAMm7B,GACR54B,GAAOiB,MACF,CACL,IAAIq6B,EAAQ,GAAMr6B,EAAIxD,GAClB49B,GAAaC,EAAQ3C,KACvB34B,GAAOs7B,EACPr6B,GAAKxD,GAGPuC,GAAO,UACPA,GAAOiB,EACPjB,GAAO,KACPA,GAAOvC,EACPuC,GAAO,GACT,CACA,OAAOA,CACT,EAOA,YAAe,WAEb,IAAIuW,EAAI3Z,KAAQ,EACZ0Z,EAAI1Z,KAAQ,EACZi7B,EAAM,GAEV,EAAG,CACDA,EAAIj5B,KAAK,GAAM2X,EAAID,IACnB,IAAInZ,EAAIoZ,EAAID,EACZC,EAAID,EACJA,EAAInZ,CACN,OAASoZ,IAAMqiB,IAEf,OAAOf,CACT,EAEA,SAAY,SAAU0D,GAEpB,MAAMC,EAAOhZ,OAAO,GAAK+Y,GAAO,MAAS,GAEnCE,EAAU7+B,KAAU,MACpB8+B,EAAOD,EAAqB,cAElC,IAAK,IAAI/8B,EAAI,EAAGA,EAAIg9B,EAAK/9B,OAAQe,IAAK,CAEpC,IAAImI,EAAIoyB,GAAYyC,EAAKh9B,EAAI,GAAIk6B,IACjC,IAAK,IAAIl7B,EAAIgB,EAAI,EAAGhB,GAAK,EAAGA,IAC1BmJ,EAAIA,EAAW,UAAS,IAAE60B,EAAKh+B,IAGjC,IAAIP,EAAI0J,EAAO,IAAE40B,GACjB,GAAIt+B,EAAK,EAAIq+B,EAAOr+B,EAAK,EACvB,OAAO0J,EAAO,IAAEjK,KAAQ,EAE5B,CACA,OAAOA,IACT,GCtgCF,MAGa++B,GAAsCp/B,GAHtC,WACQ,IAE0D,KAI7E2C,OAAOwT,eAAeoU,GAAU,OAAQ,CAAE1iB,MAAO,aACjD0iB,GAAStnB,UAAUyC,YAAc6kB,GACjCA,GAAStnB,UAAUyD,KAAO,WAC1B6jB,GAAStnB,UAAUoe,YAAa,EAOhCkJ,GAAStnB,UAAUmoB,OAAS,WAC1B,MAAO,CACLC,OAAQ,WACR3mB,EAAGT,OAAO5D,KAAKiK,EAAIjK,KAAKqE,GACxBxD,EAAG+C,OAAO5D,KAAKa,GAEnB,EAQAqpB,GAASe,SAAW,SAAUC,GAC5B,OAAO,IAAIhB,GAASgB,EACtB,EAEOhB,KACN,CAAEiB,SAAS,IChCD6T,GAAmCr/B,GAHnC,QACQ,IAEuD,KAuC1E,SAASs/B,EAAOjpB,EAAOC,EAAKipB,GAC1B,KAAMl/B,gBAAgBi/B,GACpB,MAAM,IAAIvzB,YAAY,oDAGxB,MAAMyzB,EAAWnpB,QACXopB,EAASnpB,QACTopB,EAAUH,QAEhB,GAAIC,EACF,GAAIve,EAAY5K,GACdA,EAAQA,EAAMyS,gBACT,GAAqB,iBAAVzS,IAAuB8K,EAAS9K,GAChD,MAAM,IAAItP,UAAU,8CAGxB,GAAI04B,EACF,GAAIxe,EAAY3K,GACdA,EAAMA,EAAIwS,gBACL,GAAmB,iBAARxS,IAAqB6K,EAAS7K,GAC9C,MAAM,IAAIvP,UAAU,4CAGxB,GAAI24B,EACF,GAAIze,EAAYse,GACdA,EAAOA,EAAKzW,gBACP,GAAoB,iBAATyW,IAAsBpe,EAASoe,GAC/C,MAAM,IAAIx4B,UAAU,6CAOxB,GAHA1G,KAAKgW,MAAQmpB,EAAWxhB,WAAW3H,GAAS,EAC5ChW,KAAKiW,IAAMmpB,EAASzhB,WAAW1H,GAAO,EACtCjW,KAAKk/B,KAAOG,EAAU1hB,WAAWuhB,GAAQ,EACrCG,GAAWrW,GAAYhpB,KAAKk/B,KAAM,GACpC,MAAM,IAAI7oB,MAAM,wBAEpB,CAkPA,OA7OA4oB,EAAMr8B,UAAUyD,KAAO,QACvB44B,EAAMr8B,UAAU2e,SAAU,EAW1B0d,EAAM1hB,MAAQ,SAAUna,GACtB,GAAmB,iBAARA,EACT,OAAO,KAGT,MACMk8B,EADOl8B,EAAI4G,MAAM,KACLN,KAAI,SAAUsG,GAC9B,OAAO2N,WAAW3N,EACpB,IAKA,GAHgBsvB,EAAK/1B,MAAK,SAAU+pB,GAClC,OAAO1V,MAAM0V,EACf,IAEE,OAAO,KAGT,OAAQgM,EAAKv+B,QACX,KAAK,EACH,OAAO,IAAIk+B,EAAMK,EAAK,GAAIA,EAAK,IACjC,KAAK,EACH,OAAO,IAAIL,EAAMK,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1C,QACE,OAAO,KAEb,EAMAL,EAAMr8B,UAAU6gB,MAAQ,WACtB,OAAO,IAAIwb,EAAMj/B,KAAKgW,MAAOhW,KAAKiW,IAAKjW,KAAKk/B,KAC9C,EAQAD,EAAMr8B,UAAUqd,KAAO,WACrB,IAAI3G,EAAM,EACV,MAAMtD,EAAQhW,KAAKgW,MACbkpB,EAAOl/B,KAAKk/B,KAEZK,EADMv/B,KAAKiW,IACED,EAWnB,OATI+P,GAAKmZ,KAAUnZ,GAAKwZ,GACtBjmB,EAAMhM,KAAKogB,KAAM6R,EAAQL,GACP,IAATK,IACTjmB,EAAM,GAGJsE,MAAMtE,KACRA,EAAM,GAED,CAACA,EACV,EAOA2lB,EAAMr8B,UAAU2K,IAAM,WACpB,MAAM0S,EAAOjgB,KAAKigB,OAAO,GAEzB,OAAIA,EAAO,EACLjgB,KAAKk/B,KAAO,EAEPl/B,KAAKgW,MAGLhW,KAAKgW,OAASiK,EAAO,GAAKjgB,KAAKk/B,UAGxC,CAEJ,EAOAD,EAAMr8B,UAAU8K,IAAM,WACpB,MAAMuS,EAAOjgB,KAAKigB,OAAO,GAEzB,OAAIA,EAAO,EACLjgB,KAAKk/B,KAAO,EAEPl/B,KAAKgW,OAASiK,EAAO,GAAKjgB,KAAKk/B,KAG/Bl/B,KAAKgW,WAGd,CAEJ,EASAipB,EAAMr8B,UAAUsB,QAAU,SAAUqM,GAClC,IAAI/P,EAAIR,KAAKgW,MACb,MAAMkpB,EAAOl/B,KAAKk/B,KACZjpB,EAAMjW,KAAKiW,IACjB,IAAInU,EAAI,EAER,GAAIo9B,EAAO,EACT,KAAO1+B,EAAIyV,GACT1F,EAAS/P,EAAG,CAACsB,GAAI9B,MACjBQ,GAAK0+B,EACLp9B,SAEG,GAAIo9B,EAAO,EAChB,KAAO1+B,EAAIyV,GACT1F,EAAS/P,EAAG,CAACsB,GAAI9B,MACjBQ,GAAK0+B,EACLp9B,GAGN,EAWAm9B,EAAMr8B,UAAU8G,IAAM,SAAU6G,GAC9B,MAAMia,EAAQ,GAId,OAHAxqB,KAAKkE,SAAQ,SAAUsD,EAAOrD,EAAOoS,GACnCiU,EAAMrmB,EAAM,IAAMoM,EAAS/I,EAAOrD,EAAOoS,EAC3C,IACOiU,CACT,EAOAyU,EAAMr8B,UAAU48B,QAAU,WACxB,MAAMhV,EAAQ,GAId,OAHAxqB,KAAKkE,SAAQ,SAAUsD,EAAOrD,GAC5BqmB,EAAMrmB,EAAM,IAAMqD,CACpB,IACOgjB,CACT,EAOAyU,EAAMr8B,UAAU4c,QAAU,WAExB,OAAOxf,KAAKw/B,SACd,EAYAP,EAAMr8B,UAAUkkB,OAAS,SAAU9e,GACjC,IAAI5E,EAAM0jB,GAAO9mB,KAAKgW,MAAOhO,GAM7B,OAJkB,IAAdhI,KAAKk/B,OACP97B,GAAO,IAAM0jB,GAAO9mB,KAAKk/B,KAAMl3B,IAEjC5E,GAAO,IAAM0jB,GAAO9mB,KAAKiW,IAAKjO,GACvB5E,CACT,EAOA67B,EAAMr8B,UAAUgQ,SAAW,WACzB,OAAO5S,KAAK8mB,QACd,EAQAmY,EAAMr8B,UAAUmoB,OAAS,WACvB,MAAO,CACLC,OAAQ,QACRhV,MAAOhW,KAAKgW,MACZC,IAAKjW,KAAKiW,IACVipB,KAAMl/B,KAAKk/B,KAEf,EASAD,EAAMhU,SAAW,SAAUC,GACzB,OAAO,IAAI+T,EAAM/T,EAAKlV,MAAOkV,EAAKjV,IAAKiV,EAAKgU,KAC9C,EAEOD,CAAK,GACX,CAAE9T,SAAS,ICjUDsU,GAAoC9/B,GAHpC,SACQ,IAEwD,KAuB3E,SAAS+/B,IACP,KAAM1/B,gBAAgB0/B,GACpB,MAAM,IAAIh0B,YAAY,mDAE1B,CAiNA,OA5MAg0B,EAAO98B,UAAUyD,KAAO,SACxBq5B,EAAO98B,UAAUue,UAAW,EAU5Bue,EAAO98B,UAAU+8B,QAAU,WAEzB,MAAM,IAAItpB,MAAM,8CAClB,EAUAqpB,EAAO98B,UAAUg9B,SAAW,WAE1B,MAAM,IAAIvpB,MAAM,+CAClB,EAOAqpB,EAAO98B,UAAUuC,OAAS,SAAUZ,EAAMq7B,GACxC,MAAM,IAAIvpB,MAAM,6CAClB,EAeAqpB,EAAO98B,UAAUi9B,OAAS,SAAU17B,EAAO27B,EAAanW,GAEtD,MAAM,IAAItT,MAAM,6CAClB,EAOAqpB,EAAO98B,UAAU0D,IAAM,SAAUnC,GAE/B,MAAM,IAAIkS,MAAM,0CAClB,EAWAqpB,EAAO98B,UAAUqE,IAAM,SAAU9C,EAAOqD,EAAOmiB,GAE7C,MAAM,IAAItT,MAAM,0CAClB,EAcAqpB,EAAO98B,UAAUm9B,OAAS,SAAU9f,EAAM0J,GAExC,MAAM,IAAItT,MAAM,6CAClB,EAWAqpB,EAAO98B,UAAUo9B,QAAU,SAAU/f,EAAM0J,GAEzC,MAAM,IAAItT,MAAM,8CAClB,EAMAqpB,EAAO98B,UAAU6gB,MAAQ,WAEvB,MAAM,IAAIpN,MAAM,4CAClB,EAMAqpB,EAAO98B,UAAUqd,KAAO,WAEtB,MAAM,IAAI5J,MAAM,2CAClB,EAYAqpB,EAAO98B,UAAU8G,IAAM,SAAU6G,EAAU0vB,GAEzC,MAAM,IAAI5pB,MAAM,0CAClB,EAQAqpB,EAAO98B,UAAUsB,QAAU,SAAUqM,GAEnC,MAAM,IAAI8F,MAAM,8CAClB,EAMAqpB,EAAO98B,UAAU6b,OAAOmB,UAAY,WAElC,MAAM,IAAIvJ,MAAM,oCAClB,EAMAqpB,EAAO98B,UAAU48B,QAAU,WAEzB,MAAM,IAAInpB,MAAM,8CAClB,EAMAqpB,EAAO98B,UAAU4c,QAAU,WAEzB,MAAM,IAAInJ,MAAM,8CAClB,EAUAqpB,EAAO98B,UAAUkkB,OAAS,SAAU9e,GAElC,MAAM,IAAIqO,MAAM,6CAClB,EAMAqpB,EAAO98B,UAAUgQ,SAAW,WAE1B,MAAM,IAAIyD,MAAM,+CAClB,EAEOqpB,CAAM,GACZ,CAAEvU,SAAS,IClPd,SAAS9oB,KACP,OAAOA,GAAWC,OAAOC,OAASD,OAAOC,OAAO29B,OAAS,SAAU77B,GACjE,IAAK,IAAI2U,EAAI,EAAGA,EAAIvW,UAAU1B,OAAQiY,IAAK,CACzC,IAAIzY,EAAIkC,UAAUuW,GAClB,IAAK,IAAI+C,KAAKxb,GAAG,CAAG,GAAEsC,eAAeC,KAAKvC,EAAGwb,KAAO1X,EAAE0X,GAAKxb,EAAEwb,GAC/D,CACA,OAAO1X,CACT,EAAGhC,GAASmL,MAAM,KAAM/K,UAC1B,CCEA,SAAS09B,GAAuB97B,EAAGsiB,EAAM1G,GACvC,MACMmgB,EAAO,IAAIC,EADKh8B,EAAEgB,aACO,GAC/B,IAAIwhB,EAAS,GACb,GAAI5G,EAAM,CACR,GAAIA,EAAO,EACT,MAAM,IAAI5J,MAAM,kCAElB,IAAKgP,GAAUpF,GACb,MAAM,IAAI5J,MAAM,2BAElB,GAAIhS,EAAEusB,YAAYwP,EAAKlmB,IAAI+F,EAAO,GAAGwT,IAAI,KAAOpvB,EAAE0uB,SAASqN,EAAKlmB,IAAI+F,EAAO,GAAGwU,KAAK,IACjF,MAAM,IAAIpe,MAAM,8BAA8B4J,EAAO,QAAQA,EAAO,QAEtE,IAAK5b,EAAEghB,YACL,MAAM,IAAIhP,MAAM,4BAEdhS,EAAE0uB,SAAS,KACb1uB,EAAIA,EAAE6G,IAAIk1B,EAAKlmB,IAAI+F,KAErB4G,EAAS,IAAI5G,GACf,CACA,OAAQ0G,GACN,KAAK,EAAG,MAAO,GAAGtiB,EAAEswB,aAAa9N,IACjC,KAAK,EAAG,MAAO,GAAGxiB,EAAEqxB,YAAY7O,IAChC,KAAK,GAAI,MAAO,GAAGxiB,EAAEkxB,kBAAkB1O,IACvC,QAAS,MAAM,IAAIxQ,MAAM,QAAQsQ,oBAErC,CAqLO,SAASS,GAAe5f,EAAOwf,GACpC,YAAkB1jB,IAAd0jB,EACKxf,EAAM4f,cAAcJ,EAAY,GAEhCxf,EAAM4f,eAEjB,CAYA,SAASe,GAAoB3gB,EAAOmiB,GAClC,OAAIhJ,EAASnZ,GACJA,EACEoZ,EAAYpZ,GACdA,EAAMihB,WAENkB,CAEX,CC5OO,SAAS2W,GAAUC,EAAMnI,GAC9B,MAAMpiB,EAAQuqB,EAAKx/B,OAASq3B,EAAOr3B,OAC7BkV,EAAMsqB,EAAKx/B,OACjB,OAAQw/B,EAAKlI,UAAUriB,EAAOC,KAASmiB,CACzC,CAwCO,SAAStR,GAAQtf,EAAOQ,GAC7B,MAAMvG,EAQR,SAAkB+F,EAAOQ,GACvB,MAAqB,iBAAVR,EACFg5B,GAAah5B,EAAOQ,GAGzB4Y,EAAYpZ,GDsDX,SAAiBA,EAAOQ,GAC7B,GAAuB,mBAAZA,EAET,OAAOA,EAAQR,GAIjB,IAAKA,EAAM8d,WACT,OAAO9d,EAAMoW,QAAU,MAASpW,EAAMgnB,GAAG,GAAK,WAAa,YAG7D,MAAM,SAAEzH,EAAQ,UAAEC,EAAS,SAAEC,GAAaC,GAAuBlf,GAGjE,OAAQ+e,GACN,IAAK,QACH,OAgGC,SAAkBvf,EAAOwf,GAC9B,OAAOxf,EAAM2f,QAAQH,EACvB,CAlGaG,CAAQ3f,EAAOwf,GAExB,IAAK,cACH,OAAOI,GAAc5f,EAAOwf,GAE9B,IAAK,cACH,OAmDC,SAAwBxf,EAAOwf,GAEpC,MAAMhO,EAAIxR,EAAMwR,EACV0O,EAAS1O,EAAI,GAAM,EAAIA,EAAKA,EAAI,EAAKA,EAAI,EAAMA,EAAI,EAAKA,EAAKA,EAAI,EAKvE,IAAIynB,EAFoBj5B,EAAMitB,IAAInnB,KAAK4M,IAAI,IAAKwN,IAEjBa,YAAYvB,GAM3C,OALIyZ,EAAS5d,SAAS,OAEpB4d,EAAW,IAAI1W,EADGviB,EAAMnC,aACCo7B,GAAUtZ,WAG9BsZ,EAAW,KAAOznB,GAAK,EAAI,IAAM,IAAM0O,EAAO9U,UACvD,CAlEaqV,CAAczgB,EAAOwf,GAE9B,IAAK,MACH,OAAOmZ,GAAsB34B,EAAO,EAAGyf,GAEzC,IAAK,MACH,OAAOkZ,GAAsB34B,EAAO,EAAGyf,GAEzC,IAAK,MACH,OAAOkZ,GAAsB34B,EAAO,GAAIyf,GAE1C,IAAK,OACL,CAGE,MAAMiB,EAAWC,GAAmBngB,aAAO,EAAPA,EAASkgB,UAAW,GAClDE,EAAWD,GAAmBngB,aAAO,EAAPA,EAASogB,SAAU,GAGvD,GAAI5gB,EAAM6nB,SAAU,MAAO,IAG3B,IAAIjsB,EACJ,MAAMikB,EAAU7f,EAAMsuB,oBAAoB9O,GACpCR,EAAMa,EAAQrO,EAUpB,OAPE5V,EAFEojB,GAAO0B,GAAY1B,EAAM4B,EAErBf,EAAQF,UAGRC,GAAc5f,EAAOwf,GAItB5jB,EAAI8Z,QAAQ,uBAAuB,WACxC,MAAMsL,EAAS/lB,UAAU,GACnBuW,EAAIvW,UAAU,GACpB,MAAmB,MAAX+lB,EAAkBA,EAASxP,EAAIA,CACzC,GACF,CACA,QACE,MAAM,IAAI3C,MAAM,qBAAuB0Q,EAAvB,oEAGtB,CCvHW2Z,CAAgBl5B,EAAOQ,GA0HlC,SAA4BR,GAC1B,OAAQA,GACa,iBAAVA,GACY,iBAAZA,EAAMyC,GACM,iBAAZzC,EAAMnD,GACM,iBAAZmD,EAAM3G,IAAmB,CACtC,CA3HM8/B,CAAkBn5B,GACfQ,GAAgC,YAArBA,EAAQ44B,SAKfp5B,EAAMoL,WAHN,GAAGpL,EAAMyC,EAAIzC,EAAMnD,KAAKmD,EAAM3G,IAOrC4E,MAAMC,QAAQ8B,GACTq5B,GAAYr5B,EAAOQ,GAGxBkZ,EAAS1Z,GACJs5B,GAAUt5B,GAGE,mBAAVA,EACFA,EAAMu5B,OAASn9B,OAAO4D,EAAMu5B,QAAU,WAG3Cv5B,GAA0B,iBAAVA,EACU,mBAAjBA,EAAMsf,OACRtf,EAAMsf,OAAO9e,GACXR,GAASA,EAAMoL,SAAS5K,KAAa,CAAC,EAAE4K,WAE1CpL,EAAMoL,SAAS5K,GAMf,IAJS1F,OAAOyB,KAAKyD,GAAOkC,KAAI/G,GAC9Bm+B,GAAUn+B,GAAO,KAAOmkB,GAAOtf,EAAM7E,GAAMqF,KAG/BI,KAAK,MAAQ,IAI/BxE,OAAO4D,EAChB,CAzDiBw5B,CAAQx5B,EAAOQ,GAC9B,OAAIA,GAA8B,iBAAZA,GAAwB,aAAcA,GACxDvG,EAAOV,OAASiH,EAAQ2vB,SACnBl2B,EAAO42B,UAAU,EAAGrwB,EAAQ2vB,SAAW,GAAK,MAE9Cl2B,CACT,CA2DO,SAASq/B,GAAWt5B,GACzB,MAAM+4B,EAAO38B,OAAO4D,GACpB,IAAIy5B,EAAU,GACVn/B,EAAI,EACR,KAAOA,EAAIy+B,EAAKx/B,QAAQ,CACtB,MAAM2D,EAAI67B,EAAKvS,OAAOlsB,GACtBm/B,GAAYv8B,KAAKw8B,GAAqBA,GAAkBx8B,GAAKA,EAC7D5C,GACF,CAEA,MAAO,IAAMm/B,EAAU,GACzB,CAEA,MAAMC,GAAoB,CACxB,IAAK,MACL,KAAM,OACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,OAQD,SAASC,GAAQ35B,GACtB,IAAI+4B,EAAO38B,OAAO4D,GAOlB,OANA+4B,EAAOA,EAAKrjB,QAAQ,KAAM,SACvBA,QAAQ,KAAM,UACdA,QAAQ,KAAM,SACdA,QAAQ,KAAM,QACdA,QAAQ,KAAM,QAEVqjB,CACT,CAYA,SAASM,GAAarW,EAAOxiB,GAC3B,GAAIvC,MAAMC,QAAQ8kB,GAAQ,CACxB,IAAIpnB,EAAM,IACV,MAAMkW,EAAMkR,EAAMzpB,OAClB,IAAK,IAAIe,EAAI,EAAGA,EAAIwX,EAAKxX,IACb,IAANA,IACFsB,GAAO,MAETA,GAAOy9B,GAAYrW,EAAM1oB,GAAIkG,GAG/B,OADA5E,GAAO,IACAA,CACT,CACE,OAAO0jB,GAAO0D,EAAOxiB,EAEzB,CAqBO,SAASo5B,GAAa5gC,EAAGC,GAE9B,IAAKygB,EAAS1gB,GACZ,MAAM,IAAIkG,UAAU,qGACiC8c,GAAOhjB,GAAK,eAEnE,IAAK0gB,EAASzgB,GACZ,MAAM,IAAIiG,UAAU,qGACiC8c,GAAO/iB,GAAK,eAGnE,OAAQD,IAAMC,EACV,EACCD,EAAIC,EAAI,GAAK,CACpB,CCjNO,SAAS4gC,GAAgBl0B,EAAQN,EAAUy0B,GAChD,KAAMthC,gBAAgBqhC,IACpB,MAAM,IAAI31B,YAAY,oDAGxB1L,KAAKmN,OAASA,EACdnN,KAAK6M,SAAWA,EAChB7M,KAAKshC,SAAWA,EAEhBthC,KAAKuG,QAAU,wBACVd,MAAMC,QAAQyH,GAAW,IAAMA,EAAO/E,KAAK,MAAQ,IAAO+E,GAC3D,KAAOnN,KAAKshC,UAAY,MAAQ,KAC/B77B,MAAMC,QAAQmH,GAAa,IAAMA,EAASzE,KAAK,MAAQ,IAAOyE,GAC/D,IAEJ7M,KAAKuhC,OAAS,IAAIlrB,OAASkrB,KAC7B,CCfO,SAASC,GAAYr9B,EAAOoJ,EAAKG,GACtC,KAAM1N,gBAAgBwhC,IACpB,MAAM,IAAI91B,YAAY,oDAGxB1L,KAAKmE,MAAQA,EACT1B,UAAU1B,OAAS,GACrBf,KAAKuN,IAAM,EACXvN,KAAK0N,IAAMH,IAEXvN,KAAKuN,IAAMA,EACXvN,KAAK0N,IAAMA,QAGIpK,IAAbtD,KAAKuN,KAAqBvN,KAAKmE,MAAQnE,KAAKuN,IAC9CvN,KAAKuG,QAAU,uBAAyBvG,KAAKmE,MAAQ,MAAQnE,KAAKuN,IAAM,SAClDjK,IAAbtD,KAAK0N,KAAqB1N,KAAKmE,OAASnE,KAAK0N,IACtD1N,KAAKuG,QAAU,uBAAyBvG,KAAKmE,MAAQ,OAASnE,KAAK0N,IAAM,GAAK,IAE9E1N,KAAKuG,QAAU,uBAAyBvG,KAAKmE,MAAQ,IAGvDnE,KAAKuhC,OAAS,IAAIlrB,OAASkrB,KAC7B,CCnBO,SAASE,GAAWjhC,GACzB,MAAMyJ,EAAI,GAEV,KAAOxE,MAAMC,QAAQlF,IACnByJ,EAAEjI,KAAKxB,EAAEO,QACTP,EAAIA,EAAE,GAGR,OAAOyJ,CACT,CAWA,SAASy3B,GAAWlX,EAAOvK,EAAM0hB,GAC/B,IAAI7/B,EACJ,MAAMwX,EAAMkR,EAAMzpB,OAElB,GAAIuY,IAAQ2G,EAAK0hB,GACf,MAAM,IAAIN,GAAe/nB,EAAK2G,EAAK0hB,IAGrC,GAAIA,EAAM1hB,EAAKlf,OAAS,EAAG,CAEzB,MAAM6gC,EAAUD,EAAM,EACtB,IAAK7/B,EAAI,EAAGA,EAAIwX,EAAKxX,IAAK,CACxB,MAAM+/B,EAAQrX,EAAM1oB,GACpB,IAAK2D,MAAMC,QAAQm8B,GACjB,MAAM,IAAIR,GAAephB,EAAKlf,OAAS,EAAGkf,EAAKlf,OAAQ,KAEzD2gC,GAAUlX,EAAM1oB,GAAIme,EAAM2hB,EAC5B,CACF,MAEE,IAAK9/B,EAAI,EAAGA,EAAIwX,EAAKxX,IACnB,GAAI2D,MAAMC,QAAQ8kB,EAAM1oB,IACtB,MAAM,IAAIu/B,GAAephB,EAAKlf,OAAS,EAAGkf,EAAKlf,OAAQ,IAI/D,CASO,SAAS+gC,GAAUtX,EAAOvK,GAE/B,GADkC,IAAhBA,EAAKlf,QAGrB,GAAI0E,MAAMC,QAAQ8kB,GAChB,MAAM,IAAI6W,GAAe7W,EAAMzpB,OAAQ,QAIzC2gC,GAAUlX,EAAOvK,EAAM,EAE3B,CAQO,SAAS8hB,GAAyBv6B,EAAOrD,GAC9C,MAAM69B,EAAYx6B,EAAM2Z,SAAW3Z,EAAMy6B,MAAQR,GAAUj6B,GACxCrD,EAAM+9B,YAEdh+B,SAAQ,CAACi+B,EAAWrgC,KAC7B,GAAkB,OAAdqgC,GAAsBA,IAAcH,EAAUlgC,GAAM,MAAM,IAAIu/B,GAAec,EAAWH,EAAUlgC,GAAI,GAE9G,CAQO,SAASsgC,GAAej+B,EAAOpD,GACpC,QAAcuC,IAAVa,EAAqB,CACvB,IAAKwc,EAASxc,KAAWkhB,GAAUlhB,GACjC,MAAM,IAAIuC,UAAU,oCAAsCvC,EAAQ,KAEpE,GAAIA,EAAQ,GAAwB,iBAAXpD,GAAuBoD,GAASpD,EACvD,MAAM,IAAIygC,GAAWr9B,EAAOpD,EAEhC,CACF,CAMO,SAASshC,GAAcl+B,GAC5B,IAAK,IAAIrC,EAAI,EAAGA,EAAIqC,EAAMm+B,YAAYvhC,SAAUe,EAAG,CACjD,MAAMygC,EAAYp+B,EAAMm+B,YAAYxgC,GACpC,GAAIygC,EAAUC,OAAS98B,EAAQ68B,EAAUC,QACvC,GAA2B,IAAvBD,EAAUN,MAAM,GAClB,OAAO,OAEJ,GAAIM,EAAUhhB,SACnB,GAAIghB,EAAUvsB,QAAUusB,EAAUtsB,IAChC,OAAO,OAEJ,GAAIiL,EAASqhB,IACO,IAArBA,EAAUxhC,OACZ,OAAO,CAGb,CACA,OAAO,CACT,CAYO,SAASg/B,GAAQvV,EAAOvK,EAAM0J,GAEnC,IAAKlkB,MAAMC,QAAQua,GACjB,MAAM,IAAIvZ,UAAU,kBAEtB,GAAoB,IAAhBuZ,EAAKlf,OACP,MAAM,IAAIsV,MAAM,uCAoBlB,OAhBA4J,EAAK/b,SAAQ,SAAUsD,GACrB,IAAKmZ,EAASnZ,KAAW6d,GAAU7d,IAAUA,EAAQ,EACnD,MAAM,IAAId,UAAU,uDACNogB,GAAO7G,GAAQ,IAEjC,KAGIU,EAAS6J,IAAU5J,EAAY4J,MACjCA,EAAQ,CAACA,IAKXiY,GAAQjY,EAAOvK,EAAM,OADmB3c,IAAjBqmB,EAA8BA,EAAe,GAG7Da,CACT,CAWA,SAASiY,GAASjY,EAAOvK,EAAM0hB,EAAKhY,GAClC,IAAI7nB,EACA4gC,EACJ,MAAMC,EAASnY,EAAMzpB,OACf6hC,EAAS3iB,EAAK0hB,GACdkB,EAASv1B,KAAKC,IAAIo1B,EAAQC,GAKhC,GAFApY,EAAMzpB,OAAS6hC,EAEXjB,EAAM1hB,EAAKlf,OAAS,EAAG,CAEzB,MAAM6gC,EAAUD,EAAM,EAGtB,IAAK7/B,EAAI,EAAGA,EAAI+gC,EAAQ/gC,IAEtB4gC,EAAOlY,EAAM1oB,GACR2D,MAAMC,QAAQg9B,KACjBA,EAAO,CAACA,GACRlY,EAAM1oB,GAAK4gC,GAEbD,GAAQC,EAAMziB,EAAM2hB,EAASjY,GAI/B,IAAK7nB,EAAI+gC,EAAQ/gC,EAAI8gC,EAAQ9gC,IAE3B4gC,EAAO,GACPlY,EAAM1oB,GAAK4gC,EAGXD,GAAQC,EAAMziB,EAAM2hB,EAASjY,EAEjC,KAAO,CAIL,IAAK7nB,EAAI,EAAGA,EAAI+gC,EAAQ/gC,IACtB,KAAO2D,MAAMC,QAAQ8kB,EAAM1oB,KACzB0oB,EAAM1oB,GAAK0oB,EAAM1oB,GAAG,GAKxB,IAAKA,EAAI+gC,EAAQ/gC,EAAI8gC,EAAQ9gC,IAC3B0oB,EAAM1oB,GAAK6nB,CAEf,CACF,CAYO,SAASqW,GAASxV,EAAOsY,GAC9B,MAAMC,EAAYtoB,GAAQ+P,GAAO,GAC3BwY,EAAgBD,EAAUhiC,OAEhC,IAAK0E,MAAMC,QAAQ8kB,KAAW/kB,MAAMC,QAAQo9B,GAC1C,MAAM,IAAIp8B,UAAU,kBAGtB,GAAqB,IAAjBo8B,EAAM/hC,OACR,MAAM,IAAIsgC,GAAe,EAAG2B,EAAe,MAI7C,MAAMC,EAAYC,GADlBJ,EAAQK,GAAqBL,EAAOE,IAEpC,GAAIA,IAAkBC,EACpB,MAAM,IAAI5B,GACR4B,EACAD,EACA,MAIJ,IACE,OA6DJ,SAAmBxY,EAAOsY,GAExB,IACIM,EADAC,EAAW7Y,EAGf,IAAK,IAAI8Y,EAAYR,EAAM/hC,OAAS,EAAGuiC,EAAY,EAAGA,IAAa,CACjE,MAAMrjB,EAAO6iB,EAAMQ,GACnBF,EAAY,GAGZ,MAAMriC,EAASsiC,EAAStiC,OAASkf,EACjC,IAAK,IAAIne,EAAI,EAAGA,EAAIf,EAAQe,IAC1BshC,EAAUphC,KAAKqhC,EAASnhC,MAAMJ,EAAIme,GAAOne,EAAI,GAAKme,IAGpDojB,EAAWD,CACb,CAEA,OAAOC,CACT,CAhFWE,CAASR,EAAWD,EAC7B,CAAE,MAAO9pB,GACP,GAAIA,aAAaqoB,GACf,MAAM,IAAIA,GACR4B,EACAD,EACA,MAGJ,MAAMhqB,CACR,CACF,CASO,SAASmqB,GAAsBL,EAAOE,GAC3C,MAAMC,EAAYC,GAAQJ,GACpBU,EAAiBV,EAAM5gC,QAEvBuhC,EAAgBX,EAAMh5B,SADX,GAIjB,GAD8Bg5B,EAAMh5B,SAHnB,EAGqC25B,EAAgB,IAAM,EAE1E,MAAM,IAAIptB,MAAM,mCAMlB,GAHoBotB,GAAiB,EAGpB,CACf,GAHyBT,EAAgBC,GAAc,EAMrD,MAAM,IAAI5sB,MAAM,qCAAuC2sB,EAAgB,uBAA0BC,GAFjGO,EAAeC,IAAkBT,EAAgBC,CAIrD,CACA,OAAOO,CACT,CAOA,SAASN,GAAS1Y,GAChB,OAAOA,EAAMkZ,QAAO,CAACzJ,EAAMD,IAASC,EAAOD,GAAM,EACnD,CAqCO,SAAS2J,GAASnZ,EAAOvK,GAC9B,MAAMhW,EAAIgW,GAAQwhB,GAAUjX,GAG5B,KAAO/kB,MAAMC,QAAQ8kB,IAA2B,IAAjBA,EAAMzpB,QACnCypB,EAAQA,EAAM,GACdvgB,EAAE4e,QAIJ,IAAI+a,EAAO35B,EAAElJ,OACb,KAAuB,IAAhBkJ,EAAE25B,EAAO,IACdA,IASF,OALIA,EAAO35B,EAAElJ,SACXypB,EAAQqZ,GAASrZ,EAAOoZ,EAAM,GAC9B35B,EAAElJ,OAAS6iC,GAGNpZ,CACT,CAUA,SAASqZ,GAAUrZ,EAAOoZ,EAAMjC,GAC9B,IAAI7/B,EAAG8O,EAEP,GAAI+wB,EAAMiC,EAAM,CACd,MAAMtjC,EAAOqhC,EAAM,EACnB,IAAK7/B,EAAI,EAAG8O,EAAK4Z,EAAMzpB,OAAQe,EAAI8O,EAAI9O,IACrC0oB,EAAM1oB,GAAK+hC,GAASrZ,EAAM1oB,GAAI8hC,EAAMtjC,EAExC,MACE,KAAOmF,MAAMC,QAAQ8kB,IACnBA,EAAQA,EAAM,GAIlB,OAAOA,CACT,CAcO,SAASsZ,GAAWtZ,EAAOoZ,EAAMG,EAAO9jB,GAC7C,MAAMhW,EAAIgW,GAAQwhB,GAAUjX,GAG5B,GAAIuZ,EACF,IAAK,IAAIjiC,EAAI,EAAGA,EAAIiiC,EAAOjiC,IACzB0oB,EAAQ,CAACA,GACTvgB,EAAE6e,QAAQ,GAMd,IADA0B,EAAQwZ,GAAWxZ,EAAOoZ,EAAM,GACzB35B,EAAElJ,OAAS6iC,GAChB35B,EAAEjI,KAAK,GAGT,OAAOwoB,CACT,CAUA,SAASwZ,GAAYxZ,EAAOoZ,EAAMjC,GAChC,IAAI7/B,EAAG8O,EAEP,GAAInL,MAAMC,QAAQ8kB,GAAQ,CACxB,MAAMlqB,EAAOqhC,EAAM,EACnB,IAAK7/B,EAAI,EAAG8O,EAAK4Z,EAAMzpB,OAAQe,EAAI8O,EAAI9O,IACrC0oB,EAAM1oB,GAAKkiC,GAAWxZ,EAAM1oB,GAAI8hC,EAAMtjC,EAE1C,MACE,IAAK,IAAIO,EAAI8gC,EAAK9gC,EAAI+iC,EAAM/iC,IAC1B2pB,EAAQ,CAACA,GAIb,OAAOA,CACT,CAQO,SAAS/P,GAAS+P,GAA8B,IAAvByZ,EAAaxhC,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GAC3C,IAAKgD,MAAMC,QAAQ8kB,GAEjB,OAAOA,EAET,GAA6B,kBAAlByZ,EACT,MAAM,IAAIv9B,UAAU,mDAEtB,MAAMw9B,EAAO,GAQb,OANID,EAmBJ,SAASE,EAAqB3Z,GAC5B,GAAI/kB,MAAMC,QAAQ8kB,EAAM,IACtB,IAAK,IAAI1oB,EAAI,EAAGA,EAAI0oB,EAAMzpB,OAAQe,IAChCqiC,EAAoB3Z,EAAM1oB,SAG5B,IAAK,IAAIA,EAAI,EAAGA,EAAI0oB,EAAMzpB,OAAQe,IAChCoiC,EAAKliC,KAAKwoB,EAAM1oB,GAGtB,CA5BEqiC,CAAoB3Z,GAOtB,SAAS4Z,EAAU5Z,GACjB,IAAK,IAAI1oB,EAAI,EAAGA,EAAI0oB,EAAMzpB,OAAQe,IAAK,CACrC,MAAMoV,EAAOsT,EAAM1oB,GACf2D,MAAMC,QAAQwR,GAChBktB,EAASltB,GAETgtB,EAAKliC,KAAKkV,EAEd,CACF,CAdEktB,CAAS5Z,GAGJ0Z,CAwBT,CAOO,SAASx6B,GAAK8gB,EAAOja,GAC1B,OAAO9K,MAAM7C,UAAU8G,IAAI5G,KAAK0nB,EAAOja,EACzC,CAOO,SAASrM,GAASsmB,EAAOja,GAC9B9K,MAAM7C,UAAUsB,QAAQpB,KAAK0nB,EAAOja,EACtC,CAOO,SAAS7I,GAAQ8iB,EAAOja,GAC7B,GAAgC,IAA5BkxB,GAAUjX,GAAOzpB,OACnB,MAAM,IAAIsV,MAAM,2CAGlB,OAAO5Q,MAAM7C,UAAU8E,OAAO5E,KAAK0nB,EAAOja,EAC5C,CASO,SAAS8zB,GAAc7Z,EAAO8Z,GACnC,GAAgC,IAA5B7C,GAAUjX,GAAOzpB,OACnB,MAAM,IAAIsV,MAAM,2CAGlB,OAAO5Q,MAAM7C,UAAU8E,OAAO5E,KAAK0nB,GAAQ+Z,GAAUD,EAAO9+B,KAAK++B,IACnE,CAOO,SAASn8B,GAAMoiB,EAAO/gB,GAC3B,OAAOhE,MAAM7C,UAAUwF,KAAKtF,KAAK0nB,EAAO/gB,EAC1C,CAOO,SAAS+6B,GAAU7qB,GACxB,IAAKlU,MAAMC,QAAQiU,GACjB,MAAM,IAAIjT,UAAU,wBAGtB,GAAiB,IAAbiT,EAAE5Y,OACJ,OAAO4Y,EAGT,MAAMD,EAAI,GACV,IAAIoC,EAAQ,EACZpC,EAAE,GAAK,CAAElS,MAAOmS,EAAE,GAAI8qB,WAAY,GAClC,IAAK,IAAI3iC,EAAI,EAAGA,EAAI6X,EAAE5Y,OAAQe,IACxB6X,EAAE7X,KAAO6X,EAAE7X,EAAI,GACjBga,IAEAA,EAAQ,EAEVpC,EAAE1X,KAAK,CAAEwF,MAAOmS,EAAE7X,GAAI2iC,WAAY3oB,IAEpC,OAAOpC,CACT,CAOO,SAASgrB,GAAY/qB,GAC1B,IAAKlU,MAAMC,QAAQiU,GACjB,MAAM,IAAIjT,UAAU,wBAGtB,GAAiB,IAAbiT,EAAE5Y,OACJ,OAAO4Y,EAGT,MAAMD,EAAI,GACV,IAAK,IAAI5X,EAAI,EAAGA,EAAI6X,EAAE5Y,OAAQe,IAC5B4X,EAAE1X,KAAK2X,EAAE7X,GAAG0F,OAEd,OAAOkS,CACT,CAWO,SAASirB,GAAkBna,EAAOhH,GACvC,IAAInd,EACAtF,EAAS,EAEb,IAAK,IAAIe,EAAI,EAAGA,EAAI0oB,EAAMzpB,OAAQe,IAAK,CACrC,MAAMoV,EAAOsT,EAAM1oB,GACb4D,EAAUD,MAAMC,QAAQwR,GAQ9B,GALU,IAANpV,GAAW4D,IACb3E,EAASmW,EAAKnW,QAIZ2E,GAAWwR,EAAKnW,SAAWA,EAC7B,OAGF,MAAM6jC,EAAWl/B,EACbi/B,GAAiBztB,EAAMsM,GACvBA,EAAOtM,GAEX,QAAa5T,IAAT+C,EACFA,EAAOu+B,OACF,GAAIv+B,IAASu+B,EAClB,MAAO,OAIX,CAEA,OAAOv+B,CACT,CA8BA,SAASw+B,GAAiBlrB,EAAGD,EAAGorB,EAAWnD,GACzC,GAAIA,EAAMmD,EAAW,CAEnB,GAAInrB,EAAE5Y,SAAW2Y,EAAE3Y,OACjB,MAAM,IAAIsgC,GAAe1nB,EAAE5Y,OAAQ2Y,EAAE3Y,QAGvC,MAAM2D,EAAI,GACV,IAAK,IAAI5C,EAAI,EAAGA,EAAI6X,EAAE5Y,OAAQe,IAC5B4C,EAAE5C,GAAK+iC,GAAgBlrB,EAAE7X,GAAI4X,EAAE5X,GAAIgjC,EAAWnD,EAAM,GAEtD,OAAOj9B,CACT,CAEE,OAAOiV,EAAEvS,OAAOsS,EAEpB,CAQO,SAAStS,KACd,MAAM29B,EAASt/B,MAAM7C,UAAUV,MAAMY,KAAKL,UAAW,GAAI,GACnDqiC,EAAYr/B,MAAM7C,UAAUV,MAAMY,KAAKL,WAAY,GAEzD,GAAsB,IAAlBsiC,EAAOhkC,OACT,OAAOgkC,EAAO,GAEhB,GAAIA,EAAOhkC,OAAS,EAClB,OAAOgkC,EAAO7iC,MAAM,GAAGwhC,QAAO,SAAU7G,EAAGC,GAAK,OAAO+H,GAAgBhI,EAAGC,EAAGgI,EAAW,EAAG,GAAGC,EAAO,IAErG,MAAM,IAAI1uB,MAAM,+CAEpB,CAOO,SAAS2uB,KAA0B,QAAAC,EAAAxiC,UAAA1B,OAAP+hC,EAAK,IAAAr9B,MAAAw/B,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAALpC,EAAKoC,GAAAziC,UAAAyiC,GACtC,MAAMC,EAAarC,EAAMp5B,KAAKO,GAAMA,EAAElJ,SAChCk8B,EAAI3vB,KAAKI,OAAOy3B,GAChBC,EAAU,IAAI3/B,MAAMw3B,GAAG7qB,KAAK,MAElC,IAAK,IAAItQ,EAAI,EAAGA,EAAIghC,EAAM/hC,OAAQe,IAAK,CACrC,MAAMme,EAAO6iB,EAAMhhC,GACb6/B,EAAMwD,EAAWrjC,GACvB,IAAK,IAAIC,EAAI,EAAGA,EAAI4/B,EAAK5/B,IAAK,CAC5B,MAAMsC,EAAI44B,EAAI0E,EAAM5/B,EAChBke,EAAKle,GAAKqjC,EAAQ/gC,KACpB+gC,EAAQ/gC,GAAK4b,EAAKle,GAEtB,CACF,CACA,IAAK,IAAID,EAAI,EAAGA,EAAIghC,EAAM/hC,OAAQe,IAChCujC,GAAuBvC,EAAMhhC,GAAIsjC,GAEnC,OAAOA,CACT,CAOO,SAASC,GAAwBplB,EAAMqlB,GAC5C,MAAMrI,EAAIqI,EAAOvkC,OACX4gC,EAAM1hB,EAAKlf,OACjB,IAAK,IAAIgB,EAAI,EAAGA,EAAI4/B,EAAK5/B,IAAK,CAC5B,MAAMsC,EAAI44B,EAAI0E,EAAM5/B,EACpB,GAAKke,EAAKle,GAAKujC,EAAOjhC,IAAM4b,EAAKle,GAAK,GAAOke,EAAKle,GAAKujC,EAAOjhC,GAC5D,MAAM,IAAIgS,MACR,wDAAwD4J,0CAA6C0hB,eAAiB1hB,EAAKle,cAAcujC,EAAOjhC,KAGtJ,CACF,CAQO,SAASkhC,GAAa/a,EAAO8a,GAClC,IAAIE,EAAQ/D,GAAUjX,GACtB,GAAI3G,GAAgB2hB,EAAOF,GACzB,OAAO9a,EAET6a,GAAuBG,EAAOF,GAC9B,MAAMG,EAAkBT,GAAeQ,EAAOF,GACxCrI,EAAIwI,EAAgB1kC,OACpB2kC,EAAa,IAAIjgC,MAAMw3B,EAAIuI,EAAMzkC,QAAQqR,KAAK,MAAOozB,GAE3D,IAAI3I,EAuKC,SAAgBrS,GACrB,OAAOnoB,GAAc,GAAImoB,EAC3B,CAzKU/G,CAAM+G,GAEVgb,EAAMzkC,OAASk8B,IACjBJ,EAAImD,GAAQnD,EAAG6I,GACfF,EAAQ/D,GAAU5E,IAIpB,IAAK,IAAI8E,EAAM,EAAGA,EAAM1E,EAAG0E,IACrB6D,EAAM7D,GAAO8D,EAAgB9D,KAkCZgE,EAjCP9I,EAiCuB+I,EAjCpBH,EAAgB9D,GAiCmBkE,EAjCblE,EAArC9E,EAkCGz1B,MAAU3B,MAAMmgC,GAAexzB,KAAKuzB,GAAiBE,GAjCxDL,EAAQ/D,GAAU5E,IAgCjB,IAAkB8I,EAAgBC,EAAeC,EA7BtD,OAAOhJ,CACT,CA4CO,SAASv2B,GAAKkkB,EAAOrmB,GAC1B,IAAKsB,MAAMC,QAAQ8kB,GAAU,MAAM,IAAInU,MAAM,kBAC7C,MAAM4J,EAAOwhB,GAAUjX,GACvB,GAAIrmB,EAAMpD,SAAWkf,EAAKlf,OAAU,MAAM,IAAIsgC,GAAel9B,EAAMpD,OAAQkf,EAAKlf,QAChF,IAAK,IAAIP,EAAI,EAAGA,EAAI2D,EAAMpD,OAAQP,IAAO4hC,GAAcj+B,EAAM3D,GAAIyf,EAAKzf,IACtE,OAAO2D,EAAMu/B,QAAO,CAACoC,EAAK9L,IAAS8L,EAAI9L,IAAOxP,EAChD,CAaO,SAASub,GAASvb,EAAOja,GAA6B,IAAnBy1B,EAASvjC,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GACjD,GAAqB,IAAjB+nB,EAAMzpB,OACR,MAAO,GAGT,GAAIilC,EACF,OAmBF,SAASC,EAAcz+B,GACrB,GAAI/B,MAAMC,QAAQ8B,GAAQ,CACxB,MAAMy1B,EAAIz1B,EAAMzG,OACVU,EAASgE,MAAMw3B,GACrB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBL,EAAOK,GAAKmkC,EAAaz+B,EAAM1F,IAEjC,OAAOL,CACT,CACE,OAAO8O,EAAS/I,EAEpB,CA9BSy+B,CAAazb,GAEtB,MAAMrmB,EAAQ,GAEd,OAEA,SAAS+hC,EAAuB1+B,EAAOwU,GACrC,GAAIvW,MAAMC,QAAQ8B,GAAQ,CACxB,MAAMy1B,EAAIz1B,EAAMzG,OACVU,EAASgE,MAAMw3B,GACrB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBqC,EAAM6X,GAASla,EACfL,EAAOK,GAAKokC,EAAsB1+B,EAAM1F,GAAIka,EAAQ,GAEtD,OAAOva,CACT,CACE,OAAO8O,EAAS/I,EAAOrD,EAAMjC,MAAM,EAAG8Z,GAAQwO,EAElD,CAdO0b,CAAsB1b,EAAO,EA2BtC,CAYO,SAAS2b,GAAa3b,EAAOja,GAA6B,IAAnBy1B,EAASvjC,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GACrD,GAAqB,IAAjB+nB,EAAMzpB,OACR,OAGF,GAAIilC,EAEF,YAgBF,SAASI,EAAkB5+B,GACzB,GAAI/B,MAAMC,QAAQ8B,GAAQ,CACxB,MAAMy1B,EAAIz1B,EAAMzG,OAChB,IAAK,IAAIe,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBskC,EAAiB5+B,EAAM1F,GAE3B,MACEyO,EAAS/I,EAEb,CA1BE4+B,CAAiB5b,GAGnB,MAAMrmB,EAAQ,IAGd,SAASkiC,EAA2B7+B,EAAOwU,GACzC,GAAIvW,MAAMC,QAAQ8B,GAAQ,CACxB,MAAMy1B,EAAIz1B,EAAMzG,OAChB,IAAK,IAAIe,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBqC,EAAM6X,GAASla,EACfukC,EAA0B7+B,EAAM1F,GAAIka,EAAQ,EAEhD,MACEzL,EAAS/I,EAAOrD,EAAMjC,MAAM,EAAG8Z,GAAQwO,EAE3C,CAZA6b,CAA0B7b,EAAO,EAuBnC,CCp6BO,SAAS8b,GAAkB/1B,EAAUia,EAAOjlB,EAAMghC,GACvD,GAAItgC,EAAAA,gBAAsBsK,GAAW,CACnC,IAAIi2B,EAQAC,EAPJ,GAAIF,EACFC,EAAoB,MACf,CACL,MAAME,GAAclc,EAAMrJ,SAAWqJ,EAAMvK,OAASwhB,GAAUjX,IAAQ9gB,KAAI,IAAM,IAC1Ei9B,EAAanc,EAAMrJ,SAAWqJ,EAAMlkB,IAAIogC,GAAcpgC,GAAIkkB,EAAOkc,GACvEF,EA8DN,SAAsCj2B,EAAU/I,EAAOrD,EAAOqmB,GAC5D,MAAMoc,EAAW,CAACp/B,EAAOrD,EAAOqmB,GAChC,IAAK,IAAI1oB,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,MAAMwK,EAAOs6B,EAAS1kC,MAAM,EAAGJ,GAC/B,GAAsC,OAAlCmE,EAAAA,QAAcsK,EAAUjE,GAC1B,OAAOxK,CAEX,CACF,CAtE0B+kC,CAA4Bt2B,EAAUo2B,EAAYD,EAAYlc,EACpF,CAEA,GAAIA,EAAMrJ,UAAgC,UAAnBqJ,EAAMsc,eAA2CxjC,IAAnBknB,EAAMsc,SAAyB,CAClF,MAAMC,EAoBZ,SAAwCx2B,EAAUy2B,GAChD,MAAMC,EAAoB,GAM1B,GALA3kC,OAAOud,QAAQtP,EAAShI,YAAYrE,SAAQb,IAAuB,IAArB0E,EAAWm/B,GAAK7jC,EACxD0E,EAAUiC,MAAM,KAAKjJ,SAAWimC,GAClCC,EAAkBjlC,KAAKklC,EACzB,IAE+B,IAA7BD,EAAkBlmC,OACpB,OAAOkmC,EAAkB,EAE7B,CA9B8BE,CAA8B52B,EAAUi2B,GAChEC,OAAoCnjC,IAApByjC,EAAiCA,EAAkBx2B,CACrE,MACEk2B,EAAel2B,EAEjB,OAAIi2B,GAAqB,GAAKA,GAAqB,EAC1C,CACLD,QAA+B,IAAtBC,EACT1+B,GAAI,mBAAAm9B,EAAAxiC,UAAA1B,OAAIuL,EAAI,IAAA7G,MAAAw/B,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ54B,EAAI44B,GAAAziC,UAAAyiC,GAAA,OAAKkC,GAAqBX,EAAcn6B,EAAKpK,MAAM,EAAGskC,GAAoBjhC,EAAMgL,EAAShL,KAAK,GAGvG,CAAEghC,SAAS,EAAOz+B,GAAI,mBAAAu/B,EAAA5kC,UAAA1B,OAAIuL,EAAI,IAAA7G,MAAA4hC,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJh7B,EAAIg7B,GAAA7kC,UAAA6kC,GAAA,OAAKF,GAAqBX,EAAcn6B,EAAM/G,EAAMgL,EAAShL,KAAK,EACzG,CACA,YAAgBjC,IAAZijC,EACK,CAAEA,QAASgB,GAAuBh3B,GAAWzI,GAAIyI,GAEjD,CAAEg2B,UAASz+B,GAAIyI,EAE1B,CA0BA,SAASg3B,GAAwBh3B,GAC/B,GAAwB,IAApBA,EAASxP,OAAc,OAAO,EAElC,MAAMymC,EAAcj3B,EAASqC,WAE7B,GAAI,YAAYpN,KAAKgiC,GAAc,OAAO,EAG1C,MAAMC,EAAYD,EAAYh/B,MAAM,WAEpC,OAAI,SAAShD,KAAKiiC,EAEpB,CAoBA,SAASL,GAAsBF,EAAM56B,EAAMo7B,EAAeC,GACxD,IACE,OAAOT,KAAQ56B,EACjB,CAAE,MAAOM,IAcX,SAA+BA,EAAKN,EAAMo7B,EAAeC,GAAc,IAAAC,EAErE,GAAIh7B,aAAelG,WAAoC,eAAf,QAARkhC,EAAAh7B,EAAIrI,YAAI,IAAAqjC,OAAA,EAARA,EAAU16B,UAA0B,CAClE,MAAM26B,EAAW,GAKjB,MAJAA,EAAS7lC,KAAK,UAAU8lC,GAAQx7B,EAAK,OACjCA,EAAKvL,QAAU,GAAK8mC,EAAS7lC,KAAK,UAAU8lC,GAAQx7B,EAAK,OACzDA,EAAKvL,QAAU,GAAK8mC,EAAS7lC,KAAK,UAAU8lC,GAAQx7B,EAAK,OAEvD,IAAI5F,UAAU,YAAYghC,qCAC3BC,KAAgBE,EAASz/B,KAAK,mBAAmB2/B,KAAKjH,UAAUx0B,EAAK,MAC5E,CACE,MAAM,IAAI5F,UAAU,YAAYghC,iDACfC,MAAiB/6B,EAAIrG,UAE1C,CA3BIyhC,CAAqBp7B,EAAKN,EAAMo7B,EAAeC,EACjD,CACF,CHhFAtG,GAAez+B,UAAY,IAAIqlC,WAC/B5G,GAAez+B,UAAUyC,YAAc4iC,WACvC5G,GAAez+B,UAAU2C,KAAO,iBAChC87B,GAAez+B,UAAUslC,kBAAmB,ECK5C1G,GAAW5+B,UAAY,IAAIqlC,WAC3BzG,GAAW5+B,UAAUyC,YAAc4iC,WACnCzG,GAAW5+B,UAAU2C,KAAO,aAC5Bi8B,GAAW5+B,UAAUulC,cAAe,EG5BpC,MAKaC,GAAyCzoC,GALzC,cACQ,CACnB,WAGgF0D,IAAgB,IAAf,OAAEq8B,GAAQr8B,EAM3F,SAAS4mB,EAAa1lB,EAAMq7B,GAC1B,KAAM5/B,gBAAgBiqB,GAAgB,MAAM,IAAIve,YAAY,oDAC5D,GAAIk0B,IAAa1e,EAAS0e,GAAa,MAAM,IAAIvpB,MAAM,qBAAuBupB,GAE9E,GAAIze,EAAS5c,GAEO,gBAAdA,EAAK8B,MAEPrG,KAAKwiC,MAAQ/e,GAAMlf,EAAKi+B,OACxBxiC,KAAKiiC,MAAQxe,GAAMlf,EAAK09B,OACxBjiC,KAAKqoC,UAAYzI,GAAYr7B,EAAK8jC,YAGlCroC,KAAKwiC,MAAQj+B,EAAKi7B,UAClBx/B,KAAKiiC,MAAQ19B,EAAK0b,OAClBjgB,KAAKqoC,UAAYzI,GAAYr7B,EAAK8jC,gBAE/B,GAAI9jC,GAAQmB,EAAQnB,EAAKA,OAASmB,EAAQnB,EAAK0b,MAEpDjgB,KAAKwiC,MAAQj+B,EAAKA,KAClBvE,KAAKiiC,MAAQ19B,EAAK0b,KAElB6hB,GAAS9hC,KAAKwiC,MAAOxiC,KAAKiiC,OAC1BjiC,KAAKqoC,UAAYzI,GAAYr7B,EAAKq7B,cAC7B,GAAIl6B,EAAQnB,GAEjBvE,KAAKwiC,MAAQ8F,EAAW/jC,GAExBvE,KAAKiiC,MAAQR,GAAUzhC,KAAKwiC,OAE5BV,GAAS9hC,KAAKwiC,MAAOxiC,KAAKiiC,OAE1BjiC,KAAKqoC,UAAYzI,MACZ,IAAIr7B,EAET,MAAM,IAAImC,UAAU,6BAA+B8c,GAAOjf,GAAQ,KAGlEvE,KAAKwiC,MAAQ,GACbxiC,KAAKiiC,MAAQ,CAAC,GACdjiC,KAAKqoC,UAAYzI,CACnB,CACF,CAmXA,SAAS6C,EAAS/X,EAAQzK,EAAM0J,GAE9B,GAAoB,IAAhB1J,EAAKlf,OAAc,CAErB,IAAIH,EAAI8pB,EAAO8X,MAEf,KAAO98B,EAAQ9E,IACbA,EAAIA,EAAE,GAER,OAAOA,CACT,CAKA,OAHA8pB,EAAOuX,MAAQhiB,EAAK/d,MAAM,GAC1BwoB,EAAO8X,MAAQzC,GAAOrV,EAAO8X,MAAO9X,EAAOuX,MAAOtY,GAE3Ce,CACT,CAkCA,SAAS6d,EAAM7d,EAAQzK,EAAM0J,GAC3B,MACE6e,EAAU9d,EAAOuX,MAAM//B,MAAM,GAE/B,IAAIumC,GAAU,EAGd,KAAOD,EAAQznC,OAASkf,EAAKlf,QAC3BynC,EAAQxmC,KAAK,GACbymC,GAAU,EAIZ,IAAK,IAAI3mC,EAAI,EAAG8O,EAAKqP,EAAKlf,OAAQe,EAAI8O,EAAI9O,IACpCme,EAAKne,GAAK0mC,EAAQ1mC,KACpB0mC,EAAQ1mC,GAAKme,EAAKne,GAClB2mC,GAAU,GAIVA,GAEFhG,EAAQ/X,EAAQ8d,EAAS7e,EAE7B,CAkgBA,SAAS2e,EAAY/jC,GACnB,OAAI4c,EAAS5c,GACJ+jC,EAAW/jC,EAAKib,WAGrB9Z,EAAQnB,GACHA,EAAKmF,IAAI4+B,GAGX/jC,CACT,CAEA,OAz8BA0lB,EAAYrnB,UAAY,IAAI88B,EAK5BzV,EAAYrnB,UAAU8lC,kBAAoB,SAAUnkC,EAAMq7B,GACxD,OAAO,IAAI3V,EAAY1lB,EAAMq7B,EAC/B,EAKAt9B,OAAOwT,eAAemU,EAAa,OAAQ,CAAEziB,MAAO,gBACpDyiB,EAAYrnB,UAAUyC,YAAc4kB,EACpCA,EAAYrnB,UAAUyD,KAAO,cAC7B4jB,EAAYrnB,UAAUye,eAAgB,EAWtC4I,EAAYrnB,UAAU+lC,YAAc,WAClC,OAAOhE,GAAiB3kC,KAAKwiC,MAAOhf,GACtC,EAWAyG,EAAYrnB,UAAU+8B,QAAU,WAC9B,MAAO,OACT,EAWA1V,EAAYrnB,UAAUg9B,SAAW,WAC/B,OAAO5/B,KAAKqoC,SACd,EAQApe,EAAYrnB,UAAUuC,OAAS,SAAUZ,EAAMq7B,GAC7C,OAAO,IAAI3V,EAAY1lB,EAAMq7B,EAC/B,EAgBA3V,EAAYrnB,UAAUi9B,OAAS,SAAU17B,EAAO27B,EAAanW,GAC3D,OAAQlnB,UAAU1B,QAChB,KAAK,EACH,OAmEN,SAAe2pB,EAAQvmB,GACrB,IAAKqd,EAAQrd,GACX,MAAM,IAAIuC,UAAU,iBAItB,GADiBvC,EAAMykC,WAGrB,OAAOle,EAAOpkB,IAAInC,EAAMoJ,OACnB,CAEL,MAAM0S,EAAO9b,EAAM8b,OACnB,GAAIA,EAAKlf,SAAW2pB,EAAOuX,MAAMlhC,OAC/B,MAAM,IAAIsgC,GAAephB,EAAKlf,OAAQ2pB,EAAOuX,MAAMlhC,QAIrD,MAAMwM,EAAMpJ,EAAMoJ,MACZG,EAAMvJ,EAAMuJ,MAClB,IAAK,IAAI5L,EAAI,EAAG8O,EAAK8Z,EAAOuX,MAAMlhC,OAAQe,EAAI8O,EAAI9O,IAChDsgC,GAAc70B,EAAIzL,GAAI4oB,EAAOuX,MAAMngC,IACnCsgC,GAAc10B,EAAI5L,GAAI4oB,EAAOuX,MAAMngC,IAIrC,MAAM+mC,EAAe,IAAI5e,EAAY,IAC/B6e,EAiBV,SAAwBvkC,EAAMJ,GAC5B,MAAM4kC,EAAW5kC,EAAM8b,OAAOlf,OAAS,EACjCkf,EAAOxa,MAAMsjC,GACnB,MAAO,CAAExkC,KAET,SAASykC,EAAuBzkC,GAAiB,IAAXyX,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EAC5C,MAAMwmC,EAAS9kC,EAAMo+B,UAAUvmB,GAE/B,OADAiE,EAAKjE,GAASitB,EAAOhpB,OAAO,GACxBjE,EAAQ+sB,EACHE,EAAOv/B,KAAIw/B,IAChB9G,GAAc8G,EAAY3kC,EAAKxD,QACxBioC,EAAsBzkC,EAAK2kC,GAAaltB,EAAQ,MACtDwD,UAEIypB,EAAOv/B,KAAIw/B,IAChB9G,GAAc8G,EAAY3kC,EAAKxD,QACxBwD,EAAK2kC,MACX1pB,SAEP,CAhBewpB,CAAsBzkC,GAAO0b,OAiB9C,CArCsBkpB,CAAcze,EAAO8X,MAAOr+B,GAI9C,OAHA0kC,EAAa5G,MAAQ6G,EAAU7oB,KAC/B4oB,EAAaR,UAAY3d,EAAO2d,UAChCQ,EAAarG,MAAQsG,EAAUvkC,KACxBskC,CACT,CACF,CAnGaO,CAAKppC,KAAMmE,GAGpB,KAAK,EACL,KAAK,EACH,OA2IN,SAAeumB,EAAQvmB,EAAO2kC,EAAWnf,GACvC,IAAKxlB,IAA2B,IAAlBA,EAAMqd,QAClB,MAAM,IAAI9a,UAAU,iBAItB,MAAM2iC,EAAQllC,EAAM8b,OACd2oB,EAAWzkC,EAAMykC,WAGvB,IAAIU,EAQJ,GAPInoB,EAAS2nB,IACXQ,EAAQR,EAAU7oB,OAClB6oB,EAAYA,EAAUtpB,WAEtB8pB,EAAQ7H,GAAUqH,GAGhBF,EAAU,CAIZ,GAAqB,IAAjBU,EAAMvoC,OACR,MAAM,IAAI2F,UAAU,mBAEtBgkB,EAAOzjB,IAAI9C,EAAMoJ,MAAOu7B,EAAWnf,EACrC,KAAO,CAIL,IAAK9F,GAAgBylB,EAAOD,GAC1B,IAMEC,EAAQ7H,GAJNqH,EADmB,IAAjBQ,EAAMvoC,OACIwkC,GAAY,CAACuD,GAAYO,GAEzB9D,GAAYuD,EAAWO,GAGvC,CAAE,MAAAxjB,GACF,CAIF,GAAIwjB,EAAMtoC,OAAS2pB,EAAOuX,MAAMlhC,OAC9B,MAAM,IAAIsgC,GAAegI,EAAMtoC,OAAQ2pB,EAAOuX,MAAMlhC,OAAQ,KAG9D,GAAIuoC,EAAMvoC,OAASsoC,EAAMtoC,OAAQ,CAE/B,IAAIe,EAAI,EACJiiC,EAAQ,EACZ,KAAoB,IAAbsF,EAAMvnC,IAAyB,IAAbwnC,EAAMxnC,IAC7BA,IAEF,KAAoB,IAAbunC,EAAMvnC,IACXiiC,IACAjiC,IAIFgnC,EAAYhF,GAAUgF,EAAWO,EAAMtoC,OAAQgjC,EAAOuF,EACxD,CAGA,IAAKzlB,GAAgBwlB,EAAOC,GAC1B,MAAM,IAAIjI,GAAegI,EAAOC,EAAO,KAOzCf,EAAK7d,EAHQvmB,EAAMuJ,MAAMhE,KAAI,SAAU5H,GACrC,OAAOA,EAAI,CACb,IACmB6nB,GAiBvB,SAAwBplB,EAAMJ,EAAO2kC,GACnC,MAAMC,EAAW5kC,EAAM8b,OAAOlf,OAAS,GAIvC,SAASwoC,EAAuBhlC,EAAMukC,GAAsB,IAAX9sB,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACvD,MAAM+mC,EAAQrlC,EAAMo+B,UAAUvmB,GAC1BA,EAAQ+sB,EACVS,EAAMtlC,SAAQ,CAACglC,EAAYpnC,KACzBsgC,GAAc8G,EAAY3kC,EAAKxD,QAC/BwoC,EAAsBhlC,EAAK2kC,GAAaJ,EAAUhnC,EAAE,IAAKka,EAAQ,EAAE,IAGrEwtB,EAAMtlC,SAAQ,CAACglC,EAAYpnC,KACzBsgC,GAAc8G,EAAY3kC,EAAKxD,QAC/BwD,EAAK2kC,GAAcJ,EAAUhnC,EAAE,GAAG,GAGxC,CAfAynC,CAAsBhlC,EAAMukC,EAgB9B,CAjCIW,CAAc/e,EAAO8X,MAAOr+B,EAAO2kC,EACrC,CAEA,OAAOpe,CACT,CA1Nagf,CAAK1pC,KAAMmE,EAAO27B,EAAanW,GAExC,QACE,MAAM,IAAIje,YAAY,6BAE5B,EAQAue,EAAYrnB,UAAU0D,IAAM,SAAUnC,GACpC,OAAOmC,GAAItG,KAAKwiC,MAAOr+B,EACzB,EAYA8lB,EAAYrnB,UAAUqE,IAAM,SAAU9C,EAAOqD,EAAOmiB,GAClD,IAAKjkB,EAAQvB,GAAU,MAAM,IAAIuC,UAAU,kBAC3C,GAAIvC,EAAMpD,OAASf,KAAKiiC,MAAMlhC,OAAU,MAAM,IAAIsgC,GAAel9B,EAAMpD,OAAQf,KAAKiiC,MAAMlhC,OAAQ,KAElG,IAAIe,EAAG8O,EAAI+4B,EAGX,MAAM1pB,EAAO9b,EAAMuF,KAAI,SAAU5H,GAC/B,OAAOA,EAAI,CACb,IACAymC,EAAKvoC,KAAMigB,EAAM0J,GAGjB,IAAIplB,EAAOvE,KAAKwiC,MAChB,IAAK1gC,EAAI,EAAG8O,EAAKzM,EAAMpD,OAAS,EAAGe,EAAI8O,EAAI9O,IACzC6nC,EAASxlC,EAAMrC,GACfsgC,GAAcuH,EAAQplC,EAAKxD,QAC3BwD,EAAOA,EAAKolC,GAQd,OAJAA,EAASxlC,EAAMA,EAAMpD,OAAS,GAC9BqhC,GAAcuH,EAAQplC,EAAKxD,QAC3BwD,EAAKolC,GAAUniC,EAERxH,IACT,EAiNAiqB,EAAYrnB,UAAUm9B,OAAS,SAAU9f,EAAM0J,EAAc1oB,GAE3D,IAAKmgB,EAAanB,GAChB,MAAM,IAAIvZ,UAAU,4BAItB,MAAMkjC,EAAY3pB,EAAKT,UAAU9V,KAAIlC,GAC5B/B,MAAMC,QAAQ8B,IAA2B,IAAjBA,EAAMzG,OACjCyG,EAAM,GACNA,IAMN,OAAOi7B,EAFGxhC,EAAOjB,KAAKyjB,QAAUzjB,KAEd4pC,EAAWjgB,EAC/B,EAkCAM,EAAYrnB,UAAUo9B,QAAU,SAAU/f,EAAMhf,GAC9C,MAAM8uB,EAAI9uB,EAAOjB,KAAKyjB,QAAUzjB,KAEhC+vB,EAAEyS,MAAQxC,GAAQjQ,EAAEyS,MAAOviB,GAC3B,MAAM+iB,EAAgBjT,EAAEkS,MAAMyB,QAAO,CAAC3iC,EAAQkf,IAASlf,EAASkf,IAEhE,OADA8P,EAAEkS,MAAQkB,GAAqBljB,EAAM+iB,GAC9BjT,CACT,EA0CA9F,EAAYrnB,UAAU6gB,MAAQ,WAM5B,OALU,IAAIwG,EAAY,CACxB1lB,KAAMkf,GAAMzjB,KAAKwiC,OACjBviB,KAAMwD,GAAMzjB,KAAKiiC,OACjBrC,SAAU5/B,KAAKqoC,WAGnB,EAOApe,EAAYrnB,UAAUqd,KAAO,WAC3B,OAAOjgB,KAAKiiC,MAAM//B,MAAM,EAC1B,EAcA+nB,EAAYrnB,UAAU8G,IAAM,SAAU6G,GAA8C,IAAjBg2B,EAAO9jC,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GACxE,MAAMrC,EAAKJ,KACL+oC,EAAW3oC,EAAG6hC,MAAMlhC,OAAS,EAEnC,GAAIgoC,EAAW,EAAG,OAAO3oC,EAAGqjB,QAE5B,MAAMgjB,EAAeH,GAAiB/1B,EAAUnQ,EAAI,MAAOmmC,GACrDsD,EAAiBpD,EAAa3+B,GAE9BrG,EAASrB,EAAG+E,YAAO7B,EAAWlD,EAAGioC,WAEvC,GADA5mC,EAAOwgC,MAAQ7hC,EAAG6hC,MACdsE,GAAWE,EAAaF,QAE1B,OADA9kC,EAAO+gC,MAiCT,SAASsH,EAAcvlC,GAAiB,IAAXyX,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACnC,MAAMhB,EAASgE,MAAMlB,EAAKxD,QAC1B,GAAIib,EAAQ+sB,EACV,IAAK,IAAIjnC,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BL,EAAOK,GAAKgoC,EAAavlC,EAAKzC,GAAIka,EAAQ,QAG5C,IAAK,IAAIla,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BL,EAAOK,GAAK+nC,EAAetlC,EAAKzC,IAGpC,OAAOL,CACT,CA7CiBqoC,CAAa1pC,EAAGoiC,OACxB/gC,EAET,GAAiB,IAAbsnC,EAAgB,CAClB,MAAMgB,EAAY3pC,EAAGof,UACfjb,EAAOkB,MAAMskC,EAAUhpC,QAC7B,IAAK,IAAIe,EAAI,EAAGA,EAAIioC,EAAUhpC,OAAQe,IACpCyC,EAAKzC,GAAK+nC,EAAeE,EAAUjoC,GAAI,CAACA,GAAI1B,GAG9C,OADAqB,EAAO+gC,MAAQj+B,EACR9C,CACT,CAEA,MAAM0C,EAAQ,GAEd,OADA1C,EAAO+gC,MAGP,SAASwH,EAASzlC,GAAiB,IAAXyX,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EAC9B,MAAMhB,EAASgE,MAAMlB,EAAKxD,QAC1B,GAAIib,EAAQ+sB,EACV,IAAK,IAAIjnC,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BqC,EAAM6X,GAASla,EACfL,EAAOK,GAAKkoC,EAAQzlC,EAAKzC,GAAIka,EAAQ,QAGvC,IAAK,IAAIla,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BqC,EAAM6X,GAASla,EACfL,EAAOK,GAAK+nC,EAAetlC,EAAKzC,GAAIqC,EAAMjC,QAAS9B,GAGvD,OAAOqB,CACT,CAjBeuoC,CAAQ5pC,EAAGoiC,OACnB/gC,CA+BT,EAWAwoB,EAAYrnB,UAAUsB,QAAU,SAAUqM,GAA8C,IAAjBg2B,EAAO9jC,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GAC5E,MAAMrC,EAAKJ,KACL+oC,EAAW3oC,EAAG6hC,MAAMlhC,OAAS,EAEnC,GAAIgoC,EAAW,EAAG,OAElB,MAAMtC,EAAeH,GAAiB/1B,EAAUnQ,EAAI,MAAOmmC,GACrDsD,EAAiBpD,EAAa3+B,GACpC,GAAIy+B,GAAWE,EAAaF,QAE1B,YAyBF,SAASuD,EAAcvlC,GAAiB,IAAXyX,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACnC,GAAIuZ,EAAQ+sB,EACV,IAAK,IAAIjnC,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BgoC,EAAavlC,EAAKzC,GAAIka,EAAQ,QAGhC,IAAK,IAAIla,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/B+nC,EAAetlC,EAAKzC,GAG1B,CApCEgoC,CAAa1pC,EAAGoiC,OAGlB,GAAiB,IAAbuG,EAAgB,CAClB,IAAK,IAAIjnC,EAAI,EAAGA,EAAI1B,EAAGoiC,MAAMzhC,OAAQe,IACnC+nC,EAAezpC,EAAGoiC,MAAM1gC,GAAI,CAACA,GAAI1B,GAEnC,MACF,CACA,MAAM+D,EAAQ,IAGd,SAAS6lC,EAASzlC,GAAiB,IAAXyX,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EAC9B,GAAIuZ,EAAQ+sB,EACV,IAAK,IAAIjnC,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BqC,EAAM6X,GAASla,EACfkoC,EAAQzlC,EAAKzC,GAAIka,EAAQ,QAG3B,IAAK,IAAIla,EAAI,EAAGA,EAAIyC,EAAKxD,OAAQe,IAC/BqC,EAAM6X,GAASla,EACf+nC,EAAetlC,EAAKzC,GAAIqC,EAAMjC,QAAS9B,EAG7C,CAdA4pC,CAAQ5pC,EAAGoiC,MA2Bb,EAMAvY,EAAYrnB,UAAU6b,OAAOmB,UAAY,YACvC,MAAMmpB,EAAW/oC,KAAKiiC,MAAMlhC,OAAS,EAErC,GAAIgoC,EAAW,EACb,OAGF,GAAiB,IAAbA,EAAgB,CAClB,IAAK,IAAIjnC,EAAI,EAAGA,EAAI9B,KAAKwiC,MAAMzhC,OAAQe,SAC9B,CAAE0F,MAAOxH,KAAKwiC,MAAM1gC,GAAIqC,MAAO,CAACrC,IAEzC,MACF,CAGA,MAAMqC,EAAQsB,MAAMsjC,EAAW,GAAG32B,KAAK,GACjC63B,EAAgBjqC,KAAKiiC,MAAMyB,QAAO,CAAC/pB,EAAGD,IAAMC,EAAID,GAAG,GAEzD,IAAK,IAAIoC,EAAQ,EAAGA,EAAQmuB,EAAenuB,IAAS,CAElD,IAAIouB,EAAUlqC,KAAKwiC,MACnB,IAAK,IAAI3hC,EAAI,EAAGA,EAAIkoC,EAAUloC,IAC5BqpC,EAAUA,EAAQ/lC,EAAMtD,SAEpB,CAAE2G,MAAO0iC,EAAQ/lC,EAAM4kC,IAAY5kC,MAAOA,EAAMjC,SAGtD,IAAK,IAAIrB,EAAIkoC,EAAUloC,GAAK,IAC1BsD,EAAMtD,OACFsD,EAAMtD,GAAKb,KAAKiiC,MAAMphC,KAFGA,IAG7BsD,EAAMtD,GAAK,CAEf,CACF,EAMAopB,EAAYrnB,UAAUunC,KAAO,WAC3B,MAAM1oC,EAAS,GAGf,GAAiB,IADPzB,KAAKigB,OACTlf,OACJ,MAAM,IAAI2F,UAAU,8CAGtB,MAAMnC,EAAOvE,KAAKwiC,MAClB,IAAK,MAAM4H,KAAO7lC,EAChB9C,EAAOO,KAAK,IAAIioB,EAAY,CAACmgB,GAAMpqC,KAAKqoC,YAG1C,OAAO5mC,CACT,EAMAwoB,EAAYrnB,UAAUynC,QAAU,WAC9B,MAAM5oC,EAAS,GAETwI,EAAIjK,KAAKigB,OACf,GAAiB,IAAbhW,EAAElJ,OACJ,MAAM,IAAI2F,UAAU,8CAGtB,MAAMnC,EAAOvE,KAAKwiC,MAClB,IAAK,IAAI1gC,EAAI,EAAGA,EAAImI,EAAE,GAAInI,IAAK,CAC7B,MAAMwoC,EAAM/lC,EAAKmF,KAAI0gC,GAAO,CAACA,EAAItoC,MACjCL,EAAOO,KAAK,IAAIioB,EAAYqgB,EAAKtqC,KAAKqoC,WACxC,CAEA,OAAO5mC,CACT,EAOAwoB,EAAYrnB,UAAU48B,QAAU,WAC9B,OAAO/b,GAAMzjB,KAAKwiC,MACpB,EAOAvY,EAAYrnB,UAAU4c,QAAU,WAC9B,OAAOxf,KAAKwiC,KACd,EAWAvY,EAAYrnB,UAAUkkB,OAAS,SAAU9e,GACvC,OAAO8e,GAAO9mB,KAAKwiC,MAAOx6B,EAC5B,EAOAiiB,EAAYrnB,UAAUgQ,SAAW,WAC/B,OAAOkU,GAAO9mB,KAAKwiC,MACrB,EAOAvY,EAAYrnB,UAAUmoB,OAAS,WAC7B,MAAO,CACLC,OAAQ,cACRzmB,KAAMvE,KAAKwiC,MACXviB,KAAMjgB,KAAKiiC,MACXrC,SAAU5/B,KAAKqoC,UAEnB,EAUApe,EAAYrnB,UAAU2nC,SAAW,SAAUzpC,GAEzC,GAAIA,GAIF,GAFI8f,EAAY9f,KAAMA,EAAIA,EAAE2nB,aAEvB9H,EAAS7f,KAAOukB,GAAUvkB,GAC7B,MAAM,IAAI4F,UAAU,kDAItB5F,EAAI,EAGN,MAAM0pC,EAAS1pC,EAAI,EAAIA,EAAI,EACrB2pC,EAAO3pC,EAAI,GAAKA,EAAI,EAGpBqpC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GAGrB59B,EAAIiJ,KAAKC,IAAI48B,EAAOM,EAAMJ,EAAUG,GAGpCjmC,EAAO,GAGb,IAAK,IAAIzC,EAAI,EAAGA,EAAIuC,EAAGvC,IACrByC,EAAKzC,GAAK9B,KAAKwiC,MAAM1gC,EAAI2oC,GAAM3oC,EAAI0oC,GAIrC,OAAO,IAAIvgB,EAAY,CACrB1lB,OACA0b,KAAM,CAAC5b,GACPu7B,SAAU5/B,KAAKqoC,WAEnB,EAcApe,EAAYsgB,SAAW,SAAUtqB,EAAMzY,EAAO1G,EAAG6oB,GAC/C,IAAKjkB,EAAQua,GAAS,MAAM,IAAIvZ,UAAU,kCAC1C,GAAoB,IAAhBuZ,EAAKlf,OAAgB,MAAM,IAAIsV,MAAM,4CAiBzC,GAdA4J,EAAOA,EAAKvW,KAAI,SAAUO,GAOxB,GALI2W,EAAY3W,KAEdA,EAAIA,EAAEwe,aAGH9H,EAAS1W,KAAOob,GAAUpb,IAAMA,EAAI,EACvC,MAAM,IAAIoM,MAAM,yCAElB,OAAOpM,CACT,IAGInJ,GAIF,GAFI8f,EAAY9f,KAAMA,EAAIA,EAAE2nB,aAEvB9H,EAAS7f,KAAOukB,GAAUvkB,GAC7B,MAAM,IAAI4F,UAAU,kDAItB5F,EAAI,EAGN,MAAM0pC,EAAS1pC,EAAI,EAAIA,EAAI,EACrB2pC,EAAO3pC,EAAI,GAAKA,EAAI,EAGpBqpC,EAAOlqB,EAAK,GACZoqB,EAAUpqB,EAAK,GAGf5b,EAAIiJ,KAAKC,IAAI48B,EAAOM,EAAMJ,EAAUG,GAG1C,IAAIpmB,EAGJ,GAAI1e,EAAQ8B,GAAQ,CAElB,GAAIA,EAAMzG,SAAWsD,EAEnB,MAAM,IAAIgS,MAAM,8BAGlB+N,EAAS,SAAUtiB,GAEjB,OAAO0F,EAAM1F,EACf,CACF,MAAO,GAAIqf,EAAS3Z,GAAQ,CAE1B,MAAMkjC,EAAKljC,EAAMyY,OAEjB,GAAkB,IAAdyqB,EAAG3pC,QAAgB2pC,EAAG,KAAOrmC,EAE/B,MAAM,IAAIgS,MAAM,yBAGlB+N,EAAS,SAAUtiB,GAEjB,OAAO0F,EAAMlB,IAAI,CAACxE,GACpB,CACF,MAEEsiB,EAAS,WAEP,OAAO5c,CACT,EAIGmiB,IAEHA,EAAe/I,EAAYwD,EAAO,IAC9BA,EAAO,GAAGqQ,IAAI,GACd,GAIN,IAAIlwB,EAAO,GAGX,GAAI0b,EAAKlf,OAAS,EAAG,CAEnBwD,EAAOw7B,GAAOx7B,EAAM0b,EAAM0J,GAE1B,IAAK,IAAI9oB,EAAI,EAAGA,EAAIwD,EAAGxD,IACrB0D,EAAK1D,EAAI4pC,GAAM5pC,EAAI2pC,GAAUpmB,EAAOvjB,EAExC,CAGA,OAAO,IAAIopB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAME,IAEjB,EAUApgB,EAAYgB,SAAW,SAAUC,GAC/B,OAAO,IAAIjB,EAAYiB,EACzB,EAWAjB,EAAYrnB,UAAU+nC,SAAW,SAAU7oC,EAAGC,GAE5C,KAAK4e,EAAS7e,IAAOujB,GAAUvjB,IAAO6e,EAAS5e,IAAOsjB,GAAUtjB,IAC9D,MAAM,IAAIsU,MAAM,uCAGlB,GAA0B,IAAtBrW,KAAKiiC,MAAMlhC,OACb,MAAM,IAAIsV,MAAM,4CASlB,OANA+rB,GAActgC,EAAG9B,KAAKiiC,MAAM,IAC5BG,GAAcrgC,EAAG/B,KAAKiiC,MAAM,IAG5BhY,EAAY2gB,UAAU9oC,EAAGC,EAAG/B,KAAKwiC,OAE1BxiC,IACT,EASAiqB,EAAY2gB,UAAY,SAAU9oC,EAAGC,EAAGwC,GAEtC,MAAMsmC,EAAKtmC,EAAKzC,GAChByC,EAAKzC,GAAKyC,EAAKxC,GACfwC,EAAKxC,GAAK8oC,CACZ,EAqBO5gB,CAAW,GACjB,CAAEkB,SAAS,ICxgCR5lB,GAAO,QAGAulC,GAA8BnrC,GAAQ4F,GAF9B,CAAC,UAEiDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAmB/E,OAAO4C,EAAMV,GAAM,CACjBwlC,IAAKC,IACL,ICrBG,SAASC,GAASC,GACvB,MAAMC,EAAID,EAAInqC,OACRqqC,EAAIF,EAAI,GAAGnqC,OACjB,IAAIe,EAAGC,EACP,MAAMu5B,EAAM,GACZ,IAAKv5B,EAAI,EAAGA,EAAIqpC,EAAGrpC,IAAK,CACtB,MAAMi5B,EAAM,GACZ,IAAKl5B,EAAI,EAAGA,EAAIqpC,EAAGrpC,IACjBk5B,EAAIh5B,KAAKkpC,EAAIppC,GAAGC,IAElBu5B,EAAIt5B,KAAKg5B,EACX,CACA,OAAOM,CACT,CCRO,SAAS+P,GAAqB7gB,GACnC,IAAK,IAAI1oB,EAAI,EAAGA,EAAI0oB,EAAMzpB,OAAQe,IAChC,GAAIsf,EAAaoJ,EAAM1oB,IACrB,OAAO,EAGX,OAAO,CACT,CASO,SAASqkC,GAAa3b,EAAOja,GAC9B4Q,EAASqJ,GACXA,EAAMtmB,SAAQ1D,GAAK+P,EAAS/P,KAAI,GAAO,GAEvC8qC,GAAiB9gB,EAAOja,GAAU,EAEtC,CAcO,SAASw1B,GAASvb,EAAOja,EAAU0vB,GACxC,IAAKA,EACH,OAAI9e,EAASqJ,GACJA,EAAM9gB,KAAIlJ,GAAK+P,EAAS/P,KAAI,GAAO,GAEnC+qC,GAAa/gB,EAAOja,GAAU,GAGzC,MAAMi7B,EAAqBhrC,GAAY,IAANA,EAAUA,EAAI+P,EAAS/P,GACxD,OAAI2gB,EAASqJ,GACJA,EAAM9gB,KAAIlJ,GAAKgrC,EAAkBhrC,KAAI,GAAO,GAE5C+qC,GAAa/gB,EAAOghB,GAAmB,EAElD,CAWO,SAAS9H,GAAQwH,EAAKvJ,EAAKpxB,GAChC,MAAM0P,EAAOxa,MAAMC,QAAQwlC,GAAOzJ,GAAUyJ,GAAOA,EAAIjrB,OACvD,GAAI0hB,EAAM,GAAMA,GAAO1hB,EAAKlf,OAE1B,MAAM,IAAIygC,GAAWG,EAAK1hB,EAAKlf,QAGjC,OAAIogB,EAAS+pB,GACJA,EAAI/lC,OAAOsmC,GAAQP,EAAI1rB,UAAWmiB,EAAKpxB,GAAW26B,EAAItL,YAEtD6L,GAAQP,EAAKvJ,EAAKpxB,EAE7B,CAUA,SAASk7B,GAASP,EAAKvJ,EAAKpxB,GAC1B,IAAIzO,EAAGw5B,EAAKoQ,EAAKC,EAEjB,GAAIhK,GAAO,EAAG,CACZ,GAAKl8B,MAAMC,QAAQwlC,EAAI,IAMhB,CAGL,IAFAS,EAAOV,GAAQC,GACf5P,EAAM,GACDx5B,EAAI,EAAGA,EAAI6pC,EAAK5qC,OAAQe,IAC3Bw5B,EAAIx5B,GAAK2pC,GAAQE,EAAK7pC,GAAI6/B,EAAM,EAAGpxB,GAErC,OAAO+qB,CACT,CAXE,IADAoQ,EAAMR,EAAI,GACLppC,EAAI,EAAGA,EAAIopC,EAAInqC,OAAQe,IAC1B4pC,EAAMn7B,EAASm7B,EAAKR,EAAIppC,IAE1B,OAAO4pC,CASX,CAEE,IADApQ,EAAM,GACDx5B,EAAI,EAAGA,EAAIopC,EAAInqC,OAAQe,IAC1Bw5B,EAAIx5B,GAAK2pC,GAAQP,EAAIppC,GAAI6/B,EAAM,EAAGpxB,GAEpC,OAAO+qB,CAEX,CAGO,SAASsQ,GAASjyB,EAAG5X,EAAGpB,EAAGH,EAAGm4B,EAAGkT,EAAMC,EAAQ5qC,EAAG6qC,EAASC,EAAQxkC,GAExE,MAAMykC,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KAGf,IAAIxrC,EAAGyrC,EAAIC,EAAI1qC,EAGf,GAAItB,EAEF,IAAK+rC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIqqC,EAAOrrC,GAEPH,EAAEmB,KAAO+pC,GAEXlrC,EAAEmB,GAAK+pC,EAEPC,EAAO9pC,KAAKF,GAERkqC,GAEFxrC,EAAEsB,GAAKiqC,EAAU7qC,EAAE+qC,EAAQnrC,GAAI0G,GAAStG,EAAEsG,EAAOykC,EAAQnrC,IAEzD63B,EAAE72B,GAAK+pC,GAGPrrC,EAAEsB,GAAKmqC,EAAQnrC,KAIjBN,EAAEsB,GAAKiqC,EAAU7qC,EAAE+qC,EAAQnrC,GAAIN,EAAEsB,IAAMZ,EAAEV,EAAEsB,GAAImqC,EAAQnrC,IAEvD63B,EAAE72B,GAAK+pC,QAKX,IAAKU,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIqqC,EAAOrrC,GAEPH,EAAEmB,KAAO+pC,GAEXlrC,EAAEmB,GAAK+pC,EAEPC,EAAO9pC,KAAKF,IAGZ62B,EAAE72B,GAAK+pC,CAIf,CC7KA,MAAMtmC,GAAO,YAGAknC,GAAkC9sC,GAAQ4F,GAFlC,CAAC,UAEqDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA8BnF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ+mB,GAER3iB,UAAW,SAAUvpB,GACnB,OAAOA,EAAEmyB,OACX,EAEAga,OAAQ,SAAUnsC,GAChB,OAAO,CACT,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAe,KAARA,EAAEK,CACX,EAEA,iBAAkBoF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICnDE2jB,GAAK,SAOJ,SAASsX,GAAkBpsC,GAChC,OAAOA,EAAI,CACb,CAGO,SAASqsC,GAAkBrsC,GAChC,OAAOA,EAAI,CACb,CAQO,SAASssC,GAAatsC,GAC3B,OAAO6pB,OAAOzM,MAAMpd,EACtB,CCVO,SAASwoB,GAAarP,EAAGD,GAA8B,IAA3BuP,EAAMxmB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,KAAMymB,EAAMzmB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACzD,GAAIwmB,GAAU,EACZ,MAAM,IAAI5S,MAAM,6CAGlB,GAAI6S,EAAS,EACX,MAAM,IAAI7S,MAAM,yCAGlB,OAAIsD,EAAEiE,UAAWlE,EAAEkE,UAIdjE,EAAE2L,YAAe5L,EAAE4L,aAIpB3L,EAAEyW,GAAG1W,IAIFC,EAAE+V,MAAMhW,GAAGkO,MAAMmK,IAAIpY,EAAEtU,YAAYqI,IAAIiM,EAAEtU,YAAYqI,IAAIiM,EAAEiO,MAAOlO,EAAEkO,OAAO6M,IAAIxL,GAASC,IAPtFvP,EAAEyW,GAAG1W,GAQhB,CD1BAkzB,GAAiB7kC,UAAYutB,GAK7BuX,GAAiB9kC,UAAYutB,GAU7BwX,GAAY/kC,UAAYutB,GErBxB,MAAM/vB,GAAO,aAGAwnC,GAAmCptC,GAAQ4F,GAFnC,CAAC,QAAS,WAE6ClC,IAAuB,IAAtB,MAAE4C,EAAK,OAAEyf,GAAQriB,EA8B5F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQnlB,IAAKwoB,GAAYxoB,EAAG,EAAGklB,EAAOuD,OAAQvD,EAAOwD,SAAkB0jB,GAAiBpsC,GAExFupB,UAAWvpB,IAAKwsC,GAAexsC,EAAG,IAAIA,EAAE6E,YAAY,GAAIqgB,EAAOuD,OAAQvD,EAAOwD,SAE1E1oB,EAAEmxB,UAAYnxB,EAAE6uB,WAAa7uB,EAAEod,QAEnC+uB,OAAQnsC,GAAKA,EAAI,GAEjB0pB,SAAU1pB,GAAKA,EAAEyJ,EAAI,GAErBgjC,KAAMhnC,EAAM6L,aAAYH,GACtBnR,GAAKyF,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,SAEzC,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICnDEpM,GAAO,YAGA4nC,GAAkCxtC,GAAQ4F,GAFlC,CAAC,UAEqDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA+BnF,OAAO4C,EAAMV,GAAM,CACjB,mDAAoD6nC,KAAM,EAC1D,oDAAqDC,KAAM,EAC3D,iBAAkBpnC,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICvCEpM,GAAO,kBAGA+nC,GAAwC3tC,GAAQ4F,GAFxC,CAAC,QAAS,cAEkDlC,IAA0B,IAAzB,MAAE4C,EAAK,UAAEsnC,GAAWlqC,EAiCpG,OAAO4C,EAAMV,GAAM,CACjBioC,QAASA,KAAM,EACfC,OAAQ,SAAUjtC,GAChB,OAAOA,EAAE0J,OAAOnJ,OAAS,IAAM6c,MAAMyM,OAAO7pB,GAC9C,EACAuqC,IAAK,SAAUvqC,GACb,OAAO+sC,EAAU/sC,EACnB,GACA,ICxCE+E,GAAO,aAGAmoC,GAAmC/tC,GAAQ4F,GAFnC,CAAC,QAAS,WAE6ClC,IAAuB,IAAtB,MAAE4C,EAAK,OAAEyf,GAAQriB,EAgC5F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQnlB,IAAKwoB,GAAYxoB,EAAG,EAAGklB,EAAOuD,OAAQvD,EAAOwD,SAAkB2jB,GAAiBrsC,GAExFupB,UAAWvpB,KACTwsC,GAAexsC,EAAG,IAAIA,EAAE6E,YAAY,GAAIqgB,EAAOuD,OAAQvD,EAAOwD,SAEzD1oB,EAAEmxB,SAAYnxB,EAAE6uB,UAAa7uB,EAAEod,SAEtC+uB,OAAQnsC,GAAKA,EAAI,GAEjB0pB,SAAU1pB,GAAKA,EAAEyJ,EAAI,IAAMzJ,EAAE6D,EAAI,GAEjC4oC,KAAMhnC,EAAM6L,aAAYH,GACtBnR,GAAKyF,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,SAEzC,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICtDEpM,GAAO,SAGAooC,GAA+BhuC,GAAQ4F,GAF/B,CAAC,QAAS,gBAEyClC,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAkC7F,OAAO4C,EAAMV,GAAM,CACjB,0CAA2C/E,GAAKotC,EAAYptC,EAAG,GAE/DmsC,OAAQnsC,GAAW,KAANA,EAEbysC,KAAMhnC,EAAM6L,aAAYH,GACtBnR,GAAKyF,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,SAEzC,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC7CEpM,GAAO,QAGAsoC,GAA8BluC,GAAQ4F,GAF9B,CAAC,UAEiDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA8B/E,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQmnB,GAER/iB,UAAW,SAAUvpB,GACnB,OAAOA,EAAEod,OACX,EAEA+uB,OAAQ,SAAUnsC,GAChB,OAAO,CACT,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAO,CACT,EAEAwpB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEod,OACX,EAEAqvB,KAAM,SAAUzsC,GACd,OAAO6pB,OAAOzM,MAAMpd,EAAEgH,MACxB,EAEA,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC1DEpM,GAAO,SAGAuoC,GAA+BnuC,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAsDhF,OAAO4C,EAAMV,GAAM,CACjBwlC,IAAKjD,IACL,IC5DSiG,GAAqCpuC,GAChD,eAAgB,CAAC,UAAU0D,IAAA,IAAC,MAAE4C,GAAO5C,EAAA,MAAM,CACzC,aAAc4C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAC1C,IAAKD,EAAEwtC,UAAUvtC,GACf,MAAM,IAAI4V,MAAM,4CAElB,OAAOpQ,EAAMwR,KAAK9F,EAAM,CAACnR,EAAE0sC,YAAazsC,EAAEysC,aAAnCjnC,CAAiDzF,EAAEgH,MAAO/G,EAAE+G,MAAM,IAE5E,ICJGjC,GAAO,cAGA0oC,GAAoCtuC,GAAQ4F,GAFpC,CAAC,QAAS,WAE8ClC,IAAuB,IAAtB,MAAE4C,EAAK,OAAEyf,GAAQriB,EAC7F,MAAM6qC,EAAeH,GAAmB,CAAE9nC,UAU1C,OAAOA,EAAMV,GAAM,CAEjB,mBAAoB,SAAU/E,EAAGC,GAC/B,OAAOD,IAAMC,CACf,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OACjD,EAEA,uBAAwB,SAAU1oB,EAAGC,GACnC,OAAOD,EAAE4vB,GAAG3vB,IAAMusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAC/D,EAEA,iBAAkB,SAAU1oB,EAAGC,GAC7B,OAAOD,IAAMC,CACf,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOD,EAAEmwB,OAAOlwB,EAClB,EAEA,mBAAoB,SAAUD,EAAGC,GAC/B,OChCC,SAAwBD,EAAGC,EAAGwoB,EAAQC,GAC3C,OAAOF,GAAYxoB,EAAEoc,GAAInc,EAAEmc,GAAIqM,EAAQC,IAAWF,GAAYxoB,EAAEo6B,GAAIn6B,EAAEm6B,GAAI3R,EAAQC,EACpF,CD8BailB,CAAc3tC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OACnD,GACCglB,EAAa,IE7BLE,IFgC0BzuC,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EAC1F,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OACjD,GACA,IErCmDvpB,GAP1C,eACQ,CACnB,QACA,cACA,WAGiF0D,IAAoC,IAAnC,MAAE4C,EAAK,YAAE2nC,EAAW,OAAElO,GAAQr8B,EAOhH,SAASirC,EAAc/pC,EAAMq7B,GAC3B,KAAM5/B,gBAAgBsuC,GAAiB,MAAM,IAAI5iC,YAAY,oDAC7D,GAAIk0B,IAAa1e,EAAS0e,GAAa,MAAM,IAAIvpB,MAAM,qBAAuBupB,GAE9E,GAAIze,EAAS5c,IA0Bf,SAA4BmmB,EAAQhoB,EAAQk9B,GAEtB,iBAAhBl9B,EAAO2D,MAETqkB,EAAOwhB,QAAUxpC,EAAOwpC,QAAUzoB,GAAM/gB,EAAOwpC,cAAW5oC,EAC1DonB,EAAO0hB,OAAS3oB,GAAM/gB,EAAO0pC,QAC7B1hB,EAAO4hB,KAAO7oB,GAAM/gB,EAAO4pC,MAC3B5hB,EAAOuX,MAAQxe,GAAM/gB,EAAOu/B,OAC5BvX,EAAO2d,UAAYzI,GAAYl9B,EAAO2lC,WAGtCkG,EAAiB7jB,EAAQhoB,EAAO8c,UAAWogB,GAAYl9B,EAAO2lC,UAElE,CArCImG,CAAkBxuC,KAAMuE,EAAMq7B,QACzB,GAAIr7B,GAAQmB,EAAQnB,EAAKJ,QAAUuB,EAAQnB,EAAKkqC,MAAQ/oC,EAAQnB,EAAK0b,MAE1EjgB,KAAKksC,QAAU3nC,EAAKub,OACpB9f,KAAKosC,OAAS7nC,EAAKJ,MACnBnE,KAAKssC,KAAO/nC,EAAKkqC,IACjBzuC,KAAKiiC,MAAQ19B,EAAK0b,KAClBjgB,KAAKqoC,UAAYzI,GAAYr7B,EAAKq7B,cAC7B,GAAIl6B,EAAQnB,GAEjBgqC,EAAiBvuC,KAAMuE,EAAMq7B,OACxB,IAAIr7B,EAET,MAAM,IAAImC,UAAU,6BAA+B8c,GAAOjf,GAAQ,KAGlEvE,KAAKksC,QAAU,GACflsC,KAAKosC,OAAS,GACdpsC,KAAKssC,KAAO,CAAC,GACbtsC,KAAKiiC,MAAQ,CAAC,EAAG,GACjBjiC,KAAKqoC,UAAYzI,CACnB,CACF,CAiBA,SAAS2O,EAAkB7jB,EAAQnmB,EAAMq7B,GAEvClV,EAAOwhB,QAAU,GACjBxhB,EAAO0hB,OAAS,GAChB1hB,EAAO4hB,KAAO,GACd5hB,EAAO2d,UAAYzI,EAEnB,MAAMuK,EAAO5lC,EAAKxD,OAClB,IAAIspC,EAAU,EAGVja,EAAKwd,EAELc,EAAO,EAUX,GARIxtB,EAAS0e,KAEXxP,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAAChO,EAAUA,KAAcgO,EAEtDc,EAAOzoC,EAAM8J,QAAQ,EAAG6vB,IAItBuK,EAAO,EAAG,CAEZ,IAAIpoC,EAAI,EACR,EAAG,CAED2oB,EAAO4hB,KAAKtqC,KAAK0oB,EAAO0hB,OAAOrrC,QAE/B,IAAK,IAAIe,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAK,CAE7B,MAAMsoC,EAAM7lC,EAAKzC,GAEjB,GAAI4D,EAAQ0kC,IAIV,GAFU,IAANroC,GAAWsoC,EAAUD,EAAIrpC,SAAUspC,EAAUD,EAAIrpC,QAEjDgB,EAAIqoC,EAAIrpC,OAAQ,CAElB,MAAMH,EAAIwpC,EAAIroC,GAETquB,EAAGxvB,EAAG8tC,KAEThkB,EAAOwhB,QAAQlqC,KAAKpB,GAEpB8pB,EAAO0hB,OAAOpqC,KAAKF,GAEvB,OAGU,IAANC,GAAWsoC,EAAU,IAAKA,EAAU,GAEnCja,EAAGga,EAAKsE,KAEXhkB,EAAOwhB,QAAQlqC,KAAKooC,GAEpB1f,EAAO0hB,OAAOpqC,KAAKF,GAGzB,CAEAC,GACF,OACOA,EAAIsoC,EACb,CAEA3f,EAAO4hB,KAAKtqC,KAAK0oB,EAAO0hB,OAAOrrC,QAE/B2pB,EAAOuX,MAAQ,CAACkI,EAAME,EACxB,CA+XA,SAASsE,EAAgB7sC,EAAG8sC,EAAKC,EAAQ1qC,GAEvC,GAAI0qC,EAASD,GAAQ,EAAK,OAAOC,EAEjC,IAAK,IAAI9yB,EAAI6yB,EAAK7yB,EAAI8yB,EAAQ9yB,IAE5B,GAAI5X,EAAM4X,KAAOja,EAAK,OAAOia,EAG/B,OAAO6yB,CACT,CAUA,SAASE,EAAShuC,EAAGgB,EAAGC,EAAGnB,EAAGkf,EAAQ3b,EAAOsqC,GAE3C3uB,EAAOzH,OAAOvX,EAAG,EAAGF,GAEpBuD,EAAMkU,OAAOvX,EAAG,EAAGgB,GAEnB,IAAK,IAAItB,EAAIuB,EAAI,EAAGvB,EAAIiuC,EAAI1tC,OAAQP,IAAOiuC,EAAIjuC,IACjD,CA8CA,SAASiiC,EAAS/X,EAAQyf,EAAME,EAAS1gB,GAEvC,IAAIniB,EAAQmiB,GAAgB,EAGxByG,EAAKwd,EAELc,EAAO,EAEPxtB,EAASwJ,EAAO2d,aAElBjY,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACljB,EAAO2d,UAAW3d,EAAO2d,aAAeuF,EAEtEc,EAAOzoC,EAAM8J,QAAQ,EAAG2a,EAAO2d,WAE/B7gC,EAAQvB,EAAM8J,QAAQvI,EAAOkjB,EAAO2d,YAItC,MAAM0G,GAAO3e,EAAG5oB,EAAOknC,GAGjB3yB,EAAI2O,EAAOuX,MAAM,GACvB,IAEIngC,EAAGC,EAAGjB,EAFN4D,EAAIgmB,EAAOuX,MAAM,GAKrB,GAAIoI,EAAU3lC,EAAG,CAEf,IAAK3C,EAAI2C,EAAG3C,EAAIsoC,EAAStoC,IAIvB,GAFA2oB,EAAO4hB,KAAKvqC,GAAK2oB,EAAOwhB,QAAQnrC,OAE5BguC,EAEF,IAAKjtC,EAAI,EAAGA,EAAIia,EAAGja,IAEjB4oB,EAAOwhB,QAAQlqC,KAAKwF,GAEpBkjB,EAAO0hB,OAAOpqC,KAAKF,GAKzB4oB,EAAO4hB,KAAKjC,GAAW3f,EAAOwhB,QAAQnrC,MACxC,MAAWspC,EAAU3lC,IAEnBgmB,EAAO4hB,KAAKj0B,OAAOgyB,EAAU,EAAG3lC,EAAI2lC,GAEpC3f,EAAOwhB,QAAQ7zB,OAAOqS,EAAO4hB,KAAKjC,GAAU3f,EAAOwhB,QAAQnrC,QAC3D2pB,EAAO0hB,OAAO/zB,OAAOqS,EAAO4hB,KAAKjC,GAAU3f,EAAO0hB,OAAOrrC,SAM3D,GAHA2D,EAAI2lC,EAGAF,EAAOpuB,GAET,GAAIgzB,EAAK,CAEP,IAAI1qC,EAAI,EAER,IAAKtC,EAAI,EAAGA,EAAI2C,EAAG3C,IAAK,CAEtB2oB,EAAO4hB,KAAKvqC,GAAK2oB,EAAO4hB,KAAKvqC,GAAKsC,EAElCvD,EAAI4pB,EAAO4hB,KAAKvqC,EAAI,GAAKsC,EAEzB,IAAIsF,EAAI,EAER,IAAK7H,EAAIia,EAAGja,EAAIqoC,EAAMroC,IAAK6H,IAEzB+gB,EAAOwhB,QAAQ7zB,OAAOvX,EAAI6I,EAAG,EAAGnC,GAEhCkjB,EAAO0hB,OAAO/zB,OAAOvX,EAAI6I,EAAG,EAAG7H,GAE/BuC,GAEJ,CAEAqmB,EAAO4hB,KAAK5nC,GAAKgmB,EAAOwhB,QAAQnrC,MAClC,OACK,GAAIopC,EAAOpuB,EAAG,CAEnB,IAAIlb,EAAI,EAER,IAAKkB,EAAI,EAAGA,EAAI2C,EAAG3C,IAAK,CAEtB2oB,EAAO4hB,KAAKvqC,GAAK2oB,EAAO4hB,KAAKvqC,GAAKlB,EAElC,MAAM0rC,EAAK7hB,EAAO4hB,KAAKvqC,GACjByqC,EAAK9hB,EAAO4hB,KAAKvqC,EAAI,GAAKlB,EAEhC,IAAKC,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnBgB,EAAI4oB,EAAO0hB,OAAOtrC,GAEdgB,EAAIqoC,EAAO,IAEbzf,EAAOwhB,QAAQ7zB,OAAOvX,EAAG,GAEzB4pB,EAAO0hB,OAAO/zB,OAAOvX,EAAG,GAExBD,IAGN,CAEA6pB,EAAO4hB,KAAKvqC,GAAK2oB,EAAOwhB,QAAQnrC,MAClC,CAKA,OAHA2pB,EAAOuX,MAAM,GAAKkI,EAClBzf,EAAOuX,MAAM,GAAKoI,EAEX3f,CACT,CAyUA,SAASskB,EAAUlvB,EAAQ3b,EAAOsqC,EAAKxuB,EAAMhf,GAE3C,MAAMkpC,EAAOlqB,EAAK,GACZoqB,EAAUpqB,EAAK,GAEftG,EAAI,GAEV,IAAI7X,EAAGC,EAEP,IAAKD,EAAI,EAAGA,EAAIqoC,EAAMroC,IAEpB,IADA6X,EAAE7X,GAAK,GACFC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAO4X,EAAE7X,GAAGC,GAAK,EAI5C,IAAKA,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5B,MAAMwqC,EAAKkC,EAAI1sC,GACTyqC,EAAKiC,EAAI1sC,EAAI,GAEnB,IAAK,IAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEvBgB,EAAIqC,EAAMrD,GAEV6Y,EAAE7X,GAAGC,GAAK+d,EAAU7e,EAAOwiB,GAAM3D,EAAOhf,IAAMgf,EAAOhf,GAAM,CAE/D,CACA,OAAO6Y,CACT,CAgYA,OA/xCA20B,EAAa1rC,UAAY,IAAI88B,EAK7B4O,EAAa1rC,UAAUqsC,mBAAqB,SAAU1qC,EAAMq7B,GAC1D,OAAO,IAAI0O,EAAa/pC,EAAMq7B,EAChC,EAKAt9B,OAAOwT,eAAew4B,EAAc,OAAQ,CAAE9mC,MAAO,iBACrD8mC,EAAa1rC,UAAUyC,YAAcipC,EACrCA,EAAa1rC,UAAUyD,KAAO,eAC9BioC,EAAa1rC,UAAU0e,gBAAiB,EAWxCgtB,EAAa1rC,UAAU+lC,YAAc,WACnC,OAAOhE,GAAiB3kC,KAAKksC,QAAS1oB,GACxC,EAWA8qB,EAAa1rC,UAAU+8B,QAAU,WAC/B,MAAO,QACT,EAWA2O,EAAa1rC,UAAUg9B,SAAW,WAChC,OAAO5/B,KAAKqoC,SACd,EAQAiG,EAAa1rC,UAAUuC,OAAS,SAAUZ,EAAMq7B,GAC9C,OAAO,IAAI0O,EAAa/pC,EAAMq7B,EAChC,EAWA0O,EAAa1rC,UAAUssC,QAAU,WAE/B,MAAM/E,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GAE3B,OAAgB,IAATkI,GAA0B,IAAZE,EAAiBrqC,KAAKosC,OAAOrrC,QAAUopC,EAAOE,GAAY,CACjF,EAgBAiE,EAAa1rC,UAAUi9B,OAAS,SAAU17B,EAAO27B,EAAanW,GAC5D,IAAK3pB,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,iDAGrC,OAAQ5T,UAAU1B,QAChB,KAAK,EACH,OAYN,SAAqB2pB,EAAQykB,GAE3B,IAAK3tB,EAAQ2tB,GACX,MAAM,IAAIzoC,UAAU,iBAItB,GADiByoC,EAAIvG,WAGnB,OAAOle,EAAOpkB,IAAI6oC,EAAI5hC,OAGxB,MAAM0S,EAAOkvB,EAAIlvB,OACjB,GAAIA,EAAKlf,SAAW2pB,EAAOuX,MAAMlhC,OAC/B,MAAM,IAAIsgC,GAAephB,EAAKlf,OAAQ2pB,EAAOuX,MAAMlhC,QAIrD,IAAIe,EAAG8O,EAAI9P,EAAGsuC,EAGd,MAAM7hC,EAAM4hC,EAAI5hC,MACVG,EAAMyhC,EAAIzhC,MAChB,IAAK5L,EAAI,EAAG8O,EAAK8Z,EAAOuX,MAAMlhC,OAAQe,EAAI8O,EAAI9O,IAC5CsgC,GAAc70B,EAAIzL,GAAI4oB,EAAOuX,MAAMngC,IACnCsgC,GAAc10B,EAAI5L,GAAI4oB,EAAOuX,MAAMngC,IAIrC,MAAMutC,EAAU3kB,EAAOwhB,QACjBoD,EAAS5kB,EAAO0hB,OAChBmD,EAAO7kB,EAAO4hB,KAGdnC,EAAOgF,EAAI5M,UAAU,GACrB8H,EAAU8E,EAAI5M,UAAU,GAGxB5hC,EAAI,GACJ6uC,EAAK,GAGXrF,EAAKjmC,SAAQ,SAAUpC,EAAGia,GAExByzB,EAAG1tC,GAAKia,EAAE,GAEVpb,EAAEmB,IAAK,CACT,IAGA,MAAMge,EAASuvB,EAAU,QAAK/rC,EACxBa,EAAQ,GACRsqC,EAAM,GAuBZ,OApBApE,EAAQnmC,SAAQ,SAAUnC,GAIxB,IAFA0sC,EAAIzsC,KAAKmC,EAAMpD,QAEVD,EAAIyuC,EAAKxtC,GAAIqtC,EAAKG,EAAKxtC,EAAI,GAAIjB,EAAIsuC,EAAItuC,IAE1CgB,EAAIwtC,EAAOxuC,IAEE,IAATH,EAAEmB,KAEJqC,EAAMnC,KAAKwtC,EAAG1tC,IAEVge,GAAUA,EAAO9d,KAAKqtC,EAAQvuC,IAGxC,IAEA2tC,EAAIzsC,KAAKmC,EAAMpD,QAGR,IAAIutC,EAAa,CACtBxuB,SACA3b,QACAsqC,MACAxuB,OACA2f,SAAUlV,EAAO2d,WAErB,CA9FaoH,CAAWzvC,KAAMmE,GAG1B,KAAK,EACL,KAAK,EACH,OA2FN,SAAqBumB,EAAQvmB,EAAO2kC,EAAWnf,GAE7C,IAAKxlB,IAA2B,IAAlBA,EAAMqd,QAClB,MAAM,IAAI9a,UAAU,iBAItB,MAAM2iC,EAAQllC,EAAM8b,OACd2oB,EAAWzkC,EAAMykC,WAGvB,IAAIU,EAYJ,GAXInoB,EAAS2nB,IAEXQ,EAAQR,EAAU7oB,OAElB6oB,EAAYA,EAAUtJ,WAGtB8J,EAAQ7H,GAAUqH,GAIhBF,EAAU,CAEZ,GAAqB,IAAjBU,EAAMvoC,OACR,MAAM,IAAI2F,UAAU,mBAGtBgkB,EAAOzjB,IAAI9C,EAAMoJ,MAAOu7B,EAAWnf,EACrC,KAAO,CAEL,GAAqB,IAAjB0f,EAAMtoC,QAAiC,IAAjBsoC,EAAMtoC,OAC9B,MAAM,IAAIsgC,GAAegI,EAAMtoC,OAAQ2pB,EAAOuX,MAAMlhC,OAAQ,KAI9D,GAAIuoC,EAAMvoC,OAASsoC,EAAMtoC,OAAQ,CAE/B,IAAIe,EAAI,EACJiiC,EAAQ,EACZ,KAAoB,IAAbsF,EAAMvnC,IAAyB,IAAbwnC,EAAMxnC,IAC7BA,IAEF,KAAoB,IAAbunC,EAAMvnC,IACXiiC,IACAjiC,IAGFgnC,EAAYhF,GAAUgF,EAAWO,EAAMtoC,OAAQgjC,EAAOuF,EACxD,CAGA,IAAKzlB,GAAgBwlB,EAAOC,GAC1B,MAAM,IAAIjI,GAAegI,EAAOC,EAAO,KAIzC,GAAqB,IAAjBD,EAAMtoC,OAEMoD,EAAMo+B,UAAU,GACxBr+B,SAAQ,SAAUwrC,EAAWC,GACjCvN,GAAcsN,GACdhlB,EAAOzjB,IAAI,CAACyoC,EAAW,GAAI5G,EAAU6G,EAAS,IAAKhmB,EACrD,QACK,CAEL,MAAMimB,EAAsBzrC,EAAMo+B,UAAU,GACtCsN,EAAuB1rC,EAAMo+B,UAAU,GAC7CqN,EAAoB1rC,SAAQ,SAAU4rC,EAAgBC,GACpD3N,GAAc0N,GACdD,EAAqB3rC,SAAQ,SAAU8rC,EAAiBC,GACtD7N,GAAc4N,GACdtlB,EAAOzjB,IAAI,CAAC6oC,EAAgBE,GAAkBlH,EAAUiH,EAAc,IAAIE,EAAe,IAAKtmB,EAChG,GACF,GACF,CACF,CACA,OAAOe,CACT,CA1KawlB,CAAWlwC,KAAMmE,EAAO27B,EAAanW,GAE9C,QACE,MAAM,IAAIje,YAAY,6BAE5B,EA6KA4iC,EAAa1rC,UAAU0D,IAAM,SAAUnC,GACrC,IAAKuB,EAAQvB,GAAU,MAAM,IAAIuC,UAAU,kBAC3C,GAAIvC,EAAMpD,SAAWf,KAAKiiC,MAAMlhC,OAAU,MAAM,IAAIsgC,GAAel9B,EAAMpD,OAAQf,KAAKiiC,MAAMlhC,QAG5F,IAAKf,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,8CAGrC,MAAMvU,EAAIqC,EAAM,GACVpC,EAAIoC,EAAM,GAGhBi+B,GAActgC,EAAG9B,KAAKiiC,MAAM,IAC5BG,GAAcrgC,EAAG/B,KAAKiiC,MAAM,IAG5B,MAAMnhC,EAAI6tC,EAAe7sC,EAAG9B,KAAKssC,KAAKvqC,GAAI/B,KAAKssC,KAAKvqC,EAAI,GAAI/B,KAAKosC,QAEjE,OAAItrC,EAAId,KAAKssC,KAAKvqC,EAAI,IAAM/B,KAAKosC,OAAOtrC,KAAOgB,EAAY9B,KAAKksC,QAAQprC,GAEjE,CACT,EAYAwtC,EAAa1rC,UAAUqE,IAAM,SAAU9C,EAAOvD,EAAG+oB,GAC/C,IAAKjkB,EAAQvB,GAAU,MAAM,IAAIuC,UAAU,kBAC3C,GAAIvC,EAAMpD,SAAWf,KAAKiiC,MAAMlhC,OAAU,MAAM,IAAIsgC,GAAel9B,EAAMpD,OAAQf,KAAKiiC,MAAMlhC,QAG5F,IAAKf,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,8CAGrC,MAAMvU,EAAIqC,EAAM,GACVpC,EAAIoC,EAAM,GAGhB,IAAIgmC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GAGrB7R,EAAKwd,EAELc,EAAO,EAEPxtB,EAASlhB,KAAKqoC,aAEhBjY,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAAC5tC,KAAKqoC,UAAWroC,KAAKqoC,aAAeuF,EAElEc,EAAOzoC,EAAM8J,QAAQ,EAAG/P,KAAKqoC,aAI3BvmC,EAAIqoC,EAAO,GAAKpoC,EAAIsoC,EAAU,KAEhC5H,EAAQziC,KAAMsN,KAAKI,IAAI5L,EAAI,EAAGqoC,GAAO78B,KAAKI,IAAI3L,EAAI,EAAGsoC,GAAU1gB,GAE/DwgB,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,IAIvBG,GAActgC,EAAGqoC,GACjB/H,GAAcrgC,EAAGsoC,GAGjB,MAAMvpC,EAAI6tC,EAAe7sC,EAAG9B,KAAKssC,KAAKvqC,GAAI/B,KAAKssC,KAAKvqC,EAAI,GAAI/B,KAAKosC,QAkBjE,OAhBItrC,EAAId,KAAKssC,KAAKvqC,EAAI,IAAM/B,KAAKosC,OAAOtrC,KAAOgB,EAExCsuB,EAAGxvB,EAAG8tC,GA6Bf,SAAkB5tC,EAAGiB,EAAG+d,EAAQ3b,EAAOsqC,GAErC3uB,EAAOzH,OAAOvX,EAAG,GACjBqD,EAAMkU,OAAOvX,EAAG,GAEhB,IAAK,IAAIN,EAAIuB,EAAI,EAAGvB,EAAIiuC,EAAI1tC,OAAQP,IAAOiuC,EAAIjuC,IACjD,CA9BM2vC,CAAQrvC,EAAGiB,EAAG/B,KAAKksC,QAASlsC,KAAKosC,OAAQpsC,KAAKssC,MAH9CtsC,KAAKksC,QAAQprC,GAAKF,EAMfwvB,EAAGxvB,EAAG8tC,IAETI,EAAQhuC,EAAGgB,EAAGC,EAAGnB,EAAGZ,KAAKksC,QAASlsC,KAAKosC,OAAQpsC,KAAKssC,MAIjDtsC,IACT,EA8CAsuC,EAAa1rC,UAAUm9B,OAAS,SAAU9f,EAAM0J,EAAc1oB,GAE5D,IAAKmgB,EAAanB,GAChB,MAAM,IAAIvZ,UAAU,4BAItB,MAAMkjC,EAAY3pB,EAAKT,UAAU9V,KAAIlC,GAC5B/B,MAAMC,QAAQ8B,IAA2B,IAAjBA,EAAMzG,OACjCyG,EAAM,GACNA,IAGN,GAAyB,IAArBoiC,EAAU7oC,OAAgB,MAAM,IAAIsV,MAAM,4CAa9C,OAVAuzB,EAAU1lC,SAAQ,SAAUsD,GAC1B,IAAKmZ,EAASnZ,KAAW6d,GAAU7d,IAAUA,EAAQ,EACnD,MAAM,IAAId,UAAU,uDACNogB,GAAO8iB,GAAa,IAEtC,IAKOnH,EAFGxhC,EAAOjB,KAAKyjB,QAAUzjB,KAEd4pC,EAAU,GAAIA,EAAU,GAAIjgB,EAChD,EAwIA2kB,EAAa1rC,UAAUo9B,QAAU,SAAU8C,EAAO7hC,GAEhD,IAAKyE,EAAQo9B,GAAU,MAAM,IAAIp8B,UAAU,kBAC3C,GAAqB,IAAjBo8B,EAAM/hC,OAAgB,MAAM,IAAIsV,MAAM,0DAG1CysB,EAAM5+B,SAAQ,SAAUsD,GACtB,IAAKmZ,EAASnZ,KAAW6d,GAAU7d,IAAUA,IAAU,GAAe,IAAVA,EAC1D,MAAM,IAAId,UAAU,6DACNogB,GAAOgc,GAAS,IAElC,IAEA,MAAME,EAAgBhjC,KAAKiiC,MAAM,GAAKjiC,KAAKiiC,MAAM,GAKjD,GAAIe,KAJJF,EAAQK,GAAqBL,EAAOE,IACZ,GAAKF,EAAM,GAIjC,MAAM,IAAIzsB,MAAM,uEAIlB,MAAM0Z,EAAI9uB,EAAOjB,KAAKyjB,QAAUzjB,KAGhC,GAAIA,KAAKiiC,MAAM,KAAOa,EAAM,IAAM9iC,KAAKiiC,MAAM,KAAOa,EAAM,GACxD,OAAO/S,EAIT,MAAMqgB,EAAW,GACjB,IAAK,IAAItuC,EAAI,EAAGA,EAAIiuB,EAAEuc,KAAKvrC,OAAQe,IACjC,IAAK,IAAIC,EAAI,EAAGA,EAAIguB,EAAEuc,KAAKxqC,EAAI,GAAKiuB,EAAEuc,KAAKxqC,GAAIC,IAC7CquC,EAASpuC,KAAKF,GAKlB,MAAMge,EAASiQ,EAAEmc,QAAQhqC,QAGnBmuC,EAAWtgB,EAAEqc,OAAOlqC,QAG1B,IAAK,IAAIJ,EAAI,EAAGA,EAAIiuB,EAAEqc,OAAOrrC,OAAQe,IAAK,CACxC,MAAMwuC,EAAKD,EAASvuC,GACdyuC,EAAKH,EAAStuC,GACdoiC,EAAOoM,EAAKvgB,EAAEkS,MAAM,GAAKsO,EAC/BH,EAAStuC,GAAKoiC,EAAOpB,EAAM,GAC3BuN,EAASvuC,GAAKwL,KAAKsM,MAAMsqB,EAAOpB,EAAM,GACxC,CASA/S,EAAEmc,QAAQnrC,OAAS,EACnBgvB,EAAEqc,OAAOrrC,OAAS,EAClBgvB,EAAEuc,KAAKvrC,OAAS+hC,EAAM,GAAK,EAC3B/S,EAAEkS,MAAQa,EAAM5gC,QAChB,IAAK,IAAIJ,EAAI,EAAGA,EAAIiuB,EAAEuc,KAAKvrC,OAAQe,IACjCiuB,EAAEuc,KAAKxqC,GAAK,EAKd,IAAK,IAAI0C,EAAI,EAAGA,EAAIsb,EAAO/e,OAAQyD,IAAK,CACtC,MAAM1C,EAAIuuC,EAAS7rC,GACbzC,EAAIquC,EAAS5rC,GACb5D,EAAIkf,EAAOtb,GAEjBsqC,EADUH,EAAe7sC,EAAGiuB,EAAEuc,KAAKvqC,GAAIguB,EAAEuc,KAAKvqC,EAAI,GAAIguB,EAAEqc,QAC7CtqC,EAAGC,EAAGnB,EAAGmvB,EAAEmc,QAASnc,EAAEqc,OAAQrc,EAAEuc,KAC7C,CAIA,OAAOvc,CACT,EAOAue,EAAa1rC,UAAU6gB,MAAQ,WAQ7B,OAPU,IAAI6qB,EAAa,CACzBxuB,OAAQ9f,KAAKksC,QAAUzoB,GAAMzjB,KAAKksC,cAAW5oC,EAC7Ca,MAAOsf,GAAMzjB,KAAKosC,QAClBqC,IAAKhrB,GAAMzjB,KAAKssC,MAChBrsB,KAAMwD,GAAMzjB,KAAKiiC,OACjBrC,SAAU5/B,KAAKqoC,WAGnB,EAOAiG,EAAa1rC,UAAUqd,KAAO,WAC5B,OAAOjgB,KAAKiiC,MAAM//B,MAAM,EAC1B,EAaAosC,EAAa1rC,UAAU8G,IAAM,SAAU6G,EAAU0vB,GAE/C,IAAKjgC,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,8CAErC,MAAMjW,EAAKJ,KAELmqC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GACrBwE,EAAeH,GAAiB/1B,EAAUnQ,EAAI,OAOpD,OAOF,SAAesqB,EAAQ8lB,EAAQC,EAAQC,EAAWC,EAAWpgC,EAAU0vB,GAErE,MAAMngB,EAAS,GACT3b,EAAQ,GACRsqC,EAAM,GAGZ,IAAIre,EAAKwd,EAELc,EAAO,EAEPxtB,EAASwJ,EAAO2d,aAElBjY,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACljB,EAAO2d,UAAW3d,EAAO2d,aAAeuF,EAEtEc,EAAOzoC,EAAM8J,QAAQ,EAAG2a,EAAO2d,YAIjC,MAAMuI,EAAS,SAAUhwC,EAAGJ,EAAGC,GAE7B,MAAM+G,EAjCO,SAAU5G,EAAGkB,EAAGC,GAE7B,OAAO0kC,EAAa3+B,GAAGlH,EAAG,CAACkB,EAAGC,GAAI3B,EACpC,CA8BgBmQ,CAAS3P,EAAGJ,EAAGC,GAExB2vB,EAAG5oB,EAAOknC,KAEb5uB,EAAO9d,KAAKwF,GAEZrD,EAAMnC,KAAKxB,GAEf,EAEA,IAAK,IAAIuB,EAtCsB,EAsCPA,GAAK4uC,EAAW5uC,IAAK,CAE3C0sC,EAAIzsC,KAAK8d,EAAO/e,QAEhB,MAAMwrC,EAAK7hB,EAAO4hB,KAAKvqC,GACjByqC,EAAK9hB,EAAO4hB,KAAKvqC,EAAI,GAE3B,GAAIk+B,EAEF,IAAK,IAAIn/B,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5B,MAAMgB,EAAI4oB,EAAO0hB,OAAOtrC,GAEpBgB,GAnDQ,GAmDOA,GAAK2uC,GAEtBG,EAAOlmB,EAAOwhB,QAAQprC,GAAIgB,EArDhB,EAqD4BC,EArDf,EAuD3B,KACK,CAEL,MAAM+d,EAAS,CAAC,EAChB,IAAK,IAAIhf,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEvBgf,EADU4K,EAAO0hB,OAAOtrC,IACZ4pB,EAAOwhB,QAAQprC,GAK7B,IAAK,IAAIgB,EAlEK,EAkEOA,GAAK2uC,EAAQ3uC,IAEhC8uC,EADe9uC,KAAKge,EAAUA,EAAOhe,GAAK,EAC5BA,EApEF,EAoEcC,EApED,EAsE7B,CACF,CAKA,OAFA0sC,EAAIzsC,KAAK8d,EAAO/e,QAET,IAAIutC,EAAa,CACtBxuB,SACA3b,QACAsqC,MACAxuB,KAAM,CAACwwB,EAhFS,EAgFS,EAAGE,EAhFC,EAgFuB,IAExD,CAlFSE,CAAK7wC,KAAM,EAAGmqC,EAAO,EAAG,EAAGE,EAAU,EAL7B,EAKwCpK,EACzD,EA6FAqO,EAAa1rC,UAAUsB,QAAU,SAAUqM,EAAU0vB,GAEnD,IAAKjgC,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,kDAErC,MAAMjW,EAAKJ,KAELmqC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GACrBwE,EAAeH,GAAiB/1B,EAAUnQ,EAAI,WAEpD,IAAK,IAAI2B,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAMwqC,EAAKvsC,KAAKssC,KAAKvqC,GACfyqC,EAAKxsC,KAAKssC,KAAKvqC,EAAI,GAEzB,GAAIk+B,EAEF,IAAK,IAAIn/B,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5B,MAAMgB,EAAI9B,KAAKosC,OAAOtrC,GAItB2lC,EAAa3+B,GAAG9H,KAAKksC,QAAQprC,GAAI,CAACgB,EAAGC,GAAI3B,EAC3C,KACK,CAEL,MAAM0f,EAAS,CAAC,EAChB,IAAK,IAAIhf,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEvBgf,EADU9f,KAAKosC,OAAOtrC,IACVd,KAAKksC,QAAQprC,GAK3B,IAAK,IAAIgB,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAK,CAC7B,MAAM0F,EAAS1F,KAAKge,EAAUA,EAAOhe,GAAK,EAC1C2kC,EAAa3+B,GAAGN,EAAO,CAAC1F,EAAGC,GAAI3B,EACjC,CACF,CACF,CACF,EAMAkuC,EAAa1rC,UAAU6b,OAAOmB,UAAY,YACxC,IAAK5f,KAAKksC,QAAW,MAAM,IAAI71B,MAAM,wCAErC,MAAMg0B,EAAUrqC,KAAKiiC,MAAM,GAE3B,IAAK,IAAIlgC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAChC,MAAMwqC,EAAKvsC,KAAKssC,KAAKvqC,GACfyqC,EAAKxsC,KAAKssC,KAAKvqC,EAAI,GAEzB,IAAK,IAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5B,MAAMgB,EAAI9B,KAAKosC,OAAOtrC,QAEf,CAAE0G,MAAOxH,KAAKksC,QAAQprC,GAAIqD,MAAO,CAACrC,EAAGC,GAC9C,CACF,CACF,EAOAusC,EAAa1rC,UAAU48B,QAAU,WAC/B,OAAOwP,EAAShvC,KAAKksC,QAASlsC,KAAKosC,OAAQpsC,KAAKssC,KAAMtsC,KAAKiiC,OAAO,EACpE,EAOAqM,EAAa1rC,UAAU4c,QAAU,WAC/B,OAAOwvB,EAAShvC,KAAKksC,QAASlsC,KAAKosC,OAAQpsC,KAAKssC,KAAMtsC,KAAKiiC,OAAO,EACpE,EAyCAqM,EAAa1rC,UAAUkkB,OAAS,SAAU9e,GAExC,MAAMmiC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GAErBiN,EAAUlvC,KAAKkvC,UAErB,IAAI9rC,EAAM,kBAAoB0jB,GAAOqjB,EAAMniC,GAAW,MAAQ8e,GAAOujB,EAASriC,GAAW,cAAgB8e,GAAOooB,EAASlnC,GAAW,KAEpI,IAAK,IAAIjG,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAMwqC,EAAKvsC,KAAKssC,KAAKvqC,GACfyqC,EAAKxsC,KAAKssC,KAAKvqC,EAAI,GAEzB,IAAK,IAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAIvBsC,GAAO,UAAY0jB,GAFT9mB,KAAKosC,OAAOtrC,GAEOkH,GAAW,KAAO8e,GAAO/kB,EAAGiG,GAAW,UAAYhI,KAAKksC,QAAUplB,GAAO9mB,KAAKksC,QAAQprC,GAAIkH,GAAW,IAEtI,CACA,OAAO5E,CACT,EAOAkrC,EAAa1rC,UAAUgQ,SAAW,WAChC,OAAOkU,GAAO9mB,KAAKw/B,UACrB,EAOA8O,EAAa1rC,UAAUmoB,OAAS,WAC9B,MAAO,CACLC,OAAQ,eACRlL,OAAQ9f,KAAKksC,QACb/nC,MAAOnE,KAAKosC,OACZqC,IAAKzuC,KAAKssC,KACVrsB,KAAMjgB,KAAKiiC,MACXrC,SAAU5/B,KAAKqoC,UAEnB,EAUAiG,EAAa1rC,UAAU2nC,SAAW,SAAUzpC,GAE1C,GAAIA,GAIF,GAFI8f,EAAY9f,KAAMA,EAAIA,EAAE2nB,aAEvB9H,EAAS7f,KAAOukB,GAAUvkB,GAC7B,MAAM,IAAI4F,UAAU,kDAItB5F,EAAI,EAGN,MAAM0pC,EAAS1pC,EAAI,EAAIA,EAAI,EACrB2pC,EAAO3pC,EAAI,GAAKA,EAAI,EAGpBqpC,EAAOnqC,KAAKiiC,MAAM,GAClBoI,EAAUrqC,KAAKiiC,MAAM,GAGrB59B,EAAIiJ,KAAKC,IAAI48B,EAAOM,EAAMJ,EAAUG,GAGpC1qB,EAAS,GACT3b,EAAQ,GACRsqC,EAAM,GAEZA,EAAI,GAAK,EAET,IAAK,IAAI1sC,EAAIyoC,EAAQzoC,EAAIsoC,GAAWvqB,EAAO/e,OAASsD,EAAGtC,IAAK,CAE1D,MAAMwqC,EAAKvsC,KAAKssC,KAAKvqC,GACfyqC,EAAKxsC,KAAKssC,KAAKvqC,EAAI,GAEzB,IAAK,IAAIvB,EAAI+rC,EAAI/rC,EAAIgsC,EAAIhsC,IAAK,CAE5B,MAAMsB,EAAI9B,KAAKosC,OAAO5rC,GAEtB,GAAIsB,IAAMC,EAAIyoC,EAASC,EAAM,CAE3B3qB,EAAO9d,KAAKhC,KAAKksC,QAAQ1rC,IAEzB2D,EAAM2b,EAAO/e,OAAS,GAAKe,EAAI2oC,EAE/B,KACF,CACF,CACF,CAIA,OAFAgE,EAAIzsC,KAAK8d,EAAO/e,QAET,IAAIutC,EAAa,CACtBxuB,SACA3b,QACAsqC,MACAxuB,KAAM,CAAC5b,EAAG,IAEd,EAUAiqC,EAAarjB,SAAW,SAAUC,GAChC,OAAO,IAAIojB,EAAapjB,EAC1B,EAcAojB,EAAa/D,SAAW,SAAUtqB,EAAMzY,EAAO1G,EAAG6oB,EAAciW,GAC9D,IAAKl6B,EAAQua,GAAS,MAAM,IAAIvZ,UAAU,kCAC1C,GAAoB,IAAhBuZ,EAAKlf,OAAgB,MAAM,IAAIsV,MAAM,4CAiBzC,GAdA4J,EAAOA,EAAKvW,KAAI,SAAUO,GAOxB,GALI2W,EAAY3W,KAEdA,EAAIA,EAAEwe,aAGH9H,EAAS1W,KAAOob,GAAUpb,IAAMA,EAAI,EACvC,MAAM,IAAIoM,MAAM,yCAElB,OAAOpM,CACT,IAGInJ,GAIF,GAFI8f,EAAY9f,KAAMA,EAAIA,EAAE2nB,aAEvB9H,EAAS7f,KAAOukB,GAAUvkB,GAC7B,MAAM,IAAI4F,UAAU,kDAItB5F,EAAI,EAIN,IAAIsvB,EAAKwd,EAELc,EAAO,EAEPxtB,EAAS0e,KAEXxP,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAAChO,EAAUA,KAAcgO,EAEtDc,EAAOzoC,EAAM8J,QAAQ,EAAG6vB,IAG1B,MAAM4K,EAAS1pC,EAAI,EAAIA,EAAI,EACrB2pC,EAAO3pC,EAAI,GAAKA,EAAI,EAGpBqpC,EAAOlqB,EAAK,GACZoqB,EAAUpqB,EAAK,GAGf5b,EAAIiJ,KAAKC,IAAI48B,EAAOM,EAAMJ,EAAUG,GAG1C,IAAIpmB,EAGJ,GAAI1e,EAAQ8B,GAAQ,CAElB,GAAIA,EAAMzG,SAAWsD,EAEnB,MAAM,IAAIgS,MAAM,8BAGlB+N,EAAS,SAAUtiB,GAEjB,OAAO0F,EAAM1F,EACf,CACF,MAAO,GAAIqf,EAAS3Z,GAAQ,CAE1B,MAAMkjC,EAAKljC,EAAMyY,OAEjB,GAAkB,IAAdyqB,EAAG3pC,QAAgB2pC,EAAG,KAAOrmC,EAE/B,MAAM,IAAIgS,MAAM,yBAGlB+N,EAAS,SAAUtiB,GAEjB,OAAO0F,EAAMlB,IAAI,CAACxE,GACpB,CACF,MAEEsiB,EAAS,WAEP,OAAO5c,CACT,EAIF,MAAMsY,EAAS,GACT3b,EAAQ,GACRsqC,EAAM,GAGZ,IAAK,IAAI1sC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC0sC,EAAIzsC,KAAK8d,EAAO/e,QAEhB,MAAMe,EAAIC,EAAIyoC,EAEd,GAAI1oC,GAAK,GAAKA,EAAIuC,EAAG,CAEnB,MAAMzD,EAAIwjB,EAAOtiB,GAEZsuB,EAAGxvB,EAAG8tC,KAETvqC,EAAMnC,KAAKF,EAAI2oC,GAEf3qB,EAAO9d,KAAKpB,GAEhB,CACF,CAIA,OAFA6tC,EAAIzsC,KAAK8d,EAAO/e,QAET,IAAIutC,EAAa,CACtBxuB,SACA3b,QACAsqC,MACAxuB,KAAM,CAACkqB,EAAME,IAEjB,EAWAiE,EAAa1rC,UAAU+nC,SAAW,SAAU7oC,EAAGC,GAE7C,KAAK4e,EAAS7e,IAAOujB,GAAUvjB,IAAO6e,EAAS5e,IAAOsjB,GAAUtjB,IAC9D,MAAM,IAAIsU,MAAM,uCAGlB,GAA0B,IAAtBrW,KAAKiiC,MAAMlhC,OACb,MAAM,IAAIsV,MAAM,4CASlB,OANA+rB,GAActgC,EAAG9B,KAAKiiC,MAAM,IAC5BG,GAAcrgC,EAAG/B,KAAKiiC,MAAM,IAG5BqM,EAAa1D,UAAU9oC,EAAGC,EAAG/B,KAAKiiC,MAAM,GAAIjiC,KAAKksC,QAASlsC,KAAKosC,OAAQpsC,KAAKssC,MAErEtsC,IACT,EAWAsuC,EAAawC,YAAc,SAAU/uC,EAAG+d,EAAQ3b,EAAOsqC,EAAKl+B,GAE1D,MAAMg8B,EAAKkC,EAAI1sC,GACTyqC,EAAKiC,EAAI1sC,EAAI,GAGnB,IAAK,IAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEvByP,EAASpM,EAAMrD,GAAIgf,EAAOhf,GAE9B,EAYAwtC,EAAa1D,UAAY,SAAUpqC,EAAGC,EAAG4pC,EAASvqB,EAAQ3b,EAAOsqC,GAE/D,IAAK,IAAI1sC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAMwqC,EAAKkC,EAAI1sC,GACTyqC,EAAKiC,EAAI1sC,EAAI,GAEbgvC,EAAKpC,EAAenuC,EAAG+rC,EAAIC,EAAIroC,GAE/B6sC,EAAKrC,EAAeluC,EAAG8rC,EAAIC,EAAIroC,GAErC,GAAI4sC,EAAKvE,GAAMwE,EAAKxE,GAAMroC,EAAM4sC,KAAQvwC,GAAK2D,EAAM6sC,KAAQvwC,GAEzD,GAAIqf,EAAQ,CACV,MAAMlf,EAAIkf,EAAOixB,GACjBjxB,EAAOixB,GAAMjxB,EAAOkxB,GACpBlxB,EAAOkxB,GAAMpwC,CACf,OAKF,GAAImwC,EAAKvE,GAAMroC,EAAM4sC,KAAQvwC,IAAMwwC,GAAMxE,GAAMroC,EAAM6sC,KAAQvwC,GAA7D,CAEE,MAAMwwC,EAAKnxB,EAASA,EAAOixB,QAAMztC,EAEjCa,EAAMkU,OAAO24B,EAAI,EAAGvwC,GAChBqf,GAAUA,EAAOzH,OAAO24B,EAAI,EAAGC,GAEnC9sC,EAAMkU,OAAO24B,GAAMD,EAAKA,EAAK,EAAIA,EAAI,GACjCjxB,GAAUA,EAAOzH,OAAO24B,GAAMD,EAAKA,EAAK,EAAIA,EAAI,EAGtD,MAEA,GAAIC,EAAKxE,GAAMroC,EAAM6sC,KAAQvwC,IAAMswC,GAAMvE,GAAMroC,EAAM4sC,KAAQvwC,GAAI,CAE/D,MAAM0wC,EAAKpxB,EAASA,EAAOkxB,QAAM1tC,EAEjCa,EAAMkU,OAAO04B,EAAI,EAAGvwC,GAChBsf,GAAUA,EAAOzH,OAAO04B,EAAI,EAAGG,GAEnC/sC,EAAMkU,OAAO04B,GAAMC,EAAKA,EAAK,EAAIA,EAAI,GACjClxB,GAAUA,EAAOzH,OAAO04B,GAAMC,EAAKA,EAAK,EAAIA,EAAI,EACtD,CACF,CACF,EAEO1C,CAAY,GAClB,CAAEnjB,SAAS,KCl4CDgmB,GAA+BxxC,GAvC/B,SACQ,CAAC,UAsCkD0D,IAAe,IAAd,MAAE4C,GAAO5C,EA0BhF,MAAMsiB,EAAS1f,EAAM,SAAU,CAC7B,GAAI,WACF,OAAO,CACT,EAEA0f,OAAQ,SAAUnlB,GAChB,OAAOA,CACT,EAEAitC,OAAQ,SAAUjtC,GAChB,GAAU,QAANA,EAAa,OAAO+tB,IACxB,MAAM6iB,EApEZ,SAAmCC,GACjC,MAAMC,EAA2BD,EAAM7oC,MAAM,0CAC7C,OAAI8oC,EAIK,CAAED,QAAOE,MAHD,CAAE,KAAM,EAAG,KAAM,EAAG,KAAM,IAAMD,EAAyB,IAGjDE,YAFHF,EAAyB,GAETG,eADbH,EAAyB,IAGzC,IAEX,CA0DoCI,CAAyBlxC,GACvD,GAAI4wC,EACF,OArDR,SAAwCO,GACtC,MAAMttC,EAAIiZ,SAASq0B,EAAMH,YAAaG,EAAMJ,OAC5C,IAAIrwC,EAAI,EACR,IAAK,IAAIY,EAAI,EAAGA,EAAI6vC,EAAMF,eAAe1wC,OAAQe,IAE/CZ,GADmBoc,SAASq0B,EAAMF,eAAe3vC,GAAI6vC,EAAMJ,OACzCjkC,KAAK4M,IAAIy3B,EAAMJ,MAAOzvC,EAAI,GAE9C,MAAML,EAAS4C,EAAInD,EACnB,GAAI0c,MAAMnc,GACR,MAAM,IAAIiK,YAAY,WAAaimC,EAAMN,MAAQ,2BAEnD,OAAO5vC,CACT,CAyCemwC,CAA8BR,GAEvC,IAAInxB,EAAO,EACX,MAAM4xB,EAAsBrxC,EAAEgI,MAAM,iCAChCqpC,IAGF5xB,EAAOoK,OAAOwnB,EAAoB,IAClCrxC,EAAIqxC,EAAoB,IAE1B,IAAIve,EAAMjJ,OAAO7pB,GACjB,GAAIod,MAAM0V,GACR,MAAM,IAAI5nB,YAAY,WAAalL,EAAI,2BAEzC,GAAIqxC,EAAqB,CAGvB,GAAIve,EAAM,GAAKrT,EAAO,EAEpB,MAAM,IAAIvU,YAAY,WAAWlL,sBAG/B8yB,GAAO,IAAMrT,EAAO,KACtBqT,GAAY,GAAKrT,EAErB,CACA,OAAOqT,CACT,EAEAvJ,UAAW,SAAUvpB,GACnB,OAAOA,EAAEioB,UACX,EAEAkkB,OAAQ,SAAUnsC,GAChB,OAAO6pB,OAAO7pB,EAChB,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAOA,EAAEgf,SACX,EAEAytB,KAAMhnC,EAAM6L,aAAYH,GAASnR,IAC/B,MAAMijB,EAAQjjB,EAAEijB,QAEhB,OADAA,EAAMjc,MAAQmK,EAAKnR,EAAEgH,OACdic,CAAK,IAGdquB,KAAM,SAAUtxC,GACd,OAAO,CACT,EAEA,sBAAuB,SAAUuxC,EAAMC,GACrC,OAAOD,EAAKtpB,SAASupB,EACvB,EAEA,iBAAkB/rC,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,OAY9D,OAJAgU,EAAOsF,SAAW,SAAUC,GAC1B,OAAOvN,WAAWuN,EAAK1jB,MACzB,EAEOme,CAAM,IC9IFssB,GAA+BtyC,GAH/B,SACQ,CAAC,UAEkD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAuBhF,MAAMspC,EAAS1mC,EAAM,SAAU,CAC7B,GAAI,WACF,OAAO,EACT,EAEA0mC,OAAQ,SAAUnsC,GAChB,OAAOA,CACT,EAEAmlB,OAAQ,SAAUnlB,GAChB,OAAOolB,OAAOplB,EAAE2mB,UAClB,EAEA4C,UAAW,SAAUvpB,GACnB,OAAOolB,OAAOplB,EAAE+kB,QAAQ3S,WAC1B,EAEAsX,SAAU,SAAU1pB,GAClB,OAAOolB,OAAOplB,EAAEgf,UAAU2H,UAC5B,EAEA,mBAAoB,SAAU3mB,GAC5B,OAAOolB,OAAOplB,EAChB,EAEAsxC,KAAM,SAAUtxC,GACd,OAAO,EACT,EAEA,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,OAY9D,OAJAg7B,EAAO1hB,SAAW,SAAUC,GAC1B,OAAOtF,OAAOsF,EAAK1jB,MACrB,EAEOmlC,CAAM,IClETpnC,GAAO,SAGA2sC,GAA+BvyC,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA0BhF,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,MAAO,EACT,EAEAogB,OAAQmB,GAERgrB,KAAM,SAAUtxC,GACd,MAAO,MACT,EAEAgtC,QAAS,SAAUhtC,GACjB,OAAOA,EAAI,EACb,EAEAitC,OAAQ,SAAUjtC,GAChB,OAAOA,CACT,EAEA,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,KAE5Do5B,IAAK,SAAUvqC,GACb,OAAOoD,OAAOpD,EAChB,GACA,ICtDE+E,GAAO,UAGA4sC,GAAgCxyC,GAAQ4F,GAFhC,CAAC,UAEmDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA4BjF,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,OAAO,CACT,EAEAioC,QAAS,SAAUhtC,GACjB,OAAOA,CACT,EAEAmlB,OAAQ,SAAUnlB,GAChB,QAASA,CACX,EAEAsxC,KAAM,SAAUtxC,GACd,OAAO,CACT,EAEAupB,UAAW,SAAUvpB,GACnB,OAAQA,EAAE6uB,QACZ,EAEAoe,OAAQ,SAAUjtC,GAEhB,MAAM4xC,EAAQ5xC,EAAEgG,cAChB,GAAc,SAAV4rC,EACF,OAAO,EACF,GAAc,UAAVA,EACT,OAAO,EAIT,MAAM9e,EAAMjJ,OAAO7pB,GACnB,GAAU,KAANA,IAAaod,MAAM0V,GACrB,QAASA,EAGX,MAAM,IAAIjd,MAAM,mBAAqB7V,EAAI,iBAC3C,EAEA,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICpES0gC,GAAkC1yC,GAHlC,YACQ,CAAC,QAAS,cAE4C0D,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EA0B9F,OAAO4C,EAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAI8jB,EAAU,EACvB,EAEApE,OAAQ,SAAUnlB,GAEhB,OAAO,IAAIupB,EAAUvpB,EAAI,GAC3B,EAEAitC,OAAQ,SAAUjtC,GAChB,MAAMqxC,EAAsBrxC,EAAEgI,MAAM,iCACpC,GAAIqpC,EAAqB,CAEvB,MAAM5xB,EAAO4xB,EAAoB,GAC3BxtC,EAAI0lB,EAAU8nB,EAAoB,IAClCS,EAAa,IAAIvoB,EAAU,GAAG7P,IAAImQ,OAAOpK,IAC/C,GAAI5b,EAAEmqB,GAAG8jB,EAAW7e,IAAI,IACtB,MAAM,IAAI/nB,YAAY,WAAWlL,sBAEnC,MAAM+xC,EAAmB,IAAIxoB,EAAU,GAAG7P,IAAImQ,OAAOpK,GAAQ,GAC7D,OAAI5b,EAAEysB,IAAIyhB,GACDluC,EAAEovB,IAAI6e,GAENjuC,CAEX,CACA,OAAO,IAAI0lB,EAAUvpB,EACvB,EAEAupB,UAAW,SAAUvpB,GAEnB,OAAOA,CACT,EAEAmsC,OAAQ,SAAUnsC,GAChB,OAAO,IAAIupB,EAAUvpB,EAAEoS,WACzB,EAEAq6B,KAAMhnC,EAAM6L,aAAYH,GAASnR,IAC/B,MAAMijB,EAAQjjB,EAAEijB,QAEhB,OADAA,EAAMjc,MAAQmK,EAAKnR,EAAEgH,OACdic,CAAK,IAGdyG,SAAU,SAAU1pB,GAClB,OAAO,IAAIupB,EAAUnmB,OAAOpD,EAAE6D,IAAImsB,IAAI5sB,OAAOpD,EAAEK,IAAI2uB,MAAM5rB,OAAOpD,EAAEyJ,GACpE,EAEA6nC,KAAM,SAAUU,GACd,OAAO,IAAIzoB,EAAU,EACvB,EAEA,iBAAkB9jB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IChFS8gC,GAAgC9yC,GAHhC,UACQ,CAAC,QAAS,YAE0C0D,IAAwB,IAAvB,MAAE4C,EAAK,QAAE+jB,GAAS3mB,EAuC1F,OAAO4C,EAAM,UAAW,CACtB,GAAI,WACF,OAAO+jB,EAAQ0oB,IACjB,EAEA/sB,OAAQ,SAAUnlB,GAChB,OAAO,IAAIwpB,EAAQxpB,EAAG,EACxB,EAEA,iBAAkB,SAAUoc,EAAIge,GAC9B,OAAO,IAAI5Q,EAAQpN,EAAIge,EACzB,EAGA,uBAAwB,SAAUhe,EAAIge,GACpC,OAAO,IAAI5Q,EAAQpN,EAAG6L,WAAYmS,EAAGnS,WACvC,EAEAyB,SAAU,SAAU1pB,GAClB,OAAO,IAAIwpB,EAAQxpB,EAAEgf,UAAW,EAClC,EAEAwK,QAAS,SAAUxpB,GACjB,OAAOA,EAAEijB,OACX,EAEAgqB,OAAQ,SAAUjtC,GAChB,OAAOwpB,EAAQxpB,EACjB,EAEAsxC,KAAM,SAAUtxC,GACd,OAAOwpB,EAAQ,EACjB,EAEA1nB,OAAQ,SAAU9B,GAChB,GAAI,OAAQA,GAAK,OAAQA,EACvB,OAAO,IAAIwpB,EAAQxpB,EAAEoc,GAAIpc,EAAEo6B,IAG7B,GAAK,MAAOp6B,GAAK,QAASA,GAAO,QAASA,GAAK,QAASA,EACtD,OAAO,IAAIwpB,EAAQxpB,GAGrB,MAAM,IAAI6V,MAAM,8EAClB,EAEA,iBAAkBpQ,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICtFSghC,GAAiChzC,GAHjC,WACQ,CAAC,QAAS,aAE2C0D,IAAyB,IAAxB,MAAE4C,EAAK,SAAEikB,GAAU7mB,EAsC5F,OAAO4C,EAAM,WAAY,CACvB0f,OAAQ,SAAUnlB,GAChB,IAAK8kB,SAAS9kB,IAAMod,MAAMpd,GACxB,MAAM,IAAI6V,MAAM7V,EAAI,wCAGtB,OAAO,IAAI0pB,EAAS1pB,EACtB,EAEAitC,OAAQ,SAAUjtC,GAChB,OAAO,IAAI0pB,EAAS1pB,EACtB,EAEA,iBAAkB,SAAUy3B,EAAW7E,GACrC,OAAO,IAAIlJ,EAAS+N,EAAW7E,EACjC,EAEA,iBAAkB,SAAU6E,EAAW7E,GACrC,OAAO,IAAIlJ,EAAS+N,EAAW7E,EACjC,EAEA0e,KAAM,SAAUtxC,GACd,OAAO,IAAI0pB,EAAS,EACtB,EAEAH,UAAW,SAAUvpB,GACnB,OAAO,IAAI0pB,EAAS1pB,EAAEoS,WACxB,EAEA+5B,OAAQ,SAAUnsC,GAChB,OAAO,IAAI0pB,EAAS1pB,EAAEoS,WACxB,EAEAsX,SAAU,SAAU1pB,GAClB,OAAOA,CACT,EAEAysC,KAAMhnC,EAAM6L,aAAYH,GAASnR,IAC/B,MAAMijB,EAAQjjB,EAAEijB,QAEhB,OADAA,EAAMjc,MAAQmK,EAAKnR,EAAEgH,OACdic,CAAK,IAGdnhB,OAAQ,SAAU9B,GAChB,OAAO,IAAI0pB,EAAS1pB,EACtB,EAEA,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC1FEpM,GAAO,SAGAqtC,GAA+BjzC,GAAQ4F,GAF/B,CAAC,QAAS,SAAU,cAAe,iBAEgBlC,IAAkD,IAAjD,MAAE4C,EAAK,OAAEy5B,EAAM,YAAEzV,EAAW,aAAEqkB,GAAcjrC,EAkCnH,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,OAAOstC,EAAQ,GACjB,EAEApF,OAAQ,SAAU3mB,GAChB,OAAO+rB,EAAQ,GAAI/rB,EACrB,EAEA,iBAAkB,SAAUA,EAAQ8Y,GAClC,OAAOiT,EAAQ,GAAI/rB,EAAQ8Y,EAC7B,EAEAn6B,MAAO,SAAUlB,GACf,OAAOsuC,EAAQtuC,EACjB,EAEAm7B,OAAQ,SAAUn7B,GAChB,OAAOsuC,EAAQtuC,EAAMA,EAAKo7B,UAC5B,EAEA,yBAA0BkT,EAE1B,iCAAkCA,IAWpC,SAASA,EAAStuC,EAAMuiB,EAAQ8Y,GAE9B,GAAe,UAAX9Y,GAAiC,YAAXA,QAAmCxjB,IAAXwjB,EAChD,OAAO,IAAImD,EAAY1lB,EAAMq7B,GAG/B,GAAe,WAAX9Y,EACF,OAAO,IAAIwnB,EAAa/pC,EAAMq7B,GAGhC,MAAM,IAAIl5B,UAAU,uBAAyBqhC,KAAKjH,UAAUha,GAAU,IACxE,KClFIvhB,GAAO,qBAGAutC,GAA2CnzC,GAAQ4F,GAF3C,CAAC,QAAS,SAAU,WAE2ClC,IAA+B,IAA9B,MAAE4C,EAAK,OAAEykB,EAAM,OAAE2E,GAAQhsB,EA+D5G,OAAO4C,EAAMV,GAAM,CACjB,2CAA4C,SAAU0a,EAAMnY,EAAIgf,EAAQ8Y,GACtE,OAAOiT,EAAQ5yB,EAAMnY,EAAIgf,EAAQ8Y,EACnC,EACA,mCAAoC,SAAU3f,EAAMnY,EAAIgf,GACtD,OAAO+rB,EAAQ5yB,EAAMnY,EAAIgf,EAC3B,EACA,mBAAoB,SAAU7G,EAAMnY,GAClC,OAAO+qC,EAAQ5yB,EAAMnY,EAAI,QAC3B,EACA,kBAAmB,SAAUmY,EAAMnY,GACjC,OAAO+qC,EAAQ5yB,EAAMnY,EAAI,SAAS03B,SACpC,EACA,mCAAoC,SAAUvf,EAAM6G,EAAQhf,GAC1D,OAAO+qC,EAAQ5yB,EAAMnY,EAAIgf,EAC3B,EACA,2CAA4C,SAAU7G,EAAM6G,EAAQ8Y,EAAU93B,GAC5E,OAAO+qC,EAAQ5yB,EAAMnY,EAAIgf,EAAQ8Y,EACnC,IAGF,SAASiT,EAAS5yB,EAAMnY,EAAIgf,EAAQ8Y,GAClC,IAAI7P,EAcJ,OAZEA,OADezsB,IAAbs8B,EACElV,EAAO5D,EAAQ8Y,GAEflV,EAAO5D,GAGbiJ,EAAEgQ,OAAO9f,GACT8P,EAAE7rB,SAAQ,SAAUjB,EAAGkB,GACrB,MAAMunC,EAAM5jC,EAAG3D,GACXkrB,EAAOqc,IACX3b,EAAE9oB,IAAI9C,EAAOunC,EACf,IAEO3b,CACT,KCvGIxqB,GAAO,iBAGAwtC,GAAuCpzC,GAAQ4F,GAFvC,CAAC,QAAS,SAAU,UAAW,SAE4BlC,IAAsC,IAArC,MAAE4C,EAAK,OAAEykB,EAAM,QAAEjQ,EAAO,KAAEwF,GAAM5c,EAuB/G,OAAO4C,EAAMV,GAAM,CACjB,WAAY,SAAU+K,GACpB,OAAO0iC,EAAa1iC,EACtB,EACA,YAAa,SAAUA,GACrB,OAAOoa,EAAOsoB,EAAa1iC,EAAI5G,KAAIqmB,GAAKA,EAAEyP,aAC5C,IAKF,SAASwT,EAAc1iC,GACrB,GAAmB,IAAfA,EAAIvP,OAAc,MAAM,IAAI2F,UAAU,qDAC1C,MAAMu2B,EAAIgW,EAA+B3iC,EAAI,IAEvC7O,EAAS,GACf,IAAK,MAAM2oC,KAAO95B,EAAK,CACrB,MAAM4iC,EAAYD,EAA+B7I,GAEjD,GAAI8I,IAAcjW,EAChB,MAAM,IAAIv2B,UAAU,sCAA4C,EAAJu2B,GAAS,OAAqB,EAAZiW,IAGhFzxC,EAAOO,KAAKyY,EAAQ2vB,GACtB,CAEA,OAAO3oC,CACT,CAEA,SAASwxC,EAAgCE,GACvC,MAAMlpC,EAAIgW,EAAKkzB,GAEf,GAAiB,IAAblpC,EAAElJ,OACJ,OAAOkJ,EAAE,GACJ,GAAiB,IAAbA,EAAElJ,OAAc,CACzB,GAAa,IAATkJ,EAAE,GACJ,OAAOA,EAAE,GACJ,GAAa,IAATA,EAAE,GACX,OAAOA,EAAE,GAET,MAAM,IAAIvD,UAAU,iDAExB,CACE,MAAM,IAAIA,UAAU,sDAExB,KCvEInB,GAAO,oBAGA6tC,GAA0CzzC,GAAQ4F,GAF1C,CAAC,QAAS,SAAU,UAAW,SAE+BlC,IAAsC,IAArC,MAAE4C,EAAK,OAAEykB,EAAM,QAAEjQ,EAAO,KAAEwF,GAAM5c,EAuBlH,OAAO4C,EAAMV,GAAM,CACjB,WAAY,SAAU+K,GACpB,OAAO0iC,EAAa1iC,EACtB,EACA,YAAa,SAAUA,GACrB,OAAOoa,EAAOsoB,EAAa1iC,EAAI5G,KAAIqmB,GAAKA,EAAEyP,aAC5C,IAKF,SAASwT,EAAc1iC,GACrB,GAAmB,IAAfA,EAAIvP,OAAc,MAAM,IAAI2F,UAAU,wDAC1C,MAAMu2B,EAAIgW,EAA+B3iC,EAAI,IAGvC7O,EAAS,GACf,IAAK,IAAIK,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBL,EAAOK,GAAK,GAId,IAAK,MAAMwoC,KAAOh6B,EAAK,CACrB,MAAM+iC,EAAYJ,EAA+B3I,GAEjD,GAAI+I,IAAcpW,EAChB,MAAM,IAAIv2B,UAAU,sCAA4C,EAAJu2B,GAAS,OAAqB,EAAZoW,IAGhF,MAAMnyC,EAAIuZ,EAAQ6vB,GAGlB,IAAK,IAAIxoC,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBL,EAAOK,GAAGE,KAAKd,EAAEY,GAErB,CAEA,OAAOL,CACT,CAEA,SAASwxC,EAAgCE,GACvC,MAAMlpC,EAAIgW,EAAKkzB,GAEf,GAAiB,IAAblpC,EAAElJ,OACJ,OAAOkJ,EAAE,GACJ,GAAiB,IAAbA,EAAElJ,OAAc,CACzB,GAAa,IAATkJ,EAAE,GACJ,OAAOA,EAAE,GACJ,GAAa,IAATA,EAAE,GACX,OAAOA,EAAE,GAET,MAAM,IAAIvD,UAAU,iDAExB,CACE,MAAM,IAAIA,UAAU,sDAExB,KClFInB,GAAO,YAGA+tC,GAAkC3zC,GAAQ4F,GAFlC,CAAC,UAEqDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAoBnF,OAAO4C,EAAMV,GAAM,CACjB,cAAe,SAAUwsC,EAAMJ,GAC7B,OAAOI,EAAKwB,UAAU5B,EACxB,GACA,IC3BErc,GAAK,SACLke,GAAK,iBAEJ,SAASC,GAAW95B,GACzB,OAAOrM,KAAKsa,IAAIjO,EAClB,CAGO,SAAS+5B,GAAW/5B,EAAGD,GAC5B,OAAOC,EAAID,CACb,CAGO,SAASi6B,GAAgBh6B,EAAGD,GACjC,OAAOC,EAAID,CACb,CAGO,SAASk6B,GAAgBj6B,EAAGD,GACjC,OAAOC,EAAID,CACb,CAQO,SAASm6B,GAAkBrzC,GAChC,OAAQA,CACV,CAGO,SAASszC,GAAiBtzC,GAC/B,OAAOA,CACT,CAGO,SAASuzC,GAAYvzC,GAC1B,OAAO8lB,GAAK9lB,EACd,CAGO,SAASwzC,GAAYxzC,GAC1B,OAAOA,EAAIA,EAAIA,CACjB,CAGO,SAASyzC,GAAWzzC,GACzB,OAAO8M,KAAKkZ,IAAIhmB,EAClB,CAGO,SAAS0zC,GAAa1zC,GAC3B,OAAOimB,GAAMjmB,EACf,CA+BO,SAAS2zC,GAAWx6B,EAAGD,GAC5B,IAAK2L,GAAU1L,KAAO0L,GAAU3L,GAC9B,MAAM,IAAIrD,MAAM,sDAGlB,GAAU,IAANsD,GAAiB,IAAND,EACb,OAAO,EAKT,IAAInZ,EACJ,MAAMm2B,EAAO/c,EAAID,EACjB,KAAa,IAANA,GACLnZ,EAAImZ,EACJA,EAAIC,EAAIpZ,EACRoZ,EAAIpZ,EAEN,OAAO+M,KAAKsa,IAAI8O,EAAO/c,EACzB,CASO,SAASy6B,GAAW5zC,EAAGC,GAC5B,OAAIA,EAAY6M,KAAK2Y,IAAIzlB,GAAK8M,KAAK2Y,IAAIxlB,GAChC6M,KAAK2Y,IAAIzlB,EAClB,CAOO,SAAS6zC,GAAa7zC,GAC3B,OAAO2lB,GAAM3lB,EACf,CAQO,SAAS8zC,GAAY9zC,GAC1B,OAAOwlB,GAAKxlB,EACd,CAmCO,SAAS+zC,GAAe56B,GAAa,IAAVja,EAAI+C,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EACvC,MAAM+xC,EAAM90C,EAAO,EAKnB,GAJI80C,IACF90C,GAAQA,GAGG,IAATA,EACF,MAAM,IAAI2W,MAAM,yBAElB,GAAIsD,EAAI,GAAMrM,KAAKsa,IAAIloB,GAAQ,GAAM,EACnC,MAAM,IAAI2W,MAAM,wCAIlB,GAAU,IAANsD,EACF,OAAO66B,EAAMnnC,IAAW,EAE1B,IAAKiY,SAAS3L,GACZ,OAAO66B,EAAM,EAAI76B,EAGnB,IAAInZ,EAAI8M,KAAK4M,IAAI5M,KAAKsa,IAAIjO,GAAI,EAAIja,GAIlC,OADAc,EAAImZ,EAAI,GAAKnZ,EAAIA,EACVg0C,EAAM,EAAIh0C,EAAIA,CAwBvB,CAEO,SAASi0C,GAAYj0C,GAC1B,OAAOulB,GAAKvlB,EACd,CAQO,SAASk0C,GAAcl0C,GAC5B,OAAOA,EAAIA,CACb,CAUO,SAASm0C,GAAYh7B,EAAGD,GAE7B,IAAInZ,EACAuzB,EACA/X,EA0BAkf,EAzBAz6B,EAAI,EACJo0C,EAAQ,EACRn0C,EAAI,EACJo0C,EAAQ,EAEZ,IAAKxvB,GAAU1L,KAAO0L,GAAU3L,GAC9B,MAAM,IAAIrD,MAAM,uDAGlB,KAAOqD,GACLoa,EAAIxmB,KAAKsM,MAAMD,EAAID,GACnBqC,EAAIpC,EAAIma,EAAIpa,EAEZnZ,EAAIC,EACJA,EAAIo0C,EAAQ9gB,EAAItzB,EAChBo0C,EAAQr0C,EAERA,EAAIE,EACJA,EAAIo0C,EAAQ/gB,EAAIrzB,EAChBo0C,EAAQt0C,EAERoZ,EAAID,EACJA,EAAIqC,EASN,OAJEkf,EADEthB,EAAI,EACA,EAAEA,GAAIi7B,GAAQC,GAEd,CAACl7B,EAAGA,EAAIi7B,EAAQ,EAAGC,GAEpB5Z,CACT,CASO,SAAS6Z,GAAWt0C,EAAGC,GAG5B,OAAKD,EAAIA,EAAI,GAAKC,IAAM4M,KACrB7M,EAAIA,EAAI,GAAKC,KAAM,IACb,EAGF6M,KAAK4M,IAAI1Z,EAAGC,EACrB,CAUO,SAASs0C,GAAavtC,GAAqB,IAAdugB,EAAQtlB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EAC7C,IAAK4iB,GAAU0C,IAAaA,EAAW,GAAKA,EAAW,GACrD,MAAM,IAAI1R,MAAM,kFAElB,OAAOsH,WAAWwJ,GAAQ3f,EAAOugB,GACnC,CApTA0rB,GAAU1rC,UAAYutB,GAKtBoe,GAAU3rC,UAAYyrC,GAKtBG,GAAe5rC,UAAYyrC,GAK3BI,GAAe7rC,UAAYyrC,GAU3BK,GAAiB9rC,UAAYutB,GAK7Bwe,GAAgB/rC,UAAYutB,GAK5Bye,GAAWhsC,UAAYutB,GAKvB0e,GAAWjsC,UAAYutB,GAKvB2e,GAAUlsC,UAAYutB,GAKtB4e,GAAYnsC,UAAYutB,GAkDxB6e,GAAUpsC,UAAYyrC,GAqBtBa,GAAYtsC,UAAYutB,GAUxBgf,GAAWvsC,UAAYutB,GAwFvBmf,GAAW1sC,UAAYutB,GAUvBof,GAAa3sC,UAAYutB,GA+CzBqf,GAAW5sC,UAAYyrC,GAkBvBsB,GAAU/sC,UAAYyrC,GC1StB,MAAMjuC,GAAO,aAGAyvC,GAAmCr1C,GAAQ4F,GAFnC,CAAC,UAEsDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAwBpF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQkuB,GAER,iCAAkCrzC,GAAKA,EAAEqvB,MAEzC8c,OAAQnsC,IAAMA,EAEdysC,KAAMhnC,EAAM6L,aAAYH,GAAQnR,IAC9B,MAAMy6B,EAAMz6B,EAAEijB,QAEd,OADAwX,EAAIzzB,MAAQvB,EAAMwR,KAAK9F,EAAMspB,EAAIiS,YAArBjnC,CAAkCzF,EAAEgH,OACzCyzB,CAAG,IAIZ,iBAAkBh1B,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,GAAM,MAGlE,IC3CEpM,GAAO,YAGA0vC,GAAkCt1C,GAAQ4F,GAFlC,CAAC,QAAS,SAAU,YAEkClC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEwvB,GAAS7xC,EAyBpG,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQmuB,GAER9pB,QAAS,SAAUxpB,GACjB,OAAOA,CACT,EAEAupB,UAAW,SAAUvpB,GACnB,OAAOA,CACT,EAEAmsC,OAAQ,SAAUnsC,GAChB,OAAOA,CACT,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAOA,CACT,EAEAysC,KAAM,SAAUzsC,GACd,OAAOA,EAAEijB,OACX,EAGA,iBAAkBxd,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,GAAM,KAElE67B,QAAS,SAAUhtC,GACjB,OAAO00C,EAAQ10C,EAAI,EAAI,EAAGklB,EAAOC,OACnC,EAEA8nB,OAAQ,SAAUjtC,GAChB,OAAO00C,EAAQ10C,EAAGglB,GAAehlB,EAAGklB,GACtC,GACA,IC3DSyvB,GAA4Bx1C,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EAyB7E,OAAO4C,EA5BI,MA4BQ,CACjB0f,OAAQ8tB,GAER,wCAAyCjzC,GAAKA,EAAEonB,MAEhD+kB,OAAQnsC,GAAKA,EAAI,IAAMA,EAAIA,EAG3B,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,GAAM,MAClE,ICpCEpM,GAAO,YAGA6vC,GAAkCz1C,GAAQ4F,GAFlC,CAAC,QAAS,cAE4ClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAEof,GAAWhiB,EAsC9F,OAAO4C,EAAMV,GAAM,CACjB,+CAAgD,SAAU2lC,EAAKvJ,EAAKpxB,GAClE,IAAK8U,EAAUsc,GACb,MAAM,IAAIj7B,UAAU,yCAGtB,MAAMuZ,EAAOxa,MAAMC,QAAQwlC,GAAOzJ,GAAUyJ,GAAOA,EAAIjrB,OACvD,GAAI0hB,EAAM,GAAMA,GAAO1hB,EAAKlf,OAC1B,MAAM,IAAIygC,GAAWG,EAAK1hB,EAAKlf,QAGjC,OAAIogB,EAAS+pB,GACJA,EAAI/lC,OAAOkwC,GAAWnK,EAAI1rB,UAAWmiB,EAAKpxB,GAAW26B,EAAItL,YAEzDyV,GAAWnK,EAAKvJ,EAAKpxB,EAEhC,GACA,GACD,CAAE+kC,SAAU,UAUf,SAASD,GAAYnK,EAAKvJ,EAAKpxB,GAC7B,IAAIzO,EAAGw5B,EAAKqQ,EAEZ,GAAIhK,GAAO,EAAG,CACZ,GAAKl8B,MAAMC,QAAQwlC,EAAI,IAEhB,CAGL,IAFAS,EAsBN,SAAkBT,GAChB,MAAMC,EAAID,EAAInqC,OACRqqC,EAAIF,EAAI,GAAGnqC,OACjB,IAAIe,EAAGC,EACP,MAAMu5B,EAAM,GACZ,IAAKv5B,EAAI,EAAGA,EAAIqpC,EAAGrpC,IAAK,CACtB,MAAMi5B,EAAM,GACZ,IAAKl5B,EAAI,EAAGA,EAAIqpC,EAAGrpC,IACjBk5B,EAAIh5B,KAAKkpC,EAAIppC,GAAGC,IAElBu5B,EAAIt5B,KAAKg5B,EACX,CACA,OAAOM,CACT,CAnCa2P,CAAQC,GACf5P,EAAM,GACDx5B,EAAI,EAAGA,EAAI6pC,EAAK5qC,OAAQe,IAC3Bw5B,EAAIx5B,GAAKuzC,GAAW1J,EAAK7pC,GAAI6/B,EAAM,EAAGpxB,GAExC,OAAO+qB,CACT,CARE,OAAO/qB,EAAS26B,EASpB,CAEE,IADA5P,EAAM,GACDx5B,EAAI,EAAGA,EAAIopC,EAAInqC,OAAQe,IAC1Bw5B,EAAIx5B,GAAKuzC,GAAWnK,EAAIppC,GAAI6/B,EAAM,EAAGpxB,GAEvC,OAAO+qB,CAEX,CC5FA,MAAM/1B,GAAO,YAGAgwC,GAAkC51C,GAAQ4F,GAFlC,CAAC,UAEqDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAanF,OAAO4C,EAAMV,GAAM,CAEjB,iBAAkBmuC,GAElB,mBAAoB,SAAUlzC,EAAGC,GAC/B,OAAOD,EAAE0K,IAAIzK,EACf,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEmvB,KAAKlvB,EAChB,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOD,EAAIC,CACb,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOD,EAAE0K,IAAIzK,EACf,EAEA,aAAcwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAC1C,GAAgB,OAAZD,EAAEgH,YAA8BlE,IAAZ9C,EAAEgH,MACxB,MAAM,IAAI6O,MAAM,oDAElB,GAAgB,OAAZ5V,EAAE+G,YAA8BlE,IAAZ7C,EAAE+G,MACxB,MAAM,IAAI6O,MAAM,oDAElB,IAAK7V,EAAEwtC,UAAUvtC,GAAI,MAAM,IAAI4V,MAAM,sBAErC,MAAM4kB,EAAMz6B,EAAEijB,QAId,OAHAwX,EAAIzzB,MACFvB,EAAMwR,KAAK9F,EAAM,CAACspB,EAAIiS,YAAazsC,EAAEysC,aAArCjnC,CAAmDg1B,EAAIzzB,MAAO/G,EAAE+G,OAClEyzB,EAAIua,WAAY,EACTva,CAAG,KAEZ,ICnDE11B,GAAO,iBAGAkwC,GAAuC91C,GAAQ4F,GAFvC,CAAC,UAE0DlC,IAAe,IAAd,MAAE4C,GAAO5C,EAaxF,OAAO4C,EAAMV,GAAM,CAEjB,iBAAkBouC,GAElB,mBAAoB,SAAUnzC,EAAGC,GAC/B,OAAOD,EAAEizB,IAAIhzB,EACf,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEkvB,MAAMjvB,EACjB,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOD,EAAIC,CACb,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOD,EAAEizB,IAAIhzB,EACf,EAEA,aAAcwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAC1C,GAAgB,OAAZD,EAAEgH,YAA8BlE,IAAZ9C,EAAEgH,MACxB,MAAM,IAAI6O,MAAM,oDAElB,GAAgB,OAAZ5V,EAAE+G,YAA8BlE,IAAZ7C,EAAE+G,MACxB,MAAM,IAAI6O,MAAM,oDAElB,IAAK7V,EAAEwtC,UAAUvtC,GAAI,MAAM,IAAI4V,MAAM,sBAErC,MAAM4kB,EAAMz6B,EAAEijB,QAId,OAHAwX,EAAIzzB,MACFvB,EAAMwR,KAAK9F,EAAM,CAACspB,EAAIiS,YAAazsC,EAAEysC,aAArCjnC,CAAmDg1B,EAAIzzB,MAAO/G,EAAE+G,OAClEyzB,EAAIua,WAAY,EACTva,CAAG,KAEZ,IClDE11B,GAAO,OAYAmwC,GAA6B/1C,GAAQ4F,GAX7B,CACnB,SACA,QACA,aACA,aACA,SACA,UACA,YACA,aAGoElC,IAAqF,IAApF,OAAEqiB,EAAM,MAAEzf,EAAK,WAAE2sB,EAAU,WAAE+iB,EAAU,OAAEjrB,EAAM,QAAEV,EAAO,UAAED,EAAS,SAAEG,GAAU7mB,EA0CpJ,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQouB,GAIR/pB,QAAS4rB,EAET,mBAAoBA,EAEpB7rB,UAAW,SAAUvpB,GACnB,OAAOA,EAAE8lB,MACX,EAEA2mB,KAwCF,SAAoBzsC,GAClB,GAAIA,EAAEgH,OAASuZ,EAAUvgB,EAAEgH,OAAQ,CACjC,IAAI/F,EAASjB,EAAEijB,QAIf,OAHAhiB,EAAO+F,MAAQ,EACf/F,EAASA,EAAOyY,IAAI,EAAM,GAC1BzY,EAAO+F,MAAQouC,EAAap1C,EAAEgH,OACvB/F,CACT,CAAO,CACL,MAAM8kB,EAASqM,EAAWpyB,EAAEgH,OAM5B,IAAIquC,EALAtvB,IACF/lB,EAAEgH,MAAQmuC,EAAWn1C,EAAEgH,QAMvBquC,EADEj1B,EAAYpgB,EAAEgH,OACR,IAAIuiB,EAAU,GAAGyG,IAAI,GACpBxP,EAAWxgB,EAAEgH,OACd,IAAI0iB,EAAS,EAAG,GAEhB,EAAI,EAGd,MAAMzoB,EAASjB,EAAE0Z,IAAI27B,GAMrB,OAJItvB,IACF9kB,EAAO+F,MAAQmuC,EAAWl0C,EAAO+F,QAG5B/F,CACT,CACF,IA3DA,SAASm0C,EAAcp1C,EAAGs1C,GAGxB,MAAMC,EAAOv1C,EAAEwP,MAAQ,EACjB4X,EAAMpnB,EAAEonB,MAGRouB,EAAY,IAAIhsB,EAAQ+pB,GAAWnsB,GAAM,GAAG6M,IAAI,IAAIzK,EAAQ,EAAG+rB,GAAMvvB,OAE3E,GAAIsvB,EAAU,CACZ,MAAMG,EAAM,CACVD,EACA,IAAIhsB,EAAQ+pB,GAAWnsB,GAAM,GAAG6M,IAAI,IAAIzK,EAAQ,EAAG+rB,EAAiB,EAAVzoC,KAAKme,GAAS,GAAGjF,OAC3E,IAAIwD,EAAQ+pB,GAAWnsB,GAAM,GAAG6M,IAAI,IAAIzK,EAAQ,EAAG+rB,EAAiB,EAAVzoC,KAAKme,GAAS,GAAGjF,QAG7E,MAA0B,UAAlBd,EAAOgF,OAAsBurB,EAAMvrB,EAAOurB,EACpD,CACE,OAAOD,CAEX,CAuCA,ICzIWE,GAAsCv2C,GAHtC,gBACQ,CAAC,QAAS,gBAEgD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAoBpG,OAAO,SAAwB4G,EAAGyP,EAAGnJ,EAAUw7B,GAE7C,MAAME,EAAUhiC,EAAEiiC,QACZC,EAASliC,EAAEmiC,OACXC,EAAOpiC,EAAEqiC,KACT6J,EAAQlsC,EAAEg4B,MACVmU,EAAMnsC,EAAEo+B,UAGd,IAAK4D,EAAW,MAAM,IAAI51B,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,IAETC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExB38B,EAAIzT,EAAM8J,QAAQ2J,EAAG28B,GAErBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAGb,IAAK,IAAIz0C,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhCy0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,IAAK,IAAIwrC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5D,MAAMgB,EAAIqqC,EAAOrrC,GAEXF,EAAImrC,EAAUuK,EAAG58B,EAAGuyB,EAAQnrC,IAAMw1C,EAAGrK,EAAQnrC,GAAI4Y,GAElD0W,EAAGxvB,EAAG8tC,KAET5C,EAAO9pC,KAAKF,GACZy0C,EAAQv0C,KAAKpB,GAEjB,CACF,CAKA,OAHA41C,EAAKnM,GAAWyB,EAAO/qC,OAGhBkJ,EAAEglC,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUyW,GAEd,CAAC,IC5FUI,GAAsC92C,GAHtC,gBACQ,CAAC,QAAS,gBAEgD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAEgkB,GAAa5mB,EAoBpG,OAAO,SAAwB4G,EAAGyP,EAAGnJ,EAAUw7B,GAE7C,MAAME,EAAUhiC,EAAEiiC,QACZC,EAASliC,EAAEmiC,OACXC,EAAOpiC,EAAEqiC,KACT6J,EAAQlsC,EAAEg4B,MACVmU,EAAMnsC,EAAEo+B,UAGd,IAAK4D,EAAW,MAAM,IAAI51B,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAC,EAAK/lC,EAGU,iBAAR6lC,IAETC,EAAKD,EAEL18B,EAAIzT,EAAM8J,QAAQ2J,EAAG28B,GAErBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAMK,EAAQ,GAGRl2C,EAAI,GAEJG,EAAI,GAGV,IAAK,IAAIoB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAM8pC,EAAO9pC,EAAI,EAEjB,IAAK,IAAIwqC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5D,MAAMib,EAAIowB,EAAOrrC,GAEjBN,EAAEub,GAAKkwB,EAAQnrC,GACfH,EAAEob,GAAK8vB,CACT,CAEA,IAAK,IAAI/pC,EAAI,EAAGA,EAAIqoC,EAAMroC,IAEd,IAANC,IAEF20C,EAAM50C,GAAK,IAGTnB,EAAEmB,KAAO+pC,EAEX6K,EAAM50C,GAAGC,GAAKgqC,EAAUuK,EAAG58B,EAAGlZ,EAAEsB,IAAMw0C,EAAG91C,EAAEsB,GAAI4X,GAG/Cg9B,EAAM50C,GAAGC,GAAKgqC,EAAUuK,EAAG58B,EAAG,GAAK48B,EAAG,EAAG58B,EAG/C,CAGA,OAAO,IAAIuQ,EAAY,CACrB1lB,KAAMmyC,EACNz2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUyW,GAEd,CAAC,IC7FUM,GAAqCh3C,GAHrC,eACQ,CAAC,UAEwD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAgBtF,OAAO,SAAuBsW,EAAGD,EAAGnJ,EAAUw7B,GAE5C,MAAM6K,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,UAGd,IAAIgO,EAEAC,EAAK/lC,EAGU,iBAAR6lC,IAETC,EAAKD,EAEL18B,EAAIzT,EAAM8J,QAAQ2J,EAAG28B,GAErBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAMK,EAAQP,EAAMp1C,OAAS,EAAI81C,EAASP,EAAI,EAAGH,EAAOA,EAAM,GAAIS,EAAOl9B,EAAGqyB,GAAW,GAGvF,OAAOpyB,EAAE+uB,kBAAkB,CACzBnkC,KAAMmyC,EACNz2B,KAAMwD,GAAM0yB,GACZvW,SAAUyW,GAEd,EAGA,SAASQ,EAAU31C,EAAG41C,EAAO7sC,EAAG5F,EAAG0yC,EAAIC,EAAIjL,GAEzC,MAAMkL,EAAK,GAEX,GAAIH,IAAU7sC,EAAElJ,OAAS,EAEvB,IAAK,IAAIe,EAAI,EAAGA,EAAIuC,EAAGvC,IAErBm1C,EAAGn1C,GAAKiqC,EAAU7qC,EAAE81C,EAAID,EAAGj1C,IAAMZ,EAAE61C,EAAGj1C,GAAIk1C,QAI5C,IAAK,IAAIj1C,EAAI,EAAGA,EAAIsC,EAAGtC,IAErBk1C,EAAGl1C,GAAK80C,EAAS31C,EAAG41C,EAAQ,EAAG7sC,EAAGA,EAAE6sC,EAAQ,GAAIC,EAAGh1C,GAAIi1C,EAAIjL,GAG/D,OAAOkL,CACT,KChEI1xC,GAAO,OACPif,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,cAAe,QAAS,eAE9E0yB,GAAS,IAAIze,GAAQ,IAEd0e,GAAmCx3C,GAC9C4F,GAAM,CAAC,QAAS,SAAU,UAAUlC,IAA8B,IAA7B,MAAE4C,EAAK,OAAEyf,EAAM,MAAEH,GAAOliB,EAC3D,SAAS+zC,EAAa52C,GAEpB,MAAMkE,EAAI4I,KAAKogB,KAAKltB,GACdub,EAAIwJ,EAAM/kB,GAChB,OAAIkE,IAAMqX,EAAUrX,EAElBskB,GAAYxoB,EAAGub,EAAG2J,EAAOuD,OAAQvD,EAAOwD,UACvCF,GAAYxoB,EAAGkE,EAAGghB,EAAOuD,OAAQvD,EAAOwD,QAElCnN,EAEFrX,CACT,CAEA,OAAOuB,EAAMV,GAAM,CACjBogB,OAAQyxB,EACR,iBAAkB,SAAU52C,EAAG6D,GAC7B,IAAKghB,GAAUhhB,GACb,MAAM,IAAI4jC,WACR,0DAEJ,GAAI5jC,EAAI,GAAKA,EAAI,GACf,MAAM,IAAI4jC,WACR,2DAEJ,MAAMpf,EAAQ,IAAMxkB,EACpB,OAAO+yC,EAAY52C,EAAIqoB,GAASA,CAClC,GACA,IAIOwuB,GAA6B13C,GAAQ4F,GAAMif,IAAc6pB,IAAuE,IAAtE,MAAEpoC,EAAK,OAAEyf,EAAM,MAAEH,EAAK,OAAEmF,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,GAAaokB,EACtI,MAAMiJ,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CutB,EAAeb,GAAmB,CAAE1wC,UAEpCwxC,EAAaN,GAAiB,CAAElxC,QAAOyf,SAAQH,UACrD,SAASmyB,EAAUl3C,GAEjB,MAAMm3C,EAAMA,CAACh+B,EAAGD,IAAMszB,GAAerzB,EAAGD,EAAGgM,EAAOuD,OAAQvD,EAAOwD,QAC3DxkB,EAAIlE,EAAEktB,OACN3R,EAAIwJ,EAAM/kB,GAChB,OAAIkE,EAAE0rB,GAAGrU,GAAWrX,EAChBizC,EAAIn3C,EAAGub,KAAO47B,EAAIn3C,EAAGkE,GAAWqX,EAC7BrX,CACT,CA+CA,OAAOuB,EAAM,OAAQ,CACnB0f,OAAQ8xB,EAAWlvC,WAAWod,OAC9B,gBAAiB8xB,EAAWlvC,WAAW,iBAEvCyhB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEktB,MACX,EAEA,kBAAmB,SAAUltB,EAAG6D,GAC9B,OAAO7D,EAAEktB,KAAKrpB,EAChB,EAEA,qBAAsB,SAAU7D,EAAG6D,GACjC,OAAO7D,EAAEktB,KAAKrpB,EAAEokB,WAClB,EAEAsB,UAAW2tB,EAEX,uBAAwB,SAAUl3C,EAAG6D,GACnC,MAAMwkB,EAAQquB,GAAOh9B,IAAI7V,GACzB,OAAOqzC,EAASl3C,EAAEi0B,IAAI5L,IAAQ2H,IAAI3H,EACpC,EAEA8jB,OAAQjzB,GAAKA,EACb,iBAAkBk+B,CAACl+B,EAAGm+B,IAAWn+B,EACjC,oBAAqBo+B,CAACp+B,EAAGm+B,IAAWn+B,EAEpCwQ,SAAU,SAAU1pB,GAClB,OAAOA,EAAEktB,MACX,EAEA,mBAAoB,SAAUltB,EAAG6D,GAC/B,OAAO7D,EAAEktB,KAAKrpB,EAChB,EAEA,sBAAuB,SAAU7D,EAAG6D,GAClC,OAAO7D,EAAEktB,KAAKrpB,EAAEokB,WAClB,EAEA,qBAAsBxiB,EAAM6L,aAAYH,GAAQ,SAAUnR,EAAG6D,EAAG0tC,GAC9D,MAAMgG,EAAYv3C,EAAEw3C,UAAUjG,GAC9B,OAAOA,EAAKkG,SAAStmC,EAAKomC,EAAW1zC,GACvC,IAEA,wBAAyB4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAASpgC,EAAKnR,EAAG6D,EAAEokB,WAAYspB,KAEzF,2CAA4C9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAEpEhM,GAAQvlC,GAAIgH,GAAUmK,EAAKnK,EAAOnD,EAAG0tC,KAAO,KAGrD,8BAA+B9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGuxC,IAASpgC,EAAKnR,EAAG,EAAGuxC,KAEjF,iBAAkB9rC,EAAM6L,aAAYH,GAASnR,GAEpCulC,GAAQvlC,EAAGmR,GAAM,KAG1B,4BAA6B1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAElD0hC,GAAQvlC,GAAGsB,GAAK6P,EAAK7P,EAAGuC,KAAI,KAGrC,mCAAoC4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACzD62C,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACxD+2C,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,iDACE1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAErB+2C,EAAa9sB,EAAOjqB,GAAID,EAAGmR,GAAM,GAAM6N,YAGlD,kDACEvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACxBmtC,EAAYptC,EAAG,GAAW6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAC5B,UAAhBl/B,EAAEk/B,UACG6X,EAAa/2C,EAAGD,EAAGmR,GAAM,GAE3B4lC,EAAc92C,EAAGD,EAAGmR,GAAM,MAErC,IC/LEpM,GAAO,OAGA2yC,GAA6Bv4C,GAAQ4F,GAF7B,CAAC,UAEgDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA0B9E,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQquB,GAERhqB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEi0B,IAAIj0B,GAAGi0B,IAAIj0B,EACtB,EAEAupB,UAAW,SAAUvpB,GACnB,OAAOA,EAAEgvB,MAAMhvB,GAAGgvB,MAAMhvB,EAC1B,EAEAmsC,OAAQ,SAAUnsC,GAChB,OAAOA,EAAIA,EAAIA,CACjB,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAOA,EAAE0Z,IAAI,EACf,EAEA+yB,KAAM,SAAUzsC,GACd,OAAOA,EAAE0Z,IAAI,EACf,GACA,IChDSi+B,GAA4Bx4C,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EA+B7E,OAAO4C,EAlCI,MAkCQ,CACjB0f,OAAQsuB,GAERjqB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEgmB,KACX,EAEAuD,UAAW,SAAUvpB,GACnB,OAAOA,EAAEgmB,KACX,GACA,IC5CEjhB,GAAO,QAGA6yC,GAA8Bz4C,GAAQ4F,GAF9B,CAAC,QAAS,YAEwClC,IAAwB,IAAvB,MAAE4C,EAAK,QAAE+jB,GAAS3mB,EAkCxF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQuuB,GAERlqB,QAAS,SAAUxpB,GACjB,MAAMub,EAAIzO,KAAKkZ,IAAIhmB,EAAEoc,IACrB,OAAO,IAAIoN,EACTjO,EAAIzO,KAAK4hB,IAAI1uB,EAAEo6B,IAAM,EACrB7e,EAAIzO,KAAK8mB,IAAI5zB,EAAEo6B,IAEnB,EAEA7Q,UAAW,SAAUvpB,GACnB,OAAOA,EAAEgmB,MAAMkJ,MAAM,EACvB,GACA,ICjDEnqB,GAAO,MACPif,GAAe,CAAC,QAAS,UAAW,SAAU,OAAQ,QAAS,cAAe,QAAS,eAEhF6zB,GAAkC14C,GAC7C4F,GAAM,CAAC,QAAS,OAAQ,UAAUlC,IAA4B,IAA3B,MAAE4C,EAAK,KAAEynB,EAAI,MAAE9T,GAAOvW,EACvD,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAQA,EAAI,EAAKoZ,EAAMpZ,GAAKktB,EAAKltB,EACnC,EAEA,iBAAkB,SAAUA,EAAG6D,GAC7B,OAAQ7D,EAAI,EAAKoZ,EAAMpZ,EAAG6D,GAAKqpB,EAAKltB,EAAG6D,EACzC,GACA,IAIOi0C,GAA4B34C,GAAQ4F,GAAMif,IAAc6pB,IAA8E,IAA7E,MAAEpoC,EAAK,QAAE+jB,EAAO,OAAEU,EAAM,KAAEgD,EAAI,MAAE9T,EAAK,YAAEg0B,EAAW,MAAEvlB,EAAK,YAAE4B,GAAaokB,EAC5I,MAAMkJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CutB,EAAeb,GAAmB,CAAE1wC,UAEpCsyC,EAAYF,GAAgB,CAAEpyC,QAAOynB,OAAM9T,UA8CjD,OAAO3T,EAAM,MAAO,CAClB0f,OAAQ4yB,EAAUhwC,WAAWod,OAC7B,6BAA8B4yB,EAAUhwC,WAAW,iBAEnDyhB,QAAS,SAAUxpB,GACjB,OAAO,IAAIwpB,EACRxpB,EAAEoc,GAAK,EAAKtP,KAAKsM,MAAMpZ,EAAEoc,IAAMtP,KAAKogB,KAAKltB,EAAEoc,IAC3Cpc,EAAEo6B,GAAK,EAAKttB,KAAKsM,MAAMpZ,EAAEo6B,IAAMttB,KAAKogB,KAAKltB,EAAEo6B,IAEhD,EAEA,kBAAmB,SAAUp6B,EAAG6D,GAC9B,OAAO,IAAI2lB,EACRxpB,EAAEoc,GAAK,EAAKhD,EAAMpZ,EAAEoc,GAAIvY,GAAKqpB,EAAKltB,EAAEoc,GAAIvY,GACxC7D,EAAEo6B,GAAK,EAAKhhB,EAAMpZ,EAAEo6B,GAAIv2B,GAAKqpB,EAAKltB,EAAEo6B,GAAIv2B,GAE7C,EAEA,qBAAsB,SAAU7D,EAAGg4C,GACjC,MAAMn0C,EAAIm0C,EAAG/vB,WACb,OAAO,IAAIuB,EACRxpB,EAAEoc,GAAK,EAAKhD,EAAMpZ,EAAEoc,GAAIvY,GAAKqpB,EAAKltB,EAAEoc,GAAIvY,GACxC7D,EAAEo6B,GAAK,EAAKhhB,EAAMpZ,EAAEo6B,GAAIv2B,GAAKqpB,EAAKltB,EAAEo6B,GAAIv2B,GAE7C,EAEA0lB,UAAW,SAAUvpB,GACnB,OAAOA,EAAEoyB,aAAelF,EAAKltB,GAAKoZ,EAAMpZ,EAC1C,EAEA,gCAAiC,SAAUA,EAAG6D,GAC5C,OAAO7D,EAAEoyB,aAAelF,EAAKltB,EAAG6D,GAAKuV,EAAMpZ,EAAG6D,EAChD,EAEAsoC,OAAQjzB,GAAKA,EACb,iBAAkBk+B,CAACl+B,EAAGm+B,IAAWn+B,EACjC,oBAAqBo+B,CAACp+B,EAAGm+B,IAAWn+B,EAEpCwQ,SAAU,SAAU1pB,GAClB,OAAOA,EAAEyJ,EAAI,GAAKzJ,EAAEktB,OAASltB,EAAEoZ,OACjC,EAEA,+BAAgC,SAAUpZ,EAAG6D,GAC3C,OAAO7D,EAAEyJ,EAAI,GAAKyjB,EAAKltB,EAAG6D,GAAKuV,EAAMpZ,EAAG6D,EAC1C,EAEA,qBAAsB4B,EAAM6L,aAAYH,GAAQ,SAAUnR,EAAG6D,EAAG0tC,GAC9D,MAAMgG,EAAYv3C,EAAEw3C,UAAUjG,GAC9B,OAAOA,EAAKkG,SAAStmC,EAAKomC,EAAW1zC,GACvC,IAEA,wBAAyB4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAASpgC,EAAKnR,EAAG6D,EAAEokB,WAAYspB,KAEzF,2CAA4C9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAEpEhM,GAAQvlC,GAAIgH,GAAUmK,EAAKnK,EAAOnD,EAAG0tC,KAAO,KAGrD,8BAA+B9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGuxC,IAASpgC,EAAKnR,EAAG,EAAGuxC,KAEjF,iBAAkB9rC,EAAM6L,aAAYH,GAASnR,GAEpCulC,GAAQvlC,EAAGmR,GAAM,KAG1B,qCAAsC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAE3D0hC,GAAQvlC,GAAGsB,GAAK6P,EAAK7P,EAAGuC,KAAI,KAGrC,iDACE4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAErB+2C,EAAa9sB,EAAOjqB,GAAID,EAAGmR,GAAM,GAAM6N,YAGlD,kDACEvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACxBmtC,EAAYptC,EAAG,GAAW6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAC5B,UAAhBl/B,EAAEk/B,UACG6X,EAAa/2C,EAAGD,EAAGmR,GAAM,GAE3B4lC,EAAc92C,EAAGD,EAAGmR,GAAM,MAErC,ICnJEpM,GAAO,QACPif,GAAe,CAAC,QAAS,SAAU,QAAS,SAAU,cAAe,QAAS,eAE9E0yB,GAAS,IAAIze,GAAQ,IAEdggB,GAAoC94C,GAC/C4F,GAAM,CAAC,QAAS,SAAU,UAAUlC,IAA8B,IAA7B,MAAE4C,EAAK,OAAEyf,EAAM,MAAEH,GAAOliB,EAC3D,SAASq1C,EAAcl4C,GAGrB,MAAMU,EAAIoM,KAAKsM,MAAMpZ,GACfub,EAAIwJ,EAAM/kB,GAChB,OAAIU,IAAM6a,EAAU7a,EAKlB8nB,GAAYxoB,EAAGub,EAAG2J,EAAOuD,OAAQvD,EAAOwD,UACvCF,GAAYxoB,EAAGU,EAAGwkB,EAAOuD,OAAQvD,EAAOwD,QAElCnN,EAKF7a,CACT,CAEA,OAAO+E,EAAMV,GAAM,CACjBogB,OAAQ+yB,EACR,iBAAkB,SAAUl4C,EAAG6D,GAC7B,IAAKghB,GAAUhhB,GACb,MAAM,IAAI4jC,WACR,2DAEJ,GAAI5jC,EAAI,GAAKA,EAAI,GACf,MAAM,IAAI4jC,WACR,8DAEJ,MAAMpf,EAAQ,IAAMxkB,EACpB,OAAOq0C,EAAal4C,EAAIqoB,GAASA,CACnC,GACA,IAIO8vB,GAA8Bh5C,GAAQ4F,GAAMif,IAAc6pB,IAAuE,IAAtE,MAAEpoC,EAAK,OAAEyf,EAAM,MAAEH,EAAK,OAAEmF,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,GAAaokB,EACvI,MAAMiJ,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CutB,EAAeb,GAAmB,CAAE1wC,UAEpC2yC,EAAcH,GAAkB,CAAExyC,QAAOyf,SAAQH,UACvD,SAASszB,EAAWr4C,GAElB,MAAMm3C,EAAMA,CAACh+B,EAAGD,IAAMszB,GAAerzB,EAAGD,EAAGgM,EAAOuD,OAAQvD,EAAOwD,QAC3DhoB,EAAIV,EAAEoZ,QACNmC,EAAIwJ,EAAM/kB,GAChB,OAAIU,EAAEkvB,GAAGrU,GAAW7a,EAChBy2C,EAAIn3C,EAAGub,KAAO47B,EAAIn3C,EAAGU,GAAW6a,EAC7B7a,CACT,CAkDA,OAAO+E,EAAM,QAAS,CACpB0f,OAAQizB,EAAYrwC,WAAWod,OAC/B,gBAAiBizB,EAAYrwC,WAAW,iBAExCyhB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEoZ,OACX,EAEA,kBAAmB,SAAUpZ,EAAG6D,GAC9B,OAAO7D,EAAEoZ,MAAMvV,EACjB,EAEA,qBAAsB,SAAU7D,EAAG6D,GACjC,OAAO7D,EAAEoZ,MAAMvV,EAAEokB,WACnB,EAEAsB,UAAW8uB,EAEX,uBAAwB,SAAUr4C,EAAG6D,GACnC,MAAMwkB,EAAQquB,GAAOh9B,IAAI7V,GACzB,OAAOw0C,EAAUr4C,EAAEi0B,IAAI5L,IAAQ2H,IAAI3H,EACrC,EAEA8jB,OAAQjzB,GAAKA,EACb,iBAAkBk+B,CAACl+B,EAAGm+B,IAAWn+B,EACjC,oBAAqBo+B,CAACp+B,EAAGm+B,IAAWn+B,EAEpCwQ,SAAU,SAAU1pB,GAClB,OAAOA,EAAEoZ,OACX,EAEA,mBAAoB,SAAUpZ,EAAG6D,GAC/B,OAAO7D,EAAEoZ,MAAMvV,EACjB,EAEA,sBAAuB,SAAU7D,EAAG6D,GAClC,OAAO7D,EAAEoZ,MAAMvV,EAAEokB,WACnB,EAEA,qBAAsBxiB,EAAM6L,aAAYH,GAAQ,SAAUnR,EAAG6D,EAAG0tC,GAC9D,MAAMgG,EAAYv3C,EAAEw3C,UAAUjG,GAC9B,OAAOA,EAAKkG,SAAStmC,EAAKomC,EAAW1zC,GACvC,IAEA,wBAAyB4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAASpgC,EAAKnR,EAAG6D,EAAEokB,WAAYspB,KAEzF,2CAA4C9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAEpEhM,GAAQvlC,GAAIgH,GAAUmK,EAAKnK,EAAOnD,EAAG0tC,KAAO,KAGrD,8BAA+B9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGuxC,IAASpgC,EAAKnR,EAAG,EAAGuxC,KAEjF,iBAAkB9rC,EAAM6L,aAAYH,GAASnR,GAEpCulC,GAAQvlC,EAAGmR,GAAM,KAG1B,4BAA6B1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAElD0hC,GAAQvlC,GAAGsB,GAAK6P,EAAK7P,EAAGuC,KAAI,KAGrC,mCAAoC4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACzD62C,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACxD+2C,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,iDACE1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAErB+2C,EAAa9sB,EAAOjqB,GAAID,EAAGmR,GAAM,GAAM6N,YAGlD,kDACEvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACxBmtC,EAAYptC,EAAG,GAAW6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAC5B,UAAhBl/B,EAAEk/B,UACG6X,EAAa/2C,EAAGD,EAAGmR,GAAM,GAE3B4lC,EAAc92C,EAAGD,EAAGmR,GAAM,MAErC,ICtMSmnC,GAAsCn5C,GAHtC,gBACQ,CAAC,QAAS,gBAEgD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAoBpG,OAAO,SAAwB01C,EAAaC,EAAczoC,EAAUw7B,GAElE,MAAM6K,EAAQmC,EAAYvW,MACpB2T,EAAQ4C,EAAY9W,MACpBmU,EAAM2C,EAAY1Q,WAAa0Q,EAAYpQ,cAE3CsQ,EAAUD,EAAa9M,QACvBgN,EAASF,EAAa5M,OACtB+M,EAAOH,EAAa1M,KACpB8M,EAAQJ,EAAa/W,MACrBoX,EAAML,EAAa3Q,gBAAoC/kC,IAAvB01C,EAAaxW,MAAsBwW,EAAa3Q,UAAY2Q,EAAarQ,cAG/G,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAI5iC,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAGb,IAAK,IAAIz0C,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhCy0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,IAAK,IAAIwrC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5D,MAAMgB,EAAIo3C,EAAOp4C,GAEXw4C,EAAMvN,EAAUuK,EAAG2C,EAAQn4C,GAAI81C,EAAM90C,GAAGC,IAAMu0C,EAAGM,EAAM90C,GAAGC,GAAIk3C,EAAQn4C,IAEvEsvB,EAAGkpB,EAAK5K,KAEX5C,EAAO9pC,KAAKF,GACZy0C,EAAQv0C,KAAKs3C,GAEjB,CACF,CAKA,OAHA9C,EAAKnM,GAAWyB,EAAO/qC,OAGhBi4C,EAAa/J,mBAAmB,CACrCnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQ2C,EAAY1Q,WAAagR,IAAQL,EAAa3Q,UAAYgO,OAAK/yC,GAErF,CAAC,ICpGUi2C,GAAsC55C,GAHtC,gBACQ,CAAC,UAEyD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAoBvF,OAAO,SAAwB01C,EAAaC,EAAczoC,EAAUw7B,GAElE,MAAM6K,EAAQmC,EAAYvW,MACpB2T,EAAQ4C,EAAY9W,MACpBmU,EAAM2C,EAAY1Q,WAAa0Q,EAAYpQ,cAE3CsQ,EAAUD,EAAa9M,QACvBgN,EAASF,EAAa5M,OACtB+M,EAAOH,EAAa1M,KACpB8M,EAAQJ,EAAa/W,MACrBoX,EAAML,EAAa3Q,gBAAoC/kC,IAAvB01C,EAAaxW,MAAsBwW,EAAa3Q,UAAY2Q,EAAarQ,cAG/G,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAI5iC,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEA3H,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAEL1H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAMK,EAAQ,GAGd,IAAK,IAAIh2C,EAAI,EAAGA,EAAIypC,EAAMzpC,IAExBg2C,EAAMh2C,GAAK,GAIb,MAAMF,EAAI,GAEJG,EAAI,GAGV,IAAK,IAAIoB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAM8pC,EAAO9pC,EAAI,EAEjB,IAAK,IAAIwqC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5D,MAAMgB,EAAIo3C,EAAOp4C,GAEjBN,EAAEsB,GAAKiqC,EAAUuK,EAAG2C,EAAQn4C,GAAI81C,EAAM90C,GAAGC,IAAMu0C,EAAGM,EAAM90C,GAAGC,GAAIk3C,EAAQn4C,IACvEH,EAAEmB,GAAK+pC,CACT,CAEA,IAAK,IAAIprC,EAAI,EAAGA,EAAI0pC,EAAM1pC,IAEpBE,EAAEF,KAAOorC,EAEX6K,EAAMj2C,GAAGsB,GAAKvB,EAAEC,GAGhBi2C,EAAMj2C,GAAGsB,GAAKgqC,EAAUuK,EAAG5H,EAAMkI,EAAMn2C,GAAGsB,IAAMu0C,EAAGM,EAAMn2C,GAAGsB,GAAI2sC,EAGtE,CAGA,OAAOqK,EAAYrQ,kBAAkB,CACnCnkC,KAAMmyC,EACNz2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQ2C,EAAY1Q,WAAagR,IAAQL,EAAa3Q,UAAYgO,OAAK/yC,GAErF,CAAC,IC3GUk2C,GAAuC75C,GAHvC,iBACQ,CAAC,QAAS,gBAEiD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAmBrG,OAAO,SAAyBsW,EAAGD,EAAGnJ,GAEpC,MAAM07B,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT8M,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,MAAMjP,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAUtK,GAAWgN,EAAU,QAAK31C,EACpCwoC,EAAS,GACT0K,EAAO,GAGPiD,EAAKlD,EAAU,QAAKjzC,EACpBo2C,EAAKnD,EAAU,QAAKjzC,EAEpBq2C,EAAK,GACLC,EAAK,GAGX,IAAI93C,EAAGC,EAAGjB,EAAG0rC,EAGb,IAAKzqC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5By0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,MAAM8qC,EAAO9pC,EAAI,EAEjB,IAAKjB,EAAIurC,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAI0rC,EAAI1rC,IAE1CgB,EAAIqqC,EAAOrrC,GAEXgrC,EAAO9pC,KAAKF,GAEZ63C,EAAG73C,GAAK+pC,EAEJ4N,IAAMA,EAAG33C,GAAKmqC,EAAQnrC,IAG5B,IAAKA,EAAIq4C,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAI0rC,EAAI1rC,IAE1CgB,EAAIo3C,EAAOp4C,GAEP64C,EAAG73C,KAAO+pC,GAEZC,EAAO9pC,KAAKF,GAGd83C,EAAG93C,GAAK+pC,EAEJ6N,IAAMA,EAAG53C,GAAKm3C,EAAQn4C,IAG5B,GAAIy1C,EAIF,IAFAz1C,EAAI01C,EAAKz0C,GAEFjB,EAAIgrC,EAAO/qC,QAAQ,CAExBe,EAAIgqC,EAAOhrC,GAEX,MAAM+4C,EAAMF,EAAG73C,GACTg4C,EAAMF,EAAG93C,GAEf,GAAI+3C,IAAQhO,GAAQiO,IAAQjO,EAAM,CAEhC,MAGMkO,EAAKzD,EAHAuD,IAAQhO,EAAO4N,EAAG33C,GAAK4sC,EACvBoL,IAAQjO,EAAO6N,EAAG53C,GAAK4sC,GAI7Bte,EAAG2pB,EAAIrL,GAOV5C,EAAOzzB,OAAOvX,EAAG,IALjBy1C,EAAQv0C,KAAK+3C,GAEbj5C,IAKJ,CACF,CAEJ,CAKA,OAHA01C,EAAKnM,GAAWyB,EAAO/qC,OAGhB4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CAAC,ICzJU02C,GAAqCr6C,GAHrC,eACQ,CAAC,UAEwD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAetF,OAAO,SAAuBsW,EAAGD,EAAGnJ,GAElC,MAAMqmC,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,UAER4R,EAAQvgC,EAAE8oB,MACV4W,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,UAER6R,EAAQ,GAGd,GAAI/D,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,IAAK,IAAIkJ,EAAI,EAAGA,EAAIksC,EAAMp1C,OAAQkJ,IAAK,CAErC,GAAIksC,EAAMlsC,KAAOmvC,EAAMnvC,GAAM,MAAM,IAAIg+B,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAEjIc,EAAMjwC,GAAKksC,EAAMlsC,EACnB,CAGA,IAAIosC,EAEAC,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,IAErChD,EAAKD,EAELE,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAMK,EAAQwD,EAAMn5C,OAAS,EAAI81C,EAASP,EAAI,EAAG4D,EAAOA,EAAM,GAAItD,EAAOqD,GAAS,GAGlF,OAAOtgC,EAAE+uB,kBAAkB,CACzBnkC,KAAMmyC,EACNz2B,KAAMi6B,EACNta,SAAUyW,GAEd,EAGA,SAASQ,EAAU31C,EAAG41C,EAAO7sC,EAAG5F,EAAG0yC,EAAIC,GAErC,MAAMC,EAAK,GAEX,GAAIH,IAAU7sC,EAAElJ,OAAS,EAEvB,IAAK,IAAIe,EAAI,EAAGA,EAAIuC,EAAGvC,IAErBm1C,EAAGn1C,GAAKZ,EAAE61C,EAAGj1C,GAAIk1C,EAAGl1C,SAItB,IAAK,IAAIC,EAAI,EAAGA,EAAIsC,EAAGtC,IAErBk1C,EAAGl1C,GAAK80C,EAAS31C,EAAG41C,EAAQ,EAAG7sC,EAAGA,EAAE6sC,EAAQ,GAAIC,EAAGh1C,GAAIi1C,EAAGj1C,IAG9D,OAAOk1C,CACT,KC1EK,SAASkD,GAAWtd,EAAGC,GAC5B,GAAIjZ,GAAgBgZ,EAAE5c,OAAQ6c,EAAE7c,QAE9B,MAAO,CAAC4c,EAAGC,GAIb,MAAM0L,EAAUxD,GAAenI,EAAE5c,OAAQ6c,EAAE7c,QAG3C,MAAO,CAAC4c,EAAGC,GAAGpzB,KAAIwzB,GAWpB,SAAuBA,EAAGjd,GACxB,OAAI4D,GAAgBqZ,EAAEjd,OAAQA,GACrBid,EAEFA,EAAE/3B,OAAOogC,GAAYrI,EAAE1d,UAAWS,GAAOid,EAAE0C,WACpD,CAhByBwa,CAAald,EAAGsL,IACzC,CClBA,MAGa6R,GAA6C16C,GAH7C,uBACQ,CAAC,QAAS,WAGT0D,IAAuB,IAAtB,MAAE4C,EAAK,OAAEykB,GAAQrnB,EACpC,MAAMi3C,EAAeN,GAAmB,CAAE/zC,UACpCuxC,EAAeb,GAAmB,CAAE1wC,UAmB1C,OAAO,SAA+B+B,GACpC,MAAMuyC,EAAOvyC,EAAQuyC,KACfC,EAAKxyC,EAAQwyC,IAAMxyC,EAAQyyC,GACjC,IAAIC,EACAH,GAEFG,EAAmB,CACjB,2BAA4BC,CAACn6C,EAAGC,IAAM65C,KAAgBH,GAAU35C,EAAGC,GAAI85C,GACvE,eAAgBK,CAACp6C,EAAGC,IAClB65C,KAAgBH,GAAUzvB,EAAOlqB,GAAIkqB,EAAOjqB,IAAK85C,GAAM/6B,UACzD,qBAAsBq7B,CAACr6C,EAAGC,IAAM65C,KAAgBH,GAAUzvB,EAAOlqB,GAAIC,GAAI85C,GACzE,qBAAsBO,CAACt6C,EAAGC,IAAM65C,KAAgBH,GAAU35C,EAAGkqB,EAAOjqB,IAAK85C,IAGvEvyC,EAAQ+yC,KACVL,EAAiB,8BACf,CAACl6C,EAAGC,IAAMuH,EAAQ+yC,MAAMZ,GAAU35C,EAAGC,GAAI85C,GAAM,IAE/CvyC,EAAQyyC,KACVC,EAAiB,6BACf,CAACl6C,EAAGC,IAAMuH,EAAQyyC,MAAMN,GAAU35C,EAAGC,GAAI85C,GAAM,GACjDG,EAAiB,uBACf,CAACl6C,EAAGC,IAAMuH,EAAQyyC,MAAMN,GAAUzvB,EAAOlqB,GAAIC,GAAI85C,GAAM,IAEvDC,IACFE,EAAiB,6BACf,CAACl6C,EAAGC,IAAM+5C,KAAML,GAAU15C,EAAGD,GAAI+5C,GAAM,GACzCG,EAAiB,uBACf,CAACl6C,EAAGC,IAAM+5C,KAAML,GAAUzvB,EAAOjqB,GAAID,GAAI+5C,GAAM,MAKnDG,EAAmB,CACjB,2BAA4Bz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACjD65C,KAAgBH,GAAU35C,EAAGC,GAAIkR,KAE1C,eAAgB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrC65C,KAAgBH,GAAUzvB,EAAOlqB,GAAIkqB,EAAOjqB,IAAKkR,GAAM6N,YAEhE,qBAAsBvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAC3C65C,KAAgBH,GAAUzvB,EAAOlqB,GAAIC,GAAIkR,KAElD,qBAAsB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAC3C65C,KAAgBH,GAAU35C,EAAGkqB,EAAOjqB,IAAKkR,MAIhD3J,EAAQ+yC,KACVL,EAAiB,8BACfz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrBuH,EAAQ+yC,MAAMZ,GAAU35C,EAAGC,GAAIkR,GAAM,MAG9C3J,EAAQyyC,KACVC,EAAiB,6BACfz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrBuH,EAAQyyC,MAAMN,GAAU35C,EAAGC,GAAIkR,GAAM,KAEhD+oC,EAAiB,uBACfz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrBuH,EAAQyyC,MAAMN,GAAUzvB,EAAOlqB,GAAIC,GAAIkR,GAAM,MAGtD6oC,IACFE,EAAiB,6BACfz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+5C,KAAML,GAAU15C,EAAGD,GAAImR,GAAM,KAExC+oC,EAAiB,uBACfz0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+5C,KAAML,GAAUzvB,EAAOjqB,GAAID,GAAImR,GAAM,OAMpD,MAAMqpC,EAAShzC,EAAQgzC,QAAU,OACtBhzC,EAAQizC,IAAMjzC,EAAQkzC,MAE3BX,GACFG,EAAiB,eAAiBM,GAChC,CAACx6C,EAAGC,IAAM+2C,EAAah3C,EAAGC,EAAG85C,GAAM,GACrCG,EAAiBM,EAAS,iBACxB,CAACx6C,EAAGC,IAAM+2C,EAAa/2C,EAAGD,EAAG+5C,GAAM,GACrCG,EAAiB,SAAWM,GAC1B,CAACx6C,EAAGC,IAAM+2C,EAAa9sB,EAAOlqB,GAAIC,EAAG85C,GAAM,GAAO/6B,UACpDk7B,EAAiBM,EAAS,WACxB,CAACx6C,EAAGC,IAAM+2C,EAAa9sB,EAAOjqB,GAAID,EAAG+5C,GAAM,GAAM/6B,YAEnDk7B,EAAiB,eAAiBM,GAChC/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+2C,EAAah3C,EAAGC,EAAGkR,GAAM,KAEpC+oC,EAAiBM,EAAS,iBACxB/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+2C,EAAa/2C,EAAGD,EAAGmR,GAAM,KAEpC+oC,EAAiB,SAAWM,GAC1B/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+2C,EAAa9sB,EAAOlqB,GAAIC,EAAGkR,GAAM,GAAO6N,YAEnDk7B,EAAiBM,EAAS,WACxB/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB+2C,EAAa9sB,EAAOjqB,GAAID,EAAGmR,GAAM,GAAM6N,cAItD,MAAM27B,OAAqB73C,IAAf0E,EAAQmzC,GAAoBnzC,EAAQmzC,GAAKnzC,EAAQkzC,GA4B7D,OA3BIX,GACEvyC,EAAQkzC,KACVR,EAAiB,gBAAkBM,GACjC,CAACx6C,EAAGC,IAAMuH,EAAQkzC,GAAG16C,EAAGC,EAAG85C,GAAM,IAEjCY,IACFT,EAAiBM,EAAS,kBACxB,CAACx6C,EAAGC,IAAM06C,EAAG16C,EAAGD,EAAG+5C,GAAM,MAGzBvyC,EAAQkzC,KACVR,EAAiB,gBAAkBM,GACjC/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrBuH,EAAQkzC,GAAG16C,EAAGC,EAAGkR,GAAM,MAGhCwpC,IACFT,EAAiBM,EAAS,kBACxB/0C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IACrB06C,EAAG16C,EAAGD,EAAGmR,GAAM,OAK1B4oC,GAAQA,EAAKhyC,YACfob,GAAO+2B,EAAkBH,EAAKhyC,YAEzBmyC,CACT,CAAC,ICnJQU,GAA4Bz7C,GAZ5B,MACQ,CACnB,QACA,SACA,QACA,SACA,cACA,QACA,cACA,WAGmE0D,IAA+E,IAA9E,MAAE4C,EAAK,OAAEyf,EAAM,MAAEH,EAAK,OAAEmF,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,EAAW,OAAE7iB,GAAQ/D,EAC7I,MAAMuW,EAAQ++B,GAAY,CAAE1yC,QAAOyf,SAAQH,QAAOmF,SAAQkjB,cAAavlB,QAAO4B,gBACxEoxB,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C0N,EAAgB/B,GAAoB,CAAEtzC,UACtCs1C,EAAiB/B,GAAqB,CAAEvzC,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAsCnD,OAAOhkB,EAxDI,MA0DT,CACE,iBAuCJ,SAAqBzF,EAAGC,GAOtB,OAAc,IAANA,EAAWD,EAAIA,EAAIC,EAAImZ,EAAMpZ,EAAIC,EAC3C,EA7CI,uBAAwB,SAAUD,EAAGC,GACnC,OAAOA,EAAE4uB,SAAW7uB,EAAIA,EAAEizB,IAAIhzB,EAAEg0B,IAAI7a,EAAMpZ,EAAEgwB,IAAI/vB,KAClD,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,GAAU,KAANA,EACF,OAAOD,EAGT,GAAIA,EAAI,EAAG,CACT,MAAMuvB,EAAIvvB,EAAIC,EACd,OAAa,KAANsvB,EAAWA,EAAIA,EAAItvB,CAC5B,CAEA,OAAOD,EAAIC,CACb,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOA,EAAEkwB,OAAO,GAAKnwB,EAAIA,EAAEizB,IAAIhzB,EAAEg0B,IAAI7a,EAAMpZ,EAAEgwB,IAAI/vB,KACnD,GA7DyB45C,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,UA+DvEo0C,CAAqB,CACnBT,GAAIQ,EACJd,GAAIa,EACJd,GAAIa,EACJH,GAAI5D,EACJ6D,GAAI5D,IAmBR,IC7GWkE,GAAuC97C,GAHvC,iBACQ,CAAC,UAE0D0D,IAAe,IAAd,MAAE4C,GAAO5C,EAoBxF,OAAO,SAAqB01C,EAAaC,EAAczoC,EAAUw7B,GAE/D,MAAM6K,EAAQmC,EAAYvW,MACpB2T,EAAQ4C,EAAY9W,MACpBmU,EAAM2C,EAAY1Q,WAAa0Q,EAAYpQ,cAE3CsQ,EAAUD,EAAa9M,QACvBgN,EAASF,EAAa5M,OACtB+M,EAAOH,EAAa1M,KACpB8M,EAAQJ,EAAa/W,MACrBoX,EAAML,EAAa3Q,gBAAoC/kC,IAAvB01C,EAAaxW,MAAsBwW,EAAa3Q,UAAY2Q,EAAarQ,cAG/G,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,IAAKH,EAAW,MAAM,IAAI5iC,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGhBE,EAAoB,iBAARD,GAA4B,UAARA,GAAmBA,IAAQiD,EAAMjD,OAAM9yC,EAEvEgzC,EAAKD,EAAKpwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,IAAO9lC,EAGjD,IAAIzO,EAAGC,EAGP,MAAM20C,EAAQ,GAEd,IAAK50C,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAO40C,EAAM50C,GAAK,GAGxC,MAAMtB,EAAI,GAEJG,EAAI,GAGV,IAAKoB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5B,MAAM8pC,EAAO9pC,EAAI,EAEjB,IAAK,IAAIwqC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEvDgB,EAAIo3C,EAAOp4C,GAEXN,EAAEsB,GAAKiqC,EAAUuK,EAAG2C,EAAQn4C,GAAI81C,EAAM90C,GAAGC,IAAMu0C,EAAGM,EAAM90C,GAAGC,GAAIk3C,EAAQn4C,IAEvEH,EAAEmB,GAAK+pC,EAGT,IAAK/pC,EAAI,EAAGA,EAAIqoC,EAAMroC,IAEhBnB,EAAEmB,KAAO+pC,EAEX6K,EAAM50C,GAAGC,GAAKvB,EAAEsB,GAGhB40C,EAAM50C,GAAGC,GAAK60C,EAAM90C,GAAGC,EAG7B,CAGA,OAAOg3C,EAAYrQ,kBAAkB,CACnCnkC,KAAMmyC,EACNz2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQ2C,EAAY1Q,WAAagR,IAAQL,EAAa3Q,UAAYgO,OAAK/yC,GAErF,CAAC,IC/FUo4C,GAAyC/7C,GAHzC,mBACQ,CAAC,QAAS,gBAEmD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAmBvG,OAAO,SAA2BsW,EAAGD,EAAGnJ,GAEtC,MAAM07B,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT8M,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,MAAMjP,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAUtK,GAAWgN,EAAU,QAAK31C,EACpCwoC,EAAS,GACT0K,EAAO,GAGPiD,EAAKxN,GAAWgN,EAAU,QAAK31C,EAC/Bo2C,EAAKzN,GAAWgN,EAAU,QAAK31C,EAE/Bq2C,EAAK,GACLC,EAAK,GAGX,IAAI93C,EAAGC,EAAGjB,EAAGyrC,EAAIC,EAGjB,IAAKzqC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5By0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,MAAM8qC,EAAO9pC,EAAI,EAEjB,IAAKwqC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIqqC,EAAOrrC,GAEXgrC,EAAO9pC,KAAKF,GAEZ63C,EAAG73C,GAAK+pC,EAEJ4N,IAAMA,EAAG33C,GAAKmqC,EAAQnrC,IAG5B,IAAKyrC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAInD,GAFAgB,EAAIo3C,EAAOp4C,GAEP64C,EAAG73C,KAAO+pC,GAEZ,GAAI4N,EAAI,CAEN,MAAM74C,EAAI01C,EAAGmD,EAAG33C,GAAIm3C,EAAQn4C,IAEvBsvB,EAAGxvB,EAAG8tC,GAKTiL,EAAG73C,GAAK,KAHR23C,EAAG33C,GAAKlB,CAKZ,OAGAkrC,EAAO9pC,KAAKF,GAEZ83C,EAAG93C,GAAK+pC,EAEJ6N,IAAMA,EAAG53C,GAAKm3C,EAAQn4C,IAI9B,GAAI24C,GAAMC,EAIR,IAFA54C,EAAI01C,EAAKz0C,GAEFjB,EAAIgrC,EAAO/qC,QAEhBe,EAAIgqC,EAAOhrC,GAEP64C,EAAG73C,KAAO+pC,GAEZ0K,EAAQz1C,GAAK24C,EAAG33C,GAEhBhB,KACS84C,EAAG93C,KAAO+pC,GAEnB0K,EAAQz1C,GAAK44C,EAAG53C,GAEhBhB,KAGAgrC,EAAOzzB,OAAOvX,EAAG,EAIzB,CAKA,OAHA01C,EAAKnM,GAAWyB,EAAO/qC,OAGhB4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CAAC,IClKUq4C,GAAuCh8C,GAHvC,iBACQ,CAAC,QAAS,gBAEiD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAEgkB,GAAa5mB,EAoBrG,OAAO,SAAyB4G,EAAGyP,EAAGnJ,EAAUw7B,GAE9C,MAAME,EAAUhiC,EAAEiiC,QACZC,EAASliC,EAAEmiC,OACXC,EAAOpiC,EAAEqiC,KACT6J,EAAQlsC,EAAEg4B,MACVmU,EAAMnsC,EAAEo+B,UAGd,IAAK4D,EAAW,MAAM,IAAI51B,MAAM,sEAGhC,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAC,EAAK/lC,EAGU,iBAAR6lC,IAETC,EAAKD,EAEL18B,EAAIzT,EAAM8J,QAAQ2J,EAAG28B,GAErBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAMK,EAAQ,GAGRl2C,EAAI,GAEJG,EAAI,GAGV,IAAK,IAAIoB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAM8pC,EAAO9pC,EAAI,EAEjB,IAAK,IAAIwqC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5D,MAAMib,EAAIowB,EAAOrrC,GAEjBN,EAAEub,GAAKkwB,EAAQnrC,GACfH,EAAEob,GAAK8vB,CACT,CAEA,IAAK,IAAI/pC,EAAI,EAAGA,EAAIqoC,EAAMroC,IAEd,IAANC,IAEF20C,EAAM50C,GAAK,IAGTnB,EAAEmB,KAAO+pC,EAEX6K,EAAM50C,GAAGC,GAAKgqC,EAAUuK,EAAG58B,EAAGlZ,EAAEsB,IAAMw0C,EAAG91C,EAAEsB,GAAI4X,GAG/Cg9B,EAAM50C,GAAGC,GAAK2X,CAGpB,CAGA,OAAO,IAAIuQ,EAAY,CACrB1lB,KAAMmyC,EACNz2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUyW,GAEd,CAAC,IC1FI,SAASuF,GAAgB9zC,EAAIgU,EAAOvO,EAAKG,GAC9C,KAAM1N,gBAAgB47C,IACpB,MAAM,IAAIlwC,YAAY,oDAGxB1L,KAAK8H,GAAKA,EACV9H,KAAK8b,MAAQA,EACb9b,KAAKuN,IAAMA,EACXvN,KAAK0N,IAAMA,EAEX1N,KAAKuG,QAAU,yCAA2CuB,EACtD,KAAOgU,EAAQ,cACfvO,GAAQG,QAAsC,IAAMA,EAAO,IAAM,aAErE1N,KAAKuhC,OAAS,IAAIlrB,OAASkrB,KAC7B,CAEAqa,GAAeh5C,UAAY,IAAIyT,MAC/BulC,GAAeh5C,UAAUyC,YAAcgR,MACvCulC,GAAeh5C,UAAU2C,KAAO,iBAChCq2C,GAAeh5C,UAAUi5C,kBAAmB,ECpB5C,MAaMC,GAAW,iDACXC,GAAwB,GAAGD,OAAaA,UAAgBA,KAE9D,SAASE,GAAMxxB,GACb,OAAQA,EAAMjhB,MAAK0yC,GAAWx2C,MAAMC,QAAQu2C,IAC9C,CAEO,MAAMC,GAA4Bv8C,GApB5B,MACQ,CACnB,QACA,SACA,QACA,SACA,cACA,QACA,YACA,cACA,WAUmE0D,IAA0F,IAAzF,MAAE4C,EAAK,OAAEykB,EAAM,OAAEhF,EAAM,MAAEH,EAAK,YAAEqoB,EAAW,MAAEvlB,EAAK,UAAE0B,EAAS,YAAEE,EAAW,OAAE7iB,GAAQ/D,EACxJ,MAAMwwB,EAAMunB,GAAU,CAAEn1C,QAAOyf,SAAQH,QAAOmF,SAAQkjB,cAAavlB,QAAO4B,cAAa7iB,WACjF+0C,EAAiBV,GAAqB,CAAEx1C,UACxCm2C,EAAmBV,GAAuB,CAAEz1C,QAAO2nC,gBACnDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBA4BrD,OAAOhkB,EApDI,MAsDT,CACE,iBAuCJ,SAAqB0T,EAAGD,GACtB,IAAK2L,GAAU1L,KAAO0L,GAAU3L,GAC9B,MAAM,IAAIrD,MAAM,sDAIlB,IAAI0F,EACJ,KAAa,IAANrC,GACLqC,EAAI8X,EAAIla,EAAGD,GACXC,EAAID,EACJA,EAAIqC,EAEN,OAAQpC,EAAI,GAAMA,EAAIA,CACxB,EAnDI,uBA4DJ,SAAwBA,EAAGD,GACzB,IAAKC,EAAEgZ,UAAYjZ,EAAEiZ,QACnB,MAAM,IAAItc,MAAM,sDAIlB,MAAMq4B,EAAO,IAAI3kB,EAAU,GAC3B,MAAQrQ,EAAE2V,UAAU,CAClB,MAAMtT,EAAI8X,EAAIla,EAAGD,GACjBC,EAAID,EACJA,EAAIqC,CACN,CACA,OAAOpC,EAAEqZ,GAAG0b,GAAQ/0B,EAAEkW,MAAQlW,CAChC,EAxEI,qBAAsB2iC,CAAC97C,EAAGC,IAAMD,EAAE+7B,IAAI97B,IAhCb45C,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,UAkCvEo0C,CAAqB,CACnBT,GAAIqB,EACJ3B,GAAI0B,EACJjB,GAAImB,IAEN,CACE,CAACN,IAAwB91C,EAAM6L,aAAYH,GAAQ,CAACgI,EAAGD,EAAGpN,KACxD,IAAI2uB,EAAMtpB,EAAKgI,EAAGD,GAClB,IAAK,IAAI5X,EAAI,EAAGA,EAAIwK,EAAKvL,OAAQe,IAC/Bm5B,EAAMtpB,EAAKspB,EAAK3uB,EAAKxK,IAEvB,OAAOm5B,CAAG,IAEZx1B,MAAOQ,EAAM6L,aAAYH,GAAS6Y,IAChC,GAAqB,IAAjBA,EAAMzpB,QAAgB0E,MAAMC,QAAQ8kB,EAAM,KAAOwxB,GAAKxxB,EAAM,IAC9D,OAAO7Y,KAAQ6Y,EAAM,IAEvB,GAAIwxB,GAAKxxB,GACP,OAAO7Y,KAAQ6Y,GAEjB,MAAM,IAAIoxB,GAAe,mCAAmC,IAE9Dlc,OAAQz5B,EAAM6L,aAAYH,GAAS+Y,GAC1B/Y,EAAK+Y,EAAO8U,cA+CzB,ICnIW+c,GAAuC58C,GAHvC,iBACQ,CAAC,QAAS,gBAEiD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAmBrG,OAAO,SAAyBsW,EAAGD,EAAGnJ,GAEpC,MAAM07B,EAAUtyB,EAAEuyB,QACZiK,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZkN,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,MAAMjP,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAUtK,GAAWgN,EAAU,QAAK31C,EACpCwoC,EAAS,GACT0K,EAAO,GAGPh2C,EAAI+1C,EAAU,QAAKjzC,EAEnB3C,EAAI,GAEJg4B,EAAI,GAGV,IAAK,IAAI52B,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhCy0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,MAAM8qC,EAAO9pC,EAAI,EAMjB,GAJA6pC,GAAQjyB,EAAG5X,EAAGpB,EAAGH,EAAGm4B,EAAGkT,EAAMC,EAAQwK,GAErC1K,GAAQlyB,EAAG3X,EAAGpB,EAAGH,EAAGm4B,EAAGkT,EAAMC,EAAQwK,GAEjC91C,EAAG,CAEL,IAAIM,EAAI01C,EAAKz0C,GAEb,KAAOjB,EAAIgrC,EAAO/qC,QAAQ,CAExB,MAAMe,EAAIgqC,EAAOhrC,GAEjB,GAAI63B,EAAE72B,KAAO+pC,EAAM,CAEjB,MAAMjrC,EAAIJ,EAAEsB,GAEPsuB,EAAGxvB,EAAG8tC,GAOT5C,EAAOzzB,OAAOvX,EAAG,IALjBy1C,EAAQv0C,KAAKpB,GAEbE,IAKJ,MAEEgrC,EAAOzzB,OAAOvX,EAAG,EAErB,CACF,KAAO,CAEL,IAAI6I,EAAI6sC,EAAKz0C,GAEb,KAAO4H,EAAImiC,EAAO/qC,QAIZ43B,EAFMmT,EAAOniC,MAEJkiC,EAEXC,EAAOzzB,OAAO1O,EAAG,GAGjBA,GAGN,CACF,CAKA,OAHA6sC,EAAKnM,GAAWyB,EAAO/qC,OAGhB4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CAAC,IClIUk5C,GAA4B78C,GAR5B,MACQ,CACnB,QACA,SACA,cACA,WAGmE0D,IAA4C,IAA3C,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,OAAExmC,GAAQ/D,EAC1G,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C6O,EAAiBF,GAAqB,CAAEt2C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4N,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAEnEs1C,EAAW,iDACXC,EAAmB,CAAC,EAuC1B,OAtCAA,EAAiB,GAAGD,MAAaA,SAAgBA,KAC/Cz2C,EAAM6L,aAAYH,GAAQ,CAACgI,EAAGD,EAAGpN,KAC/B,IAAI2uB,EAAMtpB,EAAKgI,EAAGD,GAClB,IAAK,IAAI5X,EAAI,EAAGA,EAAIwK,EAAKvL,OAAQe,IAC/Bm5B,EAAMtpB,EAAKspB,EAAK3uB,EAAKxK,IAEvB,OAAOm5B,CAAG,IAgCPh1B,EAtDI,MAuDH,CACJ,iBAAkBkuC,GAClB,uBAkBJ,SAAwBx6B,EAAGD,GACzB,IAAKC,EAAEgZ,UAAYjZ,EAAEiZ,QACnB,MAAM,IAAItc,MAAM,sDAGlB,GAAIsD,EAAE0V,SACJ,OAAO1V,EAET,GAAID,EAAE2V,SACJ,OAAO3V,EAKT,MAAMgd,EAAO/c,EAAE6V,MAAM9V,GACrB,MAAQA,EAAE2V,UAAU,CAClB,MAAM9uB,EAAImZ,EACVA,EAAIC,EAAEka,IAAItzB,GACVoZ,EAAIpZ,CACN,CACA,OAAOm2B,EAAKlG,IAAI7W,GAAGiO,KACrB,EAtCI,qBAAsB00B,CAAC97C,EAAGC,IAAMD,EAAEo8C,IAAIn8C,IAExC+6C,EAAqB,CACnBT,GAAI0B,EACJhC,GAAIY,EACJH,GAAI5D,IAENqF,EA+BF,ICvFK,SAASE,GAAkBC,EAAOC,EAAWr3B,EAAQs3B,GAC1D,OAAO,SAAUtjC,GACf,GAAIA,EAAI,GAAKgM,EAAOu3B,YAAa,CAC/B,GAAIvjC,GAAK,EAAG,OAAO6U,IACnB,MAAMtkB,EAAIyP,EAAE9G,SAAS,IACfsqC,EAAMjzC,EAAEouB,UAAU,EAAG,IAC3B,OAAOykB,GAAS7yC,EAAElJ,OAASm8C,EAAIn8C,QAAUg8C,EAAU1yB,OAAO,KAAO6yB,GACnE,CACA,OAAOF,EAAKtjC,EAAE+O,WAChB,CACF,CCrBA,MAAMljB,GAAO,QACPif,GAAe,CAAC,QAAS,SAAU,WACnCs4B,GAAQzI,GAAY,IAEb8I,GAA8Bx9C,GAAQ4F,GAAMif,IAAcnhB,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EA2BhG,SAAS+5C,EAAY14C,GACnB,OAAOA,EAAEuhB,MAAMuK,IAAIljB,KAAK8Y,KAC1B,CAEA,SAASi3B,EAAkB78C,GACzB,OAAO48C,EAAW,IAAIpzB,EAAQxpB,EAAG,GACnC,CACA,OAAOyF,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,GAAK,GAAKklB,EAAOu3B,YACZ5I,GAAY7zC,GAGZ68C,EAAiB78C,EAE5B,EAEAmsC,OAAQkQ,GAAiBC,GAAOzI,GAAa3uB,EAAQ23B,GAErDrzB,QAASozB,EAETrzB,UAAW,SAAUvpB,GACnB,OAAKA,EAAEoyB,cAAgBlN,EAAOu3B,YACrBz8C,EAAEylB,MAGFo3B,EAAiB78C,EAAEioB,WAE9B,EAEA,iBAAkBxiB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC9DEpM,GAAO,OAGA+3C,GAA6B39C,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,YAE6BlC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EA0B/F,SAASk6C,EAAmB/8C,GAC1B,OAAOg9C,EAAa,IAAIxzB,EAAQxpB,EAAG,GACrC,CAEA,OAAOyF,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,GAAK,GAAKklB,EAAOu3B,YACZ3I,GAAW9zC,GAGX+8C,EAAkB/8C,EAE7B,EAEAmsC,OAAQkQ,GAAiB,EAAGvI,GAAY5uB,EAAQ63B,GAEhDvzB,QAASwzB,EAETzzB,UAAW,SAAUvpB,GACnB,OAAKA,EAAEoyB,cAAgBlN,EAAOu3B,YACrBz8C,EAAEylB,IAAI,GAGNs3B,EAAkB/8C,EAAEioB,WAE/B,EAEA,iBAAkBxiB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,OAS9D,SAAS6rC,EAAch9C,GACrB,MAAMi9C,EAAOnwC,KAAK8b,KAAK5oB,EAAEoc,GAAKpc,EAAEoc,GAAKpc,EAAEo6B,GAAKp6B,EAAEo6B,IAC9C,OAAO,IAAI5Q,EACR1c,KAAK0Y,KAAQ1Y,KAAK0Y,KAAKy3B,GAAQnwC,KAAK2Y,IAAIw3B,GAAQnwC,KAAK4Y,IACtD5Y,KAAKurB,MAAMr4B,EAAEo6B,GAAIp6B,EAAEoc,IAAMtP,KAAK4Y,IAElC,KCtEWw3B,GAAuC/9C,GAHvC,iBACQ,CAAC,UAE0D0D,IAAe,IAAd,MAAE4C,GAAO5C,EAaxF,OAAO4C,EAAM,iBAAkB,CAE7B,iBAAkB2tC,GAElB,mBAAoB,SAAUpzC,EAAGC,GAC/B,OAAOD,EAAEi0B,IAAIh0B,EACf,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEgvB,MAAM/uB,EACjB,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOD,EAAIC,CACb,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOD,EAAEi0B,IAAIh0B,EACf,EAEA,gDAAiDk9C,CAACn9C,EAAGC,IAAMA,EAAEw3C,SAASz3C,GAEtE,uDAAwDo9C,CAACp9C,EAAGC,IAAMD,EAAEy3C,SAASx3C,IAC7E,ICpCE8E,GAAO,WAUAs4C,GAAiCl+C,GAAQ4F,GATjC,CACnB,QACA,SACA,YACA,iBACA,cACA,QAGwElC,IAAoE,IAAnE,MAAE4C,EAAK,OAAEykB,EAAM,UAAEozB,EAAS,eAAEC,EAAc,YAAEnQ,EAAW,IAAEtlB,GAAKjlB,EACvI,MAAMi0C,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UAE1C,SAAS+3C,EAA2BC,EAAOC,GAEzC,OAAQD,EAAMl9C,QACZ,KAAK,EAEH,OAAQm9C,EAAMn9C,QACZ,KAAK,EAEH,GAAIk9C,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjW,WAAW,2EAEvB,MACF,KAAK,EAEH,GAAIgW,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjW,WAAW,wDAA0DgW,EAAM,GAAK,6BAA+BC,EAAM,GAAK,KAEtI,MACF,QACE,MAAM,IAAI7nC,MAAM,+DAAiE6nC,EAAMn9C,OAAS,gBAEpG,MACF,KAAK,EAEH,OAAQm9C,EAAMn9C,QACZ,KAAK,EAEH,GAAIk9C,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjW,WAAW,yDAA2DgW,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAEzI,MACF,KAAK,EAEH,GAAID,EAAM,KAAOC,EAAM,GAErB,MAAM,IAAIjW,WAAW,2DAA6DgW,EAAM,GAAK,+BAAiCC,EAAM,GAAK,KAE3I,MACF,QACE,MAAM,IAAI7nC,MAAM,+DAAiE6nC,EAAMn9C,OAAS,gBAEpG,MACF,QACE,MAAM,IAAIsV,MAAM,+DAAiE4nC,EAAMl9C,OAAS,gBAEtG,CAoGA,MAAMo9C,EAAwBl4C,EAAM,wBAAyB,CAC3D,mBA2BF,SAAqC0T,EAAGD,GAEtC,MAAMk9B,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,WAAa1uB,EAAEgvB,cAEvBsR,EAAQvgC,EAAE8oB,MACV6W,EAAM3/B,EAAE2uB,WAAa3uB,EAAEivB,cAEvByV,EAAQjI,EAAM,GACdkI,EAAWlI,EAAM,GAGvB,IAAIE,EAEAiI,EAAKR,EAELS,EAAKR,EAGL3H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,KAIvC,MAAM3xC,EAAI,GAGV,IAAK,IAAI5C,EAAI,EAAGA,EAAIs8C,EAAOt8C,IAAK,CAE9B,MAAMsoC,EAAMwM,EAAM90C,GAElB,IAAIi2B,EAAMwmB,EAAGnU,EAAI,GAAI6P,EAAM,IAE3B,IAAK,IAAIl4C,EAAI,EAAGA,EAAIs8C,EAAUt8C,IAE5Bg2B,EAAMumB,EAAGvmB,EAAKwmB,EAAGnU,EAAIroC,GAAIk4C,EAAMl4C,KAEjC2C,EAAE5C,GAAKi2B,CACT,CAGA,OAAOpe,EAAE+uB,kBAAkB,CACzBnkC,KAAMG,EACNub,KAAM,CAACm+B,GACPxe,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,EA7EE,oBAwQF,SAAsCqW,EAAGD,GAEvC,MAAMuyB,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT8J,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAEnE,IAAKsD,EAAW,MAAM,IAAI51B,MAAM,0DAEhC,MAAM4jC,EAAQvgC,EAAE8oB,MACV6W,EAAM3/B,EAAE2uB,WAAa3uB,EAAEivB,cAEvByV,EAAQzkC,EAAEsoB,MAAM,GAChBuc,EAAQ9kC,EAAEuoB,MAAM,GAEhBsU,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAGb,IAAIH,EAEAiI,EAAKR,EAELS,EAAKR,EAEL3tB,EAAKwd,EAELc,EAAO,EAGP0H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,IACrCjmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,IAI1B,MAAM71C,EAAI,GAEJG,EAAI,GAGV61C,EAAK,GAAK,EAEV,IAAK,IAAIiI,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,MAAMC,EAAMzE,EAAMwE,GAElB,IAAKruB,EAAGsuB,EAAKhQ,GAEX,IAAK,IAAIiQ,EAAMtS,EAAKoS,GAAKG,EAAMvS,EAAKoS,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,MAAMC,EAAK3S,EAAO0S,GAEbl+C,EAAEm+C,GASLt+C,EAAEs+C,GAAMR,EAAG99C,EAAEs+C,GAAKP,EAAGG,EAAKzS,EAAQ4S,MAPlCl+C,EAAEm+C,IAAM,EAERhT,EAAO9pC,KAAK88C,GAEZt+C,EAAEs+C,GAAMP,EAAGG,EAAKzS,EAAQ4S,IAK5B,CAEJ,CAEA,IAAK,IAAIniB,EAAKoP,EAAO/qC,OAAQ4I,EAAI,EAAGA,EAAI+yB,EAAI/yB,IAAK,CAE/C,MAAMo1C,EAAKjT,EAAOniC,GAElB4sC,EAAQ5sC,GAAKnJ,EAAEu+C,EACjB,CAKA,OAHAvI,EAAK,GAAK1K,EAAO/qC,OAGV4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACm+B,EAAO,GACdxe,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,IAzVM07C,EAAwB/4C,EAAM,wBAAyB,CAC3D,2BA2EF,SAA0C0T,EAAGD,GAE3C,MAAMk9B,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,WAAa1uB,EAAEgvB,cAEvBsR,EAAQvgC,EAAE8oB,MACV4W,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,WAAa3uB,EAAEivB,cAEvByV,EAAQjI,EAAM,GACdkI,EAAWlI,EAAM,GACjB8I,EAAW7F,EAAM,GAGvB,IAAI/C,EAEAiI,EAAKR,EAELS,EAAKR,EAGL3H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,GAA2B,UAARA,IAE7EC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,KAIvC,MAAM3xC,EAAI,GAGV,IAAK,IAAI5C,EAAI,EAAGA,EAAIs8C,EAAOt8C,IAAK,CAE9B,MAAMsoC,EAAMwM,EAAM90C,GAElB4C,EAAE5C,GAAK,GAEP,IAAK,IAAIC,EAAI,EAAGA,EAAIk9C,EAAUl9C,IAAK,CAEjC,IAAIg2B,EAAMwmB,EAAGnU,EAAI,GAAI6P,EAAM,GAAGl4C,IAE9B,IAAK,IAAIvB,EAAI,EAAGA,EAAI69C,EAAU79C,IAE5Bu3B,EAAMumB,EAAGvmB,EAAKwmB,EAAGnU,EAAI5pC,GAAIy5C,EAAMz5C,GAAGuB,KAEpC2C,EAAE5C,GAAGC,GAAKg2B,CACZ,CACF,CAGA,OAAOpe,EAAE+uB,kBAAkB,CACzBnkC,KAAMG,EACNub,KAAM,CAACm+B,EAAOa,GACdrf,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,EApIE,4BA8IF,SAA2CqW,EAAGD,GAE5C,MAAMk9B,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,WAAa1uB,EAAEgvB,cAEvBsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT8M,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAEnE,IAAKsQ,EAAW,MAAM,IAAI5iC,MAAM,0DAEhC,MAAM+nC,EAAQjI,EAAM,GACd8I,EAAW7F,EAAM,GAGvB,IAAI/C,EAEAiI,EAAKR,EAELS,EAAKR,EAEL3tB,EAAKwd,EAELc,EAAO,EAGP0H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,IACrCjmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,IAI1B,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAEP9xC,EAAIgV,EAAEu1B,mBAAmB,CAC7BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACm+B,EAAOa,GACdrf,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,IAI9D,IAAK,IAAI47C,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC1I,EAAK0I,GAAMpT,EAAO/qC,OAElB,MAAMo+C,EAAMhG,EAAK+F,GACXE,EAAMjG,EAAK+F,EAAK,GAEtB,GAAIE,EAAMD,EAAK,CAEb,IAAIvzC,EAAO,EAEX,IAAK,IAAI9J,EAAI,EAAGA,EAAIs8C,EAAOt8C,IAAK,CAE9B,MAAM+pC,EAAO/pC,EAAI,EAEjB,IAAIw3C,EAEJ,IAAK,IAAI+F,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAEjC,MAAMZ,EAAKvF,EAAOmG,GAEdzzC,IAASigC,GAEXyN,EAAMiF,EAAG3H,EAAM90C,GAAG28C,GAAKxF,EAAQoG,IAE/BzzC,EAAOigC,GAGPyN,EAAMgF,EAAGhF,EAAKiF,EAAG3H,EAAM90C,GAAG28C,GAAKxF,EAAQoG,IAE3C,CAEIzzC,IAASigC,GAASzb,EAAGkpB,EAAK5K,KAE5B5C,EAAO9pC,KAAKF,GACZy0C,EAAQv0C,KAAKs3C,GAEjB,CACF,CACF,CAKA,OAHA9C,EAAKyI,GAAYnT,EAAO/qC,OAGjB2D,CACT,EAhPE,4BAgWF,SAA2CiV,EAAGD,GAE5C,MAAMuyB,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT8J,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAEnE,IAAKsD,EAAW,MAAM,IAAI51B,MAAM,0DAEhC,MAAM4jC,EAAQvgC,EAAE8oB,MACV6W,EAAM3/B,EAAE2uB,WAAa3uB,EAAEivB,cAEvByV,EAAQzkC,EAAEsoB,MAAM,GAChBuc,EAAQ9kC,EAAEuoB,MAAM,GAChBgd,EAAWvlC,EAAEuoB,MAAM,GAGzB,IAAIoU,EAEAiI,EAAKR,EAELS,EAAKR,EAEL3tB,EAAKwd,EAELc,EAAO,EAGP0H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,IACrCjmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,IAI1B,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAEP9xC,EAAIiV,EAAEs1B,mBAAmB,CAC7BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACm+B,EAAOa,GACdrf,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,IAIxD9C,EAAI,GAEJG,EAAI,GAGV,IAAK,IAAIu+C,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC1I,EAAK0I,GAAMpT,EAAO/qC,OAElB,MAAM8qC,EAAOqT,EAAK,EAElB,IAAK,IAAIT,EAAK,EAAGA,EAAKD,EAAOC,IAAM,CAEjC,MAAMa,EAAOrF,EAAMwE,GAAIS,GAEvB,IAAK9uB,EAAGkvB,EAAM5Q,GAEZ,IAAK,IAAIiQ,EAAMtS,EAAKoS,GAAKG,EAAMvS,EAAKoS,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAAM,CAErE,MAAMC,EAAK3S,EAAO0S,GAEdl+C,EAAEm+C,KAAQjT,GAEZlrC,EAAEm+C,GAAMjT,EAERC,EAAO9pC,KAAK88C,GAEZt+C,EAAEs+C,GAAMP,EAAGe,EAAMrT,EAAQ4S,KAGzBr+C,EAAEs+C,GAAMR,EAAG99C,EAAEs+C,GAAKP,EAAGe,EAAMrT,EAAQ4S,IAEvC,CAEJ,CAEA,IAAK,IAAIU,EAAK/I,EAAK0I,GAAKxiB,EAAKoP,EAAO/qC,OAAQ4I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAK,CAE/D,MAAMo1C,EAAKjT,EAAOniC,GAElB4sC,EAAQ5sC,GAAKnJ,EAAEu+C,EACjB,CACF,CAKA,OAHAvI,EAAKyI,GAAYnT,EAAO/qC,OAGjB2D,CACT,EApcE,6BA8cF,SAA4CiV,EAAGD,GAE7C,MAAMuyB,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT8J,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT+M,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAG7DyV,EAAQzkC,EAAEsoB,MAAM,GAChBgd,EAAWvlC,EAAEuoB,MAAM,GAEnBniB,EAASmsB,GAAWgN,EAG1B,IAAI5C,EAEAiI,EAAKR,EAELS,EAAKR,EAGL3H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,KAIvC,MAAME,EAAUz2B,EAAS,QAAKxc,EACxBwoC,EAAS,GACT0K,EAAO,GAEP9xC,EAAIiV,EAAEs1B,mBAAmB,CAC7BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACm+B,EAAOa,GACdrf,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,IAIxD9C,EAAIsf,EAAS,QAAKxc,EAElB3C,EAAI,GAEV,IAAIk+C,EAAIF,EAAKC,EAAKS,EAAIF,EAAKC,EAAKN,EAAIL,EAEpC,IAAK,IAAIS,EAAK,EAAGA,EAAKD,EAAUC,IAAM,CAEpC1I,EAAK0I,GAAMpT,EAAO/qC,OAElB,MAAM8qC,EAAOqT,EAAK,EAElB,IAAKC,EAAMhG,EAAK+F,GAAKE,EAAMjG,EAAK+F,EAAK,GAAIG,EAAKF,EAAKE,EAAKD,EAAKC,IAI3D,GAFAZ,EAAKvF,EAAOmG,GAERv/B,EAEF,IAAK6+B,EAAMtS,EAAKoS,GAAKG,EAAMvS,EAAKoS,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,EAAK3S,EAAO0S,GAERl+C,EAAEm+C,KAAQjT,GAEZlrC,EAAEm+C,GAAMjT,EAERC,EAAO9pC,KAAK88C,GAEZt+C,EAAEs+C,GAAMP,EAAGtF,EAAQoG,GAAKpT,EAAQ4S,KAGhCr+C,EAAEs+C,GAAMR,EAAG99C,EAAEs+C,GAAKP,EAAGtF,EAAQoG,GAAKpT,EAAQ4S,UAK9C,IAAKF,EAAMtS,EAAKoS,GAAKG,EAAMvS,EAAKoS,EAAK,GAAII,EAAKF,EAAKE,EAAKD,EAAKC,IAE3DC,EAAK3S,EAAO0S,GAERl+C,EAAEm+C,KAAQjT,IAEZlrC,EAAEm+C,GAAMjT,EAERC,EAAO9pC,KAAK88C,IAMpB,GAAIh/B,EAEF,IAAK,IAAIy/B,EAAK/I,EAAK0I,GAAKxiB,EAAKoP,EAAO/qC,OAAQ4I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAK,CAE/D,MAAMo1C,EAAKjT,EAAOniC,GAElB4sC,EAAQ5sC,GAAKnJ,EAAEu+C,EACjB,CAEJ,CAKA,OAHAvI,EAAKyI,GAAYnT,EAAO/qC,OAGjB2D,CACT,IAmCA,OAAOuB,EAAMV,GAAMw4C,EAAgB,CAGjC,eAAgB93C,EAAMgM,QAAQ,kBAAkButC,GAAU,CAACh/C,EAAGC,KAE5Du9C,EAA0Bvc,GAAUjhC,GAAIihC,GAAUhhC,IAGlD,MAAMsvB,EAAIyvB,EAAO90B,EAAOlqB,GAAIkqB,EAAOjqB,IAEnC,OAAO0gB,EAAS4O,GAAKA,EAAEvQ,UAAYuQ,CAAC,IAGtC,iBAAkB,SAAUvvB,EAAGC,GAE7B,MAAMg/C,EAAQj/C,EAAEyf,OACVy/B,EAAQj/C,EAAEwf,OAMhB,OAHA+9B,EAA0ByB,EAAOC,GAGZ,IAAjBD,EAAM1+C,OAEa,IAAjB2+C,EAAM3+C,OAruBhB,SAAgC4Y,EAAGD,EAAGrV,GAEpC,GAAU,IAANA,EAAW,MAAM,IAAIgS,MAAM,qCAC/B,OAAOiS,EAAI3O,EAAGD,EAChB,CAmuBeimC,CAAsBn/C,EAAGC,EAAGg/C,EAAM,IAztBjD,SAAgC9lC,EAAGD,GAEjC,GAAoB,UAAhBA,EAAEimB,UACJ,MAAM,IAAItpB,MAAM,4CAElB,OAWF,SAAqCsD,EAAGD,GAEtC,MAAMk9B,EAAQj9B,EAAE6oB,MACV2T,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,WAAa1uB,EAAEgvB,cAEvBsR,EAAQvgC,EAAE8oB,MACV4W,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,WAAa3uB,EAAEivB,cAEvBiX,EAAUzJ,EAAM,GAChB8I,EAAW7F,EAAM,GAGvB,IAAI/C,EAEAiI,EAAKR,EAELS,EAAKR,EAGL3H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,IAE1DC,EAAKD,EAELkI,EAAKr4C,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IAChCkI,EAAKt4C,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,KAIvC,MAAM3xC,EAAI,GAGV,IAAK,IAAI3C,EAAI,EAAGA,EAAIk9C,EAAUl9C,IAAK,CAEjC,IAAIg2B,EAAMwmB,EAAG3H,EAAM,GAAIqD,EAAM,GAAGl4C,IAEhC,IAAK,IAAID,EAAI,EAAGA,EAAI89C,EAAS99C,IAE3Bi2B,EAAMumB,EAAGvmB,EAAKwmB,EAAG3H,EAAM90C,GAAIm4C,EAAMn4C,GAAGC,KAEtC2C,EAAE3C,GAAKg2B,CACT,CAGA,OAAOpe,EAAE+uB,kBAAkB,CACzBnkC,KAAMG,EACNub,KAAM,CAACg/B,GACPrf,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CA7DSu8C,CAA2BlmC,EAAGD,EACvC,CAstBaomC,CAAsBt/C,EAAGC,GAGb,IAAjBi/C,EAAM3+C,OAEDo9C,EAAsB39C,EAAGC,GAG3Bu+C,EAAsBx+C,EAAGC,EAClC,EAEA,gBAAiBwF,EAAMgM,QAAQ,iBAAiButC,GAC9C,CAACh/C,EAAGC,IAAM++C,EAAOh/C,EAAGkqB,EAAOjqB,MAE7B,gBAAiBwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAEtCkR,EAAK+Y,EAAOlqB,EAAGC,EAAEk/B,WAAYl/B,KAGtC,oBAAqB,SAAUD,EAAGC,GAChC,OAAO62C,EAAc92C,EAAGC,EAAGs9C,GAAgB,EAC7C,EAEA,mBAAoB,SAAUv9C,EAAGC,GAC/B,OAAO+2C,EAAah3C,EAAGC,EAAGs9C,GAAgB,EAC5C,EAEA,oBAAqB,SAAUv9C,EAAGC,GAChC,OAAO62C,EAAc72C,EAAGD,EAAGu9C,GAAgB,EAC7C,EAEA,mBAAoB,SAAUv9C,EAAGC,GAC/B,OAAO+2C,EAAa/2C,EAAGD,EAAGu9C,GAAgB,EAC5C,EAEA,aAAc,SAAUv9C,EAAGC,GAEzB,OAAO+2C,EAAa9sB,EAAOlqB,GAAIC,EAAGs9C,GAAgB,GAAOv+B,SAC3D,EAEA,aAAc,SAAUhf,EAAGC,GAEzB,OAAO+2C,EAAa9sB,EAAOjqB,GAAID,EAAGu9C,GAAgB,GAAMv+B,SAC1D,EAEA,WAAYu+B,EAEZ,mBAAoB93C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,EAAGs/C,KACnD,IAAIt+C,EAASkQ,EAAKnR,EAAGC,GAErB,IAAK,IAAIqB,EAAI,EAAGA,EAAIi+C,EAAKh/C,OAAQe,IAC/BL,EAASkQ,EAAKlQ,EAAQs+C,EAAKj+C,IAG7B,OAAOL,CAAM,KAEf,ICx2BE8D,GAAO,UASAy6C,GAAgCrgD,GAAQ4F,GARhC,CACnB,QACA,SACA,cACA,YACA,WAGuElC,IAAuD,IAAtD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,UAAE7jB,EAAS,OAAE3iB,GAAQ/D,EACzH,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCo1C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C6O,EAAiBF,GAAqB,CAAEt2C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4N,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA+BzE,SAAS64C,IACP,MAAM,IAAI5pC,MACR,0EACJ,CAEA,OAAOpQ,EACLV,GACA,CACEogB,OAAQ4uB,GACR,iBAAkBA,GAElBxqB,UAAWvpB,GAAK0/C,EAAY1/C,EAAG,IAAIupB,EAAU,IAC7C,uBAAwBm2B,EAExBl2B,QAASi2B,EACT,kBAAmBA,EAEnBx6C,MAAOQ,EAAMgM,QAAQ,sBAAsBkuC,GACzC3/C,GAAK2/C,EAAOz1B,EAAOlqB,GAAI,GAAGgf,YAC5ByK,YAAahkB,EAAMgM,QAAQ,sBAAsBkuC,GAC/C3/C,GAAK2/C,EAAO3/C,EAAG,KACjB8tC,aAAcroC,EAAMgM,QAAQ,uBAAuBmuC,GACjD5/C,GAAK4/C,EAAO5/C,EAAG,KAEjB,6BAA8ByF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAE1D,GAAoB,IAAhBA,EAAEyuC,UAEJ,OAAOuN,EAAej8C,EAAGC,EAAGkR,GAG5B,MAAM,IAAI0E,MAAM,wBAClB,IAGF,4BAA6BpQ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAEzD,GAAoB,IAAhBA,EAAEyuC,UAEJ,OAAOiN,EAAe37C,EAAGC,EAAGkR,GAAM,GAGlC,MAAM,IAAI0E,MAAM,wBAClB,IAGF,sBAAuBpQ,EAAMgM,QAAQ,4BAA4BouC,GAC/D,CAAC7/C,EAAGC,IAAM4/C,EAAO31B,EAAOlqB,GAAIC,KAE9B,mCAAoCwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,KAEhE,GAAoB,IAAhBA,EAAEyuC,UAEJ,OAAOoI,EAAc72C,EAAGD,EAAGmR,GAAM,GAGjC,MAAM,IAAI0E,MAAM,wBAClB,KAGJmlC,EAAqB,CACnBR,OAAQ,qBACRR,GAAIa,EACJH,GAAI5D,EACJ6D,IAAI,KAWR,SAAS+E,EAAavmC,EAAGja,GACvB,MAAMsnB,EAAY+C,EAAU/C,UACtBs5B,EAAMv2B,EAAUtG,MAAM,CAAEuD,UAAWA,EAAY,IAC/C0nB,EAAO,IAAI3kB,EAAU,GAErBiH,EAAM,IAAIsvB,EAAI,GACd9L,EAAM90C,EAAKkzB,aAKjB,GAJI4hB,IACF90C,EAAOA,EAAKmwB,OAGVnwB,EAAK2vB,SACP,MAAM,IAAIhZ,MAAM,yBAElB,GAAIsD,EAAEiZ,eAAiBlzB,EAAKkoB,MAAMiM,IAAI,GAAGlD,OAAO,GAC9C,MAAM,IAAIta,MAAM,wCAIlB,GAAIsD,EAAE0V,SACJ,OAAOmlB,EAAM,IAAI8L,EAAIjzC,KAAY,EAEnC,IAAKsM,EAAE2L,WACL,OAAOkvB,EAAM9F,EAAO/0B,EAGtB,IAAInZ,EAAImZ,EAAEiO,MAAM1N,IAAI8W,EAAIR,IAAI9wB,IAI5B,OADAc,EAAImZ,EAAEgY,QAAUnxB,EAAEqvB,MAAQrvB,EACnB,IAAIupB,GAAWyqB,EAAMxjB,EAAIR,IAAIhwB,GAAKA,GAAG+nB,YAAYvB,GAC1D,KC3JIzhB,GAAO,OAGAg7C,GAA6B5gD,GAAQ4F,GAF7B,CAAC,QAAS,YAAa,WAAY,YAEclC,IAA6C,IAA5C,MAAE4C,EAAK,UAAE8jB,EAAS,QAAEy2B,EAAO,SAAEt2B,GAAU7mB,EA+B5G,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ8uB,GAERzqB,QAAS,SAAUxpB,GACjB,OAAgB,IAATA,EAAEo6B,GAAW4lB,EAAQ/L,GAAWj0C,EAAEoc,KAAOpc,EAAEulB,MACpD,EAEAgE,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAUvpB,EAAEiuB,IAAI,GAC7B,EAEAke,OAAQ,SAAUnsC,GAChB,OAAOA,EAAI,GAAK,GAAKA,EAAI,IAAM,GAAK,EACtC,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAe,KAARA,EAAE6D,EAAW,IAAI6lB,EAAS,GAAK,IAAIA,EAAS1pB,EAAEyJ,EACvD,EAGA,iBAAkBhE,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,GAAM,KAElEs7B,KAAMhnC,EAAM6L,aAAYH,GAAQnR,IAC9B,IAAKA,EAAEigD,cAA2C,IAA3BjgD,EAAEkgD,MAAM,GAAG3O,KAAKpiC,OACrC,MAAM,IAAIjJ,UAAU,2CAEtB,OAAOT,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,MAAM,KAEjD,IC7DSm5C,GAA6BhhD,GAH7B,OACQ,CAAC,SAAU,QAAS,YAE6B0D,IAAgC,IAA/B,OAAEqiB,EAAM,MAAEzf,EAAK,QAAE+jB,GAAS3mB,EA2B/F,OAAO4C,EAAM,OAAQ,CACnB0f,OAAQi7B,EAER52B,QAAS,SAAUxpB,GACjB,OAAOA,EAAE4oB,MACX,EAEAW,UAAW,SAAUvpB,GACnB,OAAKA,EAAEoyB,cAAgBlN,EAAOu3B,YACrBz8C,EAAE4oB,OAGFw3B,EAAYpgD,EAAEioB,WAEzB,EAEAwkB,KAAM,SAAUzsC,GAEd,OAAOA,EAAE0Z,IAAI,GACf,IAUF,SAAS0mC,EAAapgD,GACpB,OAAIod,MAAMpd,GACD+tB,IACE/tB,GAAK,GAAKklB,EAAOu3B,YACnB3vC,KAAK8b,KAAK5oB,GAEV,IAAIwpB,EAAQxpB,EAAG,GAAG4oB,MAE7B,KClEI7jB,GAAO,SAGAs7C,GAA+BlhD,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA6BhF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ+uB,GAER1qB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEi0B,IAAIj0B,EACf,EAEAupB,UAAW,SAAUvpB,GACnB,OAAOA,EAAEgvB,MAAMhvB,EACjB,EAEAmsC,OAAQ,SAAUnsC,GAChB,OAAOA,EAAIA,CACb,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAOA,EAAEi0B,IAAIj0B,EACf,EAEAysC,KAAM,SAAUzsC,GACd,OAAOA,EAAE0Z,IAAI,EACf,GACA,ICjDE3U,GAAO,WAWAu7C,GAAiCnhD,GAAQ4F,GAVjC,CACnB,QACA,SACA,cACA,iBACA,aACA,cACA,WAGwElC,IAAqF,IAApF,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,eAAEmT,EAAc,WAAEpL,EAAU,YAAE1rB,EAAW,OAAE7iB,GAAQ/D,EAGxJ,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCq1C,EAAgB/B,GAAoB,CAAEtzC,UACtCs1C,EAAiB/B,GAAqB,CAAEvzC,QAAO2nC,gBAC/CyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CstB,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAgCzE,OAAOnB,EACLV,GACA,CACE,WAAYw7C,GAEdvF,EAAqB,CACnBjB,KAAMwG,EACNhG,GAAIQ,EACJd,GAAI0B,EACJ3B,GAAIc,EACJJ,GAAI3D,EACJ4D,GAAIkB,IAEP,ICrEG92C,GAAO,OAGAy7C,GAA6BrhD,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,SAAU,cAEmBlC,IAA0C,IAAzC,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEX,GAAW1mB,EAwBzG,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUoU,EAAGD,GAC7B,MAAMuhB,EAAM0Z,GAAWh7B,EAAGD,GAE1B,MAA0B,UAAlBgM,EAAOgF,OACXuQ,EACAvQ,EAAOuQ,EACb,EACA,uBAWF,SAAyBthB,EAAGD,GAE1B,IACEnZ,EAGAuzB,EAGA/X,EAEF,MAAM2yB,EAAO,IAAI3kB,EAAU,GACrBiH,EAAM,IAAIjH,EAAU,GAC1B,IAyBIkR,EAzBAz6B,EAAIkuC,EACJkG,EAAQ5jB,EACRvwB,EAAIuwB,EACJ6jB,EAAQnG,EAEZ,IAAK/0B,EAAEgZ,UAAYjZ,EAAEiZ,QACnB,MAAM,IAAItc,MAAM,uDAGlB,MAAQqD,EAAE2V,UACRyE,EAAIna,EAAE6W,IAAI9W,GAAGE,QACbmC,EAAIpC,EAAEka,IAAIna,GAEVnZ,EAAIC,EACJA,EAAIo0C,EAAMllB,MAAMoE,EAAEtE,MAAMhvB,IACxBo0C,EAAQr0C,EAERA,EAAIE,EACJA,EAAIo0C,EAAMnlB,MAAMoE,EAAEtE,MAAM/uB,IACxBo0C,EAAQt0C,EAERoZ,EAAID,EACJA,EAAIqC,EASN,OAJEkf,EADEthB,EAAEqZ,GAAG0b,GACD,CAAC/0B,EAAEkW,MAAO+kB,EAAM/kB,MAAOglB,EAAMhlB,OAE7B,CAAClW,EAAIA,EAAE0V,SAAmB,EAARulB,EAAWC,GAEX,UAAlBnvB,EAAOgF,OAAsBuQ,EAAMvQ,EAAOuQ,EACpD,OC5FI11B,GAAO,SAGA07C,GAA+BthD,GAAQ4F,GAF/B,CAAC,QAAS,SAAU,YAAa,OAAQ,QAAS,UAAW,MAAO,MAAO,cAExBlC,IAA6E,IAA5E,MAAE4C,EAAK,OAAEyf,EAAM,UAAEqE,EAAS,KAAEm3B,EAAI,MAAEC,EAAK,QAAEC,EAAO,IAAEvtB,EAAG,IAAE3oB,EAAG,UAAEma,GAAWhiB,EAwB9I,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB87C,EAClB,uBAAwBA,IAG1B,SAASA,EAAQ1nC,EAAGD,GAClB,IAAK2L,EAAU1L,KAAO0L,EAAU3L,GAAI,MAAM,IAAIrD,MAAM,yDAEpD,GADAsD,EAAIka,EAAIla,EAAGD,GACPynC,EAAMznC,EAAG,GAAI,MAAM,IAAIrD,MAAM,4BACjC,IAAI4kB,EAAMimB,EAAKvnC,EAAGD,GAClBuhB,EAAMA,EAAIzb,UACV,IAAK+c,EAAKiY,GAAOvZ,EACjB,OAAKkmB,EAAM5kB,EAAKxS,EAAU,KAC1ByqB,EAAM3gB,EAAI2gB,EAAK96B,GACX0nC,EAAQ5M,EAAKzqB,EAAU,MAAKyqB,EAAMtpC,EAAIspC,EAAK96B,IACxC86B,GAH+BjmB,GAIxC,KCvCW+yB,GAAuC3hD,GAHvC,iBACQ,CAAC,QAAS,gBAEiD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAmBrG,OAAO,SAAyBsW,EAAGD,EAAGnJ,GAEpC,MAAM07B,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT8M,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,MAAMjP,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAUtK,GAAWgN,EAAU,QAAK31C,EACpCwoC,EAAS,GACT0K,EAAO,GAGPh2C,EAAI+1C,EAAU,QAAKjzC,EAEnB3C,EAAI,GAGV,IAAImB,EAAGC,EAAGjB,EAAGyrC,EAAIC,EAGjB,IAAKzqC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5By0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,MAAM8qC,EAAO9pC,EAAI,EAEjB,GAAIvB,EAEF,IAAK+rC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIo3C,EAAOp4C,GAEXH,EAAEmB,GAAK+pC,EACPrrC,EAAEsB,GAAKm3C,EAAQn4C,GAInB,IAAKyrC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAInD,GAFAgB,EAAIqqC,EAAOrrC,GAEPN,EAAG,CAEL,MAAM+gD,EAAK5gD,EAAEmB,KAAO+pC,EAAOrrC,EAAEsB,GAAK4sC,EAE5BqL,EAAKzD,EAAGrK,EAAQnrC,GAAIygD,GAErBnxB,EAAG2pB,EAAIrL,KAEV5C,EAAO9pC,KAAKF,GAEZy0C,EAAQv0C,KAAK+3C,GAEjB,MAEEjO,EAAO9pC,KAAKF,EAGlB,CAKA,OAHA00C,EAAKnM,GAAWyB,EAAO/qC,OAGhB4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CAAC,IChIGiC,GAAO,cASAi8C,GAAoC7hD,GAAQ4F,GARpC,CACnB,QACA,SACA,cACA,iBACA,WAG2ElC,IAA4D,IAA3D,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,eAAEmQ,EAAc,OAAE32C,GAAQ/D,EAClI,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C6T,EAAiBH,GAAqB,CAAEr7C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4N,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA4BzE,OAAOnB,EAAMV,GAAMi2C,EAAqB,CACtCjB,KAAMwD,EACNhD,GAAI0G,EACJhH,GAAIY,EACJH,GAAI5D,IACH,IC/BE,SAASoK,GAAiBlhD,EAAGC,GAClC,GAAKD,EAAE8kB,aAAe9kB,EAAE6kB,aAAiB5kB,EAAE6kB,aAAe7kB,EAAE4kB,YAC1D,MAAM,IAAIhP,MAAM,wCAGlB,MAAM0T,EAAYvpB,EAAE6E,YACpB,GAAI7E,EAAEod,SAAWnd,EAAEmd,QACjB,OAAO,IAAImM,EAAUwE,KAGvB,GAAI/tB,EAAE6uB,UAAY5uB,EAAE2vB,IAAI,IAAM5vB,EAAE4vB,GAAG3vB,GACjC,OAAOD,EAET,GAAIC,EAAE4uB,UAAY7uB,EAAE4vB,IAAI,GACtB,OAAO3vB,EAGT,IAAKD,EAAE8kB,aAAe7kB,EAAE6kB,WAAY,CAClC,IAAK9kB,EAAE8kB,aAAe7kB,EAAE6kB,WACtB,OAAI9kB,EAAEoyB,eAAiBnyB,EAAEmyB,aAChBpyB,EAEF,IAAIupB,EAAU,GAEvB,IAAKvpB,EAAE8kB,WACL,OAAI7kB,EAAEmyB,aACGpyB,EAELA,EAAEoyB,aACG,IAAI7I,EAAU,GAEhBtpB,EAET,IAAKA,EAAE6kB,WACL,OAAI9kB,EAAEoyB,aACGnyB,EAELA,EAAEmyB,aACG,IAAI7I,EAAU,GAEhBvpB,CAEX,CACA,OAAOmhD,GAAQnhD,EAAGC,GAAG,SAAUkZ,EAAGD,GAAK,OAAOC,EAAID,CAAE,GACtD,CAQO,SAASkoC,GAAiBphD,GAC/B,GAAIA,EAAE8kB,aAAe9kB,EAAE6kB,YACrB,MAAM,IAAIhP,MAAM,uCAGlB,MAAM0T,EAAYvpB,EAAE6E,YACdw8C,EAAW93B,EAAU/C,UAC3B+C,EAAUrE,OAAO,CAAEsB,UAAW,MAE9B,MAAMvlB,EAASjB,EAAEmvB,KAAK,IAAI5F,EAAU,IAIpC,OAHAtoB,EAAOwI,GAAKxI,EAAOwI,GAAK,KAExB8f,EAAUrE,OAAO,CAAEsB,UAAW66B,IACvBpgD,CACT,CAsBO,SAASqgD,GAAgBthD,EAAGC,GACjC,GAAKD,EAAE8kB,aAAe9kB,EAAE6kB,aAAiB5kB,EAAE6kB,aAAe7kB,EAAE4kB,YAC1D,MAAM,IAAIhP,MAAM,uCAGlB,MAAM0T,EAAYvpB,EAAE6E,YACpB,GAAI7E,EAAEod,SAAWnd,EAAEmd,QACjB,OAAO,IAAImM,EAAUwE,KAGvB,MAAMwzB,EAAS,IAAIh4B,GAAW,GAC9B,OAAIvpB,EAAE6uB,UAAY5uB,EAAE2vB,GAAG2xB,IAAWvhD,EAAE4vB,GAAG3vB,GAC9BA,EAELA,EAAE4uB,UAAY7uB,EAAE4vB,GAAG2xB,GACdvhD,EAGJA,EAAE8kB,YAAe7kB,EAAE6kB,WAWjBq8B,GAAQnhD,EAAGC,GAAG,SAAUkZ,EAAGD,GAAK,OAAOC,EAAID,CAAE,KAV5ClZ,EAAE8kB,aAAe9kB,EAAEoyB,cAAgBnyB,EAAEmyB,cACxCpyB,EAAEoyB,eAAiBnyB,EAAEmyB,eAAiBnyB,EAAE6kB,WAClCy8B,EAELvhD,EAAEoyB,cAAgBnyB,EAAEmyB,aACfpyB,EAAE8kB,WAAa9kB,EAAIC,EAErBD,EAAE8kB,WAAa7kB,EAAID,CAI9B,CASO,SAASmhD,GAASnhD,EAAGC,EAAGymC,GAC7B,MAAMnd,EAAYvpB,EAAE6E,YAEpB,IAAI28C,EAAOC,EACX,MAAMC,IAAU1hD,EAAEyJ,EAAI,GAChBk4C,IAAU1hD,EAAEwJ,EAAI,GACtB,GAAIi4C,EAAO,CACTF,EAAQI,GAA6BR,GAAgBphD,IACrD,IAAK,IAAIsB,EAAI,EAAGA,EAAIkgD,EAAMjhD,SAAUe,EAClCkgD,EAAMlgD,IAAM,CAEhB,MACEkgD,EAAQI,GAA6B5hD,GAEvC,GAAI2hD,EAAO,CACTF,EAAQG,GAA6BR,GAAgBnhD,IACrD,IAAK,IAAIqB,EAAI,EAAGA,EAAImgD,EAAMlhD,SAAUe,EAClCmgD,EAAMngD,IAAM,CAEhB,MACEmgD,EAAQG,GAA6B3hD,GAGvC,IAAI4hD,EAASC,EAASC,EAClBP,EAAMjhD,QAAUkhD,EAAMlhD,QACxBshD,EAAUL,EACVM,EAAUL,EACVM,EAAUL,IAEVG,EAAUJ,EACVK,EAAUN,EACVO,EAAUJ,GAGZ,IAAIK,EAAWH,EAAQthD,OACnB0hD,EAAUH,EAAQvhD,OACtB,MAAM2hD,EAAkC,EAArBxb,EAAKgb,EAAOC,GAC/B,IAAIQ,EAAS,IAAI54B,EAAuB,EAAb24B,GACvBE,EAAW,IAAI74B,EAAU,GAC7B,MAAM84B,EAAM,IAAI94B,EAAU,GAEpB83B,EAAW93B,EAAU/C,UAG3B,IAFA+C,EAAUrE,OAAO,CAAEsB,UAAW,MAEvBw7B,EAAW,GACZtb,EAAKmb,IAAUG,GAAWF,IAAUG,MAAcC,IACpDC,EAASA,EAAOhzB,KAAKizB,IAEvBA,EAAWA,EAASpzB,MAAMqzB,GAE5B,KAAOJ,EAAU,GACXvb,EAAKqb,EAASD,IAAUG,MAAcC,IACxCC,EAASA,EAAOhzB,KAAKizB,IAEvBA,EAAWA,EAASpzB,MAAMqzB,GAQ5B,OALA94B,EAAUrE,OAAO,CAAEsB,UAAW66B,IAEX,IAAfa,IACFC,EAAO14C,GAAK04C,EAAO14C,GAEd04C,CACT,CAGA,SAASP,GAA8B5hD,GAErC,MAAMmZ,EAAInZ,EAAEK,EACZ,IAAIkb,EAAIpC,EAAE,GAAK,GAEf,IAAK,IAAI7X,EAAI,EAAGA,EAAI6X,EAAE5Y,SAAUe,EAAG,CACjC,IAAImI,EAAI0P,EAAE7X,GAAK,GACf,IAAK,IAAIpB,EAAI,EAAIuJ,EAAElJ,OAAQL,KACzBuJ,EAAI,IAAMA,EAGZ8R,GAAK9R,CACP,CAEA,IAAIlI,EAAIga,EAAEhb,OACV,KAAuB,MAAhBgb,EAAEiS,OAAOjsB,IACdA,IAGF,IAAI2xB,EAAKlzB,EAAEwY,EACP5V,EAAM2Y,EAAE7Z,MAAM,EAAGH,EAAI,GAAK,GAC9B,MAAMgsB,EAAO3qB,EAAIrC,OACjB,GAAI2yB,EAAK,EACP,KAAMA,EAAK3F,EAGT,IADA2F,GAAM3F,EACC2F,KACLtwB,GAAO,SAEAswB,EAAK3F,IACd3qB,EAAMA,EAAIlB,MAAM,EAAGwxB,GAAM,IAAMtwB,EAAIlB,MAAMwxB,IAK7C,MAAMpjB,EAAM,CAAC,GACb,IAAK,IAAIxO,EAAI,EAAGA,EAAIsB,EAAIrC,QAAS,CAC/B,IAAI+sB,EAAOxd,EAAIvP,OACf,KAAO+sB,KACLxd,EAAIwd,IAAS,GAGfxd,EAAI,IAAMgN,SAASla,EAAI4qB,OAAOlsB,MAC9B,IAAK,IAAIC,EAAI,EAAGA,EAAIuO,EAAIvP,SAAUgB,EAC5BuO,EAAIvO,GAAK,IACQ,OAAfuO,EAAIvO,EAAI,SAA8BuB,IAAfgN,EAAIvO,EAAI,KACjCuO,EAAIvO,EAAI,GAAK,GAGfuO,EAAIvO,EAAI,IAAMuO,EAAIvO,IAAM,EACxBuO,EAAIvO,IAAM,EAGhB,CAEA,OAAOuO,EAAI2d,SACb,CAqBO,SAAS60B,GAAQtiD,EAAGC,GACzB,GAAKD,EAAE8kB,aAAe9kB,EAAE6kB,aAAiB5kB,EAAE6kB,aAAe7kB,EAAE4kB,YAC1D,MAAM,IAAIhP,MAAM,wCAGlB,MAAM0T,EAAYvpB,EAAE6E,YACpB,GAAI7E,EAAEod,SAAWnd,EAAEmd,QACjB,OAAO,IAAImM,EAAUwE,KAEvB,GAAI/tB,EAAE6uB,SACJ,OAAO5uB,EAET,GAAIA,EAAE4uB,SACJ,OAAO7uB,EAGT,GAAIA,EAAE4vB,GAAG3vB,GACP,OAAO,IAAIspB,EAAU,GAGvB,MAAMg4B,EAAS,IAAIh4B,GAAW,GAC9B,OAAIvpB,EAAE4vB,GAAG2xB,GACAH,GAAgBnhD,GAErBA,EAAE2vB,GAAG2xB,GACAH,GAAgBphD,GAGpBA,EAAE8kB,YAAe7kB,EAAE6kB,WAQjBq8B,GAAQnhD,EAAGC,GAAG,SAAUkZ,EAAGD,GAAK,OAAOC,EAAID,CAAE,IAP7ClZ,EAAE8kB,YAAe7kB,EAAE6kB,WAGjB,IAAIyE,EAAUvpB,EAAEoyB,eAAiBnyB,EAAEmyB,aACtCvlB,KACA,KAJK00C,CAOb,CAoBO,SAASgB,GAAoBviD,EAAGC,GACrC,GAAKD,EAAE8kB,aAAe9kB,EAAE6kB,aAAiB5kB,EAAE6kB,aAAe7kB,EAAE4kB,YAC1D,MAAM,IAAIhP,MAAM,2CAGlB,MAAM0T,EAAYvpB,EAAE6E,YACpB,OAAI7E,EAAEod,SAAWnd,EAAEmd,SAAYnd,EAAEmyB,eAAiBnyB,EAAE4uB,SAC3C,IAAItF,EAAUwE,KAEnB/tB,EAAE6uB,UAAY5uB,EAAE4uB,SACX7uB,EAEJA,EAAE8kB,YAAe7kB,EAAE6kB,WAKpB7kB,EAAEuyB,GAAG,IACAxyB,EAAEgvB,MAAMliB,KAAK4M,IAAI,EAAGzZ,EAAEgoB,YAAc,IAEtCjoB,EAAEgvB,MAAM,IAAIzF,EAAU,GAAG7P,IAAIzZ,IAP3B,IAAIspB,EAAUwE,IAQzB,CAqBO,SAASy0B,GAA0BxiD,EAAGC,GAC3C,GAAKD,EAAE8kB,aAAe9kB,EAAE6kB,aAAiB5kB,EAAE6kB,aAAe7kB,EAAE4kB,YAC1D,MAAM,IAAIhP,MAAM,iDAGlB,MAAM0T,EAAYvpB,EAAE6E,YACpB,OAAI7E,EAAEod,SAAWnd,EAAEmd,SAAYnd,EAAEmyB,eAAiBnyB,EAAE4uB,SAC3C,IAAItF,EAAUwE,KAEnB/tB,EAAE6uB,UAAY5uB,EAAE4uB,SACX7uB,EAEJC,EAAE6kB,WAWH7kB,EAAEuyB,GAAG,IACAxyB,EAAEgwB,IAAIljB,KAAK4M,IAAI,EAAGzZ,EAAEgoB,YAAc,IAAI7O,QAExCpZ,EAAEgwB,IAAI,IAAIzG,EAAU,GAAG7P,IAAIzZ,IAAImZ,QAbhCpZ,EAAEoyB,aACG,IAAI7I,GAAW,GAEnBvpB,EAAE8kB,WAGA,IAAIyE,EAAU,GAFZ,IAAIA,EAAUwE,IAU3B,CC/ZA,MACMilB,GAAK,iBAEJ,SAASyP,GAAcziD,EAAGC,GAC/B,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,wCAGlB,OAAO7V,EAAIC,CACb,CAGO,SAASyiD,GAAc1iD,GAC5B,IAAK6kB,GAAU7kB,GACb,MAAM,IAAI6V,MAAM,uCAGlB,OAAQ7V,CACV,CAGO,SAAS2iD,GAAa3iD,EAAGC,GAC9B,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,uCAGlB,OAAO7V,EAAIC,CACb,CAGO,SAAS2iD,GAAc5iD,EAAGC,GAC/B,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,wCAGlB,OAAO7V,EAAIC,CACb,CAGO,SAAS4iD,GAAiB7iD,EAAGC,GAClC,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,2CAGlB,OAAO7V,GAAKC,CACd,CAGO,SAAS6iD,GAAuB9iD,EAAGC,GACxC,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,iDAGlB,OAAO7V,GAAKC,CACd,CAGO,SAAS8iD,GAAqB/iD,EAAGC,GACtC,IAAK4kB,GAAU7kB,KAAO6kB,GAAU5kB,GAC9B,MAAM,IAAI4V,MAAM,+CAGlB,OAAO7V,IAAMC,CACf,CArDAwiD,GAAal7C,UAAYyrC,GASzB0P,GAAan7C,UAnBF,SA4BXo7C,GAAYp7C,UAAYyrC,GASxB4P,GAAar7C,UAAYyrC,GASzB6P,GAAgBt7C,UAAYyrC,GAS5B8P,GAAsBv7C,UAAYyrC,GASlC+P,GAAoBx7C,UAAYyrC,GC1DhC,MAAMjuC,GAAO,SAQAi+C,GAA+B7jD,GAAQ4F,GAP/B,CACnB,QACA,SACA,cACA,WAGsElC,IAA4C,IAA3C,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,OAAExmC,GAAQ/D,EAC7G,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C6O,EAAiBF,GAAqB,CAAEt2C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4N,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAwBzE,OAAOnB,EACLV,GACA,CACE,iBAAkB09C,GAClB,uBAAwBvB,GACxB,iBAAkB+B,CAACjjD,EAAGC,IAAMD,EAAIC,GAElC+6C,EAAqB,CACnBT,GAAI0B,EACJhC,GAAIY,EACJH,GAAI5D,IAEP,ICnDG/xC,GAAO,SAGAm+C,GAA+B/jD,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAuBhF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQu9B,GACRn5B,UAAW63B,GACXjV,OAAQnsC,IAAMA,EACd,iBAAkByF,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC5BEpM,GAAO,QASAo+C,GAA8BhkD,GAAQ4F,GAR9B,CACnB,QACA,SACA,cACA,cACA,WAGqElC,IAAyD,IAAxD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,YAAE3jB,EAAW,OAAE7iB,GAAQ/D,EACzH,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCm2C,EAAmBV,GAAuB,CAAEz1C,QAAO2nC,gBACnDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAyBzE,OAAOnB,EACLV,GACA,CACE,iBAAkB49C,GAClB,uBAAwBrB,GACxB,iBAAkB2B,CAACjjD,EAAGC,IAAMD,EAAIC,GAElC+6C,EAAqB,CACnBT,GAAIqB,EACJ3B,GAAI0B,EACJjB,GAAImB,IAEP,ICpDUuH,GAAsCjkD,GAHtC,gBACQ,CAAC,QAAS,iBAEgD0D,IAA6B,IAA5B,MAAE4C,EAAK,aAAEqoC,GAAcjrC,EAerG,OAAO,SAAwBsW,EAAGD,EAAGnJ,GAEnC,MAAM4lC,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAC7DyQ,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAClF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,MAAMjP,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EACA3H,EAAO,EACP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAC5CC,EAAKD,EACL1H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GACxBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,IAAI/wC,MAAM4kC,EAAU,GAAGj4B,KAAK,GAGnCqnC,EAAK,GACLC,EAAK,GACLC,EAAK,GACLC,EAAK,GAGX,IAAK,IAAI73C,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAChC,MAAM8pC,EAAO9pC,EAAI,EACjB,IAAI8hD,EAAe,EAEnBC,EAASnqC,EAAG5X,EAAG43C,EAAIF,EAAI5N,GACvBiY,EAASpqC,EAAG3X,EAAG63C,EAAIF,EAAI7N,GAGvB,IAAK,IAAI/pC,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAK,CAC7B,MAIMw3C,EAAMhD,EAJDqD,EAAG73C,KAAO+pC,EAAO4N,EAAG33C,GAAK4sC,EACzBkL,EAAG93C,KAAO+pC,EAAO6N,EAAG53C,GAAK4sC,GAKxB,IAAR4K,IAAqB,IAARA,IACfxN,EAAO9pC,KAAKF,GACZy0C,EAAQv0C,KAAKs3C,GACbuK,IAEJ,CAGArN,EAAKz0C,EAAI,GAAKy0C,EAAKz0C,GAAK8hD,CAC1B,CAGA,OAAO,IAAIvV,EAAa,CACtBxuB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,EAEA,SAASwgD,EAAU/zB,EAAGhuB,EAAGpB,EAAGH,EAAGqrC,GAE7B,MAAM/rB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAEd,IAAK,IAAIxrC,EAAI2tC,EAAI1sC,GAAIyqC,EAAKiC,EAAI1sC,EAAI,GAAIjB,EAAI0rC,EAAI1rC,IAAK,CAEjD,MAAMgB,EAAIqC,EAAMrD,GAEhBH,EAAEmB,GAAK+pC,EACPrrC,EAAEsB,GAAKge,EAAOhf,EAChB,CACF,KCrGIyE,GAAO,SASAw+C,GAA+BpkD,GAAQ4F,GAR/B,CACnB,QACA,SACA,cACA,SACA,iBAGsElC,IAA0D,IAAzD,MAAE4C,EAAK,OAAEykB,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EAC3H,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAwBzE,OAAOnB,EACLV,GACA,CACE,iBAAkB69C,GAClB,uBAAwBa,GACxB,iBAAkBR,CAACjjD,EAAGC,IAAMD,EAAIC,GAElC+6C,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,ICnDU2M,GAA4BvkD,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EA4B7E,OAAO4C,EA/BI,MA+BQ,CACjB0f,OAAQ,SAAUnlB,GAChB,OAAO8M,KAAKurB,MAAM,EAAGr4B,EACvB,EAEAupB,UAAW,SAAUvpB,GACnB,OAAOA,EAAE6E,YAAYwzB,MAAM,EAAGr4B,EAChC,EAEAwpB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEwP,KACX,EAIA,iBAAkB/J,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC/CEpM,GAAO,OAGA4+C,GAA6BxkD,GAAQ4F,GAF7B,CAAC,UAEgDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA0B9E,OAAO4C,EAAMV,GAAM,CACjB,gCAAiC/E,GAAKA,EACtCwpB,QAASxpB,GAAKA,EAAE4jD,YAChBnX,KAAMhnC,EAAM6L,aAAYH,GAAQnR,GAAK,IAAIA,EAAE6E,YAAYsM,EAAKnR,EAAEw3C,aAAcx3C,EAAE6jD,iBAC9E,iBAAkBp+C,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC/BS2yC,GAA2B3kD,GAH3B,KACQ,CAAC,UAE8C0D,IAAe,IAAd,MAAE4C,GAAO5C,EA4B5E,OAAO4C,EA/BI,KA+BQ,CACjB0f,OAAQA,IAAM,EACd,uBAAwBnlB,GAAKA,EAAEi0B,IAAI,GACnCzK,QAASxpB,GAAKA,EAAEo6B,GAChB,iBAAkB30B,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICjCS4yC,GAA2B5kD,GAH3B,KACQ,CAAC,UAE8C0D,IAAe,IAAd,MAAE4C,GAAO5C,EA4B5E,OAAO4C,EA/BI,KA+BQ,CACjB,gCAAiCzF,GAAKA,EACtCwpB,QAASxpB,GAAKA,EAAEoc,GAChB,iBAAkB3W,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICrCE6hC,GAAK,iBAEJ,SAASgR,GAAWhkD,GACzB,OAAQA,CACV,CAGO,SAASikD,GAAUjkD,EAAGC,GAC3B,SAAUD,IAAKC,EACjB,CAGO,SAASikD,GAAWlkD,EAAGC,GAC5B,QAASD,KAAQC,CACnB,CAGO,SAASkkD,GAAWnkD,EAAGC,GAC5B,SAAUD,IAAKC,EACjB,CAdA+jD,GAAUz8C,UANC,SAWX08C,GAAS18C,UAAYyrC,GAKrBkR,GAAU38C,UAAYyrC,GAKtBmR,GAAU58C,UAAYyrC,GCjBtB,MAGaoR,GAA4BjlD,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EA0B7E,OAAO4C,EA7BI,MA6BQ,CACjB,mBAAoB4+C,KAAM,EAE1Bl/B,OAAQ6+B,GAERx6B,QAAS,SAAUxpB,GACjB,OAAgB,IAATA,EAAEoc,IAAqB,IAATpc,EAAEo6B,EACzB,EAEA7Q,UAAW,SAAUvpB,GACnB,OAAOA,EAAE6uB,UAAY7uB,EAAEod,OACzB,EAEA+uB,OAAQnsC,IAAMA,EAEdysC,KAAMhnC,EAAM6L,aAAYH,GAAQnR,GAAKyF,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,SAEvE,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC7CEpM,GAAO,UAGAu/C,GAAgCnlD,GAC3C4F,GAHmB,CAAC,QAAS,SAAU,OAAQ,UAAW,cAK1DlC,IAAiD,IAAhD,MAAE4C,EAAK,OAAEykB,EAAM,KAAEzK,EAAI,QAAExF,EAAO,UAAEsqC,GAAW1hD,EAC1C,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtCuxC,EAAeb,GAAmB,CAAE1wC,UACpCq0C,EAAeN,GAAmB,CAAE/zC,UAkC1C,OAAOA,EACLV,GACA,CAEE,iFAAkFy/C,CAACxkD,EAAGykD,IAAOzkD,EAC7F,YAAa0kD,CAAC1S,EAAI/xC,IAAMA,EACxB,iBAAkB0kD,CAAC3S,EAAI/xC,IAAMA,EAG7B,+BAAgC2kD,CAAC5kD,EAAGC,KAClC,MAAM4kD,EAAK5qC,EAAQwF,EAAKzf,GAAGgf,WACrB8lC,EAAK7qC,EAAQwF,EAAKxf,GAAG+e,WAC3B,GAAIulC,EAAUM,EAAIC,GAAK,OAAO9kD,EAC9B,MAAM,IAAI6gC,GAAegkB,EAAIC,EAAG,EAIlC,2BAA4Br/C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM65C,EAAa95C,EAAGC,EAAGkR,KACnF,4BAA6B1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM66C,EAAc96C,EAAGC,EAAGkR,GAAM,KAC3F,qBAAsB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM65C,EAAa95C,EAAGkqB,EAAOjqB,GAAIkR,KACrF,mBAAoB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM+2C,EAAah3C,EAAGC,EAAGkR,GAAM,KAGjF,eAAgB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM65C,EAAa5vB,EAAOlqB,GAAIkqB,EAAOjqB,GAAIkR,GAAM6N,YAC7F,qBAAsBvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM65C,EAAa5vB,EAAOlqB,GAAIC,EAAGkR,KACrF,sBAAuB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM66C,EAAc5wB,EAAOlqB,GAAIC,EAAGkR,GAAM,KAC7F,aAAc1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAAM+2C,EAAa9sB,EAAOlqB,GAAIC,EAAGkR,GAAM,GAAO6N,aAE7F,IC7DQ+lC,GAA2B5lD,GAT3B,KACQ,CACnB,QACA,SACA,cACA,cACA,WAGkE0D,IAAyD,IAAxD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,YAAE3jB,EAAW,OAAE7iB,GAAQ/D,EACtH,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtCs1C,EAAiB/B,GAAqB,CAAEvzC,QAAO2nC,gBAC/C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA8BzE,OAAOnB,EA3CI,KA6CT,CACE,iBAAkBw+C,GAElB,mBAAoB,SAAUjkD,EAAGC,GAC/B,OAAiB,IAATD,EAAEoc,IAAqB,IAATpc,EAAEo6B,IAAuB,IAATn6B,EAAEmc,IAAqB,IAATnc,EAAEm6B,EACxD,EAEA,uBAAwB,SAAUp6B,EAAGC,GACnC,OAASD,EAAE6uB,WAAa7uB,EAAEod,UAAcnd,EAAE4uB,WAAa5uB,EAAEmd,OAC3D,EAEA,iBAAkB6mC,GAElB,aAAcx+C,EAAM6L,aAAYH,GAC9B,CAACnR,EAAGC,IAAMkR,EAAKnR,EAAEgH,OAAS,EAAG/G,EAAE+G,OAAS,MAE5Cg0C,EAAqB,CACnBT,GAAIQ,EACJd,GAAIa,EACJJ,GAAI3D,IAEP,ICzDUiO,GAA4B7lD,GAT5B,MACQ,CACnB,QACA,SACA,cACA,SACA,iBAGmE0D,IAA0D,IAAzD,MAAE4C,EAAK,OAAEykB,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACxH,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA8BzE,OAAOnB,EA3CI,MA6CT,CACE,iBAAkBy+C,GAElB,mBAAoB,SAAUlkD,EAAGC,GAC/B,OAAkB,IAATD,EAAEoc,IAAqB,IAATpc,EAAEo6B,MAAwB,IAATn6B,EAAEmc,IAAqB,IAATnc,EAAEm6B,GAC1D,EAEA,iBAAkB8pB,GAElB,uBAAwB,SAAUlkD,EAAGC,GACnC,QAAUD,EAAE6uB,WAAa7uB,EAAEod,YAAend,EAAE4uB,WAAa5uB,EAAEmd,QAC7D,EAEA,aAAc3X,EAAM6L,aAAYH,GAC9B,CAACnR,EAAGC,IAAMkR,EAAKnR,EAAEgH,OAAS,EAAG/G,EAAE+G,OAAS,MAE5Cg0C,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IClEGhyC,GAAO,SAGAkgD,GAA+B9lD,GAAQ4F,GAF/B,CAAC,QAAS,SAAU,cAE+BlC,IAAkC,IAAjC,MAAE4C,EAAK,OAAEykB,EAAM,UAAErF,GAAWhiB,EA8BnG,OAAO4C,EAAMV,GAAM,CAEjB,yCAA0C,SAAU+G,GAClD,IAAIxK,EACJ,MAAMwX,EAAMhN,EAAKvL,OACjB,IACI2kD,EADA/jB,GAAO,EAEPgkB,GAAW,EACf,MAAMC,EAAW,GAEjB,IAAK9jD,EAAI,EAAGA,EAAIwX,EAAKxX,IAAK,CACxB,MAAMkO,EAAM1D,EAAKxK,GAOjB,GAJIqf,EAASnR,KACX21C,GAAW,GAGThlC,EAAS3Q,IAAQ4Q,EAAY5Q,GAAM,CACrC,GAAIlO,IAAMwX,EAAM,EACd,MAAM,IAAIjD,MAAM,gDAOlB,GAHAqvC,EAAU/jB,EACVA,EAAM3xB,EAAIwP,WAEL6F,EAAUsc,GACb,MAAM,IAAIj7B,UAAU,yCAGtB,GAAIi7B,EAAM,GAAM7/B,EAAI,GAAK6/B,EAAM+jB,EAE7B,MAAM,IAAIlkB,GAAWG,EAAK+jB,EAAU,EAExC,KAAO,CAEL,MAAM31B,EAAItM,GAAMzT,GAAKwP,UACfS,EAAOwhB,GAAU1R,GAMvB,GALA61B,EAAS9jD,GAAKiuB,EACd21B,EAAU/jB,EACVA,EAAM1hB,EAAKlf,OAAS,EAGhBe,EAAI,GAAK6/B,IAAQ+jB,EACnB,MAAM,IAAIrkB,GAAeqkB,EAAU,EAAG/jB,EAAM,EAEhD,CACF,CAEA,GAAwB,IAApBikB,EAAS7kD,OACX,MAAM,IAAI2K,YAAY,gCAGxB,IAAIuvB,EAAM2qB,EAAS/8B,QACnB,KAAO+8B,EAAS7kD,QACdk6B,EAAM4qB,GAAQ5qB,EAAK2qB,EAAS/8B,QAAS8Y,GAGvC,OAAOgkB,EAAWj7B,EAAOuQ,GAAOA,CAClC,EAEA,YAAa,SAAU3uB,GACrB,OAAOA,EAAKlE,KAAK,GACnB,GACA,ICpGE7C,GAAO,SAGAugD,GAA+BnmD,GAAQ4F,GAF/B,CAAC,QAAS,QAAS,SAAU,UAEsBlC,IAAqC,IAApC,MAAE4C,EAAK,MAAE8/C,EAAK,OAAEr7B,EAAM,MAAE8e,GAAOnmC,EAsBtG,OAAO4C,EAAMV,GAAM,CACjB,iBAAkBygD,EAElB,gBAAiB,SAAUx+C,EAAOy+C,GAChC,OAAOD,EAAQt7B,EAAOjH,GAAMjc,IAASy+C,GAAQzmC,SAC/C,IASF,SAASwmC,EAASx+C,EAAOy+C,GAEvB,GAA4B,IAAxBz+C,EAAMyY,OAAOlf,OACf,MAAM,IAAIsV,MAAM,4CAGlB+rB,GAAc6jB,EAAQz+C,EAAMyY,OAAO,IAEnC,MAAMimC,EAAW1c,EAAM,EAAGhiC,EAAMyY,OAAO,IACjC9b,EAAQ,IAAI4hD,EAAMG,EAAUD,GAC5BxkD,EAAS+F,EAAMq4B,OAAO17B,GAC5B,OAAOgd,EAAS1f,GACZA,EACAipB,EAAO,CAAC,CAACjpB,IACf,KCxDI8D,GAAO,QAGAW,GAA8BvG,GAAQ4F,GAF9B,CAAC,QAAS,OAAQ,SAEgClC,IAA2B,IAA1B,MAAE4C,EAAK,KAAEga,EAAI,KAAEyW,GAAMrzB,EAsB3F,OAAO4C,EAAMV,GAAM,CACjBkoC,OAAQ,SAAUjtC,GAChB,OAAOA,EAAEO,MACX,EAEA,iBAAkB,SAAUP,GAC1B,OAAOk2B,EAAKzW,EAAKzf,GACnB,GACA,IChCE+E,GAAO,QAGA4gD,GAA8BxmD,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,WAAY,aAEkBlC,IAA2C,IAA1C,MAAE4C,EAAK,OAAEykB,EAAM,SAAE6L,EAAQ,SAAE0hB,GAAU50C,EAkC3G,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOiqB,EAAO07B,EAAO5lD,EAAEg/B,UAAW/+B,EAAE++B,WACtC,EAEA,gBAAiB,SAAUh/B,EAAGC,GAC5B,OAAOiqB,EAAO07B,EAAO5lD,EAAEg/B,UAAW/+B,GACpC,EAEA,gBAAiB,SAAUD,EAAGC,GAC5B,OAAOiqB,EAAO07B,EAAO5lD,EAAGC,EAAE++B,WAC5B,EAEA,eAAgB4mB,IAUlB,SAASA,EAAQ5lD,EAAGC,GAClB,MAAM4lD,EAAmB/4C,KAAKI,IAAI+zB,GAAUjhC,GAAGO,OAAQ0gC,GAAUhhC,GAAGM,QAEpEP,EAAImjC,GAAQnjC,GACZC,EAAIkjC,GAAQljC,GAEZ,MAAM6lD,EAAQ7kB,GAAUjhC,GAClB+lD,EAAQ9kB,GAAUhhC,GAExB,GAAqB,IAAjB6lD,EAAMvlD,QAAiC,IAAjBwlD,EAAMxlD,QAA6B,IAAbulD,EAAM,IAAyB,IAAbC,EAAM,GACtE,MAAM,IAAIte,WAAW,6CACLqe,EAAMl+C,KAAK,MAAQ,WAAam+C,EAAMn+C,KAAK,MAAQ,MAGrE,MAAM86B,EAAU,CACd3M,EAAS0hB,EAASz3C,EAAE,GAAIC,EAAE,IAAKw3C,EAASz3C,EAAE,GAAIC,EAAE,KAChD81B,EAAS0hB,EAASz3C,EAAE,GAAIC,EAAE,IAAKw3C,EAASz3C,EAAE,GAAIC,EAAE,KAChD81B,EAAS0hB,EAASz3C,EAAE,GAAIC,EAAE,IAAKw3C,EAASz3C,EAAE,GAAIC,EAAE,MAGlD,OAAI4lD,EAAmB,EACd,CAACnjB,GAEDA,CAEX,KCnFI39B,GAAO,OAGAihD,GAA6B7mD,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,cAAe,iBAEclC,IAAkD,IAAjD,MAAE4C,EAAK,OAAEykB,EAAM,YAAET,EAAW,aAAEqkB,GAAcjrC,EAsCjH,OAAO4C,EAAMV,GAAM,CAGjBE,MAAO,SAAUjF,GACf,OAAOimD,EAAMjmD,EAAG,EAAGihC,GAAUjhC,GAAI,KACnC,EAEA,gBAAiB,SAAUA,EAAGM,GAC5B,OAAO2lD,EAAMjmD,EAAGM,EAAG2gC,GAAUjhC,GAAI,KACnC,EAEA,mBAAoB,SAAUA,EAAGM,GAC/B,OAAO2lD,EAAMjmD,EAAGM,EAAE2nB,WAAYgZ,GAAUjhC,GAAI,KAC9C,EAEA,gBAAiB,SAAUA,EAAGsmB,GAC5B,OAAO2/B,EAAMjmD,EAAG,EAAGihC,GAAUjhC,GAAIsmB,EACnC,EAEA,wBAAyB,SAAUtmB,EAAGM,EAAGgmB,GACvC,OAAO2/B,EAAMjmD,EAAGM,EAAG2gC,GAAUjhC,GAAIsmB,EACnC,EAEA,2BAA4B,SAAUtmB,EAAGM,EAAGgmB,GAC1C,OAAO2/B,EAAMjmD,EAAGM,EAAE2nB,WAAYgZ,GAAUjhC,GAAIsmB,EAC9C,EAEA4Y,OAAQ,SAAUl/B,GAChB,OAAOimD,EAAMjmD,EAAG,EAAGA,EAAEyf,OAAQzf,EAAEm/B,UACjC,EAEA,iBAAkB,SAAUn/B,EAAGM,GAC7B,OAAO2lD,EAAMjmD,EAAGM,EAAGN,EAAEyf,OAAQzf,EAAEm/B,UACjC,EAEA,oBAAqB,SAAUn/B,EAAGM,GAChC,OAAO2lD,EAAMjmD,EAAGM,EAAE2nB,WAAYjoB,EAAEyf,OAAQzf,EAAEm/B,UAC5C,EAEA,iBAAkB,SAAUn/B,EAAGsmB,GAC7B,OAAO2/B,EAAMjmD,EAAG,EAAGA,EAAEyf,OAAQ6G,EAC/B,EAEA,yBAA0B,SAAUtmB,EAAGM,EAAGgmB,GACxC,OAAO2/B,EAAMjmD,EAAGM,EAAGN,EAAEyf,OAAQ6G,EAC/B,EAEA,4BAA6B,SAAUtmB,EAAGM,EAAGgmB,GAC3C,OAAO2/B,EAAMjmD,EAAGM,EAAE2nB,WAAYjoB,EAAEyf,OAAQ6G,EAC1C,IAYF,SAAS2/B,EAAOjmD,EAAGM,EAAGmf,EAAM6G,GAC1B,IAAKzB,GAAUvkB,GACb,MAAM,IAAI4F,UAAU,wDAGtB,MAAM8jC,EAAS1pC,EAAI,EAAIA,EAAI,EACrB2pC,EAAO3pC,EAAI,GAAKA,EAAI,EAG1B,OAAQmf,EAAKlf,QACX,KAAK,EACH,OAON,SAAgCP,EAAGM,EAAGgmB,EAAQ4/B,EAAGjc,EAAMD,GAErD,MAAME,EAAK,CAACgc,EAAIjc,EAAMic,EAAIlc,GAE1B,GAAI1jB,GAAqB,WAAXA,GAAkC,UAAXA,EACnC,MAAM,IAAIpgB,UAAU,uBAAuBogB,MAI7C,MAAMiJ,EAAe,WAAXjJ,EACNwnB,EAAa/D,SAASG,EAAIlqC,EAAGM,GAC7BmpB,EAAYsgB,SAASG,EAAIlqC,EAAGM,GAEhC,OAAkB,OAAXgmB,EAAkBiJ,EAAIA,EAAEvQ,SACjC,CArBamnC,CAAsBnmD,EAAGM,EAAGgmB,EAAQ7G,EAAK,GAAIwqB,EAAMD,GAC5D,KAAK,EACH,OAqBN,SAAuBhqC,EAAGM,EAAGgmB,EAAQ7c,EAAGwgC,EAAMD,GAE5C,GAAIrpB,EAAS3gB,GAAI,CAEf,MAAMomD,EAAKpmD,EAAE+pC,SAASzpC,GAEtB,OAAe,OAAXgmB,EAEEA,IAAW8/B,EAAGjnB,UAAoBjV,EAAOk8B,EAAI9/B,GAC1C8/B,EAEFA,EAAGpnC,SACZ,CAEA,MAAMnb,EAAIiJ,KAAKC,IAAItD,EAAE,GAAKwgC,EAAMxgC,EAAE,GAAKugC,GAEjCqc,EAAS,GAEf,IAAK,IAAI/kD,EAAI,EAAGA,EAAIuC,EAAGvC,IACrB+kD,EAAO/kD,GAAKtB,EAAEsB,EAAI2oC,GAAM3oC,EAAI0oC,GAG9B,OAAkB,OAAX1jB,EAAkB4D,EAAOm8B,GAAUA,CAC5C,CA5CaC,CAAatmD,EAAGM,EAAGgmB,EAAQ7G,EAAMwqB,EAAMD,GAElD,MAAM,IAAIvC,WAAW,iDACvB,CAyCA,IC7JW8e,GAA+BpnD,GAH/B,SACQ,CAAC,UAEkD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAqChF,OAAO4C,EAAM,SAAU,CACrB,kBAAmB+gD,GAEnB,mBAAoB,SAAUxmD,EAAGgF,GAC/B,OAAOhF,EAAE2E,OAAO6hD,GAAgBxmD,EAAEgf,UAAWha,GAAOhF,EAAEo/B,WACxD,EAEA,gBAAiByE,GAEjB,iBAAkB,SAAU7jC,EAAGgF,GAC7B,OAAOhF,EAAE2E,OAAOk/B,GAAa7jC,EAAEgf,UAAWha,GAAOhF,EAAEo/B,WACrD,GACA,IAUJ,SAASonB,GAAiBxmD,EAAG+P,GAC3B,MAAMk2B,EAAeH,GAAiB/1B,EAAU/P,EAAG,UACnD,OAAIimC,EAAaF,QACR7+B,GAAOlH,EAAGimC,EAAa3+B,IAEzBJ,GAAOlH,GAAG,SAAUgH,EAAOrD,EAAOqmB,GAEvC,OAAOic,EAAa3+B,GAAGN,EAAO,CAACrD,GAAQqmB,EACzC,GACF,CCxEA,MAAMjlB,GAAO,UAGA0hD,GAAgCtnD,GAAQ4F,GAFhC,CAAC,UAEmDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAoBjF,OAAO4C,EAAMV,GAAM,CACjBE,MAAO,SAAUjF,GACf,OAAO0mD,GAAa1mD,EACtB,EAEAk/B,OAAQ,SAAUl/B,GAGhB,OAAOA,EAAE2E,OAAO+hD,GAAa1mD,EAAEgf,WAAW,GAAOhf,EAAEo/B,WACrD,GACA,IChCEr6B,GAAO,UAGA4hD,GAAgCxnD,GAAQ4F,GAFhC,CAAC,UAEmDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA+BjF,OAAO4C,EAAMV,GAAM,CACjB,kBAAmB6hD,GAEnB,mBAAoB,SAAU5mD,EAAG+P,GAC/B/P,EAAE0D,QAAQqM,EACZ,GACA,IASJ,SAAS62C,GAAU58B,EAAOja,GACxB,MAAMk2B,EAAeH,GAAiB/1B,EAAUia,EAAOjlB,IACvD4gC,GAAY3b,EAAOic,EAAa3+B,GAAI2+B,EAAaF,QACnD,CCpDA,MAAMhhC,GAAO,oBAGA8hD,GAA0C1nD,GAAQ4F,GAF1C,CAAC,UAE6DlC,IAAe,IAAd,MAAE4C,GAAO5C,EAmC3F,OAAO4C,EAAMV,GAAM,CACjBE,MAAO,SAAUjF,GACf,OAAOmkC,GAAiBnkC,EAAGgjB,GAC7B,EACAkc,OAAQ,SAAUl/B,GAChB,OAAOA,EAAEmoC,aACX,GACA,IC5CEpjC,GAAO,WAUA+hD,GAAiC3nD,GAAQ4F,GATjC,CACnB,QACA,SACA,SACA,YACA,cACA,iBAGwElC,IAAqE,IAApE,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEX,EAAS,YAAEE,EAAW,aAAEqkB,GAAcjrC,EA+BxI,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,MAA0B,WAAlBmgB,EAAOgF,OAAuBA,EAAO,IAAM,EACrD,EAEA+iB,OAAQ,SAAU3mB,GAChB,OAAO4D,EAAO5D,EAChB,EAEA,qBAAsB,SAAUqjB,GAC9B,OAAOod,EAAUpd,EAAMA,EAAwB,WAAlBzkB,EAAOgF,OAAsB,aAAUpnB,EACtE,EAEA,6BAA8B,SAAU6mC,EAAMrjB,GAC5C,OAAOygC,EAAUpd,EAAMA,EAAMrjB,EAC/B,EAEA,yCAA0C,SAAUqjB,EAAMqd,GACxD,OAAOD,EAAUpd,EAAMqd,EAAwB,WAAlB9hC,EAAOgF,OAAsB,aAAUpnB,EACtE,EAEA,iDAAkD,SAAU6mC,EAAMqd,EAAM1gC,GACtE,OAAOygC,EAAUpd,EAAMqd,EAAM1gC,EAC/B,EAEArhB,MAAO,SAAUwa,GACf,OAAOwnC,EAAgBxnC,EACzB,EAEA,gBAAiB,SAAUA,EAAM6G,GAC/B,OAAO2gC,EAAgBxnC,EAAM6G,EAC/B,EAEA4Y,OAAQ,SAAUzf,GAChB,OAAOwnC,EAAgBxnC,EAAKT,UAAWS,EAAK0f,UAC9C,EAEA,iBAAkB,SAAU1f,EAAM6G,GAChC,OAAO2gC,EAAgBxnC,EAAKT,UAAWsH,EACzC,IAGF,SAAS2gC,EAAiBxnC,EAAM6G,GAC9B,OAAQ7G,EAAKlf,QACX,KAAK,EAAG,OAAO+lB,EAAS4D,EAAO5D,GAAU,GACzC,KAAK,EAAG,OAAOygC,EAAUtnC,EAAK,GAAIA,EAAK,GAAI6G,GAC3C,KAAK,EAAG,OAAOygC,EAAUtnC,EAAK,GAAIA,EAAK,GAAI6G,GAC3C,QAAS,MAAM,IAAIzQ,MAAM,yCAE7B,CAUA,SAASkxC,EAAWpd,EAAMqd,EAAM1gC,GAE9B,MAAMw5B,EAAO1/B,EAAYupB,IAASvpB,EAAY4mC,GAC1Cz9B,EACA,KAKJ,GAHInJ,EAAYupB,KAAOA,EAAOA,EAAK1hB,YAC/B7H,EAAY4mC,KAAOA,EAAOA,EAAK/+B,aAE9BpD,GAAU8kB,IAASA,EAAO,EAC7B,MAAM,IAAI9zB,MAAM,6DAElB,IAAKgP,GAAUmiC,IAASA,EAAO,EAC7B,MAAM,IAAInxC,MAAM,6DAGlB,MAAM2a,EAAMsvB,EAAM,IAAIv2B,EAAU,GAAK,EAC/BJ,EAAe22B,EAAM,IAAIA,EAAI,GAAK,EAClCrgC,EAAO,CAACkqB,EAAMqd,GAGpB,GAAI1gC,EAAQ,CAEV,GAAe,WAAXA,EACF,OAAOwnB,EAAa/D,SAAStqB,EAAM+Q,EAAK,EAAGrH,GAE7C,GAAe,UAAX7C,EACF,OAAOmD,EAAYsgB,SAAStqB,EAAM+Q,EAAK,EAAGrH,GAE5C,MAAM,IAAIjjB,UAAU,wBAAwBogB,KAC9C,CAGA,MAAMmU,EAAM8E,GAAO,GAAI9f,EAAM0J,GAEvB+9B,EAAUvd,EAAOqd,EAAOrd,EAAOqd,EAErC,IAAK,IAAI3mD,EAAI,EAAGA,EAAI6mD,EAAS7mD,IAC3Bo6B,EAAIp6B,GAAGA,GAAKmwB,EAEd,OAAOiK,CACT,KC/II11B,GAAO,OAGAoiD,GAA6BhoD,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,mBAE6BlC,IAAuC,IAAtC,MAAE4C,EAAK,OAAEykB,EAAM,eAAEqzB,GAAgB16C,EA4BtG,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOiqB,EAAOk9B,EAAMpnD,EAAEg/B,UAAW/+B,EAAE++B,WACrC,EAEA,gBAAiB,SAAUh/B,EAAGC,GAC5B,OAAOiqB,EAAOk9B,EAAMpnD,EAAEg/B,UAAW/+B,GACnC,EAEA,gBAAiB,SAAUD,EAAGC,GAC5B,OAAOiqB,EAAOk9B,EAAMpnD,EAAGC,EAAE++B,WAC3B,EAEA,eAAgBooB,IAUlB,SAASA,EAAOjuC,EAAGD,GAUjB,GARuB,IAAnBuG,GAAKtG,GAAG5Y,SAEV4Y,EAAI,CAACA,IAEgB,IAAnBsG,GAAKvG,GAAG3Y,SAEV2Y,EAAI,CAACA,IAEHuG,GAAKtG,GAAG5Y,OAAS,GAAKkf,GAAKvG,GAAG3Y,OAAS,EACzC,MAAM,IAAIknC,WAAW,+EACAF,KAAKjH,UAAUnnB,EAAE5Y,QAAU,SAAWgnC,KAAKjH,UAAUpnB,EAAE3Y,QAAU,KAExF,MAAMR,EAAI,GACV,IAAIwb,EAAI,GAER,OAAOpC,EAAEjQ,KAAI,SAAUiQ,GACrB,OAAOD,EAAEhQ,KAAI,SAAUgQ,GAGrB,OAFAqC,EAAI,GACJxb,EAAEyB,KAAK+Z,GACApC,EAAEjQ,KAAI,SAAUjJ,GACrB,OAAOiZ,EAAEhQ,KAAI,SAAUlJ,GACrB,OAAOub,EAAE/Z,KAAK+7C,EAAet9C,EAAGD,GAClC,GACF,GACF,GACF,KAAMD,CACR,KCjFIgF,GAAO,MAGAgb,GAA4B5gB,GAAQ4F,GAF5B,CAAC,UAE+ClC,IAAe,IAAd,MAAE4C,GAAO5C,EA8C7E,OAAO4C,EAAMV,GAAM,CACjB,kBAAmBsiD,EAEnB,mBAAoB,SAAUrnD,EAAG+P,GAC/B,OAAO/P,EAAEkJ,IAAI6G,EACf,EAEA,uDAAwDu3C,CAACjrB,EAAGC,EAAGijB,IAejE,SAAuBgI,EAAQC,GAC7B,GAA6B,mBAAlBA,EACT,MAAM,IAAI3xC,MAAM,6CAGlB,MAAM4xC,EAAqBF,EAAO,GAAG5mC,SAC/B2hB,EAAQilB,EAAOr+C,KAAIwzB,GAAKA,EAAE/b,SAAW+b,EAAEjd,OAASwhB,GAAUvE,KAC1DsL,EAAUxD,MAAkBlC,GAC5BolB,EAAiBH,EAAOhnD,OAExBqoC,EAAO6e,EACT,CAACv9B,EAAQykB,IAAQzkB,EAAOpkB,IAAI6oC,GAC5B7oC,GAEE6hD,EAAcJ,EAAOr+C,KAAI,CAAC0+C,EAAYtmD,KAC1C,MAAM4kC,EAAa5D,EAAMhhC,GAAG4H,KAAI,IAAM,IACtC,OAAO0+C,EAAWjnC,SAAWinC,EAAW9hD,IAAIogC,GAAcpgC,GAAI8hD,EAAY1hB,EAAW,IAIjF2hB,EAAmBpiD,EAAM0B,gBAAgBqgD,GA0IjD,SAAoCz3C,EAAUuP,EAAQqvB,EAAKpK,GACzD,OAA6D,OAAzD9+B,EAAMqS,QAAQ/H,EAAU,IAAIuP,EAAQqvB,KAAQpK,IAA4B,EAC1B,OAA9C9+B,EAAMqS,QAAQ/H,EAAU,IAAIuP,EAAQqvB,IAAyB,GAC7DlpC,EAAMqS,QAAQ/H,EAAUuP,GAA2B,EAGzD,CA/IMwoC,CAA0BN,EAAeG,EAAa3f,EAAQ9+B,KAAI,IAAM,IAAIq+C,GAkHlF,SAA+Bx3C,EAAU23C,GACvC,MAAM1gB,EAAcj3B,EAASqC,WAE7B,GAAI,YAAYpN,KAAKgiC,GAAc,OAAO,EAG1C,MAAMC,EAAYD,EAAYh/B,MAAM,WAEpC,MAAI,SAAShD,KAAKiiC,IACdl3B,EAASxP,OAASmnD,EAAiB,EADF,EAEjC33C,EAASxP,SAAWmnD,EAAiB,EAAY,EAC9C,CACT,CA7HMK,CAAqBP,EAAeE,GAExC,GAAIG,EAAmB,EAAG,CACxB,MAAM93C,EAAWi4C,EAAoBH,EAAkBL,EAAe,MACtE,OAyBJ,SAAsBS,EAAal4C,GAGjC,MAAMm4C,EAAkBD,EAAY,GAC9B1jB,EAAS0jB,EAAY/+C,KAAK0+C,GAC9BA,EAAWjnC,SAAWinC,EAAW5oC,UAAY4oC,IAEzCtlB,EAAQ2lB,EAAY/+C,KAAK0+C,GAC7BA,EAAWjnC,SAAWinC,EAAWnoC,OAASwhB,GAAU2mB,KAEhDO,EAAY3jB,MAAkBlC,GAE9B8lB,EAAU9lB,EAAMp5B,KAAKuW,GAAS0oC,EAAU5nD,OAASkf,EAAKlf,SACtDgoC,EAAW4f,EAAU5nD,OAAS,EAE9BoD,EADoBoM,EAASxP,OAAS,EACV,GAAK,KACjC8nD,EAUN,SAAS7e,EAASjF,GAAmB,IAAX/oB,EAAKvZ,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,EAEhC,MAAMqmD,EAAuBH,EAAU3sC,GACjCva,EAASgE,MAAMqjD,GACrB,GAAI9sC,EAAQ+sB,EACV,IAAK,IAAIjnC,EAAI,EAAGA,EAAIgnD,EAAsBhnD,IACpCqC,IAAOA,EAAM6X,GAASla,GAI1BL,EAAOK,GAAKkoC,EACVjF,EAAOr7B,KAAI,CAAC8gB,EAAOu+B,IACjBH,EAAQG,GAAc/sC,EAClBwO,EACiB,IAAjBA,EAAMzpB,OACJypB,EAAM,GACNA,EAAM1oB,KAEdka,EAAQ,QAIZ,IAAK,IAAIla,EAAI,EAAGA,EAAIgnD,EAAsBhnD,IACpCqC,IAAOA,EAAM6X,GAASla,GAC1BL,EAAOK,GAAKyO,EACVw0B,EAAOr7B,KAAKiQ,GAAoB,IAAbA,EAAE5Y,OAAe4Y,EAAE,GAAKA,EAAE7X,KAC7CqC,EAAQA,EAAMjC,aAAUoB,GAI9B,OAAO7B,CACT,CAzCqBuoC,CAAQjF,EAAQ,GACrC,GAAI2jB,EAAgBvnC,SAAU,CAC5B,MAAM6nC,EAAgBN,EAAgBvjD,SAGtC,OAFA6jD,EAAcxmB,MAAQqmB,EACtBG,EAAc/mB,MAAQ0mB,EACfK,CACT,CACE,OAAOH,CAmCX,CAnFWI,CAAYlB,EAAQx3C,EAC7B,CAEA,MAAM24C,EAAoBjB,EACtBF,EAAOr+C,KAAIwzB,GAAKA,EAAE/b,SAChB+b,EAAE/3B,OAAOogC,GAAYrI,EAAEsC,UAAWgJ,GAAUtL,EAAE0C,YAC9CmoB,EAAO,GAAG5iD,OAAOogC,GAAYrI,EAAE1d,UAAWgpB,MAC5Cuf,EAAOr+C,KAAIwzB,GAAKA,EAAE/b,SAChBokB,GAAYrI,EAAEsC,UAAWgJ,GACzBjD,GAAYrI,EAAGsL,KAEfj4B,EAAWi4C,EAAoBH,EAAkBL,EAAekB,GAEhEC,EAA4BA,CAAC3oD,EAAG2uC,IACpC5+B,EACE,CAAC/P,KAAM0oD,EAAkBhnD,MAAM,GAAGwH,KAAI8gB,GAAS4e,EAAK5e,EAAO2kB,MAC3DA,GAEJ,OAAI8Y,EACKiB,EAAkB,GAAGx/C,IAAIy/C,GAEzBtB,EAAUqB,EAAkB,GAAIC,EAE3C,CA/DIC,CAAa,CAACvsB,EAAGC,KAAMijB,EAAK79C,MAAM,EAAG69C,EAAKh/C,OAAS,IAAKg/C,EAAKA,EAAKh/C,OAAS,MAoI/E,SAASynD,EAAqBH,EAAkBL,EAAekB,GAC7D,OAAQb,GACN,KAAK,EACH,OAAO7nD,GAAKwnD,KAAiBxnD,GAC/B,KAAK,EACH,MAAO,CAACA,EAAG2uC,IAAQ6Y,KAAiBxnD,EAAG2uC,GACzC,KAAK,EACH,MAAO,CAAC3uC,EAAG2uC,IAAQ6Y,KAAiBxnD,EAAG2uC,KAAQ+Z,GAErD,CA6CA,SAASrB,EAAWr9B,EAAOja,GACzB,MAAMk2B,EAAeH,GAAiB/1B,EAAUia,EAAOjlB,IACvD,OAAOwgC,GAAQvb,EAAOic,EAAa3+B,GAAI2+B,EAAaF,QACtD,KCtPIhhC,GAAO,OAGA8jD,GAA6B1pD,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,WAAY,WAEiBlC,IAAyC,IAAxC,MAAE4C,EAAK,OAAEykB,EAAM,SAAE6L,EAAQ,OAAE5Q,GAAQtiB,EA+CxG,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU+K,GAC1B,OAAI6Q,EAAS7Q,GACJoa,EAAO4+B,EAAMh5C,EAAIkvB,YAEjB8pB,EAAMh5C,EAEjB,EACA,yBAA0B,SAAUA,EAAKqxB,GACvC,IAAKtc,GAAUsc,GAAM,MAAM,IAAIsG,WAAW,oCAC1C,OAAI9mB,EAAS7Q,GACJoa,EAAO6+B,EAAWj5C,EAAIkvB,UAAWmC,IAEjC4nB,EAAWj5C,EAAKqxB,EAE3B,EACA,mBAAoB17B,EAAMgM,QAAQ,gBAAgBu3C,GAChD,CAACl5C,EAAKqxB,IAAQ6nB,EAAOl5C,EAAKqV,EAAOgc,MACnC,oBAAqB17B,EAAMgM,QAAQ,iBAAiBw3C,GAClD,CAACn5C,EAAKqxB,IAAQ8nB,EAAOn5C,EAAKqV,EAAOgc,QAWrC,SAAS4nB,EAAYj5C,EAAKqxB,GAIxB,GAHIxgB,EAAS7Q,KACXA,EAAMA,EAAIkvB,YAEP/5B,MAAMC,QAAQ4K,GACjB,MAAM23B,WAAW,mDAEnB,GAAItG,EAAM,EAAG,CACX,MAAMlgC,EAAS,GAIf,OAHA6O,EAAIpM,SAAQ+3C,IACVx6C,EAAOO,KAAKunD,EAAWtN,EAASta,EAAM,GAAG,IAEpClgC,CACT,CAAO,GAAY,IAARkgC,EACT,OAAO2nB,EAAMh5C,GAEb,MAAM23B,WAAW,iCAErB,CAQA,SAASqhB,EAAOh5C,GACd,MAAM7O,EAAS,GACTwe,EAAO3P,EAAIvP,OACjB,IAAK,IAAIe,EAAI,EAAGA,EAAIme,EAAMne,IACxBL,EAAOO,KAAK0nD,EAAap5C,EAAIxO,EAAI,GAAIwO,EAAIxO,KAE3C,OAAOL,CACT,CASA,SAASioD,EAAcC,EAAMC,GAEvBzoC,EAASwoC,KAAOA,EAAOA,EAAKnqB,WAC5Bre,EAASyoC,KAAOA,EAAOA,EAAKpqB,WAEhC,MAAMqqB,EAAcpkD,MAAMC,QAAQikD,GAC5BG,EAAcrkD,MAAMC,QAAQkkD,GAClC,GAAIC,GAAeC,EACjB,OAeJ,SAAqBC,EAAMC,GACzB,GAAID,EAAKhpD,SAAWipD,EAAKjpD,OACvB,MAAMknC,WAAW,2CAEnB,MAAMxmC,EAAS,GACTwe,EAAO8pC,EAAKhpD,OAClB,IAAK,IAAIe,EAAI,EAAGA,EAAIme,EAAMne,IACxBL,EAAOO,KAAK0nD,EAAaK,EAAKjoD,GAAIkoD,EAAKloD,KAEzC,OAAOL,CACT,CAzBWwoD,CAAWN,EAAMC,GAE1B,IAAKC,IAAgBC,EACnB,OAAOvzB,EAASqzB,EAAMD,GAExB,MAAMjjD,UAAU,8DAClB,CAmBA,ICvJWwjD,GAA6BvqD,GAH7B,OACQ,CAAC,QAAS,SAAU,SAAU,cAEmB0D,IAA0C,IAAzC,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEX,GAAW1mB,EAmCzG,OAAO4C,EAAM,OAAQ,CACnB,GAAI,WACF,MAA0B,UAAlByf,EAAOgF,OACXy/B,EAAM,IACNA,EAAM,GAAI,UAChB,EAIA,iCAAkC,SAAUlqC,GAE1C,GAAoB,iBADPA,EAAKA,EAAKlf,OAAS,GACF,CAC5B,MAAM+lB,EAAS7G,EAAK8I,MACpB,OAAOohC,EAAMlqC,EAAM6G,EACrB,CAAO,MAAsB,UAAlBpB,EAAOgF,OACTy/B,EAAMlqC,GAENkqC,EAAMlqC,EAAM,UAEvB,EAEAxa,MAAO0kD,EAEPzqB,OAAQ,SAAUzf,GAChB,MAAM6G,EAAS7G,EAAK0f,UACpB,OAAOwqB,EAAMlqC,EAAKT,UAAWsH,EAC/B,EAEA,yBAA0B,SAAU7G,EAAM6G,GACxC,OAAOqjC,EAAMlqC,EAAKT,UAAWsH,EAC/B,IAUF,SAASqjC,EAAOlqC,EAAM6G,GACpB,MAAMsjC,EAsBR,SAAqBnqC,GACnB,IAAImqC,GAAgB,EAOpB,OANAnqC,EAAK/b,SAAQ,SAAUsD,EAAOrD,EAAOmM,GAC/BsQ,EAAYpZ,KACd4iD,GAAgB,EAChB95C,EAAInM,GAASqD,EAAMihB,WAEvB,IACO2hC,CACT,CA/BwBC,CAAWpqC,GAC3B0J,EAAeygC,EAAgB,IAAIrgC,EAAU,GAAK,EAGxD,GA8BF,SAAoB9J,GAClBA,EAAK/b,SAAQ,SAAUsD,GACrB,GAAqB,iBAAVA,IAAuB6d,GAAU7d,IAAUA,EAAQ,EAC5D,MAAM,IAAI6O,MAAM,wDAEpB,GACF,CAtCEqrB,CAAUzhB,GAEN6G,EAAQ,CAEV,MAAMiJ,EAAIrF,EAAO5D,GACjB,OAAI7G,EAAKlf,OAAS,EACTgvB,EAAEgQ,OAAO9f,EAAM0J,GAEjBoG,CACT,CAAO,CAEL,MAAMzf,EAAM,GACZ,OAAI2P,EAAKlf,OAAS,EACTg/B,GAAOzvB,EAAK2P,EAAM0J,GAEpBrZ,CACT,CACF,CAqBA,IC5HK,SAASg6C,KACd,MAAM,IAAIj0C,MAAM,0CAClB,CAEO,SAASk0C,KACd,MAAM,IAAIl0C,MAAM,yCAClB,CAEO,SAASm0C,KACd,MAAM,IAAIn0C,MAAM,uCAClB,CCPA,MAAM9Q,GAAO,QAGAklD,GAA8B9qD,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,UAAW,aAAc,QAAS,UAAW,YAAa,SAAU,WAAY,MAAO,SAAU,eAEnElC,IAAyG,IAAxG,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEggC,EAAS,QAAEtJ,EAAO,UAAEuJ,EAAS,OAAEC,EAAM,SAAEC,EAAQ,IAAE3/C,EAAG,OAAEmkB,EAAM,WAAEwD,GAAYxvB,EAsDzK,OAAO4C,EAAMV,GAAM,CAGjBkoC,OAAQqd,EACR,kBAAmBA,EAEnBnlC,OAAQ,SAAUolC,GAChB,MAAM,IAAIrkD,UAAU,0CAA0CqkD,IAChE,EAEAvd,QAAS,SAAUud,GACjB,MAAM,IAAIrkD,UAAU,sDAAsDqkD,sCAC5E,EAEA,iBAAkB,SAAU/0C,EAAOC,GACjC,OAAO+0C,EAAKC,EAAOj1C,EAAOC,EAAK,GAAG,GACpC,EACA,yBAA0B,SAAUD,EAAOC,EAAKipB,GAC9C,OAAO8rB,EAAKC,EAAOj1C,EAAOC,EAAKipB,GAAM,GACvC,EACA,0BAA2B,SAAUlpB,EAAOC,EAAKi1C,GAC/C,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAK,EAAGi1C,GACpC,EACA,kCAAmC,SAAUl1C,EAAOC,EAAKipB,EAAMgsB,GAC7D,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAKipB,EAAMgsB,GACvC,EAGA,wBAAyB,SAAUl1C,EAAOC,GACxC,OAAO+0C,EAAKC,EAAOj1C,EAAOC,EAAK,IAAI,GACrC,EACA,iBAAkB,SAAUD,EAAOC,GACjC,OAAO+0C,EAAKC,EAAOrlC,OAAO5P,GAAQC,EAAK,IAAI,GAC7C,EACA,uCAAwC,SAAUD,EAAOC,EAAKipB,GAC5D,OAAO8rB,EAAKC,EAAOj1C,EAAOC,EAAK2P,OAAOsZ,IAAO,GAC/C,EACA,gCAAiC,SAAUlpB,EAAOC,EAAKipB,GACrD,OAAO8rB,EAAKC,EAAOrlC,OAAO5P,GAAQC,EAAK2P,OAAOsZ,IAAO,GACvD,EACA,iCAAkC,SAAUlpB,EAAOC,EAAKi1C,GACtD,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAK,GAAIi1C,GACrC,EACA,0BAA2B,SAAUl1C,EAAOC,EAAKi1C,GAC/C,OAAOF,EAAKC,EAAOrlC,OAAO5P,GAAQC,EAAK,GAAIi1C,GAC7C,EACA,gDAAiD,SAAUl1C,EAAOC,EAAKipB,EAAMgsB,GAC3E,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAK2P,OAAOsZ,GAAOgsB,GAC/C,EACA,yCAA0C,SAAUl1C,EAAOC,EAAKipB,EAAMgsB,GACpE,OAAOF,EAAKC,EAAOrlC,OAAO5P,GAAQC,EAAK2P,OAAOsZ,GAAOgsB,GACvD,EAEA,uBAAwB,SAAUl1C,EAAOC,GAGvC,OAAO+0C,EAAKC,EAAOj1C,EAAOC,EAAK,IAAI8T,EAFjB/T,EAAM3Q,aAEqB,IAAI,GACnD,EACA,kCAAmC,SAAU2Q,EAAOC,EAAKipB,GACvD,OAAO8rB,EAAKC,EAAOj1C,EAAOC,EAAKipB,GAAM,GACvC,EACA,gCAAiC,SAAUlpB,EAAOC,EAAKi1C,GAGrD,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAK,IAAI8T,EAFjB/T,EAAM3Q,aAEqB,GAAI6lD,GACnD,EACA,2CAA4C,SAAUl1C,EAAOC,EAAKipB,EAAMgsB,GACtE,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAKipB,EAAMgsB,GACvC,EAEA,qBAAsB,SAAUl1C,EAAOC,GACrC,OAAO+0C,EAAKC,EAAOj1C,EAAOC,EAAK,GAAG,GACpC,EACA,+BAAgC,SAAUD,EAAOC,EAAKipB,GACpD,OAAO8rB,EAAKC,EAAOj1C,EAAOC,EAAKipB,GAAM,GACvC,EACA,8BAA+B,SAAUlpB,EAAOC,EAAKi1C,GACnD,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAK,EAAGi1C,GACpC,EACA,wCAAyC,SAAUl1C,EAAOC,EAAKipB,EAAMgsB,GACnE,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAKipB,EAAMgsB,GACvC,EAEA,mBAAoB,SAAUl1C,EAAOC,EAAKipB,GACxC,OAAO8rB,EAAKC,EAAOj1C,EAAOC,EAAKipB,GAAM,GACvC,EACA,4BAA6B,SAAUlpB,EAAOC,EAAKipB,EAAMgsB,GACvD,OAAOF,EAAKC,EAAOj1C,EAAOC,EAAKipB,EAAMgsB,GACvC,IAIF,SAASF,EAAM16C,GACb,MAAsB,WAAlBoV,EAAOgF,OACFA,EAASA,EAAOpa,GAAOk6C,KAGzBl6C,CACT,CAEA,SAASw6C,EAAW1nD,EAAK8nD,GACvB,MAAMnvC,EAoDR,SAAiB3Y,GACf,MAGMk8B,EAHOl8B,EAAI4G,MAAM,KAGLN,KAAI,SAAUsG,GAE9B,OAAOqa,OAAOra,EAChB,IAKA,GAHgBsvB,EAAK/1B,MAAK,SAAU+pB,GAClC,OAAO1V,MAAM0V,EACf,IAEE,OAAO,KAGT,OAAQgM,EAAKv+B,QACX,KAAK,EACH,MAAO,CACLiV,MAAOspB,EAAK,GACZrpB,IAAKqpB,EAAK,GACVJ,KAAM,GAGV,KAAK,EACH,MAAO,CACLlpB,MAAOspB,EAAK,GACZrpB,IAAKqpB,EAAK,GACVJ,KAAMI,EAAK,IAGf,QACE,OAAO,KAEb,CAtFY6rB,CAAO/nD,GACjB,IAAK2Y,EACH,MAAM,IAAIrQ,YAAY,WAAatI,EAAM,uBAG3C,MAAsB,cAAlBsiB,EAAOC,aACSriB,IAAdonD,GACFJ,KAGKU,EAAKC,EACVP,EAAU3uC,EAAE/F,OACZ00C,EAAU3uC,EAAE9F,KACZy0C,EAAU3uC,EAAEmjB,SAGP8rB,EAAKC,EAAOlvC,EAAE/F,MAAO+F,EAAE9F,IAAK8F,EAAEmjB,KAAMgsB,GAE/C,CAWA,SAASD,EAAQj1C,EAAOC,EAAKipB,EAAMgsB,GACjC,MAAM1gC,EAAQ,GACd,GAAI6E,EAAO6P,GAAO,MAAM,IAAI7oB,MAAM,yBAClC,MAAM+0C,EAAUv4B,EAAWqM,GACvBgsB,EAAaP,EAAYvJ,EACzB8J,EAAaL,EAAWD,EAC5B,IAAIpqD,EAAIwV,EACR,KAAOo1C,EAAQ5qD,EAAGyV,IAChBuU,EAAMxoB,KAAKxB,GACXA,EAAI0K,EAAI1K,EAAG0+B,GAEb,OAAO1U,CACT,CA6CA,ICpPIjlB,GAAO,UAGA8lD,GAAgC1rD,GAAQ4F,GAFhC,CAAC,QAAS,YAAa,WAE6BlC,IAA0B,IAAzB,MAAE4C,EAAK,UAAEof,GAAWhiB,EAyC5F,OAAO4C,EAAMV,GAAM,CAEjB,gBAAiB,SAAU/E,EAAGsiC,GAC5B,OAAOtiC,EAAEw/B,QAAQ8C,GAAO,EAC1B,EAEA,eAAgB,SAAUtiC,EAAGsiC,GAM3B,OALAA,EAAM5+B,SAAQ,SAAU+b,GACtB,IAAKoF,EAAUpF,GACb,MAAM,IAAIvZ,UAAU,+BAAiCuZ,EAEzD,IACOqrC,GAAa9qD,EAAGsiC,EACzB,GAEA,IClDSyoB,GAA+B5rD,GAH/B,SACQ,CAAC,SAAU,WAEwC0D,IAAwB,IAAvB,OAAEqiB,EAAM,OAAEgF,GAAQrnB,EA4BzF,OAAO,SAAiB7C,EAAGyf,EAAM0J,GAC/B,GAAyB,IAArBlnB,UAAU1B,QAAqC,IAArB0B,UAAU1B,OACtC,MAAM,IAAI66C,GAAe,SAAUn5C,UAAU1B,OAAQ,EAAG,GAe1D,GAZIogB,EAASlB,KACXA,EAAOA,EAAKT,WAGVoB,EAAYX,EAAK,MAEnBA,EAAOA,EAAKvW,KAAI,SAAUlC,GACxB,OAAQoZ,EAAYpZ,GAAiBA,EAAMihB,WAAdjhB,CAC/B,KAIE2Z,EAAS3gB,GAEX,OAAOA,EAAEu/B,OAAO9f,EAAM0J,GAAc,GAGtC,GAAiB,iBAANnpB,EAET,OAgCJ,SAAwB4C,EAAK6c,EAAMurC,GACjC,QAAoBloD,IAAhBkoD,GACF,GAA2B,iBAAhBA,GAAmD,IAAvBA,EAAYzqD,OACjD,MAAM,IAAI2F,UAAU,kDAGtB8kD,EAAc,IAGhB,GAAoB,IAAhBvrC,EAAKlf,OACP,MAAM,IAAIsgC,GAAephB,EAAKlf,OAAQ,GAExC,MAAMuY,EAAM2G,EAAK,GACjB,GAAmB,iBAAR3G,IAAqB+L,GAAU/L,GACxC,MAAM,IAAI5S,UAAU,uDACJogB,GAAO7G,GAAQ,KAGjC,GAAI7c,EAAIrC,OAASuY,EACf,OAAOlW,EAAIi1B,UAAU,EAAG/e,GACnB,GAAIlW,EAAIrC,OAASuY,EAAK,CAC3B,IAAI2hB,EAAM73B,EACV,IAAK,IAAItB,EAAI,EAAG8O,EAAK0I,EAAMlW,EAAIrC,OAAQe,EAAI8O,EAAI9O,IAC7Cm5B,GAAOuwB,EAET,OAAOvwB,CACT,CACE,OAAO73B,CAEX,CA7DWqoD,CAAcjrD,EAAGyf,EAAM0J,GAIhC,MAAMg8B,GAAWlgD,MAAMC,QAAQlF,IAAgC,UAAlBklB,EAAOgF,OAEpD,GAAoB,IAAhBzK,EAAKlf,OAAc,CAErB,KAAO0E,MAAMC,QAAQlF,IACnBA,EAAIA,EAAE,GAGR,OAAOijB,GAAMjjB,EACf,CAAO,CAEAiF,MAAMC,QAAQlF,KACjBA,EAAI,CAACA,IAIP,MAAMy6B,EAAMywB,GAFZlrD,EAAIijB,GAAMjjB,GAEiByf,EAAM0J,GACjC,OAAOg8B,EAAWj7B,EAAOuQ,GAAOA,CAClC,CACF,CAsCA,IC1HI11B,GAAO,SAOAomD,GAA+BhsD,GAAQ4F,GAN/B,CACnB,QACA,WACA,mBAGsElC,IAGhE,IAFN,MACE4C,EAAK,SAAEgyC,EAAQ,eAAE2T,GAClBvoD,EA6BD,OAAO4C,EAAMV,GAAM,CACjB,8CAA+C,SAAU5E,EAAGkrD,GAG1D,OAFAC,EAAcnrD,EAAG,GACCs3C,EAAS2T,EAAeC,GAAQlrD,GACjC6+B,SACnB,EAEA,+CAAgD,SAAU7+B,EAAGkrD,GAE3D,OADAC,EAAcnrD,EAAG,GACVs3C,EAAS2T,EAAeC,GAAQlrD,EACzC,EAEA,6DAA8D,SAAUA,EAAGkrD,EAAOjrD,GAGhF,OAFAkrD,EAAcnrD,EAAG,GACCs3C,EAAS2T,EAAeC,EAAOjrD,GAAID,EAEvD,EAEA,8DAA+D,SAAUA,EAAGkrD,EAAOjrD,GAEjF,OADAkrD,EAAcnrD,EAAG,GACVs3C,EAAS2T,EAAeC,EAAOjrD,GAAID,EAC5C,IAGF,SAASmrD,EAAelrD,EAAGmrD,GACzB,MAAMC,EAAavmD,MAAMC,QAAQ9E,GAAK6gC,GAAU7gC,GAAKA,EAAEqf,OACvD,GAAI+rC,EAAWjrD,OAAS,EACtB,MAAM,IAAIknC,WAAW,kCAAkC8jB,KAEzD,GAA0B,IAAtBC,EAAWjrD,QAAkC,IAAlBirD,EAAW,GACxC,MAAM,IAAI/jB,WAAW,kCAAkC8jB,KAEzD,GAAIC,EAAW,KAAOD,EACpB,MAAM,IAAI9jB,WAAW,kCAAkC8jB,IAE3D,KC1EIxmD,GAAO,iBAgBA0mD,GAAuCtsD,GAAQ4F,GAfvC,CACnB,QACA,SACA,iBACA,YACA,aACA,OACA,SACA,YACA,cACA,eACA,MACA,QAG8ElC,IAKxE,IAJN,MACE4C,EAAK,OAAEyf,EAAM,eAAEq4B,EAAc,UAC7BD,EAAS,WAAEnI,EAAU,KAAEuW,EAAI,UAAEniC,EAAS,OACtCW,EAAM,YAAET,EAAW,aAAEqkB,EAAY,IAAEpf,EAAG,IAAEkF,GACzC/wB,EAkCD,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,MAA0B,WAAlBmgB,EAAOgF,OAAuBA,EAAO,IAAM,EACrD,EAEA+iB,OAAQ,SAAU3mB,GAChB,OAAO4D,EAAO5D,EAChB,EAEA,sCAAuC,SAAU+kC,GAC/C,OAAOM,EAAmBN,EAAyB,WAAlBnmC,EAAOgF,OAAsB,aAAUpnB,EAC1E,EAEA,8CAA+C,SAAUuoD,EAAO/kC,GAC9D,OAAOqlC,EAAmBN,EAAO/kC,EACnC,EAEA,6CAA8C,SAAU+kC,EAAOjrD,GAC7D,MAAMwrD,EAAU1hC,EAAO9pB,GAEvB,OADAyrD,EAAgBD,GACTE,EAAmBT,EAAOO,OAAS9oD,EAC5C,EAEA,8CAA+C,SAAUuoD,EAAOjrD,GAC9DyrD,EAAgBzrD,GAChB,MAAM2rD,EAAc3rD,EAAE++B,YAAgC,WAAlBja,EAAOgF,OAAsB,aAAUpnB,GAC3E,OAAOgpD,EAAmBT,EAAOjrD,EAAG2rD,EACtC,EAEA,qDAAsD,SAAUV,EAAOjrD,EAAGkmB,GACxE,MAAMslC,EAAU1hC,EAAO9pB,GAEvB,OADAyrD,EAAgBD,GACTE,EAAmBT,EAAOO,EAAStlC,EAC5C,EAEA,sDAAuD,SAAU+kC,EAAOjrD,EAAGkmB,GAEzE,OADAulC,EAAgBzrD,GACT0rD,EAAmBT,EAAOjrD,EAAGkmB,EACtC,IAYF,SAASqlC,EAAoBN,EAAO/kC,GAClC,MAEM0lC,EAFM5rC,EAAYirC,GAED,IAAI9hC,GAAW,IAAM,EACtC0iC,EAAWv9B,EAAI28B,GACfa,EAAWt4B,EAAIy3B,GAGrB,OAAOc,EAFM,CAAC,CAACF,EAAU1O,EAAeyO,EAAUE,IAAY,CAACA,EAAUD,IAE3C3lC,EAChC,CAEA,SAASulC,EAAiBzrD,GACxB,MAAMqf,EAAOrf,EAAEqf,OACf,GAAIA,EAAKlf,OAAS,GAAiB,IAAZkf,EAAK,GAC1B,MAAM,IAAIgoB,WAAW,mCAEzB,CAEA,SAAS2kB,EAAMpiC,GACb,OAAOA,EAAMkZ,QAAO,CAAC/5B,EAAGqwB,IAAS+jB,EAAep0C,EAAGqwB,IACrD,CAEA,SAAS2yB,EAAkBpoD,EAAMuiB,GAC/B,GAAIA,EAAQ,CACV,GAAe,WAAXA,EACF,OAAO,IAAIwnB,EAAa/pC,GAE1B,GAAe,UAAXuiB,EACF,OAAO,IAAImD,EAAY1lB,GAEzB,MAAM,IAAImC,UAAU,wBAAwBogB,KAC9C,CACA,OAAOviB,CACT,CAWA,SAAS+nD,EAAoBT,EAAOjrD,EAAGkmB,GACrC,MAAM+lC,EAAQX,EAAKtrD,GACnB,GAAc,IAAVisD,EACF,MAAM,IAAI5kB,WAAW,+BAGvB,MAAMqY,EAAM1/B,EAAYirC,GAAS9hC,EAAY,KAEvCiH,EAAMsvB,EAAM,IAAIA,EAAI,GAAK,EACzBkM,EAAWlM,EAAM,IAAIA,GAAK,IAAM,EAChCrP,EAAKqP,EAAM,IAAIA,EAAI1/C,EAAE0F,IAAI,CAAC,IAAMumD,GAASjsD,EAAE0F,IAAI,CAAC,IAAMumD,EACtD3b,EAAKoP,EAAM,IAAIA,EAAI1/C,EAAE0F,IAAI,CAAC,IAAMumD,GAASjsD,EAAE0F,IAAI,CAAC,IAAMumD,EACtDC,EAAKxM,EAAM,IAAIA,EAAI1/C,EAAE0F,IAAI,CAAC,IAAMumD,GAASjsD,EAAE0F,IAAI,CAAC,IAAMumD,EACtDnoD,EAAIwqB,EAAI28B,GACRkB,EAAYjP,EAAU9sB,EAAK2kB,EAAWjxC,IACtCuF,EAAImqB,EAAIy3B,GAgBd,OAAOc,EAFM,CAAC,CAZF7O,EAAUp5C,EAAGkoD,EAAK,CAAC3b,EAAIA,EAAI8b,KAC3BjP,EAAU8O,EAAK,CAAC3b,EAAIC,EAAI6b,IAAaH,EAAK,CAACJ,EAAUM,EAAI7iD,KACzD6zC,EAAU8O,EAAK,CAAC3b,EAAI6b,EAAIC,IAAaH,EAAK,CAAC1b,EAAIjnC,MAU5B,CARnB6zC,EAAU8O,EAAK,CAAC3b,EAAIC,EAAI6b,IAAaH,EAAK,CAACE,EAAI7iD,KAC/C6zC,EAAUp5C,EAAGkoD,EAAK,CAAC1b,EAAIA,EAAI6b,KAC3BjP,EAAU8O,EAAK,CAAC1b,EAAI4b,EAAIC,IAAaH,EAAK,CAACJ,EAAUvb,EAAIhnC,MAMrB,CAJpC6zC,EAAU8O,EAAK,CAAC3b,EAAI6b,EAAIC,IAAaH,EAAK,CAACJ,EAAUtb,EAAIjnC,KACzD6zC,EAAU8O,EAAK,CAAC1b,EAAI4b,EAAIC,IAAaH,EAAK,CAAC3b,EAAIhnC,KAC/C6zC,EAAUp5C,EAAGkoD,EAAK,CAACE,EAAIA,EAAIC,OAITjmC,EAChC,KChLWkmC,GAA4BrtD,GAH5B,MACQ,CAAC,QAAS,QAAS,SAAU,UAEmB0D,IAAqC,IAApC,MAAE4C,EAAK,MAAE8/C,EAAK,OAAEr7B,EAAM,MAAE8e,GAAOnmC,EAsBnG,OAAO4C,EAzBI,MAyBQ,CACjB,iBAAkBgnD,EAElB,gBAAiB,SAAUzlD,EAAO4iC,GAChC,OAAO6iB,EAAKviC,EAAOjH,GAAMjc,IAAS4iC,GAAK5qB,SACzC,IASF,SAASytC,EAAMzlD,EAAO4iC,GAEpB,GAA4B,IAAxB5iC,EAAMyY,OAAOlf,OACf,MAAM,IAAIsV,MAAM,4CAGlB+rB,GAAcgI,EAAK5iC,EAAMyY,OAAO,IAEhC,MAAMitC,EAAc1jB,EAAM,EAAGhiC,EAAMyY,OAAO,IACpC9b,EAAQ,IAAI4hD,EAAM3b,EAAK8iB,GACvBzrD,EAAS+F,EAAMq4B,OAAO17B,GAC5B,OAAOgd,EAAS1f,GACZA,EACAipB,EAAO,CAAC,CAACjpB,IACf,KCtDI8D,GAAO,OAGA4nD,GAA6BxtD,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,YAE6BlC,IAA+B,IAA9B,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,GAAQrnB,EAwB9F,OAAO4C,EAAMV,GAAM,CACjBm6B,OAAQ,SAAUl/B,GAChB,OAAOA,EAAE2E,OAAO3E,EAAEyf,OAAQ,SAC5B,EAEAxa,MAAOg8B,GAEPgM,OAAQ,SAAUjtC,GAChB,MAA0B,UAAlBklB,EAAOgF,OAAsB,CAAClqB,EAAEO,QAAU2pB,EAAO,CAAClqB,EAAEO,QAAS,QAAS,SAChF,EAEA,uDAAwD,SAAUP,GAEhE,MAA0B,UAAlBklB,EAAOgF,OACX,GACAA,EAASA,EAAO,GAAI,QAAS,UAAY8/B,IAC/C,GACA,IC5CEjlD,GAAO,UAGA6nD,GAAgCztD,GAAQ4F,GAFhC,CAAC,UAEmDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA8BjF,OAAO4C,EAAMV,GAAM,CACjBE,MAAO,SAAUjF,GACf,OAAO6sD,GAAa5pC,GAAMjjB,GAC5B,EAEAk/B,OAAQ,SAAUl/B,GAChB,MAAMy6B,EAAMoyB,GAAa7sD,EAAEg/B,WAE3B,OAAO/5B,MAAMC,QAAQu1B,GAAOz6B,EAAE2E,OAAO81B,EAAKz6B,EAAEo/B,YAAc3E,CAC5D,EAEA8P,IAAK,SAAUvqC,GAEb,OAAOijB,GAAMjjB,EACf,GACA,IC7CE+E,GAAO,SAGA+nD,GAA+B3tD,GAAQ4F,GAF/B,CAAC,QAAS,SAAU,QAAS,QAEsBlC,IAAmC,IAAlC,MAAE4C,EAAK,OAAEykB,EAAM,MAAErC,EAAK,IAAEnd,GAAK7H,EAgDpG,OAAO4C,EAAMV,GAAM,CAEjB,gBAAiB,SAAUiC,EAAOrD,GAChC,OAAIk+B,GAAal+B,GAAiBumB,KAClCqX,GAAwBv6B,EAAOrD,GACxBqD,EAAMq4B,OAAO17B,GACtB,EAEA,eAAgB8B,EAAMgM,QAAQ,iBAAiB,SAAUs7C,GACvD,OAAO,SAAU/lD,EAAOrD,GACtB,MAAMqpD,EAAeD,EAAU7iC,EAAOljB,GAAQrD,GAC9C,OAAOA,EAAMykC,WAAa4kB,EAAeA,EAAahuC,SACxD,CACF,IAEA,gBAAiBiuC,GAEjB,gBAAiBC,GAGjB,0BAA2B,SAAUlmD,EAAOrD,EAAO27B,EAAanW,GAC9D,OAAI0Y,GAAal+B,GAAiBqD,GAClCu6B,GAAwBv6B,EAAOrD,GACxBqD,EAAMic,QAAQoc,OAAO17B,EAgChC,SAAgC27B,EAAa37B,GAC3C,GAA2B,iBAAhB27B,EACT,MAAM,IAAIzpB,MAAM,4BAElB,GAAIlS,EAAMwpD,UACR,OAAO7tB,EAGT,MAAM8tB,EAAYzpD,EAAM8b,OACxB,IAAI2tC,EAAUt6C,OAAMzS,GAAKA,EAAI,IAO3B,OAAOi/B,EANP,IACE,OAAO50B,EAAI40B,EAAazX,EAAMulC,GAChC,CAAE,MAAOC,GACP,OAAO/tB,CACT,CAIJ,CAlDuCguB,CAAsBhuB,EAAa37B,GAAQwlB,GAChF,EAEA,yBAA0B1jB,EAAMgM,QAAQ,2BAA2B,SAAUs7C,GAC3E,OAAO,SAAU/lD,EAAOrD,EAAO27B,EAAanW,GAC1C,MAAM6jC,EAAeD,EAAU7iC,EAAOljB,GAAQrD,EAAO27B,EAAanW,GAClE,OAAO6jC,EAAarsC,SAAWqsC,EAAahuC,UAAYguC,CAC1D,CACF,IAEA,oBAAqBvnD,EAAMgM,QAAQ,2BAA2B,SAAUs7C,GACtE,OAAO,SAAU/lD,EAAOrD,EAAO27B,GAC7B,OAAOytB,EAAU7iC,EAAOljB,GAAQrD,EAAO27B,OAAax8B,GAAWkc,SACjE,CACF,IAEA,qBAAsBvZ,EAAMgM,QAAQ,2BAA2B,SAAUs7C,GACvE,OAAO,SAAU/lD,EAAOrD,EAAO27B,GAAe,OAAOytB,EAAU/lD,EAAOrD,EAAO27B,OAAax8B,EAAW,CACvG,IAEA,wBAAyByqD,GACzB,gCAAiCA,GACjC,qBAAsBC,IA4BxB,IAUF,SAASN,GAAetqD,EAAKe,GAC3B,IAAKqd,EAAQrd,GAEX,MAAM,IAAIuC,UAAU,kBAGtB,GAAI27B,GAAal+B,GAAU,MAAO,GAGlC,GAFA49B,GAAwBt8B,MAAMwF,KAAK7H,GAAMe,GAEb,IAAxBA,EAAM8b,OAAOlf,OACf,MAAM,IAAIsgC,GAAel9B,EAAM8b,OAAOlf,OAAQ,GAIhD,MAAMktD,EAAS7qD,EAAIrC,OACnBqhC,GAAcj+B,EAAMoJ,MAAM,GAAI0gD,GAC9B7rB,GAAcj+B,EAAMuJ,MAAM,GAAIugD,GAE9B,MAAMzkB,EAAQrlC,EAAMo+B,UAAU,GAE9B,IAAI2rB,EAAS,GAKb,OAJA1kB,EAAMtlC,SAAQ,SAAUtD,GACtBstD,GAAU9qD,EAAI4qB,OAAOptB,EACvB,IAEOstD,CACT,CAYA,SAASH,GAAe3qD,EAAKe,EAAO27B,EAAanW,GAC/C,IAAKxlB,IAA2B,IAAlBA,EAAMqd,QAElB,MAAM,IAAI9a,UAAU,kBAEtB,GAAI27B,GAAal+B,GAAU,OAAOf,EAElC,GADA2+B,GAAwBt8B,MAAMwF,KAAK7H,GAAMe,GACb,IAAxBA,EAAM8b,OAAOlf,OACf,MAAM,IAAIsgC,GAAel9B,EAAM8b,OAAOlf,OAAQ,GAEhD,QAAqBuC,IAAjBqmB,GACF,GAA4B,iBAAjBA,GAAqD,IAAxBA,EAAa5oB,OACnD,MAAM,IAAI2F,UAAU,kDAGtBijB,EAAe,IAGjB,MAAM6f,EAAQrlC,EAAMo+B,UAAU,GAG9B,GAFYiH,EAAMvpB,OAAO,KAEb6f,EAAY/+B,OACtB,MAAM,IAAIsgC,GAAemI,EAAMvpB,OAAO,GAAI6f,EAAY/+B,QAIxD,MAAMktD,EAAS7qD,EAAIrC,OACnBqhC,GAAcj+B,EAAMoJ,MAAM,IAC1B60B,GAAcj+B,EAAMuJ,MAAM,IAG1B,MAAMygD,EAAQ,GACd,IAAK,IAAIrsD,EAAI,EAAGA,EAAImsD,EAAQnsD,IAC1BqsD,EAAMrsD,GAAKsB,EAAI4qB,OAAOlsB,GAQxB,GALA0nC,EAAMtlC,SAAQ,SAAUtD,EAAGkB,GACzBqsD,EAAMvtD,GAAKk/B,EAAY9R,OAAOlsB,EAAE,GAClC,IAGIqsD,EAAMptD,OAASktD,EACjB,IAAK,IAAInsD,EAAImsD,EAAS,EAAG30C,EAAM60C,EAAMptD,OAAQe,EAAIwX,EAAKxX,IAC/CqsD,EAAMrsD,KACTqsD,EAAMrsD,GAAK6nB,GAKjB,OAAOwkC,EAAM/lD,KAAK,GACpB,CASA,SAASqlD,GAAoB1uC,EAAQ5a,GACnC,GAAIk+B,GAAal+B,GAAU,OAE3B,GAA4B,IAAxBA,EAAM8b,OAAOlf,OACf,MAAM,IAAIsgC,GAAel9B,EAAM8b,OAAQ,GAGzC,MAAMtd,EAAMwB,EAAMo+B,UAAU,GAC5B,GAAmB,iBAAR5/B,EACT,MAAM,IAAI+D,UAAU,2DAGtB,OAAOoY,EAAgBC,EAAQpc,EACjC,CAUA,SAASqrD,GAAoBjvC,EAAQ5a,EAAO27B,GAC1C,GAAIuC,GAAal+B,GAAU,OAAO4a,EAClC,GAA4B,IAAxB5a,EAAM8b,OAAOlf,OACf,MAAM,IAAIsgC,GAAel9B,EAAM8b,OAAQ,GAGzC,MAAMtd,EAAMwB,EAAMo+B,UAAU,GAC5B,GAAmB,iBAAR5/B,EACT,MAAM,IAAI+D,UAAU,2DAItB,MAAM0nD,EAAU3qC,GAAM1E,GAGtB,OAFAG,EAAgBkvC,EAASzrD,EAAKm9B,GAEvBsuB,CACT,CCjRA,MAAM7oD,GAAO,YAGA8oD,GAAkC1uD,GAAQ4F,GAFlC,CAAC,QAAS,WAE4ClC,IAAuB,IAAtB,MAAE4C,EAAK,OAAEykB,GAAQrnB,EAuB3F,OAAO4C,EAAMV,GAAM,CACjBE,MAAOjF,GAAK8tD,EAAgB5jC,EAAOlqB,IAAIgf,UACvCkgB,OAAQ4uB,EACRvjB,IAAKtnB,KAGP,SAAS6qC,EAAiB9tD,GAExB,MAAMyf,EAAOzf,EAAEyf,OAGf,IAAIvb,EAGJ,OAAQub,EAAKlf,QACX,KAAK,EAEH2D,EAAIlE,EAAEijB,QACN,MAEF,KAAK,EACH,CAEE,MAAM0mB,EAAOlqB,EAAK,GACZoqB,EAAUpqB,EAAK,GAGrB,GAAgB,IAAZoqB,EAEF,MAAM,IAAIpC,WAAW,uDAAyDnhB,GAAO7G,GAAQ,KAI/F,OAAQzf,EAAEm/B,WACR,IAAK,QACHj7B,EAgBZ,SAA0BqrB,EAAGoa,EAAME,GAEjC,MAAM9lC,EAAOwrB,EAAEyS,MAET+rB,EAAa,GACnB,IAAIC,EAEJ,IAAK,IAAIzsD,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhCysD,EAAgBD,EAAWxsD,GAAK,GAEhC,IAAK,IAAID,EAAI,EAAGA,EAAIqoC,EAAMroC,IAExB0sD,EAAc1sD,GAAK2hB,GAAMlf,EAAKzC,GAAGC,GAErC,CAEA,OAAOguB,EAAE2Y,kBAAkB,CACzBnkC,KAAMgqD,EACNtuC,KAAM,CAACoqB,EAASF,GAChBvK,SAAU7P,EAAEsY,WAEhB,CAtCgBomB,CAAgBjuD,EAAG2pC,EAAME,GAC7B,MACF,IAAK,SACH3lC,EAqCZ,SAA2BqrB,EAAGoa,EAAME,GAElC,MAAMvqB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAERiK,EAAUz2B,EAAS,QAAKxc,EACxBwoC,EAAS,GACT0K,EAAO,GAEP71C,EAAI,GACV,IAAK,IAAIH,EAAI,EAAGA,EAAI2pC,EAAM3pC,IAAOG,EAAEH,GAAK,EAExC,IAAImJ,EAAG+8C,EAAG3kD,EAEV,IAAK4H,EAAI,EAAG+8C,EAAIviD,EAAMpD,OAAQ4I,EAAI+8C,EAAG/8C,IAEnChJ,EAAEwD,EAAMwF,MAGV,IAAIouB,EAAM,EAEV,IAAK,IAAIj2B,EAAI,EAAGA,EAAIqoC,EAAMroC,IAExB00C,EAAKx0C,KAAK+1B,GAEVA,GAAOp3B,EAAEmB,GAETnB,EAAEmB,GAAK00C,EAAK10C,GAKd,IAFA00C,EAAKx0C,KAAK+1B,GAELh2B,EAAI,EAAGA,EAAIsoC,EAAStoC,IAEvB,IAAK,IAAIwqC,EAAKkC,EAAI1sC,GAAIyqC,EAAKiC,EAAI1sC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE1D,MAAMgzB,EAAInzB,EAAEwD,EAAMrD,MAElBgrC,EAAOhY,GAAK/xB,EAER+d,IAAUy2B,EAAQziB,GAAKrQ,GAAM3D,EAAOhf,IAC1C,CAGF,OAAOivB,EAAEkf,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACoqB,EAASF,GAChBvK,SAAU7P,EAAEsY,WAEhB,CAzFgBqmB,CAAiBluD,EAAG2pC,EAAME,GAGpC,CACA,MAEF,QAEE,MAAM,IAAIpC,WAAW,qDAAuDnhB,GAAO7G,GAAQ,KAE/F,OAAOvb,CACT,CA8EA,IC3JIa,GAAO,aAGAopD,GAAmChvD,GAAQ4F,GAFnC,CAAC,QAAS,YAAa,SAEgClC,IAAgC,IAA/B,MAAE4C,EAAK,UAAE2oD,EAAS,KAAEC,GAAMxrD,EAuBrG,OAAO4C,EAAMV,GAAM,CACjBwlC,IAAK,SAAUvqC,GACb,OAAOquD,EAAKD,EAAUpuD,GACxB,GACA,IC3BE+E,GAAO,QAGAupD,GAA8BnvD,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,SAAU,cAEoBlC,IAA0C,IAAzC,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEX,GAAW1mB,EAiC1G,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,MAA0B,UAAlBmgB,EAAOgF,OACXqkC,EAAO,IACPA,EAAO,GAAI,UACjB,EAIA,iCAAkC,SAAU9uC,GAE1C,GAAoB,iBADPA,EAAKA,EAAKlf,OAAS,GACF,CAC5B,MAAM+lB,EAAS7G,EAAK8I,MACpB,OAAOgmC,EAAO9uC,EAAM6G,EACtB,CAAO,MAAsB,UAAlBpB,EAAOgF,OACTqkC,EAAO9uC,GAEP8uC,EAAO9uC,EAAM,UAExB,EAEAxa,MAAOspD,EAEPrvB,OAAQ,SAAUzf,GAChB,MAAM6G,EAAS7G,EAAK0f,UACpB,OAAOovB,EAAO9uC,EAAKT,UAAWsH,EAChC,EAEA,yBAA0B,SAAU7G,EAAM6G,GACxC,OAAOioC,EAAO9uC,EAAKT,UAAWsH,EAChC,IAUF,SAASioC,EAAQ9uC,EAAM6G,GACrB,MAAMsjC,EAsBR,SAAqBnqC,GACnB,IAAImqC,GAAgB,EAOpB,OANAnqC,EAAK/b,SAAQ,SAAUsD,EAAOrD,EAAOmM,GAC/BsQ,EAAYpZ,KACd4iD,GAAgB,EAChB95C,EAAInM,GAASqD,EAAMihB,WAEvB,IACO2hC,CACT,CA/BwBC,CAAWpqC,GAC3B0J,EAAeygC,EAAgB,IAAIrgC,EAAU,GAAK,EAGxD,GA8BF,SAAoB9J,GAClBA,EAAK/b,SAAQ,SAAUsD,GACrB,GAAqB,iBAAVA,IAAuB6d,GAAU7d,IAAUA,EAAQ,EAC5D,MAAM,IAAI6O,MAAM,yDAEpB,GACF,CAtCEqrB,CAAUzhB,GAEN6G,EAAQ,CAEV,MAAMiJ,EAAIrF,EAAO5D,GACjB,OAAI7G,EAAKlf,OAAS,EACTgvB,EAAEgQ,OAAO9f,EAAM0J,GAEjBoG,CACT,CAAO,CAEL,MAAMzf,EAAM,GACZ,OAAI2P,EAAKlf,OAAS,EACTg/B,GAAOzvB,EAAK2P,EAAM0J,GAEpBrZ,CACT,CACF,CAqBA,ICtGW0+C,GAA4BrvD,GAjB5B,MACQ,CACnB,QACA,SACA,YACA,iBACA,eACA,MACA,MACA,IACA,YACA,OACA,MACA,OACA,SAGmE0D,IAc/D,IAdgE,MACpE4C,EAAK,OACLykB,EAAM,UACNozB,EAAS,eACTC,EAAc,aACdkR,EAAY,IACZzoC,EAAG,IACH0oC,EACAptD,EAAGqpC,EAAC,UACJgkB,EAAS,KACTN,EAAI,IACJ30C,EAAG,KACHwT,EAAI,KACJ1H,GACD3iB,EAoBC,OAAO4C,EAnDI,MAmDQ,CACjBR,MAAO2pD,EACP1vB,OAAQ,SAAUhV,GAChB,OAAOA,EAAOvlB,OAAOiqD,EAAO1kC,EAAOlL,WAAYkL,EAAOkV,WACxD,IASF,SAASwvB,EAAQ9+C,GACf,MAAM2P,EAAOwhB,GAAUnxB,GACvB,OAAoB,IAAhB2P,EAAKlf,OAAqBsuD,EAAK/+C,EAAK2P,EAAK,IAEtCqvC,EAAOh/C,EAAI5G,KAAIxH,GAASktD,EAAOltD,EAAO+d,EAAK/d,MAAM,MAAM,EAChE,CASA,SAASotD,EAAQh/C,EAAKqxB,GACpB,MAAM1hB,EAAOwhB,GAAUnxB,GACvB,GAAY,IAARqxB,EAAW,OAAO,IAAIl8B,MAAMwa,EAAK,IAAI7N,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMwtD,EAAOh/C,EAAIxO,GAAI6/B,EAAM,KACpF,GAAoB,IAAhB1hB,EAAKlf,OAAc,OAAOsuD,EAAK/+C,GACnC,SAASi/C,EAAYj/C,GACnB,MAAM2P,EAAOwhB,GAAUnxB,GACvB,OAAO,IAAI7K,MAAMwa,EAAK,IAAI7N,KAAK,GAAG1I,KAAI,CAACzG,EAAGlB,IAAM,IAAI0D,MAAMwa,EAAK,IAAI7N,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMwO,EAAIxO,GAAGC,MAClG,CACA,OAAOwtD,EAAWD,EAAOC,EAAWj/C,GAAM,GAC5C,CAuCA,SAAS++C,EAAM/+C,GACb,MAAMgJ,EAAMhJ,EAAIvP,OAChB,GAAY,IAARuY,EAAW,MAAO,CAAChJ,EAAI,IAC3B,GAAIgJ,EAAM,GAAM,EAAG,CACjB,MAAMgiB,EAAM,IACP+zB,EAAK/+C,EAAI5I,QAAO,CAACzE,EAAGnB,IAAMA,EAAI,GAAM,QACpCutD,EAAK/+C,EAAI5I,QAAO,CAACzE,EAAGnB,IAAMA,EAAI,GAAM,MAEzC,IAAK,IAAIhB,EAAI,EAAGA,EAAIwY,EAAM,EAAGxY,IAAK,CAChC,MAAM6I,EAAI2xB,EAAIx6B,GACRgzB,EAAIiqB,EACRziB,EAAIx6B,EAAIwY,EAAM,GACdkN,EACEu3B,EAAeA,EAAemR,EAAK/jB,GAAI8jB,GAAcnuD,EAAGwY,MAG5DgiB,EAAIx6B,GAAKg9C,EAAUn0C,EAAGmqB,GACtBwH,EAAIx6B,EAAIwY,EAAM,GAAKwkC,EAAUn0C,EAAGo0C,GAAgB,EAAGjqB,GACrD,CACA,OAAOwH,CACT,CAEE,OAtDJ,SAAehrB,GACb,MAAMjM,EAAIiM,EAAIvP,OACRJ,EAAI6lB,EAAIyoC,EAAalR,GAAgB,EAAGA,EAAe5S,EAAG+jB,IAAO7qD,IACjEmrD,EAAQ,GACd,IAAK,IAAI1tD,EAAI,EAAIuC,EAAGvC,EAAIuC,EAAGvC,IACzB0tD,EAAMxtD,KAAKkY,EAAIvZ,EAAGsuD,EAAa/0C,EAAIpY,EAAG,GAAI,KAE5C,MAAM2tD,EAAKv1C,EAAI,EAAGwT,EAAK1H,EAAK3hB,EAAIA,EAAI,KAC9BqrD,EAAK,IACN,IAAIjqD,MAAMpB,GAAG+N,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMi8C,EAAeztC,EAAIxO,GAAI0tD,EAAMnrD,EAAI,EAAIvC,SACxE,IAAI2D,MAAMgqD,EAAKprD,GAAG+N,KAAK,IAEtBu9C,EAAS,IACV,IAAIlqD,MAAMpB,EAAIA,EAAI,GAAG+N,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMmtD,EAAa,EAAGO,EAAM1tD,SACjE,IAAI2D,MAAMgqD,GAAMprD,EAAIA,EAAI,IAAI+N,KAAK,IAEhCw9C,EAAQP,EAAKK,GACbG,EAAYR,EAAKM,GACjBG,EAAa,IAAIrqD,MAAMgqD,GAAIr9C,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMi8C,EAAe6R,EAAM9tD,GAAI+tD,EAAU/tD,MACpFiuD,EAAcZ,EAAUN,EAAKO,EAAOP,EAAKiB,KAAeL,GACxDn0B,EAAM,GACZ,IAAK,IAAIx5B,EAAIuC,EAAI,EAAGvC,EAAIuC,EAAIA,EAAI,EAAGvC,IACjCw5B,EAAIt5B,KAAK+7C,EAAegS,EAAYjuD,GAAI0tD,EAAM1tD,KAEhD,OAAOw5B,CACT,CA6BW00B,CAAK1/C,EAGhB,KCtJI/K,GAAO,OAQA0qD,GAA6BtwD,GAAQ4F,GAP7B,CACnB,QACA,MACA,YACA,SAGoElC,IAKhE,IALiE,MACrE4C,EAAK,IACLiqD,EAAG,UACHf,EAAS,KACTN,GACDxrD,EAmBC,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU+K,GAC1B,MAAM2P,EAAOkB,EAAS7Q,GAAOA,EAAI2P,OAASwhB,GAAUnxB,GACpD,OAAO6+C,EAAUN,EAAKqB,EAAIrB,EAAKv+C,KAAQ2P,EAAKyjB,QAAO,CAACoC,EAAK9L,IAAS8L,EAAM9L,GAAM,GAChF,GACA,ICnBSm2B,GAAiCxwD,GAnBjC,WACQ,CACnB,QACA,MACA,WACA,WACA,SACA,MACA,MACA,MACA,aACA,aACA,SACA,UACA,SACA,YACA,eAGwE0D,IAkBrE,IAjBH,MACE4C,EAAK,IACLiF,EAAG,SACHqrB,EAAQ,SACR0hB,EAAQ,OACR9nB,EAAM,IACNziB,EAAG,IACHhE,EAAG,IACHke,EAAG,WACHiL,EAAU,WACVD,EAAU,OACVg4B,EAAM,QACNxJ,EAAO,OACP12B,EAAM,UACNggC,EAAS,WACT/U,GACDtyC,EAuDD,SAAS+sD,EAAKC,GAGZ,OAAO,SAAUnvD,EAAGovD,EAAOC,EAAIvoD,GAG7B,GADuC,IAAjBsoD,EAAMvvD,SAAkBuvD,EAAMh9C,MAAMk9C,KAAeF,EAAMh9C,MAAM2N,GAEnF,MAAM,IAAI5K,MAAM,8EAElB,MAAMo6C,EAAKH,EAAM,GACX/3C,EAAK+3C,EAAM,GACXI,EAAa9F,EAAOryC,EAAIk4C,GACxBE,EAAY3oD,EAAQ2oD,UAC1B,QAAkBrtD,IAAdqtD,IAA4B99B,EAAW89B,GACzC,MAAM,IAAIt6C,MAAM,gCAElB,MAAMu6C,EAAU5oD,EAAQ4oD,QACxB,QAAgBttD,IAAZstD,IAA0B/9B,EAAW+9B,GACvC,MAAM,IAAIv6C,MAAM,8BAElB,MAAMw6C,EAAU7oD,EAAQ6oD,QACxB,GAAIA,GAAWj+B,EAAWi+B,GACxB,MAAM,IAAIx6C,MAAM,sCAElB,MAAMy6C,EAAW,CAACL,EAAIl4C,EAAIo4C,EAAWE,EAASD,GAASlpD,QAAOlH,QAAW8C,IAAN9C,IACnE,IAAMswD,EAASx9C,MAAMk9C,KAAeM,EAASx9C,MAAM2N,GACjD,MAAM,IAAI5K,MAAM,gDAElB,MACM06C,EAAM/oD,EAAQ+oD,IAAM/oD,EAAQ+oD,IAAM,KAClCC,EAAWhpD,EAAQgpD,SAAWhpD,EAAQgpD,SAAW,GACjDC,EAAWjpD,EAAQipD,SAAWjpD,EAAQipD,SAAW,EACjDC,EAAUlpD,EAAQkpD,QAAUlpD,EAAQkpD,QAAU,IAC9C9G,EAAgB,CAACqG,EAAIl4C,KAAOg4C,EAAIK,EAASC,GAAStnD,KAAKqX,IACtDjH,EAAGjV,EAAGgV,EAAGy3C,GAAM/G,EAClB,CACEM,EAAU2F,EAAe12C,GACzB+wC,EAAU2F,EAAe3rD,GACzBgmD,EAAU2F,EAAe32C,GACzBgxC,EAAU2F,EAAec,KAE3B,CAACd,EAAe12C,EAAG02C,EAAe3rD,EAAG2rD,EAAe32C,EAAG22C,EAAec,IAE1E,IAAI3sD,EAAImsD,EACJD,EAAaC,EAAYhb,EAAWgb,GACpCxgC,EAAOoG,EAAShe,EAAIk4C,GAjBV,GAkBd,MAAMlwD,EAAI,CAACkwD,GACLhwD,EAAI,CAAC8vD,GAELa,EAAS76B,EAAS7c,EAAGy3C,GAE3B,IAAI9sD,EAAI,EACJgtD,EAAO,EACX,MAAMjG,EAgIV,SAAyBsF,GAEvB,OAAOA,EAAatP,EAAUwJ,CAChC,CAnIoB0G,CAAeZ,GACzBa,EAoIV,SAA0Bb,GACxB,MAAMc,EAAcd,EAAa9F,EAASxJ,EAC1C,OAAO,SAAU7gD,EAAGgY,EAAI/T,GACtB,MAAMlE,EAAO4K,EAAI3K,EAAGiE,GACpB,OAAOgtD,EAAYlxD,EAAMiY,GAAMge,EAAShe,EAAIhY,GAAKiE,CACnD,CACF,CA1IqBitD,CAAgBf,GAEjC,KAAOtF,EAAQ7qD,EAAE8D,GAAIkU,IAAK,CACxB,MAAMzX,EAAI,GAGV0D,EAAI+sD,EAAShxD,EAAE8D,GAAIkU,EAAI/T,GAGvB1D,EAAEkB,KAAKd,EAAEX,EAAE8D,GAAI5D,EAAE4D,KAGjB,IAAK,IAAIvC,EAAI,EAAGA,EAAI4C,EAAE3D,SAAUe,EAC9BhB,EAAEkB,KACAd,EACEgK,EAAI3K,EAAE8D,GAAI4zC,EAASvzC,EAAE5C,GAAI0C,IACzB0G,EAAIzK,EAAE4D,GAAI4zC,EAASzzC,EAAGmV,EAAE7X,GAAIhB,MAMlC,MAAM4wD,EAAKhkD,EACTka,EACEle,EAAIuuC,EAASmZ,EAAQtwD,IAAKe,GACxBof,EAAOpf,GAAKA,EAAE2F,MAAQ3F,MAKxB6vD,EAAKX,GAAOA,EAAMW,EAAK,EAAI,IAE7BnxD,EAAEyB,KAAKkJ,EAAI3K,EAAE8D,GAAIG,IACjB/D,EAAEuB,KAAKkJ,EAAIzK,EAAE4D,GAAI4zC,EAASzzC,EAAGkV,EAAG5Y,KAChCuD,KAIF,IAAIstD,EAAQ,KAAQZ,EAAMW,IAAO,GAiBjC,GAfItQ,EAAQuQ,EAAOX,GACjBW,EAAQX,EACCpG,EAAO+G,EAAOV,KACvBU,EAAQV,GAGVU,EAAQvH,EAAgBM,EAAUiH,GAASA,EAC3CntD,EAAIyzC,EAASzzC,EAAGmtD,GAEZf,GAAWhG,EAAOhjC,EAAIpjB,GAAIosD,GAC5BpsD,EAAIksD,EAAaE,EAAUjb,EAAWib,GAC7BC,GAAWzP,EAAQx5B,EAAIpjB,GAAIqsD,KACpCrsD,EAAIksD,EAAaG,EAAUlb,EAAWkb,IAExCQ,IACIA,EAAOH,EACT,MAAM,IAAI76C,MAAM,6DAEpB,CACA,MAAO,CAAE9V,IAAGE,IACd,CACF,CAEA,SAASmxD,EAAO1wD,EAAGovD,EAAOC,EAAIvoD,GAkB5B,OAAOooD,EAHgB,CAAEz2C,EAXf,CACR,GACA,CAAC,IACD,CAAC,EAAG,EAAI,GACR,CAAC,EAAI,EAAG,EAAI,EAAG,EAAI,IAOOjV,EAJlB,CAAC,KAAM,GAAO,EAAI,EAAG,GAIAgV,EAHrB,CAAC,EAAI,EAAG,EAAI,EAAG,EAAI,EAAG,GAGEy3C,GAFvB,CAAC,EAAI,GAAI,EAAI,EAAG,EAAI,EAAG,EAAI,IAK/Bf,CAAoBlvD,EAAGovD,EAAOC,EAAIvoD,EAC3C,CAEA,SAAS6pD,EAAO3wD,EAAGovD,EAAOC,EAAIvoD,GAqB5B,OAAOooD,EAHgB,CAAEz2C,EAdf,CACR,GACA,CAAC,IACD,CAAC,EAAI,GAAI,EAAI,IACb,CAAC,GAAK,IAAK,GAAK,GAAI,GAAK,GACzB,CAAC,MAAQ,MAAO,MAAQ,KAAM,MAAQ,MAAO,IAAM,KACnD,CAAC,KAAO,MAAO,IAAM,GAAI,MAAQ,KAAM,GAAK,KAAM,KAAO,OACzD,CAAC,GAAK,IAAK,EAAG,IAAM,KAAM,IAAM,KAAM,KAAO,KAAM,GAAK,KAO9BjV,EAJlB,CAAC,KAAM,GAAO,GAAQ,GAAO,EAAI,EAAG,EAAG,GAIlBgV,EAHrB,CAAC,GAAK,IAAK,EAAG,IAAM,KAAM,IAAM,KAAM,KAAO,KAAM,GAAK,GAAI,GAGpCy3C,GAFvB,CAAC,KAAO,MAAO,EAAG,KAAO,MAAO,IAAM,KAAM,MAAQ,OAAQ,IAAM,KAAM,EAAI,KAKhFf,CAAoBlvD,EAAGovD,EAAOC,EAAIvoD,EAC3C,CAEA,SAAS8pD,EAAW5wD,EAAGovD,EAAOC,EAAIwB,GAChC,MAAM1yC,EAAS0yC,EAAI1yC,OAAS0yC,EAAI1yC,OAAS,OACnC2yC,EAAU,CACdC,KAAML,EACNM,KAAML,GAER,GAAIxyC,EAAO8yC,gBAAiBH,EAAS,CACnC,MAAMI,EAAgB,IAAKL,GAE3B,cADOK,EAAc/yC,OACd2yC,EAAQ3yC,EAAO8yC,eAAejxD,EAAGovD,EAAOC,EAAI6B,EACrD,CAAO,CAEL,MAAMC,EAAoB/vD,OAAOyB,KAAKiuD,GAAStoD,KAAIlJ,GAAK,IAAIA,OAEtD8xD,EAAyB,GAAGD,EAAkBnwD,MAAM,GAAI,GAAGkG,KAAK,aAAaiqD,EAAkBnwD,OAAO,KAC5G,MAAM,IAAImU,MAAM,uBAAuBgJ,6BAAkCizC,IAC3E,CACF,CAeA,SAAS9B,EAAYhwD,GAEnB,OAAOogB,EAAYpgB,IAAMmgB,EAASngB,EACpC,CAEA,SAAS+xD,EAAiBrxD,EAAGsxD,EAAGjC,EAAIvoD,GAElC,MAAMyqD,EAAMX,EAAU5wD,EAAGsxD,EAAEhzB,UAAW+wB,EAAG/wB,UAAWx3B,GACpD,MAAO,CAAEzH,EAAGmqB,EAAO+nC,EAAIlyD,GAAIE,EAAGiqB,EAAO+nC,EAAIhyD,GAC3C,CAEA,OAAOwF,EAAM,WAAY,CACvB,iCAAkC6rD,EAClC,mCAAoCS,EACpC,yBAA0BG,CAACxxD,EAAGsxD,EAAGjC,IAAOuB,EAAU5wD,EAAGsxD,EAAGjC,EAAI,CAAC,GAC7D,2BAA4BoC,CAACzxD,EAAGsxD,EAAGjC,IAAOgC,EAAgBrxD,EAAGsxD,EAAGjC,EAAI,CAAC,GACrE,6CAA8CqC,CAAC1xD,EAAGsxD,EAAGjC,KACnD,MAAMkC,EAAMX,EAAU5wD,EAAGsxD,EAAG,CAACjC,GAAK,CAAC,GACnC,MAAO,CAAEhwD,EAAGkyD,EAAIlyD,EAAGE,EAAGgyD,EAAIhyD,EAAEiJ,KAAKmpD,GAAMA,EAAE,KAAK,EAEhD,8CAA+CC,CAAC5xD,EAAGsxD,EAAGjC,KACpD,MAAMkC,EAAMX,EAAU5wD,EAAGsxD,EAAEhzB,UAAW,CAAC+wB,GAAK,CAAC,GAC7C,MAAO,CAAEhwD,EAAGmqB,EAAO+nC,EAAIlyD,GAAIE,EAAGiqB,EAAO+nC,EAAIhyD,EAAEiJ,KAAKmpD,GAAMA,EAAE,MAAM,EAEhE,qDAAsDE,CAAC7xD,EAAGsxD,EAAGjC,EAAIvoD,KAC/D,MAAMyqD,EAAMX,EAAU5wD,EAAGsxD,EAAG,CAACjC,GAAKvoD,GAClC,MAAO,CAAEzH,EAAGkyD,EAAIlyD,EAAGE,EAAGgyD,EAAIhyD,EAAEiJ,KAAKmpD,GAAMA,EAAE,KAAK,EAEhD,sDAAuDG,CAAC9xD,EAAGsxD,EAAGjC,EAAIvoD,KAChE,MAAMyqD,EAAMX,EAAU5wD,EAAGsxD,EAAEhzB,UAAW,CAAC+wB,GAAKvoD,GAC5C,MAAO,CAAEzH,EAAGmqB,EAAO+nC,EAAIlyD,GAAIE,EAAGiqB,EAAO+nC,EAAIhyD,EAAEiJ,KAAKmpD,GAAMA,EAAE,MAAM,GAEhE,ICrTSI,GAA4BtzD,GAL5B,MACQ,CACnB,UAGmE0D,IAAe,IAAd,MAAE4C,GAAO5C,EA4B7E,OAAO4C,EAAM,OAAQ,CACnB0f,OAAQ,SAAUnlB,GAChB,MAAMC,EAAI6M,KAAKsa,IAAIpnB,GAEnB,OAAIC,GAAKyyD,GACAntC,GAAKvlB,GAEVC,GAAK0yD,GACAptC,GAAKvlB,GAqBlB,SAAeC,GACb,MAAM2yD,EAAM3yD,EAAIA,EAChB,IAEIqB,EAFAuxD,EAAOtmC,GAAE,GAAG,GAAKqmC,EACjBE,EAAOF,EAGX,IAAKtxD,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBuxD,GAAQA,EAAOtmC,GAAE,GAAGjrB,IAAMsxD,EAC1BE,GAAQA,EAAOC,GAAE,GAAGzxD,IAAMsxD,EAE5B,OAAO3yD,GAAK4yD,EAAOtmC,GAAE,GAAG,KAAOumC,EAAOC,GAAE,GAAG,GAC7C,CAhCuBC,CAAK/yD,GAEpBA,GAAK,EACAslB,GAAKvlB,IAAM,EAsCxB,SAAgBC,GACd,IAEIqB,EAFAuxD,EAAOtmC,GAAE,GAAG,GAAKtsB,EACjB6yD,EAAO7yD,EAGX,IAAKqB,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBuxD,GAAQA,EAAOtmC,GAAE,GAAGjrB,IAAMrB,EAC1B6yD,GAAQA,EAAOC,GAAE,GAAGzxD,IAAMrB,EAE5B,MAAMgB,GAAU4xD,EAAOtmC,GAAE,GAAG,KAAOumC,EAAOC,GAAE,GAAG,IACzCH,EAAM91C,SAAa,GAAJ7c,GAAU,GACzBgzD,GAAOhzD,EAAI2yD,IAAQ3yD,EAAI2yD,GAC7B,OAAO9lD,KAAKkZ,KAAK4sC,EAAMA,GAAO9lD,KAAKkZ,KAAKitC,GAAOhyD,CACjD,CAnD4BiyD,CAAMjzD,IAEvBslB,GAAKvlB,IAAM,EA4DtB,SAAgBC,GACd,IAGIqB,EAHAsxD,EAAM,GAAK3yD,EAAIA,GACf4yD,EAAOtmC,GAAE,GAAG,GAAKqmC,EACjBE,EAAOF,EAGX,IAAKtxD,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACtBuxD,GAAQA,EAAOtmC,GAAE,GAAGjrB,IAAMsxD,EAC1BE,GAAQA,EAAOC,GAAE,GAAGzxD,IAAMsxD,EAE5B,IAAI3xD,EAAS2xD,GAAOC,EAAOtmC,GAAE,GAAG,KAAOumC,EAAOC,GAAE,GAAG,IACnD9xD,GAAUkyD,GAAQlyD,GAAUhB,EAC5B2yD,EAAM91C,SAAa,GAAJ7c,GAAU,GACzB,MAAMgzD,GAAOhzD,EAAI2yD,IAAQ3yD,EAAI2yD,GAC7B,OAAO9lD,KAAKkZ,KAAK4sC,EAAMA,GAAO9lD,KAAKkZ,KAAKitC,GAAOhyD,CACjD,CA3E0BmyD,CAAMnzD,GAC9B,EAEA,iBAAkBwF,EAAM6L,aAAYH,GAAQtN,GAAK0hC,GAAQ1hC,EAAGsN,MAwE9D,IAOIwhD,GAAS,OAMTQ,GAAQ,kBAOR5mC,GAAI,CAAC,CACT,mBAAwB,mBACxB,iBAAwB,mBACxB,oBACC,CACD,kBAAwB,kBACxB,kBAAwB,kBACxB,iBAAwB,mBACxB,mBAAwB,mBACxB,uBACC,CACD,mBAAwB,mBACxB,mBAAwB,oBACxB,qBAAwB,sBAQpBwmC,GAAI,CAAC,CACT,mBAAwB,mBACxB,mBAAwB,mBACvB,CACD,mBAAwB,kBACxB,kBAAwB,mBACxB,mBAAwB,kBACxB,mBAAwB,oBACvB,CACD,kBAAwB,mBACxB,kBAAwB,mBACxB,uBAQIL,GAAU5lD,KAAK4M,IAAI,EAAG,ICzLtB3U,GAAO,OAGAsuD,GAA6Bl0D,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,WAAY,MAAO,SAAU,YAAa,QAAS,YAAa,aAAc,QAAS,MAAO,WAAY,MAAO,WAAY,aAAc,OAE9GlC,IAA0I,IAAzI,MAAE4C,EAAK,OAAEyf,EAAM,SAAEuyB,EAAQ,IAAE/9B,EAAG,OAAEiW,EAAM,UAAE2jC,EAAS,MAAE3S,EAAK,UAAEwJ,EAAS,WAAE/3B,EAAU,MAAEmhC,EAAK,IAAE3/B,EAAG,SAAEmC,EAAQ,IAAErrB,EAAG,QAAE8e,EAAO,UAAED,EAAS,GAAE6O,GAAIv1B,EA4BzM,OAAO4C,EAAMV,GAAM,CACjBogB,OAAS1b,GAAM+pD,EAAY/pD,GAAGzC,GAASA,IAAO,IAAM,KACpDuiB,UAAY9f,GAAM+pD,EAChB/pD,GACAzC,GAAS,IAAIuiB,EAAUviB,KACvB,IAES8F,KAAKsa,IAAIta,KAAK6Y,MAAMT,EAAOuD,WAGtCe,QA2BF,SAAsB/f,GACpB,OAAa,IAATA,EAAE2S,IAAqB,IAAT3S,EAAE2wB,GACX,IAAI5Q,GAAS,IAET,IAAT/f,EAAE2S,GACG,IAAIoN,EAAQuE,IAAKA,KAEtBtkB,EAAE2S,KAAOvP,KAAqB,IAATpD,EAAE2wB,GAClB,IAAI5Q,EAAQ,GAEjB/f,EAAE2wB,KAAOvtB,KAAYpD,EAAE2S,MAAO,IACzB,IAAIoN,EAAQuE,IAAKA,KAGnB0lC,EAAKhqD,GAAGzC,GAASA,IAAOyC,GAAKqD,KAAKiY,MAAM,KAAW,GAAMjY,KAAKsa,IAAI3d,EAAE2wB,OAAM3wB,GAAKA,EAAE2S,IAC1F,IAjCA,SAASo3C,EAAa/pD,EAAGiqD,EAAaC,GACpC,OAAIhT,EAAMl3C,EAAG,GACJiqD,GAAa,IAElB/S,EAAMl3C,EAAG,GACJiqD,EAAY3lC,KAEhBjJ,SAASrb,GAIPgqD,EAAKhqD,EAAGiqD,EAAaC,GAAiBlqD,GAAKA,IAHzC2oB,EAAW3oB,GAAKiqD,EAAY3lC,KAAO2lC,EAAY,EAI1D,CA8BA,SAASD,EAAMhqD,EAAGiqD,EAAaC,EAAiBC,GAC9C,MAAM/vD,EAAI8vD,EAAgBlqD,GAC1B,GAAImqD,EAAMnqD,KAAO5F,EAAI,GAAK,EACxB,OAoCJ,SAAY4F,EAAG5F,EAAG6vD,GAChB,MAAMxvD,EAAIyrB,EAAO,EAAG8nB,EAASp3C,EAAEqzD,EAAY,GAAI7vD,GAAIkyB,EAAS,EAAGrc,EAAI,EAAGqc,EAAS,EAAGtsB,OAClF,IAAIyR,EAAIw4C,EAAY,GACpB,IAAK,IAAIpzD,EAAIozD,EAAY,GAAIvJ,EAAU7pD,EAAGuD,GAAIvD,EAAIoK,EAAIpK,EAAG,GACvD4a,EAAIxQ,EAAIwQ,EAAGyU,EAAO8nB,IAAW,KAAOn3C,EAAI,GAAID,EAAEC,EAAGuD,IAAK6V,EAAIpZ,EAAGmJ,KAE/D,OAAOguC,EAASvzC,EAAGgX,EACrB,CA3CWxa,CAAE+I,EAAGiqD,EAAY7vD,GAAI6vD,GACvB,CAEL,IAAIxvD,EAAIuzC,EAAS/9B,EAAI,EAAGjQ,GAAIiQ,EAAIg6C,EAAYt7B,GAAKrC,EAAStsB,EAAG,KAG7D,OAFAvF,EAAIuzC,EAASvzC,EAAI0vB,EAAI6jB,EAAS9nB,EAAO+jC,EAAYt7B,GAAK,GAAI3uB,KAC1DvF,EAAIuzC,EAASvzC,EAAGqvD,EAAMx9B,EAAS,EAAGtsB,KAC3BguC,EAASvzC,EAAGuvD,EAAK19B,EAAS,EAAGtsB,GAAIiqD,EAAaC,EAAiBC,GACxE,CACF,CAQA,SAASvzD,EAAGC,EAAGuD,GACb,IAAIqX,EAAI5a,EACR,IAAK,IAAIiB,EAAIjB,EAAG6pD,EAAU5oD,EAAGsC,GAAItC,EAAImJ,EAAInJ,EAAG,GAAI,CAC9C,MAAMsyD,EAASlkC,EACb8nB,EAAS6b,EAAU5oD,EAAI7G,EAAGkyB,EAASx0B,EAAG,KAAMmY,EAAI,EAAGnY,IACnDk2C,EAAS6b,EAAUv9B,EAASlyB,EAAGtC,IAAK+xD,EAAU7b,EAAS,EAAGl2C,MAE5D2Z,EAAIxQ,EAAIwQ,EAAG24C,EACb,CAEA,OAAOpc,EAAS5zC,EAAGqX,EACrB,CAgBA,ICzIInW,GAAO,OAGA+uD,GAA6B30D,GAAQ4F,GAF7B,CAAC,QAAS,QAAS,cAE8BlC,IAA4C,IAA3C,MAAE4C,EAAO2X,MAAO22C,EAAS,UAAEhnB,GAAWlqC,EA0B3G,OAAO4C,EAAMV,GAAM,CACjB,iBAAkBivD,EAElB,MAAO,SAAUloD,GACf,OAAOkoD,EAAMloD,EACf,IASF,SAASkoD,EAAO10C,GAGd,GAAY,KAFZA,EAASrF,GAAQqF,EAAON,YACLze,OAEjB,MAAM,IAAIsV,MAAM,2CAGlB,MAAMyF,EAAQ,CAAC,EACf,IAAI24C,EAAO,GACP/mD,EAAM,EACV,IAAK,IAAI5L,EAAI,EAAGA,EAAIge,EAAO/e,OAAQe,IAAK,CACtC,MAAM0F,EAAQsY,EAAOhe,GAErB,GAAIyrC,EAAU/lC,IAAU+sD,EAAU/sD,GAChC,MAAM,IAAI6O,MAAM,2DAGZ7O,KAASsU,IACbA,EAAMtU,GAAS,GAGjBsU,EAAMtU,KAEFsU,EAAMtU,KAAWkG,EACnB+mD,EAAKzyD,KAAKwF,GACDsU,EAAMtU,GAASkG,IACxBA,EAAMoO,EAAMtU,GACZitD,EAAO,CAACjtD,GAEZ,CACA,OAAOitD,CACT,KCjEK,SAASC,GAAqB9nD,EAAK+nD,EAAQntD,GAEhD,IAAIotD,EAEJ,OAAIhxD,OAAOgJ,GAAKiW,SAAS,oBACvB+xC,EAAUnyD,UAAU1B,OAAS,EACzB,WAAayiB,GAAOhc,GAAS,YAAcugC,KAAKjH,UAAUt5B,GAAS,IACnE,WAAaoF,EAAIrI,KAAK4I,OAAS,IAE5B,IAAIzG,UAAU,oBAAsBiuD,EAAS,gCAAkCC,IAGpFhxD,OAAOgJ,GAAKiW,SAAS,oBACvB+xC,EAAUnyD,UAAU1B,OAAS,EACzB,WAAayiB,GAAOhc,GAAS,YAAcugC,KAAKjH,UAAUt5B,GAAS,IACnE,GAEG,IAAId,UAAU,oBAAsBiuD,EAAS,wDAA0DC,IAGzGhoD,CACT,CC5BA,MAAMrH,GAAO,OAGAsvD,GAA6Bl1D,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,iBAAkB,YAEWlC,IAAgD,IAA/C,MAAE4C,EAAK,OAAEyf,EAAM,eAAEq4B,EAAc,QAAE7I,GAAS7xC,EA0B/G,OAAO4C,EAAMV,GAAM,CAEjB,iBAAkBuvD,EAGlB,qCAAsC,SAAUtqC,EAAOmX,GAErD,MAAM,IAAItrB,MAAM,oCAElB,EAGA,MAAO,SAAU/J,GACf,OAAOwoD,EAAMxoD,EACf,IASF,SAASwoD,EAAOtqC,GACd,IAAIkM,EAeJ,GAbAyP,GAAY3b,GAAO,SAAUhjB,GAC3B,IACEkvB,OAAiBpzB,IAATozB,EAAsBlvB,EAAQu2C,EAAernB,EAAMlvB,EAC7D,CAAE,MAAOoF,GACP,MAAM8nD,GAAoB9nD,EAAK,OAAQpF,EACzC,CACF,IAGoB,iBAATkvB,IACTA,EAAOwe,EAAQxe,EAAMlR,GAAekR,EAAMhR,UAG/BpiB,IAATozB,EACF,MAAM,IAAIrgB,MAAM,2CAGlB,OAAOqgB,CACT,KC3EInxB,GAAO,SAGAwvD,GAA+Bp1D,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAuHhF,OAAO4C,EAAMV,GAAM,CACjBwlC,IAAKiqB,GACL,8CAA+CA,IAC/C,ICtGSC,GAAYt1D,GAxBZ,MACQ,CAAC,QAAS,WAuBsB0D,IAAuB,IAAtB,MAAE4C,EAAK,OAAE6gB,GAAQzjB,EACrE,OAAO4C,EAzBI,MAyBQ,CACjB,qBAAsB,SAAU5B,GAC9B,OAAOyiB,EAAOziB,EAAG,CAAE0iB,SAAU,OAC/B,EACA,yCAA0C,SAAU1iB,EAAG4iB,GACrD,OAAOH,EAAOziB,EAAG,CAAE0iB,SAAU,MAAOE,YACtC,GACA,ICPSiuC,GAAYv1D,GAzBZ,MACQ,CAAC,QAAS,WAwBsB0D,IAAuB,IAAtB,MAAE4C,EAAK,OAAE6gB,GAAQzjB,EACrE,OAAO4C,EA1BI,MA0BQ,CACjB,qBAAsB,SAAU5B,GAC9B,OAAOyiB,EAAOziB,EAAG,CAAE0iB,SAAU,OAC/B,EACA,yCAA0C,SAAU1iB,EAAG4iB,GACrD,OAAOH,EAAOziB,EAAG,CAAE0iB,SAAU,MAAOE,YACtC,GACA,ICVSkuC,GAAYx1D,GAvBZ,MACQ,CAAC,QAAS,WAsBsB0D,IAAuB,IAAtB,MAAE4C,EAAK,OAAE6gB,GAAQzjB,EACrE,OAAO4C,EAxBI,MAwBQ,CACjB,qBAAsB,SAAU5B,GAC9B,OAAOyiB,EAAOziB,EAAG,CAAE0iB,SAAU,OAC/B,EACA,yCAA0C,SAAU1iB,EAAG4iB,GACrD,OAAOH,EAAOziB,EAAG,CAAE0iB,SAAU,MAAOE,YACtC,GACA,ICjCSmuC,GAAgB,cCKvB7vD,GAAO,QAGA8vD,GAA8B11D,GAAQ4F,GAF9B,CAAC,UAEiDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA6C/E,OAAO4C,EAAMV,GAAM,CAEjB,yBAA0B+vD,GAC1B,0CAA2CA,IAC3C,IAWJ,SAASA,GAAQC,EAAUz1C,EAAQ9X,GACjC,OAAOutD,EAASr4C,QAAQk4C,IAAe,SAAUI,EAAU7yD,GACzD,MAAMoB,EAAOpB,EAAIqH,MAAM,KACvB,IAAIxC,EAAQsY,EAAO/b,EAAK8kB,SAIxB,SAHcvlB,IAAVkE,GAAuBA,EAAM2Z,WAC/B3Z,EAAQA,EAAMg4B,WAETz7B,EAAKhD,aAAoBuC,IAAVkE,GAAqB,CACzC,MAAM1G,EAAIiD,EAAK8kB,QACfrhB,EAAQ1G,EAAI0G,EAAM1G,GAAK0G,EAAQ,GACjC,CAEA,YAAclE,IAAVkE,EACG0Z,EAAS1Z,GAGLA,EAFAsf,GAAOtf,EAAOQ,GAMlBwtD,CACT,GAEF,CCxFA,MAOaC,GAA2B91D,GAP3B,KACQ,CACnB,QACA,SACA,WAGkE0D,IAA+B,IAA9B,MAAE4C,EAAK,OAAEykB,EAAM,OAAEtjB,GAAQ/D,EA2B5F,OAAO4C,EAlCI,KAoCT,CAAE,sBAAuByvD,CAACl1D,EAAGuxC,IAASvxC,EAAEsW,GAAGi7B,IA5BhBsI,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,UA6BvEo0C,CAAqB,CAAEP,IAAI,IAC5B,ICvCG11C,GAAO,SAGAowD,GAA+Bh2D,GAAQ4F,GAF/B,CAAC,UAEkDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAiChF,OAAO4C,EAAMV,GAAM,CACjB0nC,KAAMzsC,GAAKA,EAAEo1D,SACb,eAAgBC,CAACr1D,EAAGs1D,IAAat1D,EAAEo1D,OAAOE,EAAS9rD,MAAM,MACzD,uBAAwB+rD,CAACv1D,EAAGs1D,EAAU9tD,IAAYxH,EAAEo1D,OAAOE,EAAS9rD,MAAM,KAAMhC,GAChF,cAAeguD,CAACx1D,EAAGs1D,IAAat1D,EAAEo1D,OAAOE,GACzC,sBAAuBG,CAACz1D,EAAGs1D,EAAU9tD,IAAYxH,EAAEo1D,OAAOE,EAAU9tD,IACpE,ICzCEzC,GAAO,UAGA2wD,GAAgCv2D,GAAQ4F,GAFhC,CAAC,UAEmDlC,IAAe,IAAd,MAAE4C,GAAO5C,EA6BjF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,GAAIA,GAAK,EACP,OAAOA,EAAI,EAEb,GAAIA,EAAI,GAAM,GAAKA,EAAI,GAAM,EAC3B,OAAO,EAET,IAAK,IAAIsB,EAAI,EAAGA,EAAIA,GAAKtB,EAAGsB,GAAK,EAC/B,GAAItB,EAAIsB,GAAM,GAAKtB,GAAKsB,EAAI,IAAO,EACjC,OAAO,EAGX,OAAO,CACT,EAEA6qC,OAAQ,SAAUnsC,GAChB,GAAIA,GAAK,GACP,OAAOA,EAAI,GAEb,GAAIA,EAAI,KAAO,IAAMA,EAAI,KAAO,GAC9B,OAAO,EAET,IAAK,IAAIsB,EAAI,GAAIA,EAAIA,GAAKtB,EAAGsB,GAAK,GAChC,GAAItB,EAAIsB,IAAM,IAAMtB,GAAKsB,EAAI,MAAQ,GACnC,OAAO,EAGX,OAAO,CACT,EAEAioB,UAAW,SAAU1lB,GACnB,GAAIA,EAAE0tB,IAAI,GAAI,OAAO1tB,EAAEmqB,GAAG,GAC1B,GAAInqB,EAAEwvB,IAAI,GAAGzD,GAAG,IAAM/rB,EAAEwvB,IAAI,GAAGzD,GAAG,GAAI,OAAO,EAC7C,GAAI/rB,EAAE2uB,GAAG1lB,KAAK4M,IAAI,EAAG,KAAM,CACzB,MAAM1Z,EAAI6D,EAAEokB,WACZ,IAAK,IAAI3mB,EAAI,EAAGA,EAAIA,GAAKtB,EAAGsB,GAAK,EAC/B,GAAItB,EAAIsB,GAAM,GAAKtB,GAAKsB,EAAI,IAAO,EACjC,OAAO,EAGX,OAAO,CACT,CAEA,SAASq0D,EAAQxvC,EAAMa,EAAU4uC,GAE/B,IAAIC,EAAc,EAClB,MAAQ7uC,EAAS4I,GAAG,IACd5I,EAASqM,IAAI,GAAGzD,GAAG,IACrB5I,EAAWA,EAASgJ,IAAI,GACxB7J,EAAOA,EAAK8N,IAAI9N,GAAMkN,IAAIuiC,KAE1B5uC,EAAWA,EAASiM,IAAI,GACxB4iC,EAAc1vC,EAAK8N,IAAI4hC,GAAaxiC,IAAIuiC,IAG5C,OAAOC,CACT,CAGA,MAAM59B,EAAUp0B,EAAEgB,YAAYoe,MAAM,CAAEuD,UAAiC,EAAtB3iB,EAAE8iB,QAAQ,GAAGpmB,SAE9D,IAAIgb,EAAI,EACJlb,GAFJwD,EAAI,IAAIo0B,EAAQp0B,IAENovB,IAAI,GACd,KAAO5yB,EAAEgzB,IAAI,GAAGzD,GAAG,IACjBvvB,EAAIA,EAAE2vB,IAAI,GACVzU,GAAK,EAEP,IAAIu6C,EAAQ,KAEZ,GAAIjyD,EAAE2uB,GAAG,6BACPsjC,EAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAI5uD,QAAOlH,GAAKA,EAAI6D,QACpE,CACL,MAAMqJ,EAAMJ,KAAKC,IAAIlJ,EAAEokB,WAAa,EAAGnb,KAAKsM,MAAM,EAAItM,KAAK4M,IAAI7V,EAAE8iB,QAAQ,GAAGpmB,OAASuM,KAAK2Y,IAAI,IAAK,KACnGqwC,EAAQ,GACR,IAAK,IAAIx0D,EAAI,EAAGA,GAAK4L,EAAK5L,GAAK,EAC7Bw0D,EAAMt0D,KAAK0L,EAEf,CACA,IAAK,IAAI5L,EAAI,EAAGA,EAAIw0D,EAAMv1D,OAAQe,GAAK,EAAG,CACxC,MAAM6X,EAAI28C,EAAMx0D,GACVy0D,EAAMJ,EAAO9xD,EAAEovB,IAAIpvB,GAAG6G,IAAIyO,GAAI9Y,EAAGwD,GACvC,IAAKkyD,EAAInmC,GAAG,GACV,IAAK,IAAItuB,EAAI,EAAGtB,EAAI+1D,GAAM/1D,EAAE4vB,GAAG/rB,EAAEovB,IAAI,IAAK3xB,GAAK,EAAGtB,EAAIA,EAAEi0B,IAAIj0B,GAAGqzB,IAAIxvB,GACjE,GAAIvC,IAAMia,EAAI,EACZ,OAAO,CAIf,CACA,OAAO,CACT,EAEA,iBAAkB9V,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,IC1HS6kD,GAAgC72D,GAHhC,UACQ,CAAC,SAAU,aAAc,cAE2B0D,IAAqC,IAApC,OAAEsiB,EAAM,UAAE+kC,EAAS,SAAE9pB,GAAUv9B,EACvG,MAAMozD,EAAkB,CACtBhpB,QAAQ,EACR9nB,QAAQ,EACRoE,WAAW,EACXG,UAAU,GAINwsC,EAAmB,CACvB/wC,OAASnlB,GAAMmlB,EAAOnlB,GACtBupB,UAAW2gC,EACNlqD,GAAMkqD,EAAUlqD,GACjB8pD,GACJ3d,OAASnsC,GAAMolB,OAAOplB,GACtB0pB,SAAU0W,EACLpgC,GAAMogC,EAASpgC,GAChB+pD,IAiCN,OAAO,SAAkB/iD,GAAqC,IAA9BmvD,EAAUl0D,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,SAC3C,QAAca,KAD4Cb,UAAA1B,OAAA,EAAA0B,UAAA,QAAAa,GAExD,MAAM,IAAIoI,YAAY,wCAExB,MAAMkrD,EAAYpzC,GAAOhc,GAEzB,KAAMovD,KAAaH,GACjB,MAAM,IAAI/vD,UAAU,kBAAoBc,EAAQ,aAAeovD,EAAY,4BAA8Bt0D,OAAOyB,KAAK0yD,GAAiBruD,KAAK,OAE7I,KAAMuuD,KAAcD,GAClB,MAAM,IAAIhwD,UAAU,kBAAoBc,EAAQ,aAAemvD,EAAa,6BAA+Br0D,OAAOyB,KAAK2yD,GAAkBtuD,KAAK,OAGhJ,OAAIuuD,IAAeC,EACVpvD,EAEAkvD,EAAiBC,GAAYnvD,EAExC,CAAC,ICzEGjC,GAAO,eAGAsxD,GAAqCl3D,GAAQ4F,GAFrC,CAAC,QAAS,YAE+ClC,IAAwB,IAAvB,MAAE4C,EAAK,QAAEivC,GAAS7xC,EAa/F,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOD,EAAIC,CACb,EAEA,mBAAoB,SAAUD,EAAGC,GAC/B,OAAOD,EAAEgwB,IAAI/vB,EACf,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEgwB,IAAI/vB,EACf,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOD,EAAIC,CACb,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAOD,EAAEgwB,IAAI/vB,EACf,EAEA,uDACEq2D,CAACt2D,EAAGC,IAAMD,EAAE2vB,OAAO1vB,GAErB,gDACAs2D,CAACv2D,EAAGC,IAAMA,EAAEu2D,WAAWx2D,IACvB,IC1BSy2D,GAA4Bt3D,GAb5B,MACQ,CACnB,QACA,SACA,WACA,WACA,SACA,MACA,WACA,SACA,YAGmE0D,IAAmF,IAAlF,MAAE4C,EAAK,OAAEyf,EAAM,SAAEwxC,EAAQ,SAAEjf,EAAQ,OAAEvtB,EAAM,IAAE8pB,EAAG,OAAE7uB,EAAM,SAAEib,EAAQ,QAAE5W,GAAS3mB,EAuCjJ,OAAO4C,EApDI,MAoDQ,CACjB,iBAAkBkxD,EAElB,mBAAoB,SAAU32D,EAAGC,GAC/B,OAAOD,EAAE0Z,IAAIzZ,EACf,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAIA,EAAE4kB,aAAe7kB,GAAK,GAAKklB,EAAOu3B,YAC7Bz8C,EAAE0Z,IAAIzZ,GAEN,IAAIupB,EAAQxpB,EAAEioB,WAAY,GAAGvO,IAAIzZ,EAAEgoB,WAAY,EAE1D,EAEA,iBAAkBg7B,CAACjjD,EAAGC,IAAMD,GAAKC,EAEjC,qBAAsB,SAAUD,EAAGC,GACjC,MAAMgB,EAASjB,EAAE0Z,IAAIzZ,GAErB,GAAc,MAAVgB,EACF,OAAOA,EAGT,GAAIikB,EAAOu3B,YACT,MAAM,IAAI5mC,MAAM,uEAEhB,OAAO8gD,EAAK32D,EAAEgf,UAAW/e,EAAE+e,UAE/B,EAEA,gBAAiB43C,EAEjB,mBAAoB,SAAU52D,EAAGC,GAC/B,OAAO22D,EAAU52D,EAAGC,EAAEgoB,WACxB,EAEA,iBAAkB4uC,EAElB,oBAAqB,SAAU72D,EAAGC,GAChC,OAAO42D,EAAW72D,EAAGC,EAAEgoB,WACzB,EAEA,2BAA4B,SAAUjoB,EAAGC,GACvC,OAAOD,EAAE0Z,IAAIzZ,EACf,IAWF,SAAS02D,EAAM32D,EAAGC,GAGhB,GAAIilB,EAAOu3B,cAAgB53B,GAAU5kB,IAAMD,EAAI,EAE7C,IACE,MAAM82D,EAAQ12B,EAASngC,GACjB82D,EAAO5xC,EAAO2xC,GACpB,IAAI72D,IAAM82D,GAAQjqD,KAAKsa,KAAKnnB,EAAI82D,GAAQ92D,GAAK,QACvC62D,EAAMz2D,EAAI,KAAO,GACnB,OAASy2D,EAAMjzD,EAAI,KAAO,GAAM,GAAK,GAAKiJ,KAAK4M,KAAK1Z,EAAGC,EAG7D,CAAE,MAAO8b,GACP,CASJ,OAAImJ,EAAOu3B,cACLz8C,GAAK,GAAKC,IAAM4M,KAChB7M,GAAK,GAAKA,EAAI,GAAKC,KAAM,KACtB8tB,IAGLlJ,GAAU5kB,IAAMD,GAAK,GAAKklB,EAAOu3B,YAC5BnI,GAAUt0C,EAAGC,GAMfD,EAAIA,EAAI,GAAKC,IAAM4M,KACrB7M,EAAIA,EAAI,GAAKC,KAAM,IACb,EAGF,IAAIupB,EAAQxpB,EAAG,GAAG0Z,IAAIzZ,EAAG,EAEpC,CASA,SAAS22D,EAAW52D,EAAGC,GACrB,IAAK4kB,GAAU5kB,GACb,MAAM,IAAIiG,UAAU,2CAA6CjG,EAAI,KAGvE,MAAMwJ,EAAIgW,GAAKzf,GACf,GAAiB,IAAbyJ,EAAElJ,OACJ,MAAM,IAAIsV,MAAM,2CAA6CpM,EAAElJ,OAAS,gBAE1E,GAAIkJ,EAAE,KAAOA,EAAE,GACb,MAAM,IAAIoM,MAAM,sCAAwCpM,EAAE,GAAK,IAAMA,EAAE,GAAK,KAE9E,GAAIxJ,EAAI,EACN,IACE,OAAO22D,EAAU5iB,EAAIh0C,IAAKC,EAC5B,CAAE,MAAOotD,GACP,GAAsB,kDAAlBA,EAAMtnD,QACR,MAAM,IAAIG,UAAU,6EAA+EjG,EAAI,KAEzG,MAAMotD,CACR,CAGF,IAAI5yB,EAAMi8B,EAASjtD,EAAE,IAAIuV,UACrBiT,EAAKjyB,EACT,KAAOC,GAAK,GACM,GAAXA,IACHw6B,EAAMgd,EAASxlB,EAAIwI,IAErBx6B,IAAM,EACNgyB,EAAKwlB,EAASxlB,EAAIA,GAEpB,OAAOwI,CACT,CASA,SAASo8B,EAAY72D,EAAGC,GACtB,OAAOiqB,EAAO0sC,EAAU52D,EAAEgf,UAAW/e,GACvC,KCxMI+2D,GAAS,0DAETjyD,GAAO,QAWAkyD,GAA8B93D,GAAQ4F,GAV9B,CACnB,QACA,SACA,SACA,cACA,QACA,YACA,gBAGqElC,IAA2E,IAA1E,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,UAAE0B,EAAS,YAAEE,GAAa5mB,EAC3I,MAAMi0C,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CutB,EAAeb,GAAmB,CAAE1wC,UAE1C,SAASyxD,EAAY97B,GACnB,OAAOtuB,KAAKsa,IAAIL,GAAYqU,GAASpU,SACvC,CA8CA,OAAOvhB,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAEhB,MAAMm3D,EAAW5iB,GAAYv0C,EAAGk3D,EAAWhyC,EAAOuD,SAElD,OAAO8rB,GADW/rB,GAAYxoB,EAAGm3D,EAAUjyC,EAAOuD,OAAQvD,EAAOwD,QAAUyuC,EAAWn3D,EAExF,EAEA,iBAAkB,SAAUA,EAAG6D,GAE7B,MAAMuzD,EAAkBF,EAAWhyC,EAAOuD,QAC1C,GAAI5kB,GAAKuzD,EAAmB,OAAO7iB,GAAYv0C,EAAG6D,GAElD,MAAMszD,EAAW5iB,GAAYv0C,EAAGo3D,GAEhC,OAAO7iB,GADW/rB,GAAYxoB,EAAGm3D,EAAUjyC,EAAOuD,OAAQvD,EAAOwD,QAAUyuC,EAAWn3D,EACxD6D,EAChC,EAEA,oBAAqB,SAAU7D,EAAG6D,GAChC,IAAKA,EAAEghB,YAAe,MAAM,IAAI3e,UAAU8wD,IAE1C,OAAO,IAAIztC,EAAUvpB,GAAGq0B,gBAAgBxwB,EAAEokB,WAC5C,EAEAuB,QAAS,SAAUxpB,GACjB,OAAOA,EAAE+kB,OACX,EAEA,kBAAmB,SAAU/kB,EAAG6D,GAC9B,GAAIA,EAAI,EAAK,MAAM,IAAIqC,UAAU8wD,IAEjC,OAAOh3D,EAAE+kB,MAAMlhB,EACjB,EAEA,qBAAsB,SAAU7D,EAAG6D,GACjC,IAAKA,EAAEghB,YAAe,MAAM,IAAI3e,UAAU8wD,IAE1C,MAAMK,EAAKxzD,EAAEokB,WACb,OAAOjoB,EAAE+kB,MAAMsyC,EACjB,EAEA9tC,UAAW,SAAUvpB,GAEnB,MAAMm3D,EAAW,IAAI5tC,EAAUvpB,GAAGq0B,gBAAgB6iC,EAAWhyC,EAAOuD,SAEpE,OADkB+jB,GAAexsC,EAAGm3D,EAAUjyC,EAAOuD,OAAQvD,EAAOwD,QAAUyuC,EAAWn3D,GACxEq0B,gBAAgB,EACnC,EAEA,uBAAwB,SAAUr0B,EAAG6D,GACnC,IAAKA,EAAEghB,YAAe,MAAM,IAAI3e,UAAU8wD,IAG1C,MAAMI,EAAkBF,EAAWhyC,EAAOuD,QAC1C,GAAI5kB,GAAKuzD,EAAmB,OAAOp3D,EAAEq0B,gBAAgBxwB,EAAEokB,YAEvD,MAAMkvC,EAAWn3D,EAAEq0B,gBAAgB+iC,GAEnC,OADkB5qB,GAAexsC,EAAGm3D,EAAUjyC,EAAOuD,OAAQvD,EAAOwD,QAAUyuC,EAAWn3D,GACxEq0B,gBAAgBxwB,EAAEokB,WACrC,EAGAkkB,OAAQjzB,GAAKA,EACb,iBAAkBk+B,CAACl+B,EAAGm+B,IAAWn+B,EACjC,oBAAqBo+B,CAACp+B,EAAGm+B,IAAWn+B,EAEpCwQ,SAAU,SAAU1pB,GAClB,OAAOA,EAAE+kB,OACX,EAEA,mBAAoB,SAAU/kB,EAAG6D,GAC/B,GAAIA,EAAI,EAAK,MAAM,IAAIqC,UAAU8wD,IACjC,OAAOh3D,EAAE+kB,MAAMlhB,EACjB,EAEA,sBAAuB,SAAU7D,EAAG6D,GAClC,IAAKA,EAAEghB,YAAe,MAAM,IAAI3e,UAAU8wD,IAC1C,OAAOh3D,EAAE+kB,MAAMlhB,EAAEokB,WACnB,EAEA,qBAAsBxiB,EAAM6L,aAAYH,GAAQ,SAAUnR,EAAG6D,EAAG0tC,GAC9D,MAAMgG,EAAYv3C,EAAEw3C,UAAUjG,GAC9B,OAAOA,EAAKkG,SAAStmC,EAAKomC,EAAW1zC,GACvC,IAEA,wBAAyB4B,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAASpgC,EAAKnR,EAAG6D,EAAEokB,WAAYspB,KAEzF,2CAA4C9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,EAAG0tC,IAEpEhM,GAAQvlC,GAAIgH,GAAUmK,EAAKnK,EAAOnD,EAAG0tC,KAAO,KAGrD,8BAA+B9rC,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGuxC,IAASpgC,EAAKnR,EAAG,EAAGuxC,KAEjF,iBAAkB9rC,EAAM6L,aAAYH,GAAQnR,GAEnCulC,GAAQvlC,EAAGmR,GAAM,KAG1B,mCAAoC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IACzDizC,EAAc92C,EAAG6D,EAAGsN,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IACxDmzC,EAAah3C,EAAG6D,EAAGsN,GAAM,KAGlC,4BAA6B1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAElDmzC,EAAa9sB,EAAOlqB,GAAI6D,EAAGsN,GAAM,GAAO6N,YAGjD,wDAAyDvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAEjFupC,EAAYptC,EAAG,GAEV6nB,EAAMhkB,EAAE4b,OAAQ5b,EAAEs7B,WAEpB4X,EAAclzC,EAAG7D,EAAGmR,GAAM,KAGnC,uDAAwD1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAEhFupC,EAAYptC,EAAG,GAEV6nB,EAAMhkB,EAAE4b,OAAQ5b,EAAEs7B,WAEpB6X,EAAanzC,EAAG7D,EAAGmR,GAAM,KAGlC,iDAAkD1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAG6D,IAEvEmzC,EAAa9sB,EAAOrmB,GAAI7D,EAAGmR,GAAM,GAAM6N,aAEhD,IC3MEgF,GAAe,CAAC,SAAU,QAAS,SAAU,eAAgB,WAC7DszC,GAAQxqD,KAAK2Y,IAAI,IAEV8xC,GAA4Bp4D,GAJ5B,MAI0C6kB,IAAcnhB,IAAsD,IAArD,MAAE4C,EAAK,OAAEud,EAAM,OAAEkC,EAAM,aAAEupC,EAAY,QAAEjlC,GAAS3mB,EAoCpH,SAAS+5C,EAAY14C,GACnB,OAAOA,EAAEuhB,KACX,CAEA,SAASo3B,EAAkB78C,GACzB,OAAO48C,EAAW,IAAIpzB,EAAQxpB,EAAG,GACnC,CAEA,OAAOyF,EAhDI,MAgDQ,CACjB0f,OAAQ,SAAUnlB,GAChB,OAAIA,GAAK,GAAKklB,EAAOu3B,YACZ7I,GAAU5zC,GAGV68C,EAAiB78C,EAE5B,EAEAmsC,OAAQkQ,GAAiBib,GAAO1jB,GAAW1uB,EAAQ23B,GAEnDrzB,QAASozB,EAETrzB,UAAW,SAAUvpB,GACnB,OAAKA,EAAEoyB,cAAgBlN,EAAOu3B,YACrBz8C,EAAEwxB,KAGFqrB,EAAiB78C,EAAEioB,WAE9B,EAEA,WAAYxiB,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGmmB,KAGxC,GAAkB,aAAdnD,EAAOhjB,IAAsC,aAAjBgjB,EAAOmD,GAAsB,CAC3D,MAAMllB,EAASjB,EAAEylB,IAAIU,GAErB,GAAe,OAAXllB,EACF,OAAOA,CAEX,CAEA,OAAOwtD,EAAat9C,EAAKnR,GAAImR,EAAKgV,GAAM,KAE1C,ICpFEphB,GAAO,QAGAyyD,GAA8Br4D,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,eAAgB,MAAO,YAEOlC,IAAmD,IAAlD,MAAE4C,EAAK,OAAEyf,EAAM,aAAEupC,EAAY,IAAEhpC,EAAG,QAAE+D,GAAS3mB,EAgCnH,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,IAAM,GAAKklB,EAAOu3B,YACbgb,GAAOz3D,GAGP03D,EAAc,IAAIluC,EAAQxpB,EAAG,GAExC,EAEAwpB,QAASkuC,EAETnuC,UAAW,SAAUvpB,GACnB,MAAMC,EAAID,EAAEmvB,KAAK,GACjB,OAAKlvB,EAAEmyB,cAAgBlN,EAAOu3B,YACrBx8C,EAAEuxB,KAGFkmC,EAAc,IAAIluC,EAAQxpB,EAAEioB,WAAY,GAEnD,EAEA,iBAAkBxiB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,KAE5D,WAAY1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGmmB,IAEjCsoC,EAAat9C,EAAKnR,GAAIylB,EAAIU,QAUrC,SAASuxC,EAAe13D,GACtB,MAAM23D,EAAQ33D,EAAEoc,GAAK,EACrB,OAAO,IAAIoN,EACT1c,KAAK2Y,IAAI3Y,KAAK8b,KAAK+uC,EAAQA,EAAQ33D,EAAEo6B,GAAKp6B,EAAEo6B,KAC5CttB,KAAKurB,MAAMr4B,EAAEo6B,GAAIu9B,GAErB,KC/EI5yD,GAAO,WAGA6yD,GAAiCz4D,GAAQ4F,GAFjC,CAAC,SAAU,QAAS,eAAgB,YAEiBlC,IAA8C,IAA7C,MAAE4C,EAAK,OAAEyf,EAAM,aAAEupC,EAAY,QAAEjlC,GAAS3mB,EAOjH,MAAMg1D,EAAwB,CAC5B,SAAkB3sB,GAAO,OAAO,IAAI1hB,EAAQ0hB,EAAK,EAAG,EACpD,SAAkBA,GAAO,OAAO,IAAI1hB,EAAQ,EAAG0hB,EAAK,EACpD,SAAkBA,GAAO,OAAO,IAAI1hB,GAAS0hB,EAAK,EAAG,EACrD,SAAkBA,GAAO,OAAO,IAAI1hB,EAAQ,GAAI0hB,EAAK,GASvD,SAAS4sB,EAAkB3+C,EAAGja,GAC5B,GAAIA,EAAO,EAAG,MAAM,IAAI2W,MAAM,kCAC9B,GAAa,IAAT3W,EAAY,MAAM,IAAI2W,MAAM,yBAChC,GAAI3W,EAAO,GAAM,EAAG,MAAM,IAAI2W,MAAM,2BACpC,GAAU,IAANsD,GAAuB,IAAZA,EAAEiO,MAAa,MAAO,CAAC,IAAIoC,EAAQ,EAAG,IACrD,MAAMuuC,EAA4B,iBAAP5+C,EAC3B,IAAIhK,GAEA4oD,GAAuB,IAAT5+C,EAAEiD,IAAqB,IAATjD,EAAEihB,MAE9BjrB,EADE4oD,EACO,IAAO5+C,EAAI,GACF,IAATA,EAAEihB,GACF,IAAOjhB,EAAEiD,GAAK,GAEd,IAAOjD,EAAEihB,GAAK,GAAM,GAGjC,MAAM5qB,EAAM2J,EAAE3J,MACR4X,EAAMjO,EAAEiO,MACR4wC,EAAQ,GACRz8C,EAAIzO,KAAK4M,IAAI0N,EAAK,EAAIloB,GAC5B,IAAK,IAAIoB,EAAI,EAAGA,EAAIpB,EAAMoB,IAAK,CAC7B,MAAM23D,GAAgB9oD,EAAS,EAAI7O,GAAKpB,EAKpC+4D,IAAiBnrD,KAAKiY,MAAMkzC,GAIhCD,EAAMx2D,KAAK,IAAIgoB,EAAQ,CAAEjO,IAAG0f,KAAMzrB,EAAM,EAAI1C,KAAKme,GAAK3qB,GAAKpB,KAHzD84D,EAAMx2D,KAAKq2D,EAAsBI,EAAe,GAAG18C,GAIvD,CACA,OAAOy8C,CACT,CAmCA,OAAOvyD,EAAMV,GAAM,CACjBykB,QAAS,SAAUxpB,GACjB,OAAO83D,EAAiB93D,EAAG,EAC7B,EACA,kBAAmB83D,GACnB,IC5FE/yD,GAAO,SAWAmzD,GAA+B/4D,GAAQ4F,GAV/B,CACnB,QACA,cACA,SACA,MACA,cACA,SACA,iBAGsElC,IAA4E,IAA3E,MAAE4C,EAAK,YAAE2nC,EAAW,OAAEljB,EAAM,IAAExQ,EAAG,YAAE+P,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EAC7I,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CgJ,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAEnEuxD,EAAsB,CAAC,EAC7B,IAAK,MAAM5wD,KAAamS,EAAI3R,WACtBjG,OAAOM,UAAUC,eAAeC,KAAKoX,EAAI3R,WAAYR,KAClDA,EAAU8a,SAAS,WAAc9a,EAAU8a,SAAS,WACvD81C,EAAoB5wD,GAAamS,EAAI3R,WAAWR,KAItD,MAAM6wD,EAAY3yD,EAAM0yD,GAyBxB,OAAO1yD,EAAMV,GAAMi2C,EAAqB,CACtCjB,KAAMqe,EACN7d,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI5D,EACJ6D,GAAI5D,IACH,ICxDChyC,GAAO,YAWAszD,GAAkCl5D,GAAQ4F,GAVlC,CACnB,QACA,SACA,cACA,eACA,cACA,SACA,iBAGyElC,IAAqF,IAApF,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,aAAEqhB,EAAY,YAAEhlC,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACzJ,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C0N,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CgJ,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA4BzE,OAAOnB,EAAMV,GAAMi2C,EAAqB,CACtCjB,KAAM0U,EACNlU,GAAIiJ,EACJvJ,GAAIa,EACJd,GAAIa,EACJH,GAAI5D,EACJ6D,GAAI5D,IACH,ICxDE,SAASuhB,GAAqBz1D,GAAmB,IAAjB,YAAE4mB,GAAa5mB,EAUpD,OAAO,SAA0B0sB,EAAGrW,EAAGzY,GACrC,MAAM83D,EAAQhpC,EAAE9P,OAEhB,GAAqB,IAAjB84C,EAAMh4D,OACR,MAAM,IAAIknC,WAAW,yCAA2CnhB,GAAOiyC,GAAS,KAGlF,MAAM5uB,EAAO4uB,EAAM,GAGnB,GAAI5uB,IAFY4uB,EAAM,GAGpB,MAAM,IAAI9wB,WAAW,gCAAkCnhB,GAAOiyC,GAAS,KAGzE,IAAIx0D,EAAO,GAEX,GAAI4c,EAASzH,GAAI,CACf,MAAMs/C,EAAQt/C,EAAEuG,OACVg6B,EAAQvgC,EAAE8oB,MAGhB,GAAqB,IAAjBw2B,EAAMj4D,OAAc,CACtB,GAAIi4D,EAAM,KAAO7uB,EACf,MAAM,IAAIlC,WAAW,gEAGvB,IAAK,IAAInmC,EAAI,EAAGA,EAAIqoC,EAAMroC,IACxByC,EAAKzC,GAAK,CAACm4C,EAAMn4C,IAGnB,OAAO,IAAImoB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAM,GACbvK,SAAUlmB,EAAE2uB,WAEhB,CAGA,GAAqB,IAAjB2wB,EAAMj4D,OAAc,CACtB,GAAIi4D,EAAM,KAAO7uB,GAAqB,IAAb6uB,EAAM,GAC7B,MAAM,IAAI/wB,WAAW,gEAGvB,GAAI5mB,EAAc3H,GAAI,CACpB,GAAIzY,EAAM,CACRsD,EAAO,GAEP,IAAK,IAAIzC,EAAI,EAAGA,EAAIqoC,EAAMroC,IACxByC,EAAKzC,GAAK,CAACm4C,EAAMn4C,GAAG,IAGtB,OAAO,IAAImoB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAM,GACbvK,SAAUlmB,EAAE2uB,WAEhB,CAEA,OAAO3uB,CACT,CAEA,GAAI4H,EAAe5H,GAAI,CACrB,IAAK,IAAI5X,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAOyC,EAAKzC,GAAK,CAAC,GAE5C,MAAMge,EAASpG,EAAEwyB,QACX/nC,EAAQuV,EAAE0yB,OACVqC,EAAM/0B,EAAE4yB,KAEd,IAAK,IAAIE,EAAKiC,EAAI,GAAI3tC,EAAI2tC,EAAI,GAAI3tC,EAAI0rC,EAAI1rC,IAExCyD,EADUJ,EAAMrD,IACR,GAAKgf,EAAOhf,GAGtB,OAAO,IAAImpB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAM,GACbvK,SAAUlmB,EAAE2uB,WAEhB,CACF,CAEA,MAAM,IAAIJ,WAAW,kFACvB,CAEA,GAAIviC,EAAQgU,GAAI,CACd,MAAM0/B,EAAQ3X,GAAU/nB,GAExB,GAAqB,IAAjB0/B,EAAMr4C,OAAc,CACtB,GAAIq4C,EAAM,KAAOjP,EACf,MAAM,IAAIlC,WAAW,gEAGvB,IAAK,IAAInmC,EAAI,EAAGA,EAAIqoC,EAAMroC,IACxByC,EAAKzC,GAAK,CAAC4X,EAAE5X,IAGf,OAAO,IAAImoB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAM,IAEjB,CAEA,GAAqB,IAAjBiP,EAAMr4C,OAAc,CACtB,GAAIq4C,EAAM,KAAOjP,GAAqB,IAAbiP,EAAM,GAC7B,MAAM,IAAInR,WAAW,gEAGvB,IAAK,IAAInmC,EAAI,EAAGA,EAAIqoC,EAAMroC,IACxByC,EAAKzC,GAAK,CAAC4X,EAAE5X,GAAG,IAGlB,OAAO,IAAImoB,EAAY,CACrB1lB,OACA0b,KAAM,CAACkqB,EAAM,IAEjB,CAEA,MAAM,IAAIlC,WAAW,kFACvB,CACF,CACF,CCnIA,MAAM1iC,GAAO,SAWA0zD,GAA+Bt5D,GAAQ4F,GAV/B,CACnB,QACA,SACA,eACA,iBACA,iBACA,cACA,gBAGsElC,IAA+F,IAA9F,MAAE4C,EAAK,OAAEykB,EAAM,aAAEukC,EAAY,eAAElR,EAAc,eAAEgD,EAAc,YAAEnT,EAAW,YAAE3jB,GAAa5mB,EAChK,MAAM61D,EAAkBJ,GAAsB,CAAE7uC,gBA0BhD,OAAOhkB,EAAMV,GAAM,CAEjB,+BAAgC,SAAUwqB,EAAGrW,GAC3C,OA6DJ,SAAqCqW,EAAGrW,GAItC,MAAMugC,GAFNvgC,EAAIw/C,EAAgBnpC,EAAGrW,GAAG,IAEV8oB,MAEV2H,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAElBniB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAGR9rC,EAAI,GAGV,IAAK,IAAIuB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAChC,MAAMo3D,EAAKlf,EAAMl4C,GAAG,IAAM,EAE1B,GAAK6rC,EAAYurB,EAAI,GAyCnB34D,EAAEuB,GAAK,CAAC,OAzCe,CAGvB,IAAIq3D,EAAM,EAEV,MAAMC,EAAU,GACVC,EAAW,GAGX5yB,EAAa+H,EAAI1sC,GACjBw3D,EAAY9qB,EAAI1sC,EAAI,GAG1B,IAAK,IAAIjB,EAAI4lC,EAAY5lC,EAAIy4D,EAAWz4D,IAAK,CAC3C,MAAMgB,EAAIqC,EAAMrD,GAGZgB,IAAMC,EACRq3D,EAAMt5C,EAAOhf,GACJgB,EAAIC,IAEbs3D,EAAQr3D,KAAK8d,EAAOhf,IACpBw4D,EAASt3D,KAAKF,GAElB,CAGA,GAAI8rC,EAAYwrB,EAAK,GACnB,MAAM,IAAI/iD,MAAM,2DAGlB,MAAMmjD,EAAKvK,EAAakK,EAAIC,GAE5B,IAAK,IAAIt4D,EAAI,EAAG4lD,EAAI4S,EAASv4D,OAAQD,EAAI4lD,EAAG5lD,IAAK,CAC/C,MAAMgB,EAAIw3D,EAASx4D,GACnBm5C,EAAMn4C,GAAK,CAACi/C,EAAe9G,EAAMn4C,GAAG,IAAM,EAAGi8C,EAAeyb,EAAIH,EAAQv4D,KAC1E,CAEAN,EAAEuB,GAAK,CAACy3D,EACV,CAIF,CAEA,OAAO,IAAIvvC,EAAY,CACrB1lB,KAAM/D,EACNyf,KAAM,CAACkqB,EAAM,IAEjB,CAlIWsvB,CAA2B1pC,EAAGrW,EACvC,EAEA,8BAA+B,SAAUqW,EAAGrW,GAC1C,OAAOggD,EAA0B3pC,EAAGrW,EACtC,EAEA,wBAAyB,SAAUC,EAAGD,GAGpC,OADUggD,EADAhvC,EAAO/Q,GACsBD,GAC9B8F,SACX,IAGF,SAASk6C,EAA2B3pC,EAAGrW,GAGrC,MAAMugC,GADNvgC,EAAIw/C,EAAgBnpC,EAAGrW,GAAG,IACV8oB,MAEV2H,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAGlBzhC,EAAI,GAEJm5D,EAAQ5pC,EAAEyS,MAGhB,IAAK,IAAIzgC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAChC,MAAMo3D,EAAKlf,EAAMl4C,GAAG,IAAM,EAC1B,IAAIy3D,EAEJ,GAAK5rB,EAAYurB,EAAI,GAiBnBK,EAAK,MAjBkB,CAGvB,MAAMJ,EAAMO,EAAM53D,GAAGA,GAErB,GAAI6rC,EAAYwrB,EAAK,GACnB,MAAM,IAAI/iD,MAAM,2DAGlBmjD,EAAKvK,EAAakK,EAAIC,GAGtB,IAAK,IAAIt3D,EAAIC,EAAI,EAAGD,EAAIqoC,EAAMroC,IAC5Bm4C,EAAMn4C,GAAK,CAACi/C,EAAe9G,EAAMn4C,GAAG,IAAM,EAAGi8C,EAAeyb,EAAIG,EAAM73D,GAAGC,KAE7E,CAKAvB,EAAEuB,GAAK,CAACy3D,EACV,CAEA,OAAO,IAAIvvC,EAAY,CACrB1lB,KAAM/D,EACNyf,KAAM,CAACkqB,EAAM,IAEjB,CAuEA,IC3KI5kC,GAAO,SAWAq0D,GAA+Bj6D,GAAQ4F,GAV/B,CACnB,QACA,SACA,eACA,iBACA,iBACA,cACA,gBAGsElC,IAA+F,IAA9F,MAAE4C,EAAK,OAAEykB,EAAM,aAAEukC,EAAY,eAAElR,EAAc,eAAEgD,EAAc,YAAEnT,EAAW,YAAE3jB,GAAa5mB,EAChK,MAAM61D,EAAkBJ,GAAsB,CAAE7uC,gBA0BhD,OAAOhkB,EAAMV,GAAM,CAEjB,+BAAgC,SAAUwqB,EAAGrW,GAC3C,OAgEJ,SAAsCqW,EAAGrW,GAIvC,MAAMugC,GAFNvgC,EAAIw/C,EAAgBnpC,EAAGrW,GAAG,IAEV8oB,MAEV2H,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAElBniB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAGR9rC,EAAI,GAGV,IAAK,IAAIuB,EAAIsoC,EAAU,EAAGtoC,GAAK,EAAGA,IAAK,CACrC,MAAMo3D,EAAKlf,EAAMl4C,GAAG,IAAM,EAE1B,GAAK6rC,EAAYurB,EAAI,GA0CnB34D,EAAEuB,GAAK,CAAC,OA1Ce,CAGvB,IAAIq3D,EAAM,EAGV,MAAMC,EAAU,GACVC,EAAW,GAGX5yB,EAAa+H,EAAI1sC,GAIvB,IAAK,IAAIjB,EAHS2tC,EAAI1sC,EAAI,GAGD,EAAGjB,GAAK4lC,EAAY5lC,IAAK,CAChD,MAAMgB,EAAIqC,EAAMrD,GAGZgB,IAAMC,EACRq3D,EAAMt5C,EAAOhf,GACJgB,EAAIC,IAEbs3D,EAAQr3D,KAAK8d,EAAOhf,IACpBw4D,EAASt3D,KAAKF,GAElB,CAGA,GAAI8rC,EAAYwrB,EAAK,GACnB,MAAM,IAAI/iD,MAAM,2DAGlB,MAAMmjD,EAAKvK,EAAakK,EAAIC,GAE5B,IAAK,IAAIt4D,EAAI,EAAGy4D,EAAYD,EAASv4D,OAAQD,EAAIy4D,EAAWz4D,IAAK,CAC/D,MAAMgB,EAAIw3D,EAASx4D,GACnBm5C,EAAMn4C,GAAK,CAACi/C,EAAe9G,EAAMn4C,GAAG,GAAIi8C,EAAeyb,EAAIH,EAAQv4D,KACrE,CAEAN,EAAEuB,GAAK,CAACy3D,EACV,CAIF,CAEA,OAAO,IAAIvvC,EAAY,CACrB1lB,KAAM/D,EACNyf,KAAM,CAACkqB,EAAM,IAEjB,CAtIW0vB,CAA4B9pC,EAAGrW,EACxC,EAEA,8BAA+B,SAAUqW,EAAGrW,GAC1C,OAAOogD,EAA2B/pC,EAAGrW,EACvC,EAEA,wBAAyB,SAAUC,EAAGD,GAGpC,OADUogD,EADApvC,EAAO/Q,GACuBD,GAC/B8F,SACX,IAGF,SAASs6C,EAA4B/pC,EAAGrW,GAItC,MAAMugC,GAFNvgC,EAAIw/C,EAAgBnpC,EAAGrW,GAAG,IAEV8oB,MAEV2H,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAGlBzhC,EAAI,GAEJm5D,EAAQ5pC,EAAEyS,MAEhB,IAAK,IAAIzgC,EAAIsoC,EAAU,EAAGtoC,GAAK,EAAGA,IAAK,CAErC,MAAMo3D,EAAKlf,EAAMl4C,GAAG,IAAM,EAE1B,IAAIy3D,EAEJ,GAAK5rB,EAAYurB,EAAI,GAkBnBK,EAAK,MAlBkB,CAEvB,MAAMJ,EAAMO,EAAM53D,GAAGA,GAErB,GAAI6rC,EAAYwrB,EAAK,GAEnB,MAAM,IAAI/iD,MAAM,2DAGlBmjD,EAAKvK,EAAakK,EAAIC,GAGtB,IAAK,IAAIt3D,EAAIC,EAAI,EAAGD,GAAK,EAAGA,IAE1Bm4C,EAAMn4C,GAAK,CAACi/C,EAAe9G,EAAMn4C,GAAG,IAAM,EAAGi8C,EAAeyb,EAAIG,EAAM73D,GAAGC,KAE7E,CAKAvB,EAAEuB,GAAK,CAACy3D,EACV,CAEA,OAAO,IAAIvvC,EAAY,CACrB1lB,KAAM/D,EACNyf,KAAM,CAACkqB,EAAM,IAEjB,CAwEA,IC/KI5kC,GAAO,YAWAw0D,GAAkCp6D,GAAQ4F,GAVlC,CACnB,QACA,SACA,eACA,iBACA,iBACA,cACA,gBAGyElC,IAA+F,IAA9F,MAAE4C,EAAK,OAAEykB,EAAM,aAAEukC,EAAY,eAAElR,EAAc,eAAEgD,EAAc,YAAEnT,EAAW,YAAE3jB,GAAa5mB,EACnK,MAAM61D,EAAkBJ,GAAsB,CAAE7uC,gBA0BhD,OAAOhkB,EAAMV,GAAM,CAEjB,+BAAgC,SAAUwqB,EAAGrW,GAC3C,OAwEJ,SAAqCqW,EAAGiqC,GAEtC,MAAMl9B,EAAI,CAACo8B,EAAgBnpC,EAAGiqC,GAAI,GAAMx3B,MAAM94B,KAAIsP,GAAKA,EAAE,MAEnDmxB,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAElBniB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAGd,IAAK,IAAIxqC,EAAI,EAAGA,EAAIuoC,EAASvoC,IAAK,CAChC,IAAIm4D,EAAIn9B,EAAE/7B,OAGV,IAAK,IAAID,EAAI,EAAGA,EAAIm5D,EAAGn5D,IAAK,CAC1B,MAAM4Y,EAAIojB,EAAEh8B,GAGNo5D,EAAU,GACVC,EAAW,GAGXzzB,EAAa+H,EAAI3sC,GACjBy3D,EAAY9qB,EAAI3sC,EAAI,GAG1B,IAAIs4D,EAAM,EACV,IAAK,IAAIr4D,EAAI2kC,EAAY3kC,EAAIw3D,EAAWx3D,IAAK,CAC3C,MAAMqpC,EAAIjnC,EAAMpC,GAEZqpC,IAAMtpC,EACRs4D,EAAMt6C,EAAO/d,GACJqpC,EAAItpC,IAEbo4D,EAAQl4D,KAAK8d,EAAO/d,IACpBo4D,EAASn4D,KAAKopC,GAElB,CAEA,GAAKwC,EAAYwsB,EAAK,GASf,GAAKxsB,EAAYl0B,EAAE5X,GAAI,IAYvB,GAAU,IAANhB,EAAS,CAGlB,MAAMu5D,EAAO,IAAI3gD,GACjB2gD,EAAKv4D,GAAK,EAEV,IAAK,IAAIC,EAAI,EAAGw3D,EAAYY,EAASp5D,OAAQgB,EAAIw3D,EAAWx3D,IAAK,CAC/D,MAAMqpC,EAAI+uB,EAASp4D,GACnBs4D,EAAKjvB,GAAK2V,EAAesZ,EAAKjvB,GAAI8uB,EAAQn4D,GAC5C,CAEA+6B,EAAE96B,KAAKq4D,EACT,MAxBkC,CAGhC,GAAU,IAANv5D,EAEF,MAAO,GAGPg8B,EAAEzkB,OAAOvX,EAAG,GACZA,GAAK,EACLm5D,GAAK,CAET,KArB0B,CAGxBvgD,EAAE5X,GAAKmtD,EAAav1C,EAAE5X,GAAIs4D,GAE1B,IAAK,IAAIr4D,EAAI,EAAGw3D,EAAYY,EAASp5D,OAAQgB,EAAIw3D,EAAWx3D,IAAK,CAC/D,MAAMqpC,EAAI+uB,EAASp4D,GACnB2X,EAAE0xB,GAAK2V,EAAernC,EAAE0xB,GAAI2S,EAAerkC,EAAE5X,GAAIo4D,EAAQn4D,IAC3D,CACF,CAyBF,CACF,CAEA,OAAO+6B,EAAEpzB,KAAIlJ,GAAK,IAAIypB,EAAY,CAAE1lB,KAAM/D,EAAEkJ,KAAIsP,GAAK,CAACA,KAAKiH,KAAM,CAACkqB,EAAM,MAC1E,CAvJWsvB,CAA2B1pC,EAAGrW,EACvC,EAEA,8BAA+B,SAAUqW,EAAGrW,GAC1C,OAAOggD,EAA0B3pC,EAAGrW,EACtC,EAEA,wBAAyB,SAAUC,EAAGD,GAGpC,OADUggD,EADAhvC,EAAO/Q,GACsBD,GAC9BhQ,KAAIqS,GAAKA,EAAEyD,WACtB,IAGF,SAASk6C,EAA2B3pC,EAAGiqC,GAKrC,MAAMl9B,EAAI,CAACo8B,EAAgBnpC,EAAGiqC,GAAI,GAAMx3B,MAAM94B,KAAIsP,GAAKA,EAAE,MAEnDkkB,EAAInN,EAAEyS,MACN2H,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAGxB,IAAK,IAAIngC,EAAI,EAAGA,EAAIuoC,EAASvoC,IAAK,CAChC,IAAIm4D,EAAIn9B,EAAE/7B,OAGV,IAAK,IAAID,EAAI,EAAGA,EAAIm5D,EAAGn5D,IAAK,CAC1B,MAAM4Y,EAAIojB,EAAEh8B,GAEZ,GAAK8sC,EAAY1Q,EAAEp7B,GAAGA,GAAI,GASnB,GAAK8rC,EAAYl0B,EAAE5X,GAAI,IAYvB,GAAU,IAANhB,EAAS,CAGlB,MAAMu5D,EAAO,IAAI3gD,GACjB2gD,EAAKv4D,GAAK,EAEV,IAAK,IAAIC,EAAID,EAAI,EAAGC,EAAIsoC,EAAStoC,IAC/Bs4D,EAAKt4D,GAAKg/C,EAAesZ,EAAKt4D,GAAIm7B,EAAEn7B,GAAGD,IAGzCg7B,EAAE96B,KAAKq4D,EACT,MAvBkC,CAGhC,GAAU,IAANv5D,EAEF,MAAO,GAGPg8B,EAAEzkB,OAAOvX,EAAG,GACZA,GAAK,EACLm5D,GAAK,CAET,KArB8B,CAG5BvgD,EAAE5X,GAAKmtD,EAAav1C,EAAE5X,GAAIo7B,EAAEp7B,GAAGA,IAE/B,IAAK,IAAIC,EAAID,EAAI,EAAGC,EAAIsoC,EAAStoC,IAE/B2X,EAAE3X,GAAKg/C,EAAernC,EAAE3X,GAAIg8C,EAAerkC,EAAE5X,GAAIo7B,EAAEn7B,GAAGD,IAE1D,CAwBF,CACF,CAEA,OAAOg7B,EAAEpzB,KAAIlJ,GAAK,IAAIypB,EAAY,CAAE1lB,KAAM/D,EAAEkJ,KAAIsP,GAAK,CAACA,KAAKiH,KAAM,CAACkqB,EAAM,MAC1E,CAiFA,IChMI5kC,GAAO,YAWA+0D,GAAkC36D,GAAQ4F,GAVlC,CACnB,QACA,SACA,eACA,iBACA,iBACA,cACA,gBAGyElC,IAA+F,IAA9F,MAAE4C,EAAK,OAAEykB,EAAM,aAAEukC,EAAY,eAAElR,EAAc,eAAEgD,EAAc,YAAEnT,EAAW,YAAE3jB,GAAa5mB,EACnK,MAAM61D,EAAkBJ,GAAsB,CAAE7uC,gBA0BhD,OAAOhkB,EAAMV,GAAM,CAEjB,+BAAgC,SAAUwqB,EAAGrW,GAC3C,OAwEJ,SAAsCqW,EAAGiqC,GAEvC,MAAMl9B,EAAI,CAACo8B,EAAgBnpC,EAAGiqC,GAAI,GAAMx3B,MAAM94B,KAAIsP,GAAKA,EAAE,MAEnDmxB,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAElBniB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAGd,IAAK,IAAIxqC,EAAIuoC,EAAU,EAAGvoC,GAAK,EAAGA,IAAK,CACrC,IAAIm4D,EAAIn9B,EAAE/7B,OAGV,IAAK,IAAID,EAAI,EAAGA,EAAIm5D,EAAGn5D,IAAK,CAC1B,MAAM4Y,EAAIojB,EAAEh8B,GAGNo5D,EAAU,GACVC,EAAW,GAGXzzB,EAAa+H,EAAI3sC,GAIvB,IAAIs4D,EAAM,EACV,IAAK,IAAIr4D,EAJS0sC,EAAI3sC,EAAI,GAID,EAAGC,GAAK2kC,EAAY3kC,IAAK,CAChD,MAAMqpC,EAAIjnC,EAAMpC,GAEZqpC,IAAMtpC,EACRs4D,EAAMt6C,EAAO/d,GACJqpC,EAAItpC,IAEbo4D,EAAQl4D,KAAK8d,EAAO/d,IACpBo4D,EAASn4D,KAAKopC,GAElB,CAEA,GAAKwC,EAAYwsB,EAAK,GAUf,GAAKxsB,EAAYl0B,EAAE5X,GAAI,IAYvB,GAAU,IAANhB,EAAS,CAGlB,MAAMu5D,EAAO,IAAI3gD,GACjB2gD,EAAKv4D,GAAK,EAGV,IAAK,IAAIC,EAAI,EAAGw3D,EAAYY,EAASp5D,OAAQgB,EAAIw3D,EAAWx3D,IAAK,CAC/D,MAAMqpC,EAAI+uB,EAASp4D,GACnBs4D,EAAKjvB,GAAK2V,EAAesZ,EAAKjvB,GAAI8uB,EAAQn4D,GAC5C,CAEA+6B,EAAE96B,KAAKq4D,EACT,MAzBkC,CAGhC,GAAU,IAANv5D,EAEF,MAAO,GAGPg8B,EAAEzkB,OAAOvX,EAAG,GACZA,GAAK,EACLm5D,GAAK,CAET,KAtB0B,CAGxBvgD,EAAE5X,GAAKmtD,EAAav1C,EAAE5X,GAAIs4D,GAG1B,IAAK,IAAIr4D,EAAI,EAAGw3D,EAAYY,EAASp5D,OAAQgB,EAAIw3D,EAAWx3D,IAAK,CAC/D,MAAMqpC,EAAI+uB,EAASp4D,GACnB2X,EAAE0xB,GAAK2V,EAAernC,EAAE0xB,GAAI2S,EAAerkC,EAAE5X,GAAIo4D,EAAQn4D,IAC3D,CACF,CA0BF,CACF,CAEA,OAAO+6B,EAAEpzB,KAAIlJ,GAAK,IAAIypB,EAAY,CAAE1lB,KAAM/D,EAAEkJ,KAAIsP,GAAK,CAACA,KAAKiH,KAAM,CAACkqB,EAAM,MAC1E,CAzJW0vB,CAA4B9pC,EAAGrW,EACxC,EAEA,8BAA+B,SAAUqW,EAAGrW,GAC1C,OAAOogD,EAA2B/pC,EAAGrW,EACvC,EAEA,wBAAyB,SAAUC,EAAGD,GAGpC,OADUogD,EADApvC,EAAO/Q,GACuBD,GAC/BhQ,KAAIqS,GAAKA,EAAEyD,WACtB,IAGF,SAASs6C,EAA4B/pC,EAAGiqC,GAKtC,MAAMl9B,EAAI,CAACo8B,EAAgBnpC,EAAGiqC,GAAI,GAAMx3B,MAAM94B,KAAIsP,GAAKA,EAAE,MAEnDkkB,EAAInN,EAAEyS,MACN2H,EAAOpa,EAAEkS,MAAM,GAIrB,IAAK,IAAIngC,EAHOiuB,EAAEkS,MAAM,GAGD,EAAGngC,GAAK,EAAGA,IAAK,CACrC,IAAIm4D,EAAIn9B,EAAE/7B,OAGV,IAAK,IAAID,EAAI,EAAGA,EAAIm5D,EAAGn5D,IAAK,CAC1B,MAAM4Y,EAAIojB,EAAEh8B,GAEZ,GAAK8sC,EAAY1Q,EAAEp7B,GAAGA,GAAI,GASnB,GAAK8rC,EAAYl0B,EAAE5X,GAAI,IAYvB,GAAU,IAANhB,EAAS,CAGlB,MAAMu5D,EAAO,IAAI3gD,GACjB2gD,EAAKv4D,GAAK,EAEV,IAAK,IAAIC,EAAID,EAAI,EAAGC,GAAK,EAAGA,IAC1Bs4D,EAAKt4D,GAAKg/C,EAAesZ,EAAKt4D,GAAIm7B,EAAEn7B,GAAGD,IAGzCg7B,EAAE96B,KAAKq4D,EACT,MAvBkC,CAGhC,GAAU,IAANv5D,EAEF,MAAO,GAGPg8B,EAAEzkB,OAAOvX,EAAG,GACZA,GAAK,EACLm5D,GAAK,CAET,KArB8B,CAG5BvgD,EAAE5X,GAAKmtD,EAAav1C,EAAE5X,GAAIo7B,EAAEp7B,GAAGA,IAE/B,IAAK,IAAIC,EAAID,EAAI,EAAGC,GAAK,EAAGA,IAE1B2X,EAAE3X,GAAKg/C,EAAernC,EAAE3X,GAAIg8C,EAAerkC,EAAE5X,GAAIo7B,EAAEn7B,GAAGD,IAE1D,CAwBF,CACF,CAEA,OAAOg7B,EAAEpzB,KAAIlJ,GAAK,IAAIypB,EAAY,CAAE1lB,KAAM/D,EAAEkJ,KAAIsP,GAAK,CAACA,KAAKiH,KAAM,CAACkqB,EAAM,MAC1E,CAmFA,IC/LWowB,GAAwC56D,GAHxC,kBACQ,CAAC,QAAS,gBAEkD0D,IAA4B,IAA3B,MAAE4C,EAAK,YAAE2nC,GAAavqC,EAmBtG,OAAO,SAA0BsW,EAAGD,EAAGnJ,GAErC,MAAM07B,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,gBAAyB/kC,IAAZqW,EAAE6oB,MAAsB7oB,EAAE0uB,UAAY1uB,EAAEgvB,cAE7DsQ,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KACT8M,EAAQ1/B,EAAEuoB,MACVoX,EAAM3/B,EAAE2uB,gBAAyB/kC,IAAZoW,EAAE8oB,MAAsB9oB,EAAE2uB,UAAY3uB,EAAEivB,cAGnE,GAAIwN,EAAMp1C,SAAWq4C,EAAMr4C,OAAU,MAAM,IAAIsgC,GAAe8U,EAAMp1C,OAAQq4C,EAAMr4C,QAGlF,GAAIo1C,EAAM,KAAOiD,EAAM,IAAMjD,EAAM,KAAOiD,EAAM,GAAM,MAAM,IAAInR,WAAW,iCAAmCkO,EAAQ,0BAA4BiD,EAAQ,KAG1J,IAAKnN,IAAYgN,EAAW,MAAM,IAAI5iC,MAAM,uDAG5C,MAAM8zB,EAAOgM,EAAM,GACb9L,EAAU8L,EAAM,GAGtB,IAAIE,EAEAjmB,EAAKwd,EAELc,EAAO,EAEP4H,EAAK/lC,EAGU,iBAAR6lC,GAAoBA,IAAQiD,GAAe,UAARjD,IAE5CC,EAAKD,EAELhmB,EAAKnqB,EAAMwR,KAAKm2B,EAAa,CAACyI,EAAIA,IAElC3H,EAAOzoC,EAAM8J,QAAQ,EAAGsmC,GAExBC,EAAKrwC,EAAMwR,KAAKlH,EAAU,CAAC8lC,EAAIA,KAIjC,MAAME,EAAU,GACVzK,EAAS,GACT0K,EAAO,GAGPh2C,EAAI,GAEJG,EAAI,GAGV,IAAIG,EAAGyrC,EAAIC,EAAI1qC,EAGf,IAAK,IAAIC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhCy0C,EAAKz0C,GAAK+pC,EAAO/qC,OAEjB,MAAM8qC,EAAO9pC,EAAI,EAEjB,IAAKwqC,EAAKF,EAAKtqC,GAAIyqC,EAAKH,EAAKtqC,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIqqC,EAAOrrC,GAEXH,EAAEmB,GAAK+pC,EAEPrrC,EAAEsB,GAAKmqC,EAAQnrC,GAEfgrC,EAAO9pC,KAAKF,GAGd,IAAKyqC,EAAK4M,EAAKp3C,GAAIyqC,EAAK2M,EAAKp3C,EAAI,GAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnDgB,EAAIo3C,EAAOp4C,GAEPH,EAAEmB,KAAO+pC,IAEXrrC,EAAEsB,GAAKw0C,EAAG91C,EAAEsB,GAAIm3C,EAAQn4C,KAM5B,IAFAA,EAAI01C,EAAKz0C,GAEFjB,EAAIgrC,EAAO/qC,QAAQ,CAExBe,EAAIgqC,EAAOhrC,GAEX,MAAMF,EAAIJ,EAAEsB,GAEPsuB,EAAGxvB,EAAG8tC,GAOT5C,EAAOzzB,OAAOvX,EAAG,IALjBy1C,EAAQv0C,KAAKpB,GAEbE,IAKJ,CACF,CAKA,OAHA01C,EAAKnM,GAAWyB,EAAO/qC,OAGhB4Y,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAACkqB,EAAME,GACbzK,SAAUwW,IAAQz8B,EAAE0uB,WAAagR,IAAQ3/B,EAAE2uB,UAAYgO,OAAK/yC,GAEhE,CAAC,IC9IUk3D,GAAgD76D,GAAQ,0BAA2B,CAAC,QAAS,WAAW0D,IAAA,IAAC,MAAE4C,EAAK,OAAEykB,GAAQrnB,EAAA,MAAM,CAC3I,gBAAiB4C,EAAMgM,QAAQ,uBAC7BkuC,GAAU,CAAC3/C,EAAGC,IAAM0/C,EAAOz1B,EAAOlqB,GAAIC,GAAG+e,YAE3C,mBAAoBvZ,EAAMgM,QAAQ,0BAChCwoD,GAAU,CAACj6D,EAAGC,IAAMg6D,EAAO/vC,EAAOlqB,GAAIC,GAAG+e,YAE3C,gBAAiBvZ,EAAMgM,QAAQ,uBAC7ByoD,GAAU,CAACl6D,EAAGC,IAAMi6D,EAAOl6D,EAAGkqB,EAAOjqB,IAAI+e,YAE3C,mBAAoBvZ,EAAMgM,QAAQ,0BAChC0oD,GAAU,CAACn6D,EAAGC,IAAMk6D,EAAOn6D,EAAGkqB,EAAOjqB,IAAI+e,YAC5C,ICFKja,GAAO,YAUAq1D,GAAkCj7D,GAAQ4F,GATlC,CACnB,QACA,SACA,cACA,QACA,cACA,WAGyElC,IAAgE,IAA/D,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,EAAW,OAAE7iB,GAAQ/D,EACpI,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCo1C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7CitB,EAAkBN,GAAsB,CAAEt0D,QAAO2nC,gBACjDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CqtB,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UACpCu1C,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE0zD,EAA0BN,GAA8B,CAAEv0D,QAAOykB,WAyBvE,OAAOzkB,EACLV,GACA,CACE,iBAAkB89C,GAElB,uBAAwBN,GAExB,iBAAkBU,CAACjjD,EAAGC,IAAMD,GAAKC,EAEjC,mCAAoCwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ6zB,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ+zB,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,mCAAoC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB0c,EAAe57C,EAAGD,EAAGmR,GAAM,KAGpC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB6X,EAAa/2C,EAAGD,EAAGmR,GAAM,MAGpCmpD,EACAtf,EAAqB,CACnBT,GAAI8f,EACJpgB,GAAI0B,EACJ3B,GAAIa,IAEP,IC1FG91C,GAAO,kBAUAw1D,GAAwCp7D,GAAQ4F,GATxC,CACnB,QACA,SACA,cACA,QACA,cACA,WAG+ElC,IAAgE,IAA/D,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,EAAW,OAAE7iB,GAAQ/D,EAC1I,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCo1C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7CitB,EAAkBN,GAAsB,CAAEt0D,QAAO2nC,gBACjDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CqtB,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UACpCu1C,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE0zD,EAA0BN,GAA8B,CAAEv0D,QAAOykB,WAyBvE,OAAOzkB,EACLV,GACA,CACE,iBAAkB+9C,GAElB,uBAAwBN,GAExB,iBAAkBS,CAACjjD,EAAGC,IAAMD,GAAKC,EAEjC,mCAAoCwF,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ6zB,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ+zB,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,mCAAoC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB0c,EAAe57C,EAAGD,EAAGmR,GAAM,KAGpC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB6X,EAAa/2C,EAAGD,EAAGmR,GAAM,MAGpCmpD,EACAtf,EAAqB,CACnBT,GAAI8f,EACJpgB,GAAI0B,EACJ3B,GAAIa,IAEP,IC3FG91C,GAAO,gBAUAy1D,GAAsCr7D,GAAQ4F,GATtC,CACnB,QACA,SACA,cACA,QACA,cACA,WAG6ElC,IAAgE,IAA/D,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,YAAE4B,EAAW,OAAE7iB,GAAQ/D,EACxI,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCo1C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7CitB,EAAkBN,GAAsB,CAAEt0D,QAAO2nC,gBACjDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CqtB,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UACpCu1C,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE0zD,EAA0BN,GAA8B,CAAEv0D,QAAOykB,WA0BvE,OAAOzkB,EACLV,GACA,CACE,iBAAkBg+C,GAIlB,mCAAoCt9C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ6zB,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYntC,EAAG,GACVD,EAAEijB,QAEJ+zB,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,mCAAoC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB0c,EAAe57C,EAAGD,EAAGmR,GAAM,KAGpC,kCAAmC1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE3DmtC,EAAYptC,EAAG,GACV6nB,EAAM5nB,EAAEwf,OAAQxf,EAAEk/B,WAEpB6X,EAAa/2C,EAAGD,EAAGmR,GAAM,MAGpCmpD,EACAtf,EAAqB,CACnBT,GAAI8f,EACJpgB,GAAI0B,EACJ3B,GAAIa,IAEP,IClFU4f,GAA4Bt7D,GAV5B,MACQ,CACnB,QACA,SACA,cACA,QACA,MACA,WAGmE0D,IAAwD,IAAvD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,IAAE6yC,EAAG,OAAE9zD,GAAQ/D,EACtH,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C6O,EAAiBF,GAAqB,CAAEt2C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UACpCu1C,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA8BzE,OAAOnB,EA7CI,MA+CT,CACE,iBAAkB0+C,GAElB,mBAAoB,SAAUnkD,EAAGC,GAC/B,QAAiB,IAATD,EAAEoc,IAAqB,IAATpc,EAAEo6B,IAAuB,IAATn6B,EAAEmc,IAAqB,IAATnc,EAAEm6B,GACxD,EAEA,uBAAwB,SAAUp6B,EAAGC,GACnC,QAAQD,EAAE6uB,UAAa5uB,EAAE4uB,UAAa7uB,EAAEod,SAAYnd,EAAEmd,QACxD,EAEA,iBAAkB+mC,GAElB,aAAc1+C,EAAM6L,aAAYH,GAC9B,CAACnR,EAAGC,IAAMkR,EAAKnR,EAAEgH,OAAS,EAAG/G,EAAE+G,OAAS,KAE1C,oBAAqBvB,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE7Cy6D,EAAIz6D,GAEC4nB,EAAM7nB,EAAEyf,OAAQzf,EAAEm/B,WAEpB2X,EAAc92C,EAAGC,EAAGkR,GAAM,KAGnC,mBAAoB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5Cy6D,EAAIz6D,GAEC4nB,EAAM7nB,EAAEyf,OAAQzf,EAAEm/B,WAEpB6X,EAAah3C,EAAGC,EAAGkR,GAAM,KAGlC,oBAAqB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE7Cy6D,EAAI16D,GAEC6nB,EAAM7nB,EAAEyf,OAAQzf,EAAEm/B,WAEpB2X,EAAc72C,EAAGD,EAAGmR,GAAM,KAGnC,mBAAoB1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAE5Cy6D,EAAI16D,GAEC6nB,EAAM7nB,EAAEyf,OAAQzf,EAAEm/B,WAEpB6X,EAAa/2C,EAAGD,EAAGmR,GAAM,KAGlC,aAAc1L,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAEnCkR,EAAK+Y,EAAOlqB,GAAIC,GAAG+e,YAG5B,aAAcvZ,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,IAEnCkR,EAAKnR,EAAGkqB,EAAOjqB,IAAI+e,aAG9Bg8B,EAAqB,CACnBT,GAAI0B,EACJhC,GAAIY,IAEP,IChHG91C,GAAO,UAYA41D,GAAgCx7D,GAAQ4F,GAXhC,CACnB,QACA,SACA,SACA,cACA,YACA,WACA,cACA,WAGuElC,IAAsF,IAArF,MAAE4C,EAAK,OAAEyf,EAAM,YAAEkoB,EAAW,OAAEljB,EAAM,UAAEX,EAAS,SAAEG,EAAQ,YAAED,EAAW,OAAE7iB,GAAQ/D,EACxJ,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtCs1C,EAAiB/B,GAAqB,CAAEvzC,QAAO2nC,gBAC/C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE8mC,EAAeH,GAAmB,CAAE9nC,UAuC1C,OAAOA,EACLV,GACA61D,GAAoB,CAAEn1D,QAAOyf,WAC7B,CACE,mBAAoB,SAAUllB,EAAGC,GAC/B,OAAOD,IAAMC,EAAI,EAAKD,EAAIC,EAAI,GAAK,CACrC,EAEA,uBAAwB,SAAUD,EAAGC,GACnC,OAAOusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,QAC9C,IAAIa,EAAU,GACd,IAAIA,EAAUvpB,EAAEiuB,IAAIhuB,GAC1B,EAEA,iBAAkB,SAAUD,EAAGC,GAC7B,OAAOD,IAAMC,EAAI,GAAMD,EAAIC,EAAI,IAAM,EACvC,EAEA,qBAAsB,SAAUD,EAAGC,GACjC,OAAO,IAAIypB,EAAS1pB,EAAE41B,QAAQ31B,GAChC,EAEA,mBAAoB,WAClB,MAAM,IAAIiG,UAAU,sDACtB,GAEFwnC,EACAsN,EAAqB,CACnBT,GAAIQ,EACJd,GAAIa,EACJJ,GAAI3D,IAEP,IAGU6jB,GAAsCz7D,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EACtG,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,QAC3C,EACC1oB,EAAIC,EAAI,GAAK,CACpB,GACA,I,cCvGJ,MAAM8E,GAAO,iBAMA81D,GAAuC17D,GAAQ4F,GALvC,CACnB,QACA,YAG8ElC,IAAwB,IAAvB,MAAE4C,EAAK,QAAEmwB,GAAS/yB,EACjG,MAAMi4D,EAAkBllC,EAAQ7tB,WAAW,mBAsE3C,OAAOtC,EAAMV,GAAM,CAAE,WAErB,SAASg2D,EAAiB/6D,EAAGC,GAC3B,MAAM+6D,EAAQh4C,GAAOhjB,GACfi7D,EAAQj4C,GAAO/iB,GACrB,IAAIiE,EAGJ,KAAe,WAAV82D,GAAgC,cAAVA,GAAmC,aAAVA,GACrC,WAAVC,GAAgC,cAAVA,GAAmC,aAAVA,GAElD,OADA/2D,EAAI0xB,EAAQ51B,EAAGC,GACM,MAAjBiE,EAAEkO,WAEGlO,EAAI,EAAI,GAAK,EAEb+X,GAAY++C,EAAOC,GAK9B,MAAMC,EAAW,CAAC,QAAS,cAAe,gBAC1C,GAAIA,EAAS74C,SAAS24C,IAAUE,EAAS74C,SAAS44C,GAEhD,OADA/2D,EAAIi3D,EAAyBJ,EAAiB/6D,EAAGC,GACvC,IAANiE,EACKA,EAEA+X,GAAY++C,EAAOC,GAK9B,GAAID,IAAUC,EACZ,OAAOh/C,GAAY++C,EAAOC,GAG5B,GAAc,YAAVD,EACF,OAmJN,SAAgCh7D,EAAGC,GACjC,OAAID,EAAEoc,GAAKnc,EAAEmc,GAAa,EACtBpc,EAAEoc,GAAKnc,EAAEmc,IAAc,EAEvBpc,EAAEo6B,GAAKn6B,EAAEm6B,GAAa,EACtBp6B,EAAEo6B,GAAKn6B,EAAEm6B,IAAc,EAEpB,CACT,CA3JaghC,CAAsBp7D,EAAGC,GAGlC,GAAc,SAAV+6D,EACF,OAAIh7D,EAAEwtC,UAAUvtC,GACP86D,EAAgB/6D,EAAEgH,MAAO/G,EAAE+G,OAI7Bq0D,EAAcN,EAAiB/6D,EAAE6jD,cAAe5jD,EAAE4jD,eAG3D,GAAc,YAAVmX,EACF,OAAOF,EAAgB96D,EAAGC,GAG5B,GAAc,WAAV+6D,EACF,OAAO/+C,GAAYjc,EAAGC,GAGxB,GAAc,WAAV+6D,EACF,OA4FJ,SAAyBM,EAAgBt7D,EAAGC,GAC1C,MAAMs7D,EAAQz5D,OAAOyB,KAAKvD,GACpBw7D,EAAQ15D,OAAOyB,KAAKtD,GAG1Bs7D,EAAMpxD,KAAK8R,IACXu/C,EAAMrxD,KAAK8R,IACX,MAAM/X,EAAIm3D,EAAcC,EAAgBC,EAAOC,GAC/C,GAAU,IAANt3D,EACF,OAAOA,EAIT,IAAK,IAAI5C,EAAI,EAAGA,EAAIi6D,EAAMh7D,OAAQe,IAAK,CACrC,MAAMlB,EAAIk7D,EAAet7D,EAAEu7D,EAAMj6D,IAAKrB,EAAEu7D,EAAMl6D,KAC9C,GAAU,IAANlB,EACF,OAAOA,CAEX,CAEA,OAAO,CACT,CAjHWq7D,CAAeV,EAAiB/6D,EAAGC,GAG5C,GAAc,SAAV+6D,EACF,OAAO,EAGT,GAAc,cAAVA,EACF,OAAO,EAIT,MAAM,IAAI90D,UAAU,8BAAgC80D,EAAQ,IAC9D,IASA,SAASG,EAA0BG,EAAgBt7D,EAAGC,GACpD,OAAI6gB,EAAe9gB,IAAM8gB,EAAe7gB,GAC/Bo7D,EAAcC,EAAgBt7D,EAAEuqB,SAASjL,OAAQrf,EAAEsqB,SAASjL,QAEjEwB,EAAe9gB,GAEVm7D,EAAyBG,EAAgBt7D,EAAEg/B,UAAW/+B,GAE3D6gB,EAAe7gB,GAEVk7D,EAAyBG,EAAgBt7D,EAAGC,EAAE++B,WAInDne,EAAc7gB,GACTm7D,EAAyBG,EAAgBt7D,EAAEuqB,SAASxmB,KAAM9D,GAE/D4gB,EAAc5gB,GACTk7D,EAAyBG,EAAgBt7D,EAAGC,EAAEsqB,SAASxmB,MAI3DkB,MAAMC,QAAQlF,GAGdiF,MAAMC,QAAQjF,GAIZo7D,EAAcC,EAAgBt7D,EAAGC,GAH/Bk7D,EAAyBG,EAAgBt7D,EAAG,CAACC,IAH7Ck7D,EAAyBG,EAAgB,CAACt7D,GAAIC,EAOzD,CAaA,SAASo7D,EAAeC,EAAgBt7D,EAAGC,GAEzC,IAAK,IAAIqB,EAAI,EAAG8O,EAAKtD,KAAKC,IAAI/M,EAAEO,OAAQN,EAAEM,QAASe,EAAI8O,EAAI9O,IAAK,CAC9D,MAAMlB,EAAIk7D,EAAet7D,EAAEsB,GAAIrB,EAAEqB,IACjC,GAAU,IAANlB,EACF,OAAOA,CAEX,CAGA,OAAIJ,EAAEO,OAASN,EAAEM,OAAiB,EAC9BP,EAAEO,OAASN,EAAEM,QAAkB,EAG5B,CACT,CAiCA,ICvPIwE,GAAO,cACPif,GAAe,CACnB,QACA,SACA,UAGF03C,GAAan0D,UAAY,WAElB,MAAMo0D,GAAoCx8D,GAAQ4F,GAAMif,IAAcnhB,IAA+B,IAA9B,MAAE4C,EAAK,OAAEykB,EAAM,OAAEtjB,GAAQ/D,EACrG,MAAMm4C,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA8BzE,OAAOnB,EAAMV,GAAM22D,GAAc1gB,EAAqB,CACpDjB,KAAM2hB,GACNjhB,IAAI,IACH,ICzCC11C,GAAO,QAUA62D,GAA8Bz8D,GAAQ4F,GAT9B,CACnB,QACA,SACA,cACA,cACA,SACA,iBAGqElC,IAAuE,IAAtE,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,YAAE3jB,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACvI,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA8CzE,OAAOnB,EACLV,GACA82D,GAAkB,CAAEp2D,QAAO2nC,gBAC3B4N,EAAqB,CACnBjB,KAAM3M,EACNmN,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IAGU8kB,GAAoB18D,GAAQ4F,GAAM,CAAC,QAAS,gBAAgB8oC,IAA4B,IAA3B,MAAEpoC,EAAK,YAAE2nC,GAAaS,EAC9F,OAAOpoC,EAAMV,GAAM,CACjB,WAAY,SAAU/E,EAAGC,GAEvB,OAAU,OAAND,EAA2B,OAANC,EACf,OAANA,EAA2B,OAAND,OACf8C,IAAN9C,OAAgC8C,IAAN7C,OACpB6C,IAAN7C,OAAgC6C,IAAN9C,EAEvBotC,EAAYptC,EAAGC,EACxB,GACA,ICvFE8E,GAAO,YAOA+2D,GAAkC38D,GAAQ4F,GANlC,CACnB,QACA,cACA,WAGyElC,IAAoC,IAAnC,MAAE4C,EAAK,YAAEm7B,EAAW,OAAE/R,GAAQhsB,EA2BxG,OAAO4C,EAAMV,GAAM,CACjB,WAAY,SAAU/E,EAAGC,GACvB,OAAO4uB,EAAO+R,EAAY5gC,EAAGC,GAC/B,GACA,IC/BE8E,GAAO,UAWAg3D,GAAgC58D,GAAQ4F,GAVhC,CACnB,QACA,SACA,YACA,SACA,cACA,SACA,iBAGuElC,IAA6E,IAA5E,MAAE4C,EAAK,OAAEyf,EAAM,UAAEglC,EAAS,OAAEhgC,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EAC/I,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE8mC,EAAeH,GAAmB,CAAE9nC,UAiC1C,SAASu2D,EAAeh8D,EAAGC,GACzB,OAAOD,EAAEwyB,GAAGvyB,KAAOusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAChE,CAEA,OAAOjjB,EACLV,GACAk3D,GAAoB,CAAEx2D,QAAOyf,WAC7B,CACE,mBAAoBg3C,CAACl8D,EAAGC,IAAMD,EAAIC,EAElC,uBAAwB+7D,EAExB,iBAAkB/Y,CAACjjD,EAAGC,IAAMD,EAAIC,EAEhC,qBAAsB67C,CAAC97C,EAAGC,KAAyB,IAAlBD,EAAE41B,QAAQ31B,GAE3C,sBAAuB,SAAUD,EAAGC,GAClC,OAAO+7D,EAAc9R,EAAUlqD,GAAIC,EACrC,EAEA,sBAAuB,SAAUD,EAAGC,GAClC,OAAO+7D,EAAch8D,EAAGkqD,EAAUjqD,GACpC,EAEA,mBAAoB,SAAUD,EAAGC,GAC/B,MAAM,IAAIiG,UAAU,sDACtB,GAEFwnC,EACAsN,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IAGUklB,GAAsC98D,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EACtG,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOD,EAAIC,IAAMuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAC3D,GACA,IC3FE3jB,GAAO,YAUAo3D,GAAkCh9D,GAAQ4F,GATlC,CACnB,QACA,SACA,SACA,cACA,SACA,iBAGyElC,IAAkE,IAAjE,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACtI,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE8mC,EAAeH,GAAmB,CAAE9nC,UA6B1C,OAAOA,EACLV,GACAq3D,GAAsB,CAAE32D,QAAOyf,WAC/B,CACE,mBAAoBg3C,CAACl8D,EAAGC,IAAOD,GAAKC,EAEpC,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEuxB,IAAItxB,IAAMusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAChE,EAEA,iBAAkBu6B,CAACjjD,EAAGC,IAAOD,GAAKC,EAElC,qBAAsB67C,CAAC97C,EAAGC,IAAwB,IAAjBD,EAAE41B,QAAQ31B,GAE3C,mBAAoB,WAClB,MAAM,IAAIiG,UAAU,sDACtB,GAEFwnC,EACAsN,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IAGUqlB,GAAwCj9D,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EACxG,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOD,GAAKC,GAAKuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAC3D,GACA,IC5EE3jB,GAAO,SAWAs3D,GAA+Bl9D,GAAQ4F,GAV/B,CACnB,QACA,SACA,YACA,SACA,cACA,SACA,iBAGsElC,IAA6E,IAA5E,MAAE4C,EAAK,OAAEyf,EAAM,UAAEglC,EAAS,OAAEhgC,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EAC9I,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE8mC,EAAeH,GAAmB,CAAE9nC,UAiC1C,SAAS62D,EAAct8D,EAAGC,GACxB,OAAOD,EAAEguB,GAAG/tB,KAAOusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAChE,CAEA,OAAOjjB,EACLV,GACAw3D,GAAmB,CAAE92D,QAAOyf,WAC5B,CACE,mBAAoBg3C,CAACl8D,EAAGC,IAAMD,EAAIC,EAElC,uBAAwBq8D,EAExB,iBAAkBrZ,CAACjjD,EAAGC,IAAMD,EAAIC,EAEhC,qBAAsB67C,CAAC97C,EAAGC,IAAwB,IAAjBD,EAAE41B,QAAQ31B,GAE3C,sBAAuB,SAAUD,EAAGC,GAClC,OAAOq8D,EAAapS,EAAUlqD,GAAIC,EACpC,EAEA,sBAAuB,SAAUD,EAAGC,GAClC,OAAOq8D,EAAat8D,EAAGkqD,EAAUjqD,GACnC,EAEA,mBAAoB,WAClB,MAAM,IAAIiG,UAAU,sDACtB,GAEFwnC,EACAsN,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IAGUwlB,GAAqCp9D,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EACrG,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOD,EAAIC,IAAMuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAC3D,GACA,IC3FE3jB,GAAO,WAUAy3D,GAAiCr9D,GAAQ4F,GATjC,CACnB,QACA,SACA,SACA,cACA,SACA,iBAGwElC,IAAkE,IAAjE,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACrI,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WACnE8mC,EAAeH,GAAmB,CAAE9nC,UA6B1C,OAAOA,EACLV,GACA03D,GAAqB,CAAEh3D,QAAOyf,WAC9B,CACE,mBAAoBg3C,CAACl8D,EAAGC,IAAMD,GAAKC,EAEnC,uBAAwB,SAAUD,EAAGC,GACnC,OAAOD,EAAEswB,IAAIrwB,IAAMusC,GAAexsC,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAChE,EAEA,iBAAkB,SAAU1oB,EAAGC,GAC7B,OAAOD,GAAKC,CACd,EAEA,qBAAsB67C,CAAC97C,EAAGC,KAAyB,IAAlBD,EAAE41B,QAAQ31B,GAE3C,mBAAoB,WAClB,MAAM,IAAIiG,UAAU,sDACtB,GAEFwnC,EACAsN,EAAqB,CACnBT,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAEP,IAGU0lB,GAAuCt9D,GAAQ4F,GAAM,CAAC,QAAS,WAAW8oC,IAAuB,IAAtB,MAAEpoC,EAAK,OAAEyf,GAAQ2oB,EACvG,OAAOpoC,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,EAAGC,GAC7B,OAAOD,GAAKC,GAAKuoB,GAAYxoB,EAAGC,EAAGilB,EAAOuD,OAAQvD,EAAOwD,OAC3D,GACA,ICrFE3jB,GAAO,YAMA23D,GAAkCv9D,GAAQ4F,GALlC,CACnB,QACA,UAGyElC,IAAsB,IAArB,MAAE4C,EAAK,MAAEk7C,GAAO99C,EA8B1F,OAAO4C,EAAMV,GAAM,CACjB,WAAY,SAAU/E,EAAGC,GACvB,OAAO08D,EAAW38D,EAAEgf,UAAW/e,EAAE+e,UACnC,IASF,SAAS29C,EAAY38D,EAAGC,GACtB,GAAIgF,MAAMC,QAAQlF,GAAI,CACpB,GAAIiF,MAAMC,QAAQjF,GAAI,CACpB,MAAM6Y,EAAM9Y,EAAEO,OACd,GAAIuY,IAAQ7Y,EAAEM,OACZ,OAAO,EAGT,IAAK,IAAIe,EAAI,EAAGA,EAAIwX,EAAKxX,IACvB,IAAKq7D,EAAW38D,EAAEsB,GAAIrB,EAAEqB,IACtB,OAAO,EAIX,OAAO,CACT,CACE,OAAO,CAEX,CACE,OAAI2D,MAAMC,QAAQjF,IAGT0gD,EAAM3gD,EAAGC,EAGtB,KCrEI8E,GAAO,UAWA63D,GAAgCz9D,GAAQ4F,GAVhC,CACnB,QACA,SACA,cACA,SACA,cACA,SACA,iBAGuElC,IAA+E,IAA9E,MAAE4C,EAAK,OAAEyf,EAAM,YAAEkoB,EAAW,OAAEljB,EAAM,YAAET,EAAW,OAAE7iB,EAAM,aAAEknC,GAAcjrC,EACjJ,MAAMi4C,EAAgB/B,GAAoB,CAAEtzC,UACtC+9C,EAAgBJ,GAAoB,CAAE39C,QAAOqoC,iBAC7CiJ,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WA6CzE,OAAOnB,EACLV,GACA83D,GAAoB,CAAEp3D,QAAO2nC,gBAC7B4N,EAAqB,CACnBjB,KAOJ,SAAmB/5C,EAAGC,GACpB,OAAQmtC,EAAYptC,EAAGC,EACzB,EARIs6C,GAAIiJ,EACJvJ,GAAIa,EACJJ,GAAI3D,IAMR,IAGW8lB,GAAsB19D,GAAQ4F,GAAM,CAAC,QAAS,gBAAgB8oC,IAA4B,IAA3B,MAAEpoC,EAAK,YAAE2nC,GAAaS,EAChG,OAAOpoC,EAAMV,GAAM,CACjB,WAAY,SAAU/E,EAAGC,GAEvB,OAAU,OAAND,EAA2B,OAANC,EACf,OAANA,EAA2B,OAAND,OACf8C,IAAN9C,OAAgC8C,IAAN7C,OACpB6C,IAAN7C,OAAgC6C,IAAN9C,GAEtBotC,EAAYptC,EAAGC,EACzB,GACA,ICzFE8E,GAAO,kBAGA+3D,GAAwC39D,GAAQ4F,GAFxC,CAAC,QAAS,YAAa,QAAS,YAE4BlC,IAAqD,IAApD,MAAE4C,EAAK,UAAEsnC,EAAW3vB,MAAO22C,EAAS,QAAEn+B,GAAS/yB,EAC/H,MAAMk6D,EAAMnnC,EACNonC,EAAOA,CAAC7jD,EAAGD,KAAO0c,EAAQzc,EAAGD,GAuCnC,OAAOzT,EAAMV,GAAM,CACjB,yBAA0B,SAAU/E,EAAGM,GACrC,OAAO28D,EAAiBj9D,EAAGM,EAAGy8D,EAChC,EAEA,iCAAkC,SAAU/8D,EAAGM,EAAGs1B,GAChD,GAAgB,QAAZA,EACF,OAAOqnC,EAAiBj9D,EAAGM,EAAGy8D,GACzB,GAAgB,SAAZnnC,EACT,OAAOqnC,EAAiBj9D,EAAGM,EAAG08D,GAE9B,MAAM,IAAInnD,MAAM,yCAEpB,EAEA,mCAAoConD,IAGtC,SAASA,EAAkBj9D,EAAGM,EAAGs1B,GAC/B,IAAK/Q,GAAUvkB,IAAMA,EAAI,EACvB,MAAM,IAAIuV,MAAM,oCAGlB,GAAI8K,EAAS3gB,GAAI,CAEf,GADaA,EAAEyf,OACNlf,OAAS,EAChB,MAAM,IAAIsV,MAAM,2CAElB,OAAOqnD,EAAYl9D,EAAEgf,UAAW1e,EAAGs1B,EACrC,CAEA,GAAI3wB,MAAMC,QAAQlF,GAChB,OAAOk9D,EAAYl9D,EAAGM,EAAGs1B,EAE7B,CAYA,SAASsnC,EAAaptD,EAAKxP,EAAGs1B,GAC5B,GAAIt1B,GAAKwP,EAAIvP,OACX,MAAM,IAAIsV,MAAM,mBAIlB,IAAK,IAAIvU,EAAI,EAAGA,EAAIwO,EAAIvP,OAAQe,IAC9B,GAAIyrC,EAAUj9B,EAAIxO,KAAOyyD,EAAUjkD,EAAIxO,IACrC,OAAOwO,EAAIxO,GAIf,IAAImJ,EAAO,EACP6L,EAAKxG,EAAIvP,OAAS,EAGtB,KAAOkK,EAAO6L,GAAI,CAChB,IAAIiF,EAAI9Q,EACJtK,EAAImW,EACR,MAAM6mD,EAAQrtD,EAAIhD,KAAKsM,MAAMtM,KAAKgP,UAAYxF,EAAK7L,EAAO,IAAMA,GAGhE,KAAO8Q,EAAIpb,GAET,GAAIy1B,EAAQ9lB,EAAIyL,GAAI4hD,IAAU,EAAG,CAC/B,MAAM3iC,EAAM1qB,EAAI3P,GAChB2P,EAAI3P,GAAK2P,EAAIyL,GACbzL,EAAIyL,GAAKif,IACPr6B,CACJ,OACIob,EAKFqa,EAAQ9lB,EAAIyL,GAAI4hD,GAAS,KACzB5hD,EAIAjb,GAAKib,EACPjF,EAAKiF,EAEL9Q,EAAO8Q,EAAI,CAEf,CAEA,OAAOzL,EAAIxP,EACb,KC3IIyE,GAAO,OAGAq4D,GAA6Bj+D,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,UAAW,mBAEkBlC,IAAgD,IAA/C,MAAE4C,EAAK,OAAEykB,EAAM,QAAE0L,EAAO,eAAE0lC,GAAgBz4D,EAC/G,MAAMw6D,EAAaznC,EACb0nC,EAAcA,CAACnkD,EAAGD,KAAO0c,EAAQzc,EAAGD,GAiC1C,OAAOzT,EAAMV,GAAM,CACjBE,MAAO,SAAUjF,GAEf,OADAu9D,EAAev9D,GACRA,EAAEmK,KAAKkzD,EAChB,EAEAn+B,OAAQ,SAAUl/B,GAEhB,OADAw9D,EAAgBx9D,GACTkqB,EAAOlqB,EAAEg/B,UAAU70B,KAAKkzD,GAAar9D,EAAEm/B,UAChD,EAEA,kBAAmB,SAAUn/B,EAAGy9D,GAE9B,OADAF,EAAev9D,GACRA,EAAEmK,KAAKszD,EAChB,EAEA,mBAAoB,SAAUz9D,EAAGy9D,GAE/B,OADAD,EAAgBx9D,GACTkqB,EAAOlqB,EAAEg/B,UAAU70B,KAAKszD,GAAcz9D,EAAEm/B,UACjD,EAEA,gBAAiB,SAAUn/B,EAAG09D,GAE5B,OADAH,EAAev9D,GACRA,EAAEmK,KAAKszD,EAAYC,GAC5B,EAEA,iBAAkB,SAAU19D,EAAG09D,GAE7B,OADAF,EAAgBx9D,GACTkqB,EAAOlqB,EAAEg/B,UAAU70B,KAAKszD,EAAYC,IAAS19D,EAAEm/B,UACxD,IAQF,SAASs+B,EAAaC,GACpB,GAAc,QAAVA,EACF,OAAOL,EACF,GAAc,SAAVK,EACT,OAAOJ,EACF,GAAc,YAAVI,EACT,OAAOpC,EAEP,MAAM,IAAIzlD,MAAM,8CAEpB,CAQA,SAAS0nD,EAAgBvzC,GACvB,GAA2B,IAAvBvK,GAAKuK,GAAOzpB,OACd,MAAM,IAAIsV,MAAM,iCAEpB,CAQA,SAAS2nD,EAAiBtzC,GACxB,GAA6B,IAAzBA,EAAOzK,OAAOlf,OAChB,MAAM,IAAIsV,MAAM,kCAEpB,KCxGW8nD,GAA4Bx+D,GAH5B,MACQ,CAAC,QAAS,SAAU,UAAW,SAAU,UAEO0D,IAA0D,IAAzD,MAAE4C,EAAK,OAAEyf,EAAM,QAAEwvB,EAAO,OAAE0V,EAAQhtC,MAAO22C,GAAWlxD,EAgCxH,OAAO4C,EAnCI,MAmCQ,CAEjB,iBAAkBm4D,EAGlB,qCAAsC,SAAU5zC,EAAOmX,GACrD,OAAO+B,GAAOlZ,EAAOmX,EAAIniB,UAAW6+C,EACtC,EAGA,MAAO,SAAU/xD,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,0CAGtB,OAAO03D,EAAK9xD,EACd,IAUF,SAAS+xD,EAAU79D,EAAGC,GACpB,IACE,OAAOmqD,EAAOpqD,EAAGC,GAAKD,EAAIC,CAC5B,CAAE,MAAOmM,GACP,MAAM8nD,GAAoB9nD,EAAK,MAAOnM,EACxC,CACF,CAQA,SAAS29D,EAAM5zC,GACb,IAAIyQ,EAcJ,GAZAkL,GAAY3b,GAAO,SAAUhjB,GAC3B,KACM+sD,EAAU/sD,SAEKlE,IAAR23B,GAAqB2vB,EAAOpjD,EAAOyzB,MAD5CA,EAAMzzB,EAIV,CAAE,MAAOoF,GACP,MAAM8nD,GAAoB9nD,EAAK,MAAOpF,EACxC,CACF,SAEYlE,IAAR23B,EACF,MAAM,IAAI5kB,MAAM,0CAQlB,MAJmB,iBAAR4kB,IACTA,EAAMia,EAAQja,EAAKzV,GAAeyV,EAAKvV,KAGlCuV,CACT,KCjGWqjC,GAA4B3+D,GAH5B,MACQ,CAAC,QAAS,SAAU,UAAW,UAAW,UAEM0D,IAA2D,IAA1D,MAAE4C,EAAK,OAAEyf,EAAM,QAAEwvB,EAAO,QAAEkM,EAASxjC,MAAO22C,GAAWlxD,EAgCzH,OAAO4C,EAnCI,MAmCQ,CAEjB,iBAAkBs4D,EAGlB,qCAAsC,SAAU/zC,EAAOmX,GACrD,OAAO+B,GAAOlZ,EAAOmX,EAAIniB,UAAWg/C,EACtC,EAGA,MAAO,SAAUlyD,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,0CAGtB,OAAO63D,EAAKjyD,EACd,IAUF,SAASkyD,EAAWh+D,EAAGC,GACrB,IACE,OAAO2gD,EAAQ5gD,EAAGC,GAAKD,EAAIC,CAC7B,CAAE,MAAOmM,GACP,MAAM8nD,GAAoB9nD,EAAK,MAAOnM,EACxC,CACF,CAQA,SAAS89D,EAAM/zC,GACb,IAAIjd,EAcJ,GAZA44B,GAAY3b,GAAO,SAAUhjB,GAC3B,KACM+sD,EAAU/sD,SAEKlE,IAARiK,GAAqB6zC,EAAQ55C,EAAO+F,MAD7CA,EAAM/F,EAIV,CAAE,MAAOoF,GACP,MAAM8nD,GAAoB9nD,EAAK,MAAOpF,EACxC,CACF,SAEYlE,IAARiK,EACF,MAAM,IAAI8I,MAAM,0CAQlB,MAJmB,iBAAR9I,IACTA,EAAM2nC,EAAQ3nC,EAAKiY,GAAejY,EAAKmY,KAGlCnY,CACT,KC/FWkxD,GAAkD9+D,GANlD,uBACQ,CACnB,UACA,gBAGyF0D,IAA8B,IAA7B,QAAE+9C,EAAO,YAAEn3B,GAAa5mB,EAClH,SAASq7D,EAAsBn6D,EAAMq7B,GACnC,KAAM5/B,gBAAgB0+D,GAAyB,MAAM,IAAIhzD,YAAY,oDACrE,GAAIk0B,IAAa1e,EAAS0e,GAAa,MAAM,IAAIvpB,MAAM,qBAAuBupB,GAE9E,GAAIze,EAAS5c,IAASmB,EAAQnB,GAAO,CAEnC,MAAMmmB,EAAS,IAAIT,EAAY1lB,EAAMq7B,GAErC5/B,KAAKwiC,MAAQ9X,EAAO8X,MACpBxiC,KAAKiiC,MAAQvX,EAAOuX,MACpBjiC,KAAKqoC,UAAY3d,EAAO2d,UACxBroC,KAAKu+D,KAAO,KACZv+D,KAAKo+D,KAAO,IACd,MAAO,GAAI75D,GAAQmB,EAAQnB,EAAKA,OAASmB,EAAQnB,EAAK0b,MAEpDjgB,KAAKwiC,MAAQj+B,EAAKA,KAClBvE,KAAKiiC,MAAQ19B,EAAK0b,KAClBjgB,KAAKqoC,UAAY9jC,EAAKq7B,SACtB5/B,KAAKu+D,UAA2B,IAAbh6D,EAAKgJ,IAAsBhJ,EAAKgJ,IAAM,KACzDvN,KAAKo+D,UAA2B,IAAb75D,EAAKmJ,IAAsBnJ,EAAKmJ,IAAM,SACpD,IAAInJ,EAET,MAAM,IAAImC,UAAU,6BAA+B8c,GAAOjf,GAAQ,KAGlEvE,KAAKwiC,MAAQ,GACbxiC,KAAKiiC,MAAQ,CAAC,GACdjiC,KAAKqoC,UAAYzI,EACjB5/B,KAAKu+D,KAAO,KACZv+D,KAAKo+D,KAAO,IACd,CACF,CA4KA,OA1KAM,EAAqB97D,UAAY,IAAIqnB,EAKrCy0C,EAAqB97D,UAAUyD,KAAO,uBACtCq4D,EAAqB97D,UAAU+7D,wBAAyB,EAexDD,EAAqB97D,UAAUi9B,OAAS,SAAU17B,GAChD,OAAQ1B,UAAU1B,QAChB,KAAK,EACL,CAEE,MAAMgvB,EAAI9F,EAAYrnB,UAAUi9B,OAAO/8B,KAAK9C,KAAMmE,GAElD,OAAIgd,EAAS4O,GAEJ,IAAI2uC,EAAqB,CAC9Bn6D,KAAMwrB,EAAEyS,MACRviB,KAAM8P,EAAEkS,MACRrC,SAAU7P,EAAEsY,YAGTtY,CACT,CAEA,KAAK,EACL,KAAK,EACH,MAAM,IAAI1Z,MAAM,4DAElB,QACE,MAAM,IAAI3K,YAAY,6BAE5B,EAWAgzD,EAAqB97D,UAAUqE,IAAM,WACnC,MAAM,IAAIoP,MAAM,oDAClB,EAcAqoD,EAAqB97D,UAAUm9B,OAAS,WACtC,MAAM,IAAI1pB,MAAM,uDAClB,EAOAqoD,EAAqB97D,UAAUo9B,QAAU,WACvC,MAAM,IAAI3pB,MAAM,wDAClB,EAMAqoD,EAAqB97D,UAAU6gB,MAAQ,WACrC,OAAO,IAAIi7C,EAAqB,CAC9Bn6D,KAAMkf,GAAMzjB,KAAKwiC,OACjBviB,KAAMwD,GAAMzjB,KAAKiiC,OACjBrC,SAAU5/B,KAAKqoC,WAEnB,EAMAq2B,EAAqB97D,UAAUmoB,OAAS,WACtC,MAAO,CACLC,OAAQ,uBACRzmB,KAAMvE,KAAKwiC,MACXviB,KAAMjgB,KAAKiiC,MACXrC,SAAU5/B,KAAKqoC,UAEnB,EASAq2B,EAAqBzzC,SAAW,SAAUC,GACxC,OAAO,IAAIwzC,EAAqBxzC,EAClC,EAUAwzC,EAAqB97D,UAAU+nC,SAAW,WACxC,MAAM,IAAIt0B,MAAM,yDAClB,EAMAqoD,EAAqB97D,UAAU2K,IAAM,WAEnC,GAAkB,OAAdvN,KAAKu+D,KAAe,CAEtB,IAAIxuC,EAAI,KAER/vB,KAAKkE,SAAQ,SAAUtD,IACX,OAANmvB,GAAcqxB,EAAQxgD,EAAGmvB,MAAMA,EAAInvB,EACzC,IACAZ,KAAKu+D,KAAa,OAANxuC,EAAaA,OAAIzsB,CAC/B,CACA,OAAOtD,KAAKu+D,IACd,EAMAG,EAAqB97D,UAAU8K,IAAM,WAEnC,GAAkB,OAAd1N,KAAKo+D,KAAe,CAEtB,IAAIruC,EAAI,KAER/vB,KAAKkE,SAAQ,SAAUtD,IACX,OAANmvB,GAAcqxB,EAAQrxB,EAAGnvB,MAAMmvB,EAAInvB,EACzC,IACAZ,KAAKo+D,KAAa,OAANruC,EAAaA,OAAIzsB,CAC/B,CACA,OAAOtD,KAAKo+D,IACd,EAEOM,CAAoB,GAC1B,CAAEvzC,SAAS,IC/MDyzC,GAAmCj/D,GAHnC,QACQ,CAAC,uBAAwB,sBAE8B0D,IAAiD,IAAhD,qBAAEq7D,EAAoB,kBAAEG,GAAmBx7D,EAuBtH,SAAS0iD,EAAO9c,GACd,KAAMjpC,gBAAgB+lD,GACpB,MAAM,IAAIr6C,YAAY,oDAGxB1L,KAAKsiC,YAAc,GACnBtiC,KAAKkiC,YAAc,GACnBliC,KAAK2tD,WAAY,EAEjB,IAAK,IAAI7rD,EAAI,EAAG8O,EAAKnO,UAAU1B,OAAQe,EAAI8O,EAAI9O,IAAK,CAClD,MAAMkO,EAAMvN,UAAUX,GAChBg9D,EAAap5D,EAAQsK,GACrB+uD,EAAc59C,EAASnR,GACvBgvD,SAAiBhvD,EACvB,IAAIivD,EAAa,KACjB,GAAI19C,EAAQvR,GACVhQ,KAAKsiC,YAAYtgC,KAAKgO,GACtBhQ,KAAK2tD,WAAY,OACZ,GAAImR,GAAcC,EAAa,CAEpC,IAAIhvC,EAE2B,YAA3B8uC,EAAkB7uD,IAChB8uD,IAAY/uC,EAAImvC,EAAuBC,GAAgCnvD,GAAKwP,YAC5Eu/C,IAAahvC,EAAImvC,EAAuBC,GAAgCnvD,EAAIwyB,OAAOhjB,YACvFy/C,EAAajvD,EAAIwP,UAAUze,QAE3BgvB,EAAImvC,EAAuBlvD,EAAIwP,WAGjCxf,KAAKsiC,YAAYtgC,KAAK+tB,GAEtB,MAAM9P,EAAO8P,EAAE9P,OAEK,IAAhBA,EAAKlf,QAA4B,IAAZkf,EAAK,IAA2B,OAAfg/C,IACxCj/D,KAAK2tD,WAAY,EAErB,MAAO,GAAgB,WAAZqR,EACTh/D,KAAKsiC,YAAYtgC,KAAKk9D,EAAuB,CAAClvD,UACzC,GAAgB,WAAZgvD,EACTh/D,KAAKsiC,YAAYtgC,KAAKk9D,EAAuB,CAAC70C,OAAOra,UAChD,IAAgB,WAAZgvD,EAIT,MAAM,IAAIt4D,UAAU,wEAFpB1G,KAAKsiC,YAAYtgC,KAAKgO,EAGxB,CACAhQ,KAAKkiC,YAAYlgC,KAAKi9D,EAExB,CACF,CAQA,SAASC,EAAwBlvD,GAE/B,IAAK,IAAIlO,EAAI,EAAG4kD,EAAI12C,EAAIjP,OAAQe,EAAI4kD,EAAG5kD,IACrC,GAAsB,iBAAXkO,EAAIlO,KAAoBujB,GAAUrV,EAAIlO,IAC/C,MAAM,IAAI4E,UAAU,qDAIxB,OAAO,IAAIg4D,EAAqB1uD,EAClC,CAuMA,OAnNA+1C,EAAMnjD,UAAUyD,KAAO,QACvB0/C,EAAMnjD,UAAU4e,SAAU,EAkB1BukC,EAAMnjD,UAAU6gB,MAAQ,WACtB,MAAMtf,EAAQ,IAAI4hD,EAIlB,OAHA5hD,EAAMm+B,YAAc7e,GAAMzjB,KAAKsiC,aAC/Bn+B,EAAMwpD,UAAY3tD,KAAK2tD,UACvBxpD,EAAM+9B,YAAcliC,KAAKkiC,YAClB/9B,CACT,EASA4hD,EAAM5gD,OAAS,SAAU8jC,GACvB,MAAM9kC,EAAQ,IAAI4hD,EAElB,OADAA,EAAMv4C,MAAMrJ,EAAO8kC,GACZ9kC,CACT,EAOA4hD,EAAMnjD,UAAUqd,KAAO,WACrB,MAAMA,EAAO,GAEb,IAAK,IAAIne,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IAAK,CACzD,MAAMjB,EAAIb,KAAKsiC,YAAYxgC,GAC3Bme,EAAKne,GAAmB,iBAANjB,EAAkB,EAAIA,EAAEof,OAAO,EACnD,CAEA,OAAOA,CACT,EAOA8lC,EAAMnjD,UAAU8K,IAAM,WACpB,MAAMoS,EAAS,GAEf,IAAK,IAAIhe,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IAAK,CACzD,MAAM0nC,EAAQxpC,KAAKsiC,YAAYxgC,GAC/Bge,EAAOhe,GAAuB,iBAAV0nC,EAAsBA,EAAQA,EAAM97B,KAC1D,CAEA,OAAOoS,CACT,EAOAimC,EAAMnjD,UAAU2K,IAAM,WACpB,MAAMuS,EAAS,GAEf,IAAK,IAAIhe,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IAAK,CACzD,MAAM0nC,EAAQxpC,KAAKsiC,YAAYxgC,GAC/Bge,EAAOhe,GAAuB,iBAAV0nC,EAAsBA,EAAQA,EAAMj8B,KAC1D,CAEA,OAAOuS,CACT,EASAimC,EAAMnjD,UAAUsB,QAAU,SAAUqM,GAClC,IAAK,IAAIzO,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IACpDyO,EAASvQ,KAAKsiC,YAAYxgC,GAAIA,EAAG9B,KAErC,EAQA+lD,EAAMnjD,UAAU2/B,UAAY,SAAUZ,GACpC,MAAmB,iBAARA,EACF,KAGF3hC,KAAKsiC,YAAYX,IAAQ,IAClC,EAMAokB,EAAMnjD,UAAUw8D,iBAAmB,WACjC,OAAmC,IAA5Bp/D,KAAKsiC,YAAYvhC,QAA+C,iBAAxBf,KAAKsiC,YAAY,EAClE,EAOAyjB,EAAMnjD,UAAUy8D,kBAAoB,WAClC,OAAOr/D,KAAKo/D,mBAAqBp/D,KAAKsiC,YAAY,GAAK,IACzD,EAUAyjB,EAAMnjD,UAAUgmC,SAAW,WACzB,OAAO5oC,KAAK2tD,SACd,EAQA5H,EAAMnjD,UAAU48B,QAAU,WACxB,MAAMhV,EAAQ,GACd,IAAK,IAAI1oB,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IAAK,CACzD,MAAMygC,EAAYviC,KAAKsiC,YAAYxgC,GACnC0oB,EAAMxoB,KAA2B,iBAAdugC,EAA0BA,EAAYA,EAAU/C,UACrE,CACA,OAAOhV,CACT,EAQAu7B,EAAMnjD,UAAU4c,QAAUumC,EAAMnjD,UAAU48B,QAO1CumB,EAAMnjD,UAAUgQ,SAAW,WACzB,MAAM0sD,EAAU,GAEhB,IAAK,IAAIx9D,EAAI,EAAG8O,EAAK5Q,KAAKsiC,YAAYvhC,OAAQe,EAAI8O,EAAI9O,IAAK,CACzD,MAAMygC,EAAYviC,KAAKsiC,YAAYxgC,GACV,iBAAdygC,EACT+8B,EAAQt9D,KAAK+lC,KAAKjH,UAAUyB,IAE5B+8B,EAAQt9D,KAAKugC,EAAU3vB,WAE3B,CAEA,MAAO,IAAM0sD,EAAQl3D,KAAK,MAAQ,GACpC,EAQA29C,EAAMnjD,UAAUmoB,OAAS,WACvB,MAAO,CACLC,OAAQ,QACRma,WAAYnlC,KAAKsiC,YAErB,EASAyjB,EAAM96B,SAAW,SAAUC,GACzB,OAAO66B,EAAM5gD,OAAO+lB,EAAKia,WAC3B,EAEO4gB,CAAK,GACX,CAAE56B,SAAS,IAOd,SAASg0C,GAAiCI,GAExC,MAAMC,EAAiB,GAMvB,OALAD,EAAkBr7D,SAAQ,CAACu7D,EAAMtwB,KAC3BswB,GACFD,EAAex9D,KAAKmtC,EACtB,IAEKqwB,CACT,CCxTA,MAGaE,GAA2C//D,GAH3C,gBACQ,CAAC,UAAW,WAEmD0D,IAAyB,IAAxB,QAAE+9C,EAAO,OAAEwJ,GAAQvnD,EACtG,MAAMs8D,EAAgB,EAAMryD,KAAK2Y,KAAK,EAAM3Y,KAAK8b,KAAK,IAAQ,GAO9D,SAASw2C,IACP,KAAM5/D,gBAAgB4/D,GAAkB,MAAM,IAAIl0D,YAAY,oDAG9D1L,KAAK6/D,SAAW,KAChB7/D,KAAKiiC,MAAQ,CACf,CAyKA,SAAS69B,EAAMpY,EAAS/kC,EAAMo9C,GAE5Bp9C,EAAKq9C,KAAKC,MAAQt9C,EAAKs9C,MACvBt9C,EAAKs9C,MAAMD,KAAOr9C,EAAKq9C,KACvBD,EAAOG,SAEHH,EAAOl+B,QAAUlf,IAAQo9C,EAAOl+B,MAAQlf,EAAKs9C,OAE3B,IAAlBF,EAAOG,SAAgBH,EAAOl+B,MAAQ,MAE1Clf,EAAKq9C,KAAOtY,EACZ/kC,EAAKs9C,MAAQvY,EAAQuY,MACrBvY,EAAQuY,MAAQt9C,EAChBA,EAAKs9C,MAAMD,KAAOr9C,EAElBA,EAAKo9C,OAAS,KAEdp9C,EAAKkpB,MAAO,CACd,CAQA,SAASs0B,EAAezY,EAAS/kC,GAE/B,MAAMo9C,EAASp9C,EAAKo9C,OAEfA,IAEAp9C,EAAKkpB,MAIRi0B,EAAKpY,EAAS/kC,EAAMo9C,GAEpBI,EAAcJ,IALdp9C,EAAKkpB,MAAO,EAOhB,CA5MA+zB,EAAch9D,UAAUyD,KAAO,gBAC/Bu5D,EAAch9D,UAAUw9D,iBAAkB,EAQ1CR,EAAch9D,UAAUy9D,OAAS,SAAU19D,EAAK6E,GAE9C,MAAMmb,EAAO,CACXhgB,MACA6E,QACA04D,OAAQ,GAGV,GAAIlgE,KAAK6/D,SAAU,CAEjB,MAAMnY,EAAU1nD,KAAK6/D,SAErBl9C,EAAKq9C,KAAOtY,EACZ/kC,EAAKs9C,MAAQvY,EAAQuY,MACrBvY,EAAQuY,MAAQt9C,EAChBA,EAAKs9C,MAAMD,KAAOr9C,EAEdy+B,EAAQz+C,EAAK+kD,EAAQ/kD,OAEvB3C,KAAK6/D,SAAWl9C,EAEpB,MAEEA,EAAKq9C,KAAOr9C,EACZA,EAAKs9C,MAAQt9C,EAEb3iB,KAAK6/D,SAAWl9C,EAKlB,OAFA3iB,KAAKiiC,QAEEtf,CACT,EAMAi9C,EAAch9D,UAAUqd,KAAO,WAC7B,OAAOjgB,KAAKiiC,KACd,EAMA29B,EAAch9D,UAAUyE,MAAQ,WAC9BrH,KAAK6/D,SAAW,KAChB7/D,KAAKiiC,MAAQ,CACf,EAMA29B,EAAch9D,UAAU09D,QAAU,WAChC,OAAsB,IAAftgE,KAAKiiC,KACd,EAOA29B,EAAch9D,UAAU29D,eAAiB,WAEvC,MAAM59C,EAAO3iB,KAAK6/D,SAElB,GAAa,OAATl9C,EAAiB,OAAOA,EAE5B,IAAI+kC,EAAU1nD,KAAK6/D,SAEfW,EAAmB79C,EAAKu9C,OAExB1/D,EAAImiB,EAAKkf,MAEb,KAAO2+B,EAAmB,GAAG,CAE3B,MAAMC,EAAYjgE,EAAEy/D,MAEpBz/D,EAAEw/D,KAAKC,MAAQz/D,EAAEy/D,MACjBz/D,EAAEy/D,MAAMD,KAAOx/D,EAAEw/D,KAEjBx/D,EAAEw/D,KAAOtY,EACTlnD,EAAEy/D,MAAQvY,EAAQuY,MAClBvY,EAAQuY,MAAQz/D,EAChBA,EAAEy/D,MAAMD,KAAOx/D,EAEfA,EAAEu/D,OAAS,KACXv/D,EAAIigE,EACJD,GACF,CAmBA,OAjBA79C,EAAKq9C,KAAKC,MAAQt9C,EAAKs9C,MACvBt9C,EAAKs9C,MAAMD,KAAOr9C,EAAKq9C,KAEnBr9C,IAASA,EAAKs9C,MAEhBvY,EAAU,MAGVA,EAAU/kC,EAAKs9C,MAEfvY,EAwHJ,SAA2BA,EAASznC,GAElC,MAAMwhB,EAAYn0B,KAAKsM,MAAMtM,KAAK2Y,IAAIhG,GAAQ0/C,GAAiB,EAEzDn1C,EAAQ,IAAI/kB,MAAMg8B,GAExB,IAWIhhC,EAXAigE,EAAW,EACXlgE,EAAIknD,EACR,GAAIlnD,EAGF,IAFAkgE,IACAlgE,EAAIA,EAAEy/D,MACCz/D,IAAMknD,GACXgZ,IACAlgE,EAAIA,EAAEy/D,MAMV,KAAOS,EAAW,GAAG,CAEnB,IAAI7/D,EAAIL,EAAE0/D,OAEV,MAAM5/D,EAAOE,EAAEy/D,MAEf,KAEEx/D,EAAI+pB,EAAM3pB,GACLJ,GAHM,CAKX,GAAImqD,EAAOpqD,EAAEmC,IAAKlC,EAAEkC,KAAM,CACxB,MAAMwzB,EAAO11B,EACbA,EAAID,EACJA,EAAI21B,CACN,CAEAwqC,EAAWlgE,EAAGD,GAEdgqB,EAAM3pB,GAAK,KACXA,GACF,CAEA2pB,EAAM3pB,GAAKL,EAEXA,EAAIF,EACJogE,GACF,CAEAhZ,EAAU,KAEV,IAAK,IAAI5lD,EAAI,EAAGA,EAAI2/B,EAAW3/B,IAE7BrB,EAAI+pB,EAAM1oB,GACLrB,IAEDinD,GAEFjnD,EAAEu/D,KAAKC,MAAQx/D,EAAEw/D,MACjBx/D,EAAEw/D,MAAMD,KAAOv/D,EAAEu/D,KAEjBv/D,EAAEu/D,KAAOtY,EACTjnD,EAAEw/D,MAAQvY,EAAQuY,MAClBvY,EAAQuY,MAAQx/D,EAChBA,EAAEw/D,MAAMD,KAAOv/D,EAEX2gD,EAAQ3gD,EAAEkC,IAAK+kD,EAAQ/kD,OAAQ+kD,EAAUjnD,IACtCinD,EAAUjnD,GAErB,OAAOinD,CACT,CA7LckZ,CAAiBlZ,EAAS1nD,KAAKiiC,QAG3CjiC,KAAKiiC,QAELjiC,KAAK6/D,SAAWnY,EAET/kC,CACT,EASAi9C,EAAch9D,UAAUi+D,OAAS,SAAUl+C,GAEzC3iB,KAAK6/D,SAWP,SAAuBnY,EAAS/kC,GAE9BA,EAAKhgB,KAb8C,EAenD,MAAMo9D,EAASp9C,EAAKo9C,OAUpB,OATIA,GAAU3e,EAAQz+B,EAAKhgB,IAAKo9D,EAAOp9D,OAErCm9D,EAAKpY,EAAS/kC,EAAMo9C,GAEpBI,EAAczY,EAASqY,IAGrB3e,EAAQz+B,EAAKhgB,IAAK+kD,EAAQ/kD,OAAQ+kD,EAAU/kC,GAEzC+kC,CACT,CA1BkBoZ,CAAa9gE,KAAK6/D,SAAUl9C,GAE5C3iB,KAAKugE,gBACP,EA4EA,MAAMI,EAAa,SAAUh+C,EAAMo9C,GAEjCp9C,EAAKq9C,KAAKC,MAAQt9C,EAAKs9C,MACvBt9C,EAAKs9C,MAAMD,KAAOr9C,EAAKq9C,KAEvBr9C,EAAKo9C,OAASA,EACTA,EAAOl+B,OAKVlf,EAAKq9C,KAAOD,EAAOl+B,MACnBlf,EAAKs9C,MAAQF,EAAOl+B,MAAMo+B,MAC1BF,EAAOl+B,MAAMo+B,MAAQt9C,EACrBA,EAAKs9C,MAAMD,KAAOr9C,IAPlBo9C,EAAOl+B,MAAQlf,EACfA,EAAKs9C,MAAQt9C,EACbA,EAAKq9C,KAAOr9C,GAQdo9C,EAAOG,SAEPv9C,EAAKkpB,MAAO,CACd,EAyEA,OAAO+zB,CAAa,GACnB,CAAEz0C,SAAS,ICnUD41C,GAAiCphE,GAHjC,MACQ,CAAC,YAAa,cAAe,kBAEwB0D,IAA+C,IAA9C,UAAEy6C,EAAS,YAAElQ,EAAW,cAAEgyB,GAAev8D,EAKlH,SAAS29D,IACP,KAAMhhE,gBAAgBghE,GAAQ,MAAM,IAAIt1D,YAAY,oDAGpD1L,KAAKksC,QAAU,GACflsC,KAAKihE,MAAQ,IAAIrB,CACnB,CA8GA,OAzGAoB,EAAIp+D,UAAUyD,KAAO,MACrB26D,EAAIp+D,UAAUs+D,OAAQ,EAQtBF,EAAIp+D,UAAUqE,IAAM,SAAUnF,EAAGlB,GAE/B,GAAKZ,KAAKksC,QAAQpqC,GAOhB9B,KAAKksC,QAAQpqC,GAAG0F,MAAQ5G,MAPJ,CAEpB,MAAM+hB,EAAO3iB,KAAKihE,MAAMZ,OAAOv+D,EAAGlB,GAElCZ,KAAKksC,QAAQpqC,GAAK6gB,CACpB,CAIF,EAEAq+C,EAAIp+D,UAAU0D,IAAM,SAAUxE,GAC5B,MAAM6gB,EAAO3iB,KAAKksC,QAAQpqC,GAC1B,OAAI6gB,EAAeA,EAAKnb,MACjB,CACT,EAEAw5D,EAAIp+D,UAAUu+D,WAAa,SAAUr/D,EAAGlB,GAEtC,IAAI+hB,EAAO3iB,KAAKksC,QAAQpqC,GACnB6gB,EAOHA,EAAKnb,MAAQs2C,EAAUn7B,EAAKnb,MAAO5G,IALnC+hB,EAAO3iB,KAAKihE,MAAMZ,OAAOv+D,EAAGlB,GAE5BZ,KAAKksC,QAAQpqC,GAAK6gB,EAKtB,EAEAq+C,EAAIp+D,UAAUsB,QAAU,SAAU+G,EAAM6L,EAAIvG,GAE1C,MAAM6wD,EAAOphE,KAAKihE,MACZnhD,EAAS9f,KAAKksC,QAEdm1B,EAAQ,GAEd,IAAI1+C,EAAOy+C,EAAKb,iBAGhB,IAFI59C,GAAQ0+C,EAAMr/D,KAAK2gB,GAEhBA,GAAQA,EAAKhgB,KAAOmU,GAErB6L,EAAKhgB,KAAOsI,IAET2iC,EAAYjrB,EAAKnb,MAAO,IAE3B+I,EAASoS,EAAKhgB,IAAKggB,EAAKnb,MAAOxH,OAInC2iB,EAAOy+C,EAAKb,iBACR59C,GAAQ0+C,EAAMr/D,KAAK2gB,GAGzB,IAAK,IAAI7gB,EAAI,EAAGA,EAAIu/D,EAAMtgE,OAAQe,IAAK,CAErC,MAAMuC,EAAIg9D,EAAMv/D,GAEhB6gB,EAAOy+C,EAAKf,OAAOh8D,EAAE1B,IAAK0B,EAAEmD,OAE5BsY,EAAO6C,EAAKhgB,KAAOggB,CACrB,CACF,EAEAq+C,EAAIp+D,UAAU0+D,KAAO,SAAUx/D,EAAGC,GAEhC,IAAIw/D,EAAQvhE,KAAKksC,QAAQpqC,GACrB0/D,EAAQxhE,KAAKksC,QAAQnqC,GAEzB,IAAKw/D,GAASC,EAEZD,EAAQvhE,KAAKihE,MAAMZ,OAAOv+D,EAAG0/D,EAAMh6D,OAEnCxH,KAAKihE,MAAMJ,OAAOW,GAElBxhE,KAAKksC,QAAQpqC,GAAKy/D,EAClBvhE,KAAKksC,QAAQnqC,QAAKuB,OACb,GAAIi+D,IAAUC,EAEnBA,EAAQxhE,KAAKihE,MAAMZ,OAAOt+D,EAAGw/D,EAAM/5D,OAEnCxH,KAAKihE,MAAMJ,OAAOU,GAElBvhE,KAAKksC,QAAQnqC,GAAKy/D,EAClBxhE,KAAKksC,QAAQpqC,QAAKwB,OACb,GAAIi+D,GAASC,EAAO,CAEzB,MAAM5gE,EAAI2gE,EAAM/5D,MAChB+5D,EAAM/5D,MAAQg6D,EAAMh6D,MACpBg6D,EAAMh6D,MAAQ5G,CAChB,CACF,EAEOogE,CAAG,GACT,CAAE71C,SAAS,IC5HP,SAASs2C,GAAUjlD,GACxB,IAAIyD,EAAO,EACP0G,EAAO,EACP+6C,EAAQp/D,OAAO6C,OAAO,MACtBuE,EAAMpH,OAAO6C,OAAO,MACpBhB,EAAQ,EACZ,MAAMsvD,EAAM,SAAUx1C,GACpB,MAAM0jD,EAAWj4D,EAAIuU,GACrB,GAAK0jD,WACED,EAAMC,UACNj4D,EAAIuU,KACTgC,EACE0G,IAASg7C,GAAb,CACA,IAAK1hD,EAGH,OAFA9b,EAAQ,OACRwiB,EAAO,GAGT,MAAQrkB,OAAOM,UAAUC,eAAeC,KAAK4+D,IAAS/6C,KANzB,CAO/B,EAEA,OADAnK,EAAQlP,KAAKsa,IAAIpL,GACV,CACLolD,IAAK,SAAU3jD,GACb,MAAM0jD,EAAWj4D,EAAIuU,GAAW4jD,IAAY19D,EAG5C,GAFAu9D,EAAMG,GAAW5jD,EACjBvU,EAAIuU,GAAM4jD,GACLF,EAAU,CAEb,KADE1hD,EACEA,GAAQzD,EAAO,OAGnB,OAFAyB,EAAKyjD,EAAM/6C,GACX8sC,EAAIx1C,GACGA,CACT,CAEA,UADOyjD,EAAMC,GACTh7C,IAASg7C,EACb,MAAQr/D,OAAOM,UAAUC,eAAeC,KAAK4+D,IAAS/6C,KAExD,EACA3G,OAAQyzC,EACRpsD,MAAO,WACL4Y,EAAO9b,EAAQ,EACfwiB,EAAO,EACP+6C,EAAQp/D,OAAO6C,OAAO,MACtBuE,EAAMpH,OAAO6C,OAAO,KACtB,EAEJ,CC9BO,SAAS28D,GAASh6D,GAA4B,IAAxB,OAAEi6D,EAAM,MAAEvlD,GAAO/Z,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAIhD,OAHA+Z,EAAiB,MAATA,EAAgB6N,OAAO23C,kBAAoBxlD,EACnDulD,EAAmB,MAAVA,EAAiBh6B,KAAKjH,UAAYihC,EAEpC,SAASD,IACe,iBAAlBA,EAAQG,QACjBH,EAAQG,MAAQ,CACdniD,OAAQ,IAAIxY,IACZ46D,IAAKT,GAASjlD,GAAS6N,OAAO23C,qBAGlC,MAAM11D,EAAO,GACb,IAAK,IAAIxK,EAAI,EAAGA,EAAIW,UAAU1B,OAAQe,IACpCwK,EAAKxK,GAAKW,UAAUX,GAEtB,MAAMqgE,EAAOJ,EAAOz1D,GAEpB,GAAIw1D,EAAQG,MAAMniD,OAAO9Y,IAAIm7D,GAE3B,OADAL,EAAQG,MAAMC,IAAIN,IAAIO,GACfL,EAAQG,MAAMniD,OAAOxZ,IAAI67D,GAGlC,MAAMC,EAASt6D,EAAG0F,MAAM1F,EAAIwE,GAI5B,OAHAw1D,EAAQG,MAAMniD,OAAO7Y,IAAIk7D,EAAMC,GAC/BN,EAAQG,MAAMniD,OAAOE,OAAO8hD,EAAQG,MAAMC,IAAIN,IAAIO,IAE3CC,CACT,CACF,CCxCO,MAAMC,GAAmBP,IAAQ,SAAU/3C,GAChD,OAAO,IAAIA,EAAU,GAAGvD,KAC1B,GAAG,CAAEu7C,YAOQO,GAAqBR,IAAQ,SAAU/3C,GAClD,OAAO,IAAIA,EAAU,GAAG4F,KAAK,IAAI5F,EAAU,GAAGX,QAAQoH,IAAI,EAC5D,GAAG,CAAEuxC,YAOQQ,GAAoBT,IAAQ,SAAU/3C,GACjD,OAAOA,EAAU2H,MAAM,EACzB,GAAG,CAAEqwC,YAOQS,GAAqBV,IAAQ,SAAU/3C,GAClD,OAAOw4C,GAAkBx4C,GAAWyF,MAAM,EAC5C,GAAG,CAAEuyC,YAUL,SAASA,GAAQz1D,GACf,OAAOA,EAAK,GAAG0a,SACjB,CCzCA,MAsBay7C,GAAkC9iE,GAtBlC,OACQ,CACnB,MACA,SACA,YACA,iBACA,iBACA,eACA,MACA,MACA,MACA,QACA,QACA,YACA,SACA,SACA,SACA,UACA,YACA,aAGyE0D,IAmBrE,IAnBsE,GAC1EyV,EAAE,OACF4M,EAAM,UACNo4B,EAAS,eACTiD,EAAc,eACdhD,EAAc,aACdkR,EAAY,IACZ/0C,EAAG,IACH0N,EAAG,IACH86C,EAAG,MACHn9C,EAAK,MACL47B,EAAK,UACL5T,EAAS,OACTzmB,EAAM,OACN8uC,EAAM,OACNjwC,EAAM,QACNqE,EAAO,UACPD,EAAS,SACTG,GACD7mB,EACC,MAAMolB,EAAW9C,EAoBjB,SAASsnB,EAAMzlC,EAAOwqC,GACpB,KAAMhyC,gBAAgBitC,GACpB,MAAM,IAAI52B,MAAM,oDAGlB,GAAM7O,UAAyC+lC,EAAU/lC,KAAUuZ,EAAUvZ,GAC3E,MAAM,IAAId,UAAU,kGAWtB,GARA1G,KAAKw1C,WAAY,EAMjBx1C,KAAK2iE,6BAA8B,OAEbr/D,IAAlB0uC,EACFhyC,KAAK0gD,MAAQ,GACb1gD,KAAKmlC,WAAay9B,EAAgBl5D,KAAIlJ,GAAK,SACtC,GAA6B,iBAAlBwxC,EAA4B,CAC5C,MAAMrZ,EAAIsU,EAAK1vB,MAAMy0B,GACrBhyC,KAAK0gD,MAAQ/nB,EAAE+nB,MACf1gD,KAAKmlC,WAAaxM,EAAEwM,UACtB,KAAO,KAAIlkB,EAAO+wB,IAA0C,OAAxBA,EAAcxqC,MAOhD,MAAM,IAAId,UAAU,2EALpB1G,KAAKw1C,UAAYxD,EAAcwD,UAC/Bx1C,KAAK2iE,4BAA8B3wB,EAAc2wB,4BACjD3iE,KAAKmlC,WAAa6M,EAAc7M,WAAWjjC,MAAM,GACjDlC,KAAK0gD,MAAQ1O,EAAc0O,MAAMh3C,KAAIivB,GAAKt2B,GAAc,CAAC,EAAGs2B,IAG9D,CAEA34B,KAAKwH,MAAQxH,KAAKqqD,WAAW7iD,EAC/B,CAWA,IAAI+4B,EAAMp8B,EAAOO,EAEjB,SAASm+D,IACP,KAAa,MAANn+D,GAAmB,OAANA,GAClBpE,GAEJ,CAMA,SAASwiE,EAASp+D,GAChB,OAASA,GAAK,KAAOA,GAAK,GAC5B,CAEA,SAASpE,IACP6D,IACAO,EAAI67B,EAAKvS,OAAO7pB,EAClB,CAEA,SAAS4+D,EAAQpB,GACfx9D,EAAQw9D,EACRj9D,EAAI67B,EAAKvS,OAAO7pB,EAClB,CAEA,SAAS6+D,IACP,IAAIr9C,EAAS,GACb,MAAMg8C,EAAWx9D,EASjB,GAPU,MAANO,EACFpE,IACe,MAANoE,IACTihB,GAAUjhB,EACVpE,MA1BJ,SAAqBoE,GACnB,OAASA,GAAK,KAAOA,GAAK,KAAc,MAANA,CACpC,CA2BOu+D,CAAWv+D,GAGd,OADAq+D,EAAOpB,GACA,KAIT,GAAU,MAANj9D,GAGF,GAFAihB,GAAUjhB,EACVpE,KACKwiE,EAAQp+D,GAGX,OADAq+D,EAAOpB,GACA,SAEJ,CACL,KAAOmB,EAAQp+D,IACbihB,GAAUjhB,EACVpE,IAEQ,MAANoE,IACFihB,GAAUjhB,EACVpE,IAEJ,CACA,KAAOwiE,EAAQp+D,IACbihB,GAAUjhB,EACVpE,IAIF,GAAU,MAANoE,GAAmB,MAANA,EAAW,CAG1B,IAAIw+D,EAAkB,GACtB,MAAMC,EAAiBh/D,EAWvB,GATA++D,GAAmBx+D,EACnBpE,IAEU,MAANoE,GAAmB,MAANA,IACfw+D,GAAmBx+D,EACnBpE,MAIGwiE,EAAQp+D,GAGX,OADAq+D,EAAOI,GACAx9C,EAKT,IADAA,GAAkBu9C,EACXJ,EAAQp+D,IACbihB,GAAUjhB,EACVpE,GAEJ,CAEA,OAAOqlB,CACT,CAEA,SAASy9C,IACP,IAAIC,EAAW,GAGf,KAAOP,EAAQp+D,IAAMuoC,EAAKq2B,aAAa5+D,IACrC2+D,GAAY3+D,EACZpE,IAIF,MAAMijE,EAASF,EAASr1C,OAAO,GAC/B,OAAIif,EAAKq2B,aAAaC,GACbF,EAEA,IAEX,CAEA,SAASG,EAAgBC,GACvB,OAAI/+D,IAAM++D,GACRnjE,IACOmjE,GAEA,IAEX,CAnIAnhE,OAAOwT,eAAem3B,EAAM,OAAQ,CAAEzlC,MAAO,SAC7CylC,EAAKrqC,UAAUyC,YAAc4nC,EAC7BA,EAAKrqC,UAAUyD,KAAO,OACtB4mC,EAAKrqC,UAAUqe,QAAS,EA4IxBgsB,EAAK1vB,MAAQ,SAAUna,EAAK4E,GAM1B,GALAA,EAAUA,GAAW,CAAC,EACtBu4B,EAAOn9B,EACPe,GAAS,EACTO,EAAI,GAEgB,iBAAT67B,EACT,MAAM,IAAI75B,UAAU,mDAGtB,MAAMqrC,EAAO,IAAI9E,EACjB8E,EAAK2O,MAAQ,GAEb,IAAIgjB,EAAyB,EACzBC,GAAgB,EAgBpBrjE,IACAuiE,IAGA,MAAMpiC,EAAWuiC,IACjB,IAAIx7D,EAAQ,KACZ,GAAIi5B,EAAU,CACZ,GAAsB,cAAlB/a,EAAOC,OACTne,EAAQ,IAAIuiB,EAAU0W,QACjB,GAAsB,aAAlB/a,EAAOC,OAChB,IAEEne,EAAQ,IAAI0iB,EAASuW,EACvB,CAAE,MAAO7zB,GACPpF,EAAQmW,WAAW8iB,EACrB,MAEAj5B,EAAQmW,WAAW8iB,GAGrBoiC,IAGIW,EAAe,MACjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,OACxBE,GAA0B,EAC1BC,GAAgB,EAEpB,CAGA,MAAMC,EAAuB,GAG7B,IAAIC,EAA8B,EAElC,OAAa,CAKX,IAJAhB,IAIa,MAANn+D,GACLk/D,EAAqB5hE,KAAK0hE,GAC1BG,GAA+BH,EAC/BA,EAAyB,EACzBpjE,IACAuiE,IAIF,IAAIiB,EACJ,IAAIp/D,EAQF,MARK,CACL,MAAMq/D,EAAOr/D,EAEb,GADAo/D,EAAOV,IACM,OAATU,EACF,MAAM,IAAIp4D,YAAY,eAAiBq4D,EAAO,SAAWxjC,EAAO,cAAgBp8B,EAAMyO,WAE1F,CAMA,MAAMqoB,EAAM+oC,EAAUF,GACtB,GAAY,OAAR7oC,EAEF,MAAM,IAAIvvB,YAAY,SAAWo4D,EAAO,gBAG1C,IAAIG,EAAQP,EAAyBG,EAGrC,GADAhB,IACIW,EAAe,KAAM,CACvBX,IACA,MAAMl5D,EAAIq5D,IACV,GAAU,OAANr5D,EAEF,MAAM,IAAI+B,YAAY,OAAStI,EAAM,sDAEvC6gE,GAASt6D,CACX,CAGAooC,EAAK2O,MAAM1+C,KAAK,CACd+vC,KAAM9W,EAAI8W,KACVnrB,OAAQqU,EAAIrU,OACZq9C,UAEF,IAAK,IAAIniE,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAC1CiwC,EAAK5M,WAAWrjC,KAAOm5B,EAAI8W,KAAK5M,WAAWrjC,IAAM,GAAKmiE,EAMxD,IADApB,IACa,MAANn+D,GAAW,CAChB,GAAoC,IAAhCk/D,EAAqB7iE,OACvB,MAAM,IAAI2K,YAAY,qBAAuB60B,EAAO,cAAgBp8B,EAAMyO,YAE5EixD,GAA+BD,EAAqB76C,MACpDzoB,IACAuiE,GACF,CAoBA,GAhBAc,GAAgB,EAEZH,EAAe,MAEjBE,EAAyB,EACzBC,GAAgB,GACPH,EAAe,MAExBE,GAA0B,EAC1BC,GAAgB,GAGhBD,EAAyB,EAIvBzoC,EAAI8W,KAAKprB,KAAM,CACjB,MAAMu9C,EAAUjpC,EAAI8W,KAAKprB,KAAKhkB,IAC9BwhE,EAAaC,KAAKF,GAAW,CAC3BnyB,KAAM9W,EAAI8W,KACVnrB,OAAQqU,EAAIrU,OAEhB,CACF,CAIA,GADAi8C,IACIn+D,EACF,MAAM,IAAIgH,YAAY,qBAAuBtI,EAAM,KAIrD,GAAIugE,EACF,MAAM,IAAIj4D,YAAY,yBAA2BtI,EAAM,KAIzD,GAAoC,IAAhCwgE,EAAqB7iE,OACvB,MAAM,IAAI2K,YAAY,qBAAuB60B,EAAO,KAItD,GAA0B,IAAtBwR,EAAK2O,MAAM3/C,SAAiBiH,EAAQq8D,aACtC,MAAM,IAAI34D,YAAY,IAAMtI,EAAM,uBAIpC,OADA2uC,EAAKvqC,WAAmBlE,IAAVkE,EAAuBuqC,EAAKsY,WAAW7iD,GAAS,KACvDuqC,CACT,EAOA9E,EAAKrqC,UAAU6gB,MAAQ,WACrB,MAAMsuB,EAAO,IAAI9E,EAEjB8E,EAAKyD,UAAYx1C,KAAKw1C,UACtBzD,EAAK4wB,4BAA8B3iE,KAAK2iE,4BAExC5wB,EAAKvqC,MAAQic,GAAMzjB,KAAKwH,OACxBuqC,EAAK5M,WAAanlC,KAAKmlC,WAAWjjC,MAAM,GACxC6vC,EAAK2O,MAAQ,GACb,IAAK,IAAI5+C,EAAI,EAAGA,EAAI9B,KAAK0gD,MAAM3/C,OAAQe,IAAK,CAC1CiwC,EAAK2O,MAAM5+C,GAAK,CAAE,EAClB,IAAK,MAAM6H,KAAK3J,KAAK0gD,MAAM5+C,GACrBe,GAAe7C,KAAK0gD,MAAM5+C,GAAI6H,KAChCooC,EAAK2O,MAAM5+C,GAAG6H,GAAK3J,KAAK0gD,MAAM5+C,GAAG6H,GAGvC,CAEA,OAAOooC,CACT,EAQA9E,EAAKrqC,UAAUsqC,UAAY,WACzB,OAAO1pB,GAAOxjB,KAAKwH,MACrB,EAQAylC,EAAKrqC,UAAU69C,WAAa,WAC1B,OAA0B,IAAtBzgD,KAAK0gD,MAAM3/C,SAGRf,KAAK0gD,MAAM3/C,OAAS,GAAKuM,KAAKsa,IAAI5nB,KAAK0gD,MAAM,GAAGujB,MAAQ,GAAO,MACxE,EASAh3B,EAAKrqC,UAAUynD,WAAa,SAAU7iD,GACpC,GAAIA,SAA+D,IAAtBxH,KAAK0gD,MAAM3/C,OACtD,OAAOyG,EAET,IAAIyzB,EAAMzzB,EACV,MAAMuI,EAAUk9B,EAAKq3B,oBAAoB9gD,GAAOhc,IAEhD,IAAK,IAAI1F,EAAI,EAAGA,EAAI9B,KAAK0gD,MAAM3/C,OAAQe,IAAK,CAC1C,MAAMyiE,EAAYx0D,EAAQ/P,KAAK0gD,MAAM5+C,GAAGiwC,KAAKvqC,OACvCg9D,EAAkBz0D,EAAQ/P,KAAK0gD,MAAM5+C,GAAG8kB,OAAOpf,OAC/Ci9D,EAAY10D,EAAQ/P,KAAK0gD,MAAM5+C,GAAGmiE,OACxChpC,EAAM8iB,EAAe9iB,EAAK/gB,EAAI6jC,EAAewmB,EAAWC,GAAkBC,GAC5E,CAEA,OAAOxpC,CACT,EAUAgS,EAAKrqC,UAAU8hE,aAAe,SAAUl9D,EAAOm9D,GAC7C,GAAIn9D,SAA+D,IAAtBxH,KAAK0gD,MAAM3/C,OACtD,OAAOyG,EAET,IAAIyzB,EAAMzzB,EACV,MAAMuI,EAAUk9B,EAAKq3B,oBAAoB9gD,GAAOhc,IAEhD,IAAK,IAAI1F,EAAI,EAAGA,EAAI9B,KAAK0gD,MAAM3/C,OAAQe,IAAK,CAC1C,MAAMyiE,EAAYx0D,EAAQ/P,KAAK0gD,MAAM5+C,GAAGiwC,KAAKvqC,OACvCg9D,EAAkBz0D,EAAQ/P,KAAK0gD,MAAM5+C,GAAG8kB,OAAOpf,OAC/Ci9D,EAAY10D,EAAQ/P,KAAK0gD,MAAM5+C,GAAGmiE,OACxChpC,EAAMg0B,EAAah0B,EAAK/gB,EAAI6jC,EAAewmB,EAAWC,GAAkBC,GAC1E,CAEA,OAAOxpC,CACT,EAUA,MAAM+oC,EAAYlC,IAAS1+D,IAEzB,GAAIP,GAAe+hE,EAAOxhE,GAAM,CAC9B,MAAM2uC,EAAO6yB,EAAMxhE,GAEnB,MAAO,CAAE2uC,OAAMnrB,OADAmrB,EAAK8yB,SAAS,IAE/B,CAEA,IAAK,MAAMt/D,KAAQq/D,EACjB,GAAI/hE,GAAe+hE,EAAOr/D,IACpB+6B,GAASl9B,EAAKmC,GAAO,CACvB,MAAMwsC,EAAO6yB,EAAMr/D,GACbu/D,EAAa1hE,EAAIrC,OAASwE,EAAKxE,OAC/BgkE,EAAa3hE,EAAIi1B,UAAU,EAAGysC,GAC9Bl+C,EAAS/jB,GAAekvC,EAAK8yB,SAAUE,GACzChzB,EAAK8yB,SAASE,QACdzhE,EACJ,QAAeA,IAAXsjB,EAEF,MAAO,CAAEmrB,OAAMnrB,SAEnB,CAIJ,OAAO,IAAI,GACV,CAAEm7C,OAASz1D,GAASA,EAAK,GAAIkQ,MAAO,MAqMvC,SAASwoD,EAAsBjzB,GAC7B,OAAIA,EAAK/D,UAAUi3B,EAAWC,OAAwB,OAAfnzB,EAAKvqC,QAAmBke,EAAOu3B,YAC7DlL,EAAKvqC,MAELuqC,CAEX,CAQA,SAAS/gB,EAAKm0C,GAOZ,OAFgBl4B,EAAKq3B,oBAAoB9gD,GAAO2hD,GAEzCp1D,CAAQ,EACjB,CAgZA,SAASq1D,EAAYrzB,GAAoB,IAAd/pC,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAGpC,MAAM4iE,EAAOtzB,EAAK4wB,6BAA8C,OAAf5wB,EAAKvqC,MAClDuqC,EAAKtuB,QACLsuB,EAAKuzB,YAsBX,SAA8BD,GAC5B,IAAIE,GAAc,OACU,IAAhBF,EAAK79D,OAAyC,OAAf69D,EAAK79D,OAAkBuZ,EAAUskD,EAAK79D,SAE/E+9D,EAAcj4D,KAAKsa,IAAIy9C,EAAK79D,MAAMoV,IAAM,OAE1C,IAAK,MAAM9a,KAAKujE,EAAK3kB,MACf79C,GAAewiE,EAAK3kB,MAAO5+C,IACzBujE,EAAK3kB,MAAM5+C,GAAGiwC,OACgB,OAA5BszB,EAAK3kB,MAAM5+C,GAAGiwC,KAAKxsC,MAAiBggE,EACtCF,EAAK3kB,MAAM5+C,GAAGiwC,KAAO6yB,EAAMY,IACU,QAA5BH,EAAK3kB,MAAM5+C,GAAGiwC,KAAKxsC,MAAmBggE,IAC/CF,EAAK3kB,MAAM5+C,GAAGiwC,KAAO6yB,EAAMa,IAKrC,CApCEC,CAAoBL,GA0CtB,SAAkCA,EAAM11D,GACZ,IAAtB01D,EAAK3kB,MAAM3/C,QAAiBskE,EAAK7vB,WAG/BloC,KAAKsa,IAAIy9C,EAAK3kB,MAAM,GAAGujB,MAAQ32D,KAAKiY,MAAM8/C,EAAK3kB,MAAM,GAAGujB,QAAU,QAEpEoB,EAAK3kB,MAAM,GAAG95B,OAASy+C,EAAKM,YAAYh2D,GAG9C,CAhDEi2D,CAAwBP,EAAMr9D,EAAQ2H,QAEtC,MAAMnI,EAAQ69D,EAAKX,aAAaW,EAAK79D,OAC/Bi5B,EAA2B,OAAf4kC,EAAK79D,MAAkBsf,EAAOtf,EAAOQ,GAAW,CAAC,GAAK,GAClE69D,EAAUR,EAAKhhB,cACrB,MAAO,CACLghB,OACA5kC,WACAolC,UAEJ,CAtnBA54B,EAAK64B,gBAAkB,SAAUvgE,GAC/B,OAA4B,OAApBy+D,EAAUz+D,EACpB,EAQA0nC,EAAKrqC,UAAUk5B,QAAU,SAAUnV,GAKjC,GAJsB,iBAAVA,IACVA,EAAOs+C,EAAWt+C,KAGfA,EAAQ,OAAO,EAGpB,IAAK,IAAI7kB,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAC1C,GAAIwL,KAAKsa,KAAK5nB,KAAKmlC,WAAWrjC,IAAM,IAAM6kB,EAAKwe,WAAWrjC,IAAM,IAAM,MACpE,OAAO,EAGX,OAAO,CACT,EASAmrC,EAAKrqC,UAAUorC,UAAY,SAAUh2B,GAEnC,IAAK,IAAIlW,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAC1C,GAAIwL,KAAKsa,KAAK5nB,KAAKmlC,WAAWrjC,IAAM,IAAMkW,EAAMmtB,WAAWrjC,IAAM,IAAM,MACrE,OAAO,EAGX,OAAO,CACT,EAQAmrC,EAAKrqC,UAAU+tB,OAAS,SAAU3Y,GAChC,OAAQhY,KAAKguC,UAAUh2B,IAAUmpC,EAAMnhD,KAAKwH,MAAOwQ,EAAMxQ,MAC3D,EAQAylC,EAAKrqC,UAAUq1C,SAAW,SAAU8tB,GAClC,MAAM9qC,EAAMj7B,KAAKyjB,QACXzL,EAAQiJ,EAAO8kD,GAAUA,EAAS,IAAI94B,EAAK84B,GAEjD,IAAK,IAAIjkE,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAE1Cm5B,EAAIkK,WAAWrjC,IAAM9B,KAAKmlC,WAAWrjC,IAAM,IAAMkW,EAAMmtB,WAAWrjC,IAAM,GAI1E,IAAK,IAAIA,EAAI,EAAGA,EAAIkW,EAAM0oC,MAAM3/C,OAAQe,IAAK,CAE3C,MAAMkkE,EAAW,IACZhuD,EAAM0oC,MAAM5+C,IAEjBm5B,EAAIylB,MAAM1+C,KAAKgkE,EACjB,CAGA,GAAmB,OAAfhmE,KAAKwH,OAAkC,OAAhBwQ,EAAMxQ,MAAgB,CAC/C,MAAMy+D,EAAyB,OAAfjmE,KAAKwH,MAAiBxH,KAAKqqD,WAAWr5B,EAAIhZ,EAAMxQ,QAAUxH,KAAKwH,MACzE0+D,EAA2B,OAAhBluD,EAAMxQ,MAAiBwQ,EAAMqyC,WAAWr5B,EAAIhxB,KAAKwH,QAAUwQ,EAAMxQ,MAElFyzB,EAAIzzB,MAAQu2C,EAAekoB,EAASC,EACtC,MACEjrC,EAAIzzB,MAAQ,KAOd,OAJIyZ,EAAO8kD,KACT9qC,EAAI0nC,6BAA8B,GAG7BqC,EAAqB/pC,EAC9B,EASAgS,EAAKrqC,UAAUo0D,WAAa,SAAU/+B,GACpC,OAAO,IAAIgV,EAAKhV,GAAW9H,OAAOnwB,KACpC,EAQAitC,EAAKrqC,UAAUutB,OAAS,SAAU41C,GAChC,MAAM9qC,EAAMj7B,KAAKyjB,QACXzL,EAAQiJ,EAAO8kD,GAAUA,EAAS,IAAI94B,EAAK84B,GAEjD,IAAK,IAAIjkE,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAE1Cm5B,EAAIkK,WAAWrjC,IAAM9B,KAAKmlC,WAAWrjC,IAAM,IAAMkW,EAAMmtB,WAAWrjC,IAAM,GAI1E,IAAK,IAAIA,EAAI,EAAGA,EAAIkW,EAAM0oC,MAAM3/C,OAAQe,IAAK,CAE3C,MAAMkkE,EAAW,IACZhuD,EAAM0oC,MAAM5+C,GACfmiE,OAAQjsD,EAAM0oC,MAAM5+C,GAAGmiE,OAEzBhpC,EAAIylB,MAAM1+C,KAAKgkE,EACjB,CAGA,GAAmB,OAAfhmE,KAAKwH,OAAkC,OAAhBwQ,EAAMxQ,MAAgB,CAC/C,MAAMy+D,EAAyB,OAAfjmE,KAAKwH,MAAiBxH,KAAKqqD,WAAWr5B,EAAIhZ,EAAMxQ,QAAUxH,KAAKwH,MACzE0+D,EAA2B,OAAhBluD,EAAMxQ,MAAiBwQ,EAAMqyC,WAAWr5B,EAAIhxB,KAAKwH,QAAUwQ,EAAMxQ,MAClFyzB,EAAIzzB,MAAQynD,EAAagX,EAASC,EACpC,MACEjrC,EAAIzzB,MAAQ,KAOd,OAJIyZ,EAAO8kD,KACT9qC,EAAI0nC,6BAA8B,GAG7BqC,EAAqB/pC,EAC9B,EAQAgS,EAAKrqC,UAAUsX,IAAM,SAAUvQ,GAC7B,MAAMsxB,EAAMj7B,KAAKyjB,QAEjB,IAAK,IAAI3hB,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAE1Cm5B,EAAIkK,WAAWrjC,IAAM9B,KAAKmlC,WAAWrjC,IAAM,GAAK6H,EAIlD,IAAK,IAAI7H,EAAI,EAAGA,EAAIm5B,EAAIylB,MAAM3/C,OAAQe,IACpCm5B,EAAIylB,MAAM5+C,GAAGmiE,OAASt6D,EAiBxB,OAdkB,OAAdsxB,EAAIzzB,MACNyzB,EAAIzzB,MAAQ0S,EAAI+gB,EAAIzzB,MAAOmC,GAQ3BsxB,EAAIzzB,MAAQ,KAGdyzB,EAAI0nC,6BAA8B,EAE3BqC,EAAqB/pC,EAC9B,EAqCAgS,EAAKrqC,UAAUglB,IAAM,WACnB,MAAM0T,EAAMt7B,KAAKyjB,QACjB,GAAkB,OAAd6X,EAAI9zB,MACN,GAAI8zB,EAAImlB,cAAqC,IAArBnlB,EAAIolB,MAAM3/C,QAA6C,IAA7Bu6B,EAAIolB,MAAM,GAAG3O,KAAKpiC,OAClE2rB,EAAI9zB,MAAQogB,EAAI0T,EAAI9zB,WACf,CAIL,MAAMuI,EAAUurB,EAAI6qC,mBACd5B,EAAYx0D,EAAQurB,EAAIolB,MAAM,GAAG3O,KAAKvqC,OACtC4+D,EAAgBr2D,EAAQurB,EAAIolB,MAAM,GAAG3O,KAAKpiC,QAC1C02D,EAAatoB,EAAewmB,EAAW6B,GAC7C9qC,EAAI9zB,MAAQu5C,EAAen5B,EAAIk2B,EAAUxiB,EAAI9zB,MAAO6+D,IAAcA,EACpE,CAGF,IAAK,MAAMvkE,KAAKw5B,EAAIolB,MACa,OAA3BplB,EAAIolB,MAAM5+C,GAAGiwC,KAAKxsC,MAA4C,QAA3B+1B,EAAIolB,MAAM5+C,GAAGiwC,KAAKxsC,OACvD+1B,EAAIolB,MAAM5+C,GAAGiwC,KAAO6yB,EAAM0B,GAI9B,OAAOhrC,CACT,EAQA2R,EAAKrqC,UAAUkU,GAAK,SAAUk7B,GAC5B,MAAMxqC,EAAuB,OAAfxH,KAAKwH,MAAiBxH,KAAKqqD,WAAW,GAAKrqD,KAAKwH,MAC9D,IAAIwQ,EACJ,GAA6B,iBAAlBg6B,EACTh6B,EAAQi1B,EAAK1vB,MAAMy0B,OACd,KAAI/wB,EAAO+wB,GAGhB,MAAM,IAAI37B,MAAM,wCAFhB2B,EAAQg6B,EAAcvuB,OAGxB,CAEA,IAAKzjB,KAAKguC,UAAUh2B,GAClB,MAAM,IAAI3B,MAAM,wBAAwB2B,EAAMpF,mBAAmB5S,KAAK4S,gBAExE,GAAoB,OAAhBoF,EAAMxQ,MACR,MAAM,IAAI6O,MAAM,yCAGlB,GAAmB,OAAfrW,KAAKwH,OAAkBxH,KAAKygD,cACN,IAAtBzgD,KAAK0gD,MAAM3/C,QAAuC,IAAvBiX,EAAM0oC,MAAM3/C,QACvCf,KAAK0gD,MAAM,GAAG3O,KAAKpiC,SAAWqI,EAAM0oC,MAAM,GAAG3O,KAAKpiC,OACpDqI,EAAMxQ,MAAQic,GAAMjc,OACf,CAEL,MAAMuI,EAAUk9B,EAAKq3B,oBAAoB9gD,GAAOhc,IAE1C++D,EAAgBvmE,KAAK0gD,MAAM,GAAG3O,KAAKvqC,MACnCg/D,EAAoBxmE,KAAK0gD,MAAM,GAAG3O,KAAKpiC,OACvC82D,EAAiB1oB,EAAewoB,EAAeC,GAE/CE,EAAiB1uD,EAAM0oC,MAAM,GAAG3O,KAAKvqC,MACrCm/D,EAAqB3uD,EAAM0oC,MAAM,GAAG3O,KAAKpiC,OACzCi3D,EAAkB7oB,EAAe2oB,EAAgBC,GAEvD3uD,EAAMxQ,MAAQs2C,EAAUt2C,EAAOuI,EAAQgxC,EAAe0lB,EAAgBG,IACxE,CAGA,OAFA5uD,EAAMw9B,WAAY,EAClBx9B,EAAM2qD,6BAA8B,EAC7B3qD,CACT,EASAi1B,EAAKrqC,UAAU6lB,SAAW,SAAUupB,GAClC,OAAOvpB,EAASzoB,KAAKg4C,UAAUhG,GACjC,EAQA/E,EAAKrqC,UAAUo1C,UAAY,SAAUhG,GACnC,IAAIh6B,EAQJ,OALEA,EAFEg6B,EAEMhyC,KAAK8W,GAAGk7B,GAERhyC,KAAKyjB,QAGXzL,EAAMyoC,cAAuC,IAAvBzoC,EAAM0oC,MAAM3/C,OAC7BiX,EAAM0sD,aAAa1sD,EAAMxQ,OAEzBwQ,EAAM0sD,aAAa1sD,EAAMxQ,MAAOwQ,EAAM0oC,MAAM,GAAG95B,OAAOpf,MAEjE,EAOAylC,EAAKrqC,UAAUgQ,SAAW,WACxB,OAAO5S,KAAK8mB,QACd,EAQAmmB,EAAKrqC,UAAUmoB,OAAS,WACtB,MAAO,CACLC,OAAQ,OACRxjB,MAAOxH,KAAK0kE,aAAa1kE,KAAKwH,OAC9BuqC,KAAM/xC,KAAK0gD,MAAM3/C,OAAS,EAAIf,KAAKqkD,cAAgB,KACnD7O,UAAWx1C,KAAKw1C,UAEpB,EASAvI,EAAKhiB,SAAW,SAAUC,GAAM,IAAA27C,EAC9B,MAAM90B,EAAO,IAAI9E,EAAK/hB,EAAK1jB,MAAgB,QAAXq/D,EAAE37C,EAAK6mB,YAAI,IAAA80B,EAAAA,OAAIvjE,GAE/C,OADAyuC,EAAKyD,UAAYtqB,EAAKsqB,YAAa,EAC5BzD,CACT,EAOA9E,EAAKrqC,UAAU4c,QAAUytB,EAAKrqC,UAAUgQ,SAMxCq6B,EAAKrqC,UAAU0iE,SAAW,WACxB,MAAMhqC,EAAMt7B,KAAKyjB,QAEXqjD,EAAmB,GAGzB,IAAIC,EACJ,IAAK,MAAMpkE,KAAOqkE,EAChB,GAAInkE,GAAemkE,EAAmBrkE,IAChC24B,EAAIQ,QAAQmpC,EAAWtiE,IAAO,CAChCokE,EAAepkE,EACf,KACF,CAIJ,GAAqB,SAAjBokE,EACFzrC,EAAIolB,MAAQ,OACP,CACL,IAAIumB,EAOJ,GANIF,GAEElkE,GAAemkE,EAAmBD,KACpCE,EAAeD,EAAkBD,IAGjCE,EACF3rC,EAAIolB,MAAQ,CAAC,CACX3O,KAAMk1B,EAAal1B,KACnBnrB,OAAQqgD,EAAargD,OACrBq9C,MAAO,QAEJ,CAIL,IAAIiD,GAAiB,EACrB,IAAK,IAAIplE,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAAK,CAC/C,MAAMoiE,EAAUtB,EAAgB9gE,GAC5BwL,KAAKsa,IAAI0T,EAAI6J,WAAWrjC,IAAM,GAAK,QACjCe,GAAemkE,EAAmB9C,GACpC4C,EAAiB9kE,KAAK,CACpB+vC,KAAMi1B,EAAkB9C,GAASnyB,KACjCnrB,OAAQogD,EAAkB9C,GAASt9C,OACnCq9C,MAAO3oC,EAAI6J,WAAWrjC,IAAM,IAG9BolE,GAAiB,EAGvB,CAGIJ,EAAiB/lE,OAASu6B,EAAIolB,MAAM3/C,SAAWmmE,IAEjD5rC,EAAIolB,MAAQomB,EAEhB,CACF,CAEA,OAAOxrC,CACT,EAKA2R,EAAKrqC,UAAUukE,KAAO,WACpB,MAAM7rC,EAAMt7B,KAAKyjB,QAEXqjD,EAAmB,GAKzB,IAAK,IAAIhlE,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAAK,CAC/C,MAAMoiE,EAAUtB,EAAgB9gE,GAChC,GAAIwL,KAAKsa,IAAI0T,EAAI6J,WAAWrjC,IAAM,GAAK,MAAO,CAC5C,IAAIe,GAAeshE,EAAaiD,GAAIlD,GAOlC,MAAM,IAAI7tD,MAAM,8BAAgC6tD,EAAU,gBAN1D4C,EAAiB9kE,KAAK,CACpB+vC,KAAMoyB,EAAaiD,GAAGlD,GAASnyB,KAC/BnrB,OAAQu9C,EAAaiD,GAAGlD,GAASt9C,OACjCq9C,MAAO3oC,EAAI6J,WAAWrjC,IAAM,GAKlC,CACF,CAQA,OALAw5B,EAAIolB,MAAQomB,EAEZxrC,EAAIka,WAAY,EAChBla,EAAIqnC,6BAA8B,EAEf,OAAf3iE,KAAKwH,OACP8zB,EAAI9zB,MAAQ,KACLxH,KAAK8W,GAAGwkB,IAEVA,CACT,EAOA2R,EAAKrqC,UAAUyhD,YAAc,WAC3B,IAAIgjB,EAAS,GACTC,EAAS,GACTC,EAAO,EACPC,EAAO,EAEX,IAAK,IAAI1lE,EAAI,EAAGA,EAAI9B,KAAK0gD,MAAM3/C,OAAQe,IACjC9B,KAAK0gD,MAAM5+C,GAAGmiE,MAAQ,GACxBsD,IACAF,GAAU,IAAMrnE,KAAK0gD,MAAM5+C,GAAG8kB,OAAOrhB,KAAOvF,KAAK0gD,MAAM5+C,GAAGiwC,KAAKxsC,KAC3D+H,KAAKsa,IAAI5nB,KAAK0gD,MAAM5+C,GAAGmiE,MAAQ,GAAO,QACxCoD,GAAU,IAAMrnE,KAAK0gD,MAAM5+C,GAAGmiE,QAEvBjkE,KAAK0gD,MAAM5+C,GAAGmiE,MAAQ,GAC/BuD,IAIJ,GAAIA,EAAO,EACT,IAAK,IAAI1lE,EAAI,EAAGA,EAAI9B,KAAK0gD,MAAM3/C,OAAQe,IACjC9B,KAAK0gD,MAAM5+C,GAAGmiE,MAAQ,IACpBsD,EAAO,GACTD,GAAU,IAAMtnE,KAAK0gD,MAAM5+C,GAAG8kB,OAAOrhB,KAAOvF,KAAK0gD,MAAM5+C,GAAGiwC,KAAKxsC,KAC3D+H,KAAKsa,IAAI5nB,KAAK0gD,MAAM5+C,GAAGmiE,MAAQ,GAAO,QACxCqD,GAAU,KAAQtnE,KAAK0gD,MAAM5+C,GAAGmiE,SAGlCqD,GAAU,IAAMtnE,KAAK0gD,MAAM5+C,GAAG8kB,OAAOrhB,KAAOvF,KAAK0gD,MAAM5+C,GAAGiwC,KAAKxsC,KAC/D+hE,GAAU,IAAOtnE,KAAK0gD,MAAM5+C,GAAGmiE,QAMvCoD,EAASA,EAAOnZ,OAAO,GACvBoZ,EAASA,EAAOpZ,OAAO,GAGnBqZ,EAAO,GAAKC,EAAO,IACrBH,EAAS,IAAMA,EAAS,KAEtBG,EAAO,GAAKD,EAAO,IACrBD,EAAS,IAAMA,EAAS,KAG1B,IAAIlkE,EAAMikE,EAMV,OALIE,EAAO,GAAKC,EAAO,IACrBpkE,GAAO,OAETA,GAAOkkE,EAEAlkE,CACT,EAUA6pC,EAAKrqC,UAAUgzD,OAAS,WAAuC,IAA7BE,EAAQrzD,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,GAAIuF,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC1D,GAAIqzD,IAAarwD,MAAMC,QAAQowD,GAC7B,MAAM,IAAIz/C,MAAM,+CAGlB,MAAMoxD,EAAgBznE,KAAK0gD,MAAM,GAAG3O,KAAK8yB,SACzC,GAAI/O,GAAYA,EAAS/0D,OAAS,EAAG,CACnC,MAoBM8jE,EApBc/O,EAASpsD,KAAIivB,IAC/B,IAAIoZ,EAAO,KACX,GAAiB,iBAANpZ,GAET,GADAoZ,EAAO9E,EAAK1vB,MAAMob,IACboZ,EACH,MAAM,IAAI17B,MAAM,+DAEb,IAAK4K,EAAO0X,GACjB,MAAM,IAAItiB,MAAM,0DAEL,OAAT07B,IACFA,EAAOpZ,EAAElV,SAEX,IAEE,OADAzjB,KAAK8W,GAAGi7B,EAAKsS,eACNtS,CACT,CAAE,MAAO/4B,GACP,MAAM,IAAI3C,MAAM,yDAClB,KAE2B3M,KAAIg+D,GAAMA,EAAGhnB,MAAM,GAAG95B,SACnD5mB,KAAK0gD,MAAM,GAAG3O,KAAK8yB,SAAWA,EAASnhC,QAAO,CAACoC,EAAKlf,KAClDkf,EAAIlf,EAAOrhB,MAAQqhB,EACZkf,IACN,CAAC,GACJ9lC,KAAK0gD,MAAM,GAAG95B,OAASi+C,EAAS,EAClC,CAEA,MAAMpjE,EAAS2jE,EAAWplE,KAAMgI,GAASq9D,KAGzC,OAFArlE,KAAK0gD,MAAM,GAAG3O,KAAK8yB,SAAW4C,EAC9BhmE,EAAO+zC,WAAY,EACZ/zC,CACT,EAUAwrC,EAAKrqC,UAAUkkB,OAAS,SAAU9e,GAChC,MAAM,KAAEq9D,EAAI,SAAE5kC,EAAQ,QAAEolC,GAAYT,EAAWplE,KAAMgI,GACrD,IAAI5E,EAAMq9B,EASV,OARI4kC,EAAK79D,OAASuZ,EAAUskD,EAAK79D,SAC/BpE,EAAM,IAAMA,EAAM,KAEhByiE,EAAQ9kE,OAAS,GAAKqC,EAAIrC,OAAS,IACrCqC,GAAO,KAETA,GAAOyiE,EAEAziE,CACT,EA4EA6pC,EAAKrqC,UAAU+iE,YAAc,WAAwB,IAAdh2D,EAAMlN,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,IAC9C,GAA0B,IAAtBzC,KAAK0gD,MAAM3/C,OACb,MAAM,IAAIsV,MAAM,4GAElB,GAAI/I,KAAKsa,IAAI5nB,KAAK0gD,MAAM,GAAGujB,MAAQ32D,KAAKiY,MAAMvlB,KAAK0gD,MAAM,GAAGujB,SAAW,MACrE,MAAM,IAAI5tD,MAAM,4GAWlB,MAAMsxD,EAA0B,OAAf3nE,KAAKwH,MAAiBogB,EAAI5nB,KAAKwH,OAAS,EACnDogE,EAAehgD,EAAI5nB,KAAK0gD,MAAM,GAAG3O,KAAKvqC,OAC5C,IAAIqgE,EAAa7nE,KAAK0gD,MAAM,GAAG95B,OAC/B,GAAiB,IAAb+gD,EACF,OAAOE,EAET,MAAM5D,EAAQjkE,KAAK0gD,MAAM,GAAGujB,MAC5B,IAAI6D,EAAWx6D,KAAK2Y,IAAI0hD,EAAWr6D,KAAK4M,IAAI2tD,EAAWrgE,MAAQogE,EAAc3D,IAAU32D,KAAK8Y,KAAOzW,EACnG,GAAIm4D,GAAY,UAAYA,EAAW,SAAU,OAAOD,EACxDC,EAAWx6D,KAAKsa,IAAIkgD,GACpB,MAAMjD,EAAW7kE,KAAK0gD,MAAM,GAAG3O,KAAK8yB,SACpC,IAAK,MAAMl7D,KAAKk7D,EACd,GAAIhiE,GAAegiE,EAAUl7D,GAAI,CAC/B,MAAMid,EAASi+C,EAASl7D,GACxB,GAAIid,EAAOmhD,WAAY,CACrB,MAAMxoC,EAAOjyB,KAAKsa,IAChBta,KAAK2Y,IAAI0hD,EAAWr6D,KAAK4M,IAAI0M,EAAOpf,MAAQogE,EAAc3D,IAAU32D,KAAK8Y,KAAOzW,IAC9E4vB,EAAOuoC,GACRvoC,IAASuoC,GAAYlhD,EAAOrhB,KAAKxE,OAAS8mE,EAAWtiE,KAAKxE,UAG3D8mE,EAAajhD,EACbkhD,EAAWvoC,EAEf,CACF,CAEF,OAAOsoC,CACT,EAeA56B,EAAKrqC,UAAU2wC,UAAY,SAAU5B,GACnC,IAAInxC,EAAIR,KAAKyjB,QACb,MAAM6X,EAAM,GACZ,IAAK,IAAIx5B,EAAI,EAAGA,EAAI6vC,EAAM5wC,SAExBP,EAAIA,EAAEsW,GAAG66B,EAAM7vC,IACXA,IAAM6vC,EAAM5wC,OAAS,GAHOe,IAAK,CAMrC,MAAMkmE,EAAWxnE,EAAEw3C,YAIbiwB,EAAW1iD,EAAMyiD,GACvB,IAAIE,EAGFA,EAFoB/mB,EAAM8mB,EAAUD,GAE3BC,EAEAvF,EAAIliE,EAAEw3C,aAGjB,MAAMv3C,EAAI,IAAIwsC,EAAKi7B,EAAQv2B,EAAM7vC,GAAG8Q,YACpC0oB,EAAIt5B,KAAKvB,GACTD,EAAIugD,EAAevgD,EAAGC,EACxB,CAMA,IAAI0nE,EAAU,EACd,IAAK,IAAIrmE,EAAI,EAAGA,EAAIw5B,EAAIv6B,OAAQe,IAC9BqmE,EAAUrqB,EAAUqqB,EAAS7sC,EAAIx5B,GAAG0F,OAQtC,OANI25C,EAAMgnB,EAASnoE,KAAKwH,SACtBhH,EAAEgH,MAAQ,GAGZ8zB,EAAIt5B,KAAKxB,GAEF86B,CACT,EAEA,MAAM8sC,EAAW,CACflD,KAAM,CACJ,GAAI,CAAE3/D,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,IAExCM,MAAO,CACL,GAAI,CAAE9iE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GAEtCO,GAAI,CAAE/iE,KAAM,KAAMiC,MAAO,GAAKugE,YAAY,GAC1CvjE,EAAG,CAAEe,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCjnE,EAAG,CAAEyE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxC7qC,EAAG,CAAE33B,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCQ,EAAG,CAAEhjE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCvV,EAAG,CAAEjtD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh7C,EAAG,CAAExnB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClvD,EAAG,CAAEtT,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCS,EAAG,CAAEjjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClV,EAAG,CAAEttD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCU,EAAG,CAAEljE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCxU,EAAG,CAAEhuD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GAEzClnE,EAAG,CAAE0E,KAAM,IAAKiC,MAAO,GAAMugE,YAAY,GACzCrjE,EAAG,CAAEa,KAAM,IAAKiC,MAAO,IAAMugE,YAAY,GACzCh4C,EAAG,CAAExqB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCpvC,EAAG,CAAEpzB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzC1jE,EAAG,CAAEkB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCp+D,EAAG,CAAEpE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1C7mE,EAAG,CAAEqE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CpuD,EAAG,CAAEpU,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CrnE,EAAG,CAAE6E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CtnE,EAAG,CAAE8E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1ChsD,EAAG,CAAExW,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1Cj0C,EAAG,CAAEvuB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,IAE5CW,KAAM,CACJ,GAAI,CAAEnjE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GAEtCY,KAAM,CAAEpjE,KAAM,OAAQiC,MAAO,GAAKugE,YAAY,GAC9Ca,MAAO,CAAErjE,KAAM,QAASiC,MAAO,IAAKugE,YAAY,GAChDc,KAAM,CAAEtjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9Ce,KAAM,CAAEvjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9CgB,KAAM,CAAExjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9CiB,KAAM,CAAEzjE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/CkB,KAAM,CAAE1jE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/CmB,IAAK,CAAE3jE,KAAM,MAAOiC,MAAO,KAAMugE,YAAY,GAC7CoB,MAAO,CAAE5jE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjDqB,MAAO,CAAE7jE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjDsB,MAAO,CAAE9jE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjDuB,OAAQ,CAAE/jE,KAAM,SAAUiC,MAAO,KAAMugE,YAAY,GAEnDwB,KAAM,CAAEhkE,KAAM,OAAQiC,MAAO,GAAMugE,YAAY,GAC/CyB,MAAO,CAAEjkE,KAAM,QAASiC,MAAO,IAAMugE,YAAY,GACjD0B,MAAO,CAAElkE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjD2B,MAAO,CAAEnkE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjD4B,KAAM,CAAEpkE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/C6B,KAAM,CAAErkE,KAAM,OAAQiC,MAAO,MAAOugE,YAAY,GAChD8B,MAAO,CAAEtkE,KAAM,QAASiC,MAAO,MAAOugE,YAAY,GAClD+B,KAAM,CAAEvkE,KAAM,OAAQiC,MAAO,MAAOugE,YAAY,GAChDgC,MAAO,CAAExkE,KAAM,QAASiC,MAAO,MAAOugE,YAAY,GAClDiC,MAAO,CAAEzkE,KAAM,QAASiC,MAAO,MAAOugE,YAAY,GAClDkC,MAAO,CAAE1kE,KAAM,QAASiC,MAAO,MAAOugE,YAAY,GAClDmC,OAAQ,CAAE3kE,KAAM,SAAUiC,MAAO,MAAOugE,YAAY,IAEtDoC,QAAS,CACP,GAAI,CAAE5kE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GAEtCO,GAAI,CAAE/iE,KAAM,KAAMiC,MAAO,IAAKugE,YAAY,GAC1CvjE,EAAG,CAAEe,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCjnE,EAAG,CAAEyE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxC7qC,EAAG,CAAE33B,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCQ,EAAG,CAAEhjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCvV,EAAG,CAAEjtD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh7C,EAAG,CAAExnB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClvD,EAAG,CAAEtT,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCS,EAAG,CAAEjjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClV,EAAG,CAAEttD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCU,EAAG,CAAEljE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCxU,EAAG,CAAEhuD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GAEzClnE,EAAG,CAAE0E,KAAM,IAAKiC,MAAO,IAAMugE,YAAY,GACzCrjE,EAAG,CAAEa,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh4C,EAAG,CAAExqB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCpvC,EAAG,CAAEpzB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1C1jE,EAAG,CAAEkB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1Cp+D,EAAG,CAAEpE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1C7mE,EAAG,CAAEqE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CpuD,EAAG,CAAEpU,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CrnE,EAAG,CAAE6E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CtnE,EAAG,CAAE8E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1ChsD,EAAG,CAAExW,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1Cj0C,EAAG,CAAEvuB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,IAE5CqC,MAAO,CACL,GAAI,CAAE7kE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GAEtCO,GAAI,CAAE/iE,KAAM,KAAMiC,MAAO,IAAKugE,YAAY,GAC1CvjE,EAAG,CAAEe,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCjnE,EAAG,CAAEyE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxC7qC,EAAG,CAAE33B,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCQ,EAAG,CAAEhjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCvV,EAAG,CAAEjtD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh7C,EAAG,CAAExnB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClvD,EAAG,CAAEtT,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCS,EAAG,CAAEjjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClV,EAAG,CAAEttD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCU,EAAG,CAAEljE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCxU,EAAG,CAAEhuD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GAEzClnE,EAAG,CAAE0E,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCrjE,EAAG,CAAEa,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh4C,EAAG,CAAExqB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCpvC,EAAG,CAAEpzB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1C1jE,EAAG,CAAEkB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1Cp+D,EAAG,CAAEpE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1C7mE,EAAG,CAAEqE,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CpuD,EAAG,CAAEpU,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CrnE,EAAG,CAAE6E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1CtnE,EAAG,CAAE8E,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1ChsD,EAAG,CAAExW,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,GAC1Cj0C,EAAG,CAAEvuB,KAAM,IAAKiC,MAAO,MAAOugE,YAAY,IAE5CsC,gBAAiB,CACf,GAAI,CAAE9kE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GACtCjnE,EAAG,CAAEyE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxC7qC,EAAG,CAAE33B,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCQ,EAAG,CAAEhjE,KAAM,IAAKiC,MAAO,IAAKugE,YAAY,GACxCvV,EAAG,CAAEjtD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCh7C,EAAG,CAAExnB,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClvD,EAAG,CAAEtT,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzCS,EAAG,CAAEjjE,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,GACzClV,EAAG,CAAEttD,KAAM,IAAKiC,MAAO,KAAMugE,YAAY,IAE3CuC,iBAAkB,CAChB,GAAI,CAAE/kE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GACtCwC,GAAI,CAAEhlE,KAAM,KAAMiC,MAAO,KAAMugE,YAAY,GAC3CyC,GAAI,CAAEjlE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD0C,GAAI,CAAEllE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD2C,GAAI,CAAEnlE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD4C,GAAI,CAAEplE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD6C,GAAI,CAAErlE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD8C,GAAI,CAAEtlE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GACxD+C,GAAI,CAAEvlE,KAAM,KAAMiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,IAE1DgD,eAAgB,CACd,GAAI,CAAExlE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GACtCc,KAAM,CAAEtjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9Ce,KAAM,CAAEvjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9CgB,KAAM,CAAExjE,KAAM,OAAQiC,MAAO,IAAKugE,YAAY,GAC9CiB,KAAM,CAAEzjE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/CkB,KAAM,CAAE1jE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/CmB,IAAK,CAAE3jE,KAAM,MAAOiC,MAAO,KAAMugE,YAAY,GAC7CoB,MAAO,CAAE5jE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,GACjDqB,MAAO,CAAE7jE,KAAM,QAASiC,MAAO,KAAMugE,YAAY,IAEnDiD,gBAAiB,CACf,GAAI,CAAEzlE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GACtCkD,KAAM,CAAE1lE,KAAM,OAAQiC,MAAO,KAAMugE,YAAY,GAC/CmD,KAAM,CAAE3lE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC5DoD,KAAM,CAAE5lE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC5DqD,KAAM,CAAE7lE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC5DsD,KAAM,CAAE9lE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC5DuD,IAAK,CAAE/lE,KAAM,MAAOiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC1DwD,KAAM,CAAEhmE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,GAC5DyD,KAAM,CAAEjmE,KAAM,OAAQiC,MAAO8F,KAAK4M,IAAI,KAAM,GAAI6tD,YAAY,IAE9D0D,IAAK,CACH,GAAI,CAAElmE,KAAM,GAAIiC,MAAO,EAAGugE,YAAY,GACtC2D,GAAI,CAAEnmE,KAAM,KAAMiC,MAAO,IAAKugE,YAAY,KAI9CK,EAASuD,UAAYtpE,GAAc,CAAC,EAAG+lE,EAASC,MAAOD,EAASM,MAChEN,EAASwD,aAAevpE,GAAc,CAAC,EAAG+lE,EAASiC,gBAAiBjC,EAASkC,kBAC7ElC,EAASyD,YAAcxpE,GAAc,CAAC,EAAG+lE,EAAS2C,eAAgB3C,EAAS4C,iBAkB3E,MAAMpI,EAAkB,CAAC,OAAQ,SAAU,OAAQ,UAAW,cAAe,qBAAsB,sBAAuB,QAAS,OAE7HqC,EAAa,CACjBC,KAAM,CACJ//B,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC2mC,KAAM,CACJ3mC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC4mC,OAAQ,CACN5mC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC6mC,KAAM,CACJ7mC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC8mC,QAAS,CACP9mC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvC+mC,YAAa,CACX/mC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCgnC,mBAAoB,CAClBhnC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCinC,oBAAqB,CACnBjnC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGvCknC,MAAO,CACLlnC,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCmnC,QAAS,CACPnnC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvConC,OAAQ,CACNpnC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCqnC,OAAQ,CACNrnC,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCsnC,MAAO,CACLtnC,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCunC,SAAU,CACRvnC,WAAY,CAAC,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGzCwnC,gBAAiB,CACfxnC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCynC,qBAAsB,CACpBznC,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC0nC,mBAAoB,CAClB1nC,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC2nC,oBAAqB,CACnB3nC,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC4nC,oBAAqB,CACnB5nC,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC6nC,qBAAsB,CACpB7nC,WAAY,EAAE,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC8nC,cAAe,CACb9nC,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAEzC+nC,sBAAuB,CACrB/nC,WAAY,CAAC,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,IAGzCgoC,UAAW,CACThoC,WAAY,CAAC,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAExCioC,MAAO,CACLjoC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAEvCkoC,IAAK,CACHloC,WAAY,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAIzC,IAAK,MAAMxiC,KAAOsiE,EACZpiE,GAAeoiE,EAAYtiE,KAC7BsiE,EAAWtiE,GAAKA,IAAMA,GAI1B,MAEM2qE,EAAY,CAAE/nE,KAAM,GAAIohB,KAFP,CAAC,EAE4Bnf,MAAO,EAAGmI,OAAQ,EAAGw1B,WAAYy9B,EAAgBl5D,KAAIlJ,GAAK,KAExGokE,EAAQ,CAEZ2I,MAAO,CACLhoE,KAAM,QACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV69D,KAAM,CACJjoE,KAAM,OACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEV89D,KAAM,CACJloE,KAAM,OACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEV+9D,KAAM,CACJnoE,KAAM,OACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEVg+D,KAAM,CACJpoE,KAAM,OACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVi+D,KAAM,CACJroE,KAAM,OACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVk+D,IAAK,CACHtoE,KAAM,MACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,OACPmI,OAAQ,GAEVm+D,MAAO,CACLvoE,KAAM,QACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVo+D,SAAU,CACRxoE,KAAM,WACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAGVogB,EAAG,CACDxqB,KAAM,IACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVq+D,GAAI,CACFzoE,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEVs+D,GAAI,CACF1oE,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEVmf,GAAI,CACFvpB,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEVu+D,GAAI,CACF3oE,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVw+D,GAAI,CACF5oE,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEV8d,GAAI,CACFloB,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVy+D,GAAI,CACF7oE,KAAM,KACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEV0+D,IAAK,CACH9oE,KAAM,MACNohB,KAAMs+C,EAAW8G,OACjBlH,SAAUuD,EAASlD,KACnB19D,MAAO,OACPmI,OAAQ,GAIV2+D,GAAI,CACF/oE,KAAM,KACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAAS+B,QACnB3iE,MAAO,EACPmI,OAAQ,GAEV4+D,KAAM,CACJhpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEV6+D,KAAM,CACJjpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAEV8+D,KAAM,CACJlpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAEV++D,KAAM,CACJnpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,eACPmI,OAAQ,GAEVg/D,KAAM,CACJppE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVi/D,KAAM,CACJrpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVk/D,MAAO,CACLtpE,KAAM,QACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,WACPmI,OAAQ,GAEVm/D,KAAM,CACJvpE,KAAM,OACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVo/D,QAAS,CACPxpE,KAAM,UACNohB,KAAMs+C,EAAWqH,QACjBzH,SAAUuD,EAASlD,KACnB19D,MAAO,IACPmI,OAAQ,GAIVq/D,GAAI,CACFzpE,KAAM,KACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASgC,MACnB5iE,MAAO,EACPmI,OAAQ,GAEVsqD,EAAG,CACD10D,KAAM,IACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEV+2C,EAAG,CACDnhD,KAAM,IACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEVs/D,MAAO,CACL1pE,KAAM,QACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASM,KACnBlhE,MAAO,KACPmI,OAAQ,GAEVu/D,KAAM,CACJ3pE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,aACPmI,OAAQ,GAEVw/D,KAAM,CACJ5pE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVy/D,KAAM,CACJ7pE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEV0/D,SAAU,CACR9pE,KAAM,WACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEV2/D,WAAY,CACV/pE,KAAM,aACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAGV4/D,KAAM,CACJhqE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEV6/D,IAAK,CACHjqE,KAAM,MACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAIV8/D,MAAO,CACLlqE,KAAM,QACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,mBACPmI,OAAQ,GAEV+/D,UAAW,CACTnqE,KAAM,YACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,mBACPmI,OAAQ,GAEVggE,WAAY,CACVpqE,KAAM,aACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,iBACPmI,OAAQ,GAEVigE,KAAM,CACJrqE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,gBACPmI,OAAQ,GAEVkgE,GAAI,CACFtqE,KAAM,KACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEVmgE,IAAK,CACHvqE,KAAM,MACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,eACPmI,OAAQ,GAEVogE,KAAM,CACJxqE,KAAM,OACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVqgE,MAAO,CACLzqE,KAAM,QACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVsgE,OAAQ,CACN1qE,KAAM,SACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVugE,WAAY,CACV3qE,KAAM,aACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVwgE,UAAW,CACT5qE,KAAM,YACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVygE,SAAU,CACR7qE,KAAM,WACNohB,KAAMs+C,EAAWsH,OACjB1H,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAIV8L,EAAG,CACDlW,KAAM,IACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEV0gE,KAAM,CACJ9qE,KAAM,OACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASM,KACnBlhE,MAAO,KACPmI,OAAQ,GAGV2gE,IAAK,CACH/qE,KAAM,MACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASC,MACnB7gE,MAAO,UACPmI,OAAQ,GAEVpP,EAAG,CACDgF,KAAM,IACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASC,MACnB7gE,MAAO,IACPmI,OAAQ,GAEV4gE,MAAO,CACLhrE,KAAM,QACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASM,KACnBlhE,MAAO,IACPmI,OAAQ,GAGV6gE,MAAO,CACLjrE,KAAM,QACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,YACPmI,OAAQ,GAEV8gE,KAAM,CACJlrE,KAAM,OACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,kBACPmI,OAAQ,GAEV+gE,MAAO,CACLnrE,KAAM,QACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVghE,UAAW,CACTprE,KAAM,YACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAEVihE,cAAe,CACbrrE,KAAM,gBACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAEVkhE,MAAO,CACLtrE,KAAM,QACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEVmhE,MAAO,CACLvrE,KAAM,QACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,WACPmI,OAAQ,GAGVohE,GAAI,CACFxrE,KAAM,KACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,YACPmI,OAAQ,GAEVqhE,GAAI,CACFzrE,KAAM,KACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,kBACPmI,OAAQ,GAEVshE,GAAI,CACF1rE,KAAM,KACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,cACPmI,OAAQ,GAEVuhE,IAAK,CACH3rE,KAAM,MACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAEVwhE,IAAK,CACH5rE,KAAM,MACNohB,KAAMs+C,EAAW6G,KACjBjH,SAAUuD,EAASlD,KACnB19D,MAAO,UACPmI,OAAQ,GAIV1F,EAAG,CACD1E,KAAM,IACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVpC,IAAK,CACHhI,KAAM,MACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,GACPmI,OAAQ,GAEVnL,EAAG,CACDe,KAAM,IACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEVyhE,OAAQ,CACN7rE,KAAM,SACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV0hE,IAAK,CACH9rE,KAAM,MACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV2hE,OAAQ,CACN/rE,KAAM,SACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,GACPmI,OAAQ,GAEV4hE,KAAM,CACJhsE,KAAM,OACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAEV6hE,IAAK,CACHjsE,KAAM,MACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,MACPmI,OAAQ,GAEV8hE,KAAM,CACJlsE,KAAM,OACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,OACPmI,OAAQ,GAEV+hE,MAAO,CACLnsE,KAAM,QACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVgiE,KAAM,CACJpsE,KAAM,OACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEViiE,OAAQ,CACNrsE,KAAM,SACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVkiE,QAAS,CACPtsE,KAAM,UACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAEVmiE,WAAY,CACVvsE,KAAM,aACNohB,KAAMs+C,EAAW+G,KACjBnH,SAAUuD,EAASlD,KACnB19D,MAAO,SACPmI,OAAQ,GAIVoiE,MAAO,CACLxsE,KAAM,QACNohB,KAAMs+C,EAAWkI,UACjBtI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,EACRqiE,YAAY,GAEdC,GAAI,CACF1sE,KAAM,KACNohB,KAAMs+C,EAAWkI,UACjBtI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,EACRqiE,YAAY,GAIdE,IAAK,CACH3sE,KAAM,MACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVwiE,OAAQ,CACN5sE,KAAM,SACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAGVyiE,IAAK,CACH7sE,KAAM,MACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEVuwD,OAAQ,CACN36D,KAAM,SACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASM,KACnBlhE,MAAO,KACPmI,OAAQ,GAGV0iE,KAAM,CACJ9sE,KAAM,OACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEV2iE,QAAS,CACP/sE,KAAM,UACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASM,KACnBlhE,MAAO,KACPmI,OAAQ,GAGV4iE,MAAO,CACLhtE,KAAM,QACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAGV6iE,OAAQ,CACNjtE,KAAM,SACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAGV8iE,OAAQ,CACNltE,KAAM,SACNohB,KAAMs+C,EAAWmI,MACjBvI,SAAUuD,EAASlD,KACnB19D,MAAO,KACPmI,OAAQ,GAIVktB,EAAG,CACDt3B,KAAM,IACNohB,KAAMs+C,EAAWgH,QACjBpH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEV+iE,OAAQ,CACNntE,KAAM,SACNohB,KAAMs+C,EAAWgH,QACjBpH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAOVgjE,EAAG,CACDptE,KAAM,IACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVijE,KAAM,CACJrtE,KAAM,OACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,QAEVkjE,KAAM,CACJttE,KAAM,OACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASC,MACnB7gE,MAAO,IAAI0iB,EAAS,EAAG,GACvBva,OAAQ,QAEVmjE,KAAM,CACJvtE,KAAM,OACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASC,MACnB7gE,MAAO,IAAI0iB,EAAS,EAAG,GACvBva,OAAQ,GAEVojE,OAAQ,CACNxtE,KAAM,SACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVqjE,QAAS,CACPztE,KAAM,UACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,QAEVsjE,WAAY,CACV1tE,KAAM,aACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASM,KACnBlhE,MAAO,IAAI0iB,EAAS,EAAG,GACvBva,OAAQ,QAEVujE,QAAS,CACP3tE,KAAM,UACNohB,KAAMs+C,EAAWiH,YACjBrH,SAAUuD,EAASM,KACnBlhE,MAAO,IAAI0iB,EAAS,EAAG,GACvBva,OAAQ,GAIVwjE,IAAK,CACH5tE,KAAM,MACNohB,KAAMs+C,EAAWmH,oBACjBvH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVyjE,KAAM,CACJ7tE,KAAM,OACNohB,KAAMs+C,EAAWmH,oBACjBvH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAIV0jE,GAAI,CACF9tE,KAAM,KACNohB,KAAMs+C,EAAWkH,mBACjBtH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEV2jE,QAAS,CACP/tE,KAAM,UACNohB,KAAMs+C,EAAWkH,mBACjBtH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAOVstB,EAAG,CACD13B,KAAM,IACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEV4jE,OAAQ,CACNhuE,KAAM,SACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV6jE,IAAK,CACHjuE,KAAM,MACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEV8jE,KAAM,CACJluE,KAAM,OACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASM,KACnBlhE,MAAO,KACPmI,OAAQ,GAEV+jE,IAAK,CACHnuE,KAAM,MACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASlD,KACnB19D,MAAO,gBACPmI,OAAQ,GAEVgkE,WAAY,CACVpuE,KAAM,aACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASlD,KACnB19D,MAAO,gBACPmI,OAAQ,GAEVikE,IAAK,CACHruE,KAAM,MACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASM,KACnBlhE,MAAO,UACPmI,OAAQ,GAEVkkE,cAAe,CACbtuE,KAAM,gBACNohB,KAAMs+C,EAAWoH,MACjBxH,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAIVy7B,EAAG,CACD7lC,KAAM,IACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVmkE,MAAO,CACLvuE,KAAM,QACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVokE,IAAK,CACHxuE,KAAM,MACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASuD,UACnBnkE,MAAO,KACPmI,OAAQ,GAEVqkE,GAAI,CACFzuE,KAAM,KACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASC,MACnB7gE,MAAO,KACPmI,OAAQ,GAEV87D,IAAK,CACHlmE,KAAM,MACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASqD,IACnBjkE,MAAO,cACPmI,OAAQ,GAEVskE,GAAI,CACF1uE,KAAM,KACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASC,MACnB7gE,MAAO,eACPmI,OAAQ,GAEVukE,aAAc,CACZ3uE,KAAM,eACNohB,KAAMs+C,EAAWuH,OACjB3H,SAAUuD,EAASM,KACnBlhE,MAAO,eACPmI,OAAQ,GAIV22D,EAAG,CACD/gE,KAAM,IACNohB,KAAMs+C,EAAWwH,MACjB5H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEVwkE,KAAM,CACJ5uE,KAAM,OACNohB,KAAMs+C,EAAWwH,MACjB5H,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVykE,GAAI,CACF7uE,KAAM,KACNohB,KAAMs+C,EAAWwH,MACjB5H,SAAUuD,EAASlD,KACnB19D,MAAO,eACPmI,OAAQ,GAIV61D,IAAK,CACHjgE,KAAM,MACNohB,KAAMs+C,EAAWwH,MACjB5H,SAAUuD,EAASC,MACnB7gE,MAAOwiB,EAAQmhB,EACfx7B,OAAQ,GAGV81D,GAAI,CACFlgE,KAAM,KACNohB,KAAMs+C,EAAWwH,MACjB5H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAIV0kE,GAAI,CACF9uE,KAAM,KACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAEV2kE,IAAK,CACH/uE,KAAM,MACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,iBACPmI,OAAQ,GAEV4kE,IAAK,CACHhvE,KAAM,MACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,OACPmI,OAAQ,GAEV6kE,IAAK,CACHjvE,KAAM,MACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASuD,UACnBnkE,MAAO,IACPmI,OAAQ,GAEV8kE,KAAM,CACJlvE,KAAM,OACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEV+kE,KAAM,CACJnvE,KAAM,OACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVglE,MAAO,CACLpvE,KAAM,QACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAEVilE,MAAO,CACLrvE,KAAM,QACNohB,KAAMs+C,EAAWyH,SACjB7H,SAAUuD,EAASlD,KACnB19D,MAAO,QACPmI,OAAQ,GAIVklE,QAAS,CACPtvE,KAAM,UACNohB,KAAMs+C,EAAW0H,gBACjB9H,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVotB,EAAG,CACDx3B,KAAM,IACNohB,KAAMs+C,EAAW0H,gBACjB9H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGVmlE,MAAO,CACLvvE,KAAM,QACNohB,KAAMs+C,EAAW2H,qBACjB/H,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVolE,EAAG,CACDxvE,KAAM,IACNohB,KAAMs+C,EAAW2H,qBACjB/H,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGVqlE,KAAM,CACJzvE,KAAM,OACNohB,KAAMs+C,EAAW4H,mBACjBhI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVslE,EAAG,CACD1vE,KAAM,IACNohB,KAAMs+C,EAAW4H,mBACjBhI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGVulE,IAAK,CACH3vE,KAAM,MACNohB,KAAMs+C,EAAW6H,oBACjBjI,SAAUuD,EAASuD,UACnBnkE,MAAO,EACPmI,OAAQ,GAaVwlE,MAAO,CACL5vE,KAAM,QACNohB,KAAMs+C,EAAW8H,oBACjBlI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEVylE,EAAG,CACD7vE,KAAM,IACNohB,KAAMs+C,EAAW8H,oBACjBlI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGV0lE,QAAS,CACP9vE,KAAM,UACNohB,KAAMs+C,EAAW+H,qBACjBnI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV+L,EAAG,CACDnW,KAAM,IACNohB,KAAMs+C,EAAW+H,qBACjBnI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGV2lE,MAAO,CACL/vE,KAAM,QACNohB,KAAMs+C,EAAWgI,cACjBpI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV4lE,GAAI,CACFhwE,KAAM,KACNohB,KAAMs+C,EAAWgI,cACjBpI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAGV6lE,MAAO,CACLjwE,KAAM,QACNohB,KAAMs+C,EAAWiI,sBACjBrI,SAAUuD,EAASM,KACnBlhE,MAAO,EACPmI,OAAQ,GAEV6iD,EAAG,CACDjtD,KAAM,IACNohB,KAAMs+C,EAAWiI,sBACjBrI,SAAUuD,EAASC,MACnB7gE,MAAO,EACPmI,OAAQ,GAIV+J,EAAG,CACDnU,KAAM,IACNohB,KAAMs+C,EAAWoI,IACjBxI,SAAUuD,EAASwD,aACnBpkE,MAAO,EACPmI,OAAQ,GAEV8lE,KAAM,CACJlwE,KAAM,OACNohB,KAAMs+C,EAAWoI,IACjBxI,SAAUuD,EAASyD,YACnBrkE,MAAO,EACPmI,OAAQ,GAEVmtB,EAAG,CACDv3B,KAAM,IACNohB,KAAMs+C,EAAWoI,IACjBxI,SAAUuD,EAASwD,aACnBpkE,MAAO,EACPmI,OAAQ,GAEV+lE,MAAO,CACLnwE,KAAM,QACNohB,KAAMs+C,EAAWoI,IACjBxI,SAAUuD,EAASyD,YACnBrkE,MAAO,EACPmI,OAAQ,IAMNgmE,EAAU,CACdC,OAAQ,QACRC,OAAQ,OACRC,KAAM,OACNC,MAAO,OACPC,MAAO,OACPC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,UAAW,WAEXpjD,GAAI,IACJqjD,OAAQ,QACRC,MAAO,QACPC,OAAQ,QACRC,UAAW,WACXC,YAAa,aACbC,OAAQ,QACRC,KAAM,YACNC,WAAY,YACZC,KAAM,aACNC,YAAa,aACbC,GAAI,OACJC,MAAO,OACPC,GAAI,MACJC,KAAM,MACNC,GAAI,OACJC,MAAO,OACPC,GAAI,QACJC,OAAQ,QACRC,IAAK,SACLC,QAAS,SACTC,IAAK,aACLC,YAAa,aACbC,IAAK,YACLC,WAAY,YACZC,UAAW,WACXC,KAAM,MAENC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,MAAO,OACPC,OAAQ,QACRC,YAAa,YACbC,eAAgB,gBAChBC,OAAQ,QACRC,GAAI,MACJC,IAAK,MAELC,KAAM,MACNC,IAAK,gBAELC,MAAO,OACPC,SAAU,UACVC,OAAQ,OACRC,OAAQ,OACRC,OAAQ,OACRC,QAAS,OAETC,KAAM,OACNC,MAAO,QACPC,MAAO,QAEPC,QAAS,SACTC,KAAM,SACNC,QAAS,SACTC,KAAM,SACNC,MAAO,OACPC,GAAI,OACJC,IAAK,OACLC,KAAM,MACNC,MAAO,OACPC,OAAQ,QACRC,MAAO,OACPC,QAAS,SACTC,UAAW,UACXC,UAAW,aAEXnI,MAAO,QAEPoI,QAAS,SACTC,QAAS,SACTC,SAAU,UACVC,OAAQ,QACRC,UAAW,SACXC,WAAY,SACZC,UAAW,SACXC,WAAY,SAEZC,KAAM,MACNC,MAAO,OACPC,OAAQ,QAERC,QAAS,SACTC,KAAM,SACNC,IAAK,SACLC,SAAU,UACVC,MAAO,OACPC,KAAM,MACNC,OAAQ,QACRC,OAAQ,QACRC,OAAQ,QACRC,cAAe,eACfC,MAAO,OAEPC,IAAK,OACLC,KAAM,SAQR,SAASC,EAAsBj2D,GAC7B,GAAsB,cAAlBA,EAAOC,OAAwB,CACjC,MAAMiT,EAAKgjD,GAAS7xD,GACpB66C,EAAMsN,IAAI1qE,MAAQ,IAAIuiB,EAAU,GAChC66C,EAAMwN,IAAI5qE,MAAQoxB,EAAGpI,IAAI,KACzBo0C,EAAMyN,KAAK7qE,MAAQoxB,EAAGpI,IAAI,KAC1Bo0C,EAAM2N,MAAM/qE,MAAQoxB,EAAGpJ,MAAM,GAC7Bo1C,EAAM4N,OAAOhrE,MAAQoxB,EAAGpI,IAAI,OAC5Bo0C,EAAM6N,OAAOjrE,MAAQoxB,EAAGpI,IAAI,MAC9B,MACEo0C,EAAMsN,IAAI1qE,MAAQ,EAClBo9D,EAAMwN,IAAI5qE,MAAQ8F,KAAKme,GAAK,IAC5Bm5C,EAAMyN,KAAK7qE,MAAQ8F,KAAKme,GAAK,IAC7Bm5C,EAAM2N,MAAM/qE,MAAkB,EAAV8F,KAAKme,GACzBm5C,EAAM4N,OAAOhrE,MAAQ8F,KAAKme,GAAK,MAC/Bm5C,EAAM6N,OAAOjrE,MAAQ8F,KAAKme,GAAK,MAIjCm5C,EAAMuN,OAAO3qE,MAAQo9D,EAAMsN,IAAI1qE,MAC/Bo9D,EAAM1E,OAAO14D,MAAQo9D,EAAMwN,IAAI5qE,MAC/Bo9D,EAAM0N,QAAQ9qE,MAAQo9D,EAAMyN,KAAK7qE,KACnC,CAGAm0E,EAAqBj2D,GAEjB5M,GAEFA,EAAG,UAAU,SAAUkhB,EAAMC,GACvBD,EAAKrU,SAAWsU,EAAKtU,QACvBg2D,EAAqB3hD,EAEzB,IAQF,MAAMmqC,EAAe,CACnBiD,GAAI,CAEFlC,KAAM,CAAEnzB,KAAMu7B,EAAW1mD,OAAQwhD,EAASlD,KAAK,KAC/C6G,OAAQ,CAAEh6B,KAAM6yB,EAAM70C,EAAGnJ,OAAQwhD,EAASC,MAAM,KAChDyD,KAAM,CAAE/5B,KAAM6yB,EAAMnpD,EAAGmL,OAAQwhD,EAASC,MAAMvnE,GAC9CkrE,KAAM,CAAEj6B,KAAM6yB,EAAM36D,EAAG2c,OAAQwhD,EAASC,MAAM,KAC9C4D,QAAS,CAAEl6B,KAAM6yB,EAAM/nC,EAAGjW,OAAQwhD,EAASC,MAAM,KACjD6D,YAAa,CAAEn6B,KAAM6yB,EAAM+N,EAAG/rD,OAAQwhD,EAASC,MAAM,KACrD8D,mBAAoB,CAAEp6B,KAAM6yB,EAAMyO,GAAIzsD,OAAQwhD,EAASC,MAAM,KAC7D+D,oBAAqB,CAAEr6B,KAAM6yB,EAAMuO,IAAKvsD,OAAQwhD,EAASC,MAAM,KAC/D+E,MAAO,CAAEr7B,KAAM6yB,EAAMsN,IAAKtrD,OAAQwhD,EAASC,MAAM,KACjDgF,IAAK,CAAEt7B,KAAM6yB,EAAM6Q,KAAM7uD,OAAQwhD,EAASC,MAAM,KAGhDgE,MAAO,CAAEt6B,KAAM6yB,EAAM3nC,EAAGrW,OAAQwhD,EAASC,MAAM,KAC/CmE,OAAQ,CAAEz6B,KAAM6yB,EAAMx5B,EAAGxkB,OAAQwhD,EAASC,MAAM,KAChDoE,MAAO,CAAE16B,KAAM6yB,EAAM0B,EAAG1/C,OAAQwhD,EAASC,MAAM,KAC/CqE,SAAU,CAAE36B,KAAM6yB,EAAMyP,GAAIztD,OAAQwhD,EAASC,MAAM,KACnDsE,gBAAiB,CAAE56B,KAAM6yB,EAAM7nC,EAAGnW,OAAQwhD,EAASC,MAAM,KACzDuE,qBAAsB,CAAE76B,KAAM6yB,EAAMmQ,EAAGnuD,OAAQwhD,EAASC,MAAM,KAC9DwE,mBAAoB,CAAE96B,KAAM6yB,EAAMqQ,EAAGruD,OAAQwhD,EAASC,MAAM,KAC5DyE,oBAAqB,CAAE/6B,KAAM6yB,EAAMsQ,IAAKtuD,OAAQwhD,EAASC,MAAM,KAC/D0E,oBAAqB,CAAEh7B,KAAM6yB,EAAMwQ,EAAGxuD,OAAQwhD,EAASC,MAAM,KAC7D2E,qBAAsB,CAAEj7B,KAAM6yB,EAAMlpD,EAAGkL,OAAQwhD,EAASC,MAAM,KAC9D4E,cAAe,CAAEl7B,KAAM6yB,EAAM2Q,GAAI3uD,OAAQwhD,EAASC,MAAM,KACxD6E,sBAAuB,CAAEn7B,KAAM6yB,EAAMpS,EAAG5rC,OAAQwhD,EAASC,MAAM,KAC/D8E,UAAW,CAAEp7B,KAAM6yB,EAAMqN,GAAIrrD,OAAQwhD,EAASC,MAAM,OAKxDlE,EAAa0X,IAAM9zC,KAAKxqB,MAAMwqB,KAAKjH,UAAUqjC,EAAaiD,KAC1DjD,EAAa0X,IAAI9P,OAAS,CAAEh6B,KAAM6yB,EAAM70C,EAAGnJ,OAAQwhD,EAASC,MAAM3jE,GAClEy/D,EAAa0X,IAAI/P,KAAO,CAAE/5B,KAAM6yB,EAAMnpD,EAAGmL,OAAQwhD,EAASC,MAAM,KAChElE,EAAa0X,IAAIxP,MAAQ,CAAEt6B,KAAM6yB,EAAM4O,IAAK5sD,OAAQwhD,EAASC,MAAM,KACnElE,EAAa0X,IAAIrP,OAAS,CAAEz6B,KAAM6yB,EAAMmP,IAAKntD,OAAQwhD,EAASlD,KAAK,KAInEf,EAAa2X,GAAK/zC,KAAKxqB,MAAMwqB,KAAKjH,UAAUqjC,EAAaiD,KACzDjD,EAAa2X,GAAG/P,OAAS,CAAEh6B,KAAM6yB,EAAMqJ,GAAIrnD,OAAQwhD,EAASlD,KAAK,KACjEf,EAAa2X,GAAGhQ,KAAO,CAAE/5B,KAAM6yB,EAAMsM,IAAKtqD,OAAQwhD,EAASlD,KAAK,KAChEf,EAAa2X,GAAG5P,YAAc,CAAEn6B,KAAM6yB,EAAMiO,KAAMjsD,OAAQwhD,EAASlD,KAAK,KACxEf,EAAa2X,GAAGzP,MAAQ,CAAEt6B,KAAM6yB,EAAM8O,IAAK9sD,OAAQwhD,EAASlD,KAAK,KACjEf,EAAa2X,GAAGtP,OAAS,CAAEz6B,KAAM6yB,EAAM6G,IAAK7kD,OAAQwhD,EAASqD,IAAI,KACjEtH,EAAa2X,GAAGrP,MAAQ,CAAE16B,KAAM6yB,EAAMwP,GAAIxtD,OAAQwhD,EAASlD,KAAK,KAChEf,EAAa2X,GAAGpP,SAAW,CAAE36B,KAAM6yB,EAAM0P,IAAK1tD,OAAQwhD,EAASlD,KAAK,KAKpEf,EAAaC,KAAOr8B,KAAKxqB,MAAMwqB,KAAKjH,UAAUqjC,EAAaiD,KAG3D,IAAIJ,EAAoB7C,EAAaC,KAOrCn3B,EAAK8uC,cAAgB,SAAUx2E,GAC7B,IAAI1C,GAAeshE,EAAc5+D,GAG/B,MAAM,IAAI8Q,MAAM,eAAiB9Q,EAAO,iCAAmCjD,OAAOyB,KAAKogE,GAAc/7D,KAAK,OAF1G4+D,EAAoB7C,EAAa5+D,EAIrC,EAOA0nC,EAAK+uC,cAAgB,WACnB,IAAK,MAAMr5E,KAAOwhE,EAChB,GAAIthE,GAAeshE,EAAcxhE,IAC3BwhE,EAAaxhE,KAASqkE,EACxB,OAAOrkE,CAIf,EAMAsqC,EAAKgvC,eAAiB,CACpBlyD,UAAW,SAAUvpB,GACnB,OAAIA,SAAAA,EAAGwgB,WAAmB,IAAI+I,EAAUnmB,OAAOpD,EAAE6D,IAAImsB,IAAI5sB,OAAOpD,EAAEK,IAAI2uB,MAAM5rB,OAAOpD,EAAEyJ,IAC9E,IAAI8f,EAAUvpB,EAAI,GAC3B,EAEA0pB,SAAU,SAAU1pB,GAClB,OAAO,IAAI0pB,EAAS1pB,EACtB,EAEAwpB,QAAS,SAAUxpB,GACjB,OAAOA,CACT,EAEAmlB,OAAQ,SAAUnlB,GAChB,OAAIA,SAAAA,EAAGwgB,WAAmB2E,EAAOnlB,GAC1BA,CACT,GAUFysC,EAAKrqC,UAAUujE,iBAAmB,WAChC,MAAMp2D,EAAUk9B,EAAKgvC,eAAej8E,KAAKktC,aACzC,GAAIn9B,EACF,OAAOA,EAET,MAAM,IAAIrJ,UAAU,gCAAkC1G,KAAKktC,YAAc,IAC3E,EAUAD,EAAKq3B,oBAAsB,SAAUj+D,GACnC,IAAK4mC,EAAKgvC,eAAe51E,GACvB,MAAM,IAAIK,UAAU,qBAAuBL,EAAO,KAGpD,OAAO4mC,EAAKgvC,eAAe51E,EAC7B,EAGA,IAAK,MAAM1D,KAAOiiE,EAChB,GAAI/hE,GAAe+hE,EAAOjiE,GAAM,CAC9B,MAAMovC,EAAO6yB,EAAMjiE,GACnBovC,EAAK5M,WAAa4M,EAAKprB,KAAKwe,UAC9B,CAIF,IAAK,MAAM5/B,KAAQowE,EACjB,GAAI9yE,GAAe8yE,EAASpwE,GAAO,CACjC,MAAMwsC,EAAO6yB,EAAM+Q,EAAQpwE,IACrB22E,EAAQ,CAAC,EACf,IAAK,MAAMv5E,KAAOovC,EACZlvC,GAAekvC,EAAMpvC,KACvBu5E,EAAMv5E,GAAOovC,EAAKpvC,IAGtBu5E,EAAM32E,KAAOA,EACbq/D,EAAMr/D,GAAQ22E,CAChB,CAyRF,OA/QAjvC,EAAKq2B,aAAe,SAAuB5+D,GACzC,MAAO,aAAac,KAAKd,EAC3B,EAmCAuoC,EAAKkvC,WAAa,SAAU5lE,EAAKvO,GAC/B,GAAqB,iBAATuO,EACV,MAAM,IAAI7P,UAAU,6DAItB,GAAIsB,GAAWA,EAAQ8P,SACrB,IAAK,MAAMnV,KAAO4T,EAIhB,GAHI1T,GAAe0T,EAAK5T,IACtBsqC,EAAKmvC,WAAWz5E,GAEd4T,EAAI5T,GAAK05E,QACX,IAAK,IAAIv6E,EAAI,EAAGA,EAAIyU,EAAI5T,GAAK05E,QAAQt7E,OAAQe,IAC3CmrC,EAAKmvC,WAAW7lE,EAAI5T,GAAK05E,QAAQv6E,IAOzC,IAAIw6E,EACJ,IAAK,MAAM35E,KAAO4T,EACZ1T,GAAe0T,EAAK5T,KACtB25E,EAAWrvC,EAAKsvC,iBAAiB55E,EAAK4T,EAAI5T,KAG9C,OAAO25E,CACT,EAyBArvC,EAAKsvC,iBAAmB,SAAUh3E,EAAMgR,GAKtC,GAJI,MAAQA,IACVA,EAAM,CAAC,GAGa,iBAAVhR,EACV,MAAM,IAAImB,UAAU,mEAItB,GAAI7D,GAAe+hE,EAAOr/D,GACxB,MAAM,IAAI8Q,MAAM,uBAAyB9Q,EAAO,4CAhGpD,SAAgCA,GAC9B,IAAK,IAAIzD,EAAI,EAAGA,EAAIyD,EAAKxE,OAAQe,IAAK,CAGpC,GAFA4C,EAAIa,EAAKyoB,OAAOlsB,GAEN,IAANA,IAAYmrC,EAAKq2B,aAAa5+D,GAAM,MAAM,IAAI2R,MAAM,yDAA2D9Q,EAAO,KAE1H,GAAIzD,EAAI,IAAOmrC,EAAKq2B,aAAa5+D,KAC/Bo+D,EAAQp+D,GAAO,MAAM,IAAI2R,MAAM,kEAAoE9Q,EAAO,IAC9G,CACF,CA4FEi3E,CAAsBj3E,GAEtB,IAGI+Y,EACAumD,EACA4X,EALAC,EAAU,KACVL,EAAU,GACV1sE,EAAS,EAIb,GAAI4G,GAAoB,SAAbA,EAAIlQ,KACbq2E,EAAUnmE,EAAIkN,aACT,GAAqB,iBAATlN,EACL,KAARA,IACF+H,EAAa/H,OAEV,IAAqB,iBAATA,EASjB,MAAM,IAAI7P,UAAU,uBAAyBnB,EAAO,WAAagR,EAAI3D,WAAa,+CARlF0L,EAAa/H,EAAI+H,WACjBumD,EAAWtuD,EAAIsuD,SACfl1D,EAAS4G,EAAI5G,OACb8sE,EAAWlmE,EAAIkmE,SACXlmE,EAAI8lE,UACNA,EAAU9lE,EAAI8lE,QAAQ78D,UAI1B,CAEA,GAAI68D,EACF,IAAK,IAAIv6E,EAAI,EAAGA,EAAIu6E,EAAQt7E,OAAQe,IAClC,GAAIe,GAAe+hE,EAAOyX,EAAQv6E,IAChC,MAAM,IAAIuU,MAAM,wBAA0BgmE,EAAQv6E,GAAK,2CAK7D,GAAIwc,GAAsC,iBAAhBA,IAA6Bo+D,EACrD,IACEA,EAAUzvC,EAAK1vB,MAAMe,EAAY,CAAE+lD,cAAc,GACnD,CAAE,MAAO9nD,GAEP,MADAA,EAAGhW,QAAU,0BAA4BhB,EAAO,WAAa+Y,EAAa,MAAQ/B,EAAGhW,QAC9EgW,CACT,MACS+B,GAAkC,SAApBA,EAAWjY,OAClCq2E,EAAUp+D,EAAWmF,SAGvB44D,EAAUA,GAAW,GACrB1sE,EAASA,GAAU,EACqBk1D,EAApCA,GAAYA,EAAS1S,aAA0BiW,EAASvD,EAAS1S,gBAAoDiW,EAASlD,KAIlI,IAAIyX,EAAU,CAAC,EACf,GAAKD,EAqCE,CACLC,EAAU,CACRp3E,OACAiC,MAAOk1E,EAAQl1E,MACf29B,WAAYu3C,EAAQv3C,WAAWjjC,MAAM,GACrC2iE,WACAl1D,UAIF,IAAIitE,GAAW,EACf,IAAK,MAAM96E,KAAKmjE,EACd,GAAIpiE,GAAeoiE,EAAYnjE,GAAI,CACjC,IAAI0G,GAAQ,EACZ,IAAK,IAAIzG,EAAI,EAAGA,EAAI6gE,EAAgB7hE,OAAQgB,IAC1C,GAAIuL,KAAKsa,KAAK+0D,EAAQx3C,WAAWpjC,IAAM,IAAMkjE,EAAWnjE,GAAGqjC,WAAWpjC,IAAM,IAAM,MAAO,CACvFyG,GAAQ,EACR,KACF,CAEF,GAAIA,EAAO,CACTo0E,GAAW,EACXD,EAAQh2D,KAAOs+C,EAAWnjE,GAC1B,KACF,CACF,CAEF,IAAK86E,EAAU,CACbH,EAAWA,GAAYl3E,EAAO,SAE9B,MAAMs3E,EAAc,CAAE13C,WAAYu3C,EAAQv3C,WAAWjjC,MAAM,IAC3D26E,EAAYl6E,IAAM85E,EAClBxX,EAAWwX,GAAYI,EAEvB7V,EAAkByV,GAAY,CAC5B1qC,KAAM4qC,EACN/1D,OAAQwhD,EAASlD,KAAK,KAGxByX,EAAQh2D,KAAOs+C,EAAWwX,EAC5B,CACF,KA9Ec,CAGZ,GADAA,EAAWA,GAAYl3E,EAAO,SAC1Bq9D,EAAgB94D,QAAQ2yE,IAAa,EACvC,MAAM,IAAIpmE,MAAM,gCAAkC9Q,EAAO,2EAE3Dq9D,EAAgB5gE,KAAKy6E,GAGrB,IAAK,MAAM/iE,KAAKurD,EACVpiE,GAAeoiE,EAAYvrD,KAC7BurD,EAAWvrD,GAAGyrB,WAAWy9B,EAAgB7hE,OAAS,GAAK,GAK3D,MAAM87E,EAAc,CAAE13C,WAAY,IAClC,IAAK,IAAIrjC,EAAI,EAAGA,EAAI8gE,EAAgB7hE,OAAQe,IAC1C+6E,EAAY13C,WAAWrjC,GAAK,EAE9B+6E,EAAY13C,WAAWy9B,EAAgB7hE,OAAS,GAAK,EACrD87E,EAAYl6E,IAAM85E,EAClBxX,EAAWwX,GAAYI,EAEvBF,EAAU,CACRp3E,OACAiC,MAAO,EACP29B,WAAY8/B,EAAWwX,GAAUt3C,WAAWjjC,MAAM,GAClD2iE,WACAl1D,SACAgX,KAAMs+C,EAAWwX,IAGnBzV,EAAkByV,GAAY,CAC5B1qC,KAAM4qC,EACN/1D,OAAQwhD,EAASlD,KAAK,IAE1B,CA2CAj4B,EAAK23B,MAAMr/D,GAAQo3E,EAEnB,IAAK,IAAI76E,EAAI,EAAGA,EAAIu6E,EAAQt7E,OAAQe,IAAK,CACvC,MAAMg7E,EAAYT,EAAQv6E,GACpBo6E,EAAQ,CAAC,EACf,IAAK,MAAMv5E,KAAOg6E,EACZ95E,GAAe85E,EAASh6E,KAC1Bu5E,EAAMv5E,GAAOg6E,EAAQh6E,IAGzBu5E,EAAM32E,KAAOu3E,EACb7vC,EAAK23B,MAAMkY,GAAaZ,CAC1B,CAKA,cAFOlY,EAAU/B,MAEV,IAAIh1B,EAAK,KAAM1nC,EACxB,EAEA0nC,EAAKmvC,WAAa,SAAU72E,UACnB0nC,EAAK23B,MAAMr/D,UAGXy+D,EAAU/B,KACnB,EAGAh1B,EAAKm7B,SAAWA,EAChBn7B,EAAK21B,gBAAkBA,EACvB31B,EAAKg4B,WAAaA,EAClBh4B,EAAKk3B,aAAeA,EACpBl3B,EAAK23B,MAAQA,EAEN33B,CAAI,GACV,CAAE9hB,SAAS,ICr0GR5lB,GAAO,OAIAw3E,GAAqCp9E,GAAQ4F,GAHrC,CAAC,QAAS,SAG+ClC,IAAqB,IAApB,MAAE4C,EAAK,KAAEgnC,GAAM5pC,EA4B5F,OAAO4C,EAAMV,GAAM,CACjB0nC,KAAM,SAAUzsC,GACd,OAAOA,EAAEijB,OACX,EAEAgqB,OAAQ,SAAUjtC,GAChB,OAAIysC,EAAK64B,gBAAgBtlE,GAChB,IAAIysC,EAAK,KAAMzsC,GAGjBysC,EAAK1vB,MAAM/c,EAAG,CAAE6jE,cAAc,GACvC,EAEA,yDAA0D,SAAU78D,EAAOuqC,GACzE,OAAO,IAAI9E,EAAKzlC,EAAOuqC,EACzB,EAEA,gCAAiC,SAAUvqC,GAEzC,OAAO,IAAIylC,EAAKzlC,EAClB,EAEA,iBAAkBvB,EAAM6L,aAAYH,GAAQnR,GAAKulC,GAAQvlC,EAAGmR,MAC5D,ICxDEpM,GAAO,SAGAy3E,GAA+Br9E,GAAQ4F,GAF/B,CAAC,QAAS,iBAEyClC,IAA6B,IAA5B,MAAE4C,EAAK,aAAEqoC,GAAcjrC,EAkC9F,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,OAAO,IAAI+oC,EAAa,GAC1B,EAEAb,OAAQ,SAAU7N,GAChB,OAAO,IAAI0O,EAAa,GAAI1O,EAC9B,EAEA,iBAAkB,SAAUr7B,GAC1B,OAAO,IAAI+pC,EAAa/pC,EAC1B,EAEA,yBAA0B,SAAUA,EAAMq7B,GACxC,OAAO,IAAI0O,EAAa/pC,EAAMq7B,EAChC,GACA,ICrDEr6B,GAAO,aAGA03E,GAAmCt9E,GAAQ4F,GAFnC,CAAC,QAAS,SAE6ClC,IAAqB,IAApB,MAAE4C,EAAK,KAAEgnC,GAAM5pC,EA2C1F,OAAO4C,EAAMV,GAAM,CAGjB,iBAAkB,SAAUgR,EAAKvO,GAC/B,OAAOilC,EAAKkvC,WAAW5lE,EAAKvO,EAC9B,EAGA1F,OAAQ,SAAUiU,GAChB,OAAO02B,EAAKkvC,WAAW5lE,EAAK,CAAC,EAC/B,EAGA,yCAA0C,SAAUhR,EAAM23E,EAAKl1E,GAC7D,MAAMuO,EAAM,CAAC,EAEb,OADAA,EAAIhR,GAAQ23E,EACLjwC,EAAKkvC,WAAW5lE,EAAKvO,EAC9B,EAGA,iCAAkC,SAAUzC,EAAM23E,GAChD,MAAM3mE,EAAM,CAAC,EAEb,OADAA,EAAIhR,GAAQ23E,EACLjwC,EAAKkvC,WAAW5lE,EAAK,CAAC,EAC/B,EAGAk3B,OAAQ,SAAUloC,GAChB,MAAMgR,EAAM,CAAC,EAEb,OADAA,EAAIhR,GAAQ,CAAC,EACN0nC,EAAKkvC,WAAW5lE,EAAK,CAAC,EAC/B,GACA,IC9EEhR,GAAO,OAGA43E,GAA6Bx9E,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,YAE6BlC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EAyB/F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAKA,IAAM,GAAKA,GAAK,GAAMklB,EAAOu3B,YACzB3vC,KAAKokB,KAAKlxB,GAEV,IAAIwpB,EAAQxpB,EAAG,GAAGkxB,MAE7B,EAEA1H,QAAS,SAAUxpB,GACjB,OAAOA,EAAEkxB,MACX,EAEA3H,UAAW,SAAUvpB,GACnB,OAAOA,EAAEkxB,MACX,GACA,IC5CE4D,GAAK,SAQJ,SAAS8nD,GAAa58E,GAC3B,OAAO2oB,GAAM3oB,EACf,CAGO,SAAS68E,GAAY78E,GAC1B,OAAO8M,KAAKukB,KAAK,EAAIrxB,EACvB,CAGO,SAAS88E,GAAa98E,GAC3B,OAAO8kB,SAAS9kB,IACX8M,KAAK2Y,KAAKzlB,EAAI,GAAKA,GAAK8M,KAAK2Y,IAAIzlB,GAAKA,EAAI,KAAO,EAClD,CACN,CAGO,SAAS+8E,GAAY/8E,GAC1B,OAAO8M,KAAKglB,KAAK,EAAI9xB,EACvB,CAGO,SAASg9E,GAAah9E,GAC3B,MAAMi9E,EAAO,EAAIj9E,EACjB,OAAO8M,KAAK2Y,IAAIw3D,EAAOnwE,KAAK8b,KAAKq0D,EAAOA,EAAO,GACjD,CAGO,SAASC,GAAYl9E,GAC1B,OAAO8M,KAAKokB,KAAK,EAAIlxB,EACvB,CAGO,SAASm9E,GAAan9E,GAC3B,MAAMi9E,EAAO,EAAIj9E,EACX86B,EAAMhuB,KAAK8b,KAAKq0D,EAAOA,EAAO,GACpC,OAAOnwE,KAAK2Y,IAAIqV,EAAMmiD,EACxB,CAQO,SAASG,GAAap9E,GAC3B,OAAO6oB,GAAM7oB,EACf,CAaO,SAASq9E,GAAar9E,GAC3B,OAAO8oB,GAAM9oB,EACf,CAaO,SAASs9E,GAAWt9E,GACzB,OAAO,EAAI8M,KAAKknB,IAAIh0B,EACtB,CAGO,SAASu9E,GAAYv9E,GAC1B,MAAMwY,EAAI1L,KAAKkZ,IAAI,EAAIhmB,GACvB,OAAQwY,EAAI,IAAMA,EAAI,EACxB,CAGO,SAASglE,GAAWx9E,GACzB,OAAO,EAAI8M,KAAK8mB,IAAI5zB,EACtB,CAGO,SAASy9E,GAAYz9E,GAE1B,OAAU,IAANA,EACK6pB,OAAO23C,kBAEP10D,KAAKsa,IAAI,GAAKta,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,KAAOulB,GAAKvlB,EAE7D,CAGO,SAAS09E,GAAW19E,GACzB,OAAO,EAAI8M,KAAK4hB,IAAI1uB,EACtB,CAGO,SAAS29E,GAAY39E,GAC1B,OAAO,GAAK8M,KAAKkZ,IAAIhmB,GAAK8M,KAAKkZ,KAAKhmB,GACtC,CAQO,SAAS49E,GAAY59E,GAC1B,OAAOgpB,GAAKhpB,EACd,CAnHA48E,GAAYr1E,UAAYutB,GAKxB+nD,GAAWt1E,UAAYutB,GAOvBgoD,GAAYv1E,UAAYutB,GAKxBioD,GAAWx1E,UAAYutB,GAMvBkoD,GAAYz1E,UAAYutB,GAKxBooD,GAAW31E,UAAYutB,GAOvBqoD,GAAY51E,UAAYutB,GAUxBsoD,GAAY71E,UAAYutB,GAexBuoD,GAAY91E,UAAYutB,GAexBwoD,GAAU/1E,UAAYutB,GAMtByoD,GAAWh2E,UAAYutB,GAKvB0oD,GAAUj2E,UAAYutB,GAUtB2oD,GAAWl2E,UAAYutB,GAKvB4oD,GAAUn2E,UAAYutB,GAKtB6oD,GAAWp2E,UAAYutB,GAUvB8oD,GAAWr2E,UAAYutB,GC9HvB,MAAM/vB,GAAO,QAGA84E,GAA8B1+E,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,YAE8BlC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EAsBhG,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,GAAK,GAAKklB,EAAOu3B,YACZmgC,GAAY58E,GAEjBA,IAAM,EACD,IAAIwpB,EAAQ1c,KAAK2Y,IAAI3Y,KAAK8b,KAAK5oB,EAAIA,EAAI,GAAKA,GAAI8M,KAAKme,IAEvD,IAAIzB,EAAQxpB,EAAG,GAAG2oB,OAC3B,EAEAa,QAAS,SAAUxpB,GACjB,OAAOA,EAAE2oB,OACX,EAEAY,UAAW,SAAUvpB,GACnB,OAAOA,EAAE2oB,OACX,GACA,IC3CE5jB,GAAO,OAGA+4E,GAA6B3+E,GAAQ4F,GAF7B,CAAC,QAAS,cAEuClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAwBzF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ03D,GAERrzD,QAAS,SAAUxpB,GACjB,OAAOA,EAAE+9E,MACX,EAEAx0D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAGqxB,MACjC,GACA,ICrCEtsB,GAAO,QAGAi5E,GAA8B7+E,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,UAAW,cAEmBlC,IAA2C,IAA1C,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,EAAO,UAAED,GAAW1mB,EAuB3G,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,GAAK,GAAKA,IAAM,GAAKklB,EAAOu3B,YACvBqgC,GAAY98E,GAEd,IAAIwpB,EAAQxpB,EAAG,GAAGi+E,OAC3B,EAEAz0D,QAAS,SAAUxpB,GACjB,OAAOA,EAAEi+E,OACX,EAEA10D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAG8oB,OACjC,GACA,ICzCE/jB,GAAO,OAGAm5E,GAA6B/+E,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,UAAW,cAEkBlC,IAA2C,IAA1C,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,EAAO,UAAED,GAAW1mB,EAwB1G,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,IAAM,GAAKA,GAAK,GAAKklB,EAAOu3B,YACvBsgC,GAAW/8E,GAEb,IAAIwpB,EAAQxpB,EAAG,GAAGm+E,MAC3B,EAEA30D,QAAS,SAAUxpB,GACjB,OAAOA,EAAEm+E,MACX,EAEA50D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAG8xB,MACjC,GACA,IC1CE/sB,GAAO,QAGAq5E,GAA8Bj/E,GAAQ4F,GAF9B,CAAC,QAAS,cAEwClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAuB1F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ63D,GAERxzD,QAAS,SAAUxpB,GACjB,OAAOA,EAAEq+E,OACX,EAEA90D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAG6oB,OACjC,GACA,ICpCE9jB,GAAO,OAGAu5E,GAA6Bn/E,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,UAAW,cAEkBlC,IAA2C,IAA1C,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,EAAO,UAAED,GAAW1mB,EAyB1G,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAIA,IAAM,GAAKA,GAAK,GAAKklB,EAAOu3B,YACvBygC,GAAWl9E,GAEb,IAAIwpB,EAAQxpB,EAAG,GAAGu+E,MAC3B,EAEA/0D,QAAS,SAAUxpB,GACjB,OAAOA,EAAEu+E,MACX,EAEAh1D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAGkxB,MACjC,GACA,IC3CEnsB,GAAO,QAGAy5E,GAA8Br/E,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,UAAW,cAEmBlC,IAA2C,IAA1C,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,EAAO,UAAED,GAAW1mB,EAuB3G,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,GAAKA,GAAK,GAAKA,IAAM,GAAMklB,EAAOu3B,YAAa,CAC7C,MAAMwgC,EAAO,EAAIj9E,EACjB,GAAIi9E,EAAO,GAAK/3D,EAAOu3B,YACrB,OAAO0gC,GAAYn9E,GAGrB,MAAM86B,EAAMhuB,KAAK8b,KAAKq0D,EAAOA,EAAO,GACpC,OAAO,IAAIzzD,EAAQ1c,KAAK2Y,IAAIqV,EAAMmiD,GAAOnwE,KAAKme,GAChD,CAEA,OAAO,IAAIzB,EAAQxpB,EAAG,GAAGy+E,OAC3B,EAEAj1D,QAAS,SAAUxpB,GACjB,OAAOA,EAAEy+E,OACX,EAEAl1D,UAAW,SAAUvpB,GACnB,OAAO,IAAIupB,EAAU,GAAGyG,IAAIhwB,GAAG2oB,OACjC,GACA,ICjDE5jB,GAAO,OAGA25E,GAA6Bv/E,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,YAE6BlC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EAyB/F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAKA,IAAM,GAAKA,GAAK,GAAMklB,EAAOu3B,YACzB3vC,KAAKglB,KAAK9xB,GAEV,IAAIwpB,EAAQxpB,EAAG,GAAG8xB,MAE7B,EAEAtI,QAAS,SAAUxpB,GACjB,OAAOA,EAAE8xB,MACX,EAEAvI,UAAW,SAAUvpB,GACnB,OAAOA,EAAE8xB,MACX,GACA,ICxCS6sD,GAA8Bx/E,GAH9B,QACQ,CAAC,UAEiD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAuB/E,OAAO4C,EAAM,QAAS,CACpB0f,OAAQi4D,GAER5zD,QAAS,SAAUxpB,GACjB,OAAOA,EAAE6oB,OACX,EAEAU,UAAW,SAAUvpB,GACnB,OAAOA,EAAE6oB,OACX,GACA,IClCS+1D,GAA6Bz/E,GAH7B,OACQ,CAAC,UAEgD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAwB9E,OAAO4C,EAAM,OAAQ,CACnB0f,OAAQ,SAAUnlB,GAChB,OAAO8M,KAAKukB,KAAKrxB,EACnB,EAEAwpB,QAAS,SAAUxpB,GACjB,OAAOA,EAAEqxB,MACX,EAEA9H,UAAW,SAAUvpB,GACnB,OAAOA,EAAEqxB,MACX,GACA,ICjCEtsB,GAAO,QAUA85E,GAA8B1/E,GAAQ4F,GAT9B,CACnB,QACA,SACA,cACA,YACA,cACA,WAGqElC,IAAoE,IAAnE,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,UAAE7jB,EAAS,YAAEE,EAAW,OAAE7iB,GAAQ/D,EACpI,MAAMg4C,EAAgBvC,GAAoB,CAAE7yC,QAAO2nC,gBAC7C0N,EAAgB/B,GAAoB,CAAEtzC,UACtCw7C,EAAiBH,GAAqB,CAAEr7C,QAAO2nC,gBAC/C0J,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C2J,EAAgBd,GAAoB,CAAExwC,QAAOgkB,gBAC7CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAgCzE,OAAOnB,EACLV,GACA,CACE,iBAAkB+H,KAAKurB,MAOvB,uBAAwBymD,CAAC7+E,EAAGD,IAAMupB,EAAU8O,MAAMp4B,EAAGD,IAEvDg7C,EAAqB,CACnBR,OAAQ,qBACRD,GAAI0G,EACJhH,GAAIa,EACJd,GAAIa,EACJH,GAAI5D,EACJ6D,GAAI5D,IAEP,ICzEGhyC,GAAO,QAGAg6E,GAA8B5/E,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,YAE8BlC,IAAgC,IAA/B,MAAE4C,EAAK,OAAEyf,EAAM,QAAEsE,GAAS3mB,EAuBhG,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUnlB,GAChB,OAAKA,GAAK,GAAKA,IAAM,GAAMklB,EAAOu3B,YACzB4gC,GAAYr9E,GAEd,IAAIwpB,EAAQxpB,EAAG,GAAG8oB,OAC3B,EAEAU,QAAS,SAAUxpB,GACjB,OAAOA,EAAE8oB,OACX,EAEAS,UAAW,SAAUvpB,GACnB,OAAOA,EAAE8oB,OACX,GACA,IC1CSk2D,GAAiC7/E,GAC5C,WAAY,CAAC,UAAU0D,IAAA,IAAC,MAAE4C,GAAO5C,EAAA,MAAM,CACrC4pC,KAAMhnC,EAAM6L,aAAYH,GAAQnR,IAC9B,IAAKA,EAAEs7B,QAAQt7B,EAAE6E,YAAY4/D,WAAWmI,OACtC,MAAM,IAAI1mE,UAAU,oCAEtB,OAAOT,EAAMwR,KAAK9F,EAAMnR,EAAE0sC,YAAnBjnC,CAAgCzF,EAAEgH,MAAM,IAElD,ICJUi4E,GAA4B9/E,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EAC7E,MAAMq8E,EAAWF,GAAe,CAAEv5E,UA6BlC,OAAOA,EAjCI,MAiCQ,CACjB0f,OAAQrY,KAAK4hB,IACb,sBAAuB1uB,GAAKA,EAAE0uB,OAC7BwwD,EAAS,ICpCRn6E,GAAO,OAGAo6E,GAA6BhgF,GAAQ4F,GAF7B,CAAC,UAEgDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAuB9E,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQi6D,GACR,sBAAuBp/E,GAAKA,EAAE+oB,QAC9B,ICzBSs2D,GAA4BlgF,GAH5B,MACQ,CAAC,QAAS,cAEsC0D,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBxF,OAAO4C,EA5BI,MA4BQ,CACjB0f,OAAQm4D,GACR9zD,QAASxpB,GAAKA,EAAEs/E,MAChB/1D,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAEg0B,QA3BxBgrD,GAAe,CAAEv5E,UA4BtB,ICjCRV,GAAO,OAGAw6E,GAA6BpgF,GAAQ4F,GAF7B,CAAC,QAAS,cAEuClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBzF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQo4D,GACR/zD,QAASxpB,GAAKA,EAAEw/E,OAChBj2D,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAEipB,SACvC,IC5BSw2D,GAA4BtgF,GAH5B,MACQ,CAAC,QAAS,cAEsC0D,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBxF,OAAO4C,EA5BI,MA4BQ,CACjB0f,OAAQq4D,GACRh0D,QAASxpB,GAAKA,EAAE0/E,MAChBn2D,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAE4zB,QA3BxBorD,GAAe,CAAEv5E,UA4BtB,ICjCRV,GAAO,OAGA46E,GAA6BxgF,GAAQ4F,GAF7B,CAAC,QAAS,cAEuClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBzF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQs4D,GACRj0D,QAASxpB,GAAKA,EAAE4/E,OAChBr2D,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAEgpB,SACvC,IC5BS62D,GAA4B1gF,GAH5B,MACQ,CAAC,QAAS,cAEsC0D,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBxF,OAAO4C,EA5BI,MA4BQ,CACjB0f,OAAQu4D,GACRl0D,QAASxpB,GAAKA,EAAE6wE,MAChBtnD,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAE0uB,QA3BxBswD,GAAe,CAAEv5E,UA4BtB,ICjCRV,GAAO,OAGA+6E,GAA6B3gF,GAAQ4F,GAF7B,CAAC,QAAS,cAEuClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE8jB,GAAW1mB,EAyBzF,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQw4D,GACRn0D,QAASxpB,GAAKA,EAAE+/E,OAChBx2D,UAAWvpB,GAAK,IAAIupB,EAAU,GAAGyG,IAAIhwB,EAAE+oB,SACvC,IC7BSi3D,GAA4B7gF,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EAC7E,MAAMq8E,EAAWF,GAAe,CAAEv5E,UA6BlC,OAAOA,EAjCI,MAiCQ,CACjB0f,OAAQrY,KAAK8mB,IACb,sBAAuB5zB,GAAKA,EAAE4zB,OAC7BsrD,EAAS,ICpCRn6E,GAAO,OAGAk7E,GAA6B9gF,GAAQ4F,GAF7B,CAAC,UAEgDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAuB9E,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQy4D,GACR,sBAAuB59E,GAAKA,EAAEgpB,QAC9B,IC1BSk3D,GAA4B/gF,GAH5B,MACQ,CAAC,UAE+C0D,IAAe,IAAd,MAAE4C,GAAO5C,EAC7E,MAAMq8E,EAAWF,GAAe,CAAEv5E,UA0BlC,OAAOA,EA9BI,MA8BQ,CACjB0f,OAAQrY,KAAKknB,IACb,sBAAuBh0B,GAAKA,EAAEg0B,OAC7BkrD,EAAS,IC9BDiB,GAA6BhhF,GAH7B,OACQ,CAAC,UAEgD0D,IAAe,IAAd,MAAE4C,GAAO5C,EA0B9E,OAAO4C,EAAM,OAAQ,CACnB0f,OAAQi7D,GACR,sBAAuBpgF,GAAKA,EAAEipB,QAC9B,IChCElkB,GAAO,eAGAs7E,GAAqClhF,GAAQ4F,GAFrC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEElC,IAAiE,IAAhE,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,EAAK,YAAE97B,GAAa5mB,EAuBxI,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,IAAIt/E,EAAS,GAEb,GAAuC,IAAnCo+B,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,KAAgD,IAAnClmB,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IAAW,CAChF,MAAMi7B,EAAKvmE,GAAQhV,MAAMC,QAAQo7E,GAAMA,EAAKA,EAAGthD,WAAW70B,KAAKmxD,GACzDmlB,EAAKxmE,GAAQhV,MAAMC,QAAQq7E,GAAMA,EAAKA,EAAGvhD,WAAW70B,KAAKmxD,GAC/Dr6D,EAAS,GACT,IAAK,IAAIK,EAAI,EAAGA,EAAIk/E,EAAGjgF,OAAQe,IAC7B,IAAK,IAAIC,EAAI,EAAGA,EAAIk/E,EAAGlgF,OAAQgB,IAC7BN,EAAOO,KAAK,CAACg/E,EAAGl/E,GAAIm/E,EAAGl/E,IAG7B,CAEA,OAAI0D,MAAMC,QAAQo7E,IAAOr7E,MAAMC,QAAQq7E,GAC9Bt/E,EAGF,IAAIwoB,EAAYxoB,EACzB,GACA,IC/CE8D,GAAO,gBAGA27E,GAAsCvhF,GAAQ4F,GAFtC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEGlC,IAAiE,IAAhE,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,EAAK,YAAE97B,GAAa5mB,EAsBzI,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,IAAIt/E,EACJ,GAAuC,IAAnCo+B,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,IAC7BtkD,EAAS,OACJ,IAAuC,IAAnCo+B,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IACpC,OAAOtrC,GAAQqmE,EAAGthD,WACb,CACL,MAAMwhD,EAAKx8C,GAAS/pB,GAAQhV,MAAMC,QAAQo7E,GAAMA,EAAKA,EAAGthD,WAAW70B,KAAKmxD,IAClEmlB,EAAKz8C,GAAS/pB,GAAQhV,MAAMC,QAAQq7E,GAAMA,EAAKA,EAAGvhD,WAAW70B,KAAKmxD,IAExE,IAAIqlB,EADJ1/E,EAAS,GAET,IAAK,IAAIK,EAAI,EAAGA,EAAIk/E,EAAGjgF,OAAQe,IAAK,CAClCq/E,GAAO,EACP,IAAK,IAAIp/E,EAAI,EAAGA,EAAIk/E,EAAGlgF,OAAQgB,IAC7B,GAAiD,IAA7C+5D,EAAeklB,EAAGl/E,GAAG0F,MAAOy5E,EAAGl/E,GAAGyF,QAAgBw5E,EAAGl/E,GAAG2iC,aAAew8C,EAAGl/E,GAAG0iC,WAAY,CAC3F08C,GAAO,EACP,KACF,CAEGA,GACH1/E,EAAOO,KAAKg/E,EAAGl/E,GAEnB,CACF,EAEA,OAAI2D,MAAMC,QAAQo7E,IAAOr7E,MAAMC,QAAQq7E,GAC9Br8C,GAAWjjC,GAGb,IAAIwoB,EAAYya,GAAWjjC,GACpC,GACA,ICzDE8D,GAAO,cAGA67E,GAAoCzhF,GAAQ4F,GAFpC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEClC,IAAiE,IAAhE,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,EAAK,YAAE97B,GAAa5mB,EAoBvI,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUoU,GAC1B,IAAIlY,EACJ,GAAsC,IAAlCo+B,EAAO5f,EAAKtG,GAAI,IAAIosC,EAAM,IAC5BtkD,EAAS,OACJ,CACL,MAAMiY,EAAIe,GAAQhV,MAAMC,QAAQiU,GAAKA,EAAIA,EAAE6lB,WAAW70B,KAAKmxD,GAC3Dr6D,EAAS,GACTA,EAAOO,KAAK0X,EAAE,IACd,IAAK,IAAI5X,EAAI,EAAGA,EAAI4X,EAAE3Y,OAAQe,IACW,IAAnCg6D,EAAepiD,EAAE5X,GAAI4X,EAAE5X,EAAI,KAC7BL,EAAOO,KAAK0X,EAAE5X,GAGpB,CAEA,OAAI2D,MAAMC,QAAQiU,GACTlY,EAGF,IAAIwoB,EAAYxoB,EACzB,GACA,IC7CE8D,GAAO,eAGA87E,GAAqC1hF,GAAQ4F,GAFrC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,QAAS,gBAEElC,IAAiE,IAAhE,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,EAAK,YAAE97B,GAAa5mB,EAsBxI,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,IAAIt/E,EACJ,GAAuC,IAAnCo+B,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,KAAgD,IAAnClmB,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IACrEtkD,EAAS,OACJ,CACL,MAAMu/E,EAAKx8C,GAAS/pB,GAAQhV,MAAMC,QAAQo7E,GAAMA,EAAKA,EAAGthD,WAAW70B,KAAKmxD,IAClEmlB,EAAKz8C,GAAS/pB,GAAQhV,MAAMC,QAAQq7E,GAAMA,EAAKA,EAAGvhD,WAAW70B,KAAKmxD,IACxEr6D,EAAS,GACT,IAAK,IAAIK,EAAI,EAAGA,EAAIk/E,EAAGjgF,OAAQe,IAC7B,IAAK,IAAIC,EAAI,EAAGA,EAAIk/E,EAAGlgF,OAAQgB,IAC7B,GAAiD,IAA7C+5D,EAAeklB,EAAGl/E,GAAG0F,MAAOy5E,EAAGl/E,GAAGyF,QAAgBw5E,EAAGl/E,GAAG2iC,aAAew8C,EAAGl/E,GAAG0iC,WAAY,CAC3FhjC,EAAOO,KAAKg/E,EAAGl/E,IACf,KACF,CAGN,CAEA,OAAI2D,MAAMC,QAAQo7E,IAAOr7E,MAAMC,QAAQq7E,GAC9Br8C,GAAWjjC,GAGb,IAAIwoB,EAAYya,GAAWjjC,GACpC,GACA,IClDE8D,GAAO,cAGA+7E,GAAoC3hF,GAAQ4F,GAFpC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEUlC,IAAoD,IAAnD,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,GAAO1iD,EAsB1H,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,GAAuC,IAAnClhD,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,IAC7B,OAAO,EACF,GAAuC,IAAnClmB,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IACpC,OAAO,EAET,MAAMi7B,EAAKx8C,GAAS/pB,GAAQhV,MAAMC,QAAQo7E,GAAMA,EAAKA,EAAGthD,WAAW70B,KAAKmxD,IAClEmlB,EAAKz8C,GAAS/pB,GAAQhV,MAAMC,QAAQq7E,GAAMA,EAAKA,EAAGvhD,WAAW70B,KAAKmxD,IACxE,IAAIqlB,EACJ,IAAK,IAAIr/E,EAAI,EAAGA,EAAIk/E,EAAGjgF,OAAQe,IAAK,CAClCq/E,GAAO,EACP,IAAK,IAAIp/E,EAAI,EAAGA,EAAIk/E,EAAGlgF,OAAQgB,IAC7B,GAAiD,IAA7C+5D,EAAeklB,EAAGl/E,GAAG0F,MAAOy5E,EAAGl/E,GAAGyF,QAAgBw5E,EAAGl/E,GAAG2iC,aAAew8C,EAAGl/E,GAAG0iC,WAAY,CAC3F08C,GAAO,EACP,KACF,CAEF,IAAa,IAATA,EACF,OAAO,CAEX,CACA,OAAO,CACT,GACA,ICjDE57E,GAAO,kBAGAg8E,GAAwC5hF,GAAQ4F,GAFxC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEclC,IAAoD,IAAnD,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,GAAO1iD,EAsB9H,OAAO4C,EAAMV,GAAM,CACjB,0DAA2D,SAAUyT,EAAGW,GACtE,GAAsC,IAAlCkmB,EAAO5f,EAAKtG,GAAI,IAAIosC,EAAM,IAC5B,OAAO,EAET,MAAMrsC,EAAIe,GAAQhV,MAAMC,QAAQiU,GAAKA,EAAIA,EAAE6lB,WAC3C,IAAI1jB,EAAQ,EACZ,IAAK,IAAIha,EAAI,EAAGA,EAAI4X,EAAE3Y,OAAQe,IACI,IAA5Bg6D,EAAepiD,EAAE5X,GAAIkX,IACvB8C,IAGJ,OAAOA,CACT,GACA,ICvCEvW,GAAO,cAGAi8E,GAAoC7hF,GAAQ4F,GAFpC,CAAC,QAAS,OAAQ,SAAU,iBAAkB,UAEUlC,IAAoD,IAAnD,MAAE4C,EAAK,KAAEga,EAAI,OAAE4f,EAAM,eAAEi8B,EAAc,MAAE/V,GAAO1iD,EAoB1H,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUoU,GAC1B,GAAsC,IAAlCkmB,EAAO5f,EAAKtG,GAAI,IAAIosC,EAAM,IAC5B,MAAO,GAET,MAAMrsC,EAAIe,GAAQhV,MAAMC,QAAQiU,GAAKA,EAAIA,EAAE6lB,WAAW70B,KAAKmxD,GACrDr6D,EAAS,GACf,IAAIkkB,EAAS,EACb,KAAOA,EAAO/S,SAAS,GAAG7R,QAAU2Y,EAAE3Y,QACpCU,EAAOO,KAAKy/E,EAAQ/nE,EAAGiM,EAAO/S,SAAS,GAAG5I,MAAM,IAAIikB,YACpDtI,IAGF,OAgBJ,SAAgB6E,GACd,IAAI2L,EAAO,GACX,IAAK,IAAIr0B,EAAI0oB,EAAMzpB,OAAS,EAAGe,EAAI,EAAGA,IACpC,IAAK,IAAIC,EAAI,EAAGA,EAAID,EAAGC,IACjByoB,EAAMzoB,GAAGhB,OAASypB,EAAMzoB,EAAI,GAAGhB,SACjCo1B,EAAO3L,EAAMzoB,GACbyoB,EAAMzoB,GAAKyoB,EAAMzoB,EAAI,GACrByoB,EAAMzoB,EAAI,GAAKo0B,GAIrB,OAAO3L,CACT,CA5BWk3D,CAAMjgF,EACf,IAIF,SAASggF,EAASj3D,EAAOm3D,GACvB,MAAMlgF,EAAS,GACf,IAAK,IAAIK,EAAI,EAAGA,EAAI6/E,EAAS5gF,OAAQe,IACf,MAAhB6/E,EAAS7/E,IACXL,EAAOO,KAAKwoB,EAAM1oB,IAGtB,OAAOL,CACT,CAeA,IChEI8D,GAAO,UAGAq8E,GAAgCjiF,GAAQ4F,GAFhC,CAAC,QAAS,mBAE0ClC,IAA+B,IAA9B,MAAE4C,EAAK,eAAE61D,GAAgBz4D,EAuBjG,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUoU,GAC1B,OAAOlU,MAAMC,QAAQiU,GAAKc,GAAQd,GAAG5Y,OAAS0Z,GAAQd,EAAE6lB,WAAWz+B,MACrE,EACA,0BAA2B,SAAU4Y,EAAGkoE,GACtC,IAAe,IAAXA,GAAiC,IAAbloE,EAAE5Y,OACxB,OAAO0E,MAAMC,QAAQiU,GAAKc,GAAQd,GAAG5Y,OAAS0Z,GAAQd,EAAE6lB,WAAWz+B,OAC9D,CACL,MAAM2Y,EAAIe,GAAQhV,MAAMC,QAAQiU,GAAKA,EAAIA,EAAE6lB,WAAW70B,KAAKmxD,GAC3D,IAAIhgD,EAAQ,EACZ,IAAK,IAAIha,EAAI,EAAGA,EAAI4X,EAAE3Y,OAAQe,IACW,IAAnCg6D,EAAepiD,EAAE5X,GAAI4X,EAAE5X,EAAI,KAC7Bga,IAGJ,OAAOA,CACT,CACF,GACA,IC5CEvW,GAAO,mBAGAu8E,GAAyCniF,GAAQ4F,GAFzC,CAAC,QAAS,OAAQ,SAAU,SAAU,gBAAiB,UAEMlC,IAA2D,IAA1D,MAAE4C,EAAK,KAAEga,EAAI,OAAE7Y,EAAM,OAAEy4B,EAAM,cAAEkiD,EAAa,MAAEh8B,GAAO1iD,EAsBtI,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,GAAuC,IAAnClhD,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,IAC7B,OAAOtrC,GAAQsmE,GACV,GAAuC,IAAnClhD,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IACpC,OAAOtrC,GAAQqmE,GAEjB,MAAME,EAAKvmE,GAAQqmE,GACbG,EAAKxmE,GAAQsmE,GACnB,OAAO35E,EAAO26E,EAAcf,EAAIC,GAAKc,EAAcd,EAAID,GACzD,GACA,ICpCEz7E,GAAO,WAGAy8E,GAAiCriF,GAAQ4F,GAFjC,CAAC,QAAS,OAAQ,SAAU,SAAU,eAAgB,mBAAoB,UAErBlC,IAA4E,IAA3E,MAAE4C,EAAK,KAAEga,EAAI,OAAE7Y,EAAM,OAAEy4B,EAAM,aAAEoiD,EAAY,iBAAEC,EAAgB,MAAEn8B,GAAO1iD,EAsB/I,OAAO4C,EAAMV,GAAM,CACjB,iCAAkC,SAAUu7E,EAAIC,GAC9C,GAAuC,IAAnClhD,EAAO5f,EAAK6gE,GAAK,IAAI/6B,EAAM,IAC7B,OAAOtrC,GAAQsmE,GACV,GAAuC,IAAnClhD,EAAO5f,EAAK8gE,GAAK,IAAIh7B,EAAM,IACpC,OAAOtrC,GAAQqmE,GAEjB,MAAME,EAAKvmE,GAAQqmE,GACbG,EAAKxmE,GAAQsmE,GACnB,OAAO35E,EAAO86E,EAAiBlB,EAAIC,GAAKgB,EAAajB,EAAIC,GAC3D,GACA,ICtBSkB,GAA4BxiF,GAX5B,MACQ,CACnB,QACA,SACA,YACA,cACA,cACA,eACA,WAMA0D,IAAkF,IAAjF,MAAE4C,EAAK,OAAEykB,EAAM,UAAEozB,EAAS,YAAElQ,EAAW,YAAE3jB,EAAW,aAAEqkB,EAAY,OAAElnC,GAAQ/D,EAC3E,MAAM84C,EAAiBV,GAAqB,CAAEx1C,UACxCm2C,EAAmBV,GAAuB,CAAEz1C,QAAO2nC,gBACnDyO,EAAiBV,GAAqB,CAAE11C,QAAOgkB,gBAC/CuxB,EAAuBnB,GAA2B,CAAEp0C,QAAOykB,SAAQtjB,WAmCzE,OAAOnB,EArDE,MAuDP,CACE,WAAY63C,EAEZ,mBAAoB73C,EAAM6L,aAAYH,GAAQ,CAACnR,EAAGC,EAAGs/C,KACnD,IAAIt+C,EAASkQ,EAAKnR,EAAGC,GAErB,IAAK,IAAIqB,EAAI,EAAGA,EAAIi+C,EAAKh/C,OAAQe,IAC/BL,EAASkQ,EAAKlQ,EAAQs+C,EAAKj+C,IAG7B,OAAOL,CAAM,KAGjB+5C,EAAqB,CACnBjB,KAAMuD,EACNrD,GAAI0B,EACJpB,GAAIqB,EACJlB,GAAImB,IAEP,IC5EC92C,GAAO,QAYA68E,GAA8BziF,GAAQ4F,GAX9B,CACnB,QACA,MACA,YACA,eACA,iBACA,OACA,UACA,eAGqElC,IAAwF,IAAvF,MAAE4C,EAAK,IAAE2hB,EAAG,UAAEk2B,EAAS,aAAEmR,EAAY,eAAElR,EAAc,KAAE30B,EAAI,QAAEg4B,EAAO,WAAEvuB,GAAYxvB,EA6BxJ,OAAO4C,EAAMV,GAAM,CACjB,yBAA0B88E,EAE1B58E,MAAO48E,EAEP3iD,OAAQxC,GAAKmlD,EAAO5nE,GAAQyiB,EAAEsC,WAAW,MAS3C,SAAS6iD,EAAQ/1E,GAGf,IAAI7K,EAAS,EACT6gF,EAAU,EAEd,IAAK,IAAIxgF,EAAI,EAAGA,EAAIwK,EAAKvL,OAAQe,IAAK,CACpC,GAAIif,EAAUzU,EAAKxK,IACjB,MAAM,IAAI4E,UAAU,wCAEtB,MAAMc,EAAQogB,EAAItb,EAAKxK,IACnBs/C,EAAQkhC,EAAS96E,IACnB/F,EAASs8C,EAAet8C,EACtBs8C,EAAekR,EAAaqzB,EAAS96E,GAAQynD,EAAaqzB,EAAS96E,KACrE/F,EAASq8C,EAAUr8C,EAAQ,GAC3B6gF,EAAU96E,GAEV/F,EAASq8C,EAAUr8C,EAAQoxB,EAAWrrB,GAClCu2C,EAAekR,EAAaznD,EAAO86E,GAAUrzB,EAAaznD,EAAO86E,IACjE96E,EAER,CAEA,OAAOu2C,EAAeukC,EAASl5D,EAAK3nB,GACtC,KCjFI8D,GAAO,OAiBAg9E,GAA6B5iF,GACxC4F,GAjBmB,CACnB,QACA,MACA,MACA,MACA,OACA,OACA,WACA,cACA,SACA,UACA,SACA,aACA,SAMAlC,IAcM,IAdL,MACC4C,EAAK,IACL2hB,EAAG,IACH1c,EAAG,IACHgP,EAAG,KACH20C,EAAI,KACJzlC,EAAI,SACJ6uB,EAAQ,YACRrK,EAAW,OACXgd,EAAM,QACNxJ,EAAO,OACP12B,EAAM,WACN83D,EAAU,KACVC,GACDp/E,EAuCC,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQrY,KAAKsa,IAEboC,QAAS,SAAUxpB,GACjB,OAAOA,EAAEonB,KACX,EAEAmC,UAAW,SAAUvpB,GAEnB,OAAOA,EAAEonB,KACX,EAEA4lB,QAAS,SAAUhtC,GAEjB,OAAO8M,KAAKsa,IAAIpnB,EAClB,EAEAiF,MAAO,SAAUjF,GACf,OAAOkiF,EAAMh4D,EAAOlqB,GAAI,EAC1B,EAEAk/B,OAAQ,SAAUl/B,GAChB,OAAOkiF,EAAMliF,EAAG,EAClB,EAEA,qCAAsC,SAAUA,EAAGmJ,GACjD,OAAO+4E,EAAMh4D,EAAOlqB,GAAImJ,EAC1B,EAEA,sCAAuC,SAAUnJ,EAAGmJ,GAClD,OAAO+4E,EAAMliF,EAAGmJ,EAClB,IA4LF,SAAS+4E,EAAOliF,EAAGmJ,GAEjB,MAAMg5E,EAAQniF,EAAEyf,OAGhB,GAAqB,IAAjB0iE,EAAM5hF,OACR,OAlJJ,SAAsBP,EAAGmJ,GAEvB,GAAIA,IAAM0gB,OAAO23C,mBAA2B,QAANr4D,EACpC,OA1CJ,SAAkCnJ,GAEhC,IAAIoiF,EAAO,EAQX,OANApiF,EAAE0D,SAAQ,SAAUsD,GAClB,MAAM5G,EAAIgnB,EAAIpgB,GACVojD,EAAOhqD,EAAGgiF,KACZA,EAAOhiF,EAEX,IAAG,GACIgiF,CACT,CA+BWC,CAAwBriF,GAEjC,GAAImJ,IAAM0gB,OAAOy4D,mBAA2B,SAANn5E,EACpC,OA1BJ,SAAmCnJ,GAEjC,IAAIuiF,EAQJ,OANAviF,EAAE0D,SAAQ,SAAUsD,GAClB,MAAM5G,EAAIgnB,EAAIpgB,GACTu7E,IAAQ3hC,EAAQxgD,EAAGmiF,KACtBA,EAAOniF,EAEX,IAAG,GACImiF,GAAQ,CACjB,CAeWC,CAAyBxiF,GAElC,GAAU,QAANmJ,EACF,OAAO+4E,EAAMliF,EAAG,GAElB,GAAiB,iBAANmJ,IAAmBiU,MAAMjU,GAAI,CAEtC,IAAKikC,EAAYjkC,EAAG,GAAI,CAEtB,IAAItF,EAAI,EAKR,OAHA7D,EAAE0D,SAAQ,SAAUsD,GAClBnD,EAAI6G,EAAIgP,EAAI0N,EAAIpgB,GAAQmC,GAAItF,EAC9B,IAAG,GACI6V,EAAI7V,EAAG,EAAIsF,EACpB,CACA,OAAO0gB,OAAO23C,iBAChB,CAEA,MAAM,IAAI3rD,MAAM,8BAClB,CAwHW4sE,CAAYziF,EAAGmJ,GAGxB,GAAqB,IAAjBg5E,EAAM5hF,OAAc,CACtB,GAAI4hF,EAAM,IAAMA,EAAM,GACpB,OApCN,SAAsBniF,EAAGmJ,GAEvB,GAAU,IAANA,EACF,OArEJ,SAAyBnJ,GAEvB,MAAMkE,EAAI,GAEV,IAAIw+E,EAAO,EAUX,OARA1iF,EAAE0D,SAAQ,SAAUsD,EAAOrD,GACzB,MAAMpC,EAAIoC,EAAM,GACVg/E,EAAKj4E,EAAIxG,EAAE3C,IAAM,EAAG6lB,EAAIpgB,IAC1BojD,EAAOu4B,EAAID,KACbA,EAAOC,GAETz+E,EAAE3C,GAAKohF,CACT,IAAG,GACID,CACT,CAsDWE,CAAe5iF,GAExB,GAAImJ,IAAM0gB,OAAO23C,mBAA2B,QAANr4D,EACpC,OA9BJ,SAA8BnJ,GAE5B,MAAMub,EAAI,GAEV,IAAIsnE,EAAO,EAUX,OARA7iF,EAAE0D,SAAQ,SAAUsD,EAAOrD,GACzB,MAAMrC,EAAIqC,EAAM,GACVm/E,EAAKp4E,EAAI6Q,EAAEja,IAAM,EAAG8lB,EAAIpgB,IAC1BojD,EAAO04B,EAAID,KACbA,EAAOC,GAETvnE,EAAEja,GAAKwhF,CACT,IAAG,GACID,CACT,CAeWE,CAAoB/iF,GAE7B,GAAU,QAANmJ,EACF,OA1FJ,SAA+BnJ,GAE7B,IAAIgjF,EAAM,EAIV,OAHAhjF,EAAE0D,SAAQ,SAAUsD,EAAOrD,GACzBq/E,EAAMt4E,EAAIs4E,EAAKvrC,EAASzwC,EAAOqnD,EAAKrnD,IACtC,IACOogB,EAAIwB,EAAKo6D,GAClB,CAmFWC,CAAqBjjF,GAE9B,GAAU,IAANmJ,EACF,OAvDJ,SAAyBnJ,GAEvB,MAAMmiF,EAAQniF,EAAEyf,OAChB,GAAI0iE,EAAM,KAAOA,EAAM,GACrB,MAAM,IAAI16C,WAAW,6BAEvB,MAAMy7C,EAAKlB,EAAWhiF,GAChBmjF,EAAW1rC,EAASyrC,EAAIljF,GACxBojF,EAAYnB,EAAKkB,GAAU7jE,OAAO0f,UAClCqkD,EAAMD,EAAUA,EAAU7iF,OAAS,GACzC,OAAO6mB,EAAIwB,EAAKy6D,GAClB,CA4CWC,CAAetjF,GAGxB,MAAM,IAAI6V,MAAM,+BAAiC1M,EACnD,CAoBao6E,CAAYvjF,EAAGmJ,GAEtB,MAAM,IAAIs+B,WAAW,4BAEzB,CACF,KChTS+7C,GAA4BrkF,GAH5B,MACQ,CAAC,QAAS,YAAa,iBAAkB,OAAQ,SAED0D,IAAsD,IAArD,MAAE4C,EAAK,UAAE63C,EAAS,eAAEC,EAAc,KAAE8Q,EAAI,KAAE5uC,GAAM5c,EAwBpH,OAAO4C,EA3BI,MA2BQ,CACjB,2CA+BF,SAAoB0T,EAAGD,GACrB,MAAMujB,EAAIgnD,EAAatqE,EAAGD,GAEpBk9B,EAAQz1B,EAASxH,GAAKA,EAAE6oB,MAAQ7oB,EAChCy8B,EAAMj1B,EAASxH,GAAKA,EAAE0uB,WAAa1uB,EAAEgvB,mBAAgBrlC,EAErD22C,EAAQ94B,EAASzH,GAAKA,EAAE8oB,MAAQ9oB,EAChC2/B,EAAMl4B,EAASzH,GAAKA,EAAE2uB,WAAa3uB,EAAEivB,mBAAgBrlC,EAGrD4gF,EAAgC,IAApBjiD,EAAMtoB,GAAG5Y,OACrBojF,EAAgC,IAApBliD,EAAMvoB,GAAG3Y,OAE3B,IAAImK,EAAM4yC,EACNrpB,EAAMspB,EAGV,GAAI3H,GAAOiD,GAAOjD,IAAQiD,GAAsB,iBAARjD,GAA4B,UAARA,EAAiB,CAC3E,MAAMC,EAAKD,EAEXlrC,EAAMjF,EAAMwR,KAAKqmC,EAAW,CAACzH,EAAIA,IACjC5hB,EAAMxuB,EAAMwR,KAAKsmC,EAAgB,CAAC1H,EAAIA,GACxC,CAGA,IAAK6tC,IAAcC,EAAW,CAC5B,IAAIz/E,EAAI+vB,EAAIo6B,EAAKjY,EAAM,IAAKqD,EAAM,IAClC,IAAK,IAAIn4C,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB4C,EAAIwG,EAAIxG,EAAG+vB,EAAIo6B,EAAKjY,EAAM90C,IAAKm4C,EAAMn4C,KAEvC,OAAO4C,CACT,CAGA,IAAKw/E,GAAaC,EAAW,CAC3B,IAAIz/E,EAAI+vB,EAAIo6B,EAAKjY,EAAM,IAAKqD,EAAM,GAAG,IACrC,IAAK,IAAIn4C,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB4C,EAAIwG,EAAIxG,EAAG+vB,EAAIo6B,EAAKjY,EAAM90C,IAAKm4C,EAAMn4C,GAAG,KAE1C,OAAO4C,CACT,CAGA,GAAIw/E,IAAcC,EAAW,CAC3B,IAAIz/E,EAAI+vB,EAAIo6B,EAAKjY,EAAM,GAAG,IAAKqD,EAAM,IACrC,IAAK,IAAIn4C,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB4C,EAAIwG,EAAIxG,EAAG+vB,EAAIo6B,EAAKjY,EAAM90C,GAAG,IAAKm4C,EAAMn4C,KAE1C,OAAO4C,CACT,CAGA,GAAIw/E,GAAaC,EAAW,CAC1B,IAAIz/E,EAAI+vB,EAAIo6B,EAAKjY,EAAM,GAAG,IAAKqD,EAAM,GAAG,IACxC,IAAK,IAAIn4C,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB4C,EAAIwG,EAAIxG,EAAG+vB,EAAIo6B,EAAKjY,EAAM90C,GAAG,IAAKm4C,EAAMn4C,GAAG,KAE7C,OAAO4C,CACT,CACF,EAzFE,6BA2FF,SAAqBlE,EAAGC,GACtBwjF,EAAazjF,EAAGC,GAEhB,MAAM2jF,EAAS5jF,EAAE4rC,OACXi4C,EAAU7jF,EAAE0rC,QAEZo4C,EAAS7jF,EAAE2rC,OACXm4C,EAAU9jF,EAAEyrC,QAGlB,IAAIxnC,EAAI,EACR,MAAMwG,EAAM4yC,EACNrpB,EAAMspB,EAEZ,IAAIj8C,EAAI,EACJC,EAAI,EACR,KAAOD,EAAIsiF,EAAOrjF,QAAUgB,EAAIuiF,EAAOvjF,QAAQ,CAC7C,MAAMoqC,EAAIi5C,EAAOtiF,GACXspC,EAAIk5C,EAAOviF,GAEbopC,EAAIC,EACNtpC,IAGEqpC,EAAIC,EACNrpC,IAGEopC,IAAMC,IACR1mC,EAAIwG,EAAIxG,EAAG+vB,EAAI4vD,EAAQviF,GAAIyiF,EAAQxiF,KACnCD,IACAC,IAEJ,CAEA,OAAO2C,CACT,IA5HA,SAASu/E,EAAczjF,EAAGC,GACxB,MAAM6lD,EAAQrkB,EAAMzhC,GACd+lD,EAAQtkB,EAAMxhC,GACpB,IAAI+jF,EAAMC,EAEV,GAAqB,IAAjBn+B,EAAMvlD,OACRyjF,EAAOl+B,EAAM,OACR,IAAqB,IAAjBA,EAAMvlD,QAA6B,IAAbulD,EAAM,GAGrC,MAAM,IAAIre,WAAW,2DAA6Dqe,EAAMl+C,KAAK,MAAQ,KAFrGo8E,EAAOl+B,EAAM,EAGf,CAEA,GAAqB,IAAjBC,EAAMxlD,OACR0jF,EAAOl+B,EAAM,OACR,IAAqB,IAAjBA,EAAMxlD,QAA6B,IAAbwlD,EAAM,GAGrC,MAAM,IAAIte,WAAW,2DAA6Dse,EAAMn+C,KAAK,MAAQ,KAFrGq8E,EAAOl+B,EAAM,EAGf,CAEA,GAAIi+B,IAASC,EAAM,MAAM,IAAIx8C,WAAW,mCAAqCu8C,EAAO,OAASC,EAAO,KACpG,GAAa,IAATD,EAAY,MAAM,IAAIv8C,WAAW,qDAErC,OAAOu8C,CACT,CAsGA,SAASviD,EAAOzhC,GACd,OAAO2gB,EAAS3gB,GAAKA,EAAEyf,OAASA,EAAKzf,EACvC,KC7JWkkF,GAA8B/kF,GAH9B,QACQ,CAAC,QAAS,SAAU,QAE8B0D,IAA4B,IAA3B,MAAE4C,EAAK,OAAEykB,EAAM,IAAExf,GAAK7H,EA4B5F,OAAO4C,EAAM,QAAS,CACpBR,MAAO,SAAsBjF,GAE3B,OAAOmkF,EAAYj6D,EAAOlqB,GAC5B,EAEA8tC,aA2CF,SAAuBve,GAErB,MAAMjQ,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KACRrsB,EAAO8P,EAAEkS,MAETkI,EAAOlqB,EAAK,GACZoqB,EAAUpqB,EAAK,GAErB,GAAIkqB,IAASE,EAAS,CAEpB,IAAItS,EAAM,EAEV,GAAIjY,EAAO/e,OAAS,EAElB,IAAK,IAAIgB,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAEhC,MAAMwqC,EAAKkC,EAAI1sC,GACTyqC,EAAKiC,EAAI1sC,EAAI,GAEnB,IAAK,IAAIjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAAK,CAE5B,MAAMgB,EAAIqC,EAAMrD,GAEhB,GAAIgB,IAAMC,EAAG,CAEXg2B,EAAM7sB,EAAI6sB,EAAKjY,EAAOhf,IAEtB,KACF,CACA,GAAIgB,EAAIC,EAEN,KAEJ,CACF,CAGF,OAAOg2B,CACT,CACA,MAAM,IAAIkQ,WAAW,gCAAkCnhB,GAAO7G,GAAQ,IACxE,EAnFEgK,YAAa06D,EAEb55C,IAAKtnB,KAGP,SAASkhE,EAAa50D,GAEpB,MAAM9P,EAAO8P,EAAEkS,MACT19B,EAAOwrB,EAAEyS,MAGf,OAAQviB,EAAKlf,QACX,KAAK,EAEH,GAAgB,IAAZkf,EAAK,GAEP,OAAOwD,GAAMlf,EAAK,IAEpB,MAAM,IAAI0jC,WAAW,gCAAkCnhB,GAAO7G,GAAQ,KACxE,KAAK,EACL,CAEE,MAAMkqB,EAAOlqB,EAAK,GAElB,GAAIkqB,IADSlqB,EAAK,GACC,CAEjB,IAAI8X,EAAM,EAEV,IAAK,IAAIj2B,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAOi2B,EAAM7sB,EAAI6sB,EAAKxzB,EAAKzC,GAAGA,IAExD,OAAOi2B,CACT,CACE,MAAM,IAAIkQ,WAAW,gCAAkCnhB,GAAO7G,GAAQ,IAE1E,CACA,QAEE,MAAM,IAAIgoB,WAAW,yCAA2CnhB,GAAO7G,GAAQ,KAErF,CA4CA,IC3HI1a,GAAO,QAGAq/E,GAA8BjlF,GAAQ4F,GAF9B,CAAC,QAAS,UAEwClC,IAAsB,IAArB,MAAE4C,EAAK,MAAE8/C,GAAO1iD,EAoCtF,OAAO4C,EAAMV,GAAM,CACjB,0DAA2D,SAAU+G,GACnE,MAAM28B,EAAS38B,EAAK5C,KAAI,SAAUsG,GAChC,OAAI4Q,EAAY5Q,GACPA,EAAIyY,WACF/iB,EAAQsK,IAAQmR,EAASnR,GAC3BA,EAAItG,KAAI,SAAUg5B,GAEvB,OAAO9hB,EAAY8hB,GAAQA,EAAKja,WAAaia,CAC/C,IAEO1yB,CAEX,IAEMirB,EAAM,IAAI8qB,EAEhB,OADAA,EAAMv4C,MAAMytB,EAAKgO,GACVhO,CACT,GACA,IC5DS4pD,GAAW,IAAI95E,IAAI,CAC9B,QCQW+5E,GAA6BnlF,GAH7B,OACQ,CAAC,sBAEgD0D,IAA2B,IAA1B,kBAAE0hF,GAAmB1hF,EAoX1F,OAtWA,MACE,QAAIgD,GAAU,MAAO,MAAO,CAC5B,UAAI+b,GAAY,OAAO,CAAK,CAO5B4iE,QAAAA,CAAUrgE,GACR,OAAO3kB,KAAKilF,UAAUD,SAASrgE,EACjC,CAUAsgE,OAAAA,GACE,MAAMC,EAAOllF,KAAKmlF,SAASJ,EAAmB,CAAC,GACzCz4E,EAAO,CAAC,EASd,MAAO,CACL04E,SAPF,SAAmBrgE,GACjB,MAAM1a,EAAIsW,EAAUoE,GAEpB,OArCN,SAAyBA,GACvB,IAAK,MAAMygE,IAAU,IAAIP,IACvB,GAAIlgE,EAAM3d,IAAIo+E,GACZ,MAAM,IAAI/uE,MAAM,sCAAwC+uE,EAAS,0BAGvE,CA8BMC,CAAep7E,GACRi7E,EAAKj7E,EAAGqC,EALD,KAMhB,EAKF,CAeA64E,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM,IAAIjvE,MAAM,+CAAiDrW,KAAKqG,KACxE,CAMAnC,OAAAA,CAASqM,GAEP,MAAM,IAAI8F,MAAM,yCAClB,CAQA3M,GAAAA,CAAK6G,GAEH,MAAM,IAAI8F,MAAM,qCAClB,CAQAkvE,OAAAA,CAAS5iE,GACP,IAAKP,EAAOO,GACV,MAAM,IAAIjc,UAAU,wCAEtB,OAAOic,CACT,CAQA6iE,QAAAA,CAAUj1E,GAGRA,EAASvQ,KAAM,KAAM,MAGrB,SAASylF,EAAW9iE,EAAMpS,GACxBoS,EAAKze,SAAQ,SAAU29B,EAAO6jD,EAAM3lB,GAClCxvD,EAASsxB,EAAO6jD,EAAM3lB,GACtB0lB,EAAU5jD,EAAOtxB,EACnB,GACF,CAEAk1E,CAAUzlF,KAAMuQ,EAClB,CAwBAo1E,SAAAA,CAAWp1E,GAYT,OAXA,SAASq1E,EAAY/jD,EAAO6jD,EAAM3lB,GAChC,MAAMjgC,EAAcvvB,EAASsxB,EAAO6jD,EAAM3lB,GAE1C,OAAIjgC,IAAgB+B,EAEX/B,EAGF+B,EAAMn4B,IAAIk8E,EACnB,CAEOA,CAAW5lF,KAAM,KAAM,KAChC,CAiBA0H,MAAAA,CAAQ6I,GACN,MAAM8wD,EAAQ,GAQd,OANArhE,KAAKwlF,UAAS,SAAU7iE,EAAM+iE,EAAM3lB,GAC9BxvD,EAASoS,EAAM+iE,EAAM3lB,IACvBsB,EAAMr/D,KAAK2gB,EAEf,IAEO0+C,CACT,CAMA59C,KAAAA,GAEE,MAAM,IAAIpN,MAAM,gCAClB,CAMAwvE,SAAAA,GACE,OAAO7lF,KAAK0J,KAAI,SAAUiZ,GACxB,OAAOA,EAAKkjE,WACd,GACF,CAQAl1D,MAAAA,CAAQ3Y,GACN,QAAOA,GACHhY,KAAKqG,OAAS2R,EAAM3R,MAAQwd,GAAgB7jB,KAAMgY,EAExD,CAiBApF,QAAAA,CAAU5K,GACR,MAAM89E,EAAe9lF,KAAK+lF,iBAAiB/9E,GAE3C,YAA4B,IAAjB89E,EACFA,EAGF9lF,KAAKgmF,UAAUh+E,EACxB,CAQAg+E,SAAAA,GAEE,MAAM,IAAI3vE,MAAM,iCAAmCrW,KAAKqG,KAC1D,CAQA0kB,MAAAA,GACE,MAAM,IAAI1U,MACR,sDAAwDrW,KAAKqG,KACjE,CAiBA4/E,MAAAA,CAAQj+E,GACN,MAAM89E,EAAe9lF,KAAK+lF,iBAAiB/9E,GAE3C,YAA4B,IAAjB89E,EACFA,EAGF9lF,KAAKkmF,QAAQl+E,EACtB,CAQAk+E,OAAAA,GAEE,MAAM,IAAI7vE,MAAM,+BAAiCrW,KAAKqG,KACxD,CAiBA8/E,KAAAA,CAAOn+E,GACL,MAAM89E,EAAe9lF,KAAK+lF,iBAAiB/9E,GAE3C,YAA4B,IAAjB89E,EACFA,EAGF9lF,KAAKomF,OAAOp+E,EACrB,CASAo+E,MAAAA,CAAQp+E,GAEN,MAAM,IAAIqO,MAAM,8BAAgCrW,KAAKqG,KACvD,CAKA0/E,gBAAAA,CAAkB/9E,GAChB,GAAIA,GAA8B,iBAAZA,EACpB,cAAeA,EAAQq+E,SACrB,IAAK,SACL,IAAK,YACH,OACF,IAAK,WACH,OAAOr+E,EAAQq+E,QAAQrmF,KAAMgI,GAC/B,QACE,MAAM,IAAItB,UAAU,2CAG5B,CAMA4/E,aAAAA,GACE,OAAOtmF,KAAKqG,IACd,CAMAkgF,UAAAA,GACE,OAAOvmF,IACT,EAGS,GACV,CAAEmrB,SAAS,EAAM/I,QAAQ,IC/X5B,SAASokE,GAAQjoE,GAGf,OAAOioE,GAAU,mBAAqB/nE,QAAU,iBAAmBA,OAAOmB,SAAW,SAAUrB,GAC7F,cAAcA,CAChB,EAAI,SAAUA,GACZ,OAAOA,GAAK,mBAAqBE,QAAUF,EAAElZ,cAAgBoZ,QAAUF,IAAME,OAAO7b,UAAY,gBAAkB2b,CACpH,EAAGioE,GAAQjoE,EACb,CCPA,SAASkoE,GAAgBztE,EAAG+C,EAAGxb,GAC7B,OAAQwb,ECAV,SAAuBxb,GACrB,IAAIuB,ECFN,SAAqBvB,GACnB,GAAI,UAAYimF,GAAQjmF,KAAOA,EAAG,OAAOA,EACzC,IAAIyY,EAAIzY,EAAEke,OAAOioE,aACjB,QAAI,IAAW1tE,EAAG,CAChB,IAAIlX,EAAIkX,EAAElW,KAAKvC,EAAGwb,UAClB,GAAI,UAAYyqE,GAAQ1kF,GAAI,OAAOA,EACnC,MAAM,IAAI4E,UAAU,+CACtB,CACA,OAAyB9C,OAAiBrD,EAC5C,CDPUmmF,CAAYnmF,GACpB,MAAO,UAAYimF,GAAQ1kF,GAAKA,EAAIA,EAAI,EAC1C,CDHc6kF,CAAc5qE,MAAO/C,EAAI1W,OAAOwT,eAAekD,EAAG+C,EAAG,CAC/DvU,MAAOjH,EACPie,YAAY,EACZ8F,cAAc,EACdsiE,UAAU,IACP5tE,EAAE+C,GAAKxb,EAAGyY,CACjB,CGDO,SAAS6tE,GAAgBj6E,GAC9B,OAAIA,GAAOA,EAAIu7B,aACN,IAAI3G,GACT50B,EAAIzI,MAAQ,EACZyI,EAAIW,IAAM,OACEjK,IAAZsJ,EAAIc,IAAoBd,EAAIc,IAAM,OAAIpK,GAGnCsJ,CACT,CCbO,SAASk6E,GAAazjF,GAAc,IAAZ,OAAEw8B,GAAQx8B,EAYvC,OAAO,SAAiB0b,EAAQ5a,GAC9B,IACE,GAAIsB,MAAMC,QAAQqZ,GAChB,OAAO8gB,EAAO9gB,EAAQ5a,GACjB,GAAI4a,GAAmC,mBAAlBA,EAAO8gB,OACjC,OAAO9gB,EAAO8gB,OAAO17B,GAChB,GAAsB,iBAAX4a,EAEhB,OAAO8gB,EAAO9gB,EAAQ5a,GACjB,GAAsB,iBAAX4a,EAAqB,CACrC,IAAK5a,EAAMi7D,mBACT,MAAM,IAAI14D,UAAU,mDAGtB,OAAOoY,EAAgBC,EAAQ5a,EAAMk7D,oBACvC,CACE,MAAM,IAAI34D,UAAU,iDAExB,CAAE,MAAOkG,GACP,MAAMi6E,GAAej6E,EACvB,CACF,CACF,CCtBA,MAAMrH,GAAO,eAMAwhF,GAAqCpnF,GAAQ4F,GALrC,CACnB,SACA,SAG4ElC,IAAsB,IAArB,OAAEw8B,EAAM,KAAEmnD,GAAM3jF,EAC7F,MAAM4jF,EAASH,GAAc,CAAEjnD,WAM/B,SAASqnD,EAAiBvkE,GAExB,QACER,EAAeQ,IACbN,EAAYM,IACZF,EAAeE,IACfK,EAAeL,IACfO,EAAaP,IACbQ,GAAkBR,IAClBW,GAAaX,GACnB,CAEA,MAAMwkE,UAAqBH,EAUzB3hF,WAAAA,CAAa0Z,EAAQ5a,GAEnB,GADAijF,SACKhlE,EAAOrD,GACV,MAAM,IAAIrY,UAAU,wCAEtB,IAAKuc,EAAY9e,GACf,MAAM,IAAIuC,UAAU,4CAGtB1G,KAAK+e,OAASA,EACd/e,KAAKmE,MAAQA,CACf,CAGA,QAAIoB,GACF,OAAIvF,KAAKmE,MACCnE,KAAKmE,MAAMi7D,mBACfp/D,KAAKmE,MAAMk7D,oBACX,GAEGr/D,KAAK+e,OAAOxZ,MAAQ,EAE/B,CAGA,QAAIc,GAAU,OAAOd,EAAK,CAC1B,kBAAI4c,GAAoB,OAAO,CAAK,CAepCgjE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM+B,EAAarnF,KAAK+e,OAAOomE,SAASrrE,EAAMwrE,GACxCgC,EAAYtnF,KAAKmE,MAAMghF,SAASrrE,EAAMwrE,GAE5C,GAAItlF,KAAKmE,MAAMi7D,mBAAoB,CACjC,MAAMnjD,EAAOjc,KAAKmE,MAAMk7D,oBACxB,OAAO,SAA2B16C,EAAOrY,EAAMi7E,GAE7C,OAAOzoE,EAAgBuoE,EAAW1iE,EAAOrY,EAAMi7E,GAAUtrE,EAC3D,CACF,CACE,OAAO,SAA2B0I,EAAOrY,EAAMi7E,GAC7C,MAAMxoE,EAASsoE,EAAW1iE,EAAOrY,EAAMi7E,GAEjCpjF,EAAQmjF,EAAU3iE,EAAOrY,EAAMyS,GACrC,OAAOkoE,EAAOloE,EAAQ5a,EACxB,CAEJ,CAMAD,OAAAA,CAASqM,GACPA,EAASvQ,KAAK+e,OAAQ,SAAU/e,MAChCuQ,EAASvQ,KAAKmE,MAAO,QAASnE,KAChC,CAQA0J,GAAAA,CAAK6G,GACH,OAAO,IAAI42E,EACTnnF,KAAKulF,QAAQh1E,EAASvQ,KAAK+e,OAAQ,SAAU/e,OAC7CA,KAAKulF,QAAQh1E,EAASvQ,KAAKmE,MAAO,QAASnE,OAE/C,CAMAyjB,KAAAA,GACE,OAAO,IAAI0jE,EAAannF,KAAK+e,OAAQ/e,KAAKmE,MAC5C,CAOA6hF,SAAAA,CAAWh+E,GACT,IAAI+W,EAAS/e,KAAK+e,OAAOnM,SAAS5K,GAKlC,OAJIk/E,EAAgBlnF,KAAK+e,UACvBA,EAAS,IAAMA,EAAS,KAGnBA,EAAS/e,KAAKmE,MAAMyO,SAAS5K,EACtC,CAOAk+E,OAAAA,CAASl+E,GACP,IAAI+W,EAAS/e,KAAK+e,OAAOknE,OAAOj+E,GAQhC,OAPIk/E,EAAgBlnF,KAAK+e,UACvBA,EACE,iEACAA,EACA,kEAGGA,EAAS/e,KAAKmE,MAAM8hF,OAAOj+E,EACpC,CAOAo+E,MAAAA,CAAQp+E,GACN,IAAI+W,EAAS/e,KAAK+e,OAAOonE,MAAMn+E,GAK/B,OAJIk/E,EAAgBlnF,KAAK+e,UACvBA,EAAS,iCAGJA,EAAS/e,KAAKmE,MAAMgiF,MAAMn+E,EACnC,CAMA+iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRwZ,OAAQ/e,KAAK+e,OACb5a,MAAOnE,KAAKmE,MAEhB,CAUA,eAAO8mB,CAAUC,GACf,OAAO,IAAIi8D,EAAaj8D,EAAKnM,OAAQmM,EAAK/mB,MAC5C,EAGF,OAFCsiF,GAzKKU,EAAY,OAkCF5hF,IAyIT4hF,CAAY,GAClB,CAAEh8D,SAAS,EAAM/I,QAAQ,IChNtB7c,GAAO,YAKAiiF,GAAkC7nF,GAAQ4F,GAJlC,CACnB,SAGyElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EAClF,MAAMokF,UAAkBT,EAOtB3hF,WAAAA,CAAaqiF,GAKX,GAJAN,QACApnF,KAAK0nF,MAAQA,GAAS,IAGjBjiF,MAAMC,QAAQ1F,KAAK0nF,SAAW1nF,KAAK0nF,MAAMp0E,MAAM8O,GAClD,MAAM,IAAI1b,UAAU,kCAExB,CAGA,QAAIL,GAAU,OAAOd,EAAK,CAC1B,eAAI8c,GAAiB,OAAO,CAAK,CAejC8iE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAMqC,EAAYj+E,GAAI1J,KAAK0nF,OAAO,SAAUxwE,GAC1C,OAAOA,EAAKiuE,SAASrrE,EAAMwrE,EAC7B,IAGA,GADyC,UAAvBxrE,EAAK4L,OAAOgF,OAChB,CACZ,MAAMA,EAAS5Q,EAAK4Q,OACpB,OAAO,SAAwB/F,EAAOrY,EAAMi7E,GAC1C,OAAO78D,EAAOhhB,GAAIi+E,GAAW,SAAUC,GACrC,OAAOA,EAASjjE,EAAOrY,EAAMi7E,EAC/B,IACF,CACF,CACE,OAAO,SAAwB5iE,EAAOrY,EAAMi7E,GAC1C,OAAO79E,GAAIi+E,GAAW,SAAUC,GAC9B,OAAOA,EAASjjE,EAAOrY,EAAMi7E,EAC/B,GACF,CAEJ,CAMArjF,OAAAA,CAASqM,GACP,IAAK,IAAIzO,EAAI,EAAGA,EAAI9B,KAAK0nF,MAAM3mF,OAAQe,IAErCyO,EADavQ,KAAK0nF,MAAM5lF,GACT,SAAWA,EAAI,IAAK9B,KAEvC,CAQA0J,GAAAA,CAAK6G,GACH,MAAMm3E,EAAQ,GACd,IAAK,IAAI5lF,EAAI,EAAGA,EAAI9B,KAAK0nF,MAAM3mF,OAAQe,IACrC4lF,EAAM5lF,GAAK9B,KAAKulF,QAAQh1E,EAASvQ,KAAK0nF,MAAM5lF,GAAI,SAAWA,EAAI,IAAK9B,OAEtE,OAAO,IAAIynF,EAAUC,EACvB,CAMAjkE,KAAAA,GACE,OAAO,IAAIgkE,EAAUznF,KAAK0nF,MAAMxlF,MAAM,GACxC,CAQA8jF,SAAAA,CAAWh+E,GAIT,MAAO,IAHOhI,KAAK0nF,MAAMh+E,KAAI,SAAUiZ,GACrC,OAAOA,EAAK/P,SAAS5K,EACvB,IACmBI,KAAK,MAAQ,GAClC,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRmiF,MAAO1nF,KAAK0nF,MAEhB,CASA,eAAOz8D,CAAUC,GACf,OAAO,IAAIu8D,EAAUv8D,EAAKw8D,MAC5B,CAQAxB,OAAAA,CAASl+E,GAIP,MAAO,kEAHOhI,KAAK0nF,MAAMh+E,KAAI,SAAUiZ,GACrC,OAAOA,EAAKsjE,OAAOj+E,EACrB,IAEQI,KAAK,yCACX,iEACJ,CAOAg+E,MAAAA,CAAQp+E,GAkBN,OAjBA,SAAS6/E,EAAYH,EAAOI,GAC1B,MAAMC,EAAaL,EAAMn+E,KAAK8Y,KAAiBqlE,EAAMp0E,MAAM+O,GACrD2lE,EAAeF,GAAUC,EACzBE,EAAUD,EAAe,IAAM,OAC/BE,EAAWR,EACdh+E,KAAI,SAAUiZ,GACb,OAAIA,EAAK+kE,MACAG,EAAWllE,EAAK+kE,OAAQI,GAExBnlE,EAAKwjE,MAAMn+E,EAEtB,IACCI,KAAK6/E,GACR,OAAOF,IAAeC,GAAiBA,IAAiBF,EACpD,mBAAqBI,EAAW,iBAChCA,CACN,CACOL,CAAW7nF,KAAK0nF,OAAO,EAChC,EAGF,OAFCjB,GApKKgB,EAAS,OAiBCliF,IAqJTkiF,CAAS,GACf,CAAEt8D,SAAS,EAAM/I,QAAQ,IC5JfyC,GAAa,CACxB,CACEsjE,eAAgB,CAAC,EACjBC,uBAAwB,CAAC,GAE3B,CACEC,gBAAiB,CACfC,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,IAKjB,CACE,kBAAmB,CACjB1lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,mBAAoB,CAClB5lE,GAAI,MACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,mBAAoB,CAClB5lE,GAAI,MACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,qBAAsB,CACpB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,sBAAuB,CACrB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,sBAAuB,CACrB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,qBAAsB,CACpB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,uBAAwB,CACtB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,sBAAuB,CACrB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,yBAA0B,CACxB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,wBAAyB,CACvB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnBC,eAAgB,CACdF,cAAe,OACfC,gBAAiB,KAGrB,CACE,yBAA0B,CACxB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,+BAAgC,CAC9B5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,6BAA8B,CAC5B5lE,GAAI,MACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,kBAAmB,CACjB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACEE,UAAW,CAAC,GAEd,CACE,mBAAoB,CAClB9lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,CAAC,mBAAoB,0BAExC,wBAAyB,CACvB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,wBAAyB,CACvB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,CACf,wBACA,sBACA,uBACA,uBAGJ,sBAAuB,CACrB5lE,GAAI,IACJ2lE,cAAe,OACfC,gBAAiB,GACjBJ,iBAAiB,EACjBC,kBAAkB,EAClBC,aAAa,GAKf,2BAA4B,CAC1B1lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,CACf,wBACA,sBACA,2BACA,0BAGJ,yBAA0B,CACxB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,IAEnB,mBAAoB,CAClB5lE,GAAI,MACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,wBAAyB,CACvBD,cAAe,OACfC,gBAAiB,CACf,wBACA,sBACA,uBACA,wBAIN,CACE,yBAA0B,CACxB5lE,GAAI,IACJ2lE,cAAe,SAEjB,0BAA2B,CACzB3lE,GAAI,IACJ2lE,cAAe,SAEjB,sBAAuB,CACrB3lE,GAAI,IACJ2lE,cAAe,SAEjB,mBAAoB,CAClB3lE,GAAI,MACJ2lE,cAAe,UAGnB,CACE,mBAAoB,CAClB3lE,GAAI,IACJ2lE,cAAe,QACfC,gBAAiB,GACjBH,kBAAkB,GAKpB,sBAAuB,CACrBzlE,GAAI,KACJ2lE,cAAe,QACfC,gBAAiB,KAGrB,CACE,uBAAwB,CACtB5lE,GAAI,KACJ2lE,cAAe,OACfC,gBAAiB,KAGrB,CACE,yBAA0B,CACxB5lE,GAAI,IACJ2lE,cAAe,SAGnB,CACE,0BAA2B,CACzB3lE,GAAI,IACJ2lE,cAAe,UAYrB,SAASI,GAAaC,EAAOC,GAC3B,IAAKA,GAA+B,SAAhBA,EAAwB,OAAOD,EACnD,IAAInmE,EAAOmmE,EACX,KAAO3lE,GAAkBR,IAAOA,EAAOA,EAAKqmE,QAC5C,OAAOrmE,CACT,CAaO,SAASsmE,GAAeH,EAAOC,EAAaG,EAAUnpB,GAC3D,IAAIp9C,EAAOmmE,EACS,SAAhBC,IAEFpmE,EAAOmmE,EAAMvC,cAEf,MAAM9hD,EAAa9hB,EAAK2jE,gBACxB,IAAI6C,EAAa,KACjB,IAAK,IAAIrnF,EAAI,EAAGA,EAAI+iB,GAAW9jB,OAAQe,IACrC,GAAI2iC,KAAc5f,GAAW/iB,GAAI,CAC/BqnF,EAAarnF,EACb,KACF,CAIF,GAAmB,0BAAf2iC,GAA0C9hB,EAAKumE,UAClC,SAAbA,EAAqB,CACvB,MAAME,EAAUP,GAAYlmE,EAAKrW,KAAK,GAAIy8E,GACpCtmE,EAAe2mE,IAAYrpB,GACA,wBAA3BA,EAAOumB,iBACP5jE,EAAUmmE,GAAY9oB,EAAOzzD,KAAK,GAAIy8E,KACV,wBAA5BK,EAAQ9C,iBACR5jE,EAAUmmE,GAAYO,EAAQ98E,KAAK,GAAIy8E,KACvCtmE,EAAeomE,GAAYO,EAAQ98E,KAAK,OAE5C68E,GAAc,EAElB,CACA,OAAOA,CACT,CAYO,SAASE,GAAkBP,EAAOC,GACvC,IAAIpmE,EAAOmmE,EACS,SAAhBC,IAEFpmE,EAAOmmE,EAAMvC,cAEf,MAAM9hD,EAAa9hB,EAAK2jE,gBAClBniF,EAAQ8kF,GAActmE,EAAMomE,GAClC,GAAc,OAAV5kF,EAEF,OAAO,KAET,MAAMogB,EAAWM,GAAW1gB,GAAOsgC,GAEnC,GAAI5hC,GAAe0hB,EAAU,iBAAkB,CAC7C,GAA+B,SAA3BA,EAASkkE,cACX,MAAO,OAET,GAA+B,UAA3BlkE,EAASkkE,cACX,MAAO,QAGT,MAAMpyE,MAAM,IAAOouB,EAAa,oCACpBlgB,EAASkkE,cAAgB,KACvC,CAGA,OAAO,IACT,CAWO,SAASa,GAAmBC,EAAOC,EAAOT,GAE/C,MAAMpvE,EAAqB,SAAhBovE,EAA0BQ,EAAMhD,aAAegD,EACpD7vE,EAAqB,SAAhBqvE,EAA0BQ,EAAMhD,aAAeiD,EACpDC,EAAc9vE,EAAE2sE,gBAChBoD,EAAchwE,EAAE4sE,gBAChBniF,EAAQ8kF,GAActvE,EAAGovE,GAC/B,GAAc,OAAV5kF,EAEF,OAAO,KAET,MAAMogB,EAAWM,GAAW1gB,GAAOslF,GAEnC,GAAI5mF,GAAe0hB,EAAU,oBACxBA,EAASmkE,2BAA2BjjF,MAAQ,CAC/C,IAAK,IAAI3D,EAAI,EAAGA,EAAIyiB,EAASmkE,gBAAgB3nF,OAAQe,IACnD,GAAIyiB,EAASmkE,gBAAgB5mF,KAAO4nF,EAClC,OAAO,EAGX,OAAO,CACT,CAGA,OAAO,IACT,CCjYA,MAAMnkF,GAAO,iBAOAokF,GAAuChqF,GAAQ4F,GANvC,CACnB,SACA,UACA,SAG8ElC,IAA8B,IAA7B,OAAEw8B,EAAM,OAAEnV,EAAM,KAAEs8D,GAAM3jF,EACvG,MAAM4jF,EAASH,GAAc,CAAEjnD,WACzBt9B,ECbD,SAAsBc,GAAsB,IAApB,OAAEw8B,EAAM,OAAEnV,GAAQrnB,EAe/C,OAAO,SAAiB0b,EAAQ5a,EAAOqD,GACrC,IACE,GAAI/B,MAAMC,QAAQqZ,GAQhB,OAPe2L,EAAO3L,GAAQ8gB,OAAO17B,EAAOqD,GAAOgY,UAG5Ctb,SAAQ,CAACgT,EAAM/S,KACpB4a,EAAO5a,GAAS+S,CAAI,IAGf6H,EACF,GAAIA,GAAmC,mBAAlBA,EAAO8gB,OACjC,OAAO9gB,EAAO8gB,OAAO17B,EAAOqD,GACvB,GAAsB,iBAAXuX,EAEhB,OAAO8gB,EAAO9gB,EAAQ5a,EAAOqD,GACxB,GAAsB,iBAAXuX,EAAqB,CACrC,IAAK5a,EAAMi7D,mBACT,MAAM14D,UAAU,mDAGlB,OADAwY,EAAgBH,EAAQ5a,EAAMk7D,oBAAqB73D,GAC5CuX,CACT,CACE,MAAM,IAAIrY,UAAU,iDAExB,CAAE,MAAOkG,GACP,MAAMi6E,GAAej6E,EACvB,CACF,CACF,CD/BiBg9E,CAAc,CAAE/pD,SAAQnV,WASvC,SAASw8D,EAAiBvkE,EAAMomE,EAAaG,GACtCH,IACHA,EAAc,QAGhB,MAAMI,EAAaF,GAActmE,EAAMomE,EAAaG,GAC9CW,EAAiBZ,GAActmE,EAAKnb,MAAOuhF,EAAaG,GAC9D,MAAwB,QAAhBH,GACe,OAAnBc,GAA6BA,GAAkBV,CACrD,CAEA,MAAMhB,UAAuBnB,EAgC3B3hF,WAAAA,CAAa0Z,EAAQ5a,EAAOqD,GAO1B,GANA4/E,QACApnF,KAAK+e,OAASA,EACd/e,KAAKmE,MAAQqD,EAAQrD,EAAQ,KAC7BnE,KAAKwH,MAAQA,GAASrD,GAGjBmf,GAAavE,KAAYoD,EAAepD,GAC3C,MAAM,IAAIrY,UAAU,mDAEtB,GAAI4c,GAAavE,IAA2B,QAAhBA,EAAOxZ,KACjC,MAAM,IAAI8Q,MAAM,iCAElB,GAAIrW,KAAKmE,QAAU8e,EAAYjjB,KAAKmE,OAClC,MAAM,IAAIuC,UAAU,iCAEtB,IAAK0b,EAAOpiB,KAAKwH,OACf,MAAM,IAAId,UAAU,2BAExB,CAMA,QAAInB,GACF,OAAIvF,KAAKmE,MACCnE,KAAKmE,MAAMi7D,mBACfp/D,KAAKmE,MAAMk7D,oBACX,GAEGr/D,KAAK+e,OAAOxZ,MAAQ,EAE/B,CAEA,QAAIc,GAAU,OAAOd,EAAK,CAC1B,oBAAI+c,GAAsB,OAAO,CAAK,CAetC6iE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM+B,EAAarnF,KAAK+e,OAAOomE,SAASrrE,EAAMwrE,GACxCgC,EAAYtnF,KAAKmE,MAAQnE,KAAKmE,MAAMghF,SAASrrE,EAAMwrE,GAAY,KAC/DwE,EAAY9pF,KAAKwH,MAAM29E,SAASrrE,EAAMwrE,GACtC//E,EAAOvF,KAAK+e,OAAOxZ,KAEzB,GAAKvF,KAAKmE,MAWH,IAAInE,KAAKmE,MAAMi7D,mBAAoB,CAExC,MAAMnjD,EAAOjc,KAAKmE,MAAMk7D,oBAExB,OAAO,SAA6B16C,EAAOrY,EAAMi7E,GAC/C,MAAMxoE,EAASsoE,EAAW1iE,EAAOrY,EAAMi7E,GACjC//E,EAAQsiF,EAAUnlE,EAAOrY,EAAMi7E,GAErC,OADAroE,EAAgBH,EAAQ9C,EAAMzU,GACvBA,CACT,CACF,CAAO,GAAI8b,GAAatjB,KAAK+e,QAE3B,OAAO,SAA6B4F,EAAOrY,EAAMi7E,GAC/C,MAAMwC,EAAc1C,EAAW1iE,EAAOrY,EAAMi7E,GACtC//E,EAAQsiF,EAAUnlE,EAAOrY,EAAMi7E,GAE/BpjF,EAAQmjF,EAAU3iE,EAAOrY,EAAMy9E,GAErC,OADAplE,EAAM1d,IAAI1B,EAAMhD,EAAOwnF,EAAa5lF,EAAOqD,IACpCA,CACT,EACK,CAOL,MAAMwiF,EAAmBhqF,KAAK+e,OAAOA,OAAOomE,SAASrrE,EAAMwrE,GAE3D,GAAItlF,KAAK+e,OAAO5a,MAAMi7D,mBAAoB,CACxC,MAAM6qB,EAAajqF,KAAK+e,OAAO5a,MAAMk7D,oBAErC,OAAO,SAA6B16C,EAAOrY,EAAMi7E,GAC/C,MAAMxnB,EAASiqB,EAAiBrlE,EAAOrY,EAAMi7E,GACvCwC,EAAcjrE,EAAgBihD,EAAQkqB,GAEtC9lF,EAAQmjF,EAAU3iE,EAAOrY,EAAMy9E,GAC/BviF,EAAQsiF,EAAUnlE,EAAOrY,EAAMi7E,GAGrC,OAFAroE,EACE6gD,EAAQkqB,EAAY1nF,EAAOwnF,EAAa5lF,EAAOqD,IAC1CA,CACT,CACF,CAAO,CAGL,MAAM0iF,EAAkBlqF,KAAK+e,OAAO5a,MAAMghF,SAASrrE,EAAMwrE,GAEzD,OAAO,SAA6B3gE,EAAOrY,EAAMi7E,GAC/C,MAAMxnB,EAASiqB,EAAiBrlE,EAAOrY,EAAMi7E,GAEvC4C,EAAcD,EAAgBvlE,EAAOrY,EAAMyzD,GAC3CgqB,EAAc9C,EAAOlnB,EAAQoqB,GAE7BhmF,EAAQmjF,EAAU3iE,EAAOrY,EAAMy9E,GAC/BviF,EAAQsiF,EAAUnlE,EAAOrY,EAAMi7E,GAIrC,OAFAhlF,EAAOw9D,EAAQoqB,EAAa5nF,EAAOwnF,EAAa5lF,EAAOqD,IAEhDA,CACT,CACF,CACF,EAtEE,IAAK8b,GAAatjB,KAAK+e,QACrB,MAAM,IAAIrY,UAAU,iCAGtB,OAAO,SAA6Bie,EAAOrY,EAAMi7E,GAC/C,MAAM//E,EAAQsiF,EAAUnlE,EAAOrY,EAAMi7E,GAErC,OADA5iE,EAAM1d,IAAI1B,EAAMiC,GACTA,CACT,CA+DJ,CAMAtD,OAAAA,CAASqM,GACPA,EAASvQ,KAAK+e,OAAQ,SAAU/e,MAC5BA,KAAKmE,OACPoM,EAASvQ,KAAKmE,MAAO,QAASnE,MAEhCuQ,EAASvQ,KAAKwH,MAAO,QAASxH,KAChC,CAQA0J,GAAAA,CAAK6G,GACH,MAAMwO,EAAS/e,KAAKulF,QAAQh1E,EAASvQ,KAAK+e,OAAQ,SAAU/e,OACtDmE,EAAQnE,KAAKmE,MACfnE,KAAKulF,QAAQh1E,EAASvQ,KAAKmE,MAAO,QAASnE,OAC3C,KACEwH,EAAQxH,KAAKulF,QAAQh1E,EAASvQ,KAAKwH,MAAO,QAASxH,OAEzD,OAAO,IAAImoF,EAAeppE,EAAQ5a,EAAOqD,EAC3C,CAMAic,KAAAA,GACE,OAAO,IAAI0kE,EAAenoF,KAAK+e,OAAQ/e,KAAKmE,MAAOnE,KAAKwH,MAC1D,CAOAw+E,SAAAA,CAAWh+E,GACT,MAAM+W,EAAS/e,KAAK+e,OAAOnM,SAAS5K,GAC9B7D,EAAQnE,KAAKmE,MAAQnE,KAAKmE,MAAMyO,SAAS5K,GAAW,GAC1D,IAAIR,EAAQxH,KAAKwH,MAAMoL,SAAS5K,GAMhC,OALIk/E,EACFlnF,KAAMgI,GAAWA,EAAQ+gF,YAAa/gF,GAAWA,EAAQkhF,YACzD1hF,EAAQ,IAAMA,EAAQ,KAGjBuX,EAAS5a,EAAQ,MAAQqD,CAClC,CAMAujB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRwZ,OAAQ/e,KAAK+e,OACb5a,MAAOnE,KAAKmE,MACZqD,MAAOxH,KAAKwH,MAEhB,CAUA,eAAOyjB,CAAUC,GACf,OAAO,IAAIi9D,EAAej9D,EAAKnM,OAAQmM,EAAK/mB,MAAO+mB,EAAK1jB,MAC1D,CAOA0+E,OAAAA,CAASl+E,GACP,MAAM+W,EAAS/e,KAAK+e,OAAOknE,OAAOj+E,GAC5B7D,EAAQnE,KAAKmE,MAAQnE,KAAKmE,MAAM8hF,OAAOj+E,GAAW,GACxD,IAAIR,EAAQxH,KAAKwH,MAAMy+E,OAAOj+E,GAQ9B,OAPIk/E,EACFlnF,KAAMgI,GAAWA,EAAQ+gF,YAAa/gF,GAAWA,EAAQkhF,YACzD1hF,EAAQ,iEACNA,EACA,kEAGGuX,EAAS5a,EAAT4a,uHAGLvX,CACJ,CAOA4+E,MAAAA,CAAQp+E,GACN,MAAM+W,EAAS/e,KAAK+e,OAAOonE,MAAMn+E,GAC3B7D,EAAQnE,KAAKmE,MAAQnE,KAAKmE,MAAMgiF,MAAMn+E,GAAW,GACvD,IAAIR,EAAQxH,KAAKwH,MAAM2+E,MAAMn+E,GAM7B,OALIk/E,EACFlnF,KAAMgI,GAAWA,EAAQ+gF,YAAa/gF,GAAWA,EAAQkhF,YACzD1hF,EAAQ,UAAUA,aAGbuX,EAAS5a,EAAQ,IAAMqD,CAChC,EAGF,OAFCi/E,GAxRK0B,EAAc,OAsDJ5iF,IAoOT4iF,CAAc,GACpB,CAAEh9D,SAAS,EAAM/I,QAAQ,IE3TtB7c,GAAO,YAMA6kF,GAAkCzqF,GAAQ4F,GALlC,CACnB,YACA,SAGyElC,IAAyB,IAAxB,UAAEynB,EAAS,KAAEk8D,GAAM3jF,EAC7F,MAAMgnF,UAAkBrD,EAWtB3hF,WAAAA,CAAailF,GAGX,GAFAlD,SAEK3hF,MAAMC,QAAQ4kF,GAAS,MAAM,IAAIj0E,MAAM,kBAC5CrW,KAAKsqF,OAASA,EAAO5gF,KAAI,SAAU6gF,GACjC,MAAM5nE,EAAO4nE,GAASA,EAAM5nE,KACtB6nE,GAAUD,QACQjnF,IAAlBinF,EAAMC,SACRD,EAAMC,QAGV,IAAKpoE,EAAOO,GAAO,MAAM,IAAIjc,UAAU,kCACvC,GAAuB,kBAAZ8jF,EAAyB,MAAM,IAAI9jF,UAAU,wCAExD,MAAO,CAAEic,OAAM6nE,UACjB,GACF,CAGA,QAAInkF,GAAU,OAAOd,EAAK,CAC1B,eAAIgd,GAAiB,OAAO,CAAK,CAejC4iE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAMmF,EAAa/gF,GAAI1J,KAAKsqF,QAAQ,SAAUC,GAC5C,MAAO,CACLvF,SAAUuF,EAAM5nE,KAAKwiE,SAASrrE,EAAMwrE,GACpCkF,QAASD,EAAMC,QAEnB,IAEA,OAAO,SAAyB7lE,EAAOrY,EAAMi7E,GAC3C,MAAMmD,EAAU,GAShB,OAPAxmF,GAAQumF,GAAY,SAAwBF,GAC1C,MAAM9oF,EAAS8oF,EAAMvF,SAASrgE,EAAOrY,EAAMi7E,GACvCgD,EAAMC,SACRE,EAAQ1oF,KAAKP,EAEjB,IAEO,IAAIqpB,EAAU4/D,EACvB,CACF,CAMAxmF,OAAAA,CAASqM,GACP,IAAK,IAAIzO,EAAI,EAAGA,EAAI9B,KAAKsqF,OAAOvpF,OAAQe,IACtCyO,EAASvQ,KAAKsqF,OAAOxoF,GAAG6gB,KAAM,UAAY7gB,EAAI,SAAU9B,KAE5D,CAQA0J,GAAAA,CAAK6G,GACH,MAAM+5E,EAAS,GACf,IAAK,IAAIxoF,EAAI,EAAGA,EAAI9B,KAAKsqF,OAAOvpF,OAAQe,IAAK,CAC3C,MAAMyoF,EAAQvqF,KAAKsqF,OAAOxoF,GACpB6gB,EAAO3iB,KAAKulF,QAChBh1E,EAASg6E,EAAM5nE,KAAM,UAAY7gB,EAAI,SAAU9B,OACjDsqF,EAAOxoF,GAAK,CACV6gB,OACA6nE,QAASD,EAAMC,QAEnB,CACA,OAAO,IAAIH,EAAUC,EACvB,CAMA7mE,KAAAA,GACE,MAAM6mE,EAAStqF,KAAKsqF,OAAO5gF,KAAI,SAAU6gF,GACvC,MAAO,CACL5nE,KAAM4nE,EAAM5nE,KACZ6nE,QAASD,EAAMC,QAEnB,IAEA,OAAO,IAAIH,EAAUC,EACvB,CAQAtE,SAAAA,CAAWh+E,GACT,OAAOhI,KAAKsqF,OAAO5gF,KAAI,SAAUG,GAC/B,OAAOA,EAAM8Y,KAAK/P,SAAS5K,IAAY6B,EAAM2gF,QAAU,GAAK,IAC9D,IAAGpiF,KAAK,KACV,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACR+kF,OAAQtqF,KAAKsqF,OAEjB,CAUA,eAAOr/D,CAAUC,GACf,OAAO,IAAIm/D,EAAUn/D,EAAKo/D,OAC5B,CAQApE,OAAAA,CAASl+E,GACP,OAAOhI,KAAKsqF,OAAO5gF,KAAI,SAAUG,GAC/B,OAAOA,EAAM8Y,KAAKsjE,OAAOj+E,IACtB6B,EAAM2gF,QAAU,GAAK,wCAC1B,IAAGpiF,KAAK,6CACV,CAOAg+E,MAAAA,CAAQp+E,GACN,OAAOhI,KAAKsqF,OAAO5gF,KAAI,SAAUG,GAC/B,OAAOA,EAAM8Y,KAAKwjE,MAAMn+E,IAAY6B,EAAM2gF,QAAU,GAAK,IAC3D,IAAGpiF,KAAK,WACV,EAGF,OAFCq+E,GA3KK4D,EAAS,OA6BC9kF,IAgJT8kF,CAAS,GACf,CAAEl/D,SAAS,EAAM/I,QAAQ,ICrLtB7c,GAAO,kBAKAolF,GAAwChrF,GAAQ4F,GAJxC,CACnB,SAG+ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EAkCxF,MAAMglF,UAAwBrB,EAW5B3hF,WAAAA,CAAaulF,EAAWC,EAAUC,GAEhC,GADA1D,SACKhlE,EAAOwoE,GAAc,MAAM,IAAIlkF,UAAU,sCAC9C,IAAK0b,EAAOyoE,GAAa,MAAM,IAAInkF,UAAU,qCAC7C,IAAK0b,EAAO0oE,GAAc,MAAM,IAAIpkF,UAAU,sCAE9C1G,KAAK4qF,UAAYA,EACjB5qF,KAAK6qF,SAAWA,EAChB7qF,KAAK8qF,UAAYA,CACnB,CAGA,QAAIzkF,GAAU,OAAOd,EAAK,CAC1B,qBAAIid,GAAuB,OAAO,CAAK,CAevC2iE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAMyF,EAAgB/qF,KAAK4qF,UAAUzF,SAASrrE,EAAMwrE,GAC9C0F,EAAehrF,KAAK6qF,SAAS1F,SAASrrE,EAAMwrE,GAC5C2F,EAAgBjrF,KAAK8qF,UAAU3F,SAASrrE,EAAMwrE,GAEpD,OAAO,SAA8B3gE,EAAOrY,EAAMi7E,GAChD,OAzEN,SAAwBqD,GACtB,GAAyB,iBAAdA,GACc,kBAAdA,GACc,iBAAdA,EACT,QAASA,EAGX,GAAIA,EAAW,CACb,GAAIhqE,EAAYgqE,GACd,OAAQA,EAAUv7D,SAGpB,GAAItO,EAAU6pE,GACZ,SAAWA,EAAUhuE,KAAMguE,EAAUhwD,IAGvC,GAAI3Z,EAAO2pE,GACT,QAASA,EAAUpjF,KAEvB,CAEA,GAAIojF,QACF,OAAO,EAGT,MAAM,IAAIlkF,UAAU,kCAAoC8c,GAAOonE,GAAa,IAC9E,CA+CaM,CAAcH,EAAcpmE,EAAOrY,EAAMi7E,IAC5CyD,EAAarmE,EAAOrY,EAAMi7E,GAC1B0D,EAActmE,EAAOrY,EAAMi7E,EACjC,CACF,CAMArjF,OAAAA,CAASqM,GACPA,EAASvQ,KAAK4qF,UAAW,YAAa5qF,MACtCuQ,EAASvQ,KAAK6qF,SAAU,WAAY7qF,MACpCuQ,EAASvQ,KAAK8qF,UAAW,YAAa9qF,KACxC,CAQA0J,GAAAA,CAAK6G,GACH,OAAO,IAAI83E,EACTroF,KAAKulF,QAAQh1E,EAASvQ,KAAK4qF,UAAW,YAAa5qF,OACnDA,KAAKulF,QAAQh1E,EAASvQ,KAAK6qF,SAAU,WAAY7qF,OACjDA,KAAKulF,QAAQh1E,EAASvQ,KAAK8qF,UAAW,YAAa9qF,OAEvD,CAMAyjB,KAAAA,GACE,OAAO,IAAI4kE,EAAgBroF,KAAK4qF,UAAW5qF,KAAK6qF,SAAU7qF,KAAK8qF,UACjE,CAOA9E,SAAAA,CAAWh+E,GACT,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDI,EACFF,GAAcjpF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,UAMxD,IAAI0B,EAAY5qF,KAAK4qF,UAAUh4E,SAAS5K,GACxC,MAAMmjF,EACFlC,GAAcjpF,KAAK4qF,UAAW7B,EAAa/gF,GAAWA,EAAQkhF,WAC7C,QAAhBH,GACwB,iBAAxB/oF,KAAK4qF,UAAUvkF,MACU,OAAxB8kF,GACGA,GAAuBhC,KAC9ByB,EAAY,IAAMA,EAAY,KAGhC,IAAIC,EAAW7qF,KAAK6qF,SAASj4E,SAAS5K,GACtC,MAAMojF,EACFnC,GAAcjpF,KAAK6qF,SAAU9B,EAAa/gF,GAAWA,EAAQkhF,WAC5C,QAAhBH,GACuB,iBAAvB/oF,KAAK6qF,SAASxkF,MACM,OAAnB+kF,GAA6BA,GAAkBjC,KACnD0B,EAAW,IAAMA,EAAW,KAG9B,IAAIC,EAAY9qF,KAAK8qF,UAAUl4E,SAAS5K,GACxC,MAAMqjF,EACFpC,GAAcjpF,KAAK8qF,UAAW/B,EAAa/gF,GAAWA,EAAQkhF,UAMlE,OALqB,QAAhBH,GACwB,iBAAxB/oF,KAAK8qF,UAAUzkF,MACM,OAApBglF,GAA8BA,GAAmBlC,KACrD2B,EAAY,IAAMA,EAAY,KAEzBF,EAAY,MAAQC,EAAW,MAAQC,CAChD,CAMA//D,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRqlF,UAAW5qF,KAAK4qF,UAChBC,SAAU7qF,KAAK6qF,SACfC,UAAW9qF,KAAK8qF,UAEpB,CAeA,eAAO7/D,CAAUC,GACf,OAAO,IAAIm9D,EAAgBn9D,EAAK0/D,UAAW1/D,EAAK2/D,SAAU3/D,EAAK4/D,UACjE,CAOA5E,OAAAA,CAASl+E,GACP,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDI,EACFF,GAAcjpF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,UAMxD,IAAI0B,EAAY5qF,KAAK4qF,UAAU3E,OAAOj+E,GACtC,MAAMmjF,EACFlC,GAAcjpF,KAAK4qF,UAAW7B,EAAa/gF,GAAWA,EAAQkhF,WAC7C,QAAhBH,GACwB,iBAAxB/oF,KAAK4qF,UAAUvkF,MACU,OAAxB8kF,GACGA,GAAuBhC,KAC9ByB,EACE,iEACAA,EACA,kEAGJ,IAAIC,EAAW7qF,KAAK6qF,SAAS5E,OAAOj+E,GACpC,MAAMojF,EACFnC,GAAcjpF,KAAK6qF,SAAU9B,EAAa/gF,GAAWA,EAAQkhF,WAC5C,QAAhBH,GACuB,iBAAvB/oF,KAAK6qF,SAASxkF,MACM,OAAnB+kF,GAA6BA,GAAkBjC,KACnD0B,EACE,iEACAA,EACA,kEAGJ,IAAIC,EAAY9qF,KAAK8qF,UAAU7E,OAAOj+E,GACtC,MAAMqjF,EACFpC,GAAcjpF,KAAK8qF,UAAW/B,EAAa/gF,GAAWA,EAAQkhF,UASlE,OARqB,QAAhBH,GACwB,iBAAxB/oF,KAAK8qF,UAAUzkF,MACM,OAApBglF,GAA8BA,GAAmBlC,KACrD2B,EACE,iEACAA,EACA,kEAEGF,EACL,iEACAC,EACA,iEACAC,CACJ,CAOA1E,MAAAA,CAAQp+E,GACN,MAAO,mBACLhI,KAAK6qF,SAAS1E,MAAMn+E,GAAW,4BAC/BhI,KAAK4qF,UAAUzE,MAAMn+E,GACrB,SAAWhI,KAAK8qF,UAAU3E,MAAMn+E,GAChC,2CACJ,EAGF,OAFCy+E,GApOK4B,EAAe,OAsBL9iF,IAgNT8iF,CAAe,GACrB,CAAEl9D,SAAS,EAAM/I,QAAQ,I,cC7QrB,MAAMkpE,GAAe,CAE1BC,MAAO,IACPC,MAAO,UACPC,KAAM,IACNC,KAAM,SACNC,MAAO,UACP53B,MAAO,UACP63B,MAAO,UACPj6B,MAAO,UACPk6B,QAAS,IACTjwD,QAAS,YACTkwD,WAAY,eACZC,KAAM,IACN93B,KAAM,SACN+3B,IAAK,IACLC,IAAK,QACLC,MAAO,UACPrgC,MAAO,UACPsgC,SAAU,aACVC,KAAM,IACNC,KAAM,SACNC,MAAO,IACPC,MAAO,UACPC,SAAU,aACVC,OAAQ,WACRC,OAAQ,WACRC,GAAI,IACJC,GAAI,OACJC,GAAI,IACJC,GAAI,OACJC,GAAI,OACJ/1D,GAAI,OACJg2D,QAAS,IACTC,QAAS,IACTtiB,GAAI,OACJ/xC,GAAI,OACJs0D,MAAO,UACPC,IAAK,IACLtJ,IAAK,QACLuJ,OAAQ,WACRC,MAAO,UACPC,MAAO,UACPC,SAAU,aACVC,IAAK,IACLt+B,IAAK,QACLu+B,QAAS,YACTC,QAAS,YACTC,IAAK,QACLlyD,IAAK,QACLmyD,OAAQ,WACRC,IAAK,IACLC,IAAK,QACLC,IAAK,QACLzZ,IAAK,QACL0Z,MAAO,UACPC,MAAO,UAEPC,KAAM,iBACNC,MAAO,kBAEPrsF,EAAG,IACHuxB,IAAK,UACL+6D,IAAK,UACLC,SAAU,UACVhhF,SAAU,UACVihF,GAAI,UACJC,IAAK,QACLjrF,UAAW,eAGAkrF,GAAiB,CAC5B5/B,UAAW,SACX4zB,WAAY,KACZ1uB,UAAW,IACX55C,IAAK,IACLu0E,OAAQ,YACRC,UAAW,IACX/4C,WAAY,IACZg5C,OAAQ,MACRzzB,IAAK,QACLjjB,SAAU,SACV9nB,OAAQ,SACRy+D,YAAa,UACbz/B,UAAW,KACXt7B,IAAK,QACL3oB,IAAK,IACLqrB,SAAU,IACVzf,GAAI,eACJ+3E,UAAW,KACXC,gBAAiB,KACjBC,cAAe,MACf5tC,MAAO,IACP6tC,QAAS,QACT5tC,QAAS,IACTwJ,OAAQ,IACRD,UAAW,QACXE,SAAU,QACVokC,OAAQ,MACRnsC,OAAQ,iBACRosC,MAAO,IACPC,IAAK,UACLC,IAAK,WACLC,GAAI,SAGOC,GAAiB,CAE5B1nE,IAAK,CAAE,EAAG,6BACV1c,IAAK,CAAE,EAAG,qBAAqBsjF,GAAetjF,0BAC9Cob,KAAM,CAAE,EAAG,yBACXoH,KAAM,CAAE,EAAG,yCACX6hE,KAAM,CAAE,EAAG,+BACXp/D,OAAQ,CAAE,EAAG,kCACbg/B,UAAW,CAAE,EAAG,qBAAqBq/B,GAAer/B,gCACpDy/B,YAAa,CAAE,EAAG,qBAAqBJ,GAAeI,kCACtDH,OAAQ,CAAE,EAAG,qBAAqBD,GAAeC,6BACjDjoE,IAAK,CAAE,EAAG,kCACVC,MAAO,WAAW+nE,GAAet0E,6BACjCwoD,IAAK,CAAE,EAAG,8CACV9oD,MAAO,CAAE,EAAG,2CACZgnB,SAAU,CAAE,EAAG,kCACfrE,IAAK,8BACLtD,MAAO,gCACPhT,IAAK,CACH,EAAG,gCACH,EAAG,+CAELE,MAAO,CAAE,EAAG,uCACZE,MAAO,CACL,EAAG,kCACH,EAAG,iDAELL,KAAM,qCACN6N,IAAK,CAAE,EAAG,qBAAqB26D,GAAe36D,0BAC9CokB,SAAU,CAAE,EAAG,qBAAqBu2C,GAAev2C,+BACnDiU,KAAM,CACJ,EAAG,gCACH,OAAG5oD,GAELksF,QAAS,CAAE,EAAG,kCACdC,SAAU,CAAE,EAAG,yCACfv1E,IAAK,CAAE,EAAG,6BAA6Bs0E,GAAet0E,oBACtDqL,MAAO,CACL,EAAG,yCACH,OAAGjiB,GAELyiB,KAAM,CAAE,EAAG,8CACXqD,KAAM,CAAE,EAAG,sBACXsmE,OAAQ,CAAE,EAAG,+BACbn5D,SAAU,CAAE,EAAG,qBAAqBi4D,GAAej4D,+BACnDof,WAAY,CAAE,EAAG,GAAG64C,GAAe74C,wCACnC+4C,UAAW,CAAE,EAAG,GAAGF,GAAeE,uCAGlCO,OAAQ,CAAE,EAAG,qBAAqBT,GAAeS,6BACjDN,OAAQ,CAAE,EAAGH,GAAeG,OAAS,6BACrCO,MAAO,CAAE,EAAG,qBAAqBV,GAAeU,4BAChDpsC,OAAQ,CAAE,EAAG,qBAAqB0rC,GAAe1rC,6BACjD+rC,UAAW,CAAE,EAAG,qBAAqBL,GAAeK,gCACpDC,gBAAiB,CAAE,EAAG,qBAAqBN,GAAeM,sCAC1DC,cAAe,CAAE,EAAG,qBAAqBP,GAAeO,oCAGxDY,YAAa,CAAE,EAAG,4BAClBC,QAAS,CAAE,EAAG,4BACdC,WAAY,CAAE,EAAG,qCAGjB7/E,IAAK,CAAE,EAAG,kCACV6+C,KAAM,CAAE,EAAG,+BACXj0B,GAAI,CAAE,EAAG,+CACThe,GAAI,CAAE,EAAG,+CAGTuyE,IAAK,CAAE,EAAG,qBAAqBX,GAAeW,0BAC9Cj0B,IAAK,CAAE,EAAGszB,GAAetzB,IAAM,6BAC/Bm0B,GAAI,CAAE,EAAG,qBAAqBb,GAAea,yBAC7CD,IAAK,CAAE,EAAG,qBAAqBZ,GAAeY,0BAG9CU,MAAO,CAAE,EAAG,6DACZtN,WAAY,CAAE,EAAG,6BAA6BgM,GAAehM,cAC7DuN,IAAK,CAAE,EAAG,kCACVznE,IAAK,CAAE,EAAG,6CACV0nE,KAAM,CAAE,EAAG,kCACXx7C,IAAK,CAAE,EAAG,kCACVy7C,KAAM,CAAE,EAAG,iCACXC,MAAO,CAAE,EAAG,gBAAgB1B,GAAet0E,qBAC3Ci2E,MAAO,CAAE,EAAG,yCACZvhC,UAAW,CAAE,EAAG,6BAA6B4/B,GAAe5/B,aAG5DwhC,aAAc,CAAE,EAAG,mCACnBC,oBAAqB,CAAE,EAAG,gEAC1Bv8B,UAAW,CAAE,EAAG,6BAA6B06B,GAAe16B,aAC5DC,MAAO,CAAE,EAAG,oCACZu8B,OAAQ,CAAE,EAAG,wCAGbnvC,MAAO,CAAE,EAAG,qBAAqBqtC,GAAertC,4BAChDyJ,OAAQ,CAAE,EAAG,qBAAqB4jC,GAAe5jC,6BACjDC,SAAU,CAAE,EAAG,qBAAqB2jC,GAAe3jC,+BACnDzJ,QAAS,CAAE,EAAG,qBAAqBotC,GAAeptC,8BAClDuJ,UAAW,CAAE,EAAG,qBAAqB6jC,GAAe7jC,gCACpDqkC,QAAS,CAAE,EAAG,qBAAqBR,GAAeQ,8BAGlDuB,IAAK,CAAE,EAAG,gCAGV7iF,IAAK,8BACLH,IAAK,8BACLijF,SAAU,sCAGV9+D,KAAM,CAAE,EAAG,uCACXvI,MAAO,CAAE,EAAG,wCACZo1D,KAAM,CAAE,EAAG,uCACXE,MAAO,CAAE,EAAG,wCACZE,KAAM,CAAE,EAAG,uCACXE,MAAO,CAAE,EAAG,gDACZE,KAAM,CAAE,EAAG,uCACXE,MAAO,CAAE,EAAG,gDACZ3sD,KAAM,CAAE,EAAG,uCACXjJ,MAAO,CAAE,EAAG,wCACZwI,KAAM,CAAE,EAAG,uCACXgH,MAAO,CAAE,EAAG,yCACZvP,MAAO,CAAE,EAAG,wCACZ4F,IAAK,CAAE,EAAG,kCACV3F,KAAM,CAAE,EAAG,mCACXu2D,IAAK,CAAE,EAAG,kCACVE,KAAM,CAAE,EAAG,mCACXE,IAAK,CAAE,EAAG,kCACVE,KAAM,CAAE,EAAG,2CACX/O,IAAK,CAAE,EAAG,kCACVkP,KAAM,CAAE,EAAG,2CACXnsD,IAAK,CAAE,EAAG,kCACV5K,KAAM,CAAE,EAAG,mCACXgL,IAAK,CAAE,EAAG,kCACV/K,KAAM,CAAE,EAAG,mCAGX3S,GAAI,CAAE,EAAG,qBAAqB03E,GAAe13E,yBAG7Co+B,QAAS,SAAUvyB,EAAM3a,GAEvB,OAAO2a,EAAKrW,KAAK,GAAG65E,OACtB,EAGAxgE,OAAQ,CACN,EAAG,IACH,EAAG,4BACH,EAAG,sDAEL8nB,OAAQ,CACN,EAAG,eACH,EAAG,6CAELid,UAAW,CACT,EAAG,IACH,EAAG,6BAEL/d,OAAQ,CACN,EAAG,IACH,EAAG,6BAEL6T,QAAS,CACP,EAAG,IACH,EAAG,4BACH,EAAG,qCAAqC8qC,GAAaxpF,6CAEvD4oB,OAAQ,CACN,EAAG,iCACH,EAAG,4BACH,EAAG,6BAEL+lE,OAAQ,CACN,EAAG,iCACH,EAAG,6BAEL1+C,KAAM,CACJ,EAAG,4BACH,EAAG,uDAOD2+C,GAAa,CACjBte,IAAK,WAGA,SAASue,GAAaljD,GAC3B,OAAOmjD,GAAenjD,EAAQ,CAAEjqC,oBAAoB,GACtD,CAIO,SAASqtF,GAAUtrF,EAAM0b,GAE9B,OADAA,OAA2B,IAAXA,GAAiCA,GAE3Cpe,GAAe6tF,GAAYnrF,GACtBmrF,GAAWnrF,GAGb,YAAcorF,GAAYprF,GAAQ,IAGvC1C,GAAeyoF,GAAc/lF,GACxB+lF,GAAa/lF,GAGforF,GAAYprF,EACrB,CC7TA,MAAMA,GAAO,eAKAurF,GAAqCnxF,GAAQ4F,GAJrC,CACnB,SAG4ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EACrF,MAAM0tF,UAAqB/J,EAazB3hF,WAAAA,CAAamC,GACX4/E,QACApnF,KAAKwH,MAAQA,CACf,CAGA,QAAInB,GAAU,OAAOd,EAAK,CAC1B,kBAAIkd,GAAoB,OAAO,CAAK,CAepC0iE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM99E,EAAQxH,KAAKwH,MAEnB,OAAO,WACL,OAAOA,CACT,CACF,CAMAtD,OAAAA,CAASqM,GACP,CASF7G,GAAAA,CAAK6G,GACH,OAAOvQ,KAAKyjB,OACd,CAMAA,KAAAA,GACE,OAAO,IAAIstE,EAAa/wF,KAAKwH,MAC/B,CAOAw+E,SAAAA,CAAWh+E,GACT,OAAO8e,GAAO9mB,KAAKwH,MAAOQ,EAC5B,CAOAk+E,OAAAA,CAASl+E,GACP,MAAMR,EAAQxH,KAAKgmF,UAAUh+E,GAE7B,OAAQwb,GAAOxjB,KAAKwH,QAClB,IAAK,SACL,IAAK,SACL,IAAK,YACL,IAAK,WACH,MAAO,6BAA+BA,EAAQ,UAChD,IAAK,SACH,MAAO,6BAA+BA,EAAQ,UAChD,IAAK,UACH,MAAO,8BAAgCA,EAAQ,UACjD,IAAK,OACH,MAAO,kCAAoCA,EAAQ,UACrD,IAAK,YACH,MAAO,gCAAkCA,EAAQ,UAEnD,QACE,MAAO,6BAA+BA,EAAQ,UAEpD,CAMAujB,MAAAA,GACE,MAAO,CAAEC,OAAQzlB,GAAMiC,MAAOxH,KAAKwH,MACrC,CASA,eAAOyjB,CAAUC,GACf,OAAO,IAAI6lE,EAAa7lE,EAAK1jB,MAC/B,CAOA4+E,MAAAA,CAAQp+E,GACN,MAAMR,EAAQxH,KAAKgmF,UAAUh+E,GACvB3B,EAAOmd,GAAOxjB,KAAKwH,OAEzB,OAAQnB,GACN,IAAK,SACH,MAAO,YAAcsqF,GAAYnpF,GAAS,IAE5C,IAAK,SACL,IAAK,YAAa,CAEhB,KADwB,cAATnB,EAAuBrG,KAAKwH,MAAM8d,WAAaA,SAAStlB,KAAKwH,QAE1E,OAAQxH,KAAKwH,MAAMgY,UAAY,EAC3B,WACA,UAGN,MAAMrb,EAAQqD,EAAMhB,cAAcsD,QAAQ,KAC1C,OAAe,IAAX3F,EACKqD,EAAM6wB,UAAU,EAAGl0B,GAAS,aACjCqD,EAAM6wB,UAAUl0B,EAAQ,GAAK,IAG1BqD,CACT,CAEA,IAAK,SACH,OAAOA,EAAMoL,WAGf,IAAK,WACH,OAAO5S,KAAKwH,MAAMwpF,UAEpB,QACE,OAAOxpF,EAEb,EAGF,OAFCi/E,GAvKKsK,EAAY,OAkBFxrF,IAuJTwrF,CAAY,GAClB,CAAE5lE,SAAS,EAAM/I,QAAQ,IC5KtB7c,GAAO,yBAMA0rF,GAA+CtxF,GAAQ4F,GAL/C,CACnB,QACA,SAGsFlC,IAAqB,IAApB,MAAE4C,EAAK,KAAE+gF,GAAM3jF,EAQtG,SAAS6jF,EAAiBvkE,EAAMomE,EAAaG,GAC3C,MAAMC,EAAaF,GAActmE,EAAMomE,EAAaG,GAC9CW,EAAiBZ,GAActmE,EAAKuiE,KAAM6D,EAAaG,GAE7D,MAAwB,QAAhBH,GACe,OAAnBc,GAA6BA,GAAkBV,CACrD,CAEA,MAAMf,UAA+BpB,EAanC3hF,WAAAA,CAAaE,EAAM2C,EAAQg9E,GAGzB,GAFAkC,QAEoB,iBAAT7hF,EAAqB,MAAM,IAAImB,UAAU,wCACpD,IAAKjB,MAAMC,QAAQwC,GACjB,MAAM,IAAIxB,UACR,uEAEJ,IAAK0b,EAAO8iE,GAAS,MAAM,IAAIx+E,UAAU,sCACzC,GAAIm+E,GAAS79E,IAAIzB,GAAS,MAAM,IAAI8Q,MAAM,2BAA6B9Q,EAAO,2BAE9E,MAAM2rF,EAAa,IAAInmF,IACvB,IAAK,MAAMlB,KAAS3B,EAAQ,CAC1B,MAAM3C,EAAwB,iBAAVsE,EAAqBA,EAAQA,EAAMtE,KACvD,GAAI2rF,EAAWlqF,IAAIzB,GACjB,MAAM,IAAI8Q,MAAM,6BAA6B9Q,MAE7C2rF,EAAWhmF,IAAI3F,EAEnB,CAEAvF,KAAKuF,KAAOA,EACZvF,KAAKkI,OAASA,EAAOwB,KAAI,SAAUG,GACjC,OAAQA,GAASA,EAAMtE,MAASsE,CAClC,IACA7J,KAAK4G,MAAQsB,EAAOwB,KAAI,SAAUG,GAChC,OAAQA,GAASA,EAAMxD,MAAS,KAClC,IACArG,KAAKklF,KAAOA,CACd,CAGA,QAAI7+E,GAAU,OAAOd,EAAK,CAC1B,4BAAIwd,GAA8B,OAAO,CAAK,CAe9CoiE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM6L,EAAgB7uF,OAAO6C,OAAOmgF,GACpCphF,GAAQlE,KAAKkI,QAAQ,SAAU2B,GAC7BsnF,EAActnF,IAAS,CACzB,IAGA,MAAMq7E,EAAOllF,KAAKklF,KACZkM,EAAWlM,EAAKC,SAASrrE,EAAMq3E,GAC/B5rF,EAAOvF,KAAKuF,KACZ2C,EAASlI,KAAKkI,OACdH,EAAYK,GAAKpI,KAAK4G,MAAO,KAC7Bm6B,EAASx7B,EAAO,IAAM6C,GAAKpI,KAAKkI,OAAQ,MAAQ,IAEtD,OAAO,SAAqCyc,EAAOrY,EAAMi7E,GACvD,MAAMh/E,EAAa,CAAC,EACpBA,EAAWR,GAAa,WACtB,MAAMspF,EAAY/uF,OAAO6C,OAAOmH,GAEhC,IAAK,IAAIxK,EAAI,EAAGA,EAAIoG,EAAOnH,OAAQe,IACjCuvF,EAAUnpF,EAAOpG,IAAMW,UAAUX,GAGnC,OAAOsvF,EAASzsE,EAAO0sE,EAAW9J,EACpC,EACA,MAAMz/E,EAAK7B,EAAMV,EAAMgD,GAMvB,OALAT,EAAGi5B,OAASA,EACZj5B,EAAGo9E,KAAOA,EAAKtyE,WAEf+R,EAAM1d,IAAI1B,EAAMuC,GAETA,CACT,CACF,CAMA5D,OAAAA,CAASqM,GACPA,EAASvQ,KAAKklF,KAAM,OAAQllF,KAC9B,CASA0J,GAAAA,CAAK6G,GACH,MAAM20E,EAAOllF,KAAKulF,QAAQh1E,EAASvQ,KAAKklF,KAAM,OAAQllF,OAEtD,OAAO,IAAIooF,EAAuBpoF,KAAKuF,KAAMvF,KAAKkI,OAAOhG,MAAM,GAAIgjF,EACrE,CAMAzhE,KAAAA,GACE,OAAO,IAAI2kE,EACTpoF,KAAKuF,KAAMvF,KAAKkI,OAAOhG,MAAM,GAAIlC,KAAKklF,KAC1C,CAOAc,SAAAA,CAAWh+E,GACT,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OAC7D,IAAI7D,EAAOllF,KAAKklF,KAAKtyE,SAAS5K,GAI9B,OAHIk/E,EAAgBlnF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,YACxDhE,EAAO,IAAMA,EAAO,KAEfllF,KAAKuF,KAAO,IAAMvF,KAAKkI,OAAOE,KAAK,MAAQ,OAAS88E,CAC7D,CAMAn6D,MAAAA,GACE,MAAMnkB,EAAQ5G,KAAK4G,MAEnB,MAAO,CACLokB,OAAQzlB,GACRA,KAAMvF,KAAKuF,KACX2C,OAAQlI,KAAKkI,OAAOwB,KAAI,SAAUG,EAAO1F,GACvC,MAAO,CACLoB,KAAMsE,EACNxD,KAAMO,EAAMzC,GAEhB,IACA+gF,KAAMllF,KAAKklF,KAEf,CAaA,eAAOj6D,CAAUC,GACf,OAAO,IAAIk9D,EAAuBl9D,EAAK3lB,KAAM2lB,EAAKhjB,OAAQgjB,EAAKg6D,KACjE,CAOAgB,OAAAA,CAASl+E,GACP,MAAM+gF,EAAe/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvE7gF,EAAS,GACf,IAAK,IAAIpG,EAAI,EAAGA,EAAI9B,KAAKkI,OAAOnH,OAAQe,IACtCoG,EAAOlG,KAAK,4CACAm/B,GAAOnhC,KAAKkI,OAAOpG,IAAM,WAEvC,IAAIojF,EAAOllF,KAAKklF,KAAKe,OAAOj+E,GAM5B,OALIk/E,EAAgBlnF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,YACxDhE,EAAO,iEACLA,EACA,kEAEG,+BACL/jD,GAAOnhC,KAAKuF,MADP,wEAGL2C,EAAOE,KAAK,yCAHP,qLAOL88E,CACJ,CAOAkB,MAAAA,CAAQp+E,GACN,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OAC7D,IAAI7D,EAAOllF,KAAKklF,KAAKiB,MAAMn+E,GAK3B,OAJIk/E,EAAgBlnF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,YACxDhE,EAAO,UAAUA,aAGZ,YAAcllF,KAAKuF,KACxB,WAAavF,KAAKkI,OAAOwB,IAAImnF,IAAUzoF,KAAK,KAAO,YAAc88E,CACrE,EAGF,OAFCuB,GA5NK2B,EAAsB,OA4CZ7iF,IAkLT6iF,CAAsB,GAC5B,CAAEj9D,SAAS,EAAM/I,QAAQ,ICxPtB7c,GAAO,YAMA+rF,GAAkC3xF,GAAQ4F,GALlC,CACnB,OACA,SAGyElC,IAAoB,IAAnB,KAAE2jF,EAAI,KAAE/mE,GAAM5c,EACxF,MAAMkuF,UAAkBvK,EAetB3hF,WAAAA,CAAa8/B,EAAYqsD,GAMvB,GALApK,QACApnF,KAAKmlC,WAAaA,EAClBnlC,KAAKwxF,YAAcA,IAAe,GAG7B/rF,MAAMC,QAAQy/B,KAAgBA,EAAW7xB,MAAM8O,GAClD,MAAM,IAAI1b,UACR,8DAEJ,GAAI1G,KAAKwxF,cAAgBxxF,KAAKo/D,mBAC5B,MAAM,IAAI/oD,MAAM,oDAEpB,CAGA,QAAIhQ,GAAU,OAAOd,EAAK,CAC1B,eAAI0d,GAAiB,OAAO,CAAK,CAejCkiE,QAAAA,CAAUrrE,EAAMwrE,GAQd,MAAMmM,EAAiB/nF,GAAI1J,KAAKmlC,YAAY,SAAU5C,EAAWzgC,GAK/D,GAJiBygC,EACd76B,QAAOib,GAAQA,EAAKW,cAA8B,QAAdX,EAAKpd,OACzCxE,OAAS,EAEE,CAGZ,MAAMowF,EAAgB7uF,OAAO6C,OAAOmgF,GACpC6L,EAAcl7E,KAAM,EAEpB,MAAMy7E,EAAiBnvD,EAAU4iD,SAASrrE,EAAMq3E,GAEhD,OAAO,SAAwBxsE,EAAOrY,EAAMi7E,GAC1C,IAAKpmE,EAASomE,KAAa7hF,EAAQ6hF,KAAarmE,EAASqmE,GACvD,MAAM,IAAI7gF,UACR,2EAEE8c,GAAO+jE,IAGb,MAAMt9E,EAAIgW,EAAKsnE,GAAS/nE,UAClB6xE,EAAY/uF,OAAO6C,OAAOmH,GAGhC,OAFA+kF,EAAUp7E,IAAMhM,EAAEnI,GAEX4vF,EAAe/sE,EAAO0sE,EAAW9J,EAC1C,CACF,CAEE,OAAOhlD,EAAU4iD,SAASrrE,EAAMwrE,EAEpC,IAEMnhF,EAAQ2a,EAAgBhF,EAAM,SAEpC,OAAO,SAAwB6K,EAAOrY,EAAMi7E,GAC1C,MAAMpiD,EAAaz7B,GAAI+nF,GAAgB,SAAUE,GAC/C,OAAOA,EAAchtE,EAAOrY,EAAMi7E,EACpC,IAEA,OAAOpjF,KAASghC,EAClB,CACF,CAMAjhC,OAAAA,CAASqM,GACP,IAAK,IAAIzO,EAAI,EAAGA,EAAI9B,KAAKmlC,WAAWpkC,OAAQe,IAC1CyO,EAASvQ,KAAKmlC,WAAWrjC,GAAI,cAAgBA,EAAI,IAAK9B,KAE1D,CAQA0J,GAAAA,CAAK6G,GACH,MAAM40B,EAAa,GACnB,IAAK,IAAIrjC,EAAI,EAAGA,EAAI9B,KAAKmlC,WAAWpkC,OAAQe,IAC1CqjC,EAAWrjC,GAAK9B,KAAKulF,QACnBh1E,EAASvQ,KAAKmlC,WAAWrjC,GAAI,cAAgBA,EAAI,IAAK9B,OAG1D,OAAO,IAAIuxF,EAAUpsD,EAAYnlC,KAAKwxF,YACxC,CAMA/tE,KAAAA,GACE,OAAO,IAAI8tE,EAAUvxF,KAAKmlC,WAAWjjC,MAAM,GAAIlC,KAAKwxF,YACtD,CAMApyB,gBAAAA,GACE,OAAkC,IAA3Bp/D,KAAKmlC,WAAWpkC,QACrB0hB,EAAeziB,KAAKmlC,WAAW,KACK,iBAA7BnlC,KAAKmlC,WAAW,GAAG39B,KAC9B,CAOA63D,iBAAAA,GACE,OAAOr/D,KAAKo/D,mBAAqBp/D,KAAKmlC,WAAW,GAAG39B,MAAQ,IAC9D,CAOAw+E,SAAAA,CAAWh+E,GAET,OAAOhI,KAAKwxF,YACP,IAAMxxF,KAAKq/D,oBACX,IAAMr/D,KAAKmlC,WAAW/8B,KAAK,MAAQ,GAC1C,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACR4/B,WAAYnlC,KAAKmlC,WACjBqsD,YAAaxxF,KAAKwxF,YAEtB,CAUA,eAAOvmE,CAAUC,GACf,OAAO,IAAIqmE,EAAUrmE,EAAKia,WAAYja,EAAKsmE,YAC7C,CAOAtL,OAAAA,CAASl+E,GAEP,MAAMm9B,EAAa,GACnB,IAAK,IAAIrjC,EAAI,EAAGA,EAAI9B,KAAKmlC,WAAWpkC,OAAQe,IAC1CqjC,EAAWrjC,GAAK9B,KAAKmlC,WAAWrjC,GAAGmkF,SAErC,OAAIjmF,KAAKwxF,YACA,sGAELrwD,GAAOnhC,KAAKq/D,qBAAuB,UAE9B,kEACLl6B,EAAW/8B,KAAK,yCAChB,iEAEN,CAOAg+E,MAAAA,CAAQp+E,GACN,MAAMm9B,EAAanlC,KAAKmlC,WAAWz7B,KAAI,SAAU8/B,GAC/C,OAAOA,EAAM28C,MAAMn+E,EACrB,IAEA,OAAOhI,KAAKwxF,YACP,IAAMxxF,KAAKq/D,oBACX,KAAOl6B,EAAW/8B,KAAK,KAAO,GACrC,EAGF,OAFCq+E,GAhOK8K,EAAS,OA8BChsF,IAoMTgsF,CAAS,GACf,CAAEpmE,SAAS,EAAM/I,QAAQ,IC1OtB7c,GAAO,aAKAqsF,GAAmCjyF,GAAQ4F,GAJnC,CACnB,SAG0ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EACnF,MAAMwuF,UAAmB7K,EAOvB3hF,WAAAA,CAAawf,GAKX,GAJAuiE,QACApnF,KAAK6kB,WAAaA,GAAc,CAAC,EAG7BA,IAC0B,iBAAfA,IACRviB,OAAOyB,KAAK8gB,GAAYvR,OAAM,SAAU3Q,GACvC,OAAOyf,EAAOyC,EAAWliB,GAC3B,KACF,MAAM,IAAI+D,UAAU,mCAG1B,CAGA,QAAIL,GAAU,OAAOd,EAAK,CAC1B,gBAAI2d,GAAkB,OAAO,CAAK,CAelCiiE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAMwM,EAAc,CAAC,EAErB,IAAK,MAAMnvF,KAAO3C,KAAK6kB,WACrB,GAAIhiB,GAAe7C,KAAK6kB,WAAYliB,GAAM,CAGxC,MAAMovF,EAAiBjxD,GAAUn+B,GAC3BqvF,EAAYjqD,KAAKxqB,MAAMw0E,GACvB91E,EAAO6C,EAAgB9e,KAAK6kB,WAAYliB,GAE9CmvF,EAAYE,GAAa/1E,EAAKkpE,SAASrrE,EAAMwrE,EAC/C,CAGF,OAAO,SAAyB3gE,EAAOrY,EAAMi7E,GAC3C,MAAMhxE,EAAM,CAAC,EAEb,IAAK,MAAM5T,KAAOmvF,EACZjvF,GAAeivF,EAAanvF,KAC9B4T,EAAI5T,GAAOmvF,EAAYnvF,GAAKgiB,EAAOrY,EAAMi7E,IAI7C,OAAOhxE,CACT,CACF,CAMArS,OAAAA,CAASqM,GACP,IAAK,MAAM5N,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,IAClC4N,EACEvQ,KAAK6kB,WAAWliB,GAAM,cAAgBm+B,GAAUn+B,GAAO,IAAK3C,KAGpE,CAQA0J,GAAAA,CAAK6G,GACH,MAAMsU,EAAa,CAAC,EACpB,IAAK,MAAMliB,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,KAClCkiB,EAAWliB,GAAO3C,KAAKulF,QACrBh1E,EACEvQ,KAAK6kB,WAAWliB,GAAM,cAAgBm+B,GAAUn+B,GAAO,IAAK3C,QAGpE,OAAO,IAAI6xF,EAAWhtE,EACxB,CAMApB,KAAAA,GACE,MAAMoB,EAAa,CAAC,EACpB,IAAK,MAAMliB,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,KAClCkiB,EAAWliB,GAAO3C,KAAK6kB,WAAWliB,IAGtC,OAAO,IAAIkvF,EAAWhtE,EACxB,CAQAmhE,SAAAA,CAAWh+E,GACT,MAAM6X,EAAU,GAChB,IAAK,MAAMld,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,IAClCkd,EAAQ7d,KACN8+B,GAAUn+B,GAAO,KAAO3C,KAAK6kB,WAAWliB,GAAKiQ,SAAS5K,IAG5D,MAAO,IAAM6X,EAAQzX,KAAK,MAAQ,GACpC,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRsf,WAAY7kB,KAAK6kB,WAErB,CASA,eAAOoG,CAAUC,GACf,OAAO,IAAI2mE,EAAW3mE,EAAKrG,WAC7B,CAQAqhE,OAAAA,CAASl+E,GACP,MAAM6X,EAAU,GAChB,IAAK,MAAMld,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,IAClCkd,EAAQ7d,KACN,2CAA6Cm/B,GAAOx+B,GAApD,8HAGe3C,KAAK6kB,WAAWliB,GAAKsjF,OAAOj+E,IAGjD,MAAO,iEACL6X,EAAQzX,KAAK,yCACb,gEACJ,CAOAg+E,MAAAA,CAAQp+E,GACN,MAAM6X,EAAU,GAChB,IAAK,MAAMld,KAAO3C,KAAK6kB,WACjBhiB,GAAe7C,KAAK6kB,WAAYliB,IAClCkd,EAAQ7d,KACN,YAAcW,EAAM,QAClB3C,KAAK6kB,WAAWliB,GAAKwjF,MAAMn+E,GAAW,QAK9C,MAFY,8BAAgC6X,EAAQzX,KAAK,MACrD,wBAEN,EAGF,OAFCq+E,GA/LKoL,EAAU,OAsBAtsF,IA2KTssF,CAAU,GAChB,CAAE1mE,SAAS,EAAM/I,QAAQ,IC/LrB,SAAS6vE,GAAgBC,EAAa5lF,GAC3C,OAAO,IAAI4T,EACTgyE,EACA,IAAIxyE,EAAkBpT,GACtB,IAAIvB,IAAIzI,OAAOyB,KAAKuI,IAExB,CCZA,MAAM/G,GAAO,eAKA4sF,GAAqCxyF,GAAQ4F,GAJrC,CACnB,SAG4ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EAQrF,SAAS+uF,EAAoBlN,EAAM6D,GACjC,IAAIsJ,EAAUnN,EACd,GAAoB,SAAhB6D,EACF,KAAO5lE,GAAkBkvE,IAAUA,EAAUA,EAAQrJ,QAEvD,QAAIvmE,EAAe4vE,MACfzvE,EAAeyvE,IACVD,EAAmBC,EAAQ/lF,KAAK,GAAIy8E,EAG/C,CAeA,SAASuJ,EAA+B5yF,EAAMqpF,EAAaG,EAAU58E,EAAMimF,GAEzE,MAAMpJ,EAAaF,GAAcvpF,EAAMqpF,EAAaG,GAC9CT,EAAgBY,GAAiB3pF,EAAMqpF,GAE7C,GAAqB,QAAhBA,GAA4Bz8E,EAAKvL,OAAS,GAAgC,qBAAzBrB,EAAK4mF,iBAAqE,0BAAzB5mF,EAAK4mF,gBAC1G,OAAOh6E,EAAK5C,KAAI,SAAUsG,GACxB,OAAQA,EAAIu2E,aAAalgF,MACvB,IAAK,YACL,IAAK,eACL,IAAK,aACL,IAAK,kBACH,OAAO,EACT,QACE,OAAO,EAEb,IAGF,IAAI5E,EACJ,OAAQ6K,EAAKvL,QACX,KAAK,EACHU,EAAS,GACT,MAEF,KAAK,EACH,CAEE,MAAM+wF,EAAoBvJ,GAAc38E,EAAK,GAAIy8E,EAAaG,EAAUxpF,GAGxE,GAAI6yF,GAAgC,OAAtBC,EAA6B,CACzC,IAAIC,EACAC,EASJ,GARoB,SAAhB3J,GACF0J,EAAoBnmF,EAAK,GAAGg6E,gBAC5BoM,EAAiBhzF,EAAK4mF,kBAGtBmM,EAAoBnmF,EAAK,GAAGi6E,aAAaD,gBACzCoM,EAAiBhzF,EAAK6mF,aAAaD,kBAE0B,IAA3DzhE,GAAWskE,GAAYuJ,GAAgBpK,gBAA2B,CACpE7mF,EAAS,EAAC,GACV,KACF,CAEA,IAAqE,IAAjEojB,GAAW2tE,GAAmBC,GAAmBjK,YAAuB,CAC1E/mF,EAAS,EAAC,GACV,KACF,CACF,CAEA,GAA0B,OAAtB+wF,EAA4B,CAE9B/wF,EAAS,EAAC,GACV,KACF,CAEA,GAAI+wF,GAAqBrJ,EAAY,CAEnC1nF,EAAS,EAAC,GACV,KACF,CAGAA,EAAS,EAAC,EACZ,CACA,MACF,KAAK,EACH,CACE,IAAIkxF,EAEJ,MAAMC,EAAgB3J,GAAc38E,EAAK,GAAIy8E,EAAaG,EAAUxpF,GAE9DmzF,EAAevJ,GAAkB5pF,EAAM4M,EAAK,GAAIy8E,GAkBtD,IAAI+J,EAbFH,EAHoB,OAAlBC,IAIQA,IAAkBzJ,GAAkC,UAAlBV,IAA+BoK,GAMlED,EAAgBzJ,GAQ3B,MAAM4J,EAAgB9J,GAAc38E,EAAK,GAAIy8E,EAAaG,EAAUxpF,GAE9DszF,EAAe1J,GAAkB5pF,EAAM4M,EAAK,GAAIy8E,GAmBtD,GAdE+J,EAHoB,OAAlBC,IAIQA,IAAkB5J,GAAkC,SAAlBV,IAA8BuK,GAMjED,EAAgB5J,GAOvBoJ,EAAO,CACT,IAAIG,EACAO,EACAC,EACgB,SAAhBnK,GACF2J,EAAiBhzF,EAAK4mF,gBACtB2M,EAAgBvzF,EAAK4M,KAAK,GAAGg6E,gBAC7B4M,EAAgBxzF,EAAK4M,KAAK,GAAGg6E,kBAG7BoM,EAAiBhzF,EAAK6mF,aAAaD,gBACnC2M,EAAgBvzF,EAAK4M,KAAK,GAAGi6E,aAAaD,gBAC1C4M,EAAgBxzF,EAAK4M,KAAK,GAAGi6E,aAAaD,iBAGtB,OAAlBsM,KAC6D,IAA3D/tE,GAAWskE,GAAYuJ,GAAgBpK,kBACzCqK,GAAY,IAG+C,IAAzD9tE,GAAW+tE,GAAeK,GAAezK,cAC3CmK,GAAY,IAIM,OAAlBI,KAC8D,IAA5DluE,GAAWskE,GAAYuJ,GAAgBnK,mBACzCuK,GAAY,IAG+C,IAAzDjuE,GAAWkuE,GAAeG,GAAe1K,cAC3CsK,GAAY,GAGlB,CAEArxF,EAAS,CAACkxF,EAAWG,EACvB,CACA,MAEF,QACgC,qBAAzBpzF,EAAK4mF,iBAAqE,0BAAzB5mF,EAAK4mF,kBACzD7kF,EAAS6K,EAAK5C,KAAI,SAAUsG,GAC1B,MAAMmjF,EAAgBlK,GAAcj5E,EAAK+4E,EAAaG,EAAUxpF,GAC1D0zF,EAAe9J,GAAkB5pF,EAAMsQ,EAAK+4E,GAC5CsK,EAAmBhK,GAAiBr5E,EAAK+4E,GAC/C,OAAsB,OAAlBoK,IAGQhK,IAAegK,GAAmB1K,IAAkB4K,IAAsBD,GAE3ED,EAAgBhK,EAK7B,KASN,GAAI78E,EAAKvL,QAAU,GAA8B,0BAAzBrB,EAAK4mF,iBACzB5mF,EAAKwpF,UAA4B,QAAhBH,GAAsC,SAAbG,EAC5C,IAAK,IAAIpnF,EAAI,EAAGA,EAAIL,EAAOV,SAAUe,GAC/BswF,EAAmB9lF,EAAKxK,GAAIinF,IAAiBtnF,EAAOK,EAAI,IACvC,SAAhBinF,GAA2B5lE,GAAkB7W,EAAKxK,EAAI,MACzDL,EAAOK,IAAK,GAKlB,OAAOL,CACT,CAEA,MAAM6xF,UAAqBtM,EAYzB3hF,WAAAA,CAAayd,EAAIhb,EAAIwE,EAAM48E,EAAUqK,GAGnC,GAFAnM,QAEkB,iBAAPtkE,EACT,MAAM,IAAIpc,UAAU,sCAEtB,GAAkB,iBAAPoB,EACT,MAAM,IAAIpB,UAAU,sCAEtB,IAAKjB,MAAMC,QAAQ4G,KAAUA,EAAKgH,MAAM8O,GACtC,MAAM,IAAI1b,UACR,wDAGJ1G,KAAKkpF,UAAyB,IAAbA,EACjBlpF,KAAKuzF,cAAiC,IAAjBA,EACrBvzF,KAAK8iB,GAAKA,EACV9iB,KAAK8H,GAAKA,EACV9H,KAAKsM,KAAOA,GAAQ,EACtB,CAGA,QAAIjG,GAAU,OAAOd,EAAK,CAC1B,kBAAIqd,GAAoB,OAAO,CAAK,CAepCuiE,QAAAA,CAAUrrE,EAAMwrE,GAEd,GAAuB,iBAAZtlF,KAAK8H,KAAoBmX,EAAanF,EAAM9Z,KAAK8H,IAC1D,MAAKgS,EAAK9Z,KAAK8H,IAIP,IAAIuO,MAAM,0BAA4BrW,KAAK8H,GAAK,KAHhD,IAAIuO,MACR,YAAcrW,KAAK8H,GAAK,yCAM9B,MAAMA,EAAKgX,EAAgBhF,EAAM9Z,KAAK8H,IAChC0rF,EAAW9pF,GAAI1J,KAAKsM,MAAM,SAAU0D,GACxC,OAAOA,EAAIm1E,SAASrrE,EAAMwrE,EAC5B,IAEA,GAAkB,mBAAPx9E,IAAoC,IAAfA,EAAG2rF,QAAkB,CAGnD,MAAMA,EAAUzzF,KAAKsM,KACrB,OAAO,SAA2BqY,EAAOrY,EAAMi7E,GAC7C,OAAOz/E,EAAG2rF,EAAS35E,EAAMm4E,GAAettE,EAAOrY,GACjD,CACF,CAAO,GAAwB,IAApBknF,EAASzyF,OAAc,CAChC,MAAM2yF,EAAWF,EAAS,GAC1B,OAAO,SAA2B7uE,EAAOrY,EAAMi7E,GAC7C,OAAOz/E,EAAG4rF,EAAS/uE,EAAOrY,EAAMi7E,GAClC,CACF,CAAO,GAAwB,IAApBiM,EAASzyF,OAAc,CAChC,MAAM2yF,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GAC1B,OAAO,SAA2B7uE,EAAOrY,EAAMi7E,GAC7C,OAAOz/E,EACL4rF,EAAS/uE,EAAOrY,EAAMi7E,GACtBoM,EAAShvE,EAAOrY,EAAMi7E,GAC1B,CACF,CACE,OAAO,SAA2B5iE,EAAOrY,EAAMi7E,GAC7C,OAAOz/E,EAAG0F,MAAM,KAAM9D,GAAI8pF,GAAU,SAAUI,GAC5C,OAAOA,EAAQjvE,EAAOrY,EAAMi7E,EAC9B,IACF,CAEJ,CAMArjF,OAAAA,CAASqM,GACP,IAAK,IAAIzO,EAAI,EAAGA,EAAI9B,KAAKsM,KAAKvL,OAAQe,IACpCyO,EAASvQ,KAAKsM,KAAKxK,GAAI,QAAUA,EAAI,IAAK9B,KAE9C,CAQA0J,GAAAA,CAAK6G,GACH,MAAMjE,EAAO,GACb,IAAK,IAAIxK,EAAI,EAAGA,EAAI9B,KAAKsM,KAAKvL,OAAQe,IACpCwK,EAAKxK,GAAK9B,KAAKulF,QAAQh1E,EAASvQ,KAAKsM,KAAKxK,GAAI,QAAUA,EAAI,IAAK9B,OAEnE,OAAO,IAAIszF,EACTtzF,KAAK8iB,GAAI9iB,KAAK8H,GAAIwE,EAAMtM,KAAKkpF,SAAUlpF,KAAKuzF,aAChD,CAMA9vE,KAAAA,GACE,OAAO,IAAI6vE,EACTtzF,KAAK8iB,GAAI9iB,KAAK8H,GAAI9H,KAAKsM,KAAKpK,MAAM,GAAIlC,KAAKkpF,SAAUlpF,KAAKuzF,aAC9D,CAQAhtD,OAAAA,GACE,OAA4B,IAArBvmC,KAAKsM,KAAKvL,MACnB,CAQA0rB,QAAAA,GACE,OAA4B,IAArBzsB,KAAKsM,KAAKvL,MACnB,CAOAilF,SAAAA,CAAWh+E,GACT,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDG,EAAYlhF,GAAWA,EAAQkhF,SAAYlhF,EAAQkhF,SAAW,OAC9D58E,EAAOtM,KAAKsM,KACZunF,EACFvB,EAA8BtyF,KAAM+oF,EAAaG,EAAU58E,GAAM,GAErE,GAAoB,IAAhBA,EAAKvL,OAAc,CACrB,MAAM+yF,EAAQzK,GAAiBrpF,KAAM+oF,GAErC,IAAIgL,EAAUznF,EAAK,GAAGsG,SAAS5K,GAC3B6rF,EAAO,KACTE,EAAU,IAAMA,EAAU,KAI5B,MAAMC,EAAY,YAAYxuF,KAAKxF,KAAK8iB,IAExC,MAAc,UAAVgxE,EACK9zF,KAAK8iB,IAAMkxE,EAAY,IAAM,IAAMD,EACvB,SAAVD,EACFC,GAAWC,EAAY,IAAM,IAAMh0F,KAAK8iB,GAI1CixE,EAAU/zF,KAAK8iB,EACxB,CAAO,GAAoB,IAAhBxW,EAAKvL,OAAc,CAC5B,IAAIkzF,EAAM3nF,EAAK,GAAGsG,SAAS5K,GACvBksF,EAAM5nF,EAAK,GAAGsG,SAAS5K,GAQ3B,OAPI6rF,EAAO,KACTI,EAAM,IAAMA,EAAM,KAEhBJ,EAAO,KACTK,EAAM,IAAMA,EAAM,KAGhBl0F,KAAKkpF,UACqB,0BAAzBlpF,KAAKsmF,iBACQ,SAAb4C,EACI+K,EAAM,IAAMC,EAGdD,EAAM,IAAMj0F,KAAK8iB,GAAK,IAAMoxE,CACrC,CAAO,GAAK5nF,EAAKvL,OAAS,IACY,qBAAzBf,KAAKsmF,iBACuB,0BAAzBtmF,KAAKsmF,iBAA+C,CAClE,MAAM6N,EAAkB7nF,EAAK5C,KAAI,SAAUsG,EAAK7L,GAM9C,OALA6L,EAAMA,EAAI4C,SAAS5K,GACf6rF,EAAO1vF,KACT6L,EAAM,IAAMA,EAAM,KAGbA,CACT,IAEA,OAAIhQ,KAAKkpF,UACqB,0BAAzBlpF,KAAKsmF,iBACQ,SAAb4C,EACIiL,EAAgB/rF,KAAK,KAGvB+rF,EAAgB/rF,KAAK,IAAMpI,KAAK8iB,GAAK,IAC9C,CAEE,OAAO9iB,KAAK8H,GAAK,IAAM9H,KAAKsM,KAAKlE,KAAK,MAAQ,GAElD,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRud,GAAI9iB,KAAK8iB,GACThb,GAAI9H,KAAK8H,GACTwE,KAAMtM,KAAKsM,KACX48E,SAAUlpF,KAAKkpF,SACfqK,aAAcvzF,KAAKuzF,aAEvB,CAeA,eAAOtoE,CAAUC,GACf,OAAO,IAAIooE,EACTpoE,EAAKpI,GAAIoI,EAAKpjB,GAAIojB,EAAK5e,KAAM4e,EAAKg+D,SAAUh+D,EAAKqoE,aACrD,CAOArN,OAAAA,CAASl+E,GACP,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDG,EAAYlhF,GAAWA,EAAQkhF,SAAYlhF,EAAQkhF,SAAW,OAC9D58E,EAAOtM,KAAKsM,KACZunF,EACFvB,EAA8BtyF,KAAM+oF,EAAaG,EAAU58E,GAAM,GAErE,GAAoB,IAAhBA,EAAKvL,OAAc,CACrB,MAAM+yF,EAAQzK,GAAiBrpF,KAAM+oF,GAErC,IAAIgL,EAAUznF,EAAK,GAAG25E,OAAOj+E,GAQ7B,OAPI6rF,EAAO,KACTE,EACE,iEACAA,EACA,kEAGU,UAAVD,EACK,gFAC8B3yD,GAAOnhC,KAAK8iB,IAAM,UACrDixE,EAEKA,mFAE+B5yD,GAAOnhC,KAAK8iB,IAAM,SAE5D,CAAO,GAAoB,IAAhBxW,EAAKvL,OAAc,CAC5B,IAAIkzF,EAAM3nF,EAAK,GAAG25E,OAAOj+E,GACrBksF,EAAM5nF,EAAK,GAAG25E,OAAOj+E,GAYzB,OAXI6rF,EAAO,KACTI,EAAM,iEACJA,EACA,kEAEAJ,EAAO,KACTK,EAAM,iEACJA,EACA,kEAGAl0F,KAAKkpF,UACqB,0BAAzBlpF,KAAKsmF,iBACQ,SAAb4C,EACI+K,2FAEsCC,EAGxCD,oFAE+B9yD,GAAOnhC,KAAK8iB,IAAM,UACtDoxE,CACJ,CAAO,CACL,MAAMC,EAAkB7nF,EAAK5C,KAAI,SAAUsG,EAAK7L,GAS9C,OARA6L,EAAMA,EAAIi2E,OAAOj+E,GACb6rF,EAAO1vF,KACT6L,EACE,iEACAA,EACA,kEAGGA,CACT,IAEA,OAAK1D,EAAKvL,OAAS,IACY,qBAAzBf,KAAKsmF,iBACuB,0BAAzBtmF,KAAKsmF,iBACRtmF,KAAKkpF,UACqB,0BAAzBlpF,KAAKsmF,iBACQ,SAAb4C,EACIiL,EAAgB/rF,KACrB,0FAIG+rF,EAAgB/rF,KACrB,kFACsC+4B,GAAOnhC,KAAK8iB,IAAM,WAGnD,+BAAiCqe,GAAOnhC,KAAK8H,IAA7C,wEAGLqsF,EAAgB/rF,KAAK,yCACrB,gEAEN,CACF,CAOAg+E,MAAAA,CAAQp+E,GACN,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDG,EAAYlhF,GAAWA,EAAQkhF,SAAYlhF,EAAQkhF,SAAW,OAC9D58E,EAAOtM,KAAKsM,KACZunF,EACFvB,EAA8BtyF,KAAM+oF,EAAaG,EAAU58E,GAAM,GAErE,IAAIwW,EAAK0rE,GAAexuF,KAAK8H,IAG7B,GAFAgb,OAAmB,IAAPA,EAAqB9iB,KAAK8iB,GAAKA,EAEvB,IAAhBxW,EAAKvL,OAAc,CACrB,MAAM+yF,EAAQzK,GAAiBrpF,KAAM+oF,GAErC,IAAIgL,EAAUznF,EAAK,GAAG65E,MAAMn+E,GAK5B,OAJI6rF,EAAO,KACTE,EAAU,UAAUA,aAGR,UAAVD,EACKhxE,EAAKixE,EAELA,EAAUjxE,CAKrB,CAAO,GAAoB,IAAhBxW,EAAKvL,OAAc,CAC5B,MAAMkzF,EAAM3nF,EAAK,GACjB,IAAI8nF,EAASH,EAAI9N,MAAMn+E,GACnB6rF,EAAO,KACTO,EAAS,UAAUA,aAIrB,IAMInB,EANAoB,EADQ/nF,EAAK,GACA65E,MAAMn+E,GAavB,OAZI6rF,EAAO,KACTQ,EAAS,UAAUA,aAMnBpB,EADkB,SAAhBlK,EACckL,EAAI3N,gBAGJ2N,EAAI1N,aAAaD,gBAE3BtmF,KAAKsmF,iBACX,IAAK,sBAEH,OAAOxjE,EAAK,IAAMsxE,EAAXtxE,KAAgCuxE,EAAS,IAClD,IAAK,mBAGH,OAFAD,EAAS,IAAMA,EAAS,IACxBC,EAAS,IAAMA,EAAS,IAChBpB,GACN,IAAK,kBACL,IAAK,sBACHmB,EAAS,UAAUA,YAEvB,MACF,IAAK,wBACH,GAAIp0F,KAAKkpF,UAA0B,SAAbA,EACpB,OAAOkL,EAAS,IAAMC,EAG5B,OAAOD,EAAStxE,EAAKuxE,CACvB,CAAO,GAAK/nF,EAAKvL,OAAS,IACY,qBAAzBf,KAAKsmF,iBACuB,0BAAzBtmF,KAAKsmF,iBAA+C,CAClE,MAAMgO,EAAehoF,EAAK5C,KAAI,SAAUsG,EAAK7L,GAK3C,OAJA6L,EAAMA,EAAIm2E,MAAMn+E,GACZ6rF,EAAO1vF,KACT6L,EAAM,UAAUA,aAEXA,CACT,IAEA,MAA8B,0BAAzBhQ,KAAKsmF,iBACNtmF,KAAKkpF,UAAyB,SAAbA,EACZoL,EAAalsF,KAAK,KAGpBksF,EAAalsF,KAAK0a,EAC3B,CAIE,MAAO,YAAc9iB,KAAK8H,GAAK,WAC7BwE,EAAK5C,KAAI,SAAUsG,GACjB,OAAOA,EAAIm2E,MAAMn+E,EACnB,IAAGI,KAAK,KAAO,UAErB,CAMAk+E,aAAAA,GACE,OAAOtmF,KAAKqG,KAAO,IAAMrG,KAAK8H,EAChC,EAGF,OAFC2+E,GA5cK6M,EAAY,OAiCF/tF,IA6aT+tF,CAAY,GAClB,CAAEnoE,SAAS,EAAM/I,QAAQ,IC7rBtB7c,GAAO,kBAKAgvF,GAAwC50F,GAAQ4F,GAJxC,CACnB,SAG+ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EACxF,MAAMmxF,UAAwBxN,EAQ5B3hF,WAAAA,CAAa2jF,GAGX,GAFA5B,SAEKhlE,EAAO4mE,GACV,MAAM,IAAItiF,UAAU,yCAGtB1G,KAAKgpF,QAAUA,CACjB,CAGA,QAAI3iF,GAAU,OAAOd,EAAK,CAC1B,qBAAI4d,GAAuB,OAAO,CAAK,CAevCgiE,QAAAA,CAAUrrE,EAAMwrE,GACd,OAAOtlF,KAAKgpF,QAAQ7D,SAASrrE,EAAMwrE,EACrC,CAOAiB,UAAAA,GACE,OAAOvmF,KAAKgpF,QAAQzC,YACtB,CAMAriF,OAAAA,CAASqM,GACPA,EAASvQ,KAAKgpF,QAAS,UAAWhpF,KACpC,CAQA0J,GAAAA,CAAK6G,GACH,MAAMy4E,EAAUz4E,EAASvQ,KAAKgpF,QAAS,UAAWhpF,MAClD,OAAO,IAAIw0F,EAAgBxL,EAC7B,CAMAvlE,KAAAA,GACE,OAAO,IAAI+wE,EAAgBx0F,KAAKgpF,QAClC,CAQAhD,SAAAA,CAAWh+E,GACT,OAAMA,GACDA,IAAYA,EAAQ+gF,aACpB/gF,GAAmC,SAAxBA,EAAQ+gF,YACf,IAAM/oF,KAAKgpF,QAAQp2E,SAAS5K,GAAW,IAEzChI,KAAKgpF,QAAQp2E,SAAS5K,EAC/B,CAMA+iB,MAAAA,GACE,MAAO,CAAEC,OAAQzlB,GAAMyjF,QAAShpF,KAAKgpF,QACvC,CASA,eAAO/9D,CAAUC,GACf,OAAO,IAAIspE,EAAgBtpE,EAAK89D,QAClC,CAQA9C,OAAAA,CAASl+E,GACP,OAAMA,GACDA,IAAYA,EAAQ+gF,aACpB/gF,GAAmC,SAAxBA,EAAQ+gF,YACf,iEACL/oF,KAAKgpF,QAAQ/C,OAAOj+E,GACpB,iEAEGhI,KAAKgpF,QAAQ/C,OAAOj+E,EAC7B,CAQAo+E,MAAAA,CAAQp+E,GACN,OAAMA,GACDA,IAAYA,EAAQ+gF,aACpB/gF,GAAmC,SAAxBA,EAAQ+gF,YACf,UAAU/oF,KAAKgpF,QAAQ7C,MAAMn+E,aAE/BhI,KAAKgpF,QAAQ7C,MAAMn+E,EAC5B,EAGF,OAFCy+E,GA5IK+N,EAAe,OAkBLjvF,IA4HTivF,CAAe,GACrB,CAAErpE,SAAS,EAAM/I,QAAQ,ICpJtB7c,GAAO,YAKAkvF,GAAkC90F,GAAQ4F,GAJlC,CACnB,SAGyElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EASlF,SAASivF,EAA+B3vE,EAAMomE,EAAaG,GACzD,MAAMC,EAAaF,GAActmE,EAAMomE,EAAaG,GAC9C2K,EAAS,CAAC,EAEVa,EAAkBzL,GAActmE,EAAK3M,MAAO+yE,EAAaG,GAI/D,GAHA2K,EAAO79E,MAA8B,OAApB0+E,GAA8BA,GAAmBvL,GAC/C,QAAhBJ,EAECpmE,EAAKuc,KAAM,CACb,MAAMy1D,EAAiB1L,GAActmE,EAAKuc,KAAM6pD,EAAaG,GAC7D2K,EAAO30D,KAA4B,OAAnBy1D,GAA6BA,GAAkBxL,GAC5C,QAAhBJ,CACL,CAEA,MAAM6L,EAAgB3L,GAActmE,EAAK1M,IAAK8yE,EAAaG,GAI3D,OAHA2K,EAAO59E,IAA0B,OAAlB2+E,GAA4BA,GAAiBzL,GACzC,QAAhBJ,EAEI8K,CACT,CAEA,MAAMjL,UAAkB5B,EAStB3hF,WAAAA,CAAa2Q,EAAOC,EAAKipB,GAGvB,GAFAkoD,SAEKhlE,EAAOpM,GAAQ,MAAM,IAAItP,UAAU,iBACxC,IAAK0b,EAAOnM,GAAM,MAAM,IAAIvP,UAAU,iBACtC,GAAIw4B,IAAS9c,EAAO8c,GAAO,MAAM,IAAIx4B,UAAU,iBAC/C,GAAIjE,UAAU1B,OAAS,EAAG,MAAM,IAAIsV,MAAM,sBAE1CrW,KAAKgW,MAAQA,EACbhW,KAAKiW,IAAMA,EACXjW,KAAKk/B,KAAOA,GAAQ,IACtB,CAGA,QAAI74B,GAAU,OAAOd,EAAK,CAC1B,eAAI6d,GAAiB,OAAO,CAAK,CAOjCyxE,QAAAA,GAME,OAJmB70F,KAAK0H,QAAO,SAAUib,GACvC,OAAOW,GAAaX,IAAwB,QAAdA,EAAKpd,IACrC,IAEkBxE,OAAS,CAC7B,CAeAokF,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM97C,EAAQ1vB,EAAK0vB,MACbsrD,EAAY90F,KAAKgW,MAAMmvE,SAASrrE,EAAMwrE,GACtCyP,EAAU/0F,KAAKiW,IAAIkvE,SAASrrE,EAAMwrE,GAExC,GAAItlF,KAAKk/B,KAAM,CACb,MAAM81D,EAAWh1F,KAAKk/B,KAAKimD,SAASrrE,EAAMwrE,GAE1C,OAAO,SAAwB3gE,EAAOrY,EAAMi7E,GAC1C,OAAO/9C,EACLsrD,EAAUnwE,EAAOrY,EAAMi7E,GACvBwN,EAAQpwE,EAAOrY,EAAMi7E,GACrByN,EAASrwE,EAAOrY,EAAMi7E,GAE1B,CACF,CACE,OAAO,SAAwB5iE,EAAOrY,EAAMi7E,GAC1C,OAAO/9C,EACLsrD,EAAUnwE,EAAOrY,EAAMi7E,GACvBwN,EAAQpwE,EAAOrY,EAAMi7E,GAEzB,CAEJ,CAMArjF,OAAAA,CAASqM,GACPA,EAASvQ,KAAKgW,MAAO,QAAShW,MAC9BuQ,EAASvQ,KAAKiW,IAAK,MAAOjW,MACtBA,KAAKk/B,MACP3uB,EAASvQ,KAAKk/B,KAAM,OAAQl/B,KAEhC,CAQA0J,GAAAA,CAAK6G,GACH,OAAO,IAAIq4E,EACT5oF,KAAKulF,QAAQh1E,EAASvQ,KAAKgW,MAAO,QAAShW,OAC3CA,KAAKulF,QAAQh1E,EAASvQ,KAAKiW,IAAK,MAAOjW,OACvCA,KAAKk/B,MAAQl/B,KAAKulF,QAAQh1E,EAASvQ,KAAKk/B,KAAM,OAAQl/B,OAE1D,CAMAyjB,KAAAA,GACE,OAAO,IAAImlE,EAAU5oF,KAAKgW,MAAOhW,KAAKiW,IAAKjW,KAAKk/B,MAAQl/B,KAAKk/B,KAC/D,CAOA8mD,SAAAA,CAAWh+E,GACT,MAEM6rF,EACFvB,EACEtyF,KAHDgI,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OAGpC/gF,GAAWA,EAAQkhF,UAG5C,IAAI9lF,EAEA4S,EAAQhW,KAAKgW,MAAMpD,SAAS5K,GAMhC,GALI6rF,EAAO79E,QACTA,EAAQ,IAAMA,EAAQ,KAExB5S,EAAM4S,EAEFhW,KAAKk/B,KAAM,CACb,IAAIA,EAAOl/B,KAAKk/B,KAAKtsB,SAAS5K,GAC1B6rF,EAAO30D,OACTA,EAAO,IAAMA,EAAO,KAEtB97B,GAAO,IAAM87B,CACf,CAEA,IAAIjpB,EAAMjW,KAAKiW,IAAIrD,SAAS5K,GAM5B,OALI6rF,EAAO59E,MACTA,EAAM,IAAMA,EAAM,KAEpB7S,GAAO,IAAM6S,EAEN7S,CACT,CAMA2nB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRyQ,MAAOhW,KAAKgW,MACZC,IAAKjW,KAAKiW,IACVipB,KAAMl/B,KAAKk/B,KAEf,CAUA,eAAOjU,CAAUC,GACf,OAAO,IAAI09D,EAAU19D,EAAKlV,MAAOkV,EAAKjV,IAAKiV,EAAKgU,KAClD,CAOAgnD,OAAAA,CAASl+E,GACP,MAEM6rF,EACFvB,EACEtyF,KAHDgI,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OAGpC/gF,GAAWA,EAAQkhF,UAG5C,IAAI9lF,EAEA4S,EAAQhW,KAAKgW,MAAMiwE,OAAOj+E,GAQ9B,GAPI6rF,EAAO79E,QACTA,EAAQ,iEACNA,EACA,kEAEJ5S,EAAM4S,EAEFhW,KAAKk/B,KAAM,CACb,IAAIA,EAAOl/B,KAAKk/B,KAAK+mD,OAAOj+E,GACxB6rF,EAAO30D,OACTA,EAAO,iEACLA,EACA,kEAEJ97B,GAAO,2DAA6D87B,CACtE,CAEA,IAAIjpB,EAAMjW,KAAKiW,IAAIgwE,OAAOj+E,GAQ1B,OAPI6rF,EAAO59E,MACTA,EAAM,iEACJA,EACA,kEAEJ7S,GAAO,2DAA6D6S,EAE7D7S,CACT,CAOAgjF,MAAAA,CAAQp+E,GACN,MAEM6rF,EACFvB,EACEtyF,KAHDgI,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OAGpC/gF,GAAWA,EAAQkhF,UAE5C,IAAI9lF,EAAMpD,KAAKgW,MAAMmwE,MAAMn+E,GAK3B,GAJI6rF,EAAO79E,QACT5S,EAAM,UAAUA,aAGdpD,KAAKk/B,KAAM,CACb,IAAIA,EAAOl/B,KAAKk/B,KAAKinD,MAAMn+E,GACvB6rF,EAAO30D,OACTA,EAAO,UAAUA,aAEnB97B,GAAO,IAAM87B,CACf,CAEA,IAAIjpB,EAAMjW,KAAKiW,IAAIkwE,MAAMn+E,GAMzB,OALI6rF,EAAO59E,MACTA,EAAM,UAAUA,aAElB7S,GAAO,IAAM6S,EAEN7S,CACT,EAGF,OAFCqjF,GA5PKmC,EAAS,OAsBCrjF,IAwOTqjF,CAAS,GACf,CAAEz9D,SAAS,EAAM/I,QAAQ,IChStB7c,GAAO,iBAKA0vF,GAAuCt1F,GAAQ4F,GAJvC,CACnB,SAG8ElC,IAAc,IAAb,KAAE2jF,GAAM3jF,EACvF,MAAM6xF,EAAc,CAClB/zC,MAAO,KACP6tC,QAAS,KACT5tC,QAAS,IACTwJ,OAAQ,IACRD,UAAW,KACXE,SAAU,MAGZ,MAAM89B,UAAuB3B,EAY3B3hF,WAAAA,CAAa8vF,EAAcjtF,GAEzB,GADAk/E,SACK3hF,MAAMC,QAAQyvF,GAAiB,MAAM,IAAIzuF,UAAU,2CACxD,IAAKjB,MAAMC,QAAQwC,GAAW,MAAM,IAAIxB,UAAU,qCAClD,GAAIyuF,EAAap0F,SAAWmH,EAAOnH,OAAS,EAC1C,MAAM,IAAI2F,UACR,sFAIJ1G,KAAKm1F,aAAeA,EACpBn1F,KAAKkI,OAASA,CAChB,CAGA,QAAI7B,GAAU,OAAOd,EAAK,CAC1B,oBAAI8d,GAAsB,OAAO,CAAK,CAetC8hE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM3zE,EAAO3R,KAEPo1F,EAAWp1F,KAAKkI,OAAOwB,KAAIC,GAAKA,EAAEw7E,SAASrrE,EAAMwrE,KAEvD,OAAO,SAA6B3gE,EAAOrY,EAAMi7E,GAC/C,IAAI8N,EACAC,EAAUF,EAAS,GAAGzwE,EAAOrY,EAAMi7E,GAEvC,IAAK,IAAIzlF,EAAI,EAAGA,EAAI6P,EAAKwjF,aAAap0F,OAAQe,IAI5C,GAHAuzF,EAAUC,EACVA,EAAUF,EAAStzF,EAAI,GAAG6iB,EAAOrY,EAAMi7E,IACxBzoE,EAAgBhF,EAAMnI,EAAKwjF,aAAarzF,GAClDyzF,CAAOF,EAASC,GACnB,OAAO,EAGX,OAAO,CACT,CACF,CAMApxF,OAAAA,CAASqM,GACPvQ,KAAKkI,OAAOhE,SAAQ,CAACG,EAAGvC,IAAMyO,EAASlM,EAAG,UAAYvC,EAAI,IAAK9B,OAAOA,KACxE,CAQA0J,GAAAA,CAAK6G,GACH,OAAO,IAAIo4E,EACT3oF,KAAKm1F,aAAajzF,QAClBlC,KAAKkI,OAAOwB,KACV,CAACrF,EAAGvC,IAAM9B,KAAKulF,QAAQh1E,EAASlM,EAAG,UAAYvC,EAAI,IAAK9B,QAAQA,MACtE,CAMAyjB,KAAAA,GACE,OAAO,IAAIklE,EAAe3oF,KAAKm1F,aAAcn1F,KAAKkI,OACpD,CAOA89E,SAAAA,CAAWh+E,GACT,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDI,EACFF,GAAcjpF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,UAElDsM,EAAex1F,KAAKkI,OAAOwB,KAAI,SAAUC,EAAGxF,GAChD,MAAMsxF,EACFxM,GAAct/E,EAAGo/E,EAAa/gF,GAAWA,EAAQkhF,UACrD,MAAwB,QAAhBH,GACqB,OAApB0M,GAA4BA,GAAmBtM,EACpD,IAAMx/E,EAAEiJ,SAAS5K,GAAW,IAC5B2B,EAAEiJ,SAAS5K,EACjB,IAEA,IAAIszB,EAAMk6D,EAAa,GACvB,IAAK,IAAI1zF,EAAI,EAAGA,EAAI9B,KAAKm1F,aAAap0F,OAAQe,IAC5Cw5B,GAAO,IAAM45D,EAAYl1F,KAAKm1F,aAAarzF,IAC3Cw5B,GAAO,IAAMk6D,EAAa1zF,EAAI,GAGhC,OAAOw5B,CACT,CAMAvQ,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACR4vF,aAAcn1F,KAAKm1F,aACnBjtF,OAAQlI,KAAKkI,OAEjB,CAUA,eAAO+iB,CAAUC,GACf,OAAO,IAAIy9D,EAAez9D,EAAKiqE,aAAcjqE,EAAKhjB,OACpD,CAOAg+E,OAAAA,CAASl+E,GACP,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDI,EACFF,GAAcjpF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,UAElDsM,EAAex1F,KAAKkI,OAAOwB,KAAI,SAAUC,EAAGxF,GAChD,MAAMsxF,EACFxM,GAAct/E,EAAGo/E,EAAa/gF,GAAWA,EAAQkhF,UACrD,MAAwB,QAAhBH,GACqB,OAApB0M,GAA4BA,GAAmBtM,EACnD,iEACAx/E,EAAEs8E,OAAOj+E,GACT,iEACD2B,EAAEs8E,OAAOj+E,EACf,IAEA,IAAIszB,EAAMk6D,EAAa,GACvB,IAAK,IAAI1zF,EAAI,EAAGA,EAAI9B,KAAKm1F,aAAap0F,OAAQe,IAC5Cw5B,GAAO,kFAEL6F,GAAO+zD,EAAYl1F,KAAKm1F,aAAarzF,KAAO,UAC5C0zF,EAAa1zF,EAAI,GAGrB,OAAOw5B,CACT,CAOA8qD,MAAAA,CAAQp+E,GACN,MAAM+gF,EACD/gF,GAAWA,EAAQ+gF,YAAe/gF,EAAQ+gF,YAAc,OACvDI,EACFF,GAAcjpF,KAAM+oF,EAAa/gF,GAAWA,EAAQkhF,UAElDsM,EAAex1F,KAAKkI,OAAOwB,KAAI,SAAUC,EAAGxF,GAChD,MAAMsxF,EACFxM,GAAct/E,EAAGo/E,EAAa/gF,GAAWA,EAAQkhF,UACrD,MAAwB,QAAhBH,GACqB,OAApB0M,GAA4BA,GAAmBtM,EACpD,UAAYx/E,EAAEw8E,MAAMn+E,GAAW,UAC/B2B,EAAEw8E,MAAMn+E,EACd,IAEA,IAAIszB,EAAMk6D,EAAa,GACvB,IAAK,IAAI1zF,EAAI,EAAGA,EAAI9B,KAAKm1F,aAAap0F,OAAQe,IAC5Cw5B,GAAOkzD,GAAexuF,KAAKm1F,aAAarzF,IAAM0zF,EAAa1zF,EAAI,GAGjE,OAAOw5B,CACT,EAGF,OAFCmrD,GA9MKkC,EAAc,OA0BJpjF,IAsLTojF,CAAc,GACpB,CAAEx9D,SAAS,EAAM/I,QAAQ,IC1NfszE,GAAmC/1F,GAPnC,aACQ,CACnB,OACA,QACA,SAG0E0D,IAA0B,IAAzB,KAAEyW,EAAI,KAAEmzB,EAAI,KAAE+5C,GAAM3jF,EAM/F,SAASyiE,EAAiBvgE,GACxB,QAAO0nC,GAAOA,EAAK64B,gBAAgBvgE,EACrC,CAEA,MAAMowF,UAAmB3O,EAQvB3hF,WAAAA,CAAaE,GAGX,GAFA6hF,QAEoB,iBAAT7hF,EACT,MAAM,IAAImB,UAAU,wCAGtB1G,KAAKuF,KAAOA,CACd,CAEA,QAAIc,GAAU,MAAO,YAAa,CAClC,gBAAIid,GAAkB,OAAO,CAAK,CAelC6hE,QAAAA,CAAUrrE,EAAMwrE,GACd,MAAM//E,EAAOvF,KAAKuF,KAElB,IAAuB,IAAnB+/E,EAAS//E,GAIX,OAAO,SAAUof,EAAOrY,EAAMi7E,GAC5B,OAAOzoE,EAAgBxS,EAAM/G,EAC/B,EACK,GAAIA,KAAQuU,EACjB,OAAO,SAAU6K,EAAOrY,EAAMi7E,GAC5B,OAAO5iE,EAAM3d,IAAIzB,GACbof,EAAMre,IAAIf,GACVuZ,EAAgBhF,EAAMvU,EAC5B,EACK,CACL,MAAM0b,EAAS6kD,EAAgBvgE,GAE/B,OAAO,SAAUof,EAAOrY,EAAMi7E,GAC5B,OAAO5iE,EAAM3d,IAAIzB,GACbof,EAAMre,IAAIf,GACV0b,EACE,IAAIgsB,EAAK,KAAM1nC,GACfowF,EAAWC,kBAAkBrwF,EACrC,CACF,CACF,CAMArB,OAAAA,CAASqM,GACP,CASF7G,GAAAA,CAAK6G,GACH,OAAOvQ,KAAKyjB,OACd,CAMA,wBAAOmyE,CAAmBrwF,GACxB,MAAM,IAAI8Q,MAAM,oBAAsB9Q,EACxC,CAMAke,KAAAA,GACE,OAAO,IAAIkyE,EAAW31F,KAAKuF,KAC7B,CAQAygF,SAAAA,CAAWh+E,GACT,OAAOhI,KAAKuF,IACd,CAQA2gF,OAAAA,CAASl+E,GACP,MAAMzC,EAAO47B,GAAOnhC,KAAKuF,MAEzB,MAAa,SAATA,GAA4B,UAATA,EACd,0CAA4CA,EAAO,UACxC,MAATA,EACF,mDACLA,EAAO,UACS,aAATA,EACF,kDACLA,EAAO,UACS,QAATA,EACF,6CAA+CA,EAAO,UAC3C,SAATA,EACF,8CAAgDA,EAAO,UAC5C,cAATA,EACF,mDACLA,EAAO,UAGJ,6BAA+BA,EAAO,SAC/C,CAMAwlB,MAAAA,GACE,MAAO,CACLC,OAAQ,aACRzlB,KAAMvF,KAAKuF,KAEf,CASA,eAAO0lB,CAAUC,GACf,OAAO,IAAIyqE,EAAWzqE,EAAK3lB,KAC7B,CAQA6gF,MAAAA,CAAQp+E,GACN,IAAIiZ,GAAS,OACmB,IAApBnH,EAAK9Z,KAAKuF,OAClBugE,EAAgB9lE,KAAKuF,QACvB0b,GAAS,GAEX,MAAMmkE,EAASyL,GAAS7wF,KAAKuF,KAAM0b,GACnC,MAAkB,OAAdmkE,EAAO,GAEFA,EAIF,IAAMA,CACf,EAGF,OAAOuQ,CAAU,GAChB,CAAExqE,SAAS,EAAM/I,QAAQ,ICpMtB7c,GAAO,eAOAswF,GAAqCl2F,GAAQ4F,GANrC,CACnB,OACA,OACA,eAG4ElC,IAAgC,IAAAyyF,EAAA,IAA/B,KAAEh8E,EAAI,KAAEktE,EAAI,WAAE2O,GAAYtyF,EAEvG,MAAM0yF,EAAQnuF,GAAUkf,GAAOlf,EAAQ,CAAE+vB,SAAU,KAUnD,SAASq+D,EAAgBzgC,EAAU5yC,EAAM3a,GACvC,IAAIuqF,EAAQ,GAIZ,MAAM0D,EAAQ,qDAEd,IACIztF,EADA0tF,EAAW,EAEf,KAA0C,QAAlC1tF,EAAQytF,EAAME,KAAK5gC,KAKzB,GAHAg9B,GAASh9B,EAASl9B,UAAU69D,EAAU1tF,EAAMrE,OAC5C+xF,EAAW1tF,EAAMrE,MAEA,OAAbqE,EAAM,GACR+pF,GAAS,IACT2D,QACK,CACLA,GAAY1tF,EAAM,GAAGzH,OACrB,MAAMwjB,EAAW5B,EAAKna,EAAM,IAC5B,IAAK+b,EACH,MAAM,IAAI6xE,eAAe,sBAAwB5tF,EAAM,GAAK,oBAE9D,QAAiBlF,IAAbkF,EAAM,GACR,cAAe+b,GACb,IAAK,SACHguE,GAAShuE,EACT,MACF,IAAK,SACH,GAAInC,EAAOmC,GACTguE,GAAShuE,EAAS4hE,MAAMn+E,OACnB,KAAIvC,MAAMC,QAAQ6e,GASvB,MAAM,IAAI7d,UAAU,aAAe8B,EAAM,GAAK,+CAP9C+pF,GAAShuE,EAAS7a,KAAI,SAAUsG,EAAK7L,GACnC,GAAIie,EAAOpS,GACT,OAAOA,EAAIm2E,MAAMn+E,GAEnB,MAAM,IAAItB,UAAU,aAAe8B,EAAM,GAAK,IAAMrE,EAAQ,mBAC9D,IAAGiE,KAAK,IAGV,CACA,MACF,QACE,MAAM,IAAI1B,UAAU,aAAe8B,EAAM,GAAK,mDAE7C,CACL,IAAI4Z,EAAOmC,EAAS/b,EAAM,KAAO+b,EAAS/b,EAAM,KAG9C,MAAM,IAAI9B,UAAU,aAAe8B,EAAM,GAAK,IAAMA,EAAM,GAAK,oBAF/D+pF,GAAShuE,EAAS/b,EAAM,IAAI29E,MAAMn+E,EAItC,CACF,CAIF,OAFAuqF,GAASh9B,EAASrzD,MAAMg0F,GAEjB3D,CACT,CAEA,MAAM8D,UAAqBrP,EAUzB3hF,WAAAA,CAAayC,EAAIwE,GAOf,GANA86E,QACkB,iBAAPt/E,IACTA,EAAK,IAAI6tF,EAAW7tF,KAIjBsa,EAAOta,GAAK,MAAM,IAAIpB,UAAU,mCACrC,IAAKjB,MAAMC,QAAQ4G,KAAUA,EAAKgH,MAAM8O,GACtC,MAAM,IAAI1b,UACR,wDAGJ1G,KAAK8H,GAAKA,EACV9H,KAAKsM,KAAOA,GAAQ,EACtB,CAGA,QAAI/G,GACF,OAAOvF,KAAK8H,GAAGvC,MAAQ,EACzB,CAGA,QAAIc,GAAU,OAAOd,EAAK,CAC1B,kBAAIyd,GAAoB,OAAO,CAAK,CAepCmiE,QAAAA,CAAUrrE,EAAMwrE,GAEd,MAAMkO,EAAWxzF,KAAKsM,KAAK5C,KAAKsG,GAAQA,EAAIm1E,SAASrrE,EAAMwrE,KAE3D,IAAIhiE,GAAatjB,KAAK8H,IA0Ff,IACLqa,EAAeniB,KAAK8H,KAClBmb,EAAYjjB,KAAK8H,GAAG3D,QACpBnE,KAAK8H,GAAG3D,MAAMi7D,mBAChB,CAIA,MAAMioB,EAAarnF,KAAK8H,GAAGiX,OAAOomE,SAASrrE,EAAMwrE,GAC3CrpE,EAAOjc,KAAK8H,GAAG3D,MAAMk7D,oBACrBo0B,EAAUzzF,KAAKsM,KAErB,OAAO,SAA2BqY,EAAOrY,EAAMi7E,GAC7C,MAAMxoE,EAASsoE,EAAW1iE,EAAOrY,EAAMi7E,GACjCz/E,EjR/JhB,SAAwBiX,EAAQM,GAC9B,IAAKJ,EAAaF,EAAQM,GACxB,MAAM,IAAIhJ,MAAM,wBAA0BgJ,EAAS,KAGrD,OAAON,EAAOM,EAChB,CiRyJqBi3E,CAAcv3E,EAAQ9C,GAEjC,GAAInU,SAAAA,EAAI2rF,QAEN,OAAO3rF,EAAG2rF,EAAS35E,EAAMm4E,GAAettE,EAAOrY,IAC1C,CAEL,MAAMwT,EAAS0zE,EAAS9pF,KAAKkqF,GAAYA,EAAQjvE,EAAOrY,EAAMi7E,KAC9D,OAAOz/E,EAAG0F,MAAMuR,EAAQe,EAC1B,CACF,CACF,CAAO,CAIL,MAAMy2E,EAASv2F,KAAK8H,GAAG8K,WACjB4jF,EAASx2F,KAAK8H,GAAGq9E,SAASrrE,EAAMwrE,GAChCmO,EAAUzzF,KAAKsM,KAErB,OAAO,SAA2BqY,EAAOrY,EAAMi7E,GAC7C,MAAMz/E,EAAK0uF,EAAO7xE,EAAOrY,EAAMi7E,GAC/B,GAAkB,mBAAPz/E,EACT,MAAM,IAAIpB,UACR,eAAe6vF,mDACNR,EAAMjuF,MAGnB,GAAIA,EAAG2rF,QAEL,OAAO3rF,EAAG2rF,EAAS35E,EAAMm4E,GAAettE,EAAOrY,IAC1C,CAEL,MAAMwT,EAAS0zE,EAAS9pF,KACrBkqF,GAAYA,EAAQjvE,EAAOrY,EAAMi7E,KACpC,OAAOz/E,EAAG0F,MAAM1F,EAAIgY,EACtB,CACF,CACF,EA7I2B,CACzB,MAAMva,EAAOvF,KAAK8H,GAAGvC,KACrB,GAAK+/E,EAAS//E,GAqEP,CACL,MAAMkuF,EAAUzzF,KAAKsM,KACrB,OAAO,SAA2BqY,EAAOrY,EAAMi7E,GAC7C,MAAMz/E,EAAKgX,EAAgBxS,EAAM/G,GACjC,GAAkB,mBAAPuC,EACT,MAAM,IAAIpB,UACR,aAAanB,oCAAuCwwF,EAAMjuF,MAG9D,GAAIA,EAAG2rF,QAEL,OAAO3rF,EAAG2rF,EAAS35E,EAAMm4E,GAAettE,EAAOrY,IAC1C,CACL,MAAMwT,EAAS0zE,EAAS9pF,KACrBkqF,GAAYA,EAAQjvE,EAAOrY,EAAMi7E,KACpC,OAAOz/E,EAAG0F,MAAM1F,EAAIgY,EACtB,CACF,CACF,CAvFqB,CAGnB,MAAMhY,EAAKvC,KAAQuU,EAAOgF,EAAgBhF,EAAMvU,QAAQjC,EAClDmzF,EAAsB,mBAAP3uF,IAAoC,IAAfA,EAAG2rF,QAEvCiD,EAAa/xE,IACjB,IAAInd,EACJ,GAAImd,EAAM3d,IAAIzB,GACZiC,EAAQmd,EAAMre,IAAIf,OACb,MAAIA,KAAQuU,GAGjB,OAAOu8E,EAAaM,oBAAoBpxF,GAFxCiC,EAAQsX,EAAgBhF,EAAMvU,EAGhC,CACA,GAAqB,mBAAViC,EACT,OAAOA,EAET,MAAM,IAAId,UACR,IAAInB,0CAA6CwwF,EAAMvuF,KACxD,EAGH,GAAIivF,EAAO,CAGT,MAAMhD,EAAUzzF,KAAKsM,KACrB,OAAO,SAA2BqY,EAAOrY,EAAMi7E,GAC7C,MAAMz/E,EAAK4uF,EAAU/xE,GAGrB,OAAmB,IAAf7c,EAAG2rF,QACE3rF,EAAG2rF,EAAS35E,EAAMm4E,GAAettE,EAAOrY,IAIxCxE,KADQ0rF,EAAS9pF,KAAKkqF,GAAYA,EAAQjvE,EAAOrY,EAAMi7E,KAGlE,CACF,CAEE,OAAQiM,EAASzyF,QACf,KAAK,EAAG,OAAO,SAA2B4jB,EAAOrY,EAAMi7E,GAErD,OADWmP,EAAU/xE,EACd7c,EACT,EACA,KAAK,EAAG,OAAO,SAA2B6c,EAAOrY,EAAMi7E,GAGrD,OAFWmP,EAAU/xE,EAEd7c,EACL4rF,EAFeF,EAAS,IAEf7uE,EAAOrY,EAAMi7E,GAE1B,EACA,KAAK,EAAG,OAAO,SAA2B5iE,EAAOrY,EAAMi7E,GACrD,MAAMz/E,EAAK4uF,EAAU/xE,GACf+uE,EAAWF,EAAS,GACpBG,EAAWH,EAAS,GAC1B,OAAO1rF,EACL4rF,EAAS/uE,EAAOrY,EAAMi7E,GACtBoM,EAAShvE,EAAOrY,EAAMi7E,GAE1B,EACA,QAAS,OAAO,SAA2B5iE,EAAOrY,EAAMi7E,GAGtD,OAFWmP,EAAU/xE,EAEd7c,IADQ0rF,EAAS9pF,KAAKkqF,GAAYA,EAAQjvE,EAAOrY,EAAMi7E,KAEhE,EAGN,CAmBF,CAoDF,CAMArjF,OAAAA,CAASqM,GACPA,EAASvQ,KAAK8H,GAAI,KAAM9H,MAExB,IAAK,IAAI8B,EAAI,EAAGA,EAAI9B,KAAKsM,KAAKvL,OAAQe,IACpCyO,EAASvQ,KAAKsM,KAAKxK,GAAI,QAAUA,EAAI,IAAK9B,KAE9C,CAQA0J,GAAAA,CAAK6G,GACH,MAAMzI,EAAK9H,KAAKulF,QAAQh1E,EAASvQ,KAAK8H,GAAI,KAAM9H,OAC1CsM,EAAO,GACb,IAAK,IAAIxK,EAAI,EAAGA,EAAI9B,KAAKsM,KAAKvL,OAAQe,IACpCwK,EAAKxK,GAAK9B,KAAKulF,QAAQh1E,EAASvQ,KAAKsM,KAAKxK,GAAI,QAAUA,EAAI,IAAK9B,OAEnE,OAAO,IAAIq2F,EAAavuF,EAAIwE,EAC9B,CAMAmX,KAAAA,GACE,OAAO,IAAI4yE,EAAar2F,KAAK8H,GAAI9H,KAAKsM,KAAKpK,MAAM,GACnD,CAsBA0Q,QAAAA,CAAU5K,GACR,IAAI89E,EACJ,MAAMvgF,EAAOvF,KAAK8H,GAAG8K,SAAS5K,GAQ9B,OAPIA,GAC4B,iBAApBA,EAAQq+E,SAChBxjF,GAAemF,EAAQq+E,QAAS9gF,KAElCugF,EAAe99E,EAAQq+E,QAAQ9gF,GAAMvF,KAAMgI,SAGjB,IAAjB89E,EACFA,EAIFsB,MAAMx0E,SAAS5K,EACxB,CAOAg+E,SAAAA,CAAWh+E,GACT,MAAMsE,EAAOtM,KAAKsM,KAAK5C,KAAI,SAAUsG,GACnC,OAAOA,EAAI4C,SAAS5K,EACtB,IAOA,OALW+a,EAAyB/iB,KAAK8H,IACpC,IAAM9H,KAAK8H,GAAG8K,SAAS5K,GAAW,IACnChI,KAAK8H,GAAG8K,SAAS5K,IAGT,IAAMsE,EAAKlE,KAAK,MAAQ,GACtC,CAMA2iB,MAAAA,GACE,MAAO,CACLC,OAAQzlB,GACRuC,GAAI9H,KAAK8H,GACTwE,KAAMtM,KAAKsM,KAEf,CAkBA45E,OAAAA,CAASl+E,GACP,MAAMsE,EAAOtM,KAAKsM,KAAK5C,KAAI,SAAUsG,GACnC,OAAOA,EAAIi2E,OAAOj+E,EACpB,IAGA,MAAO,+BAAiCm5B,GAAOnhC,KAAK8H,IAClD,wEACAwE,EAAKlE,KAAK,yCACV,gEACJ,CAaA+9E,KAAAA,CAAOn+E,GACL,IAAI4uF,EAQJ,OAPI5uF,GAC4B,iBAApBA,EAAQq+E,SAChBxjF,GAAemF,EAAQq+E,QAASrmF,KAAKuF,QAEvCqxF,EAAY5uF,EAAQq+E,QAAQrmF,KAAKuF,MAAMvF,KAAMgI,SAGtB,IAAd4uF,EACFA,EAIFxP,MAAMjB,MAAMn+E,EACrB,CAOAo+E,MAAAA,CAAQp+E,GACN,MAAMsE,EAAOtM,KAAKsM,KAAK5C,KAAI,SAAUsG,GACnC,OAAOA,EAAIm2E,MAAMn+E,EACnB,IAEA,IAAI6uF,EAgBAC,EACJ,OAfIxH,GAAetvF,KAAKuF,QACtBsxF,EAAiBvH,GAAetvF,KAAKuF,QAInCuU,EAAK9Z,KAAKuF,OACyB,mBAA1BuU,EAAK9Z,KAAKuF,MAAM4gF,OACU,iBAA1BrsE,EAAK9Z,KAAKuF,MAAM4gF,OACU,iBAA1BrsE,EAAK9Z,KAAKuF,MAAM4gF,QAG3B0Q,EAAiB/8E,EAAK9Z,KAAKuF,MAAM4gF,cAIpB0Q,GACb,IAAK,WACHC,EAAcD,EAAe72F,KAAMgI,GACnC,MACF,IAAK,SACH8uF,EAAcd,EAAea,EAAgB72F,KAAMgI,GACnD,MACF,IAAK,SAGH,cAAe6uF,EAAevqF,EAAKvL,SACjC,IAAK,WACH+1F,EAAcD,EAAevqF,EAAKvL,QAAQf,KAAMgI,GAChD,MACF,IAAK,SACH8uF,EACEd,EAAea,EAAevqF,EAAKvL,QAASf,KAAMgI,IAK5D,YAA2B,IAAhB8uF,EACFA,EAGFd,EXxMkB,0CWwMch2F,KAAMgI,EAC/C,CAMAs+E,aAAAA,GACE,OAAOtmF,KAAKqG,KAAO,IAAMrG,KAAKuF,IAChC,EAGF,OAFCuwF,EAlaKO,EAAY5P,GAAZ4P,EAAY,OAgCF9wF,IAAIkhF,GAhCd4P,EAAY,uBA4Oa,SAAU9wF,GACrC,MAAM,IAAI8Q,MAAM,sBAAwB9Q,EAC1C,IAACkhF,GA9OG4P,EAAY,YAmTE,SAAUnrE,GAC1B,OAAO,IAAImrE,EAAanrE,EAAKpjB,GAAIojB,EAAK5e,KACxC,IA+GK+pF,CAAY,GAClB,CAAElrE,SAAS,EAAM/I,QAAQ,ICtftB7c,GAAO,QAsBAwxF,GAA8Bp3F,GAAQ4F,GArB9B,CACnB,QACA,UACA,SACA,eACA,YACA,iBACA,YACA,kBACA,eACA,yBACA,eACA,YACA,aACA,eACA,kBACA,YACA,iBACA,eAGqElC,IAmBjE,IAnBkE,MACtE4C,EAAK,QACLivC,EAAO,OACPxvB,EAAM,aACNyhE,EAAY,UACZM,EAAS,eACTU,EAAc,UACdkC,EAAS,gBACThC,EAAe,aACf0I,EAAY,uBACZ3I,EAAsB,aACtBiO,EAAY,UACZ9E,EAAS,WACTM,EAAU,aACVyB,EAAY,gBACZkB,EAAe,UACf5L,EAAS,eACTD,EAAc,WACdgN,GACDtyF,EAyCC,MAAMka,EAAQtX,EAAMV,GAAM,CACxBkoC,OAAQ,SAAUupD,GAChB,OAAOC,EAAWD,EAAY,CAAC,EACjC,EACA,iBAAkB,SAAUE,GAC1B,OAAOC,EAAcD,EAAa,CAAC,EACrC,EACA,iBAAkB,SAAUF,EAAYhvF,GAGtC,OAAOivF,EAAWD,OAFmB1zF,IAAlB0E,EAAQq5D,MAAsBr5D,EAAQq5D,MAAQ,CAAC,EAGpE,EACA,yBAA0B81B,IAG5B,SAASA,EAAeD,GAA2B,IAAdlvF,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC9C,MAAM20F,OAA+B9zF,IAAlB0E,EAAQq5D,MAAsBr5D,EAAQq5D,MAAQ,CAAC,EAGlE,OAAOt7B,GAAQmxD,GAAa,SAAUx0D,GACpC,GAAoB,iBAATA,EAAmB,MAAM,IAAIh8B,UAAU,mBAElD,OAAOuwF,EAAWv0D,EAAM00D,EAC1B,GACF,CAGA,MAAMC,EAAY,CAChBC,KAAM,EACNC,UAAW,EACXC,OAAQ,EACRC,OAAQ,EACRC,QAAS,GAILC,EAAa,CACjB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAM,EACN,KAAK,EAEL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EAEN,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EAEN,MAAM,EACN,MAAM,EACN,OAAO,GAIHC,EAAmB,CACvB/jE,KAAK,EACL/c,IAAI,EACJk3D,IAAI,EACJmhB,KAAK,EACLC,KAAK,EACLC,IAAI,EACJn0B,KAAK,GAGD28B,EAAY,CAChB3J,MAAM,EACNC,OAAO,EACPr8C,KAAM,KACNxuC,kBAGIw0F,EAAoB,CACxB,MACA,YAGIC,EAAoB,CACxB,IAAK,IACL,IAAK,IACL,KAAM,KACN,IAAK,IACLr+E,EAAG,KACHxY,EAAG,KACHmD,EAAG,KACH0X,EAAG,KACHxb,EAAG,MAyBL,SAASy3F,EAAe12F,EAAOP,GAC7B,OAAOO,EAAM01F,WAAW9oC,OAAO5sD,EAAM6C,MAAOpD,EAC9C,CASA,SAASk3F,EAAkB32F,GACzB,OAAO02F,EAAc12F,EAAO,EAC9B,CAQA,SAAShB,EAAMgB,GACbA,EAAM6C,OACR,CAOA,SAAS+zF,EAAe52F,GACtB,OAAOA,EAAM01F,WAAWhpE,OAAO1sB,EAAM6C,MAAQ,EAC/C,CAOA,SAASg0F,EAAe72F,GACtB,OAAOA,EAAM01F,WAAWhpE,OAAO1sB,EAAM6C,MAAQ,EAC/C,CAOA,SAASi0F,EAAU92F,GAMjB,IALAA,EAAM+2F,UAAYhB,EAAUC,KAC5Bh2F,EAAMg3F,MAAQ,GACdh3F,EAAMi3F,QAAU,KAGH,CAEX,GAAgC,MAA5BN,EAAiB32F,GACnB,KAAmC,OAA5B22F,EAAiB32F,IACW,KAA5B22F,EAAiB32F,IACtBA,EAAMi3F,SAAWN,EAAiB32F,GAClChB,EAAKgB,GAIT,IAAIic,EAAMi7E,aAAaP,EAAiB32F,GAAQA,EAAMm3F,cAGpD,MAFAn4F,EAAKgB,EAIT,CAGA,GAAgC,KAA5B22F,EAAiB32F,GAGnB,YADAA,EAAM+2F,UAAYhB,EAAUE,WAK9B,GAAgC,OAA5BU,EAAiB32F,KAAoBA,EAAMm3F,aAI7C,OAHAn3F,EAAM+2F,UAAYhB,EAAUE,UAC5Bj2F,EAAMg3F,MAAQL,EAAiB32F,QAC/BhB,EAAKgB,GAIP,MAAMivC,EAAK0nD,EAAiB32F,GACtBo3F,EAAKV,EAAc12F,EAAO,GAC1Bq3F,EAAKX,EAAc12F,EAAO,GAChC,GAAkB,IAAdq3F,EAAG53F,QAAgB42F,EAAWgB,GAMhC,OALAr3F,EAAM+2F,UAAYhB,EAAUE,UAC5Bj2F,EAAMg3F,MAAQK,EACdr4F,EAAKgB,GACLhB,EAAKgB,QACLhB,EAAKgB,GAKP,GAAkB,IAAdo3F,EAAG33F,QAAgB42F,EAAWe,GAKhC,OAJAp3F,EAAM+2F,UAAYhB,EAAUE,UAC5Bj2F,EAAMg3F,MAAQI,EACdp4F,EAAKgB,QACLhB,EAAKgB,GAKP,GAAIq2F,EAAWpnD,GAIb,OAHAjvC,EAAM+2F,UAAYhB,EAAUE,UAC5Bj2F,EAAMg3F,MAAQ/nD,OACdjwC,EAAKgB,GAKP,GAAIic,EAAM0lD,WAAW1yB,GAArB,CACEjvC,EAAM+2F,UAAYhB,EAAUG,OAG5B,MAAMkB,EAAKV,EAAc12F,EAAO,GAChC,GAAW,OAAPo3F,GAAsB,OAAPA,GAAsB,OAAPA,EAAa,CAK7C,IAJAp3F,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GACLA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GACEic,EAAMq7E,WAAWX,EAAiB32F,KACvCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAEP,GAAgC,MAA5B22F,EAAiB32F,GAKnB,IAHAA,EAAMg3F,OAAS,IACfh4F,EAAKgB,GAEEic,EAAMq7E,WAAWX,EAAiB32F,KACvCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,QAEF,GAAgC,MAA5B22F,EAAiB32F,GAK1B,IAHAA,EAAMg3F,OAAS,IACfh4F,EAAKgB,GAEEic,EAAMulD,QAAQm1B,EAAiB32F,KACpCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAGT,MACF,CAGA,GAAgC,MAA5B22F,EAAiB32F,IAInB,GAHAA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,IAEAic,EAAMulD,QAAQm1B,EAAiB32F,IAGlC,YADAA,EAAM+2F,UAAYhB,EAAUE,eAGzB,CACL,KAAOh6E,EAAMulD,QAAQm1B,EAAiB32F,KACpCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAEHic,EAAMs7E,cAAcZ,EAAiB32F,GAAQ62F,EAAc72F,MAC7DA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAET,CAEA,KAAOic,EAAMulD,QAAQm1B,EAAiB32F,KACpCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAGP,GAAgC,MAA5B22F,EAAiB32F,IAA8C,MAA5B22F,EAAiB32F,GACtD,GAAIic,EAAMulD,QAAQq1B,EAAc72F,KAAoC,MAAzB62F,EAAc72F,IAA2C,MAAzB62F,EAAc72F,GAAgB,CASvG,GARAA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAE2B,MAA5B22F,EAAiB32F,IAA8C,MAA5B22F,EAAiB32F,KACtDA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,KAGFic,EAAMulD,QAAQm1B,EAAiB32F,IAClC,MAAMw3F,GAAkBx3F,EAAO,wBAA0B22F,EAAiB32F,GAAS,KAGrF,KAAOic,EAAMulD,QAAQm1B,EAAiB32F,KACpCA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAGP,GAAIic,EAAMs7E,cAAcZ,EAAiB32F,GAAQ62F,EAAc72F,IAC7D,MAAMw3F,GAAkBx3F,EAAO,wBAA0B22F,EAAiB32F,GAAS,IAEvF,MAAO,GAAIic,EAAMs7E,cAAcV,EAAc72F,GAAQA,EAAM01F,WAAWhpE,OAAO1sB,EAAM6C,MAAQ,IAEzF,MADA7D,EAAKgB,GACCw3F,GAAkBx3F,EAAO,wBAA0B22F,EAAiB32F,GAAS,IAKzF,KA3FA,CA8FA,IAAIic,EAAMw7E,QAAQd,EAAiB32F,GAAQ42F,EAAc52F,GAAQ62F,EAAc72F,IAA/E,CAiBA,IADAA,EAAM+2F,UAAYhB,EAAUK,QACO,KAA5BO,EAAiB32F,IACtBA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAEP,MAAMw3F,GAAkBx3F,EAAO,yBAA2BA,EAAMg3F,MAAQ,IARxE,CAZE,KAAO/6E,EAAMw7E,QAAQd,EAAiB32F,GAAQ42F,EAAc52F,GAAQ62F,EAAc72F,KAAWic,EAAMulD,QAAQm1B,EAAiB32F,KAC1HA,EAAMg3F,OAASL,EAAiB32F,GAChChB,EAAKgB,GAGHuB,GAAe+0F,EAAkBt2F,EAAMg3F,OACzCh3F,EAAM+2F,UAAYhB,EAAUE,UAE5Bj2F,EAAM+2F,UAAYhB,EAAUI,MAZhC,CAyBF,CAKA,SAASuB,EAAqB13F,GAC5B,GACE82F,EAAS92F,SAEY,OAAhBA,EAAMg3F,MACf,CAMA,SAASW,EAAY33F,GACnBA,EAAMm3F,cACR,CAMA,SAASS,EAAa53F,GACpBA,EAAMm3F,cACR,CAgHA,SAASxB,EAAYD,EAAYI,GAC/B,MAAM91F,EAvYC,CACL81F,WAAY,CAAC,EACbJ,WAAY,GACZuB,QAAS,GACTp0F,MAAO,EACPm0F,MAAO,GACPD,UAAWhB,EAAUC,KACrBmB,aAAc,EACdU,iBAAkB,MAgYpB92F,GAAcf,EAAO,CAAE01F,aAAYI,eACnCgB,EAAS92F,GAET,MAAMqhB,EAyBR,SAAqBrhB,GACnB,IAAIqhB,EACJ,MAAM2nE,EAAS,GACf,IAAIE,EAUJ,IARoB,KAAhBlpF,EAAMg3F,OAAgC,OAAhBh3F,EAAMg3F,OAAkC,MAAhBh3F,EAAMg3F,QACtD31E,EAAOy2E,EAAgB93F,GACnBA,EAAMi3F,UACR51E,EAAK41E,QAAUj3F,EAAMi3F,UAKF,OAAhBj3F,EAAMg3F,OAAkC,MAAhBh3F,EAAMg3F,OACb,IAAlBhO,EAAOvpF,QAAgB4hB,IACzB6nE,EAA2B,MAAhBlpF,EAAMg3F,MACjBhO,EAAOtoF,KAAK,CAAE2gB,OAAM6nE,aAGtB4N,EAAS92F,GACW,OAAhBA,EAAMg3F,OAAkC,MAAhBh3F,EAAMg3F,OAAiC,KAAhBh3F,EAAMg3F,QACvD31E,EAAOy2E,EAAgB93F,GACnBA,EAAMi3F,UACR51E,EAAK41E,QAAUj3F,EAAMi3F,SAGvB/N,EAA2B,MAAhBlpF,EAAMg3F,MACjBhO,EAAOtoF,KAAK,CAAE2gB,OAAM6nE,aAIxB,OAAIF,EAAOvpF,OAAS,EACX,IAAIspF,EAAUC,IAEhB3nE,IACHA,EAAO,IAAIouE,OAAaztF,GACpBhC,EAAMi3F,UACR51E,EAAK41E,QAAUj3F,EAAMi3F,UAIlB51E,EAEX,CApEe02E,CAAW/3F,GAIxB,GAAoB,KAAhBA,EAAMg3F,MACR,MAAIh3F,EAAM+2F,YAAchB,EAAUE,UAI1B5qF,GAAYrL,EAAO,uBAAyBA,EAAMg3F,OAElDQ,GAAkBx3F,EAAO,oBAAsBA,EAAMg3F,MAAQ,KAIvE,OAAO31E,CACT,CA8DA,SAASy2E,EAAiB93F,GACxB,IAAIiE,EAAM+G,EAAM9E,EAAO8xF,EAEvB,MAAM32E,EAmDR,SAA2BrhB,GACzB,IAAIqhB,EAiCN,SAAyBrhB,GACvB,IAAIqhB,EAAO42E,EAAgBj4F,GAE3B,KAAuB,OAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,KAAM,KAAM,CAAC3wE,EAAM42E,EAAgBj4F,KAG7D,OAAOqhB,CACT,CA1Ca62E,CAAel4F,GAE1B,KAAuB,MAAhBA,EAAMg3F,OAAe,CAG1B,MAAMr+D,EAAO34B,EAAM63F,iBACnB73F,EAAM63F,iBAAmB73F,EAAMm3F,aAC/BO,EAAoB13F,GAEpB,MAAMspF,EAAYjoE,EACZkoE,EAAWuO,EAAgB93F,GAEjC,GAAoB,MAAhBA,EAAMg3F,MAAe,MAAMQ,GAAkBx3F,EAAO,iDAExDA,EAAM63F,iBAAmB,KACzBH,EAAoB13F,GAEpB,MAAMwpF,EAAYsO,EAAgB93F,GAElCqhB,EAAO,IAAI0lE,EAAgBuC,EAAWC,EAAUC,GAGhDxpF,EAAM63F,iBAAmBl/D,CAC3B,CAEA,OAAOtX,CACT,CA9Ee82E,CAAiBn4F,GAE9B,GAAoB,MAAhBA,EAAMg3F,MAAe,CACvB,GAAIh1E,GAAaX,GAKf,OAHApd,EAAOod,EAAKpd,KACZyzF,EAAoB13F,GACpBkG,EAAQ4xF,EAAgB93F,GACjB,IAAI6mF,EAAe,IAAIwN,EAAWpwF,GAAOiC,GAC3C,GAAI2a,EAAeQ,GAIxB,OAFAq2E,EAAoB13F,GACpBkG,EAAQ4xF,EAAgB93F,GACjB,IAAI6mF,EAAexlE,EAAK5D,OAAQ4D,EAAKxe,MAAOqD,GAC9C,GAAIwb,EAAeL,IAASW,GAAaX,EAAK7a,MAEnDwxF,GAAQ,EACRhtF,EAAO,GAEP/G,EAAOod,EAAKpd,KACZod,EAAKrW,KAAKpI,SAAQ,SAAU8L,EAAK7L,GAC3Bmf,GAAatT,GACf1D,EAAKnI,GAAS6L,EAAIzK,KAElB+zF,GAAQ,CAEZ,IAEIA,GAGF,OAFAN,EAAoB13F,GACpBkG,EAAQ4xF,EAAgB93F,GACjB,IAAI8mF,EAAuB7iF,EAAM+G,EAAM9E,GAIlD,MAAMsxF,GAAkBx3F,EAAO,kDACjC,CAEA,OAAOqhB,CACT,CA8DA,SAAS42E,EAAiBj4F,GACxB,IAAIqhB,EAAO+2E,EAAgBp4F,GAE3B,KAAuB,QAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,MAAO,MAAO,CAAC3wE,EAAM+2E,EAAgBp4F,KAG/D,OAAOqhB,CACT,CAOA,SAAS+2E,EAAiBp4F,GACxB,IAAIqhB,EAAOg3E,EAAer4F,GAE1B,KAAuB,QAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,MAAO,MAAO,CAAC3wE,EAAMg3E,EAAer4F,KAG9D,OAAOqhB,CACT,CAOA,SAASg3E,EAAgBr4F,GACvB,IAAIqhB,EAAOi3E,EAAgBt4F,GAE3B,KAAuB,MAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,IAAK,QAAS,CAAC3wE,EAAMi3E,EAAgBt4F,KAG/D,OAAOqhB,CACT,CAOA,SAASi3E,EAAiBt4F,GACxB,IAAIqhB,EAAOk3E,EAAgBv4F,GAE3B,KAAuB,OAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,KAAM,SAAU,CAAC3wE,EAAMk3E,EAAgBv4F,KAGjE,OAAOqhB,CACT,CAOA,SAASk3E,EAAiBv4F,GACxB,IAAIqhB,EAAOm3E,EAAgBx4F,GAE3B,KAAuB,MAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,IAAK,SAAU,CAAC3wE,EAAMm3E,EAAgBx4F,KAGhE,OAAOqhB,CACT,CAMA,SAASm3E,EAAiBx4F,GACxB,MAAM4G,EAAS,CAAC6xF,EAAWz4F,IACrB6zF,EAAe,GAEf6E,EAAY,CAChB,KAAM,QACN,KAAM,UACN,IAAK,UACL,IAAK,SACL,KAAM,YACN,KAAM,YAGR,KAAOn3F,GAAem3F,EAAW14F,EAAMg3F,QAAQ,CAC7C,MAAM2B,EAAO,CAAE10F,KAAMjE,EAAMg3F,MAAOxwF,GAAIkyF,EAAU14F,EAAMg3F,QACtDnD,EAAanzF,KAAKi4F,GAClBjB,EAAoB13F,GACpB4G,EAAOlG,KAAK+3F,EAAWz4F,GACzB,CAEA,OAAsB,IAAlB4G,EAAOnH,OACFmH,EAAO,GACa,IAAlBA,EAAOnH,OACT,IAAIuyF,EAAa6B,EAAa,GAAG5vF,KAAM4vF,EAAa,GAAGrtF,GAAII,GAE3D,IAAIygF,EAAewM,EAAazrF,KAAIhF,GAAKA,EAAEoD,KAAKI,EAE3D,CAOA,SAAS6xF,EAAYz4F,GACnB,IAAIqhB,EAAMpd,EAAMuC,EAAII,EAEpBya,EAAOu3E,EAAgB54F,GAEvB,MAAM04F,EAAY,CAChB,KAAM,YACN,KAAM,kBACN,MAAO,iBAGT,KAAOn3F,GAAem3F,EAAW14F,EAAMg3F,QACrC/yF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GAEfyzF,EAAoB13F,GACpB4G,EAAS,CAACya,EAAMu3E,EAAgB54F,IAChCqhB,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAII,GAGpC,OAAOya,CACT,CAOA,SAASu3E,EAAiB54F,GACxB,IAAIqhB,EAAMpd,EAAMuC,EAAII,EAEpBya,EAAOw3E,EAAW74F,GAElB,MAAM04F,EAAY,CAChBljF,GAAI,KACJk3D,GAAI,MAGN,KAAOnrE,GAAem3F,EAAW14F,EAAMg3F,QACrC/yF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GAEfyzF,EAAoB13F,GAEP,OAATiE,GAAiB,QAAQsd,SAASvhB,EAAMg3F,OAE1C31E,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAAC3wE,EAAM,IAAIgzE,EAAW,QAAQ,IAGvEztF,EAAS,CAACya,EAAMw3E,EAAW74F,IAC3BqhB,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAII,IAItC,OAAOya,CACT,CAOA,SAASw3E,EAAY74F,GACnB,IAAIqhB,EACJ,MAAMza,EAAS,GAUf,GANEya,EAFkB,MAAhBrhB,EAAMg3F,MAED,IAAIvH,EAAa,GAGjBqJ,EAAiB94F,GAGN,MAAhBA,EAAMg3F,OAAkBh3F,EAAM63F,mBAAqB73F,EAAMm3F,aAAe,CAK1E,IAHAvwF,EAAOlG,KAAK2gB,GAGW,MAAhBrhB,EAAMg3F,OAAiBpwF,EAAOnH,OAAS,GAC5Ci4F,EAAoB13F,GAEA,MAAhBA,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,OAAiC,KAAhBh3F,EAAMg3F,MAE7EpwF,EAAOlG,KAAK,IAAI2zF,EAAW,QAG3BztF,EAAOlG,KAAKo4F,EAAiB94F,IAM/BqhB,EAFoB,IAAlBza,EAAOnH,OAEF,IAAI6nF,EAAU1gF,EAAO,GAAIA,EAAO,GAAIA,EAAO,IAG3C,IAAI0gF,EAAU1gF,EAAO,GAAIA,EAAO,GAE3C,CAEA,OAAOya,CACT,CAOA,SAASy3E,EAAkB94F,GACzB,IAAIqhB,EAAMpd,EAAMuC,EAAII,EAEpBya,EAAO03E,EAAqC/4F,GAE5C,MAAM04F,EAAY,CAChB,IAAK,MACL,IAAK,YAEP,KAAOn3F,GAAem3F,EAAW14F,EAAMg3F,QAAQ,CAC7C/yF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GAEfyzF,EAAoB13F,GACpB,MAAMg5F,EAAYD,EAAqC/4F,GAErD4G,EADEoyF,EAAU/G,aACH,CAAC5wE,EAAM,IAAI2wE,EAAa,IAAK,WAAY,CAAC3wE,EAAM23E,KAEhD,CAAC33E,EAAM23E,GAElB33E,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAII,EACpC,CAEA,OAAOya,CACT,CAOA,SAAS03E,EAAsC/4F,GAC7C,IAAIqhB,EAAM/W,EAAMrG,EAAMuC,EAEtB6a,EAAO43E,GAA4Bj5F,GACnCsK,EAAO+W,EAEP,MAAMq3E,EAAY,CAChB,IAAK,WACL,KAAM,cACN,IAAK,SACL,KAAM,YACN,IAAK,MACLnmE,IAAK,OAGP,KACMhxB,GAAem3F,EAAW14F,EAAMg3F,QAOlC,GALA/yF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GAEfyzF,EAAoB13F,GAEP,MAATiE,GAAgBjE,EAAM+2F,YAAchB,EAAUE,WAA6B,MAAhBj2F,EAAMg3F,MAEnE,GAAoB,KAAhBh3F,EAAMg3F,OAAgB0B,EAAU14F,EAAMg3F,OAAQ,CAChD,MAAMt4B,EAAO,IAAIszB,EAAa,IAAK,SAAU,CAAC3wE,EAAM,IAAIouE,EAAa,OAAO,GAAO,GACnFxrF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GACfyzF,EAAoB13F,GACpBsK,EAAO2uF,GAA4Bj5F,GAEnCqhB,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAI,CAACk4D,EAAMp0D,GAC3C,MAAS+W,EAAO,IAAI2wE,EAAa,IAAK,SAAU,CAAC3wE,EAAM,IAAIouE,EAAa,OAAO,GAAO,QAGtFnlF,EAAO2uF,GAA4Bj5F,GACnCqhB,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAI,CAAC6a,EAAM/W,IAO/C,OAAO+W,CACT,CAOA,SAAS43E,GAA6Bj5F,GACpC,IAAIqhB,EAAM/W,EAKV,IAHA+W,EAAO63E,GAAWl5F,GAClBsK,EAAO+W,EAGArhB,EAAM+2F,YAAchB,EAAUI,QACd,OAAhBn2F,EAAMg3F,OAAkB71E,EAAeE,IACvB,OAAhBrhB,EAAMg3F,OAAkB11E,EAAeD,IAAqB,eAAZA,EAAK7a,IAAuB2a,EAAeE,EAAKrW,KAAK,OACrGhL,EAAM+2F,YAAchB,EAAUG,QAC1B/0E,EAAe7W,IACdgX,EAAehX,IAAqB,MAAZA,EAAKkX,KAClB,MAAhBxhB,EAAMg3F,OAMT1sF,EAAO4uF,GAAWl5F,GAClBqhB,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAAC3wE,EAAM/W,IAAO,GAM3D,OAAO+W,CACT,CAWA,SAAS63E,GAAYl5F,GACnB,IAAIqhB,EAAO83E,GAAWn5F,GAClBsK,EAAO+W,EACX,MAAM+3E,EAAc,GAEpB,KAEsB,MAAhBp5F,EAAMg3F,OAAiB51E,EAAU9W,IAF1B,CAQT,GAJA8uF,EAAY14F,KAAKK,GAAc,CAAC,EAAGf,IACnC03F,EAAoB13F,GAGhBA,EAAM+2F,YAAchB,EAAUG,OAmB3B,CAELn1F,GAAcf,EAAOo5F,EAAY3xE,OACjC,KACF,CAjBE,GAJA2xE,EAAY14F,KAAKK,GAAc,CAAC,EAAGf,IACnC03F,EAAoB13F,GAGhBA,EAAM+2F,YAAchB,EAAUI,QAA0B,MAAhBn2F,EAAMg3F,OAAiC,OAAhBh3F,EAAMg3F,MAOlE,CAELoC,EAAY3xE,MACZ1mB,GAAcf,EAAOo5F,EAAY3xE,OACjC,KACF,CATE1mB,GAAcf,EAAOo5F,EAAY3xE,OACjC2xE,EAAY3xE,MACZnd,EAAO6uF,GAAWn5F,GAClBqhB,EAAO,IAAI2wE,EAAa,IAAK,SAAU,CAAC3wE,EAAM/W,GAetD,CAEA,OAAO+W,CACT,CAOA,SAAS83E,GAAYn5F,GACnB,IAAIiE,EAAM2C,EAAQJ,EAClB,MAAMkyF,EAAY,CAChB,IAAK,aACL,IAAK,YACL,IAAK,SACL9+B,IAAK,OAGP,OAAIr4D,GAAem3F,EAAW14F,EAAMg3F,QAClCxwF,EAAKkyF,EAAU14F,EAAMg3F,OACrB/yF,EAAOjE,EAAMg3F,MAEbU,EAAoB13F,GACpB4G,EAAS,CAACuyF,GAAWn5F,IAEd,IAAIgyF,EAAa/tF,EAAMuC,EAAII,IAYtC,SAAmB5G,GACjB,IAAIqhB,EAAMpd,EAAMuC,EAAII,EAapB,OAXAya,EAmBF,SAAiCrhB,GAC/B,IAAIqhB,EAAOg4E,GAAuBr5F,GAElC,KAAuB,OAAhBA,EAAMg3F,OACXU,EAAoB13F,GACpBqhB,EAAO,IAAI2wE,EAAa,KAAM,UAAW,CAAC3wE,EAAMg4E,GAAuBr5F,KAGzE,OAAOqhB,CACT,CA5BSi4E,CAAuBt5F,IAEV,MAAhBA,EAAMg3F,OAAiC,OAAhBh3F,EAAMg3F,SAC/B/yF,EAAOjE,EAAMg3F,MACbxwF,EAAe,MAATvC,EAAgB,MAAQ,SAE9ByzF,EAAoB13F,GACpB4G,EAAS,CAACya,EAAM83E,GAAWn5F,IAC3BqhB,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAII,IAG7Bya,CACT,CAxBSk4E,CAASv5F,EAClB,CA8CA,SAASq5F,GAAwBr5F,GAC/B,IAAIqhB,EAAMpd,EAAMuC,EAAII,EAEpBya,EAiDF,SAA2BrhB,GACzB,IAAI4G,EAAS,GAEb,GAAI5G,EAAM+2F,YAAchB,EAAUI,QAAU50F,GAAevB,EAAM81F,WAAY91F,EAAMg3F,OAAQ,CACzF,MAAMwC,EAAax5F,EAAM81F,WAAW91F,EAAMg3F,OAK1C,GAHAF,EAAS92F,GAGW,MAAhBA,EAAMg3F,MAAe,CAMvB,GALApwF,EAAS,GAET+wF,EAAW33F,GACX82F,EAAS92F,GAEW,MAAhBA,EAAMg3F,MAIR,IAHApwF,EAAOlG,KAAKo3F,EAAgB93F,IAGL,MAAhBA,EAAMg3F,OACXF,EAAS92F,GACT4G,EAAOlG,KAAKo3F,EAAgB93F,IAIhC,GAAoB,MAAhBA,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,0BAEjC43F,EAAY53F,GACZ82F,EAAS92F,EACX,CAIA,OAAO,IAAIw5F,EAAW5yF,EACxB,CAEA,OAQF,SAAsB5G,GACpB,IAAIqhB,EAAMpd,EAEV,OAAIjE,EAAM+2F,YAAchB,EAAUI,QAC7Bn2F,EAAM+2F,YAAchB,EAAUE,WAAaj2F,EAAMg3F,SAASV,GAC7DryF,EAAOjE,EAAMg3F,MAEbF,EAAS92F,GAGPqhB,EADE9f,GAAeg1F,EAAWtyF,GACrB,IAAIwrF,EAAa8G,EAAUtyF,IACzBuyF,EAAkBj1E,SAAStd,GAC7B,IAAIwrF,EAAa77C,EAAQ3vC,EAAM,WAE/B,IAAIowF,EAAWpwF,GAIxBod,EAAOo4E,GAAez5F,EAAOqhB,GACtBA,GAwGX,SAAsBrhB,GACpB,IAAIqhB,EAAMvf,EAEV,MAAoB,MAAhB9B,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,OAC/Bl1F,EAAM43F,GAAiB15F,EAAOA,EAAMg3F,OAGpC31E,EAAO,IAAIouE,EAAa3tF,GAGxBuf,EAAOo4E,GAAez5F,EAAOqhB,GAEtBA,GA0DX,SAAsBrhB,GACpB,IAAIkpB,EAAOtiB,EAAQiiC,EAAMqd,EAEzB,GAAoB,MAAhBlmD,EAAMg3F,MAAe,CAKvB,GAHAW,EAAW33F,GACX82F,EAAS92F,GAEW,MAAhBA,EAAMg3F,MAAe,CAEvB,MAAMluD,EAAM6wD,GAAS35F,GAErB,GAAoB,MAAhBA,EAAMg3F,MAAe,CAMvB,IAJAnuD,EAAO,EACPjiC,EAAS,CAACkiC,GAGa,MAAhB9oC,EAAMg3F,OACXF,EAAS92F,GAEW,MAAhBA,EAAMg3F,QACRpwF,EAAOiiC,GAAQ8wD,GAAS35F,GACxB6oC,KAIJ,GAAoB,MAAhB7oC,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,4BAEjC43F,EAAY53F,GACZ82F,EAAS92F,GAGTkmD,EAAOt/C,EAAO,GAAGw/E,MAAM3mF,OACvB,IAAK,IAAIgb,EAAI,EAAGA,EAAIouB,EAAMpuB,IACxB,GAAI7T,EAAO6T,GAAG2rE,MAAM3mF,SAAWymD,EAC7B,MAAM76C,GAAYrL,EAAO,+BACf4G,EAAO6T,GAAG2rE,MAAM3mF,OAAS,QAAUymD,EAAO,KAIxDh9B,EAAQ,IAAIi9D,EAAUv/E,EACxB,KAAO,CAEL,GAAoB,MAAhB5G,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,4BAEjC43F,EAAY53F,GACZ82F,EAAS92F,GAETkpB,EAAQ4f,CACV,CACF,MAEE8uD,EAAY53F,GACZ82F,EAAS92F,GACTkpB,EAAQ,IAAIi9D,EAAU,IAGxB,OAAOsT,GAAez5F,EAAOkpB,EAC/B,CAEA,OA6BF,SAAsBlpB,GACpB,GAAoB,MAAhBA,EAAMg3F,MAAe,CAEvB,IAAI31F,EADJs2F,EAAW33F,GAGX,MAAMujB,EAAa,CAAC,EACpB,GAGE,GAFAuzE,EAAS92F,GAEW,MAAhBA,EAAMg3F,MAAe,CAEvB,GAAoB,MAAhBh3F,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,MAC/B31F,EAAMq4F,GAAiB15F,EAAOA,EAAMg3F,WAC/B,MAAIh3F,EAAM+2F,YAAchB,EAAUI,QAAWn2F,EAAM+2F,YAAchB,EAAUE,WAAaj2F,EAAMg3F,SAASV,GAI5G,MAAMkB,GAAkBx3F,EAAO,2CAH/BqB,EAAMrB,EAAMg3F,MACZF,EAAS92F,EAGX,CAGA,GAAoB,MAAhBA,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,qCAEjC82F,EAAS92F,GAGTujB,EAAWliB,GAAOy2F,EAAgB93F,EACpC,QAEqB,MAAhBA,EAAMg3F,OAEb,GAAoB,MAAhBh3F,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,oDAEjC43F,EAAY53F,GACZ82F,EAAS92F,GAET,IAAIqhB,EAAO,IAAIkvE,EAAWhtE,GAK1B,OAFAlC,EAAOo4E,GAAez5F,EAAOqhB,GAEtBA,CACT,CAEA,OAQF,SAAsBrhB,GACpB,IAAImkB,EAEJ,GAAInkB,EAAM+2F,YAAchB,EAAUG,OAAQ,CAExC/xE,EAAYnkB,EAAMg3F,MAClBF,EAAS92F,GAET,MAAM45F,EAAc11E,GAAeC,EAAWC,GACxCle,EAAQ0tC,EAAQzvB,EAAWy1E,GAEjC,OAAO,IAAInK,EAAavpF,EAC1B,CAEA,OAQF,SAA2BlG,GACzB,IAAIqhB,EAGJ,GAAoB,MAAhBrhB,EAAMg3F,MAAe,CAOvB,GALAW,EAAW33F,GACX82F,EAAS92F,GAETqhB,EAAOy2E,EAAgB93F,GAEH,MAAhBA,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,0BAOjC,OALA43F,EAAY53F,GACZ82F,EAAS92F,GAETqhB,EAAO,IAAI6xE,EAAgB7xE,GAC3BA,EAAOo4E,GAAez5F,EAAOqhB,GACtBA,CACT,CAEA,OAQF,SAAmBrhB,GACjB,KAAoB,KAAhBA,EAAMg3F,MAEFQ,GAAkBx3F,EAAO,gCAEzBw3F,GAAkBx3F,EAAO,iBAEnC,CAfS65F,CAAS75F,EAClB,CA/BS85F,CAAiB95F,EAC1B,CAvBS0hE,CAAY1hE,EACrB,CA5ES+5F,CAAY/5F,EACrB,CAvHSg6F,CAAYh6F,EACrB,CArHSi6F,CAAYj6F,EACrB,CA/BSk6F,CAAYl6F,EACrB,CAvFSm6F,CAAiBn6F,GAExB,MAAM04F,EAAY,CAChB,IAAK,YACL,IAAM,cAGR,KAAOn3F,GAAem3F,EAAW14F,EAAMg3F,QACrC/yF,EAAOjE,EAAMg3F,MACbxwF,EAAKkyF,EAAUz0F,GAEf6yF,EAAS92F,GACT4G,EAAS,CAACya,GAEVA,EAAO,IAAI2wE,EAAa/tF,EAAMuC,EAAII,GAClCya,EAAOo4E,GAAez5F,EAAOqhB,GAG/B,OAAOA,CACT,CAkHA,SAASo4E,GAAgBz5F,EAAOqhB,EAAM/b,GACpC,IAAIsB,EAEJ,MAAwB,MAAhB5G,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,UACtD1xF,GAASA,EAAMic,SAASvhB,EAAMg3F,SAGlC,GAFApwF,EAAS,GAEW,MAAhB5G,EAAMg3F,MAAe,CACvB,IAAIh1E,GAAaX,KAASR,EAAeQ,GA0BvC,OAAOA,EArBP,GAHAs2E,EAAW33F,GACX82F,EAAS92F,GAEW,MAAhBA,EAAMg3F,MAIR,IAHApwF,EAAOlG,KAAKo3F,EAAgB93F,IAGL,MAAhBA,EAAMg3F,OACXF,EAAS92F,GACT4G,EAAOlG,KAAKo3F,EAAgB93F,IAIhC,GAAoB,MAAhBA,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,0BAEjC43F,EAAY53F,GACZ82F,EAAS92F,GAETqhB,EAAO,IAAI0zE,EAAa1zE,EAAMza,EAOlC,MAAO,GAAoB,MAAhB5G,EAAMg3F,MAAe,CAK9B,GAHAW,EAAW33F,GACX82F,EAAS92F,GAEW,MAAhBA,EAAMg3F,MAIR,IAHApwF,EAAOlG,KAAKo3F,EAAgB93F,IAGL,MAAhBA,EAAMg3F,OACXF,EAAS92F,GACT4G,EAAOlG,KAAKo3F,EAAgB93F,IAIhC,GAAoB,MAAhBA,EAAMg3F,MACR,MAAMQ,GAAkBx3F,EAAO,0BAEjC43F,EAAY53F,GACZ82F,EAAS92F,GAETqhB,EAAO,IAAIwkE,EAAaxkE,EAAM,IAAI4uE,EAAUrpF,GAC9C,KAAO,CAML,GAJAkwF,EAAS92F,KAEcA,EAAM+2F,YAAchB,EAAUI,QAClDn2F,EAAM+2F,YAAchB,EAAUE,WAAaj2F,EAAMg3F,SAASV,GAE3D,MAAMkB,GAAkBx3F,EAAO,oCAGjC4G,EAAOlG,KAAK,IAAI+uF,EAAazvF,EAAMg3F,QACnCF,EAAS92F,GAGTqhB,EAAO,IAAIwkE,EAAaxkE,EAAM,IAAI4uE,EAAUrpF,GADxB,GAEtB,CAGF,OAAOya,CACT,CA+BA,SAASq4E,GAAkB15F,EAAOo6F,GAChC,IAAIt4F,EAAM,GAEV,KAAmC,KAA5B60F,EAAiB32F,IAAiB22F,EAAiB32F,KAAWo6F,GACnE,GAAgC,OAA5BzD,EAAiB32F,GAAiB,CACpChB,EAAKgB,GAEL,MAAMq6F,EAAO1D,EAAiB32F,GACxBs6F,EAAa7D,EAAkB4D,GACrC,QAAmBr4F,IAAfs4F,EAEFx4F,GAAOw4F,EACPt6F,EAAM6C,OAAS,MACV,IAAa,MAATw3F,EAUT,MAAM7C,GAAkBx3F,EAAO,0BAA0Bq6F,KAVlC,CAEvB,MAAME,EAAUv6F,EAAM01F,WAAW90F,MAAMZ,EAAM6C,MAAQ,EAAG7C,EAAM6C,MAAQ,GACtE,IAAI,mBAAmBqB,KAAKq2F,GAI1B,MAAM/C,GAAkBx3F,EAAO,gCAAgCu6F,KAH/Dz4F,GAAOQ,OAAOyY,aAAaiB,SAASu+E,EAAS,KAC7Cv6F,EAAM6C,OAAS,CAInB,CAEA,CACF,MAEEf,GAAO60F,EAAiB32F,GACxBhB,EAAKgB,GAKT,GADA82F,EAAS92F,GACLA,EAAMg3F,QAAUoD,EAClB,MAAM5C,GAAkBx3F,EAAO,iBAAiBo6F,cAIlD,OAFAtD,EAAS92F,GAEF8B,CACT,CA6EA,SAAS63F,GAAU35F,GACjB,MAAM4G,EAAS,CAACkxF,EAAgB93F,IAChC,IAAIgY,EAAM,EAEV,KAAuB,MAAhBhY,EAAMg3F,OACXF,EAAS92F,GAGW,MAAhBA,EAAMg3F,OAAiC,MAAhBh3F,EAAMg3F,QAC/BpwF,EAAOoR,GAAO8/E,EAAgB93F,GAC9BgY,KAIJ,OAAO,IAAImuE,EAAUv/E,EACvB,CA0IA,SAASoiC,GAAKhpC,GACZ,OAAOA,EAAM6C,MAAQ7C,EAAMg3F,MAAMv3F,OAAS,CAC5C,CASA,SAAS+3F,GAAmBx3F,EAAOiF,GACjC,MAAM7B,EAAI4lC,GAAIhpC,GACRusD,EAAQ,IAAIniD,YAAYnF,EAAU,UAAY7B,EAAI,KAGxD,OAFAmpD,EAAM8tC,KAAOj3F,EAENmpD,CACT,CASA,SAASlhD,GAAarL,EAAOiF,GAC3B,MAAM7B,EAAI4lC,GAAIhpC,GACRusD,EAAQ,IAAIniD,YAAYnF,EAAU,UAAY7B,EAAI,KAGxD,OAFAmpD,EAAM8tC,KAAOj3F,EAENmpD,CACT,CAKA,OAvwCAtwC,EAAMw7E,QAAU,SAAkBr0F,EAAGo3F,EAAOC,GAC1C,OAAOx+E,EAAMy+E,oBAAoBt3F,IAC7B6Y,EAAM0+E,kBAAkBv3F,EAAGq3F,IAC3Bx+E,EAAM0+E,kBAAkBH,EAAOp3F,EACrC,EAOA6Y,EAAMy+E,oBAAsB,SAA8Bt3F,GACxD,MAAO,sDAAsDc,KAAKd,EACpE,EAiBA6Y,EAAM0+E,kBAAoB,SAA4BC,EAAMC,GAC1D,MAAO,aAAa32F,KAAK02F,IACrB,oBAAoB12F,KAAK22F,IACzB,2KAA2K32F,KAAK22F,EACtL,EAQA5+E,EAAMi7E,aAAe,SAAuB9zF,EAAG+zF,GAE7C,MAAa,MAAN/zF,GAAmB,OAANA,GAAoB,MAANA,GAAyB,OAANA,GAAc+zF,EAAe,CACpF,EASAl7E,EAAMs7E,cAAgB,SAAwBn0F,EAAGq3F,GAC/C,MAAa,MAANr3F,GAAuB,MAAVq3F,GAA2B,MAAVA,GAA2B,MAAVA,CACxD,EAOAx+E,EAAM0lD,WAAa,SAAqBv+D,GACtC,OAASA,GAAK,KAAOA,GAAK,KAAc,MAANA,CACpC,EAOA6Y,EAAMulD,QAAU,SAAkBp+D,GAChC,OAAQA,GAAK,KAAOA,GAAK,GAC3B,EAOA6Y,EAAMq7E,WAAa,SAAqBl0F,GACtC,OAASA,GAAK,KAAOA,GAAK,KACjBA,GAAK,KAAOA,GAAK,KACjBA,GAAK,KAAOA,GAAK,GAC5B,EAgrCAuB,EAAM4R,cAAc,CAAE5M,KAAM,SAAU6L,GAAI,OAAQ/G,QAASwN,IAEpDA,CAAK,IC1vDRhY,GAAO,UAGA62F,GAAgCz8F,GAAQ4F,GAFhC,CAAC,QAAS,UAE0ClC,IAAsB,IAArB,MAAE4C,EAAK,MAAEsX,GAAOla,EAmCxF,OAAO4C,EAAMV,GAAM,CACjBkoC,OAAQ,SAAUy3C,GAChB,OAAO3nE,EAAM2nE,GAAMD,SACrB,EAEA,iBAAkB,SAAUC,GAC1B,OAAOn/C,GAAQm/C,GAAM,SAAU3gD,GAC7B,OAAOhnB,EAAMgnB,GAAO0gD,SACtB,GACF,GACA,IC/CE1/E,GAAO,WAGA82F,GAAiC18F,GAAQ4F,GAFjC,CAAC,QAAS,UAE2ClC,IAAsB,IAArB,MAAE4C,EAAK,MAAEsX,GAAOla,EAsCzF,OAAO4C,EAAMV,GAAM,CACjBkoC,OAAQ,SAAUy3C,GAChB,MAAMvgE,EAAQrE,IACd,OAAO/C,EAAM2nE,GAAMD,UAAUD,SAASrgE,EACxC,EAEA,uBAAwB,SAAUugE,EAAMvgE,GACtC,OAAOpH,EAAM2nE,GAAMD,UAAUD,SAASrgE,EACxC,EAEA,iBAAkB,SAAUugE,GAC1B,MAAMvgE,EAAQrE,IACd,OAAOylB,GAAQm/C,GAAM,SAAU3gD,GAC7B,OAAOhnB,EAAMgnB,GAAO0gD,UAAUD,SAASrgE,EACzC,GACF,EAEA,+BAAgC,SAAUugE,EAAMvgE,GAC9C,OAAOohB,GAAQm/C,GAAM,SAAU3gD,GAC7B,OAAOhnB,EAAMgnB,GAAO0gD,UAAUD,SAASrgE,EACzC,GACF,GACA,IC5DS23E,GAAoC38F,GAHpC,SACQ,CAAC,WAAY,UAE2C0D,IAAyB,IAAxB,SAAE2hF,EAAQ,MAAEznE,GAAOla,EAiD/F,SAASk5F,IACP,KAAMv8F,gBAAgBu8F,GACpB,MAAM,IAAI7wF,YACR,oDAGJpJ,OAAOwT,eAAe9V,KAAM,QAAS,CACnCwH,MAAO8Y,IACPsmE,UAAU,GAEd,CA6HA,OAxHA2V,EAAO35F,UAAUyD,KAAO,SACxBk2F,EAAO35F,UAAU45F,UAAW,EAS5BD,EAAO35F,UAAUoiF,SAAW,SAAUE,GAEpC,OAAOF,EAASE,EAAMllF,KAAK2kB,MAC7B,EAQA43E,EAAO35F,UAAU0D,IAAM,SAAUf,GAE/B,GAAIvF,KAAK2kB,MAAM3d,IAAIzB,GACjB,OAAOvF,KAAK2kB,MAAMre,IAAIf,EAE1B,EAMAg3F,EAAO35F,UAAU65F,OAAS,WACxB,OpR4FG,SAAmB/yF,GACxB,GAAIA,aAAegW,EACjB,OAAOhW,EAAIiW,cAEb,MAAMZ,EAAS,CAAC,EAChB,IAAK,MAAMpc,KAAO+G,EAAI3F,OAEpBmb,EAAgBH,EAAQpc,EADV+G,EAAIpD,IAAI3D,IAGxB,OAAOoc,CACT,CoRtGW29E,CAAS18F,KAAK2kB,MACvB,EAMA43E,EAAO35F,UAAU+5F,YAAc,WAC7B,OAAO38F,KAAK2kB,KACd,EAwBA43E,EAAO35F,UAAUqE,IAAM,SAAU1B,EAAMiC,GACrC,IAvBF,SAA8BjC,GAC5B,GAAoB,IAAhBA,EAAKxE,OAAgB,OAAO,EAEhC,IAAK,IAAIe,EAAI,EAAGA,EAAIyD,EAAKxE,OAAQe,IAAK,CACpC,MAAMg6F,EAAQv2F,EAAKyoB,OAAOlsB,EAAI,GACxB4C,EAAIa,EAAKyoB,OAAOlsB,GAChBi6F,EAAQx2F,EAAKyoB,OAAOlsB,EAAI,GAG9B,KAFcyb,EAAMw7E,QAAQr0F,EAAGo3F,EAAOC,IAAWj6F,EAAI,GAAKyb,EAAMulD,QAAQp+D,IAGtE,OAAO,CAEX,CAEA,OAAO,CACT,CAQOk4F,CAAoBr3F,GACvB,MAAM,IAAI8Q,MAAM,2BAA2B9Q,uDAG7C,OADAvF,KAAK2kB,MAAM1d,IAAI1B,EAAMiC,GACdA,CACT,EAMA+0F,EAAO35F,UAAUi+D,OAAS,SAAUt7D,GAClCvF,KAAK2kB,MAAM3E,OAAOza,EACpB,EAKAg3F,EAAO35F,UAAUyE,MAAQ,WACvBrH,KAAK2kB,MAAMtd,OACb,EAEAk1F,EAAO35F,UAAUmoB,OAAS,WACxB,MAAMG,EAAO,CACXF,OAAQ,SACR6xE,UAAW,CAAC,EACZC,UAAW,CAAC,GAGd,IAAK,MAAOv3F,EAAMiC,KAAUxH,KAAK2kB,MAC/B,GAAI/C,EAAWpa,GAAQ,CACrB,IAAKu1F,GAAqBv1F,GACxB,MAAM,IAAI6O,MAAM,sCAAsC9Q,KAGxD2lB,EAAK4xE,UAAUv3F,GAAQ,GAAGiC,EAAMu5B,YAAYv5B,EAAM09E,MACpD,MACEh6D,EAAK2xE,UAAUt3F,GAAQiC,EAI3B,OAAO0jB,CACT,EAEAqxE,EAAOtxE,SAAW,SAAUC,GAC1B,MAAM8xE,EAAS,IAAIT,EAKnB,OAHAj6F,OAAOud,QAAQqL,EAAK2xE,WAAW34F,SAAQmqC,IAAA,IAAE9oC,EAAMiC,GAAM6mC,EAAA,OAAK2uD,EAAO/1F,IAAI1B,EAAMiC,EAAM,IACjFlF,OAAOud,QAAQqL,EAAK4xE,WAAW54F,SAAQ+4F,IAAA,IAAEnwF,EAAOhF,GAAGm1F,EAAA,OAAKD,EAAOhY,SAASl9E,EAAG,IAEpEk1F,CACT,EAEOT,CAAM,GACZ,CAAEpxE,SAAS,IAEd,SAAS4xE,GAAsBv1F,GAC7B,MAAwB,mBAAVA,GACY,iBAAjBA,EAAMu5B,QACS,iBAAfv5B,EAAM09E,IACjB,CCpMA,MAAM3/E,GAAO,SAGA23F,GAA+Bv9F,GAAQ4F,GAF/B,CAAC,QAAS,WAEyClC,IAAuB,IAAtB,MAAE4C,EAAK,OAAEs2F,GAAQl5F,EA4CxF,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,OAAO,IAAIg3F,CACb,GACA,ICjCSY,GAA4Bx9F,GAjB5B,MACQ,CACnB,QACA,SACA,MACA,YACA,eACA,iBACA,iBACA,SACA,cACA,aACA,cACA,eACA,QAGmE0D,IAgBhE,IAfH,MACE4C,EAAK,OACLykB,EAAM,IACN9C,EAAG,UACHk2B,EAAS,aACTmR,EAAY,eACZlR,EAAc,eACdgD,EAAc,OACd6J,EAAM,YACNhd,EAAW,WACX+H,EAAU,YACV1rB,EAAW,aACXqkB,EAAY,IACZ0yB,GACD39D,EA4BD,OAAO4C,EA5DI,MA4DQ,CAEjBgkB,YAAa,SAAU8F,GACrB,OAAOqtE,EAAUrtE,EACnB,EAEAue,aAAc,SAAUve,GACtB,OA4KJ,SAAqBA,GAEnB,MAAMoa,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAElB59B,EAAIiJ,KAAKC,IAAI48B,EAAME,GAEnBvqB,EAASiQ,EAAEmc,QACX/nC,EAAQ4rB,EAAEqc,OACVqC,EAAM1e,EAAEuc,KAER+wD,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAACrzD,EAAM9lC,GAEfo5F,EAAU,GACVC,EAAS,GACTC,EAAO,GACPC,EAAQ,CAACv5F,EAAGgmC,GAElB,IAAIvoC,EAAGC,EAAGjB,EAEV,MAAM+8F,EAAO,GACPC,EAAO,GACb,IAAKh8F,EAAI,EAAGA,EAAIqoC,EAAMroC,IACpB+7F,EAAK/7F,GAAKA,EACVg8F,EAAKh8F,GAAKA,EAGZ,MAAMi8F,EAAc,SAAUv9F,EAAGC,GAE/B,MAAMswC,EAAK+sD,EAAKt9F,GACVwwC,EAAK8sD,EAAKr9F,GAEhBo9F,EAAK9sD,GAAMtwC,EACXo9F,EAAK7sD,GAAMxwC,EAEXs9F,EAAKt9F,GAAKwwC,EACV8sD,EAAKr9F,GAAKswC,CACZ,EAEA,IAAKhvC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5B,MAAMi8F,EAAM,IAAIh9B,EAEZj/D,EAAIooC,IAENozD,EAAKv7F,KAAKq7F,EAAQt8F,QAElBs8F,EAAQr7F,KAAK,GACbs7F,EAAOt7F,KAAKD,IAGd47F,EAAK37F,KAAKy7F,EAAQ18F,QAElB,MAAMwrC,EAAKkC,EAAI1sC,GACTyqC,EAAKiC,EAAI1sC,EAAI,GAEnB,IAAKjB,EAAIyrC,EAAIzrC,EAAI0rC,EAAI1rC,IAEnBgB,EAAIqC,EAAMrD,GAEVk9F,EAAI/2F,IAAI42F,EAAK/7F,GAAIge,EAAOhf,IAGtBiB,EAAI,GAENi8F,EAAI95F,QAAQ,EAAGnC,EAAI,GAAG,SAAUjB,EAAGm9F,GAEjC3vD,EAAawC,YAAYhwC,EAAGu8F,EAASC,EAAQC,GAAM,SAAUz7F,EAAGo8F,GAE1Dp8F,EAAIhB,GAENk9F,EAAI78B,WAAWr/D,EAAG6zC,EAAWoI,EAAemgD,EAAKD,IAErD,GACF,IAGF,IAAIrlE,EAAK72B,EACLq3D,EAAM4kC,EAAI13F,IAAIvE,GACdo8F,EAAQv2E,EAAIwxC,GAEhB4kC,EAAI95F,QAAQnC,EAAI,EAAGooC,EAAO,GAAG,SAAU3pC,EAAGI,GAExC,MAAMw9F,EAAOx2E,EAAIhnB,GAEbgqD,EAAOwzC,EAAMD,KAEfvlE,EAAKp4B,EAEL29F,EAAQC,EAERhlC,EAAMx4D,EAEV,IAEImB,IAAM62B,IAER0V,EAAa1D,UAAU7oC,EAAG62B,EAAI4kE,EAAM,GAAIH,EAASC,EAAQC,GAEzDjvD,EAAa1D,UAAU7oC,EAAG62B,EAAIglE,EAAM,GAAIH,EAASC,EAAQC,GAEzDK,EAAI18B,KAAKv/D,EAAG62B,GAEZmlE,EAAYh8F,EAAG62B,IAGjBolE,EAAI95F,QAAQ,EAAGimC,EAAO,GAAG,SAAU3pC,EAAGI,GAEhCJ,GAAKuB,GAEP07F,EAAQz7F,KAAKpB,GACb88F,EAAO17F,KAAKxB,KAGZI,EAAIquD,EAAaruD,EAAGw4D,GAEfxrB,EAAYhtC,EAAG,KAElBy8F,EAAQr7F,KAAKpB,GACb08F,EAAOt7F,KAAKxB,IAGlB,GACF,CAMA,OAJAm9F,EAAK37F,KAAKy7F,EAAQ18F,QAClBw8F,EAAKv7F,KAAKq7F,EAAQt8F,QAGX,CACLk5D,EAAG,IAAI3rB,EAAa,CAClBxuB,OAAQu9E,EACRl5F,MAAOm5F,EACP7uD,IAAK8uD,EACLt9E,KAAMu9E,IAERa,EAAG,IAAI/vD,EAAa,CAClBxuB,OAAQ29E,EACRt5F,MAAOu5F,EACPjvD,IAAKkvD,EACL19E,KAAM29E,IAERj0F,EAAGk0F,EACHjrF,SAAU,WACR,MAAO,MAAQ5S,KAAKi6D,EAAErnD,WAAa,QAAU5S,KAAKq+F,EAAEzrF,WAAa,QAAU5S,KAAK2J,CAClF,EAEJ,CAlUW20F,CAAWvuE,EACpB,EAEAtqB,MAAO,SAAUkU,GAEf,MAEMoC,EAAIqhF,EAFA1yE,EAAO/Q,IAIjB,MAAO,CACLsgD,EAAGl+C,EAAEk+C,EAAEz6C,UACP6+E,EAAGtiF,EAAEsiF,EAAE7+E,UACP7V,EAAGoS,EAAEpS,EAET,IAGF,SAASyzF,EAAWrtE,GAElB,MAAMoa,EAAOpa,EAAEkS,MAAM,GACfoI,EAAUta,EAAEkS,MAAM,GAExB,IAAI59B,EAAIiJ,KAAKC,IAAI48B,EAAME,GAEvB,MAAM9lC,EAAOkf,GAAMsM,EAAEyS,OAEf+7D,EAAQ,GACRf,EAAQ,CAACrzD,EAAM9lC,GAEfm6F,EAAQ,GACRZ,EAAQ,CAACv5F,EAAGgmC,GAElB,IAAIvoC,EAAGC,EAAGjB,EAEV,MAAM6I,EAAI,GACV,IAAK7H,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAO6H,EAAE7H,GAAKA,EAEpC,IAAKC,EAAI,EAAGA,EAAIsoC,EAAStoC,IAAK,CAE5B,GAAIA,EAAI,EAEN,IAAKD,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAK,CAEzB,MAAMyL,EAAMD,KAAKC,IAAIzL,EAAGC,GAExB,IAAIkI,EAAI,EAER,IAAKnJ,EAAI,EAAGA,EAAIyM,EAAKzM,IAEnBmJ,EAAI6zC,EAAU7zC,EAAG8zC,EAAex5C,EAAKzC,GAAGhB,GAAIyD,EAAKzD,GAAGiB,KAEtDwC,EAAKzC,GAAGC,GAAKg/C,EAAex8C,EAAKzC,GAAGC,GAAIkI,EAC1C,CAGF,IAAI2uB,EAAK72B,EACLo8F,EAAQ,EACR/kC,EAAM,EAEV,IAAKt3D,EAAIC,EAAGD,EAAIqoC,EAAMroC,IAAK,CAEzB,MAAMlB,EAAI2D,EAAKzC,GAAGC,GAEZq8F,EAAOx2E,EAAIhnB,GAEbgqD,EAAOwzC,EAAMD,KAEfvlE,EAAK92B,EAELq8F,EAAQC,EAERhlC,EAAMx4D,EAEV,CASA,GAPImB,IAAM62B,IAERjvB,EAAE5H,GAAK,CAAC4H,EAAEivB,GAAKjvB,EAAEivB,GAAMjvB,EAAE5H,IAAI,GAE7BkoB,EAAY2gB,UAAU7oC,EAAG62B,EAAIr0B,IAG3BxC,EAAIooC,EAEN,IAAKroC,EAAIC,EAAI,EAAGD,EAAIqoC,EAAMroC,IAAK,CAE7B,MAAM28F,EAAMl6F,EAAKzC,GAAGC,GACf6rC,EAAY6wD,EAAK,KAEpBl6F,EAAKzC,GAAGC,GAAKktD,EAAa1qD,EAAKzC,GAAGC,GAAIq3D,GAE1C,CAEJ,CAEA,IAAKr3D,EAAI,EAAGA,EAAIsoC,EAAStoC,IAEvB,IAAKD,EAAI,EAAGA,EAAIqoC,EAAMroC,IAEV,IAANC,IAEED,EAAIuoC,IAENm0D,EAAM18F,GAAK,IAGby8F,EAAMz8F,GAAK,IAGTA,EAAIC,GAEFD,EAAIuoC,IAENm0D,EAAM18F,GAAGC,GAAKwC,EAAKzC,GAAGC,IAGpBA,EAAIooC,IAENo0D,EAAMz8F,GAAGC,GAAK,IAKdD,IAAMC,GAcND,EAAIuoC,IAENm0D,EAAM18F,GAAGC,GAAK,GAGZA,EAAIooC,IAENo0D,EAAMz8F,GAAGC,GAAKwC,EAAKzC,GAAGC,MAnBlBD,EAAIuoC,IAENm0D,EAAM18F,GAAGC,GAAKwC,EAAKzC,GAAGC,IAGpBA,EAAIooC,IAENo0D,EAAMz8F,GAAGC,GAAK,IAiBtB,MAAM2kD,EAAI,IAAIz8B,EAAY,CACxB1lB,KAAMg6F,EACNt+E,KAAMu9E,IAGF7kE,EAAI,IAAI1O,EAAY,CACxB1lB,KAAMi6F,EACNv+E,KAAM29E,IAGFpuD,EAAK,GACX,IAAK1tC,EAAI,EAAGuC,EAAIsF,EAAE5I,OAAQe,EAAIuC,EAAGvC,IAAO0tC,EAAG7lC,EAAE7H,IAAMA,EAEnD,MAAO,CACLm4D,EAAGvT,EACH23C,EAAG1lE,EACHhvB,EAAG6lC,EACH58B,SAAU,WACR,MAAO,MAAQ5S,KAAKi6D,EAAErnD,WAAa,QAAU5S,KAAKq+F,EAAEzrF,WAAa,QAAU5S,KAAK2J,CAClF,EAEJ,CAwJA,ICnXW+0F,GAA2B/+F,GAnB3B,KACQ,CACnB,QACA,SACA,QACA,WACA,SACA,QACA,OACA,OACA,OACA,aACA,YACA,eACA,iBACA,iBACA,YAGkE0D,IAkB/D,IAjBH,MACE4C,EAAK,OACLykB,EAAM,MACNrC,EAAK,SACL6uC,EAAQ,OACR7nC,EAAM,MACN8xB,EAAK,KACLp7B,EAAI,KACJqD,EAAI,KACJylC,EAAI,WACJlZ,EAAU,UACVmI,EAAS,aACTmR,EAAY,eACZlR,EAAc,eACdgD,EAAc,QACdP,GACDn9C,EA6CD,OAAOhB,GAAc4D,EAjFV,KAiFsB,CAE/BgkB,YAAa,SAAU8F,GACrB,OAAO4uE,EAAS5uE,EAClB,EAEAue,aAAc,SAAUve,GACtB,OAyKJ,WACE,MAAM,IAAI1Z,MAAM,6CAClB,CA3KWuoF,EACT,EAEAn5F,MAAO,SAAUkU,GAEf,MAEMoC,EAAI4iF,EAFAj0E,EAAO/Q,IAIjB,MAAO,CACL45C,EAAGx3C,EAAEw3C,EAAE/zC,UACPipD,EAAG1sD,EAAE0sD,EAAEjpD,UAEX,IACE,CAAEq/E,iBAEN,SAASA,EAAc9uE,GAErB,MAAMoa,EAAOpa,EAAEkS,MAAM,GACfulB,EAAOz3B,EAAEkS,MAAM,GAEfsxB,EAAI2D,EAAS,CAAC/sB,GAAO,SACrB20D,EAAQvrC,EAAE/wB,MAEVimC,EAAI14C,EAAEtM,QACNs7E,EAAQt2B,EAAEjmC,MAGhB,IAAI1gC,EAAGC,EAAGjB,EAEV,MAAMH,EAAI0nB,EAAM,CAAC8hB,GAAO,IAExB,IAAKrpC,EAAI,EAAGA,EAAIwM,KAAKC,IAAIi6C,EAAMrd,KAASrpC,EAAG,CAyBzC,MAAM68D,EAAQohC,EAAMj+F,GAAGA,GACjBk+F,EAAMrpD,EAAWwL,EAAMwc,EAAO,GAAK,EAAI53C,EAAK43C,IAC5CshC,EAAUpwC,EAAKmwC,GAErB,IAAIE,EAAe,EAEnB,IAAKp9F,EAAIhB,EAAGgB,EAAIqoC,EAAMroC,IACpBo9F,EAAephD,EAAUohD,EAAcnhD,EAAeghD,EAAMj9F,GAAGhB,GAAI+tD,EAAKkwC,EAAMj9F,GAAGhB,MAGnF,MAAM0qF,EAAQztC,EAAeihD,EAAK51E,EAAK81E,IAEvC,IAAK7vE,EAAOm8D,GAAQ,CAElB,MAAM2T,EAAKp+C,EAAe4c,EAAO6tB,GAKjC,IAFA7qF,EAAEG,GAAK,EAEFgB,EAAIhB,EAAI,EAAGgB,EAAIqoC,EAAMroC,IACxBnB,EAAEmB,GAAKmtD,EAAa8vC,EAAMj9F,GAAGhB,GAAIq+F,GAInC,MAAMjwC,EAAMvZ,EAAWkZ,EAAKI,EAAakwC,EAAI3T,KAE7C,IAAIvhF,EAcJ,IAAKlI,EAAIjB,EAAGiB,EAAIylD,EAAMzlD,IAAK,CAIzB,IAHAkI,EAAI,EAGCnI,EAAIhB,EAAGgB,EAAIqoC,EAAMroC,IACpBmI,EAAI6zC,EAAU7zC,EAAG8zC,EAAe8Q,EAAKluD,EAAEmB,IAAKi9F,EAAMj9F,GAAGC,KAMvD,IAFAkI,EAAI8zC,EAAe9zC,EAAGilD,GAEjBptD,EAAIhB,EAAGgB,EAAIqoC,EAAMroC,IACpBi9F,EAAMj9F,GAAGC,GAAKg8C,EACZgD,EAAeg+C,EAAMj9F,GAAGC,GAAIg8C,EAAep9C,EAAEmB,GAAImI,IACjDg1F,EAGN,CAQA,IAAKn9F,EAAI,EAAGA,EAAIqoC,EAAMroC,IAAK,CAIzB,IAHAmI,EAAI,EAGClI,EAAIjB,EAAGiB,EAAIooC,EAAMpoC,IACpBkI,EAAI6zC,EAAU7zC,EAAG8zC,EAAe+gD,EAAMh9F,GAAGC,GAAIpB,EAAEoB,KAMjD,IAFAkI,EAAI8zC,EAAe9zC,EAAGilD,GAEjBntD,EAAIjB,EAAGiB,EAAIooC,IAAQpoC,EACtB+8F,EAAMh9F,GAAGC,GAAKktD,EACZlO,EAAe+9C,EAAMh9F,GAAGC,GAAIg8C,EAAe9zC,EAAG4kD,EAAKluD,EAAEoB,MACrDk9F,EAGN,CACF,CACF,CAGA,MAAO,CACL1rC,IACAkV,IACA71D,SAAU,WACR,MAAO,MAAQ5S,KAAKuzD,EAAE3gD,WAAa,QAAU5S,KAAKyoE,EAAE71D,UACtD,EAEJ,CAEA,SAAS+rF,EAAU5uE,GACjB,MAAMuL,EAAMujE,EAAa9uE,GACnBgvE,EAAQzjE,EAAImtC,EAAEjmC,MACpB,GAAIzS,EAAEyS,MAAMzhC,OAAS,EAAG,CACtB,MAAM2tC,EAA4B,YAArBqwD,EAAM,GAAG,GAAG14F,KAAqBm6C,EAAQ,GAAK,EAE3D,IAAK,IAAI1+C,EAAI,EAAGA,EAAIi9F,EAAMh+F,SAAUe,EAClC,IAAK,IAAIC,EAAI,EAAGA,EAAID,GAAKC,GAAKg9F,EAAM,IAAM,IAAIh+F,SAAUgB,EACtDg9F,EAAMj9F,GAAGC,GAAK2sC,CAGpB,CAEA,OAAOpT,CACT,CAIA,ICtPK,SAAS8jE,GAAQr9F,EAAGjB,EAAGH,EAAG0+F,EAAM/+F,EAAMg/F,EAAM/9D,GAEjD,IAAIqN,EAAM,EAIV,IAFAjuC,EAAE4gC,GAASx/B,EAEJ6sC,GAAO,GAAG,CAEf,MAAMjlC,EAAIhJ,EAAE4gC,EAAQqN,GAEd9sC,EAAInB,EAAE0+F,EAAO11F,IACR,IAAP7H,GAEF8sC,IAEA0wD,EAAKx+F,KAAO6I,IAGZhJ,EAAE0+F,EAAO11F,GAAKhJ,EAAEL,EAAOwB,KAErB8sC,EAEFjuC,EAAE4gC,EAAQqN,GAAO9sC,EAErB,CACA,OAAOhB,CACT,CChCO,SAASy+F,GAAQz9F,GAEtB,OAAQA,EAAI,CACd,CCJA,MAOa09F,GAA8B7/F,GAP9B,QACQ,CACnB,MACA,WACA,cAGqE0D,IAAkC,IAAjC,IAAE6H,EAAG,SAAE+sC,EAAQ,UAAE2W,GAAWvrD,EAUlG,OAAO,SAAgB66D,EAAOvkD,GAE5B,IAAKA,GAAKukD,GAAS,GAAKA,EAAQ,EAAK,OAAO,KAE5C,MAAM/nB,EAAQx8B,EAAEsoB,MAEVlS,EAAIomB,EAAM,GACV9xC,EAAI8xC,EAAM,GAEhB,IAAIspD,EAAQ,EAERC,EAAQpyF,KAAKI,IAAI,GAAI,GAAKJ,KAAK8b,KAAK/kB,IACxCq7F,EAAQpyF,KAAKC,IAAIlJ,EAAI,EAAGq7F,GAExB,MAAMC,EAyWR,SAA8BzhC,EAAOvkD,EAAGoW,EAAG1rB,EAAGq7F,GAE5C,MAAME,EAAKhxC,EAAUj1C,GAGrB,GAAc,IAAVukD,GAAe75D,IAAM0rB,EAEvB,OAAO7kB,EAAIyO,EAAGimF,GAIhB,GAAc,IAAV1hC,EAAa,CAEf,MAAM2hC,EAASD,EAAGxzD,OACZ0zD,EAAOF,EAAGtzD,KAEhB,IAAI3P,EAAK,EAET,IAAK,IAAI56B,EAAI,EAAGA,EAAIguB,EAAGhuB,IAAK,CAE1B,IAAI4H,EAAIm2F,EAAK/9F,GAIb,GAFA+9F,EAAK/9F,GAAK46B,IAENmjE,EAAK/9F,EAAI,GAAK4H,EAAI+1F,GAEtB,IAAK,MAAMhjE,EAAKojE,EAAK/9F,EAAI,GAAI4H,EAAI+yB,EAAI/yB,IAAOk2F,EAAOljE,KAAQkjE,EAAOl2F,EACpE,CAMA,OAJAm2F,EAAK/vE,GAAK4M,EAEVhjB,EAAIi1C,EAAUgxC,GAEP3nD,EAAS2nD,EAAIjmF,EACtB,CAGA,OAAOs+B,EAAS2nD,EAAIjmF,EACtB,CA/YaomF,CAAoB7hC,EAAOvkD,EAAGoW,EAAG1rB,EAAGq7F,ICtB5C,SAAkB/lF,EAAGpJ,GAE1B,MAAM07B,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KAGTjoC,EAFQsV,EAAEsoB,MAEA,GAEhB,IAAI+9D,EAAK,EAET,IAAK,IAAIj+F,EAAI,EAAGA,EAAIsC,EAAGtC,IAAK,CAE1B,IAAI4H,EAAI0iC,EAAKtqC,GAGb,IADAsqC,EAAKtqC,GAAKi+F,EACHr2F,EAAI0iC,EAAKtqC,EAAI,GAAI4H,IAElB4G,EAAS47B,EAAOxiC,GAAI5H,EAAGkqC,EAAUA,EAAQtiC,GAAK,EDMjC,QCJfwiC,EAAO6zD,GAAM7zD,EAAOxiC,GAEhBsiC,IAAWA,EAAQ+zD,GAAM/zD,EAAQtiC,IAErCq2F,IAGN,CAEA3zD,EAAKhoC,GAAK27F,EAEV7zD,EAAO9zB,OAAO2nF,EAAI7zD,EAAOprC,OAASi/F,GAE9B/zD,GAAWA,EAAQ5zB,OAAO2nF,EAAI/zD,EAAQlrC,OAASi/F,EAGrD,CDZIC,CAAQN,EAAIl5C,GAEZ,MAAM3a,EAAS6zD,EAAGvzD,OACZoK,EAAOmpD,EAAGrzD,KAGhB,IAAI4zD,EAAM1pD,EAAKnyC,GAGf,MAAM0oB,EAAI,GAGJu5C,EAAI,GAEJ65B,EAAK97F,EAAI,EACT/D,EAAO,GAAK+D,EAAI,GAChBg7F,EAAO,GAAKh7F,EAAI,GAChB+7F,EAAO,GAAK/7F,EAAI,GAChB67D,EAAS,GAAK77D,EAAI,GAClB1D,EAAI,GAAK0D,EAAI,GACbg8F,EAAQ,GAAKh8F,EAAI,GAGjBuH,EAAOmhB,EAGb,IASIjrB,EAAGC,EAAGjB,EAAG0rC,EAAI8zD,EAAItnF,EAAGunF,EAAIvuE,EAAIwuE,EAAKC,EAAIC,EAAKhkE,EAAIC,EAAIgkE,EAAIn8F,EAAG3D,EATzDgrC,EA6XN,SAAmCxnC,EAAGmyC,EAAM8vB,EAAGhtD,EAAK+lF,EAAMzzF,EAAMtL,EAAM+/F,EAAOF,EAAIx/F,EAAGy/F,EAAMlgC,GAExF,IAAK,IAAIp/D,EAAI,EAAGA,EAAIuD,EAAGvD,IAAOwlE,EA5YlB,EA4Y0BxlE,GAAK01C,EAAK11C,EAAI,GAAK01C,EAAK11C,GAC9DwlE,EA7YY,EA6YJjiE,GAAK,EAEb,IAAK,IAAIvC,EAAI,EAAGA,GAAKuC,EAAGvC,IAEtBwkE,EAAE+4B,EAAOv9F,IAAM,EACf8J,EAAK9J,IAAM,EACXwkE,EAAEhmE,EAAOwB,IAAM,EAEfwkE,EAAE+5B,EAAQv+F,IAAM,EAEhBwkE,EAAE65B,EAAKr+F,GAAK,EAEZwkE,EAAE3lE,EAAImB,GAAK,EAEXwkE,EAAE85B,EAAOt+F,GAAK,EAEdwkE,EAAEpG,EAASp+D,GAAKwkE,EA7ZN,EA6ZcxkE,GAG1B,MAAM+pC,EAAO+0D,EAAQ,EAAG,EAAGt6B,EAAG3lE,EAAG0D,GAQjC,OANAiiE,EAAE85B,EAAO/7F,IAAM,EAEfmyC,EAAKnyC,IAAM,EAEXiiE,EAAE3lE,EAAI0D,GAAK,EAEJwnC,CACT,CA5Zag1D,CAAyBx8F,EAAGmyC,EAAM8vB,EAbjC,EAayC+4B,EAAMzzF,EAAMtL,EAAM+/F,EAAOF,EAAIx/F,EAAGy/F,EAAMlgC,GAGvF4gC,EAgaN,SAAiCz8F,EAAGmyC,EAAM8vB,EAAGpG,EAAQkgC,EAAMz/F,EAAG++F,EAAOS,EAAId,EAAMzzF,EAAMtL,GAEnF,IAAIwgG,EAAM,EAEV,IAAK,IAAIh/F,EAAI,EAAGA,EAAIuC,EAAGvC,IAAK,CAE1B,MAAMjB,EAAIylE,EAAEpG,EAASp+D,GAErB,GAAU,IAANjB,EAEFylE,EAAE85B,EAAOt+F,IAAM,EACfg/F,IAEAtqD,EAAK10C,IAAM,EACXwkE,EAAE3lE,EAAImB,GAAK,OACN,GAAIjB,EAAI6+F,EAEbp5B,EAAE65B,EAAKr+F,GAAK,EAEZwkE,EAAE85B,EAAOt+F,IAAM,EACfg/F,IACAtqD,EAAK10C,GAAKy9F,GAAOl7F,GACjBiiE,EAAE65B,EAAK97F,SACF,CACL,MAAMG,EAAI8hE,EAAE+4B,EAAOx+F,IACR,IAAP2D,IAAYoH,EAAKpH,GAAK1C,GAE1BwkE,EAAEhmE,EAAOwB,GAAKwkE,EAAE+4B,EAAOx+F,GACvBylE,EAAE+4B,EAAOx+F,GAAKiB,CAChB,CACF,CACA,OAAOg/F,CACT,CAhcYC,CAAuB18F,EAAGmyC,EAAM8vB,EAAGpG,EAAQkgC,EAAMz/F,EAAG++F,EAAOS,EAAId,EAAMzzF,EAAMtL,GAGjF0gG,EAAS,EAMb,KAAOF,EAAMz8F,GAAG,CAId,IAAKvD,GAAK,EAAGkgG,EAAS38F,IAAiC,KAA3BvD,EAAIwlE,EAAE+4B,EAAO2B,IAAiBA,MACrC,IAAjB16B,EAAEhmE,EAAOQ,KAAa8K,EAAK06D,EAAEhmE,EAAOQ,KAAO,GAE/CwlE,EAAE+4B,EAAO2B,GAAU16B,EAAEhmE,EAAOQ,GAE5B,MAAMmgG,EAAQ36B,EAAE85B,EAAOt/F,GAEvB,IAAIogG,EAAM56B,EAAE65B,EAAKr/F,GAEjBggG,GAAOI,EAKP,IAAIC,EAAK,EAET76B,EAAE65B,EAAKr/F,IAAMogG,EACb,IAAIv3F,EAAI6sC,EAAK11C,GAEb,MAAMsgG,EAAiB,IAAVH,EAAet3F,EAAIu2F,EAChC,IAAImB,EAAMD,EACV,IAAK50D,EAAK,EAAGA,GAAMy0D,EAAQ,EAAGz0D,IAAM,CAelC,IAdIA,EAAKy0D,GAEPjoF,EAAIlY,EAEJy/F,EAAK52F,EAELqoB,EAAKs0C,EAzDC,EAyDOxlE,GAAKmgG,IAGlBjoF,EAAI8yB,EAAOniC,KACX42F,EAAK/pD,EAAKx9B,GAEVgZ,EAAKs0C,EA/DC,EA+DOttD,IAEVsnF,EAAK,EAAGA,GAAMtuE,EAAIsuE,IACrBx+F,EAAIgqC,EAAOy0D,MAENC,EAAMl6B,EAAE65B,EAAKr+F,KAAO,IAEzBq/F,GAAMX,EAENl6B,EAAE65B,EAAKr+F,IAAM0+F,EAEb10D,EAAOu1D,KAASv/F,GACK,IAAjBwkE,EAAEhmE,EAAOwB,KAAa8J,EAAK06D,EAAEhmE,EAAOwB,IAAM8J,EAAK9J,KAElC,IAAb8J,EAAK9J,GAAawkE,EAAEhmE,EAAOsL,EAAK9J,IAAMwkE,EAAEhmE,EAAOwB,GAAYwkE,EAAE+4B,EAAO/4B,EAAEpG,EAASp+D,IAAMwkE,EAAEhmE,EAAOwB,IAEhGkX,IAAMlY,IAER01C,EAAKx9B,GAAKumF,GAAOz+F,GAEjBwlE,EAAE3lE,EAAIqY,GAAK,EAEf,CAiBA,IAfc,IAAVioF,IAAef,EAAMmB,GAEzB/6B,EAAEpG,EAASp/D,GAAKqgG,EAEhB3qD,EAAK11C,GAAKsgG,EACV96B,EA5FU,EA4FFxlE,GAAKugG,EAAMD,EAEnB96B,EAAE85B,EAAOt/F,IAAM,EAMf+qC,EAAO+0D,EAAQ/0D,EAAM4zD,EAAOn5B,EAAG3lE,EAAG0D,GAE7Bo8F,EAAKW,EAAKX,EAAKY,EAAKZ,IAAM,CAG7B,GAFA3+F,EAAIgqC,EAAO20D,IAENC,EAAMp6B,EAAE85B,EAAOt+F,KAAO,EAAK,SAEhC0+F,GAAOl6B,EAAE65B,EAAKr+F,GACd,MAAMw/F,EAAOz1D,EAAO20D,EAEpB,IAAK72F,EAAI6sC,EAAK10C,GAAI46B,EAAK8Z,EAAK10C,GAAK4+F,EAAM,EAAG/2F,GAAK+yB,EAAI/yB,IACjDqP,EAAI8yB,EAAOniC,GACP28D,EAAE3lE,EAAIqY,IAAM6yB,EAEdy6B,EAAE3lE,EAAIqY,IAAMwnF,EACU,IAAbl6B,EAAE3lE,EAAIqY,KAEfstD,EAAE3lE,EAAIqY,GAAKstD,EAAEpG,EAASlnD,GAAKsoF,EAGjC,CAOA,IAAKb,EAAKW,EAAKX,EAAKY,EAAKZ,IAAM,CAO7B,IALA3+F,EAAIgqC,EAAO20D,GACX/jE,EAAK8Z,EAAK10C,GACV66B,EAAKD,EAAK4pC,EAAE85B,EAAOt+F,GAAK,EACxB6+F,EAAKjkE,EAEAl4B,EAAI,EAAG3D,EAAI,EAAG8I,EAAI+yB,EAAI/yB,GAAKgzB,EAAIhzB,IAGlC,GAFAqP,EAAI8yB,EAAOniC,GAEM,IAAb28D,EAAE3lE,EAAIqY,GAAU,CAElB,MAAMuoF,EAAOj7B,EAAE3lE,EAAIqY,GAAK6yB,EACpB01D,EAAO,GAET1gG,GAAK0gG,EAELz1D,EAAO60D,KAAQ3nF,EAEfxU,GAAKwU,IAGLw9B,EAAKx9B,GAAKumF,GAAOz+F,GAEjBwlE,EAAE3lE,EAAIqY,GAAK,EAEf,CAGFstD,EAAE85B,EAAOt+F,GAAK6+F,EAAKjkE,EAAK,EACxB,MAAM8kE,EAAKb,EACLc,EAAK/kE,EAAK4pC,EA9JR,EA8JgBxkE,GAExB,IAAK6H,EAAIgzB,EAAK,EAAGhzB,EAAI83F,EAAI93F,IAAK,CAC5B5H,EAAI+pC,EAAOniC,GAEX,MAAM+3F,EAAMp7B,EAAE65B,EAAKp+F,GACf2/F,GAAO,IAEX7gG,GAAK6gG,EAEL51D,EAAO60D,KAAQ5+F,EAEfyC,GAAKzC,EACP,CAEU,IAANlB,GAEF21C,EAAK10C,GAAKy9F,GAAOz+F,GACjB0/F,GAAOl6B,EAAE65B,EAAKr+F,GAEdq/F,GAAMX,EAENU,GAAOV,EACPM,GAAON,EACPl6B,EAAE65B,EAAKr+F,GAAK,EAEZwkE,EAAE85B,EAAOt+F,IAAM,IAGfwkE,EAAEpG,EAASp+D,GAAKwL,KAAKC,IAAI+4D,EAAEpG,EAASp+D,GAAIjB,GAExCirC,EAAO60D,GAAM70D,EAAO01D,GAEpB11D,EAAO01D,GAAM11D,EAAOpP,GAEpBoP,EAAOpP,GAAM57B,EAEbwlE,EAnMM,EAmMExkE,GAAK6+F,EAAKjkE,EAAK,EAEvBl4B,GAAKA,EAAI,GAAKA,EAAIA,GAAKH,EAEvBiiE,EAAEhmE,EAAOwB,GAAKwkE,EAAE+5B,EAAQ77F,GACxB8hE,EAAE+5B,EAAQ77F,GAAK1C,EAEf8J,EAAK9J,GAAK0C,EAEd,CASA,IAPA8hE,EAAEpG,EAASp/D,GAAKqgG,EAChB1B,EAAQnyF,KAAKI,IAAI+xF,EAAO0B,GAExBt1D,EAAO+0D,EAAQ/0D,EAAO4zD,EAAOA,EAAOn5B,EAAG3lE,EAAG0D,GAIrCo8F,EAAKW,EAAKX,EAAKY,EAAKZ,IAGvB,GAFA3+F,EAAIgqC,EAAO20D,KAEPn6B,EAAE65B,EAAKr+F,IAAM,GAMjB,IAJA0C,EAAIoH,EAAK9J,GACTA,EAAIwkE,EAAE+5B,EAAQ77F,GAEd8hE,EAAE+5B,EAAQ77F,IAAM,GACF,IAAP1C,IAA6B,IAAjBwkE,EAAEhmE,EAAOwB,GAAWA,EAAIwkE,EAAEhmE,EAAOwB,GAAI+pC,IAAQ,CAG9D,IAFA7Z,EAAKs0C,EA/NC,EA+NOxkE,GACb4+F,EAAMp6B,EAAE85B,EAAOt+F,GACV6H,EAAI6sC,EAAK10C,GAAK,EAAG6H,GAAK6sC,EAAK10C,GAAKkwB,EAAK,EAAGroB,IAAO28D,EAAE3lE,EAAImrC,EAAOniC,IAAMkiC,EACvE,IAAI81D,EAAQ7/F,EAEZ,IAAKC,EAAIukE,EAAEhmE,EAAOwB,IAAW,IAAPC,GAAW,CAC/B,IAAIgD,EAAKuhE,EArOL,EAqOavkE,KAAOiwB,GAAMs0C,EAAE85B,EAAOr+F,KAAO2+F,EAC9C,IAAK/2F,EAAI6sC,EAAKz0C,GAAK,EAAGgD,GAAM4E,GAAK6sC,EAAKz0C,GAAKiwB,EAAK,EAAGroB,IAE7C28D,EAAE3lE,EAAImrC,EAAOniC,MAAQkiC,IAAQ9mC,EAAK,GAGpCA,GAEFyxC,EAAKz0C,GAAKw9F,GAAOz9F,GACjBwkE,EAAE65B,EAAKr+F,IAAMwkE,EAAE65B,EAAKp+F,GACpBukE,EAAE65B,EAAKp+F,GAAK,EAEZukE,EAAE85B,EAAOr+F,IAAM,EAEfA,EAAIukE,EAAEhmE,EAAOyB,GACbukE,EAAEhmE,EAAOqhG,GAAS5/F,IAGlB4/F,EAAQ5/F,EACRA,EAAIukE,EAAEhmE,EAAOyB,GAEjB,CACF,CAKF,IAAK4H,EAAIy3F,EAAKX,EAAKW,EAAKX,EAAKY,EAAKZ,IAChC3+F,EAAIgqC,EAAO20D,IAEND,GAAOl6B,EAAE65B,EAAKr+F,KAAO,IAE1BwkE,EAAE65B,EAAKr+F,GAAK0+F,EAEZ3/F,EAAIylE,EAAEpG,EAASp+D,GAAKq/F,EAAKX,EACzB3/F,EAAIyM,KAAKC,IAAI1M,EAAGwD,EAAIy8F,EAAMN,IACL,IAAjBl6B,EAAE+4B,EAAOx+F,KAAa+K,EAAK06D,EAAE+4B,EAAOx+F,IAAMiB,GAE9CwkE,EAAEhmE,EAAOwB,GAAKwkE,EAAE+4B,EAAOx+F,GACvB+K,EAAK9J,IAAM,EACXwkE,EAAE+4B,EAAOx+F,GAAKiB,EAEdk/F,EAAS1zF,KAAKC,IAAIyzF,EAAQngG,GAC1BylE,EAAEpG,EAASp+D,GAAKjB,EAEhBirC,EAAOniC,KAAO7H,GAGhBwkE,EAAE65B,EAAKr/F,GAAKogG,EAEmB,IAA1B56B,EAvRK,EAuRGxlE,GAAK6I,EAAIy3F,KAEpB5qD,EAAK11C,IAAM,EAEXwlE,EAAE3lE,EAAIG,GAAK,GAEC,IAAVmgG,IAEFf,EAAMv2F,EAEV,CAQA,IAAK7H,EAAI,EAAGA,EAAIuC,EAAGvC,IAAO00C,EAAK10C,GAAKy9F,GAAO/oD,EAAK10C,IAChD,IAAKC,EAAI,EAAGA,GAAKsC,EAAGtC,IAAOukE,EAAE+4B,EAAOt9F,IAAM,EAE1C,IAAKA,EAAIsC,EAAGtC,GAAK,EAAGA,IAEdukE,EAAE65B,EAAKp+F,GAAK,IAEhBukE,EAAEhmE,EAAOyB,GAAKukE,EAAE+4B,EAAO7oD,EAAKz0C,IAC5BukE,EAAE+4B,EAAO7oD,EAAKz0C,IAAMA,GAGtB,IAAKiX,EAAI3U,EAAG2U,GAAK,EAAGA,IAEdstD,EAAE65B,EAAKnnF,IAAM,IACA,IAAbw9B,EAAKx9B,KAEPstD,EAAEhmE,EAAO0Y,GAAKstD,EAAE+4B,EAAO7oD,EAAKx9B,IAC5BstD,EAAE+4B,EAAO7oD,EAAKx9B,IAAMA,GAIxB,IAAKlY,EAAI,EAAGgB,EAAI,EAAGA,GAAKuC,EAAGvC,KACR,IAAb00C,EAAK10C,KAAahB,EAAIs+F,GAAOt9F,EAAGhB,EAAGwlE,EAAG+4B,EAAM/+F,EAAMysB,EAAGpsB,IAK3D,OAFAosB,EAAE1U,OAAO0U,EAAEhsB,OAAS,EAAG,GAEhBgsB,CACT,EA6IA,SAAS6zE,EAAS/0D,EAAM4zD,EAAOn5B,EAAG3lE,EAAG0D,GACnC,GAAIwnC,EAAO,GAAMA,EAAO4zD,EAAQ,EAAI,CAClC,IAAK,IAAI3+F,EAAI,EAAGA,EAAIuD,EAAGvD,IACJ,IAAbwlE,EAAE3lE,EAAIG,KAAYwlE,EAAE3lE,EAAIG,GAAK,GAEnC+qC,EAAO,CACT,CAEA,OAAOA,CACT,CAEA,SAAS4a,EAAO3kD,EAAGC,GACjB,OAAOD,IAAMC,CACf,KEngBK,SAAS6/F,GAAQ9/F,EAAGC,EAAGpB,EAAGioB,EAAOi5E,EAAUC,EAAUC,GAC1D,IAAI93F,EAAG+3F,EAIHluE,EADAmuE,EAAQ,EAIZ,GAAIngG,GAAKC,GAAKpB,EAAEioB,EAAQ7mB,IAAMpB,EAAEkhG,EAAW//F,GAAM,OAAS,EAE1DnB,EAAEkhG,EAAW//F,GAAKnB,EAAEioB,EAAQ7mB,GAE5B,MAAMmgG,EAAQvhG,EAAEmhG,EAAWhgG,GAI3B,GAHAnB,EAAEmhG,EAAWhgG,GAAKC,GAGH,IAAXmgG,EAEFD,EAAQ,EACRnuE,EAAIhyB,MACC,CAIL,IAFAmgG,EAAQ,EAEHnuE,EAAIouE,EAAOpuE,IAAMnzB,EAAEohG,EAAWjuE,GAAIA,EAAInzB,EAAEohG,EAAWjuE,IACxD,IAAK7pB,EAAIi4F,EAAOj4F,IAAM6pB,EAAG7pB,EAAI+3F,EAE3BA,EAAUrhG,EAAEohG,EAAW93F,GACvBtJ,EAAEohG,EAAW93F,GAAK6pB,CAEtB,CACA,MAAO,CAAEmuE,QAAOnuE,IAClB,CC5CA,MAKaquE,GAAiCxiG,GALjC,WACQ,CACnB,cAGwE0D,IAAmB,IAAlB,UAAEurD,GAAWvrD,EAWtF,OAAO,SAAUsW,EAAGomD,EAAQu/B,EAAM8C,GAEhC,IAAKzoF,IAAMomD,IAAWu/B,EAAQ,OAAO,KAErC,MAAMnpD,EAAQx8B,EAAEsoB,MAEVlS,EAAIomB,EAAM,GACV9xC,EAAI8xC,EAAM,GAEhB,IAAIr0C,EAAGC,EAAGjB,EAAGsqC,EAAGzhC,EAAG41C,EAAI7iB,EAGvB,MAAMzyB,EAAI,EAAI5F,GAAK+9F,EAAO/9F,EAAI0rB,EAAI,EAAK,GAEjCpvB,EAAI,GAEJkhG,EAAWx9F,EACXy9F,EAAW,EAAIz9F,EACfukB,EAAQ,EAAIvkB,EACZg7F,EAAO,EAAIh7F,EACX/D,EAAO,EAAI+D,EAAI,EAErB,IAAKvD,EAAI,EAAGA,EAAImJ,EAAGnJ,IAAOH,EAAEG,IAAM,EAGlC,MAAMuhG,EAAW,GAGXzC,EAAKhxC,EAAUj1C,GAEfkmF,EAASD,EAAGxzD,OACZ0zD,EAAOF,EAAGtzD,KAGhB,IAAKxrC,EAAI,EAAGA,EAAIuD,EAAGvD,IAIjB,IAHAiB,EAAIu9F,EAAKx+F,GAETuhG,EAAStgG,IAAwB,IAAlBpB,EAAEioB,EAAQ7mB,GAAa,EAAI,GAC5B,IAAPA,IAA8B,IAAlBpB,EAAEioB,EAAQ7mB,GAAWA,EAAIg+D,EAAOh+D,GAAMpB,EAAEioB,EAAQ7mB,GAAKjB,EAI1E,GAAIshG,EAAK,CAEP,IAAKthG,EAAI,EAAGA,EAAIuD,EAAGvD,IAAOH,EAAE2+F,EAAKx+F,IAAMA,EAEvC,IAAKgB,EAAI,EAAGA,EAAIiuB,EAAGjuB,IAAK,CAEtB,IAAKhB,EAAIuD,EAAGk7C,EAAKugD,EAAKh+F,GAAI46B,EAAKojE,EAAKh+F,EAAI,GAAI6H,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAO7I,EAAIwM,KAAKC,IAAIzM,EAAGH,EAAEk/F,EAAOl2F,KAE5FhJ,EAAEL,EAAOwB,GAAKnB,EAAE0+F,EAAOv+F,GACvBH,EAAE0+F,EAAOv+F,GAAKgB,CAChB,CACF,CAGA,IAAKA,EAAI,EAAGA,EAAIuC,EAAGvC,IAAOnB,EAzCT,EAyCsBmB,GAAKA,EAE5C,IAAKhB,EAAI,EAAGA,EAAIuD,EAAGvD,IAAK,CAOtB,IALAiB,EAAIu9F,EAAKx+F,IAEU,IAAfi/D,EAAOh+D,IAAasgG,EAAStiC,EAAOh+D,MAGnCqpC,EAAKg3D,EAAMzhG,EAAE0+F,EAAOv+F,GAAKiB,GAAW,IAAPqpC,EAAUA,EAAKg3D,EAAMzhG,EAAEL,EAAO8qC,IAAM,EACpE,IAAKzhC,EAAIm2F,EAAK10D,GAAIzhC,EAAIm2F,EAAK10D,EAAI,GAAIzhC,IAAK,CACtC7H,EAAI+9F,EAAOl2F,GACX,MAAMoS,EAAI6lF,GAAO9/F,EAAGC,EAAGpB,EAAGioB,EAAOi5E,EAAUC,EArDhC,GAuDP/lF,EAAEkmF,OAAS,GAAKI,EAAStgG,KAEb,IAAZga,EAAEkmF,OAAeI,EAAStmF,EAAE+X,IAClC,EAEiB,IAAfisC,EAAOh+D,KAAapB,EA5DT,EA4DsBoB,GAAKg+D,EAAOh+D,GACnD,CAEA,IAAKA,EAAI,EAAGA,EAAIsC,EAAGtC,KACE,IAAfg+D,EAAOh+D,KAAasgG,EAAStiC,EAAOh+D,KAAOsgG,EAAStgG,IAE1D,OAAOsgG,CACT,CAAC,ICvFUC,GAA8B3iG,GAP9B,QACQ,CACnB,MACA,WACA,cAGqE0D,IAAkC,IAAjC,IAAE6H,EAAG,SAAE+sC,EAAQ,UAAE2W,GAAWvrD,EAClG,MAAMk/F,EAAQ/C,GAAY,CAAEt0F,MAAK+sC,WAAU2W,cACrC4zC,EAAWL,GAAe,CAAEvzC,cAYlC,OAAO,SAAgBsP,EAAOvkD,EAAG8oF,GAE/B,MAAMp2D,EAAO1yB,EAAE2yB,KAGTjoC,EAFQsV,EAAEsoB,MAEA,GAEhB,IAAInhC,EAEJ,MAAMmJ,EAAI,CAAC,EAIX,GAFAA,EAAE6pB,EAAIyuE,EAAMrkC,EAAOvkD,GAEfukD,IAAUj0D,EAAE6pB,EAAK,OAAO,KAE5B,GAAI2uE,EAAI,CAEN,MAAM/9F,EAAIw5D,EClCT,SAAoBvkD,EAAGs2E,EAAMn8D,GAElC,MAAMmY,EAAUtyB,EAAEuyB,QACZC,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MACVmU,EAAMz8B,EAAE0uB,UAERtY,EAAIomB,EAAM,GACV9xC,EAAI8xC,EAAM,GAEVI,EAAqC,KACrCzK,EAAS,GACT0K,EAAO,GAEb,IAAIwpD,EAAK,EAET,IAAK,IAAIl/F,EAAI,EAAGA,EAAIuD,EAAGvD,IAAK,CAE1B01C,EAAK11C,GAAKk/F,EAEV,MAAMj+F,EAAI+xB,EAAKA,EAAEhzB,GAAMA,EAEvB,IAAK,IAAI2vD,EAAKpkB,EAAKtqC,GAAI6I,EAAKyhC,EAAKtqC,EAAI,GAAIxB,EAAIkwD,EAAIlwD,EAAIqK,EAAIrK,IAAK,CAE5D,MAAMwb,EAA6BowB,EAAO5rC,GAE1CurC,EAAOk0D,GAAMjkF,EAETw6B,IAAWA,EAAQypD,GAAM/zD,EAAQ1rC,IAErCy/F,GACF,CACF,CAIA,OAFAxpD,EAAKnyC,GAAK27F,EAEHrmF,EAAEs1B,mBAAmB,CAC1BnvB,OAAQy2B,EACRpyC,MAAO2nC,EACP2C,IAAK+H,EACLv2B,KAAM,CAAC8P,EAAG1rB,GACVu7B,SAAUwW,GAEd,CDVwBssD,CAAU/oF,EAAG,EAAM1P,EAAE6pB,GAAQna,EAE/C1P,EAAE81D,OEvCD,SAAkBpmD,GAEvB,IAAKA,EAAK,OAAO,KAEjB,MAAMwyB,EAASxyB,EAAEyyB,OACXC,EAAO1yB,EAAE2yB,KACT6J,EAAQx8B,EAAEsoB,MAEVlS,EAAIomB,EAAM,GACV9xC,EAAI8xC,EAAM,GAGV4pB,EAAS,GAGTp/D,EAAI,GAEJs5B,EAAO51B,EAEb,IAAIvC,EAAG6gG,EAKL,IAAK7gG,EAAI,EAAGA,EAAIiuB,EAAGjuB,IAAOnB,EAAEs5B,EAAOn4B,IAAM,EAG3C,IAAK,IAAIhB,EAAI,EAAGA,EAAIuD,EAAGvD,IAAK,CAE1Bi/D,EAAOj/D,IAAM,EAEbH,EAfe,EAeFG,IAAM,EAEnB,IAAK,IAAIy+C,EAAKlT,EAAKvrC,GAAI47B,EAAK2P,EAAKvrC,EAAI,GAAI6I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAK,CAE5D,MAAMoS,EAAIowB,EAAOxiC,GAIjB,IAFA7H,EAAWnB,EAAEs5B,EAAOle,IAEN,IAAPja,GAAYA,EAAIhB,EAAGgB,EAAI6gG,EAE5BA,EAAQhiG,EAzBG,EAyBUmB,GAErBnB,EA3BW,EA2BEmB,GAAKhB,GAEH,IAAX6hG,IAAgB5iC,EAAOj+D,GAAKhB,GAEvBH,EAAEs5B,EAAOle,GAAKjb,CAC3B,CACF,CACA,OAAOi/D,CACT,CFZiB6iC,CAAQl+F,GAEnB,MAAM46F,EGzCL,SAAiBv/B,EAAQ17D,GAE9B,IAAK07D,EAAU,OAAO,KAEtB,IACIh+D,EADAjB,EAAI,EAGR,MAAMw+F,EAAO,GAEP3+F,EAAI,GAEJL,EAAO+D,EACPk9B,EAAQ,EAAIl9B,EAElB,IAAKtC,EAAI,EAAGA,EAAIsC,EAAGtC,IAEjBpB,EANW,EAMFoB,IAAM,EAGjB,IAAKA,EAAIsC,EAAI,EAAGtC,GAAK,EAAGA,KAEH,IAAfg+D,EAAOh+D,KAEXpB,EAAEL,EAAOyB,GAAKpB,EAbH,EAaYo/D,EAAOh+D,IAC9BpB,EAdW,EAcFo/D,EAAOh+D,IAAMA,GAGxB,IAAKA,EAAI,EAAGA,EAAIsC,EAAGtC,KAEE,IAAfg+D,EAAOh+D,KAEXjB,EAAIs+F,GAAOr9F,EAAGjB,EAAGH,EArBN,EAqBeL,EAAMg/F,EAAM/9D,IAExC,OAAO+9D,CACT,CHOmBuD,CAAO54F,EAAE81D,OAAQ17D,GAI9B,GAFA4F,EAAEgtE,GAAKurB,EAAS99F,EAAGuF,EAAE81D,OAAQu/B,EAAM,GAE/B56F,GAAKuF,EAAE81D,QAAU91D,EAAEgtE,IAgB3B,SAAkBt9D,EAAG1P,GAEnB,MAAMoiC,EAAO1yB,EAAE2yB,KACTH,EAASxyB,EAAEyyB,OACX+J,EAAQx8B,EAAEsoB,MAEVlS,EAAIomB,EAAM,GACV9xC,EAAI8xC,EAAM,GAEhBlsC,EAAEgmF,KAAO,GACThmF,EAAE64F,SAAW,GAEb,MAAM/iC,EAAS91D,EAAE81D,OACXkwB,EAAOhmF,EAAEgmF,KACT6S,EAAW74F,EAAE64F,SAEbniG,EAAI,GAEJ0+F,EAAOtvE,EACPgzE,EAAOhzE,EAAI1rB,EACX2+F,EAAOjzE,EAAI,EAAI1rB,EAErB,IAAIvC,EAAGhB,EAAG6I,EAAG41C,EAAI7iB,EAEjB,IAAK57B,EAAI,EAAGA,EAAIuD,EAAGvD,IAEjBH,EAAE0+F,EAAOv+F,IAAM,EACfH,EAAEoiG,EAAOjiG,IAAM,EACfH,EAAEqiG,EAAOliG,GAAK,EAGhB,IAAKgB,EAAI,EAAGA,EAAIiuB,EAAGjuB,IAAOghG,EAAShhG,IAAM,EAEzC,IAAKhB,EAAIuD,EAAI,EAAGvD,GAAK,EAAGA,IAEtB,IAAKy+C,EAAKlT,EAAKvrC,GAAI47B,EAAK2P,EAAKvrC,EAAI,GAAI6I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAEnDm5F,EAAS32D,EAAOxiC,IAAM7I,EAI1B,IAAKgB,EAAIiuB,EAAI,EAAGjuB,GAAK,EAAGA,IAEtBmuF,EAAKnuF,IAAM,EACXhB,EAAIgiG,EAAShhG,IAEF,IAAPhB,IAEkB,GAAlBH,EAAEqiG,EAAOliG,OAAcH,EAAEoiG,EAAOjiG,GAAKgB,GAEzCnB,EAjCW,EAiCFmB,GAAKnB,EAAE0+F,EAAOv+F,GACvBH,EAAE0+F,EAAOv+F,GAAKgB,GAKhB,IAHAmI,EAAEg5F,IAAM,EACRh5F,EAAEqkE,GAAKv+C,EAEFjvB,EAAI,EAAGA,EAAIuD,EAAGvD,IAAK,CAUtB,GARAgB,EAAInB,EAAE0+F,EAAOv+F,GAEbmJ,EAAEg5F,MAEEnhG,EAAI,IAAKA,EAAImI,EAAEqkE,MAEnB2hB,EAAKnuF,GAAKhB,IAEJkiG,EAAKliG,IAAM,EAAK,SAEtBmJ,EAAEg5F,KAAOtiG,EAAEqiG,EAAOliG,GAElB,MAAMoiG,EAAKnjC,EAAOj/D,IACN,IAARoiG,IACmB,IAAjBviG,EAAEqiG,EAAOE,KAAaviG,EAAEoiG,EAAOG,GAAMviG,EAAEoiG,EAAOjiG,IAClDH,EAxDS,EAwDAA,EAAEoiG,EAAOjiG,IAAMH,EAAE0+F,EAAO6D,GACjCviG,EAAE0+F,EAAO6D,GAAMviG,EAzDN,EAyDemB,GACxBnB,EAAEqiG,EAAOE,IAAOviG,EAAEqiG,EAAOliG,GAE7B,CACA,IAAKgB,EAAI,EAAGA,EAAIiuB,EAAGjuB,IACbmuF,EAAKnuF,GAAK,IAAKmuF,EAAKnuF,GAAKhB,KAE/B,OAAO,CACT,CAlGiCqiG,CAAQz+F,EAAGuF,GAEtC,IAAKA,EAAEm5F,IAAM,EAAGtiG,EAAI,EAAGA,EAAIuD,EAAGvD,IAAOmJ,EAAEm5F,KAAOn5F,EAAEgtE,GAAGn2E,EAEvD,MAEEmJ,EAAEm5F,IAAM,EAAK/2D,EAAKhoC,GAAMA,EACxB4F,EAAEg5F,IAAMh5F,EAAEm5F,IAGZ,OAAOn5F,CACT,CAuFA,IIhJK,SAASo5F,GAAU1iG,EAAGoB,GAE3B,OAAOpB,EAAEoB,GAAK,CAChB,CCDO,SAASuhG,GAAQ3iG,EAAGoB,GAEzBpB,EAAEoB,GAAKw9F,GAAO5+F,EAAEoB,GAClB,CCLO,SAASwhG,GAAUzhG,GAExB,OAAOA,EAAI,EAAIy9F,GAAOz9F,GAAKA,CAC7B,CCQO,SAAS0hG,GAAOzhG,EAAG0Z,EAAGmzB,EAAK5X,EAAIi5D,GAEpC,MAAM9rF,EAAQsX,EAAE2wB,OACVqC,EAAMhzB,EAAE6wB,KAGRjoC,EAFOoX,EAAEwmB,MAEA,GAEf,IAAIngC,EAAG6H,EAAGgzB,EAEN0iE,EAAO,EAIX,IAFAroE,EAAG,GAAKj1B,EAEDs9F,GAAQ,GAAG,CAEhBt9F,EAAIi1B,EAAGqoE,GAEP,MAAMoE,EAAOxT,EAAOA,EAAKluF,GAAKA,EAEzBshG,GAAS50D,EAAK1sC,KAEjBuhG,GAAO70D,EAAK1sC,GAEZi1B,EAAG3yB,EAAIg7F,GAAQoE,EAAO,EAAI,EAAIF,GAAS90D,EAAIg1D,KAG7C,IAAIpjF,EAAO,EAEX,IAAK1W,EAAIqtB,EAAG3yB,EAAIg7F,GAAO1iE,EAAK8mE,EAAO,EAAI,EAAIF,GAAS90D,EAAIg1D,EAAO,IAAK95F,EAAIgzB,EAAIhzB,IAI1E,GAFA7H,EAAIqC,EAAMwF,IAEN05F,GAAS50D,EAAK3sC,GAAlB,CAEAk1B,EAAG3yB,EAAIg7F,GAAQ11F,EAEfqtB,IAAKqoE,GAAQv9F,EAEbue,EAAO,EAEP,KARiC,CAW/BA,IAEFg/E,IAEAroE,IAAK4X,GAAO7sC,EAEhB,CACA,OAAO6sC,CACT,CCnEA,MAOa80D,GAAkC/jG,GAPlC,YACQ,CACnB,eACA,WACA,aAGyE0D,IAA0C,IAAzC,aAAE4rD,EAAY,SAAEhX,EAAQ,SAAE1hB,GAAUlzB,EAkB9G,OAAO,SAAoBoY,EAAG/B,EAAG5Y,EAAGk2B,EAAIx2B,EAAGyvF,EAAM0T,GAE/C,MAAMC,EAAUnoF,EAAEywB,QACZ23D,EAASpoF,EAAE2wB,OACX03D,EAAOroF,EAAE6wB,KAGTjoC,EAFQoX,EAAEwmB,MAEA,GAEVgX,EAAUv/B,EAAEwyB,QACZgN,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KAEf,IAAI3iC,EAAG41C,EAAI7iB,EAAI5I,EAEf,MAAM8a,ECxBH,SAAkBnzB,EAAG/B,EAAG5Y,EAAGk2B,EAAIi5D,GAEpC,MAAM6T,EAAOroF,EAAE6wB,KACTy3D,EAAQtoF,EAAEwmB,MAEViX,EAASx/B,EAAE0yB,OACX+M,EAAOz/B,EAAE4yB,KAETjoC,EAAI0/F,EAAM,GAEhB,IAAIp6F,EAAG41C,EAAI7iB,EAEPkS,EAAMvqC,EAEV,IAAKk7C,EAAKpG,EAAKr4C,GAAI47B,EAAKyc,EAAKr4C,EAAI,GAAI6I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAK,CAExD,MAAM7H,EAAIo3C,EAAOvvC,GAEZ05F,GAASS,EAAMhiG,KAElB8sC,EAAM40D,GAAM1hG,EAAG2Z,EAAGmzB,EAAK5X,EAAIi5D,GAE/B,CAEA,IAAKtmF,EAAIilC,EAAKjlC,EAAItF,EAAGsF,IAEnB25F,GAAOQ,EAAM9sE,EAAGrtB,IAElB,OAAOilC,CACT,CDLgBo1D,CAAQvoF,EAAG/B,EAAG5Y,EAAGk2B,EAAIi5D,GAEjC,IAAKtmF,EAAIilC,EAAKjlC,EAAItF,EAAGsF,IAAOnJ,EAAEw2B,EAAGrtB,IAAM,EAEvC,IAAK41C,EAAKpG,EAAKr4C,GAAI47B,EAAKyc,EAAKr4C,EAAI,GAAI6I,EAAI41C,EAAI51C,EAAI+yB,EAAI/yB,IAAOnJ,EAAE04C,EAAOvvC,IAAMsvC,EAAQtvC,GAEnF,IAAK,IAAI8oB,EAAKmc,EAAKnc,EAAKpuB,EAAGouB,IAAM,CAE/B,MAAM1wB,EAAIi1B,EAAGvE,GAEP2Y,EAAI6kD,EAAOA,EAAKluF,GAAKA,EAE3B,KAAIqpC,EAAI,GAUR,IARAmU,EAAKukD,EAAK14D,GACV1O,EAAKonE,EAAK14D,EAAI,GAEd5qC,EAAEuB,GAAKktD,EAAazuD,EAAEuB,GAAI6hG,EAAQD,EAAKpkD,EAAM7iB,EAAK,IAElD/yB,EAAIg6F,EAAMpkD,EAAK,EAAKA,EACpBzrB,EAAI6vE,EAAMjnE,EAAOA,EAAK,EAEf/yB,EAAImqB,EAAGnqB,IAAK,CAEjB,MAAM7H,EAAI+hG,EAAOl6F,GAEjBnJ,EAAEsB,GAAKy0B,EAAS/1B,EAAEsB,GAAIm2C,EAAS2rD,EAAQj6F,GAAInJ,EAAEuB,IAC/C,CACF,CAEA,OAAO6sC,CACT,CAAC,IE3DUq1D,GAA6BtkG,GAX7B,OACQ,CACnB,MACA,eACA,WACA,WACA,SACA,WACA,iBAGoE0D,IAA+E,IAA9E,IAAEukB,EAAG,aAAEqnC,EAAY,SAAEhX,EAAQ,SAAE1hB,EAAQ,OAAEq0B,EAAM,SAAEC,EAAQ,aAAEvc,GAAcjrC,EAC9I,MAAM6gG,EAAYR,GAAgB,CAAEz0C,eAAchX,WAAU1hB,aAe5D,OAAO,SAAexG,EAAG9lB,EAAG8mD,GAE1B,IAAKhhC,EAAK,OAAO,KAEjB,MAEM1rB,EAFO0rB,EAAEkS,MAEA,GAEf,IAAInO,EACAmvE,EAAM,IACNG,EAAM,IAENn5F,IACF6pB,EAAI7pB,EAAE6pB,EACNmvE,EAAMh5F,EAAEg5F,KAAOA,EACfG,EAAMn5F,EAAEm5F,KAAOA,GAGjB,MAAM/F,EAAU,GACVC,EAAS,GACTC,EAAO,GAEPtjC,EAAI,IAAI3rB,EAAa,CACzBxuB,OAAQu9E,EACRl5F,MAAOm5F,EACP7uD,IAAK8uD,EACLt9E,KAAM,CAAC5b,EAAGA,KAGNo5F,EAAU,GACVC,EAAS,GACTC,EAAO,GAEPU,EAAI,IAAI/vD,EAAa,CACzBxuB,OAAQ29E,EACRt5F,MAAOu5F,EACPjvD,IAAKkvD,EACL19E,KAAM,CAAC5b,EAAGA,KAGN4rF,EAAO,GAEb,IAAInuF,EAAG6H,EAEP,MAAMnJ,EAAI,GACJw2B,EAAK,GAEX,IAAKl1B,EAAI,EAAGA,EAAIuC,EAAGvC,IAEjBtB,EAAEsB,GAAK,EAEPmuF,EAAKnuF,IAAM,EAEXy7F,EAAKz7F,EAAI,GAAK,EAGhBmhG,EAAM,EACNG,EAAM,EAEN,IAAK,IAAItiG,EAAI,EAAGA,EAAIuD,EAAGvD,IAAK,CAE1By8F,EAAKz8F,GAAKmiG,EACVtF,EAAK78F,GAAKsiG,EAEV,MAAM94D,EAAMxW,EAAIA,EAAEhzB,GAAKA,EAEjB8tC,EAAMs1D,EAAUjqC,EAAGlqC,EAAGua,EAAKtT,EAAIx2B,EAAGyvF,EAAM,GAE9C,IAAIkU,GAAQ,EACRxqF,GAAK,EAET,IAAKhQ,EAAIilC,EAAKjlC,EAAItF,EAAGsF,IAInB,GAFA7H,EAAIk1B,EAAGrtB,GAEHsmF,EAAKnuF,GAAK,EAAG,CAEf,MAAMsiG,EAAOx8E,EAAIpnB,EAAEsB,IAEf8oD,EAAOw5C,EAAMzqF,KAEfA,EAAIyqF,EACJD,EAAOriG,EAEX,MAEE47F,EAAO0F,GAAOnT,EAAKnuF,GACnB27F,EAAQ2F,KAAS5iG,EAAEsB,GAIvB,IAAc,IAAVqiG,GAAexqF,GAAK,EAAK,OAAO,KAEhCs2E,EAAK3lD,GAAO,GAAKugB,EAASjjC,EAAIpnB,EAAE8pC,IAAO2N,EAASt+B,EAAGo3C,MAASozC,EAAO75D,GAEvE,MAAMqzB,EAAQn9D,EAAE2jG,GAUhB,IARAzG,EAAO0F,GAAOtiG,EACd28F,EAAQ2F,KAASzlC,EAEjBsyB,EAAKkU,GAAQrjG,EAEbw8F,EAAO2F,GAAOkB,EACd9G,EAAQ4F,KAAS,EAEZt5F,EAAIilC,EAAKjlC,EAAItF,EAAGsF,IAEnB7H,EAAIk1B,EAAGrtB,GAEHsmF,EAAKnuF,GAAK,IAEZw7F,EAAO2F,GAAOnhG,EAEdu7F,EAAQ4F,KAASh0C,EAAazuD,EAAEsB,GAAI67D,IAGtCn9D,EAAEsB,GAAK,CAEX,CAKA,IAHAy7F,EAAKl5F,GAAK4+F,EACVtF,EAAKt5F,GAAK++F,EAELz5F,EAAI,EAAGA,EAAIs5F,EAAKt5F,IAAO2zF,EAAO3zF,GAAKsmF,EAAKqN,EAAO3zF,IAOpD,OALA0zF,EAAQhlF,OAAO4qF,EAAK5F,EAAQt8F,OAASkiG,GACrC3F,EAAOjlF,OAAO4qF,EAAK3F,EAAOv8F,OAASkiG,GACnCxF,EAAQplF,OAAO+qF,EAAK3F,EAAQ18F,OAASqiG,GACrC1F,EAAOrlF,OAAO+qF,EAAK1F,EAAO38F,OAASqiG,GAE5B,CAAEnpC,IAAGokC,IAAGpO,OACjB,CAAC,IClJUoU,GAA4B1kG,GAd5B,MACQ,CACnB,QACA,MACA,MACA,WACA,YACA,eACA,WACA,SACA,WACA,iBAGmE0D,IAAsG,IAArG,MAAE4C,EAAK,IAAE2hB,EAAG,IAAE1c,EAAG,SAAE+sC,EAAQ,UAAE2W,EAAS,aAAEK,EAAY,SAAE14B,EAAQ,OAAEq0B,EAAM,SAAEC,EAAQ,aAAEvc,GAAcjrC,EACpK,MAAMihG,EAAQhC,GAAY,CAAEp3F,MAAK+sC,WAAU2W,cACrC21C,EAAON,GAAW,CAAEr8E,MAAKqnC,eAAchX,WAAU1hB,WAAUq0B,SAAQC,WAAUvc,iBAuCnF,OAAOroC,EAvDI,MAuDQ,CAEjB,+BAAgC,SAAU0T,EAAGukD,EAAOsmC,GAElD,IAAKn/E,GAAU64C,IAAUA,EAAQ,GAAKA,EAAQ,EAAK,MAAM,IAAI7nD,MAAM,yFAEnE,GAAImuF,EAAY,GAAKA,EAAY,EAAK,MAAM,IAAInuF,MAAM,2DAGtD,MAAMpM,EAAIq6F,EAAMpmC,EAAOvkD,GAAG,GAGpBzY,EAAIqjG,EAAK5qF,EAAG1P,EAAGu6F,GAGrB,MAAO,CACLvqC,EAAG/4D,EAAE+4D,EACLokC,EAAGn9F,EAAEm9F,EACL10F,EAAGzI,EAAE+uF,KACLn8D,EAAG7pB,EAAE6pB,EACLlhB,SAAU,WACR,MAAO,MAAQ5S,KAAKi6D,EAAErnD,WAAa,QAAU5S,KAAKq+F,EAAEzrF,WAAa,QAAU5S,KAAK2J,EAAEiJ,YAAc5S,KAAK8zB,EAAI,QAAU9zB,KAAK8zB,EAAElhB,WAAa,IAAM,IAC/I,EAEJ,GACA,ICzEG,SAAS6xF,GAAS96F,EAAG+P,GAE1B,IAAI5Y,EACJ,MAAMuD,EAAIqV,EAAE3Y,OACNP,EAAI,GAEV,GAAImJ,EAEF,IAAK7I,EAAI,EAAGA,EAAIuD,EAAGvD,IAEjBN,EAAEmJ,EAAE7I,IAAM4Y,EAAE5Y,QAId,IAAKA,EAAI,EAAGA,EAAIuD,EAAGvD,IAEjBN,EAAEM,GAAK4Y,EAAE5Y,GAGb,OAAON,CACT,CC3BA,MAAM+E,GAAO,UAWAm/F,GAAgC/kG,GAAQ4F,GAVhC,CACnB,QACA,SACA,MACA,MACA,SACA,SACA,gBAGuElC,IAA8D,IAA7D,MAAE4C,EAAK,OAAEykB,EAAM,IAAEi6E,EAAG,IAAEC,EAAG,OAAEC,EAAM,OAAEC,EAAM,YAAE76E,GAAa5mB,EAChI,MAAM61D,EAAkBJ,GAAsB,CAAE7uC,gBAmChD,OAAOhkB,EAAMV,GAAM,CAEjB,wBAAyB,SAAUoU,EAAGD,GACpCC,EAAI+Q,EAAO/Q,GACX,MAAM9Y,EAAI8jG,EAAIhrF,GAEd,OADUorF,EAASlkG,EAAEo5D,EAAGp5D,EAAEw9F,EAAGx9F,EAAE8I,EAAG,KAAM+P,GAC/B8F,SACX,EAEA,8BAA+B,SAAU7F,EAAGD,GAC1C,MAAM7Y,EAAI8jG,EAAIhrF,GACd,OAAOorF,EAASlkG,EAAEo5D,EAAGp5D,EAAEw9F,EAAGx9F,EAAE8I,EAAG,KAAM+P,EACvC,EAEA,+BAAgC,SAAUC,EAAGD,GAC3C,MAAM7Y,EAAI8jG,EAAIhrF,GACd,OAAOorF,EAASlkG,EAAEo5D,EAAGp5D,EAAEw9F,EAAGx9F,EAAE8I,EAAG,KAAM+P,EACvC,EAEA,+CAAgD,SAAUC,EAAGD,EAAGwkD,EAAOsmC,GACrE,MAAM3jG,EAAI+jG,EAAIjrF,EAAGukD,EAAOsmC,GACxB,OAAOO,EAASlkG,EAAEo5D,EAAGp5D,EAAEw9F,EAAGx9F,EAAE8I,EAAG9I,EAAEizB,EAAGpa,EACtC,EAEA,yBAA0B,SAAU7Y,EAAG6Y,GACrC,OAAOqrF,EAASlkG,EAAEo5D,EAAGp5D,EAAEw9F,EAAGx9F,EAAE8I,EAAG9I,EAAEizB,EAAGpa,EACtC,IAGF,SAASsrF,EAAWrrF,GAClB,GAAIwH,EAASxH,GAAM,OAAOA,EAC1B,GAAIjU,EAAQiU,GAAM,OAAO+Q,EAAO/Q,GAChC,MAAM,IAAIjT,UAAU,kCACtB,CAEA,SAASq+F,EAAUr+C,EAAG/tB,EAAGhvB,EAAGmqB,EAAGpa,GAE7BgtC,EAAIs+C,EAAUt+C,GACd/tB,EAAIqsE,EAAUrsE,GAGVhvB,KACF+P,EAAIw/C,EAAgBxS,EAAGhtC,GAAG,IACxB8oB,MAAQiiE,GAAQ96F,EAAG+P,EAAE8oB,QAIzB,MAAM/hC,EAAIqkG,EAAOp+C,EAAGhtC,GAEdlZ,EAAIqkG,EAAOlsE,EAAGl4B,GAKpB,OAFIqzB,IAAKtzB,EAAEgiC,MAAQiiE,GAAQ3wE,EAAGtzB,EAAEgiC,QAEzBhiC,CACT,KCzGI+E,GAAO,iBAiBA0/F,GAAuCtlG,GAAQ4F,GAhBvC,CACnB,QACA,SACA,cACA,MACA,WACA,WACA,SACA,OACA,aACA,OACA,SACA,KACA,OAG8ElC,IAc1E,IAd2E,MAC/E4C,EAAK,OACLopB,EAAM,YACNue,EAAW,IACX1iC,EAAG,SACHqrB,EAAQ,SACR0hB,EAAQ,OACR9nB,EAAM,KACN/G,EAAI,WACJusB,EAAU,KACVrvB,EAAI,OACJ9C,EAAM,GACNoX,EAAE,GACFhe,GACDvZ,EAoCC,OAAO4C,EAAMV,GAAM,CACjB,oCAAqC2/F,CAACC,EAAUC,KAC9C,MAAMC,EAAS,CAACF,KAAaC,GAC7B,KAAOC,EAAOtkG,OAAS,GAAKsuB,EAAOg2E,EAAOA,EAAOtkG,OAAS,KACxDskG,EAAOt8E,MAET,GAAIs8E,EAAOtkG,OAAS,EAClB,MAAM,IAAIknC,WACR,eAAek9D,MAAaC,oDAEhC,OAAQC,EAAOtkG,QACb,KAAK,EACH,MAAO,CAAC40C,EAAWxlB,EAAOk1E,EAAO,GAAIA,EAAO,MAC9C,KAAK,EAAG,CACN,MAAO3gG,EAAGgV,EAAGC,GAAK0rF,EACZC,EAAQrtD,EAAS,EAAGt+B,GACpBwb,EAAK8iB,EAASv+B,EAAGA,GACjB0b,EAAK6iB,EAAS,EAAGt+B,EAAGjV,GAC1B,GAAIkpC,EAAYzY,EAAIC,GAAK,MAAO,CAACjF,EAAOwlB,EAAWj8B,GAAI4rF,IACvD,MAAMC,EAAen8E,EAAKmN,EAASpB,EAAIC,IACvC,MAAO,CACLjF,EAAOoG,EAASgvE,EAAc7rF,GAAI4rF,GAClCn1E,EAAOoG,EAASof,EAAW4vD,GAAe7rF,GAAI4rF,GAElD,CACA,KAAK,EAAG,CACN,MAAOzkG,EAAG6D,EAAGgV,EAAGC,GAAK0rF,EACfC,EAAQ3vD,EAAWsC,EAAS,EAAGt+B,IAC/B6rF,EAAOvtD,EAASv+B,EAAGA,GACnB+rF,EAAOxtD,EAAS,EAAGt+B,EAAGjV,GACtBghG,EAAOx6F,EAAI+sC,EAAS,EAAGv+B,EAAGA,EAAGA,GAAIu+B,EAAS,GAAIt+B,EAAGA,EAAG9Y,IACpD8kG,EAAO1tD,EAAS,EAAGt+B,EAAGD,EAAGhV,GAC/B,GAAIkpC,EAAY43D,EAAMC,IAAS73D,EAAY83D,EAAMC,GAC/C,MAAO,CAACx1E,EAAOzW,EAAG4rF,IAEpB,MAAMM,EAASrvE,EAASivE,EAAMC,GACxBI,EAAStvE,EAASmvE,EAAMC,GACxBG,EAAgB56F,EACpB+sC,EAAS,GAAIt+B,EAAGD,EAAGhV,EAAG7D,GAAIo3C,EAASv+B,EAAGA,EAAGhV,EAAGA,IACxCqhG,EAAgB76F,EACpB+sC,EAAS,EAAGv+B,EAAGA,EAAGA,EAAG7Y,GACrBo3C,EAAS,EAAGt+B,EAAGjV,EAAGA,EAAGA,GACrBuzC,EAAS,GAAIt+B,EAAGA,EAAG9Y,EAAGA,IACxB,GAAI+sC,EAAYk4D,EAAeC,GAC7B,MAAO,CACL51E,EACEoG,EACE0hB,EAAS,EAAGt+B,EAAGD,EAAGhV,GAClBwG,EAAI+sC,EAAS,EAAGt+B,EAAGA,EAAG9Y,GAAIo3C,EAASv+B,EAAGA,EAAGA,KAC3Cu+B,EAASt+B,EAAGisF,IACdz1E,EACEoG,EAAS0hB,EAAS,EAAGt+B,EAAG9Y,GAAIo3C,EAASv+B,EAAGhV,IACxCuzC,EAAS,EAAG2tD,KAIlB,IAAII,EAeJ,OAbEA,EADEp4D,EAAY43D,EAAMC,GACXI,EAEA11E,EACPjlB,EACE26F,EACAz8E,EAAKmN,EACH0hB,EAAS4tD,EAAQA,GAAS5tD,EAAS,EAAG2tD,EAAQA,EAAQA,MAE1D,GAGat/E,EAAK0/E,GADL,GACuBxmE,UAAU91B,KAChDqzB,GAAK5M,EAAOjlB,EAAIwO,EAAGqjB,EAAG5M,EAAOy1E,EAAQ7oE,IAAKuoE,KAC5B57F,KAAIqS,GACA,YAAdyH,EAAOzH,IAAoB6xB,EAAYhxB,EAAGb,GAAIa,EAAGb,GAAK6e,EAAG7e,IACpDa,EAAGb,GAELA,GAEX,CACA,QACE,MAAM,IAAIksB,WAAW,8DAA8Do9D,KACvF,GAEF,IC/ISY,GAAkCtmG,GAHlC,OACQ,CAAC,aAEqD0D,IAAkB,IAAjB,SAAE2hF,GAAU3hF,EAYtF,SAAS6iG,EAAMC,GACb,KAAMnmG,gBAAgBkmG,GACpB,MAAM,IAAIx6F,YAAY,oDAGxB,IAAKy6F,EAAK,MAAM,IAAI9vF,MAAM,0BAE1BrW,KAAKmmG,IAAMA,CACb,CA0GA,OArGAD,EAAKtjG,UAAUyD,KAAO,OACtB6/F,EAAKtjG,UAAU+e,QAAS,EAOxBukF,EAAKtjG,UAAUgQ,SAAW,WACxB,MAAMuzF,EAAMnmG,KAAKmmG,KAAO,CAAC,EACzB,IAAI3oC,EAAO,KAcX,GAZI2oC,EAAI5gG,OACNi4D,GAAQ,SAAW2oC,EAAI5gG,KAAO,QAE5B4gG,EAAIj5F,WACNswD,GAAQ,aAAe2oC,EAAIj5F,SAAW,QAEpCi5F,EAAIC,cACN5oC,GAAQ,qBAAuB2oC,EAAIC,YAAc,QAE/CD,EAAIplE,SACNy8B,GAAQ,gBAAkB2oC,EAAIplE,OAAO34B,KAAK,UAAY,QAEpD+9F,EAAIE,SAAU,CAChB7oC,GAAQ,cAIR,IAAI8oC,GAAgB,EACpB,MAAMC,EAAiBvhB,EAAS,YAE1BrgE,EAAQ,CACZe,OAAS8gF,IACPF,GAAgB,EACTthB,EAAS,oBAAqB,CAAEwhB,gBAI3C,IAAK,IAAI1kG,EAAI,EAAGA,EAAIqkG,EAAIE,SAAStlG,OAAQe,IAAK,CAC5C,MAAMojF,EAAOihB,EAAIE,SAASvkG,GAG1B,IAAIm5B,EAFJuiC,GAAQ,OAAS0nB,EAAO,KAGxB,IAEEjqD,EAAM+pD,EAASE,EAAMvgE,EACvB,CAAE,MAAO3L,GACPiiB,EAAMjiB,CACR,MACY1V,IAAR23B,GAAsBtZ,EAAOsZ,KAC/BuiC,GAAQ,WAAa12C,GAAOmU,EAAK,CAAEjU,UAAW,KAAQ,KAE1D,CACAw2C,GAAQ,KAEJ8oC,GACFthB,EAAS,yBAA0B,CAAEuhB,kBAEzC,CAQA,OAPIJ,EAAIM,UAAYN,EAAIM,SAAS1lG,SAC/By8D,GAAQ,WAAa2oC,EAAIM,SAASr+F,KAAK,MAAQ,QAE7C+9F,EAAIO,SAAWP,EAAIO,QAAQ3lG,SAC7By8D,GAAQ,aAAe2oC,EAAIO,QAAQt+F,KAAK,MAAQ,MAG3Co1D,CACT,EAKA0oC,EAAKtjG,UAAUmoB,OAAS,WACtB,MAAMxU,EAAMkN,GAAMzjB,KAAKmmG,KAEvB,OADA5vF,EAAIyU,OAAS,OACNzU,CACT,EAOA2vF,EAAKj7E,SAAW,SAAUC,GACxB,MAAMi7E,EAAM,CAAC,EAQb,OANA7jG,OAAOyB,KAAKmnB,GACTxjB,QAAOuU,GAAiB,WAATA,IACf/X,SAAQ+X,IACPkqF,EAAIlqF,GAAQiP,EAAKjP,EAAK,IAGnB,IAAIiqF,EAAKC,EAClB,EAKAD,EAAKtjG,UAAU4c,QAAU0mF,EAAKtjG,UAAUgQ,SAEjCszF,CAAI,GACV,CAAE/6E,SAAS,IC/HDw7E,GAAmChnG,GAHnC,QACQ,CAAC,MAAO,OAAQ,UAEuC0D,IAAyB,IAAxB,GAAEyV,EAAE,KAAEgB,EAAI,MAAE7T,GAAO5C,EAmB9F,SAASujG,EAAOp/F,GACd,KAAMxH,gBAAgB4mG,GACpB,MAAM,IAAIl7F,YAAY,oDAGpB6X,GAAQ/b,GACVxH,KAAKwH,MAAQA,EAAMA,MAEnBxH,KAAKwH,MAAQA,CAEjB,CA4EA,SAASq/F,EAAiBthG,EAAMuhG,GAC9B5iF,GAAK0iF,EAAMhkG,UAAW2C,GAAM,WAC1B,MAAMuC,EAAKg/F,IACX,GAAkB,mBAAPh/F,EACT,OAAOi/F,EAASj/F,EAIpB,GACF,CAQA,SAASi/F,EAAUj/F,GACjB,OAAO,WAEL,GAAyB,IAArBrF,UAAU1B,OACZ,OAAO,IAAI6lG,EAAM9+F,EAAG9H,KAAKwH,QAE3B,MAAM8E,EAAO,CAACtM,KAAKwH,OACnB,IAAK,IAAI1F,EAAI,EAAGA,EAAIW,UAAU1B,OAAQe,IACpCwK,EAAKxK,EAAI,GAAKW,UAAUX,GAE1B,GAAImE,EAAM0B,gBAAgBG,GAAK,CAC7B,MAAMk/F,EAAY/gG,EAAMqS,QAAQxQ,EAAIwE,GAMpC,GAAgC,IAA5B06F,EAAU9+F,OAAOnH,OACnB,MAAM,IAAIsV,MAAM,kBAAoBvO,EAAGvC,KAAO,8EAEhD,OAAO,IAAIqhG,EAAMI,EAAUpyF,eAAepH,MAAM1F,EAAIwE,GACtD,CACA,OAAO,IAAIs6F,EAAM9+F,EAAG0F,MAAM1F,EAAIwE,GAChC,CACF,CAhHAs6F,EAAMhkG,UAAUyD,KAAO,QACvBugG,EAAMhkG,UAAU2gB,SAAU,EAO1BqjF,EAAMhkG,UAAUyd,KAAO,WACrB,OAAOrgB,KAAKwH,KACd,EAOAo/F,EAAMhkG,UAAU4c,QAAU,WACxB,OAAOxf,KAAKwH,KACd,EAMAo/F,EAAMhkG,UAAUgQ,SAAW,WACzB,OAAOkU,GAAO9mB,KAAKwH,MACrB,EAMAo/F,EAAMhkG,UAAUmoB,OAAS,WACvB,MAAO,CACLC,OAAQ,QACRxjB,MAAOxH,KAAKwH,MAEhB,EASAo/F,EAAM37E,SAAW,SAAUC,GACzB,OAAO,IAAI07E,EAAM17E,EAAK1jB,MACxB,EA+EAo/F,EAAMK,YAAc,SAAUrxF,EAAMC,GAClC,GAAoB,iBAATD,EAvESrQ,EAyENqQ,EAxEI,mBADQ9N,EAyEN+N,KAvElB+wF,EAAMhkG,UAAU2C,GAAQwhG,EAASj/F,SA0EjC,IAAK,MAAMvC,KAAQqQ,EACb/S,GAAe+S,EAAMrQ,SAAiCjC,IAAxB4jG,EAAc3hG,IAC9CshG,EAAgBthG,GAAM,IAAMqQ,EAAKrQ,KA9EzC,IAAsBA,EAAMuC,CAkF5B,EAEA,MAAMo/F,EAAgB,CACpBlQ,YAAY,EACZmQ,MAAM,EACN9gG,MAAM,EACN+gG,SAAS,EACTl8E,MAAM,EACN2iC,OAAO,EACPtqC,SAAS,GAgBX,OAZAqjF,EAAMK,YAAYntF,GAGdhB,GACFA,EAAG,UAAU,SAAUvT,EAAMuhG,EAAUphB,GAChCA,GAEHmhB,EAAgBthG,EAAMuhG,EAE1B,IAGKF,CAAK,GACX,CAAEz7E,SAAS,IChNDk8E,GAAQ,CACnB9hG,KAAM,IACN2H,SAAU,YACV6zB,OAAQ,CACN,KAEFqlE,YAAa,oFACbC,SAAU,CACR,IACA,QACA,SACA,UAEFK,QAAS,CAAC,QCbCY,GAAS,CACpB/hG,KAAM,KACN2H,SAAU,YACV6zB,OAAQ,CACN,MAEFqlE,YAAa,gJACbC,SAAU,CACR,KACA,aAEFK,QAAS,CAAC,QCgPCa,GAAe,CAG1B78C,UC9P2B,CAC3BnlD,KAAM,YACN2H,SAAU,eACV6zB,OAAQ,CACN,gBAEFqlE,YACI,+CACJC,SAAU,CACR,YACA,kCACA,mBACA,uBACA,8BAEFK,QAAS,CACP,UAAW,SAAU,UAAW,WAAY,QAAS,SAAU,SAAU,SD+O3E/5D,OE/PwB,CACxBpnC,KAAM,SACN2H,SAAU,eACV6zB,OAAQ,CACN,aAEFqlE,YACI,2FACJC,SAAU,CACR,uDACA,+BACA,8BAEFK,QAAS,CACP,UAAW,YAAa,SAAU,UAAW,WAAY,QAAS,SAAU,SAAU,SFkPxFl5D,QGhQyB,CACzBjoC,KAAM,UACN2H,SAAU,eACV6zB,OAAQ,CACN,IACA,cAEFqlE,YACI,6CACJC,SAAU,CACR,aACA,aACA,aACA,kBACA,mBACA,yBAEFK,QAAS,CACP,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SH+OjElmD,QIjQyB,CACzBj7C,KAAM,UACN2H,SAAU,eACV6zB,OAAQ,CACN,YACA,kBACA,mBAEFqlE,YACI,2BACJC,SAAU,CACR,YACA,gBACA,qBAEFK,QAAS,CACP,YAAa,UAAW,QAAS,SAAU,SAAU,SAAU,SJkPjEvqB,WKlQ4B,CAC5B52E,KAAM,aACN2H,SAAU,eACV6zB,OAAQ,CACN,0BACA,gCAEFqlE,YACI,iEACJC,SAAU,CACR,oBACA,uFACA,oCAEFK,QAAS,CACP,OAAQ,cLoPV9lE,SMnQ0B,CAC1Br7B,KAAM,WACN2H,SAAU,eACV6zB,OAAQ,CACN,gBACA,mBACA,oBACA,8BAEFqlE,YACE,6EACFC,SAAU,CACR,kBACA,kCACA,4BACA,2CAEFK,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SNkPlEviG,MOpQuB,CACvBoB,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,UACA,cACA,mBACA,yBACA,kCACA,+CAEFqlE,YACI,yDACJC,SAAU,CACR,yBACA,UACA,eACA,kBACA,gBACA,kBAEFK,QAAS,CACP,YAAa,UAAW,UAAW,SAAU,SAAU,QAAS,SAAU,SP+O5Eh8E,OQrQwB,CACxBnlB,KAAM,SACN2H,SAAU,eACV6zB,OAAQ,CACN,KACA,6BACA,WACA,kBACA,iBAEFqlE,YACI,mBACJC,SAAU,CACR,KACA,YACA,qBACA,WACA,iBACA,iCACA,4CAEFK,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WRgP1E/gF,OStQwB,CACxBpgB,KAAM,SACN2H,SAAU,eACV6zB,OAAQ,CACN,IACA,YACA,+BAEFqlE,YACI,gEACJC,SAAU,CACR,IACA,MACA,OACA,YACA,gBACA,eACA,oCACA,6BAEFK,QAAS,CACP,YAAa,SAAU,UAAW,UAAW,WAAY,QAAS,SAAU,SAAU,STkPxFjW,OUvQwB,CACxBlrF,KAAM,SACN2H,SAAU,eACV6zB,OAAQ,CACN,WACA,qCACA,gDAEFqlE,YACA,0BACAC,SAAU,CACR,WACA,uBACA,kCAEFK,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,OAAQ,WVwP1EnzD,UWxQ2B,CAC3BhuC,KAAM,YACN2H,SAAU,eACV6zB,OAAQ,CACN,wCAEFqlE,YACI,6EACJC,SAAU,CACR,oCAEFK,QAAS,CACP,OAAQ,eX6PVj5D,OYzQwB,CACxBloC,KAAM,SACN2H,SAAU,eACV6zB,OAAQ,CACN,SACA,aAEFqlE,YACI,iDACJC,SAAU,CACR,iBACA,cACA,kBAEFK,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,SZ2PlE30D,Ka1QsB,CACtBxsC,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,aACA,oBACA,gBAEFqlE,YACI,iBACJC,SAAU,CACR,SACA,SACA,wBACA,kBAEFK,QAAS,CACP,YAAa,UAAW,UAAW,QAAS,SAAU,SAAU,Wb4PlE1tF,EAAGquF,GACHxuF,EAAGwuF,GACHlZ,Mc/QuB,CACvB5oF,KAAM,QACN2H,SAAU,YACV6zB,OAAQ,CACN,SAEFqlE,YAAa,sBACbC,SAAU,CACR,SAEFK,QAAS,CAAC,SdsQV5kG,EehRmB,CACnByD,KAAM,IACN2H,SAAU,YACV6zB,OAAQ,CACN,KAEFqlE,YAAa,sIACbC,SAAU,CACR,IACA,QACA,YAEFK,QAAS,IfqQTr5F,SgBjR0B,CAC1B9H,KAAM,WACN2H,SAAU,YACV6zB,OAAQ,CACN,YAEFqlE,YAAa,6GACbC,SAAU,CACR,WACA,SAEFK,QAAS,IhBuQTxgF,IiBlRqB,CACrB3gB,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,OAEFqlE,YAAa,mEACbC,SAAU,CACR,MACA,UAEFK,QAAS,IjBwQTtgF,KkBnRsB,CACtB7gB,KAAM,OACN2H,SAAU,YACV6zB,OAAQ,CACN,QAEFqlE,YAAa,oEACbC,SAAU,CACR,OACA,WAEFK,QAAS,IlByQTc,MmBpRuB,CACvBjiG,KAAM,QACN2H,SAAU,YACV6zB,OAAQ,CACN,SAEFqlE,YAAa,kEACbC,SAAU,CACR,QACA,aAEFK,QAAS,InB0QTe,OoBrRwB,CACxBliG,KAAM,SACN2H,SAAU,YACV6zB,OAAQ,CACN,UAEFqlE,YAAa,mEACbC,SAAU,CACR,SACA,cAEFK,QAAS,IpB2QTn4E,IqBtRqB,CACrBhpB,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,OAEFqlE,YAAa,eACbC,SAAU,CACR,MACA,SAEFK,QAAS,IrB4QT50D,KsBvRsB,CACtBvsC,KAAM,OACN2H,SAAU,YACV6zB,OAAQ,CACN,QAEFqlE,YAAa,aACbC,SAAU,CACR,QAEFK,QAAS,CAAC,OAAQ,UtB8QlB9tE,GAAI0uE,GACJ77E,GAAI67E,GACJ7rE,IuB1RqB,CACrBl2B,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,OAEFqlE,YAAa,mOACbC,SAAU,CACR,OAEFK,QAAS,IvBiRTgB,QwB3RwB,CACxBniG,KAAM,UACN2H,SAAU,YACV6zB,OAAQ,CACN,WAEFqlE,YAAa,+DACbC,SAAU,CACR,UACA,aAEFK,QAAS,IxBiRTiB,MyB5RuB,CACvBpiG,KAAM,QACN2H,SAAU,YACV6zB,OAAQ,CACN,SAEFqlE,YAAa,6DACbC,SAAU,CACR,QACA,WAEFK,QAAS,IzBkRTx3C,I0B7RqB,CACrB3pD,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,OAEFqlE,YAAa,0GACbC,SAAU,CACR,MACA,UAEFK,QAAS,CAAC,O1BmRVxY,K2B9RsB,CACtB3oF,KAAM,OACN2H,SAAU,YACV6zB,OAAQ,CACN,QAEFqlE,YAAa,qBACbC,SAAU,CACR,QAEFK,QAAS,CAAC,U3BqRVkB,Q4B/RyB,CACzBriG,KAAM,UACN2H,SAAU,YACV6zB,OAAQ,CACN,WAEFqlE,YAAa,8CACbC,SAAU,CACR,WAEFK,QAAS,I5ByRTmB,aAAc,CAAEzB,YAAa,2BAA4BC,SAAU,CAAC,iBACpEyB,oBAAqB,CAAE1B,YAAa,oCAAqCC,SAAU,CAAC,wBACpF0B,eAAgB,CAAE3B,YAAa,kBAAmBC,SAAU,CAAC,mBAC7D2B,sBAAuB,CAAE5B,YAAa,0BAA2BC,SAAU,CAAC,0BAE5E4B,iBAAkB,CAAE7B,YAAa,0CAA2CC,SAAU,CAAC,qBACvF6B,iBAAkB,CAAE9B,YAAa,0CAA2CC,SAAU,CAAC,qBACvF8B,gBAAiB,CAAE/B,YAAa,qCAAsCC,SAAU,CAAC,oBACjFxxB,QAAS,CAAEuxB,YAAa,6DAA+DC,SAAU,CAAC,oBAClG+B,gBAAiB,CAAEhC,YAAa,qBAAuBC,SAAU,CAAC,oBAClEgC,iBAAkB,CAAEjC,YAAa,oBAAqBC,SAAU,CAAC,qBACjEiC,aAAc,CAAElC,YAAa,gBAAiBC,SAAU,CAAC,iBACzDkC,mBAAoB,CAAEnC,YAAa,sBAAuBC,SAAU,CAAC,uBACrEmC,0BAA2B,CAAEpC,YAAa,8BAA+BC,SAAU,CAAC,8BAEpFoC,oBAAqB,CAAErC,YAAa,wBAAyBC,SAAU,CAAC,wBACxEqC,gBAAiB,CAAEtC,YAAa,mBAAoBC,SAAU,CAAC,oBAC/DsC,SAAU,CAAEvC,YAAa,wBAAyBC,SAAU,CAAC,aAE7DuC,WAAY,CAAExC,YAAa,cAAeC,SAAU,CAAC,eACrDwC,wBAAyB,CAAEzC,YAAa,4BAA6BC,SAAU,CAAC,4BAChFyC,aAAc,CAAE1C,YAAa,gBAAiBC,SAAU,CAAC,iBACzD0C,cAAe,CAAE3C,YAAa,0BAA2BC,SAAU,CAAC,kBACpE2C,cAAe,CAAE5C,YAAa,0BAA2BC,SAAU,CAAC,kBACpE4C,cAAe,CAAE7C,YAAa,iBAAkBC,SAAU,CAAC,kBAC3D6C,WAAY,CAAE9C,YAAa,cAAeC,SAAU,CAAC,eACrD8C,aAAc,CAAE/C,YAAa,gBAAiBC,SAAU,CAAC,iBACzD+C,YAAa,CAAEhD,YAAa,eAAgBC,SAAU,CAAC,gBACvDgD,qBAAsB,CAAEjD,YAAa,yBAA0BC,SAAU,CAAC,yBAC1EiD,QAAS,CAAElD,YAAa,mBAAoBC,SAAU,CAAC,YACvDkD,oBAAqB,CAAEnD,YAAa,wBAAyBC,SAAU,CAAC,wBACxEmD,gBAAiB,CAAEpD,YAAa,oBAAqBC,SAAU,CAAC,oBAChEoD,aAAc,CAAErD,YAAa,gBAAiBC,SAAU,CAAC,iBAEzDqD,WAAY,CAAEtD,YAAa,uBAAwBC,SAAU,CAAC,eAC9DsD,SAAU,CAAEvD,YAAa,oBAAsBC,SAAU,CAAC,aAC1DuD,UAAW,CAAExD,YAAa,qBAAsBC,SAAU,CAAC,cAC3DwD,QAAS,CAAEzD,YAAa,mBAAoBC,SAAU,CAAC,YACvDyD,eAAgB,CAAE1D,YAAa,2BAA4BC,SAAU,CAAC,mBACtE0D,UAAW,CAAE3D,YAAa,qDAAsDC,SAAU,CAAC,cAC3F2D,YAAa,CAAE5D,YAAa,eAAgBC,SAAU,CAAC,gBACvD4D,oBAAqB,CAAE7D,YAAa,wBAAyBC,SAAU,CAAC,wBACxE6D,YAAa,CAAE9D,YAAa,+DAAgEC,SAAU,CAAC,gBACvG8D,cAAe,CAAE/D,YAAa,qDAAsDC,SAAU,CAAC,kBAC/F+D,gBAAiB,CAAEhE,YAAa,4BAA6BC,SAAU,CAAC,oBACxEgE,gBAAiB,CAAEjE,YAAa,4BAA6BC,SAAU,CAAC,oBACxEiE,iBAAkB,CAAElE,YAAa,iCAAkCC,SAAU,CAAC,qBAG9EkE,UAAW,CAAEnE,YAAa,sBAAuBC,SAAU,CAAC,cAC5DmE,aAAc,CAAEpE,YAAa,mCAAoCC,SAAU,CAAC,iBAC5EoE,QAAS,CAAErE,YAAa,iFAAkFC,SAAU,CAAC,YAErHqE,aAAc,CAAEtE,YAAa,gBAAiBC,SAAU,CAAC,iBACzDsE,WAAY,CAAEvE,YAAa,cAAeC,SAAU,CAAC,eACrDuE,WAAY,CAAExE,YAAa,cAAeC,SAAU,CAAC,eACrDwE,aAAc,CAAEzE,YAAa,gBAAiBC,SAAU,CAAC,iBACzDyE,kBAAmB,CAAE1E,YAAa,qBAAsBC,SAAU,CAAC,sBAGnE0E,W6B/V4B,CAC5BxlG,KAAM,aACN2H,SAAU,UACV6zB,OAAQ,CACN,6BACA,mDAEFqlE,YAAa,4OACbC,SAAU,CACR,0BACA,6CACA,mCACA,6BACA,uBACA,iBACA,wBACA,uBAEFK,QAAS,CACP,WAAY,QAAS,a7B6UvB5B,O8BhWwB,CACxBv/F,KAAM,SACN2H,SAAU,UACV6zB,OAAQ,CACN,kBAEFqlE,YACA,gIACAC,SAAU,CACR,oBACA,cACA,oBAEFK,QAAS,CACP,YAAa,MAAO,UAAW,SAAU,SAAU,W9BmVrDsE,U+BjW2B,CAC3BzlG,KAAM,YACN2H,SAAU,UACV6zB,OAAQ,CACN,qBAEFqlE,YACA,iIACAC,SAAU,CACR,oBACA,cACA,oBAEFK,QAAS,CACP,SAAU,MAAO,UAAW,SAAU,SAAU,W/BoVlD/B,IgClWqB,CACrBp/F,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,UAEFqlE,YACA,sIACAC,SAAU,CACR,wBACA,gCACA,iCAEFK,QAAS,CACP,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,OhCqV5DuE,QiCnWyB,CACzB1lG,KAAM,UACN2H,SAAU,UACV6zB,OAAQ,CACN,kBACA,oBAEFqlE,YAAa,gGACbC,SAAU,CACR,oBACA,cACA,qBAEFK,QAAS,CACP,MAAO,MAAO,SAAU,SAAU,SAAU,WjCsV9CwE,UkCpW2B,CAC3B3lG,KAAM,YACN2H,SAAU,UACV6zB,OAAQ,CAAC,mBACTqlE,YAAa,0EACbC,SAAU,CACR,0BACA,8CAEFK,QAAS,CAAC,alC4VVyE,emCrWgC,CAChC5lG,KAAM,iBACN2H,SAAU,UACV6zB,OAAQ,CACN,0BACA,6BACA,mCAEFqlE,YAAa,wIACbC,SAAU,CACR,qCAEFK,QAAS,CACP,OAAQ,SnCyVVpuF,QoCtWyB,CACzB/S,KAAM,UACN2H,SAAU,UACV6zB,OAAQ,CACN,wBAEFqlE,YAAa,0DACbC,SAAU,CACR,oCACA,wDACA,8CACA,8DAEFK,QAAS,CACP,WAAY,YAEdD,SAAU,CACR,mBpCsVFnhC,SqCvW0B,CAC1B//D,KAAM,WACN2H,SAAU,UACV6zB,OAAQ,CACN,iBACA,yBAEFqlE,YAAa,+BACbC,SAAU,CACR,wBACA,qBACA,+BACA,2BACA,+BAEFK,QAAS,CACP,eAAgB,aAAc,WAAY,QAAS,cAAe,YrCwVpE0E,iBsCxWkC,CAClC7lG,KAAM,mBACN2H,SAAU,UACV6zB,OAAQ,CACN,yBACA,mCAEFqlE,YAAa,6DACbC,SAAU,CACR,8BACA,2CAEFK,QAAS,CACP,WAAY,eAAgB,atC4V9B2E,auCzW8B,CAC9B9lG,KAAM,eACN2H,SAAU,UACV6zB,OAAQ,CACN,sBAEFqlE,YAAa,iEACbC,SAAU,CACR,6BACA,kCAEFK,QAAS,CACP,WAAY,mBAAoB,avC8VlC4E,cwC1W+B,CAC/B/lG,KAAM,gBACN2H,SAAU,UACV6zB,OAAQ,CACN,8BACA,wCAEFqlE,YAAa,oEACbC,SAAU,CACR,6BACA,mCACA,mEAEFK,QAAS,CAAC,WAAY,axC8VtB6E,YyC3W6B,CAC7BhmG,KAAM,cACN2H,SAAU,UACV6zB,OAAQ,CACN,oBACA,2BACA,sCAEFqlE,YAAa,mPACbC,SAAU,CACR,gCACA,uCAEFK,QAAS,CACP,azC8VF9B,I0C5WqB,CACrBr/F,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,4BAEFqlE,YAAa,wKACbC,SAAU,CACR,2FAEFK,QAAS,CACP,UAAW,SAAU,SAAU,SAAU,SAAU,MAAO,O1CkW5D7B,O2C7WwB,CACxBt/F,KAAM,SACN2H,SAAU,UACV6zB,OAAQ,CACN,kBAEFqlE,YACA,gIACAC,SAAU,CACR,oFAEFK,QAAS,CACP,YAAa,MAAO,UAAW,SAAU,SAAU,W3CkWrD8E,U4C9W2B,CAC3BjmG,KAAM,YACN2H,SAAU,UACV6zB,OAAQ,CACN,kBAEFqlE,YACA,iIACAC,SAAU,CACR,oFAEFK,QAAS,CACP,SAAU,MAAO,UAAW,SAAU,SAAU,W5CmWlDjE,G6C/WoB,CACpBl9F,KAAM,KACN2H,SAAU,UACV6zB,OAAQ,CACN,SAEFqlE,YACA,uKACAC,SAAU,CACR,4DAEFK,QAAS,CACP,MAAO,MAAO,W7CsWhB9+E,I8ClXqB,CACrBriB,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,UAEFqlE,YAAa,8BACbC,SAAU,CACR,WACA,aAEFK,QAAS,CAAC,S9CwWVx7F,I+CnXqB,CACrB3F,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,aAEFqlE,YAAa,kBACbC,SAAU,CACR,gBACA,UACA,SACA,gBACA,eAEFK,QAAS,CACP,a/CoWFpgF,KgDpXsB,CACtB/gB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,UACA,qBAEFqlE,YACI,iQACJC,SAAU,CACR,WACA,UACA,WACA,eACA,WACA,iBACA,gBAEFK,QAAS,CACP,SACA,OACA,OACA,ahD+VFh5E,KiDrXsB,CACtBnoB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,UACA,aACA,4BACA,gCAEFqlE,YACI,wHACJC,SAAU,CACR,YACA,YACA,aACA,oBACA,wBAEFK,QAAS,CAAC,QAAS,MAAO,UjDoW1BnX,KkDtXsB,CACtBhqF,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,WAEFqlE,YAAa,2DACbC,SAAU,CACR,UACA,MACA,aAEFK,QAAS,CACP,WACA,SACA,QlDwWFv2E,OmDvXwB,CACxB5qB,KAAM,SACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,gBAEFqlE,YAAa,qBACbC,SAAU,CACR,YACA,QACA,UACA,YACA,cACA,eAEFK,QAAS,CACP,anDuWFv3C,UoDxX2B,CAC3B5pD,KAAM,YACN2H,SAAU,YACV6zB,OAAQ,CACN,SACA,mBAEFqlE,YAAa,kCACbC,SAAU,CACR,yBACA,yBACA,UAEFK,QAAS,CACP,WACA,cACA,WpDyWF9X,YqDzX6B,CAC7BrpF,KAAM,cACN2H,SAAU,YACV6zB,OAAQ,CACN,SACA,qBAEFqlE,YAAa,oCACbC,SAAU,CACR,yBACA,yBACA,UAEFK,QAAS,CACP,WACA,SACA,crD0WFjY,OsD1XwB,CACxBlpF,KAAM,SACN2H,SAAU,YACV6zB,OAAQ,CACN,SACA,gBAEFqlE,YACI,+CACJC,SAAU,CACR,yBACA,UAEFK,QAAS,CACP,QtD6WFlgF,IuD3XqB,CACrBjhB,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,UAEFqlE,YAAa,qCACbC,SAAU,CACR,WACA,UACA,gBACA,UACA,uDAEFK,QAAS,CACP,OACA,QACA,MACA,QvD0WF1W,KwD5XsB,CACtBzqF,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,UAEFqlE,YAAa,wJAGbC,SAAU,CACR,uBAEFK,QAAS,CACP,QxDgXFjgF,MyD7XuB,CACvBlhB,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,YAEFqlE,YAAa,mEACbC,SAAU,CACR,WACA,gBACA,qBAEFK,QAAS,CACP,MACA,MACA,QzD+WFhkC,I0D9XqB,CACrBn9D,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,YACA,2BACA,+BAEFqlE,YACI,sGACJC,SAAU,CACR,WACA,WACA,YACA,YACA,mBACA,uBAEFK,QAAS,CAAC,OAAQ,QAAS,U1D4W3B9sF,M2D/XuB,CACvBrU,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,WACA,cACA,6BACA,iCAEFqlE,YACI,yHACJC,SAAU,CACR,aACA,aACA,cACA,qBACA,yBAEFK,QAAS,CAAC,OAAQ,MAAO,U3D8WzBnqE,I4DhYqB,CACrBh3B,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,YACA,qBAEFqlE,YAAa,uCACbC,SAAU,CACR,aACA,aACA,oBAEFK,QAAS,CAAC,MAAO,S5DoXjBztE,M6DjYuB,CACvB1zB,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,sBACA,yBAEFqlE,YAAa,kDACbC,SAAU,CACR,cACA,kBACA,YACA,oBAEFK,QAAS,CAAC,MAAO,S7DoXjB9pD,I8DlYqB,CACrBr3C,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,aAEFqlE,YAAa,qCACbC,SAAU,CACR,YACA,aACA,iBAEFK,QAAS,CAAC,Q9DuXVzgF,I+DnYqB,CACrB1gB,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,gBAEFqlE,YAAa,8NACbC,SAAU,CACR,WACA,eACA,SACA,SACA,iBACA,uBACA,mBACA,SAEFK,QAAS,CACP,MACA,QACA,OACA,U/D8WF1gF,KgEpYsB,CACtBzgB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,WAEFqlE,YAAa,gFACbC,SAAU,CACR,gBACA,WACA,qBACA,aAEFK,QAAS,CACP,MACA,QACA,MACA,UhEoXFrgF,MiErYuB,CACvB9gB,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,WACA,kBAEFqlE,YAAa,yCACbC,SAAU,CACR,aACA,kBACA,aACA,kBACA,yBAEFK,QAAS,CACP,MACA,MACA,OACA,UjEmXFvgF,MkEtYuB,CACvB5gB,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,YAEFqlE,YAAa,4CACbC,SAAU,CACR,iBACA,eACA,SACA,uBACA,kBAEFK,QAAS,CACP,MACA,QlEuXF7yE,ImEvYqB,CACrBtuB,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,UACA,aAEFqlE,YACI,gEACJC,SAAU,CACR,QACA,SACA,WACA,mBACA,WACA,YAEFK,QAAS,CAAC,WnEsXVzuD,SoExY0B,CAC1B1yC,KAAM,WACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,kBAEFqlE,YAAa,uBACbC,SAAU,CACR,gBACA,UACA,YACA,cACA,cAEFK,QAAS,CACP,WpEyXFx6C,KqEzYsB,CACtB3mD,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,UACA,cAEFqlE,YAAa,oDACbC,SAAU,CACR,YACA,aACA,eACA,6BACA,8BACA,kBACA,4BACA,gCACA,kCrEyXF7W,QsE1YyB,CACzBjqF,KAAM,UACN2H,SAAU,aACV6zB,OAAQ,CACN,aACA,oBAEFqlE,YAAa,qJAGbC,SAAU,CACR,QACA,iBACA,gBACA,WAEFK,QAAS,CACP,WACA,MACA,StEwXFjX,SuE3Y0B,CAC1BlqF,KAAM,WACN2H,SAAU,aACV6zB,OAAQ,CACN,cACA,qBAEFqlE,YAAc,2LAMdC,SAAU,CACR,cACA,kBAEFK,QAAS,CACP,OACA,MACA,YvEwXFxsF,IwE5YqB,CACrB3U,KAAM,MACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,aAEFqlE,YACI,uCACJC,SAAU,CACR,MACA,QACA,mBACA,2BACA,6BAEFK,QAAS,CACP,WACA,UACA,WACA,SxEyXFnhF,MyE7YuB,CACvBhgB,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,WACA,cACA,6BACA,iCAEFqlE,YACI,4LACJC,SAAU,CACR,aACA,aACA,cACA,cACA,eACA,sBACA,wBACA,2BAEFK,QAAS,CAAC,OAAQ,QAAS,QzEyX3B3gF,K0E9YsB,CACtBxgB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,WAEFqlE,YACI,iGACJC,SAAU,CACR,YACA,aACA,WAEFK,QAAS,CACP,Q1EiYFt9E,K2E/YsB,CACtB7jB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,WAEFqlE,YACI,+EACJC,SAAU,CACR,WACA,QACA,YAEFK,QAAS,CACP,SACA,QACA,WACA,UACA,WACA,Q3E6XFxW,M4EhZuB,CACvB3qF,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,YAEFqlE,YACI,+IACJC,SAAU,CACR,+BAEFK,QAAS,CACP,OACA,MACA,SACA,a5EkYFhX,O6EjZwB,CACxBnqF,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,aAEFqlE,YACI,2DACJC,SAAU,CACR,YACA,UACA,MACA,SAEFK,QAAS,CACP,WACA,MACA,OACA,S7EgYFnwE,S8ElZ0B,CAC1BhxB,KAAM,WACN2H,SAAU,YACV6zB,OAAQ,CACN,QACA,kBAEFqlE,YAAa,uBACbC,SAAU,CACR,cACA,QACA,YACA,YACA,iBAEFK,QAAS,CACP,Q9EmYF/wD,W+EnZ4B,CAC5BpwC,KAAM,aACN2H,SAAU,YACV6zB,OAAQ,CACN,KACA,iBAEFqlE,YACI,yEACJC,SAAU,CACR,OACA,UACA,SAEFK,QAAS,CACP,MAAO,WAAY,c/EqYrBhY,UgFpZ2B,CAC3BnpF,KAAM,YACN2H,SAAU,YACV6zB,OAAQ,CACN,KACA,gBAEFqlE,YACI,4CACJC,SAAU,CACR,QACA,QAEFK,QAAS,CACP,MAAO,WAAY,ehFuYrBxlD,KiFrZsB,CACtB37C,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,cAEFqlE,YAAa,iLACbC,SAAU,CACR,cACA,aACA,sBAEFK,QAAS,CAAC,MAAO,QjF0YjBrlD,OkFtZwB,CACxB97C,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,gBAEFqlE,YAAa,wGACbC,SAAU,CACR,gBACA,gBACA,wBAEFK,QAAS,CAAC,MAAO,SlF6YjBzX,OmFzZwB,CACxB1pF,KAAM,SACN2H,SAAU,UACV6zB,OAAQ,CACN,QACA,gBAEFqlE,YAAa,6QACbC,SAAU,CACR,QACA,kBACA,oBAEFK,QAAS,CACP,SAAU,QAAS,SAAU,YAAa,kBAAmB,kBnF4Y/D/X,OoF1ZwB,CACxBppF,KAAM,SACN2H,SAAU,UACV6zB,OAAQ,CACN,KACA,aAEFqlE,YAAa,8IACbC,SAAU,CACR,KACA,KACA,sBAEFK,QAAS,CACP,SAAU,QAAS,SAAU,YAAa,kBAAmB,kBpF6Y/DxX,MqF3ZuB,CACvB3pF,KAAM,QACN2H,SAAU,UACV6zB,OAAQ,CACN,QACA,eAEFqlE,YAAa,8PACbC,SAAU,CACR,QACA,uBAEFK,QAAS,CACP,SAAU,SAAU,SAAU,YAAa,kBAAmB,kBrF+YhE5jD,OsF5ZwB,CACxBv9C,KAAM,SACN2H,SAAU,UACV6zB,OAAQ,CACN,gBAEFqlE,YAAa,mRACbC,SAAU,CACR,cACA,wBAEFK,QAAS,CACP,SAAU,SAAU,QAAS,YAAa,kBAAmB,kBtFiZ/D7X,UuF7Z2B,CAC3BtpF,KAAM,YACN2H,SAAU,UACV6zB,OAAQ,CACN,SACA,mBAEFqlE,YAAa,+DACbC,SAAU,CACR,SACA,UAEFK,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,kBAAmB,kBvFiZ5D5X,gBwF9ZiC,CACjCvpF,KAAM,kBACN2H,SAAU,UACV6zB,OAAQ,CACN,SACA,yBAEFqlE,YAAa,mEACbC,SAAU,CACR,SACA,SACA,YAEFK,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,YAAa,kBxFiZtD3X,cyF/Z+B,CAC/BxpF,KAAM,gBACN2H,SAAU,UACV6zB,OAAQ,CACN,UACA,uBAEFqlE,YAAa,gEACbC,SAAU,CACR,UACA,SACA,aAEFK,QAAS,CACP,SAAU,SAAU,QAAS,SAAU,YAAa,oBzFoZtD/W,Y0Fla6B,CAC7BpqF,KAAM,cACN2H,SAAU,gBACV6zB,OAAQ,CACN,kBAEFqlE,YAAa,2NACbC,SAAU,CACR,iBACA,kBAEFK,QAAS,CAAC,e1FwZV9W,Q2FnayB,CACzBrqF,KAAM,UACN2H,SAAU,gBACV6zB,OAAQ,CACN,cAEFqlE,YAAa,0KACbC,SAAU,CACR,aACA,cAEFK,QAAS,CAAC,gB3FyZV+E,Y4Fpa6B,CAC7BlmG,KAAM,cACN2H,SAAU,gBACV6zB,OAAQ,CACN,qBAEFqlE,YAAa,wIACbC,SAAU,CACR,qBAEFK,QAAS,CAAC,iB5F2ZV7W,W6Fra4B,CAC5BtqF,KAAM,aACN2H,SAAU,gBACV6zB,OAAQ,CACN,oBAEFqlE,YAAa,kRACbC,SAAU,CACR,oBAEFK,QAAS,CAAC,gB7F8ZVhhF,O8FxawB,CACxBngB,KAAM,SACN2H,SAAU,OACV6zB,OAAQ,CACN,WACA,mBAEFqlE,YAAa,6CACbC,SAAU,CACR,WACA,YACA,+BACA,aAEFK,QAAS,I9F2ZTgF,O+FzawB,CACxBnmG,KAAM,SACN2H,SAAU,OACV6zB,OAAQ,CACN,oBACA,8BAEFqlE,YAAa,gDACbC,SAAU,CACR,4CACA,UACA,cAEFK,QAAS,I/F6ZTzgG,MgG1auB,CACvBV,KAAM,QACN2H,SAAU,OACV6zB,OAAQ,CACN,oBACA,2BAEFqlE,YAAa,2BACbC,SAAU,CACR,qEACA,YACA,mBAEFK,QAAS,IhGgaT12F,IiG7aqB,CACrBzK,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,UAEFqlE,YACI,iGACJC,SAAU,CACR,cACA,cACA,eAEFK,QAAS,CACP,KACA,KACA,OACA,QjG6ZF73C,KkG9asB,CACtBtpD,KAAM,OACN2H,SAAU,UACV6zB,OAAQ,CACN,WAEFqlE,YACI,gGACJC,SAAU,CACR,eACA,eACA,eAEFK,QAAS,CACP,KACA,KACA,MACA,QlG8ZF9pF,GmG/aoB,CACpBrX,KAAM,KACN2H,SAAU,UACV6zB,OAAQ,CACN,SAEFqlE,YAAa,yCACbC,SAAU,CACR,aACA,aACA,YACA,WAEFK,QAAS,CACP,KACA,OACA,MACA,QnG+ZF9rE,GoGhboB,CACpBr1B,KAAM,KACN2H,SAAU,UACV6zB,OAAQ,CACN,SAEFqlE,YAAa,8CACbC,SAAU,CACR,aACA,aACA,YACA,WAEFK,QAAS,CACP,KACA,OACA,MACA,QpGkaF1hB,SqGnb0B,CAC1Bz/E,KAAM,WACN2H,SAAU,aACV6zB,OAAQ,CACN,uBACA,8BACA,uCACA,+CAEFqlE,YAAa,uDACbC,SAAU,CACR,oBACA,uBACA,2BACA,wCACA,oDAEFK,QAAS,CAAC,SAAU,QAAS,YrGma7BiF,KsGpbsB,CACtBpmG,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,eACA,gBAEFqlE,YAAa,oDACbC,SAAU,CACR,aACA,mBAEFK,QAAS,ItGyaTnpF,MuGrbuB,CACvBhY,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,cACA,uBACA,oCACA,8CAEFqlE,YAAa,2JACbC,SAAU,CACR,mCACA,mBACA,0BACA,mBACA,uBACA,yBACA,wBACA,0BACA,yBAEFK,QAAS,CAAC,SAAU,WAAY,YvGiahC1J,OwGtbwB,CACxBz3F,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,YAEFqlE,YAAa,qIACbC,SAAU,CACR,sBACA,uCACA,uBACA,iCACA,gDACA,qBAEFK,QAAS,CAAC,WAAY,QAAS,YxGwa/BzhB,QyGvbyB,CACzB1/E,KAAM,UACN2H,SAAU,aACV6zB,OAAQ,CACN,iBACA,uCAEFqlE,YAAa,8HACbC,SAAU,CACR,qCACA,oBACA,2BACA,gCAEFK,QAAS,CAAC,SAAU,QAAS,azG4a7BkF,S0G1b0B,CAC1BrmG,KAAM,WACN2H,SAAU,WACV6zB,OAAQ,CACN,+BACA,kCAEFqlE,YAAa,wDACbC,SAAU,CACR,yBACA,4BAEFK,QAAS,I1G+aTmF,U2G3b2B,CAC3BtmG,KAAM,YACN2H,SAAU,WACV6zB,OAAQ,CACN,wCACA,kCAEFqlE,YAAa,0DACbC,SAAU,CACR,gDACA,mDAEFK,QAAS,I3GkbTvX,I4G9bqB,CACrB5pF,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,UACA,aAEFqlE,YAAa,uFACbC,SAAU,CACR,iBACA,gBACA,WAEFK,QAAS,CACP,MAAO,KAAM,Q5GibfxrC,I6G/bqB,CACrB31D,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,QACA,UAEFqlE,YAAa,0DACbC,SAAU,CACR,WACA,YACA,QACA,SAEFK,QAAS,CACP,MAAO,KAAM,Q7GibfoF,Q8GhcyB,CACzBvmG,KAAM,UACN2H,SAAU,UACV6zB,OAAQ,CACN,SACA,iBAEFqlE,YAAa,4JACbC,SAAU,CACR,aACA,kBACA,UACA,cACA,2BAEFK,QAAS,CACP,MAAO,KAAM,Q9GibfrX,G+GjcoB,CACpB9pF,KAAM,KACN2H,SAAU,UACV6zB,OAAQ,CACN,SACA,YAEFqlE,YAAa,mFACbC,SAAU,CACR,gBACA,iBACA,UAEFK,QAAS,CACP,MAAO,MAAO,Q/GobhBtX,IgHlcqB,CACrB7pF,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,UACA,aAEFqlE,YAAa,2GACbC,SAAU,CACR,iBACA,kBACA,gBACA,WAEFK,QAAS,CACP,MAAO,MAAO,OhHsbhBqF,UiHrc2B,CAC3BxmG,KAAM,YACN2H,SAAU,SACV6zB,OAAQ,CAAC,+BACTqlE,YACE,2GAEFC,SAAU,CACR,uBACA,uBACA,yBAEFK,QAAS,CAAC,MAAO,YjH0bjBt/F,OkHtcwB,CACxB7B,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,uBACA,6BAEFqlE,YAAa,iKACbC,SAAU,CACR,mBACA,mBACA,eACA,kBACA,mBAEFK,QAAS,CACP,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UlHubxG5qF,MmHvcuB,CACvBvW,KAAM,QACN2H,SAAU,SACV6zB,OAAQ,CACN,YAEFqlE,YAAa,6DACbC,SAAU,CACR,yBACA,WACA,UACA,wBAEFK,QAAS,CACP,SnH0bF5W,MoHxcuB,CACvBvqF,KAAM,QACN2H,SAAU,SACV6zB,OAAQ,CACN,eAEFqlE,YAAa,0EACbC,SAAU,CACR,+BACA,+BACA,gCAEFK,QAAS,CACP,WACA,QpH2bFzgD,OqHzcwB,CACxB1gD,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,oBAEFqlE,YAAa,0CACbC,SAAU,CACR,uBACA,eACA,gBAEFK,QAAS,CAAC,MAAO,sBrH8bjBlkB,WsH1c4B,CAC5Bj9E,KAAM,aACN2H,SAAU,SACV6zB,OAAQ,CACN,KACA,iBAEFqlE,YAAa,2CACbC,SAAU,CACR,yBACA,KACA,iBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UtH6brG3W,IuH3cqB,CACrBxqF,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,UAEFqlE,YAAa,wCACbC,SAAU,CACR,oBACA,uCAEFK,QAAS,CACP,SAAU,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UvHgc3GsF,KwH5csB,CACtBzmG,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,UACA,cAEFqlE,YAAa,4aACbC,SAAU,CACR,YACA,eACA,kCACA,WAEFK,QAAS,CACP,SAAU,MAAO,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UxH8b1GnnE,KyH7csB,CACtBh6B,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,YACA,kBAEFqlE,YAAa,CACX,kFACA,2GACA,mEACA,oEACA,0DACA,+HAEFC,SAAU,CACR,sBACA,UACA,aACA,uBACA,UACA,aACA,aACA,wBACA,qCAEFK,QAAS,CAAC,WAAY,oBzHobtBp+E,I0H9cqB,CACrB/iB,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,YACA,SAEFqlE,YAAa,6LAGbC,SAAU,CACR,4BACA,yBAEFK,QAAS,CACP,WACA,U1H+bF7nC,kB2H/cmC,CACnCt5D,KAAM,oBACN2H,SAAU,SACV6zB,OAAQ,CACN,wBAEFqlE,YAAa,iOAIbC,SAAU,CACR,+BACA,wCACA,iCACA,wCAEFK,QAAS,CAAC,SAAU,SAAU,W3Hgc9BxvC,S4Hhd0B,CAC1B3xD,KAAM,WACN2H,SAAU,SACV6zB,OAAQ,CACN,cACA,iBACA,oBAEFqlE,YAAa,yGACbC,SAAU,CACR,cACA,iBACA,yBACA,qBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,U5HictGh/F,O6HjdwB,CACxBnC,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,mBAEFqlE,YAAa,4BACbC,SAAU,CACR,wBACA,wCACA,oCAEFK,QAAS,CAAC,OAAQ,MAAO,Y7HsczBjsF,Q8HldyB,CACzBlV,KAAM,UACN2H,SAAU,SACV6zB,OAAQ,CACN,cAEFqlE,YAAa,uEACbC,SAAU,CACR,yBACA,UACA,iBACA,WAEFK,QAAS,CACP,SAAU,SAAU,OAAQ,Y9Hqc9BxiG,Q+HndyB,CACzBqB,KAAM,UACN2H,SAAU,SACV6zB,OAAQ,CACN,wBAEFqlE,YAAa,0FACbC,SAAU,CACR,oBACA,4EACA,uCACA,gBAEFK,QAAS,CAAC,MAAO,OAAQ,W/HuczBlyD,IgIpdqB,CACrBjvC,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,UAEFqlE,YAAa,oCACbC,SAAU,CACR,oBACA,SACA,SAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UhIwc3GzW,KiIrdsB,CACtB1qF,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,WAEFqlE,YAAa,kDACbC,SAAU,CACR,qBACA,iCACA,WAEFK,QAAS,CACP,QjIycFjkB,KkItdsB,CACtBl9E,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,WAEFqlE,YAAa,2EACbC,SAAU,CACR,6BACA,qFAEFK,QAAS,CACP,QlI2cFuF,KmIvdsB,CACtB1mG,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,cAEFqlE,YAAa,6DACbC,SAAU,CACR,2CACA,wBAEFK,QAAS,CACP,WAAY,MAAO,UnI4crBwF,mBoIxdoC,CACpC3mG,KAAM,qBACN2H,SAAU,SACV6zB,OAAQ,CACN,+BACA,uCACA,iDACA,uCACA,kDAEFqlE,YAAa,qEACbC,SAAU,CACR,qBACA,+BACA,kCACA,8CACA,mCAEFK,QAAS,CACP,SAAU,iBAAkB,oBAAqB,UpIscnDyF,eqIzdgC,CAChC5mG,KAAM,iBACN2H,SAAU,SACV6zB,OAAQ,CACN,yBACA,6BACA,oCAEFqlE,YAAa,yDACbC,SAAU,CACR,4CAEFK,QAAS,CACP,SAAU,oBAAqB,qBAAsB,UrI6cvD0F,kBsI1dmC,CACnC7mG,KAAM,oBACN2H,SAAU,SACV6zB,OAAQ,CACN,4BACA,gCACA,uCAEFqlE,YAAa,4DACbC,SAAU,CACR,+CAEFK,QAAS,CACP,SAAU,iBAAkB,qBAAsB,UtI8cpDh9F,IuI3dqB,CACrBnE,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,mBACA,4BAEFqlE,YAAa,4IACbC,SAAU,CACR,yBACA,uCAEFK,QAAS,CAAC,SAAU,YvIgdpB2F,KwI5dsB,CACtB9mG,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,UACA,aACA,qBACA,YACA,eACA,wBAEFqlE,YAAa,mCACbC,SAAU,CACR,UACA,aACA,oBACA,yBACA,iBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,QAAS,OAAQ,UAAW,SAAU,QAAS,YAAa,UxIyc1G4F,gByI7diC,CACjC/mG,KAAM,kBACN2H,SAAU,SACV6zB,OAAQ,CACN,wBACA,kCAEFqlE,YAAa,uIACbC,SAAU,CACR,iCACA,wDACA,kBACA,6DACA,MACA,qEACA,OAEFK,QAAS,CAAC,SzI6cVl9D,M0I9duB,CACvBjkC,KAAM,QACN2H,SAAU,OACV6zB,OAAQ,CACN,YACA,iBACA,oBACA,0BACA,iBAEFqlE,YACI,iFACJC,SAAU,CACR,MACA,UACA,cACA,kBACA,gBACA,oBACA,+BACA,eAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,OAAQ,UAAW,SAAU,QAAS,YAAa,U1IwczG3mE,O2I/dwB,CACxBx6B,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,kBACA,iCAEFqlE,YAAa,mBACbC,SAAU,CACR,2BACA,uBACA,2BACA,oBACA,6BAEFK,QAAS,CACP,OAAQ,SAAU,UAAW,Y3Igd/B1mE,Q4IheyB,CACzBz6B,KAAM,UACN2H,SAAU,SACV6zB,OAAQ,CACN,qBAEFqlE,YAAa,qEACbC,SAAU,CACR,sCACA,oCACA,iCACA,kCAEFK,QAAS,CACP,OAAQ,UAAW,W5ImdrB6F,O6IjewB,CACxBhnG,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,mBACA,uBAEFqlE,YAAa,2JAEbC,SAAU,CACR,yBACA,wCACA,8CACA,+DAEFK,QAAS,CACP,SAAU,mB7IkdZ96C,e8IlegC,CAChCrmD,KAAM,iBACN2H,SAAU,SACV6zB,OAAQ,CACN,wBACA,2BACA,oCAEFqlE,YAAa,2JAEbC,SAAU,CACR,yBACA,2CACA,kDAEFK,QAAS,CACP,MAAO,Q9ImdTt8D,I+IneqB,CACrB7kC,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,iBAEFqlE,YAAa,uCACbC,SAAU,CACR,uBACA,YACA,aAEFK,QAAS,CAAC,SAAU,mB/IwdpBzmF,KgJpesB,CACtB1a,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,WAEFqlE,YAAa,kCACbC,SAAU,CACR,YACA,sBACA,yBACA,UACA,aAEFK,QAAS,CACP,SAAU,QAAS,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,UAAW,SAAU,QAAS,YAAa,UhJsdnH/7F,KiJresB,CACtBpF,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,UACA,oBAEFqlE,YAAa,2GACbC,SAAU,CACR,mBACA,wCACA,+CACA,iDACA,qCAEFK,QAAS,CAAC,MAAO,SAAU,YjJud3B/iE,QkJteyB,CACzBp+B,KAAM,UACN2H,SAAU,SACV6zB,OAAQ,CACN,cAEFqlE,YAAa,6DACbC,SAAU,CACR,mBACA,mBACA,mBACA,oBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,SAAU,QAAS,YAAa,UlJydvG7mE,OmJvewB,CACxBt6B,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,eACA,6BACA,yBACA,uCAEFqlE,YAAa,igBASbC,SAAU,CACR,mBACA,SACA,qBACA,mBACA,YACA,UACA,UACA,oCACA,KAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,QAAS,YAAa,UnJ0cxGvW,MoJxeuB,CACvB5qF,KAAM,QACN2H,SAAU,SACV6zB,OAAQ,CACN,YAEFqlE,YAAa,oGACbC,SAAU,CACR,mCACA,YAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,YAAa,UpJ6dzG93C,UqJze2B,CAC3BrpD,KAAM,YACN2H,SAAU,SACV6zB,OAAQ,CACN,KACA,gBAEFqlE,YAAa,qBACbC,SAAU,CACR,yBACA,KACA,gBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,UrJ4drGr+E,MsJ1euB,CACvB9iB,KAAM,QACN2H,SAAU,SACV6zB,OAAQ,CACN,WACA,cACA,sBACA,aACA,gBACA,yBAEFqlE,YAAa,oCACbC,SAAU,CACR,WACA,cACA,yBACA,kBAEFK,QAAS,CACP,SAAU,MAAO,OAAQ,WAAY,MAAO,OAAQ,QAAS,OAAQ,UAAW,SAAU,QAAS,ctJwdrGx2C,IuJ3eqB,CACrB3qD,KAAM,MACN2H,SAAU,SACV6zB,OAAQ,CACN,UAEFqlE,YAAa,4CACbC,SAAU,CACR,yBAEFK,QAAS,CACP,SvJieF8F,KwJ5esB,CACtBjnG,KAAM,OACN2H,SAAU,SACV6zB,OAAQ,CACN,WAEFqlE,YAAa,oDACbC,SAAU,CACR,0BAEFK,QAAS,CACP,QxJkeF+F,UyJ7e2B,CAC3BlnG,KAAM,YACN2H,SAAU,UACV6zB,OAAQ,CACN,oBAEFqlE,YAAa,0DACbC,SAAU,CACR,uEACA,wEACA,sBAEFK,QAAS,CACP,QAAS,SzJieXgG,M0J9euB,CACvBnnG,KAAM,QACN2H,SAAU,UACV6zB,OAAQ,CACN,YAEFqlE,YAAa,kEACbC,SAAU,CACR,2BACA,wBACA,YAEFK,QAAS,CACP,OAAQ,c1JkeViG,K2J/esB,CACtBpnG,KAAM,OACN2H,SAAU,UACV6zB,OAAQ,CACN,aAEFqlE,YAAa,gEACbC,SAAU,CACR,6CACA,yBACA,uBACA,aAEFK,QAAS,CACP,QAAS,c3JoeXkG,S4Jlf0B,CAC1BrnG,KAAM,WACN2H,SAAU,UACV6zB,OAAQ,CACN,4BACA,sCAEFqlE,YAAa,4DACbC,SAAU,CACR,aACA,iBACA,wBACA,6BACA,yDAEFK,QAAS,CAAC,aAAc,iB5JsexBtW,a6Jrf8B,CAC9B7qF,KAAM,eACN2H,SAAU,cACV6zB,OAAQ,CACN,sBAEFqlE,YAAa,kEACbC,SAAU,CACR,sBAEFK,QAAS,CAAC,sBAAuB,eAAgB,c7J4ejDrW,oB8JtfqC,CACrC9qF,KAAM,sBACN2H,SAAU,cACV6zB,OAAQ,CACN,6BAEFqlE,YAAa,qFACbC,SAAU,CACR,6BAEFK,QAAS,CAAC,eAAgB,eAAgB,c9J8e1C5yC,U+Jxf2B,CAC3BvuD,KAAM,YACN2H,SAAU,cACV6zB,OAAQ,CACN,KACA,gBAEFqlE,YAAa,mCACbC,SAAU,CACR,KACA,oBACA,MAEFK,QAAS,CAAC,eAAgB,sBAAuB,eAAgB,U/J4ejE3yC,MgKzfuB,CACvBxuD,KAAM,QACN2H,SAAU,cACV6zB,OAAQ,CACN,YAEFqlE,YAAa,6IACbC,SAAU,CACR,WACA,KACA,aACA,YAEFK,QAAS,CAAC,chK6eVmG,aiK1f8B,CAC9BtnG,KAAM,eACN2H,SAAU,cACV6zB,OAAQ,CACN,sBAEFqlE,YAAa,6EACbC,SAAU,CACR,8CAEFK,QAAS,IjKifTpW,OkK3fwB,CACxB/qF,KAAM,SACN2H,SAAU,cACV6zB,OAAQ,CAAC,aACTqlE,YACE,mKAEFC,SAAU,CACR,YACA,cACA,YACA,2BAEFK,QAAS,CAAC,UlK+eVoG,YmK5f6B,CAC7BvnG,KAAM,cACN2H,SAAU,cACV6zB,OAAQ,CACN,kBAEFqlE,YAAa,4OACbC,SAAU,CACR,0BAEFK,QAAS,CAAC,eAAgB,cnKmf1BqG,aoK7f8B,CAC9BxnG,KAAM,eACN2H,SAAU,cACV6zB,OAAQ,CACN,kBACA,sBAEFqlE,YAAa,kEACbC,SAAU,CACR,kBACA,sBAEFK,QAAS,CAAC,eAAgB,sBAAuB,cpKkfjDsG,WqK9f4B,CAC5BznG,KAAM,aACN2H,SAAU,cACV6zB,OAAQ,CACN,oBACA,4BACA,6BACA,qCACA,sCAEFqlE,YACI,0CACJC,SAAU,CACR,mBACA,2BACA,8BACA,yCACA,4CACA,6CAEFK,QAAS,CAAC,SAAU,crK2epBpqF,OsK/fwB,CACxB/W,KAAM,SACN2H,SAAU,cACV6zB,OAAQ,CACN,WACA,cACA,mBACA,eACA,oBACA,0BAEFqlE,YACI,0BACJC,SAAU,CACR,WACA,iBACA,kBAEFK,QAAS,CAAC,aAAc,ctK8exBuG,UuKhgB2B,CAC3B1nG,KAAM,YACN2H,SAAU,cACV6zB,OAAQ,CACN,iBACA,sBACA,kBACA,uBACA,6BAEFqlE,YACI,iCACJC,SAAU,CACR,oBACA,yBAEFK,QAAS,CAAC,aAAc,WvKmfxBtwE,QwKngByB,CACzB7wB,KAAM,UACN2H,SAAU,aACV6zB,OAAQ,CACN,iBAEFqlE,YACI,8EAEJC,SAAU,CACR,gBACA,gBACA,gBACA,qBACA,yBAEFK,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,iBAAkB,gBxKmf5E5qC,eyKpgBgC,CAChCv2D,KAAM,iBACN2H,SAAU,aACV6zB,OAAQ,CACN,wBAEFqlE,YACI,0HAEJC,SAAU,CACR,uBACA,uBACA,uBACA,4BACA,4BACA,iCACA,uCACA,oCACA,iCACA,kCAEFK,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,UAAW,gBzK+erEtlE,Y0KrgB6B,CAC7B77B,KAAM,cACN2H,SAAU,aACV6zB,OAAQ,CACN,qBAEFqlE,YACI,uHAEJC,SAAU,CACR,wBACA,wBACA,wBACA,yBACA,qBACA,iBACA,4BACA,qCAEFK,QAAS,CACP,UAAW,mB1Kkfb3hD,U2KtgB2B,CAC3Bx/C,KAAM,YACN2H,SAAU,aACV6zB,OAAQ,CACN,mBAEFqlE,YACI,+IACJC,SAAU,CACR,8BACA,6BAEFK,QAAS,CACP,QAAS,UAAW,UAAW,SAAU,YAAa,WAAY,Y3K0fpEvlD,M4KvgBuB,CACvB57C,KAAM,QACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,eAEFqlE,YACI,wFACJC,SAAU,CACR,WACA,WACA,UACA,YACA,SACA,gBAEFK,QAAS,CACP,UAAW,UAAW,SAAU,YAAa,WAAY,UAAW,YAAa,c5KsfnFwG,U6KxgB2B,CAC3B3nG,KAAM,YACN2H,SAAU,aACV6zB,OAAQ,CACN,mBAEFqlE,YACI,uHACJC,SAAU,CACR,8BACA,sBACA,uBACA,2BACA,mCAEFK,QAAS,CACP,UAAW,iBAAkB,cAAe,U7Kyf9C97C,O8KzgBwB,CACxBrlD,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,QACA,gBAEFqlE,YACI,qIACJC,SAAU,CACR,QACA,UACA,UACA,YACA,UACA,UACA,iBAEFK,QAAS,CACP,QAAS,UAAW,UAAW,YAAa,WAAY,Y9Kuf1D77C,S+K1gB0B,CAC1BtlD,KAAM,WACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,kBAEFqlE,YACI,yGACJC,SAAU,CACR,WACA,UACA,UACA,YACA,YAEFK,QAAS,CACP,QAAS,UAAW,YAAa,UAAW,Y/K0f9CtlD,QgL3gByB,CACzB77C,KAAM,UACN2H,SAAU,aACV6zB,OAAQ,CACN,QACA,iBAEFqlE,YACI,6IACJC,SAAU,CACR,QACA,UACA,UACA,YACA,UACA,iBAEFK,QAAS,CACP,QAAS,UAAW,SAAU,YAAa,WAAY,YhL0fzD/7C,UiL5gB2B,CAC3BplD,KAAM,YACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,mBAEFqlE,YACI,0GACJC,SAAU,CACR,WACA,UACA,UACA,YACA,YAEFK,QAAS,CACP,QAAS,UAAW,SAAU,UAAW,WAAY,YjL4fvD1X,QkL7gByB,CACzBzpF,KAAM,UACN2H,SAAU,aACV6zB,OAAQ,CACN,SACA,iBAEFqlE,YACI,uGACJC,SAAU,CACR,WACA,WACA,UACA,YACA,SACA,eACA,kBAEFK,QAAS,CACP,QAAS,UAAW,SAAU,YAAa,WAAY,UAAW,clL6fpEyG,amLhhB8B,CAC9B5nG,KAAM,eACN2H,SAAU,MACV6zB,OAAQ,CACN,4BAEFqlE,YACI,8LACJC,SAAU,CACR,gCAEFK,QAAS,CACP,WAAY,eAAgB,gBAAiB,gBnLqgB/C3kB,coLjhB+B,CAC/Bx8E,KAAM,gBACN2H,SAAU,MACV6zB,OAAQ,CACN,6BAEFqlE,YACI,8LACJC,SAAU,CACR,4CACA,qDAEFK,QAAS,CACP,WAAY,eAAgB,qBpLqgB9B0G,YqLlhB6B,CAC7B7nG,KAAM,cACN2H,SAAU,MACV6zB,OAAQ,CACN,oBAEFqlE,YACI,2IACJC,SAAU,CACR,mCAEFK,QAAS,CACP,oBrLugBFzkB,asLnhB8B,CAC9B18E,KAAM,eACN2H,SAAU,MACV6zB,OAAQ,CACN,4BAEFqlE,YACI,wIACJC,SAAU,CACR,2CACA,oDAEFK,QAAS,CACP,WAAY,kBtLugBd2G,YuLphB6B,CAC7B9nG,KAAM,cACN2H,SAAU,MACV6zB,OAAQ,CACN,2BAEFqlE,YACI,wMACJC,SAAU,CACR,oCACA,qCAEFK,QAAS,CACP,WAAY,eAAgB,kBvLwgB9B4G,gBwLrhBiC,CACjC/nG,KAAM,kBACN2H,SAAU,MACV6zB,OAAQ,CACN,iCAEFqlE,YACI,kJACJC,SAAU,CACR,mCACA,oCAEFK,QAAS,CACP,cAAe,YxLygBjB6G,YyLthB6B,CAC7BhoG,KAAM,cACN2H,SAAU,MACV6zB,OAAQ,CACN,oBAEFqlE,YACI,gMACJC,SAAU,CACR,0BAEFK,QAAS,CACP,iBzL2gBF8G,Q0LvhByB,CACzBjoG,KAAM,UACN2H,SAAU,MACV6zB,OAAQ,CACN,eACA,wBAEFqlE,YACI,sNACJC,SAAU,CACR,wBACA,+BAEFK,QAAS,CACP,WAAY,eAAgB,kB1L0gB9BxkB,iB2LxhBkC,CAClC38E,KAAM,mBACN2H,SAAU,MACV6zB,OAAQ,CACN,gCAEFqlE,YACI,gJACJC,SAAU,CACR,+CACA,wDAEFK,QAAS,CACP,WAAY,eAAgB,kB3L4gB9B+G,S4LzhB0B,CAC1BloG,KAAM,WACN2H,SAAU,MACV6zB,OAAQ,CACN,wBAEFqlE,YACI,iIACJC,SAAU,CACR,uCACA,gDAEFK,QAAS,CACP,eAAgB,kB5L+gBlBgH,O6L5hBwB,CACxBnoG,KAAM,SACN2H,SAAU,SACV6zB,OAAQ,CACN,mBAEFqlE,YAAa,2DACbC,SAAU,CACR,8BACA,2BACA,sCAEFK,QAAS,I7LihBTiH,M8L7hBuB,CACvBpoG,KAAM,QACN2H,SAAU,SACV6zB,OAAQ,CACN,cACA,kBAEFqlE,YAAa,kGACbC,SAAU,CACR,2BACA,mCACA,iCAEFK,QAAS,I9LmhBTnW,I+LhiBqB,CACrBhrF,KAAM,MACN2H,SAAU,UACV6zB,OAAQ,CACN,UAEFqlE,YAAa,6GACbC,SAAU,CACR,WACA,YACA,UAEFK,QAAS,I/LqhBTzyC,KgMjiBsB,CACtB1uD,KAAM,OACN2H,SAAU,UACV6zB,OAAQ,CACN,WAEFqlE,YAAa,4HACbC,SAAU,CACR,YACA,aACA,WAEFK,QAAS,IhMwhBTkH,OiMpiBwB,CACxBroG,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,uBACA,aAEFqlE,YAAa,4CACbC,SAAU,CACR,qBACA,uBACA,uBACA,0BACA,2BAEFK,QAAS,CACP,MACA,OACA,SACA,MACA,OACA,MACA,MACA,ajM8gBFmH,IkMriBqB,CACrBtoG,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,oBACA,UAEFqlE,YAAa,8KACbC,SAAU,CACR,kBACA,kBAEFK,QAAS,CACP,OACA,SACA,MACA,QlMshBFh5F,ImMtiBqB,CACrBnI,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,oBACA,SACA,qBAEFqlE,YAAa,6HACbC,SAAU,CACR,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFK,QAAS,CACP,OACA,SACA,MACA,OACA,MACA,MACA,anM8gBFoH,KoMviBsB,CACtBvoG,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,qBACA,UACA,sBAEFqlE,YAAa,mDACbC,SAAU,CACR,mBACA,qBACA,qBACA,wBACA,wBACA,8BAEFK,QAAS,CACP,MACA,SACA,MACA,OACA,MACA,MACA,apMghBFqH,OqMxiBwB,CACxBxoG,KAAM,SACN2H,SAAU,aACV6zB,OAAQ,CACN,uBACA,aAEFqlE,YAAa,mLACbC,SAAU,CACR,kBACA,yBAEFK,QAAS,CACP,MACA,OACA,MACA,OACA,MACA,MACA,WACA,gBrMqhBFn5F,IsMziBqB,CACrBhI,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,oBACA,SACA,qBAEFqlE,YAAa,6HACbC,SAAU,CACR,kBACA,oBACA,oBACA,uBACA,uBACA,gCACA,iCAEFK,QAAS,CACP,MACA,OACA,SACA,OACA,MACA,MACA,atMihBFjyC,KuM1iBsB,CACtBlvD,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,qBACA,UACA,4BAEFqlE,YAAa,2HACbC,SAAU,CACR,sBACA,8BACA,uBAEFK,QAAS,CACP,MACA,OACA,MACA,SACA,OACA,MACA,MACA,avMqhBFhwE,KwM3iBsB,CACtBnxB,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,qBACA,WAEFqlE,YAAa,qCACbC,SAAU,CACR,gBACA,kBACA,sBAEFK,QAAS,CACP,MACA,OACA,MACA,SACA,MACA,MACA,MACA,axMuhBFsH,YyM5iB6B,CAC7BzoG,KAAM,cACN2H,SAAU,aACV6zB,OAAQ,CACN,iCACA,gDACA,+BAEFqlE,YAAa,uWACbC,SAAU,CACR,kCACA,yCACA,gCACA,yCAEFK,QAAS,CACP,OACA,SACA,MACA,MACA,OACA,MACA,MACA,azMshBFuH,I0M7iBqB,CACrB1oG,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,oBACA,SACA,oBACA,wBACA,oCAEFqlE,YAAa,iLACbC,SAAU,CACR,eACA,oBACA,mCACA,8BACA,2BAEFK,QAAS,CACP,MACA,OACA,MACA,SACA,OACA,MACA,a1MqhBF3uE,I2M9iBqB,CACrBxyB,KAAM,MACN2H,SAAU,aACV6zB,OAAQ,CACN,oBACA,SACA,qBAEFqlE,YAAa,iCACbC,SAAU,CACR,kBACA,oBACA,qBAEFK,QAAS,CACP,MACA,OACA,SACA,MACA,OACA,MACA,a3M0hBFlW,S4M/iB0B,CAC1BjrF,KAAM,WACN2H,SAAU,aACV6zB,OAAQ,CACN,yBACA,cACA,yBACA,6BACA,yCAEFqlE,YAAa,gIACbC,SAAU,CACR,oBACA,yBACA,wCACA,mCACA,gCAEFK,QAAS,CACP,MACA,OACA,MACA,SACA,MACA,OACA,MACA,Q5MshBFwH,K6MhjBsB,CACtB3oG,KAAM,OACN2H,SAAU,aACV6zB,OAAQ,CACN,aAEFqlE,YAAa,iIACbC,SAAU,CACR,kCACA,wGAEFK,QAAS,CACP,MACA,OACA,MACA,SACA,MACA,OACA,MACA,Q7MgiBFh1E,K8MnjBsB,CACtBnsB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,oDACbC,SAAU,CACR,YACA,kBAEFK,QAAS,CACP,MACA,OACA,S9MsiBFv9E,M+MpjBuB,CACvB5jB,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,6FACbC,SAAU,CACR,cAEFK,QAAS,CACP,OACA,QACA,U/MwiBFnoB,KgNrjBsB,CACtBh5E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,8CACbC,SAAU,CACR,YACA,iBACA,WAEFK,QAAS,CACP,MACA,ShNwiBFjoB,MiNtjBuB,CACvBl5E,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,gHACbC,SAAU,CACR,WACA,cAEFK,QAAS,CACP,QACA,UjN0iBF/nB,KkNvjBsB,CACtBp5E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,8CACbC,SAAU,CACR,UACA,iBACA,aAEFK,QAAS,CACP,MACA,OACA,SlNyiBF7nB,MmNxjBuB,CACvBt5E,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,2GACbC,SAAU,CACR,cAEFK,QAAS,CACP,QACA,UnN6iBF3nB,KoNzjBsB,CACtBx5E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,2CACbC,SAAU,CACR,YACA,iBACA,WAEFK,QAAS,CACP,OACA,OACA,SpN2iBFznB,MqN1jBuB,CACvB15E,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,2CACbC,SAAU,CACR,cAEFK,QAAS,CACP,QACA,UrN+iBFp0E,KsN3jBsB,CACtB/sB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,kDACbC,SAAU,CACR,YACA,kBAEFK,QAAS,CACP,MACA,OACA,StN8iBFr9E,MuN5jBuB,CACvB9jB,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,8FACbC,SAAU,CACR,cAEFK,QAAS,CACP,QACA,UvNijBF70E,KwN7jBsB,CACtBtsB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,qDACbC,SAAU,CACR,YACA,kBAEFK,QAAS,CACP,MACA,OACA,SxNgjBFp9E,MyN9jBuB,CACvB/jB,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,YAEFqlE,YAAa,mGACbC,SAAU,CACR,cAEFK,QAAS,CACP,QACA,UzNmjBF7tE,M0N/jBuB,CACvBtzB,KAAM,QACN2H,SAAU,eACV6zB,OAAQ,CACN,eAEFqlE,YACI,qEACJC,SAAU,CACR,mBACA,wBACA,iBACA,iBACA,eAEFK,QAAS,CACP,MACA,MACA,Q1N8iBFx3E,I2NhkBqB,CACrB3pB,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,sCACbC,SAAU,CACR,SACA,kBACA,eACA,cACA,2BAEFK,QAAS,CACP,OACA,MACA,Q3NgjBFn9E,K4NjkBsB,CACtBhkB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,iDACbC,SAAU,CACR,aAEFK,QAAS,CACP,OACA,OACA,S5NqjBF5mB,I6NlkBqB,CACrBv6E,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,6DACbC,SAAU,CACR,SACA,cAEFK,QAAS,CACP,MACA,MACA,Q7NqjBF1mB,K8NnkBsB,CACtBz6E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,oDACbC,SAAU,CACR,UACA,eAEFK,QAAS,CACP,OACA,OACA,S9NsjBFxmB,I+NpkBqB,CACrB36E,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,4DACbC,SAAU,CACR,SACA,cAEFK,QAAS,CACP,MACA,MACA,Q/NujBFtmB,KgOrkBsB,CACtB76E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,wEACbC,SAAU,CACR,UACA,eAEFK,QAAS,CACP,OACA,OACA,ShOwjBFr1B,IiOtkBqB,CACrB9rE,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,0DACbC,SAAU,CACR,SACA,cAEFK,QAAS,CACP,MACA,MACA,QjOyjBFnmB,KkOvkBsB,CACtBh7E,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,sEACbC,SAAU,CACR,UACA,eAEFK,QAAS,CACP,OACA,OACA,SlO0jBFtyE,ImOxkBqB,CACrB7uB,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,oCACbC,SAAU,CACR,SACA,kBACA,cACA,cACA,2BAEFK,QAAS,CACP,OACA,MACA,QnOwjBFl9E,KoOzkBsB,CACtBjkB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,+CACbC,SAAU,CACR,aAEFK,QAAS,CACP,OACA,SpO8jBFlyE,IqO1kBqB,CACrBjvB,KAAM,MACN2H,SAAU,eACV6zB,OAAQ,CACN,UAEFqlE,YAAa,uCACbC,SAAU,CACR,WACA,sBACA,cACA,eAEFK,QAAS,CACP,OACA,MACA,QrO2jBFj9E,KsO3kBsB,CACtBlkB,KAAM,OACN2H,SAAU,eACV6zB,OAAQ,CACN,WAEFqlE,YAAa,kDACbC,SAAU,CACR,YACA,yBAEFK,QAAS,CACP,OACA,StOikBF5vF,GuO9kBoB,CACpBvR,KAAM,KACN2H,SAAU,QACV6zB,OAAQ,CACN,YACA,eAEFqlE,YAAa,8BACbC,SAAU,CACR,eACA,aACA,oBAEFK,QAAS,IvOkkBT9wC,OwO/kBwB,CACxBrwD,KAAM,SACN2H,SAAU,QACV6zB,OAAQ,CACN,YACA,sBACA,gCAEFqlE,YAAa,iDACbC,SAAU,CACR,0BACA,6BACA,iCACA,8BACA,iDAEFK,QAAS,IxOkkBTjjF,MyOllBuB,CACvBle,KAAM,QACN2H,SAAU,QACV6zB,OAAQ,CACN,YAEFqlE,YAAa,uFACbC,SAAU,CACR,aACA,gBACA,gBACA,sBACA,wBAEFK,QAAS,IzOqkBT5/E,O0OnlBwB,CACxBvhB,KAAM,SACN2H,SAAU,QACV6zB,OAAQ,CACN,gBACA,4BAEFqlE,YAAa,wCACbC,SAAU,CACR,cACA,iBACA,aACA,iBAEFK,QAAS,CAAC,U1OskBVyH,I2OplBqB,CACrB5oG,KAAM,MACN2H,SAAU,QACV6zB,OAAQ,CACN,cAEFqlE,YAAa,4BACbC,SAAU,CACR,UAEFK,QAAS,CAAC,MAAO,Q3O2kBjB0H,I4OrlBqB,CACrB7oG,KAAM,MACN2H,SAAU,QACV6zB,OAAQ,CACN,cAEFqlE,YAAa,2BACbC,SAAU,CACR,WAEFK,QAAS,CAAC,MAAO,Q5O4kBjB2H,I6OtlBqB,CACrB9oG,KAAM,MACN2H,SAAU,QACV6zB,OAAQ,CACN,cAEFqlE,YAAa,iCACbC,SAAU,CACR,YAEFK,QAAS,CAAC,MAAO,Q7O6kBjB9oF,M8OvlBuB,CACvBrY,KAAM,QACN2H,SAAU,QACV6zB,OAAQ,CACN,YAEFqlE,YAAa,6CACbC,SAAU,CACR,WACA,eACA,aACA,mBAEFK,QAAS,CAAC,aAAc,YAAa,aAAc,W9O2kBnDrhF,U+OxlB2B,CAC3B9f,KAAM,YACN2H,SAAU,QACV6zB,OAAQ,CACN,gBAEFqlE,YAAa,6CACbC,SAAU,CACR,eACA,iBACA,2BAEFK,QAAS,CAAC,aAAc,YAAa,aAAc,W/O6kBnD9zE,WgPzlB4B,CAC5BrtB,KAAM,aACN2H,SAAU,QACV6zB,OAAQ,CACN,iBAEFqlE,YAAa,uDACbC,SAAU,CACR,gBACA,gBACA,iBACA,4BAEFK,QAAS,CAAC,YAAa,YAAa,aAAc,WhP6kBlDn5D,UiP1lB2B,CAC3BhoC,KAAM,YACN2H,SAAU,QACV6zB,OAAQ,CACN,gBAEFqlE,YAAa,qHAEbC,SAAU,CACR,eACA,iBACA,uBACA,eACA,4BACA,6BACA,oBACA,kCAEFK,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,oBjPykBtE4H,gBkP3lBiC,CACjC/oG,KAAM,kBACN2H,SAAU,QACV6zB,OAAQ,CACN,sBAEFqlE,YAAa,0HAEbC,SAAU,CACR,qBACA,uBACA,iBACA,qBACA,kCACA,mCACA,0BACA,wCAEFK,QAAS,CAAC,YAAa,SAAU,aAAc,aAAc,QAAS,clP0kBtE7zE,WmP5lB4B,CAC5BttB,KAAM,aACN2H,SAAU,QACV6zB,OAAQ,CACN,iBAEFqlE,YAAa,sDACbC,SAAU,CACR,gBACA,gBACA,iBACA,4BAEFK,QAAS,CAAC,YAAa,YAAa,aAAc,WnPglBlD6H,QoP7lByB,CACzBhpG,KAAM,UACN2H,SAAU,QACV6zB,OAAQ,CACN,cAEFqlE,YAAa,4EACbC,SAAU,CACR,aACA,cACA,yBAEFK,QAAS,CAAC,YAAa,YAAa,aAAc,WpPklBlDr3E,OqP9lBwB,CACxB9pB,KAAM,SACN2H,SAAU,QACV6zB,OAAQ,CACN,aAEFqlE,YAAa,gCACbC,SAAU,CACR,YACA,YACA,aACA,yBAEFK,QAAS,CAAC,YAAa,YAAa,aAAc,erPklBlD8H,MsP/lBuB,CACvBjpG,KAAM,QACN2H,SAAU,QACV6zB,OAAQ,CACN,0BACA,sCAEFqlE,YAAa,6CACbC,SAAU,CACR,4CACA,+CACA,sDACA,0CAEFK,QAAS,CAAC,WtPklBVljF,OuPhmBwB,CACxBje,KAAM,SACN2H,SAAU,QACV6zB,OAAQ,CACN,aAEFqlE,YAAa,8BACbC,SAAU,CACR,cACA,iBACA,iBACA,yBAEFK,QAAS,CAAC,sBvPolBVxxD,QwPjmByB,CACzB3vC,KAAM,UACN2H,SAAU,QACV6zB,OAAQ,CACN,cAEFqlE,YAAa,8FACbC,SAAU,CACR,eACA,yBACA,yBACA,4BACA,2BACA,yBACA,qCAEFK,QAAS,CAAC,SAAU,SAAU,WAAY,YAAa,SAAU,YCX7DnhG,GAAO,OAGAkpG,GAA6B9uG,GAAQ4F,GAF7B,CAAC,QAAS,oBAAqB,SAEkBlC,IAAwC,IAAvC,MAAE4C,EAAK,kBAAE8+E,EAAiB,KAAEmhB,GAAM7iG,EAmBvG,OAAO4C,EAAMV,GAAM,CACjBwlC,IAAK,SAAU3S,GACb,IAAInc,EACAyyF,EAAat2E,EAEjB,GAAsB,iBAAXA,EACT,IAAKnc,KAAQ8oE,EAEX,GAAIliF,GAAekiF,EAAmB9oE,IAAUmc,IAAW2sD,EAAkB9oE,GAAQ,CACnFyyF,EAAazyF,EACb,KACF,CAkBJ,MAAMkqF,EAAMrnF,EAAgByoF,GAAcmH,GAC1C,IAAKvI,EAAK,CACR,MAAMwI,EAAmC,mBAAfD,EAA4BA,EAAWnpG,KAAOmpG,EACxE,MAAM,IAAIr4F,MAAM,8BAAgCs4F,EAAa,IAC/D,CACA,OAAO,IAAIzI,EAAKC,EAClB,GACA,IC7DE5gG,GAAO,QAGAqpG,GAA8BjvG,GAAQ4F,GAF9B,CAAC,QAAS,UAEwClC,IAAsB,IAArB,MAAE4C,EAAK,MAAE2gG,GAAOvjG,EAoCtF,OAAO4C,EAAMV,GAAM,CACjB,GAAI,WACF,OAAO,IAAIqhG,CACb,EAEA77D,IAAK,SAAUvjC,GACb,OAAO,IAAIo/F,EAAMp/F,EACnB,GACA,ICzCSqnG,GAA4BlvG,GAH5B,MACQ,CAAC,QAAS,SAAU,iBAAkB,WAAY,eAAgB,SAAU,eAE5B0D,IAAmF,IAAlF,MAAE4C,EAAK,OAAEykB,EAAM,eAAEq2B,EAAc,SAAE9I,EAAQ,aAAEgX,EAAY,OAAE5/B,EAAM,WAAEsmB,GAAYtyC,EA0BjJ,OAAO4C,EA7BI,MA6BQ,CACjB8kC,IAAK,SAAUvqC,GACb,OAAOijB,GAAMjjB,EACf,EAEA,iBAAkB,SAAcA,GAC9B,IAAIyf,EAWJ,OATEA,EADEkB,EAAS3gB,GACJA,EAAEyf,OACAxa,MAAMC,QAAQlF,IACvBA,EAAIkqB,EAAOlqB,IACFyf,OAGF,GAGDA,EAAKlf,QACX,KAAK,EAEH,OAAO0iB,GAAMjjB,GAEf,KAAK,EAEH,GAAgB,IAAZyf,EAAK,GACP,OAAOwD,GAAMjjB,EAAEgf,UAAU,IACzB,GAAgB,IAAZS,EAAK,GACT,OAAO,EAEP,MAAM,IAAIgoB,WAAW,gCACTnhB,GAAO7G,GAAQ,KAG/B,KAAK,EACL,CAEE,MAAMkqB,EAAOlqB,EAAK,GACZunC,EAAOvnC,EAAK,GAClB,GAAIkqB,IAASqd,EACX,OAyBV,SAAe98B,EAAQyf,GACrB,GAAa,IAATA,EAEF,OAAO1mB,GAAMiH,EAAO,GAAG,IAClB,GAAa,IAATyf,EAGT,OAAO4W,EACL9I,EAASvtB,EAAO,GAAG,GAAIA,EAAO,GAAG,IACjCutB,EAASvtB,EAAO,GAAG,GAAIA,EAAO,GAAG,KAE9B,CAIL,IAAIsJ,GAAU,EACd,MAAM86E,EAAa,IAAIrpG,MAAM0kC,GAAM/3B,KAAK,GAAG1I,KAAI,CAACzG,EAAGnB,IAAMA,IACzD,IAAK,IAAIhB,EAAI,EAAGA,EAAIqpC,EAAMrpC,IAAK,CAC7B,IAAIiuG,EAAKD,EAAWhuG,GACpB,GAAIuuB,EAAO3E,EAAOqkF,GAAIjuG,IAAK,CACzB,IAAIkuG,EACJ,IAAKA,EAAKluG,EAAI,EAAGkuG,EAAK7kE,EAAM6kE,IAC1B,IAAK3/E,EAAO3E,EAAOokF,EAAWE,IAAKluG,IAAK,CACtCiuG,EAAKD,EAAWE,GAChBF,EAAWE,GAAMF,EAAWhuG,GAC5BguG,EAAWhuG,GAAKiuG,EAChB/6E,GAAWA,EACX,KACF,CAEF,GAAIg7E,IAAO7kE,EAAM,OAAOzf,EAAOqkF,GAAIjuG,EACrC,CACA,MAAMmuG,EAAMvkF,EAAOqkF,GAAIjuG,GACjBouG,EAAa,IAANpuG,EAAU,EAAI4pB,EAAOokF,EAAWhuG,EAAI,IAAIA,EAAI,GACzD,IAAK,IAAIgB,EAAIhB,EAAI,EAAGgB,EAAIqoC,EAAMroC,IAAK,CACjC,MAAMqtG,EAAKL,EAAWhtG,GACtB,IAAK,IAAIC,EAAIjB,EAAI,EAAGiB,EAAIooC,EAAMpoC,IAC5B2oB,EAAOykF,GAAIptG,GAAKktD,EAAalO,EAAe9I,EAASvtB,EAAOykF,GAAIptG,GAAIktG,GAAMh3D,EAASvtB,EAAOykF,GAAIruG,GAAI4pB,EAAOqkF,GAAIhtG,KAAMmtG,EAEvH,CACF,CACA,MAAMnf,EAAMrlE,EAAOokF,EAAW3kE,EAAO,IAAIA,EAAO,GAChD,OAAOnW,EAAU2hB,EAAWo6C,GAAOA,CACrC,CACF,CArEiBqf,CAAK5uG,EAAEijB,QAAQjE,UAAW2qB,GACjC,GAAa,IAATqd,EACJ,OAAO,EAEP,MAAM,IAAIvf,WAAW,gCACPnhB,GAAO7G,GAAQ,IAEjC,CAEA,QAEE,MAAM,IAAIgoB,WAAW,yCACTnhB,GAAO7G,GAAQ,KAEjC,GAuDF,IC5HWovF,GAA4B1vG,GAb5B,MACQ,CACnB,QACA,SACA,eACA,YACA,WACA,aACA,MACA,WACA,QAGmE0D,IAA0F,IAAzF,MAAE4C,EAAK,OAAEykB,EAAM,aAAEukC,EAAY,UAAEnR,EAAS,SAAE7F,EAAQ,WAAEtC,EAAU,IAAEo6C,EAAG,SAAE74B,EAAQ,IAAEtvC,GAAKvkB,EAqBxJ,OAAO4C,EAlCI,MAkCQ,CACjB,iBAAkB,SAAUzF,GAC1B,MAAMyf,EAAOkB,EAAS3gB,GAAKA,EAAEyf,OAASwhB,GAAUjhC,GAChD,OAAQyf,EAAKlf,QACX,KAAK,EAEH,GAAgB,IAAZkf,EAAK,GACP,OAAIkB,EAAS3gB,GACJkqB,EAAO,CACZukC,EAAa,EAAGzuD,EAAEgf,UAAU,MAGvB,CACLyvC,EAAa,EAAGzuD,EAAE,KAItB,MAAM,IAAIynC,WAAW,gCACTnhB,GAAO7G,GAAQ,KAG/B,KAAK,EAEL,CACE,MAAMkqB,EAAOlqB,EAAK,GACZunC,EAAOvnC,EAAK,GAClB,GAAIkqB,IAASqd,EACX,OAAIrmC,EAAS3gB,GACJkqB,EACL4kF,EAAK9uG,EAAEgf,UAAW2qB,EAAMqd,GACxBhnD,EAAEm/B,WAIG2vE,EAAK9uG,EAAG2pC,EAAMqd,GAGvB,MAAM,IAAIvf,WAAW,gCACPnhB,GAAO7G,GAAQ,IAEjC,CAEA,QAEE,MAAM,IAAIgoB,WAAW,yCACTnhB,GAAO7G,GAAQ,KAEjC,EAEA8qB,IAAK,SAAUvqC,GAEb,OAAOyuD,EAAa,EAAGzuD,EACzB,IAWF,SAAS8uG,EAAMpkE,EAAKf,EAAMqd,GACxB,IAAIzrC,EAAG9R,EAAG/I,EAAGsG,EAAO2uB,EAEpB,GAAa,IAATgU,EAAY,CAGd,GADA3iC,EAAQ0jC,EAAI,GAAG,GACD,IAAV1jC,EACF,MAAM6O,MAAM,iDAEd,MAAO,CAAC,CACN44C,EAAa,EAAGznD,IAEpB,CAAO,GAAa,IAAT2iC,EAAY,CAErB,MAAMtpC,EAAIkvF,EAAI7kD,GACd,GAAU,IAANrqC,EACF,MAAMwV,MAAM,iDAEd,MAAO,CACL,CACE44C,EAAa/jB,EAAI,GAAG,GAAIrqC,GACxBouD,EAAatZ,EAAWzK,EAAI,GAAG,IAAKrqC,IAEtC,CACEouD,EAAatZ,EAAWzK,EAAI,GAAG,IAAKrqC,GACpCouD,EAAa/jB,EAAI,GAAG,GAAIrqC,IAG9B,CAAO,CAQL,MAAMg8B,EAAIqO,EAAI9jC,SACd,IAAK2U,EAAI,EAAGA,EAAIouB,EAAMpuB,IACpB8gB,EAAE9gB,GAAK8gB,EAAE9gB,GAAG3U,SAKd,MAAM01B,EAAIo6B,EAAS/sB,GAAM3qB,UAGzB,IAAK,IAAI9a,EAAI,EAAGA,EAAI8iD,EAAM9iD,IAAK,CAE7B,IAAI6qG,EAAO3nF,EAAIiV,EAAEn4B,GAAGA,IAChB8qG,EAAO9qG,EAEX,IADAqX,EAAIrX,EAAI,EACDqX,EAAIouB,GACLviB,EAAIiV,EAAE9gB,GAAGrX,IAAM6qG,IACjBA,EAAO3nF,EAAIiV,EAAE9gB,GAAGrX,IAChB8qG,EAAOzzF,GAETA,IAEF,GAAa,IAATwzF,EACF,MAAMl5F,MAAM,iDAEd0F,EAAIyzF,EACAzzF,IAAMrX,IACRyxB,EAAO0G,EAAEn4B,GAAIm4B,EAAEn4B,GAAKm4B,EAAE9gB,GAAI8gB,EAAE9gB,GAAKoa,EACjCA,EAAO2G,EAAEp4B,GAAIo4B,EAAEp4B,GAAKo4B,EAAE/gB,GAAI+gB,EAAE/gB,GAAKoa,GAInC,MAAMs5E,EAAK5yE,EAAEn4B,GACPgrG,EAAK5yE,EAAEp4B,GACb,IAAKqX,EAAI,EAAGA,EAAIouB,EAAMpuB,IAAK,CACzB,MAAM4zF,EAAK9yE,EAAE9gB,GACP6zF,EAAK9yE,EAAE/gB,GACb,GAAIA,IAAMrX,GAER,GAAc,IAAVirG,EAAGjrG,GAAU,CAKf,IAJAxD,EAAI+tD,EAAatZ,EAAWg6D,EAAGjrG,IAAK+qG,EAAG/qG,IAIlCuF,EAAIvF,EAAGuF,EAAIu9C,EAAMv9C,IACpB0lG,EAAG1lG,GAAK6zC,EAAU6xD,EAAG1lG,GAAIguC,EAAS/2C,EAAGuuG,EAAGxlG,KAE1C,IAAKA,EAAI,EAAGA,EAAIu9C,EAAMv9C,IACpB2lG,EAAG3lG,GAAK6zC,EAAU8xD,EAAG3lG,GAAIguC,EAAS/2C,EAAGwuG,EAAGzlG,IAE5C,MACK,CAIL,IADA/I,EAAIuuG,EAAG/qG,GACFuF,EAAIvF,EAAGuF,EAAIu9C,EAAMv9C,IACpB0lG,EAAG1lG,GAAKglD,EAAa0gD,EAAG1lG,GAAI/I,GAE9B,IAAK+I,EAAI,EAAGA,EAAIu9C,EAAMv9C,IACpB2lG,EAAG3lG,GAAKglD,EAAa2gD,EAAG3lG,GAAI/I,EAEhC,CACF,CACF,CACA,OAAO47B,CACT,CACF,KCtMIv3B,GAAO,OAgBAsqG,GAA6BlwG,GAAQ4F,GAf7B,CACnB,QACA,SACA,MACA,YACA,QACA,YACA,MACA,aACA,eACA,WACA,MACA,YAGoElC,IAahE,IAbiE,MACrE4C,EAAK,OACLykB,EAAM,IACN8pB,EAAG,UACHuQ,EAAS,MACT5D,EAAK,UACLgO,EAAS,IACT7mC,EAAG,WACHk6D,EAAU,aACVvzB,EAAY,SACZhX,EAAQ,IACR/sC,EAAG,QACH8e,GACD3mB,EAqBC,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAU/E,GAC1B,MAAMyf,EAAOkB,EAAS3gB,GAAKA,EAAEyf,OAASwhB,GAAUjhC,GAChD,OAAQyf,EAAKlf,QACX,KAAK,EAEH,OAAI+uG,EAAStvG,GAAWgiF,EAAWhiF,GACnB,IAAZyf,EAAK,GACAu0B,EAAIh0C,GAEJ2uD,EAAUqzB,EAAWhiF,GAAI8nB,EAAI9nB,EAAGA,IAG3C,KAAK,EAEL,CACE,GAAIsvG,EAAStvG,GAAI,OAAOgiF,EAAWhiF,GACnC,MAAM2pC,EAAOlqB,EAAK,GACZunC,EAAOvnC,EAAK,GAClB,GAAIkqB,IAASqd,EACX,IACE,OAAOhT,EAAIh0C,EACb,CAAE,MAAOoM,GACP,KAAIA,aAAeyJ,OAASzJ,EAAIrG,QAAQiC,MAAM,kDAG5C,MAAMoE,CAEV,CAEF,OAAIuU,EAAS3gB,GACJkqB,EACLqlF,EAAMvvG,EAAEgf,UAAW2qB,EAAMqd,GACzBhnD,EAAEm/B,WAIGowE,EAAMvvG,EAAG2pC,EAAMqd,EAE1B,CAEA,QAEE,MAAM,IAAIvf,WAAW,yCACTnhB,GAAO7G,GAAQ,KAEjC,EAEA8qB,IAAK,SAAUvqC,GAEb,OAAI2gD,EAAM3gD,EAAG,GAAWijB,GAAMjjB,GACvByuD,EAAa,EAAGzuD,EACzB,IAWF,SAASuvG,EAAO7kE,EAAKf,EAAMqd,GACzB,MAAM,EAAEzqB,EAAC,EAAEg4C,GAgEb,SAAoB7pC,EAAKf,EAAMqd,GAC7B,MAAMwoD,EAhDR,SAAgB9kE,EAAKf,EAAMqd,GACzB,MAAMtqB,EAAIzZ,GAAMynB,GAChB,IAAI+kE,EAAO,EACX,IAAK,IAAIl0F,EAAI,EAAGA,EAAIouB,EAAMpuB,IAAK,CAC7B,GAAIyrC,GAAQyoD,EACV,OAAO/yE,EAET,IAAIp7B,EAAIia,EACR,KAAOm0F,EAAQhzE,EAAEp7B,GAAGmuG,KAElB,GADAnuG,IACIqoC,IAASroC,IACXA,EAAIia,EACJk0F,IACIzoD,IAASyoD,GACX,OAAO/yE,GAKZA,EAAEp7B,GAAIo7B,EAAEnhB,IAAM,CAACmhB,EAAEnhB,GAAImhB,EAAEp7B,IAExB,IAAI4pC,EAAMxO,EAAEnhB,GAAGk0F,GACf,IAAK,IAAIluG,EAAI,EAAGA,EAAIylD,EAAMzlD,IACxBm7B,EAAEnhB,GAAGha,GAAKotD,EAAUjyB,EAAEnhB,GAAGha,GAAI2pC,GAG/B,IAAK,IAAI5pC,EAAI,EAAGA,EAAIqoC,EAAMroC,IACxB,GAAIA,IAAMia,EAAV,CACA2vB,EAAMxO,EAAEp7B,GAAGmuG,GACX,IAAK,IAAIluG,EAAI,EAAGA,EAAIylD,EAAMzlD,IACxBm7B,EAAEp7B,GAAGC,GAAKmJ,EAAIgyB,EAAEp7B,GAAGC,GAAIk2C,GAAU,EAAGA,EAASvM,EAAKxO,EAAEnhB,GAAGha,KAHpC,CAMvBkuG,GACF,CACA,OAAO/yE,CACT,CAYeizE,CAAMjlE,EAAKf,EAAMqd,GAG9B,MAAO,CAAEzqB,EAFCmO,EAAIxhC,KAAI,CAACzG,EAAGnB,IAAMmB,EAAEyE,QAAO,CAACzE,EAAGlB,IAAMA,EAAIooC,IAAS+lE,EAAQ5nF,EAAI0nF,EAAKjuG,GAAIiuG,EAAKjuG,SAE1EgzE,EADFi7B,EAAKtoG,QAAO,CAACzE,EAAGnB,KAAOouG,EAAQ5nF,EAAI0nF,EAAKluG,GAAIkuG,EAAKluG,OAE7D,CArEmBsuG,CAAUllE,EAAKf,EAAMqd,GAChC6oD,EAAQp4D,EAASzD,EAAIyD,EAASuqC,EAAWzlD,GAAIA,IAAKylD,EAAWzlD,IAC7DuzE,EAAQr4D,EAASuqC,EAAWzN,GAAIvgC,EAAIyD,EAAS88B,EAAGyN,EAAWzN,MACjE,OAAO98B,EAASq4D,EAAOD,EACzB,CAmEA,SAASH,EAAS1vG,GAChB,OAAO2gD,EAAMj2C,EAAI1K,EAAGwpB,EAAQ,EAAG,IAAK9e,EAAI,EAAG8e,EAAQ,EAAG,IACxD,CAEA,SAAS8lF,EAAUx/F,GACjB,OAAOy0C,EAAU75C,EAAIoF,EAAK0Z,EAAQ,EAAG,IAAK9e,EAAI+sC,EAAS3nC,EAAK,GAAI0Z,EAAQ,EAAG,IAC7E,KC/LF,MAIaumF,GAA6B5wG,GAJ7B,OAGQ,CAAC,SAAU,QAAS,SAAU,YAAa,QAAS,WAAY,MAAO,OAAQ,MAAO,MAAO,iBAAkB,eAAgB,MAAO,YAAa,WAAY,MAAO,SAAU,SAAU,UAAW,SAAU,UAAW,OAAQ,OAAQ,OAAQ,UAAW,KAAM,SAAU,YAAa,KAAM,KAAM,UAAW,oBAAqB,QACrR0D,IAAkR,IAAjR,OAAEqiB,EAAM,MAAEzf,EAAK,OAAEykB,EAAM,UAAEozB,EAAS,SAAEvnB,EAAQ,MAAE4qB,EAAK,IAAEv5B,EAAG,KAAEiK,EAAI,IAAE3C,EAAG,IAAEkF,EAAG,eAAE2pB,EAAc,aAAEkR,EAAY,IAAEza,EAAG,UAAEkW,EAAS,SAAEzS,EAAQ,IAAE/sC,EAAG,OAAE0/C,EAAM,OAAE3E,EAAM,QAAExrC,EAAO,OAAEkL,EAAM,QAAE66B,EAAO,KAAEp3B,EAAI,KAAE4iF,EAAI,KAAE/rF,EAAI,QAAE+f,EAAO,GAAEyiE,EAAE,OAAEoC,EAAM,UAAE2G,EAAS,GAAE5wE,EAAE,GAAEhe,EAAE,QAAEwkC,EAAO,kBAAEgrD,EAAiB,IAAE9jF,GAAKjlB,EACjV,MAAMmtG,ECTD,SAA4BntG,GAAuG,IAArG,OAAEqiB,EAAM,UAAEo4B,EAAS,SAAEvnB,EAAQ,IAAE3O,EAAG,KAAEiK,EAAI,IAAE3C,EAAG,IAAEkF,EAAG,eAAE2pB,EAAc,IAAEvJ,EAAG,UAAEkW,EAAS,SAAEzS,EAAQ,IAAE/sC,GAAK7H,EAmFtI,SAASotG,EAAUC,EAAKC,EAAKC,GAC3B,MAAMtL,EAASqL,EAAMD,EACrB,OAAIpjG,KAAKsa,IAAI09E,IAAU5/E,EAAOuD,OACrB3b,KAAKme,GAAK,EAEV,GAAMne,KAAKukB,KAAK,EAAM++E,GAAOD,EAAMD,GAE9C,CAGA,SAASG,EAAaH,EAAKC,EAAKC,GAC9B,MAAMtL,EAAQ/uE,EAASo6E,EAAKD,GAC5B,OAAI9oF,EAAI09E,IAAU5/E,EAAOuD,OAChByhC,GAAW,GAAGh5B,OAAOlB,IAAI,GAEzButB,EAAe,GAAKlsB,EAAKomB,EAAS,EAAK24D,EAAKp8D,EAAI8wD,KAE3D,CAGA,SAASwL,EAAMC,EAAKllD,EAAO/pD,EAAGC,GAC5B,MAAMk7B,EAAI8zE,EAAIhwG,OACR2D,EAAI4I,KAAK4hB,IAAI28B,GACb5hD,EAAIqD,KAAK8mB,IAAIy3B,GACbmlD,EAAMvrG,MAAMw3B,GAAG7qB,KAAK,GACpB6+F,EAAMxrG,MAAMw3B,GAAG7qB,KAAK,GAC1B,IAAK,IAAItR,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBkwG,EAAIlwG,GAAK4D,EAAIqsG,EAAIjwG,GAAGgB,GAAKmI,EAAI8mG,EAAIjwG,GAAGiB,GACpCkvG,EAAInwG,GAAKmJ,EAAI8mG,EAAIjwG,GAAGgB,GAAK4C,EAAIqsG,EAAIjwG,GAAGiB,GAEtC,IAAK,IAAIjB,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBiwG,EAAIjwG,GAAGgB,GAAKkvG,EAAIlwG,GAChBiwG,EAAIjwG,GAAGiB,GAAKkvG,EAAInwG,GAElB,OAAOiwG,CACT,CAEA,SAASG,EAASH,EAAKllD,EAAO/pD,EAAGC,GAC/B,MAAMk7B,EAAI8zE,EAAIhwG,OACR2D,EAAIwqB,EAAI28B,GACR5hD,EAAImqB,EAAIy3B,GACRmlD,EAAMvrG,MAAMw3B,GAAG7qB,KAAKs4C,EAAU,IAC9BumD,EAAMxrG,MAAMw3B,GAAG7qB,KAAKs4C,EAAU,IACpC,IAAK,IAAI5pD,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBkwG,EAAIlwG,GAAKy1B,EAASwnB,EAAer5C,EAAGqsG,EAAIjwG,GAAGgB,IAAKi8C,EAAe9zC,EAAG8mG,EAAIjwG,GAAGiB,KACzEkvG,EAAInwG,GAAKg9C,EAAUC,EAAe9zC,EAAG8mG,EAAIjwG,GAAGgB,IAAKi8C,EAAer5C,EAAGqsG,EAAIjwG,GAAGiB,KAE5E,IAAK,IAAIjB,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBiwG,EAAIjwG,GAAGgB,GAAKkvG,EAAIlwG,GAChBiwG,EAAIjwG,GAAGiB,GAAKkvG,EAAInwG,GAElB,OAAOiwG,CACT,CAGA,SAASI,EAAOC,EAAKvlD,EAAO/pD,EAAGC,GAC7B,MAAMk7B,EAAIm0E,EAAIrwG,OACR2D,EAAIgmD,EAAUx7B,EAAI28B,IAClB5hD,EAAIygD,EAAUt2B,EAAIy3B,IAClB6sC,EAAK36C,EAAer5C,EAAGA,GACvBE,EAAKm5C,EAAe9zC,EAAGA,GACvBonG,EAAM5rG,MAAMw3B,GAAG7qB,KAAKs4C,EAAU,IAC9B4mD,EAAM7rG,MAAMw3B,GAAG7qB,KAAKs4C,EAAU,IAE9B6mD,EAAQt5D,EAASyS,EAAU,GAAIhmD,EAAGuF,EAAGmnG,EAAItvG,GAAGC,IAE5CyvG,EAAM1zD,EAAUvnB,EAASwnB,EAAe26C,EAAI0Y,EAAItvG,GAAGA,IAAKyvG,GAAQxzD,EAAen5C,EAAIwsG,EAAIrvG,GAAGA,KAC1F0vG,EAAMvmG,EAAI6yC,EAAen5C,EAAIwsG,EAAItvG,GAAGA,IAAKyvG,EAAOxzD,EAAe26C,EAAI0Y,EAAIrvG,GAAGA,KAEhF,IAAK,IAAIjB,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBuwG,EAAIvwG,GAAKy1B,EAASwnB,EAAer5C,EAAG0sG,EAAItvG,GAAGhB,IAAKi9C,EAAe9zC,EAAGmnG,EAAIrvG,GAAGjB,KACzEwwG,EAAIxwG,GAAKg9C,EAAUC,EAAe9zC,EAAGmnG,EAAItvG,GAAGhB,IAAKi9C,EAAer5C,EAAG0sG,EAAIrvG,GAAGjB,KAG5EswG,EAAItvG,GAAGA,GAAK0vG,EACZJ,EAAIrvG,GAAGA,GAAK0vG,EACZL,EAAItvG,GAAGC,GAAK2oD,EAAU,GACtB0mD,EAAIrvG,GAAGD,GAAK4oD,EAAU,GAEtB,IAAK,IAAI5pD,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACjBA,IAAMgB,GAAKhB,IAAMiB,IACnBqvG,EAAItvG,GAAGhB,GAAKuwG,EAAIvwG,GAChBswG,EAAItwG,GAAGgB,GAAKuvG,EAAIvwG,GAChBswG,EAAIrvG,GAAGjB,GAAKwwG,EAAIxwG,GAChBswG,EAAItwG,GAAGiB,GAAKuvG,EAAIxwG,IAGpB,OAAOswG,CACT,CAGA,SAASl5E,EAAIk5E,EAAKvlD,EAAO/pD,EAAGC,GAC1B,MAAMk7B,EAAIm0E,EAAIrwG,OACR2D,EAAI4I,KAAK4hB,IAAI28B,GACb5hD,EAAIqD,KAAK8mB,IAAIy3B,GACb6sC,EAAKh0F,EAAIA,EACTE,EAAKqF,EAAIA,EACTonG,EAAM5rG,MAAMw3B,GAAG7qB,KAAK,GACpBk/F,EAAM7rG,MAAMw3B,GAAG7qB,KAAK,GAEpBo/F,EAAM9Y,EAAK0Y,EAAItvG,GAAGA,GAAK,EAAI4C,EAAIuF,EAAImnG,EAAItvG,GAAGC,GAAK6C,EAAKwsG,EAAIrvG,GAAGA,GAC3D0vG,EAAM7sG,EAAKwsG,EAAItvG,GAAGA,GAAK,EAAI4C,EAAIuF,EAAImnG,EAAItvG,GAAGC,GAAK22F,EAAK0Y,EAAIrvG,GAAGA,GAEjE,IAAK,IAAIjB,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBuwG,EAAIvwG,GAAK4D,EAAI0sG,EAAItvG,GAAGhB,GAAKmJ,EAAImnG,EAAIrvG,GAAGjB,GACpCwwG,EAAIxwG,GAAKmJ,EAAImnG,EAAItvG,GAAGhB,GAAK4D,EAAI0sG,EAAIrvG,GAAGjB,GAGtCswG,EAAItvG,GAAGA,GAAK0vG,EACZJ,EAAIrvG,GAAGA,GAAK0vG,EACZL,EAAItvG,GAAGC,GAAK,EACZqvG,EAAIrvG,GAAGD,GAAK,EAEZ,IAAK,IAAIhB,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACjBA,IAAMgB,GAAKhB,IAAMiB,IACnBqvG,EAAItvG,GAAGhB,GAAKuwG,EAAIvwG,GAChBswG,EAAItwG,GAAGgB,GAAKuvG,EAAIvwG,GAChBswG,EAAIrvG,GAAGjB,GAAKwwG,EAAIxwG,GAChBswG,EAAItwG,GAAGiB,GAAKuvG,EAAIxwG,IAGpB,OAAOswG,CACT,CAGA,SAASM,EAAQC,GACf,MAAM10E,EAAI00E,EAAI5wG,OACd,IAAI6wG,EAAS,EACTC,EAAQ,CAAC,EAAG,GAChB,IAAK,IAAI/vG,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAID,EAAI,EAAGC,EAAIk7B,EAAGl7B,IACrBuL,KAAKsa,IAAIgqF,GAAUtkG,KAAKsa,IAAI+pF,EAAI7vG,GAAGC,MACrC6vG,EAAStkG,KAAKsa,IAAI+pF,EAAI7vG,GAAGC,IACzB8vG,EAAQ,CAAC/vG,EAAGC,IAIlB,MAAO,CAAC8vG,EAAOD,EACjB,CAGA,SAASE,EAAWH,GAClB,MAAM10E,EAAI00E,EAAI5wG,OACd,IAAI6wG,EAAS,EACTC,EAAQ,CAAC,EAAG,GAChB,IAAK,IAAI/vG,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAID,EAAI,EAAGC,EAAIk7B,EAAGl7B,IACrB6lB,EAAIgqF,GAAUhqF,EAAI+pF,EAAI7vG,GAAGC,MAC3B6vG,EAAShqF,EAAI+pF,EAAI7vG,GAAGC,IACpB8vG,EAAQ,CAAC/vG,EAAGC,IAIlB,MAAO,CAAC8vG,EAAOD,EACjB,CAGA,SAASG,EAASl5F,EAAG6C,EAAGs2F,GACtB,MAAM/0E,EAAIpkB,EAAE9X,OACN+e,EAASra,MAAMw3B,GACrB,IAAIg1E,EACJ,GAAID,EAAgB,CAClBC,EAAOxsG,MAAMw3B,GACb,IAAK,IAAIn8B,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBmxG,EAAKnxG,GAAK2E,MAAMw3B,EAEpB,CACA,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IAAK,CAC1B,IAAIowG,EAAQ,EACRnmF,EAAOlT,EAAE,GACb,IAAK,IAAI9W,EAAI,EAAGA,EAAI8W,EAAE9X,OAAQgB,IACxB6lB,EAAI/O,EAAE9W,IAAM6lB,EAAImE,KAClBmmF,EAAQnwG,EACRgqB,EAAOlT,EAAEq5F,IAIb,GADApyF,EAAOhe,GAAK+W,EAAER,OAAO65F,EAAO,GAAG,GAC3BF,EACF,IAAK,IAAIlxG,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBmxG,EAAKnwG,GAAGhB,GAAK4a,EAAE5a,GAAGoxG,GAClBx2F,EAAE5a,GAAGuX,OAAO65F,EAAO,EAGzB,CACA,IAAKF,EAAgB,MAAO,CAAElyF,UAC9B,MAAMqyF,EAAeF,EAAKvoG,KAAI,CAACm9C,EAAQ/kD,KAAM,CAAG0F,MAAOsY,EAAOhe,GAAI+kD,aAClE,MAAO,CAAE/mC,SAAQqyF,eACnB,CAEA,OAzQA,SAAe7hG,EAAK2sB,GAA+C,IAA5Cm1E,EAAI3vG,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAGijB,EAAOuD,OAAQ5iB,EAAI5D,UAAA1B,OAAA,EAAA0B,UAAA,QAAAa,EAAE0uG,EAAcvvG,UAAA1B,OAAA,EAAA0B,UAAA,QAAAa,EAC/D,GAAa,WAAT+C,EACF,OAWJ,SAAe7F,EAAGwmB,EAAWgrF,GAC3B,MAAM/0E,EAAIz8B,EAAEO,OACNsxG,EAAK/kG,KAAKsa,IAAIZ,EAAYiW,GAChC,IAAIq3C,EACAy8B,EACJ,GAAIiB,EAAgB,CAClBjB,EAAM,IAAItrG,MAAMw3B,GAEhB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBivG,EAAIjvG,GAAK2D,MAAMw3B,GAAG7qB,KAAK,GACvB2+F,EAAIjvG,GAAGA,GAAK,CAEhB,CAEA,IAAIwwG,EAAMZ,EAAOlxG,GACjB,KAAO8M,KAAKsa,IAAI0qF,EAAI,KAAOhlG,KAAKsa,IAAIyqF,IAAK,CACvC,MAAMvwG,EAAIwwG,EAAI,GAAG,GACXvwG,EAAIuwG,EAAI,GAAG,GACjBh+B,EAAMm8B,EAASjwG,EAAEsB,GAAGA,GAAItB,EAAEuB,GAAGA,GAAIvB,EAAEsB,GAAGC,IACtCvB,EAAI03B,EAAG13B,EAAG8zE,EAAKxyE,EAAGC,GACdiwG,IAAgBjB,EAAMD,EAAKC,EAAKz8B,EAAKxyE,EAAGC,IAC5CuwG,EAAMZ,EAAOlxG,EACf,CACA,MAAMoqE,EAAKnlE,MAAMw3B,GAAG7qB,KAAK,GACzB,IAAK,IAAItQ,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB8oE,EAAG9oE,GAAKtB,EAAEsB,GAAGA,GAEf,OAAOiwG,EAAQtuF,GAAMmnD,GAAKmmC,EAAKiB,EACjC,CAvCWhG,CAAK17F,EAAK8hG,EAAMJ,GAGzB,GAAa,cAAT3rG,EACF,OAsCJ,SAAkB7F,EAAGwmB,EAAWgrF,GAC9B,MAAM/0E,EAAIz8B,EAAEO,OACNsxG,EAAKzqF,EAAIZ,EAAYiW,GAC3B,IAAIq3C,EACAy8B,EACJ,GAAIiB,EAAgB,CAClBjB,EAAM,IAAItrG,MAAMw3B,GAEhB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBivG,EAAIjvG,GAAK2D,MAAMw3B,GAAG7qB,KAAK,GACvB2+F,EAAIjvG,GAAGA,GAAK,CAEhB,CAEA,IAAIwwG,EAAMR,EAAUtxG,GACpB,KAAOonB,EAAI0qF,EAAI,KAAO1qF,EAAIyqF,IAAK,CAC7B,MAAMvwG,EAAIwwG,EAAI,GAAG,GACXvwG,EAAIuwG,EAAI,GAAG,GACjBh+B,EAAMu8B,EAAYrwG,EAAEsB,GAAGA,GAAItB,EAAEuB,GAAGA,GAAIvB,EAAEsB,GAAGC,IACzCvB,EAAI2wG,EAAM3wG,EAAG8zE,EAAKxyE,EAAGC,GACjBiwG,IAAgBjB,EAAMG,EAAQH,EAAKz8B,EAAKxyE,EAAGC,IAC/CuwG,EAAMR,EAAUtxG,EAClB,CACA,MAAMoqE,EAAKnlE,MAAMw3B,GAAG7qB,KAAK,GACzB,IAAK,IAAItQ,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB8oE,EAAG9oE,GAAKtB,EAAEsB,GAAGA,GAGf,OAAOiwG,EAAQtuF,GAAMmnD,GAAKmmC,EAAKiB,EACjC,CAnEWO,CAAQjiG,EAAK8hG,EAAMJ,GAG5B,MAAMtrG,UAAU,0BAA4BL,EAC9C,CAgQF,CDxQ0BmsG,CAAoB,CAAE9sF,SAAQo4B,YAAWvnB,WAAU0vB,SAAQxrC,UAAS0mC,QAAOv5B,MAAKiK,OAAM3C,MAAKkF,MAAK2pB,iBAAgBvJ,MAAKkW,YAAWlK,UAASvI,WAAU/sC,QACrKunG,EEVD,SAA0BpvG,GAA4M,IAA1M,UAAEy6C,EAAS,SAAEvnB,EAAQ,QAAE9b,EAAO,SAAEw9B,EAAQ,eAAE8F,EAAc,aAAEkR,EAAY,KAAE7lC,EAAI,IAAExB,EAAG,UAAE8iC,EAAS,KAAEshD,EAAI,KAAE/rF,EAAI,QAAE+f,EAAO,IAAEwU,EAAG,GAAEiuD,EAAE,OAAEoC,EAAM,UAAE2G,EAAS,MAAErqD,EAAK,QAAEX,EAAO,OAAEoK,EAAM,QAAExJ,EAAO,kBAAEgrD,EAAiB,IAAE9jF,GAAKjlB,EA6czO,SAASqvG,EAAgB/4F,EAAGD,EAAGhV,EAAG7D,GAEhC,MAAM8xG,EAAM70D,EAAUnkC,EAAG9Y,GACnB+xG,EAAOr8E,EAASwnB,EAAepkC,EAAG9Y,GAAIk9C,EAAerkC,EAAGhV,IACxDlE,EAAIu9C,EAAe40D,EAAK,IACxBlyG,EAAIs9C,EAAe30B,EAAKmN,EAASwnB,EAAe40D,EAAKA,GAAM50D,EAAe,EAAG60D,KAAS,IAE5F,MAAO,CAAC90D,EAAUt9C,EAAGC,GAAI81B,EAAS/1B,EAAGC,GACvC,CASA,SAASoyG,EAAel5F,EAAGD,EAAGhV,EAAG7D,EAAGiyG,EAAIC,EAAIX,EAAM/rG,GAChD,MAAM2sG,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAEPqoC,EAAOskE,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAChDxvB,EAAMgiF,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAIrD,GAAIY,EAAQx5B,EAAIljB,GAAI0tG,GAClB,MAAO,CAAC,CAACphF,EAAK0d,GAAO,CAACA,EAAM1d,IAK9B,GAAI45B,EAAOhjC,EAAI2O,EAASu8E,EAAIC,IAAMX,GAChC,MAAO,CAAC,CAAC77E,EAASu8E,EAAIjyG,GAAI01B,EAASw8E,EAAIlyG,IAAK,CAAC6D,EAAGA,IAKlD,MAAMuuG,EAAK18E,EAAS5c,EAAGm5F,GACjBI,EAAK38E,EAAS11B,EAAGiyG,GAKvB,OAAI1xD,EAAQx5B,EAAIlO,GAAI04F,IAAShxD,EAAQx5B,EAAIsrF,GAAKd,GACrC,CAAC,CAACa,EAAIjiF,GAAM,CAACtsB,EAAGgqC,IAEhB,CAAC,CAACh1B,EAAGg1B,GAAO,CAACwkE,EAAIliF,GAE5B,CAMA,SAASmiF,EAAe7iG,EAAK2sB,GAE3B,IAAK,IAAIn7B,EAAI,EAAGA,EAAIwO,EAAIvP,OAAQe,IAC9BwO,EAAIxO,GAAGE,QAAQyD,MAAMw3B,EAAI3sB,EAAIxO,GAAGf,QAAQqR,KAAK,IAI/C,IAAK,IAAItQ,EAAIwO,EAAIvP,OAAQe,EAAIm7B,EAAGn7B,IAC9BwO,EAAItO,KAAKyD,MAAMw3B,GAAG7qB,KAAK,IACvB9B,EAAIxO,GAAGA,GAAK,EAGd,OAAOwO,CACT,CAqCA,SAASxG,EAASwG,EAAKo3D,EAAI5/D,GACzB,IAAK,IAAIhG,EAAI,EAAGA,EAAIwO,EAAIvP,OAAQe,IAC9B,GAAIgG,EAAGwI,EAAIxO,GAAI4lE,GACb,OAAO5lE,EAGX,OAAQ,CACV,CAgBA,SAASsxG,EAAgBv2E,EAAGI,EAAGo2E,EAAQjB,EAAM/rG,GAC3C,MAAMitG,EAAoB,cAATjtG,EAAuBqkD,EAAU,KAAQ,IAE1D,IAAIhxC,EAGA5X,EAAI,EACR,KAAOA,EAAI,IAAKA,EAAG,CACjB4X,EAAI65F,EAAuBt2E,EAAGo2E,EAAQhtG,GACtC,IACEqT,EAAImrF,EAAOhoE,EAAGnjB,EAChB,CAAE,MAAAmM,GAGA,QACF,CACA,GAAI+kC,EAAOsB,EAAKxyC,GAAI45F,GAAa,KACnC,CACA,GAAIxxG,GAAK,EACP,OAAO,KAKT,IADAA,EAAI,IACS,CACX,MAAM4C,EAAImgG,EAAOhoE,EAAGnjB,GAEpB,GAAI0nC,EAAQ8K,EAAKsnD,EAAqB95F,EAAG,CAAChV,KAAM0tG,GAAS,MACzD,KAAMtwG,GAAK,GAAM,OAAO,KAExB4X,EAAI+5F,EAAU/uG,EAChB,CAEA,OAAOgV,CACT,CAUA,SAAS65F,EAAwBt2E,EAAGo2E,EAAQhtG,GAC1C,MAAM2sG,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAGb,IAAIzF,EAAI6E,MAAMw3B,GAAG7qB,KAAK,GAAG1I,KAAIzG,GAAK,EAAIqK,KAAKgP,SAAW,IAQtD,OAPI02F,IAAOpyG,EAAIA,EAAE8I,KAAIrF,GAAKqmD,EAAUrmD,MAChC24C,IAAQp8C,EAAIA,EAAE8I,KAAIrF,GAAKm8C,EAAQn8C,MAGnCzD,EAAI4yG,EAAqB5yG,EAAGyyG,GAGrBI,EAAU7yG,EAAGyF,EACtB,CAKA,SAASmtG,EAAsB5yG,EAAGyyG,GAChC,MAAMK,EAAczzF,EAAKrf,GACzB,IAAK,IAAID,KAAK0yG,EACZ1yG,EAAIq/B,EAAQr/B,EAAG+yG,GAEf9yG,EAAI21B,EAAS31B,EAAGq3C,EAASgX,EAAa3mC,EAAI3nB,EAAGC,GAAI0nB,EAAI3nB,EAAGA,IAAKA,IAG/D,OAAOC,CACT,CAOA,SAASsrD,EAAMtrD,GACb,OAAOgnB,EAAIwB,EAAKd,EAAI1nB,EAAGA,IACzB,CASA,SAAS6yG,EAAW7yG,EAAGyF,GACrB,MACM22C,EAAgB,YAAT32C,EACP2qB,EAFe,cAAT3qB,EAEMqkD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAErD,OAAOvI,EAASgX,EAAaj+B,EAAKk7B,EAAKtrD,IAAKA,EAC9C,CAEA,OArqBA,SAAsB0P,EAAK2sB,EAAGm1E,EAAM/rG,GAA0B,IAApBstG,IAAWlxG,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,KAAAA,UAAA,GAMnD,MAAMgmE,EAyCR,SAAkBn4D,EAAK2sB,EAAGm1E,EAAM/rG,EAAMstG,GACpC,MAAMX,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAEPutG,EAAWZ,EAAMtoD,EAAU,GAAK,EAChC15B,EAAMgiF,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAC/CqzD,EAAUb,EAAMtoD,EAAU,GAAK,EAG/BnZ,EAAQyhE,EAAMtoD,EAAU,IAAM,EAC9BopD,EAAU/1D,EAAexM,EAAOA,GAGtC,IAAIwiE,EACAJ,IACFI,EAAQtuG,MAAMw3B,GAAG7qB,KAAK4e,IAIxB,IAAIplB,GAAO,EAEX,MAAQA,GAAM,CAEZA,GAAO,EAEP,IAAK,IAAI9J,EAAI,EAAGA,EAAIm7B,EAAGn7B,IAAK,CAG1B,IAAIkyG,EAAUJ,EACVK,EAAUL,EAEd,IAAK,IAAI7xG,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACjBD,IAAMC,IACViyG,EAAUl2D,EAAUk2D,EAASpsF,EAAItX,EAAIvO,GAAGD,KACxCmyG,EAAUn2D,EAAUm2D,EAASrsF,EAAItX,EAAIxO,GAAGC,MAG1C,IAAKo/C,EAAM6yD,EAAS,KAAO7yD,EAAM8yD,EAAS,GAAI,CAK5C,IAAI/yG,EAAI2yG,EACJnvG,EAAIsvG,EAER,MAAME,EAAcjlD,EAAaglD,EAAS1iE,GACpC4iE,EAAcp2D,EAAek2D,EAAS1iE,GAE5C,KAAO6P,EAAQ18C,EAAGwvG,IAChBxvG,EAAIq5C,EAAer5C,EAAGovG,GACtB5yG,EAAI68C,EAAe78C,EAAGqwC,GAExB,KAAOqZ,EAAOlmD,EAAGyvG,IACfzvG,EAAIuqD,EAAavqD,EAAGovG,GACpB5yG,EAAI+tD,EAAa/tD,EAAGqwC,GAQtB,GAHkB6P,EAAQ6N,EAAanR,EAAUp5C,EAAGuvG,GAAU/yG,GAAI68C,EAAeD,EAAUk2D,EAASC,GAAU,MAG/F,CAGbroG,GAAO,EAEP,MAAM6P,EAAIwzC,EAAa,EAAG/tD,GAE1B,IAAK,IAAIa,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACjBD,IAAMC,IAGVuO,EAAIxO,GAAGC,GAAKg8C,EAAeztC,EAAIxO,GAAGC,GAAI0Z,GACtCnL,EAAIvO,GAAGD,GAAKi8C,EAAeztC,EAAIvO,GAAGD,GAAIZ,IAIpCyyG,IACFI,EAAMjyG,GAAKi8C,EAAeg2D,EAAMjyG,GAAI2Z,GAExC,CACF,CACF,CACF,CAGA,OAAOk4F,EAAc3H,EAAK+H,GAAS,IACrC,CAjIYK,CAAQ9jG,EAAK2sB,EAAGm1E,EAAM/rG,EAAMstG,IA2IxC,SAA6BrjG,EAAK2sB,EAAGm1E,EAAM/rG,EAAMstG,EAAalrC,GAC5D,MAAMuqC,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAEPqoC,EAAOskE,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAElDwyD,IAAOZ,EAAO1nD,EAAU0nD,IAE5B,IAAK,IAAItwG,EAAI,EAAGA,EAAIm7B,EAAI,EAAGn7B,IAAK,CAG9B,IAAIuyG,EAAW,EACX3mG,EAAMghC,EAEV,IAAK,IAAI3sC,EAAID,EAAI,EAAGC,EAAIk7B,EAAGl7B,IAAK,CAC9B,MAAM2lE,EAAKp3D,EAAIvO,GAAGD,GACds/C,EAAQx5B,EAAIla,GAAMka,EAAI8/C,MACxBh6D,EAAMg6D,EACN2sC,EAAWtyG,EAEf,CAGA,IAAIq/C,EAAQx5B,EAAIla,GAAM0kG,GAAtB,CAIA,GAAIiC,IAAavyG,EAAI,EAAG,CAEtB,MAAMwyG,EAAOhkG,EAAI+jG,GACjB/jG,EAAI+jG,GAAY/jG,EAAIxO,EAAI,GACxBwO,EAAIxO,EAAI,GAAKwyG,EAGb,IAAK,IAAIvyG,EAAI,EAAGA,EAAIk7B,EAAGl7B,IAAK,CAC1B,MAAMwyG,EAAOjkG,EAAIvO,GAAGsyG,GACpB/jG,EAAIvO,GAAGsyG,GAAY/jG,EAAIvO,GAAGD,EAAI,GAC9BwO,EAAIvO,GAAGD,EAAI,GAAKyyG,CAClB,CAGA,GAAIZ,EAAa,CACf,MAAMa,EAAO/rC,EAAE4rC,GACf5rC,EAAE4rC,GAAY5rC,EAAE3mE,EAAI,GACpB2mE,EAAE3mE,EAAI,GAAK0yG,CACb,CACF,CAGA,IAAK,IAAIzyG,EAAID,EAAI,EAAGC,EAAIk7B,EAAGl7B,IAAK,CAC9B,MAAMsC,EAAI4qD,EAAa3+C,EAAIvO,GAAGD,GAAI4L,GAElC,GAAU,IAANrJ,EAAJ,CAKA,IAAK,IAAIvD,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBwP,EAAIvO,GAAGjB,GAAKy1B,EAASjmB,EAAIvO,GAAGjB,GAAIi9C,EAAe15C,EAAGiM,EAAIxO,EAAI,GAAGhB,KAI/D,IAAK,IAAIA,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrBwP,EAAIxP,GAAGgB,EAAI,GAAKg8C,EAAUxtC,EAAIxP,GAAGgB,EAAI,GAAIi8C,EAAe15C,EAAGiM,EAAIxP,GAAGiB,KAIpE,GAAI4xG,EACF,IAAK,IAAI7yG,EAAI,EAAGA,EAAIm8B,EAAGn8B,IACrB2nE,EAAE1mE,GAAGjB,GAAKy1B,EAASkyC,EAAE1mE,GAAGjB,GAAIi9C,EAAe15C,EAAGokE,EAAE3mE,EAAI,GAAGhB,IAf3D,CAkBF,CA/CA,CAgDF,CAGF,CAzME2zG,CAAmBnkG,EAAK2sB,EAAGm1E,EAAM/rG,EAAMstG,EAAalrC,GAIpD,MAAM,OAAE3oD,EAAM,EAAEid,GA4MlB,SAAiCF,EAAGI,EAAGm1E,EAAM/rG,EAAMstG,GACjD,MAAMX,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAEP2qB,EAAMgiF,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAEjDwyD,IAAOZ,EAAO1nD,EAAU0nD,IAW5B,IAAI9hG,EAAMmT,GAAMoZ,GAGhB,MAAM63E,EAAU,GAGhB,IAAIrwG,EAAI44B,EAIR,MAAM03E,EAAQ,GAGd,IAAIC,EAASjB,EAAc3H,EAAKvmG,MAAMw3B,GAAG7qB,KAAK4e,SAAQ1tB,EAGlDuxG,EAAWlB,EAAc3H,EAAKvmG,MAAMpB,GAAG+N,KAAK4e,SAAQ1tB,EAGpDwxG,EAAwB,EAE5B,KAAOA,GAAyB,KAAK,CACnCA,GAAyB,EAMzB,MAAMh0G,EAAIwP,EAAIjM,EAAI,GAAGA,EAAI,GAOzB,IAAK,IAAIvC,EAAI,EAAGA,EAAIuC,EAAGvC,IACrBwO,EAAIxO,GAAGA,GAAKy0B,EAASjmB,EAAIxO,GAAGA,GAAIhB,GAIlC,MAAM,EAAEyyD,EAAC,EAAEkV,GAAMg6B,EAAGnyF,GACpBA,EAAM2nC,EAASwwB,EAAGlV,GAElB,IAAK,IAAIzxD,EAAI,EAAGA,EAAIuC,EAAGvC,IACrBwO,EAAIxO,GAAGA,GAAKg8C,EAAUxtC,EAAIxO,GAAGA,GAAIhB,GASnC,GALI6yG,IACFkB,EAAW58D,EAAS48D,EAAUthD,IAItB,IAANlvD,GAAW+8C,EAAQx5B,EAAItX,EAAIjM,EAAI,GAAGA,EAAI,IAAK+tG,GAAO,CACpD0C,EAAwB,EACxBJ,EAAQ1yG,KAAKsO,EAAIjM,EAAI,GAAGA,EAAI,IAGxBsvG,IACFgB,EAAM7rF,QAAQ,CAAC,CAAC,KAChBqqF,EAAc0B,EAAU53E,GACxB23E,EAAS38D,EAAS28D,EAAQC,GAEtBxwG,EAAI,IACNwwG,EAAW7I,EAAKvmG,MAAMpB,EAAI,GAAG+N,KAAK4e,MAKtC3sB,GAAK,EACLiM,EAAIyY,MACJ,IAAK,IAAIjnB,EAAI,EAAGA,EAAIuC,EAAGvC,IACrBwO,EAAIxO,GAAGinB,KAIX,MAAO,GAAU,IAAN1kB,GAAW+8C,EAAQx5B,EAAItX,EAAIjM,EAAI,GAAGA,EAAI,IAAK+tG,GAAO,CAC3D0C,EAAwB,EACxB,MAAMC,EAAKrC,EACTpiG,EAAIjM,EAAI,GAAGA,EAAI,GAAIiM,EAAIjM,EAAI,GAAGA,EAAI,GAClCiM,EAAIjM,EAAI,GAAGA,EAAI,GAAIiM,EAAIjM,EAAI,GAAGA,EAAI,IAEpCqwG,EAAQ1yG,QAAQ+yG,GAGZpB,IACFgB,EAAM7rF,QAAQ+pF,EACZviG,EAAIjM,EAAI,GAAGA,EAAI,GAAIiM,EAAIjM,EAAI,GAAGA,EAAI,GAClCiM,EAAIjM,EAAI,GAAGA,EAAI,GAAIiM,EAAIjM,EAAI,GAAGA,EAAI,GAClC0wG,EAAG,GAAIA,EAAG,GAAI3C,EAAM/rG,IAEtB8sG,EAAc0B,EAAU53E,GACxB23E,EAAS38D,EAAS28D,EAAQC,GACtBxwG,EAAI,IACNwwG,EAAW7I,EAAKvmG,MAAMpB,EAAI,GAAG+N,KAAK4e,MAKtC3sB,GAAK,EACLiM,EAAIyY,MACJzY,EAAIyY,MACJ,IAAK,IAAIjnB,EAAI,EAAGA,EAAIuC,EAAGvC,IACrBwO,EAAIxO,GAAGinB,MACPzY,EAAIxO,GAAGinB,KAEX,CAEA,GAAU,IAAN1kB,EACF,KAEJ,CAMA,GAHAqwG,EAAQ/pG,MAAK,CAACgP,EAAGD,KAAO6c,EAAS3O,EAAIjO,GAAIiO,EAAIlO,MAGzCo7F,EAAwB,IAAK,CAC/B,MAAMloG,EAAMyJ,MAAM,qEAAuEq+F,EAAQtsG,KAAK,OAGtG,MAFAwE,EAAIkT,OAAS40F,EACb9nG,EAAIooG,QAAU,GACRpoG,CACR,CAIA,MAAMmwB,EAAI42E,EAAc17D,EAAS28D,EA2JnC,SAAoBtkG,EAAK2sB,GACvB,MAAMC,EAAI,GACV,IAAK,IAAIp7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrBo7B,EAAEp7B,GAAK2D,MAAMw3B,GAAG7qB,KAAK,GAGvB,IAAI+4B,EAAI,EACR,IAAK,MAAM1X,KAAOnjB,EAAK,CACrB,MAAMjM,EAAIovB,EAAI1yB,OAEd,IAAK,IAAIe,EAAI,EAAGA,EAAIuC,EAAGvC,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIsC,EAAGtC,IACrBm7B,EAAEiO,EAAIrpC,GAAGqpC,EAAIppC,GAAK0xB,EAAI3xB,GAAGC,GAI7BopC,GAAK9mC,CACP,CAEA,OAAO64B,CACT,CA/K2C+3E,CAAUN,EAAO13E,SAAM35B,EAEhE,MAAO,CAAEwc,OAAQ40F,EAAS33E,EAC5B,CA9VwBm4E,CAAuB5kG,EAAK2sB,EAAGm1E,EAAM/rG,EAAMstG,GAQjE,GAAIA,EAAa,CACf,MAAMxB,EAgWV,SAA2Bt1E,EAAGI,EAAGF,EAAG0rC,EAAG3oD,EAAQsyF,EAAM/rG,GACnD,MAAM8uG,EAAO3gE,EAAIzX,GACXshE,EAAIpmD,EAASk9D,EAAMt4E,EAAGE,GAEtBi2E,EAAe,cAAT3sG,EACN22C,EAAgB,YAAT32C,EAEPqoC,EAAOskE,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAChDxvB,EAAMgiF,EAAMtoD,EAAU,GAAK1N,EAAOwD,EAAQ,GAAK,EAI/C40D,EAAe,GACfC,EAAiB,GAEvB,IAAK,MAAM3oB,KAAU5sE,EAAQ,CAC3B,MAAMhe,EAAIgI,EAAQsrG,EAAc1oB,EAAQvrC,IAE7B,IAAPr/C,GACFszG,EAAapzG,KAAK0qF,GAClB2oB,EAAerzG,KAAK,IAEpBqzG,EAAevzG,IAAM,CAEzB,CAMA,MAAMkzG,EAAU,GACV17F,EAAM87F,EAAar0G,OACnB2Y,EAAIjU,MAAMw3B,GAAG7qB,KAAKs8B,GAClB71B,EAAImzF,EAAKvmG,MAAMw3B,GAAG7qB,KAAK4e,IAE7B,IAAK,IAAIlvB,EAAI,EAAGA,EAAIwX,EAAKxX,IAAK,CAC5B,MAAM4qF,EAAS0oB,EAAatzG,GACtB4Z,EAAI6a,EAAS8nE,EAAGpmD,EAASy0C,EAAQ7zE,IAEvC,IAAIy8F,EAAY9J,EAAU9vF,EAAGhC,GAM7B,IALA47F,EAAUzsF,QAKHysF,EAAUv0G,OAASs0G,EAAevzG,IAAI,CAC3C,MAAMyzG,EAAYnC,EAAe13F,EAAGuhB,EAAGq4E,EAAWlD,EAAM/rG,GACxD,GAAkB,OAAdkvG,EAAsB,MAC1BD,EAAUtzG,KAAKuzG,EACjB,CAGA,MAAMC,EAAav9D,EAASzD,EAAIi0B,GAAI1rC,GACpCu4E,EAAYA,EAAU5rG,KAAI9I,GAAKq3C,EAASu9D,EAAY50G,KAEpDo0G,EAAQhzG,QACHszG,EAAU5rG,KAAI9I,IAAK,CAAG4G,MAAOklF,EAAQ7lC,OAAQpsC,EAAQ7Z,OAC5D,CAEA,OAAOo0G,CACT,CA5ZyBS,CAAiBnlG,EAAK2sB,EAAGF,EAAG0rC,EAAG3oD,EAAQsyF,EAAM/rG,GAClE,MAAO,CAAEyZ,SAAQqyF,eACnB,CAEA,MAAO,CAAEryF,SACX,CAgoBF,CFtqBwB41F,CAAkB,CAAEhwF,SAAQo4B,YAAWvnB,WAAU0hB,WAAU8F,iBAAgBtjC,UAASw0C,eAAc7lC,OAAMxB,MAAK8iC,YAAWshD,OAAM/rF,OAAM+f,UAASyiE,KAAIjuD,MAAKqwD,SAAQ2G,YAAWrqD,QAAOX,UAASoK,SAAQxJ,UAASgrD,oBAAmB9jF,QA8DnP,OAAOriB,EAAM,OAAQ,CAQnBR,MAAO,SAAUjF,GAAK,OAAOm1G,EAAOjrF,EAAOlqB,GAAI,EAC/C,0BAA2B,SAAUA,EAAG4xG,GACtC,OAAOuD,EAAOjrF,EAAOlqB,GAAI,CAAEwmB,UAAWorF,GACxC,EACA,gBAAewD,CAAEp1G,EAAGY,IAAeu0G,EAAOjrF,EAAOlqB,GAAIY,GACrDs+B,OAAQ,SAAUwL,GAChB,OAAOyqE,EAAOzqE,EAAK,CAAE2qE,WAAW,GAClC,EACA,2BAA4B,SAAU3qE,EAAKknE,GACzC,OAAOuD,EAAOzqE,EAAK,CAAElkB,UAAWorF,EAAMyD,WAAW,GACnD,EACA,iBAAkB,SAAU3qE,EAAK9pC,GAC/B,MAAM00G,EAAU,CAAED,WAAW,GAE7B,OADAxzG,GAAcyzG,EAAS10G,GAChBu0G,EAAOzqE,EAAK4qE,EACrB,IAGF,SAASH,EAAQzqE,GAAgB,IAAA6qE,EAAA,IAAX30G,EAAIqB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC5B,MAAMuvG,IAAiB,iBAAkB5wG,IAAOA,EAAK+wG,aAE/C1wG,EAoBR,SAAkCypC,EAAKknE,EAAMJ,GAC3C,MAAM1hG,EAAM46B,EAAI1L,UAEV2W,EAAQjL,EAAIjrB,OAElB,GAAqB,IAAjBk2B,EAAMp1C,QAAgBo1C,EAAM,KAAOA,EAAM,GAC3C,MAAM,IAAIlO,WAAW,gCAAgCnhB,GAAOqvB,OAG9D,MAAMlZ,EAAIkZ,EAAM,GAEhB,GA4BF,SAAiB7lC,EAAK2sB,EAAGm1E,GACvB,IAAK,IAAItwG,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IAErB,GAAI6oD,EAAOF,EAAU9iC,EAAIgT,EAAGtqB,EAAIxO,GAAGC,MAAOqwG,GACxC,OAAO,EAKb,OAAO,CACT,CAvCM4D,CAAO1lG,EAAK2sB,EAAGm1E,KAyCrB,SAAqB9hG,EAAK2sB,GACxB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACrBuO,EAAIxO,GAAGC,GAAK6a,EAAGtM,EAAIxO,GAAGC,GAG5B,CA9CIk0G,CAAW3lG,EAAK2sB,GAapB,SAAsB3sB,EAAK2sB,EAAGm1E,GAC5B,IAAK,IAAItwG,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAID,EAAGC,EAAIk7B,EAAGl7B,IAErB,GAAI6oD,EAAOF,EAAU9iC,EAAI2O,EAASjmB,EAAIxO,GAAGC,GAAIuO,EAAIvO,GAAGD,MAAOswG,GACzD,OAAO,EAKb,OAAO,CACT,CAtBQ8D,CAAY5lG,EAAK2sB,EAAGm1E,IAAO,CAC7B,MAAM/rG,EAAO8vG,EAAYjrE,EAAK56B,EAAK2sB,GACnC,OAAOuzE,EAAgBlgG,EAAK2sB,EAAGm1E,EAAM/rG,EAAM2rG,EAC7C,CAGF,MAAM3rG,EAAO8vG,EAAYjrE,EAAK56B,EAAK2sB,GACnC,OAAOw1E,EAAcniG,EAAK2sB,EAAGm1E,EAAM/rG,EAAM2rG,EAC3C,CA1CiBoE,CAAwBlrE,EADZ,QAAjB6qE,EAAG30G,EAAK4lB,iBAAS,IAAA+uF,EAAAA,EAAIrwF,EAAOuD,OACY+oF,GAiBlD,OAhBI5wG,EAAKy0G,YACPp0G,EAAOqe,OAAS4K,EAAOjpB,EAAOqe,QAC1BkyF,IACFvwG,EAAO0wG,aAAe1wG,EAAO0wG,aAAazoG,KAAI2kC,IAAA,IAAC,MAAE7mC,EAAK,OAAEq/C,GAAQxY,EAAA,MAC7D,CAAE7mC,QAAOq/C,OAAQn8B,EAAOm8B,GAAS,MAGpCmrD,GACF1vG,OAAOwT,eAAerU,EAAQ,UAAW,CACvC+c,YAAY,EAEZlY,IAAKA,KACH,MAAM,IAAI+P,MAAM,qDAAqD,IAIpE5U,CACT,CA+DA,SAAS00G,EAAajrE,EAAK56B,EAAK2sB,GAE9B,MAAM52B,EAAO6kC,EAAItL,WAEjB,GAAa,WAATv5B,GAA8B,cAATA,GAAiC,YAATA,EAC/C,OAAOA,EAGT,IAAIgwG,GAAY,EACZC,GAAS,EACTC,GAAa,EAEjB,IAAK,IAAIz0G,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IAAK,CAC1B,MAAM2lE,EAAKp3D,EAAIxO,GAAGC,GAElB,GAAI4e,EAAS+mD,IAAO1mD,EAAW0mD,GAC7B2uC,GAAY,OACP,GAAIz1F,EAAY8mD,GACrB4uC,GAAS,MACJ,KAAIv1F,EAAU2mD,GAGnB,MAAMhhE,UAAU,+BAAiC8c,GAAOkkD,IAFxD6uC,GAAa,CAGf,CACF,CAOF,GAJID,GAAUC,GACZC,QAAQC,KAAK,0EAGXF,EAAY,CACd,IAAK,IAAIz0G,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACrBuO,EAAIxO,GAAGC,GAAKy+C,EAAQlwC,EAAIxO,GAAGC,IAI/B,MAAO,SACT,CAEA,GAAIu0G,EAAQ,CACV,IAAK,IAAIx0G,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACrBuO,EAAIxO,GAAGC,GAAK2oD,EAAUp6C,EAAIxO,GAAGC,IAIjC,MAAO,WACT,CAEA,GAAIs0G,EAAW,CACb,IAAK,IAAIv0G,EAAI,EAAGA,EAAIm7B,EAAGn7B,IACrB,IAAK,IAAIC,EAAI,EAAGA,EAAIk7B,EAAGl7B,IACrBuO,EAAIxO,GAAGC,GAAK4jB,EAAOrV,EAAIxO,GAAGC,IAI9B,MAAO,QACT,CACE,MAAM2E,UAAU,0CAEpB,KGnPInB,GAAO,OAGAmxG,GAA6B/2G,GAAQ4F,GAF7B,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,aAEMlC,IAAkD,IAAjD,MAAE4C,EAAK,IAAE2hB,EAAG,IAAE1c,EAAG,SAAEgsD,EAAQ,IAAE1iB,EAAG,SAAEyD,GAAU50C,EA0BjH,OAAO4C,EAAMV,GAAM,CAEjBm6B,OAAQ,SAAU7C,GAEhB,MAAM5c,EAAO4c,EAAE5c,OAEf,GAAoB,IAAhBA,EAAKlf,QAAgBkf,EAAK,KAAOA,EAAK,GACxC,MAAM,IAAIgoB,WAAW,gCACPnhB,GAAO7G,GAAQ,KAG/B,MAAM5b,EAAI4b,EAAK,GAYT02F,EAqDV,SAAuB95E,GACrB,MAAMx4B,EAAIw4B,EAAE5c,OAAO,GACnB,IAAI02F,EAAU,EACd,IAAK,IAAI70G,EAAI,EAAGA,EAAIuC,EAAGvC,IAAK,CAC1B,IAAI80G,EAAS,EACb,IAAK,IAAI70G,EAAI,EAAGA,EAAIsC,EAAGtC,IACrB60G,GAAUhvF,EAAIiV,EAAEv2B,IAAI,CAACxE,EAAGC,KAE1B40G,EAAUrpG,KAAKI,IAAIkpG,EAAQD,EAC7B,CACA,OAAOA,CACT,CAhEoBE,CAAah6E,GAIvB30B,EAmEV,SAAqByuG,GAEnB,IAAK,IAAI71G,EAAI,EAAGA,EADM,GACaA,IACjC,IAAK,IAAIgzB,EAAI,EAAGA,GAAKhzB,EAAGgzB,IAAK,CAC3B,MAAM/xB,EAAIjB,EAAIgzB,EACd,GAAIgjF,EAAcH,EAAS7iF,EAAG/xB,GApFpB,MAqFR,MAAO,CAAE+xB,IAAG/xB,IAEhB,CAEF,MAAM,IAAIsU,MAAM,mHAClB,CA9EmB0gG,CAAWJ,GACpB7iF,EAAI5rB,EAAO4rB,EACX/xB,EAAImG,EAAOnG,EASXi1G,EAAO/+D,EAASpb,EAAGvvB,KAAK4M,IAAI,GAAInY,IAGtC,IAAIk7B,EAAIi6B,EAAS7yD,GACb24B,EAAIk6B,EAAS7yD,GAGbgwD,EAAS,EAGT4iD,EAAUD,EACVE,GAAa,EAEjB,IAAK,IAAIp1G,EAAI,EAAGA,GAAKgyB,EAAGhyB,IAClBA,EAAI,IACNm1G,EAAUh/D,EAASg/D,EAASD,GAC5BE,GAAaA,GAEf7iD,EAASA,GAAUvgC,EAAIhyB,EAAI,KAAO,EAAIgyB,EAAIhyB,EAAI,GAAKA,GAEnDm7B,EAAI/xB,EAAI+xB,EAAGgb,EAASoc,EAAQ4iD,IAC5Bj6E,EAAI9xB,EAAI8xB,EAAGib,EAASoc,EAAS6iD,EAAWD,IAG1C,IAAIxuC,EAAIxwB,EAASzD,EAAIxX,GAAIC,GAGzB,IAAK,IAAIn7B,EAAI,EAAGA,EAAIC,EAAGD,IACrB2mE,EAAIxwB,EAASwwB,EAAGA,GAGlB,OAAOnnD,EAAeub,GAClBA,EAAEoS,mBAAmBw5B,GACrBA,CACN,IAuCF,SAASquC,EAAeH,EAAS7iF,EAAG/xB,GAClC,IAAIo1G,EAAO,EACX,IAAK,IAAIr1G,EAAI,EAAGA,GAAKgyB,EAAGhyB,IACtBq1G,GAAQr1G,EAEV,IAAIs1G,EAAUD,EACd,IAAK,IAAIr1G,EAAIgyB,EAAI,EAAGhyB,GAAK,EAAIgyB,EAAGhyB,IAC9Bs1G,GAAWt1G,EAEb,MAAMu1G,EAAYD,GAAW,EAAItjF,EAAI,GAErC,OAAO,EACLxmB,KAAK4M,IAAIy8F,EAAUrpG,KAAK4M,IAAI,EAAGnY,GAAI,EAAI+xB,GACvCqjF,EAAOA,GAAQC,EAAUC,EAC7B,KCzJI9xG,GAAO,QAGA+xG,GAA8B33G,GAAQ4F,GAF9B,CAAC,QAAS,MAAO,MAAO,WAAY,MAAO,OAAQ,WAAY,MAAO,OAAQ,MAAO,aAEnClC,IAAkF,IAAjF,MAAE4C,EAAK,IAAE2hB,EAAG,IAAE1c,EAAG,SAAE+sC,EAAQ,IAAEvuC,EAAG,KAAE0f,EAAI,SAAEmN,EAAQ,IAAEie,EAAG,KAAEv0B,EAAI,IAAEvS,EAAG,SAAEwpD,GAAU7zD,EAClJ,MACMk0G,EAAa,KAWnB,SAASC,EAAgB36E,GACvB,IAAIgxB,EACA4pD,EAAa,EAEb5kD,EAAIh2B,EACJ2rC,EAAItR,EAASj3C,EAAK4c,IAEtB,EAAG,CACD,MAAM66E,EAAK7kD,EAMX,GALAA,EAAI5a,EAAS,GAAK/sC,EAAIwsG,EAAIljE,EAAIg0B,KAC9BA,EAAIvwB,EAAS,GAAK/sC,EAAIs9D,EAAGh0B,EAAIkjE,KAE7B7pD,EAAQngD,EAAIka,EAAI2O,EAASs8B,EAAG6kD,KAExB7pD,EAAQ0pD,KAAgBE,EA1BT,IA2BjB,MAAM,IAAIphG,MAAM,uEAEpB,OAASw3C,EAAQ0pD,GAEjB,OAAO1kD,CACT,CAuBA,OAAO5sD,EAAMV,GAAM,CACjB,iBAAkB,SAAUs3B,GAC1B,MAAM5c,EAAOkB,EAAS0b,GAAKA,EAAE5c,OAASwhB,GAAU5E,GAChD,OAAQ5c,EAAKlf,QACX,KAAK,EAEH,GAAgB,IAAZkf,EAAK,GACP,OAAOvW,EAAImzB,EAAGzT,GAEd,MAAM,IAAI6e,WAAW,gCACTnhB,GAAO7G,GAAQ,KAG/B,KAAK,EAKH,GAFaA,EAAK,KACLA,EAAK,GAEhB,OAAOu3F,EAAe36E,GAEtB,MAAM,IAAIoL,WAAW,gCACPnhB,GAAO7G,GAAQ,KAGjC,QAEE,MAAM,IAAIgoB,WAAW,iDACTnhB,GAAO7G,GAAQ,KAEjC,GACA,IC7FE1a,GAAO,YAmBAoyG,GAAkCh4G,GAAQ4F,GAlBlC,CACnB,QACA,QACA,oBACA,SACA,WACA,QACA,SACA,YACA,QACA,SACA,MACA,WACA,WACA,UACA,QAGyElC,IAkBtE,IAjBH,MACE4C,EAAK,MACLymG,EAAK,kBACLN,EAAiB,OACjB1hF,EAAM,SACNutB,EAAQ,MACRzO,EAAK,OACLpiC,EAAM,UACNwnD,EAAS,MACTzqD,EAAK,OACL07B,EAAM,IACN30B,EAAG,SACHqrB,EAAQ,SACR2gC,EAAQ,QACR+zC,EAAO,IACPrjF,GACDvkB,EA+BD,OAAO4C,EAAMV,GAAM,CACjB,yBAA0BqyG,EAC1B,wBAAyB,SAAU/6E,EAAGC,EAAGC,GACvC,OAAO66E,EAAWltF,EAAOmS,GAAIC,EAAGC,EAClC,EACA,uBAAwB,SAAUF,EAAGC,EAAGC,GACtC,OAAO66E,EAAWltF,EAAOmS,GAAInS,EAAOoS,GAAIC,EAC1C,EACA,uBAAwB,SAAUF,EAAGC,EAAGC,GACtC,OAAO66E,EAAWltF,EAAOmS,GAAIC,EAAGpS,EAAOqS,GACzC,EACA,wBAAyB,SAAUF,EAAGC,EAAGC,GACvC,OAAO66E,EAAW/6E,EAAGnS,EAAOoS,GAAIC,EAClC,EACA,uBAAwB,SAAUF,EAAGC,EAAGC,GACtC,OAAO66E,EAAW/6E,EAAGnS,EAAOoS,GAAIpS,EAAOqS,GACzC,EACA,wBAAyB,SAAUF,EAAGC,EAAGC,GACvC,OAAO66E,EAAW/6E,EAAGC,EAAGpS,EAAOqS,GACjC,EACA,sBAAuB,SAAUF,EAAGC,EAAGC,GACrC,OAAO66E,EAAWltF,EAAOmS,GAAInS,EAAOoS,GAAIpS,EAAOqS,IAAIyC,SACrD,IAEF,SAASo4E,EAAY/6E,EAAGC,EAAGC,GACzB,MAAM14B,EAAIy4B,EAAE7c,OAAO,GACb8P,EAAI8M,EAAE5c,OAAO,GAEb43F,EAAKnL,EAAM7vE,GACXk4C,EAAI8iC,EAAGrlD,EACP6rC,EAAIwZ,EAAGxZ,EACPyZ,EAAKpL,EAAMz0D,GAAU,EAAGnb,IACxByrC,EAAIuvC,EAAGtlD,EACPyiB,EAAI6iC,EAAGzZ,EACPrhE,EAAIib,EAASA,EAAS2W,EAAUyvC,GAAIthE,GAAIk4C,GACxCh/B,EAAMzM,EAAM,EAAGzZ,GACftvB,EAAI,GAEJs3G,EAAKA,CAACp+F,EAAGD,IAAMtS,EAAOuS,EAAGD,EAAG,GAC5BqgC,EAAKA,CAACpgC,EAAGD,IAAMtS,EAAOuS,EAAGD,EAAG,GAElC,IAAK,IAAI5Y,EAAI,EAAGA,EAAIuD,EAAGvD,IACrB,GAAIA,EAAKuD,EAAI,GAAMujB,EAAIiY,EAAO0oC,EAAGpkE,EAAMrD,EAAI,EAAGA,KAAO,KAAM,CACzD,IAAIk3G,EAAMj+D,EAAGla,EAAO7C,EAAG74B,EAAM8xC,EAAKn1C,IAAK++B,EAAO7C,EAAG74B,EAAM8xC,EAAKn1C,EAAI,KAChE,IAAK,IAAIiB,EAAI,EAAGA,EAAIjB,EAAGiB,IACrBi2G,EAAM9sG,EAAI8sG,EACRj+D,EAAG9B,EAASx3C,EAAEsB,GAAI89B,EAAO0oC,EAAGpkE,EAAMpC,EAAGjB,KAAMm3C,EAASx3C,EAAEsB,GAAI89B,EAAO0oC,EAAGpkE,EAAMpC,EAAGjB,EAAI,OAGrF,MAAMm3G,EAAMhgE,EAASif,EAASnnC,GAAIkoB,GAAU,EAAGpY,EAAO0oC,EAAGpkE,EAAMrD,EAAGA,MAC5Do3G,EAAMjgE,EAASif,EAASnnC,GAAIkoB,GAAU,EAAGpY,EAAO0oC,EAAGpkE,EAAMrD,EAAI,EAAGA,MAChEq3G,EAAMlgE,EAASif,EAASnnC,GAAIkoB,GAAU,EAAGpY,EAAO0oC,EAAGpkE,EAAMrD,EAAGA,EAAI,MAChEs3G,EAAMngE,EAASif,EAASnnC,GAAIkoB,GAAU,EAAGpY,EAAO0oC,EAAGpkE,EAAMrD,EAAI,EAAGA,EAAI,MACpEu3G,EAAMt+D,EACVg+D,EAAG7sG,EAAI6pE,EAAGkjC,GAAMC,GAChBH,EAAGI,EAAKjtG,EAAI6pE,EAAGqjC,KAEXE,EAAOrN,EAAQoN,EAAKL,GAC1Bv3G,EAAEK,GAAKw3G,EAAKz4E,OAAO17B,EAAMqlC,EAAM,EAAGzZ,GAAI,IACtCtvB,EAAEK,EAAI,GAAKw3G,EAAKz4E,OAAO17B,EAAMqlC,EAAMzZ,EAAG,EAAIA,GAAI,IAC9CjvB,GACF,KAAO,CACL,IAAIk3G,EAAMn4E,EAAO7C,EAAG74B,EAAM8xC,EAAKn1C,IAC/B,IAAK,IAAIiB,EAAI,EAAGA,EAAIjB,EAAGiB,IAAOi2G,EAAM9sG,EAAI8sG,EAAK//D,EAASx3C,EAAEsB,GAAI89B,EAAO0oC,EAAGpkE,EAAMpC,EAAGjB,MAC/E,MAAMm3G,EAAMp4E,EAAO0oC,EAAGpkE,EAAMrD,EAAGA,IACzBu3G,EAAM9hF,EAASw+C,EAAG98B,EAASggE,EAAK/gD,EAASnnC,KAE/CtvB,EAAEK,GAAKmqG,EAAQoN,EAAKL,EACtB,CAEF,MAAMnlD,EAAInoC,EAAO0hF,KAAqB3rG,IAGtC,OAFUw3C,EAASomD,EAAGpmD,EAAS4a,EAAGjE,EAAUqmB,IAG9C,KC7II1vE,GAAO,QAWAgzG,GAA8B54G,GAAQ4F,GAV9B,CACnB,QACA,SACA,WACA,WACA,KACA,OACA,aAGqElC,IAUlE,IATH,MACE4C,EAAK,OACLykB,EAAM,SACNwsC,EAAQ,SACRjf,EAAQ,GACRwqD,EAAE,KACFv2C,EAAI,SACJ31B,GACDlzB,EAwBD,OAAO4C,EAAMV,GAAM,CACjBE,MAAO,SAAU5D,GACf,MAAMka,EAAIy8F,EAAO9tF,EAAO7oB,IACxB,MAAO,CACLw8F,EAAGtiF,EAAEsiF,EAAE7+E,UACPgzC,EAAGz2C,EAAEy2C,EAAEhzC,UAEX,EAEAkgB,OAAQ,SAAU79B,GAChB,OAAO22G,EAAO32G,EAChB,IAEF,SAAS22G,EAAQ32G,GACf,MAAMwC,EAAIxC,EAAEoe,OAAO,GACnB,IAGIw4F,EAHA57E,EAAIh7B,EACJw8F,EAAInnC,EAAS7yD,GACbvD,EAAI,EAER,EAAG,CACD23G,EAAK57E,EACL,MAAM67E,EAAKjW,EAAG5lE,GACR02B,EAAImlD,EAAGnlD,EACPkV,EAAIiwC,EAAGjwC,EAGb,GAFA5rC,EAAIob,EAASwwB,EAAGlV,GAChB8qC,EAAIpmD,EAASomD,EAAG9qC,GACXzyD,IAAO,IAAO,KACrB,OAASorD,EAAK31B,EAASsG,EAAG47E,IAAO,MACjC,MAAO,CAAEpa,IAAG7rC,EAAG31B,EACjB,KCzEIt3B,GAAO,OASAozG,GAA6Bh5G,GAAQ4F,GAR7B,CACnB,QACA,SACA,YACA,WACA,cAGoElC,IAQjE,IAPH,MACE4C,EAAK,OACLykB,EAAM,UACN+hF,EAAS,SACTx0D,EAAQ,UACR2W,GACDvrD,EA4BD,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUs3B,EAAG02B,GAC7B,OAAOk5C,EAAU5vE,EAAG+xB,EAAU/xB,GAAIob,GAAU,EAAGsb,GACjD,EACA,gBAAiB,SAAU12B,EAAG02B,GAC5B,OAAOk5C,EAAU/hF,EAAOmS,GAAI+xB,EAAUlkC,EAAOmS,IAAKob,GAAU,EAAGsb,GACjE,EACA,gBAAiB,SAAU12B,EAAG02B,GAC5B,OAAOk5C,EAAU5vE,EAAG+xB,EAAUlkC,EAAOmS,IAAKnS,EAAOutB,GAAU,EAAGsb,IAChE,EACA,eAAgB,SAAU12B,EAAG02B,GAC3B,OAAOk5C,EAAU/hF,EAAOmS,GAAI+xB,EAAUlkC,EAAOmS,IAAKnS,EAAOutB,GAAU,EAAGsb,KAAK/zB,SAC7E,GACA,IC5CSo5E,GAA+Bj5G,GAV/B,SACQ,CACnB,QACA,SACA,WACA,cACA,eACA,QAGsE0D,IAAiE,IAAhE,MAAE4C,EAAK,OAAEykB,EAAM,SAAEutB,EAAQ,YAAErK,EAAW,aAAEqhB,EAAY,IAAEza,GAAKnxC,EAClI,MAAMi0C,EAAgBpB,GAAoB,CAAEjwC,QAAO2nC,gBAC7C4J,EAAeb,GAAmB,CAAE1wC,UAiC1C,OAAOA,EAAM,SAAU0d,GAAO,CAG5B,iCAAkC,SAAUnjB,EAAGC,GAK7C,OAAOw3C,EAASz3C,EAAGg0C,EAAI/zC,GACzB,EAEA,mBAAoB,SAAUD,EAAGC,GAC/B,OAAO+2C,EAAah3C,EAAGC,EAAGwuD,GAAc,EAC1C,EAEA,oBAAqB,SAAUzuD,EAAGC,GAChC,OAAO62C,EAAc92C,EAAGC,EAAGwuD,GAAc,EAC3C,EAEA,aAAc,SAAUzuD,EAAGC,GAEzB,OAAO+2C,EAAa9sB,EAAOlqB,GAAIC,EAAGwuD,GAAc,GAAOzvC,SACzD,EAEA,sBAAuB,SAAUhf,EAAGC,GAClC,OAAOw3C,EAASz3C,EAAGg0C,EAAI/zC,GACzB,GACCwuD,EAAa1mD,YAAY,IC1ExBhD,GAAO,WAYAszG,GAAiCl5G,GAAQ4F,GAXjC,CACnB,QACA,YACA,iBACA,eACA,iBACA,YACA,OACA,QAGwElC,IAA8F,IAA7F,MAAE4C,EAAK,UAAE63C,EAAS,eAAEiD,EAAc,eAAEhD,EAAc,aAAEkR,EAAY,UAAElK,EAAS,KAAE37B,EAAI,IAAExB,GAAKvkB,EAoDjK,OAAO4C,EAAMV,GAAM,CACjB,sBAAuB,SAAU/E,EAAGC,EAAGC,GAErC,GAAiB,IAAbF,EAAEO,QAA6B,IAAbN,EAAEM,QAA6B,IAAbL,EAAEK,OAAc,CACtD,IAAK+3G,EAAIt4G,GAAM,MAAM,IAAIkG,UAAU,kEACnC,IAAKoyG,EAAIr4G,GAAM,MAAM,IAAIiG,UAAU,mEACnC,IAAKoyG,EAAIp4G,GAAM,MAAM,IAAIgG,UAAU,kEACnC,GAAIq+C,EAAUtkD,EAAGC,GAAM,MAAM,IAAIgG,UAAU,iDAC3C,MAAMqyG,EAASh4D,EAAergD,EAAE,GAAID,EAAE,IAChCu4G,EAASj4D,EAAetgD,EAAE,GAAIC,EAAE,IAChCykG,EAAWpkD,EAAehD,EAAer9C,EAAE,GAAID,EAAE,IAAKs9C,EAAet9C,EAAE,GAAIC,EAAE,KAEnF,OAAOu4G,EAAqBz4G,EAAE,GAAIA,EAAE,GAAIu4G,EAAQC,EAAQ7T,EAC1D,CACE,MAAM,IAAIz+F,UAAU,+BAExB,EACA,yBAA0B,SAAUlG,EAAGC,EAAGC,GACxC,GAA8B,IAA1B4B,OAAOyB,KAAKvD,GAAGO,QAA0C,IAA1BuB,OAAOyB,KAAKtD,GAAGM,QAA0C,IAA1BuB,OAAOyB,KAAKrD,GAAGK,OAAc,CAC7F,IAAK+3G,EAAIt4G,GAAM,MAAM,IAAIkG,UAAU,+DACnC,IAAKoyG,EAAIr4G,GAAM,MAAM,IAAIiG,UAAU,uEACnC,IAAKoyG,EAAIp4G,GAAM,MAAM,IAAIgG,UAAU,uEACnC,GAAIq+C,EAAUm0D,EAAez4G,GAAIy4G,EAAex4G,IAAO,MAAM,IAAIgG,UAAU,iDAC3E,GAAI,WAAYlG,GAAK,WAAYA,GAAK,eAAgBC,GACpD,eAAgBA,GAAK,eAAgBC,GAAK,eAAgBA,EAAG,CAC7D,MAAMq4G,EAASh4D,EAAergD,EAAEy4G,WAAY14G,EAAE24G,YACxCJ,EAASj4D,EAAetgD,EAAE44G,WAAY34G,EAAE44G,YACxCnU,EAAWpkD,EAAehD,EAAer9C,EAAE44G,WAAY74G,EAAE24G,YAAar7D,EAAet9C,EAAE44G,WAAY34G,EAAEy4G,aAC3G,OAAOF,EAAqBz4G,EAAE+4G,OAAQ/4G,EAAEg5G,OAAQT,EAAQC,EAAQ7T,EAClE,CACE,MAAM,IAAIz+F,UAAU,yBAExB,CACE,MAAM,IAAIA,UAAU,+BAExB,EACA,eAAgB,SAAUlG,EAAGC,GAE3B,GAAiB,IAAbD,EAAEO,QAA6B,IAAbN,EAAEM,OAAc,CACpC,IAAK+3G,EAAIt4G,GACP,MAAM,IAAIkG,UAAU,kEAEtB,IAAK+yG,EAAIh5G,GACP,MAAM,IAAIiG,UAAU,mEAGtB,OAAOuyG,EAAqBz4G,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GACxD,CAAO,GAAiB,IAAbD,EAAEO,QAA6B,IAAbN,EAAEM,OAAc,CAE3C,IAAK04G,EAAIj5G,GACP,MAAM,IAAIkG,UAAU,kEAEtB,IAAKgzG,EAAgBj5G,GACnB,MAAM,IAAIiG,UAAU,mEAGtB,OAAOizG,EAAqBn5G,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAChF,CAAO,GAAID,EAAEO,SAAWN,EAAEM,QAAUP,EAAEO,OAAS,EAAG,CAEhD,IAAK64G,EAAqBp5G,GACxB,MAAM,IAAIkG,UAAU,0DAEtB,IAAKkzG,EAAqBn5G,GACxB,MAAM,IAAIiG,UAAU,0DAGtB,OAAOmzG,EAAmBr5G,EAAGC,EAC/B,CACE,MAAM,IAAIiG,UAAU,+BAExB,EACA,iBAAkB,SAAUlG,EAAGC,GAC7B,GAA8B,IAA1B6B,OAAOyB,KAAKvD,GAAGO,QAA0C,IAA1BuB,OAAOyB,KAAKtD,GAAGM,OAAc,CAC9D,IAAK+3G,EAAIt4G,GACP,MAAM,IAAIkG,UAAU,+DAEtB,IAAK+yG,EAAIh5G,GACP,MAAM,IAAIiG,UAAU,iFAEtB,GAAI,WAAYlG,GAAK,WAAYA,GAAK,eAAgBC,GAAK,eAAgBA,GAAK,aAAcA,EAC5F,OAAOw4G,EAAqBz4G,EAAE+4G,OAAQ/4G,EAAEg5G,OAAQ/4G,EAAEq5G,WAAYr5G,EAAEs5G,WAAYt5G,EAAE0kG,UAE9E,MAAM,IAAIz+F,UAAU,yBAExB,CAAO,GAA8B,IAA1BpE,OAAOyB,KAAKvD,GAAGO,QAA0C,IAA1BuB,OAAOyB,KAAKtD,GAAGM,OAAc,CAErE,IAAK04G,EAAIj5G,GACP,MAAM,IAAIkG,UAAU,uEAEtB,IAAKgzG,EAAgBj5G,GACnB,MAAM,IAAIiG,UAAU,oEAEtB,GAAI,WAAYlG,GAAK,WAAYA,GAAK,OAAQC,GAAK,OAAQA,GAAK,OAAQA,GAAK,MAAOA,GAAK,MAAOA,GAAK,MAAOA,EAC1G,OAAOk5G,EAAqBn5G,EAAE+4G,OAAQ/4G,EAAEg5G,OAAQh5G,EAAEw5G,OAAQv5G,EAAEw5G,GAAIx5G,EAAE8vD,GAAI9vD,EAAEy5G,GAAIz5G,EAAEkZ,EAAGlZ,EAAEiZ,EAAGjZ,EAAEiE,GAExF,MAAM,IAAIgC,UAAU,yBAExB,CAAO,GAA8B,IAA1BpE,OAAOyB,KAAKvD,GAAGO,QAA0C,IAA1BuB,OAAOyB,KAAKtD,GAAGM,OAAc,CAErE,IAAK+3G,EAAIt4G,GACP,MAAM,IAAIkG,UAAU,qEAEtB,IAAKoyG,EAAIr4G,GACP,MAAM,IAAIiG,UAAU,qEAEtB,GAAI,cAAelG,GAAK,cAAeA,GAAK,cAAeC,GAAK,cAAeA,EAC7E,OAAOo5G,EAAmB,CAACr5G,EAAE25G,UAAW35G,EAAE45G,WAAY,CAAC35G,EAAE45G,UAAW55G,EAAE65G,YAEtE,MAAM,IAAI5zG,UAAU,yBAExB,CAAO,GAA8B,IAA1BpE,OAAOyB,KAAKvD,GAAGO,QAA0C,IAA1BuB,OAAOyB,KAAKtD,GAAGM,OAAc,CAErE,IAAK04G,EAAIj5G,GACP,MAAM,IAAIkG,UAAU,gFAEtB,IAAK+yG,EAAIh5G,GACP,MAAM,IAAIiG,UAAU,gFAEtB,GAAI,cAAelG,GAAK,cAAeA,GAAK,cAAeA,GACzD,cAAeC,GAAK,cAAeA,GAAK,cAAeA,EAEvD,OAAOo5G,EAAmB,CAACr5G,EAAE25G,UAAW35G,EAAE45G,UAAW55G,EAAE+5G,WAAY,CAAC95G,EAAE45G,UAAW55G,EAAE65G,UAAW75G,EAAE+5G,YAEhG,MAAM,IAAI9zG,UAAU,yBAExB,CACE,MAAM,IAAIA,UAAU,+BAExB,EACAjB,MAAO,SAAU6K,GACf,IAoDJ,SAAoBqJ,GAElB,GAAoB,IAAhBA,EAAE,GAAG5Y,QAAgB05G,EAAU9gG,EAAE,GAAG,KAAO8gG,EAAU9gG,EAAE,GAAG,KAC5D,GAAIA,EAAEpQ,MAAKmxG,GAAoB,IAAdA,EAAG35G,SAAiB05G,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MACrE,OAAO,MAEJ,MAAoB,IAAhB/gG,EAAE,GAAG5Y,QAAgB05G,EAAU9gG,EAAE,GAAG,KAAO8gG,EAAU9gG,EAAE,GAAG,KAAO8gG,EAAU9gG,EAAE,GAAG,KAKzF,OAAO,EAJP,GAAIA,EAAEpQ,MAAKmxG,GAAoB,IAAdA,EAAG35G,SAAiB05G,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAAQD,EAAUC,EAAG,MAC1F,OAAO,CAIX,CACA,OAAO,CACT,CAlESC,CAAUrqG,GAAQ,MAAM,IAAI5J,UAAU,oEAE3C,OA4FJ,SAA4BiT,GAC1B,MAAMlY,EAAS,GACf,IAAIm5G,EAAS,GACTC,EAAS,GACb,IAAK,IAAI/4G,EAAI,EAAGA,EAAI6X,EAAE5Y,OAAS,EAAGe,IAChC,IAAK,IAAIC,EAAID,EAAI,EAAGC,EAAI4X,EAAE5Y,OAAQgB,IACZ,IAAhB4X,EAAE,GAAG5Y,QACP65G,EAAS,CAACjhG,EAAE7X,GAAG,GAAI6X,EAAE7X,GAAG,IACxB+4G,EAAS,CAAClhG,EAAE5X,GAAG,GAAI4X,EAAE5X,GAAG,KACC,IAAhB4X,EAAE,GAAG5Y,SACd65G,EAAS,CAACjhG,EAAE7X,GAAG,GAAI6X,EAAE7X,GAAG,GAAI6X,EAAE7X,GAAG,IACjC+4G,EAAS,CAAClhG,EAAE5X,GAAG,GAAI4X,EAAE5X,GAAG,GAAI4X,EAAE5X,GAAG,KAEnCN,EAAOO,KAAK63G,EAAmBe,EAAQC,IAG3C,OAAOp5G,CACT,CA7GWq5G,CAAkBxqG,EAC3B,IAGF,SAASmqG,EAAW9gG,GAElB,MAAqB,iBAANA,GAAkBiH,EAAYjH,EAC/C,CAEA,SAASm/F,EAAKn/F,GAKZ,OAHIA,EAAEtU,cAAgBI,QACpBkU,EAAIu/F,EAAev/F,IAEd8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,GACxC,CAEA,SAAS8/F,EAAK9/F,GAKZ,OAHIA,EAAEtU,cAAgBI,QACpBkU,EAAIu/F,EAAev/F,IAEd8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,GAC3D,CAEA,SAASigG,EAAsBjgG,GAK7B,OAHKlU,MAAMC,QAAQiU,KACjBA,EAAIu/F,EAAev/F,IAEdA,EAAErG,MAAMmnG,EACjB,CAEA,SAASf,EAAiB//F,GAIxB,OAHIA,EAAEtU,cAAgBI,QACpBkU,EAAIu/F,EAAev/F,IAEd8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,KACvD8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,KAAO8gG,EAAU9gG,EAAE,GACtD,CAEA,SAASu/F,EAAgB36F,GACvB,MAAMxa,EAAOzB,OAAOyB,KAAKwa,GACnB5E,EAAI,GACV,IAAK,IAAI7X,EAAI,EAAGA,EAAIiC,EAAKhD,OAAQe,IAC/B6X,EAAE3X,KAAKuc,EAAExa,EAAKjC,KAEhB,OAAO6X,CACT,CAkBA,SAASs/F,EAAsBz4G,EAAGC,EAAGkZ,EAAGD,EAAGhV,GACzC,MAAM4uB,EAAM1L,EAAIk2B,EAAUA,EAAUC,EAAepkC,EAAGnZ,GAAIu9C,EAAerkC,EAAGjZ,IAAKiE,IAC3Eq2G,EAAM3xF,EAAK00B,EAAUC,EAAepkC,EAAGA,GAAIokC,EAAerkC,EAAGA,KACnE,OAAOu1C,EAAa37B,EAAKynF,EAC3B,CAEA,SAASpB,EAAsBn5G,EAAGC,EAAGC,EAAGu5G,EAAI1pD,EAAI2pD,EAAIvgG,EAAGD,EAAGhV,GACxD,IAAI4uB,EAAM,CAACytB,EAAehD,EAAegD,EAAewP,EAAI9vD,GAAIiE,GAAIq5C,EAAegD,EAAem5D,EAAIx5G,GAAIgZ,IACxGqnC,EAAehD,EAAegD,EAAem5D,EAAIx5G,GAAIiZ,GAAIokC,EAAegD,EAAek5D,EAAIz5G,GAAIkE,IAC/Fq8C,EAAehD,EAAegD,EAAek5D,EAAIz5G,GAAIkZ,GAAIqkC,EAAegD,EAAewP,EAAI9vD,GAAIkZ,KACjG2Z,EAAMlK,EAAK00B,EAAUA,EAAUC,EAAezqB,EAAI,GAAIA,EAAI,IAAKyqB,EAAezqB,EAAI,GAAIA,EAAI,KAAMyqB,EAAezqB,EAAI,GAAIA,EAAI,MAC3H,MAAMynF,EAAM3xF,EAAK00B,EAAUA,EAAUC,EAAepkC,EAAGA,GAAIokC,EAAerkC,EAAGA,IAAKqkC,EAAer5C,EAAGA,KACpG,OAAOuqD,EAAa37B,EAAKynF,EAC3B,CAEA,SAASlB,EAAoBr5G,EAAGC,GAC9B,MAAMu6G,EAAax6G,EAAEO,OACrB,IAAIU,EAAS,EACT89B,EAAO,EACX,IAAK,IAAIz9B,EAAI,EAAGA,EAAIk5G,EAAYl5G,IAC9By9B,EAAOwhB,EAAevgD,EAAEsB,GAAIrB,EAAEqB,IAC9BL,EAASq8C,EAAUC,EAAexe,EAAMA,GAAO99B,GAEjD,OAAO2nB,EAAK3nB,EACd,CAmBA,IC7SWw5G,GAAkCt7G,GALlC,YACQ,CACnB,QAAS,SAAU,MAAO,MAAO,YAAa,SAAU,WAAY,iBAAkB,eAAgB,WAAY,UAAW,cAAe,UAAW,SAAU,cAGxF0D,IAAwJ,IAAvJ,MAAE4C,EAAK,OAAEyf,EAAM,IAAEkC,EAAG,IAAE1c,EAAG,UAAE4yC,EAAS,OAAEpzB,EAAM,SAAEutB,EAAQ,eAAE8F,EAAc,aAAEkR,EAAY,SAAE14B,EAAQ,QAAE6qB,EAAO,YAAExT,EAAW,QAAEnzB,EAAO,OAAE4U,EAAM,UAAEke,GAAWlqC,EA4B5N,OAAO4C,EAAM,YAAa,CACxB,sBAAuBi1G,EAEvB,6BAA8BC,EAE9B,yBAA0B,SAAU36G,EAAGC,EAAG26G,GACxC,MAAM9qG,EAAM4qG,EAAK16G,EAAEgf,UAAW/e,EAAE+e,UAAW47F,EAAM57F,WACjD,OAAe,OAARlP,EAAe,KAAOoa,EAAOpa,EACtC,EAEA,iCAAkC,SAAU3P,EAAGH,EAAGC,EAAGC,GAEnD,MAAM4P,EAAM6qG,EAAMx6G,EAAE6e,UAAWhf,EAAEgf,UAAW/e,EAAE+e,UAAW9e,EAAE8e,WAC3D,OAAe,OAARlP,EAAe,KAAOoa,EAAOpa,EACtC,IAGF,SAAS4qG,EAAM16G,EAAGC,EAAG26G,GAKnB,GAJA56G,EAAI66G,EAAW76G,GACfC,EAAI46G,EAAW56G,GACf26G,EAAQC,EAAWD,IAEd3B,EAAIj5G,GAAM,MAAM,IAAIkG,UAAU,kEACnC,IAAK+yG,EAAIh5G,GAAM,MAAM,IAAIiG,UAAU,mEACnC,IAmDF,SAAclG,GACZ,OAAoB,IAAbA,EAAEO,QAAgBwsC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,GAChG,CArDO86G,CAAIF,GAAU,MAAM,IAAI10G,UAAU,mDAEvC,OAwGF,SAA8BwxB,EAAIqjF,EAAIC,EAAI9oF,EAAI+oF,EAAIC,EAAIl7G,EAAGC,EAAGC,EAAGgE,GAC7D,MAAMi3G,EAAM59D,EAAe7lB,EAAI13B,GACzBo7G,EAAM79D,EAAerrB,EAAIlyB,GACzBq7G,EAAM99D,EAAew9D,EAAI96G,GACzBq7G,EAAM/9D,EAAe09D,EAAIh7G,GACzBs7G,EAAMh+D,EAAey9D,EAAI96G,GACzBs7G,EAAMj+D,EAAe29D,EAAIh7G,GAEzBu3B,EAAY1B,EAASA,EAASA,EAAS7xB,EAAGi3G,GAAME,GAAME,GACtD3oF,EAAcmD,EAASA,EAASA,EAASunB,EAAUA,EAAU89D,EAAKE,GAAME,GAAML,GAAME,GAAME,GAE1Fx7G,EAAI0uD,EAAah3B,EAAW7E,GAKlC,MAAO,CAHI0qB,EAAU5lB,EAAI6lB,EAAex9C,EAAGg2B,EAAS7D,EAAIwF,KAC7C4lB,EAAUy9D,EAAIx9D,EAAex9C,EAAGg2B,EAASklF,EAAIF,KAC7Cz9D,EAAU09D,EAAIz9D,EAAex9C,EAAGg2B,EAASmlF,EAAIF,KAK1D,CA5HSS,CAAoBz7G,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAI26G,EAAM,GAAIA,EAAM,GAAIA,EAAM,GAAIA,EAAM,GACrG,CAEA,SAASD,EAAOx6G,EAAGH,EAAGC,EAAGC,GAMvB,GALAC,EAAI06G,EAAW16G,GACfH,EAAI66G,EAAW76G,GACfC,EAAI46G,EAAW56G,GACfC,EAAI26G,EAAW36G,GAEE,IAAbC,EAAEI,OAAc,CAClB,IAAK+3G,EAAIn4G,GAAM,MAAM,IAAI+F,UAAU,kEACnC,IAAKoyG,EAAIt4G,GAAM,MAAM,IAAIkG,UAAU,mEACnC,IAAKoyG,EAAIr4G,GAAM,MAAM,IAAIiG,UAAU,kEACnC,IAAKoyG,EAAIp4G,GAAM,MAAM,IAAIgG,UAAU,mEAEnC,OAsCJ,SAAuBw1G,EAAKC,EAAKC,EAAKC,GACpC,MAAMC,EAAKJ,EACLK,EAAKH,EACLjnF,EAAKoB,EAAS+lF,EAAIH,GAClB/mF,EAAKmB,EAASgmF,EAAIF,GAClBtsB,EAAMx5D,EAASwnB,EAAe5oB,EAAG,GAAIC,EAAG,IAAK2oB,EAAe3oB,EAAG,GAAID,EAAG,KAC5E,GAAI9F,EAAO0gE,GAAM,OAAO,KACxB,GAAI3uC,EAAQx5B,EAAImoE,GAAMrqE,EAAOuD,QAC3B,OAAO,KAET,MAAMuzF,EAASz+D,EAAe3oB,EAAG,GAAIknF,EAAG,IAClCG,EAAS1+D,EAAe3oB,EAAG,GAAIknF,EAAG,IAClCI,EAAS3+D,EAAe3oB,EAAG,GAAImnF,EAAG,IAClCI,EAAS5+D,EAAe3oB,EAAG,GAAImnF,EAAG,IAClCh8G,EAAI0uD,EAAanR,EAAUvnB,EAASA,EAASimF,EAAQC,GAASC,GAASC,GAAS5sB,GACtF,OAAO7kF,EAAI+sC,EAAS9iB,EAAI50B,GAAI+7G,EAC9B,CAtDWM,CAAaj8G,EAAGH,EAAGC,EAAGC,EAC/B,CAAO,GAAiB,IAAbC,EAAEI,OAAc,CACzB,IAAK04G,EAAI94G,GAAM,MAAM,IAAI+F,UAAU,kEACnC,IAAK+yG,EAAIj5G,GAAM,MAAM,IAAIkG,UAAU,mEACnC,IAAK+yG,EAAIh5G,GAAM,MAAM,IAAIiG,UAAU,kEACnC,IAAK+yG,EAAI/4G,GAAM,MAAM,IAAIgG,UAAU,mEAEnC,OAyDJ,SAAuBwxB,EAAIqjF,EAAIC,EAAI9oF,EAAI+oF,EAAIC,EAAImB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,MAAMC,EAAQC,EAAmBllF,EAAI2kF,EAAIG,EAAIH,EAAItB,EAAIuB,EAAIG,EAAIH,EAAItB,EAAIuB,EAAIG,EAAIH,GACvEM,EAAQD,EAAmBJ,EAAIH,EAAInqF,EAAIwF,EAAI+kF,EAAIH,EAAIrB,EAAIF,EAAI2B,EAAIH,EAAIrB,EAAIF,GACvE8B,EAAQF,EAAmBllF,EAAI2kF,EAAInqF,EAAIwF,EAAIqjF,EAAIuB,EAAIrB,EAAIF,EAAIC,EAAIuB,EAAIrB,EAAIF,GACvE+B,EAAQH,EAAmBJ,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,EAAII,EAAIH,EAAIG,EAAIH,GACvES,EAAQJ,EAAmB1qF,EAAIwF,EAAIxF,EAAIwF,EAAIujF,EAAIF,EAAIE,EAAIF,EAAIG,EAAIF,EAAIE,EAAIF,GACvEvjF,EAAY1B,EAASwnB,EAAeo/D,EAAOE,GAAQt/D,EAAeu/D,EAAOC,IACzEnqF,EAAcmD,EAASwnB,EAAey/D,EAAOD,GAAQx/D,EAAes/D,EAAOA,IACjF,GAAIhuF,EAAO+D,GAAc,OAAO,KAChC,MAAMqqF,EAAKxuD,EAAah3B,EAAW7E,GAC7BsqF,EAAKzuD,EAAanR,EAAUq/D,EAAOp/D,EAAe0/D,EAAIJ,IAASE,GAE/DI,EAAM7/D,EAAU5lB,EAAI6lB,EAAe0/D,EAAIlnF,EAAS7D,EAAIwF,KACpD0lF,EAAM9/D,EAAUy9D,EAAIx9D,EAAe0/D,EAAIlnF,EAASklF,EAAIF,KACpDsC,EAAM//D,EAAU09D,EAAIz9D,EAAe0/D,EAAIlnF,EAASmlF,EAAIF,KACpDsC,EAAMhgE,EAAU++D,EAAI9+D,EAAe2/D,EAAInnF,EAASymF,EAAIH,KACpDkB,EAAMjgE,EAAUg/D,EAAI/+D,EAAe2/D,EAAInnF,EAAS0mF,EAAIH,KACpDkB,EAAMlgE,EAAUi/D,EAAIh/D,EAAe2/D,EAAInnF,EAAS2mF,EAAIH,KAC1D,OAAInvE,EAAY+vE,EAAKG,IAAQlwE,EAAYgwE,EAAKG,IAAQnwE,EAAYiwE,EAAKG,GAC9D,CAACL,EAAKC,EAAKC,GAEX,IAEX,CAhFWI,CAAat9G,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIH,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIC,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAC1F,CACE,MAAM,IAAIgG,UAAU,sDAExB,CAGA,SAAS20G,EAAY/qG,GAEnB,OAAmB,IAAfA,EAAIvP,OAAqBuP,EAAI,GAG7BA,EAAIvP,OAAS,GAAK0E,MAAMC,QAAQ4K,EAAI,KAClCA,EAAIgD,OAAMo0D,GAAMjiE,MAAMC,QAAQgiE,IAAqB,IAAdA,EAAG3mE,SAAsB0Z,EAAQnK,GAGrEA,CACT,CAEA,SAASwoG,EAAKt4G,GACZ,OAAoB,IAAbA,EAAEO,QAAgBwsC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,GAC1D,CAEA,SAASi5G,EAAKj5G,GACZ,OAAoB,IAAbA,EAAEO,QAAgBwsC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,KAAO+sC,EAAU/sC,EAAE,GAC7E,CAwBA,SAAS48G,EAAoBzjG,EAAGD,EAAGhV,EAAG7D,EAAGmY,EAAG9X,EAAGua,EAAGjX,EAAG1C,EAAGC,EAAGjB,EAAG4lD,GAE5D,MAAMw3D,EAAOngE,EAAexnB,EAAS5c,EAAGD,GAAI6c,EAAS7xB,EAAG7D,IAClDs9G,EAAOpgE,EAAexnB,EAASvd,EAAG9X,GAAIq1B,EAAS9a,EAAGjX,IAClD45G,EAAOrgE,EAAexnB,EAASz0B,EAAGC,GAAIw0B,EAASz1B,EAAG4lD,IACxD,OAAO5I,EAAUA,EAAUogE,EAAMC,GAAOC,EAC1C,CA+CA,ICjLWC,GAA4B1+G,GAH5B,MACQ,CAAC,QAAS,SAAU,MAAO,YAEqB0D,IAAqC,IAApC,MAAE4C,EAAK,OAAEyf,EAAM,IAAExa,EAAG,QAAEgqC,GAAS7xC,EAyBnG,OAAO4C,EA5BI,MA4BQ,CAEjB,iBAAkBq4G,EAGlB,qCAwCF,SAAmB9zF,EAAOmX,GACxB,IAEE,OADY+B,GAAOlZ,EAAOmX,EAAKz2B,EAEjC,CAAE,MAAO0B,GACP,MAAM8nD,GAAoB9nD,EAAK,MACjC,CACF,EA5CE,MAAO,SAAUN,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,0CAGtB,OAAO43G,EAAKhyG,EACd,IASF,SAASgyG,EAAM9zF,GACb,IAAIuN,EAkBJ,OAhBAoO,GAAY3b,GAAO,SAAUhjB,GAC3B,IACEuwB,OAAez0B,IAARy0B,EAAqBvwB,EAAQ0D,EAAI6sB,EAAKvwB,EAC/C,CAAE,MAAOoF,GACP,MAAM8nD,GAAoB9nD,EAAK,MAAOpF,EACxC,CACF,SAGYlE,IAARy0B,IACFA,EAAMmd,EAAQ,EAAGxvB,EAAOC,SAEP,iBAARoS,IACTA,EAAMmd,EAAQnd,EAAKvS,GAAeuS,EAAKrS,KAGlCqS,CACT,CASA,IC9EIxyB,GAAO,SAGAg5G,GAA+B5+G,GAAQ4F,GAF/B,CAAC,QAAS,MAAO,cAEkClC,IAA+B,IAA9B,MAAE4C,EAAK,IAAEiF,EAAG,UAAEwjF,GAAWrrF,EA2BhG,OAAO4C,EAAMV,GAAM,CAEjBE,MAAO+4G,EACP9+E,OAAQ,SAAUhV,GAChB,OAAOA,EAAOvlB,OAAOq5G,EAAQ9zF,EAAOlL,UAAWkL,EAAOkV,YACxD,EAGA,4BAA6B6+E,EAC7B,6BAA8B,SAAU/zF,EAAQiX,GAC9C,OAAOjX,EAAOvlB,OAAOs5G,EAAY/zF,EAAOlL,UAAWmiB,GAAMjX,EAAOkV,WAClE,EAGA,MAAO,SAAUtzB,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,uDAGtB,OAAO83G,EAAQlyG,EACjB,IASF,SAASkyG,EAASh0F,GAChB,IACE,OAAOk0F,EAAWl0F,EACpB,CAAE,MAAO5d,GACP,MAAM8nD,GAAoB9nD,EAAKrH,GACjC,CACF,CAEA,SAASm5G,EAAYl0F,GACnB,GAAqB,IAAjBA,EAAMzpB,OACR,MAAO,GAGT,MAAM49G,EAAO,CAACjwB,EAAUlkE,EAAM,KAC9B,IAAK,IAAI1oB,EAAI,EAAGA,EAAI0oB,EAAMzpB,SAAUe,EAIlC68G,EAAK38G,KAAKkJ,EAAIyzG,EAAK78G,EAAI,GAAI0oB,EAAM1oB,KAEnC,OAAO68G,CACT,CAEA,SAASF,EAAaj0F,EAAOmX,GAC3B,MAAM1hB,EAAOwhB,GAAUjX,GACvB,GAAImX,EAAM,GAAMA,GAAO1hB,EAAKlf,OAE1B,MAAM,IAAIygC,GAAWG,EAAK1hB,EAAKlf,QAGjC,IACE,OAAO69G,EAAmBp0F,EAAOmX,EACnC,CAAE,MAAO/0B,GACP,MAAM8nD,GAAoB9nD,EAAKrH,GACjC,CACF,CAGA,SAASq5G,EAAoB1zE,EAAKvJ,GAChC,IAAI7/B,EAAGw5B,EAAKqQ,EAEZ,GAAIhK,GAAO,EAAG,CACZ,MAAMk9E,EAAe3zE,EAAI,GAAG,GAC5B,GAAKzlC,MAAMC,QAAQm5G,GAEZ,CAGL,IAFAlzE,EAAOV,GAAQC,GACf5P,EAAM,GACDx5B,EAAI,EAAGA,EAAI6pC,EAAK5qC,OAAQe,IAC3Bw5B,EAAIx5B,GAAK88G,EAAmBjzE,EAAK7pC,GAAI6/B,EAAM,GAE7C,OAAOrG,CACT,CARE,OAAOojF,EAAWxzE,EAStB,CAEE,IADA5P,EAAM,GACDx5B,EAAI,EAAGA,EAAIopC,EAAInqC,OAAQe,IAC1Bw5B,EAAIx5B,GAAK88G,EAAmB1zE,EAAIppC,GAAI6/B,EAAM,GAE5C,OAAOrG,CAEX,KCzHI/1B,GAAO,OAGAu5G,GAA6Bn/G,GAAQ4F,GAF7B,CAAC,QAAS,MAAO,WAEgClC,IAA4B,IAA3B,MAAE4C,EAAK,IAAEiF,EAAG,OAAEilB,GAAQ9sB,EA4B3F,OAAO4C,EAAMV,GAAM,CAEjB,iBAAkBw5G,EAGlB,qCAoBF,SAAoBv0F,EAAOmX,GACzB,IACE,MAAM5J,EAAM2L,GAAOlZ,EAAOmX,EAAKz2B,GACzBjB,EAAIxE,MAAMC,QAAQ8kB,GAASiX,GAAUjX,GAASA,EAAMvK,OAC1D,OAAOkQ,EAAO4H,EAAK9tB,EAAE03B,GACvB,CAAE,MAAO/0B,GACP,MAAM8nD,GAAoB9nD,EAAK,OACjC,CACF,EAzBE,MAAO,SAAUN,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,2CAGtB,OAAOq4G,EAAMzyG,EACf,IA2BF,SAASyyG,EAAOv0F,GACd,IAAIuN,EACAzE,EAAM,EAWV,GATA6S,GAAY3b,GAAO,SAAUhjB,GAC3B,IACEuwB,OAAcz0B,IAARy0B,EAAoBvwB,EAAQ0D,EAAI6sB,EAAKvwB,GAC3C8rB,GACF,CAAE,MAAO1mB,GACP,MAAM8nD,GAAoB9nD,EAAK,OAAQpF,EACzC,CACF,IAEY,IAAR8rB,EACF,MAAM,IAAIjd,MAAM,+CAElB,OAAO8Z,EAAO4H,EAAKzE,EACrB,KCzFI/tB,GAAO,SAGAy5G,GAA+Br/G,GAAQ4F,GAF/B,CAAC,QAAS,MAAO,SAAU,UAAW,oBAEalC,IAAsD,IAArD,MAAE4C,EAAK,IAAEiF,EAAG,OAAEilB,EAAM,QAAEiG,EAAO,gBAAEk2E,GAAiBjpG,EAOvH,SAAS47G,EAASz0F,GAChB,IAGE,MAAM8I,GAFN9I,EAAQ/P,GAAQ+P,EAAMhL,YAEJze,OAClB,GAAY,IAARuyB,EACF,MAAM,IAAIjd,MAAM,6CAGlB,GAAIid,EAAM,GAAM,EAAG,CAEjB,MAAM4rF,EAAM5rF,EAAM,EAAI,EAChB2sC,EAAQqsC,EAAgB9hF,EAAO00F,EAAM,GAG3C,IAAIl/C,EAAOx1C,EAAM00F,GACjB,IAAK,IAAIp9G,EAAI,EAAGA,EAAIo9G,IAAOp9G,EACrBs0B,EAAQ5L,EAAM1oB,GAAIk+D,GAAQ,IAC5BA,EAAOx1C,EAAM1oB,IAIjB,OAAOq9G,EAAQn/C,EAAMC,EACvB,CAAO,CAEL,MAAMlwC,EAAIu8E,EAAgB9hF,GAAQ8I,EAAM,GAAK,GAE7C,OAAO8rF,EAAOrvF,EAChB,CACF,CAAE,MAAOnjB,GACP,MAAM8nD,GAAoB9nD,EAAK,SACjC,CACF,CAGA,MAAMwyG,EAASn5G,EAAM,CACnB,sCAAuC,SAAUuB,GAC/C,OAAOA,CACT,IAII23G,EAAUl5G,EAAM,CACpB,2EAA4E,SAAU+5D,EAAMC,GAC1F,OAAO9vC,EAAOjlB,EAAI80D,EAAMC,GAAQ,EAClC,IA6BF,OAAOh6D,EAAMV,GAAM,CAEjB,iBAAkB05G,EAGlB,qCAAsC,SAAUz0F,EAAOmX,GAErD,MAAM,IAAItrB,MAAM,sCAElB,EAGA,MAAO,SAAU/J,GACf,GAAI++B,GAAoB/+B,GACtB,MAAM,IAAI5F,UAAU,6CAGtB,OAAOu4G,EAAQ3yG,EACjB,GACA,ICrGS+yG,GAA4B1/G,GAH5B,MACQ,CAAC,QAAS,MAAO,MAAO,SAAU,aAEc0D,IAA2C,IAA1C,MAAE4C,EAAK,IAAE2hB,EAAG,IAAEle,EAAG,OAAEqkG,EAAM,SAAEx3E,GAAUlzB,EAyBzG,OAAO4C,EA5BI,MA4BQ,CAEjB,iBAAkBq5G,EAGlB,MAAO,SAAUhzG,GACf,OAAOgzG,EAAKhzG,EACd,IAGF,SAASgzG,EAAM90F,GAGb,GAAqB,KAFrBA,EAAQ/P,GAAQ+P,EAAMhL,YAEZze,OACR,MAAM,IAAIsV,MAAM,sEAGlB,IACE,MAAMkpG,EAAMxR,EAAOvjF,GACnB,OAAOujF,EAAOrkG,EAAI8gB,GAAO,SAAUhjB,GACjC,OAAOogB,EAAI2O,EAAS/uB,EAAO+3G,GAC7B,IACF,CAAE,MAAO3yG,GACP,MAAIA,aAAelG,WAAakG,EAAIrG,QAAQsc,SAAS,UAC7C,IAAInc,UAAUkG,EAAIrG,QAAQ2W,QAAQ,SAAU,QAE5Cw3C,GAAoB9nD,EAAK,MAEnC,CACF,KCxDI4yG,GAAwB,WAExBj6G,GAAO,WAGAk6G,GAAiC9/G,GAAQ4F,GAFjC,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,YAAa,UAEXlC,IAA6E,IAA5E,MAAE4C,EAAK,IAAEiF,EAAG,SAAEqrB,EAAQ,SAAE0hB,EAAQ,OAAE9nB,EAAM,UAAE47E,EAAWnuF,MAAO22C,GAAWlxD,EAsDhJ,OAAO4C,EAAMV,GAAM,CAEjB,iBAAkB,SAAUilB,GAC1B,OAAOk1F,EAAKl1F,EAAOg1F,GACrB,EAGA,yBAA0BE,EAG1B,qCAAsC,SAAUl1F,EAAOmX,GACrD,OAAOg+E,EAAQn1F,EAAOmX,EAAK69E,GAC7B,EAGA,6CAA8CG,EAG9C,MAAO,SAAUrzG,GACf,OAAOozG,EAAKpzG,EAAMkzG,GACpB,IAcF,SAASE,EAAMl1F,EAAOo1F,GACpB,IAAI7nF,EACAzE,EAAM,EAEV,GAAqB,IAAjB9I,EAAMzpB,OACR,MAAM,IAAI2K,YAAY,kEAYxB,GARAy6B,GAAY3b,GAAO,SAAUhjB,GAC3B,IACEuwB,OAAcz0B,IAARy0B,EAAoBvwB,EAAQ0D,EAAI6sB,EAAKvwB,GAC3C8rB,GACF,CAAE,MAAO1mB,GACP,MAAM8nD,GAAoB9nD,EAAK,WAAYpF,EAC7C,CACF,IACY,IAAR8rB,EAAW,MAAM,IAAIjd,MAAM,+CAE/B,MAAMy3F,EAAO39E,EAAO4H,EAAKzE,GASzB,GANAyE,OAAMz0B,EACN6iC,GAAY3b,GAAO,SAAUhjB,GAC3B,MAAM+3B,EAAOhJ,EAAS/uB,EAAOsmG,GAC7B/1E,OAAcz0B,IAARy0B,EAAoBkgB,EAAS1Y,EAAMA,GAAQr0B,EAAI6sB,EAAKkgB,EAAS1Y,EAAMA,GAC3E,IAEIg1B,EAAUx8B,GACZ,OAAOA,EAGT,OAAQ6nF,GACN,IAAK,cACH,OAAOzvF,EAAO4H,EAAKzE,GAErB,IAAK,SACH,OAAOnD,EAAO4H,EAAKzE,EAAM,GAE3B,IAAK,WACL,CACE,MAAMob,EAAO9tB,EAAYmX,GAAOA,EAAItD,IAAI,GAAK,EAC7C,OAAgB,IAARnB,EAAaob,EAAOve,EAAO4H,EAAKzE,EAAM,EAChD,CAEA,QACE,MAAM,IAAIjd,MAAM,0BAA4BupG,EAA5B,+DAGtB,CAEA,SAASD,EAASn1F,EAAOmX,EAAKi+E,GAC5B,IACE,GAAqB,IAAjBp1F,EAAMzpB,OACR,MAAM,IAAI2K,YAAY,kEAExB,OAAOqgG,EAAUvhF,EAAOmX,GAAMnhC,GAAMk/G,EAAKl/G,EAAGo/G,IAC9C,CAAE,MAAOhzG,GACP,MAAM8nD,GAAoB9nD,EAAK,WACjC,CACF,KC1JIrH,GAAO,cAGAs6G,GAAoClgH,GAAQ4F,GAFpC,CAAC,QAAS,aAAc,MAAO,WAAY,SAAU,WAAY,kBAAmB,UAAW,YAAa,UAAW,YAAa,SAAU,cAEtFlC,IAAuI,IAAtI,MAAE4C,EAAK,UAAEykD,EAAS,IAAEx/C,EAAG,SAAEqrB,EAAQ,OAAEpG,EAAM,SAAE8nB,EAAQ,gBAAEq0D,EAAe,QAAEl2E,EAAO,UAAE/Q,EAAS,QAAE+7B,EAAO,UAAEuJ,EAAS,OAAEC,EAAM,UAAEmhD,GAAW1oG,EAmC7M,OAAO4C,EAAMV,GAAM,CACjB,qCAAsCu6G,CAACv7G,EAAMoF,IAAMo2G,EAAuBx7G,EAAMoF,GAAG,GACnF,6CAA8Cq2G,CAACz7G,EAAM07G,EAAMt+E,IAAQu+E,EAAgB37G,EAAM07G,GAAM,EAAOt+E,EAAKo+E,GAC3G,8CAA+CA,EAC/C,sDAAuDI,CAAC57G,EAAM07G,EAAMG,EAAQz+E,IAAQu+E,EAAgB37G,EAAM07G,EAAMG,EAAQz+E,EAAKo+E,GAC7H,iCAAkCM,CAAC97G,EAAMoF,IAAM22G,EAA2B/7G,EAAMoF,GAAG,GACnF,yCAA0C42G,CAACh8G,EAAM07G,EAAMt+E,IAAQu+E,EAAgB37G,EAAM07G,GAAM,EAAOt+E,EAAK2+E,GACvG,0CAA2CA,EAC3C,kDAAmDE,CAACj8G,EAAM07G,EAAMG,EAAQz+E,IAAQu+E,EAAgB37G,EAAM07G,EAAMG,EAAQz+E,EAAK2+E,KAG3H,SAASJ,EAAiB37G,EAAM07G,EAAMG,EAAQz+E,EAAK75B,GACjD,OAAOikG,EAAUxnG,EAAMo9B,GAAKnhC,GAAKsH,EAAGtH,EAAGy/G,EAAMG,IAC/C,CAEA,SAASL,EAAwBx7G,EAAMk8G,EAASL,GAC9C,IAAIM,EACJ,MAAMC,EAAUp8G,EAAKib,UACrB,GAAI4hC,EAAQq/D,EAAS,GACnB,MAAM,IAAIpqG,MAAM,+BAElB,GAAIs0C,EAAU81D,EAAS,GAErB,OAAO9/F,EAAS8/F,GACZG,EAAaD,EAASF,EAASL,GAC/B11D,EAAUk2D,EAAaD,EAASF,EAASL,IAE/C,GAAIx1D,EAAO61D,EAAS,GAAI,CAEtB,IAAKp7F,EAAUo7F,GACb,MAAM,IAAIpqG,MAAM,gCAKlB,GAAIu0C,EAAO61D,EAAS,YAClB,MAAM,IAAIpqG,MAAM,qFAGlB,MAAMwqG,EAAW31G,EAAIu1G,EAAS,GAC9BC,EAAU,GAEV,IAAK,IAAI5+G,EAAI,EAAGs/C,EAAQt/C,EAAG2+G,GAAU3+G,IAAK,CACxC,MAAMm+G,EAAO9vF,EAAOruB,EAAI,EAAG++G,GAC3BH,EAAQ1+G,KAAK4+G,EAAaD,EAASV,EAAMG,GAC3C,CAEA,OAAOz/F,EAAS8/F,GAAWC,EAAUh2D,EAAUg2D,EACjD,CACF,CAYA,SAASJ,EAA4B/7G,EAAMk8G,EAASL,GAClD,MAAMO,EAAUp8G,EAAKib,UAEfshG,EAAaL,EAAQjhG,UACrBkhG,EAAU,GAChB,IAAK,IAAI5+G,EAAI,EAAGA,EAAIg/G,EAAW//G,SAAUe,EACvC4+G,EAAQ1+G,KAAK4+G,EAAaD,EAASG,EAAWh/G,GAAIs+G,IAEpD,OAAOM,CACT,CAWA,SAASE,EAAcp2F,EAAOy1F,EAAMG,GAClC,MAAMl8E,EAAOzpB,GAAQ+P,GACflR,EAAM4qB,EAAKnjC,OACjB,GAAY,IAARuY,EACF,MAAM,IAAIjD,MAAM,kDAGlB,MAAMlS,EAAQwc,EAASs/F,GAAQA,GAAQ3mG,EAAM,GAAK2mG,EAAKzwF,MAAMlW,EAAM,GAC7Dk4B,EAAc7wB,EAASs/F,GAAQ3yG,KAAKsM,MAAMzV,GAASA,EAAMyV,QAAQ6O,WACjEs4F,EAAWpgG,EAASs/F,GAAQ97G,EAAQ,EAAIA,EAAMurB,MAAM8hB,GAE1D,GAAInsB,EAAUlhB,GACZ,OAAOi8G,EACHl8E,EAAK//B,GACLmoG,EACApoE,EACAvjB,EAASs/F,GAAQ97G,EAAQA,EAAMqb,WAGrC,IAAIwgD,EACAC,EACJ,GAAImgD,EACFpgD,EAAO97B,EAAKsN,GACZyuB,EAAQ/7B,EAAKsN,EAAc,OACtB,CACLyuB,EAAQqsC,EAAgBpoE,EAAMsN,EAAc,GAG5CwuB,EAAO97B,EAAKsN,GACZ,IAAK,IAAI1vC,EAAI,EAAGA,EAAI0vC,IAAe1vC,EAC7Bs0B,EAAQ8N,EAAKpiC,GAAIk+D,GAAQ,IAC3BA,EAAO97B,EAAKpiC,GAGlB,CAEA,OAAOoJ,EAAI+sC,EAAS+nB,EAAMzpC,EAAS,EAAGwqF,IAAY9oE,EAASgoB,EAAO8gD,GACpE,KC3JWC,GAA4BrhH,GAH5B,MACQ,CAAC,QAAS,MAAO,OAAQ,aAEuB0D,IAAoC,IAAnC,MAAE4C,EAAK,IAAEyD,EAAG,KAAE0f,EAAI,SAAEonE,GAAUntF,EAqDlG,OAAO4C,EAxDI,MAwDQ,CAEjB,iBAAkBg7G,EAGlB,yBAA0BA,EAG1B,qCAAsCA,EAGtC,6CAA8CA,EAG9C,MAAO,SAAU30G,GACf,OAAO20G,EAAK30G,EACd,IAGF,SAAS20G,EAAMz2F,EAAOo1F,GACpB,GAAqB,IAAjBp1F,EAAMzpB,OACR,MAAM,IAAI2K,YAAY,6DAGxB,IACE,MAAM9K,EAAI4vF,EAAShjF,MAAM,KAAM/K,WAC/B,OAAI2e,EAAaxgB,GACR8I,EAAI9I,EAAGwoB,GAEPA,EAAKxoB,EAEhB,CAAE,MAAOgM,GACP,MAAIA,aAAelG,WAAakG,EAAIrG,QAAQsc,SAAS,aAC7C,IAAInc,UAAUkG,EAAIrG,QAAQ2W,QAAQ,YAAa,SAE/CtQ,CAEV,CACF,KC9FIrH,GAAO,OAGA27G,GAA6BvhH,GAAQ4F,GAF7B,CAAC,QAAS,SAAU,OAAQ,OAAQ,MAAO,MAAO,WAAY,WAAY,MAAO,WAEhClC,IAAwE,IAAvE,MAAE4C,EAAK,OAAEykB,EAAM,KAAEtB,EAAI,IAAE2O,EAAG,IAAE7sB,EAAG,SAAEqrB,EAAQ,SAAE0hB,EAAQ,IAAE/9B,EAAG,OAAEiW,GAAQ9sB,EAsBvI,OAAO4C,EAAMV,GAAM,CACjB,eAAgB,SAAUs3B,EAAGC,GAC3B,OAAOqkF,EAAMtkF,EAAGC,EAClB,EACA,iBAAkB,SAAUD,EAAGC,GAC7B,MAAM7B,EAAMkmF,EAAMtkF,EAAE2C,UAAW1C,EAAE0C,WACjC,OAAO/5B,MAAMC,QAAQu1B,GAAOvQ,EAAOuQ,GAAOA,CAC5C,IASF,SAASkmF,EAAOtkF,EAAGC,GACjB,MAAMskF,EAAe,GACrB,GAAI37G,MAAMC,QAAQm3B,EAAE,KAAOp3B,MAAMC,QAAQo3B,EAAE,IAAK,CAC9C,GAAID,EAAE97B,SAAW+7B,EAAE/7B,OACjB,MAAM,IAAI2K,YAAY,gEAExB,IAAK,IAAI5J,EAAI,EAAGA,EAAI+6B,EAAE97B,OAAQe,IAAK,CACjC,GAAI+6B,EAAE/6B,GAAGf,SAAW+7B,EAAEh7B,GAAGf,OACvB,MAAM,IAAI2K,YAAY,4EAExB01G,EAAap/G,KAAKq/G,EAAYxkF,EAAE/6B,GAAIg7B,EAAEh7B,IACxC,CACA,OAAOs/G,CACT,CACE,GAAIvkF,EAAE97B,SAAW+7B,EAAE/7B,OACjB,MAAM,IAAI2K,YAAY,4EAExB,OAAO21G,EAAYxkF,EAAGC,EAE1B,CACA,SAASukF,EAAaxkF,EAAGC,GACvB,MAAMz4B,EAAIw4B,EAAE97B,OACNugH,EAAOvpF,EAAI8E,GACX0kF,EAAOxpF,EAAI+E,GACX0kF,EAAQ3kF,EAAE6G,QAAO,CAACoC,EAAKtlC,EAAG2D,IAAU+G,EAAI46B,EAAKmS,EAASz3C,EAAGs8B,EAAE34B,MAAU,GACrEs9G,EAAa1pF,EAAI8E,EAAEnzB,KAAIlJ,GAAK0Z,EAAI1Z,EAAG,MACnCkhH,EAAa3pF,EAAI+E,EAAEpzB,KAAIjJ,GAAKyZ,EAAIzZ,EAAG,MACnCw3B,EAAY1B,EAAS0hB,EAAS5zC,EAAGm9G,GAAQvpE,EAASqpE,EAAMC,IACxDnuF,EAAchK,EAAK6uB,EAAS1hB,EAAS0hB,EAAS5zC,EAAGo9G,GAAavnG,EAAIonG,EAAM,IAAK/qF,EAAS0hB,EAAS5zC,EAAGq9G,GAAaxnG,EAAIqnG,EAAM,MAC/H,OAAOpxF,EAAO8H,EAAW7E,EAC3B,KCrEK,SAAS8P,GAASphC,EAAGuC,GAC1B,GAAIA,EAAIvC,EACN,OAAO,EAGT,GAAIuC,IAAMvC,EACR,OAAOuC,EAGT,MAAMs9G,EAAQt9G,EAAIvC,GAAM,EACxB,OAAOohC,GAAQphC,EAAG6/G,GAAQz+E,GAAQy+E,EAAO,EAAGt9G,EAC9C,CCZO,SAASu9G,GAAoBv9G,EAAGvD,GACrC,IAAKukB,GAAUhhB,IAAMA,EAAI,EACvB,MAAM,IAAIqC,UAAU,4DAEtB,IAAK2e,GAAUvkB,IAAMA,EAAI,EACvB,MAAM,IAAI4F,UAAU,4DAEtB,GAAI5F,EAAIuD,EACN,MAAM,IAAIqC,UAAU,qCAGtB,MAAMm7G,EAAUx9G,EAAIvD,EAEpB,IAAIghH,EAAS,EAETC,EAAc,EAClB,MAAMC,EAAelhH,EAAI+gH,EAAW/gH,EAAI+gH,EAGxC,IAAK,IAAII,EALenhH,EAAI+gH,EAAWA,EAAU,EAAI/gH,EAAI,EAKhBmhH,GAAiB59G,IAAK49G,EAE7D,IADAH,GAAUG,EACHF,GAAeC,GAAeF,EAASC,GAAgB,GAC5DD,GAAUC,IACRA,EAON,OAHIA,GAAeC,IACjBF,GAAU5+E,GAAQ6+E,EAAaC,IAE1BF,CACT,CACAF,GAAmB75G,UAAY,iBChC/B,MAAMxC,GAAO,eAGA28G,GAAqCviH,GAAQ4F,GAFrC,CAAC,UAEwDlC,IAAe,IAAd,MAAE4C,GAAO5C,EAwBtF,OAAO4C,EAAMV,GAAM,CACjB,iBAAkBq8G,GAElB,uBAAwB,SAAUv9G,EAAGvD,GACnC,MAAMipB,EAAY1lB,EAAEgB,YACpB,IAAI5D,EAAQK,EACZ,MAAM+/G,EAAUx9G,EAAEqrB,MAAM5uB,GAClBkwB,EAAM,IAAIjH,EAAU,GAE1B,IAAKo4F,GAAkB99G,KAAO89G,GAAkBrhH,GAC9C,MAAM,IAAI4F,UAAU,4DAEtB,GAAI5F,EAAE0tB,GAAGnqB,GACP,MAAM,IAAIqC,UAAU,kDAItB,GADAjF,EAASuvB,EACLlwB,EAAEkyB,GAAG6uF,GACP,IAAK//G,EAAIkvB,EAAKlvB,EAAEiwB,IAAI8vF,GAAU//G,EAAIA,EAAE6tB,KAAKqB,GACvCvvB,EAASA,EAAO+tB,MAAM1uB,EAAE6uB,KAAK7tB,IAAIyuB,UAAUzuB,QAG7C,IAAKA,EAAIkvB,EAAKlvB,EAAEiwB,IAAIjxB,GAAIgB,EAAIA,EAAE6tB,KAAKqB,GACjCvvB,EAASA,EAAO+tB,MAAMqyF,EAAQlyF,KAAK7tB,IAAIyuB,UAAUzuB,GAIrD,OAAOL,CACT,GAGA,IAQJ,SAAS0gH,GAAmB99G,GAC1B,OAAOA,EAAEghB,aAAehhB,EAAEysB,IAAI,EAChC,CCnEA,MAAMvrB,GAAO,sBAGA68G,GAA4CziH,GAAQ4F,GAF5C,CAAC,UAE+DlC,IAAe,IAAd,MAAE4C,GAAO5C,EAwB7F,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUlB,EAAGvD,GAC7B,IAAKukB,GAAUhhB,IAAMA,EAAI,EACvB,MAAM,IAAIqC,UAAU,mEAEtB,IAAK2e,GAAUvkB,IAAMA,EAAI,EACvB,MAAM,IAAI4F,UAAU,mEAEtB,GAAIrC,EAAI,EACN,MAAM,IAAIqC,UAAU,6CAGtB,OAAI5F,EAAIuD,EAAI,EACQ6+B,GAAQ7+B,EAAGA,EAAIvD,EAAI,GAClBoiC,GAAQ,EAAGpiC,GAEdoiC,GAAQpiC,EAAI,EAAGuD,EAAIvD,EAAI,GACtBoiC,GAAQ,EAAG7+B,EAAI,EACpC,EAEA,uBAAwB,SAAUA,EAAGvD,GAEnC,IAAIW,EAAQK,EACZ,MAAMkvB,EAAM,IAAIjH,EAFE1lB,EAAEgB,aAEM,GACpBg9G,EAAYh+G,EAAEqrB,MAAMsB,GAE1B,IAAKmxF,GAAkB99G,KAAO89G,GAAkBrhH,GAC9C,MAAM,IAAI4F,UAAU,mEAEtB,GAAIrC,EAAE2uB,GAAGhC,GACP,MAAM,IAAItqB,UAAU,6EAItB,GADAjF,EAASuvB,EACLlwB,EAAEkyB,GAAGqvF,GACP,IAAKvgH,EAAIkvB,EAAKlvB,EAAEiwB,IAAIswF,GAAYvgH,EAAIA,EAAE6tB,KAAKqB,GACzCvvB,EAASA,EAAO+tB,MAAM1uB,EAAE6uB,KAAK7tB,IAAIyuB,UAAUzuB,QAG7C,IAAKA,EAAIkvB,EAAKlvB,EAAEiwB,IAAIjxB,GAAIgB,EAAIA,EAAE6tB,KAAKqB,GACjCvvB,EAASA,EAAO+tB,MAAM6yF,EAAU1yF,KAAK7tB,IAAIyuB,UAAUzuB,GAIvD,OAAOL,CACT,GACA,IAQJ,SAAS0gH,GAAmB99G,GAC1B,OAAOA,EAAEghB,aAAehhB,EAAEysB,IAAI,EAChC,CClFO,SAASwxF,GAAaj+G,GAC3B,IAAI7D,EAEJ,GAAI6kB,GAAUhhB,GACZ,OAAIA,GAAK,EACAihB,SAASjhB,GAAKgJ,IAAWkhB,IAG9BlqB,EAAI,IACCgJ,IAGF61B,GAAQ,EAAG7+B,EAAI,GAGxB,GAAIA,EAAI,GACN,OAAOiJ,KAAKme,IAAMne,KAAK8mB,IAAI9mB,KAAKme,GAAKpnB,GAAKi+G,GAAY,EAAIj+G,IAG5D,GAAIA,GAAK,OACP,OAAOgJ,IAGT,GAAIhJ,EAAI,GAAM,CACZ,MAAMk+G,EAAOl+G,EAAIA,EACXm+G,EAASD,EAAOl+G,EAChBo+G,EAAQD,EAASn+G,EACjBq+G,EAAQD,EAAQp+G,EACtB,OAAOiJ,KAAK8b,KAAK,EAAI9b,KAAKme,GAAKpnB,GAAKiJ,KAAK4M,IAAK7V,EAAIiJ,KAAKuL,EAAIxU,IACxD,EAAI,GAAK,GAAKA,GAAK,GAAK,IAAMk+G,GAAQ,KAAO,MAAQC,GACpD,KAAO,QAAUC,GAAS,QAAU,UAAYC,GAChD,SAAW,YAAcA,EAAQr+G,GACvC,GAEEA,EACF7D,EAAImiH,GAAO,GACX,IAAK,IAAI7gH,EAAI,EAAGA,EAAI6gH,GAAO5hH,SAAUe,EACnCtB,GAAKmiH,GAAO7gH,IAAMuC,EAAIvC,GAGxB,MAAMvB,EAAI8D,EAAIu+G,GAAS,GACvB,OAAOt1G,KAAK8b,KAAK,EAAI9b,KAAKme,IAAMne,KAAK4M,IAAI3Z,EAAG8D,EAAI,IAAOiJ,KAAKkZ,KAAKjmB,GAAKC,CACxE,CACA8hH,GAAYv6G,UAAY,SAIjB,MAAM66G,GAAS,UAETD,GAAS,CACpB,kBACA,mBACC,kBACD,oBACC,kBACD,qBACA,sBACC,qBACD,sBACC,sBACD,uBACC,qBACD,sBACC,sBACD,uBAMWE,GAAY,kBAKZC,GAAe,CAC1B,kBACA,mBACC,kBACD,mBACC,kBACD,qBACC,mBAGI,SAASC,GAAc1+G,GAC5B,GAAIA,EAAI,EAAG,OAAOkqB,IAClB,GAAU,IAANlqB,EAAS,OAAOgJ,IACpB,IAAKiY,SAASjhB,GAAI,OAAOA,EAEzB,GAAIA,EAAI,GAGN,OAAOiJ,KAAK2Y,IAAI3Y,KAAKme,GAAKne,KAAK8mB,IAAI9mB,KAAKme,GAAKpnB,IAAM0+G,GAAa,EAAI1+G,GAMtE,MAAMsiB,EA3Be,GA0BrBtiB,GAAQ,GACmB,GAC3B,IAAI0zB,EAAM+qF,GAAa,GAGvB,IAAK,IAAIhhH,EAAIkhH,EAAalhH,GAAK,EAAGA,IAChCi2B,GAAO+qF,GAAahhH,IAAMuC,EAAIvC,GAGhC,OAAO+gH,IAAax+G,EAAI,IAAOiJ,KAAK2Y,IAAIU,GAAQA,EAAOrZ,KAAK2Y,IAAI8R,EAClE,CACAgrF,GAAah7G,UAAY,SC/GzB,MAAMxC,GAAO,QAGA09G,GAA8BtjH,GAAQ4F,GAF9B,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,YAERlC,IAAgE,IAA/D,MAAE4C,EAAK,OAAEyf,EAAM,eAAEq4B,EAAc,IAAE7jC,EAAG,UAAE6P,EAAS,QAAEC,GAAS3mB,EAoEhI,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ28F,GACRt4F,QA5CF,SAASk5F,EAAc7+G,GACrB,GAAa,IAATA,EAAEu2B,GACJ,OAAO0nF,GAAYj+G,EAAEuY,IAKvB,GAAIvY,EAAEuY,GAAK,GAAK,CAKd,MAAMrc,EAAI,IAAIypB,EAAQ,EAAI3lB,EAAEuY,IAAKvY,EAAEu2B,IAC7B7e,EAAI,IAAIiO,EAAQ1c,KAAKme,GAAKpnB,EAAEuY,GAAItP,KAAKme,GAAKpnB,EAAEu2B,IAElD,OAAO,IAAI5Q,EAAQ1c,KAAKme,IAAI+E,IAAIzU,EAAEqY,OAAO5D,IAAI0yF,EAAa3iH,GAC5D,CAIA8D,EAAI,IAAI2lB,EAAQ3lB,EAAEuY,GAAK,EAAGvY,EAAEu2B,IAG5B,IAAIp6B,EAAI,IAAIwpB,EAAQ24F,GAAO,GAAI,GAE/B,IAAK,IAAI7gH,EAAI,EAAGA,EAAI6gH,GAAO5hH,SAAUe,EAAG,CAEtC,MAAMqhH,EAAY,IAAIn5F,EAAQ24F,GAAO7gH,GAAI,GACzCtB,EAAIA,EAAE0K,IAAIi4G,EAAU3yF,IAAInsB,EAAE6G,IAAIpJ,IAChC,CAEA,MAAMvB,EAAI,IAAIypB,EAAQ3lB,EAAEuY,GAAKgmG,GAAS,GAAKv+G,EAAEu2B,IAGvCwoF,EAAY91G,KAAK8b,KAAK,EAAI9b,KAAKme,IAC/B43F,EAAO9iH,EAAE2Z,IAAI7V,EAAE6G,IAAI,KACnBo4G,EAAO/iH,EAAEsvB,MAAMrJ,MAGrB,OAAOhmB,EAAEi0B,IAAI2uF,GAAW3uF,IAAI4uF,GAAM5uF,IAAI6uF,EACxC,EAKEv5F,UAAW,SAAU1lB,GACnB,GAAIA,EAAEghB,YACJ,OAAQhhB,EAAEuuB,cAAgBvuB,EAAEgrB,SACxB,IAAItF,EAAU1c,KACdk2G,EAAal/G,EAAEqrB,MAAM,IAG3B,IAAKrrB,EAAEihB,WACL,OAAO,IAAIyE,EAAU1lB,EAAEuuB,aAAerE,IAAMlhB,KAG9C,MAAM,IAAIgJ,MAAM,6BAClB,IAQF,SAASktG,EAAcl/G,GACrB,GAAIA,EAAI,EACN,OAAO,IAAI0lB,EAAU,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,MAAM1lB,IAGxD,MAAM2iB,EAAYtB,EAAOsB,WAAsC,EAAzB1Z,KAAK2Y,IAAI5hB,EAAEokB,aAC3C63B,EAAMv2B,EAAUtG,MAAM,CAAEuD,cAE9B,GAAI3iB,EAAI,GAAM,EACZ,OAAOA,EAAEmrB,MAAM+zF,EAAa,IAAIx5F,EAAU1lB,EAAI,KAGhD,IAAIsF,EAAItF,EACJqyB,EAAO,IAAI4pB,EAAIj8C,GACf0zB,EAAM1zB,EAAEokB,WAEZ,KAAO9e,EAAI,GACTA,GAAK,EACLouB,GAAOpuB,EACP+sB,EAAOA,EAAKlH,MAAMuI,GAGpB,OAAO,IAAIhO,EAAU2M,EAAKnO,YAAYwB,EAAU/C,WAClD,KC7GIzhB,GAAO,SAGAi+G,GAA+B7jH,GAAQ4F,GAF/B,CAAC,UAAW,UAEuClC,IAAwB,IAAvB,QAAE2mB,EAAO,MAAE/jB,GAAO5C,EAMzF,MAaMgiG,EAAS,EACZ,oBAAyB,oBAA2B,qBAA0B,sBAC9E,qBAAyB,sBAA2B,oBAA0B,oBAyBjF,OAAOp/F,EAAMV,GAAM,CACjBogB,OAAQo9F,GACR/4F,QAMF,SAASy5F,EAAep/G,GAMtB,GAAIA,EAAEuZ,QACJ,OAAO,IAAIoM,EAAQuE,IAAKA,KACnB,GAAa,IAATlqB,EAAEu2B,GACX,OAAO,IAAI5Q,EAAQ+4F,GAAa1+G,EAAEuY,IAAK,GAClC,GAAIvY,EAAEuY,IA1DE,GA0DgBtP,KAAKsa,IAAIvjB,EAAEu2B,KAzD3B,EA0Db,OAAO8oF,EAAer/G,GACjB,GAAIA,EAAEuY,IARM,GAQY,CAE7B,MAAMoe,GrkBkpBcx6B,EqkB/pBR,oBrkBgqBFA,IADaC,EqkBlpBK4D,EAAEu2B,IrkBopBhB,KAAWn6B,EAAI,IAAY,EAAIA,GAAM4M,MAC/B7M,EAAIA,GqkBrpBY8M,KAAKsM,MAAM,GAAMvV,EAAEuY,GAAK,MACtDjD,EAAItV,EAAEowB,IAAInnB,KAAKme,IAAI2I,MAAMnO,MACzBvM,EAAI+pG,EAAc,IAAIz5F,EAAQ,EAAI3lB,EAAEuY,IAAKvY,EAAEu2B,KACjD,OAAO,IAAI5Q,EAfC,mBAecgR,GAAKvH,IAAI9Z,GAAG8Z,IAAI/Z,EAC5C,CAAO,OAAIrV,EAAEu2B,IAAM,EACV+oF,EAAiBt/G,GAEjBs/G,EAAiBt/G,EAAE+/C,aAAaA,YrkB2oBtC,IAAmB5jD,EAAGC,CqkBzoB3B,EA5BEspB,UAAW,WACT,MAAM,IAAI1T,MAAM,qFAClB,IA4BF,SAASqtG,EAAgBhjH,GASvB,MAAMkjH,EAAWljH,EAAE+yB,IAAI,IAAKgB,IAAI/zB,EAAEulB,OAAOwN,IAAI/yB,GAAGwK,IAAI23G,IAI9CgB,EAAK,IAAI75F,EAAQ,EAAG,GAAGwG,IAAI9vB,GAC3BojH,EAAMD,EAAGrzF,IAAI9vB,GAEnB,IAAIiZ,EAAI0rF,EAAO,GACX3rF,EAAI2rF,EAAO,GACf,MAAMtpF,EAAI,EAAI+nG,EAAIlnG,GACZ3S,EAAI65G,EAAIlnG,GAAKknG,EAAIlnG,GAAKknG,EAAIlpF,GAAKkpF,EAAIlpF,GAEzC,IAAK,IAAI94B,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,MAAMk5B,EAAMthB,EACZA,GAAKzP,EAAI0P,EAAI0rF,EAAOvjG,GACpB6X,EAAIoC,EAAIpC,EAAIqhB,CACd,CAEA,MAAM+oF,EAAYF,EAAGpvF,IAAIqvF,EAAIrvF,IAAI9a,GAAGzO,IAAIwO,IAIxC,OAAOkqG,EAAS14G,IAAI64G,EACtB,CAEA,SAASJ,EAAkBjjH,GAIzB,IAAIsjH,EAAY,EACZC,EAAK,EACLC,EAAYxjH,EAGhB,IADAA,EAAIA,EAAEwK,IAAI,GACHxK,EAAEkc,IApHM,GAoHU,CACvBsnG,EAAYA,EAAUzvF,IAAI/zB,GAE1B,MAAMyjH,EAAMD,EAAUtpF,GAAK,EAAI,EAAI,EACvB,IAARupF,GAAoB,IAAPF,GAAUD,IAC3BC,EAAKE,EAELzjH,EAAIA,EAAEwK,IAAI,EACZ,CAEA,OAAOw4G,EAAehjH,GACnB+yB,IAAIywF,EAAUj+F,OACdwN,IAAI,IAAIzJ,EAAQ,EAAe,EAAZg6F,EAAgB12G,KAAKme,GAAK,GAClD,KClJIlmB,GAAO,YAGA6+G,GAAkCzkH,GAAQ4F,GAFlC,CAAC,QAAS,UAE4ClC,IAAsB,IAArB,MAAE4C,EAAK,MAAE8tD,GAAO1wD,EAuB1F,OAAO4C,EAAMV,GAAM,CACjBogB,OAAQ,SAAUthB,GAChB,GAAIA,EAAI,EACN,MAAM,IAAIgS,MAAM,8BAGlB,OAAO09C,EAAM1vD,EAAI,EACnB,EAEA0lB,UAAW,SAAU1lB,GACnB,GAAIA,EAAEuuB,aACJ,MAAM,IAAIvc,MAAM,8BAGlB,OAAO09C,EAAM1vD,EAAEsrB,KAAK,GACtB,EAEA,iBAAkB1pB,EAAM6L,aAAYH,GAAQtN,GAAK0hC,GAAQ1hC,EAAGsN,MAC5D,IC7CEpM,GAAO,eAGA8+G,GAAqC1kH,GAAQ4F,GAFrC,CAAC,QAAS,SAAU,SAAU,MAAO,WAAY,MAAO,YAAa,MAAO,cAEnBlC,IAA8E,IAA7E,MAAE4C,EAAK,OAAEykB,EAAM,OAAEyF,EAAM,IAAE4H,EAAG,SAAEkgB,EAAQ,IAAEvuC,EAAG,UAAEylD,EAAS,IAAElpC,EAAG,UAAEsnB,GAAWlqC,EAiBrJ,OAAO4C,EAAMV,GAAM,CACjB,eAAgB,SAAUuuB,EAAGnqB,GAC3B,OAAO26G,EAAO55F,EAAOoJ,GAAIpJ,EAAO/gB,GAClC,EAEA,gBAAiB,SAAUmqB,EAAGnqB,GAC5B,OAAO26G,EAAOxwF,EAAGpJ,EAAO/gB,GAC1B,EAEA,gBAAiB,SAAUmqB,EAAGnqB,GAC5B,OAAO26G,EAAO55F,EAAOoJ,GAAInqB,EAC3B,EAEA,iBAAkB,SAAUmqB,EAAGnqB,GAC7B,OAAO26G,EAAOxwF,EAAGnqB,EACnB,IAIF,SAAS26G,EAAQxwF,EAAGnqB,GAClB,MAAM46G,EAAU56G,EAAEsW,OAAOlf,OACnByjH,EAAU1wF,EAAE7T,OAAOlf,OACzB,GAAIwjH,EAAU,EACZ,MAAM,IAAIluG,MAAM,wCAGlB,GAAImuG,EAAU,EACZ,MAAM,IAAInuG,MAAM,yCAGlB,GAAIkuG,IAAYC,EACd,MAAM,IAAInuG,MAAM,uCAKlB,GAAa,IADA0hB,EAAIjE,GAEf,MAAM,IAAIzd,MAAM,oDAIlB,GAAa,IADA0hB,EAAIpuB,GAEf,MAAM,IAAI0M,MAAM,qDAElB,MAAMouG,EAAQt0F,EAAO2D,EAAGiE,EAAIjE,IACtB4wF,EAAQv0F,EAAOxmB,EAAGouB,EAAIpuB,IAEtBlI,EAASs2B,EAAIkgB,EAASwsE,EAAO/6G,EAAIylD,EAAUs1D,EAAOC,IAAQlkH,GAAKylB,EAAIzlB,OACzE,OAAI+sC,EAAU9rC,GACLA,EAEA4oB,OAAOkE,GAElB,KCxEIhpB,GAAO,cAGAo/G,GAAoChlH,GAAQ4F,GAFpC,CAAC,QAAS,MAAO,SAAU,WAAY,YAAa,YAAa,eAETlC,IAAwE,IAAvE,MAAE4C,EAAK,IAAEiF,EAAG,OAAEilB,EAAM,SAAE8nB,EAAQ,UAAE6b,EAAS,UAAEzuC,EAAS,WAAEwN,GAAYxvB,EAsB9I,OAAO4C,EAAMV,GAAM,CACjB,iBAAkB,SAAUoU,GAC1B,IAAIoe,EAAM,EACNutE,EAAQ,EAUZ,OARAn/D,GAAYxsB,GAAG,SAAUirG,GACvB,IAAKv/F,EAAUu/F,KAAQ/xF,EAAW+xF,GAChC,MAAM,IAAIl+G,UAAU,2DAEtBqxB,EAAM7sB,EAAI6sB,EAAK6sF,GACftf,EAAQrtD,EAASqtD,EAAOxxC,EAAU8wD,GACpC,IAEOz0F,EAAO2jC,EAAU/7B,GAAMutE,EAChC,GACA,ICvCE//F,GAAO,eAGAs/G,GAAqCllH,GAAQ4F,GAFrC,CAAC,QAAS,cAE+ClC,IAA0B,IAAzB,MAAE4C,EAAK,UAAE6tD,GAAWzwD,EA0BjG,OAAO4C,EAAMV,GAAM,CACjB,qBAAsBuuD,EACtB,iBAAkB,SAAUzvD,EAAGvD,GAC7B,IAAKukB,GAAUhhB,IAAMA,EAAI,EACvB,MAAM,IAAIqC,UAAU,4DAEtB,IAAK2e,GAAUvkB,IAAMA,EAAI,EACvB,MAAM,IAAI4F,UAAU,4DAEtB,GAAI5F,EAAIuD,EACN,MAAM,IAAIqC,UAAU,oEAGtB,OAAOw8B,GAAS7+B,EAAIvD,EAAK,EAAGuD,EAC9B,EAEA,uBAAwB,SAAUA,EAAGvD,GACnC,IAAIW,EAAQK,EAEZ,IAAKqgH,GAAkB99G,KAAO89G,GAAkBrhH,GAC9C,MAAM,IAAI4F,UAAU,4DAEtB,GAAI5F,EAAE0tB,GAAGnqB,GACP,MAAM,IAAIqC,UAAU,oEAKtB,IADAjF,EADY4C,EAAEowB,IAAI,GAAGvpB,IAAI,GAEpBpJ,EAAIuC,EAAEqrB,MAAM5uB,GAAG6uB,KAAK,GAAI7tB,EAAEiwB,IAAI1tB,GAAIvC,EAAIA,EAAE6tB,KAAK,GAChDluB,EAASA,EAAO+tB,MAAM1tB,GAGxB,OAAOL,CACT,GAGA,IAQJ,SAAS0gH,GAAmB99G,GAC1B,OAAOA,EAAEghB,aAAehhB,EAAEysB,IAAI,EAChC,C,cC7EA,MAAMg0F,GAAkCxqG,GAAWnY,KAAK4iH,OAEjD,SAASC,GAAWC,GACzB,IAAI3oG,EAGJ,IAAkBnc,EAYlB,OAXEmc,EAAkB,QADFnc,EAKV8kH,GAJmBH,GAAkBxqG,GAAW1W,OAAOzD,IAO/D,WACE,OAAOmc,GACT,CAGF,CChBA,MAAM/W,GAAO,aAGA2/G,GAAmCvlH,GAAQ4F,GAFnC,CAAC,QAAS,SAAU,QAEmClC,IAA2B,IAA1B,MAAE4C,EAAK,OAAEyf,EAAM,GAAE5M,GAAIzV,EAE5F8hH,EAAMH,GAAUt/F,EAAOu/F,YA6C3B,OA3CInsG,GACFA,EAAG,UAAU,SAAUkhB,EAAMC,GACvBD,EAAKirF,aAAehrF,EAAKgrF,aAC3BE,EAAMH,GAAUhrF,EAAKirF,YAEzB,IAsCKh/G,EAAMV,GAAM,CACjB,iBAAkB,SAAU6/G,GAC1B,OAAOC,EAAYD,EAAW,CAAC,EACjC,EAEA,yBAA0B,SAAUA,EAAWp9G,GAC7C,OAAOq9G,EAAYD,EAAWp9G,EAChC,EAEA,yBAA0B,SAAUo9G,EAAWz/F,GAC7C,OAAO0/F,EAAYD,EAAW,CAAEz/F,UAClC,EAEA,iCAAkC,SAAUy/F,EAAWE,GACrD,OAAOD,EAAYD,EAAW,CAAEE,WAClC,EAEA,yCAA0C,SAAUF,EAAWE,EAAS3/F,GACtE,OAAO0/F,EAAYD,EAAW,CAAEz/F,SAAQ2/F,WAC1C,EAEA,yCAA0C,SAAUF,EAAWz/F,EAAQ2/F,GACrE,OAAOD,EAAYD,EAAW,CAAEz/F,SAAQ2/F,WAC1C,IAaF,SAASD,EAAaD,EAAS/2E,GAA2C,IAAzC,OAAE1oB,EAAM,QAAE2/F,EAAO,YAAEC,GAAc,GAAMl3E,EACtE,MAAMm3E,OAA4B,IAAX7/F,EACnB6/F,IACF7/F,EAAS,GAGX,MAAMitB,EAAezxB,EAASikG,GAC1BA,EAAUjgH,OACVgc,EAASmkG,GACPA,EAAQngH,OACR,KAENigH,EAAYA,EAAU5lG,UAClB8lG,IACFA,EAAUA,EAAQ9lG,YAGA,IAAhB+lG,IACFH,EAAY3qG,GAAQ2qG,GACpBE,EAAU7qG,GAAQ6qG,IAGpB,IAAIG,EAAe,EAEnB,QAAuB,IAAZH,EAAyB,CAClC,GAAIA,EAAQvkH,SAAWqkH,EAAUrkH,OAC/B,MAAM,IAAIsV,MAAM,kDAGlB,IAAK,IAAIvU,EAAI,EAAGwX,EAAMgsG,EAAQvkH,OAAQe,EAAIwX,EAAKxX,IAAK,CAClD,IAAK6e,EAAS2kG,EAAQxjH,KAAOwjH,EAAQxjH,GAAK,EACxC,MAAM,IAAIuU,MAAM,gDAGlBovG,GAAgBH,EAAQxjH,EAC1B,CACF,CAEA,MAAMf,EAASqkH,EAAUrkH,OAEnBU,EAAS,GACf,IAAIikH,EAEJ,KAAOjkH,EAAOV,OAAS4kB,GAAQ,CAC7B,QAAuB,IAAZ2/F,EACTI,EAAON,EAAU93G,KAAKsM,MAAMurG,IAAQpkH,QAC/B,CACL,IAAI4kH,EAAUR,IAAQM,EAEtB,IAAK,IAAI3jH,EAAI,EAAGwX,EAAM8rG,EAAUrkH,OAAQe,EAAIwX,EAAKxX,IAG/C,GAFA6jH,GAAWL,EAAQxjH,GAEf6jH,EAAU,EAAG,CACfD,EAAON,EAAUtjH,GACjB,KACF,CAEJ,CAEAL,EAAOO,KAAK0jH,EACd,CAEA,OAAOF,EACH/jH,EAAO,GACPmxC,EACEA,EAAanxC,GACbA,CACR,KCxJK,SAASmkH,GAAc3lG,EAAM3D,GAClC,MAAM/X,EAAO,GAGb,IAFA0b,EAAOA,EAAK/d,MAAM,IAETnB,OAAS,EAChB,IAAK,IAAIe,EAAI,EAAGf,EAASkf,EAAK4I,QAAS/mB,EAAIf,EAAQe,IACjDyC,EAAKvC,KAAK4jH,GAAa3lG,EAAM3D,SAG/B,IAAK,IAAIxa,EAAI,EAAGf,EAASkf,EAAK4I,QAAS/mB,EAAIf,EAAQe,IACjDyC,EAAKvC,KAAKsa,KAId,OAAO/X,CACT,CChBA,MAAMgB,GAAO,SAGAsgH,GAA+BlmH,GAAQ4F,GAF/B,CAAC,QAAS,SAAU,QAE+BlC,IAA2B,IAA1B,MAAE4C,EAAK,OAAEyf,EAAM,GAAE5M,GAAIzV,EAExF8hH,EAAMH,GAAUt/F,EAAOu/F,YAwC3B,OAtCInsG,GACFA,EAAG,UAAU,SAAUkhB,EAAMC,GACvBD,EAAKirF,aAAehrF,EAAKgrF,aAC3BE,EAAMH,GAAUhrF,EAAKirF,YAEzB,IAiCKh/G,EAAMV,GAAM,CACjB,GAAI,IAAMugH,EAAQ,EAAG,GACrBngG,OAASjY,GAAQo4G,EAAQ,EAAGp4G,GAC5B,iBAAkBq4G,CAACx4G,EAAKG,IAAQo4G,EAAQv4G,EAAKG,GAC7C,iBAAmBuS,GAAS+lG,EAAc/lG,EAAM,EAAG,GACnD,yBAA0BgmG,CAAChmG,EAAMvS,IAAQs4G,EAAc/lG,EAAM,EAAGvS,GAChE,iCAAkCw4G,CAACjmG,EAAM1S,EAAKG,IAAQs4G,EAAc/lG,EAAM1S,EAAKG,KAGjF,SAASs4G,EAAe/lG,EAAM1S,EAAKG,GACjC,MAAMutB,EAAM2qF,GAAa3lG,EAAKT,WAAW,IAAMsmG,EAAQv4G,EAAKG,KAC5D,OAAOyT,EAASlB,GAAQA,EAAK9a,OAAO81B,EAAK,UAAYA,CACvD,CAEA,SAAS6qF,EAASv4G,EAAKG,GACrB,OAAOH,EAAM43G,KAASz3G,EAAMH,EAC9B,KC7DIhI,GAAO,YAGA4gH,GAAkCxmH,GAAQ4F,GAFlC,CAAC,QAAS,SAAU,OAAQ,QAE0BlC,IAAiC,IAAhC,MAAE4C,EAAK,OAAEyf,EAAM,KAAEM,EAAI,GAAElN,GAAIzV,EAEjG8hH,EAAMH,GAAUt/F,EAAOu/F,YAuC3B,OArCInsG,GACFA,EAAG,UAAU,SAAUkhB,EAAMC,GACvBD,EAAKirF,aAAehrF,EAAKgrF,aAC3BE,EAAMH,GAAUhrF,EAAKirF,YAEzB,IAgCKh/G,EAAMV,GAAM,CACjB,GAAI,IAAM6gH,EAAW,EAAG,GACxBzgG,OAASjY,GAAQ04G,EAAW,EAAG14G,GAC/B,iBAAkBq4G,CAACx4G,EAAKG,IAAQ04G,EAAW74G,EAAKG,GAChDi/B,OAASj/B,GAAQ24G,EAAc,GAAI34G,GACnC,iBAAkB24G,EAClB,iBAAmBpmG,GAASqmG,EAAiBrmG,EAAM,EAAG,GACtD,yBAA0BgmG,CAAChmG,EAAMvS,IAAQ44G,EAAiBrmG,EAAM,EAAGvS,GACnE,iCAAkCw4G,CAACjmG,EAAM1S,EAAKG,IAAQ44G,EAAiBrmG,EAAM1S,EAAKG,KAGpF,SAAS44G,EAAkBrmG,EAAM1S,EAAKG,GACpC,MAAMutB,EAAM2qF,GAAa3lG,EAAKT,WAAW,IAAM4mG,EAAW74G,EAAKG,KAC/D,OAAOyT,EAASlB,GAAQA,EAAK9a,OAAO81B,EAAK,UAAYA,CACvD,CAEA,SAASmrF,EAAY74G,EAAKG,GACxB,OAAOJ,KAAKsM,MAAMrM,EAAM43G,KAASz3G,EAAMH,GACzC,CAEA,SAAS84G,EAAe94G,EAAKG,GAC3B,MACMsM,EAAQtM,EAAMH,EACpB,GAAIyM,GAFiB,IAAM,IAGzB,OAAOzM,EAAMqY,OAAOwgG,EAAW,EAAG/7F,OAAOrQ,KAK3C,MAAMy7D,EAAOzvD,EAAKhM,GAClB,IAAIusG,EAASvsG,EACb,KAAOusG,GAAUvsG,GAAO,CACtBusG,EAAS,GACT,IAAK,IAAIzkH,EAAI,EAAGA,EAAI2zE,IAAQ3zE,EAC1BykH,EAAS,GAAKA,GAAWpB,IAAQ,GAAO,GAAK,GAEjD,CACA,OAAO53G,EAAMg5G,CACf,KCpFIhhH,GAAO,aAiBAihH,GAAmC7mH,GAAQ4F,GAhBnC,CACnB,QACA,YACA,iBACA,iBACA,eACA,MACA,YACA,eACA,aACA,YACA,SACA,aACA,WAG0ElC,IAgBvE,IAfH,MACE4C,EAAK,UACL63C,EAAS,eACTiD,EAAc,eACdhD,EAAc,aACdkR,EAAY,IACZ/0C,EAAG,UACH45C,EAAS,aACTs8B,EAAY,WACZx9D,EAAU,UACVvN,EAAS,OACTM,EAAM,UACN+kC,EAAS,OACTE,GACDvnD,EAED,MAAMojH,EAAa,GACbC,EAAW,GA6BjB,OAAOzgH,EAAMV,GAAM,CACjB,yCAA0C,SAAUlB,EAAGvD,GACrD,IAAKukB,EAAUhhB,IAAMuuB,EAAWvuB,KAAOghB,EAAUvkB,IAAM8xB,EAAW9xB,GAChE,MAAM,IAAI4F,UAAU,8DACf,GAAIkkD,EAAO9pD,EAAGuD,GACnB,MAAM,IAAIqC,UAAU,4DAGtB,MAAMssG,IAAQryF,EAAStc,IAAMsc,EAAS7f,IAChCmhE,EAAQ+wC,EAAM0T,EAAWD,EACzBE,EAAO3T,EAAMtoD,EAAY/kC,EACzBihG,EAAKjhG,EAAOthB,GACZwiH,EAAKlhG,EAAO7kB,GAElB,GAAImhE,EAAM2kD,IAAO3kD,EAAM2kD,GAAI7lH,OAAS8lH,EAClC,OAAO5kD,EAAM2kD,GAAIC,GAGnB,IAAK,IAAI92F,EAAI,EAAGA,GAAK62F,IAAM72F,EAAG,CAI5B,GAHKkyC,EAAMlyC,KACTkyC,EAAMlyC,GAAK,CAAW42F,EAAJ,IAAN52F,EAAe,EAAU,KAE7B,IAANA,EAAS,SACb,MAAMqa,EAAM63B,EAAMlyC,GACZkK,EAAOgoC,EAAMlyC,EAAI,GACvB,IAAK,IAAIjuB,EAAIsoC,EAAIrpC,OAAQe,GAAKiuB,GAAKjuB,GAAK+kH,IAAM/kH,EAE1CsoC,EAAItoC,GADFA,IAAMiuB,EACC,EAEA+tB,EAAUC,EAAe4oE,EAAK7kH,GAAIm4B,EAAKn4B,IAAKm4B,EAAKn4B,EAAI,GAGpE,CACA,OAAOmgE,EAAM2kD,GAAIC,EACnB,GACA,ICpGEthH,GAAO,cAGAuhH,GAAoCnnH,GAAQ4F,GAFpC,CAAC,QAAS,YAAa,aAAc,YAAa,eAEMlC,IAA6D,IAA5D,MAAE4C,EAAK,UAAE63C,EAAS,WAAElrB,EAAU,UAAEvN,EAAS,WAAEwqE,GAAYxsF,EAsBnI,OAAO4C,EAAMV,GAAM,CACjB,qBAAsB,SAAUlB,GAC9B,IAAKghB,EAAUhhB,IAAMuuB,EAAWvuB,GAC9B,MAAM,IAAIqC,UAAU,+DAItB,IAAIjF,EAAS,EACb,IAAK,IAAIK,EAAI,EAAGA,GAAKuC,EAAGvC,IACtBL,EAASq8C,EAAUr8C,EAAQouF,EAAWxrF,EAAGvC,IAG3C,OAAOL,CACT,GACA,ICvCE8D,GAAO,UAWAwhH,GAAgCpnH,GAAQ4F,GAVhC,CACnB,QACA,YACA,eACA,iBACA,eACA,aACA,cAGuElC,IAUpE,IATH,MACE4C,EAAK,UACL63C,EAAS,aACTmR,EAAY,eACZlR,EAAc,aACdqyC,EAAY,WACZx9D,EAAU,UACVvN,GACDhiB,EAuBD,OAAO4C,EAAMV,GAAM,CACjB,qBAAsB,SAAUlB,GAC9B,IAAKghB,EAAUhhB,IAAMuuB,EAAWvuB,GAC9B,MAAM,IAAIqC,UAAU,2DAGtB,OAAOuoD,EAAamhC,EAAaryC,EAAe15C,EAAG,GAAIA,GAAIy5C,EAAUz5C,EAAG,GAC1E,GACA,ICnDEkB,GAAO,cAWAyhH,GAAoCrnH,GAAQ4F,GAVpC,CACnB,QACA,YACA,eACA,aACA,aACA,YACA,WAG2ElC,IAUxE,IATH,MACE4C,EAAK,UACL63C,EAAS,aACTsyC,EAAY,WACZv9D,EAAU,WACVD,EAAU,UACVvN,EAAS,OACTulC,GACDvnD,EAwBD,OAAO4C,EAAMV,GAAM,CACjB,yCAA0C,SAAUlB,EAAGvD,GACrD,KAAKukB,EAAUhhB,IAAOwuB,EAAWxuB,IAAOghB,EAAUvkB,IAAO+xB,EAAW/xB,IAClE,MAAM,IAAI4F,UAAU,2DACf,GAAIkkD,EAAO9pD,EAAGuD,GACnB,MAAM,IAAIqC,UAAU,6DAGtB,OAAO0pF,EAAatyC,EAAUz5C,GAAI,GAAIy5C,EAAUh9C,GAAI,GACtD,GACA,ICtDEyE,GAAO,YAMA0hH,GAAkCtnH,GAAQ4F,GALlC,CACnB,QACA,UAGyElC,IAGrE,IAHsE,MAC1Eka,EAAK,MACLtX,GACD5C,EAGC,SAAS6jH,EAAavkG,GACpB,IAAI7G,EAAQ,EAEZ,OADA6G,EAAKze,SAAQG,IAAOyX,GAASorG,EAAY7iH,EAAE,IACpCyX,GAAS,CAClB,CAgCA,OAAO7V,EAAMV,GAAM,CACjByhF,KAAM,SAAU9B,GACd,OAAOgiC,EAAYhiC,EACrB,GACA,ICnDG,SAASiiC,GAAe3mH,GAC7B,OAAOiiB,EAAejiB,IAAOoiB,EAAepiB,IAAMA,EAAE+lC,WAAa9jB,EAAejiB,EAAE8L,KAAK,GACzF,CAEO,SAAS86G,GAAsB5mH,GACpC,QAAIiiB,EAAejiB,OAGdwiB,EAAexiB,KAAMoiB,EAAepiB,KAAOA,EAAE8L,KAAKgH,MAAM8zG,SAGzDjkG,GAAkB3iB,KAAM4mH,GAAqB5mH,EAAEwoF,SAIrD,CCdA,MAOaq+B,GAA6B1nH,GAP7B,eACQ,CACnB,eACA,eACA,eAGoE0D,IAAgD,IAA/C,aAAEgzF,EAAY,aAAE/C,EAAY,WAAEqC,GAAYtyF,EAO/G,MAAMmvD,GAAI,EACJuiB,GAAI,EAEJuyC,EAAc,WACdC,EAAiB,CACVr8G,IAAK,CAAEs8G,QAASh1D,EAAGi1D,MAAOj1D,EAAGk1D,YAAal1D,EAAGm1D,YAAan1D,GAChEk8B,UAAW,CAAE84B,QAASh1D,EAAGi1D,MAAOj1D,EAAGk1D,YAAal1D,EAAGm1D,YAAan1D,GAC/Dj8B,SAAU,CAAEixF,QAASzyC,EAAG0yC,MAAOj1D,EAAGk1D,YAAa3yC,EAAG4yC,YAAa5yC,GAC/D98B,SAAU,CAAEuvE,QAASh1D,EAAGi1D,MAAOj1D,EAAGk1D,YAAal1D,EAAGm1D,YAAan1D,GAC7DriC,OAAQ,CAAEq3F,QAASzyC,EAAG0yC,MAAOj1D,EAAGk1D,YAAa3yC,EAAG4yC,YAAa5yC,GAC5D6yC,MAAO,CAAEJ,QAASh1D,EAAGi1D,MAAOj1D,EAAGk1D,YAAal1D,EAAGm1D,YAAa5yC,GAC/D8yC,SAAU,CAAEL,QAASzyC,EAAG0yC,MAAOj1D,EAAGk1D,YAAa3yC,EAAG4yC,YAAa5yC,IASvE,SAAS+yC,EAAaC,EAAYxjG,GAAoC,IAA1BgjE,EAAO9kF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG8kH,EAChDhiH,EAAO+hH,EAUX,GAT0B,iBAAfS,EACTxiH,EAAOwiH,EACEnlG,EAAemlG,GACxBxiH,EAAOwiH,EAAWjgH,GAAG8K,WACZoQ,EAAe+kG,GACxBxiH,EAAOwiH,EAAWxiH,KACT4d,GAAkB4kG,KAC3BxiH,EAAO,SAEL1C,GAAe0kF,EAAShiF,GAAO,CACjC,MAAMsf,EAAa0iE,EAAQhiF,GAC3B,GAAI1C,GAAegiB,EAAYN,GAC7B,OAAOM,EAAWN,GAEpB,GAAI1hB,GAAe0kH,EAAgBhiH,GACjC,OAAOgiH,EAAehiH,GAAMgf,EAEhC,CACA,GAAI1hB,GAAe0kF,EAAS+/B,GAAc,CACxC,MAAMziG,EAAa0iE,EAAQ+/B,GAC3B,OAAIzkH,GAAegiB,EAAYN,GACtBM,EAAWN,GAEbgjG,EAAeD,GAAa/iG,EACrC,CAGA,GAAI1hB,GAAe0kH,EAAgBhiH,GAAO,CACxC,MAAMsf,EAAa0iG,EAAehiH,GAClC,GAAI1C,GAAegiB,EAAYN,GAC7B,OAAOM,EAAWN,EAEtB,CACA,OAAOgjG,EAAeD,GAAa/iG,EACrC,CAMA,SAASyjG,EAAerlG,GACtB,OAAOmlG,EAAYnlG,EAAM,cADUlgB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG8kH,EAExC,CAoCA,SAASU,EAAatlG,EAAM4kE,GAC1B,IAAIzkE,EACJ,MAAMjE,EAAW,GACXqpG,EAAe,SAAUvlG,GAC7B,IAAK,IAAI7gB,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IAAK,CACzC,MAAM+/B,EAAQlf,EAAKrW,KAAKxK,GACpB8gB,EAAeif,IAAU/e,IAAO+e,EAAM/e,GACxColG,EAAarmF,GAEbhjB,EAAS7c,KAAK6/B,EAElB,CACF,EAEA,OAAImmF,EAAcrlG,EAAM4kE,IACtBzkE,EAAKH,EAAKG,GACVolG,EAAavlG,GACN9D,GAEA8D,EAAKrW,IAEhB,CA4CA,SAAS67G,EAAwBxlG,GAC/B,OAAIC,EAAeD,GACV,SAAUrW,GACf,IACE,OAAO,IAAIgnF,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAIwE,EAAMqW,EAAKumE,SACvD,CAAE,MAAOt8E,GAEP,OADA4pG,QAAQ3oD,MAAMjhD,GACP,EACT,CACF,EAEO,SAAUN,GACf,OAAO,IAAI+pF,EAAa,IAAIV,EAAWhzE,EAAKpd,MAAO+G,EACrD,CAEJ,CAEA,MAAO,CACL67G,yBACAL,cACAM,cA/HF,SAAwBzlG,GACtB,OAAOmlG,EAAYnlG,EAAM,cADUlgB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG8kH,EAExC,EA8HES,gBACAK,aArHF,SAAuBC,EAASC,GAC9B,MAAMC,EAAS,IAAKF,GACpB,IAAK,MAAMrsG,KAAQssG,EACb1lH,GAAeylH,EAASrsG,GAC1BusG,EAAOvsG,GAAQ,IAAKssG,EAAUtsG,MAAUqsG,EAAQrsG,IAEhDusG,EAAOvsG,GAAQssG,EAAUtsG,GAG7B,OAAOusG,CACT,EA4GE/tG,QAtGF,SAASA,EAASkI,EAAM4kE,GACtB,IAAK5kE,EAAKrW,MAA6B,IAArBqW,EAAKrW,KAAKvL,OAC1B,OAAO4hB,EAETA,EAAKrW,KAAO27G,EAAYtlG,EAAM4kE,GAC9B,IAAK,IAAIzlF,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IACpC2Y,EAAQkI,EAAKrW,KAAKxK,GAAIylF,EAE1B,EA+FE0gC,cACAQ,WAhEF,SAASA,EAAY9lG,EAAM4kE,GACzB,IAAK5kE,EAAKrW,MAA6B,IAArBqW,EAAKrW,KAAKvL,OAC1B,OAEF,MAAM2nH,EAAWP,EAAuBxlG,GAClC+jC,EAAI/jC,EAAKrW,KAAKvL,OACpB,IAAK,IAAIe,EAAI,EAAGA,EAAI4kD,EAAG5kD,IACrB2mH,EAAW9lG,EAAKrW,KAAKxK,GAAIylF,GAE3B,GAAI7gC,EAAI,GAAKshE,EAAcrlG,EAAM4kE,GAAU,CACzC,IAAIohC,EAAUhmG,EAAKrW,KAAKyc,MACxB,KAAOpG,EAAKrW,KAAKvL,OAAS,GACxB4nH,EAAUD,EAAS,CAAC/lG,EAAKrW,KAAKyc,MAAO4/F,IAEvChmG,EAAKrW,KAAOq8G,EAAQr8G,IACtB,CACF,EAiDEs8G,WA5CF,SAASA,EAAYjmG,EAAM4kE,GACzB,IAAK5kE,EAAKrW,MAA6B,IAArBqW,EAAKrW,KAAKvL,OAC1B,OAEF,MAAM2nH,EAAWP,EAAuBxlG,GAClC+jC,EAAI/jC,EAAKrW,KAAKvL,OACpB,IAAK,IAAIe,EAAI,EAAGA,EAAI4kD,EAAG5kD,IACrB8mH,EAAWjmG,EAAKrW,KAAKxK,GAAIylF,GAE3B,GAAI7gC,EAAI,GAAKshE,EAAcrlG,EAAM4kE,GAAU,CACzC,IAAIohC,EAAUhmG,EAAKrW,KAAKuc,QACxB,KAAOlG,EAAKrW,KAAKvL,OAAS,GACxB4nH,EAAUD,EAAS,CAACC,EAAShmG,EAAKrW,KAAKuc,UAEzClG,EAAKrW,KAAOq8G,EAAQr8G,IACtB,CACF,EA6BEi7G,iBACAsB,YApLkB,CAAE14F,OAAQ,CAAEs3F,MAAO1yC,GAAK9uD,IAAK,CAAEwhG,MAAO1yC,IAqLxD+zC,gBApLsB,CACtBvyF,SAAU,CAAEkxF,MAAO1yC,GACnBntD,IAAK,CAAE4/F,QAASh1D,GAChBvsC,IAAK,CAAEwhG,MAAOj1D,IAkLf,IC1LUu2D,GAAiCppH,GApBjC,WACQ,CACnB,QACA,QACA,QACA,UACA,mBACA,eACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,kBACA,aACA,aAGwE0D,IAmBrE,IAlBH,MACE4C,EAAK,MACLsX,EAAK,MACL4jC,EAAK,QACL7oC,EAAO,iBACP8yF,EAAgB,aAChBC,EAAY,aACZlkB,EAAY,UACZM,EAAS,aACTsJ,EAAY,aACZsF,EAAY,UACZ9E,EAAS,WACTM,EAAU,aACVyB,EAAY,gBACZkB,EAAe,WACfmB,EAAU,SACVqzB,GACD3lH,EAED,MAAM,YAAEykH,EAAW,cAAEM,EAAa,cAAEJ,EAAa,aAAEK,EAAY,QAAE5tG,EAAO,WAAEguG,EAAU,WAAEG,EAAU,uBAAET,EAAsB,eAAEZ,EAAc,YAAEsB,EAAW,gBAAEC,GACrJzB,GAAW,CAAEhxB,eAAc/C,eAAcqC,eAoH3C1vF,EAAM4R,cAAc,CAAE5M,KAAM,SAAU6L,GAAI,MAAO/G,QAASwQ,IAC1D,MAAM+kD,EAAWr/D,EAAM,WAAY,CACjC+gF,KAAMiiC,EACN,YAAaC,CAAChkC,EAAMvgE,IAAUskG,EAAU/jC,GAAM,EAAOvgE,GACrD,oBACEwkG,CAACjkC,EAAMvgE,EAAO3c,IAAYihH,EAAU/jC,GAAM,EAAOvgE,EAAO3c,GAC1D,cAAeihH,EACf,mBAAoBA,EACpB,2BAA4BA,IAQ9B,SAASG,EAAczmG,GACrB,OAAOA,EAAKgjE,WAAU,SAAUhjE,GAC9B,OAAOQ,GAAkBR,GACrBymG,EAAazmG,EAAKqmE,SAClBrmE,CACN,GACF,CAZA1c,EAAMgS,iBAAiB,CAAEhN,KAAM,SAAU6L,GAAI,MAAO/G,QAASwQ,IAE7D+kD,EAASiiD,eAAiBA,EAC1BjiD,EAASujD,YAAcA,EACvBvjD,EAASwjD,gBAAkBA,EAW3B,MAAMO,EAAsB,CAC1Bn7B,MAAM,EACNC,OAAO,EACPn1E,GAAG,EACHlX,GAAG,EACHuL,UAAU,EACV6Y,KAAK,EACLE,MAAM,EACNohF,OAAO,EACPC,QAAQ,EACRl5E,KAAK,EACLkN,KAAK,EACL7C,IAAI,EACJ8uE,SAAS,EACTC,OAAO,EACPz4C,KAAK,GAoNP,SAASo6D,EAAmBC,EAAYhiC,GACtC,MAAMiiC,EAAU,CAAC,EACjB,GAAID,EAAWt/G,EAAG,CAChB,MAAMw/G,EAAKF,EAAWt/G,EAAED,MAAM,MAC9B,GAAkB,IAAdy/G,EAAG1oH,OAIL,MAAM2K,YAAY,yBAA2B69G,EAAWt/G,GAHxDu/G,EAAQ9iE,EAAI+iE,EAAG,GACfD,EAAQztG,EAAI0tG,EAAG,EAInB,MACED,EAAQ9iE,EAAI6iE,EAAW7iE,EACvB8iE,EAAQztG,EAAIwtG,EAAWxtG,EAEzBytG,EAAQ9iE,EAAI0iE,EAAa7rG,EAAMisG,EAAQ9iE,IACvC8iE,EAAQztG,EAAIqtG,EAAa7rG,EAAMisG,EAAQztG,IACvC,IAAK,MAAME,IAAQ,CAAC,gBAAiB,SAAU,YACzCA,KAAQstG,IACVC,EAAQvtG,GAAQstG,EAAWttG,IAO/B,GAJIstG,EAAWvkC,WACbwkC,EAAQxkC,SAAWznE,EAAMgsG,EAAWvkC,WAGlCgjC,EAAcwB,EAAQ9iE,EAAG6gC,GAAU,CACrC,MAAMmiC,GAAkBtB,EAAcoB,EAAQ9iE,EAAG6gC,GACjD,IAAIoiC,EAEAD,IAAgBC,EAAgBC,KAEpC,MAAMlB,EAAWP,EAAuBqB,EAAQ9iE,GAC1CmjE,EAAYD,IAClBJ,EAAQM,SAAW,CAAC,EACpBN,EAAQM,SAASpjE,EAAIgiE,EAAS,CAACc,EAAQ9iE,EAAGmjE,IAG1CpvG,EAAQ+uG,EAAQM,SAASpjE,EAAG6gC,GAC5BkhC,EAAWe,EAAQM,SAASpjE,EAAG6gC,GAC/BiiC,EAAQM,SAAS/tG,EAAI2sG,EAAS,CAACc,EAAQztG,EAAG8tG,IAKtCH,IAEFF,EAAQO,YAAc,CAAC,EACvBP,EAAQO,YAAYrjE,EAAIgiE,EAAS,CAACiB,EAAeH,EAAQ9iE,IACzD8iE,EAAQO,YAAYhuG,EAAI2sG,EAAS,CAACiB,EAAeH,EAAQztG,IAEzDytG,EAAQQ,YAAc,CAAC,EACvBR,EAAQQ,YAAYtjE,EAAIgiE,EAAS,CAACiB,EAAeH,EAAQM,SAASpjE,IAClE8iE,EAAQQ,YAAYjuG,EAAI2sG,EAAS,CAACiB,EAAeH,EAAQM,SAAS/tG,IAEtE,CAEA,OAAOytG,CACT,CA9PAlkD,EAAS2kD,MAAQ,CACf5e,EAQA,CAAE3kD,EAAG,SAAU3qC,EAAG,KAKlB,CACE9R,EAAG,gBACHigH,SAAU,CAAE3zF,SAAU,CAAEkxF,OAAO,KAEjC,CACEx9G,EAAG,WACHigH,SAAU,CAAE3zF,SAAU,CAAEkxF,OAAO,KAEjC,CACEx9G,EAAG,uBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,GAAQnxF,SAAU,CAAEkxF,OAAO,KAElE,CACEx9G,EAAG,uBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,GAASnxF,SAAU,CAAEkxF,OAAO,KAEnE,CACEx9G,EAAG,uBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,GAASnxF,SAAU,CAAEkxF,OAAO,KAEnE,CAAE/gE,EAAG,WAAY3qC,EAAG,UACpB,CAAE2qC,EAAG,KAAM3qC,EAAG,YACd,CAAE2qC,EAAG,iBAAkB3qC,EAAG,oBAAqBouG,QAAQ,GACvD,CAAEzjE,EAAG,UAAW3qC,EAAG,YACnB,CAAE2qC,EAAG,OAAQ3qC,EAAG,WAChB,CACE9R,EAAG,8BACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,oCACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAIvC,CACEz9G,EAAG,iCACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAI/B,CAAE/gE,EAAG,4BAA6B3qC,EAAG,gCACrC,CACE9R,EAAG,+DACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAE/B,CACEx9G,EAAG,+DACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAE/B,CACEx9G,EAAG,+DACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAE/B,CAAE/gE,EAAG,MAAO3qC,EAAG,OACf,CACE9R,EAAG,uBACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAE/B,CACEx9G,EAAG,2BACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,KAO/Brc,EAGA,CACEnhG,EAAG,aACHigH,SAAU,CAAEh/G,IAAK,CAAEu8G,OAAO,KAE5B,CAAE/gE,EAAG,OAAQ3qC,EAAG,KAChB,CAAE2qC,EAAG,YAAa3qC,EAAG,YACrB,CAAE2qC,EAAG,gBAAiB3qC,EAAG,cACzB,CAAE2qC,EAAG,2BAA4B3qC,EAAG,iCACpC,CAAE2qC,EAAG,2BAA4B3qC,EAAG,iCAEpC,CACE9R,EAAG,wBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,wBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,8BACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,uBACHigH,SAAU,CAAE/5F,OAAQ,CAAEs3F,OAAO,GAAQxvE,SAAU,CAAEyvE,aAAa,KAEhE,CACEz9G,EAAG,8DACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,8DACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CAAEhhE,EAAG,YAAa3qC,EAAG,YACrB,CACE9R,EAAG,wBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,wBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvCtc,EAGA,CACEnhG,EAAG,qBACHigH,SAAU,CAAE3zF,SAAU,CAAEkxF,OAAO,KAEjC,CACEx9G,EAAG,qBACHigH,SAAU,CAAE3zF,SAAU,CAAEkxF,OAAO,GAAQxvE,SAAU,CAAEyvE,aAAa,KAIlE,CACEz9G,EAAG,iBACHigH,SAAU,CAAEh/G,IAAK,CAAEw8G,aAAa,IAChC0C,cAAe,CAAEl/G,IAAK,CAAEw8G,aAAa,KAEvC,CACEz9G,EAAG,iBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,IACrC0C,cAAe,CAAEnyE,SAAU,CAAEyvE,aAAa,KAK5C,CAAEhhE,EAAG,QAAS3qC,EAAG,QACjB,CAAE2qC,EAAG,UAAW3qC,EAAG,UACnB,CACE9R,EAAG,oBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,sBACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CACEz9G,EAAG,cACHigH,SAAU,CAAEjyE,SAAU,CAAEyvE,aAAa,KAEvC,CAAEhhE,EAAG,MAAO3qC,EAAG,KACf,CACE9R,EAAG,yBACHigH,SAAU,CAAEjyE,SAAU,CAAE0vE,aAAa,KAEvC,CACE19G,EAAG,uBACHigH,SAAU,CAAEG,SAAU,CAAE1C,aAAa,EAAMD,aAAa,KAO1D,CAAEhhE,EAAG,MAAO3qC,EAAG,IAAKquG,cAAe,CAAEnyE,SAAU,CAAEyvE,aAAa,KAE9D,CACEz9G,EAAG,2BACHigH,SAAU,CAAEjyE,SAAU,CAAE0vE,aAAa,KAGvC,CAAEjhE,EAAG,WAAY3qC,EAAG,WA8GtB,IAAIuuG,EAAW,EACf,SAASV,IACP,OAAO,IAAIj0B,EAAW,KAAO20B,IAC/B,CAEA,SAASrB,EAAW/jC,EAAM+kC,GAA+C,IAAxCtlG,EAAKliB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG6d,IAAkBtY,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EACpE,MAAM8nH,EAAQviH,EAAQwiH,aACtBP,EAlCF,SAAsBA,EAAO1iC,GAE3B,MAAMkjC,EAAU,GAChB,IAAK,IAAI3oH,EAAI,EAAGA,EAAImoH,EAAMlpH,OAAQe,IAAK,CACrC,IACI0nH,EADAkB,EAAOT,EAAMnoH,GAEjB,MAAM6oH,SAAkBD,EACxB,OAAQC,GACN,IAAK,SACHD,EAAO,CAAEzgH,EAAGygH,GAEd,IAAK,SACHlB,EAAUF,EAAkBoB,EAAMnjC,GAClC,MACF,IAAK,WACHiiC,EAAUkB,EACV,MACF,QACE,MAAMhkH,UAAU,6BAA+BikH,GAInDF,EAAQzoH,KAAKwnH,EACf,CACA,OAAOiB,CACT,CASUG,CAAYX,GAAS3kD,EAAS2kD,MAAOjiH,EAAQu/E,SACrD,IAAItsD,EAAM3iB,EAAQ4sE,EAAMvgE,GACxBsW,EAAMmuF,EAAanuF,GACnB,MAAM4vF,EAAU,CAAC,EACjB,IAAIznH,EAAM63B,EAAIroB,SAAS,CAAEm2E,YAAa,QACtC,MAAQ8hC,EAAQznH,IAAM,CACpBynH,EAAQznH,IAAO,EACfknH,EAAW,EACX,IAAIQ,EAAU1nH,EACVmnH,GAAO/T,QAAQvwF,IAAI,eAAgB7iB,GACvC,IAAK,IAAItB,EAAI,EAAGA,EAAImoH,EAAMlpH,OAAQe,IAAK,CACrC,IAAIipH,EAAU,GAWd,GAVwB,mBAAbd,EAAMnoH,IACfm5B,EAAMgvF,EAAMnoH,GAAGm5B,EAAKjzB,GAChBuiH,IAAOQ,EAAUd,EAAMnoH,GAAGyD,QAE9BkV,EAAQwgB,EAAKjzB,EAAQu/E,SACrBtsD,EAAM+vF,EAAU/vF,EAAKgvF,EAAMnoH,GAAIkG,EAAQu/E,SACnCgjC,IACFQ,EAAU,GAAGd,EAAMnoH,GAAG4kD,EAAE9zC,iBAAiBq3G,EAAMnoH,GAAGia,EAAEnJ,eAGpD23G,EAAO,CACT,MAAMU,EAAShwF,EAAIroB,SAAS,CAAEm2E,YAAa,QACvCkiC,IAAWH,IACbtU,QAAQvwF,IAAI,WAAY8kG,EAAS,WAAYE,GAC7CH,EAAUG,EAEd,CAIArC,EAAW3tF,EAAKjzB,EAAQu/E,QAC1B,CACAnkF,EAAM63B,EAAIroB,SAAS,CAAEm2E,YAAa,OACpC,CACA,OAAO9tD,CACT,CAEA,SAASiwF,EAAS7pD,EAAOqpD,EAAMnjC,GAC7B,IAAI4jC,EAAW9pD,EACf,GAAIA,EACF,IAAK,IAAIv/D,EAAI,EAAGA,EAAIu/D,EAAMtgE,SAAUe,EAAG,CACrC,MAAMspH,EAAUJ,EAAU3pD,EAAMv/D,GAAI4oH,EAAMnjC,GACtC6jC,IAAY/pD,EAAMv/D,KAChBqpH,IAAa9pD,IACf8pD,EAAW9pD,EAAMn/D,SAEnBipH,EAASrpH,GAAKspH,EAElB,CAEF,OAAOD,CACT,CAUA,SAASH,EAAWroG,EAAM+nG,EAAMnjC,GAK9B,GAAImjC,EAAKR,SACP,IAAK,MAAM9kC,KAAUslC,EAAKR,SACxB,IAAK,MAAM3lG,KAAYmmG,EAAKR,SAAS9kC,GACnC,GAAI0iC,EAAY1iC,EAAQ7gE,EAAUgjE,KAC9BmjC,EAAKR,SAAS9kC,GAAQ7gE,GACxB,OAAO5B,EAMf,MAAM0oG,EAAgBhD,EAAaqC,EAAKN,cAAe7iC,GAGvD,IAAItsD,EAAMtY,EAKV,GAAIsY,aAAeq4D,GAAgBr4D,aAAeo7D,EAAc,CAC9D,MAAMi1B,EAAUJ,EAAQjwF,EAAI3uB,KAAMo+G,EAAMnjC,GACpC+jC,IAAYrwF,EAAI3uB,OAClB2uB,EAAMA,EAAIxX,QACVwX,EAAI3uB,KAAOg/G,EAEf,MAAO,GAAIrwF,aAAeu5D,GACxB,GAAIv5D,EAAI+tD,QAAS,CACf,MAAMuiC,EAAaP,EAAU/vF,EAAI+tD,QAAS0hC,EAAMnjC,GAC5CgkC,IAAetwF,EAAI+tD,UACrB/tD,EAAM,IAAIu5D,EAAgB+2B,GAE9B,OACK,GAAItwF,aAAewsD,EAAW,CACnC,MAAM+jC,EAAWN,EAAQjwF,EAAIysD,MAAOgjC,EAAMnjC,GACtCikC,IAAavwF,EAAIysD,QACnBzsD,EAAM,IAAIwsD,EAAU+jC,GAExB,MAAO,GAAIvwF,aAAeksD,EAAc,CACtC,IAAIskC,EAASxwF,EAAIlc,OACbkc,EAAIlc,SACN0sG,EAAST,EAAU/vF,EAAIlc,OAAQ2rG,EAAMnjC,IAEvC,IAAImkC,EAAWzwF,EAAI92B,MACf82B,EAAI92B,QACNunH,EAAWV,EAAU/vF,EAAI92B,MAAOumH,EAAMnjC,IAEpCkkC,IAAWxwF,EAAIlc,QAAU2sG,IAAazwF,EAAI92B,QAC5C82B,EAAM,IAAIksD,EAAaskC,EAAQC,GAEnC,MAAO,GAAIzwF,aAAes2D,EAAW,CACnC,MAAMo6B,EAAUT,EAAQjwF,EAAIkK,WAAYulF,EAAMnjC,GAC1CokC,IAAY1wF,EAAIkK,aAClBlK,EAAM,IAAIs2D,EAAUo6B,GAExB,MAAO,GAAI1wF,aAAe42D,EAAY,CACpC,IAAIppD,GAAU,EACd,MAAMmjF,EAAW,CAAC,EAClB,IAAK,MAAM3vG,KAAQgf,EAAIpW,WACrB+mG,EAAS3vG,GAAQ+uG,EAAU/vF,EAAIpW,WAAW5I,GAAOyuG,EAAMnjC,GACnDqkC,EAAS3vG,KAAUgf,EAAIpW,WAAW5I,KACpCwsB,GAAU,GAGVA,IACFxN,EAAM,IAAI42D,EAAW+5B,GAEzB,CAGA,IAAIC,EAAOnB,EAAK3uG,EACZtU,EAAUqkH,EAAWpB,EAAKhkE,EAAGzrB,EAAKowF,GAAe,GAkBrD,IAdK5jH,GAAWijH,EAAKZ,WACnB+B,EAAOnB,EAAKZ,SAAS/tG,EACrBtU,EAAUqkH,EAAWpB,EAAKZ,SAASpjE,EAAGzrB,EAAKowF,GAAe,KAGvD5jH,GAAWijH,EAAKX,cACnB8B,EAAOnB,EAAKX,YAAYhuG,EACxBtU,EAAUqkH,EAAWpB,EAAKX,YAAYrjE,EAAGzrB,EAAKowF,GAAe,GACxD5jH,IACHokH,EAAOnB,EAAKV,YAAYjuG,EACxBtU,EAAUqkH,EAAWpB,EAAKV,YAAYtjE,EAAGzrB,EAAKowF,GAAe,KAI7D5jH,EAAS,CAKX,MAAMyhF,EAAWjuD,EAAIiuD,SACrBjuD,EAAM4wF,EAAKpoG,QACPylE,GAAY,aAAc2iC,IAC5B5wF,EAAIiuD,UAAW,GAIjBjuD,EAAMA,EAAI0qD,WAAU,SAAUhjE,GAC5B,OAAIA,EAAKW,cAAgBzgB,GAAe4E,EAAQskH,aAAcppG,EAAKpd,MAC1DkC,EAAQskH,aAAappG,EAAKpd,MAAMke,QAEhCd,CAEX,GAIF,CAMA,OAJI+nG,EAAKP,QAAUlvF,IAAQtY,IACzBsY,EAAM+vF,EAAU/vF,EAAKyvF,EAAMnjC,IAGtBtsD,CACT,CAuCA,SAAS+wF,EAAYC,EAAQC,GAC3B,MAAMjxF,EAAM,CAAE8wF,aAAc,CAAC,GAG7B,IAAKE,EAAOF,eAAiBG,EAAOH,aAClC,OAAO9wF,EACF,IAAKgxF,EAAOF,aACjB,OAAOG,EACF,IAAKA,EAAOH,aACjB,OAAOE,EAIT,IAAK,MAAMtpH,KAAOspH,EAAOF,aACvB,GAAIlpH,GAAeopH,EAAOF,aAAcppH,KACtCs4B,EAAI8wF,aAAappH,GAAOspH,EAAOF,aAAappH,GAExCE,GAAeqpH,EAAOH,aAAcppH,KACjCwpH,EAAYF,EAAOF,aAAappH,GAAMupH,EAAOH,aAAappH,KAC7D,OAAO,KAMf,IAAK,MAAMA,KAAOupH,EAAOH,aACnBlpH,GAAeqpH,EAAOH,aAAcppH,KACtCs4B,EAAI8wF,aAAappH,GAAOupH,EAAOH,aAAappH,IAIhD,OAAOs4B,CACT,CAMA,SAASmxF,EAAqBC,EAAOC,GACnC,MAAMrxF,EAAM,GAEZ,GAAqB,IAAjBoxF,EAAMtrH,QAAiC,IAAjBurH,EAAMvrH,OAC9B,OAAOk6B,EAGT,IAAIutF,EACJ,IAAK,IAAI+D,EAAK,EAAGA,EAAKF,EAAMtrH,OAAQwrH,IAClC,IAAK,IAAIC,EAAK,EAAGA,EAAKF,EAAMvrH,OAAQyrH,IAClChE,EAASwD,EAAWK,EAAME,GAAKD,EAAME,IACjChE,GACFvtF,EAAIj5B,KAAKwmH,GAIf,OAAOvtF,CACT,CAoCA,SAAS6wF,EAAYpB,EAAM/nG,EAAM4kE,EAASklC,GAMxC,IAAIxxF,EAAM,CAAC,CAAE8wF,aAAc,CAAC,IAE5B,GAAKrB,aAAgBp3B,GAAgB3wE,aAAgB2wE,GAClDo3B,aAAgBr0B,GAAgB1zE,aAAgB0zE,EAAe,CAEhE,GAAIq0B,aAAgBp3B,GAClB,GAAIo3B,EAAK5nG,KAAOH,EAAKG,IAAM4nG,EAAK5iH,KAAO6a,EAAK7a,GAC1C,MAAO,QAEJ,GAAI4iH,aAAgBr0B,GACrBq0B,EAAKnlH,OAASod,EAAKpd,KACrB,MAAO,GAKX,KAA0B,IAArBod,EAAKrW,KAAKvL,QAAqC,IAArB2pH,EAAKp+G,KAAKvL,SACnCinH,EAAcrlG,EAAM4kE,IACrB5kE,EAAKrW,KAAKvL,SAAW2pH,EAAKp+G,KAAKvL,QAChC0rH,GAqCG,IAAI9pG,EAAKrW,KAAKvL,QAAU,GAA0B,IAArB2pH,EAAKp+G,KAAKvL,OAAc,CAG1D,MAAM2rH,EAzLZ,SAAoB/pG,EAAM4kE,GACxB,MAAMtsD,EAAM,GACZ,IAAIglC,EAAO0sD,EACX,MAAMjE,EAAWP,EAAuBxlG,GACxC,GAAIylG,EAAczlG,EAAM4kE,GACtB,IAAK,IAAIzlF,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IACpC6qH,EAAYhqG,EAAKrW,KAAKpK,MAAM,GAC5ByqH,EAAUt0G,OAAOvW,EAAG,GACpBm+D,EAA8B,IAArB0sD,EAAU5rH,OAAgB4rH,EAAU,GAAKjE,EAASiE,GAC3D1xF,EAAIj5B,KAAK0mH,EAAS,CAAC/lG,EAAKrW,KAAKxK,GAAIm+D,UAInC,IAAK,IAAIn+D,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IAAK,CACzC,IAAIk+D,EAAOr9C,EAAKrW,KAAK,GACjBxK,EAAI,IACNk+D,EAAO0oD,EAAS/lG,EAAKrW,KAAKpK,MAAM,EAAGJ,KAErC6qH,EAAYhqG,EAAKrW,KAAKpK,MAAMJ,GAC5Bm+D,EAA8B,IAArB0sD,EAAU5rH,OAAgB4rH,EAAU,GAAKjE,EAASiE,GAC3D1xF,EAAIj5B,KAAK0mH,EAAS,CAAC1oD,EAAMC,IAC3B,CAEF,OAAOhlC,CACT,CAiKqB2xF,CAAUjqG,EAAM4kE,GAC/B,IAAIslC,EAAe,GACnB,IAAK,IAAI/qH,EAAI,EAAGA,EAAI4qH,EAAO3rH,OAAQe,IAAK,CACtC,MAAMgrH,EAAWhB,EAAWpB,EAAMgC,EAAO5qH,GAAIylF,GAAS,GACtDslC,EAAeA,EAAazlH,OAAO0lH,EACrC,CACA,OAAOD,CACT,CAAO,GAAInC,EAAKp+G,KAAKvL,OAAS,EAC5B,MAAMsV,MAAM,+CAAiDq0G,EAAK93G,YAGlE,MAAO,EACT,CApDa,CAGX,IAAIm6G,EAAe,GACnB,IAAK,IAAIjrH,EAAI,EAAGA,EAAI4oH,EAAKp+G,KAAKvL,OAAQe,IAAK,CACzC,MAAMkrH,EAAalB,EAAWpB,EAAKp+G,KAAKxK,GAAI6gB,EAAKrW,KAAKxK,GAAIylF,GAC1D,GAA0B,IAAtBylC,EAAWjsH,OAEb,MAGFgsH,EAAa/qH,KAAKgrH,EACpB,CACA,GAAID,EAAahsH,SAAW2pH,EAAKp+G,KAAKvL,OAAQ,CAC5C,IAAKqnH,EAAczlG,EAAM4kE,IACA,IAArBmjC,EAAKp+G,KAAKvL,OACZ,MAAO,GAET,GAAI2pH,EAAKp+G,KAAKvL,OAAS,EAKrB,MAAM,IAAIsV,MAAM,+EAGlB,MAAM42G,EAAYnB,EAAWpB,EAAKp+G,KAAK,GAAIqW,EAAKrW,KAAK,GAAIi7E,GACzD,GAAyB,IAArB0lC,EAAUlsH,OACZ,MAAO,GAET,MAAMmsH,EAAapB,EAAWpB,EAAKp+G,KAAK,GAAIqW,EAAKrW,KAAK,GAAIi7E,GAC1D,GAA0B,IAAtB2lC,EAAWnsH,OACb,MAAO,GAETgsH,EAAe,CAACE,EAAWC,EAC7B,CACAjyF,EA1FN,SAA4B8xF,GAC1B,GAA4B,IAAxBA,EAAahsH,OACf,OAAOgsH,EAGT,MAAMI,EAAOJ,EAAarpF,OAAO0oF,GAC3BgB,EAAa,GACbvrC,EAAS,CAAC,EAChB,IAAK,IAAI//E,EAAI,EAAGA,EAAIqrH,EAAKpsH,OAAQe,IAAK,CACpC,MAAMmI,EAAI89B,KAAKjH,UAAUqsF,EAAKrrH,GAAIknH,GAC7BnnC,EAAO53E,KACV43E,EAAO53E,IAAK,EACZmjH,EAAWprH,KAAKmrH,EAAKrrH,IAEzB,CACA,OAAOsrH,CACT,CA0EYC,CAAkBN,EAC1B,CAgBF,MAAO,GAAIrC,aAAgB/0B,EAAY,CAIrC,GAAyB,IAArB+0B,EAAKnlH,KAAKxE,OACZ,MAAM,IAAIsV,MAAM,oCAElB,GAAIgzG,EAAoBqB,EAAKnlH,OAE3B,GAAImlH,EAAKnlH,OAASod,EAAKpd,KACrB,MAAO,QAIT,OAAQmlH,EAAKnlH,KAAK,IAAM,KAAOmlH,EAAKnlH,KAAK,IAAM,IAAMmlH,EAAKnlH,KAAK8yB,UAAU,EAAG,GAAKqyF,EAAKnlH,KAAK,IACzF,IAAK,IACL,IAAK,KAIH01B,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EACjC,MACF,IAAK,IACL,IAAK,KAEH,IAAIF,EAAeE,GAIjB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,IAEH,GAAKF,EAAeE,GAIlB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,KAEH,IAAI2qG,GAAe3qG,GAIjB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,KAEH,IAAIwkG,GAAcxkG,GAIhB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,KAEH,GAAKwkG,GAAcxkG,GAIjB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,KAEH,IAAIykG,GAAqBzkG,GAIvB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,IAAK,KAEH,GAAKykG,GAAqBzkG,GAIxB,MAAO,GAHPsY,EAAI,GAAG8wF,aAAarB,EAAKnlH,MAAQod,EAKnC,MACF,QACE,MAAM,IAAItM,MAAM,2BAA6Bq0G,EAAKnlH,MAG1D,KAAO,MAAImlH,aAAgB35B,GAOzB,MAAO,GALP,IAAK5vC,EAAMupE,EAAKljH,MAAOmb,EAAKnb,OAC1B,MAAO,EAKX,CAKA,OAAOyzB,CACT,CASA,SAASkxF,EAAaxiH,EAAGmqB,GACvB,GAAInqB,aAAaonF,GAAgBj9D,aAAai9D,GAC5C,IAAK5vC,EAAMx3C,EAAEnC,MAAOssB,EAAEtsB,OACpB,OAAO,OAEJ,GAAImC,aAAagsF,GAAc7hE,aAAa6hE,GACjD,GAAIhsF,EAAEpE,OAASuuB,EAAEvuB,KACf,OAAO,MAEJ,MAAKoE,aAAa2pF,GAAgBx/D,aAAaw/D,GACjD3pF,aAAa0sF,GAAgBviE,aAAauiE,GAqB7C,OAAO,EApBP,GAAI1sF,aAAa2pF,GACf,GAAI3pF,EAAEmZ,KAAOgR,EAAEhR,IAAMnZ,EAAE7B,KAAOgsB,EAAEhsB,GAC9B,OAAO,OAEJ,GAAI6B,aAAa0sF,GAClB1sF,EAAEpE,OAASuuB,EAAEvuB,KACf,OAAO,EAIX,GAAIoE,EAAE2C,KAAKvL,SAAW+yB,EAAExnB,KAAKvL,OAC3B,OAAO,EAGT,IAAK,IAAIe,EAAI,EAAGA,EAAI6H,EAAE2C,KAAKvL,OAAQe,IACjC,IAAKqqH,EAAYxiH,EAAE2C,KAAKxK,GAAIgyB,EAAExnB,KAAKxK,IACjC,OAAO,CAKb,CAEA,OAAO,CACT,CAEA,OAAOwjE,CAAQ,ICphCJioD,GAAyC5tH,GAlBzC,mBACQ,CACnB,QACA,SACA,oBACA,SACA,YACA,aACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,eAGgF0D,IAe5E,IAf6E,MACjF4C,EAAK,OACLyf,EAAM,kBACNq/D,EAAiB,OACjBr6D,EAAM,SACNkW,EAAQ,UACR8pB,EAAS,aACTy8B,EAAY,UACZM,EAAS,aACTsJ,EAAY,aACZsF,EAAY,UACZ9E,EAAS,WACTM,EAAU,aACVyB,EAAY,WACZqC,GACDtyF,EACC,MAAM,cAAE+kH,EAAa,cAAEJ,EAAa,YAAEC,EAAW,uBAAEE,GACjDd,GAAW,CAAEhxB,eAAc/C,eAAcqC,eA6BrCyV,EAAmBnlG,EAAM,mBAAoB,CACjD+gF,KAAMrkE,GAAQ6qG,EAAYC,EAAa9qG,EAAM,CAAC,IAE9C,eAAgB,SAAUuiE,EAAMl9E,GAC9B,OAAOwlH,EAAYC,EAAavoC,EAAMl9E,GACxC,IAGF,SAAS0lH,EAAkBC,GACzB,OAAI3sG,EAAW2sG,GACNA,EAAMnuG,UAEXmuG,aAAiBloH,MACZkoH,EAAMjkH,IAAIgkH,GAEfvsG,EAASwsG,GACJjjG,EAAOgjG,EAAiBC,EAAMnuG,YAEhCmuG,CACT,CAEA,SAASC,EAAOC,EAAQvhH,EAAMtE,GAC5B,IACE,OAAO+8E,EAAkB8oC,GAAQrgH,MAAM,KAAMlB,EAC/C,CAAE,MAAOwhH,GAGP,OADAxhH,EAAOA,EAAK5C,IAAIgkH,GACTK,EAAUhpC,EAAkB8oC,GAAQrgH,MAAM,KAAMlB,GAAOtE,EAChE,CACF,CAEA,MAAMgmH,EAAU/nH,EAAM,CACpBikB,SA8GF,SAA0BhpB,GAExB,MAAM+sH,EAAczmH,GAA4B,cAAlBke,EAAOC,QAA0B+kC,EAAYA,EAAUljD,GAAS6iB,OAAO7iB,GAE/F0mH,EAAiBhtH,EAAE+I,EAAI/I,EAAEmD,EACzB8pH,EAAiBD,EAAiB,GACpC,IAAI56B,EAAa,IAAK,aAAc,CAAC,IAAIvC,GAAck9B,EAAWC,MAClE,IAAIn9B,EAAak9B,EAAWC,IAEhC,OAAgB,KAARhtH,EAAEL,EACNstH,EACA,IAAI76B,EAAa,IAAK,SAAU,CAAC66B,EAAe,IAAIp9B,EAAak9B,EAAW/sH,EAAEL,KACpF,EAzHE8kB,OAAQ,SAAUthB,GAChB,OAAIA,EAAI,EACC+pH,EAAe,IAAIr9B,GAAc1sF,IAEnC,IAAI0sF,EAAa1sF,EAC1B,EACA0lB,UAAW,SAAU1lB,GACnB,OAAIA,EAAI,EACC+pH,EAAe,IAAIr9B,GAAc1sF,IAEnC,IAAI0sF,EAAa1sF,EAC1B,EACAsoC,OAAQ,SAAUtoC,GAChB,OAAIA,EAAI,GACC+pH,EAAe,IAAIr9B,GAAc1sF,IAEnC,IAAI0sF,EAAa1sF,EAC1B,EACA2lB,QAAS,SAAU/f,GACjB,MAAM,IAAIoM,MAAM,wCAClB,EACAo3B,OAAQ,SAAUxjC,GAChB,OAAO,IAAI8mF,EAAa9mF,EAC1B,EACAy1B,OAAQ,SAAU3P,GAChB,OAAO,IAAI03D,EAAU13D,EAAEvQ,UAAU9V,KAAIsP,GAAKg1G,EAAQh1G,KACpD,IAGF,SAASw0G,EAAaG,GACpB,OAAIvrG,EAAOurG,GACFA,EAEFK,EAAQL,EACjB,CAIA,SAASU,EAAgBhqH,EAAG2D,GAE1B,GADwBA,IAAsC,IAA3BA,EAAQsmH,gBACrBhpG,SAASjhB,IAAMu8B,EAAU,CAC7C,MAAM1/B,EAAI0/B,EAASv8B,GACbkqH,EAAkBvmH,GAA6C,iBAA3BA,EAAQumH,eAC9CvmH,EAAQumH,eACRlhH,IAEJ,GAAInM,EAAEse,YAAcnb,GAAKnD,EAAEmD,EAAIkqH,GAAkBrtH,EAAEL,EAAI0tH,EACrD,OAAOrtH,CAEX,CACA,OAAOmD,CACT,CAIA,MAAM0pH,EAAY9nH,EAAM,CACtB,iBAAkB,SAAUgE,EAAGjC,GAC7B,MAAMkzF,EAAc11E,GAAevb,EAAGyb,GAEtC,MAAoB,cAAhBw1E,QACgB53F,IAAdonD,GACFJ,KAEKI,EAAUzgD,IACQ,WAAhBixF,EACFt1E,OAAO3b,GACW,aAAhBixF,QACQ53F,IAAbs9B,GACF2pB,KAEK3pB,EAAS32B,IAGTokH,EADG1wG,WAAW1T,GACIjC,EAE7B,EAEA,mBAAoB,SAAUiC,EAAGjC,GAAW,OAAOiC,CAAE,EAErD,oBAAqB,SAAUA,EAAGjC,GAAW,OAAOiC,CAAE,EAEtD,iBAAkB,SAAUA,EAAGjC,GAC7B,OAAOqmH,EAAepkH,EAAGjC,EAC3B,EAEA,iBAAkB,SAAUiC,EAAGjC,GAC7B,OAAOiC,CACT,EAEA,kBAAmB,SAAUA,EAAGjC,GAC9B,OAAa,IAATiC,EAAE2wB,GACG3wB,EAEFokH,EAAepkH,EAAE2S,GAAI5U,EAC9B,EAEA,iBAAkB,SAAUiC,EAAGjC,GAC7B,OAAO0iB,EAAO2jG,EAAepkH,EAAEuV,WACjC,EAEA,gBAAiB,SAAUvV,EAAGjC,GAC5B,OAAOiC,EAAEP,IAAI2kH,EACf,IAGF,SAASD,EAAgB/pH,GACvB,OAAO,IAAIivF,EAAa,IAAK,aAAc,CAACjvF,GAC9C,CAyGA,SAASmqH,EAAQ1mH,EAAIwE,EAAMo8G,EAAU1gH,GACnC,MAAM4gB,EAAQtc,EAAKuc,QAIb4lG,EAAYniH,EAAKo3B,QAAO,CAACgrF,EAAOpuH,KACpC,IAAK8hB,EAAO9hB,GAAO,CACjB,MAAMsL,EAAO8iH,EAAM3lG,MAEnB,GAAI3G,EAAOxW,GACT,MAAO,CAACA,EAAMtL,GAGhB,IAEE,OADAouH,EAAM1sH,KAAK4rH,EAAM9lH,EAAI,CAAC8D,EAAMtL,GAAO0H,IAC5B0mH,CACT,CAAE,MAAOC,GACPD,EAAM1sH,KAAK4J,EAEb,CACF,CAIA8iH,EAAM1sH,KAAKwrH,EAAYkB,EAAM3lG,QAC7B,MAAM6lG,EAA4B,IAAjBF,EAAM3tH,OAAgB2tH,EAAM,GAAKhG,EAASgG,GAC3D,MAAO,CAAChG,EAAS,CAACkG,EAASpB,EAAYltH,KAAQ,GAC9C,CAACsoB,IAEJ,OAAyB,IAArB6lG,EAAU1tH,OACL0tH,EAAU,GAGZ/F,EAAS,CAAC+F,EAAU,GAAIT,EAAQS,EAAU,KACnD,CAGA,SAAShB,EAAc9qG,EAAM3a,GAC3B,OAAQ2a,EAAKtc,MACX,IAAK,aACH,OAAOsc,EACT,IAAK,eACH,cAAeA,EAAKnb,OAClB,IAAK,SACL,IAAK,SAAU,OAAOumH,EAAUprG,EAAKnb,MAAOQ,GAC5C,IAAK,SAAU,OAAO2a,EAAKnb,MAC3B,QACE,IAAKoW,MAAM+E,EAAKnb,OAAQ,OAAOumH,EAAUprG,EAAKnb,MAAOQ,GAEzD,OAAO2a,EACT,IAAK,eACH,GAAIoiE,EAAkBpiE,EAAKpd,OAASw/E,EAAkBpiE,EAAKpd,MAAMkuF,QAC/D,OAAO9wE,EAKP,IAD0B,CAAC,MAAO,YACXE,SAASF,EAAKpd,MAAO,CAC1C,MAAM+G,EAAOqW,EAAKrW,KAAK5C,KAAIsG,GAAOy9G,EAAaz9G,EAAKhI,KAGpD,IAAKsE,EAAK/C,KAAK6Y,GACb,IACE,OAAOwrG,EAAMjrG,EAAKpd,KAAM+G,EAAMtE,EAChC,CAAE,MAAO2mH,GAAqB,CAIhC,GAAkB,SAAdhsG,EAAKpd,MACW,IAAhB+G,EAAKvL,QACLshB,EAAY/V,EAAK,IAAK,CACxB,MAAMuiH,EAAK,GACX,IAAIC,EAAUxiH,EAAK,GACnB,KAAO+V,EAAYysG,IACjBD,EAAG7sH,KAAK8sH,EAAQpnC,MAAM3mF,QACtB+tH,EAAUA,EAAQpnC,MAAM,GAE1B,OAAOh9D,EAAOmkG,EAChB,CAGA,OAAO,IAAIx4B,EAAa1zE,EAAKpd,KAAM+G,EAAK5C,IAAI8jH,GAC9C,CAKJ,IAAK,eACL,CACE,MAAM1lH,EAAK6a,EAAK7a,GAAG8K,WACnB,IAAItG,EACA2uB,EACJ,MAAMytF,EAAWP,EAAuBxlG,GACxC,GAAIC,EAAeD,IAASA,EAAK4jB,UAC/Bj6B,EAAO,CAACmhH,EAAa9qG,EAAKrW,KAAK,GAAItE,IAIjCizB,EAHG7Y,EAAO9V,EAAK,IAGTo8G,EAASp8G,GAFTshH,EAAM9lH,EAAIwE,EAAMtE,QAInB,GAAIggH,EAAcrlG,EAAM3a,EAAQu/E,SAIrC,GAHAj7E,EAAO27G,EAAYtlG,EAAM3a,EAAQu/E,SACjCj7E,EAAOA,EAAK5C,KAAIsG,GAAOy9G,EAAaz9G,EAAKhI,KAErCogH,EAActgH,EAAIE,EAAQu/E,SAAU,CAEtC,MAAMwnC,EAAS,GACTC,EAAO,GAEb,IAAK,IAAIltH,EAAI,EAAGA,EAAIwK,EAAKvL,OAAQe,IAC1BsgB,EAAO9V,EAAKxK,IAGfktH,EAAKhtH,KAAKsK,EAAKxK,IAFfitH,EAAO/sH,KAAKsK,EAAKxK,IAMjBitH,EAAOhuH,OAAS,GAClBk6B,EAAMuzF,EAAO1mH,EAAIinH,EAAQrG,EAAU1gH,GACnCgnH,EAAKlmG,QAAQmS,GACbA,EAAMuzF,EAAO1mH,EAAIknH,EAAMtG,EAAU1gH,IAGjCizB,EAAMuzF,EAAO1mH,EAAIwE,EAAMo8G,EAAU1gH,EAErC,MAEEizB,EAAMuzF,EAAO1mH,EAAIwE,EAAMo8G,EAAU1gH,QAInCsE,EAAOqW,EAAKrW,KAAK5C,KAAIsG,GAAOy9G,EAAaz9G,EAAKhI,KAC9CizB,EAAMuzF,EAAO1mH,EAAIwE,EAAMo8G,EAAU1gH,GAEnC,OAAOizB,CACT,CACA,IAAK,kBAEH,OAAOwyF,EAAa9qG,EAAKqmE,QAAShhF,GACpC,IAAK,eACH,OApON,SAAwBuO,EAAKpS,EAAO6D,GAClC,IAAKib,EAAY9e,GACf,OAAO,IAAIgjF,EAAaqmC,EAAYj3G,GAAMi3G,EAAYrpH,IAExD,GAAIke,EAAY9L,IAAQ4K,EAAS5K,GAAM,CACrC,MAAM04G,EAAgBxpH,MAAMwF,KAAK9G,EAAMghC,YAOvC,KAAO8pF,EAAcluH,OAAS,GAC5B,GAAI0hB,EAAewsG,EAAc,KACK,iBAA3BA,EAAc,GAAGznH,MAAoB,CAC9C,MAAMohB,EAAQmlG,EAAUkB,EAAcpmG,QAAQrhB,MAAOQ,GACjDqa,EAAY9L,GACdA,EAAMA,EAAImxE,MAAM9+D,EAAQ,IAExBrS,EAAMA,EAAIiJ,UAAUoJ,EAAQ,cACTnjB,QACjB8Q,EAAMmU,EAAOnU,GAGnB,KAAO,MAAI04G,EAAcluH,OAAS,GACvB0hB,EAAewsG,EAAc,KACK,iBAA3BA,EAAc,GAAGznH,OAwBjC,MAxBqD,CACrD,MAAM4pE,EAAS28C,EAAUkB,EAAc,GAAGznH,MAAOQ,GAC3CknH,EAAW,GACXC,EAAY9sG,EAAY9L,GAAOA,EAAImxE,MAAQnxE,EAAIiJ,UACrD,IAAK,MAAMtI,KAAQi4G,EACjB,GAAI9sG,EAAYnL,GACdg4G,EAASltH,KAAKkV,EAAKwwE,MAAMtW,EAAS,QAC7B,KAAIjwD,EAAS5K,GAGlB,MAFA24G,EAASltH,KAAKkV,EAAKk6D,EAAS,GAG9B,CAEF,GAAI89C,EAASnuH,SAAWouH,EAAUpuH,OAQhC,MANEwV,EADE8L,EAAY9L,GACR,IAAIkxE,EAAUynC,GAEdxkG,EAAOwkG,GAEfD,EAAc52G,OAAO,EAAG,EAI5B,CAEA,CAEF,OAAI42G,EAAcluH,SAAWoD,EAAMghC,WAAWpkC,OAErC,IAAIomF,EAAaqmC,EAAYj3G,GAAMpS,GAExC8qH,EAAcluH,OAAS,GAEzBoD,EAAQ,IAAIotF,EAAU09B,GACf,IAAI9nC,EAAaqmC,EAAYj3G,GAAMpS,IAGrCoS,CACT,CACA,GAAI2M,EAAa3M,IACe,IAA5BpS,EAAMghC,WAAWpkC,QACjB0hB,EAAete,EAAMghC,WAAW,IAAK,CACvC,MAAMxiC,EAAMwB,EAAMghC,WAAW,GAAG39B,MAChC,OAAI7E,KAAO4T,EAAIsO,WACNtO,EAAIsO,WAAWliB,GAEjB,IAAIouF,CACb,CAEA,OAAO,IAAI5J,EAAaqmC,EAAYj3G,GAAMpS,EAC5C,CAwJairH,CACL3B,EAAa9qG,EAAK5D,OAAQ/W,GAC1BylH,EAAa9qG,EAAKxe,MAAO6D,GACzBA,GACJ,IAAK,YAAa,CAChB,MAAMqnH,EAAY1sG,EAAK+kE,MAAMh+E,KAAIwN,GAAQu2G,EAAav2G,EAAMlP,KAC5D,OAAIqnH,EAAU9lH,KAAK6Y,GACV,IAAIqlE,EAAU4nC,EAAU3lH,IAAI8jH,IAG9B9iG,EAAO2kG,EAChB,CACA,IAAK,YACH,OAAO,IAAI99B,EACT5uE,EAAKwiB,WAAWz7B,KAAIrF,GAAK+mG,EAAiB/mG,EAAG2D,MAEjD,IAAK,aAAc,CACjB,MAAMsnH,EAAY,CAAC,EACnB,IAAK,MAAMrzG,KAAQ0G,EAAKkC,WACtByqG,EAAUrzG,GAAQmvF,EAAiBzoF,EAAKkC,WAAW5I,GAAOjU,GAE5D,OAAO,IAAI6pF,EAAWy9B,EACxB,CAWA,QACE,MAAM,IAAIj5G,MAAM,gDAAgDsM,EAAKtc,QAE3E,CAEA,OAAO+kG,CAAgB,ICxenB7lG,GAAO,eAsBAgqH,GAAqC5vH,GAAQ4F,GArBrC,CACnB,QACA,QACA,QACA,SACA,MACA,WACA,WACA,SACA,MACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,kBACA,eAG4ElC,IAmBxE,IAnByE,MAC7E4C,EAAK,MACLsX,EAAK,MACL4jC,EAAK,OACL9xB,EAAM,IACNnkB,EAAG,SACHqrB,EAAQ,SACR0hB,EAAQ,OACR9nB,EAAM,IACNjW,EAAG,aACHitE,EAAY,UACZM,EAAS,aACTsJ,EAAY,aACZsF,EAAY,UACZ9E,EAAS,WACTM,EAAU,aACVyB,EAAY,gBACZkB,EAAe,WACfmB,GACDtyF,EACC,MAAMmsH,EAAQ,IAAIz+B,EAAa,GACzB0+B,EAAQ,IAAI1+B,EAAa,GACzB2+B,EAAQ,IAAI3+B,GAAa,GACzB4+B,EAAQ,IAAI5+B,GAAa,GAG/B,SAAS6+B,EAAiBjtG,GACxB,OAAOC,EAAeD,IAAS,CAAC,MAAO,MAAO,MAAME,SAASF,EAAKG,GACpE,CAEA,MAAM,YAAEglG,EAAW,cAAEM,GACnBf,GAAW,CAAEhxB,eAAc/C,eAAcqC,eA6C3C,SAASk6B,EAAeC,GAA8B,IAAd9nH,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EACjD,MAAM8kF,EAAUv/E,EAAUA,EAAQu/E,aAAUjkF,EAC5C,GAAIwkH,EAAYgI,EAAgB,UAAWvoC,GAAU,CAGnD,GAAIvkE,EAAe8sG,IAAkD,IAA/BA,EAAexjH,KAAKvL,OACxD,OAAO8uH,EAAcC,EAAexjH,KAAK,GAAItE,GAG/C,IAAI+nH,GAAY,EACZC,EAAa,EAOjB,GANAF,EAAe5rH,SAAQQ,MACnBsrH,EACiB,IAAfA,IACFD,EAAYF,EAAcnrH,EAAGsD,GAC/B,IAEiB,IAAfgoH,EACF,OAAOD,CAEX,CACA,IAAIptG,EAAOmtG,EACX,GAAI9sG,EAAeL,GAAO,CACxB,MAAMG,E5VqRL,SAAsBhb,GAC3B,MAAM28B,EAAa,gBAAkB38B,EACrC,IAAK,MAAMmoH,KAASprG,GAClB,GAAI4f,KAAcwrF,EAChB,OAAOA,EAAMxrF,GAAY3hB,GAG7B,OAAO,IACT,C4V7RiBotG,CAAYvtG,EAAKpd,MAC5B,IAAIud,EAYF,OAAO,IAAIuzE,EACTw5B,EAAcltG,EAAK7a,IAAK6a,EAAKrW,KAAK5C,KAAIrF,GAAKwrH,EAAcxrH,EAAG2D,MAX9D,GAAI2a,EAAKrW,KAAKvL,OAAS,GAAK+mH,EAAYnlG,EAAM,cAAe4kE,GAE3D,KAAO5kE,EAAKrW,KAAKvL,OAAS,GAAG,CAC3B,MAAM6K,EAAO+W,EAAKrW,KAAKyc,MACjBonG,EAAUxtG,EAAKrW,KAAKyc,MAC1BpG,EAAKrW,KAAKtK,KAAK,IAAIsxF,EAAaxwE,EAAIH,EAAKpd,KAAM,CAACqG,EAAMukH,IACxD,CAEFxtG,EAAO,IAAI2wE,EAAaxwE,EAAIH,EAAKpd,KAAMod,EAAKrW,KAKhD,CACA,GAAIsW,EAAeD,IAASA,EAAK4jB,UAAW,CAC1C,MAAM6pF,EAAKP,EAAcltG,EAAKrW,KAAK,GAAItE,GAEvC,GAAgB,MAAZ2a,EAAKG,IACHF,EAAewtG,IAAOA,EAAG7pF,WAAuB,MAAV6pF,EAAGttG,GAC3C,OAAOstG,EAAG9jH,KAAK,GAGnB,GAAgB,QAAZqW,EAAKG,IACHF,EAAewtG,IAAOA,EAAG7pF,WAAuB,QAAV6pF,EAAGttG,IAIvC8sG,EAAgBQ,EAAG9jH,KAAK,IAC1B,OAAO8jH,EAAG9jH,KAAK,GAIrB,IAAI+jH,GAAS,EACb,GAAgB,MAAZ1tG,EAAKG,IACHF,EAAewtG,KACbA,EAAG3jG,YAAwB,aAAV2jG,EAAGtoH,KACtB6a,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAAC88B,EAAG9jH,KAAK,GAAI8jH,EAAG9jH,KAAK,KAC9D+jH,GAAS,GAEPD,EAAG7pF,WAAuB,MAAV6pF,EAAGttG,IACrB,OAAOstG,EAAG9jH,KAAK,GAIrB,GAAI+jH,EAAQ,OAAO,IAAI/8B,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACsoH,GACzD,CACA,GAAIxtG,EAAeD,IAASA,EAAK8J,WAAY,CAC3C,MAAM2jG,EAAKP,EAAcltG,EAAKrW,KAAK,GAAItE,GACvC,IAAI84E,EAAK+uC,EAAcltG,EAAKrW,KAAK,GAAItE,GAErC,GAAgB,MAAZ2a,EAAKG,GAAY,CACnB,GAAIL,EAAe2tG,IAAO/gG,EAAO+gG,EAAG5oH,OAClC,OAAOs5E,EAET,GAAIr+D,EAAeq+D,IAAOzxD,EAAOyxD,EAAGt5E,OAClC,OAAO4oH,EAELxtG,EAAek+D,IAAOA,EAAGv6C,WAAuB,MAAVu6C,EAAGh+D,KAC3Cg+D,EAAKA,EAAGx0E,KAAK,GACbqW,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAAC88B,EAAItvC,IAElD,CACA,GAAgB,MAAZn+D,EAAKG,GACP,OAAIF,EAAek+D,IAAOA,EAAGv6C,WAAuB,MAAVu6C,EAAGh+D,GACpC+sG,EACL,IAAIv8B,EAAa,IAAK,MAAO,CAAC88B,EAAItvC,EAAGx0E,KAAK,KAAMtE,GAEhDya,EAAe2tG,IAAO/gG,EAAO+gG,EAAG5oH,OAC3BqoH,EAAc,IAAIv8B,EAAa,IAAK,aAAc,CAACxS,KAExDr+D,EAAeq+D,IAAOzxD,EAAOyxD,EAAGt5E,OAC3B4oH,EAEF,IAAI98B,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACsoH,EAAItvC,IAEjD,GAAgB,MAAZn+D,EAAKG,GAAY,CACnB,GAAIL,EAAe2tG,GAAK,CACtB,GAAI/gG,EAAO+gG,EAAG5oH,OACZ,OAAOgoH,EACF,GAAIruE,EAAMivE,EAAG5oH,MAAO,GACzB,OAAOs5E,CAEX,CACA,GAAIr+D,EAAeq+D,GAAK,CACtB,GAAIzxD,EAAOyxD,EAAGt5E,OACZ,OAAOgoH,EACF,GAAIruE,EAAM2/B,EAAGt5E,MAAO,GACzB,OAAO4oH,EAET,GAAIhI,EAAczlG,EAAM4kE,GACtB,OAAO,IAAI+L,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACg5E,EAAIsvC,GAAKztG,EAAKumE,SAE7D,CACA,OAAO,IAAIoK,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACsoH,EAAItvC,GAAKn+D,EAAKumE,SAC3D,CACA,GAAgB,MAAZvmE,EAAKG,GACP,OAAIL,EAAe2tG,IAAO/gG,EAAO+gG,EAAG5oH,OAC3BgoH,EAEL/sG,EAAeq+D,IAAO3/B,EAAM2/B,EAAGt5E,MAAO,GACjC4oH,EAEF,IAAI98B,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACsoH,EAAItvC,IAEjD,GAAgB,MAAZn+D,EAAKG,IACHL,EAAeq+D,GAAK,CACtB,GAAIzxD,EAAOyxD,EAAGt5E,OACZ,OAAOioH,EACF,GAAItuE,EAAM2/B,EAAGt5E,MAAO,GACzB,OAAO4oH,CAEX,CAEF,GAAgB,QAAZztG,EAAKG,GAAc,CACrB,GAAIL,EAAe2tG,GAAK,CACtB,IAAIA,EAAG5oH,MAML,OAAOmoH,EALP,GAAIC,EAAgB9uC,GAAK,OAAOA,EAChC,GAAIr+D,EAAeq+D,GACjB,OAAOA,EAAGt5E,MAAQkoH,EAAQC,CAKhC,CACA,GAAIltG,EAAeq+D,GAAK,CACtB,IAAIA,EAAGt5E,MAGL,OAAOmoH,EAFP,GAAIC,EAAgBQ,GAAK,OAAOA,CAIpC,CACF,CACA,GAAgB,OAAZztG,EAAKG,GAAa,CACpB,GAAIL,EAAe2tG,GAAK,CACtB,GAAIA,EAAG5oH,MACL,OAAOkoH,EAEP,GAAIE,EAAgB9uC,GAAK,OAAOA,CAEpC,CACA,GAAIr+D,EAAeq+D,GAAK,CACtB,GAAIA,EAAGt5E,MACL,OAAOkoH,EAEP,GAAIE,EAAgBQ,GAAK,OAAOA,CAEpC,CACF,CACA,OAAO,IAAI98B,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CAACsoH,EAAItvC,GACjD,CACA,GAAIl+D,EAAeD,GACjB,OAAO,IAAI2wE,EACT3wE,EAAKG,GAAIH,EAAK7a,GAAI6a,EAAKrW,KAAK5C,KAAIiQ,GAAKk2G,EAAcl2G,EAAG3R,MAE1D,GAAIqa,EAAYM,GACd,OAAO,IAAI8kE,EAAU9kE,EAAK+kE,MAAMh+E,KAAIrF,GAAKwrH,EAAcxrH,EAAG2D,MAE5D,GAAIma,EAAeQ,GACjB,OAAO,IAAIwkE,EACT0oC,EAAcltG,EAAK5D,OAAQ/W,GAAU6nH,EAAcltG,EAAKxe,MAAO6D,IAEnE,GAAIib,EAAYN,GACd,OAAO,IAAI4uE,EACT5uE,EAAKwiB,WAAWz7B,KAAIrF,GAAKwrH,EAAcxrH,EAAG2D,MAE9C,GAAIkb,EAAaP,GAAO,CACtB,MAAMipG,EAAW,CAAC,EAClB,IAAK,MAAM3vG,KAAQ0G,EAAKkC,WACtB+mG,EAAS3vG,GAAQ4zG,EAAcltG,EAAKkC,WAAW5I,GAAOjU,GAExD,OAAO,IAAI6pF,EAAW+5B,EACxB,CAEA,OAAOjpG,CACT,CAEA,OAAO1c,EAAMV,GAAM,CAAEyhF,KAAM6oC,EAAe,cAAeA,GAAgB,ICnS9DS,GAAgC3wH,GAVhC,UACQ,CACnB,QACA,QACA,eACA,eACA,eACA,oBAGuE0D,IAOnE,IAPoE,MACxE4C,EAAK,MACLsX,EAAK,aACLwzE,EAAY,aACZsF,EAAY,aACZ/C,EAAY,gBACZkB,GACDnxF,EA2BC,SAASktH,EAAU5tG,EAAMgC,GAA2B,IAApB6rG,EAAM/tH,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,IAAIsI,IAG3C,IAAK4Z,EACH,OAAOhC,EAET,GAAIW,GAAaX,GAAO,CACtB,GAAI6tG,EAAOxpH,IAAI2b,EAAKpd,MAAO,CACzB,MAAMs3F,EAAYp3F,MAAMwF,KAAKulH,GAAQpoH,KAAK,MAC1C,MAAM,IAAIguF,eACR,iDAAiDyG,KAErD,CACA,MAAMr1F,EAAQmd,EAAMre,IAAIqc,EAAKpd,MAC7B,GAAI6c,EAAO5a,GAAQ,CACjB,MAAMipH,EAAa,IAAI1lH,IAAIylH,GAE3B,OADAC,EAAWvlH,IAAIyX,EAAKpd,MACbgrH,EAAS/oH,EAAOmd,EAAO8rG,EAChC,CAAO,MAAqB,iBAAVjpH,EACT+V,EAAM3Z,OAAO4D,SACDlE,IAAVkE,EACF,IAAIupF,EAAavpF,GAEjBmb,CAEX,CAAO,GAAIC,EAAeD,GAAO,CAC/B,MAAMrW,EAAOqW,EAAKrW,KAAK5C,KAAI,SAAUsG,GACnC,OAAOugH,EAASvgH,EAAK2U,EAAO6rG,EAC9B,IACA,OAAO,IAAIl9B,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAIwE,EAAMqW,EAAKumE,SACvD,CAAO,GAAI/lE,GAAkBR,GAC3B,OAAO,IAAI6xE,EAAgB+7B,EAAS5tG,EAAKqmE,QAASrkE,EAAO6rG,IACpD,GAAIxtG,EAAeL,GAAO,CAC/B,MAAMrW,EAAOqW,EAAKrW,KAAK5C,KAAI,SAAUsG,GACnC,OAAOugH,EAASvgH,EAAK2U,EAAO6rG,EAC9B,IACA,OAAO,IAAIn6B,EAAa1zE,EAAKpd,KAAM+G,EACrC,CAIA,OAAOqW,EAAKjZ,KAAIm4B,GAAS0uF,EAAS1uF,EAAOld,EAAO6rG,IAClD,CAEA,OAAOvqH,EAAM,UAAW,CACtB+gF,KAAMupC,EACN,+BAAgCA,EAChC,eAAgBG,CAACrsH,EAAGsgB,IAAU4rG,EAASlsH,EAAGkc,EAAUoE,IAIpD,iBAAkB1e,EAAM6L,aAAYH,GAAQkrB,GAAKA,EAAEnzB,KAAIrF,GAAKsN,EAAKtN,OACjE,mCAAoC4B,EAAM6L,aACxCH,GAAQkrB,GAAKA,EAAEnzB,KAAIrF,GAAKsN,EAAKtN,OAC/B,gBAAiB4B,EAAMgM,QACrB,aAAa0+G,GAAU,CAAC9zF,EAAGlY,IAAUgsG,EAAO9zF,EAAGtc,EAAUoE,MAC3D,iBAAkB1e,EAAMgM,QACtB,cAAcutC,GAAU,CAAC3iB,EAAGlY,IAAU66B,EAAO3iB,EAAGtc,EAAUoE,MAC5D,sBAAuB1e,EAAM6L,aAC3BH,GAAQ,CAACkrB,EAAGlY,IAAUkY,EAAEnzB,KAAIrF,GAAKsN,EAAKtN,EAAGsgB,QAC3C,ICzGEpf,GAAO,gBAQAqrH,GAAsCjxH,GAAQ4F,GAPtC,CACnB,QACA,WACA,QACA,iBAG6ElC,IAKzE,IAL0E,MAC9Eka,EAAK,SACL+nD,EAAQ,MACRr/D,EAAK,aACLqtF,GACDjwF,EAuCC,SAASwtH,EAAgBC,EAAIC,GAAkB,IAAd/oH,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC1C,MAAM88B,EAAO,IAAI+zD,EAAa,IAAK,WAAY,CAACw9B,EAAIC,IAC9CC,EAAa1rD,EAAS/lC,EAAM,CAAC,EAAGv3B,GACtC,OAAQya,EAAeuuG,KAAiBA,EAAWxpH,KACrD,CAEA,OAAOvB,EAAMV,GAAM,CACjB,aAAcsrH,EACd,qBAAsBA,GACtB,IC5DEtrH,GAAO,aAgBA0rH,GAAmCtxH,GAAQ4F,GAfnC,CACnB,QACA,SACA,QACA,WACA,QACA,SACA,UACA,eACA,eACA,eACA,kBACA,eAG0ElC,IAatE,IAbuE,MAC3E4C,EAAK,OACLyf,EAAM,MACNnI,EAAK,SACL+nD,EAAQ,MACRnkB,EAAK,OACL9xB,EAAM,QACN6lB,EAAO,aACP67C,EAAY,aACZsF,EAAY,aACZ/C,EAAY,gBACZkB,EAAe,WACfmB,GACDtyF,EAuCC,SAAS6tH,EAAiBhsC,EAAMisC,GAAwC,IAA9BnpH,EAAOvF,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAE6iE,UAAU,GAC9D,MAAMrD,EAAQ,IAAI36D,IACZ8pH,EAAeD,EAAS5rH,KAWxB01B,EAAMo2F,EAAYnsC,GAVxB,SAASosC,EAAe3uG,GACtB,MAAM4uG,EAAStvD,EAAM37D,IAAIqc,GACzB,QAAerf,IAAXiuH,EACF,OAAOA,EAET,MAAMt2F,EAAMu2F,EAASF,EAAe3uG,EAAMyuG,GAE1C,OADAnvD,EAAMh7D,IAAI0b,EAAMsY,GACTA,CACT,IAGA,OAAOjzB,EAAQs9D,SAAWA,EAASrqC,GAAOA,CAC5C,CAEA,SAASw2F,EAAiBhkF,GACxB,MAAM23C,EAAS7nE,EAAMkwB,GACrB,IAAK23C,EAAO9hE,aACV,MAAM,IAAI5c,UACR,kCAAgBqhC,KAAKjH,UAAU2M,6CAEnC,OAAO23C,CACT,CAEA,MAAM2lB,EAAa9kG,EAAMV,GAAM,CAC7B,mBAAoB2rH,EACpB,2BAA4BA,EAC5B,eAAgBQ,CAAC/uG,EAAMyiE,IAAW8rC,EAAgBvuG,EAAM8uG,EAAgBrsC,IACxE,uBAAwBusC,CAAChvG,EAAMyiE,EAAQp9E,IAAYkpH,EAAgBvuG,EAAM8uG,EAAgBrsC,GAASp9E,KAcpG+iG,EAAWke,WAAY,EAEvBle,EAAW5kB,MAAQ,SAAUyrC,GAC3B,OAAOC,EAAUrkH,MAAM,KAAMokH,EAAMtlH,KACrC,EAIA,MAAMulH,EAAY5rH,EAAM,YAAa,CACnC,mBAAoB,SAAUi/E,EAAM1kF,GAClC,OAAIiiB,EAAeyiE,IAAgC,WAAvB1hE,GAAO0hE,EAAK19E,OAC/BqqH,EAAUt0G,EAAM2nE,EAAK19E,OAAOoL,WAAYpS,EAAEoS,WAAY,GAEtDi/G,EAAU3sC,EAAKiB,QAAS3lF,EAAEoS,WAAY,EAEjD,EACA,qBAAsB,SAAUsyE,EAAM1kF,GACpC,GAAwB,WAApBgjB,GAAOhjB,EAAEgH,OACX,OAAOqqH,EAAU3sC,EAAM3nE,EAAM/c,EAAEgH,QAE/B,MAAM,IAAI6O,MAAM,gEAEpB,EACA,iCAAkC,SAAU6uE,EAAM1kF,EAAG09D,GACnD,OAAO2zD,EAAU3sC,EAAKtyE,WAAYpS,EAAE+E,KAAM24D,EAAM12D,MAClD,EACA,yBAA0B,SAAU09E,EAAM1kF,EAAG09D,GAC3C,IAAIr9D,EAMJ,OAJEA,EADY,IAAVq9D,EACE,aAAe19D,EAAI,IAEnB,OAAS09D,EAAQ,YAAc19D,EAAI,KAAO09D,EAAQ,KAEjDr9D,EAAI,UAAUqkF,WACvB,IAiBIssC,EAAWvrH,EAAM,WAAY,CACjC,iCAAkC,WAChC,OAAO,CACT,EAEA,+BAAgC,SAAU6rH,EAASnvG,EAAMovG,GAGvD,OAAOpvG,EAAKpd,OAASwsH,CACvB,EAEA,oCAAqC,SAAUD,EAASnvG,EAAMovG,GAC5D,OAAOD,EAAQnvG,EAAKqmE,QAAS+oC,EAC/B,EAEA,2CAA4C,SAAUD,EAASnvG,EAAMovG,GACnE,OAAKpvG,EAAKza,OAAO2a,SAASkvG,IAGnBD,EAAQnvG,EAAKuiE,KAAM6sC,EAC5B,EAEA,gDAAiD,SAAUD,EAASnvG,EAAMovG,GACxE,OAAOpvG,EAAKrW,KAAKgH,OAAMtD,GAAO8hH,EAAQ9hH,EAAK+hH,IAC7C,IAUIV,EAAcprH,EAAM,cAAe,CACvC,yBAA0B,WACxB,OAAO6qF,EAAmB,EAC5B,EAEA,uBAAwB,SAAUnuE,EAAMmvG,GACtC,OAAIA,EAAQnvG,GACHmuE,EAAmB,GAErBA,EAAmB,EAC5B,EAEA,4BAA6B,SAAUnuE,EAAMmvG,GAC3C,OAAO,IAAIt9B,EAAgB68B,EAAY1uG,EAAKqmE,QAAS8oC,GACvD,EAEA,mCAAoC,SAAUnvG,EAAMmvG,GAClD,OAAIA,EAAQnvG,GACHmuE,EAAmB,GAErBugC,EAAY1uG,EAAKuiE,KAAM4sC,EAChC,EAEA,yBAA0B,SAAUnvG,EAAMmvG,GACxC,GAAIA,EAAQnvG,GACV,OAAOmuE,EAAmB,GAG5B,MAAMl7E,EAAO+M,EAAKrW,KAAK,GACvB,IAAIuJ,EAKAm8G,EAuUAlvG,EAAIokB,EA1UJ1W,GAAM,EACNyhG,GAAW,EAGf,OAAQtvG,EAAKpd,MACX,IAAK,OAEHirB,GAAM,EACNwhG,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjDxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EACA,IAAI09E,EAAa,IAAK,SAAU,CAC9BxC,EAAmB,GACnBA,EAAmB,SAIzB,MACF,IAAK,OACL,IAAK,UAEH,GAAyB,IAArBnuE,EAAKrW,KAAKvL,OACZyvB,GAAM,EACNwhG,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjDxC,EAAmB,GACnB,IAAIuF,EAAa,OAAQ,CAACzgF,WAEvB,GAAyB,IAArB+M,EAAKrW,KAAKvL,OAOnB,OALA8U,EAAO,IAAIy9E,EAAa,IAAK,SAAU,CACrCxC,EAAmB,GACnBnuE,EAAKrW,KAAK,KAGL+kH,EAAY,IAAI/9B,EAAa,IAAK,MAAO,CAAC19E,EAAMC,IAAQi8G,GAEjE,MACF,IAAK,QACHj8G,EAAOi7E,EAAmB,IAE5B,IAAK,MACH,GAAKj7E,GAA6B,IAArB8M,EAAKrW,KAAKvL,QAIhB,GAA0B,IAArB4hB,EAAKrW,KAAKvL,QAAgB8U,GACZ,IAArB8M,EAAKrW,KAAKvL,QAAgB+wH,EAAQnvG,EAAKrW,KAAK,IAE/C0lH,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD19E,EAAK6N,QACL,IAAI4yE,EAAa,MAAO,CAACxgF,GAAQ8M,EAAKrW,KAAK,OAE7CkkB,GAAM,OACD,GAAyB,IAArB7N,EAAKrW,KAAKvL,OAEnB,OAAOswH,EAAY,IAAI/9B,EAAa,IAAK,SAAU,CACjD,IAAI+C,EAAa,MAAO,CAACzgF,IACzB,IAAIygF,EAAa,MAAO,CAAC1zE,EAAKrW,KAAK,OACjCwlH,QAfJE,EAAiBp8G,EAAK6N,QACtB+M,GAAM,EAgBR,MACF,IAAK,MACH,GAAyB,IAArB7N,EAAKrW,KAAKvL,OAEZ,OAAOswH,EAAY,IAAI/9B,EAAa,IAAK,MAAO,CAAC19E,EAAM+M,EAAKrW,KAAK,KAAMwlH,GAEzE,MACF,IAAK,MAEHE,EAAiB,IAAI37B,EAAa,MAAO,CAACzgF,EAAK6N,UAC/C,MACF,IAAK,MAEHuuG,EAAiB,IAAI37B,EAAa,MAAO,CAACzgF,EAAK6N,UAC/C,MACF,IAAK,MAEHuuG,EAAiB,IAAI1+B,EAAa,IAAK,aAAc,CACnD,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,YAEhC,MACF,IAAK,MAEHuuG,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9BqtE,EAAmB,KAErB,MACF,IAAK,MAEHkhC,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD3wE,EACA,IAAI0zE,EAAa,MAAO,CAACzgF,EAAK6N,YAEhC,MACF,IAAK,MAEHwuG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD3wE,EACA,IAAI0zE,EAAa,MAAO,CAACzgF,EAAK6N,YAEhC,MACF,IAAK,MAEHwuG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9BqtE,EAAmB,KAErB,MACF,IAAK,OAEHtgE,GAAM,EACNwhG,EAAiB,IAAI37B,EAAa,OAAQ,CACxC,IAAI/C,EAAa,IAAK,WAAY,CAChCxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,SAIzB,MACF,IAAK,OAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI37B,EAAa,OAAQ,CACxC,IAAI/C,EAAa,IAAK,WAAY,CAChCxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,SAIzB,MACF,IAAK,OAEHtgE,GAAM,EACNwhG,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,KAErB,MACF,IAAK,OAEHtgE,GAAM,EACNwhG,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9B,IAAI4yE,EAAa,OAAQ,CACvB,IAAI/C,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,OAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9B,IAAI4yE,EAAa,OAAQ,CACvB,IAAI/C,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,OAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,KAErB,MACF,IAAK,OAEHkhC,EAAiB,IAAI37B,EAAa,OAAQ,CAACzgF,EAAK6N,UAChD,MACF,IAAK,OAEHuuG,EAAiB,IAAI37B,EAAa,OAAQ,CAACzgF,EAAK6N,UAChD,MACF,IAAK,OAEHuuG,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAI+C,EAAa,OAAQ,CAACzgF,EAAK6N,UAC/BqtE,EAAmB,KAErB,MACF,IAAK,OAEHmhC,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD3wE,EACA,IAAI0zE,EAAa,OAAQ,CAACzgF,EAAK6N,YAEjC,MACF,IAAK,OAEHwuG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD3wE,EACA,IAAI0zE,EAAa,OAAQ,CAACzgF,EAAK6N,YAEjC,MACF,IAAK,OAEHwuG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,MAAO,CAC5C,IAAI+C,EAAa,OAAQ,CAACzgF,EAAK6N,UAC/BqtE,EAAmB,KAErB,MACF,IAAK,QAEHtgE,GAAM,EACNwhG,EAAiB,IAAI37B,EAAa,OAAQ,CACxC,IAAI/C,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,OAGvB,MACF,IAAK,QAEHtgE,GAAM,EACNwhG,EAAiB,IAAI37B,EAAa,OAAQ,CACxC,IAAI/C,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,OAGvB,MACF,IAAK,QAEHtgE,GAAM,EACNwhG,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjDxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,OAGvB,MACF,IAAK,QAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD19E,EAAK6N,QACL,IAAI4yE,EAAa,OAAQ,CACvB,IAAI/C,EAAa,IAAK,WAAY,CAChCxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,WAK3B,MACF,IAAK,QAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjD,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9B,IAAI4yE,EAAa,OAAQ,CACvB,IAAI/C,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,KAErBA,EAAmB,SAIzB,MACF,IAAK,QAEHtgE,GAAM,EACNyhG,GAAW,EACXD,EAAiB,IAAI1+B,EAAa,IAAK,WAAY,CACjDxC,EAAmB,GACnB,IAAIwC,EAAa,IAAK,MAAO,CAC3B19E,EAAK6N,QACLqtE,EAAmB,OAGvB,MACF,IAAK,MAEHkhC,EAAiB,IAAI1+B,EAAa,IAAK,SAAU,CAC/C,IAAI+C,EAAa,IAAIV,EAAW,OAAQ,CAAC//E,EAAK6N,UAC9C7N,EAAK6N,UAEP,MAEF,QACE,MAAM,IAAIpN,MAAM,4BAA8BsM,EAAKpd,KAAnC,wHAKhBirB,GACF1N,EAAK,IACLokB,EAAO,WAEPpkB,EAAK,IACLokB,EAAO,YAMT,IAAIgrF,EAAkBb,EAAYz7G,EAAMk8G,GAIxC,OAHIG,IACFC,EAAkB,IAAI5+B,EAAa,IAAK,aAAc,CAAC4+B,KAElD,IAAI5+B,EAAaxwE,EAAIokB,EAAM,CAACgrF,EAAiBF,GACtD,EAEA,yBAA0B,SAAUrvG,EAAMmvG,GACxC,GAAIA,EAAQnvG,GACV,OAAOmuE,EAAmB,GAG5B,GAAgB,MAAZnuE,EAAKG,GAEP,OAAO,IAAIwwE,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI6a,EAAKrW,KAAK5C,KAAI,SAAUsG,GAChE,OAAOqhH,EAAYrhH,EAAK8hH,EAC1B,KAGF,GAAgB,MAAZnvG,EAAKG,GAAY,CAEnB,GAAIH,EAAK4jB,UACP,OAAO,IAAI+sD,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CACxCupH,EAAY1uG,EAAKrW,KAAK,GAAIwlH,KAK9B,GAAInvG,EAAK8J,WACP,OAAO,IAAI6mE,EAAa3wE,EAAKG,GAAIH,EAAK7a,GAAI,CACxCupH,EAAY1uG,EAAKrW,KAAK,GAAIwlH,GAC1BT,EAAY1uG,EAAKrW,KAAK,GAAIwlH,IAGhC,CAEA,GAAgB,MAAZnvG,EAAKG,GAAY,CAEnB,MAAMqvG,EAAgBxvG,EAAKrW,KAAK5E,QAAO,SAAUsI,GAC/C,OAAO8hH,EAAQ9hH,EACjB,IAEA,GAAImiH,EAAcpxH,OAAS,EAAG,CAC5B,MAAMqxH,EAAmBzvG,EAAKrW,KAAK5E,QAAO,SAAUsI,GAClD,OAAQ8hH,EAAQ9hH,EAClB,IAEMqiH,EAA8C,IAA5BD,EAAiBrxH,OACrCqxH,EAAiB,GACjB,IAAI9+B,EAAa,IAAK,WAAY8+B,GAEhC9G,EAAU6G,EAAc/qH,OAAOiqH,EAAYgB,EAAiBP,IAElE,OAAO,IAAIx+B,EAAa,IAAK,WAAYg4B,EAC3C,CAGA,OAAO,IAAIh4B,EAAa,IAAK,MAAO3wE,EAAKrW,KAAK5C,KAAI,SAAU4oH,GAC1D,OAAO,IAAIh/B,EAAa,IAAK,WAAY3wE,EAAKrW,KAAK5C,KAAI,SAAU6oH,GAC/D,OAAQA,IAAaD,EACjBjB,EAAYkB,EAAUT,GACtBS,EAAS9uG,OACf,IACF,IACF,CAEA,GAAgB,MAAZd,EAAKG,IAAcH,EAAK8J,WAAY,CACtC,MAAM7W,EAAO+M,EAAKrW,KAAK,GACjBuJ,EAAO8M,EAAKrW,KAAK,GAGvB,OAAIwlH,EAAQj8G,GACH,IAAIy9E,EAAa,IAAK,SAAU,CAAC+9B,EAAYz7G,EAAMk8G,GAAUj8G,IAIlEi8G,EAAQl8G,GACH,IAAI09E,EAAa,IAAK,WAAY,CACvC,IAAIA,EAAa,IAAK,aAAc,CAAC19E,IACrC,IAAI09E,EAAa,IAAK,SAAU,CAC9B+9B,EAAYx7G,EAAMi8G,GAClB,IAAIx+B,EAAa,IAAK,MAAO,CAACz9E,EAAK4N,QAASqtE,EAAmB,SAM9D,IAAIwC,EAAa,IAAK,SAAU,CACrC,IAAIA,EAAa,IAAK,WAAY,CAChC,IAAIA,EAAa,IAAK,WAAY,CAAC+9B,EAAYz7G,EAAMk8G,GAAUj8G,EAAK4N,UACpE,IAAI6vE,EAAa,IAAK,WAAY,CAAC19E,EAAK6N,QAAS4tG,EAAYx7G,EAAMi8G,OAErE,IAAIx+B,EAAa,IAAK,MAAO,CAACz9E,EAAK4N,QAASqtE,EAAmB,MAEnE,CAEA,GAAgB,MAAZnuE,EAAKG,IAAcH,EAAK8J,WAAY,CACtC,MAAM7W,EAAO+M,EAAKrW,KAAK,GACjBuJ,EAAO8M,EAAKrW,KAAK,GAEvB,GAAIwlH,EAAQl8G,GAEV,OAAI6M,EAAe7M,KAAUyZ,EAAOzZ,EAAKpO,QAAU25C,EAAMvrC,EAAKpO,MAAO,IAC5DspF,EAAmB,GAIrB,IAAIwC,EAAa,IAAK,WAAY,CACvC3wE,EACA,IAAI2wE,EAAa,IAAK,WAAY,CAChC,IAAI+C,EAAa,MAAO,CAACzgF,EAAK6N,UAC9B4tG,EAAYx7G,EAAK4N,QAASquG,OAKhC,GAAIA,EAAQj8G,GAAO,CACjB,GAAI4M,EAAe5M,GAAO,CAExB,GAAIwZ,EAAOxZ,EAAKrO,OACd,OAAOspF,EAAmB,GAG5B,GAAI3vC,EAAMtrC,EAAKrO,MAAO,GACpB,OAAO6pH,EAAYz7G,EAAMk8G,EAE7B,CAGA,MAAMU,EAAc,IAAIl/B,EAAa,IAAK,MAAO,CAC/C19E,EAAK6N,QACL,IAAI6vE,EAAa,IAAK,WAAY,CAChCz9E,EACAi7E,EAAmB,OAIvB,OAAO,IAAIwC,EAAa,IAAK,WAAY,CACvCz9E,EAAK4N,QACL,IAAI6vE,EAAa,IAAK,WAAY,CAChC+9B,EAAYz7G,EAAMk8G,GAClBU,KAGN,CAGA,OAAO,IAAIl/B,EAAa,IAAK,WAAY,CACvC,IAAIA,EAAa,IAAK,MAAO,CAAC19E,EAAK6N,QAAS5N,EAAK4N,UACjD,IAAI6vE,EAAa,IAAK,MAAO,CAC3B,IAAIA,EAAa,IAAK,WAAY,CAChC+9B,EAAYz7G,EAAMk8G,GAClB,IAAIx+B,EAAa,IAAK,SAAU,CAACz9E,EAAK4N,QAAS7N,EAAK6N,YAEtD,IAAI6vE,EAAa,IAAK,WAAY,CAChC+9B,EAAYx7G,EAAMi8G,GAClB,IAAIz7B,EAAa,MAAO,CAACzgF,EAAK6N,eAItC,CAEA,MAAM,IAAIpN,MAAM,4BAA8BsM,EAAKG,GAAnC,uHAElB,IAUF,SAASguE,EAAoBtpF,EAAO0lC,GAClC,OAAO,IAAI6jD,EAAa77C,EAAQ1tC,EAAO0lC,GAAa1nB,GAAe5hB,OAAO4D,GAAQke,IACpF,CAEA,OAAOqlF,CAAU,IC7uBbxlG,GAAO,cA8BAktH,GAAoC9yH,GAAQ4F,GA7BpC,CACnB,SACA,QACA,QACA,SACA,MACA,WACA,WACA,SACA,MACA,QACA,mBACA,eACA,WACA,aACA,YACA,oBACA,SACA,eACA,YACA,eACA,eACA,YACA,aACA,eACA,aACA,oBAG2ElC,IA2BvE,IA3BwE,OAC5EqiB,EAAM,MACNzf,EAAK,MACLk7C,EAAK,OACL9xB,EAAM,IACNnkB,EAAG,SACHqrB,EAAQ,SACR0hB,EAAQ,OACR9nB,EAAM,IACNjW,EAAG,MACHqD,EAAK,iBACL6tF,EAAgB,aAChBC,EAAY,SACZ/lC,EAAQ,SACR1kC,EAAQ,UACR8pB,EAAS,kBACTq6B,EAAiB,OACjBr6D,EAAM,aACNy8D,EAAY,UACZM,EAAS,aACTsJ,EAAY,aACZsF,EAAY,UACZ9E,EAAS,WACTM,EAAU,aACVyB,EAAY,WACZqC,EAAU,gBACVnB,GACDnxF,EAsDC,SAASqvH,EAAcxtC,GAAoC,IAA9BvgE,EAAKliB,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG,CAAC,EAAGkwH,EAAQlwH,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,IAAAA,UAAA,GAC/C,MAAMmwH,EA2KR,WACE,MAAMC,EAAW,CAACxnB,EAChB,CAAE3kD,EAAG,MAAO3qC,EAAG,OACf,CAAE2qC,EAAG,OAAQ3qC,EAAG,KAChBqvF,EACA,CAAE1kD,EAAG,YAAa3qC,EAAG,QACrB,CAAE2qC,EAAG,WAAY3qC,EAAG,WACpB,CAAE2qC,EAAG,QAAS3qC,EAAG,QACjB,CAAE2qC,EAAG,YAAa3qC,EAAG,aACrB,CAAE2qC,EAAG,MAAO3qC,EAAG,MAEX+2G,EAAa,CACjB,CAAEpsE,EAAG,cAAe3qC,EAAG,SACvB,CAAE2qC,EAAG,cAAe3qC,EAAG,SACvB,CAAE2qC,EAAG,SAAU3qC,EAAG,SAClB,CAAE2qC,EAAG,QAAS3qC,EAAG,YACjB,CAAE2qC,EAAG,aAAc3qC,EAAG,mBACtB,CAAE2qC,EAAG,aAAc3qC,EAAG,iBACtB,CAAE2qC,EAAG,cAAe3qC,EAAG,aACvB,CAAE2qC,EAAG,WAAY3qC,EAAG,YACpB,CAAE2qC,EAAG,cAAe3qC,EAAG,aACvB,CAAE2qC,EAAG,WAAY3qC,EAAG,YACpB,CAAE2qC,EAAG,MAAO3qC,EAAG,WACf,CAAE2qC,EAAG,OAAQ3qC,EAAG,YAChB,CAAE2qC,EAAG,QAAS3qC,EAAG,OACjB,CAAE2qC,EAAG,OAAQ3qC,EAAG,QAChB,CAAE2qC,EAAG,OAAQ3qC,EAAG,QAChB,CAAE2qC,EAAG,MAAO3qC,EAAG,OACf,CAAE2qC,EAAG,YAAa3qC,EAAG,WACrB,CAAE2qC,EAAG,WAAY3qC,EAAG,YACpB,CAAE2qC,EAAG,YAAa3qC,EAAG,WACrB,CAAE2qC,EAAG,WAAY3qC,EAAG,YACpB,CAAE2qC,EAAG,aAAc3qC,EAAG,gBACtB,CAAE2qC,EAAG,YAAa3qC,EAAG,WACrB,CAAE2qC,EAAG,WAAY3qC,EAAG,aAOhBg3G,EAAc,CAClB,CAAErsE,EAAG,eAAgB3qC,EAAG,gBACxB,CAAE2qC,EAAG,aAAc3qC,EAAG,iBAElB62G,EAAW,CAAC,EAqClB,OAhCAA,EAASI,WAAaH,EAASzrH,OAAO0rH,EAAYC,GAClDH,EAASK,cAfa,CACpB,CAAEvsE,EAAG,kBAAmB3qC,EAAG,6BAC3B,CAAE2qC,EAAG,eAAgB3qC,EAAG,qBACxB,CAAE2qC,EAAG,eAAgB3qC,EAAG,sBAa1B62G,EAASM,YAAcH,EACvBH,EAASO,gBAAkBN,EAASzrH,OAAO0rH,GAM3CF,EAASQ,WAAa,CAAC/nB,EACrB,CAAE3kD,EAAG,OAAQ3qC,EAAG,QAChB,CAAE2qC,EAAG,MAAO3qC,EAAG,OACfqvF,EACA,CAAE1kD,EAAG,UAAW3qC,EAAG,aACnB,CAAE2qC,EAAG,SAAU3qC,EAAG,YAClB,CAAE2qC,EAAG,aAAc3qC,EAAG,cACtB,CAAE2qC,EAAG,YAAa3qC,EAAG,aACrB,CAAE2qC,EAAG,UAAW3qC,EAAG,aACnB,CAAE2qC,EAAG,SAAU3qC,EAAG,YAClB,CAAE2qC,EAAG,UAAW3qC,EAAG,aACnB,CAAE2qC,EAAG,SAAU3qC,EAAG,YAClB,CAAE2qC,EAAG,UAAW3qC,EAAG,aACnB,CAAE2qC,EAAG,SAAU3qC,EAAG,YAClB,CAAE2qC,EAAG,aAAc3qC,EAAG,aACtB,CAAE2qC,EAAG,YAAa3qC,EAAG,aACrB,CAAE2qC,EAAG,cAAe3qC,EAAG,YACvB,CAAE2qC,EAAG,SAAU3qC,EAAG,QAClB,CAAE2qC,EAAG,SAAU3qC,EAAG,SAClB,CAAE2qC,EAAG,MAAO3qC,EAAG,OACf,CAAE2qC,EAAG,aAAc3qC,EAAG,iBAGjB62G,CACT,CA9PmBS,GACXC,EA+FR,SAAqBpuC,EAAMvgE,EAAO4uG,EAAUtJ,GAC1C,MAAMptB,EAAY,GACZl6E,EAAO2iD,EAAS4f,EAAM+kC,EAAOtlG,EAAO,CAAE2pG,gBAAgB,IAGtDkF,EAAO,QAFbD,IAAaA,GAEoB,IAAM,KAwBvC,SAASE,EAAS9wG,GAChB,MAAM+wG,EAAK/wG,EAAKtc,KAChB,GAAW,iBAAPqtH,EAEF,MAAM,IAAIr9G,MAAM,sCACX,GAAW,iBAAPq9G,EACT,GAAgB,MAAZ/wG,EAAKG,GAAY,CAEnB,GAA0B,iBAAtBH,EAAKrW,KAAK,GAAGjG,OAA4Bgf,GAAU1H,WAAWgF,EAAKrW,KAAK,GAAG9E,QAC7E,MAAM,IAAI6O,MAAM,mCAEhBo9G,EAAQ9wG,EAAKrW,KAAK,GAEtB,KAAO,CACL,IAAKknH,EAAK3wG,SAASF,EAAKG,IACtB,MAAM,IAAIzM,MAAM,YAAcsM,EAAKG,GAAK,qCAE1C,IAAK,IAAIhhB,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IACpC2xH,EAAQ9wG,EAAKrW,KAAKxK,GAEtB,MACK,GAAW,eAAP4xH,EAAqB,CAC9B,MAAMnuH,EAAOod,EAAKpd,MAEL,IADDs3F,EAAU/yF,QAAQvE,IAG5Bs3F,EAAU76F,KAAKuD,EAEnB,MAAO,GAAW,oBAAPmuH,EACTD,EAAQ9wG,EAAKqmE,cACR,GAAW,iBAAP0qC,EACT,MAAM,IAAIr9G,MAAM,QAAUq9G,EAAK,2CAEnC,CAxDAD,CAAQ9wG,GACR,MAAMgxG,EAAU,CAAC,EAGjB,OAFAA,EAAQ38B,WAAar0E,EACrBgxG,EAAQ92B,UAAYA,EACb82B,CAqDT,CA9JkBC,CAAW1uC,EAAMvgE,GAAO,EAAMiuG,EAASI,YACjDa,EAAQP,EAAQz2B,UAAU97F,OAC1B+yH,EAAmB,CAAExF,gBAAgB,GACrCyF,EAAqB,CAAEzF,gBAAgB,GAG7C,GAFAppC,EAAOouC,EAAQt8B,WAEX68B,GAAS,EAAG,CAEd,IAAIG,EACA/J,EAFJ/kC,EAAO+uC,EAAY/uC,GAGnB,IAIIj7E,EAJAiqH,GAAY,EACZC,GAAW,EAIf,IAFAjvC,EAAO5f,EAAS4f,EAAM0tC,EAASI,WAAY,CAAC,EAAGc,GAK7C7J,EAAQiK,EAAYtB,EAASK,cAAgBL,EAASM,YAEtDgB,GAAaA,EAEbjqH,GAHAi7E,EAAO5f,EAAS4f,EAAM+kC,EAAO,CAAC,EAAG8J,IAGxBnhH,WACL3I,IAAM+pH,GAIVG,GAAW,EACXH,EAAU/pH,EAGRkqH,IACFjvC,EAAO5f,EAAS4f,EAAM0tC,EAASO,gBAAiB,CAAC,EAAGW,IAGtD5uC,EAAO5f,EAAS4f,EAAM0tC,EAASQ,WAAY,CAAC,EAAGU,EACjD,CAEA,MAAMrsG,EAAe,GACf2sG,EAAiB,CAAC,EAsBxB,MApBkB,iBAAdlvC,EAAK7+E,MAA2B6+E,EAAKz4D,YAA0B,MAAZy4D,EAAKpiE,IAC5C,IAAV+wG,IACF3uC,EAAK54E,KAAK,GAAK+nH,EAAgBnvC,EAAK54E,KAAK,GAAImb,GAC7Cy9D,EAAK54E,KAAK,GAAK+nH,EAAgBnvC,EAAK54E,KAAK,KAEvCqmH,IACFyB,EAAen8F,UAAYitD,EAAK54E,KAAK,GACrC8nH,EAAehhG,YAAc8xD,EAAK54E,KAAK,MAG3B,IAAVunH,IACF3uC,EAAOmvC,EAAgBnvC,EAAMz9D,IAE3BkrG,IACFyB,EAAen8F,UAAYitD,EAC3BkvC,EAAehhG,YAAc,OAK5Bu/F,GACLyB,EAAe3sG,aAAeA,EAC9B2sG,EAAev3B,UAAYy2B,EAAQz2B,UACnCu3B,EAAep9B,WAAa9R,EACrBkvC,GAJelvC,CAKxB,CAEA,OAAOj/E,EAAMV,GAAM,CACjByhF,KAAM0rC,EACN,gBAAiB4B,CAACpvC,EAAMytC,IAAaD,EAAaxtC,EAAM,CAAC,EAAGytC,GAC5D,eAAgBD,EAChB,wBAAyBA,IAuM3B,SAASuB,EAAatxG,EAAMo9C,EAAQw0D,GAClC,MAAMb,EAAK/wG,EAAKtc,KACVmuH,EAAY/xH,UAAU1B,OAAS,EAErC,GAAW,iBAAP2yH,GAAyB/wG,EAAK8J,WAAY,CAC5C,IACIif,EADA+oF,GAAO,EAWX,GATgB,MAAZ9xG,EAAKG,KACoB,oBAAtBH,EAAKrW,KAAK,GAAGjG,MACQ,iBAAtBsc,EAAKrW,KAAK,GAAGjG,MACU,iBAAtBsc,EAAKrW,KAAK,GAAGjG,OAChBqlC,EAAM/tB,WAAWgF,EAAKrW,KAAK,GAAG9E,OAC9BitH,EAAQ/oF,GAAO,GAAKrmB,GAAUqmB,KAI9B+oF,EAAM,CAMR,GAAI/oF,EAAM,EAAG,CAQX,MAAMgpF,EAAW/xG,EAAKrW,KAAK,GACrBqoH,EAAW,IAAIrhC,EAAa,IAAK,MAAO,CAAC3wE,EAAKrW,KAAK,GAAGu5E,YAAa,IAAIkL,EAAarlD,EAAM,KAChG/oB,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAACohC,EAAUC,GACtD,MAMEhyG,EAAO,IAAI2wE,EAAa,IAAK,WAAY,CAAC3wE,EAAKrW,KAAK,GAAIqW,EAAKrW,KAAK,GAAGu5E,cAGnE2uC,IAEgB,YAAdD,EAA2Bx0D,EAAOipB,QAAUrmE,EAAco9C,EAAOzzD,KAAKioH,GAAa5xG,EAE3F,CACF,CAEA,GAAW,oBAAP+wG,EAEFO,EAAYtxG,EAAKqmE,QAASrmE,EAAM,gBAC3B,GAAW,iBAAP+wG,GAAgC,eAAPA,EAClC,IAAK,IAAI5xH,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IACpCmyH,EAAYtxG,EAAKrW,KAAKxK,GAAI6gB,EAAM7gB,GAIpC,IAAK0yH,EAEH,OAAO7xG,CAEX,CAyBA,SAAS0xG,EAAiB1xG,EAAM8E,QACTnkB,IAAjBmkB,IAA8BA,EAAe,IAEjDA,EAAa,GAAK,EASlB,IAAImtG,EAAU,EACVC,EAAU,IA2Cd,SAASC,EAAUnyG,EAAMoyG,EAAOx2G,GAC9B,MAAMm1G,EAAK/wG,EAAKtc,KAChB,GAAW,iBAAPqtH,EAGF,MAAM,IAAIr9G,MAAM,sCACX,GAAW,iBAAPq9G,EAAuB,CAEhC,IAAK,OAAO7wG,SAASF,EAAKG,IAAK,MAAM,IAAIzM,MAAM,YAAcsM,EAAKG,GAAK,YAEvE,GAAc,OAAViyG,EAAgB,CAElB,IAAiB,eAAZpyG,EAAK7a,IAAmC,QAAZ6a,EAAK7a,KAA8B,QAAbitH,EAAMjtH,IAC1B,aAAbitH,EAAMjtH,IAAkC,aAAbitH,EAAMjtH,GAAqB,MAAM,IAAIuO,MAAM,WAAasM,EAAKG,GAAK,YAGnH,IAAiB,aAAZH,EAAK7a,IAAiC,QAAZ6a,EAAK7a,IAA4B,aAAZ6a,EAAK7a,KACxC,QAAbitH,EAAMjtH,IAA6B,aAAbitH,EAAMjtH,GAAqB,MAAM,IAAIuO,MAAM,WAAasM,EAAKG,GAAK,YAG5F,IAAiB,aAAZH,EAAK7a,IAAiC,QAAZ6a,EAAK7a,IACtB,eAAZ6a,EAAK7a,KAAoC,IAAZyW,EAAEy2G,MAAe,MAAM,IAAI3+G,MAAM,WAAasM,EAAKG,GAAK,WACzF,CAGgB,MAAZH,EAAKG,IAA0B,MAAZH,EAAKG,KAC1BvE,EAAE02G,KAAOtyG,EAAKG,IAGhB,IAAK,IAAIhhB,EAAI,EAAGA,EAAI6gB,EAAKrW,KAAKvL,OAAQe,IAEpB,eAAZ6gB,EAAK7a,KAAqByW,EAAEi1G,KAAO,KACvB,MAAZ7wG,EAAKG,IAA0B,aAAZH,EAAK7a,KAC1ByW,EAAE02G,KAAO,GACT12G,EAAE22G,IAAM,EACR32G,EAAEi1G,KAAc,IAAN1xH,EAAU,IAAM6gB,EAAKG,IAEjCvE,EAAEy2G,MAAQlzH,EACVgzH,EAASnyG,EAAKrW,KAAKxK,GAAI6gB,EAAMpE,EAEjC,MAAO,GAAW,eAAPm1G,EAAqB,CAC9B,GAAI/wG,EAAKpd,OAASsvH,GAAuB,KAAZA,EAAkB,MAAM,IAAIx+G,MAAM,mCAE/D,GADAw+G,EAAUlyG,EAAKpd,KACD,OAAVwvH,EAEF,YADAttG,EAAa,GAAK,GAKpB,GAAiB,MAAbstG,EAAMjyG,IAA0B,IAAZvE,EAAEy2G,MAAe,MAAM,IAAI3+G,MAAM,uDAGzD,GAAiB,MAAb0+G,EAAMjyG,IAA0B,IAAZvE,EAAEy2G,MAAe,MAAM,IAAI3+G,MAAM,2DAG1C,KAAXkI,EAAE02G,MAA0B,MAAX12G,EAAE02G,OACjBL,EAAU,IAAGntG,EAAa,GAAK,GACnCA,EAAa,IAAMlJ,EAAE22G,KAAkB,MAAX32G,EAAEi1G,KAAe,GAAK,GAClDoB,EAAUtnH,KAAKI,IAAI,EAAGknH,GAE1B,KAAO,IAAW,iBAAPlB,EAsBF,MAAM,IAAIr9G,MAAM,QAAUq9G,EAAK,mBAtBN,CAChC,MAAMyB,EAAQx3G,WAAWgF,EAAKnb,OAC9B,GAAc,OAAVutH,EAEF,YADAttG,EAAa,GAAK0tG,GAGpB,GAAiB,MAAbJ,EAAMjyG,GAAY,CAEpB,GAAgB,IAAZvE,EAAEy2G,MAAa,MAAM,IAAI3+G,MAAM,8BAEnC,IAAKgP,GAAU8vG,IAAUA,GAAS,EAAK,MAAM,IAAI9+G,MAAM,uCAEvD,IAAK,IAAIvU,EAAI8yH,EAAU,EAAG9yH,EAAIqzH,EAAOrzH,IAAK2lB,EAAa3lB,GAAK,EAI5D,OAHIqzH,EAAQP,IAASntG,EAAa0tG,GAAS,GAC3C1tG,EAAa0tG,IAAU52G,EAAE22G,KAAkB,MAAX32G,EAAEi1G,KAAe,GAAK,QACtDoB,EAAUtnH,KAAKI,IAAIynH,EAAOP,GAE5B,CACAr2G,EAAE22G,IAAMC,EAGO,KAAX52G,EAAE02G,OAAextG,EAAa,IAAMlJ,EAAE22G,KAAkB,MAAX32G,EAAEi1G,KAAe,GAAK,GACzE,CAA2D,CAC7D,CA5HAsB,CAASnyG,EAAM,KAXL,CACVpE,IAAQ,EACRA,KAAS,IAITA,KAAS,KAMTq2G,EAAUntG,EAAa1mB,OAAS,EAChC,IACIq0H,EADAxsG,GAAQ,EAGZ,IAAK,IAAI9mB,EAAI8yH,EAAS9yH,GAAK,EAAGA,IAAK,CACjC,GAAwB,IAApB2lB,EAAa3lB,GAAU,SAC3B,IAAIwzB,EAAK,IAAIy7D,EACXnoE,EAAQnB,EAAa3lB,GAAKwL,KAAKsa,IAAIH,EAAa3lB,KAClD,MAAMghB,EAAK2E,EAAa3lB,GAAK,EAAI,IAAM,IAEvC,GAAIA,EAAI,EAAG,CACT,IAAI0xC,EAAK,IAAImiD,EAAWk/B,GACxB,GAAI/yH,EAAI,EAAG,CACT,MAAMuzH,EAAK,IAAItkC,EAAajvF,GAC5B0xC,EAAK,IAAI8/C,EAAa,IAAK,MAAO,CAAC9/C,EAAI6hF,GACzC,CACuC//F,GAAd,IAArB7N,EAAa3lB,IAAa8mB,EAAc,IAAI0qE,EAAa,IAAK,aAAc,CAAC9/C,IAA8C,IAA9BlmC,KAAKsa,IAAIH,EAAa3lB,IAAkB0xC,EAAiB,IAAI8/C,EAAa,IAAK,WAAY,CAACh+D,EAAIke,GACnM,CAEa4hF,EAATxsG,EAAc0M,EAAqB,MAAPxS,EAAmB,IAAIwwE,EAAa,IAAK,MAAO,CAAC8hC,EAAI9/F,IAAmB,IAAIg+D,EAAa,IAAK,WAAY,CAAC8hC,EAAI9/F,IAE/I1M,GAAQ,CACV,CAEA,OAAIA,EAAgB,IAAImoE,EAAa,GAAmBqkC,CAoG1D,KCpmBI7vH,GAAO,SAUA+vH,GAA+B31H,GAAQ4F,GAR/B,CACnB,QACA,MACA,WACA,UACA,WAGsElC,IAA+C,IAA9C,MAAE4C,EAAK,IAAEiF,EAAG,SAAE+sC,EAAQ,QAAEjuB,EAAO,OAAErE,GAAQtiB,EAmBhH,OAAO4C,EAAMV,GAAM,CACjB,qBAAsB,SAAU7E,EAAGiJ,EAAG7I,GACpC,OAAOy0H,EAAQ70H,EAAGiJ,EAAG7I,EACvB,EACA,cAAe,SAAUJ,EAAGiJ,GAC1B,OAAO4rH,EAAQ70H,EAAGiJ,EAAG,EACvB,EACA,uBAAwB,SAAUjJ,EAAGiJ,EAAG7I,GACtC,OAAOy0H,EAAQ70H,EAAE8e,UAAW7V,EAAE6V,UAAW1e,EAC3C,EACA,gBAAiB,SAAUJ,EAAGiJ,GAC5B,OAAO4rH,EAAQ70H,EAAE8e,UAAW7V,EAAE6V,UAAW,EAC3C,IAGF,SAAS+1G,EAAS70H,EAAGiJ,EAAG7I,GAElBJ,EAAE6I,MAAMm+D,GAAmB,cAAZA,EAAGrhE,SACpB3F,EAAIA,EAAEgJ,KAAKg+D,GAAO/hD,EAAO+hD,MAGvB/9D,EAAEJ,MAAMm+D,GAAmB,cAAZA,EAAGrhE,SACpBsD,EAAIA,EAAED,KAAKg+D,GAAO/hD,EAAO+hD,MAE3B,IAAIp0C,EAAM,CAACtJ,EAAQ,EAAG,IAClB+wF,EAAM,CAAC/wF,EAAQ,EAAG,IACtB,IAAK,IAAIloB,EAAI,EAAGA,EAAIpB,EAAEK,OAAQe,IAAK,CACjC,IAAI4sC,EAAOhuC,EAAEoB,GACO,iBAAT4sC,IAAmBA,EAAO1kB,EAAQ0kB,EAAM,IACnDpb,EAAMkiG,EAAUliG,EAAK,CAACtJ,EAAQ,EAAG,GAAIA,GAAS0kB,EAAK9xB,IAAK8xB,EAAK9T,KAC/D,CACA,IAAK,IAAI94B,EAAI,EAAGA,EAAI6H,EAAE5I,OAAQe,IAAK,CACjC,IAAI2zH,EAAO9rH,EAAE7H,GACO,iBAAT2zH,IAAmBA,EAAOzrG,EAAQyrG,EAAM,IACnD1a,EAAMya,EAAUza,EAAK,CAAC/wF,EAAQ,EAAG,GAAIA,GAASyrG,EAAK74G,IAAK64G,EAAK76F,KAC/D,CACA,IAAK,IAAI94B,EAAI,EAAGA,EAAIwxB,EAAIvyB,OAAQe,IAC9BwxB,EAAIxxB,GAAKm2C,EAAS3kB,EAAIxxB,GAAIhB,GAE5B,MAAO,CAACwyB,EAAKynF,EACf,CAEA,SAASya,EAAW77G,EAAGD,GACrB,MAAMhV,EAAI,GACV,IAAK,IAAI5C,EAAI,EAAGA,EAAI6X,EAAE5Y,OAAS2Y,EAAE3Y,OAAS,EAAGe,IAAK,CAChD4C,EAAE5C,GAAKkoB,EAAQ,EAAG,GAClB,IAAK,IAAIjoB,EAAI,EAAGA,EAAI4X,EAAE5Y,OAAQgB,IACxBD,EAAIC,GAAK,GAAKD,EAAIC,EAAI2X,EAAE3Y,SAC1B2D,EAAE5C,GAAKoJ,EAAIxG,EAAE5C,GAAIm2C,EAASt+B,EAAE5X,GAAI2X,EAAE5X,EAAIC,KAG5C,CACA,OAAO2C,CACT,KClFIa,GAAO,QAWAmwH,GAA8B/1H,GAAQ4F,GAT9B,CACnB,QACA,MACA,WACA,UACA,SACA,WAGqElC,IAAuD,IAAtD,MAAE4C,EAAK,IAAEiF,EAAG,SAAE+sC,EAAQ,QAAEjuB,EAAO,OAAEmG,EAAM,OAAEzF,GAAQrnB,EAsBvH,OAAO4C,EAAMV,GAAM,CACjB,eAAgB,SAAUmU,EAAGC,GAE3B,OAAOg8G,EAAOj8G,EAAGC,EADPi8G,EAAW,KAEvB,EACA,sBAAuB,SAAUl8G,EAAGC,EAAGhZ,GACrC,OAAOg1H,EAAOj8G,EAAGC,EAAGhZ,EACtB,EACA,uBAAwB,SAAU+Y,EAAGC,EAAGhZ,GACtC,GAAIA,EAAI,EACN,MAAM,IAAI0V,MAAM,+BAGlB,OAAOs/G,EAAOj8G,EAAGC,EADNi8G,EAAWj1H,GAExB,EACA,iBAAkB,SAAU+Y,EAAGC,GAE7B,MAAMk8G,EAAKD,EAAW,MAChB,EAAEj1H,EAAC,EAAE6D,GAAMmxH,EAAOj8G,EAAE8F,UAAW7F,EAAE6F,UAAWq2G,GAClD,MAAO,CACLl1H,EAAG+pB,EAAO/pB,GACV6D,EAAGkmB,EAAOlmB,GAEd,EACA,yBAA0B,SAAUkV,EAAGC,EAAGhZ,GACxC,MAAM,EAAE6D,GAAMmxH,EAAOj8G,EAAE8F,UAAW7F,EAAE6F,UAAW7e,EAAE6e,WACjD,MAAO,CACLhb,EAAGkmB,EAAOlmB,GACV7D,EAAG+pB,EAAO/pB,GAEd,EACA,yBAA0B,SAAU+Y,EAAGC,EAAGhZ,GACxC,GAAIA,EAAI,EACN,MAAM,IAAI0V,MAAM,+BAElB,MAAMw/G,EAAKD,EAAWj1H,IAChB,EAAE6D,GAAMmxH,EAAOj8G,EAAE8F,UAAW7F,EAAE6F,UAAWq2G,GAC/C,MAAO,CACLrxH,EAAGkmB,EAAOlmB,GACV7D,EAAG+pB,EAAOmrG,GAEd,IAGF,SAASF,EAAQj8G,EAAGC,EAAGhZ,GACrB,MAAM2yB,EAAM,GACNynF,EAAM,GACZ,IAAK,IAAIj5G,EAAI,EAAGA,EAAInB,EAAEI,OAAQe,IAAK,CACjC,IAAIg0H,EAAS9rG,EAAQ,EAAG,GACpB+rG,EAAS/rG,EAAQ,EAAG,GACxB,IAAK,IAAIjoB,EAAI,EAAGA,EAAI2X,EAAE3Y,OAAQgB,IAC5B+zH,EAAS5qH,EAAI4qH,EAAQ79E,EAASv+B,EAAE3X,GAAIioB,EAAQ1c,KAAK4hB,KAAKntB,EAAIpB,EAAEmB,IAAKwL,KAAK8mB,KAAKryB,EAAIpB,EAAEmB,OAEnF,IAAK,IAAIC,EAAI,EAAGA,EAAI4X,EAAE5Y,OAAQgB,IAC5Bg0H,EAAS7qH,EAAI6qH,EAAQ99E,EAASt+B,EAAE5X,GAAIioB,EAAQ1c,KAAK4hB,KAAKntB,EAAIpB,EAAEmB,IAAKwL,KAAK8mB,KAAKryB,EAAIpB,EAAEmB,OAEnFwxB,EAAItxB,KAAK8zH,GACT/a,EAAI/4G,KAAK+zH,EACX,CACA,MAAMvxH,EAAI,GACV,IAAK,IAAI1C,EAAI,EAAGA,EAAIwxB,EAAIvyB,OAAQe,IAC9B0C,EAAExC,KAAKmuB,EAAOmD,EAAIxxB,GAAIi5G,EAAIj5G,KAE5B,MAAO,CAAE0C,IAAG7D,IACd,CAEA,SAASi1H,EAAYvxH,GACnB,MAAM2xH,EAAO,GACb,IAAK,IAAIl0H,EAAI,EAAGA,EAAIuC,EAAGvC,IACrBk0H,EAAKh0H,KAAKF,EAAIuC,EAAIiJ,KAAKme,IAEzB,OAAOuqG,CACT,KCpGWC,GAAgCt2H,GALhC,UACQ,CACnB,YAGuE0D,IAAiB,IAAhB,QAAE+jG,GAAS/jG,EAOnF,OAAO,SAAkBV,EAAK6E,GAC5B,MAAMnC,EAAc+hG,EAAQ5/F,GAASA,EAAMwjB,QAE3C,OAAI3lB,GAA+C,mBAAzBA,EAAY4lB,SAC7B5lB,EAAY4lB,SAASzjB,GAGvBA,CACT,CAAC,ICjBU0uH,GAAiCv2H,GAHjC,WACQ,IAEqD,IAajE,SAAmBgD,EAAK6E,GAE7B,MAAqB,iBAAVA,GAAwB8d,SAAS9d,KAAUoW,MAAMpW,GAOvC,iBAAVA,EACF,CACLwjB,OAAQ,SACRxjB,MAAO5D,OAAO4D,IAIXA,EAbE,CACLwjB,OAAQ,SACRxjB,MAAO5D,OAAO4D,GAYpB,ICnCWoxB,GAAKtrB,KAAKme,GACVyjC,GAAM,EAAI5hD,KAAKme,GACfzS,GAAI1L,KAAKuL,ECQTs9G,GAA6Bx2H,GAAQ,OAAQ,IAAI,KAAM,IACvDy2H,GAA8Bz2H,GAAQ,QAAS,IAAI,KAAM,IACzD02H,GAA6B12H,GAAQ,OAAQ,IAAI,IAAM,OAEvD22H,GAAiCC,GAC5C,WACA,CAAC,SAAU,eACXlzH,IAAA,IAAC,OAAEqiB,EAAM,UAAEqE,GAAW1mB,EAAA,MAAwB,cAAlBqiB,EAAOC,OAC/B,IAAIoE,EAAU1c,KACdA,GAAQ,IAGDmpH,GAA4BD,GACvC,MACA,CAAC,SAAU,eACXloF,IAAA,IAAC,OAAE3oB,EAAM,UAAEqE,GAAWskB,EAAA,MAAwB,cAAlB3oB,EAAOC,OAC/B,IAAIoE,EAAUwE,KACdA,GAAG,IAGIqtD,GAA2B26C,GACtC,KACA,CAAC,SAAU,eACXt5B,IAAA,IAAC,OAAEv3E,EAAM,UAAEqE,GAAWkzE,EAAA,MAAwB,cAAlBv3E,EAAOC,OAC/B48C,GAAkBx4C,GAClB6O,EAAE,IAGK69F,GAA4BF,GACvC,MACA,CAAC,SAAU,eACXG,IAAA,IAAC,OAAEhxG,EAAM,UAAEqE,GAAW2sG,EAAA,MAAwB,cAAlBhxG,EAAOC,OAC/B68C,GAAmBz4C,GACnBmlC,EAAG,IAGIynE,GAA0BJ,GACrC,IACA,CAAC,SAAU,eACXK,IAAA,IAAC,OAAElxG,EAAM,UAAEqE,GAAW6sG,EAAA,MAAwB,cAAlBlxG,EAAOC,OAC/B08C,GAAiBt4C,GACjB/Q,EAAC,IAIM69G,GAA4BN,GACvC,MACA,CAAC,SAAU,eACXO,IAAA,IAAC,OAAEpxG,EAAM,UAAEqE,GAAW+sG,EAAA,MAAwB,cAAlBpxG,EAAOC,OAC/B28C,GAAmBv4C,GDxDN,iBCyDV,IAGIgtG,GAA4BR,GACvC,MACA,CAAC,SAAU,eACXS,IAAA,IAAC,OAAEtxG,EAAM,UAAEqE,GAAWitG,EAAA,MAAwB,cAAlBtxG,EAAOC,OAC/B,IAAIoE,EAAU,GAAGiI,KACjB1kB,KAAK4Y,GAAG,IAGD+wG,GAA6BV,GACxC,OACA,CAAC,SAAU,eACXW,IAAA,IAAC,OAAExxG,EAAM,UAAEqE,GAAWmtG,EAAA,MAAwB,cAAlBxxG,EAAOC,OAC/B,IAAIoE,EAAU,IAAIiI,KAClB1kB,KAAK8Y,IAAI,IAGF+wG,GAA8BZ,GACzC,QACA,CAAC,SAAU,eACXa,IAAA,IAAC,OAAE1xG,EAAM,UAAEqE,GAAWqtG,EAAA,MAAwB,cAAlB1xG,EAAOC,OAC/B,IAAIoE,EAAU,GAAGyG,IAAI,IAAIzG,EAAU,GAAGiI,MACtC1kB,KAAKk6F,KAAK,IAGH6vB,GAA+Bd,GAC1C,SACA,CAAC,SAAU,eACXe,IAAA,IAAC,OAAE5xG,EAAM,UAAEqE,GAAWutG,EAAA,MAAwB,cAAlB5xG,EAAOC,OAC/B,IAAIoE,EAAU,GAAGyG,IAAI,IAAIzG,EAAU,IAAIiI,MACvC1kB,KAAKm6F,MAAM,IAGJ8vB,GAAgChB,GAC3C,UACA,CAAC,SAAU,eACXiB,IAAA,IAAC,OAAE9xG,EAAM,UAAEqE,GAAWytG,EAAA,MAAwB,cAAlB9xG,EAAOC,OAC/B,IAAIoE,EAAU,OAAOX,OACrB9b,KAAKo6F,OAAO,IAGL+vB,GAA8BlB,GACzC,QACA,CAAC,SAAU,eACXmB,IAAA,IAAC,OAAEhyG,EAAM,UAAEqE,GAAW2tG,EAAA,MAAwB,cAAlBhyG,EAAOC,OAC/B,IAAIoE,EAAU,GAAGX,OACjB9b,KAAKq6F,KAAK,IAGHgwB,GAA0BpB,GACrC,IACA,CAAC,YACDqB,IAAA,IAAC,QAAE5tG,GAAS4tG,EAAA,OAAK5tG,EAAQmhB,CAAC,IAIf0sF,GAAoCl4H,GAAQ,KAAM,CAAC,OAAOm4H,IAAA,IAAC,GAAEl/F,GAAIk/F,EAAA,OAAKl/F,CAAE,IACxEm/F,GAAmCp4H,GAAQ,IAAK,CAAC,MAAMq4H,IAAA,IAAC,EAAEh/G,GAAGg/G,EAAA,OAAKh/G,CAAC,IAEnEi/G,GAAgCt4H,GAAQ,UAAW,IAAI,ICzH7C,WD6HvB,SAAS42H,GAAiBhxH,EAAMif,EAAcrf,GAC5C,OAAOxF,GAAQ4F,EAAMif,EAAcrf,EAAQ,CACzC+yH,wBAAwB,GAE5B,CE5HO,MAAMC,GAAqCC,GAAY,eAAgB,YAAa,UAC9EC,GAA4CD,GAAY,sBAAuB,cAAe,kBAC9FE,GAAuCF,GAAY,iBAAkB,iBAAkB,OACvFG,GAA8CH,GAAY,wBAAyB,yBAA0B,OAG7GI,GAAyCJ,GAAY,mBAAoB,mBAAoB,UAC7FK,GAAyCL,GAAY,mBAAoB,mBAAoB,UAC7FM,GAAwCN,GAAY,kBAAmB,gBAAiB,OACxFO,GAAgCP,GAAY,UAAW,sBAAuB,cAC9EQ,GAAwCR,GAAY,kBAAmB,sBAAuB,cAC9FS,GAAyCT,GAAY,mBAAoB,kBAAmB,KAC5FU,GAAqCV,GAAY,eAAgB,mBAAoB,UACrFW,GAA2CX,GAAY,qBAAsB,uBAAwB,KACrGY,GAAkDZ,GAAY,4BAA6B,qBAAsB,OACjHa,GAA4Cb,GAAY,sBAAuB,yBAA0B,MACzGc,GAAwCd,GAAY,kBAAmB,mBAAoB,UAC3Fe,GAAiCf,GAAY,WAAY,qBAAsB,OAI/EgB,GAAmChB,GAAY,aAAc,oBAAqB,KAClFiB,GAAgDjB,GAAY,0BAA2B,mBAAoB,KAC3GkB,GAAqClB,GAAY,eAAgB,mBAAoB,MACrFmB,GAAsCnB,GAAY,gBAAiB,eAAgB,UACnFoB,GAAsBC,GAAc,gBAAiB,gBACrDC,GAAsCtB,GAAY,gBAAiB,sBAAuB,KAC1FuB,GAAmCvB,GAAY,aAAc,oBAAqB,MAClFwB,GAAqCxB,GAAY,eAAgB,mBAAoB,MACrFyB,GAAoCzB,GAAY,cAAe,mBAAoB,MACnF0B,GAA6C1B,GAAY,uBAAwB,kBAAmB,YACpG2B,GAAgC3B,GAAY,UAAW,kBAAmB,QAC1E4B,GAA4C5B,GAAY,sBAAuB,mBAAoB,OACnG6B,GAAwBR,GAAc,kBAAmB,OACzDS,GAAqBT,GAAc,eAAgB,MAGnDU,GAAmC/B,GAAY,aAAc,oBAAqB,MAClFgC,GAAiChC,GAAY,WAAY,gBAAiB,UAC1EiC,GAAkCjC,GAAY,YAAa,eAAgB,UAC3EkC,GAAgClC,GAAY,UAAW,oBAAqB,YAC5EmC,GAAuCnC,GAAY,iBAAkB,yBAA0B,SAE/FoC,GAAkCpC,GAAY,YAAa,uBAAwB,QACnFqC,GAAoCrC,GAAY,cAAe,mBAAoB,iBACnFsC,GAA4CtC,GAAY,sBAAuB,wBAAyB,cACxGuC,GAAoCvC,GAAY,cAAe,uBAAwB,cACvFwC,GAAsBnB,GAAc,iBAAkB,eACtDoB,GAAwCzC,GAAY,kBAAmB,uBAAwB,OAC/F0C,GAAwC1C,GAAY,kBAAmB,sBAAuB,eAC9F2C,GAAyC3C,GAAY,mBAAoB,iBAAkB,OAG3F4C,GAAkC5C,GAAY,YAAa,mBAAoB,aAC/E6C,GAAqC7C,GAAY,eAAgB,mBAAoB,aACrF8C,GAAgC9C,GAAY,UAAW,UAAW,UAIlE+C,GAAqC/C,GAAY,eAAgB,eAAgB,KACjFgD,GAAmChD,GAAY,aAAc,cAAe,MAC5EiD,GAAmCjD,GAAY,aAAc,eAAgB,KAC7EkD,GAAqClD,GAAY,eAAgB,oBAAqB,KACtFmD,GAA0CnD,GAAY,oBAAqB,eAAgB,KAIxG,SAASA,GAAa7yH,EAAMk7B,EAAUolC,GAGpC,OAAOlmE,GAAQ4F,EAFM,CAAC,SAAU,OAAQ,cAELlC,IAAiC,IAAhC,OAAEqiB,EAAM,KAAEunB,EAAI,UAAEljB,GAAW1mB,EAI7D,MAIM0uC,EAAO,IAAI9E,EAJe,cAAlBvnB,EAAOC,OACjB,IAAIoE,EAAU0W,GACd9iB,WAAW8iB,GAEcolC,GAE7B,OADA9zB,EAAKyD,WAAY,EACVzD,CAAI,GAEf,CAIA,SAAS0nF,GAAel0H,EAAMiC,GAG5B,OAAO7H,GAAQ4F,EAFM,CAAC,SAAU,cAEG8oC,IAA2B,IAA1B,OAAE3oB,EAAM,UAAEqE,GAAWskB,EACvD,MAAyB,cAAlB3oB,EAAOC,OACV,IAAIoE,EAAUviB,GACdA,CAAK,GAEb,CC9FA,MAUag0H,GAA2C77H,GAV3C,YACQ,CAAC,QAAS,cASqD0D,IAA0B,IAAzB,MAAE4C,EAAK,UAAEof,GAAWhiB,EACvG,MAAM0oG,EAAY32D,GAAgB,CAAEnvC,QAAOof,cAG3C,OAAOpf,EAAM,YAAa,CACxB,SAAU,SAAUqG,GAElB,MAAMq1B,EAAMr1B,EAAK,GAEbqU,EAASghB,GACXr1B,EAAK,GAAKq1B,EAAM,EACP/gB,EAAY+gB,KACrBr1B,EAAK,GAAKq1B,EAAIjS,MAAM,IAGtB,IACE,OAAOq8E,EAAUv+F,MAAM,KAAMlB,EAC/B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,KAASrmF,GAAgB3wB,OCtBtCi3G,GAAwC/7H,GAVxC,SACQ,CAAC,QAAS,QAAS,SAAU,UAS+B0D,IAAqC,IAApC,MAAE4C,EAAK,MAAE8/C,EAAK,OAAEr7B,EAAM,MAAE8e,GAAOnmC,EAC/G,MAAM4iD,EAASH,GAAa,CAAE7/C,QAAO8/C,QAAOr7B,SAAQ8e,UAGpD,OAAOvjC,EAAM,SAAU,CACrB,SAAU,SAAUqG,GAElB,MAAMitD,EAAYjtD,EAAKvL,OAAS,EAC1B6K,EAAOU,EAAKitD,GACd54C,EAAS/U,KACXU,EAAKitD,GAAa3tD,EAAO,GAG3B,IACE,OAAOq6C,EAAOz4C,MAAM,KAAMlB,EAC5B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICxBnB,SAASE,GAAyB3kC,EAAYl9E,EAAM6K,GAEzD,MAAMygE,EAAS4R,EAAWtvF,QAAO,SAAUib,GACzC,OAAOW,GAAaX,MACdA,EAAKpd,QAAQuU,KACb6K,EAAM3d,IAAI2b,EAAKpd,KACvB,IAAG,GAEH,IAAK6/E,EACH,MAAM,IAAI/uE,MAAM,qDAAuD2gF,EAAa,KAItF,MAAMzxF,EAAO6/E,EAAO7/E,KACdq2H,EAAY,IAAIt0H,IAChBu0H,EAAW,IAAI37G,EAAeyE,EAAOi3G,EAAW,IAAI7wH,IAAI,CAACxF,KACzD6qB,EAAK4mE,EAAW/R,UACtB,OAAO,SAA2BzkF,GAEhC,OADAo7H,EAAU30H,IAAI1B,EAAM/E,GACb4vB,EAAG40D,SAAS62C,EACrB,CACF,CC9BA,MAGaC,GAA0Cn8H,GAH1C,oBACQ,CAAC,UAE6D0D,IAAe,IAAd,MAAE4C,GAAO5C,EAQ3F,OAAO,SAAUkN,EAAU23C,GACzB,OAAIjiD,EAAM0B,gBAAgB4I,GACjBwrH,EAAgCxrH,EAAU23C,GAE1C8zE,GAA2BzrH,EAAUA,EAASxP,OAAQmnD,EAEjE,EASA,SAAS6zE,EAAiClyG,EAAeq+B,GACvD,MAAM3/C,EAAajG,OAAO25H,YACxB35H,OAAOud,QAAQgK,EAActhB,YAC1BmB,KAAI2kC,IAAmC,IAAjCtmC,EAAWm0H,GAAiB7tF,EACjC,MAAM8tF,EAAyBp0H,EAAUiC,MAAM,KAAKjJ,OACpD,OAAIkF,EAAM0B,gBAAgBu0H,GACjB,CAACn0H,EAAWg0H,EAAgCG,EAAkBh0E,IAE9D,CAACngD,EAAWi0H,GAA2BE,EAAkBC,EAAwBj0E,GAC1F,KAIN,MAAkC,iBAAvBr+B,EAActkB,KAChBU,EAAM4jB,EAActkB,KAAMgD,GAE1BtC,EAAMsC,EAEjB,KAeF,SAASyzH,GAA4BE,EAAkBC,EAAwBj0E,GAC7E,OAAIi0E,IAA2Bj0E,EACtBg0E,EACEC,IAA2Bj0E,EAAiB,EAC9C,WAAmB,QAAAjjB,EAAAxiC,UAAA1B,OAANuL,EAAI,IAAA7G,MAAAw/B,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ54B,EAAI44B,GAAAziC,UAAAyiC,GACtB,MAAMk3F,EAAO9vH,EAAKpK,MAAM,EAAGgmD,GACrB/Y,EAAMktF,GAAe/vH,EAAK47C,IAChC,OAAOg0E,KAAoBE,EAAMjtF,EACnC,EACSgtF,EAAyBj0E,EAAiB,EAC5C,WAAmB,QAAA7gB,EAAA5kC,UAAA1B,OAANuL,EAAI,IAAA7G,MAAA4hC,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJh7B,EAAIg7B,GAAA7kC,UAAA6kC,GACtB,MAAM80F,EAAO9vH,EAAKpK,MAAM,EAAGgmD,GACrB/Y,EAAMktF,GAAe/vH,EAAK47C,IAC1BnI,EAAOzzC,EAAKpK,MAAMgmD,EAAiB,GACzC,OAAOg0E,KAAoBE,EAAMjtF,KAAQ4Q,EAC3C,EAEOm8E,CAEX,CAQA,SAASG,GAAgBz4F,GACvB,OAAOA,EAAKl6B,KAAIi4B,GAAOA,EAAM,GAC/B,CCpFA,MAGa26F,GAAwC38H,GAHxC,SACQ,CAAC,UAE2D0D,IAAe,IAAd,MAAE4C,GAAO5C,EAQzF,SAASk5H,EAAiBjwH,EAAMwN,EAAM6K,GACpC,MAAMjd,EAASq/C,GAAa,CAAE9gD,UACxBu2H,EAAoBV,GAAwB,CAAE71H,UAEpD,GAAoB,IAAhBqG,EAAKvL,OACP,OAAO2G,IAET,IAAIlH,EAAI8L,EAAK,GAEb,GAAoB,IAAhBA,EAAKvL,OACP,OAAO2G,EAAOlH,GAGhB,MAAMy8B,EAAI3wB,EAAKvL,OAAS,EACxB,IAAIwP,EAAWjE,EAAK2wB,GAgBpB,OAdIz8B,IACFA,EAAIi8H,EAAoBj8H,EAAGmkB,IAGzBpU,IAGAA,EAFE+S,GAAa/S,IAAawS,EAAyBxS,GAE1CksH,EAAoBlsH,EAAUoU,GAG9Bg3G,GAAwBprH,EAAUuJ,EAAM6K,IAIhDjd,EAAOlH,EAAGg8H,EAAkBjsH,EAAU0sB,GAC/C,CAGA,SAASw/F,EAAqBzsH,EAAK2U,GACjC,OAAO3U,EAAIi1E,UAAUD,SAASrgE,EAChC,CAEA,OANA43G,EAAgB9oC,SAAU,EAMnB8oC,CAAe,GACrB,CAAEd,qBAAqB,IC/CbiB,GAAyC/8H,GAHzC,UACQ,CAAC,UAE4D0D,IAAe,IAAd,MAAE4C,GAAO5C,EAO1F,MAAMa,EAAUijD,GAAc,CAAElhD,UAC1Bu2H,EAAoBV,GAAwB,CAAE71H,UACpD,SAAS02H,EAAkBrwH,EAAMwN,EAAM6K,GACrC,GAAoB,IAAhBrY,EAAKvL,OACP,OAAOmD,IAET,IAAI1D,EAAI8L,EAAK,GAEb,GAAoB,IAAhBA,EAAKvL,OACP,OAAOmD,EAAQ1D,GAGjB,MAAMy8B,EAAI3wB,EAAKvL,OAAS,EACxB,IAAIwP,EAAWjE,EAAK2wB,GAgBpB,OAdIz8B,IACFA,EAAIi8H,EAAoBj8H,EAAGmkB,IAGzBpU,IAGAA,EAFE+S,GAAa/S,IAAawS,EAAyBxS,GAE1CksH,EAAoBlsH,EAAUoU,GAG9Bg3G,GAAwBprH,EAAUuJ,EAAM6K,IAIhDzgB,EAAQ1D,EAAGg8H,EAAkBjsH,EAAU0sB,GAChD,CAGA,SAASw/F,EAAqBzsH,EAAK2U,GACjC,OAAO3U,EAAIi1E,UAAUD,SAASrgE,EAChC,CACA,OALAg4G,EAAiBlpC,SAAU,EAKpBkpC,CAAgB,GACtB,CAAElB,qBAAqB,IC7CbmB,GAAuCj9H,GAHvC,QACQ,CAAC,QAAS,sBAEiD0D,IAAkC,IAAjC,MAAE0iD,EAAK,kBAAE8Y,GAAmBx7D,EAO3G,OAAO,WACL,MAAMiJ,EAAO,GACb,IAAK,IAAIxK,EAAI,EAAG8O,EAAKnO,UAAU1B,OAAQe,EAAI8O,EAAI9O,IAAK,CAClD,IAAIkO,EAAMvN,UAAUX,GAGpB,GAAIyf,EAAQvR,GACVA,EAAIgG,QACJhG,EAAIiG,KAAQjG,EAAIkvB,KAAO,EAAI,EAAI,OAC1B,GAAIlvB,IAAqB,IAAdA,EAAI6sH,MACpB7sH,EAAMA,EAAItG,KAAI,SAAU9I,GAAK,OAAOA,EAAI,CAAE,SACrC,GAAI8E,EAAQsK,IAAQmR,EAASnR,GACH,YAA3B6uD,EAAkB7uD,KACpBA,EAAMA,EAAItG,KAAI,SAAU9I,GAAK,OAAOA,EAAI,CAAE,UAEvC,GAAI+f,EAAS3Q,IAAQ8Q,EAAS9Q,GACnCA,SACK,GAAI4Q,EAAY5Q,GACrBA,EAAMA,EAAIyY,WAAa,OAClB,GAAmB,iBAARzY,EAGhB,MAAM,IAAItJ,UAAU,wEAGtB4F,EAAKxK,GAAKkO,CACZ,CAEA,MAAMirB,EAAM,IAAI8qB,EAEhB,OADAA,EAAMv4C,MAAMytB,EAAK3uB,GACV2uB,CACT,CAAC,GACA,CAAEwgG,qBAAqB,ICtCbqB,GAAqCn9H,GAHrC,MACQ,CAAC,UAEwD0D,IAAe,IAAd,MAAE4C,GAAO5C,EAOtF,MAAMqG,EAAM6W,GAAU,CAAEta,UAClBu2H,EAAoBV,GAAwB,CAAE71H,UAEpD,SAAS82H,EAAczwH,EAAMwN,EAAM6K,GACjC,GAAoB,IAAhBrY,EAAKvL,OACP,OAAO2I,IAGT,GAAoB,IAAhB4C,EAAKvL,OACP,OAAO2I,EAAI4C,EAAK,IAElB,MAAM2wB,EAAI3wB,EAAKvL,OAAS,EACxB,IAAIc,EAAIyK,EAAKpK,MAAM,EAAG+6B,GAClB1sB,EAAWjE,EAAK2wB,GAYpB,OAXAp7B,EAAIA,EAAE6H,KAAIsG,GAAOysH,EAAoBzsH,EAAK2U,KAEtCpU,IAGAA,EAFE+S,GAAa/S,IAAawS,EAAyBxS,GAE1CksH,EAAoBlsH,EAAUoU,GAG9Bg3G,GAAwBprH,EAAUuJ,EAAM6K,IAGhDjb,KAAO7H,EAAG26H,EAAkBjsH,EAAU0sB,IAE7C,SAASw/F,EAAqBzsH,EAAK2U,GACjC,OAAO3U,EAAIi1E,UAAUD,SAASrgE,EAChC,CACF,CAGA,OAFAo4G,EAAatpC,SAAU,EAEhBspC,CAAY,GAClB,CAAEtB,qBAAqB,IC7CnB,SAASuB,GAAmB1wH,GACjC,GAAoB,IAAhBA,EAAKvL,QAAgBqgB,EAAa9U,EAAK,IAAK,CAE9C,MAAMq1B,GADNr1B,EAAOA,EAAKpK,SACK,ICOZye,EAD4Btc,EDLTs9B,ICMJ/gB,EAAYvc,MDL9BiI,EAAK,GCNJ,SAAwBq1B,GAC7B,OAAIhhB,EAASghB,GACJA,EAAM,EACJ/gB,EAAY+gB,GACdA,EAAIjS,MAAM,GAEViS,CAEX,CDFgBs7F,CAAct7F,GAE5B,CCEK,IAA8Bt9B,EDDnC,OAAOiI,CACT,CETA,MAGa4wH,GAAqCv9H,GAHrC,MACQ,CAAC,QAAS,SAAU,UAAW,SAAU,UAEgB0D,IAA0D,IAAzD,MAAE4C,EAAK,OAAEyf,EAAM,QAAEwvB,EAAO,OAAE0V,EAAQhtC,MAAO22C,GAAWlxD,EACjI,MAAMqK,EAAMywD,GAAU,CAAEl4D,QAAOyf,SAAQwvB,UAAS0V,SAAQhtC,MAAO22C,IAS/D,OAAOtuD,EAAM,MAAO,CAClB,SAAU,SAAUqG,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOoB,EAAIF,MAAM,KAAMlB,EACzB,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICrBb0B,GAAsCx9H,GAHtC,OACQ,CAAC,QAAS,MAAO,WAEyC0D,IAA4B,IAA3B,MAAE4C,EAAK,IAAEiF,EAAG,OAAEilB,GAAQ9sB,EACpG,MAAMyqG,EAAOgR,GAAW,CAAE74G,QAAOiF,MAAKilB,WAStC,OAAOlqB,EAAM,OAAQ,CACnB,SAAU,SAAUqG,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOwhG,EAAKtgG,MAAM,KAAMlB,EAC1B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICrBb2B,GAAqCz9H,GAHrC,MACQ,CAAC,QAAS,SAAU,UAAW,UAAW,UAEe0D,IAA2D,IAA1D,MAAE4C,EAAK,OAAEyf,EAAM,QAAEwvB,EAAO,QAAEkM,EAASxjC,MAAO22C,GAAWlxD,EAClI,MAAMkK,EAAM+wD,GAAU,CAAEr4D,QAAOyf,SAAQwvB,UAASkM,UAASxjC,MAAO22C,IAShE,OAAOtuD,EAAM,MAAO,CAClB,SAAU,SAAUqG,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOiB,EAAIC,MAAM,KAAMlB,EACzB,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICvBb4B,GAAuC19H,GAHvC,QACQ,CAAC,QAAS,SAAU,UAAW,aAAc,QAAS,UAAW,YAAa,SAAU,WAAY,MAAO,SAAU,eAE1D0D,IAAgH,IAA/G,MAAE4C,EAAK,OAAEyf,EAAM,OAAEgF,EAAM,UAAEggC,EAAS,MAAEvJ,EAAK,QAAEC,EAAO,UAAEuJ,EAAS,OAAEC,EAAM,SAAEC,EAAQ,IAAE3/C,EAAG,OAAEmkB,EAAM,WAAEwD,GAAYxvB,EACzL,MAAMmmC,EAAQihB,GAAY,CAAExkD,QAAOyf,SAAQgF,SAAQggC,YAAWvJ,QAAOC,UAASuJ,YAAWC,SAAQC,WAAU3/C,MAAKmkB,SAAQwD,eAQxH,OAAO5sB,EAAM,QAAS,CACpB,SAAU,SAAUqG,GAQlB,MALoB,kBADPA,EADKA,EAAKvL,OAAS,IAI9BuL,EAAKtK,MAAK,GAGLwnC,EAAMh8B,MAAM,KAAMlB,EAC3B,GACA,GACD,CAAEmvH,qBAAqB,ICZb6B,GAAqC39H,GAVrC,MACQ,CAAC,QAAS,QAAS,SAAU,UAS4B0D,IAAqC,IAApC,MAAE4C,EAAK,MAAE8/C,EAAK,OAAEr7B,EAAM,MAAE8e,GAAOnmC,EAC5G,MAAM+mC,EAAM4iB,GAAU,CAAE/mD,QAAO8/C,QAAOr7B,SAAQ8e,UAG9C,OAAOvjC,EAAM,MAAO,CAClB,SAAU,SAAUqG,GAElB,MAAMitD,EAAYjtD,EAAKvL,OAAS,EAC1B6K,EAAOU,EAAKitD,GACd54C,EAAS/U,KACXU,EAAKitD,GAAa3tD,EAAO,GAG3B,IACE,OAAOw+B,EAAI58B,MAAM,KAAMlB,EACzB,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,IC5Bb8B,GAAwC59H,GAHxC,SACQ,CAAC,QAAS,SAAU,QAAS,QAE+B0D,IAAmC,IAAlC,MAAE4C,EAAK,OAAEykB,EAAM,MAAErC,EAAK,IAAEnd,GAAK7H,EAC7G,MAAMw8B,EAASytB,GAAa,CAAErnD,QAAOykB,SAAQrC,QAAOnd,QAQpD,OAAOjF,EAAM,SAAU,CACrB,SAAU,SAAUqG,GAClB,IACE,OAAOuzB,EAAOryB,MAAM,KAAMlB,EAC5B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICjBb+B,GAAwC79H,GAHxC,SACQ,CAAC,QAAS,SAAU,cAEwC0D,IAAkC,IAAjC,MAAE4C,EAAK,OAAEykB,EAAM,UAAErF,GAAWhiB,EAC5G,MAAM+D,EAASq+C,GAAa,CAAEx/C,QAAOykB,SAAQrF,cAS7C,OAAOpf,EAAM,SAAU,CACrB,SAAU,SAAUqG,GAElB,MAAMitD,EAAYjtD,EAAKvL,OAAS,EAC1B6K,EAAOU,EAAKitD,GACd54C,EAAS/U,GACXU,EAAKitD,GAAa3tD,EAAO,EAChBgV,EAAYhV,KACrBU,EAAKitD,GAAa3tD,EAAK8jB,MAAM,IAG/B,IACE,OAAOtoB,EAAOoG,MAAM,KAAMlB,EAC5B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,IC/BpBl2H,GAAO,OAGAk4H,GAAsC99H,GAAQ4F,GAFtC,CAAC,QAAS,SAAU,WAAY,SAAU,cAEgBlC,IAAoD,IAAnD,MAAE4C,EAAK,OAAEykB,EAAM,SAAE6L,EAAQ,OAAE5Q,EAAM,UAAE+kC,GAAWrnD,EAC5H,MAAMk8B,EAAO8pB,GAAW,CAAEpjD,QAAOykB,SAAQ6L,WAAU5Q,SAAQ+kC,cAQ3D,OAAOzkD,EAAMV,GAAM,CACjB,SAAU,SAAU+G,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOizB,EAAK/xB,MAAM,KAAMlB,EAC1B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICbbiC,GAAqC/9H,GAVrC,MACQ,CAAC,QAAS,MAAO,OAAQ,aASgC0D,IAAoC,IAAnC,MAAE4C,EAAK,IAAEyD,EAAG,KAAE0f,EAAI,SAAEonE,GAAUntF,EAC3G,MAAM4qG,EAAM+S,GAAU,CAAE/6G,QAAOyD,MAAK0f,OAAMonE,aAE1C,OAAOvqF,EAAM,MAAO,CAClB,SAAU,SAAUqG,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAO2hG,EAAIzgG,MAAM,KAAMlB,EACzB,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICdbkC,GAAqCh+H,GAHrC,MACQ,CAAC,QAAS,SAAU,MAAO,YAE8B0D,IAAqC,IAApC,MAAE4C,EAAK,OAAEyf,EAAM,IAAExa,EAAG,QAAEgqC,GAAS7xC,EAC5G,MAAM00B,EAAMsmF,GAAU,CAAEp4G,QAAOyf,SAAQxa,MAAKgqC,YAE5C,OAAOjvC,EANI,MAMQ,CACjB,SAAU,SAAUqG,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOyrB,EAAIvqB,MAAM,KAAMlB,EACzB,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICfbmC,GAA6Cj+H,GAV7C,cACQ,CAAC,QAAS,YAAa,MAAO,WAAY,SAAU,WAAY,kBAAmB,UAAW,YAAa,UAAW,YAAa,SAAU,cAS5E0D,IAAuI,IAAtI,MAAE4C,EAAK,UAAEykD,EAAS,IAAEx/C,EAAG,SAAEqrB,EAAQ,OAAEpG,EAAM,SAAE8nB,EAAQ,gBAAEq0D,EAAe,QAAEl2E,EAAO,UAAE/Q,EAAS,QAAE+7B,EAAO,UAAEuJ,EAAS,OAAEC,EAAM,UAAEmhD,GAAW1oG,EACtN,MAAM2qG,EAAc6R,GAAkB,CAAE55G,QAAOykD,YAAWx/C,MAAKqrB,WAAUpG,SAAQ8nB,WAAUq0D,kBAAiBl2E,UAAS/Q,YAAW+7B,UAASuJ,YAAWC,SAAQmhD,cAE5J,OAAO9lG,EAAM,cAAe,CAC1B,qCAAsC+nG,EACtC,6CAA8CgS,CAAC1vG,EAAK2vG,EAAMt+E,IAAQqsE,EAAY19F,EAAK2vG,EAAMgd,EAAct7F,IACvG,8CAA+CqsE,EAC/C,sDAAuDmS,CAAC7vG,EAAK2vG,EAAMG,EAAQz+E,IAAQqsE,EAAY19F,EAAK2vG,EAAMG,EAAQ6c,EAAct7F,IAChI,iCAAkCqsE,EAClC,yCAA0CuS,CAACh8G,EAAM07G,EAAMt+E,IAAQqsE,EAAYzpG,EAAM07G,EAAMgd,EAAct7F,IACrG,0CAA2CqsE,EAC3C,kDAAmDwS,CAACj8G,EAAM07G,EAAMG,EAAQz+E,IAAQqsE,EAAYzpG,EAAM07G,EAAMG,EAAQ6c,EAAct7F,MAGhI,SAASs7F,EAAet7F,GAEtB,OAAOq7F,GAAkB,CAAC,GAAIr7F,IAAM,EACtC,IACC,CAAE85F,qBAAqB,ICpBpBl2H,GAAO,SAGAs4H,GAAwCl+H,GAAQ4F,GAFxC,CAAC,QAAS,MAAO,cAE2ClC,IAA+B,IAA9B,MAAE4C,EAAK,IAAEiF,EAAG,UAAEwjF,GAAWrrF,EACzG,MAAMuqG,EAAS2Q,GAAa,CAAEt4G,QAAOiF,MAAKwjF,cAE1C,OAAOzoF,EAAMV,GAAM,CACjB,SAAU,SAAU+G,GAElB,GAAoB,IAAhBA,EAAKvL,QAAgBqgB,EAAa9U,EAAK,IAAK,CAC9C,MAAMq1B,EAAMr1B,EAAK,GACbqU,EAASghB,GACXr1B,EAAK,GAAKq1B,EAAM,EACP/gB,EAAY+gB,KACrBr1B,EAAK,GAAKq1B,EAAIjS,MAAM,GAExB,CAEA,IACE,OAAOk+E,EAAOpgG,MAAM,KAAMlB,EAC5B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,IChCpBl2H,GAAO,WAUAu4H,GAA0Cn+H,GAAQ4F,GAT1C,CAAC,QAAS,MAAO,WAAY,WAAY,SAAU,YAAa,UASFlC,IAA6E,IAA5E,MAAE4C,EAAK,IAAEiF,EAAG,SAAEqrB,EAAQ,SAAE0hB,EAAQ,OAAE9nB,EAAM,UAAE47E,EAAWnuF,MAAO22C,GAAWlxD,EACzJ,MAAMmtF,EAAWivB,GAAe,CAAEx5G,QAAOiF,MAAKqrB,WAAU0hB,WAAU9nB,SAAQ47E,YAAWnuF,MAAO22C,IAE5F,OAAOtuD,EAAMV,GAAM,CACjB,SAAU,SAAU+G,GAClBA,EAAO0wH,GAAkB1wH,GAEzB,IACE,OAAOkkF,EAAShjF,MAAM,KAAMlB,EAC9B,CAAE,MAAOM,GACP,MAAMi6E,GAAej6E,EACvB,CACF,GACA,GACD,CAAE6uH,qBAAqB,ICzBpBl2H,GAAO,QAGAw4H,GAAuCp+H,GAAQ4F,GAFvC,CAAC,QAAS,SAAU,QAAS,QAE8BlC,IAAmC,IAAlC,MAAE4C,EAAK,OAAEykB,EAAM,MAAErC,EAAK,IAAEnd,GAAK7H,EAC5G,MAAMmrG,EAAQn5C,GAAY,CAAEpvD,QAAOykB,SAAQrC,QAAOnd,QAClD,OAAOjF,EAAMV,GAAM,CACjB,yBAA0B,SAAUgwD,EAAUz1C,GAAU,OAAO0uF,EAAMwvB,EAAiCzoE,GAAWz1C,EAAQ,EACzH,0CAA2C,SAAUy1C,EAAUz1C,EAAQ9X,GAAW,OAAOwmG,EAAMwvB,EAAiCzoE,GAAWz1C,EAAQ9X,EAAS,IAG9J,SAASg2H,EAAkCzoE,GACzC,OAAOA,EAASr4C,QAAQk4C,IAAgB50D,GAS/B,IAROA,EAAE0B,MAAM,GAAG8H,MAAM,KACVN,KAAI,SAAUu0H,GACjC,OAAKrgH,MAAMqgH,IAASA,EAAKl9H,OAAS,EACzBuc,SAAS2gH,GAAQ,EAEjBA,CAEX,IACoB71H,KAAK,MAE7B,IACC,CAAEqzH,qBAAqB,ICpBbyC,GAAqCv+H,GAHrC,MACQ,CAAC,QAAS,SAAU,QAAS,MAAO,cAAe,MAAO,WAED0D,IAAwD,IAAvD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,IAAE6yC,EAAG,OAAE9zD,GAAQ/D,EAC/H,MAAM8rF,EAAMl0B,GAAU,CAAEh1D,QAAOykB,SAAQkjB,cAAavlB,QAAO6yC,MAAK9zD,WAEhE,SAAS+2H,EAAc7xH,EAAMwN,EAAM6K,GACjC,MAAMy5G,EAAa9xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,IAAKvD,EAAag9G,KAAgBjvC,EAAIivC,GAAY,GAChD,OAAO,EAET,MAAMC,EAAa/xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,OAAOwqE,EAAIivC,EAAYC,EACzB,CAIA,OAFAF,EAAa1qC,SAAU,EAEhB0qC,CAAY,GAClB,CAAE1C,qBAAqB,ICfb6C,GAAoC3+H,GAHpC,KACQ,CAAC,QAAS,SAAU,cAAe,cAAe,WAEM0D,IAAyD,IAAxD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,YAAE3jB,EAAW,OAAE7iB,GAAQ/D,EAC/H,MAAMgsF,EAAK9pC,GAAS,CAAEt/C,QAAOykB,SAAQkjB,cAAa3jB,cAAa7iB,WAE/D,SAASm3H,EAAajyH,EAAMwN,EAAM6K,GAChC,MAAMy5G,EAAa9xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,IAAKvD,EAAag9G,IAAe/uC,EAAG+uC,GAAY,GAC9C,OAAO,EAET,MAAMC,EAAa/xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,OAAO0qE,EAAG+uC,EAAYC,EACxB,CAIA,OAFAE,EAAY9qC,SAAU,EAEf8qC,CAAW,GACjB,CAAE9C,qBAAqB,ICfb+C,GAAyC7+H,GAHzC,UACQ,CAAC,QAAS,SAAU,OAAQ,UAAW,cAEsB0D,IAAiD,IAAhD,MAAE4C,EAAK,OAAEykB,EAAM,KAAEzK,EAAI,QAAExF,EAAO,UAAEsqC,GAAW1hD,EAC5H,MAAMyoG,EAAUhnD,GAAc,CAAE7+C,QAAOykB,SAAQzK,OAAMxF,UAASsqC,cAE9D,SAAS05E,EAAkBnyH,EAAMwN,EAAM6K,GACrC,MAAMq7C,EAAO1zD,EAAK,GAAG24E,UAAUD,SAASrgE,GAGxC,IAAKvD,EAAa4+C,IAAiB,MAARA,QAAyB18D,IAAT08D,EACzC,OAAOA,EAIT,MAAMC,EAAQ3zD,EAAK,GAAG24E,UAAUD,SAASrgE,GACzC,OAAOmnF,EAAQ9rC,EAAMC,EACvB,CAIA,OAFAw+D,EAAiBhrC,SAAU,EAEpBgrC,CAAgB,GACtB,CAAEhD,qBAAqB,ICnBbiD,GAAwC/+H,GAHxC,SACQ,CAAC,QAAS,SAAU,QAAS,MAAO,cAAe,MAAO,WAEE0D,IAAwD,IAAvD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,MAAEvlB,EAAK,IAAE6yC,EAAG,OAAE9zD,GAAQ/D,EAClI,MAAM4rF,EAASzrC,GAAa,CAAEv9C,QAAOykB,SAAQkjB,cAAavlB,QAAO6yC,MAAK9zD,WAEtE,SAASu3H,EAAiBryH,EAAMwN,EAAM6K,GACpC,MAAMy5G,EAAa9xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,IAAKvD,EAAag9G,GAAa,CAC7B,GAAIxgH,MAAMwgH,GACR,OAAO7vG,IAET,GAAmB,IAAf6vG,IAAmC,IAAfA,EACtB,OAAO,CAEX,CACA,MAAMC,EAAa/xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,OAAOsqE,EAAOmvC,EAAYC,EAC5B,CAIA,OAFAM,EAAgBlrC,SAAU,EAEnBkrC,CAAe,GACrB,CAAElD,qBAAqB,ICpBbmD,GAAuCj/H,GAHvC,QACQ,CAAC,QAAS,SAAU,cAAe,cAAe,WAES0D,IAAyD,IAAxD,MAAE4C,EAAK,OAAEykB,EAAM,YAAEkjB,EAAW,YAAE3jB,EAAW,OAAE7iB,GAAQ/D,EAClI,MAAM6rF,EAAQvrC,GAAY,CAAE19C,QAAOykB,SAAQkjB,cAAa3jB,cAAa7iB,WAErE,SAASy3H,EAAgBvyH,EAAMwN,EAAM6K,GACnC,MAAMy5G,EAAa9xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,IAAKvD,EAAag9G,GAAa,CAC7B,GAAIxgH,MAAMwgH,GACR,OAAO7vG,IAET,IAAqB,IAAjB6vG,EACF,OAAQ,EAEV,IAAmB,IAAfA,EACF,OAAO,CAEX,CACA,MAAMC,EAAa/xH,EAAK,GAAG24E,UAAUD,SAASrgE,GAC9C,OAAOuqE,EAAMkvC,EAAYC,EAC3B,CAIA,OAFAQ,EAAeprC,SAAU,EAElBorC,CAAc,GACpB,CAAEpD,qBAAqB,I,cC9BnB,MAAMqD,GAAiB,CAG5B71G,OAAQ,MAIRC,OAAQ,MAGRwB,OAAQ,SAGR/E,OAAQ,SAIRG,eAAgB,SAGhBkB,UAAW,GAMXi2B,aAAa,EAIbgoE,WAAY,MC3BD8Z,GAAiB,CAAC,SAAU,SAC5BC,GAAiB,CAAC,SAAU,YAAa,SAAU,YAEzD,SAASC,GAAev5G,EAAQtM,GA6CrC,SAAS8lH,EAASl3H,GAChB,GAAIA,EAAS,CACX,QAAwB1E,IAApB0E,EAAQ4zB,QAAuB,CAEjC46E,QAAQC,KAAK,iGACb,MAAM0oB,EAAa17G,GAAMzb,GAIzB,OAHAm3H,EAAWl2G,OAASjhB,EAAQ4zB,QAC5BujG,EAAWj2G,OAA2B,KAAlBlhB,EAAQ4zB,eACrBujG,EAAWvjG,QACXsjG,EAAQC,EACjB,CACA,MAAMllG,EAAOxW,GAAMiC,GAGnB05G,GAAep3H,EAAS,SAAU+2H,IAClCK,GAAep3H,EAAS,SAAUg3H,IAGlCp7G,GAAW8B,EAAQ1d,GAEnB,MAAMgyB,EAAOvW,GAAMiC,GAEb25G,EAAU57G,GAAMzb,GAKtB,OAFAoR,EAAK,SAAU4gB,EAAMC,EAAMolG,GAEpBrlG,CACT,CACE,OAAOvW,GAAMiC,EAEjB,CAeA,OAZAw5G,EAAQH,eAAiBA,GACzBG,EAAQF,eAAiBA,GAGzB18H,OAAOyB,KAAK+6H,IAAgB56H,SAAQvB,IAClCL,OAAOwT,eAAeopH,EAASv8H,EAAK,CAClC2D,IAAKA,IAAMof,EAAO/iB,GAClB6b,YAAY,EACZ8F,cAAc,GACd,IAGG46G,CACT,CAQA,SAASE,GAAgBp3H,EAASzC,EAAMua,QAChBxc,IAAlB0E,EAAQzC,IAAwBua,EAAO+C,SAAS7a,EAAQzC,KAE1DixG,QAAQC,KAAK,2BAA6BzuG,EAAQzC,GAAQ,+BAAiCA,EAA9E,yBACaua,EAAOpW,KAAIlC,GAASugC,KAAKjH,UAAUt5B,KAAQY,KAAK,MAAQ,IAEtF,CC7GA,SC+FO,SAASjD,EAAQm6H,EAAW55G,GACjC,MAAM65G,EAAiBl9H,GAAc,CAAC,EAAGy8H,GAAgBp5G,GAGzD,GAA6B,mBAAlBpjB,OAAO6C,OAChB,MAAM,IAAIkR,MAAM,iHAKlB,MAAMyD,ECrGD,SAAgBvD,GAErB,MAAMipH,EAAU,IAAIC,GAQpB,OALAlpH,EAAIuC,GAAK0mH,EAAQ1mH,GAAGonB,KAAKs/F,GACzBjpH,EAAI4C,IAAMqmH,EAAQrmH,IAAI+mB,KAAKs/F,GAC3BjpH,EAAI0C,KAAOumH,EAAQvmH,KAAKinB,KAAKs/F,GAC7BjpH,EAAI6C,KAAOomH,EAAQpmH,KAAK8mB,KAAKs/F,GAEtBjpH,CACT,CD0FeipH,CAAc,CAEzB7+G,SAAQ,EACRI,UAAS,EACTH,YAAW,EACXE,SAAQ,EACRE,WAAU,EACVC,OAAM,EACNC,SAAQ,EACRxb,QAAO,EACPyb,SAAQ,EACRC,aAAY,EACZC,cAAa,EACbC,eAAc,EACdC,QAAO,EACPC,QAAO,EACPC,UAAS,EACTC,YAAW,EACXC,OAAM,EACNC,WAAU,EACVC,OAAM,EACNC,SAAQ,EACRpB,SAAQ,EACRD,MAAK,EACLsB,iBAAgB,EAChBC,oBAAmB,EACnBC,OAAM,EACNC,YAAW,EAEXC,eAAc,EACdE,YAAW,EACXC,iBAAgB,EAChBC,YAAW,EACXC,kBAAiB,EACjBC,eAAc,EACdM,yBAAwB,EACxBC,eAAc,EACdC,YAAW,EACXb,OAAM,EACNc,aAAY,EACZN,eAAc,EACdO,kBAAiB,GACjBC,YAAW,GACXC,iBAAgB,GAChBC,aAAY,GAEZC,QAAOA,KAITzJ,EAAK4L,OAASu5G,GAAcM,EAAgBzlH,EAAKV,MAEjDU,EAAKk9E,WAAa,CAChBrR,UAAW,CAAC,EACZZ,kBAAmB,CACjBr/D,OAAQ5L,EAAK4L,SAoDjB,MAAMg6G,EAAoB,CAAC,EAG3B,SAASC,IAAoB,QAAA16F,EAAAxiC,UAAA1B,OAANuL,EAAI,IAAA7G,MAAAw/B,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ54B,EAAI44B,GAAAziC,UAAAyiC,GACzB,OAAOprB,EAAK7T,MAAMuH,MAAMsM,EAAK7T,MAAOqG,EACtC,CACAqzH,EAAUh4H,gBAAkBkiB,EAAAA,gBAE5B,MAAM+1G,EE1ND,SAAwB35H,EAAO45H,EAAM/lH,EAAM4lH,GA8HhD,SAASI,EAASv6H,EAAMiC,EAAOQ,GAAS,IAAA+3H,EAuOJj4H,EAzNlC,GAZIE,EAAQg4H,MAAyB,mBAAVx4H,IAEzBA,EA8EJ,SAAgBM,GACd,MAAMm4H,EAAU,WACd,MAAM3zH,EAAO,GACb,IAAK,IAAIxK,EAAI,EAAGwX,EAAM7W,UAAU1B,OAAQe,EAAIwX,EAAKxX,IAAK,CACpD,MAAMkO,EAAMvN,UAAUX,GACtBwK,EAAKxK,GAAKkO,GAAOA,EAAIwP,SACvB,CACA,OAAO1X,EAAG0F,MAAMsM,EAAMxN,EACxB,EAMA,OAJIxE,EAAG69E,YACLs6C,EAAQt6C,UAAY79E,EAAG69E,WAGlBs6C,CACT,CA7FYC,CAAM14H,IAoOK,mBADaM,EA/NJN,IAgO6B,iBAAjBM,EAAGC,YA/N3CP,EAAQvB,EAAMV,EAAM,CAClB,CAACiC,EAAMO,WAAYP,KAInBvB,EAAM0B,gBAAgBmS,EAAKvU,KAAUU,EAAM0B,gBAAgBH,GAgB7D,OAbEA,EAFEQ,EAAQ8P,SAEF7R,EAAMV,EAAMiC,EAAMe,YAGlBtC,EAAM6T,EAAKvU,GAAOiC,GAG5BsS,EAAKvU,GAAQiC,SACNk4H,EAAkBn6H,GAEzB46H,EAAiB56H,EAAMiC,QACvBsS,EAAKV,KAAK,SAAU7T,GAAM,WACxB,OAAOiC,CACT,IAIF,MAAM44H,OAA2B98H,IAAfwW,EAAKvU,GACjBugE,EAA2B,QAAZi6D,EAAGjmH,EAAKmzB,YAAI,IAAA8yF,OAAA,EAATA,EAAWj6D,gBAAgBvgE,GACnD,IAAM66H,IAAct6D,GAAoB99D,EAAQ8P,SAQ9C,OAPAgC,EAAKvU,GAAQiC,SACNk4H,EAAkBn6H,GAEzB46H,EAAiB56H,EAAMiC,QACvBsS,EAAKV,KAAK,SAAU7T,GAAM,WACxB,OAAOiC,CACT,IAIF,IAAKQ,EAAQq4H,OACX,MAAM,IAAIhqH,MAAM,kBAAoB9Q,EAAO,oBAE/C,CAEA,SAAS46H,EAAkB56H,EAAMiC,GAC3BA,GAAoC,mBAApBA,EAAMm+E,WACxB7rE,EAAKk9E,WAAWrR,UAAUpgF,GAAQiC,EAAMm+E,UACpC26C,EAAqB/6H,KACvBuU,EAAKk9E,WAAWjS,kBAAkBx/E,GAAQiC,EAAMm+E,oBAI3C7rE,EAAKk9E,WAAWrR,UAAUpgF,GAC7B+6H,EAAqB/6H,KACvBuU,EAAKk9E,WAAWjS,kBAAkBx/E,GAAQiC,GAGhD,CAEA,SAAS+4H,EAAkBh7H,UAClBuU,EAAKk9E,WAAWrR,UAAUpgF,GAC7B+6H,EAAqB/6H,GACvBuU,EAAKk9E,WAAWjS,kBAAkBx/E,GAAQuU,EAAKvU,UAExCuU,EAAKk9E,WAAWjS,kBAAkBx/E,EAE7C,CAiCA,SAASi7H,EAAgB7gI,EAASqI,GAA4B,IAAAy4H,EAAAC,EAAA,IAAnBn7H,EAAI9C,UAAA1B,OAAA,QAAAuC,IAAAb,UAAA,GAAAA,UAAA,GAAG9C,EAAQmI,GACxD,GAAIvC,EAAKsd,SAAS,KAChB,MAAM,IAAIxM,MAAM,wDACH0xB,KAAKjH,UAAUv7B,IAG9B,MAAMo7H,EAAYC,EAA2BjhI,GACzCma,EAAKk9E,WAAWrR,UAChB7rE,EAEE+mH,EAAoBt7H,KAAQuU,EAAKk9E,WAAWrR,UAC5C5tE,EAAWlV,GAAe89H,EAAWp7H,GAAQo7H,EAAUp7H,QAAQjC,EAE/DwjG,EAAW,WAEf,MAAMtiF,EAAe,CAAC,EACtB7kB,EAAQ6kB,aACL9a,IAAIqb,IACJ7gB,SAAQ8gB,IACP,GAAIA,EAAWnC,SAAS,KACtB,MAAM,IAAIxM,MAAM,8DACH0xB,KAAKjH,UAAU9b,IAGX,SAAfA,EACFR,EAAa1K,KAAOA,EACI,sBAAfkL,EACTR,EAAaugE,kBAAoBjrE,EAAKk9E,WAAWjS,kBACzB,YAAf//D,EACTR,EAAa4iF,QAAUttF,EAEvB0K,EAAaQ,GAAclL,EAAKkL,EAClC,IAGJ,MAAM87G,EAA2BnhI,EAAQ6kB,GAEzC,GAAIs8G,GAA0C,mBAAvBA,EAASn7C,UAC9B,MAAM,IAAItvE,MAAM,gJAIlB,QAAiB/S,IAAbyU,GAA0B/P,EAAQ8P,SACpC,OAAOgpH,EAGT,GAAI76H,EAAM0B,gBAAgBoQ,IAAa9R,EAAM0B,gBAAgBm5H,GAE3D,OAAO76H,EAAM8R,EAAU+oH,GAGzB,GAAI94H,EAAQq4H,OAEV,OAAOtoH,EAEP,MAAM,IAAI1B,MAAM,kBAAoB9Q,EAAO,oBAE/C,EAEMw7H,EAA+B,QAAzBN,EAAe,QAAfC,EAAG/gI,EAAQ8kB,YAAI,IAAAi8G,OAAA,EAAZA,EAAcprF,gBAAQ,IAAAmrF,EAAAA,EAAI,GACnCO,EAAiBJ,EAA2BjhI,IAyEpD,SAAsCA,GACpC,QAAQA,EAAQmI,GAAG+a,SAAS,MACzBhgB,GAAeo+H,EAAQthI,EAAQmI,KAC9BnI,EAAQ8kB,MAAS9kB,EAAQ8kB,KAAK0G,QACpC,CA5EI+1G,CAA4BvhI,GACxBwhI,EAAgBrnH,EAAKk9E,WAAWjS,kBAGjCplF,EAAQ8kB,OAA8B,IAAtB9kB,EAAQ8kB,KAAKP,MAehCy8G,EAAUp7H,GAAQuhG,IACdi6B,IAAQJ,EAAUI,GAAUJ,EAAUp7H,IAGtCwS,GAAY8oH,GACdN,EAAiBh7H,GACbw7H,GAAQR,EAAiBQ,IAEzBC,IACF98G,GAAKi9G,EAAe57H,GAAM,IAAMo7H,EAAUp7H,KACtCw7H,GAAQ78G,GAAKi9G,EAAeJ,GAAQ,IAAMJ,EAAUp7H,QAxB5D2e,GAAKy8G,EAAWp7H,EAAMuhG,GAClBi6B,GAAQ78G,GAAKy8G,EAAWI,EAAQj6B,GAGhC/uF,GAAY8oH,GACdN,EAAiBh7H,GACbw7H,GAAQR,EAAiBQ,IAEzBC,IACF98G,GAAKi9G,EAAe57H,GAAM,IAAMo7H,EAAUp7H,KACtCw7H,GAAQ78G,GAAKi9G,EAAeJ,GAAQ,IAAMJ,EAAUp7H,OAoB9Dm6H,EAAkBn6H,GAAQ5F,EAE1Bma,EAAKV,KAAK,SAAU7T,EAAMuhG,EAC5B,CA8BA,SAASw5B,EAAsB/6H,GAC7B,OAAQ1C,GAAeo+H,EAAQ17H,EACjC,CAQA,SAASq7H,EAA4BjhI,GACnC,YAAoB2D,IAAZ3D,QACW2D,IAAjB3D,EAAQ8kB,OAC6B,IAArC9kB,EAAQ8kB,KAAKg3G,sBAAiC,CAClD,CAGA,MAAMwF,EAAS,CACbjqC,YAAY,EACZ3wF,MAAM,EACN8gG,MAAM,EACNt5C,OAAO,EACP3iC,MAAM,EACN4iD,OAAO,GAGT,OA3UA,SAAqBgvB,EAAW90F,GAC9B,MAAMsrB,EAAM7wB,UAAU1B,OACtB,GAAY,IAARuyB,GAAqB,IAARA,EACf,MAAM,IAAIsoB,GAAe,SAAUtoB,EAAK,EAAG,GAGxCtrB,IACHA,EAAU,CAAC,GAgCb,MAAMo5H,EAAa,CAAC,GA7BpB,SAASC,EAAgBD,EAAY55H,EAAOjC,GAC1C,GAAIE,MAAMC,QAAQ8B,GAChBA,EAAMtD,SAAQgT,GAAQmqH,EAAeD,EAAYlqH,UAC5C,GAAIwJ,EAASlZ,IA6RG,iBADRuX,EA5RwBvX,IA6R2B,WAA/BuX,EAAON,OAAOC,aA5R/C,IAAK,MAAMnZ,KAAQiC,EACb3E,GAAe2E,EAAOjC,IACxB87H,EAAeD,EAAY55H,EAAMjC,GAAOA,QAGvC,GAAI6f,GAAU5d,SAAmBlE,IAATiC,EAAoB,CACjD,MAAM+7H,EAAWl8G,GAAU5d,GACvBo5H,EAA2Bp5H,GACxBA,EAAMM,GAAK,aACZN,EAAMM,GACRvC,EAGJ,GAAI1C,GAAeu+H,EAAYE,IAAaF,EAAWE,KAAc95H,IAAUQ,EAAQq4H,OACrF,MAAM,IAAIhqH,MAAM,kBAAoBirH,EAAW,WAGjDF,EAAWE,GAAY95H,CACzB,MACE,IAAKQ,EAAQq4H,OACX,MAAM,IAAI35H,UAAU,sCAuQ5B,IAAmBqY,CApQjB,CAGAsiH,CAAeD,EAAYtkC,GAE3B,IAAK,MAAMv3F,KAAQ67H,EACjB,GAAIv+H,GAAeu+H,EAAY77H,GAAO,CAEpC,MAAMiC,EAAQ45H,EAAW77H,GAEzB,GAAI6f,GAAU5d,GAIZg5H,EAAeh5H,EAAOQ,QACjB,GAwOc,mBADD+W,EAvOOvX,IAyOT,iBAAXuX,GACW,iBAAXA,GACW,kBAAXA,GACI,OAAXA,GACAkC,EAAOlC,IACPgC,EAAUhC,IACV6B,EAAY7B,IACZiC,EAAWjC,IACXoC,EAASpC,IACTtZ,MAAMC,QAAQqZ,GAjPZ+gH,EAAQv6H,EAAMiC,EAAOQ,QAErB,IAAKA,EAAQq4H,OACX,MAAM,IAAI35H,UAAU,qCAG1B,CAgOJ,IAA0BqY,CA9N1B,CA+QF,CF1KyBwiH,CAAc5B,EA7CrC,EA6CsD7lH,EAAM4lH,GA8B5D,OA7BA5lH,EAAK4xF,OAASk0B,EAId9lH,EAAKhB,GAAG,UAAU,KAChBxW,OAAOwd,OAAO4/G,GAAmBx7H,SAAQvE,IACnCA,GAAWA,EAAQ8kB,MAAQ9kB,EAAQ8kB,KAAKyzG,wBAG1C0H,EAAejgI,EAAS,CAAEmY,UAAU,GACtC,GACA,IAKJgC,EAAK3U,OAASA,EAAO+6B,KAAK,KAAMo/F,GAGhCxlH,EAAKna,QAAUA,GAIfma,EAAK4xF,OAAOppG,OAAOwd,OAAOgE,GAAYw7G,KAEtCxlH,EAAK8hC,eAAiBA,GACtB9hC,EAAKunB,eAAiBA,GACtBvnB,EAAK0nB,WAAaA,GAEX1nB,CACT,CD3PA,CAAsBm8B,E","sources":["webpack://math/webpack/universalModuleDefinition","webpack://math/./node_modules/seedrandom/lib/xorwow.js","webpack://math/./node_modules/seedrandom/lib/xorshift7.js","webpack://math/./node_modules/escape-latex/dist/index.js","webpack://math/./node_modules/seedrandom/lib/alea.js","webpack://math/./node_modules/seedrandom/lib/xor128.js","webpack://math/./node_modules/typed-function/lib/umd/typed-function.js","webpack://math/./node_modules/seedrandom/index.js","webpack://math/./node_modules/tiny-emitter/index.js","webpack://math/./node_modules/seedrandom/lib/tychei.js","webpack://math/./node_modules/seedrandom/seedrandom.js","webpack://math/./node_modules/seedrandom/lib/xor4096.js","webpack://math/./node_modules/javascript-natural-sort/naturalSort.js","webpack://math/webpack/bootstrap","webpack://math/webpack/runtime/amd define","webpack://math/webpack/runtime/amd options","webpack://math/webpack/runtime/define property getters","webpack://math/webpack/runtime/hasOwnProperty shorthand","webpack://math/webpack/runtime/make namespace object","webpack://math/webpack/runtime/node module decorator","webpack://math/./src/utils/customs.js","webpack://math/./src/utils/map.js","webpack://math/./src/utils/is.js","webpack://math/./src/utils/object.js","webpack://math/./src/utils/factory.js","webpack://math/./src/utils/number.js","webpack://math/./src/core/function/typed.js","webpack://math/./src/type/resultset/ResultSet.js","webpack://math/./node_modules/decimal.js/decimal.mjs","webpack://math/./src/type/bignumber/BigNumber.js","webpack://math/./node_modules/complex.js/dist/complex.mjs","webpack://math/./src/type/complex/Complex.js","webpack://math/./node_modules/fraction.js/dist/fraction.mjs","webpack://math/./src/type/fraction/Fraction.js","webpack://math/./src/type/matrix/Range.js","webpack://math/./src/type/matrix/Matrix.js","webpack://math/./node_modules/@babel/runtime/helpers/esm/extends.js","webpack://math/./src/utils/bignumber/formatter.js","webpack://math/./src/utils/string.js","webpack://math/./src/error/DimensionError.js","webpack://math/./src/error/IndexError.js","webpack://math/./src/utils/array.js","webpack://math/./src/utils/optimizeCallback.js","webpack://math/./src/type/matrix/DenseMatrix.js","webpack://math/./src/function/utils/clone.js","webpack://math/./src/utils/switch.js","webpack://math/./src/utils/collection.js","webpack://math/./src/function/utils/isInteger.js","webpack://math/./src/plain/number/utils.js","webpack://math/./src/utils/bignumber/nearlyEqual.js","webpack://math/./src/function/utils/isNegative.js","webpack://math/./src/function/utils/isNumeric.js","webpack://math/./src/function/utils/hasNumericValue.js","webpack://math/./src/function/utils/isPositive.js","webpack://math/./src/function/utils/isZero.js","webpack://math/./src/function/utils/isNaN.js","webpack://math/./src/function/utils/typeOf.js","webpack://math/./src/function/relational/compareUnits.js","webpack://math/./src/function/relational/equalScalar.js","webpack://math/./src/utils/complex.js","webpack://math/./src/type/matrix/SparseMatrix.js","webpack://math/./src/type/number.js","webpack://math/./src/type/bigint.js","webpack://math/./src/type/string.js","webpack://math/./src/type/boolean.js","webpack://math/./src/type/bignumber/function/bignumber.js","webpack://math/./src/type/complex/function/complex.js","webpack://math/./src/type/fraction/function/fraction.js","webpack://math/./src/type/matrix/function/matrix.js","webpack://math/./src/function/matrix/matrixFromFunction.js","webpack://math/./src/function/matrix/matrixFromRows.js","webpack://math/./src/function/matrix/matrixFromColumns.js","webpack://math/./src/type/unit/function/splitUnit.js","webpack://math/./src/plain/number/arithmetic.js","webpack://math/./src/function/arithmetic/unaryMinus.js","webpack://math/./src/function/arithmetic/unaryPlus.js","webpack://math/./src/function/arithmetic/abs.js","webpack://math/./src/function/matrix/mapSlices.js","webpack://math/./src/function/arithmetic/addScalar.js","webpack://math/./src/function/arithmetic/subtractScalar.js","webpack://math/./src/function/arithmetic/cbrt.js","webpack://math/./src/type/matrix/utils/matAlgo11xS0s.js","webpack://math/./src/type/matrix/utils/matAlgo12xSfs.js","webpack://math/./src/type/matrix/utils/matAlgo14xDs.js","webpack://math/./src/function/arithmetic/ceil.js","webpack://math/./src/function/arithmetic/cube.js","webpack://math/./src/function/arithmetic/exp.js","webpack://math/./src/function/arithmetic/expm1.js","webpack://math/./src/function/arithmetic/fix.js","webpack://math/./src/function/arithmetic/floor.js","webpack://math/./src/type/matrix/utils/matAlgo02xDS0.js","webpack://math/./src/type/matrix/utils/matAlgo03xDSf.js","webpack://math/./src/type/matrix/utils/matAlgo05xSfSf.js","webpack://math/./src/type/matrix/utils/matAlgo13xDD.js","webpack://math/./src/type/matrix/utils/broadcast.js","webpack://math/./src/type/matrix/utils/matrixAlgorithmSuite.js","webpack://math/./src/function/arithmetic/mod.js","webpack://math/./src/type/matrix/utils/matAlgo01xDSid.js","webpack://math/./src/type/matrix/utils/matAlgo04xSidSid.js","webpack://math/./src/type/matrix/utils/matAlgo10xSids.js","webpack://math/./src/error/ArgumentsError.js","webpack://math/./src/function/arithmetic/gcd.js","webpack://math/./src/type/matrix/utils/matAlgo06xS0S0.js","webpack://math/./src/function/arithmetic/lcm.js","webpack://math/./src/utils/bigint.js","webpack://math/./src/function/arithmetic/log10.js","webpack://math/./src/function/arithmetic/log2.js","webpack://math/./src/function/arithmetic/multiplyScalar.js","webpack://math/./src/function/arithmetic/multiply.js","webpack://math/./src/function/arithmetic/nthRoot.js","webpack://math/./src/function/arithmetic/sign.js","webpack://math/./src/function/arithmetic/sqrt.js","webpack://math/./src/function/arithmetic/square.js","webpack://math/./src/function/arithmetic/subtract.js","webpack://math/./src/function/arithmetic/xgcd.js","webpack://math/./src/function/arithmetic/invmod.js","webpack://math/./src/type/matrix/utils/matAlgo09xS0Sf.js","webpack://math/./src/function/arithmetic/dotMultiply.js","webpack://math/./src/utils/bignumber/bitwise.js","webpack://math/./src/plain/number/bitwise.js","webpack://math/./src/function/bitwise/bitAnd.js","webpack://math/./src/function/bitwise/bitNot.js","webpack://math/./src/function/bitwise/bitOr.js","webpack://math/./src/type/matrix/utils/matAlgo07xSSf.js","webpack://math/./src/function/bitwise/bitXor.js","webpack://math/./src/function/complex/arg.js","webpack://math/./src/function/complex/conj.js","webpack://math/./src/function/complex/im.js","webpack://math/./src/function/complex/re.js","webpack://math/./src/plain/number/logical.js","webpack://math/./src/function/logical/not.js","webpack://math/./src/function/logical/nullish.js","webpack://math/./src/function/logical/or.js","webpack://math/./src/function/logical/xor.js","webpack://math/./src/function/matrix/concat.js","webpack://math/./src/function/matrix/column.js","webpack://math/./src/function/matrix/count.js","webpack://math/./src/function/matrix/cross.js","webpack://math/./src/function/matrix/diag.js","webpack://math/./src/function/matrix/filter.js","webpack://math/./src/function/matrix/flatten.js","webpack://math/./src/function/matrix/forEach.js","webpack://math/./src/function/matrix/getMatrixDataType.js","webpack://math/./src/function/matrix/identity.js","webpack://math/./src/function/matrix/kron.js","webpack://math/./src/function/matrix/map.js","webpack://math/./src/function/matrix/diff.js","webpack://math/./src/function/matrix/ones.js","webpack://math/./src/utils/noop.js","webpack://math/./src/function/matrix/range.js","webpack://math/./src/function/matrix/reshape.js","webpack://math/./src/function/matrix/resize.js","webpack://math/./src/function/matrix/rotate.js","webpack://math/./src/function/matrix/rotationMatrix.js","webpack://math/./src/function/matrix/row.js","webpack://math/./src/function/matrix/size.js","webpack://math/./src/function/matrix/squeeze.js","webpack://math/./src/function/matrix/subset.js","webpack://math/./src/function/matrix/transpose.js","webpack://math/./src/function/matrix/ctranspose.js","webpack://math/./src/function/matrix/zeros.js","webpack://math/./src/function/matrix/fft.js","webpack://math/./src/function/matrix/ifft.js","webpack://math/./src/function/numeric/solveODE.js","webpack://math/./src/function/special/erf.js","webpack://math/./src/function/special/zeta.js","webpack://math/./src/function/statistics/mode.js","webpack://math/./src/function/statistics/utils/improveErrorMessage.js","webpack://math/./src/function/statistics/prod.js","webpack://math/./src/function/string/format.js","webpack://math/./src/function/string/bin.js","webpack://math/./src/function/string/oct.js","webpack://math/./src/function/string/hex.js","webpack://math/./src/utils/print.js","webpack://math/./src/function/string/print.js","webpack://math/./src/function/unit/to.js","webpack://math/./src/function/unit/toBest.js","webpack://math/./src/function/utils/isPrime.js","webpack://math/./src/function/utils/numeric.js","webpack://math/./src/function/arithmetic/divideScalar.js","webpack://math/./src/function/arithmetic/pow.js","webpack://math/./src/function/arithmetic/round.js","webpack://math/./src/function/arithmetic/log.js","webpack://math/./src/function/arithmetic/log1p.js","webpack://math/./src/function/arithmetic/nthRoots.js","webpack://math/./src/function/arithmetic/dotPow.js","webpack://math/./src/function/arithmetic/dotDivide.js","webpack://math/./src/function/algebra/solver/utils/solveValidation.js","webpack://math/./src/function/algebra/solver/lsolve.js","webpack://math/./src/function/algebra/solver/usolve.js","webpack://math/./src/function/algebra/solver/lsolveAll.js","webpack://math/./src/function/algebra/solver/usolveAll.js","webpack://math/./src/type/matrix/utils/matAlgo08xS0Sid.js","webpack://math/./src/function/bitwise/useMatrixForArrayScalar.js","webpack://math/./src/function/bitwise/leftShift.js","webpack://math/./src/function/bitwise/rightArithShift.js","webpack://math/./src/function/bitwise/rightLogShift.js","webpack://math/./src/function/logical/and.js","webpack://math/./src/function/relational/compare.js","webpack://math/./src/function/relational/compareNatural.js","webpack://math/./src/function/relational/compareText.js","webpack://math/./src/function/relational/equal.js","webpack://math/./src/function/relational/equalText.js","webpack://math/./src/function/relational/smaller.js","webpack://math/./src/function/relational/smallerEq.js","webpack://math/./src/function/relational/larger.js","webpack://math/./src/function/relational/largerEq.js","webpack://math/./src/function/relational/deepEqual.js","webpack://math/./src/function/relational/unequal.js","webpack://math/./src/function/matrix/partitionSelect.js","webpack://math/./src/function/matrix/sort.js","webpack://math/./src/function/statistics/max.js","webpack://math/./src/function/statistics/min.js","webpack://math/./src/type/matrix/ImmutableDenseMatrix.js","webpack://math/./src/type/matrix/MatrixIndex.js","webpack://math/./src/type/matrix/FibonacciHeap.js","webpack://math/./src/type/matrix/Spa.js","webpack://math/./src/utils/lruQueue.js","webpack://math/./src/utils/function.js","webpack://math/./src/utils/bignumber/constants.js","webpack://math/./src/type/unit/Unit.js","webpack://math/./src/type/unit/function/unit.js","webpack://math/./src/type/matrix/function/sparse.js","webpack://math/./src/type/unit/function/createUnit.js","webpack://math/./src/function/trigonometry/acos.js","webpack://math/./src/plain/number/trigonometry.js","webpack://math/./src/function/trigonometry/acosh.js","webpack://math/./src/function/trigonometry/acot.js","webpack://math/./src/function/trigonometry/acoth.js","webpack://math/./src/function/trigonometry/acsc.js","webpack://math/./src/function/trigonometry/acsch.js","webpack://math/./src/function/trigonometry/asec.js","webpack://math/./src/function/trigonometry/asech.js","webpack://math/./src/function/trigonometry/asin.js","webpack://math/./src/function/trigonometry/asinh.js","webpack://math/./src/function/trigonometry/atan.js","webpack://math/./src/function/trigonometry/atan2.js","webpack://math/./src/function/trigonometry/atanh.js","webpack://math/./src/function/trigonometry/trigUnit.js","webpack://math/./src/function/trigonometry/cos.js","webpack://math/./src/function/trigonometry/cosh.js","webpack://math/./src/function/trigonometry/cot.js","webpack://math/./src/function/trigonometry/coth.js","webpack://math/./src/function/trigonometry/csc.js","webpack://math/./src/function/trigonometry/csch.js","webpack://math/./src/function/trigonometry/sec.js","webpack://math/./src/function/trigonometry/sech.js","webpack://math/./src/function/trigonometry/sin.js","webpack://math/./src/function/trigonometry/sinh.js","webpack://math/./src/function/trigonometry/tan.js","webpack://math/./src/function/trigonometry/tanh.js","webpack://math/./src/function/set/setCartesian.js","webpack://math/./src/function/set/setDifference.js","webpack://math/./src/function/set/setDistinct.js","webpack://math/./src/function/set/setIntersect.js","webpack://math/./src/function/set/setIsSubset.js","webpack://math/./src/function/set/setMultiplicity.js","webpack://math/./src/function/set/setPowerset.js","webpack://math/./src/function/set/setSize.js","webpack://math/./src/function/set/setSymDifference.js","webpack://math/./src/function/set/setUnion.js","webpack://math/./src/function/arithmetic/add.js","webpack://math/./src/function/arithmetic/hypot.js","webpack://math/./src/function/arithmetic/norm.js","webpack://math/./src/function/matrix/dot.js","webpack://math/./src/function/matrix/trace.js","webpack://math/./src/type/matrix/function/index.js","webpack://math/./src/expression/keywords.js","webpack://math/./src/expression/node/Node.js","webpack://math/./node_modules/@babel/runtime/helpers/esm/typeof.js","webpack://math/./node_modules/@babel/runtime/helpers/esm/defineProperty.js","webpack://math/./node_modules/@babel/runtime/helpers/esm/toPropertyKey.js","webpack://math/./node_modules/@babel/runtime/helpers/esm/toPrimitive.js","webpack://math/./src/expression/transform/utils/errorTransform.js","webpack://math/./src/expression/node/utils/access.js","webpack://math/./src/expression/node/AccessorNode.js","webpack://math/./src/expression/node/ArrayNode.js","webpack://math/./src/expression/operators.js","webpack://math/./src/expression/node/AssignmentNode.js","webpack://math/./src/expression/node/utils/assign.js","webpack://math/./src/expression/node/BlockNode.js","webpack://math/./src/expression/node/ConditionalNode.js","webpack://math/./src/utils/latex.js","webpack://math/./src/expression/node/ConstantNode.js","webpack://math/./src/expression/node/FunctionAssignmentNode.js","webpack://math/./src/expression/node/IndexNode.js","webpack://math/./src/expression/node/ObjectNode.js","webpack://math/./src/utils/scope.js","webpack://math/./src/expression/node/OperatorNode.js","webpack://math/./src/expression/node/ParenthesisNode.js","webpack://math/./src/expression/node/RangeNode.js","webpack://math/./src/expression/node/RelationalNode.js","webpack://math/./src/expression/node/SymbolNode.js","webpack://math/./src/expression/node/FunctionNode.js","webpack://math/./src/expression/parse.js","webpack://math/./src/expression/function/compile.js","webpack://math/./src/expression/function/evaluate.js","webpack://math/./src/expression/Parser.js","webpack://math/./src/expression/function/parser.js","webpack://math/./src/function/algebra/decomposition/lup.js","webpack://math/./src/function/algebra/decomposition/qr.js","webpack://math/./src/function/algebra/sparse/csTdfs.js","webpack://math/./src/function/algebra/sparse/csFlip.js","webpack://math/./src/function/algebra/sparse/csAmd.js","webpack://math/./src/function/algebra/sparse/csFkeep.js","webpack://math/./src/function/algebra/sparse/csLeaf.js","webpack://math/./src/function/algebra/sparse/csCounts.js","webpack://math/./src/function/algebra/sparse/csSqr.js","webpack://math/./src/function/algebra/sparse/csPermute.js","webpack://math/./src/function/algebra/sparse/csEtree.js","webpack://math/./src/function/algebra/sparse/csPost.js","webpack://math/./src/function/algebra/sparse/csMarked.js","webpack://math/./src/function/algebra/sparse/csMark.js","webpack://math/./src/function/algebra/sparse/csUnflip.js","webpack://math/./src/function/algebra/sparse/csDfs.js","webpack://math/./src/function/algebra/sparse/csSpsolve.js","webpack://math/./src/function/algebra/sparse/csReach.js","webpack://math/./src/function/algebra/sparse/csLu.js","webpack://math/./src/function/algebra/decomposition/slu.js","webpack://math/./src/function/algebra/sparse/csIpvec.js","webpack://math/./src/function/algebra/solver/lusolve.js","webpack://math/./src/function/algebra/polynomialRoot.js","webpack://math/./src/expression/Help.js","webpack://math/./src/type/chain/Chain.js","webpack://math/./src/expression/embeddedDocs/constants/e.js","webpack://math/./src/expression/embeddedDocs/constants/pi.js","webpack://math/./src/expression/embeddedDocs/embeddedDocs.js","webpack://math/./src/expression/embeddedDocs/construction/bignumber.js","webpack://math/./src/expression/embeddedDocs/construction/bigint.js","webpack://math/./src/expression/embeddedDocs/construction/boolean.js","webpack://math/./src/expression/embeddedDocs/construction/complex.js","webpack://math/./src/expression/embeddedDocs/construction/createUnit.js","webpack://math/./src/expression/embeddedDocs/construction/fraction.js","webpack://math/./src/expression/embeddedDocs/construction/index.js","webpack://math/./src/expression/embeddedDocs/construction/matrix.js","webpack://math/./src/expression/embeddedDocs/construction/number.js","webpack://math/./src/expression/embeddedDocs/construction/sparse.js","webpack://math/./src/expression/embeddedDocs/construction/splitUnit.js","webpack://math/./src/expression/embeddedDocs/construction/string.js","webpack://math/./src/expression/embeddedDocs/construction/unit.js","webpack://math/./src/expression/embeddedDocs/constants/false.js","webpack://math/./src/expression/embeddedDocs/constants/i.js","webpack://math/./src/expression/embeddedDocs/constants/Infinity.js","webpack://math/./src/expression/embeddedDocs/constants/LN2.js","webpack://math/./src/expression/embeddedDocs/constants/LN10.js","webpack://math/./src/expression/embeddedDocs/constants/LOG2E.js","webpack://math/./src/expression/embeddedDocs/constants/LOG10E.js","webpack://math/./src/expression/embeddedDocs/constants/NaN.js","webpack://math/./src/expression/embeddedDocs/constants/null.js","webpack://math/./src/expression/embeddedDocs/constants/phi.js","webpack://math/./src/expression/embeddedDocs/constants/SQRT1_2.js","webpack://math/./src/expression/embeddedDocs/constants/SQRT2.js","webpack://math/./src/expression/embeddedDocs/constants/tau.js","webpack://math/./src/expression/embeddedDocs/constants/true.js","webpack://math/./src/expression/embeddedDocs/constants/version.js","webpack://math/./src/expression/embeddedDocs/function/algebra/derivative.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lsolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lsolveAll.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lup.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lusolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/leafCount.js","webpack://math/./src/expression/embeddedDocs/function/algebra/polynomialRoot.js","webpack://math/./src/expression/embeddedDocs/function/algebra/resolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/simplify.js","webpack://math/./src/expression/embeddedDocs/function/algebra/simplifyConstant.js","webpack://math/./src/expression/embeddedDocs/function/algebra/simplifyCore.js","webpack://math/./src/expression/embeddedDocs/function/algebra/symbolicEqual.js","webpack://math/./src/expression/embeddedDocs/function/algebra/rationalize.js","webpack://math/./src/expression/embeddedDocs/function/algebra/slu.js","webpack://math/./src/expression/embeddedDocs/function/algebra/usolve.js","webpack://math/./src/expression/embeddedDocs/function/algebra/usolveAll.js","webpack://math/./src/expression/embeddedDocs/function/algebra/qr.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/abs.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/add.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/cbrt.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/ceil.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/cube.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/divide.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotDivide.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotMultiply.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/dotPow.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/exp.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/expm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/expm1.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/fix.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/floor.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/gcd.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/hypot.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/lcm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log2.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log1p.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/log10.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/mod.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/multiply.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/norm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/nthRoot.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/nthRoots.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/pow.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/round.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sign.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sqrt.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/sqrtm.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/square.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/subtract.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/unaryMinus.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/unaryPlus.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/xgcd.js","webpack://math/./src/expression/embeddedDocs/function/arithmetic/invmod.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitAnd.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitNot.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitOr.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/bitXor.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/leftShift.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/rightArithShift.js","webpack://math/./src/expression/embeddedDocs/function/bitwise/rightLogShift.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/bellNumbers.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/catalan.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/composition.js","webpack://math/./src/expression/embeddedDocs/function/combinatorics/stirlingS2.js","webpack://math/./src/expression/embeddedDocs/core/config.js","webpack://math/./src/expression/embeddedDocs/core/import.js","webpack://math/./src/expression/embeddedDocs/core/typed.js","webpack://math/./src/expression/embeddedDocs/function/complex/arg.js","webpack://math/./src/expression/embeddedDocs/function/complex/conj.js","webpack://math/./src/expression/embeddedDocs/function/complex/re.js","webpack://math/./src/expression/embeddedDocs/function/complex/im.js","webpack://math/./src/expression/embeddedDocs/function/expression/evaluate.js","webpack://math/./src/expression/embeddedDocs/function/expression/help.js","webpack://math/./src/expression/embeddedDocs/function/expression/parse.js","webpack://math/./src/expression/embeddedDocs/function/expression/parser.js","webpack://math/./src/expression/embeddedDocs/function/expression/compile.js","webpack://math/./src/expression/embeddedDocs/function/geometry/distance.js","webpack://math/./src/expression/embeddedDocs/function/geometry/intersect.js","webpack://math/./src/expression/embeddedDocs/function/logical/and.js","webpack://math/./src/expression/embeddedDocs/function/logical/not.js","webpack://math/./src/expression/embeddedDocs/function/logical/nullish.js","webpack://math/./src/expression/embeddedDocs/function/logical/or.js","webpack://math/./src/expression/embeddedDocs/function/logical/xor.js","webpack://math/./src/expression/embeddedDocs/function/matrix/mapSlices.js","webpack://math/./src/expression/embeddedDocs/function/matrix/concat.js","webpack://math/./src/expression/embeddedDocs/function/matrix/count.js","webpack://math/./src/expression/embeddedDocs/function/matrix/cross.js","webpack://math/./src/expression/embeddedDocs/function/matrix/column.js","webpack://math/./src/expression/embeddedDocs/function/matrix/ctranspose.js","webpack://math/./src/expression/embeddedDocs/function/matrix/det.js","webpack://math/./src/expression/embeddedDocs/function/matrix/diag.js","webpack://math/./src/expression/embeddedDocs/function/matrix/diff.js","webpack://math/./src/expression/embeddedDocs/function/matrix/dot.js","webpack://math/./src/expression/embeddedDocs/function/matrix/getMatrixDataType.js","webpack://math/./src/expression/embeddedDocs/function/matrix/identity.js","webpack://math/./src/expression/embeddedDocs/function/matrix/filter.js","webpack://math/./src/expression/embeddedDocs/function/matrix/flatten.js","webpack://math/./src/expression/embeddedDocs/function/matrix/forEach.js","webpack://math/./src/expression/embeddedDocs/function/matrix/inv.js","webpack://math/./src/expression/embeddedDocs/function/matrix/pinv.js","webpack://math/./src/expression/embeddedDocs/function/matrix/eigs.js","webpack://math/./src/expression/embeddedDocs/function/matrix/kron.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromFunction.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromRows.js","webpack://math/./src/expression/embeddedDocs/function/matrix/matrixFromColumns.js","webpack://math/./src/expression/embeddedDocs/function/matrix/map.js","webpack://math/./src/expression/embeddedDocs/function/matrix/ones.js","webpack://math/./src/expression/embeddedDocs/function/matrix/partitionSelect.js","webpack://math/./src/expression/embeddedDocs/function/matrix/range.js","webpack://math/./src/expression/embeddedDocs/function/matrix/resize.js","webpack://math/./src/expression/embeddedDocs/function/matrix/reshape.js","webpack://math/./src/expression/embeddedDocs/function/matrix/rotate.js","webpack://math/./src/expression/embeddedDocs/function/matrix/rotationMatrix.js","webpack://math/./src/expression/embeddedDocs/function/matrix/row.js","webpack://math/./src/expression/embeddedDocs/function/matrix/size.js","webpack://math/./src/expression/embeddedDocs/function/matrix/sort.js","webpack://math/./src/expression/embeddedDocs/function/matrix/squeeze.js","webpack://math/./src/expression/embeddedDocs/function/matrix/subset.js","webpack://math/./src/expression/embeddedDocs/function/matrix/trace.js","webpack://math/./src/expression/embeddedDocs/function/matrix/transpose.js","webpack://math/./src/expression/embeddedDocs/function/matrix/zeros.js","webpack://math/./src/expression/embeddedDocs/function/matrix/fft.js","webpack://math/./src/expression/embeddedDocs/function/matrix/ifft.js","webpack://math/./src/expression/embeddedDocs/function/algebra/sylvester.js","webpack://math/./src/expression/embeddedDocs/function/algebra/schur.js","webpack://math/./src/expression/embeddedDocs/function/algebra/lyap.js","webpack://math/./src/expression/embeddedDocs/function/numeric/solveODE.js","webpack://math/./src/expression/embeddedDocs/function/probability/combinations.js","webpack://math/./src/expression/embeddedDocs/function/probability/combinationsWithRep.js","webpack://math/./src/expression/embeddedDocs/function/probability/factorial.js","webpack://math/./src/expression/embeddedDocs/function/probability/gamma.js","webpack://math/./src/expression/embeddedDocs/function/probability/kldivergence.js","webpack://math/./src/expression/embeddedDocs/function/probability/lgamma.js","webpack://math/./src/expression/embeddedDocs/function/probability/multinomial.js","webpack://math/./src/expression/embeddedDocs/function/probability/permutations.js","webpack://math/./src/expression/embeddedDocs/function/probability/pickRandom.js","webpack://math/./src/expression/embeddedDocs/function/probability/random.js","webpack://math/./src/expression/embeddedDocs/function/probability/randomInt.js","webpack://math/./src/expression/embeddedDocs/function/relational/compare.js","webpack://math/./src/expression/embeddedDocs/function/relational/compareNatural.js","webpack://math/./src/expression/embeddedDocs/function/relational/compareText.js","webpack://math/./src/expression/embeddedDocs/function/relational/deepEqual.js","webpack://math/./src/expression/embeddedDocs/function/relational/equal.js","webpack://math/./src/expression/embeddedDocs/function/relational/equalText.js","webpack://math/./src/expression/embeddedDocs/function/relational/larger.js","webpack://math/./src/expression/embeddedDocs/function/relational/largerEq.js","webpack://math/./src/expression/embeddedDocs/function/relational/smaller.js","webpack://math/./src/expression/embeddedDocs/function/relational/smallerEq.js","webpack://math/./src/expression/embeddedDocs/function/relational/unequal.js","webpack://math/./src/expression/embeddedDocs/function/set/setCartesian.js","webpack://math/./src/expression/embeddedDocs/function/set/setDifference.js","webpack://math/./src/expression/embeddedDocs/function/set/setDistinct.js","webpack://math/./src/expression/embeddedDocs/function/set/setIntersect.js","webpack://math/./src/expression/embeddedDocs/function/set/setIsSubset.js","webpack://math/./src/expression/embeddedDocs/function/set/setMultiplicity.js","webpack://math/./src/expression/embeddedDocs/function/set/setPowerset.js","webpack://math/./src/expression/embeddedDocs/function/set/setSize.js","webpack://math/./src/expression/embeddedDocs/function/set/setSymDifference.js","webpack://math/./src/expression/embeddedDocs/function/set/setUnion.js","webpack://math/./src/expression/embeddedDocs/function/signal/zpk2tf.js","webpack://math/./src/expression/embeddedDocs/function/signal/freqz.js","webpack://math/./src/expression/embeddedDocs/function/special/erf.js","webpack://math/./src/expression/embeddedDocs/function/special/zeta.js","webpack://math/./src/expression/embeddedDocs/function/statistics/cumsum.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mad.js","webpack://math/./src/expression/embeddedDocs/function/statistics/max.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mean.js","webpack://math/./src/expression/embeddedDocs/function/statistics/median.js","webpack://math/./src/expression/embeddedDocs/function/statistics/min.js","webpack://math/./src/expression/embeddedDocs/function/statistics/mode.js","webpack://math/./src/expression/embeddedDocs/function/statistics/prod.js","webpack://math/./src/expression/embeddedDocs/function/statistics/quantileSeq.js","webpack://math/./src/expression/embeddedDocs/function/statistics/std.js","webpack://math/./src/expression/embeddedDocs/function/statistics/sum.js","webpack://math/./src/expression/embeddedDocs/function/statistics/variance.js","webpack://math/./src/expression/embeddedDocs/function/statistics/corr.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acos.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acosh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acot.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acoth.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acsc.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/acsch.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asec.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asech.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asin.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/asinh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atan.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atanh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/atan2.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cos.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cosh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/cot.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/coth.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/csc.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/csch.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sec.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sech.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sin.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/sinh.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/tan.js","webpack://math/./src/expression/embeddedDocs/function/trigonometry/tanh.js","webpack://math/./src/expression/embeddedDocs/function/units/to.js","webpack://math/./src/expression/embeddedDocs/function/units/toBest.js","webpack://math/./src/expression/embeddedDocs/function/utils/clone.js","webpack://math/./src/expression/embeddedDocs/function/utils/format.js","webpack://math/./src/expression/embeddedDocs/function/utils/bin.js","webpack://math/./src/expression/embeddedDocs/function/utils/oct.js","webpack://math/./src/expression/embeddedDocs/function/utils/hex.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNaN.js","webpack://math/./src/expression/embeddedDocs/function/utils/isInteger.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNegative.js","webpack://math/./src/expression/embeddedDocs/function/utils/isNumeric.js","webpack://math/./src/expression/embeddedDocs/function/utils/hasNumericValue.js","webpack://math/./src/expression/embeddedDocs/function/utils/isPositive.js","webpack://math/./src/expression/embeddedDocs/function/utils/isPrime.js","webpack://math/./src/expression/embeddedDocs/function/utils/isZero.js","webpack://math/./src/expression/embeddedDocs/function/utils/print.js","webpack://math/./src/expression/embeddedDocs/function/utils/typeOf.js","webpack://math/./src/expression/embeddedDocs/function/utils/numeric.js","webpack://math/./src/expression/function/help.js","webpack://math/./src/type/chain/function/chain.js","webpack://math/./src/function/matrix/det.js","webpack://math/./src/function/matrix/inv.js","webpack://math/./src/function/matrix/pinv.js","webpack://math/./src/function/matrix/eigs.js","webpack://math/./src/function/matrix/eigs/realSymmetric.js","webpack://math/./src/function/matrix/eigs/complexEigs.js","webpack://math/./src/function/matrix/expm.js","webpack://math/./src/function/matrix/sqrtm.js","webpack://math/./src/function/algebra/sylvester.js","webpack://math/./src/function/algebra/decomposition/schur.js","webpack://math/./src/function/algebra/lyap.js","webpack://math/./src/function/arithmetic/divide.js","webpack://math/./src/function/geometry/distance.js","webpack://math/./src/function/geometry/intersect.js","webpack://math/./src/function/statistics/sum.js","webpack://math/./src/function/statistics/cumsum.js","webpack://math/./src/function/statistics/mean.js","webpack://math/./src/function/statistics/median.js","webpack://math/./src/function/statistics/mad.js","webpack://math/./src/function/statistics/variance.js","webpack://math/./src/function/statistics/quantileSeq.js","webpack://math/./src/function/statistics/std.js","webpack://math/./src/function/statistics/corr.js","webpack://math/./src/utils/product.js","webpack://math/./src/plain/number/combinations.js","webpack://math/./src/function/probability/combinations.js","webpack://math/./src/function/probability/combinationsWithRep.js","webpack://math/./src/plain/number/probability.js","webpack://math/./src/function/probability/gamma.js","webpack://math/./src/function/probability/lgamma.js","webpack://math/./src/function/probability/factorial.js","webpack://math/./src/function/probability/kldivergence.js","webpack://math/./src/function/probability/multinomial.js","webpack://math/./src/function/probability/permutations.js","webpack://math/./src/function/probability/util/seededRNG.js","webpack://math/./src/function/probability/pickRandom.js","webpack://math/./src/function/probability/util/randomMatrix.js","webpack://math/./src/function/probability/random.js","webpack://math/./src/function/probability/randomInt.js","webpack://math/./src/function/combinatorics/stirlingS2.js","webpack://math/./src/function/combinatorics/bellNumbers.js","webpack://math/./src/function/combinatorics/catalan.js","webpack://math/./src/function/combinatorics/composition.js","webpack://math/./src/function/algebra/leafCount.js","webpack://math/./src/function/algebra/simplify/wildcards.js","webpack://math/./src/function/algebra/simplify/util.js","webpack://math/./src/function/algebra/simplify.js","webpack://math/./src/function/algebra/simplifyConstant.js","webpack://math/./src/function/algebra/simplifyCore.js","webpack://math/./src/function/algebra/resolve.js","webpack://math/./src/function/algebra/symbolicEqual.js","webpack://math/./src/function/algebra/derivative.js","webpack://math/./src/function/algebra/rationalize.js","webpack://math/./src/function/signal/zpk2tf.js","webpack://math/./src/function/signal/freqz.js","webpack://math/./src/json/reviver.js","webpack://math/./src/json/replacer.js","webpack://math/./src/plain/number/constants.js","webpack://math/./src/constants.js","webpack://math/./src/version.js","webpack://math/./src/type/unit/physicalConstants.js","webpack://math/./src/expression/transform/mapSlices.transform.js","webpack://math/./src/expression/transform/column.transform.js","webpack://math/./src/expression/transform/utils/compileInlineExpression.js","webpack://math/./src/expression/transform/utils/transformCallback.js","webpack://math/./src/expression/transform/filter.transform.js","webpack://math/./src/expression/transform/forEach.transform.js","webpack://math/./src/expression/transform/index.transform.js","webpack://math/./src/expression/transform/map.transform.js","webpack://math/./src/expression/transform/utils/lastDimToZeroBase.js","webpack://math/./src/expression/transform/utils/dimToZeroBase.js","webpack://math/./src/expression/transform/max.transform.js","webpack://math/./src/expression/transform/mean.transform.js","webpack://math/./src/expression/transform/min.transform.js","webpack://math/./src/expression/transform/range.transform.js","webpack://math/./src/expression/transform/row.transform.js","webpack://math/./src/expression/transform/subset.transform.js","webpack://math/./src/expression/transform/concat.transform.js","webpack://math/./src/expression/transform/diff.transform.js","webpack://math/./src/expression/transform/std.transform.js","webpack://math/./src/expression/transform/sum.transform.js","webpack://math/./src/expression/transform/quantileSeq.transform.js","webpack://math/./src/expression/transform/cumsum.transform.js","webpack://math/./src/expression/transform/variance.transform.js","webpack://math/./src/expression/transform/print.transform.js","webpack://math/./src/expression/transform/and.transform.js","webpack://math/./src/expression/transform/or.transform.js","webpack://math/./src/expression/transform/nullish.transform.js","webpack://math/./src/expression/transform/bitAnd.transform.js","webpack://math/./src/expression/transform/bitOr.transform.js","webpack://math/./src/core/config.js","webpack://math/./src/core/function/config.js","webpack://math/./src/defaultInstance.js","webpack://math/./src/core/create.js","webpack://math/./src/utils/emitter.js","webpack://math/./src/core/function/import.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"math\"] = factory();\n\telse\n\t\troot[\"math\"] = factory();\n})(this, () => {\nreturn ","// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xorshift7\" algorithm by\n// François Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n","\"use strict\";\n\n// Map the characters to escape to their escaped values. The list is derived\n// from http://www.cespedes.org/blog/85/how-to-escape-latex-special-characters\n\nvar _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; };\n\nvar defaultEscapes = {\n  \"{\": \"\\\\{\",\n  \"}\": \"\\\\}\",\n  \"\\\\\": \"\\\\textbackslash{}\",\n  \"#\": \"\\\\#\",\n  $: \"\\\\$\",\n  \"%\": \"\\\\%\",\n  \"&\": \"\\\\&\",\n  \"^\": \"\\\\textasciicircum{}\",\n  _: \"\\\\_\",\n  \"~\": \"\\\\textasciitilde{}\"\n};\nvar formatEscapes = {\n  \"\\u2013\": \"\\\\--\",\n  \"\\u2014\": \"\\\\---\",\n  \" \": \"~\",\n  \"\\t\": \"\\\\qquad{}\",\n  \"\\r\\n\": \"\\\\newline{}\",\n  \"\\n\": \"\\\\newline{}\"\n};\n\nvar defaultEscapeMapFn = function defaultEscapeMapFn(defaultEscapes, formatEscapes) {\n  return _extends({}, defaultEscapes, formatEscapes);\n};\n\n/**\n * Escape a string to be used in LaTeX documents.\n * @param {string} str the string to be escaped.\n * @param {boolean} params.preserveFormatting whether formatting escapes should\n *  be performed (default: false).\n * @param {function} params.escapeMapFn the function to modify the escape maps.\n * @return {string} the escaped string, ready to be used in LaTeX.\n */\nmodule.exports = function (str) {\n  var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {},\n      _ref$preserveFormatti = _ref.preserveFormatting,\n      preserveFormatting = _ref$preserveFormatti === undefined ? false : _ref$preserveFormatti,\n      _ref$escapeMapFn = _ref.escapeMapFn,\n      escapeMapFn = _ref$escapeMapFn === undefined ? defaultEscapeMapFn : _ref$escapeMapFn;\n\n  var runningStr = String(str);\n  var result = \"\";\n\n  var escapes = escapeMapFn(_extends({}, defaultEscapes), preserveFormatting ? _extends({}, formatEscapes) : {});\n  var escapeKeys = Object.keys(escapes); // as it is reused later on\n\n  // Algorithm: Go through the string character by character, if it matches\n  // with one of the special characters then we'll replace it with the escaped\n  // version.\n\n  var _loop = function _loop() {\n    var specialCharFound = false;\n    escapeKeys.forEach(function (key, index) {\n      if (specialCharFound) {\n        return;\n      }\n      if (runningStr.length >= key.length && runningStr.slice(0, key.length) === key) {\n        result += escapes[escapeKeys[index]];\n        runningStr = runningStr.slice(key.length, runningStr.length);\n        specialCharFound = true;\n      }\n    });\n    if (!specialCharFound) {\n      result += runningStr.slice(0, 1);\n      runningStr = runningStr.slice(1, runningStr.length);\n    }\n  };\n\n  while (runningStr) {\n    _loop();\n  }\n  return result;\n};","// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global[\"'typed'\"] = factory());\n})(this, (function () { 'use strict';\n\n  function ok() {\n    return true;\n  }\n  function notOk() {\n    return false;\n  }\n  function undef() {\n    return undefined;\n  }\n  const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\n  /**\n   * @typedef {{\n   *   params: Param[],\n   *   fn: function,\n   *   test: function,\n   *   implementation: function\n   * }} Signature\n   *\n   * @typedef {{\n   *   types: Type[],\n   *   hasAny: boolean,\n   *   hasConversion: boolean,\n   *   restParam: boolean\n   * }} Param\n   *\n   * @typedef {{\n   *   name: string,\n   *   typeIndex: number,\n   *   test: function,\n   *   isAny: boolean,\n   *   conversion?: ConversionDef,\n   *   conversionIndex: number,\n   * }} Type\n   *\n   * @typedef {{\n   *   from: string,\n   *   to: string,\n   *   convert: function (*) : *\n   * }} ConversionDef\n   *\n   * @typedef {{\n   *   name: string,\n   *   test: function(*) : boolean,\n   *   isAny?: boolean\n   * }} TypeDef\n   */\n\n  /**\n   * @returns {() => function}\n   */\n  function create() {\n    // data type tests\n\n    /**\n     * Returns true if the argument is a non-null \"plain\" object\n     */\n    function isPlainObject(x) {\n      return typeof x === 'object' && x !== null && x.constructor === Object;\n    }\n    const _types = [{\n      name: 'number',\n      test: function (x) {\n        return typeof x === 'number';\n      }\n    }, {\n      name: 'string',\n      test: function (x) {\n        return typeof x === 'string';\n      }\n    }, {\n      name: 'boolean',\n      test: function (x) {\n        return typeof x === 'boolean';\n      }\n    }, {\n      name: 'Function',\n      test: function (x) {\n        return typeof x === 'function';\n      }\n    }, {\n      name: 'Array',\n      test: Array.isArray\n    }, {\n      name: 'Date',\n      test: function (x) {\n        return x instanceof Date;\n      }\n    }, {\n      name: 'RegExp',\n      test: function (x) {\n        return x instanceof RegExp;\n      }\n    }, {\n      name: 'Object',\n      test: isPlainObject\n    }, {\n      name: 'null',\n      test: function (x) {\n        return x === null;\n      }\n    }, {\n      name: 'undefined',\n      test: function (x) {\n        return x === undefined;\n      }\n    }];\n    const anyType = {\n      name: 'any',\n      test: ok,\n      isAny: true\n    };\n\n    // Data structures to track the types. As these are local variables in\n    // create(), each typed universe will get its own copy, but the variables\n    // will only be accessible through the (closures of the) functions supplied\n    // as properties of the typed object, not directly.\n    // These will be initialized in clear() below\n    let typeMap; // primary store of all types\n    let typeList; // Array of just type names, for the sake of ordering\n\n    // And similar data structures for the type conversions:\n    let nConversions = 0;\n    // the actual conversions are stored on a property of the destination types\n\n    // This is a temporary object, will be replaced with a function at the end\n    let typed = {\n      createCount: 0\n    };\n\n    /**\n     * Takes a type name and returns the corresponding official type object\n     * for that type.\n     *\n     * @param {string} typeName\n     * @returns {TypeDef} type\n     */\n    function findType(typeName) {\n      const type = typeMap.get(typeName);\n      if (type) {\n        return type;\n      }\n      // Remainder is error handling\n      let message = 'Unknown type \"' + typeName + '\"';\n      const name = typeName.toLowerCase();\n      let otherName;\n      for (otherName of typeList) {\n        if (otherName.toLowerCase() === name) {\n          message += '. Did you mean \"' + otherName + '\" ?';\n          break;\n        }\n      }\n      throw new TypeError(message);\n    }\n\n    /**\n     * Adds an array `types` of type definitions to this typed instance.\n     * Each type definition should be an object with properties:\n     * 'name' - a string giving the name of the type; 'test' - function\n     * returning a boolean that tests membership in the type; and optionally\n     * 'isAny' - true only for the 'any' type.\n     *\n     * The second optional argument, `before`, gives the name of a type that\n     * these types should be added before. The new types are added in the\n     * order specified.\n     * @param {TypeDef[]} types\n     * @param {string | boolean} [beforeSpec='any'] before\n     */\n    function addTypes(types) {\n      let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n      const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n      const newTypes = [];\n      for (let i = 0; i < types.length; ++i) {\n        if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n          throw new TypeError('Object with properties {name: string, test: function} expected');\n        }\n        const typeName = types[i].name;\n        if (typeMap.has(typeName)) {\n          throw new TypeError('Duplicate type name \"' + typeName + '\"');\n        }\n        newTypes.push(typeName);\n        typeMap.set(typeName, {\n          name: typeName,\n          test: types[i].test,\n          isAny: types[i].isAny,\n          index: beforeIndex + i,\n          conversionsTo: [] // Newly added type can't have any conversions to it\n        });\n      }\n      // update the typeList\n      const affectedTypes = typeList.slice(beforeIndex);\n      typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n      // Fix the indices\n      for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n        typeMap.get(typeList[i]).index = i;\n      }\n    }\n\n    /**\n     * Removes all types and conversions from this typed instance.\n     * May cause previously constructed typed-functions to throw\n     * strange errors when they are called with types that do not\n     * match any of their signatures.\n     */\n    function clear() {\n      typeMap = new Map();\n      typeList = [];\n      nConversions = 0;\n      addTypes([anyType], false);\n    }\n\n    // initialize the types to the default list\n    clear();\n    addTypes(_types);\n\n    /**\n     * Removes all conversions, leaving the types alone.\n     */\n    function clearConversions() {\n      let typeName;\n      for (typeName of typeList) {\n        typeMap.get(typeName).conversionsTo = [];\n      }\n      nConversions = 0;\n    }\n\n    /**\n     * Find the type names that match a value.\n     * @param {*} value\n     * @return {string[]} Array of names of types for which\n     *                  the type test matches the value.\n     */\n    function findTypeNames(value) {\n      const matches = typeList.filter(name => {\n        const type = typeMap.get(name);\n        return !type.isAny && type.test(value);\n      });\n      if (matches.length) {\n        return matches;\n      }\n      return ['any'];\n    }\n\n    /**\n     * Check if an entity is a typed function created by any instance\n     * @param {any} entity\n     * @returns {boolean}\n     */\n    function isTypedFunction(entity) {\n      return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n    }\n\n    /**\n     * Find a specific signature from a (composed) typed function, for example:\n     *\n     *   typed.findSignature(fn, ['number', 'string'])\n     *   typed.findSignature(fn, 'number, string')\n     *   typed.findSignature(fn, 'number,string', {exact: true})\n     *\n     * This function findSignature will by default return the best match to\n     * the given signature, possibly employing type conversions.\n     *\n     * The (optional) third argument is a plain object giving options\n     * controlling the signature search. Currently the only implemented\n     * option is `exact`: if specified as true (default is false), only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Note that a (possibly different) type matching\n     * `any`, or one or more instances of TYPE matching `...TYPE` are\n     * considered exact matches in this regard, as no conversions are used.\n     *\n     * This function returns a \"signature\" object, as does `typed.resolve()`,\n     * which is a plain object with four keys: `params` (the array of parameters\n     * for this signature), `fn` (the originally supplied function for this\n     * signature), `test` (a generated function that determines if an argument\n     * list matches this signature, and `implementation` (the function to call\n     * on a matching argument list, that performs conversions if necessary and\n     * then calls the originally supplied function).\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature search as documented\n     * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n     *     Returns the matching signature, or throws an error when no signature\n     *     is found.\n     */\n    function findSignature(fn, signature, options) {\n      if (!isTypedFunction(fn)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      }\n\n      // Canonicalize input\n      const exact = options && options.exact;\n      const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n      const params = parseSignature(stringSignature);\n      const canonicalSignature = stringifyParams(params);\n\n      // First hope we get lucky and exactly match a signature\n      if (!exact || canonicalSignature in fn.signatures) {\n        // OK, we can check the internal signatures\n        const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n        if (match) {\n          return match;\n        }\n      }\n\n      // Oh well, we did not; so we have to go back and check the parameters\n      // one by one, in order to catch things like `any` and rest params.\n      // Note here we can assume there is at least one parameter, because\n      // the empty signature would have matched successfully above.\n      const nParams = params.length;\n      let remainingSignatures;\n      if (exact) {\n        remainingSignatures = [];\n        let name;\n        for (name in fn.signatures) {\n          remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n        }\n      } else {\n        remainingSignatures = fn._typedFunctionData.signatures;\n      }\n      for (let i = 0; i < nParams; ++i) {\n        const want = params[i];\n        const filteredSignatures = [];\n        let possibility;\n        for (possibility of remainingSignatures) {\n          const have = getParamAtIndex(possibility.params, i);\n          if (!have || want.restParam && !have.restParam) {\n            continue;\n          }\n          if (!have.hasAny) {\n            // have to check all of the wanted types are available\n            const haveTypes = paramTypeSet(have);\n            if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n              continue;\n            }\n          }\n          // OK, this looks good\n          filteredSignatures.push(possibility);\n        }\n        remainingSignatures = filteredSignatures;\n        if (remainingSignatures.length === 0) break;\n      }\n      // Return the first remaining signature that was totally matched:\n      let candidate;\n      for (candidate of remainingSignatures) {\n        if (candidate.params.length <= nParams) {\n          return candidate;\n        }\n      }\n      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n    }\n\n    /**\n     * Find the proper function to call for a specific signature from\n     * a (composed) typed function, for example:\n     *\n     *   typed.find(fn, ['number', 'string'])\n     *   typed.find(fn, 'number, string')\n     *   typed.find(fn, 'number,string', {exact: true})\n     *\n     * This function find will by default return the best match to\n     * the given signature, possibly employing type conversions (and returning\n     * a function that will perform those conversions as needed). The\n     * (optional) third argument is a plain object giving options contolling\n     * the signature search. Currently only the option `exact` is implemented,\n     * which defaults to \"false\". If `exact` is specified as true, then only\n     * exact matches will be returned (i.e. signatures for which `fn` was\n     * directly defined). Uses of `any` and `...TYPE` are considered exact if\n     * no conversions are necessary to apply the corresponding function.\n     *\n     * @param {Function} fn                   A typed-function\n     * @param {string | string[]} signature\n     *     Signature to be found, can be an array or a comma separated string.\n     * @param {object} options  Controls the signature match as documented\n     * @return {function}\n     *     Returns the function to call for the given signature, or throws an\n     *     error if no match is found.\n     */\n    function find(fn, signature, options) {\n      return findSignature(fn, signature, options).implementation;\n    }\n\n    /**\n     * Convert a given value to another data type, specified by type name.\n     *\n     * @param {*} value\n     * @param {string} typeName\n     */\n    function convert(value, typeName) {\n      // check conversion is needed\n      const type = findType(typeName);\n      if (type.test(value)) {\n        return value;\n      }\n      const conversions = type.conversionsTo;\n      if (conversions.length === 0) {\n        throw new Error('There are no conversions to ' + typeName + ' defined.');\n      }\n      for (let i = 0; i < conversions.length; i++) {\n        const fromType = findType(conversions[i].from);\n        if (fromType.test(value)) {\n          return conversions[i].convert(value);\n        }\n      }\n      throw new Error('Cannot convert ' + value + ' to ' + typeName);\n    }\n\n    /**\n     * Stringify parameters in a normalized way\n     * @param {Param[]} params\n     * @param {string} [','] separator\n     * @return {string}\n     */\n    function stringifyParams(params) {\n      let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n      return params.map(p => p.name).join(separator);\n    }\n\n    /**\n     * Parse a parameter, like \"...number | boolean\"\n     * @param {string} param\n     * @return {Param} param\n     */\n    function parseParam(param) {\n      const restParam = param.indexOf('...') === 0;\n      const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n      const typeDefs = types.split('|').map(s => findType(s.trim()));\n      let hasAny = false;\n      let paramName = restParam ? '...' : '';\n      const exactTypes = typeDefs.map(function (type) {\n        hasAny = type.isAny || hasAny;\n        paramName += type.name + '|';\n        return {\n          name: type.name,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion: null,\n          conversionIndex: -1\n        };\n      });\n      return {\n        types: exactTypes,\n        name: paramName.slice(0, -1),\n        // remove trailing '|' from above\n        hasAny,\n        hasConversion: false,\n        restParam\n      };\n    }\n\n    /**\n     * Expands a parsed parameter with the types available from currently\n     * defined conversions.\n     * @param {Param} param\n     * @return {Param} param\n     */\n    function expandParam(param) {\n      const typeNames = param.types.map(t => t.name);\n      const matchingConversions = availableConversions(typeNames);\n      let hasAny = param.hasAny;\n      let newName = param.name;\n      const convertibleTypes = matchingConversions.map(function (conversion) {\n        const type = findType(conversion.from);\n        hasAny = type.isAny || hasAny;\n        newName += '|' + conversion.from;\n        return {\n          name: conversion.from,\n          typeIndex: type.index,\n          test: type.test,\n          isAny: type.isAny,\n          conversion,\n          conversionIndex: conversion.index\n        };\n      });\n      return {\n        types: param.types.concat(convertibleTypes),\n        name: newName,\n        hasAny,\n        hasConversion: convertibleTypes.length > 0,\n        restParam: param.restParam\n      };\n    }\n\n    /**\n     * Return the set of type names in a parameter.\n     * Caches the result for efficiency\n     *\n     * @param {Param} param\n     * @return {Set<string>} typenames\n     */\n    function paramTypeSet(param) {\n      if (!param.typeSet) {\n        param.typeSet = new Set();\n        param.types.forEach(type => param.typeSet.add(type.name));\n      }\n      return param.typeSet;\n    }\n\n    /**\n     * Parse a signature with comma separated parameters,\n     * like \"number | boolean, ...string\"\n     *\n     * @param {string} signature\n     * @return {Param[]} params\n     */\n    function parseSignature(rawSignature) {\n      const params = [];\n      if (typeof rawSignature !== 'string') {\n        throw new TypeError('Signatures must be strings');\n      }\n      const signature = rawSignature.trim();\n      if (signature === '') {\n        return params;\n      }\n      const rawParams = signature.split(',');\n      for (let i = 0; i < rawParams.length; ++i) {\n        const parsedParam = parseParam(rawParams[i].trim());\n        if (parsedParam.restParam && i !== rawParams.length - 1) {\n          throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n        }\n        // if invalid, short-circuit (all the types may have been filtered)\n        if (parsedParam.types.length === 0) {\n          return null;\n        }\n        params.push(parsedParam);\n      }\n      return params;\n    }\n\n    /**\n     * Test whether a set of params contains a restParam\n     * @param {Param[]} params\n     * @return {boolean} Returns true when the last parameter is a restParam\n     */\n    function hasRestParam(params) {\n      const param = last(params);\n      return param ? param.restParam : false;\n    }\n\n    /**\n     * Create a type test for a single parameter, which can have one or multiple\n     * types.\n     * @param {Param} param\n     * @return {function(x: *) : boolean} Returns a test function\n     */\n    function compileTest(param) {\n      if (!param || param.types.length === 0) {\n        // nothing to do\n        return ok;\n      } else if (param.types.length === 1) {\n        return findType(param.types[0].name).test;\n      } else if (param.types.length === 2) {\n        const test0 = findType(param.types[0].name).test;\n        const test1 = findType(param.types[1].name).test;\n        return function or(x) {\n          return test0(x) || test1(x);\n        };\n      } else {\n        // param.types.length > 2\n        const tests = param.types.map(function (type) {\n          return findType(type.name).test;\n        });\n        return function or(x) {\n          for (let i = 0; i < tests.length; i++) {\n            if (tests[i](x)) {\n              return true;\n            }\n          }\n          return false;\n        };\n      }\n    }\n\n    /**\n     * Create a test for all parameters of a signature\n     * @param {Param[]} params\n     * @return {function(args: Array<*>) : boolean}\n     */\n    function compileTests(params) {\n      let tests, test0, test1;\n      if (hasRestParam(params)) {\n        // variable arguments like '...number'\n        tests = initial(params).map(compileTest);\n        const varIndex = tests.length;\n        const lastTest = compileTest(last(params));\n        const testRestParam = function (args) {\n          for (let i = varIndex; i < args.length; i++) {\n            if (!lastTest(args[i])) {\n              return false;\n            }\n          }\n          return true;\n        };\n        return function testArgs(args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n          return testRestParam(args) && args.length >= varIndex + 1;\n        };\n      } else {\n        // no variable arguments\n        if (params.length === 0) {\n          return function testArgs(args) {\n            return args.length === 0;\n          };\n        } else if (params.length === 1) {\n          test0 = compileTest(params[0]);\n          return function testArgs(args) {\n            return test0(args[0]) && args.length === 1;\n          };\n        } else if (params.length === 2) {\n          test0 = compileTest(params[0]);\n          test1 = compileTest(params[1]);\n          return function testArgs(args) {\n            return test0(args[0]) && test1(args[1]) && args.length === 2;\n          };\n        } else {\n          // arguments.length > 2\n          tests = params.map(compileTest);\n          return function testArgs(args) {\n            for (let i = 0; i < tests.length; i++) {\n              if (!tests[i](args[i])) {\n                return false;\n              }\n            }\n            return args.length === tests.length;\n          };\n        }\n      }\n    }\n\n    /**\n     * Find the parameter at a specific index of a Params list.\n     * Handles rest parameters.\n     * @param {Param[]} params\n     * @param {number} index\n     * @return {Param | null} Returns the matching parameter when found,\n     *                        null otherwise.\n     */\n    function getParamAtIndex(params, index) {\n      return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n    }\n\n    /**\n     * Get all type names of a parameter\n     * @param {Params[]} params\n     * @param {number} index\n     * @return {string[]} Returns an array with type names\n     */\n    function getTypeSetAtIndex(params, index) {\n      const param = getParamAtIndex(params, index);\n      if (!param) {\n        return new Set();\n      }\n      return paramTypeSet(param);\n    }\n\n    /**\n     * Test whether a type is an exact type or conversion\n     * @param {Type} type\n     * @return {boolean} Returns true when\n     */\n    function isExactType(type) {\n      return type.conversion === null || type.conversion === undefined;\n    }\n\n    /**\n     * Helper function for creating error messages: create an array with\n     * all available types on a specific argument index.\n     * @param {Signature[]} signatures\n     * @param {number} index\n     * @return {string[]} Returns an array with available types\n     */\n    function mergeExpectedParams(signatures, index) {\n      const typeSet = new Set();\n      signatures.forEach(signature => {\n        const paramSet = getTypeSetAtIndex(signature.params, index);\n        let name;\n        for (name of paramSet) {\n          typeSet.add(name);\n        }\n      });\n      return typeSet.has('any') ? ['any'] : Array.from(typeSet);\n    }\n\n    /**\n     * Create\n     * @param {string} name             The name of the function\n     * @param {array.<*>} args          The actual arguments passed to the function\n     * @param {Signature[]} signatures  A list with available signatures\n     * @return {TypeError} Returns a type error with additional data\n     *                     attached to it in the property `data`\n     */\n    function createError(name, args, signatures) {\n      let err, expected;\n      const _name = name || 'unnamed';\n\n      // test for wrong type at some index\n      let matchingSignatures = signatures;\n      let index;\n      for (index = 0; index < args.length; index++) {\n        const nextMatchingDefs = [];\n        matchingSignatures.forEach(signature => {\n          const param = getParamAtIndex(signature.params, index);\n          const test = compileTest(param);\n          if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n            nextMatchingDefs.push(signature);\n          }\n        });\n        if (nextMatchingDefs.length === 0) {\n          // no matching signatures anymore, throw error \"wrong type\"\n          expected = mergeExpectedParams(matchingSignatures, index);\n          if (expected.length > 0) {\n            const actualTypes = findTypeNames(args[index]);\n            err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n            err.data = {\n              category: 'wrongType',\n              fn: _name,\n              index,\n              actual: actualTypes,\n              expected\n            };\n            return err;\n          }\n        } else {\n          matchingSignatures = nextMatchingDefs;\n        }\n      }\n\n      // test for too few arguments\n      const lengths = matchingSignatures.map(function (signature) {\n        return hasRestParam(signature.params) ? Infinity : signature.params.length;\n      });\n      if (args.length < Math.min.apply(null, lengths)) {\n        expected = mergeExpectedParams(matchingSignatures, index);\n        err = new TypeError('Too few arguments in function ' + _name + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n        err.data = {\n          category: 'tooFewArgs',\n          fn: _name,\n          index: args.length,\n          expected\n        };\n        return err;\n      }\n\n      // test for too many arguments\n      const maxLength = Math.max.apply(null, lengths);\n      if (args.length > maxLength) {\n        err = new TypeError('Too many arguments in function ' + _name + ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n        err.data = {\n          category: 'tooManyArgs',\n          fn: _name,\n          index: args.length,\n          expectedLength: maxLength\n        };\n        return err;\n      }\n\n      // Generic error\n      const argTypes = [];\n      for (let i = 0; i < args.length; ++i) {\n        argTypes.push(findTypeNames(args[i]).join('|'));\n      }\n      err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n      err.data = {\n        category: 'mismatch',\n        actual: argTypes\n      };\n      return err;\n    }\n\n    /**\n     * Find the lowest index of all exact types of a parameter (no conversions)\n     * @param {Param} param\n     * @return {number} Returns the index of the lowest type in typed.types\n     */\n    function getLowestTypeIndex(param) {\n      let min = typeList.length + 1;\n      for (let i = 0; i < param.types.length; i++) {\n        if (isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].typeIndex);\n        }\n      }\n      return min;\n    }\n\n    /**\n     * Find the lowest index of the conversion of all types of the parameter\n     * having a conversion\n     * @param {Param} param\n     * @return {number} Returns the lowest index of the conversions of this type\n     */\n    function getLowestConversionIndex(param) {\n      let min = nConversions + 1;\n      for (let i = 0; i < param.types.length; i++) {\n        if (!isExactType(param.types[i])) {\n          min = Math.min(min, param.types[i].conversionIndex);\n        }\n      }\n      return min;\n    }\n\n    /**\n     * Compare two params\n     * @param {Param} param1\n     * @param {Param} param2\n     * @return {number} returns -1 when param1 must get a lower\n     *                  index than param2, 1 when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareParams(param1, param2) {\n      // We compare a number of metrics on a param in turn:\n      // 1) 'any' parameters are the least preferred\n      if (param1.hasAny) {\n        if (!param2.hasAny) {\n          return 1;\n        }\n      } else if (param2.hasAny) {\n        return -1;\n      }\n\n      // 2) Prefer non-rest to rest parameters\n      if (param1.restParam) {\n        if (!param2.restParam) {\n          return 1;\n        }\n      } else if (param2.restParam) {\n        return -1;\n      }\n\n      // 3) Prefer exact type match to conversions\n      if (param1.hasConversion) {\n        if (!param2.hasConversion) {\n          return 1;\n        }\n      } else if (param2.hasConversion) {\n        return -1;\n      }\n\n      // 4) Prefer lower type index:\n      const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n      if (typeDiff < 0) {\n        return -1;\n      }\n      if (typeDiff > 0) {\n        return 1;\n      }\n\n      // 5) Prefer lower conversion index\n      const convDiff = getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n      if (convDiff < 0) {\n        return -1;\n      }\n      if (convDiff > 0) {\n        return 1;\n      }\n\n      // Don't have a basis for preference\n      return 0;\n    }\n\n    /**\n     * Compare two signatures\n     * @param {Signature} signature1\n     * @param {Signature} signature2\n     * @return {number} returns a negative number when param1 must get a lower\n     *                  index than param2, a positive number when the opposite,\n     *                  or zero when both are equal\n     */\n    function compareSignatures(signature1, signature2) {\n      const pars1 = signature1.params;\n      const pars2 = signature2.params;\n      const last1 = last(pars1);\n      const last2 = last(pars2);\n      const hasRest1 = hasRestParam(pars1);\n      const hasRest2 = hasRestParam(pars2);\n      // We compare a number of metrics on signatures in turn:\n      // 1) An \"any rest param\" is least preferred\n      if (hasRest1 && last1.hasAny) {\n        if (!hasRest2 || !last2.hasAny) {\n          return 1;\n        }\n      } else if (hasRest2 && last2.hasAny) {\n        return -1;\n      }\n\n      // 2) Minimize the number of 'any' parameters\n      let any1 = 0;\n      let conv1 = 0;\n      let par;\n      for (par of pars1) {\n        if (par.hasAny) ++any1;\n        if (par.hasConversion) ++conv1;\n      }\n      let any2 = 0;\n      let conv2 = 0;\n      for (par of pars2) {\n        if (par.hasAny) ++any2;\n        if (par.hasConversion) ++conv2;\n      }\n      if (any1 !== any2) {\n        return any1 - any2;\n      }\n\n      // 3) A conversion rest param is less preferred\n      if (hasRest1 && last1.hasConversion) {\n        if (!hasRest2 || !last2.hasConversion) {\n          return 1;\n        }\n      } else if (hasRest2 && last2.hasConversion) {\n        return -1;\n      }\n\n      // 4) Minimize the number of conversions\n      if (conv1 !== conv2) {\n        return conv1 - conv2;\n      }\n\n      // 5) Prefer no rest param\n      if (hasRest1) {\n        if (!hasRest2) {\n          return 1;\n        }\n      } else if (hasRest2) {\n        return -1;\n      }\n\n      // 6) Prefer shorter with rest param, longer without\n      const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -1 : 1);\n      if (lengthCriterion !== 0) {\n        return lengthCriterion;\n      }\n\n      // Signatures are identical in each of the above metrics.\n      // In particular, they are the same length.\n      // We can therefore compare the parameters one by one.\n      // First we count which signature has more preferred parameters.\n      const comparisons = [];\n      let tc = 0;\n      for (let i = 0; i < pars1.length; ++i) {\n        const thisComparison = compareParams(pars1[i], pars2[i]);\n        comparisons.push(thisComparison);\n        tc += thisComparison;\n      }\n      if (tc !== 0) {\n        return tc;\n      }\n\n      // They have the same number of preferred parameters, so go by the\n      // earliest parameter in which we have a preference.\n      // In other words, dispatch is driven somewhat more by earlier\n      // parameters than later ones.\n      let c;\n      for (c of comparisons) {\n        if (c !== 0) {\n          return c;\n        }\n      }\n\n      // It's a tossup:\n      return 0;\n    }\n\n    /**\n     * Produce a list of all conversions from distinct types to one of\n     * the given types.\n     *\n     * @param {string[]} typeNames\n     * @return {ConversionDef[]} Returns the conversions that are available\n     *                        resulting in any given type (if any)\n     */\n    function availableConversions(typeNames) {\n      if (typeNames.length === 0) {\n        return [];\n      }\n      const types = typeNames.map(findType);\n      if (typeNames.length > 1) {\n        types.sort((t1, t2) => t1.index - t2.index);\n      }\n      let matches = types[0].conversionsTo;\n      if (typeNames.length === 1) {\n        return matches;\n      }\n      matches = matches.concat([]); // shallow copy the matches\n      // Since the types are now in index order, we just want the first\n      // occurrence of any from type:\n      const knownTypes = new Set(typeNames);\n      for (let i = 1; i < types.length; ++i) {\n        let newMatch;\n        for (newMatch of types[i].conversionsTo) {\n          if (!knownTypes.has(newMatch.from)) {\n            matches.push(newMatch);\n            knownTypes.add(newMatch.from);\n          }\n        }\n      }\n      return matches;\n    }\n\n    /**\n     * Preprocess arguments before calling the original function:\n     * - if needed convert the parameters\n     * - in case of rest parameters, move the rest parameters into an Array\n     * @param {Param[]} params\n     * @param {function} fn\n     * @return {function} Returns a wrapped function\n     */\n    function compileArgsPreprocessing(params, fn) {\n      let fnConvert = fn;\n\n      // TODO: can we make this wrapper function smarter/simpler?\n\n      if (params.some(p => p.hasConversion)) {\n        const restParam = hasRestParam(params);\n        const compiledConversions = params.map(compileArgConversion);\n        fnConvert = function convertArgs() {\n          const args = [];\n          const last = restParam ? arguments.length - 1 : arguments.length;\n          for (let i = 0; i < last; i++) {\n            args[i] = compiledConversions[i](arguments[i]);\n          }\n          if (restParam) {\n            args[last] = arguments[last].map(compiledConversions[last]);\n          }\n          return fn.apply(this, args);\n        };\n      }\n      let fnPreprocess = fnConvert;\n      if (hasRestParam(params)) {\n        const offset = params.length - 1;\n        fnPreprocess = function preprocessRestParams() {\n          return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n        };\n      }\n      return fnPreprocess;\n    }\n\n    /**\n     * Compile conversion for a parameter to the right type\n     * @param {Param} param\n     * @return {function} Returns the wrapped function that will convert arguments\n     *\n     */\n    function compileArgConversion(param) {\n      let test0, test1, conversion0, conversion1;\n      const tests = [];\n      const conversions = [];\n      param.types.forEach(function (type) {\n        if (type.conversion) {\n          tests.push(findType(type.conversion.from).test);\n          conversions.push(type.conversion.convert);\n        }\n      });\n\n      // create optimized conversion functions depending on the number of conversions\n      switch (conversions.length) {\n        case 0:\n          return function convertArg(arg) {\n            return arg;\n          };\n        case 1:\n          test0 = tests[0];\n          conversion0 = conversions[0];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg);\n            }\n            return arg;\n          };\n        case 2:\n          test0 = tests[0];\n          test1 = tests[1];\n          conversion0 = conversions[0];\n          conversion1 = conversions[1];\n          return function convertArg(arg) {\n            if (test0(arg)) {\n              return conversion0(arg);\n            }\n            if (test1(arg)) {\n              return conversion1(arg);\n            }\n            return arg;\n          };\n        default:\n          return function convertArg(arg) {\n            for (let i = 0; i < conversions.length; i++) {\n              if (tests[i](arg)) {\n                return conversions[i](arg);\n              }\n            }\n            return arg;\n          };\n      }\n    }\n\n    /**\n     * Split params with union types in to separate params.\n     *\n     * For example:\n     *\n     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n     *     // returns:\n     *     // [\n     *     //   ['Array', 'string'],\n     *     //   ['Array', 'RegExp'],\n     *     //   ['Object', 'string'],\n     *     //   ['Object', 'RegExp']\n     *     // ]\n     *\n     * @param {Param[]} params\n     * @return {Param[]}\n     */\n    function splitParams(params) {\n      function _splitParams(params, index, paramsSoFar) {\n        if (index < params.length) {\n          const param = params[index];\n          let resultingParams = [];\n          if (param.restParam) {\n            // split the types of a rest parameter in two:\n            // one with only exact types, and one with exact types and conversions\n            const exactTypes = param.types.filter(isExactType);\n            if (exactTypes.length < param.types.length) {\n              resultingParams.push({\n                types: exactTypes,\n                name: '...' + exactTypes.map(t => t.name).join('|'),\n                hasAny: exactTypes.some(t => t.isAny),\n                hasConversion: false,\n                restParam: true\n              });\n            }\n            resultingParams.push(param);\n          } else {\n            // split all the types of a regular parameter into one type per param\n            resultingParams = param.types.map(function (type) {\n              return {\n                types: [type],\n                name: type.name,\n                hasAny: type.isAny,\n                hasConversion: type.conversion,\n                restParam: false\n              };\n            });\n          }\n\n          // recurse over the groups with types\n          return flatMap(resultingParams, function (nextParam) {\n            return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n          });\n        } else {\n          // we've reached the end of the parameters.\n          return [paramsSoFar];\n        }\n      }\n      return _splitParams(params, 0, []);\n    }\n\n    /**\n     * Test whether two param lists represent conflicting signatures\n     * @param {Param[]} params1\n     * @param {Param[]} params2\n     * @return {boolean} Returns true when the signatures conflict, false otherwise.\n     */\n    function conflicting(params1, params2) {\n      const ii = Math.max(params1.length, params2.length);\n      for (let i = 0; i < ii; i++) {\n        const typeSet1 = getTypeSetAtIndex(params1, i);\n        const typeSet2 = getTypeSetAtIndex(params2, i);\n        let overlap = false;\n        let name;\n        for (name of typeSet2) {\n          if (typeSet1.has(name)) {\n            overlap = true;\n            break;\n          }\n        }\n        if (!overlap) {\n          return false;\n        }\n      }\n      const len1 = params1.length;\n      const len2 = params2.length;\n      const restParam1 = hasRestParam(params1);\n      const restParam2 = hasRestParam(params2);\n      return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n    }\n\n    /**\n     * Helper function for `resolveReferences` that returns a copy of\n     * functionList wihe any prior resolutions cleared out, in case we are\n     * recycling signatures from a prior typed function construction.\n     *\n     * @param {Array.<function|typed-reference>} functionList\n     * @return {Array.<function|typed-reference>}\n     */\n    function clearResolutions(functionList) {\n      return functionList.map(fn => {\n        if (isReferToSelf(fn)) {\n          return referToSelf(fn.referToSelf.callback);\n        }\n        if (isReferTo(fn)) {\n          return makeReferTo(fn.referTo.references, fn.referTo.callback);\n        }\n        return fn;\n      });\n    }\n\n    /**\n     * Take a list of references, a list of functions functionList, and a\n     * signatureMap indexing signatures into functionList, and return\n     * the list of resolutions, or a false-y value if they don't all\n     * resolve in a valid way (yet).\n     *\n     * @param {string[]} references\n     * @param {Array<function|typed-reference} functionList\n     * @param {Object.<string, integer>} signatureMap\n     * @return {function[] | false} resolutions\n     */\n    function collectResolutions(references, functionList, signatureMap) {\n      const resolvedReferences = [];\n      let reference;\n      for (reference of references) {\n        let resolution = signatureMap[reference];\n        if (typeof resolution !== 'number') {\n          throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n        }\n        resolution = functionList[resolution];\n        if (typeof resolution !== 'function') {\n          return false;\n        }\n        resolvedReferences.push(resolution);\n      }\n      return resolvedReferences;\n    }\n\n    /**\n     * Resolve any references in the functionList for the typed function\n     * itself. The signatureMap tells which index in the functionList a\n     * given signature should be mapped to (for use in resolving typed.referTo)\n     * and self provides the destions of a typed.referToSelf.\n     *\n     * @param {Array<function | typed-reference-object>} functionList\n     * @param {Object.<string, function>} signatureMap\n     * @param {function} self  The typed-function itself\n     * @return {Array<function>} The list of resolved functions\n     */\n    function resolveReferences(functionList, signatureMap, self) {\n      const resolvedFunctions = clearResolutions(functionList);\n      const isResolved = new Array(resolvedFunctions.length).fill(false);\n      let leftUnresolved = true;\n      while (leftUnresolved) {\n        leftUnresolved = false;\n        let nothingResolved = true;\n        for (let i = 0; i < resolvedFunctions.length; ++i) {\n          if (isResolved[i]) continue;\n          const fn = resolvedFunctions[i];\n          if (isReferToSelf(fn)) {\n            resolvedFunctions[i] = fn.referToSelf.callback(self);\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referToSelf = fn.referToSelf;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else if (isReferTo(fn)) {\n            const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n            if (resolvedReferences) {\n              resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n              // Preserve reference in case signature is reused someday:\n              resolvedFunctions[i].referTo = fn.referTo;\n              isResolved[i] = true;\n              nothingResolved = false;\n            } else {\n              leftUnresolved = true;\n            }\n          }\n        }\n        if (nothingResolved && leftUnresolved) {\n          throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n        }\n      }\n      return resolvedFunctions;\n    }\n\n    /**\n     * Validate whether any of the function bodies contains a self-reference\n     * usage like `this(...)` or `this.signatures`. This self-referencing is\n     * deprecated since typed-function v3. It has been replaced with\n     * the functions typed.referTo and typed.referToSelf.\n     * @param {Object.<string, function>} signaturesMap\n     */\n    function validateDeprecatedThis(signaturesMap) {\n      // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n      // match occurrences like 'this(' and 'this.signatures'\n      const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n      Object.keys(signaturesMap).forEach(signature => {\n        const fn = signaturesMap[signature];\n        if (deprecatedThisRegex.test(fn.toString())) {\n          throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n        }\n      });\n    }\n\n    /**\n     * Create a typed function\n     * @param {String} name               The name for the typed function\n     * @param {Object.<string, function>} rawSignaturesMap\n     *                                    An object with one or\n     *                                    multiple signatures as key, and the\n     *                                    function corresponding to the\n     *                                    signature as value.\n     * @return {function}  Returns the created typed function.\n     */\n    function createTypedFunction(name, rawSignaturesMap) {\n      typed.createCount++;\n      if (Object.keys(rawSignaturesMap).length === 0) {\n        throw new SyntaxError('No signatures provided');\n      }\n      if (typed.warnAgainstDeprecatedThis) {\n        validateDeprecatedThis(rawSignaturesMap);\n      }\n\n      // Main processing loop for signatures\n      const parsedParams = [];\n      const originalFunctions = [];\n      const signaturesMap = {};\n      const preliminarySignatures = []; // may have duplicates from conversions\n      let signature;\n      for (signature in rawSignaturesMap) {\n        // A) Protect against polluted Object prototype:\n        if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n          continue;\n        }\n        // B) Parse the signature\n        const params = parseSignature(signature);\n        if (!params) continue;\n        // C) Check for conflicts\n        parsedParams.forEach(function (pp) {\n          if (conflicting(pp, params)) {\n            throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n          }\n        });\n        parsedParams.push(params);\n        // D) Store the provided function and add conversions\n        const functionIndex = originalFunctions.length;\n        originalFunctions.push(rawSignaturesMap[signature]);\n        const conversionParams = params.map(expandParam);\n        // E) Split the signatures and collect them up\n        let sp;\n        for (sp of splitParams(conversionParams)) {\n          const spName = stringifyParams(sp);\n          preliminarySignatures.push({\n            params: sp,\n            name: spName,\n            fn: functionIndex\n          });\n          if (sp.every(p => !p.hasConversion)) {\n            signaturesMap[spName] = functionIndex;\n          }\n        }\n      }\n      preliminarySignatures.sort(compareSignatures);\n\n      // Note the forward reference to theTypedFn\n      const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n      // Fill in the proper function for each signature\n      let s;\n      for (s in signaturesMap) {\n        if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n          signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n        }\n      }\n      const signatures = [];\n      const internalSignatureMap = new Map(); // benchmarks faster than object\n      for (s of preliminarySignatures) {\n        // Note it's only safe to eliminate duplicates like this\n        // _after_ the signature sorting step above; otherwise we might\n        // remove the wrong one.\n        if (!internalSignatureMap.has(s.name)) {\n          s.fn = resolvedFunctions[s.fn];\n          signatures.push(s);\n          internalSignatureMap.set(s.name, s);\n        }\n      }\n\n      // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n      const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n      const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n      const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n      const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n      const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n      const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n      const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n      // compile the tests\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].test = compileTests(signatures[i].params);\n      }\n      const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n      const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n      const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n      const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n      const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n      const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n      const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n      const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n      const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n      const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n      const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n      const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n      // compile the functions\n      for (let i = 0; i < signatures.length; ++i) {\n        signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n      }\n      const fn0 = ok0 ? signatures[0].implementation : undef;\n      const fn1 = ok1 ? signatures[1].implementation : undef;\n      const fn2 = ok2 ? signatures[2].implementation : undef;\n      const fn3 = ok3 ? signatures[3].implementation : undef;\n      const fn4 = ok4 ? signatures[4].implementation : undef;\n      const fn5 = ok5 ? signatures[5].implementation : undef;\n      const len0 = ok0 ? signatures[0].params.length : -1;\n      const len1 = ok1 ? signatures[1].params.length : -1;\n      const len2 = ok2 ? signatures[2].params.length : -1;\n      const len3 = ok3 ? signatures[3].params.length : -1;\n      const len4 = ok4 ? signatures[4].params.length : -1;\n      const len5 = ok5 ? signatures[5].params.length : -1;\n\n      // simple and generic, but also slow\n      const iStart = allOk ? 6 : 0;\n      const iEnd = signatures.length;\n      // de-reference ahead for execution speed:\n      const tests = signatures.map(s => s.test);\n      const fns = signatures.map(s => s.implementation);\n      const generic = function generic() {\n\n        for (let i = iStart; i < iEnd; i++) {\n          if (tests[i](arguments)) {\n            return fns[i].apply(this, arguments);\n          }\n        }\n        return typed.onMismatch(name, arguments, signatures);\n      };\n\n      // create the typed function\n      // fast, specialized version. Falls back to the slower, generic one if needed\n      function theTypedFn(arg0, arg1) {\n\n        if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n          return fn0.apply(this, arguments);\n        }\n        if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n          return fn1.apply(this, arguments);\n        }\n        if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n          return fn2.apply(this, arguments);\n        }\n        if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n          return fn3.apply(this, arguments);\n        }\n        if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n          return fn4.apply(this, arguments);\n        }\n        if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n          return fn5.apply(this, arguments);\n        }\n        return generic.apply(this, arguments);\n      }\n\n      // attach name the typed function\n      try {\n        Object.defineProperty(theTypedFn, 'name', {\n          value: name\n        });\n      } catch (err) {\n        // old browsers do not support Object.defineProperty and some don't support setting the name property\n        // the function name is not essential for the functioning, it's mostly useful for debugging,\n        // so it's fine to have unnamed functions.\n      }\n\n      // attach signatures to the function.\n      // This property is close to the original collection of signatures\n      // used to create the typed-function, just with unions split:\n      theTypedFn.signatures = signaturesMap;\n\n      // Store internal data for functions like resolve, find, etc.\n      // Also serves as the flag that this is a typed-function\n      theTypedFn._typedFunctionData = {\n        signatures,\n        signatureMap: internalSignatureMap\n      };\n      return theTypedFn;\n    }\n\n    /**\n     * Action to take on mismatch\n     * @param {string} name      Name of function that was attempted to be called\n     * @param {Array} args       Actual arguments to the call\n     * @param {Array} signatures Known signatures of the named typed-function\n     */\n    function _onMismatch(name, args, signatures) {\n      throw createError(name, args, signatures);\n    }\n\n    /**\n     * Return all but the last items of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {Array}\n     */\n    function initial(arr) {\n      return slice(arr, 0, arr.length - 1);\n    }\n\n    /**\n     * return the last item of an array or function Arguments\n     * @param {Array | Arguments} arr\n     * @return {*}\n     */\n    function last(arr) {\n      return arr[arr.length - 1];\n    }\n\n    /**\n     * Slice an array or function Arguments\n     * @param {Array | Arguments | IArguments} arr\n     * @param {number} start\n     * @param {number} [end]\n     * @return {Array}\n     */\n    function slice(arr, start, end) {\n      return Array.prototype.slice.call(arr, start, end);\n    }\n\n    /**\n     * Return the first item from an array for which test(arr[i]) returns true\n     * @param {Array} arr\n     * @param {function} test\n     * @return {* | undefined} Returns the first matching item\n     *                         or undefined when there is no match\n     */\n    function findInArray(arr, test) {\n      for (let i = 0; i < arr.length; i++) {\n        if (test(arr[i])) {\n          return arr[i];\n        }\n      }\n      return undefined;\n    }\n\n    /**\n     * Flat map the result invoking a callback for every item in an array.\n     * https://gist.github.com/samgiles/762ee337dff48623e729\n     * @param {Array} arr\n     * @param {function} callback\n     * @return {Array}\n     */\n    function flatMap(arr, callback) {\n      return Array.prototype.concat.apply([], arr.map(callback));\n    }\n\n    /**\n     * Create a reference callback to one or multiple signatures\n     *\n     * Syntax:\n     *\n     *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n     *       // ...\n     *     })\n     *\n     * @returns {{referTo: {references: string[], callback}}}\n     */\n    function referTo() {\n      const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n      const callback = last(arguments);\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as last argument');\n      }\n      return makeReferTo(references, callback);\n    }\n    function makeReferTo(references, callback) {\n      return {\n        referTo: {\n          references,\n          callback\n        }\n      };\n    }\n\n    /**\n     * Create a reference callback to the typed-function itself\n     *\n     * @param {(self: function) => function} callback\n     * @returns {{referToSelf: { callback: function }}}\n     */\n    function referToSelf(callback) {\n      if (typeof callback !== 'function') {\n        throw new TypeError('Callback function expected as first argument');\n      }\n      return {\n        referToSelf: {\n          callback\n        }\n      };\n    }\n\n    /**\n     * Test whether something is a referTo object, holding a list with reference\n     * signatures and a callback.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n    function isReferTo(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n    }\n\n    /**\n     * Test whether something is a referToSelf object, holding a callback where\n     * to pass `self`.\n     *\n     * @param {Object | function} objectOrFn\n     * @returns {boolean}\n     */\n    function isReferToSelf(objectOrFn) {\n      return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n    }\n\n    /**\n     * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n     * an error in case (C).\n     *\n     * @param { string | undefined } nameSoFar\n     * @param { string | undefined } newName\n     * @returns { string } updated name\n     */\n    function checkName(nameSoFar, newName) {\n      if (!nameSoFar) {\n        return newName;\n      }\n      if (newName && newName !== nameSoFar) {\n        const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n        err.data = {\n          actual: newName,\n          expected: nameSoFar\n        };\n        throw err;\n      }\n      return nameSoFar;\n    }\n\n    /**\n     * Retrieve the implied name from an object with signature keys\n     * and function values, checking whether all value names match\n     *\n     * @param { {string: function} } obj\n     */\n    function getObjectName(obj) {\n      let name;\n      for (const key in obj) {\n        // Only pay attention to own properties, and only if their values\n        // are typed functions or functions with a signature property\n        if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n          name = checkName(name, obj[key].name);\n        }\n      }\n      return name;\n    }\n\n    /**\n     * Copy all of the signatures from the second argument into the first,\n     * which is modified by side effect, checking for conflicts\n     *\n     * @param {Object.<string, function|typed-reference>} dest\n     * @param {Object.<string, function|typed-reference>} source\n     */\n    function mergeSignatures(dest, source) {\n      let key;\n      for (key in source) {\n        if (Object.prototype.hasOwnProperty.call(source, key)) {\n          if (key in dest) {\n            if (source[key] !== dest[key]) {\n              const err = new Error('Signature \"' + key + '\" is defined twice');\n              err.data = {\n                signature: key,\n                sourceFunction: source[key],\n                destFunction: dest[key]\n              };\n              throw err;\n            }\n            // else: both signatures point to the same function, that's fine\n          }\n          dest[key] = source[key];\n        }\n      }\n    }\n    const saveTyped = typed;\n\n    /**\n     * Originally the main function was a typed function itself, but then\n     * it might not be able to generate error messages if the client\n     * replaced the type system with different names.\n     *\n     * Main entry: typed([name], functions/objects with signatures...)\n     *\n     * Assembles and returns a new typed-function from the given items\n     * that provide signatures and implementations, each of which may be\n     * * a plain object mapping (string) signatures to implementing functions,\n     * * a previously constructed typed function, or\n     * * any other single function with a string-valued property `signature`.\n      * The name of the resulting typed-function will be given by the\n     * string-valued name argument if present, or if not, by the name\n     * of any of the arguments that have one, as long as any that do are\n     * consistent with each other. If no name is specified, the name will be\n     * an empty string.\n     *\n     * @param {string} maybeName [optional]\n     * @param {(function|object)[]} signature providers\n     * @returns {typed-function}\n     */\n    typed = function (maybeName) {\n      const named = typeof maybeName === 'string';\n      const start = named ? 1 : 0;\n      let name = named ? maybeName : '';\n      const allSignatures = {};\n      for (let i = start; i < arguments.length; ++i) {\n        const item = arguments[i];\n        let theseSignatures = {};\n        let thisName;\n        if (typeof item === 'function') {\n          thisName = item.name;\n          if (typeof item.signature === 'string') {\n            // Case 1: Ordinary function with a string 'signature' property\n            theseSignatures[item.signature] = item;\n          } else if (isTypedFunction(item)) {\n            // Case 2: Existing typed function\n            theseSignatures = item.signatures;\n          }\n        } else if (isPlainObject(item)) {\n          // Case 3: Plain object, assume keys = signatures, values = functions\n          theseSignatures = item;\n          if (!named) {\n            thisName = getObjectName(item);\n          }\n        }\n        if (Object.keys(theseSignatures).length === 0) {\n          const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n          err.data = {\n            index: i,\n            argument: item\n          };\n          throw err;\n        }\n        if (!named) {\n          name = checkName(name, thisName);\n        }\n        mergeSignatures(allSignatures, theseSignatures);\n      }\n      return createTypedFunction(name || '', allSignatures);\n    };\n    typed.create = create;\n    typed.createCount = saveTyped.createCount;\n    typed.onMismatch = _onMismatch;\n    typed.throwMismatchError = _onMismatch;\n    typed.createError = createError;\n    typed.clear = clear;\n    typed.clearConversions = clearConversions;\n    typed.addTypes = addTypes;\n    typed._findType = findType; // For unit testing only\n    typed.referTo = referTo;\n    typed.referToSelf = referToSelf;\n    typed.convert = convert;\n    typed.findSignature = findSignature;\n    typed.find = find;\n    typed.isTypedFunction = isTypedFunction;\n    typed.warnAgainstDeprecatedThis = true;\n\n    /**\n     * add a type (convenience wrapper for typed.addTypes)\n     * @param {{name: string, test: function}} type\n     * @param {boolean} [beforeObjectTest=true]\n     *                          If true, the new test will be inserted before\n     *                          the test with name 'Object' (if any), since\n     *                          tests for Object match Array and classes too.\n     */\n    typed.addType = function (type, beforeObjectTest) {\n      let before = 'any';\n      if (beforeObjectTest !== false && typeMap.has('Object')) {\n        before = 'Object';\n      }\n      typed.addTypes([type], before);\n    };\n\n    /**\n     * Verify that the ConversionDef conversion has a valid format.\n     *\n     * @param {conversionDef} conversion\n     * @return {void}\n     * @throws {TypeError|SyntaxError}\n     */\n    function _validateConversion(conversion) {\n      if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n      }\n      if (conversion.to === conversion.from) {\n        throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n      }\n    }\n\n    /**\n     * Add a conversion\n     *\n     * @param {ConversionDef} conversion\n     * @param {{override: boolean}} [options]\n     * @returns {void}\n     * @throws {TypeError}\n     */\n    typed.addConversion = function (conversion) {\n      let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n        override: false\n      };\n      _validateConversion(conversion);\n      const to = findType(conversion.to);\n      const existing = to.conversionsTo.find(other => other.from === conversion.from);\n      if (existing) {\n        if (options && options.override) {\n          typed.removeConversion({\n            from: existing.from,\n            to: conversion.to,\n            convert: existing.convert\n          });\n        } else {\n          throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n        }\n      }\n      to.conversionsTo.push({\n        from: conversion.from,\n        convert: conversion.convert,\n        index: nConversions++\n      });\n    };\n\n    /**\n     * Convenience wrapper to call addConversion on each conversion in a list.\n     *\n     * @param {ConversionDef[]} conversions\n     * @param {{override: boolean}} [options]\n     * @returns {void}\n     * @throws {TypeError}\n     */\n    typed.addConversions = function (conversions, options) {\n      conversions.forEach(conversion => typed.addConversion(conversion, options));\n    };\n\n    /**\n     * Remove the specified conversion. The format is the same as for\n     * addConversion, and the convert function must match or an error\n     * is thrown.\n     *\n     * @param {{from: string, to: string, convert: function}} conversion\n     * @returns {void}\n     * @throws {TypeError|SyntaxError|Error}\n     */\n    typed.removeConversion = function (conversion) {\n      _validateConversion(conversion);\n      const to = findType(conversion.to);\n      const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n      if (!existingConversion) {\n        throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n      }\n      if (existingConversion.convert !== conversion.convert) {\n        throw new Error('Conversion to remove does not match existing conversion');\n      }\n      const index = to.conversionsTo.indexOf(existingConversion);\n      to.conversionsTo.splice(index, 1);\n    };\n\n    /**\n     * Produce the specific signature that a typed function\n     * will execute on the given arguments. Here, a \"signature\" is an\n     * object with properties 'params', 'test', 'fn', and 'implementation'.\n     * This last property is a function that converts params as necessary\n     * and then calls 'fn'. Returns null if there is no matching signature.\n     * @param {typed-function} tf\n     * @param {any[]} argList\n     * @returns {{params: string, test: function, fn: function, implementation: function}}\n     */\n    typed.resolve = function (tf, argList) {\n      if (!isTypedFunction(tf)) {\n        throw new TypeError(NOT_TYPED_FUNCTION);\n      }\n      const sigs = tf._typedFunctionData.signatures;\n      for (let i = 0; i < sigs.length; ++i) {\n        if (sigs[i].test(argList)) {\n          return sigs[i];\n        }\n      }\n      return null;\n    };\n    return typed;\n  }\n  var typedFunction = create();\n\n  return typedFunction;\n\n}));\n//# sourceMappingURL=typed-function.js.map\n","// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by François Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n","function E () {\n  // Keep this empty so it's easier to inherit from\n  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n  on: function (name, callback, ctx) {\n    var e = this.e || (this.e = {});\n\n    (e[name] || (e[name] = [])).push({\n      fn: callback,\n      ctx: ctx\n    });\n\n    return this;\n  },\n\n  once: function (name, callback, ctx) {\n    var self = this;\n    function listener () {\n      self.off(name, listener);\n      callback.apply(ctx, arguments);\n    };\n\n    listener._ = callback\n    return this.on(name, listener, ctx);\n  },\n\n  emit: function (name) {\n    var data = [].slice.call(arguments, 1);\n    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n    var i = 0;\n    var len = evtArr.length;\n\n    for (i; i < len; i++) {\n      evtArr[i].fn.apply(evtArr[i].ctx, data);\n    }\n\n    return this;\n  },\n\n  off: function (name, callback) {\n    var e = this.e || (this.e = {});\n    var evts = e[name];\n    var liveEvents = [];\n\n    if (evts && callback) {\n      for (var i = 0, len = evts.length; i < len; i++) {\n        if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n          liveEvents.push(evts[i]);\n      }\n    }\n\n    // Remove event from queue to prevent memory leak\n    // Suggested by https://github.com/lazd\n    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n    (liveEvents.length)\n      ? e[name] = liveEvents\n      : delete e[name];\n\n    return this;\n  }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n","// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n","// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n","/*\r\n * Natural Sort algorithm for Javascript - Version 0.7 - Released under MIT license\r\n * Author: Jim Palmer (based on chunking idea from Dave Koelle)\r\n */\r\n/*jshint unused:false */\r\nmodule.exports = function naturalSort (a, b) {\r\n\t\"use strict\";\r\n\tvar re = /(^([+\\-]?(?:0|[1-9]\\d*)(?:\\.\\d*)?(?:[eE][+\\-]?\\d+)?)?$|^0x[0-9a-f]+$|\\d+)/gi,\r\n\t\tsre = /(^[ ]*|[ ]*$)/g,\r\n\t\tdre = /(^([\\w ]+,?[\\w ]+)?[\\w ]+,?[\\w ]+\\d+:\\d+(:\\d+)?[\\w ]?|^\\d{1,4}[\\/\\-]\\d{1,4}[\\/\\-]\\d{1,4}|^\\w+, \\w+ \\d+, \\d{4})/,\r\n\t\thre = /^0x[0-9a-f]+$/i,\r\n\t\tore = /^0/,\r\n\t\ti = function(s) { return naturalSort.insensitive && ('' + s).toLowerCase() || '' + s; },\r\n\t\t// convert all to strings strip whitespace\r\n\t\tx = i(a).replace(sre, '') || '',\r\n\t\ty = i(b).replace(sre, '') || '',\r\n\t\t// chunk/tokenize\r\n\t\txN = x.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\tyN = y.replace(re, '\\0$1\\0').replace(/\\0$/,'').replace(/^\\0/,'').split('\\0'),\r\n\t\t// numeric, hex or date detection\r\n\t\txD = parseInt(x.match(hre), 16) || (xN.length !== 1 && x.match(dre) && Date.parse(x)),\r\n\t\tyD = parseInt(y.match(hre), 16) || xD && y.match(dre) && Date.parse(y) || null,\r\n\t\toFxNcL, oFyNcL;\r\n\t// first try and sort Hex codes or Dates\r\n\tif (yD) {\r\n\t\tif ( xD < yD ) { return -1; }\r\n\t\telse if ( xD > yD ) { return 1; }\r\n\t}\r\n\t// natural sorting through split numeric strings and default strings\r\n\tfor(var cLoc=0, numS=Math.max(xN.length, yN.length); cLoc < numS; cLoc++) {\r\n\t\t// find floats not starting with '0', string or 0 if not defined (Clint Priest)\r\n\t\toFxNcL = !(xN[cLoc] || '').match(ore) && parseFloat(xN[cLoc]) || xN[cLoc] || 0;\r\n\t\toFyNcL = !(yN[cLoc] || '').match(ore) && parseFloat(yN[cLoc]) || yN[cLoc] || 0;\r\n\t\t// handle numeric vs string comparison - number < string - (Kyle Adams)\r\n\t\tif (isNaN(oFxNcL) !== isNaN(oFyNcL)) { return (isNaN(oFxNcL)) ? 1 : -1; }\r\n\t\t// rely on string comparison if different types - i.e. '02' < 2 != '02' < '2'\r\n\t\telse if (typeof oFxNcL !== typeof oFyNcL) {\r\n\t\t\toFxNcL += '';\r\n\t\t\toFyNcL += '';\r\n\t\t}\r\n\t\tif (oFxNcL < oFyNcL) { return -1; }\r\n\t\tif (oFxNcL > oFyNcL) { return 1; }\r\n\t}\r\n\treturn 0;\r\n};\r\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","__webpack_require__.amdD = function () {\n\tthrow new Error('define cannot be used indirect');\n};","__webpack_require__.amdO = {};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","import { hasOwnProperty } from './object.js'\n\n/**\n * Get a property of a plain object\n * Throws an error in case the object is not a plain object or the\n * property is not defined on the object itself\n * @param {Object} object\n * @param {string} prop\n * @return {*} Returns the property value when safe\n */\nfunction getSafeProperty (object, prop) {\n  // only allow getting safe properties of a plain object\n  if (isSafeProperty(object, prop)) {\n    return object[prop]\n  }\n\n  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {\n    throw new Error('Cannot access method \"' + prop + '\" as a property')\n  }\n\n  throw new Error('No access to property \"' + prop + '\"')\n}\n\n/**\n * Set a property on a plain object.\n * Throws an error in case the object is not a plain object or the\n * property would override an inherited property like .constructor or .toString\n * @param {Object} object\n * @param {string} prop\n * @param {*} value\n * @return {*} Returns the value\n */\n// TODO: merge this function into access.js?\nfunction setSafeProperty (object, prop, value) {\n  // only allow setting safe properties of a plain object\n  if (isSafeProperty(object, prop)) {\n    object[prop] = value\n    return value\n  }\n\n  throw new Error('No access to property \"' + prop + '\"')\n}\n\n/**\n * Test whether a property is safe to use on an object or Array.\n * For example .toString and .constructor are not safe\n * @param {Object | Array} object\n * @param {string} prop\n * @return {boolean} Returns true when safe\n */\nfunction isSafeProperty (object, prop) {\n  if (!isPlainObject(object) && !Array.isArray(object)) {\n    return false\n  }\n  // SAFE: whitelisted\n  // e.g length\n  if (hasOwnProperty(safeNativeProperties, prop)) {\n    return true\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (prop in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (prop in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false\n  }\n  return true\n}\n\n/**\n * Validate whether a method is safe.\n * Throws an error when that's not the case.\n * @param {Object} object\n * @param {string} method\n * @return {function} Returns the method when valid\n */\nfunction getSafeMethod (object, method) {\n  if (!isSafeMethod(object, method)) {\n    throw new Error('No access to method \"' + method + '\"')\n  }\n\n  return object[method]\n}\n\n/**\n * Check whether a method is safe.\n * Throws an error when that's not the case (for example for `constructor`).\n * @param {Object} object\n * @param {string} method\n * @return {boolean} Returns true when safe, false otherwise\n */\nfunction isSafeMethod (object, method) {\n  if (object === null || object === undefined || typeof object[method] !== 'function') {\n    return false\n  }\n  // UNSAFE: ghosted\n  // e.g overridden toString\n  // Note that IE10 doesn't support __proto__ and we can't do this check there.\n  if (hasOwnProperty(object, method) &&\n      (Object.getPrototypeOf && (method in Object.getPrototypeOf(object)))) {\n    return false\n  }\n  // SAFE: whitelisted\n  // e.g toString\n  if (hasOwnProperty(safeNativeMethods, method)) {\n    return true\n  }\n  // UNSAFE: inherited from Object prototype\n  // e.g constructor\n  if (method in Object.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Object.prototype is a root object\n    return false\n  }\n  // UNSAFE: inherited from Function prototype\n  // e.g call, apply\n  if (method in Function.prototype) {\n    // 'in' is used instead of hasOwnProperty for nodejs v0.10\n    // which is inconsistent on root prototypes. It is safe\n    // here because Function.prototype is a root object\n    return false\n  }\n  return true\n}\n\nfunction isPlainObject (object) {\n  return typeof object === 'object' && object && object.constructor === Object\n}\n\nconst safeNativeProperties = {\n  length: true,\n  name: true\n}\n\nconst safeNativeMethods = {\n  toString: true,\n  valueOf: true,\n  toLocaleString: true\n}\n\nexport { getSafeProperty }\nexport { setSafeProperty }\nexport { isSafeProperty }\nexport { getSafeMethod }\nexport { isSafeMethod }\nexport { isPlainObject }\n","import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js'\nimport { isMap, isObject } from './is.js'\n\n/**\n * A map facade on a bare object.\n *\n * The small number of methods needed to implement a scope,\n * forwarding on to the SafeProperty functions. Over time, the codebase\n * will stop using this method, as all objects will be Maps, rather than\n * more security prone objects.\n */\nexport class ObjectWrappingMap {\n  constructor (object) {\n    this.wrappedObject = object\n\n    this[Symbol.iterator] = this.entries\n  }\n\n  keys () {\n    return Object.keys(this.wrappedObject)\n      .filter(key => this.has(key))\n      .values()\n  }\n\n  get (key) {\n    return getSafeProperty(this.wrappedObject, key)\n  }\n\n  set (key, value) {\n    setSafeProperty(this.wrappedObject, key, value)\n    return this\n  }\n\n  has (key) {\n    return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject\n  }\n\n  entries () {\n    return mapIterator(this.keys(), key => [key, this.get(key)])\n  }\n\n  forEach (callback) {\n    for (const key of this.keys()) {\n      callback(this.get(key), key, this)\n    }\n  }\n\n  delete (key) {\n    if (isSafeProperty(this.wrappedObject, key)) {\n      delete this.wrappedObject[key]\n    }\n  }\n\n  clear () {\n    for (const key of this.keys()) {\n      this.delete(key)\n    }\n  }\n\n  get size () {\n    return Object.keys(this.wrappedObject).length\n  }\n}\n\n/**\n * Create a map with two partitions: a and b.\n * The set with bKeys determines which keys/values are read/written to map b,\n * all other values are read/written to map a\n *\n * For example:\n *\n *   const a = new Map()\n *   const b = new Map()\n *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))\n *\n * In this case, values `x` and `y` are read/written to map `b`,\n * all other values are read/written to map `a`.\n */\nexport class PartitionedMap {\n  /**\n   * @param {Map} a\n   * @param {Map} b\n   * @param {Set} bKeys\n   */\n  constructor (a, b, bKeys) {\n    this.a = a\n    this.b = b\n    this.bKeys = bKeys\n\n    this[Symbol.iterator] = this.entries\n  }\n\n  get (key) {\n    return this.bKeys.has(key)\n      ? this.b.get(key)\n      : this.a.get(key)\n  }\n\n  set (key, value) {\n    if (this.bKeys.has(key)) {\n      this.b.set(key, value)\n    } else {\n      this.a.set(key, value)\n    }\n    return this\n  }\n\n  has (key) {\n    return this.b.has(key) || this.a.has(key)\n  }\n\n  keys () {\n    return new Set([\n      ...this.a.keys(),\n      ...this.b.keys()\n    ])[Symbol.iterator]()\n  }\n\n  entries () {\n    return mapIterator(this.keys(), key => [key, this.get(key)])\n  }\n\n  forEach (callback) {\n    for (const key of this.keys()) {\n      callback(this.get(key), key, this)\n    }\n  }\n\n  delete (key) {\n    return this.bKeys.has(key)\n      ? this.b.delete(key)\n      : this.a.delete(key)\n  }\n\n  clear () {\n    this.a.clear()\n    this.b.clear()\n  }\n\n  get size () {\n    return [...this.keys()].length\n  }\n}\n\n/**\n * Create a new iterator that maps over the provided iterator, applying a mapping function to each item\n */\nfunction mapIterator (it, callback) {\n  return {\n    next: () => {\n      const n = it.next()\n      return (n.done)\n        ? n\n        : {\n            value: callback(n.value),\n            done: false\n          }\n    }\n  }\n}\n\n/**\n * Creates an empty map, or whatever your platform's polyfill is.\n *\n * @returns an empty Map or Map like object.\n */\nexport function createEmptyMap () {\n  return new Map()\n}\n\n/**\n * Creates a Map from the given object.\n *\n * @param { Map | { [key: string]: unknown } | undefined } mapOrObject\n * @returns\n */\nexport function createMap (mapOrObject) {\n  if (!mapOrObject) {\n    return createEmptyMap()\n  }\n  if (isMap(mapOrObject)) {\n    return mapOrObject\n  }\n  if (isObject(mapOrObject)) {\n    return new ObjectWrappingMap(mapOrObject)\n  }\n\n  throw new Error('createMap can create maps from objects or Maps')\n}\n\n/**\n * Unwraps a map into an object.\n *\n * @param {Map} map\n * @returns { [key: string]: unknown }\n */\nexport function toObject (map) {\n  if (map instanceof ObjectWrappingMap) {\n    return map.wrappedObject\n  }\n  const object = {}\n  for (const key of map.keys()) {\n    const value = map.get(key)\n    setSafeProperty(object, key, value)\n  }\n  return object\n}\n\n/**\n * Copies the contents of key-value pairs from each `objects` in to `map`.\n *\n * Object is `objects` can be a `Map` or object.\n *\n * This is the `Map` analog to `Object.assign`.\n */\nexport function assign (map, ...objects) {\n  for (const args of objects) {\n    if (!args) {\n      continue\n    }\n    if (isMap(args)) {\n      for (const key of args.keys()) {\n        map.set(key, args.get(key))\n      }\n    } else if (isObject(args)) {\n      for (const key of Object.keys(args)) {\n        map.set(key, args[key])\n      }\n    }\n  }\n  return map\n}\n","// type checks for all known types\n//\n// note that:\n//\n// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.\n//   instanceof cannot be used because that would not allow to pass data from\n//   one instance of math.js to another since each has it's own instance of Unit.\n// - check the `isUnit` property via the constructor, so there will be no\n//   matches for \"fake\" instances like plain objects with a property `isUnit`.\n//   That is important for security reasons.\n// - It must not be possible to override the type checks used internally,\n//   for security reasons, so these functions are not exposed in the expression\n//   parser.\n\nimport { ObjectWrappingMap } from './map.js'\n\nexport function isNumber (x) {\n  return typeof x === 'number'\n}\n\nexport function isBigNumber (x) {\n  if (\n    !x || typeof x !== 'object' ||\n    typeof x.constructor !== 'function'\n  ) {\n    return false\n  }\n\n  if (\n    x.isBigNumber === true &&\n    typeof x.constructor.prototype === 'object' &&\n    x.constructor.prototype.isBigNumber === true\n  ) {\n    return true\n  }\n\n  if (\n    typeof x.constructor.isDecimal === 'function' &&\n    x.constructor.isDecimal(x) === true\n  ) {\n    return true\n  }\n\n  return false\n}\n\nexport function isBigInt (x) {\n  return typeof x === 'bigint'\n}\n\nexport function isComplex (x) {\n  return (x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true) || false\n}\n\nexport function isFraction (x) {\n  return (x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true) || false\n}\n\nexport function isUnit (x) {\n  return (x && x.constructor.prototype.isUnit === true) || false\n}\n\nexport function isString (x) {\n  return typeof x === 'string'\n}\n\nexport const isArray = Array.isArray\n\nexport function isMatrix (x) {\n  return (x && x.constructor.prototype.isMatrix === true) || false\n}\n\n/**\n * Test whether a value is a collection: an Array or Matrix\n * @param {*} x\n * @returns {boolean} isCollection\n */\nexport function isCollection (x) {\n  return Array.isArray(x) || isMatrix(x)\n}\n\nexport function isDenseMatrix (x) {\n  return (x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true) || false\n}\n\nexport function isSparseMatrix (x) {\n  return (x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true) || false\n}\n\nexport function isRange (x) {\n  return (x && x.constructor.prototype.isRange === true) || false\n}\n\nexport function isIndex (x) {\n  return (x && x.constructor.prototype.isIndex === true) || false\n}\n\nexport function isBoolean (x) {\n  return typeof x === 'boolean'\n}\n\nexport function isResultSet (x) {\n  return (x && x.constructor.prototype.isResultSet === true) || false\n}\n\nexport function isHelp (x) {\n  return (x && x.constructor.prototype.isHelp === true) || false\n}\n\nexport function isFunction (x) {\n  return typeof x === 'function'\n}\n\nexport function isDate (x) {\n  return x instanceof Date\n}\n\nexport function isRegExp (x) {\n  return x instanceof RegExp\n}\n\nexport function isObject (x) {\n  return !!(x &&\n    typeof x === 'object' &&\n    x.constructor === Object &&\n    !isComplex(x) &&\n    !isFraction(x))\n}\n\n/**\n * Returns `true` if the passed object appears to be a Map (i.e. duck typing).\n *\n * Methods looked for are `get`, `set`, `keys` and `has`.\n *\n * @param {Map | object} object\n * @returns\n */\nexport function isMap (object) {\n  // We can use the fast instanceof, or a slower duck typing check.\n  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.\n  if (!object) {\n    return false\n  }\n  return object instanceof Map ||\n    object instanceof ObjectWrappingMap ||\n    (\n      typeof object.set === 'function' &&\n      typeof object.get === 'function' &&\n      typeof object.keys === 'function' &&\n      typeof object.has === 'function'\n    )\n}\n\nexport function isPartitionedMap (object) {\n  return isMap(object) && isMap(object.a) && isMap(object.b)\n}\n\nexport function isObjectWrappingMap (object) {\n  return isMap(object) && isObject(object.wrappedObject)\n}\n\nexport function isNull (x) {\n  return x === null\n}\n\nexport function isUndefined (x) {\n  return x === undefined\n}\n\nexport function isAccessorNode (x) {\n  return (x && x.isAccessorNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isArrayNode (x) {\n  return (x && x.isArrayNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isAssignmentNode (x) {\n  return (x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isBlockNode (x) {\n  return (x && x.isBlockNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isConditionalNode (x) {\n  return (x && x.isConditionalNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isConstantNode (x) {\n  return (x && x.isConstantNode === true && x.constructor.prototype.isNode === true) || false\n}\n\n/* Very specialized: returns true for those nodes which in the numerator of\n   a fraction means that the division in that fraction has precedence over implicit\n   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but\n   6!/8 x parses as 6! / (8x). It is located here because it is shared between\n   parse.js and OperatorNode.js (for parsing and printing, respectively).\n\n   This should *not* be exported from mathjs, unlike most of the tests here.\n   Its name does not start with 'is' to prevent utils/snapshot.js from thinking\n   it should be exported.\n*/\nexport function rule2Node (node) {\n  return isConstantNode(node) ||\n    (isOperatorNode(node) &&\n     node.args.length === 1 &&\n     isConstantNode(node.args[0]) &&\n     '-+~'.includes(node.op))\n}\n\nexport function isFunctionAssignmentNode (x) {\n  return (x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isFunctionNode (x) {\n  return (x && x.isFunctionNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isIndexNode (x) {\n  return (x && x.isIndexNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isNode (x) {\n  return (x && x.isNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isObjectNode (x) {\n  return (x && x.isObjectNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isOperatorNode (x) {\n  return (x && x.isOperatorNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isParenthesisNode (x) {\n  return (x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isRangeNode (x) {\n  return (x && x.isRangeNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isRelationalNode (x) {\n  return (x && x.isRelationalNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isSymbolNode (x) {\n  return (x && x.isSymbolNode === true && x.constructor.prototype.isNode === true) || false\n}\n\nexport function isChain (x) {\n  return (x && x.constructor.prototype.isChain === true) || false\n}\n\nexport function typeOf (x) {\n  const t = typeof x\n\n  if (t === 'object') {\n    if (x === null) return 'null'\n    if (isBigNumber(x)) return 'BigNumber' // Special: weird mashup with Decimal\n    if (x.constructor && x.constructor.name) return x.constructor.name\n\n    return 'Object' // just in case\n  }\n\n  return t // can be 'string', 'number', 'boolean', 'function', 'bigint', ...\n}\n","import { isBigNumber, isObject } from './is.js'\n\n/**\n * Clone an object\n *\n *     clone(x)\n *\n * Can clone any primitive type, array, and object.\n * If x has a function clone, this function will be invoked to clone the object.\n *\n * @param {*} x\n * @return {*} clone\n */\nexport function clone (x) {\n  const type = typeof x\n\n  // immutable primitive types\n  if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' ||\n      x === null || x === undefined) {\n    return x\n  }\n\n  // use clone function of the object when available\n  if (typeof x.clone === 'function') {\n    return x.clone()\n  }\n\n  // array\n  if (Array.isArray(x)) {\n    return x.map(function (value) {\n      return clone(value)\n    })\n  }\n\n  if (x instanceof Date) return new Date(x.valueOf())\n  if (isBigNumber(x)) return x // bignumbers are immutable\n\n  // object\n  if (isObject(x)) {\n    return mapObject(x, clone)\n  }\n\n  if (type === 'function') {\n    // we assume that the function is immutable\n    return x\n  }\n\n  throw new TypeError(`Cannot clone: unknown type of value (value: ${x})`)\n}\n\n/**\n * Apply map to all properties of an object\n * @param {Object} object\n * @param {function} callback\n * @return {Object} Returns a copy of the object with mapped properties\n */\nexport function mapObject (object, callback) {\n  const clone = {}\n\n  for (const key in object) {\n    if (hasOwnProperty(object, key)) {\n      clone[key] = callback(object[key])\n    }\n  }\n\n  return clone\n}\n\n/**\n * Extend object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @return {Object} a\n */\nexport function extend (a, b) {\n  for (const prop in b) {\n    if (hasOwnProperty(b, prop)) {\n      a[prop] = b[prop]\n    }\n  }\n  return a\n}\n\n/**\n * Deep extend an object a with the properties of object b\n * @param {Object} a\n * @param {Object} b\n * @returns {Object}\n */\nexport function deepExtend (a, b) {\n  // TODO: add support for Arrays to deepExtend\n  if (Array.isArray(b)) {\n    throw new TypeError('Arrays are not supported by deepExtend')\n  }\n\n  for (const prop in b) {\n    // We check against prop not being in Object.prototype or Function.prototype\n    // to prevent polluting for example Object.__proto__.\n    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {\n      if (b[prop] && b[prop].constructor === Object) {\n        if (a[prop] === undefined) {\n          a[prop] = {}\n        }\n        if (a[prop] && a[prop].constructor === Object) {\n          deepExtend(a[prop], b[prop])\n        } else {\n          a[prop] = b[prop]\n        }\n      } else if (Array.isArray(b[prop])) {\n        throw new TypeError('Arrays are not supported by deepExtend')\n      } else {\n        a[prop] = b[prop]\n      }\n    }\n  }\n  return a\n}\n\n/**\n * Deep test equality of all fields in two pairs of arrays or objects.\n * Compares values and functions strictly (ie. 2 is not the same as '2').\n * @param {Array | Object} a\n * @param {Array | Object} b\n * @returns {boolean}\n */\nexport function deepStrictEqual (a, b) {\n  let prop, i, len\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b)) {\n      return false\n    }\n\n    if (a.length !== b.length) {\n      return false\n    }\n\n    for (i = 0, len = a.length; i < len; i++) {\n      if (!deepStrictEqual(a[i], b[i])) {\n        return false\n      }\n    }\n    return true\n  } else if (typeof a === 'function') {\n    return (a === b)\n  } else if (a instanceof Object) {\n    if (Array.isArray(b) || !(b instanceof Object)) {\n      return false\n    }\n\n    for (prop in a) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {\n        return false\n      }\n    }\n    for (prop in b) {\n      // noinspection JSUnfilteredForInLoop\n      if (!(prop in a)) {\n        return false\n      }\n    }\n    return true\n  } else {\n    return (a === b)\n  }\n}\n\n/**\n * Recursively flatten a nested object.\n * @param {Object} nestedObject\n * @return {Object} Returns the flattened object\n */\nexport function deepFlatten (nestedObject) {\n  const flattenedObject = {}\n\n  _deepFlatten(nestedObject, flattenedObject)\n\n  return flattenedObject\n}\n\n// helper function used by deepFlatten\nfunction _deepFlatten (nestedObject, flattenedObject) {\n  for (const prop in nestedObject) {\n    if (hasOwnProperty(nestedObject, prop)) {\n      const value = nestedObject[prop]\n      if (typeof value === 'object' && value !== null) {\n        _deepFlatten(value, flattenedObject)\n      } else {\n        flattenedObject[prop] = value\n      }\n    }\n  }\n}\n\n/**\n * Test whether the current JavaScript engine supports Object.defineProperty\n * @returns {boolean} returns true if supported\n */\nexport function canDefineProperty () {\n  // test needed for broken IE8 implementation\n  try {\n    if (Object.defineProperty) {\n      Object.defineProperty({}, 'x', { get: function () { return null } })\n      return true\n    }\n  } catch (e) {}\n\n  return false\n}\n\n/**\n * Attach a lazy loading property to a constant.\n * The given function `fn` is called once when the property is first requested.\n *\n * @param {Object} object         Object where to add the property\n * @param {string} prop           Property name\n * @param {Function} valueResolver Function returning the property value. Called\n *                                without arguments.\n */\nexport function lazy (object, prop, valueResolver) {\n  let _uninitialized = true\n  let _value\n\n  Object.defineProperty(object, prop, {\n    get: function () {\n      if (_uninitialized) {\n        _value = valueResolver()\n        _uninitialized = false\n      }\n      return _value\n    },\n\n    set: function (value) {\n      _value = value\n      _uninitialized = false\n    },\n\n    configurable: true,\n    enumerable: true\n  })\n}\n\n/**\n * Traverse a path into an object.\n * When a namespace is missing, it will be created\n * @param {Object} object\n * @param {string | string[]} path   A dot separated string like 'name.space'\n * @return {Object} Returns the object at the end of the path\n */\nexport function traverse (object, path) {\n  if (path && typeof path === 'string') {\n    return traverse(object, path.split('.'))\n  }\n\n  let obj = object\n\n  if (path) {\n    for (let i = 0; i < path.length; i++) {\n      const key = path[i]\n      if (!(key in obj)) {\n        obj[key] = {}\n      }\n      obj = obj[key]\n    }\n  }\n\n  return obj\n}\n\n/**\n * A safe hasOwnProperty\n * @param {Object} object\n * @param {string} property\n */\nexport function hasOwnProperty (object, property) {\n  return object && Object.hasOwnProperty.call(object, property)\n}\n\n/**\n * Test whether an object is a factory. a factory has fields:\n *\n * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)\n * - name: string (optional)\n * - path: string    A dot separated path (optional)\n * - math: boolean   If true (false by default), the math namespace is passed\n *                   as fifth argument of the factory function\n *\n * @param {*} object\n * @returns {boolean}\n */\nexport function isLegacyFactory (object) {\n  return object && typeof object.factory === 'function'\n}\n\n/**\n * Get a nested property from an object\n * @param {Object} object\n * @param {string | string[]} path\n * @returns {Object}\n */\nexport function get (object, path) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return get(object, path.split('.'))\n    } else {\n      return object[path]\n    }\n  }\n\n  let child = object\n\n  for (let i = 0; i < path.length; i++) {\n    const key = path[i]\n    child = child ? child[key] : undefined\n  }\n\n  return child\n}\n\n/**\n * Set a nested property in an object\n * Mutates the object itself\n * If the path doesn't exist, it will be created\n * @param {Object} object\n * @param {string | string[]} path\n * @param {*} value\n * @returns {Object}\n */\nexport function set (object, path, value) {\n  if (typeof path === 'string') {\n    if (isPath(path)) {\n      return set(object, path.split('.'), value)\n    } else {\n      object[path] = value\n      return object\n    }\n  }\n\n  let child = object\n  for (let i = 0; i < path.length - 1; i++) {\n    const key = path[i]\n    if (child[key] === undefined) {\n      child[key] = {}\n    }\n    child = child[key]\n  }\n\n  if (path.length > 0) {\n    const lastKey = path[path.length - 1]\n    child[lastKey] = value\n  }\n\n  return object\n}\n\n/**\n * Create an object composed of the picked object properties\n * @param {Object} object\n * @param {string[]} properties\n * @param {function} [transform] Optional value to transform a value when picking it\n * @return {Object}\n */\nexport function pick (object, properties, transform) {\n  const copy = {}\n\n  for (let i = 0; i < properties.length; i++) {\n    const key = properties[i]\n    const value = get(object, key)\n    if (value !== undefined) {\n      set(copy, key, transform ? transform(value, key) : value)\n    }\n  }\n\n  return copy\n}\n\n/**\n * Shallow version of pick, creating an object composed of the picked object properties\n * but not for nested properties\n * @param {Object} object\n * @param {string[]} properties\n * @return {Object}\n */\nexport function pickShallow (object, properties) {\n  const copy = {}\n\n  for (let i = 0; i < properties.length; i++) {\n    const key = properties[i]\n    const value = object[key]\n    if (value !== undefined) {\n      copy[key] = value\n    }\n  }\n\n  return copy\n}\n\n// helper function to test whether a string contains a path like 'user.name'\nfunction isPath (str) {\n  return str.includes('.')\n}\n","import { pickShallow } from './object.js'\n\n/**\n * Create a factory function, which can be used to inject dependencies.\n *\n * The created functions are memoized, a consecutive call of the factory\n * with the exact same inputs will return the same function instance.\n * The memoized cache is exposed on `factory.cache` and can be cleared\n * if needed.\n *\n * Example:\n *\n *     const name = 'log'\n *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n *\n *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n *       // ... create the function log here and return it\n *     }\n *\n * @param {string} name           Name of the function to be created\n * @param {string[]} dependencies The names of all required dependencies\n * @param {function} create       Callback function called with an object with all dependencies\n * @param {Object} [meta]\n *     Optional object with meta information that will be attached\n *     to the created factory function as property `meta`. For explanation\n *     of what meta properties can be specified and what they mean, see\n *     docs/core/extension.md.\n * @returns {function}\n */\nexport function factory (name, dependencies, create, meta) {\n  function assertAndCreate (scope) {\n    // we only pass the requested dependencies to the factory function\n    // to prevent functions to rely on dependencies that are not explicitly\n    // requested.\n    const deps = pickShallow(scope, dependencies.map(stripOptionalNotation))\n\n    assertDependencies(name, dependencies, scope)\n\n    return create(deps)\n  }\n\n  assertAndCreate.isFactory = true\n  assertAndCreate.fn = name\n  assertAndCreate.dependencies = dependencies.slice().sort()\n  if (meta) {\n    assertAndCreate.meta = meta\n  }\n\n  return assertAndCreate\n}\n\n/**\n * Sort all factories such that when loading in order, the dependencies are resolved.\n *\n * @param {Array} factories\n * @returns {Array} Returns a new array with the sorted factories.\n */\nexport function sortFactories (factories) {\n  const factoriesByName = {}\n\n  factories.forEach(factory => {\n    factoriesByName[factory.fn] = factory\n  })\n\n  function containsDependency (factory, dependency) {\n    // TODO: detect circular references\n    if (isFactory(factory)) {\n      if (factory.dependencies.includes(dependency.fn || dependency.name)) {\n        return true\n      }\n\n      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {\n        return true\n      }\n    }\n\n    return false\n  }\n\n  const sorted = []\n\n  function addFactory (factory) {\n    let index = 0\n    while (index < sorted.length && !containsDependency(sorted[index], factory)) {\n      index++\n    }\n\n    sorted.splice(index, 0, factory)\n  }\n\n  // sort regular factory functions\n  factories\n    .filter(isFactory)\n    .forEach(addFactory)\n\n  // sort legacy factory functions AFTER the regular factory functions\n  factories\n    .filter(factory => !isFactory(factory))\n    .forEach(addFactory)\n\n  return sorted\n}\n\n// TODO: comment or cleanup if unused in the end\nexport function create (factories, scope = {}) {\n  sortFactories(factories)\n    .forEach(factory => factory(scope))\n\n  return scope\n}\n\n/**\n * Test whether an object is a factory. This is the case when it has\n * properties name, dependencies, and a function create.\n * @param {*} obj\n * @returns {boolean}\n */\nexport function isFactory (obj) {\n  return typeof obj === 'function' &&\n    typeof obj.fn === 'string' &&\n    Array.isArray(obj.dependencies)\n}\n\n/**\n * Assert that all dependencies of a list with dependencies are available in the provided scope.\n *\n * Will throw an exception when there are dependencies missing.\n *\n * @param {string} name   Name for the function to be created. Used to generate a useful error message\n * @param {string[]} dependencies\n * @param {Object} scope\n */\nexport function assertDependencies (name, dependencies, scope) {\n  const allDefined = dependencies\n    .filter(dependency => !isOptionalDependency(dependency)) // filter optionals\n    .every(dependency => scope[dependency] !== undefined)\n\n  if (!allDefined) {\n    const missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined)\n\n    // TODO: create a custom error class for this, a MathjsError or something like that\n    throw new Error(`Cannot create function \"${name}\", ` +\n      `some dependencies are missing: ${missingDependencies.map(d => `\"${d}\"`).join(', ')}.`)\n  }\n}\n\nexport function isOptionalDependency (dependency) {\n  return dependency && dependency[0] === '?'\n}\n\nexport function stripOptionalNotation (dependency) {\n  return dependency && dependency[0] === '?'\n    ? dependency.slice(1)\n    : dependency\n}\n","import { isBigNumber, isNumber, isObject } from './is.js'\n\n/**\n * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue\n */\n\n/**\n * Check if a number is integer\n * @param {number | boolean} value\n * @return {boolean} isInteger\n */\nexport function isInteger (value) {\n  if (typeof value === 'boolean') {\n    return true\n  }\n\n  return isFinite(value)\n    ? (value === Math.round(value))\n    : false\n}\n\n/**\n * Ensure the number type is compatible with the provided value.\n * If not, return 'number' instead.\n *\n * For example:\n *\n *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })\n *\n * will return 'number' and not 'bigint' because trying to create a bigint with\n * value 2.3 would throw an exception.\n *\n * @param {string} numberStr\n * @param {{\n *   number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'\n *   numberFallback: 'number' | 'BigNumber'\n * }} config\n * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}\n */\nexport function safeNumberType (numberStr, config) {\n  if (config.number === 'bigint') {\n    try {\n      BigInt(numberStr)\n    } catch {\n      return config.numberFallback\n    }\n  }\n\n  return config.number\n}\n\n/**\n * Calculate the sign of a number\n * @param {number} x\n * @returns {number}\n */\nexport const sign = Math.sign || function (x) {\n  if (x > 0) {\n    return 1\n  } else if (x < 0) {\n    return -1\n  } else {\n    return 0\n  }\n}\n\n/**\n * Calculate the base-2 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport const log2 = Math.log2 || function log2 (x) {\n  return Math.log(x) / Math.LN2\n}\n\n/**\n * Calculate the base-10 logarithm of a number\n * @param {number} x\n * @returns {number}\n */\nexport const log10 = Math.log10 || function log10 (x) {\n  return Math.log(x) / Math.LN10\n}\n\n/**\n * Calculate the natural logarithm of a number + 1\n * @param {number} x\n * @returns {number}\n */\nexport const log1p = Math.log1p || function (x) {\n  return Math.log(x + 1)\n}\n\n/**\n * Calculate cubic root for a number\n *\n * Code from es6-shim.js:\n *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577\n *\n * @param {number} x\n * @returns {number} Returns the cubic root of x\n */\nexport const cbrt = Math.cbrt || function cbrt (x) {\n  if (x === 0) {\n    return x\n  }\n\n  const negate = x < 0\n  let result\n  if (negate) {\n    x = -x\n  }\n\n  if (isFinite(x)) {\n    result = Math.exp(Math.log(x) / 3)\n    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods\n    result = (x / (result * result) + (2 * result)) / 3\n  } else {\n    result = x\n  }\n\n  return negate ? -result : result\n}\n\n/**\n * Calculates exponentiation minus 1\n * @param {number} x\n * @return {number} res\n */\nexport const expm1 = Math.expm1 || function expm1 (x) {\n  return (x >= 2e-4 || x <= -2e-4)\n    ? Math.exp(x) - 1\n    : x + x * x / 2 + x * x * x / 6\n}\n\n/**\n * Formats a number in a given base\n * @param {number} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatNumberToBase (n, base, size) {\n  const prefixes = { 2: '0b', 8: '0o', 16: '0x' }\n  const prefix = prefixes[base]\n  let suffix = ''\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0')\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer')\n    }\n    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {\n      throw new Error(`Value must be in range [-2^${size - 1}, 2^${size - 1}-1]`)\n    }\n    if (!isInteger(n)) {\n      throw new Error('Value must be an integer')\n    }\n    if (n < 0) {\n      n = n + 2 ** size\n    }\n    suffix = `i${size}`\n  }\n  let sign = ''\n  if (n < 0) {\n    n = -n\n    sign = '-'\n  }\n  return `${sign}${prefix}${n.toString(base)}${suffix}`\n}\n\n/**\n * Convert a number to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'engineering'    Always use engineering notation.\n *                                          For example '123.4e+0' and '14.0e+6'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lowerExp` and `upperExp` bounds, and\n *                                          uses exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default,\n *                                          not rounding any digits.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12.071, {notation: 'fixed'})                // '12'\n *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'\n *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'\n *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'\n *\n * @param {number} value\n * @param {Object | Function | number} [options]\n * @return {string} str The formatted value\n */\nexport function format (value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value)\n  }\n\n  // handle special cases\n  if (value === Infinity) {\n    return 'Infinity'\n  } else if (value === -Infinity) {\n    return '-Infinity'\n  } else if (isNaN(value)) {\n    return 'NaN'\n  }\n\n  const { notation, precision, wordSize } = normalizeFormatOptions(options)\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision)\n\n    case 'exponential':\n      return toExponential(value, precision)\n\n    case 'engineering':\n      return toEngineering(value, precision)\n\n    case 'bin':\n      return formatNumberToBase(value, 2, wordSize)\n\n    case 'oct':\n      return formatNumberToBase(value, 8, wordSize)\n\n    case 'hex':\n      return formatNumberToBase(value, 16, wordSize)\n\n    case 'auto':\n      // remove trailing zeros after the decimal point\n      return toPrecision(value, precision, options)\n        .replace(/((\\.\\d*?)(0+))($|e)/, function () {\n          const digits = arguments[2]\n          const e = arguments[4]\n          return (digits !== '.') ? digits + e : e\n        })\n\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' +\n        'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.')\n  }\n}\n\n/**\n * Normalize format options into an object:\n *   {\n *     notation: string,\n *     precision: number | undefined,\n *     wordSize: number | undefined\n *   }\n */\nexport function normalizeFormatOptions (options) {\n  // default values for options\n  let notation = 'auto'\n  let precision\n  let wordSize\n\n  if (options !== undefined) {\n    if (isNumber(options)) {\n      precision = options\n    } else if (isBigNumber(options)) {\n      precision = options.toNumber()\n    } else if (isObject(options)) {\n      if (options.precision !== undefined) {\n        precision = _toNumberOrThrow(options.precision, () => {\n          throw new Error('Option \"precision\" must be a number or BigNumber')\n        })\n      }\n\n      if (options.wordSize !== undefined) {\n        wordSize = _toNumberOrThrow(options.wordSize, () => {\n          throw new Error('Option \"wordSize\" must be a number or BigNumber')\n        })\n      }\n\n      if (options.notation) {\n        notation = options.notation\n      }\n    } else {\n      throw new Error('Unsupported type of options, number, BigNumber, or object expected')\n    }\n  }\n\n  return { notation, precision, wordSize }\n}\n\n/**\n * Split a number into sign, coefficients, and exponent\n * @param {number | string} value\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n */\nexport function splitNumber (value) {\n  // parse the input value\n  const match = String(value).toLowerCase().match(/^(-?)(\\d+\\.?\\d*)(e([+-]?\\d+))?$/)\n  if (!match) {\n    throw new SyntaxError('Invalid number ' + value)\n  }\n\n  const sign = match[1]\n  const digits = match[2]\n  let exponent = parseFloat(match[4] || '0')\n\n  const dot = digits.indexOf('.')\n  exponent += (dot !== -1) ? (dot - 1) : (digits.length - 1)\n\n  const coefficients = digits\n    .replace('.', '') // remove the dot (must be removed before removing leading zeros)\n    .replace(/^0*/, function (zeros) {\n      // remove leading zeros, add their count to the exponent\n      exponent -= zeros.length\n      return ''\n    })\n    .replace(/0*$/, '') // remove trailing zeros\n    .split('')\n    .map(function (d) {\n      return parseInt(d)\n    })\n\n  if (coefficients.length === 0) {\n    coefficients.push(0)\n    exponent++\n  }\n\n  return { sign, coefficients, exponent }\n}\n\n/**\n * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value)\n  }\n\n  const split = splitNumber(value)\n  const rounded = roundDigits(split, precision)\n\n  const e = rounded.exponent\n  const c = rounded.coefficients\n\n  // find nearest lower multiple of 3 for exponent\n  const newExp = e % 3 === 0 ? e : (e < 0 ? (e - 3) - (e % 3) : e - (e % 3))\n\n  if (isNumber(precision)) {\n    // add zeroes to give correct sig figs\n    while (precision > c.length || (e - newExp) + 1 > c.length) {\n      c.push(0)\n    }\n  } else {\n    // concatenate coefficients with necessary zeros\n    // add zeros if necessary (for example: 1e+8 -> 100e+6)\n    const missingZeros = Math.abs(e - newExp) - (c.length - 1)\n    for (let i = 0; i < missingZeros; i++) {\n      c.push(0)\n    }\n  }\n\n  // find difference in exponents\n  let expDiff = Math.abs(e - newExp)\n  let decimalIdx = 1\n\n  // push decimal index over by expDiff times\n  while (expDiff > 0) {\n    decimalIdx++\n    expDiff--\n  }\n\n  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.\n  // otherwise concat with the rest of the coefficients\n  const decimals = c.slice(decimalIdx).join('')\n  const decimalVal = ((isNumber(precision) && decimals.length) || decimals.match(/[1-9]/)) ? ('.' + decimals) : ''\n\n  const str = c.slice(0, decimalIdx).join('') +\n    decimalVal +\n    'e' + (e >= 0 ? '+' : '') + newExp.toString()\n  return rounded.sign + str\n}\n\n/**\n * Format a number with fixed notation.\n * @param {number | string} value\n * @param {number} [precision=undefined]  Optional number of decimals after the\n *                                        decimal point. null by default.\n */\nexport function toFixed (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value)\n  }\n\n  const splitValue = splitNumber(value)\n  const rounded = (typeof precision === 'number')\n    ? roundDigits(splitValue, splitValue.exponent + 1 + precision)\n    : splitValue\n  let c = rounded.coefficients\n  let p = rounded.exponent + 1 // exponent may have changed\n\n  // append zeros if needed\n  const pp = p + (precision || 0)\n  if (c.length < pp) {\n    c = c.concat(zeros(pp - c.length))\n  }\n\n  // prepend zeros if needed\n  if (p < 0) {\n    c = zeros(-p + 1).concat(c)\n    p = 1\n  }\n\n  // insert a dot if needed\n  if (p < c.length) {\n    c.splice(p, 0, (p === 0) ? '0.' : '.')\n  }\n\n  return rounded.sign + c.join('')\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {number | string} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n */\nexport function toExponential (value, precision) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value)\n  }\n\n  // round if needed, else create a clone\n  const split = splitNumber(value)\n  const rounded = precision ? roundDigits(split, precision) : split\n  let c = rounded.coefficients\n  const e = rounded.exponent\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length))\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  const first = c.shift()\n  return rounded.sign + first + (c.length > 0 ? ('.' + c.join('')) : '') +\n    'e' + (e >= 0 ? '+' : '') + e\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision (value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value)\n  }\n\n  // determine lower and upper bound for exponential notation.\n  const lowerExp = _toNumberOrDefault(options?.lowerExp, -3)\n  const upperExp = _toNumberOrDefault(options?.upperExp, 5)\n\n  const split = splitNumber(value)\n  const rounded = precision ? roundDigits(split, precision) : split\n  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {\n    // exponential notation\n    return toExponential(value, precision)\n  } else {\n    let c = rounded.coefficients\n    const e = rounded.exponent\n\n    // append trailing zeros\n    if (c.length < precision) {\n      c = c.concat(zeros(precision - c.length))\n    }\n\n    // append trailing zeros\n    // TODO: simplify the next statement\n    c = c.concat(zeros(e - c.length + 1 +\n      (c.length < precision ? precision - c.length : 0)))\n\n    // prepend zeros\n    c = zeros(-e).concat(c)\n\n    const dot = e > 0 ? e : 0\n    if (dot < c.length - 1) {\n      c.splice(dot + 1, 0, '.')\n    }\n\n    return rounded.sign + c.join('')\n  }\n}\n\n/**\n * Round the number of digits of a number *\n * @param {SplitValue} split       A value split with .splitNumber(value)\n * @param {number} precision  A positive integer\n * @return {SplitValue}\n *              Returns an object containing sign, coefficients, and exponent\n *              with rounded digits\n */\nexport function roundDigits (split, precision) {\n  // create a clone\n  const rounded = {\n    sign: split.sign,\n    coefficients: split.coefficients,\n    exponent: split.exponent\n  }\n  const c = rounded.coefficients\n\n  // prepend zeros if needed\n  while (precision <= 0) {\n    c.unshift(0)\n    rounded.exponent++\n    precision++\n  }\n\n  if (c.length > precision) {\n    const removed = c.splice(precision, c.length - precision)\n\n    if (removed[0] >= 5) {\n      let i = precision - 1\n      c[i]++\n      while (c[i] === 10) {\n        c.pop()\n        if (i === 0) {\n          c.unshift(0)\n          rounded.exponent++\n          i++\n        }\n        i--\n        c[i]++\n      }\n    }\n  }\n\n  return rounded\n}\n\n/**\n * Create an array filled with zeros.\n * @param {number} length\n * @return {Array}\n */\nfunction zeros (length) {\n  const arr = []\n  for (let i = 0; i < length; i++) {\n    arr.push(0)\n  }\n  return arr\n}\n\n/**\n * Count the number of significant digits of a number.\n *\n * For example:\n *   2.34 returns 3\n *   0.0034 returns 2\n *   120.5e+30 returns 4\n *\n * @param {number} value\n * @return {number} digits   Number of significant digits\n */\nexport function digits (value) {\n  return value\n    .toExponential()\n    .replace(/e.*$/, '') // remove exponential notation\n    .replace(/^0\\.?0*|\\./, '') // remove decimal point and leading zeros\n    .length\n}\n\n/**\n * Compares two floating point numbers.\n * @param {number} a - First value to compare\n * @param {number} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @return {boolean} whether the two numbers are nearly equal\n *\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-8);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual (a, b, relTol = 1e-8, absTol = 0) {\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0')\n  }\n\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0')\n  }\n\n  // NaN\n  if (isNaN(a) || isNaN(b)) {\n    return false\n  }\n\n  if (!isFinite(a) || !isFinite(b)) {\n    return a === b\n  }\n\n  if (a === b) {\n    return true\n  }\n\n  // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)\n  return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol)\n}\n\n/**\n * Calculate the hyperbolic arccos of a number\n * @param {number} x\n * @return {number}\n */\nexport const acosh = Math.acosh || function (x) {\n  return Math.log(Math.sqrt(x * x - 1) + x)\n}\n\nexport const asinh = Math.asinh || function (x) {\n  return Math.log(Math.sqrt(x * x + 1) + x)\n}\n\n/**\n * Calculate the hyperbolic arctangent of a number\n * @param {number} x\n * @return {number}\n */\nexport const atanh = Math.atanh || function (x) {\n  return Math.log((1 + x) / (1 - x)) / 2\n}\n\n/**\n * Calculate the hyperbolic cosine of a number\n * @param {number} x\n * @returns {number}\n */\nexport const cosh = Math.cosh || function (x) {\n  return (Math.exp(x) + Math.exp(-x)) / 2\n}\n\n/**\n * Calculate the hyperbolic sine of a number\n * @param {number} x\n * @returns {number}\n */\nexport const sinh = Math.sinh || function (x) {\n  return (Math.exp(x) - Math.exp(-x)) / 2\n}\n\n/**\n * Calculate the hyperbolic tangent of a number\n * @param {number} x\n * @returns {number}\n */\nexport const tanh = Math.tanh || function (x) {\n  const e = Math.exp(2 * x)\n  return (e - 1) / (e + 1)\n}\n\n/**\n * Returns a value with the magnitude of x and the sign of y.\n * @param {number} x\n * @param {number} y\n * @returns {number}\n */\nexport function copysign (x, y) {\n  const signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity\n  const signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity\n  return signx ^ signy ? -x : x\n}\n\nfunction _toNumberOrThrow (value, onError) {\n  if (isNumber(value)) {\n    return value\n  } else if (isBigNumber(value)) {\n    return value.toNumber()\n  } else {\n    onError()\n  }\n}\n\nfunction _toNumberOrDefault (value, defaultValue) {\n  if (isNumber(value)) {\n    return value\n  } else if (isBigNumber(value)) {\n    return value.toNumber()\n  } else {\n    return defaultValue\n  }\n}\n","/**\n * Create a typed-function which checks the types of the arguments and\n * can match them against multiple provided signatures. The typed-function\n * automatically converts inputs in order to find a matching signature.\n * Typed functions throw informative errors in case of wrong input arguments.\n *\n * See the library [typed-function](https://github.com/josdejong/typed-function)\n * for detailed documentation.\n *\n * Syntax:\n *\n *     math.typed(name, signatures) : function\n *     math.typed(signatures) : function\n *\n * Examples:\n *\n *     // create a typed function with multiple types per argument (type union)\n *     const fn2 = typed({\n *       'number | boolean': function (b) {\n *         return 'b is a number or boolean'\n *       },\n *       'string, number | boolean': function (a, b) {\n *         return 'a is a string, b is a number or boolean'\n *       }\n *     })\n *\n *     // create a typed function with an any type argument\n *     const log = typed({\n *       'string, any': function (event, data) {\n *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))\n *       }\n *     })\n *\n * @param {string} [name]                          Optional name for the typed-function\n * @param {Object<string, function>} signatures   Object with one or multiple function signatures\n * @returns {function} The created typed-function.\n */\n\nimport typedFunction from 'typed-function'\nimport { factory } from '../../utils/factory.js'\nimport {\n  isAccessorNode,\n  isArray,\n  isArrayNode,\n  isAssignmentNode,\n  isBigInt,\n  isBigNumber,\n  isBlockNode,\n  isBoolean,\n  isChain,\n  isCollection,\n  isComplex,\n  isConditionalNode,\n  isConstantNode,\n  isDate,\n  isDenseMatrix,\n  isFraction,\n  isFunction,\n  isFunctionAssignmentNode,\n  isFunctionNode,\n  isHelp,\n  isIndex,\n  isIndexNode,\n  isMap,\n  isMatrix,\n  isNode,\n  isNull,\n  isNumber,\n  isObject,\n  isObjectNode,\n  isOperatorNode,\n  isParenthesisNode,\n  isRange,\n  isRangeNode,\n  isRegExp,\n  isRelationalNode,\n  isResultSet,\n  isSparseMatrix,\n  isString,\n  isSymbolNode,\n  isUndefined,\n  isUnit\n} from '../../utils/is.js'\nimport { digits } from '../../utils/number.js'\n\n// returns a new instance of typed-function\nlet _createTyped = function () {\n  // initially, return the original instance of typed-function\n  // consecutively, return a new instance from typed.create.\n  _createTyped = typedFunction.create\n  return typedFunction\n}\n\nconst dependencies = [\n  '?BigNumber',\n  '?Complex',\n  '?DenseMatrix',\n  '?Fraction'\n]\n\n/**\n * Factory function for creating a new typed instance\n * @param {Object} dependencies   Object with data types like Complex and BigNumber\n * @returns {Function}\n */\nexport const createTyped = /* #__PURE__ */ factory('typed', dependencies, function createTyped ({ BigNumber, Complex, DenseMatrix, Fraction }) {\n  // TODO: typed-function must be able to silently ignore signatures with unknown data types\n\n  // get a new instance of typed-function\n  const typed = _createTyped()\n\n  // define all types. The order of the types determines in which order function\n  // arguments are type-checked (so for performance it's important to put the\n  // most used types first).\n  typed.clear()\n  typed.addTypes([\n    { name: 'number', test: isNumber },\n    { name: 'Complex', test: isComplex },\n    { name: 'BigNumber', test: isBigNumber },\n    { name: 'bigint', test: isBigInt },\n    { name: 'Fraction', test: isFraction },\n    { name: 'Unit', test: isUnit },\n    // The following type matches a valid variable name, i.e., an alphanumeric\n    // string starting with an alphabetic character. It is used (at least)\n    // in the definition of the derivative() function, as the argument telling\n    // what to differentiate over must (currently) be a variable.\n    // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)\n    {\n      name: 'identifier',\n      test: s => isString && /^\\p{L}[\\p{L}\\d]*$/u.test(s)\n    },\n    { name: 'string', test: isString },\n    { name: 'Chain', test: isChain },\n    { name: 'Array', test: isArray },\n    { name: 'Matrix', test: isMatrix },\n    { name: 'DenseMatrix', test: isDenseMatrix },\n    { name: 'SparseMatrix', test: isSparseMatrix },\n    { name: 'Range', test: isRange },\n    { name: 'Index', test: isIndex },\n    { name: 'boolean', test: isBoolean },\n    { name: 'ResultSet', test: isResultSet },\n    { name: 'Help', test: isHelp },\n    { name: 'function', test: isFunction },\n    { name: 'Date', test: isDate },\n    { name: 'RegExp', test: isRegExp },\n    { name: 'null', test: isNull },\n    { name: 'undefined', test: isUndefined },\n\n    { name: 'AccessorNode', test: isAccessorNode },\n    { name: 'ArrayNode', test: isArrayNode },\n    { name: 'AssignmentNode', test: isAssignmentNode },\n    { name: 'BlockNode', test: isBlockNode },\n    { name: 'ConditionalNode', test: isConditionalNode },\n    { name: 'ConstantNode', test: isConstantNode },\n    { name: 'FunctionNode', test: isFunctionNode },\n    { name: 'FunctionAssignmentNode', test: isFunctionAssignmentNode },\n    { name: 'IndexNode', test: isIndexNode },\n    { name: 'Node', test: isNode },\n    { name: 'ObjectNode', test: isObjectNode },\n    { name: 'OperatorNode', test: isOperatorNode },\n    { name: 'ParenthesisNode', test: isParenthesisNode },\n    { name: 'RangeNode', test: isRangeNode },\n    { name: 'RelationalNode', test: isRelationalNode },\n    { name: 'SymbolNode', test: isSymbolNode },\n\n    { name: 'Map', test: isMap },\n    { name: 'Object', test: isObject } // order 'Object' last, it matches on other classes too\n  ])\n\n  typed.addConversions([\n    {\n      from: 'number',\n      to: 'BigNumber',\n      convert: function (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\n\n        // note: conversion from number to BigNumber can fail if x has >15 digits\n        if (digits(x) > 15) {\n          throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' +\n            '(value: ' + x + '). ' +\n            'Use function bignumber(x) to convert to BigNumber.')\n        }\n        return new BigNumber(x)\n      }\n    }, {\n      from: 'number',\n      to: 'Complex',\n      convert: function (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x, 0)\n      }\n    }, {\n      from: 'BigNumber',\n      to: 'Complex',\n      convert: function (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x.toNumber(), 0)\n      }\n    }, {\n      from: 'bigint',\n      to: 'number',\n      convert: function (x) {\n        if (x > Number.MAX_SAFE_INTEGER) {\n          throw new TypeError('Cannot implicitly convert bigint to number: ' +\n            'value exceeds the max safe integer value (value: ' + x + ')')\n        }\n\n        return Number(x)\n      }\n    }, {\n      from: 'bigint',\n      to: 'BigNumber',\n      convert: function (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\n\n        return new BigNumber(x.toString())\n      }\n    }, {\n      from: 'bigint',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        return new Fraction(x)\n      }\n    }, {\n      from: 'Fraction',\n      to: 'BigNumber',\n      convert: function (x) {\n        throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' +\n          'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.')\n      }\n    }, {\n      from: 'Fraction',\n      to: 'Complex',\n      convert: function (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        return new Complex(x.valueOf(), 0)\n      }\n    }, {\n      from: 'number',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        const f = new Fraction(x)\n        if (f.valueOf() !== x) {\n          throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' +\n            '(value: ' + x + '). ' +\n            'Use function fraction(x) to convert to Fraction.')\n        }\n        return f\n      }\n    }, {\n      // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`\n      //  from: 'Fraction',\n      //  to: 'number',\n      //  convert: function (x) {\n      //    return x.valueOf()\n      //  }\n      // }, {\n      from: 'string',\n      to: 'number',\n      convert: function (x) {\n        const n = Number(x)\n        if (isNaN(n)) {\n          throw new Error('Cannot convert \"' + x + '\" to a number')\n        }\n        return n\n      }\n    }, {\n      from: 'string',\n      to: 'BigNumber',\n      convert: function (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\n\n        try {\n          return new BigNumber(x)\n        } catch (err) {\n          throw new Error('Cannot convert \"' + x + '\" to BigNumber')\n        }\n      }\n    }, {\n      from: 'string',\n      to: 'bigint',\n      convert: function (x) {\n        try {\n          return BigInt(x)\n        } catch (err) {\n          throw new Error('Cannot convert \"' + x + '\" to BigInt')\n        }\n      }\n    }, {\n      from: 'string',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        try {\n          return new Fraction(x)\n        } catch (err) {\n          throw new Error('Cannot convert \"' + x + '\" to Fraction')\n        }\n      }\n    }, {\n      from: 'string',\n      to: 'Complex',\n      convert: function (x) {\n        if (!Complex) {\n          throwNoComplex(x)\n        }\n\n        try {\n          return new Complex(x)\n        } catch (err) {\n          throw new Error('Cannot convert \"' + x + '\" to Complex')\n        }\n      }\n    }, {\n      from: 'boolean',\n      to: 'number',\n      convert: function (x) {\n        return +x\n      }\n    }, {\n      from: 'boolean',\n      to: 'BigNumber',\n      convert: function (x) {\n        if (!BigNumber) {\n          throwNoBignumber(x)\n        }\n\n        return new BigNumber(+x)\n      }\n    }, {\n      from: 'boolean',\n      to: 'bigint',\n      convert: function (x) {\n        return BigInt(+x)\n      }\n    }, {\n      from: 'boolean',\n      to: 'Fraction',\n      convert: function (x) {\n        if (!Fraction) {\n          throwNoFraction(x)\n        }\n\n        return new Fraction(+x)\n      }\n    }, {\n      from: 'boolean',\n      to: 'string',\n      convert: function (x) {\n        return String(x)\n      }\n    }, {\n      from: 'Array',\n      to: 'Matrix',\n      convert: function (array) {\n        if (!DenseMatrix) {\n          throwNoMatrix()\n        }\n\n        return new DenseMatrix(array)\n      }\n    }, {\n      from: 'Matrix',\n      to: 'Array',\n      convert: function (matrix) {\n        return matrix.valueOf()\n      }\n    }\n  ])\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    const usualError = typed.createError(name, args, signatures)\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) &&\n        args.length === 1 && isCollection(args[0]) &&\n        // check if the function can be unary:\n        signatures.some(sig => !sig.params.includes(','))) {\n      const err = new TypeError(\n        `Function '${name}' doesn't apply to matrices. To call it ` +\n          `elementwise on a matrix 'M', try 'map(M, ${name})'.`)\n      err.data = usualError.data\n      throw err\n    }\n    throw usualError\n  }\n\n  // Provide a suggestion on how to call a function elementwise\n  // This was added primarily as guidance for the v10 -> v11 transition,\n  // and could potentially be removed in the future if it no longer seems\n  // to be helpful.\n  typed.onMismatch = (name, args, signatures) => {\n    const usualError = typed.createError(name, args, signatures)\n    if (['wrongType', 'mismatch'].includes(usualError.data.category) &&\n        args.length === 1 && isCollection(args[0]) &&\n        // check if the function can be unary:\n        signatures.some(sig => !sig.params.includes(','))) {\n      const err = new TypeError(\n        `Function '${name}' doesn't apply to matrices. To call it ` +\n          `elementwise on a matrix 'M', try 'map(M, ${name})'.`)\n      err.data = usualError.data\n      throw err\n    }\n    throw usualError\n  }\n\n  return typed\n})\n\nfunction throwNoBignumber (x) {\n  throw new Error(`Cannot convert value ${x} into a BigNumber: no class 'BigNumber' provided`)\n}\n\nfunction throwNoComplex (x) {\n  throw new Error(`Cannot convert value ${x} into a Complex number: no class 'Complex' provided`)\n}\n\nfunction throwNoMatrix () {\n  throw new Error('Cannot convert array into a Matrix: no class \\'DenseMatrix\\' provided')\n}\n\nfunction throwNoFraction (x) {\n  throw new Error(`Cannot convert value ${x} into a Fraction, no class 'Fraction' provided.`)\n}\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'ResultSet'\nconst dependencies = []\n\nexport const createResultSet = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * A ResultSet contains a list or results\n   * @class ResultSet\n   * @param {Array} entries\n   * @constructor ResultSet\n   */\n  function ResultSet (entries) {\n    if (!(this instanceof ResultSet)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this.entries = entries || []\n  }\n\n  /**\n   * Attach type information\n   */\n  ResultSet.prototype.type = 'ResultSet'\n  ResultSet.prototype.isResultSet = true\n\n  /**\n   * Returns the array with results hold by this ResultSet\n   * @memberof ResultSet\n   * @returns {Array} entries\n   */\n  ResultSet.prototype.valueOf = function () {\n    return this.entries\n  }\n\n  /**\n   * Returns the stringified results of the ResultSet\n   * @memberof ResultSet\n   * @returns {string} string\n   */\n  ResultSet.prototype.toString = function () {\n    return '[' + this.entries.map(String).join(', ') + ']'\n  }\n\n  /**\n   * Get a JSON representation of the ResultSet\n   * @memberof ResultSet\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   */\n  ResultSet.prototype.toJSON = function () {\n    return {\n      mathjs: 'ResultSet',\n      entries: this.entries\n    }\n  }\n\n  /**\n   * Instantiate a ResultSet from a JSON object\n   * @memberof ResultSet\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"ResultSet\", \"entries\": [...]}`\n   * @return {ResultSet}\n   */\n  ResultSet.fromJSON = function (json) {\n    return new ResultSet(json.entries)\n  }\n\n  return ResultSet\n}, { isClass: true })\n","/*!\r\n *  decimal.js v10.5.0\r\n *  An arbitrary-precision Decimal type for JavaScript.\r\n *  https://github.com/MikeMcl/decimal.js\r\n *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *  MIT Licence\r\n */\r\n\r\n\r\n// -----------------------------------  EDITABLE DEFAULTS  ------------------------------------ //\r\n\r\n\r\n  // The maximum exponent magnitude.\r\n  // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\nvar EXP_LIMIT = 9e15,                      // 0 to 9e15\r\n\r\n  // The limit on the value of `precision`, and on the value of the first argument to\r\n  // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n  MAX_DIGITS = 1e9,                        // 0 to 1e9\r\n\r\n  // Base conversion alphabet.\r\n  NUMERALS = '0123456789abcdef',\r\n\r\n  // The natural logarithm of 10 (1025 digits).\r\n  LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n  // Pi (1025 digits).\r\n  PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n  // The initial configuration properties of the Decimal constructor.\r\n  DEFAULTS = {\r\n\r\n    // These values must be integers within the stated ranges (inclusive).\r\n    // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n    // The maximum number of significant digits of the result of a calculation or base conversion.\r\n    // E.g. `Decimal.config({ precision: 20 });`\r\n    precision: 20,                         // 1 to MAX_DIGITS\r\n\r\n    // The rounding mode used when rounding to `precision`.\r\n    //\r\n    // ROUND_UP         0 Away from zero.\r\n    // ROUND_DOWN       1 Towards zero.\r\n    // ROUND_CEIL       2 Towards +Infinity.\r\n    // ROUND_FLOOR      3 Towards -Infinity.\r\n    // ROUND_HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n    // ROUND_HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n    // ROUND_HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n    // ROUND_HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n    // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n    //\r\n    // E.g.\r\n    // `Decimal.rounding = 4;`\r\n    // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n    rounding: 4,                           // 0 to 8\r\n\r\n    // The modulo mode used when calculating the modulus: a mod n.\r\n    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n    // The remainder (r) is calculated as: r = a - n * q.\r\n    //\r\n    // UP         0 The remainder is positive if the dividend is negative, else is negative.\r\n    // DOWN       1 The remainder has the same sign as the dividend (JavaScript %).\r\n    // FLOOR      3 The remainder has the same sign as the divisor (Python %).\r\n    // HALF_EVEN  6 The IEEE 754 remainder function.\r\n    // EUCLID     9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n    //\r\n    // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n    // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n    // be used, but they may not give useful results.\r\n    modulo: 1,                             // 0 to 9\r\n\r\n    // The exponent value at and beneath which `toString` returns exponential notation.\r\n    // JavaScript numbers: -7\r\n    toExpNeg: -7,                          // 0 to -EXP_LIMIT\r\n\r\n    // The exponent value at and above which `toString` returns exponential notation.\r\n    // JavaScript numbers: 21\r\n    toExpPos:  21,                         // 0 to EXP_LIMIT\r\n\r\n    // The minimum exponent value, beneath which underflow to zero occurs.\r\n    // JavaScript numbers: -324  (5e-324)\r\n    minE: -EXP_LIMIT,                      // -1 to -EXP_LIMIT\r\n\r\n    // The maximum exponent value, above which overflow to Infinity occurs.\r\n    // JavaScript numbers: 308  (1.7976931348623157e+308)\r\n    maxE: EXP_LIMIT,                       // 1 to EXP_LIMIT\r\n\r\n    // Whether to use cryptographically-secure random number generation, if available.\r\n    crypto: false                          // true/false\r\n  },\r\n\r\n\r\n// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n  inexact, quadrant,\r\n  external = true,\r\n\r\n  decimalError = '[DecimalError] ',\r\n  invalidArgument = decimalError + 'Invalid argument: ',\r\n  precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n  cryptoUnavailable = decimalError + 'crypto unavailable',\r\n  tag = '[object Decimal]',\r\n\r\n  mathfloor = Math.floor,\r\n  mathpow = Math.pow,\r\n\r\n  isBinary = /^0b([01]+(\\.[01]*)?|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n  isHex = /^0x([0-9a-f]+(\\.[0-9a-f]*)?|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n  isOctal = /^0o([0-7]+(\\.[0-7]*)?|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n  isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n  BASE = 1e7,\r\n  LOG_BASE = 7,\r\n  MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n  LN10_PRECISION = LN10.length - 1,\r\n  PI_PRECISION = PI.length - 1,\r\n\r\n  // Decimal.prototype object\r\n  P = { toStringTag: tag };\r\n\r\n\r\n// Decimal prototype methods\r\n\r\n\r\n/*\r\n *  absoluteValue             abs\r\n *  ceil\r\n *  clampedTo                 clamp\r\n *  comparedTo                cmp\r\n *  cosine                    cos\r\n *  cubeRoot                  cbrt\r\n *  decimalPlaces             dp\r\n *  dividedBy                 div\r\n *  dividedToIntegerBy        divToInt\r\n *  equals                    eq\r\n *  floor\r\n *  greaterThan               gt\r\n *  greaterThanOrEqualTo      gte\r\n *  hyperbolicCosine          cosh\r\n *  hyperbolicSine            sinh\r\n *  hyperbolicTangent         tanh\r\n *  inverseCosine             acos\r\n *  inverseHyperbolicCosine   acosh\r\n *  inverseHyperbolicSine     asinh\r\n *  inverseHyperbolicTangent  atanh\r\n *  inverseSine               asin\r\n *  inverseTangent            atan\r\n *  isFinite\r\n *  isInteger                 isInt\r\n *  isNaN\r\n *  isNegative                isNeg\r\n *  isPositive                isPos\r\n *  isZero\r\n *  lessThan                  lt\r\n *  lessThanOrEqualTo         lte\r\n *  logarithm                 log\r\n *  [maximum]                 [max]\r\n *  [minimum]                 [min]\r\n *  minus                     sub\r\n *  modulo                    mod\r\n *  naturalExponential        exp\r\n *  naturalLogarithm          ln\r\n *  negated                   neg\r\n *  plus                      add\r\n *  precision                 sd\r\n *  round\r\n *  sine                      sin\r\n *  squareRoot                sqrt\r\n *  tangent                   tan\r\n *  times                     mul\r\n *  toBinary\r\n *  toDecimalPlaces           toDP\r\n *  toExponential\r\n *  toFixed\r\n *  toFraction\r\n *  toHexadecimal             toHex\r\n *  toNearest\r\n *  toNumber\r\n *  toOctal\r\n *  toPower                   pow\r\n *  toPrecision\r\n *  toSignificantDigits       toSD\r\n *  toString\r\n *  truncated                 trunc\r\n *  valueOf                   toJSON\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n *\r\n */\r\nP.absoluteValue = P.abs = function () {\r\n  var x = new this.constructor(this);\r\n  if (x.s < 0) x.s = 1;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n *\r\n */\r\nP.ceil = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n *\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nP.clampedTo = P.clamp = function (min, max) {\r\n  var k,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n  min = new Ctor(min);\r\n  max = new Ctor(max);\r\n  if (!min.s || !max.s) return new Ctor(NaN);\r\n  if (min.gt(max)) throw Error(invalidArgument + max);\r\n  k = x.cmp(min);\r\n  return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n};\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if the value of this Decimal is greater than the value of `y`,\r\n *  -1    if the value of this Decimal is less than the value of `y`,\r\n *   0    if they have the same value,\r\n *   NaN  if the value of either Decimal is NaN.\r\n *\r\n */\r\nP.comparedTo = P.cmp = function (y) {\r\n  var i, j, xdL, ydL,\r\n    x = this,\r\n    xd = x.d,\r\n    yd = (y = new x.constructor(y)).d,\r\n    xs = x.s,\r\n    ys = y.s;\r\n\r\n  // Either NaN or ±Infinity?\r\n  if (!xd || !yd) {\r\n    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Either zero?\r\n  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n  // Signs differ?\r\n  if (xs !== ys) return xs;\r\n\r\n  // Compare exponents.\r\n  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Compare lengths.\r\n  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * cos(0)         = 1\r\n * cos(-0)        = 1\r\n * cos(Infinity)  = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN)       = NaN\r\n *\r\n */\r\nP.cosine = P.cos = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.d) return new Ctor(NaN);\r\n\r\n  // cos(0) = cos(-0) = 1\r\n  if (!x.d[0]) return new Ctor(1);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *\r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n *  cbrt(0)  =  0\r\n *  cbrt(-0) = -0\r\n *  cbrt(1)  =  1\r\n *  cbrt(-1) = -1\r\n *  cbrt(N)  =  N\r\n *  cbrt(-I) = -I\r\n *  cbrt(I)  =  I\r\n *\r\n * Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n *\r\n */\r\nP.cubeRoot = P.cbrt = function () {\r\n  var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n   // Math.cbrt underflow/overflow?\r\n   // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n  if (!s || Math.abs(s) == 1 / 0) {\r\n    n = digitsToString(x.d);\r\n    e = x.e;\r\n\r\n    // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n    if (s = (e - n.length + 1) % 3) n += (s == 1 || s == -2 ? '0' : '00');\r\n    s = mathpow(n, 1 / 3);\r\n\r\n    // Rarely, e may be one less than the result exponent value.\r\n    e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2));\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n    r.s = x.s;\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Halley's method.\r\n  // TODO? Compare Newton's method.\r\n  for (;;) {\r\n    t = r;\r\n    t3 = t.times(t).times(t);\r\n    t3plusx = t3.plus(x);\r\n    r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n      // , i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return the number of decimal places of the value of this Decimal.\r\n *\r\n */\r\nP.decimalPlaces = P.dp = function () {\r\n  var w,\r\n    d = this.d,\r\n    n = NaN;\r\n\r\n  if (d) {\r\n    w = d.length - 1;\r\n    n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    w = d[w];\r\n    if (w) for (; w % 10 == 0; w /= 10) n--;\r\n    if (n < 0) n = 0;\r\n  }\r\n\r\n  return n;\r\n};\r\n\r\n\r\n/*\r\n *  n / 0 = I\r\n *  n / N = N\r\n *  n / I = 0\r\n *  0 / n = 0\r\n *  0 / 0 = N\r\n *  0 / N = N\r\n *  0 / I = 0\r\n *  N / n = N\r\n *  N / 0 = N\r\n *  N / N = N\r\n *  N / I = N\r\n *  I / n = I\r\n *  I / 0 = I\r\n *  I / N = N\r\n *  I / I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedBy = P.div = function (y) {\r\n  return divide(this, new this.constructor(y));\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.dividedToIntegerBy = P.divToInt = function (y) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n  return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n *\r\n */\r\nP.equals = P.eq = function (y) {\r\n  return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n *\r\n */\r\nP.floor = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 3);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n *\r\n */\r\nP.greaterThan = P.gt = function (y) {\r\n  return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n *\r\n */\r\nP.greaterThanOrEqualTo = P.gte = function (y) {\r\n  var k = this.cmp(y);\r\n  return k == 1 || k === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n *\r\n * cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n *\r\n * cosh(0)         = 1\r\n * cosh(-0)        = 1\r\n * cosh(Infinity)  = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN)       = NaN\r\n *\r\n *  x        time taken (ms)   result\r\n * 1000      9                 9.8503555700852349694e+433\r\n * 10000     25                4.4034091128314607936e+4342\r\n * 100000    171               1.4033316802130615897e+43429\r\n * 1000000   3817              1.5166076984010437725e+434294\r\n * 10000000  abandoned after 2 minute wait\r\n *\r\n * TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n *\r\n */\r\nP.hyperbolicCosine = P.cosh = function () {\r\n  var k, n, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    one = new Ctor(1);\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n  if (x.isZero()) return one;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n  // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  // TODO? Estimation reused from cosine() and may not be optimal here.\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    n = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    n = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n  // Reverse argument reduction\r\n  var cosh2_x,\r\n    i = k,\r\n    d8 = new Ctor(8);\r\n  for (; i--;) {\r\n    cosh2_x = x.times(x);\r\n    x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n  }\r\n\r\n  return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n *\r\n * sinh(0)         = 0\r\n * sinh(-0)        = -0\r\n * sinh(Infinity)  = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN)       = NaN\r\n *\r\n * x        time taken (ms)\r\n * 10       2 ms\r\n * 100      5 ms\r\n * 1000     14 ms\r\n * 10000    82 ms\r\n * 100000   886 ms            1.4033316802130615897e+43429\r\n * 200000   2613 ms\r\n * 300000   5407 ms\r\n * 400000   8824 ms\r\n * 500000   13026 ms          8.7080643612718084129e+217146\r\n * 1000000  48543 ms\r\n *\r\n * TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n *\r\n */\r\nP.hyperbolicSine = P.sinh = function () {\r\n  var k, pr, rm, len,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n  } else {\r\n\r\n    // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n    // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n    // 3 multiplications and 1 addition\r\n\r\n    // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n    // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n    // 4 multiplications and 2 additions\r\n\r\n    // Estimate the optimum number of times to use the argument reduction.\r\n    k = 1.4 * Math.sqrt(len);\r\n    k = k > 16 ? 16 : k | 0;\r\n\r\n    x = x.times(1 / tinyPow(5, k));\r\n    x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n    // Reverse argument reduction\r\n    var sinh2_x,\r\n      d5 = new Ctor(5),\r\n      d16 = new Ctor(16),\r\n      d20 = new Ctor(20);\r\n    for (; k--;) {\r\n      sinh2_x = x.times(x);\r\n      x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n    }\r\n  }\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * tanh(x) = sinh(x) / cosh(x)\r\n *\r\n * tanh(0)         = 0\r\n * tanh(-0)        = -0\r\n * tanh(Infinity)  = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN)       = NaN\r\n *\r\n */\r\nP.hyperbolicTangent = P.tanh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(x.s);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 7;\r\n  Ctor.rounding = 1;\r\n\r\n  return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [0, pi]\r\n *\r\n * acos(x) = pi/2 - asin(x)\r\n *\r\n * acos(0)       = pi/2\r\n * acos(-0)      = pi/2\r\n * acos(1)       = 0\r\n * acos(-1)      = pi\r\n * acos(1/2)     = pi/3\r\n * acos(-1/2)    = 2*pi/3\r\n * acos(|x| > 1) = NaN\r\n * acos(NaN)     = NaN\r\n *\r\n */\r\nP.inverseCosine = P.acos = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    k = x.abs().cmp(1),\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n    return k === 0\r\n      // |x| is 1\r\n      ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n      // |x| > 1 or x is NaN\r\n      : new Ctor(NaN);\r\n  }\r\n\r\n  if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n  // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2*pi/3\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  // See https://github.com/MikeMcl/decimal.js/pull/217\r\n  x = new Ctor(1).minus(x).div(x.plus(1)).sqrt().atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n *\r\n * acosh(x) = ln(x + sqrt(x^2 - 1))\r\n *\r\n * acosh(x < 1)     = NaN\r\n * acosh(NaN)       = NaN\r\n * acosh(Infinity)  = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0)         = NaN\r\n * acosh(-0)        = NaN\r\n * acosh(1)         = 0\r\n * acosh(-1)        = NaN\r\n *\r\n */\r\nP.inverseHyperbolicCosine = P.acosh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n  if (!x.isFinite()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * asinh(x) = ln(x + sqrt(x^2 + 1))\r\n *\r\n * asinh(NaN)       = NaN\r\n * asinh(Infinity)  = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0)         = 0\r\n * asinh(-0)        = -0\r\n *\r\n */\r\nP.inverseHyperbolicSine = P.asinh = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite() || x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n  Ctor.rounding = 1;\r\n  external = false;\r\n\r\n  x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n  external = true;\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.ln();\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n *\r\n * Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n *\r\n * atanh(|x| > 1)   = NaN\r\n * atanh(NaN)       = NaN\r\n * atanh(Infinity)  = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0)         = 0\r\n * atanh(-0)        = -0\r\n * atanh(1)         = Infinity\r\n * atanh(-1)        = -Infinity\r\n *\r\n */\r\nP.inverseHyperbolicTangent = P.atanh = function () {\r\n  var pr, rm, wpr, xsd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  xsd = x.sd();\r\n\r\n  if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n  Ctor.precision = wpr = xsd - x.e;\r\n\r\n  x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n  Ctor.precision = pr + 4;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.ln();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(0.5);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * asin(x) = 2*atan(x/(1 + sqrt(1 - x^2)))\r\n *\r\n * asin(0)       = 0\r\n * asin(-0)      = -0\r\n * asin(1/2)     = pi/6\r\n * asin(-1/2)    = -pi/6\r\n * asin(1)       = pi/2\r\n * asin(-1)      = -pi/2\r\n * asin(|x| > 1) = NaN\r\n * asin(NaN)     = NaN\r\n *\r\n * TODO? Compare performance of Taylor series.\r\n *\r\n */\r\nP.inverseSine = P.asin = function () {\r\n  var halfPi, k,\r\n    pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  k = x.abs().cmp(1);\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (k !== -1) {\r\n\r\n    // |x| is 1\r\n    if (k === 0) {\r\n      halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      halfPi.s = x.s;\r\n      return halfPi;\r\n    }\r\n\r\n    // |x| > 1 or x is NaN\r\n    return new Ctor(NaN);\r\n  }\r\n\r\n  // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n  Ctor.precision = pr + 6;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return x.times(2);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n *\r\n * atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n *\r\n * atan(0)         = 0\r\n * atan(-0)        = -0\r\n * atan(1)         = pi/4\r\n * atan(-1)        = -pi/4\r\n * atan(Infinity)  = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN)       = NaN\r\n *\r\n */\r\nP.inverseTangent = P.atan = function () {\r\n  var i, j, k, n, px, t, r, wpr, x2,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding;\r\n\r\n  if (!x.isFinite()) {\r\n    if (!x.s) return new Ctor(NaN);\r\n    if (pr + 4 <= PI_PRECISION) {\r\n      r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n      r.s = x.s;\r\n      return r;\r\n    }\r\n  } else if (x.isZero()) {\r\n    return new Ctor(x);\r\n  } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n    r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n    r.s = x.s;\r\n    return r;\r\n  }\r\n\r\n  Ctor.precision = wpr = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n  // Argument reduction\r\n  // Ensure |x| < 0.42\r\n  // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n  k = Math.min(28, wpr / LOG_BASE + 2 | 0);\r\n\r\n  for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n  external = false;\r\n\r\n  j = Math.ceil(wpr / LOG_BASE);\r\n  n = 1;\r\n  x2 = x.times(x);\r\n  r = new Ctor(x);\r\n  px = x;\r\n\r\n  // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n  for (; i !== -1;) {\r\n    px = px.times(x2);\r\n    t = r.minus(px.div(n += 2));\r\n\r\n    px = px.times(x2);\r\n    r = t.plus(px.div(n += 2));\r\n\r\n    if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n  }\r\n\r\n  if (k) r = r.times(2 << (k - 1));\r\n\r\n  external = true;\r\n\r\n  return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is a finite number, otherwise return false.\r\n *\r\n */\r\nP.isFinite = function () {\r\n  return !!this.d;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is an integer, otherwise return false.\r\n *\r\n */\r\nP.isInteger = P.isInt = function () {\r\n  return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is NaN, otherwise return false.\r\n *\r\n */\r\nP.isNaN = function () {\r\n  return !this.s;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is negative, otherwise return false.\r\n *\r\n */\r\nP.isNegative = P.isNeg = function () {\r\n  return this.s < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is positive, otherwise return false.\r\n *\r\n */\r\nP.isPositive = P.isPos = function () {\r\n  return this.s > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n *\r\n */\r\nP.isZero = function () {\r\n  return !!this.d && this.d[0] === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThan = P.lt = function (y) {\r\n  return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n *\r\n */\r\nP.lessThanOrEqualTo = P.lte = function (y) {\r\n  return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/*\r\n * Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * If no base is specified, return log[10](arg).\r\n *\r\n * log[base](arg) = ln(arg) / ln(base)\r\n *\r\n * The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n *\r\n * Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n *\r\n * log[-b](a)       = NaN\r\n * log[0](a)        = NaN\r\n * log[1](a)        = NaN\r\n * log[NaN](a)      = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0)        = -Infinity\r\n * log[b](-0)       = -Infinity\r\n * log[b](-a)       = NaN\r\n * log[b](1)        = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN)      = NaN\r\n *\r\n * [base] {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nP.logarithm = P.log = function (base) {\r\n  var isBase10, d, denominator, k, inf, num, sd, r,\r\n    arg = this,\r\n    Ctor = arg.constructor,\r\n    pr = Ctor.precision,\r\n    rm = Ctor.rounding,\r\n    guard = 5;\r\n\r\n  // Default base is 10.\r\n  if (base == null) {\r\n    base = new Ctor(10);\r\n    isBase10 = true;\r\n  } else {\r\n    base = new Ctor(base);\r\n    d = base.d;\r\n\r\n    // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n    if (base.s < 0 || !d || !d[0] || base.eq(1)) return new Ctor(NaN);\r\n\r\n    isBase10 = base.eq(10);\r\n  }\r\n\r\n  d = arg.d;\r\n\r\n  // Is arg negative, non-finite, 0 or 1?\r\n  if (arg.s < 0 || !d || !d[0] || arg.eq(1)) {\r\n    return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n  }\r\n\r\n  // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n  // integer power of 10.\r\n  if (isBase10) {\r\n    if (d.length > 1) {\r\n      inf = true;\r\n    } else {\r\n      for (k = d[0]; k % 10 === 0;) k /= 10;\r\n      inf = k !== 1;\r\n    }\r\n  }\r\n\r\n  external = false;\r\n  sd = pr + guard;\r\n  num = naturalLogarithm(arg, sd);\r\n  denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n  // The result will have 5 rounding digits.\r\n  r = divide(num, denominator, sd, 1);\r\n\r\n  // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n  // calculate 10 further digits.\r\n  //\r\n  // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n  // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n  // further digits, the last 14 are nines, round up and assume the result is exact.\r\n  // Also assume the result is exact if the last 14 are zero.\r\n  //\r\n  // Example of a result that will be incorrectly rounded:\r\n  // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n  // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n  // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n  // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n  // place is still 2.6.\r\n  if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n    do {\r\n      sd += 10;\r\n      num = naturalLogarithm(arg, sd);\r\n      denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n      r = divide(num, denominator, sd, 1);\r\n\r\n      if (!inf) {\r\n\r\n        // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n        if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n          r = finalise(r, pr + 1, 0);\r\n        }\r\n\r\n        break;\r\n      }\r\n    } while (checkRoundingDigits(r.d, k += 10, rm));\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.max = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, -1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\nP.min = function () {\r\n  Array.prototype.push.call(arguments, this);\r\n  return maxOrMin(this.constructor, arguments, 1);\r\n};\r\n */\r\n\r\n\r\n/*\r\n *  n - 0 = n\r\n *  n - N = N\r\n *  n - I = -I\r\n *  0 - n = -n\r\n *  0 - 0 = 0\r\n *  0 - N = N\r\n *  0 - I = -I\r\n *  N - n = N\r\n *  N - 0 = N\r\n *  N - N = N\r\n *  N - I = N\r\n *  I - n = I\r\n *  I - 0 = I\r\n *  I - N = N\r\n *  I - I = N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.minus = P.sub = function (y) {\r\n  var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return y negated if x is finite and y is ±Infinity.\r\n    else if (x.d) y.s = -y.s;\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with different signs.\r\n    // Return NaN if both are ±Infinity with the same sign.\r\n    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n  // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.plus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return y negated if x is zero and y is non-zero.\r\n    if (yd[0]) y.s = -y.s;\r\n\r\n    // Return x if y is zero and x is non-zero.\r\n    else if (xd[0]) y = new Ctor(x);\r\n\r\n    // Return zero if both are zero.\r\n    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n    else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  e = mathfloor(y.e / LOG_BASE);\r\n  xe = mathfloor(x.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  k = xe - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (k) {\r\n    xLTy = k < 0;\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      k = -k;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = xe;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Numbers with massively different exponents would result in a very high number of\r\n    // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n    if (k > i) {\r\n      k = i;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    d.reverse();\r\n    for (i = k; i--;) d.push(0);\r\n    d.reverse();\r\n\r\n  // Base 1e7 exponents equal.\r\n  } else {\r\n\r\n    // Check digits to determine which is the bigger number.\r\n\r\n    i = xd.length;\r\n    len = yd.length;\r\n    xLTy = i < len;\r\n    if (xLTy) len = i;\r\n\r\n    for (i = 0; i < len; i++) {\r\n      if (xd[i] != yd[i]) {\r\n        xLTy = xd[i] < yd[i];\r\n        break;\r\n      }\r\n    }\r\n\r\n    k = 0;\r\n  }\r\n\r\n  if (xLTy) {\r\n    d = xd;\r\n    xd = yd;\r\n    yd = d;\r\n    y.s = -y.s;\r\n  }\r\n\r\n  len = xd.length;\r\n\r\n  // Append zeros to `xd` if shorter.\r\n  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n  // Subtract yd from xd.\r\n  for (i = yd.length; i > k;) {\r\n\r\n    if (xd[--i] < yd[i]) {\r\n      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n      --xd[j];\r\n      xd[i] += BASE;\r\n    }\r\n\r\n    xd[i] -= yd[i];\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; xd[--len] === 0;) xd.pop();\r\n\r\n  // Remove leading zeros and adjust exponent accordingly.\r\n  for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n  // Zero?\r\n  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n *   n % 0 =  N\r\n *   n % N =  N\r\n *   n % I =  n\r\n *   0 % n =  0\r\n *  -0 % n = -0\r\n *   0 % 0 =  N\r\n *   0 % N =  N\r\n *   0 % I =  0\r\n *   N % n =  N\r\n *   N % 0 =  N\r\n *   N % N =  N\r\n *   N % I =  N\r\n *   I % n =  N\r\n *   I % 0 =  N\r\n *   I % N =  N\r\n *   I % I =  N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * The result depends on the modulo mode.\r\n *\r\n */\r\nP.modulo = P.mod = function (y) {\r\n  var q,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n  // Return x if y is ±Infinity or x is ±0.\r\n  if (!y.d || x.d && !x.d[0]) {\r\n    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n  }\r\n\r\n  // Prevent rounding of intermediate calculations.\r\n  external = false;\r\n\r\n  if (Ctor.modulo == 9) {\r\n\r\n    // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n    // result = x - q * y    where  0 <= result < abs(y)\r\n    q = divide(x, y.abs(), 0, 3, 1);\r\n    q.s *= y.s;\r\n  } else {\r\n    q = divide(x, y, 0, Ctor.modulo, 1);\r\n  }\r\n\r\n  q = q.times(y);\r\n\r\n  external = true;\r\n\r\n  return x.minus(q);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalExponential = P.exp = function () {\r\n  return naturalExponential(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.naturalLogarithm = P.ln = function () {\r\n  return naturalLogarithm(this);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n *\r\n */\r\nP.negated = P.neg = function () {\r\n  var x = new this.constructor(this);\r\n  x.s = -x.s;\r\n  return finalise(x);\r\n};\r\n\r\n\r\n/*\r\n *  n + 0 = n\r\n *  n + N = N\r\n *  n + I = I\r\n *  0 + n = n\r\n *  0 + 0 = 0\r\n *  0 + N = N\r\n *  0 + I = I\r\n *  N + n = N\r\n *  N + 0 = N\r\n *  N + N = N\r\n *  N + I = N\r\n *  I + n = I\r\n *  I + 0 = I\r\n *  I + N = N\r\n *  I + I = I\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.plus = P.add = function (y) {\r\n  var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  y = new Ctor(y);\r\n\r\n  // If either is not finite...\r\n  if (!x.d || !y.d) {\r\n\r\n    // Return NaN if either is NaN.\r\n    if (!x.s || !y.s) y = new Ctor(NaN);\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with the same sign.\r\n    // Return NaN if both are ±Infinity with different signs.\r\n    // Return y if x is finite and y is ±Infinity.\r\n    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n   // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.minus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return x if y is zero.\r\n    // Return y if y is non-zero.\r\n    if (!yd[0]) y = new Ctor(x);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  k = mathfloor(x.e / LOG_BASE);\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  i = k - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (i) {\r\n\r\n    if (i < 0) {\r\n      d = xd;\r\n      i = -i;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = k;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n    k = Math.ceil(pr / LOG_BASE);\r\n    len = k > len ? k + 1 : len + 1;\r\n\r\n    if (i > len) {\r\n      i = len;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n    d.reverse();\r\n    for (; i--;) d.push(0);\r\n    d.reverse();\r\n  }\r\n\r\n  len = xd.length;\r\n  i = yd.length;\r\n\r\n  // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n  if (len - i < 0) {\r\n    i = len;\r\n    d = yd;\r\n    yd = xd;\r\n    xd = d;\r\n  }\r\n\r\n  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n  for (carry = 0; i;) {\r\n    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n    xd[i] %= BASE;\r\n  }\r\n\r\n  if (carry) {\r\n    xd.unshift(carry);\r\n    ++e;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n  for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return the number of significant digits of the value of this Decimal.\r\n *\r\n * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n *\r\n */\r\nP.precision = P.sd = function (z) {\r\n  var k,\r\n    x = this;\r\n\r\n  if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n  if (x.d) {\r\n    k = getPrecision(x.d);\r\n    if (z && x.e + 1 > k) k = x.e + 1;\r\n  } else {\r\n    k = NaN;\r\n  }\r\n\r\n  return k;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n *\r\n */\r\nP.round = function () {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n *\r\n * sin(0)         = 0\r\n * sin(-0)        = -0\r\n * sin(Infinity)  = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN)       = NaN\r\n *\r\n */\r\nP.sine = P.sin = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n  Ctor.rounding = 1;\r\n\r\n  x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n *  sqrt(-n) =  N\r\n *  sqrt(N)  =  N\r\n *  sqrt(-I) =  N\r\n *  sqrt(I)  =  I\r\n *  sqrt(0)  =  0\r\n *  sqrt(-0) = -0\r\n *\r\n */\r\nP.squareRoot = P.sqrt = function () {\r\n  var m, n, sd, r, rep, t,\r\n    x = this,\r\n    d = x.d,\r\n    e = x.e,\r\n    s = x.s,\r\n    Ctor = x.constructor;\r\n\r\n  // Negative/NaN/Infinity/zero?\r\n  if (s !== 1 || !d || !d[0]) {\r\n    return new Ctor(!s || s < 0 && (!d || d[0]) ? NaN : d ? x : 1 / 0);\r\n  }\r\n\r\n  external = false;\r\n\r\n  // Initial estimate.\r\n  s = Math.sqrt(+x);\r\n\r\n  // Math.sqrt underflow/overflow?\r\n  // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n  if (s == 0 || s == 1 / 0) {\r\n    n = digitsToString(d);\r\n\r\n    if ((n.length + e) % 2 == 0) n += '0';\r\n    s = Math.sqrt(n);\r\n    e = mathfloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n    if (s == 1 / 0) {\r\n      n = '5e' + e;\r\n    } else {\r\n      n = s.toExponential();\r\n      n = n.slice(0, n.indexOf('e') + 1) + e;\r\n    }\r\n\r\n    r = new Ctor(n);\r\n  } else {\r\n    r = new Ctor(s.toString());\r\n  }\r\n\r\n  sd = (e = Ctor.precision) + 3;\r\n\r\n  // Newton-Raphson iteration.\r\n  for (;;) {\r\n    t = r;\r\n    r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n    // TODO? Replace with for-loop and checkRoundingDigits.\r\n    if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n      n = n.slice(sd - 3, sd + 1);\r\n\r\n      // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n      // 4999, i.e. approaching a rounding boundary, continue the iteration.\r\n      if (n == '9999' || !rep && n == '4999') {\r\n\r\n        // On the first iteration only, check to see if rounding up gives the exact result as the\r\n        // nines may infinitely repeat.\r\n        if (!rep) {\r\n          finalise(t, e + 1, 0);\r\n\r\n          if (t.times(t).eq(x)) {\r\n            r = t;\r\n            break;\r\n          }\r\n        }\r\n\r\n        sd += 4;\r\n        rep = 1;\r\n      } else {\r\n\r\n        // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n        // If not, then there are further digits and m will be truthy.\r\n        if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n          // Truncate to the first rounding digit.\r\n          finalise(r, e + 1, 1);\r\n          m = !r.times(r).eq(x);\r\n        }\r\n\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n *\r\n * tan(0)         = 0\r\n * tan(-0)        = -0\r\n * tan(Infinity)  = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN)       = NaN\r\n *\r\n */\r\nP.tangent = P.tan = function () {\r\n  var pr, rm,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (!x.isFinite()) return new Ctor(NaN);\r\n  if (x.isZero()) return new Ctor(x);\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n  Ctor.precision = pr + 10;\r\n  Ctor.rounding = 1;\r\n\r\n  x = x.sin();\r\n  x.s = 1;\r\n  x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n  Ctor.precision = pr;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(quadrant == 2 || quadrant == 4 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/*\r\n *  n * 0 = 0\r\n *  n * N = N\r\n *  n * I = I\r\n *  0 * n = 0\r\n *  0 * 0 = 0\r\n *  0 * N = N\r\n *  0 * I = N\r\n *  N * n = N\r\n *  N * 0 = N\r\n *  N * N = N\r\n *  N * I = N\r\n *  I * n = I\r\n *  I * 0 = N\r\n *  I * N = N\r\n *  I * I = I\r\n *\r\n * Return a new Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n */\r\nP.times = P.mul = function (y) {\r\n  var carry, e, i, k, r, rL, t, xdL, ydL,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    xd = x.d,\r\n    yd = (y = new Ctor(y)).d;\r\n\r\n  y.s *= x.s;\r\n\r\n   // If either is NaN, ±Infinity or ±0...\r\n  if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n      // Return NaN if either is NaN.\r\n      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n      ? NaN\r\n\r\n      // Return ±Infinity if either is ±Infinity.\r\n      // Return ±0 if either is ±0.\r\n      : !xd || !yd ? y.s / 0 : y.s * 0);\r\n  }\r\n\r\n  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Ensure xd points to the longer array.\r\n  if (xdL < ydL) {\r\n    r = xd;\r\n    xd = yd;\r\n    yd = r;\r\n    rL = xdL;\r\n    xdL = ydL;\r\n    ydL = rL;\r\n  }\r\n\r\n  // Initialise the result array with zeros.\r\n  r = [];\r\n  rL = xdL + ydL;\r\n  for (i = rL; i--;) r.push(0);\r\n\r\n  // Multiply!\r\n  for (i = ydL; --i >= 0;) {\r\n    carry = 0;\r\n    for (k = xdL + i; k > i;) {\r\n      t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n      r[k--] = t % BASE | 0;\r\n      carry = t / BASE | 0;\r\n    }\r\n\r\n    r[k] = (r[k] + carry) % BASE | 0;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; !r[--rL];) r.pop();\r\n\r\n  if (carry) ++e;\r\n  else r.shift();\r\n\r\n  y.d = r;\r\n  y.e = getBase10Exponent(r, e);\r\n\r\n  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toBinary = function (sd, rm) {\r\n  return toStringBinary(this, 2, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n *\r\n * If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n  if (dp === void 0) return x;\r\n\r\n  checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n  if (rm === void 0) rm = Ctor.rounding;\r\n  else checkInt32(rm, 0, 8);\r\n\r\n  return finalise(x, dp + x.e + 1, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toExponential = function (dp, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x, true);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), dp + 1, rm);\r\n    str = finiteToString(x, true, dp + 1);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n *\r\n * As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n *\r\n */\r\nP.toFixed = function (dp, rm) {\r\n  var str, y,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (dp === void 0) {\r\n    str = finiteToString(x);\r\n  } else {\r\n    checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n    str = finiteToString(y, false, dp + y.e + 1);\r\n  }\r\n\r\n  // To determine whether to add the minus sign look at the value before it was rounded,\r\n  // i.e. look at `x` rather than `y`.\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n *\r\n * The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n *\r\n * [maxD] {number|string|bigint|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n *\r\n */\r\nP.toFraction = function (maxD) {\r\n  var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n    x = this,\r\n    xd = x.d,\r\n    Ctor = x.constructor;\r\n\r\n  if (!xd) return new Ctor(x);\r\n\r\n  n1 = d0 = new Ctor(1);\r\n  d1 = n0 = new Ctor(0);\r\n\r\n  d = new Ctor(d1);\r\n  e = d.e = getPrecision(xd) - x.e - 1;\r\n  k = e % LOG_BASE;\r\n  d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n  if (maxD == null) {\r\n\r\n    // d is 10**e, the minimum max-denominator needed.\r\n    maxD = e > 0 ? d : n1;\r\n  } else {\r\n    n = new Ctor(maxD);\r\n    if (!n.isInt() || n.lt(n1)) throw Error(invalidArgument + n);\r\n    maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n  }\r\n\r\n  external = false;\r\n  n = new Ctor(digitsToString(xd));\r\n  pr = Ctor.precision;\r\n  Ctor.precision = e = xd.length * LOG_BASE * 2;\r\n\r\n  for (;;)  {\r\n    q = divide(n, d, 0, 1, 1);\r\n    d2 = d0.plus(q.times(d1));\r\n    if (d2.cmp(maxD) == 1) break;\r\n    d0 = d1;\r\n    d1 = d2;\r\n    d2 = n1;\r\n    n1 = n0.plus(q.times(d2));\r\n    n0 = d2;\r\n    d2 = d;\r\n    d = n.minus(q.times(d2));\r\n    n = d2;\r\n  }\r\n\r\n  d2 = divide(maxD.minus(d0), d1, 0, 1, 1);\r\n  n0 = n0.plus(d2.times(n1));\r\n  d0 = d0.plus(d2.times(d1));\r\n  n0.s = n1.s = x.s;\r\n\r\n  // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n  r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n      ? [n1, d1] : [n0, d0];\r\n\r\n  Ctor.precision = pr;\r\n  external = true;\r\n\r\n  return r;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toHexadecimal = P.toHex = function (sd, rm) {\r\n  return toStringBinary(this, 16, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n *\r\n * The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n *\r\n * The return value is not affected by the value of `precision`.\r\n *\r\n * y {number|string|bigint|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toNearest = function (y, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (y == null) {\r\n\r\n    // If x is not finite, return x.\r\n    if (!x.d) return x;\r\n\r\n    y = new Ctor(1);\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    y = new Ctor(y);\r\n    if (rm === void 0) {\r\n      rm = Ctor.rounding;\r\n    } else {\r\n      checkInt32(rm, 0, 8);\r\n    }\r\n\r\n    // If x is not finite, return x if y is not NaN, else NaN.\r\n    if (!x.d) return y.s ? x : y;\r\n\r\n    // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n    if (!y.d) {\r\n      if (y.s) y.s = x.s;\r\n      return y;\r\n    }\r\n  }\r\n\r\n  // If y is not zero, calculate the nearest multiple of y to x.\r\n  if (y.d[0]) {\r\n    external = false;\r\n    x = divide(x, y, 0, rm, 1).times(y);\r\n    external = true;\r\n    finalise(x);\r\n\r\n  // If y is zero, return zero with the sign of x.\r\n  } else {\r\n    y.s = x.s;\r\n    x = y;\r\n  }\r\n\r\n  return x;\r\n};\r\n\r\n\r\n/*\r\n * Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n *\r\n */\r\nP.toNumber = function () {\r\n  return +this;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toOctal = function (sd, rm) {\r\n  return toStringBinary(this, 8, sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * ECMAScript compliant.\r\n *\r\n *   pow(x, NaN)                           = NaN\r\n *   pow(x, ±0)                            = 1\r\n\r\n *   pow(NaN, non-zero)                    = NaN\r\n *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n *   pow(abs(x) > 1, -Infinity)            = +0\r\n *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n *   pow(abs(x) < 1, +Infinity)            = +0\r\n *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n *   pow(+Infinity, y > 0)                 = +Infinity\r\n *   pow(+Infinity, y < 0)                 = +0\r\n *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n *   pow(-Infinity, even integer > 0)      = +Infinity\r\n *   pow(-Infinity, odd integer < 0)       = -0\r\n *   pow(-Infinity, even integer < 0)      = +0\r\n *   pow(+0, y > 0)                        = +0\r\n *   pow(+0, y < 0)                        = +Infinity\r\n *   pow(-0, odd integer > 0)              = -0\r\n *   pow(-0, even integer > 0)             = +0\r\n *   pow(-0, odd integer < 0)              = -Infinity\r\n *   pow(-0, even integer < 0)             = +Infinity\r\n *   pow(finite x < 0, finite non-integer) = NaN\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n *   x^y = exp(y*ln(x))\r\n *\r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n *\r\n * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n *\r\n * y {number|string|bigint|Decimal} The power to which to raise this Decimal.\r\n *\r\n */\r\nP.toPower = P.pow = function (y) {\r\n  var e, k, pr, r, rm, s,\r\n    x = this,\r\n    Ctor = x.constructor,\r\n    yn = +(y = new Ctor(y));\r\n\r\n  // Either ±Infinity, NaN or ±0?\r\n  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (x.eq(1)) return x;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n  // y exponent\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n    r = intPow(Ctor, x, k, pr);\r\n    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n  }\r\n\r\n  s = x.s;\r\n\r\n  // if x is negative\r\n  if (s < 0) {\r\n\r\n    // if y is not an integer\r\n    if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n    // Result is positive if x is negative and the last digit of integer y is even.\r\n    if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n    // if x.eq(-1)\r\n    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n      x.s = s;\r\n      return x;\r\n    }\r\n  }\r\n\r\n  // Estimate result exponent.\r\n  // x^y = 10^e,  where e = y * log10(x)\r\n  // log10(x) = log10(x_significand) + x_exponent\r\n  // log10(x_significand) = ln(x_significand) / ln(10)\r\n  k = mathpow(+x, yn);\r\n  e = k == 0 || !isFinite(k)\r\n    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n    : new Ctor(k + '').e;\r\n\r\n  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n  // Overflow/underflow?\r\n  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n  external = false;\r\n  Ctor.rounding = x.s = 1;\r\n\r\n  // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n  // new Decimal(2.32456).pow('2087987436534566.46411')\r\n  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n  k = Math.min(12, (e + '').length);\r\n\r\n  // r = x^y = exp(y*ln(x))\r\n  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n  if (r.d) {\r\n\r\n    // Truncate to the required precision plus five rounding digits.\r\n    r = finalise(r, pr + 5, 1);\r\n\r\n    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n    // the result.\r\n    if (checkRoundingDigits(r.d, pr, rm)) {\r\n      e = pr + 10;\r\n\r\n      // Truncate to the increased precision plus five rounding digits.\r\n      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n        r = finalise(r, pr + 1, 0);\r\n      }\r\n    }\r\n  }\r\n\r\n  r.s = s;\r\n  external = true;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\nP.toPrecision = function (sd, rm) {\r\n  var str,\r\n    x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n\r\n    x = finalise(new Ctor(x), sd, rm);\r\n    str = finiteToString(x, sd <= x.e || x.e <= Ctor.toExpNeg, sd);\r\n  }\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n *\r\n */\r\nP.toSignificantDigits = P.toSD = function (sd, rm) {\r\n  var x = this,\r\n    Ctor = x.constructor;\r\n\r\n  if (sd === void 0) {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  } else {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  }\r\n\r\n  return finalise(new Ctor(x), sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n *\r\n * Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n *\r\n */\r\nP.toString = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n *\r\n */\r\nP.truncated = P.trunc = function () {\r\n  return finalise(new this.constructor(this), this.e + 1, 1);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n *\r\n */\r\nP.valueOf = P.toJSON = function () {\r\n  var x = this,\r\n    Ctor = x.constructor,\r\n    str = finiteToString(x, x.e <= Ctor.toExpNeg || x.e >= Ctor.toExpPos);\r\n\r\n  return x.isNeg() ? '-' + str : str;\r\n};\r\n\r\n\r\n// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n/*\r\n *  digitsToString           P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n *                           finiteToString, naturalExponential, naturalLogarithm\r\n *  checkInt32               P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n *                           P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n *  checkRoundingDigits      P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n *  convertBase              toStringBinary, parseOther\r\n *  cos                      P.cos\r\n *  divide                   P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n *                           P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n *                           P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n *                           taylorSeries, atan2, parseOther\r\n *  finalise                 P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n *                           P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n *                           P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n *                           P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n *                           P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n *                           P.truncated, divide, getLn10, getPi, naturalExponential,\r\n *                           naturalLogarithm, ceil, floor, round, trunc\r\n *  finiteToString           P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n *                           toStringBinary\r\n *  getBase10Exponent        P.minus, P.plus, P.times, parseOther\r\n *  getLn10                  P.logarithm, naturalLogarithm\r\n *  getPi                    P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n *  getPrecision             P.precision, P.toFraction\r\n *  getZeroString            digitsToString, finiteToString\r\n *  intPow                   P.toPower, parseOther\r\n *  isOdd                    toLessThanHalfPi\r\n *  maxOrMin                 max, min\r\n *  naturalExponential       P.naturalExponential, P.toPower\r\n *  naturalLogarithm         P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n *                           P.toPower, naturalExponential\r\n *  nonFiniteToString        finiteToString, toStringBinary\r\n *  parseDecimal             Decimal\r\n *  parseOther               Decimal\r\n *  sin                      P.sin\r\n *  taylorSeries             P.cosh, P.sinh, cos, sin\r\n *  toLessThanHalfPi         P.cos, P.sin\r\n *  toStringBinary           P.toBinary, P.toHexadecimal, P.toOctal\r\n *  truncate                 intPow\r\n *\r\n *  Throws:                  P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n *                           naturalLogarithm, config, parseOther, random, Decimal\r\n */\r\n\r\n\r\nfunction digitsToString(d) {\r\n  var i, k, ws,\r\n    indexOfLastWord = d.length - 1,\r\n    str = '',\r\n    w = d[0];\r\n\r\n  if (indexOfLastWord > 0) {\r\n    str += w;\r\n    for (i = 1; i < indexOfLastWord; i++) {\r\n      ws = d[i] + '';\r\n      k = LOG_BASE - ws.length;\r\n      if (k) str += getZeroString(k);\r\n      str += ws;\r\n    }\r\n\r\n    w = d[i];\r\n    ws = w + '';\r\n    k = LOG_BASE - ws.length;\r\n    if (k) str += getZeroString(k);\r\n  } else if (w === 0) {\r\n    return '0';\r\n  }\r\n\r\n  // Remove trailing zeros of last w.\r\n  for (; w % 10 === 0;) w /= 10;\r\n\r\n  return str + w;\r\n}\r\n\r\n\r\nfunction checkInt32(i, min, max) {\r\n  if (i !== ~~i || i < min || i > max) {\r\n    throw Error(invalidArgument + i);\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n */\r\nfunction checkRoundingDigits(d, i, rm, repeating) {\r\n  var di, k, r, rd;\r\n\r\n  // Get the length of the first word of the array d.\r\n  for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n  // Is the rounding digit in the first word of d?\r\n  if (--i < 0) {\r\n    i += LOG_BASE;\r\n    di = 0;\r\n  } else {\r\n    di = Math.ceil((i + 1) / LOG_BASE);\r\n    i %= LOG_BASE;\r\n  }\r\n\r\n  // i is the index (0 - 6) of the rounding digit.\r\n  // E.g. if within the word 3487563 the first rounding digit is 5,\r\n  // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n  k = mathpow(10, LOG_BASE - i);\r\n  rd = d[di] % k | 0;\r\n\r\n  if (repeating == null) {\r\n    if (i < 3) {\r\n      if (i == 0) rd = rd / 100 | 0;\r\n      else if (i == 1) rd = rd / 10 | 0;\r\n      r = rm < 4 && rd == 99999 || rm > 3 && rd == 49999 || rd == 50000 || rd == 0;\r\n    } else {\r\n      r = (rm < 4 && rd + 1 == k || rm > 3 && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 100 | 0) == mathpow(10, i - 2) - 1 ||\r\n          (rd == k / 2 || rd == 0) && (d[di + 1] / k / 100 | 0) == 0;\r\n    }\r\n  } else {\r\n    if (i < 4) {\r\n      if (i == 0) rd = rd / 1000 | 0;\r\n      else if (i == 1) rd = rd / 100 | 0;\r\n      else if (i == 2) rd = rd / 10 | 0;\r\n      r = (repeating || rm < 4) && rd == 9999 || !repeating && rm > 3 && rd == 4999;\r\n    } else {\r\n      r = ((repeating || rm < 4) && rd + 1 == k ||\r\n      (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n        (d[di + 1] / k / 1000 | 0) == mathpow(10, i - 3) - 1;\r\n    }\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n// Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n// Eg. convertBase('255', 10, 16) returns [15, 15].\r\n// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\nfunction convertBase(str, baseIn, baseOut) {\r\n  var j,\r\n    arr = [0],\r\n    arrL,\r\n    i = 0,\r\n    strL = str.length;\r\n\r\n  for (; i < strL;) {\r\n    for (arrL = arr.length; arrL--;) arr[arrL] *= baseIn;\r\n    arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n    for (j = 0; j < arr.length; j++) {\r\n      if (arr[j] > baseOut - 1) {\r\n        if (arr[j + 1] === void 0) arr[j + 1] = 0;\r\n        arr[j + 1] += arr[j] / baseOut | 0;\r\n        arr[j] %= baseOut;\r\n      }\r\n    }\r\n  }\r\n\r\n  return arr.reverse();\r\n}\r\n\r\n\r\n/*\r\n * cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction cosine(Ctor, x) {\r\n  var k, len, y;\r\n\r\n  if (x.isZero()) return x;\r\n\r\n  // Argument reduction: cos(4x) = 8*(cos^4(x) - cos^2(x)) + 1\r\n  // i.e. cos(x) = 8*(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  len = x.d.length;\r\n  if (len < 32) {\r\n    k = Math.ceil(len / 3);\r\n    y = (1 / tinyPow(4, k)).toString();\r\n  } else {\r\n    k = 16;\r\n    y = '2.3283064365386962890625e-10';\r\n  }\r\n\r\n  Ctor.precision += k;\r\n\r\n  x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n  // Reverse argument reduction\r\n  for (var i = k; i--;) {\r\n    var cos2x = x.times(x);\r\n    x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n  }\r\n\r\n  Ctor.precision -= k;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Perform division in the specified base.\r\n */\r\nvar divide = (function () {\r\n\r\n  // Assumes non-zero x and k, and hence non-zero result.\r\n  function multiplyInteger(x, k, base) {\r\n    var temp,\r\n      carry = 0,\r\n      i = x.length;\r\n\r\n    for (x = x.slice(); i--;) {\r\n      temp = x[i] * k + carry;\r\n      x[i] = temp % base | 0;\r\n      carry = temp / base | 0;\r\n    }\r\n\r\n    if (carry) x.unshift(carry);\r\n\r\n    return x;\r\n  }\r\n\r\n  function compare(a, b, aL, bL) {\r\n    var i, r;\r\n\r\n    if (aL != bL) {\r\n      r = aL > bL ? 1 : -1;\r\n    } else {\r\n      for (i = r = 0; i < aL; i++) {\r\n        if (a[i] != b[i]) {\r\n          r = a[i] > b[i] ? 1 : -1;\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    return r;\r\n  }\r\n\r\n  function subtract(a, b, aL, base) {\r\n    var i = 0;\r\n\r\n    // Subtract b from a.\r\n    for (; aL--;) {\r\n      a[aL] -= i;\r\n      i = a[aL] < b[aL] ? 1 : 0;\r\n      a[aL] = i * base + a[aL] - b[aL];\r\n    }\r\n\r\n    // Remove leading zeros.\r\n    for (; !a[0] && a.length > 1;) a.shift();\r\n  }\r\n\r\n  return function (x, y, pr, rm, dp, base) {\r\n    var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n      yL, yz,\r\n      Ctor = x.constructor,\r\n      sign = x.s == y.s ? 1 : -1,\r\n      xd = x.d,\r\n      yd = y.d;\r\n\r\n    // Either NaN, Infinity or 0?\r\n    if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n      return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n        !x.s || !y.s || (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n        // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n    }\r\n\r\n    if (base) {\r\n      logBase = 1;\r\n      e = x.e - y.e;\r\n    } else {\r\n      base = BASE;\r\n      logBase = LOG_BASE;\r\n      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n    }\r\n\r\n    yL = yd.length;\r\n    xL = xd.length;\r\n    q = new Ctor(sign);\r\n    qd = q.d = [];\r\n\r\n    // Result exponent may be one less than e.\r\n    // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n    for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n    if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n    if (pr == null) {\r\n      sd = pr = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else if (dp) {\r\n      sd = pr + (x.e - y.e) + 1;\r\n    } else {\r\n      sd = pr;\r\n    }\r\n\r\n    if (sd < 0) {\r\n      qd.push(1);\r\n      more = true;\r\n    } else {\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / logBase + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * base + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n        more = k || i < xL;\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= base/2\r\n        k = base / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k, base);\r\n          xd = multiplyInteger(xd, k, base);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= base / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= base) k = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL, base);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n        more = rem[0] !== void 0;\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n    }\r\n\r\n    // logBase is 1 when divide is being used for base conversion.\r\n    if (logBase == 1) {\r\n      q.e = e;\r\n      inexact = more;\r\n    } else {\r\n\r\n      // To calculate q.e, first get the number of digits of qd[0].\r\n      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n      q.e = i + e * logBase - 1;\r\n\r\n      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n    }\r\n\r\n    return q;\r\n  };\r\n})();\r\n\r\n\r\n/*\r\n * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n */\r\n function finalise(x, sd, rm, isTruncated) {\r\n  var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n    Ctor = x.constructor;\r\n\r\n  // Don't round if sd is null or undefined.\r\n  out: if (sd != null) {\r\n    xd = x.d;\r\n\r\n    // Infinity/NaN.\r\n    if (!xd) return x;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd containing rd, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // digits: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n    i = sd - digits;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) {\r\n        if (isTruncated) {\r\n\r\n          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n          for (; k++ <= xdi;) xd.push(0);\r\n          w = rd = 0;\r\n          digits = 1;\r\n          i %= LOG_BASE;\r\n          j = i - LOG_BASE + 1;\r\n        } else {\r\n          break out;\r\n        }\r\n      } else {\r\n        w = k = xd[xdi];\r\n\r\n        // Get the number of digits of w.\r\n        for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n        // Get the index of rd within w.\r\n        i %= LOG_BASE;\r\n\r\n        // Get the index of rd within w, adjusted for leading zeros.\r\n        // The number of leading zeros of w is given by LOG_BASE - digits.\r\n        j = i - LOG_BASE + digits;\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      }\r\n    }\r\n\r\n    // Are there any non-zero digits after the rounding digit?\r\n    isTruncated = isTruncated || sd < 0 ||\r\n      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n    // will give 714.\r\n\r\n    roundUp = rm < 4\r\n      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n        // Check whether the digit to the left of the rounding digit is odd.\r\n        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n          rm == (x.s < 0 ? 8 : 7));\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      xd.length = 0;\r\n      if (roundUp) {\r\n\r\n        // Convert sd to decimal places.\r\n        sd -= x.e + 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = -sd || 0;\r\n      } else {\r\n\r\n        // Zero.\r\n        xd[0] = x.e = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (roundUp) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n\r\n          // i will be the length of xd[0] before k is added.\r\n          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n          j = xd[0] += k;\r\n          for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n          // if i != k the length has increased.\r\n          if (i != k) {\r\n            x.e++;\r\n            if (xd[0] == BASE) xd[0] = 1;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n  }\r\n\r\n  if (external) {\r\n\r\n    // Overflow?\r\n    if (x.e > Ctor.maxE) {\r\n\r\n      // Infinity.\r\n      x.d = null;\r\n      x.e = NaN;\r\n\r\n    // Underflow?\r\n    } else if (x.e < Ctor.minE) {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n      // Ctor.underflow = true;\r\n    } // else Ctor.underflow = false;\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\nfunction finiteToString(x, isExp, sd) {\r\n  if (!x.isFinite()) return nonFiniteToString(x);\r\n  var k,\r\n    e = x.e,\r\n    str = digitsToString(x.d),\r\n    len = str.length;\r\n\r\n  if (isExp) {\r\n    if (sd && (k = sd - len) > 0) {\r\n      str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n    } else if (len > 1) {\r\n      str = str.charAt(0) + '.' + str.slice(1);\r\n    }\r\n\r\n    str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n  } else if (e < 0) {\r\n    str = '0.' + getZeroString(-e - 1) + str;\r\n    if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n  } else if (e >= len) {\r\n    str += getZeroString(e + 1 - len);\r\n    if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n  } else {\r\n    if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n    if (sd && (k = sd - len) > 0) {\r\n      if (e + 1 === len) str += '.';\r\n      str += getZeroString(k);\r\n    }\r\n  }\r\n\r\n  return str;\r\n}\r\n\r\n\r\n// Calculate the base 10 exponent from the base 1e7 exponent.\r\nfunction getBase10Exponent(digits, e) {\r\n  var w = digits[0];\r\n\r\n  // Add the number of digits of the first word of the digits array.\r\n  for ( e *= LOG_BASE; w >= 10; w /= 10) e++;\r\n  return e;\r\n}\r\n\r\n\r\nfunction getLn10(Ctor, sd, pr) {\r\n  if (sd > LN10_PRECISION) {\r\n\r\n    // Reset global state in case the exception is caught.\r\n    external = true;\r\n    if (pr) Ctor.precision = pr;\r\n    throw Error(precisionLimitExceeded);\r\n  }\r\n  return finalise(new Ctor(LN10), sd, 1, true);\r\n}\r\n\r\n\r\nfunction getPi(Ctor, sd, rm) {\r\n  if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n  return finalise(new Ctor(PI), sd, rm, true);\r\n}\r\n\r\n\r\nfunction getPrecision(digits) {\r\n  var w = digits.length - 1,\r\n    len = w * LOG_BASE + 1;\r\n\r\n  w = digits[w];\r\n\r\n  // If non-zero...\r\n  if (w) {\r\n\r\n    // Subtract the number of trailing zeros of the last word.\r\n    for (; w % 10 == 0; w /= 10) len--;\r\n\r\n    // Add the number of digits of the first word.\r\n    for (w = digits[0]; w >= 10; w /= 10) len++;\r\n  }\r\n\r\n  return len;\r\n}\r\n\r\n\r\nfunction getZeroString(k) {\r\n  var zs = '';\r\n  for (; k--;) zs += '0';\r\n  return zs;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n *\r\n * Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n *\r\n */\r\nfunction intPow(Ctor, x, n, pr) {\r\n  var isTruncated,\r\n    r = new Ctor(1),\r\n\r\n    // Max n of 9007199254740991 takes 53 loop iterations.\r\n    // Maximum digits array length; leaves [28, 34] guard digits.\r\n    k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n  external = false;\r\n\r\n  for (;;) {\r\n    if (n % 2) {\r\n      r = r.times(x);\r\n      if (truncate(r.d, k)) isTruncated = true;\r\n    }\r\n\r\n    n = mathfloor(n / 2);\r\n    if (n === 0) {\r\n\r\n      // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n      n = r.d.length - 1;\r\n      if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n      break;\r\n    }\r\n\r\n    x = x.times(x);\r\n    truncate(x.d, k);\r\n  }\r\n\r\n  external = true;\r\n\r\n  return r;\r\n}\r\n\r\n\r\nfunction isOdd(n) {\r\n  return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/*\r\n * Handle `max` (`n` is -1) and `min` (`n` is 1).\r\n */\r\nfunction maxOrMin(Ctor, args, n) {\r\n  var k, y,\r\n    x = new Ctor(args[0]),\r\n    i = 0;\r\n\r\n  for (; ++i < args.length;) {\r\n    y = new Ctor(args[i]);\r\n\r\n    // NaN?\r\n    if (!y.s) {\r\n      x = y;\r\n      break;\r\n    }\r\n\r\n    k = x.cmp(y);\r\n\r\n    if (k === n || k === 0 && x.s === n) {\r\n      x = y;\r\n    }\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n * Taylor/Maclaurin series.\r\n *\r\n * exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n *\r\n * Argument reduction:\r\n *   Repeat x = x / 32, k += 5, until |x| < 0.1\r\n *   exp(x) = exp(x / 2^k)^(2^k)\r\n *\r\n * Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k  where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until |x| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n *\r\n * Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n *\r\n *  exp(Infinity)  = Infinity\r\n *  exp(-Infinity) = 0\r\n *  exp(NaN)       = NaN\r\n *  exp(±0)        = 1\r\n *\r\n *  exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n *  The result will always be correctly rounded.\r\n *\r\n */\r\nfunction naturalExponential(x, sd) {\r\n  var denominator, guard, j, pow, sum, t, wpr,\r\n    rep = 0,\r\n    i = 0,\r\n    k = 0,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // 0/NaN/Infinity?\r\n  if (!x.d || !x.d[0] || x.e > 17) {\r\n\r\n    return new Ctor(x.d\r\n      ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n      : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  t = new Ctor(0.03125);\r\n\r\n  // while abs(x) >= 0.1\r\n  while (x.e > -2) {\r\n\r\n    // x = x / 2^5\r\n    x = x.times(t);\r\n    k += 5;\r\n  }\r\n\r\n  // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n  // necessary to ensure the first 4 rounding digits are correct.\r\n  guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 | 0;\r\n  wpr += guard;\r\n  denominator = pow = sum = new Ctor(1);\r\n  Ctor.precision = wpr;\r\n\r\n  for (;;) {\r\n    pow = finalise(pow.times(x), wpr, 1);\r\n    denominator = denominator.times(++i);\r\n    t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      j = k;\r\n      while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n      // Check to see if the first 4 rounding digits are [49]999.\r\n      // If so, repeat the summation with a higher precision, otherwise\r\n      // e.g. with precision: 18, rounding: 1\r\n      // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n\r\n        if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += 10;\r\n          denominator = pow = t = new Ctor(1);\r\n          i = 0;\r\n          rep++;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n  }\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n *\r\n *  ln(-n)        = NaN\r\n *  ln(0)         = -Infinity\r\n *  ln(-0)        = -Infinity\r\n *  ln(1)         = 0\r\n *  ln(Infinity)  = Infinity\r\n *  ln(-Infinity) = NaN\r\n *  ln(NaN)       = NaN\r\n *\r\n *  ln(n) (n != 1) is non-terminating.\r\n *\r\n */\r\nfunction naturalLogarithm(y, sd) {\r\n  var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n    n = 1,\r\n    guard = 10,\r\n    x = y,\r\n    xd = x.d,\r\n    Ctor = x.constructor,\r\n    rm = Ctor.rounding,\r\n    pr = Ctor.precision;\r\n\r\n  // Is x negative or Infinity, NaN, 0 or 1?\r\n  if (x.s < 0 || !xd || !xd[0] || !x.e && xd[0] == 1 && xd.length == 1) {\r\n    return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n  }\r\n\r\n  if (sd == null) {\r\n    external = false;\r\n    wpr = pr;\r\n  } else {\r\n    wpr = sd;\r\n  }\r\n\r\n  Ctor.precision = wpr += guard;\r\n  c = digitsToString(xd);\r\n  c0 = c.charAt(0);\r\n\r\n  if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n    // Argument reduction.\r\n    // The series converges faster the closer the argument is to 1, so using\r\n    // ln(a^b) = b * ln(a),   ln(a) = ln(a^b) / b\r\n    // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n    // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n    // later be divided by this number, then separate out the power of 10 using\r\n    // ln(a*10^b) = ln(a) + b*ln(10).\r\n\r\n    // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n    //while (c0 < 9 && c0 != 1 || c0 == 1 && c.charAt(1) > 1) {\r\n    // max n is 6 (gives 0.7 - 1.3)\r\n    while (c0 < 7 && c0 != 1 || c0 == 1 && c.charAt(1) > 3) {\r\n      x = x.times(y);\r\n      c = digitsToString(x.d);\r\n      c0 = c.charAt(0);\r\n      n++;\r\n    }\r\n\r\n    e = x.e;\r\n\r\n    if (c0 > 1) {\r\n      x = new Ctor('0.' + c);\r\n      e++;\r\n    } else {\r\n      x = new Ctor(c0 + '.' + c.slice(1));\r\n    }\r\n  } else {\r\n\r\n    // The argument reduction method above may result in overflow if the argument y is a massive\r\n    // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n    // function using ln(x*10^e) = ln(x) + e*ln(10).\r\n    t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n    x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n    Ctor.precision = pr;\r\n\r\n    return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n  }\r\n\r\n  // x1 is x reduced to a value near 1.\r\n  x1 = x;\r\n\r\n  // Taylor series.\r\n  // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n  // where x = (y - 1)/(y + 1)    (|x| < 1)\r\n  sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n  x2 = finalise(x.times(x), wpr, 1);\r\n  denominator = 3;\r\n\r\n  for (;;) {\r\n    numerator = finalise(numerator.times(x2), wpr, 1);\r\n    t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n    if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n      sum = sum.times(2);\r\n\r\n      // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n      // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n      if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n      sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n      // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n      // been repeated previously) and the first 4 rounding digits 9999?\r\n      // If so, restart the summation with a higher precision, otherwise\r\n      // e.g. with precision: 12, rounding: 1\r\n      // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n      // `wpr - guard` is the index of first rounding digit.\r\n      if (sd == null) {\r\n        if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n          Ctor.precision = wpr += guard;\r\n          t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n          x2 = finalise(x.times(x), wpr, 1);\r\n          denominator = rep = 1;\r\n        } else {\r\n          return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n        }\r\n      } else {\r\n        Ctor.precision = pr;\r\n        return sum;\r\n      }\r\n    }\r\n\r\n    sum = t;\r\n    denominator += 2;\r\n  }\r\n}\r\n\r\n\r\n// ±Infinity, NaN.\r\nfunction nonFiniteToString(x) {\r\n  // Unsigned.\r\n  return String(x.s * x.s / 0);\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from string `str`.\r\n */\r\nfunction parseDecimal(x, str) {\r\n  var e, i, len;\r\n\r\n  // TODO BigInt str: no need to check for decimal point, exponential form or leading zeros.\r\n  // Decimal point?\r\n  if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n  // Exponential form?\r\n  if ((i = str.search(/e/i)) > 0) {\r\n\r\n    // Determine exponent.\r\n    if (e < 0) e = i;\r\n    e += +str.slice(i + 1);\r\n    str = str.substring(0, i);\r\n  } else if (e < 0) {\r\n\r\n    // Integer.\r\n    e = str.length;\r\n  }\r\n\r\n  // Determine leading zeros.\r\n  for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n  // Determine trailing zeros.\r\n  for (len = str.length; str.charCodeAt(len - 1) === 48; --len);\r\n  str = str.slice(i, len);\r\n\r\n  if (str) {\r\n    len -= i;\r\n    x.e = e = e - i - 1;\r\n    x.d = [];\r\n\r\n    // Transform base\r\n\r\n    // e is the base 10 exponent.\r\n    // i is where to slice str to get the first word of the digits array.\r\n    i = (e + 1) % LOG_BASE;\r\n    if (e < 0) i += LOG_BASE;\r\n\r\n    if (i < len) {\r\n      if (i) x.d.push(+str.slice(0, i));\r\n      for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n      str = str.slice(i);\r\n      i = LOG_BASE - str.length;\r\n    } else {\r\n      i -= len;\r\n    }\r\n\r\n    for (; i--;) str += '0';\r\n    x.d.push(+str);\r\n\r\n    if (external) {\r\n\r\n      // Overflow?\r\n      if (x.e > x.constructor.maxE) {\r\n\r\n        // Infinity.\r\n        x.d = null;\r\n        x.e = NaN;\r\n\r\n      // Underflow?\r\n      } else if (x.e < x.constructor.minE) {\r\n\r\n        // Zero.\r\n        x.e = 0;\r\n        x.d = [0];\r\n        // x.constructor.underflow = true;\r\n      } // else x.constructor.underflow = false;\r\n    }\r\n  } else {\r\n\r\n    // Zero.\r\n    x.e = 0;\r\n    x.d = [0];\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n */\r\nfunction parseOther(x, str) {\r\n  var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n  if (str.indexOf('_') > -1) {\r\n    str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n    if (isDecimal.test(str)) return parseDecimal(x, str);\r\n  } else if (str === 'Infinity' || str === 'NaN') {\r\n    if (!+str) x.s = NaN;\r\n    x.e = NaN;\r\n    x.d = null;\r\n    return x;\r\n  }\r\n\r\n  if (isHex.test(str))  {\r\n    base = 16;\r\n    str = str.toLowerCase();\r\n  } else if (isBinary.test(str))  {\r\n    base = 2;\r\n  } else if (isOctal.test(str))  {\r\n    base = 8;\r\n  } else {\r\n    throw Error(invalidArgument + str);\r\n  }\r\n\r\n  // Is there a binary exponent part?\r\n  i = str.search(/p/i);\r\n\r\n  if (i > 0) {\r\n    p = +str.slice(i + 1);\r\n    str = str.substring(2, i);\r\n  } else {\r\n    str = str.slice(2);\r\n  }\r\n\r\n  // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n  // fraction part will be restored.\r\n  i = str.indexOf('.');\r\n  isFloat = i >= 0;\r\n  Ctor = x.constructor;\r\n\r\n  if (isFloat) {\r\n    str = str.replace('.', '');\r\n    len = str.length;\r\n    i = len - i;\r\n\r\n    // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n    divisor = intPow(Ctor, new Ctor(base), i, i * 2);\r\n  }\r\n\r\n  xd = convertBase(str, base, BASE);\r\n  xe = xd.length - 1;\r\n\r\n  // Remove trailing zeros.\r\n  for (i = xe; xd[i] === 0; --i) xd.pop();\r\n  if (i < 0) return new Ctor(x.s * 0);\r\n  x.e = getBase10Exponent(xd, xe);\r\n  x.d = xd;\r\n  external = false;\r\n\r\n  // At what precision to perform the division to ensure exact conversion?\r\n  // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n  // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n  // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n  // maxDecimalFractionPartDigitCount = {Hex:4|Oct:3|Bin:1} * otherBaseFractionPartDigitCount\r\n  // Therefore using 4 * the number of digits of str will always be enough.\r\n  if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n  // Multiply by the binary exponent part if present.\r\n  if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n  external = true;\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * sin(x) = x - x^3/3! + x^5/5! - ...\r\n * |x| < pi/2\r\n *\r\n */\r\nfunction sine(Ctor, x) {\r\n  var k,\r\n    len = x.d.length;\r\n\r\n  if (len < 3) {\r\n    return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n  }\r\n\r\n  // Argument reduction: sin(5x) = 16*sin^5(x) - 20*sin^3(x) + 5*sin(x)\r\n  // i.e. sin(x) = 16*sin^5(x/5) - 20*sin^3(x/5) + 5*sin(x/5)\r\n  // and  sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n  // Estimate the optimum number of times to use the argument reduction.\r\n  k = 1.4 * Math.sqrt(len);\r\n  k = k > 16 ? 16 : k | 0;\r\n\r\n  x = x.times(1 / tinyPow(5, k));\r\n  x = taylorSeries(Ctor, 2, x, x);\r\n\r\n  // Reverse argument reduction\r\n  var sin2_x,\r\n    d5 = new Ctor(5),\r\n    d16 = new Ctor(16),\r\n    d20 = new Ctor(20);\r\n  for (; k--;) {\r\n    sin2_x = x.times(x);\r\n    x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\nfunction taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n  var j, t, u, x2,\r\n    i = 1,\r\n    pr = Ctor.precision,\r\n    k = Math.ceil(pr / LOG_BASE);\r\n\r\n  external = false;\r\n  x2 = x.times(x);\r\n  u = new Ctor(y);\r\n\r\n  for (;;) {\r\n    t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n    y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n    t = u.plus(y);\r\n\r\n    if (t.d[k] !== void 0) {\r\n      for (j = k; t.d[j] === u.d[j] && j--;);\r\n      if (j == -1) break;\r\n    }\r\n\r\n    j = u;\r\n    u = y;\r\n    y = t;\r\n    t = j;\r\n    i++;\r\n  }\r\n\r\n  external = true;\r\n  t.d.length = k + 1;\r\n\r\n  return t;\r\n}\r\n\r\n\r\n// Exponent e must be positive and non-zero.\r\nfunction tinyPow(b, e) {\r\n  var n = b;\r\n  while (--e) n *= b;\r\n  return n;\r\n}\r\n\r\n\r\n// Return the absolute value of `x` reduced to less than or equal to half pi.\r\nfunction toLessThanHalfPi(Ctor, x) {\r\n  var t,\r\n    isNeg = x.s < 0,\r\n    pi = getPi(Ctor, Ctor.precision, 1),\r\n    halfPi = pi.times(0.5);\r\n\r\n  x = x.abs();\r\n\r\n  if (x.lte(halfPi)) {\r\n    quadrant = isNeg ? 4 : 1;\r\n    return x;\r\n  }\r\n\r\n  t = x.divToInt(pi);\r\n\r\n  if (t.isZero()) {\r\n    quadrant = isNeg ? 3 : 2;\r\n  } else {\r\n    x = x.minus(t.times(pi));\r\n\r\n    // 0 <= x < pi\r\n    if (x.lte(halfPi)) {\r\n      quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n      return x;\r\n    }\r\n\r\n    quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n  }\r\n\r\n  return x.minus(pi).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n *\r\n * If the optional `sd` argument is present include a binary exponent suffix.\r\n */\r\nfunction toStringBinary(x, baseOut, sd, rm) {\r\n  var base, e, i, k, len, roundUp, str, xd, y,\r\n    Ctor = x.constructor,\r\n    isExp = sd !== void 0;\r\n\r\n  if (isExp) {\r\n    checkInt32(sd, 1, MAX_DIGITS);\r\n    if (rm === void 0) rm = Ctor.rounding;\r\n    else checkInt32(rm, 0, 8);\r\n  } else {\r\n    sd = Ctor.precision;\r\n    rm = Ctor.rounding;\r\n  }\r\n\r\n  if (!x.isFinite()) {\r\n    str = nonFiniteToString(x);\r\n  } else {\r\n    str = finiteToString(x);\r\n    i = str.indexOf('.');\r\n\r\n    // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n    // maxBinaryExponent = floor((decimalExponent + 1) * log[2](10))\r\n    // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n    // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n    if (isExp) {\r\n      base = 2;\r\n      if (baseOut == 16) {\r\n        sd = sd * 4 - 3;\r\n      } else if (baseOut == 8) {\r\n        sd = sd * 3 - 2;\r\n      }\r\n    } else {\r\n      base = baseOut;\r\n    }\r\n\r\n    // Convert the number as an integer then divide the result by its base raised to a power such\r\n    // that the fraction part will be restored.\r\n\r\n    // Non-integer.\r\n    if (i >= 0) {\r\n      str = str.replace('.', '');\r\n      y = new Ctor(1);\r\n      y.e = str.length - i;\r\n      y.d = convertBase(finiteToString(y), 10, base);\r\n      y.e = y.d.length;\r\n    }\r\n\r\n    xd = convertBase(str, 10, base);\r\n    e = len = xd.length;\r\n\r\n    // Remove trailing zeros.\r\n    for (; xd[--len] == 0;) xd.pop();\r\n\r\n    if (!xd[0]) {\r\n      str = isExp ? '0p+0' : '0';\r\n    } else {\r\n      if (i < 0) {\r\n        e--;\r\n      } else {\r\n        x = new Ctor(x);\r\n        x.d = xd;\r\n        x.e = e;\r\n        x = divide(x, y, sd, rm, 0, base);\r\n        xd = x.d;\r\n        e = x.e;\r\n        roundUp = inexact;\r\n      }\r\n\r\n      // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      i = xd[sd];\r\n      k = base / 2;\r\n      roundUp = roundUp || xd[sd + 1] !== void 0;\r\n\r\n      roundUp = rm < 4\r\n        ? (i !== void 0 || roundUp) && (rm === 0 || rm === (x.s < 0 ? 3 : 2))\r\n        : i > k || i === k && (rm === 4 || roundUp || rm === 6 && xd[sd - 1] & 1 ||\r\n          rm === (x.s < 0 ? 8 : 7));\r\n\r\n      xd.length = sd;\r\n\r\n      if (roundUp) {\r\n\r\n        // Rounding up may mean the previous digit has to be rounded up and so on.\r\n        for (; ++xd[--sd] > base - 1;) {\r\n          xd[sd] = 0;\r\n          if (!sd) {\r\n            ++e;\r\n            xd.unshift(1);\r\n          }\r\n        }\r\n      }\r\n\r\n      // Determine trailing zeros.\r\n      for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n      // E.g. [4, 11, 15] becomes 4bf.\r\n      for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n      // Add binary exponent suffix?\r\n      if (isExp) {\r\n        if (len > 1) {\r\n          if (baseOut == 16 || baseOut == 8) {\r\n            i = baseOut == 16 ? 4 : 3;\r\n            for (--len; len % i; len++) str += '0';\r\n            xd = convertBase(str, base, baseOut);\r\n            for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n            // xd[0] will always be be 1\r\n            for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n          } else {\r\n            str = str.charAt(0) + '.' + str.slice(1);\r\n          }\r\n        }\r\n\r\n        str =  str + (e < 0 ? 'p' : 'p+') + e;\r\n      } else if (e < 0) {\r\n        for (; ++e;) str = '0' + str;\r\n        str = '0.' + str;\r\n      } else {\r\n        if (++e > len) for (e -= len; e-- ;) str += '0';\r\n        else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n      }\r\n    }\r\n\r\n    str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n  }\r\n\r\n  return x.s < 0 ? '-' + str : str;\r\n}\r\n\r\n\r\n// Does not strip trailing zeros.\r\nfunction truncate(arr, len) {\r\n  if (arr.length > len) {\r\n    arr.length = len;\r\n    return true;\r\n  }\r\n}\r\n\r\n\r\n// Decimal methods\r\n\r\n\r\n/*\r\n *  abs\r\n *  acos\r\n *  acosh\r\n *  add\r\n *  asin\r\n *  asinh\r\n *  atan\r\n *  atanh\r\n *  atan2\r\n *  cbrt\r\n *  ceil\r\n *  clamp\r\n *  clone\r\n *  config\r\n *  cos\r\n *  cosh\r\n *  div\r\n *  exp\r\n *  floor\r\n *  hypot\r\n *  ln\r\n *  log\r\n *  log2\r\n *  log10\r\n *  max\r\n *  min\r\n *  mod\r\n *  mul\r\n *  pow\r\n *  random\r\n *  round\r\n *  set\r\n *  sign\r\n *  sin\r\n *  sinh\r\n *  sqrt\r\n *  sub\r\n *  sum\r\n *  tan\r\n *  tanh\r\n *  trunc\r\n */\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction abs(x) {\r\n  return new this(x).abs();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arccosine in radians of `x`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction acos(x) {\r\n  return new this(x).acos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction acosh(x) {\r\n  return new this(x).acosh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction add(x, y) {\r\n  return new this(x).plus(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction asin(x) {\r\n  return new this(x).asin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction asinh(x) {\r\n  return new this(x).asinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction atan(x) {\r\n  return new this(x).atan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction atanh(x) {\r\n  return new this(x).atanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n *\r\n * y {number|string|bigint|Decimal} The y-coordinate.\r\n * x {number|string|bigint|Decimal} The x-coordinate.\r\n *\r\n * atan2(±0, -0)               = ±pi\r\n * atan2(±0, +0)               = ±0\r\n * atan2(±0, -x)               = ±pi for x > 0\r\n * atan2(±0, x)                = ±0 for x > 0\r\n * atan2(-y, ±0)               = -pi/2 for y > 0\r\n * atan2(y, ±0)                = pi/2 for y > 0\r\n * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n * atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\nfunction atan2(y, x) {\r\n  y = new this(y);\r\n  x = new this(x);\r\n  var r,\r\n    pr = this.precision,\r\n    rm = this.rounding,\r\n    wpr = pr + 4;\r\n\r\n  // Either NaN\r\n  if (!y.s || !x.s) {\r\n    r = new this(NaN);\r\n\r\n  // Both ±Infinity\r\n  } else if (!y.d && !x.d) {\r\n    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n    r.s = y.s;\r\n\r\n  // x is ±Infinity or y is ±0\r\n  } else if (!x.d || y.isZero()) {\r\n    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n    r.s = y.s;\r\n\r\n  // y is ±Infinity or x is ±0\r\n  } else if (!y.d || x.isZero()) {\r\n    r = getPi(this, wpr, 1).times(0.5);\r\n    r.s = y.s;\r\n\r\n  // Both non-zero and finite\r\n  } else if (x.s < 0) {\r\n    this.precision = wpr;\r\n    this.rounding = 1;\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n    x = getPi(this, wpr, 1);\r\n    this.precision = pr;\r\n    this.rounding = rm;\r\n    r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n  } else {\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction cbrt(x) {\r\n  return new this(x).cbrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ceil(x) {\r\n  return finalise(x = new this(x), x.e + 1, 2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * min {number|string|bigint|Decimal}\r\n * max {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction clamp(x, min, max) {\r\n  return new this(x).clamp(min, max);\r\n}\r\n\r\n\r\n/*\r\n * Configure global settings for a Decimal constructor.\r\n *\r\n * `obj` is an object with one or more of the following properties,\r\n *\r\n *   precision  {number}\r\n *   rounding   {number}\r\n *   toExpNeg   {number}\r\n *   toExpPos   {number}\r\n *   maxE       {number}\r\n *   minE       {number}\r\n *   modulo     {number}\r\n *   crypto     {boolean|number}\r\n *   defaults   {true}\r\n *\r\n * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n *\r\n */\r\nfunction config(obj) {\r\n  if (!obj || typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n  var i, p, v,\r\n    useDefaults = obj.defaults === true,\r\n    ps = [\r\n      'precision', 1, MAX_DIGITS,\r\n      'rounding', 0, 8,\r\n      'toExpNeg', -EXP_LIMIT, 0,\r\n      'toExpPos', 0, EXP_LIMIT,\r\n      'maxE', 0, EXP_LIMIT,\r\n      'minE', -EXP_LIMIT, 0,\r\n      'modulo', 0, 9\r\n    ];\r\n\r\n  for (i = 0; i < ps.length; i += 3) {\r\n    if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n    if ((v = obj[p]) !== void 0) {\r\n      if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n      else throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n  if ((v = obj[p]) !== void 0) {\r\n    if (v === true || v === false || v === 0 || v === 1) {\r\n      if (v) {\r\n        if (typeof crypto != 'undefined' && crypto &&\r\n          (crypto.getRandomValues || crypto.randomBytes)) {\r\n          this[p] = true;\r\n        } else {\r\n          throw Error(cryptoUnavailable);\r\n        }\r\n      } else {\r\n        this[p] = false;\r\n      }\r\n    } else {\r\n      throw Error(invalidArgument + p + ': ' + v);\r\n    }\r\n  }\r\n\r\n  return this;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cos(x) {\r\n  return new this(x).cos();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction cosh(x) {\r\n  return new this(x).cosh();\r\n}\r\n\r\n\r\n/*\r\n * Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n *\r\n */\r\nfunction clone(obj) {\r\n  var i, p, ps;\r\n\r\n  /*\r\n   * The Decimal constructor and exported function.\r\n   * Return a new Decimal instance.\r\n   *\r\n   * v {number|string|bigint|Decimal} A numeric value.\r\n   *\r\n   */\r\n  function Decimal(v) {\r\n    var e, i, t,\r\n      x = this;\r\n\r\n    // Decimal called without new.\r\n    if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n    // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n    // which points to Object.\r\n    x.constructor = Decimal;\r\n\r\n    if (isDecimalInstance(v)) {\r\n      x.s = v.s;\r\n\r\n      if (external) {\r\n        if (!v.d || v.e > Decimal.maxE) {\r\n\r\n          // Infinity.\r\n          x.e = NaN;\r\n          x.d = null;\r\n        } else if (v.e < Decimal.minE) {\r\n\r\n          // Zero.\r\n          x.e = 0;\r\n          x.d = [0];\r\n        } else {\r\n          x.e = v.e;\r\n          x.d = v.d.slice();\r\n        }\r\n      } else {\r\n        x.e = v.e;\r\n        x.d = v.d ? v.d.slice() : v.d;\r\n      }\r\n\r\n      return;\r\n    }\r\n\r\n    t = typeof v;\r\n\r\n    if (t === 'number') {\r\n      if (v === 0) {\r\n        x.s = 1 / v < 0 ? -1 : 1;\r\n        x.e = 0;\r\n        x.d = [0];\r\n        return;\r\n      }\r\n\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      // Fast path for small integers.\r\n      if (v === ~~v && v < 1e7) {\r\n        for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n        if (external) {\r\n          if (e > Decimal.maxE) {\r\n            x.e = NaN;\r\n            x.d = null;\r\n          } else if (e < Decimal.minE) {\r\n            x.e = 0;\r\n            x.d = [0];\r\n          } else {\r\n            x.e = e;\r\n            x.d = [v];\r\n          }\r\n        } else {\r\n          x.e = e;\r\n          x.d = [v];\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      // Infinity or NaN?\r\n      if (v * 0 !== 0) {\r\n        if (!v) x.s = NaN;\r\n        x.e = NaN;\r\n        x.d = null;\r\n        return;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    if (t === 'string') {\r\n      if ((i = v.charCodeAt(0)) === 45) {  // minus sign\r\n        v = v.slice(1);\r\n        x.s = -1;\r\n      } else {\r\n        if (i === 43) v = v.slice(1);  // plus sign\r\n        x.s = 1;\r\n      }\r\n\r\n      return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n    }\r\n\r\n    if (t === 'bigint') {\r\n      if (v < 0) {\r\n        v = -v;\r\n        x.s = -1;\r\n      } else {\r\n        x.s = 1;\r\n      }\r\n\r\n      return parseDecimal(x, v.toString());\r\n    }\r\n\r\n    throw Error(invalidArgument + v);\r\n  }\r\n\r\n  Decimal.prototype = P;\r\n\r\n  Decimal.ROUND_UP = 0;\r\n  Decimal.ROUND_DOWN = 1;\r\n  Decimal.ROUND_CEIL = 2;\r\n  Decimal.ROUND_FLOOR = 3;\r\n  Decimal.ROUND_HALF_UP = 4;\r\n  Decimal.ROUND_HALF_DOWN = 5;\r\n  Decimal.ROUND_HALF_EVEN = 6;\r\n  Decimal.ROUND_HALF_CEIL = 7;\r\n  Decimal.ROUND_HALF_FLOOR = 8;\r\n  Decimal.EUCLID = 9;\r\n\r\n  Decimal.config = Decimal.set = config;\r\n  Decimal.clone = clone;\r\n  Decimal.isDecimal = isDecimalInstance;\r\n\r\n  Decimal.abs = abs;\r\n  Decimal.acos = acos;\r\n  Decimal.acosh = acosh;        // ES6\r\n  Decimal.add = add;\r\n  Decimal.asin = asin;\r\n  Decimal.asinh = asinh;        // ES6\r\n  Decimal.atan = atan;\r\n  Decimal.atanh = atanh;        // ES6\r\n  Decimal.atan2 = atan2;\r\n  Decimal.cbrt = cbrt;          // ES6\r\n  Decimal.ceil = ceil;\r\n  Decimal.clamp = clamp;\r\n  Decimal.cos = cos;\r\n  Decimal.cosh = cosh;          // ES6\r\n  Decimal.div = div;\r\n  Decimal.exp = exp;\r\n  Decimal.floor = floor;\r\n  Decimal.hypot = hypot;        // ES6\r\n  Decimal.ln = ln;\r\n  Decimal.log = log;\r\n  Decimal.log10 = log10;        // ES6\r\n  Decimal.log2 = log2;          // ES6\r\n  Decimal.max = max;\r\n  Decimal.min = min;\r\n  Decimal.mod = mod;\r\n  Decimal.mul = mul;\r\n  Decimal.pow = pow;\r\n  Decimal.random = random;\r\n  Decimal.round = round;\r\n  Decimal.sign = sign;          // ES6\r\n  Decimal.sin = sin;\r\n  Decimal.sinh = sinh;          // ES6\r\n  Decimal.sqrt = sqrt;\r\n  Decimal.sub = sub;\r\n  Decimal.sum = sum;\r\n  Decimal.tan = tan;\r\n  Decimal.tanh = tanh;          // ES6\r\n  Decimal.trunc = trunc;        // ES6\r\n\r\n  if (obj === void 0) obj = {};\r\n  if (obj) {\r\n    if (obj.defaults !== true) {\r\n      ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n      for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n    }\r\n  }\r\n\r\n  Decimal.config(obj);\r\n\r\n  return Decimal;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction div(x, y) {\r\n  return new this(x).div(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The power to which to raise the base of the natural log.\r\n *\r\n */\r\nfunction exp(x) {\r\n  return new this(x).exp();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction floor(x) {\r\n  return finalise(x = new this(x), x.e + 1, 3);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction hypot() {\r\n  var i, n,\r\n    t = new this(0);\r\n\r\n  external = false;\r\n\r\n  for (i = 0; i < arguments.length;) {\r\n    n = new this(arguments[i++]);\r\n    if (!n.d) {\r\n      if (n.s) {\r\n        external = true;\r\n        return new this(1 / 0);\r\n      }\r\n      t = n;\r\n    } else if (t.d) {\r\n      t = t.plus(n.times(n));\r\n    }\r\n  }\r\n\r\n  external = true;\r\n\r\n  return t.sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n *\r\n */\r\nfunction isDecimalInstance(obj) {\r\n  return obj instanceof Decimal || obj && obj.toStringTag === tag || false;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction ln(x) {\r\n  return new this(x).ln();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * log[y](x)\r\n *\r\n * x {number|string|bigint|Decimal} The argument of the logarithm.\r\n * y {number|string|bigint|Decimal} The base of the logarithm.\r\n *\r\n */\r\nfunction log(x, y) {\r\n  return new this(x).log(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log2(x) {\r\n  return new this(x).log(2);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction log10(x) {\r\n  return new this(x).log(10);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction max() {\r\n  return maxOrMin(this, arguments, -1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction min() {\r\n  return maxOrMin(this, arguments, 1);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mod(x, y) {\r\n  return new this(x).mod(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction mul(x, y) {\r\n  return new this(x).mul(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} The base.\r\n * y {number|string|bigint|Decimal} The exponent.\r\n *\r\n */\r\nfunction pow(x, y) {\r\n  return new this(x).pow(y);\r\n}\r\n\r\n\r\n/*\r\n * Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n *\r\n * [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n *\r\n */\r\nfunction random(sd) {\r\n  var d, e, k, n,\r\n    i = 0,\r\n    r = new this(1),\r\n    rd = [];\r\n\r\n  if (sd === void 0) sd = this.precision;\r\n  else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n  k = Math.ceil(sd / LOG_BASE);\r\n\r\n  if (!this.crypto) {\r\n    for (; i < k;) rd[i++] = Math.random() * 1e7 | 0;\r\n\r\n  // Browsers supporting crypto.getRandomValues.\r\n  } else if (crypto.getRandomValues) {\r\n    d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n    for (; i < k;) {\r\n      n = d[i];\r\n\r\n      // 0 <= n < 4294967296\r\n      // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n      if (n >= 4.29e9) {\r\n        d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n      } else {\r\n\r\n        // 0 <= n <= 4289999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd[i++] = n % 1e7;\r\n      }\r\n    }\r\n\r\n  // Node.js supporting crypto.randomBytes.\r\n  } else if (crypto.randomBytes) {\r\n\r\n    // buffer\r\n    d = crypto.randomBytes(k *= 4);\r\n\r\n    for (; i < k;) {\r\n\r\n      // 0 <= n < 2147483648\r\n      n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n      // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n      if (n >= 2.14e9) {\r\n        crypto.randomBytes(4).copy(d, i);\r\n      } else {\r\n\r\n        // 0 <= n <= 2139999999\r\n        // 0 <= (n % 1e7) <= 9999999\r\n        rd.push(n % 1e7);\r\n        i += 4;\r\n      }\r\n    }\r\n\r\n    i = k / 4;\r\n  } else {\r\n    throw Error(cryptoUnavailable);\r\n  }\r\n\r\n  k = rd[--i];\r\n  sd %= LOG_BASE;\r\n\r\n  // Convert trailing digits to zeros according to sd.\r\n  if (k && sd) {\r\n    n = mathpow(10, LOG_BASE - sd);\r\n    rd[i] = (k / n | 0) * n;\r\n  }\r\n\r\n  // Remove trailing words which are zero.\r\n  for (; rd[i] === 0; i--) rd.pop();\r\n\r\n  // Zero?\r\n  if (i < 0) {\r\n    e = 0;\r\n    rd = [0];\r\n  } else {\r\n    e = -1;\r\n\r\n    // Remove leading words which are zero and adjust exponent accordingly.\r\n    for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n    // Count the digits of the first word of rd to determine leading zeros.\r\n    for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n    // Adjust the exponent for leading zeros of the first word of rd.\r\n    if (k < LOG_BASE) e -= LOG_BASE - k;\r\n  }\r\n\r\n  r.e = e;\r\n  r.d = rd;\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n *\r\n * To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction round(x) {\r\n  return finalise(x = new this(x), x.e + 1, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return\r\n *   1    if x > 0,\r\n *  -1    if x < 0,\r\n *   0    if x is 0,\r\n *  -0    if x is -0,\r\n *   NaN  otherwise\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sign(x) {\r\n  x = new this(x);\r\n  return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s || NaN;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sin(x) {\r\n  return new this(x).sin();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction sinh(x) {\r\n  return new this(x).sinh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sqrt(x) {\r\n  return new this(x).sqrt();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n * y {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sub(x, y) {\r\n  return new this(x).sub(y);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * Only the result is rounded, not the intermediate calculations.\r\n *\r\n * arguments {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction sum() {\r\n  var i = 0,\r\n    args = arguments,\r\n    x = new this(args[i]);\r\n\r\n  external = false;\r\n  for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n  external = true;\r\n\r\n  return finalise(x, this.precision, this.rounding);\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tan(x) {\r\n  return new this(x).tan();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|bigint|Decimal} A value in radians.\r\n *\r\n */\r\nfunction tanh(x) {\r\n  return new this(x).tanh();\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is `x` truncated to an integer.\r\n *\r\n * x {number|string|bigint|Decimal}\r\n *\r\n */\r\nfunction trunc(x) {\r\n  return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'BigNumber'\nconst dependencies = ['?on', 'config']\n\nexport const createBigNumberClass = /* #__PURE__ */ factory(name, dependencies, ({ on, config }) => {\n  const BigNumber = Decimal.clone({ precision: config.precision, modulo: Decimal.EUCLID })\n  BigNumber.prototype = Object.create(BigNumber.prototype)\n\n  /**\n   * Attach type information\n   */\n  BigNumber.prototype.type = 'BigNumber'\n  BigNumber.prototype.isBigNumber = true\n\n  /**\n   * Get a JSON representation of a BigNumber containing\n   * type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   */\n  BigNumber.prototype.toJSON = function () {\n    return {\n      mathjs: 'BigNumber',\n      value: this.toString()\n    }\n  }\n\n  /**\n   * Instantiate a BigNumber from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"BigNumber\", \"value\": \"0.2\"}`\n   * @return {BigNumber}\n   */\n  BigNumber.fromJSON = function (json) {\n    return new BigNumber(json.value)\n  }\n\n  if (on) {\n    // listen for changed in the configuration, automatically apply changed precision\n    on('config', function (curr, prev) {\n      if (curr.precision !== prev.precision) {\n        BigNumber.config({ precision: curr.precision })\n      }\n    })\n  }\n\n  return BigNumber\n}, { isClass: true })\n","'use strict';\n\n/**\n *\n * This class allows the manipulation of complex numbers.\n * You can pass a complex number in different formats. Either as object, double, string or two integer parameters.\n *\n * Object form\n * { re: <real>, im: <imaginary> }\n * { arg: <angle>, abs: <radius> }\n * { phi: <angle>, r: <radius> }\n *\n * Array / Vector form\n * [ real, imaginary ]\n *\n * Double form\n * 99.3 - Single double value\n *\n * String form\n * '23.1337' - Simple real number\n * '15+3i' - a simple complex number\n * '3-i' - a simple complex number\n *\n * Example:\n *\n * const c = new Complex('99.3+8i');\n * c.mul({r: 3, i: 9}).div(4.9).sub(3, 2);\n *\n */\n\n\nconst cosh = Math.cosh || function (x) {\n  return Math.abs(x) < 1e-9 ? 1 - x : (Math.exp(x) + Math.exp(-x)) * 0.5;\n};\n\nconst sinh = Math.sinh || function (x) {\n  return Math.abs(x) < 1e-9 ? x : (Math.exp(x) - Math.exp(-x)) * 0.5;\n};\n\n/**\n * Calculates cos(x) - 1 using Taylor series if x is small (-¼π ≤ x ≤ ¼π).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\nconst cosm1 = function (x) {\n\n  const b = Math.PI / 4;\n  if (-b > x || x > b) {\n    return Math.cos(x) - 1.0;\n  }\n\n  /* Calculate horner form of polynomial of taylor series in Q\n  let fac = 1, alt = 1, pol = {};\n  for (let i = 0; i <= 16; i++) {\n    fac*= i || 1;\n    if (i % 2 == 0) {\n      pol[i] = new Fraction(1, alt * fac);\n      alt = -alt;\n    }\n  }\n  console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1\n  */\n\n  const xx = x * x;\n  return xx * (\n    xx * (\n      xx * (\n        xx * (\n          xx * (\n            xx * (\n              xx * (\n                xx / 20922789888000\n                - 1 / 87178291200)\n              + 1 / 479001600)\n            - 1 / 3628800)\n          + 1 / 40320)\n        - 1 / 720)\n      + 1 / 24)\n    - 1 / 2);\n};\n\nconst hypot = function (x, y) {\n\n  x = Math.abs(x);\n  y = Math.abs(y);\n\n  // Ensure `x` is the larger value\n  if (x < y) [x, y] = [y, x];\n\n  // If both are below the threshold, use straightforward Pythagoras\n  if (x < 1e8) return Math.sqrt(x * x + y * y);\n\n  // For larger values, scale to avoid overflow\n  y /= x;\n  return x * Math.sqrt(1 + y * y);\n};\n\nconst parser_exit = function () {\n  throw SyntaxError('Invalid Param');\n};\n\n/**\n * Calculates log(sqrt(a^2+b^2)) in a way to avoid overflows\n *\n * @param {number} a\n * @param {number} b\n * @returns {number}\n */\nfunction logHypot(a, b) {\n\n  const _a = Math.abs(a);\n  const _b = Math.abs(b);\n\n  if (a === 0) {\n    return Math.log(_b);\n  }\n\n  if (b === 0) {\n    return Math.log(_a);\n  }\n\n  if (_a < 3000 && _b < 3000) {\n    return Math.log(a * a + b * b) * 0.5;\n  }\n\n  /* I got 4 ideas to compute this property without overflow:\n   *\n   * Testing 1000000 times with random samples for a,b ∈ [1, 1000000000] against a big decimal library to get an error estimate\n   *\n   * 1. Only eliminate the square root: (OVERALL ERROR: 3.9122483030951116e-11)\n\n   Math.log(a * a + b * b) / 2\n\n   *\n   *\n   * 2. Try to use the non-overflowing pythagoras: (OVERALL ERROR: 8.889760039210159e-10)\n\n   const fn = function(a, b) {\n   a = Math.abs(a);\n   b = Math.abs(b);\n   let t = Math.min(a, b);\n   a = Math.max(a, b);\n   t = t / a;\n\n   return Math.log(a) + Math.log(1 + t * t) / 2;\n   };\n\n   * 3. Abuse the identity cos(atan(y/x) = x / sqrt(x^2+y^2): (OVERALL ERROR: 3.4780178737037204e-10)\n\n   Math.log(a / Math.cos(Math.atan2(b, a)))\n\n   * 4. Use 3. and apply log rules: (OVERALL ERROR: 1.2014087502620896e-9)\n\n   Math.log(a) - Math.log(Math.cos(Math.atan2(b, a)))\n\n   */\n\n  a = a * 0.5;\n  b = b * 0.5;\n\n  return 0.5 * Math.log(a * a + b * b) + Math.LN2;\n}\n\nconst P = { 're': 0, 'im': 0 };\nconst parse = function (a, b) {\n\n  const z = P;\n\n  if (a === undefined || a === null) {\n    z['re'] =\n      z['im'] = 0;\n  } else if (b !== undefined) {\n    z['re'] = a;\n    z['im'] = b;\n  } else\n    switch (typeof a) {\n\n      case 'object':\n\n        if ('im' in a && 're' in a) {\n          z['re'] = a['re'];\n          z['im'] = a['im'];\n        } else if ('abs' in a && 'arg' in a) {\n          if (!isFinite(a['abs']) && isFinite(a['arg'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['abs'] * Math.cos(a['arg']);\n          z['im'] = a['abs'] * Math.sin(a['arg']);\n        } else if ('r' in a && 'phi' in a) {\n          if (!isFinite(a['r']) && isFinite(a['phi'])) {\n            return Complex['INFINITY'];\n          }\n          z['re'] = a['r'] * Math.cos(a['phi']);\n          z['im'] = a['r'] * Math.sin(a['phi']);\n        } else if (a.length === 2) { // Quick array check\n          z['re'] = a[0];\n          z['im'] = a[1];\n        } else {\n          parser_exit();\n        }\n        break;\n\n      case 'string':\n\n        z['im'] = /* void */\n        z['re'] = 0;\n\n        const tokens = a.replace(/_/g, '')\n          .match(/\\d+\\.?\\d*e[+-]?\\d+|\\d+\\.?\\d*|\\.\\d+|./g);\n        let plus = 1;\n        let minus = 0;\n\n        if (tokens === null) {\n          parser_exit();\n        }\n\n        for (let i = 0; i < tokens.length; i++) {\n\n          const c = tokens[i];\n\n          if (c === ' ' || c === '\\t' || c === '\\n') {\n            /* void */\n          } else if (c === '+') {\n            plus++;\n          } else if (c === '-') {\n            minus++;\n          } else if (c === 'i' || c === 'I') {\n\n            if (plus + minus === 0) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] !== ' ' && !isNaN(tokens[i + 1])) {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + tokens[i + 1]);\n              i++;\n            } else {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + '1');\n            }\n            plus = minus = 0;\n\n          } else {\n\n            if (plus + minus === 0 || isNaN(c)) {\n              parser_exit();\n            }\n\n            if (tokens[i + 1] === 'i' || tokens[i + 1] === 'I') {\n              z['im'] += parseFloat((minus % 2 ? '-' : '') + c);\n              i++;\n            } else {\n              z['re'] += parseFloat((minus % 2 ? '-' : '') + c);\n            }\n            plus = minus = 0;\n          }\n        }\n\n        // Still something on the stack\n        if (plus + minus > 0) {\n          parser_exit();\n        }\n        break;\n\n      case 'number':\n        z['im'] = 0;\n        z['re'] = a;\n        break;\n\n      default:\n        parser_exit();\n    }\n\n  if (isNaN(z['re']) || isNaN(z['im'])) {\n    // If a calculation is NaN, we treat it as NaN and don't throw\n    //parser_exit();\n  }\n\n  return z;\n};\n\n/**\n * @constructor\n * @returns {Complex}\n */\nfunction Complex(a, b) {\n\n  if (!(this instanceof Complex)) {\n    return new Complex(a, b);\n  }\n\n  const z = parse(a, b);\n\n  this['re'] = z['re'];\n  this['im'] = z['im'];\n}\n\nComplex.prototype = {\n\n  're': 0,\n  'im': 0,\n\n  /**\n   * Calculates the sign of a complex number, which is a normalized complex\n   *\n   * @returns {Complex}\n   */\n  'sign': function () {\n\n    const abs = hypot(this['re'], this['im']);\n\n    return new Complex(\n      this['re'] / abs,\n      this['im'] / abs);\n  },\n\n  /**\n   * Adds two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'add': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity + Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity + z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] + z['re'],\n      this['im'] + z['im']);\n  },\n\n  /**\n   * Subtracts two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'sub': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n\n    if (tInfin || zInfin) {\n\n      if (tInfin && zInfin) {\n        // Infinity - Infinity = NaN\n        return Complex['NAN'];\n      }\n      // Infinity - z = Infinity { where z != Infinity }\n      return Complex['INFINITY'];\n    }\n\n    return new Complex(\n      this['re'] - z['re'],\n      this['im'] - z['im']);\n  },\n\n  /**\n   * Multiplies two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'mul': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // Infinity * 0 = NaN\n    if (tInfin && zIsZero || zInfin && tIsZero) {\n      return Complex['NAN'];\n    }\n\n    // Infinity * z = Infinity { where z != 0 }\n    if (tInfin || zInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // Shortcut for real values\n    if (z['im'] === 0 && this['im'] === 0) {\n      return new Complex(this['re'] * z['re'], 0);\n    }\n\n    return new Complex(\n      this['re'] * z['re'] - this['im'] * z['im'],\n      this['re'] * z['im'] + this['im'] * z['re']);\n  },\n\n  /**\n   * Divides two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'div': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tInfin = this['isInfinite']();\n    const zInfin = !(isFinite(z['re']) && isFinite(z['im']));\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    // 0 / 0 = NaN and Infinity / Infinity = NaN\n    if (tIsZero && zIsZero || tInfin && zInfin) {\n      return Complex['NAN'];\n    }\n\n    // Infinity / 0 = Infinity\n    if (zIsZero || tInfin) {\n      return Complex['INFINITY'];\n    }\n\n    // 0 / Infinity = 0\n    if (tIsZero || zInfin) {\n      return Complex['ZERO'];\n    }\n\n    if (0 === z['im']) {\n      // Divisor is real\n      return new Complex(this['re'] / z['re'], this['im'] / z['re']);\n    }\n\n    if (Math.abs(z['re']) < Math.abs(z['im'])) {\n\n      const x = z['re'] / z['im'];\n      const t = z['re'] * x + z['im'];\n\n      return new Complex(\n        (this['re'] * x + this['im']) / t,\n        (this['im'] * x - this['re']) / t);\n\n    } else {\n\n      const x = z['im'] / z['re'];\n      const t = z['im'] * x + z['re'];\n\n      return new Complex(\n        (this['re'] + this['im'] * x) / t,\n        (this['im'] - this['re'] * x) / t);\n    }\n  },\n\n  /**\n   * Calculate the power of two complex numbers\n   *\n   * @returns {Complex}\n   */\n  'pow': function (a, b) {\n\n    const z = parse(a, b);\n\n    const tIsZero = this['re'] === 0 && this['im'] === 0;\n    const zIsZero = z['re'] === 0 && z['im'] === 0;\n\n    if (zIsZero) {\n      return Complex['ONE'];\n    }\n\n    // If the exponent is real\n    if (z['im'] === 0) {\n\n      if (this['im'] === 0 && this['re'] > 0) {\n\n        return new Complex(Math.pow(this['re'], z['re']), 0);\n\n      } else if (this['re'] === 0) { // If base is fully imaginary\n\n        switch ((z['re'] % 4 + 4) % 4) {\n          case 0:\n            return new Complex(Math.pow(this['im'], z['re']), 0);\n          case 1:\n            return new Complex(0, Math.pow(this['im'], z['re']));\n          case 2:\n            return new Complex(-Math.pow(this['im'], z['re']), 0);\n          case 3:\n            return new Complex(0, -Math.pow(this['im'], z['re']));\n        }\n      }\n    }\n\n    /* I couldn't find a good formula, so here is a derivation and optimization\n     *\n     * z_1^z_2 = (a + bi)^(c + di)\n     *         = exp((c + di) * log(a + bi)\n     *         = pow(a^2 + b^2, (c + di) / 2) * exp(i(c + di)atan2(b, a))\n     * =>...\n     * Re = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * cos(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     * Im = (pow(a^2 + b^2, c / 2) * exp(-d * atan2(b, a))) * sin(d * log(a^2 + b^2) / 2 + c * atan2(b, a))\n     *\n     * =>...\n     * Re = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * cos(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     * Im = exp(c * log(sqrt(a^2 + b^2)) - d * atan2(b, a)) * sin(d * log(sqrt(a^2 + b^2)) + c * atan2(b, a))\n     *\n     * =>\n     * Re = exp(c * logsq2 - d * arg(z_1)) * cos(d * logsq2 + c * arg(z_1))\n     * Im = exp(c * logsq2 - d * arg(z_1)) * sin(d * logsq2 + c * arg(z_1))\n     *\n     */\n\n    if (tIsZero && z['re'] > 0) { // Same behavior as Wolframalpha, Zero if real part is zero\n      return Complex['ZERO'];\n    }\n\n    const arg = Math.atan2(this['im'], this['re']);\n    const loh = logHypot(this['re'], this['im']);\n\n    let re = Math.exp(z['re'] * loh - z['im'] * arg);\n    let im = z['im'] * loh + z['re'] * arg;\n    return new Complex(\n      re * Math.cos(im),\n      re * Math.sin(im));\n  },\n\n  /**\n   * Calculate the complex square root\n   *\n   * @returns {Complex}\n   */\n  'sqrt': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      // Real number case\n      if (a >= 0) {\n        return new Complex(Math.sqrt(a), 0);\n      } else {\n        return new Complex(0, Math.sqrt(-a));\n      }\n    }\n\n    const r = hypot(a, b);\n\n    let re = Math.sqrt(0.5 * (r + Math.abs(a))); // sqrt(2x) / 2 = sqrt(x / 2)\n    let im = Math.abs(b) / (2 * re);\n\n    if (a >= 0) {\n      return new Complex(re, b < 0 ? -im : im);\n    } else {\n      return new Complex(im, b < 0 ? -re : re);\n    }\n  },\n\n  /**\n   * Calculate the complex exponent\n   *\n   * @returns {Complex}\n   */\n  'exp': function () {\n\n    const er = Math.exp(this['re']);\n\n    if (this['im'] === 0) {\n      return new Complex(er, 0);\n    }\n    return new Complex(\n      er * Math.cos(this['im']),\n      er * Math.sin(this['im']));\n  },\n\n  /**\n   * Calculate the complex exponent and subtracts one.\n   *\n   * This may be more accurate than `Complex(x).exp().sub(1)` if\n   * `x` is small.\n   *\n   * @returns {Complex}\n   */\n  'expm1': function () {\n\n    /**\n     * exp(a + i*b) - 1\n     = exp(a) * (cos(b) + j*sin(b)) - 1\n     = expm1(a)*cos(b) + cosm1(b) + j*exp(a)*sin(b)\n     */\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.expm1(a) * Math.cos(b) + cosm1(b),\n      Math.exp(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the natural log\n   *\n   * @returns {Complex}\n   */\n  'log': function () {\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0 && a > 0) {\n      return new Complex(Math.log(a), 0);\n    }\n\n    return new Complex(\n      logHypot(a, b),\n      Math.atan2(b, a));\n  },\n\n  /**\n   * Calculate the magnitude of the complex number\n   *\n   * @returns {number}\n   */\n  'abs': function () {\n\n    return hypot(this['re'], this['im']);\n  },\n\n  /**\n   * Calculate the angle of the complex number\n   *\n   * @returns {number}\n   */\n  'arg': function () {\n\n    return Math.atan2(this['im'], this['re']);\n  },\n\n  /**\n   * Calculate the sine of the complex number\n   *\n   * @returns {Complex}\n   */\n  'sin': function () {\n\n    // sin(z) = ( e^iz - e^-iz ) / 2i \n    //        = sin(a)cosh(b) + i cos(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.sin(a) * cosh(b),\n      Math.cos(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the cosine\n   *\n   * @returns {Complex}\n   */\n  'cos': function () {\n\n    // cos(z) = ( e^iz + e^-iz ) / 2 \n    //        = cos(a)cosh(b) - i sin(a)sinh(b)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      Math.cos(a) * cosh(b),\n      -Math.sin(a) * sinh(b));\n  },\n\n  /**\n   * Calculate the tangent\n   *\n   * @returns {Complex}\n   */\n  'tan': function () {\n\n    // tan(z) = sin(z) / cos(z) \n    //        = ( e^iz - e^-iz ) / ( i( e^iz + e^-iz ) )\n    //        = ( e^2iz - 1 ) / i( e^2iz + 1 )\n    //        = ( sin(2a) + i sinh(2b) ) / ( cos(2a) + cosh(2b) )\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) + cosh(b);\n\n    return new Complex(\n      Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cotangent\n   *\n   * @returns {Complex}\n   */\n  'cot': function () {\n\n    // cot(c) = i(e^(ci) + e^(-ci)) / (e^(ci) - e^(-ci))\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = Math.cos(a) - cosh(b);\n\n    return new Complex(\n      -Math.sin(a) / d,\n      sinh(b) / d);\n  },\n\n  /**\n   * Calculate the secant\n   *\n   * @returns {Complex}\n   */\n  'sec': function () {\n\n    // sec(c) = 2 / (e^(ci) + e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) + 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.cos(a) * cosh(b) / d,\n      Math.sin(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the cosecans\n   *\n   * @returns {Complex}\n   */\n  'csc': function () {\n\n    // csc(c) = 2i / (e^(ci) - e^(-ci))\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = 0.5 * cosh(2 * b) - 0.5 * Math.cos(2 * a);\n\n    return new Complex(\n      Math.sin(a) * cosh(b) / d,\n      -Math.cos(a) * sinh(b) / d);\n  },\n\n  /**\n   * Calculate the complex arcus sinus\n   *\n   * @returns {Complex}\n   */\n  'asin': function () {\n\n    // asin(c) = -i * log(ci + sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(t2['im'], -t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cosinus\n   *\n   * @returns {Complex}\n   */\n  'acos': function () {\n\n    // acos(c) = i * log(c - i * sqrt(1 - c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const t1 = new Complex(\n      b * b - a * a + 1,\n      -2 * a * b)['sqrt']();\n\n    const t2 = new Complex(\n      t1['re'] - b,\n      t1['im'] + a)['log']();\n\n    return new Complex(Math.PI / 2 - t2['im'], t2['re']);\n  },\n\n  /**\n   * Calculate the complex arcus tangent\n   *\n   * @returns {Complex}\n   */\n  'atan': function () {\n\n    // atan(c) = i / 2 log((i + x) / (i - x))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0) {\n\n      if (b === 1) {\n        return new Complex(0, Infinity);\n      }\n\n      if (b === -1) {\n        return new Complex(0, -Infinity);\n      }\n    }\n\n    const d = a * a + (1.0 - b) * (1.0 - b);\n\n    const t1 = new Complex(\n      (1 - b * b - a * a) / d,\n      -2 * a / d).log();\n\n    return new Complex(-0.5 * t1['im'], 0.5 * t1['re']);\n  },\n\n  /**\n   * Calculate the complex arcus cotangent\n   *\n   * @returns {Complex}\n   */\n  'acot': function () {\n\n    // acot(c) = i / 2 log((c - i) / (c + i))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n      return new Complex(Math.atan2(1, a), 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atan()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atan();\n  },\n\n  /**\n   * Calculate the complex arcus secant\n   *\n   * @returns {Complex}\n   */\n  'asec': function () {\n\n    // asec(c) = -i * log(1 / c + sqrt(1 - i / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acos()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acos();\n  },\n\n  /**\n   * Calculate the complex arcus cosecans\n   *\n   * @returns {Complex}\n   */\n  'acsc': function () {\n\n    // acsc(c) = -i * log(i / c + sqrt(1 - 1 / c^2))\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(Math.PI / 2, Infinity);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asin()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asin();\n  },\n\n  /**\n   * Calculate the complex sinh\n   *\n   * @returns {Complex}\n   */\n  'sinh': function () {\n\n    // sinh(c) = (e^c - e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      sinh(a) * Math.cos(b),\n      cosh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex cosh\n   *\n   * @returns {Complex}\n   */\n  'cosh': function () {\n\n    // cosh(c) = (e^c + e^-c) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    return new Complex(\n      cosh(a) * Math.cos(b),\n      sinh(a) * Math.sin(b));\n  },\n\n  /**\n   * Calculate the complex tanh\n   *\n   * @returns {Complex}\n   */\n  'tanh': function () {\n\n    // tanh(c) = (e^c - e^-c) / (e^c + e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) + Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex coth\n   *\n   * @returns {Complex}\n   */\n  'coth': function () {\n\n    // coth(c) = (e^c + e^-c) / (e^c - e^-c)\n\n    const a = 2 * this['re'];\n    const b = 2 * this['im'];\n    const d = cosh(a) - Math.cos(b);\n\n    return new Complex(\n      sinh(a) / d,\n      -Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex coth\n   *\n   * @returns {Complex}\n   */\n  'csch': function () {\n\n    // csch(c) = 2 / (e^c - e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) - cosh(2 * a);\n\n    return new Complex(\n      -2 * sinh(a) * Math.cos(b) / d,\n      2 * cosh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex sech\n   *\n   * @returns {Complex}\n   */\n  'sech': function () {\n\n    // sech(c) = 2 / (e^c + e^-c)\n\n    const a = this['re'];\n    const b = this['im'];\n    const d = Math.cos(2 * b) + cosh(2 * a);\n\n    return new Complex(\n      2 * cosh(a) * Math.cos(b) / d,\n      -2 * sinh(a) * Math.sin(b) / d);\n  },\n\n  /**\n   * Calculate the complex asinh\n   *\n   * @returns {Complex}\n   */\n  'asinh': function () {\n\n    // asinh(c) = log(c + sqrt(c^2 + 1))\n\n    let tmp = this['im'];\n    this['im'] = -this['re'];\n    this['re'] = tmp;\n    const res = this['asin']();\n\n    this['re'] = -this['im'];\n    this['im'] = tmp;\n    tmp = res['re'];\n\n    res['re'] = -res['im'];\n    res['im'] = tmp;\n    return res;\n  },\n\n  /**\n   * Calculate the complex acosh\n   *\n   * @returns {Complex}\n   */\n  'acosh': function () {\n\n    // acosh(c) = log(c + sqrt(c^2 - 1))\n\n    const res = this['acos']();\n    if (res['im'] <= 0) {\n      const tmp = res['re'];\n      res['re'] = -res['im'];\n      res['im'] = tmp;\n    } else {\n      const tmp = res['im'];\n      res['im'] = -res['re'];\n      res['re'] = tmp;\n    }\n    return res;\n  },\n\n  /**\n   * Calculate the complex atanh\n   *\n   * @returns {Complex}\n   */\n  'atanh': function () {\n\n    // atanh(c) = log((1+c) / (1-c)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const noIM = a > 1 && b === 0;\n    const oneMinus = 1 - a;\n    const onePlus = 1 + a;\n    const d = oneMinus * oneMinus + b * b;\n\n    const x = (d !== 0)\n      ? new Complex(\n        (onePlus * oneMinus - b * b) / d,\n        (b * oneMinus + onePlus * b) / d)\n      : new Complex(\n        (a !== -1) ? (a / 0) : 0,\n        (b !== 0) ? (b / 0) : 0);\n\n    const temp = x['re'];\n    x['re'] = logHypot(x['re'], x['im']) / 2;\n    x['im'] = Math.atan2(x['im'], temp) / 2;\n    if (noIM) {\n      x['im'] = -x['im'];\n    }\n    return x;\n  },\n\n  /**\n   * Calculate the complex acoth\n   *\n   * @returns {Complex}\n   */\n  'acoth': function () {\n\n    // acoth(c) = log((c+1) / (c-1)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Math.PI / 2);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atanh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atanh();\n  },\n\n  /**\n   * Calculate the complex acsch\n   *\n   * @returns {Complex}\n   */\n  'acsch': function () {\n\n    // acsch(c) = log((1+sqrt(1+c^2))/c)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      return new Complex(\n        (a !== 0)\n          ? Math.log(a + Math.sqrt(a * a + 1))\n          : Infinity, 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asinh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asinh();\n  },\n\n  /**\n   * Calculate the complex asech\n   *\n   * @returns {Complex}\n   */\n  'asech': function () {\n\n    // asech(c) = log((1+sqrt(1-c^2))/c)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acosh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acosh();\n  },\n\n  /**\n   * Calculate the complex inverse 1/z\n   *\n   * @returns {Complex}\n   */\n  'inverse': function () {\n\n    // 1 / 0 = Infinity and 1 / Infinity = 0\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    if (this['isInfinite']()) {\n      return Complex['ZERO'];\n    }\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const d = a * a + b * b;\n\n    return new Complex(a / d, -b / d);\n  },\n\n  /**\n   * Returns the complex conjugate\n   *\n   * @returns {Complex}\n   */\n  'conjugate': function () {\n\n    return new Complex(this['re'], -this['im']);\n  },\n\n  /**\n   * Gets the negated complex number\n   *\n   * @returns {Complex}\n   */\n  'neg': function () {\n\n    return new Complex(-this['re'], -this['im']);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'ceil': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.ceil(this['re'] * places) / places,\n      Math.ceil(this['im'] * places) / places);\n  },\n\n  /**\n   * Floors the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'floor': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.floor(this['re'] * places) / places,\n      Math.floor(this['im'] * places) / places);\n  },\n\n  /**\n   * Ceils the actual complex number\n   *\n   * @returns {Complex}\n   */\n  'round': function (places) {\n\n    places = Math.pow(10, places || 0);\n\n    return new Complex(\n      Math.round(this['re'] * places) / places,\n      Math.round(this['im'] * places) / places);\n  },\n\n  /**\n   * Compares two complex numbers\n   *\n   * **Note:** new Complex(Infinity).equals(Infinity) === false\n   *\n   * @returns {boolean}\n   */\n  'equals': function (a, b) {\n\n    const z = parse(a, b);\n\n    return Math.abs(z['re'] - this['re']) <= Complex['EPSILON'] &&\n      Math.abs(z['im'] - this['im']) <= Complex['EPSILON'];\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * @returns {Complex}\n   */\n  'clone': function () {\n\n    return new Complex(this['re'], this['im']);\n  },\n\n  /**\n   * Gets a string of the actual complex number\n   *\n   * @returns {string}\n   */\n  'toString': function () {\n\n    let a = this['re'];\n    let b = this['im'];\n    let ret = \"\";\n\n    if (this['isNaN']()) {\n      return 'NaN';\n    }\n\n    if (this['isInfinite']()) {\n      return 'Infinity';\n    }\n\n    if (Math.abs(a) < Complex['EPSILON']) {\n      a = 0;\n    }\n\n    if (Math.abs(b) < Complex['EPSILON']) {\n      b = 0;\n    }\n\n    // If is real number\n    if (b === 0) {\n      return ret + a;\n    }\n\n    if (a !== 0) {\n      ret += a;\n      ret += \" \";\n      if (b < 0) {\n        b = -b;\n        ret += \"-\";\n      } else {\n        ret += \"+\";\n      }\n      ret += \" \";\n    } else if (b < 0) {\n      b = -b;\n      ret += \"-\";\n    }\n\n    if (1 !== b) { // b is the absolute imaginary part\n      ret += b;\n    }\n    return ret + \"i\";\n  },\n\n  /**\n   * Returns the actual number as a vector\n   *\n   * @returns {Array}\n   */\n  'toVector': function () {\n\n    return [this['re'], this['im']];\n  },\n\n  /**\n   * Returns the actual real value of the current object\n   *\n   * @returns {number|null}\n   */\n  'valueOf': function () {\n\n    if (this['im'] === 0) {\n      return this['re'];\n    }\n    return null;\n  },\n\n  /**\n   * Determines whether a complex number is not on the Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isNaN': function () {\n    return isNaN(this['re']) || isNaN(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the zero pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isZero': function () {\n    return this['im'] === 0 && this['re'] === 0;\n  },\n\n  /**\n   * Determines whether a complex number is not at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isFinite': function () {\n    return isFinite(this['re']) && isFinite(this['im']);\n  },\n\n  /**\n   * Determines whether or not a complex number is at the infinity pole of the\n   * Riemann sphere.\n   *\n   * @returns {boolean}\n   */\n  'isInfinite': function () {\n    return !this['isFinite']();\n  }\n};\n\nComplex['ZERO'] = new Complex(0, 0);\nComplex['ONE'] = new Complex(1, 0);\nComplex['I'] = new Complex(0, 1);\nComplex['PI'] = new Complex(Math.PI, 0);\nComplex['E'] = new Complex(Math.E, 0);\nComplex['INFINITY'] = new Complex(Infinity, Infinity);\nComplex['NAN'] = new Complex(NaN, NaN);\nComplex['EPSILON'] = 1e-15;\nexport {\n  Complex as default, Complex\n};\n","import Complex from 'complex.js'\nimport { format } from '../../utils/number.js'\nimport { isNumber, isUnit } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Complex'\nconst dependencies = []\n\nexport const createComplexClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Complex, 'name', { value: 'Complex' })\n  Complex.prototype.constructor = Complex\n  Complex.prototype.type = 'Complex'\n  Complex.prototype.isComplex = true\n\n  /**\n   * Get a JSON representation of the complex number\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}`\n   */\n  Complex.prototype.toJSON = function () {\n    return {\n      mathjs: 'Complex',\n      re: this.re,\n      im: this.im\n    }\n  }\n\n  /*\n   * Return the value of the complex number in polar notation\n   * The angle phi will be set in the interval of [-pi, pi].\n   * @return {{r: number, phi: number}} Returns and object with properties r and phi.\n   */\n  Complex.prototype.toPolar = function () {\n    return {\n      r: this.abs(),\n      phi: this.arg()\n    }\n  }\n\n  /**\n   * Get a string representation of the complex number,\n   * with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string} str\n   */\n  Complex.prototype.format = function (options) {\n    let str = ''\n    let im = this.im\n    let re = this.re\n    const strRe = format(this.re, options)\n    const strIm = format(this.im, options)\n\n    // round either re or im when smaller than the configured precision\n    const precision = isNumber(options) ? options : options ? options.precision : null\n    if (precision !== null) {\n      const epsilon = Math.pow(10, -precision)\n      if (Math.abs(re / im) < epsilon) {\n        re = 0\n      }\n      if (Math.abs(im / re) < epsilon) {\n        im = 0\n      }\n    }\n\n    if (im === 0) {\n      // real value\n      str = strRe\n    } else if (re === 0) {\n      // purely complex value\n      if (im === 1) {\n        str = 'i'\n      } else if (im === -1) {\n        str = '-i'\n      } else {\n        str = strIm + 'i'\n      }\n    } else {\n      // complex value\n      if (im < 0) {\n        if (im === -1) {\n          str = strRe + ' - i'\n        } else {\n          str = strRe + ' - ' + strIm.substring(1) + 'i'\n        }\n      } else {\n        if (im === 1) {\n          str = strRe + ' + i'\n        } else {\n          str = strRe + ' + ' + strIm + 'i'\n        }\n      }\n    }\n    return str\n  }\n\n  /**\n   * Create a complex number from polar coordinates\n   *\n   * Usage:\n   *\n   *     Complex.fromPolar(r: number, phi: number) : Complex\n   *     Complex.fromPolar({r: number, phi: number}) : Complex\n   *\n   * @param {*} args...\n   * @return {Complex}\n   */\n  Complex.fromPolar = function (args) {\n    switch (arguments.length) {\n      case 1:\n      {\n        const arg = arguments[0]\n        if (typeof arg === 'object') {\n          return Complex(arg)\n        } else {\n          throw new TypeError('Input has to be an object with r and phi keys.')\n        }\n      }\n      case 2:\n      {\n        const r = arguments[0]\n        let phi = arguments[1]\n        if (isNumber(r)) {\n          if (isUnit(phi) && phi.hasBase('ANGLE')) {\n            // convert unit to a number in radians\n            phi = phi.toNumber('rad')\n          }\n\n          if (isNumber(phi)) {\n            return new Complex({ r, phi })\n          }\n\n          throw new TypeError('Phi is not a number nor an angle unit.')\n        } else {\n          throw new TypeError('Radius r is not a number.')\n        }\n      }\n\n      default:\n        throw new SyntaxError('Wrong number of arguments in function fromPolar')\n    }\n  }\n\n  Complex.prototype.valueOf = Complex.prototype.toString\n\n  /**\n   * Create a Complex number from a JSON object\n   * @param {Object} json  A JSON Object structured as\n   *                       {\"mathjs\": \"Complex\", \"re\": 2, \"im\": 3}\n   *                       All properties are optional, default values\n   *                       for `re` and `im` are 0.\n   * @return {Complex} Returns a new Complex number\n   */\n  Complex.fromJSON = function (json) {\n    return new Complex(json)\n  }\n\n  /**\n   * Compare two complex numbers, `a` and `b`:\n   *\n   * - Returns 1 when the real part of `a` is larger than the real part of `b`\n   * - Returns -1 when the real part of `a` is smaller than the real part of `b`\n   * - Returns 1 when the real parts are equal\n   *   and the imaginary part of `a` is larger than the imaginary part of `b`\n   * - Returns -1 when the real parts are equal\n   *   and the imaginary part of `a` is smaller than the imaginary part of `b`\n   * - Returns 0 when both real and imaginary parts are equal.\n   *\n   * @params {Complex} a\n   * @params {Complex} b\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  Complex.compare = function (a, b) {\n    if (a.re > b.re) { return 1 }\n    if (a.re < b.re) { return -1 }\n\n    if (a.im > b.im) { return 1 }\n    if (a.im < b.im) { return -1 }\n\n    return 0\n  }\n\n  return Complex\n}, { isClass: true })\n","'use strict';\n\n/**\n *\n * This class offers the possibility to calculate fractions.\n * You can pass a fraction in different formats. Either as array, as double, as string or as an integer.\n *\n * Array/Object form\n * [ 0 => <numerator>, 1 => <denominator> ]\n * { n => <numerator>, d => <denominator> }\n *\n * Integer form\n * - Single integer value as BigInt or Number\n *\n * Double form\n * - Single double value as Number\n *\n * String form\n * 123.456 - a simple double\n * 123/456 - a string fraction\n * 123.'456' - a double with repeating decimal places\n * 123.(456) - synonym\n * 123.45'6' - a double with repeating last place\n * 123.45(6) - synonym\n *\n * Example:\n * let f = new Fraction(\"9.4'31'\");\n * f.mul([-4, 3]).div(4.9);\n *\n */\n\n// Set Identity function to downgrade BigInt to Number if needed\nif (typeof BigInt === 'undefined') BigInt = function (n) { if (isNaN(n)) throw new Error(\"\"); return n; };\n\nconst C_ZERO = BigInt(0);\nconst C_ONE = BigInt(1);\nconst C_TWO = BigInt(2);\nconst C_FIVE = BigInt(5);\nconst C_TEN = BigInt(10);\n\n// Maximum search depth for cyclic rational numbers. 2000 should be more than enough.\n// Example: 1/7 = 0.(142857) has 6 repeating decimal places.\n// If MAX_CYCLE_LEN gets reduced, long cycles will not be detected and toString() only gets the first 10 digits\nconst MAX_CYCLE_LEN = 2000;\n\n// Parsed data to avoid calling \"new\" all the time\nconst P = {\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE\n};\n\nfunction assign(n, s) {\n\n  try {\n    n = BigInt(n);\n  } catch (e) {\n    throw InvalidParameter();\n  }\n  return n * s;\n}\n\nfunction trunc(x) {\n  return typeof x === 'bigint' ? x : Math.floor(x);\n}\n\n// Creates a new Fraction internally without the need of the bulky constructor\nfunction newFraction(n, d) {\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  const f = Object.create(Fraction.prototype);\n  f[\"s\"] = n < C_ZERO ? -C_ONE : C_ONE;\n\n  n = n < C_ZERO ? -n : n;\n\n  const a = gcd(n, d);\n\n  f[\"n\"] = n / a;\n  f[\"d\"] = d / a;\n  return f;\n}\n\nfunction factorize(num) {\n\n  const factors = {};\n\n  let n = num;\n  let i = C_TWO;\n  let s = C_FIVE - C_ONE;\n\n  while (s <= n) {\n\n    while (n % i === C_ZERO) {\n      n /= i;\n      factors[i] = (factors[i] || C_ZERO) + C_ONE;\n    }\n    s += C_ONE + C_TWO * i++;\n  }\n\n  if (n !== num) {\n    if (n > 1)\n      factors[n] = (factors[n] || C_ZERO) + C_ONE;\n  } else {\n    factors[num] = (factors[num] || C_ZERO) + C_ONE;\n  }\n  return factors;\n}\n\nconst parse = function (p1, p2) {\n\n  let n = C_ZERO, d = C_ONE, s = C_ONE;\n\n  if (p1 === undefined || p1 === null) { // No argument\n    /* void */\n  } else if (p2 !== undefined) { // Two arguments\n\n    if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else if (isNaN(p1)) {\n      throw InvalidParameter();\n    } else if (p1 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      n = BigInt(p1);\n    }\n\n    if (typeof p2 === \"bigint\") {\n      d = p2;\n    } else if (isNaN(p2)) {\n      throw InvalidParameter();\n    } else if (p2 % 1 !== 0) {\n      throw NonIntegerParameter();\n    } else {\n      d = BigInt(p2);\n    }\n\n    s = n * d;\n\n  } else if (typeof p1 === \"object\") {\n    if (\"d\" in p1 && \"n\" in p1) {\n      n = BigInt(p1[\"n\"]);\n      d = BigInt(p1[\"d\"]);\n      if (\"s\" in p1)\n        n *= BigInt(p1[\"s\"]);\n    } else if (0 in p1) {\n      n = BigInt(p1[0]);\n      if (1 in p1)\n        d = BigInt(p1[1]);\n    } else if (typeof p1 === \"bigint\") {\n      n = p1;\n    } else {\n      throw InvalidParameter();\n    }\n    s = n * d;\n  } else if (typeof p1 === \"number\") {\n\n    if (isNaN(p1)) {\n      throw InvalidParameter();\n    }\n\n    if (p1 < 0) {\n      s = -C_ONE;\n      p1 = -p1;\n    }\n\n    if (p1 % 1 === 0) {\n      n = BigInt(p1);\n    } else {\n\n      let z = 1;\n\n      let A = 0, B = 1;\n      let C = 1, D = 1;\n\n      let N = 10000000;\n\n      if (p1 >= 1) {\n        z = 10 ** Math.floor(1 + Math.log10(p1));\n        p1 /= z;\n      }\n\n      // Using Farey Sequences\n\n      while (B <= N && D <= N) {\n        let M = (A + C) / (B + D);\n\n        if (p1 === M) {\n          if (B + D <= N) {\n            n = A + C;\n            d = B + D;\n          } else if (D > B) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n          break;\n\n        } else {\n\n          if (p1 > M) {\n            A += C;\n            B += D;\n          } else {\n            C += A;\n            D += B;\n          }\n\n          if (B > N) {\n            n = C;\n            d = D;\n          } else {\n            n = A;\n            d = B;\n          }\n        }\n      }\n      n = BigInt(n) * BigInt(z);\n      d = BigInt(d);\n    }\n\n  } else if (typeof p1 === \"string\") {\n\n    let ndx = 0;\n\n    let v = C_ZERO, w = C_ZERO, x = C_ZERO, y = C_ONE, z = C_ONE;\n\n    let match = p1.replace(/_/g, '').match(/\\d+|./g);\n\n    if (match === null)\n      throw InvalidParameter();\n\n    if (match[ndx] === '-') {// Check for minus sign at the beginning\n      s = -C_ONE;\n      ndx++;\n    } else if (match[ndx] === '+') {// Check for plus sign at the beginning\n      ndx++;\n    }\n\n    if (match.length === ndx + 1) { // Check if it's just a simple number \"1234\"\n      w = assign(match[ndx++], s);\n    } else if (match[ndx + 1] === '.' || match[ndx] === '.') { // Check if it's a decimal number\n\n      if (match[ndx] !== '.') { // Handle 0.5 and .5\n        v = assign(match[ndx++], s);\n      }\n      ndx++;\n\n      // Check for decimal places\n      if (ndx + 1 === match.length || match[ndx + 1] === '(' && match[ndx + 3] === ')' || match[ndx + 1] === \"'\" && match[ndx + 3] === \"'\") {\n        w = assign(match[ndx], s);\n        y = C_TEN ** BigInt(match[ndx].length);\n        ndx++;\n      }\n\n      // Check for repeating places\n      if (match[ndx] === '(' && match[ndx + 2] === ')' || match[ndx] === \"'\" && match[ndx + 2] === \"'\") {\n        x = assign(match[ndx + 1], s);\n        z = C_TEN ** BigInt(match[ndx + 1].length) - C_ONE;\n        ndx += 3;\n      }\n\n    } else if (match[ndx + 1] === '/' || match[ndx + 1] === ':') { // Check for a simple fraction \"123/456\" or \"123:456\"\n      w = assign(match[ndx], s);\n      y = assign(match[ndx + 2], C_ONE);\n      ndx += 3;\n    } else if (match[ndx + 3] === '/' && match[ndx + 1] === ' ') { // Check for a complex fraction \"123 1/2\"\n      v = assign(match[ndx], s);\n      w = assign(match[ndx + 2], s);\n      y = assign(match[ndx + 4], C_ONE);\n      ndx += 5;\n    }\n\n    if (match.length <= ndx) { // Check for more tokens on the stack\n      d = y * z;\n      s = /* void */\n        n = x + d * v + z * w;\n    } else {\n      throw InvalidParameter();\n    }\n\n  } else if (typeof p1 === \"bigint\") {\n    n = p1;\n    s = p1;\n    d = C_ONE;\n  } else {\n    throw InvalidParameter();\n  }\n\n  if (d === C_ZERO) {\n    throw DivisionByZero();\n  }\n\n  P[\"s\"] = s < C_ZERO ? -C_ONE : C_ONE;\n  P[\"n\"] = n < C_ZERO ? -n : n;\n  P[\"d\"] = d < C_ZERO ? -d : d;\n};\n\nfunction modpow(b, e, m) {\n\n  let r = C_ONE;\n  for (; e > C_ZERO; b = (b * b) % m, e >>= C_ONE) {\n\n    if (e & C_ONE) {\n      r = (r * b) % m;\n    }\n  }\n  return r;\n}\n\nfunction cycleLen(n, d) {\n\n  for (; d % C_TWO === C_ZERO;\n    d /= C_TWO) {\n  }\n\n  for (; d % C_FIVE === C_ZERO;\n    d /= C_FIVE) {\n  }\n\n  if (d === C_ONE) // Catch non-cyclic numbers\n    return C_ZERO;\n\n  // If we would like to compute really large numbers quicker, we could make use of Fermat's little theorem:\n  // 10^(d-1) % d == 1\n  // However, we don't need such large numbers and MAX_CYCLE_LEN should be the capstone,\n  // as we want to translate the numbers to strings.\n\n  let rem = C_TEN % d;\n  let t = 1;\n\n  for (; rem !== C_ONE; t++) {\n    rem = rem * C_TEN % d;\n\n    if (t > MAX_CYCLE_LEN)\n      return C_ZERO; // Returning 0 here means that we don't print it as a cyclic number. It's likely that the answer is `d-1`\n  }\n  return BigInt(t);\n}\n\nfunction cycleStart(n, d, len) {\n\n  let rem1 = C_ONE;\n  let rem2 = modpow(C_TEN, len, d);\n\n  for (let t = 0; t < 300; t++) { // s < ~log10(Number.MAX_VALUE)\n    // Solve 10^s == 10^(s+t) (mod d)\n\n    if (rem1 === rem2)\n      return BigInt(t);\n\n    rem1 = rem1 * C_TEN % d;\n    rem2 = rem2 * C_TEN % d;\n  }\n  return 0;\n}\n\nfunction gcd(a, b) {\n\n  if (!a)\n    return b;\n  if (!b)\n    return a;\n\n  while (1) {\n    a %= b;\n    if (!a)\n      return b;\n    b %= a;\n    if (!b)\n      return a;\n  }\n}\n\n/**\n * Module constructor\n *\n * @constructor\n * @param {number|Fraction=} a\n * @param {number=} b\n */\nfunction Fraction(a, b) {\n\n  parse(a, b);\n\n  if (this instanceof Fraction) {\n    a = gcd(P[\"d\"], P[\"n\"]); // Abuse a\n    this[\"s\"] = P[\"s\"];\n    this[\"n\"] = P[\"n\"] / a;\n    this[\"d\"] = P[\"d\"] / a;\n  } else {\n    return newFraction(P['s'] * P['n'], P['d']);\n  }\n}\n\nvar DivisionByZero = function () { return new Error(\"Division by Zero\"); };\nvar InvalidParameter = function () { return new Error(\"Invalid argument\"); };\nvar NonIntegerParameter = function () { return new Error(\"Parameters must be integer\"); };\n\nFraction.prototype = {\n\n  \"s\": C_ONE,\n  \"n\": C_ZERO,\n  \"d\": C_ONE,\n\n  /**\n   * Calculates the absolute value\n   *\n   * Ex: new Fraction(-4).abs() => 4\n   **/\n  \"abs\": function () {\n\n    return newFraction(this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Inverts the sign of the current fraction\n   *\n   * Ex: new Fraction(-4).neg() => 4\n   **/\n  \"neg\": function () {\n\n    return newFraction(-this[\"s\"] * this[\"n\"], this[\"d\"]);\n  },\n\n  /**\n   * Adds two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => 467 / 30\n   **/\n  \"add\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] + P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Subtracts two rational numbers\n   *\n   * Ex: new Fraction({n: 2, d: 3}).add(\"14.9\") => -427 / 30\n   **/\n  \"sub\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * this[\"d\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Multiplies two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").mul(3) => 5776 / 111\n   **/\n  \"mul\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"n\"],\n      this[\"d\"] * P[\"d\"]\n    );\n  },\n\n  /**\n   * Divides two rational numbers\n   *\n   * Ex: new Fraction(\"-17.(345)\").inverse().div(3)\n   **/\n  \"div\": function (a, b) {\n\n    parse(a, b);\n    return newFraction(\n      this[\"s\"] * P[\"s\"] * this[\"n\"] * P[\"d\"],\n      this[\"d\"] * P[\"n\"]\n    );\n  },\n\n  /**\n   * Clones the actual object\n   *\n   * Ex: new Fraction(\"-17.(345)\").clone()\n   **/\n  \"clone\": function () {\n    return newFraction(this['s'] * this['n'], this['d']);\n  },\n\n  /**\n   * Calculates the modulo of two rational numbers - a more precise fmod\n   *\n   * Ex: new Fraction('4.(3)').mod([7, 8]) => (13/3) % (7/8) = (5/6)\n   * Ex: new Fraction(20, 10).mod().equals(0) ? \"is Integer\"\n   **/\n  \"mod\": function (a, b) {\n\n    if (a === undefined) {\n      return newFraction(this[\"s\"] * this[\"n\"] % this[\"d\"], C_ONE);\n    }\n\n    parse(a, b);\n    if (C_ZERO === P[\"n\"] * this[\"d\"]) {\n      throw DivisionByZero();\n    }\n\n    /**\n     * I derived the rational modulo similar to the modulo for integers\n     *\n     * https://raw.org/book/analysis/rational-numbers/\n     *\n     *    n1/d1 = (n2/d2) * q + r, where 0 ≤ r < n2/d2\n     * => d2 * n1 = n2 * d1 * q + d1 * d2 * r\n     * => r = (d2 * n1 - n2 * d1 * q) / (d1 * d2)\n     *      = (d2 * n1 - n2 * d1 * floor((d2 * n1) / (n2 * d1))) / (d1 * d2)\n     *      = ((d2 * n1) % (n2 * d1)) / (d1 * d2)\n     */\n    return newFraction(\n      this[\"s\"] * (P[\"d\"] * this[\"n\"]) % (P[\"n\"] * this[\"d\"]),\n      P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional gcd of two rational numbers\n   *\n   * Ex: new Fraction(5,8).gcd(3,7) => 1/56\n   */\n  \"gcd\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // gcd(a / b, c / d) = gcd(a, c) / lcm(b, d)\n\n    return newFraction(gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]), P[\"d\"] * this[\"d\"]);\n  },\n\n  /**\n   * Calculates the fractional lcm of two rational numbers\n   *\n   * Ex: new Fraction(5,8).lcm(3,7) => 15\n   */\n  \"lcm\": function (a, b) {\n\n    parse(a, b);\n\n    // https://raw.org/book/analysis/rational-numbers/\n    // lcm(a / b, c / d) = lcm(a, c) / gcd(b, d)\n\n    if (P[\"n\"] === C_ZERO && this[\"n\"] === C_ZERO) {\n      return newFraction(C_ZERO, C_ONE);\n    }\n    return newFraction(P[\"n\"] * this[\"n\"], gcd(P[\"n\"], this[\"n\"]) * gcd(P[\"d\"], this[\"d\"]));\n  },\n\n  /**\n   * Gets the inverse of the fraction, means numerator and denominator are exchanged\n   *\n   * Ex: new Fraction([-3, 4]).inverse() => -4 / 3\n   **/\n  \"inverse\": function () {\n    return newFraction(this[\"s\"] * this[\"d\"], this[\"n\"]);\n  },\n\n  /**\n   * Calculates the fraction to some integer exponent\n   *\n   * Ex: new Fraction(-1,2).pow(-3) => -8\n   */\n  \"pow\": function (a, b) {\n\n    parse(a, b);\n\n    // Trivial case when exp is an integer\n\n    if (P['d'] === C_ONE) {\n\n      if (P['s'] < C_ZERO) {\n        return newFraction((this['s'] * this[\"d\"]) ** P['n'], this[\"n\"] ** P['n']);\n      } else {\n        return newFraction((this['s'] * this[\"n\"]) ** P['n'], this[\"d\"] ** P['n']);\n      }\n    }\n\n    // Negative roots become complex\n    //     (-a/b)^(c/d) = x\n    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (cos(c*pi/d) + i*sin(c*pi/d)) * (a/b)^(c/d) = x       # DeMoivre's formula\n    // From which follows that only for c=0 the root is non-complex\n    if (this['s'] < C_ZERO) return null;\n\n    // Now prime factor n and d\n    let N = factorize(this['n']);\n    let D = factorize(this['d']);\n\n    // Exponentiate and take root for n and d individually\n    let n = C_ONE;\n    let d = C_ONE;\n    for (let k in N) {\n      if (k === '1') continue;\n      if (k === '0') {\n        n = C_ZERO;\n        break;\n      }\n      N[k] *= P['n'];\n\n      if (N[k] % P['d'] === C_ZERO) {\n        N[k] /= P['d'];\n      } else return null;\n      n *= BigInt(k) ** N[k];\n    }\n\n    for (let k in D) {\n      if (k === '1') continue;\n      D[k] *= P['n'];\n\n      if (D[k] % P['d'] === C_ZERO) {\n        D[k] /= P['d'];\n      } else return null;\n      d *= BigInt(k) ** D[k];\n    }\n\n    if (P['s'] < C_ZERO) {\n      return newFraction(d, n);\n    }\n    return newFraction(n, d);\n  },\n\n  /**\n   * Calculates the logarithm of a fraction to a given rational base\n   *\n   * Ex: new Fraction(27, 8).log(9, 4) => 3/2\n   */\n  \"log\": function (a, b) {\n\n    parse(a, b);\n\n    if (this['s'] <= C_ZERO || P['s'] <= C_ZERO) return null;\n\n    const allPrimes = {};\n\n    const baseFactors = factorize(P['n']);\n    const T1 = factorize(P['d']);\n\n    const numberFactors = factorize(this['n']);\n    const T2 = factorize(this['d']);\n\n    for (const prime in T1) {\n      baseFactors[prime] = (baseFactors[prime] || C_ZERO) - T1[prime];\n    }\n    for (const prime in T2) {\n      numberFactors[prime] = (numberFactors[prime] || C_ZERO) - T2[prime];\n    }\n\n    for (const prime in baseFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n    for (const prime in numberFactors) {\n      if (prime === '1') continue;\n      allPrimes[prime] = true;\n    }\n\n    let retN = null;\n    let retD = null;\n\n    // Iterate over all unique primes to determine if a consistent ratio exists\n    for (const prime in allPrimes) {\n\n      const baseExponent = baseFactors[prime] || C_ZERO;\n      const numberExponent = numberFactors[prime] || C_ZERO;\n\n      if (baseExponent === C_ZERO) {\n        if (numberExponent !== C_ZERO) {\n          return null; // Logarithm cannot be expressed as a rational number\n        }\n        continue; // Skip this prime since both exponents are zero\n      }\n\n      // Calculate the ratio of exponents for this prime\n      let curN = numberExponent;\n      let curD = baseExponent;\n\n      // Simplify the current ratio\n      const gcdValue = gcd(curN, curD);\n      curN /= gcdValue;\n      curD /= gcdValue;\n\n      // Check if this is the first ratio; otherwise, ensure ratios are consistent\n      if (retN === null && retD === null) {\n        retN = curN;\n        retD = curD;\n      } else if (curN * retD !== retN * curD) {\n        return null; // Ratios do not match, logarithm cannot be rational\n      }\n    }\n\n    return retN !== null && retD !== null\n      ? newFraction(retN, retD)\n      : null;\n  },\n\n  /**\n   * Check if two rational numbers are the same\n   *\n   * Ex: new Fraction(19.6).equals([98, 5]);\n   **/\n  \"equals\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] === P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] < P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is less than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"lte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] <= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gt\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] > P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Check if this rational number is greater than or equal another\n   *\n   * Ex: new Fraction(19.6).lt([98, 5]);\n   **/\n  \"gte\": function (a, b) {\n\n    parse(a, b);\n    return this[\"s\"] * this[\"n\"] * P[\"d\"] >= P[\"s\"] * P[\"n\"] * this[\"d\"];\n  },\n\n  /**\n   * Compare two rational numbers\n   * < 0 iff this < that\n   * > 0 iff this > that\n   * = 0 iff this = that\n   *\n   * Ex: new Fraction(19.6).compare([98, 5]);\n   **/\n  \"compare\": function (a, b) {\n\n    parse(a, b);\n    let t = this[\"s\"] * this[\"n\"] * P[\"d\"] - P[\"s\"] * P[\"n\"] * this[\"d\"];\n\n    return (C_ZERO < t) - (t < C_ZERO);\n  },\n\n  /**\n   * Calculates the ceil of a rational number\n   *\n   * Ex: new Fraction('4.(3)').ceil() => (5 / 1)\n   **/\n  \"ceil\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Calculates the floor of a rational number\n   *\n   * Ex: new Fraction('4.(3)').floor() => (4 / 1)\n   **/\n  \"floor\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) -\n      (places * this[\"n\"] % this[\"d\"] > C_ZERO && this[\"s\"] < C_ZERO ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n   * Rounds a rational numbers\n   *\n   * Ex: new Fraction('4.(3)').round() => (4 / 1)\n   **/\n  \"round\": function (places) {\n\n    places = C_TEN ** BigInt(places || 0);\n\n    /* Derivation:\n\n    s >= 0:\n      round(n / d) = trunc(n / d) + (n % d) / d >= 0.5 ? 1 : 0\n                   = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    s < 0:\n      round(n / d) =-trunc(n / d) - (n % d) / d > 0.5 ? 1 : 0\n                   =-trunc(n / d) - 2(n % d) > d ? 1 : 0\n\n    =>:\n\n    round(s * n / d) = s * trunc(n / d) + s * (C + 2(n % d) > d ? 1 : 0)\n        where C = s >= 0 ? 1 : 0, to fix the >= for the positve case.\n    */\n\n    return newFraction(trunc(this[\"s\"] * places * this[\"n\"] / this[\"d\"]) +\n      this[\"s\"] * ((this[\"s\"] >= C_ZERO ? C_ONE : C_ZERO) + C_TWO * (places * this[\"n\"] % this[\"d\"]) > this[\"d\"] ? C_ONE : C_ZERO),\n      places);\n  },\n\n  /**\n    * Rounds a rational number to a multiple of another rational number\n    *\n    * Ex: new Fraction('0.9').roundTo(\"1/8\") => 7 / 8\n    **/\n  \"roundTo\": function (a, b) {\n\n    /*\n    k * x/y ≤ a/b < (k+1) * x/y\n    ⇔ k ≤ a/b / (x/y) < (k+1)\n    ⇔ k = floor(a/b * y/x)\n    ⇔ k = floor((a * y) / (b * x))\n    */\n\n    parse(a, b);\n\n    const n = this['n'] * P['d'];\n    const d = this['d'] * P['n'];\n    const r = n % d;\n\n    // round(n / d) = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    let k = trunc(n / d);\n    if (r + r >= d) {\n      k++;\n    }\n    return newFraction(this['s'] * k * P['n'], P['d']);\n  },\n\n  /**\n   * Check if two rational numbers are divisible\n   *\n   * Ex: new Fraction(19.6).divisible(1.5);\n   */\n  \"divisible\": function (a, b) {\n\n    parse(a, b);\n    return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n  },\n\n  /**\n   * Returns a decimal representation of the fraction\n   *\n   * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n   **/\n  'valueOf': function () {\n    // Best we can do so far\n    return Number(this[\"s\"] * this[\"n\"]) / Number(this[\"d\"]);\n  },\n\n  /**\n   * Creates a string representation of a fraction with all digits\n   *\n   * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n   **/\n  'toString': function (dec) {\n\n    let N = this[\"n\"];\n    let D = this[\"d\"];\n\n    dec = dec || 15; // 15 = decimal places when no repetition\n\n    let cycLen = cycleLen(N, D); // Cycle length\n    let cycOff = cycleStart(N, D, cycLen); // Cycle start\n\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    // Append integer part\n    str += trunc(N / D);\n\n    N %= D;\n    N *= C_TEN;\n\n    if (N)\n      str += \".\";\n\n    if (cycLen) {\n\n      for (let i = cycOff; i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \"(\";\n      for (let i = cycLen; i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \")\";\n    } else {\n      for (let i = dec; N && i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n    }\n    return str;\n  },\n\n  /**\n   * Returns a string-fraction representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toFraction() => \"4 1/3\"\n   **/\n  'toFraction': function (showMixed) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      let whole = trunc(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        str += \" \";\n        n %= d;\n      }\n\n      str += n;\n      str += '/';\n      str += d;\n    }\n    return str;\n  },\n\n  /**\n   * Returns a latex representation of a Fraction object\n   *\n   * Ex: new Fraction(\"1.'3'\").toLatex() => \"\\frac{4}{3}\"\n   **/\n  'toLatex': function (showMixed) {\n\n    let n = this[\"n\"];\n    let d = this[\"d\"];\n    let str = this['s'] < C_ZERO ? \"-\" : \"\";\n\n    if (d === C_ONE) {\n      str += n;\n    } else {\n      let whole = trunc(n / d);\n      if (showMixed && whole > C_ZERO) {\n        str += whole;\n        n %= d;\n      }\n\n      str += \"\\\\frac{\";\n      str += n;\n      str += '}{';\n      str += d;\n      str += '}';\n    }\n    return str;\n  },\n\n  /**\n   * Returns an array of continued fraction elements\n   *\n   * Ex: new Fraction(\"7/8\").toContinued() => [0,1,7]\n   */\n  'toContinued': function () {\n\n    let a = this['n'];\n    let b = this['d'];\n    let res = [];\n\n    do {\n      res.push(trunc(a / b));\n      let t = a % b;\n      a = b;\n      b = t;\n    } while (a !== C_ONE);\n\n    return res;\n  },\n\n  \"simplify\": function (eps) {\n\n    const ieps = BigInt(1 / (eps || 0.001) | 0);\n\n    const thisABS = this['abs']();\n    const cont = thisABS['toContinued']();\n\n    for (let i = 1; i < cont.length; i++) {\n\n      let s = newFraction(cont[i - 1], C_ONE);\n      for (let k = i - 2; k >= 0; k--) {\n        s = s['inverse']()['add'](cont[k]);\n      }\n\n      let t = s['sub'](thisABS);\n      if (t['n'] * ieps < t['d']) { // More robust than Math.abs(t.valueOf()) < eps\n        return s['mul'](this['s']);\n      }\n    }\n    return this;\n  }\n};\nexport {\n  Fraction as default, Fraction\n};\n","import Fraction from 'fraction.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Fraction'\nconst dependencies = []\n\nexport const createFractionClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Fraction, 'name', { value: 'Fraction' })\n  Fraction.prototype.constructor = Fraction\n  Fraction.prototype.type = 'Fraction'\n  Fraction.prototype.isFraction = true\n\n  /**\n   * Get a JSON representation of a Fraction containing type information\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Fraction\", \"n\": \"3\", \"d\": \"8\"}`\n   */\n  Fraction.prototype.toJSON = function () {\n    return {\n      mathjs: 'Fraction',\n      n: String(this.s * this.n),\n      d: String(this.d)\n    }\n  }\n\n  /**\n   * Instantiate a Fraction from a JSON object\n   * @param {Object} json  a JSON object structured as:\n   *                       `{\"mathjs\": \"Fraction\", \"n\": \"3\", \"d\": \"8\"}`\n   * @return {BigNumber}\n   */\n  Fraction.fromJSON = function (json) {\n    return new Fraction(json)\n  }\n\n  return Fraction\n}, { isClass: true })\n","import { isBigInt, isBigNumber } from '../../utils/is.js'\nimport { format, sign, nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Range'\nconst dependencies = []\n\nexport const createRangeClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Create a range of numbers. A range has a start, step, and end,\n   * and contains functions to iterate over the range.\n   *\n   * A range can be constructed as:\n   *\n   *     const range = new Range(start, end)\n   *     const range = new Range(start, end, step)\n   *\n   * Note that the endpoints and step may be specified with other numeric\n   * types such as bigint or BigNumber, but they will be demoted to the\n   * built-in `number` type and the Range will only contain numbers. The\n   * rationale for this demotion is that Range objects are primarily used\n   * for indexing Matrix objects, and Matrix objects may only be indexed\n   * with `number`s.\n   *\n   * To get the result of the range:\n   *     range.forEach(function (x) {\n   *         console.log(x)\n   *     })\n   *     range.map(function (x) {\n   *         return math.sin(x)\n   *     })\n   *     range.toArray()\n   *\n   * Example usage:\n   *\n   *     const c = new Range(2, 6)       // 2:1:5\n   *     c.toArray()                     // [2, 3, 4, 5]\n   *     const d = new Range(2, -3, -1)  // 2:-1:-2\n   *     d.toArray()                     // [2, 1, 0, -1, -2]\n   *\n   * @class Range\n   * @constructor Range\n   * @param {number} start  included lower bound\n   * @param {number} end    excluded upper bound\n   * @param {number} [step] step size, default value is 1\n   */\n  function Range (start, end, step) {\n    if (!(this instanceof Range)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    const hasStart = start !== null && start !== undefined\n    const hasEnd = end !== null && end !== undefined\n    const hasStep = step !== null && step !== undefined\n\n    if (hasStart) {\n      if (isBigNumber(start)) {\n        start = start.toNumber()\n      } else if (typeof start !== 'number' && !isBigInt(start)) {\n        throw new TypeError('Parameter start must be a number or bigint')\n      }\n    }\n    if (hasEnd) {\n      if (isBigNumber(end)) {\n        end = end.toNumber()\n      } else if (typeof end !== 'number' && !isBigInt(end)) {\n        throw new TypeError('Parameter end must be a number or bigint')\n      }\n    }\n    if (hasStep) {\n      if (isBigNumber(step)) {\n        step = step.toNumber()\n      } else if (typeof step !== 'number' && !isBigInt(step)) {\n        throw new TypeError('Parameter step must be a number or bigint')\n      }\n    }\n\n    this.start = hasStart ? parseFloat(start) : 0\n    this.end = hasEnd ? parseFloat(end) : 0\n    this.step = hasStep ? parseFloat(step) : 1\n    if (hasStep && nearlyEqual(this.step, 0)) {\n      throw new Error('Step must not be zero')\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Range.prototype.type = 'Range'\n  Range.prototype.isRange = true\n\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @memberof Range\n   * @param {string} str\n   * @return {Range | null} range\n   */\n  Range.parse = function (str) {\n    if (typeof str !== 'string') {\n      return null\n    }\n\n    const args = str.split(':')\n    const nums = args.map(function (arg) {\n      return parseFloat(arg)\n    })\n\n    const invalid = nums.some(function (num) {\n      return isNaN(num)\n    })\n    if (invalid) {\n      return null\n    }\n\n    switch (nums.length) {\n      case 2:\n        return new Range(nums[0], nums[1])\n      case 3:\n        return new Range(nums[0], nums[2], nums[1])\n      default:\n        return null\n    }\n  }\n\n  /**\n   * Create a clone of the range\n   * @return {Range} clone\n   */\n  Range.prototype.clone = function () {\n    return new Range(this.start, this.end, this.step)\n  }\n\n  /**\n   * Retrieve the size of the range.\n   * Returns an array containing one number, the number of elements in the range.\n   * @memberof Range\n   * @returns {number[]} size\n   */\n  Range.prototype.size = function () {\n    let len = 0\n    const start = this.start\n    const step = this.step\n    const end = this.end\n    const diff = end - start\n\n    if (sign(step) === sign(diff)) {\n      len = Math.ceil((diff) / step)\n    } else if (diff === 0) {\n      len = 0\n    }\n\n    if (isNaN(len)) {\n      len = 0\n    }\n    return [len]\n  }\n\n  /**\n   * Calculate the minimum value in the range\n   * @memberof Range\n   * @return {number | undefined} min\n   */\n  Range.prototype.min = function () {\n    const size = this.size()[0]\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start\n      } else {\n        // negative step\n        return this.start + (size - 1) * this.step\n      }\n    } else {\n      return undefined\n    }\n  }\n\n  /**\n   * Calculate the maximum value in the range\n   * @memberof Range\n   * @return {number | undefined} max\n   */\n  Range.prototype.max = function () {\n    const size = this.size()[0]\n\n    if (size > 0) {\n      if (this.step > 0) {\n        // positive step\n        return this.start + (size - 1) * this.step\n      } else {\n        // negative step\n        return this.start\n      }\n    } else {\n      return undefined\n    }\n  }\n\n  /**\n   * Execute a callback function for each value in the range.\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Range being traversed.\n   */\n  Range.prototype.forEach = function (callback) {\n    let x = this.start\n    const step = this.step\n    const end = this.end\n    let i = 0\n\n    if (step > 0) {\n      while (x < end) {\n        callback(x, [i], this)\n        x += step\n        i++\n      }\n    } else if (step < 0) {\n      while (x > end) {\n        callback(x, [i], this)\n        x += step\n        i++\n      }\n    }\n  }\n\n  /**\n   * Execute a callback function for each value in the Range, and return the\n   * results as an array\n   * @memberof Range\n   * @param {function} callback   The callback method is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @returns {Array} array\n   */\n  Range.prototype.map = function (callback) {\n    const array = []\n    this.forEach(function (value, index, obj) {\n      array[index[0]] = callback(value, index, obj)\n    })\n    return array\n  }\n\n  /**\n   * Create an Array with a copy of the Ranges data\n   * @memberof Range\n   * @returns {Array} array\n   */\n  Range.prototype.toArray = function () {\n    const array = []\n    this.forEach(function (value, index) {\n      array[index[0]] = value\n    })\n    return array\n  }\n\n  /**\n   * Get the primitive value of the Range, a one dimensional array\n   * @memberof Range\n   * @returns {Array} array\n   */\n  Range.prototype.valueOf = function () {\n    // TODO: implement a caching mechanism for range.valueOf()\n    return this.toArray()\n  }\n\n  /**\n   * Get a string representation of the range, with optional formatting options.\n   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'\n   * @memberof Range\n   * @param {Object | number | function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  Range.prototype.format = function (options) {\n    let str = format(this.start, options)\n\n    if (this.step !== 1) {\n      str += ':' + format(this.step, options)\n    }\n    str += ':' + format(this.end, options)\n    return str\n  }\n\n  /**\n   * Get a string representation of the range.\n   * @memberof Range\n   * @returns {string}\n   */\n  Range.prototype.toString = function () {\n    return this.format()\n  }\n\n  /**\n   * Get a JSON representation of the range\n   * @memberof Range\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   */\n  Range.prototype.toJSON = function () {\n    return {\n      mathjs: 'Range',\n      start: this.start,\n      end: this.end,\n      step: this.step\n    }\n  }\n\n  /**\n   * Instantiate a Range from a JSON object\n   * @memberof Range\n   * @param {Object} json A JSON object structured as:\n   *                      `{\"mathjs\": \"Range\", \"start\": 2, \"end\": 4, \"step\": 1}`\n   * @return {Range}\n   */\n  Range.fromJSON = function (json) {\n    return new Range(json.start, json.end, json.step)\n  }\n\n  return Range\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'Matrix'\nconst dependencies = []\n\nexport const createMatrixClass = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * @constructor Matrix\n   *\n   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional\n   * array. A matrix can be constructed as:\n   *\n   *     let matrix = math.matrix(data)\n   *\n   * Matrix contains the functions to resize, get and set values, get the size,\n   * clone the matrix and to convert the matrix to a vector, array, or scalar.\n   * Furthermore, one can iterate over the matrix using map and forEach.\n   * The internal Array of the Matrix can be accessed using the function valueOf.\n   *\n   * Example usage:\n   *\n   *     let matrix = math.matrix([[1, 2], [3, 4]])\n   *     matix.size()              // [2, 2]\n   *     matrix.resize([3, 2], 5)\n   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]\n   *     matrix.subset([1,2])       // 3 (indexes are zero-based)\n   *\n   */\n  function Matrix () {\n    if (!(this instanceof Matrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Matrix.prototype.type = 'Matrix'\n  Matrix.prototype.isMatrix = true\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @return {string}           The storage format.\n   */\n  Matrix.prototype.storage = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke storage on a Matrix interface')\n  }\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @return {string}           The datatype.\n   */\n  Matrix.prototype.datatype = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke datatype on a Matrix interface')\n  }\n\n  /**\n   * Create a new Matrix With the type of the current matrix instance\n   * @param {Array | Object} data\n   * @param {string} [datatype]\n   */\n  Matrix.prototype.create = function (data, datatype) {\n    throw new Error('Cannot invoke create on a Matrix interface')\n  }\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  Matrix.prototype.subset = function (index, replacement, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke subset on a Matrix interface')\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  Matrix.prototype.get = function (index) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke get on a Matrix interface')\n  }\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {Matrix} self\n   */\n  Matrix.prototype.set = function (index, value, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke set on a Matrix interface')\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  Matrix.prototype.resize = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke resize on a Matrix interface')\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  Matrix.prototype.reshape = function (size, defaultValue) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke reshape on a Matrix interface')\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @return {Matrix} clone\n   */\n  Matrix.prototype.clone = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke clone on a Matrix interface')\n  }\n\n  /**\n   * Retrieve the size of the matrix.\n   * @returns {number[]} size\n   */\n  Matrix.prototype.size = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke size on a Matrix interface')\n  }\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {Matrix} matrix\n   */\n  Matrix.prototype.map = function (callback, skipZeros) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke map on a Matrix interface')\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   */\n  Matrix.prototype.forEach = function (callback) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke forEach on a Matrix interface')\n  }\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  Matrix.prototype[Symbol.iterator] = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot iterate a Matrix interface')\n  }\n\n  /**\n   * Create an Array with a copy of the data of the Matrix\n   * @returns {Array} array\n   */\n  Matrix.prototype.toArray = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toArray on a Matrix interface')\n  }\n\n  /**\n   * Get the primitive value of the Matrix: a multidimensional array\n   * @returns {Array} array\n   */\n  Matrix.prototype.valueOf = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke valueOf on a Matrix interface')\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  Matrix.prototype.format = function (options) {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke format on a Matrix interface')\n  }\n\n  /**\n   * Get a string representation of the matrix\n   * @returns {string} str\n   */\n  Matrix.prototype.toString = function () {\n    // must be implemented by each of the Matrix implementations\n    throw new Error('Cannot invoke toString on a Matrix interface')\n  }\n\n  return Matrix\n}, { isClass: true })\n","function _extends() {\n  return _extends = Object.assign ? Object.assign.bind() : function (n) {\n    for (var e = 1; e < arguments.length; e++) {\n      var t = arguments[e];\n      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);\n    }\n    return n;\n  }, _extends.apply(null, arguments);\n}\nexport { _extends as default };","import { isBigNumber, isNumber } from '../is.js'\nimport { isInteger, normalizeFormatOptions } from '../number.js'\n\n/**\n * Formats a BigNumber in a given base\n * @param {BigNumber} n\n * @param {number} base\n * @param {number} size\n * @returns {string}\n */\nfunction formatBigNumberToBase (n, base, size) {\n  const BigNumberCtor = n.constructor\n  const big2 = new BigNumberCtor(2)\n  let suffix = ''\n  if (size) {\n    if (size < 1) {\n      throw new Error('size must be in greater than 0')\n    }\n    if (!isInteger(size)) {\n      throw new Error('size must be an integer')\n    }\n    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {\n      throw new Error(`Value must be in range [-2^${size - 1}, 2^${size - 1}-1]`)\n    }\n    if (!n.isInteger()) {\n      throw new Error('Value must be an integer')\n    }\n    if (n.lessThan(0)) {\n      n = n.add(big2.pow(size))\n    }\n    suffix = `i${size}`\n  }\n  switch (base) {\n    case 2: return `${n.toBinary()}${suffix}`\n    case 8: return `${n.toOctal()}${suffix}`\n    case 16: return `${n.toHexadecimal()}${suffix}`\n    default: throw new Error(`Base ${base} not supported `)\n  }\n}\n\n/**\n * Convert a BigNumber to a formatted string representation.\n *\n * Syntax:\n *\n *    format(value)\n *    format(value, options)\n *    format(value, precision)\n *    format(value, fn)\n *\n * Where:\n *\n *    {number} value   The value to be formatted\n *    {Object} options An object with formatting options. Available options:\n *                     {string} notation\n *                         Number notation. Choose from:\n *                         'fixed'          Always use regular number notation.\n *                                          For example '123.40' and '14000000'\n *                         'exponential'    Always use exponential notation.\n *                                          For example '1.234e+2' and '1.4e+7'\n *                         'auto' (default) Regular number notation for numbers\n *                                          having an absolute value between\n *                                          `lower` and `upper` bounds, and uses\n *                                          exponential notation elsewhere.\n *                                          Lower bound is included, upper bound\n *                                          is excluded.\n *                                          For example '123.4' and '1.4e7'.\n *                         'bin', 'oct, or\n *                         'hex'            Format the number using binary, octal,\n *                                          or hexadecimal notation.\n *                                          For example '0b1101' and '0x10fe'.\n *                     {number} wordSize    The word size in bits to use for formatting\n *                                          in binary, octal, or hexadecimal notation.\n *                                          To be used only with 'bin', 'oct', or 'hex'\n *                                          values for 'notation' option. When this option\n *                                          is defined the value is formatted as a signed\n *                                          twos complement integer of the given word size\n *                                          and the size suffix is appended to the output.\n *                                          For example\n *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.\n *                                          Default value is undefined.\n *                     {number} precision   A number between 0 and 16 to round\n *                                          the digits of the number.\n *                                          In case of notations 'exponential',\n *                                          'engineering', and 'auto',\n *                                          `precision` defines the total\n *                                          number of significant digits returned.\n *                                          In case of notation 'fixed',\n *                                          `precision` defines the number of\n *                                          significant digits after the decimal\n *                                          point.\n *                                          `precision` is undefined by default.\n *                     {number} lowerExp    Exponent determining the lower boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `-3`.\n *                     {number} upperExp    Exponent determining the upper boundary\n *                                          for formatting a value with an exponent\n *                                          when `notation='auto`.\n *                                          Default value is `5`.\n *    {Function} fn    A custom formatting function. Can be used to override the\n *                     built-in notations. Function `fn` is called with `value` as\n *                     parameter and must return a string. Is useful for example to\n *                     format all values inside a matrix in a particular way.\n *\n * Examples:\n *\n *    format(6.4)                                        // '6.4'\n *    format(1240000)                                    // '1.24e6'\n *    format(1/3)                                        // '0.3333333333333333'\n *    format(1/3, 3)                                     // '0.333'\n *    format(21385, 2)                                   // '21000'\n *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'\n *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'\n *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'\n *\n * @param {BigNumber} value\n * @param {Object | Function | number | BigNumber} [options]\n * @return {string} str The formatted value\n */\nexport function format (value, options) {\n  if (typeof options === 'function') {\n    // handle format(value, fn)\n    return options(value)\n  }\n\n  // handle special cases\n  if (!value.isFinite()) {\n    return value.isNaN() ? 'NaN' : (value.gt(0) ? 'Infinity' : '-Infinity')\n  }\n\n  const { notation, precision, wordSize } = normalizeFormatOptions(options)\n\n  // handle the various notations\n  switch (notation) {\n    case 'fixed':\n      return toFixed(value, precision)\n\n    case 'exponential':\n      return toExponential(value, precision)\n\n    case 'engineering':\n      return toEngineering(value, precision)\n\n    case 'bin':\n      return formatBigNumberToBase(value, 2, wordSize)\n\n    case 'oct':\n      return formatBigNumberToBase(value, 8, wordSize)\n\n    case 'hex':\n      return formatBigNumberToBase(value, 16, wordSize)\n\n    case 'auto':\n    {\n      // determine lower and upper bound for exponential notation.\n      // TODO: implement support for upper and lower to be BigNumbers themselves\n      const lowerExp = _toNumberOrDefault(options?.lowerExp, -3)\n      const upperExp = _toNumberOrDefault(options?.upperExp, 5)\n\n      // handle special case zero\n      if (value.isZero()) return '0'\n\n      // determine whether or not to output exponential notation\n      let str\n      const rounded = value.toSignificantDigits(precision)\n      const exp = rounded.e\n      if (exp >= lowerExp && exp < upperExp) {\n        // normal number notation\n        str = rounded.toFixed()\n      } else {\n        // exponential notation\n        str = toExponential(value, precision)\n      }\n\n      // remove trailing zeros after the decimal point\n      return str.replace(/((\\.\\d*?)(0+))($|e)/, function () {\n        const digits = arguments[2]\n        const e = arguments[4]\n        return (digits !== '.') ? digits + e : e\n      })\n    }\n    default:\n      throw new Error('Unknown notation \"' + notation + '\". ' +\n          'Choose \"auto\", \"exponential\", \"fixed\", \"bin\", \"oct\", or \"hex.')\n  }\n}\n\n/**\n * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]        Optional number of significant figures to return.\n */\nexport function toEngineering (value, precision) {\n  // find nearest lower multiple of 3 for exponent\n  const e = value.e\n  const newExp = e % 3 === 0 ? e : (e < 0 ? (e - 3) - (e % 3) : e - (e % 3))\n\n  // find difference in exponents, and calculate the value without exponent\n  const valueWithoutExp = value.mul(Math.pow(10, -newExp))\n\n  let valueStr = valueWithoutExp.toPrecision(precision)\n  if (valueStr.includes('e')) {\n    const BigNumber = value.constructor\n    valueStr = new BigNumber(valueStr).toFixed()\n  }\n\n  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString()\n}\n\n/**\n * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'\n * @param {BigNumber} value\n * @param {number} [precision]  Number of digits in formatted output.\n *                              If not provided, the maximum available digits\n *                              is used.\n * @returns {string} str\n */\nexport function toExponential (value, precision) {\n  if (precision !== undefined) {\n    return value.toExponential(precision - 1) // Note the offset of one\n  } else {\n    return value.toExponential()\n  }\n}\n\n/**\n * Format a number with fixed notation.\n * @param {BigNumber} value\n * @param {number} [precision=undefined] Optional number of decimals after the\n *                                       decimal point. Undefined by default.\n */\nexport function toFixed (value, precision) {\n  return value.toFixed(precision)\n}\n\nfunction _toNumberOrDefault (value, defaultValue) {\n  if (isNumber(value)) {\n    return value\n  } else if (isBigNumber(value)) {\n    return value.toNumber()\n  } else {\n    return defaultValue\n  }\n}\n","import { isBigNumber, isString, typeOf } from './is.js'\nimport { format as formatNumber } from './number.js'\nimport { format as formatBigNumber } from './bignumber/formatter.js'\n\n/**\n * Check if a text ends with a certain string.\n * @param {string} text\n * @param {string} search\n */\nexport function endsWith (text, search) {\n  const start = text.length - search.length\n  const end = text.length\n  return (text.substring(start, end) === search)\n}\n\n/**\n * Format a value of any type into a string.\n *\n * Usage:\n *     math.format(value)\n *     math.format(value, precision)\n *     math.format(value, options)\n *\n * When value is a function:\n *\n * - When the function has a property `syntax`, it returns this\n *   syntax description.\n * - In other cases, a string `'function'` is returned.\n *\n * When `value` is an Object:\n *\n * - When the object contains a property `format` being a function, this\n *   function is invoked as `value.format(options)` and the result is returned.\n * - When the object has its own `toString` method, this method is invoked\n *   and the result is returned.\n * - In other cases the function will loop over all object properties and\n *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n *\n * Example usage:\n *     math.format(2/7)                // '0.2857142857142857'\n *     math.format(math.pi, 3)         // '3.14'\n *     math.format(new Complex(2, 3))  // '2 + 3i'\n *     math.format('hello')            // '\"hello\"'\n *\n * @param {*} value             Value to be stringified\n * @param {Object | number | Function} [options]\n *     Formatting options. See src/utils/number.js:format for a\n *     description of the available options controlling number output.\n *     This generic \"format\" also supports the option property `truncate: NN`\n *     giving the maximum number NN of characters to return (if there would\n *     have been more, they are deleted and replaced by an ellipsis).\n * @return {string} str\n */\nexport function format (value, options) {\n  const result = _format(value, options)\n  if (options && typeof options === 'object' && 'truncate' in options &&\n      result.length > options.truncate) {\n    return result.substring(0, options.truncate - 3) + '...'\n  }\n  return result\n}\n\nfunction _format (value, options) {\n  if (typeof value === 'number') {\n    return formatNumber(value, options)\n  }\n\n  if (isBigNumber(value)) {\n    return formatBigNumber(value, options)\n  }\n\n  // note: we use unsafe duck-typing here to check for Fractions, this is\n  // ok here since we're only invoking toString or concatenating its values\n  if (looksLikeFraction(value)) {\n    if (!options || options.fraction !== 'decimal') {\n      // output as ratio, like '1/3'\n      return `${value.s * value.n}/${value.d}`\n    } else {\n      // output as decimal, like '0.(3)'\n      return value.toString()\n    }\n  }\n\n  if (Array.isArray(value)) {\n    return formatArray(value, options)\n  }\n\n  if (isString(value)) {\n    return stringify(value)\n  }\n\n  if (typeof value === 'function') {\n    return value.syntax ? String(value.syntax) : 'function'\n  }\n\n  if (value && typeof value === 'object') {\n    if (typeof value.format === 'function') {\n      return value.format(options)\n    } else if (value && value.toString(options) !== {}.toString()) {\n      // this object has a non-native toString method, use that one\n      return value.toString(options)\n    } else {\n      const entries = Object.keys(value).map(key => {\n        return stringify(key) + ': ' + format(value[key], options)\n      })\n\n      return '{' + entries.join(', ') + '}'\n    }\n  }\n\n  return String(value)\n}\n\n/**\n * Stringify a value into a string enclosed in double quotes.\n * Unescaped double quotes and backslashes inside the value are escaped.\n * @param {*} value\n * @return {string}\n */\nexport function stringify (value) {\n  const text = String(value)\n  let escaped = ''\n  let i = 0\n  while (i < text.length) {\n    const c = text.charAt(i)\n    escaped += (c in controlCharacters) ? controlCharacters[c] : c\n    i++\n  }\n\n  return '\"' + escaped + '\"'\n}\n\nconst controlCharacters = {\n  '\"': '\\\\\"',\n  '\\\\': '\\\\\\\\',\n  '\\b': '\\\\b',\n  '\\f': '\\\\f',\n  '\\n': '\\\\n',\n  '\\r': '\\\\r',\n  '\\t': '\\\\t'\n}\n\n/**\n * Escape special HTML characters\n * @param {*} value\n * @return {string}\n */\nexport function escape (value) {\n  let text = String(value)\n  text = text.replace(/&/g, '&amp;')\n    .replace(/\"/g, '&quot;')\n    .replace(/'/g, '&#39;')\n    .replace(/</g, '&lt;')\n    .replace(/>/g, '&gt;')\n\n  return text\n}\n\n/**\n * Recursively format an n-dimensional matrix\n * Example output: \"[[1, 2], [3, 4]]\"\n * @param {Array} array\n * @param {Object | number | Function} [options]  Formatting options. See\n *                                                lib/utils/number:format for a\n *                                                description of the available\n *                                                options.\n * @returns {string} str\n */\nfunction formatArray (array, options) {\n  if (Array.isArray(array)) {\n    let str = '['\n    const len = array.length\n    for (let i = 0; i < len; i++) {\n      if (i !== 0) {\n        str += ', '\n      }\n      str += formatArray(array[i], options)\n    }\n    str += ']'\n    return str\n  } else {\n    return format(array, options)\n  }\n}\n\n/**\n * Check whether a value looks like a Fraction (unsafe duck-type check)\n * @param {*} value\n * @return {boolean}\n */\nfunction looksLikeFraction (value) {\n  return (value &&\n      typeof value === 'object' &&\n      typeof value.s === 'bigint' &&\n      typeof value.n === 'bigint' &&\n      typeof value.d === 'bigint') || false\n}\n\n/**\n * Compare two strings\n * @param {string} x\n * @param {string} y\n * @returns {number}\n */\nexport function compareText (x, y) {\n  // we don't want to convert numbers to string, only accept string input\n  if (!isString(x)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' +\n      '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)')\n  }\n  if (!isString(y)) {\n    throw new TypeError('Unexpected type of argument in function compareText ' +\n      '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)')\n  }\n\n  return (x === y)\n    ? 0\n    : (x > y ? 1 : -1)\n}\n","/**\n * Create a range error with the message:\n *     'Dimension mismatch (<actual size> != <expected size>)'\n * @param {number | number[]} actual        The actual size\n * @param {number | number[]} expected      The expected size\n * @param {string} [relation='!=']          Optional relation between actual\n *                                          and expected size: '!=', '<', etc.\n * @extends RangeError\n */\nexport function DimensionError (actual, expected, relation) {\n  if (!(this instanceof DimensionError)) {\n    throw new SyntaxError('Constructor must be called with the new operator')\n  }\n\n  this.actual = actual\n  this.expected = expected\n  this.relation = relation\n\n  this.message = 'Dimension mismatch (' +\n      (Array.isArray(actual) ? ('[' + actual.join(', ') + ']') : actual) +\n      ' ' + (this.relation || '!=') + ' ' +\n      (Array.isArray(expected) ? ('[' + expected.join(', ') + ']') : expected) +\n      ')'\n\n  this.stack = (new Error()).stack\n}\n\nDimensionError.prototype = new RangeError()\nDimensionError.prototype.constructor = RangeError\nDimensionError.prototype.name = 'DimensionError'\nDimensionError.prototype.isDimensionError = true\n","/**\n * Create a range error with the message:\n *     'Index out of range (index < min)'\n *     'Index out of range (index < max)'\n *\n * @param {number} index     The actual index\n * @param {number} [min=0]   Minimum index (included)\n * @param {number} [max]     Maximum index (excluded)\n * @extends RangeError\n */\nexport function IndexError (index, min, max) {\n  if (!(this instanceof IndexError)) {\n    throw new SyntaxError('Constructor must be called with the new operator')\n  }\n\n  this.index = index\n  if (arguments.length < 3) {\n    this.min = 0\n    this.max = min\n  } else {\n    this.min = min\n    this.max = max\n  }\n\n  if (this.min !== undefined && this.index < this.min) {\n    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')'\n  } else if (this.max !== undefined && this.index >= this.max) {\n    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')'\n  } else {\n    this.message = 'Index out of range (' + this.index + ')'\n  }\n\n  this.stack = (new Error()).stack\n}\n\nIndexError.prototype = new RangeError()\nIndexError.prototype.constructor = RangeError\nIndexError.prototype.name = 'IndexError'\nIndexError.prototype.isIndexError = true\n","import { isInteger } from './number.js'\nimport { isNumber, isBigNumber, isArray, isString } from './is.js'\nimport { format } from './string.js'\nimport { DimensionError } from '../error/DimensionError.js'\nimport { IndexError } from '../error/IndexError.js'\nimport { deepStrictEqual } from './object.js'\n\n/**\n * Calculate the size of a multi dimensional array.\n * This function checks the size of the first entry, it does not validate\n * whether all dimensions match. (use function `validate` for that)\n * @param {Array} x\n * @return {number[]} size\n */\nexport function arraySize (x) {\n  const s = []\n\n  while (Array.isArray(x)) {\n    s.push(x.length)\n    x = x[0]\n  }\n\n  return s\n}\n\n/**\n * Recursively validate whether each element in a multi dimensional array\n * has a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @param {number} dim     Current dimension\n * @throws DimensionError\n * @private\n */\nfunction _validate (array, size, dim) {\n  let i\n  const len = array.length\n\n  if (len !== size[dim]) {\n    throw new DimensionError(len, size[dim])\n  }\n\n  if (dim < size.length - 1) {\n    // recursively validate each child array\n    const dimNext = dim + 1\n    for (i = 0; i < len; i++) {\n      const child = array[i]\n      if (!Array.isArray(child)) {\n        throw new DimensionError(size.length - 1, size.length, '<')\n      }\n      _validate(array[i], size, dimNext)\n    }\n  } else {\n    // last dimension. none of the children may be an array\n    for (i = 0; i < len; i++) {\n      if (Array.isArray(array[i])) {\n        throw new DimensionError(size.length + 1, size.length, '>')\n      }\n    }\n  }\n}\n\n/**\n * Validate whether each element in a multi dimensional array has\n * a size corresponding to the provided size array.\n * @param {Array} array    Array to be validated\n * @param {number[]} size  Array with the size of each dimension\n * @throws DimensionError\n */\nexport function validate (array, size) {\n  const isScalar = (size.length === 0)\n  if (isScalar) {\n    // scalar\n    if (Array.isArray(array)) {\n      throw new DimensionError(array.length, 0)\n    }\n  } else {\n    // array\n    _validate(array, size, 0)\n  }\n}\n\n/**\n * Validate whether the source of the index matches the size of the Array\n * @param {Array | Matrix} value    Array to be validated\n * @param {Index} index  Index with the source information to validate\n * @throws DimensionError\n */\nexport function validateIndexSourceSize (value, index) {\n  const valueSize = value.isMatrix ? value._size : arraySize(value)\n  const sourceSize = index._sourceSize\n  // checks if the source size is not null and matches the valueSize\n  sourceSize.forEach((sourceDim, i) => {\n    if (sourceDim !== null && sourceDim !== valueSize[i]) { throw new DimensionError(sourceDim, valueSize[i]) }\n  })\n}\n\n/**\n * Test whether index is an integer number with index >= 0 and index < length\n * when length is provided\n * @param {number} index    Zero-based index\n * @param {number} [length] Length of the array\n */\nexport function validateIndex (index, length) {\n  if (index !== undefined) {\n    if (!isNumber(index) || !isInteger(index)) {\n      throw new TypeError('Index must be an integer (value: ' + index + ')')\n    }\n    if (index < 0 || (typeof length === 'number' && index >= length)) {\n      throw new IndexError(index, length)\n    }\n  }\n}\n\n/**\n * Test if an index has empty values\n * @param {Index} index    Zero-based index\n */\nexport function isEmptyIndex (index) {\n  for (let i = 0; i < index._dimensions.length; ++i) {\n    const dimension = index._dimensions[i]\n    if (dimension._data && isArray(dimension._data)) {\n      if (dimension._size[0] === 0) {\n        return true\n      }\n    } else if (dimension.isRange) {\n      if (dimension.start === dimension.end) {\n        return true\n      }\n    } else if (isString(dimension)) {\n      if (dimension.length === 0) {\n        return true\n      }\n    }\n  }\n  return false\n}\n\n/**\n * Resize a multi dimensional array. The resized array is returned.\n * @param {Array | number} array         Array to be resized\n * @param {number[]} size Array with the size of each dimension\n * @param {*} [defaultValue=0]  Value to be filled in new entries,\n *                              zero by default. Specify for example `null`,\n *                              to clearly see entries that are not explicitly\n *                              set.\n * @return {Array} array         The resized array\n */\nexport function resize (array, size, defaultValue) {\n  // check the type of the arguments\n  if (!Array.isArray(size)) {\n    throw new TypeError('Array expected')\n  }\n  if (size.length === 0) {\n    throw new Error('Resizing to scalar is not supported')\n  }\n\n  // check whether size contains positive integers\n  size.forEach(function (value) {\n    if (!isNumber(value) || !isInteger(value) || value < 0) {\n      throw new TypeError('Invalid size, must contain positive integers ' +\n        '(size: ' + format(size) + ')')\n    }\n  })\n\n  // convert number to an array\n  if (isNumber(array) || isBigNumber(array)) {\n    array = [array]\n  }\n\n  // recursively resize the array\n  const _defaultValue = (defaultValue !== undefined) ? defaultValue : 0\n  _resize(array, size, 0, _defaultValue)\n\n  return array\n}\n\n/**\n * Recursively resize a multi dimensional array\n * @param {Array} array         Array to be resized\n * @param {number[]} size       Array with the size of each dimension\n * @param {number} dim          Current dimension\n * @param {*} [defaultValue]    Value to be filled in new entries,\n *                              undefined by default.\n * @private\n */\nfunction _resize (array, size, dim, defaultValue) {\n  let i\n  let elem\n  const oldLen = array.length\n  const newLen = size[dim]\n  const minLen = Math.min(oldLen, newLen)\n\n  // apply new length\n  array.length = newLen\n\n  if (dim < size.length - 1) {\n    // non-last dimension\n    const dimNext = dim + 1\n\n    // resize existing child arrays\n    for (i = 0; i < minLen; i++) {\n      // resize child array\n      elem = array[i]\n      if (!Array.isArray(elem)) {\n        elem = [elem] // add a dimension\n        array[i] = elem\n      }\n      _resize(elem, size, dimNext, defaultValue)\n    }\n\n    // create new child arrays\n    for (i = minLen; i < newLen; i++) {\n      // get child array\n      elem = []\n      array[i] = elem\n\n      // resize new child array\n      _resize(elem, size, dimNext, defaultValue)\n    }\n  } else {\n    // last dimension\n\n    // remove dimensions of existing values\n    for (i = 0; i < minLen; i++) {\n      while (Array.isArray(array[i])) {\n        array[i] = array[i][0]\n      }\n    }\n\n    // fill new elements with the default value\n    for (i = minLen; i < newLen; i++) {\n      array[i] = defaultValue\n    }\n  }\n}\n\n/**\n * Re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes        List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n *\n * @throws {DimensionError}       If the product of the new dimension sizes does\n *                                not equal that of the old ones\n */\nexport function reshape (array, sizes) {\n  const flatArray = flatten(array, true) // since it has rectangular\n  const currentLength = flatArray.length\n\n  if (!Array.isArray(array) || !Array.isArray(sizes)) {\n    throw new TypeError('Array expected')\n  }\n\n  if (sizes.length === 0) {\n    throw new DimensionError(0, currentLength, '!=')\n  }\n\n  sizes = processSizesWildcard(sizes, currentLength)\n  const newLength = product(sizes)\n  if (currentLength !== newLength) {\n    throw new DimensionError(\n      newLength,\n      currentLength,\n      '!='\n    )\n  }\n\n  try {\n    return _reshape(flatArray, sizes)\n  } catch (e) {\n    if (e instanceof DimensionError) {\n      throw new DimensionError(\n        newLength,\n        currentLength,\n        '!='\n      )\n    }\n    throw e\n  }\n}\n\n/**\n * Replaces the wildcard -1 in the sizes array.\n * @param {number[]} sizes  List of sizes for each dimension. At most one wildcard.\n * @param {number} currentLength  Number of elements in the array.\n * @throws {Error}                If more than one wildcard or unable to replace it.\n * @returns {number[]}      The sizes array with wildcard replaced.\n */\nexport function processSizesWildcard (sizes, currentLength) {\n  const newLength = product(sizes)\n  const processedSizes = sizes.slice()\n  const WILDCARD = -1\n  const wildCardIndex = sizes.indexOf(WILDCARD)\n\n  const isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0\n  if (isMoreThanOneWildcard) {\n    throw new Error('More than one wildcard in sizes')\n  }\n\n  const hasWildcard = wildCardIndex >= 0\n  const canReplaceWildcard = currentLength % newLength === 0\n\n  if (hasWildcard) {\n    if (canReplaceWildcard) {\n      processedSizes[wildCardIndex] = -currentLength / newLength\n    } else {\n      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + (-newLength))\n    }\n  }\n  return processedSizes\n}\n\n/**\n * Computes the product of all array elements.\n * @param {number[]} array Array of factors\n * @returns {number}            Product of all elements\n */\nfunction product (array) {\n  return array.reduce((prev, curr) => prev * curr, 1)\n}\n\n/**\n * Iteratively re-shape a multi dimensional array to fit the specified dimensions\n * @param {Array} array           Array to be reshaped\n * @param {number[]} sizes  List of sizes for each dimension\n * @returns {Array}               Array whose data has been formatted to fit the\n *                                specified dimensions\n */\n\nfunction _reshape (array, sizes) {\n  // testing if there are enough elements for the requested shape\n  let tmpArray = array\n  let tmpArray2\n  // for each dimension starting by the last one and ignoring the first one\n  for (let sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {\n    const size = sizes[sizeIndex]\n    tmpArray2 = []\n\n    // aggregate the elements of the current tmpArray in elements of the requested size\n    const length = tmpArray.length / size\n    for (let i = 0; i < length; i++) {\n      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size))\n    }\n    // set it as the new tmpArray for the next loop turn or for return\n    tmpArray = tmpArray2\n  }\n\n  return tmpArray\n}\n\n/**\n * Squeeze a multi dimensional array\n * @param {Array} array\n * @param {Array} [size]\n * @returns {Array} returns the array itself\n */\nexport function squeeze (array, size) {\n  const s = size || arraySize(array)\n\n  // squeeze outer dimensions\n  while (Array.isArray(array) && array.length === 1) {\n    array = array[0]\n    s.shift()\n  }\n\n  // find the first dimension to be squeezed\n  let dims = s.length\n  while (s[dims - 1] === 1) {\n    dims--\n  }\n\n  // squeeze inner dimensions\n  if (dims < s.length) {\n    array = _squeeze(array, dims, 0)\n    s.length = dims\n  }\n\n  return array\n}\n\n/**\n * Recursively squeeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the squeezed array\n * @private\n */\nfunction _squeeze (array, dims, dim) {\n  let i, ii\n\n  if (dim < dims) {\n    const next = dim + 1\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _squeeze(array[i], dims, next)\n    }\n  } else {\n    while (Array.isArray(array)) {\n      array = array[0]\n    }\n  }\n\n  return array\n}\n\n/**\n * Unsqueeze a multi dimensional array: add dimensions when missing\n *\n * Parameter `size` will be mutated to match the new, unsqueezed matrix size.\n *\n * @param {Array} array\n * @param {number} dims       Desired number of dimensions of the array\n * @param {number} [outer]    Number of outer dimensions to be added\n * @param {Array} [size] Current size of array.\n * @returns {Array} returns the array itself\n * @private\n */\nexport function unsqueeze (array, dims, outer, size) {\n  const s = size || arraySize(array)\n\n  // unsqueeze outer dimensions\n  if (outer) {\n    for (let i = 0; i < outer; i++) {\n      array = [array]\n      s.unshift(1)\n    }\n  }\n\n  // unsqueeze inner dimensions\n  array = _unsqueeze(array, dims, 0)\n  while (s.length < dims) {\n    s.push(1)\n  }\n\n  return array\n}\n\n/**\n * Recursively unsqueeze a multi dimensional array\n * @param {Array} array\n * @param {number} dims Required number of dimensions\n * @param {number} dim  Current dimension\n * @returns {Array | *} Returns the unsqueezed array\n * @private\n */\nfunction _unsqueeze (array, dims, dim) {\n  let i, ii\n\n  if (Array.isArray(array)) {\n    const next = dim + 1\n    for (i = 0, ii = array.length; i < ii; i++) {\n      array[i] = _unsqueeze(array[i], dims, next)\n    }\n  } else {\n    for (let d = dim; d < dims; d++) {\n      array = [array]\n    }\n  }\n\n  return array\n}\n/**\n * Flatten a multi dimensional array, put all elements in a one dimensional\n * array\n * @param {Array} array   A multi dimensional array\n * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)\n * @return {Array}        The flattened array (1 dimensional)\n */\nexport function flatten (array, isRectangular = false) {\n  if (!Array.isArray(array)) {\n    // if not an array, return as is\n    return array\n  }\n  if (typeof isRectangular !== 'boolean') {\n    throw new TypeError('Boolean expected for second argument of flatten')\n  }\n  const flat = []\n\n  if (isRectangular) {\n    _flattenRectangular(array)\n  } else {\n    _flatten(array)\n  }\n\n  return flat\n\n  function _flatten (array) {\n    for (let i = 0; i < array.length; i++) {\n      const item = array[i]\n      if (Array.isArray(item)) {\n        _flatten(item)\n      } else {\n        flat.push(item)\n      }\n    }\n  }\n\n  function _flattenRectangular (array) {\n    if (Array.isArray(array[0])) {\n      for (let i = 0; i < array.length; i++) {\n        _flattenRectangular(array[i])\n      }\n    } else {\n      for (let i = 0; i < array.length; i++) {\n        flat.push(array[i])\n      }\n    }\n  }\n}\n\n/**\n * A safe map\n * @param {Array} array\n * @param {function} callback\n */\nexport function map (array, callback) {\n  return Array.prototype.map.call(array, callback)\n}\n\n/**\n * A safe forEach\n * @param {Array} array\n * @param {function} callback\n */\nexport function forEach (array, callback) {\n  Array.prototype.forEach.call(array, callback)\n}\n\n/**\n * A safe filter\n * @param {Array} array\n * @param {function} callback\n */\nexport function filter (array, callback) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported')\n  }\n\n  return Array.prototype.filter.call(array, callback)\n}\n\n/**\n * Filter values in an array given a regular expression\n * @param {Array} array\n * @param {RegExp} regexp\n * @return {Array} Returns the filtered array\n * @private\n */\nexport function filterRegExp (array, regexp) {\n  if (arraySize(array).length !== 1) {\n    throw new Error('Only one dimensional matrices supported')\n  }\n\n  return Array.prototype.filter.call(array, (entry) => regexp.test(entry))\n}\n\n/**\n * A safe join\n * @param {Array} array\n * @param {string} separator\n */\nexport function join (array, separator) {\n  return Array.prototype.join.call(array, separator)\n}\n\n/**\n * Assign a numeric identifier to every element of a sorted array\n * @param {Array} a  An array\n * @return {Array} An array of objects containing the original value and its identifier\n */\nexport function identify (a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected')\n  }\n\n  if (a.length === 0) {\n    return a\n  }\n\n  const b = []\n  let count = 0\n  b[0] = { value: a[0], identifier: 0 }\n  for (let i = 1; i < a.length; i++) {\n    if (a[i] === a[i - 1]) {\n      count++\n    } else {\n      count = 0\n    }\n    b.push({ value: a[i], identifier: count })\n  }\n  return b\n}\n\n/**\n * Remove the numeric identifier from the elements\n * @param {array} a  An array\n * @return {array} An array of values without identifiers\n */\nexport function generalize (a) {\n  if (!Array.isArray(a)) {\n    throw new TypeError('Array input expected')\n  }\n\n  if (a.length === 0) {\n    return a\n  }\n\n  const b = []\n  for (let i = 0; i < a.length; i++) {\n    b.push(a[i].value)\n  }\n  return b\n}\n\n/**\n * Check the datatype of a given object\n * This is a low level implementation that should only be used by\n * parent Matrix classes such as SparseMatrix or DenseMatrix\n * This method does not validate Array Matrix shape\n * @param {Array} array\n * @param {function} typeOf   Callback function to use to determine the type of a value\n * @return {string}\n */\nexport function getArrayDataType (array, typeOf) {\n  let type // to hold type info\n  let length = 0 // to hold length value to ensure it has consistent sizes\n\n  for (let i = 0; i < array.length; i++) {\n    const item = array[i]\n    const isArray = Array.isArray(item)\n\n    // Saving the target matrix row size\n    if (i === 0 && isArray) {\n      length = item.length\n    }\n\n    // If the current item is an array but the length does not equal the targetVectorSize\n    if (isArray && item.length !== length) {\n      return undefined\n    }\n\n    const itemType = isArray\n      ? getArrayDataType(item, typeOf) // recurse into a nested array\n      : typeOf(item)\n\n    if (type === undefined) {\n      type = itemType // first item\n    } else if (type !== itemType) {\n      return 'mixed'\n    } else {\n      // we're good, everything has the same type so far\n    }\n  }\n\n  return type\n}\n\n/**\n * Return the last item from an array\n * @param {Array} array\n * @returns {*}\n */\nexport function last (array) {\n  return array[array.length - 1]\n}\n\n/**\n * Get all but the last element of array.\n * @param {Array} array\n * @returns {Array}\n */\nexport function initial (array) {\n  return array.slice(0, array.length - 1)\n}\n\n/**\n * Recursively concatenate two matrices.\n * The contents of the matrices are not cloned.\n * @param {Array} a             Multi dimensional array\n * @param {Array} b             Multi dimensional array\n * @param {number} concatDim    The dimension on which to concatenate (zero-based)\n * @param {number} dim          The current dim (zero-based)\n * @return {Array} c            The concatenated matrix\n * @private\n */\nfunction concatRecursive (a, b, concatDim, dim) {\n  if (dim < concatDim) {\n    // recurse into next dimension\n    if (a.length !== b.length) {\n      throw new DimensionError(a.length, b.length)\n    }\n\n    const c = []\n    for (let i = 0; i < a.length; i++) {\n      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1)\n    }\n    return c\n  } else {\n    // concatenate this dimension\n    return a.concat(b)\n  }\n}\n\n/**\n * Concatenates many arrays in the specified direction\n * @param {...Array} arrays All the arrays to concatenate\n * @param {number} concatDim The dimension on which to concatenate (zero-based)\n * @returns {Array}\n */\nexport function concat () {\n  const arrays = Array.prototype.slice.call(arguments, 0, -1)\n  const concatDim = Array.prototype.slice.call(arguments, -1)\n\n  if (arrays.length === 1) {\n    return arrays[0]\n  }\n  if (arrays.length > 1) {\n    return arrays.slice(1).reduce(function (A, B) { return concatRecursive(A, B, concatDim, 0) }, arrays[0])\n  } else {\n    throw new Error('Wrong number of arguments in function concat')\n  }\n}\n\n/**\n * Receives two or more sizes and gets the broadcasted size for both.\n * @param  {...number[]} sizes Sizes to broadcast together\n * @returns {number[]} The broadcasted size\n */\nexport function broadcastSizes (...sizes) {\n  const dimensions = sizes.map((s) => s.length)\n  const N = Math.max(...dimensions)\n  const sizeMax = new Array(N).fill(null)\n  // check for every size\n  for (let i = 0; i < sizes.length; i++) {\n    const size = sizes[i]\n    const dim = dimensions[i]\n    for (let j = 0; j < dim; j++) {\n      const n = N - dim + j\n      if (size[j] > sizeMax[n]) {\n        sizeMax[n] = size[j]\n      }\n    }\n  }\n  for (let i = 0; i < sizes.length; i++) {\n    checkBroadcastingRules(sizes[i], sizeMax)\n  }\n  return sizeMax\n}\n\n/**\n * Checks if it's possible to broadcast a size to another size\n * @param {number[]} size The size of the array to check\n * @param {number[]} toSize The size of the array to validate if it can be broadcasted to\n */\nexport function checkBroadcastingRules (size, toSize) {\n  const N = toSize.length\n  const dim = size.length\n  for (let j = 0; j < dim; j++) {\n    const n = N - dim + j\n    if ((size[j] < toSize[n] && size[j] > 1) || (size[j] > toSize[n])) {\n      throw new Error(\n        `shape mismatch: mismatch is found in arg with shape (${size}) not possible to broadcast dimension ${dim} with size ${size[j]} to size ${toSize[n]}`\n      )\n    }\n  }\n}\n\n/**\n * Broadcasts a single array to a certain size\n * @param {Array} array Array to be broadcasted\n * @param {number[]} toSize Size to broadcast the array\n * @returns {Array} The broadcasted array\n */\nexport function broadcastTo (array, toSize) {\n  let Asize = arraySize(array)\n  if (deepStrictEqual(Asize, toSize)) {\n    return array\n  }\n  checkBroadcastingRules(Asize, toSize)\n  const broadcastedSize = broadcastSizes(Asize, toSize)\n  const N = broadcastedSize.length\n  const paddedSize = [...Array(N - Asize.length).fill(1), ...Asize]\n\n  let A = clone(array)\n  // reshape A if needed to make it ready for concat\n  if (Asize.length < N) {\n    A = reshape(A, paddedSize)\n    Asize = arraySize(A)\n  }\n\n  // stretches the array on each dimension to make it the same size as index\n  for (let dim = 0; dim < N; dim++) {\n    if (Asize[dim] < broadcastedSize[dim]) {\n      A = stretch(A, broadcastedSize[dim], dim)\n      Asize = arraySize(A)\n    }\n  }\n  return A\n}\n\n/**\n * Broadcasts arrays and returns the broadcasted arrays in an array\n * @param  {...Array | any} arrays\n * @returns {Array[]} The broadcasted arrays\n */\nexport function broadcastArrays (...arrays) {\n  if (arrays.length === 0) {\n    throw new Error('Insufficient number of arguments in function broadcastArrays')\n  }\n  if (arrays.length === 1) {\n    return arrays[0]\n  }\n  const sizes = arrays.map(function (array) { return arraySize(array) })\n  const broadcastedSize = broadcastSizes(...sizes)\n  const broadcastedArrays = []\n  arrays.forEach(function (array) { broadcastedArrays.push(broadcastTo(array, broadcastedSize)) })\n  return broadcastedArrays\n}\n\n/**\n * Stretches a matrix up to a certain size in a certain dimension\n * @param {Array} arrayToStretch\n * @param {number[]} sizeToStretch\n * @param {number} dimToStretch\n * @returns {Array} The stretched array\n */\nexport function stretch (arrayToStretch, sizeToStretch, dimToStretch) {\n  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch)\n}\n\n/**\n* Retrieves a single element from an array given an index.\n*\n* @param {Array} array - The array from which to retrieve the value.\n* @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.\n* @returns {*} - The value at the specified position in the array.\n*\n* @example\n* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];\n* const index = [1, 0, 1];\n* console.log(get(arr, index)); // 6\n*/\nexport function get (array, index) {\n  if (!Array.isArray(array)) { throw new Error('Array expected') }\n  const size = arraySize(array)\n  if (index.length !== size.length) { throw new DimensionError(index.length, size.length) }\n  for (let x = 0; x < index.length; x++) { validateIndex(index[x], size[x]) }\n  return index.reduce((acc, curr) => acc[curr], array)\n}\n\n/**\n * Recursively maps over each element of nested array using a provided callback function.\n *\n * @param {Array} array - The array to be mapped.\n * @param {Function} callback - The function to execute on each element, taking three arguments:\n *   - `value` (any): The current element being processed in the array.\n *   - `index` (Array<number>): The index of the current element being processed in the array.\n *   - `array` (Array): The array `deepMap` was called upon.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n * @returns {Array} A new array with each element being the result of the callback function.\n */\nexport function deepMap (array, callback, skipIndex = false) {\n  if (array.length === 0) {\n    return []\n  }\n\n  if (skipIndex) {\n    return recursiveMap(array)\n  }\n  const index = []\n\n  return recursiveMapWithIndex(array, 0)\n\n  function recursiveMapWithIndex (value, depth) {\n    if (Array.isArray(value)) {\n      const N = value.length\n      const result = Array(N)\n      for (let i = 0; i < N; i++) {\n        index[depth] = i\n        result[i] = recursiveMapWithIndex(value[i], depth + 1)\n      }\n      return result\n    } else {\n      return callback(value, index.slice(0, depth), array)\n    }\n  }\n  function recursiveMap (value) {\n    if (Array.isArray(value)) {\n      const N = value.length\n      const result = Array(N)\n      for (let i = 0; i < N; i++) {\n        result[i] = recursiveMap(value[i])\n      }\n      return result\n    } else {\n      return callback(value)\n    }\n  }\n}\n\n/**\n * Recursively iterates over each element in a multi-dimensional array and applies a callback function.\n *\n * @param {Array} array - The multi-dimensional array to iterate over.\n * @param {Function} callback - The function to execute for each element. It receives three arguments:\n *   - {any} value: The current element being processed in the array.\n *   - {Array<number>} index: The index of the current element in each dimension.\n *   - {Array} array: The original array being processed.\n * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.\n */\nexport function deepForEach (array, callback, skipIndex = false) {\n  if (array.length === 0) {\n    return\n  }\n\n  if (skipIndex) {\n    recursiveForEach(array)\n    return\n  }\n  const index = []\n  recursiveForEachWithIndex(array, 0)\n\n  function recursiveForEachWithIndex (value, depth) {\n    if (Array.isArray(value)) {\n      const N = value.length\n      for (let i = 0; i < N; i++) {\n        index[depth] = i\n        recursiveForEachWithIndex(value[i], depth + 1)\n      }\n    } else {\n      callback(value, index.slice(0, depth), array)\n    }\n  }\n  function recursiveForEach (value) {\n    if (Array.isArray(value)) {\n      const N = value.length\n      for (let i = 0; i < N; i++) {\n        recursiveForEach(value[i])\n      }\n    } else {\n      callback(value)\n    }\n  }\n}\n\n/**\n * Deep clones a multidimensional array\n * @param {Array} array\n * @returns {Array} cloned array\n */\nexport function clone (array) {\n  return Object.assign([], array)\n}\n","import typed from 'typed-function'\nimport { get, arraySize } from './array.js'\nimport { typeOf as _typeOf } from './is.js'\n\n/**\n * Simplifies a callback function by reducing its complexity and potentially improving its performance.\n *\n * @param {Function} callback The original callback function to simplify.\n * @param {Array|Matrix} array The array that will be used with the callback function.\n * @param {string} name The name of the function that is using the callback.\n * @param {boolean} isUnary If true, the callback function is unary and will be optimized as such.\n * @returns {Function} Returns a simplified version of the callback function.\n */\nexport function optimizeCallback (callback, array, name, isUnary) {\n  if (typed.isTypedFunction(callback)) {\n    let numberOfArguments\n    if (isUnary) {\n      numberOfArguments = 1\n    } else {\n      const firstIndex = (array.isMatrix ? array.size() : arraySize(array)).map(() => 0)\n      const firstValue = array.isMatrix ? array.get(firstIndex) : get(array, firstIndex)\n      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array)\n    }\n    let fastCallback\n    if (array.isMatrix && (array.dataType !== 'mixed' && array.dataType !== undefined)) {\n      const singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments)\n      fastCallback = (singleSignature !== undefined) ? singleSignature : callback\n    } else {\n      fastCallback = callback\n    }\n    if (numberOfArguments >= 1 && numberOfArguments <= 3) {\n      return {\n        isUnary: numberOfArguments === 1,\n        fn: (...args) => _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name)\n      }\n    }\n    return { isUnary: false, fn: (...args) => _tryFunctionWithArgs(fastCallback, args, name, callback.name) }\n  }\n  if (isUnary === undefined) {\n    return { isUnary: _findIfCallbackIsUnary(callback), fn: callback }\n  } else {\n    return { isUnary, fn: callback }\n  }\n}\n\nfunction _findSingleSignatureWithArity (callback, arity) {\n  const matchingFunctions = []\n  Object.entries(callback.signatures).forEach(([signature, func]) => {\n    if (signature.split(',').length === arity) {\n      matchingFunctions.push(func)\n    }\n  })\n  if (matchingFunctions.length === 1) {\n    return matchingFunctions[0]\n  }\n}\n\n/**\n * Determines if a given callback function is unary (i.e., takes exactly one argument).\n *\n * This function checks the following conditions to determine if the callback is unary:\n * 1. The callback function should have exactly one parameter.\n * 2. The callback function should not use the `arguments` object.\n * 3. The callback function should not use rest parameters (`...`).\n * If in doubt, this function shall return `false` to be safe\n *\n * @param {Function} callback - The callback function to be checked.\n * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.\n */\nfunction _findIfCallbackIsUnary (callback) {\n  if (callback.length !== 1) return false\n\n  const callbackStr = callback.toString()\n  // Check if the callback function uses `arguments`\n  if (/arguments/.test(callbackStr)) return false\n\n  // Extract the parameters of the callback function\n  const paramsStr = callbackStr.match(/\\(.*?\\)/)\n  // Check if the callback function uses rest parameters\n  if (/\\.\\.\\./.test(paramsStr)) return false\n  return true\n}\n\nfunction _findNumberOfArgumentsTyped (callback, value, index, array) {\n  const testArgs = [value, index, array]\n  for (let i = 3; i > 0; i--) {\n    const args = testArgs.slice(0, i)\n    if (typed.resolve(callback, args) !== null) {\n      return i\n    }\n  }\n}\n\n/**\n   * @param {function} func The selected function taken from one of the signatures of the callback function\n   * @param {Array} args List with arguments to apply to the selected signature\n   * @param {string} mappingFnName the name of the function that is using the callback\n   * @param {string} callbackName the name of the callback function\n   * @returns {*} Returns the return value of the invoked signature\n   * @throws {TypeError} Throws an error when no matching signature was found\n   */\nfunction _tryFunctionWithArgs (func, args, mappingFnName, callbackName) {\n  try {\n    return func(...args)\n  } catch (err) {\n    _createCallbackError(err, args, mappingFnName, callbackName)\n  }\n}\n\n/**\n * Creates and throws a detailed TypeError when a callback function fails.\n *\n * @param {Error} err The original error thrown by the callback function.\n * @param {Array} args The arguments that were passed to the callback function.\n * @param {string} mappingFnName The name of the function that is using the callback.\n * @param {string} callbackName The name of the callback function.\n * @throws {TypeError} Throws a detailed TypeError with enriched error message.\n */\nfunction _createCallbackError (err, args, mappingFnName, callbackName) {\n  // Enrich the error message so the user understands that it took place inside the callback function\n  if (err instanceof TypeError && err.data?.category === 'wrongType') {\n    const argsDesc = []\n    argsDesc.push(`value: ${_typeOf(args[0])}`)\n    if (args.length >= 2) { argsDesc.push(`index: ${_typeOf(args[1])}`) }\n    if (args.length >= 3) { argsDesc.push(`array: ${_typeOf(args[2])}`) }\n\n    throw new TypeError(`Function ${mappingFnName} cannot apply callback arguments ` +\n      `${callbackName}(${argsDesc.join(', ')}) at index ${JSON.stringify(args[1])}`)\n  } else {\n    throw new TypeError(`Function ${mappingFnName} cannot apply callback arguments ` +\n      `to function ${callbackName}: ${err.message}`)\n  }\n}\n","// deno-lint-ignore-file no-this-alias\nimport { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js'\nimport { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo, get } from '../../utils/array.js'\nimport { format } from '../../utils/string.js'\nimport { isInteger } from '../../utils/number.js'\nimport { clone, deepStrictEqual } from '../../utils/object.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { factory } from '../../utils/factory.js'\nimport { optimizeCallback } from '../../utils/optimizeCallback.js'\n\nconst name = 'DenseMatrix'\nconst dependencies = [\n  'Matrix'\n]\n\nexport const createDenseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ Matrix }) => {\n  /**\n   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.\n   * @class DenseMatrix\n   * @enum {{ value, index: number[] }}\n   */\n  function DenseMatrix (data, datatype) {\n    if (!(this instanceof DenseMatrix)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { throw new Error('Invalid datatype: ' + datatype) }\n\n    if (isMatrix(data)) {\n      // check data is a DenseMatrix\n      if (data.type === 'DenseMatrix') {\n        // clone data & size\n        this._data = clone(data._data)\n        this._size = clone(data._size)\n        this._datatype = datatype || data._datatype\n      } else {\n        // build data from existing matrix\n        this._data = data.toArray()\n        this._size = data.size()\n        this._datatype = datatype || data._datatype\n      }\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data\n      this._size = data.size\n      // verify the dimensions of the array\n      validate(this._data, this._size)\n      this._datatype = datatype || data.datatype\n    } else if (isArray(data)) {\n      // replace nested Matrices with Arrays\n      this._data = preprocess(data)\n      // get the dimensions of the array\n      this._size = arraySize(this._data)\n      // verify the dimensions of the array, TODO: compute size while processing array\n      validate(this._data, this._size)\n      // data type unknown\n      this._datatype = datatype\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')')\n    } else {\n      // nothing provided\n      this._data = []\n      this._size = [0]\n      this._datatype = datatype\n    }\n  }\n\n  DenseMatrix.prototype = new Matrix()\n\n  /**\n   * Create a new DenseMatrix\n   */\n  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {\n    return new DenseMatrix(data, datatype)\n  }\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(DenseMatrix, 'name', { value: 'DenseMatrix' })\n  DenseMatrix.prototype.constructor = DenseMatrix\n  DenseMatrix.prototype.type = 'DenseMatrix'\n  DenseMatrix.prototype.isDenseMatrix = true\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf DenseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  DenseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._data, typeOf)\n  }\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()  // retrieve storage format\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The storage format.\n   */\n  DenseMatrix.prototype.storage = function () {\n    return 'dense'\n  }\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()   // retrieve matrix datatype\n   *\n   * @memberof DenseMatrix\n   * @return {string}           The datatype.\n   */\n  DenseMatrix.prototype.datatype = function () {\n    return this._datatype\n  }\n\n  /**\n   * Create a new DenseMatrix\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  DenseMatrix.prototype.create = function (data, datatype) {\n    return new DenseMatrix(data, datatype)\n  }\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof DenseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {\n    switch (arguments.length) {\n      case 1:\n        return _get(this, index)\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _set(this, index, replacement, defaultValue)\n\n      default:\n        throw new SyntaxError('Wrong number of arguments')\n    }\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  DenseMatrix.prototype.get = function (index) {\n    return get(this._data, index)\n  }\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof DenseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {DenseMatrix} self\n   */\n  DenseMatrix.prototype.set = function (index, value, defaultValue) {\n    if (!isArray(index)) { throw new TypeError('Array expected') }\n    if (index.length < this._size.length) { throw new DimensionError(index.length, this._size.length, '<') }\n\n    let i, ii, indexI\n\n    // enlarge matrix when needed\n    const size = index.map(function (i) {\n      return i + 1\n    })\n    _fit(this, size, defaultValue)\n\n    // traverse over the dimensions\n    let data = this._data\n    for (i = 0, ii = index.length - 1; i < ii; i++) {\n      indexI = index[i]\n      validateIndex(indexI, data.length)\n      data = data[indexI]\n    }\n\n    // set new value\n    indexI = index[index.length - 1]\n    validateIndex(indexI, data.length)\n    data[indexI] = value\n\n    return this\n  }\n\n  /**\n   * Get a submatrix of this matrix\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index   Zero-based index\n   * @private\n   */\n  function _get (matrix, index) {\n    if (!isIndex(index)) {\n      throw new TypeError('Invalid index')\n    }\n\n    const isScalar = index.isScalar()\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(index.min())\n    } else {\n      // validate dimensions\n      const size = index.size()\n      if (size.length !== matrix._size.length) {\n        throw new DimensionError(size.length, matrix._size.length)\n      }\n\n      // validate if any of the ranges in the index is out of range\n      const min = index.min()\n      const max = index.max()\n      for (let i = 0, ii = matrix._size.length; i < ii; i++) {\n        validateIndex(min[i], matrix._size[i])\n        validateIndex(max[i], matrix._size[i])\n      }\n\n      // retrieve submatrix\n      const returnMatrix = new DenseMatrix([])\n      const submatrix = _getSubmatrix(matrix._data, index)\n      returnMatrix._size = submatrix.size\n      returnMatrix._datatype = matrix._datatype\n      returnMatrix._data = submatrix.data\n      return returnMatrix\n    }\n  }\n\n  /**\n   * Get a submatrix of a multi dimensional matrix.\n   * Index is not checked for correct number or length of dimensions.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @return {Array} submatrix\n   * @private\n   */\n  function _getSubmatrix (data, index) {\n    const maxDepth = index.size().length - 1\n    const size = Array(maxDepth)\n    return { data: getSubmatrixRecursive(data), size }\n\n    function getSubmatrixRecursive (data, depth = 0) {\n      const ranges = index.dimension(depth)\n      size[depth] = ranges.size()[0]\n      if (depth < maxDepth) {\n        return ranges.map(rangeIndex => {\n          validateIndex(rangeIndex, data.length)\n          return getSubmatrixRecursive(data[rangeIndex], depth + 1)\n        }).valueOf()\n      } else {\n        return ranges.map(rangeIndex => {\n          validateIndex(rangeIndex, data.length)\n          return data[rangeIndex]\n        }).valueOf()\n      }\n    }\n  }\n\n  /**\n   * Replace a submatrix in this matrix\n   * Indexes are zero-based.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix\n   * @param {Index} index\n   * @param {DenseMatrix | Array | *} submatrix\n   * @param {*} defaultValue          Default value, filled in on new entries when\n   *                                  the matrix is resized.\n   * @return {DenseMatrix} matrix\n   * @private\n   */\n  function _set (matrix, index, submatrix, defaultValue) {\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index')\n    }\n\n    // get index size and check whether the index contains a single value\n    const iSize = index.size()\n    const isScalar = index.isScalar()\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    let sSize\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size()\n      submatrix = submatrix.valueOf()\n    } else {\n      sSize = arraySize(submatrix)\n    }\n\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected')\n      }\n      matrix.set(index.min(), submatrix, defaultValue)\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(sSize, iSize)) {\n        try {\n          if (sSize.length === 0) {\n            submatrix = broadcastTo([submatrix], iSize)\n          } else {\n            submatrix = broadcastTo(submatrix, iSize)\n          }\n          sSize = arraySize(submatrix)\n        } catch {\n        }\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<')\n      }\n\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        let i = 0\n        let outer = 0\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++\n        }\n        while (iSize[i] === 1) {\n          outer++\n          i++\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize)\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>')\n      }\n\n      // enlarge matrix when needed\n      const size = index.max().map(function (i) {\n        return i + 1\n      })\n      _fit(matrix, size, defaultValue)\n\n      // insert the sub matrix\n      _setSubmatrix(matrix._data, index, submatrix)\n    }\n\n    return matrix\n  }\n\n  /**\n   * Replace a submatrix of a multi dimensional matrix.\n   * @memberof DenseMatrix\n   * @param {Array} data\n   * @param {Index} index\n   * @param {Array} submatrix\n   * @private\n   */\n  function _setSubmatrix (data, index, submatrix) {\n    const maxDepth = index.size().length - 1\n\n    setSubmatrixRecursive(data, submatrix)\n\n    function setSubmatrixRecursive (data, submatrix, depth = 0) {\n      const range = index.dimension(depth)\n      if (depth < maxDepth) {\n        range.forEach((rangeIndex, i) => {\n          validateIndex(rangeIndex, data.length)\n          setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1)\n        })\n      } else {\n        range.forEach((rangeIndex, i) => {\n          validateIndex(rangeIndex, data.length)\n          data[rangeIndex] = submatrix[i[0]]\n        })\n      }\n    }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof DenseMatrix\n   * @param {number[] || Matrix} size The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected')\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    const sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1\n        ? value[0]\n        : value\n    })\n\n    // matrix to resize\n    const m = copy ? this.clone() : this\n    // resize matrix\n    return _resize(m, sizeArray, defaultValue)\n  }\n\n  function _resize (matrix, size, defaultValue) {\n    // check size\n    if (size.length === 0) {\n      // first value in matrix\n      let v = matrix._data\n      // go deep\n      while (isArray(v)) {\n        v = v[0]\n      }\n      return v\n    }\n    // resize matrix\n    matrix._size = size.slice(0) // copy the array\n    matrix._data = resize(matrix._data, matrix._size, defaultValue)\n    // return matrix\n    return matrix\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof DenseMatrix\n   * @param {number[]} size           The new size the matrix should have.\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  DenseMatrix.prototype.reshape = function (size, copy) {\n    const m = copy ? this.clone() : this\n\n    m._data = reshape(m._data, size)\n    const currentLength = m._size.reduce((length, size) => length * size)\n    m._size = processSizesWildcard(size, currentLength)\n    return m\n  }\n\n  /**\n   * Enlarge the matrix when it is smaller than given size.\n   * If the matrix is larger or equal sized, nothing is done.\n   * @memberof DenseMatrix\n   * @param {DenseMatrix} matrix           The matrix to be resized\n   * @param {number[]} size\n   * @param {*} defaultValue          Default value, filled in on new entries.\n   * @private\n   */\n  function _fit (matrix, size, defaultValue) {\n    const // copy the array\n      newSize = matrix._size.slice(0)\n\n    let changed = false\n\n    // add dimensions when needed\n    while (newSize.length < size.length) {\n      newSize.push(0)\n      changed = true\n    }\n\n    // enlarge size when needed\n    for (let i = 0, ii = size.length; i < ii; i++) {\n      if (size[i] > newSize[i]) {\n        newSize[i] = size[i]\n        changed = true\n      }\n    }\n\n    if (changed) {\n      // resize only when size is changed\n      _resize(matrix, newSize, defaultValue)\n    }\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof DenseMatrix\n   * @return {DenseMatrix} clone\n   */\n  DenseMatrix.prototype.clone = function () {\n    const m = new DenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    })\n    return m\n  }\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof DenseMatrix\n   * @returns {number[]} size\n   */\n  DenseMatrix.prototype.size = function () {\n    return this._size.slice(0) // return a clone of _size\n  }\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   *\n   * @return {DenseMatrix} matrix\n   */\n  DenseMatrix.prototype.map = function (callback, skipZeros = false, isUnary = false) {\n    const me = this\n    const maxDepth = me._size.length - 1\n\n    if (maxDepth < 0) return me.clone()\n\n    const fastCallback = optimizeCallback(callback, me, 'map', isUnary)\n    const fastCallbackFn = fastCallback.fn\n\n    const result = me.create(undefined, me._datatype)\n    result._size = me._size\n    if (isUnary || fastCallback.isUnary) {\n      result._data = iterateUnary(me._data)\n      return result\n    }\n    if (maxDepth === 0) {\n      const inputData = me.valueOf()\n      const data = Array(inputData.length)\n      for (let i = 0; i < inputData.length; i++) {\n        data[i] = fastCallbackFn(inputData[i], [i], me)\n      }\n      result._data = data\n      return result\n    }\n\n    const index = []\n    result._data = iterate(me._data)\n    return result\n\n    function iterate (data, depth = 0) {\n      const result = Array(data.length)\n      if (depth < maxDepth) {\n        for (let i = 0; i < data.length; i++) {\n          index[depth] = i\n          result[i] = iterate(data[i], depth + 1)\n        }\n      } else {\n        for (let i = 0; i < data.length; i++) {\n          index[depth] = i\n          result[i] = fastCallbackFn(data[i], index.slice(), me)\n        }\n      }\n      return result\n    }\n\n    function iterateUnary (data, depth = 0) {\n      const result = Array(data.length)\n      if (depth < maxDepth) {\n        for (let i = 0; i < data.length; i++) {\n          result[i] = iterateUnary(data[i], depth + 1)\n        }\n      } else {\n        for (let i = 0; i < data.length; i++) {\n          result[i] = fastCallbackFn(data[i])\n        }\n      }\n      return result\n    }\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof DenseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries\n   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter\n   */\n  DenseMatrix.prototype.forEach = function (callback, skipZeros = false, isUnary = false) {\n    const me = this\n    const maxDepth = me._size.length - 1\n\n    if (maxDepth < 0) return\n\n    const fastCallback = optimizeCallback(callback, me, 'map', isUnary)\n    const fastCallbackFn = fastCallback.fn\n    if (isUnary || fastCallback.isUnary) {\n      iterateUnary(me._data)\n      return\n    }\n    if (maxDepth === 0) {\n      for (let i = 0; i < me._data.length; i++) {\n        fastCallbackFn(me._data[i], [i], me)\n      }\n      return\n    }\n    const index = []\n    iterate(me._data)\n\n    function iterate (data, depth = 0) {\n      if (depth < maxDepth) {\n        for (let i = 0; i < data.length; i++) {\n          index[depth] = i\n          iterate(data[i], depth + 1)\n        }\n      } else {\n        for (let i = 0; i < data.length; i++) {\n          index[depth] = i\n          fastCallbackFn(data[i], index.slice(), me)\n        }\n      }\n    }\n\n    function iterateUnary (data, depth = 0) {\n      if (depth < maxDepth) {\n        for (let i = 0; i < data.length; i++) {\n          iterateUnary(data[i], depth + 1)\n        }\n      } else {\n        for (let i = 0; i < data.length; i++) {\n          fastCallbackFn(data[i])\n        }\n      }\n    }\n  }\n\n  /**\n   * Iterate over the matrix elements\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  DenseMatrix.prototype[Symbol.iterator] = function * () {\n    const maxDepth = this._size.length - 1\n\n    if (maxDepth < 0) {\n      return\n    }\n\n    if (maxDepth === 0) {\n      for (let i = 0; i < this._data.length; i++) {\n        yield ({ value: this._data[i], index: [i] })\n      }\n      return\n    }\n\n    // Multi-dimensional matrix: iterate over all elements\n    const index = Array(maxDepth + 1).fill(0)\n    const totalElements = this._size.reduce((a, b) => a * b, 1)\n\n    for (let count = 0; count < totalElements; count++) {\n      // Traverse to the current element using indices\n      let current = this._data\n      for (let d = 0; d < maxDepth; d++) {\n        current = current[index[d]]\n      }\n      yield { value: current[index[maxDepth]], index: index.slice() }\n\n      // Increment indices for next element\n      for (let d = maxDepth; d >= 0; d--) {\n        index[d]++\n        if (index[d] < this._size[d]) break\n        index[d] = 0\n      }\n    }\n  }\n\n  /**\n   * Returns an array containing the rows of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.rows = function () {\n    const result = []\n\n    const s = this.size()\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.')\n    }\n\n    const data = this._data\n    for (const row of data) {\n      result.push(new DenseMatrix([row], this._datatype))\n    }\n\n    return result\n  }\n\n  /**\n   * Returns an array containing the columns of a 2D matrix\n   * @returns {Array<Matrix>}\n   */\n  DenseMatrix.prototype.columns = function () {\n    const result = []\n\n    const s = this.size()\n    if (s.length !== 2) {\n      throw new TypeError('Rows can only be returned for a 2D matrix.')\n    }\n\n    const data = this._data\n    for (let i = 0; i < s[1]; i++) {\n      const col = data.map(row => [row[i]])\n      result.push(new DenseMatrix(col, this._datatype))\n    }\n\n    return result\n  }\n\n  /**\n   * Create an Array with a copy of the data of the DenseMatrix\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.toArray = function () {\n    return clone(this._data)\n  }\n\n  /**\n   * Get the primitive value of the DenseMatrix: a multidimensional array\n   * @memberof DenseMatrix\n   * @returns {Array} array\n   */\n  DenseMatrix.prototype.valueOf = function () {\n    return this._data\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof DenseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.format = function (options) {\n    return format(this._data, options)\n  }\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {string} str\n   */\n  DenseMatrix.prototype.toString = function () {\n    return format(this._data)\n  }\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof DenseMatrix\n   * @returns {Object}\n   */\n  DenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'DenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    }\n  }\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof DenseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix with the diagonal values.\n   */\n  DenseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) { k = k.toNumber() }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number')\n      }\n    } else {\n      // default value\n      k = 0\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows & columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n\n    // number diagonal values\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // x is a matrix get diagonal from matrix\n    const data = []\n\n    // loop rows\n    for (let i = 0; i < n; i++) {\n      data[i] = this._data[i + kSub][i + kSuper]\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [n],\n      datatype: this._datatype\n    })\n  }\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {Array} size                     The matrix size.\n   * @param {number | Matrix | Array } value The values for the diagonal.\n   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]          The default value for non-diagonal\n   * @param {string} [datatype]              The datatype for the diagonal\n   *\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.diagonal = function (size, value, k, defaultValue) {\n    if (!isArray(size)) { throw new TypeError('Array expected, size parameter') }\n    if (size.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber()\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers')\n      }\n      return s\n    })\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) { k = k.toNumber() }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number')\n      }\n    } else {\n      // default value\n      k = 0\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n\n    // number of non-zero items\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // value extraction function\n    let _value\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length')\n      }\n      // define function\n      _value = function (i) {\n        // return value @ i\n        return value[i]\n      }\n    } else if (isMatrix(value)) {\n      // matrix size\n      const ms = value.size()\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length')\n      }\n      // define function\n      _value = function (i) {\n        // return value @ i\n        return value.get([i])\n      }\n    } else {\n      // define function\n      _value = function () {\n        // return value\n        return value\n      }\n    }\n\n    // discover default value if needed\n    if (!defaultValue) {\n      // check first value in array\n      defaultValue = isBigNumber(_value(0))\n        ? _value(0).mul(0) // trick to create a BigNumber with value zero\n        : 0\n    }\n\n    // empty array\n    let data = []\n\n    // check we need to resize array\n    if (size.length > 0) {\n      // resize array\n      data = resize(data, size, defaultValue)\n      // fill diagonal\n      for (let d = 0; d < n; d++) {\n        data[d + kSub][d + kSuper] = _value(d)\n      }\n    }\n\n    // create DenseMatrix\n    return new DenseMatrix({\n      data,\n      size: [rows, columns]\n    })\n  }\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof DenseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"DenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {DenseMatrix}\n   */\n  DenseMatrix.fromJSON = function (json) {\n    return new DenseMatrix(json)\n  }\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof DenseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  DenseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers')\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n    // validate index\n    validateIndex(i, this._size[0])\n    validateIndex(j, this._size[0])\n\n    // swap rows\n    DenseMatrix._swapRows(i, j, this._data)\n    // return current instance\n    return this\n  }\n\n  /**\n   * Swap rows i and j in Dense Matrix data structure.\n   *\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   * @param {Array} data     Matrix data\n   */\n  DenseMatrix._swapRows = function (i, j, data) {\n    // swap values i <-> j\n    const vi = data[i]\n    data[i] = data[j]\n    data[j] = vi\n  }\n\n  /**\n   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and\n   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays\n   * @memberof DenseMatrix\n   * @param {Array | Matrix} data\n   * @return {Array} data\n   */\n  function preprocess (data) {\n    if (isMatrix(data)) {\n      return preprocess(data.valueOf())\n    }\n\n    if (isArray(data)) {\n      return data.map(preprocess)\n    }\n\n    return data\n  }\n\n  return DenseMatrix\n}, { isClass: true })\n","import { clone as objectClone } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'clone'\nconst dependencies = ['typed']\n\nexport const createClone = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Clone an object. Will make a deep copy of the data.\n   *\n   * Syntax:\n   *\n   *     math.clone(x)\n   *\n   * Examples:\n   *\n   *    math.clone(3.5)                   // returns number 3.5\n   *    math.clone(math.complex('2-4i'))  // returns Complex 2 - 4i\n   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg\n   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]\n   *    math.clone(\"hello world\")         // returns string \"hello world\"\n   *\n   * @param {*} x   Object to be cloned\n   * @return {*} A clone of object x\n   */\n  return typed(name, {\n    any: objectClone\n  })\n})\n","/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nexport function _switch (mat) {\n  const I = mat.length\n  const J = mat[0].length\n  let i, j\n  const ret = []\n  for (j = 0; j < J; j++) {\n    const tmp = []\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j])\n    }\n    ret.push(tmp)\n  }\n  return ret\n}\n","import { isCollection, isMatrix } from './is.js'\nimport { IndexError } from '../error/IndexError.js'\nimport { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js'\nimport { _switch } from './switch.js'\n\n/**\n * Test whether an array contains collections\n * @param {Array} array\n * @returns {boolean} Returns true when the array contains one or multiple\n *                    collections (Arrays or Matrices). Returns false otherwise.\n */\nexport function containsCollections (array) {\n  for (let i = 0; i < array.length; i++) {\n    if (isCollection(array[i])) {\n      return true\n    }\n  }\n  return false\n}\n\n/**\n * Recursively loop over all elements in a given multi dimensional array\n * and invoke the callback on each of the elements.\n * @param {Array | Matrix} array\n * @param {Function} callback     The callback method is invoked with one\n *                                parameter: the current element in the array\n */\nexport function deepForEach (array, callback) {\n  if (isMatrix(array)) {\n    array.forEach(x => callback(x), false, true)\n  } else {\n    arrayDeepForEach(array, callback, true)\n  }\n}\n\n/**\n * Execute the callback function element wise for each element in array and any\n * nested array\n * Returns an array with the results\n * @param {Array | Matrix} array\n * @param {Function} callback   The callback is called with two parameters:\n *                              value1 and value2, which contain the current\n *                              element of both arrays.\n * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n *\n * @return {Array | Matrix} res\n */\nexport function deepMap (array, callback, skipZeros) {\n  if (!skipZeros) {\n    if (isMatrix(array)) {\n      return array.map(x => callback(x), false, true)\n    } else {\n      return arrayDeepMap(array, callback, true)\n    }\n  }\n  const skipZerosCallback = (x) => x === 0 ? x : callback(x)\n  if (isMatrix(array)) {\n    return array.map(x => skipZerosCallback(x), false, true)\n  } else {\n    return arrayDeepMap(array, skipZerosCallback, true)\n  }\n}\n\n/**\n * Reduce a given matrix or array to a new matrix or\n * array with one less dimension, applying the given\n * callback in the selected dimension.\n * @param {Array | Matrix} mat\n * @param {number} dim\n * @param {Function} callback\n * @return {Array | Matrix} res\n */\nexport function reduce (mat, dim, callback) {\n  const size = Array.isArray(mat) ? arraySize(mat) : mat.size()\n  if (dim < 0 || (dim >= size.length)) {\n    // TODO: would be more clear when throwing a DimensionError here\n    throw new IndexError(dim, size.length)\n  }\n\n  if (isMatrix(mat)) {\n    return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype())\n  } else {\n    return _reduce(mat, dim, callback)\n  }\n}\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _reduce (mat, dim, callback) {\n  let i, ret, val, tran\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      val = mat[0]\n      for (i = 1; i < mat.length; i++) {\n        val = callback(val, mat[i])\n      }\n      return val\n    } else {\n      tran = _switch(mat)\n      ret = []\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _reduce(tran[i], dim - 1, callback)\n      }\n      return ret\n    }\n  } else {\n    ret = []\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _reduce(mat[i], dim - 1, callback)\n    }\n    return ret\n  }\n}\n\n// TODO: document function scatter\nexport function scatter (a, j, w, x, u, mark, cindex, f, inverse, update, value) {\n  // a arrays\n  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n\n  // vars\n  let k, k0, k1, i\n\n  // check we need to process values (pattern matrix)\n  if (x) {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k]\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark\n        // add i to pattern of C\n        cindex.push(i)\n        // x(i) = A, check we need to call function this time\n        if (update) {\n          // copy value to workspace calling callback function\n          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k])\n          // function was called on current row\n          u[i] = mark\n        } else {\n          // copy value to workspace\n          x[i] = avalues[k]\n        }\n      } else {\n        // i exists in C already\n        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k])\n        // function was called on current row\n        u[i] = mark\n      }\n    }\n  } else {\n    // values in j\n    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n      // row\n      i = aindex[k]\n      // check value exists in current j\n      if (w[i] !== mark) {\n        // i is new entry in j\n        w[i] = mark\n        // add i to pattern of C\n        cindex.push(i)\n      } else {\n        // indicate function was called on current row\n        u[i] = mark\n      }\n    }\n  }\n}\n","import { deepMap } from '../../utils/collection.js'\nimport { isInteger as isIntegerNumber } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isInteger'\nconst dependencies = ['typed']\n\nexport const createIsInteger = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is an integer number.\n   * The function supports `number`, `BigNumber`, and `Fraction`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isInteger(x)\n   *\n   * Examples:\n   *\n   *    math.isInteger(2)                     // returns true\n   *    math.isInteger(0)                     // returns true\n   *    math.isInteger(0.5)                   // returns false\n   *    math.isInteger(math.bignumber(500))   // returns true\n   *    math.isInteger(math.fraction(4))      // returns true\n   *    math.isInteger('3')                   // returns true\n   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]\n   *    math.isInteger(math.complex('2-4i'))  // throws TypeError\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isZero\n   *\n   * @param {number | BigNumber | bigint | Fraction | Array | Matrix} x   Value to be tested\n   * @return {boolean}  Returns true when `x` contains a numeric, integer value.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isIntegerNumber, // TODO: what to do with isInteger(add(0.1, 0.2))  ?\n\n    BigNumber: function (x) {\n      return x.isInt()\n    },\n\n    bigint: function (x) {\n      return true\n    },\n\n    Fraction: function (x) {\n      return x.d === 1n\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { isInteger } from '../../utils/number.js'\n\nconst n1 = 'number'\n\nexport function isIntegerNumber (x) {\n  return isInteger(x)\n}\nisIntegerNumber.signature = n1\n\nexport function isNegativeNumber (x) {\n  return x < 0\n}\nisNegativeNumber.signature = n1\n\nexport function isPositiveNumber (x) {\n  return x > 0\n}\nisPositiveNumber.signature = n1\n\nexport function isZeroNumber (x) {\n  return x === 0\n}\nisZeroNumber.signature = n1\n\nexport function isNaNNumber (x) {\n  return Number.isNaN(x)\n}\nisNaNNumber.signature = n1\n","/**\n * Compares two BigNumbers.\n * @param {BigNumber} a - First value to compare\n * @param {BigNumber} b - Second value to compare\n * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.\n * @param {number} [absTol=0] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.\n * @returns {boolean} whether the two numbers are nearly equal\n * @throws {Error} If `relTol` is less than or equal to 0.\n * @throws {Error} If `absTol` is less than 0.\n *\n * @example\n * nearlyEqual(1.000000001, 1.0, 1e-9);            // true\n * nearlyEqual(1.000000002, 1.0, 0);            // false\n * nearlyEqual(1.0, 1.009, undefined, 0.02);       // true\n * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true\n */\nexport function nearlyEqual (a, b, relTol = 1e-9, absTol = 0) {\n  if (relTol <= 0) {\n    throw new Error('Relative tolerance must be greater than 0')\n  }\n\n  if (absTol < 0) {\n    throw new Error('Absolute tolerance must be at least 0')\n  }\n  // NaN\n  if (a.isNaN() || b.isNaN()) {\n    return false\n  }\n\n  if (!a.isFinite() || !b.isFinite()) {\n    return a.eq(b)\n  }\n  // use \"==\" operator, handles infinities\n  if (a.eq(b)) {\n    return true\n  }\n  // abs(a-b) <= max(relTol * max(abs(a), abs(b)), absTol)\n  return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol))\n}\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isNegativeNumber } from '../../plain/number/index.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\n\nconst name = 'isNegative'\nconst dependencies = ['typed', 'config']\n\nexport const createIsNegative = /* #__PURE__ */ factory(name, dependencies, ({ typed, config }) => {\n  /**\n   * Test whether a value is negative: smaller than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNegative(x)\n   *\n   * Examples:\n   *\n   *    math.isNegative(3)                     // returns false\n   *    math.isNegative(-2)                    // returns true\n   *    math.isNegative(0)                     // returns false\n   *    math.isNegative(-0)                    // returns false\n   *    math.isNegative(math.bignumber(2))     // returns false\n   *    math.isNegative(math.fraction(-2, 5))  // returns true\n   *    math.isNegative('-2')                  // returns true\n   *    math.isNegative([2, 0, -3])            // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isNegativeNumber(x),\n\n    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol)\n      ? false\n      : x.isNeg() && !x.isZero() && !x.isNaN(),\n\n    bigint: x => x < 0n,\n\n    Fraction: x => x.s < 0n, // It's enough to decide on the sign\n\n    Unit: typed.referToSelf(self =>\n      x => typed.find(self, x.valueType())(x.value)),\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isNumeric'\nconst dependencies = ['typed']\n\nexport const createIsNumeric = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNumeric(x)\n   *\n   * Examples:\n   *\n   *    math.isNumeric(2)                     // returns true\n   *    math.isNumeric('2')                   // returns false\n   *    math.hasNumericValue('2')             // returns true\n   *    math.isNumeric(0)                     // returns true\n   *    math.isNumeric(math.bignumber('42'))  // returns true\n   *    math.isNumeric(math.bigint('42'))     // returns true\n   *    math.isNumeric(math.fraction(4))      // returns true\n   *    math.isNumeric(math.complex('2-4i'))  // returns false\n   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, hasNumericValue\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, or `boolean`. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n  return typed(name, {\n    'number | BigNumber | bigint | Fraction | boolean': () => true,\n    'Complex | Unit | string | null | undefined | Node': () => false,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'hasNumericValue'\nconst dependencies = ['typed', 'isNumeric']\n\nexport const createHasNumericValue = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNumeric }) => {\n  /**\n   * Test whether a value is an numeric value.\n   *\n   * In case of a string, true is returned if the string contains a numeric value.\n   *\n   * Syntax:\n   *\n   *     math.hasNumericValue(x)\n   *\n   * Examples:\n   *\n   *    math.hasNumericValue(2)                     // returns true\n   *    math.hasNumericValue('2')                   // returns true\n   *    math.isNumeric('2')                         // returns false\n   *    math.hasNumericValue(0)                     // returns true\n   *    math.hasNumericValue(math.bignumber('500')) // returns true\n   *    math.hasNumericValue(math.bigint('42'))     // returns true\n   *    math.hasNumericValue(42n)                   // returns true\n   *    math.hasNumericValue(math.fraction(4))      // returns true\n   *    math.hasNumericValue(math.complex('2-4i'))  // returns false\n   *    math.hasNumericValue(false)                 // returns true\n   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    isZero, isPositive, isNegative, isInteger, isNumeric\n   *\n   * @param {*} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,\n   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.\n   *                    Throws an error in case of unknown types.\n   */\n  return typed(name, {\n    boolean: () => true,\n    string: function (x) {\n      return x.trim().length > 0 && !isNaN(Number(x))\n    },\n    any: function (x) {\n      return isNumeric(x)\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isPositiveNumber } from '../../plain/number/index.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\n\nconst name = 'isPositive'\nconst dependencies = ['typed', 'config']\n\nexport const createIsPositive = /* #__PURE__ */ factory(name, dependencies, ({ typed, config }) => {\n  /**\n   * Test whether a value is positive: larger than zero.\n   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPositive(x)\n   *\n   * Examples:\n   *\n   *    math.isPositive(3)                     // returns true\n   *    math.isPositive(-2)                    // returns false\n   *    math.isPositive(0)                     // returns false\n   *    math.isPositive(-0)                    // returns false\n   *    math.isPositive(0.5)                   // returns true\n   *    math.isPositive(math.bignumber(2))     // returns true\n   *    math.isPositive(math.fraction(-2, 5))  // returns false\n   *    math.isPositive(math.fraction(1, 3))   // returns true\n   *    math.isPositive('2')                   // returns true\n   *    math.isPositive([2, 0, -3])            // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isPositiveNumber(x),\n\n    BigNumber: x =>\n      bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol)\n        ? false\n        : !x.isNeg() && !x.isZero() && !x.isNaN(),\n\n    bigint: x => x > 0n,\n\n    Fraction: x => x.s > 0n && x.n > 0n,\n\n    Unit: typed.referToSelf(self =>\n      x => typed.find(self, x.valueType())(x.value)),\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isZero'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createIsZero = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Test whether a value is zero.\n   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,\n   * `Complex`, and `Unit`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isZero(x)\n   *\n   * Examples:\n   *\n   *    math.isZero(0)                      // returns true\n   *    math.isZero(2)                      // returns false\n   *    math.isZero(0.5)                    // returns false\n   *    math.isZero(math.bignumber(0))      // returns true\n   *    math.isZero(math.fraction(0))       // returns true\n   *    math.isZero(math.fraction(1,3))     // returns false\n   *    math.isZero(math.complex('2 - 4i')) // returns false\n   *    math.isZero(math.complex('0i'))     // returns true\n   *    math.isZero('0')                    // returns true\n   *    math.isZero('2')                    // returns false\n   *    math.isZero([2, 0, -3])             // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isPositive, isNegative, isInteger\n   *\n   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested\n   * @return {boolean}  Returns true when `x` is zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    'number | BigNumber | Complex | Fraction': x => equalScalar(x, 0),\n\n    bigint: x => x === 0n,\n\n    Unit: typed.referToSelf(self =>\n      x => typed.find(self, x.valueType())(x.value)),\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { isNaNNumber } from '../../plain/number/index.js'\n\nconst name = 'isNaN'\nconst dependencies = ['typed']\n\nexport const createIsNaN = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is NaN (not a number).\n   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isNaN(x)\n   *\n   * Examples:\n   *\n   *    math.isNaN(3)                     // returns false\n   *    math.isNaN(NaN)                   // returns true\n   *    math.isNaN(0)                     // returns false\n   *    math.isNaN(math.bignumber(NaN))   // returns true\n   *    math.isNaN(math.bignumber(0))     // returns false\n   *    math.isNaN(math.fraction(-2, 5))  // returns false\n   *    math.isNaN('-2')                  // returns false\n   *    math.isNaN([2, 0, -3, NaN])       // returns [false, false, false, true]\n   *\n   * See also:\n   *\n   *    isNumeric, isNegative, isPositive, isZero, isInteger\n   *\n   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is NaN.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: isNaNNumber,\n\n    BigNumber: function (x) {\n      return x.isNaN()\n    },\n\n    bigint: function (x) {\n      return false\n    },\n\n    Fraction: function (x) {\n      return false\n    },\n\n    Complex: function (x) {\n      return x.isNaN()\n    },\n\n    Unit: function (x) {\n      return Number.isNaN(x.value)\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { typeOf as _typeOf } from '../../utils/is.js'\n\nconst name = 'typeOf'\nconst dependencies = ['typed']\n\nexport const createTypeOf = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Determine the type of an entity.\n   *\n   * Syntax:\n   *\n   *    math.typeOf(x)\n   *\n   * Examples:\n   *\n   *    // This list is intended to include all relevant types, for testing\n   *    // purposes:\n   *    math.typeOf(3.5)                      // returns 'number'\n   *    math.typeOf(42n)                      // returns 'bigint'\n   *    math.typeOf(math.complex('2-4i'))     // returns 'Complex'\n   *    math.typeOf(math.unit('45 deg'))      // returns 'Unit'\n   *    math.typeOf('hello world')            // returns 'string'\n   *    math.typeOf(null)                     // returns 'null'\n   *    math.typeOf(true)                     // returns 'boolean'\n   *    math.typeOf([1, 2, 3])                // returns 'Array'\n   *    math.typeOf(new Date())               // returns 'Date'\n   *    math.typeOf(function () {})           // returns 'function'\n   *    math.typeOf({a: 2, b: 3})             // returns 'Object'\n   *    math.typeOf(/a regexp/)               // returns 'RegExp'\n   *    math.typeOf(undefined)                // returns 'undefined'\n   *    math.typeOf(math.bignumber('23e99'))  // returns 'BigNumber'\n   *    math.typeOf(math.chain(2))            // returns 'Chain'\n   *    math.typeOf(math.fraction(1, 3))      // returns 'Fraction'\n   *    math.typeOf(math.help('sqrt'))        // returns 'Help'\n   *    math.typeOf(math.index(1, 3))         // returns 'Index'\n   *    math.typeOf(math.matrix([[1],[3]]))   // returns 'DenseMatrix'\n   *    math.typeOf(math.matrix([],'sparse')) // returns 'SparseMatrix'\n   *    math.typeOf(new math.Range(0, 10))    // returns 'Range'\n   *    math.typeOf(math.evaluate('a=2\\na'))  // returns 'ResultSet'\n   *    math.typeOf(math.parse('A[2]'))       // returns 'AccessorNode'\n   *    math.typeOf(math.parse('[1,2,3]'))    // returns 'ArrayNode'\n   *    math.typeOf(math.parse('x=2'))        // returns 'AssignmentNode'\n   *    math.typeOf(math.parse('a=2; b=3'))   // returns 'BlockNode'\n   *    math.typeOf(math.parse('x<0?-1:1'))   // returns 'ConditionalNode'\n   *    math.typeOf(math.parse('2.3'))        // returns 'ConstantNode'\n   *    math.typeOf(math.parse('f(x)=x^2'))   // returns 'FunctionAssignmentNode'\n   *    math.typeOf(math.parse('sqrt(4)'))    // returns 'FunctionNode'\n   *    math.typeOf(math.parse('A[2]').index) // returns 'IndexNode'\n   *    math.typeOf(math.parse('{a:2}'))      // returns 'ObjectNode'\n   *    math.typeOf(math.parse('(2+3)'))      // returns 'ParenthesisNode'\n   *    math.typeOf(math.parse('1:10'))       // returns 'RangeNode'\n   *    math.typeOf(math.parse('a<b<c'))      // returns 'RelationalNode'\n   *    math.typeOf(math.parse('x'))          // returns 'SymbolNode'\n   *\n   * @param {*} x     The variable for which to test the type.\n   * @return {string} Returns the name of the type. Primitive types are lower case,\n   *                  non-primitive types are upper-camel-case.\n   *                  For example 'number', 'string', 'Array', 'Date'.\n   */\n  return typed(name, {\n    any: _typeOf\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nexport const createCompareUnits = /* #__PURE__ */ factory(\n  'compareUnits', ['typed'], ({ typed }) => ({\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (!x.equalBase(y)) {\n        throw new Error('Cannot compare units with different base')\n      }\n      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value)\n    })\n  })\n)\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { complexEquals } from '../../utils/complex.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'equalScalar'\nconst dependencies = ['typed', 'config']\n\nexport const createEqualScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed, config }) => {\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Test whether two scalar values are nearly equal.\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex | Unit} x   First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex} y          Second value to compare\n   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false\n   * @private\n   */\n  return typed(name, {\n\n    'boolean, boolean': function (x, y) {\n      return x === y\n    },\n\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.eq(y) || bigNearlyEqual(x, y, config.relTol, config.absTol)\n    },\n\n    'bigint, bigint': function (x, y) {\n      return x === y\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.equals(y)\n    },\n\n    'Complex, Complex': function (x, y) {\n      return complexEquals(x, y, config.relTol, config.absTol)\n    }\n  }, compareUnits)\n})\n\nexport const createEqualScalarNumber = factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol)\n    }\n  })\n})\n","import { nearlyEqual } from './number.js'\n\n/**\n * Test whether two complex values are equal provided a given relTol and absTol.\n * Does not use or change the global Complex.EPSILON setting\n * @param {Complex} x - The first complex number for comparison.\n * @param {Complex} y - The second complex number for comparison.\n * @param {number} relTol - The relative tolerance for comparison.\n * @param {number} absTol - The absolute tolerance for comparison.\n * @returns {boolean} - Returns true if the two complex numbers are equal within the given tolerances, otherwise returns false.\n */\nexport function complexEquals (x, y, relTol, absTol) {\n  return nearlyEqual(x.re, y.re, relTol, absTol) && nearlyEqual(x.im, y.im, relTol, absTol)\n}\n","import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { format } from '../../utils/string.js'\nimport { clone, deepStrictEqual } from '../../utils/object.js'\nimport { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { optimizeCallback } from '../../utils/optimizeCallback.js'\n\nconst name = 'SparseMatrix'\nconst dependencies = [\n  'typed',\n  'equalScalar',\n  'Matrix'\n]\n\nexport const createSparseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar, Matrix }) => {\n  /**\n   * Sparse Matrix implementation. This type implements\n   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n   * format for two-dimensional sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix (data, datatype) {\n    if (!(this instanceof SparseMatrix)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { throw new Error('Invalid datatype: ' + datatype) }\n\n    if (isMatrix(data)) {\n      // create from matrix\n      _createFromMatrix(this, data, datatype)\n    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {\n      // initialize fields\n      this._values = data.values\n      this._index = data.index\n      this._ptr = data.ptr\n      this._size = data.size\n      this._datatype = datatype || data.datatype\n    } else if (isArray(data)) {\n      // create from array\n      _createFromArray(this, data, datatype)\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')')\n    } else {\n      // nothing provided\n      this._values = []\n      this._index = []\n      this._ptr = [0]\n      this._size = [0, 0]\n      this._datatype = datatype\n    }\n  }\n\n  function _createFromMatrix (matrix, source, datatype) {\n    // check matrix type\n    if (source.type === 'SparseMatrix') {\n      // clone arrays\n      matrix._values = source._values ? clone(source._values) : undefined\n      matrix._index = clone(source._index)\n      matrix._ptr = clone(source._ptr)\n      matrix._size = clone(source._size)\n      matrix._datatype = datatype || source._datatype\n    } else {\n      // build from matrix data\n      _createFromArray(matrix, source.valueOf(), datatype || source._datatype)\n    }\n  }\n\n  function _createFromArray (matrix, data, datatype) {\n    // initialize fields\n    matrix._values = []\n    matrix._index = []\n    matrix._ptr = []\n    matrix._datatype = datatype\n    // discover rows & columns, do not use math.size() to avoid looping array twice\n    const rows = data.length\n    let columns = 0\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype)\n    }\n\n    // check we have rows (empty array)\n    if (rows > 0) {\n      // column index\n      let j = 0\n      do {\n        // store pointer to values index\n        matrix._ptr.push(matrix._index.length)\n        // loop rows\n        for (let i = 0; i < rows; i++) {\n          // current row\n          const row = data[i]\n          // check row is an array\n          if (isArray(row)) {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < row.length) { columns = row.length }\n            // check row has column\n            if (j < row.length) {\n              // value\n              const v = row[j]\n              // check value != 0\n              if (!eq(v, zero)) {\n                // store value\n                matrix._values.push(v)\n                // index\n                matrix._index.push(i)\n              }\n            }\n          } else {\n            // update columns if needed (only on first column)\n            if (j === 0 && columns < 1) { columns = 1 }\n            // check value != 0 (row is a scalar)\n            if (!eq(row, zero)) {\n              // store value\n              matrix._values.push(row)\n              // index\n              matrix._index.push(i)\n            }\n          }\n        }\n        // increment index\n        j++\n      }\n      while (j < columns)\n    }\n    // store number of values in ptr\n    matrix._ptr.push(matrix._index.length)\n    // size\n    matrix._size = [rows, columns]\n  }\n\n  SparseMatrix.prototype = new Matrix()\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype)\n  }\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', { value: 'SparseMatrix' })\n  SparseMatrix.prototype.constructor = SparseMatrix\n  SparseMatrix.prototype.type = 'SparseMatrix'\n  SparseMatrix.prototype.isSparseMatrix = true\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  SparseMatrix.prototype.getDataType = function () {\n    return getArrayDataType(this._values, typeOf)\n  }\n\n  /**\n   * Get the storage format used by the matrix.\n   *\n   * Usage:\n   *     const format = matrix.storage()   // retrieve storage format\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The storage format.\n   */\n  SparseMatrix.prototype.storage = function () {\n    return 'sparse'\n  }\n\n  /**\n   * Get the datatype of the data stored in the matrix.\n   *\n   * Usage:\n   *     const format = matrix.datatype()    // retrieve matrix datatype\n   *\n   * @memberof SparseMatrix\n   * @return {string}           The datatype.\n   */\n  SparseMatrix.prototype.datatype = function () {\n    return this._datatype\n  }\n\n  /**\n   * Create a new SparseMatrix\n   * @memberof SparseMatrix\n   * @param {Array} data\n   * @param {string} [datatype]\n   */\n  SparseMatrix.prototype.create = function (data, datatype) {\n    return new SparseMatrix(data, datatype)\n  }\n\n  /**\n   * Get the matrix density.\n   *\n   * Usage:\n   *     const density = matrix.density()                   // retrieve matrix density\n   *\n   * @memberof SparseMatrix\n   * @return {number}           The matrix density.\n   */\n  SparseMatrix.prototype.density = function () {\n    // rows & columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    // calculate density\n    return rows !== 0 && columns !== 0 ? (this._index.length / (rows * columns)) : 0\n  }\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @memberof SparseMatrix\n   * @param {Index} index\n   * @param {Array | Matrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) { // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke subset on a Pattern only matrix') }\n\n    // check arguments\n    switch (arguments.length) {\n      case 1:\n        return _getsubset(this, index)\n\n      // intentional fall through\n      case 2:\n      case 3:\n        return _setsubset(this, index, replacement, defaultValue)\n\n      default:\n        throw new SyntaxError('Wrong number of arguments')\n    }\n  }\n\n  function _getsubset (matrix, idx) {\n    // check idx\n    if (!isIndex(idx)) {\n      throw new TypeError('Invalid index')\n    }\n\n    const isScalar = idx.isScalar()\n    if (isScalar) {\n      // return a scalar\n      return matrix.get(idx.min())\n    }\n    // validate dimensions\n    const size = idx.size()\n    if (size.length !== matrix._size.length) {\n      throw new DimensionError(size.length, matrix._size.length)\n    }\n\n    // vars\n    let i, ii, k, kk\n\n    // validate if any of the ranges in the index is out of range\n    const min = idx.min()\n    const max = idx.max()\n    for (i = 0, ii = matrix._size.length; i < ii; i++) {\n      validateIndex(min[i], matrix._size[i])\n      validateIndex(max[i], matrix._size[i])\n    }\n\n    // matrix arrays\n    const mvalues = matrix._values\n    const mindex = matrix._index\n    const mptr = matrix._ptr\n\n    // rows & columns dimensions for result matrix\n    const rows = idx.dimension(0)\n    const columns = idx.dimension(1)\n\n    // workspace & permutation vector\n    const w = []\n    const pv = []\n\n    // loop rows in resulting matrix\n    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0]\n      // mark i in workspace\n      w[i] = true\n    })\n\n    // result matrix arrays\n    const values = mvalues ? [] : undefined\n    const index = []\n    const ptr = []\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length)\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k]\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i])\n          // check we need to process values\n          if (values) { values.push(mvalues[k]) }\n        }\n      }\n    })\n    // update ptr\n    ptr.push(index.length)\n\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size,\n      datatype: matrix._datatype\n    })\n  }\n\n  function _setsubset (matrix, index, submatrix, defaultValue) {\n    // check index\n    if (!index || index.isIndex !== true) {\n      throw new TypeError('Invalid index')\n    }\n\n    // get index size and check whether the index contains a single value\n    const iSize = index.size()\n    const isScalar = index.isScalar()\n\n    // calculate the size of the submatrix, and convert it into an Array if needed\n    let sSize\n    if (isMatrix(submatrix)) {\n      // submatrix size\n      sSize = submatrix.size()\n      // use array representation\n      submatrix = submatrix.toArray()\n    } else {\n      // get submatrix size (array, scalar)\n      sSize = arraySize(submatrix)\n    }\n\n    // check index is a scalar\n    if (isScalar) {\n      // verify submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected')\n      }\n      // set value\n      matrix.set(index.min(), submatrix, defaultValue)\n    } else {\n      // validate dimensions, index size must be one or two dimensions\n      if (iSize.length !== 1 && iSize.length !== 2) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<')\n      }\n\n      // check submatrix and index have the same dimensions\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        let i = 0\n        let outer = 0\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++\n        }\n        while (iSize[i] === 1) {\n          outer++\n          i++\n        }\n        // unsqueeze both outer and inner dimensions\n        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize)\n      }\n\n      // check whether the size of the submatrix matches the index size\n      if (!deepStrictEqual(iSize, sSize)) {\n        throw new DimensionError(iSize, sSize, '>')\n      }\n\n      // insert the sub matrix\n      if (iSize.length === 1) {\n        // if the replacement index only has 1 dimension, go trough each one and set its value\n        const range = index.dimension(0)\n        range.forEach(function (dataIndex, subIndex) {\n          validateIndex(dataIndex)\n          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue)\n        })\n      } else {\n        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index\n        const firstDimensionRange = index.dimension(0)\n        const secondDimensionRange = index.dimension(1)\n        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n          validateIndex(firstDataIndex)\n          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n            validateIndex(secondDataIndex)\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue)\n          })\n        })\n      }\n    }\n    return matrix\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  SparseMatrix.prototype.get = function (index) {\n    if (!isArray(index)) { throw new TypeError('Array expected') }\n    if (index.length !== this._size.length) { throw new DimensionError(index.length, this._size.length) }\n\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke get on a Pattern only matrix') }\n\n    // row and column\n    const i = index[0]\n    const j = index[1]\n\n    // check i, j are valid\n    validateIndex(i, this._size[0])\n    validateIndex(j, this._size[1])\n\n    // find value index\n    const k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index)\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) { return this._values[k] }\n\n    return 0\n  }\n\n  /**\n   * Replace a single element in the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @param {*} v\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be set to zero.\n   * @return {SparseMatrix} self\n   */\n  SparseMatrix.prototype.set = function (index, v, defaultValue) {\n    if (!isArray(index)) { throw new TypeError('Array expected') }\n    if (index.length !== this._size.length) { throw new DimensionError(index.length, this._size.length) }\n\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke set on a Pattern only matrix') }\n\n    // row and column\n    const i = index[0]\n    const j = index[1]\n\n    // rows & columns\n    let rows = this._size[0]\n    let columns = this._size[1]\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    if (isString(this._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar\n      // convert 0 to the same datatype\n      zero = typed.convert(0, this._datatype)\n    }\n\n    // check we need to resize matrix\n    if (i > rows - 1 || j > columns - 1) {\n      // resize matrix\n      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue)\n      // update rows & columns\n      rows = this._size[0]\n      columns = this._size[1]\n    }\n\n    // check i, j are valid\n    validateIndex(i, rows)\n    validateIndex(j, columns)\n\n    // find value index\n    const k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index)\n    // check k is prior to next column k and it is in the correct row\n    if (k < this._ptr[j + 1] && this._index[k] === i) {\n      // check value != 0\n      if (!eq(v, zero)) {\n        // update value\n        this._values[k] = v\n      } else {\n        // remove value from matrix\n        _remove(k, j, this._values, this._index, this._ptr)\n      }\n    } else {\n      if (!eq(v, zero)) {\n        // insert value @ (i, j)\n        _insert(k, i, j, v, this._values, this._index, this._ptr)\n      }\n    }\n\n    return this\n  }\n\n  function _getValueIndex (i, top, bottom, index) {\n    // check row is on the bottom side\n    if (bottom - top === 0) { return bottom }\n    // loop rows [top, bottom[\n    for (let r = top; r < bottom; r++) {\n      // check we found value index\n      if (index[r] === i) { return r }\n    }\n    // we did not find row\n    return top\n  }\n\n  function _remove (k, j, values, index, ptr) {\n    // remove value @ k\n    values.splice(k, 1)\n    index.splice(k, 1)\n    // update pointers\n    for (let x = j + 1; x < ptr.length; x++) { ptr[x]-- }\n  }\n\n  function _insert (k, i, j, v, values, index, ptr) {\n    // insert value\n    values.splice(k, 0, v)\n    // update row for k\n    index.splice(k, 0, i)\n    // update column pointers\n    for (let x = j + 1; x < ptr.length; x++) { ptr[x]++ }\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @memberof SparseMatrix\n   * @param {number[] | Matrix} size  The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {\n    // validate arguments\n    if (!isCollection(size)) {\n      throw new TypeError('Array or Matrix expected')\n    }\n\n    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector\n    const sizeArray = size.valueOf().map(value => {\n      return Array.isArray(value) && value.length === 1\n        ? value[0]\n        : value\n    })\n\n    if (sizeArray.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\n\n    // check sizes\n    sizeArray.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value < 0) {\n        throw new TypeError('Invalid size, must contain positive integers ' +\n          '(size: ' + format(sizeArray) + ')')\n      }\n    })\n\n    // matrix to resize\n    const m = copy ? this.clone() : this\n    // resize matrix\n    return _resize(m, sizeArray[0], sizeArray[1], defaultValue)\n  }\n\n  function _resize (matrix, rows, columns, defaultValue) {\n    // value to insert at the time of growing matrix\n    let value = defaultValue || 0\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype)\n      // convert value to the same datatype\n      value = typed.convert(value, matrix._datatype)\n    }\n\n    // should we insert the value?\n    const ins = !eq(value, zero)\n\n    // old columns and rows\n    const r = matrix._size[0]\n    let c = matrix._size[1]\n\n    let i, j, k\n\n    // check we need to increase columns\n    if (columns > c) {\n      // loop new columns\n      for (j = c; j < columns; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._values.length\n        // check we need to insert matrix._values\n        if (ins) {\n          // loop rows\n          for (i = 0; i < r; i++) {\n            // add new matrix._values\n            matrix._values.push(value)\n            // update matrix._index\n            matrix._index.push(i)\n          }\n        }\n      }\n      // store number of matrix._values in matrix._ptr\n      matrix._ptr[columns] = matrix._values.length\n    } else if (columns < c) {\n      // truncate matrix._ptr\n      matrix._ptr.splice(columns + 1, c - columns)\n      // truncate matrix._values and matrix._index\n      matrix._values.splice(matrix._ptr[columns], matrix._values.length)\n      matrix._index.splice(matrix._ptr[columns], matrix._index.length)\n    }\n    // update columns\n    c = columns\n\n    // check we need to increase rows\n    if (rows > r) {\n      // check we have to insert values\n      if (ins) {\n        // inserts\n        let n = 0\n        // loop columns\n        for (j = 0; j < c; j++) {\n          // update matrix._ptr for current column\n          matrix._ptr[j] = matrix._ptr[j] + n\n          // where to insert matrix._values\n          k = matrix._ptr[j + 1] + n\n          // pointer\n          let p = 0\n          // loop new rows, initialize pointer\n          for (i = r; i < rows; i++, p++) {\n            // add value\n            matrix._values.splice(k + p, 0, value)\n            // update matrix._index\n            matrix._index.splice(k + p, 0, i)\n            // increment inserts\n            n++\n          }\n        }\n        // store number of matrix._values in matrix._ptr\n        matrix._ptr[c] = matrix._values.length\n      }\n    } else if (rows < r) {\n      // deletes\n      let d = 0\n      // loop columns\n      for (j = 0; j < c; j++) {\n        // update matrix._ptr for current column\n        matrix._ptr[j] = matrix._ptr[j] - d\n        // where matrix._values start for next column\n        const k0 = matrix._ptr[j]\n        const k1 = matrix._ptr[j + 1] - d\n        // loop matrix._index\n        for (k = k0; k < k1; k++) {\n          // row\n          i = matrix._index[k]\n          // check we need to delete value and matrix._index\n          if (i > rows - 1) {\n            // remove value\n            matrix._values.splice(k, 1)\n            // remove item from matrix._index\n            matrix._index.splice(k, 1)\n            // increase deletes\n            d++\n          }\n        }\n      }\n      // update matrix._ptr for current column\n      matrix._ptr[j] = matrix._values.length\n    }\n    // update matrix._size\n    matrix._size[0] = rows\n    matrix._size[1] = columns\n    // return matrix\n    return matrix\n  }\n\n  /**\n   * Reshape the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (reshape in place).\n   *\n   * NOTE: This might be better suited to copy by default, instead of modifying\n   *       in place. For now, it operates in place to remain consistent with\n   *       resize().\n   *\n   * @memberof SparseMatrix\n   * @param {number[]} sizes          The new size the matrix should have.\n   *                                  Since sparse matrices are always two-dimensional,\n   *                                  size must be two numbers in either an array or a matrix\n   * @param {boolean} [copy]          Return a reshaped copy of the matrix\n   *\n   * @return {Matrix}                 The reshaped matrix\n   */\n  SparseMatrix.prototype.reshape = function (sizes, copy) {\n    // validate arguments\n    if (!isArray(sizes)) { throw new TypeError('Array expected') }\n    if (sizes.length !== 2) { throw new Error('Sparse matrices can only be reshaped in two dimensions') }\n\n    // check sizes\n    sizes.forEach(function (value) {\n      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {\n        throw new TypeError('Invalid size, must contain positive integers or -1 ' +\n          '(size: ' + format(sizes) + ')')\n      }\n    })\n\n    const currentLength = this._size[0] * this._size[1]\n    sizes = processSizesWildcard(sizes, currentLength)\n    const newLength = sizes[0] * sizes[1]\n\n    // m * n must not change\n    if (currentLength !== newLength) {\n      throw new Error('Reshaping sparse matrix will result in the wrong number of elements')\n    }\n\n    // matrix to reshape\n    const m = copy ? this.clone() : this\n\n    // return unchanged if the same shape\n    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {\n      return m\n    }\n\n    // Convert to COO format (generate a column index)\n    const colIndex = []\n    for (let i = 0; i < m._ptr.length; i++) {\n      for (let j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {\n        colIndex.push(i)\n      }\n    }\n\n    // Clone the values array\n    const values = m._values.slice()\n\n    // Clone the row index array\n    const rowIndex = m._index.slice()\n\n    // Transform the (row, column) indices\n    for (let i = 0; i < m._index.length; i++) {\n      const r1 = rowIndex[i]\n      const c1 = colIndex[i]\n      const flat = r1 * m._size[1] + c1\n      colIndex[i] = flat % sizes[1]\n      rowIndex[i] = Math.floor(flat / sizes[1])\n    }\n\n    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored\n    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,\n    // sorting several arrays based on some other array.\n\n    // OR, we could easily just:\n\n    // 1. Remove all values from the matrix\n    m._values.length = 0\n    m._index.length = 0\n    m._ptr.length = sizes[1] + 1\n    m._size = sizes.slice()\n    for (let i = 0; i < m._ptr.length; i++) {\n      m._ptr[i] = 0\n    }\n\n    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)\n    // This step is probably the most time-consuming\n    for (let h = 0; h < values.length; h++) {\n      const i = rowIndex[h]\n      const j = colIndex[h]\n      const v = values[h]\n      const k = _getValueIndex(i, m._ptr[j], m._ptr[j + 1], m._index)\n      _insert(k, i, j, v, m._values, m._index, m._ptr)\n    }\n\n    // The value indices are inserted out of order, but apparently that's... still OK?\n\n    return m\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @memberof SparseMatrix\n   * @return {SparseMatrix} clone\n   */\n  SparseMatrix.prototype.clone = function () {\n    const m = new SparseMatrix({\n      values: this._values ? clone(this._values) : undefined,\n      index: clone(this._index),\n      ptr: clone(this._ptr),\n      size: clone(this._size),\n      datatype: this._datatype\n    })\n    return m\n  }\n\n  /**\n   * Retrieve the size of the matrix.\n   * @memberof SparseMatrix\n   * @returns {number[]} size\n   */\n  SparseMatrix.prototype.size = function () {\n    return this._size.slice(0) // copy the Array\n  }\n\n  /**\n   * Create a new matrix with the results of the callback function executed on\n   * each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *\n   * @return {SparseMatrix} matrix\n   */\n  SparseMatrix.prototype.map = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke map on a Pattern only matrix') }\n    // matrix instance\n    const me = this\n    // rows and columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    const fastCallback = optimizeCallback(callback, me, 'map')\n    // invoke callback\n    const invoke = function (v, i, j) {\n      // invoke callback\n      return fastCallback.fn(v, [i, j], me)\n    }\n    // invoke _map\n    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros)\n  }\n\n  /**\n   * Create a new matrix with the results of the callback function executed on the interval\n   * [minRow..maxRow, minColumn..maxColumn].\n   */\n  function _map (matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {\n    // result arrays\n    const values = []\n    const index = []\n    const ptr = []\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    if (isString(matrix._datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar\n      // convert 0 to the same datatype\n      zero = typed.convert(0, matrix._datatype)\n    }\n\n    // invoke callback\n    const invoke = function (v, x, y) {\n      // invoke callback\n      const value = callback(v, x, y)\n      // check value != 0\n      if (!eq(value, zero)) {\n        // store value\n        values.push(value)\n        // index\n        index.push(x)\n      }\n    }\n    // loop columns\n    for (let j = minColumn; j <= maxColumn; j++) {\n      // store pointer to values index\n      ptr.push(values.length)\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = matrix._ptr[j]\n      const k1 = matrix._ptr[j + 1]\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (let k = k0; k < k1; k++) {\n          // row index\n          const i = matrix._index[k]\n          // check i is in range\n          if (i >= minRow && i <= maxRow) {\n            // value @ k\n            invoke(matrix._values[k], i - minRow, j - minColumn)\n          }\n        }\n      } else {\n        // create a cache holding all defined values\n        const values = {}\n        for (let k = k0; k < k1; k++) {\n          const i = matrix._index[k]\n          values[i] = matrix._values[k]\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (let i = minRow; i <= maxRow; i++) {\n          const value = (i in values) ? values[i] : 0\n          invoke(value, i - minRow, j - minColumn)\n        }\n      }\n    }\n\n    // store number of values in ptr\n    ptr.push(values.length)\n    // return sparse matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]\n    })\n  }\n\n  /**\n   * Execute a callback function on each entry of the matrix.\n   * @memberof SparseMatrix\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix being traversed.\n   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.\n   *                              If false, the indices are guaranteed to be in order,\n   *                              if true, the indices can be unordered.\n   */\n  SparseMatrix.prototype.forEach = function (callback, skipZeros) {\n    // check it is a pattern matrix\n    if (!this._values) { throw new Error('Cannot invoke forEach on a Pattern only matrix') }\n    // matrix instance\n    const me = this\n    // rows and columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    const fastCallback = optimizeCallback(callback, me, 'forEach')\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n\n      if (skipZeros) {\n        // loop k within [k0, k1[\n        for (let k = k0; k < k1; k++) {\n          // row index\n          const i = this._index[k]\n\n          // value @ k\n          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized\n          fastCallback.fn(this._values[k], [i, j], me)\n        }\n      } else {\n        // create a cache holding all defined values\n        const values = {}\n        for (let k = k0; k < k1; k++) {\n          const i = this._index[k]\n          values[i] = this._values[k]\n        }\n\n        // loop over all rows (indexes can be unordered so we can't use that),\n        // and either read the value or zero\n        for (let i = 0; i < rows; i++) {\n          const value = (i in values) ? values[i] : 0\n          fastCallback.fn(value, [i, j], me)\n        }\n      }\n    }\n  }\n\n  /**\n   * Iterate over the matrix elements, skipping zeros\n   * @return {Iterable<{ value, index: number[] }>}\n   */\n  SparseMatrix.prototype[Symbol.iterator] = function * () {\n    if (!this._values) { throw new Error('Cannot iterate a Pattern only matrix') }\n\n    const columns = this._size[1]\n\n    for (let j = 0; j < columns; j++) {\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n\n      for (let k = k0; k < k1; k++) {\n        // row index\n        const i = this._index[k]\n\n        yield ({ value: this._values[k], index: [i, j] })\n      }\n    }\n  }\n\n  /**\n   * Create an Array with a copy of the data of the SparseMatrix\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.toArray = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, true)\n  }\n\n  /**\n   * Get the primitive value of the SparseMatrix: a two dimensions array\n   * @memberof SparseMatrix\n   * @returns {Array} array\n   */\n  SparseMatrix.prototype.valueOf = function () {\n    return _toArray(this._values, this._index, this._ptr, this._size, false)\n  }\n\n  function _toArray (values, index, ptr, size, copy) {\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n    // result\n    const a = []\n    // vars\n    let i, j\n    // initialize array\n    for (i = 0; i < rows; i++) {\n      a[i] = []\n      for (j = 0; j < columns; j++) { a[i][j] = 0 }\n    }\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // loop k within [k0, k1[\n      for (let k = k0; k < k1; k++) {\n        // row index\n        i = index[k]\n        // set value (use one for pattern matrix)\n        a[i][j] = values ? (copy ? clone(values[k]) : values[k]) : 1\n      }\n    }\n    return a\n  }\n\n  /**\n   * Get a string representation of the matrix, with optional formatting options.\n   * @memberof SparseMatrix\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.format = function (options) {\n    // rows and columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n    // density\n    const density = this.density()\n    // rows & columns\n    let str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\\n'\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n      // loop k within [k0, k1[\n      for (let k = k0; k < k1; k++) {\n        // row index\n        const i = this._index[k]\n        // append value\n        str += '\\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X')\n      }\n    }\n    return str\n  }\n\n  /**\n   * Get a string representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {string} str\n   */\n  SparseMatrix.prototype.toString = function () {\n    return format(this.toArray())\n  }\n\n  /**\n   * Get a JSON representation of the matrix\n   * @memberof SparseMatrix\n   * @returns {Object}\n   */\n  SparseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'SparseMatrix',\n      values: this._values,\n      index: this._index,\n      ptr: this._ptr,\n      size: this._size,\n      datatype: this._datatype\n    }\n  }\n\n  /**\n   * Get the kth Matrix diagonal.\n   *\n   * @memberof SparseMatrix\n   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.\n   *\n   * @returns {Matrix}                     The matrix vector with the diagonal values.\n   */\n  SparseMatrix.prototype.diagonal = function (k) {\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) { k = k.toNumber() }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number')\n      }\n    } else {\n      // default value\n      k = 0\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows & columns\n    const rows = this._size[0]\n    const columns = this._size[1]\n\n    // number diagonal values\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // diagonal arrays\n    const values = []\n    const index = []\n    const ptr = []\n    // initial ptr value\n    ptr[0] = 0\n    // loop columns\n    for (let j = kSuper; j < columns && values.length < n; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = this._ptr[j]\n      const k1 = this._ptr[j + 1]\n      // loop x within [k0, k1[\n      for (let x = k0; x < k1; x++) {\n        // row index\n        const i = this._index[x]\n        // check row\n        if (i === j - kSuper + kSub) {\n          // value on this column\n          values.push(this._values[x])\n          // store row\n          index[values.length - 1] = i - kSub\n          // exit loop\n          break\n        }\n      }\n    }\n    // close ptr\n    ptr.push(values.length)\n    // return matrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [n, 1]\n    })\n  }\n\n  /**\n   * Generate a matrix from a JSON object\n   * @memberof SparseMatrix\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"SparseMatrix\", \"values\": [], \"index\": [], \"ptr\": [], \"size\": []}`,\n   *                       where mathjs is optional\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.fromJSON = function (json) {\n    return new SparseMatrix(json)\n  }\n\n  /**\n   * Create a diagonal matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {Array} size                       The matrix size.\n   * @param {number | Array | Matrix } value   The values for the diagonal.\n   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.\n   * @param {number} [defaultValue]            The default value for non-diagonal\n   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.\n   *\n   * @returns {SparseMatrix}\n   */\n  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {\n    if (!isArray(size)) { throw new TypeError('Array expected, size parameter') }\n    if (size.length !== 2) { throw new Error('Only two dimensions matrix are supported') }\n\n    // map size & validate\n    size = size.map(function (s) {\n      // check it is a big number\n      if (isBigNumber(s)) {\n        // convert it\n        s = s.toNumber()\n      }\n      // validate arguments\n      if (!isNumber(s) || !isInteger(s) || s < 1) {\n        throw new Error('Size values must be positive integers')\n      }\n      return s\n    })\n\n    // validate k if any\n    if (k) {\n      // convert BigNumber to a number\n      if (isBigNumber(k)) { k = k.toNumber() }\n      // is must be an integer\n      if (!isNumber(k) || !isInteger(k)) {\n        throw new TypeError('The parameter k must be an integer number')\n      }\n    } else {\n      // default value\n      k = 0\n    }\n\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    if (isString(datatype)) {\n      // find signature that matches (datatype, datatype)\n      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar\n      // convert 0 to the same datatype\n      zero = typed.convert(0, datatype)\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // rows and columns\n    const rows = size[0]\n    const columns = size[1]\n\n    // number of non-zero items\n    const n = Math.min(rows - kSub, columns - kSuper)\n\n    // value extraction function\n    let _value\n\n    // check value\n    if (isArray(value)) {\n      // validate array\n      if (value.length !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid value array length')\n      }\n      // define function\n      _value = function (i) {\n        // return value @ i\n        return value[i]\n      }\n    } else if (isMatrix(value)) {\n      // matrix size\n      const ms = value.size()\n      // validate matrix\n      if (ms.length !== 1 || ms[0] !== n) {\n        // number of values in array must be n\n        throw new Error('Invalid matrix length')\n      }\n      // define function\n      _value = function (i) {\n        // return value @ i\n        return value.get([i])\n      }\n    } else {\n      // define function\n      _value = function () {\n        // return value\n        return value\n      }\n    }\n\n    // create arrays\n    const values = []\n    const index = []\n    const ptr = []\n\n    // loop items\n    for (let j = 0; j < columns; j++) {\n      // number of rows with value\n      ptr.push(values.length)\n      // diagonal index\n      const i = j - kSuper\n      // check we need to set diagonal value\n      if (i >= 0 && i < n) {\n        // get value @ i\n        const v = _value(i)\n        // check for zero\n        if (!eq(v, zero)) {\n          // column\n          index.push(i + kSub)\n          // add value\n          values.push(v)\n        }\n      }\n    }\n    // last value should be number of values\n    ptr.push(values.length)\n    // create SparseMatrix\n    return new SparseMatrix({\n      values,\n      index,\n      ptr,\n      size: [rows, columns]\n    })\n  }\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @memberof SparseMatrix\n   * @param {number} i       Matrix row index 1\n   * @param {number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  SparseMatrix.prototype.swapRows = function (i, j) {\n    // check index\n    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {\n      throw new Error('Row index must be positive integers')\n    }\n    // check dimensions\n    if (this._size.length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n    // validate index\n    validateIndex(i, this._size[0])\n    validateIndex(j, this._size[0])\n\n    // swap rows\n    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr)\n    // return current instance\n    return this\n  }\n\n  /**\n   * Loop rows with data in column j.\n   *\n   * @param {number} j            Column\n   * @param {Array} values        Matrix values\n   * @param {Array} index         Matrix row indeces\n   * @param {Array} ptr           Matrix column pointers\n   * @param {Function} callback   Callback function invoked for every row in column j\n   */\n  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {\n    // indeces for column j\n    const k0 = ptr[j]\n    const k1 = ptr[j + 1]\n\n    // loop\n    for (let k = k0; k < k1; k++) {\n      // invoke callback\n      callback(index[k], values[k])\n    }\n  }\n\n  /**\n   * Swap rows x and y in Sparse Matrix data structures.\n   *\n   * @param {number} x         Matrix row index 1\n   * @param {number} y         Matrix row index 2\n   * @param {number} columns   Number of columns in matrix\n   * @param {Array} values     Matrix values\n   * @param {Array} index      Matrix row indeces\n   * @param {Array} ptr        Matrix column pointers\n   */\n  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // find value index @ x\n      const kx = _getValueIndex(x, k0, k1, index)\n      // find value index @ x\n      const ky = _getValueIndex(y, k0, k1, index)\n      // check both rows exist in matrix\n      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {\n        // swap values (check for pattern matrix)\n        if (values) {\n          const v = values[kx]\n          values[kx] = values[ky]\n          values[ky] = v\n        }\n        // next column\n        continue\n      }\n      // check x row exist & no y row\n      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {\n        // value @ x (check for pattern matrix)\n        const vx = values ? values[kx] : undefined\n        // insert value @ y\n        index.splice(ky, 0, y)\n        if (values) { values.splice(ky, 0, vx) }\n        // remove value @ x (adjust array index if needed)\n        index.splice(ky <= kx ? kx + 1 : kx, 1)\n        if (values) { values.splice(ky <= kx ? kx + 1 : kx, 1) }\n        // next column\n        continue\n      }\n      // check y row exist & no x row\n      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {\n        // value @ y (check for pattern matrix)\n        const vy = values ? values[ky] : undefined\n        // insert value @ x\n        index.splice(kx, 0, x)\n        if (values) { values.splice(kx, 0, vy) }\n        // remove value @ y (adjust array index if needed)\n        index.splice(kx <= ky ? ky + 1 : ky, 1)\n        if (values) { values.splice(kx <= ky ? ky + 1 : ky, 1) }\n      }\n    }\n  }\n\n  return SparseMatrix\n}, { isClass: true })\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\n\nconst name = 'number'\nconst dependencies = ['typed']\n\n/**\n * Separates the radix, integer part, and fractional part of a non decimal number string\n * @param {string} input string to parse\n * @returns {object} the parts of the string or null if not a valid input\n */\nfunction getNonDecimalNumberParts (input) {\n  const nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\\.([0-9a-fA-F]*)/)\n  if (nonDecimalWithRadixMatch) {\n    const radix = ({ '0b': 2, '0o': 8, '0x': 16 })[nonDecimalWithRadixMatch[1]]\n    const integerPart = nonDecimalWithRadixMatch[2]\n    const fractionalPart = nonDecimalWithRadixMatch[3]\n    return { input, radix, integerPart, fractionalPart }\n  } else {\n    return null\n  }\n}\n\n/**\n * Makes a number from a radix, and integer part, and a fractional part\n * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)\n * @returns {number} the number\n */\nfunction makeNumberFromNonDecimalParts (parts) {\n  const n = parseInt(parts.integerPart, parts.radix)\n  let f = 0\n  for (let i = 0; i < parts.fractionalPart.length; i++) {\n    const digitValue = parseInt(parts.fractionalPart[i], parts.radix)\n    f += digitValue / Math.pow(parts.radix, i + 1)\n  }\n  const result = n + f\n  if (isNaN(result)) {\n    throw new SyntaxError('String \"' + parts.input + '\" is not a valid number')\n  }\n  return result\n}\n\nexport const createNumber = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a number or convert a string, boolean, or unit to a number.\n   * When value is a matrix, all elements will be converted to number.\n   *\n   * Syntax:\n   *\n   *    math.number(value)\n   *    math.number(unit, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.number(2)                         // returns number 2\n   *    math.number('7.2')                     // returns number 7.2\n   *    math.number(true)                      // returns number 1\n   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]\n   *    math.number(math.unit('52cm'), 'm')    // returns 0.52\n   *\n   * See also:\n   *\n   *    bignumber, bigint, boolean, numeric, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted\n   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number\n   * @return {number | Array | Matrix} The created number\n   */\n  const number = typed('number', {\n    '': function () {\n      return 0\n    },\n\n    number: function (x) {\n      return x\n    },\n\n    string: function (x) {\n      if (x === 'NaN') return NaN\n      const nonDecimalNumberParts = getNonDecimalNumberParts(x)\n      if (nonDecimalNumberParts) {\n        return makeNumberFromNonDecimalParts(nonDecimalNumberParts)\n      }\n      let size = 0\n      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/)\n      if (wordSizeSuffixMatch) {\n        // x includes a size suffix like 0xffffi32, so we extract\n        // the suffix and remove it from x\n        size = Number(wordSizeSuffixMatch[2])\n        x = wordSizeSuffixMatch[1]\n      }\n      let num = Number(x)\n      if (isNaN(num)) {\n        throw new SyntaxError('String \"' + x + '\" is not a valid number')\n      }\n      if (wordSizeSuffixMatch) {\n        // x is a signed bin, oct, or hex literal\n        // num is the value of string x if x is interpreted as unsigned\n        if (num > 2 ** size - 1) {\n          // literal is too large for size suffix\n          throw new SyntaxError(`String \"${x}\" is out of range`)\n        }\n        // check if the bit at index size - 1 is set and if so do the twos complement\n        if (num >= 2 ** (size - 1)) {\n          num = num - 2 ** size\n        }\n      }\n      return num\n    },\n\n    BigNumber: function (x) {\n      return x.toNumber()\n    },\n\n    bigint: function (x) {\n      return Number(x)\n    },\n\n    Fraction: function (x) {\n      return x.valueOf()\n    },\n\n    Unit: typed.referToSelf(self => (x) => {\n      const clone = x.clone()\n      clone.value = self(x.value)\n      return clone\n    }),\n\n    null: function (x) {\n      return 0\n    },\n\n    'Unit, string | Unit': function (unit, valuelessUnit) {\n      return unit.toNumber(valuelessUnit)\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"number\",\"value\":\"2.3\"}\n  //\n  // into a number 2.3\n  number.fromJSON = function (json) {\n    return parseFloat(json.value)\n  }\n\n  return number\n})\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\n\nconst name = 'bigint'\nconst dependencies = ['typed']\n\nexport const createBigint = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a bigint or convert a string, boolean, or unit to a bigint.\n   * When value is a matrix, all elements will be converted to bigint.\n   *\n   * Syntax:\n   *\n   *    math.bigint(value)\n   *\n   * Examples:\n   *\n   *    math.bigint(2)                         // returns 2n\n   *    math.bigint('123')                     // returns 123n\n   *    math.bigint(true)                      // returns 1n\n   *    math.bigint([true, false, true, true]) // returns [1n, 0n, 1n, 1n]\n   *\n   * See also:\n   *\n   *    number, bignumber, boolean, complex, index, matrix, string, unit\n   *\n   * @param {string | number | BigNumber | bigint | Fraction | boolean | Array | Matrix | null} [value]  Value to be converted\n   * @return {bigint | Array | Matrix} The created bigint\n   */\n  const bigint = typed('bigint', {\n    '': function () {\n      return 0n\n    },\n\n    bigint: function (x) {\n      return x\n    },\n\n    number: function (x) {\n      return BigInt(x.toFixed())\n    },\n\n    BigNumber: function (x) {\n      return BigInt(x.round().toString())\n    },\n\n    Fraction: function (x) {\n      return BigInt(x.valueOf().toFixed())\n    },\n\n    'string | boolean': function (x) {\n      return BigInt(x)\n    },\n\n    null: function (x) {\n      return 0n\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n\n  // reviver function to parse a JSON object like:\n  //\n  //     {\"mathjs\":\"bigint\",\"value\":\"123\"}\n  //\n  // into a bigint 123n\n  bigint.fromJSON = function (json) {\n    return BigInt(json.value)\n  }\n\n  return bigint\n})\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\nimport { format } from '../utils/number.js'\n\nconst name = 'string'\nconst dependencies = ['typed']\n\nexport const createString = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a string or convert any object into a string.\n   * Elements of Arrays and Matrices are processed element wise.\n   *\n   * Syntax:\n   *\n   *    math.string(value)\n   *\n   * Examples:\n   *\n   *    math.string(4.2)                // returns string '4.2'\n   *    math.string(math.complex(3, 2)) // returns string '3 + 2i'\n   *\n   *    const u = math.unit(5, 'km')\n   *    math.string(u.to('m'))          // returns string '5000 m'\n   *\n   *    math.string([true, false])      // returns ['true', 'false']\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, unit\n   *\n   * @param {* | Array | Matrix | null} [value]  A value to convert to a string\n   * @return {string | Array | Matrix} The created string\n   */\n  return typed(name, {\n    '': function () {\n      return ''\n    },\n\n    number: format,\n\n    null: function (x) {\n      return 'null'\n    },\n\n    boolean: function (x) {\n      return x + ''\n    },\n\n    string: function (x) {\n      return x\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self)),\n\n    any: function (x) {\n      return String(x)\n    }\n  })\n})\n","import { factory } from '../utils/factory.js'\nimport { deepMap } from '../utils/collection.js'\n\nconst name = 'boolean'\nconst dependencies = ['typed']\n\nexport const createBoolean = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a boolean or convert a string or number to a boolean.\n   * In case of a number, `true` is returned for non-zero numbers, and `false` in\n   * case of zero.\n   * Strings can be `'true'` or `'false'`, or can contain a number.\n   * When value is a matrix, all elements will be converted to boolean.\n   *\n   * Syntax:\n   *\n   *    math.boolean(x)\n   *\n   * Examples:\n   *\n   *    math.boolean(0)     // returns false\n   *    math.boolean(1)     // returns true\n   *    math.boolean(-3)     // returns true\n   *    math.boolean('true')     // returns true\n   *    math.boolean('false')     // returns false\n   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]\n   *\n   * See also:\n   *\n   *    bignumber, complex, index, matrix, string, unit\n   *\n   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type\n   * @return {boolean | Array | Matrix} The boolean value\n   */\n  return typed(name, {\n    '': function () {\n      return false\n    },\n\n    boolean: function (x) {\n      return x\n    },\n\n    number: function (x) {\n      return !!x\n    },\n\n    null: function (x) {\n      return false\n    },\n\n    BigNumber: function (x) {\n      return !x.isZero()\n    },\n\n    string: function (x) {\n      // try case insensitive\n      const lcase = x.toLowerCase()\n      if (lcase === 'true') {\n        return true\n      } else if (lcase === 'false') {\n        return false\n      }\n\n      // test whether value is a valid number\n      const num = Number(x)\n      if (x !== '' && !isNaN(num)) {\n        return !!num\n      }\n\n      throw new Error('Cannot convert \"' + x + '\" to a boolean')\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'bignumber'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createBignumber = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Create a BigNumber, which can store numbers with arbitrary precision.\n   * When a matrix is provided, all elements will be converted to BigNumber.\n   *\n   * Syntax:\n   *\n   *    math.bignumber(x)\n   *\n   * Examples:\n   *\n   *    0.1 + 0.2                                  // returns number 0.30000000000000004\n   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3\n   *\n   *\n   *    7.2e500                                    // returns number Infinity\n   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500\n   *\n   * See also:\n   *\n   *    number, bigint, boolean, complex, index, matrix, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | Array | Matrix | boolean | null} [value]  Value for the big number,\n   *                                                    0 by default.\n   * @returns {BigNumber} The created bignumber\n   */\n  return typed('bignumber', {\n    '': function () {\n      return new BigNumber(0)\n    },\n\n    number: function (x) {\n      // convert to string to prevent errors in case of >15 digits\n      return new BigNumber(x + '')\n    },\n\n    string: function (x) {\n      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/)\n      if (wordSizeSuffixMatch) {\n        // x has a word size suffix\n        const size = wordSizeSuffixMatch[2]\n        const n = BigNumber(wordSizeSuffixMatch[1])\n        const twoPowSize = new BigNumber(2).pow(Number(size))\n        if (n.gt(twoPowSize.sub(1))) {\n          throw new SyntaxError(`String \"${x}\" is out of range`)\n        }\n        const twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1)\n        if (n.gte(twoPowSizeSubOne)) {\n          return n.sub(twoPowSize)\n        } else {\n          return n\n        }\n      }\n      return new BigNumber(x)\n    },\n\n    BigNumber: function (x) {\n      // we assume a BigNumber is immutable\n      return x\n    },\n\n    bigint: function (x) {\n      return new BigNumber(x.toString())\n    },\n\n    Unit: typed.referToSelf(self => (x) => {\n      const clone = x.clone()\n      clone.value = self(x.value)\n      return clone\n    }),\n\n    Fraction: function (x) {\n      return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s))\n    },\n\n    null: function (_x) {\n      return new BigNumber(0)\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'complex'\nconst dependencies = ['typed', 'Complex']\n\nexport const createComplex = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex }) => {\n  /**\n   * Create a complex value or convert a value to a complex value.\n   *\n   * Syntax:\n   *\n   *     math.complex()                           // creates a complex value with zero\n   *                                              // as real and imaginary part.\n   *     math.complex(re : number, im : string)   // creates a complex value with provided\n   *                                              // values for real and imaginary part.\n   *     math.complex(re : number)                // creates a complex value with provided\n   *                                              // real value and zero imaginary part.\n   *     math.complex(complex : Complex)          // clones the provided complex value.\n   *     math.complex(arg : string)               // parses a string into a complex value.\n   *     math.complex(array : Array)              // converts the elements of the array\n   *                                              // or matrix element wise into a\n   *                                              // complex value.\n   *     math.complex({re: number, im: number})   // creates a complex value with provided\n   *                                              // values for real an imaginary part.\n   *     math.complex({r: number, phi: number})   // creates a complex value with provided\n   *                                              // polar coordinates\n   *\n   * Examples:\n   *\n   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i\n   *    a.re = 5                          // a = Complex 5 - 4i\n   *    const i = a.im                    // Number -4\n   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i\n   *    const c = math.complex()          // Complex 0 + 0i\n   *    const d = math.add(a, b)          // Complex 5 + 2i\n   *\n   * See also:\n   *\n   *    bignumber, boolean, index, matrix, number, string, unit\n   *\n   * @param {* | Array | Matrix} [args]\n   *            Arguments specifying the real and imaginary part of the complex number\n   * @return {Complex | Array | Matrix} Returns a complex value\n   */\n  return typed('complex', {\n    '': function () {\n      return Complex.ZERO\n    },\n\n    number: function (x) {\n      return new Complex(x, 0)\n    },\n\n    'number, number': function (re, im) {\n      return new Complex(re, im)\n    },\n\n    // TODO: this signature should be redundant\n    'BigNumber, BigNumber': function (re, im) {\n      return new Complex(re.toNumber(), im.toNumber())\n    },\n\n    Fraction: function (x) {\n      return new Complex(x.valueOf(), 0)\n    },\n\n    Complex: function (x) {\n      return x.clone()\n    },\n\n    string: function (x) {\n      return Complex(x) // for example '2 + 3i'\n    },\n\n    null: function (x) {\n      return Complex(0)\n    },\n\n    Object: function (x) {\n      if ('re' in x && 'im' in x) {\n        return new Complex(x.re, x.im)\n      }\n\n      if (('r' in x && 'phi' in x) || ('abs' in x && 'arg' in x)) {\n        return new Complex(x)\n      }\n\n      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)')\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'fraction'\nconst dependencies = ['typed', 'Fraction']\n\nexport const createFraction = /* #__PURE__ */ factory(name, dependencies, ({ typed, Fraction }) => {\n  /**\n   * Create a fraction or convert a value to a fraction.\n   *\n   * With one numeric argument, produces the closest rational approximation to the\n   * input.\n   * With two arguments, the first is the numerator and the second is the denominator,\n   * and creates the corresponding fraction. Both numerator and denominator must be\n   * integers.\n   * With one object argument, looks for the integer numerator as the value of property\n   * 'n' and the integer denominator as the value of property 'd'.\n   * With a matrix argument, creates a matrix of the same shape with entries\n   * converted into fractions.\n   *\n   * Syntax:\n   *     math.fraction(value)\n   *     math.fraction(numerator, denominator)\n   *     math.fraction({n: numerator, d: denominator})\n   *     math.fraction(matrix: Array | Matrix)\n   *\n   * Examples:\n   *\n   *     math.fraction(6.283)             // returns Fraction 6283/1000\n   *     math.fraction(1, 3)              // returns Fraction 1/3\n   *     math.fraction('2/3')             // returns Fraction 2/3\n   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3\n   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]\n   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer\n   *\n   * See also:\n   *\n   *    bignumber, number, string, unit\n   *\n   * @param {number | string | Fraction | BigNumber | bigint | Unit | Array | Matrix} [args]\n   *            Arguments specifying the value, or numerator and denominator of\n   *            the fraction\n   * @return {Fraction | Array | Matrix} Returns a fraction\n   */\n  return typed('fraction', {\n    number: function (x) {\n      if (!isFinite(x) || isNaN(x)) {\n        throw new Error(x + ' cannot be represented as a fraction')\n      }\n\n      return new Fraction(x)\n    },\n\n    string: function (x) {\n      return new Fraction(x)\n    },\n\n    'number, number': function (numerator, denominator) {\n      return new Fraction(numerator, denominator)\n    },\n\n    'bigint, bigint': function (numerator, denominator) {\n      return new Fraction(numerator, denominator)\n    },\n\n    null: function (x) {\n      return new Fraction(0)\n    },\n\n    BigNumber: function (x) {\n      return new Fraction(x.toString())\n    },\n\n    bigint: function (x) {\n      return new Fraction(x.toString())\n    },\n\n    Fraction: function (x) {\n      return x // fractions are immutable\n    },\n\n    Unit: typed.referToSelf(self => (x) => {\n      const clone = x.clone()\n      clone.value = self(x.value)\n      return clone\n    }),\n\n    Object: function (x) {\n      return new Fraction(x)\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'matrix'\nconst dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix']\n\nexport const createMatrix = /* #__PURE__ */ factory(name, dependencies, ({ typed, Matrix, DenseMatrix, SparseMatrix }) => {\n  /**\n   * Create a Matrix. The function creates a new `math.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Supported storage formats are 'dense' and 'sparse'.\n   *\n   * Syntax:\n   *\n   *    math.matrix()                         // creates an empty matrix using default storage format (dense).\n   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).\n   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.\n   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.\n   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.\n   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.\n   *\n   * Examples:\n   *\n   *    let m = math.matrix([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, sparse\n   *\n   * @param {Array | Matrix} [data]    A multi dimensional array\n   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]        Type of the values\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function () {\n      return _create([])\n    },\n\n    string: function (format) {\n      return _create([], format)\n    },\n\n    'string, string': function (format, datatype) {\n      return _create([], format, datatype)\n    },\n\n    Array: function (data) {\n      return _create(data)\n    },\n\n    Matrix: function (data) {\n      return _create(data, data.storage())\n    },\n\n    'Array | Matrix, string': _create,\n\n    'Array | Matrix, string, string': _create\n  })\n\n  /**\n   * Create a new Matrix with given storage format\n   * @param {Array} data\n   * @param {string} [format]\n   * @param {string} [datatype]\n   * @returns {Matrix} Returns a new Matrix\n   * @private\n   */\n  function _create (data, format, datatype) {\n    // get storage format constructor\n    if (format === 'dense' || format === 'default' || format === undefined) {\n      return new DenseMatrix(data, datatype)\n    }\n\n    if (format === 'sparse') {\n      return new SparseMatrix(data, datatype)\n    }\n\n    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.')\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromFunction'\nconst dependencies = ['typed', 'matrix', 'isZero']\n\nexport const createMatrixFromFunction = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isZero }) => {\n  /**\n   * Create a matrix by evaluating a generating function at each index.\n   * The simplest overload returns a multi-dimensional array as long as `size`\n   * is an array.\n   * Passing `size` as a Matrix or specifying a `format` will result in\n   * returning a Matrix.\n   *\n   * Syntax:\n   *\n   *    math.matrixFromFunction(size, fn)\n   *    math.matrixFromFunction(size, fn, format)\n   *    math.matrixFromFunction(size, fn, format, datatype)\n   *    math.matrixFromFunction(size, format, fn)\n   *    math.matrixFromFunction(size, format, datatype, fn)\n   *\n   * Where:\n   *\n   *    - `size: (number[] | Matrix)`\n   *      A vector giving the extent of the array to be created in each\n   *      dimension. If size has one entry, a vector is created; if it\n   *      has two, a rectangular array/Matrix is created; if three, a\n   *      three-dimensional array/Matrix is created; and so on.\n   *    - `fn: (index: number[]) => MathType`\n   *      The callback function that will generate the entries of the\n   *      matrix. It is called in turn with the index of each entry of\n   *      the matrix. The index is always an ordinary array of numbers\n   *      with the same length as _size_. So for vectors, you will get\n   *      indices like `[0]` or `[1]`, whereas for matrices, you will\n   *      get indices like `[2, 0]` or `[1,3]`. The return value may\n   *      be any type that can go in an array or Matrix entry, although\n   *      if you supply the _datatype_ argument, you must yourself ensure\n   *      the type of the return value matches. Note that currently,\n   *      your callback _fn_ will receive 0-based indices for the matrix\n   *      entries, regardless of whether matrixFromFunction is invoked\n   *      directly from JavaScript or via the mathjs expression language.\n   *    - `format: 'dense'|'sparse'`\n   *      Specifies the storage format for the resulting Matrix. Note that\n   *      if this argument is given, the return value will always be a\n   *      Matrix (rather than possibly an Array).\n   *    - `datatype: string`\n   *      Specifies the data type of entries of the new matrix. If given,\n   *      it should be the name of a data type that mathjs supports, as\n   *      returned by the math.typeOf function. It is up to the caller\n   *      to make certain that all values returned by _fn_ are consistent\n   *      with this datatype if specified.\n   *\n   * Examples:\n   *\n   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix\n   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix\n   *    math.matrixFromFunction([5], i => math.random()) // a random vector\n   *\n   * See also:\n   *\n   *    matrix, typeOf, zeros\n   *\n   * @param {Array | Matrix} size   The size of the matrix to be created\n   * @param {function} fn           Callback function invoked for every entry in the matrix\n   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`\n   * @param {string} [datatype]     Type of the values\n   * @return {Array | Matrix} Returns the created matrix\n   */\n  return typed(name, {\n    'Array | Matrix, function, string, string': function (size, fn, format, datatype) {\n      return _create(size, fn, format, datatype)\n    },\n    'Array | Matrix, function, string': function (size, fn, format) {\n      return _create(size, fn, format)\n    },\n    'Matrix, function': function (size, fn) {\n      return _create(size, fn, 'dense')\n    },\n    'Array, function': function (size, fn) {\n      return _create(size, fn, 'dense').toArray()\n    },\n    'Array | Matrix, string, function': function (size, format, fn) {\n      return _create(size, fn, format)\n    },\n    'Array | Matrix, string, string, function': function (size, format, datatype, fn) {\n      return _create(size, fn, format, datatype)\n    }\n  })\n\n  function _create (size, fn, format, datatype) {\n    let m\n    if (datatype !== undefined) {\n      m = matrix(format, datatype)\n    } else {\n      m = matrix(format)\n    }\n\n    m.resize(size)\n    m.forEach(function (_, index) {\n      const val = fn(index)\n      if (isZero(val)) return\n      m.set(index, val)\n    })\n\n    return m\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromRows'\nconst dependencies = ['typed', 'matrix', 'flatten', 'size']\n\nexport const createMatrixFromRows = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, flatten, size }) => {\n  /**\n   * Create a dense matrix from vectors as individual rows.\n   * If you pass column vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromRows(...arr)\n   *    math.matrixFromRows(row1, row2)\n   *    math.matrixFromRows(row1, row2, row3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromRows(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromColumns, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} rows  Multiple rows\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function (arr) {\n      return _createArray(arr)\n    },\n    '...Matrix': function (arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())))\n    }\n\n    // TODO implement this properly for SparseMatrix\n  })\n\n  function _createArray (arr) {\n    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.')\n    const N = checkVectorTypeAndReturnLength(arr[0])\n\n    const result = []\n    for (const row of arr) {\n      const rowLength = checkVectorTypeAndReturnLength(row)\n\n      if (rowLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0))\n      }\n\n      result.push(flatten(row))\n    }\n\n    return result\n  }\n\n  function checkVectorTypeAndReturnLength (vec) {\n    const s = size(vec)\n\n    if (s.length === 1) { // 1D vector\n      return s[0]\n    } else if (s.length === 2) { // 2D vector\n      if (s[0] === 1) { // row vector\n        return s[1]\n      } else if (s[1] === 1) { // col vector\n        return s[0]\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.')\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.')\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'matrixFromColumns'\nconst dependencies = ['typed', 'matrix', 'flatten', 'size']\n\nexport const createMatrixFromColumns = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, flatten, size }) => {\n  /**\n   * Create a dense matrix from vectors as individual columns.\n   * If you pass row vectors, they will be transposed (but not conjugated!)\n   *\n   * Syntax:\n   *\n   *    math.matrixFromColumns(...arr)\n   *    math.matrixFromColumns(col1, col2)\n   *    math.matrixFromColumns(col1, col2, col3)\n   *\n   * Examples:\n   *\n   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])\n   *    math.matrixFromColumns(...vectors)\n   *\n   * See also:\n   *\n   *    matrix, matrixFromRows, matrixFromFunction, zeros\n   *\n   * @param {... Array | Matrix} cols Multiple columns\n   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned\n   */\n  return typed(name, {\n    '...Array': function (arr) {\n      return _createArray(arr)\n    },\n    '...Matrix': function (arr) {\n      return matrix(_createArray(arr.map(m => m.toArray())))\n    }\n\n    // TODO implement this properly for SparseMatrix\n  })\n\n  function _createArray (arr) {\n    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.')\n    const N = checkVectorTypeAndReturnLength(arr[0])\n\n    // create an array with empty rows\n    const result = []\n    for (let i = 0; i < N; i++) {\n      result[i] = []\n    }\n\n    // loop columns\n    for (const col of arr) {\n      const colLength = checkVectorTypeAndReturnLength(col)\n\n      if (colLength !== N) {\n        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0))\n      }\n\n      const f = flatten(col)\n\n      // push a value to each row\n      for (let i = 0; i < N; i++) {\n        result[i].push(f[i])\n      }\n    }\n\n    return result\n  }\n\n  function checkVectorTypeAndReturnLength (vec) {\n    const s = size(vec)\n\n    if (s.length === 1) { // 1D vector\n      return s[0]\n    } else if (s.length === 2) { // 2D vector\n      if (s[0] === 1) { // row vector\n        return s[1]\n      } else if (s[1] === 1) { // col vector\n        return s[0]\n      } else {\n        throw new TypeError('At least one of the arguments is not a vector.')\n      }\n    } else {\n      throw new TypeError('Only one- or two-dimensional vectors are supported.')\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'splitUnit'\nconst dependencies = ['typed']\n\nexport const createSplitUnit = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Split a unit in an array of units whose sum is equal to the original unit.\n   *\n   * Syntax:\n   *\n   *     math.splitUnit(unit: Unit, parts: Array.<Unit>)\n   *\n   * Example:\n   *\n   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])\n   *     // [ 3 feet, 3.3700787401575 inch ]\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @param {Array} [parts] An array of strings or valueless units.\n   * @return {Array} An array of units.\n   */\n  return typed(name, {\n    'Unit, Array': function (unit, parts) {\n      return unit.splitUnit(parts)\n    }\n  })\n})\n","import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function absNumber (a) {\n  return Math.abs(a)\n}\nabsNumber.signature = n1\n\nexport function addNumber (a, b) {\n  return a + b\n}\naddNumber.signature = n2\n\nexport function subtractNumber (a, b) {\n  return a - b\n}\nsubtractNumber.signature = n2\n\nexport function multiplyNumber (a, b) {\n  return a * b\n}\nmultiplyNumber.signature = n2\n\nexport function divideNumber (a, b) {\n  return a / b\n}\ndivideNumber.signature = n2\n\nexport function unaryMinusNumber (x) {\n  return -x\n}\nunaryMinusNumber.signature = n1\n\nexport function unaryPlusNumber (x) {\n  return x\n}\nunaryPlusNumber.signature = n1\n\nexport function cbrtNumber (x) {\n  return cbrt(x)\n}\ncbrtNumber.signature = n1\n\nexport function cubeNumber (x) {\n  return x * x * x\n}\ncubeNumber.signature = n1\n\nexport function expNumber (x) {\n  return Math.exp(x)\n}\nexpNumber.signature = n1\n\nexport function expm1Number (x) {\n  return expm1(x)\n}\nexpm1Number.signature = n1\n\n/**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n */\nexport function gcdNumber (a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function gcd must be integer numbers')\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  let r\n  while (b !== 0) {\n    r = a % b\n    a = b\n    b = r\n  }\n  return (a < 0) ? -a : a\n}\ngcdNumber.signature = n2\n\n/**\n * Calculate lcm for two numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the least common multiple of a and b\n */\nexport function lcmNumber (a, b) {\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function lcm must be integer numbers')\n  }\n\n  if (a === 0 || b === 0) {\n    return 0\n  }\n\n  // https://en.wikipedia.org/wiki/Euclidean_algorithm\n  // evaluate lcm here inline to reduce overhead\n  let t\n  const prod = a * b\n  while (b !== 0) {\n    t = b\n    b = a % t\n    a = t\n  }\n  return Math.abs(prod / a)\n}\nlcmNumber.signature = n2\n\n/**\n * Calculate the logarithm of a value, optionally to a given base.\n * @param {number} x\n * @param {number | null | undefined} base\n * @return {number}\n */\nexport function logNumber (x, y) {\n  if (y) { return Math.log(x) / Math.log(y) }\n  return Math.log(x)\n}\n\n/**\n * Calculate the 10-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log10Number (x) {\n  return log10(x)\n}\nlog10Number.signature = n1\n\n/**\n * Calculate the 2-base logarithm of a number\n * @param {number} x\n * @return {number}\n */\nexport function log2Number (x) {\n  return log2(x)\n}\nlog2Number.signature = n1\n\n/**\n * Calculate the natural logarithm of a `number+1`\n * @param {number} x\n * @returns {number}\n */\nexport function log1pNumber (x) {\n  return log1p(x)\n}\nlog1pNumber.signature = n1\n\n/**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\nexport function modNumber (x, y) {\n  // We don't use JavaScript's % operator here as this doesn't work\n  // correctly for x < 0 and x === 0\n  // see https://en.wikipedia.org/wiki/Modulo_operation\n  return (y === 0) ? x : x - y * Math.floor(x / y)\n}\nmodNumber.signature = n2\n\n/**\n * Calculate the nth root of a, solve x^root == a\n * http://rosettacode.org/wiki/Nth_root#JavaScript\n * @param {number} a\n * @param {number} [2] root\n * @private\n */\nexport function nthRootNumber (a, root = 2) {\n  const inv = root < 0\n  if (inv) {\n    root = -root\n  }\n\n  if (root === 0) {\n    throw new Error('Root must be non-zero')\n  }\n  if (a < 0 && (Math.abs(root) % 2 !== 1)) {\n    throw new Error('Root must be odd when a is negative.')\n  }\n\n  // edge cases zero and infinity\n  if (a === 0) {\n    return inv ? Infinity : 0\n  }\n  if (!isFinite(a)) {\n    return inv ? 0 : a\n  }\n\n  let x = Math.pow(Math.abs(a), 1 / root)\n  // If a < 0, we require that root is an odd integer,\n  // so (-1) ^ (1/root) = -1\n  x = a < 0 ? -x : x\n  return inv ? 1 / x : x\n\n  // Very nice algorithm, but fails with nthRoot(-2, 3).\n  // Newton's method has some well-known problems at times:\n  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis\n  /*\n  let x = 1 // Initial guess\n  let xPrev = 1\n  let i = 0\n  const iMax = 10000\n  do {\n    const delta = (a / Math.pow(x, root - 1) - x) / root\n    xPrev = x\n    x = x + delta\n    i++\n  }\n  while (xPrev !== x && i < iMax)\n\n  if (xPrev !== x) {\n    throw new Error('Function nthRoot failed to converge')\n  }\n\n  return inv ? 1 / x : x\n  */\n}\n\nexport function signNumber (x) {\n  return sign(x)\n}\nsignNumber.signature = n1\n\nexport function sqrtNumber (x) {\n  return Math.sqrt(x)\n}\nsqrtNumber.signature = n1\n\nexport function squareNumber (x) {\n  return x * x\n}\nsquareNumber.signature = n1\n\n/**\n * Calculate xgcd for two numbers\n * @param {number} a\n * @param {number} b\n * @return {number} result\n * @private\n */\nexport function xgcdNumber (a, b) {\n  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n  let t // used to swap two variables\n  let q // quotient\n  let r // remainder\n  let x = 0\n  let lastx = 1\n  let y = 1\n  let lasty = 0\n\n  if (!isInteger(a) || !isInteger(b)) {\n    throw new Error('Parameters in function xgcd must be integer numbers')\n  }\n\n  while (b) {\n    q = Math.floor(a / b)\n    r = a - q * b\n\n    t = x\n    x = lastx - q * x\n    lastx = t\n\n    t = y\n    y = lasty - q * y\n    lasty = t\n\n    a = b\n    b = r\n  }\n\n  let res\n  if (a < 0) {\n    res = [-a, -lastx, -lasty]\n  } else {\n    res = [a, a ? lastx : 0, lasty]\n  }\n  return res\n}\nxgcdNumber.signature = n2\n\n/**\n * Calculates the power of x to y, x^y, for two numbers.\n * @param {number} x\n * @param {number} y\n * @return {number} res\n */\nexport function powNumber (x, y) {\n  // x^Infinity === 0 if -1 < x < 1\n  // A real number 0 is returned instead of complex(0)\n  if ((x * x < 1 && y === Infinity) ||\n    (x * x > 1 && y === -Infinity)) {\n    return 0\n  }\n\n  return Math.pow(x, y)\n}\npowNumber.signature = n2\n\n/**\n * round a number to the given number of decimals, or to zero if decimals is\n * not provided\n * @param {number} value\n * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)\n * @return {number} roundedValue\n */\nexport function roundNumber (value, decimals = 0) {\n  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {\n    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive')\n  }\n  return parseFloat(toFixed(value, decimals))\n}\n\n/**\n * Calculate the norm of a number, the absolute value.\n * @param {number} x\n * @return {number}\n */\nexport function normNumber (x) {\n  return Math.abs(x)\n}\nnormNumber.signature = n1\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { unaryMinusNumber } from '../../plain/number/index.js'\n\nconst name = 'unaryMinus'\nconst dependencies = ['typed']\n\nexport const createUnaryMinus = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Inverse the sign of a value, apply a unary minus operation.\n   *\n   * For matrices, the function is evaluated element wise. Boolean values and\n   * strings will be converted to a number. For complex numbers, both real and\n   * complex value are inverted.\n   *\n   * Syntax:\n   *\n   *    math.unaryMinus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryMinus(3.5)      // returns -3.5\n   *    math.unaryMinus(-4.2)     // returns 4.2\n   *\n   * See also:\n   *\n   *    add, subtract, unaryPlus\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.\n   */\n  return typed(name, {\n    number: unaryMinusNumber,\n\n    'Complex | BigNumber | Fraction': x => x.neg(),\n\n    bigint: x => -x,\n\n    Unit: typed.referToSelf(self => x => {\n      const res = x.clone()\n      res.value = typed.find(self, res.valueType())(x.value)\n      return res\n    }),\n\n    // deep map collection, skip zeros since unaryMinus(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n\n    // TODO: add support for string\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { unaryPlusNumber } from '../../plain/number/index.js'\nimport { safeNumberType } from '../../utils/number.js'\n\nconst name = 'unaryPlus'\nconst dependencies = ['typed', 'config', 'numeric']\n\nexport const createUnaryPlus = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric }) => {\n  /**\n   * Unary plus operation.\n   * Boolean values and strings will be converted to a number, numeric values will be returned as is.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.unaryPlus(x)\n   *\n   * Examples:\n   *\n   *    math.unaryPlus(3.5)      // returns 3.5\n   *    math.unaryPlus(1)     // returns 1\n   *\n   * See also:\n   *\n   *    unaryMinus, add, subtract\n   *\n   * @param  {number | BigNumber | bigint | Fraction | string | Complex | Unit | Array | Matrix} x\n   *            Input value\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns the input value when numeric, converts to a number when input is non-numeric.\n   */\n  return typed(name, {\n    number: unaryPlusNumber,\n\n    Complex: function (x) {\n      return x // complex numbers are immutable\n    },\n\n    BigNumber: function (x) {\n      return x // bignumbers are immutable\n    },\n\n    bigint: function (x) {\n      return x\n    },\n\n    Fraction: function (x) {\n      return x // fractions are immutable\n    },\n\n    Unit: function (x) {\n      return x.clone()\n    },\n\n    // deep map collection, skip zeros since unaryPlus(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),\n\n    boolean: function (x) {\n      return numeric(x ? 1 : 0, config.number)\n    },\n\n    string: function (x) {\n      return numeric(x, safeNumberType(x, config))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { absNumber } from '../../plain/number/index.js'\n\nconst name = 'abs'\nconst dependencies = ['typed']\n\nexport const createAbs = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the absolute value of a number. For matrices, the function is\n   * evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.abs(x)\n   *\n   * Examples:\n   *\n   *    math.abs(3.5)                // returns number 3.5\n   *    math.abs(-4.2)               // returns number 4.2\n   *\n   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]\n   *\n   * See also:\n   *\n   *    sign\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            A number or matrix for which to get the absolute value\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            Absolute value of `x`\n   */\n  return typed(name, {\n    number: absNumber,\n\n    'Complex | BigNumber | Fraction | Unit': x => x.abs(),\n\n    bigint: x => x < 0n ? -x : x,\n\n    // deep map collection, skip zeros since abs(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { arraySize } from '../../utils/array.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { IndexError } from '../../error/IndexError.js'\n\nconst name = 'mapSlices'\nconst dependencies = ['typed', 'isInteger']\n\nexport const createMapSlices = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  /**\n   * Apply a function that maps an array to a scalar\n   * along a given axis of a matrix or array.\n   * Returns a new matrix or array with one less dimension than the input.\n   *\n   * Syntax:\n   *\n   *     math.mapSlices(A, dim, callback)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [3, 4]]\n   *    const sum = math.sum\n   *\n   *    math.mapSlices(A, 0, sum)             // returns [4, 6]\n   *    math.mapSlices(A, 1, sum)             // returns [3, 7]\n   *\n   * See also:\n   *\n   *    map, filter, forEach\n   *\n   * Note:\n   *\n   *    `mapSlices()` is also currently available via its deprecated\n   *    synonym `apply()`.\n   *\n   * @param {Array | Matrix} array   The input Matrix\n   * @param {number} dim             The dimension along which the callback is applied\n   * @param {Function} callback      The callback function that is applied. This Function\n   *                                 should take an array or 1-d matrix as an input and\n   *                                 return a number.\n   * @return {Array | Matrix} res    The residual matrix with the function mapped on the slices over some dimension.\n   */\n  return typed(name, {\n    'Array | Matrix, number | BigNumber, function': function (mat, dim, callback) {\n      if (!isInteger(dim)) {\n        throw new TypeError('Integer number expected for dimension')\n      }\n\n      const size = Array.isArray(mat) ? arraySize(mat) : mat.size()\n      if (dim < 0 || (dim >= size.length)) {\n        throw new IndexError(dim, size.length)\n      }\n\n      if (isMatrix(mat)) {\n        return mat.create(_mapSlices(mat.valueOf(), dim, callback), mat.datatype())\n      } else {\n        return _mapSlices(mat, dim, callback)\n      }\n    }\n  })\n}, { formerly: 'apply' })\n\n/**\n * Recursively reduce a matrix\n * @param {Array} mat\n * @param {number} dim\n * @param {Function} callback\n * @returns {Array} ret\n * @private\n */\nfunction _mapSlices (mat, dim, callback) {\n  let i, ret, tran\n\n  if (dim <= 0) {\n    if (!Array.isArray(mat[0])) {\n      return callback(mat)\n    } else {\n      tran = _switch(mat)\n      ret = []\n      for (i = 0; i < tran.length; i++) {\n        ret[i] = _mapSlices(tran[i], dim - 1, callback)\n      }\n      return ret\n    }\n  } else {\n    ret = []\n    for (i = 0; i < mat.length; i++) {\n      ret[i] = _mapSlices(mat[i], dim - 1, callback)\n    }\n    return ret\n  }\n}\n\n/**\n * Transpose a matrix\n * @param {Array} mat\n * @returns {Array} ret\n * @private\n */\nfunction _switch (mat) {\n  const I = mat.length\n  const J = mat[0].length\n  let i, j\n  const ret = []\n  for (j = 0; j < J; j++) {\n    const tmp = []\n    for (i = 0; i < I; i++) {\n      tmp.push(mat[i][j])\n    }\n    ret.push(tmp)\n  }\n  return ret\n}\n","import { factory } from '../../utils/factory.js'\nimport { addNumber } from '../../plain/number/index.js'\n\nconst name = 'addScalar'\nconst dependencies = ['typed']\n\nexport const createAddScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Add two scalar values, `x + y`.\n   * This function is meant for internal use: it is used by the public function\n   * `add`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to add\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to add\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Sum of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n\n    'number, number': addNumber,\n\n    'Complex, Complex': function (x, y) {\n      return x.add(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.plus(y)\n    },\n\n    'bigint, bigint': function (x, y) {\n      return x + y\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.add(y)\n    },\n\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value')\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value')\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match')\n\n      const res = x.clone()\n      res.value =\n        typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value)\n      res.fixPrefix = false\n      return res\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { subtractNumber } from '../../plain/number/index.js'\n\nconst name = 'subtractScalar'\nconst dependencies = ['typed']\n\nexport const createSubtractScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Subtract two scalar values, `x - y`.\n   * This function is meant for internal use: it is used by the public function\n   * `subtract`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to be subtracted from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Difference of `x` and `y`\n   * @private\n   */\n  return typed(name, {\n\n    'number, number': subtractNumber,\n\n    'Complex, Complex': function (x, y) {\n      return x.sub(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.minus(y)\n    },\n\n    'bigint, bigint': function (x, y) {\n      return x - y\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.sub(y)\n    },\n\n    'Unit, Unit': typed.referToSelf(self => (x, y) => {\n      if (x.value === null || x.value === undefined) {\n        throw new Error('Parameter x contains a unit with undefined value')\n      }\n      if (y.value === null || y.value === undefined) {\n        throw new Error('Parameter y contains a unit with undefined value')\n      }\n      if (!x.equalBase(y)) throw new Error('Units do not match')\n\n      const res = x.clone()\n      res.value =\n        typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value)\n      res.fixPrefix = false\n      return res\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isBigNumber, isComplex, isFraction } from '../../utils/is.js'\nimport { cbrtNumber } from '../../plain/number/index.js'\n\nconst name = 'cbrt'\nconst dependencies = [\n  'config',\n  'typed',\n  'isNegative',\n  'unaryMinus',\n  'matrix',\n  'Complex',\n  'BigNumber',\n  'Fraction'\n]\n\nexport const createCbrt = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, isNegative, unaryMinus, matrix, Complex, BigNumber, Fraction }) => {\n  /**\n   * Calculate the cubic root of a value.\n   *\n   * To avoid confusion with the matrix cube root, this function does not\n   * apply to matrices. For a matrix, to take the cube root elementwise,\n   * see the examples.\n   *\n   * Syntax:\n   *\n   *    math.cbrt(x)\n   *    math.cbrt(x, allRoots)\n   *\n   * Examples:\n   *\n   *    math.cbrt(27)                  // returns 3\n   *    math.cube(3)                   // returns 27\n   *    math.cbrt(-64)                 // returns -4\n   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m\n   *    math.map([27, 64, 125], x => math.cbrt(x))       // returns [3, 4, 5]\n   *\n   *    const x = math.complex('8i')\n   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i\n   *    math.cbrt(x, true)             // returns Matrix [\n   *                                    //    1.7320508075689 + i\n   *                                    //   -1.7320508075689 + i\n   *                                    //   -2i\n   *                                    // ]\n   *\n   * See also:\n   *\n   *    square, sqrt, cube\n   *\n   * @param {number | BigNumber | Complex | Unit} x\n   *            Value for which to calculate the cubic root.\n   * @param {boolean} [allRoots]  Optional, false by default. Only applicable\n   *            when `x` is a number or complex number. If true, all complex\n   *            roots are returned, if false (default) the principal root is\n   *            returned.\n   * @return {number | BigNumber | Complex | Unit}\n   *            Returns the cubic root of `x`\n   */\n  return typed(name, {\n    number: cbrtNumber,\n    // note: signature 'number, boolean' is also supported,\n    //       created by typed as it knows how to convert number to Complex\n\n    Complex: _cbrtComplex,\n\n    'Complex, boolean': _cbrtComplex,\n\n    BigNumber: function (x) {\n      return x.cbrt()\n    },\n\n    Unit: _cbrtUnit\n  })\n\n  /**\n   * Calculate the cubic root for a complex number\n   * @param {Complex} x\n   * @param {boolean} [allRoots]   If true, the function will return an array\n   *                               with all three roots. If false or undefined,\n   *                               the principal root is returned.\n   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x\n   * @private\n   */\n  function _cbrtComplex (x, allRoots) {\n    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers\n\n    const arg3 = x.arg() / 3\n    const abs = x.abs()\n\n    // principal root:\n    const principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp())\n\n    if (allRoots) {\n      const all = [\n        principal,\n        new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()),\n        new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())\n      ]\n\n      return (config.matrix === 'Array') ? all : matrix(all)\n    } else {\n      return principal\n    }\n  }\n\n  /**\n   * Calculate the cubic root for a Unit\n   * @param {Unit} x\n   * @return {Unit} Returns the cubic root of x\n   * @private\n   */\n  function _cbrtUnit (x) {\n    if (x.value && isComplex(x.value)) {\n      let result = x.clone()\n      result.value = 1.0\n      result = result.pow(1.0 / 3) // Compute the units\n      result.value = _cbrtComplex(x.value) // Compute the value\n      return result\n    } else {\n      const negate = isNegative(x.value)\n      if (negate) {\n        x.value = unaryMinus(x.value)\n      }\n\n      // TODO: create a helper function for this\n      let third\n      if (isBigNumber(x.value)) {\n        third = new BigNumber(1).div(3)\n      } else if (isFraction(x.value)) {\n        third = new Fraction(1, 3)\n      } else {\n        third = 1 / 3\n      }\n\n      const result = x.pow(third)\n\n      if (negate) {\n        result.value = unaryMinus(result.value)\n      }\n\n      return result\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'matAlgo11xS0s'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo11xS0s = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo11xS0s (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // convert b to the same datatype\n      b = typed.convert(b, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = aindex[k]\n        // invoke callback\n        const v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b)\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i)\n          cvalues.push(v)\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'matAlgo12xSfs'\nconst dependencies = ['typed', 'DenseMatrix']\n\nexport const createMatAlgo12xSfs = /* #__PURE__ */ factory(name, dependencies, ({ typed, DenseMatrix }) => {\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked MxN times.\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(0, b)    ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo12xSfs (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt\n      // convert b to the same datatype\n      b = typed.convert(b, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cdata = []\n\n    // workspaces\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // columns mark\n      const mark = j + 1\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const r = aindex[k]\n        // update workspace\n        x[r] = avalues[k]\n        w[r] = mark\n      }\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = []\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b)\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b)\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { clone } from '../../../utils/object.js'\n\nconst name = 'matAlgo14xDs'\nconst dependencies = ['typed']\n\nexport const createMatAlgo14xDs = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, b)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij..z,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042\n   */\n  return function matAlgo14xDs (a, b, callback, inverse) {\n    // a arrays\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n\n    // datatype\n    let dt\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt\n      // convert b to the same datatype\n      b = typed.convert(b, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // populate cdata, iterate through dimensions\n    const cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : []\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: clone(asize),\n      datatype: dt\n    })\n  }\n\n  // recursive function\n  function _iterate (f, level, s, n, av, bv, inverse) {\n    // initialize array for this level\n    const cv = []\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (let i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv)\n      }\n    } else {\n      // iterate current level\n      for (let j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse)\n      }\n    }\n    return cv\n  }\n})\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { isInteger, nearlyEqual } from '../../utils/number.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\n\nconst name = 'ceil'\nconst dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix']\n\nconst bigTen = new Decimal(10)\n\nexport const createCeilNumber = /* #__PURE__ */ factory(\n  name, ['typed', 'config', 'round'], ({ typed, config, round }) => {\n    function _ceilNumber (x) {\n      // See ./floor.js _floorNumber for rationale here\n      const c = Math.ceil(x)\n      const r = round(x)\n      if (c === r) return c\n      if (\n        nearlyEqual(x, r, config.relTol, config.absTol) &&\n        !nearlyEqual(x, c, config.relTol, config.absTol)\n      ) {\n        return r\n      }\n      return c\n    }\n\n    return typed(name, {\n      number: _ceilNumber,\n      'number, number': function (x, n) {\n        if (!isInteger(n)) {\n          throw new RangeError(\n            'number of decimals in function ceil must be an integer')\n        }\n        if (n < 0 || n > 15) {\n          throw new RangeError(\n            'number of decimals in ceil number must be in range 0-15')\n        }\n        const shift = 10 ** n\n        return _ceilNumber(x * shift) / shift\n      }\n    })\n  }\n)\n\nexport const createCeil = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, round, matrix, equalScalar, zeros, DenseMatrix }) => {\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  const ceilNumber = createCeilNumber({ typed, config, round })\n  function _bigCeil (x) {\n    // see ./floor.js _floorNumber for rationale\n    const bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol)\n    const c = x.ceil()\n    const r = round(x)\n    if (c.eq(r)) return c\n    if (bne(x, r) && !bne(x, c)) return r\n    return c\n  }\n  /**\n   * Round a value towards plus infinity\n   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.ceil(x)\n   *    math.ceil(x, n)\n   *    math.ceil(unit, valuelessUnit)\n   *    math.ceil(unit, n, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.ceil(3.2)               // returns number 4\n   *    math.ceil(3.8)               // returns number 4\n   *    math.ceil(-4.2)              // returns number -4\n   *    math.ceil(-4.7)              // returns number -4\n   *\n   *    math.ceil(3.212, 2)          // returns number 3.22\n   *    math.ceil(3.288, 2)          // returns number 3.29\n   *    math.ceil(-4.212, 2)         // returns number -4.21\n   *    math.ceil(-4.782, 2)         // returns number -4.78\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.ceil(c)                 // returns Complex 4 - 2i\n   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i\n   *\n   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.ceil(unit, 1, cm)      // returns Unit 3.3 cm\n   *    math.ceil(unit, 1, mm)      // returns Unit 32.5 mm\n   *\n   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]\n   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]\n   *\n   * See also:\n   *\n   *    floor, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value\n   */\n  return typed('ceil', {\n    number: ceilNumber.signatures.number,\n    'number,number': ceilNumber.signatures['number,number'],\n\n    Complex: function (x) {\n      return x.ceil()\n    },\n\n    'Complex, number': function (x, n) {\n      return x.ceil(n)\n    },\n\n    'Complex, BigNumber': function (x, n) {\n      return x.ceil(n.toNumber())\n    },\n\n    BigNumber: _bigCeil,\n\n    'BigNumber, BigNumber': function (x, n) {\n      const shift = bigTen.pow(n)\n      return _bigCeil(x.mul(shift)).div(shift)\n    },\n\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n\n    Fraction: function (x) {\n      return x.ceil()\n    },\n\n    'Fraction, number': function (x, n) {\n      return x.ceil(n)\n    },\n\n    'Fraction, BigNumber': function (x, n) {\n      return x.ceil(n.toNumber())\n    },\n\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      const valueless = x.toNumeric(unit)\n      return unit.multiply(self(valueless, n))\n    }),\n\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, (value) => self(value, n, unit), true)\n    }),\n\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n\n    'Array | Matrix': typed.referToSelf(self => (x) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, self, true)\n    }),\n\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => self(i, n), true)\n    }),\n\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo11xS0s(x, y, self, false)\n    }),\n\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo14xDs(x, y, self, false)\n    }),\n\n    'number | Complex | Fraction | BigNumber, Array':\n      typed.referToSelf(self => (x, y) => {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf()\n      }),\n\n    'number | Complex | Fraction | BigNumber, Matrix':\n      typed.referToSelf(self => (x, y) => {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage())\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true)\n        }\n        return matAlgo12xSfs(y, x, self, true)\n      })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { cubeNumber } from '../../plain/number/index.js'\n\nconst name = 'cube'\nconst dependencies = ['typed']\n\nexport const createCube = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the cube of a value, `x * x * x`.\n   * To avoid confusion with `pow(M,3)`, this function does not apply to matrices.\n   * If you wish to cube every entry of a matrix, see the examples.\n   *\n   * Syntax:\n   *\n   *    math.cube(x)\n   *\n   * Examples:\n   *\n   *    math.cube(2)            // returns number 8\n   *    math.pow(2, 3)          // returns number 8\n   *    math.cube(4)            // returns number 64\n   *    4 * 4 * 4               // returns number 64\n   *\n   *    math.map([1, 2, 3, 4], math.cube) // returns Array [1, 8, 27, 64]\n   *\n   * See also:\n   *\n   *    multiply, square, pow, cbrt\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x  Number for which to calculate the cube\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit} Cube of x\n   */\n  return typed(name, {\n    number: cubeNumber,\n\n    Complex: function (x) {\n      return x.mul(x).mul(x) // Is faster than pow(x, 3)\n    },\n\n    BigNumber: function (x) {\n      return x.times(x).times(x)\n    },\n\n    bigint: function (x) {\n      return x * x * x\n    },\n\n    Fraction: function (x) {\n      return x.pow(3) // Is faster than mul()mul()mul()\n    },\n\n    Unit: function (x) {\n      return x.pow(3)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { expNumber } from '../../plain/number/index.js'\n\nconst name = 'exp'\nconst dependencies = ['typed']\n\nexport const createExp = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the exponential of a value.\n   * For matrices, if you want the matrix exponential of square matrix, use\n   * the `expm` function; if you want to take the exponential of each element,\n   * see the examples.\n   *\n   * Syntax:\n   *\n   *    math.exp(x)\n   *\n   * Examples:\n   *\n   *    math.exp(2)                  // returns number 7.3890560989306495\n   *    math.pow(math.e, 2)          // returns number 7.3890560989306495\n   *    math.log(math.exp(2))        // returns number 2\n   *\n   *    math.map([1, 2, 3], math.exp)\n   *    // returns Array [\n   *    //   2.718281828459045,\n   *    //   7.3890560989306495,\n   *    //   20.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    expm1, expm, log, pow\n   *\n   * @param {number | BigNumber | Complex} x  A number to exponentiate\n   * @return {number | BigNumber | Complex} Exponential of `x`\n   */\n  return typed(name, {\n    number: expNumber,\n\n    Complex: function (x) {\n      return x.exp()\n    },\n\n    BigNumber: function (x) {\n      return x.exp()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { expm1Number } from '../../plain/number/index.js'\n\nconst name = 'expm1'\nconst dependencies = ['typed', 'Complex']\n\nexport const createExpm1 = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex }) => {\n  /**\n   * Calculate the value of subtracting 1 from the exponential value.\n   * This function is more accurate than `math.exp(x)-1` when `x` is near 0\n   * To avoid ambiguity with the matrix exponential `expm`, this function\n   * does not operate on matrices; if you wish to apply it elementwise, see\n   * the examples.\n   *\n   * Syntax:\n   *\n   *    math.expm1(x)\n   *\n   * Examples:\n   *\n   *    math.expm1(2)                      // returns number 6.38905609893065\n   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495\n   *    math.expm1(1e-8)                   // returns number 1.0000000050000001e-8\n   *    math.exp(1e-8) - 1                 // returns number 9.9999999392253e-9\n   *    math.log(math.expm1(2) + 1)        // returns number 2\n   *\n   *    math.map([1, 2, 3], math.expm1)\n   *    // returns Array [\n   *    //   1.718281828459045,\n   *    //   6.3890560989306495,\n   *    //   19.085536923187668\n   *    // ]\n   *\n   * See also:\n   *\n   *    exp, expm, log, pow\n   *\n   * @param {number | BigNumber | Complex} x  The number to exponentiate\n   * @return {number | BigNumber | Complex} Exponential of `x`, minus one\n   */\n  return typed(name, {\n    number: expm1Number,\n\n    Complex: function (x) {\n      const r = Math.exp(x.re)\n      return new Complex(\n        r * Math.cos(x.im) - 1,\n        r * Math.sin(x.im)\n      )\n    },\n\n    BigNumber: function (x) {\n      return x.exp().minus(1)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\n\nconst name = 'fix'\nconst dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor', 'equalScalar', 'zeros', 'DenseMatrix']\n\nexport const createFixNumber = /* #__PURE__ */ factory(\n  name, ['typed', 'ceil', 'floor'], ({ typed, ceil, floor }) => {\n    return typed(name, {\n      number: function (x) {\n        return (x > 0) ? floor(x) : ceil(x)\n      },\n\n      'number, number': function (x, n) {\n        return (x > 0) ? floor(x, n) : ceil(x, n)\n      }\n    })\n  }\n)\n\nexport const createFix = /* #__PURE__ */ factory(name, dependencies, ({ typed, Complex, matrix, ceil, floor, equalScalar, zeros, DenseMatrix }) => {\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  const fixNumber = createFixNumber({ typed, ceil, floor })\n  /**\n   * Round a value towards zero.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.fix(x)\n   *    math.fix(x,n)\n   *    math.fix(unit, valuelessUnit)\n   *    math.fix(unit, n, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.fix(3.2)                // returns number 3\n   *    math.fix(3.8)                // returns number 3\n   *    math.fix(-4.2)               // returns number -4\n   *    math.fix(-4.7)               // returns number -4\n   *\n   *    math.fix(3.12, 1)                // returns number 3.1\n   *    math.fix(3.18, 1)                // returns number 3.1\n   *    math.fix(-4.12, 1)               // returns number -4.1\n   *    math.fix(-4.17, 1)               // returns number -4.1\n   *\n   *    const c = math.complex(3.22, -2.78)\n   *    math.fix(c)                  // returns Complex 3 - 2i\n   *    math.fix(c, 1)               // returns Complex 3.2 -2.7i\n   *\n   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.fix(unit, 1, cm)      // returns Unit 3.2 cm\n   *    math.fix(unit, 1, mm)      // returns Unit 32.4 mm\n   *\n   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]\n   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]\n   *\n   * See also:\n   *\n   *    ceil, floor, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value\n   */\n  return typed('fix', {\n    number: fixNumber.signatures.number,\n    'number, number | BigNumber': fixNumber.signatures['number,number'],\n\n    Complex: function (x) {\n      return new Complex(\n        (x.re > 0) ? Math.floor(x.re) : Math.ceil(x.re),\n        (x.im > 0) ? Math.floor(x.im) : Math.ceil(x.im)\n      )\n    },\n\n    'Complex, number': function (x, n) {\n      return new Complex(\n        (x.re > 0) ? floor(x.re, n) : ceil(x.re, n),\n        (x.im > 0) ? floor(x.im, n) : ceil(x.im, n)\n      )\n    },\n\n    'Complex, BigNumber': function (x, bn) {\n      const n = bn.toNumber()\n      return new Complex(\n        (x.re > 0) ? floor(x.re, n) : ceil(x.re, n),\n        (x.im > 0) ? floor(x.im, n) : ceil(x.im, n)\n      )\n    },\n\n    BigNumber: function (x) {\n      return x.isNegative() ? ceil(x) : floor(x)\n    },\n\n    'BigNumber, number | BigNumber': function (x, n) {\n      return x.isNegative() ? ceil(x, n) : floor(x, n)\n    },\n\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n\n    Fraction: function (x) {\n      return x.s < 0n ? x.ceil() : x.floor()\n    },\n\n    'Fraction, number | BigNumber': function (x, n) {\n      return x.s < 0n ? ceil(x, n) : floor(x, n)\n    },\n\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      const valueless = x.toNumeric(unit)\n      return unit.multiply(self(valueless, n))\n    }),\n\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, (value) => self(value, n, unit), true)\n    }),\n\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n\n    'Array | Matrix': typed.referToSelf(self => (x) => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, self, true)\n    }),\n\n    'Array | Matrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since fix(0) = 0\n      return deepMap(x, i => self(i, n), true)\n    }),\n\n    'number | Complex | Fraction | BigNumber, Array':\n      typed.referToSelf(self => (x, y) => {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf()\n      }),\n\n    'number | Complex | Fraction | BigNumber, Matrix':\n      typed.referToSelf(self => (x, y) => {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage())\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true)\n        }\n        return matAlgo12xSfs(y, x, self, true)\n      })\n  })\n})\n","import Decimal from 'decimal.js'\nimport { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { isInteger, nearlyEqual } from '../../utils/number.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\n\nconst name = 'floor'\nconst dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix']\n\nconst bigTen = new Decimal(10)\n\nexport const createFloorNumber = /* #__PURE__ */ factory(\n  name, ['typed', 'config', 'round'], ({ typed, config, round }) => {\n    function _floorNumber (x) {\n      // First, if the floor and the round are identical we can be\n      // quite comfortable that is the best answer:\n      const f = Math.floor(x)\n      const r = round(x)\n      if (f === r) return f\n      // OK, they are different. If x is truly distinct from f but\n      // appears indistinguishable from r, presume it really is just\n      // the integer r with rounding/computation error, and return that\n      if (\n        nearlyEqual(x, r, config.relTol, config.absTol) &&\n        !nearlyEqual(x, f, config.relTol, config.absTol)\n      ) {\n        return r\n      }\n      // Otherwise (x distinct from both r and f, or indistinguishable from\n      // both r and f) may as well just return f, as that's the best\n      // candidate we can discern:\n      return f\n    }\n\n    return typed(name, {\n      number: _floorNumber,\n      'number, number': function (x, n) {\n        if (!isInteger(n)) {\n          throw new RangeError(\n            'number of decimals in function floor must be an integer')\n        }\n        if (n < 0 || n > 15) {\n          throw new RangeError(\n            'number of decimals in floor number must be in range 0 - 15')\n        }\n        const shift = 10 ** n\n        return _floorNumber(x * shift) / shift\n      }\n    })\n  }\n)\n\nexport const createFloor = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, round, matrix, equalScalar, zeros, DenseMatrix }) => {\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  const floorNumber = createFloorNumber({ typed, config, round })\n  function _bigFloor (x) {\n    // see _floorNumber above for rationale\n    const bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol)\n    const f = x.floor()\n    const r = round(x)\n    if (f.eq(r)) return f\n    if (bne(x, r) && !bne(x, f)) return r\n    return f\n  }\n  /**\n   * Round a value towards minus infinity.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.floor(x)\n   *    math.floor(x, n)\n   *    math.floor(unit, valuelessUnit)\n   *    math.floor(unit, n, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.floor(3.2)              // returns number 3\n   *    math.floor(3.8)              // returns number 3\n   *    math.floor(-4.2)             // returns number -5\n   *    math.floor(-4.7)             // returns number -5\n   *\n   *    math.floor(3.212, 2)          // returns number 3.21\n   *    math.floor(3.288, 2)          // returns number 3.28\n   *    math.floor(-4.212, 2)         // returns number -4.22\n   *    math.floor(-4.782, 2)         // returns number -4.79\n   *\n   *    const c = math.complex(3.24, -2.71)\n   *    math.floor(c)                 // returns Complex 3 - 3i\n   *    math.floor(c, 1)              // returns Complex 3.2 -2.8i\n   *\n   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.floor(unit, 1, cm)      // returns Unit 3.2 cm\n   *    math.floor(unit, 1, mm)      // returns Unit 32.4 mm\n   *\n   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]\n   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]\n   *\n   *    math.floor(math.tau, [2, 3])  // returns Array [6.28, 6.283]\n   *\n   *    // Note that floor(array, array) currently not implemented.\n   *\n   * See also:\n   *\n   *    ceil, fix, round\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value\n   */\n  return typed('floor', {\n    number: floorNumber.signatures.number,\n    'number,number': floorNumber.signatures['number,number'],\n\n    Complex: function (x) {\n      return x.floor()\n    },\n\n    'Complex, number': function (x, n) {\n      return x.floor(n)\n    },\n\n    'Complex, BigNumber': function (x, n) {\n      return x.floor(n.toNumber())\n    },\n\n    BigNumber: _bigFloor,\n\n    'BigNumber, BigNumber': function (x, n) {\n      const shift = bigTen.pow(n)\n      return _bigFloor(x.mul(shift)).div(shift)\n    },\n\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n\n    Fraction: function (x) {\n      return x.floor()\n    },\n\n    'Fraction, number': function (x, n) {\n      return x.floor(n)\n    },\n\n    'Fraction, BigNumber': function (x, n) {\n      return x.floor(n.toNumber())\n    },\n\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      const valueless = x.toNumeric(unit)\n      return unit.multiply(self(valueless, n))\n    }),\n\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, (value) => self(value, n, unit), true)\n    }),\n\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n\n    'Array | Matrix': typed.referToSelf(self => (x) => {\n      // deep map collection, skip zeros since floor(0) = 0\n      return deepMap(x, self, true)\n    }),\n\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // deep map collection, skip zeros since ceil(0) = 0\n      return deepMap(x, i => self(i, n), true)\n    }),\n\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo11xS0s(x, y, self, false)\n    }),\n\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n      return matAlgo14xDs(x, y, self, false)\n    }),\n\n    'number | Complex | Fraction | BigNumber, Array':\n      typed.referToSelf(self => (x, y) => {\n        // use matrix implementation\n        return matAlgo14xDs(matrix(y), x, self, true).valueOf()\n      }),\n\n    'number | Complex | Fraction | BigNumber, Matrix':\n      typed.referToSelf(self => (x, y) => {\n        if (equalScalar(x, 0)) return zeros(y.size(), y.storage())\n        if (y.storage() === 'dense') {\n          return matAlgo14xDs(y, x, self, true)\n        }\n        return matAlgo12xSfs(y, x, self, true)\n      })\n  })\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo02xDS0'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo02xDS0 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function matAlgo02xDS0 (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype || denseMatrix.getDataType()\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result (SparseMatrix)\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // loop columns in b\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = bindex[k]\n        // update C(i,j)\n        const cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        // check for nonzero\n        if (!eq(cij, zero)) {\n          // push i & v\n          cindex.push(i)\n          cvalues.push(cij)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return sparseMatrix.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo03xDSf'\nconst dependencies = ['typed']\n\nexport const createMatAlgo03xDSf = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked M*N times.\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  f(Dij, 0)    ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function matAlgo03xDSf (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype || denseMatrix.getDataType()\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result (DenseMatrix)\n    const cdata = []\n\n    // initialize dense matrix\n    for (let z = 0; z < rows; z++) {\n      // initialize row\n      cdata[z] = []\n    }\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns in b\n    for (let j = 0; j < columns; j++) {\n      // column mark\n      const mark = j + 1\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const i = bindex[k]\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        w[i] = mark\n      }\n      // process workspace\n      for (let y = 0; y < rows; y++) {\n        // check we have a calculated value for current row\n        if (w[y] === mark) {\n          // use calculated value\n          cdata[y][j] = x[y]\n        } else {\n          // calculate value\n          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero)\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo05xSfSf'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo05xSfSf = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo05xSfSf (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const xa = cvalues ? [] : undefined\n    const xb = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const wa = []\n    const wb = []\n\n    // vars\n    let i, j, k, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop values A(:,j)\n      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // push index\n        cindex.push(i)\n        // update workspace\n        wa[i] = mark\n        // check we need to process values\n        if (xa) { xa[i] = avalues[k] }\n      }\n      // loop values B(:,j)\n      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check row existed in A\n        if (wa[i] !== mark) {\n          // push index\n          cindex.push(i)\n        }\n        // update workspace\n        wb[i] = mark\n        // check we need to process values\n        if (xb) { xb[i] = bvalues[k] }\n      }\n      // check we need to process values (non pattern matrix)\n      if (cvalues) {\n        // initialize first index in j\n        k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]\n          // marks\n          const wai = wa[i]\n          const wbi = wb[i]\n          // check Aij or Bij are nonzero\n          if (wai === mark || wbi === mark) {\n            // matrix values @ i,j\n            const va = wai === mark ? xa[i] : zero\n            const vb = wbi === mark ? xb[i] : zero\n            // Cij\n            const vc = cf(va, vb)\n            // check for zero\n            if (!eq(vc, zero)) {\n              // push value\n              cvalues.push(vc)\n              // increment pointer\n              k++\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1)\n            }\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo13xDD'\nconst dependencies = ['typed']\n\nexport const createMatAlgo13xDD = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).\n   * Callback function invoked MxN times.\n   *\n   * C(i,j,...z) = f(Aij..z, Bij..z)\n   *\n   * @param {Matrix}   a                 The DenseMatrix instance (A)\n   * @param {Matrix}   b                 The DenseMatrix instance (B)\n   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658\n   */\n  return function matAlgo13xDD (a, b, callback) {\n    // a arrays\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype\n    // b arrays\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype\n    // c arrays\n    const csize = []\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // validate each one of the dimension sizes\n    for (let s = 0; s < asize.length; s++) {\n      // must match\n      if (asize[s] !== bsize[s]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n      // update dimension in c\n      csize[s] = asize[s]\n    }\n\n    // datatype\n    let dt\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt) {\n      // datatype\n      dt = adt\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // populate cdata, iterate through dimensions\n    const cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : []\n\n    // c matrix\n    return a.createDenseMatrix({\n      data: cdata,\n      size: csize,\n      datatype: dt\n    })\n  }\n\n  // recursive function\n  function _iterate (f, level, s, n, av, bv) {\n    // initialize array for this level\n    const cv = []\n    // check we reach the last level\n    if (level === s.length - 1) {\n      // loop arrays in last level\n      for (let i = 0; i < n; i++) {\n        // invoke callback and store value\n        cv[i] = f(av[i], bv[i])\n      }\n    } else {\n      // iterate current level\n      for (let j = 0; j < n; j++) {\n        // iterate next level\n        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j])\n      }\n    }\n    return cv\n  }\n})\n","import { broadcastSizes, broadcastTo } from '../../../utils/array.js'\nimport { deepStrictEqual } from '../../../utils/object.js'\n\n/**\n* Broadcasts two matrices, and return both in an array\n* It checks if it's possible with broadcasting rules\n*\n* @param {Matrix}   A      First Matrix\n* @param {Matrix}   B      Second Matrix\n*\n* @return {Matrix[]}      [ broadcastedA, broadcastedB ]\n*/\n\nexport function broadcast (A, B) {\n  if (deepStrictEqual(A.size(), B.size())) {\n    // If matrices have the same size return them\n    return [A, B]\n  }\n\n  // calculate the broadcasted sizes\n  const newSize = broadcastSizes(A.size(), B.size())\n\n  // return the array with the two broadcasted matrices\n  return [A, B].map(M => _broadcastTo(M, newSize))\n}\n\n/**\n * Broadcasts a matrix to the given size.\n *\n * @param {Matrix} M - The matrix to be broadcasted.\n * @param {number[]} size - The desired size of the broadcasted matrix.\n * @returns {Matrix} The broadcasted matrix.\n * @throws {Error} If the size parameter is not an array of numbers.\n */\nfunction _broadcastTo (M, size) {\n  if (deepStrictEqual(M.size(), size)) {\n    return M\n  }\n  return M.create(broadcastTo(M.valueOf(), size), M.datatype())\n}\n","import { factory } from '../../../utils/factory.js'\nimport { extend } from '../../../utils/object.js'\nimport { createMatAlgo13xDD } from './matAlgo13xDD.js'\nimport { createMatAlgo14xDs } from './matAlgo14xDs.js'\nimport { broadcast } from './broadcast.js'\n\nconst name = 'matrixAlgorithmSuite'\nconst dependencies = ['typed', 'matrix']\n\nexport const createMatrixAlgorithmSuite = /* #__PURE__ */ factory(\n  name, dependencies, ({ typed, matrix }) => {\n    const matAlgo13xDD = createMatAlgo13xDD({ typed })\n    const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n    /**\n     * Return a signatures object with the usual boilerplate of\n     * matrix algorithms, based on a plain options object with the\n     * following properties:\n     *   elop: function -- the elementwise operation to use, defaults to self\n     *   SS: function -- the algorithm to apply for two sparse matrices\n     *   DS: function -- the algorithm to apply for a dense and a sparse matrix\n     *   SD: function -- algo for a sparse and a dense; defaults to SD flipped\n     *   Ss: function -- the algorithm to apply for a sparse matrix and scalar\n     *   sS: function -- algo for scalar and sparse; defaults to Ss flipped\n     *   scalar: string -- typed-function type for scalars, defaults to 'any'\n     *\n     * If Ss is not specified, no matrix-scalar signatures are generated.\n     *\n     * @param {object} options\n     * @return {Object<string, function>} signatures\n     */\n    return function matrixAlgorithmSuite (options) {\n      const elop = options.elop\n      const SD = options.SD || options.DS\n      let matrixSignatures\n      if (elop) {\n        // First the dense ones\n        matrixSignatures = {\n          'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),\n          'Array, Array': (x, y) =>\n            matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),\n          'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),\n          'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)\n        }\n        // Now incorporate sparse matrices\n        if (options.SS) {\n          matrixSignatures['SparseMatrix, SparseMatrix'] =\n            (x, y) => options.SS(...broadcast(x, y), elop, false)\n        }\n        if (options.DS) {\n          matrixSignatures['DenseMatrix, SparseMatrix'] =\n            (x, y) => options.DS(...broadcast(x, y), elop, false)\n          matrixSignatures['Array, SparseMatrix'] =\n            (x, y) => options.DS(...broadcast(matrix(x), y), elop, false)\n        }\n        if (SD) {\n          matrixSignatures['SparseMatrix, DenseMatrix'] =\n            (x, y) => SD(...broadcast(y, x), elop, true)\n          matrixSignatures['SparseMatrix, Array'] =\n            (x, y) => SD(...broadcast(matrix(y), x), elop, true)\n        }\n      } else {\n        // No elop, use this\n        // First the dense ones\n        matrixSignatures = {\n          'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {\n            return matAlgo13xDD(...broadcast(x, y), self)\n          }),\n          'Array, Array': typed.referToSelf(self => (x, y) => {\n            return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf()\n          }),\n          'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {\n            return matAlgo13xDD(...broadcast(matrix(x), y), self)\n          }),\n          'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {\n            return matAlgo13xDD(...broadcast(x, matrix(y)), self)\n          })\n        }\n        // Now incorporate sparse matrices\n        if (options.SS) {\n          matrixSignatures['SparseMatrix, SparseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return options.SS(...broadcast(x, y), self, false)\n            })\n        }\n        if (options.DS) {\n          matrixSignatures['DenseMatrix, SparseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return options.DS(...broadcast(x, y), self, false)\n            })\n          matrixSignatures['Array, SparseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return options.DS(...broadcast(matrix(x), y), self, false)\n            })\n        }\n        if (SD) {\n          matrixSignatures['SparseMatrix, DenseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return SD(...broadcast(y, x), self, true)\n            })\n          matrixSignatures['SparseMatrix, Array'] =\n            typed.referToSelf(self => (x, y) => {\n              return SD(...broadcast(matrix(y), x), self, true)\n            })\n        }\n      }\n\n      // Now add the scalars\n      const scalar = options.scalar || 'any'\n      const Ds = options.Ds || options.Ss\n      if (Ds) {\n        if (elop) {\n          matrixSignatures['DenseMatrix,' + scalar] =\n            (x, y) => matAlgo14xDs(x, y, elop, false)\n          matrixSignatures[scalar + ', DenseMatrix'] =\n            (x, y) => matAlgo14xDs(y, x, elop, true)\n          matrixSignatures['Array,' + scalar] =\n            (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf()\n          matrixSignatures[scalar + ', Array'] =\n            (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf()\n        } else {\n          matrixSignatures['DenseMatrix,' + scalar] =\n            typed.referToSelf(self => (x, y) => {\n              return matAlgo14xDs(x, y, self, false)\n            })\n          matrixSignatures[scalar + ', DenseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return matAlgo14xDs(y, x, self, true)\n            })\n          matrixSignatures['Array,' + scalar] =\n            typed.referToSelf(self => (x, y) => {\n              return matAlgo14xDs(matrix(x), y, self, false).valueOf()\n            })\n          matrixSignatures[scalar + ', Array'] =\n            typed.referToSelf(self => (x, y) => {\n              return matAlgo14xDs(matrix(y), x, self, true).valueOf()\n            })\n        }\n      }\n      const sS = (options.sS !== undefined) ? options.sS : options.Ss\n      if (elop) {\n        if (options.Ss) {\n          matrixSignatures['SparseMatrix,' + scalar] =\n            (x, y) => options.Ss(x, y, elop, false)\n        }\n        if (sS) {\n          matrixSignatures[scalar + ', SparseMatrix'] =\n            (x, y) => sS(y, x, elop, true)\n        }\n      } else {\n        if (options.Ss) {\n          matrixSignatures['SparseMatrix,' + scalar] =\n            typed.referToSelf(self => (x, y) => {\n              return options.Ss(x, y, self, false)\n            })\n        }\n        if (sS) {\n          matrixSignatures[scalar + ', SparseMatrix'] =\n            typed.referToSelf(self => (x, y) => {\n              return sS(y, x, self, true)\n            })\n        }\n      }\n      // Also pull in the scalar signatures if the operator is a typed function\n      if (elop && elop.signatures) {\n        extend(matrixSignatures, elop.signatures)\n      }\n      return matrixSignatures\n    }\n  })\n","import { factory } from '../../utils/factory.js'\nimport { createFloor } from './floor.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'mod'\nconst dependencies = [\n  'typed',\n  'config',\n  'round',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createMod = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, round, matrix, equalScalar, zeros, DenseMatrix, concat }) => {\n  const floor = createFloor({ typed, config, round, matrix, equalScalar, zeros, DenseMatrix })\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo05xSfSf = createMatAlgo05xSfSf({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Calculates the modulus, the remainder of an integer division.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * The modulus is defined as:\n   *\n   *     x - y * floor(x / y)\n   *\n   * See https://en.wikipedia.org/wiki/Modulo_operation.\n   *\n   * Syntax:\n   *\n   *    math.mod(x, y)\n   *\n   * Examples:\n   *\n   *    math.mod(8, 3)                // returns 2\n   *    math.mod(11, 2)               // returns 1\n   *\n   *    function isOdd(x) {\n   *      return math.mod(x, 2) != 0\n   *    }\n   *\n   *    isOdd(2)                      // returns false\n   *    isOdd(3)                      // returns true\n   *\n   * See also:\n   *\n   *    divide\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} x Dividend\n   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} y Divisor\n   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.\n   */\n  return typed(\n    name,\n    {\n      'number, number': _modNumber,\n\n      'BigNumber, BigNumber': function (x, y) {\n        return y.isZero() ? x : x.sub(y.mul(floor(x.div(y))))\n      },\n\n      'bigint, bigint': function (x, y) {\n        if (y === 0n) {\n          return x\n        }\n\n        if (x < 0) {\n          const m = x % y\n          return m === 0n ? m : m + y\n        }\n\n        return x % y\n      },\n\n      'Fraction, Fraction': function (x, y) {\n        return y.equals(0) ? x : x.sub(y.mul(floor(x.div(y))))\n      }\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo05xSfSf,\n      DS: matAlgo03xDSf,\n      SD: matAlgo02xDS0,\n      Ss: matAlgo11xS0s,\n      sS: matAlgo12xSfs\n    })\n  )\n\n  /**\n * Calculate the modulus of two numbers\n * @param {number} x\n * @param {number} y\n * @returns {number} res\n * @private\n */\n  function _modNumber (x, y) {\n    // We don't use JavaScript's % operator here as this doesn't work\n    // correctly for x < 0 and x === 0\n    // see https://en.wikipedia.org/wiki/Modulo_operation\n\n    // We use mathjs floor to handle errors associated with\n    // precision float approximation\n    return (y === 0) ? x : x - y * floor(x / y)\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo01xDSid'\nconst dependencies = ['typed']\n\nexport const createMatAlgo01xDSid = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).\n   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).\n   *\n   *\n   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  Dij          ; otherwise\n   *\n   *\n   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)\n   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)\n   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571\n   */\n  return function algorithm1 (denseMatrix, sparseMatrix, callback, inverse) {\n    // dense matrix arrays\n    const adata = denseMatrix._data\n    const asize = denseMatrix._size\n    const adt = denseMatrix._datatype || denseMatrix.getDataType()\n    // sparse matrix arrays\n    const bvalues = sparseMatrix._values\n    const bindex = sparseMatrix._index\n    const bptr = sparseMatrix._ptr\n    const bsize = sparseMatrix._size\n    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!bvalues) { throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // process data types\n    const dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined\n    // callback function\n    const cf = dt ? typed.find(callback, [dt, dt]) : callback\n\n    // vars\n    let i, j\n\n    // result (DenseMatrix)\n    const cdata = []\n    // initialize c\n    for (i = 0; i < rows; i++) { cdata[i] = [] }\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns in b\n    for (j = 0; j < columns; j++) {\n      // column mark\n      const mark = j + 1\n      // values in column j\n      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // update workspace\n        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k])\n        // mark i as updated\n        w[i] = mark\n      }\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // check row is in workspace\n        if (w[i] === mark) {\n          // c[i][j] was already calculated\n          cdata[i][j] = x[i]\n        } else {\n          // item does not exist in S\n          cdata[i][j] = adata[i][j]\n        }\n      }\n    }\n\n    // return dense matrix\n    return denseMatrix.createDenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo04xSidSid'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo04xSidSid = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          └  B(i,j)       ; A(i,j) === 0\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo04xSidSid (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspace\n    const xa = avalues && bvalues ? [] : undefined\n    const xb = avalues && bvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const wa = []\n    const wb = []\n\n    // vars\n    let i, j, k, k0, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // update c\n        cindex.push(i)\n        // update workspace\n        wa[i] = mark\n        // check we need to process values\n        if (xa) { xa[i] = avalues[k] }\n      }\n      // loop B(:,j)\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check row exists in A\n        if (wa[i] === mark) {\n          // update record in xa @ i\n          if (xa) {\n            // invoke callback\n            const v = cf(xa[i], bvalues[k])\n            // check for zero\n            if (!eq(v, zero)) {\n              // update workspace\n              xa[i] = v\n            } else {\n              // remove mark (index will be removed later)\n              wa[i] = null\n            }\n          }\n        } else {\n          // update c\n          cindex.push(i)\n          // update workspace\n          wb[i] = mark\n          // check we need to process values\n          if (xb) { xb[i] = bvalues[k] }\n        }\n      }\n      // check we need to process values (non pattern matrix)\n      if (xa && xb) {\n        // initialize first index in j\n        k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          i = cindex[k]\n          // check workspace has value @ i\n          if (wa[i] === mark) {\n            // push value (Aij != 0 || (Aij != 0 && Bij != 0))\n            cvalues[k] = xa[i]\n            // increment pointer\n            k++\n          } else if (wb[i] === mark) {\n            // push value (bij != 0)\n            cvalues[k] = xb[i]\n            // increment pointer\n            k++\n          } else {\n            // remove index @ k\n            cindex.splice(k, 1)\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'matAlgo10xSids'\nconst dependencies = ['typed', 'DenseMatrix']\n\nexport const createMatAlgo10xSids = /* #__PURE__ */ factory(name, dependencies, ({ typed, DenseMatrix }) => {\n  /**\n   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).\n   * Callback function invoked NZ times (number of nonzero items in S).\n   *\n   *\n   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  b          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    DenseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo10xSids (s, b, callback, inverse) {\n    // sparse matrix arrays\n    const avalues = s._values\n    const aindex = s._index\n    const aptr = s._ptr\n    const asize = s._size\n    const adt = s._datatype\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt\n      // convert b to the same datatype\n      b = typed.convert(b, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cdata = []\n\n    // workspaces\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // columns mark\n      const mark = j + 1\n      // values in j\n      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        const r = aindex[k]\n        // update workspace\n        x[r] = avalues[k]\n        w[r] = mark\n      }\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // initialize C on first column\n        if (j === 0) {\n          // create row array\n          cdata[i] = []\n        }\n        // check sparse matrix has a value @ i,j\n        if (w[i] === mark) {\n          // invoke callback, update C\n          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b)\n        } else {\n          // dense matrix value @ i, j\n          cdata[i][j] = b\n        }\n      }\n    }\n\n    // return dense matrix\n    return new DenseMatrix({\n      data: cdata,\n      size: [rows, columns],\n      datatype: dt\n    })\n  }\n})\n","/**\n * Create a syntax error with the message:\n *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'\n * @param {string} fn     Function name\n * @param {number} count  Actual argument count\n * @param {number} min    Minimum required argument count\n * @param {number} [max]  Maximum required argument count\n * @extends Error\n */\nexport function ArgumentsError (fn, count, min, max) {\n  if (!(this instanceof ArgumentsError)) {\n    throw new SyntaxError('Constructor must be called with the new operator')\n  }\n\n  this.fn = fn\n  this.count = count\n  this.min = min\n  this.max = max\n\n  this.message = 'Wrong number of arguments in function ' + fn +\n      ' (' + count + ' provided, ' +\n      min + ((max !== undefined && max !== null) ? ('-' + max) : '') + ' expected)'\n\n  this.stack = (new Error()).stack\n}\n\nArgumentsError.prototype = new Error()\nArgumentsError.prototype.constructor = Error\nArgumentsError.prototype.name = 'ArgumentsError'\nArgumentsError.prototype.isArgumentsError = true\n","import { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMod } from './mod.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { ArgumentsError } from '../../error/ArgumentsError.js'\n\nconst name = 'gcd'\nconst dependencies = [\n  'typed',\n  'config',\n  'round',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'BigNumber',\n  'DenseMatrix',\n  'concat'\n]\n\nconst gcdTypes = 'number | BigNumber | Fraction | Matrix | Array'\nconst gcdManyTypesSignature = `${gcdTypes}, ${gcdTypes}, ...${gcdTypes}`\n\nfunction is1d (array) {\n  return !array.some(element => Array.isArray(element))\n}\n\nexport const createGcd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, config, round, equalScalar, zeros, BigNumber, DenseMatrix, concat }) => {\n  const mod = createMod({ typed, config, round, matrix, equalScalar, zeros, DenseMatrix, concat })\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo04xSidSid = createMatAlgo04xSidSid({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Calculate the greatest common divisor for two or more values or arrays.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.gcd(a, b)\n   *    math.gcd(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.gcd(8, 12)              // returns 4\n   *    math.gcd(-4, 6)              // returns 2\n   *    math.gcd(25, 15, -10)        // returns 5\n   *\n   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]\n   *\n   * See also:\n   *\n   *    lcm, xgcd\n   *\n   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor\n   */\n  return typed(\n    name,\n    {\n      'number, number': _gcdNumber,\n      'BigNumber, BigNumber': _gcdBigNumber,\n      'Fraction, Fraction': (x, y) => x.gcd(y)\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo04xSidSid,\n      DS: matAlgo01xDSid,\n      Ss: matAlgo10xSids\n    }),\n    {\n      [gcdManyTypesSignature]: typed.referToSelf(self => (a, b, args) => {\n        let res = self(a, b)\n        for (let i = 0; i < args.length; i++) {\n          res = self(res, args[i])\n        }\n        return res\n      }),\n      Array: typed.referToSelf(self => (array) => {\n        if (array.length === 1 && Array.isArray(array[0]) && is1d(array[0])) {\n          return self(...array[0])\n        }\n        if (is1d(array)) {\n          return self(...array)\n        }\n        throw new ArgumentsError('gcd() supports only 1d matrices!')\n      }),\n      Matrix: typed.referToSelf(self => (matrix) => {\n        return self(matrix.toArray())\n      })\n    }\n  )\n\n  /**\n * Calculate gcd for numbers\n * @param {number} a\n * @param {number} b\n * @returns {number} Returns the greatest common denominator of a and b\n * @private\n */\n  function _gcdNumber (a, b) {\n    if (!isInteger(a) || !isInteger(b)) {\n      throw new Error('Parameters in function gcd must be integer numbers')\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    let r\n    while (b !== 0) {\n      r = mod(a, b)\n      a = b\n      b = r\n    }\n    return (a < 0) ? -a : a\n  }\n\n  /**\n   * Calculate gcd for BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns greatest common denominator of a and b\n   * @private\n   */\n  function _gcdBigNumber (a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function gcd must be integer numbers')\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    const zero = new BigNumber(0)\n    while (!b.isZero()) {\n      const r = mod(a, b)\n      a = b\n      b = r\n    }\n    return a.lt(zero) ? a.neg() : a\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\nimport { scatter } from '../../../utils/collection.js'\n\nconst name = 'matAlgo06xS0S0'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo06xS0S0 = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo06xS0S0 (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const x = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const w = []\n    // marks indicating value in a given row has been updated\n    const u = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // scatter the values of A(:,j) into workspace\n      scatter(a, j, w, x, u, mark, cindex, cf)\n      // scatter the values of B(:,j) into workspace\n      scatter(b, j, w, x, u, mark, cindex, cf)\n      // check we need to process values (non pattern matrix)\n      if (x) {\n        // initialize first index in j\n        let k = cptr[j]\n        // loop index in j\n        while (k < cindex.length) {\n          // row\n          const i = cindex[k]\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\n          if (u[i] === mark) {\n            // value @ i\n            const v = x[i]\n            // check for zero value\n            if (!eq(v, zero)) {\n              // push value\n              cvalues.push(v)\n              // increment pointer\n              k++\n            } else {\n              // remove value @ i, do not increment pointer\n              cindex.splice(k, 1)\n            }\n          } else {\n            // remove value @ i, do not increment pointer\n            cindex.splice(k, 1)\n          }\n        }\n      } else {\n        // initialize first index in j\n        let p = cptr[j]\n        // loop index in j\n        while (p < cindex.length) {\n          // row\n          const r = cindex[p]\n          // check function was invoked on current row (Aij !=0 && Bij != 0)\n          if (u[r] !== mark) {\n            // remove value @ i, do not increment pointer\n            cindex.splice(p, 1)\n          } else {\n            // increment pointer\n            p++\n          }\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { lcmNumber } from '../../plain/number/index.js'\n\nconst name = 'lcm'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'concat'\n]\n\nexport const createLcm = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, concat }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo06xS0S0 = createMatAlgo06xS0S0({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  const lcmTypes = 'number | BigNumber | Fraction | Matrix | Array'\n  const lcmManySignature = {}\n  lcmManySignature[`${lcmTypes}, ${lcmTypes}, ...${lcmTypes}`] =\n    typed.referToSelf(self => (a, b, args) => {\n      let res = self(a, b)\n      for (let i = 0; i < args.length; i++) {\n        res = self(res, args[i])\n      }\n      return res\n    })\n\n  /**\n   * Calculate the least common multiple for two or more values or arrays.\n   *\n   * lcm is defined as:\n   *\n   *     lcm(a, b) = abs(a * b) / gcd(a, b)\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.lcm(a, b)\n   *    math.lcm(a, b, c, ...)\n   *\n   * Examples:\n   *\n   *    math.lcm(4, 6)               // returns 12\n   *    math.lcm(6, 21)              // returns 42\n   *    math.lcm(6, 21, 5)           // returns 210\n   *\n   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers\n   * @return {number | BigNumber | Array | Matrix}                           The least common multiple\n   */\n  return typed(\n    name, {\n      'number, number': lcmNumber,\n      'BigNumber, BigNumber': _lcmBigNumber,\n      'Fraction, Fraction': (x, y) => x.lcm(y)\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo06xS0S0,\n      DS: matAlgo02xDS0,\n      Ss: matAlgo11xS0s\n    }),\n    lcmManySignature\n  )\n\n  /**\n   * Calculate lcm for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @returns {BigNumber} Returns the least common multiple of a and b\n   * @private\n   */\n  function _lcmBigNumber (a, b) {\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function lcm must be integer numbers')\n    }\n\n    if (a.isZero()) {\n      return a\n    }\n    if (b.isZero()) {\n      return b\n    }\n\n    // https://en.wikipedia.org/wiki/Euclidean_algorithm\n    // evaluate lcm here inline to reduce overhead\n    const prod = a.times(b)\n    while (!b.isZero()) {\n      const t = b\n      b = a.mod(t)\n      a = t\n    }\n    return prod.div(a).abs()\n  }\n})\n","/**\n * Build a bigint logarithm function from a number logarithm,\n * still returning a number. The idea is that 15 hexadecimal digits\n * (60 bits) saturates the mantissa of the log, and each additional hex\n * digit effectively just adds the log of 16 to the resulting value. So\n * convert the most significant 15 hex digits to a number and take its\n * log, and then add the log of 16 for each additional hex digit that\n * was in the bigint.\n * For negative numbers (complex logarithms), following the bignum\n * implementation, it just downgrades to number and uses the complex result.\n * @param {number} log16  the log of 16\n * @param {(number) -> number} numberLog  the logarithm function for numbers\n * @param {ConfigurationObject} config  the mathjs configuration\n * @param {(number) -> Complex} cplx  the associated Complex log\n * @returns {(bigint) -> number}   the corresponding logarithm for bigints\n */\nexport function promoteLogarithm (log16, numberLog, config, cplx) {\n  return function (b) {\n    if (b > 0 || config.predictable) {\n      if (b <= 0) return NaN\n      const s = b.toString(16)\n      const s15 = s.substring(0, 15)\n      return log16 * (s.length - s15.length) + numberLog(Number('0x' + s15))\n    }\n    return cplx(b.toNumber())\n  }\n}\n","import { log10Number } from '../../plain/number/index.js'\nimport { promoteLogarithm } from '../../utils/bigint.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'log10'\nconst dependencies = ['typed', 'config', 'Complex']\nconst log16 = log10Number(16)\n\nexport const createLog10 = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log10(x)\n   *\n   * Examples:\n   *\n   *    math.log10(0.00001)            // returns -5\n   *    math.log10(10000)              // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *    math.pow(10, 4)                // returns 10000\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log2\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 10-base logarithm of `x`\n   */\n\n  function complexLog (c) {\n    return c.log().div(Math.LN10)\n  }\n\n  function complexLogNumber (x) {\n    return complexLog(new Complex(x, 0))\n  }\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return log10Number(x)\n      } else {\n        // negative value -> complex value computation\n        return complexLogNumber(x)\n      }\n    },\n\n    bigint: promoteLogarithm(log16, log10Number, config, complexLogNumber),\n\n    Complex: complexLog,\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log()\n      } else {\n        // downgrade to number, return Complex valued result\n        return complexLogNumber(x.toNumber())\n      }\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { log2Number } from '../../plain/number/index.js'\nimport { promoteLogarithm } from '../../utils/bigint.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'log2'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createLog2 = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log2(x)\n   *\n   * Examples:\n   *\n   *    math.log2(0.03125)           // returns -5\n   *    math.log2(16)                // returns 4\n   *    math.log2(16) / math.log2(2) // returns 4\n   *    math.pow(2, 4)               // returns 16\n   *\n   * See also:\n   *\n   *    exp, log, log1p, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the 2-base logarithm of `x`\n   */\n  function complexLog2Number (x) {\n    return _log2Complex(new Complex(x, 0))\n  }\n\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return log2Number(x)\n      } else {\n        // negative value -> complex value computation\n        return complexLog2Number(x)\n      }\n    },\n\n    bigint: promoteLogarithm(4, log2Number, config, complexLog2Number),\n\n    Complex: _log2Complex,\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.log(2)\n      } else {\n        // downgrade to number, return Complex valued result\n        return complexLog2Number(x.toNumber())\n      }\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n\n  /**\n   * Calculate log2 for a complex value\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log2Complex (x) {\n    const newX = Math.sqrt(x.re * x.re + x.im * x.im)\n    return new Complex(\n      (Math.log2) ? Math.log2(newX) : Math.log(newX) / Math.LN2,\n      Math.atan2(x.im, x.re) / Math.LN2\n    )\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { multiplyNumber } from '../../plain/number/index.js'\n\nconst name = 'multiplyScalar'\nconst dependencies = ['typed']\n\nexport const createMultiplyScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Multiply two scalar values, `x * y`.\n   * This function is meant for internal use: it is used by the public function\n   * `multiply`\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to multiply\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Multiplication of `x` and `y`\n   * @private\n   */\n  return typed('multiplyScalar', {\n\n    'number, number': multiplyNumber,\n\n    'Complex, Complex': function (x, y) {\n      return x.mul(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.times(y)\n    },\n\n    'bigint, bigint': function (x, y) {\n      return x * y\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.mul(y)\n    },\n\n    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),\n\n    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\n\nconst name = 'multiply'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'addScalar',\n  'multiplyScalar',\n  'equalScalar',\n  'dot'\n]\n\nexport const createMultiply = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, addScalar, multiplyScalar, equalScalar, dot }) => {\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  function _validateMatrixDimensions (size1, size2) {\n    // check left operand dimensions\n    switch (size1.length) {\n      case 1:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Vector x Vector\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length')\n            }\n            break\n          case 2:\n            // Vector x Matrix\n            if (size1[0] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')')\n            }\n            break\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)')\n        }\n        break\n      case 2:\n        // check size2\n        switch (size2.length) {\n          case 1:\n            // Matrix x Vector\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')')\n            }\n            break\n          case 2:\n            // Matrix x Matrix\n            if (size1[1] !== size2[0]) {\n              // throw error\n              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')')\n            }\n            break\n          default:\n            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)')\n        }\n        break\n      default:\n        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)')\n    }\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (N)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {number}             Scalar value\n   */\n  function _multiplyVectorVector (a, b, n) {\n    // check empty vector\n    if (n === 0) { throw new Error('Cannot multiply two empty vectors') }\n    return dot(a, b)\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Matrix         (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorMatrix (a, b) {\n    // process storage\n    if (b.storage() !== 'dense') {\n      throw new Error('Support for SparseMatrix not implemented')\n    }\n    return _multiplyVectorDenseMatrix(a, b)\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Dense Vector   (M)\n   * @param {Matrix} b            Dense Matrix   (MxN)\n   *\n   * @return {Matrix}             Dense Vector   (N)\n   */\n  function _multiplyVectorDenseMatrix (a, b) {\n    // a dense\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype || a.getDataType()\n    // b dense\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype || b.getDataType()\n    // rows & columns\n    const alength = asize[0]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n    }\n\n    // result\n    const c = []\n\n    // loop matrix columns\n    for (let j = 0; j < bcolumns; j++) {\n      // sum (do not initialize it with zero)\n      let sum = mf(adata[0], bdata[0][j])\n      // loop vector\n      for (let i = 1; i < alength; i++) {\n        // multiply & accumulate\n        sum = af(sum, mf(adata[i], bdata[i][j]))\n      }\n      c[j] = sum\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Dense Vector   (N)\n   *\n   * @return {Matrix}             Dense Vector   (M)\n   */\n  const _multiplyMatrixVector = typed('_multiplyMatrixVector', {\n    'DenseMatrix, any': _multiplyDenseMatrixVector,\n    'SparseMatrix, any': _multiplySparseMatrixVector\n  })\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            Matrix         (MxN)\n   * @param {Matrix} b            Matrix         (NxC)\n   *\n   * @return {Matrix}             Matrix         (MxC)\n   */\n  const _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {\n    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,\n    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,\n    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,\n    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix\n  })\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix  (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             Dense Vector (M)\n   */\n  function _multiplyDenseMatrixVector (a, b) {\n    // a dense\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype || a.getDataType()\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype || b.getDataType()\n    // rows & columns\n    const arows = asize[0]\n    const acolumns = asize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n    }\n\n    // result\n    const c = []\n\n    // loop matrix a rows\n    for (let i = 0; i < arows; i++) {\n      // current row\n      const row = adata[i]\n      // sum (do not initialize it with zero)\n      let sum = mf(row[0], bdata[0])\n      // loop matrix a columns\n      for (let j = 1; j < acolumns; j++) {\n        // multiply & accumulate\n        sum = af(sum, mf(row[j], bdata[j]))\n      }\n      c[i] = sum\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            DenseMatrix    (NxC)\n   *\n   * @return {Matrix}             DenseMatrix    (MxC)\n   */\n  function _multiplyDenseMatrixDenseMatrix (a, b) { // getDataType()\n    // a dense\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype || a.getDataType()\n    // b dense\n    const bdata = b._data\n    const bsize = b._size\n    const bdt = b._datatype || b.getDataType()\n    // rows & columns\n    const arows = asize[0]\n    const acolumns = asize[1]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n    }\n\n    // result\n    const c = []\n\n    // loop matrix a rows\n    for (let i = 0; i < arows; i++) {\n      // current row\n      const row = adata[i]\n      // initialize row array\n      c[i] = []\n      // loop matrix b columns\n      for (let j = 0; j < bcolumns; j++) {\n        // sum (avoid initializing sum to zero)\n        let sum = mf(row[0], bdata[0][j])\n        // loop matrix a columns\n        for (let x = 1; x < acolumns; x++) {\n          // multiply & accumulate\n          sum = af(sum, mf(row[x], bdata[x][j]))\n        }\n        c[i][j] = sum\n      }\n    }\n\n    // return matrix\n    return a.createDenseMatrix({\n      data: c,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            DenseMatrix    (MxN)\n   * @param {Matrix} b            SparseMatrix   (NxC)\n   *\n   * @return {Matrix}             SparseMatrix   (MxC)\n   */\n  function _multiplyDenseMatrixSparseMatrix (a, b) {\n    // a dense\n    const adata = a._data\n    const asize = a._size\n    const adt = a._datatype || a.getDataType()\n    // b sparse\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n    // validate b matrix\n    if (!bvalues) { throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix') }\n    // rows & columns\n    const arows = asize[0]\n    const bcolumns = bsize[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n    }\n\n    // result\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const c = b.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n\n    // loop b columns\n    for (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // indeces in column jb\n      const kb0 = bptr[jb]\n      const kb1 = bptr[jb + 1]\n      // do not process column jb if no data exists\n      if (kb1 > kb0) {\n        // last row mark processed\n        let last = 0\n        // loop a rows\n        for (let i = 0; i < arows; i++) {\n          // column mark\n          const mark = i + 1\n          // C[i, jb]\n          let cij\n          // values in b column j\n          for (let kb = kb0; kb < kb1; kb++) {\n            // row\n            const ib = bindex[kb]\n            // check value has been initialized\n            if (last !== mark) {\n              // first value in column jb\n              cij = mf(adata[i][ib], bvalues[kb])\n              // update mark\n              last = mark\n            } else {\n              // accumulate value\n              cij = af(cij, mf(adata[i][ib], bvalues[kb]))\n            }\n          }\n          // check column has been processed and value != 0\n          if (last === mark && !eq(cij, zero)) {\n            // push row & value\n            cindex.push(i)\n            cvalues.push(cij)\n          }\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length\n\n    // return sparse matrix\n    return c\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix    (MxN)\n   * @param {Matrix} b            Dense Vector (N)\n   *\n   * @return {Matrix}             SparseMatrix    (M, 1)\n   */\n  function _multiplySparseMatrixVector (a, b) {\n    // a sparse\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // validate a matrix\n    if (!avalues) { throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix') }\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype || b.getDataType()\n    // rows & columns\n    const arows = a._size[0]\n    const brows = b._size[0]\n    // result\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n    }\n\n    // workspace\n    const x = []\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n\n    // update ptr\n    cptr[0] = 0\n    // rows in b\n    for (let ib = 0; ib < brows; ib++) {\n      // b[ib]\n      const vbi = bdata[ib]\n      // check b[ib] != 0, avoid loops\n      if (!eq(vbi, zero)) {\n        // A values & index in ib column\n        for (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n          // a row\n          const ia = aindex[ka]\n          // check value exists in current j\n          if (!w[ia]) {\n            // ia is new entry in j\n            w[ia] = true\n            // add i to pattern of C\n            cindex.push(ia)\n            // x(ia) = A\n            x[ia] = mf(vbi, avalues[ka])\n          } else {\n            // i exists in C already\n            x[ia] = af(x[ia], mf(vbi, avalues[ka]))\n          }\n        }\n      }\n    }\n    // copy values from x to column jb of c\n    for (let p1 = cindex.length, p = 0; p < p1; p++) {\n      // row\n      const ic = cindex[p]\n      // copy value\n      cvalues[p] = x[ic]\n    }\n    // update ptr\n    cptr[1] = cindex.length\n\n    // matrix to return\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, 1],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            DenseMatrix       (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixDenseMatrix (a, b) {\n    // a sparse\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // validate a matrix\n    if (!avalues) { throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix') }\n    // b dense\n    const bdata = b._data\n    const bdt = b._datatype || b.getDataType()\n    // rows & columns\n    const arows = a._size[0]\n    const brows = b._size[0]\n    const bcolumns = b._size[1]\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n    // equalScalar signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n    }\n\n    // result\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n\n    // workspace\n    const x = []\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n\n    // loop b columns\n    for (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // mark in workspace for current column\n      const mark = jb + 1\n      // rows in jb\n      for (let ib = 0; ib < brows; ib++) {\n        // b[ib, jb]\n        const vbij = bdata[ib][jb]\n        // check b[ib, jb] != 0, avoid loops\n        if (!eq(vbij, zero)) {\n          // A values & index in ib column\n          for (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // a row\n            const ia = aindex[ka]\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark\n              // add i to pattern of C\n              cindex.push(ia)\n              // x(ia) = A\n              x[ia] = mf(vbij, avalues[ka])\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(vbij, avalues[ka]))\n            }\n          }\n        }\n      }\n      // copy values from x to column jb of c\n      for (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n        // row\n        const ic = cindex[p]\n        // copy value\n        cvalues[p] = x[ic]\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length\n\n    // return sparse matrix\n    return c\n  }\n\n  /**\n   * C = A * B\n   *\n   * @param {Matrix} a            SparseMatrix      (MxN)\n   * @param {Matrix} b            SparseMatrix      (NxC)\n   *\n   * @return {Matrix}             SparseMatrix      (MxC)\n   */\n  function _multiplySparseMatrixSparseMatrix (a, b) {\n    // a sparse\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // b sparse\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // rows & columns\n    const arows = a._size[0]\n    const bcolumns = b._size[1]\n    // flag indicating both matrices (a & b) contain data\n    const values = avalues && bvalues\n\n    // datatype\n    let dt\n    // addScalar signature to use\n    let af = addScalar\n    // multiplyScalar signature to use\n    let mf = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signatures that matches (dt, dt)\n      af = typed.find(addScalar, [dt, dt])\n      mf = typed.find(multiplyScalar, [dt, dt])\n    }\n\n    // result\n    const cvalues = values ? [] : undefined\n    const cindex = []\n    const cptr = []\n    // c matrix\n    const c = a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [arows, bcolumns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n\n    // workspace\n    const x = values ? [] : undefined\n    // vector with marks indicating a value x[i] exists in a given column\n    const w = []\n    // variables\n    let ka, ka0, ka1, kb, kb0, kb1, ia, ib\n    // loop b columns\n    for (let jb = 0; jb < bcolumns; jb++) {\n      // update ptr\n      cptr[jb] = cindex.length\n      // mark in workspace for current column\n      const mark = jb + 1\n      // B values & index in j\n      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {\n        // b row\n        ib = bindex[kb]\n        // check we need to process values\n        if (values) {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka]\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark\n              // add i to pattern of C\n              cindex.push(ia)\n              // x(ia) = A\n              x[ia] = mf(bvalues[kb], avalues[ka])\n            } else {\n              // i exists in C already\n              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]))\n            }\n          }\n        } else {\n          // loop values in a[:,ib]\n          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {\n            // row\n            ia = aindex[ka]\n            // check value exists in current j\n            if (w[ia] !== mark) {\n              // ia is new entry in j\n              w[ia] = mark\n              // add i to pattern of C\n              cindex.push(ia)\n            }\n          }\n        }\n      }\n      // check we need to process matrix values (pattern matrix)\n      if (values) {\n        // copy values from x to column jb of c\n        for (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {\n          // row\n          const ic = cindex[p]\n          // copy value\n          cvalues[p] = x[ic]\n        }\n      }\n    }\n    // update ptr\n    cptr[bcolumns] = cindex.length\n\n    // return sparse matrix\n    return c\n  }\n\n  /**\n   * Multiply two or more values, `x * y`.\n   * For matrices, the matrix product is calculated.\n   *\n   * Syntax:\n   *\n   *    math.multiply(x, y)\n   *    math.multiply(x, y, z, ...)\n   *\n   * Examples:\n   *\n   *    math.multiply(4, 5.2)        // returns number 20.8\n   *    math.multiply(2, 3, 4)       // returns number 24\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.multiply(a, b)          // returns Complex 5 + 14i\n   *\n   *    const c = [[1, 2], [4, 3]]\n   *    const d = [[1, 2, 3], [3, -4, 7]]\n   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]\n   *\n   *    const e = math.unit('2.1 km')\n   *    math.multiply(3, e)          // returns Unit 6.3 km\n   *\n   * See also:\n   *\n   *    divide, prod, cross, dot\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to multiply\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`\n   */\n  return typed(name, multiplyScalar, {\n    // we extend the signatures of multiplyScalar with signatures dealing with matrices\n\n    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {\n      // check dimensions\n      _validateMatrixDimensions(arraySize(x), arraySize(y))\n\n      // use dense matrix implementation\n      const m = selfMM(matrix(x), matrix(y))\n      // return array or scalar\n      return isMatrix(m) ? m.valueOf() : m\n    }),\n\n    'Matrix, Matrix': function (x, y) {\n      // dimensions\n      const xsize = x.size()\n      const ysize = y.size()\n\n      // check dimensions\n      _validateMatrixDimensions(xsize, ysize)\n\n      // process dimensions\n      if (xsize.length === 1) {\n        // process y dimensions\n        if (ysize.length === 1) {\n          // Vector * Vector\n          return _multiplyVectorVector(x, y, xsize[0])\n        }\n        // Vector * Matrix\n        return _multiplyVectorMatrix(x, y)\n      }\n      // process y dimensions\n      if (ysize.length === 1) {\n        // Matrix * Vector\n        return _multiplyMatrixVector(x, y)\n      }\n      // Matrix * Matrix\n      return _multiplyMatrixMatrix(x, y)\n    },\n\n    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM =>\n      (x, y) => selfMM(x, matrix(y))),\n\n    'Array, Matrix': typed.referToSelf(self => (x, y) => {\n      // use Matrix * Matrix implementation\n      return self(matrix(x, y.storage()), y)\n    }),\n\n    'SparseMatrix, any': function (x, y) {\n      return matAlgo11xS0s(x, y, multiplyScalar, false)\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return matAlgo14xDs(x, y, multiplyScalar, false)\n    },\n\n    'any, SparseMatrix': function (x, y) {\n      return matAlgo11xS0s(y, x, multiplyScalar, true)\n    },\n\n    'any, DenseMatrix': function (x, y) {\n      return matAlgo14xDs(y, x, multiplyScalar, true)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf()\n    },\n\n    'any, Array': function (x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf()\n    },\n\n    'any, any': multiplyScalar,\n\n    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n      let result = self(x, y)\n\n      for (let i = 0; i < rest.length; i++) {\n        result = self(result, rest[i])\n      }\n\n      return result\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { nthRootNumber } from '../../plain/number/index.js'\n\nconst name = 'nthRoot'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'concat'\n]\n\nexport const createNthRoot = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, BigNumber, concat }) => {\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo06xS0S0 = createMatAlgo06xS0S0({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Calculate the nth root of a value.\n   * The principal nth root of a positive real number A, is the positive real\n   * solution of the equation\n   *\n   *     x^root = A\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *     math.nthRoot(a)\n   *     math.nthRoot(a, root)\n   *\n   * Examples:\n   *\n   *     math.nthRoot(9, 2)    // returns 3 (since 3^2 == 9)\n   *     math.sqrt(9)          // returns 3 (since 3^2 == 9)\n   *     math.nthRoot(64, 3)   // returns 4 (since 4^3 == 64)\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param {number | BigNumber | Array | Matrix | Complex} a\n   *              Value for which to calculate the nth root\n   * @param {number | BigNumber} [root=2]    The root.\n   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`\n   */\n  function complexErr () {\n    throw new Error(\n      'Complex number not supported in function nthRoot. Use nthRoots instead.')\n  }\n\n  return typed(\n    name,\n    {\n      number: nthRootNumber,\n      'number, number': nthRootNumber,\n\n      BigNumber: x => _bigNthRoot(x, new BigNumber(2)),\n      'BigNumber, BigNumber': _bigNthRoot,\n\n      Complex: complexErr,\n      'Complex, number': complexErr,\n\n      Array: typed.referTo('DenseMatrix,number', selfDn =>\n        x => selfDn(matrix(x), 2).valueOf()),\n      DenseMatrix: typed.referTo('DenseMatrix,number', selfDn =>\n        x => selfDn(x, 2)),\n      SparseMatrix: typed.referTo('SparseMatrix,number', selfSn =>\n        x => selfSn(x, 2)),\n\n      'SparseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // sparse + sparse\n          return matAlgo06xS0S0(x, y, self)\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero')\n        }\n      }),\n\n      'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // dense + sparse\n          return matAlgo01xDSid(x, y, self, false)\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero')\n        }\n      }),\n\n      'Array, SparseMatrix': typed.referTo('DenseMatrix,SparseMatrix', selfDS =>\n        (x, y) => selfDS(matrix(x), y)),\n\n      'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // density must be one (no zeros in matrix)\n        if (y.density() === 1) {\n          // sparse - scalar\n          return matAlgo11xS0s(y, x, self, true)\n        } else {\n          // throw exception\n          throw new Error('Root must be non-zero')\n        }\n      })\n    },\n    matrixAlgorithmSuite({\n      scalar: 'number | BigNumber',\n      SD: matAlgo02xDS0,\n      Ss: matAlgo11xS0s,\n      sS: false\n    })\n  )\n\n  /**\n   * Calculate the nth root of a for BigNumbers, solve x^root == a\n   * https://rosettacode.org/wiki/Nth_root#JavaScript\n   * @param {BigNumber} a\n   * @param {BigNumber} root\n   * @private\n   */\n  function _bigNthRoot (a, root) {\n    const precision = BigNumber.precision\n    const Big = BigNumber.clone({ precision: precision + 2 })\n    const zero = new BigNumber(0)\n\n    const one = new Big(1)\n    const inv = root.isNegative()\n    if (inv) {\n      root = root.neg()\n    }\n\n    if (root.isZero()) {\n      throw new Error('Root must be non-zero')\n    }\n    if (a.isNegative() && !root.abs().mod(2).equals(1)) {\n      throw new Error('Root must be odd when a is negative.')\n    }\n\n    // edge cases zero and infinity\n    if (a.isZero()) {\n      return inv ? new Big(Infinity) : 0\n    }\n    if (!a.isFinite()) {\n      return inv ? zero : a\n    }\n\n    let x = a.abs().pow(one.div(root))\n    // If a < 0, we require that root is an odd integer,\n    // so (-1) ^ (1/root) = -1\n    x = a.isNeg() ? x.neg() : x\n    return new BigNumber((inv ? one.div(x) : x).toPrecision(precision))\n  }\n})\n\nexport const createNthRootNumber = /* #__PURE__ */ factory(name, ['typed'], ({ typed }) => {\n  return typed(name, {\n    number: nthRootNumber,\n    'number, number': nthRootNumber\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { signNumber } from '../../plain/number/index.js'\n\nconst name = 'sign'\nconst dependencies = ['typed', 'BigNumber', 'Fraction', 'complex']\n\nexport const createSign = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber, complex, Fraction }) => {\n  /**\n   * Compute the sign of a value. The sign of a value x is:\n   *\n   * -  1 when x > 0\n   * - -1 when x < 0\n   * -  0 when x == 0\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.sign(x)\n   *\n   * Examples:\n   *\n   *    math.sign(3.5)               // returns 1\n   *    math.sign(-4.2)              // returns -1\n   *    math.sign(0)                 // returns 0\n   *\n   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]\n   *\n   * See also:\n   *\n   *    abs\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x\n   *            The number for which to determine the sign\n   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}\n   *            The sign of `x`\n   */\n  return typed(name, {\n    number: signNumber,\n\n    Complex: function (x) {\n      return x.im === 0 ? complex(signNumber(x.re)) : x.sign()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(x.cmp(0))\n    },\n\n    bigint: function (x) {\n      return x > 0n ? 1n : x < 0n ? -1n : 0n\n    },\n\n    Fraction: function (x) {\n      return x.n === 0n ? new Fraction(0) : new Fraction(x.s)\n    },\n\n    // deep map collection, skip zeros since sign(0) = 0\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),\n\n    Unit: typed.referToSelf(self => x => {\n      if (!x._isDerived() && x.units[0].unit.offset !== 0) {\n        throw new TypeError('sign is ambiguous for units with offset')\n      }\n      return typed.find(self, x.valueType())(x.value)\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'sqrt'\nconst dependencies = ['config', 'typed', 'Complex']\n\nexport const createSqrt = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, Complex }) => {\n  /**\n   * Calculate the square root of a value.\n   *\n   * For matrices, if you want the matrix square root of a square matrix,\n   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to\n   * a matrix M, use `math.map(M, math.sqrt)`.\n   *\n   * Syntax:\n   *\n   *    math.sqrt(x)\n   *\n   * Examples:\n   *\n   *    math.sqrt(25)                // returns 5\n   *    math.square(5)               // returns 25\n   *    math.sqrt(-4)                // returns Complex 2i\n   *\n   * See also:\n   *\n   *    square, multiply, cube, cbrt, sqrtm\n   *\n   * @param {number | BigNumber | Complex | Unit} x\n   *            Value for which to calculate the square root.\n   * @return {number | BigNumber | Complex | Unit}\n   *            Returns the square root of `x`\n   */\n  return typed('sqrt', {\n    number: _sqrtNumber,\n\n    Complex: function (x) {\n      return x.sqrt()\n    },\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.sqrt()\n      } else {\n        // negative value -> downgrade to number to do complex value computation\n        return _sqrtNumber(x.toNumber())\n      }\n    },\n\n    Unit: function (x) {\n      // Someday will work for complex units when they are implemented\n      return x.pow(0.5)\n    }\n\n  })\n\n  /**\n   * Calculate sqrt for a number\n   * @param {number} x\n   * @returns {number | Complex} Returns the square root of x\n   * @private\n   */\n  function _sqrtNumber (x) {\n    if (isNaN(x)) {\n      return NaN\n    } else if (x >= 0 || config.predictable) {\n      return Math.sqrt(x)\n    } else {\n      return new Complex(x, 0).sqrt()\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { squareNumber } from '../../plain/number/index.js'\n\nconst name = 'square'\nconst dependencies = ['typed']\n\nexport const createSquare = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the square of a value, `x * x`.\n   * To avoid confusion with multiplying a square matrix by itself,\n   * this function does not apply to matrices. If you wish to square\n   * every element of a matrix, see the examples.\n   *\n   * Syntax:\n   *\n   *    math.square(x)\n   *\n   * Examples:\n   *\n   *    math.square(2)           // returns number 4\n   *    math.square(3)           // returns number 9\n   *    math.pow(3, 2)           // returns number 9\n   *    math.multiply(3, 3)      // returns number 9\n   *\n   *    math.map([1, 2, 3, 4], math.square)  // returns Array [1, 4, 9, 16]\n   *\n   * See also:\n   *\n   *    multiply, cube, sqrt, pow\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x\n   *            Number for which to calculate the square\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}\n   *            Squared value\n   */\n  return typed(name, {\n    number: squareNumber,\n\n    Complex: function (x) {\n      return x.mul(x)\n    },\n\n    BigNumber: function (x) {\n      return x.times(x)\n    },\n\n    bigint: function (x) {\n      return x * x\n    },\n\n    Fraction: function (x) {\n      return x.mul(x)\n    },\n\n    Unit: function (x) {\n      return x.pow(2)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'subtract'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'subtractScalar',\n  'unaryMinus',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createSubtract = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, subtractScalar, unaryMinus, DenseMatrix, concat }) => {\n  // TODO: split function subtract in two: subtract and subtractScalar\n\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo05xSfSf = createMatAlgo05xSfSf({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Subtract two values, `x - y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.subtract(x, y)\n   *\n   * Examples:\n   *\n   *    math.subtract(5.3, 2)        // returns number 3.3\n   *\n   *    const a = math.complex(2, 3)\n   *    const b = math.complex(4, 1)\n   *    math.subtract(a, b)          // returns Complex -2 + 2i\n   *\n   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]\n   *\n   *    const c = math.unit('2.1 km')\n   *    const d = math.unit('500m')\n   *    math.subtract(c, d)          // returns Unit 1.6 km\n   *\n   * See also:\n   *\n   *    add\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Initial value\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`\n   */\n  return typed(\n    name,\n    {\n      'any, any': subtractScalar\n    },\n    matrixAlgorithmSuite({\n      elop: subtractScalar,\n      SS: matAlgo05xSfSf,\n      DS: matAlgo01xDSid,\n      SD: matAlgo03xDSf,\n      Ss: matAlgo12xSfs,\n      sS: matAlgo10xSids\n    })\n  )\n})\n","import { factory } from '../../utils/factory.js'\nimport { xgcdNumber } from '../../plain/number/index.js'\n\nconst name = 'xgcd'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createXgcd = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Calculate the extended greatest common divisor for two values.\n   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.\n   *\n   * Syntax:\n   *\n   *    math.xgcd(a, b)\n   *\n   * Examples:\n   *\n   *    math.xgcd(8, 12)             // returns [4, -1, 1]\n   *    math.gcd(8, 12)              // returns 4\n   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]\n   *\n   * See also:\n   *\n   *    gcd, lcm\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`\n   *                              where `div = gcd(a, b)` and `a*m + b*n = div`\n   */\n  return typed(name, {\n    'number, number': function (a, b) {\n      const res = xgcdNumber(a, b)\n\n      return (config.matrix === 'Array')\n        ? res\n        : matrix(res)\n    },\n    'BigNumber, BigNumber': _xgcdBigNumber\n    // TODO: implement support for Fraction\n  })\n\n  /**\n   * Calculate xgcd for two BigNumbers\n   * @param {BigNumber} a\n   * @param {BigNumber} b\n   * @return {BigNumber[]} result\n   * @private\n   */\n  function _xgcdBigNumber (a, b) {\n    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm\n    let // used to swap two variables\n      t\n\n    let // quotient\n      q\n\n    let // remainder\n      r\n\n    const zero = new BigNumber(0)\n    const one = new BigNumber(1)\n    let x = zero\n    let lastx = one\n    let y = one\n    let lasty = zero\n\n    if (!a.isInt() || !b.isInt()) {\n      throw new Error('Parameters in function xgcd must be integer numbers')\n    }\n\n    while (!b.isZero()) {\n      q = a.div(b).floor()\n      r = a.mod(b)\n\n      t = x\n      x = lastx.minus(q.times(x))\n      lastx = t\n\n      t = y\n      y = lasty.minus(q.times(y))\n      lasty = t\n\n      a = b\n      b = r\n    }\n\n    let res\n    if (a.lt(zero)) {\n      res = [a.neg(), lastx.neg(), lasty.neg()]\n    } else {\n      res = [a, !a.isZero() ? lastx : 0, lasty]\n    }\n    return (config.matrix === 'Array') ? res : matrix(res)\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'invmod'\nconst dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger']\n\nexport const createInvmod = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, BigNumber, xgcd, equal, smaller, mod, add, isInteger }) => {\n  /**\n   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`\n   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.\n   *\n   * Syntax:\n   *\n   *    math.invmod(a, b)\n   *\n   * Examples:\n   *\n   *    math.invmod(8, 12)             // returns NaN\n   *    math.invmod(7, 13)             // returns 2\n   *    math.invmod(15151, 15122)      // returns 10429\n   *\n   * See also:\n   *\n   *    gcd, xgcd\n   *\n   * @param {number | BigNumber} a  An integer number\n   * @param {number | BigNumber} b  An integer number\n   * @return {number | BigNumber }  Returns an integer number\n   *                              where `invmod(a,b)*a ≣ 1 (mod b)`\n   */\n  return typed(name, {\n    'number, number': invmod,\n    'BigNumber, BigNumber': invmod\n  })\n\n  function invmod (a, b) {\n    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers')\n    a = mod(a, b)\n    if (equal(b, 0)) throw new Error('Divisor must be non zero')\n    let res = xgcd(a, b)\n    res = res.valueOf()\n    let [gcd, inv] = res\n    if (!equal(gcd, BigNumber(1))) return NaN\n    inv = mod(inv, b)\n    if (smaller(inv, BigNumber(0))) inv = add(inv, b)\n    return inv\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo09xS0Sf'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo09xS0Sf = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).\n   * Callback function invoked NZA times, number of nonzero elements in A.\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo09xS0Sf (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = avalues && bvalues ? [] : undefined\n    const cindex = []\n    const cptr = []\n\n    // workspaces\n    const x = cvalues ? [] : undefined\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // vars\n    let i, j, k, k0, k1\n\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // column mark\n      const mark = j + 1\n      // check we need to process values\n      if (x) {\n        // loop B(:,j)\n        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n          // row\n          i = bindex[k]\n          // update workspace\n          w[i] = mark\n          x[i] = bvalues[k]\n        }\n      }\n      // loop A(:,j)\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // check we need to process values\n        if (x) {\n          // b value @ i,j\n          const vb = w[i] === mark ? x[i] : zero\n          // invoke f\n          const vc = cf(avalues[k], vb)\n          // check zero value\n          if (!eq(vc, zero)) {\n            // push index\n            cindex.push(i)\n            // push value\n            cvalues.push(vc)\n          }\n        } else {\n          // push index\n          cindex.push(i)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'dotMultiply'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'multiplyScalar',\n  'concat'\n]\n\nexport const createDotMultiply = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, multiplyScalar, concat }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo09xS0Sf = createMatAlgo09xS0Sf({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Multiply two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotMultiply(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotMultiply(2, 4) // returns 8\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]\n   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]\n   *\n   * See also:\n   *\n   *    multiply, divide, dotDivide\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`\n   */\n  return typed(name, matrixAlgorithmSuite({\n    elop: multiplyScalar,\n    SS: matAlgo09xS0Sf,\n    DS: matAlgo02xDS0,\n    Ss: matAlgo11xS0s\n  }))\n})\n","/**\n * Bitwise and for Bignumbers\n *\n * Special Cases:\n *   N &  n =  N\n *   n &  0 =  0\n *   n & -1 =  n\n *   n &  n =  n\n *   I &  I =  I\n *  -I & -I = -I\n *   I & -I =  0\n *   I &  n =  n\n *   I & -n =  I\n *  -I &  n =  0\n *  -I & -n = -I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` & `y`, is fully precise\n * @private\n */\nexport function bitAndBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitAnd')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n\n  if (x.isZero() || y.eq(-1) || x.eq(y)) {\n    return x\n  }\n  if (y.isZero() || x.eq(-1)) {\n    return y\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      if (x.isNegative() === y.isNegative()) {\n        return x\n      }\n      return new BigNumber(0)\n    }\n    if (!x.isFinite()) {\n      if (y.isNegative()) {\n        return x\n      }\n      if (x.isNegative()) {\n        return new BigNumber(0)\n      }\n      return y\n    }\n    if (!y.isFinite()) {\n      if (x.isNegative()) {\n        return y\n      }\n      if (y.isNegative()) {\n        return new BigNumber(0)\n      }\n      return x\n    }\n  }\n  return bitwise(x, y, function (a, b) { return a & b })\n}\n\n/**\n * Bitwise not\n * @param {BigNumber} x\n * @return {BigNumber} Result of ~`x`, fully precise\n *\n */\nexport function bitNotBigNumber (x) {\n  if (x.isFinite() && !x.isInteger()) {\n    throw new Error('Integer expected in function bitNot')\n  }\n\n  const BigNumber = x.constructor\n  const prevPrec = BigNumber.precision\n  BigNumber.config({ precision: 1E9 })\n\n  const result = x.plus(new BigNumber(1))\n  result.s = -result.s || null\n\n  BigNumber.config({ precision: prevPrec })\n  return result\n}\n\n/**\n * Bitwise OR for BigNumbers\n *\n * Special Cases:\n *   N |  n =  N\n *   n |  0 =  n\n *   n | -1 = -1\n *   n |  n =  n\n *   I |  I =  I\n *  -I | -I = -I\n *   I | -n = -1\n *   I | -I = -1\n *   I |  n =  I\n *  -I |  n = -I\n *  -I | -n = -n\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` | `y`, fully precise\n */\nexport function bitOrBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitOr')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n\n  const negOne = new BigNumber(-1)\n  if (x.isZero() || y.eq(negOne) || x.eq(y)) {\n    return y\n  }\n  if (y.isZero() || x.eq(negOne)) {\n    return x\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if ((!x.isFinite() && !x.isNegative() && y.isNegative()) ||\n      (x.isNegative() && !y.isNegative() && !y.isFinite())) {\n      return negOne\n    }\n    if (x.isNegative() && y.isNegative()) {\n      return x.isFinite() ? x : y\n    }\n    return x.isFinite() ? y : x\n  }\n\n  return bitwise(x, y, function (a, b) { return a | b })\n}\n\n/**\n * Applies bitwise function to numbers\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @param {function (a, b)} func\n * @return {BigNumber}\n */\nexport function bitwise (x, y, func) {\n  const BigNumber = x.constructor\n\n  let xBits, yBits\n  const xSign = +(x.s < 0)\n  const ySign = +(y.s < 0)\n  if (xSign) {\n    xBits = decCoefficientToBinaryString(bitNotBigNumber(x))\n    for (let i = 0; i < xBits.length; ++i) {\n      xBits[i] ^= 1\n    }\n  } else {\n    xBits = decCoefficientToBinaryString(x)\n  }\n  if (ySign) {\n    yBits = decCoefficientToBinaryString(bitNotBigNumber(y))\n    for (let i = 0; i < yBits.length; ++i) {\n      yBits[i] ^= 1\n    }\n  } else {\n    yBits = decCoefficientToBinaryString(y)\n  }\n\n  let minBits, maxBits, minSign\n  if (xBits.length <= yBits.length) {\n    minBits = xBits\n    maxBits = yBits\n    minSign = xSign\n  } else {\n    minBits = yBits\n    maxBits = xBits\n    minSign = ySign\n  }\n\n  let shortLen = minBits.length\n  let longLen = maxBits.length\n  const expFuncVal = func(xSign, ySign) ^ 1\n  let outVal = new BigNumber(expFuncVal ^ 1)\n  let twoPower = new BigNumber(1)\n  const two = new BigNumber(2)\n\n  const prevPrec = BigNumber.precision\n  BigNumber.config({ precision: 1E9 })\n\n  while (shortLen > 0) {\n    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower)\n    }\n    twoPower = twoPower.times(two)\n  }\n  while (longLen > 0) {\n    if (func(minSign, maxBits[--longLen]) === expFuncVal) {\n      outVal = outVal.plus(twoPower)\n    }\n    twoPower = twoPower.times(two)\n  }\n\n  BigNumber.config({ precision: prevPrec })\n\n  if (expFuncVal === 0) {\n    outVal.s = -outVal.s\n  }\n  return outVal\n}\n\n/* Extracted from decimal.js, and edited to specialize. */\nfunction decCoefficientToBinaryString (x) {\n  // Convert to string\n  const a = x.d // array with digits\n  let r = a[0] + ''\n\n  for (let i = 1; i < a.length; ++i) {\n    let s = a[i] + ''\n    for (let z = 7 - s.length; z--;) {\n      s = '0' + s\n    }\n\n    r += s\n  }\n\n  let j = r.length\n  while (r.charAt(j) === '0') {\n    j--\n  }\n\n  let xe = x.e\n  let str = r.slice(0, j + 1 || 1)\n  const strL = str.length\n  if (xe > 0) {\n    if (++xe > strL) {\n      // Append zeros.\n      xe -= strL\n      while (xe--) {\n        str += '0'\n      }\n    } else if (xe < strL) {\n      str = str.slice(0, xe) + '.' + str.slice(xe)\n    }\n  }\n\n  // Convert from base 10 (decimal) to base 2\n  const arr = [0]\n  for (let i = 0; i < str.length;) {\n    let arrL = arr.length\n    while (arrL--) {\n      arr[arrL] *= 10\n    }\n\n    arr[0] += parseInt(str.charAt(i++)) // convert to int\n    for (let j = 0; j < arr.length; ++j) {\n      if (arr[j] > 1) {\n        if (arr[j + 1] === null || arr[j + 1] === undefined) {\n          arr[j + 1] = 0\n        }\n\n        arr[j + 1] += arr[j] >> 1\n        arr[j] &= 1\n      }\n    }\n  }\n\n  return arr.reverse()\n}\n\n/**\n * Bitwise XOR for BigNumbers\n *\n * Special Cases:\n *   N ^  n =  N\n *   n ^  0 =  n\n *   n ^  n =  0\n *   n ^ -1 = ~n\n *   I ^  n =  I\n *   I ^ -n = -I\n *   I ^ -I = -1\n *  -I ^  n = -I\n *  -I ^ -n =  I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` ^ `y`, fully precise\n *\n */\nexport function bitXor (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function bitXor')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN()) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero()) {\n    return y\n  }\n  if (y.isZero()) {\n    return x\n  }\n\n  if (x.eq(y)) {\n    return new BigNumber(0)\n  }\n\n  const negOne = new BigNumber(-1)\n  if (x.eq(negOne)) {\n    return bitNotBigNumber(y)\n  }\n  if (y.eq(negOne)) {\n    return bitNotBigNumber(x)\n  }\n\n  if (!x.isFinite() || !y.isFinite()) {\n    if (!x.isFinite() && !y.isFinite()) {\n      return negOne\n    }\n    return new BigNumber(x.isNegative() === y.isNegative()\n      ? Infinity\n      : -Infinity)\n  }\n  return bitwise(x, y, function (a, b) { return a ^ b })\n}\n\n/**\n * Bitwise left shift\n *\n * Special Cases:\n *  n << -n = N\n *  n <<  N = N\n *  N <<  n = N\n *  n <<  0 = n\n *  0 <<  n = 0\n *  I <<  I = N\n *  I <<  n = I\n *  n <<  I = I\n *\n * @param {BigNumber} x\n * @param {BigNumber} y\n * @return {BigNumber} Result of `x` << `y`\n *\n */\nexport function leftShiftBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function leftShift')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero() || y.isZero()) {\n    return x\n  }\n  if (!x.isFinite() && !y.isFinite()) {\n    return new BigNumber(NaN)\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.times(Math.pow(2, y.toNumber()) + '')\n  }\n  return x.times(new BigNumber(2).pow(y))\n}\n\n/*\n * Special Cases:\n *   n >> -n =  N\n *   n >>  N =  N\n *   N >>  n =  N\n *   I >>  I =  N\n *   n >>  0 =  n\n *   I >>  n =  I\n *  -I >>  n = -I\n *  -I >>  I = -I\n *   n >>  I =  I\n *  -n >>  I = -1\n *   0 >>  n =  0\n *\n * @param {BigNumber} value\n * @param {BigNumber} value\n * @return {BigNumber} Result of `x` >> `y`\n *\n */\nexport function rightArithShiftBigNumber (x, y) {\n  if ((x.isFinite() && !x.isInteger()) || (y.isFinite() && !y.isInteger())) {\n    throw new Error('Integers expected in function rightArithShift')\n  }\n\n  const BigNumber = x.constructor\n  if (x.isNaN() || y.isNaN() || (y.isNegative() && !y.isZero())) {\n    return new BigNumber(NaN)\n  }\n  if (x.isZero() || y.isZero()) {\n    return x\n  }\n  if (!y.isFinite()) {\n    if (x.isNegative()) {\n      return new BigNumber(-1)\n    }\n    if (!x.isFinite()) {\n      return new BigNumber(NaN)\n    }\n    return new BigNumber(0)\n  }\n\n  // Math.pow(2, y) is fully precise for y < 55, and fast\n  if (y.lt(55)) {\n    return x.div(Math.pow(2, y.toNumber()) + '').floor()\n  }\n  return x.div(new BigNumber(2).pow(y)).floor()\n}\n","import { isInteger } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function bitAndNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitAnd')\n  }\n\n  return x & y\n}\nbitAndNumber.signature = n2\n\nexport function bitNotNumber (x) {\n  if (!isInteger(x)) {\n    throw new Error('Integer expected in function bitNot')\n  }\n\n  return ~x\n}\nbitNotNumber.signature = n1\n\nexport function bitOrNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitOr')\n  }\n\n  return x | y\n}\nbitOrNumber.signature = n2\n\nexport function bitXorNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function bitXor')\n  }\n\n  return x ^ y\n}\nbitXorNumber.signature = n2\n\nexport function leftShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function leftShift')\n  }\n\n  return x << y\n}\nleftShiftNumber.signature = n2\n\nexport function rightArithShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightArithShift')\n  }\n\n  return x >> y\n}\nrightArithShiftNumber.signature = n2\n\nexport function rightLogShiftNumber (x, y) {\n  if (!isInteger(x) || !isInteger(y)) {\n    throw new Error('Integers expected in function rightLogShift')\n  }\n\n  return x >>> y\n}\nrightLogShiftNumber.signature = n2\n","import { bitAndBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { bitAndNumber } from '../../plain/number/index.js'\n\nconst name = 'bitAnd'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'concat'\n]\n\nexport const createBitAnd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, concat }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo06xS0S0 = createMatAlgo06xS0S0({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Bitwise AND two values, `x & y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitAnd(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitAnd(53, 131)               // returns number 1\n   *\n   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]\n   *\n   * See also:\n   *\n   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to and\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to and\n   * @return {number | BigNumber | bigint | Array | Matrix} AND of `x` and `y`\n   */\n  return typed(\n    name,\n    {\n      'number, number': bitAndNumber,\n      'BigNumber, BigNumber': bitAndBigNumber,\n      'bigint, bigint': (x, y) => x & y\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo06xS0S0,\n      DS: matAlgo02xDS0,\n      Ss: matAlgo11xS0s\n    })\n  )\n})\n","import { bitNotBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { bitNotNumber } from '../../plain/number/index.js'\n\nconst name = 'bitNot'\nconst dependencies = ['typed']\n\nexport const createBitNot = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Bitwise NOT value, `~x`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.bitNot(x)\n   *\n   * Examples:\n   *\n   *    math.bitNot(1)               // returns number -2\n   *\n   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, -5]\n   *\n   * See also:\n   *\n   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to not\n   * @return {number | BigNumber | bigint | Array | Matrix} NOT of `x`\n   */\n  return typed(name, {\n    number: bitNotNumber,\n    BigNumber: bitNotBigNumber,\n    bigint: x => ~x,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { bitOrBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { bitOrNumber } from '../../plain/number/index.js'\n\nconst name = 'bitOr'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createBitOr = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix, concat }) => {\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo04xSidSid = createMatAlgo04xSidSid({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Bitwise OR two values, `x | y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the lowest print base.\n   *\n   * Syntax:\n   *\n   *    math.bitOr(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitOr(1, 2)               // returns number 3\n   *\n   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to or\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to or\n   * @return {number | BigNumber | bigint | Array | Matrix} OR of `x` and `y`\n   */\n  return typed(\n    name,\n    {\n      'number, number': bitOrNumber,\n      'BigNumber, BigNumber': bitOrBigNumber,\n      'bigint, bigint': (x, y) => x | y\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo04xSidSid,\n      DS: matAlgo01xDSid,\n      Ss: matAlgo10xSids\n    })\n  )\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo07xSSf'\nconst dependencies = ['typed', 'SparseMatrix']\n\nexport const createMatAlgo07xSSf = /* #__PURE__ */ factory(name, dependencies, ({ typed, SparseMatrix }) => {\n  /**\n * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).\n * Callback function invoked MxN times.\n *\n * C(i,j) = f(Aij, Bij)\n *\n * @param {Matrix}   a                 The SparseMatrix instance (A)\n * @param {Matrix}   b                 The SparseMatrix instance (B)\n * @param {Function} callback          The f(Aij,Bij) operation to invoke\n *\n * @return {Matrix}                    SparseMatrix (C)\n *\n * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n */\n  return function matAlgo07xSSf (a, b, callback) {\n    // sparse matrix arrays\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    let zero = 0\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      dt = adt\n      zero = typed.convert(0, dt)\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays for sparse format\n    const cvalues = []\n    const cindex = []\n    const cptr = new Array(columns + 1).fill(0) // Start with column pointer array\n\n    // workspaces\n    const xa = []\n    const xb = []\n    const wa = []\n    const wb = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      const mark = j + 1\n      let nonZeroCount = 0\n\n      _scatter(a, j, wa, xa, mark)\n      _scatter(b, j, wb, xb, mark)\n\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        const va = wa[i] === mark ? xa[i] : zero\n        const vb = wb[i] === mark ? xb[i] : zero\n\n        // invoke callback\n        const cij = cf(va, vb)\n        // Store all non zero and true values\n        if (cij !== 0 && cij !== false) {\n          cindex.push(i) // row index\n          cvalues.push(cij) // computed value\n          nonZeroCount++\n        }\n      }\n\n      // Update column pointer with cumulative count of non-zero values\n      cptr[j + 1] = cptr[j] + nonZeroCount\n    }\n\n    // Return the result as a sparse matrix\n    return new SparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n\n  function _scatter (m, j, w, x, mark) {\n    // a arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // loop values in column j\n    for (let k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {\n      // row\n      const i = index[k]\n      // update workspace\n      w[i] = mark\n      x[i] = values[k]\n    }\n  }\n})\n","import { bitXor as bigBitXor } from '../../utils/bignumber/bitwise.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { bitXorNumber } from '../../plain/number/index.js'\n\nconst name = 'bitXor'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createBitXor = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Bitwise XOR two values, `x ^ y`.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.bitXor(x, y)\n   *\n   * Examples:\n   *\n   *    math.bitXor(1, 2)               // returns number 3\n   *\n   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to xor\n   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to xor\n   * @return {number | BigNumber | bigint | Array | Matrix} XOR of `x` and `y`\n   */\n  return typed(\n    name,\n    {\n      'number, number': bitXorNumber,\n      'BigNumber, BigNumber': bigBitXor,\n      'bigint, bigint': (x, y) => x ^ y\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'arg'\nconst dependencies = ['typed']\n\nexport const createArg = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the argument of a complex value.\n   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.arg(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 2)\n   *    math.arg(a) / math.pi          // returns number 0.25\n   *\n   *    const b = math.complex('2 + 3i')\n   *    math.arg(b)                    // returns number 0.982793723247329\n   *    math.atan2(3, 2)               // returns number 0.982793723247329\n   *\n   * See also:\n   *\n   *    re, im, conj, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The argument of x\n   */\n  return typed(name, {\n    number: function (x) {\n      return Math.atan2(0, x)\n    },\n\n    BigNumber: function (x) {\n      return x.constructor.atan2(0, x)\n    },\n\n    Complex: function (x) {\n      return x.arg()\n    },\n\n    // TODO: implement BigNumber support for function arg\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'conj'\nconst dependencies = ['typed']\n\nexport const createConj = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the complex conjugate of a complex value.\n   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.conj(x)\n   *\n   * Examples:\n   *\n   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i\n   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i\n   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i\n   *\n   * See also:\n   *\n   *    re, im, arg, abs\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Complex | Array | Matrix | Unit}\n   *            The complex conjugate of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.conjugate(),\n    Unit: typed.referToSelf(self => x => new x.constructor(self(x.toNumeric()), x.formatUnits())),\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 'im'\nconst dependencies = ['typed']\n\nexport const createIm = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Get the imaginary part of a complex number.\n   * For a complex number `a + bi`, the function returns `b`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.im(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number -5.2\n   *    math.re(math.complex(2.4))     // returns number 0\n   *\n   * See also:\n   *\n   *    re, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The imaginary part of x\n   */\n  return typed(name, {\n    number: () => 0,\n    'BigNumber | Fraction': x => x.mul(0),\n    Complex: x => x.im,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\n\nconst name = 're'\nconst dependencies = ['typed']\n\nexport const createRe = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Get the real part of a complex number.\n   * For a complex number `a + bi`, the function returns `a`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.re(x)\n   *\n   * Examples:\n   *\n   *    const a = math.complex(2, 3)\n   *    math.re(a)                     // returns number 2\n   *    math.im(a)                     // returns number 3\n   *\n   *    math.re(math.complex('-5.2i')) // returns number 0\n   *    math.re(math.complex(2.4))     // returns number 2.4\n   *\n   * See also:\n   *\n   *    im, conj, abs, arg\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            A complex number or array with complex numbers\n   * @return {number | BigNumber | Array | Matrix} The real part of x\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction': x => x,\n    Complex: x => x.re,\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","const n1 = 'number'\nconst n2 = 'number, number'\n\nexport function notNumber (x) {\n  return !x\n}\nnotNumber.signature = n1\n\nexport function orNumber (x, y) {\n  return !!(x || y)\n}\norNumber.signature = n2\n\nexport function xorNumber (x, y) {\n  return !!x !== !!y\n}\nxorNumber.signature = n2\n\nexport function andNumber (x, y) {\n  return !!(x && y)\n}\nandNumber.signature = n2\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { notNumber } from '../../plain/number/index.js'\n\nconst name = 'not'\nconst dependencies = ['typed']\n\nexport const createNot = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Logical `not`. Flips boolean value of a given parameter.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.not(x)\n   *\n   * Examples:\n   *\n   *    math.not(2)      // returns false\n   *    math.not(0)      // returns true\n   *    math.not(true)   // returns false\n   *\n   *    a = [2, -7, 0]\n   *    math.not(a)      // returns [false, false, true]\n   *\n   * See also:\n   *\n   *    and, or, xor\n   *\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when input is a zero or empty value.\n   */\n  return typed(name, {\n    'null | undefined': () => true,\n\n    number: notNumber,\n\n    Complex: function (x) {\n      return x.re === 0 && x.im === 0\n    },\n\n    BigNumber: function (x) {\n      return x.isZero() || x.isNaN()\n    },\n\n    bigint: x => !x,\n\n    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { createMatAlgo13xDD } from '../../type/matrix/utils/matAlgo13xDD.js'\nimport { DimensionError } from '../../error/DimensionError.js'\n\nconst name = 'nullish'\nconst dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual']\n\nexport const createNullish = /* #__PURE__ */ factory(\n  name,\n  dependencies,\n  ({ typed, matrix, size, flatten, deepEqual }) => {\n    const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n    const matAlgo14xDs = createMatAlgo14xDs({ typed })\n    const matAlgo13xDD = createMatAlgo13xDD({ typed })\n\n    /**\n     * Nullish coalescing operator (??). Returns the right-hand side operand\n     * when the left-hand side operand is null or undefined, and otherwise\n     * returns the left-hand side operand.\n     *\n     * For matrices, the function is evaluated element wise.\n     *\n     * Syntax:\n     *\n     *    math.nullish(x, y)\n     *\n     * Examples:\n     *\n     *    math.nullish(null, 42)        // returns 42\n     *    math.nullish(undefined, 42)   // returns 42\n     *    math.nullish(0, 42)           // returns 0\n     *    math.nullish(false, 42)       // returns false\n     *    math.nullish('', 42)          // returns ''\n     *\n     *    // Object property access with fallback\n     *    const obj = {foo: 7, bar: 3}\n     *    math.nullish(obj.baz, 0)      // returns 0\n     *\n     * See also:\n     *\n     *    and, or, not\n     *\n     * @param  {*} x First value to check\n     * @param  {*} y Fallback value\n     * @return {*} Returns y when x is null or undefined, otherwise returns x\n     */\n\n    return typed(\n      name,\n      {\n        // Scalar and SparseMatrix-first short-circuit handlers\n        'number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any': (x, _y) => x,\n        'null, any': (_x, y) => y,\n        'undefined, any': (_x, y) => y,\n\n        // SparseMatrix-first with collection RHS: enforce exact shape match\n        'SparseMatrix, Array | Matrix': (x, y) => {\n          const sx = flatten(size(x).valueOf()) // work around #3529/#3530\n          const sy = flatten(size(y).valueOf())\n          if (deepEqual(sx, sy)) return x\n          throw new DimensionError(sx, sy)\n        },\n\n        // DenseMatrix-first handlers (no broadcasting between collections)\n        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, y, self)),\n        'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(x, y, self, false)),\n        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, matrix(y), self)),\n        'DenseMatrix, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(x, y, self, false)),\n\n        // Array-first handlers (bridge via matrix() where needed)\n        'Array, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), matrix(y), self).valueOf()),\n        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), y, self)),\n        'Array, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(matrix(x), y, self, false)),\n        'Array, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(matrix(x), y, self, false).valueOf())\n      }\n    )\n  }\n)\n","import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { orNumber } from '../../plain/number/index.js'\n\nconst name = 'or'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createOr = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix, concat }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo05xSfSf = createMatAlgo05xSfSf({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.or(x, y)\n   *\n   * Examples:\n   *\n   *    math.or(2, 4)   // returns true\n   *\n   *    a = [2, 5, 0]\n   *    b = [0, 22, 0]\n   *    c = 0\n   *\n   *    math.or(a, b)   // returns [true, true, false]\n   *    math.or(b, c)   // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    and, not, xor\n   *\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.\n   */\n  return typed(\n    name,\n    {\n      'number, number': orNumber,\n\n      'Complex, Complex': function (x, y) {\n        return (x.re !== 0 || x.im !== 0) || (y.re !== 0 || y.im !== 0)\n      },\n\n      'BigNumber, BigNumber': function (x, y) {\n        return (!x.isZero() && !x.isNaN()) || (!y.isZero() && !y.isNaN())\n      },\n\n      'bigint, bigint': orNumber,\n\n      'Unit, Unit': typed.referToSelf(self =>\n        (x, y) => self(x.value || 0, y.value || 0))\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo05xSfSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n","import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { xorNumber } from '../../plain/number/index.js'\n\nconst name = 'xor'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createXor = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.xor(x, y)\n   *\n   * Examples:\n   *\n   *    math.xor(2, 4)   // returns false\n   *\n   *    a = [2, 0, 0]\n   *    b = [2, 7, 0]\n   *    c = 0\n   *\n   *    math.xor(a, b)   // returns [false, true, false]\n   *    math.xor(a, c)   // returns [true, false, false]\n   *\n   * See also:\n   *\n   *    and, not, or\n   *\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when one and only one input is defined with a nonzero/nonempty value.\n   */\n  return typed(\n    name,\n    {\n      'number, number': xorNumber,\n\n      'Complex, Complex': function (x, y) {\n        return ((x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0))\n      },\n\n      'bigint, bigint': xorNumber,\n\n      'BigNumber, BigNumber': function (x, y) {\n        return ((!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN()))\n      },\n\n      'Unit, Unit': typed.referToSelf(self =>\n        (x, y) => self(x.value || 0, y.value || 0))\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n","import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { arraySize, concat as _concat } from '../../utils/array.js'\nimport { IndexError } from '../../error/IndexError.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'concat'\nconst dependencies = ['typed', 'matrix', 'isInteger']\n\nexport const createConcat = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isInteger }) => {\n  /**\n   * Concatenate two or more matrices.\n   *\n   * Syntax:\n   *\n   *     math.concat(A, B, C, ...)\n   *     math.concat(A, B, C, ..., dim)\n   *\n   * Where:\n   *\n   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.\n   *   By default the last dimension of the matrices.\n   *\n   * Examples:\n   *\n   *    const A = [[1, 2], [5, 6]]\n   *    const B = [[3, 4], [7, 8]]\n   *\n   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]\n   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]\n   *    math.concat('hello', ' ', 'world') // returns 'hello world'\n   *\n   * See also:\n   *\n   *    size, squeeze, subset, transpose\n   *\n   * @param {... Array | Matrix} args     Two or more matrices\n   * @return {Array | Matrix} Concatenated matrix\n   */\n  return typed(name, {\n    // TODO: change signature to '...Array | Matrix, dim?' when supported\n    '...Array | Matrix | number | BigNumber': function (args) {\n      let i\n      const len = args.length\n      let dim = -1 // zero-based dimension\n      let prevDim\n      let asMatrix = false\n      const matrices = [] // contains multi dimensional arrays\n\n      for (i = 0; i < len; i++) {\n        const arg = args[i]\n\n        // test whether we need to return a Matrix (if not we return an Array)\n        if (isMatrix(arg)) {\n          asMatrix = true\n        }\n\n        if (isNumber(arg) || isBigNumber(arg)) {\n          if (i !== len - 1) {\n            throw new Error('Dimension must be specified as last argument')\n          }\n\n          // last argument contains the dimension on which to concatenate\n          prevDim = dim\n          dim = arg.valueOf() // change BigNumber to number\n\n          if (!isInteger(dim)) {\n            throw new TypeError('Integer number expected for dimension')\n          }\n\n          if (dim < 0 || (i > 0 && dim > prevDim)) {\n            // TODO: would be more clear when throwing a DimensionError here\n            throw new IndexError(dim, prevDim + 1)\n          }\n        } else {\n          // this is a matrix or array\n          const m = clone(arg).valueOf()\n          const size = arraySize(m)\n          matrices[i] = m\n          prevDim = dim\n          dim = size.length - 1\n\n          // verify whether each of the matrices has the same number of dimensions\n          if (i > 0 && dim !== prevDim) {\n            throw new DimensionError(prevDim + 1, dim + 1)\n          }\n        }\n      }\n\n      if (matrices.length === 0) {\n        throw new SyntaxError('At least one matrix expected')\n      }\n\n      let res = matrices.shift()\n      while (matrices.length) {\n        res = _concat(res, matrices.shift(), dim)\n      }\n\n      return asMatrix ? matrix(res) : res\n    },\n\n    '...string': function (args) {\n      return args.join('')\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { validateIndex } from '../../utils/array.js'\n\nconst name = 'column'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\nexport const createColumn = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  /**\n   * Return a column from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.column(value, index)\n   *\n   * Example:\n   *\n   *     // get a column\n   *     const d = [[1, 2], [3, 4]]\n   *     math.column(d, 1) // returns [[2], [4]]\n   *\n   * See also:\n   *\n   *     row\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} column           The index of the column\n   * @return {Array | Matrix}         The retrieved column\n   */\n  return typed(name, {\n    'Matrix, number': _column,\n\n    'Array, number': function (value, column) {\n      return _column(matrix(clone(value)), column).valueOf()\n    }\n  })\n\n  /**\n   * Retrieve a column of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} column  The index of the column\n   * @return {Matrix}        The retrieved column\n   */\n  function _column (value, column) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n\n    validateIndex(column, value.size()[1])\n\n    const rowRange = range(0, value.size()[0])\n    const index = new Index(rowRange, column)\n    const result = value.subset(index)\n    return isMatrix(result)\n      ? result\n      : matrix([[result]])\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'count'\nconst dependencies = ['typed', 'size', 'prod']\n\nexport const createCount = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, prod }) => {\n  /**\n   * Count the number of elements of a matrix, array or string.\n   *\n   * Syntax:\n   *\n   *     math.count(x)\n   *\n   * Examples:\n   *\n   *     math.count('hello world')        // returns 11\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.count(A)                    // returns 6\n   *     math.count(math.range(1,6))      // returns 5\n   *\n   * See also:\n   *\n   *     size\n   *\n   * @param {string | Array | Matrix} x  A matrix or string\n   * @return {number} An integer with the elements in `x`.\n   */\n  return typed(name, {\n    string: function (x) {\n      return x.length\n    },\n\n    'Matrix | Array': function (x) {\n      return prod(size(x))\n    }\n  })\n})\n","import { arraySize, squeeze } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'cross'\nconst dependencies = ['typed', 'matrix', 'subtract', 'multiply']\n\nexport const createCross = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, multiply }) => {\n  /**\n   * Calculate the cross product for two vectors in three dimensional space.\n   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined\n   * as:\n   *\n   *    cross(A, B) = [\n   *      a2 * b3 - a3 * b2,\n   *      a3 * b1 - a1 * b3,\n   *      a1 * b2 - a2 * b1\n   *    ]\n   *\n   * If one of the input vectors has a dimension greater than 1, the output\n   * vector will be a 1x3 (2-dimensional) matrix.\n   *\n   * Syntax:\n   *\n   *    math.cross(x, y)\n   *\n   * Examples:\n   *\n   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]\n   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]\n   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]\n   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]\n   *\n   * See also:\n   *\n   *    dot, multiply\n   *\n   * @param  {Array | Matrix} x   First vector\n   * @param  {Array | Matrix} y   Second vector\n   * @return {Array | Matrix}     Returns the cross product of `x` and `y`\n   */\n  return typed(name, {\n    'Matrix, Matrix': function (x, y) {\n      return matrix(_cross(x.toArray(), y.toArray()))\n    },\n\n    'Matrix, Array': function (x, y) {\n      return matrix(_cross(x.toArray(), y))\n    },\n\n    'Array, Matrix': function (x, y) {\n      return matrix(_cross(x, y.toArray()))\n    },\n\n    'Array, Array': _cross\n  })\n\n  /**\n   * Calculate the cross product for two arrays\n   * @param {Array} x  First vector\n   * @param {Array} y  Second vector\n   * @returns {Array} Returns the cross product of x and y\n   * @private\n   */\n  function _cross (x, y) {\n    const highestDimension = Math.max(arraySize(x).length, arraySize(y).length)\n\n    x = squeeze(x)\n    y = squeeze(y)\n\n    const xSize = arraySize(x)\n    const ySize = arraySize(y)\n\n    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {\n      throw new RangeError('Vectors with length 3 expected ' +\n      '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])')\n    }\n\n    const product = [\n      subtract(multiply(x[1], y[2]), multiply(x[2], y[1])),\n      subtract(multiply(x[2], y[0]), multiply(x[0], y[2])),\n      subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))\n    ]\n\n    if (highestDimension > 1) {\n      return [product]\n    } else {\n      return product\n    }\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'diag'\nconst dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix']\n\nexport const createDiag = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, DenseMatrix, SparseMatrix }) => {\n  /**\n   * Create a diagonal matrix or retrieve the diagonal of a matrix\n   *\n   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.\n   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.\n   * When k is positive, the values are placed on the super diagonal.\n   * When k is negative, the values are placed on the sub diagonal.\n   *\n   * Syntax:\n   *\n   *     math.diag(X)\n   *     math.diag(X, format)\n   *     math.diag(X, k)\n   *     math.diag(X, k, format)\n   *\n   * Examples:\n   *\n   *     // create a diagonal matrix\n   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]\n   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]\n   *\n   *    // retrieve the diagonal from a matrix\n   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]\n   *    math.diag(a)   // returns [1, 5, 9]\n   *\n   * See also:\n   *\n   *     ones, zeros, identity\n   *\n   * @param {Matrix | Array} x          A two dimensional matrix or a vector\n   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled\n   *                                    in or retrieved.\n   * @param {string} [format='dense']   The matrix storage format.\n   *\n   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.\n   */\n  return typed(name, {\n    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments\n\n    Array: function (x) {\n      return _diag(x, 0, arraySize(x), null)\n    },\n\n    'Array, number': function (x, k) {\n      return _diag(x, k, arraySize(x), null)\n    },\n\n    'Array, BigNumber': function (x, k) {\n      return _diag(x, k.toNumber(), arraySize(x), null)\n    },\n\n    'Array, string': function (x, format) {\n      return _diag(x, 0, arraySize(x), format)\n    },\n\n    'Array, number, string': function (x, k, format) {\n      return _diag(x, k, arraySize(x), format)\n    },\n\n    'Array, BigNumber, string': function (x, k, format) {\n      return _diag(x, k.toNumber(), arraySize(x), format)\n    },\n\n    Matrix: function (x) {\n      return _diag(x, 0, x.size(), x.storage())\n    },\n\n    'Matrix, number': function (x, k) {\n      return _diag(x, k, x.size(), x.storage())\n    },\n\n    'Matrix, BigNumber': function (x, k) {\n      return _diag(x, k.toNumber(), x.size(), x.storage())\n    },\n\n    'Matrix, string': function (x, format) {\n      return _diag(x, 0, x.size(), format)\n    },\n\n    'Matrix, number, string': function (x, k, format) {\n      return _diag(x, k, x.size(), format)\n    },\n\n    'Matrix, BigNumber, string': function (x, k, format) {\n      return _diag(x, k.toNumber(), x.size(), format)\n    }\n  })\n\n  /**\n   * Creeate diagonal matrix from a vector or vice versa\n   * @param {Array | Matrix} x\n   * @param {number} k\n   * @param {string} format Storage format for matrix. If null,\n   *                          an Array is returned\n   * @returns {Array | Matrix}\n   * @private\n   */\n  function _diag (x, k, size, format) {\n    if (!isInteger(k)) {\n      throw new TypeError('Second parameter in function diag must be an integer')\n    }\n\n    const kSuper = k > 0 ? k : 0\n    const kSub = k < 0 ? -k : 0\n\n    // check dimensions\n    switch (size.length) {\n      case 1:\n        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper)\n      case 2:\n        return _getDiagonal(x, k, format, size, kSub, kSuper)\n    }\n    throw new RangeError('Matrix for function diag must be 2 dimensional')\n  }\n\n  function _createDiagonalMatrix (x, k, format, l, kSub, kSuper) {\n    // matrix size\n    const ms = [l + kSub, l + kSuper]\n\n    if (format && format !== 'sparse' && format !== 'dense') {\n      throw new TypeError(`Unknown matrix type ${format}\"`)\n    }\n\n    // create diagonal matrix\n    const m = format === 'sparse'\n      ? SparseMatrix.diagonal(ms, x, k)\n      : DenseMatrix.diagonal(ms, x, k)\n    // check we need to return a matrix\n    return format !== null ? m : m.valueOf()\n  }\n\n  function _getDiagonal (x, k, format, s, kSub, kSuper) {\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // get diagonal matrix\n      const dm = x.diagonal(k)\n      // check we need to return a matrix\n      if (format !== null) {\n        // check we need to change matrix format\n        if (format !== dm.storage()) { return matrix(dm, format) }\n        return dm\n      }\n      return dm.valueOf()\n    }\n    // vector size\n    const n = Math.min(s[0] - kSub, s[1] - kSuper)\n    // diagonal values\n    const vector = []\n    // loop diagonal\n    for (let i = 0; i < n; i++) {\n      vector[i] = x[i + kSub][i + kSuper]\n    }\n    // check we need to return a matrix\n    return format !== null ? matrix(vector) : vector\n  }\n})\n","import { optimizeCallback } from '../../utils/optimizeCallback.js'\nimport { filter, filterRegExp } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'filter'\nconst dependencies = ['typed']\n\nexport const createFilter = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Filter the items in an array or one dimensional matrix.\n   *\n   * The callback is invoked with three arguments: the current value,\n   * the current index, and the matrix operated upon.\n   * Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\n   *\n   * Syntax:\n   *\n   *    math.filter(x, test)\n   *\n   * Examples:\n   *\n   *    function isPositive (x) {\n   *      return x > 0\n   *    }\n   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]\n   *\n   *    math.filter([\"23\", \"foo\", \"100\", \"55\", \"bar\"], /[0-9]+/) // returns [\"23\", \"100\", \"55\"]\n   *\n   * See also:\n   *\n   *    forEach, map, sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to filter\n   * @param {Function | RegExp} test\n   *        A function or regular expression to test items.\n   *        All entries for which `test` returns true are returned.\n   *        When `test` is a function, it is invoked with three parameters:\n   *        the value of the element, the index of the element, and the\n   *        matrix/array being traversed. The function must return a boolean.\n   * @return {Matrix | Array} Returns the filtered matrix.\n   */\n  return typed('filter', {\n    'Array, function': _filterCallback,\n\n    'Matrix, function': function (x, test) {\n      return x.create(_filterCallback(x.valueOf(), test), x.datatype())\n    },\n\n    'Array, RegExp': filterRegExp,\n\n    'Matrix, RegExp': function (x, test) {\n      return x.create(filterRegExp(x.valueOf(), test), x.datatype())\n    }\n  })\n})\n\n/**\n * Filter values in a callback given a callback function\n * @param {Array} x\n * @param {Function} callback\n * @return {Array} Returns the filtered array\n * @private\n */\nfunction _filterCallback (x, callback) {\n  const fastCallback = optimizeCallback(callback, x, 'filter')\n  if (fastCallback.isUnary) {\n    return filter(x, fastCallback.fn)\n  }\n  return filter(x, function (value, index, array) {\n    // invoke the callback function with the right number of arguments\n    return fastCallback.fn(value, [index], array)\n  })\n}\n","import { flatten as flattenArray } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'flatten'\nconst dependencies = ['typed']\n\nexport const createFlatten = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Flatten a multidimensional matrix into a single dimensional matrix.\n   * A new matrix is returned, the original matrix is left untouched.\n   *\n   * Syntax:\n   *\n   *    math.flatten(x)\n   *\n   * Examples:\n   *\n   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]\n   *\n   * See also:\n   *\n   *    concat, resize, size, squeeze\n   *\n   * @param {Matrix | Array} x   Matrix to be flattened\n   * @return {Matrix | Array} Returns the flattened matrix\n   */\n  return typed(name, {\n    Array: function (x) {\n      return flattenArray(x)\n    },\n\n    Matrix: function (x) {\n      // Return the same matrix type as x (Dense or Sparse Matrix)\n      // Return the same data type as x\n      return x.create(flattenArray(x.valueOf(), true), x.datatype())\n    }\n  })\n})\n","import { optimizeCallback } from '../../utils/optimizeCallback.js'\nimport { factory } from '../../utils/factory.js'\nimport { deepForEach } from '../../utils/array.js'\n\nconst name = 'forEach'\nconst dependencies = ['typed']\n\nexport const createForEach = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Iterate over all elements of a matrix/array, and executes the given callback function.\n   *\n   * The callback is invoked with three arguments: the current value,\n   * the current index, and the matrix operated upon.\n   * Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\n   *\n   * Syntax:\n   *\n   *    math.forEach(x, callback)\n   *\n   * Examples:\n   *\n   *    math.forEach([1, 2, 3], function(value) {\n   *      console.log(value)\n   *    })\n   *    // outputs 1, 2, 3\n   *\n   * See also:\n   *\n   *    filter, map, sort\n   *\n   * @param {Matrix | Array} x    The matrix to iterate on.\n   * @param {Function} callback   The callback function is invoked with three\n   *                              parameters: the value of the element, the index\n   *                              of the element, and the Matrix/array being traversed.\n   */\n  return typed(name, {\n    'Array, function': _forEach,\n\n    'Matrix, function': function (x, callback) {\n      x.forEach(callback)\n    }\n  })\n})\n\n/**\n * forEach for a multidimensional array\n * @param {Array} array\n * @param {Function} callback\n * @private\n */\nfunction _forEach (array, callback) {\n  const fastCallback = optimizeCallback(callback, array, name)\n  deepForEach(array, fastCallback.fn, fastCallback.isUnary)\n}\n","import { factory } from '../../utils/factory.js'\nimport { getArrayDataType } from '../../utils/array.js'\nimport { typeOf } from '../../utils/is.js'\n\nconst name = 'getMatrixDataType'\nconst dependencies = ['typed']\n\nexport const createGetMatrixDataType = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Find the data type of all elements in a matrix or array,\n   * for example 'number' if all items are a number and 'Complex' if all values\n   * are complex numbers.\n   * If a matrix contains more than one data type, it will return 'mixed'.\n   *\n   * Syntax:\n   *\n   *    math.getMatrixDataType(x)\n   *\n   * Examples:\n   *\n   *    const x = [ [1, 2, 3], [4, 5, 6] ]\n   *    const mixedX = [ [1, true], [2, 3] ]\n   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3)] ]\n   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]\n   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]\n   *    const sparse = math.sparse(x)\n   *    const dense = math.matrix(x)\n   *    math.getMatrixDataType(x)   // returns 'number'\n   *    math.getMatrixDataType(sparse)   // returns 'number'\n   *    math.getMatrixDataType(dense)   // returns 'number'\n   *    math.getMatrixDataType(mixedX) // returns 'mixed'\n   *    math.getMatrixDataType(fractionX) // returns 'Fraction'\n   *    math.getMatrixDataType(unitX) // returns 'Unit'\n   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'\n   *\n   * See also:\n   *  SparseMatrix, DenseMatrix\n   *\n   * @param {...Matrix | Array} x   The Matrix with values.\n   *\n   * @return {string} A string representation of the matrix type\n   */\n  return typed(name, {\n    Array: function (x) {\n      return getArrayDataType(x, typeOf)\n    },\n    Matrix: function (x) {\n      return x.getDataType()\n    }\n  })\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { resize } from '../../utils/array.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'identity'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'BigNumber',\n  'DenseMatrix',\n  'SparseMatrix'\n]\n\nexport const createIdentity = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber, DenseMatrix, SparseMatrix }) => {\n  /**\n   * Create a 2-dimensional identity matrix with size m x n or n x n.\n   * The matrix has ones on the diagonal and zeros elsewhere.\n   *\n   * Syntax:\n   *\n   *    math.identity(n)\n   *    math.identity(n, format)\n   *    math.identity(m, n)\n   *    math.identity(m, n, format)\n   *    math.identity([m, n])\n   *    math.identity([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]\n   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]\n   *\n   * See also:\n   *\n   *    diag, ones, zeros, size, range\n   *\n   * @param {...number | Matrix | Array} size   The size for the matrix\n   * @param {string} [format]                   The Matrix storage format\n   *\n   * @return {Matrix | Array | number} A matrix with ones on the diagonal.\n   */\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Matrix') ? matrix([]) : []\n    },\n\n    string: function (format) {\n      return matrix(format)\n    },\n\n    'number | BigNumber': function (rows) {\n      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber, string': function (rows, format) {\n      return _identity(rows, rows, format)\n    },\n\n    'number | BigNumber, number | BigNumber': function (rows, cols) {\n      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber, number | BigNumber, string': function (rows, cols, format) {\n      return _identity(rows, cols, format)\n    },\n\n    Array: function (size) {\n      return _identityVector(size)\n    },\n\n    'Array, string': function (size, format) {\n      return _identityVector(size, format)\n    },\n\n    Matrix: function (size) {\n      return _identityVector(size.valueOf(), size.storage())\n    },\n\n    'Matrix, string': function (size, format) {\n      return _identityVector(size.valueOf(), format)\n    }\n  })\n\n  function _identityVector (size, format) {\n    switch (size.length) {\n      case 0: return format ? matrix(format) : []\n      case 1: return _identity(size[0], size[0], format)\n      case 2: return _identity(size[0], size[1], format)\n      default: throw new Error('Vector containing two values expected')\n    }\n  }\n\n  /**\n   * Create an identity matrix\n   * @param {number | BigNumber} rows\n   * @param {number | BigNumber} cols\n   * @param {string} [format]\n   * @returns {Matrix}\n   * @private\n   */\n  function _identity (rows, cols, format) {\n    // BigNumber constructor with the right precision\n    const Big = (isBigNumber(rows) || isBigNumber(cols))\n      ? BigNumber\n      : null\n\n    if (isBigNumber(rows)) rows = rows.toNumber()\n    if (isBigNumber(cols)) cols = cols.toNumber()\n\n    if (!isInteger(rows) || rows < 1) {\n      throw new Error('Parameters in function identity must be positive integers')\n    }\n    if (!isInteger(cols) || cols < 1) {\n      throw new Error('Parameters in function identity must be positive integers')\n    }\n\n    const one = Big ? new BigNumber(1) : 1\n    const defaultValue = Big ? new Big(0) : 0\n    const size = [rows, cols]\n\n    // check we need to return a matrix\n    if (format) {\n      // create diagonal matrix (use optimized implementation for storage format)\n      if (format === 'sparse') {\n        return SparseMatrix.diagonal(size, one, 0, defaultValue)\n      }\n      if (format === 'dense') {\n        return DenseMatrix.diagonal(size, one, 0, defaultValue)\n      }\n      throw new TypeError(`Unknown matrix type \"${format}\"`)\n    }\n\n    // create and resize array\n    const res = resize([], size, defaultValue)\n    // fill in ones on the diagonal\n    const minimum = rows < cols ? rows : cols\n    // fill diagonal\n    for (let d = 0; d < minimum; d++) {\n      res[d][d] = one\n    }\n    return res\n  }\n})\n","import { arraySize as size } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'kron'\nconst dependencies = ['typed', 'matrix', 'multiplyScalar']\n\nexport const createKron = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, multiplyScalar }) => {\n  /**\n     * Calculates the Kronecker product of 2 matrices or vectors.\n     *\n     * NOTE: If a one dimensional vector / matrix is given, it will be\n     * wrapped so its two dimensions.\n     * See the examples.\n     *\n     * Syntax:\n     *\n     *    math.kron(x, y)\n     *\n     * Examples:\n     *\n     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])\n     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]\n     *\n     *    math.kron([1,1], [2,3,4])\n     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]\n     *\n     * See also:\n     *\n     *    multiply, dot, cross\n     *\n     * @param  {Array | Matrix} x     First vector\n     * @param  {Array | Matrix} y     Second vector\n     * @return {Array | Matrix}       Returns the Kronecker product of `x` and `y`\n     */\n  return typed(name, {\n    'Matrix, Matrix': function (x, y) {\n      return matrix(_kron(x.toArray(), y.toArray()))\n    },\n\n    'Matrix, Array': function (x, y) {\n      return matrix(_kron(x.toArray(), y))\n    },\n\n    'Array, Matrix': function (x, y) {\n      return matrix(_kron(x, y.toArray()))\n    },\n\n    'Array, Array': _kron\n  })\n\n  /**\n     * Calculate the Kronecker product of two matrices / vectors\n     * @param {Array} a  First vector\n     * @param {Array} b  Second vector\n     * @returns {Array} Returns the Kronecker product of x and y\n     * @private\n     */\n  function _kron (a, b) {\n    // Deal with the dimensions of the matricies.\n    if (size(a).length === 1) {\n      // Wrap it in a 2D Matrix\n      a = [a]\n    }\n    if (size(b).length === 1) {\n      // Wrap it in a 2D Matrix\n      b = [b]\n    }\n    if (size(a).length > 2 || size(b).length > 2) {\n      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' +\n            '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')')\n    }\n    const t = []\n    let r = []\n\n    return a.map(function (a) {\n      return b.map(function (b) {\n        r = []\n        t.push(r)\n        return a.map(function (y) {\n          return b.map(function (x) {\n            return r.push(multiplyScalar(y, x))\n          })\n        })\n      })\n    }) && t\n  }\n})\n","import { optimizeCallback } from '../../utils/optimizeCallback.js'\nimport { arraySize, broadcastSizes, broadcastTo, get, deepMap } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'map'\nconst dependencies = ['typed']\n\nexport const createMap = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Create a new matrix or array with the results of a callback function executed on\n   * each entry of a given matrix/array.\n   *\n   * For each entry of the input,\n   *\n   * the callback is invoked with 2N + 1 arguments:\n   * the N values of the entry, the index at which that entry occurs, and the N full\n   * broadcasted matrix/array being traversed where N is the number of matrices being traversed.\n   * Note that because the matrix/array might be\n   * multidimensional, the \"index\" argument is always an array of numbers giving\n   * the index in each dimension. This is true even for vectors: the \"index\"\n   * argument is an array of length 1, rather than simply a number.\n   *\n   * Syntax:\n   *\n   *    math.map(x, callback)\n   *    math.map(x, y, ..., callback)\n   *\n   * Examples:\n   *\n   *    math.map([1, 2, 3], function(value) {\n   *      return value * value\n   *    })  // returns [1, 4, 9]\n   *    math.map([1, 2], [3, 4], function(a, b) {\n   *     return a + b\n   *    })  // returns [4, 6]\n   *\n   *    // The callback is normally called with three arguments:\n   *    //    callback(value, index, Array)\n   *    // If you want to call with only one argument, use:\n   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']\n   *    // It can also be called with 2N + 1 arguments: for N arrays\n   *    //    callback(value1, value2, index, BroadcastedArray1, BroadcastedArray2)\n   *\n   * See also:\n   *\n   *    filter, forEach, sort\n   *\n   * @param {Matrix | Array} x    The input to iterate on.\n   * @param {Function} callback\n   *     The function to call (as described above) on each entry of the input\n   * @return {Matrix | array}\n   *     Transformed map of x; always has the same type and shape as x\n   */\n  return typed(name, {\n    'Array, function': _mapArray,\n\n    'Matrix, function': function (x, callback) {\n      return x.map(callback)\n    },\n\n    'Array|Matrix, Array|Matrix, ...Array|Matrix|function': (A, B, rest) =>\n      _mapMultiple([A, B, ...rest.slice(0, rest.length - 1)], rest[rest.length - 1])\n  })\n\n  /**\n * Maps over multiple arrays or matrices.\n *\n * @param {Array<Array|Matrix>} Arrays - An array of arrays or matrices to map over.\n * @param {function} multiCallback - The callback function to apply to each element.\n * @throws {Error} If the last argument is not a callback function.\n * @returns {Array|Matrix} A new array or matrix with each element being the result of the callback function.\n *\n * @example\n * _mapMultiple([[1, 2, 3], [4, 5, 6]], (a, b) => a + b); // Returns [5, 7, 9]\n */\n  function _mapMultiple (Arrays, multiCallback) {\n    if (typeof multiCallback !== 'function') {\n      throw new Error('Last argument must be a callback function')\n    }\n\n    const firstArrayIsMatrix = Arrays[0].isMatrix\n    const sizes = Arrays.map(M => M.isMatrix ? M.size() : arraySize(M))\n    const newSize = broadcastSizes(...sizes)\n    const numberOfArrays = Arrays.length\n\n    const _get = firstArrayIsMatrix\n      ? (matrix, idx) => matrix.get(idx)\n      : get\n\n    const firstValues = Arrays.map((collection, i) => {\n      const firstIndex = sizes[i].map(() => 0)\n      return collection.isMatrix ? collection.get(firstIndex) : get(collection, firstIndex)\n    }\n    )\n\n    const callbackArgCount = typed.isTypedFunction(multiCallback)\n      ? _getTypedCallbackArgCount(multiCallback, firstValues, newSize.map(() => 0), Arrays)\n      : _getCallbackArgCount(multiCallback, numberOfArrays)\n\n    if (callbackArgCount < 2) {\n      const callback = _getLimitedCallback(callbackArgCount, multiCallback, null)\n      return mapMultiple(Arrays, callback)\n    }\n\n    const broadcastedArrays = firstArrayIsMatrix\n      ? Arrays.map(M => M.isMatrix\n        ? M.create(broadcastTo(M.toArray(), newSize), M.datatype())\n        : Arrays[0].create(broadcastTo(M.valueOf(), newSize)))\n      : Arrays.map(M => M.isMatrix\n        ? broadcastTo(M.toArray(), newSize)\n        : broadcastTo(M, newSize))\n\n    const callback = _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays)\n\n    const broadcastedArraysCallback = (x, idx) =>\n      callback(\n        [x, ...broadcastedArrays.slice(1).map(array => _get(array, idx))],\n        idx)\n\n    if (firstArrayIsMatrix) {\n      return broadcastedArrays[0].map(broadcastedArraysCallback)\n    } else {\n      return _mapArray(broadcastedArrays[0], broadcastedArraysCallback)\n    }\n  }\n\n  function mapMultiple (collections, callback) {\n    // collections can be matrices or arrays\n    // callback must be a function of the form (collections, [index])\n    const firstCollection = collections[0]\n    const arrays = collections.map((collection) =>\n      collection.isMatrix ? collection.valueOf() : collection\n    )\n    const sizes = collections.map((collection) =>\n      collection.isMatrix ? collection.size() : arraySize(collection)\n    )\n    const finalSize = broadcastSizes(...sizes)\n    // the offset means for each initial array, how much smaller is it than the final size\n    const offsets = sizes.map((size) => finalSize.length - size.length)\n    const maxDepth = finalSize.length - 1\n    const callbackUsesIndex = callback.length > 1\n    const index = callbackUsesIndex ? [] : null\n    const resultsArray = iterate(arrays, 0)\n    if (firstCollection.isMatrix) {\n      const resultsMatrix = firstCollection.create()\n      resultsMatrix._data = resultsArray\n      resultsMatrix._size = finalSize\n      return resultsMatrix\n    } else {\n      return resultsArray\n    }\n\n    function iterate (arrays, depth = 0) {\n      // each array can have different sizes\n      const currentDimensionSize = finalSize[depth]\n      const result = Array(currentDimensionSize)\n      if (depth < maxDepth) {\n        for (let i = 0; i < currentDimensionSize; i++) {\n          if (index) index[depth] = i\n          // if there is an offset greater than the current dimension\n          // pass the array, if the size of the array is 1 pass the first\n          // element of the array\n          result[i] = iterate(\n            arrays.map((array, arrayIndex) =>\n              offsets[arrayIndex] > depth\n                ? array\n                : array.length === 1\n                  ? array[0]\n                  : array[i]\n            ),\n            depth + 1\n          )\n        }\n      } else {\n        for (let i = 0; i < currentDimensionSize; i++) {\n          if (index) index[depth] = i\n          result[i] = callback(\n            arrays.map((a) => (a.length === 1 ? a[0] : a[i])),\n            index ? index.slice() : undefined\n          )\n        }\n      }\n      return result\n    }\n  }\n\n  /**\n    * Creates a limited callback based on the argument pattern.\n    * @param {number} callbackArgCount - The argument pattern (0, 1, or 2)\n    * @param {Function} multiCallback - The original callback function\n    * @param {Array} broadcastedArrays - The broadcasted arrays (for case 2)\n    * @returns {Function} The limited callback function\n    */\n  function _getLimitedCallback (callbackArgCount, multiCallback, broadcastedArrays) {\n    switch (callbackArgCount) {\n      case 0:\n        return x => multiCallback(...x)\n      case 1:\n        return (x, idx) => multiCallback(...x, idx)\n      case 2:\n        return (x, idx) => multiCallback(...x, idx, ...broadcastedArrays)\n    }\n  }\n\n  /**\n     * Determines the argument pattern of a regular callback function.\n     * @param {Function} callback - The callback function to analyze\n     * @param {number} numberOfArrays - Number of arrays being processed\n     * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n     */\n  function _getCallbackArgCount (callback, numberOfArrays) {\n    const callbackStr = callback.toString()\n    // Check if the callback function uses `arguments`\n    if (/arguments/.test(callbackStr)) return 2\n\n    // Extract the parameters of the callback function\n    const paramsStr = callbackStr.match(/\\(.*?\\)/)\n    // Check if the callback function uses rest parameters\n    if (/\\.\\.\\./.test(paramsStr)) return 2\n    if (callback.length > numberOfArrays + 1) { return 2 }\n    if (callback.length === numberOfArrays + 1) { return 1 }\n    return 0\n  }\n\n  /**\n * Determines the argument pattern of a typed callback function.\n * @param {Function} callback - The typed callback function to analyze\n * @param {Array} values - Sample values for signature resolution\n * @param {Array} idx - Sample index for signature resolution\n * @param {Array} arrays - Sample arrays for signature resolution\n * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays\n */\n\n  function _getTypedCallbackArgCount (callback, values, idx, arrays) {\n    if (typed.resolve(callback, [...values, idx, ...arrays]) !== null) { return 2 }\n    if (typed.resolve(callback, [...values, idx]) !== null) { return 1 }\n    if (typed.resolve(callback, values) !== null) { return 0 }\n    // this should never happen\n    return 0\n  }\n  /**\n * Map for a multi dimensional array\n * @param {Array} array\n * @param {Function} callback\n * @return {Array}\n * @private\n */\n  function _mapArray (array, callback) {\n    const fastCallback = optimizeCallback(callback, array, name)\n    return deepMap(array, fastCallback.fn, fastCallback.isUnary)\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'diff'\nconst dependencies = ['typed', 'matrix', 'subtract', 'number']\n\nexport const createDiff = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, number }) => {\n  /**\n   * Create a new matrix or array of the difference between elements of the given array\n   * The optional dim parameter lets you specify the dimension to evaluate the difference of\n   * If no dimension parameter is passed it is assumed as dimension 0\n   *\n   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber\n   * Arrays must be 'rectangular' meaning arrays like [1, 2]\n   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays\n   *\n   * Syntax:\n   *\n   *     math.diff(arr)\n   *     math.diff(arr, dim)\n   *\n   * Examples:\n   *\n   *     const arr = [1, 2, 4, 7, 0]\n   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)\n   *     math.diff(math.matrix(arr)) // returns Matrix [1, 2, 3, -7]\n   *\n   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]\n   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]\n   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]\n   *\n   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3\n   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed\n   *\n   *     // These will all produce the same result\n   *     math.diff([[1, 2], [3, 4]])\n   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])\n   *     math.diff([[1, 2], math.matrix([3, 4])])\n   *     math.diff([math.matrix([1, 2]), [3, 4]])\n   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix\n   *\n   * See Also:\n   *\n   *      sum\n   *      subtract\n   *      partitionSelect\n   *\n   * @param {Array | Matrix} arr      An array or matrix\n   * @param {number | BigNumber} dim  Dimension\n   * @return {Array | Matrix}         Difference between array elements in given dimension\n   */\n  return typed(name, {\n    'Array | Matrix': function (arr) { // No dimension specified => assume dimension 0\n      if (isMatrix(arr)) {\n        return matrix(_diff(arr.toArray()))\n      } else {\n        return _diff(arr)\n      }\n    },\n    'Array | Matrix, number': function (arr, dim) {\n      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number')\n      if (isMatrix(arr)) {\n        return matrix(_recursive(arr.toArray(), dim))\n      } else {\n        return _recursive(arr, dim)\n      }\n    },\n    'Array, BigNumber': typed.referTo('Array,number', selfAn =>\n      (arr, dim) => selfAn(arr, number(dim))),\n    'Matrix, BigNumber': typed.referTo('Matrix,number', selfMn =>\n      (arr, dim) => selfMn(arr, number(dim)))\n  })\n\n  /**\n   * Recursively find the correct dimension in the array/matrix\n   * Then Apply _diff to that dimension\n   *\n   * @param {Array} arr      The array\n   * @param {number} dim     Dimension\n   * @return {Array}         resulting array\n   */\n  function _recursive (arr, dim) {\n    if (isMatrix(arr)) {\n      arr = arr.toArray() // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly\n    }\n    if (!Array.isArray(arr)) {\n      throw RangeError('Array/Matrix does not have that many dimensions')\n    }\n    if (dim > 0) {\n      const result = []\n      arr.forEach(element => {\n        result.push(_recursive(element, dim - 1))\n      })\n      return result\n    } else if (dim === 0) {\n      return _diff(arr)\n    } else {\n      throw RangeError('Cannot have negative dimension')\n    }\n  }\n\n  /**\n   * Difference between elements in the array\n   *\n   * @param {Array} arr      An array\n   * @return {Array}         resulting array\n   */\n  function _diff (arr) {\n    const result = []\n    const size = arr.length\n    for (let i = 1; i < size; i++) {\n      result.push(_ElementDiff(arr[i - 1], arr[i]))\n    }\n    return result\n  }\n\n  /**\n   * Difference between 2 objects\n   *\n   * @param {Object} obj1    First object\n   * @param {Object} obj2    Second object\n   * @return {Array}         resulting array\n   */\n  function _ElementDiff (obj1, obj2) {\n    // Convert matrices to arrays\n    if (isMatrix(obj1)) obj1 = obj1.toArray()\n    if (isMatrix(obj2)) obj2 = obj2.toArray()\n\n    const obj1IsArray = Array.isArray(obj1)\n    const obj2IsArray = Array.isArray(obj2)\n    if (obj1IsArray && obj2IsArray) {\n      return _ArrayDiff(obj1, obj2)\n    }\n    if (!obj1IsArray && !obj2IsArray) {\n      return subtract(obj2, obj1) // Difference is (second - first) NOT (first - second)\n    }\n    throw TypeError('Cannot calculate difference between 1 array and 1 non-array')\n  }\n\n  /**\n   * Difference of elements in 2 arrays\n   *\n   * @param {Array} arr1     Array 1\n   * @param {Array} arr2     Array 2\n   * @return {Array}         resulting array\n   */\n  function _ArrayDiff (arr1, arr2) {\n    if (arr1.length !== arr2.length) {\n      throw RangeError('Not all sub-arrays have the same length')\n    }\n    const result = []\n    const size = arr1.length\n    for (let i = 0; i < size; i++) {\n      result.push(_ElementDiff(arr1[i], arr2[i]))\n    }\n    return result\n  }\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { resize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ones'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createOnes = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Create a matrix filled with ones. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.ones(m)\n   *    math.ones(m, format)\n   *    math.ones(m, n)\n   *    math.ones(m, n, format)\n   *    math.ones([m, n])\n   *    math.ones([m, n], format)\n   *    math.ones([m, n, p, ...])\n   *    math.ones([m, n, p, ...], format)\n   *\n   * Examples:\n   *\n   *    math.ones()                    // returns []\n   *    math.ones(3)                   // returns [1, 1, 1]\n   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]\n   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]\n   *\n   * See also:\n   *\n   *    zeros, identity, size, range\n   *\n   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix | number}  A matrix filled with ones\n   */\n  return typed('ones', {\n    '': function () {\n      return (config.matrix === 'Array')\n        ? _ones([])\n        : _ones([], 'default')\n    },\n\n    // math.ones(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function (size) {\n      const last = size[size.length - 1]\n      if (typeof last === 'string') {\n        const format = size.pop()\n        return _ones(size, format)\n      } else if (config.matrix === 'Array') {\n        return _ones(size)\n      } else {\n        return _ones(size, 'default')\n      }\n    },\n\n    Array: _ones,\n\n    Matrix: function (size) {\n      const format = size.storage()\n      return _ones(size.valueOf(), format)\n    },\n\n    'Array | Matrix, string': function (size, format) {\n      return _ones(size.valueOf(), format)\n    }\n  })\n\n  /**\n   * Create an Array or Matrix with ones\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n  function _ones (size, format) {\n    const hasBigNumbers = _normalize(size)\n    const defaultValue = hasBigNumbers ? new BigNumber(1) : 1\n    _validate(size)\n\n    if (format) {\n      // return a matrix\n      const m = matrix(format)\n      if (size.length > 0) {\n        return m.resize(size, defaultValue)\n      }\n      return m\n    } else {\n      // return an Array\n      const arr = []\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue)\n      }\n      return arr\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize (size) {\n    let hasBigNumbers = false\n    size.forEach(function (value, index, arr) {\n      if (isBigNumber(value)) {\n        hasBigNumbers = true\n        arr[index] = value.toNumber()\n      }\n    })\n    return hasBigNumbers\n  }\n\n  // validate arguments\n  function _validate (size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function ones must be positive integers')\n      }\n    })\n  }\n})\n","export function noBignumber () {\n  throw new Error('No \"bignumber\" implementation available')\n}\n\nexport function noFraction () {\n  throw new Error('No \"fraction\" implementation available')\n}\n\nexport function noMatrix () {\n  throw new Error('No \"matrix\" implementation available')\n}\n\nexport function noIndex () {\n  throw new Error('No \"index\" implementation available')\n}\n\nexport function noSubset () {\n  throw new Error('No \"matrix\" implementation available')\n}\n","import { factory } from '../../utils/factory.js'\nimport { noBignumber, noMatrix } from '../../utils/noop.js'\n\nconst name = 'range'\nconst dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive']\n\nexport const createRange = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, bignumber, smaller, smallerEq, larger, largerEq, add, isZero, isPositive }) => {\n  /**\n   * Create a matrix or array containing a range of values.\n   * By default, the range end is excluded. This can be customized by providing\n   * an extra parameter `includeEnd`.\n   *\n   * Syntax:\n   *\n   *     math.range(str [, includeEnd])               // Create a range from a string,\n   *                                                  // where the string contains the\n   *                                                  // start, optional step, and end,\n   *                                                  // separated by a colon.\n   *     math.range(start, end [, includeEnd])        // Create a range with start and\n   *                                                  // end and a step size of 1.\n   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,\n   *                                                  // and end.\n   *\n   * Where:\n   *\n   * - `str: string`\n   *   A string 'start:end' or 'start:step:end'\n   * - `start: {number | bigint | BigNumber | Fraction | Unit}`\n   *   Start of the range\n   * - `end: number | bigint | BigNumber | Fraction | Unit`\n   *   End of the range, excluded by default, included when parameter includeEnd=true\n   * - `step: number | bigint | BigNumber | Fraction | Unit`\n   *   Step size. Default value is 1.\n   * - `includeEnd: boolean`\n   *   Option to specify whether to include the end or not. False by default.\n   *\n   * The function returns a `DenseMatrix` when the library is configured with\n   * `config = { matrix: 'Matrix' }, and returns an Array otherwise.\n   * Note that the type of the returned values is taken from the type of the\n   * provided start/end value. If only one of these is a built-in `number` type,\n   * it will be promoted to the type of the other endpoint. However, in the case\n   * of Unit values, both endpoints must have compatible units, and the return\n   * value will have compatible units as well.\n   *\n   * Examples:\n   *\n   *     math.range(2, 6)        // [2, 3, 4, 5]\n   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]\n   *     math.range('2:1:6')     // [2, 3, 4, 5]\n   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]\n   *     math.range(2, math.fraction(8,3), math.fraction(1,3)) // [fraction(2), fraction(7,3)]\n   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]\n   *\n   * See also:\n   *\n   *     ones, zeros, size, subset\n   *\n   * @param {*} args   Parameters describing the range's `start`, `end`, and optional `step`.\n   * @return {Array | Matrix} range\n   */\n  return typed(name, {\n    // TODO: simplify signatures when typed-function supports default values and optional arguments\n\n    string: _strRange,\n    'string, boolean': _strRange,\n\n    number: function (oops) {\n      throw new TypeError(`Too few arguments to function range(): ${oops}`)\n    },\n\n    boolean: function (oops) {\n      throw new TypeError(`Unexpected type of argument 1 to function range(): ${oops}, number|bigint|BigNumber|Fraction`)\n    },\n\n    'number, number': function (start, end) {\n      return _out(_range(start, end, 1, false))\n    },\n    'number, number, number': function (start, end, step) {\n      return _out(_range(start, end, step, false))\n    },\n    'number, number, boolean': function (start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd))\n    },\n    'number, number, number, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd))\n    },\n\n    // Handle bigints; if either limit is bigint, range should be too\n    'bigint, bigint|number': function (start, end) {\n      return _out(_range(start, end, 1n, false))\n    },\n    'number, bigint': function (start, end) {\n      return _out(_range(BigInt(start), end, 1n, false))\n    },\n    'bigint, bigint|number, bigint|number': function (start, end, step) {\n      return _out(_range(start, end, BigInt(step), false))\n    },\n    'number, bigint, bigint|number': function (start, end, step) {\n      return _out(_range(BigInt(start), end, BigInt(step), false))\n    },\n    'bigint, bigint|number, boolean': function (start, end, includeEnd) {\n      return _out(_range(start, end, 1n, includeEnd))\n    },\n    'number, bigint, boolean': function (start, end, includeEnd) {\n      return _out(_range(BigInt(start), end, 1n, includeEnd))\n    },\n    'bigint, bigint|number, bigint|number, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(start, end, BigInt(step), includeEnd))\n    },\n    'number, bigint, bigint|number, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(BigInt(start), end, BigInt(step), includeEnd))\n    },\n\n    'BigNumber, BigNumber': function (start, end) {\n      const BigNumber = start.constructor\n\n      return _out(_range(start, end, new BigNumber(1), false))\n    },\n    'BigNumber, BigNumber, BigNumber': function (start, end, step) {\n      return _out(_range(start, end, step, false))\n    },\n    'BigNumber, BigNumber, boolean': function (start, end, includeEnd) {\n      const BigNumber = start.constructor\n\n      return _out(_range(start, end, new BigNumber(1), includeEnd))\n    },\n    'BigNumber, BigNumber, BigNumber, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd))\n    },\n\n    'Fraction, Fraction': function (start, end) {\n      return _out(_range(start, end, 1, false))\n    },\n    'Fraction, Fraction, Fraction': function (start, end, step) {\n      return _out(_range(start, end, step, false))\n    },\n    'Fraction, Fraction, boolean': function (start, end, includeEnd) {\n      return _out(_range(start, end, 1, includeEnd))\n    },\n    'Fraction, Fraction, Fraction, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd))\n    },\n\n    'Unit, Unit, Unit': function (start, end, step) {\n      return _out(_range(start, end, step, false))\n    },\n    'Unit, Unit, Unit, boolean': function (start, end, step, includeEnd) {\n      return _out(_range(start, end, step, includeEnd))\n    }\n\n  })\n\n  function _out (arr) {\n    if (config.matrix === 'Matrix') {\n      return matrix ? matrix(arr) : noMatrix()\n    }\n\n    return arr\n  }\n\n  function _strRange (str, includeEnd) {\n    const r = _parse(str)\n    if (!r) {\n      throw new SyntaxError('String \"' + str + '\" is no valid range')\n    }\n\n    if (config.number === 'BigNumber') {\n      if (bignumber === undefined) {\n        noBignumber()\n      }\n\n      return _out(_range(\n        bignumber(r.start),\n        bignumber(r.end),\n        bignumber(r.step)),\n      includeEnd)\n    } else {\n      return _out(_range(r.start, r.end, r.step, includeEnd))\n    }\n  }\n\n  /**\n   * Create a range with numbers or BigNumbers\n   * @param {number | BigNumber | Unit} start\n   * @param {number | BigNumber | Unit} end\n   * @param {number | BigNumber | Unit} step\n   * @param {boolean} includeEnd\n   * @returns {Array} range\n   * @private\n   */\n  function _range (start, end, step, includeEnd) {\n    const array = []\n    if (isZero(step)) throw new Error('Step must be non-zero')\n    const ongoing = isPositive(step)\n      ? includeEnd ? smallerEq : smaller\n      : includeEnd ? largerEq : larger\n    let x = start\n    while (ongoing(x, end)) {\n      array.push(x)\n      x = add(x, step)\n    }\n    return array\n  }\n\n  /**\n   * Parse a string into a range,\n   * The string contains the start, optional step, and end, separated by a colon.\n   * If the string does not contain a valid range, null is returned.\n   * For example str='0:2:11'.\n   * @param {string} str\n   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step\n   * @private\n   */\n  function _parse (str) {\n    const args = str.split(':')\n\n    // number\n    const nums = args.map(function (arg) {\n      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string\n      return Number(arg)\n    })\n\n    const invalid = nums.some(function (num) {\n      return isNaN(num)\n    })\n    if (invalid) {\n      return null\n    }\n\n    switch (nums.length) {\n      case 2:\n        return {\n          start: nums[0],\n          end: nums[1],\n          step: 1\n        }\n\n      case 3:\n        return {\n          start: nums[0],\n          end: nums[2],\n          step: nums[1]\n        }\n\n      default:\n        return null\n    }\n  }\n})\n","import { reshape as arrayReshape } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'reshape'\nconst dependencies = ['typed', 'isInteger', 'matrix']\n\nexport const createReshape = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  /**\n   * Reshape a multi dimensional array to fit the specified dimensions\n   *\n   * Syntax:\n   *\n   *     math.reshape(x, sizes)\n   *\n   * Examples:\n   *\n   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])\n   *     // returns Array  [[1, 2, 3], [4, 5, 6]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [1, 4])\n   *     // returns Array  [[1, 2, 3, 4]]\n   *\n   *     math.reshape([[1, 2], [3, 4]], [4])\n   *     // returns Array [1, 2, 3, 4]\n   *\n   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])\n   *     math.reshape(x, [2, 2, 2])\n   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n   *\n   *    math.reshape([1, 2, 3, 4], [-1, 2])\n   *    // returns Matrix [[1, 2], [3, 4]]\n   *\n   * See also:\n   *\n   *     size, squeeze, resize\n   *\n   * @param {Array | Matrix | *} x  Matrix to be reshaped\n   * @param {number[]} sizes        One dimensional array with integral sizes for\n   *                                each dimension. One -1 is allowed as wildcard,\n   *                                which calculates this dimension automatically.\n   *\n   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`\n   *\n   * @throws {TypeError}            If `sizes` does not contain solely integers\n   * @throws {DimensionError}       If the product of the new dimension sizes does\n   *                                not equal that of the old ones\n   */\n  return typed(name, {\n\n    'Matrix, Array': function (x, sizes) {\n      return x.reshape(sizes, true)\n    },\n\n    'Array, Array': function (x, sizes) {\n      sizes.forEach(function (size) {\n        if (!isInteger(size)) {\n          throw new TypeError('Invalid size for dimension: ' + size)\n        }\n      })\n      return arrayReshape(x, sizes)\n    }\n\n  })\n})\n","import { isBigNumber, isMatrix } from '../../utils/is.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { ArgumentsError } from '../../error/ArgumentsError.js'\nimport { isInteger } from '../../utils/number.js'\nimport { format } from '../../utils/string.js'\nimport { clone } from '../../utils/object.js'\nimport { resize as arrayResize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'resize'\nconst dependencies = ['config', 'matrix']\n\nexport const createResize = /* #__PURE__ */ factory(name, dependencies, ({ config, matrix }) => {\n  /**\n   * Resize a matrix\n   *\n   * Syntax:\n   *\n   *     math.resize(x, size)\n   *     math.resize(x, size, defaultValue)\n   *\n   * Examples:\n   *\n   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]\n   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]\n   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]\n   *     math.resize(\"hello\", [8], \"!\")    // returns string 'hello!!!'\n   *\n   * See also:\n   *\n   *     size, squeeze, subset, reshape\n   *\n   * @param {Array | Matrix | *} x             Matrix to be resized\n   * @param {Array | Matrix} size              One dimensional array with numbers\n   * @param {number | string} [defaultValue=0] Zero by default, except in\n   *                                           case of a string, in that case\n   *                                           defaultValue = ' '\n   * @return {* | Array | Matrix} A resized clone of matrix `x`\n   */\n  // TODO: rework resize to a typed-function\n  return function resize (x, size, defaultValue) {\n    if (arguments.length !== 2 && arguments.length !== 3) {\n      throw new ArgumentsError('resize', arguments.length, 2, 3)\n    }\n\n    if (isMatrix(size)) {\n      size = size.valueOf() // get Array\n    }\n\n    if (isBigNumber(size[0])) {\n      // convert bignumbers to numbers\n      size = size.map(function (value) {\n        return !isBigNumber(value) ? value : value.toNumber()\n      })\n    }\n\n    // check x is a Matrix\n    if (isMatrix(x)) {\n      // use optimized matrix implementation, return copy\n      return x.resize(size, defaultValue, true)\n    }\n\n    if (typeof x === 'string') {\n      // resize string\n      return _resizeString(x, size, defaultValue)\n    }\n\n    // check result should be a matrix\n    const asMatrix = Array.isArray(x) ? false : (config.matrix !== 'Array')\n\n    if (size.length === 0) {\n      // output a scalar\n      while (Array.isArray(x)) {\n        x = x[0]\n      }\n\n      return clone(x)\n    } else {\n      // output an array/matrix\n      if (!Array.isArray(x)) {\n        x = [x]\n      }\n      x = clone(x)\n\n      const res = arrayResize(x, size, defaultValue)\n      return asMatrix ? matrix(res) : res\n    }\n  }\n\n  /**\n   * Resize a string\n   * @param {string} str\n   * @param {number[]} size\n   * @param {string} [defaultChar=' ']\n   * @private\n   */\n  function _resizeString (str, size, defaultChar) {\n    if (defaultChar !== undefined) {\n      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {\n        throw new TypeError('Single character expected as defaultValue')\n      }\n    } else {\n      defaultChar = ' '\n    }\n\n    if (size.length !== 1) {\n      throw new DimensionError(size.length, 1)\n    }\n    const len = size[0]\n    if (typeof len !== 'number' || !isInteger(len)) {\n      throw new TypeError('Invalid size, must contain positive integers ' +\n          '(size: ' + format(size) + ')')\n    }\n\n    if (str.length > len) {\n      return str.substring(0, len)\n    } else if (str.length < len) {\n      let res = str\n      for (let i = 0, ii = len - str.length; i < ii; i++) {\n        res += defaultChar\n      }\n      return res\n    } else {\n      return str\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { arraySize } from '../../utils/array.js'\n\nconst name = 'rotate'\nconst dependencies = [\n  'typed',\n  'multiply',\n  'rotationMatrix'\n]\n\nexport const createRotate = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed, multiply, rotationMatrix\n  }) => {\n  /**\n     * Rotate a vector of size 1x2 counter-clockwise by a given angle\n     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis\n     *\n     * Syntax:\n     *\n     *    math.rotate(w, theta)\n     *    math.rotate(w, theta, v)\n     *\n     * Examples:\n     *\n     *    math.rotate([11, 12], math.pi / 2)                           // returns [-12, 11]\n     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns [-12, 11]\n     *\n     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns [0, 1, 0]\n     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns Matrix [0, 1, 0]\n     *\n     *    math.rotate([1, 0], math.complex(1 + i))                     // returns [cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)]\n     *\n     * See also:\n     *\n     *    matrix, rotationMatrix\n     *\n     * @param {Array | Matrix} w                             Vector to rotate\n     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n     * @param {Array | Matrix} [v]                           Rotation axis\n     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w\n     */\n  return typed(name, {\n    'Array , number | BigNumber | Complex | Unit': function (w, theta) {\n      _validateSize(w, 2)\n      const matrixRes = multiply(rotationMatrix(theta), w)\n      return matrixRes.toArray()\n    },\n\n    'Matrix , number | BigNumber | Complex | Unit': function (w, theta) {\n      _validateSize(w, 2)\n      return multiply(rotationMatrix(theta), w)\n    },\n\n    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {\n      _validateSize(w, 3)\n      const matrixRes = multiply(rotationMatrix(theta, v), w)\n      return matrixRes\n    },\n\n    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {\n      _validateSize(w, 3)\n      return multiply(rotationMatrix(theta, v), w)\n    }\n  })\n\n  function _validateSize (v, expectedSize) {\n    const actualSize = Array.isArray(v) ? arraySize(v) : v.size()\n    if (actualSize.length > 2) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n    if (actualSize.length === 2 && actualSize[1] !== 1) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n    if (actualSize[0] !== expectedSize) {\n      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`)\n    }\n  }\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'rotationMatrix'\nconst dependencies = [\n  'typed',\n  'config',\n  'multiplyScalar',\n  'addScalar',\n  'unaryMinus',\n  'norm',\n  'matrix',\n  'BigNumber',\n  'DenseMatrix',\n  'SparseMatrix',\n  'cos',\n  'sin'\n]\n\nexport const createRotationMatrix = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed, config, multiplyScalar,\n    addScalar, unaryMinus, norm, BigNumber,\n    matrix, DenseMatrix, SparseMatrix, cos, sin\n  }) => {\n  /**\n   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).\n   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).\n   *\n   * Syntax:\n   *\n   *    math.rotationMatrix(theta)\n   *    math.rotationMatrix(theta, format)\n   *    math.rotationMatrix(theta, [v])\n   *    math.rotationMatrix(theta, [v], format)\n   *\n   * Examples:\n   *\n   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]\n   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]\n   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]\n   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]\n   *\n   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]\n   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])\n   *\n   *\n   * See also:\n   *\n   *    matrix, cos, sin\n   *\n   *\n   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle\n   * @param {Array | Matrix} [v]                           Rotation axis\n   * @param {string} [format]                              Result Matrix storage format\n   * @return {Array | Matrix}                              Rotation matrix\n   */\n\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Matrix') ? matrix([]) : []\n    },\n\n    string: function (format) {\n      return matrix(format)\n    },\n\n    'number | BigNumber | Complex | Unit': function (theta) {\n      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined)\n    },\n\n    'number | BigNumber | Complex | Unit, string': function (theta, format) {\n      return _rotationMatrix2x2(theta, format)\n    },\n\n    'number | BigNumber | Complex | Unit, Array': function (theta, v) {\n      const matrixV = matrix(v)\n      _validateVector(matrixV)\n      return _rotationMatrix3x3(theta, matrixV, undefined)\n    },\n\n    'number | BigNumber | Complex | Unit, Matrix': function (theta, v) {\n      _validateVector(v)\n      const storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined)\n      return _rotationMatrix3x3(theta, v, storageType)\n    },\n\n    'number | BigNumber | Complex | Unit, Array, string': function (theta, v, format) {\n      const matrixV = matrix(v)\n      _validateVector(matrixV)\n      return _rotationMatrix3x3(theta, matrixV, format)\n    },\n\n    'number | BigNumber | Complex | Unit, Matrix, string': function (theta, v, format) {\n      _validateVector(v)\n      return _rotationMatrix3x3(theta, v, format)\n    }\n\n  })\n\n  /**\n   * Returns 2x2 matrix of 2D rotation of angle theta\n   *\n   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle\n   * @param {string} format                              The result Matrix storage format\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix2x2 (theta, format) {\n    const Big = isBigNumber(theta)\n\n    const minusOne = Big ? new BigNumber(-1) : -1\n    const cosTheta = cos(theta)\n    const sinTheta = sin(theta)\n    const data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]]\n\n    return _convertToFormat(data, format)\n  }\n\n  function _validateVector (v) {\n    const size = v.size()\n    if (size.length < 1 || size[0] !== 3) {\n      throw new RangeError('Vector must be of dimensions 1x3')\n    }\n  }\n\n  function _mul (array) {\n    return array.reduce((p, curr) => multiplyScalar(p, curr))\n  }\n\n  function _convertToFormat (data, format) {\n    if (format) {\n      if (format === 'sparse') {\n        return new SparseMatrix(data)\n      }\n      if (format === 'dense') {\n        return new DenseMatrix(data)\n      }\n      throw new TypeError(`Unknown matrix type \"${format}\"`)\n    }\n    return data\n  }\n\n  /**\n   * Returns a 3x3 matrix of rotation of angle theta around vector v\n   *\n   * @param {number | BigNumber | Complex | Unit} theta The rotation angle\n   * @param {Matrix} v                                  The rotation axis vector\n   * @param {string} format                             The storage format of the resulting matrix\n   * @returns {Matrix}\n   * @private\n   */\n  function _rotationMatrix3x3 (theta, v, format) {\n    const normV = norm(v)\n    if (normV === 0) {\n      throw new RangeError('Rotation around zero vector')\n    }\n\n    const Big = isBigNumber(theta) ? BigNumber : null\n\n    const one = Big ? new Big(1) : 1\n    const minusOne = Big ? new Big(-1) : -1\n    const vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV\n    const vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV\n    const vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV\n    const c = cos(theta)\n    const oneMinusC = addScalar(one, unaryMinus(c))\n    const s = sin(theta)\n\n    const r11 = addScalar(c, _mul([vx, vx, oneMinusC]))\n    const r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]))\n    const r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]))\n\n    const r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]))\n    const r22 = addScalar(c, _mul([vy, vy, oneMinusC]))\n    const r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]))\n\n    const r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]))\n    const r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]))\n    const r33 = addScalar(c, _mul([vz, vz, oneMinusC]))\n\n    const data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]]\n\n    return _convertToFormat(data, format)\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { validateIndex } from '../../utils/array.js'\n\nconst name = 'row'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\nexport const createRow = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  /**\n   * Return a row from a Matrix.\n   *\n   * Syntax:\n   *\n   *     math.row(value, index)\n   *\n   * Example:\n   *\n   *     // get a row\n   *     const d = [[1, 2], [3, 4]]\n   *     math.row(d, 1) // returns [[3, 4]]\n   *\n   * See also:\n   *\n   *     column\n   *\n   * @param {Array | Matrix } value   An array or matrix\n   * @param {number} row              The index of the row\n   * @return {Array | Matrix}         The retrieved row\n   */\n  return typed(name, {\n    'Matrix, number': _row,\n\n    'Array, number': function (value, row) {\n      return _row(matrix(clone(value)), row).valueOf()\n    }\n  })\n\n  /**\n   * Retrieve a row of a matrix\n   * @param {Matrix } value  A matrix\n   * @param {number} row     The index of the row\n   * @return {Matrix}        The retrieved row\n   */\n  function _row (value, row) {\n    // check dimensions\n    if (value.size().length !== 2) {\n      throw new Error('Only two dimensional matrix is supported')\n    }\n\n    validateIndex(row, value.size()[0])\n\n    const columnRange = range(0, value.size()[1])\n    const index = new Index(row, columnRange)\n    const result = value.subset(index)\n    return isMatrix(result)\n      ? result\n      : matrix([[result]])\n  }\n})\n","import { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { noMatrix } from '../../utils/noop.js'\n\nconst name = 'size'\nconst dependencies = ['typed', 'config', '?matrix']\n\nexport const createSize = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix }) => {\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                       // returns []\n   *     math.size('hello world')             // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                         // returns [2, 3]\n   *     math.size(math.range(1,6).toArray()) // returns [5]\n   *\n   * See also:\n   *\n   *     count, resize, squeeze, subset\n   *\n   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix\n   * @return {Array | Matrix} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: function (x) {\n      return x.create(x.size(), 'number')\n    },\n\n    Array: arraySize,\n\n    string: function (x) {\n      return (config.matrix === 'Array') ? [x.length] : matrix([x.length], 'dense', 'number')\n    },\n\n    'number | Complex | BigNumber | Unit | boolean | null': function (x) {\n      // scalar\n      return (config.matrix === 'Array')\n        ? []\n        : matrix ? matrix([], 'dense', 'number') : noMatrix()\n    }\n  })\n})\n","import { clone } from '../../utils/object.js'\nimport { squeeze as arraySqueeze } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'squeeze'\nconst dependencies = ['typed']\n\nexport const createSqueeze = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.\n   *\n   * Syntax:\n   *\n   *     math.squeeze(x)\n   *\n   * Examples:\n   *\n   *     math.squeeze([3])           // returns 3\n   *     math.squeeze([[3]])         // returns 3\n   *\n   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)\n   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)\n   *\n   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)\n   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)\n   *\n   *     // only inner and outer dimensions are removed\n   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)\n   *\n   * See also:\n   *\n   *     subset\n   *\n   * @param {Matrix | Array} x      Matrix to be squeezed\n   * @return {Matrix | Array} Squeezed matrix\n   */\n  return typed(name, {\n    Array: function (x) {\n      return arraySqueeze(clone(x))\n    },\n\n    Matrix: function (x) {\n      const res = arraySqueeze(x.toArray())\n      // FIXME: return the same type of matrix as the input\n      return Array.isArray(res) ? x.create(res, x.datatype()) : res\n    },\n\n    any: function (x) {\n      // scalar\n      return clone(x)\n    }\n  })\n})\n","import { isIndex } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { isEmptyIndex, validateIndex, validateIndexSourceSize } from '../../utils/array.js'\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js'\nimport { DimensionError } from '../../error/DimensionError.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'subset'\nconst dependencies = ['typed', 'matrix', 'zeros', 'add']\n\nexport const createSubset = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, zeros, add }) => {\n  /**\n   * Get or set a subset of a matrix or string.\n   *\n   * Syntax:\n   *     math.subset(value, index)                                // retrieve a subset\n   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset\n   *\n   * Examples:\n   *\n   *     // get a subset\n   *     const d = [[1, 2], [3, 4]]\n   *     math.subset(d, math.index(1, 0))             // returns 3\n   *     math.subset(d, math.index([0, 1], 1))        // returns [[2], [4]]\n   *     math.subset(d, math.index([false, true], 0)) // returns [[3]]\n   *\n   *     // replace a subset\n   *     const e = []\n   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 0, 6]]\n   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 0, 6], [0, 7, 0]]\n   *     math.subset(g, math.index([false, true], 1), 8)          // returns [[5, 0, 6], [0, 8, 0]]\n   *\n   *     // get submatrix using ranges\n   *     const M = [\n   *       [1,2,3],\n   *       [4,5,6],\n   *       [7,8,9]\n   *     ]\n   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1, 2, 3], [4, 5, 6]]\n   *\n   * See also:\n   *\n   *     size, resize, squeeze, index\n   *\n   * @param {Array | Matrix | string} matrix  An array, matrix, or string\n   * @param {Index} index\n   *    For each dimension of the target, specifies an index or a list of\n   *    indices to fetch or set. `subset` uses the cartesian product of\n   *    the indices specified in each dimension.\n   * @param {*} [replacement]                 An array, matrix, or scalar.\n   *                                          If provided, the subset is replaced with replacement.\n   *                                          If not provided, the subset is returned\n   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when\n   *                                          the matrix is resized. If not provided,\n   *                                          math.matrix elements will be left undefined.\n   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.\n   */\n\n  return typed(name, {\n    // get subset\n    'Matrix, Index': function (value, index) {\n      if (isEmptyIndex(index)) { return matrix() }\n      validateIndexSourceSize(value, index)\n      return value.subset(index)\n    },\n\n    'Array, Index': typed.referTo('Matrix, Index', function (subsetRef) {\n      return function (value, index) {\n        const subsetResult = subsetRef(matrix(value), index)\n        return index.isScalar() ? subsetResult : subsetResult.valueOf()\n      }\n    }),\n\n    'Object, Index': _getObjectProperty,\n\n    'string, Index': _getSubstring,\n\n    // set subset\n    'Matrix, Index, any, any': function (value, index, replacement, defaultValue) {\n      if (isEmptyIndex(index)) { return value }\n      validateIndexSourceSize(value, index)\n      return value.clone().subset(index, _broadcastReplacement(replacement, index), defaultValue)\n    },\n\n    'Array, Index, any, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement, defaultValue) {\n        const subsetResult = subsetRef(matrix(value), index, replacement, defaultValue)\n        return subsetResult.isMatrix ? subsetResult.valueOf() : subsetResult\n      }\n    }),\n\n    'Array, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement) {\n        return subsetRef(matrix(value), index, replacement, undefined).valueOf()\n      }\n    }),\n\n    'Matrix, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {\n      return function (value, index, replacement) { return subsetRef(value, index, replacement, undefined) }\n    }),\n\n    'string, Index, string': _setSubstring,\n    'string, Index, string, string': _setSubstring,\n    'Object, Index, any': _setObjectProperty\n  })\n\n  /**\n   * Broadcasts a replacment value to be the same size as index\n   * @param {number | BigNumber | Array | Matrix} replacement Replacement value to try to broadcast\n   * @param {*} index Index value\n   * @returns broadcasted replacement that matches the size of index\n   */\n\n  function _broadcastReplacement (replacement, index) {\n    if (typeof replacement === 'string') {\n      throw new Error('can\\'t boradcast a string')\n    }\n    if (index._isScalar) {\n      return replacement\n    }\n\n    const indexSize = index.size()\n    if (indexSize.every(d => d > 0)) {\n      try {\n        return add(replacement, zeros(indexSize))\n      } catch (error) {\n        return replacement\n      }\n    } else {\n      return replacement\n    }\n  }\n})\n\n/**\n * Retrieve a subset of a string\n * @param {string} str            string from which to get a substring\n * @param {Index} index           An index or list of indices (character positions)\n * @returns {string} substring\n * @private\n */\nfunction _getSubstring (str, index) {\n  if (!isIndex(index)) {\n    // TODO: better error message\n    throw new TypeError('Index expected')\n  }\n\n  if (isEmptyIndex(index)) { return '' }\n  validateIndexSourceSize(Array.from(str), index)\n\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1)\n  }\n\n  // validate whether the range is out of range\n  const strLen = str.length\n  validateIndex(index.min()[0], strLen)\n  validateIndex(index.max()[0], strLen)\n\n  const range = index.dimension(0)\n\n  let substr = ''\n  range.forEach(function (v) {\n    substr += str.charAt(v)\n  })\n\n  return substr\n}\n\n/**\n * Replace a substring in a string\n * @param {string} str            string to be replaced\n * @param {Index} index           An index or list of indices (character positions)\n * @param {string} replacement    Replacement string\n * @param {string} [defaultValue] Default value to be used when resizing\n *                                the string. is ' ' by default\n * @returns {string} result\n * @private\n */\nfunction _setSubstring (str, index, replacement, defaultValue) {\n  if (!index || index.isIndex !== true) {\n    // TODO: better error message\n    throw new TypeError('Index expected')\n  }\n  if (isEmptyIndex(index)) { return str }\n  validateIndexSourceSize(Array.from(str), index)\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size().length, 1)\n  }\n  if (defaultValue !== undefined) {\n    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {\n      throw new TypeError('Single character expected as defaultValue')\n    }\n  } else {\n    defaultValue = ' '\n  }\n\n  const range = index.dimension(0)\n  const len = range.size()[0]\n\n  if (len !== replacement.length) {\n    throw new DimensionError(range.size()[0], replacement.length)\n  }\n\n  // validate whether the range is out of range\n  const strLen = str.length\n  validateIndex(index.min()[0])\n  validateIndex(index.max()[0])\n\n  // copy the string into an array with characters\n  const chars = []\n  for (let i = 0; i < strLen; i++) {\n    chars[i] = str.charAt(i)\n  }\n\n  range.forEach(function (v, i) {\n    chars[v] = replacement.charAt(i[0])\n  })\n\n  // initialize undefined characters with a space\n  if (chars.length > strLen) {\n    for (let i = strLen - 1, len = chars.length; i < len; i++) {\n      if (!chars[i]) {\n        chars[i] = defaultValue\n      }\n    }\n  }\n\n  return chars.join('')\n}\n\n/**\n * Retrieve a property from an object\n * @param {Object} object\n * @param {Index} index\n * @return {*} Returns the value of the property\n * @private\n */\nfunction _getObjectProperty (object, index) {\n  if (isEmptyIndex(index)) { return undefined }\n\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1)\n  }\n\n  const key = index.dimension(0)\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property')\n  }\n\n  return getSafeProperty(object, key)\n}\n\n/**\n * Set a property on an object\n * @param {Object} object\n * @param {Index} index\n * @param {*} replacement\n * @return {*} Returns the updated object\n * @private\n */\nfunction _setObjectProperty (object, index, replacement) {\n  if (isEmptyIndex(index)) { return object }\n  if (index.size().length !== 1) {\n    throw new DimensionError(index.size(), 1)\n  }\n\n  const key = index.dimension(0)\n  if (typeof key !== 'string') {\n    throw new TypeError('String expected as index to retrieve an object property')\n  }\n\n  // clone the object, and apply the property to the clone\n  const updated = clone(object)\n  setSafeProperty(updated, key, replacement)\n\n  return updated\n}\n","import { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'transpose'\nconst dependencies = ['typed', 'matrix']\n\nexport const createTranspose = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix }) => {\n  /**\n   * Transpose a matrix. All values of the matrix are reflected over its\n   * main diagonal. Only applicable to two dimensional matrices containing\n   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional\n   * vectors and scalars return the input unchanged.\n   *\n   * Syntax:\n   *\n   *     math.transpose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]\n   *\n   * See also:\n   *\n   *     diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be transposed\n   * @return {Array | Matrix}   The transposed matrix\n   */\n  return typed(name, {\n    Array: x => transposeMatrix(matrix(x)).valueOf(),\n    Matrix: transposeMatrix,\n    any: clone // scalars\n  })\n\n  function transposeMatrix (x) {\n    // matrix size\n    const size = x.size()\n\n    // result\n    let c\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        c = x.clone()\n        break\n\n      case 2:\n        {\n          // rows and columns\n          const rows = size[0]\n          const columns = size[1]\n\n          // check columns\n          if (columns === 0) {\n            // throw exception\n            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')')\n          }\n\n          // process storage format\n          switch (x.storage()) {\n            case 'dense':\n              c = _denseTranspose(x, rows, columns)\n              break\n            case 'sparse':\n              c = _sparseTranspose(x, rows, columns)\n              break\n          }\n        }\n        break\n\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(size) + ')')\n    }\n    return c\n  }\n\n  function _denseTranspose (m, rows, columns) {\n    // matrix array\n    const data = m._data\n    // transposed matrix data\n    const transposed = []\n    let transposedRow\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // initialize row\n      transposedRow = transposed[j] = []\n      // loop rows\n      for (let i = 0; i < rows; i++) {\n        // set data\n        transposedRow[i] = clone(data[i][j])\n      }\n    }\n    // return matrix\n    return m.createDenseMatrix({\n      data: transposed,\n      size: [columns, rows],\n      datatype: m._datatype\n    })\n  }\n\n  function _sparseTranspose (m, rows, columns) {\n    // matrix arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // result matrices\n    const cvalues = values ? [] : undefined\n    const cindex = []\n    const cptr = []\n    // row counts\n    const w = []\n    for (let x = 0; x < rows; x++) { w[x] = 0 }\n    // vars\n    let p, l, j\n    // loop values in matrix\n    for (p = 0, l = index.length; p < l; p++) {\n      // number of values in row\n      w[index[p]]++\n    }\n    // cumulative sum\n    let sum = 0\n    // initialize cptr with the cummulative sum of row counts\n    for (let i = 0; i < rows; i++) {\n      // update cptr\n      cptr.push(sum)\n      // update sum\n      sum += w[i]\n      // update w\n      w[i] = cptr[i]\n    }\n    // update cptr\n    cptr.push(sum)\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // values & index in column\n      for (let k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {\n        // C values & index\n        const q = w[index[k]]++\n        // C[j, i] = A[i, j]\n        cindex[q] = j\n        // check we need to process values (pattern matrix)\n        if (values) { cvalues[q] = clone(values[k]) }\n      }\n    }\n    // return matrix\n    return m.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [columns, rows],\n      datatype: m._datatype\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'ctranspose'\nconst dependencies = ['typed', 'transpose', 'conj']\n\nexport const createCtranspose = /* #__PURE__ */ factory(name, dependencies, ({ typed, transpose, conj }) => {\n  /**\n   * Transpose and complex conjugate a matrix. All values of the matrix are\n   * reflected over its main diagonal and then the complex conjugate is\n   * taken. This is equivalent to complex conjugation for scalars and\n   * vectors.\n   *\n   * Syntax:\n   *\n   *     math.ctranspose(x)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]\n   *     math.ctranspose(A)      // returns [[1, 4], [2, 5], [3, {re:6,im:-7}]]\n   *\n   * See also:\n   *\n   *     transpose, diag, inv, subset, squeeze\n   *\n   * @param {Array | Matrix} x  Matrix to be ctransposed\n   * @return {Array | Matrix}   The ctransposed matrix\n   */\n  return typed(name, {\n    any: function (x) {\n      return conj(transpose(x))\n    }\n  })\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { resize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'zeros'\nconst dependencies = ['typed', 'config', 'matrix', 'BigNumber']\n\nexport const createZeros = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, BigNumber }) => {\n  /**\n   * Create a matrix filled with zeros. The created matrix can have one or\n   * multiple dimensions.\n   *\n   * Syntax:\n   *\n   *    math.zeros(m)\n   *    math.zeros(m, format)\n   *    math.zeros(m, n)\n   *    math.zeros(m, n, format)\n   *    math.zeros([m, n])\n   *    math.zeros([m, n], format)\n   *\n   * Examples:\n   *\n   *    math.zeros()                   // returns []\n   *    math.zeros(3)                  // returns [0, 0, 0]\n   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]\n   *    math.zeros(3, 'dense')         // returns [0, 0, 0]\n   *\n   *    const A = [[1, 2, 3], [4, 5, 6]]\n   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]\n   *\n   * See also:\n   *\n   *    ones, identity, size, range\n   *\n   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix\n   * @param {string} [format]           The Matrix storage format\n   *\n   * @return {Array | Matrix}           A matrix filled with zeros\n   */\n  return typed(name, {\n    '': function () {\n      return (config.matrix === 'Array')\n        ? _zeros([])\n        : _zeros([], 'default')\n    },\n\n    // math.zeros(m, n, p, ..., format)\n    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this\n    '...number | BigNumber | string': function (size) {\n      const last = size[size.length - 1]\n      if (typeof last === 'string') {\n        const format = size.pop()\n        return _zeros(size, format)\n      } else if (config.matrix === 'Array') {\n        return _zeros(size)\n      } else {\n        return _zeros(size, 'default')\n      }\n    },\n\n    Array: _zeros,\n\n    Matrix: function (size) {\n      const format = size.storage()\n      return _zeros(size.valueOf(), format)\n    },\n\n    'Array | Matrix, string': function (size, format) {\n      return _zeros(size.valueOf(), format)\n    }\n  })\n\n  /**\n   * Create an Array or Matrix with zeros\n   * @param {Array} size\n   * @param {string} [format='default']\n   * @return {Array | Matrix}\n   * @private\n   */\n  function _zeros (size, format) {\n    const hasBigNumbers = _normalize(size)\n    const defaultValue = hasBigNumbers ? new BigNumber(0) : 0\n    _validate(size)\n\n    if (format) {\n      // return a matrix\n      const m = matrix(format)\n      if (size.length > 0) {\n        return m.resize(size, defaultValue)\n      }\n      return m\n    } else {\n      // return an Array\n      const arr = []\n      if (size.length > 0) {\n        return resize(arr, size, defaultValue)\n      }\n      return arr\n    }\n  }\n\n  // replace BigNumbers with numbers, returns true if size contained BigNumbers\n  function _normalize (size) {\n    let hasBigNumbers = false\n    size.forEach(function (value, index, arr) {\n      if (isBigNumber(value)) {\n        hasBigNumbers = true\n        arr[index] = value.toNumber()\n      }\n    })\n    return hasBigNumbers\n  }\n\n  // validate arguments\n  function _validate (size) {\n    size.forEach(function (value) {\n      if (typeof value !== 'number' || !isInteger(value) || value < 0) {\n        throw new Error('Parameters in function zeros must be positive integers')\n      }\n    })\n  }\n})\n\n// TODO: zeros contains almost the same code as ones. Reuse this?\n","import { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'fft'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'addScalar',\n  'multiplyScalar',\n  'divideScalar',\n  'exp',\n  'tau',\n  'i',\n  'dotDivide',\n  'conj',\n  'pow',\n  'ceil',\n  'log2'\n]\n\nexport const createFft = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  matrix,\n  addScalar,\n  multiplyScalar,\n  divideScalar,\n  exp,\n  tau,\n  i: I,\n  dotDivide,\n  conj,\n  pow,\n  ceil,\n  log2\n}) => {\n  /**\n   * Calculate N-dimensional Fourier transform\n   *\n   * Syntax:\n   *\n   *     math.fft(arr)\n   *\n   * Examples:\n   *\n   *    math.fft([[1, 0], [1, 0]]) // returns [[{re:2, im:0}, {re:2, im:0}], [{re:0, im:0}, {re:0, im:0}]]\n   *\n   *\n   * See Also:\n   *\n   *      ifft\n   *\n   * @param {Array | Matrix} arr    An array or matrix\n   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array\n   */\n  return typed(name, {\n    Array: _ndFft,\n    Matrix: function (matrix) {\n      return matrix.create(_ndFft(matrix.valueOf()), matrix.datatype())\n    }\n  })\n\n  /**\n   * Perform an N-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _ndFft (arr) {\n    const size = arraySize(arr)\n    if (size.length === 1) return _fft(arr, size[0])\n    // ndFft along dimension 1,...,N-1 then 1dFft along dimension 0\n    return _1dFft(arr.map(slice => _ndFft(slice, size.slice(1))), 0)\n  }\n\n  /**\n   * Perform an 1-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @param {number} dim     dimension of the array to perform on\n   * @return {Array}         resulting array\n   */\n  function _1dFft (arr, dim) {\n    const size = arraySize(arr)\n    if (dim !== 0) return new Array(size[0]).fill(0).map((_, i) => _1dFft(arr[i], dim - 1))\n    if (size.length === 1) return _fft(arr)\n    function _transpose (arr) { // Swap first 2 dimensions\n      const size = arraySize(arr)\n      return new Array(size[1]).fill(0).map((_, j) => new Array(size[0]).fill(0).map((_, i) => arr[i][j]))\n    }\n    return _transpose(_1dFft(_transpose(arr), 1))\n  }\n  /**\n   * Perform an 1-dimensional non-power-of-2 Fourier transform using Chirp-Z Transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _czt (arr) {\n    const n = arr.length\n    const w = exp(divideScalar(multiplyScalar(-1, multiplyScalar(I, tau)), n))\n    const chirp = []\n    for (let i = 1 - n; i < n; i++) {\n      chirp.push(pow(w, divideScalar(pow(i, 2), 2)))\n    }\n    const N2 = pow(2, ceil(log2(n + n - 1)))\n    const xp = [\n      ...new Array(n).fill(0).map((_, i) => multiplyScalar(arr[i], chirp[n - 1 + i])),\n      ...new Array(N2 - n).fill(0)\n    ]\n    const ichirp = [\n      ...new Array(n + n - 1).fill(0).map((_, i) => divideScalar(1, chirp[i])),\n      ...new Array(N2 - (n + n - 1)).fill(0)\n    ]\n    const fftXp = _fft(xp)\n    const fftIchirp = _fft(ichirp)\n    const fftProduct = new Array(N2).fill(0).map((_, i) => multiplyScalar(fftXp[i], fftIchirp[i]))\n    const ifftProduct = dotDivide(conj(_ndFft(conj(fftProduct))), N2)\n    const ret = []\n    for (let i = n - 1; i < n + n - 1; i++) {\n      ret.push(multiplyScalar(ifftProduct[i], chirp[i]))\n    }\n    return ret\n  }\n  /**\n   * Perform an 1-dimensional Fourier transform\n   *\n   * @param {Array} arr      The array\n   * @return {Array}         resulting array\n   */\n  function _fft (arr) {\n    const len = arr.length\n    if (len === 1) return [arr[0]]\n    if (len % 2 === 0) {\n      const ret = [\n        ..._fft(arr.filter((_, i) => i % 2 === 0), len / 2),\n        ..._fft(arr.filter((_, i) => i % 2 === 1), len / 2)\n      ]\n      for (let k = 0; k < len / 2; k++) {\n        const p = ret[k]\n        const q = multiplyScalar(\n          ret[k + len / 2],\n          exp(\n            multiplyScalar(multiplyScalar(tau, I), divideScalar(-k, len))\n          )\n        )\n        ret[k] = addScalar(p, q)\n        ret[k + len / 2] = addScalar(p, multiplyScalar(-1, q))\n      }\n      return ret\n    } else {\n      // use chirp-z transform for non-power-of-2 FFT\n      return _czt(arr)\n    }\n    // throw new Error('Can only calculate FFT of power-of-two size')\n  }\n})\n","import { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'ifft'\nconst dependencies = [\n  'typed',\n  'fft',\n  'dotDivide',\n  'conj'\n]\n\nexport const createIfft = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  fft,\n  dotDivide,\n  conj\n}) => {\n  /**\n   * Calculate N-dimensional inverse Fourier transform\n   *\n   * Syntax:\n   *\n   *     math.ifft(arr)\n   *\n   * Examples:\n   *\n   *    math.ifft([[2, 2], [0, 0]]) // returns [[{re:1, im:0}, {re:0, im:0}], [{re:1, im:0}, {re:0, im:0}]]\n   *\n   * See Also:\n   *\n   *      fft\n   *\n   * @param {Array | Matrix} arr    An array or matrix\n   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array\n   */\n  return typed(name, {\n    'Array | Matrix': function (arr) {\n      const size = isMatrix(arr) ? arr.size() : arraySize(arr)\n      return dotDivide(conj(fft(conj(arr))), size.reduce((acc, curr) => acc * curr, 1))\n    }\n  })\n})\n","import { isUnit, isNumber, isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'solveODE'\nconst dependencies = [\n  'typed',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'max',\n  'map',\n  'abs',\n  'isPositive',\n  'isNegative',\n  'larger',\n  'smaller',\n  'matrix',\n  'bignumber',\n  'unaryMinus'\n]\n\nexport const createSolveODE = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    add,\n    subtract,\n    multiply,\n    divide,\n    max,\n    map,\n    abs,\n    isPositive,\n    isNegative,\n    larger,\n    smaller,\n    matrix,\n    bignumber,\n    unaryMinus\n  }\n) => {\n  /**\n     * Numerical Integration of Ordinary Differential Equations\n     *\n     * Two variable step methods are provided:\n     * - \"RK23\": Bogacki–Shampine method\n     * - \"RK45\": Dormand-Prince method RK5(4)7M (default)\n     *\n     * The arguments are expected as follows.\n     *\n     * - `func` should be the forcing function `f(t, y)`\n     * - `tspan` should be a vector of two numbers or units `[tStart, tEnd]`\n     * - `y0` the initial state values, should be a scalar or a flat array\n     * - `options` should be an object with the following information:\n     *   - `method` ('RK45'): ['RK23', 'RK45']\n     *   - `tol` (1e-3): Numeric tolerance of the method, the solver keeps the error estimates less than this value\n     *   - `firstStep`: Initial step size\n     *   - `minStep`: minimum step size of the method\n     *   - `maxStep`: maximum step size of the method\n     *   - `minDelta` (0.2): minimum ratio of change for the step\n     *   - `maxDelta` (5): maximum ratio of change for the step\n     *   - `maxIter` (1e4): maximum number of iterations\n     *\n     * The returned value is an object with `{t, y}` please note that even though `t` means time, it can represent any other independant variable like `x`:\n     * - `t` an array of size `[n]`\n     * - `y` the states array can be in two ways\n     *   - **if `y0` is a scalar:** returns an array-like of size `[n]`\n     *   - **if `y0` is a flat array-like of size [m]:** returns an array like of size `[n, m]`\n     *\n     * Syntax:\n     *\n     *     math.solveODE(func, tspan, y0)\n     *     math.solveODE(func, tspan, y0, options)\n     *\n     * Examples:\n     *\n     *     function func(t, y) {return y}\n     *     const tspan = [0, 4]\n     *     const y0 = 1\n     *     math.solveODE(func, tspan, y0)\n     *     math.solveODE(func, tspan, [1, 2])\n     *     math.solveODE(func, tspan, y0, { method:\"RK23\", maxStep:0.1 })\n     *\n     * See also:\n     *\n     *     derivative, simplifyCore\n     *\n     * @param {function} func The forcing function f(t,y)\n     * @param {Array | Matrix} tspan The time span\n     * @param {number | BigNumber | Unit | Array | Matrix} y0 The initial value\n     * @param {Object} [options] Optional configuration options\n     * @return {Object} Return an object with t and y values as arrays\n     */\n\n  function _rk (butcherTableau) {\n    // generates an adaptive runge kutta method from it's butcher tableau\n\n    return function (f, tspan, y0, options) {\n      // adaptive runge kutta methods\n      const wrongTSpan = !((tspan.length === 2) && (tspan.every(isNumOrBig) || tspan.every(isUnit)))\n      if (wrongTSpan) {\n        throw new Error('\"tspan\" must be an Array of two numeric values or two units [tStart, tEnd]')\n      }\n      const t0 = tspan[0] // initial time\n      const tf = tspan[1] // final time\n      const isForwards = larger(tf, t0)\n      const firstStep = options.firstStep\n      if (firstStep !== undefined && !isPositive(firstStep)) {\n        throw new Error('\"firstStep\" must be positive')\n      }\n      const maxStep = options.maxStep\n      if (maxStep !== undefined && !isPositive(maxStep)) {\n        throw new Error('\"maxStep\" must be positive')\n      }\n      const minStep = options.minStep\n      if (minStep && isNegative(minStep)) {\n        throw new Error('\"minStep\" must be positive or zero')\n      }\n      const timeVars = [t0, tf, firstStep, minStep, maxStep].filter(x => x !== undefined)\n      if (!(timeVars.every(isNumOrBig) || timeVars.every(isUnit))) {\n        throw new Error('Inconsistent type of \"t\" dependant variables')\n      }\n      const steps = 1 // divide time in this number of steps\n      const tol = options.tol ? options.tol : 1e-4 // define a tolerance (must be an option)\n      const minDelta = options.minDelta ? options.minDelta : 0.2\n      const maxDelta = options.maxDelta ? options.maxDelta : 5\n      const maxIter = options.maxIter ? options.maxIter : 10_000 // stop inifite evaluation if something goes wrong\n      const hasBigNumbers = [t0, tf, ...y0, maxStep, minStep].some(isBigNumber)\n      const [a, c, b, bp] = hasBigNumbers\n        ? [\n            bignumber(butcherTableau.a),\n            bignumber(butcherTableau.c),\n            bignumber(butcherTableau.b),\n            bignumber(butcherTableau.bp)\n          ]\n        : [butcherTableau.a, butcherTableau.c, butcherTableau.b, butcherTableau.bp]\n\n      let h = firstStep\n        ? isForwards ? firstStep : unaryMinus(firstStep)\n        : divide(subtract(tf, t0), steps) // define the first step size\n      const t = [t0] // start the time array\n      const y = [y0] // start the solution array\n\n      const deltaB = subtract(b, bp) // b - bp\n\n      let n = 0\n      let iter = 0\n      const ongoing = _createOngoing(isForwards)\n      const trimStep = _createTrimStep(isForwards)\n      // iterate unitil it reaches either the final time or maximum iterations\n      while (ongoing(t[n], tf)) {\n        const k = []\n\n        // trim the time step so that it doesn't overshoot\n        h = trimStep(t[n], tf, h)\n\n        // calculate the first value of k\n        k.push(f(t[n], y[n]))\n\n        // calculate the rest of the values of k\n        for (let i = 1; i < c.length; ++i) {\n          k.push(\n            f(\n              add(t[n], multiply(c[i], h)),\n              add(y[n], multiply(h, a[i], k))\n            )\n          )\n        }\n\n        // estimate the error by comparing solutions of different orders\n        const TE = max(\n          abs(\n            map(multiply(deltaB, k), (X) =>\n              isUnit(X) ? X.value : X\n            )\n          )\n        )\n\n        if (TE < tol && tol / TE > 1 / 4) {\n          // push solution if within tol\n          t.push(add(t[n], h))\n          y.push(add(y[n], multiply(h, b, k)))\n          n++\n        }\n\n        // estimate the delta value that will affect the step size\n        let delta = 0.84 * (tol / TE) ** (1 / 5)\n\n        if (smaller(delta, minDelta)) {\n          delta = minDelta\n        } else if (larger(delta, maxDelta)) {\n          delta = maxDelta\n        }\n\n        delta = hasBigNumbers ? bignumber(delta) : delta\n        h = multiply(h, delta)\n\n        if (maxStep && larger(abs(h), maxStep)) {\n          h = isForwards ? maxStep : unaryMinus(maxStep)\n        } else if (minStep && smaller(abs(h), minStep)) {\n          h = isForwards ? minStep : unaryMinus(minStep)\n        }\n        iter++\n        if (iter > maxIter) {\n          throw new Error('Maximum number of iterations reached, try changing options')\n        }\n      }\n      return { t, y }\n    }\n  }\n\n  function _rk23 (f, tspan, y0, options) {\n    // Bogacki–Shampine method\n\n    // Define the butcher table\n    const a = [\n      [],\n      [1 / 2],\n      [0, 3 / 4],\n      [2 / 9, 1 / 3, 4 / 9]\n    ]\n\n    const c = [null, 1 / 2, 3 / 4, 1]\n    const b = [2 / 9, 1 / 3, 4 / 9, 0]\n    const bp = [7 / 24, 1 / 4, 1 / 3, 1 / 8]\n\n    const butcherTableau = { a, c, b, bp }\n\n    // Solve an adaptive step size rk method\n    return _rk(butcherTableau)(f, tspan, y0, options)\n  }\n\n  function _rk45 (f, tspan, y0, options) {\n    // Dormand Prince method\n\n    // Define the butcher tableau\n    const a = [\n      [],\n      [1 / 5],\n      [3 / 40, 9 / 40],\n      [44 / 45, -56 / 15, 32 / 9],\n      [19372 / 6561, -25360 / 2187, 64448 / 6561, -212 / 729],\n      [9017 / 3168, -355 / 33, 46732 / 5247, 49 / 176, -5103 / 18656],\n      [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84]\n    ]\n\n    const c = [null, 1 / 5, 3 / 10, 4 / 5, 8 / 9, 1, 1]\n    const b = [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84, 0]\n    const bp = [5179 / 57600, 0, 7571 / 16695, 393 / 640, -92097 / 339200, 187 / 2100, 1 / 40]\n\n    const butcherTableau = { a, c, b, bp }\n\n    // Solve an adaptive step size rk method\n    return _rk(butcherTableau)(f, tspan, y0, options)\n  }\n\n  function _solveODE (f, tspan, y0, opt) {\n    const method = opt.method ? opt.method : 'RK45'\n    const methods = {\n      RK23: _rk23,\n      RK45: _rk45\n    }\n    if (method.toUpperCase() in methods) {\n      const methodOptions = { ...opt } // clone the options object\n      delete methodOptions.method // delete the method as it won't be needed\n      return methods[method.toUpperCase()](f, tspan, y0, methodOptions)\n    } else {\n      // throw an error indicating there is no such method\n      const methodsWithQuotes = Object.keys(methods).map(x => `\"${x}\"`)\n      // generates a string of methods like: \"BDF\", \"RK23\" and \"RK45\"\n      const availableMethodsString = `${methodsWithQuotes.slice(0, -1).join(', ')} and ${methodsWithQuotes.slice(-1)}`\n      throw new Error(`Unavailable method \"${method}\". Available methods are ${availableMethodsString}`)\n    }\n  }\n\n  function _createOngoing (isForwards) {\n    // returns the correct function to test if it's still iterating\n    return isForwards ? smaller : larger\n  }\n\n  function _createTrimStep (isForwards) {\n    const outOfBounds = isForwards ? larger : smaller\n    return function (t, tf, h) {\n      const next = add(t, h)\n      return outOfBounds(next, tf) ? subtract(tf, t) : h\n    }\n  }\n\n  function isNumOrBig (x) {\n    // checks if it's a number or bignumber\n    return isBigNumber(x) || isNumber(x)\n  }\n\n  function _matrixSolveODE (f, T, y0, options) {\n    // receives matrices and returns matrices\n    const sol = _solveODE(f, T.toArray(), y0.toArray(), options)\n    return { t: matrix(sol.t), y: matrix(sol.y) }\n  }\n\n  return typed('solveODE', {\n    'function, Array, Array, Object': _solveODE,\n    'function, Matrix, Matrix, Object': _matrixSolveODE,\n    'function, Array, Array': (f, T, y0) => _solveODE(f, T, y0, {}),\n    'function, Matrix, Matrix': (f, T, y0) => _matrixSolveODE(f, T, y0, {}),\n    'function, Array, number | BigNumber | Unit': (f, T, y0) => {\n      const sol = _solveODE(f, T, [y0], {})\n      return { t: sol.t, y: sol.y.map((Y) => Y[0]) }\n    },\n    'function, Matrix, number | BigNumber | Unit': (f, T, y0) => {\n      const sol = _solveODE(f, T.toArray(), [y0], {})\n      return { t: matrix(sol.t), y: matrix(sol.y.map((Y) => Y[0])) }\n    },\n    'function, Array, number | BigNumber | Unit, Object': (f, T, y0, options) => {\n      const sol = _solveODE(f, T, [y0], options)\n      return { t: sol.t, y: sol.y.map((Y) => Y[0]) }\n    },\n    'function, Matrix, number | BigNumber | Unit, Object': (f, T, y0, options) => {\n      const sol = _solveODE(f, T.toArray(), [y0], options)\n      return { t: matrix(sol.t), y: matrix(sol.y.map((Y) => Y[0])) }\n    }\n  })\n})\n","/* eslint-disable no-loss-of-precision */\n\nimport { deepMap } from '../../utils/collection.js'\nimport { sign } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'erf'\nconst dependencies = [\n  'typed'\n]\n\nexport const createErf = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the erf function of a value using a rational Chebyshev\n   * approximations for different intervals of x.\n   *\n   * This is a translation of W. J. Cody's Fortran implementation from 1987\n   * ( https://www.netlib.org/specfun/erf ). See the AMS publication\n   * \"Rational Chebyshev Approximations for the Error Function\" by W. J. Cody\n   * for an explanation of this process.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.erf(x)\n   *\n   * Examples:\n   *\n   *    math.erf(0.2)    // returns 0.22270258921047847\n   *    math.erf(-0.5)   // returns -0.5204998778130465\n   *    math.erf(4)      // returns 0.9999999845827421\n   *\n   * See also:\n   *    zeta\n   *\n   * @param {number | Array | Matrix} x   A real number\n   * @return {number | Array | Matrix}    The erf of `x`\n   */\n  return typed('name', {\n    number: function (x) {\n      const y = Math.abs(x)\n\n      if (y >= MAX_NUM) {\n        return sign(x)\n      }\n      if (y <= THRESH) {\n        return sign(x) * erf1(y)\n      }\n      if (y <= 4.0) {\n        return sign(x) * (1 - erfc2(y))\n      }\n      return sign(x) * (1 - erfc3(y))\n    },\n\n    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))\n\n    // TODO: For complex numbers, use the approximation for the Faddeeva function\n    //  from \"More Efficient Computation of the Complex Error Function\" (AMS)\n\n  })\n\n  /**\n   * Approximates the error function erf() for x <= 0.46875 using this function:\n   *               n\n   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))\n   *              j=0\n   */\n  function erf1 (y) {\n    const ysq = y * y\n    let xnum = P[0][4] * ysq\n    let xden = ysq\n    let i\n\n    for (i = 0; i < 3; i += 1) {\n      xnum = (xnum + P[0][i]) * ysq\n      xden = (xden + Q[0][i]) * ysq\n    }\n    return y * (xnum + P[0][3]) / (xden + Q[0][3])\n  }\n\n  /**\n   * Approximates the complement of the error function erfc() for\n   * 0.46875 <= x <= 4.0 using this function:\n   *                       n\n   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)\n   *                      j=0\n   */\n  function erfc2 (y) {\n    let xnum = P[1][8] * y\n    let xden = y\n    let i\n\n    for (i = 0; i < 7; i += 1) {\n      xnum = (xnum + P[1][i]) * y\n      xden = (xden + Q[1][i]) * y\n    }\n    const result = (xnum + P[1][7]) / (xden + Q[1][7])\n    const ysq = parseInt(y * 16) / 16\n    const del = (y - ysq) * (y + ysq)\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result\n  }\n\n  /**\n   * Approximates the complement of the error function erfc() for x > 4.0 using\n   * this function:\n   *\n   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +\n   *               n\n   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]\n   *              j=0\n   */\n  function erfc3 (y) {\n    let ysq = 1 / (y * y)\n    let xnum = P[2][5] * ysq\n    let xden = ysq\n    let i\n\n    for (i = 0; i < 4; i += 1) {\n      xnum = (xnum + P[2][i]) * ysq\n      xden = (xden + Q[2][i]) * ysq\n    }\n    let result = ysq * (xnum + P[2][4]) / (xden + Q[2][4])\n    result = (SQRPI - result) / y\n    ysq = parseInt(y * 16) / 16\n    const del = (y - ysq) * (y + ysq)\n    return Math.exp(-ysq * ysq) * Math.exp(-del) * result\n  }\n})\n\n/**\n * Upper bound for the first approximation interval, 0 <= x <= THRESH\n * @constant\n */\nconst THRESH = 0.46875\n\n/**\n * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)\n * @constant\n */\nconst SQRPI = 5.6418958354775628695e-1\n\n/**\n * Coefficients for each term of the numerator sum (p_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\nconst P = [[\n  3.16112374387056560e00, 1.13864154151050156e02,\n  3.77485237685302021e02, 3.20937758913846947e03,\n  1.85777706184603153e-1\n], [\n  5.64188496988670089e-1, 8.88314979438837594e00,\n  6.61191906371416295e01, 2.98635138197400131e02,\n  8.81952221241769090e02, 1.71204761263407058e03,\n  2.05107837782607147e03, 1.23033935479799725e03,\n  2.15311535474403846e-8\n], [\n  3.05326634961232344e-1, 3.60344899949804439e-1,\n  1.25781726111229246e-1, 1.60837851487422766e-2,\n  6.58749161529837803e-4, 1.63153871373020978e-2\n]]\n\n/**\n * Coefficients for each term of the denominator sum (q_j) for each approximation\n * interval (see W. J. Cody's paper for more details)\n * @constant\n */\nconst Q = [[\n  2.36012909523441209e01, 2.44024637934444173e02,\n  1.28261652607737228e03, 2.84423683343917062e03\n], [\n  1.57449261107098347e01, 1.17693950891312499e02,\n  5.37181101862009858e02, 1.62138957456669019e03,\n  3.29079923573345963e03, 4.36261909014324716e03,\n  3.43936767414372164e03, 1.23033935480374942e03\n], [\n  2.56852019228982242e00, 1.87295284992346047e00,\n  5.27905102951428412e-1, 6.05183413124413191e-2,\n  2.33520497626869185e-3\n]]\n\n/**\n * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is\n * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will\n * return 1\n */\nconst MAX_NUM = Math.pow(2, 53)\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'zeta'\nconst dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi']\n\nexport const createZeta = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, multiply, pow, divide, factorial, equal, smallerEq, isNegative, gamma, sin, subtract, add, Complex, BigNumber, pi }) => {\n  /**\n   * Compute the Riemann Zeta function of a value using an infinite series for\n   * all of the complex plane using Riemann's Functional equation.\n   *\n   * Based off the paper by Xavier Gourdon and Pascal Sebah\n   * ( http://numbers.computation.free.fr/Constants/Miscellaneous/zetaevaluations.pdf )\n   *\n   * Implementation and slight modification by Anik Patel\n   *\n   * Note: the implementation is accurate up to about 6 digits.\n   *\n   * Syntax:\n   *\n   *    math.zeta(n)\n   *\n   * Examples:\n   *\n   *    math.zeta(5)       // returns 1.0369277551433895\n   *    math.zeta(-0.5)    // returns -0.2078862249773449\n   *    math.zeta(math.i)  // returns 0.0033002236853253153 - 0.4181554491413212i\n   *\n   * See also:\n   *    erf\n   *\n   * @param {number | Complex | BigNumber} s   A Real, Complex or BigNumber parameter to the Riemann Zeta Function\n   * @return {number | Complex | BigNumber}    The Riemann Zeta of `s`\n   */\n  return typed(name, {\n    number: (s) => zetaNumeric(s, value => value, () => 20),\n    BigNumber: (s) => zetaNumeric(\n      s,\n      value => new BigNumber(value),\n      () => {\n        // relTol is for example 1e-12. Extract the positive exponent 12 from that\n        return Math.abs(Math.log10(config.relTol))\n      }\n    ),\n    Complex: zetaComplex\n  })\n\n  /**\n   * @param {number | BigNumber} s\n   * @param {(value: number) => number | BigNumber} createValue\n   * @param {(value: number | BigNumber | Complex) => number} determineDigits\n   * @returns {number | BigNumber}\n   */\n  function zetaNumeric (s, createValue, determineDigits) {\n    if (equal(s, 0)) {\n      return createValue(-0.5)\n    }\n    if (equal(s, 1)) {\n      return createValue(NaN)\n    }\n    if (!isFinite(s)) {\n      return isNegative(s) ? createValue(NaN) : createValue(1)\n    }\n\n    return zeta(s, createValue, determineDigits, s => s)\n  }\n\n  /**\n   * @param {Complex} s\n   * @returns {Complex}\n   */\n  function zetaComplex (s) {\n    if (s.re === 0 && s.im === 0) {\n      return new Complex(-0.5)\n    }\n    if (s.re === 1) {\n      return new Complex(NaN, NaN)\n    }\n    if (s.re === Infinity && s.im === 0) {\n      return new Complex(1)\n    }\n    if (s.im === Infinity || s.re === -Infinity) {\n      return new Complex(NaN, NaN)\n    }\n\n    return zeta(s, value => value, s => Math.round(1.3 * 15 + 0.9 * Math.abs(s.im)), s => s.re)\n  }\n\n  /**\n   * @param {number | BigNumber | Complex} s\n   * @param {(value: number) => number | BigNumber | Complex} createValue\n   * @param {(value: number | BigNumber | Complex) => number} determineDigits\n   * @param {(value: number | BigNumber | Complex) => number} getRe\n   * @returns {*|number}\n   */\n  function zeta (s, createValue, determineDigits, getRe) {\n    const n = determineDigits(s)\n    if (getRe(s) > -(n - 1) / 2) {\n      return f(s, createValue(n), createValue)\n    } else {\n      // Function Equation for reflection to x < 1\n      let c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)))\n      c = multiply(c, (sin(multiply(divide(createValue(pi), 2), s))))\n      c = multiply(c, gamma(subtract(1, s)))\n      return multiply(c, zeta(subtract(1, s), createValue, determineDigits, getRe))\n    }\n  }\n\n  /**\n   * Calculate a portion of the sum\n   * @param {number | BigNumber} k   a positive integer\n   * @param {number | BigNumber} n   a positive integer\n   * @return {number}    the portion of the sum\n   **/\n  function d (k, n) {\n    let S = k\n    for (let j = k; smallerEq(j, n); j = add(j, 1)) {\n      const factor = divide(\n        multiply(factorial(add(n, subtract(j, 1))), pow(4, j)),\n        multiply(factorial(subtract(n, j)), factorial(multiply(2, j)))\n      )\n      S = add(S, factor)\n    }\n\n    return multiply(n, S)\n  }\n\n  /**\n   * Calculate the positive Riemann Zeta function\n   * @param {number} s   a real or complex number with s.re > 1\n   * @param {number} n   a positive integer\n   * @param {(number) => number | BigNumber | Complex} createValue\n   * @return {number}    Riemann Zeta of s\n   **/\n  function f (s, n, createValue) {\n    const c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))))\n    let S = createValue(0)\n    for (let k = createValue(1); smallerEq(k, n); k = add(k, 1)) {\n      S = add(S, divide(multiply((-1) ** (k - 1), d(k, n)), pow(k, s)))\n    }\n    return multiply(c, S)\n  }\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'mode'\nconst dependencies = ['typed', 'isNaN', 'isNumeric']\n\nexport const createMode = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNaN: mathIsNaN, isNumeric }) => {\n  /**\n  * Computes the mode of a set of numbers or a list with values(numbers or characters).\n  * If there are multiple modes, it returns a list of those values.\n  *\n  * Syntax:\n  *\n  *     math.mode(a, b, c, ...)\n  *     math.mode(A)\n  *\n  * Examples:\n  *\n  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]\n  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]\n  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]\n  *     math.mode('a','a','b','c')                           // returns [\"a\"]\n  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, \"abc\"]\n  *\n  * See also:\n  *\n  *     median,\n  *     mean\n  *\n  * @param {... *} args  A single matrix\n  * @return {*} The mode of all values\n  */\n  return typed(name, {\n    'Array | Matrix': _mode,\n\n    '...': function (args) {\n      return _mode(args)\n    }\n  })\n\n  /**\n   * Calculates the mode in an 1-dimensional array\n   * @param {Array} values\n   * @return {Array} mode\n   * @private\n   */\n  function _mode (values) {\n    values = flatten(values.valueOf())\n    const num = values.length\n    if (num === 0) {\n      throw new Error('Cannot calculate mode of an empty array')\n    }\n\n    const count = {}\n    let mode = []\n    let max = 0\n    for (let i = 0; i < values.length; i++) {\n      const value = values[i]\n\n      if (isNumeric(value) && mathIsNaN(value)) {\n        throw new Error('Cannot calculate mode of an array containing NaN values')\n      }\n\n      if (!(value in count)) {\n        count[value] = 0\n      }\n\n      count[value]++\n\n      if (count[value] === max) {\n        mode.push(value)\n      } else if (count[value] > max) {\n        max = count[value]\n        mode = [value]\n      }\n    }\n    return mode\n  }\n})\n","import { typeOf } from '../../../utils/is.js'\n\n/**\n * Improve error messages for statistics functions. Errors are typically\n * thrown in an internally used function like larger, causing the error\n * not to mention the function (like max) which is actually used by the user.\n *\n * @param {Error} err\n * @param {String} fnName\n * @param {*} [value]\n * @return {Error}\n */\nexport function improveErrorMessage (err, fnName, value) {\n  // TODO: add information with the index (also needs transform in expression parser)\n  let details\n\n  if (String(err).includes('Unexpected type')) {\n    details = arguments.length > 2\n      ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')'\n      : ' (type: ' + err.data.actual + ')'\n\n    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details)\n  }\n\n  if (String(err).includes('complex numbers')) {\n    details = arguments.length > 2\n      ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')'\n      : ''\n\n    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details)\n  }\n\n  return err\n}\n","import { deepForEach } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'prod'\nconst dependencies = ['typed', 'config', 'multiplyScalar', 'numeric']\n\nexport const createProd = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, multiplyScalar, numeric }) => {\n  /**\n   * Compute the product of a matrix or a list with values.\n   * In case of a multidimensional array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.prod(a, b, c, ...)\n   *     math.prod(A)\n   *\n   * Examples:\n   *\n   *     math.multiply(2, 3)           // returns 6\n   *     math.prod(2, 3)               // returns 6\n   *     math.prod(2, 3, 4)            // returns 24\n   *     math.prod([2, 3, 4])          // returns 24\n   *     math.prod([[2, 5], [4, 3]])   // returns 120\n   *\n   * See also:\n   *\n   *    mean, median, min, max, sum, std, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The product of all values\n   */\n  return typed(name, {\n    // prod([a, b, c, d, ...])\n    'Array | Matrix': _prod,\n\n    // prod([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      // TODO: implement prod(A, dim)\n      throw new Error('prod(A, dim) is not yet supported')\n      // return reduce(arguments[0], arguments[1], math.prod)\n    },\n\n    // prod(a, b, c, d, ...)\n    '...': function (args) {\n      return _prod(args)\n    }\n  })\n\n  /**\n   * Recursively calculate the product of an n-dimensional array\n   * @param {Array} array\n   * @return {number} prod\n   * @private\n   */\n  function _prod (array) {\n    let prod\n\n    deepForEach(array, function (value) {\n      try {\n        prod = (prod === undefined) ? value : multiplyScalar(prod, value)\n      } catch (err) {\n        throw improveErrorMessage(err, 'prod', value)\n      }\n    })\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof prod === 'string') {\n      prod = numeric(prod, safeNumberType(prod, config))\n    }\n\n    if (prod === undefined) {\n      throw new Error('Cannot calculate prod of an empty array')\n    }\n\n    return prod\n  }\n})\n","import { format as formatString } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'format'\nconst dependencies = ['typed']\n\nexport const createFormat = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Format a value of any type into a string.\n   *\n   * Syntax:\n   *\n   *    math.format(value)\n   *    math.format(value, options)\n   *    math.format(value, precision)\n   *    math.format(value, callback)\n   *\n   * Where:\n   *\n   *  - `value: *`\n   *    The value to be formatted\n   *  - `options: Object`\n   *    An object with formatting options. Available options:\n   *    - `notation: string`\n   *      Number notation. Choose from:\n   *      - `'fixed'`\n   *        Always use regular number notation.\n   *        For example `'123.40'` and `'14000000'`\n   *      - `'exponential'`\n   *        Always use exponential notation.\n   *        For example `'1.234e+2'` and `'1.4e+7'`\n   *      - `'engineering'`\n   *        Always use engineering notation: always have exponential notation,\n   *        and select the exponent to be a multiple of `3`.\n   *        For example `'123.4e+0'` and `'14.0e+6'`\n   *      - `'auto'` (default)\n   *        Regular number notation for numbers having an absolute value between\n   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.\n   *        Lower bound is included, upper bound is excluded.\n   *        For example `'123.4'` and `'1.4e7'`.\n   *      - `'bin'`, `'oct'`, or `'hex'`\n   *        Format the number using binary, octal, or hexadecimal notation.\n   *        For example `'0b1101'` and `'0x10fe'`.\n   *    - `wordSize: number | BigNumber`\n   *      The word size in bits to use for formatting in binary, octal, or\n   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`\n   *      values for `notation` option. When this option is defined the value\n   *      is formatted as a signed twos complement integer of the given word\n   *      size and the size suffix is appended to the output.\n   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.\n   *      Default value is undefined.\n   *    - `precision: number | BigNumber`\n   *      Limit the number of digits of the formatted value.\n   *      For regular numbers, must be a number between `0` and `16`.\n   *      For bignumbers, the maximum depends on the configured precision,\n   *      see function `config()`.\n   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,\n   *      `precision` defines the total number of significant digits returned.\n   *      In case of notation `'fixed'`, `precision` defines the number of\n   *      significant digits after the decimal point.\n   *      `precision` is undefined by default.\n   *    - `lowerExp: number`\n   *      Exponent determining the lower boundary for formatting a value with\n   *      an exponent when `notation='auto'`. Default value is `-3`.\n   *    - `upperExp: number`\n   *      Exponent determining the upper boundary for formatting a value with\n   *      an exponent when `notation='auto'`. Default value is `5`.\n   *    - `fraction: string`. Available values: `'ratio'` (default) or `'decimal'`.\n   *      For example `format(fraction(1, 3))` will output `'1/3'` when `'ratio'`\n   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.\n   *    - `truncate: number`. Specifies the maximum allowed length of the\n   *      returned string. If it had been longer, the excess characters\n   *      are deleted and replaced with `'...'`.\n   * - `callback: function`\n   *   A custom formatting function, invoked for all numeric elements in `value`,\n   *   for example all elements of a matrix, or the real and imaginary\n   *   parts of a complex number. This callback can be used to override the\n   *   built-in numeric notation with any type of formatting. Function `callback`\n   *   is called with `value` as parameter and must return a string.\n   *\n   * When `value` is an Object:\n   *\n   * - When the object contains a property `format` being a function, this function\n   *   is invoked as `value.format(options)` and the result is returned.\n   * - When the object has its own `toString` method, this method is invoked\n   *   and the result is returned.\n   * - In other cases the function will loop over all object properties and\n   *   return JSON object notation like '{\"a\": 2, \"b\": 3}'.\n   *\n   * When value is a function:\n   *\n   * - When the function has a property `syntax`, it returns this\n   *   syntax description.\n   * - In other cases, a string `'function'` is returned.\n   *\n   * Examples:\n   *\n   *    math.format(6.4)                                        // returns '6.4'\n   *    math.format(1240000)                                    // returns '1.24e+6'\n   *    math.format(1/3)                                        // returns '0.3333333333333333'\n   *    math.format(1/3, 3)                                     // returns '0.333'\n   *    math.format(21385, 2)                                   // returns '21000'\n   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'\n   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'\n   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'\n   *    math.format(12400, {notation: 'engineering'})           // returns '12.4e+3'\n   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'\n   *\n   *    function formatCurrency(value) {\n   *      // return currency notation with two digits:\n   *      return '$' + value.toFixed(2)\n   *\n   *      // you could also use math.format inside the callback:\n   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})\n   *    }\n   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'\n   *\n   * See also:\n   *\n   *    print\n   *\n   * @param {*} value                               Value to be stringified\n   * @param {Object | Function | number} [options]  Formatting options\n   * @return {string} The formatted value\n   */\n  return typed(name, {\n    any: formatString,\n    'any, Object | function | number | BigNumber': formatString\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'bin'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as binary.\n *\n * Syntax:\n *\n *    math.bin(value)\n *\n * Examples:\n *\n *    //the following outputs \"0b10\"\n *    math.bin(2)\n *\n * See also:\n *\n *    oct\n *    hex\n *\n * @param {number | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport const createBin = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'bin' })\n    },\n    'number | BigNumber, number | BigNumber': function (n, wordSize) {\n      return format(n, { notation: 'bin', wordSize })\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'oct'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as octal.\n *\n * Syntax:\n *\n *    math.oct(value)\n *\n * Examples:\n *\n *    //the following outputs \"0o70\"\n *    math.oct(56)\n *\n * See also:\n *\n *    bin\n *    hex\n *\n * @param {number | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\n\nexport const createOct = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'oct' })\n    },\n    'number | BigNumber, number | BigNumber': function (n, wordSize) {\n      return format(n, { notation: 'oct', wordSize })\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'hex'\nconst dependencies = ['typed', 'format']\n\n/**\n * Format a number as hexadecimal.\n *\n * Syntax:\n *\n *    math.hex(value)\n *\n * Examples:\n *\n *    math.hex(240) // returns \"0xf0\"\n *\n * See also:\n *\n *    oct\n *    bin\n *\n * @param {number | BigNumber} value    Value to be stringified\n * @param {number | BigNumber} wordSize Optional word size (see `format`)\n * @return {string}         The formatted value\n */\nexport const createHex = factory(name, dependencies, ({ typed, format }) => {\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      return format(n, { notation: 'hex' })\n    },\n    'number | BigNumber, number | BigNumber': function (n, wordSize) {\n      return format(n, { notation: 'hex', wordSize })\n    }\n  })\n})\n","export const printTemplate = /\\$([\\w.]+)/g\n","import { format } from '../../utils/string.js'\nimport { isString } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { printTemplate } from '../../utils/print.js'\n\nconst name = 'print'\nconst dependencies = ['typed']\n\nexport const createPrint = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Interpolate values into a string template.\n   *\n   * Syntax:\n   *\n   *     math.print(template, values)\n   *     math.print(template, values, precision)\n   *     math.print(template, values, options)\n   *\n   * Example usage:\n   *\n   *     // the following outputs: 'Lucy is 5 years old'\n   *     math.print('Lucy is $age years old', {age: 5})\n   *\n   *     // the following outputs: 'The value of pi is 3.141592654'\n   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)\n   *\n   *     // the following outputs: 'Hello Mary! The date is 2013-03-23'\n   *     math.print('Hello $user.name! The date is $date', {\n   *       user: {\n   *         name: 'Mary',\n   *       },\n   *       date: '2013-03-23'\n   *     })\n   *\n   *     // the following outputs: 'My favorite fruits are apples and bananas !'\n   *     math.print('My favorite fruits are $0 and $1 !', [\n   *       'apples',\n   *       'bananas'\n   *     ])\n   *\n   * See also:\n   *\n   *     format\n   *\n   * @param {string} template           A string containing variable placeholders.\n   * @param {Object | Array | Matrix}   values An object or array containing variables\n   *                                    which will be filled in in the template.\n   * @param {number | Object} [options] Formatting options,\n   *                                    or the number of digits to format numbers.\n   *                                    See function math.format for a description\n   *                                    of all options.\n   * @return {string} Interpolated string\n   */\n  return typed(name, {\n    // note: Matrix will be converted automatically to an Array\n    'string, Object | Array': _print,\n    'string, Object | Array, number | Object': _print\n  })\n})\n\n/**\n * Interpolate values into a string template.\n * @param {string} template\n * @param {Object} values\n * @param {number | Object} [options]\n * @returns {string} Interpolated string\n * @private\n */\nfunction _print (template, values, options) {\n  return template.replace(printTemplate, function (original, key) {\n    const keys = key.split('.')\n    let value = values[keys.shift()]\n    if (value !== undefined && value.isMatrix) {\n      value = value.toArray()\n    }\n    while (keys.length && value !== undefined) {\n      const k = keys.shift()\n      value = k ? value[k] : value + '.'\n    }\n\n    if (value !== undefined) {\n      if (!isString(value)) {\n        return format(value, options)\n      } else {\n        return value\n      }\n    }\n\n    return original\n  }\n  )\n}\n","import { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'to'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'concat'\n]\n\nexport const createTo = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, concat }) => {\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Change the unit of a value.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.to(x, unit)\n   *\n   * Examples:\n   *\n   *    math.to(math.unit('2 inch'), 'cm')             // returns Unit 5.08 cm\n   *    math.to(math.unit('2 inch'), math.unit('cm'))  // returns Unit 5.08 cm\n   *    math.to(math.unit(16, 'bytes'), 'bits')        // returns Unit 128 bits\n   *\n   * See also:\n   *\n   *    unit\n   *\n   * @param {Unit | Array | Matrix} x     The unit to be converted.\n   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like \"cm\"\n   *                                      or a unit without value.\n   * @return {Unit | Array | Matrix} value with changed, fixed unit.\n   */\n  return typed(\n    name,\n    { 'Unit, Unit | string': (x, unit) => x.to(unit) },\n    matrixAlgorithmSuite({ Ds: true })\n  )\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'toBest'\nconst dependencies = ['typed']\n\nexport const createToBest = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Converts a unit to the most appropriate display unit.\n   * When no preferred units are provided, the function automatically find the best prefix.\n   * When preferred units are provided, it converts to\n   * the unit that gives a value closest to 1.\n   *\n   * Syntax:\n   *\n   *    math.toBest(unit)\n   *    math.toBest(unit, unitList)\n   *    math.toBest(unit, unitList, options)\n   *\n   * Where:\n   * - `unitList` is an optional array of preferred target units as string or Unit.\n   * - `options` is an optional object with options, formed as follows:\n   * - `offset`: number | BigNumber\n   *\n   * Examples:\n   *\n   *   math.unit(0.05, 'm').toBest(['cm', 'mm'])                 // returns Unit 5 cm\n   *   math.unit(2 / 3, 'cm').toBest()                           // returns Unit 0.6666666666666666 cm\n   *   math.unit(10, 'm').toBest(['mm', 'km'], { offset: 1.5 })  // returns Unit 10000 mm\n   *\n   * See also:\n   *\n   *    unit, to, format\n   *\n   * @param {Unit} x                          The unit to be converted\n   * @param {Array<string>} [unitList=[]]     Optional array of preferred target units\n   * @param {Object} [options]                Optional options object\n   * @return {Unit}                           Value converted to the best matching unit\n   */\n  return typed(name, {\n    Unit: x => x.toBest(),\n    'Unit, string': (x, unitList) => x.toBest(unitList.split(',')),\n    'Unit, string, Object': (x, unitList, options) => x.toBest(unitList.split(','), options),\n    'Unit, Array': (x, unitList) => x.toBest(unitList),\n    'Unit, Array, Object': (x, unitList, options) => x.toBest(unitList, options)\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'isPrime'\nconst dependencies = ['typed']\n\nexport const createIsPrime = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Test whether a value is prime: has no divisors other than itself and one.\n   * The function supports type `number`, `bignumber`.\n   *\n   * The function is evaluated element-wise in case of Array or Matrix input.\n   *\n   * Syntax:\n   *\n   *     math.isPrime(x)\n   *\n   * Examples:\n   *\n   *    math.isPrime(3)                     // returns true\n   *    math.isPrime(-2)                    // returns false\n   *    math.isPrime(0)                     // returns false\n   *    math.isPrime(-0)                    // returns false\n   *    math.isPrime(0.5)                   // returns false\n   *    math.isPrime('2')                   // returns true\n   *    math.isPrime([2, 17, 100])           // returns [true, true, false]\n   *\n   * See also:\n   *\n   *    isNumeric, isZero, isNegative, isInteger\n   *\n   * @param {number | BigNumber | bigint | Array | Matrix} x  Value to be tested\n   * @return {boolean}  Returns true when `x` is larger than zero.\n   *                    Throws an error in case of an unknown data type.\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x <= 3) {\n        return x > 1\n      }\n      if (x % 2 === 0 || x % 3 === 0) {\n        return false\n      }\n      for (let i = 5; i * i <= x; i += 6) {\n        if (x % i === 0 || x % (i + 2) === 0) {\n          return false\n        }\n      }\n      return true\n    },\n\n    bigint: function (x) {\n      if (x <= 3n) {\n        return x > 1n\n      }\n      if (x % 2n === 0n || x % 3n === 0n) {\n        return false\n      }\n      for (let i = 5n; i * i <= x; i += 6n) {\n        if (x % i === 0n || x % (i + 2n) === 0n) {\n          return false\n        }\n      }\n      return true\n    },\n\n    BigNumber: function (n) {\n      if (n.lte(3)) return n.gt(1)\n      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false\n      if (n.lt(Math.pow(2, 32))) {\n        const x = n.toNumber()\n        for (let i = 5; i * i <= x; i += 6) {\n          if (x % i === 0 || x % (i + 2) === 0) {\n            return false\n          }\n        }\n        return true\n      }\n\n      function modPow (base, exponent, modulus) {\n        // exponent can be huge, use non-recursive variant\n        let accumulator = 1\n        while (!exponent.eq(0)) {\n          if (exponent.mod(2).eq(0)) {\n            exponent = exponent.div(2)\n            base = base.mul(base).mod(modulus)\n          } else {\n            exponent = exponent.sub(1)\n            accumulator = base.mul(accumulator).mod(modulus)\n          }\n        }\n        return accumulator\n      }\n\n      // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants\n      const Decimal = n.constructor.clone({ precision: n.toFixed(0).length * 2 })\n      n = new Decimal(n)\n      let r = 0\n      let d = n.sub(1)\n      while (d.mod(2).eq(0)) {\n        d = d.div(2)\n        r += 1\n      }\n      let bases = null\n      // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases\n      if (n.lt('3317044064679887385961981')) {\n        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(x => x < n)\n      } else {\n        const max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)))\n        bases = []\n        for (let i = 2; i <= max; i += 1) {\n          bases.push(max)\n        }\n      }\n      for (let i = 0; i < bases.length; i += 1) {\n        const a = bases[i]\n        const adn = modPow(n.sub(n).add(a), d, n)\n        if (!adn.eq(1)) {\n          for (let i = 0, x = adn; !x.eq(n.sub(1)); i += 1, x = x.mul(x).mod(n)) {\n            if (i === r - 1) {\n              return false\n            }\n          }\n        }\n      }\n      return true\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { noBignumber, noFraction } from '../../utils/noop.js'\n\nconst name = 'numeric'\nconst dependencies = ['number', '?bignumber', '?fraction']\n\nexport const createNumeric = /* #__PURE__ */ factory(name, dependencies, ({ number, bignumber, fraction }) => {\n  const validInputTypes = {\n    string: true,\n    number: true,\n    BigNumber: true,\n    Fraction: true\n  }\n\n  // Load the conversion functions for each output type\n  const validOutputTypes = {\n    number: (x) => number(x),\n    BigNumber: bignumber\n      ? (x) => bignumber(x)\n      : noBignumber,\n    bigint: (x) => BigInt(x),\n    Fraction: fraction\n      ? (x) => fraction(x)\n      : noFraction\n  }\n\n  /**\n   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.\n   *\n   * Syntax:\n   *\n   *    math.numeric(x)\n   *    math.numeric(value, outputType)\n   *\n   * Examples:\n   *\n   *    math.numeric('4')                           // returns 4\n   *    math.numeric('4', 'number')                 // returns 4\n   *    math.numeric('4', 'bigint')                 // returns 4n\n   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4\n   *    math.numeric('4', 'Fraction')               // returns Fraction 4\n   *    math.numeric(4, 'Fraction')                 // returns Fraction 4\n   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4\n   *\n   * See also:\n   *\n   *    number, fraction, bignumber, bigint, string, format\n   *\n   * @param {string | number | BigNumber | bigint | Fraction } value\n   *              A numeric value or a string containing a numeric value\n   * @param {string} outputType\n   *              Desired numeric output type.\n   *              Available values: 'number', 'BigNumber', or 'Fraction'\n   * @return {number | BigNumber | bigint | Fraction}\n   *              Returns an instance of the numeric in the requested type\n   */\n  return function numeric (value, outputType = 'number', check) {\n    if (check !== undefined) {\n      throw new SyntaxError('numeric() takes one or two arguments')\n    }\n    const inputType = typeOf(value)\n\n    if (!(inputType in validInputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' of type \"' + inputType + '\"; valid input types are ' + Object.keys(validInputTypes).join(', '))\n    }\n    if (!(outputType in validOutputTypes)) {\n      throw new TypeError('Cannot convert ' + value + ' to type \"' + outputType + '\"; valid output types are ' + Object.keys(validOutputTypes).join(', '))\n    }\n\n    if (outputType === inputType) {\n      return value\n    } else {\n      return validOutputTypes[outputType](value)\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'divideScalar'\nconst dependencies = ['typed', 'numeric']\n\nexport const createDivideScalar = /* #__PURE__ */ factory(name, dependencies, ({ typed, numeric }) => {\n  /**\n   * Divide two scalar values, `x / y`.\n   * This function is meant for internal use: it is used by the public functions\n   * `divide` and `inv`.\n   *\n   * This function does not support collections (Array or Matrix).\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Quotient, `x / y`\n   * @private\n   */\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x / y\n    },\n\n    'Complex, Complex': function (x, y) {\n      return x.div(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      return x.div(y)\n    },\n\n    'bigint, bigint': function (x, y) {\n      return x / y\n    },\n\n    'Fraction, Fraction': function (x, y) {\n      return x.div(y)\n    },\n\n    'Unit, number | Complex | Fraction | BigNumber | Unit':\n      (x, y) => x.divide(y),\n\n    'number | Fraction | Complex | BigNumber, Unit':\n    (x, y) => y.divideInto(x)\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { arraySize as size } from '../../utils/array.js'\nimport { powNumber } from '../../plain/number/index.js'\n\nconst name = 'pow'\nconst dependencies = [\n  'typed',\n  'config',\n  'identity',\n  'multiply',\n  'matrix',\n  'inv',\n  'fraction',\n  'number',\n  'Complex'\n]\n\nexport const createPow = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, identity, multiply, matrix, inv, number, fraction, Complex }) => {\n  /**\n   * Calculates the power of x to y, `x ^ y`.\n   *\n   * Matrix exponentiation is supported for square matrices `x` and integers `y`:\n   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is\n   * negative, `x` must be invertible, and then this function returns\n   * inv(x)^(-y).\n   *\n   * For cubic roots of negative numbers, the function returns the principal\n   * root by default. In order to let the function return the real root,\n   * math.js can be configured with `math.config({predictable: true})`.\n   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.\n   *\n   * Syntax:\n   *\n   *    math.pow(x, y)\n   *\n   * Examples:\n   *\n   *    math.pow(2, 3)               // returns number 8\n   *\n   *    const a = math.complex(2, 3)\n   *    math.pow(a, 2)                // returns Complex -5 + 12i\n   *\n   *    const b = [[1, 2], [4, 3]]\n   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   *    const c = [[1, 2], [4, 3]]\n   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]\n   *\n   * See also:\n   *\n   *    multiply, sqrt, cbrt, nthRoot\n   *\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | bigint | Complex} y                          The exponent\n   * @return {number | BigNumber | bigint | Complex | Array | Matrix} The value of `x` to the power `y`\n   */\n  return typed(name, {\n    'number, number': _pow,\n\n    'Complex, Complex': function (x, y) {\n      return x.pow(y)\n    },\n\n    'BigNumber, BigNumber': function (x, y) {\n      if (y.isInteger() || x >= 0 || config.predictable) {\n        return x.pow(y)\n      } else {\n        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0)\n      }\n    },\n\n    'bigint, bigint': (x, y) => x ** y,\n\n    'Fraction, Fraction': function (x, y) {\n      const result = x.pow(y)\n\n      if (result != null) {\n        return result\n      }\n\n      if (config.predictable) {\n        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction')\n      } else {\n        return _pow(x.valueOf(), y.valueOf())\n      }\n    },\n\n    'Array, number': _powArray,\n\n    'Array, BigNumber': function (x, y) {\n      return _powArray(x, y.toNumber())\n    },\n\n    'Matrix, number': _powMatrix,\n\n    'Matrix, BigNumber': function (x, y) {\n      return _powMatrix(x, y.toNumber())\n    },\n\n    'Unit, number | BigNumber': function (x, y) {\n      return x.pow(y)\n    }\n\n  })\n\n  /**\n   * Calculates the power of x to y, x^y, for two numbers.\n   * @param {number} x\n   * @param {number} y\n   * @return {number | Complex} res\n   * @private\n   */\n  function _pow (x, y) {\n    // Alternatively could define a 'realmode' config option or something, but\n    // 'predictable' will work for now\n    if (config.predictable && !isInteger(y) && x < 0) {\n      // Check to see if y can be represented as a fraction\n      try {\n        const yFrac = fraction(y)\n        const yNum = number(yFrac)\n        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {\n          if (yFrac.d % 2n === 1n) {\n            return ((yFrac.n % 2n === 0n) ? 1 : -1) * Math.pow(-x, y)\n          }\n        }\n      } catch (ex) {\n        // fraction() throws an error if y is Infinity, etc.\n      }\n\n      // Unable to express y as a fraction, so continue on\n    }\n\n    // **for predictable mode** x^Infinity === NaN if x < -1\n    // N.B. this behavour is different from `Math.pow` which gives\n    // (-2)^Infinity === Infinity\n    if (config.predictable &&\n        ((x < -1 && y === Infinity) ||\n         (x > -1 && x < 0 && y === -Infinity))) {\n      return NaN\n    }\n\n    if (isInteger(y) || x >= 0 || config.predictable) {\n      return powNumber(x, y)\n    } else {\n      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow\n\n      // x^Infinity === 0 if -1 < x < 1\n      // A real number 0 is returned instead of complex(0)\n      if ((x * x < 1 && y === Infinity) ||\n        (x * x > 1 && y === -Infinity)) {\n        return 0\n      }\n\n      return new Complex(x, 0).pow(y, 0)\n    }\n  }\n\n  /**\n   * Calculate the power of a 2d array\n   * @param {Array} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a integer value (positive if `x` is not invertible)\n   * @returns {Array}\n   * @private\n   */\n  function _powArray (x, y) {\n    if (!isInteger(y)) {\n      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')')\n    }\n    // verify that A is a 2 dimensional square matrix\n    const s = size(x)\n    if (s.length !== 2) {\n      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)')\n    }\n    if (s[0] !== s[1]) {\n      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')')\n    }\n    if (y < 0) {\n      try {\n        return _powArray(inv(x), -y)\n      } catch (error) {\n        if (error.message === 'Cannot calculate inverse, determinant is zero') {\n          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')')\n        }\n        throw error\n      }\n    }\n\n    let res = identity(s[0]).valueOf()\n    let px = x\n    while (y >= 1) {\n      if ((y & 1) === 1) {\n        res = multiply(px, res)\n      }\n      y >>= 1\n      px = multiply(px, px)\n    }\n    return res\n  }\n\n  /**\n   * Calculate the power of a 2d matrix\n   * @param {Matrix} x     must be a 2 dimensional, square matrix\n   * @param {number} y    a positive, integer value\n   * @returns {Matrix}\n   * @private\n   */\n  function _powMatrix (x, y) {\n    return matrix(_powArray(x.valueOf(), y))\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { nearlyEqual, splitNumber } from '../../utils/number.js'\nimport { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { roundNumber } from '../../plain/number/index.js'\n\nconst NO_INT = 'Number of decimals in function round must be an integer'\n\nconst name = 'round'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'BigNumber',\n  'DenseMatrix'\n]\n\nexport const createRound = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, equalScalar, zeros, BigNumber, DenseMatrix }) => {\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  function toExponent (epsilon) {\n    return Math.abs(splitNumber(epsilon).exponent)\n  }\n\n  /**\n   * Round a value towards the nearest rounded value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.round(x)\n   *    math.round(x, n)\n   *    math.round(unit, valuelessUnit)\n   *    math.round(unit, n, valuelessUnit)\n   *\n   * Examples:\n   *\n   *    math.round(3.22)             // returns number 3\n   *    math.round(3.82)             // returns number 4\n   *    math.round(-4.2)             // returns number -4\n   *    math.round(-4.7)             // returns number -5\n   *    math.round(3.22, 1)          // returns number 3.2\n   *    math.round(3.88, 1)          // returns number 3.9\n   *    math.round(-4.21, 1)         // returns number -4.2\n   *    math.round(-4.71, 1)         // returns number -4.7\n   *    math.round(math.pi, 3)       // returns number 3.142\n   *    math.round(123.45678, 2)     // returns number 123.46\n   *\n   *    const c = math.complex(3.2, -2.7)\n   *    math.round(c)                // returns Complex 3 - 3i\n   *\n   *    const unit = math.unit('3.241 cm')\n   *    const cm = math.unit('cm')\n   *    const mm = math.unit('mm')\n   *    math.round(unit, 1, cm)      // returns Unit 3.2 cm\n   *    math.round(unit, 1, mm)      // returns Unit 32.4 mm\n   *\n   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]\n   *\n   * See also:\n   *\n   *    ceil, fix, floor\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded\n   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals\n   * @param  {Unit} [valuelessUnit]                                        A valueless unit\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value\n   */\n  return typed(name, {\n    number: function (x) {\n      // Handle round off errors by first rounding to relTol precision\n      const xEpsilon = roundNumber(x, toExponent(config.relTol))\n      const xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x\n      return roundNumber(xSelected)\n    },\n\n    'number, number': function (x, n) {\n      // Same as number: unless user specifies more decimals than relTol\n      const epsilonExponent = toExponent(config.relTol)\n      if (n >= epsilonExponent) { return roundNumber(x, n) }\n\n      const xEpsilon = roundNumber(x, epsilonExponent)\n      const xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x\n      return roundNumber(xSelected, n)\n    },\n\n    'number, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      return new BigNumber(x).toDecimalPlaces(n.toNumber())\n    },\n\n    Complex: function (x) {\n      return x.round()\n    },\n\n    'Complex, number': function (x, n) {\n      if (n % 1) { throw new TypeError(NO_INT) }\n\n      return x.round(n)\n    },\n\n    'Complex, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      const _n = n.toNumber()\n      return x.round(_n)\n    },\n\n    BigNumber: function (x) {\n      // Handle round off errors by first rounding to relTol precision\n      const xEpsilon = new BigNumber(x).toDecimalPlaces(toExponent(config.relTol))\n      const xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x\n      return xSelected.toDecimalPlaces(0)\n    },\n\n    'BigNumber, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n\n      // Same as BigNumber: unless user specifies more decimals than relTol\n      const epsilonExponent = toExponent(config.relTol)\n      if (n >= epsilonExponent) { return x.toDecimalPlaces(n.toNumber()) }\n\n      const xEpsilon = x.toDecimalPlaces(epsilonExponent)\n      const xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x\n      return xSelected.toDecimalPlaces(n.toNumber())\n    },\n\n    // bigints can't be rounded\n    bigint: b => b,\n    'bigint, number': (b, _dummy) => b,\n    'bigint, BigNumber': (b, _dummy) => b,\n\n    Fraction: function (x) {\n      return x.round()\n    },\n\n    'Fraction, number': function (x, n) {\n      if (n % 1) { throw new TypeError(NO_INT) }\n      return x.round(n)\n    },\n\n    'Fraction, BigNumber': function (x, n) {\n      if (!n.isInteger()) { throw new TypeError(NO_INT) }\n      return x.round(n.toNumber())\n    },\n\n    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {\n      const valueless = x.toNumeric(unit)\n      return unit.multiply(self(valueless, n))\n    }),\n\n    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),\n\n    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, (value) => self(value, n, unit), true)\n    }),\n\n    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),\n\n    'Array | Matrix': typed.referToSelf(self => x => {\n      // deep map collection, skip zeros since round(0) = 0\n      return deepMap(x, self, true)\n    }),\n\n    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      return matAlgo11xS0s(x, n, self, false)\n    }),\n\n    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      return matAlgo14xDs(x, n, self, false)\n    }),\n\n    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), n, self, false).valueOf()\n    }),\n\n    'number | Complex | BigNumber | Fraction, SparseMatrix': typed.referToSelf(self => (x, n) => {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(n.size(), n.storage())\n      }\n      return matAlgo12xSfs(n, x, self, true)\n    }),\n\n    'number | Complex | BigNumber | Fraction, DenseMatrix': typed.referToSelf(self => (x, n) => {\n      // check scalar is zero\n      if (equalScalar(x, 0)) {\n        // do not execute algorithm, result will be a zero matrix\n        return zeros(n.size(), n.storage())\n      }\n      return matAlgo14xDs(n, x, self, true)\n    }),\n\n    'number | Complex | BigNumber | Fraction, Array': typed.referToSelf(self => (x, n) => {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(n), x, self, true).valueOf()\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { promoteLogarithm } from '../../utils/bigint.js'\nimport { logNumber } from '../../plain/number/index.js'\n\nconst name = 'log'\nconst dependencies = ['config', 'typed', 'typeOf', 'divideScalar', 'Complex']\nconst nlg16 = Math.log(16)\n\nexport const createLog = /* #__PURE__ */ factory(name, dependencies, ({ typed, typeOf, config, divideScalar, Complex }) => {\n  /**\n   * Calculate the logarithm of a value.\n   *\n   * To avoid confusion with the matrix logarithm, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.log(x)\n   *    math.log(x, base)\n   *\n   * Examples:\n   *\n   *    math.log(3.5)                  // returns 1.252762968495368\n   *    math.exp(math.log(2.4))        // returns 2.4\n   *\n   *    math.pow(10, 4)                // returns 10000\n   *    math.log(10000, 10)            // returns 4\n   *    math.log(10000) / math.log(10) // returns 4\n   *\n   *    math.log(1024, 2)              // returns 10\n   *    math.pow(2, 10)                // returns 1024\n   *\n   * See also:\n   *\n   *    exp, log2, log10, log1p\n   *\n   * @param {number | BigNumber | Fraction | Complex} x\n   *            Value for which to calculate the logarithm.\n   * @param {number | BigNumber | Fraction | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x` is calculated.\n   * @return {number | BigNumber | Fraction | Complex}\n   *            Returns the logarithm of `x`\n   */\n  function complexLog (c) {\n    return c.log()\n  }\n\n  function complexLogNumber (x) {\n    return complexLog(new Complex(x, 0))\n  }\n\n  return typed(name, {\n    number: function (x) {\n      if (x >= 0 || config.predictable) {\n        return logNumber(x)\n      } else {\n        // negative value -> complex value computation\n        return complexLogNumber(x)\n      }\n    },\n\n    bigint: promoteLogarithm(nlg16, logNumber, config, complexLogNumber),\n\n    Complex: complexLog,\n\n    BigNumber: function (x) {\n      if (!x.isNegative() || config.predictable) {\n        return x.ln()\n      } else {\n        // downgrade to number, return Complex valued result\n        return complexLogNumber(x.toNumber())\n      }\n    },\n\n    'any, any': typed.referToSelf(self => (x, base) => {\n      // calculate logarithm for a specified base, log(x, base)\n\n      if (typeOf(x) === 'Fraction' && typeOf(base) === 'Fraction') {\n        const result = x.log(base)\n\n        if (result !== null) {\n          return result\n        }\n      }\n\n      return divideScalar(self(x), self(base))\n    })\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { deepMap } from '../../utils/collection.js'\nimport { log1p as _log1p } from '../../utils/number.js'\n\nconst name = 'log1p'\nconst dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex']\n\nexport const createLog1p = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, divideScalar, log, Complex }) => {\n  /**\n   * Calculate the logarithm of a `value+1`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.log1p(x)\n   *    math.log1p(x, base)\n   *\n   * Examples:\n   *\n   *    math.log1p(2.5)                 // returns 1.252762968495368\n   *    math.exp(math.log1p(1.4))       // returns 2.4\n   *\n   *    math.pow(10, 4)                 // returns 10000\n   *    math.log1p(9999, 10)            // returns 4\n   *    math.log1p(9999) / math.log(10) // returns 4\n   *\n   * See also:\n   *\n   *    exp, log, log2, log10\n   *\n   * @param {number | BigNumber | Complex | Array | Matrix} x\n   *            Value for which to calculate the logarithm of `x+1`.\n   * @param {number | BigNumber | Complex} [base=e]\n   *            Optional base for the logarithm. If not provided, the natural\n   *            logarithm of `x+1` is calculated.\n   * @return {number | BigNumber | Complex | Array | Matrix}\n   *            Returns the logarithm of `x+1`\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= -1 || config.predictable) {\n        return _log1p(x)\n      } else {\n        // negative value -> complex value computation\n        return _log1pComplex(new Complex(x, 0))\n      }\n    },\n\n    Complex: _log1pComplex,\n\n    BigNumber: function (x) {\n      const y = x.plus(1)\n      if (!y.isNegative() || config.predictable) {\n        return y.ln()\n      } else {\n        // downgrade to number, return Complex valued result\n        return _log1pComplex(new Complex(x.toNumber(), 0))\n      }\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self)),\n\n    'any, any': typed.referToSelf(self => (x, base) => {\n      // calculate logarithm for a specified base, log1p(x, base)\n      return divideScalar(self(x), log(base))\n    })\n  })\n\n  /**\n   * Calculate the natural logarithm of a complex number + 1\n   * @param {Complex} x\n   * @returns {Complex}\n   * @private\n   */\n  function _log1pComplex (x) {\n    const xRe1p = x.re + 1\n    return new Complex(\n      Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)),\n      Math.atan2(x.im, xRe1p)\n    )\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'nthRoots'\nconst dependencies = ['config', 'typed', 'divideScalar', 'Complex']\n\nexport const createNthRoots = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {\n  /**\n   * Each function here returns a real multiple of i as a Complex value.\n   * @param  {number} val\n   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3\n   */\n  // This is used to fix float artifacts for zero-valued components.\n  const _calculateExactResult = [\n    function realPos (val) { return new Complex(val, 0) },\n    function imagPos (val) { return new Complex(0, val) },\n    function realNeg (val) { return new Complex(-val, 0) },\n    function imagNeg (val) { return new Complex(0, -val) }\n  ]\n\n  /**\n   * Calculate the nth root of a Complex Number a using De Movire's Theorem.\n   * @param  {Complex} a\n   * @param  {number} root\n   * @return {Array} array of n Complex Roots\n   */\n  function _nthComplexRoots (a, root) {\n    if (root < 0) throw new Error('Root must be greater than zero')\n    if (root === 0) throw new Error('Root must be non-zero')\n    if (root % 1 !== 0) throw new Error('Root must be an integer')\n    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)]\n    const aIsNumeric = typeof (a) === 'number'\n    let offset\n    // determine the offset (argument of a)/(pi/2)\n    if (aIsNumeric || a.re === 0 || a.im === 0) {\n      if (aIsNumeric) {\n        offset = 2 * (+(a < 0)) // numeric value on the real axis\n      } else if (a.im === 0) {\n        offset = 2 * (+(a.re < 0)) // complex value on the real axis\n      } else {\n        offset = 2 * (+(a.im < 0)) + 1 // complex value on the imaginary axis\n      }\n    }\n    const arg = a.arg()\n    const abs = a.abs()\n    const roots = []\n    const r = Math.pow(abs, 1 / root)\n    for (let k = 0; k < root; k++) {\n      const halfPiFactor = (offset + 4 * k) / root\n      /**\n       * If (offset + 4*k)/root is an integral multiple of pi/2\n       * then we can produce a more exact result.\n       */\n      if (halfPiFactor === Math.round(halfPiFactor)) {\n        roots.push(_calculateExactResult[halfPiFactor % 4](r))\n        continue\n      }\n      roots.push(new Complex({ r, phi: (arg + 2 * Math.PI * k) / root }))\n    }\n    return roots\n  }\n\n  /**\n   * Calculate the nth roots of a value.\n   * An nth root of a positive real number A,\n   * is a positive real solution of the equation \"x^root = A\".\n   * This function returns an array of complex values.\n   *\n   * Syntax:\n   *\n   *    math.nthRoots(x)\n   *    math.nthRoots(x, root)\n   *\n   * Examples:\n   *\n   *    math.nthRoots(1)\n   *    // returns [\n   *    //   {re: 1, im: 0},\n   *    //   {re: -1, im: 0}\n   *    // ]\n   *    math.nthRoots(1, 3)\n   *    // returns [\n   *    //   { re: 1, im: 0 },\n   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },\n   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }\n   *    // ]\n   *\n   * See also:\n   *\n   *    nthRoot, pow, sqrt\n   *\n   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded\n   * @param {number} [root=2] Optional root, default value is 2\n   * @return {number | BigNumber | Fraction | Complex} Returns the nth roots\n   */\n  return typed(name, {\n    Complex: function (x) {\n      return _nthComplexRoots(x, 2)\n    },\n    'Complex, number': _nthComplexRoots\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'dotPow'\nconst dependencies = [\n  'typed',\n  'equalScalar',\n  'matrix',\n  'pow',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createDotPow = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar, matrix, pow, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  const powScalarSignatures = {}\n  for (const signature in pow.signatures) {\n    if (Object.prototype.hasOwnProperty.call(pow.signatures, signature)) {\n      if (!signature.includes('Matrix') && !signature.includes('Array')) {\n        powScalarSignatures[signature] = pow.signatures[signature]\n      }\n    }\n  }\n  const powScalar = typed(powScalarSignatures)\n\n  /**\n   * Calculates the power of x to y element wise.\n   *\n   * Syntax:\n   *\n   *    math.dotPow(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotPow(2, 3)            // returns number 8\n   *\n   *    const a = [[1, 2], [4, 3]]\n   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]\n   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]\n   *\n   * See also:\n   *\n   *    pow, sqrt, multiply\n   *\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base\n   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent\n   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`\n   */\n  return typed(name, matrixAlgorithmSuite({\n    elop: powScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }))\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'dotDivide'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'divideScalar',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createDotDivide = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, divideScalar, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Divide two matrices element wise. The function accepts both matrices and\n   * scalar values.\n   *\n   * Syntax:\n   *\n   *    math.dotDivide(x, y)\n   *\n   * Examples:\n   *\n   *    math.dotDivide(2, 4)   // returns 0.5\n   *\n   *    a = [[9, 5], [6, 1]]\n   *    b = [[3, 2], [5, 2]]\n   *\n   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]\n   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]\n   *\n   * See also:\n   *\n   *    divide, multiply, dotMultiply\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`\n   */\n  return typed(name, matrixAlgorithmSuite({\n    elop: divideScalar,\n    SS: matAlgo07xSSf,\n    DS: matAlgo03xDSf,\n    SD: matAlgo02xDS0,\n    Ss: matAlgo11xS0s,\n    sS: matAlgo12xSfs\n  }))\n})\n","import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js'\nimport { arraySize } from '../../../../utils/array.js'\nimport { format } from '../../../../utils/string.js'\n\nexport function createSolveValidation ({ DenseMatrix }) {\n  /**\n   * Validates matrix and column vector b for backward/forward substitution algorithms.\n   *\n   * @param {Matrix} m            An N x N matrix\n   * @param {Array | Matrix} b    A column vector\n   * @param {Boolean} copy        Return a copy of vector b\n   *\n   * @return {DenseMatrix}        Dense column vector b\n   */\n  return function solveValidation (m, b, copy) {\n    const mSize = m.size()\n\n    if (mSize.length !== 2) {\n      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')')\n    }\n\n    const rows = mSize[0]\n    const columns = mSize[1]\n\n    if (rows !== columns) {\n      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')')\n    }\n\n    let data = []\n\n    if (isMatrix(b)) {\n      const bSize = b.size()\n      const bdata = b._data\n\n      // 1-dim vector\n      if (bSize.length === 1) {\n        if (bSize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [bdata[i]]\n        }\n\n        return new DenseMatrix({\n          data,\n          size: [rows, 1],\n          datatype: b._datatype\n        })\n      }\n\n      // 2-dim column\n      if (bSize.length === 2) {\n        if (bSize[0] !== rows || bSize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        if (isDenseMatrix(b)) {\n          if (copy) {\n            data = []\n\n            for (let i = 0; i < rows; i++) {\n              data[i] = [bdata[i][0]]\n            }\n\n            return new DenseMatrix({\n              data,\n              size: [rows, 1],\n              datatype: b._datatype\n            })\n          }\n\n          return b\n        }\n\n        if (isSparseMatrix(b)) {\n          for (let i = 0; i < rows; i++) { data[i] = [0] }\n\n          const values = b._values\n          const index = b._index\n          const ptr = b._ptr\n\n          for (let k1 = ptr[1], k = ptr[0]; k < k1; k++) {\n            const i = index[k]\n            data[i][0] = values[k]\n          }\n\n          return new DenseMatrix({\n            data,\n            size: [rows, 1],\n            datatype: b._datatype\n          })\n        }\n      }\n\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.')\n    }\n\n    if (isArray(b)) {\n      const bsize = arraySize(b)\n\n      if (bsize.length === 1) {\n        if (bsize[0] !== rows) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [b[i]]\n        }\n\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        })\n      }\n\n      if (bsize.length === 2) {\n        if (bsize[0] !== rows || bsize[1] !== 1) {\n          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.')\n        }\n\n        for (let i = 0; i < rows; i++) {\n          data[i] = [b[i][0]]\n        }\n\n        return new DenseMatrix({\n          data,\n          size: [rows, 1]\n        })\n      }\n\n      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.')\n    }\n  }\n}\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'lsolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createLsolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtractScalar, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolve(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolve(a, b)  // [[-5.5], [20]]\n   *\n   * See also:\n   *\n   *    lsolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} L       A N x N matrix or array (L)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseForwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseForwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const r = _denseForwardSubstitution(m, b)\n      return r.valueOf()\n    }\n  })\n\n  function _denseForwardSubstitution (m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true)\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // result\n    const x = []\n\n    const mdata = m._data\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      const bj = bdata[j][0] || 0\n      let xj\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        const vjj = mdata[j][j]\n\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        xj = divideScalar(bj, vjj)\n\n        // loop rows\n        for (let i = j + 1; i < rows; i++) {\n          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))]\n        }\n      } else {\n        // degenerate row, we can choose any value\n        xj = 0\n      }\n\n      x[j] = [xj]\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n\n  function _sparseForwardSubstitution (m, b) {\n    // validate matrix and vector, return copy of column vector b\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // result\n    const x = []\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      const bj = bdata[j][0] || 0\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        let vjj = 0\n        // matrix values & indices (column j)\n        const jValues = []\n        const jIndices = []\n\n        // first and last index in the column\n        const firstIndex = ptr[j]\n        const lastIndex = ptr[j + 1]\n\n        // values in column, find value at [j, j]\n        for (let k = firstIndex; k < lastIndex; k++) {\n          const i = index[k]\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k]\n          } else if (i > j) {\n            // store lower triangular\n            jValues.push(values[k])\n            jIndices.push(i)\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        const xj = divideScalar(bj, vjj)\n\n        for (let k = 0, l = jIndices.length; k < l; k++) {\n          const i = jIndices[k]\n          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, jValues[k]))]\n        }\n\n        x[j] = [xj]\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0]\n      }\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'usolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createUsolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtractScalar, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolve(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolve(a, b)  // [[8], [9]]\n   *\n   * See also:\n   *\n   *    usolveAll, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseBackwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseBackwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const r = _denseBackwardSubstitution(m, b)\n      return r.valueOf()\n    }\n  })\n\n  function _denseBackwardSubstitution (m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // result\n    const x = []\n\n    const mdata = m._data\n    // loop columns backwards\n    for (let j = columns - 1; j >= 0; j--) {\n      // b[j]\n      const bj = bdata[j][0] || 0\n      // x[j]\n      let xj\n\n      if (!equalScalar(bj, 0)) {\n        // value at [j, j]\n        const vjj = mdata[j][j]\n\n        if (equalScalar(vjj, 0)) {\n          // system cannot be solved\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        xj = divideScalar(bj, vjj)\n\n        // loop rows\n        for (let i = j - 1; i >= 0; i--) {\n          // update copy of b\n          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))]\n        }\n      } else {\n        // zero value at j\n        xj = 0\n      }\n      // update x\n      x[j] = [xj]\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n\n  function _sparseBackwardSubstitution (m, b) {\n    // make b into a column vector\n    b = solveValidation(m, b, true)\n\n    const bdata = b._data\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // result\n    const x = []\n\n    // loop columns backwards\n    for (let j = columns - 1; j >= 0; j--) {\n      const bj = bdata[j][0] || 0\n\n      if (!equalScalar(bj, 0)) {\n        // non-degenerate row, find solution\n\n        let vjj = 0\n\n        // upper triangular matrix values & index (column j)\n        const jValues = []\n        const jIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[j]\n        const lastIndex = ptr[j + 1]\n\n        // values in column, find value at [j, j], loop backwards\n        for (let k = lastIndex - 1; k >= firstIndex; k--) {\n          const i = index[k]\n\n          // check row (rows are not sorted!)\n          if (i === j) {\n            vjj = values[k]\n          } else if (i < j) {\n            // store upper triangular\n            jValues.push(values[k])\n            jIndices.push(i)\n          }\n        }\n\n        // at this point we must have a value in vjj\n        if (equalScalar(vjj, 0)) {\n          throw new Error('Linear system cannot be solved since matrix is singular')\n        }\n\n        const xj = divideScalar(bj, vjj)\n\n        for (let k = 0, lastIndex = jIndices.length; k < lastIndex; k++) {\n          const i = jIndices[k]\n          bdata[i] = [subtractScalar(bdata[i][0], multiplyScalar(xj, jValues[k]))]\n        }\n\n        x[j] = [xj]\n      } else {\n        // degenerate row, we can choose any value\n        x[j] = [0]\n      }\n    }\n\n    return new DenseMatrix({\n      data: x,\n      size: [rows, 1]\n    })\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'lsolveAll'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createLsolveAll = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtractScalar, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.\n   *\n   * `L * x = b`\n   *\n   * Syntax:\n   *\n   *    math.lsolveAll(L, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]\n   *\n   * See also:\n   *\n   *    lsolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} L       A N x N matrix or array (L)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseForwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseForwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const R = _denseForwardSubstitution(m, b)\n      return R.map(r => r.valueOf())\n    }\n  })\n\n  function _denseForwardSubstitution (m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const M = m._data\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // loop columns\n    for (let i = 0; i < columns; i++) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i])\n\n          for (let j = i + 1; j < columns; j++) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = i + 1; j < columns; j++) {\n            bNew[j] = subtractScalar(bNew[j], M[j][i])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n\n  function _sparseForwardSubstitution (m, b_) {\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // loop columns\n    for (let i = 0; i < columns; i++) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        // values & indices (column i)\n        const iValues = []\n        const iIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[i]\n        const lastIndex = ptr[i + 1]\n\n        // find the value at [i, i]\n        let Mii = 0\n        for (let j = firstIndex; j < lastIndex; j++) {\n          const J = index[j]\n          // check row\n          if (J === i) {\n            Mii = values[j]\n          } else if (J > i) {\n            // store lower triangular\n            iValues.push(values[j])\n            iIndices.push(J)\n          }\n        }\n\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii)\n\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            b[J] = subtractScalar(b[J], multiplyScalar(b[i], iValues[j]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            bNew[J] = subtractScalar(bNew[J], iValues[j])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\n\nconst name = 'usolveAll'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'equalScalar',\n  'DenseMatrix'\n]\n\nexport const createUsolveAll = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, multiplyScalar, subtractScalar, equalScalar, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.\n   *\n   * `U * x = b`\n   *\n   * Syntax:\n   *\n   *    math.usolveAll(U, b)\n   *\n   * Examples:\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]\n   *\n   * See also:\n   *\n   *    usolve, lup, slu, usolve, lusolve\n   *\n   * @param {Matrix, Array} U       A N x N matrix or array (U)\n   * @param {Matrix, Array} b       A column vector with the b values\n   *\n   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system\n   */\n  return typed(name, {\n\n    'SparseMatrix, Array | Matrix': function (m, b) {\n      return _sparseBackwardSubstitution(m, b)\n    },\n\n    'DenseMatrix, Array | Matrix': function (m, b) {\n      return _denseBackwardSubstitution(m, b)\n    },\n\n    'Array, Array | Matrix': function (a, b) {\n      const m = matrix(a)\n      const R = _denseBackwardSubstitution(m, b)\n      return R.map(r => r.valueOf())\n    }\n  })\n\n  function _denseBackwardSubstitution (m, b_) {\n    // the algorithm is derived from\n    // https://www.overleaf.com/read/csvgqdxggyjv\n\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const M = m._data\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    // loop columns backwards\n    for (let i = columns - 1; i >= 0; i--) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        if (!equalScalar(M[i][i], 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], M[i][i])\n\n          for (let j = i - 1; j >= 0; j--) {\n            // b[j] -= b[i] * M[j,i]\n            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          for (let j = i - 1; j >= 0; j--) {\n            bNew[j] = subtractScalar(bNew[j], M[j][i])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n\n  function _sparseBackwardSubstitution (m, b_) {\n    // array of right-hand sides\n    const B = [solveValidation(m, b_, true)._data.map(e => e[0])]\n\n    const rows = m._size[0]\n    const columns = m._size[1]\n\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n\n    // loop columns backwards\n    for (let i = columns - 1; i >= 0; i--) {\n      let L = B.length\n\n      // loop right-hand sides\n      for (let k = 0; k < L; k++) {\n        const b = B[k]\n\n        // values & indices (column i)\n        const iValues = []\n        const iIndices = []\n\n        // first & last indeces in column\n        const firstIndex = ptr[i]\n        const lastIndex = ptr[i + 1]\n\n        // find the value at [i, i]\n        let Mii = 0\n        for (let j = lastIndex - 1; j >= firstIndex; j--) {\n          const J = index[j]\n          // check row\n          if (J === i) {\n            Mii = values[j]\n          } else if (J < i) {\n            // store upper triangular\n            iValues.push(values[j])\n            iIndices.push(J)\n          }\n        }\n\n        if (!equalScalar(Mii, 0)) {\n          // non-singular row\n\n          b[i] = divideScalar(b[i], Mii)\n\n          // loop upper triangular\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            b[J] = subtractScalar(b[J], multiplyScalar(b[i], iValues[j]))\n          }\n        } else if (!equalScalar(b[i], 0)) {\n          // singular row, nonzero RHS\n\n          if (k === 0) {\n            // There is no valid solution\n            return []\n          } else {\n            // This RHS is invalid but other solutions may still exist\n            B.splice(k, 1)\n            k -= 1\n            L -= 1\n          }\n        } else if (k === 0) {\n          // singular row, RHS is zero\n\n          const bNew = [...b]\n          bNew[i] = 1\n\n          // loop upper triangular\n          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {\n            const J = iIndices[j]\n            bNew[J] = subtractScalar(bNew[J], iValues[j])\n          }\n\n          B.push(bNew)\n        }\n      }\n    }\n\n    return B.map(x => new DenseMatrix({ data: x.map(e => [e]), size: [rows, 1] }))\n  }\n})\n","import { factory } from '../../../utils/factory.js'\nimport { DimensionError } from '../../../error/DimensionError.js'\n\nconst name = 'matAlgo08xS0Sid'\nconst dependencies = ['typed', 'equalScalar']\n\nexport const createMatAlgo08xS0Sid = /* #__PURE__ */ factory(name, dependencies, ({ typed, equalScalar }) => {\n  /**\n   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).\n   * Callback function invoked MAX(NNZA, NNZB) times\n   *\n   *\n   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0\n   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0\n   *          └  0            ; otherwise\n   *\n   *\n   * @param {Matrix}   a                 The SparseMatrix instance (A)\n   * @param {Matrix}   b                 The SparseMatrix instance (B)\n   * @param {Function} callback          The f(Aij,Bij) operation to invoke\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294\n   */\n  return function matAlgo08xS0Sid (a, b, callback) {\n    // sparse matrix arrays\n    const avalues = a._values\n    const aindex = a._index\n    const aptr = a._ptr\n    const asize = a._size\n    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType()\n    // sparse matrix arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    const bsize = b._size\n    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType()\n\n    // validate dimensions\n    if (asize.length !== bsize.length) { throw new DimensionError(asize.length, bsize.length) }\n\n    // check rows & columns\n    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) { throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')') }\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues || !bvalues) { throw new Error('Cannot perform operation on Pattern Sparse Matrices') }\n\n    // rows & columns\n    const rows = asize[0]\n    const columns = asize[1]\n\n    // datatype\n    let dt\n    // equal signature to use\n    let eq = equalScalar\n    // zero value\n    let zero = 0\n    // callback signature to use\n    let cf = callback\n\n    // process data types\n    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {\n      // datatype\n      dt = adt\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt])\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt)\n      // callback\n      cf = typed.find(callback, [dt, dt])\n    }\n\n    // result arrays\n    const cvalues = []\n    const cindex = []\n    const cptr = []\n\n    // workspace\n    const x = []\n    // marks indicating we have a value in x for a given column\n    const w = []\n\n    // vars\n    let k, k0, k1, i\n\n    // loop columns\n    for (let j = 0; j < columns; j++) {\n      // update cptr\n      cptr[j] = cindex.length\n      // columns mark\n      const mark = j + 1\n      // loop values in a\n      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = aindex[k]\n        // mark workspace\n        w[i] = mark\n        // set value\n        x[i] = avalues[k]\n        // add index\n        cindex.push(i)\n      }\n      // loop values in b\n      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        i = bindex[k]\n        // check value exists in workspace\n        if (w[i] === mark) {\n          // evaluate callback\n          x[i] = cf(x[i], bvalues[k])\n        }\n      }\n      // initialize first index in j\n      k = cptr[j]\n      // loop index in j\n      while (k < cindex.length) {\n        // row\n        i = cindex[k]\n        // value @ i\n        const v = x[i]\n        // check for zero value\n        if (!eq(v, zero)) {\n          // push value\n          cvalues.push(v)\n          // increment pointer\n          k++\n        } else {\n          // remove value @ i, do not increment pointer\n          cindex.splice(k, 1)\n        }\n      }\n    }\n    // update cptr\n    cptr[columns] = cindex.length\n\n    // return sparse matrix\n    return a.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined\n    })\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nexport const createUseMatrixForArrayScalar = /* #__PURE__ */ factory('useMatrixForArrayScalar', ['typed', 'matrix'], ({ typed, matrix }) => ({\n  'Array, number': typed.referTo('DenseMatrix, number',\n    selfDn => (x, y) => selfDn(matrix(x), y).valueOf()),\n\n  'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber',\n    selfDB => (x, y) => selfDB(matrix(x), y).valueOf()),\n\n  'number, Array': typed.referTo('number, DenseMatrix',\n    selfnD => (x, y) => selfnD(x, matrix(y)).valueOf()),\n\n  'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix',\n    selfBD => (x, y) => selfBD(x, matrix(y)).valueOf())\n}))\n","import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js'\nimport { leftShiftNumber } from '../../plain/number/index.js'\nimport { leftShiftBigNumber } from '../../utils/bignumber/bitwise.js'\n\nconst name = 'leftShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createLeftShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix, concat }) => {\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo08xS0Sid = createMatAlgo08xS0Sid({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const useMatrixForArrayScalar = createUseMatrixForArrayScalar({ typed, matrix })\n\n  /**\n   * Bitwise left logical shift of a value x by y number of bits, `x << y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.leftShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.leftShift(1, 2)               // returns number 4\n   *\n   *    math.leftShift([1, 2, 4], 4)       // returns Array [16, 32, 64]\n   *\n   * See also:\n   *\n   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber | bigint} y Amount of shifts\n   * @return {number | BigNumber | bigint | Array | Matrix} `x` shifted left `y` times\n   */\n  return typed(\n    name,\n    {\n      'number, number': leftShiftNumber,\n\n      'BigNumber, BigNumber': leftShiftBigNumber,\n\n      'bigint, bigint': (x, y) => x << y,\n\n      'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo11xS0s(x, y, self, false)\n      }),\n\n      'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo14xDs(x, y, self, false)\n      }),\n\n      'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo10xSids(y, x, self, true)\n      }),\n\n      'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo14xDs(y, x, self, true)\n      })\n    },\n    useMatrixForArrayScalar,\n    matrixAlgorithmSuite({\n      SS: matAlgo08xS0Sid,\n      DS: matAlgo01xDSid,\n      SD: matAlgo02xDS0\n    })\n  )\n})\n","import { rightArithShiftBigNumber } from '../../utils/bignumber/bitwise.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js'\nimport { rightArithShiftNumber } from '../../plain/number/index.js'\n\nconst name = 'rightArithShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createRightArithShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix, concat }) => {\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo08xS0Sid = createMatAlgo08xS0Sid({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const useMatrixForArrayScalar = createUseMatrixForArrayScalar({ typed, matrix })\n\n  /**\n   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightArithShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightArithShift(4, 2)               // returns number 1\n   *\n   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 4]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift\n   *\n   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted\n   * @param  {number | BigNumber | bigint} y Amount of shifts\n   * @return {number | BigNumber | bigint | Array | Matrix} `x` zero-filled shifted right `y` times\n   */\n  return typed(\n    name,\n    {\n      'number, number': rightArithShiftNumber,\n\n      'BigNumber, BigNumber': rightArithShiftBigNumber,\n\n      'bigint, bigint': (x, y) => x >> y,\n\n      'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo11xS0s(x, y, self, false)\n      }),\n\n      'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo14xDs(x, y, self, false)\n      }),\n\n      'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo10xSids(y, x, self, true)\n      }),\n\n      'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo14xDs(y, x, self, true)\n      })\n    },\n    useMatrixForArrayScalar,\n    matrixAlgorithmSuite({\n      SS: matAlgo08xS0Sid,\n      DS: matAlgo01xDSid,\n      SD: matAlgo02xDS0\n    })\n  )\n})\n","import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { rightLogShiftNumber } from '../../plain/number/index.js'\nimport { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js'\n\nconst name = 'rightLogShift'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createRightLogShift = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, DenseMatrix, concat }) => {\n  const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo08xS0Sid = createMatAlgo08xS0Sid({ typed, equalScalar })\n  const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const useMatrixForArrayScalar = createUseMatrixForArrayScalar({ typed, matrix })\n\n  /**\n   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.\n   * For matrices, the function is evaluated element wise.\n   * For units, the function is evaluated on the best prefix base.\n   *\n   * Syntax:\n   *\n   *    math.rightLogShift(x, y)\n   *\n   * Examples:\n   *\n   *    math.rightLogShift(4, 2)               // returns number 1\n   *\n   *    math.rightLogShift([16, 32, 64], 4)    // returns Array [1, 2, 4]\n   *\n   * See also:\n   *\n   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift\n   *\n   * @param  {number | Array | Matrix} x Value to be shifted\n   * @param  {number} y Amount of shifts\n   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times\n   */\n\n  return typed(\n    name,\n    {\n      'number, number': rightLogShiftNumber,\n\n      // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift\n\n      'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo11xS0s(x, y, self, false)\n      }),\n\n      'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(y, 0)) {\n          return x.clone()\n        }\n        return matAlgo14xDs(x, y, self, false)\n      }),\n\n      'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo10xSids(y, x, self, true)\n      }),\n\n      'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (equalScalar(x, 0)) {\n          return zeros(y.size(), y.storage())\n        }\n        return matAlgo14xDs(y, x, self, true)\n      })\n    },\n    useMatrixForArrayScalar,\n    matrixAlgorithmSuite({\n      SS: matAlgo08xS0Sid,\n      DS: matAlgo01xDSid,\n      SD: matAlgo02xDS0\n    })\n  )\n})\n","import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\nimport { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { andNumber } from '../../plain/number/index.js'\n\nconst name = 'and'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'zeros',\n  'not',\n  'concat'\n]\n\nexport const createAnd = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, not, concat }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo06xS0S0 = createMatAlgo06xS0S0({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.and(x, y)\n   *\n   * Examples:\n   *\n   *    math.and(2, 4)   // returns true\n   *\n   *    a = [2, 0, 0]\n   *    b = [3, 7, 0]\n   *    c = 0\n   *\n   *    math.and(a, b)   // returns [true, false, false]\n   *    math.and(a, c)   // returns [false, false, false]\n   *\n   * See also:\n   *\n   *    not, or, xor\n   *\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check\n   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check\n   * @return {boolean | Array | Matrix}\n   *            Returns true when both inputs are defined with a nonzero/nonempty value.\n   */\n  return typed(\n    name,\n    {\n      'number, number': andNumber,\n\n      'Complex, Complex': function (x, y) {\n        return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0)\n      },\n\n      'BigNumber, BigNumber': function (x, y) {\n        return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN()\n      },\n\n      'bigint, bigint': andNumber,\n\n      'Unit, Unit': typed.referToSelf(self =>\n        (x, y) => self(x.value || 0, y.value || 0)),\n\n      'SparseMatrix, any': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (not(y)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage())\n        }\n        return matAlgo11xS0s(x, y, self, false)\n      }),\n\n      'DenseMatrix, any': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (not(y)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage())\n        }\n        return matAlgo14xDs(x, y, self, false)\n      }),\n\n      'any, SparseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (not(x)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage())\n        }\n        return matAlgo11xS0s(y, x, self, true)\n      }),\n\n      'any, DenseMatrix': typed.referToSelf(self => (x, y) => {\n        // check scalar\n        if (not(x)) {\n          // return zero matrix\n          return zeros(x.size(), x.storage())\n        }\n        return matAlgo14xDs(y, x, self, true)\n      }),\n\n      'Array, any': typed.referToSelf(self => (x, y) => {\n        // use matrix implementation\n        return self(matrix(x), y).valueOf()\n      }),\n\n      'any, Array': typed.referToSelf(self => (x, y) => {\n        // use matrix implementation\n        return self(x, matrix(y)).valueOf()\n      })\n    },\n    matrixAlgorithmSuite({\n      SS: matAlgo06xS0S0,\n      DS: matAlgo02xDS0\n    })\n  )\n})\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'compare'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'Fraction',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createCompare = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, equalScalar, matrix, BigNumber, Fraction, DenseMatrix, concat }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo05xSfSf = createMatAlgo05xSfSf({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * x and y are considered equal when the relative difference between x and y\n   * is smaller than the configured absTol and relTol. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.compare(x, y)\n   *\n   * Examples:\n   *\n   *    math.compare(6, 1)           // returns 1\n   *    math.compare(2, 3)           // returns -1\n   *    math.compare(7, 7)           // returns 0\n   *    math.compare('10', '2')      // returns 1\n   *    math.compare('1000', '1e3')  // returns 0\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compare(a, b)           // returns 1\n   *\n   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} y Second value to compare\n   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the result of the comparison:\n   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(\n    name,\n    createCompareNumber({ typed, config }),\n    {\n      'boolean, boolean': function (x, y) {\n        return x === y ? 0 : (x > y ? 1 : -1)\n      },\n\n      'BigNumber, BigNumber': function (x, y) {\n        return bigNearlyEqual(x, y, config.relTol, config.absTol)\n          ? new BigNumber(0)\n          : new BigNumber(x.cmp(y))\n      },\n\n      'bigint, bigint': function (x, y) {\n        return x === y ? 0n : (x > y ? 1n : -1n)\n      },\n\n      'Fraction, Fraction': function (x, y) {\n        return new Fraction(x.compare(y))\n      },\n\n      'Complex, Complex': function () {\n        throw new TypeError('No ordering relation is defined for complex numbers')\n      }\n    },\n    compareUnits,\n    matrixAlgorithmSuite({\n      SS: matAlgo05xSfSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createCompareNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return nearlyEqual(x, y, config.relTol, config.absTol)\n        ? 0\n        : (x > y ? 1 : -1)\n    }\n  })\n})\n","import naturalSort from 'javascript-natural-sort'\nimport { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'compareNatural'\nconst dependencies = [\n  'typed',\n  'compare'\n]\n\nexport const createCompareNatural = /* #__PURE__ */ factory(name, dependencies, ({ typed, compare }) => {\n  const compareBooleans = compare.signatures['boolean,boolean']\n\n  /**\n   * Compare two values of any type in a deterministic, natural way.\n   *\n   * For numeric values, the function works the same as `math.compare`.\n   * For types of values that can't be compared mathematically,\n   * the function compares in a natural way.\n   *\n   * For numeric values, x and y are considered equal when the relative\n   * difference between x and y is smaller than the configured relTol and absTol.\n   * The function cannot be used to compare values smaller than\n   * approximately 2.22e-16.\n   *\n   * For Complex numbers, first the real parts are compared. If equal,\n   * the imaginary parts are compared.\n   *\n   * Strings are compared with a natural sorting algorithm, which\n   * orders strings in a \"logic\" way following some heuristics.\n   * This differs from the function `compare`, which converts the string\n   * into a numeric value and compares that. The function `compareText`\n   * on the other hand compares text lexically.\n   *\n   * Arrays and Matrices are compared value by value until there is an\n   * unequal pair of values encountered. Objects are compared by sorted\n   * keys until the keys or their values are unequal.\n   *\n   * Syntax:\n   *\n   *    math.compareNatural(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareNatural(6, 1)              // returns 1\n   *    math.compareNatural(2, 3)              // returns -1\n   *    math.compareNatural(7, 7)              // returns 0\n   *\n   *    math.compareNatural('10', '2')         // returns 1\n   *    math.compareText('10', '2')            // returns -1\n   *    math.compare('10', '2')                // returns 1\n   *\n   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1\n   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1\n   *    math.compare('Answer: 10', 'Answer: 2')\n   *        // Error: Cannot convert \"Answer: 10\" to a number\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('40 mm')\n   *    math.compareNatural(a, b)              // returns 1\n   *\n   *    const c = math.complex('2 + 3i')\n   *    const d = math.complex('2 + 4i')\n   *    math.compareNatural(c, d)              // returns -1\n   *\n   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1\n   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1\n   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1\n   *    math.compareNatural([1, 2], [1, 2])       // returns 0\n   *\n   *    math.compareNatural({a: 2}, {a: 4})       // returns -1\n   *\n   * See also:\n   *\n   *    compare, compareText\n   *\n   * @param  {*} x First value to compare\n   * @param  {*} y Second value to compare\n   * @return {number} Returns the result of the comparison:\n   *                  1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(name, { 'any, any': _compareNatural }) // just to check # args\n\n  function _compareNatural (x, y) {\n    const typeX = typeOf(x)\n    const typeY = typeOf(y)\n    let c\n\n    // numeric types\n    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') &&\n        (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {\n      c = compare(x, y)\n      if (c.toString() !== '0') {\n        // c can be number, BigNumber, or Fraction\n        return c > 0 ? 1 : -1 // return a number\n      } else {\n        return naturalSort(typeX, typeY)\n      }\n    }\n\n    // matrix types\n    const matTypes = ['Array', 'DenseMatrix', 'SparseMatrix']\n    if (matTypes.includes(typeX) || matTypes.includes(typeY)) {\n      c = compareMatricesAndArrays(_compareNatural, x, y)\n      if (c !== 0) {\n        return c\n      } else {\n        return naturalSort(typeX, typeY)\n      }\n    }\n\n    // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'\n    if (typeX !== typeY) {\n      return naturalSort(typeX, typeY)\n    }\n\n    if (typeX === 'Complex') {\n      return compareComplexNumbers(x, y)\n    }\n\n    if (typeX === 'Unit') {\n      if (x.equalBase(y)) {\n        return _compareNatural(x.value, y.value)\n      }\n\n      // compare by units\n      return compareArrays(_compareNatural, x.formatUnits(), y.formatUnits())\n    }\n\n    if (typeX === 'boolean') {\n      return compareBooleans(x, y)\n    }\n\n    if (typeX === 'string') {\n      return naturalSort(x, y)\n    }\n\n    if (typeX === 'Object') {\n      return compareObjects(_compareNatural, x, y)\n    }\n\n    if (typeX === 'null') {\n      return 0\n    }\n\n    if (typeX === 'undefined') {\n      return 0\n    }\n\n    // this should not occur...\n    throw new TypeError('Unsupported type of value \"' + typeX + '\"')\n  }\n\n  /**\n   * Compare mixed matrix/array types, by converting to same-shaped array.\n   * This comparator is non-deterministic regarding input types.\n   * @param {Array | SparseMatrix | DenseMatrix | *} x\n   * @param {Array | SparseMatrix | DenseMatrix | *} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareMatricesAndArrays (compareNatural, x, y) {\n    if (isSparseMatrix(x) && isSparseMatrix(y)) {\n      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values)\n    }\n    if (isSparseMatrix(x)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x.toArray(), y)\n    }\n    if (isSparseMatrix(y)) {\n      // note: convert to array is expensive\n      return compareMatricesAndArrays(compareNatural, x, y.toArray())\n    }\n\n    // convert DenseArray into Array\n    if (isDenseMatrix(x)) {\n      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y)\n    }\n    if (isDenseMatrix(y)) {\n      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data)\n    }\n\n    // convert scalars to array\n    if (!Array.isArray(x)) {\n      return compareMatricesAndArrays(compareNatural, [x], y)\n    }\n    if (!Array.isArray(y)) {\n      return compareMatricesAndArrays(compareNatural, x, [y])\n    }\n\n    return compareArrays(compareNatural, x, y)\n  }\n\n  /**\n   * Compare two Arrays\n   *\n   * - First, compares value by value\n   * - Next, if all corresponding values are equal,\n   *   look at the length: longest array will be considered largest\n   *\n   * @param {Array} x\n   * @param {Array} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareArrays (compareNatural, x, y) {\n    // compare each value\n    for (let i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {\n      const v = compareNatural(x[i], y[i])\n      if (v !== 0) {\n        return v\n      }\n    }\n\n    // compare the size of the arrays\n    if (x.length > y.length) { return 1 }\n    if (x.length < y.length) { return -1 }\n\n    // both Arrays have equal size and content\n    return 0\n  }\n\n  /**\n   * Compare two objects\n   *\n   * - First, compare sorted property names\n   * - Next, compare the property values\n   *\n   * @param {Object} x\n   * @param {Object} y\n   * @returns {number} Returns the comparison result: -1, 0, or 1\n   */\n  function compareObjects (compareNatural, x, y) {\n    const keysX = Object.keys(x)\n    const keysY = Object.keys(y)\n\n    // compare keys\n    keysX.sort(naturalSort)\n    keysY.sort(naturalSort)\n    const c = compareArrays(compareNatural, keysX, keysY)\n    if (c !== 0) {\n      return c\n    }\n\n    // compare values\n    for (let i = 0; i < keysX.length; i++) {\n      const v = compareNatural(x[keysX[i]], y[keysY[i]])\n      if (v !== 0) {\n        return v\n      }\n    }\n\n    return 0\n  }\n})\n\n/**\n * Compare two complex numbers, `x` and `y`:\n *\n * - First, compare the real values of `x` and `y`\n * - If equal, compare the imaginary values of `x` and `y`\n *\n * @params {Complex} x\n * @params {Complex} y\n * @returns {number} Returns the comparison result: -1, 0, or 1\n */\nfunction compareComplexNumbers (x, y) {\n  if (x.re > y.re) { return 1 }\n  if (x.re < y.re) { return -1 }\n\n  if (x.im > y.im) { return 1 }\n  if (x.im < y.im) { return -1 }\n\n  return 0\n}\n","import { compareText as _compareText } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'compareText'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'concat'\n]\n\n_compareText.signature = 'any, any'\n\nexport const createCompareText = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, concat }) => {\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Compare two strings lexically. Comparison is case sensitive.\n   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.compareText(x, y)\n   *\n   * Examples:\n   *\n   *    math.compareText('B', 'A')     // returns 1\n   *    math.compareText('2', '10')    // returns 1\n   *    math.compare('2', '10')        // returns -1\n   *    math.compareNatural('2', '10') // returns -1\n   *\n   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]\n   *\n   * See also:\n   *\n   *    equal, equalText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns the result of the comparison:\n   *                                        1 when x > y, -1 when x < y, and 0 when x == y.\n   */\n  return typed(name, _compareText, matrixAlgorithmSuite({\n    elop: _compareText,\n    Ds: true\n  }))\n})\n\nexport const createCompareTextNumber = /* #__PURE__ */ factory(\n  name, ['typed'], ({ typed }) => typed(name, _compareText)\n)\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'equal'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createEqual = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Test whether two values are equal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * smaller than the configured relTol and absTol. The function cannot be used to\n   * compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is only\n   * equal to `null` and nothing else, and `undefined` is only equal to\n   * `undefined` and nothing else. Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.equal(x, y)\n   *\n   * Examples:\n   *\n   *    math.equal(2 + 2, 3)         // returns false\n   *    math.equal(2 + 2, 4)         // returns true\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.equal(a, b)             // returns true\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.equal(c, d)             // returns [true, false, true]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.equal(\"1000\", \"1e3\")    // returns true\n   *    math.equal(0, null)          // returns false\n   *\n   * See also:\n   *\n   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText\n   *\n   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false\n   */\n  return typed(\n    name,\n    createEqualNumber({ typed, equalScalar }),\n    matrixAlgorithmSuite({\n      elop: equalScalar,\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createEqualNumber = factory(name, ['typed', 'equalScalar'], ({ typed, equalScalar }) => {\n  return typed(name, {\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y === null }\n      if (y === null) { return x === null }\n      if (x === undefined) { return y === undefined }\n      if (y === undefined) { return x === undefined }\n\n      return equalScalar(x, y)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'equalText'\nconst dependencies = [\n  'typed',\n  'compareText',\n  'isZero'\n]\n\nexport const createEqualText = /* #__PURE__ */ factory(name, dependencies, ({ typed, compareText, isZero }) => {\n  /**\n   * Check equality of two strings. Comparison is case sensitive.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.equalText(x, y)\n   *\n   * Examples:\n   *\n   *    math.equalText('Hello', 'Hello')     // returns true\n   *    math.equalText('a', 'A')             // returns false\n   *    math.equal('2e3', '2000')            // returns true\n   *    math.equalText('2e3', '2000')        // returns false\n   *\n   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]\n   *\n   * See also:\n   *\n   *    equal, compareText, compare, compareNatural\n   *\n   * @param  {string | Array | DenseMatrix} x First string to compare\n   * @param  {string | Array | DenseMatrix} y Second string to compare\n   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.\n   */\n  return typed(name, {\n    'any, any': function (x, y) {\n      return isZero(compareText(x, y))\n    }\n  })\n})\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'smaller'\nconst dependencies = [\n  'typed',\n  'config',\n  'bignumber',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createSmaller = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, bignumber, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Test whether value x is smaller than y.\n   *\n   * The function returns true when x is smaller than y and the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smaller(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(2, 3)            // returns true\n   *    math.smaller(5, 2 * 2)        // returns false\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.smaller(a, b)            // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smallerEq, smaller, smallerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  function bignumSmaller (x, y) {\n    return x.lt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol)\n  }\n\n  return typed(\n    name,\n    createSmallerNumber({ typed, config }),\n    {\n      'boolean, boolean': (x, y) => x < y,\n\n      'BigNumber, BigNumber': bignumSmaller,\n\n      'bigint, bigint': (x, y) => x < y,\n\n      'Fraction, Fraction': (x, y) => (x.compare(y) === -1),\n\n      'Fraction, BigNumber': function (x, y) {\n        return bignumSmaller(bignumber(x), y)\n      },\n\n      'BigNumber, Fraction': function (x, y) {\n        return bignumSmaller(x, bignumber(y))\n      },\n\n      'Complex, Complex': function (x, y) {\n        throw new TypeError('No ordering relation is defined for complex numbers')\n      }\n    },\n    compareUnits,\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createSmallerNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x < y && !nearlyEqual(x, y, config.relTol, config.absTol)\n    }\n  })\n})\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'smallerEq'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createSmallerEq = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Test whether value x is smaller or equal to y.\n   *\n   * The function returns true when x is smaller than y or the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.smallerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.smaller(1 + 2, 3)        // returns false\n   *    math.smallerEq(1 + 2, 3)      // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false\n   */\n  return typed(\n    name,\n    createSmallerEqNumber({ typed, config }),\n    {\n      'boolean, boolean': (x, y) => (x <= y),\n\n      'BigNumber, BigNumber': function (x, y) {\n        return x.lte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol)\n      },\n\n      'bigint, bigint': (x, y) => (x <= y),\n\n      'Fraction, Fraction': (x, y) => (x.compare(y) !== 1),\n\n      'Complex, Complex': function () {\n        throw new TypeError('No ordering relation is defined for complex numbers')\n      }\n    },\n    compareUnits,\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createSmallerEqNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x <= y || nearlyEqual(x, y, config.relTol, config.absTol)\n    }\n  })\n})\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'larger'\nconst dependencies = [\n  'typed',\n  'config',\n  'bignumber',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createLarger = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, bignumber, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Test whether value x is larger than y.\n   *\n   * The function returns true when x is larger than y and the relative\n   * difference between x and y is larger than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.larger(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 3)             // returns false\n   *    math.larger(5, 2 + 2)         // returns true\n   *\n   *    const a = math.unit('5 cm')\n   *    const b = math.unit('2 inch')\n   *    math.larger(a, b)             // returns false\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, largerEq, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false\n   */\n  function bignumLarger (x, y) {\n    return x.gt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol)\n  }\n\n  return typed(\n    name,\n    createLargerNumber({ typed, config }),\n    {\n      'boolean, boolean': (x, y) => x > y,\n\n      'BigNumber, BigNumber': bignumLarger,\n\n      'bigint, bigint': (x, y) => x > y,\n\n      'Fraction, Fraction': (x, y) => (x.compare(y) === 1),\n\n      'Fraction, BigNumber': function (x, y) {\n        return bignumLarger(bignumber(x), y)\n      },\n\n      'BigNumber, Fraction': function (x, y) {\n        return bignumLarger(x, bignumber(y))\n      },\n\n      'Complex, Complex': function () {\n        throw new TypeError('No ordering relation is defined for complex numbers')\n      }\n    },\n    compareUnits,\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createLargerNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x > y && !nearlyEqual(x, y, config.relTol, config.absTol)\n    }\n  })\n})\n","import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js'\nimport { nearlyEqual } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\nimport { createCompareUnits } from './compareUnits.js'\n\nconst name = 'largerEq'\nconst dependencies = [\n  'typed',\n  'config',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createLargerEq = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n  const compareUnits = createCompareUnits({ typed })\n\n  /**\n   * Test whether value x is larger or equal to y.\n   *\n   * The function returns true when x is larger than y or the relative\n   * difference between x and y is smaller than the configured relTol and absTol. The\n   * function cannot be used to compare values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.largerEq(x, y)\n   *\n   * Examples:\n   *\n   *    math.larger(2, 1 + 1)         // returns false\n   *    math.largerEq(2, 1 + 1)       // returns true\n   *\n   * See also:\n   *\n   *    equal, unequal, smaller, smallerEq, larger, compare\n   *\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare\n   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false\n   */\n  return typed(\n    name,\n    createLargerEqNumber({ typed, config }),\n    {\n      'boolean, boolean': (x, y) => x >= y,\n\n      'BigNumber, BigNumber': function (x, y) {\n        return x.gte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol)\n      },\n\n      'bigint, bigint': function (x, y) {\n        return x >= y\n      },\n\n      'Fraction, Fraction': (x, y) => (x.compare(y) !== -1),\n\n      'Complex, Complex': function () {\n        throw new TypeError('No ordering relation is defined for complex numbers')\n      }\n    },\n    compareUnits,\n    matrixAlgorithmSuite({\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n})\n\nexport const createLargerEqNumber = /* #__PURE__ */ factory(name, ['typed', 'config'], ({ typed, config }) => {\n  return typed(name, {\n    'number, number': function (x, y) {\n      return x >= y || nearlyEqual(x, y, config.relTol, config.absTol)\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'deepEqual'\nconst dependencies = [\n  'typed',\n  'equal'\n]\n\nexport const createDeepEqual = /* #__PURE__ */ factory(name, dependencies, ({ typed, equal }) => {\n  /**\n   * Test element wise whether two matrices are equal.\n   * The function accepts both matrices and scalar values.\n   *\n   * Strings are compared by their numerical value.\n   *\n   * Syntax:\n   *\n   *    math.deepEqual(x, y)\n   *\n   * Examples:\n   *\n   *    math.deepEqual(2, 4)   // returns false\n   *\n   *    a = [2, 5, 1]\n   *    b = [2, 7, 1]\n   *\n   *    math.deepEqual(a, b)   // returns false\n   *    math.equal(a, b)       // returns [true, false, true]\n   *\n   * See also:\n   *\n   *    equal, unequal\n   *\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare\n   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare\n   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}\n   *            Returns true when the input matrices have the same size and each of their elements is equal.\n   */\n  return typed(name, {\n    'any, any': function (x, y) {\n      return _deepEqual(x.valueOf(), y.valueOf())\n    }\n  })\n\n  /**\n   * Test whether two arrays have the same size and all elements are equal\n   * @param {Array | *} x\n   * @param {Array | *} y\n   * @return {boolean} Returns true if both arrays are deep equal\n   */\n  function _deepEqual (x, y) {\n    if (Array.isArray(x)) {\n      if (Array.isArray(y)) {\n        const len = x.length\n        if (len !== y.length) {\n          return false\n        }\n\n        for (let i = 0; i < len; i++) {\n          if (!_deepEqual(x[i], y[i])) {\n            return false\n          }\n        }\n\n        return true\n      } else {\n        return false\n      }\n    } else {\n      if (Array.isArray(y)) {\n        return false\n      } else {\n        return equal(x, y)\n      }\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'unequal'\nconst dependencies = [\n  'typed',\n  'config',\n  'equalScalar',\n  'matrix',\n  'DenseMatrix',\n  'concat',\n  'SparseMatrix'\n]\n\nexport const createUnequal = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, equalScalar, matrix, DenseMatrix, concat, SparseMatrix }) => {\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo07xSSf = createMatAlgo07xSSf({ typed, SparseMatrix })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Test whether two values are unequal.\n   *\n   * The function tests whether the relative difference between x and y is\n   * larger than the configured relTol and absTol. The function cannot be used to compare\n   * values smaller than approximately 2.22e-16.\n   *\n   * For matrices, the function is evaluated element wise.\n   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.\n   * Strings are compared by their numerical value.\n   *\n   * Values `null` and `undefined` are compared strictly, thus `null` is unequal\n   * with everything except `null`, and `undefined` is unequal with everything\n   * except `undefined`.\n   *\n   * Syntax:\n   *\n   *    math.unequal(x, y)\n   *\n   * Examples:\n   *\n   *    math.unequal(2 + 2, 3)       // returns true\n   *    math.unequal(2 + 2, 4)       // returns false\n   *\n   *    const a = math.unit('50 cm')\n   *    const b = math.unit('5 m')\n   *    math.unequal(a, b)           // returns false\n   *\n   *    const c = [2, 5, 1]\n   *    const d = [2, 7, 1]\n   *\n   *    math.unequal(c, d)           // returns [false, true, false]\n   *    math.deepEqual(c, d)         // returns false\n   *\n   *    math.unequal(0, null)        // returns true\n   * See also:\n   *\n   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare\n   *\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare\n   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare\n   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false\n   */\n  return typed(\n    name,\n    createUnequalNumber({ typed, equalScalar }),\n    matrixAlgorithmSuite({\n      elop: _unequal,\n      SS: matAlgo07xSSf,\n      DS: matAlgo03xDSf,\n      Ss: matAlgo12xSfs\n    })\n  )\n\n  function _unequal (x, y) {\n    return !equalScalar(x, y)\n  }\n})\n\nexport const createUnequalNumber = factory(name, ['typed', 'equalScalar'], ({ typed, equalScalar }) => {\n  return typed(name, {\n    'any, any': function (x, y) {\n      // strict equality for null and undefined?\n      if (x === null) { return y !== null }\n      if (y === null) { return x !== null }\n      if (x === undefined) { return y !== undefined }\n      if (y === undefined) { return x !== undefined }\n\n      return !equalScalar(x, y)\n    }\n  })\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'partitionSelect'\nconst dependencies = ['typed', 'isNumeric', 'isNaN', 'compare']\n\nexport const createPartitionSelect = /* #__PURE__ */ factory(name, dependencies, ({ typed, isNumeric, isNaN: mathIsNaN, compare }) => {\n  const asc = compare\n  const desc = (a, b) => -compare(a, b)\n\n  /**\n   * Partition-based selection of an array or 1D matrix.\n   * Will find the kth smallest value, and mutates the input array.\n   * Uses Quickselect.\n   *\n   * Syntax:\n   *\n   *    math.partitionSelect(x, k)\n   *    math.partitionSelect(x, k, compare)\n   *\n   * Examples:\n   *\n   *    math.partitionSelect([5, 10, 1], 2)                               // returns 10\n   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1, math.compareText)   // returns 'B'\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'\n   *\n   *    // the input array is mutated\n   *    arr = [5, 2, 1]\n   *    math.partitionSelect(arr, 0) // returns 1, arr is now: [1, 2, 5]\n   *    math.partitionSelect(arr, 1, 'desc') // returns 2, arr is now: [5, 2, 1]\n   *\n   * See also:\n   *\n   *    sort\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Number} k            The kth smallest value to be retrieved zero-based index\n   * @param {Function | 'asc' | 'desc'} [compare='asc']\n   *        An optional comparator function. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {*} Returns the kth lowest value.\n   */\n  return typed(name, {\n    'Array | Matrix, number': function (x, k) {\n      return _partitionSelect(x, k, asc)\n    },\n\n    'Array | Matrix, number, string': function (x, k, compare) {\n      if (compare === 'asc') {\n        return _partitionSelect(x, k, asc)\n      } else if (compare === 'desc') {\n        return _partitionSelect(x, k, desc)\n      } else {\n        throw new Error('Compare string must be \"asc\" or \"desc\"')\n      }\n    },\n\n    'Array | Matrix, number, function': _partitionSelect\n  })\n\n  function _partitionSelect (x, k, compare) {\n    if (!isInteger(k) || k < 0) {\n      throw new Error('k must be a non-negative integer')\n    }\n\n    if (isMatrix(x)) {\n      const size = x.size()\n      if (size.length > 1) {\n        throw new Error('Only one dimensional matrices supported')\n      }\n      return quickSelect(x.valueOf(), k, compare)\n    }\n\n    if (Array.isArray(x)) {\n      return quickSelect(x, k, compare)\n    }\n  }\n\n  /**\n   * Quickselect algorithm.\n   * Code adapted from:\n   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html\n   *\n   * @param {Array} arr\n   * @param {Number} k\n   * @param {Function} compare\n   * @private\n   */\n  function quickSelect (arr, k, compare) {\n    if (k >= arr.length) {\n      throw new Error('k out of bounds')\n    }\n\n    // check for NaN values since these can cause an infinite while loop\n    for (let i = 0; i < arr.length; i++) {\n      if (isNumeric(arr[i]) && mathIsNaN(arr[i])) {\n        return arr[i] // return NaN\n      }\n    }\n\n    let from = 0\n    let to = arr.length - 1\n\n    // if from == to we reached the kth element\n    while (from < to) {\n      let r = from\n      let w = to\n      const pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]\n\n      // stop if the reader and writer meets\n      while (r < w) {\n        // arr[r] >= pivot\n        if (compare(arr[r], pivot) >= 0) { // put the large values at the end\n          const tmp = arr[w]\n          arr[w] = arr[r]\n          arr[r] = tmp\n          --w\n        } else { // the value is smaller than the pivot, skip\n          ++r\n        }\n      }\n\n      // if we stepped up (r++) we need to step one down (arr[r] > pivot)\n      if (compare(arr[r], pivot) > 0) {\n        --r\n      }\n\n      // the r pointer is on the end of the first k elements\n      if (k <= r) {\n        to = r\n      } else {\n        from = r + 1\n      }\n    }\n\n    return arr[k]\n  }\n})\n","import { arraySize as size } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'sort'\nconst dependencies = ['typed', 'matrix', 'compare', 'compareNatural']\n\nexport const createSort = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, compare, compareNatural }) => {\n  const compareAsc = compare\n  const compareDesc = (a, b) => -compare(a, b)\n\n  /**\n   * Sort the items in a matrix.\n   *\n   * Syntax:\n   *\n   *    math.sort(x)\n   *    math.sort(x, compare)\n   *\n   * Examples:\n   *\n   *    math.sort([5, 10, 1]) // returns [1, 5, 10]\n   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)\n   *    // returns ['A', 'B', 'C', 'D']\n   *\n   *    function sortByLength (a, b) {\n   *      return a.length - b.length\n   *    }\n   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)\n   *    // returns ['Tom', 'Sara', 'Langdon']\n   *\n   * See also:\n   *\n   *    filter, forEach, map, compare, compareNatural\n   *\n   * @param {Matrix | Array} x    A one dimensional matrix or array to sort\n   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']\n   *        An optional _comparator function or name. The function is called as\n   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,\n   *        and 0 when a == b.\n   * @return {Matrix | Array} Returns the sorted matrix.\n   */\n  return typed(name, {\n    Array: function (x) {\n      _arrayIsVector(x)\n      return x.sort(compareAsc)\n    },\n\n    Matrix: function (x) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(compareAsc), x.storage())\n    },\n\n    'Array, function': function (x, _comparator) {\n      _arrayIsVector(x)\n      return x.sort(_comparator)\n    },\n\n    'Matrix, function': function (x, _comparator) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(_comparator), x.storage())\n    },\n\n    'Array, string': function (x, order) {\n      _arrayIsVector(x)\n      return x.sort(_comparator(order))\n    },\n\n    'Matrix, string': function (x, order) {\n      _matrixIsVector(x)\n      return matrix(x.toArray().sort(_comparator(order)), x.storage())\n    }\n  })\n\n  /**\n   * Get the comparator for given order ('asc', 'desc', 'natural')\n   * @param {'asc' | 'desc' | 'natural'} order\n   * @return {Function} Returns a _comparator function\n   */\n  function _comparator (order) {\n    if (order === 'asc') {\n      return compareAsc\n    } else if (order === 'desc') {\n      return compareDesc\n    } else if (order === 'natural') {\n      return compareNatural\n    } else {\n      throw new Error('String \"asc\", \"desc\", or \"natural\" expected')\n    }\n  }\n\n  /**\n   * Validate whether an array is one dimensional\n   * Throws an error when this is not the case\n   * @param {Array} array\n   * @private\n   */\n  function _arrayIsVector (array) {\n    if (size(array).length !== 1) {\n      throw new Error('One dimensional array expected')\n    }\n  }\n\n  /**\n   * Validate whether a matrix is one dimensional\n   * Throws an error when this is not the case\n   * @param {Matrix} matrix\n   * @private\n   */\n  function _matrixIsVector (matrix) {\n    if (matrix.size().length !== 1) {\n      throw new Error('One dimensional matrix expected')\n    }\n  }\n})\n","import { deepForEach, reduce, containsCollections } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'max'\nconst dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN']\n\nexport const createMax = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, larger, isNaN: mathIsNaN }) => {\n  /**\n   * Compute the maximum value of a matrix or a  list with values.\n   * In case of a multidimensional array, the maximum of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.max(a, b, c, ...)\n   *     math.max(A)\n   *     math.max(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.max(2, 1, 4, 3)                  // returns 4\n   *     math.max([2, 1, 4, 3])                // returns 4\n   *\n   *     // maximum over a specified dimension (zero-based)\n   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]\n   *     math.max([[2, 5], [4, 3], [1, 7]], 1) // returns [5, 4, 7]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, min, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The maximum value\n   */\n  return typed(name, {\n    // max([a, b, c, d, ...])\n    'Array | Matrix': _max,\n\n    // max([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return reduce(array, dim.valueOf(), _largest)\n    },\n\n    // max(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function max')\n      }\n\n      return _max(args)\n    }\n  })\n\n  /**\n   * Return the largest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is largest, or y when y is largest\n   * @private\n   */\n  function _largest (x, y) {\n    try {\n      return larger(x, y) ? x : y\n    } catch (err) {\n      throw improveErrorMessage(err, 'max', y)\n    }\n  }\n\n  /**\n   * Recursively calculate the maximum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} max\n   * @private\n   */\n  function _max (array) {\n    let res\n\n    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          res = value\n        } else if (res === undefined || larger(value, res)) {\n          res = value\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'max', value)\n      }\n    })\n\n    if (res === undefined) {\n      throw new Error('Cannot calculate max of an empty array')\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof res === 'string') {\n      res = numeric(res, safeNumberType(res, config))\n    }\n\n    return res\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'min'\nconst dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN']\n\nexport const createMin = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, smaller, isNaN: mathIsNaN }) => {\n  /**\n   * Compute the minimum value of a matrix or a  list of values.\n   * In case of a multidimensional array, the minimum of the flattened array\n   * will be calculated. When `dim` is provided, the minimum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.min(a, b, c, ...)\n   *     math.min(A)\n   *     math.min(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.min(2, 1, 4, 3)                  // returns 1\n   *     math.min([2, 1, 4, 3])                // returns 1\n   *\n   *     // minimum over a specified dimension (zero-based)\n   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]\n   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]\n   *\n   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1\n   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5\n   *\n   * See also:\n   *\n   *    mean, median, max, prod, std, sum, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The minimum value\n   */\n  return typed(name, {\n    // min([a, b, c, d, ...])\n    'Array | Matrix': _min,\n\n    // min([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return reduce(array, dim.valueOf(), _smallest)\n    },\n\n    // min(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function min')\n      }\n\n      return _min(args)\n    }\n  })\n\n  /**\n   * Return the smallest of two values\n   * @param {*} x\n   * @param {*} y\n   * @returns {*} Returns x when x is smallest, or y when y is smallest\n   * @private\n   */\n  function _smallest (x, y) {\n    try {\n      return smaller(x, y) ? x : y\n    } catch (err) {\n      throw improveErrorMessage(err, 'min', y)\n    }\n  }\n\n  /**\n   * Recursively calculate the minimum value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} min\n   * @private\n   */\n  function _min (array) {\n    let min\n\n    deepForEach(array, function (value) {\n      try {\n        if (mathIsNaN(value)) {\n          min = value\n        } else if (min === undefined || smaller(value, min)) {\n          min = value\n        }\n      } catch (err) {\n        throw improveErrorMessage(err, 'min', value)\n      }\n    })\n\n    if (min === undefined) {\n      throw new Error('Cannot calculate min of an empty array')\n    }\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (typeof min === 'string') {\n      min = numeric(min, safeNumberType(min, config))\n    }\n\n    return min\n  }\n})\n","import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ImmutableDenseMatrix'\nconst dependencies = [\n  'smaller',\n  'DenseMatrix'\n]\n\nexport const createImmutableDenseMatrixClass = /* #__PURE__ */ factory(name, dependencies, ({ smaller, DenseMatrix }) => {\n  function ImmutableDenseMatrix (data, datatype) {\n    if (!(this instanceof ImmutableDenseMatrix)) { throw new SyntaxError('Constructor must be called with the new operator') }\n    if (datatype && !isString(datatype)) { throw new Error('Invalid datatype: ' + datatype) }\n\n    if (isMatrix(data) || isArray(data)) {\n      // use DenseMatrix implementation\n      const matrix = new DenseMatrix(data, datatype)\n      // internal structures\n      this._data = matrix._data\n      this._size = matrix._size\n      this._datatype = matrix._datatype\n      this._min = null\n      this._max = null\n    } else if (data && isArray(data.data) && isArray(data.size)) {\n      // initialize fields from JSON representation\n      this._data = data.data\n      this._size = data.size\n      this._datatype = data.datatype\n      this._min = typeof data.min !== 'undefined' ? data.min : null\n      this._max = typeof data.max !== 'undefined' ? data.max : null\n    } else if (data) {\n      // unsupported type\n      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')')\n    } else {\n      // nothing provided\n      this._data = []\n      this._size = [0]\n      this._datatype = datatype\n      this._min = null\n      this._max = null\n    }\n  }\n\n  ImmutableDenseMatrix.prototype = new DenseMatrix()\n\n  /**\n   * Attach type information\n   */\n  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix'\n  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true\n\n  /**\n   * Get a subset of the matrix, or replace a subset of the matrix.\n   *\n   * Usage:\n   *     const subset = matrix.subset(index)               // retrieve subset\n   *     const value = matrix.subset(index, replacement)   // replace subset\n   *\n   * @param {Index} index\n   * @param {Array | ImmutableDenseMatrix | *} [replacement]\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be filled with zeros.\n   */\n  ImmutableDenseMatrix.prototype.subset = function (index) {\n    switch (arguments.length) {\n      case 1:\n      {\n        // use base implementation\n        const m = DenseMatrix.prototype.subset.call(this, index)\n        // check result is a matrix\n        if (isMatrix(m)) {\n          // return immutable matrix\n          return new ImmutableDenseMatrix({\n            data: m._data,\n            size: m._size,\n            datatype: m._datatype\n          })\n        }\n        return m\n      }\n      // intentional fall through\n      case 2:\n      case 3:\n        throw new Error('Cannot invoke set subset on an Immutable Matrix instance')\n\n      default:\n        throw new SyntaxError('Wrong number of arguments')\n    }\n  }\n\n  /**\n   * Replace a single element in the matrix.\n   * @param {Number[]} index   Zero-based index\n   * @param {*} value\n   * @param {*} [defaultValue]        Default value, filled in on new entries when\n   *                                  the matrix is resized. If not provided,\n   *                                  new matrix elements will be left undefined.\n   * @return {ImmutableDenseMatrix} self\n   */\n  ImmutableDenseMatrix.prototype.set = function () {\n    throw new Error('Cannot invoke set on an Immutable Matrix instance')\n  }\n\n  /**\n   * Resize the matrix to the given size. Returns a copy of the matrix when\n   * `copy=true`, otherwise return the matrix itself (resize in place).\n   *\n   * @param {Number[]} size           The new size the matrix should have.\n   * @param {*} [defaultValue=0]      Default value, filled in on new entries.\n   *                                  If not provided, the matrix elements will\n   *                                  be filled with zeros.\n   * @param {boolean} [copy]          Return a resized copy of the matrix\n   *\n   * @return {Matrix}                 The resized matrix\n   */\n  ImmutableDenseMatrix.prototype.resize = function () {\n    throw new Error('Cannot invoke resize on an Immutable Matrix instance')\n  }\n\n  /**\n   * Disallows reshaping in favor of immutability.\n   *\n   * @throws {Error} Operation not allowed\n   */\n  ImmutableDenseMatrix.prototype.reshape = function () {\n    throw new Error('Cannot invoke reshape on an Immutable Matrix instance')\n  }\n\n  /**\n   * Create a clone of the matrix\n   * @return {ImmutableDenseMatrix} clone\n   */\n  ImmutableDenseMatrix.prototype.clone = function () {\n    return new ImmutableDenseMatrix({\n      data: clone(this._data),\n      size: clone(this._size),\n      datatype: this._datatype\n    })\n  }\n\n  /**\n   * Get a JSON representation of the matrix\n   * @returns {Object}\n   */\n  ImmutableDenseMatrix.prototype.toJSON = function () {\n    return {\n      mathjs: 'ImmutableDenseMatrix',\n      data: this._data,\n      size: this._size,\n      datatype: this._datatype\n    }\n  }\n\n  /**\n   * Generate a matrix from a JSON object\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"ImmutableDenseMatrix\", data: [], size: []}`,\n   *                       where mathjs is optional\n   * @returns {ImmutableDenseMatrix}\n   */\n  ImmutableDenseMatrix.fromJSON = function (json) {\n    return new ImmutableDenseMatrix(json)\n  }\n\n  /**\n   * Swap rows i and j in Matrix.\n   *\n   * @param {Number} i       Matrix row index 1\n   * @param {Number} j       Matrix row index 2\n   *\n   * @return {Matrix}        The matrix reference\n   */\n  ImmutableDenseMatrix.prototype.swapRows = function () {\n    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance')\n  }\n\n  /**\n   * Calculate the minimum value in the set\n   * @return {Number | undefined} min\n   */\n  ImmutableDenseMatrix.prototype.min = function () {\n    // check min has been calculated before\n    if (this._min === null) {\n      // minimum\n      let m = null\n      // compute min\n      this.forEach(function (v) {\n        if (m === null || smaller(v, m)) { m = v }\n      })\n      this._min = m !== null ? m : undefined\n    }\n    return this._min\n  }\n\n  /**\n   * Calculate the maximum value in the set\n   * @return {Number | undefined} max\n   */\n  ImmutableDenseMatrix.prototype.max = function () {\n    // check max has been calculated before\n    if (this._max === null) {\n      // maximum\n      let m = null\n      // compute max\n      this.forEach(function (v) {\n        if (m === null || smaller(m, v)) { m = v }\n      })\n      this._max = m !== null ? m : undefined\n    }\n    return this._max\n  }\n\n  return ImmutableDenseMatrix\n}, { isClass: true })\n","import { isArray, isMatrix, isRange } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Index'\nconst dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType']\n\nexport const createIndexClass = /* #__PURE__ */ factory(name, dependencies, ({ ImmutableDenseMatrix, getMatrixDataType }) => {\n  /**\n   * Create an index. An Index can store ranges and sets for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Usage:\n   *     const index = new Index(range1, range2, matrix1, array1, ...)\n   *\n   * Where each parameter can be any of:\n   *     A number\n   *     A string (containing a name of an object property)\n   *     An instance of Range\n   *     An Array with the Set values\n   *     An Array with Booleans\n   *     A Matrix with the Set values\n   *     A Matrix with Booleans\n   *\n   * The parameters start, end, and step must be integer numbers.\n   *\n   * @class Index\n   * @Constructor Index\n   * @param {...*} ranges\n   */\n  function Index (ranges) {\n    if (!(this instanceof Index)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    this._dimensions = []\n    this._sourceSize = []\n    this._isScalar = true\n\n    for (let i = 0, ii = arguments.length; i < ii; i++) {\n      const arg = arguments[i]\n      const argIsArray = isArray(arg)\n      const argIsMatrix = isMatrix(arg)\n      const argType = typeof arg\n      let sourceSize = null\n      if (isRange(arg)) {\n        this._dimensions.push(arg)\n        this._isScalar = false\n      } else if (argIsArray || argIsMatrix) {\n        // create matrix\n        let m\n\n        if (getMatrixDataType(arg) === 'boolean') {\n          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf())\n          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf())\n          sourceSize = arg.valueOf().length\n        } else {\n          m = _createImmutableMatrix(arg.valueOf())\n        }\n\n        this._dimensions.push(m)\n        // size\n        const size = m.size()\n        // scalar\n        if (size.length !== 1 || size[0] !== 1 || sourceSize !== null) {\n          this._isScalar = false\n        }\n      } else if (argType === 'number') {\n        this._dimensions.push(_createImmutableMatrix([arg]))\n      } else if (argType === 'bigint') {\n        this._dimensions.push(_createImmutableMatrix([Number(arg)]))\n      } else if (argType === 'string') {\n        // object property (arguments.count should be 1)\n        this._dimensions.push(arg)\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range')\n      }\n      this._sourceSize.push(sourceSize)\n      // TODO: implement support for wildcard '*'\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Index.prototype.type = 'Index'\n  Index.prototype.isIndex = true\n\n  function _createImmutableMatrix (arg) {\n    // loop array elements\n    for (let i = 0, l = arg.length; i < l; i++) {\n      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {\n        throw new TypeError('Index parameters must be positive integer numbers')\n      }\n    }\n    // create matrix\n    return new ImmutableDenseMatrix(arg)\n  }\n\n  /**\n   * Create a clone of the index\n   * @memberof Index\n   * @return {Index} clone\n   */\n  Index.prototype.clone = function () {\n    const index = new Index()\n    index._dimensions = clone(this._dimensions)\n    index._isScalar = this._isScalar\n    index._sourceSize = this._sourceSize\n    return index\n  }\n\n  /**\n   * Create an index from an array with ranges/numbers\n   * @memberof Index\n   * @param {Array.<Array | number>} ranges\n   * @return {Index} index\n   * @private\n   */\n  Index.create = function (ranges) {\n    const index = new Index()\n    Index.apply(index, ranges)\n    return index\n  }\n\n  /**\n   * Retrieve the size of the index, the number of elements for each dimension.\n   * @memberof Index\n   * @returns {number[]} size\n   */\n  Index.prototype.size = function () {\n    const size = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const d = this._dimensions[i]\n      size[i] = (typeof d === 'string') ? 1 : d.size()[0]\n    }\n\n    return size\n  }\n\n  /**\n   * Get the maximum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} max\n   */\n  Index.prototype.max = function () {\n    const values = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const range = this._dimensions[i]\n      values[i] = (typeof range === 'string') ? range : range.max()\n    }\n\n    return values\n  }\n\n  /**\n   * Get the minimum value for each of the indexes ranges.\n   * @memberof Index\n   * @returns {number[]} min\n   */\n  Index.prototype.min = function () {\n    const values = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const range = this._dimensions[i]\n      values[i] = (typeof range === 'string') ? range : range.min()\n    }\n\n    return values\n  }\n\n  /**\n   * Loop over each of the ranges of the index\n   * @memberof Index\n   * @param {Function} callback   Called for each range with a Range as first\n   *                              argument, the dimension as second, and the\n   *                              index object as third.\n   */\n  Index.prototype.forEach = function (callback) {\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      callback(this._dimensions[i], i, this)\n    }\n  }\n\n  /**\n   * Retrieve the dimension for the given index\n   * @memberof Index\n   * @param {Number} dim                  Number of the dimension\n   * @returns {Range | null} range\n   */\n  Index.prototype.dimension = function (dim) {\n    if (typeof dim !== 'number') {\n      return null\n    }\n\n    return this._dimensions[dim] || null\n  }\n\n  /**\n   * Test whether this index contains an object property\n   * @returns {boolean} Returns true if the index is an object property\n   */\n  Index.prototype.isObjectProperty = function () {\n    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string'\n  }\n\n  /**\n   * Returns the object property name when the Index holds a single object property,\n   * else returns null\n   * @returns {string | null}\n   */\n  Index.prototype.getObjectProperty = function () {\n    return this.isObjectProperty() ? this._dimensions[0] : null\n  }\n\n  /**\n   * Test whether this index contains only a single value.\n   *\n   * This is the case when the index is created with only scalar values as ranges,\n   * not for ranges resolving into a single value.\n   * @memberof Index\n   * @return {boolean} isScalar\n   */\n  Index.prototype.isScalar = function () {\n    return this._isScalar\n  }\n\n  /**\n   * Expand the Index into an array.\n   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.toArray = function () {\n    const array = []\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const dimension = this._dimensions[i]\n      array.push((typeof dimension === 'string') ? dimension : dimension.toArray())\n    }\n    return array\n  }\n\n  /**\n   * Get the primitive value of the Index, a two dimensional array.\n   * Equivalent to Index.toArray().\n   * @memberof Index\n   * @returns {Array} array\n   */\n  Index.prototype.valueOf = Index.prototype.toArray\n\n  /**\n   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'\n   * @memberof Index\n   * @returns {String} str\n   */\n  Index.prototype.toString = function () {\n    const strings = []\n\n    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {\n      const dimension = this._dimensions[i]\n      if (typeof dimension === 'string') {\n        strings.push(JSON.stringify(dimension))\n      } else {\n        strings.push(dimension.toString())\n      }\n    }\n\n    return '[' + strings.join(', ') + ']'\n  }\n\n  /**\n   * Get a JSON representation of the Index\n   * @memberof Index\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Index\", \"ranges\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   */\n  Index.prototype.toJSON = function () {\n    return {\n      mathjs: 'Index',\n      dimensions: this._dimensions\n    }\n  }\n\n  /**\n   * Instantiate an Index from a JSON object\n   * @memberof Index\n   * @param {Object} json A JSON object structured as:\n   *                     `{\"mathjs\": \"Index\", \"dimensions\": [{\"mathjs\": \"Range\", start: 0, end: 10, step:1}, ...]}`\n   * @return {Index}\n   */\n  Index.fromJSON = function (json) {\n    return Index.create(json.dimensions)\n  }\n\n  return Index\n}, { isClass: true })\n\n/**\n * Receives an array of booleans and returns an array of Numbers for Index\n * @param {Array} booleanArrayIndex An array of booleans\n * @return {Array} A set of numbers ready for index\n */\nfunction _booleansArrayToNumbersForIndex (booleanArrayIndex) {\n  // gets an array of booleans and returns an array of numbers\n  const indexOfNumbers = []\n  booleanArrayIndex.forEach((bool, idx) => {\n    if (bool) {\n      indexOfNumbers.push(idx)\n    }\n  })\n  return indexOfNumbers\n}\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'FibonacciHeap'\nconst dependencies = ['smaller', 'larger']\n\nexport const createFibonacciHeapClass = /* #__PURE__ */ factory(name, dependencies, ({ smaller, larger }) => {\n  const oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0)\n\n  /**\n   * Fibonacci Heap implementation, used interally for Matrix math.\n   * @class FibonacciHeap\n   * @constructor FibonacciHeap\n   */\n  function FibonacciHeap () {\n    if (!(this instanceof FibonacciHeap)) { throw new SyntaxError('Constructor must be called with the new operator') }\n\n    // initialize fields\n    this._minimum = null\n    this._size = 0\n  }\n\n  /**\n   * Attach type information\n   */\n  FibonacciHeap.prototype.type = 'FibonacciHeap'\n  FibonacciHeap.prototype.isFibonacciHeap = true\n\n  /**\n   * Inserts a new data element into the heap. No heap consolidation is\n   * performed at this time, the new node is simply inserted into the root\n   * list of this heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.insert = function (key, value) {\n    // create node\n    const node = {\n      key,\n      value,\n      degree: 0\n    }\n    // check we have a node in the minimum\n    if (this._minimum) {\n      // minimum node\n      const minimum = this._minimum\n      // update left & right of node\n      node.left = minimum\n      node.right = minimum.right\n      minimum.right = node\n      node.right.left = node\n      // update minimum node in heap if needed\n      if (smaller(key, minimum.key)) {\n        // node has a smaller key, use it as minimum\n        this._minimum = node\n      }\n    } else {\n      // set left & right\n      node.left = node\n      node.right = node\n      // this is the first node\n      this._minimum = node\n    }\n    // increment number of nodes in heap\n    this._size++\n    // return node\n    return node\n  }\n\n  /**\n   * Returns the number of nodes in heap. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.size = function () {\n    return this._size\n  }\n\n  /**\n   * Removes all elements from this heap.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.clear = function () {\n    this._minimum = null\n    this._size = 0\n  }\n\n  /**\n   * Returns true if the heap is empty, otherwise false.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.isEmpty = function () {\n    return this._size === 0\n  }\n\n  /**\n   * Extracts the node with minimum key from heap. Amortized running\n   * time: O(log n).\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.extractMinimum = function () {\n    // node to remove\n    const node = this._minimum\n    // check we have a minimum\n    if (node === null) { return node }\n    // current minimum\n    let minimum = this._minimum\n    // get number of children\n    let numberOfChildren = node.degree\n    // pointer to the first child\n    let x = node.child\n    // for each child of node do...\n    while (numberOfChildren > 0) {\n      // store node in right side\n      const tempRight = x.right\n      // remove x from child list\n      x.left.right = x.right\n      x.right.left = x.left\n      // add x to root list of heap\n      x.left = minimum\n      x.right = minimum.right\n      minimum.right = x\n      x.right.left = x\n      // set Parent[x] to null\n      x.parent = null\n      x = tempRight\n      numberOfChildren--\n    }\n    // remove node from root list of heap\n    node.left.right = node.right\n    node.right.left = node.left\n    // update minimum\n    if (node === node.right) {\n      // empty\n      minimum = null\n    } else {\n      // update minimum\n      minimum = node.right\n      // we need to update the pointer to the root with minimum key\n      minimum = _findMinimumNode(minimum, this._size)\n    }\n    // decrement size of heap\n    this._size--\n    // update minimum\n    this._minimum = minimum\n    // return node\n    return node\n  }\n\n  /**\n   * Removes a node from the heap given the reference to the node. The trees\n   * in the heap will be consolidated, if necessary. This operation may fail\n   * to remove the correct element if there are nodes with key value -Infinity.\n   * Running time: O(log n) amortized.\n   * @memberof FibonacciHeap\n   */\n  FibonacciHeap.prototype.remove = function (node) {\n    // decrease key value\n    this._minimum = _decreaseKey(this._minimum, node, -1)\n    // remove the smallest\n    this.extractMinimum()\n  }\n\n  /**\n   * Decreases the key value for a heap node, given the new value to take on.\n   * The structure of the heap may be changed and will not be consolidated.\n   * Running time: O(1) amortized.\n   * @memberof FibonacciHeap\n   */\n  function _decreaseKey (minimum, node, key) {\n    // set node key\n    node.key = key\n    // get parent node\n    const parent = node.parent\n    if (parent && smaller(node.key, parent.key)) {\n      // remove node from parent\n      _cut(minimum, node, parent)\n      // remove all nodes from parent to the root parent\n      _cascadingCut(minimum, parent)\n    }\n    // update minimum node if needed\n    if (smaller(node.key, minimum.key)) { minimum = node }\n    // return minimum\n    return minimum\n  }\n\n  /**\n   * The reverse of the link operation: removes node from the child list of parent.\n   * This method assumes that min is non-null. Running time: O(1).\n   * @memberof FibonacciHeap\n   */\n  function _cut (minimum, node, parent) {\n    // remove node from parent children and decrement Degree[parent]\n    node.left.right = node.right\n    node.right.left = node.left\n    parent.degree--\n    // reset y.child if necessary\n    if (parent.child === node) { parent.child = node.right }\n    // remove child if degree is 0\n    if (parent.degree === 0) { parent.child = null }\n    // add node to root list of heap\n    node.left = minimum\n    node.right = minimum.right\n    minimum.right = node\n    node.right.left = node\n    // set parent[node] to null\n    node.parent = null\n    // set mark[node] to false\n    node.mark = false\n  }\n\n  /**\n   * Performs a cascading cut operation. This cuts node from its parent and then\n   * does the same for its parent, and so on up the tree.\n   * Running time: O(log n); O(1) excluding the recursion.\n   * @memberof FibonacciHeap\n   */\n  function _cascadingCut (minimum, node) {\n    // store parent node\n    const parent = node.parent\n    // if there's a parent...\n    if (!parent) { return }\n    // if node is unmarked, set it marked\n    if (!node.mark) {\n      node.mark = true\n    } else {\n      // it's marked, cut it from parent\n      _cut(minimum, node, parent)\n      // cut its parent as well\n      _cascadingCut(parent)\n    }\n  }\n\n  /**\n   * Make the first node a child of the second one. Running time: O(1) actual.\n   * @memberof FibonacciHeap\n   */\n  const _linkNodes = function (node, parent) {\n    // remove node from root list of heap\n    node.left.right = node.right\n    node.right.left = node.left\n    // make node a Child of parent\n    node.parent = parent\n    if (!parent.child) {\n      parent.child = node\n      node.right = node\n      node.left = node\n    } else {\n      node.left = parent.child\n      node.right = parent.child.right\n      parent.child.right = node\n      node.right.left = node\n    }\n    // increase degree[parent]\n    parent.degree++\n    // set mark[node] false\n    node.mark = false\n  }\n\n  function _findMinimumNode (minimum, size) {\n    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree\n    const arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1\n    // create list with initial capacity\n    const array = new Array(arraySize)\n    // find the number of root nodes.\n    let numRoots = 0\n    let x = minimum\n    if (x) {\n      numRoots++\n      x = x.right\n      while (x !== minimum) {\n        numRoots++\n        x = x.right\n      }\n    }\n    // vars\n    let y\n    // For each node in root list do...\n    while (numRoots > 0) {\n      // access this node's degree..\n      let d = x.degree\n      // get next node\n      const next = x.right\n      // check if there is a node already in array with the same degree\n      while (true) {\n        // get node with the same degree is any\n        y = array[d]\n        if (!y) { break }\n        // make one node with the same degree a child of the other, do this based on the key value.\n        if (larger(x.key, y.key)) {\n          const temp = y\n          y = x\n          x = temp\n        }\n        // make y a child of x\n        _linkNodes(y, x)\n        // we have handled this degree, go to next one.\n        array[d] = null\n        d++\n      }\n      // save this node for later when we might encounter another of the same degree.\n      array[d] = x\n      // move forward through list.\n      x = next\n      numRoots--\n    }\n    // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].\n    minimum = null\n    // loop nodes in array\n    for (let i = 0; i < arraySize; i++) {\n      // get current node\n      y = array[i]\n      if (!y) { continue }\n      // check if we have a linked list\n      if (minimum) {\n        // First remove node from root list.\n        y.left.right = y.right\n        y.right.left = y.left\n        // now add to root list, again.\n        y.left = minimum\n        y.right = minimum.right\n        minimum.right = y\n        y.right.left = y\n        // check if this is a new min.\n        if (smaller(y.key, minimum.key)) { minimum = y }\n      } else { minimum = y }\n    }\n    return minimum\n  }\n\n  return FibonacciHeap\n}, { isClass: true })\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'Spa'\nconst dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap']\n\nexport const createSpaClass = /* #__PURE__ */ factory(name, dependencies, ({ addScalar, equalScalar, FibonacciHeap }) => {\n  /**\n   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array\n   * of the vector elements and an ordered list of non-zero elements.\n   */\n  function Spa () {\n    if (!(this instanceof Spa)) { throw new SyntaxError('Constructor must be called with the new operator') }\n\n    // allocate vector, TODO use typed arrays\n    this._values = []\n    this._heap = new FibonacciHeap()\n  }\n\n  /**\n   * Attach type information\n   */\n  Spa.prototype.type = 'Spa'\n  Spa.prototype.isSpa = true\n\n  /**\n   * Set the value for index i.\n   *\n   * @param {number} i                       The index\n   * @param {number | BigNumber | Complex}   The value at index i\n   */\n  Spa.prototype.set = function (i, v) {\n    // check we have a value @ i\n    if (!this._values[i]) {\n      // insert in heap\n      const node = this._heap.insert(i, v)\n      // set the value @ i\n      this._values[i] = node\n    } else {\n      // update the value @ i\n      this._values[i].value = v\n    }\n  }\n\n  Spa.prototype.get = function (i) {\n    const node = this._values[i]\n    if (node) { return node.value }\n    return 0\n  }\n\n  Spa.prototype.accumulate = function (i, v) {\n    // node @ i\n    let node = this._values[i]\n    if (!node) {\n      // insert in heap\n      node = this._heap.insert(i, v)\n      // initialize value\n      this._values[i] = node\n    } else {\n      // accumulate value\n      node.value = addScalar(node.value, v)\n    }\n  }\n\n  Spa.prototype.forEach = function (from, to, callback) {\n    // references\n    const heap = this._heap\n    const values = this._values\n    // nodes\n    const nodes = []\n    // node with minimum key, save it\n    let node = heap.extractMinimum()\n    if (node) { nodes.push(node) }\n    // extract nodes from heap (ordered)\n    while (node && node.key <= to) {\n      // check it is in range\n      if (node.key >= from) {\n        // check value is not zero\n        if (!equalScalar(node.value, 0)) {\n          // invoke callback\n          callback(node.key, node.value, this)\n        }\n      }\n      // extract next node, save it\n      node = heap.extractMinimum()\n      if (node) { nodes.push(node) }\n    }\n    // reinsert all nodes in heap\n    for (let i = 0; i < nodes.length; i++) {\n      // current node\n      const n = nodes[i]\n      // insert node in heap\n      node = heap.insert(n.key, n.value)\n      // update values\n      values[node.key] = node\n    }\n  }\n\n  Spa.prototype.swap = function (i, j) {\n    // node @ i and j\n    let nodei = this._values[i]\n    let nodej = this._values[j]\n    // check we need to insert indeces\n    if (!nodei && nodej) {\n      // insert in heap\n      nodei = this._heap.insert(i, nodej.value)\n      // remove from heap\n      this._heap.remove(nodej)\n      // set values\n      this._values[i] = nodei\n      this._values[j] = undefined\n    } else if (nodei && !nodej) {\n      // insert in heap\n      nodej = this._heap.insert(j, nodei.value)\n      // remove from heap\n      this._heap.remove(nodei)\n      // set values\n      this._values[j] = nodej\n      this._values[i] = undefined\n    } else if (nodei && nodej) {\n      // swap values\n      const v = nodei.value\n      nodei.value = nodej.value\n      nodej.value = v\n    }\n  }\n\n  return Spa\n}, { isClass: true })\n","// (c) 2018, Mariusz Nowak\n// SPDX-License-Identifier: ISC\n// Derived from https://github.com/medikoo/lru-queue\nexport function lruQueue (limit) {\n  let size = 0\n  let base = 1\n  let queue = Object.create(null)\n  let map = Object.create(null)\n  let index = 0\n  const del = function (id) {\n    const oldIndex = map[id]\n    if (!oldIndex) return\n    delete queue[oldIndex]\n    delete map[id]\n    --size\n    if (base !== oldIndex) return\n    if (!size) {\n      index = 0\n      base = 1\n      return\n    }\n    while (!Object.prototype.hasOwnProperty.call(queue, ++base)) { /* empty */ }\n  }\n  limit = Math.abs(limit)\n  return {\n    hit: function (id) {\n      const oldIndex = map[id]; const nuIndex = ++index\n      queue[nuIndex] = id\n      map[id] = nuIndex\n      if (!oldIndex) {\n        ++size\n        if (size <= limit) return undefined\n        id = queue[base]\n        del(id)\n        return id\n      }\n      delete queue[oldIndex]\n      if (base !== oldIndex) return undefined\n      while (!Object.prototype.hasOwnProperty.call(queue, ++base)) { /* empty */ }\n      return undefined\n    },\n    delete: del,\n    clear: function () {\n      size = index = 0\n      base = 1\n      queue = Object.create(null)\n      map = Object.create(null)\n    }\n  }\n}\n","// function utils\n\nimport { lruQueue } from './lruQueue.js'\n\n/**\n * Memoize a given function by caching the computed result.\n * The cache of a memoized function can be cleared by deleting the `cache`\n * property of the function.\n *\n * @param {function} fn                     The function to be memoized.\n *                                          Must be a pure function.\n * @param {Object} [options]\n * @param {function(args: Array): string} [options.hasher]\n *    A custom hash builder. Is JSON.stringify by default.\n * @param {number | undefined} [options.limit]\n *    Maximum number of values that may be cached. Undefined indicates\n *    unlimited (default)\n * @return {function}                       Returns the memoized function\n */\nexport function memoize (fn, { hasher, limit } = {}) {\n  limit = limit == null ? Number.POSITIVE_INFINITY : limit\n  hasher = hasher == null ? JSON.stringify : hasher\n\n  return function memoize () {\n    if (typeof memoize.cache !== 'object') {\n      memoize.cache = {\n        values: new Map(),\n        lru: lruQueue(limit || Number.POSITIVE_INFINITY)\n      }\n    }\n    const args = []\n    for (let i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i]\n    }\n    const hash = hasher(args)\n\n    if (memoize.cache.values.has(hash)) {\n      memoize.cache.lru.hit(hash)\n      return memoize.cache.values.get(hash)\n    }\n\n    const newVal = fn.apply(fn, args)\n    memoize.cache.values.set(hash, newVal)\n    memoize.cache.values.delete(memoize.cache.lru.hit(hash))\n\n    return newVal\n  }\n}\n\n/**\n * Memoize a given function by caching all results and the arguments,\n * and comparing against the arguments of previous results before\n * executing again.\n * This is less performant than `memoize` which calculates a hash,\n * which is very fast to compare. Use `memoizeCompare` only when it is\n * not possible to create a unique serializable hash from the function\n * arguments.\n * The isEqual function must compare two sets of arguments\n * and return true when equal (can be a deep equality check for example).\n * @param {function} fn\n * @param {function(a: *, b: *) : boolean} isEqual\n * @returns {function}\n */\nexport function memoizeCompare (fn, isEqual) {\n  const memoize = function memoize () {\n    const args = []\n    for (let i = 0; i < arguments.length; i++) {\n      args[i] = arguments[i]\n    }\n\n    for (let c = 0; c < memoize.cache.length; c++) {\n      const cached = memoize.cache[c]\n\n      if (isEqual(args, cached.args)) {\n        // TODO: move this cache entry to the top so recently used entries move up?\n        return cached.res\n      }\n    }\n\n    const res = fn.apply(fn, args)\n    memoize.cache.unshift({ args, res })\n\n    return res\n  }\n\n  memoize.cache = []\n\n  return memoize\n}\n","import { memoize } from '../function.js'\n\n/**\n * Calculate BigNumber e\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns e\n */\nexport const createBigNumberE = memoize(function (BigNumber) {\n  return new BigNumber(1).exp()\n}, { hasher })\n\n/**\n * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns phi\n */\nexport const createBigNumberPhi = memoize(function (BigNumber) {\n  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2)\n}, { hasher })\n\n/**\n * Calculate BigNumber pi.\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns pi\n */\nexport const createBigNumberPi = memoize(function (BigNumber) {\n  return BigNumber.acos(-1)\n}, { hasher })\n\n/**\n * Calculate BigNumber tau, tau = 2 * pi\n * @param {function} BigNumber   BigNumber constructor\n * @returns {BigNumber} Returns tau\n */\nexport const createBigNumberTau = memoize(function (BigNumber) {\n  return createBigNumberPi(BigNumber).times(2)\n}, { hasher })\n\n/**\n * Create a hash for a BigNumber constructor function. The created has is\n * the configured precision\n * @param {Array} args         Supposed to contain a single entry with\n *                             a BigNumber constructor\n * @return {number} precision\n * @private\n */\nfunction hasher (args) {\n  return args[0].precision\n}\n","import { isComplex, isUnit, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { memoize } from '../../utils/function.js'\nimport { endsWith } from '../../utils/string.js'\nimport { clone, hasOwnProperty } from '../../utils/object.js'\nimport { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js'\n\nconst name = 'Unit'\nconst dependencies = [\n  '?on',\n  'config',\n  'addScalar',\n  'subtractScalar',\n  'multiplyScalar',\n  'divideScalar',\n  'pow',\n  'abs',\n  'fix',\n  'round',\n  'equal',\n  'isNumeric',\n  'format',\n  'toBest',\n  'number',\n  'Complex',\n  'BigNumber',\n  'Fraction'\n]\n\nexport const createUnitClass = /* #__PURE__ */ factory(name, dependencies, ({\n  on,\n  config,\n  addScalar,\n  subtractScalar,\n  multiplyScalar,\n  divideScalar,\n  pow,\n  abs,\n  fix,\n  round,\n  equal,\n  isNumeric,\n  format,\n  toBest,\n  number,\n  Complex,\n  BigNumber,\n  Fraction\n}) => {\n  const toNumber = number\n  /**\n   * A unit can be constructed in the following ways:\n   *\n   *     const a = new Unit(value, valuelessUnit)\n   *     const b = new Unit(null, valuelessUnit)\n   *     const c = Unit.parse(str)\n   *\n   * Example usage:\n   *\n   *     const a = new Unit(5, 'cm')               // 50 mm\n   *     const b = Unit.parse('23 kg')             // 23 kg\n   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m\n   *     const d = new Unit(9.81, \"m/s^2\")         // 9.81 m/s^2\n   *\n   * @class Unit\n   * @constructor Unit\n   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2\n   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like \"cm\"\n   */\n  function Unit (value, valuelessUnit) {\n    if (!(this instanceof Unit)) {\n      throw new Error('Constructor must be called with the new operator')\n    }\n\n    if (!(value === null || value === undefined || isNumeric(value) || isComplex(value))) {\n      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined')\n    }\n\n    this.fixPrefix = false // if true, function format will not search for the\n    // best prefix but leave it as initially provided.\n    // fixPrefix is set true by the method Unit.to\n\n    // The justification behind this is that if the constructor is explicitly called,\n    // the caller wishes the units to be returned exactly as supplied.\n    this.skipAutomaticSimplification = true\n\n    if (valuelessUnit === undefined) {\n      this.units = []\n      this.dimensions = BASE_DIMENSIONS.map(x => 0)\n    } else if (typeof valuelessUnit === 'string') {\n      const u = Unit.parse(valuelessUnit)\n      this.units = u.units\n      this.dimensions = u.dimensions\n    } else if (isUnit(valuelessUnit) && valuelessUnit.value === null) {\n      // clone from valuelessUnit\n      this.fixPrefix = valuelessUnit.fixPrefix\n      this.skipAutomaticSimplification = valuelessUnit.skipAutomaticSimplification\n      this.dimensions = valuelessUnit.dimensions.slice(0)\n      this.units = valuelessUnit.units.map(u => Object.assign({}, u))\n    } else {\n      throw new TypeError('Second parameter in Unit constructor must be a string or valueless Unit')\n    }\n\n    this.value = this._normalize(value)\n  }\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(Unit, 'name', { value: 'Unit' })\n  Unit.prototype.constructor = Unit\n  Unit.prototype.type = 'Unit'\n  Unit.prototype.isUnit = true\n\n  // private variables and functions for the Unit parser\n  let text, index, c\n\n  function skipWhitespace () {\n    while (c === ' ' || c === '\\t') {\n      next()\n    }\n  }\n\n  function isDigitDot (c) {\n    return ((c >= '0' && c <= '9') || c === '.')\n  }\n\n  function isDigit (c) {\n    return ((c >= '0' && c <= '9'))\n  }\n\n  function next () {\n    index++\n    c = text.charAt(index)\n  }\n\n  function revert (oldIndex) {\n    index = oldIndex\n    c = text.charAt(index)\n  }\n\n  function parseNumber () {\n    let number = ''\n    const oldIndex = index\n\n    if (c === '+') {\n      next()\n    } else if (c === '-') {\n      number += c\n      next()\n    }\n\n    if (!isDigitDot(c)) {\n      // a + or - must be followed by a digit\n      revert(oldIndex)\n      return null\n    }\n\n    // get number, can have a single dot\n    if (c === '.') {\n      number += c\n      next()\n      if (!isDigit(c)) {\n        // this is no legal number, it is just a dot\n        revert(oldIndex)\n        return null\n      }\n    } else {\n      while (isDigit(c)) {\n        number += c\n        next()\n      }\n      if (c === '.') {\n        number += c\n        next()\n      }\n    }\n    while (isDigit(c)) {\n      number += c\n      next()\n    }\n\n    // check for exponential notation like \"2.3e-4\" or \"1.23e50\"\n    if (c === 'E' || c === 'e') {\n      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as \"4exabytes\"\n\n      let tentativeNumber = ''\n      const tentativeIndex = index\n\n      tentativeNumber += c\n      next()\n\n      if (c === '+' || c === '-') {\n        tentativeNumber += c\n        next()\n      }\n\n      // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)\n      if (!isDigit(c)) {\n        // The e or E must belong to something else, so return the number without the e or E.\n        revert(tentativeIndex)\n        return number\n      }\n\n      // We can now safely say that this is scientific notation.\n      number = number + tentativeNumber\n      while (isDigit(c)) {\n        number += c\n        next()\n      }\n    }\n\n    return number\n  }\n\n  function parseUnit () {\n    let unitName = ''\n\n    // Alphanumeric characters only; matches [a-zA-Z0-9]\n    while (isDigit(c) || Unit.isValidAlpha(c)) {\n      unitName += c\n      next()\n    }\n\n    // Must begin with [a-zA-Z]\n    const firstC = unitName.charAt(0)\n    if (Unit.isValidAlpha(firstC)) {\n      return unitName\n    } else {\n      return null\n    }\n  }\n\n  function parseCharacter (toFind) {\n    if (c === toFind) {\n      next()\n      return toFind\n    } else {\n      return null\n    }\n  }\n\n  /**\n   * Parse a string into a unit. The value of the unit is parsed as number,\n   * BigNumber, or Fraction depending on the math.js config setting `number`.\n   *\n   * Throws an exception if the provided string does not contain a valid unit or\n   * cannot be parsed.\n   * @memberof Unit\n   * @param {string} str        A string like \"5.2 inch\", \"4e2 cm/s^2\"\n   * @return {Unit} unit\n   */\n  Unit.parse = function (str, options) {\n    options = options || {}\n    text = str\n    index = -1\n    c = ''\n\n    if (typeof text !== 'string') {\n      throw new TypeError('Invalid argument in Unit.parse, string expected')\n    }\n\n    const unit = new Unit()\n    unit.units = []\n\n    let powerMultiplierCurrent = 1\n    let expectingUnit = false\n\n    // A unit should follow this pattern:\n    // [number] ...[ [*/] unit[^number] ]\n    // unit[^number] ... [ [*/] unit[^number] ]\n\n    // Rules:\n    // number is any floating point number.\n    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!\n    // The string may optionally begin with a number.\n    // Each unit may optionally be followed by ^number.\n    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:\n    //   2m^2kg/s^2\n    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:\n    //   4erg\n\n    next()\n    skipWhitespace()\n\n    // Optional number at the start of the string\n    const valueStr = parseNumber()\n    let value = null\n    if (valueStr) {\n      if (config.number === 'BigNumber') {\n        value = new BigNumber(valueStr)\n      } else if (config.number === 'Fraction') {\n        try {\n          // not all numbers can be turned in Fractions, for example very small numbers not\n          value = new Fraction(valueStr)\n        } catch (err) {\n          value = parseFloat(valueStr)\n        }\n      } else { // number\n        value = parseFloat(valueStr)\n      }\n\n      skipWhitespace() // Whitespace is not required here\n\n      // handle multiplication or division right after the value, like '1/s'\n      if (parseCharacter('*')) {\n        powerMultiplierCurrent = 1\n        expectingUnit = true\n      } else if (parseCharacter('/')) {\n        powerMultiplierCurrent = -1\n        expectingUnit = true\n      }\n    }\n\n    // Stack to keep track of powerMultipliers applied to each parentheses group\n    const powerMultiplierStack = []\n\n    // Running product of all elements in powerMultiplierStack\n    let powerMultiplierStackProduct = 1\n\n    while (true) {\n      skipWhitespace()\n\n      // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack\n      // A '(' will always appear directly before a unit.\n      while (c === '(') {\n        powerMultiplierStack.push(powerMultiplierCurrent)\n        powerMultiplierStackProduct *= powerMultiplierCurrent\n        powerMultiplierCurrent = 1\n        next()\n        skipWhitespace()\n      }\n\n      // Is there something here?\n      let uStr\n      if (c) {\n        const oldC = c\n        uStr = parseUnit()\n        if (uStr === null) {\n          throw new SyntaxError('Unexpected \"' + oldC + '\" in \"' + text + '\" at index ' + index.toString())\n        }\n      } else {\n        // End of input.\n        break\n      }\n\n      // Verify the unit exists and get the prefix (if any)\n      const res = _findUnit(uStr)\n      if (res === null) {\n        // Unit not found.\n        throw new SyntaxError('Unit \"' + uStr + '\" not found.')\n      }\n\n      let power = powerMultiplierCurrent * powerMultiplierStackProduct\n      // Is there a \"^ number\"?\n      skipWhitespace()\n      if (parseCharacter('^')) {\n        skipWhitespace()\n        const p = parseNumber()\n        if (p === null) {\n          // No valid number found for the power!\n          throw new SyntaxError('In \"' + str + '\", \"^\" must be followed by a floating-point number')\n        }\n        power *= p\n      }\n\n      // Add the unit to the list\n      unit.units.push({\n        unit: res.unit,\n        prefix: res.prefix,\n        power\n      })\n      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power\n      }\n\n      // Check for and consume closing parentheses, popping from the stack.\n      // A ')' will always follow a unit.\n      skipWhitespace()\n      while (c === ')') {\n        if (powerMultiplierStack.length === 0) {\n          throw new SyntaxError('Unmatched \")\" in \"' + text + '\" at index ' + index.toString())\n        }\n        powerMultiplierStackProduct /= powerMultiplierStack.pop()\n        next()\n        skipWhitespace()\n      }\n\n      // \"*\" and \"/\" should mean we are expecting something to come next.\n      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.\n      expectingUnit = false\n\n      if (parseCharacter('*')) {\n        // explicit multiplication\n        powerMultiplierCurrent = 1\n        expectingUnit = true\n      } else if (parseCharacter('/')) {\n        // division\n        powerMultiplierCurrent = -1\n        expectingUnit = true\n      } else {\n        // implicit multiplication\n        powerMultiplierCurrent = 1\n      }\n\n      // Replace the unit into the auto unit system\n      if (res.unit.base) {\n        const baseDim = res.unit.base.key\n        UNIT_SYSTEMS.auto[baseDim] = {\n          unit: res.unit,\n          prefix: res.prefix\n        }\n      }\n    }\n\n    // Has the string been entirely consumed?\n    skipWhitespace()\n    if (c) {\n      throw new SyntaxError('Could not parse: \"' + str + '\"')\n    }\n\n    // Is there a trailing slash?\n    if (expectingUnit) {\n      throw new SyntaxError('Trailing characters: \"' + str + '\"')\n    }\n\n    // Is the parentheses stack empty?\n    if (powerMultiplierStack.length !== 0) {\n      throw new SyntaxError('Unmatched \"(\" in \"' + text + '\"')\n    }\n\n    // Are there any units at all?\n    if (unit.units.length === 0 && !options.allowNoUnits) {\n      throw new SyntaxError('\"' + str + '\" contains no units')\n    }\n\n    unit.value = (value !== undefined) ? unit._normalize(value) : null\n    return unit\n  }\n\n  /**\n   * create a copy of this unit\n   * @memberof Unit\n   * @return {Unit} Returns a cloned version of the unit\n   */\n  Unit.prototype.clone = function () {\n    const unit = new Unit()\n\n    unit.fixPrefix = this.fixPrefix\n    unit.skipAutomaticSimplification = this.skipAutomaticSimplification\n\n    unit.value = clone(this.value)\n    unit.dimensions = this.dimensions.slice(0)\n    unit.units = []\n    for (let i = 0; i < this.units.length; i++) {\n      unit.units[i] = { }\n      for (const p in this.units[i]) {\n        if (hasOwnProperty(this.units[i], p)) {\n          unit.units[i][p] = this.units[i][p]\n        }\n      }\n    }\n\n    return unit\n  }\n\n  /**\n   * Return the type of the value of this unit\n   *\n   * @memberof Unit\n   * @return {string} type of the value of the unit\n   */\n  Unit.prototype.valueType = function () {\n    return typeOf(this.value)\n  }\n\n  /**\n   * Return whether the unit is derived (such as m/s, or cm^2, but not N)\n   * @memberof Unit\n   * @return {boolean} True if the unit is derived\n   * @private\n   */\n  Unit.prototype._isDerived = function () {\n    if (this.units.length === 0) {\n      return false\n    }\n    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15\n  }\n\n  /**\n   * Normalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number | BigNumber | Fraction | boolean} value\n   * @return {number | BigNumber | Fraction | boolean} normalized value\n   * @private\n   */\n  Unit.prototype._normalize = function (value) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value\n    }\n    let res = value\n    const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n    for (let i = 0; i < this.units.length; i++) {\n      const unitValue = convert(this.units[i].unit.value)\n      const unitPrefixValue = convert(this.units[i].prefix.value)\n      const unitPower = convert(this.units[i].power)\n      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower))\n    }\n\n    return res\n  }\n\n  /**\n   * Denormalize a value, based on its currently set unit(s)\n   * @memberof Unit\n   * @param {number} value\n   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)\n   * @return {number} denormalized value\n   * @private\n   */\n  Unit.prototype._denormalize = function (value, prefixValue) {\n    if (value === null || value === undefined || this.units.length === 0) {\n      return value\n    }\n    let res = value\n    const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n    for (let i = 0; i < this.units.length; i++) {\n      const unitValue = convert(this.units[i].unit.value)\n      const unitPrefixValue = convert(this.units[i].prefix.value)\n      const unitPower = convert(this.units[i].power)\n      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower))\n    }\n\n    return res\n  }\n\n  /**\n   * Find a unit from a string\n   * @memberof Unit\n   * @param {string} str              A string like 'cm' or 'inch'\n   * @returns {Object | null} result  When found, an object with fields unit and\n   *                                  prefix is returned. Else, null is returned.\n   * @private\n   */\n  const _findUnit = memoize((str) => {\n    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.\n    if (hasOwnProperty(UNITS, str)) {\n      const unit = UNITS[str]\n      const prefix = unit.prefixes['']\n      return { unit, prefix }\n    }\n\n    for (const name in UNITS) {\n      if (hasOwnProperty(UNITS, name)) {\n        if (endsWith(str, name)) {\n          const unit = UNITS[name]\n          const prefixLen = (str.length - name.length)\n          const prefixName = str.substring(0, prefixLen)\n          const prefix = hasOwnProperty(unit.prefixes, prefixName)\n            ? unit.prefixes[prefixName]\n            : undefined\n          if (prefix !== undefined) {\n            // store unit, prefix, and value\n            return { unit, prefix }\n          }\n        }\n      }\n    }\n\n    return null\n  }, { hasher: (args) => args[0], limit: 100 })\n\n  /**\n   * Test if the given expression is a unit.\n   * The unit can have a prefix but cannot have a value.\n   * @memberof Unit\n   * @param {string} name   A string to be tested whether it is a value less unit.\n   *                        The unit can have prefix, like \"cm\"\n   * @return {boolean}      true if the given string is a unit\n   */\n  Unit.isValuelessUnit = function (name) {\n    return (_findUnit(name) !== null)\n  }\n\n  /**\n   * check if this unit has given base unit\n   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.\n   * @memberof Unit\n   * @param {BASE_UNIT | string | undefined} base\n   */\n  Unit.prototype.hasBase = function (base) {\n    if (typeof (base) === 'string') {\n      base = BASE_UNITS[base]\n    }\n\n    if (!base) { return false }\n\n    // All dimensions must be the same\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {\n        return false\n      }\n    }\n    return true\n  }\n\n  /**\n   * Check if this unit has a base or bases equal to another base or bases\n   * For derived units, the exponent on each base also must match\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if equal base\n   */\n  Unit.prototype.equalBase = function (other) {\n    // All dimensions must be the same\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {\n        return false\n      }\n    }\n    return true\n  }\n\n  /**\n   * Check if this unit equals another unit\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {boolean} true if both units are equal\n   */\n  Unit.prototype.equals = function (other) {\n    return (this.equalBase(other) && equal(this.value, other.value))\n  }\n\n  /**\n   * Multiply this unit with another one or with a scalar\n   * @memberof Unit\n   * @param {Unit} other\n   * @return {Unit} product of this unit and the other unit\n   */\n  Unit.prototype.multiply = function (_other) {\n    const res = this.clone()\n    const other = isUnit(_other) ? _other : new Unit(_other)\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0)\n    }\n\n    // Append other's units list onto res\n    for (let i = 0; i < other.units.length; i++) {\n      // Make a shallow copy of every unit\n      const inverted = {\n        ...other.units[i]\n      }\n      res.units.push(inverted)\n    }\n\n    // If at least one operand has a value, then the result should also have a value\n    if (this.value !== null || other.value !== null) {\n      const valThis = this.value === null ? this._normalize(one(other.value)) : this.value\n      const valOther = other.value === null ? other._normalize(one(this.value)) : other.value\n\n      res.value = multiplyScalar(valThis, valOther)\n    } else {\n      res.value = null\n    }\n\n    if (isUnit(_other)) {\n      res.skipAutomaticSimplification = false\n    }\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Divide a number by this unit\n   *\n   * @memberof Unit\n   * @param {numeric} numerator\n   * @param {unit} result of dividing numerator by this unit\n   */\n  Unit.prototype.divideInto = function (numerator) {\n    return new Unit(numerator).divide(this)\n  }\n\n  /**\n   * Divide this unit by another one\n   * @memberof Unit\n   * @param {Unit | numeric} other\n   * @return {Unit} result of dividing this unit by the other unit\n   */\n  Unit.prototype.divide = function (_other) {\n    const res = this.clone()\n    const other = isUnit(_other) ? _other : new Unit(_other)\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0)\n    }\n\n    // Invert and append other's units list onto res\n    for (let i = 0; i < other.units.length; i++) {\n      // Make a shallow copy of every unit\n      const inverted = {\n        ...other.units[i],\n        power: -other.units[i].power\n      }\n      res.units.push(inverted)\n    }\n\n    // If at least one operand has a value, the result should have a value\n    if (this.value !== null || other.value !== null) {\n      const valThis = this.value === null ? this._normalize(one(other.value)) : this.value\n      const valOther = other.value === null ? other._normalize(one(this.value)) : other.value\n      res.value = divideScalar(valThis, valOther)\n    } else {\n      res.value = null\n    }\n\n    if (isUnit(_other)) {\n      res.skipAutomaticSimplification = false\n    }\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Calculate the power of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} p\n   * @returns {Unit}      The result: this^p\n   */\n  Unit.prototype.pow = function (p) {\n    const res = this.clone()\n\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      // Dimensions arrays may be of different lengths. Default to 0.\n      res.dimensions[i] = (this.dimensions[i] || 0) * p\n    }\n\n    // Adjust the power of each unit in the list\n    for (let i = 0; i < res.units.length; i++) {\n      res.units[i].power *= p\n    }\n\n    if (res.value !== null) {\n      res.value = pow(res.value, p)\n\n      // only allow numeric output, we don't want to return a Complex number\n      // if (!isNumeric(res.value)) {\n      //  res.value = NaN\n      // }\n      // Update: Complex supported now\n    } else {\n      res.value = null\n    }\n\n    res.skipAutomaticSimplification = false\n\n    return getNumericIfUnitless(res)\n  }\n\n  /**\n   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise\n   * @param {Unit} unit\n   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise\n   */\n  function getNumericIfUnitless (unit) {\n    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {\n      return unit.value\n    } else {\n      return unit\n    }\n  }\n\n  /**\n   * Create a value one with the numeric type of `typeOfValue`.\n   * For example, `one(new BigNumber(3))` returns `BigNumber(1)`\n   * @param {number | Fraction | BigNumber} typeOfValue\n   * @returns {number | Fraction | BigNumber}\n   */\n  function one (typeOfValue) {\n    // TODO: this is a workaround to prevent the following BigNumber conversion error from throwing:\n    //  \"TypeError: Cannot implicitly convert a number with >15 significant digits to BigNumber\"\n    //  see https://github.com/josdejong/mathjs/issues/3450\n    //      https://github.com/josdejong/mathjs/pull/3375\n    const convert = Unit._getNumberConverter(typeOf(typeOfValue))\n\n    return convert(1)\n  }\n\n  /**\n   * Calculate the absolute value of a unit\n   * @memberof Unit\n   * @param {number | Fraction | BigNumber} x\n   * @returns {Unit}      The result: |x|, absolute value of x\n   */\n  Unit.prototype.abs = function () {\n    const ret = this.clone()\n    if (ret.value !== null) {\n      if (ret._isDerived() || ret.units.length === 0 || ret.units[0].unit.offset === 0) {\n        ret.value = abs(ret.value)\n      } else {\n        // To give the correct, but unexpected, results for units with an offset.\n        // For example, abs(-283.15 degC) = -263.15 degC !!!\n        // We must take the offset into consideration here\n        const convert = ret._numberConverter() // convert to Fraction or BigNumber if needed\n        const unitValue = convert(ret.units[0].unit.value)\n        const nominalOffset = convert(ret.units[0].unit.offset)\n        const unitOffset = multiplyScalar(unitValue, nominalOffset)\n        ret.value = subtractScalar(abs(addScalar(ret.value, unitOffset)), unitOffset)\n      }\n    }\n\n    for (const i in ret.units) {\n      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {\n        ret.units[i].unit = UNITS.W\n      }\n    }\n\n    return ret\n  }\n\n  /**\n   * Convert the unit to a specific unit name.\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like \"cm\"\n   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.\n   */\n  Unit.prototype.to = function (valuelessUnit) {\n    const value = this.value === null ? this._normalize(1) : this.value\n    let other\n    if (typeof valuelessUnit === 'string') {\n      other = Unit.parse(valuelessUnit)\n    } else if (isUnit(valuelessUnit)) {\n      other = valuelessUnit.clone()\n    } else {\n      throw new Error('String or Unit expected as parameter')\n    }\n\n    if (!this.equalBase(other)) {\n      throw new Error(`Units do not match ('${other.toString()}' != '${this.toString()}')`)\n    }\n    if (other.value !== null) {\n      throw new Error('Cannot convert to a unit with a value')\n    }\n\n    if (this.value === null || this._isDerived() ||\n        this.units.length === 0 || other.units.length === 0 ||\n        this.units[0].unit.offset === other.units[0].unit.offset) {\n      other.value = clone(value)\n    } else {\n      /* Need to adjust value by difference in offset to convert */\n      const convert = Unit._getNumberConverter(typeOf(value)) // convert to Fraction or BigNumber if needed\n\n      const thisUnitValue = this.units[0].unit.value\n      const thisNominalOffset = this.units[0].unit.offset\n      const thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset)\n\n      const otherUnitValue = other.units[0].unit.value\n      const otherNominalOffset = other.units[0].unit.offset\n      const otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset)\n\n      other.value = addScalar(value, convert(subtractScalar(thisUnitOffset, otherUnitOffset)))\n    }\n    other.fixPrefix = true\n    other.skipAutomaticSimplification = true\n    return other\n  }\n\n  /**\n   * Return the value of the unit when represented with given valueless unit\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number} Returns the unit value as number.\n   */\n  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric\n  Unit.prototype.toNumber = function (valuelessUnit) {\n    return toNumber(this.toNumeric(valuelessUnit))\n  }\n\n  /**\n   * Return the value of the unit in the original numeric type\n   * @memberof Unit\n   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'\n   * @return {number | BigNumber | Fraction} Returns the unit value\n   */\n  Unit.prototype.toNumeric = function (valuelessUnit) {\n    let other\n    if (valuelessUnit) {\n      // Allow getting the numeric value without converting to a different unit\n      other = this.to(valuelessUnit)\n    } else {\n      other = this.clone()\n    }\n\n    if (other._isDerived() || other.units.length === 0) {\n      return other._denormalize(other.value)\n    } else {\n      return other._denormalize(other.value, other.units[0].prefix.value)\n    }\n  }\n\n  /**\n   * Get a string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.toString = function () {\n    return this.format()\n  }\n\n  /**\n   * Get a JSON representation of the unit\n   * @memberof Unit\n   * @returns {Object} Returns a JSON object structured as:\n   *                   `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   */\n  Unit.prototype.toJSON = function () {\n    return {\n      mathjs: 'Unit',\n      value: this._denormalize(this.value),\n      unit: this.units.length > 0 ? this.formatUnits() : null,\n      fixPrefix: this.fixPrefix\n    }\n  }\n\n  /**\n   * Instantiate a Unit from a JSON object\n   * @memberof Unit\n   * @param {Object} json  A JSON object structured as:\n   *                       `{\"mathjs\": \"Unit\", \"value\": 2, \"unit\": \"cm\", \"fixPrefix\": false}`\n   * @return {Unit}\n   */\n  Unit.fromJSON = function (json) {\n    const unit = new Unit(json.value, json.unit ?? undefined)\n    unit.fixPrefix = json.fixPrefix || false\n    return unit\n  }\n\n  /**\n   * Returns the string representation of the unit.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.valueOf = Unit.prototype.toString\n\n  /**\n   * Simplify this Unit's unit list and return a new Unit with the simplified list.\n   * The returned Unit will contain a list of the \"best\" units for formatting.\n   */\n  Unit.prototype.simplify = function () {\n    const ret = this.clone()\n\n    const proposedUnitList = []\n\n    // Search for a matching base\n    let matchingBase\n    for (const key in currentUnitSystem) {\n      if (hasOwnProperty(currentUnitSystem, key)) {\n        if (ret.hasBase(BASE_UNITS[key])) {\n          matchingBase = key\n          break\n        }\n      }\n    }\n\n    if (matchingBase === 'NONE') {\n      ret.units = []\n    } else {\n      let matchingUnit\n      if (matchingBase) {\n        // Does the unit system have a matching unit?\n        if (hasOwnProperty(currentUnitSystem, matchingBase)) {\n          matchingUnit = currentUnitSystem[matchingBase]\n        }\n      }\n      if (matchingUnit) {\n        ret.units = [{\n          unit: matchingUnit.unit,\n          prefix: matchingUnit.prefix,\n          power: 1.0\n        }]\n      } else {\n        // Multiple units or units with powers are formatted like this:\n        // 5 (kg m^2) / (s^3 mol)\n        // Build an representation from the base units of the current unit system\n        let missingBaseDim = false\n        for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n          const baseDim = BASE_DIMENSIONS[i]\n          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n            if (hasOwnProperty(currentUnitSystem, baseDim)) {\n              proposedUnitList.push({\n                unit: currentUnitSystem[baseDim].unit,\n                prefix: currentUnitSystem[baseDim].prefix,\n                power: ret.dimensions[i] || 0\n              })\n            } else {\n              missingBaseDim = true\n            }\n          }\n        }\n\n        // Is the proposed unit list \"simpler\" than the existing one?\n        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {\n          // Replace this unit list with the proposed list\n          ret.units = proposedUnitList\n        }\n      }\n    }\n\n    return ret\n  }\n\n  /**\n   * Returns a new Unit in the SI system with the same value as this one\n   */\n  Unit.prototype.toSI = function () {\n    const ret = this.clone()\n\n    const proposedUnitList = []\n\n    // Multiple units or units with powers are formatted like this:\n    // 5 (kg m^2) / (s^3 mol)\n    // Build an representation from the base units of the SI unit system\n    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n      const baseDim = BASE_DIMENSIONS[i]\n      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {\n        if (hasOwnProperty(UNIT_SYSTEMS.si, baseDim)) {\n          proposedUnitList.push({\n            unit: UNIT_SYSTEMS.si[baseDim].unit,\n            prefix: UNIT_SYSTEMS.si[baseDim].prefix,\n            power: ret.dimensions[i] || 0\n          })\n        } else {\n          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units')\n        }\n      }\n    }\n\n    // Replace this unit list with the proposed list\n    ret.units = proposedUnitList\n\n    ret.fixPrefix = true\n    ret.skipAutomaticSimplification = true\n\n    if (this.value !== null) {\n      ret.value = null\n      return this.to(ret)\n    }\n    return ret\n  }\n\n  /**\n   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.\n   * @memberof Unit\n   * @return {string}\n   */\n  Unit.prototype.formatUnits = function () {\n    let strNum = ''\n    let strDen = ''\n    let nNum = 0\n    let nDen = 0\n\n    for (let i = 0; i < this.units.length; i++) {\n      if (this.units[i].power > 0) {\n        nNum++\n        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {\n          strNum += '^' + this.units[i].power\n        }\n      } else if (this.units[i].power < 0) {\n        nDen++\n      }\n    }\n\n    if (nDen > 0) {\n      for (let i = 0; i < this.units.length; i++) {\n        if (this.units[i].power < 0) {\n          if (nNum > 0) {\n            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n            if (Math.abs(this.units[i].power + 1.0) > 1e-15) {\n              strDen += '^' + (-this.units[i].power)\n            }\n          } else {\n            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name\n            strDen += '^' + (this.units[i].power)\n          }\n        }\n      }\n    }\n    // Remove leading \" \"\n    strNum = strNum.substr(1)\n    strDen = strDen.substr(1)\n\n    // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting\n    if (nNum > 1 && nDen > 0) {\n      strNum = '(' + strNum + ')'\n    }\n    if (nDen > 1 && nNum > 0) {\n      strDen = '(' + strDen + ')'\n    }\n\n    let str = strNum\n    if (nNum > 0 && nDen > 0) {\n      str += ' / '\n    }\n    str += strDen\n\n    return str\n  }\n\n  /**\n   * Get a unit, with optional formatting options.\n   * @memberof Unit\n   * @param {string[] | Unit[]} [units]  Array of units strings or valueLess Unit objects in wich choose the best one\n   * @param {Object} [options]  Options for parsing the unit. See parseUnit for details.\n   *\n   * @return {Unit} Returns a new Unit with the given value and unit.\n   */\n  Unit.prototype.toBest = function (unitList = [], options = {}) {\n    if (unitList && !Array.isArray(unitList)) {\n      throw new Error('Invalid unit type. Expected string or Unit.')\n    }\n\n    const startPrefixes = this.units[0].unit.prefixes\n    if (unitList && unitList.length > 0) {\n      const unitObjects = unitList.map(u => {\n        let unit = null\n        if (typeof u === 'string') {\n          unit = Unit.parse(u)\n          if (!unit) {\n            throw new Error('Invalid unit type. Expected compatible string or Unit.')\n          }\n        } else if (!isUnit(u)) {\n          throw new Error('Invalid unit type. Expected compatible string or Unit.')\n        }\n        if (unit === null) {\n          unit = u.clone()\n        }\n        try {\n          this.to(unit.formatUnits())\n          return unit\n        } catch (e) {\n          throw new Error('Invalid unit type. Expected compatible string or Unit.')\n        }\n      })\n      const prefixes = unitObjects.map(el => el.units[0].prefix)\n      this.units[0].unit.prefixes = prefixes.reduce((acc, prefix) => {\n        acc[prefix.name] = prefix\n        return acc\n      }, {})\n      this.units[0].prefix = prefixes[0]\n    }\n\n    const result = formatBest(this, options).simp\n    this.units[0].unit.prefixes = startPrefixes\n    result.fixPrefix = true\n    return result\n  }\n  /**\n   * Get a string representation of the Unit, with optional formatting options.\n   * @memberof Unit\n   * @param {Object | number | Function} [options]  Formatting options. See\n   *                                                lib/utils/number:format for a\n   *                                                description of the available\n   *                                                options.\n   * @return {string}\n   */\n  Unit.prototype.format = function (options) {\n    const { simp, valueStr, unitStr } = formatBest(this, options)\n    let str = valueStr\n    if (simp.value && isComplex(simp.value)) {\n      str = '(' + str + ')' // Surround complex values with ( ) to enable better parsing\n    }\n    if (unitStr.length > 0 && str.length > 0) {\n      str += ' '\n    }\n    str += unitStr\n\n    return str\n  }\n\n  /**\n * Helper function to normalize a unit for conversion and formatting\n * @param {Unit} unit The unit to be normalized\n * @return {Object} Object with normalized unit and value\n * @private\n */\n  function formatBest (unit, options = {}) {\n    // Simplfy the unit list, unless it is valueless or was created directly in the\n    // constructor or as the result of to or toSI\n    const simp = unit.skipAutomaticSimplification || unit.value === null\n      ? unit.clone()\n      : unit.simplify()\n\n    // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.\n    handleVAandVARUnits(simp)\n    // Now apply the best prefix\n    // Units must have only one unit and not have the fixPrefix flag set\n    applyBestPrefixIfNeeded(simp, options.offset)\n\n    const value = simp._denormalize(simp.value)\n    const valueStr = (simp.value !== null) ? format(value, options || {}) : ''\n    const unitStr = simp.formatUnits()\n    return {\n      simp,\n      valueStr,\n      unitStr\n    }\n  }\n\n  /**\n   * Helper to handle VA and VAR units\n   * @param {Unit} simp The unit to be normalized\n   */\n  function handleVAandVARUnits (simp) {\n    let isImaginary = false\n    if (typeof (simp.value) !== 'undefined' && simp.value !== null && isComplex(simp.value)) {\n      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute\n      isImaginary = Math.abs(simp.value.re) < 1e-14\n    }\n    for (const i in simp.units) {\n      if (hasOwnProperty(simp.units, i)) {\n        if (simp.units[i].unit) {\n          if (simp.units[i].unit.name === 'VA' && isImaginary) {\n            simp.units[i].unit = UNITS.VAR\n          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {\n            simp.units[i].unit = UNITS.VA\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Helper to apply the best prefix if needed\n   * @param {Unit} simp The unit to be normalized\n   */\n  function applyBestPrefixIfNeeded (simp, offset) {\n    if (simp.units.length === 1 && !simp.fixPrefix) {\n      // Units must have integer powers, otherwise the prefix will change the\n      // outputted value by not-an-integer-power-of-ten\n      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {\n        // Apply the best prefix\n        simp.units[0].prefix = simp._bestPrefix(offset)\n      }\n    }\n  }\n\n  /**\n   * Calculate the best prefix using current value.\n   * @memberof Unit\n   * @returns {Object} prefix\n   * @param {number} [offset]  Optional offset for the best prefix calculation (default 1.2)\n   * @private\n   */\n  Unit.prototype._bestPrefix = function (offset = 1.2) {\n    if (this.units.length !== 1) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!')\n    }\n    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {\n      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!')\n    }\n\n    // find the best prefix value (resulting in the value of which\n    // the absolute value of the log10 is closest to zero,\n    // though with a little offset of 1.2 for nicer values: you get a\n    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...\n\n    // Note: the units value can be any numeric type, but to find the best\n    // prefix it's enough to work with limited precision of a regular number\n    // Update: using mathjs abs since we also allow complex numbers\n    const absValue = this.value !== null ? abs(this.value) : 0\n    const absUnitValue = abs(this.units[0].unit.value)\n    let bestPrefix = this.units[0].prefix\n    if (absValue === 0) {\n      return bestPrefix\n    }\n    const power = this.units[0].power\n    let bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - offset\n    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix // Allow the original prefix\n    bestDiff = Math.abs(bestDiff)\n    const prefixes = this.units[0].unit.prefixes\n    for (const p in prefixes) {\n      if (hasOwnProperty(prefixes, p)) {\n        const prefix = prefixes[p]\n        if (prefix.scientific) {\n          const diff = Math.abs(\n            Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - offset)\n          if (diff < bestDiff ||\n            (diff === bestDiff && prefix.name.length < bestPrefix.name.length)) {\n            // choose the prefix with the smallest diff, or if equal, choose the one\n            // with the shortest name (can happen with SHORTLONG for example)\n            bestPrefix = prefix\n            bestDiff = diff\n          }\n        }\n      }\n    }\n    return bestPrefix\n  }\n\n  /**\n   * Returns an array of units whose sum is equal to this unit\n   * @memberof Unit\n   * @param {Array} [parts] An array of strings or valueless units.\n   *\n   *   Example:\n   *\n   *   const u = new Unit(1, 'm')\n   *   u.splitUnit(['feet', 'inch'])\n   *     [ 3 feet, 3.3700787401575 inch ]\n   *\n   * @return {Array} An array of units.\n   */\n  Unit.prototype.splitUnit = function (parts) {\n    let x = this.clone()\n    const ret = []\n    for (let i = 0; i < parts.length; i++) {\n      // Convert x to the requested unit\n      x = x.to(parts[i])\n      if (i === parts.length - 1) break\n\n      // Get the numeric value of this unit\n      const xNumeric = x.toNumeric()\n\n      // Check to see if xNumeric is nearly equal to an integer,\n      // since fix can incorrectly round down if there is round-off error\n      const xRounded = round(xNumeric)\n      let xFixed\n      const isNearlyEqual = equal(xRounded, xNumeric)\n      if (isNearlyEqual) {\n        xFixed = xRounded\n      } else {\n        xFixed = fix(x.toNumeric())\n      }\n\n      const y = new Unit(xFixed, parts[i].toString())\n      ret.push(y)\n      x = subtractScalar(x, y)\n    }\n\n    // This little bit fixes a bug where the remainder should be 0 but is a little bit off.\n    // But instead of comparing x, the remainder, with zero--we will compare the sum of\n    // all the parts so far with the original value. If they are nearly equal,\n    // we set the remainder to 0.\n    let testSum = 0\n    for (let i = 0; i < ret.length; i++) {\n      testSum = addScalar(testSum, ret[i].value)\n    }\n    if (equal(testSum, this.value)) {\n      x.value = 0\n    }\n\n    ret.push(x)\n\n    return ret\n  }\n\n  const PREFIXES = {\n    NONE: {\n      '': { name: '', value: 1, scientific: true }\n    },\n    SHORT: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e1, scientific: false },\n      h: { name: 'h', value: 1e2, scientific: false },\n      k: { name: 'k', value: 1e3, scientific: true },\n      M: { name: 'M', value: 1e6, scientific: true },\n      G: { name: 'G', value: 1e9, scientific: true },\n      T: { name: 'T', value: 1e12, scientific: true },\n      P: { name: 'P', value: 1e15, scientific: true },\n      E: { name: 'E', value: 1e18, scientific: true },\n      Z: { name: 'Z', value: 1e21, scientific: true },\n      Y: { name: 'Y', value: 1e24, scientific: true },\n      R: { name: 'R', value: 1e27, scientific: true },\n      Q: { name: 'Q', value: 1e30, scientific: true },\n\n      d: { name: 'd', value: 1e-1, scientific: false },\n      c: { name: 'c', value: 1e-2, scientific: false },\n      m: { name: 'm', value: 1e-3, scientific: true },\n      u: { name: 'u', value: 1e-6, scientific: true },\n      n: { name: 'n', value: 1e-9, scientific: true },\n      p: { name: 'p', value: 1e-12, scientific: true },\n      f: { name: 'f', value: 1e-15, scientific: true },\n      a: { name: 'a', value: 1e-18, scientific: true },\n      z: { name: 'z', value: 1e-21, scientific: true },\n      y: { name: 'y', value: 1e-24, scientific: true },\n      r: { name: 'r', value: 1e-27, scientific: true },\n      q: { name: 'q', value: 1e-30, scientific: true }\n    },\n    LONG: {\n      '': { name: '', value: 1, scientific: true },\n\n      deca: { name: 'deca', value: 1e1, scientific: false },\n      hecto: { name: 'hecto', value: 1e2, scientific: false },\n      kilo: { name: 'kilo', value: 1e3, scientific: true },\n      mega: { name: 'mega', value: 1e6, scientific: true },\n      giga: { name: 'giga', value: 1e9, scientific: true },\n      tera: { name: 'tera', value: 1e12, scientific: true },\n      peta: { name: 'peta', value: 1e15, scientific: true },\n      exa: { name: 'exa', value: 1e18, scientific: true },\n      zetta: { name: 'zetta', value: 1e21, scientific: true },\n      yotta: { name: 'yotta', value: 1e24, scientific: true },\n      ronna: { name: 'ronna', value: 1e27, scientific: true },\n      quetta: { name: 'quetta', value: 1e30, scientific: true },\n\n      deci: { name: 'deci', value: 1e-1, scientific: false },\n      centi: { name: 'centi', value: 1e-2, scientific: false },\n      milli: { name: 'milli', value: 1e-3, scientific: true },\n      micro: { name: 'micro', value: 1e-6, scientific: true },\n      nano: { name: 'nano', value: 1e-9, scientific: true },\n      pico: { name: 'pico', value: 1e-12, scientific: true },\n      femto: { name: 'femto', value: 1e-15, scientific: true },\n      atto: { name: 'atto', value: 1e-18, scientific: true },\n      zepto: { name: 'zepto', value: 1e-21, scientific: true },\n      yocto: { name: 'yocto', value: 1e-24, scientific: true },\n      ronto: { name: 'ronto', value: 1e-27, scientific: true },\n      quecto: { name: 'quecto', value: 1e-30, scientific: true }\n    },\n    SQUARED: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e2, scientific: false },\n      h: { name: 'h', value: 1e4, scientific: false },\n      k: { name: 'k', value: 1e6, scientific: true },\n      M: { name: 'M', value: 1e12, scientific: true },\n      G: { name: 'G', value: 1e18, scientific: true },\n      T: { name: 'T', value: 1e24, scientific: true },\n      P: { name: 'P', value: 1e30, scientific: true },\n      E: { name: 'E', value: 1e36, scientific: true },\n      Z: { name: 'Z', value: 1e42, scientific: true },\n      Y: { name: 'Y', value: 1e48, scientific: true },\n      R: { name: 'R', value: 1e54, scientific: true },\n      Q: { name: 'Q', value: 1e60, scientific: true },\n\n      d: { name: 'd', value: 1e-2, scientific: false },\n      c: { name: 'c', value: 1e-4, scientific: false },\n      m: { name: 'm', value: 1e-6, scientific: true },\n      u: { name: 'u', value: 1e-12, scientific: true },\n      n: { name: 'n', value: 1e-18, scientific: true },\n      p: { name: 'p', value: 1e-24, scientific: true },\n      f: { name: 'f', value: 1e-30, scientific: true },\n      a: { name: 'a', value: 1e-36, scientific: true },\n      z: { name: 'z', value: 1e-42, scientific: true },\n      y: { name: 'y', value: 1e-48, scientific: true },\n      r: { name: 'r', value: 1e-54, scientific: true },\n      q: { name: 'q', value: 1e-60, scientific: true }\n    },\n    CUBIC: {\n      '': { name: '', value: 1, scientific: true },\n\n      da: { name: 'da', value: 1e3, scientific: false },\n      h: { name: 'h', value: 1e6, scientific: false },\n      k: { name: 'k', value: 1e9, scientific: true },\n      M: { name: 'M', value: 1e18, scientific: true },\n      G: { name: 'G', value: 1e27, scientific: true },\n      T: { name: 'T', value: 1e36, scientific: true },\n      P: { name: 'P', value: 1e45, scientific: true },\n      E: { name: 'E', value: 1e54, scientific: true },\n      Z: { name: 'Z', value: 1e63, scientific: true },\n      Y: { name: 'Y', value: 1e72, scientific: true },\n      R: { name: 'R', value: 1e81, scientific: true },\n      Q: { name: 'Q', value: 1e90, scientific: true },\n\n      d: { name: 'd', value: 1e-3, scientific: false },\n      c: { name: 'c', value: 1e-6, scientific: false },\n      m: { name: 'm', value: 1e-9, scientific: true },\n      u: { name: 'u', value: 1e-18, scientific: true },\n      n: { name: 'n', value: 1e-27, scientific: true },\n      p: { name: 'p', value: 1e-36, scientific: true },\n      f: { name: 'f', value: 1e-45, scientific: true },\n      a: { name: 'a', value: 1e-54, scientific: true },\n      z: { name: 'z', value: 1e-63, scientific: true },\n      y: { name: 'y', value: 1e-72, scientific: true },\n      r: { name: 'r', value: 1e-81, scientific: true },\n      q: { name: 'q', value: 1e-90, scientific: true }\n    },\n    BINARY_SHORT_SI: {\n      '': { name: '', value: 1, scientific: true },\n      k: { name: 'k', value: 1e3, scientific: true },\n      M: { name: 'M', value: 1e6, scientific: true },\n      G: { name: 'G', value: 1e9, scientific: true },\n      T: { name: 'T', value: 1e12, scientific: true },\n      P: { name: 'P', value: 1e15, scientific: true },\n      E: { name: 'E', value: 1e18, scientific: true },\n      Z: { name: 'Z', value: 1e21, scientific: true },\n      Y: { name: 'Y', value: 1e24, scientific: true }\n    },\n    BINARY_SHORT_IEC: {\n      '': { name: '', value: 1, scientific: true },\n      Ki: { name: 'Ki', value: 1024, scientific: true },\n      Mi: { name: 'Mi', value: Math.pow(1024, 2), scientific: true },\n      Gi: { name: 'Gi', value: Math.pow(1024, 3), scientific: true },\n      Ti: { name: 'Ti', value: Math.pow(1024, 4), scientific: true },\n      Pi: { name: 'Pi', value: Math.pow(1024, 5), scientific: true },\n      Ei: { name: 'Ei', value: Math.pow(1024, 6), scientific: true },\n      Zi: { name: 'Zi', value: Math.pow(1024, 7), scientific: true },\n      Yi: { name: 'Yi', value: Math.pow(1024, 8), scientific: true }\n    },\n    BINARY_LONG_SI: {\n      '': { name: '', value: 1, scientific: true },\n      kilo: { name: 'kilo', value: 1e3, scientific: true },\n      mega: { name: 'mega', value: 1e6, scientific: true },\n      giga: { name: 'giga', value: 1e9, scientific: true },\n      tera: { name: 'tera', value: 1e12, scientific: true },\n      peta: { name: 'peta', value: 1e15, scientific: true },\n      exa: { name: 'exa', value: 1e18, scientific: true },\n      zetta: { name: 'zetta', value: 1e21, scientific: true },\n      yotta: { name: 'yotta', value: 1e24, scientific: true }\n    },\n    BINARY_LONG_IEC: {\n      '': { name: '', value: 1, scientific: true },\n      kibi: { name: 'kibi', value: 1024, scientific: true },\n      mebi: { name: 'mebi', value: Math.pow(1024, 2), scientific: true },\n      gibi: { name: 'gibi', value: Math.pow(1024, 3), scientific: true },\n      tebi: { name: 'tebi', value: Math.pow(1024, 4), scientific: true },\n      pebi: { name: 'pebi', value: Math.pow(1024, 5), scientific: true },\n      exi: { name: 'exi', value: Math.pow(1024, 6), scientific: true },\n      zebi: { name: 'zebi', value: Math.pow(1024, 7), scientific: true },\n      yobi: { name: 'yobi', value: Math.pow(1024, 8), scientific: true }\n    },\n    BTU: {\n      '': { name: '', value: 1, scientific: true },\n      MM: { name: 'MM', value: 1e6, scientific: true }\n    }\n  }\n\n  PREFIXES.SHORTLONG = Object.assign({}, PREFIXES.SHORT, PREFIXES.LONG)\n  PREFIXES.BINARY_SHORT = Object.assign({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC)\n  PREFIXES.BINARY_LONG = Object.assign({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC)\n\n  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:\n   * Index  Dimension\n   * -----  ---------\n   *   0    Length\n   *   1    Mass\n   *   2    Time\n   *   3    Current\n   *   4    Temperature\n   *   5    Luminous intensity\n   *   6    Amount of substance\n   *   7    Angle\n   *   8    Bit (digital)\n   * For example, the unit \"298.15 K\" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit \"1 cal / (gm °C)\" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].\n   *\n   */\n\n  const BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT']\n\n  const BASE_UNITS = {\n    NONE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    MASS: {\n      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]\n    },\n    LENGTH: {\n      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]\n    },\n    TIME: {\n      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]\n    },\n    CURRENT: {\n      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]\n    },\n    TEMPERATURE: {\n      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]\n    },\n    LUMINOUS_INTENSITY: {\n      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]\n    },\n    AMOUNT_OF_SUBSTANCE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]\n    },\n\n    FORCE: {\n      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]\n    },\n    SURFACE: {\n      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]\n    },\n    VOLUME: {\n      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]\n    },\n    ENERGY: {\n      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]\n    },\n    POWER: {\n      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]\n    },\n    PRESSURE: {\n      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]\n    },\n\n    ELECTRIC_CHARGE: {\n      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CAPACITANCE: {\n      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_POTENTIAL: {\n      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_RESISTANCE: {\n      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_INDUCTANCE: {\n      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]\n    },\n    ELECTRIC_CONDUCTANCE: {\n      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX: {\n      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]\n    },\n    MAGNETIC_FLUX_DENSITY: {\n      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]\n    },\n\n    FREQUENCY: {\n      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]\n    },\n    ANGLE: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]\n    },\n    BIT: {\n      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]\n    }\n  }\n\n  for (const key in BASE_UNITS) {\n    if (hasOwnProperty(BASE_UNITS, key)) {\n      BASE_UNITS[key].key = key\n    }\n  }\n\n  const BASE_UNIT_NONE = {}\n\n  const UNIT_NONE = { name: '', base: BASE_UNIT_NONE, value: 1, offset: 0, dimensions: BASE_DIMENSIONS.map(x => 0) }\n\n  const UNITS = {\n    // length\n    meter: {\n      name: 'meter',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    inch: {\n      name: 'inch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    foot: {\n      name: 'foot',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yard: {\n      name: 'yard',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mile: {\n      name: 'mile',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    link: {\n      name: 'link',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rod: {\n      name: 'rod',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.0292,\n      offset: 0\n    },\n    chain: {\n      name: 'chain',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    angstrom: {\n      name: 'angstrom',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1e-10,\n      offset: 0\n    },\n\n    m: {\n      name: 'm',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    in: {\n      name: 'in',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0254,\n      offset: 0\n    },\n    ft: {\n      name: 'ft',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.3048,\n      offset: 0\n    },\n    yd: {\n      name: 'yd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.9144,\n      offset: 0\n    },\n    mi: {\n      name: 'mi',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 1609.344,\n      offset: 0\n    },\n    li: {\n      name: 'li',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.201168,\n      offset: 0\n    },\n    rd: {\n      name: 'rd',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 5.029210,\n      offset: 0\n    },\n    ch: {\n      name: 'ch',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 20.1168,\n      offset: 0\n    },\n    mil: {\n      name: 'mil',\n      base: BASE_UNITS.LENGTH,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000254,\n      offset: 0\n    }, // 1/1000 inch\n\n    // Surface\n    m2: {\n      name: 'm2',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.SQUARED,\n      value: 1,\n      offset: 0\n    },\n    sqin: {\n      name: 'sqin',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.00064516,\n      offset: 0\n    }, // 645.16 mm2\n    sqft: {\n      name: 'sqft',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.09290304,\n      offset: 0\n    }, // 0.09290304 m2\n    sqyd: {\n      name: 'sqyd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 0.83612736,\n      offset: 0\n    }, // 0.83612736 m2\n    sqmi: {\n      name: 'sqmi',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 2589988.110336,\n      offset: 0\n    }, // 2.589988110336 km2\n    sqrd: {\n      name: 'sqrd',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 25.29295,\n      offset: 0\n    }, // 25.29295 m2\n    sqch: {\n      name: 'sqch',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 404.6873,\n      offset: 0\n    }, // 404.6873 m2\n    sqmil: {\n      name: 'sqmil',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 6.4516e-10,\n      offset: 0\n    }, // 6.4516 * 10^-10 m2\n    acre: {\n      name: 'acre',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 4046.86,\n      offset: 0\n    }, // 4046.86 m2\n    hectare: {\n      name: 'hectare',\n      base: BASE_UNITS.SURFACE,\n      prefixes: PREFIXES.NONE,\n      value: 10000,\n      offset: 0\n    }, // 10000 m2\n\n    // Volume\n    m3: {\n      name: 'm3',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.CUBIC,\n      value: 1,\n      offset: 0\n    },\n    L: {\n      name: 'L',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    }, // litre\n    l: {\n      name: 'l',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    }, // litre\n    litre: {\n      name: 'litre',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n    cuin: {\n      name: 'cuin',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1.6387064e-5,\n      offset: 0\n    }, // 1.6387064e-5 m3\n    cuft: {\n      name: 'cuft',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.028316846592,\n      offset: 0\n    }, // 28.316 846 592 L\n    cuyd: {\n      name: 'cuyd',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.764554857984,\n      offset: 0\n    }, // 764.554 857 984 L\n    teaspoon: {\n      name: 'teaspoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000005,\n      offset: 0\n    }, // 5 mL\n    tablespoon: {\n      name: 'tablespoon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000015,\n      offset: 0\n    }, // 15 mL\n    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup\n    drop: {\n      name: 'drop',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    }, // 0.05 mL = 5e-8 m3\n    gtt: {\n      name: 'gtt',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 5e-8,\n      offset: 0\n    }, // 0.05 mL = 5e-8 m3\n\n    // Liquid volume\n    minim: {\n      name: 'minim',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000000061611519921875,\n      offset: 0\n    }, // 1/61440 gallons\n    fluiddram: {\n      name: 'fluiddram',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000036966911953125,\n      offset: 0\n    }, // 1/1024 gallons\n    fluidounce: {\n      name: 'fluidounce',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0000295735295625,\n      offset: 0\n    }, // 1/128 gallons\n    gill: {\n      name: 'gill',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.00011829411825,\n      offset: 0\n    }, // 1/32 gallons\n    cc: {\n      name: 'cc',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 1e-6,\n      offset: 0\n    }, // 1e-6 L\n    cup: {\n      name: 'cup',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.0002365882365,\n      offset: 0\n    }, // 1/16 gallons\n    pint: {\n      name: 'pint',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000473176473,\n      offset: 0\n    }, // 1/8 gallons\n    quart: {\n      name: 'quart',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.000946352946,\n      offset: 0\n    }, // 1/4 gallons\n    gallon: {\n      name: 'gallon',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.003785411784,\n      offset: 0\n    }, // 3.785411784 L\n    beerbarrel: {\n      name: 'beerbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.117347765304,\n      offset: 0\n    }, // 31 gallons\n    oilbarrel: {\n      name: 'oilbarrel',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.158987294928,\n      offset: 0\n    }, // 42 gallons\n    hogshead: {\n      name: 'hogshead',\n      base: BASE_UNITS.VOLUME,\n      prefixes: PREFIXES.NONE,\n      value: 0.238480942392,\n      offset: 0\n    }, // 63 gallons\n\n    // Mass\n    g: {\n      name: 'g',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 0.001,\n      offset: 0\n    },\n    gram: {\n      name: 'gram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\n      value: 0.001,\n      offset: 0\n    },\n\n    ton: {\n      name: 'ton',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 907.18474,\n      offset: 0\n    },\n    t: {\n      name: 't',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.SHORT,\n      value: 1000,\n      offset: 0\n    },\n    tonne: {\n      name: 'tonne',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.LONG,\n      value: 1000,\n      offset: 0\n    },\n\n    grain: {\n      name: 'grain',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dram: {\n      name: 'dram',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    ounce: {\n      name: 'ounce',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    poundmass: {\n      name: 'poundmass',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    hundredweight: {\n      name: 'hundredweight',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n    stick: {\n      name: 'stick',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 115e-3,\n      offset: 0\n    },\n    stone: {\n      name: 'stone',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 6.35029318,\n      offset: 0\n    },\n\n    gr: {\n      name: 'gr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 64.79891e-6,\n      offset: 0\n    },\n    dr: {\n      name: 'dr',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 1.7718451953125e-3,\n      offset: 0\n    },\n    oz: {\n      name: 'oz',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 28.349523125e-3,\n      offset: 0\n    },\n    lbm: {\n      name: 'lbm',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 453.59237e-3,\n      offset: 0\n    },\n    cwt: {\n      name: 'cwt',\n      base: BASE_UNITS.MASS,\n      prefixes: PREFIXES.NONE,\n      value: 45.359237,\n      offset: 0\n    },\n\n    // Time\n    s: {\n      name: 's',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    min: {\n      name: 'min',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    h: {\n      name: 'h',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    second: {\n      name: 'second',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    sec: {\n      name: 'sec',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    minute: {\n      name: 'minute',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 60,\n      offset: 0\n    },\n    hour: {\n      name: 'hour',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3600,\n      offset: 0\n    },\n    day: {\n      name: 'day',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 86400,\n      offset: 0\n    },\n    week: {\n      name: 'week',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 7 * 86400,\n      offset: 0\n    },\n    month: {\n      name: 'month',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 2629800, // 1/12th of Julian year\n      offset: 0\n    },\n    year: {\n      name: 'year',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600, // Julian year\n      offset: 0\n    },\n    decade: {\n      name: 'decade',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 315576000, // Julian decade\n      offset: 0\n    },\n    century: {\n      name: 'century',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 3155760000, // Julian century\n      offset: 0\n    },\n    millennium: {\n      name: 'millennium',\n      base: BASE_UNITS.TIME,\n      prefixes: PREFIXES.NONE,\n      value: 31557600000, // Julian millennium\n      offset: 0\n    },\n\n    // Frequency\n    hertz: {\n      name: 'Hertz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n    Hz: {\n      name: 'Hz',\n      base: BASE_UNITS.FREQUENCY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0,\n      reciprocal: true\n    },\n\n    // Angle\n    rad: {\n      name: 'rad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    radian: {\n      name: 'radian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888\n    deg: {\n      name: 'deg',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    degree: {\n      name: 'degree',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399\n    grad: {\n      name: 'grad',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.SHORT,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    gradian: {\n      name: 'gradian',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.LONG,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793\n    cycle: {\n      name: 'cycle',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795\n    arcsec: {\n      name: 'arcsec',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477\n    arcmin: {\n      name: 'arcmin',\n      base: BASE_UNITS.ANGLE,\n      prefixes: PREFIXES.NONE,\n      value: null, // will be filled in by calculateAngleValues()\n      offset: 0\n    },\n\n    // Electric current\n    A: {\n      name: 'A',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    ampere: {\n      name: 'ampere',\n      base: BASE_UNITS.CURRENT,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n\n    // Temperature\n    // K(C) = °C + 273.15\n    // K(F) = (°F + 459.67) * (5 / 9)\n    // K(R) = °R * (5 / 9)\n    K: {\n      name: 'K',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    degC: {\n      name: 'degC',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 273.15\n    },\n    degF: {\n      name: 'degF',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: new Fraction(5, 9),\n      offset: 459.67\n    },\n    degR: {\n      name: 'degR',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.SHORT,\n      value: new Fraction(5, 9),\n      offset: 0\n    },\n    kelvin: {\n      name: 'kelvin',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    celsius: {\n      name: 'celsius',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 273.15\n    },\n    fahrenheit: {\n      name: 'fahrenheit',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: new Fraction(5, 9),\n      offset: 459.67\n    },\n    rankine: {\n      name: 'rankine',\n      base: BASE_UNITS.TEMPERATURE,\n      prefixes: PREFIXES.LONG,\n      value: new Fraction(5, 9),\n      offset: 0\n    },\n\n    // amount of substance\n    mol: {\n      name: 'mol',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    mole: {\n      name: 'mole',\n      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n\n    // luminous intensity\n    cd: {\n      name: 'cd',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    candela: {\n      name: 'candela',\n      base: BASE_UNITS.LUMINOUS_INTENSITY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    // TODO: units STERADIAN\n    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},\n\n    // Force\n    N: {\n      name: 'N',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    newton: {\n      name: 'newton',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    dyn: {\n      name: 'dyn',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.SHORT,\n      value: 0.00001,\n      offset: 0\n    },\n    dyne: {\n      name: 'dyne',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 0.00001,\n      offset: 0\n    },\n    lbf: {\n      name: 'lbf',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    poundforce: {\n      name: 'poundforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 4.4482216152605,\n      offset: 0\n    },\n    kip: {\n      name: 'kip',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.LONG,\n      value: 4448.2216,\n      offset: 0\n    },\n    kilogramforce: {\n      name: 'kilogramforce',\n      base: BASE_UNITS.FORCE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\n      offset: 0\n    },\n\n    // Energy\n    J: {\n      name: 'J',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    joule: {\n      name: 'joule',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    erg: {\n      name: 'erg',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORTLONG, // Both kiloerg and kerg are acceptable\n      value: 1e-7,\n      offset: 0\n    },\n    Wh: {\n      name: 'Wh',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 3600,\n      offset: 0\n    },\n    BTU: {\n      name: 'BTU',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.BTU,\n      value: 1055.05585262,\n      offset: 0\n    },\n    eV: {\n      name: 'eV',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.SHORT,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n    electronvolt: {\n      name: 'electronvolt',\n      base: BASE_UNITS.ENERGY,\n      prefixes: PREFIXES.LONG,\n      value: 1.602176565e-19,\n      offset: 0\n    },\n\n    // Power\n    W: {\n      name: 'W',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    watt: {\n      name: 'watt',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    hp: {\n      name: 'hp',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.NONE,\n      value: 745.6998715386,\n      offset: 0\n    },\n\n    // Electrical power units\n    VAR: {\n      name: 'VAR',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: Complex.I,\n      offset: 0\n    },\n\n    VA: {\n      name: 'VA',\n      base: BASE_UNITS.POWER,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n\n    // Pressure\n    Pa: {\n      name: 'Pa',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    psi: {\n      name: 'psi',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 6894.75729276459,\n      offset: 0\n    },\n    atm: {\n      name: 'atm',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 101325,\n      offset: 0\n    },\n    bar: {\n      name: 'bar',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.SHORTLONG,\n      value: 100000,\n      offset: 0\n    },\n    torr: {\n      name: 'torr',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmHg: {\n      name: 'mmHg',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 133.322,\n      offset: 0\n    },\n    mmH2O: {\n      name: 'mmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 9.80665,\n      offset: 0\n    },\n    cmH2O: {\n      name: 'cmH2O',\n      base: BASE_UNITS.PRESSURE,\n      prefixes: PREFIXES.NONE,\n      value: 98.0665,\n      offset: 0\n    },\n\n    // Electric charge\n    coulomb: {\n      name: 'coulomb',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    C: {\n      name: 'C',\n      base: BASE_UNITS.ELECTRIC_CHARGE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric capacitance\n    farad: {\n      name: 'farad',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    F: {\n      name: 'F',\n      base: BASE_UNITS.ELECTRIC_CAPACITANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric potential\n    volt: {\n      name: 'volt',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    V: {\n      name: 'V',\n      base: BASE_UNITS.ELECTRIC_POTENTIAL,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric resistance\n    ohm: {\n      name: 'ohm',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORTLONG, // Both Mohm and megaohm are acceptable\n      value: 1,\n      offset: 0\n    },\n    /*\n     * Unicode breaks in browsers if charset is not specified\n    Ω: {\n      name: 'Ω',\n      base: BASE_UNITS.ELECTRIC_RESISTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    */\n    // Electric inductance\n    henry: {\n      name: 'henry',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    H: {\n      name: 'H',\n      base: BASE_UNITS.ELECTRIC_INDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Electric conductance\n    siemens: {\n      name: 'siemens',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    S: {\n      name: 'S',\n      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux\n    weber: {\n      name: 'weber',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    Wb: {\n      name: 'Wb',\n      base: BASE_UNITS.MAGNETIC_FLUX,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n    // Magnetic flux density\n    tesla: {\n      name: 'tesla',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.LONG,\n      value: 1,\n      offset: 0\n    },\n    T: {\n      name: 'T',\n      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,\n      prefixes: PREFIXES.SHORT,\n      value: 1,\n      offset: 0\n    },\n\n    // Binary\n    b: {\n      name: 'b',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 1,\n      offset: 0\n    },\n    bits: {\n      name: 'bits',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 1,\n      offset: 0\n    },\n    B: {\n      name: 'B',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_SHORT,\n      value: 8,\n      offset: 0\n    },\n    bytes: {\n      name: 'bytes',\n      base: BASE_UNITS.BIT,\n      prefixes: PREFIXES.BINARY_LONG,\n      value: 8,\n      offset: 0\n    }\n  }\n\n  // aliases (formerly plurals)\n  // note that ALIASES is only used at creation to create more entries in UNITS by copying the aliased units\n  const ALIASES = {\n    meters: 'meter',\n    inches: 'inch',\n    feet: 'foot',\n    yards: 'yard',\n    miles: 'mile',\n    links: 'link',\n    rods: 'rod',\n    chains: 'chain',\n    angstroms: 'angstrom',\n\n    lt: 'l',\n    litres: 'litre',\n    liter: 'litre',\n    liters: 'litre',\n    teaspoons: 'teaspoon',\n    tablespoons: 'tablespoon',\n    minims: 'minim',\n    fldr: 'fluiddram',\n    fluiddrams: 'fluiddram',\n    floz: 'fluidounce',\n    fluidounces: 'fluidounce',\n    gi: 'gill',\n    gills: 'gill',\n    cp: 'cup',\n    cups: 'cup',\n    pt: 'pint',\n    pints: 'pint',\n    qt: 'quart',\n    quarts: 'quart',\n    gal: 'gallon',\n    gallons: 'gallon',\n    bbl: 'beerbarrel',\n    beerbarrels: 'beerbarrel',\n    obl: 'oilbarrel',\n    oilbarrels: 'oilbarrel',\n    hogsheads: 'hogshead',\n    gtts: 'gtt',\n\n    grams: 'gram',\n    tons: 'ton',\n    tonnes: 'tonne',\n    grains: 'grain',\n    drams: 'dram',\n    ounces: 'ounce',\n    poundmasses: 'poundmass',\n    hundredweights: 'hundredweight',\n    sticks: 'stick',\n    lb: 'lbm',\n    lbs: 'lbm',\n\n    kips: 'kip',\n    kgf: 'kilogramforce',\n\n    acres: 'acre',\n    hectares: 'hectare',\n    sqfeet: 'sqft',\n    sqyard: 'sqyd',\n    sqmile: 'sqmi',\n    sqmiles: 'sqmi',\n\n    mmhg: 'mmHg',\n    mmh2o: 'mmH2O',\n    cmh2o: 'cmH2O',\n\n    seconds: 'second',\n    secs: 'second',\n    minutes: 'minute',\n    mins: 'minute',\n    hours: 'hour',\n    hr: 'hour',\n    hrs: 'hour',\n    days: 'day',\n    weeks: 'week',\n    months: 'month',\n    years: 'year',\n    decades: 'decade',\n    centuries: 'century',\n    millennia: 'millennium',\n\n    hertz: 'hertz',\n\n    radians: 'radian',\n    degrees: 'degree',\n    gradians: 'gradian',\n    cycles: 'cycle',\n    arcsecond: 'arcsec',\n    arcseconds: 'arcsec',\n    arcminute: 'arcmin',\n    arcminutes: 'arcmin',\n\n    BTUs: 'BTU',\n    watts: 'watt',\n    joules: 'joule',\n\n    amperes: 'ampere',\n    amps: 'ampere',\n    amp: 'ampere',\n    coulombs: 'coulomb',\n    volts: 'volt',\n    ohms: 'ohm',\n    farads: 'farad',\n    webers: 'weber',\n    teslas: 'tesla',\n    electronvolts: 'electronvolt',\n    moles: 'mole',\n\n    bit: 'bits',\n    byte: 'bytes'\n  }\n\n  /**\n   * Calculate the values for the angle units.\n   * Value is calculated as number or BigNumber depending on the configuration\n   * @param {{number: 'number' | 'BigNumber'}} config\n   */\n  function calculateAngleValues (config) {\n    if (config.number === 'BigNumber') {\n      const pi = createPi(BigNumber)\n      UNITS.rad.value = new BigNumber(1)\n      UNITS.deg.value = pi.div(180) // 2 * pi / 360\n      UNITS.grad.value = pi.div(200) // 2 * pi / 400\n      UNITS.cycle.value = pi.times(2) // 2 * pi\n      UNITS.arcsec.value = pi.div(648000) // 2 * pi / 360 / 3600\n      UNITS.arcmin.value = pi.div(10800) // 2 * pi / 360 / 60\n    } else { // number\n      UNITS.rad.value = 1\n      UNITS.deg.value = Math.PI / 180 // 2 * pi / 360\n      UNITS.grad.value = Math.PI / 200 // 2 * pi / 400\n      UNITS.cycle.value = Math.PI * 2 // 2 * pi\n      UNITS.arcsec.value = Math.PI / 648000 // 2 * pi / 360 / 3600\n      UNITS.arcmin.value = Math.PI / 10800 // 2 * pi / 360 / 60\n    }\n\n    // copy to the full names of the angles\n    UNITS.radian.value = UNITS.rad.value\n    UNITS.degree.value = UNITS.deg.value\n    UNITS.gradian.value = UNITS.grad.value\n  }\n\n  // apply the angle values now\n  calculateAngleValues(config)\n\n  if (on) {\n    // recalculate the values on change of configuration\n    on('config', function (curr, prev) {\n      if (curr.number !== prev.number) {\n        calculateAngleValues(curr)\n      }\n    })\n  }\n\n  /**\n   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.\n   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).\n   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.\n   */\n  const UNIT_SYSTEMS = {\n    si: {\n      // Base units\n      NONE: { unit: UNIT_NONE, prefix: PREFIXES.NONE[''] },\n      LENGTH: { unit: UNITS.m, prefix: PREFIXES.SHORT[''] },\n      MASS: { unit: UNITS.g, prefix: PREFIXES.SHORT.k },\n      TIME: { unit: UNITS.s, prefix: PREFIXES.SHORT[''] },\n      CURRENT: { unit: UNITS.A, prefix: PREFIXES.SHORT[''] },\n      TEMPERATURE: { unit: UNITS.K, prefix: PREFIXES.SHORT[''] },\n      LUMINOUS_INTENSITY: { unit: UNITS.cd, prefix: PREFIXES.SHORT[''] },\n      AMOUNT_OF_SUBSTANCE: { unit: UNITS.mol, prefix: PREFIXES.SHORT[''] },\n      ANGLE: { unit: UNITS.rad, prefix: PREFIXES.SHORT[''] },\n      BIT: { unit: UNITS.bits, prefix: PREFIXES.SHORT[''] },\n\n      // Derived units\n      FORCE: { unit: UNITS.N, prefix: PREFIXES.SHORT[''] },\n      ENERGY: { unit: UNITS.J, prefix: PREFIXES.SHORT[''] },\n      POWER: { unit: UNITS.W, prefix: PREFIXES.SHORT[''] },\n      PRESSURE: { unit: UNITS.Pa, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CHARGE: { unit: UNITS.C, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CAPACITANCE: { unit: UNITS.F, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_POTENTIAL: { unit: UNITS.V, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_RESISTANCE: { unit: UNITS.ohm, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_INDUCTANCE: { unit: UNITS.H, prefix: PREFIXES.SHORT[''] },\n      ELECTRIC_CONDUCTANCE: { unit: UNITS.S, prefix: PREFIXES.SHORT[''] },\n      MAGNETIC_FLUX: { unit: UNITS.Wb, prefix: PREFIXES.SHORT[''] },\n      MAGNETIC_FLUX_DENSITY: { unit: UNITS.T, prefix: PREFIXES.SHORT[''] },\n      FREQUENCY: { unit: UNITS.Hz, prefix: PREFIXES.SHORT[''] }\n    }\n  }\n\n  // Clone to create the other unit systems\n  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n  UNIT_SYSTEMS.cgs.LENGTH = { unit: UNITS.m, prefix: PREFIXES.SHORT.c }\n  UNIT_SYSTEMS.cgs.MASS = { unit: UNITS.g, prefix: PREFIXES.SHORT[''] }\n  UNIT_SYSTEMS.cgs.FORCE = { unit: UNITS.dyn, prefix: PREFIXES.SHORT[''] }\n  UNIT_SYSTEMS.cgs.ENERGY = { unit: UNITS.erg, prefix: PREFIXES.NONE[''] }\n  // there are wholly 4 unique cgs systems for electricity and magnetism,\n  // so let's not worry about it unless somebody complains\n\n  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n  UNIT_SYSTEMS.us.LENGTH = { unit: UNITS.ft, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.MASS = { unit: UNITS.lbm, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.TEMPERATURE = { unit: UNITS.degF, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.FORCE = { unit: UNITS.lbf, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.ENERGY = { unit: UNITS.BTU, prefix: PREFIXES.BTU[''] }\n  UNIT_SYSTEMS.us.POWER = { unit: UNITS.hp, prefix: PREFIXES.NONE[''] }\n  UNIT_SYSTEMS.us.PRESSURE = { unit: UNITS.psi, prefix: PREFIXES.NONE[''] }\n\n  // Add additional unit systems here.\n\n  // Choose a unit system to seed the auto unit system.\n  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si))\n\n  // Set the current unit system\n  let currentUnitSystem = UNIT_SYSTEMS.auto\n\n  /**\n   * Set a unit system for formatting derived units.\n   * @memberof Unit\n   * @param {string} [name] The name of the unit system.\n   */\n  Unit.setUnitSystem = function (name) {\n    if (hasOwnProperty(UNIT_SYSTEMS, name)) {\n      currentUnitSystem = UNIT_SYSTEMS[name]\n    } else {\n      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '))\n    }\n  }\n\n  /**\n   * Return the current unit system.\n   * @memberof Unit\n   * @return {string} The current unit system.\n   */\n  Unit.getUnitSystem = function () {\n    for (const key in UNIT_SYSTEMS) {\n      if (hasOwnProperty(UNIT_SYSTEMS, key)) {\n        if (UNIT_SYSTEMS[key] === currentUnitSystem) {\n          return key\n        }\n      }\n    }\n  }\n\n  /**\n   * Converters to convert from number to an other numeric type like BigNumber\n   * or Fraction\n   */\n  Unit.typeConverters = {\n    BigNumber: function (x) {\n      if (x?.isFraction) return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s))\n      return new BigNumber(x + '') // stringify to prevent constructor error\n    },\n\n    Fraction: function (x) {\n      return new Fraction(x)\n    },\n\n    Complex: function (x) {\n      return x\n    },\n\n    number: function (x) {\n      if (x?.isFraction) return number(x)\n      return x\n    }\n  }\n\n  /**\n   * Retrieve the right converter function corresponding with this unit's\n   * value\n   *\n   * @memberof Unit\n   * @return {Function}\n   */\n  Unit.prototype._numberConverter = function () {\n    const convert = Unit.typeConverters[this.valueType()]\n    if (convert) {\n      return convert\n    }\n    throw new TypeError('Unsupported Unit value type \"' + this.valueType() + '\"')\n  }\n\n  /**\n   * Retrieve the right convertor function corresponding with the type\n   * of provided exampleValue.\n   *\n   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'\n   *                        In case of an unknown type,\n   * @return {Function}\n   */\n  Unit._getNumberConverter = function (type) {\n    if (!Unit.typeConverters[type]) {\n      throw new TypeError('Unsupported type \"' + type + '\"')\n    }\n\n    return Unit.typeConverters[type]\n  }\n\n  // Add dimensions to each built-in unit\n  for (const key in UNITS) {\n    if (hasOwnProperty(UNITS, key)) {\n      const unit = UNITS[key]\n      unit.dimensions = unit.base.dimensions\n    }\n  }\n\n  // Create aliases\n  for (const name in ALIASES) {\n    if (hasOwnProperty(ALIASES, name)) {\n      const unit = UNITS[ALIASES[name]]\n      const alias = {}\n      for (const key in unit) {\n        if (hasOwnProperty(unit, key)) {\n          alias[key] = unit[key]\n        }\n      }\n      alias.name = name\n      UNITS[name] = alias\n    }\n  }\n\n  /**\n   * Checks if a character is a valid latin letter (upper or lower case).\n   * Note that this function can be overridden, for example to allow support of other alphabets.\n   * @memberof Unit\n   * @param {string} c Tested character\n   * @return {boolean} true if the character is a latin letter\n   */\n  Unit.isValidAlpha = function isValidAlpha (c) {\n    return /^[a-zA-Z]$/.test(c)\n  }\n\n  function assertUnitNameIsValid (name) {\n    for (let i = 0; i < name.length; i++) {\n      c = name.charAt(i)\n\n      if (i === 0 && !Unit.isValidAlpha(c)) { throw new Error('Invalid unit name (must begin with alpha character): \"' + name + '\"') }\n\n      if (i > 0 && !(Unit.isValidAlpha(c) ||\n        isDigit(c))) { throw new Error('Invalid unit name (only alphanumeric characters are allowed): \"' + name + '\"') }\n    }\n  }\n\n  /**\n   * Wrapper around createUnitSingle.\n   * Example:\n   *  createUnit( {\n   *     foo: {\n   *       prefixes: 'long',\n   *       baseName: 'essence-of-foo'\n   *     },\n   *     bar: '40 foo',\n   *     baz: {\n   *       definition: '1 bar/hour',\n   *       prefixes: 'long'\n   *     }\n   *   },\n   *   {\n   *     override: true\n   *   })\n   * @memberof Unit\n   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.\n   * @param {object} options\n   * @return {Unit} the last created unit\n   */\n  Unit.createUnit = function (obj, options) {\n    if (typeof (obj) !== 'object') {\n      throw new TypeError(\"createUnit expects first parameter to be of type 'Object'\")\n    }\n\n    // Remove all units and aliases we are overriding\n    if (options && options.override) {\n      for (const key in obj) {\n        if (hasOwnProperty(obj, key)) {\n          Unit.deleteUnit(key)\n        }\n        if (obj[key].aliases) {\n          for (let i = 0; i < obj[key].aliases.length; i++) {\n            Unit.deleteUnit(obj[key].aliases[i])\n          }\n        }\n      }\n    }\n\n    // TODO: traverse multiple times until all units have been added\n    let lastUnit\n    for (const key in obj) {\n      if (hasOwnProperty(obj, key)) {\n        lastUnit = Unit.createUnitSingle(key, obj[key])\n      }\n    }\n    return lastUnit\n  }\n\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   * Example:\n   *  createUnitSingle('knot', '0.514444444 m/s')\n   *\n   * @memberof Unit\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string | Unit | object} definition      Definition of the unit in terms\n   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,\n   * or an Object. If an Object, may have the following properties:\n   *   - definition {string | Unit} The definition of this unit.\n   *   - prefixes {string} \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\".\n   *     The default is \"none\".\n   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']\n   *   - offset {Numeric} An offset to apply when converting from the unit. For\n   *     example, the offset for celsius is 273.15 and the offset for farhenheit\n   *     is 459.67. Default is 0.\n   *   - baseName {string} If the unit's dimension does not match that of any other\n   *     base unit, the name of the newly create base unit. Otherwise, this property\n   *     has no effect.\n   *\n   * @return {Unit}\n   */\n  Unit.createUnitSingle = function (name, obj) {\n    if (typeof (obj) === 'undefined' || obj === null) {\n      obj = {}\n    }\n\n    if (typeof (name) !== 'string') {\n      throw new TypeError(\"createUnitSingle expects first parameter to be of type 'string'\")\n    }\n\n    // Check collisions with existing units\n    if (hasOwnProperty(UNITS, name)) {\n      throw new Error('Cannot create unit \"' + name + '\": a unit with that name already exists')\n    }\n\n    // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.\n\n    assertUnitNameIsValid(name)\n\n    let defUnit = null // The Unit from which the new unit will be created.\n    let aliases = []\n    let offset = 0\n    let definition\n    let prefixes\n    let baseName\n    if (obj && obj.type === 'Unit') {\n      defUnit = obj.clone()\n    } else if (typeof (obj) === 'string') {\n      if (obj !== '') {\n        definition = obj\n      }\n    } else if (typeof (obj) === 'object') {\n      definition = obj.definition\n      prefixes = obj.prefixes\n      offset = obj.offset\n      baseName = obj.baseName\n      if (obj.aliases) {\n        aliases = obj.aliases.valueOf() // aliases could be a Matrix, so convert to Array\n      }\n    } else {\n      throw new TypeError('Cannot create unit \"' + name + '\" from \"' + obj.toString() + '\": expecting \"string\" or \"Unit\" or \"Object\"')\n    }\n\n    if (aliases) {\n      for (let i = 0; i < aliases.length; i++) {\n        if (hasOwnProperty(UNITS, aliases[i])) {\n          throw new Error('Cannot create alias \"' + aliases[i] + '\": a unit with that name already exists')\n        }\n      }\n    }\n\n    if (definition && typeof (definition) === 'string' && !defUnit) {\n      try {\n        defUnit = Unit.parse(definition, { allowNoUnits: true })\n      } catch (ex) {\n        ex.message = 'Could not create unit \"' + name + '\" from \"' + definition + '\": ' + ex.message\n        throw (ex)\n      }\n    } else if (definition && definition.type === 'Unit') {\n      defUnit = definition.clone()\n    }\n\n    aliases = aliases || []\n    offset = offset || 0\n    if (prefixes && prefixes.toUpperCase) { prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE } else { prefixes = PREFIXES.NONE }\n\n    // If defUnit is null, it is because the user did not\n    // specify a defintion. So create a new base dimension.\n    let newUnit = {}\n    if (!defUnit) {\n      // Add a new base dimension\n      baseName = baseName || name + '_STUFF' // foo --> foo_STUFF, or the essence of foo\n      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {\n        throw new Error('Cannot create new base unit \"' + name + '\": a base unit with that name already exists (and cannot be overridden)')\n      }\n      BASE_DIMENSIONS.push(baseName)\n\n      // Push 0 onto existing base units\n      for (const b in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, b)) {\n          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0\n        }\n      }\n\n      // Add the new base unit\n      const newBaseUnit = { dimensions: [] }\n      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {\n        newBaseUnit.dimensions[i] = 0\n      }\n      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1\n      newBaseUnit.key = baseName\n      BASE_UNITS[baseName] = newBaseUnit\n\n      newUnit = {\n        name,\n        value: 1,\n        dimensions: BASE_UNITS[baseName].dimensions.slice(0),\n        prefixes,\n        offset,\n        base: BASE_UNITS[baseName]\n      }\n\n      currentUnitSystem[baseName] = {\n        unit: newUnit,\n        prefix: PREFIXES.NONE['']\n      }\n    } else {\n      newUnit = {\n        name,\n        value: defUnit.value,\n        dimensions: defUnit.dimensions.slice(0),\n        prefixes,\n        offset\n      }\n\n      // Create a new base if no matching base exists\n      let anyMatch = false\n      for (const i in BASE_UNITS) {\n        if (hasOwnProperty(BASE_UNITS, i)) {\n          let match = true\n          for (let j = 0; j < BASE_DIMENSIONS.length; j++) {\n            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[i].dimensions[j] || 0)) > 1e-12) {\n              match = false\n              break\n            }\n          }\n          if (match) {\n            anyMatch = true\n            newUnit.base = BASE_UNITS[i]\n            break\n          }\n        }\n      }\n      if (!anyMatch) {\n        baseName = baseName || name + '_STUFF' // foo --> foo_STUFF, or the essence of foo\n        // Add the new base unit\n        const newBaseUnit = { dimensions: defUnit.dimensions.slice(0) }\n        newBaseUnit.key = baseName\n        BASE_UNITS[baseName] = newBaseUnit\n\n        currentUnitSystem[baseName] = {\n          unit: newUnit,\n          prefix: PREFIXES.NONE['']\n        }\n\n        newUnit.base = BASE_UNITS[baseName]\n      }\n    }\n\n    Unit.UNITS[name] = newUnit\n\n    for (let i = 0; i < aliases.length; i++) {\n      const aliasName = aliases[i]\n      const alias = {}\n      for (const key in newUnit) {\n        if (hasOwnProperty(newUnit, key)) {\n          alias[key] = newUnit[key]\n        }\n      }\n      alias.name = aliasName\n      Unit.UNITS[aliasName] = alias\n    }\n\n    // delete the memoization cache because we created a new unit\n    delete _findUnit.cache\n\n    return new Unit(null, name)\n  }\n\n  Unit.deleteUnit = function (name) {\n    delete Unit.UNITS[name]\n\n    // delete the memoization cache because we deleted a unit\n    delete _findUnit.cache\n  }\n\n  // expose arrays with prefixes, dimensions, units, systems\n  Unit.PREFIXES = PREFIXES\n  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS\n  Unit.BASE_UNITS = BASE_UNITS\n  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS\n  Unit.UNITS = UNITS\n\n  return Unit\n}, { isClass: true })\n","import { factory } from '../../../utils/factory.js'\nimport { deepMap } from '../../../utils/collection.js'\n\nconst name = 'unit'\nconst dependencies = ['typed', 'Unit']\n\n// This function is named createUnitFunction to prevent a naming conflict with createUnit\nexport const createUnitFunction = /* #__PURE__ */ factory(name, dependencies, ({ typed, Unit }) => {\n  /**\n   * Create a unit. Depending on the passed arguments, the function\n   * will create and return a new math.Unit object.\n   * When a matrix is provided, all elements will be converted to units.\n   *\n   * Syntax:\n   *\n   *     math.unit(unit : string)\n   *     math.unit(value : number, valuelessUnit : Unit)\n   *     math.unit(value : number, valuelessUnit : string)\n   *\n   * Examples:\n   *\n   *    const kph = math.unit('km/h')   // returns Unit km/h (valueless)\n   *    const v = math.unit(25, kph)    // returns Unit 25 km/h\n   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm\n   *    const b = math.unit('23 kg')    // returns Unit 23 kg\n   *    a.to('m')                       // returns Unit 0.05 m\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, matrix, number, string, createUnit\n   *\n   * @param {* | Array | Matrix} args   A number and unit.\n   * @return {Unit | Array | Matrix}    The created unit\n   */\n\n  return typed(name, {\n    Unit: function (x) {\n      return x.clone()\n    },\n\n    string: function (x) {\n      if (Unit.isValuelessUnit(x)) {\n        return new Unit(null, x) // a pure unit\n      }\n\n      return Unit.parse(x, { allowNoUnits: true }) // a unit with value, like '5cm'\n    },\n\n    'number | BigNumber | Fraction | Complex, string | Unit': function (value, unit) {\n      return new Unit(value, unit)\n    },\n\n    'number | BigNumber | Fraction': function (value) {\n      // dimensionless\n      return new Unit(value)\n    },\n\n    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'sparse'\nconst dependencies = ['typed', 'SparseMatrix']\n\nexport const createSparse = /* #__PURE__ */ factory(name, dependencies, ({ typed, SparseMatrix }) => {\n  /**\n   * Create a Sparse Matrix. The function creates a new `math.Matrix` object from\n   * an `Array`. A Matrix has utility functions to manipulate the data in the\n   * matrix, like getting the size and getting or setting values in the matrix.\n   * Note that a Sparse Matrix is always 2-dimensional, so for example if\n   * you create one from a plain array of _n_ numbers, you get an _n_ by 1\n   * Sparse \"column vector\".\n   *\n   * Syntax:\n   *\n   *    math.sparse()               // creates an empty sparse matrix.\n   *    math.sparse(data)           // creates a sparse matrix with initial data.\n   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.\n   *\n   * Examples:\n   *\n   *    let m = math.sparse([[1, 2], [3, 4]])\n   *    m.size()                        // Array [2, 2]\n   *    m.resize([3, 2], 5)\n   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]\n   *    m.get([1, 0])                    // number 3\n   *    let v = math.sparse([0, 0, 1])\n   *    v.size()                        // Array [3, 1]\n   *    v.get([2, 0])                   // number 1\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, index, number, string, unit, matrix\n   *\n   * @param {Array | Matrix} [data]    A two dimensional array\n   *\n   * @return {Matrix} The created matrix\n   */\n  return typed(name, {\n    '': function () {\n      return new SparseMatrix([])\n    },\n\n    string: function (datatype) {\n      return new SparseMatrix([], datatype)\n    },\n\n    'Array | Matrix': function (data) {\n      return new SparseMatrix(data)\n    },\n\n    'Array | Matrix, string': function (data, datatype) {\n      return new SparseMatrix(data, datatype)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'createUnit'\nconst dependencies = ['typed', 'Unit']\n\nexport const createCreateUnit = /* #__PURE__ */ factory(name, dependencies, ({ typed, Unit }) => {\n  /**\n   * Create a user-defined unit and register it with the Unit type.\n   *\n   * Syntax:\n   *\n   *     math.createUnit({\n   *       baseUnit1: {\n   *         aliases: [string, ...]\n   *         prefixes: object\n   *       },\n   *       unit2: {\n   *         definition: string,\n   *         aliases: [string, ...]\n   *         prefixes: object,\n   *         offset: number\n   *       },\n   *       unit3: string    // Shortcut\n   *     })\n   *\n   *     // Another shortcut:\n   *     math.createUnit(string, unit : string, [object])\n   *\n   * Examples:\n   *\n   *     math.createUnit('foo')\n   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})\n   *     math.createUnit('mph', '1 mile/hour')\n   *     math.createUnit('km', math.unit(1000, 'm'))\n   *\n   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'\n   * @param {string, UnitDefinition, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.\n   * @param {Object} options   (optional) An object containing any of the following properties:\n   *     - `prefixes {string}` \"none\", \"short\", \"long\", \"binary_short\", or \"binary_long\". The default is \"none\".\n   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']\n   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.\n   *\n   * See also:\n   *\n   *     unit\n   *\n   * @return {Unit} The new unit\n   */\n  return typed(name, {\n\n    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.\n    'Object, Object': function (obj, options) {\n      return Unit.createUnit(obj, options)\n    },\n\n    // Same as above but without the options.\n    Object: function (obj) {\n      return Unit.createUnit(obj, {})\n    },\n\n    // Shortcut method for creating one unit.\n    'string, Unit | string | Object, Object': function (name, def, options) {\n      const obj = {}\n      obj[name] = def\n      return Unit.createUnit(obj, options)\n    },\n\n    // Same as above but without the options.\n    'string, Unit | string | Object': function (name, def) {\n      const obj = {}\n      obj[name] = def\n      return Unit.createUnit(obj, {})\n    },\n\n    // Without a definition, creates a base unit.\n    string: function (name) {\n      const obj = {}\n      obj[name] = {}\n      return Unit.createUnit(obj, {})\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'acos'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAcos = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the inverse cosine of a value.\n   *\n   * To avoid confusion with the matrix arccosine, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acos(x)\n   *\n   * Examples:\n   *\n   *    math.acos(0.5)           // returns number 1.0471975511965979\n   *    math.acos(math.cos(1.5)) // returns number 1.5\n   *\n   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i\n   *\n   * See also:\n   *\n   *    cos, atan, asin\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} The arc cosine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x >= -1 && x <= 1) || config.predictable) {\n        return Math.acos(x)\n      } else {\n        return new Complex(x, 0).acos()\n      }\n    },\n\n    Complex: function (x) {\n      return x.acos()\n    },\n\n    BigNumber: function (x) {\n      return x.acos()\n    }\n  })\n})\n","import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js'\n\nconst n1 = 'number'\nconst n2 = 'number, number'\n\nexport function acosNumber (x) {\n  return Math.acos(x)\n}\nacosNumber.signature = n1\n\nexport function acoshNumber (x) {\n  return acosh(x)\n}\nacoshNumber.signature = n1\n\nexport function acotNumber (x) {\n  return Math.atan(1 / x)\n}\nacotNumber.signature = n1\n\nexport function acothNumber (x) {\n  return isFinite(x)\n    ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2\n    : 0\n}\nacothNumber.signature = n1\n\nexport function acscNumber (x) {\n  return Math.asin(1 / x)\n}\nacscNumber.signature = n1\n\nexport function acschNumber (x) {\n  const xInv = 1 / x\n  return Math.log(xInv + Math.sqrt(xInv * xInv + 1))\n}\nacschNumber.signature = n1\n\nexport function asecNumber (x) {\n  return Math.acos(1 / x)\n}\nasecNumber.signature = n1\n\nexport function asechNumber (x) {\n  const xInv = 1 / x\n  const ret = Math.sqrt(xInv * xInv - 1)\n  return Math.log(ret + xInv)\n}\nasechNumber.signature = n1\n\nexport function asinNumber (x) {\n  return Math.asin(x)\n}\nasinNumber.signature = n1\n\nexport function asinhNumber (x) {\n  return asinh(x)\n}\nasinhNumber.signature = n1\n\nexport function atanNumber (x) {\n  return Math.atan(x)\n}\natanNumber.signature = n1\n\nexport function atan2Number (y, x) {\n  return Math.atan2(y, x)\n}\natan2Number.signature = n2\n\nexport function atanhNumber (x) {\n  return atanh(x)\n}\natanhNumber.signature = n1\n\nexport function cosNumber (x) {\n  return Math.cos(x)\n}\ncosNumber.signature = n1\n\nexport function coshNumber (x) {\n  return cosh(x)\n}\ncoshNumber.signature = n1\n\nexport function cotNumber (x) {\n  return 1 / Math.tan(x)\n}\ncotNumber.signature = n1\n\nexport function cothNumber (x) {\n  const e = Math.exp(2 * x)\n  return (e + 1) / (e - 1)\n}\ncothNumber.signature = n1\n\nexport function cscNumber (x) {\n  return 1 / Math.sin(x)\n}\ncscNumber.signature = n1\n\nexport function cschNumber (x) {\n  // consider values close to zero (+/-)\n  if (x === 0) {\n    return Number.POSITIVE_INFINITY\n  } else {\n    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x)\n  }\n}\ncschNumber.signature = n1\n\nexport function secNumber (x) {\n  return 1 / Math.cos(x)\n}\nsecNumber.signature = n1\n\nexport function sechNumber (x) {\n  return 2 / (Math.exp(x) + Math.exp(-x))\n}\nsechNumber.signature = n1\n\nexport function sinNumber (x) {\n  return Math.sin(x)\n}\nsinNumber.signature = n1\n\nexport function sinhNumber (x) {\n  return sinh(x)\n}\nsinhNumber.signature = n1\n\nexport function tanNumber (x) {\n  return Math.tan(x)\n}\ntanNumber.signature = n1\n\nexport function tanhNumber (x) {\n  return tanh(x)\n}\ntanhNumber.signature = n1\n","import { factory } from '../../utils/factory.js'\nimport { acoshNumber } from '../../plain/number/index.js'\n\nconst name = 'acosh'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAcosh = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the hyperbolic arccos of a value,\n   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.acosh(x)\n   *\n   * Examples:\n   *\n   *    math.acosh(1.5)       // returns 0.9624236501192069\n   *\n   * See also:\n   *\n   *    cosh, asinh, atanh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccosine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 1 || config.predictable) {\n        return acoshNumber(x)\n      }\n      if (x <= -1) {\n        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI)\n      }\n      return new Complex(x, 0).acosh()\n    },\n\n    Complex: function (x) {\n      return x.acosh()\n    },\n\n    BigNumber: function (x) {\n      return x.acosh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { acotNumber } from '../../plain/number/index.js'\n\nconst name = 'acot'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createAcot = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.\n   *\n   * To avoid confusion with the matrix arccotanget, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acot(x)\n   *\n   * Examples:\n   *\n   *    math.acot(0.5)           // returns number 1.1071487177940904\n   *    math.acot(2)             // returns number 0.4636476090008061\n   *    math.acot(math.cot(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    cot, atan\n   *\n   * @param {number | BigNumber| Complex} x   Function input\n   * @return {number | BigNumber| Complex} The arc cotangent of x\n   */\n  return typed(name, {\n    number: acotNumber,\n\n    Complex: function (x) {\n      return x.acot()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).atan()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { acothNumber } from '../../plain/number/index.js'\n\nconst name = 'acoth'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAcoth = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the inverse hyperbolic tangent of a value,\n   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.\n   *\n   * To avoid confusion with the matrix inverse hyperbolic tangent, this\n   * function does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acoth(x)\n   *\n   * Examples:\n   *\n   *    math.acoth(0.5)     // returns 0.5493061443340548 - 1.5707963267948966i\n   *\n   * See also:\n   *\n   *    acsch, asech\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccotangent of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x >= 1 || x <= -1 || config.predictable) {\n        return acothNumber(x)\n      }\n      return new Complex(x, 0).acoth()\n    },\n\n    Complex: function (x) {\n      return x.acoth()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).atanh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { acscNumber } from '../../plain/number/index.js'\n\nconst name = 'acsc'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAcsc = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.\n   *\n   * To avoid confusion with the matrix arccosecant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acsc(x)\n   *\n   * Examples:\n   *\n   *    math.acsc(2)             // returns 0.5235987755982989\n   *    math.acsc(0.5)           // returns Complex 1.5707963267948966 -1.3169578969248166i\n   *    math.acsc(math.csc(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    csc, asin, asec\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc cosecant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return acscNumber(x)\n      }\n      return new Complex(x, 0).acsc()\n    },\n\n    Complex: function (x) {\n      return x.acsc()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).asin()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { acschNumber } from '../../plain/number/index.js'\n\nconst name = 'acsch'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createAcsch = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the inverse hyperbolic cosecant of a value,\n   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.\n   *\n   * To avoid confusion with the matrix inverse hyperbolic cosecant, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.acsch(x)\n   *\n   * Examples:\n   *\n   *    math.acsch(0.5)       // returns 1.4436354751788103\n   *\n   * See also:\n   *\n   *    asech, acoth\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arccosecant of x\n   */\n  return typed(name, {\n    number: acschNumber,\n\n    Complex: function (x) {\n      return x.acsch()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).asinh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { asecNumber } from '../../plain/number/index.js'\n\nconst name = 'asec'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAsec = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.\n   *\n   * To avoid confusion with the matrix arcsecant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.asec(x)\n   *\n   * Examples:\n   *\n   *    math.asec(2)             // returns 1.0471975511965979\n   *    math.asec(math.sec(1.5)) // returns 1.5\n   *\n   *    math.asec(0.5)           // returns Complex 0 + 1.3169578969248166i\n   *\n   * See also:\n   *\n   *    acos, acot, acsc\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} The arc secant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if (x <= -1 || x >= 1 || config.predictable) {\n        return asecNumber(x)\n      }\n      return new Complex(x, 0).asec()\n    },\n\n    Complex: function (x) {\n      return x.asec()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).acos()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { asechNumber } from '../../plain/number/index.js'\n\nconst name = 'asech'\nconst dependencies = ['typed', 'config', 'Complex', 'BigNumber']\n\nexport const createAsech = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic arcsecant of a value,\n   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic arcsecant, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.asech(x)\n   *\n   * Examples:\n   *\n   *    math.asech(0.5)       // returns 1.3169578969248166\n   *\n   * See also:\n   *\n   *    acsch, acoth\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arcsecant of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x <= 1 && x >= -1) || config.predictable) {\n        const xInv = 1 / x\n        if (xInv > 0 || config.predictable) {\n          return asechNumber(x)\n        }\n\n        const ret = Math.sqrt(xInv * xInv - 1)\n        return new Complex(Math.log(ret - xInv), Math.PI)\n      }\n\n      return new Complex(x, 0).asech()\n    },\n\n    Complex: function (x) {\n      return x.asech()\n    },\n\n    BigNumber: function (x) {\n      return new BigNumber(1).div(x).acosh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'asin'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAsin = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the inverse sine of a value.\n   *\n   * To avoid confusion with the matric arcsine, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.asin(x)\n   *\n   * Examples:\n   *\n   *    math.asin(0.5)           // returns number 0.5235987755982989\n   *    math.asin(math.sin(1.5)) // returns number 1.5\n   *\n   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166i\n   *\n   * See also:\n   *\n   *    sin, atan, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc sine of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x >= -1 && x <= 1) || config.predictable) {\n        return Math.asin(x)\n      } else {\n        return new Complex(x, 0).asin()\n      }\n    },\n\n    Complex: function (x) {\n      return x.asin()\n    },\n\n    BigNumber: function (x) {\n      return x.asin()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { asinhNumber } from '../../plain/number/index.js'\n\nconst name = 'asinh'\nconst dependencies = ['typed']\n\nexport const createAsinh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic arcsine of a value,\n   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.\n   *\n   * To avoid confusion with the matrix hyperbolic arcsine, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.asinh(x)\n   *\n   * Examples:\n   *\n   *    math.asinh(0.5)       // returns 0.48121182505960347\n   *\n   * See also:\n   *\n   *    acosh, atanh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arcsine of x\n   */\n  return typed('asinh', {\n    number: asinhNumber,\n\n    Complex: function (x) {\n      return x.asinh()\n    },\n\n    BigNumber: function (x) {\n      return x.asinh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'atan'\nconst dependencies = ['typed']\n\nexport const createAtan = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the inverse tangent of a value.\n   *\n   * To avoid confusion with matrix arctangent, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.atan(x)\n   *\n   * Examples:\n   *\n   *    math.atan(0.5)           // returns number 0.4636476090008061\n   *    math.atan(2)             // returns number 1.1071487177940904\n   *    math.atan(math.tan(1.5)) // returns number 1.5\n   *\n   * See also:\n   *\n   *    tan, asin, acos\n   *\n   * @param {number | BigNumber | Complex} x   Function input\n   * @return {number | BigNumber | Complex} The arc tangent of x\n   */\n  return typed('atan', {\n    number: function (x) {\n      return Math.atan(x)\n    },\n\n    Complex: function (x) {\n      return x.atan()\n    },\n\n    BigNumber: function (x) {\n      return x.atan()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js'\nimport { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js'\nimport { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'atan2'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'equalScalar',\n  'BigNumber',\n  'DenseMatrix',\n  'concat'\n]\n\nexport const createAtan2 = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, BigNumber, DenseMatrix, concat }) => {\n  const matAlgo02xDS0 = createMatAlgo02xDS0({ typed, equalScalar })\n  const matAlgo03xDSf = createMatAlgo03xDSf({ typed })\n  const matAlgo09xS0Sf = createMatAlgo09xS0Sf({ typed, equalScalar })\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo12xSfs = createMatAlgo12xSfs({ typed, DenseMatrix })\n  const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n\n  /**\n   * Calculate the inverse tangent function with two arguments, y/x.\n   * By providing two arguments, the right quadrant of the computed angle can be\n   * determined.\n   *\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.atan2(y, x)\n   *\n   * Examples:\n   *\n   *    math.atan2(2, 2) / math.pi       // returns number 0.25\n   *\n   *    const angle = math.unit(60, 'deg')\n   *    const x = math.cos(angle)\n   *    const y = math.sin(angle)\n   *    math.atan2(y, x) * 180 / math.pi  // returns 60\n   *\n   *    math.atan(2)             // returns number 1.1071487177940904\n   *\n   * See also:\n   *\n   *    tan, atan, sin, cos\n   *\n   * @param {number | Array | Matrix} y  Second dimension\n   * @param {number | Array | Matrix} x  First dimension\n   * @return {number | Array | Matrix} Four-quadrant inverse tangent\n   */\n  return typed(\n    name,\n    {\n      'number, number': Math.atan2,\n\n      // Complex numbers doesn't seem to have a reasonable implementation of\n      // atan2(). Even Matlab removed the support, after they only calculated\n      // the atan only on base of the real part of the numbers and ignored\n      // the imaginary.\n\n      'BigNumber, BigNumber': (y, x) => BigNumber.atan2(y, x)\n    },\n    matrixAlgorithmSuite({\n      scalar: 'number | BigNumber',\n      SS: matAlgo09xS0Sf,\n      DS: matAlgo03xDSf,\n      SD: matAlgo02xDS0,\n      Ss: matAlgo11xS0s,\n      sS: matAlgo12xSfs\n    })\n  )\n})\n","import { factory } from '../../utils/factory.js'\nimport { atanhNumber } from '../../plain/number/index.js'\n\nconst name = 'atanh'\nconst dependencies = ['typed', 'config', 'Complex']\n\nexport const createAtanh = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, Complex }) => {\n  /**\n   * Calculate the hyperbolic arctangent of a value,\n   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.\n   *\n   * To avoid confusion with the matrix hyperbolic arctangent, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.atanh(x)\n   *\n   * Examples:\n   *\n   *    math.atanh(0.5)       // returns 0.5493061443340549\n   *\n   * See also:\n   *\n   *    acosh, asinh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic arctangent of x\n   */\n  return typed(name, {\n    number: function (x) {\n      if ((x <= 1 && x >= -1) || config.predictable) {\n        return atanhNumber(x)\n      }\n      return new Complex(x, 0).atanh()\n    },\n\n    Complex: function (x) {\n      return x.atanh()\n    },\n\n    BigNumber: function (x) {\n      return x.atanh()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nexport const createTrigUnit = /* #__PURE__ */ factory(\n  'trigUnit', ['typed'], ({ typed }) => ({\n    Unit: typed.referToSelf(self => x => {\n      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {\n        throw new TypeError('Unit in function cot is no angle')\n      }\n      return typed.find(self, x.valueType())(x.value)\n    })\n  })\n)\n","import { factory } from '../../utils/factory.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'cos'\nconst dependencies = ['typed']\n\nexport const createCos = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the cosine of a value.\n   *\n   * To avoid confusion with the matrix cosine, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.cos(x)\n   *\n   * Examples:\n   *\n   *    math.cos(2)                      // returns number -0.4161468365471422\n   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475\n   *    math.cos(math.unit(180, 'deg'))  // returns number -1\n   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Cosine of x\n   */\n  return typed(name, {\n    number: Math.cos,\n    'Complex | BigNumber': x => x.cos()\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { cosh as coshNumber } from '../../utils/number.js'\n\nconst name = 'cosh'\nconst dependencies = ['typed']\n\nexport const createCosh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic cosine of a value,\n   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.\n   *\n   * To avoid confusion with the matrix hyperbolic cosine, this function does\n   * not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.cosh(x)\n   *\n   * Examples:\n   *\n   *    math.cosh(0.5)       // returns number 1.1276259652063807\n   *\n   * See also:\n   *\n   *    sinh, tanh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cosine of x\n   */\n  return typed(name, {\n    number: coshNumber,\n    'Complex | BigNumber': x => x.cosh()\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { cotNumber } from '../../plain/number/index.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'cot'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCot = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.\n   *\n   * To avoid confusion with the matrix cotangent, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.cot(x)\n   *\n   * Examples:\n   *\n   *    math.cot(2)      // returns number -0.45765755436028577\n   *    1 / math.tan(2)  // returns number -0.45765755436028577\n   *\n   * See also:\n   *\n   *    tan, sec, csc\n   *\n   * @param {number | Complex | Unit | Array | Matrix} x  Function input\n   * @return {number | Complex | Array | Matrix} Cotangent of x\n   */\n  return typed(name, {\n    number: cotNumber,\n    Complex: x => x.cot(),\n    BigNumber: x => new BigNumber(1).div(x.tan())\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { cothNumber } from '../../plain/number/index.js'\n\nconst name = 'coth'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCoth = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic cotangent of a value,\n   * defined as `coth(x) = 1 / tanh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic cotangent, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.coth(x)\n   *\n   * Examples:\n   *\n   *    // coth(x) = 1 / tanh(x)\n   *    math.coth(2)         // returns 1.0373147207275482\n   *    1 / math.tanh(2)     // returns 1.0373147207275482\n   *\n   * See also:\n   *\n   *    sinh, tanh, cosh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cotangent of x\n   */\n  return typed(name, {\n    number: cothNumber,\n    Complex: x => x.coth(),\n    BigNumber: x => new BigNumber(1).div(x.tanh())\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { cscNumber } from '../../plain/number/index.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'csc'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCsc = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.\n   *\n   * To avoid confusion with the matrix cosecant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.csc(x)\n   *\n   * Examples:\n   *\n   *    math.csc(2)      // returns number 1.099750170294617\n   *    1 / math.sin(2)  // returns number 1.099750170294617\n   *\n   * See also:\n   *\n   *    sin, sec, cot\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Cosecant of x\n   */\n  return typed(name, {\n    number: cscNumber,\n    Complex: x => x.csc(),\n    BigNumber: x => new BigNumber(1).div(x.sin())\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { cschNumber } from '../../plain/number/index.js'\n\nconst name = 'csch'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createCsch = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic cosecant of a value,\n   * defined as `csch(x) = 1 / sinh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic cosecant, this function\n   * does not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.csch(x)\n   *\n   * Examples:\n   *\n   *    // csch(x) = 1/ sinh(x)\n   *    math.csch(0.5)       // returns 1.9190347513349437\n   *    1 / math.sinh(0.5)   // returns 1.9190347513349437\n   *\n   * See also:\n   *\n   *    sinh, sech, coth\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic cosecant of x\n   */\n  return typed(name, {\n    number: cschNumber,\n    Complex: x => x.csch(),\n    BigNumber: x => new BigNumber(1).div(x.sinh())\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { secNumber } from '../../plain/number/index.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'sec'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createSec = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.\n   *\n   * To avoid confusion with the matrix secant, this function does not\n   * apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sec(x)\n   *\n   * Examples:\n   *\n   *    math.sec(2)      // returns number -2.4029979617223822\n   *    1 / math.cos(2)  // returns number -2.4029979617223822\n   *\n   * See also:\n   *\n   *    cos, csc, cot\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Secant of x\n   */\n  return typed(name, {\n    number: secNumber,\n    Complex: x => x.sec(),\n    BigNumber: x => new BigNumber(1).div(x.cos())\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { sechNumber } from '../../plain/number/index.js'\n\nconst name = 'sech'\nconst dependencies = ['typed', 'BigNumber']\n\nexport const createSech = /* #__PURE__ */ factory(name, dependencies, ({ typed, BigNumber }) => {\n  /**\n   * Calculate the hyperbolic secant of a value,\n   * defined as `sech(x) = 1 / cosh(x)`.\n   *\n   * To avoid confusion with the matrix hyperbolic secant, this function does\n   * not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sech(x)\n   *\n   * Examples:\n   *\n   *    // sech(x) = 1/ cosh(x)\n   *    math.sech(0.5)       // returns 0.886818883970074\n   *    1 / math.cosh(0.5)   // returns 0.886818883970074\n   *\n   * See also:\n   *\n   *    cosh, csch, coth\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic secant of x\n   */\n  return typed(name, {\n    number: sechNumber,\n    Complex: x => x.sech(),\n    BigNumber: x => new BigNumber(1).div(x.cosh())\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'sin'\nconst dependencies = ['typed']\n\nexport const createSin = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the sine of a value.\n   *\n   * To avoid confusion with the matrix sine, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sin(x)\n   *\n   * Examples:\n   *\n   *    math.sin(2)                      // returns number 0.9092974268256813\n   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475\n   *    math.sin(math.unit(90, 'deg'))   // returns number 1\n   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5\n   *\n   *    const angle = 0.2\n   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1\n   *\n   * See also:\n   *\n   *    cos, tan\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Sine of x\n   */\n  return typed(name, {\n    number: Math.sin,\n    'Complex | BigNumber': x => x.sin()\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { sinhNumber } from '../../plain/number/index.js'\n\nconst name = 'sinh'\nconst dependencies = ['typed']\n\nexport const createSinh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic sine of a value,\n   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.\n   *\n   * To avoid confusion with the matrix hyperbolic sine, this function does\n   * not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.sinh(x)\n   *\n   * Examples:\n   *\n   *    math.sinh(0.5)       // returns number 0.5210953054937474\n   *\n   * See also:\n   *\n   *    cosh, tanh\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic sine of x\n   */\n  return typed(name, {\n    number: sinhNumber,\n    'Complex | BigNumber': x => x.sinh()\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createTrigUnit } from './trigUnit.js'\n\nconst name = 'tan'\nconst dependencies = ['typed']\n\nexport const createTan = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  const trigUnit = createTrigUnit({ typed })\n\n  /**\n   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.\n   *\n   * To avoid confusion with the matrix tangent, this function does not apply\n   * to matrices.\n   *\n   * Syntax:\n   *\n   *    math.tan(x)\n   *\n   * Examples:\n   *\n   *    math.tan(0.5)                    // returns number 0.5463024898437905\n   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905\n   *    math.tan(math.pi / 4)            // returns number 1\n   *    math.tan(math.unit(45, 'deg'))   // returns number 1\n   *\n   * See also:\n   *\n   *    atan, sin, cos\n   *\n   * @param {number | BigNumber | Complex | Unit} x  Function input\n   * @return {number | BigNumber | Complex} Tangent of x\n   */\n  return typed(name, {\n    number: Math.tan,\n    'Complex | BigNumber': x => x.tan()\n  }, trigUnit)\n})\n","import { factory } from '../../utils/factory.js'\nimport { tanh as _tanh } from '../../utils/number.js'\n\nconst name = 'tanh'\nconst dependencies = ['typed']\n\nexport const createTanh = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Calculate the hyperbolic tangent of a value,\n   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.\n   *\n   * To avoid confusion with matrix hyperbolic tangent, this function does\n   * not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.tanh(x)\n   *\n   * Examples:\n   *\n   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)\n   *    math.tanh(0.5)                   // returns 0.46211715726000974\n   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974\n   *    1 / math.coth(0.5)               // returns 0.46211715726000974\n   *\n   * See also:\n   *\n   *    sinh, cosh, coth\n   *\n   * @param {number | BigNumber | Complex} x  Function input\n   * @return {number | BigNumber | Complex} Hyperbolic tangent of x\n   */\n  return typed('tanh', {\n    number: _tanh,\n    'Complex | BigNumber': x => x.tanh()\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setCartesian'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetCartesian = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the cartesian product of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays\n   * and the values will be sorted in ascending order before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setCartesian(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]\n   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference, setPowerset\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The cartesian product of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result = []\n\n      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) { // if any of them is empty, return empty\n        const b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural)\n        const b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural)\n        result = []\n        for (let i = 0; i < b1.length; i++) {\n          for (let j = 0; j < b2.length; j++) {\n            result.push([b1[i], b2[j]])\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return result\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result)\n    }\n  })\n})\n","import { flatten, generalize, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setDifference'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetDifference = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]\n   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setSymDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The difference of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result\n      if (subset(size(a1), new Index(0)) === 0) { // empty-anything=empty\n        result = []\n      } else if (subset(size(a2), new Index(0)) === 0) { // anything-empty=anything\n        return flatten(a1.toArray())\n      } else {\n        const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n        const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n        result = []\n        let inb2\n        for (let i = 0; i < b1.length; i++) {\n          inb2 = false\n          for (let j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n              inb2 = true\n              break\n            }\n          }\n          if (!inb2) {\n            result.push(b1[i])\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result)\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result))\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setDistinct'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetDistinct = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Collect the distinct elements of a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setDistinct(set)\n   *\n   * Examples:\n   *\n   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]\n   *\n   * See also:\n   *\n   *    setMultiplicity\n   *\n   * @param {Array | Matrix}    a  A multiset\n   * @return {Array | Matrix}    A set containing the distinc elements of the multiset\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      let result\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return empty\n        result = []\n      } else {\n        const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n        result = []\n        result.push(b[0])\n        for (let i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            result.push(b[i])\n          }\n        }\n      }\n      // return an array, if the input was an array\n      if (Array.isArray(a)) {\n        return result\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(result)\n    }\n  })\n})\n","import { flatten, generalize, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setIntersect'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix']\n\nexport const createSetIntersect = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index, DenseMatrix }) => {\n  /**\n   * Create the intersection of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIntersect(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]\n   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]\n   *\n   * See also:\n   *\n   *    setUnion, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The intersection of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      let result\n      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) { // of any of them is empty, return empty\n        result = []\n      } else {\n        const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n        const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n        result = []\n        for (let i = 0; i < b1.length; i++) {\n          for (let j = 0; j < b2.length; j++) {\n            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n              result.push(b1[i])\n              break\n            }\n          }\n        }\n      }\n      // return an array, if both inputs were arrays\n      if (Array.isArray(a1) && Array.isArray(a2)) {\n        return generalize(result)\n      }\n      // return a matrix otherwise\n      return new DenseMatrix(generalize(result))\n    }\n  })\n})\n","import { flatten, identify } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setIsSubset'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetIsSubset = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setIsSubset(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false\n   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {boolean} Returns true when a1 is a subset of a2, returns false otherwise\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // empty is a subset of anything\n        return true\n      } else if (subset(size(a2), new Index(0)) === 0) { // anything is not a subset of empty\n        return false\n      }\n      const b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural))\n      const b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural))\n      let inb2\n      for (let i = 0; i < b1.length; i++) {\n        inb2 = false\n        for (let j = 0; j < b2.length; j++) {\n          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) { // the identifier is always a decimal int\n            inb2 = true\n            break\n          }\n        }\n        if (inb2 === false) {\n          return false\n        }\n      }\n      return true\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setMultiplicity'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetMultiplicity = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Count the multiplicity of an element in a multiset.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setMultiplicity(element, set)\n   *\n   * Examples:\n   *\n   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1\n   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2\n   *\n   * See also:\n   *\n   *    setDistinct, setSize\n   *\n   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset\n   * @param {Array | Matrix}     a  A multiset\n   * @return {number}            The number of how many times the multiset contains the element\n   */\n  return typed(name, {\n    'number | BigNumber | Fraction | Complex, Array | Matrix': function (e, a) {\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return 0\n        return 0\n      }\n      const b = flatten(Array.isArray(a) ? a : a.toArray())\n      let count = 0\n      for (let i = 0; i < b.length; i++) {\n        if (compareNatural(b[i], e) === 0) {\n          count++\n        }\n      }\n      return count\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setPowerset'\nconst dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index']\n\nexport const createSetPowerset = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, subset, compareNatural, Index }) => {\n  /**\n   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setPowerset(set)\n   *\n   * Examples:\n   *\n   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]\n   *\n   * See also:\n   *\n   *    setCartesian\n   *\n   * @param {Array | Matrix}    a  A (multi)set\n   * @return {Array}    The powerset of the (multi)set\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      if (subset(size(a), new Index(0)) === 0) { // if empty, return empty\n        return []\n      }\n      const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n      const result = []\n      let number = 0\n      while (number.toString(2).length <= b.length) {\n        result.push(_subset(b, number.toString(2).split('').reverse()))\n        number++\n      }\n      // can not return a matrix, because of the different size of the subarrays\n      return _sort(result)\n    }\n  })\n\n  // create subset\n  function _subset (array, bitarray) {\n    const result = []\n    for (let i = 0; i < bitarray.length; i++) {\n      if (bitarray[i] === '1') {\n        result.push(array[i])\n      }\n    }\n    return result\n  }\n\n  // sort subsests by length\n  function _sort (array) {\n    let temp = []\n    for (let i = array.length - 1; i > 0; i--) {\n      for (let j = 0; j < i; j++) {\n        if (array[j].length > array[j + 1].length) {\n          temp = array[j]\n          array[j] = array[j + 1]\n          array[j + 1] = temp\n        }\n      }\n    }\n    return array\n  }\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setSize'\nconst dependencies = ['typed', 'compareNatural']\n\nexport const createSetSize = /* #__PURE__ */ factory(name, dependencies, ({ typed, compareNatural }) => {\n  /**\n   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.\n   * A multi-dimension array will be converted to a single-dimension array before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSize(set)\n   *    math.setSize(set, unique)\n   *\n   * Examples:\n   *\n   *    math.setSize([1, 2, 2, 4])          // returns 4\n   *    math.setSize([1, 2, 2, 4], true)    // returns 3\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix} a  A multiset\n   * @param {boolean} [unique]  If true, only the unique values are counted. False by default\n   * @return {number}           The number of elements of the (multi)set\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length\n    },\n    'Array | Matrix, boolean': function (a, unique) {\n      if (unique === false || a.length === 0) {\n        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length\n      } else {\n        const b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural)\n        let count = 1\n        for (let i = 1; i < b.length; i++) {\n          if (compareNatural(b[i], b[i - 1]) !== 0) {\n            count++\n          }\n        }\n        return count\n      }\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setSymDifference'\nconst dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index']\n\nexport const createSetSymDifference = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, concat, subset, setDifference, Index }) => {\n  /**\n   * Create the symmetric difference of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setSymDifference(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]\n   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]\n   *\n   * See also:\n   *\n   *    setUnion, setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The symmetric difference of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // if any of them is empty, return the other one\n        return flatten(a2)\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1)\n      }\n      const b1 = flatten(a1)\n      const b2 = flatten(a2)\n      return concat(setDifference(b1, b2), setDifference(b2, b1))\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'setUnion'\nconst dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index']\n\nexport const createSetUnion = /* #__PURE__ */ factory(name, dependencies, ({ typed, size, concat, subset, setIntersect, setSymDifference, Index }) => {\n  /**\n   * Create the union of two (multi)sets.\n   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.\n   *\n   * Syntax:\n   *\n   *    math.setUnion(set1, set2)\n   *\n   * Examples:\n   *\n   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]\n   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]\n   *\n   * See also:\n   *\n   *    setIntersect, setDifference\n   *\n   * @param {Array | Matrix}    a1  A (multi)set\n   * @param {Array | Matrix}    a2  A (multi)set\n   * @return {Array | Matrix}    The union of two (multi)sets\n   */\n  return typed(name, {\n    'Array | Matrix, Array | Matrix': function (a1, a2) {\n      if (subset(size(a1), new Index(0)) === 0) { // if any of them is empty, return the other one\n        return flatten(a2)\n      } else if (subset(size(a2), new Index(0)) === 0) {\n        return flatten(a1)\n      }\n      const b1 = flatten(a1)\n      const b2 = flatten(a2)\n      return concat(setSymDifference(b1, b2), setIntersect(b1, b2))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js'\nimport { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js'\nimport { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js'\nimport { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js'\n\nconst name = 'add'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'addScalar',\n  'equalScalar',\n  'DenseMatrix',\n  'SparseMatrix',\n  'concat'\n]\n\nexport const createAdd = /* #__PURE__ */ factory(\n  name,\n  dependencies,\n  ({ typed, matrix, addScalar, equalScalar, DenseMatrix, SparseMatrix, concat }) => {\n    const matAlgo01xDSid = createMatAlgo01xDSid({ typed })\n    const matAlgo04xSidSid = createMatAlgo04xSidSid({ typed, equalScalar })\n    const matAlgo10xSids = createMatAlgo10xSids({ typed, DenseMatrix })\n    const matrixAlgorithmSuite = createMatrixAlgorithmSuite({ typed, matrix, concat })\n    /**\n     * Add two or more values, `x + y`.\n     * For matrices, the function is evaluated element wise.\n     *\n     * Syntax:\n     *\n     *    math.add(x, y)\n     *    math.add(x, y, z, ...)\n     *\n     * Examples:\n     *\n     *    math.add(2, 3)               // returns number 5\n     *    math.add(2, 3, 4)            // returns number 9\n     *\n     *    const a = math.complex(2, 3)\n     *    const b = math.complex(-4, 1)\n     *    math.add(a, b)               // returns Complex -2 + 4i\n     *\n     *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]\n     *\n     *    const c = math.unit('5 cm')\n     *    const d = math.unit('2.1 mm')\n     *    math.add(c, d)               // returns Unit 52.1 mm\n     *\n     *    math.add(\"2.3\", \"4\")         // returns number 6.3\n     *\n     * See also:\n     *\n     *    subtract, sum\n     *\n     * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add\n     * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add\n     * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`\n     */\n    return typed(\n      name,\n      {\n        'any, any': addScalar,\n\n        'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {\n          let result = self(x, y)\n\n          for (let i = 0; i < rest.length; i++) {\n            result = self(result, rest[i])\n          }\n\n          return result\n        })\n      },\n      matrixAlgorithmSuite({\n        elop: addScalar,\n        DS: matAlgo01xDSid,\n        SS: matAlgo04xSidSid,\n        Ss: matAlgo10xSids\n      })\n    )\n  })\n","import { factory } from '../../utils/factory.js'\nimport { flatten } from '../../utils/array.js'\nimport { isComplex } from '../../utils/is.js'\n\nconst name = 'hypot'\nconst dependencies = [\n  'typed',\n  'abs',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'sqrt',\n  'smaller',\n  'isPositive'\n]\n\nexport const createHypot = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, addScalar, divideScalar, multiplyScalar, sqrt, smaller, isPositive }) => {\n  /**\n   * Calculate the hypotenuse of a list with values. The hypotenuse is defined as:\n   *\n   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)\n   *\n   * For matrix input, the hypotenuse is calculated for all values in the matrix.\n   *\n   * Syntax:\n   *\n   *     math.hypot(a, b, ...)\n   *     math.hypot([a, b, c, ...])\n   *\n   * Examples:\n   *\n   *     math.hypot(3, 4)      // 5\n   *     math.hypot(3, 4, 5)   // 7.0710678118654755\n   *     math.hypot([3, 4, 5]) // 7.0710678118654755\n   *     math.hypot(-2)        // 2\n   *\n   * See also:\n   *\n   *     abs, norm\n   *\n   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.\n   *                                                          Matrix and Array input is flattened and returns a\n   *                                                          single number for the whole matrix.\n   * @return {number | BigNumber} Returns the hypothenusa of the input values.\n   */\n  return typed(name, {\n    '... number | BigNumber': _hypot,\n\n    Array: _hypot,\n\n    Matrix: M => _hypot(flatten(M.toArray(), true))\n  })\n\n  /**\n   * Calculate the hypotenuse for an Array with values\n   * @param {Array.<number | BigNumber>} args\n   * @return {number | BigNumber} Returns the result\n   * @private\n   */\n  function _hypot (args) {\n    // code based on `hypot` from es6-shim:\n    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633\n    let result = 0\n    let largest = 0\n\n    for (let i = 0; i < args.length; i++) {\n      if (isComplex(args[i])) {\n        throw new TypeError('Unexpected type of argument to hypot')\n      }\n      const value = abs(args[i])\n      if (smaller(largest, value)) {\n        result = multiplyScalar(result,\n          multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)))\n        result = addScalar(result, 1)\n        largest = value\n      } else {\n        result = addScalar(result, isPositive(value)\n          ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest))\n          : value)\n      }\n    }\n\n    return multiplyScalar(largest, sqrt(result))\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'norm'\nconst dependencies = [\n  'typed',\n  'abs',\n  'add',\n  'pow',\n  'conj',\n  'sqrt',\n  'multiply',\n  'equalScalar',\n  'larger',\n  'smaller',\n  'matrix',\n  'ctranspose',\n  'eigs'\n]\n\nexport const createNorm = /* #__PURE__ */ factory(\n  name,\n  dependencies,\n  ({\n    typed,\n    abs,\n    add,\n    pow,\n    conj,\n    sqrt,\n    multiply,\n    equalScalar,\n    larger,\n    smaller,\n    matrix,\n    ctranspose,\n    eigs\n  }) => {\n    /**\n     * Calculate the norm of a number, vector or matrix.\n     *\n     * The second parameter p is optional. If not provided, it defaults to 2.\n     *\n     * Syntax:\n     *\n     *    math.norm(x)\n     *    math.norm(x, p)\n     *\n     * Examples:\n     *\n     *    math.abs(-3.5)                         // returns 3.5\n     *    math.norm(-3.5)                        // returns 3.5\n     *\n     *    math.norm(math.complex(3, -4))         // returns 5\n     *\n     *    math.norm([1, 2, -3], Infinity)        // returns 3\n     *    math.norm([1, 2, -3], -Infinity)       // returns 1\n     *\n     *    math.norm([3, 4], 2)                   // returns 5\n     *\n     *    math.norm([[1, 2], [3, 4]], 1)          // returns 6\n     *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7\n     *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661\n     *\n     * See also:\n     *\n     *    abs, hypot\n     *\n     * @param  {number | BigNumber | Complex | Array | Matrix} x\n     *            Value for which to calculate the norm\n     * @param  {number | BigNumber | string} [p=2]\n     *            Vector space.\n     *            Supported numbers include Infinity and -Infinity.\n     *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)\n     * @return {number | BigNumber} the p-norm\n     */\n    return typed(name, {\n      number: Math.abs,\n\n      Complex: function (x) {\n        return x.abs()\n      },\n\n      BigNumber: function (x) {\n        // norm(x) = abs(x)\n        return x.abs()\n      },\n\n      boolean: function (x) {\n        // norm(x) = abs(x)\n        return Math.abs(x)\n      },\n\n      Array: function (x) {\n        return _norm(matrix(x), 2)\n      },\n\n      Matrix: function (x) {\n        return _norm(x, 2)\n      },\n\n      'Array, number | BigNumber | string': function (x, p) {\n        return _norm(matrix(x), p)\n      },\n\n      'Matrix, number | BigNumber | string': function (x, p) {\n        return _norm(x, p)\n      }\n    })\n\n    /**\n     * Calculate the plus infinity norm for a vector\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNormPlusInfinity (x) {\n      // norm(x, Infinity) = max(abs(x))\n      let pinf = 0\n      // skip zeros since abs(0) === 0\n      x.forEach(function (value) {\n        const v = abs(value)\n        if (larger(v, pinf)) {\n          pinf = v\n        }\n      }, true)\n      return pinf\n    }\n\n    /**\n     * Calculate the minus infinity norm for a vector\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNormMinusInfinity (x) {\n      // norm(x, -Infinity) = min(abs(x))\n      let ninf\n      // skip zeros since abs(0) === 0\n      x.forEach(function (value) {\n        const v = abs(value)\n        if (!ninf || smaller(v, ninf)) {\n          ninf = v\n        }\n      }, true)\n      return ninf || 0\n    }\n\n    /**\n     * Calculate the norm for a vector\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _vectorNorm (x, p) {\n      // check p\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        return _vectorNormPlusInfinity(x)\n      }\n      if (p === Number.NEGATIVE_INFINITY || p === '-inf') {\n        return _vectorNormMinusInfinity(x)\n      }\n      if (p === 'fro') {\n        return _norm(x, 2)\n      }\n      if (typeof p === 'number' && !isNaN(p)) {\n        // check p != 0\n        if (!equalScalar(p, 0)) {\n          // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p\n          let n = 0\n          // skip zeros since abs(0) === 0\n          x.forEach(function (value) {\n            n = add(pow(abs(value), p), n)\n          }, true)\n          return pow(n, 1 / p)\n        }\n        return Number.POSITIVE_INFINITY\n      }\n      // invalid parameter value\n      throw new Error('Unsupported parameter value')\n    }\n\n    /**\n     * Calculate the Frobenius norm for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormFrobenius (x) {\n      // norm(x) = sqrt(sum(diag(x'x)))\n      let fro = 0\n      x.forEach(function (value, index) {\n        fro = add(fro, multiply(value, conj(value)))\n      })\n      return abs(sqrt(fro))\n    }\n\n    /**\n     * Calculate the norm L1 for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormOne (x) {\n      // norm(x) = the largest column sum\n      const c = []\n      // result\n      let maxc = 0\n      // skip zeros since abs(0) == 0\n      x.forEach(function (value, index) {\n        const j = index[1]\n        const cj = add(c[j] || 0, abs(value))\n        if (larger(cj, maxc)) {\n          maxc = cj\n        }\n        c[j] = cj\n      }, true)\n      return maxc\n    }\n\n    /**\n     * Calculate the norm L2 for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormTwo (x) {\n      // norm(x) = sqrt( max eigenvalue of A*.A)\n      const sizeX = x.size()\n      if (sizeX[0] !== sizeX[1]) {\n        throw new RangeError('Invalid matrix dimensions')\n      }\n      const tx = ctranspose(x)\n      const squaredX = multiply(tx, x)\n      const eigenVals = eigs(squaredX).values.toArray()\n      const rho = eigenVals[eigenVals.length - 1]\n      return abs(sqrt(rho))\n    }\n\n    /**\n     * Calculate the infinity norm for a matrix\n     * @param {Matrix} x\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNormInfinity (x) {\n      // norm(x) = the largest row sum\n      const r = []\n      // result\n      let maxr = 0\n      // skip zeros since abs(0) == 0\n      x.forEach(function (value, index) {\n        const i = index[0]\n        const ri = add(r[i] || 0, abs(value))\n        if (larger(ri, maxr)) {\n          maxr = ri\n        }\n        r[i] = ri\n      }, true)\n      return maxr\n    }\n\n    /**\n     * Calculate the norm for a 2D Matrix (M*N)\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _matrixNorm (x, p) {\n      // check p\n      if (p === 1) {\n        return _matrixNormOne(x)\n      }\n      if (p === Number.POSITIVE_INFINITY || p === 'inf') {\n        return _matrixNormInfinity(x)\n      }\n      if (p === 'fro') {\n        return _matrixNormFrobenius(x)\n      }\n      if (p === 2) {\n        return _matrixNormTwo(x)\n      } // invalid parameter value\n\n      throw new Error('Unsupported parameter value ' + p)\n    }\n\n    /**\n     * Calculate the norm for an array\n     * @param {Matrix} x\n     * @param {number | string} p\n     * @returns {number} Returns the norm\n     * @private\n     */\n    function _norm (x, p) {\n      // size\n      const sizeX = x.size()\n\n      // check if it is a vector\n      if (sizeX.length === 1) {\n        return _vectorNorm(x, p)\n      }\n      // MxN matrix\n      if (sizeX.length === 2) {\n        if (sizeX[0] && sizeX[1]) {\n          return _matrixNorm(x, p)\n        } else {\n          throw new RangeError('Invalid matrix dimensions')\n        }\n      }\n    }\n  }\n)\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'dot'\nconst dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size']\n\nexport const createDot = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, multiplyScalar, conj, size }) => {\n  /**\n   * Calculate the dot product of two vectors. The dot product of\n   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:\n   *\n   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn\n   *\n   * Syntax:\n   *\n   *    math.dot(x, y)\n   *\n   * Examples:\n   *\n   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15\n   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15\n   *\n   * See also:\n   *\n   *    multiply, cross\n   *\n   * @param  {Array | Matrix} x     First vector\n   * @param  {Array | Matrix} y     Second vector\n   * @return {number}               Returns the dot product of `x` and `y`\n   */\n  return typed(name, {\n    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,\n    'SparseMatrix, SparseMatrix': _sparseDot\n  })\n\n  function _validateDim (x, y) {\n    const xSize = _size(x)\n    const ySize = _size(y)\n    let xLen, yLen\n\n    if (xSize.length === 1) {\n      xLen = xSize[0]\n    } else if (xSize.length === 2 && xSize[1] === 1) {\n      xLen = xSize[0]\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')')\n    }\n\n    if (ySize.length === 1) {\n      yLen = ySize[0]\n    } else if (ySize.length === 2 && ySize[1] === 1) {\n      yLen = ySize[0]\n    } else {\n      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')')\n    }\n\n    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')')\n    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors')\n\n    return xLen\n  }\n\n  function _denseDot (a, b) {\n    const N = _validateDim(a, b)\n\n    const adata = isMatrix(a) ? a._data : a\n    const adt = isMatrix(a) ? a._datatype || a.getDataType() : undefined\n\n    const bdata = isMatrix(b) ? b._data : b\n    const bdt = isMatrix(b) ? b._datatype || b.getDataType() : undefined\n\n    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)\n    const aIsColumn = _size(a).length === 2\n    const bIsColumn = _size(b).length === 2\n\n    let add = addScalar\n    let mul = multiplyScalar\n\n    // process data types\n    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {\n      const dt = adt\n      // find signatures that matches (dt, dt)\n      add = typed.find(addScalar, [dt, dt])\n      mul = typed.find(multiplyScalar, [dt, dt])\n    }\n\n    // both vectors 1-dimensional\n    if (!aIsColumn && !bIsColumn) {\n      let c = mul(conj(adata[0]), bdata[0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i]))\n      }\n      return c\n    }\n\n    // a is 1-dim, b is column\n    if (!aIsColumn && bIsColumn) {\n      let c = mul(conj(adata[0]), bdata[0][0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i]), bdata[i][0]))\n      }\n      return c\n    }\n\n    // a is column, b is 1-dim\n    if (aIsColumn && !bIsColumn) {\n      let c = mul(conj(adata[0][0]), bdata[0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i][0]), bdata[i]))\n      }\n      return c\n    }\n\n    // both vectors are column\n    if (aIsColumn && bIsColumn) {\n      let c = mul(conj(adata[0][0]), bdata[0][0])\n      for (let i = 1; i < N; i++) {\n        c = add(c, mul(conj(adata[i][0]), bdata[i][0]))\n      }\n      return c\n    }\n  }\n\n  function _sparseDot (x, y) {\n    _validateDim(x, y)\n\n    const xindex = x._index\n    const xvalues = x._values\n\n    const yindex = y._index\n    const yvalues = y._values\n\n    // TODO optimize add & mul using datatype\n    let c = 0\n    const add = addScalar\n    const mul = multiplyScalar\n\n    let i = 0\n    let j = 0\n    while (i < xindex.length && j < yindex.length) {\n      const I = xindex[i]\n      const J = yindex[j]\n\n      if (I < J) {\n        i++\n        continue\n      }\n      if (I > J) {\n        j++\n        continue\n      }\n      if (I === J) {\n        c = add(c, mul(xvalues[i], yvalues[j]))\n        i++\n        j++\n      }\n    }\n\n    return c\n  }\n\n  // TODO remove this once #1771 is fixed\n  function _size (x) {\n    return isMatrix(x) ? x.size() : size(x)\n  }\n})\n","import { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'trace'\nconst dependencies = ['typed', 'matrix', 'add']\n\nexport const createTrace = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, add }) => {\n  /**\n   * Calculate the trace of a matrix: the sum of the elements on the main\n   * diagonal of a square matrix.\n   *\n   * Syntax:\n   *\n   *    math.trace(x)\n   *\n   * Examples:\n   *\n   *    math.trace([[1, 2], [3, 4]]) // returns 5\n   *\n   *    const A = [\n   *      [1, 2, 3],\n   *      [-1, 2, 3],\n   *      [2, 0, 3]\n   *    ]\n   *    math.trace(A) // returns 6\n   *\n   * See also:\n   *\n   *    diag\n   *\n   * @param {Array | Matrix} x  A matrix\n   *\n   * @return {number} The trace of `x`\n   */\n  return typed('trace', {\n    Array: function _arrayTrace (x) {\n      // use dense matrix implementation\n      return _denseTrace(matrix(x))\n    },\n\n    SparseMatrix: _sparseTrace,\n\n    DenseMatrix: _denseTrace,\n\n    any: clone\n  })\n\n  function _denseTrace (m) {\n    // matrix size & data\n    const size = m._size\n    const data = m._data\n\n    // process dimensions\n    switch (size.length) {\n      case 1:\n        // vector\n        if (size[0] === 1) {\n          // return data[0]\n          return clone(data[0])\n        }\n        throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n      case 2:\n      {\n        // two dimensional\n        const rows = size[0]\n        const cols = size[1]\n        if (rows === cols) {\n          // calulate sum\n          let sum = 0\n          // loop diagonal\n          for (let i = 0; i < rows; i++) { sum = add(sum, data[i][i]) }\n          // return trace\n          return sum\n        } else {\n          throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n        }\n      }\n      default:\n        // multi dimensional\n        throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')')\n    }\n  }\n\n  function _sparseTrace (m) {\n    // matrix arrays\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    const size = m._size\n    // check dimensions\n    const rows = size[0]\n    const columns = size[1]\n    // matrix must be square\n    if (rows === columns) {\n      // calulate sum\n      let sum = 0\n      // check we have data (avoid looping columns)\n      if (values.length > 0) {\n        // loop columns\n        for (let j = 0; j < columns; j++) {\n          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n          const k0 = ptr[j]\n          const k1 = ptr[j + 1]\n          // loop k within [k0, k1[\n          for (let k = k0; k < k1; k++) {\n            // row index\n            const i = index[k]\n            // check row\n            if (i === j) {\n              // accumulate value\n              sum = add(sum, values[k])\n              // exit loop\n              break\n            }\n            if (i > j) {\n              // exit loop, no value on the diagonal for column j\n              break\n            }\n          }\n        }\n      }\n      // return trace\n      return sum\n    }\n    throw new RangeError('Matrix must be square (size: ' + format(size) + ')')\n  }\n})\n","import { isBigNumber, isMatrix, isArray } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'index'\nconst dependencies = ['typed', 'Index']\n\nexport const createIndex = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index }) => {\n  /**\n   * Create an index. An Index can store ranges having start, step, and end\n   * for multiple dimensions.\n   * Matrix.get, Matrix.set, and math.subset accept an Index as input.\n   *\n   * Syntax:\n   *\n   *     math.index(range1, range2, ...)\n   *\n   * Where each range can be any of:\n   *\n   * - A number\n   * - A string for getting/setting an object property\n   * - An instance of `Range`\n   * - A one-dimensional Array or a Matrix with numbers or booleans\n   *\n   * Indexes must be zero-based, integer numbers.\n   *\n   * Examples:\n   *\n   *    const b = [1, 2, 3, 4, 5]\n   *    math.subset(b, math.index([1, 2, 3]))                         // returns [2, 3, 4]\n   *    math.subset(b, math.index([false, true, true, true, false]))  // returns [2, 3, 4]\n   *\n   *    const a = math.matrix([[1, 2], [3, 4]])\n   *    a.subset(math.index(0, 1))             // returns 2\n   *    a.subset(math.index(0, [false, true])) // returns 2\n   *\n   * See also:\n   *\n   *    bignumber, boolean, complex, matrix, number, string, unit\n   *\n   * @param {...*} ranges   Zero or more ranges or numbers.\n   * @return {Index}        Returns the created index\n   */\n  return typed(name, {\n    '...number | string | BigNumber | Range | Array | Matrix': function (args) {\n      const ranges = args.map(function (arg) {\n        if (isBigNumber(arg)) {\n          return arg.toNumber() // convert BigNumber to Number\n        } else if (isArray(arg) || isMatrix(arg)) {\n          return arg.map(function (elem) {\n            // convert BigNumber to Number\n            return isBigNumber(elem) ? elem.toNumber() : elem\n          })\n        } else {\n          return arg\n        }\n      })\n\n      const res = new Index()\n      Index.apply(res, ranges)\n      return res\n    }\n  })\n})\n","// Reserved keywords not allowed to use in the parser\nexport const keywords = new Set([\n  'end'\n])\n","import { isNode } from '../../utils/is.js'\n\nimport { keywords } from '../keywords.js'\nimport { deepStrictEqual } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMap } from '../../utils/map.js'\n\nconst name = 'Node'\nconst dependencies = ['mathWithTransform']\n\nexport const createNode = /* #__PURE__ */ factory(name, dependencies, ({ mathWithTransform }) => {\n  /**\n   * Validate the symbol names of a scope.\n   * Throws an error when the scope contains an illegal symbol.\n   * @param {Object} scope\n   */\n  function _validateScope (scope) {\n    for (const symbol of [...keywords]) {\n      if (scope.has(symbol)) {\n        throw new Error('Scope contains an illegal symbol, \"' + symbol + '\" is a reserved keyword')\n      }\n    }\n  }\n\n  class Node {\n    get type () { return 'Node' }\n    get isNode () { return true }\n\n    /**\n     * Evaluate the node\n     * @param {Object} [scope]  Scope to read/write variables\n     * @return {*}              Returns the result\n     */\n    evaluate (scope) {\n      return this.compile().evaluate(scope)\n    }\n\n    /**\n     * Compile the node into an optimized, evauatable JavaScript function\n     * @return {{evaluate: function([Object])}} object\n     *                Returns an object with a function 'evaluate',\n     *                which can be invoked as expr.evaluate([scope: Object]),\n     *                where scope is an optional object with\n     *                variables.\n     */\n    compile () {\n      const expr = this._compile(mathWithTransform, {})\n      const args = {}\n      const context = null\n\n      function evaluate (scope) {\n        const s = createMap(scope)\n        _validateScope(s)\n        return expr(s, args, context)\n      }\n\n      return {\n        evaluate\n      }\n    }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      throw new Error('Method _compile must be implemented by type ' + this.type)\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      // must be implemented by each of the Node implementations\n      throw new Error('Cannot run forEach on a Node interface')\n    }\n\n    /**\n     * Create a new Node whose children are the results of calling the\n     * provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {OperatorNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      // must be implemented by each of the Node implementations\n      throw new Error('Cannot run map on a Node interface')\n    }\n\n    /**\n     * Validate whether an object is a Node, for use with map\n     * @param {Node} node\n     * @returns {Node} Returns the input if it's a node, else throws an Error\n     * @protected\n     */\n    _ifNode (node) {\n      if (!isNode(node)) {\n        throw new TypeError('Callback function must return a Node')\n      }\n      return node\n    }\n\n    /**\n     * Recursively traverse all nodes in a node tree. Executes given callback for\n     * this node and each of its child nodes.\n     * @param {function(node: Node, path: string, parent: Node)} callback\n     *          A callback called for every node in the node tree.\n     */\n    traverse (callback) {\n      // execute callback for itself\n      // eslint-disable-next-line\n      callback(this, null, null)\n\n      // recursively traverse over all children of a node\n      function _traverse (node, callback) {\n        node.forEach(function (child, path, parent) {\n          callback(child, path, parent)\n          _traverse(child, callback)\n        })\n      }\n\n      _traverse(this, callback)\n    }\n\n    /**\n     * Recursively transform a node tree via a transform function.\n     *\n     * For example, to replace all nodes of type SymbolNode having name 'x' with\n     * a ConstantNode with value 2:\n     *\n     *     const res = Node.transform(function (node, path, parent) {\n     *       if (node && node.isSymbolNode) && (node.name === 'x')) {\n     *         return new ConstantNode(2)\n     *       }\n     *       else {\n     *         return node\n     *       }\n     *     })\n     *\n     * @param {function(node: Node, path: string, parent: Node) : Node} callback\n     *          A mapping function accepting a node, and returning\n     *          a replacement for the node or the original node. The \"signature\"\n     *          of the callback must be:\n     *          callback(node: Node, index: string, parent: Node) : Node\n     * @return {Node} Returns the original node or its replacement\n     */\n    transform (callback) {\n      function _transform (child, path, parent) {\n        const replacement = callback(child, path, parent)\n\n        if (replacement !== child) {\n          // stop iterating when the node is replaced\n          return replacement\n        }\n\n        return child.map(_transform)\n      }\n\n      return _transform(this, null, null)\n    }\n\n    /**\n     * Find any node in the node tree matching given filter function. For\n     * example, to find all nodes of type SymbolNode having name 'x':\n     *\n     *     const results = Node.filter(function (node) {\n     *       return (node && node.isSymbolNode) && (node.name === 'x')\n     *     })\n     *\n     * @param {function(node: Node, path: string, parent: Node) : Node} callback\n     *            A test function returning true when a node matches, and false\n     *            otherwise. Function signature:\n     *            callback(node: Node, index: string, parent: Node) : boolean\n     * @return {Node[]} nodes\n     *            An array with nodes matching given filter criteria\n     */\n    filter (callback) {\n      const nodes = []\n\n      this.traverse(function (node, path, parent) {\n        if (callback(node, path, parent)) {\n          nodes.push(node)\n        }\n      })\n\n      return nodes\n    }\n\n    /**\n     * Create a shallow clone of this node\n     * @return {Node}\n     */\n    clone () {\n      // must be implemented by each of the Node implementations\n      throw new Error('Cannot clone a Node interface')\n    }\n\n    /**\n     * Create a deep clone of this node\n     * @return {Node}\n     */\n    cloneDeep () {\n      return this.map(function (node) {\n        return node.cloneDeep()\n      })\n    }\n\n    /**\n     * Deep compare this node with another node.\n     * @param {Node} other\n     * @return {boolean} Returns true when both nodes are of the same type and\n     *                   contain the same values (as do their childs)\n     */\n    equals (other) {\n      return other\n        ? this.type === other.type && deepStrictEqual(this, other)\n        : false\n    }\n\n    /**\n     * Get string representation. (wrapper function)\n     *\n     * This function can get an object of the following form:\n     * {\n     *    handler: //This can be a callback function of the form\n     *             // \"function callback(node, options)\"or\n     *             // a map that maps function names (used in FunctionNodes)\n     *             // to callbacks\n     *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n     * }\n     *\n     * @param {Object} [options]\n     * @return {string}\n     */\n    toString (options) {\n      const customString = this._getCustomString(options)\n\n      if (typeof customString !== 'undefined') {\n        return customString\n      }\n\n      return this._toString(options)\n    }\n\n    /**\n     * Internal function to generate the string output.\n     * This has to be implemented by every Node\n     *\n     * @throws {Error}\n     */\n    _toString () {\n      // must be implemented by each of the Node implementations\n      throw new Error('_toString not implemented for ' + this.type)\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * Both .toJSON() and the static .fromJSON(json) should be implemented by all\n     * implementations of Node\n     * @returns {Object}\n     */\n    toJSON () {\n      throw new Error(\n        'Cannot serialize object: toJSON not implemented by ' + this.type)\n    }\n\n    /**\n     * Get HTML representation. (wrapper function)\n     *\n     * This function can get an object of the following form:\n     * {\n     *    handler: //This can be a callback function of the form\n     *             // \"function callback(node, options)\" or\n     *             // a map that maps function names (used in FunctionNodes)\n     *             // to callbacks\n     *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n     * }\n     *\n     * @param {Object} [options]\n     * @return {string}\n     */\n    toHTML (options) {\n      const customString = this._getCustomString(options)\n\n      if (typeof customString !== 'undefined') {\n        return customString\n      }\n\n      return this._toHTML(options)\n    }\n\n    /**\n     * Internal function to generate the HTML output.\n     * This has to be implemented by every Node\n     *\n     * @throws {Error}\n     */\n    _toHTML () {\n      // must be implemented by each of the Node implementations\n      throw new Error('_toHTML not implemented for ' + this.type)\n    }\n\n    /**\n     * Get LaTeX representation. (wrapper function)\n     *\n     * This function can get an object of the following form:\n     * {\n     *    handler: //This can be a callback function of the form\n     *             // \"function callback(node, options)\"or\n     *             // a map that maps function names (used in FunctionNodes)\n     *             // to callbacks\n     *    parenthesis: \"keep\" //the parenthesis option (This is optional)\n     * }\n     *\n     * @param {Object} [options]\n     * @return {string}\n     */\n    toTex (options) {\n      const customString = this._getCustomString(options)\n\n      if (typeof customString !== 'undefined') {\n        return customString\n      }\n\n      return this._toTex(options)\n    }\n\n    /**\n     * Internal function to generate the LaTeX output.\n     * This has to be implemented by every Node\n     *\n     * @param {Object} [options]\n     * @throws {Error}\n     */\n    _toTex (options) {\n      // must be implemented by each of the Node implementations\n      throw new Error('_toTex not implemented for ' + this.type)\n    }\n\n    /**\n     * Helper used by `to...` functions.\n     */\n    _getCustomString (options) {\n      if (options && typeof options === 'object') {\n        switch (typeof options.handler) {\n          case 'object':\n          case 'undefined':\n            return\n          case 'function':\n            return options.handler(this, options)\n          default:\n            throw new TypeError('Object or function expected as callback')\n        }\n      }\n    }\n\n    /**\n     * Get identifier.\n     * @return {string}\n     */\n    getIdentifier () {\n      return this.type\n    }\n\n    /**\n     * Get the content of the current Node.\n     * @return {Node} node\n     **/\n    getContent () {\n      return this\n    }\n  }\n\n  return Node\n}, { isClass: true, isNode: true })\n","function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}\nexport { _typeof as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperty(e, r, t) {\n  return (r = toPropertyKey(r)) in e ? Object.defineProperty(e, r, {\n    value: t,\n    enumerable: !0,\n    configurable: !0,\n    writable: !0\n  }) : e[r] = t, e;\n}\nexport { _defineProperty as default };","import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nfunction toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : i + \"\";\n}\nexport { toPropertyKey as default };","import _typeof from \"./typeof.js\";\nfunction toPrimitive(t, r) {\n  if (\"object\" != _typeof(t) || !t) return t;\n  var e = t[Symbol.toPrimitive];\n  if (void 0 !== e) {\n    var i = e.call(t, r || \"default\");\n    if (\"object\" != _typeof(i)) return i;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (\"string\" === r ? String : Number)(t);\n}\nexport { toPrimitive as default };","import { IndexError } from '../../../error/IndexError.js'\n\n/**\n * Transform zero-based indices to one-based indices in errors\n * @param {Error} err\n * @returns {Error | IndexError} Returns the transformed error\n */\nexport function errorTransform (err) {\n  if (err && err.isIndexError) {\n    return new IndexError(\n      err.index + 1,\n      err.min + 1,\n      err.max !== undefined ? err.max + 1 : undefined)\n  }\n\n  return err\n}\n","import { errorTransform } from '../../transform/utils/errorTransform.js'\nimport { getSafeProperty } from '../../../utils/customs.js'\n\nexport function accessFactory ({ subset }) {\n  /**\n   * Retrieve part of an object:\n   *\n   * - Retrieve a property from an object\n   * - Retrieve a part of a string\n   * - Retrieve a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @return {Object | Array | Matrix | string} Returns the subset\n   */\n  return function access (object, index) {\n    try {\n      if (Array.isArray(object)) {\n        return subset(object, index)\n      } else if (object && typeof object.subset === 'function') { // Matrix\n        return object.subset(index)\n      } else if (typeof object === 'string') {\n        // TODO: move getStringSubset into a separate util file, use that\n        return subset(object, index)\n      } else if (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw new TypeError('Cannot apply a numeric index as object property')\n        }\n\n        return getSafeProperty(object, index.getObjectProperty())\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object')\n      }\n    } catch (err) {\n      throw errorTransform(err)\n    }\n  }\n}\n","import {\n  isAccessorNode,\n  isArrayNode,\n  isConstantNode,\n  isFunctionNode,\n  isIndexNode,\n  isNode,\n  isObjectNode,\n  isParenthesisNode,\n  isSymbolNode\n} from '../../utils/is.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { accessFactory } from './utils/access.js'\n\nconst name = 'AccessorNode'\nconst dependencies = [\n  'subset',\n  'Node'\n]\n\nexport const createAccessorNode = /* #__PURE__ */ factory(name, dependencies, ({ subset, Node }) => {\n  const access = accessFactory({ subset })\n\n  /**\n   * Are parenthesis needed?\n   * @private\n   */\n  function needParenthesis (node) {\n    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?\n    return !(\n      isAccessorNode(node) ||\n        isArrayNode(node) ||\n        isConstantNode(node) ||\n        isFunctionNode(node) ||\n        isObjectNode(node) ||\n        isParenthesisNode(node) ||\n        isSymbolNode(node))\n  }\n\n  class AccessorNode extends Node {\n    /**\n     * @constructor AccessorNode\n     * @extends {Node}\n     * Access an object property or get a matrix subset\n     *\n     * @param {Node} object                 The object from which to retrieve\n     *                                      a property or subset.\n     * @param {IndexNode} index             IndexNode containing ranges\n     */\n    constructor (object, index) {\n      super()\n      if (!isNode(object)) {\n        throw new TypeError('Node expected for parameter \"object\"')\n      }\n      if (!isIndexNode(index)) {\n        throw new TypeError('IndexNode expected for parameter \"index\"')\n      }\n\n      this.object = object\n      this.index = index\n    }\n\n    // readonly property name\n    get name () {\n      if (this.index) {\n        return (this.index.isObjectProperty())\n          ? this.index.getObjectProperty()\n          : ''\n      } else {\n        return this.object.name || ''\n      }\n    }\n\n    static name = name\n    get type () { return name }\n    get isAccessorNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalObject = this.object._compile(math, argNames)\n      const evalIndex = this.index._compile(math, argNames)\n\n      if (this.index.isObjectProperty()) {\n        const prop = this.index.getObjectProperty()\n        return function evalAccessorNode (scope, args, context) {\n          // get a property from an object evaluated using the scope.\n          return getSafeProperty(evalObject(scope, args, context), prop)\n        }\n      } else {\n        return function evalAccessorNode (scope, args, context) {\n          const object = evalObject(scope, args, context)\n          // we pass just object here instead of context:\n          const index = evalIndex(scope, args, object)\n          return access(object, index)\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.object, 'object', this)\n      callback(this.index, 'index', this)\n    }\n\n    /**\n     * Create a new AccessorNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {AccessorNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      return new AccessorNode(\n        this._ifNode(callback(this.object, 'object', this)),\n        this._ifNode(callback(this.index, 'index', this))\n      )\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {AccessorNode}\n     */\n    clone () {\n      return new AccessorNode(this.object, this.index)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toString (options) {\n      let object = this.object.toString(options)\n      if (needParenthesis(this.object)) {\n        object = '(' + object + ')'\n      }\n\n      return object + this.index.toString(options)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toHTML (options) {\n      let object = this.object.toHTML(options)\n      if (needParenthesis(this.object)) {\n        object =\n          '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          object +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n\n      return object + this.index.toHTML(options)\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toTex (options) {\n      let object = this.object.toTex(options)\n      if (needParenthesis(this.object)) {\n        object = '\\\\left(\\' + object + \\'\\\\right)'\n      }\n\n      return object + this.index.toTex(options)\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        object: this.object,\n        index: this.index\n      }\n    }\n\n    /**\n     * Instantiate an AccessorNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"AccessorNode\", object: ..., index: ...}`,\n     *     where mathjs is optional\n     * @returns {AccessorNode}\n     */\n    static fromJSON (json) {\n      return new AccessorNode(json.object, json.index)\n    }\n  }\n\n  return AccessorNode\n}, { isClass: true, isNode: true })\n","import { isArrayNode, isNode } from '../../utils/is.js'\nimport { map } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ArrayNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createArrayNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  class ArrayNode extends Node {\n    /**\n     * @constructor ArrayNode\n     * @extends {Node}\n     * Holds an 1-dimensional array with items\n     * @param {Node[]} [items]   1 dimensional array with items\n     */\n    constructor (items) {\n      super()\n      this.items = items || []\n\n      // validate input\n      if (!Array.isArray(this.items) || !this.items.every(isNode)) {\n        throw new TypeError('Array containing Nodes expected')\n      }\n    }\n\n    static name = name\n    get type () { return name }\n    get isArrayNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalItems = map(this.items, function (item) {\n        return item._compile(math, argNames)\n      })\n\n      const asMatrix = (math.config.matrix !== 'Array')\n      if (asMatrix) {\n        const matrix = math.matrix\n        return function evalArrayNode (scope, args, context) {\n          return matrix(map(evalItems, function (evalItem) {\n            return evalItem(scope, args, context)\n          }))\n        }\n      } else {\n        return function evalArrayNode (scope, args, context) {\n          return map(evalItems, function (evalItem) {\n            return evalItem(scope, args, context)\n          })\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      for (let i = 0; i < this.items.length; i++) {\n        const node = this.items[i]\n        callback(node, 'items[' + i + ']', this)\n      }\n    }\n\n    /**\n     * Create a new ArrayNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {ArrayNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const items = []\n      for (let i = 0; i < this.items.length; i++) {\n        items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this))\n      }\n      return new ArrayNode(items)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ArrayNode}\n     */\n    clone () {\n      return new ArrayNode(this.items.slice(0))\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toString (options) {\n      const items = this.items.map(function (node) {\n        return node.toString(options)\n      })\n      return '[' + items.join(', ') + ']'\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        items: this.items\n      }\n    }\n\n    /**\n     * Instantiate an ArrayNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"ArrayNode\", items: [...]}`,\n     *                       where mathjs is optional\n     * @returns {ArrayNode}\n     */\n    static fromJSON (json) {\n      return new ArrayNode(json.items)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML (options) {\n      const items = this.items.map(function (node) {\n        return node.toHTML(options)\n      })\n      return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' +\n        items.join('<span class=\"math-separator\">,</span>') +\n        '<span class=\"math-parenthesis math-square-parenthesis\">]</span>'\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      function itemsToTex (items, nested) {\n        const mixedItems = items.some(isArrayNode) && !items.every(isArrayNode)\n        const itemsFormRow = nested || mixedItems\n        const itemSep = itemsFormRow ? '&' : '\\\\\\\\'\n        const itemsTex = items\n          .map(function (node) {\n            if (node.items) {\n              return itemsToTex(node.items, !nested)\n            } else {\n              return node.toTex(options)\n            }\n          })\n          .join(itemSep)\n        return mixedItems || !itemsFormRow || (itemsFormRow && !nested)\n          ? '\\\\begin{bmatrix}' + itemsTex + '\\\\end{bmatrix}'\n          : itemsTex\n      }\n      return itemsToTex(this.items, false)\n    }\n  }\n\n  return ArrayNode\n}, { isClass: true, isNode: true })\n","// list of identifiers of nodes in order of their precedence\n// also contains information about left/right associativity\n// and which other operator the operator is associative with\n// Example:\n// addition is associative with addition and subtraction, because:\n// (a+b)+c=a+(b+c)\n// (a+b)-c=a+(b-c)\n//\n// postfix operators are left associative, prefix operators\n// are right associative\n//\n// It's also possible to set the following properties:\n// latexParens: if set to false, this node doesn't need to be enclosed\n//              in parentheses when using LaTeX\n// latexLeftParens: if set to false, this !OperatorNode's!\n//                  left argument doesn't need to be enclosed\n//                  in parentheses\n// latexRightParens: the same for the right argument\nimport { hasOwnProperty } from '../utils/object.js'\nimport { isConstantNode, isParenthesisNode, rule2Node } from '../utils/is.js'\n\nexport const properties = [\n  { // assignment\n    AssignmentNode: {},\n    FunctionAssignmentNode: {}\n  },\n  { // conditional expression\n    ConditionalNode: {\n      latexLeftParens: false,\n      latexRightParens: false,\n      latexParens: false\n      // conditionals don't need parentheses in LaTeX because\n      // they are 2 dimensional\n    }\n  },\n  { // logical or\n    'OperatorNode:or': {\n      op: 'or',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // logical xor\n    'OperatorNode:xor': {\n      op: 'xor',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // logical and\n    'OperatorNode:and': {\n      op: 'and',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise or\n    'OperatorNode:bitOr': {\n      op: '|',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise xor\n    'OperatorNode:bitXor': {\n      op: '^|',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitwise and\n    'OperatorNode:bitAnd': {\n      op: '&',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // relational operators\n    'OperatorNode:equal': {\n      op: '==',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:unequal': {\n      op: '!=',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:smaller': {\n      op: '<',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:larger': {\n      op: '>',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:smallerEq': {\n      op: '<=',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:largerEq': {\n      op: '>=',\n      associativity: 'left',\n      associativeWith: []\n    },\n    RelationalNode: {\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // bitshift operators\n    'OperatorNode:leftShift': {\n      op: '<<',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:rightArithShift': {\n      op: '>>',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:rightLogShift': {\n      op: '>>>',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // unit conversion\n    'OperatorNode:to': {\n      op: 'to',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // range\n    RangeNode: {}\n  },\n  { // addition, subtraction\n    'OperatorNode:add': {\n      op: '+',\n      associativity: 'left',\n      associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']\n    },\n    'OperatorNode:subtract': {\n      op: '-',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // multiply, divide, modulus\n    'OperatorNode:multiply': {\n      op: '*',\n      associativity: 'left',\n      associativeWith: [\n        'OperatorNode:multiply',\n        'OperatorNode:divide',\n        'Operator:dotMultiply',\n        'Operator:dotDivide'\n      ]\n    },\n    'OperatorNode:divide': {\n      op: '/',\n      associativity: 'left',\n      associativeWith: [],\n      latexLeftParens: false,\n      latexRightParens: false,\n      latexParens: false\n      // fractions don't require parentheses because\n      // they're 2 dimensional, so parens aren't needed\n      // in LaTeX\n    },\n    'OperatorNode:dotMultiply': {\n      op: '.*',\n      associativity: 'left',\n      associativeWith: [\n        'OperatorNode:multiply',\n        'OperatorNode:divide',\n        'OperatorNode:dotMultiply',\n        'OperatorNode:doDivide'\n      ]\n    },\n    'OperatorNode:dotDivide': {\n      op: './',\n      associativity: 'left',\n      associativeWith: []\n    },\n    'OperatorNode:mod': {\n      op: 'mod',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // Repeat multiplication for implicit multiplication\n    'OperatorNode:multiply': {\n      associativity: 'left',\n      associativeWith: [\n        'OperatorNode:multiply',\n        'OperatorNode:divide',\n        'Operator:dotMultiply',\n        'Operator:dotDivide'\n      ]\n    }\n  },\n  { // unary prefix operators\n    'OperatorNode:unaryPlus': {\n      op: '+',\n      associativity: 'right'\n    },\n    'OperatorNode:unaryMinus': {\n      op: '-',\n      associativity: 'right'\n    },\n    'OperatorNode:bitNot': {\n      op: '~',\n      associativity: 'right'\n    },\n    'OperatorNode:not': {\n      op: 'not',\n      associativity: 'right'\n    }\n  },\n  { // exponentiation\n    'OperatorNode:pow': {\n      op: '^',\n      associativity: 'right',\n      associativeWith: [],\n      latexRightParens: false\n      // the exponent doesn't need parentheses in\n      // LaTeX because it's 2 dimensional\n      // (it's on top)\n    },\n    'OperatorNode:dotPow': {\n      op: '.^',\n      associativity: 'right',\n      associativeWith: []\n    }\n  },\n  { // nullish coalescing\n    'OperatorNode:nullish': {\n      op: '??',\n      associativity: 'left',\n      associativeWith: []\n    }\n  },\n  { // factorial\n    'OperatorNode:factorial': {\n      op: '!',\n      associativity: 'left'\n    }\n  },\n  { // matrix transpose\n    'OperatorNode:ctranspose': {\n      op: \"'\",\n      associativity: 'left'\n    }\n  }\n]\n\n/**\n * Returns the first non-parenthesis internal node, but only\n * when the 'parenthesis' option is unset or auto.\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {Node}\n */\nfunction unwrapParen (_node, parenthesis) {\n  if (!parenthesis || parenthesis !== 'auto') return _node\n  let node = _node\n  while (isParenthesisNode(node)) node = node.content\n  return node\n}\n\n/**\n * Get the precedence of a Node.\n * Higher number for higher precedence, starting with 0.\n * Returns null if the precedence is undefined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @param {string} implicit\n * @param {Node} parent (for determining context for implicit multiplication)\n * @return {number | null}\n */\nexport function getPrecedence (_node, parenthesis, implicit, parent) {\n  let node = _node\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent()\n  }\n  const identifier = node.getIdentifier()\n  let precedence = null\n  for (let i = 0; i < properties.length; i++) {\n    if (identifier in properties[i]) {\n      precedence = i\n      break\n    }\n  }\n  // Bump up precedence of implicit multiplication, except when preceded\n  // by a \"Rule 2\" fraction ( [unaryOp]constant / constant )\n  if (identifier === 'OperatorNode:multiply' && node.implicit &&\n      implicit !== 'show') {\n    const leftArg = unwrapParen(node.args[0], parenthesis)\n    if (!(isConstantNode(leftArg) && parent &&\n          parent.getIdentifier() === 'OperatorNode:divide' &&\n          rule2Node(unwrapParen(parent.args[0], parenthesis))) &&\n        !(leftArg.getIdentifier() === 'OperatorNode:divide' &&\n          rule2Node(unwrapParen(leftArg.args[0], parenthesis)) &&\n          isConstantNode(unwrapParen(leftArg.args[1])))\n    ) {\n      precedence += 1\n    }\n  }\n  return precedence\n}\n\n/**\n * Get the associativity of an operator (left or right).\n * Returns a string containing 'left' or 'right' or null if\n * the associativity is not defined.\n *\n * @param {Node} _node\n * @param {string} parenthesis\n * @return {string|null}\n * @throws {Error}\n */\nexport function getAssociativity (_node, parenthesis) {\n  let node = _node\n  if (parenthesis !== 'keep') {\n    // ParenthesisNodes are only ignored when not in 'keep' mode\n    node = _node.getContent()\n  }\n  const identifier = node.getIdentifier()\n  const index = getPrecedence(node, parenthesis)\n  if (index === null) {\n    // node isn't in the list\n    return null\n  }\n  const property = properties[index][identifier]\n\n  if (hasOwnProperty(property, 'associativity')) {\n    if (property.associativity === 'left') {\n      return 'left'\n    }\n    if (property.associativity === 'right') {\n      return 'right'\n    }\n    // associativity is invalid\n    throw Error('\\'' + identifier + '\\' has the invalid associativity \\'' +\n                property.associativity + '\\'.')\n  }\n\n  // associativity is undefined\n  return null\n}\n\n/**\n * Check if an operator is associative with another operator.\n * Returns either true or false or null if not defined.\n *\n * @param {Node} nodeA\n * @param {Node} nodeB\n * @param {string} parenthesis\n * @return {boolean | null}\n */\nexport function isAssociativeWith (nodeA, nodeB, parenthesis) {\n  // ParenthesisNodes are only ignored when not in 'keep' mode\n  const a = (parenthesis !== 'keep') ? nodeA.getContent() : nodeA\n  const b = (parenthesis !== 'keep') ? nodeA.getContent() : nodeB\n  const identifierA = a.getIdentifier()\n  const identifierB = b.getIdentifier()\n  const index = getPrecedence(a, parenthesis)\n  if (index === null) {\n    // node isn't in the list\n    return null\n  }\n  const property = properties[index][identifierA]\n\n  if (hasOwnProperty(property, 'associativeWith') &&\n      (property.associativeWith instanceof Array)) {\n    for (let i = 0; i < property.associativeWith.length; i++) {\n      if (property.associativeWith[i] === identifierB) {\n        return true\n      }\n    }\n    return false\n  }\n\n  // associativeWith is not defined\n  return null\n}\n\n/**\n * Get the operator associated with a function name.\n * Returns a string with the operator symbol, or null if the\n * input is not the name of a function associated with an\n * operator.\n *\n * @param {string} Function name\n * @return {string | null} Associated operator symbol, if any\n */\nexport function getOperator (fn) {\n  const identifier = 'OperatorNode:' + fn\n  for (const group of properties) {\n    if (identifier in group) {\n      return group[identifier].op\n    }\n  }\n  return null\n}\n","import { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js'\nimport { getSafeProperty, setSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { accessFactory } from './utils/access.js'\nimport { assignFactory } from './utils/assign.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'AssignmentNode'\nconst dependencies = [\n  'subset',\n  '?matrix', // FIXME: should not be needed at all, should be handled by subset\n  'Node'\n]\n\nexport const createAssignmentNode = /* #__PURE__ */ factory(name, dependencies, ({ subset, matrix, Node }) => {\n  const access = accessFactory({ subset })\n  const assign = assignFactory({ subset, matrix })\n\n  /*\n   * Is parenthesis needed?\n   * @param {node} node\n   * @param {string} [parenthesis='keep']\n   * @param {string} implicit\n   * @private\n   */\n  function needParenthesis (node, parenthesis, implicit) {\n    if (!parenthesis) {\n      parenthesis = 'keep'\n    }\n\n    const precedence = getPrecedence(node, parenthesis, implicit)\n    const exprPrecedence = getPrecedence(node.value, parenthesis, implicit)\n    return (parenthesis === 'all') ||\n      ((exprPrecedence !== null) && (exprPrecedence <= precedence))\n  }\n\n  class AssignmentNode extends Node {\n    /**\n     * @constructor AssignmentNode\n     * @extends {Node}\n     *\n     * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or\n     * replace a subset of a matrix like `A[2,2]=42`.\n     *\n     * Syntax:\n     *\n     *     new AssignmentNode(symbol, value)\n     *     new AssignmentNode(object, index, value)\n     *\n     * Usage:\n     *\n     *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))  // a=2\n     *    new AssignmentNode(new SymbolNode('a'),\n     *                       new IndexNode('b'),\n     *                       new ConstantNode(2))   // a.b=2\n     *    new AssignmentNode(new SymbolNode('a'),\n     *                       new IndexNode(1, 2),\n     *                       new ConstantNode(3))  // a[1,2]=3\n     *\n     * @param {SymbolNode | AccessorNode} object\n     *     Object on which to assign a value\n     * @param {IndexNode} [index=null]\n     *     Index, property name or matrix index. Optional. If not provided\n     *     and `object` is a SymbolNode, the property is assigned to the\n     *     global scope.\n     * @param {Node} value\n     *     The value to be assigned\n     */\n    constructor (object, index, value) {\n      super()\n      this.object = object\n      this.index = value ? index : null\n      this.value = value || index\n\n      // validate input\n      if (!isSymbolNode(object) && !isAccessorNode(object)) {\n        throw new TypeError('SymbolNode or AccessorNode expected as \"object\"')\n      }\n      if (isSymbolNode(object) && object.name === 'end') {\n        throw new Error('Cannot assign to symbol \"end\"')\n      }\n      if (this.index && !isIndexNode(this.index)) { // index is optional\n        throw new TypeError('IndexNode expected as \"index\"')\n      }\n      if (!isNode(this.value)) {\n        throw new TypeError('Node expected as \"value\"')\n      }\n    }\n\n    // class name for typing purposes:\n    static name = name\n\n    // readonly property name\n    get name () {\n      if (this.index) {\n        return (this.index.isObjectProperty())\n          ? this.index.getObjectProperty()\n          : ''\n      } else {\n        return this.object.name || ''\n      }\n    }\n\n    get type () { return name }\n    get isAssignmentNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalObject = this.object._compile(math, argNames)\n      const evalIndex = this.index ? this.index._compile(math, argNames) : null\n      const evalValue = this.value._compile(math, argNames)\n      const name = this.object.name\n\n      if (!this.index) {\n        // apply a variable to the scope, for example `a=2`\n        if (!isSymbolNode(this.object)) {\n          throw new TypeError('SymbolNode expected as object')\n        }\n\n        return function evalAssignmentNode (scope, args, context) {\n          const value = evalValue(scope, args, context)\n          scope.set(name, value)\n          return value\n        }\n      } else if (this.index.isObjectProperty()) {\n        // apply an object property for example `a.b=2`\n        const prop = this.index.getObjectProperty()\n\n        return function evalAssignmentNode (scope, args, context) {\n          const object = evalObject(scope, args, context)\n          const value = evalValue(scope, args, context)\n          setSafeProperty(object, prop, value)\n          return value\n        }\n      } else if (isSymbolNode(this.object)) {\n        // update a matrix subset, for example `a[2]=3`\n        return function evalAssignmentNode (scope, args, context) {\n          const childObject = evalObject(scope, args, context)\n          const value = evalValue(scope, args, context)\n          // Important:  we pass childObject instead of context:\n          const index = evalIndex(scope, args, childObject)\n          scope.set(name, assign(childObject, index, value))\n          return value\n        }\n      } else { // isAccessorNode(node.object) === true\n        // update a matrix subset, for example `a.b[2]=3`\n\n        // we will not use the compile function of the AccessorNode, but\n        // compile it ourselves here as we need the parent object of the\n        // AccessorNode:\n        // wee need to apply the updated object to parent object\n        const evalParentObject = this.object.object._compile(math, argNames)\n\n        if (this.object.index.isObjectProperty()) {\n          const parentProp = this.object.index.getObjectProperty()\n\n          return function evalAssignmentNode (scope, args, context) {\n            const parent = evalParentObject(scope, args, context)\n            const childObject = getSafeProperty(parent, parentProp)\n            // Important: we pass childObject instead of context:\n            const index = evalIndex(scope, args, childObject)\n            const value = evalValue(scope, args, context)\n            setSafeProperty(\n              parent, parentProp, assign(childObject, index, value))\n            return value\n          }\n        } else {\n          // if some parameters use the 'end' parameter, we need to calculate\n          // the size\n          const evalParentIndex = this.object.index._compile(math, argNames)\n\n          return function evalAssignmentNode (scope, args, context) {\n            const parent = evalParentObject(scope, args, context)\n            // Important: we pass parent instead of context:\n            const parentIndex = evalParentIndex(scope, args, parent)\n            const childObject = access(parent, parentIndex)\n            // Important:  we pass childObject instead of context\n            const index = evalIndex(scope, args, childObject)\n            const value = evalValue(scope, args, context)\n\n            assign(parent, parentIndex, assign(childObject, index, value))\n\n            return value\n          }\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.object, 'object', this)\n      if (this.index) {\n        callback(this.index, 'index', this)\n      }\n      callback(this.value, 'value', this)\n    }\n\n    /**\n     * Create a new AssignmentNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {AssignmentNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const object = this._ifNode(callback(this.object, 'object', this))\n      const index = this.index\n        ? this._ifNode(callback(this.index, 'index', this))\n        : null\n      const value = this._ifNode(callback(this.value, 'value', this))\n\n      return new AssignmentNode(object, index, value)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {AssignmentNode}\n     */\n    clone () {\n      return new AssignmentNode(this.object, this.index, this.value)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toString (options) {\n      const object = this.object.toString(options)\n      const index = this.index ? this.index.toString(options) : ''\n      let value = this.value.toString(options)\n      if (needParenthesis(\n        this, options && options.parenthesis, options && options.implicit)) {\n        value = '(' + value + ')'\n      }\n\n      return object + index + ' = ' + value\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        object: this.object,\n        index: this.index,\n        value: this.value\n      }\n    }\n\n    /**\n     * Instantiate an AssignmentNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"AssignmentNode\", object: ..., index: ..., value: ...}`,\n     *     where mathjs is optional\n     * @returns {AssignmentNode}\n     */\n    static fromJSON (json) {\n      return new AssignmentNode(json.object, json.index, json.value)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toHTML (options) {\n      const object = this.object.toHTML(options)\n      const index = this.index ? this.index.toHTML(options) : ''\n      let value = this.value.toHTML(options)\n      if (needParenthesis(\n        this, options && options.parenthesis, options && options.implicit)) {\n        value = '<span class=\"math-paranthesis math-round-parenthesis\">(</span>' +\n          value +\n          '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n      }\n\n      return object + index +\n        '<span class=\"math-operator math-assignment-operator ' +\n        'math-variable-assignment-operator math-binary-operator\">=</span>' +\n        value\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string}\n     */\n    _toTex (options) {\n      const object = this.object.toTex(options)\n      const index = this.index ? this.index.toTex(options) : ''\n      let value = this.value.toTex(options)\n      if (needParenthesis(\n        this, options && options.parenthesis, options && options.implicit)) {\n        value = `\\\\left(${value}\\\\right)`\n      }\n\n      return object + index + '=' + value\n    }\n  }\n\n  return AssignmentNode\n}, { isClass: true, isNode: true })\n","import { errorTransform } from '../../transform/utils/errorTransform.js'\nimport { setSafeProperty } from '../../../utils/customs.js'\n\nexport function assignFactory ({ subset, matrix }) {\n  /**\n   * Replace part of an object:\n   *\n   * - Assign a property to an object\n   * - Replace a part of a string\n   * - Replace a matrix subset\n   *\n   * @param {Object | Array | Matrix | string} object\n   * @param {Index} index\n   * @param {*} value\n   * @return {Object | Array | Matrix | string} Returns the original object\n   *                                            except in case of a string\n   */\n  // TODO: change assign to return the value instead of the object\n  return function assign (object, index, value) {\n    try {\n      if (Array.isArray(object)) {\n        const result = matrix(object).subset(index, value).valueOf()\n\n        // shallow copy all (updated) items into the original array\n        result.forEach((item, index) => {\n          object[index] = item\n        })\n\n        return object\n      } else if (object && typeof object.subset === 'function') { // Matrix\n        return object.subset(index, value)\n      } else if (typeof object === 'string') {\n        // TODO: move setStringSubset into a separate util file, use that\n        return subset(object, index, value)\n      } else if (typeof object === 'object') {\n        if (!index.isObjectProperty()) {\n          throw TypeError('Cannot apply a numeric index as object property')\n        }\n        setSafeProperty(object, index.getObjectProperty(), value)\n        return object\n      } else {\n        throw new TypeError('Cannot apply index: unsupported type of object')\n      }\n    } catch (err) {\n      throw errorTransform(err)\n    }\n  }\n}\n","import { isNode } from '../../utils/is.js'\nimport { forEach, map } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'BlockNode'\nconst dependencies = [\n  'ResultSet',\n  'Node'\n]\n\nexport const createBlockNode = /* #__PURE__ */ factory(name, dependencies, ({ ResultSet, Node }) => {\n  class BlockNode extends Node {\n    /**\n     * @constructor BlockNode\n     * @extends {Node}\n     * Holds a set with blocks\n     * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks\n     *            An array with blocks, where a block is constructed as an\n     *            Object with properties block, which is a Node, and visible,\n     *            which is a boolean. The property visible is optional and\n     *            is true by default\n     */\n    constructor (blocks) {\n      super()\n      // validate input, copy blocks\n      if (!Array.isArray(blocks)) throw new Error('Array expected')\n      this.blocks = blocks.map(function (block) {\n        const node = block && block.node\n        const visible = block &&\n              block.visible !== undefined\n          ? block.visible\n          : true\n\n        if (!isNode(node)) throw new TypeError('Property \"node\" must be a Node')\n        if (typeof visible !== 'boolean') { throw new TypeError('Property \"visible\" must be a boolean') }\n\n        return { node, visible }\n      })\n    }\n\n    static name = name\n    get type () { return name }\n    get isBlockNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalBlocks = map(this.blocks, function (block) {\n        return {\n          evaluate: block.node._compile(math, argNames),\n          visible: block.visible\n        }\n      })\n\n      return function evalBlockNodes (scope, args, context) {\n        const results = []\n\n        forEach(evalBlocks, function evalBlockNode (block) {\n          const result = block.evaluate(scope, args, context)\n          if (block.visible) {\n            results.push(result)\n          }\n        })\n\n        return new ResultSet(results)\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child blocks of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      for (let i = 0; i < this.blocks.length; i++) {\n        callback(this.blocks[i].node, 'blocks[' + i + '].node', this)\n      }\n    }\n\n    /**\n     * Create a new BlockNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {BlockNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const blocks = []\n      for (let i = 0; i < this.blocks.length; i++) {\n        const block = this.blocks[i]\n        const node = this._ifNode(\n          callback(block.node, 'blocks[' + i + '].node', this))\n        blocks[i] = {\n          node,\n          visible: block.visible\n        }\n      }\n      return new BlockNode(blocks)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {BlockNode}\n     */\n    clone () {\n      const blocks = this.blocks.map(function (block) {\n        return {\n          node: block.node,\n          visible: block.visible\n        }\n      })\n\n      return new BlockNode(blocks)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toString (options) {\n      return this.blocks.map(function (param) {\n        return param.node.toString(options) + (param.visible ? '' : ';')\n      }).join('\\n')\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        blocks: this.blocks\n      }\n    }\n\n    /**\n     * Instantiate an BlockNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"BlockNode\", blocks: [{node: ..., visible: false}, ...]}`,\n     *     where mathjs is optional\n     * @returns {BlockNode}\n     */\n    static fromJSON (json) {\n      return new BlockNode(json.blocks)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML (options) {\n      return this.blocks.map(function (param) {\n        return param.node.toHTML(options) +\n          (param.visible ? '' : '<span class=\"math-separator\">;</span>')\n      }).join('<span class=\"math-separator\"><br /></span>')\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      return this.blocks.map(function (param) {\n        return param.node.toTex(options) + (param.visible ? '' : ';')\n      }).join('\\\\;\\\\;\\n')\n    }\n  }\n\n  return BlockNode\n}, { isClass: true, isNode: true })\n","import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'ConditionalNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createConditionalNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * Test whether a condition is met\n   * @param {*} condition\n   * @returns {boolean} true if condition is true or non-zero, else false\n   */\n  function testCondition (condition) {\n    if (typeof condition === 'number' ||\n        typeof condition === 'boolean' ||\n        typeof condition === 'string') {\n      return !!condition\n    }\n\n    if (condition) {\n      if (isBigNumber(condition)) {\n        return !condition.isZero()\n      }\n\n      if (isComplex(condition)) {\n        return !!((condition.re || condition.im))\n      }\n\n      if (isUnit(condition)) {\n        return !!condition.value\n      }\n    }\n\n    if (condition === null || condition === undefined) {\n      return false\n    }\n\n    throw new TypeError('Unsupported type of condition \"' + typeOf(condition) + '\"')\n  }\n\n  class ConditionalNode extends Node {\n    /**\n     * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'\n     *\n     * @param {Node} condition   Condition, must result in a boolean\n     * @param {Node} trueExpr    Expression evaluated when condition is true\n     * @param {Node} falseExpr   Expression evaluated when condition is true\n     *\n     * @constructor ConditionalNode\n     * @extends {Node}\n     */\n    constructor (condition, trueExpr, falseExpr) {\n      super()\n      if (!isNode(condition)) { throw new TypeError('Parameter condition must be a Node') }\n      if (!isNode(trueExpr)) { throw new TypeError('Parameter trueExpr must be a Node') }\n      if (!isNode(falseExpr)) { throw new TypeError('Parameter falseExpr must be a Node') }\n\n      this.condition = condition\n      this.trueExpr = trueExpr\n      this.falseExpr = falseExpr\n    }\n\n    static name = name\n    get type () { return name }\n    get isConditionalNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalCondition = this.condition._compile(math, argNames)\n      const evalTrueExpr = this.trueExpr._compile(math, argNames)\n      const evalFalseExpr = this.falseExpr._compile(math, argNames)\n\n      return function evalConditionalNode (scope, args, context) {\n        return testCondition(evalCondition(scope, args, context))\n          ? evalTrueExpr(scope, args, context)\n          : evalFalseExpr(scope, args, context)\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.condition, 'condition', this)\n      callback(this.trueExpr, 'trueExpr', this)\n      callback(this.falseExpr, 'falseExpr', this)\n    }\n\n    /**\n     * Create a new ConditionalNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {ConditionalNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      return new ConditionalNode(\n        this._ifNode(callback(this.condition, 'condition', this)),\n        this._ifNode(callback(this.trueExpr, 'trueExpr', this)),\n        this._ifNode(callback(this.falseExpr, 'falseExpr', this))\n      )\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ConditionalNode}\n     */\n    clone () {\n      return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const precedence =\n          getPrecedence(this, parenthesis, options && options.implicit)\n\n      // Enclose Arguments in parentheses if they are an OperatorNode\n      // or have lower or equal precedence\n      // NOTE: enclosing all OperatorNodes in parentheses is a decision\n      // purely based on aesthetics and readability\n      let condition = this.condition.toString(options)\n      const conditionPrecedence =\n          getPrecedence(this.condition, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.condition.type === 'OperatorNode') ||\n          ((conditionPrecedence !== null) &&\n              (conditionPrecedence <= precedence))) {\n        condition = '(' + condition + ')'\n      }\n\n      let trueExpr = this.trueExpr.toString(options)\n      const truePrecedence =\n          getPrecedence(this.trueExpr, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.trueExpr.type === 'OperatorNode') ||\n          ((truePrecedence !== null) && (truePrecedence <= precedence))) {\n        trueExpr = '(' + trueExpr + ')'\n      }\n\n      let falseExpr = this.falseExpr.toString(options)\n      const falsePrecedence =\n          getPrecedence(this.falseExpr, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.falseExpr.type === 'OperatorNode') ||\n          ((falsePrecedence !== null) && (falsePrecedence <= precedence))) {\n        falseExpr = '(' + falseExpr + ')'\n      }\n      return condition + ' ? ' + trueExpr + ' : ' + falseExpr\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        condition: this.condition,\n        trueExpr: this.trueExpr,\n        falseExpr: this.falseExpr\n      }\n    }\n\n    /**\n     * Instantiate an ConditionalNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     ```\n     *     {\"mathjs\": \"ConditionalNode\",\n     *      \"condition\": ...,\n     *      \"trueExpr\": ...,\n     *      \"falseExpr\": ...}\n     *     ```\n     *     where mathjs is optional\n     * @returns {ConditionalNode}\n     */\n    static fromJSON (json) {\n      return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const precedence =\n          getPrecedence(this, parenthesis, options && options.implicit)\n\n      // Enclose Arguments in parentheses if they are an OperatorNode\n      // or have lower or equal precedence\n      // NOTE: enclosing all OperatorNodes in parentheses is a decision\n      // purely based on aesthetics and readability\n      let condition = this.condition.toHTML(options)\n      const conditionPrecedence =\n          getPrecedence(this.condition, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.condition.type === 'OperatorNode') ||\n          ((conditionPrecedence !== null) &&\n              (conditionPrecedence <= precedence))) {\n        condition =\n          '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          condition +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n\n      let trueExpr = this.trueExpr.toHTML(options)\n      const truePrecedence =\n          getPrecedence(this.trueExpr, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.trueExpr.type === 'OperatorNode') ||\n          ((truePrecedence !== null) && (truePrecedence <= precedence))) {\n        trueExpr =\n          '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          trueExpr +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n\n      let falseExpr = this.falseExpr.toHTML(options)\n      const falsePrecedence =\n          getPrecedence(this.falseExpr, parenthesis, options && options.implicit)\n      if ((parenthesis === 'all') ||\n          (this.falseExpr.type === 'OperatorNode') ||\n          ((falsePrecedence !== null) && (falsePrecedence <= precedence))) {\n        falseExpr =\n          '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          falseExpr +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      return condition +\n        '<span class=\"math-operator math-conditional-operator\">?</span>' +\n        trueExpr +\n        '<span class=\"math-operator math-conditional-operator\">:</span>' +\n        falseExpr\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      return '\\\\begin{cases} {' +\n        this.trueExpr.toTex(options) + '}, &\\\\quad{\\\\text{if }\\\\;' +\n        this.condition.toTex(options) +\n        '}\\\\\\\\{' + this.falseExpr.toTex(options) +\n        '}, &\\\\quad{\\\\text{otherwise}}\\\\end{cases}'\n    }\n  }\n\n  return ConditionalNode\n}, { isClass: true, isNode: true })\n","/* eslint no-template-curly-in-string: \"off\" */\n\nimport escapeLatexLib from 'escape-latex'\nimport { hasOwnProperty } from './object.js'\n\nexport const latexSymbols = {\n  // GREEK LETTERS\n  Alpha: 'A',\n  alpha: '\\\\alpha',\n  Beta: 'B',\n  beta: '\\\\beta',\n  Gamma: '\\\\Gamma',\n  gamma: '\\\\gamma',\n  Delta: '\\\\Delta',\n  delta: '\\\\delta',\n  Epsilon: 'E',\n  epsilon: '\\\\epsilon',\n  varepsilon: '\\\\varepsilon',\n  Zeta: 'Z',\n  zeta: '\\\\zeta',\n  Eta: 'H',\n  eta: '\\\\eta',\n  Theta: '\\\\Theta',\n  theta: '\\\\theta',\n  vartheta: '\\\\vartheta',\n  Iota: 'I',\n  iota: '\\\\iota',\n  Kappa: 'K',\n  kappa: '\\\\kappa',\n  varkappa: '\\\\varkappa',\n  Lambda: '\\\\Lambda',\n  lambda: '\\\\lambda',\n  Mu: 'M',\n  mu: '\\\\mu',\n  Nu: 'N',\n  nu: '\\\\nu',\n  Xi: '\\\\Xi',\n  xi: '\\\\xi',\n  Omicron: 'O',\n  omicron: 'o',\n  Pi: '\\\\Pi',\n  pi: '\\\\pi',\n  varpi: '\\\\varpi',\n  Rho: 'P',\n  rho: '\\\\rho',\n  varrho: '\\\\varrho',\n  Sigma: '\\\\Sigma',\n  sigma: '\\\\sigma',\n  varsigma: '\\\\varsigma',\n  Tau: 'T',\n  tau: '\\\\tau',\n  Upsilon: '\\\\Upsilon',\n  upsilon: '\\\\upsilon',\n  Phi: '\\\\Phi',\n  phi: '\\\\phi',\n  varphi: '\\\\varphi',\n  Chi: 'X',\n  chi: '\\\\chi',\n  Psi: '\\\\Psi',\n  psi: '\\\\psi',\n  Omega: '\\\\Omega',\n  omega: '\\\\omega',\n  // logic\n  true: '\\\\mathrm{True}',\n  false: '\\\\mathrm{False}',\n  // other\n  i: 'i', // TODO use \\i ??\n  inf: '\\\\infty',\n  Inf: '\\\\infty',\n  infinity: '\\\\infty',\n  Infinity: '\\\\infty',\n  oo: '\\\\infty',\n  lim: '\\\\lim',\n  undefined: '\\\\mathbf{?}'\n}\n\nexport const latexOperators = {\n  transpose: '^\\\\top',\n  ctranspose: '^H',\n  factorial: '!',\n  pow: '^',\n  dotPow: '.^\\\\wedge', // TODO find ideal solution\n  unaryPlus: '+',\n  unaryMinus: '-',\n  bitNot: '\\\\~', // TODO find ideal solution\n  not: '\\\\neg',\n  multiply: '\\\\cdot',\n  divide: '\\\\frac', // TODO how to handle that properly?\n  dotMultiply: '.\\\\cdot', // TODO find ideal solution\n  dotDivide: '.:', // TODO find ideal solution\n  mod: '\\\\mod',\n  add: '+',\n  subtract: '-',\n  to: '\\\\rightarrow',\n  leftShift: '<<',\n  rightArithShift: '>>',\n  rightLogShift: '>>>',\n  equal: '=',\n  unequal: '\\\\neq',\n  smaller: '<',\n  larger: '>',\n  smallerEq: '\\\\leq',\n  largerEq: '\\\\geq',\n  bitAnd: '\\\\&',\n  bitXor: '\\\\underline{|}',\n  bitOr: '|',\n  and: '\\\\wedge',\n  xor: '\\\\veebar',\n  or: '\\\\vee'\n}\n\nexport const latexFunctions = {\n  // arithmetic\n  abs: { 1: '\\\\left|${args[0]}\\\\right|' },\n  add: { 2: `\\\\left(\\${args[0]}${latexOperators.add}\\${args[1]}\\\\right)` },\n  cbrt: { 1: '\\\\sqrt[3]{${args[0]}}' },\n  ceil: { 1: '\\\\left\\\\lceil${args[0]}\\\\right\\\\rceil' },\n  cube: { 1: '\\\\left(${args[0]}\\\\right)^3' },\n  divide: { 2: '\\\\frac{${args[0]}}{${args[1]}}' },\n  dotDivide: { 2: `\\\\left(\\${args[0]}${latexOperators.dotDivide}\\${args[1]}\\\\right)` },\n  dotMultiply: { 2: `\\\\left(\\${args[0]}${latexOperators.dotMultiply}\\${args[1]}\\\\right)` },\n  dotPow: { 2: `\\\\left(\\${args[0]}${latexOperators.dotPow}\\${args[1]}\\\\right)` },\n  exp: { 1: '\\\\exp\\\\left(${args[0]}\\\\right)' },\n  expm1: `\\\\left(e${latexOperators.pow}{\\${args[0]}}-1\\\\right)`,\n  fix: { 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)' },\n  floor: { 1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rfloor' },\n  fraction: { 2: '\\\\frac{${args[0]}}{${args[1]}}' },\n  gcd: '\\\\gcd\\\\left(${args}\\\\right)',\n  hypot: '\\\\hypot\\\\left(${args}\\\\right)',\n  log: {\n    1: '\\\\ln\\\\left(${args[0]}\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}\\\\right)'\n  },\n  log10: { 1: '\\\\log_{10}\\\\left(${args[0]}\\\\right)' },\n  log1p: {\n    1: '\\\\ln\\\\left(${args[0]}+1\\\\right)',\n    2: '\\\\log_{${args[1]}}\\\\left(${args[0]}+1\\\\right)'\n  },\n  log2: '\\\\log_{2}\\\\left(${args[0]}\\\\right)',\n  mod: { 2: `\\\\left(\\${args[0]}${latexOperators.mod}\\${args[1]}\\\\right)` },\n  multiply: { 2: `\\\\left(\\${args[0]}${latexOperators.multiply}\\${args[1]}\\\\right)` },\n  norm: {\n    1: '\\\\left\\\\|${args[0]}\\\\right\\\\|',\n    2: undefined // use default template\n  },\n  nthRoot: { 2: '\\\\sqrt[${args[1]}]{${args[0]}}' },\n  nthRoots: { 2: '\\\\{y : y^${args[1]} = {${args[0]}}\\\\}' },\n  pow: { 2: `\\\\left(\\${args[0]}\\\\right)${latexOperators.pow}{\\${args[1]}}` },\n  round: {\n    1: '\\\\left\\\\lfloor${args[0]}\\\\right\\\\rceil',\n    2: undefined // use default template\n  },\n  sign: { 1: '\\\\mathrm{${name}}\\\\left(${args[0]}\\\\right)' },\n  sqrt: { 1: '\\\\sqrt{${args[0]}}' },\n  square: { 1: '\\\\left(${args[0]}\\\\right)^2' },\n  subtract: { 2: `\\\\left(\\${args[0]}${latexOperators.subtract}\\${args[1]}\\\\right)` },\n  unaryMinus: { 1: `${latexOperators.unaryMinus}\\\\left(\\${args[0]}\\\\right)` },\n  unaryPlus: { 1: `${latexOperators.unaryPlus}\\\\left(\\${args[0]}\\\\right)` },\n\n  // bitwise\n  bitAnd: { 2: `\\\\left(\\${args[0]}${latexOperators.bitAnd}\\${args[1]}\\\\right)` },\n  bitNot: { 1: latexOperators.bitNot + '\\\\left(${args[0]}\\\\right)' },\n  bitOr: { 2: `\\\\left(\\${args[0]}${latexOperators.bitOr}\\${args[1]}\\\\right)` },\n  bitXor: { 2: `\\\\left(\\${args[0]}${latexOperators.bitXor}\\${args[1]}\\\\right)` },\n  leftShift: { 2: `\\\\left(\\${args[0]}${latexOperators.leftShift}\\${args[1]}\\\\right)` },\n  rightArithShift: { 2: `\\\\left(\\${args[0]}${latexOperators.rightArithShift}\\${args[1]}\\\\right)` },\n  rightLogShift: { 2: `\\\\left(\\${args[0]}${latexOperators.rightLogShift}\\${args[1]}\\\\right)` },\n\n  // combinatorics\n  bellNumbers: { 1: '\\\\mathrm{B}_{${args[0]}}' },\n  catalan: { 1: '\\\\mathrm{C}_{${args[0]}}' },\n  stirlingS2: { 2: '\\\\mathrm{S}\\\\left(${args}\\\\right)' },\n\n  // complex\n  arg: { 1: '\\\\arg\\\\left(${args[0]}\\\\right)' },\n  conj: { 1: '\\\\left(${args[0]}\\\\right)^*' },\n  im: { 1: '\\\\Im\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace' },\n  re: { 1: '\\\\Re\\\\left\\\\lbrace${args[0]}\\\\right\\\\rbrace' },\n\n  // logical\n  and: { 2: `\\\\left(\\${args[0]}${latexOperators.and}\\${args[1]}\\\\right)` },\n  not: { 1: latexOperators.not + '\\\\left(${args[0]}\\\\right)' },\n  or: { 2: `\\\\left(\\${args[0]}${latexOperators.or}\\${args[1]}\\\\right)` },\n  xor: { 2: `\\\\left(\\${args[0]}${latexOperators.xor}\\${args[1]}\\\\right)` },\n\n  // matrix\n  cross: { 2: '\\\\left(${args[0]}\\\\right)\\\\times\\\\left(${args[1]}\\\\right)' },\n  ctranspose: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.ctranspose}` },\n  det: { 1: '\\\\det\\\\left(${args[0]}\\\\right)' },\n  dot: { 2: '\\\\left(${args[0]}\\\\cdot${args[1]}\\\\right)' },\n  expm: { 1: '\\\\exp\\\\left(${args[0]}\\\\right)' },\n  inv: { 1: '\\\\left(${args[0]}\\\\right)^{-1}' },\n  pinv: { 1: '\\\\left(${args[0]}\\\\right)^{+}' },\n  sqrtm: { 1: `{\\${args[0]}}${latexOperators.pow}{\\\\frac{1}{2}}` },\n  trace: { 1: '\\\\mathrm{tr}\\\\left(${args[0]}\\\\right)' },\n  transpose: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.transpose}` },\n\n  // probability\n  combinations: { 2: '\\\\binom{${args[0]}}{${args[1]}}' },\n  combinationsWithRep: { 2: '\\\\left(\\\\!\\\\!{\\\\binom{${args[0]}}{${args[1]}}}\\\\!\\\\!\\\\right)' },\n  factorial: { 1: `\\\\left(\\${args[0]}\\\\right)${latexOperators.factorial}` },\n  gamma: { 1: '\\\\Gamma\\\\left(${args[0]}\\\\right)' },\n  lgamma: { 1: '\\\\ln\\\\Gamma\\\\left(${args[0]}\\\\right)' },\n\n  // relational\n  equal: { 2: `\\\\left(\\${args[0]}${latexOperators.equal}\\${args[1]}\\\\right)` },\n  larger: { 2: `\\\\left(\\${args[0]}${latexOperators.larger}\\${args[1]}\\\\right)` },\n  largerEq: { 2: `\\\\left(\\${args[0]}${latexOperators.largerEq}\\${args[1]}\\\\right)` },\n  smaller: { 2: `\\\\left(\\${args[0]}${latexOperators.smaller}\\${args[1]}\\\\right)` },\n  smallerEq: { 2: `\\\\left(\\${args[0]}${latexOperators.smallerEq}\\${args[1]}\\\\right)` },\n  unequal: { 2: `\\\\left(\\${args[0]}${latexOperators.unequal}\\${args[1]}\\\\right)` },\n\n  // special\n  erf: { 1: 'erf\\\\left(${args[0]}\\\\right)' },\n\n  // statistics\n  max: '\\\\max\\\\left(${args}\\\\right)',\n  min: '\\\\min\\\\left(${args}\\\\right)',\n  variance: '\\\\mathrm{Var}\\\\left(${args}\\\\right)',\n\n  // trigonometry\n  acos: { 1: '\\\\cos^{-1}\\\\left(${args[0]}\\\\right)' },\n  acosh: { 1: '\\\\cosh^{-1}\\\\left(${args[0]}\\\\right)' },\n  acot: { 1: '\\\\cot^{-1}\\\\left(${args[0]}\\\\right)' },\n  acoth: { 1: '\\\\coth^{-1}\\\\left(${args[0]}\\\\right)' },\n  acsc: { 1: '\\\\csc^{-1}\\\\left(${args[0]}\\\\right)' },\n  acsch: { 1: '\\\\mathrm{csch}^{-1}\\\\left(${args[0]}\\\\right)' },\n  asec: { 1: '\\\\sec^{-1}\\\\left(${args[0]}\\\\right)' },\n  asech: { 1: '\\\\mathrm{sech}^{-1}\\\\left(${args[0]}\\\\right)' },\n  asin: { 1: '\\\\sin^{-1}\\\\left(${args[0]}\\\\right)' },\n  asinh: { 1: '\\\\sinh^{-1}\\\\left(${args[0]}\\\\right)' },\n  atan: { 1: '\\\\tan^{-1}\\\\left(${args[0]}\\\\right)' },\n  atan2: { 2: '\\\\mathrm{atan2}\\\\left(${args}\\\\right)' },\n  atanh: { 1: '\\\\tanh^{-1}\\\\left(${args[0]}\\\\right)' },\n  cos: { 1: '\\\\cos\\\\left(${args[0]}\\\\right)' },\n  cosh: { 1: '\\\\cosh\\\\left(${args[0]}\\\\right)' },\n  cot: { 1: '\\\\cot\\\\left(${args[0]}\\\\right)' },\n  coth: { 1: '\\\\coth\\\\left(${args[0]}\\\\right)' },\n  csc: { 1: '\\\\csc\\\\left(${args[0]}\\\\right)' },\n  csch: { 1: '\\\\mathrm{csch}\\\\left(${args[0]}\\\\right)' },\n  sec: { 1: '\\\\sec\\\\left(${args[0]}\\\\right)' },\n  sech: { 1: '\\\\mathrm{sech}\\\\left(${args[0]}\\\\right)' },\n  sin: { 1: '\\\\sin\\\\left(${args[0]}\\\\right)' },\n  sinh: { 1: '\\\\sinh\\\\left(${args[0]}\\\\right)' },\n  tan: { 1: '\\\\tan\\\\left(${args[0]}\\\\right)' },\n  tanh: { 1: '\\\\tanh\\\\left(${args[0]}\\\\right)' },\n\n  // unit\n  to: { 2: `\\\\left(\\${args[0]}${latexOperators.to}\\${args[1]}\\\\right)` },\n\n  // utils\n  numeric: function (node, options) {\n    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.\n    return node.args[0].toTex()\n  },\n\n  // type\n  number: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  },\n  string: {\n    0: '\\\\mathtt{\"\"}',\n    1: '\\\\mathrm{string}\\\\left(${args[0]}\\\\right)'\n  },\n  bignumber: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  bigint: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  complex: {\n    0: '0',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: `\\\\left(\\\\left(\\${args[0]}\\\\right)+${latexSymbols.i}\\\\cdot\\\\left(\\${args[1]}\\\\right)\\\\right)`\n  },\n  matrix: {\n    0: '\\\\begin{bmatrix}\\\\end{bmatrix}',\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(${args[0]}\\\\right)'\n  },\n  sparse: {\n    0: '\\\\begin{bsparse}\\\\end{bsparse}',\n    1: '\\\\left(${args[0]}\\\\right)'\n  },\n  unit: {\n    1: '\\\\left(${args[0]}\\\\right)',\n    2: '\\\\left(\\\\left(${args[0]}\\\\right)${args[1]}\\\\right)'\n  }\n\n}\n\nexport const defaultTemplate = '\\\\mathrm{${name}}\\\\left(${args}\\\\right)'\n\nconst latexUnits = {\n  deg: '^\\\\circ'\n}\n\nexport function escapeLatex (string) {\n  return escapeLatexLib(string, { preserveFormatting: true })\n}\n\n// @param {string} name\n// @param {boolean} isUnit\nexport function toSymbol (name, isUnit) {\n  isUnit = typeof isUnit === 'undefined' ? false : isUnit\n  if (isUnit) {\n    if (hasOwnProperty(latexUnits, name)) {\n      return latexUnits[name]\n    }\n\n    return '\\\\mathrm{' + escapeLatex(name) + '}'\n  }\n\n  if (hasOwnProperty(latexSymbols, name)) {\n    return latexSymbols[name]\n  }\n\n  return escapeLatex(name)\n}\n","import { format } from '../../utils/string.js'\nimport { typeOf } from '../../utils/is.js'\nimport { escapeLatex } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ConstantNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createConstantNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  class ConstantNode extends Node {\n    /**\n     * A ConstantNode holds a constant value like a number or string.\n     *\n     * Usage:\n     *\n     *     new ConstantNode(2.3)\n     *     new ConstantNode('hello')\n     *\n     * @param {*} value    Value can be any type (number, BigNumber, bigint, string, ...)\n     * @constructor ConstantNode\n     * @extends {Node}\n     */\n    constructor (value) {\n      super()\n      this.value = value\n    }\n\n    static name = name\n    get type () { return name }\n    get isConstantNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const value = this.value\n\n      return function evalConstantNode () {\n        return value\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      // nothing to do, we don't have any children\n    }\n\n    /**\n     * Create a new ConstantNode with children produced by the given callback.\n     * Trivial because there are no children.\n     * @param {function(child: Node, path: string, parent: Node) : Node} callback\n     * @returns {ConstantNode} Returns a clone of the node\n     */\n    map (callback) {\n      return this.clone()\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ConstantNode}\n     */\n    clone () {\n      return new ConstantNode(this.value)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      return format(this.value, options)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const value = this._toString(options)\n\n      switch (typeOf(this.value)) {\n        case 'number':\n        case 'bigint':\n        case 'BigNumber':\n        case 'Fraction':\n          return '<span class=\"math-number\">' + value + '</span>'\n        case 'string':\n          return '<span class=\"math-string\">' + value + '</span>'\n        case 'boolean':\n          return '<span class=\"math-boolean\">' + value + '</span>'\n        case 'null':\n          return '<span class=\"math-null-symbol\">' + value + '</span>'\n        case 'undefined':\n          return '<span class=\"math-undefined\">' + value + '</span>'\n\n        default:\n          return '<span class=\"math-symbol\">' + value + '</span>'\n      }\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return { mathjs: name, value: this.value }\n    }\n\n    /**\n     * Instantiate a ConstantNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"SymbolNode\", value: 2.3}`,\n     *                       where mathjs is optional\n     * @returns {ConstantNode}\n     */\n    static fromJSON (json) {\n      return new ConstantNode(json.value)\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const value = this._toString(options)\n      const type = typeOf(this.value)\n\n      switch (type) {\n        case 'string':\n          return '\\\\mathtt{' + escapeLatex(value) + '}'\n\n        case 'number':\n        case 'BigNumber': {\n          const finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value)\n          if (!finite) {\n            return (this.value.valueOf() < 0)\n              ? '-\\\\infty'\n              : '\\\\infty'\n          }\n\n          const index = value.toLowerCase().indexOf('e')\n          if (index !== -1) {\n            return value.substring(0, index) + '\\\\cdot10^{' +\n              value.substring(index + 1) + '}'\n          }\n\n          return value\n        }\n\n        case 'bigint': {\n          return value.toString()\n        }\n\n        case 'Fraction':\n          return this.value.toLatex()\n\n        default:\n          return value\n      }\n    }\n  }\n\n  return ConstantNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\n\nimport { keywords } from '../keywords.js'\nimport { escape } from '../../utils/string.js'\nimport { forEach, join } from '../../utils/array.js'\nimport { toSymbol } from '../../utils/latex.js'\nimport { getPrecedence } from '../operators.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'FunctionAssignmentNode'\nconst dependencies = [\n  'typed',\n  'Node'\n]\n\nexport const createFunctionAssignmentNode = /* #__PURE__ */ factory(name, dependencies, ({ typed, Node }) => {\n  /**\n   * Is parenthesis needed?\n   * @param {Node} node\n   * @param {Object} parenthesis\n   * @param {string} implicit\n   * @private\n   */\n  function needParenthesis (node, parenthesis, implicit) {\n    const precedence = getPrecedence(node, parenthesis, implicit)\n    const exprPrecedence = getPrecedence(node.expr, parenthesis, implicit)\n\n    return (parenthesis === 'all') ||\n      ((exprPrecedence !== null) && (exprPrecedence <= precedence))\n  }\n\n  class FunctionAssignmentNode extends Node {\n    /**\n     * @constructor FunctionAssignmentNode\n     * @extends {Node}\n     * Function assignment\n     *\n     * @param {string} name           Function name\n     * @param {string[] | Array.<{name: string, type: string}>} params\n     *                                Array with function parameter names, or an\n     *                                array with objects containing the name\n     *                                and type of the parameter\n     * @param {Node} expr             The function expression\n     */\n    constructor (name, params, expr) {\n      super()\n      // validate input\n      if (typeof name !== 'string') { throw new TypeError('String expected for parameter \"name\"') }\n      if (!Array.isArray(params)) {\n        throw new TypeError(\n          'Array containing strings or objects expected for parameter \"params\"')\n      }\n      if (!isNode(expr)) { throw new TypeError('Node expected for parameter \"expr\"') }\n      if (keywords.has(name)) { throw new Error('Illegal function name, \"' + name + '\" is a reserved keyword') }\n\n      const paramNames = new Set()\n      for (const param of params) {\n        const name = typeof param === 'string' ? param : param.name\n        if (paramNames.has(name)) {\n          throw new Error(`Duplicate parameter name \"${name}\"`)\n        } else {\n          paramNames.add(name)\n        }\n      }\n\n      this.name = name\n      this.params = params.map(function (param) {\n        return (param && param.name) || param\n      })\n      this.types = params.map(function (param) {\n        return (param && param.type) || 'any'\n      })\n      this.expr = expr\n    }\n\n    static name = name\n    get type () { return name }\n    get isFunctionAssignmentNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const childArgNames = Object.create(argNames)\n      forEach(this.params, function (param) {\n        childArgNames[param] = true\n      })\n\n      // compile the function expression with the child args\n      const expr = this.expr\n      const evalExpr = expr._compile(math, childArgNames)\n      const name = this.name\n      const params = this.params\n      const signature = join(this.types, ',')\n      const syntax = name + '(' + join(this.params, ', ') + ')'\n\n      return function evalFunctionAssignmentNode (scope, args, context) {\n        const signatures = {}\n        signatures[signature] = function () {\n          const childArgs = Object.create(args)\n\n          for (let i = 0; i < params.length; i++) {\n            childArgs[params[i]] = arguments[i]\n          }\n\n          return evalExpr(scope, childArgs, context)\n        }\n        const fn = typed(name, signatures)\n        fn.syntax = syntax\n        fn.expr = expr.toString()\n\n        scope.set(name, fn)\n\n        return fn\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.expr, 'expr', this)\n    }\n\n    /**\n     * Create a new FunctionAssignmentNode whose children are the results of\n     * calling the provided callback function for each child of the original\n     * node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {FunctionAssignmentNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const expr = this._ifNode(callback(this.expr, 'expr', this))\n\n      return new FunctionAssignmentNode(this.name, this.params.slice(0), expr)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {FunctionAssignmentNode}\n     */\n    clone () {\n      return new FunctionAssignmentNode(\n        this.name, this.params.slice(0), this.expr)\n    }\n\n    /**\n     * get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      let expr = this.expr.toString(options)\n      if (needParenthesis(this, parenthesis, options && options.implicit)) {\n        expr = '(' + expr + ')'\n      }\n      return this.name + '(' + this.params.join(', ') + ') = ' + expr\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      const types = this.types\n\n      return {\n        mathjs: name,\n        name: this.name,\n        params: this.params.map(function (param, index) {\n          return {\n            name: param,\n            type: types[index]\n          }\n        }),\n        expr: this.expr\n      }\n    }\n\n    /**\n     * Instantiate an FunctionAssignmentNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     ```\n     *     {\"mathjs\": \"FunctionAssignmentNode\",\n     *      name: ..., params: ..., expr: ...}\n     *     ```\n     *     where mathjs is optional\n     * @returns {FunctionAssignmentNode}\n     */\n    static fromJSON (json) {\n      return new FunctionAssignmentNode(json.name, json.params, json.expr)\n    }\n\n    /**\n     * get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const parenthesis = (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const params = []\n      for (let i = 0; i < this.params.length; i++) {\n        params.push('<span class=\"math-symbol math-parameter\">' +\n                    escape(this.params[i]) + '</span>')\n      }\n      let expr = this.expr.toHTML(options)\n      if (needParenthesis(this, parenthesis, options && options.implicit)) {\n        expr = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          expr +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      return '<span class=\"math-function\">' +\n        escape(this.name) + '</span>' +\n        '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n        params.join('<span class=\"math-separator\">,</span>') +\n        '<span class=\"math-parenthesis math-round-parenthesis\">)</span>' +\n        '<span class=\"math-operator math-assignment-operator ' +\n        'math-variable-assignment-operator math-binary-operator\">=</span>' +\n        expr\n    }\n\n    /**\n     * get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      let expr = this.expr.toTex(options)\n      if (needParenthesis(this, parenthesis, options && options.implicit)) {\n        expr = `\\\\left(${expr}\\\\right)`\n      }\n\n      return '\\\\mathrm{' + this.name +\n        '}\\\\left(' + this.params.map(toSymbol).join(',') + '\\\\right)=' + expr\n    }\n  }\n\n  return FunctionAssignmentNode\n}, { isClass: true, isNode: true })\n","import { map } from '../../utils/array.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { isArray, isConstantNode, isMatrix, isNode, isString, typeOf } from '../../utils/is.js'\nimport { escape } from '../../utils/string.js'\n\nconst name = 'IndexNode'\nconst dependencies = [\n  'Node',\n  'size'\n]\n\nexport const createIndexNode = /* #__PURE__ */ factory(name, dependencies, ({ Node, size }) => {\n  class IndexNode extends Node {\n    /**\n     * @constructor IndexNode\n     * @extends Node\n     *\n     * Describes a subset of a matrix or an object property.\n     * Cannot be used on its own, needs to be used within an AccessorNode or\n     * AssignmentNode.\n     *\n     * @param {Node[]} dimensions\n     * @param {boolean} [dotNotation=false]\n     *     Optional property describing whether this index was written using dot\n     *     notation like `a.b`, or using bracket notation like `a[\"b\"]`\n     *     (which is the default). This property is used for string conversion.\n     */\n    constructor (dimensions, dotNotation) {\n      super()\n      this.dimensions = dimensions\n      this.dotNotation = dotNotation || false\n\n      // validate input\n      if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {\n        throw new TypeError(\n          'Array containing Nodes expected for parameter \"dimensions\"')\n      }\n      if (this.dotNotation && !this.isObjectProperty()) {\n        throw new Error('dotNotation only applicable for object properties')\n      }\n    }\n\n    static name = name\n    get type () { return name }\n    get isIndexNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      // TODO: implement support for bignumber (currently bignumbers are silently\n      //       reduced to numbers when changing the value to zero-based)\n\n      // TODO: Optimization: when the range values are ConstantNodes,\n      //       we can beforehand resolve the zero-based value\n\n      // optimization for a simple object property\n      const evalDimensions = map(this.dimensions, function (dimension, i) {\n        const needsEnd = dimension\n          .filter(node => node.isSymbolNode && node.name === 'end')\n          .length > 0\n\n        if (needsEnd) {\n          // SymbolNode 'end' is used inside the index,\n          // like in `A[end]` or `A[end - 2]`\n          const childArgNames = Object.create(argNames)\n          childArgNames.end = true\n\n          const _evalDimension = dimension._compile(math, childArgNames)\n\n          return function evalDimension (scope, args, context) {\n            if (!isMatrix(context) && !isArray(context) && !isString(context)) {\n              throw new TypeError(\n                'Cannot resolve \"end\": ' +\n                  'context must be a Matrix, Array, or string but is ' +\n                  typeOf(context))\n            }\n\n            const s = size(context).valueOf()\n            const childArgs = Object.create(args)\n            childArgs.end = s[i]\n\n            return _evalDimension(scope, childArgs, context)\n          }\n        } else {\n          // SymbolNode `end` not used\n          return dimension._compile(math, argNames)\n        }\n      })\n\n      const index = getSafeProperty(math, 'index')\n\n      return function evalIndexNode (scope, args, context) {\n        const dimensions = map(evalDimensions, function (evalDimension) {\n          return evalDimension(scope, args, context)\n        })\n\n        return index(...dimensions)\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      for (let i = 0; i < this.dimensions.length; i++) {\n        callback(this.dimensions[i], 'dimensions[' + i + ']', this)\n      }\n    }\n\n    /**\n     * Create a new IndexNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {IndexNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const dimensions = []\n      for (let i = 0; i < this.dimensions.length; i++) {\n        dimensions[i] = this._ifNode(\n          callback(this.dimensions[i], 'dimensions[' + i + ']', this))\n      }\n\n      return new IndexNode(dimensions, this.dotNotation)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {IndexNode}\n     */\n    clone () {\n      return new IndexNode(this.dimensions.slice(0), this.dotNotation)\n    }\n\n    /**\n     * Test whether this IndexNode contains a single property name\n     * @return {boolean}\n     */\n    isObjectProperty () {\n      return this.dimensions.length === 1 &&\n        isConstantNode(this.dimensions[0]) &&\n        typeof this.dimensions[0].value === 'string'\n    }\n\n    /**\n     * Returns the property name if IndexNode contains a property.\n     * If not, returns null.\n     * @return {string | null}\n     */\n    getObjectProperty () {\n      return this.isObjectProperty() ? this.dimensions[0].value : null\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      // format the parameters like \"[1, 0:5]\"\n      return this.dotNotation\n        ? ('.' + this.getObjectProperty())\n        : ('[' + this.dimensions.join(', ') + ']')\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        dimensions: this.dimensions,\n        dotNotation: this.dotNotation\n      }\n    }\n\n    /**\n     * Instantiate an IndexNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"IndexNode\", dimensions: [...], dotNotation: false}`,\n     *     where mathjs is optional\n     * @returns {IndexNode}\n     */\n    static fromJSON (json) {\n      return new IndexNode(json.dimensions, json.dotNotation)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      // format the parameters like \"[1, 0:5]\"\n      const dimensions = []\n      for (let i = 0; i < this.dimensions.length; i++) {\n        dimensions[i] = this.dimensions[i].toHTML()\n      }\n      if (this.dotNotation) {\n        return '<span class=\"math-operator math-accessor-operator\">.</span>' +\n          '<span class=\"math-symbol math-property\">' +\n          escape(this.getObjectProperty()) + '</span>'\n      } else {\n        return '<span class=\"math-parenthesis math-square-parenthesis\">[</span>' +\n          dimensions.join('<span class=\"math-separator\">,</span>') +\n          '<span class=\"math-parenthesis math-square-parenthesis\">]</span>'\n      }\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const dimensions = this.dimensions.map(function (range) {\n        return range.toTex(options)\n      })\n\n      return this.dotNotation\n        ? ('.' + this.getObjectProperty() + '')\n        : ('_{' + dimensions.join(',') + '}')\n    }\n  }\n\n  return IndexNode\n}, { isClass: true, isNode: true })\n","import { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { isNode } from '../../utils/is.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { escape, stringify } from '../../utils/string.js'\n\nconst name = 'ObjectNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createObjectNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  class ObjectNode extends Node {\n    /**\n     * @constructor ObjectNode\n     * @extends {Node}\n     * Holds an object with keys/values\n     * @param {Object.<string, Node>} [properties]   object with key/value pairs\n     */\n    constructor (properties) {\n      super()\n      this.properties = properties || {}\n\n      // validate input\n      if (properties) {\n        if (!(typeof properties === 'object') ||\n            !Object.keys(properties).every(function (key) {\n              return isNode(properties[key])\n            })) {\n          throw new TypeError('Object containing Nodes expected')\n        }\n      }\n    }\n\n    static name = name\n    get type () { return name }\n    get isObjectNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const evalEntries = {}\n\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          // we stringify/parse the key here to resolve unicode characters,\n          // so you cannot create a key like {\"co\\\\u006Estructor\": null}\n          const stringifiedKey = stringify(key)\n          const parsedKey = JSON.parse(stringifiedKey)\n          const prop = getSafeProperty(this.properties, key)\n\n          evalEntries[parsedKey] = prop._compile(math, argNames)\n        }\n      }\n\n      return function evalObjectNode (scope, args, context) {\n        const obj = {}\n\n        for (const key in evalEntries) {\n          if (hasOwnProperty(evalEntries, key)) {\n            obj[key] = evalEntries[key](scope, args, context)\n          }\n        }\n\n        return obj\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          callback(\n            this.properties[key], 'properties[' + stringify(key) + ']', this)\n        }\n      }\n    }\n\n    /**\n     * Create a new ObjectNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {ObjectNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const properties = {}\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          properties[key] = this._ifNode(\n            callback(\n              this.properties[key], 'properties[' + stringify(key) + ']', this))\n        }\n      }\n      return new ObjectNode(properties)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ObjectNode}\n     */\n    clone () {\n      const properties = {}\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          properties[key] = this.properties[key]\n        }\n      }\n      return new ObjectNode(properties)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toString (options) {\n      const entries = []\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          entries.push(\n            stringify(key) + ': ' + this.properties[key].toString(options))\n        }\n      }\n      return '{' + entries.join(', ') + '}'\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        properties: this.properties\n      }\n    }\n\n    /**\n     * Instantiate an OperatorNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"ObjectNode\", \"properties\": {...}}`,\n     *                       where mathjs is optional\n     * @returns {ObjectNode}\n     */\n    static fromJSON (json) {\n      return new ObjectNode(json.properties)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML (options) {\n      const entries = []\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          entries.push(\n            '<span class=\"math-symbol math-property\">' + escape(key) + '</span>' +\n              '<span class=\"math-operator math-assignment-operator ' +\n              'math-property-assignment-operator math-binary-operator\">' +\n              ':</span>' + this.properties[key].toHTML(options))\n        }\n      }\n      return '<span class=\"math-parenthesis math-curly-parenthesis\">{</span>' +\n        entries.join('<span class=\"math-separator\">,</span>') +\n        '<span class=\"math-parenthesis math-curly-parenthesis\">}</span>'\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const entries = []\n      for (const key in this.properties) {\n        if (hasOwnProperty(this.properties, key)) {\n          entries.push(\n            '\\\\mathbf{' + key + ':} & ' +\n              this.properties[key].toTex(options) + '\\\\\\\\')\n        }\n      }\n      const tex = '\\\\left\\\\{\\\\begin{array}{ll}' + entries.join('\\n') +\n          '\\\\end{array}\\\\right\\\\}'\n      return tex\n    }\n  }\n\n  return ObjectNode\n}, { isClass: true, isNode: true })\n","import { ObjectWrappingMap, PartitionedMap } from './map.js'\n\n/**\n * Create a new scope which can access the parent scope,\n * but does not affect it when written. This is suitable for variable definitions\n * within a block node, or function definition.\n *\n * If parent scope has a createSubScope method, it delegates to that. Otherwise,\n * creates an empty map, and copies the parent scope to it, adding in\n * the remaining `args`.\n *\n * @param {Map} parentScope\n * @param  {Object} args\n * @returns {PartitionedMap}\n */\nexport function createSubScope (parentScope, args) {\n  return new PartitionedMap(\n    parentScope,\n    new ObjectWrappingMap(args),\n    new Set(Object.keys(args))\n  )\n}\n","import { isNode, isConstantNode, isOperatorNode, isParenthesisNode } from '../../utils/is.js'\nimport { map } from '../../utils/array.js'\nimport { createSubScope } from '../../utils/scope.js'\nimport { escape } from '../../utils/string.js'\nimport { getSafeProperty, isSafeMethod } from '../../utils/customs.js'\nimport { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js'\nimport { latexOperators } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'OperatorNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createOperatorNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * Returns true if the expression starts with a constant, under\n   * the current parenthesization:\n   * @param {Node} expression\n   * @param {string} parenthesis\n   * @return {boolean}\n   */\n  function startsWithConstant (expr, parenthesis) {\n    let curNode = expr\n    if (parenthesis === 'auto') {\n      while (isParenthesisNode(curNode)) curNode = curNode.content\n    }\n    if (isConstantNode(curNode)) return true\n    if (isOperatorNode(curNode)) {\n      return startsWithConstant(curNode.args[0], parenthesis)\n    }\n    return false\n  }\n\n  /**\n   * Calculate which parentheses are necessary. Gets an OperatorNode\n   * (which is the root of the tree) and an Array of Nodes\n   * (this.args) and returns an array where 'true' means that an argument\n   * has to be enclosed in parentheses whereas 'false' means the opposite.\n   *\n   * @param {OperatorNode} root\n   * @param {string} parenthesis\n   * @param {Node[]} args\n   * @param {boolean} latex\n   * @return {boolean[]}\n   * @private\n   */\n  function calculateNecessaryParentheses (root, parenthesis, implicit, args, latex) {\n    // precedence of the root OperatorNode\n    const precedence = getPrecedence(root, parenthesis, implicit)\n    const associativity = getAssociativity(root, parenthesis)\n\n    if ((parenthesis === 'all') || ((args.length > 2) && (root.getIdentifier() !== 'OperatorNode:add') && (root.getIdentifier() !== 'OperatorNode:multiply'))) {\n      return args.map(function (arg) {\n        switch (arg.getContent().type) { // Nodes that don't need extra parentheses\n          case 'ArrayNode':\n          case 'ConstantNode':\n          case 'SymbolNode':\n          case 'ParenthesisNode':\n            return false\n          default:\n            return true\n        }\n      })\n    }\n\n    let result\n    switch (args.length) {\n      case 0:\n        result = []\n        break\n\n      case 1: // unary operators\n        {\n          // precedence of the operand\n          const operandPrecedence = getPrecedence(args[0], parenthesis, implicit, root)\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex && (operandPrecedence !== null)) {\n            let operandIdentifier\n            let rootIdentifier\n            if (parenthesis === 'keep') {\n              operandIdentifier = args[0].getIdentifier()\n              rootIdentifier = root.getIdentifier()\n            } else {\n              // Ignore Parenthesis Nodes when not in 'keep' mode\n              operandIdentifier = args[0].getContent().getIdentifier()\n              rootIdentifier = root.getContent().getIdentifier()\n            }\n            if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n              result = [false]\n              break\n            }\n\n            if (properties[operandPrecedence][operandIdentifier].latexParens === false) {\n              result = [false]\n              break\n            }\n          }\n\n          if (operandPrecedence === null) {\n            // if the operand has no defined precedence, no parens are needed\n            result = [false]\n            break\n          }\n\n          if (operandPrecedence <= precedence) {\n            // if the operands precedence is lower, parens are needed\n            result = [true]\n            break\n          }\n\n          // otherwise, no parens needed\n          result = [false]\n        }\n        break\n      case 2: // binary operators\n        {\n          let lhsParens // left hand side needs parenthesis?\n          // precedence of the left hand side\n          const lhsPrecedence = getPrecedence(args[0], parenthesis, implicit, root)\n          // is the root node associative with the left hand side\n          const assocWithLhs = isAssociativeWith(root, args[0], parenthesis)\n\n          if (lhsPrecedence === null) {\n            // if the left hand side has no defined precedence, no parens are needed\n            // FunctionNode for example\n            lhsParens = false\n          } else if ((lhsPrecedence === precedence) && (associativity === 'right') && !assocWithLhs) {\n            // In case of equal precedence, if the root node is left associative\n            // parens are **never** necessary for the left hand side.\n            // If it is right associative however, parens are necessary\n            // if the root node isn't associative with the left hand side\n            lhsParens = true\n          } else if (lhsPrecedence < precedence) {\n            lhsParens = true\n          } else {\n            lhsParens = false\n          }\n\n          let rhsParens // right hand side needs parenthesis?\n          // precedence of the right hand side\n          const rhsPrecedence = getPrecedence(args[1], parenthesis, implicit, root)\n          // is the root node associative with the right hand side?\n          const assocWithRhs = isAssociativeWith(root, args[1], parenthesis)\n\n          if (rhsPrecedence === null) {\n            // if the right hand side has no defined precedence, no parens are needed\n            // FunctionNode for example\n            rhsParens = false\n          } else if ((rhsPrecedence === precedence) && (associativity === 'left') && !assocWithRhs) {\n            // In case of equal precedence, if the root node is right associative\n            // parens are **never** necessary for the right hand side.\n            // If it is left associative however, parens are necessary\n            // if the root node isn't associative with the right hand side\n            rhsParens = true\n          } else if (rhsPrecedence < precedence) {\n            rhsParens = true\n          } else {\n            rhsParens = false\n          }\n\n          // handle special cases for LaTeX, where some of the parentheses aren't needed\n          if (latex) {\n            let rootIdentifier\n            let lhsIdentifier\n            let rhsIdentifier\n            if (parenthesis === 'keep') {\n              rootIdentifier = root.getIdentifier()\n              lhsIdentifier = root.args[0].getIdentifier()\n              rhsIdentifier = root.args[1].getIdentifier()\n            } else {\n              // Ignore ParenthesisNodes when not in 'keep' mode\n              rootIdentifier = root.getContent().getIdentifier()\n              lhsIdentifier = root.args[0].getContent().getIdentifier()\n              rhsIdentifier = root.args[1].getContent().getIdentifier()\n            }\n\n            if (lhsPrecedence !== null) {\n              if (properties[precedence][rootIdentifier].latexLeftParens === false) {\n                lhsParens = false\n              }\n\n              if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {\n                lhsParens = false\n              }\n            }\n\n            if (rhsPrecedence !== null) {\n              if (properties[precedence][rootIdentifier].latexRightParens === false) {\n                rhsParens = false\n              }\n\n              if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {\n                rhsParens = false\n              }\n            }\n          }\n\n          result = [lhsParens, rhsParens]\n        }\n        break\n\n      default:\n        if ((root.getIdentifier() === 'OperatorNode:add') || (root.getIdentifier() === 'OperatorNode:multiply')) {\n          result = args.map(function (arg) {\n            const argPrecedence = getPrecedence(arg, parenthesis, implicit, root)\n            const assocWithArg = isAssociativeWith(root, arg, parenthesis)\n            const argAssociativity = getAssociativity(arg, parenthesis)\n            if (argPrecedence === null) {\n              // if the argument has no defined precedence, no parens are needed\n              return false\n            } else if ((precedence === argPrecedence) && (associativity === argAssociativity) && !assocWithArg) {\n              return true\n            } else if (argPrecedence < precedence) {\n              return true\n            }\n\n            return false\n          })\n        }\n        break\n    }\n\n    // Handles an edge case of parentheses with implicit multiplication\n    // of ConstantNode.\n    // In that case, parenthesize ConstantNodes that follow an unparenthesized\n    // expression, even though they normally wouldn't be printed.\n    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' &&\n        root.implicit && parenthesis !== 'all' && implicit === 'hide') {\n      for (let i = 1; i < result.length; ++i) {\n        if (startsWithConstant(args[i], parenthesis) && !result[i - 1] &&\n            (parenthesis !== 'keep' || !isParenthesisNode(args[i - 1]))) {\n          result[i] = true\n        }\n      }\n    }\n\n    return result\n  }\n\n  class OperatorNode extends Node {\n    /**\n     * @constructor OperatorNode\n     * @extends {Node}\n     * An operator with two arguments, like 2+3\n     *\n     * @param {string} op           Operator name, for example '+'\n     * @param {string} fn           Function name, for example 'add'\n     * @param {Node[]} args         Operator arguments\n     * @param {boolean} [implicit]  Is this an implicit multiplication?\n     * @param {boolean} [isPercentage] Is this an percentage Operation?\n     */\n    constructor (op, fn, args, implicit, isPercentage) {\n      super()\n      // validate input\n      if (typeof op !== 'string') {\n        throw new TypeError('string expected for parameter \"op\"')\n      }\n      if (typeof fn !== 'string') {\n        throw new TypeError('string expected for parameter \"fn\"')\n      }\n      if (!Array.isArray(args) || !args.every(isNode)) {\n        throw new TypeError(\n          'Array containing Nodes expected for parameter \"args\"')\n      }\n\n      this.implicit = (implicit === true)\n      this.isPercentage = (isPercentage === true)\n      this.op = op\n      this.fn = fn\n      this.args = args || []\n    }\n\n    static name = name\n    get type () { return name }\n    get isOperatorNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      // validate fn\n      if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {\n        if (!math[this.fn]) {\n          throw new Error(\n            'Function ' + this.fn + ' missing in provided namespace \"math\"')\n        } else {\n          throw new Error('No access to function \"' + this.fn + '\"')\n        }\n      }\n\n      const fn = getSafeProperty(math, this.fn)\n      const evalArgs = map(this.args, function (arg) {\n        return arg._compile(math, argNames)\n      })\n\n      if (typeof fn === 'function' && fn.rawArgs === true) {\n        // pass unevaluated parameters (nodes) to the function\n        // \"raw\" evaluation\n        const rawArgs = this.args\n        return function evalOperatorNode (scope, args, context) {\n          return fn(rawArgs, math, createSubScope(scope, args))\n        }\n      } else if (evalArgs.length === 1) {\n        const evalArg0 = evalArgs[0]\n        return function evalOperatorNode (scope, args, context) {\n          return fn(evalArg0(scope, args, context))\n        }\n      } else if (evalArgs.length === 2) {\n        const evalArg0 = evalArgs[0]\n        const evalArg1 = evalArgs[1]\n        return function evalOperatorNode (scope, args, context) {\n          return fn(\n            evalArg0(scope, args, context),\n            evalArg1(scope, args, context))\n        }\n      } else {\n        return function evalOperatorNode (scope, args, context) {\n          return fn.apply(null, map(evalArgs, function (evalArg) {\n            return evalArg(scope, args, context)\n          }))\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      for (let i = 0; i < this.args.length; i++) {\n        callback(this.args[i], 'args[' + i + ']', this)\n      }\n    }\n\n    /**\n     * Create a new OperatorNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {OperatorNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const args = []\n      for (let i = 0; i < this.args.length; i++) {\n        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this))\n      }\n      return new OperatorNode(\n        this.op, this.fn, args, this.implicit, this.isPercentage)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {OperatorNode}\n     */\n    clone () {\n      return new OperatorNode(\n        this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage)\n    }\n\n    /**\n     * Check whether this is an unary OperatorNode:\n     * has exactly one argument, like `-a`.\n     * @return {boolean}\n     *     Returns true when an unary operator node, false otherwise.\n     */\n    isUnary () {\n      return this.args.length === 1\n    }\n\n    /**\n     * Check whether this is a binary OperatorNode:\n     * has exactly two arguments, like `a + b`.\n     * @return {boolean}\n     *     Returns true when a binary operator node, false otherwise.\n     */\n    isBinary () {\n      return this.args.length === 2\n    }\n\n    /**\n     * Get string representation.\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const implicit = (options && options.implicit) ? options.implicit : 'hide'\n      const args = this.args\n      const parens =\n          calculateNecessaryParentheses(this, parenthesis, implicit, args, false)\n\n      if (args.length === 1) { // unary operators\n        const assoc = getAssociativity(this, parenthesis)\n\n        let operand = args[0].toString(options)\n        if (parens[0]) {\n          operand = '(' + operand + ')'\n        }\n\n        // for example for \"not\", we want a space between operand and argument\n        const opIsNamed = /[a-zA-Z]+/.test(this.op)\n\n        if (assoc === 'right') { // prefix operator\n          return this.op + (opIsNamed ? ' ' : '') + operand\n        } else if (assoc === 'left') { // postfix\n          return operand + (opIsNamed ? ' ' : '') + this.op\n        }\n\n        // fall back to postfix\n        return operand + this.op\n      } else if (args.length === 2) {\n        let lhs = args[0].toString(options) // left hand side\n        let rhs = args[1].toString(options) // right hand side\n        if (parens[0]) { // left hand side in parenthesis?\n          lhs = '(' + lhs + ')'\n        }\n        if (parens[1]) { // right hand side in parenthesis?\n          rhs = '(' + rhs + ')'\n        }\n\n        if (this.implicit &&\n            (this.getIdentifier() === 'OperatorNode:multiply') &&\n            (implicit === 'hide')) {\n          return lhs + ' ' + rhs\n        }\n\n        return lhs + ' ' + this.op + ' ' + rhs\n      } else if ((args.length > 2) &&\n                 ((this.getIdentifier() === 'OperatorNode:add') ||\n                     (this.getIdentifier() === 'OperatorNode:multiply'))) {\n        const stringifiedArgs = args.map(function (arg, index) {\n          arg = arg.toString(options)\n          if (parens[index]) { // put in parenthesis?\n            arg = '(' + arg + ')'\n          }\n\n          return arg\n        })\n\n        if (this.implicit &&\n            (this.getIdentifier() === 'OperatorNode:multiply') &&\n            (implicit === 'hide')) {\n          return stringifiedArgs.join(' ')\n        }\n\n        return stringifiedArgs.join(' ' + this.op + ' ')\n      } else {\n        // fallback to formatting as a function call\n        return this.fn + '(' + this.args.join(', ') + ')'\n      }\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        op: this.op,\n        fn: this.fn,\n        args: this.args,\n        implicit: this.implicit,\n        isPercentage: this.isPercentage\n      }\n    }\n\n    /**\n     * Instantiate an OperatorNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     ```\n     *     {\"mathjs\": \"OperatorNode\",\n     *      \"op\": \"+\", \"fn\": \"add\", \"args\": [...],\n     *      \"implicit\": false,\n     *      \"isPercentage\":false}\n     *     ```\n     *     where mathjs is optional\n     * @returns {OperatorNode}\n     */\n    static fromJSON (json) {\n      return new OperatorNode(\n        json.op, json.fn, json.args, json.implicit, json.isPercentage)\n    }\n\n    /**\n     * Get HTML representation.\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const implicit = (options && options.implicit) ? options.implicit : 'hide'\n      const args = this.args\n      const parens =\n          calculateNecessaryParentheses(this, parenthesis, implicit, args, false)\n\n      if (args.length === 1) { // unary operators\n        const assoc = getAssociativity(this, parenthesis)\n\n        let operand = args[0].toHTML(options)\n        if (parens[0]) {\n          operand =\n            '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n            operand +\n            '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        }\n\n        if (assoc === 'right') { // prefix operator\n          return '<span class=\"math-operator math-unary-operator ' +\n            'math-lefthand-unary-operator\">' + escape(this.op) + '</span>' +\n            operand\n        } else { // postfix when assoc === 'left' or undefined\n          return operand +\n            '<span class=\"math-operator math-unary-operator ' +\n            'math-righthand-unary-operator\">' + escape(this.op) + '</span>'\n        }\n      } else if (args.length === 2) { // binary operatoes\n        let lhs = args[0].toHTML(options) // left hand side\n        let rhs = args[1].toHTML(options) // right hand side\n        if (parens[0]) { // left hand side in parenthesis?\n          lhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n            lhs +\n            '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        }\n        if (parens[1]) { // right hand side in parenthesis?\n          rhs = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n            rhs +\n            '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        }\n\n        if (this.implicit &&\n            (this.getIdentifier() === 'OperatorNode:multiply') &&\n            (implicit === 'hide')) {\n          return lhs +\n            '<span class=\"math-operator math-binary-operator ' +\n            'math-implicit-binary-operator\"></span>' + rhs\n        }\n\n        return lhs +\n          '<span class=\"math-operator math-binary-operator ' +\n          'math-explicit-binary-operator\">' + escape(this.op) + '</span>' +\n          rhs\n      } else {\n        const stringifiedArgs = args.map(function (arg, index) {\n          arg = arg.toHTML(options)\n          if (parens[index]) { // put in parenthesis?\n            arg =\n              '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n              arg +\n              '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n          }\n\n          return arg\n        })\n\n        if ((args.length > 2) &&\n            ((this.getIdentifier() === 'OperatorNode:add') ||\n                (this.getIdentifier() === 'OperatorNode:multiply'))) {\n          if (this.implicit &&\n              (this.getIdentifier() === 'OperatorNode:multiply') &&\n              (implicit === 'hide')) {\n            return stringifiedArgs.join(\n              '<span class=\"math-operator math-binary-operator ' +\n                'math-implicit-binary-operator\"></span>')\n          }\n\n          return stringifiedArgs.join(\n            '<span class=\"math-operator math-binary-operator ' +\n              'math-explicit-binary-operator\">' + escape(this.op) + '</span>')\n        } else {\n          // fallback to formatting as a function call\n          return '<span class=\"math-function\">' + escape(this.fn) +\n            '</span><span class=\"math-paranthesis math-round-parenthesis\">' +\n            '(</span>' +\n            stringifiedArgs.join('<span class=\"math-separator\">,</span>') +\n            '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n        }\n      }\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const implicit = (options && options.implicit) ? options.implicit : 'hide'\n      const args = this.args\n      const parens =\n          calculateNecessaryParentheses(this, parenthesis, implicit, args, true)\n\n      let op = latexOperators[this.fn]\n      op = typeof op === 'undefined' ? this.op : op // fall back to using this.op\n\n      if (args.length === 1) { // unary operators\n        const assoc = getAssociativity(this, parenthesis)\n\n        let operand = args[0].toTex(options)\n        if (parens[0]) {\n          operand = `\\\\left(${operand}\\\\right)`\n        }\n\n        if (assoc === 'right') { // prefix operator\n          return op + operand\n        } else if (assoc === 'left') { // postfix operator\n          return operand + op\n        }\n\n        // fall back to postfix\n        return operand + op\n      } else if (args.length === 2) { // binary operators\n        const lhs = args[0] // left hand side\n        let lhsTex = lhs.toTex(options)\n        if (parens[0]) {\n          lhsTex = `\\\\left(${lhsTex}\\\\right)`\n        }\n\n        const rhs = args[1] // right hand side\n        let rhsTex = rhs.toTex(options)\n        if (parens[1]) {\n          rhsTex = `\\\\left(${rhsTex}\\\\right)`\n        }\n\n        // handle some exceptions (due to the way LaTeX works)\n        let lhsIdentifier\n        if (parenthesis === 'keep') {\n          lhsIdentifier = lhs.getIdentifier()\n        } else {\n          // Ignore ParenthesisNodes if in 'keep' mode\n          lhsIdentifier = lhs.getContent().getIdentifier()\n        }\n        switch (this.getIdentifier()) {\n          case 'OperatorNode:divide':\n            // op contains '\\\\frac' at this point\n            return op + '{' + lhsTex + '}' + '{' + rhsTex + '}'\n          case 'OperatorNode:pow':\n            lhsTex = '{' + lhsTex + '}'\n            rhsTex = '{' + rhsTex + '}'\n            switch (lhsIdentifier) {\n              case 'ConditionalNode': //\n              case 'OperatorNode:divide':\n                lhsTex = `\\\\left(${lhsTex}\\\\right)`\n            }\n            break\n          case 'OperatorNode:multiply':\n            if (this.implicit && (implicit === 'hide')) {\n              return lhsTex + '~' + rhsTex\n            }\n        }\n        return lhsTex + op + rhsTex\n      } else if ((args.length > 2) &&\n                 ((this.getIdentifier() === 'OperatorNode:add') ||\n                     (this.getIdentifier() === 'OperatorNode:multiply'))) {\n        const texifiedArgs = args.map(function (arg, index) {\n          arg = arg.toTex(options)\n          if (parens[index]) {\n            arg = `\\\\left(${arg}\\\\right)`\n          }\n          return arg\n        })\n\n        if ((this.getIdentifier() === 'OperatorNode:multiply') &&\n            this.implicit && implicit === 'hide') {\n          return texifiedArgs.join('~')\n        }\n\n        return texifiedArgs.join(op)\n      } else {\n        // fall back to formatting as a function call\n        // as this is a fallback, it doesn't use\n        // fancy function names\n        return '\\\\mathrm{' + this.fn + '}\\\\left(' +\n          args.map(function (arg) {\n            return arg.toTex(options)\n          }).join(',') + '\\\\right)'\n      }\n    }\n\n    /**\n     * Get identifier.\n     * @return {string}\n     */\n    getIdentifier () {\n      return this.type + ':' + this.fn\n    }\n  }\n\n  return OperatorNode\n}, { isClass: true, isNode: true })\n","import { isNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'ParenthesisNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createParenthesisNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  class ParenthesisNode extends Node {\n    /**\n     * @constructor ParenthesisNode\n     * @extends {Node}\n     * A parenthesis node describes manual parenthesis from the user input\n     * @param {Node} content\n     * @extends {Node}\n     */\n    constructor (content) {\n      super()\n      // validate input\n      if (!isNode(content)) {\n        throw new TypeError('Node expected for parameter \"content\"')\n      }\n\n      this.content = content\n    }\n\n    static name = name\n    get type () { return name }\n    get isParenthesisNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      return this.content._compile(math, argNames)\n    }\n\n    /**\n     * Get the content of the current Node.\n     * @return {Node} content\n     * @override\n     **/\n    getContent () {\n      return this.content.getContent()\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.content, 'content', this)\n    }\n\n    /**\n     * Create a new ParenthesisNode whose child is the result of calling\n     * the provided callback function on the child of this node.\n     * @param {function(child: Node, path: string, parent: Node) : Node} callback\n     * @returns {ParenthesisNode} Returns a clone of the node\n     */\n    map (callback) {\n      const content = callback(this.content, 'content', this)\n      return new ParenthesisNode(content)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {ParenthesisNode}\n     */\n    clone () {\n      return new ParenthesisNode(this.content)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toString (options) {\n      if ((!options) ||\n          (options && !options.parenthesis) ||\n          (options && options.parenthesis === 'keep')) {\n        return '(' + this.content.toString(options) + ')'\n      }\n      return this.content.toString(options)\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return { mathjs: name, content: this.content }\n    }\n\n    /**\n     * Instantiate an ParenthesisNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"ParenthesisNode\", \"content\": ...}`,\n     *                       where mathjs is optional\n     * @returns {ParenthesisNode}\n     */\n    static fromJSON (json) {\n      return new ParenthesisNode(json.content)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML (options) {\n      if ((!options) ||\n          (options && !options.parenthesis) ||\n          (options && options.parenthesis === 'keep')) {\n        return '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          this.content.toHTML(options) +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      return this.content.toHTML(options)\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toTex (options) {\n      if ((!options) ||\n          (options && !options.parenthesis) ||\n          (options && options.parenthesis === 'keep')) {\n        return `\\\\left(${this.content.toTex(options)}\\\\right)`\n      }\n      return this.content.toTex(options)\n    }\n  }\n\n  return ParenthesisNode\n}, { isClass: true, isNode: true })\n","import { isNode, isSymbolNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { getPrecedence } from '../operators.js'\n\nconst name = 'RangeNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createRangeNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  /**\n   * Calculate the necessary parentheses\n   * @param {Node} node\n   * @param {string} parenthesis\n   * @param {string} implicit\n   * @return {Object} parentheses\n   * @private\n   */\n  function calculateNecessaryParentheses (node, parenthesis, implicit) {\n    const precedence = getPrecedence(node, parenthesis, implicit)\n    const parens = {}\n\n    const startPrecedence = getPrecedence(node.start, parenthesis, implicit)\n    parens.start = ((startPrecedence !== null) && (startPrecedence <= precedence)) ||\n      (parenthesis === 'all')\n\n    if (node.step) {\n      const stepPrecedence = getPrecedence(node.step, parenthesis, implicit)\n      parens.step = ((stepPrecedence !== null) && (stepPrecedence <= precedence)) ||\n        (parenthesis === 'all')\n    }\n\n    const endPrecedence = getPrecedence(node.end, parenthesis, implicit)\n    parens.end = ((endPrecedence !== null) && (endPrecedence <= precedence)) ||\n      (parenthesis === 'all')\n\n    return parens\n  }\n\n  class RangeNode extends Node {\n    /**\n     * @constructor RangeNode\n     * @extends {Node}\n     * create a range\n     * @param {Node} start  included lower-bound\n     * @param {Node} end    included upper-bound\n     * @param {Node} [step] optional step\n     */\n    constructor (start, end, step) {\n      super()\n      // validate inputs\n      if (!isNode(start)) throw new TypeError('Node expected')\n      if (!isNode(end)) throw new TypeError('Node expected')\n      if (step && !isNode(step)) throw new TypeError('Node expected')\n      if (arguments.length > 3) throw new Error('Too many arguments')\n\n      this.start = start // included lower-bound\n      this.end = end // included upper-bound\n      this.step = step || null // optional step\n    }\n\n    static name = name\n    get type () { return name }\n    get isRangeNode () { return true }\n\n    /**\n     * Check whether the RangeNode needs the `end` symbol to be defined.\n     * This end is the size of the Matrix in current dimension.\n     * @return {boolean}\n     */\n    needsEnd () {\n      // find all `end` symbols in this RangeNode\n      const endSymbols = this.filter(function (node) {\n        return isSymbolNode(node) && (node.name === 'end')\n      })\n\n      return endSymbols.length > 0\n    }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const range = math.range\n      const evalStart = this.start._compile(math, argNames)\n      const evalEnd = this.end._compile(math, argNames)\n\n      if (this.step) {\n        const evalStep = this.step._compile(math, argNames)\n\n        return function evalRangeNode (scope, args, context) {\n          return range(\n            evalStart(scope, args, context),\n            evalEnd(scope, args, context),\n            evalStep(scope, args, context)\n          )\n        }\n      } else {\n        return function evalRangeNode (scope, args, context) {\n          return range(\n            evalStart(scope, args, context),\n            evalEnd(scope, args, context)\n          )\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.start, 'start', this)\n      callback(this.end, 'end', this)\n      if (this.step) {\n        callback(this.step, 'step', this)\n      }\n    }\n\n    /**\n     * Create a new RangeNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {RangeNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      return new RangeNode(\n        this._ifNode(callback(this.start, 'start', this)),\n        this._ifNode(callback(this.end, 'end', this)),\n        this.step && this._ifNode(callback(this.step, 'step', this))\n      )\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {RangeNode}\n     */\n    clone () {\n      return new RangeNode(this.start, this.end, this.step && this.step)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const parens =\n          calculateNecessaryParentheses(\n            this, parenthesis, options && options.implicit)\n\n      // format string as start:step:stop\n      let str\n\n      let start = this.start.toString(options)\n      if (parens.start) {\n        start = '(' + start + ')'\n      }\n      str = start\n\n      if (this.step) {\n        let step = this.step.toString(options)\n        if (parens.step) {\n          step = '(' + step + ')'\n        }\n        str += ':' + step\n      }\n\n      let end = this.end.toString(options)\n      if (parens.end) {\n        end = '(' + end + ')'\n      }\n      str += ':' + end\n\n      return str\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        start: this.start,\n        end: this.end,\n        step: this.step\n      }\n    }\n\n    /**\n     * Instantiate an RangeNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"RangeNode\", \"start\": ..., \"end\": ..., \"step\": ...}`,\n     *     where mathjs is optional\n     * @returns {RangeNode}\n     */\n    static fromJSON (json) {\n      return new RangeNode(json.start, json.end, json.step)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const parens =\n          calculateNecessaryParentheses(\n            this, parenthesis, options && options.implicit)\n\n      // format string as start:step:stop\n      let str\n\n      let start = this.start.toHTML(options)\n      if (parens.start) {\n        start = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          start +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      str = start\n\n      if (this.step) {\n        let step = this.step.toHTML(options)\n        if (parens.step) {\n          step = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n            step +\n            '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n        }\n        str += '<span class=\"math-operator math-range-operator\">:</span>' + step\n      }\n\n      let end = this.end.toHTML(options)\n      if (parens.end) {\n        end = '<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n          end +\n          '<span class=\"math-parenthesis math-round-parenthesis\">)</span>'\n      }\n      str += '<span class=\"math-operator math-range-operator\">:</span>' + end\n\n      return str\n    }\n\n    /**\n     * Get LaTeX representation\n     * @params {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const parens =\n          calculateNecessaryParentheses(\n            this, parenthesis, options && options.implicit)\n\n      let str = this.start.toTex(options)\n      if (parens.start) {\n        str = `\\\\left(${str}\\\\right)`\n      }\n\n      if (this.step) {\n        let step = this.step.toTex(options)\n        if (parens.step) {\n          step = `\\\\left(${step}\\\\right)`\n        }\n        str += ':' + step\n      }\n\n      let end = this.end.toTex(options)\n      if (parens.end) {\n        end = `\\\\left(${end}\\\\right)`\n      }\n      str += ':' + end\n\n      return str\n    }\n  }\n\n  return RangeNode\n}, { isClass: true, isNode: true })\n","import { getPrecedence } from '../operators.js'\nimport { escape } from '../../utils/string.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { latexOperators } from '../../utils/latex.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'RelationalNode'\nconst dependencies = [\n  'Node'\n]\n\nexport const createRelationalNode = /* #__PURE__ */ factory(name, dependencies, ({ Node }) => {\n  const operatorMap = {\n    equal: '==',\n    unequal: '!=',\n    smaller: '<',\n    larger: '>',\n    smallerEq: '<=',\n    largerEq: '>='\n  }\n\n  class RelationalNode extends Node {\n    /**\n     * A node representing a chained conditional expression, such as 'x > y > z'\n     *\n     * @param {String[]} conditionals\n     *     An array of conditional operators used to compare the parameters\n     * @param {Node[]} params\n     *     The parameters that will be compared\n     *\n     * @constructor RelationalNode\n     * @extends {Node}\n     */\n    constructor (conditionals, params) {\n      super()\n      if (!Array.isArray(conditionals)) { throw new TypeError('Parameter conditionals must be an array') }\n      if (!Array.isArray(params)) { throw new TypeError('Parameter params must be an array') }\n      if (conditionals.length !== params.length - 1) {\n        throw new TypeError(\n          'Parameter params must contain exactly one more element ' +\n            'than parameter conditionals')\n      }\n\n      this.conditionals = conditionals\n      this.params = params\n    }\n\n    static name = name\n    get type () { return name }\n    get isRelationalNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const self = this\n\n      const compiled = this.params.map(p => p._compile(math, argNames))\n\n      return function evalRelationalNode (scope, args, context) {\n        let evalLhs\n        let evalRhs = compiled[0](scope, args, context)\n\n        for (let i = 0; i < self.conditionals.length; i++) {\n          evalLhs = evalRhs\n          evalRhs = compiled[i + 1](scope, args, context)\n          const condFn = getSafeProperty(math, self.conditionals[i])\n          if (!condFn(evalLhs, evalRhs)) {\n            return false\n          }\n        }\n        return true\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this)\n    }\n\n    /**\n     * Create a new RelationalNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {RelationalNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      return new RelationalNode(\n        this.conditionals.slice(),\n        this.params.map(\n          (n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this))\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {RelationalNode}\n     */\n    clone () {\n      return new RelationalNode(this.conditionals, this.params)\n    }\n\n    /**\n     * Get string representation.\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const precedence =\n          getPrecedence(this, parenthesis, options && options.implicit)\n\n      const paramStrings = this.params.map(function (p, index) {\n        const paramPrecedence =\n            getPrecedence(p, parenthesis, options && options.implicit)\n        return (parenthesis === 'all' ||\n                (paramPrecedence !== null && paramPrecedence <= precedence))\n          ? '(' + p.toString(options) + ')'\n          : p.toString(options)\n      })\n\n      let ret = paramStrings[0]\n      for (let i = 0; i < this.conditionals.length; i++) {\n        ret += ' ' + operatorMap[this.conditionals[i]]\n        ret += ' ' + paramStrings[i + 1]\n      }\n\n      return ret\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        conditionals: this.conditionals,\n        params: this.params\n      }\n    }\n\n    /**\n     * Instantiate a RelationalNode from its JSON representation\n     * @param {Object} json\n     *     An object structured like\n     *     `{\"mathjs\": \"RelationalNode\", \"conditionals\": ..., \"params\": ...}`,\n     *     where mathjs is optional\n     * @returns {RelationalNode}\n     */\n    static fromJSON (json) {\n      return new RelationalNode(json.conditionals, json.params)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const precedence =\n          getPrecedence(this, parenthesis, options && options.implicit)\n\n      const paramStrings = this.params.map(function (p, index) {\n        const paramPrecedence =\n            getPrecedence(p, parenthesis, options && options.implicit)\n        return (parenthesis === 'all' ||\n                (paramPrecedence !== null && paramPrecedence <= precedence))\n          ? ('<span class=\"math-parenthesis math-round-parenthesis\">(</span>' +\n             p.toHTML(options) +\n             '<span class=\"math-parenthesis math-round-parenthesis\">)</span>')\n          : p.toHTML(options)\n      })\n\n      let ret = paramStrings[0]\n      for (let i = 0; i < this.conditionals.length; i++) {\n        ret += '<span class=\"math-operator math-binary-operator ' +\n          'math-explicit-binary-operator\">' +\n          escape(operatorMap[this.conditionals[i]]) + '</span>' +\n          paramStrings[i + 1]\n      }\n\n      return ret\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const parenthesis =\n          (options && options.parenthesis) ? options.parenthesis : 'keep'\n      const precedence =\n          getPrecedence(this, parenthesis, options && options.implicit)\n\n      const paramStrings = this.params.map(function (p, index) {\n        const paramPrecedence =\n            getPrecedence(p, parenthesis, options && options.implicit)\n        return (parenthesis === 'all' ||\n                (paramPrecedence !== null && paramPrecedence <= precedence))\n          ? '\\\\left(' + p.toTex(options) + '\\right)'\n          : p.toTex(options)\n      })\n\n      let ret = paramStrings[0]\n      for (let i = 0; i < this.conditionals.length; i++) {\n        ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1]\n      }\n\n      return ret\n    }\n  }\n\n  return RelationalNode\n}, { isClass: true, isNode: true })\n","import { escape } from '../../utils/string.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { factory } from '../../utils/factory.js'\nimport { toSymbol } from '../../utils/latex.js'\n\nconst name = 'SymbolNode'\nconst dependencies = [\n  'math',\n  '?Unit',\n  'Node'\n]\n\nexport const createSymbolNode = /* #__PURE__ */ factory(name, dependencies, ({ math, Unit, Node }) => {\n  /**\n   * Check whether some name is a valueless unit like \"inch\".\n   * @param {string} name\n   * @return {boolean}\n   */\n  function isValuelessUnit (name) {\n    return Unit ? Unit.isValuelessUnit(name) : false\n  }\n\n  class SymbolNode extends Node {\n    /**\n     * @constructor SymbolNode\n     * @extends {Node}\n     * A symbol node can hold and resolve a symbol\n     * @param {string} name\n     * @extends {Node}\n     */\n    constructor (name) {\n      super()\n      // validate input\n      if (typeof name !== 'string') {\n        throw new TypeError('String expected for parameter \"name\"')\n      }\n\n      this.name = name\n    }\n\n    get type () { return 'SymbolNode' }\n    get isSymbolNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      const name = this.name\n\n      if (argNames[name] === true) {\n        // this is a FunctionAssignment argument\n        // (like an x when inside the expression of a function\n        // assignment `f(x) = ...`)\n        return function (scope, args, context) {\n          return getSafeProperty(args, name)\n        }\n      } else if (name in math) {\n        return function (scope, args, context) {\n          return scope.has(name)\n            ? scope.get(name)\n            : getSafeProperty(math, name)\n        }\n      } else {\n        const isUnit = isValuelessUnit(name)\n\n        return function (scope, args, context) {\n          return scope.has(name)\n            ? scope.get(name)\n            : isUnit\n              ? new Unit(null, name)\n              : SymbolNode.onUndefinedSymbol(name)\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      // nothing to do, we don't have any children\n    }\n\n    /**\n     * Create a new SymbolNode with children produced by the given callback.\n     * Trivial since a SymbolNode has no children\n     * @param {function(child: Node, path: string, parent: Node) : Node} callback\n     * @returns {SymbolNode} Returns a clone of the node\n     */\n    map (callback) {\n      return this.clone()\n    }\n\n    /**\n     * Throws an error 'Undefined symbol {name}'\n     * @param {string} name\n     */\n    static onUndefinedSymbol (name) {\n      throw new Error('Undefined symbol ' + name)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {SymbolNode}\n     */\n    clone () {\n      return new SymbolNode(this.name)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toString (options) {\n      return this.name\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toHTML (options) {\n      const name = escape(this.name)\n\n      if (name === 'true' || name === 'false') {\n        return '<span class=\"math-symbol math-boolean\">' + name + '</span>'\n      } else if (name === 'i') {\n        return '<span class=\"math-symbol math-imaginary-symbol\">' +\n          name + '</span>'\n      } else if (name === 'Infinity') {\n        return '<span class=\"math-symbol math-infinity-symbol\">' +\n          name + '</span>'\n      } else if (name === 'NaN') {\n        return '<span class=\"math-symbol math-nan-symbol\">' + name + '</span>'\n      } else if (name === 'null') {\n        return '<span class=\"math-symbol math-null-symbol\">' + name + '</span>'\n      } else if (name === 'undefined') {\n        return '<span class=\"math-symbol math-undefined-symbol\">' +\n          name + '</span>'\n      }\n\n      return '<span class=\"math-symbol\">' + name + '</span>'\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: 'SymbolNode',\n        name: this.name\n      }\n    }\n\n    /**\n     * Instantiate a SymbolNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"SymbolNode\", name: \"x\"}`,\n     *                       where mathjs is optional\n     * @returns {SymbolNode}\n     */\n    static fromJSON (json) {\n      return new SymbolNode(json.name)\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    _toTex (options) {\n      let isUnit = false\n      if ((typeof math[this.name] === 'undefined') &&\n          isValuelessUnit(this.name)) {\n        isUnit = true\n      }\n      const symbol = toSymbol(this.name, isUnit)\n      if (symbol[0] === '\\\\') {\n        // no space needed if the symbol starts with '\\'\n        return symbol\n      }\n      // the space prevents symbols from breaking stuff like '\\cdot'\n      // if it's written right before the symbol\n      return ' ' + symbol\n    }\n  }\n\n  return SymbolNode\n}, { isClass: true, isNode: true })\n","import { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js'\nimport { escape, format } from '../../utils/string.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { getSafeProperty, getSafeMethod } from '../../utils/customs.js'\nimport { createSubScope } from '../../utils/scope.js'\nimport { factory } from '../../utils/factory.js'\nimport { defaultTemplate, latexFunctions } from '../../utils/latex.js'\n\nconst name = 'FunctionNode'\nconst dependencies = [\n  'math',\n  'Node',\n  'SymbolNode'\n]\n\nexport const createFunctionNode = /* #__PURE__ */ factory(name, dependencies, ({ math, Node, SymbolNode }) => {\n  /* format to fixed length */\n  const strin = entity => format(entity, { truncate: 78 })\n\n  /*\n   * Expand a LaTeX template\n   *\n   * @param {string} template\n   * @param {Node} node\n   * @param {Object} options\n   * @private\n   **/\n  function expandTemplate (template, node, options) {\n    let latex = ''\n\n    // Match everything of the form ${identifier} or ${identifier[2]} or $$\n    // while submatching identifier and 2 (in the second case)\n    const regex = /\\$(?:\\{([a-z_][a-z_0-9]*)(?:\\[([0-9]+)\\])?\\}|\\$)/gi\n\n    let inputPos = 0 // position in the input string\n    let match\n    while ((match = regex.exec(template)) !== null) { // go through all matches\n      // add everything in front of the match to the LaTeX string\n      latex += template.substring(inputPos, match.index)\n      inputPos = match.index\n\n      if (match[0] === '$$') { // escaped dollar sign\n        latex += '$'\n        inputPos++\n      } else { // template parameter\n        inputPos += match[0].length\n        const property = node[match[1]]\n        if (!property) {\n          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.')\n        }\n        if (match[2] === undefined) { // no square brackets\n          switch (typeof property) {\n            case 'string':\n              latex += property\n              break\n            case 'object':\n              if (isNode(property)) {\n                latex += property.toTex(options)\n              } else if (Array.isArray(property)) {\n                // make array of Nodes into comma separated list\n                latex += property.map(function (arg, index) {\n                  if (isNode(arg)) {\n                    return arg.toTex(options)\n                  }\n                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.')\n                }).join(',')\n              } else {\n                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes')\n              }\n              break\n            default:\n              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes')\n          }\n        } else { // with square brackets\n          if (isNode(property[match[2]] && property[match[2]])) {\n            latex += property[match[2]].toTex(options)\n          } else {\n            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.')\n          }\n        }\n      }\n    }\n    latex += template.slice(inputPos) // append rest of the template\n\n    return latex\n  }\n\n  class FunctionNode extends Node {\n    /**\n     * @constructor FunctionNode\n     * @extends {./Node}\n     * invoke a list with arguments on a node\n     * @param {./Node | string} fn\n     *     Item resolving to a function on which to invoke\n     *     the arguments, typically a SymbolNode or AccessorNode\n     * @param {./Node[]} args\n     */\n    constructor (fn, args) {\n      super()\n      if (typeof fn === 'string') {\n        fn = new SymbolNode(fn)\n      }\n\n      // validate input\n      if (!isNode(fn)) throw new TypeError('Node expected as parameter \"fn\"')\n      if (!Array.isArray(args) || !args.every(isNode)) {\n        throw new TypeError(\n          'Array containing Nodes expected for parameter \"args\"')\n      }\n\n      this.fn = fn\n      this.args = args || []\n    }\n\n    // readonly property name\n    get name () {\n      return this.fn.name || ''\n    }\n\n    static name = name\n    get type () { return name }\n    get isFunctionNode () { return true }\n\n    /**\n     * Compile a node into a JavaScript function.\n     * This basically pre-calculates as much as possible and only leaves open\n     * calculations which depend on a dynamic scope with variables.\n     * @param {Object} math     Math.js namespace with functions and constants.\n     * @param {Object} argNames An object with argument names as key and `true`\n     *                          as value. Used in the SymbolNode to optimize\n     *                          for arguments from user assigned functions\n     *                          (see FunctionAssignmentNode) or special symbols\n     *                          like `end` (see IndexNode).\n     * @return {function} Returns a function which can be called like:\n     *                        evalNode(scope: Object, args: Object, context: *)\n     */\n    _compile (math, argNames) {\n      // compile arguments\n      const evalArgs = this.args.map((arg) => arg._compile(math, argNames))\n\n      if (isSymbolNode(this.fn)) {\n        const name = this.fn.name\n        if (!argNames[name]) {\n          // we can statically determine whether the function\n          // has the rawArgs property\n          const fn = name in math ? getSafeProperty(math, name) : undefined\n          const isRaw = typeof fn === 'function' && fn.rawArgs === true\n\n          const resolveFn = (scope) => {\n            let value\n            if (scope.has(name)) {\n              value = scope.get(name)\n            } else if (name in math) {\n              value = getSafeProperty(math, name)\n            } else {\n              return FunctionNode.onUndefinedFunction(name)\n            }\n            if (typeof value === 'function') {\n              return value\n            }\n            throw new TypeError(\n              `'${name}' is not a function; its value is:\\n  ${strin(value)}`\n            )\n          }\n\n          if (isRaw) {\n            // pass unevaluated parameters (nodes) to the function\n            // \"raw\" evaluation\n            const rawArgs = this.args\n            return function evalFunctionNode (scope, args, context) {\n              const fn = resolveFn(scope)\n\n              // the original function can be overwritten in the scope with a non-rawArgs function\n              if (fn.rawArgs === true) {\n                return fn(rawArgs, math, createSubScope(scope, args))\n              } else {\n                // \"regular\" evaluation\n                const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n                return fn(...values)\n              }\n            }\n          } else {\n            // \"regular\" evaluation\n            switch (evalArgs.length) {\n              case 0: return function evalFunctionNode (scope, args, context) {\n                const fn = resolveFn(scope)\n                return fn()\n              }\n              case 1: return function evalFunctionNode (scope, args, context) {\n                const fn = resolveFn(scope)\n                const evalArg0 = evalArgs[0]\n                return fn(\n                  evalArg0(scope, args, context)\n                )\n              }\n              case 2: return function evalFunctionNode (scope, args, context) {\n                const fn = resolveFn(scope)\n                const evalArg0 = evalArgs[0]\n                const evalArg1 = evalArgs[1]\n                return fn(\n                  evalArg0(scope, args, context),\n                  evalArg1(scope, args, context)\n                )\n              }\n              default: return function evalFunctionNode (scope, args, context) {\n                const fn = resolveFn(scope)\n                const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n                return fn(...values)\n              }\n            }\n          }\n        } else { // the function symbol is an argName\n          const rawArgs = this.args\n          return function evalFunctionNode (scope, args, context) {\n            const fn = getSafeProperty(args, name)\n            if (typeof fn !== 'function') {\n              throw new TypeError(\n                `Argument '${name}' was not a function; received: ${strin(fn)}`\n              )\n            }\n            if (fn.rawArgs) {\n              // \"Raw\" evaluation\n              return fn(rawArgs, math, createSubScope(scope, args))\n            } else {\n              const values = evalArgs.map(\n                (evalArg) => evalArg(scope, args, context))\n              return fn.apply(fn, values)\n            }\n          }\n        }\n      } else if (\n        isAccessorNode(this.fn) &&\n          isIndexNode(this.fn.index) &&\n          this.fn.index.isObjectProperty()\n      ) {\n        // execute the function with the right context:\n        // the object of the AccessorNode\n\n        const evalObject = this.fn.object._compile(math, argNames)\n        const prop = this.fn.index.getObjectProperty()\n        const rawArgs = this.args\n\n        return function evalFunctionNode (scope, args, context) {\n          const object = evalObject(scope, args, context)\n          const fn = getSafeMethod(object, prop)\n\n          if (fn?.rawArgs) {\n            // \"Raw\" evaluation\n            return fn(rawArgs, math, createSubScope(scope, args))\n          } else {\n            // \"regular\" evaluation\n            const values = evalArgs.map((evalArg) => evalArg(scope, args, context))\n            return fn.apply(object, values)\n          }\n        }\n      } else {\n        // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()\n        // we have to dynamically determine whether the function has the\n        // rawArgs property\n        const fnExpr = this.fn.toString()\n        const evalFn = this.fn._compile(math, argNames)\n        const rawArgs = this.args\n\n        return function evalFunctionNode (scope, args, context) {\n          const fn = evalFn(scope, args, context)\n          if (typeof fn !== 'function') {\n            throw new TypeError(\n              `Expression '${fnExpr}' did not evaluate to a function; value is:` +\n                `\\n  ${strin(fn)}`\n            )\n          }\n          if (fn.rawArgs) {\n            // \"Raw\" evaluation\n            return fn(rawArgs, math, createSubScope(scope, args))\n          } else {\n            // \"regular\" evaluation\n            const values = evalArgs.map(\n              (evalArg) => evalArg(scope, args, context))\n            return fn.apply(fn, values)\n          }\n        }\n      }\n    }\n\n    /**\n     * Execute a callback for each of the child nodes of this node\n     * @param {function(child: Node, path: string, parent: Node)} callback\n     */\n    forEach (callback) {\n      callback(this.fn, 'fn', this)\n\n      for (let i = 0; i < this.args.length; i++) {\n        callback(this.args[i], 'args[' + i + ']', this)\n      }\n    }\n\n    /**\n     * Create a new FunctionNode whose children are the results of calling\n     * the provided callback function for each child of the original node.\n     * @param {function(child: Node, path: string, parent: Node): Node} callback\n     * @returns {FunctionNode} Returns a transformed copy of the node\n     */\n    map (callback) {\n      const fn = this._ifNode(callback(this.fn, 'fn', this))\n      const args = []\n      for (let i = 0; i < this.args.length; i++) {\n        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this))\n      }\n      return new FunctionNode(fn, args)\n    }\n\n    /**\n     * Create a clone of this node, a shallow copy\n     * @return {FunctionNode}\n     */\n    clone () {\n      return new FunctionNode(this.fn, this.args.slice(0))\n    }\n\n    /**\n     * Throws an error 'Undefined function {name}'\n     * @param {string} name\n     */\n    static onUndefinedFunction = function (name) {\n      throw new Error('Undefined function ' + name)\n    }\n\n    /**\n     * Get string representation. (wrapper function)\n     * This overrides parts of Node's toString function.\n     * If callback is an object containing callbacks, it\n     * calls the correct callback for the current node,\n     * otherwise it falls back to calling Node's toString\n     * function.\n     *\n     * @param {Object} options\n     * @return {string} str\n     * @override\n     */\n    toString (options) {\n      let customString\n      const name = this.fn.toString(options)\n      if (options &&\n          (typeof options.handler === 'object') &&\n          hasOwnProperty(options.handler, name)) {\n        // callback is a map of callback functions\n        customString = options.handler[name](this, options)\n      }\n\n      if (typeof customString !== 'undefined') {\n        return customString\n      }\n\n      // fall back to Node's toString\n      return super.toString(options)\n    }\n\n    /**\n     * Get string representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toString (options) {\n      const args = this.args.map(function (arg) {\n        return arg.toString(options)\n      })\n\n      const fn = isFunctionAssignmentNode(this.fn)\n        ? ('(' + this.fn.toString(options) + ')')\n        : this.fn.toString(options)\n\n      // format the arguments like \"add(2, 4.2)\"\n      return fn + '(' + args.join(', ') + ')'\n    }\n\n    /**\n     * Get a JSON representation of the node\n     * @returns {Object}\n     */\n    toJSON () {\n      return {\n        mathjs: name,\n        fn: this.fn,\n        args: this.args\n      }\n    }\n\n    /**\n     * Instantiate an AssignmentNode from its JSON representation\n     * @param {Object} json  An object structured like\n     *                       `{\"mathjs\": \"FunctionNode\", fn: ..., args: ...}`,\n     *                       where mathjs is optional\n     * @returns {FunctionNode}\n     */\n    static fromJSON = function (json) {\n      return new FunctionNode(json.fn, json.args)\n    }\n\n    /**\n     * Get HTML representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toHTML (options) {\n      const args = this.args.map(function (arg) {\n        return arg.toHTML(options)\n      })\n\n      // format the arguments like \"add(2, 4.2)\"\n      return '<span class=\"math-function\">' + escape(this.fn) +\n        '</span><span class=\"math-paranthesis math-round-parenthesis\">(</span>' +\n        args.join('<span class=\"math-separator\">,</span>') +\n        '<span class=\"math-paranthesis math-round-parenthesis\">)</span>'\n    }\n\n    /**\n     * Get LaTeX representation. (wrapper function)\n     * This overrides parts of Node's toTex function.\n     * If callback is an object containing callbacks, it\n     * calls the correct callback for the current node,\n     * otherwise it falls back to calling Node's toTex\n     * function.\n     *\n     * @param {Object} options\n     * @return {string}\n     */\n    toTex (options) {\n      let customTex\n      if (options &&\n          (typeof options.handler === 'object') &&\n          hasOwnProperty(options.handler, this.name)) {\n        // callback is a map of callback functions\n        customTex = options.handler[this.name](this, options)\n      }\n\n      if (typeof customTex !== 'undefined') {\n        return customTex\n      }\n\n      // fall back to Node's toTex\n      return super.toTex(options)\n    }\n\n    /**\n     * Get LaTeX representation\n     * @param {Object} options\n     * @return {string} str\n     */\n    _toTex (options) {\n      const args = this.args.map(function (arg) { // get LaTeX of the arguments\n        return arg.toTex(options)\n      })\n\n      let latexConverter\n\n      if (latexFunctions[this.name]) {\n        latexConverter = latexFunctions[this.name]\n      }\n\n      // toTex property on the function itself\n      if (math[this.name] &&\n          ((typeof math[this.name].toTex === 'function') ||\n           (typeof math[this.name].toTex === 'object') ||\n           (typeof math[this.name].toTex === 'string'))\n      ) {\n        // .toTex is a callback function\n        latexConverter = math[this.name].toTex\n      }\n\n      let customToTex\n      switch (typeof latexConverter) {\n        case 'function': // a callback function\n          customToTex = latexConverter(this, options)\n          break\n        case 'string': // a template string\n          customToTex = expandTemplate(latexConverter, this, options)\n          break\n        case 'object':\n          // an object with different \"converters\" for different\n          // numbers of arguments\n          switch (typeof latexConverter[args.length]) {\n            case 'function':\n              customToTex = latexConverter[args.length](this, options)\n              break\n            case 'string':\n              customToTex =\n                expandTemplate(latexConverter[args.length], this, options)\n              break\n          }\n      }\n\n      if (typeof customToTex !== 'undefined') {\n        return customToTex\n      }\n\n      return expandTemplate(defaultTemplate, this, options)\n    }\n\n    /**\n     * Get identifier.\n     * @return {string}\n     */\n    getIdentifier () {\n      return this.type + ':' + this.name\n    }\n  }\n\n  return FunctionNode\n}, { isClass: true, isNode: true })\n","import { factory } from '../utils/factory.js'\nimport { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode, rule2Node } from '../utils/is.js'\nimport { deepMap } from '../utils/collection.js'\nimport { safeNumberType } from '../utils/number.js'\nimport { hasOwnProperty } from '../utils/object.js'\n\nconst name = 'parse'\nconst dependencies = [\n  'typed',\n  'numeric',\n  'config',\n  'AccessorNode',\n  'ArrayNode',\n  'AssignmentNode',\n  'BlockNode',\n  'ConditionalNode',\n  'ConstantNode',\n  'FunctionAssignmentNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'RangeNode',\n  'RelationalNode',\n  'SymbolNode'\n]\n\nexport const createParse = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  numeric,\n  config,\n  AccessorNode,\n  ArrayNode,\n  AssignmentNode,\n  BlockNode,\n  ConditionalNode,\n  ConstantNode,\n  FunctionAssignmentNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  RangeNode,\n  RelationalNode,\n  SymbolNode\n}) => {\n  /**\n   * Parse an expression. Returns a node tree, which can be evaluated by\n   * invoking node.evaluate() or transformed into a functional object via node.compile().\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.parse(expr)\n   *     math.parse(expr, options)\n   *     math.parse([expr1, expr2, expr3, ...])\n   *     math.parse([expr1, expr2, expr3, ...], options)\n   *\n   * Example:\n   *\n   *     const node1 = math.parse('sqrt(3^2 + 4^2)')\n   *     node1.compile().evaluate() // 5\n   *\n   *     let scope = {a:3, b:4}\n   *     const node2 = math.parse('a * b')\n   *     node2.evaluate(scope) // 12\n   *     const code2 = node2.compile()\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].compile().evaluate() // 12\n   *\n   * See also:\n   *\n   *     evaluate, compile\n   *\n   * @param {string | string[] | Matrix} expr          Expression to be parsed\n   * @param {{nodes: Object<string, Node>}} [options]  Available options:\n   *                                                   - `nodes` a set of custom nodes\n   * @return {Node | Node[]} node\n   * @throws {Error}\n   */\n  const parse = typed(name, {\n    string: function (expression) {\n      return parseStart(expression, {})\n    },\n    'Array | Matrix': function (expressions) {\n      return parseMultiple(expressions, {})\n    },\n    'string, Object': function (expression, options) {\n      const extraNodes = options.nodes !== undefined ? options.nodes : {}\n\n      return parseStart(expression, extraNodes)\n    },\n    'Array | Matrix, Object': parseMultiple\n  })\n\n  function parseMultiple (expressions, options = {}) {\n    const extraNodes = options.nodes !== undefined ? options.nodes : {}\n\n    // parse an array or matrix with expressions\n    return deepMap(expressions, function (elem) {\n      if (typeof elem !== 'string') throw new TypeError('String expected')\n\n      return parseStart(elem, extraNodes)\n    })\n  }\n\n  // token types enumeration\n  const TOKENTYPE = {\n    NULL: 0,\n    DELIMITER: 1,\n    NUMBER: 2,\n    SYMBOL: 3,\n    UNKNOWN: 4\n  }\n\n  // map with all delimiters\n  const DELIMITERS = {\n    ',': true,\n    '(': true,\n    ')': true,\n    '[': true,\n    ']': true,\n    '{': true,\n    '}': true,\n    '\"': true,\n    '\\'': true,\n    ';': true,\n\n    '+': true,\n    '-': true,\n    '*': true,\n    '.*': true,\n    '/': true,\n    './': true,\n    '%': true,\n    '^': true,\n    '.^': true,\n    '~': true,\n    '!': true,\n    '&': true,\n    '|': true,\n    '^|': true,\n    '=': true,\n    ':': true,\n    '?': true,\n    '??': true,\n\n    '==': true,\n    '!=': true,\n    '<': true,\n    '>': true,\n    '<=': true,\n    '>=': true,\n\n    '<<': true,\n    '>>': true,\n    '>>>': true\n  }\n\n  // map with all named delimiters\n  const NAMED_DELIMITERS = {\n    mod: true,\n    to: true,\n    in: true,\n    and: true,\n    xor: true,\n    or: true,\n    not: true\n  }\n\n  const CONSTANTS = {\n    true: true,\n    false: false,\n    null: null,\n    undefined\n  }\n\n  const NUMERIC_CONSTANTS = [\n    'NaN',\n    'Infinity'\n  ]\n\n  const ESCAPE_CHARACTERS = {\n    '\"': '\"',\n    \"'\": \"'\",\n    '\\\\': '\\\\',\n    '/': '/',\n    b: '\\b',\n    f: '\\f',\n    n: '\\n',\n    r: '\\r',\n    t: '\\t'\n    // note that \\u is handled separately in parseStringToken()\n  }\n\n  function initialState () {\n    return {\n      extraNodes: {}, // current extra nodes, must be careful not to mutate\n      expression: '', // current expression\n      comment: '', // last parsed comment\n      index: 0, // current index in expr\n      token: '', // current token\n      tokenType: TOKENTYPE.NULL, // type of the token\n      nestingLevel: 0, // level of nesting inside parameters, used to ignore newline characters\n      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here\n    }\n  }\n\n  /**\n   * View upto `length` characters of the expression starting at the current character.\n   *\n   * @param {Object} state\n   * @param {number} [length=1] Number of characters to view\n   * @returns {string}\n   * @private\n   */\n  function currentString (state, length) {\n    return state.expression.substr(state.index, length)\n  }\n\n  /**\n   * View the current character. Returns '' if end of expression is reached.\n   *\n   * @param {Object} state\n   * @returns {string}\n   * @private\n   */\n  function currentCharacter (state) {\n    return currentString(state, 1)\n  }\n\n  /**\n   * Get the next character from the expression.\n   * The character is stored into the char c. If the end of the expression is\n   * reached, the function puts an empty string in c.\n   * @private\n   */\n  function next (state) {\n    state.index++\n  }\n\n  /**\n   * Preview the previous character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function prevCharacter (state) {\n    return state.expression.charAt(state.index - 1)\n  }\n\n  /**\n   * Preview the next character from the expression.\n   * @return {string} cNext\n   * @private\n   */\n  function nextCharacter (state) {\n    return state.expression.charAt(state.index + 1)\n  }\n\n  /**\n   * Get next token in the current string expr.\n   * The token and token type are available as token and tokenType\n   * @private\n   */\n  function getToken (state) {\n    state.tokenType = TOKENTYPE.NULL\n    state.token = ''\n    state.comment = ''\n\n    // skip over ignored characters:\n    while (true) {\n      // comments:\n      if (currentCharacter(state) === '#') {\n        while (currentCharacter(state) !== '\\n' &&\n               currentCharacter(state) !== '') {\n          state.comment += currentCharacter(state)\n          next(state)\n        }\n      }\n      // whitespace: space, tab, and newline when inside parameters\n      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {\n        next(state)\n      } else {\n        break\n      }\n    }\n\n    // check for end of expression\n    if (currentCharacter(state) === '') {\n      // token is still empty\n      state.tokenType = TOKENTYPE.DELIMITER\n      return\n    }\n\n    // check for new line character\n    if (currentCharacter(state) === '\\n' && !state.nestingLevel) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = currentCharacter(state)\n      next(state)\n      return\n    }\n\n    const c1 = currentCharacter(state)\n    const c2 = currentString(state, 2)\n    const c3 = currentString(state, 3)\n    if (c3.length === 3 && DELIMITERS[c3]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c3\n      next(state)\n      next(state)\n      next(state)\n      return\n    }\n\n    // check for delimiters consisting of 2 characters\n    if (c2.length === 2 && DELIMITERS[c2]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c2\n      next(state)\n      next(state)\n      return\n    }\n\n    // check for delimiters consisting of 1 character\n    if (DELIMITERS[c1]) {\n      state.tokenType = TOKENTYPE.DELIMITER\n      state.token = c1\n      next(state)\n      return\n    }\n\n    // check for a number\n    if (parse.isDigitDot(c1)) {\n      state.tokenType = TOKENTYPE.NUMBER\n\n      // check for binary, octal, or hex\n      const c2 = currentString(state, 2)\n      if (c2 === '0b' || c2 === '0o' || c2 === '0x') {\n        state.token += currentCharacter(state)\n        next(state)\n        state.token += currentCharacter(state)\n        next(state)\n        while (parse.isHexDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n        if (currentCharacter(state) === '.') {\n          // this number has a radix point\n          state.token += '.'\n          next(state)\n          // get the digits after the radix\n          while (parse.isHexDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n        } else if (currentCharacter(state) === 'i') {\n          // this number has a word size suffix\n          state.token += 'i'\n          next(state)\n          // get the word size\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n        }\n        return\n      }\n\n      // get number, can have a single dot\n      if (currentCharacter(state) === '.') {\n        state.token += currentCharacter(state)\n        next(state)\n\n        if (!parse.isDigit(currentCharacter(state))) {\n          // this is no number, it is just a dot (can be dot notation)\n          state.tokenType = TOKENTYPE.DELIMITER\n          return\n        }\n      } else {\n        while (parse.isDigit(currentCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n          state.token += currentCharacter(state)\n          next(state)\n        }\n      }\n\n      while (parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state)\n        next(state)\n      }\n      // check for exponential notation like \"2.3e-4\", \"1.23e50\" or \"2e+4\"\n      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {\n        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {\n          state.token += currentCharacter(state)\n          next(state)\n\n          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n          // Scientific notation MUST be followed by an exponent\n          if (!parse.isDigit(currentCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n          }\n\n          while (parse.isDigit(currentCharacter(state))) {\n            state.token += currentCharacter(state)\n            next(state)\n          }\n\n          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {\n            throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n          }\n        } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {\n          next(state)\n          throw createSyntaxError(state, 'Digit expected, got \"' + currentCharacter(state) + '\"')\n        }\n      }\n\n      return\n    }\n\n    // check for variables, functions, named operators\n    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {\n      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {\n        state.token += currentCharacter(state)\n        next(state)\n      }\n\n      if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {\n        state.tokenType = TOKENTYPE.DELIMITER\n      } else {\n        state.tokenType = TOKENTYPE.SYMBOL\n      }\n\n      return\n    }\n\n    // something unknown is found, wrong characters -> a syntax error\n    state.tokenType = TOKENTYPE.UNKNOWN\n    while (currentCharacter(state) !== '') {\n      state.token += currentCharacter(state)\n      next(state)\n    }\n    throw createSyntaxError(state, 'Syntax error in part \"' + state.token + '\"')\n  }\n\n  /**\n   * Get next token and skip newline tokens\n   */\n  function getTokenSkipNewline (state) {\n    do {\n      getToken(state)\n    }\n    while (state.token === '\\n') // eslint-disable-line no-unmodified-loop-condition\n  }\n\n  /**\n   * Open parameters.\n   * New line characters will be ignored until closeParams(state) is called\n   */\n  function openParams (state) {\n    state.nestingLevel++\n  }\n\n  /**\n   * Close parameters.\n   * New line characters will no longer be ignored\n   */\n  function closeParams (state) {\n    state.nestingLevel--\n  }\n\n  /**\n   * Checks whether the current character `c` is a valid alpha character:\n   *\n   * - A latin letter (upper or lower case) Ascii: a-z, A-Z\n   * - An underscore                        Ascii: _\n   * - A dollar sign                        Ascii: $\n   * - A latin letter with accents          Unicode: \\u00C0 - \\u02AF\n   * - A greek letter                       Unicode: \\u0370 - \\u03FF\n   * - A mathematical alphanumeric symbol   Unicode: \\u{1D400} - \\u{1D7FF} excluding invalid code points\n   *\n   * The previous and next characters are needed to determine whether\n   * this character is part of a unicode surrogate pair.\n   *\n   * @param {string} c      Current character in the expression\n   * @param {string} cPrev  Previous character\n   * @param {string} cNext  Next character\n   * @return {boolean}\n   */\n  parse.isAlpha = function isAlpha (c, cPrev, cNext) {\n    return parse.isValidLatinOrGreek(c) ||\n        parse.isValidMathSymbol(c, cNext) ||\n        parse.isValidMathSymbol(cPrev, c)\n  }\n\n  /**\n   * Test whether a character is a valid latin, greek, or letter-like character\n   * @param {string} c\n   * @return {boolean}\n   */\n  parse.isValidLatinOrGreek = function isValidLatinOrGreek (c) {\n    return /^[a-zA-Z_$\\u00C0-\\u02AF\\u0370-\\u03FF\\u2100-\\u214F]$/.test(c)\n  }\n\n  /**\n   * Test whether two given 16 bit characters form a surrogate pair of a\n   * unicode math symbol.\n   *\n   * https://unicode-table.com/en/\n   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode\n   *\n   * Note: In ES6 will be unicode aware:\n   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes\n   * https://mathiasbynens.be/notes/es6-unicode-regex\n   *\n   * @param {string} high\n   * @param {string} low\n   * @return {boolean}\n   */\n  parse.isValidMathSymbol = function isValidMathSymbol (high, low) {\n    return /^[\\uD835]$/.test(high) &&\n        /^[\\uDC00-\\uDFFF]$/.test(low) &&\n        /^[^\\uDC55\\uDC9D\\uDCA0\\uDCA1\\uDCA3\\uDCA4\\uDCA7\\uDCA8\\uDCAD\\uDCBA\\uDCBC\\uDCC4\\uDD06\\uDD0B\\uDD0C\\uDD15\\uDD1D\\uDD3A\\uDD3F\\uDD45\\uDD47-\\uDD49\\uDD51\\uDEA6\\uDEA7\\uDFCC\\uDFCD]$/.test(low)\n  }\n\n  /**\n   * Check whether given character c is a white space character: space, tab, or enter\n   * @param {string} c\n   * @param {number} nestingLevel\n   * @return {boolean}\n   */\n  parse.isWhitespace = function isWhitespace (c, nestingLevel) {\n    // TODO: also take '\\r' carriage return as newline? Or does that give problems on mac?\n    return c === ' ' || c === '\\t' || c === '\\u00A0' || (c === '\\n' && nestingLevel > 0)\n  }\n\n  /**\n   * Test whether the character c is a decimal mark (dot).\n   * This is the case when it's not the start of a delimiter '.*', './', or '.^'\n   * @param {string} c\n   * @param {string} cNext\n   * @return {boolean}\n   */\n  parse.isDecimalMark = function isDecimalMark (c, cNext) {\n    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^'\n  }\n\n  /**\n   * checks if the given char c is a digit or dot\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isDigitDot = function isDigitDot (c) {\n    return ((c >= '0' && c <= '9') || c === '.')\n  }\n\n  /**\n   * checks if the given char c is a digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isDigit = function isDigit (c) {\n    return (c >= '0' && c <= '9')\n  }\n\n  /**\n   * checks if the given char c is a hex digit\n   * @param {string} c   a string with one character\n   * @return {boolean}\n   */\n  parse.isHexDigit = function isHexDigit (c) {\n    return ((c >= '0' && c <= '9') ||\n            (c >= 'a' && c <= 'f') ||\n            (c >= 'A' && c <= 'F'))\n  }\n\n  /**\n   * Start of the parse levels below, in order of precedence\n   * @return {Node} node\n   * @private\n   */\n  function parseStart (expression, extraNodes) {\n    const state = initialState()\n    Object.assign(state, { expression, extraNodes })\n    getToken(state)\n\n    const node = parseBlock(state)\n\n    // check for garbage at the end of the expression\n    // an expression ends with a empty character '' and tokenType DELIMITER\n    if (state.token !== '') {\n      if (state.tokenType === TOKENTYPE.DELIMITER) {\n        // user entered a not existing operator like \"//\"\n\n        // TODO: give hints for aliases, for example with \"<>\" give as hint \" did you mean !== ?\"\n        throw createError(state, 'Unexpected operator ' + state.token)\n      } else {\n        throw createSyntaxError(state, 'Unexpected part \"' + state.token + '\"')\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a block with expressions. Expressions can be separated by a newline\n   * character '\\n', or by a semicolon ';'. In case of a semicolon, no output\n   * of the preceding line is returned.\n   * @return {Node} node\n   * @private\n   */\n  function parseBlock (state) {\n    let node\n    const blocks = []\n    let visible\n\n    if (state.token !== '' && state.token !== '\\n' && state.token !== ';') {\n      node = parseAssignment(state)\n      if (state.comment) {\n        node.comment = state.comment\n      }\n    }\n\n    // TODO: simplify this loop\n    while (state.token === '\\n' || state.token === ';') { // eslint-disable-line no-unmodified-loop-condition\n      if (blocks.length === 0 && node) {\n        visible = (state.token !== ';')\n        blocks.push({ node, visible })\n      }\n\n      getToken(state)\n      if (state.token !== '\\n' && state.token !== ';' && state.token !== '') {\n        node = parseAssignment(state)\n        if (state.comment) {\n          node.comment = state.comment\n        }\n\n        visible = (state.token !== ';')\n        blocks.push({ node, visible })\n      }\n    }\n\n    if (blocks.length > 0) {\n      return new BlockNode(blocks)\n    } else {\n      if (!node) {\n        node = new ConstantNode(undefined)\n        if (state.comment) {\n          node.comment = state.comment\n        }\n      }\n\n      return node\n    }\n  }\n\n  /**\n   * Assignment of a function or variable,\n   * - can be a variable like 'a=2.3'\n   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'\n   * - defining a function like 'f(x) = x^2'\n   * @return {Node} node\n   * @private\n   */\n  function parseAssignment (state) {\n    let name, args, value, valid\n\n    const node = parseConditional(state)\n\n    if (state.token === '=') {\n      if (isSymbolNode(node)) {\n        // parse a variable assignment like 'a = 2/3'\n        name = node.name\n        getTokenSkipNewline(state)\n        value = parseAssignment(state)\n        return new AssignmentNode(new SymbolNode(name), value)\n      } else if (isAccessorNode(node)) {\n        // parse a matrix subset assignment like 'A[1,2] = 4'\n        getTokenSkipNewline(state)\n        value = parseAssignment(state)\n        return new AssignmentNode(node.object, node.index, value)\n      } else if (isFunctionNode(node) && isSymbolNode(node.fn)) {\n        // parse function assignment like 'f(x) = x^2'\n        valid = true\n        args = []\n\n        name = node.name\n        node.args.forEach(function (arg, index) {\n          if (isSymbolNode(arg)) {\n            args[index] = arg.name\n          } else {\n            valid = false\n          }\n        })\n\n        if (valid) {\n          getTokenSkipNewline(state)\n          value = parseAssignment(state)\n          return new FunctionAssignmentNode(name, args, value)\n        }\n      }\n\n      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =')\n    }\n\n    return node\n  }\n\n  /**\n   * conditional operation\n   *\n   *     condition ? truePart : falsePart\n   *\n   * Note: conditional operator is right-associative\n   *\n   * @return {Node} node\n   * @private\n   */\n  function parseConditional (state) {\n    let node = parseLogicalOr(state)\n\n    while (state.token === '?') { // eslint-disable-line no-unmodified-loop-condition\n      // set a conditional level, the range operator will be ignored as long\n      // as conditionalLevel === state.nestingLevel.\n      const prev = state.conditionalLevel\n      state.conditionalLevel = state.nestingLevel\n      getTokenSkipNewline(state)\n\n      const condition = node\n      const trueExpr = parseAssignment(state)\n\n      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected')\n\n      state.conditionalLevel = null\n      getTokenSkipNewline(state)\n\n      const falseExpr = parseAssignment(state) // Note: check for conditional operator again, right associativity\n\n      node = new ConditionalNode(condition, trueExpr, falseExpr)\n\n      // restore the previous conditional level\n      state.conditionalLevel = prev\n    }\n\n    return node\n  }\n\n  /**\n   * logical or, 'x or y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalOr (state) {\n    let node = parseLogicalXor(state)\n\n    while (state.token === 'or') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * logical exclusive or, 'x xor y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalXor (state) {\n    let node = parseLogicalAnd(state)\n\n    while (state.token === 'xor') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * logical and, 'x and y'\n   * @return {Node} node\n   * @private\n   */\n  function parseLogicalAnd (state) {\n    let node = parseBitwiseOr(state)\n\n    while (state.token === 'and') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise or, 'x | y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseOr (state) {\n    let node = parseBitwiseXor(state)\n\n    while (state.token === '|') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise exclusive or (xor), 'x ^| y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseXor (state) {\n    let node = parseBitwiseAnd(state)\n\n    while (state.token === '^|') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * bitwise and, 'x & y'\n   * @return {Node} node\n   * @private\n   */\n  function parseBitwiseAnd (state) {\n    let node = parseRelational(state)\n\n    while (state.token === '&') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a chained conditional, like 'a > b >= c'\n   * @return {Node} node\n   */\n  function parseRelational (state) {\n    const params = [parseShift(state)]\n    const conditionals = []\n\n    const operators = {\n      '==': 'equal',\n      '!=': 'unequal',\n      '<': 'smaller',\n      '>': 'larger',\n      '<=': 'smallerEq',\n      '>=': 'largerEq'\n    }\n\n    while (hasOwnProperty(operators, state.token)) { // eslint-disable-line no-unmodified-loop-condition\n      const cond = { name: state.token, fn: operators[state.token] }\n      conditionals.push(cond)\n      getTokenSkipNewline(state)\n      params.push(parseShift(state))\n    }\n\n    if (params.length === 1) {\n      return params[0]\n    } else if (params.length === 2) {\n      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params)\n    } else {\n      return new RelationalNode(conditionals.map(c => c.fn), params)\n    }\n  }\n\n  /**\n   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift\n   * @return {Node} node\n   * @private\n   */\n  function parseShift (state) {\n    let node, name, fn, params\n\n    node = parseConversion(state)\n\n    const operators = {\n      '<<': 'leftShift',\n      '>>': 'rightArithShift',\n      '>>>': 'rightLogShift'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n      params = [node, parseConversion(state)]\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * conversion operators 'to' and 'in'\n   * @return {Node} node\n   * @private\n   */\n  function parseConversion (state) {\n    let node, name, fn, params\n\n    node = parseRange(state)\n\n    const operators = {\n      to: 'to',\n      in: 'to' // alias of 'to'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n\n      if (name === 'in' && '])},;'.includes(state.token)) {\n        // end of expression -> this is the unit 'in' ('inch')\n        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true)\n      } else {\n        // operator 'a to b' or 'a in b'\n        params = [node, parseRange(state)]\n        node = new OperatorNode(name, fn, params)\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * parse range, \"start:end\", \"start:step:end\", \":\", \"start:\", \":end\", etc\n   * @return {Node} node\n   * @private\n   */\n  function parseRange (state) {\n    let node\n    const params = []\n\n    if (state.token === ':') {\n      // implicit start=1 (one-based)\n      node = new ConstantNode(1)\n    } else {\n      // explicit start\n      node = parseAddSubtract(state)\n    }\n\n    if (state.token === ':' && (state.conditionalLevel !== state.nestingLevel)) {\n      // we ignore the range operator when a conditional operator is being processed on the same level\n      params.push(node)\n\n      // parse step and end\n      while (state.token === ':' && params.length < 3) { // eslint-disable-line no-unmodified-loop-condition\n        getTokenSkipNewline(state)\n\n        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {\n          // implicit end\n          params.push(new SymbolNode('end'))\n        } else {\n          // explicit end\n          params.push(parseAddSubtract(state))\n        }\n      }\n\n      if (params.length === 3) {\n        // params = [start, step, end]\n        node = new RangeNode(params[0], params[2], params[1]) // start, end, step\n      } else { // length === 2\n        // params = [start, end]\n        node = new RangeNode(params[0], params[1]) // start, end\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * add or subtract\n   * @return {Node} node\n   * @private\n   */\n  function parseAddSubtract (state) {\n    let node, name, fn, params\n\n    node = parseMultiplyDivideModulusPercentage(state)\n\n    const operators = {\n      '+': 'add',\n      '-': 'subtract'\n    }\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getTokenSkipNewline(state)\n      const rightNode = parseMultiplyDivideModulusPercentage(state)\n      if (rightNode.isPercentage) {\n        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])]\n      } else {\n        params = [node, rightNode]\n      }\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * multiply, divide, modulus, percentage\n   * @return {Node} node\n   * @private\n   */\n  function parseMultiplyDivideModulusPercentage (state) {\n    let node, last, name, fn\n\n    node = parseImplicitMultiplication(state)\n    last = node\n\n    const operators = {\n      '*': 'multiply',\n      '.*': 'dotMultiply',\n      '/': 'divide',\n      './': 'dotDivide',\n      '%': 'mod',\n      mod: 'mod'\n    }\n\n    while (true) {\n      if (hasOwnProperty(operators, state.token)) {\n        // explicit operators\n        name = state.token\n        fn = operators[name]\n\n        getTokenSkipNewline(state)\n\n        if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {\n          // If the expression contains only %, then treat that as /100\n          if (state.token !== '' && operators[state.token]) {\n            const left = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true)\n            name = state.token\n            fn = operators[name]\n            getTokenSkipNewline(state)\n            last = parseImplicitMultiplication(state)\n\n            node = new OperatorNode(name, fn, [left, last])\n          } else { node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true) }\n          // return node\n        } else {\n          last = parseImplicitMultiplication(state)\n          node = new OperatorNode(name, fn, [node, last])\n        }\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * implicit multiplication\n   * @return {Node} node\n   * @private\n   */\n  function parseImplicitMultiplication (state) {\n    let node, last\n\n    node = parseRule2(state)\n    last = node\n\n    while (true) {\n      if ((state.tokenType === TOKENTYPE.SYMBOL) ||\n          (state.token === 'in' && isConstantNode(node)) ||\n          (state.token === 'in' && isOperatorNode(node) && node.fn === 'unaryMinus' && isConstantNode(node.args[0])) ||\n          (state.tokenType === TOKENTYPE.NUMBER &&\n              !isConstantNode(last) &&\n              (!isOperatorNode(last) || last.op === '!')) ||\n          (state.token === '(')) {\n        // parse implicit multiplication\n        //\n        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'\n        // number:      implicit multiplication like '(2+3)2'\n        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'\n        last = parseRule2(state)\n        node = new OperatorNode('*', 'multiply', [node, last], true /* implicit */)\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Infamous \"rule 2\" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370\n   * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164\n   * Explicit division gets higher precedence than implicit multiplication\n   * when the division matches this pattern:\n   *   [unaryPrefixOp]?[number] / [number] [symbol]\n   * @return {Node} node\n   * @private\n   */\n  function parseRule2 (state) {\n    let node = parseUnary(state)\n    let last = node\n    const tokenStates = []\n\n    while (true) {\n      // Match the \"number /\" part of the pattern \"number / number symbol\"\n      if (state.token === '/' && rule2Node(last)) {\n        // Look ahead to see if the next token is a number\n        tokenStates.push(Object.assign({}, state))\n        getTokenSkipNewline(state)\n\n        // Match the \"number / number\" part of the pattern\n        if (state.tokenType === TOKENTYPE.NUMBER) {\n          // Look ahead again\n          tokenStates.push(Object.assign({}, state))\n          getTokenSkipNewline(state)\n\n          // Match the \"symbol\" part of the pattern, or a left parenthesis\n          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(' || state.token === 'in') {\n            // We've matched the pattern \"number / number symbol\".\n            // Rewind once and build the \"number / number\" node; the symbol will be consumed later\n            Object.assign(state, tokenStates.pop())\n            tokenStates.pop()\n            last = parseUnary(state)\n            node = new OperatorNode('/', 'divide', [node, last])\n          } else {\n            // Not a match, so rewind\n            tokenStates.pop()\n            Object.assign(state, tokenStates.pop())\n            break\n          }\n        } else {\n          // Not a match, so rewind\n          Object.assign(state, tokenStates.pop())\n          break\n        }\n      } else {\n        break\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Unary plus and minus, and logical and bitwise not\n   * @return {Node} node\n   * @private\n   */\n  function parseUnary (state) {\n    let name, params, fn\n    const operators = {\n      '-': 'unaryMinus',\n      '+': 'unaryPlus',\n      '~': 'bitNot',\n      not: 'not'\n    }\n\n    if (hasOwnProperty(operators, state.token)) {\n      fn = operators[state.token]\n      name = state.token\n\n      getTokenSkipNewline(state)\n      params = [parseUnary(state)]\n\n      return new OperatorNode(name, fn, params)\n    }\n\n    return parsePow(state)\n  }\n\n  /**\n   * power\n   * Note: power operator is right associative\n   * @return {Node} node\n   * @private\n   */\n  function parsePow (state) {\n    let node, name, fn, params\n\n    node = parseNullishCoalescing(state)\n\n    if (state.token === '^' || state.token === '.^') {\n      name = state.token\n      fn = (name === '^') ? 'pow' : 'dotPow'\n\n      getTokenSkipNewline(state)\n      params = [node, parseUnary(state)] // Go back to unary, we can have '2^-3'\n      node = new OperatorNode(name, fn, params)\n    }\n\n    return node\n  }\n\n  /**\n   * nullish coalescing operator\n   * @return {Node} node\n   * @private\n   */\n  function parseNullishCoalescing (state) {\n    let node = parseLeftHandOperators(state)\n\n    while (state.token === '??') { // eslint-disable-line no-unmodified-loop-condition\n      getTokenSkipNewline(state)\n      node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)])\n    }\n\n    return node\n  }\n\n  /**\n   * Left hand operators: factorial x!, ctranspose x'\n   * @return {Node} node\n   * @private\n   */\n  function parseLeftHandOperators (state) {\n    let node, name, fn, params\n\n    node = parseCustomNodes(state)\n\n    const operators = {\n      '!': 'factorial',\n      '\\'': 'ctranspose'\n    }\n\n    while (hasOwnProperty(operators, state.token)) {\n      name = state.token\n      fn = operators[name]\n\n      getToken(state)\n      params = [node]\n\n      node = new OperatorNode(name, fn, params)\n      node = parseAccessors(state, node)\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a custom node handler. A node handler can be used to process\n   * nodes in a custom way, for example for handling a plot.\n   *\n   * A handler must be passed as second argument of the parse function.\n   * - must extend math.Node\n   * - must contain a function _compile(defs: Object) : string\n   * - must contain a function find(filter: Object) : Node[]\n   * - must contain a function toString() : string\n   * - the constructor is called with a single argument containing all parameters\n   *\n   * For example:\n   *\n   *     nodes = {\n   *       'plot': PlotHandler\n   *     }\n   *\n   * The constructor of the handler is called as:\n   *\n   *     node = new PlotHandler(params)\n   *\n   * The handler will be invoked when evaluating an expression like:\n   *\n   *     node = math.parse('plot(sin(x), x)', nodes)\n   *\n   * @return {Node} node\n   * @private\n   */\n  function parseCustomNodes (state) {\n    let params = []\n\n    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {\n      const CustomNode = state.extraNodes[state.token]\n\n      getToken(state)\n\n      // parse parameters\n      if (state.token === '(') {\n        params = []\n\n        openParams(state)\n        getToken(state)\n\n        if (state.token !== ')') {\n          params.push(parseAssignment(state))\n\n          // parse a list with parameters\n          while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n            params.push(parseAssignment(state))\n          }\n        }\n\n        if (state.token !== ')') {\n          throw createSyntaxError(state, 'Parenthesis ) expected')\n        }\n        closeParams(state)\n        getToken(state)\n      }\n\n      // create a new custom node\n      // noinspection JSValidateTypes\n      return new CustomNode(params)\n    }\n\n    return parseSymbol(state)\n  }\n\n  /**\n   * parse symbols: functions, variables, constants, units\n   * @return {Node} node\n   * @private\n   */\n  function parseSymbol (state) {\n    let node, name\n\n    if (state.tokenType === TOKENTYPE.SYMBOL ||\n        (state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS)) {\n      name = state.token\n\n      getToken(state)\n\n      if (hasOwnProperty(CONSTANTS, name)) { // true, false, null, ...\n        node = new ConstantNode(CONSTANTS[name])\n      } else if (NUMERIC_CONSTANTS.includes(name)) { // NaN, Infinity\n        node = new ConstantNode(numeric(name, 'number'))\n      } else {\n        node = new SymbolNode(name)\n      }\n\n      // parse function parameters and matrix index\n      node = parseAccessors(state, node)\n      return node\n    }\n\n    return parseString(state)\n  }\n\n  /**\n   * parse accessors:\n   * - function invocation in round brackets (...), for example sqrt(2)\n   * - index enclosed in square brackets [...], for example A[2,3]\n   * - dot notation for properties, like foo.bar\n   * @param {Object} state\n   * @param {Node} node    Node on which to apply the parameters. If there\n   *                       are no parameters in the expression, the node\n   *                       itself is returned\n   * @param {string[]} [types]  Filter the types of notations\n   *                            can be ['(', '[', '.']\n   * @return {Node} node\n   * @private\n   */\n  function parseAccessors (state, node, types) {\n    let params\n\n    while ((state.token === '(' || state.token === '[' || state.token === '.') &&\n        (!types || types.includes(state.token))) { // eslint-disable-line no-unmodified-loop-condition\n      params = []\n\n      if (state.token === '(') {\n        if (isSymbolNode(node) || isAccessorNode(node)) {\n          // function invocation like fn(2, 3) or obj.fn(2, 3)\n          openParams(state)\n          getToken(state)\n\n          if (state.token !== ')') {\n            params.push(parseAssignment(state))\n\n            // parse a list with parameters\n            while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n              getToken(state)\n              params.push(parseAssignment(state))\n            }\n          }\n\n          if (state.token !== ')') {\n            throw createSyntaxError(state, 'Parenthesis ) expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          node = new FunctionNode(node, params)\n        } else {\n          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)\n          // don't parse it here but let it be handled by parseImplicitMultiplication\n          // with correct precedence\n          return node\n        }\n      } else if (state.token === '[') {\n        // index notation like variable[2, 3]\n        openParams(state)\n        getToken(state)\n\n        if (state.token !== ']') {\n          params.push(parseAssignment(state))\n\n          // parse a list with parameters\n          while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n            params.push(parseAssignment(state))\n          }\n        }\n\n        if (state.token !== ']') {\n          throw createSyntaxError(state, 'Parenthesis ] expected')\n        }\n        closeParams(state)\n        getToken(state)\n\n        node = new AccessorNode(node, new IndexNode(params))\n      } else {\n        // dot notation like variable.prop\n        getToken(state)\n\n        const isPropertyName = state.tokenType === TOKENTYPE.SYMBOL ||\n          (state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS)\n        if (!isPropertyName) {\n          throw createSyntaxError(state, 'Property name expected after dot')\n        }\n\n        params.push(new ConstantNode(state.token))\n        getToken(state)\n\n        const dotNotation = true\n        node = new AccessorNode(node, new IndexNode(params, dotNotation))\n      }\n    }\n\n    return node\n  }\n\n  /**\n   * Parse a single or double quoted string.\n   * @return {Node} node\n   * @private\n   */\n  function parseString (state) {\n    let node, str\n\n    if (state.token === '\"' || state.token === \"'\") {\n      str = parseStringToken(state, state.token)\n\n      // create constant\n      node = new ConstantNode(str)\n\n      // parse index parameters\n      node = parseAccessors(state, node)\n\n      return node\n    }\n\n    return parseMatrix(state)\n  }\n\n  /**\n   * Parse a string surrounded by single or double quotes\n   * @param {Object} state\n   * @param {\"'\" | \"\\\"\"} quote\n   * @return {string}\n   */\n  function parseStringToken (state, quote) {\n    let str = ''\n\n    while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {\n      if (currentCharacter(state) === '\\\\') {\n        next(state)\n\n        const char = currentCharacter(state)\n        const escapeChar = ESCAPE_CHARACTERS[char]\n        if (escapeChar !== undefined) {\n          // an escaped control character like \\\" or \\n\n          str += escapeChar\n          state.index += 1\n        } else if (char === 'u') {\n          // escaped unicode character\n          const unicode = state.expression.slice(state.index + 1, state.index + 5)\n          if (/^[0-9A-Fa-f]{4}$/.test(unicode)) { // test whether the string holds four hexadecimal values\n            str += String.fromCharCode(parseInt(unicode, 16))\n            state.index += 5\n          } else {\n            throw createSyntaxError(state, `Invalid unicode character \\\\u${unicode}`)\n          }\n        } else {\n          throw createSyntaxError(state, `Bad escape character \\\\${char}`)\n        }\n      } else {\n        // any regular character\n        str += currentCharacter(state)\n        next(state)\n      }\n    }\n\n    getToken(state)\n    if (state.token !== quote) {\n      throw createSyntaxError(state, `End of string ${quote} expected`)\n    }\n    getToken(state)\n\n    return str\n  }\n\n  /**\n   * parse the matrix\n   * @return {Node} node\n   * @private\n   */\n  function parseMatrix (state) {\n    let array, params, rows, cols\n\n    if (state.token === '[') {\n      // matrix [...]\n      openParams(state)\n      getToken(state)\n\n      if (state.token !== ']') {\n        // this is a non-empty matrix\n        const row = parseRow(state)\n\n        if (state.token === ';') {\n          // 2 dimensional array\n          rows = 1\n          params = [row]\n\n          // the rows of the matrix are separated by dot-comma's\n          while (state.token === ';') { // eslint-disable-line no-unmodified-loop-condition\n            getToken(state)\n\n            if (state.token !== ']') {\n              params[rows] = parseRow(state)\n              rows++\n            }\n          }\n\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          // check if the number of columns matches in all rows\n          cols = params[0].items.length\n          for (let r = 1; r < rows; r++) {\n            if (params[r].items.length !== cols) {\n              throw createError(state, 'Column dimensions mismatch ' +\n                  '(' + params[r].items.length + ' !== ' + cols + ')')\n            }\n          }\n\n          array = new ArrayNode(params)\n        } else {\n          // 1 dimensional vector\n          if (state.token !== ']') {\n            throw createSyntaxError(state, 'End of matrix ] expected')\n          }\n          closeParams(state)\n          getToken(state)\n\n          array = row\n        }\n      } else {\n        // this is an empty matrix \"[ ]\"\n        closeParams(state)\n        getToken(state)\n        array = new ArrayNode([])\n      }\n\n      return parseAccessors(state, array)\n    }\n\n    return parseObject(state)\n  }\n\n  /**\n   * Parse a single comma-separated row from a matrix, like 'a, b, c'\n   * @return {ArrayNode} node\n   */\n  function parseRow (state) {\n    const params = [parseAssignment(state)]\n    let len = 1\n\n    while (state.token === ',') { // eslint-disable-line no-unmodified-loop-condition\n      getToken(state)\n\n      // parse expression\n      if (state.token !== ']' && state.token !== ';') {\n        params[len] = parseAssignment(state)\n        len++\n      }\n    }\n\n    return new ArrayNode(params)\n  }\n\n  /**\n   * parse an object, enclosed in angle brackets{...}, for example {value: 2}\n   * @return {Node} node\n   * @private\n   */\n  function parseObject (state) {\n    if (state.token === '{') {\n      openParams(state)\n      let key\n\n      const properties = {}\n      do {\n        getToken(state)\n\n        if (state.token !== '}') {\n          // parse key\n          if (state.token === '\"' || state.token === \"'\") {\n            key = parseStringToken(state, state.token)\n          } else if (state.tokenType === TOKENTYPE.SYMBOL || (state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS)) {\n            key = state.token\n            getToken(state)\n          } else {\n            throw createSyntaxError(state, 'Symbol or string expected as object key')\n          }\n\n          // parse key/value separator\n          if (state.token !== ':') {\n            throw createSyntaxError(state, 'Colon : expected after object key')\n          }\n          getToken(state)\n\n          // parse key\n          properties[key] = parseAssignment(state)\n        }\n      }\n      while (state.token === ',') // eslint-disable-line no-unmodified-loop-condition\n\n      if (state.token !== '}') {\n        throw createSyntaxError(state, 'Comma , or bracket } expected after object value')\n      }\n      closeParams(state)\n      getToken(state)\n\n      let node = new ObjectNode(properties)\n\n      // parse index parameters\n      node = parseAccessors(state, node)\n\n      return node\n    }\n\n    return parseNumber(state)\n  }\n\n  /**\n   * parse a number\n   * @return {Node} node\n   * @private\n   */\n  function parseNumber (state) {\n    let numberStr\n\n    if (state.tokenType === TOKENTYPE.NUMBER) {\n      // this is a number\n      numberStr = state.token\n      getToken(state)\n\n      const numericType = safeNumberType(numberStr, config)\n      const value = numeric(numberStr, numericType)\n\n      return new ConstantNode(value)\n    }\n\n    return parseParentheses(state)\n  }\n\n  /**\n   * parentheses\n   * @return {Node} node\n   * @private\n   */\n  function parseParentheses (state) {\n    let node\n\n    // check if it is a parenthesized expression\n    if (state.token === '(') {\n      // parentheses (...)\n      openParams(state)\n      getToken(state)\n\n      node = parseAssignment(state) // start again\n\n      if (state.token !== ')') {\n        throw createSyntaxError(state, 'Parenthesis ) expected')\n      }\n      closeParams(state)\n      getToken(state)\n\n      node = new ParenthesisNode(node)\n      node = parseAccessors(state, node)\n      return node\n    }\n\n    return parseEnd(state)\n  }\n\n  /**\n   * Evaluated when the expression is not yet ended but expected to end\n   * @return {Node} res\n   * @private\n   */\n  function parseEnd (state) {\n    if (state.token === '') {\n      // syntax error or unexpected end of expression\n      throw createSyntaxError(state, 'Unexpected end of expression')\n    } else {\n      throw createSyntaxError(state, 'Value expected')\n    }\n  }\n\n  /**\n   * Shortcut for getting the current row value (one based)\n   * Returns the line of the currently handled expression\n   * @private\n   */\n  /* TODO: implement keeping track on the row number\n  function row () {\n    return null\n  }\n  */\n\n  /**\n   * Shortcut for getting the current col value (one based)\n   * Returns the column (position) where the last state.token starts\n   * @private\n   */\n  function col (state) {\n    return state.index - state.token.length + 1\n  }\n\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {SyntaxError} instantiated error\n   * @private\n   */\n  function createSyntaxError (state, message) {\n    const c = col(state)\n    const error = new SyntaxError(message + ' (char ' + c + ')')\n    error.char = c\n\n    return error\n  }\n\n  /**\n   * Create an error\n   * @param {Object} state\n   * @param {string} message\n   * @return {Error} instantiated error\n   * @private\n   */\n  function createError (state, message) {\n    const c = col(state)\n    const error = new SyntaxError(message + ' (char ' + c + ')')\n    error.char = c\n\n    return error\n  }\n\n  // Now that we can parse, automatically convert strings to Nodes by parsing\n  typed.addConversion({ from: 'string', to: 'Node', convert: parse })\n\n  return parse\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'compile'\nconst dependencies = ['typed', 'parse']\n\nexport const createCompile = /* #__PURE__ */ factory(name, dependencies, ({ typed, parse }) => {\n  /**\n   * Parse and compile an expression.\n   * Returns a an object with a function `evaluate([scope])` to evaluate the\n   * compiled expression.\n   *\n   * Syntax:\n   *\n   *     math.compile(expr)                       // returns one node\n   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes\n   *\n   * Examples:\n   *\n   *     const code1 = math.compile('sqrt(3^2 + 4^2)')\n   *     code1.evaluate() // 5\n   *\n   *     let scope = {a: 3, b: 4}\n   *     const code2 = math.compile('a * b') // 12\n   *     code2.evaluate(scope) // 12\n   *     scope.a = 5\n   *     code2.evaluate(scope) // 20\n   *\n   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])\n   *     nodes[2].evaluate() // 12\n   *\n   * See also:\n   *\n   *    parse, evaluate\n   *\n   * @param {string | string[] | Array | Matrix} expr\n   *            The expression to be compiled\n   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code\n   *            An object with the compiled expression\n   * @throws {Error}\n   */\n  return typed(name, {\n    string: function (expr) {\n      return parse(expr).compile()\n    },\n\n    'Array | Matrix': function (expr) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile()\n      })\n    }\n  })\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { createEmptyMap } from '../../utils/map.js'\n\nconst name = 'evaluate'\nconst dependencies = ['typed', 'parse']\n\nexport const createEvaluate = /* #__PURE__ */ factory(name, dependencies, ({ typed, parse }) => {\n  /**\n   * Evaluate an expression.\n   *\n   * The expression parser does not use JavaScript. Its syntax is close\n   * to JavaScript but more suited for mathematical expressions.\n   * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn\n   * the syntax and get an overview of the exact differences from JavaScript.\n   *\n   * Note the evaluating arbitrary expressions may involve security risks,\n   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.\n   *\n   * Syntax:\n   *\n   *     math.evaluate(expr)\n   *     math.evaluate(expr, scope)\n   *     math.evaluate([expr1, expr2, expr3, ...])\n   *     math.evaluate([expr1, expr2, expr3, ...], scope)\n   *\n   * Example:\n   *\n   *     math.evaluate('(2+3)/4')                // 1.25\n   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *     math.evaluate('sqrt(-4)')               // 2i\n   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]\n   *\n   *     let scope = {a:3, b:4}\n   *     math.evaluate('a * b', scope)           // 12\n   *\n   * See also:\n   *\n   *    parse, compile\n   *\n   * @param {string | string[] | Matrix} expr   The expression to be evaluated\n   * @param {Object} [scope]                    Scope to read/write variables\n   * @return {*} The result of the expression\n   * @throws {Error}\n   */\n  return typed(name, {\n    string: function (expr) {\n      const scope = createEmptyMap()\n      return parse(expr).compile().evaluate(scope)\n    },\n\n    'string, Map | Object': function (expr, scope) {\n      return parse(expr).compile().evaluate(scope)\n    },\n\n    'Array | Matrix': function (expr) {\n      const scope = createEmptyMap()\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope)\n      })\n    },\n\n    'Array | Matrix, Map | Object': function (expr, scope) {\n      return deepMap(expr, function (entry) {\n        return parse(entry).compile().evaluate(scope)\n      })\n    }\n  })\n})\n","import { factory } from '../utils/factory.js'\nimport { isFunction } from '../utils/is.js'\nimport { createEmptyMap, toObject } from '../utils/map.js'\n\nconst name = 'Parser'\nconst dependencies = ['evaluate', 'parse']\n\nexport const createParserClass = /* #__PURE__ */ factory(name, dependencies, ({ evaluate, parse }) => {\n  /**\n   * @constructor Parser\n   * Parser contains methods to evaluate or parse expressions, and has a number\n   * of convenience methods to get, set, and remove variables from memory. Parser\n   * keeps a scope containing variables in memory, which is used for all\n   * evaluations.\n   *\n   * Methods:\n   *    const result = parser.evaluate(expr)  // evaluate an expression\n   *    const value = parser.get(name)        // retrieve a variable from the parser\n   *    const values = parser.getAll()        // retrieve all defined variables\n   *    parser.set(name, value)               // set a variable in the parser\n   *    parser.remove(name)                   // clear a variable from the\n   *                                          // parsers scope\n   *    parser.clear()                        // clear the parsers scope\n   *\n   * Example usage:\n   *    const parser = new Parser()\n   *    // Note: there is a convenience method which can be used instead:\n   *    // const parser = new math.parser()\n   *\n   *    // evaluate expressions\n   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5\n   *    parser.evaluate('sqrt(-4)')               // 2i\n   *    parser.evaluate('2 inch in cm')           // 5.08 cm\n   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476\n   *\n   *    // define variables and functions\n   *    parser.evaluate('x = 7 / 2')              // 3.5\n   *    parser.evaluate('x + 3')                  // 6.5\n   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)\n   *    parser.evaluate('f(2, 3)')                // 8\n   *\n   *    // get and set variables and functions\n   *    const x = parser.get('x')                 // 3.5\n   *    const f = parser.get('f')                 // function\n   *    const g = f(3, 2)                         // 9\n   *    parser.set('h', 500)\n   *    const i = parser.evaluate('h / 2')        // 250\n   *    parser.set('hello', function (name) {\n   *        return 'hello, ' + name + '!'\n   *    })\n   *    parser.evaluate('hello(\"user\")')          // \"hello, user!\"\n   *\n   *    // clear defined functions and variables\n   *    parser.clear()\n   *\n   */\n  function Parser () {\n    if (!(this instanceof Parser)) {\n      throw new SyntaxError(\n        'Constructor must be called with the new operator')\n    }\n\n    Object.defineProperty(this, 'scope', {\n      value: createEmptyMap(),\n      writable: false\n    })\n  }\n\n  /**\n   * Attach type information\n   */\n  Parser.prototype.type = 'Parser'\n  Parser.prototype.isParser = true\n\n  /**\n   * Parse and evaluate the given expression\n   * @param {string | string[]} expr   A string containing an expression,\n   *                                   for example \"2+3\", or a list with expressions\n   * @return {*} result     The result, or undefined when the expression was empty\n   * @throws {Error}\n   */\n  Parser.prototype.evaluate = function (expr) {\n    // TODO: validate arguments\n    return evaluate(expr, this.scope)\n  }\n\n  /**\n   * Get a variable (a function or variable) by name from the parsers scope.\n   * Returns undefined when not found\n   * @param {string} name\n   * @return {* | undefined} value\n   */\n  Parser.prototype.get = function (name) {\n    // TODO: validate arguments\n    if (this.scope.has(name)) {\n      return this.scope.get(name)\n    }\n  }\n\n  /**\n   * Get a map with all defined variables\n   * @return {Object} values\n   */\n  Parser.prototype.getAll = function () {\n    return toObject(this.scope)\n  }\n\n  /**\n   * Get a map with all defined variables\n   * @return {Map} values\n   */\n  Parser.prototype.getAllAsMap = function () {\n    return this.scope\n  }\n\n  function isValidVariableName (name) {\n    if (name.length === 0) { return false }\n\n    for (let i = 0; i < name.length; i++) {\n      const cPrev = name.charAt(i - 1)\n      const c = name.charAt(i)\n      const cNext = name.charAt(i + 1)\n      const valid = parse.isAlpha(c, cPrev, cNext) || (i > 0 && parse.isDigit(c))\n\n      if (!valid) {\n        return false\n      }\n    }\n\n    return true\n  }\n\n  /**\n   * Set a symbol (a function or variable) by name from the parsers scope.\n   * @param {string} name\n   * @param {* | undefined} value\n   */\n  Parser.prototype.set = function (name, value) {\n    if (!isValidVariableName(name)) {\n      throw new Error(`Invalid variable name: '${name}'. Variable names must follow the specified rules.`)\n    }\n    this.scope.set(name, value)\n    return value\n  }\n\n  /**\n   * Remove a variable from the parsers scope\n   * @param {string} name\n   */\n  Parser.prototype.remove = function (name) {\n    this.scope.delete(name)\n  }\n\n  /**\n   * Clear the scope with variables and functions\n   */\n  Parser.prototype.clear = function () {\n    this.scope.clear()\n  }\n\n  Parser.prototype.toJSON = function () {\n    const json = {\n      mathjs: 'Parser',\n      variables: {},\n      functions: {}\n    }\n\n    for (const [name, value] of this.scope) {\n      if (isFunction(value)) {\n        if (!isExpressionFunction(value)) {\n          throw new Error(`Cannot serialize external function ${name}`)\n        }\n\n        json.functions[name] = `${value.syntax} = ${value.expr}`\n      } else {\n        json.variables[name] = value\n      }\n    }\n\n    return json\n  }\n\n  Parser.fromJSON = function (json) {\n    const parser = new Parser()\n\n    Object.entries(json.variables).forEach(([name, value]) => parser.set(name, value))\n    Object.entries(json.functions).forEach(([_name, fn]) => parser.evaluate(fn))\n\n    return parser\n  }\n\n  return Parser\n}, { isClass: true })\n\nfunction isExpressionFunction (value) {\n  return typeof value === 'function' &&\n    typeof value.syntax === 'string' &&\n    typeof value.expr === 'string'\n}\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'parser'\nconst dependencies = ['typed', 'Parser']\n\nexport const createParser = /* #__PURE__ */ factory(name, dependencies, ({ typed, Parser }) => {\n  /**\n   * Create a `math.Parser` object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.\n   *\n   * Syntax:\n   *\n   *    math.parser()\n   *\n   * Examples:\n   *\n   *     const parser = new math.parser()\n   *\n   *     // evaluate expressions\n   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5\n   *     const b = parser.evaluate('sqrt(-4)')        // 2i\n   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm\n   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476\n   *\n   *     // define variables and functions\n   *     parser.evaluate('x = 7 / 2')             // 3.5\n   *     parser.evaluate('x + 3')                 // 6.5\n   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)\n   *     parser.evaluate('f(2, 3)')               // 8\n   *\n   *     // get and set variables and functions\n   *     const x = parser.get('x')                // 3.5\n   *     const f = parser.get('f')                // function\n   *     const g = f(3, 2)                        // 9\n   *     parser.set('h', 500)\n   *     const i = parser.evaluate('h / 2')       // 250\n   *     parser.set('hello', function (name) {\n   *       return 'hello, ' + name + '!'\n   *     })\n   *     parser.evaluate('hello(\"user\")')         // \"hello, user!\"\n   *\n   *     // clear defined functions and variables\n   *     parser.clear()\n   *\n   * See also:\n   *\n   *    evaluate, compile, parse\n   *\n   * @return {Parser} Parser\n   */\n  return typed(name, {\n    '': function () {\n      return new Parser()\n    }\n  })\n})\n","import { clone } from '../../../utils/object.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'lup'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'abs',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'larger',\n  'equalScalar',\n  'unaryMinus',\n  'DenseMatrix',\n  'SparseMatrix',\n  'Spa'\n]\n\nexport const createLup = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    abs,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    larger,\n    equalScalar,\n    unaryMinus,\n    DenseMatrix,\n    SparseMatrix,\n    Spa\n  }\n) => {\n  /**\n   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a\n   * row permutation vector `p` where `A[p,:] = L * U`\n   *\n   * Syntax:\n   *\n   *    math.lup(A)\n   *\n   * Example:\n   *\n   *    const m = [[2, 1], [1, 4]]\n   *    const r = math.lup(m)\n   *    // r = {\n   *    //   L: [[1, 0], [0.5, 1]],\n   *    //   U: [[2, 1], [0, 3.5]],\n   *    //   P: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    slu, lsolve, lusolve, usolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.\n   *\n   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.\n   */\n  return typed(name, {\n\n    DenseMatrix: function (m) {\n      return _denseLUP(m)\n    },\n\n    SparseMatrix: function (m) {\n      return _sparseLUP(m)\n    },\n\n    Array: function (a) {\n      // create dense matrix from array\n      const m = matrix(a)\n      // lup, use matrix implementation\n      const r = _denseLUP(m)\n      // result\n      return {\n        L: r.L.valueOf(),\n        U: r.U.valueOf(),\n        p: r.p\n      }\n    }\n  })\n\n  function _denseLUP (m) {\n    // rows & columns\n    const rows = m._size[0]\n    const columns = m._size[1]\n    // minimum rows and columns\n    let n = Math.min(rows, columns)\n    // matrix array, clone original data\n    const data = clone(m._data)\n    // l matrix arrays\n    const ldata = []\n    const lsize = [rows, n]\n    // u matrix arrays\n    const udata = []\n    const usize = [n, columns]\n    // vars\n    let i, j, k\n    // permutation vector\n    const p = []\n    for (i = 0; i < rows; i++) { p[i] = i }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // skip first column in upper triangular matrix\n      if (j > 0) {\n        // loop rows\n        for (i = 0; i < rows; i++) {\n          // min i,j\n          const min = Math.min(i, j)\n          // v[i, j]\n          let s = 0\n          // loop up to min\n          for (k = 0; k < min; k++) {\n            // s = l[i, k] - data[k, j]\n            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]))\n          }\n          data[i][j] = subtractScalar(data[i][j], s)\n        }\n      }\n      // row with larger value in cvector, row >= j\n      let pi = j\n      let pabsv = 0\n      let vjj = 0\n      // loop rows\n      for (i = j; i < rows; i++) {\n        // data @ i, j\n        const v = data[i][j]\n        // absolute value\n        const absv = abs(v)\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = i\n          // update max value\n          pabsv = absv\n          // value @ [j, j]\n          vjj = v\n        }\n      }\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in p\n        p[j] = [p[pi], p[pi] = p[j]][0]\n        // swap j <-> pi in data\n        DenseMatrix._swapRows(j, pi, data)\n      }\n      // check column is in lower triangular matrix\n      if (j < rows) {\n        // loop rows (lower triangular matrix)\n        for (i = j + 1; i < rows; i++) {\n          // value @ i, j\n          const vij = data[i][j]\n          if (!equalScalar(vij, 0)) {\n            // update data\n            data[i][j] = divideScalar(data[i][j], vjj)\n          }\n        }\n      }\n    }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // loop rows\n      for (i = 0; i < rows; i++) {\n        // initialize row in arrays\n        if (j === 0) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i] = []\n          }\n          // L\n          ldata[i] = []\n        }\n        // check we are in the upper triangular matrix\n        if (i < j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j]\n          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 0\n          }\n          continue\n        }\n        // diagonal value\n        if (i === j) {\n          // check row exists in upper triangular matrix\n          if (i < columns) {\n            // U\n            udata[i][j] = data[i][j]\n          }\n          // check column exists in lower triangular matrix\n          if (j < rows) {\n            // L\n            ldata[i][j] = 1\n          }\n          continue\n        }\n        // check row exists in upper triangular matrix\n        if (i < columns) {\n          // U\n          udata[i][j] = 0\n        }\n        // check column exists in lower triangular matrix\n        if (j < rows) {\n          // L\n          ldata[i][j] = data[i][j]\n        }\n      }\n    }\n    // l matrix\n    const l = new DenseMatrix({\n      data: ldata,\n      size: lsize\n    })\n    // u matrix\n    const u = new DenseMatrix({\n      data: udata,\n      size: usize\n    })\n    // p vector\n    const pv = []\n    for (i = 0, n = p.length; i < n; i++) { pv[p[i]] = i }\n    // return matrices\n    return {\n      L: l,\n      U: u,\n      p: pv,\n      toString: function () {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p\n      }\n    }\n  }\n\n  function _sparseLUP (m) {\n    // rows & columns\n    const rows = m._size[0]\n    const columns = m._size[1]\n    // minimum rows and columns\n    const n = Math.min(rows, columns)\n    // matrix arrays (will not be modified, thanks to permutation vector)\n    const values = m._values\n    const index = m._index\n    const ptr = m._ptr\n    // l matrix arrays\n    const lvalues = []\n    const lindex = []\n    const lptr = []\n    const lsize = [rows, n]\n    // u matrix arrays\n    const uvalues = []\n    const uindex = []\n    const uptr = []\n    const usize = [n, columns]\n    // vars\n    let i, j, k\n    // permutation vectors, (current index -> original index) and (original index -> current index)\n    const pvCo = []\n    const pvOc = []\n    for (i = 0; i < rows; i++) {\n      pvCo[i] = i\n      pvOc[i] = i\n    }\n    // swap indices in permutation vectors (condition x < y)!\n    const swapIndeces = function (x, y) {\n      // find pv indeces getting data from x and y\n      const kx = pvOc[x]\n      const ky = pvOc[y]\n      // update permutation vector current -> original\n      pvCo[kx] = y\n      pvCo[ky] = x\n      // update permutation vector original -> current\n      pvOc[x] = ky\n      pvOc[y] = kx\n    }\n    // loop columns\n    for (j = 0; j < columns; j++) {\n      // sparse accumulator\n      const spa = new Spa()\n      // check lower triangular matrix has a value @ column j\n      if (j < rows) {\n        // update ptr\n        lptr.push(lvalues.length)\n        // first value in j column for lower triangular matrix\n        lvalues.push(1)\n        lindex.push(j)\n      }\n      // update ptr\n      uptr.push(uvalues.length)\n      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]\n      const k0 = ptr[j]\n      const k1 = ptr[j + 1]\n      // copy column j into sparse accumulator\n      for (k = k0; k < k1; k++) {\n        // row\n        i = index[k]\n        // copy column values into sparse accumulator (use permutation vector)\n        spa.set(pvCo[i], values[k])\n      }\n      // skip first column in upper triangular matrix\n      if (j > 0) {\n        // loop rows in column j (above diagonal)\n        spa.forEach(0, j - 1, function (k, vkj) {\n          // loop rows in column k (L)\n          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {\n            // check row is below k\n            if (i > k) {\n              // update spa value\n              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)))\n            }\n          })\n        })\n      }\n      // row with larger value in spa, row >= j\n      let pi = j\n      let vjj = spa.get(j)\n      let pabsv = abs(vjj)\n      // loop values in spa (order by row, below diagonal)\n      spa.forEach(j + 1, rows - 1, function (x, v) {\n        // absolute value\n        const absv = abs(v)\n        // value is greater than pivote value\n        if (larger(absv, pabsv)) {\n          // store row\n          pi = x\n          // update max value\n          pabsv = absv\n          // value @ [j, j]\n          vjj = v\n        }\n      })\n      // swap rows (j <-> pi)\n      if (j !== pi) {\n        // swap values j <-> pi in L\n        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr)\n        // swap values j <-> pi in U\n        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr)\n        // swap values in spa\n        spa.swap(j, pi)\n        // update permutation vector (swap values @ j, pi)\n        swapIndeces(j, pi)\n      }\n      // loop values in spa (order by row)\n      spa.forEach(0, rows - 1, function (x, v) {\n        // check we are above diagonal\n        if (x <= j) {\n          // update upper triangular matrix\n          uvalues.push(v)\n          uindex.push(x)\n        } else {\n          // update value\n          v = divideScalar(v, vjj)\n          // check value is non zero\n          if (!equalScalar(v, 0)) {\n            // update lower triangular matrix\n            lvalues.push(v)\n            lindex.push(x)\n          }\n        }\n      })\n    }\n    // update ptrs\n    uptr.push(uvalues.length)\n    lptr.push(lvalues.length)\n\n    // return matrices\n    return {\n      L: new SparseMatrix({\n        values: lvalues,\n        index: lindex,\n        ptr: lptr,\n        size: lsize\n      }),\n      U: new SparseMatrix({\n        values: uvalues,\n        index: uindex,\n        ptr: uptr,\n        size: usize\n      }),\n      p: pvCo,\n      toString: function () {\n        return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\nP: ' + this.p\n      }\n    }\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'qr'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'zeros',\n  'identity',\n  'isZero',\n  'equal',\n  'sign',\n  'sqrt',\n  'conj',\n  'unaryMinus',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'subtractScalar',\n  'complex'\n]\n\nexport const createQr = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    zeros,\n    identity,\n    isZero,\n    equal,\n    sign,\n    sqrt,\n    conj,\n    unaryMinus,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    subtractScalar,\n    complex\n  }\n) => {\n  /**\n   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in\n   * two matrices (`Q`, `R`) where `Q` is an\n   * orthogonal matrix and `R` is an upper triangular matrix.\n   *\n   * Syntax:\n   *\n   *    math.qr(A)\n   *\n   * Example:\n   *\n   *    const m = [\n   *      [1, -1,  4],\n   *      [1,  4, -2],\n   *      [1,  4,  2],\n   *      [1,  -1, 0]\n   *    ]\n   *    const result = math.qr(m)\n   *    // r = {\n   *    //   Q: [\n   *    //     [0.5, -0.5,   0.5],\n   *    //     [0.5,  0.5,  -0.5],\n   *    //     [0.5,  0.5,   0.5],\n   *    //     [0.5, -0.5,  -0.5],\n   *    //   ],\n   *    //   R: [\n   *    //     [2, 3,  2],\n   *    //     [0, 5, -2],\n   *    //     [0, 0,  4],\n   *    //     [0, 0,  0]\n   *    //   ]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lusolve\n   *\n   * @param {Matrix | Array} A    A two dimensional matrix or array\n   * for which to get the QR decomposition.\n   *\n   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal\n   * matrix and R: the upper triangular matrix\n   */\n  return Object.assign(typed(name, {\n\n    DenseMatrix: function (m) {\n      return _denseQR(m)\n    },\n\n    SparseMatrix: function (m) {\n      return _sparseQR(m)\n    },\n\n    Array: function (a) {\n      // create dense matrix from array\n      const m = matrix(a)\n      // lup, use matrix implementation\n      const r = _denseQR(m)\n      // result\n      return {\n        Q: r.Q.valueOf(),\n        R: r.R.valueOf()\n      }\n    }\n  }), { _denseQRimpl })\n\n  function _denseQRimpl (m) {\n    // rows & columns (m x n)\n    const rows = m._size[0] // m\n    const cols = m._size[1] // n\n\n    const Q = identity([rows], 'dense')\n    const Qdata = Q._data\n\n    const R = m.clone()\n    const Rdata = R._data\n\n    // vars\n    let i, j, k\n\n    const w = zeros([rows], '')\n\n    for (k = 0; k < Math.min(cols, rows); ++k) {\n      /*\n       * **k-th Household matrix**\n       *\n       * The matrix I - 2*v*transpose(v)\n       * x     = first column of A\n       * x1    = first element of x\n       * alpha = x1 / |x1| * |x|\n       * e1    = tranpose([1, 0, 0, ...])\n       * u     = x - alpha * e1\n       * v     = u / |u|\n       *\n       * Household matrix = I - 2 * v * tranpose(v)\n       *\n       *  * Initially Q = I and R = A.\n       *  * Household matrix is a reflection in a plane normal to v which\n       *    will zero out all but the top right element in R.\n       *  * Appplying reflection to both Q and R will not change product.\n       *  * Repeat this process on the (1,1) minor to get R as an upper\n       *    triangular matrix.\n       *  * Reflections leave the magnitude of the columns of Q unchanged\n       *    so Q remains othoganal.\n       *\n       */\n\n      const pivot = Rdata[k][k]\n      const sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot))\n      const conjSgn = conj(sgn)\n\n      let alphaSquared = 0\n\n      for (i = k; i < rows; i++) {\n        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])))\n      }\n\n      const alpha = multiplyScalar(sgn, sqrt(alphaSquared))\n\n      if (!isZero(alpha)) {\n        // first element in vector u\n        const u1 = subtractScalar(pivot, alpha)\n\n        // w = v * u1 / |u|    (only elements k to (rows-1) are used)\n        w[k] = 1\n\n        for (i = k + 1; i < rows; i++) {\n          w[i] = divideScalar(Rdata[i][k], u1)\n        }\n\n        // tau = - conj(u1 / alpha)\n        const tau = unaryMinus(conj(divideScalar(u1, alpha)))\n\n        let s\n\n        /*\n         * tau and w have been choosen so that\n         *\n         * 2 * v * tranpose(v) = tau * w * tranpose(w)\n         */\n\n        /*\n         * -- calculate R = R - tau * w * tranpose(w) * R --\n         * Only do calculation with rows k to (rows-1)\n         * Additionally columns 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (j = k; j < cols; j++) {\n          s = 0.0\n\n          // calculate jth element of [tranpose(w) * R]\n          for (i = k; i < rows; i++) {\n            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]))\n          }\n\n          // calculate the jth element of [tau * transpose(w) * R]\n          s = multiplyScalar(s, tau)\n\n          for (i = k; i < rows; i++) {\n            Rdata[i][j] = multiplyScalar(\n              subtractScalar(Rdata[i][j], multiplyScalar(w[i], s)),\n              conjSgn\n            )\n          }\n        }\n        /*\n         * -- calculate Q = Q - tau * Q * w * transpose(w) --\n         * Q is a square matrix (rows x rows)\n         * Only do calculation with columns k to (rows-1)\n         * Additionally rows 0 to (k-1) will not be changed by this\n         *   multiplication so do not bother recalculating them\n         */\n        for (i = 0; i < rows; i++) {\n          s = 0.0\n\n          // calculate ith element of [Q * w]\n          for (j = k; j < rows; j++) {\n            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]))\n          }\n\n          // calculate the ith element of [tau * Q * w]\n          s = multiplyScalar(s, tau)\n\n          for (j = k; j < rows; ++j) {\n            Qdata[i][j] = divideScalar(\n              subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))),\n              conjSgn\n            )\n          }\n        }\n      }\n    }\n\n    // return matrices\n    return {\n      Q,\n      R,\n      toString: function () {\n        return 'Q: ' + this.Q.toString() + '\\nR: ' + this.R.toString()\n      }\n    }\n  }\n\n  function _denseQR (m) {\n    const ret = _denseQRimpl(m)\n    const Rdata = ret.R._data\n    if (m._data.length > 0) {\n      const zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0\n\n      for (let i = 0; i < Rdata.length; ++i) {\n        for (let j = 0; j < i && j < (Rdata[0] || []).length; ++j) {\n          Rdata[i][j] = zero\n        }\n      }\n    }\n\n    return ret\n  }\n\n  function _sparseQR (m) {\n    throw new Error('qr not implemented for sparse matrices yet')\n  }\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Depth-first search and postorder of a tree rooted at node j\n *\n * @param {Number}  j               The tree node\n * @param {Number}  k\n * @param {Array}   w               The workspace array\n * @param {Number}  head            The index offset within the workspace for the head array\n * @param {Number}  next            The index offset within the workspace for the next array\n * @param {Array}   post            The post ordering array\n * @param {Number}  stack           The index offset within the workspace for the stack array\n */\nexport function csTdfs (j, k, w, head, next, post, stack) {\n  // variables\n  let top = 0\n  // place j on the stack\n  w[stack] = j\n  // while (stack is not empty)\n  while (top >= 0) {\n    // p = top of stack\n    const p = w[stack + top]\n    // i = youngest child of p\n    const i = w[head + p]\n    if (i === -1) {\n      // p has no unordered children left\n      top--\n      // node p is the kth postordered node\n      post[k++] = p\n    } else {\n      // remove i from children of p\n      w[head + p] = w[next + i]\n      // increment top\n      ++top\n      // start dfs on child node i\n      w[stack + top] = i\n    }\n  }\n  return k\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * This function \"flips\" its input about the integer -1.\n *\n * @param {Number}  i               The value to flip\n */\nexport function csFlip (i) {\n  // flip the value\n  return -i - 2\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { factory } from '../../../utils/factory.js'\nimport { csFkeep } from './csFkeep.js'\nimport { csFlip } from './csFlip.js'\nimport { csTdfs } from './csTdfs.js'\n\nconst name = 'csAmd'\nconst dependencies = [\n  'add',\n  'multiply',\n  'transpose'\n]\n\nexport const createCsAmd = /* #__PURE__ */ factory(name, dependencies, ({ add, multiply, transpose }) => {\n  /**\n   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used\n   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization\n   * than A. It is a gready method that selects the sparsest pivot row and column during the course\n   * of a right looking sparse Cholesky factorization.\n   *\n   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR\n   * @param {Matrix} m        Sparse Matrix\n   */\n  return function csAmd (order, a) {\n    // check input parameters\n    if (!a || order <= 0 || order > 3) { return null }\n    // a matrix arrays\n    const asize = a._size\n    // rows and columns\n    const m = asize[0]\n    const n = asize[1]\n    // initialize vars\n    let lemax = 0\n    // dense threshold\n    let dense = Math.max(16, 10 * Math.sqrt(n))\n    dense = Math.min(n - 2, dense)\n    // create target matrix C\n    const cm = _createTargetMatrix(order, a, m, n, dense)\n    // drop diagonal entries\n    csFkeep(cm, _diag, null)\n    // C matrix arrays\n    const cindex = cm._index\n    const cptr = cm._ptr\n\n    // number of nonzero elements in C\n    let cnz = cptr[n]\n\n    // allocate result (n+1)\n    const P = []\n\n    // create workspace (8 * (n + 1))\n    const W = []\n    const len = 0 // first n + 1 entries\n    const nv = n + 1 // next n + 1 entries\n    const next = 2 * (n + 1) // next n + 1 entries\n    const head = 3 * (n + 1) // next n + 1 entries\n    const elen = 4 * (n + 1) // next n + 1 entries\n    const degree = 5 * (n + 1) // next n + 1 entries\n    const w = 6 * (n + 1) // next n + 1 entries\n    const hhead = 7 * (n + 1) // last n + 1 entries\n\n    // use P as workspace for last\n    const last = P\n\n    // initialize quotient graph\n    let mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree)\n\n    // initialize degree lists\n    let nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next)\n\n    // minimum degree node\n    let mindeg = 0\n\n    // vars\n    let i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d\n\n    // while (selecting pivots) do\n    while (nel < n) {\n      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first\n      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow\n      // many nodes have been eliminated.\n      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++);\n      if (W[next + k] !== -1) { last[W[next + k]] = -1 }\n      // remove k from degree list\n      W[head + mindeg] = W[next + k]\n      // elenk = |Ek|\n      const elenk = W[elen + k]\n      // # of nodes k represents\n      let nvk = W[nv + k]\n      // W[nv + k] nodes of A eliminated\n      nel += nvk\n\n      // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is\n      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the\n      // degree lists. All elements e in Ek are absorved into element k.\n      let dk = 0\n      // flag k as in Lk\n      W[nv + k] = -nvk\n      let p = cptr[k]\n      // do in place if W[elen + k] === 0\n      const pk1 = (elenk === 0) ? p : cnz\n      let pk2 = pk1\n      for (k1 = 1; k1 <= elenk + 1; k1++) {\n        if (k1 > elenk) {\n          // search the nodes in k\n          e = k\n          // list of nodes starts at cindex[pj]\n          pj = p\n          // length of list of nodes in k\n          ln = W[len + k] - elenk\n        } else {\n          // search the nodes in e\n          e = cindex[p++]\n          pj = cptr[e]\n          // length of list of nodes in e\n          ln = W[len + e]\n        }\n        for (k2 = 1; k2 <= ln; k2++) {\n          i = cindex[pj++]\n          // check  node i dead, or seen\n          if ((nvi = W[nv + i]) <= 0) { continue }\n          // W[degree + Lk] += size of node i\n          dk += nvi\n          // negate W[nv + i] to denote i in Lk\n          W[nv + i] = -nvi\n          // place i in Lk\n          cindex[pk2++] = i\n          if (W[next + i] !== -1) { last[W[next + i]] = last[i] }\n          // check we need to remove i from degree list\n          if (last[i] !== -1) { W[next + last[i]] = W[next + i] } else { W[head + W[degree + i]] = W[next + i] }\n        }\n        if (e !== k) {\n          // absorb e into k\n          cptr[e] = csFlip(k)\n          // e is now a dead element\n          W[w + e] = 0\n        }\n      }\n      // cindex[cnz...nzmax] is free\n      if (elenk !== 0) { cnz = pk2 }\n      // external degree of k - |Lk\\i|\n      W[degree + k] = dk\n      // element k is in cindex[pk1..pk2-1]\n      cptr[k] = pk1\n      W[len + k] = pk2 - pk1\n      // k is now an element\n      W[elen + k] = -2\n\n      // Find set differences. The scan1 function now computes the set differences |Le \\ Lk| for all elements e. At the start of the\n      // scan, no entry in the w array is greater than or equal to mark.\n\n      // clear w if necessary\n      mark = _wclear(mark, lemax, W, w, n)\n      // scan 1: find |Le\\Lk|\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check if W[elen + i] empty, skip it\n        if ((eln = W[elen + i]) <= 0) { continue }\n        // W[nv + i] was negated\n        nvi = -W[nv + i]\n        const wnvi = mark - nvi\n        // scan Ei\n        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {\n          e = cindex[p]\n          if (W[w + e] >= mark) {\n            // decrement |Le\\Lk|\n            W[w + e] -= nvi\n          } else if (W[w + e] !== 0) {\n            // ensure e is a live element, 1st time e seen in scan 1\n            W[w + e] = W[degree + e] + wnvi\n          }\n        }\n      }\n\n      // degree update\n      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash\n      // function h(i) for all nodes in Lk.\n\n      // scan2: degree update\n      for (pk = pk1; pk < pk2; pk++) {\n        // consider node i in Lk\n        i = cindex[pk]\n        p1 = cptr[i]\n        p2 = p1 + W[elen + i] - 1\n        pn = p1\n        // scan Ei\n        for (h = 0, d = 0, p = p1; p <= p2; p++) {\n          e = cindex[p]\n          // check e is an unabsorbed element\n          if (W[w + e] !== 0) {\n            // dext = |Le\\Lk|\n            const dext = W[w + e] - mark\n            if (dext > 0) {\n              // sum up the set differences\n              d += dext\n              // keep e in Ei\n              cindex[pn++] = e\n              // compute the hash of node i\n              h += e\n            } else {\n              // aggressive absorb. e->k\n              cptr[e] = csFlip(k)\n              // e is a dead element\n              W[w + e] = 0\n            }\n          }\n        }\n        // W[elen + i] = |Ei|\n        W[elen + i] = pn - p1 + 1\n        const p3 = pn\n        const p4 = p1 + W[len + i]\n        // prune edges in Ai\n        for (p = p2 + 1; p < p4; p++) {\n          j = cindex[p]\n          // check node j dead or in Lk\n          const nvj = W[nv + j]\n          if (nvj <= 0) { continue }\n          // degree(i) += |j|\n          d += nvj\n          // place j in node list of i\n          cindex[pn++] = j\n          // compute hash for node i\n          h += j\n        }\n        // check for mass elimination\n        if (d === 0) {\n          // absorb i into k\n          cptr[i] = csFlip(k)\n          nvi = -W[nv + i]\n          // |Lk| -= |i|\n          dk -= nvi\n          // |k| += W[nv + i]\n          nvk += nvi\n          nel += nvi\n          W[nv + i] = 0\n          // node i is dead\n          W[elen + i] = -1\n        } else {\n          // update degree(i)\n          W[degree + i] = Math.min(W[degree + i], d)\n          // move first node to end\n          cindex[pn] = cindex[p3]\n          // move 1st el. to end of Ei\n          cindex[p3] = cindex[p1]\n          // add k as 1st element in of Ei\n          cindex[p1] = k\n          // new len of adj. list of node i\n          W[len + i] = pn - p1 + 1\n          // finalize hash of i\n          h = (h < 0 ? -h : h) % n\n          // place i in hash bucket\n          W[next + i] = W[hhead + h]\n          W[hhead + h] = i\n          // save hash of i in last[i]\n          last[i] = h\n        }\n      }\n      // finalize |Lk|\n      W[degree + k] = dk\n      lemax = Math.max(lemax, dk)\n      // clear w\n      mark = _wclear(mark + lemax, lemax, W, w, n)\n\n      // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.\n      // If two nodes have identical adjacency lists, their hash functions wil be identical.\n      for (pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check i is dead, skip it\n        if (W[nv + i] >= 0) { continue }\n        // scan hash bucket of node i\n        h = last[i]\n        i = W[hhead + h]\n        // hash bucket will be empty\n        W[hhead + h] = -1\n        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {\n          ln = W[len + i]\n          eln = W[elen + i]\n          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) { W[w + cindex[p]] = mark }\n          let jlast = i\n          // compare i with all j\n          for (j = W[next + i]; j !== -1;) {\n            let ok = W[len + j] === ln && W[elen + j] === eln\n            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {\n              // compare i and j\n              if (W[w + cindex[p]] !== mark) { ok = 0 }\n            }\n            // check i and j are identical\n            if (ok) {\n              // absorb j into i\n              cptr[j] = csFlip(i)\n              W[nv + i] += W[nv + j]\n              W[nv + j] = 0\n              // node j is dead\n              W[elen + j] = -1\n              // delete j from hash bucket\n              j = W[next + j]\n              W[next + jlast] = j\n            } else {\n              // j and i are different\n              jlast = j\n              j = W[next + j]\n            }\n          }\n        }\n      }\n\n      // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.\n      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.\n      for (p = pk1, pk = pk1; pk < pk2; pk++) {\n        i = cindex[pk]\n        // check  i is dead, skip it\n        if ((nvi = -W[nv + i]) <= 0) { continue }\n        // restore W[nv + i]\n        W[nv + i] = nvi\n        // compute external degree(i)\n        d = W[degree + i] + dk - nvi\n        d = Math.min(d, n - nel - nvi)\n        if (W[head + d] !== -1) { last[W[head + d]] = i }\n        // put i back in degree list\n        W[next + i] = W[head + d]\n        last[i] = -1\n        W[head + d] = i\n        // find new minimum degree\n        mindeg = Math.min(mindeg, d)\n        W[degree + i] = d\n        // place i in Lk\n        cindex[p++] = i\n      }\n      // # nodes absorbed into k\n      W[nv + k] = nvk\n      // length of adj list of element k\n      if ((W[len + k] = p - pk1) === 0) {\n        // k is a root of the tree\n        cptr[k] = -1\n        // k is now a dead element\n        W[w + k] = 0\n      }\n      if (elenk !== 0) {\n        // free unused space in Lk\n        cnz = p\n      }\n    }\n\n    // Postordering. The elimination is complete, but no permutation has been computed. All that is left\n    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if\n    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation\n    // is computed. The tree is restored by unflipping all of ptr.\n\n    // fix assembly tree\n    for (i = 0; i < n; i++) { cptr[i] = csFlip(cptr[i]) }\n    for (j = 0; j <= n; j++) { W[head + j] = -1 }\n    // place unordered nodes in lists\n    for (j = n; j >= 0; j--) {\n      // skip if j is an element\n      if (W[nv + j] > 0) { continue }\n      // place j in list of its parent\n      W[next + j] = W[head + cptr[j]]\n      W[head + cptr[j]] = j\n    }\n    // place elements in lists\n    for (e = n; e >= 0; e--) {\n      // skip unless e is an element\n      if (W[nv + e] <= 0) { continue }\n      if (cptr[e] !== -1) {\n        // place e in list of its parent\n        W[next + e] = W[head + cptr[e]]\n        W[head + cptr[e]] = e\n      }\n    }\n    // postorder the assembly tree\n    for (k = 0, i = 0; i <= n; i++) {\n      if (cptr[i] === -1) { k = csTdfs(i, k, W, head, next, P, w) }\n    }\n    // remove last item in array\n    P.splice(P.length - 1, 1)\n    // return P\n    return P\n  }\n\n  /**\n   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation\n   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.\n   *\n   * Order: 0\n   *   A natural ordering P=null matrix is returned.\n   *\n   * Order: 1\n   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.\n   *   P = M + M'\n   *\n   * Order: 2\n   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.\n   *   P = M' * M\n   *\n   * Order: 3\n   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.\n   *   P = M' * M\n   */\n  function _createTargetMatrix (order, a, m, n, dense) {\n    // compute A'\n    const at = transpose(a)\n\n    // check order = 1, matrix must be square\n    if (order === 1 && n === m) {\n      // C = A + A'\n      return add(a, at)\n    }\n\n    // check order = 2, drop dense columns from M'\n    if (order === 2) {\n      // transpose arrays\n      const tindex = at._index\n      const tptr = at._ptr\n      // new column index\n      let p2 = 0\n      // loop A' columns (rows)\n      for (let j = 0; j < m; j++) {\n        // column j of AT starts here\n        let p = tptr[j]\n        // new column j starts here\n        tptr[j] = p2\n        // skip dense col j\n        if (tptr[j + 1] - p > dense) { continue }\n        // map rows in column j of A\n        for (const p1 = tptr[j + 1]; p < p1; p++) { tindex[p2++] = tindex[p] }\n      }\n      // finalize AT\n      tptr[m] = p2\n      // recreate A from new transpose matrix\n      a = transpose(at)\n      // use A' * A\n      return multiply(at, a)\n    }\n\n    // use A' * A, square or rectangular matrix\n    return multiply(at, a)\n  }\n\n  /**\n   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:\n   *\n   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.\n   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).\n   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.\n   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).\n   */\n  function _initializeQuotientGraph (n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {\n    // Initialize quotient graph\n    for (let k = 0; k < n; k++) { W[len + k] = cptr[k + 1] - cptr[k] }\n    W[len + n] = 0\n    // initialize workspace\n    for (let i = 0; i <= n; i++) {\n      // degree list i is empty\n      W[head + i] = -1\n      last[i] = -1\n      W[next + i] = -1\n      // hash list i is empty\n      W[hhead + i] = -1\n      // node i is just one node\n      W[nv + i] = 1\n      // node i is alive\n      W[w + i] = 1\n      // Ek of node i is empty\n      W[elen + i] = 0\n      // degree of node i\n      W[degree + i] = W[len + i]\n    }\n    // clear w\n    const mark = _wclear(0, 0, W, w, n)\n    // n is a dead element\n    W[elen + n] = -2\n    // n is a root of assembly tree\n    cptr[n] = -1\n    // n is a dead element\n    W[w + n] = 0\n    // return mark\n    return mark\n  }\n\n  /**\n   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with\n   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the\n   * output permutation p.\n   */\n  function _initializeDegreeLists (n, cptr, W, degree, elen, w, dense, nv, head, last, next) {\n    // result\n    let nel = 0\n    // loop columns\n    for (let i = 0; i < n; i++) {\n      // degree @ i\n      const d = W[degree + i]\n      // check node i is empty\n      if (d === 0) {\n        // element i is dead\n        W[elen + i] = -2\n        nel++\n        // i is a root of assembly tree\n        cptr[i] = -1\n        W[w + i] = 0\n      } else if (d > dense) {\n        // absorb i into element n\n        W[nv + i] = 0\n        // node i is dead\n        W[elen + i] = -1\n        nel++\n        cptr[i] = csFlip(n)\n        W[nv + n]++\n      } else {\n        const h = W[head + d]\n        if (h !== -1) { last[h] = i }\n        // put node i in degree list d\n        W[next + i] = W[head + d]\n        W[head + d] = i\n      }\n    }\n    return nel\n  }\n\n  function _wclear (mark, lemax, W, w, n) {\n    if (mark < 2 || (mark + lemax < 0)) {\n      for (let k = 0; k < n; k++) {\n        if (W[w + k] !== 0) { W[w + k] = 1 }\n      }\n      mark = 2\n    }\n    // at this point, W [0..n-1] < mark holds\n    return mark\n  }\n\n  function _diag (i, j) {\n    return i !== j\n  }\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise\n *\n * @param {Matrix}   a              The sparse matrix\n * @param {function} callback       The callback function, function will be invoked with the following args:\n *                                    - The entry row\n *                                    - The entry column\n *                                    - The entry value\n *                                    - The state parameter\n * @param {any}      other          The state\n *\n * @return                          The number of nonzero elements in the matrix\n */\nexport function csFkeep (a, callback, other) {\n  // a arrays\n  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  // columns\n  const n = asize[1]\n  // nonzero items\n  let nz = 0\n  // loop columns\n  for (let j = 0; j < n; j++) {\n    // get current location of col j\n    let p = aptr[j]\n    // record new location of col j\n    aptr[j] = nz\n    for (; p < aptr[j + 1]; p++) {\n      // check we need to keep this item\n      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {\n        // keep A(i,j)\n        aindex[nz] = aindex[p]\n        // check we need to process values (pattern only)\n        if (avalues) { avalues[nz] = avalues[p] }\n        // increment nonzero items\n        nz++\n      }\n    }\n  }\n  // finalize A\n  aptr[n] = nz\n  // trim arrays\n  aindex.splice(nz, aindex.length - nz)\n  // check we need to process values (pattern only)\n  if (avalues) { avalues.splice(nz, avalues.length - nz) }\n  // return number of nonzero items\n  return nz\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * This function determines if j is a leaf of the ith row subtree.\n * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)\n *\n * @param {Number}  i               The ith row subtree\n * @param {Number}  j               The node to test\n * @param {Array}   w               The workspace array\n * @param {Number}  first           The index offset within the workspace for the first array\n * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array\n * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array\n * @param {Number}  ancestor        The index offset within the workspace for the ancestor array\n *\n * @return {Object}\n */\nexport function csLeaf (i, j, w, first, maxfirst, prevleaf, ancestor) {\n  let s, sparent\n\n  // our result\n  let jleaf = 0\n  let q\n\n  // check j is a leaf\n  if (i <= j || w[first + j] <= w[maxfirst + i]) { return (-1) }\n  // update max first[j] seen so far\n  w[maxfirst + i] = w[first + j]\n  // jprev = previous leaf of ith subtree\n  const jprev = w[prevleaf + i]\n  w[prevleaf + i] = j\n\n  // check j is first or subsequent leaf\n  if (jprev === -1) {\n    // 1st leaf, q = root of ith subtree\n    jleaf = 1\n    q = i\n  } else {\n    // update jleaf\n    jleaf = 2\n    // q = least common ancester (jprev,j)\n    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]);\n    for (s = jprev; s !== q; s = sparent) {\n      // path compression\n      sparent = w[ancestor + s]\n      w[ancestor + s] = q\n    }\n  }\n  return { jleaf, q }\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { factory } from '../../../utils/factory.js'\nimport { csLeaf } from './csLeaf.js'\n\nconst name = 'csCounts'\nconst dependencies = [\n  'transpose'\n]\n\nexport const createCsCounts = /* #__PURE__ */ factory(name, dependencies, ({ transpose }) => {\n  /**\n   * Computes the column counts using the upper triangular part of A.\n   * It transposes A internally, none of the input parameters are modified.\n   *\n   * @param {Matrix} a           The sparse matrix A\n   *\n   * @param {Matrix} ata         Count the columns of A'A instead\n   *\n   * @return                     An array of size n of the column counts or null on error\n   */\n  return function (a, parent, post, ata) {\n    // check inputs\n    if (!a || !parent || !post) { return null }\n    // a matrix arrays\n    const asize = a._size\n    // rows and columns\n    const m = asize[0]\n    const n = asize[1]\n    // variables\n    let i, j, k, J, p, p0, p1\n\n    // workspace size\n    const s = 4 * n + (ata ? (n + m + 1) : 0)\n    // allocate workspace\n    const w = [] // (s)\n    const ancestor = 0 // first n entries\n    const maxfirst = n // next n entries\n    const prevleaf = 2 * n // next n entries\n    const first = 3 * n // next n entries\n    const head = 4 * n // next n + 1 entries (used when ata is true)\n    const next = 5 * n + 1 // last entries in workspace\n    // clear workspace w[0..s-1]\n    for (k = 0; k < s; k++) { w[k] = -1 }\n\n    // allocate result\n    const colcount = [] // (n)\n\n    // AT = A'\n    const at = transpose(a)\n    // at arrays\n    const tindex = at._index\n    const tptr = at._ptr\n\n    // find w[first + j]\n    for (k = 0; k < n; k++) {\n      j = post[k]\n      // colcount[j]=1 if j is a leaf\n      colcount[j] = (w[first + j] === -1) ? 1 : 0\n      for (; j !== -1 && w[first + j] === -1; j = parent[j]) { w[first + j] = k }\n    }\n\n    // initialize ata if needed\n    if (ata) {\n      // invert post\n      for (k = 0; k < n; k++) { w[post[k]] = k }\n      // loop rows (columns in AT)\n      for (i = 0; i < m; i++) {\n        // values in column i of AT\n        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) { k = Math.min(k, w[tindex[p]]) }\n        // place row i in linked list k\n        w[next + i] = w[head + k]\n        w[head + k] = i\n      }\n    }\n\n    // each node in its own set\n    for (i = 0; i < n; i++) { w[ancestor + i] = i }\n\n    for (k = 0; k < n; k++) {\n      // j is the kth node in postordered etree\n      j = post[k]\n      // check j is not a root\n      if (parent[j] !== -1) { colcount[parent[j]]-- }\n\n      // J=j for LL'=A case\n      for (J = (ata ? w[head + k] : j); J !== -1; J = (ata ? w[next + J] : -1)) {\n        for (p = tptr[J]; p < tptr[J + 1]; p++) {\n          i = tindex[p]\n          const r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor)\n          // check A(i,j) is in skeleton\n          if (r.jleaf >= 1) { colcount[j]++ }\n          // check account for overlap in q\n          if (r.jleaf === 2) { colcount[r.q]-- }\n        }\n      }\n      if (parent[j] !== -1) { w[ancestor + j] = parent[j] }\n    }\n    // sum up colcount's of each child\n    for (j = 0; j < n; j++) {\n      if (parent[j] !== -1) { colcount[parent[j]] += colcount[j] }\n    }\n    return colcount\n  }\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csPermute } from './csPermute.js'\nimport { csPost } from './csPost.js'\nimport { csEtree } from './csEtree.js'\nimport { createCsAmd } from './csAmd.js'\nimport { createCsCounts } from './csCounts.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'csSqr'\nconst dependencies = [\n  'add',\n  'multiply',\n  'transpose'\n]\n\nexport const createCsSqr = /* #__PURE__ */ factory(name, dependencies, ({ add, multiply, transpose }) => {\n  const csAmd = createCsAmd({ add, multiply, transpose })\n  const csCounts = createCsCounts({ transpose })\n\n  /**\n   * Symbolic ordering and analysis for QR and LU decompositions.\n   *\n   * @param {Number}  order           The ordering strategy (see csAmd for more details)\n   * @param {Matrix}  a               The A matrix\n   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or\n   *                                  symbolic ordering and analysis for LU decomposition (false)\n   *\n   * @return {Object}                 The Symbolic ordering and analysis for matrix A\n   */\n  return function csSqr (order, a, qr) {\n    // a arrays\n    const aptr = a._ptr\n    const asize = a._size\n    // columns\n    const n = asize[1]\n    // vars\n    let k\n    // symbolic analysis result\n    const s = {}\n    // fill-reducing ordering\n    s.q = csAmd(order, a)\n    // validate results\n    if (order && !s.q) { return null }\n    // QR symbolic analysis\n    if (qr) {\n      // apply permutations if needed\n      const c = order ? csPermute(a, null, s.q, 0) : a\n      // etree of C'*C, where C=A(:,q)\n      s.parent = csEtree(c, 1)\n      // post order elimination tree\n      const post = csPost(s.parent, n)\n      // col counts chol(C'*C)\n      s.cp = csCounts(c, s.parent, post, 1)\n      // check we have everything needed to calculate number of nonzero elements\n      if (c && s.parent && s.cp && _vcount(c, s)) {\n        // calculate number of nonzero elements\n        for (s.unz = 0, k = 0; k < n; k++) { s.unz += s.cp[k] }\n      }\n    } else {\n      // for LU factorization only, guess nnz(L) and nnz(U)\n      s.unz = 4 * (aptr[n]) + n\n      s.lnz = s.unz\n    }\n    // return result S\n    return s\n  }\n\n  /**\n   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent\n   */\n  function _vcount (a, s) {\n    // a arrays\n    const aptr = a._ptr\n    const aindex = a._index\n    const asize = a._size\n    // rows & columns\n    const m = asize[0]\n    const n = asize[1]\n    // initialize s arrays\n    s.pinv = [] // (m + n)\n    s.leftmost = [] // (m)\n    // vars\n    const parent = s.parent\n    const pinv = s.pinv\n    const leftmost = s.leftmost\n    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries\n    const w = [] // (m + 3 * n)\n    const next = 0\n    const head = m\n    const tail = m + n\n    const nque = m + 2 * n\n    // vars\n    let i, k, p, p0, p1\n    // initialize w\n    for (k = 0; k < n; k++) {\n      // queue k is empty\n      w[head + k] = -1\n      w[tail + k] = -1\n      w[nque + k] = 0\n    }\n    // initialize row arrays\n    for (i = 0; i < m; i++) { leftmost[i] = -1 }\n    // loop columns backwards\n    for (k = n - 1; k >= 0; k--) {\n      // values & index for column k\n      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n        // leftmost[i] = min(find(A(i,:)))\n        leftmost[aindex[p]] = k\n      }\n    }\n    // scan rows in reverse order\n    for (i = m - 1; i >= 0; i--) {\n      // row i is not yet ordered\n      pinv[i] = -1\n      k = leftmost[i]\n      // check row i is empty\n      if (k === -1) { continue }\n      // first row in queue k\n      if (w[nque + k]++ === 0) { w[tail + k] = i }\n      // put i at head of queue k\n      w[next + i] = w[head + k]\n      w[head + k] = i\n    }\n    s.lnz = 0\n    s.m2 = m\n    // find row permutation and nnz(V)\n    for (k = 0; k < n; k++) {\n      // remove row i from queue k\n      i = w[head + k]\n      // count V(k,k) as nonzero\n      s.lnz++\n      // add a fictitious row\n      if (i < 0) { i = s.m2++ }\n      // associate row i with V(:,k)\n      pinv[i] = k\n      // skip if V(k+1:m,k) is empty\n      if (--nque[k] <= 0) { continue }\n      // nque[k] is nnz (V(k+1:m,k))\n      s.lnz += w[nque + k]\n      // move all rows to parent of k\n      const pa = parent[k]\n      if (pa !== -1) {\n        if (w[nque + pa] === 0) { w[tail + pa] = w[tail + k] }\n        w[next + w[tail + k]] = w[head + pa]\n        w[head + pa] = w[next + i]\n        w[nque + pa] += w[nque + k]\n      }\n    }\n    for (i = 0; i < m; i++) {\n      if (pinv[i] < 0) { pinv[i] = k++ }\n    }\n    return true\n  }\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Permutes a sparse matrix C = P * A * Q\n *\n * @param {SparseMatrix}  a         The Matrix A\n * @param {Array}   pinv            The row permutation vector\n * @param {Array}   q               The column permutation vector\n * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise\n *\n * @return {Matrix}                 C = P * A * Q, null on error\n */\nexport function csPermute (a, pinv, q, values) {\n  // a arrays\n  const avalues = a._values\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  const adt = a._datatype\n  // rows & columns\n  const m = asize[0]\n  const n = asize[1]\n  // c arrays\n  const cvalues = values && a._values ? [] : null\n  const cindex = [] // (aptr[n])\n  const cptr = [] // (n + 1)\n  // initialize vars\n  let nz = 0\n  // loop columns\n  for (let k = 0; k < n; k++) {\n    // column k of C is column q[k] of A\n    cptr[k] = nz\n    // apply column permutation\n    const j = q ? (q[k]) : k\n    // loop values in column j of A\n    for (let t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {\n      // row i of A is row pinv[i] of C\n      const r = pinv ? pinv[aindex[t]] : aindex[t]\n      // index\n      cindex[nz] = r\n      // check we need to populate values\n      if (cvalues) { cvalues[nz] = avalues[t] }\n      // increment number of nonzero elements\n      nz++\n    }\n  }\n  // finalize the last column of C\n  cptr[n] = nz\n  // return C matrix\n  return a.createSparseMatrix({\n    values: cvalues,\n    index: cindex,\n    ptr: cptr,\n    size: [m, n],\n    datatype: adt\n  })\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Computes the elimination tree of Matrix A (using triu(A)) or the\n * elimination tree of A'A without forming A'A.\n *\n * @param {Matrix}  a               The A Matrix\n * @param {boolean} ata             A value of true the function computes the etree of A'A\n */\nexport function csEtree (a, ata) {\n  // check inputs\n  if (!a) { return null }\n  // a arrays\n  const aindex = a._index\n  const aptr = a._ptr\n  const asize = a._size\n  // rows & columns\n  const m = asize[0]\n  const n = asize[1]\n\n  // allocate result\n  const parent = [] // (n)\n\n  // allocate workspace\n  const w = [] // (n + (ata ? m : 0))\n  const ancestor = 0 // first n entries in w\n  const prev = n // last m entries (ata = true)\n\n  let i, inext\n\n  // check we are calculating A'A\n  if (ata) {\n    // initialize workspace\n    for (i = 0; i < m; i++) { w[prev + i] = -1 }\n  }\n  // loop columns\n  for (let k = 0; k < n; k++) {\n    // node k has no parent yet\n    parent[k] = -1\n    // nor does k have an ancestor\n    w[ancestor + k] = -1\n    // values in column k\n    for (let p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {\n      // row\n      const r = aindex[p]\n      // node\n      i = ata ? (w[prev + r]) : r\n      // traverse from i to k\n      for (; i !== -1 && i < k; i = inext) {\n        // inext = ancestor of i\n        inext = w[ancestor + i]\n        // path compression\n        w[ancestor + i] = k\n        // check no anc., parent is k\n        if (inext === -1) { parent[i] = k }\n      }\n      if (ata) { w[prev + r] = k }\n    }\n  }\n  return parent\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csTdfs } from './csTdfs.js'\n\n/**\n * Post order a tree of forest\n *\n * @param {Array}   parent          The tree or forest\n * @param {Number}  n               Number of columns\n */\nexport function csPost (parent, n) {\n  // check inputs\n  if (!parent) { return null }\n  // vars\n  let k = 0\n  let j\n  // allocate result\n  const post = [] // (n)\n  // workspace, head: first n entries, next: next n entries, stack: last n entries\n  const w = [] // (3 * n)\n  const head = 0\n  const next = n\n  const stack = 2 * n\n  // initialize workspace\n  for (j = 0; j < n; j++) {\n    // empty linked lists\n    w[head + j] = -1\n  }\n  // traverse nodes in reverse order\n  for (j = n - 1; j >= 0; j--) {\n    // check j is a root\n    if (parent[j] === -1) { continue }\n    // add j to list of its parent\n    w[next + j] = w[head + parent[j]]\n    w[head + parent[j]] = j\n  }\n  // loop nodes\n  for (j = 0; j < n; j++) {\n    // skip j if it is not a root\n    if (parent[j] !== -1) { continue }\n    // depth-first search\n    k = csTdfs(j, k, w, head, next, post, stack)\n  }\n  return post\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Checks if the node at w[j] is marked\n *\n * @param {Array}   w               The array\n * @param {Number}  j               The array index\n */\nexport function csMarked (w, j) {\n  // check node is marked\n  return w[j] < 0\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { csFlip } from './csFlip.js'\n\n/**\n * Marks the node at w[j]\n *\n * @param {Array}   w               The array\n * @param {Number}  j               The array index\n */\nexport function csMark (w, j) {\n  // mark w[j]\n  w[j] = csFlip(w[j])\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csFlip } from './csFlip.js'\n\n/**\n * Flips the value if it is negative of returns the same value otherwise.\n *\n * @param {Number}  i               The value to flip\n */\nexport function csUnflip (i) {\n  // flip the value if it is negative\n  return i < 0 ? csFlip(i) : i\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csMarked } from './csMarked.js'\nimport { csMark } from './csMark.js'\nimport { csUnflip } from './csUnflip.js'\n\n/**\n * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting\n * at nodes in B (see csReach()).\n *\n * @param {Number}  j               The starting node for the DFS algorithm\n * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored\n * @param {Number}  top             Start index in stack xi[top..n-1]\n * @param {Number}  k               The kth column in B\n * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n *\n * @return {Number}                 New value of top\n */\nexport function csDfs (j, g, top, xi, pinv) {\n  // g arrays\n  const index = g._index\n  const ptr = g._ptr\n  const size = g._size\n  // columns\n  const n = size[1]\n  // vars\n  let i, p, p2\n  // initialize head\n  let head = 0\n  // initialize the recursion stack\n  xi[0] = j\n  // loop\n  while (head >= 0) {\n    // get j from the top of the recursion stack\n    j = xi[head]\n    // apply permutation vector\n    const jnew = pinv ? pinv[j] : j\n    // check node j is marked\n    if (!csMarked(ptr, j)) {\n      // mark node j as visited\n      csMark(ptr, j)\n      // update stack (last n entries in xi)\n      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew])\n    }\n    // node j done if no unvisited neighbors\n    let done = 1\n    // examine all neighbors of j, stack (last n entries in xi)\n    for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {\n      // consider neighbor node i\n      i = index[p]\n      // check we have visited node i, skip it\n      if (csMarked(ptr, i)) { continue }\n      // pause depth-first search of node j, update stack (last n entries in xi)\n      xi[n + head] = p\n      // start dfs at node i\n      xi[++head] = i\n      // node j is not done\n      done = 0\n      // break, to start dfs(i)\n      break\n    }\n    // check depth-first search at node j is done\n    if (done) {\n      // remove j from the recursion stack\n      head--\n      // and place in the output stack\n      xi[--top] = j\n    }\n  }\n  return top\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\nimport { csReach } from './csReach.js'\nimport { factory } from '../../../utils/factory.js'\n\nconst name = 'csSpsolve'\nconst dependencies = [\n  'divideScalar',\n  'multiply',\n  'subtract'\n]\n\nexport const createCsSpsolve = /* #__PURE__ */ factory(name, dependencies, ({ divideScalar, multiply, subtract }) => {\n  /**\n   * The function csSpsolve() computes the solution to G * x = bk, where bk is the\n   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the\n   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U\n   * is upper triangular with the diagonal entry as the last entry in each column.\n   *\n   * @param {Matrix}  g               The G matrix\n   * @param {Matrix}  b               The B matrix\n   * @param {Number}  k               The kth column in B\n   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n   *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n   * @param {Array}   x               The soluton to the linear system G * x = b\n   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b\n   * @param {boolean} lo              The lower (true) upper triangular (false) flag\n   *\n   * @return {Number}                 The index for the nonzero pattern\n   */\n  return function csSpsolve (g, b, k, xi, x, pinv, lo) {\n    // g arrays\n    const gvalues = g._values\n    const gindex = g._index\n    const gptr = g._ptr\n    const gsize = g._size\n    // columns\n    const n = gsize[1]\n    // b arrays\n    const bvalues = b._values\n    const bindex = b._index\n    const bptr = b._ptr\n    // vars\n    let p, p0, p1, q\n    // xi[top..n-1] = csReach(B(:,k))\n    const top = csReach(g, b, k, xi, pinv)\n    // clear x\n    for (p = top; p < n; p++) { x[xi[p]] = 0 }\n    // scatter b\n    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) { x[bindex[p]] = bvalues[p] }\n    // loop columns\n    for (let px = top; px < n; px++) {\n      // x array index for px\n      const j = xi[px]\n      // apply permutation vector (U x = b), j maps to column J of G\n      const J = pinv ? pinv[j] : j\n      // check column J is empty\n      if (J < 0) { continue }\n      // column value indeces in G, p0 <= p < p1\n      p0 = gptr[J]\n      p1 = gptr[J + 1]\n      // x(j) /= G(j,j)\n      x[j] = divideScalar(x[j], gvalues[lo ? p0 : (p1 - 1)])\n      // first entry L(j,j)\n      p = lo ? (p0 + 1) : p0\n      q = lo ? (p1) : (p1 - 1)\n      // loop\n      for (; p < q; p++) {\n        // row\n        const i = gindex[p]\n        // x(i) -= G(i,j) * x(j)\n        x[i] = subtract(x[i], multiply(gvalues[p], x[j]))\n      }\n    }\n    // return top of stack\n    return top\n  }\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { csMarked } from './csMarked.js'\nimport { csMark } from './csMark.js'\nimport { csDfs } from './csDfs.js'\n\n/**\n * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1\n * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The\n * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).\n *\n * @param {Matrix}  g               The G matrix\n * @param {Matrix}  b               The B matrix\n * @param {Number}  k               The kth column in B\n * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n\n *                                  The first n entries is the nonzero pattern, the last n entries is the stack\n * @param {Array}   pinv            The inverse row permutation vector\n *\n * @return {Number}                 The index for the nonzero pattern\n */\nexport function csReach (g, b, k, xi, pinv) {\n  // g arrays\n  const gptr = g._ptr\n  const gsize = g._size\n  // b arrays\n  const bindex = b._index\n  const bptr = b._ptr\n  // columns\n  const n = gsize[1]\n  // vars\n  let p, p0, p1\n  // initialize top\n  let top = n\n  // loop column indeces in B\n  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {\n    // node i\n    const i = bindex[p]\n    // check node i is marked\n    if (!csMarked(gptr, i)) {\n      // start a dfs at unmarked node i\n      top = csDfs(i, g, top, xi, pinv)\n    }\n  }\n  // loop columns from top -> n - 1\n  for (p = top; p < n; p++) {\n    // restore G\n    csMark(gptr, xi[p])\n  }\n  return top\n}\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\nimport { factory } from '../../../utils/factory.js'\nimport { createCsSpsolve } from './csSpsolve.js'\n\nconst name = 'csLu'\nconst dependencies = [\n  'abs',\n  'divideScalar',\n  'multiply',\n  'subtract',\n  'larger',\n  'largerEq',\n  'SparseMatrix'\n]\n\nexport const createCsLu = /* #__PURE__ */ factory(name, dependencies, ({ abs, divideScalar, multiply, subtract, larger, largerEq, SparseMatrix }) => {\n  const csSpsolve = createCsSpsolve({ divideScalar, multiply, subtract })\n\n  /**\n   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization\n   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L\n   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so\n   * L * U = A(p, q), where p is the inverse of pinv.\n   *\n   * @param {Matrix}  m               The A Matrix to factorize\n   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing\n   *                                  column ordering q\n   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Number}                 The numeric LU factorization of A or null\n   */\n  return function csLu (m, s, tol) {\n    // validate input\n    if (!m) { return null }\n    // m arrays\n    const size = m._size\n    // columns\n    const n = size[1]\n    // symbolic analysis result\n    let q\n    let lnz = 100\n    let unz = 100\n    // update symbolic analysis parameters\n    if (s) {\n      q = s.q\n      lnz = s.lnz || lnz\n      unz = s.unz || unz\n    }\n    // L arrays\n    const lvalues = [] // (lnz)\n    const lindex = [] // (lnz)\n    const lptr = [] // (n + 1)\n    // L\n    const L = new SparseMatrix({\n      values: lvalues,\n      index: lindex,\n      ptr: lptr,\n      size: [n, n]\n    })\n    // U arrays\n    const uvalues = [] // (unz)\n    const uindex = [] // (unz)\n    const uptr = [] // (n + 1)\n    // U\n    const U = new SparseMatrix({\n      values: uvalues,\n      index: uindex,\n      ptr: uptr,\n      size: [n, n]\n    })\n    // inverse of permutation vector\n    const pinv = [] // (n)\n    // vars\n    let i, p\n    // allocate arrays\n    const x = [] // (n)\n    const xi = [] // (2 * n)\n    // initialize variables\n    for (i = 0; i < n; i++) {\n      // clear workspace\n      x[i] = 0\n      // no rows pivotal yet\n      pinv[i] = -1\n      // no cols of L yet\n      lptr[i + 1] = 0\n    }\n    // reset number of nonzero elements in L and U\n    lnz = 0\n    unz = 0\n    // compute L(:,k) and U(:,k)\n    for (let k = 0; k < n; k++) {\n      // update ptr\n      lptr[k] = lnz\n      uptr[k] = unz\n      // apply column permutations if needed\n      const col = q ? q[k] : k\n      // solve triangular system, x = L\\A(:,col)\n      const top = csSpsolve(L, m, col, xi, x, pinv, 1)\n      // find pivot\n      let ipiv = -1\n      let a = -1\n      // loop xi[] from top -> n\n      for (p = top; p < n; p++) {\n        // x[i] is nonzero\n        i = xi[p]\n        // check row i is not yet pivotal\n        if (pinv[i] < 0) {\n          // absolute value of x[i]\n          const xabs = abs(x[i])\n          // check absoulte value is greater than pivot value\n          if (larger(xabs, a)) {\n            // largest pivot candidate so far\n            a = xabs\n            ipiv = i\n          }\n        } else {\n          // x(i) is the entry U(pinv[i],k)\n          uindex[unz] = pinv[i]\n          uvalues[unz++] = x[i]\n        }\n      }\n      // validate we found a valid pivot\n      if (ipiv === -1 || a <= 0) { return null }\n      // update actual pivot column, give preference to diagonal value\n      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) { ipiv = col }\n      // the chosen pivot\n      const pivot = x[ipiv]\n      // last entry in U(:,k) is U(k,k)\n      uindex[unz] = k\n      uvalues[unz++] = pivot\n      // ipiv is the kth pivot row\n      pinv[ipiv] = k\n      // first entry in L(:,k) is L(k,k) = 1\n      lindex[lnz] = ipiv\n      lvalues[lnz++] = 1\n      // L(k+1:n,k) = x / pivot\n      for (p = top; p < n; p++) {\n        // row\n        i = xi[p]\n        // check x(i) is an entry in L(:,k)\n        if (pinv[i] < 0) {\n          // save unpermuted row in L\n          lindex[lnz] = i\n          // scale pivot column\n          lvalues[lnz++] = divideScalar(x[i], pivot)\n        }\n        // x[0..n-1] = 0 for next k\n        x[i] = 0\n      }\n    }\n    // update ptr\n    lptr[n] = lnz\n    uptr[n] = unz\n    // fix row indices of L for final pinv\n    for (p = 0; p < lnz; p++) { lindex[p] = pinv[lindex[p]] }\n    // trim arrays\n    lvalues.splice(lnz, lvalues.length - lnz)\n    lindex.splice(lnz, lindex.length - lnz)\n    uvalues.splice(unz, uvalues.length - unz)\n    uindex.splice(unz, uindex.length - unz)\n    // return LU factor\n    return { L, U, pinv }\n  }\n})\n","import { isInteger } from '../../../utils/number.js'\nimport { factory } from '../../../utils/factory.js'\nimport { createCsSqr } from '../sparse/csSqr.js'\nimport { createCsLu } from '../sparse/csLu.js'\n\nconst name = 'slu'\nconst dependencies = [\n  'typed',\n  'abs',\n  'add',\n  'multiply',\n  'transpose',\n  'divideScalar',\n  'subtract',\n  'larger',\n  'largerEq',\n  'SparseMatrix'\n]\n\nexport const createSlu = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, multiply, transpose, divideScalar, subtract, larger, largerEq, SparseMatrix }) => {\n  const csSqr = createCsSqr({ add, multiply, transpose })\n  const csLu = createCsLu({ abs, divideScalar, multiply, subtract, larger, largerEq, SparseMatrix })\n\n  /**\n   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where\n   *\n   * `P * A * Q = L * U`\n   *\n   * Syntax:\n   *\n   *    math.slu(A, order, threshold)\n   *\n   * Examples:\n   *\n   *    const A = math.sparse([[4,3], [6, 3]])\n   *    math.slu(A, 1, 0.001)\n   *    // returns:\n   *    // {\n   *    //   L: [[1, 0], [1.5, 1]]\n   *    //   U: [[4, 3], [0, -1.5]]\n   *    //   p: [0, 1]\n   *    //   q: [0, 1]\n   *    // }\n   *\n   * See also:\n   *\n   *    lup, lsolve, usolve, lusolve\n   *\n   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.\n   * @param {Number}       order          The Symbolic Ordering and Analysis order:\n   *                                       0 - Natural ordering, no permutation vector q is returned\n   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'\n   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.\n   *                                           This is appropriatefor LU factorization of unsymmetric matrices.\n   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.\n   *                                           A dense row is a row with more than 10*sqr(columns) entries.\n   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)\n   *\n   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.\n   */\n  return typed(name, {\n\n    'SparseMatrix, number, number': function (a, order, threshold) {\n      // verify order\n      if (!isInteger(order) || order < 0 || order > 3) { throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]') }\n      // verify threshold\n      if (threshold < 0 || threshold > 1) { throw new Error('Partial pivoting threshold must be a number from 0 to 1') }\n\n      // perform symbolic ordering and analysis\n      const s = csSqr(order, a, false)\n\n      // perform lu decomposition\n      const f = csLu(a, s, threshold)\n\n      // return decomposition\n      return {\n        L: f.L,\n        U: f.U,\n        p: f.pinv,\n        q: s.q,\n        toString: function () {\n          return 'L: ' + this.L.toString() + '\\nU: ' + this.U.toString() + '\\np: ' + this.p.toString() + (this.q ? '\\nq: ' + this.q.toString() : '') + '\\n'\n        }\n      }\n    }\n  })\n})\n","// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.\n// SPDX-License-Identifier: LGPL-2.1+\n// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source\n\n/**\n * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.\n *\n * @param {Array} p           The permutation vector of length n. null value denotes identity\n * @param {Array} b           The input vector\n *\n * @return {Array}            The output vector x = P'b\n */\nexport function csIpvec (p, b) {\n  // vars\n  let k\n  const n = b.length\n  const x = []\n  // check permutation vector was provided, p = null denotes identity\n  if (p) {\n    // loop vector\n    for (k = 0; k < n; k++) {\n      // apply permutation\n      x[p[k]] = b[k]\n    }\n  } else {\n    // loop vector\n    for (k = 0; k < n; k++) {\n      // x[i] = b[i]\n      x[k] = b[k]\n    }\n  }\n  return x\n}\n","import { isArray, isMatrix } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\nimport { createSolveValidation } from './utils/solveValidation.js'\nimport { csIpvec } from '../sparse/csIpvec.js'\n\nconst name = 'lusolve'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'lup',\n  'slu',\n  'usolve',\n  'lsolve',\n  'DenseMatrix'\n]\n\nexport const createLusolve = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, lup, slu, usolve, lsolve, DenseMatrix }) => {\n  const solveValidation = createSolveValidation({ DenseMatrix })\n\n  /**\n   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.\n   *\n   * Syntax:\n   *\n   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b\n   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)\n   *\n   * Examples:\n   *\n   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]\n   *\n   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]\n   *\n   *    const f = math.lup(m)\n   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]\n   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]\n   *\n   *    const a = [[-2, 3], [2, 1]]\n   *    const b = [11, 9]\n   *    const x = math.lusolve(a, b)  // [[2], [5]]\n   *\n   * See also:\n   *\n   *    lup, slu, lsolve, usolve\n   *\n   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition\n   * @param {Matrix | Array} b               Column Vector\n   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix\n   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.\n   *\n   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b\n   */\n  return typed(name, {\n\n    'Array, Array | Matrix': function (a, b) {\n      a = matrix(a)\n      const d = lup(a)\n      const x = _lusolve(d.L, d.U, d.p, null, b)\n      return x.valueOf()\n    },\n\n    'DenseMatrix, Array | Matrix': function (a, b) {\n      const d = lup(a)\n      return _lusolve(d.L, d.U, d.p, null, b)\n    },\n\n    'SparseMatrix, Array | Matrix': function (a, b) {\n      const d = lup(a)\n      return _lusolve(d.L, d.U, d.p, null, b)\n    },\n\n    'SparseMatrix, Array | Matrix, number, number': function (a, b, order, threshold) {\n      const d = slu(a, order, threshold)\n      return _lusolve(d.L, d.U, d.p, d.q, b)\n    },\n\n    'Object, Array | Matrix': function (d, b) {\n      return _lusolve(d.L, d.U, d.p, d.q, b)\n    }\n  })\n\n  function _toMatrix (a) {\n    if (isMatrix(a)) { return a }\n    if (isArray(a)) { return matrix(a) }\n    throw new TypeError('Invalid Matrix LU decomposition')\n  }\n\n  function _lusolve (l, u, p, q, b) {\n    // verify decomposition\n    l = _toMatrix(l)\n    u = _toMatrix(u)\n\n    // apply row permutations if needed (b is a DenseMatrix)\n    if (p) {\n      b = solveValidation(l, b, true)\n      b._data = csIpvec(p, b._data)\n    }\n\n    // use forward substitution to resolve L * y = b\n    const y = lsolve(l, b)\n    // use backward substitution to resolve U * x = y\n    const x = usolve(u, y)\n\n    // apply column permutations if needed (x is a DenseMatrix)\n    if (q) { x._data = csIpvec(q, x._data) }\n\n    return x\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'polynomialRoot'\nconst dependencies = [\n  'typed',\n  'isZero',\n  'equalScalar',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'sqrt',\n  'unaryMinus',\n  'cbrt',\n  'typeOf',\n  'im',\n  're'\n]\n\nexport const createPolynomialRoot = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  isZero,\n  equalScalar,\n  add,\n  subtract,\n  multiply,\n  divide,\n  sqrt,\n  unaryMinus,\n  cbrt,\n  typeOf,\n  im,\n  re\n}) => {\n  /**\n   * Finds the numerical values of the distinct roots of a polynomial with real or complex coefficients.\n   * Currently operates only on linear, quadratic, and cubic polynomials using the standard\n   * formulas for the roots.\n   *\n   * Syntax:\n   *\n   *     math.polynomialRoot(constant, linearCoeff, quadraticCoeff, cubicCoeff)\n   *\n   * Examples:\n   *     // linear\n   *     math.polynomialRoot(6, 3)                                        // [-2]\n   *     math.polynomialRoot(math.complex(6,3), 3)                        // [-2 - i]\n   *     math.polynomialRoot(math.complex(6,3), math.complex(2,1))        // [-3 + 0i]\n   *     // quadratic\n   *     math.polynomialRoot(2, -3, 1)                                    // [2, 1]\n   *     math.polynomialRoot(8, 8, 2)                                     // [-2]\n   *     math.polynomialRoot(-2, 0, 1)                                    // [1.4142135623730951, -1.4142135623730951]\n   *     math.polynomialRoot(2, -2, 1)                                    // [1 + i, 1 - i]\n   *     math.polynomialRoot(math.complex(1,3), math.complex(-3, -2), 1)  // [2 + i, 1 + i]\n   *     // cubic\n   *     math.polynomialRoot(-6, 11, -6, 1)                               // [1, 3, 2]\n   *     math.polynomialRoot(-8, 0, 0, 1)                                 // [-1 - 1.7320508075688774i, 2, -1 + 1.7320508075688774i]\n   *     math.polynomialRoot(0, 8, 8, 2)                                  // [0, -2]\n   *     math.polynomialRoot(1, 1, 1, 1)                                  // [-1 + 0i, 0 - i, 0 + i]\n   *\n   * See also:\n   *     cbrt, sqrt\n   *\n   * @param {... number | Complex} coeffs\n   *     The coefficients of the polynomial, starting with with the constant coefficent, followed\n   *     by the linear coefficient and subsequent coefficients of increasing powers.\n   * @return {Array} The distinct roots of the polynomial\n   */\n\n  return typed(name, {\n    'number|Complex, ...number|Complex': (constant, restCoeffs) => {\n      const coeffs = [constant, ...restCoeffs]\n      while (coeffs.length > 0 && isZero(coeffs[coeffs.length - 1])) {\n        coeffs.pop()\n      }\n      if (coeffs.length < 2) {\n        throw new RangeError(\n          `Polynomial [${constant}, ${restCoeffs}] must have a non-zero non-constant coefficient`)\n      }\n      switch (coeffs.length) {\n        case 2: // linear\n          return [unaryMinus(divide(coeffs[0], coeffs[1]))]\n        case 3: { // quadratic\n          const [c, b, a] = coeffs\n          const denom = multiply(2, a)\n          const d1 = multiply(b, b)\n          const d2 = multiply(4, a, c)\n          if (equalScalar(d1, d2)) return [divide(unaryMinus(b), denom)]\n          const discriminant = sqrt(subtract(d1, d2))\n          return [\n            divide(subtract(discriminant, b), denom),\n            divide(subtract(unaryMinus(discriminant), b), denom)\n          ]\n        }\n        case 4: { // cubic, cf. https://en.wikipedia.org/wiki/Cubic_equation\n          const [d, c, b, a] = coeffs\n          const denom = unaryMinus(multiply(3, a))\n          const D0_1 = multiply(b, b)\n          const D0_2 = multiply(3, a, c)\n          const D1_1 = add(multiply(2, b, b, b), multiply(27, a, a, d))\n          const D1_2 = multiply(9, a, b, c)\n          if (equalScalar(D0_1, D0_2) && equalScalar(D1_1, D1_2)) {\n            return [divide(b, denom)]\n          }\n          const Delta0 = subtract(D0_1, D0_2)\n          const Delta1 = subtract(D1_1, D1_2)\n          const discriminant1 = add(\n            multiply(18, a, b, c, d), multiply(b, b, c, c))\n          const discriminant2 = add(\n            multiply(4, b, b, b, d),\n            multiply(4, a, c, c, c),\n            multiply(27, a, a, d, d))\n          if (equalScalar(discriminant1, discriminant2)) {\n            return [\n              divide(\n                subtract(\n                  multiply(4, a, b, c),\n                  add(multiply(9, a, a, d), multiply(b, b, b))),\n                multiply(a, Delta0)), // simple root\n              divide(\n                subtract(multiply(9, a, d), multiply(b, c)),\n                multiply(2, Delta0)) // double root\n            ]\n          }\n          // OK, we have three distinct roots\n          let Ccubed\n          if (equalScalar(D0_1, D0_2)) {\n            Ccubed = Delta1\n          } else {\n            Ccubed = divide(\n              add(\n                Delta1,\n                sqrt(subtract(\n                  multiply(Delta1, Delta1), multiply(4, Delta0, Delta0, Delta0)))\n              ),\n              2)\n          }\n          const allRoots = true\n          const rawRoots = cbrt(Ccubed, allRoots).toArray().map(\n            C => divide(add(b, C, divide(Delta0, C)), denom))\n          return rawRoots.map(r => {\n            if (typeOf(r) === 'Complex' && equalScalar(re(r), re(r) + im(r))) {\n              return re(r)\n            }\n            return r\n          })\n        }\n        default:\n          throw new RangeError(`only implemented for cubic or lower-order polynomials, not ${coeffs}`)\n      }\n    }\n  })\n})\n","import { isHelp } from '../utils/is.js'\nimport { clone } from '../utils/object.js'\nimport { format } from '../utils/string.js'\nimport { factory } from '../utils/factory.js'\n\nconst name = 'Help'\nconst dependencies = ['evaluate']\n\nexport const createHelpClass = /* #__PURE__ */ factory(name, dependencies, ({ evaluate }) => {\n  /**\n   * Documentation object\n   * @param {Object} doc  Object containing properties:\n   *                      {string} name\n   *                      {string} category\n   *                      {string} description\n   *                      {string[]} syntax\n   *                      {string[]} examples\n   *                      {string[]} seealso\n   * @constructor\n   */\n  function Help (doc) {\n    if (!(this instanceof Help)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (!doc) throw new Error('Argument \"doc\" missing')\n\n    this.doc = doc\n  }\n\n  /**\n   * Attach type information\n   */\n  Help.prototype.type = 'Help'\n  Help.prototype.isHelp = true\n\n  /**\n   * Generate a string representation of the Help object\n   * @return {string} Returns a string\n   * @private\n   */\n  Help.prototype.toString = function () {\n    const doc = this.doc || {}\n    let desc = '\\n'\n\n    if (doc.name) {\n      desc += 'Name: ' + doc.name + '\\n\\n'\n    }\n    if (doc.category) {\n      desc += 'Category: ' + doc.category + '\\n\\n'\n    }\n    if (doc.description) {\n      desc += 'Description:\\n    ' + doc.description + '\\n\\n'\n    }\n    if (doc.syntax) {\n      desc += 'Syntax:\\n    ' + doc.syntax.join('\\n    ') + '\\n\\n'\n    }\n    if (doc.examples) {\n      desc += 'Examples:\\n'\n\n      // after evaluating the examples, we restore config in case the examples\n      // did change the config.\n      let configChanged = false\n      const originalConfig = evaluate('config()')\n\n      const scope = {\n        config: (newConfig) => {\n          configChanged = true\n          return evaluate('config(newConfig)', { newConfig })\n        }\n      }\n\n      for (let i = 0; i < doc.examples.length; i++) {\n        const expr = doc.examples[i]\n        desc += '    ' + expr + '\\n'\n\n        let res\n        try {\n          // note: res can be undefined when `expr` is an empty string\n          res = evaluate(expr, scope)\n        } catch (e) {\n          res = e\n        }\n        if (res !== undefined && !isHelp(res)) {\n          desc += '        ' + format(res, { precision: 14 }) + '\\n'\n        }\n      }\n      desc += '\\n'\n\n      if (configChanged) {\n        evaluate('config(originalConfig)', { originalConfig })\n      }\n    }\n    if (doc.mayThrow && doc.mayThrow.length) {\n      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\\n\\n'\n    }\n    if (doc.seealso && doc.seealso.length) {\n      desc += 'See also: ' + doc.seealso.join(', ') + '\\n'\n    }\n\n    return desc\n  }\n\n  /**\n   * Export the help object to JSON\n   */\n  Help.prototype.toJSON = function () {\n    const obj = clone(this.doc)\n    obj.mathjs = 'Help'\n    return obj\n  }\n\n  /**\n   * Instantiate a Help object from a JSON object\n   * @param {Object} json\n   * @returns {Help} Returns a new Help object\n   */\n  Help.fromJSON = function (json) {\n    const doc = {}\n\n    Object.keys(json)\n      .filter(prop => prop !== 'mathjs')\n      .forEach(prop => {\n        doc[prop] = json[prop]\n      })\n\n    return new Help(doc)\n  }\n\n  /**\n   * Returns a string representation of the Help object\n   */\n  Help.prototype.valueOf = Help.prototype.toString\n\n  return Help\n}, { isClass: true })\n","import { isChain } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { hasOwnProperty, lazy } from '../../utils/object.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'Chain'\nconst dependencies = ['?on', 'math', 'typed']\n\nexport const createChainClass = /* #__PURE__ */ factory(name, dependencies, ({ on, math, typed }) => {\n  /**\n   * @constructor Chain\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing chain.done(), which will return\n   * the final value.\n   *\n   * The Chain has a number of special functions:\n   * - done()             Finalize the chained operation and return the\n   *                      chain's value.\n   * - valueOf()          The same as done()\n   * - toString()         Returns a string representation of the chain's value.\n   *\n   * @param {*} [value]\n   */\n  function Chain (value) {\n    if (!(this instanceof Chain)) {\n      throw new SyntaxError('Constructor must be called with the new operator')\n    }\n\n    if (isChain(value)) {\n      this.value = value.value\n    } else {\n      this.value = value\n    }\n  }\n\n  /**\n   * Attach type information\n   */\n  Chain.prototype.type = 'Chain'\n  Chain.prototype.isChain = true\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method valueOf()\n   * @returns {*} value\n   */\n  Chain.prototype.done = function () {\n    return this.value\n  }\n\n  /**\n   * Close the chain. Returns the final value.\n   * Does the same as method done()\n   * @returns {*} value\n   */\n  Chain.prototype.valueOf = function () {\n    return this.value\n  }\n\n  /**\n   * Get a string representation of the value in the chain\n   * @returns {string}\n   */\n  Chain.prototype.toString = function () {\n    return format(this.value)\n  }\n\n  /**\n   * Get a JSON representation of the chain\n   * @returns {Object}\n   */\n  Chain.prototype.toJSON = function () {\n    return {\n      mathjs: 'Chain',\n      value: this.value\n    }\n  }\n\n  /**\n   * Instantiate a Chain from its JSON representation\n   * @param {Object} json  An object structured like\n   *                       `{\"mathjs\": \"Chain\", value: ...}`,\n   *                       where mathjs is optional\n   * @returns {Chain}\n   */\n  Chain.fromJSON = function (json) {\n    return new Chain(json.value)\n  }\n\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {Function} fn      The function to be proxied\n   *                           If fn is no function, it is silently ignored.\n   * @private\n   */\n  function createProxy (name, fn) {\n    if (typeof fn === 'function') {\n      Chain.prototype[name] = chainify(fn)\n    }\n  }\n\n  /**\n   * Create a proxy method for the chain\n   * @param {string} name\n   * @param {function} resolver   The function resolving with the\n   *                              function to be proxied\n   * @private\n   */\n  function createLazyProxy (name, resolver) {\n    lazy(Chain.prototype, name, function outerResolver () {\n      const fn = resolver()\n      if (typeof fn === 'function') {\n        return chainify(fn)\n      }\n\n      return undefined // if not a function, ignore\n    })\n  }\n\n  /**\n   * Make a function chainable\n   * @param {function} fn\n   * @return {Function} chain function\n   * @private\n   */\n  function chainify (fn) {\n    return function () {\n      // Here, `this` will be the context of a Chain instance\n      if (arguments.length === 0) {\n        return new Chain(fn(this.value))\n      }\n      const args = [this.value]\n      for (let i = 0; i < arguments.length; i++) {\n        args[i + 1] = arguments[i]\n      }\n      if (typed.isTypedFunction(fn)) {\n        const sigObject = typed.resolve(fn, args)\n        // We want to detect if a rest parameter has matched across the\n        // value in the chain and the current arguments of this call.\n        // That is the case if and only if the matching signature has\n        // exactly one parameter (which then must be a rest parameter\n        // as it is matching at least two actual arguments).\n        if (sigObject.params.length === 1) {\n          throw new Error('chain function ' + fn.name + ' cannot match rest parameter between chain value and additional arguments.')\n        }\n        return new Chain(sigObject.implementation.apply(fn, args))\n      }\n      return new Chain(fn.apply(fn, args))\n    }\n  }\n\n  /**\n   * Create a proxy for a single method, or an object with multiple methods.\n   * Example usage:\n   *\n   *   Chain.createProxy('add', function add (x, y) {...})\n   *   Chain.createProxy({\n   *     add:      function add (x, y) {...},\n   *     subtract: function subtract (x, y) {...}\n   *   }\n   *\n   * @param {string | Object} arg0   A name (string), or an object with\n   *                                 functions\n   * @param {*} [arg1]               A function, when arg0 is a name\n   */\n  Chain.createProxy = function (arg0, arg1) {\n    if (typeof arg0 === 'string') {\n      // createProxy(name, value)\n      createProxy(arg0, arg1)\n    } else {\n      // createProxy(values)\n      for (const name in arg0) {\n        if (hasOwnProperty(arg0, name) && excludedNames[name] === undefined) {\n          createLazyProxy(name, () => arg0[name])\n        }\n      }\n    }\n  }\n\n  const excludedNames = {\n    expression: true,\n    docs: true,\n    type: true,\n    classes: true,\n    json: true,\n    error: true,\n    isChain: true // conflicts with the property isChain of a Chain instance\n  }\n\n  // create proxy for everything that is in math.js\n  Chain.createProxy(math)\n\n  // register on the import event, automatically add a proxy for every imported function.\n  if (on) {\n    on('import', function (name, resolver, path) {\n      if (!path) {\n        // an imported function (not a data type or something special)\n        createLazyProxy(name, resolver)\n      }\n    })\n  }\n\n  return Chain\n}, { isClass: true })\n","export const eDocs = {\n  name: 'e',\n  category: 'Constants',\n  syntax: [\n    'e'\n  ],\n  description: 'Euler\\'s number, the base of the natural logarithm. Approximately equal to 2.71828',\n  examples: [\n    'e',\n    'e ^ 2',\n    'exp(2)',\n    'log(e)'\n  ],\n  seealso: ['exp']\n}\n","export const piDocs = {\n  name: 'pi',\n  category: 'Constants',\n  syntax: [\n    'pi'\n  ],\n  description: 'The number pi is a mathematical constant that is the ratio of a circle\\'s circumference to its diameter, and is approximately equal to 3.14159',\n  examples: [\n    'pi',\n    'sin(pi/2)'\n  ],\n  seealso: ['tau']\n}\n","import { eDocs } from './constants/e.js'\nimport { falseDocs } from './constants/false.js'\nimport { iDocs } from './constants/i.js'\nimport { InfinityDocs } from './constants/Infinity.js'\nimport { LN10Docs } from './constants/LN10.js'\nimport { LN2Docs } from './constants/LN2.js'\nimport { LOG10EDocs } from './constants/LOG10E.js'\nimport { LOG2EDocs } from './constants/LOG2E.js'\nimport { NaNDocs } from './constants/NaN.js'\nimport { nullDocs } from './constants/null.js'\nimport { phiDocs } from './constants/phi.js'\nimport { piDocs } from './constants/pi.js'\nimport { SQRT12Docs } from './constants/SQRT1_2.js'\nimport { SQRT2Docs } from './constants/SQRT2.js'\nimport { tauDocs } from './constants/tau.js'\nimport { trueDocs } from './constants/true.js'\nimport { versionDocs } from './constants/version.js'\nimport { bignumberDocs } from './construction/bignumber.js'\nimport { bigintDocs } from './construction/bigint.js'\nimport { booleanDocs } from './construction/boolean.js'\nimport { complexDocs } from './construction/complex.js'\nimport { createUnitDocs } from './construction/createUnit.js'\nimport { fractionDocs } from './construction/fraction.js'\nimport { indexDocs } from './construction/index.js'\nimport { matrixDocs } from './construction/matrix.js'\nimport { numberDocs } from './construction/number.js'\nimport { sparseDocs } from './construction/sparse.js'\nimport { splitUnitDocs } from './construction/splitUnit.js'\nimport { stringDocs } from './construction/string.js'\nimport { unitDocs } from './construction/unit.js'\nimport { configDocs } from './core/config.js'\nimport { importDocs } from './core/import.js'\nimport { typedDocs } from './core/typed.js'\nimport { derivativeDocs } from './function/algebra/derivative.js'\nimport { leafCountDocs } from './function/algebra/leafCount.js'\nimport { lsolveDocs } from './function/algebra/lsolve.js'\nimport { lsolveAllDocs } from './function/algebra/lsolveAll.js'\nimport { lupDocs } from './function/algebra/lup.js'\nimport { lusolveDocs } from './function/algebra/lusolve.js'\nimport { polynomialRootDocs } from './function/algebra/polynomialRoot.js'\nimport { qrDocs } from './function/algebra/qr.js'\nimport { rationalizeDocs } from './function/algebra/rationalize.js'\nimport { resolveDocs } from './function/algebra/resolve.js'\nimport { simplifyDocs } from './function/algebra/simplify.js'\nimport { simplifyConstantDocs } from './function/algebra/simplifyConstant.js'\nimport { simplifyCoreDocs } from './function/algebra/simplifyCore.js'\nimport { sluDocs } from './function/algebra/slu.js'\nimport { symbolicEqualDocs } from './function/algebra/symbolicEqual.js'\nimport { usolveDocs } from './function/algebra/usolve.js'\nimport { usolveAllDocs } from './function/algebra/usolveAll.js'\nimport { absDocs } from './function/arithmetic/abs.js'\nimport { addDocs } from './function/arithmetic/add.js'\nimport { cbrtDocs } from './function/arithmetic/cbrt.js'\nimport { ceilDocs } from './function/arithmetic/ceil.js'\nimport { cubeDocs } from './function/arithmetic/cube.js'\nimport { divideDocs } from './function/arithmetic/divide.js'\nimport { dotDivideDocs } from './function/arithmetic/dotDivide.js'\nimport { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js'\nimport { dotPowDocs } from './function/arithmetic/dotPow.js'\nimport { expDocs } from './function/arithmetic/exp.js'\nimport { expmDocs } from './function/arithmetic/expm.js'\nimport { expm1Docs } from './function/arithmetic/expm1.js'\nimport { fixDocs } from './function/arithmetic/fix.js'\nimport { floorDocs } from './function/arithmetic/floor.js'\nimport { gcdDocs } from './function/arithmetic/gcd.js'\nimport { hypotDocs } from './function/arithmetic/hypot.js'\nimport { invmodDocs } from './function/arithmetic/invmod.js'\nimport { lcmDocs } from './function/arithmetic/lcm.js'\nimport { logDocs } from './function/arithmetic/log.js'\nimport { log10Docs } from './function/arithmetic/log10.js'\nimport { log1pDocs } from './function/arithmetic/log1p.js'\nimport { log2Docs } from './function/arithmetic/log2.js'\nimport { modDocs } from './function/arithmetic/mod.js'\nimport { multiplyDocs } from './function/arithmetic/multiply.js'\nimport { normDocs } from './function/arithmetic/norm.js'\nimport { nthRootDocs } from './function/arithmetic/nthRoot.js'\nimport { nthRootsDocs } from './function/arithmetic/nthRoots.js'\nimport { powDocs } from './function/arithmetic/pow.js'\nimport { roundDocs } from './function/arithmetic/round.js'\nimport { signDocs } from './function/arithmetic/sign.js'\nimport { sqrtDocs } from './function/arithmetic/sqrt.js'\nimport { sqrtmDocs } from './function/arithmetic/sqrtm.js'\nimport { sylvesterDocs } from './function/algebra/sylvester.js'\nimport { schurDocs } from './function/algebra/schur.js'\nimport { lyapDocs } from './function/algebra/lyap.js'\nimport { squareDocs } from './function/arithmetic/square.js'\nimport { subtractDocs } from './function/arithmetic/subtract.js'\nimport { unaryMinusDocs } from './function/arithmetic/unaryMinus.js'\nimport { unaryPlusDocs } from './function/arithmetic/unaryPlus.js'\nimport { xgcdDocs } from './function/arithmetic/xgcd.js'\nimport { bitAndDocs } from './function/bitwise/bitAnd.js'\nimport { bitNotDocs } from './function/bitwise/bitNot.js'\nimport { bitOrDocs } from './function/bitwise/bitOr.js'\nimport { bitXorDocs } from './function/bitwise/bitXor.js'\nimport { leftShiftDocs } from './function/bitwise/leftShift.js'\nimport { rightArithShiftDocs } from './function/bitwise/rightArithShift.js'\nimport { rightLogShiftDocs } from './function/bitwise/rightLogShift.js'\nimport { bellNumbersDocs } from './function/combinatorics/bellNumbers.js'\nimport { catalanDocs } from './function/combinatorics/catalan.js'\nimport { compositionDocs } from './function/combinatorics/composition.js'\nimport { stirlingS2Docs } from './function/combinatorics/stirlingS2.js'\nimport { argDocs } from './function/complex/arg.js'\nimport { conjDocs } from './function/complex/conj.js'\nimport { imDocs } from './function/complex/im.js'\nimport { reDocs } from './function/complex/re.js'\nimport { evaluateDocs } from './function/expression/evaluate.js'\nimport { parserDocs } from './function/expression/parser.js'\nimport { parseDocs } from './function/expression/parse.js'\nimport { compileDocs } from './function/expression/compile.js'\nimport { helpDocs } from './function/expression/help.js'\nimport { distanceDocs } from './function/geometry/distance.js'\nimport { intersectDocs } from './function/geometry/intersect.js'\nimport { andDocs } from './function/logical/and.js'\nimport { notDocs } from './function/logical/not.js'\nimport { nullishDocs } from './function/logical/nullish.js'\nimport { orDocs } from './function/logical/or.js'\nimport { xorDocs } from './function/logical/xor.js'\nimport { mapSlicesDocs } from './function/matrix/mapSlices.js'\nimport { columnDocs } from './function/matrix/column.js'\nimport { concatDocs } from './function/matrix/concat.js'\nimport { countDocs } from './function/matrix/count.js'\nimport { crossDocs } from './function/matrix/cross.js'\nimport { ctransposeDocs } from './function/matrix/ctranspose.js'\nimport { detDocs } from './function/matrix/det.js'\nimport { diagDocs } from './function/matrix/diag.js'\nimport { diffDocs } from './function/matrix/diff.js'\nimport { dotDocs } from './function/matrix/dot.js'\nimport { eigsDocs } from './function/matrix/eigs.js'\nimport { filterDocs } from './function/matrix/filter.js'\nimport { flattenDocs } from './function/matrix/flatten.js'\nimport { forEachDocs } from './function/matrix/forEach.js'\nimport { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js'\nimport { identityDocs } from './function/matrix/identity.js'\nimport { invDocs } from './function/matrix/inv.js'\nimport { pinvDocs } from './function/matrix/pinv.js'\nimport { kronDocs } from './function/matrix/kron.js'\nimport { mapDocs } from './function/matrix/map.js'\nimport { matrixFromColumnsDocs } from './function/matrix/matrixFromColumns.js'\nimport { matrixFromFunctionDocs } from './function/matrix/matrixFromFunction.js'\nimport { matrixFromRowsDocs } from './function/matrix/matrixFromRows.js'\nimport { onesDocs } from './function/matrix/ones.js'\nimport { partitionSelectDocs } from './function/matrix/partitionSelect.js'\nimport { rangeDocs } from './function/matrix/range.js'\nimport { reshapeDocs } from './function/matrix/reshape.js'\nimport { resizeDocs } from './function/matrix/resize.js'\nimport { rotateDocs } from './function/matrix/rotate.js'\nimport { rotationMatrixDocs } from './function/matrix/rotationMatrix.js'\nimport { rowDocs } from './function/matrix/row.js'\nimport { sizeDocs } from './function/matrix/size.js'\nimport { sortDocs } from './function/matrix/sort.js'\nimport { squeezeDocs } from './function/matrix/squeeze.js'\nimport { subsetDocs } from './function/matrix/subset.js'\nimport { traceDocs } from './function/matrix/trace.js'\nimport { transposeDocs } from './function/matrix/transpose.js'\nimport { zerosDocs } from './function/matrix/zeros.js'\nimport { fftDocs } from './function/matrix/fft.js'\nimport { ifftDocs } from './function/matrix/ifft.js'\nimport { combinationsDocs } from './function/probability/combinations.js'\nimport { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js'\nimport { factorialDocs } from './function/probability/factorial.js'\nimport { gammaDocs } from './function/probability/gamma.js'\nimport { lgammaDocs } from './function/probability/lgamma.js'\nimport { kldivergenceDocs } from './function/probability/kldivergence.js'\nimport { multinomialDocs } from './function/probability/multinomial.js'\nimport { permutationsDocs } from './function/probability/permutations.js'\nimport { pickRandomDocs } from './function/probability/pickRandom.js'\nimport { randomDocs } from './function/probability/random.js'\nimport { randomIntDocs } from './function/probability/randomInt.js'\nimport { compareDocs } from './function/relational/compare.js'\nimport { compareNaturalDocs } from './function/relational/compareNatural.js'\nimport { compareTextDocs } from './function/relational/compareText.js'\nimport { deepEqualDocs } from './function/relational/deepEqual.js'\nimport { equalDocs } from './function/relational/equal.js'\nimport { equalTextDocs } from './function/relational/equalText.js'\nimport { largerDocs } from './function/relational/larger.js'\nimport { largerEqDocs } from './function/relational/largerEq.js'\nimport { smallerDocs } from './function/relational/smaller.js'\nimport { smallerEqDocs } from './function/relational/smallerEq.js'\nimport { unequalDocs } from './function/relational/unequal.js'\nimport { setCartesianDocs } from './function/set/setCartesian.js'\nimport { setDifferenceDocs } from './function/set/setDifference.js'\nimport { setDistinctDocs } from './function/set/setDistinct.js'\nimport { setIntersectDocs } from './function/set/setIntersect.js'\nimport { setIsSubsetDocs } from './function/set/setIsSubset.js'\nimport { setMultiplicityDocs } from './function/set/setMultiplicity.js'\nimport { setPowersetDocs } from './function/set/setPowerset.js'\nimport { setSizeDocs } from './function/set/setSize.js'\nimport { setSymDifferenceDocs } from './function/set/setSymDifference.js'\nimport { setUnionDocs } from './function/set/setUnion.js'\nimport { zpk2tfDocs } from './function/signal/zpk2tf.js'\nimport { freqzDocs } from './function/signal/freqz.js'\nimport { erfDocs } from './function/special/erf.js'\nimport { zetaDocs } from './function/special/zeta.js'\nimport { madDocs } from './function/statistics/mad.js'\nimport { maxDocs } from './function/statistics/max.js'\nimport { meanDocs } from './function/statistics/mean.js'\nimport { medianDocs } from './function/statistics/median.js'\nimport { minDocs } from './function/statistics/min.js'\nimport { modeDocs } from './function/statistics/mode.js'\nimport { prodDocs } from './function/statistics/prod.js'\nimport { quantileSeqDocs } from './function/statistics/quantileSeq.js'\nimport { stdDocs } from './function/statistics/std.js'\nimport { cumSumDocs } from './function/statistics/cumsum.js'\nimport { sumDocs } from './function/statistics/sum.js'\nimport { varianceDocs } from './function/statistics/variance.js'\nimport { corrDocs } from './function/statistics/corr.js'\nimport { acosDocs } from './function/trigonometry/acos.js'\nimport { acoshDocs } from './function/trigonometry/acosh.js'\nimport { acotDocs } from './function/trigonometry/acot.js'\nimport { acothDocs } from './function/trigonometry/acoth.js'\nimport { acscDocs } from './function/trigonometry/acsc.js'\nimport { acschDocs } from './function/trigonometry/acsch.js'\nimport { asecDocs } from './function/trigonometry/asec.js'\nimport { asechDocs } from './function/trigonometry/asech.js'\nimport { asinDocs } from './function/trigonometry/asin.js'\nimport { asinhDocs } from './function/trigonometry/asinh.js'\nimport { atanDocs } from './function/trigonometry/atan.js'\nimport { atan2Docs } from './function/trigonometry/atan2.js'\nimport { atanhDocs } from './function/trigonometry/atanh.js'\nimport { cosDocs } from './function/trigonometry/cos.js'\nimport { coshDocs } from './function/trigonometry/cosh.js'\nimport { cotDocs } from './function/trigonometry/cot.js'\nimport { cothDocs } from './function/trigonometry/coth.js'\nimport { cscDocs } from './function/trigonometry/csc.js'\nimport { cschDocs } from './function/trigonometry/csch.js'\nimport { secDocs } from './function/trigonometry/sec.js'\nimport { sechDocs } from './function/trigonometry/sech.js'\nimport { sinDocs } from './function/trigonometry/sin.js'\nimport { sinhDocs } from './function/trigonometry/sinh.js'\nimport { tanDocs } from './function/trigonometry/tan.js'\nimport { tanhDocs } from './function/trigonometry/tanh.js'\nimport { toDocs } from './function/units/to.js'\nimport { toBestDocs } from './function/units/toBest.js'\nimport { binDocs } from './function/utils/bin.js'\nimport { cloneDocs } from './function/utils/clone.js'\nimport { formatDocs } from './function/utils/format.js'\nimport { hasNumericValueDocs } from './function/utils/hasNumericValue.js'\nimport { hexDocs } from './function/utils/hex.js'\nimport { isIntegerDocs } from './function/utils/isInteger.js'\nimport { isNaNDocs } from './function/utils/isNaN.js'\nimport { isNegativeDocs } from './function/utils/isNegative.js'\nimport { isNumericDocs } from './function/utils/isNumeric.js'\nimport { isPositiveDocs } from './function/utils/isPositive.js'\nimport { isPrimeDocs } from './function/utils/isPrime.js'\nimport { isZeroDocs } from './function/utils/isZero.js'\nimport { numericDocs } from './function/utils/numeric.js'\nimport { octDocs } from './function/utils/oct.js'\nimport { printDocs } from './function/utils/print.js'\nimport { typeOfDocs } from './function/utils/typeOf.js'\nimport { solveODEDocs } from './function/numeric/solveODE.js'\n\nexport const embeddedDocs = {\n\n  // construction functions\n  bignumber: bignumberDocs,\n  bigint: bigintDocs,\n  boolean: booleanDocs,\n  complex: complexDocs,\n  createUnit: createUnitDocs,\n  fraction: fractionDocs,\n  index: indexDocs,\n  matrix: matrixDocs,\n  number: numberDocs,\n  sparse: sparseDocs,\n  splitUnit: splitUnitDocs,\n  string: stringDocs,\n  unit: unitDocs,\n\n  // constants\n  e: eDocs,\n  E: eDocs,\n  false: falseDocs,\n  i: iDocs,\n  Infinity: InfinityDocs,\n  LN2: LN2Docs,\n  LN10: LN10Docs,\n  LOG2E: LOG2EDocs,\n  LOG10E: LOG10EDocs,\n  NaN: NaNDocs,\n  null: nullDocs,\n  pi: piDocs,\n  PI: piDocs,\n  phi: phiDocs,\n  SQRT1_2: SQRT12Docs,\n  SQRT2: SQRT2Docs,\n  tau: tauDocs,\n  true: trueDocs,\n  version: versionDocs,\n\n  // physical constants\n  // TODO: more detailed docs for physical constants\n  speedOfLight: { description: 'Speed of light in vacuum', examples: ['speedOfLight'] },\n  gravitationConstant: { description: 'Newtonian constant of gravitation', examples: ['gravitationConstant'] },\n  planckConstant: { description: 'Planck constant', examples: ['planckConstant'] },\n  reducedPlanckConstant: { description: 'Reduced Planck constant', examples: ['reducedPlanckConstant'] },\n\n  magneticConstant: { description: 'Magnetic constant (vacuum permeability)', examples: ['magneticConstant'] },\n  electricConstant: { description: 'Electric constant (vacuum permeability)', examples: ['electricConstant'] },\n  vacuumImpedance: { description: 'Characteristic impedance of vacuum', examples: ['vacuumImpedance'] },\n  coulomb: { description: 'Coulomb\\'s constant. Deprecated in favor of coulombConstant', examples: ['coulombConstant'] },\n  coulombConstant: { description: 'Coulomb\\'s constant', examples: ['coulombConstant'] },\n  elementaryCharge: { description: 'Elementary charge', examples: ['elementaryCharge'] },\n  bohrMagneton: { description: 'Bohr magneton', examples: ['bohrMagneton'] },\n  conductanceQuantum: { description: 'Conductance quantum', examples: ['conductanceQuantum'] },\n  inverseConductanceQuantum: { description: 'Inverse conductance quantum', examples: ['inverseConductanceQuantum'] },\n  // josephson: {description: 'Josephson constant', examples: ['josephson']},\n  magneticFluxQuantum: { description: 'Magnetic flux quantum', examples: ['magneticFluxQuantum'] },\n  nuclearMagneton: { description: 'Nuclear magneton', examples: ['nuclearMagneton'] },\n  klitzing: { description: 'Von Klitzing constant', examples: ['klitzing'] },\n\n  bohrRadius: { description: 'Bohr radius', examples: ['bohrRadius'] },\n  classicalElectronRadius: { description: 'Classical electron radius', examples: ['classicalElectronRadius'] },\n  electronMass: { description: 'Electron mass', examples: ['electronMass'] },\n  fermiCoupling: { description: 'Fermi coupling constant', examples: ['fermiCoupling'] },\n  fineStructure: { description: 'Fine-structure constant', examples: ['fineStructure'] },\n  hartreeEnergy: { description: 'Hartree energy', examples: ['hartreeEnergy'] },\n  protonMass: { description: 'Proton mass', examples: ['protonMass'] },\n  deuteronMass: { description: 'Deuteron Mass', examples: ['deuteronMass'] },\n  neutronMass: { description: 'Neutron mass', examples: ['neutronMass'] },\n  quantumOfCirculation: { description: 'Quantum of circulation', examples: ['quantumOfCirculation'] },\n  rydberg: { description: 'Rydberg constant', examples: ['rydberg'] },\n  thomsonCrossSection: { description: 'Thomson cross section', examples: ['thomsonCrossSection'] },\n  weakMixingAngle: { description: 'Weak mixing angle', examples: ['weakMixingAngle'] },\n  efimovFactor: { description: 'Efimov factor', examples: ['efimovFactor'] },\n\n  atomicMass: { description: 'Atomic mass constant', examples: ['atomicMass'] },\n  avogadro: { description: 'Avogadro\\'s number', examples: ['avogadro'] },\n  boltzmann: { description: 'Boltzmann constant', examples: ['boltzmann'] },\n  faraday: { description: 'Faraday constant', examples: ['faraday'] },\n  firstRadiation: { description: 'First radiation constant', examples: ['firstRadiation'] },\n  loschmidt: { description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa', examples: ['loschmidt'] },\n  gasConstant: { description: 'Gas constant', examples: ['gasConstant'] },\n  molarPlanckConstant: { description: 'Molar Planck constant', examples: ['molarPlanckConstant'] },\n  molarVolume: { description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa', examples: ['molarVolume'] },\n  sackurTetrode: { description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa', examples: ['sackurTetrode'] },\n  secondRadiation: { description: 'Second radiation constant', examples: ['secondRadiation'] },\n  stefanBoltzmann: { description: 'Stefan-Boltzmann constant', examples: ['stefanBoltzmann'] },\n  wienDisplacement: { description: 'Wien displacement law constant', examples: ['wienDisplacement'] },\n  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},\n\n  molarMass: { description: 'Molar mass constant', examples: ['molarMass'] },\n  molarMassC12: { description: 'Molar mass constant of carbon-12', examples: ['molarMassC12'] },\n  gravity: { description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)', examples: ['gravity'] },\n\n  planckLength: { description: 'Planck length', examples: ['planckLength'] },\n  planckMass: { description: 'Planck mass', examples: ['planckMass'] },\n  planckTime: { description: 'Planck time', examples: ['planckTime'] },\n  planckCharge: { description: 'Planck charge', examples: ['planckCharge'] },\n  planckTemperature: { description: 'Planck temperature', examples: ['planckTemperature'] },\n\n  // functions - algebra\n  derivative: derivativeDocs,\n  lsolve: lsolveDocs,\n  lsolveAll: lsolveAllDocs,\n  lup: lupDocs,\n  lusolve: lusolveDocs,\n  leafCount: leafCountDocs,\n  polynomialRoot: polynomialRootDocs,\n  resolve: resolveDocs,\n  simplify: simplifyDocs,\n  simplifyConstant: simplifyConstantDocs,\n  simplifyCore: simplifyCoreDocs,\n  symbolicEqual: symbolicEqualDocs,\n  rationalize: rationalizeDocs,\n  slu: sluDocs,\n  usolve: usolveDocs,\n  usolveAll: usolveAllDocs,\n  qr: qrDocs,\n\n  // functions - arithmetic\n  abs: absDocs,\n  add: addDocs,\n  cbrt: cbrtDocs,\n  ceil: ceilDocs,\n  cube: cubeDocs,\n  divide: divideDocs,\n  dotDivide: dotDivideDocs,\n  dotMultiply: dotMultiplyDocs,\n  dotPow: dotPowDocs,\n  exp: expDocs,\n  expm: expmDocs,\n  expm1: expm1Docs,\n  fix: fixDocs,\n  floor: floorDocs,\n  gcd: gcdDocs,\n  hypot: hypotDocs,\n  lcm: lcmDocs,\n  log: logDocs,\n  log2: log2Docs,\n  log1p: log1pDocs,\n  log10: log10Docs,\n  mod: modDocs,\n  multiply: multiplyDocs,\n  norm: normDocs,\n  nthRoot: nthRootDocs,\n  nthRoots: nthRootsDocs,\n  pow: powDocs,\n  round: roundDocs,\n  sign: signDocs,\n  sqrt: sqrtDocs,\n  sqrtm: sqrtmDocs,\n  square: squareDocs,\n  subtract: subtractDocs,\n  unaryMinus: unaryMinusDocs,\n  unaryPlus: unaryPlusDocs,\n  xgcd: xgcdDocs,\n  invmod: invmodDocs,\n\n  // functions - bitwise\n  bitAnd: bitAndDocs,\n  bitNot: bitNotDocs,\n  bitOr: bitOrDocs,\n  bitXor: bitXorDocs,\n  leftShift: leftShiftDocs,\n  rightArithShift: rightArithShiftDocs,\n  rightLogShift: rightLogShiftDocs,\n\n  // functions - combinatorics\n  bellNumbers: bellNumbersDocs,\n  catalan: catalanDocs,\n  composition: compositionDocs,\n  stirlingS2: stirlingS2Docs,\n\n  // functions - core\n  config: configDocs,\n  import: importDocs,\n  typed: typedDocs,\n\n  // functions - complex\n  arg: argDocs,\n  conj: conjDocs,\n  re: reDocs,\n  im: imDocs,\n\n  // functions - expression\n  evaluate: evaluateDocs,\n  help: helpDocs,\n  parse: parseDocs,\n  parser: parserDocs,\n  compile: compileDocs,\n\n  // functions - geometry\n  distance: distanceDocs,\n  intersect: intersectDocs,\n\n  // functions - logical\n  and: andDocs,\n  not: notDocs,\n  nullish: nullishDocs,\n  or: orDocs,\n  xor: xorDocs,\n\n  // functions - matrix\n  mapSlices: mapSlicesDocs,\n  concat: concatDocs,\n  count: countDocs,\n  cross: crossDocs,\n  column: columnDocs,\n  ctranspose: ctransposeDocs,\n  det: detDocs,\n  diag: diagDocs,\n  diff: diffDocs,\n  dot: dotDocs,\n  getMatrixDataType: getMatrixDataTypeDocs,\n  identity: identityDocs,\n  filter: filterDocs,\n  flatten: flattenDocs,\n  forEach: forEachDocs,\n  inv: invDocs,\n  pinv: pinvDocs,\n  eigs: eigsDocs,\n  kron: kronDocs,\n  matrixFromFunction: matrixFromFunctionDocs,\n  matrixFromRows: matrixFromRowsDocs,\n  matrixFromColumns: matrixFromColumnsDocs,\n  map: mapDocs,\n  ones: onesDocs,\n  partitionSelect: partitionSelectDocs,\n  range: rangeDocs,\n  resize: resizeDocs,\n  reshape: reshapeDocs,\n  rotate: rotateDocs,\n  rotationMatrix: rotationMatrixDocs,\n  row: rowDocs,\n  size: sizeDocs,\n  sort: sortDocs,\n  squeeze: squeezeDocs,\n  subset: subsetDocs,\n  trace: traceDocs,\n  transpose: transposeDocs,\n  zeros: zerosDocs,\n  fft: fftDocs,\n  ifft: ifftDocs,\n  sylvester: sylvesterDocs,\n  schur: schurDocs,\n  lyap: lyapDocs,\n\n  // functions - numeric\n  solveODE: solveODEDocs,\n\n  // functions - probability\n  combinations: combinationsDocs,\n  combinationsWithRep: combinationsWithRepDocs,\n  // distribution: distributionDocs,\n  factorial: factorialDocs,\n  gamma: gammaDocs,\n  kldivergence: kldivergenceDocs,\n  lgamma: lgammaDocs,\n  multinomial: multinomialDocs,\n  permutations: permutationsDocs,\n  pickRandom: pickRandomDocs,\n  random: randomDocs,\n  randomInt: randomIntDocs,\n\n  // functions - relational\n  compare: compareDocs,\n  compareNatural: compareNaturalDocs,\n  compareText: compareTextDocs,\n  deepEqual: deepEqualDocs,\n  equal: equalDocs,\n  equalText: equalTextDocs,\n  larger: largerDocs,\n  largerEq: largerEqDocs,\n  smaller: smallerDocs,\n  smallerEq: smallerEqDocs,\n  unequal: unequalDocs,\n\n  // functions - set\n  setCartesian: setCartesianDocs,\n  setDifference: setDifferenceDocs,\n  setDistinct: setDistinctDocs,\n  setIntersect: setIntersectDocs,\n  setIsSubset: setIsSubsetDocs,\n  setMultiplicity: setMultiplicityDocs,\n  setPowerset: setPowersetDocs,\n  setSize: setSizeDocs,\n  setSymDifference: setSymDifferenceDocs,\n  setUnion: setUnionDocs,\n\n  // functions - signal\n  zpk2tf: zpk2tfDocs,\n  freqz: freqzDocs,\n\n  // functions - special\n  erf: erfDocs,\n  zeta: zetaDocs,\n\n  // functions - statistics\n  cumsum: cumSumDocs,\n  mad: madDocs,\n  max: maxDocs,\n  mean: meanDocs,\n  median: medianDocs,\n  min: minDocs,\n  mode: modeDocs,\n  prod: prodDocs,\n  quantileSeq: quantileSeqDocs,\n  std: stdDocs,\n  sum: sumDocs,\n  variance: varianceDocs,\n  corr: corrDocs,\n\n  // functions - trigonometry\n  acos: acosDocs,\n  acosh: acoshDocs,\n  acot: acotDocs,\n  acoth: acothDocs,\n  acsc: acscDocs,\n  acsch: acschDocs,\n  asec: asecDocs,\n  asech: asechDocs,\n  asin: asinDocs,\n  asinh: asinhDocs,\n  atan: atanDocs,\n  atanh: atanhDocs,\n  atan2: atan2Docs,\n  cos: cosDocs,\n  cosh: coshDocs,\n  cot: cotDocs,\n  coth: cothDocs,\n  csc: cscDocs,\n  csch: cschDocs,\n  sec: secDocs,\n  sech: sechDocs,\n  sin: sinDocs,\n  sinh: sinhDocs,\n  tan: tanDocs,\n  tanh: tanhDocs,\n\n  // functions - units\n  to: toDocs,\n  toBest: toBestDocs,\n\n  // functions - utils\n  clone: cloneDocs,\n  format: formatDocs,\n  bin: binDocs,\n  oct: octDocs,\n  hex: hexDocs,\n  isNaN: isNaNDocs,\n  isInteger: isIntegerDocs,\n  isNegative: isNegativeDocs,\n  isNumeric: isNumericDocs,\n  hasNumericValue: hasNumericValueDocs,\n  isPositive: isPositiveDocs,\n  isPrime: isPrimeDocs,\n  isZero: isZeroDocs,\n  print: printDocs,\n  typeOf: typeOfDocs,\n  numeric: numericDocs\n}\n","export const bignumberDocs = {\n  name: 'bignumber',\n  category: 'Construction',\n  syntax: [\n    'bignumber(x)'\n  ],\n  description:\n      'Create a big number from a number or string.',\n  examples: [\n    '0.1 + 0.2',\n    'bignumber(0.1) + bignumber(0.2)',\n    'bignumber(\"7.2\")',\n    'bignumber(\"7.2e500\")',\n    'bignumber([0.1, 0.2, 0.3])'\n  ],\n  seealso: [\n    'boolean', 'bigint', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const bigintDocs = {\n  name: 'bigint',\n  category: 'Construction',\n  syntax: [\n    'bigint(x)'\n  ],\n  description:\n      'Create a bigint, an integer with an arbitrary number of digits, from a number or string.',\n  examples: [\n    '123123123123123123 # a large number will lose digits',\n    'bigint(\"123123123123123123\")',\n    'bignumber([\"1\", \"3\", \"5\"])'\n  ],\n  seealso: [\n    'boolean', 'bignumber', 'number', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const booleanDocs = {\n  name: 'boolean',\n  category: 'Construction',\n  syntax: [\n    'x',\n    'boolean(x)'\n  ],\n  description:\n      'Convert a string or number into a boolean.',\n  examples: [\n    'boolean(0)',\n    'boolean(1)',\n    'boolean(3)',\n    'boolean(\"true\")',\n    'boolean(\"false\")',\n    'boolean([1, 0, 1, 1])'\n  ],\n  seealso: [\n    'bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit'\n  ]\n}\n","export const complexDocs = {\n  name: 'complex',\n  category: 'Construction',\n  syntax: [\n    'complex()',\n    'complex(re, im)',\n    'complex(string)'\n  ],\n  description:\n      'Create a complex number.',\n  examples: [\n    'complex()',\n    'complex(2, 3)',\n    'complex(\"7 - 2i\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit'\n  ]\n}\n","export const createUnitDocs = {\n  name: 'createUnit',\n  category: 'Construction',\n  syntax: [\n    'createUnit(definitions)',\n    'createUnit(name, definition)'\n  ],\n  description:\n      'Create a user-defined unit and register it with the Unit type.',\n  examples: [\n    'createUnit(\"foo\")',\n    'createUnit(\"knot\", {definition: \"0.514444444 m/s\", aliases: [\"knots\", \"kt\", \"kts\"]})',\n    'createUnit(\"mph\", \"1 mile/hour\")'\n  ],\n  seealso: [\n    'unit', 'splitUnit'\n  ]\n}\n","export const fractionDocs = {\n  name: 'fraction',\n  category: 'Construction',\n  syntax: [\n    'fraction(num)',\n    'fraction(matrix)',\n    'fraction(num,den)',\n    'fraction({n: num, d: den})'\n  ],\n  description:\n    'Create a fraction from a number or from integer numerator and denominator.',\n  examples: [\n    'fraction(0.125)',\n    'fraction(1, 3) + fraction(2, 5)',\n    'fraction({n: 333, d: 53})',\n    'fraction([sqrt(9), sqrt(10), sqrt(11)])'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const indexDocs = {\n  name: 'index',\n  category: 'Construction',\n  syntax: [\n    '[start]',\n    '[start:end]',\n    '[start:step:end]',\n    '[start1, start 2, ...]',\n    '[start1:end1, start2:end2, ...]',\n    '[start1:step1:end1, start2:step2:end2, ...]'\n  ],\n  description:\n      'Create an index to get or replace a subset of a matrix',\n  examples: [\n    'A = [1, 2, 3; 4, 5, 6]',\n    'A[1, :]',\n    'A[1, 2] = 50',\n    'A[1:2, 1:2] = 1',\n    'B = [1, 2, 3]',\n    'B[B>1 and B<3]'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'matrix', 'number', 'range', 'string', 'unit'\n  ]\n}\n","export const matrixDocs = {\n  name: 'matrix',\n  category: 'Construction',\n  syntax: [\n    '[]',\n    '[a1, b1, ...; a2, b2, ...]',\n    'matrix()',\n    'matrix(\"dense\")',\n    'matrix([...])'\n  ],\n  description:\n      'Create a matrix.',\n  examples: [\n    '[]',\n    '[1, 2, 3]',\n    '[1, 2, 3; 4, 5, 6]',\n    'matrix()',\n    'matrix([3, 4])',\n    'matrix([3, 4; 5, 6], \"sparse\")',\n    'matrix([3, 4; 5, 6], \"sparse\", \"number\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse'\n  ]\n}\n","export const numberDocs = {\n  name: 'number',\n  category: 'Construction',\n  syntax: [\n    'x',\n    'number(x)',\n    'number(unit, valuelessUnit)'\n  ],\n  description:\n      'Create a number or convert a string or boolean into a number.',\n  examples: [\n    '2',\n    '2e3',\n    '4.05',\n    'number(2)',\n    'number(\"7.2\")',\n    'number(true)',\n    'number([true, false, true, true])',\n    'number(unit(\"52cm\"), \"m\")'\n  ],\n  seealso: [\n    'bignumber', 'bigint', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit'\n  ]\n}\n","export const sparseDocs = {\n  name: 'sparse',\n  category: 'Construction',\n  syntax: [\n    'sparse()',\n    'sparse([a1, b1, ...; a1, b2, ...])',\n    'sparse([a1, b1, ...; a1, b2, ...], \"number\")'\n  ],\n  description:\n  'Create a sparse matrix.',\n  examples: [\n    'sparse()',\n    'sparse([3, 4; 5, 6])',\n    'sparse([3, 0; 5, 0], \"number\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix'\n  ]\n}\n","export const splitUnitDocs = {\n  name: 'splitUnit',\n  category: 'Construction',\n  syntax: [\n    'splitUnit(unit: Unit, parts: Unit[])'\n  ],\n  description:\n      'Split a unit in an array of units whose sum is equal to the original unit.',\n  examples: [\n    'splitUnit(1 m, [\"feet\", \"inch\"])'\n  ],\n  seealso: [\n    'unit', 'createUnit'\n  ]\n}\n","export const stringDocs = {\n  name: 'string',\n  category: 'Construction',\n  syntax: [\n    '\"text\"',\n    'string(x)'\n  ],\n  description:\n      'Create a string or convert a value to a string',\n  examples: [\n    '\"Hello World!\"',\n    'string(4.2)',\n    'string(3 + 2i)'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit'\n  ]\n}\n","export const unitDocs = {\n  name: 'unit',\n  category: 'Construction',\n  syntax: [\n    'value unit',\n    'unit(value, unit)',\n    'unit(string)'\n  ],\n  description:\n      'Create a unit.',\n  examples: [\n    '5.5 mm',\n    '3 inch',\n    'unit(7.1, \"kilogram\")',\n    'unit(\"23 deg\")'\n  ],\n  seealso: [\n    'bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string'\n  ]\n}\n","export const falseDocs = {\n  name: 'false',\n  category: 'Constants',\n  syntax: [\n    'false'\n  ],\n  description: 'Boolean value false',\n  examples: [\n    'false'\n  ],\n  seealso: ['true']\n}\n","export const iDocs = {\n  name: 'i',\n  category: 'Constants',\n  syntax: [\n    'i'\n  ],\n  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',\n  examples: [\n    'i',\n    'i * i',\n    'sqrt(-1)'\n  ],\n  seealso: []\n}\n","export const InfinityDocs = {\n  name: 'Infinity',\n  category: 'Constants',\n  syntax: [\n    'Infinity'\n  ],\n  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',\n  examples: [\n    'Infinity',\n    '1 / 0'\n  ],\n  seealso: []\n}\n","export const LN2Docs = {\n  name: 'LN2',\n  category: 'Constants',\n  syntax: [\n    'LN2'\n  ],\n  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',\n  examples: [\n    'LN2',\n    'log(2)'\n  ],\n  seealso: []\n}\n","export const LN10Docs = {\n  name: 'LN10',\n  category: 'Constants',\n  syntax: [\n    'LN10'\n  ],\n  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',\n  examples: [\n    'LN10',\n    'log(10)'\n  ],\n  seealso: []\n}\n","export const LOG2EDocs = {\n  name: 'LOG2E',\n  category: 'Constants',\n  syntax: [\n    'LOG2E'\n  ],\n  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',\n  examples: [\n    'LOG2E',\n    'log(e, 2)'\n  ],\n  seealso: []\n}\n","export const LOG10EDocs = {\n  name: 'LOG10E',\n  category: 'Constants',\n  syntax: [\n    'LOG10E'\n  ],\n  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',\n  examples: [\n    'LOG10E',\n    'log(e, 10)'\n  ],\n  seealso: []\n}\n","export const NaNDocs = {\n  name: 'NaN',\n  category: 'Constants',\n  syntax: [\n    'NaN'\n  ],\n  description: 'Not a number',\n  examples: [\n    'NaN',\n    '0 / 0'\n  ],\n  seealso: []\n}\n","export const nullDocs = {\n  name: 'null',\n  category: 'Constants',\n  syntax: [\n    'null'\n  ],\n  description: 'Value null',\n  examples: [\n    'null'\n  ],\n  seealso: ['true', 'false']\n}\n","export const phiDocs = {\n  name: 'phi',\n  category: 'Constants',\n  syntax: [\n    'phi'\n  ],\n  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',\n  examples: [\n    'phi'\n  ],\n  seealso: []\n}\n","export const SQRT12Docs = {\n  name: 'SQRT1_2',\n  category: 'Constants',\n  syntax: [\n    'SQRT1_2'\n  ],\n  description: 'Returns the square root of 1/2, approximately equal to 0.707',\n  examples: [\n    'SQRT1_2',\n    'sqrt(1/2)'\n  ],\n  seealso: []\n}\n","export const SQRT2Docs = {\n  name: 'SQRT2',\n  category: 'Constants',\n  syntax: [\n    'SQRT2'\n  ],\n  description: 'Returns the square root of 2, approximately equal to 1.414',\n  examples: [\n    'SQRT2',\n    'sqrt(2)'\n  ],\n  seealso: []\n}\n","export const tauDocs = {\n  name: 'tau',\n  category: 'Constants',\n  syntax: [\n    'tau'\n  ],\n  description: 'Tau is the ratio constant of a circle\\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',\n  examples: [\n    'tau',\n    '2 * pi'\n  ],\n  seealso: ['pi']\n}\n","export const trueDocs = {\n  name: 'true',\n  category: 'Constants',\n  syntax: [\n    'true'\n  ],\n  description: 'Boolean value true',\n  examples: [\n    'true'\n  ],\n  seealso: ['false']\n}\n","export const versionDocs = {\n  name: 'version',\n  category: 'Constants',\n  syntax: [\n    'version'\n  ],\n  description: 'A string with the version number of math.js',\n  examples: [\n    'version'\n  ],\n  seealso: []\n}\n","export const derivativeDocs = {\n  name: 'derivative',\n  category: 'Algebra',\n  syntax: [\n    'derivative(expr, variable)',\n    'derivative(expr, variable, {simplify: boolean})'\n  ],\n  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',\n  examples: [\n    'derivative(\"2x^3\", \"x\")',\n    'derivative(\"2x^3\", \"x\", {simplify: false})',\n    'derivative(\"2x^2 + 3x + 4\", \"x\")',\n    'derivative(\"sin(2x)\", \"x\")',\n    'f = parse(\"x^2 + x\")',\n    'x = parse(\"x\")',\n    'df = derivative(f, x)',\n    'df.evaluate({x: 3})'\n  ],\n  seealso: [\n    'simplify', 'parse', 'evaluate'\n  ]\n}\n","export const lsolveDocs = {\n  name: 'lsolve',\n  category: 'Algebra',\n  syntax: [\n    'x=lsolve(L, b)'\n  ],\n  description:\n  'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lsolve(a, b)'\n  ],\n  seealso: [\n    'lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const lsolveAllDocs = {\n  name: 'lsolveAll',\n  category: 'Algebra',\n  syntax: [\n    'x=lsolveAll(L, b)'\n  ],\n  description:\n  'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lsolve(a, b)'\n  ],\n  seealso: [\n    'lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const lupDocs = {\n  name: 'lup',\n  category: 'Algebra',\n  syntax: [\n    'lup(m)'\n  ],\n  description:\n  'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',\n  examples: [\n    'lup([[2, 1], [1, 4]])',\n    'lup(matrix([[2, 1], [1, 4]]))',\n    'lup(sparse([[2, 1], [1, 4]]))'\n  ],\n  seealso: [\n    'lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr'\n  ]\n}\n","export const lusolveDocs = {\n  name: 'lusolve',\n  category: 'Algebra',\n  syntax: [\n    'x=lusolve(A, b)',\n    'x=lusolve(lu, b)'\n  ],\n  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',\n  examples: [\n    'a = [-2, 3; 2, 1]',\n    'b = [11, 9]',\n    'x = lusolve(a, b)'\n  ],\n  seealso: [\n    'lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse'\n  ]\n}\n","export const leafCountDocs = {\n  name: 'leafCount',\n  category: 'Algebra',\n  syntax: ['leafCount(expr)'],\n  description: 'Computes the number of leaves in the parse tree of the given expression',\n  examples: [\n    'leafCount(\"e^(i*pi)-1\")',\n    'leafCount(parse(\"{a: 22/7, b: 10^(1/2)}\"))'\n  ],\n  seealso: ['simplify']\n}\n","export const polynomialRootDocs = {\n  name: 'polynomialRoot',\n  category: 'Algebra',\n  syntax: [\n    'x=polynomialRoot(-6, 3)',\n    'x=polynomialRoot(4, -4, 1)',\n    'x=polynomialRoot(-8, 12, -6, 1)'\n  ],\n  description: 'Finds the roots of a univariate polynomial given by its coefficients starting from constant, linear, and so on, increasing in degree.',\n  examples: [\n    'a = polynomialRoot(-6, 11, -6, 1)'\n  ],\n  seealso: [\n    'cbrt', 'sqrt'\n  ]\n}\n","export const resolveDocs = {\n  name: 'resolve',\n  category: 'Algebra',\n  syntax: [\n    'resolve(node, scope)'\n  ],\n  description: 'Recursively substitute variables in an expression tree.',\n  examples: [\n    'resolve(parse(\"1 + x\"), { x: 7 })',\n    'resolve(parse(\"size(text)\"), { text: \"Hello World\" })',\n    'resolve(parse(\"x + y\"), { x: parse(\"3z\") })',\n    'resolve(parse(\"3x\"), { x: parse(\"y+z\"), z: parse(\"w^y\") })'\n  ],\n  seealso: [\n    'simplify', 'evaluate'\n  ],\n  mayThrow: [\n    'ReferenceError'\n  ]\n}\n","export const simplifyDocs = {\n  name: 'simplify',\n  category: 'Algebra',\n  syntax: [\n    'simplify(expr)',\n    'simplify(expr, rules)'\n  ],\n  description: 'Simplify an expression tree.',\n  examples: [\n    'simplify(\"3 + 2 / 4\")',\n    'simplify(\"2x + x\")',\n    'f = parse(\"x * (x + 2 + x)\")',\n    'simplified = simplify(f)',\n    'simplified.evaluate({x: 2})'\n  ],\n  seealso: [\n    'simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve'\n  ]\n}\n","export const simplifyConstantDocs = {\n  name: 'simplifyConstant',\n  category: 'Algebra',\n  syntax: [\n    'simplifyConstant(expr)',\n    'simplifyConstant(expr, options)'\n  ],\n  description: 'Replace constant subexpressions of node with their values.',\n  examples: [\n    'simplifyConstant(\"(3-3)*x\")',\n    'simplifyConstant(parse(\"z-cos(tau/8)\"))'\n  ],\n  seealso: [\n    'simplify', 'simplifyCore', 'evaluate'\n  ]\n}\n","export const simplifyCoreDocs = {\n  name: 'simplifyCore',\n  category: 'Algebra',\n  syntax: [\n    'simplifyCore(node)'\n  ],\n  description: 'Perform simple one-pass simplifications on an expression tree.',\n  examples: [\n    'simplifyCore(parse(\"0*x\"))',\n    'simplifyCore(parse(\"(x+0)*2\"))'\n  ],\n  seealso: [\n    'simplify', 'simplifyConstant', 'evaluate'\n  ]\n}\n","export const symbolicEqualDocs = {\n  name: 'symbolicEqual',\n  category: 'Algebra',\n  syntax: [\n    'symbolicEqual(expr1, expr2)',\n    'symbolicEqual(expr1, expr2, options)'\n  ],\n  description: 'Returns true if the difference of the expressions simplifies to 0',\n  examples: [\n    'symbolicEqual(\"x*y\",\"y*x\")',\n    'symbolicEqual(\"abs(x^2)\", \"x^2\")',\n    'symbolicEqual(\"abs(x)\", \"x\", {context: {abs: {trivial: true}}})'\n  ],\n  seealso: ['simplify', 'evaluate']\n}\n","export const rationalizeDocs = {\n  name: 'rationalize',\n  category: 'Algebra',\n  syntax: [\n    'rationalize(expr)',\n    'rationalize(expr, scope)',\n    'rationalize(expr, scope, detailed)'\n  ],\n  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',\n  examples: [\n    'rationalize(\"2x/y - y/(x+1)\")',\n    'rationalize(\"2x/y - y/(x+1)\", true)'\n  ],\n  seealso: [\n    'simplify'\n  ]\n}\n","export const sluDocs = {\n  name: 'slu',\n  category: 'Algebra',\n  syntax: [\n    'slu(A, order, threshold)'\n  ],\n  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',\n  examples: [\n    'slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'\n  ],\n  seealso: [\n    'lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr'\n  ]\n}\n","export const usolveDocs = {\n  name: 'usolve',\n  category: 'Algebra',\n  syntax: [\n    'x=usolve(U, b)'\n  ],\n  description:\n  'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',\n  examples: [\n    'x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'\n  ],\n  seealso: [\n    'usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse'\n  ]\n}\n","export const usolveAllDocs = {\n  name: 'usolveAll',\n  category: 'Algebra',\n  syntax: [\n    'x=usolve(U, b)'\n  ],\n  description:\n  'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',\n  examples: [\n    'x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'\n  ],\n  seealso: [\n    'usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse'\n  ]\n}\n","export const qrDocs = {\n  name: 'qr',\n  category: 'Algebra',\n  syntax: [\n    'qr(A)'\n  ],\n  description:\n  'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',\n  examples: [\n    'qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'\n  ],\n  seealso: [\n    'lup', 'slu', 'matrix'\n  ]\n}\n","export const absDocs = {\n  name: 'abs',\n  category: 'Arithmetic',\n  syntax: [\n    'abs(x)'\n  ],\n  description: 'Compute the absolute value.',\n  examples: [\n    'abs(3.5)',\n    'abs(-4.2)'\n  ],\n  seealso: ['sign']\n}\n","export const addDocs = {\n  name: 'add',\n  category: 'Operators',\n  syntax: [\n    'x + y',\n    'add(x, y)'\n  ],\n  description: 'Add two values.',\n  examples: [\n    'a = 2.1 + 3.6',\n    'a - 3.6',\n    '3 + 2i',\n    '3 cm + 2 inch',\n    '\"2.3\" + \"4\"'\n  ],\n  seealso: [\n    'subtract'\n  ]\n}\n","export const cbrtDocs = {\n  name: 'cbrt',\n  category: 'Arithmetic',\n  syntax: [\n    'cbrt(x)',\n    'cbrt(x, allRoots)'\n  ],\n  description:\n      'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',\n  examples: [\n    'cbrt(64)',\n    'cube(4)',\n    'cbrt(-8)',\n    'cbrt(2 + 3i)',\n    'cbrt(8i)',\n    'cbrt(8i, true)',\n    'cbrt(27 m^3)'\n  ],\n  seealso: [\n    'square',\n    'sqrt',\n    'cube',\n    'multiply'\n  ]\n}\n","export const ceilDocs = {\n  name: 'ceil',\n  category: 'Arithmetic',\n  syntax: [\n    'ceil(x)',\n    'ceil(x, n)',\n    'ceil(unit, valuelessUnit)',\n    'ceil(unit, n, valuelessUnit)'\n  ],\n  description:\n      'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',\n  examples: [\n    'ceil(3.2)',\n    'ceil(3.8)',\n    'ceil(-4.2)',\n    'ceil(3.241cm, cm)',\n    'ceil(3.241cm, 2, cm)'\n  ],\n  seealso: ['floor', 'fix', 'round']\n}\n","export const cubeDocs = {\n  name: 'cube',\n  category: 'Arithmetic',\n  syntax: [\n    'cube(x)'\n  ],\n  description: 'Compute the cube of a value. The cube of x is x * x * x.',\n  examples: [\n    'cube(2)',\n    '2^3',\n    '2 * 2 * 2'\n  ],\n  seealso: [\n    'multiply',\n    'square',\n    'pow'\n  ]\n}\n","export const divideDocs = {\n  name: 'divide',\n  category: 'Operators',\n  syntax: [\n    'x / y',\n    'divide(x, y)'\n  ],\n  description: 'Divide two values.',\n  examples: [\n    'a = 2 / 3',\n    'a * 3',\n    '4.5 / 2',\n    '3 + 4 / 2',\n    '(3 + 4) / 2',\n    '18 km / 4.5'\n  ],\n  seealso: [\n    'multiply'\n  ]\n}\n","export const dotDivideDocs = {\n  name: 'dotDivide',\n  category: 'Operators',\n  syntax: [\n    'x ./ y',\n    'dotDivide(x, y)'\n  ],\n  description: 'Divide two values element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'b = [2, 1, 1; 3, 2, 5]',\n    'a ./ b'\n  ],\n  seealso: [\n    'multiply',\n    'dotMultiply',\n    'divide'\n  ]\n}\n","export const dotMultiplyDocs = {\n  name: 'dotMultiply',\n  category: 'Operators',\n  syntax: [\n    'x .* y',\n    'dotMultiply(x, y)'\n  ],\n  description: 'Multiply two values element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'b = [2, 1, 1; 3, 2, 5]',\n    'a .* b'\n  ],\n  seealso: [\n    'multiply',\n    'divide',\n    'dotDivide'\n  ]\n}\n","export const dotPowDocs = {\n  name: 'dotPow',\n  category: 'Operators',\n  syntax: [\n    'x .^ y',\n    'dotPow(x, y)'\n  ],\n  description:\n      'Calculates the power of x to y element wise.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a .^ 2'\n  ],\n  seealso: [\n    'pow'\n  ]\n}\n","export const expDocs = {\n  name: 'exp',\n  category: 'Arithmetic',\n  syntax: [\n    'exp(x)'\n  ],\n  description: 'Calculate the exponent of a value.',\n  examples: [\n    'exp(1.3)',\n    'e ^ 1.3',\n    'log(exp(1.3))',\n    'x = 2.4',\n    '(exp(i*x) == cos(x) + i*sin(x))   # Euler\\'s formula'\n  ],\n  seealso: [\n    'expm',\n    'expm1',\n    'pow',\n    'log'\n  ]\n}\n","export const expmDocs = {\n  name: 'expm',\n  category: 'Arithmetic',\n  syntax: [\n    'exp(x)'\n  ],\n  description: 'Compute the matrix exponential, expm(A) = e^A. ' +\n    'The matrix must be square. ' +\n    'Not to be confused with exp(a), which performs element-wise exponentiation.',\n  examples: [\n    'expm([[0,2],[0,0]])'\n  ],\n  seealso: [\n    'exp'\n  ]\n}\n","export const expm1Docs = {\n  name: 'expm1',\n  category: 'Arithmetic',\n  syntax: [\n    'expm1(x)'\n  ],\n  description: 'Calculate the value of subtracting 1 from the exponential value.',\n  examples: [\n    'expm1(2)',\n    'pow(e, 2) - 1',\n    'log(expm1(2) + 1)'\n  ],\n  seealso: [\n    'exp',\n    'pow',\n    'log'\n  ]\n}\n","export const fixDocs = {\n  name: 'fix',\n  category: 'Arithmetic',\n  syntax: [\n    'fix(x)',\n    'fix(x, n)',\n    'fix(unit, valuelessUnit)',\n    'fix(unit, n, valuelessUnit)'\n  ],\n  description:\n      'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',\n  examples: [\n    'fix(3.2)',\n    'fix(3.8)',\n    'fix(-4.2)',\n    'fix(-4.8)',\n    'fix(3.241cm, cm)',\n    'fix(3.241cm, 2, cm)'\n  ],\n  seealso: ['ceil', 'floor', 'round']\n}\n","export const floorDocs = {\n  name: 'floor',\n  category: 'Arithmetic',\n  syntax: [\n    'floor(x)',\n    'floor(x, n)',\n    'floor(unit, valuelessUnit)',\n    'floor(unit, n, valuelessUnit)'\n  ],\n  description:\n      'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',\n  examples: [\n    'floor(3.2)',\n    'floor(3.8)',\n    'floor(-4.2)',\n    'floor(3.241cm, cm)',\n    'floor(3.241cm, 2, cm)'\n  ],\n  seealso: ['ceil', 'fix', 'round']\n}\n","export const gcdDocs = {\n  name: 'gcd',\n  category: 'Arithmetic',\n  syntax: [\n    'gcd(a, b)',\n    'gcd(a, b, c, ...)'\n  ],\n  description: 'Compute the greatest common divisor.',\n  examples: [\n    'gcd(8, 12)',\n    'gcd(-4, 6)',\n    'gcd(25, 15, -10)'\n  ],\n  seealso: ['lcm', 'xgcd']\n}\n","export const hypotDocs = {\n  name: 'hypot',\n  category: 'Arithmetic',\n  syntax: [\n    'hypot(a, b, c, ...)',\n    'hypot([a, b, c, ...])'\n  ],\n  description: 'Calculate the hypotenuse of a list with values.',\n  examples: [\n    'hypot(3, 4)',\n    'sqrt(3^2 + 4^2)',\n    'hypot(-2)',\n    'hypot([3, 4, 5])'\n  ],\n  seealso: ['abs', 'norm']\n}\n","export const lcmDocs = {\n  name: 'lcm',\n  category: 'Arithmetic',\n  syntax: [\n    'lcm(x, y)'\n  ],\n  description: 'Compute the least common multiple.',\n  examples: [\n    'lcm(4, 6)',\n    'lcm(6, 21)',\n    'lcm(6, 21, 5)'\n  ],\n  seealso: ['gcd']\n}\n","export const logDocs = {\n  name: 'log',\n  category: 'Arithmetic',\n  syntax: [\n    'log(x)',\n    'log(x, base)'\n  ],\n  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',\n  examples: [\n    'log(3.5)',\n    'a = log(2.4)',\n    'exp(a)',\n    '10 ^ 4',\n    'log(10000, 10)',\n    'log(10000) / log(10)',\n    'b = log(1024, 2)',\n    '2 ^ b'\n  ],\n  seealso: [\n    'exp',\n    'log1p',\n    'log2',\n    'log10'\n  ]\n}\n","export const log2Docs = {\n  name: 'log2',\n  category: 'Arithmetic',\n  syntax: [\n    'log2(x)'\n  ],\n  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',\n  examples: [\n    'log2(0.03125)',\n    'log2(16)',\n    'log2(16) / log2(2)',\n    'pow(2, 4)'\n  ],\n  seealso: [\n    'exp',\n    'log1p',\n    'log',\n    'log10'\n  ]\n}\n","export const log1pDocs = {\n  name: 'log1p',\n  category: 'Arithmetic',\n  syntax: [\n    'log1p(x)',\n    'log1p(x, base)'\n  ],\n  description: 'Calculate the logarithm of a `value+1`',\n  examples: [\n    'log1p(2.5)',\n    'exp(log1p(1.4))',\n    'pow(10, 4)',\n    'log1p(9999, 10)',\n    'log1p(9999) / log(10)'\n  ],\n  seealso: [\n    'exp',\n    'log',\n    'log2',\n    'log10'\n  ]\n}\n","export const log10Docs = {\n  name: 'log10',\n  category: 'Arithmetic',\n  syntax: [\n    'log10(x)'\n  ],\n  description: 'Compute the 10-base logarithm of a value.',\n  examples: [\n    'log10(0.00001)',\n    'log10(10000)',\n    '10 ^ 4',\n    'log(10000) / log(10)',\n    'log(10000, 10)'\n  ],\n  seealso: [\n    'exp',\n    'log'\n  ]\n}\n","export const modDocs = {\n  name: 'mod',\n  category: 'Operators',\n  syntax: [\n    'x % y',\n    'x mod y',\n    'mod(x, y)'\n  ],\n  description:\n      'Calculates the modulus, the remainder of an integer division.',\n  examples: [\n    '7 % 3',\n    '11 % 2',\n    '10 mod 4',\n    'isOdd(x) = x % 2',\n    'isOdd(2)',\n    'isOdd(3)'\n  ],\n  seealso: ['divide']\n}\n","export const multiplyDocs = {\n  name: 'multiply',\n  category: 'Operators',\n  syntax: [\n    'x * y',\n    'multiply(x, y)'\n  ],\n  description: 'multiply two values.',\n  examples: [\n    'a = 2.1 * 3.4',\n    'a / 3.4',\n    '2 * 3 + 4',\n    '2 * (3 + 4)',\n    '3 * 2.1 km'\n  ],\n  seealso: [\n    'divide'\n  ]\n}\n","export const normDocs = {\n  name: 'norm',\n  category: 'Arithmetic',\n  syntax: [\n    'norm(x)',\n    'norm(x, p)'\n  ],\n  description: 'Calculate the norm of a number, vector or matrix.',\n  examples: [\n    'abs(-3.5)',\n    'norm(-3.5)',\n    'norm(3 - 4i)',\n    'norm([1, 2, -3], Infinity)',\n    'norm([1, 2, -3], -Infinity)',\n    'norm([3, 4], 2)',\n    'norm([[1, 2], [3, 4]], 1)',\n    'norm([[1, 2], [3, 4]], \"inf\")',\n    'norm([[1, 2], [3, 4]], \"fro\")'\n  ]\n}\n","export const nthRootDocs = {\n  name: 'nthRoot',\n  category: 'Arithmetic',\n  syntax: [\n    'nthRoot(a)',\n    'nthRoot(a, root)'\n  ],\n  description: 'Calculate the nth root of a value. ' +\n      'The principal nth root of a positive real number A, ' +\n      'is the positive real solution of the equation \"x^root = A\".',\n  examples: [\n    '4 ^ 3',\n    'nthRoot(64, 3)',\n    'nthRoot(9, 2)',\n    'sqrt(9)'\n  ],\n  seealso: [\n    'nthRoots',\n    'pow',\n    'sqrt'\n  ]\n}\n","export const nthRootsDocs = {\n  name: 'nthRoots',\n  category: 'Arithmetic',\n  syntax: [\n    'nthRoots(A)',\n    'nthRoots(A, root)'\n  ],\n  description: ('' +\n      'Calculate the nth roots of a value. ' +\n      'An nth root of a positive real number A, ' +\n      'is a positive real solution of the equation \"x^root = A\". ' +\n      'This function returns an array of complex values.'\n  ),\n  examples: [\n    'nthRoots(1)',\n    'nthRoots(1, 3)'\n  ],\n  seealso: [\n    'sqrt',\n    'pow',\n    'nthRoot'\n  ]\n}\n","export const powDocs = {\n  name: 'pow',\n  category: 'Operators',\n  syntax: [\n    'x ^ y',\n    'pow(x, y)'\n  ],\n  description:\n      'Calculates the power of x to y, x^y.',\n  examples: [\n    '2^3',\n    '2*2*2',\n    '1 + e ^ (pi * i)',\n    'pow([[1, 2], [4, 3]], 2)',\n    'pow([[1, 2], [4, 3]], -1)'\n  ],\n  seealso: [\n    'multiply',\n    'nthRoot',\n    'nthRoots',\n    'sqrt'\n  ]\n}\n","export const roundDocs = {\n  name: 'round',\n  category: 'Arithmetic',\n  syntax: [\n    'round(x)',\n    'round(x, n)',\n    'round(unit, valuelessUnit)',\n    'round(unit, n, valuelessUnit)'\n  ],\n  description:\n      'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',\n  examples: [\n    'round(3.2)',\n    'round(3.8)',\n    'round(-4.2)',\n    'round(-4.8)',\n    'round(pi, 3)',\n    'round(123.45678, 2)',\n    'round(3.241cm, 2, cm)',\n    'round([3.2, 3.8, -4.7])'\n  ],\n  seealso: ['ceil', 'floor', 'fix']\n}\n","export const signDocs = {\n  name: 'sign',\n  category: 'Arithmetic',\n  syntax: [\n    'sign(x)'\n  ],\n  description:\n      'Compute the sign of a value. The sign of a value x is 1 when x>0, -1 when x<0, and 0 when x=0.',\n  examples: [\n    'sign(3.5)',\n    'sign(-4.2)',\n    'sign(0)'\n  ],\n  seealso: [\n    'abs'\n  ]\n}\n","export const sqrtDocs = {\n  name: 'sqrt',\n  category: 'Arithmetic',\n  syntax: [\n    'sqrt(x)'\n  ],\n  description:\n      'Compute the square root value. If x = y * y, then y is the square root of x.',\n  examples: [\n    'sqrt(25)',\n    '5 * 5',\n    'sqrt(-1)'\n  ],\n  seealso: [\n    'square',\n    'sqrtm',\n    'multiply',\n    'nthRoot',\n    'nthRoots',\n    'pow'\n  ]\n}\n","export const sqrtmDocs = {\n  name: 'sqrtm',\n  category: 'Arithmetic',\n  syntax: [\n    'sqrtm(x)'\n  ],\n  description:\n      'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',\n  examples: [\n    'sqrtm([[33, 24], [48, 57]])'\n  ],\n  seealso: [\n    'sqrt',\n    'abs',\n    'square',\n    'multiply'\n  ]\n}\n","export const squareDocs = {\n  name: 'square',\n  category: 'Arithmetic',\n  syntax: [\n    'square(x)'\n  ],\n  description:\n      'Compute the square of a value. The square of x is x * x.',\n  examples: [\n    'square(3)',\n    'sqrt(9)',\n    '3^2',\n    '3 * 3'\n  ],\n  seealso: [\n    'multiply',\n    'pow',\n    'sqrt',\n    'cube'\n  ]\n}\n","export const subtractDocs = {\n  name: 'subtract',\n  category: 'Operators',\n  syntax: [\n    'x - y',\n    'subtract(x, y)'\n  ],\n  description: 'subtract two values.',\n  examples: [\n    'a = 5.3 - 2',\n    'a + 2',\n    '2/3 - 1/6',\n    '2 * 3 - 3',\n    '2.1 km - 500m'\n  ],\n  seealso: [\n    'add'\n  ]\n}\n","export const unaryMinusDocs = {\n  name: 'unaryMinus',\n  category: 'Operators',\n  syntax: [\n    '-x',\n    'unaryMinus(x)'\n  ],\n  description:\n      'Inverse the sign of a value. Converts booleans and strings to numbers.',\n  examples: [\n    '-4.5',\n    '-(-5.6)',\n    '-\"22\"'\n  ],\n  seealso: [\n    'add', 'subtract', 'unaryPlus'\n  ]\n}\n","export const unaryPlusDocs = {\n  name: 'unaryPlus',\n  category: 'Operators',\n  syntax: [\n    '+x',\n    'unaryPlus(x)'\n  ],\n  description:\n      'Converts booleans and strings to numbers.',\n  examples: [\n    '+true',\n    '+\"2\"'\n  ],\n  seealso: [\n    'add', 'subtract', 'unaryMinus'\n  ]\n}\n","export const xgcdDocs = {\n  name: 'xgcd',\n  category: 'Arithmetic',\n  syntax: [\n    'xgcd(a, b)'\n  ],\n  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',\n  examples: [\n    'xgcd(8, 12)',\n    'gcd(8, 12)',\n    'xgcd(36163, 21199)'\n  ],\n  seealso: ['gcd', 'lcm']\n}\n","export const invmodDocs = {\n  name: 'invmod',\n  category: 'Arithmetic',\n  syntax: [\n    'invmod(a, b)'\n  ],\n  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',\n  examples: [\n    'invmod(8, 12)',\n    'invmod(7, 13)',\n    'invmod(15151, 15122)'\n  ],\n  seealso: ['gcd', 'xgcd']\n}\n","export const bitAndDocs = {\n  name: 'bitAnd',\n  category: 'Bitwise',\n  syntax: [\n    'x & y',\n    'bitAnd(x, y)'\n  ],\n  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',\n  examples: [\n    '5 & 3',\n    'bitAnd(53, 131)',\n    '[1, 12, 31] & 42'\n  ],\n  seealso: [\n    'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitNotDocs = {\n  name: 'bitNot',\n  category: 'Bitwise',\n  syntax: [\n    '~x',\n    'bitNot(x)'\n  ],\n  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',\n  examples: [\n    '~1',\n    '~2',\n    'bitNot([2, -3, 4])'\n  ],\n  seealso: [\n    'bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitOrDocs = {\n  name: 'bitOr',\n  category: 'Bitwise',\n  syntax: [\n    'x | y',\n    'bitOr(x, y)'\n  ],\n  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',\n  examples: [\n    '5 | 3',\n    'bitOr([1, 2, 3], 4)'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const bitXorDocs = {\n  name: 'bitXor',\n  category: 'Bitwise',\n  syntax: [\n    'bitXor(x, y)'\n  ],\n  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',\n  examples: [\n    'bitOr(1, 2)',\n    'bitXor([2, 3, 4], 4)'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const leftShiftDocs = {\n  name: 'leftShift',\n  category: 'Bitwise',\n  syntax: [\n    'x << y',\n    'leftShift(x, y)'\n  ],\n  description: 'Bitwise left logical shift of a value x by y number of bits.',\n  examples: [\n    '4 << 1',\n    '8 >> 1'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift'\n  ]\n}\n","export const rightArithShiftDocs = {\n  name: 'rightArithShift',\n  category: 'Bitwise',\n  syntax: [\n    'x >> y',\n    'rightArithShift(x, y)'\n  ],\n  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',\n  examples: [\n    '8 >> 1',\n    '4 << 1',\n    '-12 >> 2'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift'\n  ]\n}\n","export const rightLogShiftDocs = {\n  name: 'rightLogShift',\n  category: 'Bitwise',\n  syntax: [\n    'x >>> y',\n    'rightLogShift(x, y)'\n  ],\n  description: 'Bitwise right logical shift of a value x by y number of bits.',\n  examples: [\n    '8 >>> 1',\n    '4 << 1',\n    '-12 >>> 2'\n  ],\n  seealso: [\n    'bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift'\n  ]\n}\n","export const bellNumbersDocs = {\n  name: 'bellNumbers',\n  category: 'Combinatorics',\n  syntax: [\n    'bellNumbers(n)'\n  ],\n  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',\n  examples: [\n    'bellNumbers(3)',\n    'bellNumbers(8)'\n  ],\n  seealso: ['stirlingS2']\n}\n","export const catalanDocs = {\n  name: 'catalan',\n  category: 'Combinatorics',\n  syntax: [\n    'catalan(n)'\n  ],\n  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',\n  examples: [\n    'catalan(3)',\n    'catalan(8)'\n  ],\n  seealso: ['bellNumbers']\n}\n","export const compositionDocs = {\n  name: 'composition',\n  category: 'Combinatorics',\n  syntax: [\n    'composition(n, k)'\n  ],\n  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',\n  examples: [\n    'composition(5, 3)'\n  ],\n  seealso: ['combinations']\n}\n","export const stirlingS2Docs = {\n  name: 'stirlingS2',\n  category: 'Combinatorics',\n  syntax: [\n    'stirlingS2(n, k)'\n  ],\n  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',\n  examples: [\n    'stirlingS2(5, 3)'\n  ],\n  seealso: ['bellNumbers']\n}\n","export const configDocs = {\n  name: 'config',\n  category: 'Core',\n  syntax: [\n    'config()',\n    'config(options)'\n  ],\n  description: 'Get configuration or change configuration.',\n  examples: [\n    'config()',\n    '1/3 + 1/4',\n    'config({number: \"Fraction\"})',\n    '1/3 + 1/4'\n  ],\n  seealso: []\n}\n","export const importDocs = {\n  name: 'import',\n  category: 'Core',\n  syntax: [\n    'import(functions)',\n    'import(functions, options)'\n  ],\n  description: 'Import functions or constants from an object.',\n  examples: [\n    'import({myFn: f(x)=x^2, myConstant: 32 })',\n    'myFn(2)',\n    'myConstant'\n  ],\n  seealso: []\n}\n","export const typedDocs = {\n  name: 'typed',\n  category: 'Core',\n  syntax: [\n    'typed(signatures)',\n    'typed(name, signatures)'\n  ],\n  description: 'Create a typed function.',\n  examples: [\n    'double = typed({ \"number\": f(x)=x+x, \"string\": f(x)=concat(x,x) })',\n    'double(2)',\n    'double(\"hello\")'\n  ],\n  seealso: []\n}\n","export const argDocs = {\n  name: 'arg',\n  category: 'Complex',\n  syntax: [\n    'arg(x)'\n  ],\n  description:\n      'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',\n  examples: [\n    'arg(2 + 2i)',\n    'atan2(3, 2)',\n    'arg(2 + 3i)'\n  ],\n  seealso: [\n    're',\n    'im',\n    'conj',\n    'abs'\n  ]\n}\n","export const conjDocs = {\n  name: 'conj',\n  category: 'Complex',\n  syntax: [\n    'conj(x)'\n  ],\n  description:\n      'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',\n  examples: [\n    'conj(2 + 3i)',\n    'conj(2 - 3i)',\n    'conj(-5.2i)'\n  ],\n  seealso: [\n    're',\n    'im',\n    'abs',\n    'arg'\n  ]\n}\n","export const reDocs = {\n  name: 're',\n  category: 'Complex',\n  syntax: [\n    're(x)'\n  ],\n  description: 'Get the real part of a complex number.',\n  examples: [\n    're(2 + 3i)',\n    'im(2 + 3i)',\n    're(-5.2i)',\n    're(2.4)'\n  ],\n  seealso: [\n    'im',\n    'conj',\n    'abs',\n    'arg'\n  ]\n}\n","export const imDocs = {\n  name: 'im',\n  category: 'Complex',\n  syntax: [\n    'im(x)'\n  ],\n  description: 'Get the imaginary part of a complex number.',\n  examples: [\n    'im(2 + 3i)',\n    're(2 + 3i)',\n    'im(-5.2i)',\n    'im(2.4)'\n  ],\n  seealso: [\n    're',\n    'conj',\n    'abs',\n    'arg'\n  ]\n}\n","export const evaluateDocs = {\n  name: 'evaluate',\n  category: 'Expression',\n  syntax: [\n    'evaluate(expression)',\n    'evaluate(expression, scope)',\n    'evaluate([expr1, expr2, expr3, ...])',\n    'evaluate([expr1, expr2, expr3, ...], scope)'\n  ],\n  description: 'Evaluate an expression or an array with expressions.',\n  examples: [\n    'evaluate(\"2 + 3\")',\n    'evaluate(\"sqrt(16)\")',\n    'evaluate(\"2 inch to cm\")',\n    'evaluate(\"sin(x * pi)\", { \"x\": 1/2 })',\n    'evaluate([\"width=2\", \"height=4\",\"width*height\"])'\n  ],\n  seealso: ['parser', 'parse', 'compile']\n}\n","export const helpDocs = {\n  name: 'help',\n  category: 'Expression',\n  syntax: [\n    'help(object)',\n    'help(string)'\n  ],\n  description: 'Display documentation on a function or data type.',\n  examples: [\n    'help(sqrt)',\n    'help(\"complex\")'\n  ],\n  seealso: []\n}\n","export const parseDocs = {\n  name: 'parse',\n  category: 'Expression',\n  syntax: [\n    'parse(expr)',\n    'parse(expr, options)',\n    'parse([expr1, expr2, expr3, ...])',\n    'parse([expr1, expr2, expr3, ...], options)'\n  ],\n  description: 'Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().',\n  examples: [\n    'node1 = parse(\"sqrt(3^2 + 4^2)\")',\n    'node1.evaluate()',\n    'code1 = node1.compile()',\n    'code1.evaluate()',\n    'scope = {a: 3, b: 4}',\n    'node2 = parse(\"a * b\")',\n    'node2.evaluate(scope)',\n    'code2 = node2.compile()',\n    'code2.evaluate(scope)'\n  ],\n  seealso: ['parser', 'evaluate', 'compile']\n}\n","export const parserDocs = {\n  name: 'parser',\n  category: 'Expression',\n  syntax: [\n    'parser()'\n  ],\n  description: 'Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.',\n  examples: [\n    'myParser = parser()',\n    'myParser.evaluate(\"sqrt(3^2 + 4^2)\")',\n    'myParser.set(\"x\", 3)',\n    'myParser.evaluate(\"y = x + 3\")',\n    'myParser.evaluate([\"y = x + 3\", \"y = y + 1\"])',\n    'myParser.get(\"y\")'\n  ],\n  seealso: ['evaluate', 'parse', 'compile']\n}\n","export const compileDocs = {\n  name: 'compile',\n  category: 'Expression',\n  syntax: [\n    'compile(expr) ',\n    'compile([expr1, expr2, expr3, ...])'\n  ],\n  description: 'Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.',\n  examples: [\n    'code1 = compile(\"sqrt(3^2 + 4^2)\")',\n    'code1.evaluate() ',\n    'code2 = compile(\"a * b\")',\n    'code2.evaluate({a: 3, b: 4})'\n  ],\n  seealso: ['parser', 'parse', 'evaluate']\n}\n","export const distanceDocs = {\n  name: 'distance',\n  category: 'Geometry',\n  syntax: [\n    'distance([x1, y1], [x2, y2])',\n    'distance([[x1, y1], [x2, y2]])'\n  ],\n  description: 'Calculates the Euclidean distance between two points.',\n  examples: [\n    'distance([0,0], [4,4])',\n    'distance([[0,0], [4,4]])'\n  ],\n  seealso: []\n}\n","export const intersectDocs = {\n  name: 'intersect',\n  category: 'Geometry',\n  syntax: [\n    'intersect(expr1, expr2, expr3, expr4)',\n    'intersect(expr1, expr2, expr3)'\n  ],\n  description: 'Computes the intersection point of lines and/or planes.',\n  examples: [\n    'intersect([0, 0], [10, 10], [10, 0], [0, 10])',\n    'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'\n  ],\n  seealso: []\n}\n","export const andDocs = {\n  name: 'and',\n  category: 'Logical',\n  syntax: [\n    'x and y',\n    'and(x, y)'\n  ],\n  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',\n  examples: [\n    'true and false',\n    'true and true',\n    '2 and 4'\n  ],\n  seealso: [\n    'not', 'or', 'xor'\n  ]\n}\n","export const notDocs = {\n  name: 'not',\n  category: 'Logical',\n  syntax: [\n    'not x',\n    'not(x)'\n  ],\n  description: 'Logical not. Flips the boolean value of given argument.',\n  examples: [\n    'not true',\n    'not false',\n    'not 2',\n    'not 0'\n  ],\n  seealso: [\n    'and', 'or', 'xor'\n  ]\n}\n","export const nullishDocs = {\n  name: 'nullish',\n  category: 'Logical',\n  syntax: [\n    'x ?? y',\n    'nullish(x, y)'\n  ],\n  description: 'Nullish coalescing operator. Returns the right-hand operand when the left-hand operand is null or undefined, and otherwise returns the left-hand operand.',\n  examples: [\n    'null ?? 42',\n    'undefined ?? 42',\n    '0 ?? 42',\n    'false ?? 42',\n    'null ?? undefined ?? 42'\n  ],\n  seealso: [\n    'and', 'or', 'not'\n  ]\n}\n","export const orDocs = {\n  name: 'or',\n  category: 'Logical',\n  syntax: [\n    'x or y',\n    'or(x, y)'\n  ],\n  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',\n  examples: [\n    'true or false',\n    'false or false',\n    '0 or 4'\n  ],\n  seealso: [\n    'not', 'and', 'xor'\n  ]\n}\n","export const xorDocs = {\n  name: 'xor',\n  category: 'Logical',\n  syntax: [\n    'x xor y',\n    'xor(x, y)'\n  ],\n  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',\n  examples: [\n    'true xor false',\n    'false xor false',\n    'true xor true',\n    '0 xor 4'\n  ],\n  seealso: [\n    'not', 'and', 'or'\n  ]\n}\n","export const mapSlicesDocs = {\n  name: 'mapSlices',\n  category: 'Matrix',\n  syntax: ['mapSlices(A, dim, callback)'],\n  description:\n    'Generate a matrix one dimension less than A by applying callback to ' +\n    'each slice of A along dimension dim.',\n  examples: [\n    'A = [[1, 2], [3, 4]]',\n    'mapSlices(A, 1, sum)', // returns [4, 6]\n    'mapSlices(A, 2, prod)' // returns [2, 12]\n  ],\n  seealso: ['map', 'forEach']\n}\n","export const concatDocs = {\n  name: 'concat',\n  category: 'Matrix',\n  syntax: [\n    'concat(A, B, C, ...)',\n    'concat(A, B, C, ..., dim)'\n  ],\n  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',\n  examples: [\n    'A = [1, 2; 5, 6]',\n    'B = [3, 4; 7, 8]',\n    'concat(A, B)',\n    'concat(A, B, 1)',\n    'concat(A, B, 2)'\n  ],\n  seealso: [\n    'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const countDocs = {\n  name: 'count',\n  category: 'Matrix',\n  syntax: [\n    'count(x)'\n  ],\n  description: 'Count the number of elements of a matrix, array or string.',\n  examples: [\n    'a = [1, 2; 3, 4; 5, 6]',\n    'count(a)',\n    'size(a)',\n    'count(\"hello world\")'\n  ],\n  seealso: [\n    'size'\n  ]\n}\n","export const crossDocs = {\n  name: 'cross',\n  category: 'Matrix',\n  syntax: [\n    'cross(A, B)'\n  ],\n  description: 'Calculate the cross product for two vectors in three dimensional space.',\n  examples: [\n    'cross([1, 1, 0],  [0, 1, 1])',\n    'cross([3, -3, 1], [4, 9, 2])',\n    'cross([2, 3, 4],  [5, 6, 7])'\n  ],\n  seealso: [\n    'multiply',\n    'dot'\n  ]\n}\n","export const columnDocs = {\n  name: 'column',\n  category: 'Matrix',\n  syntax: [\n    'column(x, index)'\n  ],\n  description: 'Return a column from a matrix or array.',\n  examples: [\n    'A = [[1, 2], [3, 4]]',\n    'column(A, 1)',\n    'column(A, 2)'\n  ],\n  seealso: ['row', 'matrixFromColumns']\n}\n","export const ctransposeDocs = {\n  name: 'ctranspose',\n  category: 'Matrix',\n  syntax: [\n    'x\\'',\n    'ctranspose(x)'\n  ],\n  description: 'Complex Conjugate and Transpose a matrix',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a\\'',\n    'ctranspose(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros'\n  ]\n}\n","export const detDocs = {\n  name: 'det',\n  category: 'Matrix',\n  syntax: [\n    'det(x)'\n  ],\n  description: 'Calculate the determinant of a matrix',\n  examples: [\n    'det([1, 2; 3, 4])',\n    'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'\n  ],\n  seealso: [\n    'concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const diagDocs = {\n  name: 'diag',\n  category: 'Matrix',\n  syntax: [\n    'diag(x)',\n    'diag(x, k)'\n  ],\n  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',\n  examples: [\n    'diag(1:3)',\n    'diag(1:3, 1)',\n    'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]',\n    'diag(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const diffDocs = {\n  name: 'diff',\n  category: 'Matrix',\n  syntax: [\n    'diff(arr)',\n    'diff(arr, dim)'\n  ],\n  description: [\n    'Create a new matrix or array with the difference of the passed matrix or array.',\n    'Dim parameter is optional and used to indicate the dimension of the array/matrix to apply the difference',\n    'If no dimension parameter is passed it is assumed as dimension 0',\n    'Dimension is zero-based in javascript and one-based in the parser',\n    'Arrays must be \\'rectangular\\' meaning arrays like [1, 2]',\n    'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'\n  ],\n  examples: [\n    'A = [1, 2, 4, 7, 0]',\n    'diff(A)',\n    'diff(A, 1)',\n    'B = [[1, 2], [3, 4]]',\n    'diff(B)',\n    'diff(B, 1)',\n    'diff(B, 2)',\n    'diff(B, bignumber(2))',\n    'diff([[1, 2], matrix([3, 4])], 2)'\n  ],\n  seealso: ['subtract', 'partitionSelect']\n}\n","export const dotDocs = {\n  name: 'dot',\n  category: 'Matrix',\n  syntax: [\n    'dot(A, B)',\n    'A * B'\n  ],\n  description: 'Calculate the dot product of two vectors. ' +\n      'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' +\n      'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',\n  examples: [\n    'dot([2, 4, 1], [2, 2, 3])',\n    '[2, 4, 1] * [2, 2, 3]'\n  ],\n  seealso: [\n    'multiply',\n    'cross'\n  ]\n}\n","export const getMatrixDataTypeDocs = {\n  name: 'getMatrixDataType',\n  category: 'Matrix',\n  syntax: [\n    'getMatrixDataType(x)'\n  ],\n  description: 'Find the data type of all elements in a matrix or array, ' +\n  'for example \"number\" if all items are a number ' +\n  'and \"Complex\" if all values are complex numbers. ' +\n  'If a matrix contains more than one data type, it will return \"mixed\".',\n  examples: [\n    'getMatrixDataType([1, 2, 3])',\n    'getMatrixDataType([[5 cm], [2 inch]])',\n    'getMatrixDataType([1, \"text\"])',\n    'getMatrixDataType([1, bignumber(4)])'\n  ],\n  seealso: ['matrix', 'sparse', 'typeOf']\n}\n","export const identityDocs = {\n  name: 'identity',\n  category: 'Matrix',\n  syntax: [\n    'identity(n)',\n    'identity(m, n)',\n    'identity([m, n])'\n  ],\n  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',\n  examples: [\n    'identity(3)',\n    'identity(3, 5)',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'identity(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const filterDocs = {\n  name: 'filter',\n  category: 'Matrix',\n  syntax: [\n    'filter(x, test)'\n  ],\n  description: 'Filter items in a matrix.',\n  examples: [\n    'isPositive(x) = x > 0',\n    'filter([6, -2, -1, 4, 3], isPositive)',\n    'filter([6, -2, 0, 1, 0], x != 0)'\n  ],\n  seealso: ['sort', 'map', 'forEach']\n}\n","export const flattenDocs = {\n  name: 'flatten',\n  category: 'Matrix',\n  syntax: [\n    'flatten(x)'\n  ],\n  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'size(a)',\n    'b = flatten(a)',\n    'size(b)'\n  ],\n  seealso: [\n    'concat', 'resize', 'size', 'squeeze'\n  ]\n}\n","export const forEachDocs = {\n  name: 'forEach',\n  category: 'Matrix',\n  syntax: [\n    'forEach(x, callback)'\n  ],\n  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',\n  examples: [\n    'numberOfPets = {}',\n    'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;',\n    'forEach([\"Dog\",\"Cat\",\"Cat\"], addPet)',\n    'numberOfPets'\n  ],\n  seealso: ['map', 'sort', 'filter']\n}\n","export const invDocs = {\n  name: 'inv',\n  category: 'Matrix',\n  syntax: [\n    'inv(x)'\n  ],\n  description: 'Calculate the inverse of a matrix',\n  examples: [\n    'inv([1, 2; 3, 4])',\n    'inv(4)',\n    '1 / 4'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const pinvDocs = {\n  name: 'pinv',\n  category: 'Matrix',\n  syntax: [\n    'pinv(x)'\n  ],\n  description: 'Calculate the Moore–Penrose inverse of a matrix',\n  examples: [\n    'pinv([1, 2; 3, 4])',\n    'pinv([[1, 0], [0, 1], [0, 1]])',\n    'pinv(4)'\n  ],\n  seealso: [\n    'inv'\n  ]\n}\n","export const eigsDocs = {\n  name: 'eigs',\n  category: 'Matrix',\n  syntax: [\n    'eigs(x)'\n  ],\n  description: 'Calculate the eigenvalues and optionally eigenvectors of a square matrix',\n  examples: [\n    'eigs([[5, 2.3], [2.3, 1]])',\n    'eigs([[1, 2, 3], [4, 5, 6], [7, 8, 9]], { precision: 1e-6, eigenvectors: false })'\n  ],\n  seealso: [\n    'inv'\n  ]\n}\n","export const kronDocs = {\n  name: 'kron',\n  category: 'Matrix',\n  syntax: [\n    'kron(x, y)'\n  ],\n  description: 'Calculates the Kronecker product of 2 matrices or vectors.',\n  examples: [\n    'kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])',\n    'kron([1,1], [2,3,4])'\n  ],\n  seealso: [\n    'multiply', 'dot', 'cross'\n  ]\n}\n","export const matrixFromFunctionDocs = {\n  name: 'matrixFromFunction',\n  category: 'Matrix',\n  syntax: [\n    'matrixFromFunction(size, fn)',\n    'matrixFromFunction(size, fn, format)',\n    'matrixFromFunction(size, fn, format, datatype)',\n    'matrixFromFunction(size, format, fn)',\n    'matrixFromFunction(size, format, datatype, fn)'\n  ],\n  description: 'Create a matrix by evaluating a generating function at each index.',\n  examples: [\n    'f(I) = I[1] - I[2]',\n    'matrixFromFunction([3,3], f)',\n    'g(I) = I[1] - I[2] == 1 ? 4 : 0',\n    'matrixFromFunction([100, 100], \"sparse\", g)',\n    'matrixFromFunction([5], random)'\n  ],\n  seealso: [\n    'matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros'\n  ]\n}\n","export const matrixFromRowsDocs = {\n  name: 'matrixFromRows',\n  category: 'Matrix',\n  syntax: [\n    'matrixFromRows(...arr)',\n    'matrixFromRows(row1, row2)',\n    'matrixFromRows(row1, row2, row3)'\n  ],\n  description: 'Create a dense matrix from vectors as individual rows.',\n  examples: [\n    'matrixFromRows([1, 2, 3], [[4],[5],[6]])'\n  ],\n  seealso: [\n    'matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros'\n  ]\n}\n","export const matrixFromColumnsDocs = {\n  name: 'matrixFromColumns',\n  category: 'Matrix',\n  syntax: [\n    'matrixFromColumns(...arr)',\n    'matrixFromColumns(row1, row2)',\n    'matrixFromColumns(row1, row2, row3)'\n  ],\n  description: 'Create a dense matrix from vectors as individual columns.',\n  examples: [\n    'matrixFromColumns([1, 2, 3], [[4],[5],[6]])'\n  ],\n  seealso: [\n    'matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros'\n  ]\n}\n","export const mapDocs = {\n  name: 'map',\n  category: 'Matrix',\n  syntax: [\n    'map(x, callback)',\n    'map(x, y, ..., callback)'\n  ],\n  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array or the matrices/arrays.',\n  examples: [\n    'map([1, 2, 3], square)',\n    'map([1, 2], [3, 4], f(a,b) = a + b)'\n  ],\n  seealso: ['filter', 'forEach']\n}\n","export const onesDocs = {\n  name: 'ones',\n  category: 'Matrix',\n  syntax: [\n    'ones(m)',\n    'ones(m, n)',\n    'ones(m, n, p, ...)',\n    'ones([m])',\n    'ones([m, n])',\n    'ones([m, n, p, ...])'\n  ],\n  description: 'Create a matrix containing ones.',\n  examples: [\n    'ones(3)',\n    'ones(3, 5)',\n    'ones([2,3]) * 4.5',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'ones(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const partitionSelectDocs = {\n  name: 'partitionSelect',\n  category: 'Matrix',\n  syntax: [\n    'partitionSelect(x, k)',\n    'partitionSelect(x, k, compare)'\n  ],\n  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',\n  examples: [\n    'partitionSelect([5, 10, 1], 2)',\n    'partitionSelect([\"C\", \"B\", \"A\", \"D\"], 1, compareText)',\n    'arr = [5, 2, 1]',\n    'partitionSelect(arr, 0) # returns 1, arr is now: [1, 2, 5]',\n    'arr',\n    'partitionSelect(arr, 1, \\'desc\\') # returns 2, arr is now: [5, 2, 1]',\n    'arr'\n  ],\n  seealso: ['sort']\n}\n","export const rangeDocs = {\n  name: 'range',\n  category: 'Type',\n  syntax: [\n    'start:end',\n    'start:step:end',\n    'range(start, end)',\n    'range(start, end, step)',\n    'range(string)'\n  ],\n  description:\n      'Create a range. Lower bound of the range is included, upper bound is excluded.',\n  examples: [\n    '1:5',\n    '3:-1:-3',\n    'range(3, 7)',\n    'range(0, 12, 2)',\n    'range(\"4:10\")',\n    'range(1m, 1m, 3m)',\n    'a = [1, 2, 3, 4; 5, 6, 7, 8]',\n    'a[1:2, 1:2]'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const resizeDocs = {\n  name: 'resize',\n  category: 'Matrix',\n  syntax: [\n    'resize(x, size)',\n    'resize(x, size, defaultValue)'\n  ],\n  description: 'Resize a matrix.',\n  examples: [\n    'resize([1,2,3,4,5], [3])',\n    'resize([1,2,3], [5])',\n    'resize([1,2,3], [5], -1)',\n    'resize(2, [2, 3])',\n    'resize(\"hello\", [8], \"!\")'\n  ],\n  seealso: [\n    'size', 'subset', 'squeeze', 'reshape'\n  ]\n}\n","export const reshapeDocs = {\n  name: 'reshape',\n  category: 'Matrix',\n  syntax: [\n    'reshape(x, sizes)'\n  ],\n  description: 'Reshape a multi dimensional array to fit the specified dimensions.',\n  examples: [\n    'reshape([1, 2, 3, 4, 5, 6], [2, 3])',\n    'reshape([[1, 2], [3, 4]], [1, 4])',\n    'reshape([[1, 2], [3, 4]], [4])',\n    'reshape([1, 2, 3, 4], [-1, 2])'\n  ],\n  seealso: [\n    'size', 'squeeze', 'resize'\n  ]\n}\n","export const rotateDocs = {\n  name: 'rotate',\n  category: 'Matrix',\n  syntax: [\n    'rotate(w, theta)',\n    'rotate(w, theta, v)'\n  ],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' +\n    'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: [\n    'rotate([1, 0], pi / 2)',\n    'rotate(matrix([1, 0]), unit(\"35deg\"))',\n    'rotate([1, 0, 0], unit(\"90deg\"), [0, 0, 1])',\n    'rotate(matrix([1, 0, 0]), unit(\"90deg\"), matrix([0, 0, 1]))'\n  ],\n  seealso: [\n    'matrix', 'rotationMatrix'\n  ]\n}\n","export const rotationMatrixDocs = {\n  name: 'rotationMatrix',\n  category: 'Matrix',\n  syntax: [\n    'rotationMatrix(theta)',\n    'rotationMatrix(theta, v)',\n    'rotationMatrix(theta, v, format)'\n  ],\n  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' +\n    'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',\n  examples: [\n    'rotationMatrix(pi / 2)',\n    'rotationMatrix(unit(\"45deg\"), [0, 0, 1])',\n    'rotationMatrix(1, matrix([0, 0, 1]), \"sparse\")'\n  ],\n  seealso: [\n    'cos', 'sin'\n  ]\n}\n","export const rowDocs = {\n  name: 'row',\n  category: 'Matrix',\n  syntax: [\n    'row(x, index)'\n  ],\n  description: 'Return a row from a matrix or array.',\n  examples: [\n    'A = [[1, 2], [3, 4]]',\n    'row(A, 1)',\n    'row(A, 2)'\n  ],\n  seealso: ['column', 'matrixFromRows']\n}\n","export const sizeDocs = {\n  name: 'size',\n  category: 'Matrix',\n  syntax: [\n    'size(x)'\n  ],\n  description: 'Calculate the size of a matrix.',\n  examples: [\n    'size(2.3)',\n    'size(\"hello world\")',\n    'a = [1, 2; 3, 4; 5, 6]',\n    'size(a)',\n    'size(1:6)'\n  ],\n  seealso: [\n    'concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const sortDocs = {\n  name: 'sort',\n  category: 'Matrix',\n  syntax: [\n    'sort(x)',\n    'sort(x, compare)'\n  ],\n  description: 'Sort the items in a matrix. Compare can be a string \"asc\", \"desc\", \"natural\", or a custom sort function.',\n  examples: [\n    'sort([5, 10, 1])',\n    'sort([\"C\", \"B\", \"A\", \"D\"], \"natural\")',\n    'sortByLength(a, b) = size(a)[1] - size(b)[1]',\n    'sort([\"Langdon\", \"Tom\", \"Sara\"], sortByLength)',\n    'sort([\"10\", \"1\", \"2\"], \"natural\")'\n  ],\n  seealso: ['map', 'filter', 'forEach']\n}\n","export const squeezeDocs = {\n  name: 'squeeze',\n  category: 'Matrix',\n  syntax: [\n    'squeeze(x)'\n  ],\n  description: 'Remove inner and outer singleton dimensions from a matrix.',\n  examples: [\n    'a = zeros(3,2,1)',\n    'size(squeeze(a))',\n    'b = zeros(1,1,3)',\n    'size(squeeze(b))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const subsetDocs = {\n  name: 'subset',\n  category: 'Matrix',\n  syntax: [\n    'value(index)',\n    'value(index) = replacement',\n    'subset(value, [index])',\n    'subset(value, [index], replacement)'\n  ],\n  description: 'Get or set a subset of the entries of a matrix or ' +\n      'characters of a string. ' +\n      'Indexes are one-based. There should be one index specification for ' +\n      'each dimension of the target. Each specification can be a single ' +\n      'index, a list of indices, or a range in colon notation `l:u`. ' +\n      'In a range, both the lower bound l and upper bound u are included; ' +\n      'and if a bound is omitted it defaults to the most extreme valid value. ' +\n      'The cartesian product of the indices specified in each dimension ' +\n      'determines the target of the operation.',\n  examples: [\n    'd = [1, 2; 3, 4]',\n    'e = []',\n    'e[1, 1:2] = [5, 6]',\n    'e[2, :] = [7, 8]',\n    'f = d * e',\n    'f[2, 1]',\n    'f[:, 1]',\n    'f[[1,2], [1,3]] = [9, 10; 11, 12]',\n    'f'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros'\n  ]\n}\n","export const traceDocs = {\n  name: 'trace',\n  category: 'Matrix',\n  syntax: [\n    'trace(A)'\n  ],\n  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',\n  examples: [\n    'A = [1, 2, 3; -1, 2, 3; 2, 0, 3]',\n    'trace(A)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros'\n  ]\n}\n","export const transposeDocs = {\n  name: 'transpose',\n  category: 'Matrix',\n  syntax: [\n    'x\\'',\n    'transpose(x)'\n  ],\n  description: 'Transpose a matrix',\n  examples: [\n    'a = [1, 2, 3; 4, 5, 6]',\n    'a\\'',\n    'transpose(a)'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros'\n  ]\n}\n","export const zerosDocs = {\n  name: 'zeros',\n  category: 'Matrix',\n  syntax: [\n    'zeros(m)',\n    'zeros(m, n)',\n    'zeros(m, n, p, ...)',\n    'zeros([m])',\n    'zeros([m, n])',\n    'zeros([m, n, p, ...])'\n  ],\n  description: 'Create a matrix containing zeros.',\n  examples: [\n    'zeros(3)',\n    'zeros(3, 5)',\n    'a = [1, 2, 3; 4, 5, 6]',\n    'zeros(size(a))'\n  ],\n  seealso: [\n    'concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose'\n  ]\n}\n","export const fftDocs = {\n  name: 'fft',\n  category: 'Matrix',\n  syntax: [\n    'fft(x)'\n  ],\n  description: 'Calculate N-dimensional Fourier transform',\n  examples: [\n    'fft([[1, 0], [1, 0]])'\n  ],\n  seealso: [\n    'ifft'\n  ]\n}\n","export const ifftDocs = {\n  name: 'ifft',\n  category: 'Matrix',\n  syntax: [\n    'ifft(x)'\n  ],\n  description: 'Calculate N-dimensional inverse Fourier transform',\n  examples: [\n    'ifft([[2, 2], [0, 0]])'\n  ],\n  seealso: [\n    'fft'\n  ]\n}\n","export const sylvesterDocs = {\n  name: 'sylvester',\n  category: 'Algebra',\n  syntax: [\n    'sylvester(A,B,C)'\n  ],\n  description: 'Solves the real-valued Sylvester equation AX+XB=C for X',\n  examples: [\n    'sylvester([[-1, -2], [1, 1]], [[-2, 1], [-1, 2]], [[-3, 2], [3, 0]])',\n    'A = [[-1, -2], [1, 1]]; B = [[2, -1], [1, -2]]; C = [[-3, 2], [3, 0]]',\n    'sylvester(A, B, C)'\n  ],\n  seealso: [\n    'schur', 'lyap'\n  ]\n}\n","export const schurDocs = {\n  name: 'schur',\n  category: 'Algebra',\n  syntax: [\n    'schur(A)'\n  ],\n  description: 'Performs a real Schur decomposition of the real matrix A = UTU\\'',\n  examples: [\n    'schur([[1, 0], [-4, 3]])',\n    'A = [[1, 0], [-4, 3]]',\n    'schur(A)'\n  ],\n  seealso: [\n    'lyap', 'sylvester'\n  ]\n}\n","export const lyapDocs = {\n  name: 'lyap',\n  category: 'Algebra',\n  syntax: [\n    'lyap(A,Q)'\n  ],\n  description: 'Solves the Continuous-time Lyapunov equation AP+PA\\'+Q=0 for P',\n  examples: [\n    'lyap([[-2, 0], [1, -4]], [[3, 1], [1, 3]])',\n    'A = [[-2, 0], [1, -4]]',\n    'Q = [[3, 1], [1, 3]]',\n    'lyap(A,Q)'\n  ],\n  seealso: [\n    'schur', 'sylvester'\n  ]\n}\n","export const solveODEDocs = {\n  name: 'solveODE',\n  category: 'Numeric',\n  syntax: [\n    'solveODE(func, tspan, y0)',\n    'solveODE(func, tspan, y0, options)'\n  ],\n  description: 'Numerical Integration of Ordinary Differential Equations.',\n  examples: [\n    'f(t,y) = y',\n    'tspan = [0, 4]',\n    'solveODE(f, tspan, 1)',\n    'solveODE(f, tspan, [1, 2])',\n    'solveODE(f, tspan, 1, { method:\"RK23\", maxStep:0.1 })'\n  ],\n  seealso: ['derivative', 'simplifyCore']\n}\n","export const combinationsDocs = {\n  name: 'combinations',\n  category: 'Probability',\n  syntax: [\n    'combinations(n, k)'\n  ],\n  description: 'Compute the number of combinations of n items taken k at a time',\n  examples: [\n    'combinations(7, 5)'\n  ],\n  seealso: ['combinationsWithRep', 'permutations', 'factorial']\n}\n","export const combinationsWithRepDocs = {\n  name: 'combinationsWithRep',\n  category: 'Probability',\n  syntax: [\n    'combinationsWithRep(n, k)'\n  ],\n  description: 'Compute the number of combinations of n items taken k at a time with replacements.',\n  examples: [\n    'combinationsWithRep(7, 5)'\n  ],\n  seealso: ['combinations', 'permutations', 'factorial']\n}\n","export const factorialDocs = {\n  name: 'factorial',\n  category: 'Probability',\n  syntax: [\n    'n!',\n    'factorial(n)'\n  ],\n  description: 'Compute the factorial of a value',\n  examples: [\n    '5!',\n    '5 * 4 * 3 * 2 * 1',\n    '3!'\n  ],\n  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']\n}\n","export const gammaDocs = {\n  name: 'gamma',\n  category: 'Probability',\n  syntax: [\n    'gamma(n)'\n  ],\n  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',\n  examples: [\n    'gamma(4)',\n    '3!',\n    'gamma(1/2)',\n    'sqrt(pi)'\n  ],\n  seealso: ['factorial']\n}\n","export const kldivergenceDocs = {\n  name: 'kldivergence',\n  category: 'Probability',\n  syntax: [\n    'kldivergence(x, y)'\n  ],\n  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',\n  examples: [\n    'kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'\n  ],\n  seealso: []\n}\n","export const lgammaDocs = {\n  name: 'lgamma',\n  category: 'Probability',\n  syntax: ['lgamma(n)'],\n  description:\n    'Logarithm of the gamma function for real, positive numbers and complex numbers, ' +\n    'using Lanczos approximation for numbers and Stirling series for complex numbers.',\n  examples: [\n    'lgamma(4)',\n    'lgamma(1/2)',\n    'lgamma(i)',\n    'lgamma(complex(1.1, 2))'\n  ],\n  seealso: ['gamma']\n}\n","export const multinomialDocs = {\n  name: 'multinomial',\n  category: 'Probability',\n  syntax: [\n    'multinomial(A)'\n  ],\n  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',\n  examples: [\n    'multinomial([1, 2, 1])'\n  ],\n  seealso: ['combinations', 'factorial']\n}\n","export const permutationsDocs = {\n  name: 'permutations',\n  category: 'Probability',\n  syntax: [\n    'permutations(n)',\n    'permutations(n, k)'\n  ],\n  description: 'Compute the number of permutations of n items taken k at a time',\n  examples: [\n    'permutations(5)',\n    'permutations(5, 3)'\n  ],\n  seealso: ['combinations', 'combinationsWithRep', 'factorial']\n}\n","export const pickRandomDocs = {\n  name: 'pickRandom',\n  category: 'Probability',\n  syntax: [\n    'pickRandom(array)',\n    'pickRandom(array, number)',\n    'pickRandom(array, weights)',\n    'pickRandom(array, number, weights)',\n    'pickRandom(array, weights, number)'\n  ],\n  description:\n      'Pick a random entry from a given array.',\n  examples: [\n    'pickRandom(0:10)',\n    'pickRandom([1, 3, 1, 6])',\n    'pickRandom([1, 3, 1, 6], 2)',\n    'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])',\n    'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])',\n    'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'\n  ],\n  seealso: ['random', 'randomInt']\n}\n","export const randomDocs = {\n  name: 'random',\n  category: 'Probability',\n  syntax: [\n    'random()',\n    'random(max)',\n    'random(min, max)',\n    'random(size)',\n    'random(size, max)',\n    'random(size, min, max)'\n  ],\n  description:\n      'Return a random number.',\n  examples: [\n    'random()',\n    'random(10, 20)',\n    'random([2, 3])'\n  ],\n  seealso: ['pickRandom', 'randomInt']\n}\n","export const randomIntDocs = {\n  name: 'randomInt',\n  category: 'Probability',\n  syntax: [\n    'randomInt(max)',\n    'randomInt(min, max)',\n    'randomInt(size)',\n    'randomInt(size, max)',\n    'randomInt(size, min, max)'\n  ],\n  description:\n      'Return a random integer number',\n  examples: [\n    'randomInt(10, 20)',\n    'randomInt([2, 3], 10)'\n  ],\n  seealso: ['pickRandom', 'random']\n}\n","export const compareDocs = {\n  name: 'compare',\n  category: 'Relational',\n  syntax: [\n    'compare(x, y)'\n  ],\n  description:\n      'Compare two values. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compare(2, 3)',\n    'compare(3, 2)',\n    'compare(2, 2)',\n    'compare(5cm, 40mm)',\n    'compare(2, [1, 2, 3])'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText'\n  ]\n}\n","export const compareNaturalDocs = {\n  name: 'compareNatural',\n  category: 'Relational',\n  syntax: [\n    'compareNatural(x, y)'\n  ],\n  description:\n      'Compare two values of any type in a deterministic, natural way. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compareNatural(2, 3)',\n    'compareNatural(3, 2)',\n    'compareNatural(2, 2)',\n    'compareNatural(5cm, 40mm)',\n    'compareNatural(\"2\", \"10\")',\n    'compareNatural(2 + 3i, 2 + 4i)',\n    'compareNatural([1, 2, 4], [1, 2, 3])',\n    'compareNatural([1, 5], [1, 2, 3])',\n    'compareNatural([1, 2], [1, 2])',\n    'compareNatural({a: 2}, {a: 4})'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText'\n  ]\n}\n","export const compareTextDocs = {\n  name: 'compareText',\n  category: 'Relational',\n  syntax: [\n    'compareText(x, y)'\n  ],\n  description:\n      'Compare two strings lexically. Comparison is case sensitive. ' +\n      'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',\n  examples: [\n    'compareText(\"B\", \"A\")',\n    'compareText(\"A\", \"B\")',\n    'compareText(\"A\", \"A\")',\n    'compareText(\"2\", \"10\")',\n    'compare(\"2\", \"10\")',\n    'compare(2, 10)',\n    'compareNatural(\"2\", \"10\")',\n    'compareText(\"B\", [\"A\", \"B\", \"C\"])'\n  ],\n  seealso: [\n    'compare', 'compareNatural'\n  ]\n}\n","export const deepEqualDocs = {\n  name: 'deepEqual',\n  category: 'Relational',\n  syntax: [\n    'deepEqual(x, y)'\n  ],\n  description:\n      'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',\n  examples: [\n    'deepEqual([1,3,4], [1,3,4])',\n    'deepEqual([1,3,4], [1,3])'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const equalDocs = {\n  name: 'equal',\n  category: 'Relational',\n  syntax: [\n    'x == y',\n    'equal(x, y)'\n  ],\n  description:\n      'Check equality of two values. Returns true if the values are equal, and false if not.',\n  examples: [\n    '2+2 == 3',\n    '2+2 == 4',\n    'a = 3.2',\n    'b = 6-2.8',\n    'a == b',\n    '50cm == 0.5m'\n  ],\n  seealso: [\n    'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText'\n  ]\n}\n","export const equalTextDocs = {\n  name: 'equalText',\n  category: 'Relational',\n  syntax: [\n    'equalText(x, y)'\n  ],\n  description:\n      'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',\n  examples: [\n    'equalText(\"Hello\", \"Hello\")',\n    'equalText(\"a\", \"A\")',\n    'equal(\"2e3\", \"2000\")',\n    'equalText(\"2e3\", \"2000\")',\n    'equalText(\"B\", [\"A\", \"B\", \"C\"])'\n  ],\n  seealso: [\n    'compare', 'compareNatural', 'compareText', 'equal'\n  ]\n}\n","export const largerDocs = {\n  name: 'larger',\n  category: 'Relational',\n  syntax: [\n    'x > y',\n    'larger(x, y)'\n  ],\n  description:\n      'Check if value x is larger than y. Returns true if x is larger than y, and false if not. Comparing a value with NaN returns false.',\n  examples: [\n    '2 > 3',\n    '5 > 2*2',\n    'a = 3.3',\n    'b = 6-2.8',\n    '(a > b)',\n    '(b < a)',\n    '5 cm > 2 inch'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const largerEqDocs = {\n  name: 'largerEq',\n  category: 'Relational',\n  syntax: [\n    'x >= y',\n    'largerEq(x, y)'\n  ],\n  description:\n      'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',\n  examples: [\n    '2 >= 1+1',\n    '2 > 1+1',\n    'a = 3.2',\n    'b = 6-2.8',\n    '(a >= b)'\n  ],\n  seealso: [\n    'equal', 'unequal', 'smallerEq', 'smaller', 'compare'\n  ]\n}\n","export const smallerDocs = {\n  name: 'smaller',\n  category: 'Relational',\n  syntax: [\n    'x < y',\n    'smaller(x, y)'\n  ],\n  description:\n      'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not. Comparing a value with NaN returns false.',\n  examples: [\n    '2 < 3',\n    '5 < 2*2',\n    'a = 3.3',\n    'b = 6-2.8',\n    '(a < b)',\n    '5 cm < 2 inch'\n  ],\n  seealso: [\n    'equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare'\n  ]\n}\n","export const smallerEqDocs = {\n  name: 'smallerEq',\n  category: 'Relational',\n  syntax: [\n    'x <= y',\n    'smallerEq(x, y)'\n  ],\n  description:\n      'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',\n  examples: [\n    '2 <= 1+1',\n    '2 < 1+1',\n    'a = 3.2',\n    'b = 6-2.8',\n    '(a <= b)'\n  ],\n  seealso: [\n    'equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare'\n  ]\n}\n","export const unequalDocs = {\n  name: 'unequal',\n  category: 'Relational',\n  syntax: [\n    'x != y',\n    'unequal(x, y)'\n  ],\n  description:\n      'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',\n  examples: [\n    '2+2 != 3',\n    '2+2 != 4',\n    'a = 3.2',\n    'b = 6-2.8',\n    'a != b',\n    '50cm != 0.5m',\n    '5 cm != 2 inch'\n  ],\n  seealso: [\n    'equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual'\n  ]\n}\n","export const setCartesianDocs = {\n  name: 'setCartesian',\n  category: 'Set',\n  syntax: [\n    'setCartesian(set1, set2)'\n  ],\n  description:\n      'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',\n  examples: [\n    'setCartesian([1, 2], [3, 4])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference', 'setPowerset'\n  ]\n}\n","export const setDifferenceDocs = {\n  name: 'setDifference',\n  category: 'Set',\n  syntax: [\n    'setDifference(set1, set2)'\n  ],\n  description:\n      'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setDifference([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setSymDifference'\n  ]\n}\n","export const setDistinctDocs = {\n  name: 'setDistinct',\n  category: 'Set',\n  syntax: [\n    'setDistinct(set)'\n  ],\n  description:\n      'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setDistinct([1, 1, 1, 2, 2, 3])'\n  ],\n  seealso: [\n    'setMultiplicity'\n  ]\n}\n","export const setIntersectDocs = {\n  name: 'setIntersect',\n  category: 'Set',\n  syntax: [\n    'setIntersect(set1, set2)'\n  ],\n  description:\n      'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setIntersect([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setDifference'\n  ]\n}\n","export const setIsSubsetDocs = {\n  name: 'setIsSubset',\n  category: 'Set',\n  syntax: [\n    'setIsSubset(set1, set2)'\n  ],\n  description:\n      'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setIsSubset([1, 2], [3, 4, 5, 6])',\n    'setIsSubset([3, 4], [3, 4, 5, 6])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setMultiplicityDocs = {\n  name: 'setMultiplicity',\n  category: 'Set',\n  syntax: [\n    'setMultiplicity(element, set)'\n  ],\n  description:\n      'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setMultiplicity(1, [1, 2, 2, 4])',\n    'setMultiplicity(2, [1, 2, 2, 4])'\n  ],\n  seealso: [\n    'setDistinct', 'setSize'\n  ]\n}\n","export const setPowersetDocs = {\n  name: 'setPowerset',\n  category: 'Set',\n  syntax: [\n    'setPowerset(set)'\n  ],\n  description:\n      'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setPowerset([1, 2, 3])'\n  ],\n  seealso: [\n    'setCartesian'\n  ]\n}\n","export const setSizeDocs = {\n  name: 'setSize',\n  category: 'Set',\n  syntax: [\n    'setSize(set)',\n    'setSize(set, unique)'\n  ],\n  description:\n      'Count the number of elements of a (multi)set. When the second parameter \"unique\" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',\n  examples: [\n    'setSize([1, 2, 2, 4])',\n    'setSize([1, 2, 2, 4], true)'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setSymDifferenceDocs = {\n  name: 'setSymDifference',\n  category: 'Set',\n  syntax: [\n    'setSymDifference(set1, set2)'\n  ],\n  description:\n      'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setUnion', 'setIntersect', 'setDifference'\n  ]\n}\n","export const setUnionDocs = {\n  name: 'setUnion',\n  category: 'Set',\n  syntax: [\n    'setUnion(set1, set2)'\n  ],\n  description:\n      'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',\n  examples: [\n    'setUnion([1, 2, 3, 4], [3, 4, 5, 6])',\n    'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'\n  ],\n  seealso: [\n    'setIntersect', 'setDifference'\n  ]\n}\n","export const zpk2tfDocs = {\n  name: 'zpk2tf',\n  category: 'Signal',\n  syntax: [\n    'zpk2tf(z, p, k)'\n  ],\n  description: 'Compute the transfer function of a zero-pole-gain model.',\n  examples: [\n    'zpk2tf([1, 2], [-1, -2], 1)',\n    'zpk2tf([1, 2], [-1, -2])',\n    'zpk2tf([1 - 3i, 2 + 2i], [-1, -2])'\n  ],\n  seealso: []\n}\n","export const freqzDocs = {\n  name: 'freqz',\n  category: 'Signal',\n  syntax: [\n    'freqz(b, a)',\n    'freqz(b, a, w)'\n  ],\n  description: 'Calculates the frequency response of a filter given its numerator and denominator coefficients.',\n  examples: [\n    'freqz([1, 2], [1, 2, 3])',\n    'freqz([1, 2], [1, 2, 3], [0, 1])',\n    'freqz([1, 2], [1, 2, 3], 512)'\n  ],\n  seealso: []\n}\n","export const erfDocs = {\n  name: 'erf',\n  category: 'Special',\n  syntax: [\n    'erf(x)'\n  ],\n  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',\n  examples: [\n    'erf(0.2)',\n    'erf(-0.5)',\n    'erf(4)'\n  ],\n  seealso: []\n}\n","export const zetaDocs = {\n  name: 'zeta',\n  category: 'Special',\n  syntax: [\n    'zeta(s)'\n  ],\n  description: 'Compute the Riemann Zeta Function using an infinite series and Riemann\\'s Functional Equation for the entire complex plane',\n  examples: [\n    'zeta(0.2)',\n    'zeta(-0.5)',\n    'zeta(4)'\n  ],\n  seealso: []\n}\n","export const cumSumDocs = {\n  name: 'cumsum',\n  category: 'Statistics',\n  syntax: [\n    'cumsum(a, b, c, ...)',\n    'cumsum(A)'\n  ],\n  description: 'Compute the cumulative sum of all values.',\n  examples: [\n    'cumsum(2, 3, 4, 1)',\n    'cumsum([2, 3, 4, 1])',\n    'cumsum([1, 2; 3, 4])',\n    'cumsum([1, 2; 3, 4], 1)',\n    'cumsum([1, 2; 3, 4], 2)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const madDocs = {\n  name: 'mad',\n  category: 'Statistics',\n  syntax: [\n    'mad(a, b, c, ...)',\n    'mad(A)'\n  ],\n  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',\n  examples: [\n    'mad(10, 20, 30)',\n    'mad([1, 2, 3])'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'std',\n    'abs'\n  ]\n}\n","export const maxDocs = {\n  name: 'max',\n  category: 'Statistics',\n  syntax: [\n    'max(a, b, c, ...)',\n    'max(A)',\n    'max(A, dimension)'\n  ],\n  description: 'Compute the maximum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',\n  examples: [\n    'max(2, 3, 4, 1)',\n    'max([2, 3, 4, 1])',\n    'max([2, 5; 4, 3])',\n    'max([2, 5; 4, 3], 1)',\n    'max([2, 5; 4, 3], 2)',\n    'max(2.7, 7.1, -4.5, 2.0, 4.1)',\n    'min(2.7, 7.1, -4.5, 2.0, 4.1)'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const meanDocs = {\n  name: 'mean',\n  category: 'Statistics',\n  syntax: [\n    'mean(a, b, c, ...)',\n    'mean(A)',\n    'mean(A, dimension)'\n  ],\n  description: 'Compute the arithmetic mean of a list of values.',\n  examples: [\n    'mean(2, 3, 4, 1)',\n    'mean([2, 3, 4, 1])',\n    'mean([2, 5; 4, 3])',\n    'mean([2, 5; 4, 3], 1)',\n    'mean([2, 5; 4, 3], 2)',\n    'mean([1.0, 2.7, 3.2, 4.0])'\n  ],\n  seealso: [\n    'max',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const medianDocs = {\n  name: 'median',\n  category: 'Statistics',\n  syntax: [\n    'median(a, b, c, ...)',\n    'median(A)'\n  ],\n  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',\n  examples: [\n    'median(5, 2, 7)',\n    'median([3, -1, 5, 7])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'prod',\n    'std',\n    'sum',\n    'variance',\n    'quantileSeq'\n  ]\n}\n","export const minDocs = {\n  name: 'min',\n  category: 'Statistics',\n  syntax: [\n    'min(a, b, c, ...)',\n    'min(A)',\n    'min(A, dimension)'\n  ],\n  description: 'Compute the minimum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',\n  examples: [\n    'min(2, 3, 4, 1)',\n    'min([2, 3, 4, 1])',\n    'min([2, 5; 4, 3])',\n    'min([2, 5; 4, 3], 1)',\n    'min([2, 5; 4, 3], 2)',\n    'min(2.7, 7.1, -4.5, 2.0, 4.1)',\n    'max(2.7, 7.1, -4.5, 2.0, 4.1)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const modeDocs = {\n  name: 'mode',\n  category: 'Statistics',\n  syntax: [\n    'mode(a, b, c, ...)',\n    'mode(A)',\n    'mode(A, a, b, B, c, ...)'\n  ],\n  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',\n  examples: [\n    'mode(2, 1, 4, 3, 1)',\n    'mode([1, 2.7, 3.2, 4, 2.7])',\n    'mode(1, 4, 6, 1, 6)'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const prodDocs = {\n  name: 'prod',\n  category: 'Statistics',\n  syntax: [\n    'prod(a, b, c, ...)',\n    'prod(A)'\n  ],\n  description: 'Compute the product of all values.',\n  examples: [\n    'prod(2, 3, 4)',\n    'prod([2, 3, 4])',\n    'prod([2, 5; 4, 3])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'min',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const quantileSeqDocs = {\n  name: 'quantileSeq',\n  category: 'Statistics',\n  syntax: [\n    'quantileSeq(A, prob[, sorted])',\n    'quantileSeq(A, [prob1, prob2, ...][, sorted])',\n    'quantileSeq(A, N[, sorted])'\n  ],\n  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probability are: Number, BigNumber. \\n\\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',\n  examples: [\n    'quantileSeq([3, -1, 5, 7], 0.5)',\n    'quantileSeq([3, -1, 5, 7], [1/3, 2/3])',\n    'quantileSeq([3, -1, 5, 7], 2)',\n    'quantileSeq([-1, 3, 5, 7], 0.5, true)'\n  ],\n  seealso: [\n    'mean',\n    'median',\n    'min',\n    'max',\n    'prod',\n    'std',\n    'sum',\n    'variance'\n  ]\n}\n","export const stdDocs = {\n  name: 'std',\n  category: 'Statistics',\n  syntax: [\n    'std(a, b, c, ...)',\n    'std(A)',\n    'std(A, dimension)',\n    'std(A, normalization)',\n    'std(A, dimension, normalization)'\n  ],\n  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  examples: [\n    'std(2, 4, 6)',\n    'std([2, 4, 6, 8])',\n    'std([2, 4, 6, 8], \"uncorrected\")',\n    'std([2, 4, 6, 8], \"biased\")',\n    'std([1, 2, 3; 4, 5, 6])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'prod',\n    'sum',\n    'variance'\n  ]\n}\n","export const sumDocs = {\n  name: 'sum',\n  category: 'Statistics',\n  syntax: [\n    'sum(a, b, c, ...)',\n    'sum(A)',\n    'sum(A, dimension)'\n  ],\n  description: 'Compute the sum of all values.',\n  examples: [\n    'sum(2, 3, 4, 1)',\n    'sum([2, 3, 4, 1])',\n    'sum([2, 5; 4, 3])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'variance'\n  ]\n}\n","export const varianceDocs = {\n  name: 'variance',\n  category: 'Statistics',\n  syntax: [\n    'variance(a, b, c, ...)',\n    'variance(A)',\n    'variance(A, dimension)',\n    'variance(A, normalization)',\n    'variance(A, dimension, normalization)'\n  ],\n  description: 'Compute the variance of all values. Optional parameter normalization can be \"unbiased\" (default), \"uncorrected\", or \"biased\".',\n  examples: [\n    'variance(2, 4, 6)',\n    'variance([2, 4, 6, 8])',\n    'variance([2, 4, 6, 8], \"uncorrected\")',\n    'variance([2, 4, 6, 8], \"biased\")',\n    'variance([1, 2, 3; 4, 5, 6])'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum'\n  ]\n}\n","export const corrDocs = {\n  name: 'corr',\n  category: 'Statistics',\n  syntax: [\n    'corr(A,B)'\n  ],\n  description: 'Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.',\n  examples: [\n    'corr([2, 4, 6, 8],[1, 2, 3, 6])',\n    'corr(matrix([[1, 2.2, 3, 4.8, 5], [1, 2, 3, 4, 5]]), matrix([[4, 5.3, 6.6, 7, 8], [1, 2, 3, 4, 5]]))'\n  ],\n  seealso: [\n    'max',\n    'mean',\n    'min',\n    'median',\n    'min',\n    'prod',\n    'std',\n    'sum'\n  ]\n}\n","export const acosDocs = {\n  name: 'acos',\n  category: 'Trigonometry',\n  syntax: [\n    'acos(x)'\n  ],\n  description: 'Compute the inverse cosine of a value in radians.',\n  examples: [\n    'acos(0.5)',\n    'acos(cos(2.3))'\n  ],\n  seealso: [\n    'cos',\n    'atan',\n    'asin'\n  ]\n}\n","export const acoshDocs = {\n  name: 'acosh',\n  category: 'Trigonometry',\n  syntax: [\n    'acosh(x)'\n  ],\n  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',\n  examples: [\n    'acosh(1.5)'\n  ],\n  seealso: [\n    'cosh',\n    'asinh',\n    'atanh'\n  ]\n}\n","export const acotDocs = {\n  name: 'acot',\n  category: 'Trigonometry',\n  syntax: [\n    'acot(x)'\n  ],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: [\n    'acot(0.5)',\n    'acot(cot(0.5))',\n    'acot(2)'\n  ],\n  seealso: [\n    'cot',\n    'atan'\n  ]\n}\n","export const acothDocs = {\n  name: 'acoth',\n  category: 'Trigonometry',\n  syntax: [\n    'acoth(x)'\n  ],\n  description: 'Calculate the inverse hyperbolic tangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',\n  examples: [\n    'acoth(2)',\n    'acoth(0.5)'\n  ],\n  seealso: [\n    'acsch',\n    'asech'\n  ]\n}\n","export const acscDocs = {\n  name: 'acsc',\n  category: 'Trigonometry',\n  syntax: [\n    'acsc(x)'\n  ],\n  description: 'Calculate the inverse cotangent of a value.',\n  examples: [\n    'acsc(2)',\n    'acsc(csc(0.5))',\n    'acsc(0.5)'\n  ],\n  seealso: [\n    'csc',\n    'asin',\n    'asec'\n  ]\n}\n","export const acschDocs = {\n  name: 'acsch',\n  category: 'Trigonometry',\n  syntax: [\n    'acsch(x)'\n  ],\n  description: 'Calculate the inverse hyperbolic cosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',\n  examples: [\n    'acsch(0.5)'\n  ],\n  seealso: [\n    'asech',\n    'acoth'\n  ]\n}\n","export const asecDocs = {\n  name: 'asec',\n  category: 'Trigonometry',\n  syntax: [\n    'asec(x)'\n  ],\n  description: 'Calculate the inverse secant of a value.',\n  examples: [\n    'asec(0.5)',\n    'asec(sec(0.5))',\n    'asec(2)'\n  ],\n  seealso: [\n    'acos',\n    'acot',\n    'acsc'\n  ]\n}\n","export const asechDocs = {\n  name: 'asech',\n  category: 'Trigonometry',\n  syntax: [\n    'asech(x)'\n  ],\n  description: 'Calculate the inverse secant of a value.',\n  examples: [\n    'asech(0.5)'\n  ],\n  seealso: [\n    'acsch',\n    'acoth'\n  ]\n}\n","export const asinDocs = {\n  name: 'asin',\n  category: 'Trigonometry',\n  syntax: [\n    'asin(x)'\n  ],\n  description: 'Compute the inverse sine of a value in radians.',\n  examples: [\n    'asin(0.5)',\n    'asin(sin(0.5))'\n  ],\n  seealso: [\n    'sin',\n    'acos',\n    'atan'\n  ]\n}\n","export const asinhDocs = {\n  name: 'asinh',\n  category: 'Trigonometry',\n  syntax: [\n    'asinh(x)'\n  ],\n  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',\n  examples: [\n    'asinh(0.5)'\n  ],\n  seealso: [\n    'acosh',\n    'atanh'\n  ]\n}\n","export const atanDocs = {\n  name: 'atan',\n  category: 'Trigonometry',\n  syntax: [\n    'atan(x)'\n  ],\n  description: 'Compute the inverse tangent of a value in radians.',\n  examples: [\n    'atan(0.5)',\n    'atan(tan(0.5))'\n  ],\n  seealso: [\n    'tan',\n    'acos',\n    'asin'\n  ]\n}\n","export const atanhDocs = {\n  name: 'atanh',\n  category: 'Trigonometry',\n  syntax: [\n    'atanh(x)'\n  ],\n  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',\n  examples: [\n    'atanh(0.5)'\n  ],\n  seealso: [\n    'acosh',\n    'asinh'\n  ]\n}\n","export const atan2Docs = {\n  name: 'atan2',\n  category: 'Trigonometry',\n  syntax: [\n    'atan2(y, x)'\n  ],\n  description:\n      'Computes the principal value of the arc tangent of y/x in radians.',\n  examples: [\n    'atan2(2, 2) / pi',\n    'angle = 60 deg in rad',\n    'x = cos(angle)',\n    'y = sin(angle)',\n    'atan2(y, x)'\n  ],\n  seealso: [\n    'sin',\n    'cos',\n    'tan'\n  ]\n}\n","export const cosDocs = {\n  name: 'cos',\n  category: 'Trigonometry',\n  syntax: [\n    'cos(x)'\n  ],\n  description: 'Compute the cosine of x in radians.',\n  examples: [\n    'cos(2)',\n    'cos(pi / 4) ^ 2',\n    'cos(180 deg)',\n    'cos(60 deg)',\n    'sin(0.2)^2 + cos(0.2)^2'\n  ],\n  seealso: [\n    'acos',\n    'sin',\n    'tan'\n  ]\n}\n","export const coshDocs = {\n  name: 'cosh',\n  category: 'Trigonometry',\n  syntax: [\n    'cosh(x)'\n  ],\n  description: 'Compute the hyperbolic cosine of x in radians.',\n  examples: [\n    'cosh(0.5)'\n  ],\n  seealso: [\n    'sinh',\n    'tanh',\n    'coth'\n  ]\n}\n","export const cotDocs = {\n  name: 'cot',\n  category: 'Trigonometry',\n  syntax: [\n    'cot(x)'\n  ],\n  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',\n  examples: [\n    'cot(2)',\n    '1 / tan(2)'\n  ],\n  seealso: [\n    'sec',\n    'csc',\n    'tan'\n  ]\n}\n","export const cothDocs = {\n  name: 'coth',\n  category: 'Trigonometry',\n  syntax: [\n    'coth(x)'\n  ],\n  description: 'Compute the hyperbolic cotangent of x in radians.',\n  examples: [\n    'coth(2)',\n    '1 / tanh(2)'\n  ],\n  seealso: [\n    'sech',\n    'csch',\n    'tanh'\n  ]\n}\n","export const cscDocs = {\n  name: 'csc',\n  category: 'Trigonometry',\n  syntax: [\n    'csc(x)'\n  ],\n  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',\n  examples: [\n    'csc(2)',\n    '1 / sin(2)'\n  ],\n  seealso: [\n    'sec',\n    'cot',\n    'sin'\n  ]\n}\n","export const cschDocs = {\n  name: 'csch',\n  category: 'Trigonometry',\n  syntax: [\n    'csch(x)'\n  ],\n  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',\n  examples: [\n    'csch(2)',\n    '1 / sinh(2)'\n  ],\n  seealso: [\n    'sech',\n    'coth',\n    'sinh'\n  ]\n}\n","export const secDocs = {\n  name: 'sec',\n  category: 'Trigonometry',\n  syntax: [\n    'sec(x)'\n  ],\n  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',\n  examples: [\n    'sec(2)',\n    '1 / cos(2)'\n  ],\n  seealso: [\n    'cot',\n    'csc',\n    'cos'\n  ]\n}\n","export const sechDocs = {\n  name: 'sech',\n  category: 'Trigonometry',\n  syntax: [\n    'sech(x)'\n  ],\n  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',\n  examples: [\n    'sech(2)',\n    '1 / cosh(2)'\n  ],\n  seealso: [\n    'coth',\n    'csch',\n    'cosh'\n  ]\n}\n","export const sinDocs = {\n  name: 'sin',\n  category: 'Trigonometry',\n  syntax: [\n    'sin(x)'\n  ],\n  description: 'Compute the sine of x in radians.',\n  examples: [\n    'sin(2)',\n    'sin(pi / 4) ^ 2',\n    'sin(90 deg)',\n    'sin(30 deg)',\n    'sin(0.2)^2 + cos(0.2)^2'\n  ],\n  seealso: [\n    'asin',\n    'cos',\n    'tan'\n  ]\n}\n","export const sinhDocs = {\n  name: 'sinh',\n  category: 'Trigonometry',\n  syntax: [\n    'sinh(x)'\n  ],\n  description: 'Compute the hyperbolic sine of x in radians.',\n  examples: [\n    'sinh(0.5)'\n  ],\n  seealso: [\n    'cosh',\n    'tanh'\n  ]\n}\n","export const tanDocs = {\n  name: 'tan',\n  category: 'Trigonometry',\n  syntax: [\n    'tan(x)'\n  ],\n  description: 'Compute the tangent of x in radians.',\n  examples: [\n    'tan(0.5)',\n    'sin(0.5) / cos(0.5)',\n    'tan(pi / 4)',\n    'tan(45 deg)'\n  ],\n  seealso: [\n    'atan',\n    'sin',\n    'cos'\n  ]\n}\n","export const tanhDocs = {\n  name: 'tanh',\n  category: 'Trigonometry',\n  syntax: [\n    'tanh(x)'\n  ],\n  description: 'Compute the hyperbolic tangent of x in radians.',\n  examples: [\n    'tanh(0.5)',\n    'sinh(0.5) / cosh(0.5)'\n  ],\n  seealso: [\n    'sinh',\n    'cosh'\n  ]\n}\n","export const toDocs = {\n  name: 'to',\n  category: 'Units',\n  syntax: [\n    'x to unit',\n    'to(x, unit)'\n  ],\n  description: 'Change the unit of a value.',\n  examples: [\n    '5 inch to cm',\n    '3.2kg to g',\n    '16 bytes in bits'\n  ],\n  seealso: []\n}\n","export const toBestDocs = {\n  name: 'toBest',\n  category: 'Units',\n  syntax: [\n    'toBest(x)',\n    'toBest(x, unitList)',\n    'toBest(x, unitList, options)'\n  ],\n  description: 'Converts to the most appropriate display unit.',\n  examples: [\n    'toBest(unit(5000, \"m\"))',\n    'toBest(unit(3500000, \"W\"))',\n    'toBest(unit(0.000000123, \"A\"))',\n    'toBest(unit(10, \"m\"), \"cm\")',\n    'toBest(unit(10, \"m\"), \"mm,km\", {offset: 1.5})'\n  ],\n  seealso: []\n}\n","export const cloneDocs = {\n  name: 'clone',\n  category: 'Utils',\n  syntax: [\n    'clone(x)'\n  ],\n  description: 'Clone a variable. Creates a copy of primitive variables, and a deep copy of matrices',\n  examples: [\n    'clone(3.5)',\n    'clone(2 - 4i)',\n    'clone(45 deg)',\n    'clone([1, 2; 3, 4])',\n    'clone(\"hello world\")'\n  ],\n  seealso: []\n}\n","export const formatDocs = {\n  name: 'format',\n  category: 'Utils',\n  syntax: [\n    'format(value)',\n    'format(value, precision)'\n  ],\n  description: 'Format a value of any type as string.',\n  examples: [\n    'format(2.3)',\n    'format(3 - 4i)',\n    'format([])',\n    'format(pi, 3)'\n  ],\n  seealso: ['print']\n}\n","export const binDocs = {\n  name: 'bin',\n  category: 'Utils',\n  syntax: [\n    'bin(value)'\n  ],\n  description: 'Format a number as binary',\n  examples: [\n    'bin(2)'\n  ],\n  seealso: ['oct', 'hex']\n}\n","export const octDocs = {\n  name: 'oct',\n  category: 'Utils',\n  syntax: [\n    'oct(value)'\n  ],\n  description: 'Format a number as octal',\n  examples: [\n    'oct(56)'\n  ],\n  seealso: ['bin', 'hex']\n}\n","export const hexDocs = {\n  name: 'hex',\n  category: 'Utils',\n  syntax: [\n    'hex(value)'\n  ],\n  description: 'Format a number as hexadecimal',\n  examples: [\n    'hex(240)'\n  ],\n  seealso: ['bin', 'oct']\n}\n","export const isNaNDocs = {\n  name: 'isNaN',\n  category: 'Utils',\n  syntax: [\n    'isNaN(x)'\n  ],\n  description: 'Test whether a value is NaN (not a number)',\n  examples: [\n    'isNaN(2)',\n    'isNaN(0 / 0)',\n    'isNaN(NaN)',\n    'isNaN(Infinity)'\n  ],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isIntegerDocs = {\n  name: 'isInteger',\n  category: 'Utils',\n  syntax: [\n    'isInteger(x)'\n  ],\n  description: 'Test whether a value is an integer number.',\n  examples: [\n    'isInteger(2)',\n    'isInteger(3.5)',\n    'isInteger([3, 0.5, -2])'\n  ],\n  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isNegativeDocs = {\n  name: 'isNegative',\n  category: 'Utils',\n  syntax: [\n    'isNegative(x)'\n  ],\n  description: 'Test whether a value is negative: smaller than zero.',\n  examples: [\n    'isNegative(2)',\n    'isNegative(0)',\n    'isNegative(-4)',\n    'isNegative([3, 0.5, -2])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']\n}\n","export const isNumericDocs = {\n  name: 'isNumeric',\n  category: 'Utils',\n  syntax: [\n    'isNumeric(x)'\n  ],\n  description: 'Test whether a value is a numeric value. ' +\n    'Returns true when the input is a number, BigNumber, Fraction, or boolean.',\n  examples: [\n    'isNumeric(2)',\n    'isNumeric(\"2\")',\n    'hasNumericValue(\"2\")',\n    'isNumeric(0)',\n    'isNumeric(bignumber(500))',\n    'isNumeric(fraction(0.125))',\n    'isNumeric(2 + 3i)',\n    'isNumeric([2.3, \"foo\", false])'\n  ],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']\n}\n","export const hasNumericValueDocs = {\n  name: 'hasNumericValue',\n  category: 'Utils',\n  syntax: [\n    'hasNumericValue(x)'\n  ],\n  description: 'Test whether a value is an numeric value. ' +\n    'In case of a string, true is returned if the string contains a numeric value.',\n  examples: [\n    'hasNumericValue(2)',\n    'hasNumericValue(\"2\")',\n    'isNumeric(\"2\")',\n    'hasNumericValue(0)',\n    'hasNumericValue(bignumber(500))',\n    'hasNumericValue(fraction(0.125))',\n    'hasNumericValue(2 + 3i)',\n    'hasNumericValue([2.3, \"foo\", false])'\n  ],\n  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']\n}\n","export const isPositiveDocs = {\n  name: 'isPositive',\n  category: 'Utils',\n  syntax: [\n    'isPositive(x)'\n  ],\n  description: 'Test whether a value is positive: larger than zero.',\n  examples: [\n    'isPositive(2)',\n    'isPositive(0)',\n    'isPositive(-4)',\n    'isPositive([3, 0.5, -2])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n}\n","export const isPrimeDocs = {\n  name: 'isPrime',\n  category: 'Utils',\n  syntax: [\n    'isPrime(x)'\n  ],\n  description: 'Test whether a value is prime: has no divisors other than itself and one.',\n  examples: [\n    'isPrime(3)',\n    'isPrime(-2)',\n    'isPrime([2, 17, 100])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']\n}\n","export const isZeroDocs = {\n  name: 'isZero',\n  category: 'Utils',\n  syntax: [\n    'isZero(x)'\n  ],\n  description: 'Test whether a value is zero.',\n  examples: [\n    'isZero(2)',\n    'isZero(0)',\n    'isZero(-4)',\n    'isZero([3, 0, -2, 0])'\n  ],\n  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']\n}\n","export const printDocs = {\n  name: 'print',\n  category: 'Utils',\n  syntax: [\n    'print(template, values)',\n    'print(template, values, precision)'\n  ],\n  description: 'Interpolate values into a string template.',\n  examples: [\n    'print(\"Lucy is $age years old\", {age: 5})',\n    'print(\"The value of pi is $pi\", {pi: pi}, 3)',\n    'print(\"Hello, $user.name!\", {user: {name: \"John\"}})',\n    'print(\"Values: $1, $2, $3\", [6, 9, 4])'\n  ],\n  seealso: ['format']\n}\n","export const typeOfDocs = {\n  name: 'typeOf',\n  category: 'Utils',\n  syntax: [\n    'typeOf(x)'\n  ],\n  description: 'Get the type of a variable.',\n  examples: [\n    'typeOf(3.5)',\n    'typeOf(2 - 4i)',\n    'typeOf(45 deg)',\n    'typeOf(\"hello world\")'\n  ],\n  seealso: ['getMatrixDataType']\n}\n","export const numericDocs = {\n  name: 'numeric',\n  category: 'Utils',\n  syntax: [\n    'numeric(x)'\n  ],\n  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.',\n  examples: [\n    'numeric(\"4\")',\n    'numeric(\"4\", \"number\")',\n    'numeric(\"4\", \"bigint\")',\n    'numeric(\"4\", \"BigNumber\")',\n    'numeric(\"4\", \"Fraction\")',\n    'numeric(4, \"Fraction\")',\n    'numeric(fraction(2, 5), \"number\")'\n  ],\n  seealso: ['number', 'bigint', 'fraction', 'bignumber', 'string', 'format']\n}\n","import { factory } from '../../utils/factory.js'\nimport { getSafeProperty } from '../../utils/customs.js'\nimport { embeddedDocs } from '../embeddedDocs/embeddedDocs.js'\nimport { hasOwnProperty } from '../../utils/object.js'\n\nconst name = 'help'\nconst dependencies = ['typed', 'mathWithTransform', 'Help']\n\nexport const createHelp = /* #__PURE__ */ factory(name, dependencies, ({ typed, mathWithTransform, Help }) => {\n  /**\n   * Retrieve help on a function or data type.\n   * Help files are retrieved from the embedded documentation in math.docs.\n   *\n   * Syntax:\n   *\n   *    math.help(search)\n   *\n   * Examples:\n   *\n   *    console.log(math.help('sin').toString())\n   *    console.log(math.help(math.add).toString())\n   *    console.log(math.help(math.add).toJSON())\n   *\n   * @param {Function | string | Object} search   A function or function name\n   *                                              for which to get help\n   * @return {Help} A help object\n   */\n  return typed(name, {\n    any: function (search) {\n      let prop\n      let searchName = search\n\n      if (typeof search !== 'string') {\n        for (prop in mathWithTransform) {\n          // search in functions and constants\n          if (hasOwnProperty(mathWithTransform, prop) && (search === mathWithTransform[prop])) {\n            searchName = prop\n            break\n          }\n        }\n\n        /* TODO: implement help for data types\n         if (!text) {\n         // search data type\n         for (prop in math.type) {\n         if (hasOwnProperty(math, prop)) {\n         if (search === math.type[prop]) {\n         text = prop\n         break\n         }\n         }\n         }\n         }\n         */\n      }\n\n      const doc = getSafeProperty(embeddedDocs, searchName)\n      if (!doc) {\n        const searchText = typeof searchName === 'function' ? searchName.name : searchName\n        throw new Error('No documentation found on \"' + searchText + '\"')\n      }\n      return new Help(doc)\n    }\n  })\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'chain'\nconst dependencies = ['typed', 'Chain']\n\nexport const createChain = /* #__PURE__ */ factory(name, dependencies, ({ typed, Chain }) => {\n  /**\n   * Wrap any value in a chain, allowing to perform chained operations on\n   * the value.\n   *\n   * All methods available in the math.js library can be called upon the chain,\n   * and then will be evaluated with the value itself as first argument.\n   * The chain can be closed by executing `chain.done()`, which returns\n   * the final value.\n   *\n   * The chain has a number of special functions:\n   *\n   * - `done()`     Finalize the chain and return the chain's value.\n   * - `valueOf()`  The same as `done()`\n   * - `toString()` Executes `math.format()` onto the chain's value, returning\n   *                a string representation of the value.\n   *\n   * Syntax:\n   *\n   *    math.chain(value)\n   *\n   * Examples:\n   *\n   *     math.chain(3)\n   *         .add(4)\n   *         .subtract(2)\n   *         .done()     // 5\n   *\n   *     math.chain( [[1, 2], [3, 4]] )\n   *         .subset(math.index(0, 0), 8)\n   *         .multiply(3)\n   *         .done()     // [[24, 6], [9, 12]]\n   *\n   * @param {*} [value]   A value of any type on which to start a chained operation.\n   * @return {math.Chain} The created chain\n   */\n  return typed(name, {\n    '': function () {\n      return new Chain()\n    },\n\n    any: function (value) {\n      return new Chain(value)\n    }\n  })\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { clone } from '../../utils/object.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'det'\nconst dependencies = ['typed', 'matrix', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus']\n\nexport const createDet = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtractScalar, multiply, divideScalar, isZero, unaryMinus }) => {\n  /**\n   * Calculate the determinant of a matrix.\n   *\n   * Syntax:\n   *\n   *    math.det(x)\n   *\n   * Examples:\n   *\n   *    math.det([[1, 2], [3, 4]]) // returns -2\n   *\n   *    const A = [\n   *      [-2, 2, 3],\n   *      [-1, 1, 3],\n   *      [2, 0, -1]\n   *    ]\n   *    math.det(A) // returns 6\n   *\n   * See also:\n   *\n   *    inv\n   *\n   * @param {Array | Matrix} x  A matrix\n   * @return {number} The determinant of `x`\n   */\n  return typed(name, {\n    any: function (x) {\n      return clone(x)\n    },\n\n    'Array | Matrix': function det (x) {\n      let size\n      if (isMatrix(x)) {\n        size = x.size()\n      } else if (Array.isArray(x)) {\n        x = matrix(x)\n        size = x.size()\n      } else {\n        // a scalar\n        size = []\n      }\n\n      switch (size.length) {\n        case 0:\n          // scalar\n          return clone(x)\n\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            return clone(x.valueOf()[0])\n          } if (size[0] === 0) {\n            return 1 // det of an empty matrix is per definition 1\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        {\n          // two-dimensional array\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            return _det(x.clone().valueOf(), rows, cols)\n          } if (cols === 0) {\n            return 1 // det of an empty matrix is per definition 1\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    }\n  })\n\n  /**\n   * Calculate the determinant of a matrix\n   * @param {Array[]} matrix  A square, two dimensional matrix\n   * @param {number} rows     Number of rows of the matrix (zero-based)\n   * @param {number} cols     Number of columns of the matrix (zero-based)\n   * @returns {number} det\n   * @private\n   */\n  function _det (matrix, rows, cols) {\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      return clone(matrix[0][0])\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12\n      return subtractScalar(\n        multiply(matrix[0][0], matrix[1][1]),\n        multiply(matrix[1][0], matrix[0][1])\n      )\n    } else {\n      // Bareiss algorithm\n      // this algorithm have same complexity as LUP decomposition (O(n^3))\n      // but it preserve precision of floating point more relative to the LUP decomposition\n      let negated = false\n      const rowIndices = new Array(rows).fill(0).map((_, i) => i) // matrix index of row i\n      for (let k = 0; k < rows; k++) {\n        let k_ = rowIndices[k]\n        if (isZero(matrix[k_][k])) {\n          let _k\n          for (_k = k + 1; _k < rows; _k++) {\n            if (!isZero(matrix[rowIndices[_k]][k])) {\n              k_ = rowIndices[_k]\n              rowIndices[_k] = rowIndices[k]\n              rowIndices[k] = k_\n              negated = !negated\n              break\n            }\n          }\n          if (_k === rows) return matrix[k_][k] // some zero of the type\n        }\n        const piv = matrix[k_][k]\n        const piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1]\n        for (let i = k + 1; i < rows; i++) {\n          const i_ = rowIndices[i]\n          for (let j = k + 1; j < rows; j++) {\n            matrix[i_][j] = divideScalar(subtractScalar(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_)\n          }\n        }\n      }\n      const det = matrix[rowIndices[rows - 1]][rows - 1]\n      return negated ? unaryMinus(det) : det\n    }\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { format } from '../../utils/string.js'\n\nconst name = 'inv'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'divideScalar',\n  'addScalar',\n  'multiply',\n  'unaryMinus',\n  'det',\n  'identity',\n  'abs'\n]\n\nexport const createInv = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divideScalar, addScalar, multiply, unaryMinus, det, identity, abs }) => {\n  /**\n   * Calculate the inverse of a square matrix.\n   *\n   * Syntax:\n   *\n   *     math.inv(x)\n   *\n   * Examples:\n   *\n   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]\n   *     math.inv(4)                 // returns 0.25\n   *     1 / 4                       // returns 0.25\n   *\n   * See also:\n   *\n   *     det, transpose\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n  return typed(name, {\n    'Array | Matrix': function (x) {\n      const size = isMatrix(x) ? x.size() : arraySize(x)\n      switch (size.length) {\n        case 1:\n          // vector\n          if (size[0] === 1) {\n            if (isMatrix(x)) {\n              return matrix([\n                divideScalar(1, x.valueOf()[0])\n              ])\n            } else {\n              return [\n                divideScalar(1, x[0])\n              ]\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        // two dimensional array\n        {\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            if (isMatrix(x)) {\n              return matrix(\n                _inv(x.valueOf(), rows, cols),\n                x.storage()\n              )\n            } else {\n              // return an Array\n              return _inv(x, rows, cols)\n            }\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    },\n\n    any: function (x) {\n      // scalar\n      return divideScalar(1, x) // FIXME: create a BigNumber one when configured for bignumbers\n    }\n  })\n\n  /**\n   * Calculate the inverse of a square matrix\n   * @param {Array[]} mat     A square matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns, must equal rows\n   * @return {Array[]} inv    Inverse matrix\n   * @private\n   */\n  function _inv (mat, rows, cols) {\n    let r, s, f, value, temp\n\n    if (rows === 1) {\n      // this is a 1 x 1 matrix\n      value = mat[0][0]\n      if (value === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero')\n      }\n      return [[\n        divideScalar(1, value)\n      ]]\n    } else if (rows === 2) {\n      // this is a 2 x 2 matrix\n      const d = det(mat)\n      if (d === 0) {\n        throw Error('Cannot calculate inverse, determinant is zero')\n      }\n      return [\n        [\n          divideScalar(mat[1][1], d),\n          divideScalar(unaryMinus(mat[0][1]), d)\n        ],\n        [\n          divideScalar(unaryMinus(mat[1][0]), d),\n          divideScalar(mat[0][0], d)\n        ]\n      ]\n    } else {\n      // this is a matrix of 3 x 3 or larger\n      // calculate inverse using gauss-jordan elimination\n      //      https://en.wikipedia.org/wiki/Gaussian_elimination\n      //      http://mathworld.wolfram.com/MatrixInverse.html\n      //      http://math.uww.edu/~mcfarlat/inverse.htm\n\n      // make a copy of the matrix (only the arrays, not of the elements)\n      const A = mat.concat()\n      for (r = 0; r < rows; r++) {\n        A[r] = A[r].concat()\n      }\n\n      // create an identity matrix which in the end will contain the\n      // matrix inverse\n      const B = identity(rows).valueOf()\n\n      // loop over all columns, and perform row reductions\n      for (let c = 0; c < cols; c++) {\n        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]\n        let ABig = abs(A[c][c])\n        let rBig = c\n        r = c + 1\n        while (r < rows) {\n          if (abs(A[r][c]) > ABig) {\n            ABig = abs(A[r][c])\n            rBig = r\n          }\n          r++\n        }\n        if (ABig === 0) {\n          throw Error('Cannot calculate inverse, determinant is zero')\n        }\n        r = rBig\n        if (r !== c) {\n          temp = A[c]; A[c] = A[r]; A[r] = temp\n          temp = B[c]; B[c] = B[r]; B[r] = temp\n        }\n\n        // eliminate non-zero values on the other rows at column c\n        const Ac = A[c]\n        const Bc = B[c]\n        for (r = 0; r < rows; r++) {\n          const Ar = A[r]\n          const Br = B[r]\n          if (r !== c) {\n            // eliminate value at column c and row r\n            if (Ar[c] !== 0) {\n              f = divideScalar(unaryMinus(Ar[c]), Ac[c])\n\n              // add (f * row c) to row r to eliminate the value\n              // at column c\n              for (s = c; s < cols; s++) {\n                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]))\n              }\n              for (s = 0; s < cols; s++) {\n                Br[s] = addScalar(Br[s], multiply(f, Bc[s]))\n              }\n            }\n          } else {\n            // normalize value at Acc to 1,\n            // divide each value on row r with the value at Acc\n            f = Ac[c]\n            for (s = c; s < cols; s++) {\n              Ar[s] = divideScalar(Ar[s], f)\n            }\n            for (s = 0; s < cols; s++) {\n              Br[s] = divideScalar(Br[s], f)\n            }\n          }\n        }\n      }\n      return B\n    }\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { format } from '../../utils/string.js'\nimport { clone } from '../../utils/object.js'\n\nconst name = 'pinv'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'inv',\n  'deepEqual',\n  'equal',\n  'dotDivide',\n  'dot',\n  'ctranspose',\n  'divideScalar',\n  'multiply',\n  'add',\n  'Complex'\n]\n\nexport const createPinv = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  matrix,\n  inv,\n  deepEqual,\n  equal,\n  dotDivide,\n  dot,\n  ctranspose,\n  divideScalar,\n  multiply,\n  add,\n  Complex\n}) => {\n  /**\n   * Calculate the Moore–Penrose inverse of a matrix.\n   *\n   * Syntax:\n   *\n   *     math.pinv(x)\n   *\n   * Examples:\n   *\n   *     math.pinv([[1, 2], [3, 4]])          // returns [[-2, 1], [1.5, -0.5]]\n   *     math.pinv([[1, 0], [0, 1], [0, 1]])  // returns [[1, 0, 0], [0, 0.5, 0.5]]\n   *     math.pinv(4)                         // returns 0.25\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed\n   * @return {number | Complex | Array | Matrix} The inverse of `x`.\n   */\n  return typed(name, {\n    'Array | Matrix': function (x) {\n      const size = isMatrix(x) ? x.size() : arraySize(x)\n      switch (size.length) {\n        case 1:\n          // vector\n          if (_isZeros(x)) return ctranspose(x) // null vector\n          if (size[0] === 1) {\n            return inv(x) // invertible matrix\n          } else {\n            return dotDivide(ctranspose(x), dot(x, x))\n          }\n\n        case 2:\n        // two dimensional array\n        {\n          if (_isZeros(x)) return ctranspose(x) // zero matrixx\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            try {\n              return inv(x) // invertible matrix\n            } catch (err) {\n              if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {\n                // Expected\n              } else {\n                throw err\n              }\n            }\n          }\n          if (isMatrix(x)) {\n            return matrix(\n              _pinv(x.valueOf(), rows, cols),\n              x.storage()\n            )\n          } else {\n            // return an Array\n            return _pinv(x, rows, cols)\n          }\n        }\n\n        default:\n          // multi dimensional array\n          throw new RangeError('Matrix must be two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    },\n\n    any: function (x) {\n      // scalar\n      if (equal(x, 0)) return clone(x) // zero\n      return divideScalar(1, x)\n    }\n  })\n\n  /**\n   * Calculate the Moore–Penrose inverse of a matrix\n   * @param {Array[]} mat     A matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns\n   * @return {Array[]} pinv    Pseudoinverse matrix\n   * @private\n   */\n  function _pinv (mat, rows, cols) {\n    const { C, F } = _rankFact(mat, rows, cols) // TODO: Use SVD instead (may improve precision)\n    const Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C))\n    const Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))))\n    return multiply(Fpinv, Cpinv)\n  }\n\n  /**\n   * Calculate the reduced row echelon form of a matrix\n   *\n   * Modified from https://rosettacode.org/wiki/Reduced_row_echelon_form\n   *\n   * @param {Array[]} mat     A matrix\n   * @param {number} rows     Number of rows\n   * @param {number} cols     Number of columns\n   * @return {Array[]}        Reduced row echelon form\n   * @private\n   */\n  function _rref (mat, rows, cols) {\n    const M = clone(mat)\n    let lead = 0\n    for (let r = 0; r < rows; r++) {\n      if (cols <= lead) {\n        return M\n      }\n      let i = r\n      while (_isZero(M[i][lead])) {\n        i++\n        if (rows === i) {\n          i = r\n          lead++\n          if (cols === lead) {\n            return M\n          }\n        }\n      }\n\n      [M[i], M[r]] = [M[r], M[i]]\n\n      let val = M[r][lead]\n      for (let j = 0; j < cols; j++) {\n        M[r][j] = dotDivide(M[r][j], val)\n      }\n\n      for (let i = 0; i < rows; i++) {\n        if (i === r) continue\n        val = M[i][lead]\n        for (let j = 0; j < cols; j++) {\n          M[i][j] = add(M[i][j], multiply(-1, multiply(val, M[r][j])))\n        }\n      }\n      lead++\n    }\n    return M\n  }\n\n  /**\n   * Calculate the rank factorization of a matrix\n   *\n   * @param {Array[]} mat                  A matrix (M)\n   * @param {number} rows                  Number of rows\n   * @param {number} cols                  Number of columns\n   * @return {{C: Array, F: Array}}        rank factorization where M = C F\n   * @private\n   */\n  function _rankFact (mat, rows, cols) {\n    const rref = _rref(mat, rows, cols)\n    const C = mat.map((_, i) => _.filter((_, j) => j < rows && !_isZero(dot(rref[j], rref[j]))))\n    const F = rref.filter((_, i) => !_isZero(dot(rref[i], rref[i])))\n    return { C, F }\n  }\n\n  function _isZero (x) {\n    return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)))\n  }\n\n  function _isZeros (arr) {\n    return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)))\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { format } from '../../utils/string.js'\nimport { createComplexEigs } from './eigs/complexEigs.js'\nimport { createRealSymmetric } from './eigs/realSymmetric.js'\nimport { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js'\n\nconst name = 'eigs'\n\n// The absolute state of math.js's dependency system:\nconst dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot']\nexport const createEigs = /* #__PURE__ */ factory(name, dependencies, ({ config, typed, matrix, addScalar, subtract, equal, abs, atan, cos, sin, multiplyScalar, divideScalar, inv, bignumber, multiply, add, larger, column, flatten, number, complex, sqrt, diag, size, reshape, qr, usolve, usolveAll, im, re, smaller, matrixFromColumns, dot }) => {\n  const doRealSymmetric = createRealSymmetric({ config, addScalar, subtract, column, flatten, equal, abs, atan, cos, sin, multiplyScalar, inv, bignumber, complex, multiply, add })\n  const doComplexEigs = createComplexEigs({ config, addScalar, subtract, multiply, multiplyScalar, flatten, divideScalar, sqrt, abs, bignumber, diag, size, reshape, qr, inv, usolve, usolveAll, equal, complex, larger, smaller, matrixFromColumns, dot })\n\n  /**\n   * Compute eigenvalues and optionally eigenvectors of a square matrix.\n   * The eigenvalues are sorted by their absolute value, ascending, and\n   * returned as a vector in the `values` property of the returned project.\n   * An eigenvalue with algebraic multiplicity k will be listed k times, so\n   * that the returned `values` vector always has length equal to the size\n   * of the input matrix.\n   *\n   * The `eigenvectors` property of the return value provides the eigenvectors.\n   * It is an array of plain objects: the `value` property of each gives the\n   * associated eigenvalue, and the `vector` property gives the eigenvector\n   * itself. Note that the same `value` property will occur as many times in\n   * the list provided by `eigenvectors` as the geometric multiplicity of\n   * that value.\n   *\n   * If the algorithm fails to converge, it will throw an error –\n   * in that case, however, you may still find useful information\n   * in `err.values` and `err.vectors`.\n   *\n   * Note that the 'precision' option does not directly specify the _accuracy_\n   * of the returned eigenvalues. Rather, it determines how small an entry\n   * of the iterative approximations to an upper triangular matrix must be\n   * in order to be considered zero. The actual accuracy of the returned\n   * eigenvalues may be greater or less than the precision, depending on the\n   * conditioning of the matrix and how far apart or close the actual\n   * eigenvalues are. Note that currently, relatively simple, \"traditional\"\n   * methods of eigenvalue computation are being used; this is not a modern,\n   * high-precision eigenvalue computation. That said, it should typically\n   * produce fairly reasonable results.\n   *\n   * Syntax:\n   *\n   *     math.eigs(x, [prec])\n   *     math.eigs(x, {options})\n   *\n   * Examples:\n   *\n   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math\n   *     const H = [[5, 2.3], [2.3, 1]]\n   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]\n   *     const E = ans.values\n   *     const V = ans.eigenvectors\n   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))\n   *     const U = matrixFromColumns(...V.map(obj => obj.vector))\n   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible\n   *     E[0] == UTxHxU[0][0]  // returns true always\n   *\n   *     // Compute only approximate eigenvalues:\n   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})\n   *\n   * See also:\n   *\n   *     inv\n   *\n   * @param {Array | Matrix} x  Matrix to be diagonalized\n   *\n   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.relTol, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.\n   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.\n   *\n   */\n  return typed('eigs', {\n\n    // The conversion to matrix in the first two implementations,\n    // just to convert back to an array right away in\n    // computeValuesAndVectors, is unfortunate, and should perhaps be\n    // streamlined. It is done because the Matrix object carries some\n    // type information about its entries, and so constructing the matrix\n    // is a roundabout way of doing type detection.\n    Array: function (x) { return doEigs(matrix(x)) },\n    'Array, number|BigNumber': function (x, prec) {\n      return doEigs(matrix(x), { precision: prec })\n    },\n    'Array, Object' (x, opts) { return doEigs(matrix(x), opts) },\n    Matrix: function (mat) {\n      return doEigs(mat, { matricize: true })\n    },\n    'Matrix, number|BigNumber': function (mat, prec) {\n      return doEigs(mat, { precision: prec, matricize: true })\n    },\n    'Matrix, Object': function (mat, opts) {\n      const useOpts = { matricize: true }\n      Object.assign(useOpts, opts)\n      return doEigs(mat, useOpts)\n    }\n  })\n\n  function doEigs (mat, opts = {}) {\n    const computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true\n    const prec = opts.precision ?? config.relTol\n    const result = computeValuesAndVectors(mat, prec, computeVectors)\n    if (opts.matricize) {\n      result.values = matrix(result.values)\n      if (computeVectors) {\n        result.eigenvectors = result.eigenvectors.map(({ value, vector }) =>\n          ({ value, vector: matrix(vector) }))\n      }\n    }\n    if (computeVectors) {\n      Object.defineProperty(result, 'vectors', {\n        enumerable: false, // to make sure that the eigenvectors can still be\n        // converted to string.\n        get: () => {\n          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors')\n        }\n      })\n    }\n    return result\n  }\n\n  function computeValuesAndVectors (mat, prec, computeVectors) {\n    const arr = mat.toArray() // NOTE: arr is guaranteed to be unaliased\n    // and so safe to modify in place\n    const asize = mat.size()\n\n    if (asize.length !== 2 || asize[0] !== asize[1]) {\n      throw new RangeError(`Matrix must be square (size: ${format(asize)})`)\n    }\n\n    const N = asize[0]\n\n    if (isReal(arr, N, prec)) {\n      coerceReal(arr, N) // modifies arr by side effect\n\n      if (isSymmetric(arr, N, prec)) {\n        const type = coerceTypes(mat, arr, N) // modifies arr by side effect\n        return doRealSymmetric(arr, N, prec, type, computeVectors)\n      }\n    }\n\n    const type = coerceTypes(mat, arr, N) // modifies arr by side effect\n    return doComplexEigs(arr, N, prec, type, computeVectors)\n  }\n\n  /** @return {boolean} */\n  function isSymmetric (arr, N, prec) {\n    for (let i = 0; i < N; i++) {\n      for (let j = i; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {\n          return false\n        }\n      }\n    }\n\n    return true\n  }\n\n  /** @return {boolean} */\n  function isReal (arr, N, prec) {\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        // TODO proper comparison of bignum and frac\n        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {\n          return false\n        }\n      }\n    }\n\n    return true\n  }\n\n  function coerceReal (arr, N) {\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        arr[i][j] = re(arr[i][j])\n      }\n    }\n  }\n\n  /** @return {'number' | 'BigNumber' | 'Complex'} */\n  function coerceTypes (mat, arr, N) {\n    /** @type {string} */\n    const type = mat.datatype()\n\n    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {\n      return type\n    }\n\n    let hasNumber = false\n    let hasBig = false\n    let hasComplex = false\n\n    for (let i = 0; i < N; i++) {\n      for (let j = 0; j < N; j++) {\n        const el = arr[i][j]\n\n        if (isNumber(el) || isFraction(el)) {\n          hasNumber = true\n        } else if (isBigNumber(el)) {\n          hasBig = true\n        } else if (isComplex(el)) {\n          hasComplex = true\n        } else {\n          throw TypeError('Unsupported type in Matrix: ' + typeOf(el))\n        }\n      }\n    }\n\n    if (hasBig && hasComplex) {\n      console.warn('Complex BigNumbers not supported, this operation will lose precission.')\n    }\n\n    if (hasComplex) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = complex(arr[i][j])\n        }\n      }\n\n      return 'Complex'\n    }\n\n    if (hasBig) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = bignumber(arr[i][j])\n        }\n      }\n\n      return 'BigNumber'\n    }\n\n    if (hasNumber) {\n      for (let i = 0; i < N; i++) {\n        for (let j = 0; j < N; j++) {\n          arr[i][j] = number(arr[i][j])\n        }\n      }\n\n      return 'number'\n    } else {\n      throw TypeError('Matrix contains unsupported types only.')\n    }\n  }\n})\n","import { clone } from '../../../utils/object.js'\n\nexport function createRealSymmetric ({ config, addScalar, subtract, abs, atan, cos, sin, multiplyScalar, inv, bignumber, multiply, add }) {\n  /**\n   * @param {number[] | BigNumber[]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number' | 'BigNumber'} type\n   */\n  function main (arr, N, prec = config.relTol, type, computeVectors) {\n    if (type === 'number') {\n      return diag(arr, prec, computeVectors)\n    }\n\n    if (type === 'BigNumber') {\n      return diagBig(arr, prec, computeVectors)\n    }\n\n    throw TypeError('Unsupported data type: ' + type)\n  }\n\n  // diagonalization implementation for number (efficient)\n  function diag (x, precision, computeVectors) {\n    const N = x.length\n    const e0 = Math.abs(precision / N)\n    let psi\n    let Sij\n    if (computeVectors) {\n      Sij = new Array(N)\n      // Sij is Identity Matrix\n      for (let i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0)\n        Sij[i][i] = 1.0\n      }\n    }\n    // initial error\n    let Vab = getAij(x)\n    while (Math.abs(Vab[1]) >= Math.abs(e0)) {\n      const i = Vab[0][0]\n      const j = Vab[0][1]\n      psi = getTheta(x[i][i], x[j][j], x[i][j])\n      x = x1(x, psi, i, j)\n      if (computeVectors) Sij = Sij1(Sij, psi, i, j)\n      Vab = getAij(x)\n    }\n    const Ei = Array(N).fill(0) // eigenvalues\n    for (let i = 0; i < N; i++) {\n      Ei[i] = x[i][i]\n    }\n    return sorting(clone(Ei), Sij, computeVectors)\n  }\n\n  // diagonalization implementation for bigNumber\n  function diagBig (x, precision, computeVectors) {\n    const N = x.length\n    const e0 = abs(precision / N)\n    let psi\n    let Sij\n    if (computeVectors) {\n      Sij = new Array(N)\n      // Sij is Identity Matrix\n      for (let i = 0; i < N; i++) {\n        Sij[i] = Array(N).fill(0)\n        Sij[i][i] = 1.0\n      }\n    }\n    // initial error\n    let Vab = getAijBig(x)\n    while (abs(Vab[1]) >= abs(e0)) {\n      const i = Vab[0][0]\n      const j = Vab[0][1]\n      psi = getThetaBig(x[i][i], x[j][j], x[i][j])\n      x = x1Big(x, psi, i, j)\n      if (computeVectors) Sij = Sij1Big(Sij, psi, i, j)\n      Vab = getAijBig(x)\n    }\n    const Ei = Array(N).fill(0) // eigenvalues\n    for (let i = 0; i < N; i++) {\n      Ei[i] = x[i][i]\n    }\n    // return [clone(Ei), clone(Sij)]\n    return sorting(clone(Ei), Sij, computeVectors)\n  }\n\n  // get angle\n  function getTheta (aii, ajj, aij) {\n    const denom = (ajj - aii)\n    if (Math.abs(denom) <= config.relTol) {\n      return Math.PI / 4.0\n    } else {\n      return 0.5 * Math.atan(2.0 * aij / (ajj - aii))\n    }\n  }\n\n  // get angle\n  function getThetaBig (aii, ajj, aij) {\n    const denom = subtract(ajj, aii)\n    if (abs(denom) <= config.relTol) {\n      return bignumber(-1).acos().div(4)\n    } else {\n      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))))\n    }\n  }\n\n  // update eigvec\n  function Sij1 (Sij, theta, i, j) {\n    const N = Sij.length\n    const c = Math.cos(theta)\n    const s = Math.sin(theta)\n    const Ski = Array(N).fill(0)\n    const Skj = Array(N).fill(0)\n    for (let k = 0; k < N; k++) {\n      Ski[k] = c * Sij[k][i] - s * Sij[k][j]\n      Skj[k] = s * Sij[k][i] + c * Sij[k][j]\n    }\n    for (let k = 0; k < N; k++) {\n      Sij[k][i] = Ski[k]\n      Sij[k][j] = Skj[k]\n    }\n    return Sij\n  }\n  // update eigvec for overlap\n  function Sij1Big (Sij, theta, i, j) {\n    const N = Sij.length\n    const c = cos(theta)\n    const s = sin(theta)\n    const Ski = Array(N).fill(bignumber(0))\n    const Skj = Array(N).fill(bignumber(0))\n    for (let k = 0; k < N; k++) {\n      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]))\n      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]))\n    }\n    for (let k = 0; k < N; k++) {\n      Sij[k][i] = Ski[k]\n      Sij[k][j] = Skj[k]\n    }\n    return Sij\n  }\n\n  // update matrix\n  function x1Big (Hij, theta, i, j) {\n    const N = Hij.length\n    const c = bignumber(cos(theta))\n    const s = bignumber(sin(theta))\n    const c2 = multiplyScalar(c, c)\n    const s2 = multiplyScalar(s, s)\n    const Aki = Array(N).fill(bignumber(0))\n    const Akj = Array(N).fill(bignumber(0))\n    // 2cs Hij\n    const csHij = multiply(bignumber(2), c, s, Hij[i][j])\n    //  Aii\n    const Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]))\n    const Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]))\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]))\n      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]))\n    }\n    // Modify Hij\n    Hij[i][i] = Aii\n    Hij[j][j] = Ajj\n    Hij[i][j] = bignumber(0)\n    Hij[j][i] = bignumber(0)\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      if (k !== i && k !== j) {\n        Hij[i][k] = Aki[k]\n        Hij[k][i] = Aki[k]\n        Hij[j][k] = Akj[k]\n        Hij[k][j] = Akj[k]\n      }\n    }\n    return Hij\n  }\n\n  // update matrix\n  function x1 (Hij, theta, i, j) {\n    const N = Hij.length\n    const c = Math.cos(theta)\n    const s = Math.sin(theta)\n    const c2 = c * c\n    const s2 = s * s\n    const Aki = Array(N).fill(0)\n    const Akj = Array(N).fill(0)\n    //  Aii\n    const Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j]\n    const Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j]\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      Aki[k] = c * Hij[i][k] - s * Hij[j][k]\n      Akj[k] = s * Hij[i][k] + c * Hij[j][k]\n    }\n    // Modify Hij\n    Hij[i][i] = Aii\n    Hij[j][j] = Ajj\n    Hij[i][j] = 0\n    Hij[j][i] = 0\n    // 0  to i\n    for (let k = 0; k < N; k++) {\n      if (k !== i && k !== j) {\n        Hij[i][k] = Aki[k]\n        Hij[k][i] = Aki[k]\n        Hij[j][k] = Akj[k]\n        Hij[k][j] = Akj[k]\n      }\n    }\n    return Hij\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAij (Mij) {\n    const N = Mij.length\n    let maxMij = 0\n    let maxIJ = [0, 1]\n    for (let i = 0; i < N; i++) {\n      for (let j = i + 1; j < N; j++) {\n        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {\n          maxMij = Math.abs(Mij[i][j])\n          maxIJ = [i, j]\n        }\n      }\n    }\n    return [maxIJ, maxMij]\n  }\n\n  // get max off-diagonal value from Upper Diagonal\n  function getAijBig (Mij) {\n    const N = Mij.length\n    let maxMij = 0\n    let maxIJ = [0, 1]\n    for (let i = 0; i < N; i++) {\n      for (let j = i + 1; j < N; j++) {\n        if (abs(maxMij) < abs(Mij[i][j])) {\n          maxMij = abs(Mij[i][j])\n          maxIJ = [i, j]\n        }\n      }\n    }\n    return [maxIJ, maxMij]\n  }\n\n  // sort results\n  function sorting (E, S, computeVectors) {\n    const N = E.length\n    const values = Array(N)\n    let vecs\n    if (computeVectors) {\n      vecs = Array(N)\n      for (let k = 0; k < N; k++) {\n        vecs[k] = Array(N)\n      }\n    }\n    for (let i = 0; i < N; i++) {\n      let minID = 0\n      let minE = E[0]\n      for (let j = 0; j < E.length; j++) {\n        if (abs(E[j]) < abs(minE)) {\n          minID = j\n          minE = E[minID]\n        }\n      }\n      values[i] = E.splice(minID, 1)[0]\n      if (computeVectors) {\n        for (let k = 0; k < N; k++) {\n          vecs[i][k] = S[k][minID]\n          S[k].splice(minID, 1)\n        }\n      }\n    }\n    if (!computeVectors) return { values }\n    const eigenvectors = vecs.map((vector, i) => ({ value: values[i], vector }))\n    return { values, eigenvectors }\n  }\n\n  return main\n}\n","import { clone } from '../../../utils/object.js'\n\nexport function createComplexEigs ({ addScalar, subtract, flatten, multiply, multiplyScalar, divideScalar, sqrt, abs, bignumber, diag, size, reshape, inv, qr, usolve, usolveAll, equal, complex, larger, smaller, matrixFromColumns, dot }) {\n  /**\n   * @param {number[][]} arr the matrix to find eigenvalues of\n   * @param {number} N size of the matrix\n   * @param {number|BigNumber} prec precision, anything lower will be considered zero\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors should we find eigenvectors?\n   *\n   * @returns {{ values: number[], vectors: number[][] }}\n   */\n  function complexEigs (arr, N, prec, type, findVectors = true) {\n    // TODO check if any row/col are zero except the diagonal\n\n    // make sure corresponding rows and columns have similar magnitude\n    // important because of numerical stability\n    // MODIFIES arr by side effect!\n    const R = balance(arr, N, prec, type, findVectors)\n\n    // R is the row transformation matrix\n    // arr = A' = R A R^-1, A is the original matrix\n    // (if findVectors is false, R is undefined)\n    // (And so to return to original matrix: A = R^-1 arr R)\n\n    // TODO if magnitudes of elements vary over many orders,\n    // move greatest elements to the top left corner\n\n    // using similarity transformations, reduce the matrix\n    // to Hessenberg form (upper triangular plus one subdiagonal row)\n    // updates the transformation matrix R with new row operationsq\n    // MODIFIES arr by side effect!\n    reduceToHessenberg(arr, N, prec, type, findVectors, R)\n    // still true that original A = R^-1 arr R)\n\n    // find eigenvalues\n    const { values, C } = iterateUntilTriangular(arr, N, prec, type, findVectors)\n\n    // values is the list of eigenvalues, C is the column\n    // transformation matrix that transforms arr, the hessenberg\n    // matrix, to upper triangular\n    // (So U = C^-1 arr C and the relationship between current arr\n    // and original A is unchanged.)\n\n    if (findVectors) {\n      const eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type)\n      return { values, eigenvectors }\n    }\n\n    return { values }\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]}\n   */\n  function balance (arr, N, prec, type, findVectors) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const realzero = big ? bignumber(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n    const realone = big ? bignumber(1) : 1\n\n    // base of the floating-point arithmetic\n    const radix = big ? bignumber(10) : 2\n    const radixSq = multiplyScalar(radix, radix)\n\n    // the diagonal transformation matrix R\n    let Rdiag\n    if (findVectors) {\n      Rdiag = Array(N).fill(one)\n    }\n\n    // this isn't the only time we loop thru the matrix...\n    let last = false\n\n    while (!last) {\n      // ...haha I'm joking! unless...\n      last = true\n\n      for (let i = 0; i < N; i++) {\n        // compute the taxicab norm of i-th column and row\n        // TODO optimize for complex numbers\n        let colNorm = realzero\n        let rowNorm = realzero\n\n        for (let j = 0; j < N; j++) {\n          if (i === j) continue\n          colNorm = addScalar(colNorm, abs(arr[j][i]))\n          rowNorm = addScalar(rowNorm, abs(arr[i][j]))\n        }\n\n        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {\n          // find integer power closest to balancing the matrix\n          // (we want to scale only by integer powers of radix,\n          // so that we don't lose any precision due to round-off)\n\n          let f = realone\n          let c = colNorm\n\n          const rowDivRadix = divideScalar(rowNorm, radix)\n          const rowMulRadix = multiplyScalar(rowNorm, radix)\n\n          while (smaller(c, rowDivRadix)) {\n            c = multiplyScalar(c, radixSq)\n            f = multiplyScalar(f, radix)\n          }\n          while (larger(c, rowMulRadix)) {\n            c = divideScalar(c, radixSq)\n            f = divideScalar(f, radix)\n          }\n\n          // check whether balancing is needed\n          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)\n          const condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95))\n\n          // apply balancing similarity transformation\n          if (condition) {\n            // we should loop once again to check whether\n            // another rebalancing is needed\n            last = false\n\n            const g = divideScalar(1, f)\n\n            for (let j = 0; j < N; j++) {\n              if (i === j) {\n                continue\n              }\n              arr[i][j] = multiplyScalar(arr[i][j], g)\n              arr[j][i] = multiplyScalar(arr[j][i], f)\n            }\n\n            // keep track of transformations\n            if (findVectors) {\n              Rdiag[i] = multiplyScalar(Rdiag[i], g)\n            }\n          }\n        }\n      }\n    }\n\n    // return the diagonal row transformation matrix\n    return findVectors ? diag(Rdiag) : null\n  }\n\n  /**\n   * @param {number[][]} arr\n   * @param {number} N\n   * @param {number} prec\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @param {boolean} findVectors\n   * @param {number[][]} R the row transformation matrix that will be modified\n   */\n  function reduceToHessenberg (arr, N, prec, type, findVectors, R) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n\n    if (big) { prec = bignumber(prec) }\n\n    for (let i = 0; i < N - 2; i++) {\n      // Find the largest subdiag element in the i-th col\n\n      let maxIndex = 0\n      let max = zero\n\n      for (let j = i + 1; j < N; j++) {\n        const el = arr[j][i]\n        if (smaller(abs(max), abs(el))) {\n          max = el\n          maxIndex = j\n        }\n      }\n\n      // This col is pivoted, no need to do anything\n      if (smaller(abs(max), prec)) {\n        continue\n      }\n\n      if (maxIndex !== i + 1) {\n        // Interchange maxIndex-th and (i+1)-th row\n        const tmp1 = arr[maxIndex]\n        arr[maxIndex] = arr[i + 1]\n        arr[i + 1] = tmp1\n\n        // Interchange maxIndex-th and (i+1)-th column\n        for (let j = 0; j < N; j++) {\n          const tmp2 = arr[j][maxIndex]\n          arr[j][maxIndex] = arr[j][i + 1]\n          arr[j][i + 1] = tmp2\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          const tmp3 = R[maxIndex]\n          R[maxIndex] = R[i + 1]\n          R[i + 1] = tmp3\n        }\n      }\n\n      // Reduce following rows and columns\n      for (let j = i + 2; j < N; j++) {\n        const n = divideScalar(arr[j][i], max)\n\n        if (n === 0) {\n          continue\n        }\n\n        // from j-th row subtract n-times (i+1)th row\n        for (let k = 0; k < N; k++) {\n          arr[j][k] = subtract(arr[j][k], multiplyScalar(n, arr[i + 1][k]))\n        }\n\n        // to (i+1)th column add n-times j-th column\n        for (let k = 0; k < N; k++) {\n          arr[k][i + 1] = addScalar(arr[k][i + 1], multiplyScalar(n, arr[k][j]))\n        }\n\n        // keep track of transformations\n        if (findVectors) {\n          for (let k = 0; k < N; k++) {\n            R[j][k] = subtract(R[j][k], multiplyScalar(n, R[i + 1][k]))\n          }\n        }\n      }\n    }\n\n    return R\n  }\n\n  /**\n   * @returns {{values: values, C: Matrix}}\n   * @see Press, Wiliams: Numerical recipes in Fortran 77\n   * @see https://en.wikipedia.org/wiki/QR_algorithm\n   */\n  function iterateUntilTriangular (A, N, prec, type, findVectors) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    if (big) { prec = bignumber(prec) }\n\n    // The Francis Algorithm\n    // The core idea of this algorithm is that doing successive\n    // A' = QtAQ transformations will eventually converge to block-\n    // upper-triangular with diagonal blocks either 1x1 or 2x2.\n    // The Q here is the one from the QR decomposition, A = QR.\n    // Since the eigenvalues of a block-upper-triangular matrix are\n    // the eigenvalues of its diagonal blocks and we know how to find\n    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.\n\n    let arr = clone(A)\n\n    // the list of converged eigenvalues\n    const lambdas = []\n\n    // size of arr, which will get smaller as eigenvalues converge\n    let n = N\n\n    // the diagonal of the block-diagonal matrix that turns\n    // converged 2x2 matrices into upper triangular matrices\n    const Sdiag = []\n\n    // N×N matrix describing the overall transformation done during the QR algorithm\n    let Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined\n\n    // nxn matrix describing the QR transformations done since last convergence\n    let Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined\n\n    // last eigenvalue converged before this many steps\n    let lastConvergenceBefore = 0\n\n    while (lastConvergenceBefore <= 100) {\n      lastConvergenceBefore += 1\n\n      // TODO if the convergence is slow, do something clever\n\n      // Perform the factorization\n\n      const k = arr[n - 1][n - 1] // TODO this is apparently a somewhat\n      // old-fashioned choice; ideally set close to an eigenvalue, or\n      // perhaps better yet switch to the implicit QR version that is sometimes\n      // specifically called the \"Francis algorithm\" that is alluded to\n      // in the following TODO. (Or perhaps we switch to an independently\n      // optimized third-party package for the linear algebra operations...)\n\n      for (let i = 0; i < n; i++) {\n        arr[i][i] = subtract(arr[i][i], k)\n      }\n\n      // TODO do an implicit QR transformation\n      const { Q, R } = qr(arr)\n      arr = multiply(R, Q)\n\n      for (let i = 0; i < n; i++) {\n        arr[i][i] = addScalar(arr[i][i], k)\n      }\n\n      // keep track of transformations\n      if (findVectors) {\n        Qpartial = multiply(Qpartial, Q)\n      }\n\n      // The rightmost diagonal element converged to an eigenvalue\n      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {\n        lastConvergenceBefore = 0\n        lambdas.push(arr[n - 1][n - 1])\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift([[1]])\n          inflateMatrix(Qpartial, N)\n          Qtotal = multiply(Qtotal, Qpartial)\n\n          if (n > 1) {\n            Qpartial = diag(Array(n - 1).fill(one))\n          }\n        }\n\n        // reduce the matrix size\n        n -= 1\n        arr.pop()\n        for (let i = 0; i < n; i++) {\n          arr[i].pop()\n        }\n\n      // The rightmost diagonal 2x2 block converged\n      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {\n        lastConvergenceBefore = 0\n        const ll = eigenvalues2x2(\n          arr[n - 2][n - 2], arr[n - 2][n - 1],\n          arr[n - 1][n - 2], arr[n - 1][n - 1]\n        )\n        lambdas.push(...ll)\n\n        // keep track of transformations\n        if (findVectors) {\n          Sdiag.unshift(jordanBase2x2(\n            arr[n - 2][n - 2], arr[n - 2][n - 1],\n            arr[n - 1][n - 2], arr[n - 1][n - 1],\n            ll[0], ll[1], prec, type\n          ))\n          inflateMatrix(Qpartial, N)\n          Qtotal = multiply(Qtotal, Qpartial)\n          if (n > 2) {\n            Qpartial = diag(Array(n - 2).fill(one))\n          }\n        }\n\n        // reduce the matrix size\n        n -= 2\n        arr.pop()\n        arr.pop()\n        for (let i = 0; i < n; i++) {\n          arr[i].pop()\n          arr[i].pop()\n        }\n      }\n\n      if (n === 0) {\n        break\n      }\n    }\n\n    // standard sorting\n    lambdas.sort((a, b) => +subtract(abs(a), abs(b)))\n\n    // the algorithm didn't converge\n    if (lastConvergenceBefore > 100) {\n      const err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '))\n      err.values = lambdas\n      err.vectors = []\n      throw err\n    }\n\n    // combine the overall QR transformation Qtotal with the subsequent\n    // transformation S that turns the diagonal 2x2 blocks to upper triangular\n    const C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined\n\n    return { values: lambdas, C }\n  }\n\n  /**\n   * @param {Matrix} A hessenberg-form matrix\n   * @param {number} N size of A\n   * @param {Matrix} C column transformation matrix that turns A into upper triangular\n   * @param {Matrix} R similarity that turns original matrix into A\n   * @param {number[]} values array of eigenvalues of A\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {number[][]} eigenvalues\n   */\n  function findEigenvectors (A, N, C, R, values, prec, type) {\n    const Cinv = inv(C)\n    const U = multiply(Cinv, A, C)\n\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    // turn values into a kind of \"multiset\"\n    // this way it is easier to find eigenvectors\n    const uniqueValues = []\n    const multiplicities = []\n\n    for (const lambda of values) {\n      const i = indexOf(uniqueValues, lambda, equal)\n\n      if (i === -1) {\n        uniqueValues.push(lambda)\n        multiplicities.push(1)\n      } else {\n        multiplicities[i] += 1\n      }\n    }\n\n    // find eigenvectors by solving U − lambdaE = 0\n    // TODO replace with an iterative eigenvector algorithm\n    // (this one might fail for imprecise eigenvalues)\n\n    const vectors = []\n    const len = uniqueValues.length\n    const b = Array(N).fill(zero)\n    const E = diag(Array(N).fill(one))\n\n    for (let i = 0; i < len; i++) {\n      const lambda = uniqueValues[i]\n      const S = subtract(U, multiply(lambda, E)) // the characteristic matrix\n\n      let solutions = usolveAll(S, b)\n      solutions.shift() // ignore the null vector\n\n      // looks like we missed something, try inverse iteration\n      // But if that fails, just presume that the original matrix truly\n      // was defective.\n      while (solutions.length < multiplicities[i]) {\n        const approxVec = inverseIterate(S, N, solutions, prec, type)\n        if (approxVec === null) { break } // no more vectors were found\n        solutions.push(approxVec)\n      }\n\n      // Transform back into original array coordinates\n      const correction = multiply(inv(R), C)\n      solutions = solutions.map(v => multiply(correction, v))\n\n      vectors.push(\n        ...solutions.map(v => ({ value: lambda, vector: flatten(v) })))\n    }\n\n    return vectors\n  }\n\n  /**\n   * Compute the eigenvalues of an 2x2 matrix\n   * @return {[number,number]}\n   */\n  function eigenvalues2x2 (a, b, c, d) {\n    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 A - 4 detA )\n    const trA = addScalar(a, d)\n    const detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c))\n    const x = multiplyScalar(trA, 0.5)\n    const y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5)\n\n    return [addScalar(x, y), subtract(x, y)]\n  }\n\n  /**\n   * For an 2x2 matrix compute the transformation matrix S,\n   * so that SAS^-1 is an upper triangular matrix\n   * @return {[[number,number],[number,number]]}\n   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf\n   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html\n   */\n  function jordanBase2x2 (a, b, c, d, l1, l2, prec, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    const zero = big ? bignumber(0) : cplx ? complex(0) : 0\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    // matrix is already upper triangular\n    // return an identity matrix\n    if (smaller(abs(c), prec)) {\n      return [[one, zero], [zero, one]]\n    }\n\n    // matrix is diagonalizable\n    // return its eigenvectors as columns\n    if (larger(abs(subtract(l1, l2)), prec)) {\n      return [[subtract(l1, d), subtract(l2, d)], [c, c]]\n    }\n\n    // matrix is not diagonalizable\n    // compute diagonal elements of N = A - lambdaI\n    const na = subtract(a, l1)\n    const nd = subtract(d, l1)\n\n    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )\n    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )\n\n    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {\n      return [[na, one], [c, zero]]\n    } else {\n      return [[b, zero], [nd, one]]\n    }\n  }\n\n  /**\n   * Enlarge the matrix from nxn to NxN, setting the new\n   * elements to 1 on diagonal and 0 elsewhere\n   */\n  function inflateMatrix (arr, N) {\n    // add columns\n    for (let i = 0; i < arr.length; i++) {\n      arr[i].push(...Array(N - arr[i].length).fill(0))\n    }\n\n    // add rows\n    for (let i = arr.length; i < N; i++) {\n      arr.push(Array(N).fill(0))\n      arr[i][i] = 1\n    }\n\n    return arr\n  }\n\n  /**\n   * Create a block-diagonal matrix with the given square matrices on the diagonal\n   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal\n   * @param {number} N the size of the resulting matrix\n   */\n  function blockDiag (arr, N) {\n    const M = []\n    for (let i = 0; i < N; i++) {\n      M[i] = Array(N).fill(0)\n    }\n\n    let I = 0\n    for (const sub of arr) {\n      const n = sub.length\n\n      for (let i = 0; i < n; i++) {\n        for (let j = 0; j < n; j++) {\n          M[I + i][I + j] = sub[i][j]\n        }\n      }\n\n      I += n\n    }\n\n    return M\n  }\n\n  /**\n   * Finds the index of an element in an array using a custom equality function\n   * @template T\n   * @param {Array<T>} arr array in which to search\n   * @param {T} el the element to find\n   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`\n   * @returns {number} the index of `el`, or -1 when it's not in `arr`\n   */\n  function indexOf (arr, el, fn) {\n    for (let i = 0; i < arr.length; i++) {\n      if (fn(arr[i], el)) {\n        return i\n      }\n    }\n    return -1\n  }\n\n  /**\n   * Provided a near-singular upper-triangular matrix A and a list of vectors,\n   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal\n   * to each vector in the list\n   * @template T\n   * @param {T[][]} A near-singular square matrix\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {number} prec epsilon\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @return {T[] | null} eigenvector\n   *\n   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration\n   */\n  function inverseIterate (A, N, orthog, prec, type) {\n    const largeNum = type === 'BigNumber' ? bignumber(1000) : 1000\n\n    let b // the vector\n\n    // you better choose a random vector before I count to five\n    let i = 0\n    for (; i < 5; ++i) {\n      b = randomOrthogonalVector(N, orthog, type)\n      try {\n        b = usolve(A, b)\n      } catch {\n        // That direction didn't work, likely because the original matrix\n        // was defective. But still make the full number of tries...\n        continue\n      }\n      if (larger(norm(b), largeNum)) { break }\n    }\n    if (i >= 5) {\n      return null // couldn't find any orthogonal vector in the image\n    }\n\n    // you better converge before I count to ten\n    i = 0\n    while (true) {\n      const c = usolve(A, b)\n\n      if (smaller(norm(orthogonalComplement(b, [c])), prec)) { break }\n      if (++i >= 10) { return null }\n\n      b = normalize(c)\n    }\n\n    return b\n  }\n\n  /**\n   * Generates a random unit vector of dimension N, orthogonal to each vector in the list\n   * @template T\n   * @param {number} N dimension\n   * @param {T[][]} orthog list of vectors\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} random vector\n   */\n  function randomOrthogonalVector (N, orthog, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n\n    // generate random vector with the correct type\n    let v = Array(N).fill(0).map(_ => 2 * Math.random() - 1)\n    if (big) { v = v.map(n => bignumber(n)) }\n    if (cplx) { v = v.map(n => complex(n)) }\n\n    // project to orthogonal complement\n    v = orthogonalComplement(v, orthog)\n\n    // normalize\n    return normalize(v, type)\n  }\n\n  /**\n   * Project vector v to the orthogonal complement of an array of vectors\n   */\n  function orthogonalComplement (v, orthog) {\n    const vectorShape = size(v)\n    for (let w of orthog) {\n      w = reshape(w, vectorShape) // make sure this is just a vector computation\n      // v := v − (w, v)/|w|^2 w\n      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w))\n    }\n\n    return v\n  }\n\n  /**\n   * Calculate the norm of a vector.\n   * We can't use math.norm because factory can't handle circular dependency.\n   * Seriously, I'm really fed up with factory.\n   */\n  function norm (v) {\n    return abs(sqrt(dot(v, v)))\n  }\n\n  /**\n   * Normalize a vector\n   * @template T\n   * @param {T[]} v\n   * @param {'number'|'BigNumber'|'Complex'} type\n   * @returns {T[]} normalized vec\n   */\n  function normalize (v, type) {\n    const big = type === 'BigNumber'\n    const cplx = type === 'Complex'\n    const one = big ? bignumber(1) : cplx ? complex(1) : 1\n\n    return multiply(divideScalar(one, norm(v)), v)\n  }\n\n  return complexEigs\n}\n","import { isSparseMatrix } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'expm'\nconst dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply']\n\nexport const createExpm = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, identity, inv, multiply }) => {\n  /**\n   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.\n   * Not to be confused with exp(a), which performs element-wise\n   * exponentiation.\n   *\n   * The exponential is calculated using the Padé approximant with scaling and\n   * squaring; see \"Nineteen Dubious Ways to Compute the Exponential of a\n   * Matrix,\" by Moler and Van Loan.\n   *\n   * Syntax:\n   *\n   *     math.expm(x)\n   *\n   * Examples:\n   *\n   *     const A = [[0,2],[0,0]]\n   *     math.expm(A)        // returns [[1,2],[0,1]]\n   *\n   * See also:\n   *\n   *     exp\n   *\n   * @param {Matrix} x  A square Matrix\n   * @return {Matrix}   The exponential of x\n   */\n  return typed(name, {\n\n    Matrix: function (A) {\n      // Check matrix size\n      const size = A.size()\n\n      if (size.length !== 2 || size[0] !== size[1]) {\n        throw new RangeError('Matrix must be square ' +\n          '(size: ' + format(size) + ')')\n      }\n\n      const n = size[0]\n\n      // Desired accuracy of the approximant (The actual accuracy\n      // will be affected by round-off error)\n      const eps = 1e-15\n\n      // The Padé approximant is not so accurate when the values of A\n      // are \"large\", so scale A by powers of two. Then compute the\n      // exponential, and square the result repeatedly according to\n      // the identity e^A = (e^(A/m))^m\n\n      // Compute infinity-norm of A, ||A||, to see how \"big\" it is\n      const infNorm = infinityNorm(A)\n\n      // Find the optimal scaling factor and number of terms in the\n      // Padé approximant to reach the desired accuracy\n      const params = findParams(infNorm, eps)\n      const q = params.q\n      const j = params.j\n\n      // The Pade approximation to e^A is:\n      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)\n      // where\n      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i\n      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i\n\n      // Scale A by 1 / 2^j\n      const Apos = multiply(A, Math.pow(2, -j))\n\n      // The i=0 term is just the identity matrix\n      let N = identity(n)\n      let D = identity(n)\n\n      // Initialization (i=0)\n      let factor = 1\n\n      // Initialization (i=1)\n      let AposToI = Apos // Cloning not necessary\n      let alternate = -1\n\n      for (let i = 1; i <= q; i++) {\n        if (i > 1) {\n          AposToI = multiply(AposToI, Apos)\n          alternate = -alternate\n        }\n        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i)\n\n        N = add(N, multiply(factor, AposToI))\n        D = add(D, multiply(factor * alternate, AposToI))\n      }\n\n      let R = multiply(inv(D), N)\n\n      // Square j times\n      for (let i = 0; i < j; i++) {\n        R = multiply(R, R)\n      }\n\n      return isSparseMatrix(A)\n        ? A.createSparseMatrix(R)\n        : R\n    }\n\n  })\n\n  function infinityNorm (A) {\n    const n = A.size()[0]\n    let infNorm = 0\n    for (let i = 0; i < n; i++) {\n      let rowSum = 0\n      for (let j = 0; j < n; j++) {\n        rowSum += abs(A.get([i, j]))\n      }\n      infNorm = Math.max(rowSum, infNorm)\n    }\n    return infNorm\n  }\n\n  /**\n   * Find the best parameters for the Pade approximant given\n   * the matrix norm and desired accuracy. Returns the first acceptable\n   * combination in order of increasing computational load.\n   */\n  function findParams (infNorm, eps) {\n    const maxSearchSize = 30\n    for (let k = 0; k < maxSearchSize; k++) {\n      for (let q = 0; q <= k; q++) {\n        const j = k - q\n        if (errorEstimate(infNorm, q, j) < eps) {\n          return { q, j }\n        }\n      }\n    }\n    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)')\n  }\n\n  /**\n   * Returns the estimated error of the Pade approximant for the given\n   * parameters.\n   */\n  function errorEstimate (infNorm, q, j) {\n    let qfac = 1\n    for (let i = 2; i <= q; i++) {\n      qfac *= i\n    }\n    let twoqfac = qfac\n    for (let i = q + 1; i <= 2 * q; i++) {\n      twoqfac *= i\n    }\n    const twoqp1fac = twoqfac * (2 * q + 1)\n\n    return 8.0 *\n      Math.pow(infNorm / Math.pow(2, j), 2 * q) *\n      qfac * qfac / (twoqfac * twoqp1fac)\n  }\n})\n","import { isMatrix } from '../../utils/is.js'\nimport { format } from '../../utils/string.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'sqrtm'\nconst dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity']\n\nexport const createSqrtm = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, add, multiply, map, sqrt, subtract, inv, size, max, identity }) => {\n  const _maxIterations = 1e3\n  const _tolerance = 1e-6\n\n  /**\n   * Calculate the principal square root matrix using the Denman–Beavers iterative method\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   * @private\n   */\n  function _denmanBeavers (A) {\n    let error\n    let iterations = 0\n\n    let Y = A\n    let Z = identity(size(A))\n\n    do {\n      const Yk = Y\n      Y = multiply(0.5, add(Yk, inv(Z)))\n      Z = multiply(0.5, add(Z, inv(Yk)))\n\n      error = max(abs(subtract(Y, Yk)))\n\n      if (error > _tolerance && ++iterations > _maxIterations) {\n        throw new Error('computing square root of matrix: iterative method could not converge')\n      }\n    } while (error > _tolerance)\n\n    return Y\n  }\n\n  /**\n   * Calculate the principal square root of a square matrix.\n   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.\n   *\n   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix\n   *\n   * Syntax:\n   *\n   *     math.sqrtm(A)\n   *\n   * Examples:\n   *\n   *     math.sqrtm([[33, 24], [48, 57]]) // returns [[5, 2], [4, 7]]\n   *\n   * See also:\n   *\n   *     sqrt, pow\n   *\n   * @param  {Array | Matrix} A   The square matrix `A`\n   * @return {Array | Matrix}     The principal square root of matrix `A`\n   */\n  return typed(name, {\n    'Array | Matrix': function (A) {\n      const size = isMatrix(A) ? A.size() : arraySize(A)\n      switch (size.length) {\n        case 1:\n          // Single element Array | Matrix\n          if (size[0] === 1) {\n            return map(A, sqrt)\n          } else {\n            throw new RangeError('Matrix must be square ' +\n            '(size: ' + format(size) + ')')\n          }\n\n        case 2:\n        {\n          // Two-dimensional Array | Matrix\n          const rows = size[0]\n          const cols = size[1]\n          if (rows === cols) {\n            return _denmanBeavers(A)\n          } else {\n            throw new RangeError('Matrix must be square ' +\n              '(size: ' + format(size) + ')')\n          }\n        }\n        default:\n          // Multi dimensional array\n          throw new RangeError('Matrix must be at most two dimensional ' +\n          '(size: ' + format(size) + ')')\n      }\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'sylvester'\nconst dependencies = [\n  'typed',\n  'schur',\n  'matrixFromColumns',\n  'matrix',\n  'multiply',\n  'range',\n  'concat',\n  'transpose',\n  'index',\n  'subset',\n  'add',\n  'subtract',\n  'identity',\n  'lusolve',\n  'abs'\n]\n\nexport const createSylvester = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    schur,\n    matrixFromColumns,\n    matrix,\n    multiply,\n    range,\n    concat,\n    transpose,\n    index,\n    subset,\n    add,\n    subtract,\n    identity,\n    lusolve,\n    abs\n  }\n) => {\n  /**\n   *\n   * Solves the real-valued Sylvester equation AX+XB=C for X, where A, B and C are\n   * matrices of appropriate dimensions, being A and B squared. Notice that other\n   * equivalent definitions for the Sylvester equation exist and this function\n   * assumes the one presented in the original publication of the the Bartels-\n   * Stewart algorithm, which is implemented by this function.\n   * https://en.wikipedia.org/wiki/Sylvester_equation\n   *\n   * Syntax:\n   *\n   *     math.sylvester(A, B, C)\n   *\n   * Examples:\n   *\n   *     const A = [[-1, -2], [1, 1]]\n   *     const B = [[2, -1], [1, -2]]\n   *     const C = [[-3, 2], [3, 0]]\n   *     math.sylvester(A, B, C)      // returns DenseMatrix [[-0.25, 0.25], [1.5, -1.25]]\n   *\n   * See also:\n   *\n   *     schur, lyap\n   *\n   * @param {Matrix | Array} A  Matrix A\n   * @param {Matrix | Array} B  Matrix B\n   * @param {Matrix | Array} C  Matrix C\n   * @return {Matrix | Array}   Matrix X, solving the Sylvester equation\n   */\n  return typed(name, {\n    'Matrix, Matrix, Matrix': _sylvester,\n    'Array, Matrix, Matrix': function (A, B, C) {\n      return _sylvester(matrix(A), B, C)\n    },\n    'Array, Array, Matrix': function (A, B, C) {\n      return _sylvester(matrix(A), matrix(B), C)\n    },\n    'Array, Matrix, Array': function (A, B, C) {\n      return _sylvester(matrix(A), B, matrix(C))\n    },\n    'Matrix, Array, Matrix': function (A, B, C) {\n      return _sylvester(A, matrix(B), C)\n    },\n    'Matrix, Array, Array': function (A, B, C) {\n      return _sylvester(A, matrix(B), matrix(C))\n    },\n    'Matrix, Matrix, Array': function (A, B, C) {\n      return _sylvester(A, B, matrix(C))\n    },\n    'Array, Array, Array': function (A, B, C) {\n      return _sylvester(matrix(A), matrix(B), matrix(C)).toArray()\n    }\n  })\n  function _sylvester (A, B, C) {\n    const n = B.size()[0]\n    const m = A.size()[0]\n\n    const sA = schur(A)\n    const F = sA.T\n    const U = sA.U\n    const sB = schur(multiply(-1, B))\n    const G = sB.T\n    const V = sB.U\n    const D = multiply(multiply(transpose(U), C), V)\n    const all = range(0, m)\n    const y = []\n\n    const hc = (a, b) => concat(a, b, 1)\n    const vc = (a, b) => concat(a, b, 0)\n\n    for (let k = 0; k < n; k++) {\n      if (k < (n - 1) && abs(subset(G, index(k + 1, k))) > 1e-5) {\n        let RHS = vc(subset(D, index(all, k)), subset(D, index(all, k + 1)))\n        for (let j = 0; j < k; j++) {\n          RHS = add(RHS,\n            vc(multiply(y[j], subset(G, index(j, k))), multiply(y[j], subset(G, index(j, k + 1))))\n          )\n        }\n        const gkk = multiply(identity(m), multiply(-1, subset(G, index(k, k))))\n        const gmk = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k))))\n        const gkm = multiply(identity(m), multiply(-1, subset(G, index(k, k + 1))))\n        const gmm = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k + 1))))\n        const LHS = vc(\n          hc(add(F, gkk), gmk),\n          hc(gkm, add(F, gmm))\n        )\n        const yAux = lusolve(LHS, RHS)\n        y[k] = yAux.subset(index(range(0, m), 0))\n        y[k + 1] = yAux.subset(index(range(m, 2 * m), 0))\n        k++\n      } else {\n        let RHS = subset(D, index(all, k))\n        for (let j = 0; j < k; j++) { RHS = add(RHS, multiply(y[j], subset(G, index(j, k)))) }\n        const gkk = subset(G, index(k, k))\n        const LHS = subtract(F, multiply(gkk, identity(m)))\n\n        y[k] = lusolve(LHS, RHS)\n      }\n    }\n    const Y = matrix(matrixFromColumns(...y))\n    const X = multiply(U, multiply(Y, transpose(V)))\n\n    return X\n  }\n})\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'schur'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'identity',\n  'multiply',\n  'qr',\n  'norm',\n  'subtract'\n]\n\nexport const createSchur = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    identity,\n    multiply,\n    qr,\n    norm,\n    subtract\n  }\n) => {\n  /**\n   *\n   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal\n   * and T is upper quasi-triangular.\n   * https://en.wikipedia.org/wiki/Schur_decomposition\n   *\n   * Syntax:\n   *\n   *     math.schur(A)\n   *\n   * Examples:\n   *\n   *     const A = [[1, 0], [-4, 3]]\n   *     math.schur(A) // returns {T: [[3, 4], [0, 1]], R: [[0, 1], [-1, 0]]}\n   *\n   * See also:\n   *\n   *     sylvester, lyap, qr\n   *\n   * @param {Array | Matrix} A  Matrix A\n   * @return {{U: Array | Matrix, T: Array | Matrix}} Object containing both matrix U and T of the Schur Decomposition A=UTU'\n   */\n  return typed(name, {\n    Array: function (X) {\n      const r = _schur(matrix(X))\n      return {\n        U: r.U.valueOf(),\n        T: r.T.valueOf()\n      }\n    },\n\n    Matrix: function (X) {\n      return _schur(X)\n    }\n  })\n  function _schur (X) {\n    const n = X.size()[0]\n    let A = X\n    let U = identity(n)\n    let k = 0\n    let A0\n    do {\n      A0 = A\n      const QR = qr(A)\n      const Q = QR.Q\n      const R = QR.R\n      A = multiply(R, Q)\n      U = multiply(U, Q)\n      if ((k++) > 100) { break }\n    } while (norm(subtract(A, A0)) > 1e-4)\n    return { U, T: A }\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'lyap'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'sylvester',\n  'multiply',\n  'transpose'\n]\n\nexport const createLyap = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    matrix,\n    sylvester,\n    multiply,\n    transpose\n  }\n) => {\n  /**\n   *\n   * Solves the Continuous-time Lyapunov equation AP+PA'+Q=0 for P, where\n   * Q is an input matrix. When Q is symmetric, P is also symmetric. Notice\n   * that different equivalent definitions exist for the Continuous-time\n   * Lyapunov equation.\n   * https://en.wikipedia.org/wiki/Lyapunov_equation\n   *\n   * Syntax:\n   *\n   *     math.lyap(A, Q)\n   *\n   * Examples:\n   *\n   *     const A = [[-2, 0], [1, -4]]\n   *     const Q = [[3, 1], [1, 3]]\n   *     const P = math.lyap(A, Q)\n   *\n   * See also:\n   *\n   *     sylvester, schur\n   *\n   * @param {Matrix | Array} A  Matrix A\n   * @param {Matrix | Array} Q  Matrix Q\n   * @return {Matrix | Array} Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q\n   */\n  return typed(name, {\n    'Matrix, Matrix': function (A, Q) {\n      return sylvester(A, transpose(A), multiply(-1, Q))\n    },\n    'Array, Matrix': function (A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), multiply(-1, Q))\n    },\n    'Matrix, Array': function (A, Q) {\n      return sylvester(A, transpose(matrix(A)), matrix(multiply(-1, Q)))\n    },\n    'Array, Array': function (A, Q) {\n      return sylvester(matrix(A), transpose(matrix(A)), matrix(multiply(-1, Q))).toArray()\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\nimport { extend } from '../../utils/object.js'\nimport { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js'\nimport { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js'\n\nconst name = 'divide'\nconst dependencies = [\n  'typed',\n  'matrix',\n  'multiply',\n  'equalScalar',\n  'divideScalar',\n  'inv'\n]\n\nexport const createDivide = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, multiply, equalScalar, divideScalar, inv }) => {\n  const matAlgo11xS0s = createMatAlgo11xS0s({ typed, equalScalar })\n  const matAlgo14xDs = createMatAlgo14xDs({ typed })\n\n  /**\n   * Divide two values, `x / y`.\n   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.\n   *\n   * Syntax:\n   *\n   *    math.divide(x, y)\n   *\n   * Examples:\n   *\n   *    math.divide(2, 3)            // returns number 0.6666666666666666\n   *\n   *    const a = math.complex(5, 14)\n   *    const b = math.complex(4, 1)\n   *    math.divide(a, b)            // returns Complex 2 + 3i\n   *\n   *    const c = [[7, -6], [13, -4]]\n   *    const d = [[1, 2], [4, 3]]\n   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]\n   *\n   *    const e = math.unit('18 km')\n   *    math.divide(e, 4.5)          // returns Unit 4 km\n   *\n   * See also:\n   *\n   *    multiply\n   *\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x   Numerator\n   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix} y          Denominator\n   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`\n   */\n  return typed('divide', extend({\n    // we extend the signatures of divideScalar with signatures dealing with matrices\n\n    'Array | Matrix, Array | Matrix': function (x, y) {\n      // TODO: implement matrix right division using pseudo inverse\n      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html\n      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html\n      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour\n      return multiply(x, inv(y))\n    },\n\n    'DenseMatrix, any': function (x, y) {\n      return matAlgo14xDs(x, y, divideScalar, false)\n    },\n\n    'SparseMatrix, any': function (x, y) {\n      return matAlgo11xS0s(x, y, divideScalar, false)\n    },\n\n    'Array, any': function (x, y) {\n      // use matrix implementation\n      return matAlgo14xDs(matrix(x), y, divideScalar, false).valueOf()\n    },\n\n    'any, Array | Matrix': function (x, y) {\n      return multiply(x, inv(y))\n    }\n  }, divideScalar.signatures))\n})\n","import { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'distance'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'subtractScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'deepEqual',\n  'sqrt',\n  'abs'\n]\n\nexport const createDistance = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, subtractScalar, multiplyScalar, divideScalar, deepEqual, sqrt, abs }) => {\n  /**\n    * Calculates:\n    *    The eucledian distance between two points in N-dimensional spaces.\n    *    Distance between point and a line in 2 and 3 dimensional spaces.\n    *    Pairwise distance between a set of 2D or 3D points\n    * NOTE:\n    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c\n    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)\n    *\n    * Syntax:\n    *\n    *    math.distance([x1,y1], [x2,y2])\n    *    math.distance({pointOneX, pointOneY}, {pointTwoX, pointTwoY})\n    *    math.distance([x1,y1,z1], [x2,y2,z2])\n    *    math.distance({pointOneX, pointOneY, pointOneZ}, {pointTwoX, pointTwoY, pointTwoZ})\n    *    math.distance([x1,y1,z1,a1], [x2,y2,z2,a2])\n    *    math.distance([[x1,y1], [x2,y2], [x3,y3]])\n    *    math.distance([[x1,y1,z1], [x2,y2,z2], [x3,y3,z3]])\n    *    math.distance([pointX,pointY], [a,b,c])\n    *    math.distance([pointX,pointY], [lineOnePtX,lineOnePtY], [lineTwoPtX,lineTwoPtY])\n    *    math.distance({pointX, pointY}, {lineOnePtX, lineOnePtY}, {lineTwoPtX, lineTwoPtY})\n    *    math.distance([pointX,pointY,pointZ], [x0, y0, z0, a, b, c])\n    *    math.distance({pointX, pointY, pointZ}, {x0, y0, z0, a, b, c})\n    *\n    * Examples:\n    *    math.distance([0,0], [4,4])                     // Returns 5.656854249492381\n    *    math.distance(\n    *     {pointOneX: 0, pointOneY: 0},\n    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951\n    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.7416573867739413\n    *    math.distance(\n    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},\n    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3\n    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2\n    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]\n    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]\n    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387\n    *    math.distance([0, 0], [3, 0], [0, 4])        // Returns 2.4\n    *    math.distance(\n    *     {pointX: 0, pointY: 0},\n    *     {lineOnePtX: 3, lineOnePtY: 0},\n    *     {lineTwoPtX: 0, lineTwoPtY: 4})                // Returns 2.4\n    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857\n    *    math.distance(\n    *     {pointX: 2, pointY: 3, pointZ: 1},\n    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1})       // Returns 2.3204774044612857\n    *\n    * @param {Array | Matrix | Object} x    Co-ordinates of first point\n    * @param {Array | Matrix | Object} y    Co-ordinates of second point\n    * @return {Number | BigNumber} Returns the distance from two/three points\n  */\n  return typed(name, {\n    'Array, Array, Array': function (x, y, z) {\n      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)\n      if (x.length === 2 && y.length === 2 && z.length === 2) {\n        if (!_2d(x)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument') }\n        if (!_2d(y)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument') }\n        if (!_2d(z)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument') }\n        if (deepEqual(y, z)) { throw new TypeError('LinePoint1 should not be same with LinePoint2') }\n        const xCoeff = subtractScalar(z[1], y[1])\n        const yCoeff = subtractScalar(y[0], z[0])\n        const constant = subtractScalar(multiplyScalar(z[0], y[1]), multiplyScalar(y[0], z[1]))\n\n        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant)\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Object, Object, Object': function (x, y, z) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {\n        if (!_2d(x)) { throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers') }\n        if (!_2d(y)) { throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers') }\n        if (!_2d(z)) { throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers') }\n        if (deepEqual(_objectToArray(y), _objectToArray(z))) { throw new TypeError('LinePoint1 should not be same with LinePoint2') }\n        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y &&\n          'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {\n          const xCoeff = subtractScalar(z.lineTwoPtY, y.lineOnePtY)\n          const yCoeff = subtractScalar(y.lineOnePtX, z.lineTwoPtX)\n          const constant = subtractScalar(multiplyScalar(z.lineTwoPtX, y.lineOnePtY), multiplyScalar(y.lineOnePtX, z.lineTwoPtY))\n          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Array, Array': function (x, y) {\n      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])\n      if (x.length === 2 && y.length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument')\n        }\n\n        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2])\n      } else if (x.length === 3 && y.length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument')\n        }\n        if (!_parametricLine(y)) {\n          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument')\n        }\n\n        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5])\n      } else if (x.length === y.length && x.length > 0) {\n        // Point to Point N-dimensions\n        if (!_containsOnlyNumbers(x)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers')\n        }\n        if (!_containsOnlyNumbers(y)) {\n          throw new TypeError('All values of an array should be numbers or BigNumbers')\n        }\n\n        return _euclideanDistance(x, y)\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    'Object, Object': function (x, y) {\n      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers')\n        }\n        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {\n          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {\n        // Point to Line 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers')\n        }\n        if (!_parametricLine(y)) {\n          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers')\n        }\n        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {\n          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c)\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {\n        // Point to Point 2D\n        if (!_2d(x)) {\n          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers')\n        }\n        if (!_2d(y)) {\n          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers')\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {\n          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY])\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {\n        // Point to Point 3D\n        if (!_3d(x)) {\n          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers')\n        }\n        if (!_3d(y)) {\n          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers')\n        }\n        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x &&\n          'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y\n        ) {\n          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ])\n        } else {\n          throw new TypeError('Key names do not match')\n        }\n      } else {\n        throw new TypeError('Invalid Arguments: Try again')\n      }\n    },\n    Array: function (arr) {\n      if (!_pairwise(arr)) { throw new TypeError('Incorrect array format entered for pairwise distance calculation') }\n\n      return _distancePairwise(arr)\n    }\n  })\n\n  function _isNumber (a) {\n    // distance supports numbers and bignumbers\n    return (typeof a === 'number' || isBigNumber(a))\n  }\n\n  function _2d (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1])\n  }\n\n  function _3d (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2])\n  }\n\n  function _containsOnlyNumbers (a) {\n    // checks if the number of arguments are correct in count and are valid (should be numbers)\n    if (!Array.isArray(a)) {\n      a = _objectToArray(a)\n    }\n    return a.every(_isNumber)\n  }\n\n  function _parametricLine (a) {\n    if (a.constructor !== Array) {\n      a = _objectToArray(a)\n    }\n    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) &&\n      _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5])\n  }\n\n  function _objectToArray (o) {\n    const keys = Object.keys(o)\n    const a = []\n    for (let i = 0; i < keys.length; i++) {\n      a.push(o[keys[i]])\n    }\n    return a\n  }\n\n  function _pairwise (a) {\n    // checks for valid arguments passed to _distancePairwise(Array)\n    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {\n      if (a.some(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {\n        return false\n      }\n    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {\n      if (a.some(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {\n        return false\n      }\n    } else {\n      return false\n    }\n    return true\n  }\n\n  function _distancePointLine2D (x, y, a, b, c) {\n    const num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c))\n    const den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)))\n    return divideScalar(num, den)\n  }\n\n  function _distancePointLine3D (x, y, z, x0, y0, z0, a, b, c) {\n    let num = [subtractScalar(multiplyScalar(subtractScalar(y0, y), c), multiplyScalar(subtractScalar(z0, z), b)),\n      subtractScalar(multiplyScalar(subtractScalar(z0, z), a), multiplyScalar(subtractScalar(x0, x), c)),\n      subtractScalar(multiplyScalar(subtractScalar(x0, x), b), multiplyScalar(subtractScalar(y0, y), a))]\n    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])))\n    const den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)))\n    return divideScalar(num, den)\n  }\n\n  function _euclideanDistance (x, y) {\n    const vectorSize = x.length\n    let result = 0\n    let diff = 0\n    for (let i = 0; i < vectorSize; i++) {\n      diff = subtractScalar(x[i], y[i])\n      result = addScalar(multiplyScalar(diff, diff), result)\n    }\n    return sqrt(result)\n  }\n\n  function _distancePairwise (a) {\n    const result = []\n    let pointA = []\n    let pointB = []\n    for (let i = 0; i < a.length - 1; i++) {\n      for (let j = i + 1; j < a.length; j++) {\n        if (a[0].length === 2) {\n          pointA = [a[i][0], a[i][1]]\n          pointB = [a[j][0], a[j][1]]\n        } else if (a[0].length === 3) {\n          pointA = [a[i][0], a[i][1], a[i][2]]\n          pointB = [a[j][0], a[j][1], a[j][2]]\n        }\n        result.push(_euclideanDistance(pointA, pointB))\n      }\n    }\n    return result\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'intersect'\nconst dependencies = [\n  'typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'\n]\n\nexport const createIntersect = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, abs, add, addScalar, matrix, multiply, multiplyScalar, divideScalar, subtract, smaller, equalScalar, flatten, isZero, isNumeric }) => {\n  /**\n   * Calculates the point of intersection of two lines in two or three dimensions\n   * and of a line and a plane in three dimensions. The inputs are in the form of\n   * arrays or 1 dimensional matrices. The line intersection functions return null\n   * if the lines do not meet.\n   *\n   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.\n   *\n   * Syntax:\n   *\n   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)\n   *    math.intersect(endPoint1, endPoint2, planeCoefficients)\n   *\n   * Examples:\n   *\n   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]\n   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]\n   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]\n   *\n   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line\n   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line\n   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line\n   *                              OR Co-efficients of the plane's equation\n   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line\n   *                              OR undefined if the calculation is for line and plane\n   * @return {Array}              Returns the point of intersection of lines/lines-planes\n   */\n  return typed('intersect', {\n    'Array, Array, Array': _AAA,\n\n    'Array, Array, Array, Array': _AAAA,\n\n    'Matrix, Matrix, Matrix': function (x, y, plane) {\n      const arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf())\n      return arr === null ? null : matrix(arr)\n    },\n\n    'Matrix, Matrix, Matrix, Matrix': function (w, x, y, z) {\n      // TODO: output matrix type should match input matrix type\n      const arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf())\n      return arr === null ? null : matrix(arr)\n    }\n  })\n\n  function _AAA (x, y, plane) {\n    x = _coerceArr(x)\n    y = _coerceArr(y)\n    plane = _coerceArr(plane)\n\n    if (!_3d(x)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument') }\n    if (!_3d(y)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument') }\n    if (!_4d(plane)) { throw new TypeError('Array with 4 numbers expected as third argument') }\n\n    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3])\n  }\n\n  function _AAAA (w, x, y, z) {\n    w = _coerceArr(w)\n    x = _coerceArr(x)\n    y = _coerceArr(y)\n    z = _coerceArr(z)\n\n    if (w.length === 2) {\n      if (!_2d(w)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument') }\n      if (!_2d(x)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument') }\n      if (!_2d(y)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument') }\n      if (!_2d(z)) { throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument') }\n\n      return _intersect2d(w, x, y, z)\n    } else if (w.length === 3) {\n      if (!_3d(w)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument') }\n      if (!_3d(x)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument') }\n      if (!_3d(y)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument') }\n      if (!_3d(z)) { throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument') }\n\n      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2])\n    } else {\n      throw new TypeError('Arrays with two or thee dimensional points expected')\n    }\n  }\n\n  /** Coerce row and column 2-dim arrays to 1-dim array */\n  function _coerceArr (arr) {\n    // row matrix\n    if (arr.length === 1) return arr[0]\n\n    // column matrix\n    if (arr.length > 1 && Array.isArray(arr[0])) {\n      if (arr.every(el => Array.isArray(el) && el.length === 1)) return flatten(arr)\n    }\n\n    return arr\n  }\n\n  function _2d (x) {\n    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1])\n  }\n\n  function _3d (x) {\n    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2])\n  }\n\n  function _4d (x) {\n    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3])\n  }\n\n  function _intersect2d (p1a, p1b, p2a, p2b) {\n    const o1 = p1a\n    const o2 = p2a\n    const d1 = subtract(o1, p1b)\n    const d2 = subtract(o2, p2b)\n    const det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]))\n    if (isZero(det)) return null\n    if (smaller(abs(det), config.relTol)) {\n      return null\n    }\n    const d20o11 = multiplyScalar(d2[0], o1[1])\n    const d21o10 = multiplyScalar(d2[1], o1[0])\n    const d20o21 = multiplyScalar(d2[0], o2[1])\n    const d21o20 = multiplyScalar(d2[1], o2[0])\n    const t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det)\n    return add(multiply(d1, t), o1)\n  }\n\n  function _intersect3dHelper (a, b, c, d, e, f, g, h, i, j, k, l) {\n    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)\n    const add1 = multiplyScalar(subtract(a, b), subtract(c, d))\n    const add2 = multiplyScalar(subtract(e, f), subtract(g, h))\n    const add3 = multiplyScalar(subtract(i, j), subtract(k, l))\n    return addScalar(addScalar(add1, add2), add3)\n  }\n\n  function _intersect3d (x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {\n    const d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3)\n    const d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1)\n    const d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1)\n    const d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3)\n    const d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1)\n    const numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343))\n    const denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321))\n    if (isZero(denominator)) return null\n    const ta = divideScalar(numerator, denominator)\n    const tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343)\n\n    const pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)))\n    const pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)))\n    const paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)))\n    const pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)))\n    const pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)))\n    const pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)))\n    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {\n      return [pax, pay, paz]\n    } else {\n      return null\n    }\n  }\n\n  function _intersectLinePlane (x1, y1, z1, x2, y2, z2, x, y, z, c) {\n    const x1x = multiplyScalar(x1, x)\n    const x2x = multiplyScalar(x2, x)\n    const y1y = multiplyScalar(y1, y)\n    const y2y = multiplyScalar(y2, y)\n    const z1z = multiplyScalar(z1, z)\n    const z2z = multiplyScalar(z2, z)\n\n    const numerator = subtract(subtract(subtract(c, x1x), y1y), z1z)\n    const denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z)\n\n    const t = divideScalar(numerator, denominator)\n\n    const px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)))\n    const py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)))\n    const pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)))\n    return [px, py, pz]\n    // TODO: Add cases when line is parallel to the plane:\n    //       (a) no intersection,\n    //       (b) line contained in plane\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'sum'\nconst dependencies = ['typed', 'config', 'add', 'numeric']\n\nexport const createSum = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, add, numeric }) => {\n  /**\n   * Compute the sum of a matrix or a list with values.\n   * In case of a multidimensional array or matrix, the sum of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.sum(a, b, c, ...)\n   *     math.sum(A)\n   *     math.sum(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.sum(2, 1, 4, 3)               // returns 10\n   *     math.sum([2, 1, 4, 3])             // returns 10\n   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, cumsum\n   *\n   * @param {... *} args  A single matrix or multiple scalar values\n   * @return {*} The sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    'Array | Matrix': _sum,\n\n    // sum([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nsumDim,\n\n    // sum(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function sum')\n      }\n\n      return _sum(args)\n    }\n  })\n\n  /**\n   * Recursively calculate the sum of an n-dimensional array\n   * @param {Array | Matrix} array\n   * @return {number} sum\n   * @private\n   */\n  function _sum (array) {\n    let sum\n\n    deepForEach(array, function (value) {\n      try {\n        sum = (sum === undefined) ? value : add(sum, value)\n      } catch (err) {\n        throw improveErrorMessage(err, 'sum', value)\n      }\n    })\n\n    // make sure returning numeric value: parse a string into a numeric value\n    if (sum === undefined) {\n      sum = numeric(0, config.number)\n    }\n    if (typeof sum === 'string') {\n      sum = numeric(sum, safeNumberType(sum, config))\n    }\n\n    return sum\n  }\n\n  function _nsumDim (array, dim) {\n    try {\n      const sum = reduce(array, dim, add)\n      return sum\n    } catch (err) {\n      throw improveErrorMessage(err, 'sum')\n    }\n  }\n})\n","import { containsCollections } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\nimport { _switch } from '../../utils/switch.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\nimport { arraySize } from '../../utils/array.js'\nimport { IndexError } from '../../error/IndexError.js'\n\nconst name = 'cumsum'\nconst dependencies = ['typed', 'add', 'unaryPlus']\n\nexport const createCumSum = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, unaryPlus }) => {\n  /**\n   * Compute the cumulative sum of a matrix or a list with values.\n   * In case of a (multi dimensional) array or matrix, the cumulative sums\n   * along a specified dimension (defaulting to the first) will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.cumsum(a, b, c, ...)\n   *     math.cumsum(A)\n   *\n   * Examples:\n   *\n   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]\n   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]\n   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]\n   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]\n   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]\n   *\n   * See also:\n   *\n   *    mean, median, min, max, prod, std, variance, sum\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The cumulative sum of all values\n   */\n  return typed(name, {\n    // sum([a, b, c, d, ...])\n    Array: _cumsum,\n    Matrix: function (matrix) {\n      return matrix.create(_cumsum(matrix.valueOf(), matrix.datatype()))\n    },\n\n    // sum([a, b, c, d, ...], dim)\n    'Array, number | BigNumber': _ncumSumDim,\n    'Matrix, number | BigNumber': function (matrix, dim) {\n      return matrix.create(_ncumSumDim(matrix.valueOf(), dim), matrix.datatype())\n    },\n\n    // cumsum(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('All values expected to be scalar in function cumsum')\n      }\n\n      return _cumsum(args)\n    }\n  })\n\n  /**\n     * Recursively calculate the cumulative sum of an n-dimensional array\n     * @param {Array} array\n     * @return {number} cumsum\n     * @private\n     */\n  function _cumsum (array) {\n    try {\n      return _cumsummap(array)\n    } catch (err) {\n      throw improveErrorMessage(err, name)\n    }\n  }\n\n  function _cumsummap (array) {\n    if (array.length === 0) {\n      return []\n    }\n\n    const sums = [unaryPlus(array[0])] // unaryPlus converts to number if need be\n    for (let i = 1; i < array.length; ++i) {\n      // Must use add below and not addScalar for the case of summing a\n      // 2+-dimensional array along the 0th dimension (the row vectors,\n      // or higher-d analogues, are literally added to each other).\n      sums.push(add(sums[i - 1], array[i]))\n    }\n    return sums\n  }\n\n  function _ncumSumDim (array, dim) {\n    const size = arraySize(array)\n    if (dim < 0 || (dim >= size.length)) {\n      // TODO: would be more clear when throwing a DimensionError here\n      throw new IndexError(dim, size.length)\n    }\n\n    try {\n      return _cumsumDimensional(array, dim)\n    } catch (err) {\n      throw improveErrorMessage(err, name)\n    }\n  }\n\n  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */\n  function _cumsumDimensional (mat, dim) {\n    let i, ret, tran\n\n    if (dim <= 0) {\n      const initialValue = mat[0][0]\n      if (!Array.isArray(initialValue)) {\n        return _cumsummap(mat)\n      } else {\n        tran = _switch(mat)\n        ret = []\n        for (i = 0; i < tran.length; i++) {\n          ret[i] = _cumsumDimensional(tran[i], dim - 1)\n        }\n        return ret\n      }\n    } else {\n      ret = []\n      for (i = 0; i < mat.length; i++) {\n        ret[i] = _cumsumDimensional(mat[i], dim - 1)\n      }\n      return ret\n    }\n  }\n})\n","import { containsCollections, deepForEach, reduce } from '../../utils/collection.js'\nimport { arraySize } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'mean'\nconst dependencies = ['typed', 'add', 'divide']\n\nexport const createMean = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide }) => {\n  /**\n   * Compute the mean value of matrix or a list with values.\n   * In case of a multidimensional array, the mean of the flattened array\n   * will be calculated. When `dim` is provided, the maximum over the selected\n   * dimension will be calculated. Parameter `dim` is zero-based.\n   *\n   * Syntax:\n   *\n   *     math.mean(a, b, c, ...)\n   *     math.mean(A)\n   *     math.mean(A, dimension)\n   *\n   * Examples:\n   *\n   *     math.mean(2, 1, 4, 3)                     // returns 2.5\n   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725\n   *\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]\n   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]\n   *\n   * See also:\n   *\n   *     median, min, max, sum, prod, std, variance\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The mean of all values\n   */\n  return typed(name, {\n    // mean([a, b, c, d, ...])\n    'Array | Matrix': _mean,\n\n    // mean([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': _nmeanDim,\n\n    // mean(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function mean')\n      }\n\n      return _mean(args)\n    }\n  })\n\n  /**\n   * Calculate the mean value in an n-dimensional array, returning a\n   * n-1 dimensional array\n   * @param {Array} array\n   * @param {number} dim\n   * @return {number} mean\n   * @private\n   */\n  function _nmeanDim (array, dim) {\n    try {\n      const sum = reduce(array, dim, add)\n      const s = Array.isArray(array) ? arraySize(array) : array.size()\n      return divide(sum, s[dim])\n    } catch (err) {\n      throw improveErrorMessage(err, 'mean')\n    }\n  }\n\n  /**\n   * Recursively calculate the mean value in an n-dimensional array\n   * @param {Array} array\n   * @return {number} mean\n   * @private\n   */\n  function _mean (array) {\n    let sum\n    let num = 0\n\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value)\n        num++\n      } catch (err) {\n        throw improveErrorMessage(err, 'mean', value)\n      }\n    })\n\n    if (num === 0) {\n      throw new Error('Cannot calculate the mean of an empty array')\n    }\n    return divide(sum, num)\n  }\n})\n","import { containsCollections } from '../../utils/collection.js'\nimport { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'median'\nconst dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect']\n\nexport const createMedian = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide, compare, partitionSelect }) => {\n  /**\n   * Recursively calculate the median of an n-dimensional array\n   * @param {Array} array\n   * @return {Number} median\n   * @private\n   */\n  function _median (array) {\n    try {\n      array = flatten(array.valueOf())\n\n      const num = array.length\n      if (num === 0) {\n        throw new Error('Cannot calculate median of an empty array')\n      }\n\n      if (num % 2 === 0) {\n        // even: return the average of the two middle values\n        const mid = num / 2 - 1\n        const right = partitionSelect(array, mid + 1)\n\n        // array now partitioned at mid + 1, take max of left part\n        let left = array[mid]\n        for (let i = 0; i < mid; ++i) {\n          if (compare(array[i], left) > 0) {\n            left = array[i]\n          }\n        }\n\n        return middle2(left, right)\n      } else {\n        // odd: return the middle value\n        const m = partitionSelect(array, (num - 1) / 2)\n\n        return middle(m)\n      }\n    } catch (err) {\n      throw improveErrorMessage(err, 'median')\n    }\n  }\n\n  // helper function to type check the middle value of the array\n  const middle = typed({\n    'number | BigNumber | Complex | Unit': function (value) {\n      return value\n    }\n  })\n\n  // helper function to type check the two middle value of the array\n  const middle2 = typed({\n    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function (left, right) {\n      return divide(add(left, right), 2)\n    }\n  })\n\n  /**\n   * Compute the median of a matrix or a list with values. The values are\n   * sorted and the middle value is returned. In case of an even number of\n   * values, the average of the two middle values is returned.\n   * Supported types of values are: Number, BigNumber, Unit\n   *\n   * In case of a (multi dimensional) array or matrix, the median of all\n   * elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.median(a, b, c, ...)\n   *     math.median(A)\n   *\n   * Examples:\n   *\n   *     math.median(5, 2, 7)        // returns 5\n   *     math.median([3, -1, 5, 7])  // returns 4\n   *\n   * See also:\n   *\n   *     mean, min, max, sum, prod, std, variance, quantileSeq\n   *\n   * @param {... *} args  A single matrix or or multiple scalar values\n   * @return {*} The median\n   */\n  return typed(name, {\n    // median([a, b, c, d, ...])\n    'Array | Matrix': _median,\n\n    // median([a, b, c, d, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      // TODO: implement median(A, dim)\n      throw new Error('median(A, dim) is not yet supported')\n      // return reduce(arguments[0], arguments[1], ...)\n    },\n\n    // median(a, b, c, d, ...)\n    '...': function (args) {\n      if (containsCollections(args)) {\n        throw new TypeError('Scalar values expected in function median')\n      }\n\n      return _median(args)\n    }\n  })\n})\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst name = 'mad'\nconst dependencies = ['typed', 'abs', 'map', 'median', 'subtract']\n\nexport const createMad = /* #__PURE__ */ factory(name, dependencies, ({ typed, abs, map, median, subtract }) => {\n  /**\n   * Compute the median absolute deviation of a matrix or a list with values.\n   * The median absolute deviation is defined as the median of the absolute\n   * deviations from the median.\n   *\n   * Syntax:\n   *\n   *     math.mad(a, b, c, ...)\n   *     math.mad(A)\n   *\n   * Examples:\n   *\n   *     math.mad(10, 20, 30)             // returns 10\n   *     math.mad([1, 2, 3])              // returns 1\n   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5\n   *\n   * See also:\n   *\n   *     median, mean, std, abs\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or multiple scalar values.\n   * @return {*} The median absolute deviation.\n   */\n  return typed(name, {\n    // mad([a, b, c, d, ...])\n    'Array | Matrix': _mad,\n\n    // mad(a, b, c, d, ...)\n    '...': function (args) {\n      return _mad(args)\n    }\n  })\n\n  function _mad (array) {\n    array = flatten(array.valueOf())\n\n    if (array.length === 0) {\n      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array')\n    }\n\n    try {\n      const med = median(array)\n      return median(map(array, function (value) {\n        return abs(subtract(value, med))\n      }))\n    } catch (err) {\n      if (err instanceof TypeError && err.message.includes('median')) {\n        throw new TypeError(err.message.replace('median', 'mad'))\n      } else {\n        throw improveErrorMessage(err, 'mad')\n      }\n    }\n  }\n})\n","import { deepForEach } from '../../utils/collection.js'\nimport { isBigNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { improveErrorMessage } from './utils/improveErrorMessage.js'\n\nconst DEFAULT_NORMALIZATION = 'unbiased'\n\nconst name = 'variance'\nconst dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN']\n\nexport const createVariance = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, subtract, multiply, divide, mapSlices, isNaN: mathIsNaN }) => {\n  /**\n   * Compute the variance of a matrix or a  list with values.\n   * In case of a multidimensional array or matrix, the variance over all\n   * elements will be calculated.\n   *\n   * Additionally, it is possible to compute the variance along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Note that older browser may not like the variable name `var`. In that\n   * case, the function can be called as `math['var'](...)` instead of\n   * `math.var(...)`.\n   *\n   * Syntax:\n   *\n   *     math.variance(a, b, c, ...)\n   *     math.variance(A)\n   *     math.variance(A, normalization)\n   *     math.variance(A, dimension)\n   *     math.variance(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.variance(2, 4, 6)                     // returns 4\n   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667\n   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5\n   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4\n   *\n   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]\n   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, std, sum\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the variance for a matrix\n   * @return {*} The variance\n   */\n  return typed(name, {\n    // variance([a, b, c, d, ...])\n    'Array | Matrix': function (array) {\n      return _var(array, DEFAULT_NORMALIZATION)\n    },\n\n    // variance([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _var,\n\n    // variance([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': function (array, dim) {\n      return _varDim(array, dim, DEFAULT_NORMALIZATION)\n    },\n\n    // variance([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _varDim,\n\n    // variance(a, b, c, d, ...)\n    '...': function (args) {\n      return _var(args, DEFAULT_NORMALIZATION)\n    }\n  })\n\n  /**\n   * Recursively calculate the variance of an n-dimensional array\n   * @param {Array} array\n   * @param {string} normalization\n   *                        Determines how to normalize the variance:\n   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)\n   *                        - 'uncorrected' The sum of squared errors is divided by n\n   *                        - 'biased'      The sum of squared errors is divided by (n + 1)\n   * @return {number | BigNumber} variance\n   * @private\n   */\n  function _var (array, normalization) {\n    let sum\n    let num = 0\n\n    if (array.length === 0) {\n      throw new SyntaxError('Function variance requires one or more parameters (0 provided)')\n    }\n\n    // calculate the mean and number of elements\n    deepForEach(array, function (value) {\n      try {\n        sum = sum === undefined ? value : add(sum, value)\n        num++\n      } catch (err) {\n        throw improveErrorMessage(err, 'variance', value)\n      }\n    })\n    if (num === 0) throw new Error('Cannot calculate variance of an empty array')\n\n    const mean = divide(sum, num)\n\n    // calculate the variance\n    sum = undefined\n    deepForEach(array, function (value) {\n      const diff = subtract(value, mean)\n      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff))\n    })\n\n    if (mathIsNaN(sum)) {\n      return sum\n    }\n\n    switch (normalization) {\n      case 'uncorrected':\n        return divide(sum, num)\n\n      case 'biased':\n        return divide(sum, num + 1)\n\n      case 'unbiased':\n      {\n        const zero = isBigNumber(sum) ? sum.mul(0) : 0\n        return (num === 1) ? zero : divide(sum, num - 1)\n      }\n\n      default:\n        throw new Error('Unknown normalization \"' + normalization + '\". ' +\n        'Choose \"unbiased\" (default), \"uncorrected\", or \"biased\".')\n    }\n  }\n\n  function _varDim (array, dim, normalization) {\n    try {\n      if (array.length === 0) {\n        throw new SyntaxError('Function variance requires one or more parameters (0 provided)')\n      }\n      return mapSlices(array, dim, (x) => _var(x, normalization))\n    } catch (err) {\n      throw improveErrorMessage(err, 'variance')\n    }\n  }\n})\n","import { isNumber } from '../../utils/is.js'\nimport { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'quantileSeq'\nconst dependencies = ['typed', '?bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices']\n\nexport const createQuantileSeq = /* #__PURE__ */ factory(name, dependencies, ({ typed, bignumber, add, subtract, divide, multiply, partitionSelect, compare, isInteger, smaller, smallerEq, larger, mapSlices }) => {\n  /**\n   * Compute the prob order quantile of a matrix or a list with values.\n   * The sequence is sorted and the middle value is returned.\n   * Supported types of sequence values are: Number, BigNumber, Unit\n   * Supported types of probability are: Number, BigNumber\n   *\n   * In case of a multidimensional array or matrix, the prob order quantile\n   * of all elements will be calculated.\n   *\n   * Syntax:\n   *\n   *     math.quantileSeq(A, prob[, sorted])\n   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])\n   *     math.quantileSeq(A, N[, sorted])\n   *\n   * Examples:\n   *\n   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4\n   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]\n   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]\n   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4\n   *\n   * See also:\n   *\n   *     median, mean, min, max, sum, prod, std, variance\n   *\n   * @param {Array, Matrix} data                A single matrix or Array\n   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is\n   *                                            the amount of evenly distributed steps of\n   *                                            probabilities; only one of these options can\n   *                                            be provided\n   * @param {Boolean} sorted=false              is data sorted in ascending order\n   * @return {Number, BigNumber, Unit, Array}   Quantile(s)\n   */\n  return typed(name, {\n    'Array | Matrix, number | BigNumber': (data, p) => _quantileSeqProbNumber(data, p, false),\n    'Array | Matrix, number | BigNumber, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbNumber),\n    'Array | Matrix, number | BigNumber, boolean': _quantileSeqProbNumber,\n    'Array | Matrix, number | BigNumber, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbNumber),\n    'Array | Matrix, Array | Matrix': (data, p) => _quantileSeqProbCollection(data, p, false),\n    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbCollection),\n    'Array | Matrix, Array | Matrix, boolean': _quantileSeqProbCollection,\n    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbCollection)\n  })\n\n  function _quantileSeqDim (data, prob, sorted, dim, fn) {\n    return mapSlices(data, dim, x => fn(x, prob, sorted))\n  }\n\n  function _quantileSeqProbNumber (data, probOrN, sorted) {\n    let probArr\n    const dataArr = data.valueOf()\n    if (smaller(probOrN, 0)) {\n      throw new Error('N/prob must be non-negative')\n    }\n    if (smallerEq(probOrN, 1)) {\n      // quantileSeq([a, b, c, d, ...], prob[,sorted])\n      return isNumber(probOrN)\n        ? _quantileSeq(dataArr, probOrN, sorted)\n        : bignumber(_quantileSeq(dataArr, probOrN, sorted))\n    }\n    if (larger(probOrN, 1)) {\n      // quantileSeq([a, b, c, d, ...], N[,sorted])\n      if (!isInteger(probOrN)) {\n        throw new Error('N must be a positive integer')\n      }\n\n      // largest possible Array length is 2^32-1\n      // 2^32 < 10^15, thus safe conversion guaranteed\n      if (larger(probOrN, 4294967295)) {\n        throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array')\n      }\n\n      const nPlusOne = add(probOrN, 1)\n      probArr = []\n\n      for (let i = 0; smaller(i, probOrN); i++) {\n        const prob = divide(i + 1, nPlusOne)\n        probArr.push(_quantileSeq(dataArr, prob, sorted))\n      }\n\n      return isNumber(probOrN) ? probArr : bignumber(probArr)\n    }\n  }\n\n  /**\n   * Calculate the prob order quantile of an n-dimensional array.\n   *\n   * @param {Array, Matrix} array\n   * @param {Array, Matrix} prob\n   * @param {Boolean} sorted\n   * @return {Number, BigNumber, Unit} prob order quantile\n   * @private\n   */\n\n  function _quantileSeqProbCollection (data, probOrN, sorted) {\n    const dataArr = data.valueOf()\n    // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])\n    const probOrNArr = probOrN.valueOf()\n    const probArr = []\n    for (let i = 0; i < probOrNArr.length; ++i) {\n      probArr.push(_quantileSeq(dataArr, probOrNArr[i], sorted))\n    }\n    return probArr\n  }\n\n  /**\n   * Calculate the prob order quantile of an n-dimensional array.\n   *\n   * @param {Array} array\n   * @param {Number, BigNumber} prob\n   * @param {Boolean} sorted\n   * @return {Number, BigNumber, Unit} prob order quantile\n   * @private\n   */\n  function _quantileSeq (array, prob, sorted) {\n    const flat = flatten(array)\n    const len = flat.length\n    if (len === 0) {\n      throw new Error('Cannot calculate quantile of an empty sequence')\n    }\n\n    const index = isNumber(prob) ? prob * (len - 1) : prob.times(len - 1)\n    const integerPart = isNumber(prob) ? Math.floor(index) : index.floor().toNumber()\n    const fracPart = isNumber(prob) ? index % 1 : index.minus(integerPart)\n\n    if (isInteger(index)) {\n      return sorted\n        ? flat[index]\n        : partitionSelect(\n          flat,\n          isNumber(prob) ? index : index.valueOf()\n        )\n    }\n    let left\n    let right\n    if (sorted) {\n      left = flat[integerPart]\n      right = flat[integerPart + 1]\n    } else {\n      right = partitionSelect(flat, integerPart + 1)\n\n      // max of partition is kth largest\n      left = flat[integerPart]\n      for (let i = 0; i < integerPart; ++i) {\n        if (compare(flat[i], left) > 0) {\n          left = flat[i]\n        }\n      }\n    }\n    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]\n    return add(multiply(left, subtract(1, fracPart)), multiply(right, fracPart))\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\nconst name = 'std'\nconst dependencies = ['typed', 'map', 'sqrt', 'variance']\n\nexport const createStd = /* #__PURE__ */ factory(name, dependencies, ({ typed, map, sqrt, variance }) => {\n  /**\n   * Compute the standard deviation of a matrix or a  list with values.\n   * The standard deviations is defined as the square root of the variance:\n   * `std(A) = sqrt(variance(A))`.\n   * In case of a (multi dimensional) array or matrix, the standard deviation\n   * over all elements will be calculated by default, unless an axis is specified\n   * in which case the standard deviation will be computed along that axis.\n   *\n   * Additionally, it is possible to compute the standard deviation along the rows\n   * or columns of a matrix by specifying the dimension as the second argument.\n   *\n   * Optionally, the type of normalization can be specified as the final\n   * parameter. The parameter `normalization` can be one of the following values:\n   *\n   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)\n   * - 'uncorrected'        The sum of squared errors is divided by n\n   * - 'biased'             The sum of squared errors is divided by (n + 1)\n   *\n   *\n   * Syntax:\n   *\n   *     math.std(a, b, c, ...)\n   *     math.std(A)\n   *     math.std(A, normalization)\n   *     math.std(A, dimension)\n   *     math.std(A, dimension, normalization)\n   *\n   * Examples:\n   *\n   *     math.std(2, 4, 6)                     // returns 2\n   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611\n   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979\n   *     math.std([2, 4, 6, 8], 'biased')      // returns 2\n   *\n   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707\n   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]\n   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]\n   *\n   * See also:\n   *\n   *    mean, median, max, min, prod, sum, variance\n   *\n   * @param {Array | Matrix} array\n   *                        A single matrix or or multiple scalar values\n   * @param {string} [normalization='unbiased']\n   *                        Determines how to normalize the variance.\n   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.\n   * @param dimension {number | BigNumber}\n   *                        Determines the axis to compute the standard deviation for a matrix\n   * @return {*} The standard deviation\n   */\n  return typed(name, {\n    // std([a, b, c, d, ...])\n    'Array | Matrix': _std,\n\n    // std([a, b, c, d, ...], normalization)\n    'Array | Matrix, string': _std,\n\n    // std([a, b, c, c, ...], dim)\n    'Array | Matrix, number | BigNumber': _std,\n\n    // std([a, b, c, c, ...], dim, normalization)\n    'Array | Matrix, number | BigNumber, string': _std,\n\n    // std(a, b, c, d, ...)\n    '...': function (args) {\n      return _std(args)\n    }\n  })\n\n  function _std (array, normalization) {\n    if (array.length === 0) {\n      throw new SyntaxError('Function std requires one or more parameters (0 provided)')\n    }\n\n    try {\n      const v = variance.apply(null, arguments)\n      if (isCollection(v)) {\n        return map(v, sqrt)\n      } else {\n        return sqrt(v)\n      }\n    } catch (err) {\n      if (err instanceof TypeError && err.message.includes(' variance')) {\n        throw new TypeError(err.message.replace(' variance', ' std'))\n      } else {\n        throw err\n      }\n    }\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'corr'\nconst dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide']\n\nexport const createCorr = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, sqrt, sum, add, subtract, multiply, pow, divide }) => {\n  /**\n   * Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.\n   *\n   * Syntax:\n   *\n   *     math.corr(A, B)\n   *\n   * Examples:\n   *\n   *     math.corr([1, 2, 3, 4, 5], [4, 5, 6, 7, 8])     // returns 1\n   *     math.corr([1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8])     //returns 0.9569941688503644\n   *     math.corr([[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]],[[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]])   // returns [1,1]\n   *\n   * See also:\n   *\n   *     median, mean, min, max, sum, prod, std, variance\n   *\n   * @param {Array | Matrix} A The first array or matrix to compute correlation coefficient\n   * @param {Array | Matrix} B The second array or matrix to compute correlation coefficient\n   * @return {*} The correlation coefficient\n   */\n  return typed(name, {\n    'Array, Array': function (A, B) {\n      return _corr(A, B)\n    },\n    'Matrix, Matrix': function (A, B) {\n      const res = _corr(A.toArray(), B.toArray())\n      return Array.isArray(res) ? matrix(res) : res\n    }\n  })\n  /**\n   * Calculate the correlation coefficient between two arrays or matrices.\n   * @param {Array | Matrix} A\n   * @param {Array | Matrix} B\n   * @return {*} correlation coefficient\n   * @private\n   */\n  function _corr (A, B) {\n    const correlations = []\n    if (Array.isArray(A[0]) && Array.isArray(B[0])) {\n      if (A.length !== B.length) {\n        throw new SyntaxError('Dimension mismatch. Array A and B must have the same length.')\n      }\n      for (let i = 0; i < A.length; i++) {\n        if (A[i].length !== B[i].length) {\n          throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.')\n        }\n        correlations.push(correlation(A[i], B[i]))\n      }\n      return correlations\n    } else {\n      if (A.length !== B.length) {\n        throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.')\n      }\n      return correlation(A, B)\n    }\n  }\n  function correlation (A, B) {\n    const n = A.length\n    const sumX = sum(A)\n    const sumY = sum(B)\n    const sumXY = A.reduce((acc, x, index) => add(acc, multiply(x, B[index])), 0)\n    const sumXSquare = sum(A.map(x => pow(x, 2)))\n    const sumYSquare = sum(B.map(y => pow(y, 2)))\n    const numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY))\n    const denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))))\n    return divide(numerator, denominator)\n  }\n})\n","/** @param {number} i\n *  @param {number} n\n *  @returns {number} product of i to n\n */\nexport function product (i, n) {\n  if (n < i) {\n    return 1\n  }\n\n  if (n === i) {\n    return n\n  }\n\n  const half = (n + i) >> 1 // divide (n + i) by 2 and truncate to integer\n  return product(i, half) * product(half + 1, n)\n}\n","import { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nexport function combinationsNumber (n, k) {\n  if (!isInteger(n) || n < 0) {\n    throw new TypeError('Positive integer value expected in function combinations')\n  }\n  if (!isInteger(k) || k < 0) {\n    throw new TypeError('Positive integer value expected in function combinations')\n  }\n  if (k > n) {\n    throw new TypeError('k must be less than or equal to n')\n  }\n\n  const nMinusk = n - k\n\n  let answer = 1\n  const firstnumerator = (k < nMinusk) ? nMinusk + 1 : k + 1\n  let nextdivisor = 2\n  const lastdivisor = (k < nMinusk) ? k : nMinusk\n  // balance multiplications and divisions to try to keep intermediate values\n  // in exact-integer range as long as possible\n  for (let nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {\n    answer *= nextnumerator\n    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {\n      answer /= nextdivisor\n      ++nextdivisor\n    }\n  }\n  // for big n, k, floating point may have caused weirdness in remainder\n  if (nextdivisor <= lastdivisor) {\n    answer /= product(nextdivisor, lastdivisor)\n  }\n  return answer\n}\ncombinationsNumber.signature = 'number, number'\n","import { factory } from '../../utils/factory.js'\nimport { combinationsNumber } from '../../plain/number/combinations.js'\n\nconst name = 'combinations'\nconst dependencies = ['typed']\n\nexport const createCombinations = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities.\n   *\n   * Combinations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.combinations(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinations(7, 5) // returns 21\n   *\n   * See also:\n   *\n   *    combinationsWithRep, permutations, factorial\n   *\n   * @param {number | BigNumber} n    Total number of objects in the set\n   * @param {number | BigNumber} k    Number of objects in the subset\n   * @return {number | BigNumber}     Number of possible combinations.\n   */\n  return typed(name, {\n    'number, number': combinationsNumber,\n\n    'BigNumber, BigNumber': function (n, k) {\n      const BigNumber = n.constructor\n      let result, i\n      const nMinusk = n.minus(k)\n      const one = new BigNumber(1)\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinations')\n      }\n      if (k.gt(n)) {\n        throw new TypeError('k must be less than n in function combinations')\n      }\n\n      result = one\n      if (k.lt(nMinusk)) {\n        for (i = one; i.lte(nMinusk); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i)\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusk.plus(i)).dividedBy(i)\n        }\n      }\n\n      return result\n    }\n\n    // TODO: implement support for collection in combinations\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","import { factory } from '../../utils/factory.js'\nimport { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nconst name = 'combinationsWithRep'\nconst dependencies = ['typed']\n\nexport const createCombinationsWithRep = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Compute the number of ways of picking `k` unordered outcomes from `n`\n   * possibilities, allowing individual outcomes to be repeated more than once.\n   *\n   * CombinationsWithRep only takes integer arguments.\n   * The following condition must be enforced: k <= n + k -1.\n   *\n   * Syntax:\n   *\n   *     math.combinationsWithRep(n, k)\n   *\n   * Examples:\n   *\n   *    math.combinationsWithRep(7, 5) // returns 462\n   *\n   * See also:\n   *\n   *    combinations, permutations, factorial\n   *\n   * @param {number | BigNumber} n    Total number of objects in the set\n   * @param {number | BigNumber} k    Number of objects in the subset\n   * @return {number | BigNumber}     Number of possible combinations with replacement.\n   */\n  return typed(name, {\n    'number, number': function (n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (n < 1) {\n        throw new TypeError('k must be less than or equal to n + k - 1')\n      }\n\n      if (k < n - 1) {\n        const prodrange = product(n, n + k - 1)\n        return prodrange / product(1, k)\n      }\n      const prodrange = product(k + 1, n + k - 1)\n      return prodrange / product(1, n - 1)\n    },\n\n    'BigNumber, BigNumber': function (n, k) {\n      const BigNumber = n.constructor\n      let result, i\n      const one = new BigNumber(1)\n      const nMinusOne = n.minus(one)\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function combinationsWithRep')\n      }\n      if (n.lt(one)) {\n        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep')\n      }\n\n      result = one\n      if (k.lt(nMinusOne)) {\n        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {\n          result = result.times(k.plus(i)).dividedBy(i)\n        }\n      } else {\n        for (i = one; i.lte(k); i = i.plus(one)) {\n          result = result.times(nMinusOne.plus(i)).dividedBy(i)\n        }\n      }\n\n      return result\n    }\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","/* eslint-disable no-loss-of-precision */\n\nimport { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\n\nexport function gammaNumber (n) {\n  let x\n\n  if (isInteger(n)) {\n    if (n <= 0) {\n      return isFinite(n) ? Infinity : NaN\n    }\n\n    if (n > 171) {\n      return Infinity // Will overflow\n    }\n\n    return product(1, n - 1)\n  }\n\n  if (n < 0.5) {\n    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n))\n  }\n\n  if (n >= 171.35) {\n    return Infinity // will overflow\n  }\n\n  if (n > 85.0) { // Extended Stirling Approx\n    const twoN = n * n\n    const threeN = twoN * n\n    const fourN = threeN * n\n    const fiveN = fourN * n\n    return Math.sqrt(2 * Math.PI / n) * Math.pow((n / Math.E), n) *\n      (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) -\n        571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) +\n        5246819 / (75246796800 * fiveN * n))\n  }\n\n  --n\n  x = gammaP[0]\n  for (let i = 1; i < gammaP.length; ++i) {\n    x += gammaP[i] / (n + i)\n  }\n\n  const t = n + gammaG + 0.5\n  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x\n}\ngammaNumber.signature = 'number'\n\n// TODO: comment on the variables g and p\n\nexport const gammaG = 4.7421875\n\nexport const gammaP = [\n  0.99999999999999709182,\n  57.156235665862923517,\n  -59.597960355475491248,\n  14.136097974741747174,\n  -0.49191381609762019978,\n  0.33994649984811888699e-4,\n  0.46523628927048575665e-4,\n  -0.98374475304879564677e-4,\n  0.15808870322491248884e-3,\n  -0.21026444172410488319e-3,\n  0.21743961811521264320e-3,\n  -0.16431810653676389022e-3,\n  0.84418223983852743293e-4,\n  -0.26190838401581408670e-4,\n  0.36899182659531622704e-5\n]\n\n// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code\n\n// log(2 * pi) / 2\nexport const lnSqrt2PI = 0.91893853320467274178\n\nexport const lgammaG = 5 // Lanczos parameter \"g\"\nexport const lgammaN = 7 // Range of coefficients \"n\"\n\nexport const lgammaSeries = [\n  1.000000000190015,\n  76.18009172947146,\n  -86.50532032941677,\n  24.01409824083091,\n  -1.231739572450155,\n  0.1208650973866179e-2,\n  -0.5395239384953e-5\n]\n\nexport function lgammaNumber (n) {\n  if (n < 0) return NaN\n  if (n === 0) return Infinity\n  if (!isFinite(n)) return n\n\n  if (n < 0.5) {\n    // Use Euler's reflection formula:\n    // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))\n    return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n)\n  }\n\n  // Compute the logarithm of the Gamma function using the Lanczos method\n\n  n = n - 1\n  const base = n + lgammaG + 0.5 // Base of the Lanczos exponential\n  let sum = lgammaSeries[0]\n\n  // We start with the terms that have the smallest coefficients and largest denominator\n  for (let i = lgammaN - 1; i >= 1; i--) {\n    sum += lgammaSeries[i] / (n + i)\n  }\n\n  return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum)\n}\nlgammaNumber.signature = 'number'\n","import { factory } from '../../utils/factory.js'\nimport { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js'\n\nconst name = 'gamma'\nconst dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex']\n\nexport const createGamma = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, multiplyScalar, pow, BigNumber, Complex }) => {\n  /**\n   * Compute the gamma function of a value using Lanczos approximation for\n   * small values, and an extended Stirling approximation for large values.\n   *\n   * To avoid confusion with the matrix Gamma function, this function does\n   * not apply to matrices.\n   *\n   * Syntax:\n   *\n   *    math.gamma(n)\n   *\n   * Examples:\n   *\n   *    math.gamma(5)       // returns 24\n   *    math.gamma(-0.5)    // returns -3.5449077018110335\n   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i\n   *\n   * See also:\n   *\n   *    combinations, factorial, permutations\n   *\n   * @param {number | BigNumber | Complex} n   A real or complex number\n   * @return {number | BigNumber | Complex}    The gamma of `n`\n   */\n\n  function gammaComplex (n) {\n    if (n.im === 0) {\n      return gammaNumber(n.re)\n    }\n\n    // Lanczos approximation doesn't work well with real part lower than 0.5\n    // So reflection formula is required\n    if (n.re < 0.5) { // Euler's reflection formula\n      // gamma(1-z) * gamma(z) = PI / sin(PI * z)\n      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]\n      // thanks to imperfect sin implementation sin(PI * n) != 0\n      // we can safely use it anyway\n      const t = new Complex(1 - n.re, -n.im)\n      const r = new Complex(Math.PI * n.re, Math.PI * n.im)\n\n      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(t))\n    }\n\n    // Lanczos approximation\n    // z -= 1\n    n = new Complex(n.re - 1, n.im)\n\n    // x = gammaPval[0]\n    let x = new Complex(gammaP[0], 0)\n    // for (i, gammaPval) in enumerate(gammaP):\n    for (let i = 1; i < gammaP.length; ++i) {\n      // x += gammaPval / (z + i)\n      const gammaPval = new Complex(gammaP[i], 0)\n      x = x.add(gammaPval.div(n.add(i)))\n    }\n    // t = z + gammaG + 0.5\n    const t = new Complex(n.re + gammaG + 0.5, n.im)\n\n    // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x\n    const twoPiSqrt = Math.sqrt(2 * Math.PI)\n    const tpow = t.pow(n.add(0.5))\n    const expt = t.neg().exp()\n\n    // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]\n    return x.mul(twoPiSqrt).mul(tpow).mul(expt)\n  }\n\n  return typed(name, {\n    number: gammaNumber,\n    Complex: gammaComplex,\n    BigNumber: function (n) {\n      if (n.isInteger()) {\n        return (n.isNegative() || n.isZero())\n          ? new BigNumber(Infinity)\n          : bigFactorial(n.minus(1))\n      }\n\n      if (!n.isFinite()) {\n        return new BigNumber(n.isNegative() ? NaN : Infinity)\n      }\n\n      throw new Error('Integer BigNumber expected')\n    }\n  })\n\n  /**\n   * Calculate factorial for a BigNumber\n   * @param {BigNumber} n\n   * @returns {BigNumber} Returns the factorial of n\n   */\n  function bigFactorial (n) {\n    if (n < 8) {\n      return new BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n])\n    }\n\n    const precision = config.precision + (Math.log(n.toNumber()) | 0)\n    const Big = BigNumber.clone({ precision })\n\n    if (n % 2 === 1) {\n      return n.times(bigFactorial(new BigNumber(n - 1)))\n    }\n\n    let p = n\n    let prod = new Big(n)\n    let sum = n.toNumber()\n\n    while (p > 2) {\n      p -= 2\n      sum += p\n      prod = prod.times(sum)\n    }\n\n    return new BigNumber(prod.toPrecision(BigNumber.precision))\n  }\n})\n","/* eslint-disable no-loss-of-precision */\n\n// References\n// ----------\n// [1] Hare, \"Computing the Principal Branch of log-Gamma\", Journal of Algorithms, 1997.\n// [2] https://math.stackexchange.com/questions/1338753/how-do-i-calculate-values-for-gamma-function-with-complex-arguments\n\nimport { lgammaNumber, lnSqrt2PI } from '../../plain/number/index.js'\nimport { factory } from '../../utils/factory.js'\nimport { copysign } from '../../utils/number.js'\n\nconst name = 'lgamma'\nconst dependencies = ['Complex', 'typed']\n\nexport const createLgamma = /* #__PURE__ */ factory(name, dependencies, ({ Complex, typed }) => {\n  // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get\n  // sufficient accuracy.\n  //\n  // These two values are copied from Scipy implementation:\n  // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L37\n  const SMALL_RE = 7\n  const SMALL_IM = 7\n\n  /**\n   * The coefficients are B[2*n]/(2*n*(2*n - 1)) where B[2*n] is the (2*n)th Bernoulli number. See (1.1) in [1].\n   *\n   * If you cannot access the paper, can also get these values from the formula in [2].\n   *\n   *    1 /     12 = 0.00833333333333333333333333333333\n   *    1 /    360 = 0.00277777777777777777777777777778\n   * ...\n   * 3617 / 133400 = 0.02955065359477124183006535947712\n   */\n  const coeffs = [\n    -2.955065359477124183e-2, 6.4102564102564102564e-3, -1.9175269175269175269e-3, 8.4175084175084175084e-4,\n    -5.952380952380952381e-4, 7.9365079365079365079e-4, -2.7777777777777777778e-3, 8.3333333333333333333e-2\n  ]\n\n  /**\n   * Logarithm of the gamma function for real, positive numbers and complex numbers,\n   * using Lanczos approximation for numbers and Stirling series for complex numbers.\n   *\n   * Syntax:\n   *\n   *    math.lgamma(n)\n   *\n   * Examples:\n   *\n   *    math.lgamma(5)       // returns 3.178053830347945\n   *    math.lgamma(0)       // returns Infinity\n   *    math.lgamma(-0.5)    // returns NaN\n   *    math.lgamma(math.i)  // returns -0.6509231993018536 - 1.8724366472624294i\n   *\n   * See also:\n   *\n   *    gamma\n   *\n   * @param {number | Complex} n   A real or complex number\n   * @return {number | Complex}    The log gamma of `n`\n   */\n  return typed(name, {\n    number: lgammaNumber,\n    Complex: lgammaComplex,\n    BigNumber: function () {\n      throw new Error(\"mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber\")\n    }\n  })\n\n  function lgammaComplex (n) {\n    const TWOPI = 6.2831853071795864769252842 // 2*pi\n    const LOGPI = 1.1447298858494001741434262 // log(pi)\n\n    const REFLECTION = 0.1\n\n    if (n.isNaN()) {\n      return new Complex(NaN, NaN)\n    } else if (n.im === 0) {\n      return new Complex(lgammaNumber(n.re), 0)\n    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {\n      return lgammaStirling(n)\n    } else if (n.re <= REFLECTION) {\n      // Reflection formula. see Proposition 3.1 in [1]\n      const tmp = copysign(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25)\n      const a = n.mul(Math.PI).sin().log()\n      const b = lgammaComplex(new Complex(1 - n.re, -n.im))\n      return new Complex(LOGPI, tmp).sub(a).sub(b)\n    } else if (n.im >= 0) {\n      return lgammaRecurrence(n)\n    } else {\n      return lgammaRecurrence(n.conjugate()).conjugate()\n    }\n  }\n\n  function lgammaStirling (z) {\n    // formula ref in [2]\n    // computation ref:\n    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L101\n\n    // left part\n\n    // x (log(x) - 1) + 1/2 (log(2PI) - log(x))\n    // => (x - 0.5) * log(x) - x + log(2PI) / 2\n    const leftPart = z.sub(0.5).mul(z.log()).sub(z).add(lnSqrt2PI)\n\n    // right part\n\n    const rz = new Complex(1, 0).div(z)\n    const rzz = rz.div(z)\n\n    let a = coeffs[0]\n    let b = coeffs[1]\n    const r = 2 * rzz.re\n    const s = rzz.re * rzz.re + rzz.im * rzz.im\n\n    for (let i = 2; i < 8; i++) {\n      const tmp = b\n      b = -s * a + coeffs[i]\n      a = r * a + tmp\n    }\n\n    const rightPart = rz.mul(rzz.mul(a).add(b))\n\n    // plus left and right\n\n    return leftPart.add(rightPart)\n  }\n\n  function lgammaRecurrence (z) {\n    // computation ref:\n    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L78\n\n    let signflips = 0\n    let sb = 0\n    let shiftprod = z\n\n    z = z.add(1)\n    while (z.re <= SMALL_RE) {\n      shiftprod = shiftprod.mul(z)\n\n      const nsb = shiftprod.im < 0 ? 1 : 0\n      if (nsb !== 0 && sb === 0) signflips++\n      sb = nsb\n\n      z = z.add(1)\n    }\n\n    return lgammaStirling(z)\n      .sub(shiftprod.log())\n      .sub(new Complex(0, signflips * 2 * Math.PI * 1))\n  }\n})\n","import { deepMap } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'factorial'\nconst dependencies = ['typed', 'gamma']\n\nexport const createFactorial = /* #__PURE__ */ factory(name, dependencies, ({ typed, gamma }) => {\n  /**\n   * Compute the factorial of a value\n   *\n   * Factorial only supports an integer value as argument.\n   * For matrices, the function is evaluated element wise.\n   *\n   * Syntax:\n   *\n   *    math.factorial(n)\n   *\n   * Examples:\n   *\n   *    math.factorial(5)    // returns 120\n   *    math.factorial(3)    // returns 6\n   *\n   * See also:\n   *\n   *    combinations, combinationsWithRep, gamma, permutations\n   *\n   * @param {number | BigNumber | Array | Matrix} n   An integer number\n   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`\n   */\n  return typed(name, {\n    number: function (n) {\n      if (n < 0) {\n        throw new Error('Value must be non-negative')\n      }\n\n      return gamma(n + 1)\n    },\n\n    BigNumber: function (n) {\n      if (n.isNegative()) {\n        throw new Error('Value must be non-negative')\n      }\n\n      return gamma(n.plus(1))\n    },\n\n    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'kldivergence'\nconst dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric']\n\nexport const createKldivergence = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, divide, sum, multiply, map, dotDivide, log, isNumeric }) => {\n  /**\n     * Calculate the Kullback-Leibler (KL) divergence  between two distributions\n     *\n     * Syntax:\n     *\n     *     math.kldivergence(x, y)\n     *\n     * Examples:\n     *\n     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153\n     *\n     *\n     * @param  {Array | Matrix} q    First vector\n     * @param  {Array | Matrix} p    Second vector\n     * @return {number}              Returns distance between q and p\n     */\n  return typed(name, {\n    'Array, Array': function (q, p) {\n      return _kldiv(matrix(q), matrix(p))\n    },\n\n    'Matrix, Array': function (q, p) {\n      return _kldiv(q, matrix(p))\n    },\n\n    'Array, Matrix': function (q, p) {\n      return _kldiv(matrix(q), p)\n    },\n\n    'Matrix, Matrix': function (q, p) {\n      return _kldiv(q, p)\n    }\n\n  })\n\n  function _kldiv (q, p) {\n    const plength = p.size().length\n    const qlength = q.size().length\n    if (plength > 1) {\n      throw new Error('first object must be one dimensional')\n    }\n\n    if (qlength > 1) {\n      throw new Error('second object must be one dimensional')\n    }\n\n    if (plength !== qlength) {\n      throw new Error('Length of two vectors must be equal')\n    }\n\n    // Before calculation, apply normalization\n    const sumq = sum(q)\n    if (sumq === 0) {\n      throw new Error('Sum of elements in first object must be non zero')\n    }\n\n    const sump = sum(p)\n    if (sump === 0) {\n      throw new Error('Sum of elements in second object must be non zero')\n    }\n    const qnorm = divide(q, sum(q))\n    const pnorm = divide(p, sum(p))\n\n    const result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), x => log(x))))\n    if (isNumeric(result)) {\n      return result\n    } else {\n      return Number.NaN\n    }\n  }\n})\n","import { deepForEach } from '../../utils/collection.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'multinomial'\nconst dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive']\n\nexport const createMultinomial = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide, multiply, factorial, isInteger, isPositive }) => {\n  /**\n   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.\n   *\n   * multinomial takes one array of integers as an argument.\n   * The following condition must be enforced: every ai <= 0\n   *\n   * Syntax:\n   *\n   *     math.multinomial(a) // a is an array type\n   *\n   * Examples:\n   *\n   *    math.multinomial([1,2,1]) // returns 12\n   *\n   * See also:\n   *\n   *    combinations, factorial\n   *\n   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset\n   * @return {Number | BigNumber}         Multinomial coefficient.\n   */\n  return typed(name, {\n    'Array | Matrix': function (a) {\n      let sum = 0\n      let denom = 1\n\n      deepForEach(a, function (ai) {\n        if (!isInteger(ai) || !isPositive(ai)) {\n          throw new TypeError('Positive integer value expected in function multinomial')\n        }\n        sum = add(sum, ai)\n        denom = multiply(denom, factorial(ai))\n      })\n\n      return divide(factorial(sum), denom)\n    }\n  })\n})\n","import { isInteger } from '../../utils/number.js'\nimport { product } from '../../utils/product.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'permutations'\nconst dependencies = ['typed', 'factorial']\n\nexport const createPermutations = /* #__PURE__ */ factory(name, dependencies, ({ typed, factorial }) => {\n  /**\n   * Compute the number of ways of obtaining an ordered subset of `k` elements\n   * from a set of `n` elements.\n   *\n   * Permutations only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *     math.permutations(n)\n   *     math.permutations(n, k)\n   *\n   * Examples:\n   *\n   *    math.permutations(5)     // 120\n   *    math.permutations(5, 3)  // 60\n   *\n   * See also:\n   *\n   *    combinations, combinationsWithRep, factorial\n   *\n   * @param {number | BigNumber} n   The number of objects in total\n   * @param {number | BigNumber} [k] The number of objects in the subset\n   * @return {number | BigNumber}    The number of permutations\n   */\n  return typed(name, {\n    'number | BigNumber': factorial,\n    'number, number': function (n, k) {\n      if (!isInteger(n) || n < 0) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (!isInteger(k) || k < 0) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (k > n) {\n        throw new TypeError('second argument k must be less than or equal to first argument n')\n      }\n      // Permute n objects, k at a time\n      return product((n - k) + 1, n)\n    },\n\n    'BigNumber, BigNumber': function (n, k) {\n      let result, i\n\n      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {\n        throw new TypeError('Positive integer value expected in function permutations')\n      }\n      if (k.gt(n)) {\n        throw new TypeError('second argument k must be less than or equal to first argument n')\n      }\n\n      const one = n.mul(0).add(1)\n      result = one\n      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {\n        result = result.times(i)\n      }\n\n      return result\n    }\n\n    // TODO: implement support for collection in permutations\n  })\n})\n\n/**\n * Test whether BigNumber n is a positive integer\n * @param {BigNumber} n\n * @returns {boolean} isPositiveInteger\n */\nfunction isPositiveInteger (n) {\n  return n.isInteger() && n.gte(0)\n}\n","import seedrandom from 'seedrandom'\n\nconst singletonRandom = /* #__PURE__ */ seedrandom(Date.now())\n\nexport function createRng (randomSeed) {\n  let random\n\n  // create a new random generator with given seed\n  function setSeed (seed) {\n    random = seed === null ? singletonRandom : seedrandom(String(seed))\n  }\n\n  // initialize a seeded pseudo random number generator with config's random seed\n  setSeed(randomSeed)\n\n  // wrapper function so the rng can be updated via generator\n  function rng () {\n    return random()\n  }\n\n  return rng\n}\n","import { flatten } from '../../utils/array.js'\nimport { factory } from '../../utils/factory.js'\nimport { isMatrix, isNumber } from '../../utils/is.js'\nimport { createRng } from './util/seededRNG.js'\n\nconst name = 'pickRandom'\nconst dependencies = ['typed', 'config', '?on']\n\nexport const createPickRandom = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Random pick one or more values from a one dimensional array.\n   * Array elements are picked using a random function with uniform or weighted distribution.\n   *\n   * Syntax:\n   *\n   *     math.pickRandom(array)\n   *     math.pickRandom(array, number)\n   *     math.pickRandom(array, weights)\n   *     math.pickRandom(array, number, weights)\n   *     math.pickRandom(array, weights, number)\n   *     math.pickRandom(array, { weights, number, elementWise })\n   *\n   * Examples:\n   *\n   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution\n   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution\n   *\n   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })\n   *         // returns one of the items in the array\n   *\n   * See also:\n   *\n   *     random, randomInt\n   *\n   * @param {Array | Matrix} array     A one dimensional array\n   * @param {Int} number               An int or float\n   * @param {Array | Matrix} weights   An array of ints or floats\n   * @return {number | Array}          Returns a single random value from array when number is undefined.\n   *                                   Returns an array with the configured number of elements when number is defined.\n   */\n  return typed(name, {\n    'Array | Matrix': function (possibles) {\n      return _pickRandom(possibles, {})\n    },\n\n    'Array | Matrix, Object': function (possibles, options) {\n      return _pickRandom(possibles, options)\n    },\n\n    'Array | Matrix, number': function (possibles, number) {\n      return _pickRandom(possibles, { number })\n    },\n\n    'Array | Matrix, Array | Matrix': function (possibles, weights) {\n      return _pickRandom(possibles, { weights })\n    },\n\n    'Array | Matrix, Array | Matrix, number': function (possibles, weights, number) {\n      return _pickRandom(possibles, { number, weights })\n    },\n\n    'Array | Matrix, number, Array | Matrix': function (possibles, number, weights) {\n      return _pickRandom(possibles, { number, weights })\n    }\n  })\n\n  /**\n   * @param {Array | Matrix} possibles\n   * @param {{\n   *   number?: number,\n   *   weights?: Array | Matrix,\n   *   elementWise: boolean\n   * }} options\n   * @returns {number | Array}\n   * @private\n   */\n  function _pickRandom (possibles, { number, weights, elementWise = true }) {\n    const single = (typeof number === 'undefined')\n    if (single) {\n      number = 1\n    }\n\n    const createMatrix = isMatrix(possibles)\n      ? possibles.create\n      : isMatrix(weights)\n        ? weights.create\n        : null\n\n    possibles = possibles.valueOf() // get Array\n    if (weights) {\n      weights = weights.valueOf() // get Array\n    }\n\n    if (elementWise === true) {\n      possibles = flatten(possibles)\n      weights = flatten(weights)\n    }\n\n    let totalWeights = 0\n\n    if (typeof weights !== 'undefined') {\n      if (weights.length !== possibles.length) {\n        throw new Error('Weights must have the same length as possibles')\n      }\n\n      for (let i = 0, len = weights.length; i < len; i++) {\n        if (!isNumber(weights[i]) || weights[i] < 0) {\n          throw new Error('Weights must be an array of positive numbers')\n        }\n\n        totalWeights += weights[i]\n      }\n    }\n\n    const length = possibles.length\n\n    const result = []\n    let pick\n\n    while (result.length < number) {\n      if (typeof weights === 'undefined') {\n        pick = possibles[Math.floor(rng() * length)]\n      } else {\n        let randKey = rng() * totalWeights\n\n        for (let i = 0, len = possibles.length; i < len; i++) {\n          randKey -= weights[i]\n\n          if (randKey < 0) {\n            pick = possibles[i]\n            break\n          }\n        }\n      }\n\n      result.push(pick)\n    }\n\n    return single\n      ? result[0]\n      : createMatrix\n        ? createMatrix(result)\n        : result\n  }\n})\n","/**\n * This is a util function for generating a random matrix recursively.\n * @param {number[]} size\n * @param {function} random\n * @returns {Array}\n */\nexport function randomMatrix (size, random) {\n  const data = []\n  size = size.slice(0)\n\n  if (size.length > 1) {\n    for (let i = 0, length = size.shift(); i < length; i++) {\n      data.push(randomMatrix(size, random))\n    }\n  } else {\n    for (let i = 0, length = size.shift(); i < length; i++) {\n      data.push(random())\n    }\n  }\n\n  return data\n}\n","import { factory } from '../../utils/factory.js'\nimport { isMatrix } from '../../utils/is.js'\nimport { createRng } from './util/seededRNG.js'\nimport { randomMatrix } from './util/randomMatrix.js'\n\nconst name = 'random'\nconst dependencies = ['typed', 'config', '?on']\n\nexport const createRandom = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Return a random number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.random()                // generate a random number between 0 and 1\n   *     math.random(max)             // generate a random number between 0 and max\n   *     math.random(min, max)        // generate a random number between min and max\n   *     math.random(size)            // generate a matrix with random numbers between 0 and 1\n   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max\n   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max\n   *\n   * Examples:\n   *\n   *     math.random()       // returns a random number between 0 and 1\n   *     math.random(100)    // returns a random number between 0 and 100\n   *     math.random(30, 40) // returns a random number between 30 and 40\n   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1\n   *\n   * See also:\n   *\n   *     randomInt, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random number\n   */\n  return typed(name, {\n    '': () => _random(0, 1),\n    number: (max) => _random(0, max),\n    'number, number': (min, max) => _random(min, max),\n    'Array | Matrix': (size) => _randomMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)\n  })\n\n  function _randomMatrix (size, min, max) {\n    const res = randomMatrix(size.valueOf(), () => _random(min, max))\n    return isMatrix(size) ? size.create(res, 'number') : res\n  }\n\n  function _random (min, max) {\n    return min + rng() * (max - min)\n  }\n})\n\n// number only implementation of random, no matrix support\n// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?\nexport const createRandomNumber = /* #__PURE__ */ factory(name, ['typed', 'config', '?on'], ({ typed, config, on, matrix }) => {\n  // seeded pseudo random number generator1\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  return typed(name, {\n    '': () => _random(0, 1),\n    number: (max) => _random(0, max),\n    'number, number': (min, max) => _random(min, max)\n  })\n\n  function _random (min, max) {\n    return min + rng() * (max - min)\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { randomMatrix } from './util/randomMatrix.js'\nimport { createRng } from './util/seededRNG.js'\nimport { isMatrix } from '../../utils/is.js'\n\nconst name = 'randomInt'\nconst dependencies = ['typed', 'config', 'log2', '?on']\n\nexport const createRandomInt = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, log2, on }) => {\n  // seeded pseudo random number generator\n  let rng = createRng(config.randomSeed)\n\n  if (on) {\n    on('config', function (curr, prev) {\n      if (curr.randomSeed !== prev.randomSeed) {\n        rng = createRng(curr.randomSeed)\n      }\n    })\n  }\n\n  /**\n   * Return a random integer number larger or equal to `min` and smaller than `max`\n   * using a uniform distribution.\n   *\n   * Syntax:\n   *\n   *     math.randomInt()                // generate either 0 or 1, randomly\n   *     math.randomInt(max)             // generate a random integer between 0 and max\n   *     math.randomInt(min, max)        // generate a random integer between min and max\n   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1\n   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max\n   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max\n   *\n   * Examples:\n   *\n   *     math.randomInt(100)    // returns a random integer between 0 and 100\n   *     math.randomInt(30, 40) // returns a random integer between 30 and 40\n   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1\n   *\n   * See also:\n   *\n   *     random, pickRandom\n   *\n   * @param {Array | Matrix} [size] If provided, an array or matrix with given\n   *                                size and filled with random values is returned\n   * @param {number} [min]  Minimum boundary for the random value, included\n   * @param {number} [max]  Maximum boundary for the random value, excluded\n   * @return {number | Array | Matrix} A random integer value\n   */\n  return typed(name, {\n    '': () => _randomInt(0, 2),\n    number: (max) => _randomInt(0, max),\n    'number, number': (min, max) => _randomInt(min, max),\n    bigint: (max) => _randomBigint(0n, max),\n    'bigint, bigint': _randomBigint,\n    'Array | Matrix': (size) => _randomIntMatrix(size, 0, 1),\n    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),\n    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)\n  })\n\n  function _randomIntMatrix (size, min, max) {\n    const res = randomMatrix(size.valueOf(), () => _randomInt(min, max))\n    return isMatrix(size) ? size.create(res, 'number') : res\n  }\n\n  function _randomInt (min, max) {\n    return Math.floor(min + rng() * (max - min))\n  }\n\n  function _randomBigint (min, max) {\n    const simpleCutoff = 2n ** 30n\n    const width = max - min // number of choices\n    if (width <= simpleCutoff) { // do it with number type\n      return min + BigInt(_randomInt(0, Number(width)))\n    }\n    // Too big to choose accurately that way. Instead, choose the correct\n    // number of random bits to cover the width, and repeat until the\n    // resulting number falls within the width\n    const bits = log2(width)\n    let picked = width\n    while (picked >= width) {\n      picked = 0n\n      for (let i = 0; i < bits; ++i) {\n        picked = 2n * picked + ((rng() < 0.5) ? 0n : 1n)\n      }\n    }\n    return min + picked\n  }\n})\n","import { factory } from '../../utils/factory.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'stirlingS2'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'subtractScalar',\n  'multiplyScalar',\n  'divideScalar',\n  'pow',\n  'factorial',\n  'combinations',\n  'isNegative',\n  'isInteger',\n  'number',\n  '?bignumber',\n  'larger'\n]\n\nexport const createStirlingS2 = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    subtractScalar,\n    multiplyScalar,\n    divideScalar,\n    pow,\n    factorial,\n    combinations,\n    isNegative,\n    isInteger,\n    number,\n    bignumber,\n    larger\n  }\n) => {\n  const smallCache = []\n  const bigCache = []\n  /**\n   * The Stirling numbers of the second kind, counts the number of ways to partition\n   * a set of n labelled objects into k nonempty unlabelled subsets.\n   * stirlingS2 only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   *  If n = k or k = 1 <= n, then s(n,k) = 1\n   *  If k = 0 < n, then s(n,k) = 0\n   *\n   * Note that if either n or k is supplied as a BigNumber, the result will be\n   * as well.\n   *\n   * Syntax:\n   *\n   *   math.stirlingS2(n, k)\n   *\n   * Examples:\n   *\n   *    math.stirlingS2(5, 3) //returns 25\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     S(n,k)\n   */\n  return typed(name, {\n    'number | BigNumber, number | BigNumber': function (n, k) {\n      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {\n        throw new TypeError('Non-negative integer value expected in function stirlingS2')\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function stirlingS2')\n      }\n\n      const big = !(isNumber(n) && isNumber(k))\n      const cache = big ? bigCache : smallCache\n      const make = big ? bignumber : number\n      const nn = number(n)\n      const nk = number(k)\n      /* See if we already have the value: */\n      if (cache[nn] && cache[nn].length > nk) {\n        return cache[nn][nk]\n      }\n      /* Fill the cache */\n      for (let m = 0; m <= nn; ++m) {\n        if (!cache[m]) {\n          cache[m] = [m === 0 ? make(1) : make(0)]\n        }\n        if (m === 0) continue\n        const row = cache[m]\n        const prev = cache[m - 1]\n        for (let i = row.length; i <= m && i <= nk; ++i) {\n          if (i === m) {\n            row[i] = 1\n          } else {\n            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1])\n          }\n        }\n      }\n      return cache[nn][nk]\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'bellNumbers'\nconst dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2']\n\nexport const createBellNumbers = /* #__PURE__ */ factory(name, dependencies, ({ typed, addScalar, isNegative, isInteger, stirlingS2 }) => {\n  /**\n   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.\n   * bellNumbers only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.bellNumbers(n)\n   *\n   * Examples:\n   *\n   *    math.bellNumbers(3) // returns 5\n   *    math.bellNumbers(8) // returns 4140\n   *\n   * See also:\n   *\n   *    stirlingS2\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @return {Number | BigNumber}     B(n)\n   */\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function bellNumbers')\n      }\n\n      // Sum (k=0, n) S(n,k).\n      let result = 0\n      for (let i = 0; i <= n; i++) {\n        result = addScalar(result, stirlingS2(n, i))\n      }\n\n      return result\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'catalan'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'divideScalar',\n  'multiplyScalar',\n  'combinations',\n  'isNegative',\n  'isInteger'\n]\n\nexport const createCatalan = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    divideScalar,\n    multiplyScalar,\n    combinations,\n    isNegative,\n    isInteger\n  }\n) => {\n  /**\n   * The Catalan Numbers enumerate combinatorial structures of many different types.\n   * catalan only takes integer arguments.\n   * The following condition must be enforced: n >= 0\n   *\n   * Syntax:\n   *\n   *   math.catalan(n)\n   *\n   * Examples:\n   *\n   *    math.catalan(3) // returns 5\n   *    math.catalan(8) // returns 1430\n   *\n   * See also:\n   *\n   *    bellNumbers\n   *\n   * @param {Number | BigNumber} n    nth Catalan number\n   * @return {Number | BigNumber}     Cn(n)\n   */\n  return typed(name, {\n    'number | BigNumber': function (n) {\n      if (!isInteger(n) || isNegative(n)) {\n        throw new TypeError('Non-negative integer value expected in function catalan')\n      }\n\n      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'composition'\nconst dependencies = [\n  'typed',\n  'addScalar',\n  'combinations',\n  'isNegative',\n  'isPositive',\n  'isInteger',\n  'larger'\n]\n\nexport const createComposition = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    addScalar,\n    combinations,\n    isPositive,\n    isNegative,\n    isInteger,\n    larger\n  }\n) => {\n  /**\n   * The composition counts of n into k parts.\n   *\n   * composition only takes integer arguments.\n   * The following condition must be enforced: k <= n.\n   *\n   * Syntax:\n   *\n   *   math.composition(n, k)\n   *\n   * Examples:\n   *\n   *    math.composition(5, 3) // returns 6\n   *\n   * See also:\n   *\n   *    combinations\n   *\n   * @param {Number | BigNumber} n    Total number of objects in the set\n   * @param {Number | BigNumber} k    Number of objects in the subset\n   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.\n   */\n  return typed(name, {\n    'number | BigNumber, number | BigNumber': function (n, k) {\n      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {\n        throw new TypeError('Positive integer value expected in function composition')\n      } else if (larger(k, n)) {\n        throw new TypeError('k must be less than or equal to n in function composition')\n      }\n\n      return combinations(addScalar(n, -1), addScalar(k, -1))\n    }\n  })\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'leafCount'\nconst dependencies = [\n  'parse',\n  'typed'\n]\n\nexport const createLeafCount = /* #__PURE__ */ factory(name, dependencies, ({\n  parse,\n  typed\n}) => {\n  // This does the real work, but we don't have to recurse through\n  // a typed call if we separate it out\n  function countLeaves (node) {\n    let count = 0\n    node.forEach(n => { count += countLeaves(n) })\n    return count || 1\n  }\n\n  /**\n   * Gives the number of \"leaf nodes\" in the parse tree of the given expression\n   * A leaf node is one that has no subexpressions, essentially either a\n   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the\n   * unary factorial operator does not add a leaf. On the other hand,\n   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.\n   *\n   * The `simplify()` function should generally not increase the `leafCount()`\n   * of an expression, although currently there is no guarantee that it never\n   * does so. In many cases, `simplify()` reduces the leaf count.\n   *\n   * Syntax:\n   *\n   *     math.leafCount(expr)\n   *\n   * Examples:\n   *\n   *     math.leafCount('x') // 1\n   *     math.leafCount(math.parse('a*d-b*c')) // 4\n   *     math.leafCount('[a,b;c,d][0,1]') // 6\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param {Node|string} expr    The expression to count the leaves of\n   *\n   * @return {number}  The number of leaves of `expr`\n   *\n   */\n  return typed(name, {\n    Node: function (expr) {\n      return countLeaves(expr)\n    }\n  })\n})\n","import { isConstantNode, isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js'\nexport { isConstantNode, isSymbolNode as isVariableNode } from '../../../utils/is.js'\n\nexport function isNumericNode (x) {\n  return isConstantNode(x) || (isOperatorNode(x) && x.isUnary() && isConstantNode(x.args[0]))\n}\n\nexport function isConstantExpression (x) {\n  if (isConstantNode(x)) { // Basic Constant types\n    return true\n  }\n  if ((isFunctionNode(x) || isOperatorNode(x)) && x.args.every(isConstantExpression)) { // Can be constant depending on arguments\n    return true\n  }\n  if (isParenthesisNode(x) && isConstantExpression(x.content)) { // Parenthesis are transparent\n    return true\n  }\n  return false // Probably missing some edge cases\n}\n","import { isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js'\nimport { factory } from '../../../utils/factory.js'\nimport { hasOwnProperty } from '../../../utils/object.js'\n\nconst name = 'simplifyUtil'\nconst dependencies = [\n  'FunctionNode',\n  'OperatorNode',\n  'SymbolNode'\n]\n\nexport const createUtil = /* #__PURE__ */ factory(name, dependencies, ({ FunctionNode, OperatorNode, SymbolNode }) => {\n  // TODO commutative/associative properties rely on the arguments\n  // e.g. multiply is not commutative for matrices\n  // The properties should be calculated from an argument to simplify, or possibly something in math.config\n  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments\n\n  /* So that properties of an operator fit on one line: */\n  const T = true\n  const F = false\n\n  const defaultName = 'defaultF'\n  const defaultContext = {\n    /*      */ add: { trivial: T, total: T, commutative: T, associative: T },\n    /**/ unaryPlus: { trivial: T, total: T, commutative: T, associative: T },\n    /* */ subtract: { trivial: F, total: T, commutative: F, associative: F },\n    /* */ multiply: { trivial: T, total: T, commutative: T, associative: T },\n    /*   */ divide: { trivial: F, total: T, commutative: F, associative: F },\n    /*    */ paren: { trivial: T, total: T, commutative: T, associative: F },\n    /* */ defaultF: { trivial: F, total: T, commutative: F, associative: F }\n  }\n  const realContext = { divide: { total: F }, log: { total: F } }\n  const positiveContext = {\n    subtract: { total: F },\n    abs: { trivial: T },\n    log: { total: T }\n  }\n\n  function hasProperty (nodeOrName, property, context = defaultContext) {\n    let name = defaultName\n    if (typeof nodeOrName === 'string') {\n      name = nodeOrName\n    } else if (isOperatorNode(nodeOrName)) {\n      name = nodeOrName.fn.toString()\n    } else if (isFunctionNode(nodeOrName)) {\n      name = nodeOrName.name\n    } else if (isParenthesisNode(nodeOrName)) {\n      name = 'paren'\n    }\n    if (hasOwnProperty(context, name)) {\n      const properties = context[name]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n      if (hasOwnProperty(defaultContext, name)) {\n        return defaultContext[name][property]\n      }\n    }\n    if (hasOwnProperty(context, defaultName)) {\n      const properties = context[defaultName]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n      return defaultContext[defaultName][property]\n    }\n    /* name not found in context and context has no global default */\n    /* So use default context. */\n    if (hasOwnProperty(defaultContext, name)) {\n      const properties = defaultContext[name]\n      if (hasOwnProperty(properties, property)) {\n        return properties[property]\n      }\n    }\n    return defaultContext[defaultName][property]\n  }\n\n  function isCommutative (node, context = defaultContext) {\n    return hasProperty(node, 'commutative', context)\n  }\n\n  function isAssociative (node, context = defaultContext) {\n    return hasProperty(node, 'associative', context)\n  }\n\n  /**\n   * Merge the given contexts, with primary overriding secondary\n   * wherever they might conflict\n   */\n  function mergeContext (primary, secondary) {\n    const merged = { ...primary }\n    for (const prop in secondary) {\n      if (hasOwnProperty(primary, prop)) {\n        merged[prop] = { ...secondary[prop], ...primary[prop] }\n      } else {\n        merged[prop] = secondary[prop]\n      }\n    }\n    return merged\n  }\n\n  /**\n   * Flatten all associative operators in an expression tree.\n   * Assumes parentheses have already been removed.\n   */\n  function flatten (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return node\n    }\n    node.args = allChildren(node, context)\n    for (let i = 0; i < node.args.length; i++) {\n      flatten(node.args[i], context)\n    }\n  }\n\n  /**\n   * Get the children of a node as if it has been flattened.\n   * TODO implement for FunctionNodes\n   */\n  function allChildren (node, context) {\n    let op\n    const children = []\n    const findChildren = function (node) {\n      for (let i = 0; i < node.args.length; i++) {\n        const child = node.args[i]\n        if (isOperatorNode(child) && op === child.op) {\n          findChildren(child)\n        } else {\n          children.push(child)\n        }\n      }\n    }\n\n    if (isAssociative(node, context)) {\n      op = node.op\n      findChildren(node)\n      return children\n    } else {\n      return node.args\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a right-heavy binary tree.\n   */\n  function unflattenr (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return\n    }\n    const makeNode = createMakeNodeFunction(node)\n    const l = node.args.length\n    for (let i = 0; i < l; i++) {\n      unflattenr(node.args[i], context)\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      let curnode = node.args.pop()\n      while (node.args.length > 0) {\n        curnode = makeNode([node.args.pop(), curnode])\n      }\n      node.args = curnode.args\n    }\n  }\n\n  /**\n   *  Unflatten all flattened operators to a left-heavy binary tree.\n   */\n  function unflattenl (node, context) {\n    if (!node.args || node.args.length === 0) {\n      return\n    }\n    const makeNode = createMakeNodeFunction(node)\n    const l = node.args.length\n    for (let i = 0; i < l; i++) {\n      unflattenl(node.args[i], context)\n    }\n    if (l > 2 && isAssociative(node, context)) {\n      let curnode = node.args.shift()\n      while (node.args.length > 0) {\n        curnode = makeNode([curnode, node.args.shift()])\n      }\n      node.args = curnode.args\n    }\n  }\n\n  function createMakeNodeFunction (node) {\n    if (isOperatorNode(node)) {\n      return function (args) {\n        try {\n          return new OperatorNode(node.op, node.fn, args, node.implicit)\n        } catch (err) {\n          console.error(err)\n          return []\n        }\n      }\n    } else {\n      return function (args) {\n        return new FunctionNode(new SymbolNode(node.name), args)\n      }\n    }\n  }\n\n  return {\n    createMakeNodeFunction,\n    hasProperty,\n    isCommutative,\n    isAssociative,\n    mergeContext,\n    flatten,\n    allChildren,\n    unflattenr,\n    unflattenl,\n    defaultContext,\n    realContext,\n    positiveContext\n  }\n})\n","import { isParenthesisNode } from '../../utils/is.js'\nimport { isConstantNode, isVariableNode, isNumericNode, isConstantExpression } from './simplify/wildcards.js'\nimport { factory } from '../../utils/factory.js'\nimport { createUtil } from './simplify/util.js'\nimport { hasOwnProperty } from '../../utils/object.js'\nimport { createEmptyMap, createMap } from '../../utils/map.js'\n\nconst name = 'simplify'\nconst dependencies = [\n  'typed',\n  'parse',\n  'equal',\n  'resolve',\n  'simplifyConstant',\n  'simplifyCore',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode',\n  'replacer'\n]\n\nexport const createSimplify = /* #__PURE__ */ factory(name, dependencies, (\n  {\n    typed,\n    parse,\n    equal,\n    resolve,\n    simplifyConstant,\n    simplifyCore,\n    AccessorNode,\n    ArrayNode,\n    ConstantNode,\n    FunctionNode,\n    IndexNode,\n    ObjectNode,\n    OperatorNode,\n    ParenthesisNode,\n    SymbolNode,\n    replacer\n  }\n) => {\n  const { hasProperty, isCommutative, isAssociative, mergeContext, flatten, unflattenr, unflattenl, createMakeNodeFunction, defaultContext, realContext, positiveContext } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n\n  /**\n   * Simplify an expression tree.\n   *\n   * A list of rules are applied to an expression, repeating over the list until\n   * no further changes are made.\n   * It's possible to pass a custom set of rules to the function as second\n   * argument. A rule can be specified as an object, string, or function:\n   *\n   *     const rules = [\n   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },\n   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',\n   *       function (node) {\n   *         // ... return a new node or return the node unchanged\n   *         return node\n   *       }\n   *     ]\n   *\n   * String and object rules consist of a left and right pattern. The left is\n   * used to match against the expression and the right determines what matches\n   * are replaced with. The main difference between a pattern and a normal\n   * expression is that variables starting with the following characters are\n   * interpreted as wildcards:\n   *\n   * - 'n' - Matches any node [Node]\n   * - 'c' - Matches a constant literal (5 or 3.2) [ConstantNode]\n   * - 'cl' - Matches a constant literal; same as c [ConstantNode]\n   * - 'cd' - Matches a decimal literal (5 or -3.2) [ConstantNode or unaryMinus wrapping a ConstantNode]\n   * - 'ce' - Matches a constant expression (-5 or √3) [Expressions consisting of only ConstantNodes, functions, and operators]\n   * - 'v' - Matches a variable; anything not matched by c (-5 or x) [Node that is not a ConstantNode]\n   * - 'vl' - Matches a variable literal (x or y) [SymbolNode]\n   * - 'vd' - Matches a non-decimal expression; anything not matched by cd (x or √3) [Node that is not a ConstantNode or unaryMinus that is wrapping a ConstantNode]\n   * - 've' - Matches a variable expression; anything not matched by ce (x or 2x) [Expressions that contain a SymbolNode or other non-constant term]\n   *\n   * The default list of rules is exposed on the function as `simplify.rules`\n   * and can be used as a basis to built a set of custom rules. Note that since\n   * the `simplifyCore` function is in the default list of rules, by default\n   * simplify will convert any function calls in the expression that have\n   * operator equivalents to their operator forms.\n   *\n   * To specify a rule as a string, separate the left and right pattern by '->'\n   * When specifying a rule as an object, the following keys are meaningful:\n   * - l - the left pattern\n   * - r - the right pattern\n   * - s - in lieu of l and r, the string form that is broken at -> to give them\n   * - repeat - whether to repeat this rule until the expression stabilizes\n   * - assuming - gives a context object, as in the 'context' option to\n   *     simplify. Every property in the context object must match the current\n   *     context in order, or else the rule will not be applied.\n   * - imposeContext - gives a context object, as in the 'context' option to\n   *     simplify. Any settings specified will override the incoming context\n   *     for all matches of this rule.\n   *\n   * For more details on the theory, see:\n   *\n   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)\n   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)\n   *\n   *  An optional `options` argument can be passed as last argument of `simplify`.\n   *  Currently available options (defaults in parentheses):\n   *  - `consoleDebug` (false): whether to write the expression being simplified\n   *    and any changes to it, along with the rule responsible, to console\n   *  - `context` (simplify.defaultContext): an object giving properties of\n   *    each operator, which determine what simplifications are allowed. The\n   *    currently meaningful properties are commutative, associative,\n   *    total (whether the operation is defined for all arguments), and\n   *    trivial (whether the operation applied to a single argument leaves\n   *    that argument unchanged). The default context is very permissive and\n   *    allows almost all simplifications. Only properties differing from\n   *    the default need to be specified; the default context is used as a\n   *    fallback. Additional contexts `simplify.realContext` and\n   *    `simplify.positiveContext` are supplied to cause simplify to perform\n   *    just simplifications guaranteed to preserve all values of the expression\n   *    assuming all variables and subexpressions are real numbers or\n   *    positive real numbers, respectively. (Note that these are in some cases\n   *    more restrictive than the default context; for example, the default\n   *    context will allow `x/x` to simplify to 1, whereas\n   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)\n   *  - `exactFractions` (true): whether to try to convert all constants to\n   *    exact rational numbers.\n   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will\n   *    be expressed as fractions only when both numerator and denominator\n   *    are smaller than `fractionsLimit`.\n   *\n   * Syntax:\n   *\n   *     math.simplify(expr)\n   *     math.simplify(expr, rules)\n   *     math.simplify(expr, rules)\n   *     math.simplify(expr, rules, scope)\n   *     math.simplify(expr, rules, scope, options)\n   *     math.simplify(expr, scope)\n   *     math.simplify(expr, scope, options)\n   *\n   * Examples:\n   *\n   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node \"2 * x\"\n   *     math.simplify('2 * 3 * x', {x: 4})        // Node \"24\"\n   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')\n   *     math.simplify(f)                          // Node \"2 * x\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node \"x * 2 / 5\"\n   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node \"0.4 * x\"\n   *\n   * See also:\n   *\n   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve\n   *\n   * @param {Node | string} expr\n   *            The expression to be simplified\n   * @param {SimplifyRule[]} [rules]\n   *            Optional list with custom rules\n   * @param {Object} [scope] Optional scope with variables\n   * @param {SimplifyOptions} [options] Optional configuration settings\n   * @return {Node} Returns the simplified form of `expr`\n   */\n  typed.addConversion({ from: 'Object', to: 'Map', convert: createMap })\n  const simplify = typed('simplify', {\n    Node: _simplify,\n    'Node, Map': (expr, scope) => _simplify(expr, false, scope),\n    'Node, Map, Object':\n      (expr, scope, options) => _simplify(expr, false, scope, options),\n    'Node, Array': _simplify,\n    'Node, Array, Map': _simplify,\n    'Node, Array, Map, Object': _simplify\n  })\n  typed.removeConversion({ from: 'Object', to: 'Map', convert: createMap })\n\n  simplify.defaultContext = defaultContext\n  simplify.realContext = realContext\n  simplify.positiveContext = positiveContext\n\n  function removeParens (node) {\n    return node.transform(function (node) {\n      return isParenthesisNode(node)\n        ? removeParens(node.content)\n        : node\n    })\n  }\n\n  // All constants that are allowed in rules\n  const SUPPORTED_CONSTANTS = {\n    true: true,\n    false: true,\n    e: true,\n    i: true,\n    Infinity: true,\n    LN2: true,\n    LN10: true,\n    LOG2E: true,\n    LOG10E: true,\n    NaN: true,\n    phi: true,\n    pi: true,\n    SQRT1_2: true,\n    SQRT2: true,\n    tau: true\n    // null: false,\n    // undefined: false,\n    // version: false,\n  }\n\n  // Array of strings, used to build the ruleSet.\n  // Each l (left side) and r (right side) are parsed by\n  // the expression parser into a node tree.\n  // Left hand sides are matched to subtrees within the\n  // expression to be parsed and replaced with the right\n  // hand side.\n  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])\n  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.\n  // It is possible to get into an infinite loop with conflicting rules\n  simplify.rules = [\n    simplifyCore,\n    // { l: 'n+0', r: 'n' },     // simplifyCore\n    // { l: 'n^0', r: '1' },     // simplifyCore\n    // { l: '0*n', r: '0' },     // simplifyCore\n    // { l: 'n/n', r: '1'},      // simplifyCore\n    // { l: 'n^1', r: 'n' },     // simplifyCore\n    // { l: '+n1', r:'n1' },     // simplifyCore\n    // { l: 'n--n1', r:'n+n1' }, // simplifyCore\n    { l: 'log(e)', r: '1' },\n\n    // temporary rules\n    // Note initially we tend constants to the right because like-term\n    // collection prefers the left, and we would rather collect nonconstants\n    {\n      s: 'n-n1 -> n+-n1', // temporarily replace 'subtract' so we can further flatten the 'add' operator\n      assuming: { subtract: { total: true } }\n    },\n    {\n      s: 'n-n -> 0', // partial alternative when we can't always subtract\n      assuming: { subtract: { total: false } }\n    },\n    {\n      s: '-(cl*v) -> v * (-cl)', // make non-constant terms positive\n      assuming: { multiply: { commutative: true }, subtract: { total: true } }\n    },\n    {\n      s: '-(cl*v) -> (-cl) * v', // non-commutative version, part 1\n      assuming: { multiply: { commutative: false }, subtract: { total: true } }\n    },\n    {\n      s: '-(v*cl) -> v * (-cl)', // non-commutative version, part 2\n      assuming: { multiply: { commutative: false }, subtract: { total: true } }\n    },\n    { l: '-(n1/n2)', r: '-n1/n2' },\n    { l: '-v', r: 'v * (-1)' }, // finish making non-constant terms positive\n    { l: '(n1 + n2)*(-1)', r: 'n1*(-1) + n2*(-1)', repeat: true }, // expand negations to achieve as much sign cancellation as possible\n    { l: 'n/n1^n2', r: 'n*n1^-n2' }, // temporarily replace 'divide' so we can further flatten the 'multiply' operator\n    { l: 'n/n1', r: 'n*n1^-1' },\n    {\n      s: '(n1*n2)^n3 -> n1^n3 * n2^n3',\n      assuming: { multiply: { commutative: true } }\n    },\n    {\n      s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',\n      assuming: { multiply: { commutative: false } }\n    },\n\n    // expand nested exponentiation\n    {\n      s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',\n      assuming: { divide: { total: true } } // 1/(1/n) = n needs 1/n to exist\n    },\n\n    // collect like factors; into a sum, only do this for nonconstants\n    { l: ' vd   * ( vd   * n1 + n2)', r: 'vd^2       * n1 +  vd   * n2' },\n    {\n      s: ' vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2',\n      assuming: { divide: { total: true } } // v*1/v = v^(1+-1) needs 1/v\n    },\n    {\n      s: 'vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2',\n      assuming: { divide: { total: true } }\n    },\n    {\n      s: 'vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2',\n      assuming: { divide: { total: true } }\n    },\n    { l: 'n*n', r: 'n^2' },\n    {\n      s: 'n * n^n1 -> n^(n1+1)',\n      assuming: { divide: { total: true } } // n*1/n = n^(-1+1) needs 1/n\n    },\n    {\n      s: 'n^n1 * n^n2 -> n^(n1+n2)',\n      assuming: { divide: { total: true } } // ditto for n^2*1/n^2\n    },\n\n    // Unfortunately, to deal with more complicated cancellations, it\n    // becomes necessary to simplify constants twice per pass. It's not\n    // terribly expensive compared to matching rules, so this should not\n    // pose a performance problem.\n    simplifyConstant, // First: before collecting like terms\n\n    // collect like terms\n    {\n      s: 'n+n -> 2*n',\n      assuming: { add: { total: true } } // 2 = 1 + 1 needs to exist\n    },\n    { l: 'n+-n', r: '0' },\n    { l: 'vd*n + vd', r: 'vd*(n+1)' }, // NOTE: leftmost position is special:\n    { l: 'n3*n1 + n3*n2', r: 'n3*(n1+n2)' }, // All sub-monomials tried there.\n    { l: 'n3^(-n4)*n1 +   n3  * n2', r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)' },\n    { l: 'n3^(-n4)*n1 + n3^n5 * n2', r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)' },\n    // noncommutative additional cases (term collection & factoring)\n    {\n      s: 'n*vd + vd -> (n+1)*vd',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'vd + n*vd -> (1+n)*vd',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n^n1 * n -> n^(n1+1)',\n      assuming: { divide: { total: true }, multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',\n      assuming: { multiply: { commutative: false } }\n    },\n    { l: 'n*cd + cd', r: '(n+1)*cd' },\n    {\n      s: 'cd*n + cd -> cd*(n+1)',\n      assuming: { multiply: { commutative: false } }\n    },\n    {\n      s: 'cd + cd*n -> cd*(1+n)',\n      assuming: { multiply: { commutative: false } }\n    },\n    simplifyConstant, // Second: before returning expressions to \"standard form\"\n\n    // make factors positive (and undo 'make non-constant terms positive')\n    {\n      s: '(-n)*n1 -> -(n*n1)',\n      assuming: { subtract: { total: true } }\n    },\n    {\n      s: 'n1*(-n) -> -(n1*n)', // in case * non-commutative\n      assuming: { subtract: { total: true }, multiply: { commutative: false } }\n    },\n\n    // final ordering of constants\n    {\n      s: 'ce+ve -> ve+ce',\n      assuming: { add: { commutative: true } },\n      imposeContext: { add: { commutative: false } }\n    },\n    {\n      s: 'vd*cd -> cd*vd',\n      assuming: { multiply: { commutative: true } },\n      imposeContext: { multiply: { commutative: false } }\n    },\n\n    // undo temporary rules\n    // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant\n    { l: 'n+-n1', r: 'n-n1' }, // undo replace 'subtract'\n    { l: 'n+-(n1)', r: 'n-(n1)' },\n    {\n      s: 'n*(n1^-1) -> n/n1', // undo replace 'divide'; for * commutative\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    {\n      s: 'n*n1^-n2 -> n/n1^n2',\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    {\n      s: 'n^-1 -> 1/n',\n      assuming: { multiply: { commutative: true } } // o.w. / not conventional\n    },\n    { l: 'n^1', r: 'n' }, // can be produced by power cancellation\n    {\n      s: 'n*(n1/n2) -> (n*n1)/n2', // '*' before '/'\n      assuming: { multiply: { associative: true } }\n    },\n    {\n      s: 'n-(n1+n2) -> n-n1-n2', // '-' before '+'\n      assuming: { addition: { associative: true, commutative: true } }\n    },\n    // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },\n    // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },\n\n    // simplifyConstant can leave an extra factor of 1, which can always\n    // be eliminated, since the identity always commutes\n    { l: '1*n', r: 'n', imposeContext: { multiply: { commutative: true } } },\n\n    {\n      s: 'n1/(n2/n3) -> (n1*n3)/n2',\n      assuming: { multiply: { associative: true } }\n    },\n\n    { l: 'n1/(-n2)', r: '-n1/n2' }\n\n  ]\n\n  /**\n   * Takes any rule object as allowed by the specification in simplify\n   * and puts it in a standard form used by applyRule\n   */\n  function _canonicalizeRule (ruleObject, context) {\n    const newRule = {}\n    if (ruleObject.s) {\n      const lr = ruleObject.s.split('->')\n      if (lr.length === 2) {\n        newRule.l = lr[0]\n        newRule.r = lr[1]\n      } else {\n        throw SyntaxError('Could not parse rule: ' + ruleObject.s)\n      }\n    } else {\n      newRule.l = ruleObject.l\n      newRule.r = ruleObject.r\n    }\n    newRule.l = removeParens(parse(newRule.l))\n    newRule.r = removeParens(parse(newRule.r))\n    for (const prop of ['imposeContext', 'repeat', 'assuming']) {\n      if (prop in ruleObject) {\n        newRule[prop] = ruleObject[prop]\n      }\n    }\n    if (ruleObject.evaluate) {\n      newRule.evaluate = parse(ruleObject.evaluate)\n    }\n\n    if (isAssociative(newRule.l, context)) {\n      const nonCommutative = !isCommutative(newRule.l, context)\n      let leftExpandsym\n      // Gen. the LHS placeholder used in this NC-context specific expansion rules\n      if (nonCommutative) leftExpandsym = _getExpandPlaceholderSymbol()\n\n      const makeNode = createMakeNodeFunction(newRule.l)\n      const expandsym = _getExpandPlaceholderSymbol()\n      newRule.expanded = {}\n      newRule.expanded.l = makeNode([newRule.l, expandsym])\n      // Push the expandsym into the deepest possible branch.\n      // This helps to match the newRule against nodes returned from getSplits() later on.\n      flatten(newRule.expanded.l, context)\n      unflattenr(newRule.expanded.l, context)\n      newRule.expanded.r = makeNode([newRule.r, expandsym])\n\n      // In and for a non-commutative context, attempting with yet additional expansion rules makes\n      // way for more matches cases of multi-arg expressions; such that associative rules (such as\n      // 'n*n -> n^2') can be applied to exprs. such as 'a * b * b' and 'a * b * b * a'.\n      if (nonCommutative) {\n        // 'Non-commutative' 1: LHS (placeholder) only\n        newRule.expandedNC1 = {}\n        newRule.expandedNC1.l = makeNode([leftExpandsym, newRule.l])\n        newRule.expandedNC1.r = makeNode([leftExpandsym, newRule.r])\n        // 'Non-commutative' 2: farmost LHS and RHS placeholders\n        newRule.expandedNC2 = {}\n        newRule.expandedNC2.l = makeNode([leftExpandsym, newRule.expanded.l])\n        newRule.expandedNC2.r = makeNode([leftExpandsym, newRule.expanded.r])\n      }\n    }\n\n    return newRule\n  }\n\n  /**\n   * Parse the string array of rules into nodes\n   *\n   * Example syntax for rules:\n   *\n   * Position constants to the left in a product:\n   * { l: 'n1 * c1', r: 'c1 * n1' }\n   * n1 is any Node, and c1 is a ConstantNode.\n   *\n   * Apply difference of squares formula:\n   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }\n   * n1, n2 mean any Node.\n   *\n   * Short hand notation:\n   * 'n1 * c1 -> c1 * n1'\n   */\n  function _buildRules (rules, context) {\n    // Array of rules to be used to simplify expressions\n    const ruleSet = []\n    for (let i = 0; i < rules.length; i++) {\n      let rule = rules[i]\n      let newRule\n      const ruleType = typeof rule\n      switch (ruleType) {\n        case 'string':\n          rule = { s: rule }\n        /* falls through */\n        case 'object':\n          newRule = _canonicalizeRule(rule, context)\n          break\n        case 'function':\n          newRule = rule\n          break\n        default:\n          throw TypeError('Unsupported type of rule: ' + ruleType)\n      }\n      // console.log('Adding rule: ' + rules[i])\n      // console.log(newRule)\n      ruleSet.push(newRule)\n    }\n    return ruleSet\n  }\n\n  let _lastsym = 0\n  function _getExpandPlaceholderSymbol () {\n    return new SymbolNode('_p' + _lastsym++)\n  }\n\n  function _simplify (expr, rules, scope = createEmptyMap(), options = {}) {\n    const debug = options.consoleDebug\n    rules = _buildRules(rules || simplify.rules, options.context)\n    let res = resolve(expr, scope)\n    res = removeParens(res)\n    const visited = {}\n    let str = res.toString({ parenthesis: 'all' })\n    while (!visited[str]) {\n      visited[str] = true\n      _lastsym = 0 // counter for placeholder symbols\n      let laststr = str\n      if (debug) console.log('Working on: ', str)\n      for (let i = 0; i < rules.length; i++) {\n        let rulestr = ''\n        if (typeof rules[i] === 'function') {\n          res = rules[i](res, options)\n          if (debug) rulestr = rules[i].name\n        } else {\n          flatten(res, options.context)\n          res = applyRule(res, rules[i], options.context)\n          if (debug) {\n            rulestr = `${rules[i].l.toString()} -> ${rules[i].r.toString()}`\n          }\n        }\n        if (debug) {\n          const newstr = res.toString({ parenthesis: 'all' })\n          if (newstr !== laststr) {\n            console.log('Applying', rulestr, 'produced', newstr)\n            laststr = newstr\n          }\n        }\n        /* Use left-heavy binary tree internally,\n         * since custom rule functions may expect it\n         */\n        unflattenl(res, options.context)\n      }\n      str = res.toString({ parenthesis: 'all' })\n    }\n    return res\n  }\n\n  function mapRule (nodes, rule, context) {\n    let resNodes = nodes\n    if (nodes) {\n      for (let i = 0; i < nodes.length; ++i) {\n        const newNode = applyRule(nodes[i], rule, context)\n        if (newNode !== nodes[i]) {\n          if (resNodes === nodes) {\n            resNodes = nodes.slice()\n          }\n          resNodes[i] = newNode\n        }\n      }\n    }\n    return resNodes\n  }\n\n  /**\n   * Returns a simplfied form of node, or the original node if no simplification was possible.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {Object | Function} rule\n   * @param  {Object} context -- information about assumed properties of operators\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.\n   */\n  function applyRule (node, rule, context) {\n    //    console.log('Entering applyRule(\"', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '\",', node.toString({parenthesis:'all'}),')')\n\n    // check that the assumptions for this rule are satisfied by the current\n    // context:\n    if (rule.assuming) {\n      for (const symbol in rule.assuming) {\n        for (const property in rule.assuming[symbol]) {\n          if (hasProperty(symbol, property, context) !==\n              rule.assuming[symbol][property]) {\n            return node\n          }\n        }\n      }\n    }\n\n    const mergedContext = mergeContext(rule.imposeContext, context)\n\n    // Do not clone node unless we find a match\n    let res = node\n\n    // First replace our child nodes with their simplified versions\n    // If a child could not be simplified, applying the rule to it\n    // will have no effect since the node is returned unchanged\n    if (res instanceof OperatorNode || res instanceof FunctionNode) {\n      const newArgs = mapRule(res.args, rule, context)\n      if (newArgs !== res.args) {\n        res = res.clone()\n        res.args = newArgs\n      }\n    } else if (res instanceof ParenthesisNode) {\n      if (res.content) {\n        const newContent = applyRule(res.content, rule, context)\n        if (newContent !== res.content) {\n          res = new ParenthesisNode(newContent)\n        }\n      }\n    } else if (res instanceof ArrayNode) {\n      const newItems = mapRule(res.items, rule, context)\n      if (newItems !== res.items) {\n        res = new ArrayNode(newItems)\n      }\n    } else if (res instanceof AccessorNode) {\n      let newObj = res.object\n      if (res.object) {\n        newObj = applyRule(res.object, rule, context)\n      }\n      let newIndex = res.index\n      if (res.index) {\n        newIndex = applyRule(res.index, rule, context)\n      }\n      if (newObj !== res.object || newIndex !== res.index) {\n        res = new AccessorNode(newObj, newIndex)\n      }\n    } else if (res instanceof IndexNode) {\n      const newDims = mapRule(res.dimensions, rule, context)\n      if (newDims !== res.dimensions) {\n        res = new IndexNode(newDims)\n      }\n    } else if (res instanceof ObjectNode) {\n      let changed = false\n      const newProps = {}\n      for (const prop in res.properties) {\n        newProps[prop] = applyRule(res.properties[prop], rule, context)\n        if (newProps[prop] !== res.properties[prop]) {\n          changed = true\n        }\n      }\n      if (changed) {\n        res = new ObjectNode(newProps)\n      }\n    }\n\n    // Try to match a rule against this node\n    let repl = rule.r\n    let matches = _ruleMatch(rule.l, res, mergedContext)[0]\n\n    // If the rule is associative operator, we can try matching it while allowing additional terms.\n    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.\n    if (!matches && rule.expanded) {\n      repl = rule.expanded.r\n      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0]\n    }\n    // Additional, non-commutative context expansion-rules\n    if (!matches && rule.expandedNC1) {\n      repl = rule.expandedNC1.r\n      matches = _ruleMatch(rule.expandedNC1.l, res, mergedContext)[0]\n      if (!matches) { // Existence of NC1 implies NC2\n        repl = rule.expandedNC2.r\n        matches = _ruleMatch(rule.expandedNC2.l, res, mergedContext)[0]\n      }\n    }\n\n    if (matches) {\n      // const before = res.toString({parenthesis: 'all'})\n\n      // Create a new node by cloning the rhs of the matched rule\n      // we keep any implicit multiplication state if relevant\n      const implicit = res.implicit\n      res = repl.clone()\n      if (implicit && 'implicit' in repl) {\n        res.implicit = true\n      }\n\n      // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes\n      res = res.transform(function (node) {\n        if (node.isSymbolNode && hasOwnProperty(matches.placeholders, node.name)) {\n          return matches.placeholders[node.name].clone()\n        } else {\n          return node\n        }\n      })\n\n      // const after = res.toString({parenthesis: 'all'})\n      // console.log('Simplified ' + before + ' to ' + after)\n    }\n\n    if (rule.repeat && res !== node) {\n      res = applyRule(res, rule, context)\n    }\n\n    return res\n  }\n\n  /**\n   * Get (binary) combinations of a flattened binary node\n   * e.g. +(node1, node2, node3) -> [\n   *        +(node1,  +(node2, node3)),\n   *        +(node2,  +(node1, node3)),\n   *        +(node3,  +(node1, node2))]\n   *\n   */\n  function getSplits (node, context) {\n    const res = []\n    let right, rightArgs\n    const makeNode = createMakeNodeFunction(node)\n    if (isCommutative(node, context)) {\n      for (let i = 0; i < node.args.length; i++) {\n        rightArgs = node.args.slice(0)\n        rightArgs.splice(i, 1)\n        right = (rightArgs.length === 1) ? rightArgs[0] : makeNode(rightArgs)\n        res.push(makeNode([node.args[i], right]))\n      }\n    } else {\n      // Keep order, but try all parenthesizations\n      for (let i = 1; i < node.args.length; i++) {\n        let left = node.args[0]\n        if (i > 1) {\n          left = makeNode(node.args.slice(0, i))\n        }\n        rightArgs = node.args.slice(i)\n        right = (rightArgs.length === 1) ? rightArgs[0] : makeNode(rightArgs)\n        res.push(makeNode([left, right]))\n      }\n    }\n    return res\n  }\n\n  /**\n   * Returns the set union of two match-placeholders or null if there is a conflict.\n   */\n  function mergeMatch (match1, match2) {\n    const res = { placeholders: {} }\n\n    // Some matches may not have placeholders; this is OK\n    if (!match1.placeholders && !match2.placeholders) {\n      return res\n    } else if (!match1.placeholders) {\n      return match2\n    } else if (!match2.placeholders) {\n      return match1\n    }\n\n    // Placeholders with the same key must match exactly\n    for (const key in match1.placeholders) {\n      if (hasOwnProperty(match1.placeholders, key)) {\n        res.placeholders[key] = match1.placeholders[key]\n\n        if (hasOwnProperty(match2.placeholders, key)) {\n          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {\n            return null\n          }\n        }\n      }\n    }\n\n    for (const key in match2.placeholders) {\n      if (hasOwnProperty(match2.placeholders, key)) {\n        res.placeholders[key] = match2.placeholders[key]\n      }\n    }\n\n    return res\n  }\n\n  /**\n   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   */\n  function combineChildMatches (list1, list2) {\n    const res = []\n\n    if (list1.length === 0 || list2.length === 0) {\n      return res\n    }\n\n    let merged\n    for (let i1 = 0; i1 < list1.length; i1++) {\n      for (let i2 = 0; i2 < list2.length; i2++) {\n        merged = mergeMatch(list1[i1], list2[i2])\n        if (merged) {\n          res.push(merged)\n        }\n      }\n    }\n    return res\n  }\n\n  /**\n   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.\n   * Each list represents matches found in one child of a node.\n   * Returns a list of unique matches.\n   */\n  function mergeChildMatches (childMatches) {\n    if (childMatches.length === 0) {\n      return childMatches\n    }\n\n    const sets = childMatches.reduce(combineChildMatches)\n    const uniqueSets = []\n    const unique = {}\n    for (let i = 0; i < sets.length; i++) {\n      const s = JSON.stringify(sets[i], replacer)\n      if (!unique[s]) {\n        unique[s] = true\n        uniqueSets.push(sets[i])\n      }\n    }\n    return uniqueSets\n  }\n\n  /**\n   * Determines whether node matches rule.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param {Object} context -- provides assumed properties of operators\n   * @param {Boolean} isSplit -- whether we are in process of splitting an\n   *                    n-ary operator node into possible binary combinations.\n   *                    Defaults to false.\n   * @return {Object} Information about the match, if it exists.\n   */\n  function _ruleMatch (rule, node, context, isSplit) {\n    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')\n    //    console.log('rule = ' + rule)\n    //    console.log('node = ' + node)\n\n    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')\n    let res = [{ placeholders: {} }]\n\n    if ((rule instanceof OperatorNode && node instanceof OperatorNode) ||\n      (rule instanceof FunctionNode && node instanceof FunctionNode)) {\n      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly\n      if (rule instanceof OperatorNode) {\n        if (rule.op !== node.op || rule.fn !== node.fn) {\n          return []\n        }\n      } else if (rule instanceof FunctionNode) {\n        if (rule.name !== node.name) {\n          return []\n        }\n      }\n\n      // rule and node match. Search the children of rule and node.\n      if ((node.args.length === 1 && rule.args.length === 1) ||\n          (!isAssociative(node, context) &&\n           node.args.length === rule.args.length) ||\n          isSplit) {\n        // Expect non-associative operators to match exactly,\n        // except in any order if operator is commutative\n        let childMatches = []\n        for (let i = 0; i < rule.args.length; i++) {\n          const childMatch = _ruleMatch(rule.args[i], node.args[i], context)\n          if (childMatch.length === 0) {\n            // Child did not match, so stop searching immediately\n            break\n          }\n          // The child matched, so add the information returned from the child to our result\n          childMatches.push(childMatch)\n        }\n        if (childMatches.length !== rule.args.length) {\n          if (!isCommutative(node, context) || // exact match in order needed\n              rule.args.length === 1) { // nothing to commute\n            return []\n          }\n          if (rule.args.length > 2) {\n            /* Need to generate all permutations and try them.\n             * It's a bit complicated, and unlikely to come up since there\n             * are very few ternary or higher operators. So punt for now.\n             */\n            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented')\n          }\n          /* Exactly two arguments, try them reversed */\n          const leftMatch = _ruleMatch(rule.args[0], node.args[1], context)\n          if (leftMatch.length === 0) {\n            return []\n          }\n          const rightMatch = _ruleMatch(rule.args[1], node.args[0], context)\n          if (rightMatch.length === 0) {\n            return []\n          }\n          childMatches = [leftMatch, rightMatch]\n        }\n        res = mergeChildMatches(childMatches)\n      } else if (node.args.length >= 2 && rule.args.length === 2) { // node is flattened, rule is not\n        // Associative operators/functions can be split in different ways so we check if the rule\n        // matches for each of them and return their union.\n        const splits = getSplits(node, context)\n        let splitMatches = []\n        for (let i = 0; i < splits.length; i++) {\n          const matchSet = _ruleMatch(rule, splits[i], context, true) // recursing at the same tree depth here\n          splitMatches = splitMatches.concat(matchSet)\n        }\n        return splitMatches\n      } else if (rule.args.length > 2) {\n        throw Error('Unexpected non-binary associative function: ' + rule.toString())\n      } else {\n        // Incorrect number of arguments in rule and node, so no match\n        return []\n      }\n    } else if (rule instanceof SymbolNode) {\n      // If the rule is a SymbolNode, then it carries a special meaning\n      // according to the first one or two characters of the symbol node name.\n      // These meanings are expalined in the documentation for simplify()\n      if (rule.name.length === 0) {\n        throw new Error('Symbol in rule has 0 length...!?')\n      }\n      if (SUPPORTED_CONSTANTS[rule.name]) {\n        // built-in constant must match exactly\n        if (rule.name !== node.name) {\n          return []\n        }\n      } else {\n        // wildcards are composed of up to two alphabetic or underscore characters\n        switch (rule.name[1] >= 'a' && rule.name[1] <= 'z' ? rule.name.substring(0, 2) : rule.name[0]) {\n          case 'n':\n          case '_p':\n            // rule matches _anything_, so assign this node to the rule.name placeholder\n            // Assign node to the rule.name placeholder.\n            // Our parent will check for matches among placeholders.\n            res[0].placeholders[rule.name] = node\n            break\n          case 'c':\n          case 'cl':\n            // rule matches a ConstantNode\n            if (isConstantNode(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 'v':\n            // rule matches anything other than a ConstantNode\n            if (!isConstantNode(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 'vl':\n            // rule matches VariableNode\n            if (isVariableNode(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 'cd':\n            // rule matches a ConstantNode or unaryMinus-wrapped ConstantNode\n            if (isNumericNode(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 'vd':\n            // rule matches anything other than a ConstantNode or unaryMinus-wrapped ConstantNode\n            if (!isNumericNode(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 'ce':\n            // rule matches expressions that have a constant value\n            if (isConstantExpression(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          case 've':\n            // rule matches expressions that do not have a constant value\n            if (!isConstantExpression(node)) {\n              res[0].placeholders[rule.name] = node\n            } else {\n              // mis-match: rule does not encompass current node\n              return []\n            }\n            break\n          default:\n            throw new Error('Invalid symbol in rule: ' + rule.name)\n        }\n      }\n    } else if (rule instanceof ConstantNode) {\n      // Literal constant must match exactly\n      if (!equal(rule.value, node.value)) {\n        return []\n      }\n    } else {\n      // Some other node was encountered which we aren't prepared for, so no match\n      return []\n    }\n\n    // It's a match!\n\n    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')\n    return res\n  }\n\n  /**\n   * Determines whether p and q (and all their children nodes) are identical.\n   *\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p\n   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q\n   * @return {Object} Information about the match, if it exists.\n   */\n  function _exactMatch (p, q) {\n    if (p instanceof ConstantNode && q instanceof ConstantNode) {\n      if (!equal(p.value, q.value)) {\n        return false\n      }\n    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {\n      if (p.name !== q.name) {\n        return false\n      }\n    } else if ((p instanceof OperatorNode && q instanceof OperatorNode) ||\n        (p instanceof FunctionNode && q instanceof FunctionNode)) {\n      if (p instanceof OperatorNode) {\n        if (p.op !== q.op || p.fn !== q.fn) {\n          return false\n        }\n      } else if (p instanceof FunctionNode) {\n        if (p.name !== q.name) {\n          return false\n        }\n      }\n\n      if (p.args.length !== q.args.length) {\n        return false\n      }\n\n      for (let i = 0; i < p.args.length; i++) {\n        if (!_exactMatch(p.args[i], q.args[i])) {\n          return false\n        }\n      }\n    } else {\n      return false\n    }\n\n    return true\n  }\n\n  return simplify\n})\n","import { isFraction, isMatrix, isNode, isArrayNode, isConstantNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\nimport { createUtil } from './simplify/util.js'\nimport { noBignumber, noFraction } from '../../utils/noop.js'\n\nconst name = 'simplifyConstant'\nconst dependencies = [\n  'typed',\n  'config',\n  'mathWithTransform',\n  'matrix',\n  '?fraction',\n  '?bignumber',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'SymbolNode'\n]\n\nexport const createSimplifyConstant = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  config,\n  mathWithTransform,\n  matrix,\n  fraction,\n  bignumber,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  SymbolNode\n}) => {\n  const { isCommutative, isAssociative, allChildren, createMakeNodeFunction } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n\n  /**\n   * simplifyConstant() takes a mathjs expression (either a Node representing\n   * a parse tree or a string which it parses to produce a node), and replaces\n   * any subexpression of it consisting entirely of constants with the computed\n   * value of that subexpression.\n   *\n   * Syntax:\n   *\n   *     math.simplifyConstant(expr)\n   *     math.simplifyConstant(expr, options)\n   *\n   * Examples:\n   *\n   *     math.simplifyConstant('x + 4*3/6')  // Node \"x + 2\"\n   *     math.simplifyConstant('z cos(0)')   // Node \"z 1\"\n   *     math.simplifyConstant('(5.2 + 1.08)t', {exactFractions: false})  // Node \"6.28 t\"\n   *\n   * See also:\n   *\n   *     simplify, simplifyCore, resolve, derivative\n   *\n   * @param {Node | string} node\n   *     The expression to be simplified\n   * @param {Object} options\n   *     Simplification options, as per simplify()\n   * @return {Node} Returns expression with constant subexpressions evaluated\n   */\n  const simplifyConstant = typed('simplifyConstant', {\n    Node: node => _ensureNode(foldFraction(node, {})),\n\n    'Node, Object': function (expr, options) {\n      return _ensureNode(foldFraction(expr, options))\n    }\n  })\n\n  function _removeFractions (thing) {\n    if (isFraction(thing)) {\n      return thing.valueOf()\n    }\n    if (thing instanceof Array) {\n      return thing.map(_removeFractions)\n    }\n    if (isMatrix(thing)) {\n      return matrix(_removeFractions(thing.valueOf()))\n    }\n    return thing\n  }\n\n  function _eval (fnname, args, options) {\n    try {\n      return mathWithTransform[fnname].apply(null, args)\n    } catch (ignore) {\n      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions\n      args = args.map(_removeFractions)\n      return _toNumber(mathWithTransform[fnname].apply(null, args), options)\n    }\n  }\n\n  const _toNode = typed({\n    Fraction: _fractionToNode,\n    number: function (n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n))\n      }\n      return new ConstantNode(n)\n    },\n    BigNumber: function (n) {\n      if (n < 0) {\n        return unaryMinusNode(new ConstantNode(-n))\n      }\n      return new ConstantNode(n) // old parameters: (n.toString(), 'number')\n    },\n    bigint: function (n) {\n      if (n < 0n) {\n        return unaryMinusNode(new ConstantNode(-n))\n      }\n      return new ConstantNode(n)\n    },\n    Complex: function (s) {\n      throw new Error('Cannot convert Complex number to Node')\n    },\n    string: function (s) {\n      return new ConstantNode(s)\n    },\n    Matrix: function (m) {\n      return new ArrayNode(m.valueOf().map(e => _toNode(e)))\n    }\n  })\n\n  function _ensureNode (thing) {\n    if (isNode(thing)) {\n      return thing\n    }\n    return _toNode(thing)\n  }\n\n  // convert a number to a fraction only if it can be expressed exactly,\n  // and when both numerator and denominator are small enough\n  function _exactFraction (n, options) {\n    const exactFractions = (options && options.exactFractions !== false)\n    if (exactFractions && isFinite(n) && fraction) {\n      const f = fraction(n)\n      const fractionsLimit = (options && typeof options.fractionsLimit === 'number')\n        ? options.fractionsLimit\n        : Infinity // no limit by default\n\n      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {\n        return f\n      }\n    }\n    return n\n  }\n\n  // Convert numbers to a preferred number type in preference order: Fraction, number, Complex\n  // BigNumbers are left alone\n  const _toNumber = typed({\n    'string, Object': function (s, options) {\n      const numericType = safeNumberType(s, config)\n\n      if (numericType === 'BigNumber') {\n        if (bignumber === undefined) {\n          noBignumber()\n        }\n        return bignumber(s)\n      } else if (numericType === 'bigint') {\n        return BigInt(s)\n      } else if (numericType === 'Fraction') {\n        if (fraction === undefined) {\n          noFraction()\n        }\n        return fraction(s)\n      } else {\n        const n = parseFloat(s)\n        return _exactFraction(n, options)\n      }\n    },\n\n    'Fraction, Object': function (s, options) { return s }, // we don't need options here\n\n    'BigNumber, Object': function (s, options) { return s }, // we don't need options here\n\n    'number, Object': function (s, options) {\n      return _exactFraction(s, options)\n    },\n\n    'bigint, Object': function (s, options) {\n      return s\n    },\n\n    'Complex, Object': function (s, options) {\n      if (s.im !== 0) {\n        return s\n      }\n      return _exactFraction(s.re, options)\n    },\n\n    'Matrix, Object': function (s, options) {\n      return matrix(_exactFraction(s.valueOf()))\n    },\n\n    'Array, Object': function (s, options) {\n      return s.map(_exactFraction)\n    }\n  })\n\n  function unaryMinusNode (n) {\n    return new OperatorNode('-', 'unaryMinus', [n])\n  }\n\n  function _fractionToNode (f) {\n    // note: we convert await from bigint values, because bigint values gives issues with divisions: 1n/2n=0n and not 0.5\n    const fromBigInt = (value) => config.number === 'BigNumber' && bignumber ? bignumber(value) : Number(value)\n\n    const numeratorValue = f.s * f.n\n    const numeratorNode = (numeratorValue < 0n)\n      ? new OperatorNode('-', 'unaryMinus', [new ConstantNode(-fromBigInt(numeratorValue))])\n      : new ConstantNode(fromBigInt(numeratorValue))\n\n    return (f.d === 1n)\n      ? numeratorNode\n      : new OperatorNode('/', 'divide', [numeratorNode, new ConstantNode(fromBigInt(f.d))])\n  }\n\n  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */\n  function _foldAccessor (obj, index, options) {\n    if (!isIndexNode(index)) { // don't know what to do with that...\n      return new AccessorNode(_ensureNode(obj), _ensureNode(index))\n    }\n    if (isArrayNode(obj) || isMatrix(obj)) {\n      const remainingDims = Array.from(index.dimensions)\n      /* We will resolve constant indices one at a time, looking\n       * just in the first or second dimensions because (a) arrays\n       * of more than two dimensions are likely rare, and (b) pulling\n       * out the third or higher dimension would be pretty intricate.\n       * The price is that we miss simplifying [..3d array][x,y,1]\n       */\n      while (remainingDims.length > 0) {\n        if (isConstantNode(remainingDims[0]) &&\n            typeof remainingDims[0].value !== 'string') {\n          const first = _toNumber(remainingDims.shift().value, options)\n          if (isArrayNode(obj)) {\n            obj = obj.items[first - 1]\n          } else { // matrix\n            obj = obj.valueOf()[first - 1]\n            if (obj instanceof Array) {\n              obj = matrix(obj)\n            }\n          }\n        } else if (remainingDims.length > 1 &&\n                   isConstantNode(remainingDims[1]) &&\n                   typeof remainingDims[1].value !== 'string') {\n          const second = _toNumber(remainingDims[1].value, options)\n          const tryItems = []\n          const fromItems = isArrayNode(obj) ? obj.items : obj.valueOf()\n          for (const item of fromItems) {\n            if (isArrayNode(item)) {\n              tryItems.push(item.items[second - 1])\n            } else if (isMatrix(obj)) {\n              tryItems.push(item[second - 1])\n            } else {\n              break\n            }\n          }\n          if (tryItems.length === fromItems.length) {\n            if (isArrayNode(obj)) {\n              obj = new ArrayNode(tryItems)\n            } else { // matrix\n              obj = matrix(tryItems)\n            }\n            remainingDims.splice(1, 1)\n          } else { // extracting slice along 2nd dimension failed, give up\n            break\n          }\n        } else { // neither 1st or 2nd dimension is constant, give up\n          break\n        }\n      }\n      if (remainingDims.length === index.dimensions.length) {\n        /* No successful constant indexing */\n        return new AccessorNode(_ensureNode(obj), index)\n      }\n      if (remainingDims.length > 0) {\n        /* Indexed some but not all dimensions */\n        index = new IndexNode(remainingDims)\n        return new AccessorNode(_ensureNode(obj), index)\n      }\n      /* All dimensions were constant, access completely resolved */\n      return obj\n    }\n    if (isObjectNode(obj) &&\n        index.dimensions.length === 1 &&\n        isConstantNode(index.dimensions[0])) {\n      const key = index.dimensions[0].value\n      if (key in obj.properties) {\n        return obj.properties[key]\n      }\n      return new ConstantNode() // undefined\n    }\n    /* Don't know how to index this sort of obj, at least not with this index */\n    return new AccessorNode(_ensureNode(obj), index)\n  }\n\n  /*\n   * Create a binary tree from a list of Fractions and Nodes.\n   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so\n   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).\n   * @param args - list of Fractions and Nodes\n   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions\n   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes\n   * if args.length is 1, returns args[0]\n   * @return - Either a Node representing a binary expression or Fraction\n   */\n  function foldOp (fn, args, makeNode, options) {\n    const first = args.shift()\n\n    // In the following reduction, sofar always has one of the three following\n    // forms: [NODE], [CONSTANT], or [NODE, CONSTANT]\n    const reduction = args.reduce((sofar, next) => {\n      if (!isNode(next)) {\n        const last = sofar.pop()\n\n        if (isNode(last)) {\n          return [last, next]\n        }\n        // Two constants in a row, try to fold them into one\n        try {\n          sofar.push(_eval(fn, [last, next], options))\n          return sofar\n        } catch (ignoreandcontinue) {\n          sofar.push(last)\n          // fall through to Node case\n        }\n      }\n\n      // Encountered a Node, or failed folding --\n      // collapse everything so far into a single tree:\n      sofar.push(_ensureNode(sofar.pop()))\n      const newtree = (sofar.length === 1) ? sofar[0] : makeNode(sofar)\n      return [makeNode([newtree, _ensureNode(next)])]\n    }, [first])\n\n    if (reduction.length === 1) {\n      return reduction[0]\n    }\n    // Might end up with a tree and a constant at the end:\n    return makeNode([reduction[0], _toNode(reduction[1])])\n  }\n\n  // destroys the original node and returns a folded one\n  function foldFraction (node, options) {\n    switch (node.type) {\n      case 'SymbolNode':\n        return node\n      case 'ConstantNode':\n        switch (typeof node.value) {\n          case 'number': return _toNumber(node.value, options)\n          case 'bigint': return _toNumber(node.value, options)\n          case 'string': return node.value\n          default:\n            if (!isNaN(node.value)) return _toNumber(node.value, options)\n        }\n        return node\n      case 'FunctionNode':\n        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {\n          return node\n        }\n        {\n          // Process operators as OperatorNode\n          const operatorFunctions = ['add', 'multiply']\n          if (!operatorFunctions.includes(node.name)) {\n            const args = node.args.map(arg => foldFraction(arg, options))\n\n            // If all args are numbers\n            if (!args.some(isNode)) {\n              try {\n                return _eval(node.name, args, options)\n              } catch (ignoreandcontinue) { }\n            }\n\n            // Size of a matrix does not depend on entries\n            if (node.name === 'size' &&\n                args.length === 1 &&\n                isArrayNode(args[0])) {\n              const sz = []\n              let section = args[0]\n              while (isArrayNode(section)) {\n                sz.push(section.items.length)\n                section = section.items[0]\n              }\n              return matrix(sz)\n            }\n\n            // Convert all args to nodes and construct a symbolic function call\n            return new FunctionNode(node.name, args.map(_ensureNode))\n          } else {\n            // treat as operator\n          }\n        }\n        /* falls through */\n      case 'OperatorNode':\n      {\n        const fn = node.fn.toString()\n        let args\n        let res\n        const makeNode = createMakeNodeFunction(node)\n        if (isOperatorNode(node) && node.isUnary()) {\n          args = [foldFraction(node.args[0], options)]\n          if (!isNode(args[0])) {\n            res = _eval(fn, args, options)\n          } else {\n            res = makeNode(args)\n          }\n        } else if (isAssociative(node, options.context)) {\n          args = allChildren(node, options.context)\n          args = args.map(arg => foldFraction(arg, options))\n\n          if (isCommutative(fn, options.context)) {\n            // commutative binary operator\n            const consts = []\n            const vars = []\n\n            for (let i = 0; i < args.length; i++) {\n              if (!isNode(args[i])) {\n                consts.push(args[i])\n              } else {\n                vars.push(args[i])\n              }\n            }\n\n            if (consts.length > 1) {\n              res = foldOp(fn, consts, makeNode, options)\n              vars.unshift(res)\n              res = foldOp(fn, vars, makeNode, options)\n            } else {\n              // we won't change the children order since it's not neccessary\n              res = foldOp(fn, args, makeNode, options)\n            }\n          } else {\n            // non-commutative binary operator\n            res = foldOp(fn, args, makeNode, options)\n          }\n        } else {\n          // non-associative binary operator\n          args = node.args.map(arg => foldFraction(arg, options))\n          res = foldOp(fn, args, makeNode, options)\n        }\n        return res\n      }\n      case 'ParenthesisNode':\n        // remove the uneccessary parenthesis\n        return foldFraction(node.content, options)\n      case 'AccessorNode':\n        return _foldAccessor(\n          foldFraction(node.object, options),\n          foldFraction(node.index, options),\n          options)\n      case 'ArrayNode': {\n        const foldItems = node.items.map(item => foldFraction(item, options))\n        if (foldItems.some(isNode)) {\n          return new ArrayNode(foldItems.map(_ensureNode))\n        }\n        /* All literals -- return a Matrix so we can operate on it */\n        return matrix(foldItems)\n      }\n      case 'IndexNode': {\n        return new IndexNode(\n          node.dimensions.map(n => simplifyConstant(n, options)))\n      }\n      case 'ObjectNode': {\n        const foldProps = {}\n        for (const prop in node.properties) {\n          foldProps[prop] = simplifyConstant(node.properties[prop], options)\n        }\n        return new ObjectNode(foldProps)\n      }\n      case 'AssignmentNode':\n        /* falls through */\n      case 'BlockNode':\n        /* falls through */\n      case 'FunctionAssignmentNode':\n        /* falls through */\n      case 'RangeNode':\n        /* falls through */\n      case 'ConditionalNode':\n        /* falls through */\n      default:\n        throw new Error(`Unimplemented node type in simplifyConstant: ${node.type}`)\n    }\n  }\n\n  return simplifyConstant\n})\n","import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js'\nimport { getOperator } from '../../expression/operators.js'\nimport { createUtil } from './simplify/util.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'simplifyCore'\nconst dependencies = [\n  'typed',\n  'parse',\n  'equal',\n  'isZero',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'pow',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode'\n]\n\nexport const createSimplifyCore = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  parse,\n  equal,\n  isZero,\n  add,\n  subtract,\n  multiply,\n  divide,\n  pow,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode\n}) => {\n  const node0 = new ConstantNode(0)\n  const node1 = new ConstantNode(1)\n  const nodeT = new ConstantNode(true)\n  const nodeF = new ConstantNode(false)\n  // test if a node will always have a boolean value (true/false)\n  // not sure if this list is complete\n  function isAlwaysBoolean (node) {\n    return isOperatorNode(node) && ['and', 'not', 'or'].includes(node.op)\n  }\n\n  const { hasProperty, isCommutative } =\n    createUtil({ FunctionNode, OperatorNode, SymbolNode })\n  /**\n   * simplifyCore() performs single pass simplification suitable for\n   * applications requiring ultimate performance. To roughly summarize,\n   * it handles cases along the lines of simplifyConstant() but where\n   * knowledge of a single argument is sufficient to determine the value.\n   * In contrast, simplify() extends simplifyCore() with additional passes\n   * to provide deeper simplification (such as gathering like terms).\n   *\n   * Specifically, simplifyCore:\n   *\n   * * Converts all function calls with operator equivalents to their\n   *   operator forms.\n   * * Removes operators or function calls that are guaranteed to have no\n   *   effect (such as unary '+').\n   * * Removes double unary '-', '~', and 'not'\n   * * Eliminates addition/subtraction of 0 and multiplication/division/powers\n   *   by 1 or 0.\n   * * Converts addition of a negation into subtraction.\n   * * Eliminates logical operations with constant true or false leading\n   *   arguments.\n   * * Puts constants on the left of a product, if multiplication is\n   *   considered commutative by the options (which is the default)\n   *\n   * Syntax:\n   *\n   *     math.simplifyCore(expr)\n   *     math.simplifyCore(expr, options)\n   *\n   * Examples:\n   *\n   *     const f = math.parse('2 * 1 * x ^ (1 - 0)')\n   *     math.simplifyCore(f)                          // Node \"2 * x\"\n   *     math.simplify('2 * 1 * x ^ (1 - 0)', [math.simplifyCore]) // Node \"2 * x\"\n   *\n   * See also:\n   *\n   *     simplify, simplifyConstant, resolve, derivative\n   *\n   * @param {Node | string} node\n   *     The expression to be simplified\n   * @param {Object} options\n   *     Simplification options, as per simplify()\n   * @return {Node} Returns expression with basic simplifications applied\n   */\n  function _simplifyCore (nodeToSimplify, options = {}) {\n    const context = options ? options.context : undefined\n    if (hasProperty(nodeToSimplify, 'trivial', context)) {\n      // This node does nothing if it has only one argument, so if so,\n      // return that argument simplified\n      if (isFunctionNode(nodeToSimplify) && nodeToSimplify.args.length === 1) {\n        return _simplifyCore(nodeToSimplify.args[0], options)\n      }\n      // For other node types, we try the generic methods\n      let simpChild = false\n      let childCount = 0\n      nodeToSimplify.forEach(c => {\n        ++childCount\n        if (childCount === 1) {\n          simpChild = _simplifyCore(c, options)\n        }\n      })\n      if (childCount === 1) {\n        return simpChild\n      }\n    }\n    let node = nodeToSimplify\n    if (isFunctionNode(node)) {\n      const op = getOperator(node.name)\n      if (op) {\n        // Replace FunctionNode with a new OperatorNode\n        if (node.args.length > 2 && hasProperty(node, 'associative', context)) {\n          // unflatten into binary operations since that's what simplifyCore handles\n          while (node.args.length > 2) {\n            const last = node.args.pop()\n            const seclast = node.args.pop()\n            node.args.push(new OperatorNode(op, node.name, [last, seclast]))\n          }\n        }\n        node = new OperatorNode(op, node.name, node.args)\n      } else {\n        return new FunctionNode(\n          _simplifyCore(node.fn), node.args.map(n => _simplifyCore(n, options)))\n      }\n    }\n    if (isOperatorNode(node) && node.isUnary()) {\n      const a0 = _simplifyCore(node.args[0], options)\n\n      if (node.op === '~') { // bitwise not\n        if (isOperatorNode(a0) && a0.isUnary() && a0.op === '~') {\n          return a0.args[0]\n        }\n      }\n      if (node.op === 'not') { // logical not\n        if (isOperatorNode(a0) && a0.isUnary() && a0.op === 'not') {\n          // Has the effect of turning the argument into a boolean\n          // So can only eliminate the double negation if\n          // the inside is already boolean\n          if (isAlwaysBoolean(a0.args[0])) {\n            return a0.args[0]\n          }\n        }\n      }\n      let finish = true\n      if (node.op === '-') { // unary minus\n        if (isOperatorNode(a0)) {\n          if (a0.isBinary() && a0.fn === 'subtract') {\n            node = new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]])\n            finish = false // continue to process the new binary node\n          }\n          if (a0.isUnary() && a0.op === '-') {\n            return a0.args[0]\n          }\n        }\n      }\n      if (finish) return new OperatorNode(node.op, node.fn, [a0])\n    }\n    if (isOperatorNode(node) && node.isBinary()) {\n      const a0 = _simplifyCore(node.args[0], options)\n      let a1 = _simplifyCore(node.args[1], options)\n\n      if (node.op === '+') {\n        if (isConstantNode(a0) && isZero(a0.value)) {\n          return a1\n        }\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return a0\n        }\n        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          a1 = a1.args[0]\n          node = new OperatorNode('-', 'subtract', [a0, a1])\n        }\n      }\n      if (node.op === '-') {\n        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {\n          return _simplifyCore(\n            new OperatorNode('+', 'add', [a0, a1.args[0]]), options)\n        }\n        if (isConstantNode(a0) && isZero(a0.value)) {\n          return _simplifyCore(new OperatorNode('-', 'unaryMinus', [a1]))\n        }\n        if (isConstantNode(a1) && isZero(a1.value)) {\n          return a0\n        }\n        return new OperatorNode(node.op, node.fn, [a0, a1])\n      }\n      if (node.op === '*') {\n        if (isConstantNode(a0)) {\n          if (isZero(a0.value)) {\n            return node0\n          } else if (equal(a0.value, 1)) {\n            return a1\n          }\n        }\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node0\n          } else if (equal(a1.value, 1)) {\n            return a0\n          }\n          if (isCommutative(node, context)) {\n            return new OperatorNode(node.op, node.fn, [a1, a0], node.implicit) // constants on left\n          }\n        }\n        return new OperatorNode(node.op, node.fn, [a0, a1], node.implicit)\n      }\n      if (node.op === '/') {\n        if (isConstantNode(a0) && isZero(a0.value)) {\n          return node0\n        }\n        if (isConstantNode(a1) && equal(a1.value, 1)) {\n          return a0\n        }\n        return new OperatorNode(node.op, node.fn, [a0, a1])\n      }\n      if (node.op === '^') {\n        if (isConstantNode(a1)) {\n          if (isZero(a1.value)) {\n            return node1\n          } else if (equal(a1.value, 1)) {\n            return a0\n          }\n        }\n      }\n      if (node.op === 'and') {\n        if (isConstantNode(a0)) {\n          if (a0.value) {\n            if (isAlwaysBoolean(a1)) return a1\n            if (isConstantNode(a1)) {\n              return a1.value ? nodeT : nodeF\n            }\n          } else {\n            return nodeF\n          }\n        }\n        if (isConstantNode(a1)) {\n          if (a1.value) {\n            if (isAlwaysBoolean(a0)) return a0\n          } else {\n            return nodeF\n          }\n        }\n      }\n      if (node.op === 'or') {\n        if (isConstantNode(a0)) {\n          if (a0.value) {\n            return nodeT\n          } else {\n            if (isAlwaysBoolean(a1)) return a1\n          }\n        }\n        if (isConstantNode(a1)) {\n          if (a1.value) {\n            return nodeT\n          } else {\n            if (isAlwaysBoolean(a0)) return a0\n          }\n        }\n      }\n      return new OperatorNode(node.op, node.fn, [a0, a1])\n    }\n    if (isOperatorNode(node)) {\n      return new OperatorNode(\n        node.op, node.fn, node.args.map(a => _simplifyCore(a, options)))\n    }\n    if (isArrayNode(node)) {\n      return new ArrayNode(node.items.map(n => _simplifyCore(n, options)))\n    }\n    if (isAccessorNode(node)) {\n      return new AccessorNode(\n        _simplifyCore(node.object, options), _simplifyCore(node.index, options))\n    }\n    if (isIndexNode(node)) {\n      return new IndexNode(\n        node.dimensions.map(n => _simplifyCore(n, options)))\n    }\n    if (isObjectNode(node)) {\n      const newProps = {}\n      for (const prop in node.properties) {\n        newProps[prop] = _simplifyCore(node.properties[prop], options)\n      }\n      return new ObjectNode(newProps)\n    }\n    // cannot simplify\n    return node\n  }\n\n  return typed(name, { Node: _simplifyCore, 'Node,Object': _simplifyCore })\n})\n","import { createMap } from '../../utils/map.js'\nimport { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'resolve'\nconst dependencies = [\n  'typed',\n  'parse',\n  'ConstantNode',\n  'FunctionNode',\n  'OperatorNode',\n  'ParenthesisNode'\n]\n\nexport const createResolve = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  parse,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode\n}) => {\n  /**\n   * resolve(expr, scope) replaces variable nodes with their scoped values\n   *\n   * Syntax:\n   *\n   *     math.resolve(expr, scope)\n   *\n   * Examples:\n   *\n   *     math.resolve('x + y', {x:1, y:2})           // Node '1 + 2'\n   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node '1 + 2'\n   *     math.simplify('x+y', {x:2, y: math.parse('x+x')}).toString() // \"6\"\n   *\n   * See also:\n   *\n   *     simplify, evaluate\n   *\n   * @param {Node | Node[]} node\n   *     The expression tree (or trees) to be simplified\n   * @param {Object} scope\n   *     Scope specifying variables to be resolved\n   * @return {Node | Node[]} Returns `node` with variables recursively substituted.\n   * @throws {ReferenceError}\n   *     If there is a cyclic dependency among the variables in `scope`,\n   *     resolution is impossible and a ReferenceError is thrown.\n   */\n  function _resolve (node, scope, within = new Set()) { // note `within`:\n    // `within` is not documented, since it is for internal cycle\n    // detection only\n    if (!scope) {\n      return node\n    }\n    if (isSymbolNode(node)) {\n      if (within.has(node.name)) {\n        const variables = Array.from(within).join(', ')\n        throw new ReferenceError(\n          `recursive loop of variable definitions among {${variables}}`\n        )\n      }\n      const value = scope.get(node.name)\n      if (isNode(value)) {\n        const nextWithin = new Set(within)\n        nextWithin.add(node.name)\n        return _resolve(value, scope, nextWithin)\n      } else if (typeof value === 'number') {\n        return parse(String(value))\n      } else if (value !== undefined) {\n        return new ConstantNode(value)\n      } else {\n        return node\n      }\n    } else if (isOperatorNode(node)) {\n      const args = node.args.map(function (arg) {\n        return _resolve(arg, scope, within)\n      })\n      return new OperatorNode(node.op, node.fn, args, node.implicit)\n    } else if (isParenthesisNode(node)) {\n      return new ParenthesisNode(_resolve(node.content, scope, within))\n    } else if (isFunctionNode(node)) {\n      const args = node.args.map(function (arg) {\n        return _resolve(arg, scope, within)\n      })\n      return new FunctionNode(node.name, args)\n    }\n\n    // Otherwise just recursively resolve any children (might also work\n    // for some of the above special cases)\n    return node.map(child => _resolve(child, scope, within))\n  }\n\n  return typed('resolve', {\n    Node: _resolve,\n    'Node, Map | null | undefined': _resolve,\n    'Node, Object': (n, scope) => _resolve(n, createMap(scope)),\n    // For arrays and matrices, we map `self` rather than `_resolve`\n    // because resolve is fairly expensive anyway, and this way\n    // we get nice error messages if one entry in the array has wrong type.\n    'Array | Matrix': typed.referToSelf(self => A => A.map(n => self(n))),\n    'Array | Matrix, null | undefined': typed.referToSelf(\n      self => A => A.map(n => self(n))),\n    'Array, Object': typed.referTo(\n      'Array,Map', selfAM => (A, scope) => selfAM(A, createMap(scope))),\n    'Matrix, Object': typed.referTo(\n      'Matrix,Map', selfMM => (A, scope) => selfMM(A, createMap(scope))),\n    'Array | Matrix, Map': typed.referToSelf(\n      self => (A, scope) => A.map(n => self(n, scope)))\n  })\n})\n","import { isConstantNode } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'symbolicEqual'\nconst dependencies = [\n  'parse',\n  'simplify',\n  'typed',\n  'OperatorNode'\n]\n\nexport const createSymbolicEqual = /* #__PURE__ */ factory(name, dependencies, ({\n  parse,\n  simplify,\n  typed,\n  OperatorNode\n}) => {\n  /**\n   * Attempts to determine if two expressions are symbolically equal, i.e.\n   * one is the result of valid algebraic manipulations on the other.\n   * Currently, this simply checks if the difference of the two expressions\n   * simplifies down to 0. So there are two important caveats:\n   * 1. whether two expressions are symbolically equal depends on the\n   *     manipulations allowed. Therefore, this function takes an optional\n   *     third argument, which are the options that control the behavior\n   *     as documented for the `simplify()` function.\n   * 2. it is in general intractable to find the minimal simplification of\n   *     an arbitrarily complicated expression. So while a `true` value\n   *     of `symbolicEqual` ensures that the two expressions can be manipulated\n   *     to match each other, a `false` value does not absolutely rule this out.\n   *\n   * Syntax:\n   *\n   *     math.symbolicEqual(expr1, expr2)\n   *     math.symbolicEqual(expr1, expr2, options)\n   *\n   * Examples:\n   *\n   *     math.symbolicEqual('x*y', 'y*x') // Returns true\n   *     math.symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false\n   *     math.symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true\n   *     math.symbolicEqual('abs(x)','x') // Returns false\n   *     math.symbolicEqual('abs(x)','x', simplify.positiveContext) // Returns true\n   *\n   * See also:\n   *\n   *     simplify, evaluate\n   *\n   * @param {Node|string} expr1  The first expression to compare\n   * @param {Node|string} expr2  The second expression to compare\n   * @param {Object} [options] Optional option object, passed to simplify\n   * @returns {boolean}\n   *     Returns true if a valid manipulation making the expressions equal\n   *     is found.\n   */\n  function _symbolicEqual (e1, e2, options = {}) {\n    const diff = new OperatorNode('-', 'subtract', [e1, e2])\n    const simplified = simplify(diff, {}, options)\n    return (isConstantNode(simplified) && !(simplified.value))\n  }\n\n  return typed(name, {\n    'Node, Node': _symbolicEqual,\n    'Node, Node, Object': _symbolicEqual\n  })\n})\n","import { isConstantNode, typeOf } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { safeNumberType } from '../../utils/number.js'\n\nconst name = 'derivative'\nconst dependencies = [\n  'typed',\n  'config',\n  'parse',\n  'simplify',\n  'equal',\n  'isZero',\n  'numeric',\n  'ConstantNode',\n  'FunctionNode',\n  'OperatorNode',\n  'ParenthesisNode',\n  'SymbolNode'\n]\n\nexport const createDerivative = /* #__PURE__ */ factory(name, dependencies, ({\n  typed,\n  config,\n  parse,\n  simplify,\n  equal,\n  isZero,\n  numeric,\n  ConstantNode,\n  FunctionNode,\n  OperatorNode,\n  ParenthesisNode,\n  SymbolNode\n}) => {\n  /**\n   * Takes the derivative of an expression expressed in parser Nodes.\n   * The derivative will be taken over the supplied variable in the\n   * second parameter. If there are multiple variables in the expression,\n   * it will return a partial derivative.\n   *\n   * This uses rules of differentiation which can be found here:\n   *\n   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)\n   *\n   * Syntax:\n   *\n   *     math.derivative(expr, variable)\n   *     math.derivative(expr, variable, options)\n   *\n   * Examples:\n   *\n   *     math.derivative('x^2', 'x')                     // Node '2 * x'\n   *     math.derivative('x^2', 'x', {simplify: false})  // Node '2 * 1 * x ^ (2 - 1)'\n   *     math.derivative('sin(2x)', 'x'))                // Node '2 * cos(2 * x)'\n   *     math.derivative('2*x', 'x').evaluate()          // number 2\n   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8\n   *     const f = math.parse('x^2')\n   *     const x = math.parse('x')\n   *     math.derivative(f, x)                           // Node {2 * x}\n   *\n   * See also:\n   *\n   *     simplify, parse, evaluate\n   *\n   * @param  {Node | string} expr           The expression to differentiate\n   * @param  {SymbolNode | string} variable The variable over which to differentiate\n   * @param  {{simplify: boolean}} [options]\n   *                         There is one option available, `simplify`, which\n   *                         is true by default. When false, output will not\n   *                         be simplified.\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n  function plainDerivative (expr, variable, options = { simplify: true }) {\n    const cache = new Map()\n    const variableName = variable.name\n    function isConstCached (node) {\n      const cached = cache.get(node)\n      if (cached !== undefined) {\n        return cached\n      }\n      const res = _isConst(isConstCached, node, variableName)\n      cache.set(node, res)\n      return res\n    }\n\n    const res = _derivative(expr, isConstCached)\n    return options.simplify ? simplify(res) : res\n  }\n\n  function parseIdentifier (string) {\n    const symbol = parse(string)\n    if (!symbol.isSymbolNode) {\n      throw new TypeError('Invalid variable. ' +\n        `Cannot parse ${JSON.stringify(string)} into a variable in function derivative`)\n    }\n    return symbol\n  }\n\n  const derivative = typed(name, {\n    'Node, SymbolNode': plainDerivative,\n    'Node, SymbolNode, Object': plainDerivative,\n    'Node, string': (node, symbol) => plainDerivative(node, parseIdentifier(symbol)),\n    'Node, string, Object': (node, symbol, options) => plainDerivative(node, parseIdentifier(symbol), options)\n\n    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}\n    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {\n      let res = expr\n      for (let i = 0; i < order; i++) {\n        <create caching isConst>\n        res = _derivative(res, isConst)\n      }\n      return res\n    }\n    */\n  })\n\n  derivative._simplify = true\n\n  derivative.toTex = function (deriv) {\n    return _derivTex.apply(null, deriv.args)\n  }\n\n  // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.\n  // NOTE: the optional \"order\" parameter here is currently unused\n  const _derivTex = typed('_derivTex', {\n    'Node, SymbolNode': function (expr, x) {\n      if (isConstantNode(expr) && typeOf(expr.value) === 'string') {\n        return _derivTex(parse(expr.value).toString(), x.toString(), 1)\n      } else {\n        return _derivTex(expr.toTex(), x.toString(), 1)\n      }\n    },\n    'Node, ConstantNode': function (expr, x) {\n      if (typeOf(x.value) === 'string') {\n        return _derivTex(expr, parse(x.value))\n      } else {\n        throw new Error(\"The second parameter to 'derivative' is a non-string constant\")\n      }\n    },\n    'Node, SymbolNode, ConstantNode': function (expr, x, order) {\n      return _derivTex(expr.toString(), x.name, order.value)\n    },\n    'string, string, number': function (expr, x, order) {\n      let d\n      if (order === 1) {\n        d = '{d\\\\over d' + x + '}'\n      } else {\n        d = '{d^{' + order + '}\\\\over d' + x + '^{' + order + '}}'\n      }\n      return d + `\\\\left[${expr}\\\\right]`\n    }\n  })\n\n  /**\n   * Checks if a node is constants (e.g. 2 + 2).\n   * Accepts (usually memoized) version of self as the first parameter for recursive calls.\n   * Classification is done as follows:\n   *\n   *   1. ConstantNodes are constants.\n   *   2. If there exists a SymbolNode, of which we are differentiating over,\n   *      in the subtree it is not constant.\n   *\n   * @param  {function} isConst  Function that tells whether sub-expression is a constant\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {string} varName     Variable that we are differentiating\n   * @return {boolean}  if node is constant\n   */\n  const _isConst = typed('_isConst', {\n    'function, ConstantNode, string': function () {\n      return true\n    },\n\n    'function, SymbolNode, string': function (isConst, node, varName) {\n      // Treat other variables like constants. For reasoning, see:\n      //   https://en.wikipedia.org/wiki/Partial_derivative\n      return node.name !== varName\n    },\n\n    'function, ParenthesisNode, string': function (isConst, node, varName) {\n      return isConst(node.content, varName)\n    },\n\n    'function, FunctionAssignmentNode, string': function (isConst, node, varName) {\n      if (!node.params.includes(varName)) {\n        return true\n      }\n      return isConst(node.expr, varName)\n    },\n\n    'function, FunctionNode | OperatorNode, string': function (isConst, node, varName) {\n      return node.args.every(arg => isConst(arg, varName))\n    }\n  })\n\n  /**\n   * Applies differentiation rules.\n   *\n   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node\n   * @param  {function} isConst  Function that tells if a node is constant\n   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`\n   */\n  const _derivative = typed('_derivative', {\n    'ConstantNode, function': function () {\n      return createConstantNode(0)\n    },\n\n    'SymbolNode, function': function (node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0)\n      }\n      return createConstantNode(1)\n    },\n\n    'ParenthesisNode, function': function (node, isConst) {\n      return new ParenthesisNode(_derivative(node.content, isConst))\n    },\n\n    'FunctionAssignmentNode, function': function (node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0)\n      }\n      return _derivative(node.expr, isConst)\n    },\n\n    'FunctionNode, function': function (node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0)\n      }\n\n      const arg0 = node.args[0]\n      let arg1\n\n      let div = false // is output a fraction?\n      let negative = false // is output negative?\n\n      let funcDerivative\n      switch (node.name) {\n        case 'cbrt':\n          // d/dx(cbrt(x)) = 1 / (3x^(2/3))\n          div = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            createConstantNode(3),\n            new OperatorNode('^', 'pow', [\n              arg0,\n              new OperatorNode('/', 'divide', [\n                createConstantNode(2),\n                createConstantNode(3)\n              ])\n            ])\n          ])\n          break\n        case 'sqrt':\n        case 'nthRoot':\n          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))\n          if (node.args.length === 1) {\n            div = true\n            funcDerivative = new OperatorNode('*', 'multiply', [\n              createConstantNode(2),\n              new FunctionNode('sqrt', [arg0])\n            ])\n          } else if (node.args.length === 2) {\n            // Rearrange from nthRoot(x, a) -> x^(1/a)\n            arg1 = new OperatorNode('/', 'divide', [\n              createConstantNode(1),\n              node.args[1]\n            ])\n\n            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), isConst)\n          }\n          break\n        case 'log10':\n          arg1 = createConstantNode(10)\n          /* fall through! */\n        case 'log':\n          if (!arg1 && node.args.length === 1) {\n            // d/dx(log(x)) = 1 / x\n            funcDerivative = arg0.clone()\n            div = true\n          } else if ((node.args.length === 1 && arg1) ||\n              (node.args.length === 2 && isConst(node.args[1]))) {\n            // d/dx(log(x, c)) = 1 / (x*ln(c))\n            funcDerivative = new OperatorNode('*', 'multiply', [\n              arg0.clone(),\n              new FunctionNode('log', [arg1 || node.args[1]])\n            ])\n            div = true\n          } else if (node.args.length === 2) {\n            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))\n            return _derivative(new OperatorNode('/', 'divide', [\n              new FunctionNode('log', [arg0]),\n              new FunctionNode('log', [node.args[1]])\n            ]), isConst)\n          }\n          break\n        case 'pow':\n          if (node.args.length === 2) {\n            // Pass to pow operator node parser\n            return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), isConst)\n          }\n          break\n        case 'exp':\n          // d/dx(e^x) = e^x\n          funcDerivative = new FunctionNode('exp', [arg0.clone()])\n          break\n        case 'sin':\n          // d/dx(sin(x)) = cos(x)\n          funcDerivative = new FunctionNode('cos', [arg0.clone()])\n          break\n        case 'cos':\n          // d/dx(cos(x)) = -sin(x)\n          funcDerivative = new OperatorNode('-', 'unaryMinus', [\n            new FunctionNode('sin', [arg0.clone()])\n          ])\n          break\n        case 'tan':\n          // d/dx(tan(x)) = sec(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('sec', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'sec':\n          // d/dx(sec(x)) = sec(x)tan(x)\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('tan', [arg0.clone()])\n          ])\n          break\n        case 'csc':\n          // d/dx(csc(x)) = -csc(x)cot(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('cot', [arg0.clone()])\n          ])\n          break\n        case 'cot':\n          // d/dx(cot(x)) = -csc(x)^2\n          negative = true\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('csc', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'asin':\n          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              createConstantNode(1),\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ])\n            ])\n          ])\n          break\n        case 'acos':\n          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)\n          div = true\n          negative = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              createConstantNode(1),\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ])\n            ])\n          ])\n          break\n        case 'atan':\n          // d/dx(atan(x)) = 1 / (x^2 + 1)\n          div = true\n          funcDerivative = new OperatorNode('+', 'add', [\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ]),\n            createConstantNode(1)\n          ])\n          break\n        case 'asec':\n          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))\n          div = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acsc':\n          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acot':\n          // d/dx(acot(x)) = -1 / (x^2 + 1)\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('+', 'add', [\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ]),\n            createConstantNode(1)\n          ])\n          break\n        case 'sinh':\n          // d/dx(sinh(x)) = cosh(x)\n          funcDerivative = new FunctionNode('cosh', [arg0.clone()])\n          break\n        case 'cosh':\n          // d/dx(cosh(x)) = sinh(x)\n          funcDerivative = new FunctionNode('sinh', [arg0.clone()])\n          break\n        case 'tanh':\n          // d/dx(tanh(x)) = sech(x)^2\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('sech', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'sech':\n          // d/dx(sech(x)) = -sech(x)tanh(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('tanh', [arg0.clone()])\n          ])\n          break\n        case 'csch':\n          // d/dx(csch(x)) = -csch(x)coth(x)\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            node,\n            new FunctionNode('coth', [arg0.clone()])\n          ])\n          break\n        case 'coth':\n          // d/dx(coth(x)) = -csch(x)^2\n          negative = true\n          funcDerivative = new OperatorNode('^', 'pow', [\n            new FunctionNode('csch', [arg0.clone()]),\n            createConstantNode(2)\n          ])\n          break\n        case 'asinh':\n          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('+', 'add', [\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ]),\n              createConstantNode(1)\n            ])\n          ])\n          break\n        case 'acosh':\n          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)\n          div = true\n          funcDerivative = new FunctionNode('sqrt', [\n            new OperatorNode('-', 'subtract', [\n              new OperatorNode('^', 'pow', [\n                arg0.clone(),\n                createConstantNode(2)\n              ]),\n              createConstantNode(1)\n            ])\n          ])\n          break\n        case 'atanh':\n          // d/dx(atanh(x)) = 1 / (1 - x^2)\n          div = true\n          funcDerivative = new OperatorNode('-', 'subtract', [\n            createConstantNode(1),\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ])\n          ])\n          break\n        case 'asech':\n          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            arg0.clone(),\n            new FunctionNode('sqrt', [\n              new OperatorNode('-', 'subtract', [\n                createConstantNode(1),\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ])\n              ])\n            ])\n          ])\n          break\n        case 'acsch':\n          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('*', 'multiply', [\n            new FunctionNode('abs', [arg0.clone()]),\n            new FunctionNode('sqrt', [\n              new OperatorNode('+', 'add', [\n                new OperatorNode('^', 'pow', [\n                  arg0.clone(),\n                  createConstantNode(2)\n                ]),\n                createConstantNode(1)\n              ])\n            ])\n          ])\n          break\n        case 'acoth':\n          // d/dx(acoth(x)) = -1 / (1 - x^2)\n          div = true\n          negative = true\n          funcDerivative = new OperatorNode('-', 'subtract', [\n            createConstantNode(1),\n            new OperatorNode('^', 'pow', [\n              arg0.clone(),\n              createConstantNode(2)\n            ])\n          ])\n          break\n        case 'abs':\n          // d/dx(abs(x)) = abs(x)/x\n          funcDerivative = new OperatorNode('/', 'divide', [\n            new FunctionNode(new SymbolNode('abs'), [arg0.clone()]),\n            arg0.clone()\n          ])\n          break\n        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)\n        default:\n          throw new Error('Cannot process function \"' + node.name + '\" in derivative: ' +\n          'the function is not supported, undefined, or the number of arguments passed to it are not supported')\n      }\n\n      let op, func\n      if (div) {\n        op = '/'\n        func = 'divide'\n      } else {\n        op = '*'\n        func = 'multiply'\n      }\n\n      /* Apply chain rule to all functions:\n         F(x)  = f(g(x))\n         F'(x) = g'(x)*f'(g(x)) */\n      let chainDerivative = _derivative(arg0, isConst)\n      if (negative) {\n        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative])\n      }\n      return new OperatorNode(op, func, [chainDerivative, funcDerivative])\n    },\n\n    'OperatorNode, function': function (node, isConst) {\n      if (isConst(node)) {\n        return createConstantNode(0)\n      }\n\n      if (node.op === '+') {\n        // d/dx(sum(f(x)) = sum(f'(x))\n        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {\n          return _derivative(arg, isConst)\n        }))\n      }\n\n      if (node.op === '-') {\n        // d/dx(+/-f(x)) = +/-f'(x)\n        if (node.isUnary()) {\n          return new OperatorNode(node.op, node.fn, [\n            _derivative(node.args[0], isConst)\n          ])\n        }\n\n        // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)\n        if (node.isBinary()) {\n          return new OperatorNode(node.op, node.fn, [\n            _derivative(node.args[0], isConst),\n            _derivative(node.args[1], isConst)\n          ])\n        }\n      }\n\n      if (node.op === '*') {\n        // d/dx(c*f(x)) = c*f'(x)\n        const constantTerms = node.args.filter(function (arg) {\n          return isConst(arg)\n        })\n\n        if (constantTerms.length > 0) {\n          const nonConstantTerms = node.args.filter(function (arg) {\n            return !isConst(arg)\n          })\n\n          const nonConstantNode = nonConstantTerms.length === 1\n            ? nonConstantTerms[0]\n            : new OperatorNode('*', 'multiply', nonConstantTerms)\n\n          const newArgs = constantTerms.concat(_derivative(nonConstantNode, isConst))\n\n          return new OperatorNode('*', 'multiply', newArgs)\n        }\n\n        // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)\n        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {\n          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {\n            return (argInner === argOuter)\n              ? _derivative(argInner, isConst)\n              : argInner.clone()\n          }))\n        }))\n      }\n\n      if (node.op === '/' && node.isBinary()) {\n        const arg0 = node.args[0]\n        const arg1 = node.args[1]\n\n        // d/dx(f(x) / c) = f'(x) / c\n        if (isConst(arg1)) {\n          return new OperatorNode('/', 'divide', [_derivative(arg0, isConst), arg1])\n        }\n\n        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)\n        if (isConst(arg0)) {\n          return new OperatorNode('*', 'multiply', [\n            new OperatorNode('-', 'unaryMinus', [arg0]),\n            new OperatorNode('/', 'divide', [\n              _derivative(arg1, isConst),\n              new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])\n            ])\n          ])\n        }\n\n        // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2\n        return new OperatorNode('/', 'divide', [\n          new OperatorNode('-', 'subtract', [\n            new OperatorNode('*', 'multiply', [_derivative(arg0, isConst), arg1.clone()]),\n            new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, isConst)])\n          ]),\n          new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])\n        ])\n      }\n\n      if (node.op === '^' && node.isBinary()) {\n        const arg0 = node.args[0]\n        const arg1 = node.args[1]\n\n        if (isConst(arg0)) {\n          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1\n          if (isConstantNode(arg0) && (isZero(arg0.value) || equal(arg0.value, 1))) {\n            return createConstantNode(0)\n          }\n\n          // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)\n          return new OperatorNode('*', 'multiply', [\n            node,\n            new OperatorNode('*', 'multiply', [\n              new FunctionNode('log', [arg0.clone()]),\n              _derivative(arg1.clone(), isConst)\n            ])\n          ])\n        }\n\n        if (isConst(arg1)) {\n          if (isConstantNode(arg1)) {\n            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0\n            if (isZero(arg1.value)) {\n              return createConstantNode(0)\n            }\n            // Ignore exponent; f(x)^1 = f(x)\n            if (equal(arg1.value, 1)) {\n              return _derivative(arg0, isConst)\n            }\n          }\n\n          // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)\n          const powMinusOne = new OperatorNode('^', 'pow', [\n            arg0.clone(),\n            new OperatorNode('-', 'subtract', [\n              arg1,\n              createConstantNode(1)\n            ])\n          ])\n\n          return new OperatorNode('*', 'multiply', [\n            arg1.clone(),\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg0, isConst),\n              powMinusOne\n            ])\n          ])\n        }\n\n        // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]\n        return new OperatorNode('*', 'multiply', [\n          new OperatorNode('^', 'pow', [arg0.clone(), arg1.clone()]),\n          new OperatorNode('+', 'add', [\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg0, isConst),\n              new OperatorNode('/', 'divide', [arg1.clone(), arg0.clone()])\n            ]),\n            new OperatorNode('*', 'multiply', [\n              _derivative(arg1, isConst),\n              new FunctionNode('log', [arg0.clone()])\n            ])\n          ])\n        ])\n      }\n\n      throw new Error('Cannot process operator \"' + node.op + '\" in derivative: ' +\n        'the operator is not supported, undefined, or the number of arguments passed to it are not supported')\n    }\n  })\n\n  /**\n   * Helper function to create a constant node with a specific type\n   * (number, BigNumber, Fraction)\n   * @param {number} value\n   * @param {string} [valueType]\n   * @return {ConstantNode}\n   */\n  function createConstantNode (value, valueType) {\n    return new ConstantNode(numeric(value, valueType || safeNumberType(String(value), config)))\n  }\n\n  return derivative\n})\n","import { isInteger } from '../../utils/number.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'rationalize'\nconst dependencies = [\n  'config',\n  'typed',\n  'equal',\n  'isZero',\n  'add',\n  'subtract',\n  'multiply',\n  'divide',\n  'pow',\n  'parse',\n  'simplifyConstant',\n  'simplifyCore',\n  'simplify',\n  '?bignumber',\n  '?fraction',\n  'mathWithTransform',\n  'matrix',\n  'AccessorNode',\n  'ArrayNode',\n  'ConstantNode',\n  'FunctionNode',\n  'IndexNode',\n  'ObjectNode',\n  'OperatorNode',\n  'SymbolNode',\n  'ParenthesisNode'\n]\n\nexport const createRationalize = /* #__PURE__ */ factory(name, dependencies, ({\n  config,\n  typed,\n  equal,\n  isZero,\n  add,\n  subtract,\n  multiply,\n  divide,\n  pow,\n  parse,\n  simplifyConstant,\n  simplifyCore,\n  simplify,\n  fraction,\n  bignumber,\n  mathWithTransform,\n  matrix,\n  AccessorNode,\n  ArrayNode,\n  ConstantNode,\n  FunctionNode,\n  IndexNode,\n  ObjectNode,\n  OperatorNode,\n  SymbolNode,\n  ParenthesisNode\n}) => {\n  /**\n   * Transform a rationalizable expression in a rational fraction.\n   * If rational fraction is one variable polynomial then converts\n   * the numerator and denominator in canonical form, with decreasing\n   * exponents, returning the coefficients of numerator.\n   *\n   * Syntax:\n   *\n   *     math.rationalize(expr)\n   *     math.rationalize(expr, detailed)\n   *     math.rationalize(expr, scope)\n   *     math.rationalize(expr, scope, detailed)\n   *\n   * Examples:\n   *\n   *     math.rationalize('sin(x)+y')\n   *                   //  Error: There is an unsolved function call\n   *     math.rationalize('2x/y - y/(x+1)')\n   *                   // (2*x^2-y^2+2*x)/(x*y+y)\n   *     math.rationalize('(2x+1)^6')\n   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1\n   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')\n   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)\n   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =\n   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/\n   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)\n   *\n   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1\n   *     math.rationalize('x+x+x+y',{})    // 3*x+y\n   *\n   *     const ret = math.rationalize('x+x+x+y',{},true)\n   *                   // ret.expression=3*x+y, ret.variables = [\"x\",\"y\"]\n   *     const ret = math.rationalize('-2+5x^2',{},true)\n   *                   // ret.expression=5*x^2-2, ret.variables = [\"x\"], ret.coefficients=[-2,0,5]\n   *\n   * See also:\n   *\n   *     simplify\n   *\n   * @param  {Node|string} expr    The expression to check if is a polynomial expression\n   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input\n   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)\n   *\n   * @return {Object | Node}    The rational polynomial of `expr` or an object\n   *            `{expression, numerator, denominator, variables, coefficients}`, where\n   *              `expression` is a `Node` with the node simplified expression,\n   *              `numerator` is a `Node` with the simplified numerator of expression,\n   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),\n   *              `variables` is an array with variable names,\n   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent\n   *           {Expression Node}  node simplified expression\n   *\n   */\n  function _rationalize (expr, scope = {}, detailed = false) {\n    const setRules = rulesRationalize() // Rules for change polynomial in near canonical form\n    const polyRet = polynomial(expr, scope, true, setRules.firstRules) // Check if expression is a rationalizable polynomial\n    const nVars = polyRet.variables.length\n    const noExactFractions = { exactFractions: false }\n    const withExactFractions = { exactFractions: true }\n    expr = polyRet.expression\n\n    if (nVars >= 1) { // If expression in not a constant\n      expr = expandPower(expr) // First expand power of polynomials (cannot be made from rules!)\n      let sBefore // Previous expression\n      let rules\n      let eDistrDiv = true\n      let redoInic = false\n      // Apply the initial rules, including succ div rules:\n      expr = simplify(expr, setRules.firstRules, {}, noExactFractions)\n      let s\n      while (true) {\n        // Alternate applying successive division rules and distr.div.rules\n        // until there are no more changes:\n        rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules\n        expr = simplify(expr, rules, {}, withExactFractions)\n        eDistrDiv = !eDistrDiv // Swap between Distr.Div and Succ. Div. Rules\n\n        s = expr.toString()\n        if (s === sBefore) {\n          break // No changes : end of the loop\n        }\n\n        redoInic = true\n        sBefore = s\n      }\n\n      if (redoInic) { // Apply first rules again without succ div rules (if there are changes)\n        expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions)\n      }\n      // Apply final rules:\n      expr = simplify(expr, setRules.finalRules, {}, noExactFractions)\n    } // NVars >= 1\n\n    const coefficients = []\n    const retRationalize = {}\n\n    if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') { // Separate numerator from denominator\n      if (nVars === 1) {\n        expr.args[0] = polyToCanonical(expr.args[0], coefficients)\n        expr.args[1] = polyToCanonical(expr.args[1])\n      }\n      if (detailed) {\n        retRationalize.numerator = expr.args[0]\n        retRationalize.denominator = expr.args[1]\n      }\n    } else {\n      if (nVars === 1) {\n        expr = polyToCanonical(expr, coefficients)\n      }\n      if (detailed) {\n        retRationalize.numerator = expr\n        retRationalize.denominator = null\n      }\n    }\n    // nVars\n\n    if (!detailed) return expr\n    retRationalize.coefficients = coefficients\n    retRationalize.variables = polyRet.variables\n    retRationalize.expression = expr\n    return retRationalize\n  }\n\n  return typed(name, {\n    Node: _rationalize,\n    'Node, boolean': (expr, detailed) => _rationalize(expr, {}, detailed),\n    'Node, Object': _rationalize,\n    'Node, Object, boolean': _rationalize\n  }) // end of typed rationalize\n\n  /**\n   *  Function to simplify an expression using an optional scope and\n   *  return it if the expression is a polynomial expression, i.e.\n   *  an expression with one or more variables and the operators\n   *  +, -, *, and ^, where the exponent can only be a positive integer.\n   *\n   * Syntax:\n   *\n   *     polynomial(expr,scope,extended, rules)\n   *\n   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression\n   * @param  {object} scope           Optional scope for expression simplification\n   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.\n   * @param  {array}  rules           Optional. Default is no rule.\n   *\n   *\n   * @return {Object}\n   *            {Object} node:   node simplified expression\n   *            {Array}  variables:  variable names\n   */\n  function polynomial (expr, scope, extended, rules) {\n    const variables = []\n    const node = simplify(expr, rules, scope, { exactFractions: false }) // Resolves any variables and functions with all defined parameters\n    extended = !!extended\n\n    const oper = '+-*' + (extended ? '/' : '')\n    recPoly(node)\n    const retFunc = {}\n    retFunc.expression = node\n    retFunc.variables = variables\n    return retFunc\n\n    // -------------------------------------------------------------------------------------------------------\n\n    /**\n     *  Function to simplify an expression using an optional scope and\n     *  return it if the expression is a polynomial expression, i.e.\n     *  an expression with one or more variables and the operators\n     *  +, -, *, and ^, where the exponent can only be a positive integer.\n     *\n     * Syntax:\n     *\n     *     recPoly(node)\n     *\n     *\n     * @param  {Node} node               The current sub tree expression in recursion\n     *\n     * @return                           nothing, throw an exception if error\n     */\n    function recPoly (node) {\n      const tp = node.type // node type\n      if (tp === 'FunctionNode') {\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call')\n      } else if (tp === 'OperatorNode') {\n        if (node.op === '^') {\n          // TODO: handle negative exponents like in '1/x^(-2)'\n          if (node.args[1].type !== 'ConstantNode' || !isInteger(parseFloat(node.args[1].value))) {\n            throw new Error('There is a non-integer exponent')\n          } else {\n            recPoly(node.args[0])\n          }\n        } else {\n          if (!oper.includes(node.op)) {\n            throw new Error('Operator ' + node.op + ' invalid in polynomial expression')\n          }\n          for (let i = 0; i < node.args.length; i++) {\n            recPoly(node.args[i])\n          }\n        } // type of operator\n      } else if (tp === 'SymbolNode') {\n        const name = node.name // variable name\n        const pos = variables.indexOf(name)\n        if (pos === -1) {\n          // new variable in expression\n          variables.push(name)\n        }\n      } else if (tp === 'ParenthesisNode') {\n        recPoly(node.content)\n      } else if (tp !== 'ConstantNode') {\n        throw new Error('type ' + tp + ' is not allowed in polynomial expression')\n      }\n    } // end of recPoly\n  } // end of polynomial\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   * Return a rule set to rationalize an polynomial expression in rationalize\n   *\n   * Syntax:\n   *\n   *     rulesRationalize()\n   *\n   * @return {array}        rule set to rationalize an polynomial expression\n   */\n  function rulesRationalize () {\n    const oldRules = [simplifyCore, // sCore\n      { l: 'n+n', r: '2*n' },\n      { l: 'n+-n', r: '0' },\n      simplifyConstant, // sConstant\n      { l: 'n*(n1^-1)', r: 'n/n1' },\n      { l: 'n*n1^-n2', r: 'n/n1^n2' },\n      { l: 'n1^-1', r: '1/n1' },\n      { l: 'n*(n1/n2)', r: '(n*n1)/n2' },\n      { l: '1*n', r: 'n' }]\n\n    const rulesFirst = [\n      { l: '(-n1)/(-n2)', r: 'n1/n2' }, // Unary division\n      { l: '(-n1)*(-n2)', r: 'n1*n2' }, // Unary multiplication\n      { l: 'n1--n2', r: 'n1+n2' }, // '--' elimination\n      { l: 'n1-n2', r: 'n1+(-n2)' }, // Subtraction turn into add with un�ry minus\n      { l: '(n1+n2)*n3', r: '(n1*n3 + n2*n3)' }, // Distributive 1\n      { l: 'n1*(n2+n3)', r: '(n1*n2+n1*n3)' }, // Distributive 2\n      { l: 'c1*n + c2*n', r: '(c1+c2)*n' }, // Joining constants\n      { l: 'c1*n + n', r: '(c1+1)*n' }, // Joining constants\n      { l: 'c1*n - c2*n', r: '(c1-c2)*n' }, // Joining constants\n      { l: 'c1*n - n', r: '(c1-1)*n' }, // Joining constants\n      { l: 'v/c', r: '(1/c)*v' }, // variable/constant (new!)\n      { l: 'v/-c', r: '-(1/c)*v' }, // variable/constant (new!)\n      { l: '-v*-c', r: 'c*v' }, // Inversion constant and variable 1\n      { l: '-v*c', r: '-c*v' }, // Inversion constant and variable 2\n      { l: 'v*-c', r: '-c*v' }, // Inversion constant and variable 3\n      { l: 'v*c', r: 'c*v' }, // Inversion constant and variable 4\n      { l: '-(-n1*n2)', r: '(n1*n2)' }, // Unary propagation\n      { l: '-(n1*n2)', r: '(-n1*n2)' }, // Unary propagation\n      { l: '-(-n1+n2)', r: '(n1-n2)' }, // Unary propagation\n      { l: '-(n1+n2)', r: '(-n1-n2)' }, // Unary propagation\n      { l: '(n1^n2)^n3', r: '(n1^(n2*n3))' }, // Power to Power\n      { l: '-(-n1/n2)', r: '(n1/n2)' }, // Division and Unary\n      { l: '-(n1/n2)', r: '(-n1/n2)' }] // Divisao and Unary\n\n    const rulesDistrDiv = [\n      { l: '(n1/n2 + n3/n4)', r: '((n1*n4 + n3*n2)/(n2*n4))' }, // Sum of fractions\n      { l: '(n1/n2 + n3)', r: '((n1 + n3*n2)/n2)' }, // Sum fraction with number 1\n      { l: '(n1 + n2/n3)', r: '((n1*n3 + n2)/n3)' }] // Sum fraction with number 1\n\n    const rulesSucDiv = [\n      { l: '(n1/(n2/n3))', r: '((n1*n3)/n2)' }, // Division simplification\n      { l: '(n1/n2/n3)', r: '(n1/(n2*n3))' }]\n\n    const setRules = {} // rules set in 4 steps.\n\n    // All rules => infinite loop\n    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)\n\n    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv) // First rule set\n    setRules.distrDivRules = rulesDistrDiv // Just distr. div. rules\n    setRules.sucDivRules = rulesSucDiv // Jus succ. div. rules\n    setRules.firstRulesAgain = oldRules.concat(rulesFirst) // Last rules set without succ. div.\n\n    // Division simplification\n\n    // Second rule set.\n    // There is no aggregate expression with parentesis, but the only variable can be scattered.\n    setRules.finalRules = [simplifyCore, // simplify.rules[0]\n      { l: 'n*-n', r: '-n^2' }, // Joining multiply with power 1\n      { l: 'n*n', r: 'n^2' }, // Joining multiply with power 2\n      simplifyConstant, // simplify.rules[14] old 3rd index in oldRules\n      { l: 'n*-n^n1', r: '-n^(n1+1)' }, // Joining multiply with power 3\n      { l: 'n*n^n1', r: 'n^(n1+1)' }, // Joining multiply with power 4\n      { l: 'n^n1*-n^n2', r: '-n^(n1+n2)' }, // Joining multiply with power 5\n      { l: 'n^n1*n^n2', r: 'n^(n1+n2)' }, // Joining multiply with power 6\n      { l: 'n^n1*-n', r: '-n^(n1+1)' }, // Joining multiply with power 7\n      { l: 'n^n1*n', r: 'n^(n1+1)' }, // Joining multiply with power 8\n      { l: 'n^n1/-n', r: '-n^(n1-1)' }, // Joining multiply with power 8\n      { l: 'n^n1/n', r: 'n^(n1-1)' }, // Joining division with power 1\n      { l: 'n/-n^n1', r: '-n^(1-n1)' }, // Joining division with power 2\n      { l: 'n/n^n1', r: 'n^(1-n1)' }, // Joining division with power 3\n      { l: 'n^n1/-n^n2', r: 'n^(n1-n2)' }, // Joining division with power 4\n      { l: 'n^n1/n^n2', r: 'n^(n1-n2)' }, // Joining division with power 5\n      { l: 'n1+(-n2*n3)', r: 'n1-n2*n3' }, // Solving useless parenthesis 1\n      { l: 'v*(-c)', r: '-c*v' }, // Solving useless unary 2\n      { l: 'n1+-n2', r: 'n1-n2' }, // Solving +- together (new!)\n      { l: 'v*c', r: 'c*v' }, // inversion constant with variable\n      { l: '(n1^n2)^n3', r: '(n1^(n2*n3))' } // Power to Power\n\n    ]\n    return setRules\n  } // End rulesRationalize\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   *  Expand recursively a tree node for handling with expressions with exponents\n   *  (it's not for constants, symbols or functions with exponents)\n   *  PS: The other parameters are internal for recursion\n   *\n   * Syntax:\n   *\n   *     expandPower(node)\n   *\n   * @param  {Node} node         Current expression node\n   * @param  {node} parent       Parent current node inside the recursion\n   * @param  (int}               Parent number of chid inside the rercursion\n   *\n   * @return {node}        node expression with all powers expanded.\n   */\n  function expandPower (node, parent, indParent) {\n    const tp = node.type\n    const internal = (arguments.length > 1) // TRUE in internal calls\n\n    if (tp === 'OperatorNode' && node.isBinary()) {\n      let does = false\n      let val\n      if (node.op === '^') { // First operator: Parenthesis or UnaryMinus\n        if ((node.args[0].type === 'ParenthesisNode' ||\n            node.args[0].type === 'OperatorNode') &&\n            (node.args[1].type === 'ConstantNode')) { // Second operator: Constant\n          val = parseFloat(node.args[1].value)\n          does = (val >= 2 && isInteger(val))\n        }\n      }\n\n      if (does) { // Exponent >= 2\n        // Before:\n        //            operator A --> Subtree\n        // parent pow\n        //            constant\n        //\n        if (val > 2) { // Exponent > 2,\n          // AFTER:  (exponent > 2)\n          //             operator A --> Subtree\n          // parent  *\n          //                 deep clone (operator A --> Subtree\n          //             pow\n          //                 constant - 1\n          //\n          const nEsqTopo = node.args[0]\n          const nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)])\n          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo])\n        } else { // Expo = 2 - no power\n          // AFTER:  (exponent =  2)\n          //             operator A --> Subtree\n          // parent   oper\n          //            deep clone (operator A --> Subtree)\n          //\n          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()])\n        }\n\n        if (internal) {\n          // Change parent references in internal recursive calls\n          if (indParent === 'content') { parent.content = node } else { parent.args[indParent] = node }\n        }\n      } // does\n    } // binary OperatorNode\n\n    if (tp === 'ParenthesisNode') {\n      // Recursion\n      expandPower(node.content, node, 'content')\n    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {\n      for (let i = 0; i < node.args.length; i++) {\n        expandPower(node.args[i], node, i)\n      }\n    }\n\n    if (!internal) {\n      // return the root node\n      return node\n    }\n  } // End expandPower\n\n  // ---------------------------------------------------------------------------------------\n  /**\n   * Auxilary function for rationalize\n   * Convert near canonical polynomial in one variable in a canonical polynomial\n   * with one term for each exponent in decreasing order\n   *\n   * Syntax:\n   *\n   *     polyToCanonical(node [, coefficients])\n   *\n   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression\n   *\n   *        The string or tree expression needs to be at below syntax, with free spaces:\n   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+\n   *       Where 'var' is one variable with any valid name\n   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1\n   *             'expo' are integers greater than 0. It can be omitted if equal than 1.\n   *\n   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent\n   *\n   *\n   * @return {node}        new node tree with one variable polynomial or string error.\n   */\n  function polyToCanonical (node, coefficients) {\n    if (coefficients === undefined) { coefficients = [] } // coefficients.\n\n    coefficients[0] = 0 // index is the exponent\n    const o = {}\n    o.cte = 1\n    o.oper = '+'\n\n    // fire: mark with * or ^ when finds * or ^ down tree, reset to \"\" with + and -.\n    //       It is used to deduce the exponent: 1 for *, 0 for \"\".\n    o.fire = ''\n\n    let maxExpo = 0 // maximum exponent\n    let varname = '' // variable name\n\n    recurPol(node, null, o)\n    maxExpo = coefficients.length - 1\n    let first = true\n    let no\n\n    for (let i = maxExpo; i >= 0; i--) {\n      if (coefficients[i] === 0) continue\n      let n1 = new ConstantNode(\n        first ? coefficients[i] : Math.abs(coefficients[i]))\n      const op = coefficients[i] < 0 ? '-' : '+'\n\n      if (i > 0) { // Is not a constant without variable\n        let n2 = new SymbolNode(varname)\n        if (i > 1) {\n          const n3 = new ConstantNode(i)\n          n2 = new OperatorNode('^', 'pow', [n2, n3])\n        }\n        if (coefficients[i] === -1 && first) { n1 = new OperatorNode('-', 'unaryMinus', [n2]) } else if (Math.abs(coefficients[i]) === 1) { n1 = n2 } else { n1 = new OperatorNode('*', 'multiply', [n1, n2]) }\n      }\n\n      if (first) { no = n1 } else if (op === '+') { no = new OperatorNode('+', 'add', [no, n1]) } else { no = new OperatorNode('-', 'subtract', [no, n1]) }\n\n      first = false\n    } // for\n\n    if (first) { return new ConstantNode(0) } else { return no }\n\n    /**\n     * Recursive auxilary function inside polyToCanonical for\n     * converting expression in canonical form\n     *\n     * Syntax:\n     *\n     *     recurPol(node, noPai, obj)\n     *\n     * @param  {Node} node        The current subpolynomial expression\n     * @param  {Node | Null}  noPai   The current parent node\n     * @param  {object}    obj        Object with many internal flags\n     *\n     * @return {}                    No return. If error, throws an exception\n     */\n    function recurPol (node, noPai, o) {\n      const tp = node.type\n      if (tp === 'FunctionNode') {\n        // ***** FunctionName *****\n        // No function call in polynomial expression\n        throw new Error('There is an unsolved function call')\n      } else if (tp === 'OperatorNode') {\n        // ***** OperatorName *****\n        if (!'+-*^'.includes(node.op)) throw new Error('Operator ' + node.op + ' invalid')\n\n        if (noPai !== null) {\n          // -(unary),^  : children of *,+,-\n          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' &&\n                                noPai.fn !== 'subtract' && noPai.fn !== 'multiply') { throw new Error('Invalid ' + node.op + ' placing') }\n\n          // -,+,* : children of +,-\n          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') &&\n              noPai.fn !== 'add' && noPai.fn !== 'subtract') { throw new Error('Invalid ' + node.op + ' placing') }\n\n          // -,+ : first child\n          if ((node.fn === 'subtract' || node.fn === 'add' ||\n            node.fn === 'unaryMinus') && o.noFil !== 0) { throw new Error('Invalid ' + node.op + ' placing') }\n        } // Has parent\n\n        // Firers: ^,*       Old:   ^,&,-(unary): firers\n        if (node.op === '^' || node.op === '*') {\n          o.fire = node.op\n        }\n\n        for (let i = 0; i < node.args.length; i++) {\n          // +,-: reset fire\n          if (node.fn === 'unaryMinus') o.oper = '-'\n          if (node.op === '+' || node.fn === 'subtract') {\n            o.fire = ''\n            o.cte = 1 // default if there is no constant\n            o.oper = (i === 0 ? '+' : node.op)\n          }\n          o.noFil = i // number of son\n          recurPol(node.args[i], node, o)\n        } // for in children\n      } else if (tp === 'SymbolNode') { // ***** SymbolName *****\n        if (node.name !== varname && varname !== '') { throw new Error('There is more than one variable') }\n        varname = node.name\n        if (noPai === null) {\n          coefficients[1] = 1\n          return\n        }\n\n        // ^: Symbol is First child\n        if (noPai.op === '^' && o.noFil !== 0) { throw new Error('In power the variable should be the first parameter') }\n\n        // *: Symbol is Second child\n        if (noPai.op === '*' && o.noFil !== 1) { throw new Error('In multiply the variable should be the second parameter') }\n\n        // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)\n        if (o.fire === '' || o.fire === '*') {\n          if (maxExpo < 1) coefficients[1] = 0\n          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1)\n          maxExpo = Math.max(1, maxExpo)\n        }\n      } else if (tp === 'ConstantNode') {\n        const valor = parseFloat(node.value)\n        if (noPai === null) {\n          coefficients[0] = valor\n          return\n        }\n        if (noPai.op === '^') {\n          // cte: second  child of power\n          if (o.noFil !== 1) throw new Error('Constant cannot be powered')\n\n          if (!isInteger(valor) || valor <= 0) { throw new Error('Non-integer exponent is not allowed') }\n\n          for (let i = maxExpo + 1; i < valor; i++) coefficients[i] = 0\n          if (valor > maxExpo) coefficients[valor] = 0\n          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1)\n          maxExpo = Math.max(valor, maxExpo)\n          return\n        }\n        o.cte = valor\n\n        // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.\n        if (o.fire === '') { coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1) }\n      } else { throw new Error('Type ' + tp + ' is not allowed') }\n    } // End of recurPol\n  } // End of polyToCanonical\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'zpk2tf'\n\nconst dependencies = [\n  'typed',\n  'add',\n  'multiply',\n  'Complex',\n  'number'\n]\n\nexport const createZpk2tf = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, multiply, Complex, number }) => {\n  /**\n     * Compute the transfer function of a zero-pole-gain model.\n     *\n     * Syntax:\n     *      math.zpk2tf(z, p, k)\n     *\n     * Examples:\n     *    math.zpk2tf([1, 2], [-1, -2], 1)    // returns [[1, -3, 2], [1, 3, 2]]\n     *\n     * See also:\n     *   freqz\n     *\n     * @param {Array} z Array of zeros values\n     * @param {Array} p Array of poles values\n     * @param {number} k Gain value\n     * @return {Array} Two dimensional array containing the numerator (first row) and denominator (second row) polynomials\n     *\n     */\n  return typed(name, {\n    'Array,Array,number': function (z, p, k) {\n      return _zpk2tf(z, p, k)\n    },\n    'Array,Array': function (z, p) {\n      return _zpk2tf(z, p, 1)\n    },\n    'Matrix,Matrix,number': function (z, p, k) {\n      return _zpk2tf(z.valueOf(), p.valueOf(), k)\n    },\n    'Matrix,Matrix': function (z, p) {\n      return _zpk2tf(z.valueOf(), p.valueOf(), 1)\n    }\n  })\n\n  function _zpk2tf (z, p, k) {\n    // if z is bignumber, convert it to number\n    if (z.some((el) => el.type === 'BigNumber')) {\n      z = z.map((el) => number(el))\n    }\n    // if p is bignumber, convert it to number\n    if (p.some((el) => el.type === 'BigNumber')) {\n      p = p.map((el) => number(el))\n    }\n    let num = [Complex(1, 0)]\n    let den = [Complex(1, 0)]\n    for (let i = 0; i < z.length; i++) {\n      let zero = z[i]\n      if (typeof zero === 'number') zero = Complex(zero, 0)\n      num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)])\n    }\n    for (let i = 0; i < p.length; i++) {\n      let pole = p[i]\n      if (typeof pole === 'number') pole = Complex(pole, 0)\n      den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)])\n    }\n    for (let i = 0; i < num.length; i++) {\n      num[i] = multiply(num[i], k)\n    }\n    return [num, den]\n  }\n\n  function _multiply (a, b) {\n    const c = []\n    for (let i = 0; i < a.length + b.length - 1; i++) {\n      c[i] = Complex(0, 0)\n      for (let j = 0; j < a.length; j++) {\n        if (i - j >= 0 && i - j < b.length) {\n          c[i] = add(c[i], multiply(a[j], b[i - j]))\n        }\n      }\n    }\n    return c\n  }\n})\n","import { factory } from '../../utils/factory.js'\n\nconst name = 'freqz'\n\nconst dependencies = [\n  'typed',\n  'add',\n  'multiply',\n  'Complex',\n  'divide',\n  'matrix'\n]\n\nexport const createFreqz = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, multiply, Complex, divide, matrix }) => {\n  /**\n     * Calculates the frequency response of a filter given its numerator and denominator coefficients.\n     *\n     * Syntax:\n     *    math.freqz(b, a)\n     *    math.freqz(b, a, w)\n     *\n     * Examples:\n     *   math.freqz([1, 2], [1, 2, 3], 4) // returns { h: [0.5 + 0i, 0.4768589245763655 + 0.2861153547458193i, 0.25000000000000006 + 0.75i, -0.770976571635189 + 0.4625859429811135i], w: [0, 0.7853981633974483, 1.5707963267948966, 2.356194490192345 ] }\n     *   math.freqz([1, 2], [1, 2, 3], [0, 1]) // returns { h: [0.5 + 0i, 0.45436781 + 0.38598051i], w: [0, 1] }\n     *\n     * See also:\n     *  zpk2tf\n     *\n     * @param {Array.<number>} b The numerator coefficients of the filter.\n     * @param {Array.<number>} a The denominator coefficients of the filter.\n     * @param {Array.<number>} [w] A vector of frequencies (in radians/sample) at which the frequency response is to be computed or the number of points to compute (if a number is not provided, the default is 512 points)\n     * @returns {Object} An object with two properties: h, a vector containing the complex frequency response, and w, a vector containing the normalized frequencies (in radians/sample) at which the response was computed.\n     *\n     *\n     */\n  return typed(name, {\n    'Array, Array': function (b, a) {\n      const w = createBins(512)\n      return _freqz(b, a, w)\n    },\n    'Array, Array, Array': function (b, a, w) {\n      return _freqz(b, a, w)\n    },\n    'Array, Array, number': function (b, a, w) {\n      if (w < 0) {\n        throw new Error('w must be a positive number')\n      }\n      const w2 = createBins(w)\n      return _freqz(b, a, w2)\n    },\n    'Matrix, Matrix': function (b, a) {\n      // console.log('here')\n      const _w = createBins(512)\n      const { w, h } = _freqz(b.valueOf(), a.valueOf(), _w)\n      return {\n        w: matrix(w),\n        h: matrix(h)\n      }\n    },\n    'Matrix, Matrix, Matrix': function (b, a, w) {\n      const { h } = _freqz(b.valueOf(), a.valueOf(), w.valueOf())\n      return {\n        h: matrix(h),\n        w: matrix(w)\n      }\n    },\n    'Matrix, Matrix, number': function (b, a, w) {\n      if (w < 0) {\n        throw new Error('w must be a positive number')\n      }\n      const _w = createBins(w)\n      const { h } = _freqz(b.valueOf(), a.valueOf(), _w)\n      return {\n        h: matrix(h),\n        w: matrix(_w)\n      }\n    }\n  })\n\n  function _freqz (b, a, w) {\n    const num = []\n    const den = []\n    for (let i = 0; i < w.length; i++) {\n      let sumNum = Complex(0, 0)\n      let sumDen = Complex(0, 0)\n      for (let j = 0; j < b.length; j++) {\n        sumNum = add(sumNum, multiply(b[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))))\n      }\n      for (let j = 0; j < a.length; j++) {\n        sumDen = add(sumDen, multiply(a[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))))\n      }\n      num.push(sumNum)\n      den.push(sumDen)\n    }\n    const h = []\n    for (let i = 0; i < num.length; i++) {\n      h.push(divide(num[i], den[i]))\n    }\n    return { h, w }\n  }\n\n  function createBins (n) {\n    const bins = []\n    for (let i = 0; i < n; i++) {\n      bins.push(i / n * Math.PI)\n    }\n    return bins\n  }\n})\n","import { factory } from '../utils/factory.js'\n\nconst name = 'reviver'\nconst dependencies = [\n  'classes'\n]\n\nexport const createReviver = /* #__PURE__ */ factory(name, dependencies, ({ classes }) => {\n  /**\n   * Instantiate mathjs data types from their JSON representation\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the revived object\n   */\n  return function reviver (key, value) {\n    const constructor = classes[value && value.mathjs]\n\n    if (constructor && typeof constructor.fromJSON === 'function') {\n      return constructor.fromJSON(value)\n    }\n\n    return value\n  }\n})\n","import { factory } from '../utils/factory.js'\n\nconst name = 'replacer'\nconst dependencies = []\n\nexport const createReplacer = /* #__PURE__ */ factory(name, dependencies, () => {\n  /**\n   * Stringify data types into their JSON representation.\n   * Most data types can be serialized using their `.toJSON` method,\n   * but not all, for example the number `Infinity`. For these cases you have\n   * to use the replacer. Example usage:\n   *\n   *     JSON.stringify([2, Infinity], math.replacer)\n   *\n   * @param {string} key\n   * @param {*} value\n   * @returns {*} Returns the replaced object\n   */\n  return function replacer (key, value) {\n    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON\n    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {\n      return {\n        mathjs: 'number',\n        value: String(value)\n      }\n    }\n\n    if (typeof value === 'bigint') {\n      return {\n        mathjs: 'bigint',\n        value: String(value)\n      }\n    }\n\n    return value\n  }\n})\n","export const pi = Math.PI\nexport const tau = 2 * Math.PI\nexport const e = Math.E\nexport const phi = 1.6180339887498948 // eslint-disable-line no-loss-of-precision\n","import { factory } from './utils/factory.js'\nimport { version } from './version.js'\nimport {\n  createBigNumberE,\n  createBigNumberPhi,\n  createBigNumberPi,\n  createBigNumberTau\n} from './utils/bignumber/constants.js'\nimport { pi, tau, e, phi } from './plain/number/index.js'\n\nexport const createTrue = /* #__PURE__ */ factory('true', [], () => true)\nexport const createFalse = /* #__PURE__ */ factory('false', [], () => false)\nexport const createNull = /* #__PURE__ */ factory('null', [], () => null)\n\nexport const createInfinity = /* #__PURE__ */ recreateFactory(\n  'Infinity',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(Infinity)\n    : Infinity\n)\n\nexport const createNaN = /* #__PURE__ */ recreateFactory(\n  'NaN',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(NaN)\n    : NaN\n)\n\nexport const createPi = /* #__PURE__ */ recreateFactory(\n  'pi',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberPi(BigNumber)\n    : pi\n)\n\nexport const createTau = /* #__PURE__ */ recreateFactory(\n  'tau',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberTau(BigNumber)\n    : tau\n)\n\nexport const createE = /* #__PURE__ */ recreateFactory(\n  'e',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberE(BigNumber)\n    : e\n)\n\n// golden ratio, (1+sqrt(5))/2\nexport const createPhi = /* #__PURE__ */ recreateFactory(\n  'phi',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? createBigNumberPhi(BigNumber)\n    : phi\n)\n\nexport const createLN2 = /* #__PURE__ */ recreateFactory(\n  'LN2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(2).ln()\n    : Math.LN2\n)\n\nexport const createLN10 = /* #__PURE__ */ recreateFactory(\n  'LN10',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(10).ln()\n    : Math.LN10\n)\n\nexport const createLOG2E = /* #__PURE__ */ recreateFactory(\n  'LOG2E',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(1).div(new BigNumber(2).ln())\n    : Math.LOG2E\n)\n\nexport const createLOG10E = /* #__PURE__ */ recreateFactory(\n  'LOG10E',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(1).div(new BigNumber(10).ln())\n    : Math.LOG10E\n)\n\nexport const createSQRT1_2 = /* #__PURE__ */ recreateFactory( // eslint-disable-line camelcase\n  'SQRT1_2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber('0.5').sqrt()\n    : Math.SQRT1_2\n)\n\nexport const createSQRT2 = /* #__PURE__ */ recreateFactory(\n  'SQRT2',\n  ['config', '?BigNumber'],\n  ({ config, BigNumber }) => (config.number === 'BigNumber')\n    ? new BigNumber(2).sqrt()\n    : Math.SQRT2\n)\n\nexport const createI = /* #__PURE__ */ recreateFactory(\n  'i',\n  ['Complex'],\n  ({ Complex }) => Complex.I\n)\n\n// for backward compatibility with v5\nexport const createUppercasePi = /* #__PURE__ */ factory('PI', ['pi'], ({ pi }) => pi)\nexport const createUppercaseE = /* #__PURE__ */ factory('E', ['e'], ({ e }) => e)\n\nexport const createVersion = /* #__PURE__ */ factory('version', [], () => version)\n\n// helper function to create a factory with a flag recreateOnConfigChange\n// idea: allow passing optional properties to be attached to the factory function as 4th argument?\nfunction recreateFactory (name, dependencies, create) {\n  return factory(name, dependencies, create, {\n    recreateOnConfigChange: true\n  })\n}\n","export const version = '14.9.1'\n// Note: This file is automatically generated when building math.js.\n// Changes made in this file will be overwritten.\n","import { factory } from '../../utils/factory.js'\n\n// Source: https://en.wikipedia.org/wiki/Physical_constant\n\n// Universal constants\nexport const createSpeedOfLight = /* #__PURE__ */ unitFactory('speedOfLight', '299792458', 'm s^-1')\nexport const createGravitationConstant = /* #__PURE__ */ unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2')\nexport const createPlanckConstant = /* #__PURE__ */ unitFactory('planckConstant', '6.62607015e-34', 'J s')\nexport const createReducedPlanckConstant = /* #__PURE__ */ unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s')\n\n// Electromagnetic constants\nexport const createMagneticConstant = /* #__PURE__ */ unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2')\nexport const createElectricConstant = /* #__PURE__ */ unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1')\nexport const createVacuumImpedance = /* #__PURE__ */ unitFactory('vacuumImpedance', '376.730313667', 'ohm')\nexport const createCoulomb = /* #__PURE__ */ unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2') // Deprecated in favor of coulombConstant\nexport const createCoulombConstant = /* #__PURE__ */ unitFactory('coulombConstant', '8.987551792261171e9', 'N m^2 C^-2')\nexport const createElementaryCharge = /* #__PURE__ */ unitFactory('elementaryCharge', '1.602176634e-19', 'C')\nexport const createBohrMagneton = /* #__PURE__ */ unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1')\nexport const createConductanceQuantum = /* #__PURE__ */ unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S')\nexport const createInverseConductanceQuantum = /* #__PURE__ */ unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm')\nexport const createMagneticFluxQuantum = /* #__PURE__ */ unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb')\nexport const createNuclearMagneton = /* #__PURE__ */ unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1')\nexport const createKlitzing = /* #__PURE__ */ unitFactory('klitzing', '25812.807459304513', 'ohm')\nexport const createJosephson = /* #__PURE__ */ unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1') // TODO: support for Hz needed\n\n// Atomic and nuclear constants\nexport const createBohrRadius = /* #__PURE__ */ unitFactory('bohrRadius', '5.29177210903e-11', 'm')\nexport const createClassicalElectronRadius = /* #__PURE__ */ unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm')\nexport const createElectronMass = /* #__PURE__ */ unitFactory('electronMass', '9.1093837015e-31', 'kg')\nexport const createFermiCoupling = /* #__PURE__ */ unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2')\nexport const createFineStructure = numberFactory('fineStructure', 7.2973525693e-3)\nexport const createHartreeEnergy = /* #__PURE__ */ unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J')\nexport const createProtonMass = /* #__PURE__ */ unitFactory('protonMass', '1.67262192369e-27', 'kg')\nexport const createDeuteronMass = /* #__PURE__ */ unitFactory('deuteronMass', '3.3435830926e-27', 'kg')\nexport const createNeutronMass = /* #__PURE__ */ unitFactory('neutronMass', '1.6749271613e-27', 'kg')\nexport const createQuantumOfCirculation = /* #__PURE__ */ unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1')\nexport const createRydberg = /* #__PURE__ */ unitFactory('rydberg', '10973731.568160', 'm^-1')\nexport const createThomsonCrossSection = /* #__PURE__ */ unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2')\nexport const createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290)\nexport const createEfimovFactor = numberFactory('efimovFactor', 22.7)\n\n// Physico-chemical constants\nexport const createAtomicMass = /* #__PURE__ */ unitFactory('atomicMass', '1.66053906660e-27', 'kg')\nexport const createAvogadro = /* #__PURE__ */ unitFactory('avogadro', '6.02214076e23', 'mol^-1')\nexport const createBoltzmann = /* #__PURE__ */ unitFactory('boltzmann', '1.380649e-23', 'J K^-1')\nexport const createFaraday = /* #__PURE__ */ unitFactory('faraday', '96485.33212331001', 'C mol^-1')\nexport const createFirstRadiation = /* #__PURE__ */ unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2')\n// TODO spectralRadiance = 1.1910429723971881e-16 W m^2 sr^-1\nexport const createLoschmidt = /* #__PURE__ */ unitFactory('loschmidt', '2.686780111798444e25', 'm^-3')\nexport const createGasConstant = /* #__PURE__ */ unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1')\nexport const createMolarPlanckConstant = /* #__PURE__ */ unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1')\nexport const createMolarVolume = /* #__PURE__ */ unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1')\nexport const createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358)\nexport const createSecondRadiation = /* #__PURE__ */ unitFactory('secondRadiation', '0.014387768775039337', 'm K')\nexport const createStefanBoltzmann = /* #__PURE__ */ unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4')\nexport const createWienDisplacement = /* #__PURE__ */ unitFactory('wienDisplacement', '2.897771955e-3', 'm K')\n\n// Adopted values\nexport const createMolarMass = /* #__PURE__ */ unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1')\nexport const createMolarMassC12 = /* #__PURE__ */ unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1')\nexport const createGravity = /* #__PURE__ */ unitFactory('gravity', '9.80665', 'm s^-2')\n// atm is defined in Unit.js\n\n// Natural units\nexport const createPlanckLength = /* #__PURE__ */ unitFactory('planckLength', '1.616255e-35', 'm')\nexport const createPlanckMass = /* #__PURE__ */ unitFactory('planckMass', '2.176435e-8', 'kg')\nexport const createPlanckTime = /* #__PURE__ */ unitFactory('planckTime', '5.391245e-44', 's')\nexport const createPlanckCharge = /* #__PURE__ */ unitFactory('planckCharge', '1.87554603778e-18', 'C')\nexport const createPlanckTemperature = /* #__PURE__ */ unitFactory('planckTemperature', '1.416785e+32', 'K')\n\n// helper function to create a factory function which creates a physical constant,\n// a Unit with either a number value or a BigNumber value depending on the configuration\nfunction unitFactory (name, valueStr, unitStr) {\n  const dependencies = ['config', 'Unit', 'BigNumber']\n\n  return factory(name, dependencies, ({ config, Unit, BigNumber }) => {\n    // Note that we can parse into number or BigNumber.\n    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values\n    // Therefore we dont use Unit.parse()\n    const value = config.number === 'BigNumber'\n      ? new BigNumber(valueStr)\n      : parseFloat(valueStr)\n\n    const unit = new Unit(value, unitStr)\n    unit.fixPrefix = true\n    return unit\n  })\n}\n\n// helper function to create a factory function which creates a numeric constant,\n// either a number or BigNumber depending on the configuration\nfunction numberFactory (name, value) {\n  const dependencies = ['config', 'BigNumber']\n\n  return factory(name, dependencies, ({ config, BigNumber }) => {\n    return config.number === 'BigNumber'\n      ? new BigNumber(value)\n      : value\n  })\n}\n","import { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createMapSlices } from '../../function/matrix/mapSlices.js'\nimport { isBigNumber, isNumber } from '../../utils/is.js'\n\nconst name = 'mapSlices'\nconst dependencies = ['typed', 'isInteger']\n\n/**\n * Attach a transform function to math.mapSlices\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function mapSlices\n * from one-based to zero based\n */\nexport const createMapSlicesTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, isInteger }) => {\n  const mapSlices = createMapSlices({ typed, isInteger })\n\n  // @see: comment of concat itself\n  return typed('mapSlices', {\n    '...any': function (args) {\n      // change dim from one-based to zero-based\n      const dim = args[1]\n\n      if (isNumber(dim)) {\n        args[1] = dim - 1\n      } else if (isBigNumber(dim)) {\n        args[1] = dim.minus(1)\n      }\n\n      try {\n        return mapSlices.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true, ...createMapSlices.meta })\n","import { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createColumn } from '../../function/matrix/column.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'column'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nexport const createColumnTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  const column = createColumn({ typed, Index, matrix, range })\n\n  // @see: comment of column itself\n  return typed('column', {\n    '...any': function (args) {\n      // change last argument from zero-based to one-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      }\n\n      try {\n        return column.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isSymbolNode } from '../../../utils/is.js'\nimport { PartitionedMap } from '../../../utils/map.js'\n\n/**\n * Compile an inline expression like \"x > 0\"\n * @param {Node} expression\n * @param {Object} math\n * @param {Map} scope\n * @return {function} Returns a function with one argument which fills in the\n *                    undefined variable (like \"x\") and evaluates the expression\n */\nexport function compileInlineExpression (expression, math, scope) {\n  // find an undefined symbol\n  const symbol = expression.filter(function (node) {\n    return isSymbolNode(node) &&\n        !(node.name in math) &&\n        !(scope.has(node.name))\n  })[0]\n\n  if (!symbol) {\n    throw new Error('No undefined variable found in inline expression \"' + expression + '\"')\n  }\n\n  // create a test function for this equation\n  const name = symbol.name // variable name\n  const argsScope = new Map()\n  const subScope = new PartitionedMap(scope, argsScope, new Set([name]))\n  const eq = expression.compile()\n  return function inlineExpression (x) {\n    argsScope.set(name, x)\n    return eq.evaluate(subScope)\n  }\n}\n","import { factory } from '../../../utils/factory.js'\n\nconst name = 'transformCallback'\nconst dependencies = ['typed']\n\nexport const createTransformCallback = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n         * Transforms the given callback function based on its type and number of arrays.\n         *\n         * @param {Function} callback - The callback function to transform.\n         * @param {number} numberOfArrays - The number of arrays to pass to the callback function.\n         * @returns {*} - The transformed callback function.\n         */\n  return function (callback, numberOfArrays) {\n    if (typed.isTypedFunction(callback)) {\n      return _transformTypedCallbackFunction(callback, numberOfArrays)\n    } else {\n      return _transformCallbackFunction(callback, callback.length, numberOfArrays)\n    }\n  }\n\n  /**\n       * Transforms the given typed callback function based on the number of arrays.\n       *\n       * @param {Function} typedFunction - The typed callback function to transform.\n       * @param {number} numberOfArrays - The number of arrays to pass to the callback function.\n       * @returns {*} - The transformed callback function.\n       */\n  function _transformTypedCallbackFunction (typedFunction, numberOfArrays) {\n    const signatures = Object.fromEntries(\n      Object.entries(typedFunction.signatures)\n        .map(([signature, callbackFunction]) => {\n          const numberOfCallbackInputs = signature.split(',').length\n          if (typed.isTypedFunction(callbackFunction)) {\n            return [signature, _transformTypedCallbackFunction(callbackFunction, numberOfArrays)]\n          } else {\n            return [signature, _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays)]\n          }\n        })\n    )\n\n    if (typeof typedFunction.name === 'string') {\n      return typed(typedFunction.name, signatures)\n    } else {\n      return typed(signatures)\n    }\n  }\n})\n\n/**\n     * Transforms the callback function based on the number of callback inputs and arrays.\n     * There are three cases:\n     * 1. The callback function has N arguments.\n     * 2. The callback function has N+1 arguments.\n     * 3. The callback function has 2N+1 arguments.\n     *\n     * @param {Function} callbackFunction - The callback function to transform.\n     * @param {number} numberOfCallbackInputs - The number of callback inputs.\n     * @param {number} numberOfArrays - The number of arrays.\n     * @returns {Function} The transformed callback function.\n     */\nfunction _transformCallbackFunction (callbackFunction, numberOfCallbackInputs, numberOfArrays) {\n  if (numberOfCallbackInputs === numberOfArrays) {\n    return callbackFunction\n  } else if (numberOfCallbackInputs === numberOfArrays + 1) {\n    return function (...args) {\n      const vals = args.slice(0, numberOfArrays)\n      const idx = _transformDims(args[numberOfArrays])\n      return callbackFunction(...vals, idx)\n    }\n  } else if (numberOfCallbackInputs > numberOfArrays + 1) {\n    return function (...args) {\n      const vals = args.slice(0, numberOfArrays)\n      const idx = _transformDims(args[numberOfArrays])\n      const rest = args.slice(numberOfArrays + 1)\n      return callbackFunction(...vals, idx, ...rest)\n    }\n  } else {\n    return callbackFunction\n  }\n}\n\n/**\n   * Transforms the dimensions by adding 1 to each dimension.\n   *\n   * @param {Array} dims - The dimensions to transform.\n   * @returns {Array} The transformed dimensions.\n   */\nfunction _transformDims (dims) {\n  return dims.map(dim => dim + 1)\n}\n","import { createFilter } from '../../function/matrix/filter.js'\nimport { factory } from '../../utils/factory.js'\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\nimport { createTransformCallback } from './utils/transformCallback.js'\n\nconst name = 'filter'\nconst dependencies = ['typed']\n\nexport const createFilterTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.filter\n   * Adds a property transform containing the transform function.\n   *\n   * This transform adds support for equations as test function for math.filter,\n   * so you can do something like 'filter([3, -2, 5], x > 0)'.\n   */\n  function filterTransform (args, math, scope) {\n    const filter = createFilter({ typed })\n    const transformCallback = createTransformCallback({ typed })\n\n    if (args.length === 0) {\n      return filter()\n    }\n    let x = args[0]\n\n    if (args.length === 1) {\n      return filter(x)\n    }\n\n    const N = args.length - 1\n    let callback = args[N]\n\n    if (x) {\n      x = _compileAndEvaluate(x, scope)\n    }\n\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope)\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope)\n      }\n    }\n\n    return filter(x, transformCallback(callback, N))\n  }\n  filterTransform.rawArgs = true\n\n  function _compileAndEvaluate (arg, scope) {\n    return arg.compile().evaluate(scope)\n  }\n\n  return filterTransform\n}, { isTransformFunction: true })\n","import { createForEach } from '../../function/matrix/forEach.js'\nimport { createTransformCallback } from './utils/transformCallback.js'\nimport { factory } from '../../utils/factory.js'\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\n\nconst name = 'forEach'\nconst dependencies = ['typed']\n\nexport const createForEachTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.forEach\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  const forEach = createForEach({ typed })\n  const transformCallback = createTransformCallback({ typed })\n  function forEachTransform (args, math, scope) {\n    if (args.length === 0) {\n      return forEach()\n    }\n    let x = args[0]\n\n    if (args.length === 1) {\n      return forEach(x)\n    }\n\n    const N = args.length - 1\n    let callback = args[N]\n\n    if (x) {\n      x = _compileAndEvaluate(x, scope)\n    }\n\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope)\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope)\n      }\n    }\n\n    return forEach(x, transformCallback(callback, N))\n  }\n  forEachTransform.rawArgs = true\n\n  function _compileAndEvaluate (arg, scope) {\n    return arg.compile().evaluate(scope)\n  }\n  return forEachTransform\n}, { isTransformFunction: true })\n","import {\n  isArray, isBigInt, isBigNumber, isMatrix, isNumber, isRange\n} from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\n\nconst name = 'index'\nconst dependencies = ['Index', 'getMatrixDataType']\n\nexport const createIndexTransform = /* #__PURE__ */ factory(name, dependencies, ({ Index, getMatrixDataType }) => {\n  /**\n   * Attach a transform function to math.index\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  return function indexTransform () {\n    const args = []\n    for (let i = 0, ii = arguments.length; i < ii; i++) {\n      let arg = arguments[i]\n\n      // change from one-based to zero based, convert BigNumber to number and leave Array of Booleans as is\n      if (isRange(arg)) {\n        arg.start--\n        arg.end -= (arg.step > 0 ? 0 : 2)\n      } else if (arg && arg.isSet === true) {\n        arg = arg.map(function (v) { return v - 1 })\n      } else if (isArray(arg) || isMatrix(arg)) {\n        if (getMatrixDataType(arg) !== 'boolean') {\n          arg = arg.map(function (v) { return v - 1 })\n        }\n      } else if (isNumber(arg) || isBigInt(arg)) {\n        arg--\n      } else if (isBigNumber(arg)) {\n        arg = arg.toNumber() - 1\n      } else if (typeof arg === 'string') {\n      // leave as is\n      } else {\n        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range')\n      }\n\n      args[i] = arg\n    }\n\n    const res = new Index()\n    Index.apply(res, args)\n    return res\n  }\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js'\nimport { createMap } from '../../function/matrix/map.js'\nimport { compileInlineExpression } from './utils/compileInlineExpression.js'\nimport { createTransformCallback } from './utils/transformCallback.js'\n\nconst name = 'map'\nconst dependencies = ['typed']\n\nexport const createMapTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed }) => {\n  /**\n   * Attach a transform function to math.map\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a one-based index instead of a zero-based index\n   */\n  const map = createMap({ typed })\n  const transformCallback = createTransformCallback({ typed })\n\n  function mapTransform (args, math, scope) {\n    if (args.length === 0) {\n      return map()\n    }\n\n    if (args.length === 1) {\n      return map(args[0])\n    }\n    const N = args.length - 1\n    let X = args.slice(0, N)\n    let callback = args[N]\n    X = X.map(arg => _compileAndEvaluate(arg, scope))\n\n    if (callback) {\n      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {\n        // a function pointer, like filter([3, -2, 5], myTestFunction)\n        callback = _compileAndEvaluate(callback, scope)\n      } else {\n        // an expression like filter([3, -2, 5], x > 0)\n        callback = compileInlineExpression(callback, math, scope)\n      }\n    }\n    return map(...X, transformCallback(callback, N))\n\n    function _compileAndEvaluate (arg, scope) {\n      return arg.compile().evaluate(scope)\n    }\n  }\n  mapTransform.rawArgs = true\n\n  return mapTransform\n}, { isTransformFunction: true })\n","import { isCollection } from '../../../utils/is.js'\nimport { dimToZeroBase, isNumberOrBigNumber } from './dimToZeroBase.js'\n/**\n * Change last argument dim from one-based to zero-based.\n */\nexport function lastDimToZeroBase (args) {\n  if (args.length === 2 && isCollection(args[0])) {\n    args = args.slice()\n    const dim = args[1]\n    if (isNumberOrBigNumber(dim)) {\n      args[1] = dimToZeroBase(dim)\n    }\n  }\n  return args\n}\n","import { isNumber, isBigNumber } from '../../../utils/is.js'\n/**\n * Change last argument dim from one-based to zero-based.\n */\nexport function dimToZeroBase (dim) {\n  if (isNumber(dim)) {\n    return dim - 1\n  } else if (isBigNumber(dim)) {\n    return dim.minus(1)\n  } else {\n    return dim\n  }\n}\n\nexport function isNumberOrBigNumber (n) {\n  return isNumber(n) || isBigNumber(n)\n}\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMax } from '../../function/statistics/max.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'max'\nconst dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN']\n\nexport const createMaxTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, larger, isNaN: mathIsNaN }) => {\n  const max = createMax({ typed, config, numeric, larger, isNaN: mathIsNaN })\n\n  /**\n   * Attach a transform function to math.max\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function max\n   * from one-based to zero based\n   */\n  return typed('max', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return max.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMean } from '../../function/statistics/mean.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'mean'\nconst dependencies = ['typed', 'add', 'divide']\n\nexport const createMeanTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, divide }) => {\n  const mean = createMean({ typed, add, divide })\n\n  /**\n   * Attach a transform function to math.mean\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function mean\n   * from one-based to zero based\n   */\n  return typed('mean', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return mean.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createMin } from '../../function/statistics/min.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'min'\nconst dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN']\n\nexport const createMinTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, numeric, smaller, isNaN: mathIsNaN }) => {\n  const min = createMin({ typed, config, numeric, smaller, isNaN: mathIsNaN })\n\n  /**\n   * Attach a transform function to math.min\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function min\n   * from one-based to zero based\n   */\n  return typed('min', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return min.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createRange } from '../../function/matrix/range.js'\n\nconst name = 'range'\nconst dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive']\n\nexport const createRangeTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, matrix, bignumber, equal, smaller, smallerEq, larger, largerEq, add, isZero, isPositive }) => {\n  const range = createRange({ typed, config, matrix, bignumber, equal, smaller, smallerEq, larger, largerEq, add, isZero, isPositive })\n\n  /**\n   * Attach a transform function to math.range\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed('range', {\n    '...any': function (args) {\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (typeof last !== 'boolean') {\n        // append a parameter includeEnd=true\n        args.push(true)\n      }\n\n      return range.apply(null, args)\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createRow } from '../../function/matrix/row.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { isNumber } from '../../utils/is.js'\n\nconst name = 'row'\nconst dependencies = ['typed', 'Index', 'matrix', 'range']\n\n/**\n * Attach a transform function to matrix.column\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `index` parameter of function column\n * from zero-based to one-based\n */\nexport const createRowTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, Index, matrix, range }) => {\n  const row = createRow({ typed, Index, matrix, range })\n\n  // @see: comment of row itself\n  return typed('row', {\n    '...any': function (args) {\n      // change last argument from zero-based to one-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      }\n\n      try {\n        return row.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createSubset } from '../../function/matrix/subset.js'\n\nconst name = 'subset'\nconst dependencies = ['typed', 'matrix', 'zeros', 'add']\n\nexport const createSubsetTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, zeros, add }) => {\n  const subset = createSubset({ typed, matrix, zeros, add })\n\n  /**\n   * Attach a transform function to math.subset\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed('subset', {\n    '...any': function (args) {\n      try {\n        return subset.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { isBigNumber, isNumber } from '../../utils/is.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { factory } from '../../utils/factory.js'\nimport { createConcat } from '../../function/matrix/concat.js'\n\nconst name = 'concat'\nconst dependencies = ['typed', 'matrix', 'isInteger']\n\nexport const createConcatTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, isInteger }) => {\n  const concat = createConcat({ typed, matrix, isInteger })\n\n  /**\n   * Attach a transform function to math.range\n   * Adds a property transform containing the transform function.\n   *\n   * This transform changed the last `dim` parameter of function concat\n   * from one-based to zero based\n   */\n  return typed('concat', {\n    '...any': function (args) {\n      // change last argument from one-based to zero-based\n      const lastIndex = args.length - 1\n      const last = args[lastIndex]\n      if (isNumber(last)) {\n        args[lastIndex] = last - 1\n      } else if (isBigNumber(last)) {\n        args[lastIndex] = last.minus(1)\n      }\n\n      try {\n        return concat.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createDiff } from '../../function/matrix/diff.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'diff'\nconst dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber']\n\nexport const createDiffTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, subtract, number, bignumber }) => {\n  const diff = createDiff({ typed, matrix, subtract, number, bignumber })\n\n  /**\n   * Attach a transform function to math.diff\n   * Adds a property transform containing the transform function.\n   *\n   * This transform creates a range which includes the end value\n   */\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return diff.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createStd } from '../../function/statistics/std.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'std'\nconst dependencies = ['typed', 'map', 'sqrt', 'variance']\n\n/**\n * Attach a transform function to math.std\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function std\n * from one-based to zero based\n */\nexport const createStdTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, map, sqrt, variance }) => {\n  const std = createStd({ typed, map, sqrt, variance })\n\n  return typed('std', {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return std.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createSum } from '../../function/statistics/sum.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\n/**\n * Attach a transform function to math.sum\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function sum\n * from one-based to zero based\n */\nconst name = 'sum'\nconst dependencies = ['typed', 'config', 'add', 'numeric']\n\nexport const createSumTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, config, add, numeric }) => {\n  const sum = createSum({ typed, config, add, numeric })\n\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return sum.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { createQuantileSeq } from '../../function/statistics/quantileSeq.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'quantileSeq'\nconst dependencies = ['typed', 'bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices']\n\n/**\n * Attach a transform function to math.quantileSeq\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function std\n * from one-based to zero based\n */\nexport const createQuantileSeqTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, bignumber, add, subtract, divide, multiply, partitionSelect, compare, isInteger, smaller, smallerEq, larger, mapSlices }) => {\n  const quantileSeq = createQuantileSeq({ typed, bignumber, add, subtract, divide, multiply, partitionSelect, compare, isInteger, smaller, smallerEq, larger, mapSlices })\n\n  return typed('quantileSeq', {\n    'Array | Matrix, number | BigNumber': quantileSeq,\n    'Array | Matrix, number | BigNumber, number': (arr, prob, dim) => quantileSeq(arr, prob, dimToZeroBase(dim)),\n    'Array | Matrix, number | BigNumber, boolean': quantileSeq,\n    'Array | Matrix, number | BigNumber, boolean, number': (arr, prob, sorted, dim) => quantileSeq(arr, prob, sorted, dimToZeroBase(dim)),\n    'Array | Matrix, Array | Matrix': quantileSeq,\n    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => quantileSeq(data, prob, dimToZeroBase(dim)),\n    'Array | Matrix, Array | Matrix, boolean': quantileSeq,\n    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => quantileSeq(data, prob, sorted, dimToZeroBase(dim))\n  })\n\n  function dimToZeroBase (dim) {\n    // TODO: find a better way, maybe lastDimToZeroBase could apply to more cases.\n    return lastDimToZeroBase([[], dim])[1]\n  }\n}, { isTransformFunction: true })\n","import { isBigNumber, isCollection, isNumber } from '../../utils/is.js'\nimport { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createCumSum } from '../../function/statistics/cumsum.js'\n\n/**\n * Attach a transform function to math.sum\n * Adds a property transform containing the transform function.\n *\n * This transform changed the last `dim` parameter of function sum\n * from one-based to zero based\n */\nconst name = 'cumsum'\nconst dependencies = ['typed', 'add', 'unaryPlus']\n\nexport const createCumSumTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, unaryPlus }) => {\n  const cumsum = createCumSum({ typed, add, unaryPlus })\n\n  return typed(name, {\n    '...any': function (args) {\n      // change last argument dim from one-based to zero-based\n      if (args.length === 2 && isCollection(args[0])) {\n        const dim = args[1]\n        if (isNumber(dim)) {\n          args[1] = dim - 1\n        } else if (isBigNumber(dim)) {\n          args[1] = dim.minus(1)\n        }\n      }\n\n      try {\n        return cumsum.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { factory } from '../../utils/factory.js'\nimport { errorTransform } from './utils/errorTransform.js'\nimport { createVariance } from '../../function/statistics/variance.js'\nimport { lastDimToZeroBase } from './utils/lastDimToZeroBase.js'\n\nconst name = 'variance'\nconst dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN']\n\n/**\n * Attach a transform function to math.var\n * Adds a property transform containing the transform function.\n *\n * This transform changed the `dim` parameter of function var\n * from one-based to zero based\n */\nexport const createVarianceTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, add, subtract, multiply, divide, mapSlices, isNaN: mathIsNaN }) => {\n  const variance = createVariance({ typed, add, subtract, multiply, divide, mapSlices, isNaN: mathIsNaN })\n\n  return typed(name, {\n    '...any': function (args) {\n      args = lastDimToZeroBase(args)\n\n      try {\n        return variance.apply(null, args)\n      } catch (err) {\n        throw errorTransform(err)\n      }\n    }\n  })\n}, { isTransformFunction: true })\n","import { createPrint } from '../../function/string/print.js'\nimport { factory } from '../../utils/factory.js'\nimport { printTemplate } from '../../utils/print.js'\n\nconst name = 'print'\nconst dependencies = ['typed', 'matrix', 'zeros', 'add']\n\nexport const createPrintTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, zeros, add }) => {\n  const print = createPrint({ typed, matrix, zeros, add })\n  return typed(name, {\n    'string, Object | Array': function (template, values) { return print(_convertTemplateToZeroBasedIndex(template), values) },\n    'string, Object | Array, number | Object': function (template, values, options) { return print(_convertTemplateToZeroBasedIndex(template), values, options) }\n  })\n\n  function _convertTemplateToZeroBasedIndex (template) {\n    return template.replace(printTemplate, (x) => {\n      const parts = x.slice(1).split('.')\n      const result = parts.map(function (part) {\n        if (!isNaN(part) && part.length > 0) {\n          return parseInt(part) - 1\n        } else {\n          return part\n        }\n      })\n      return '$' + result.join('.')\n    })\n  }\n}, { isTransformFunction: true })\n","import { createAnd } from '../../function/logical/and.js'\nimport { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\n\nconst name = 'and'\nconst dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat']\n\nexport const createAndTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, not, concat }) => {\n  const and = createAnd({ typed, matrix, equalScalar, zeros, not, concat })\n\n  function andTransform (args, math, scope) {\n    const condition1 = args[0].compile().evaluate(scope)\n    if (!isCollection(condition1) && !and(condition1, true)) {\n      return false\n    }\n    const condition2 = args[1].compile().evaluate(scope)\n    return and(condition1, condition2)\n  }\n\n  andTransform.rawArgs = true\n\n  return andTransform\n}, { isTransformFunction: true })\n","import { createOr } from '../../function/logical/or.js'\nimport { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\n\nconst name = 'or'\nconst dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat']\n\nexport const createOrTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix, concat }) => {\n  const or = createOr({ typed, matrix, equalScalar, DenseMatrix, concat })\n\n  function orTransform (args, math, scope) {\n    const condition1 = args[0].compile().evaluate(scope)\n    if (!isCollection(condition1) && or(condition1, false)) {\n      return true\n    }\n    const condition2 = args[1].compile().evaluate(scope)\n    return or(condition1, condition2)\n  }\n\n  orTransform.rawArgs = true\n\n  return orTransform\n}, { isTransformFunction: true })\n","import { createNullish } from '../../function/logical/nullish.js'\nimport { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\n\nconst name = 'nullish'\nconst dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual']\n\nexport const createNullishTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, size, flatten, deepEqual }) => {\n  const nullish = createNullish({ typed, matrix, size, flatten, deepEqual })\n\n  function nullishTransform (args, math, scope) {\n    const left = args[0].compile().evaluate(scope)\n\n    // If left is not a collection and not nullish, short-circuit and return it\n    if (!isCollection(left) && left != null && left !== undefined) {\n      return left\n    }\n\n    // Otherwise evaluate right and apply full nullish semantics (incl. element-wise)\n    const right = args[1].compile().evaluate(scope)\n    return nullish(left, right)\n  }\n\n  nullishTransform.rawArgs = true\n\n  return nullishTransform\n}, { isTransformFunction: true })\n","import { createBitAnd } from '../../function/bitwise/bitAnd.js'\nimport { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\n\nconst name = 'bitAnd'\nconst dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat']\n\nexport const createBitAndTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, zeros, not, concat }) => {\n  const bitAnd = createBitAnd({ typed, matrix, equalScalar, zeros, not, concat })\n\n  function bitAndTransform (args, math, scope) {\n    const condition1 = args[0].compile().evaluate(scope)\n    if (!isCollection(condition1)) {\n      if (isNaN(condition1)) {\n        return NaN\n      }\n      if (condition1 === 0 || condition1 === false) {\n        return 0\n      }\n    }\n    const condition2 = args[1].compile().evaluate(scope)\n    return bitAnd(condition1, condition2)\n  }\n\n  bitAndTransform.rawArgs = true\n\n  return bitAndTransform\n}, { isTransformFunction: true })\n","import { createBitOr } from '../../function/bitwise/bitOr.js'\nimport { factory } from '../../utils/factory.js'\nimport { isCollection } from '../../utils/is.js'\n\nconst name = 'bitOr'\nconst dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat']\n\nexport const createBitOrTransform = /* #__PURE__ */ factory(name, dependencies, ({ typed, matrix, equalScalar, DenseMatrix, concat }) => {\n  const bitOr = createBitOr({ typed, matrix, equalScalar, DenseMatrix, concat })\n\n  function bitOrTransform (args, math, scope) {\n    const condition1 = args[0].compile().evaluate(scope)\n    if (!isCollection(condition1)) {\n      if (isNaN(condition1)) {\n        return NaN\n      }\n      if (condition1 === (-1)) {\n        return -1\n      }\n      if (condition1 === true) {\n        return 1\n      }\n    }\n    const condition2 = args[1].compile().evaluate(scope)\n    return bitOr(condition1, condition2)\n  }\n\n  bitOrTransform.rawArgs = true\n\n  return bitOrTransform\n}, { isTransformFunction: true })\n","export const DEFAULT_CONFIG = {\n  // minimum relative difference between two compared values,\n  // used by all comparison functions\n  relTol: 1e-12,\n\n  // minimum absolute difference between two compared values,\n  // used by all comparison functions\n  absTol: 1e-15,\n\n  // type of default matrix output. Choose 'matrix' (default) or 'array'\n  matrix: 'Matrix',\n\n  // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'\n  number: 'number',\n\n  // type of fallback used for config { number: 'bigint' } when a value cannot be represented\n  // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.\n  numberFallback: 'number',\n\n  // number of significant digits in BigNumbers\n  precision: 64,\n\n  // predictable output type of functions. When true, output type depends only\n  // on the input types. When false (default), output type can vary depending\n  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when\n  // predictable is false, and returns `NaN` when true.\n  predictable: false,\n\n  // random seed for seeded pseudo random number generation\n  // null = randomly seed\n  randomSeed: null\n}\n","import { clone, deepExtend } from '../../utils/object.js'\nimport { DEFAULT_CONFIG } from '../config.js'\n\nexport const MATRIX_OPTIONS = ['Matrix', 'Array'] // valid values for option matrix\nexport const NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', 'Fraction'] // valid values for option number\n\nexport function configFactory (config, emit) {\n  /**\n   * Set configuration options for math.js, and get current options.\n   * Will emit a 'config' event, with arguments (curr, prev, changes).\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *     math.config(config: Object): Object\n   *\n   * Examples:\n   *\n   *     import { create, all } from 'mathjs'\n   *\n   *     // create a mathjs instance\n   *     const math = create(all)\n   *\n   *     math.config().number                // outputs 'number'\n   *     math.evaluate('0.4')                // outputs number 0.4\n   *     math.config({number: 'Fraction'})\n   *     math.evaluate('0.4')                // outputs Fraction 2/5\n   *\n   * @param {Object} [options] Available options:\n   *                            {number} relTol\n   *                              Minimum relative difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {number} absTol\n   *                              Minimum absolute difference between two\n   *                              compared values, used by all comparison functions.\n   *                            {string} matrix\n   *                              A string 'Matrix' (default) or 'Array'.\n   *                            {string} number\n   *                              A string 'number' (default), 'BigNumber', 'bigint', or 'Fraction'\n   *                            {number} precision\n   *                              The number of significant digits for BigNumbers.\n   *                              Not applicable for Numbers.\n   *                            {string} parenthesis\n   *                              How to display parentheses in LaTeX and string\n   *                              output.\n   *                            {string} randomSeed\n   *                              Random seed for seeded pseudo random number generator.\n   *                              Set to null to randomly seed.\n   * @return {Object} Returns the current configuration\n   */\n  function _config (options) {\n    if (options) {\n      if (options.epsilon !== undefined) {\n        // this if is only for backwards compatibility, it can be removed in the future.\n        console.warn('Warning: The configuration option \"epsilon\" is deprecated. Use \"relTol\" and \"absTol\" instead.')\n        const optionsFix = clone(options)\n        optionsFix.relTol = options.epsilon\n        optionsFix.absTol = options.epsilon * 1e-3\n        delete optionsFix.epsilon\n        return _config(optionsFix)\n      }\n      const prev = clone(config)\n\n      // validate some of the options\n      validateOption(options, 'matrix', MATRIX_OPTIONS)\n      validateOption(options, 'number', NUMBER_OPTIONS)\n\n      // merge options\n      deepExtend(config, options)\n\n      const curr = clone(config)\n\n      const changes = clone(options)\n\n      // emit 'config' event\n      emit('config', curr, prev, changes)\n\n      return curr\n    } else {\n      return clone(config)\n    }\n  }\n\n  // attach the valid options to the function so they can be extended\n  _config.MATRIX_OPTIONS = MATRIX_OPTIONS\n  _config.NUMBER_OPTIONS = NUMBER_OPTIONS\n\n  // attach the config properties as readonly properties to the config function\n  Object.keys(DEFAULT_CONFIG).forEach(key => {\n    Object.defineProperty(_config, key, {\n      get: () => config[key],\n      enumerable: true,\n      configurable: true\n    })\n  })\n\n  return _config\n}\n\n/**\n * Validate an option\n * @param {Object} options         Object with options\n * @param {string} name            Name of the option to validate\n * @param {Array.<string>} values  Array with valid values for this option\n */\nfunction validateOption (options, name, values) {\n  if (options[name] !== undefined && !values.includes(options[name])) {\n    // unknown value\n    console.warn('Warning: Unknown value \"' + options[name] + '\" for configuration option \"' + name + '\". ' +\n      'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.')\n  }\n}\n","import * as all from './factoriesAny.js'\nimport { create } from './core/create.js'\n\nexport default create(all)\n","import typedFunction from 'typed-function'\nimport { ArgumentsError } from '../error/ArgumentsError.js'\nimport { DimensionError } from '../error/DimensionError.js'\nimport { IndexError } from '../error/IndexError.js'\nimport { factory, isFactory } from '../utils/factory.js'\nimport {\n  isAccessorNode,\n  isArray,\n  isArrayNode,\n  isAssignmentNode,\n  isBigInt,\n  isBigNumber,\n  isBlockNode,\n  isBoolean,\n  isChain,\n  isCollection,\n  isComplex,\n  isConditionalNode,\n  isConstantNode,\n  isDate,\n  isDenseMatrix,\n  isFraction,\n  isFunction,\n  isFunctionAssignmentNode,\n  isFunctionNode,\n  isHelp,\n  isIndex,\n  isIndexNode,\n  isMap,\n  isMatrix,\n  isNode,\n  isNull,\n  isNumber,\n  isObject,\n  isObjectNode,\n  isObjectWrappingMap,\n  isOperatorNode,\n  isParenthesisNode,\n  isPartitionedMap,\n  isRange,\n  isRangeNode,\n  isRegExp,\n  isRelationalNode,\n  isResultSet,\n  isSparseMatrix,\n  isString,\n  isSymbolNode,\n  isUndefined,\n  isUnit\n} from '../utils/is.js'\nimport { deepFlatten, isLegacyFactory } from '../utils/object.js'\nimport * as emitter from './../utils/emitter.js'\nimport { DEFAULT_CONFIG } from './config.js'\nimport { configFactory } from './function/config.js'\nimport { importFactory } from './function/import.js'\n\n/**\n * Create a mathjs instance from given factory functions and optionally config\n *\n * Usage:\n *\n *     const mathjs1 = create({ createAdd, createMultiply, ...})\n *     const config = { number: 'BigNumber' }\n *     const mathjs2 = create(all, config)\n *\n * @param {Object} [factories] An object with factory functions\n *                             The object can contain nested objects,\n *                             all nested objects will be flattened.\n * @param {Object} [config]    Available options:\n *                            {number} relTol\n *                              Minimum relative difference between two\n *                              compared values, used by all comparison functions.\n *                            {number} absTol\n *                              Minimum absolute difference between two\n *                              compared values, used by all comparison functions.\n *                            {string} matrix\n *                              A string 'Matrix' (default) or 'Array'.\n *                            {string} number\n *                              A string 'number' (default), 'BigNumber', or 'Fraction'\n *                            {number} precision\n *                              The number of significant digits for BigNumbers.\n *                              Not applicable for Numbers.\n *                            {boolean} predictable\n *                              Predictable output type of functions. When true,\n *                              output type depends only on the input types. When\n *                              false (default), output type can vary depending\n *                              on input values. For example `math.sqrt(-4)`\n *                              returns `complex('2i')` when predictable is false, and\n *                              returns `NaN` when true.\n *                            {string} randomSeed\n *                              Random seed for seeded pseudo random number generator.\n *                              Set to null to randomly seed.\n * @returns {Object} Returns a bare-bone math.js instance containing\n *                   functions:\n *                   - `import` to add new functions\n *                   - `config` to change configuration\n *                   - `on`, `off`, `once`, `emit` for events\n */\nexport function create (factories, config) {\n  const configInternal = Object.assign({}, DEFAULT_CONFIG, config)\n\n  // simple test for ES5 support\n  if (typeof Object.create !== 'function') {\n    throw new Error('ES5 not supported by this JavaScript engine. ' +\n      'Please load the es5-shim and es5-sham library for compatibility.')\n  }\n\n  // create the mathjs instance\n  const math = emitter.mixin({\n    // only here for backward compatibility for legacy factory functions\n    isNumber,\n    isComplex,\n    isBigNumber,\n    isBigInt,\n    isFraction,\n    isUnit,\n    isString,\n    isArray,\n    isMatrix,\n    isCollection,\n    isDenseMatrix,\n    isSparseMatrix,\n    isRange,\n    isIndex,\n    isBoolean,\n    isResultSet,\n    isHelp,\n    isFunction,\n    isDate,\n    isRegExp,\n    isObject,\n    isMap,\n    isPartitionedMap,\n    isObjectWrappingMap,\n    isNull,\n    isUndefined,\n\n    isAccessorNode,\n    isArrayNode,\n    isAssignmentNode,\n    isBlockNode,\n    isConditionalNode,\n    isConstantNode,\n    isFunctionAssignmentNode,\n    isFunctionNode,\n    isIndexNode,\n    isNode,\n    isObjectNode,\n    isOperatorNode,\n    isParenthesisNode,\n    isRangeNode,\n    isRelationalNode,\n    isSymbolNode,\n\n    isChain\n  })\n\n  // load config function and apply provided config\n  math.config = configFactory(configInternal, math.emit)\n\n  math.expression = {\n    transform: {},\n    mathWithTransform: {\n      config: math.config\n    }\n  }\n\n  // cached factories and instances used by function load\n  const legacyFactories = []\n  const legacyInstances = []\n\n  /**\n   * Load a function or data type from a factory.\n   * If the function or data type already exists, the existing instance is\n   * returned.\n   * @param {Function} factory\n   * @returns {*}\n   */\n  function load (factory) {\n    if (isFactory(factory)) {\n      return factory(math)\n    }\n\n    const firstProperty = factory[Object.keys(factory)[0]]\n    if (isFactory(firstProperty)) {\n      return firstProperty(math)\n    }\n\n    if (!isLegacyFactory(factory)) {\n      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory)\n      throw new Error('Factory object with properties `type`, `name`, and `factory` expected')\n    }\n\n    const index = legacyFactories.indexOf(factory)\n    let instance\n    if (index === -1) {\n      // doesn't yet exist\n      if (factory.math === true) {\n        // pass with math namespace\n        instance = factory.factory(math.type, configInternal, load, math.typed, math)\n      } else {\n        instance = factory.factory(math.type, configInternal, load, math.typed)\n      }\n\n      // append to the cache\n      legacyFactories.push(factory)\n      legacyInstances.push(instance)\n    } else {\n      // already existing function, return the cached instance\n      instance = legacyInstances[index]\n    }\n\n    return instance\n  }\n\n  const importedFactories = {}\n\n  // load the import function\n  function lazyTyped (...args) {\n    return math.typed.apply(math.typed, args)\n  }\n  lazyTyped.isTypedFunction = typedFunction.isTypedFunction\n\n  const internalImport = importFactory(lazyTyped, load, math, importedFactories)\n  math.import = internalImport\n\n  // listen for changes in config, import all functions again when changed\n  // TODO: move this listener into the import function?\n  math.on('config', () => {\n    Object.values(importedFactories).forEach(factory => {\n      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {\n        // FIXME: only re-create when the current instance is the same as was initially created\n        // FIXME: delete the functions/constants before importing them again?\n        internalImport(factory, { override: true })\n      }\n    })\n  })\n\n  // the create function exposed on the mathjs instance is bound to\n  // the factory functions passed before\n  math.create = create.bind(null, factories)\n\n  // export factory function\n  math.factory = factory\n\n  // import the factory functions like createAdd as an array instead of object,\n  // else they will get a different naming (`createAdd` instead of `add`).\n  math.import(Object.values(deepFlatten(factories)))\n\n  math.ArgumentsError = ArgumentsError\n  math.DimensionError = DimensionError\n  math.IndexError = IndexError\n\n  return math\n}\n","import Emitter from 'tiny-emitter'\n\n/**\n * Extend given object with emitter functions `on`, `off`, `once`, `emit`\n * @param {Object} obj\n * @return {Object} obj\n */\nexport function mixin (obj) {\n  // create event emitter\n  const emitter = new Emitter()\n\n  // bind methods to obj (we don't want to expose the emitter.e Array...)\n  obj.on = emitter.on.bind(emitter)\n  obj.off = emitter.off.bind(emitter)\n  obj.once = emitter.once.bind(emitter)\n  obj.emit = emitter.emit.bind(emitter)\n\n  return obj\n}\n","import { isBigNumber, isComplex, isFraction, isMatrix, isObject, isUnit } from '../../utils/is.js'\nimport { isFactory, stripOptionalNotation } from '../../utils/factory.js'\nimport { hasOwnProperty, lazy } from '../../utils/object.js'\nimport { ArgumentsError } from '../../error/ArgumentsError.js'\n\nexport function importFactory (typed, load, math, importedFactories) {\n  /**\n   * Import functions from an object or a module.\n   *\n   * This function is only available on a mathjs instance created using `create`.\n   *\n   * Syntax:\n   *\n   *    math.import(functions)\n   *    math.import(functions, options)\n   *\n   * Where:\n   *\n   * - `functions: Object`\n   *   An object with functions or factories to be imported.\n   * - `options: Object` An object with import options. Available options:\n   *   - `override: boolean`\n   *     If true, existing functions will be overwritten. False by default.\n   *   - `silent: boolean`\n   *     If true, the function will not throw errors on duplicates or invalid\n   *     types. False by default.\n   *   - `wrap: boolean`\n   *     If true, the functions will be wrapped in a wrapper function\n   *     which converts data types like Matrix to primitive data types like Array.\n   *     The wrapper is needed when extending math.js with libraries which do not\n   *     support these data type. False by default.\n   *\n   * Examples:\n   *\n   *    import { create, all } from 'mathjs'\n   *    import * as numbers from 'numbers'\n   *\n   *    // create a mathjs instance\n   *    const math = create(all)\n   *\n   *    // define new functions and variables\n   *    math.import({\n   *      myvalue: 42,\n   *      hello: function (name) {\n   *        return 'hello, ' + name + '!'\n   *      }\n   *    })\n   *\n   *    // use the imported function and variable\n   *    math.myvalue * 2               // 84\n   *    math.hello('user')             // 'hello, user!'\n   *\n   *    // import the npm module 'numbers'\n   *    // (must be installed first with `npm install numbers`)\n   *    math.import(numbers, {wrap: true})\n   *\n   *    math.fibonacci(7) // returns 13\n   *\n   * @param {Object | Array} functions  Object with functions to be imported.\n   * @param {Object} [options]          Import options.\n   */\n  function mathImport (functions, options) {\n    const num = arguments.length\n    if (num !== 1 && num !== 2) {\n      throw new ArgumentsError('import', num, 1, 2)\n    }\n\n    if (!options) {\n      options = {}\n    }\n\n    function flattenImports (flatValues, value, name) {\n      if (Array.isArray(value)) {\n        value.forEach(item => flattenImports(flatValues, item))\n      } else if (isObject(value) || isModule(value)) {\n        for (const name in value) {\n          if (hasOwnProperty(value, name)) {\n            flattenImports(flatValues, value[name], name)\n          }\n        }\n      } else if (isFactory(value) || name !== undefined) {\n        const flatName = isFactory(value)\n          ? isTransformFunctionFactory(value)\n            ? (value.fn + '.transform') // TODO: this is ugly\n            : value.fn\n          : name\n\n        // we allow importing the same function twice if it points to the same implementation\n        if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {\n          throw new Error('Cannot import \"' + flatName + '\" twice')\n        }\n\n        flatValues[flatName] = value\n      } else {\n        if (!options.silent) {\n          throw new TypeError('Factory, Object, or Array expected')\n        }\n      }\n    }\n\n    const flatValues = {}\n    flattenImports(flatValues, functions)\n\n    for (const name in flatValues) {\n      if (hasOwnProperty(flatValues, name)) {\n        // console.log('import', name)\n        const value = flatValues[name]\n\n        if (isFactory(value)) {\n          // we ignore name here and enforce the name of the factory\n          // maybe at some point we do want to allow overriding it\n          // in that case we can implement an option overrideFactoryNames: true\n          _importFactory(value, options)\n        } else if (isSupportedType(value)) {\n          _import(name, value, options)\n        } else {\n          if (!options.silent) {\n            throw new TypeError('Factory, Object, or Array expected')\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Add a property to the math namespace\n   * @param {string} name\n   * @param {*} value\n   * @param {Object} options  See import for a description of the options\n   * @private\n   */\n  function _import (name, value, options) {\n    // TODO: refactor this function, it's to complicated and contains duplicate code\n    if (options.wrap && typeof value === 'function') {\n      // create a wrapper around the function\n      value = _wrap(value)\n    }\n\n    // turn a plain function with a typed-function signature into a typed-function\n    if (hasTypedFunctionSignature(value)) {\n      value = typed(name, {\n        [value.signature]: value\n      })\n    }\n\n    if (typed.isTypedFunction(math[name]) && typed.isTypedFunction(value)) {\n      if (options.override) {\n        // give the typed function the right name\n        value = typed(name, value.signatures)\n      } else {\n        // merge the existing and typed function\n        value = typed(math[name], value)\n      }\n\n      math[name] = value\n      delete importedFactories[name]\n\n      _importTransform(name, value)\n      math.emit('import', name, function resolver () {\n        return value\n      })\n      return\n    }\n\n    const isDefined = math[name] !== undefined\n    const isValuelessUnit = math.Unit?.isValuelessUnit(name)\n    if ((!isDefined && !isValuelessUnit) || options.override) {\n      math[name] = value\n      delete importedFactories[name]\n\n      _importTransform(name, value)\n      math.emit('import', name, function resolver () {\n        return value\n      })\n      return\n    }\n\n    if (!options.silent) {\n      throw new Error('Cannot import \"' + name + '\": already exists')\n    }\n  }\n\n  function _importTransform (name, value) {\n    if (value && typeof value.transform === 'function') {\n      math.expression.transform[name] = value.transform\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value.transform\n      }\n    } else {\n      // remove existing transform\n      delete math.expression.transform[name]\n      if (allowedInExpressions(name)) {\n        math.expression.mathWithTransform[name] = value\n      }\n    }\n  }\n\n  function _deleteTransform (name) {\n    delete math.expression.transform[name]\n    if (allowedInExpressions(name)) {\n      math.expression.mathWithTransform[name] = math[name]\n    } else {\n      delete math.expression.mathWithTransform[name]\n    }\n  }\n\n  /**\n   * Create a wrapper a round an function which converts the arguments\n   * to their primitive values (like convert a Matrix to Array)\n   * @param {Function} fn\n   * @return {Function} Returns the wrapped function\n   * @private\n   */\n  function _wrap (fn) {\n    const wrapper = function wrapper () {\n      const args = []\n      for (let i = 0, len = arguments.length; i < len; i++) {\n        const arg = arguments[i]\n        args[i] = arg && arg.valueOf()\n      }\n      return fn.apply(math, args)\n    }\n\n    if (fn.transform) {\n      wrapper.transform = fn.transform\n    }\n\n    return wrapper\n  }\n\n  /**\n   * Import an instance of a factory into math.js\n   * @param {function(scope: object)} factory\n   * @param {Object} options  See import for a description of the options\n   * @param {string} [name=factory.name] Optional custom name\n   * @private\n   */\n  function _importFactory (factory, options, name = factory.fn) {\n    if (name.includes('.')) {\n      throw new Error('Factory name should not contain a nested path. ' +\n        'Name: ' + JSON.stringify(name))\n    }\n\n    const namespace = isTransformFunctionFactory(factory)\n      ? math.expression.transform\n      : math\n\n    const existingTransform = name in math.expression.transform\n    const existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined\n\n    const resolver = function () {\n      // collect all dependencies, handle finding both functions and classes and other special cases\n      const dependencies = {}\n      factory.dependencies\n        .map(stripOptionalNotation)\n        .forEach(dependency => {\n          if (dependency.includes('.')) {\n            throw new Error('Factory dependency should not contain a nested path. ' +\n              'Name: ' + JSON.stringify(dependency))\n          }\n\n          if (dependency === 'math') {\n            dependencies.math = math\n          } else if (dependency === 'mathWithTransform') {\n            dependencies.mathWithTransform = math.expression.mathWithTransform\n          } else if (dependency === 'classes') { // special case for json reviver\n            dependencies.classes = math\n          } else {\n            dependencies[dependency] = math[dependency]\n          }\n        })\n\n      const instance = /* #__PURE__ */ factory(dependencies)\n\n      if (instance && typeof instance.transform === 'function') {\n        throw new Error('Transforms cannot be attached to factory functions. ' +\n            'Please create a separate function for it with export const path = \"expression.transform\"')\n      }\n\n      if (existing === undefined || options.override) {\n        return instance\n      }\n\n      if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {\n        // merge the existing and new typed function\n        return typed(existing, instance)\n      }\n\n      if (options.silent) {\n        // keep existing, ignore imported function\n        return existing\n      } else {\n        throw new Error('Cannot import \"' + name + '\": already exists')\n      }\n    }\n\n    const former = factory.meta?.formerly ?? ''\n    const needsTransform = isTransformFunctionFactory(factory) ||\n      factoryAllowedInExpressions(factory)\n    const withTransform = math.expression.mathWithTransform\n\n    // TODO: add unit test with non-lazy factory\n    if (!factory.meta || factory.meta.lazy !== false) {\n      lazy(namespace, name, resolver)\n      if (former) lazy(namespace, former, resolver)\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name)\n        if (former) _deleteTransform(former)\n      } else {\n        if (needsTransform) {\n          lazy(withTransform, name, () => namespace[name])\n          if (former) lazy(withTransform, former, () => namespace[name])\n        }\n      }\n    } else {\n      namespace[name] = resolver()\n      if (former) namespace[former] = namespace[name]\n\n      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)\n      if (existing && existingTransform) {\n        _deleteTransform(name)\n        if (former) _deleteTransform(former)\n      } else {\n        if (needsTransform) {\n          lazy(withTransform, name, () => namespace[name])\n          if (former) lazy(withTransform, former, () => namespace[name])\n        }\n      }\n    }\n\n    // TODO: improve factories, store a list with imports instead which can be re-played\n    importedFactories[name] = factory\n\n    math.emit('import', name, resolver)\n  }\n\n  /**\n   * Check whether given object is a type which can be imported\n   * @param {Function | number | string | boolean | null | Unit | Complex} object\n   * @return {boolean}\n   * @private\n   */\n  function isSupportedType (object) {\n    return typeof object === 'function' ||\n        typeof object === 'number' ||\n        typeof object === 'string' ||\n        typeof object === 'boolean' ||\n        object === null ||\n        isUnit(object) ||\n        isComplex(object) ||\n        isBigNumber(object) ||\n        isFraction(object) ||\n        isMatrix(object) ||\n        Array.isArray(object)\n  }\n\n  function isModule (object) {\n    return typeof object === 'object' && object[Symbol.toStringTag] === 'Module'\n  }\n\n  function hasTypedFunctionSignature (fn) {\n    return typeof fn === 'function' && typeof fn.signature === 'string'\n  }\n\n  function allowedInExpressions (name) {\n    return !hasOwnProperty(unsafe, name)\n  }\n\n  function factoryAllowedInExpressions (factory) {\n    return !factory.fn.includes('.') && // FIXME: make checking on path redundant, check on meta data instead\n      !hasOwnProperty(unsafe, factory.fn) &&\n      (!factory.meta || !factory.meta.isClass)\n  }\n\n  function isTransformFunctionFactory (factory) {\n    return (factory !== undefined &&\n      factory.meta !== undefined &&\n      factory.meta.isTransformFunction === true) || false\n  }\n\n  // namespaces and functions not available in the parser for safety reasons\n  const unsafe = {\n    expression: true,\n    type: true,\n    docs: true,\n    error: true,\n    json: true,\n    chain: true // chain method not supported. Note that there is a unit chain too.\n  }\n\n  return mathImport\n}\n"],"names":["root","factory","exports","module","define","amd","this","global","XorGen","seed","me","strseed","next","t","x","y","z","w","v","d","k","length","charCodeAt","copy","f","impl","opts","xg","state","prng","double","result","int32","quick","xorwow","X","i","j","push","init","slice","Date","xorshift7","_extends","Object","assign","target","arguments","source","key","prototype","hasOwnProperty","call","defaultEscapes","$","_","formatEscapes","defaultEscapeMapFn","str","_ref","undefined","_ref$preserveFormatti","preserveFormatting","_ref$escapeMapFn","escapeMapFn","runningStr","String","escapes","escapeKeys","keys","_loop","specialCharFound","forEach","index","Alea","n","mash","data","h","s0","c","s1","s2","alea","xor128","ok","notOk","undef","NOT_TYPED_FUNCTION","create","isPlainObject","constructor","_types","name","test","Array","isArray","RegExp","anyType","isAny","typeMap","typeList","nConversions","typed","createCount","findType","typeName","type","get","message","toLowerCase","otherName","TypeError","addTypes","types","beforeSpec","beforeIndex","newTypes","has","set","conversionsTo","affectedTypes","concat","clear","Map","findTypeNames","value","matches","filter","isTypedFunction","entity","findSignature","fn","signature","options","exact","params","parseSignature","join","canonicalSignature","stringifyParams","signatures","match","_typedFunctionData","signatureMap","nParams","remainingSignatures","candidate","want","filteredSignatures","possibility","have","getParamAtIndex","restParam","hasAny","haveTypes","paramTypeSet","some","wtype","separator","map","p","parseParam","param","indexOf","typeDefs","split","s","trim","paramName","typeIndex","conversion","conversionIndex","hasConversion","expandParam","matchingConversions","typeNames","sort","t1","t2","knownTypes","Set","newMatch","from","add","availableConversions","newName","convertibleTypes","typeSet","rawSignature","rawParams","parsedParam","SyntaxError","hasRestParam","last","compileTest","test0","test1","tests","compileTests","initial","varIndex","lastTest","testRestParam","args","getTypeSetAtIndex","isExactType","mergeExpectedParams","paramSet","createError","err","expected","_name","matchingSignatures","nextMatchingDefs","actualTypes","category","actual","lengths","Infinity","Math","min","apply","maxLength","max","expectedLength","argTypes","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","typeDiff","convDiff","compareSignatures","signature1","signature2","pars1","pars2","last1","last2","hasRest1","hasRest2","par","any1","conv1","any2","conv2","lengthCriterion","comparisons","tc","thisComparison","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","fnPreprocess","offset","conversion0","conversion1","conversions","convert","arg","splitParams","_splitParams","paramsSoFar","resultingParams","exactTypes","arr","callback","nextParam","conflicting","params1","params2","ii","typeSet1","typeSet2","overlap","len1","len2","restParam1","restParam2","collectResolutions","references","functionList","resolvedReferences","reference","resolution","resolveReferences","self","resolvedFunctions","isReferToSelf","referToSelf","isReferTo","makeReferTo","referTo","clearResolutions","isResolved","fill","leftUnresolved","nothingResolved","createTypedFunction","rawSignaturesMap","warnAgainstDeprecatedThis","signaturesMap","deprecatedThisRegex","toString","validateDeprecatedThis","parsedParams","originalFunctions","preliminarySignatures","pp","functionIndex","conversionParams","sp","spName","every","theTypedFn","internalSignatureMap","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","implementation","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","fns","generic","onMismatch","arg0","arg1","defineProperty","_onMismatch","start","end","objectOrFn","checkName","nameSoFar","Error","getObjectName","obj","mergeSignatures","dest","sourceFunction","destFunction","saveTyped","_validateConversion","to","maybeName","named","allSignatures","item","thisName","theseSignatures","argument","throwMismatchError","clearConversions","_findType","find","addType","beforeObjectTest","before","addConversion","override","existing","other","removeConversion","addConversions","existingConversion","findInArray","splice","resolve","tf","argList","sigs","xor4096","tychei","sr","E","on","ctx","e","once","listener","off","emit","evtArr","len","evts","liveEvents","TinyEmitter","b","a","floor","pool","math","nodecrypto","width","startdenom","pow","significance","overflow","mask","seedrandom","shortseed","mixkey","flatten","entropy","tostring","out","randomBytes","Uint8Array","crypto","msCrypto","getRandomValues","browser","navigator","plugins","screen","autoseed","arc4","ARC4","g","S","pass","is_math_call","keylen","count","r","depth","prop","typ","smear","stringseed","fromCharCode","random","ex","limit","naturalSort","oFxNcL","oFyNcL","re","sre","dre","hre","ore","insensitive","replace","xN","yN","xD","parseInt","parse","yD","cLoc","numS","parseFloat","isNaN","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","id","loaded","__webpack_modules__","amdD","amdO","definition","o","enumerable","Symbol","toStringTag","nmd","paths","children","getSafeProperty","object","isSafeProperty","isSafeMethod","setSafeProperty","safeNativeProperties","Function","method","getPrototypeOf","safeNativeMethods","valueOf","toLocaleString","ObjectWrappingMap","wrappedObject","iterator","entries","values","mapIterator","delete","size","PartitionedMap","bKeys","it","done","createEmptyMap","createMap","mapOrObject","isMap","isObject","isNumber","isBigNumber","isDecimal","isBigInt","isComplex","isFraction","isUnit","isString","isMatrix","isCollection","isDenseMatrix","isSparseMatrix","isRange","isIndex","isBoolean","isResultSet","isHelp","isFunction","isDate","isRegExp","isPartitionedMap","isObjectWrappingMap","isNull","isUndefined","isAccessorNode","isNode","isArrayNode","isAssignmentNode","isBlockNode","isConditionalNode","isConstantNode","rule2Node","node","isOperatorNode","includes","op","isFunctionAssignmentNode","isFunctionNode","isIndexNode","isObjectNode","isParenthesisNode","isRangeNode","isRelationalNode","isSymbolNode","isChain","typeOf","clone","mapObject","extend","deepExtend","deepStrictEqual","deepFlatten","nestedObject","flattenedObject","_deepFlatten","lazy","valueResolver","_value","_uninitialized","configurable","property","dependencies","meta","assertAndCreate","scope","deps","properties","pickShallow","stripOptionalNotation","dependency","isOptionalDependency","missingDependencies","assertDependencies","isFactory","isInteger","isFinite","round","safeNumberType","numberStr","config","number","BigInt","_unused","numberFallback","sign","log2","log","LN2","log10","LN10","log1p","cbrt","negate","exp","expm1","formatNumberToBase","base","prefix","suffix","format","notation","precision","wordSize","normalizeFormatOptions","toFixed","toExponential","rounded","roundDigits","splitNumber","exponent","coefficients","newExp","missingZeros","abs","expDiff","decimalIdx","decimals","decimalVal","toEngineering","lowerExp","_toNumberOrDefault","upperExp","zeros","dot","toPrecision","digits","toNumber","_toNumberOrThrow","splitValue","first","shift","unshift","pop","nearlyEqual","relTol","absTol","acosh","sqrt","asinh","atanh","cosh","sinh","tanh","onError","defaultValue","_createTyped","typedFunction","createTyped","BigNumber","Complex","DenseMatrix","Fraction","throwNoBignumber","throwNoComplex","Number","MAX_SAFE_INTEGER","throwNoFraction","array","throwNoMatrix","matrix","usualError","sig","createResultSet","ResultSet","toJSON","mathjs","fromJSON","json","isClass","inexact","quadrant","EXP_LIMIT","MAX_DIGITS","NUMERALS","PI","DEFAULTS","rounding","modulo","toExpNeg","toExpPos","minE","maxE","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","tag","mathfloor","mathpow","isBinary","isHex","isOctal","BASE","LN10_PRECISION","PI_PRECISION","P","digitsToString","ws","indexOfLastWord","getZeroString","checkInt32","checkRoundingDigits","rm","repeating","di","rd","ceil","convertBase","baseIn","baseOut","arrL","strL","charAt","reverse","absoluteValue","finalise","clampedTo","clamp","Ctor","NaN","gt","cmp","comparedTo","xdL","ydL","xd","yd","xs","ys","cosine","cos","pr","sd","isZero","tinyPow","taylorSeries","times","cos2x","minus","plus","toLessThanHalfPi","neg","cubeRoot","m","rep","t3","t3plusx","divide","eq","decimalPlaces","dp","dividedBy","div","dividedToIntegerBy","divToInt","equals","greaterThan","greaterThanOrEqualTo","gte","hyperbolicCosine","one","cosh2_x","d8","hyperbolicSine","sinh2_x","d5","d16","d20","hyperbolicTangent","inverseCosine","acos","isNeg","getPi","atan","inverseHyperbolicCosine","lte","ln","inverseHyperbolicSine","inverseHyperbolicTangent","wpr","xsd","inverseSine","asin","halfPi","inverseTangent","px","x2","isInt","isNegative","isPositive","isPos","lessThan","lt","lessThanOrEqualTo","logarithm","isBase10","denominator","inf","num","naturalLogarithm","getLn10","sub","xe","xLTy","getBase10Exponent","mod","q","naturalExponential","negated","carry","getPrecision","sine","sin","sin2_x","squareRoot","tangent","tan","mul","rL","toBinary","toStringBinary","toDecimalPlaces","toDP","finiteToString","toFraction","maxD","d0","d1","d2","n0","n1","toHexadecimal","toHex","toNearest","toOctal","toPower","yn","intPow","toSignificantDigits","toSD","truncated","trunc","multiplyInteger","temp","compare","aL","bL","subtract","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","isTruncated","roundUp","xdi","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","guard","sum","c0","numerator","x1","parseDecimal","search","substring","parseOther","divisor","isFloat","Decimal","isHyperbolic","u","pi","atan2","useDefaults","defaults","ps","hypot","isDecimalInstance","Uint32Array","for","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","createBigNumberClass","curr","prev","parser_exit","logHypot","_a","_b","tokens","tInfin","zInfin","tIsZero","zIsZero","loh","im","er","xx","cosm1","tmp","res","noIM","oneMinus","onePlus","places","ret","createComplexClass","toPolar","phi","strRe","strIm","epsilon","fromPolar","hasBase","C_ZERO","C_ONE","C_TWO","C_FIVE","C_TEN","InvalidParameter","newFraction","DivisionByZero","gcd","factorize","factors","p1","p2","NonIntegerParameter","A","B","C","D","N","M","ndx","allPrimes","baseFactors","T1","numberFactors","T2","prime","retN","retD","baseExponent","numberExponent","curN","curD","gcdValue","dec","cycLen","cycleLen","cycOff","rem1","rem2","modpow","cycleStart","showMixed","whole","eps","ieps","thisABS","cont","createFractionClass","createRangeClass","Range","step","hasStart","hasEnd","hasStep","nums","diff","toArray","createMatrixClass","Matrix","storage","datatype","subset","replacement","resize","reshape","skipZeros","bind","formatBigNumberToBase","big2","BigNumberCtor","endsWith","text","formatNumber","valueStr","formatBigNumber","looksLikeFraction","fraction","formatArray","stringify","syntax","_format","escaped","controlCharacters","escape","compareText","DimensionError","relation","stack","IndexError","arraySize","_validate","dim","dimNext","child","validate","validateIndexSourceSize","valueSize","_size","_sourceSize","sourceDim","validateIndex","isEmptyIndex","_dimensions","dimension","_data","_resize","elem","oldLen","newLen","minLen","sizes","flatArray","currentLength","newLength","product","processSizesWildcard","tmpArray2","tmpArray","sizeIndex","_reshape","processedSizes","wildCardIndex","reduce","squeeze","dims","_squeeze","unsqueeze","outer","_unsqueeze","isRectangular","flat","_flattenRectangular","_flatten","filterRegExp","regexp","entry","identify","identifier","generalize","getArrayDataType","itemType","concatRecursive","concatDim","arrays","broadcastSizes","_len","_key","dimensions","sizeMax","checkBroadcastingRules","toSize","broadcastTo","Asize","broadcastedSize","paddedSize","arrayToStretch","sizeToStretch","dimToStretch","acc","deepMap","skipIndex","recursiveMap","recursiveMapWithIndex","deepForEach","recursiveForEach","recursiveForEachWithIndex","optimizeCallback","isUnary","numberOfArguments","fastCallback","firstIndex","firstValue","testArgs","_findNumberOfArgumentsTyped","dataType","singleSignature","arity","matchingFunctions","func","_findSingleSignatureWithArity","_tryFunctionWithArgs","_len2","_key2","_findIfCallbackIsUnary","callbackStr","paramsStr","mappingFnName","callbackName","_err$data","argsDesc","_typeOf","JSON","_createCallbackError","RangeError","isDimensionError","isIndexError","createDenseMatrixClass","_datatype","preprocess","_fit","newSize","changed","createDenseMatrix","getDataType","isScalar","returnMatrix","submatrix","maxDepth","getSubmatrixRecursive","ranges","rangeIndex","_getSubmatrix","_get","iSize","sSize","setSubmatrixRecursive","range","_setSubmatrix","_set","indexI","sizeArray","fastCallbackFn","iterateUnary","inputData","iterate","totalElements","current","rows","row","columns","col","diagonal","kSuper","kSub","ms","swapRows","_swapRows","vi","createClone","any","objectClone","_switch","mat","I","J","containsCollections","arrayDeepForEach","arrayDeepMap","skipZerosCallback","_reduce","val","tran","scatter","mark","cindex","inverse","update","avalues","_values","aindex","_index","aptr","_ptr","k0","k1","createIsInteger","isIntegerNumber","bigint","isNegativeNumber","isPositiveNumber","isNaNNumber","createIsNegative","bigNearlyEqual","Unit","valueType","createIsNumeric","number | BigNumber | bigint | Fraction | boolean","Complex | Unit | string | null | undefined | Node","createHasNumericValue","isNumeric","boolean","string","createIsPositive","createIsZero","equalScalar","createIsNaN","createTypeOf","createCompareUnits","equalBase","createEqualScalar","compareUnits","complexEquals","createSparseMatrixClass","_ref2","SparseMatrix","_createFromArray","_createFromMatrix","ptr","zero","_getValueIndex","top","bottom","_insert","ins","_toArray","createSparseMatrix","density","idx","kk","mvalues","mindex","mptr","pv","_getsubset","dataIndex","subIndex","firstDimensionRange","secondDimensionRange","firstDataIndex","firstSubIndex","secondDataIndex","secondSubIndex","_setsubset","_remove","colIndex","rowIndex","r1","c1","minRow","maxRow","minColumn","maxColumn","invoke","_map","_forEachRow","kx","ky","vx","vy","createNumber","nonDecimalNumberParts","input","nonDecimalWithRadixMatch","radix","integerPart","fractionalPart","getNonDecimalNumberParts","parts","makeNumberFromNonDecimalParts","wordSizeSuffixMatch","null","unit","valuelessUnit","createBigint","createString","createBoolean","lcase","createBignumber","twoPowSize","twoPowSizeSubOne","_x","createComplex","ZERO","createFraction","createMatrix","_create","createMatrixFromFunction","createMatrixFromRows","_createArray","checkVectorTypeAndReturnLength","rowLength","vec","createMatrixFromColumns","colLength","createSplitUnit","splitUnit","n2","absNumber","addNumber","subtractNumber","multiplyNumber","unaryMinusNumber","unaryPlusNumber","cbrtNumber","cubeNumber","expNumber","expm1Number","lcmNumber","logNumber","log10Number","log2Number","nthRootNumber","inv","signNumber","squareNumber","xgcdNumber","lastx","lasty","powNumber","roundNumber","createUnaryMinus","createUnaryPlus","numeric","createAbs","createMapSlices","_mapSlices","formerly","createAddScalar","fixPrefix","createSubtractScalar","createCbrt","unaryMinus","_cbrtComplex","third","allRoots","arg3","principal","all","createMatAlgo11xS0s","asize","adt","dt","cf","cvalues","cptr","createMatAlgo12xSfs","cdata","createMatAlgo14xDs","adata","_iterate","level","av","bv","cv","bigTen","createCeilNumber","_ceilNumber","createCeil","matAlgo11xS0s","matAlgo12xSfs","matAlgo14xDs","ceilNumber","_bigCeil","bne","bigint, number","_dummy","bigint, BigNumber","valueless","toNumeric","multiply","createCube","createExp","createExpm1","createFixNumber","createFix","fixNumber","bn","createFloorNumber","_floorNumber","createFloor","floorNumber","_bigFloor","createMatAlgo02xDS0","denseMatrix","sparseMatrix","bvalues","bindex","bptr","bsize","bdt","cij","createMatAlgo03xDSf","createMatAlgo05xSfSf","xa","xb","wa","wb","wai","wbi","vc","createMatAlgo13xDD","bdata","csize","broadcast","_broadcastTo","createMatrixAlgorithmSuite","matAlgo13xDD","elop","SD","DS","matrixSignatures","DenseMatrix, DenseMatrix","Array, Array","Array, DenseMatrix","DenseMatrix, Array","SS","scalar","Ds","Ss","sS","createMod","matAlgo02xDS0","matAlgo03xDSf","matAlgo05xSfSf","matrixAlgorithmSuite","createMatAlgo01xDSid","createMatAlgo04xSidSid","createMatAlgo10xSids","ArgumentsError","isArgumentsError","gcdTypes","gcdManyTypesSignature","is1d","element","createGcd","matAlgo01xDSid","matAlgo04xSidSid","matAlgo10xSids","Fraction, Fraction","createMatAlgo06xS0S0","createLcm","matAlgo06xS0S0","lcmTypes","lcmManySignature","lcm","promoteLogarithm","log16","numberLog","cplx","predictable","s15","createLog10","complexLog","complexLogNumber","createLog2","complexLog2Number","_log2Complex","newX","createMultiplyScalar","number | Fraction | BigNumber | Complex, Unit","Unit, number | Fraction | BigNumber | Complex | Unit","createMultiply","addScalar","multiplyScalar","_validateMatrixDimensions","size1","size2","_multiplyMatrixVector","arows","acolumns","af","mf","brows","ib","vbi","ka0","ka1","ka","ia","ic","_multiplyMatrixMatrix","bcolumns","jb","kb0","kb1","kb","vbij","p0","selfMM","xsize","ysize","_multiplyVectorVector","alength","_multiplyVectorDenseMatrix","_multiplyVectorMatrix","rest","createNthRoot","complexErr","_bigNthRoot","selfDn","selfSn","selfDS","Big","createSign","complex","_isDerived","units","createSqrt","_sqrtNumber","createSquare","createSubtract","subtractScalar","createXgcd","createInvmod","xgcd","equal","smaller","invmod","createMatAlgo09xS0Sf","vb","createDotMultiply","matAlgo09xS0Sf","bitAndBigNumber","bitwise","bitNotBigNumber","prevPrec","bitOrBigNumber","negOne","xBits","yBits","xSign","ySign","decCoefficientToBinaryString","minBits","maxBits","minSign","shortLen","longLen","expFuncVal","outVal","twoPower","two","bitXor","leftShiftBigNumber","rightArithShiftBigNumber","bitAndNumber","bitNotNumber","bitOrNumber","bitXorNumber","leftShiftNumber","rightArithShiftNumber","rightLogShiftNumber","createBitAnd","bigint, bigint","createBitNot","createBitOr","createMatAlgo07xSSf","nonZeroCount","_scatter","createBitXor","matAlgo07xSSf","bigBitXor","createArg","createConj","conjugate","formatUnits","createIm","createRe","notNumber","orNumber","xorNumber","andNumber","createNot","null | undefined","createNullish","deepEqual","number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any","_y","null, any","undefined, any","SparseMatrix, Array | Matrix","sx","sy","createOr","createXor","createConcat","prevDim","asMatrix","matrices","_concat","createColumn","Index","_column","column","rowRange","createCross","_cross","highestDimension","xSize","ySize","createDiag","_diag","l","_createDiagonalMatrix","dm","vector","_getDiagonal","createFilter","_filterCallback","createFlatten","flattenArray","createForEach","_forEach","createGetMatrixDataType","createIdentity","_identity","cols","_identityVector","minimum","createKron","_kron","_mapArray","Array|Matrix, Array|Matrix, ...Array|Matrix|function","Arrays","multiCallback","firstArrayIsMatrix","numberOfArrays","firstValues","collection","callbackArgCount","_getTypedCallbackArgCount","_getCallbackArgCount","_getLimitedCallback","collections","firstCollection","finalSize","offsets","resultsArray","currentDimensionSize","arrayIndex","resultsMatrix","mapMultiple","broadcastedArrays","broadcastedArraysCallback","_mapMultiple","createDiff","_diff","_recursive","selfAn","selfMn","_ElementDiff","obj1","obj2","obj1IsArray","obj2IsArray","arr1","arr2","_ArrayDiff","createOnes","_ones","hasBigNumbers","_normalize","noBignumber","noFraction","noMatrix","createRange","bignumber","smallerEq","larger","largerEq","_strRange","oops","_out","_range","includeEnd","_parse","ongoing","createReshape","arrayReshape","createResize","defaultChar","_resizeString","arrayResize","createRotate","rotationMatrix","theta","_validateSize","expectedSize","actualSize","createRotationMatrix","norm","_rotationMatrix2x2","matrixV","_validateVector","_rotationMatrix3x3","storageType","minusOne","cosTheta","sinTheta","_convertToFormat","_mul","normV","vz","oneMinusC","createRow","_row","columnRange","createSize","createSqueeze","arraySqueeze","createSubset","subsetRef","subsetResult","_getObjectProperty","_getSubstring","_isScalar","indexSize","error","_broadcastReplacement","_setSubstring","_setObjectProperty","strLen","substr","chars","updated","createTranspose","transposeMatrix","transposed","transposedRow","_denseTranspose","_sparseTranspose","createCtranspose","transpose","conj","createZeros","_zeros","createFft","divideScalar","tau","dotDivide","_ndFft","_fft","_1dFft","_transpose","chirp","N2","xp","ichirp","fftXp","fftIchirp","fftProduct","ifftProduct","_czt","createIfft","fft","createSolveODE","_rk","butcherTableau","tspan","y0","isNumOrBig","t0","isForwards","firstStep","maxStep","minStep","timeVars","tol","minDelta","maxDelta","maxIter","bp","deltaB","iter","_createOngoing","trimStep","outOfBounds","_createTrimStep","TE","delta","_rk23","_rk45","_solveODE","opt","methods","RK23","RK45","toUpperCase","methodOptions","methodsWithQuotes","availableMethodsString","_matrixSolveODE","T","sol","function, Array, Array","function, Matrix, Matrix","function, Array, number | BigNumber | Unit","Y","function, Matrix, number | BigNumber | Unit","function, Array, number | BigNumber | Unit, Object","function, Matrix, number | BigNumber | Unit, Object","createErf","MAX_NUM","THRESH","ysq","xnum","xden","Q","erf1","del","erfc2","SQRPI","erfc3","createZeta","factorial","gamma","zetaNumeric","zeta","createValue","determineDigits","getRe","factor","createMode","mathIsNaN","_mode","mode","improveErrorMessage","fnName","details","createProd","_prod","createFormat","formatString","createBin","createOct","createHex","printTemplate","createPrint","_print","template","original","createTo","Unit, Unit | string","createToBest","toBest","Unit, string","unitList","Unit, string, Object","Unit, Array","Unit, Array, Object","createIsPrime","modPow","modulus","accumulator","bases","adn","createNumeric","validInputTypes","validOutputTypes","outputType","inputType","createDivideScalar","Unit, number | Complex | Fraction | BigNumber | Unit","number | Fraction | Complex | BigNumber, Unit","divideInto","createPow","identity","_pow","_powArray","_powMatrix","yFrac","yNum","NO_INT","createRound","toExponent","xEpsilon","epsilonExponent","_n","nlg16","createLog","createLog1p","_log1p","_log1pComplex","xRe1p","createNthRoots","_calculateExactResult","_nthComplexRoots","aIsNumeric","roots","halfPiFactor","createDotPow","powScalarSignatures","powScalar","createDotDivide","createSolveValidation","mSize","bSize","createLsolve","solveValidation","bj","vjj","jValues","jIndices","lastIndex","xj","_sparseForwardSubstitution","_denseForwardSubstitution","mdata","createUsolve","_sparseBackwardSubstitution","_denseBackwardSubstitution","createLsolveAll","b_","L","iValues","iIndices","Mii","bNew","createUsolveAll","createMatAlgo08xS0Sid","createUseMatrixForArrayScalar","selfDB","selfnD","selfBD","createLeftShift","matAlgo08xS0Sid","useMatrixForArrayScalar","createRightArithShift","createRightLogShift","createAnd","not","createCompare","createCompareNumber","createCompareNatural","compareBooleans","_compareNatural","typeX","typeY","matTypes","compareMatricesAndArrays","compareComplexNumbers","compareArrays","compareNatural","keysX","keysY","compareObjects","_compareText","createCompareText","createEqual","createEqualNumber","createEqualText","createSmaller","bignumSmaller","createSmallerNumber","boolean, boolean","createSmallerEq","createSmallerEqNumber","createLarger","bignumLarger","createLargerNumber","createLargerEq","createLargerEqNumber","createDeepEqual","_deepEqual","createUnequal","createUnequalNumber","createPartitionSelect","asc","desc","_partitionSelect","quickSelect","pivot","createSort","compareAsc","compareDesc","_arrayIsVector","_matrixIsVector","_comparator","order","createMax","_max","_largest","createMin","_min","_smallest","createImmutableDenseMatrixClass","ImmutableDenseMatrix","isImmutableDenseMatrix","createIndexClass","getMatrixDataType","argIsArray","argIsMatrix","argType","sourceSize","_createImmutableMatrix","_booleansArrayToNumbersForIndex","isObjectProperty","getObjectProperty","strings","booleanArrayIndex","indexOfNumbers","bool","createFibonacciHeapClass","oneOverLogPhi","FibonacciHeap","_minimum","_cut","parent","left","right","degree","_cascadingCut","isFibonacciHeap","insert","isEmpty","extractMinimum","numberOfChildren","tempRight","numRoots","_linkNodes","_findMinimumNode","remove","_decreaseKey","createSpaClass","Spa","_heap","isSpa","accumulate","heap","nodes","swap","nodei","nodej","lruQueue","queue","oldIndex","hit","nuIndex","memoize","hasher","POSITIVE_INFINITY","cache","lru","hash","newVal","createBigNumberE","createBigNumberPhi","createBigNumberPi","createBigNumberTau","createUnitClass","fix","skipAutomaticSimplification","BASE_DIMENSIONS","skipWhitespace","isDigit","revert","parseNumber","isDigitDot","tentativeNumber","tentativeIndex","parseUnit","unitName","isValidAlpha","firstC","parseCharacter","toFind","powerMultiplierCurrent","expectingUnit","powerMultiplierStack","powerMultiplierStackProduct","uStr","oldC","_findUnit","power","baseDim","UNIT_SYSTEMS","auto","allowNoUnits","_getNumberConverter","unitValue","unitPrefixValue","unitPower","_denormalize","prefixValue","UNITS","prefixes","prefixLen","prefixName","getNumericIfUnitless","BASE_UNITS","NONE","typeOfValue","formatBest","simp","simplify","isImaginary","VAR","VA","handleVAandVARUnits","_bestPrefix","applyBestPrefixIfNeeded","unitStr","isValuelessUnit","_other","inverted","valThis","valOther","_numberConverter","nominalOffset","unitOffset","W","thisUnitValue","thisNominalOffset","thisUnitOffset","otherUnitValue","otherNominalOffset","otherUnitOffset","_json$unit","proposedUnitList","matchingBase","currentUnitSystem","matchingUnit","missingBaseDim","toSI","si","strNum","strDen","nNum","nDen","startPrefixes","el","absValue","absUnitValue","bestPrefix","bestDiff","scientific","xNumeric","xRounded","xFixed","testSum","PREFIXES","SHORT","da","G","Z","R","LONG","deca","hecto","kilo","mega","giga","tera","peta","exa","zetta","yotta","ronna","quetta","deci","centi","milli","micro","nano","pico","femto","atto","zepto","yocto","ronto","quecto","SQUARED","CUBIC","BINARY_SHORT_SI","BINARY_SHORT_IEC","Ki","Mi","Gi","Ti","Pi","Ei","Zi","Yi","BINARY_LONG_SI","BINARY_LONG_IEC","kibi","mebi","gibi","tebi","pebi","exi","zebi","yobi","BTU","MM","SHORTLONG","BINARY_SHORT","BINARY_LONG","MASS","LENGTH","TIME","CURRENT","TEMPERATURE","LUMINOUS_INTENSITY","AMOUNT_OF_SUBSTANCE","FORCE","SURFACE","VOLUME","ENERGY","POWER","PRESSURE","ELECTRIC_CHARGE","ELECTRIC_CAPACITANCE","ELECTRIC_POTENTIAL","ELECTRIC_RESISTANCE","ELECTRIC_INDUCTANCE","ELECTRIC_CONDUCTANCE","MAGNETIC_FLUX","MAGNETIC_FLUX_DENSITY","FREQUENCY","ANGLE","BIT","UNIT_NONE","meter","inch","foot","yard","mile","link","rod","chain","angstrom","in","ft","mi","li","ch","mil","m2","sqin","sqft","sqyd","sqmi","sqrd","sqch","sqmil","acre","hectare","m3","litre","cuin","cuft","cuyd","teaspoon","tablespoon","drop","gtt","minim","fluiddram","fluidounce","gill","cc","cup","pint","quart","gallon","beerbarrel","oilbarrel","hogshead","gram","ton","tonne","grain","dram","ounce","poundmass","hundredweight","stick","stone","gr","dr","oz","lbm","cwt","second","sec","minute","hour","day","week","month","year","decade","century","millennium","hertz","reciprocal","Hz","rad","radian","deg","grad","gradian","cycle","arcsec","arcmin","ampere","K","degC","degF","degR","kelvin","celsius","fahrenheit","rankine","mol","mole","cd","candela","newton","dyn","dyne","lbf","poundforce","kip","kilogramforce","joule","erg","Wh","eV","electronvolt","watt","hp","Pa","psi","atm","bar","torr","mmHg","mmH2O","cmH2O","coulomb","farad","F","volt","V","ohm","henry","H","siemens","weber","Wb","tesla","bits","bytes","ALIASES","meters","inches","feet","yards","miles","links","rods","chains","angstroms","litres","liter","liters","teaspoons","tablespoons","minims","fldr","fluiddrams","floz","fluidounces","gi","gills","cp","cups","pt","pints","qt","quarts","gal","gallons","bbl","beerbarrels","obl","oilbarrels","hogsheads","gtts","grams","tons","tonnes","grains","drams","ounces","poundmasses","hundredweights","sticks","lb","lbs","kips","kgf","acres","hectares","sqfeet","sqyard","sqmile","sqmiles","mmhg","mmh2o","cmh2o","seconds","secs","minutes","mins","hours","hr","hrs","days","weeks","months","years","decades","centuries","millennia","radians","degrees","gradians","cycles","arcsecond","arcseconds","arcminute","arcminutes","BTUs","watts","joules","amperes","amps","amp","coulombs","volts","ohms","farads","webers","teslas","electronvolts","moles","bit","byte","calculateAngleValues","createPi","cgs","us","setUnitSystem","getUnitSystem","typeConverters","alias","createUnit","deleteUnit","aliases","lastUnit","createUnitSingle","assertUnitNameIsValid","baseName","defUnit","newUnit","anyMatch","newBaseUnit","aliasName","createUnitFunction","createSparse","createCreateUnit","def","createAcos","acoshNumber","acotNumber","acothNumber","acscNumber","acschNumber","xInv","asecNumber","asechNumber","asinhNumber","atanhNumber","cotNumber","cothNumber","cscNumber","cschNumber","secNumber","sechNumber","sinhNumber","createAcosh","createAcot","acot","createAcoth","acoth","createAcsc","acsc","createAcsch","acsch","createAsec","asec","createAsech","asech","createAsin","createAsinh","createAtan","createAtan2","BigNumber, BigNumber","createAtanh","createTrigUnit","createCos","trigUnit","createCosh","coshNumber","createCot","cot","createCoth","coth","createCsc","csc","createCsch","csch","createSec","createSech","sech","createSin","createSinh","createTan","createTanh","_tanh","createSetCartesian","a1","a2","b1","b2","createSetDifference","inb2","createSetDistinct","createSetIntersect","createSetIsSubset","createSetMultiplicity","createSetPowerset","_subset","_sort","bitarray","createSetSize","unique","createSetSymDifference","setDifference","createSetUnion","setIntersect","setSymDifference","createAdd","createHypot","_hypot","largest","createNorm","ctranspose","eigs","_norm","sizeX","pinf","_vectorNormPlusInfinity","NEGATIVE_INFINITY","ninf","_vectorNormMinusInfinity","_vectorNorm","maxc","cj","_matrixNormOne","maxr","ri","_matrixNormInfinity","fro","_matrixNormFrobenius","tx","squaredX","eigenVals","rho","_matrixNormTwo","_matrixNorm","createDot","_validateDim","aIsColumn","bIsColumn","xindex","xvalues","yindex","yvalues","xLen","yLen","createTrace","_denseTrace","createIndex","keywords","createNode","mathWithTransform","evaluate","compile","expr","_compile","symbol","_validateScope","argNames","_ifNode","traverse","_traverse","path","transform","_transform","cloneDeep","customString","_getCustomString","_toString","toHTML","_toHTML","toTex","_toTex","handler","getIdentifier","getContent","_typeof","_defineProperty","toPrimitive","toPropertyKey","writable","errorTransform","accessFactory","createAccessorNode","Node","access","needParenthesis","AccessorNode","super","evalObject","evalIndex","context","createArrayNode","ArrayNode","items","evalItems","evalItem","itemsToTex","nested","mixedItems","itemsFormRow","itemSep","itemsTex","AssignmentNode","FunctionAssignmentNode","ConditionalNode","latexLeftParens","latexRightParens","latexParens","associativity","associativeWith","RelationalNode","RangeNode","unwrapParen","_node","parenthesis","content","getPrecedence","implicit","precedence","leftArg","getAssociativity","isAssociativeWith","nodeA","nodeB","identifierA","identifierB","createAssignmentNode","assignFactory","exprPrecedence","evalValue","childObject","evalParentObject","parentProp","evalParentIndex","parentIndex","createBlockNode","BlockNode","blocks","block","visible","evalBlocks","results","createConditionalNode","condition","trueExpr","falseExpr","evalCondition","evalTrueExpr","evalFalseExpr","testCondition","conditionPrecedence","truePrecedence","falsePrecedence","latexSymbols","Alpha","alpha","Beta","beta","Gamma","Delta","Epsilon","varepsilon","Zeta","Eta","eta","Theta","vartheta","Iota","iota","Kappa","kappa","varkappa","Lambda","lambda","Mu","mu","Nu","nu","Xi","Omicron","omicron","varpi","Rho","varrho","Sigma","sigma","varsigma","Tau","Upsilon","upsilon","Phi","varphi","Chi","chi","Psi","Omega","omega","true","false","Inf","infinity","oo","lim","latexOperators","dotPow","unaryPlus","bitNot","dotMultiply","leftShift","rightArithShift","rightLogShift","unequal","bitAnd","bitOr","and","xor","or","latexFunctions","cube","nthRoot","nthRoots","square","bellNumbers","catalan","stirlingS2","cross","det","expm","pinv","sqrtm","trace","combinations","combinationsWithRep","lgamma","erf","variance","sparse","latexUnits","escapeLatex","escapeLatexLib","toSymbol","createConstantNode","ConstantNode","toLatex","createFunctionAssignmentNode","paramNames","childArgNames","evalExpr","childArgs","createIndexNode","IndexNode","dotNotation","evalDimensions","_evalDimension","evalDimension","createObjectNode","ObjectNode","evalEntries","stringifiedKey","parsedKey","createSubScope","parentScope","createOperatorNode","startsWithConstant","curNode","calculateNecessaryParentheses","latex","operandPrecedence","operandIdentifier","rootIdentifier","lhsParens","lhsPrecedence","assocWithLhs","rhsParens","rhsPrecedence","assocWithRhs","lhsIdentifier","rhsIdentifier","argPrecedence","assocWithArg","argAssociativity","OperatorNode","isPercentage","evalArgs","rawArgs","evalArg0","evalArg1","evalArg","parens","assoc","operand","opIsNamed","lhs","rhs","stringifiedArgs","lhsTex","rhsTex","texifiedArgs","createParenthesisNode","ParenthesisNode","createRangeNode","startPrecedence","stepPrecedence","endPrecedence","needsEnd","evalStart","evalEnd","evalStep","createRelationalNode","operatorMap","conditionals","compiled","evalLhs","evalRhs","condFn","paramStrings","paramPrecedence","createSymbolNode","SymbolNode","onUndefinedSymbol","createFunctionNode","_FunctionNode","strin","expandTemplate","regex","inputPos","exec","ReferenceError","FunctionNode","getSafeMethod","fnExpr","evalFn","isRaw","resolveFn","onUndefinedFunction","customTex","latexConverter","customToTex","createParse","expression","parseStart","expressions","parseMultiple","extraNodes","TOKENTYPE","NULL","DELIMITER","NUMBER","SYMBOL","UNKNOWN","DELIMITERS","NAMED_DELIMITERS","CONSTANTS","NUMERIC_CONSTANTS","ESCAPE_CHARACTERS","currentString","currentCharacter","prevCharacter","nextCharacter","getToken","tokenType","token","comment","isWhitespace","nestingLevel","c2","c3","isHexDigit","isDecimalMark","createSyntaxError","isAlpha","getTokenSkipNewline","openParams","closeParams","conditionalLevel","parseAssignment","parseBlock","valid","parseLogicalXor","parseLogicalOr","parseConditional","parseLogicalAnd","parseBitwiseOr","parseBitwiseXor","parseBitwiseAnd","parseRelational","parseShift","operators","cond","parseConversion","parseRange","parseAddSubtract","parseMultiplyDivideModulusPercentage","rightNode","parseImplicitMultiplication","parseRule2","parseUnary","tokenStates","parseLeftHandOperators","parseNullishCoalescing","parsePow","CustomNode","parseAccessors","parseStringToken","parseRow","numericType","parseEnd","parseParentheses","parseObject","parseMatrix","parseString","parseSymbol","parseCustomNodes","quote","char","escapeChar","unicode","cPrev","cNext","isValidLatinOrGreek","isValidMathSymbol","high","low","createCompile","createEvaluate","createParserClass","Parser","isParser","getAll","toObject","getAllAsMap","isValidVariableName","variables","functions","isExpressionFunction","parser","_ref3","createParser","createLup","_denseLUP","lvalues","lindex","lptr","lsize","uvalues","uindex","uptr","usize","pvCo","pvOc","swapIndeces","spa","vkj","vik","pabsv","absv","U","_sparseLUP","ldata","udata","vij","createQr","_denseQR","_sparseQR","_denseQRimpl","Qdata","Rdata","sgn","conjSgn","alphaSquared","u1","csTdfs","head","post","csFlip","createCsAmd","lemax","dense","cm","at","tindex","tptr","_createTargetMatrix","nz","csFkeep","cnz","nv","elen","hhead","k2","pj","nvi","pk","eln","pn","_wclear","_initializeQuotientGraph","nel","_initializeDegreeLists","mindeg","elenk","nvk","dk","pk1","pk2","wnvi","dext","p3","p4","nvj","jlast","csLeaf","maxfirst","prevleaf","ancestor","sparent","jleaf","jprev","createCsCounts","ata","colcount","createCsSqr","csAmd","csCounts","qr","csPermute","inext","csEtree","csPost","leftmost","tail","nque","lnz","pa","_vcount","unz","csMarked","csMark","csUnflip","csDfs","jnew","createCsSpsolve","lo","gvalues","gindex","gptr","gsize","csReach","createCsLu","csSpsolve","ipiv","xabs","createSlu","csSqr","csLu","threshold","csIpvec","createLusolve","lup","slu","usolve","lsolve","_lusolve","_toMatrix","createPolynomialRoot","number|Complex, ...number|Complex","constant","restCoeffs","coeffs","denom","discriminant","D0_1","D0_2","D1_1","D1_2","Delta0","Delta1","discriminant1","discriminant2","Ccubed","createHelpClass","Help","doc","description","examples","configChanged","originalConfig","newConfig","mayThrow","seealso","createChainClass","Chain","createLazyProxy","resolver","chainify","sigObject","createProxy","excludedNames","docs","classes","eDocs","piDocs","embeddedDocs","LOG2E","LOG10E","SQRT1_2","SQRT2","version","speedOfLight","gravitationConstant","planckConstant","reducedPlanckConstant","magneticConstant","electricConstant","vacuumImpedance","coulombConstant","elementaryCharge","bohrMagneton","conductanceQuantum","inverseConductanceQuantum","magneticFluxQuantum","nuclearMagneton","klitzing","bohrRadius","classicalElectronRadius","electronMass","fermiCoupling","fineStructure","hartreeEnergy","protonMass","deuteronMass","neutronMass","quantumOfCirculation","rydberg","thomsonCrossSection","weakMixingAngle","efimovFactor","atomicMass","avogadro","boltzmann","faraday","firstRadiation","loschmidt","gasConstant","molarPlanckConstant","molarVolume","sackurTetrode","secondRadiation","stefanBoltzmann","wienDisplacement","molarMass","molarMassC12","gravity","planckLength","planckMass","planckTime","planckCharge","planckTemperature","derivative","lsolveAll","lusolve","leafCount","polynomialRoot","simplifyConstant","simplifyCore","symbolicEqual","rationalize","usolveAll","composition","import","help","distance","intersect","nullish","mapSlices","diag","kron","matrixFromFunction","matrixFromRows","matrixFromColumns","ones","partitionSelect","rotate","ifft","sylvester","schur","lyap","solveODE","kldivergence","multinomial","permutations","pickRandom","randomInt","equalText","setCartesian","setDistinct","setIsSubset","setMultiplicity","setPowerset","setSize","setUnion","zpk2tf","freqz","cumsum","mad","mean","median","quantileSeq","std","corr","bin","oct","hex","hasNumericValue","isPrime","print","createHelp","searchName","searchText","createChain","createDet","rowIndices","k_","_k","piv","piv_","i_","_det","createInv","_inv","ABig","rBig","Ac","Bc","Ar","Br","createPinv","_isZeros","_pinv","rref","lead","_isZero","_rref","_rankFact","Cpinv","Fpinv","createEigs","doRealSymmetric","getTheta","aii","ajj","aij","getThetaBig","Sij1","Sij","Ski","Skj","Sij1Big","x1Big","Hij","Aki","Akj","csHij","Aii","Ajj","getAij","Mij","maxMij","maxIJ","getAijBig","sorting","computeVectors","vecs","minID","eigenvectors","prec","e0","Vab","diagBig","createRealSymmetric","doComplexEigs","eigenvalues2x2","trA","detA","jordanBase2x2","l1","l2","big","na","nd","inflateMatrix","inverseIterate","orthog","largeNum","randomOrthogonalVector","orthogonalComplement","normalize","vectorShape","findVectors","realzero","realone","radixSq","Rdiag","colNorm","rowNorm","rowDivRadix","rowMulRadix","balance","maxIndex","tmp1","tmp2","tmp3","reduceToHessenberg","lambdas","Sdiag","Qtotal","Qpartial","lastConvergenceBefore","ll","vectors","blockDiag","iterateUntilTriangular","Cinv","uniqueValues","multiplicities","solutions","approxVec","correction","findEigenvectors","createComplexEigs","doEigs","Array, Object","matricize","useOpts","_opts$precision","isReal","coerceReal","isSymmetric","coerceTypes","computeValuesAndVectors","hasNumber","hasBig","hasComplex","console","warn","createExpm","infNorm","rowSum","infinityNorm","errorEstimate","findParams","Apos","AposToI","alternate","qfac","twoqfac","twoqp1fac","createSqrtm","_tolerance","_denmanBeavers","iterations","Yk","createSylvester","_sylvester","sA","sB","hc","RHS","gkk","gmk","gkm","gmm","LHS","yAux","createSchur","_schur","A0","QR","createLyap","createDivide","createDistance","_2d","xCoeff","yCoeff","_distancePointLine2D","_objectToArray","lineTwoPtY","lineOnePtY","lineOnePtX","lineTwoPtX","pointX","pointY","_3d","_parametricLine","_distancePointLine3D","_containsOnlyNumbers","_euclideanDistance","xCoeffLine","yCoeffLine","pointZ","x0","z0","pointOneX","pointOneY","pointTwoX","pointTwoY","pointOneZ","pointTwoZ","_isNumber","aI","_pairwise","pointA","pointB","_distancePairwise","den","vectorSize","createIntersect","_AAA","_AAAA","plane","_coerceArr","_4d","y1","z1","y2","z2","x1x","x2x","y1y","y2y","z1z","z2z","_intersectLinePlane","p1a","p1b","p2a","p2b","o1","o2","d20o11","d21o10","d20o21","d21o20","_intersect2d","x3","y3","z3","x4","y4","z4","d1343","_intersect3dHelper","d4321","d1321","d4343","d2121","ta","tb","pax","pay","paz","pbx","pby","pbz","_intersect3d","add1","add2","add3","createSum","_sum","createCumSum","_cumsum","_ncumSumDim","_cumsummap","sums","_cumsumDimensional","initialValue","createMean","_mean","createMedian","_median","mid","middle2","middle","createMad","_mad","med","DEFAULT_NORMALIZATION","createVariance","_var","_varDim","normalization","createQuantileSeq","Array | Matrix, number | BigNumber","_quantileSeqProbNumber","Array | Matrix, number | BigNumber, number","prob","_quantileSeqDim","Array | Matrix, number | BigNumber, boolean, number","sorted","Array | Matrix, Array | Matrix","_quantileSeqProbCollection","Array | Matrix, Array | Matrix, number","Array | Matrix, Array | Matrix, boolean, number","probOrN","probArr","dataArr","_quantileSeq","nPlusOne","probOrNArr","fracPart","createStd","_std","createCorr","_corr","correlations","correlation","sumX","sumY","sumXY","sumXSquare","sumYSquare","half","combinationsNumber","nMinusk","answer","nextdivisor","lastdivisor","nextnumerator","createCombinations","isPositiveInteger","createCombinationsWithRep","nMinusOne","gammaNumber","twoN","threeN","fourN","fiveN","gammaP","gammaG","lnSqrt2PI","lgammaSeries","lgammaNumber","lgammaN","createGamma","gammaComplex","gammaPval","twoPiSqrt","tpow","expt","bigFactorial","createLgamma","lgammaComplex","lgammaStirling","lgammaRecurrence","leftPart","rz","rzz","rightPart","signflips","sb","shiftprod","nsb","createFactorial","createKldivergence","_kldiv","plength","qlength","qnorm","pnorm","createMultinomial","ai","createPermutations","singletonRandom","now","createRng","randomSeed","createPickRandom","rng","possibles","_pickRandom","weights","elementWise","single","totalWeights","pick","randKey","randomMatrix","createRandom","_random","number, number","_randomMatrix","Array | Matrix, number","Array | Matrix, number, number","createRandomInt","_randomInt","_randomBigint","_randomIntMatrix","picked","createStirlingS2","smallCache","bigCache","make","nn","nk","createBellNumbers","createCatalan","createComposition","createLeafCount","countLeaves","isNumericNode","isConstantExpression","createUtil","defaultName","defaultContext","trivial","total","commutative","associative","paren","defaultF","hasProperty","nodeOrName","isAssociative","allChildren","findChildren","createMakeNodeFunction","isCommutative","mergeContext","primary","secondary","merged","unflattenr","makeNode","curnode","unflattenl","realContext","positiveContext","createSimplify","replacer","_simplify","Node, Map","Node, Map, Object","removeParens","SUPPORTED_CONSTANTS","_canonicalizeRule","ruleObject","newRule","lr","nonCommutative","leftExpandsym","_getExpandPlaceholderSymbol","expandsym","expanded","expandedNC1","expandedNC2","rules","assuming","repeat","imposeContext","addition","_lastsym","debug","consoleDebug","ruleSet","rule","ruleType","_buildRules","visited","laststr","rulestr","applyRule","newstr","mapRule","resNodes","newNode","mergedContext","newArgs","newContent","newItems","newObj","newIndex","newDims","newProps","repl","_ruleMatch","placeholders","mergeMatch","match1","match2","_exactMatch","combineChildMatches","list1","list2","i1","i2","isSplit","splits","rightArgs","getSplits","splitMatches","matchSet","childMatches","childMatch","leftMatch","rightMatch","sets","uniqueSets","mergeChildMatches","isVariableNode","createSimplifyConstant","_ensureNode","foldFraction","_removeFractions","thing","_eval","fnname","ignore","_toNumber","_toNode","fromBigInt","numeratorValue","numeratorNode","unaryMinusNode","_exactFraction","exactFractions","fractionsLimit","foldOp","reduction","sofar","ignoreandcontinue","newtree","sz","section","consts","vars","remainingDims","tryItems","fromItems","_foldAccessor","foldItems","foldProps","createSimplifyCore","node0","node1","nodeT","nodeF","isAlwaysBoolean","_simplifyCore","nodeToSimplify","simpChild","childCount","group","getOperator","seclast","a0","finish","createResolve","_resolve","within","nextWithin","Node, Object","selfAM","createSymbolicEqual","_symbolicEqual","e1","e2","simplified","createDerivative","plainDerivative","variable","variableName","_derivative","isConstCached","cached","_isConst","parseIdentifier","Node, string","Node, string, Object","deriv","_derivTex","isConst","varName","funcDerivative","negative","chainDerivative","constantTerms","nonConstantTerms","nonConstantNode","argOuter","argInner","powMinusOne","createRationalize","_rationalize","detailed","setRules","oldRules","rulesFirst","rulesSucDiv","firstRules","distrDivRules","sucDivRules","firstRulesAgain","finalRules","rulesRationalize","polyRet","extended","oper","recPoly","tp","retFunc","polynomial","nVars","noExactFractions","withExactFractions","sBefore","expandPower","eDistrDiv","redoInic","retRationalize","polyToCanonical","Node, boolean","indParent","internal","does","nEsqTopo","nDirTopo","maxExpo","varname","recurPol","noPai","noFil","fire","cte","valor","no","n3","createZpk2tf","_zpk2tf","_multiply","pole","createFreqz","_freqz","createBins","_w","sumNum","sumDen","bins","createReviver","createReplacer","createTrue","createFalse","createNull","createInfinity","recreateFactory","createNaN","createTau","_ref4","createE","_ref5","createPhi","_ref6","createLN2","_ref7","createLN10","_ref8","createLOG2E","_ref9","createLOG10E","_ref0","createSQRT1_2","_ref1","createSQRT2","_ref10","createI","_ref11","createUppercasePi","_ref12","createUppercaseE","_ref13","createVersion","recreateOnConfigChange","createSpeedOfLight","unitFactory","createGravitationConstant","createPlanckConstant","createReducedPlanckConstant","createMagneticConstant","createElectricConstant","createVacuumImpedance","createCoulomb","createCoulombConstant","createElementaryCharge","createBohrMagneton","createConductanceQuantum","createInverseConductanceQuantum","createMagneticFluxQuantum","createNuclearMagneton","createKlitzing","createBohrRadius","createClassicalElectronRadius","createElectronMass","createFermiCoupling","createFineStructure","numberFactory","createHartreeEnergy","createProtonMass","createDeuteronMass","createNeutronMass","createQuantumOfCirculation","createRydberg","createThomsonCrossSection","createWeakMixingAngle","createEfimovFactor","createAtomicMass","createAvogadro","createBoltzmann","createFaraday","createFirstRadiation","createLoschmidt","createGasConstant","createMolarPlanckConstant","createMolarVolume","createSackurTetrode","createSecondRadiation","createStefanBoltzmann","createWienDisplacement","createMolarMass","createMolarMassC12","createGravity","createPlanckLength","createPlanckMass","createPlanckTime","createPlanckCharge","createPlanckTemperature","createMapSlicesTransform","isTransformFunction","createColumnTransform","compileInlineExpression","argsScope","subScope","createTransformCallback","_transformTypedCallbackFunction","_transformCallbackFunction","fromEntries","callbackFunction","numberOfCallbackInputs","vals","_transformDims","createFilterTransform","filterTransform","transformCallback","_compileAndEvaluate","createForEachTransform","forEachTransform","createIndexTransform","isSet","createMapTransform","mapTransform","lastDimToZeroBase","dimToZeroBase","createMaxTransform","createMeanTransform","createMinTransform","createRangeTransform","createRowTransform","createSubsetTransform","createConcatTransform","createDiffTransform","createStdTransform","createSumTransform","createQuantileSeqTransform","createCumSumTransform","createVarianceTransform","createPrintTransform","_convertTemplateToZeroBasedIndex","part","createAndTransform","andTransform","condition1","condition2","createOrTransform","orTransform","createNullishTransform","nullishTransform","createBitAndTransform","bitAndTransform","createBitOrTransform","bitOrTransform","DEFAULT_CONFIG","MATRIX_OPTIONS","NUMBER_OPTIONS","configFactory","_config","optionsFix","validateOption","changes","factories","configInternal","emitter","Emitter","importedFactories","lazyTyped","internalImport","load","_import","_math$Unit","wrap","wrapper","_wrap","_importTransform","isDefined","silent","allowedInExpressions","_deleteTransform","_importFactory","_factory$meta$formerl","_factory$meta","namespace","isTransformFunctionFactory","existingTransform","instance","former","needsTransform","unsafe","factoryAllowedInExpressions","withTransform","flatValues","flattenImports","flatName","importFactory"],"sourceRoot":""}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/browser/package.json b/node_modules/mathjs/lib/browser/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/lib/browser/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/lib/cjs/constants.js b/node_modules/mathjs/lib/cjs/constants.js
new file mode 100644
index 0000000..dfe2922
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/constants.js
@@ -0,0 +1,130 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVersion = exports.createUppercasePi = exports.createUppercaseE = exports.createTrue = exports.createTau = exports.createSQRT2 = exports.createSQRT1_2 = exports.createPi = exports.createPhi = exports.createNull = exports.createNaN = exports.createLOG2E = exports.createLOG10E = exports.createLN2 = exports.createLN10 = exports.createInfinity = exports.createI = exports.createFalse = exports.createE = void 0;
+var _factory = require("./utils/factory.js");
+var _version = require("./version.js");
+var _constants = require("./utils/bignumber/constants.js");
+var _index = require("./plain/number/index.js");
+const createTrue = exports.createTrue = /* #__PURE__ */(0, _factory.factory)('true', [], () => true);
+const createFalse = exports.createFalse = /* #__PURE__ */(0, _factory.factory)('false', [], () => false);
+const createNull = exports.createNull = /* #__PURE__ */(0, _factory.factory)('null', [], () => null);
+const createInfinity = exports.createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], _ref => {
+  let {
+    config,
+    BigNumber
+  } = _ref;
+  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;
+});
+const createNaN = exports.createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], _ref2 => {
+  let {
+    config,
+    BigNumber
+  } = _ref2;
+  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;
+});
+const createPi = exports.createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], _ref3 => {
+  let {
+    config,
+    BigNumber
+  } = _ref3;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPi)(BigNumber) : _index.pi;
+});
+const createTau = exports.createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], _ref4 => {
+  let {
+    config,
+    BigNumber
+  } = _ref4;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberTau)(BigNumber) : _index.tau;
+});
+const createE = exports.createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], _ref5 => {
+  let {
+    config,
+    BigNumber
+  } = _ref5;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberE)(BigNumber) : _index.e;
+});
+
+// golden ratio, (1+sqrt(5))/2
+const createPhi = exports.createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], _ref6 => {
+  let {
+    config,
+    BigNumber
+  } = _ref6;
+  return config.number === 'BigNumber' ? (0, _constants.createBigNumberPhi)(BigNumber) : _index.phi;
+});
+const createLN2 = exports.createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], _ref7 => {
+  let {
+    config,
+    BigNumber
+  } = _ref7;
+  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;
+});
+const createLN10 = exports.createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], _ref8 => {
+  let {
+    config,
+    BigNumber
+  } = _ref8;
+  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;
+});
+const createLOG2E = exports.createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], _ref9 => {
+  let {
+    config,
+    BigNumber
+  } = _ref9;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;
+});
+const createLOG10E = exports.createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], _ref0 => {
+  let {
+    config,
+    BigNumber
+  } = _ref0;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;
+});
+const createSQRT1_2 = exports.createSQRT1_2 = /* #__PURE__ */recreateFactory(
+// eslint-disable-line camelcase
+'SQRT1_2', ['config', '?BigNumber'], _ref1 => {
+  let {
+    config,
+    BigNumber
+  } = _ref1;
+  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;
+});
+const createSQRT2 = exports.createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref10 => {
+  let {
+    config,
+    BigNumber
+  } = _ref10;
+  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;
+});
+const createI = exports.createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref11 => {
+  let {
+    Complex
+  } = _ref11;
+  return Complex.I;
+});
+
+// for backward compatibility with v5
+const createUppercasePi = exports.createUppercasePi = /* #__PURE__ */(0, _factory.factory)('PI', ['pi'], _ref12 => {
+  let {
+    pi
+  } = _ref12;
+  return pi;
+});
+const createUppercaseE = exports.createUppercaseE = /* #__PURE__ */(0, _factory.factory)('E', ['e'], _ref13 => {
+  let {
+    e
+  } = _ref13;
+  return e;
+});
+const createVersion = exports.createVersion = /* #__PURE__ */(0, _factory.factory)('version', [], () => _version.version);
+
+// helper function to create a factory with a flag recreateOnConfigChange
+// idea: allow passing optional properties to be attached to the factory function as 4th argument?
+function recreateFactory(name, dependencies, create) {
+  return (0, _factory.factory)(name, dependencies, create, {
+    recreateOnConfigChange: true
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/config.js b/node_modules/mathjs/lib/cjs/core/config.js
new file mode 100644
index 0000000..ea073bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/config.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DEFAULT_CONFIG = void 0;
+const DEFAULT_CONFIG = exports.DEFAULT_CONFIG = {
+  // minimum relative difference between two compared values,
+  // used by all comparison functions
+  relTol: 1e-12,
+  // minimum absolute difference between two compared values,
+  // used by all comparison functions
+  absTol: 1e-15,
+  // type of default matrix output. Choose 'matrix' (default) or 'array'
+  matrix: 'Matrix',
+  // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'
+  number: 'number',
+  // type of fallback used for config { number: 'bigint' } when a value cannot be represented
+  // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.
+  numberFallback: 'number',
+  // number of significant digits in BigNumbers
+  precision: 64,
+  // predictable output type of functions. When true, output type depends only
+  // on the input types. When false (default), output type can vary depending
+  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
+  // predictable is false, and returns `NaN` when true.
+  predictable: false,
+  // random seed for seeded pseudo random number generation
+  // null = randomly seed
+  randomSeed: null
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/create.js b/node_modules/mathjs/lib/cjs/core/create.js
new file mode 100644
index 0000000..e49dd89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/create.js
@@ -0,0 +1,212 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.create = create;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _typedFunction = _interopRequireDefault(require("typed-function"));
+var _ArgumentsError = require("../error/ArgumentsError.js");
+var _DimensionError = require("../error/DimensionError.js");
+var _IndexError = require("../error/IndexError.js");
+var _factory = require("../utils/factory.js");
+var _is = require("../utils/is.js");
+var _object = require("../utils/object.js");
+var emitter = _interopRequireWildcard(require("./../utils/emitter.js"));
+var _config = require("./config.js");
+var _config2 = require("./function/config.js");
+var _import = require("./function/import.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * Create a mathjs instance from given factory functions and optionally config
+ *
+ * Usage:
+ *
+ *     const mathjs1 = create({ createAdd, createMultiply, ...})
+ *     const config = { number: 'BigNumber' }
+ *     const mathjs2 = create(all, config)
+ *
+ * @param {Object} [factories] An object with factory functions
+ *                             The object can contain nested objects,
+ *                             all nested objects will be flattened.
+ * @param {Object} [config]    Available options:
+ *                            {number} relTol
+ *                              Minimum relative difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {number} absTol
+ *                              Minimum absolute difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {string} matrix
+ *                              A string 'Matrix' (default) or 'Array'.
+ *                            {string} number
+ *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+ *                            {number} precision
+ *                              The number of significant digits for BigNumbers.
+ *                              Not applicable for Numbers.
+ *                            {boolean} predictable
+ *                              Predictable output type of functions. When true,
+ *                              output type depends only on the input types. When
+ *                              false (default), output type can vary depending
+ *                              on input values. For example `math.sqrt(-4)`
+ *                              returns `complex('2i')` when predictable is false, and
+ *                              returns `NaN` when true.
+ *                            {string} randomSeed
+ *                              Random seed for seeded pseudo random number generator.
+ *                              Set to null to randomly seed.
+ * @returns {Object} Returns a bare-bone math.js instance containing
+ *                   functions:
+ *                   - `import` to add new functions
+ *                   - `config` to change configuration
+ *                   - `on`, `off`, `once`, `emit` for events
+ */
+function create(factories, config) {
+  const configInternal = (0, _extends2.default)({}, _config.DEFAULT_CONFIG, config);
+
+  // simple test for ES5 support
+  if (typeof Object.create !== 'function') {
+    throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');
+  }
+
+  // create the mathjs instance
+  const math = emitter.mixin({
+    // only here for backward compatibility for legacy factory functions
+    isNumber: _is.isNumber,
+    isComplex: _is.isComplex,
+    isBigNumber: _is.isBigNumber,
+    isBigInt: _is.isBigInt,
+    isFraction: _is.isFraction,
+    isUnit: _is.isUnit,
+    isString: _is.isString,
+    isArray: _is.isArray,
+    isMatrix: _is.isMatrix,
+    isCollection: _is.isCollection,
+    isDenseMatrix: _is.isDenseMatrix,
+    isSparseMatrix: _is.isSparseMatrix,
+    isRange: _is.isRange,
+    isIndex: _is.isIndex,
+    isBoolean: _is.isBoolean,
+    isResultSet: _is.isResultSet,
+    isHelp: _is.isHelp,
+    isFunction: _is.isFunction,
+    isDate: _is.isDate,
+    isRegExp: _is.isRegExp,
+    isObject: _is.isObject,
+    isMap: _is.isMap,
+    isPartitionedMap: _is.isPartitionedMap,
+    isObjectWrappingMap: _is.isObjectWrappingMap,
+    isNull: _is.isNull,
+    isUndefined: _is.isUndefined,
+    isAccessorNode: _is.isAccessorNode,
+    isArrayNode: _is.isArrayNode,
+    isAssignmentNode: _is.isAssignmentNode,
+    isBlockNode: _is.isBlockNode,
+    isConditionalNode: _is.isConditionalNode,
+    isConstantNode: _is.isConstantNode,
+    isFunctionAssignmentNode: _is.isFunctionAssignmentNode,
+    isFunctionNode: _is.isFunctionNode,
+    isIndexNode: _is.isIndexNode,
+    isNode: _is.isNode,
+    isObjectNode: _is.isObjectNode,
+    isOperatorNode: _is.isOperatorNode,
+    isParenthesisNode: _is.isParenthesisNode,
+    isRangeNode: _is.isRangeNode,
+    isRelationalNode: _is.isRelationalNode,
+    isSymbolNode: _is.isSymbolNode,
+    isChain: _is.isChain
+  });
+
+  // load config function and apply provided config
+  math.config = (0, _config2.configFactory)(configInternal, math.emit);
+  math.expression = {
+    transform: {},
+    mathWithTransform: {
+      config: math.config
+    }
+  };
+
+  // cached factories and instances used by function load
+  const legacyFactories = [];
+  const legacyInstances = [];
+
+  /**
+   * Load a function or data type from a factory.
+   * If the function or data type already exists, the existing instance is
+   * returned.
+   * @param {Function} factory
+   * @returns {*}
+   */
+  function load(factory) {
+    if ((0, _factory.isFactory)(factory)) {
+      return factory(math);
+    }
+    const firstProperty = factory[Object.keys(factory)[0]];
+    if ((0, _factory.isFactory)(firstProperty)) {
+      return firstProperty(math);
+    }
+    if (!(0, _object.isLegacyFactory)(factory)) {
+      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);
+      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');
+    }
+    const index = legacyFactories.indexOf(factory);
+    let instance;
+    if (index === -1) {
+      // doesn't yet exist
+      if (factory.math === true) {
+        // pass with math namespace
+        instance = factory.factory(math.type, configInternal, load, math.typed, math);
+      } else {
+        instance = factory.factory(math.type, configInternal, load, math.typed);
+      }
+
+      // append to the cache
+      legacyFactories.push(factory);
+      legacyInstances.push(instance);
+    } else {
+      // already existing function, return the cached instance
+      instance = legacyInstances[index];
+    }
+    return instance;
+  }
+  const importedFactories = {};
+
+  // load the import function
+  function lazyTyped() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    return math.typed.apply(math.typed, args);
+  }
+  lazyTyped.isTypedFunction = _typedFunction.default.isTypedFunction;
+  const internalImport = (0, _import.importFactory)(lazyTyped, load, math, importedFactories);
+  math.import = internalImport;
+
+  // listen for changes in config, import all functions again when changed
+  // TODO: move this listener into the import function?
+  math.on('config', () => {
+    Object.values(importedFactories).forEach(factory => {
+      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {
+        // FIXME: only re-create when the current instance is the same as was initially created
+        // FIXME: delete the functions/constants before importing them again?
+        internalImport(factory, {
+          override: true
+        });
+      }
+    });
+  });
+
+  // the create function exposed on the mathjs instance is bound to
+  // the factory functions passed before
+  math.create = create.bind(null, factories);
+
+  // export factory function
+  math.factory = _factory.factory;
+
+  // import the factory functions like createAdd as an array instead of object,
+  // else they will get a different naming (`createAdd` instead of `add`).
+  math.import(Object.values((0, _object.deepFlatten)(factories)));
+  math.ArgumentsError = _ArgumentsError.ArgumentsError;
+  math.DimensionError = _DimensionError.DimensionError;
+  math.IndexError = _IndexError.IndexError;
+  return math;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/config.js b/node_modules/mathjs/lib/cjs/core/function/config.js
new file mode 100644
index 0000000..acb4cc0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/config.js
@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NUMBER_OPTIONS = exports.MATRIX_OPTIONS = void 0;
+exports.configFactory = configFactory;
+var _object = require("../../utils/object.js");
+var _config2 = require("../config.js");
+const MATRIX_OPTIONS = exports.MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix
+const NUMBER_OPTIONS = exports.NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', 'Fraction']; // valid values for option number
+
+function configFactory(config, emit) {
+  /**
+   * Set configuration options for math.js, and get current options.
+   * Will emit a 'config' event, with arguments (curr, prev, changes).
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *     math.config(config: Object): Object
+   *
+   * Examples:
+   *
+   *     import { create, all } from 'mathjs'
+   *
+   *     // create a mathjs instance
+   *     const math = create(all)
+   *
+   *     math.config().number                // outputs 'number'
+   *     math.evaluate('0.4')                // outputs number 0.4
+   *     math.config({number: 'Fraction'})
+   *     math.evaluate('0.4')                // outputs Fraction 2/5
+   *
+   * @param {Object} [options] Available options:
+   *                            {number} relTol
+   *                              Minimum relative difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {number} absTol
+   *                              Minimum absolute difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {string} matrix
+   *                              A string 'Matrix' (default) or 'Array'.
+   *                            {string} number
+   *                              A string 'number' (default), 'BigNumber', 'bigint', or 'Fraction'
+   *                            {number} precision
+   *                              The number of significant digits for BigNumbers.
+   *                              Not applicable for Numbers.
+   *                            {string} parenthesis
+   *                              How to display parentheses in LaTeX and string
+   *                              output.
+   *                            {string} randomSeed
+   *                              Random seed for seeded pseudo random number generator.
+   *                              Set to null to randomly seed.
+   * @return {Object} Returns the current configuration
+   */
+  function _config(options) {
+    if (options) {
+      if (options.epsilon !== undefined) {
+        // this if is only for backwards compatibility, it can be removed in the future.
+        console.warn('Warning: The configuration option "epsilon" is deprecated. Use "relTol" and "absTol" instead.');
+        const optionsFix = (0, _object.clone)(options);
+        optionsFix.relTol = options.epsilon;
+        optionsFix.absTol = options.epsilon * 1e-3;
+        delete optionsFix.epsilon;
+        return _config(optionsFix);
+      }
+      const prev = (0, _object.clone)(config);
+
+      // validate some of the options
+      validateOption(options, 'matrix', MATRIX_OPTIONS);
+      validateOption(options, 'number', NUMBER_OPTIONS);
+
+      // merge options
+      (0, _object.deepExtend)(config, options);
+      const curr = (0, _object.clone)(config);
+      const changes = (0, _object.clone)(options);
+
+      // emit 'config' event
+      emit('config', curr, prev, changes);
+      return curr;
+    } else {
+      return (0, _object.clone)(config);
+    }
+  }
+
+  // attach the valid options to the function so they can be extended
+  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;
+  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;
+
+  // attach the config properties as readonly properties to the config function
+  Object.keys(_config2.DEFAULT_CONFIG).forEach(key => {
+    Object.defineProperty(_config, key, {
+      get: () => config[key],
+      enumerable: true,
+      configurable: true
+    });
+  });
+  return _config;
+}
+
+/**
+ * Validate an option
+ * @param {Object} options         Object with options
+ * @param {string} name            Name of the option to validate
+ * @param {Array.<string>} values  Array with valid values for this option
+ */
+function validateOption(options, name, values) {
+  if (options[name] !== undefined && !values.includes(options[name])) {
+    // unknown value
+    console.warn('Warning: Unknown value "' + options[name] + '" for configuration option "' + name + '". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/import.js b/node_modules/mathjs/lib/cjs/core/function/import.js
new file mode 100644
index 0000000..74226a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/import.js
@@ -0,0 +1,347 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.importFactory = importFactory;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _object = require("../../utils/object.js");
+var _ArgumentsError = require("../../error/ArgumentsError.js");
+function importFactory(typed, load, math, importedFactories) {
+  /**
+   * Import functions from an object or a module.
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *    math.import(functions)
+   *    math.import(functions, options)
+   *
+   * Where:
+   *
+   * - `functions: Object`
+   *   An object with functions or factories to be imported.
+   * - `options: Object` An object with import options. Available options:
+   *   - `override: boolean`
+   *     If true, existing functions will be overwritten. False by default.
+   *   - `silent: boolean`
+   *     If true, the function will not throw errors on duplicates or invalid
+   *     types. False by default.
+   *   - `wrap: boolean`
+   *     If true, the functions will be wrapped in a wrapper function
+   *     which converts data types like Matrix to primitive data types like Array.
+   *     The wrapper is needed when extending math.js with libraries which do not
+   *     support these data type. False by default.
+   *
+   * Examples:
+   *
+   *    import { create, all } from 'mathjs'
+   *    import * as numbers from 'numbers'
+   *
+   *    // create a mathjs instance
+   *    const math = create(all)
+   *
+   *    // define new functions and variables
+   *    math.import({
+   *      myvalue: 42,
+   *      hello: function (name) {
+   *        return 'hello, ' + name + '!'
+   *      }
+   *    })
+   *
+   *    // use the imported function and variable
+   *    math.myvalue * 2               // 84
+   *    math.hello('user')             // 'hello, user!'
+   *
+   *    // import the npm module 'numbers'
+   *    // (must be installed first with `npm install numbers`)
+   *    math.import(numbers, {wrap: true})
+   *
+   *    math.fibonacci(7) // returns 13
+   *
+   * @param {Object | Array} functions  Object with functions to be imported.
+   * @param {Object} [options]          Import options.
+   */
+  function mathImport(functions, options) {
+    const num = arguments.length;
+    if (num !== 1 && num !== 2) {
+      throw new _ArgumentsError.ArgumentsError('import', num, 1, 2);
+    }
+    if (!options) {
+      options = {};
+    }
+    function flattenImports(flatValues, value, name) {
+      if (Array.isArray(value)) {
+        value.forEach(item => flattenImports(flatValues, item));
+      } else if ((0, _is.isObject)(value) || isModule(value)) {
+        for (const name in value) {
+          if ((0, _object.hasOwnProperty)(value, name)) {
+            flattenImports(flatValues, value[name], name);
+          }
+        }
+      } else if ((0, _factory.isFactory)(value) || name !== undefined) {
+        const flatName = (0, _factory.isFactory)(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly
+        : value.fn : name;
+
+        // we allow importing the same function twice if it points to the same implementation
+        if ((0, _object.hasOwnProperty)(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {
+          throw new Error('Cannot import "' + flatName + '" twice');
+        }
+        flatValues[flatName] = value;
+      } else {
+        if (!options.silent) {
+          throw new TypeError('Factory, Object, or Array expected');
+        }
+      }
+    }
+    const flatValues = {};
+    flattenImports(flatValues, functions);
+    for (const name in flatValues) {
+      if ((0, _object.hasOwnProperty)(flatValues, name)) {
+        // console.log('import', name)
+        const value = flatValues[name];
+        if ((0, _factory.isFactory)(value)) {
+          // we ignore name here and enforce the name of the factory
+          // maybe at some point we do want to allow overriding it
+          // in that case we can implement an option overrideFactoryNames: true
+          _importFactory(value, options);
+        } else if (isSupportedType(value)) {
+          _import(name, value, options);
+        } else {
+          if (!options.silent) {
+            throw new TypeError('Factory, Object, or Array expected');
+          }
+        }
+      }
+    }
+  }
+
+  /**
+   * Add a property to the math namespace
+   * @param {string} name
+   * @param {*} value
+   * @param {Object} options  See import for a description of the options
+   * @private
+   */
+  function _import(name, value, options) {
+    var _math$Unit;
+    // TODO: refactor this function, it's to complicated and contains duplicate code
+    if (options.wrap && typeof value === 'function') {
+      // create a wrapper around the function
+      value = _wrap(value);
+    }
+
+    // turn a plain function with a typed-function signature into a typed-function
+    if (hasTypedFunctionSignature(value)) {
+      value = typed(name, {
+        [value.signature]: value
+      });
+    }
+    if (typed.isTypedFunction(math[name]) && typed.isTypedFunction(value)) {
+      if (options.override) {
+        // give the typed function the right name
+        value = typed(name, value.signatures);
+      } else {
+        // merge the existing and typed function
+        value = typed(math[name], value);
+      }
+      math[name] = value;
+      delete importedFactories[name];
+      _importTransform(name, value);
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+    const isDefined = math[name] !== undefined;
+    const isValuelessUnit = (_math$Unit = math.Unit) === null || _math$Unit === void 0 ? void 0 : _math$Unit.isValuelessUnit(name);
+    if (!isDefined && !isValuelessUnit || options.override) {
+      math[name] = value;
+      delete importedFactories[name];
+      _importTransform(name, value);
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+    if (!options.silent) {
+      throw new Error('Cannot import "' + name + '": already exists');
+    }
+  }
+  function _importTransform(name, value) {
+    if (value && typeof value.transform === 'function') {
+      math.expression.transform[name] = value.transform;
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value.transform;
+      }
+    } else {
+      // remove existing transform
+      delete math.expression.transform[name];
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value;
+      }
+    }
+  }
+  function _deleteTransform(name) {
+    delete math.expression.transform[name];
+    if (allowedInExpressions(name)) {
+      math.expression.mathWithTransform[name] = math[name];
+    } else {
+      delete math.expression.mathWithTransform[name];
+    }
+  }
+
+  /**
+   * Create a wrapper a round an function which converts the arguments
+   * to their primitive values (like convert a Matrix to Array)
+   * @param {Function} fn
+   * @return {Function} Returns the wrapped function
+   * @private
+   */
+  function _wrap(fn) {
+    const wrapper = function wrapper() {
+      const args = [];
+      for (let i = 0, len = arguments.length; i < len; i++) {
+        const arg = arguments[i];
+        args[i] = arg && arg.valueOf();
+      }
+      return fn.apply(math, args);
+    };
+    if (fn.transform) {
+      wrapper.transform = fn.transform;
+    }
+    return wrapper;
+  }
+
+  /**
+   * Import an instance of a factory into math.js
+   * @param {function(scope: object)} factory
+   * @param {Object} options  See import for a description of the options
+   * @param {string} [name=factory.name] Optional custom name
+   * @private
+   */
+  function _importFactory(factory, options) {
+    var _factory$meta$formerl, _factory$meta;
+    let name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;
+    if (name.includes('.')) {
+      throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));
+    }
+    const namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;
+    const existingTransform = name in math.expression.transform;
+    const existing = (0, _object.hasOwnProperty)(namespace, name) ? namespace[name] : undefined;
+    const resolver = function () {
+      // collect all dependencies, handle finding both functions and classes and other special cases
+      const dependencies = {};
+      factory.dependencies.map(_factory.stripOptionalNotation).forEach(dependency => {
+        if (dependency.includes('.')) {
+          throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));
+        }
+        if (dependency === 'math') {
+          dependencies.math = math;
+        } else if (dependency === 'mathWithTransform') {
+          dependencies.mathWithTransform = math.expression.mathWithTransform;
+        } else if (dependency === 'classes') {
+          // special case for json reviver
+          dependencies.classes = math;
+        } else {
+          dependencies[dependency] = math[dependency];
+        }
+      });
+      const instance = /* #__PURE__ */factory(dependencies);
+      if (instance && typeof instance.transform === 'function') {
+        throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with export const path = "expression.transform"');
+      }
+      if (existing === undefined || options.override) {
+        return instance;
+      }
+      if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {
+        // merge the existing and new typed function
+        return typed(existing, instance);
+      }
+      if (options.silent) {
+        // keep existing, ignore imported function
+        return existing;
+      } else {
+        throw new Error('Cannot import "' + name + '": already exists');
+      }
+    };
+    const former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';
+    const needsTransform = isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory);
+    const withTransform = math.expression.mathWithTransform;
+
+    // TODO: add unit test with non-lazy factory
+    if (!factory.meta || factory.meta.lazy !== false) {
+      (0, _object.lazy)(namespace, name, resolver);
+      if (former) (0, _object.lazy)(namespace, former, resolver);
+
+      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+        if (former) _deleteTransform(former);
+      } else {
+        if (needsTransform) {
+          (0, _object.lazy)(withTransform, name, () => namespace[name]);
+          if (former) (0, _object.lazy)(withTransform, former, () => namespace[name]);
+        }
+      }
+    } else {
+      namespace[name] = resolver();
+      if (former) namespace[former] = namespace[name];
+
+      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+        if (former) _deleteTransform(former);
+      } else {
+        if (needsTransform) {
+          (0, _object.lazy)(withTransform, name, () => namespace[name]);
+          if (former) (0, _object.lazy)(withTransform, former, () => namespace[name]);
+        }
+      }
+    }
+
+    // TODO: improve factories, store a list with imports instead which can be re-played
+    importedFactories[name] = factory;
+    math.emit('import', name, resolver);
+  }
+
+  /**
+   * Check whether given object is a type which can be imported
+   * @param {Function | number | string | boolean | null | Unit | Complex} object
+   * @return {boolean}
+   * @private
+   */
+  function isSupportedType(object) {
+    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || (0, _is.isUnit)(object) || (0, _is.isComplex)(object) || (0, _is.isBigNumber)(object) || (0, _is.isFraction)(object) || (0, _is.isMatrix)(object) || Array.isArray(object);
+  }
+  function isModule(object) {
+    return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';
+  }
+  function hasTypedFunctionSignature(fn) {
+    return typeof fn === 'function' && typeof fn.signature === 'string';
+  }
+  function allowedInExpressions(name) {
+    return !(0, _object.hasOwnProperty)(unsafe, name);
+  }
+  function factoryAllowedInExpressions(factory) {
+    return !factory.fn.includes('.') &&
+    // FIXME: make checking on path redundant, check on meta data instead
+    !(0, _object.hasOwnProperty)(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);
+  }
+  function isTransformFunctionFactory(factory) {
+    return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;
+  }
+
+  // namespaces and functions not available in the parser for safety reasons
+  const unsafe = {
+    expression: true,
+    type: true,
+    docs: true,
+    error: true,
+    json: true,
+    chain: true // chain method not supported. Note that there is a unit chain too.
+  };
+  return mathImport;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/core/function/typed.js b/node_modules/mathjs/lib/cjs/core/function/typed.js
new file mode 100644
index 0000000..48c3fe5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/core/function/typed.js
@@ -0,0 +1,461 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTyped = void 0;
+var _typedFunction = _interopRequireDefault(require("typed-function"));
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+/**
+ * Create a typed-function which checks the types of the arguments and
+ * can match them against multiple provided signatures. The typed-function
+ * automatically converts inputs in order to find a matching signature.
+ * Typed functions throw informative errors in case of wrong input arguments.
+ *
+ * See the library [typed-function](https://github.com/josdejong/typed-function)
+ * for detailed documentation.
+ *
+ * Syntax:
+ *
+ *     math.typed(name, signatures) : function
+ *     math.typed(signatures) : function
+ *
+ * Examples:
+ *
+ *     // create a typed function with multiple types per argument (type union)
+ *     const fn2 = typed({
+ *       'number | boolean': function (b) {
+ *         return 'b is a number or boolean'
+ *       },
+ *       'string, number | boolean': function (a, b) {
+ *         return 'a is a string, b is a number or boolean'
+ *       }
+ *     })
+ *
+ *     // create a typed function with an any type argument
+ *     const log = typed({
+ *       'string, any': function (event, data) {
+ *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))
+ *       }
+ *     })
+ *
+ * @param {string} [name]                          Optional name for the typed-function
+ * @param {Object<string, function>} signatures   Object with one or multiple function signatures
+ * @returns {function} The created typed-function.
+ */
+
+// returns a new instance of typed-function
+let _createTyped = function () {
+  // initially, return the original instance of typed-function
+  // consecutively, return a new instance from typed.create.
+  _createTyped = _typedFunction.default.create;
+  return _typedFunction.default;
+};
+const dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];
+
+/**
+ * Factory function for creating a new typed instance
+ * @param {Object} dependencies   Object with data types like Complex and BigNumber
+ * @returns {Function}
+ */
+const createTyped = exports.createTyped = /* #__PURE__ */(0, _factory.factory)('typed', dependencies, function createTyped(_ref) {
+  let {
+    BigNumber,
+    Complex,
+    DenseMatrix,
+    Fraction
+  } = _ref;
+  // TODO: typed-function must be able to silently ignore signatures with unknown data types
+
+  // get a new instance of typed-function
+  const typed = _createTyped();
+
+  // define all types. The order of the types determines in which order function
+  // arguments are type-checked (so for performance it's important to put the
+  // most used types first).
+  typed.clear();
+  typed.addTypes([{
+    name: 'number',
+    test: _is.isNumber
+  }, {
+    name: 'Complex',
+    test: _is.isComplex
+  }, {
+    name: 'BigNumber',
+    test: _is.isBigNumber
+  }, {
+    name: 'bigint',
+    test: _is.isBigInt
+  }, {
+    name: 'Fraction',
+    test: _is.isFraction
+  }, {
+    name: 'Unit',
+    test: _is.isUnit
+  },
+  // The following type matches a valid variable name, i.e., an alphanumeric
+  // string starting with an alphabetic character. It is used (at least)
+  // in the definition of the derivative() function, as the argument telling
+  // what to differentiate over must (currently) be a variable.
+  // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)
+  {
+    name: 'identifier',
+    test: s => _is.isString && /^[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC\u{10000}-\u{1000B}\u{1000D}-\u{10026}\u{10028}-\u{1003A}\u{1003C}\u{1003D}\u{1003F}-\u{1004D}\u{10050}-\u{1005D}\u{10080}-\u{100FA}\u{10280}-\u{1029C}\u{102A0}-\u{102D0}\u{10300}-\u{1031F}\u{1032D}-\u{10340}\u{10342}-\u{10349}\u{10350}-\u{10375}\u{10380}-\u{1039D}\u{103A0}-\u{103C3}\u{103C8}-\u{103CF}\u{10400}-\u{1049D}\u{104B0}-\u{104D3}\u{104D8}-\u{104FB}\u{10500}-\u{10527}\u{10530}-\u{10563}\u{10570}-\u{1057A}\u{1057C}-\u{1058A}\u{1058C}-\u{10592}\u{10594}\u{10595}\u{10597}-\u{105A1}\u{105A3}-\u{105B1}\u{105B3}-\u{105B9}\u{105BB}\u{105BC}\u{105C0}-\u{105F3}\u{10600}-\u{10736}\u{10740}-\u{10755}\u{10760}-\u{10767}\u{10780}-\u{10785}\u{10787}-\u{107B0}\u{107B2}-\u{107BA}\u{10800}-\u{10805}\u{10808}\u{1080A}-\u{10835}\u{10837}\u{10838}\u{1083C}\u{1083F}-\u{10855}\u{10860}-\u{10876}\u{10880}-\u{1089E}\u{108E0}-\u{108F2}\u{108F4}\u{108F5}\u{10900}-\u{10915}\u{10920}-\u{10939}\u{10980}-\u{109B7}\u{109BE}\u{109BF}\u{10A00}\u{10A10}-\u{10A13}\u{10A15}-\u{10A17}\u{10A19}-\u{10A35}\u{10A60}-\u{10A7C}\u{10A80}-\u{10A9C}\u{10AC0}-\u{10AC7}\u{10AC9}-\u{10AE4}\u{10B00}-\u{10B35}\u{10B40}-\u{10B55}\u{10B60}-\u{10B72}\u{10B80}-\u{10B91}\u{10C00}-\u{10C48}\u{10C80}-\u{10CB2}\u{10CC0}-\u{10CF2}\u{10D00}-\u{10D23}\u{10D4A}-\u{10D65}\u{10D6F}-\u{10D85}\u{10E80}-\u{10EA9}\u{10EB0}\u{10EB1}\u{10EC2}-\u{10EC4}\u{10F00}-\u{10F1C}\u{10F27}\u{10F30}-\u{10F45}\u{10F70}-\u{10F81}\u{10FB0}-\u{10FC4}\u{10FE0}-\u{10FF6}\u{11003}-\u{11037}\u{11071}\u{11072}\u{11075}\u{11083}-\u{110AF}\u{110D0}-\u{110E8}\u{11103}-\u{11126}\u{11144}\u{11147}\u{11150}-\u{11172}\u{11176}\u{11183}-\u{111B2}\u{111C1}-\u{111C4}\u{111DA}\u{111DC}\u{11200}-\u{11211}\u{11213}-\u{1122B}\u{1123F}\u{11240}\u{11280}-\u{11286}\u{11288}\u{1128A}-\u{1128D}\u{1128F}-\u{1129D}\u{1129F}-\u{112A8}\u{112B0}-\u{112DE}\u{11305}-\u{1130C}\u{1130F}\u{11310}\u{11313}-\u{11328}\u{1132A}-\u{11330}\u{11332}\u{11333}\u{11335}-\u{11339}\u{1133D}\u{11350}\u{1135D}-\u{11361}\u{11380}-\u{11389}\u{1138B}\u{1138E}\u{11390}-\u{113B5}\u{113B7}\u{113D1}\u{113D3}\u{11400}-\u{11434}\u{11447}-\u{1144A}\u{1145F}-\u{11461}\u{11480}-\u{114AF}\u{114C4}\u{114C5}\u{114C7}\u{11580}-\u{115AE}\u{115D8}-\u{115DB}\u{11600}-\u{1162F}\u{11644}\u{11680}-\u{116AA}\u{116B8}\u{11700}-\u{1171A}\u{11740}-\u{11746}\u{11800}-\u{1182B}\u{118A0}-\u{118DF}\u{118FF}-\u{11906}\u{11909}\u{1190C}-\u{11913}\u{11915}\u{11916}\u{11918}-\u{1192F}\u{1193F}\u{11941}\u{119A0}-\u{119A7}\u{119AA}-\u{119D0}\u{119E1}\u{119E3}\u{11A00}\u{11A0B}-\u{11A32}\u{11A3A}\u{11A50}\u{11A5C}-\u{11A89}\u{11A9D}\u{11AB0}-\u{11AF8}\u{11BC0}-\u{11BE0}\u{11C00}-\u{11C08}\u{11C0A}-\u{11C2E}\u{11C40}\u{11C72}-\u{11C8F}\u{11D00}-\u{11D06}\u{11D08}\u{11D09}\u{11D0B}-\u{11D30}\u{11D46}\u{11D60}-\u{11D65}\u{11D67}\u{11D68}\u{11D6A}-\u{11D89}\u{11D98}\u{11EE0}-\u{11EF2}\u{11F02}\u{11F04}-\u{11F10}\u{11F12}-\u{11F33}\u{11FB0}\u{12000}-\u{12399}\u{12480}-\u{12543}\u{12F90}-\u{12FF0}\u{13000}-\u{1342F}\u{13441}-\u{13446}\u{13460}-\u{143FA}\u{14400}-\u{14646}\u{16100}-\u{1611D}\u{16800}-\u{16A38}\u{16A40}-\u{16A5E}\u{16A70}-\u{16ABE}\u{16AD0}-\u{16AED}\u{16B00}-\u{16B2F}\u{16B40}-\u{16B43}\u{16B63}-\u{16B77}\u{16B7D}-\u{16B8F}\u{16D40}-\u{16D6C}\u{16E40}-\u{16E7F}\u{16F00}-\u{16F4A}\u{16F50}\u{16F93}-\u{16F9F}\u{16FE0}\u{16FE1}\u{16FE3}\u{17000}-\u{187F7}\u{18800}-\u{18CD5}\u{18CFF}-\u{18D08}\u{1AFF0}-\u{1AFF3}\u{1AFF5}-\u{1AFFB}\u{1AFFD}\u{1AFFE}\u{1B000}-\u{1B122}\u{1B132}\u{1B150}-\u{1B152}\u{1B155}\u{1B164}-\u{1B167}\u{1B170}-\u{1B2FB}\u{1BC00}-\u{1BC6A}\u{1BC70}-\u{1BC7C}\u{1BC80}-\u{1BC88}\u{1BC90}-\u{1BC99}\u{1D400}-\u{1D454}\u{1D456}-\u{1D49C}\u{1D49E}\u{1D49F}\u{1D4A2}\u{1D4A5}\u{1D4A6}\u{1D4A9}-\u{1D4AC}\u{1D4AE}-\u{1D4B9}\u{1D4BB}\u{1D4BD}-\u{1D4C3}\u{1D4C5}-\u{1D505}\u{1D507}-\u{1D50A}\u{1D50D}-\u{1D514}\u{1D516}-\u{1D51C}\u{1D51E}-\u{1D539}\u{1D53B}-\u{1D53E}\u{1D540}-\u{1D544}\u{1D546}\u{1D54A}-\u{1D550}\u{1D552}-\u{1D6A5}\u{1D6A8}-\u{1D6C0}\u{1D6C2}-\u{1D6DA}\u{1D6DC}-\u{1D6FA}\u{1D6FC}-\u{1D714}\u{1D716}-\u{1D734}\u{1D736}-\u{1D74E}\u{1D750}-\u{1D76E}\u{1D770}-\u{1D788}\u{1D78A}-\u{1D7A8}\u{1D7AA}-\u{1D7C2}\u{1D7C4}-\u{1D7CB}\u{1DF00}-\u{1DF1E}\u{1DF25}-\u{1DF2A}\u{1E030}-\u{1E06D}\u{1E100}-\u{1E12C}\u{1E137}-\u{1E13D}\u{1E14E}\u{1E290}-\u{1E2AD}\u{1E2C0}-\u{1E2EB}\u{1E4D0}-\u{1E4EB}\u{1E5D0}-\u{1E5ED}\u{1E5F0}\u{1E7E0}-\u{1E7E6}\u{1E7E8}-\u{1E7EB}\u{1E7ED}\u{1E7EE}\u{1E7F0}-\u{1E7FE}\u{1E800}-\u{1E8C4}\u{1E900}-\u{1E943}\u{1E94B}\u{1EE00}-\u{1EE03}\u{1EE05}-\u{1EE1F}\u{1EE21}\u{1EE22}\u{1EE24}\u{1EE27}\u{1EE29}-\u{1EE32}\u{1EE34}-\u{1EE37}\u{1EE39}\u{1EE3B}\u{1EE42}\u{1EE47}\u{1EE49}\u{1EE4B}\u{1EE4D}-\u{1EE4F}\u{1EE51}\u{1EE52}\u{1EE54}\u{1EE57}\u{1EE59}\u{1EE5B}\u{1EE5D}\u{1EE5F}\u{1EE61}\u{1EE62}\u{1EE64}\u{1EE67}-\u{1EE6A}\u{1EE6C}-\u{1EE72}\u{1EE74}-\u{1EE77}\u{1EE79}-\u{1EE7C}\u{1EE7E}\u{1EE80}-\u{1EE89}\u{1EE8B}-\u{1EE9B}\u{1EEA1}-\u{1EEA3}\u{1EEA5}-\u{1EEA9}\u{1EEAB}-\u{1EEBB}\u{20000}-\u{2A6DF}\u{2A700}-\u{2B739}\u{2B740}-\u{2B81D}\u{2B820}-\u{2CEA1}\u{2CEB0}-\u{2EBE0}\u{2EBF0}-\u{2EE5D}\u{2F800}-\u{2FA1D}\u{30000}-\u{3134A}\u{31350}-\u{323AF}][0-9A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC\u{10000}-\u{1000B}\u{1000D}-\u{10026}\u{10028}-\u{1003A}\u{1003C}\u{1003D}\u{1003F}-\u{1004D}\u{10050}-\u{1005D}\u{10080}-\u{100FA}\u{10280}-\u{1029C}\u{102A0}-\u{102D0}\u{10300}-\u{1031F}\u{1032D}-\u{10340}\u{10342}-\u{10349}\u{10350}-\u{10375}\u{10380}-\u{1039D}\u{103A0}-\u{103C3}\u{103C8}-\u{103CF}\u{10400}-\u{1049D}\u{104B0}-\u{104D3}\u{104D8}-\u{104FB}\u{10500}-\u{10527}\u{10530}-\u{10563}\u{10570}-\u{1057A}\u{1057C}-\u{1058A}\u{1058C}-\u{10592}\u{10594}\u{10595}\u{10597}-\u{105A1}\u{105A3}-\u{105B1}\u{105B3}-\u{105B9}\u{105BB}\u{105BC}\u{105C0}-\u{105F3}\u{10600}-\u{10736}\u{10740}-\u{10755}\u{10760}-\u{10767}\u{10780}-\u{10785}\u{10787}-\u{107B0}\u{107B2}-\u{107BA}\u{10800}-\u{10805}\u{10808}\u{1080A}-\u{10835}\u{10837}\u{10838}\u{1083C}\u{1083F}-\u{10855}\u{10860}-\u{10876}\u{10880}-\u{1089E}\u{108E0}-\u{108F2}\u{108F4}\u{108F5}\u{10900}-\u{10915}\u{10920}-\u{10939}\u{10980}-\u{109B7}\u{109BE}\u{109BF}\u{10A00}\u{10A10}-\u{10A13}\u{10A15}-\u{10A17}\u{10A19}-\u{10A35}\u{10A60}-\u{10A7C}\u{10A80}-\u{10A9C}\u{10AC0}-\u{10AC7}\u{10AC9}-\u{10AE4}\u{10B00}-\u{10B35}\u{10B40}-\u{10B55}\u{10B60}-\u{10B72}\u{10B80}-\u{10B91}\u{10C00}-\u{10C48}\u{10C80}-\u{10CB2}\u{10CC0}-\u{10CF2}\u{10D00}-\u{10D23}\u{10D4A}-\u{10D65}\u{10D6F}-\u{10D85}\u{10E80}-\u{10EA9}\u{10EB0}\u{10EB1}\u{10EC2}-\u{10EC4}\u{10F00}-\u{10F1C}\u{10F27}\u{10F30}-\u{10F45}\u{10F70}-\u{10F81}\u{10FB0}-\u{10FC4}\u{10FE0}-\u{10FF6}\u{11003}-\u{11037}\u{11071}\u{11072}\u{11075}\u{11083}-\u{110AF}\u{110D0}-\u{110E8}\u{11103}-\u{11126}\u{11144}\u{11147}\u{11150}-\u{11172}\u{11176}\u{11183}-\u{111B2}\u{111C1}-\u{111C4}\u{111DA}\u{111DC}\u{11200}-\u{11211}\u{11213}-\u{1122B}\u{1123F}\u{11240}\u{11280}-\u{11286}\u{11288}\u{1128A}-\u{1128D}\u{1128F}-\u{1129D}\u{1129F}-\u{112A8}\u{112B0}-\u{112DE}\u{11305}-\u{1130C}\u{1130F}\u{11310}\u{11313}-\u{11328}\u{1132A}-\u{11330}\u{11332}\u{11333}\u{11335}-\u{11339}\u{1133D}\u{11350}\u{1135D}-\u{11361}\u{11380}-\u{11389}\u{1138B}\u{1138E}\u{11390}-\u{113B5}\u{113B7}\u{113D1}\u{113D3}\u{11400}-\u{11434}\u{11447}-\u{1144A}\u{1145F}-\u{11461}\u{11480}-\u{114AF}\u{114C4}\u{114C5}\u{114C7}\u{11580}-\u{115AE}\u{115D8}-\u{115DB}\u{11600}-\u{1162F}\u{11644}\u{11680}-\u{116AA}\u{116B8}\u{11700}-\u{1171A}\u{11740}-\u{11746}\u{11800}-\u{1182B}\u{118A0}-\u{118DF}\u{118FF}-\u{11906}\u{11909}\u{1190C}-\u{11913}\u{11915}\u{11916}\u{11918}-\u{1192F}\u{1193F}\u{11941}\u{119A0}-\u{119A7}\u{119AA}-\u{119D0}\u{119E1}\u{119E3}\u{11A00}\u{11A0B}-\u{11A32}\u{11A3A}\u{11A50}\u{11A5C}-\u{11A89}\u{11A9D}\u{11AB0}-\u{11AF8}\u{11BC0}-\u{11BE0}\u{11C00}-\u{11C08}\u{11C0A}-\u{11C2E}\u{11C40}\u{11C72}-\u{11C8F}\u{11D00}-\u{11D06}\u{11D08}\u{11D09}\u{11D0B}-\u{11D30}\u{11D46}\u{11D60}-\u{11D65}\u{11D67}\u{11D68}\u{11D6A}-\u{11D89}\u{11D98}\u{11EE0}-\u{11EF2}\u{11F02}\u{11F04}-\u{11F10}\u{11F12}-\u{11F33}\u{11FB0}\u{12000}-\u{12399}\u{12480}-\u{12543}\u{12F90}-\u{12FF0}\u{13000}-\u{1342F}\u{13441}-\u{13446}\u{13460}-\u{143FA}\u{14400}-\u{14646}\u{16100}-\u{1611D}\u{16800}-\u{16A38}\u{16A40}-\u{16A5E}\u{16A70}-\u{16ABE}\u{16AD0}-\u{16AED}\u{16B00}-\u{16B2F}\u{16B40}-\u{16B43}\u{16B63}-\u{16B77}\u{16B7D}-\u{16B8F}\u{16D40}-\u{16D6C}\u{16E40}-\u{16E7F}\u{16F00}-\u{16F4A}\u{16F50}\u{16F93}-\u{16F9F}\u{16FE0}\u{16FE1}\u{16FE3}\u{17000}-\u{187F7}\u{18800}-\u{18CD5}\u{18CFF}-\u{18D08}\u{1AFF0}-\u{1AFF3}\u{1AFF5}-\u{1AFFB}\u{1AFFD}\u{1AFFE}\u{1B000}-\u{1B122}\u{1B132}\u{1B150}-\u{1B152}\u{1B155}\u{1B164}-\u{1B167}\u{1B170}-\u{1B2FB}\u{1BC00}-\u{1BC6A}\u{1BC70}-\u{1BC7C}\u{1BC80}-\u{1BC88}\u{1BC90}-\u{1BC99}\u{1D400}-\u{1D454}\u{1D456}-\u{1D49C}\u{1D49E}\u{1D49F}\u{1D4A2}\u{1D4A5}\u{1D4A6}\u{1D4A9}-\u{1D4AC}\u{1D4AE}-\u{1D4B9}\u{1D4BB}\u{1D4BD}-\u{1D4C3}\u{1D4C5}-\u{1D505}\u{1D507}-\u{1D50A}\u{1D50D}-\u{1D514}\u{1D516}-\u{1D51C}\u{1D51E}-\u{1D539}\u{1D53B}-\u{1D53E}\u{1D540}-\u{1D544}\u{1D546}\u{1D54A}-\u{1D550}\u{1D552}-\u{1D6A5}\u{1D6A8}-\u{1D6C0}\u{1D6C2}-\u{1D6DA}\u{1D6DC}-\u{1D6FA}\u{1D6FC}-\u{1D714}\u{1D716}-\u{1D734}\u{1D736}-\u{1D74E}\u{1D750}-\u{1D76E}\u{1D770}-\u{1D788}\u{1D78A}-\u{1D7A8}\u{1D7AA}-\u{1D7C2}\u{1D7C4}-\u{1D7CB}\u{1DF00}-\u{1DF1E}\u{1DF25}-\u{1DF2A}\u{1E030}-\u{1E06D}\u{1E100}-\u{1E12C}\u{1E137}-\u{1E13D}\u{1E14E}\u{1E290}-\u{1E2AD}\u{1E2C0}-\u{1E2EB}\u{1E4D0}-\u{1E4EB}\u{1E5D0}-\u{1E5ED}\u{1E5F0}\u{1E7E0}-\u{1E7E6}\u{1E7E8}-\u{1E7EB}\u{1E7ED}\u{1E7EE}\u{1E7F0}-\u{1E7FE}\u{1E800}-\u{1E8C4}\u{1E900}-\u{1E943}\u{1E94B}\u{1EE00}-\u{1EE03}\u{1EE05}-\u{1EE1F}\u{1EE21}\u{1EE22}\u{1EE24}\u{1EE27}\u{1EE29}-\u{1EE32}\u{1EE34}-\u{1EE37}\u{1EE39}\u{1EE3B}\u{1EE42}\u{1EE47}\u{1EE49}\u{1EE4B}\u{1EE4D}-\u{1EE4F}\u{1EE51}\u{1EE52}\u{1EE54}\u{1EE57}\u{1EE59}\u{1EE5B}\u{1EE5D}\u{1EE5F}\u{1EE61}\u{1EE62}\u{1EE64}\u{1EE67}-\u{1EE6A}\u{1EE6C}-\u{1EE72}\u{1EE74}-\u{1EE77}\u{1EE79}-\u{1EE7C}\u{1EE7E}\u{1EE80}-\u{1EE89}\u{1EE8B}-\u{1EE9B}\u{1EEA1}-\u{1EEA3}\u{1EEA5}-\u{1EEA9}\u{1EEAB}-\u{1EEBB}\u{20000}-\u{2A6DF}\u{2A700}-\u{2B739}\u{2B740}-\u{2B81D}\u{2B820}-\u{2CEA1}\u{2CEB0}-\u{2EBE0}\u{2EBF0}-\u{2EE5D}\u{2F800}-\u{2FA1D}\u{30000}-\u{3134A}\u{31350}-\u{323AF}]*$/u.test(s)
+  }, {
+    name: 'string',
+    test: _is.isString
+  }, {
+    name: 'Chain',
+    test: _is.isChain
+  }, {
+    name: 'Array',
+    test: _is.isArray
+  }, {
+    name: 'Matrix',
+    test: _is.isMatrix
+  }, {
+    name: 'DenseMatrix',
+    test: _is.isDenseMatrix
+  }, {
+    name: 'SparseMatrix',
+    test: _is.isSparseMatrix
+  }, {
+    name: 'Range',
+    test: _is.isRange
+  }, {
+    name: 'Index',
+    test: _is.isIndex
+  }, {
+    name: 'boolean',
+    test: _is.isBoolean
+  }, {
+    name: 'ResultSet',
+    test: _is.isResultSet
+  }, {
+    name: 'Help',
+    test: _is.isHelp
+  }, {
+    name: 'function',
+    test: _is.isFunction
+  }, {
+    name: 'Date',
+    test: _is.isDate
+  }, {
+    name: 'RegExp',
+    test: _is.isRegExp
+  }, {
+    name: 'null',
+    test: _is.isNull
+  }, {
+    name: 'undefined',
+    test: _is.isUndefined
+  }, {
+    name: 'AccessorNode',
+    test: _is.isAccessorNode
+  }, {
+    name: 'ArrayNode',
+    test: _is.isArrayNode
+  }, {
+    name: 'AssignmentNode',
+    test: _is.isAssignmentNode
+  }, {
+    name: 'BlockNode',
+    test: _is.isBlockNode
+  }, {
+    name: 'ConditionalNode',
+    test: _is.isConditionalNode
+  }, {
+    name: 'ConstantNode',
+    test: _is.isConstantNode
+  }, {
+    name: 'FunctionNode',
+    test: _is.isFunctionNode
+  }, {
+    name: 'FunctionAssignmentNode',
+    test: _is.isFunctionAssignmentNode
+  }, {
+    name: 'IndexNode',
+    test: _is.isIndexNode
+  }, {
+    name: 'Node',
+    test: _is.isNode
+  }, {
+    name: 'ObjectNode',
+    test: _is.isObjectNode
+  }, {
+    name: 'OperatorNode',
+    test: _is.isOperatorNode
+  }, {
+    name: 'ParenthesisNode',
+    test: _is.isParenthesisNode
+  }, {
+    name: 'RangeNode',
+    test: _is.isRangeNode
+  }, {
+    name: 'RelationalNode',
+    test: _is.isRelationalNode
+  }, {
+    name: 'SymbolNode',
+    test: _is.isSymbolNode
+  }, {
+    name: 'Map',
+    test: _is.isMap
+  }, {
+    name: 'Object',
+    test: _is.isObject
+  } // order 'Object' last, it matches on other classes too
+  ]);
+  typed.addConversions([{
+    from: 'number',
+    to: 'BigNumber',
+    convert: function (x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      // note: conversion from number to BigNumber can fail if x has >15 digits
+      if ((0, _number.digits)(x) > 15) {
+        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');
+      }
+      return new BigNumber(x);
+    }
+  }, {
+    from: 'number',
+    to: 'Complex',
+    convert: function (x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x, 0);
+    }
+  }, {
+    from: 'BigNumber',
+    to: 'Complex',
+    convert: function (x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x.toNumber(), 0);
+    }
+  }, {
+    from: 'bigint',
+    to: 'number',
+    convert: function (x) {
+      if (x > Number.MAX_SAFE_INTEGER) {
+        throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');
+      }
+      return Number(x);
+    }
+  }, {
+    from: 'bigint',
+    to: 'BigNumber',
+    convert: function (x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      return new BigNumber(x.toString());
+    }
+  }, {
+    from: 'bigint',
+    to: 'Fraction',
+    convert: function (x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      return new Fraction(x);
+    }
+  }, {
+    from: 'Fraction',
+    to: 'BigNumber',
+    convert: function (x) {
+      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');
+    }
+  }, {
+    from: 'Fraction',
+    to: 'Complex',
+    convert: function (x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x.valueOf(), 0);
+    }
+  }, {
+    from: 'number',
+    to: 'Fraction',
+    convert: function (x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      const f = new Fraction(x);
+      if (f.valueOf() !== x) {
+        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');
+      }
+      return f;
+    }
+  }, {
+    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`
+    //  from: 'Fraction',
+    //  to: 'number',
+    //  convert: function (x) {
+    //    return x.valueOf()
+    //  }
+    // }, {
+    from: 'string',
+    to: 'number',
+    convert: function (x) {
+      const n = Number(x);
+      if (isNaN(n)) {
+        throw new Error('Cannot convert "' + x + '" to a number');
+      }
+      return n;
+    }
+  }, {
+    from: 'string',
+    to: 'BigNumber',
+    convert: function (x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      try {
+        return new BigNumber(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigNumber');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'bigint',
+    convert: function (x) {
+      try {
+        return BigInt(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigInt');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Fraction',
+    convert: function (x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      try {
+        return new Fraction(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Fraction');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Complex',
+    convert: function (x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      try {
+        return new Complex(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Complex');
+      }
+    }
+  }, {
+    from: 'boolean',
+    to: 'number',
+    convert: function (x) {
+      return +x;
+    }
+  }, {
+    from: 'boolean',
+    to: 'BigNumber',
+    convert: function (x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      return new BigNumber(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'bigint',
+    convert: function (x) {
+      return BigInt(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'Fraction',
+    convert: function (x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      return new Fraction(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'string',
+    convert: function (x) {
+      return String(x);
+    }
+  }, {
+    from: 'Array',
+    to: 'Matrix',
+    convert: function (array) {
+      if (!DenseMatrix) {
+        throwNoMatrix();
+      }
+      return new DenseMatrix(array);
+    }
+  }, {
+    from: 'Matrix',
+    to: 'Array',
+    convert: function (matrix) {
+      return matrix.valueOf();
+    }
+  }]);
+
+  // Provide a suggestion on how to call a function elementwise
+  // This was added primarily as guidance for the v10 -> v11 transition,
+  // and could potentially be removed in the future if it no longer seems
+  // to be helpful.
+  typed.onMismatch = (name, args, signatures) => {
+    const usualError = typed.createError(name, args, signatures);
+    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && (0, _is.isCollection)(args[0]) &&
+    // check if the function can be unary:
+    signatures.some(sig => !sig.params.includes(','))) {
+      const err = new TypeError(`Function '${name}' doesn't apply to matrices. To call it ` + `elementwise on a matrix 'M', try 'map(M, ${name})'.`);
+      err.data = usualError.data;
+      throw err;
+    }
+    throw usualError;
+  };
+
+  // Provide a suggestion on how to call a function elementwise
+  // This was added primarily as guidance for the v10 -> v11 transition,
+  // and could potentially be removed in the future if it no longer seems
+  // to be helpful.
+  typed.onMismatch = (name, args, signatures) => {
+    const usualError = typed.createError(name, args, signatures);
+    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && (0, _is.isCollection)(args[0]) &&
+    // check if the function can be unary:
+    signatures.some(sig => !sig.params.includes(','))) {
+      const err = new TypeError(`Function '${name}' doesn't apply to matrices. To call it ` + `elementwise on a matrix 'M', try 'map(M, ${name})'.`);
+      err.data = usualError.data;
+      throw err;
+    }
+    throw usualError;
+  };
+  return typed;
+});
+function throwNoBignumber(x) {
+  throw new Error(`Cannot convert value ${x} into a BigNumber: no class 'BigNumber' provided`);
+}
+function throwNoComplex(x) {
+  throw new Error(`Cannot convert value ${x} into a Complex number: no class 'Complex' provided`);
+}
+function throwNoMatrix() {
+  throw new Error('Cannot convert array into a Matrix: no class \'DenseMatrix\' provided');
+}
+function throwNoFraction(x) {
+  throw new Error(`Cannot convert value ${x} into a Fraction, no class 'Fraction' provided.`);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/defaultInstance.js b/node_modules/mathjs/lib/cjs/defaultInstance.js
new file mode 100644
index 0000000..c3fa964
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/defaultInstance.js
@@ -0,0 +1,10 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var all = _interopRequireWildcard(require("./factoriesAny.js"));
+var _create = require("./core/create.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+var _default = exports.default = (0, _create.create)(all);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js b/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js
new file mode 100644
index 0000000..ad64246
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/allFactoriesAny.js
@@ -0,0 +1,11 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.all = void 0;
+var allFactories = _interopRequireWildcard(require("../factoriesAny.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+// creating all factories here in a separate file is needed to get tree-shaking working
+
+const all = exports.all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js b/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js
new file mode 100644
index 0000000..6c240a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/allFactoriesNumber.js
@@ -0,0 +1,11 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.all = void 0;
+var allFactories = _interopRequireWildcard(require("../factoriesNumber.js"));
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+// creating all factories here in a separate file is needed to get tree-shaking working
+
+const all = exports.all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/configReadonly.js b/node_modules/mathjs/lib/cjs/entry/configReadonly.js
new file mode 100644
index 0000000..509c249
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/configReadonly.js
@@ -0,0 +1,22 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.config = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _config = require("../core/config.js");
+var _config2 = require("../core/function/config.js");
+// create a read-only version of config
+const config = function (options) {
+  if (options) {
+    throw new Error('The global config is readonly. \n' + 'Please create a mathjs instance if you want to change the default configuration. \n' + 'Example:\n' + '\n' + '  import { create, all } from \'mathjs\';\n' + '  const mathjs = create(all);\n' + '  mathjs.config({ number: \'BigNumber\' });\n');
+  }
+  return Object.freeze(_config.DEFAULT_CONFIG);
+};
+exports.config = config;
+(0, _extends2.default)(config, _config.DEFAULT_CONFIG, {
+  MATRIX_OPTIONS: _config2.MATRIX_OPTIONS,
+  NUMBER_OPTIONS: _config2.NUMBER_OPTIONS
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js
new file mode 100644
index 0000000..d16f947
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny.generated.js
@@ -0,0 +1,2574 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "AccessorNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAccessorNodeGenerated.AccessorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ArrayNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesArrayNodeGenerated.ArrayNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "AssignmentNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "BigNumberDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBigNumberClassGenerated.BigNumberDependencies;
+  }
+});
+Object.defineProperty(exports, "BlockNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBlockNodeGenerated.BlockNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ChainDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesChainClassGenerated.ChainDependencies;
+  }
+});
+Object.defineProperty(exports, "ComplexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesComplexClassGenerated.ComplexDependencies;
+  }
+});
+Object.defineProperty(exports, "ConditionalNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ConstantNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConstantNodeGenerated.ConstantNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "DenseMatrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUppercaseEGenerated.EDependencies;
+  }
+});
+Object.defineProperty(exports, "FibonacciHeapDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies;
+  }
+});
+Object.defineProperty(exports, "FractionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFractionClassGenerated.FractionDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionAssignmentNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFunctionNodeGenerated.FunctionNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "HelpDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHelpClassGenerated.HelpDependencies;
+  }
+});
+Object.defineProperty(exports, "ImmutableDenseMatrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexClassGenerated.IndexDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexNodeGenerated.IndexNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "InfinityDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesInfinityGenerated.InfinityDependencies;
+  }
+});
+Object.defineProperty(exports, "LN10Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLN10Generated.LN10Dependencies;
+  }
+});
+Object.defineProperty(exports, "LN2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLN2Generated.LN2Dependencies;
+  }
+});
+Object.defineProperty(exports, "LOG10EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLOG10EGenerated.LOG10EDependencies;
+  }
+});
+Object.defineProperty(exports, "LOG2EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLOG2EGenerated.LOG2EDependencies;
+  }
+});
+Object.defineProperty(exports, "MatrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixClassGenerated.MatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "NaNDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNaNGenerated.NaNDependencies;
+  }
+});
+Object.defineProperty(exports, "NodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNodeGenerated.NodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ObjectNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesObjectNodeGenerated.ObjectNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "OperatorNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOperatorNodeGenerated.OperatorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "PIDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUppercasePiGenerated.PIDependencies;
+  }
+});
+Object.defineProperty(exports, "ParenthesisNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ParserDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParserClassGenerated.ParserDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeClassGenerated.RangeDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeNodeGenerated.RangeNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "RelationalNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRelationalNodeGenerated.RelationalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ResultSetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesResultSetGenerated.ResultSetDependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT1_2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSQRT1_2Generated.SQRT1_2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSQRT2Generated.SQRT2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SpaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSpaClassGenerated.SpaDependencies;
+  }
+});
+Object.defineProperty(exports, "SparseMatrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "SymbolNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSymbolNodeGenerated.SymbolNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "UnitDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnitClassGenerated.UnitDependencies;
+  }
+});
+Object.defineProperty(exports, "absDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAbsGenerated.absDependencies;
+  }
+});
+Object.defineProperty(exports, "acosDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcosGenerated.acosDependencies;
+  }
+});
+Object.defineProperty(exports, "acoshDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcoshGenerated.acoshDependencies;
+  }
+});
+Object.defineProperty(exports, "acotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcotGenerated.acotDependencies;
+  }
+});
+Object.defineProperty(exports, "acothDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcothGenerated.acothDependencies;
+  }
+});
+Object.defineProperty(exports, "acscDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcscGenerated.acscDependencies;
+  }
+});
+Object.defineProperty(exports, "acschDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcschGenerated.acschDependencies;
+  }
+});
+Object.defineProperty(exports, "addDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAddGenerated.addDependencies;
+  }
+});
+Object.defineProperty(exports, "addScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAddScalarGenerated.addScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "all", {
+  enumerable: true,
+  get: function () {
+    return _allFactoriesAny.all;
+  }
+});
+Object.defineProperty(exports, "andDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAndGenerated.andDependencies;
+  }
+});
+Object.defineProperty(exports, "andTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAndTransformGenerated.andTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "argDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesArgGenerated.argDependencies;
+  }
+});
+Object.defineProperty(exports, "asecDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsecGenerated.asecDependencies;
+  }
+});
+Object.defineProperty(exports, "asechDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsechGenerated.asechDependencies;
+  }
+});
+Object.defineProperty(exports, "asinDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsinGenerated.asinDependencies;
+  }
+});
+Object.defineProperty(exports, "asinhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsinhGenerated.asinhDependencies;
+  }
+});
+Object.defineProperty(exports, "atan2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtan2Generated.atan2Dependencies;
+  }
+});
+Object.defineProperty(exports, "atanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtanGenerated.atanDependencies;
+  }
+});
+Object.defineProperty(exports, "atanhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtanhGenerated.atanhDependencies;
+  }
+});
+Object.defineProperty(exports, "atomicMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtomicMassGenerated.atomicMassDependencies;
+  }
+});
+Object.defineProperty(exports, "avogadroDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAvogadroGenerated.avogadroDependencies;
+  }
+});
+Object.defineProperty(exports, "bellNumbersDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBellNumbersGenerated.bellNumbersDependencies;
+  }
+});
+Object.defineProperty(exports, "bigintDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBigintGenerated.bigintDependencies;
+  }
+});
+Object.defineProperty(exports, "bignumberDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBignumberGenerated.bignumberDependencies;
+  }
+});
+Object.defineProperty(exports, "binDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBinGenerated.binDependencies;
+  }
+});
+Object.defineProperty(exports, "bitAndDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitAndGenerated.bitAndDependencies;
+  }
+});
+Object.defineProperty(exports, "bitAndTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitAndTransformGenerated.bitAndTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "bitNotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitNotGenerated.bitNotDependencies;
+  }
+});
+Object.defineProperty(exports, "bitOrDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitOrGenerated.bitOrDependencies;
+  }
+});
+Object.defineProperty(exports, "bitOrTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitOrTransformGenerated.bitOrTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "bitXorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitXorGenerated.bitXorDependencies;
+  }
+});
+Object.defineProperty(exports, "bohrMagnetonDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBohrMagnetonGenerated.bohrMagnetonDependencies;
+  }
+});
+Object.defineProperty(exports, "bohrRadiusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBohrRadiusGenerated.bohrRadiusDependencies;
+  }
+});
+Object.defineProperty(exports, "boltzmannDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBoltzmannGenerated.boltzmannDependencies;
+  }
+});
+Object.defineProperty(exports, "booleanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBooleanGenerated.booleanDependencies;
+  }
+});
+Object.defineProperty(exports, "catalanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCatalanGenerated.catalanDependencies;
+  }
+});
+Object.defineProperty(exports, "cbrtDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCbrtGenerated.cbrtDependencies;
+  }
+});
+Object.defineProperty(exports, "ceilDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCeilGenerated.ceilDependencies;
+  }
+});
+Object.defineProperty(exports, "chainDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesChainGenerated.chainDependencies;
+  }
+});
+Object.defineProperty(exports, "classicalElectronRadiusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesClassicalElectronRadiusGenerated.classicalElectronRadiusDependencies;
+  }
+});
+Object.defineProperty(exports, "cloneDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCloneGenerated.cloneDependencies;
+  }
+});
+Object.defineProperty(exports, "columnDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesColumnGenerated.columnDependencies;
+  }
+});
+Object.defineProperty(exports, "columnTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesColumnTransformGenerated.columnTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCombinationsGenerated.combinationsDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsWithRepDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCombinationsWithRepGenerated.combinationsWithRepDependencies;
+  }
+});
+Object.defineProperty(exports, "compareDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareGenerated.compareDependencies;
+  }
+});
+Object.defineProperty(exports, "compareNaturalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareNaturalGenerated.compareNaturalDependencies;
+  }
+});
+Object.defineProperty(exports, "compareTextDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareTextGenerated.compareTextDependencies;
+  }
+});
+Object.defineProperty(exports, "compileDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompileGenerated.compileDependencies;
+  }
+});
+Object.defineProperty(exports, "complexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesComplexGenerated.complexDependencies;
+  }
+});
+Object.defineProperty(exports, "compositionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompositionGenerated.compositionDependencies;
+  }
+});
+Object.defineProperty(exports, "concatDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConcatGenerated.concatDependencies;
+  }
+});
+Object.defineProperty(exports, "concatTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConcatTransformGenerated.concatTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "conductanceQuantumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConductanceQuantumGenerated.conductanceQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "conjDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConjGenerated.conjDependencies;
+  }
+});
+Object.defineProperty(exports, "corrDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCorrGenerated.corrDependencies;
+  }
+});
+Object.defineProperty(exports, "cosDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCosGenerated.cosDependencies;
+  }
+});
+Object.defineProperty(exports, "coshDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCoshGenerated.coshDependencies;
+  }
+});
+Object.defineProperty(exports, "cotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCotGenerated.cotDependencies;
+  }
+});
+Object.defineProperty(exports, "cothDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCothGenerated.cothDependencies;
+  }
+});
+Object.defineProperty(exports, "coulombConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCoulombConstantGenerated.coulombConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "coulombDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCoulombGenerated.coulombDependencies;
+  }
+});
+Object.defineProperty(exports, "countDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCountGenerated.countDependencies;
+  }
+});
+Object.defineProperty(exports, "createUnitDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCreateUnitGenerated.createUnitDependencies;
+  }
+});
+Object.defineProperty(exports, "crossDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCrossGenerated.crossDependencies;
+  }
+});
+Object.defineProperty(exports, "cscDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCscGenerated.cscDependencies;
+  }
+});
+Object.defineProperty(exports, "cschDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCschGenerated.cschDependencies;
+  }
+});
+Object.defineProperty(exports, "ctransposeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCtransposeGenerated.ctransposeDependencies;
+  }
+});
+Object.defineProperty(exports, "cubeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCubeGenerated.cubeDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCumSumGenerated.cumsumDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCumSumTransformGenerated.cumsumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "deepEqualDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDeepEqualGenerated.deepEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "derivativeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDerivativeGenerated.derivativeDependencies;
+  }
+});
+Object.defineProperty(exports, "detDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDetGenerated.detDependencies;
+  }
+});
+Object.defineProperty(exports, "deuteronMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDeuteronMassGenerated.deuteronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "diagDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDiagGenerated.diagDependencies;
+  }
+});
+Object.defineProperty(exports, "diffDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDiffGenerated.diffDependencies;
+  }
+});
+Object.defineProperty(exports, "diffTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDiffTransformGenerated.diffTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "distanceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDistanceGenerated.distanceDependencies;
+  }
+});
+Object.defineProperty(exports, "divideDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDivideGenerated.divideDependencies;
+  }
+});
+Object.defineProperty(exports, "divideScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDivideScalarGenerated.divideScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "dotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDotGenerated.dotDependencies;
+  }
+});
+Object.defineProperty(exports, "dotDivideDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDotDivideGenerated.dotDivideDependencies;
+  }
+});
+Object.defineProperty(exports, "dotMultiplyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDotMultiplyGenerated.dotMultiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "dotPowDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDotPowGenerated.dotPowDependencies;
+  }
+});
+Object.defineProperty(exports, "eDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEGenerated.eDependencies;
+  }
+});
+Object.defineProperty(exports, "efimovFactorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEfimovFactorGenerated.efimovFactorDependencies;
+  }
+});
+Object.defineProperty(exports, "eigsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEigsGenerated.eigsDependencies;
+  }
+});
+Object.defineProperty(exports, "electricConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesElectricConstantGenerated.electricConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "electronMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesElectronMassGenerated.electronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "elementaryChargeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesElementaryChargeGenerated.elementaryChargeDependencies;
+  }
+});
+Object.defineProperty(exports, "equalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualGenerated.equalDependencies;
+  }
+});
+Object.defineProperty(exports, "equalScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualScalarGenerated.equalScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "equalTextDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualTextGenerated.equalTextDependencies;
+  }
+});
+Object.defineProperty(exports, "erfDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesErfGenerated.erfDependencies;
+  }
+});
+Object.defineProperty(exports, "evaluateDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEvaluateGenerated.evaluateDependencies;
+  }
+});
+Object.defineProperty(exports, "expDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesExpGenerated.expDependencies;
+  }
+});
+Object.defineProperty(exports, "expm1Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesExpm1Generated.expm1Dependencies;
+  }
+});
+Object.defineProperty(exports, "expmDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesExpmGenerated.expmDependencies;
+  }
+});
+Object.defineProperty(exports, "factorialDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFactorialGenerated.factorialDependencies;
+  }
+});
+Object.defineProperty(exports, "falseDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFalseGenerated.falseDependencies;
+  }
+});
+Object.defineProperty(exports, "faradayDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFaradayGenerated.faradayDependencies;
+  }
+});
+Object.defineProperty(exports, "fermiCouplingDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFermiCouplingGenerated.fermiCouplingDependencies;
+  }
+});
+Object.defineProperty(exports, "fftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFftGenerated.fftDependencies;
+  }
+});
+Object.defineProperty(exports, "filterDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFilterGenerated.filterDependencies;
+  }
+});
+Object.defineProperty(exports, "filterTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFilterTransformGenerated.filterTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "fineStructureDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFineStructureGenerated.fineStructureDependencies;
+  }
+});
+Object.defineProperty(exports, "firstRadiationDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFirstRadiationGenerated.firstRadiationDependencies;
+  }
+});
+Object.defineProperty(exports, "fixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFixGenerated.fixDependencies;
+  }
+});
+Object.defineProperty(exports, "flattenDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFlattenGenerated.flattenDependencies;
+  }
+});
+Object.defineProperty(exports, "floorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFloorGenerated.floorDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesForEachGenerated.forEachDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesForEachTransformGenerated.forEachTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "formatDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFormatGenerated.formatDependencies;
+  }
+});
+Object.defineProperty(exports, "fractionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFractionGenerated.fractionDependencies;
+  }
+});
+Object.defineProperty(exports, "freqzDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFreqzGenerated.freqzDependencies;
+  }
+});
+Object.defineProperty(exports, "gammaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGammaGenerated.gammaDependencies;
+  }
+});
+Object.defineProperty(exports, "gasConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGasConstantGenerated.gasConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "gcdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGcdGenerated.gcdDependencies;
+  }
+});
+Object.defineProperty(exports, "getMatrixDataTypeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGetMatrixDataTypeGenerated.getMatrixDataTypeDependencies;
+  }
+});
+Object.defineProperty(exports, "gravitationConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGravitationConstantGenerated.gravitationConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "gravityDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGravityGenerated.gravityDependencies;
+  }
+});
+Object.defineProperty(exports, "hartreeEnergyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHartreeEnergyGenerated.hartreeEnergyDependencies;
+  }
+});
+Object.defineProperty(exports, "hasNumericValueDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHasNumericValueGenerated.hasNumericValueDependencies;
+  }
+});
+Object.defineProperty(exports, "helpDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHelpGenerated.helpDependencies;
+  }
+});
+Object.defineProperty(exports, "hexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHexGenerated.hexDependencies;
+  }
+});
+Object.defineProperty(exports, "hypotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHypotGenerated.hypotDependencies;
+  }
+});
+Object.defineProperty(exports, "iDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIGenerated.iDependencies;
+  }
+});
+Object.defineProperty(exports, "identityDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIdentityGenerated.identityDependencies;
+  }
+});
+Object.defineProperty(exports, "ifftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIfftGenerated.ifftDependencies;
+  }
+});
+Object.defineProperty(exports, "imDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesImGenerated.imDependencies;
+  }
+});
+Object.defineProperty(exports, "indexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexGenerated.indexDependencies;
+  }
+});
+Object.defineProperty(exports, "indexTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexTransformGenerated.indexTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "intersectDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIntersectGenerated.intersectDependencies;
+  }
+});
+Object.defineProperty(exports, "invDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesInvGenerated.invDependencies;
+  }
+});
+Object.defineProperty(exports, "inverseConductanceQuantumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesInverseConductanceQuantumGenerated.inverseConductanceQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "invmodDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesInvmodGenerated.invmodDependencies;
+  }
+});
+Object.defineProperty(exports, "isIntegerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsIntegerGenerated.isIntegerDependencies;
+  }
+});
+Object.defineProperty(exports, "isNaNDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNaNGenerated.isNaNDependencies;
+  }
+});
+Object.defineProperty(exports, "isNegativeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNegativeGenerated.isNegativeDependencies;
+  }
+});
+Object.defineProperty(exports, "isNumericDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNumericGenerated.isNumericDependencies;
+  }
+});
+Object.defineProperty(exports, "isPositiveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsPositiveGenerated.isPositiveDependencies;
+  }
+});
+Object.defineProperty(exports, "isPrimeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsPrimeGenerated.isPrimeDependencies;
+  }
+});
+Object.defineProperty(exports, "isZeroDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsZeroGenerated.isZeroDependencies;
+  }
+});
+Object.defineProperty(exports, "kldivergenceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesKldivergenceGenerated.kldivergenceDependencies;
+  }
+});
+Object.defineProperty(exports, "klitzingDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesKlitzingGenerated.klitzingDependencies;
+  }
+});
+Object.defineProperty(exports, "kronDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesKronGenerated.kronDependencies;
+  }
+});
+Object.defineProperty(exports, "largerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLargerGenerated.largerDependencies;
+  }
+});
+Object.defineProperty(exports, "largerEqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLargerEqGenerated.largerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "lcmDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLcmGenerated.lcmDependencies;
+  }
+});
+Object.defineProperty(exports, "leafCountDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLeafCountGenerated.leafCountDependencies;
+  }
+});
+Object.defineProperty(exports, "leftShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLeftShiftGenerated.leftShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "lgammaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLgammaGenerated.lgammaDependencies;
+  }
+});
+Object.defineProperty(exports, "log10Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog10Generated.log10Dependencies;
+  }
+});
+Object.defineProperty(exports, "log1pDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog1pGenerated.log1pDependencies;
+  }
+});
+Object.defineProperty(exports, "log2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog2Generated.log2Dependencies;
+  }
+});
+Object.defineProperty(exports, "logDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLogGenerated.logDependencies;
+  }
+});
+Object.defineProperty(exports, "loschmidtDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLoschmidtGenerated.loschmidtDependencies;
+  }
+});
+Object.defineProperty(exports, "lsolveAllDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLsolveAllGenerated.lsolveAllDependencies;
+  }
+});
+Object.defineProperty(exports, "lsolveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLsolveGenerated.lsolveDependencies;
+  }
+});
+Object.defineProperty(exports, "lupDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLupGenerated.lupDependencies;
+  }
+});
+Object.defineProperty(exports, "lusolveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLusolveGenerated.lusolveDependencies;
+  }
+});
+Object.defineProperty(exports, "lyapDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLyapGenerated.lyapDependencies;
+  }
+});
+Object.defineProperty(exports, "madDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMadGenerated.madDependencies;
+  }
+});
+Object.defineProperty(exports, "magneticConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMagneticConstantGenerated.magneticConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "magneticFluxQuantumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMagneticFluxQuantumGenerated.magneticFluxQuantumDependencies;
+  }
+});
+Object.defineProperty(exports, "mapDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapGenerated.mapDependencies;
+  }
+});
+Object.defineProperty(exports, "mapSlicesDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapSlicesGenerated.mapSlicesDependencies;
+  }
+});
+Object.defineProperty(exports, "mapSlicesTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapSlicesTransformGenerated.mapSlicesTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "mapTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapTransformGenerated.mapTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixGenerated.matrixDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromColumnsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromFunctionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixFromFunctionGenerated.matrixFromFunctionDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixFromRowsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixFromRowsGenerated.matrixFromRowsDependencies;
+  }
+});
+Object.defineProperty(exports, "maxDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMaxGenerated.maxDependencies;
+  }
+});
+Object.defineProperty(exports, "maxTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMaxTransformGenerated.maxTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "meanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMeanGenerated.meanDependencies;
+  }
+});
+Object.defineProperty(exports, "meanTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMeanTransformGenerated.meanTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "medianDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMedianGenerated.medianDependencies;
+  }
+});
+Object.defineProperty(exports, "minDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMinGenerated.minDependencies;
+  }
+});
+Object.defineProperty(exports, "minTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMinTransformGenerated.minTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "modDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesModGenerated.modDependencies;
+  }
+});
+Object.defineProperty(exports, "modeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesModeGenerated.modeDependencies;
+  }
+});
+Object.defineProperty(exports, "molarMassC12Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMolarMassC12Generated.molarMassC12Dependencies;
+  }
+});
+Object.defineProperty(exports, "molarMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMolarMassGenerated.molarMassDependencies;
+  }
+});
+Object.defineProperty(exports, "molarPlanckConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMolarPlanckConstantGenerated.molarPlanckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "molarVolumeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMolarVolumeGenerated.molarVolumeDependencies;
+  }
+});
+Object.defineProperty(exports, "multinomialDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultinomialGenerated.multinomialDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultiplyGenerated.multiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "neutronMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNeutronMassGenerated.neutronMassDependencies;
+  }
+});
+Object.defineProperty(exports, "normDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNormGenerated.normDependencies;
+  }
+});
+Object.defineProperty(exports, "notDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNotGenerated.notDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNthRootGenerated.nthRootDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNthRootsGenerated.nthRootsDependencies;
+  }
+});
+Object.defineProperty(exports, "nuclearMagnetonDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNuclearMagnetonGenerated.nuclearMagnetonDependencies;
+  }
+});
+Object.defineProperty(exports, "nullDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNullGenerated.nullDependencies;
+  }
+});
+Object.defineProperty(exports, "nullishDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNullishGenerated.nullishDependencies;
+  }
+});
+Object.defineProperty(exports, "nullishTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNullishTransformGenerated.nullishTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "numberDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNumberGenerated.numberDependencies;
+  }
+});
+Object.defineProperty(exports, "numericDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNumericGenerated.numericDependencies;
+  }
+});
+Object.defineProperty(exports, "octDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOctGenerated.octDependencies;
+  }
+});
+Object.defineProperty(exports, "onesDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOnesGenerated.onesDependencies;
+  }
+});
+Object.defineProperty(exports, "orDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOrGenerated.orDependencies;
+  }
+});
+Object.defineProperty(exports, "orTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOrTransformGenerated.orTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "parseDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParseGenerated.parseDependencies;
+  }
+});
+Object.defineProperty(exports, "parserDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParserGenerated.parserDependencies;
+  }
+});
+Object.defineProperty(exports, "partitionSelectDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPartitionSelectGenerated.partitionSelectDependencies;
+  }
+});
+Object.defineProperty(exports, "permutationsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPermutationsGenerated.permutationsDependencies;
+  }
+});
+Object.defineProperty(exports, "phiDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPhiGenerated.phiDependencies;
+  }
+});
+Object.defineProperty(exports, "piDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPiGenerated.piDependencies;
+  }
+});
+Object.defineProperty(exports, "pickRandomDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPickRandomGenerated.pickRandomDependencies;
+  }
+});
+Object.defineProperty(exports, "pinvDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPinvGenerated.pinvDependencies;
+  }
+});
+Object.defineProperty(exports, "planckChargeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckChargeGenerated.planckChargeDependencies;
+  }
+});
+Object.defineProperty(exports, "planckConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckConstantGenerated.planckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "planckLengthDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckLengthGenerated.planckLengthDependencies;
+  }
+});
+Object.defineProperty(exports, "planckMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckMassGenerated.planckMassDependencies;
+  }
+});
+Object.defineProperty(exports, "planckTemperatureDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckTemperatureGenerated.planckTemperatureDependencies;
+  }
+});
+Object.defineProperty(exports, "planckTimeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPlanckTimeGenerated.planckTimeDependencies;
+  }
+});
+Object.defineProperty(exports, "polynomialRootDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPolynomialRootGenerated.polynomialRootDependencies;
+  }
+});
+Object.defineProperty(exports, "powDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPowGenerated.powDependencies;
+  }
+});
+Object.defineProperty(exports, "printDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPrintGenerated.printDependencies;
+  }
+});
+Object.defineProperty(exports, "printTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPrintTransformGenerated.printTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "prodDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesProdGenerated.prodDependencies;
+  }
+});
+Object.defineProperty(exports, "protonMassDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesProtonMassGenerated.protonMassDependencies;
+  }
+});
+Object.defineProperty(exports, "qrDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesQrGenerated.qrDependencies;
+  }
+});
+Object.defineProperty(exports, "quantileSeqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesQuantileSeqGenerated.quantileSeqDependencies;
+  }
+});
+Object.defineProperty(exports, "quantileSeqTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesQuantileSeqTransformGenerated.quantileSeqTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "quantumOfCirculationDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesQuantumOfCirculationGenerated.quantumOfCirculationDependencies;
+  }
+});
+Object.defineProperty(exports, "randomDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRandomGenerated.randomDependencies;
+  }
+});
+Object.defineProperty(exports, "randomIntDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRandomIntGenerated.randomIntDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeGenerated.rangeDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeTransformGenerated.rangeTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rationalizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRationalizeGenerated.rationalizeDependencies;
+  }
+});
+Object.defineProperty(exports, "reDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReGenerated.reDependencies;
+  }
+});
+Object.defineProperty(exports, "reducedPlanckConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReducedPlanckConstantGenerated.reducedPlanckConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "replacerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReplacerGenerated.replacerDependencies;
+  }
+});
+Object.defineProperty(exports, "reshapeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReshapeGenerated.reshapeDependencies;
+  }
+});
+Object.defineProperty(exports, "resizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesResizeGenerated.resizeDependencies;
+  }
+});
+Object.defineProperty(exports, "resolveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesResolveGenerated.resolveDependencies;
+  }
+});
+Object.defineProperty(exports, "reviverDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReviverGenerated.reviverDependencies;
+  }
+});
+Object.defineProperty(exports, "rightArithShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRightArithShiftGenerated.rightArithShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rightLogShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRightLogShiftGenerated.rightLogShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rotateDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRotateGenerated.rotateDependencies;
+  }
+});
+Object.defineProperty(exports, "rotationMatrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRotationMatrixGenerated.rotationMatrixDependencies;
+  }
+});
+Object.defineProperty(exports, "roundDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRoundGenerated.roundDependencies;
+  }
+});
+Object.defineProperty(exports, "rowDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRowGenerated.rowDependencies;
+  }
+});
+Object.defineProperty(exports, "rowTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRowTransformGenerated.rowTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rydbergDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRydbergGenerated.rydbergDependencies;
+  }
+});
+Object.defineProperty(exports, "sackurTetrodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSackurTetrodeGenerated.sackurTetrodeDependencies;
+  }
+});
+Object.defineProperty(exports, "schurDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSchurGenerated.schurDependencies;
+  }
+});
+Object.defineProperty(exports, "secDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSecGenerated.secDependencies;
+  }
+});
+Object.defineProperty(exports, "sechDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSechGenerated.sechDependencies;
+  }
+});
+Object.defineProperty(exports, "secondRadiationDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSecondRadiationGenerated.secondRadiationDependencies;
+  }
+});
+Object.defineProperty(exports, "setCartesianDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetCartesianGenerated.setCartesianDependencies;
+  }
+});
+Object.defineProperty(exports, "setDifferenceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetDifferenceGenerated.setDifferenceDependencies;
+  }
+});
+Object.defineProperty(exports, "setDistinctDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetDistinctGenerated.setDistinctDependencies;
+  }
+});
+Object.defineProperty(exports, "setIntersectDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetIntersectGenerated.setIntersectDependencies;
+  }
+});
+Object.defineProperty(exports, "setIsSubsetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetIsSubsetGenerated.setIsSubsetDependencies;
+  }
+});
+Object.defineProperty(exports, "setMultiplicityDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetMultiplicityGenerated.setMultiplicityDependencies;
+  }
+});
+Object.defineProperty(exports, "setPowersetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetPowersetGenerated.setPowersetDependencies;
+  }
+});
+Object.defineProperty(exports, "setSizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetSizeGenerated.setSizeDependencies;
+  }
+});
+Object.defineProperty(exports, "setSymDifferenceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies;
+  }
+});
+Object.defineProperty(exports, "setUnionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSetUnionGenerated.setUnionDependencies;
+  }
+});
+Object.defineProperty(exports, "signDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSignGenerated.signDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyCoreDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyGenerated.simplifyDependencies;
+  }
+});
+Object.defineProperty(exports, "sinDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSinGenerated.sinDependencies;
+  }
+});
+Object.defineProperty(exports, "sinhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSinhGenerated.sinhDependencies;
+  }
+});
+Object.defineProperty(exports, "sizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSizeGenerated.sizeDependencies;
+  }
+});
+Object.defineProperty(exports, "sluDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSluGenerated.sluDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSmallerGenerated.smallerDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerEqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSmallerEqGenerated.smallerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "solveODEDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSolveODEGenerated.solveODEDependencies;
+  }
+});
+Object.defineProperty(exports, "sortDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSortGenerated.sortDependencies;
+  }
+});
+Object.defineProperty(exports, "sparseDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSparseGenerated.sparseDependencies;
+  }
+});
+Object.defineProperty(exports, "speedOfLightDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSpeedOfLightGenerated.speedOfLightDependencies;
+  }
+});
+Object.defineProperty(exports, "splitUnitDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSplitUnitGenerated.splitUnitDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSqrtGenerated.sqrtDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtmDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSqrtmGenerated.sqrtmDependencies;
+  }
+});
+Object.defineProperty(exports, "squareDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSquareGenerated.squareDependencies;
+  }
+});
+Object.defineProperty(exports, "squeezeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSqueezeGenerated.squeezeDependencies;
+  }
+});
+Object.defineProperty(exports, "stdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStdGenerated.stdDependencies;
+  }
+});
+Object.defineProperty(exports, "stdTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStdTransformGenerated.stdTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "stefanBoltzmannDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStefanBoltzmannGenerated.stefanBoltzmannDependencies;
+  }
+});
+Object.defineProperty(exports, "stirlingS2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStirlingS2Generated.stirlingS2Dependencies;
+  }
+});
+Object.defineProperty(exports, "stringDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStringGenerated.stringDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubsetGenerated.subsetDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubsetTransformGenerated.subsetTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubtractGenerated.subtractDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubtractScalarGenerated.subtractScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "sumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSumGenerated.sumDependencies;
+  }
+});
+Object.defineProperty(exports, "sumTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSumTransformGenerated.sumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "sylvesterDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSylvesterGenerated.sylvesterDependencies;
+  }
+});
+Object.defineProperty(exports, "symbolicEqualDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSymbolicEqualGenerated.symbolicEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "tanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTanGenerated.tanDependencies;
+  }
+});
+Object.defineProperty(exports, "tanhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTanhGenerated.tanhDependencies;
+  }
+});
+Object.defineProperty(exports, "tauDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTauGenerated.tauDependencies;
+  }
+});
+Object.defineProperty(exports, "thomsonCrossSectionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesThomsonCrossSectionGenerated.thomsonCrossSectionDependencies;
+  }
+});
+Object.defineProperty(exports, "toBestDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesToBestGenerated.toBestDependencies;
+  }
+});
+Object.defineProperty(exports, "toDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesToGenerated.toDependencies;
+  }
+});
+Object.defineProperty(exports, "traceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTraceGenerated.traceDependencies;
+  }
+});
+Object.defineProperty(exports, "transposeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTransposeGenerated.transposeDependencies;
+  }
+});
+Object.defineProperty(exports, "trueDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTrueGenerated.trueDependencies;
+  }
+});
+Object.defineProperty(exports, "typeOfDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTypeOfGenerated.typeOfDependencies;
+  }
+});
+Object.defineProperty(exports, "typedDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTypedGenerated.typedDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryMinusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnaryMinusGenerated.unaryMinusDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryPlusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnaryPlusGenerated.unaryPlusDependencies;
+  }
+});
+Object.defineProperty(exports, "unequalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnequalGenerated.unequalDependencies;
+  }
+});
+Object.defineProperty(exports, "unitDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnitFunctionGenerated.unitDependencies;
+  }
+});
+Object.defineProperty(exports, "usolveAllDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUsolveAllGenerated.usolveAllDependencies;
+  }
+});
+Object.defineProperty(exports, "usolveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUsolveGenerated.usolveDependencies;
+  }
+});
+Object.defineProperty(exports, "vacuumImpedanceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVacuumImpedanceGenerated.vacuumImpedanceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVarianceGenerated.varianceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVarianceTransformGenerated.varianceTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "versionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVersionGenerated.versionDependencies;
+  }
+});
+Object.defineProperty(exports, "weakMixingAngleDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesWeakMixingAngleGenerated.weakMixingAngleDependencies;
+  }
+});
+Object.defineProperty(exports, "wienDisplacementDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesWienDisplacementGenerated.wienDisplacementDependencies;
+  }
+});
+Object.defineProperty(exports, "xgcdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesXgcdGenerated.xgcdDependencies;
+  }
+});
+Object.defineProperty(exports, "xorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesXorGenerated.xorDependencies;
+  }
+});
+Object.defineProperty(exports, "zerosDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesZerosGenerated.zerosDependencies;
+  }
+});
+Object.defineProperty(exports, "zetaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesZetaGenerated.zetaDependencies;
+  }
+});
+Object.defineProperty(exports, "zpk2tfDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesZpk2tfGenerated.zpk2tfDependencies;
+  }
+});
+var _dependenciesAbsGenerated = require("./dependenciesAny/dependenciesAbs.generated.js");
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAny/dependenciesAccessorNode.generated.js");
+var _dependenciesAcosGenerated = require("./dependenciesAny/dependenciesAcos.generated.js");
+var _dependenciesAcoshGenerated = require("./dependenciesAny/dependenciesAcosh.generated.js");
+var _dependenciesAcotGenerated = require("./dependenciesAny/dependenciesAcot.generated.js");
+var _dependenciesAcothGenerated = require("./dependenciesAny/dependenciesAcoth.generated.js");
+var _dependenciesAcscGenerated = require("./dependenciesAny/dependenciesAcsc.generated.js");
+var _dependenciesAcschGenerated = require("./dependenciesAny/dependenciesAcsch.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAny/dependenciesAdd.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAny/dependenciesAddScalar.generated.js");
+var _dependenciesAndGenerated = require("./dependenciesAny/dependenciesAnd.generated.js");
+var _dependenciesAndTransformGenerated = require("./dependenciesAny/dependenciesAndTransform.generated.js");
+var _dependenciesArgGenerated = require("./dependenciesAny/dependenciesArg.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesAny/dependenciesArrayNode.generated.js");
+var _dependenciesAsecGenerated = require("./dependenciesAny/dependenciesAsec.generated.js");
+var _dependenciesAsechGenerated = require("./dependenciesAny/dependenciesAsech.generated.js");
+var _dependenciesAsinGenerated = require("./dependenciesAny/dependenciesAsin.generated.js");
+var _dependenciesAsinhGenerated = require("./dependenciesAny/dependenciesAsinh.generated.js");
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAny/dependenciesAssignmentNode.generated.js");
+var _dependenciesAtanGenerated = require("./dependenciesAny/dependenciesAtan.generated.js");
+var _dependenciesAtan2Generated = require("./dependenciesAny/dependenciesAtan2.generated.js");
+var _dependenciesAtanhGenerated = require("./dependenciesAny/dependenciesAtanh.generated.js");
+var _dependenciesAtomicMassGenerated = require("./dependenciesAny/dependenciesAtomicMass.generated.js");
+var _dependenciesAvogadroGenerated = require("./dependenciesAny/dependenciesAvogadro.generated.js");
+var _dependenciesBellNumbersGenerated = require("./dependenciesAny/dependenciesBellNumbers.generated.js");
+var _dependenciesBigNumberClassGenerated = require("./dependenciesAny/dependenciesBigNumberClass.generated.js");
+var _dependenciesBigintGenerated = require("./dependenciesAny/dependenciesBigint.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesAny/dependenciesBignumber.generated.js");
+var _dependenciesBinGenerated = require("./dependenciesAny/dependenciesBin.generated.js");
+var _dependenciesBitAndGenerated = require("./dependenciesAny/dependenciesBitAnd.generated.js");
+var _dependenciesBitAndTransformGenerated = require("./dependenciesAny/dependenciesBitAndTransform.generated.js");
+var _dependenciesBitNotGenerated = require("./dependenciesAny/dependenciesBitNot.generated.js");
+var _dependenciesBitOrGenerated = require("./dependenciesAny/dependenciesBitOr.generated.js");
+var _dependenciesBitOrTransformGenerated = require("./dependenciesAny/dependenciesBitOrTransform.generated.js");
+var _dependenciesBitXorGenerated = require("./dependenciesAny/dependenciesBitXor.generated.js");
+var _dependenciesBlockNodeGenerated = require("./dependenciesAny/dependenciesBlockNode.generated.js");
+var _dependenciesBohrMagnetonGenerated = require("./dependenciesAny/dependenciesBohrMagneton.generated.js");
+var _dependenciesBohrRadiusGenerated = require("./dependenciesAny/dependenciesBohrRadius.generated.js");
+var _dependenciesBoltzmannGenerated = require("./dependenciesAny/dependenciesBoltzmann.generated.js");
+var _dependenciesBooleanGenerated = require("./dependenciesAny/dependenciesBoolean.generated.js");
+var _dependenciesCatalanGenerated = require("./dependenciesAny/dependenciesCatalan.generated.js");
+var _dependenciesCbrtGenerated = require("./dependenciesAny/dependenciesCbrt.generated.js");
+var _dependenciesCeilGenerated = require("./dependenciesAny/dependenciesCeil.generated.js");
+var _dependenciesChainGenerated = require("./dependenciesAny/dependenciesChain.generated.js");
+var _dependenciesChainClassGenerated = require("./dependenciesAny/dependenciesChainClass.generated.js");
+var _dependenciesClassicalElectronRadiusGenerated = require("./dependenciesAny/dependenciesClassicalElectronRadius.generated.js");
+var _dependenciesCloneGenerated = require("./dependenciesAny/dependenciesClone.generated.js");
+var _dependenciesColumnGenerated = require("./dependenciesAny/dependenciesColumn.generated.js");
+var _dependenciesColumnTransformGenerated = require("./dependenciesAny/dependenciesColumnTransform.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesAny/dependenciesCombinations.generated.js");
+var _dependenciesCombinationsWithRepGenerated = require("./dependenciesAny/dependenciesCombinationsWithRep.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesAny/dependenciesCompare.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesAny/dependenciesCompareNatural.generated.js");
+var _dependenciesCompareTextGenerated = require("./dependenciesAny/dependenciesCompareText.generated.js");
+var _dependenciesCompileGenerated = require("./dependenciesAny/dependenciesCompile.generated.js");
+var _dependenciesComplexGenerated = require("./dependenciesAny/dependenciesComplex.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesAny/dependenciesComplexClass.generated.js");
+var _dependenciesCompositionGenerated = require("./dependenciesAny/dependenciesComposition.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesAny/dependenciesConcat.generated.js");
+var _dependenciesConcatTransformGenerated = require("./dependenciesAny/dependenciesConcatTransform.generated.js");
+var _dependenciesConditionalNodeGenerated = require("./dependenciesAny/dependenciesConditionalNode.generated.js");
+var _dependenciesConductanceQuantumGenerated = require("./dependenciesAny/dependenciesConductanceQuantum.generated.js");
+var _dependenciesConjGenerated = require("./dependenciesAny/dependenciesConj.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesAny/dependenciesConstantNode.generated.js");
+var _dependenciesCorrGenerated = require("./dependenciesAny/dependenciesCorr.generated.js");
+var _dependenciesCosGenerated = require("./dependenciesAny/dependenciesCos.generated.js");
+var _dependenciesCoshGenerated = require("./dependenciesAny/dependenciesCosh.generated.js");
+var _dependenciesCotGenerated = require("./dependenciesAny/dependenciesCot.generated.js");
+var _dependenciesCothGenerated = require("./dependenciesAny/dependenciesCoth.generated.js");
+var _dependenciesCoulombGenerated = require("./dependenciesAny/dependenciesCoulomb.generated.js");
+var _dependenciesCoulombConstantGenerated = require("./dependenciesAny/dependenciesCoulombConstant.generated.js");
+var _dependenciesCountGenerated = require("./dependenciesAny/dependenciesCount.generated.js");
+var _dependenciesCreateUnitGenerated = require("./dependenciesAny/dependenciesCreateUnit.generated.js");
+var _dependenciesCrossGenerated = require("./dependenciesAny/dependenciesCross.generated.js");
+var _dependenciesCscGenerated = require("./dependenciesAny/dependenciesCsc.generated.js");
+var _dependenciesCschGenerated = require("./dependenciesAny/dependenciesCsch.generated.js");
+var _dependenciesCtransposeGenerated = require("./dependenciesAny/dependenciesCtranspose.generated.js");
+var _dependenciesCubeGenerated = require("./dependenciesAny/dependenciesCube.generated.js");
+var _dependenciesCumSumGenerated = require("./dependenciesAny/dependenciesCumSum.generated.js");
+var _dependenciesCumSumTransformGenerated = require("./dependenciesAny/dependenciesCumSumTransform.generated.js");
+var _dependenciesDeepEqualGenerated = require("./dependenciesAny/dependenciesDeepEqual.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesAny/dependenciesDenseMatrixClass.generated.js");
+var _dependenciesDerivativeGenerated = require("./dependenciesAny/dependenciesDerivative.generated.js");
+var _dependenciesDetGenerated = require("./dependenciesAny/dependenciesDet.generated.js");
+var _dependenciesDeuteronMassGenerated = require("./dependenciesAny/dependenciesDeuteronMass.generated.js");
+var _dependenciesDiagGenerated = require("./dependenciesAny/dependenciesDiag.generated.js");
+var _dependenciesDiffGenerated = require("./dependenciesAny/dependenciesDiff.generated.js");
+var _dependenciesDiffTransformGenerated = require("./dependenciesAny/dependenciesDiffTransform.generated.js");
+var _dependenciesDistanceGenerated = require("./dependenciesAny/dependenciesDistance.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesAny/dependenciesDivide.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesAny/dependenciesDivideScalar.generated.js");
+var _dependenciesDotGenerated = require("./dependenciesAny/dependenciesDot.generated.js");
+var _dependenciesDotDivideGenerated = require("./dependenciesAny/dependenciesDotDivide.generated.js");
+var _dependenciesDotMultiplyGenerated = require("./dependenciesAny/dependenciesDotMultiply.generated.js");
+var _dependenciesDotPowGenerated = require("./dependenciesAny/dependenciesDotPow.generated.js");
+var _dependenciesEGenerated = require("./dependenciesAny/dependenciesE.generated.js");
+var _dependenciesEfimovFactorGenerated = require("./dependenciesAny/dependenciesEfimovFactor.generated.js");
+var _dependenciesEigsGenerated = require("./dependenciesAny/dependenciesEigs.generated.js");
+var _dependenciesElectricConstantGenerated = require("./dependenciesAny/dependenciesElectricConstant.generated.js");
+var _dependenciesElectronMassGenerated = require("./dependenciesAny/dependenciesElectronMass.generated.js");
+var _dependenciesElementaryChargeGenerated = require("./dependenciesAny/dependenciesElementaryCharge.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesAny/dependenciesEqual.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesAny/dependenciesEqualScalar.generated.js");
+var _dependenciesEqualTextGenerated = require("./dependenciesAny/dependenciesEqualText.generated.js");
+var _dependenciesErfGenerated = require("./dependenciesAny/dependenciesErf.generated.js");
+var _dependenciesEvaluateGenerated = require("./dependenciesAny/dependenciesEvaluate.generated.js");
+var _dependenciesExpGenerated = require("./dependenciesAny/dependenciesExp.generated.js");
+var _dependenciesExpmGenerated = require("./dependenciesAny/dependenciesExpm.generated.js");
+var _dependenciesExpm1Generated = require("./dependenciesAny/dependenciesExpm1.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesAny/dependenciesFactorial.generated.js");
+var _dependenciesFalseGenerated = require("./dependenciesAny/dependenciesFalse.generated.js");
+var _dependenciesFaradayGenerated = require("./dependenciesAny/dependenciesFaraday.generated.js");
+var _dependenciesFermiCouplingGenerated = require("./dependenciesAny/dependenciesFermiCoupling.generated.js");
+var _dependenciesFftGenerated = require("./dependenciesAny/dependenciesFft.generated.js");
+var _dependenciesFibonacciHeapClassGenerated = require("./dependenciesAny/dependenciesFibonacciHeapClass.generated.js");
+var _dependenciesFilterGenerated = require("./dependenciesAny/dependenciesFilter.generated.js");
+var _dependenciesFilterTransformGenerated = require("./dependenciesAny/dependenciesFilterTransform.generated.js");
+var _dependenciesFineStructureGenerated = require("./dependenciesAny/dependenciesFineStructure.generated.js");
+var _dependenciesFirstRadiationGenerated = require("./dependenciesAny/dependenciesFirstRadiation.generated.js");
+var _dependenciesFixGenerated = require("./dependenciesAny/dependenciesFix.generated.js");
+var _dependenciesFlattenGenerated = require("./dependenciesAny/dependenciesFlatten.generated.js");
+var _dependenciesFloorGenerated = require("./dependenciesAny/dependenciesFloor.generated.js");
+var _dependenciesForEachGenerated = require("./dependenciesAny/dependenciesForEach.generated.js");
+var _dependenciesForEachTransformGenerated = require("./dependenciesAny/dependenciesForEachTransform.generated.js");
+var _dependenciesFormatGenerated = require("./dependenciesAny/dependenciesFormat.generated.js");
+var _dependenciesFractionGenerated = require("./dependenciesAny/dependenciesFraction.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesAny/dependenciesFractionClass.generated.js");
+var _dependenciesFreqzGenerated = require("./dependenciesAny/dependenciesFreqz.generated.js");
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesAny/dependenciesFunctionAssignmentNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesAny/dependenciesFunctionNode.generated.js");
+var _dependenciesGammaGenerated = require("./dependenciesAny/dependenciesGamma.generated.js");
+var _dependenciesGasConstantGenerated = require("./dependenciesAny/dependenciesGasConstant.generated.js");
+var _dependenciesGcdGenerated = require("./dependenciesAny/dependenciesGcd.generated.js");
+var _dependenciesGetMatrixDataTypeGenerated = require("./dependenciesAny/dependenciesGetMatrixDataType.generated.js");
+var _dependenciesGravitationConstantGenerated = require("./dependenciesAny/dependenciesGravitationConstant.generated.js");
+var _dependenciesGravityGenerated = require("./dependenciesAny/dependenciesGravity.generated.js");
+var _dependenciesHartreeEnergyGenerated = require("./dependenciesAny/dependenciesHartreeEnergy.generated.js");
+var _dependenciesHasNumericValueGenerated = require("./dependenciesAny/dependenciesHasNumericValue.generated.js");
+var _dependenciesHelpGenerated = require("./dependenciesAny/dependenciesHelp.generated.js");
+var _dependenciesHelpClassGenerated = require("./dependenciesAny/dependenciesHelpClass.generated.js");
+var _dependenciesHexGenerated = require("./dependenciesAny/dependenciesHex.generated.js");
+var _dependenciesHypotGenerated = require("./dependenciesAny/dependenciesHypot.generated.js");
+var _dependenciesIGenerated = require("./dependenciesAny/dependenciesI.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesAny/dependenciesIdentity.generated.js");
+var _dependenciesIfftGenerated = require("./dependenciesAny/dependenciesIfft.generated.js");
+var _dependenciesImGenerated = require("./dependenciesAny/dependenciesIm.generated.js");
+var _dependenciesImmutableDenseMatrixClassGenerated = require("./dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js");
+var _dependenciesIndexGenerated = require("./dependenciesAny/dependenciesIndex.generated.js");
+var _dependenciesIndexClassGenerated = require("./dependenciesAny/dependenciesIndexClass.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesAny/dependenciesIndexNode.generated.js");
+var _dependenciesIndexTransformGenerated = require("./dependenciesAny/dependenciesIndexTransform.generated.js");
+var _dependenciesInfinityGenerated = require("./dependenciesAny/dependenciesInfinity.generated.js");
+var _dependenciesIntersectGenerated = require("./dependenciesAny/dependenciesIntersect.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesAny/dependenciesInv.generated.js");
+var _dependenciesInverseConductanceQuantumGenerated = require("./dependenciesAny/dependenciesInverseConductanceQuantum.generated.js");
+var _dependenciesInvmodGenerated = require("./dependenciesAny/dependenciesInvmod.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesAny/dependenciesIsInteger.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesAny/dependenciesIsNaN.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesAny/dependenciesIsNegative.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesAny/dependenciesIsNumeric.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesAny/dependenciesIsPositive.generated.js");
+var _dependenciesIsPrimeGenerated = require("./dependenciesAny/dependenciesIsPrime.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesAny/dependenciesIsZero.generated.js");
+var _dependenciesKldivergenceGenerated = require("./dependenciesAny/dependenciesKldivergence.generated.js");
+var _dependenciesKlitzingGenerated = require("./dependenciesAny/dependenciesKlitzing.generated.js");
+var _dependenciesKronGenerated = require("./dependenciesAny/dependenciesKron.generated.js");
+var _dependenciesLN10Generated = require("./dependenciesAny/dependenciesLN10.generated.js");
+var _dependenciesLN2Generated = require("./dependenciesAny/dependenciesLN2.generated.js");
+var _dependenciesLOG10EGenerated = require("./dependenciesAny/dependenciesLOG10E.generated.js");
+var _dependenciesLOG2EGenerated = require("./dependenciesAny/dependenciesLOG2E.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesAny/dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesAny/dependenciesLargerEq.generated.js");
+var _dependenciesLcmGenerated = require("./dependenciesAny/dependenciesLcm.generated.js");
+var _dependenciesLeafCountGenerated = require("./dependenciesAny/dependenciesLeafCount.generated.js");
+var _dependenciesLeftShiftGenerated = require("./dependenciesAny/dependenciesLeftShift.generated.js");
+var _dependenciesLgammaGenerated = require("./dependenciesAny/dependenciesLgamma.generated.js");
+var _dependenciesLogGenerated = require("./dependenciesAny/dependenciesLog.generated.js");
+var _dependenciesLog10Generated = require("./dependenciesAny/dependenciesLog10.generated.js");
+var _dependenciesLog1pGenerated = require("./dependenciesAny/dependenciesLog1p.generated.js");
+var _dependenciesLog2Generated = require("./dependenciesAny/dependenciesLog2.generated.js");
+var _dependenciesLoschmidtGenerated = require("./dependenciesAny/dependenciesLoschmidt.generated.js");
+var _dependenciesLsolveGenerated = require("./dependenciesAny/dependenciesLsolve.generated.js");
+var _dependenciesLsolveAllGenerated = require("./dependenciesAny/dependenciesLsolveAll.generated.js");
+var _dependenciesLupGenerated = require("./dependenciesAny/dependenciesLup.generated.js");
+var _dependenciesLusolveGenerated = require("./dependenciesAny/dependenciesLusolve.generated.js");
+var _dependenciesLyapGenerated = require("./dependenciesAny/dependenciesLyap.generated.js");
+var _dependenciesMadGenerated = require("./dependenciesAny/dependenciesMad.generated.js");
+var _dependenciesMagneticConstantGenerated = require("./dependenciesAny/dependenciesMagneticConstant.generated.js");
+var _dependenciesMagneticFluxQuantumGenerated = require("./dependenciesAny/dependenciesMagneticFluxQuantum.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesAny/dependenciesMap.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesAny/dependenciesMapSlices.generated.js");
+var _dependenciesMapSlicesTransformGenerated = require("./dependenciesAny/dependenciesMapSlicesTransform.generated.js");
+var _dependenciesMapTransformGenerated = require("./dependenciesAny/dependenciesMapTransform.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesAny/dependenciesMatrix.generated.js");
+var _dependenciesMatrixClassGenerated = require("./dependenciesAny/dependenciesMatrixClass.generated.js");
+var _dependenciesMatrixFromColumnsGenerated = require("./dependenciesAny/dependenciesMatrixFromColumns.generated.js");
+var _dependenciesMatrixFromFunctionGenerated = require("./dependenciesAny/dependenciesMatrixFromFunction.generated.js");
+var _dependenciesMatrixFromRowsGenerated = require("./dependenciesAny/dependenciesMatrixFromRows.generated.js");
+var _dependenciesMaxGenerated = require("./dependenciesAny/dependenciesMax.generated.js");
+var _dependenciesMaxTransformGenerated = require("./dependenciesAny/dependenciesMaxTransform.generated.js");
+var _dependenciesMeanGenerated = require("./dependenciesAny/dependenciesMean.generated.js");
+var _dependenciesMeanTransformGenerated = require("./dependenciesAny/dependenciesMeanTransform.generated.js");
+var _dependenciesMedianGenerated = require("./dependenciesAny/dependenciesMedian.generated.js");
+var _dependenciesMinGenerated = require("./dependenciesAny/dependenciesMin.generated.js");
+var _dependenciesMinTransformGenerated = require("./dependenciesAny/dependenciesMinTransform.generated.js");
+var _dependenciesModGenerated = require("./dependenciesAny/dependenciesMod.generated.js");
+var _dependenciesModeGenerated = require("./dependenciesAny/dependenciesMode.generated.js");
+var _dependenciesMolarMassGenerated = require("./dependenciesAny/dependenciesMolarMass.generated.js");
+var _dependenciesMolarMassC12Generated = require("./dependenciesAny/dependenciesMolarMassC12.generated.js");
+var _dependenciesMolarPlanckConstantGenerated = require("./dependenciesAny/dependenciesMolarPlanckConstant.generated.js");
+var _dependenciesMolarVolumeGenerated = require("./dependenciesAny/dependenciesMolarVolume.generated.js");
+var _dependenciesMultinomialGenerated = require("./dependenciesAny/dependenciesMultinomial.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesAny/dependenciesMultiply.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesAny/dependenciesMultiplyScalar.generated.js");
+var _dependenciesNaNGenerated = require("./dependenciesAny/dependenciesNaN.generated.js");
+var _dependenciesNeutronMassGenerated = require("./dependenciesAny/dependenciesNeutronMass.generated.js");
+var _dependenciesNodeGenerated = require("./dependenciesAny/dependenciesNode.generated.js");
+var _dependenciesNormGenerated = require("./dependenciesAny/dependenciesNorm.generated.js");
+var _dependenciesNotGenerated = require("./dependenciesAny/dependenciesNot.generated.js");
+var _dependenciesNthRootGenerated = require("./dependenciesAny/dependenciesNthRoot.generated.js");
+var _dependenciesNthRootsGenerated = require("./dependenciesAny/dependenciesNthRoots.generated.js");
+var _dependenciesNuclearMagnetonGenerated = require("./dependenciesAny/dependenciesNuclearMagneton.generated.js");
+var _dependenciesNullGenerated = require("./dependenciesAny/dependenciesNull.generated.js");
+var _dependenciesNullishGenerated = require("./dependenciesAny/dependenciesNullish.generated.js");
+var _dependenciesNullishTransformGenerated = require("./dependenciesAny/dependenciesNullishTransform.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesAny/dependenciesNumber.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesAny/dependenciesNumeric.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesAny/dependenciesObjectNode.generated.js");
+var _dependenciesOctGenerated = require("./dependenciesAny/dependenciesOct.generated.js");
+var _dependenciesOnesGenerated = require("./dependenciesAny/dependenciesOnes.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesAny/dependenciesOperatorNode.generated.js");
+var _dependenciesOrGenerated = require("./dependenciesAny/dependenciesOr.generated.js");
+var _dependenciesOrTransformGenerated = require("./dependenciesAny/dependenciesOrTransform.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesAny/dependenciesParenthesisNode.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesAny/dependenciesParse.generated.js");
+var _dependenciesParserGenerated = require("./dependenciesAny/dependenciesParser.generated.js");
+var _dependenciesParserClassGenerated = require("./dependenciesAny/dependenciesParserClass.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesAny/dependenciesPartitionSelect.generated.js");
+var _dependenciesPermutationsGenerated = require("./dependenciesAny/dependenciesPermutations.generated.js");
+var _dependenciesPhiGenerated = require("./dependenciesAny/dependenciesPhi.generated.js");
+var _dependenciesPiGenerated = require("./dependenciesAny/dependenciesPi.generated.js");
+var _dependenciesPickRandomGenerated = require("./dependenciesAny/dependenciesPickRandom.generated.js");
+var _dependenciesPinvGenerated = require("./dependenciesAny/dependenciesPinv.generated.js");
+var _dependenciesPlanckChargeGenerated = require("./dependenciesAny/dependenciesPlanckCharge.generated.js");
+var _dependenciesPlanckConstantGenerated = require("./dependenciesAny/dependenciesPlanckConstant.generated.js");
+var _dependenciesPlanckLengthGenerated = require("./dependenciesAny/dependenciesPlanckLength.generated.js");
+var _dependenciesPlanckMassGenerated = require("./dependenciesAny/dependenciesPlanckMass.generated.js");
+var _dependenciesPlanckTemperatureGenerated = require("./dependenciesAny/dependenciesPlanckTemperature.generated.js");
+var _dependenciesPlanckTimeGenerated = require("./dependenciesAny/dependenciesPlanckTime.generated.js");
+var _dependenciesPolynomialRootGenerated = require("./dependenciesAny/dependenciesPolynomialRoot.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesAny/dependenciesPow.generated.js");
+var _dependenciesPrintGenerated = require("./dependenciesAny/dependenciesPrint.generated.js");
+var _dependenciesPrintTransformGenerated = require("./dependenciesAny/dependenciesPrintTransform.generated.js");
+var _dependenciesProdGenerated = require("./dependenciesAny/dependenciesProd.generated.js");
+var _dependenciesProtonMassGenerated = require("./dependenciesAny/dependenciesProtonMass.generated.js");
+var _dependenciesQrGenerated = require("./dependenciesAny/dependenciesQr.generated.js");
+var _dependenciesQuantileSeqGenerated = require("./dependenciesAny/dependenciesQuantileSeq.generated.js");
+var _dependenciesQuantileSeqTransformGenerated = require("./dependenciesAny/dependenciesQuantileSeqTransform.generated.js");
+var _dependenciesQuantumOfCirculationGenerated = require("./dependenciesAny/dependenciesQuantumOfCirculation.generated.js");
+var _dependenciesRandomGenerated = require("./dependenciesAny/dependenciesRandom.generated.js");
+var _dependenciesRandomIntGenerated = require("./dependenciesAny/dependenciesRandomInt.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesAny/dependenciesRange.generated.js");
+var _dependenciesRangeClassGenerated = require("./dependenciesAny/dependenciesRangeClass.generated.js");
+var _dependenciesRangeNodeGenerated = require("./dependenciesAny/dependenciesRangeNode.generated.js");
+var _dependenciesRangeTransformGenerated = require("./dependenciesAny/dependenciesRangeTransform.generated.js");
+var _dependenciesRationalizeGenerated = require("./dependenciesAny/dependenciesRationalize.generated.js");
+var _dependenciesReGenerated = require("./dependenciesAny/dependenciesRe.generated.js");
+var _dependenciesReducedPlanckConstantGenerated = require("./dependenciesAny/dependenciesReducedPlanckConstant.generated.js");
+var _dependenciesRelationalNodeGenerated = require("./dependenciesAny/dependenciesRelationalNode.generated.js");
+var _dependenciesReplacerGenerated = require("./dependenciesAny/dependenciesReplacer.generated.js");
+var _dependenciesReshapeGenerated = require("./dependenciesAny/dependenciesReshape.generated.js");
+var _dependenciesResizeGenerated = require("./dependenciesAny/dependenciesResize.generated.js");
+var _dependenciesResolveGenerated = require("./dependenciesAny/dependenciesResolve.generated.js");
+var _dependenciesResultSetGenerated = require("./dependenciesAny/dependenciesResultSet.generated.js");
+var _dependenciesReviverGenerated = require("./dependenciesAny/dependenciesReviver.generated.js");
+var _dependenciesRightArithShiftGenerated = require("./dependenciesAny/dependenciesRightArithShift.generated.js");
+var _dependenciesRightLogShiftGenerated = require("./dependenciesAny/dependenciesRightLogShift.generated.js");
+var _dependenciesRotateGenerated = require("./dependenciesAny/dependenciesRotate.generated.js");
+var _dependenciesRotationMatrixGenerated = require("./dependenciesAny/dependenciesRotationMatrix.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesAny/dependenciesRound.generated.js");
+var _dependenciesRowGenerated = require("./dependenciesAny/dependenciesRow.generated.js");
+var _dependenciesRowTransformGenerated = require("./dependenciesAny/dependenciesRowTransform.generated.js");
+var _dependenciesRydbergGenerated = require("./dependenciesAny/dependenciesRydberg.generated.js");
+var _dependenciesSQRT1_2Generated = require("./dependenciesAny/dependenciesSQRT1_2.generated.js");
+var _dependenciesSQRT2Generated = require("./dependenciesAny/dependenciesSQRT2.generated.js");
+var _dependenciesSackurTetrodeGenerated = require("./dependenciesAny/dependenciesSackurTetrode.generated.js");
+var _dependenciesSchurGenerated = require("./dependenciesAny/dependenciesSchur.generated.js");
+var _dependenciesSecGenerated = require("./dependenciesAny/dependenciesSec.generated.js");
+var _dependenciesSechGenerated = require("./dependenciesAny/dependenciesSech.generated.js");
+var _dependenciesSecondRadiationGenerated = require("./dependenciesAny/dependenciesSecondRadiation.generated.js");
+var _dependenciesSetCartesianGenerated = require("./dependenciesAny/dependenciesSetCartesian.generated.js");
+var _dependenciesSetDifferenceGenerated = require("./dependenciesAny/dependenciesSetDifference.generated.js");
+var _dependenciesSetDistinctGenerated = require("./dependenciesAny/dependenciesSetDistinct.generated.js");
+var _dependenciesSetIntersectGenerated = require("./dependenciesAny/dependenciesSetIntersect.generated.js");
+var _dependenciesSetIsSubsetGenerated = require("./dependenciesAny/dependenciesSetIsSubset.generated.js");
+var _dependenciesSetMultiplicityGenerated = require("./dependenciesAny/dependenciesSetMultiplicity.generated.js");
+var _dependenciesSetPowersetGenerated = require("./dependenciesAny/dependenciesSetPowerset.generated.js");
+var _dependenciesSetSizeGenerated = require("./dependenciesAny/dependenciesSetSize.generated.js");
+var _dependenciesSetSymDifferenceGenerated = require("./dependenciesAny/dependenciesSetSymDifference.generated.js");
+var _dependenciesSetUnionGenerated = require("./dependenciesAny/dependenciesSetUnion.generated.js");
+var _dependenciesSignGenerated = require("./dependenciesAny/dependenciesSign.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesAny/dependenciesSimplify.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesAny/dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesAny/dependenciesSimplifyCore.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesAny/dependenciesSin.generated.js");
+var _dependenciesSinhGenerated = require("./dependenciesAny/dependenciesSinh.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesAny/dependenciesSize.generated.js");
+var _dependenciesSluGenerated = require("./dependenciesAny/dependenciesSlu.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesAny/dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesAny/dependenciesSmallerEq.generated.js");
+var _dependenciesSolveODEGenerated = require("./dependenciesAny/dependenciesSolveODE.generated.js");
+var _dependenciesSortGenerated = require("./dependenciesAny/dependenciesSort.generated.js");
+var _dependenciesSpaClassGenerated = require("./dependenciesAny/dependenciesSpaClass.generated.js");
+var _dependenciesSparseGenerated = require("./dependenciesAny/dependenciesSparse.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesAny/dependenciesSparseMatrixClass.generated.js");
+var _dependenciesSpeedOfLightGenerated = require("./dependenciesAny/dependenciesSpeedOfLight.generated.js");
+var _dependenciesSplitUnitGenerated = require("./dependenciesAny/dependenciesSplitUnit.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesAny/dependenciesSqrt.generated.js");
+var _dependenciesSqrtmGenerated = require("./dependenciesAny/dependenciesSqrtm.generated.js");
+var _dependenciesSquareGenerated = require("./dependenciesAny/dependenciesSquare.generated.js");
+var _dependenciesSqueezeGenerated = require("./dependenciesAny/dependenciesSqueeze.generated.js");
+var _dependenciesStdGenerated = require("./dependenciesAny/dependenciesStd.generated.js");
+var _dependenciesStdTransformGenerated = require("./dependenciesAny/dependenciesStdTransform.generated.js");
+var _dependenciesStefanBoltzmannGenerated = require("./dependenciesAny/dependenciesStefanBoltzmann.generated.js");
+var _dependenciesStirlingS2Generated = require("./dependenciesAny/dependenciesStirlingS2.generated.js");
+var _dependenciesStringGenerated = require("./dependenciesAny/dependenciesString.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesAny/dependenciesSubset.generated.js");
+var _dependenciesSubsetTransformGenerated = require("./dependenciesAny/dependenciesSubsetTransform.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesAny/dependenciesSubtract.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesAny/dependenciesSubtractScalar.generated.js");
+var _dependenciesSumGenerated = require("./dependenciesAny/dependenciesSum.generated.js");
+var _dependenciesSumTransformGenerated = require("./dependenciesAny/dependenciesSumTransform.generated.js");
+var _dependenciesSylvesterGenerated = require("./dependenciesAny/dependenciesSylvester.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesAny/dependenciesSymbolNode.generated.js");
+var _dependenciesSymbolicEqualGenerated = require("./dependenciesAny/dependenciesSymbolicEqual.generated.js");
+var _dependenciesTanGenerated = require("./dependenciesAny/dependenciesTan.generated.js");
+var _dependenciesTanhGenerated = require("./dependenciesAny/dependenciesTanh.generated.js");
+var _dependenciesTauGenerated = require("./dependenciesAny/dependenciesTau.generated.js");
+var _dependenciesThomsonCrossSectionGenerated = require("./dependenciesAny/dependenciesThomsonCrossSection.generated.js");
+var _dependenciesToGenerated = require("./dependenciesAny/dependenciesTo.generated.js");
+var _dependenciesToBestGenerated = require("./dependenciesAny/dependenciesToBest.generated.js");
+var _dependenciesTraceGenerated = require("./dependenciesAny/dependenciesTrace.generated.js");
+var _dependenciesTransposeGenerated = require("./dependenciesAny/dependenciesTranspose.generated.js");
+var _dependenciesTrueGenerated = require("./dependenciesAny/dependenciesTrue.generated.js");
+var _dependenciesTypeOfGenerated = require("./dependenciesAny/dependenciesTypeOf.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesAny/dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesAny/dependenciesUnaryMinus.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesAny/dependenciesUnaryPlus.generated.js");
+var _dependenciesUnequalGenerated = require("./dependenciesAny/dependenciesUnequal.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesAny/dependenciesUnitClass.generated.js");
+var _dependenciesUnitFunctionGenerated = require("./dependenciesAny/dependenciesUnitFunction.generated.js");
+var _dependenciesUppercaseEGenerated = require("./dependenciesAny/dependenciesUppercaseE.generated.js");
+var _dependenciesUppercasePiGenerated = require("./dependenciesAny/dependenciesUppercasePi.generated.js");
+var _dependenciesUsolveGenerated = require("./dependenciesAny/dependenciesUsolve.generated.js");
+var _dependenciesUsolveAllGenerated = require("./dependenciesAny/dependenciesUsolveAll.generated.js");
+var _dependenciesVacuumImpedanceGenerated = require("./dependenciesAny/dependenciesVacuumImpedance.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesAny/dependenciesVariance.generated.js");
+var _dependenciesVarianceTransformGenerated = require("./dependenciesAny/dependenciesVarianceTransform.generated.js");
+var _dependenciesVersionGenerated = require("./dependenciesAny/dependenciesVersion.generated.js");
+var _dependenciesWeakMixingAngleGenerated = require("./dependenciesAny/dependenciesWeakMixingAngle.generated.js");
+var _dependenciesWienDisplacementGenerated = require("./dependenciesAny/dependenciesWienDisplacement.generated.js");
+var _dependenciesXgcdGenerated = require("./dependenciesAny/dependenciesXgcd.generated.js");
+var _dependenciesXorGenerated = require("./dependenciesAny/dependenciesXor.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesAny/dependenciesZeros.generated.js");
+var _dependenciesZetaGenerated = require("./dependenciesAny/dependenciesZeta.generated.js");
+var _dependenciesZpk2tfGenerated = require("./dependenciesAny/dependenciesZpk2tf.generated.js");
+var _allFactoriesAny = require("./allFactoriesAny.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js
new file mode 100644
index 0000000..a209244
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAbs.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const absDependencies = exports.absDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAbs: _factoriesAny.createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..1013f15
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAccessorNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AccessorNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const AccessorNodeDependencies = exports.AccessorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAccessorNode: _factoriesAny.createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js
new file mode 100644
index 0000000..3a33acb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcos.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acosDependencies = exports.acosDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcos: _factoriesAny.createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..c11f52c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcosh.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acoshDependencies = exports.acoshDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcosh: _factoriesAny.createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js
new file mode 100644
index 0000000..ff6fe20
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcot.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acotDependencies = exports.acotDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcot: _factoriesAny.createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..52eb9c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcoth.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acothDependencies = exports.acothDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcoth: _factoriesAny.createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..ec86871
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsc.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acscDependencies = exports.acscDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsc: _factoriesAny.createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..117284d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAcsch.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acschDependencies = exports.acschDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsch: _factoriesAny.createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js
new file mode 100644
index 0000000..fe3d875
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAdd.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const addDependencies = exports.addDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAdd: _factoriesAny.createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..0259adb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAddScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const addScalarDependencies = exports.addScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAddScalar: _factoriesAny.createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js
new file mode 100644
index 0000000..62b49af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAnd.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNotGenerated = require("./dependenciesNot.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const andDependencies = exports.andDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  notDependencies: _dependenciesNotGenerated.notDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createAnd: _factoriesAny.createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAndTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAndTransform.generated.js
new file mode 100644
index 0000000..23cfcd9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAndTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNotGenerated = require("./dependenciesNot.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const andTransformDependencies = exports.andTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  notDependencies: _dependenciesNotGenerated.notDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createAndTransform: _factoriesAny.createAndTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js
new file mode 100644
index 0000000..9b63396
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArg.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.argDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const argDependencies = exports.argDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createArg: _factoriesAny.createArg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..1dd6e9d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesArrayNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArrayNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ArrayNodeDependencies = exports.ArrayNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createArrayNode: _factoriesAny.createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js
new file mode 100644
index 0000000..4ce5ddd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsec.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asecDependencies = exports.asecDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsec: _factoriesAny.createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js
new file mode 100644
index 0000000..c998c7d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsech.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asechDependencies = exports.asechDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsech: _factoriesAny.createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js
new file mode 100644
index 0000000..16407af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsin.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asinDependencies = exports.asinDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsin: _factoriesAny.createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..9952f06
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAsinh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asinhDependencies = exports.asinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsinh: _factoriesAny.createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..3356a2c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AssignmentNodeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const AssignmentNodeDependencies = exports.AssignmentNodeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAssignmentNode: _factoriesAny.createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js
new file mode 100644
index 0000000..8e74620
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atanDependencies = exports.atanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan: _factoriesAny.createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..d6f892b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtan2.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atan2Dependencies = exports.atan2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan2: _factoriesAny.createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..8474b1b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtanh.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atanhDependencies = exports.atanhDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtanh: _factoriesAny.createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js
new file mode 100644
index 0000000..22c1c3c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAtomicMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atomicMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atomicMassDependencies = exports.atomicMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createAtomicMass: _factoriesAny.createAtomicMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js
new file mode 100644
index 0000000..5bc3c9f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesAvogadro.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.avogadroDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const avogadroDependencies = exports.avogadroDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createAvogadro: _factoriesAny.createAvogadro
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..042691b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBellNumbers.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesStirlingS2Generated = require("./dependenciesStirlingS2.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bellNumbersDependencies = exports.bellNumbersDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  stirlingS2Dependencies: _dependenciesStirlingS2Generated.stirlingS2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBellNumbers: _factoriesAny.createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
new file mode 100644
index 0000000..3c96c2e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BigNumberDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const BigNumberDependencies = exports.BigNumberDependencies = {
+  createBigNumberClass: _factoriesAny.createBigNumberClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigint.generated.js
new file mode 100644
index 0000000..5b2e8c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBigint.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bigintDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bigintDependencies = exports.bigintDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBigint: _factoriesAny.createBigint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js
new file mode 100644
index 0000000..872f75f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBignumber.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bignumberDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bignumberDependencies = exports.bignumberDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBignumber: _factoriesAny.createBignumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js
new file mode 100644
index 0000000..da90dde
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBin.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.binDependencies = void 0;
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const binDependencies = exports.binDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBin: _factoriesAny.createBin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..be66698
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAnd.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitAndDependencies = exports.bitAndDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitAnd: _factoriesAny.createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAndTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAndTransform.generated.js
new file mode 100644
index 0000000..dcf6dc0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitAndTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNotGenerated = require("./dependenciesNot.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitAndTransformDependencies = exports.bitAndTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  notDependencies: _dependenciesNotGenerated.notDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createBitAndTransform: _factoriesAny.createBitAndTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..4ab8f47
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitNot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitNotDependencies = exports.bitNotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitNot: _factoriesAny.createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..78cf43d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOr.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitOrDependencies = exports.bitOrDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitOr: _factoriesAny.createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOrTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOrTransform.generated.js
new file mode 100644
index 0000000..2671bc1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitOrTransform.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrTransformDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitOrTransformDependencies = exports.bitOrTransformDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitOrTransform: _factoriesAny.createBitOrTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..c5a2f60
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBitXor.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitXorDependencies = exports.bitXorDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitXor: _factoriesAny.createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..10c04cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBlockNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BlockNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesResultSetGenerated = require("./dependenciesResultSet.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const BlockNodeDependencies = exports.BlockNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  ResultSetDependencies: _dependenciesResultSetGenerated.ResultSetDependencies,
+  createBlockNode: _factoriesAny.createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
new file mode 100644
index 0000000..7d72bc7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bohrMagnetonDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bohrMagnetonDependencies = exports.bohrMagnetonDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBohrMagneton: _factoriesAny.createBohrMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js
new file mode 100644
index 0000000..476da49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBohrRadius.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bohrRadiusDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bohrRadiusDependencies = exports.bohrRadiusDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBohrRadius: _factoriesAny.createBohrRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js
new file mode 100644
index 0000000..4f5135b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoltzmann.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.boltzmannDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const boltzmannDependencies = exports.boltzmannDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createBoltzmann: _factoriesAny.createBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..d52eae8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesBoolean.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const booleanDependencies = exports.booleanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBoolean: _factoriesAny.createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..1e35a08
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCatalan.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const catalanDependencies = exports.catalanDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCatalan: _factoriesAny.createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..5608678
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCbrt.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cbrtDependencies = exports.cbrtDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createCbrt: _factoriesAny.createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js
new file mode 100644
index 0000000..261c51e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCeil.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ceilDependencies = exports.ceilDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createCeil: _factoriesAny.createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js
new file mode 100644
index 0000000..61ba627
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChain.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.chainDependencies = void 0;
+var _dependenciesChainClassGenerated = require("./dependenciesChainClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const chainDependencies = exports.chainDependencies = {
+  ChainDependencies: _dependenciesChainClassGenerated.ChainDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChain: _factoriesAny.createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..8c00a84
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesChainClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ChainDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ChainDependencies = exports.ChainDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChainClass: _factoriesAny.createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
new file mode 100644
index 0000000..e08033a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.classicalElectronRadiusDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const classicalElectronRadiusDependencies = exports.classicalElectronRadiusDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createClassicalElectronRadius: _factoriesAny.createClassicalElectronRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js
new file mode 100644
index 0000000..a23e7c4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesClone.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cloneDependencies = exports.cloneDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createClone: _factoriesAny.createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js
new file mode 100644
index 0000000..0db7c9e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumn.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const columnDependencies = exports.columnDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createColumn: _factoriesAny.createColumn
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js
new file mode 100644
index 0000000..84e9737
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesColumnTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnTransformDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const columnTransformDependencies = exports.columnTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createColumnTransform: _factoriesAny.createColumnTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..41d58d6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinations.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const combinationsDependencies = exports.combinationsDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinations: _factoriesAny.createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..8727fc1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const combinationsWithRepDependencies = exports.combinationsWithRepDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinationsWithRep: _factoriesAny.createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js
new file mode 100644
index 0000000..f5f7b26
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompare.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareDependencies = exports.compareDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompare: _factoriesAny.createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..34dca1d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareNatural.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDependencies = void 0;
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareNaturalDependencies = exports.compareNaturalDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareNatural: _factoriesAny.createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..863a8a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompareText.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareTextDependencies = exports.compareTextDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareText: _factoriesAny.createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js
new file mode 100644
index 0000000..08e0e7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCompile.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileDependencies = void 0;
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compileDependencies = exports.compileDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompile: _factoriesAny.createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js
new file mode 100644
index 0000000..f6fbf39
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplex.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const complexDependencies = exports.complexDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComplex: _factoriesAny.createComplex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js
new file mode 100644
index 0000000..480c6e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComplexClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ComplexDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ComplexDependencies = exports.ComplexDependencies = {
+  createComplexClass: _factoriesAny.createComplexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js
new file mode 100644
index 0000000..159937a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesComposition.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compositionDependencies = exports.compositionDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComposition: _factoriesAny.createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js
new file mode 100644
index 0000000..5406431
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcat.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const concatDependencies = exports.concatDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConcat: _factoriesAny.createConcat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js
new file mode 100644
index 0000000..b34b69f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConcatTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatTransformDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const concatTransformDependencies = exports.concatTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConcatTransform: _factoriesAny.createConcatTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..e4fe8a4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConditionalNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConditionalNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ConditionalNodeDependencies = exports.ConditionalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConditionalNode: _factoriesAny.createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
new file mode 100644
index 0000000..b9c4ba4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conductanceQuantumDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const conductanceQuantumDependencies = exports.conductanceQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createConductanceQuantum: _factoriesAny.createConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js
new file mode 100644
index 0000000..17e72c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConj.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conjDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const conjDependencies = exports.conjDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createConj: _factoriesAny.createConj
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..bfabdf9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesConstantNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConstantNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ConstantNodeDependencies = exports.ConstantNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConstantNode: _factoriesAny.createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCorr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCorr.generated.js
new file mode 100644
index 0000000..44679f5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCorr.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.corrDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMeanGenerated = require("./dependenciesMean.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesSumGenerated = require("./dependenciesSum.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const corrDependencies = exports.corrDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  meanDependencies: _dependenciesMeanGenerated.meanDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  sumDependencies: _dependenciesSumGenerated.sumDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCorr: _factoriesAny.createCorr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js
new file mode 100644
index 0000000..baa3170
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCos.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cosDependencies = exports.cosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCos: _factoriesAny.createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js
new file mode 100644
index 0000000..14528a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCosh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const coshDependencies = exports.coshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCosh: _factoriesAny.createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js
new file mode 100644
index 0000000..02c4e5f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCot.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cotDependencies = exports.cotDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCot: _factoriesAny.createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js
new file mode 100644
index 0000000..8dc4cb6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoth.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cothDependencies = exports.cothDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCoth: _factoriesAny.createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js
new file mode 100644
index 0000000..a9b2d72
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulomb.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coulombDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const coulombDependencies = exports.coulombDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createCoulomb: _factoriesAny.createCoulomb
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulombConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulombConstant.generated.js
new file mode 100644
index 0000000..9cbc9db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCoulombConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coulombConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const coulombConstantDependencies = exports.coulombConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createCoulombConstant: _factoriesAny.createCoulombConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js
new file mode 100644
index 0000000..a9b2b3d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCount.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.countDependencies = void 0;
+var _dependenciesProdGenerated = require("./dependenciesProd.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const countDependencies = exports.countDependencies = {
+  prodDependencies: _dependenciesProdGenerated.prodDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCount: _factoriesAny.createCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js
new file mode 100644
index 0000000..991076b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCreateUnit.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitDependencies = void 0;
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const createUnitDependencies = exports.createUnitDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCreateUnit: _factoriesAny.createCreateUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js
new file mode 100644
index 0000000..8be6d39
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCross.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.crossDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const crossDependencies = exports.crossDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCross: _factoriesAny.createCross
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js
new file mode 100644
index 0000000..342c99f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsc.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cscDependencies = exports.cscDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsc: _factoriesAny.createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js
new file mode 100644
index 0000000..5e461e0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCsch.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cschDependencies = exports.cschDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsch: _factoriesAny.createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js
new file mode 100644
index 0000000..6d17118
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCtranspose.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ctransposeDependencies = void 0;
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ctransposeDependencies = exports.ctransposeDependencies = {
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCtranspose: _factoriesAny.createCtranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js
new file mode 100644
index 0000000..b5de087
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCube.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cubeDependencies = exports.cubeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCube: _factoriesAny.createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..bd1dfd0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSum.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cumsumDependencies = exports.cumsumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSum: _factoriesAny.createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..4370a1e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cumsumTransformDependencies = exports.cumsumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSumTransform: _factoriesAny.createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..f0d2fb0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeepEqual.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDependencies = void 0;
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const deepEqualDependencies = exports.deepEqualDependencies = {
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDeepEqual: _factoriesAny.createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
new file mode 100644
index 0000000..921d31e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DenseMatrixDependencies = void 0;
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const DenseMatrixDependencies = exports.DenseMatrixDependencies = {
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  createDenseMatrixClass: _factoriesAny.createDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..ecac7f2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDerivative.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDependencies = void 0;
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const derivativeDependencies = exports.derivativeDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDerivative: _factoriesAny.createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js
new file mode 100644
index 0000000..1697b14
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDet.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.detDependencies = void 0;
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const detDependencies = exports.detDependencies = {
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createDet: _factoriesAny.createDet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
new file mode 100644
index 0000000..096e30d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deuteronMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const deuteronMassDependencies = exports.deuteronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createDeuteronMass: _factoriesAny.createDeuteronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js
new file mode 100644
index 0000000..a4e36ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiag.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diagDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const diagDependencies = exports.diagDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiag: _factoriesAny.createDiag
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js
new file mode 100644
index 0000000..94f634a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiff.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const diffDependencies = exports.diffDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiff: _factoriesAny.createDiff
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js
new file mode 100644
index 0000000..37a03b2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDiffTransform.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffTransformDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const diffTransformDependencies = exports.diffTransformDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDiffTransform: _factoriesAny.createDiffTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js
new file mode 100644
index 0000000..3a82821
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDistance.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distanceDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDeepEqualGenerated = require("./dependenciesDeepEqual.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const distanceDependencies = exports.distanceDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  deepEqualDependencies: _dependenciesDeepEqualGenerated.deepEqualDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDistance: _factoriesAny.createDistance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js
new file mode 100644
index 0000000..eb7279a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivide.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDependencies = void 0;
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const divideDependencies = exports.divideDependencies = {
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivide: _factoriesAny.createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..cb63652
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDivideScalar.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideScalarDependencies = void 0;
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const divideScalarDependencies = exports.divideScalarDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivideScalar: _factoriesAny.createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js
new file mode 100644
index 0000000..7de92d1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDot.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const dotDependencies = exports.dotDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDot: _factoriesAny.createDot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js
new file mode 100644
index 0000000..70f3e77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotDivide.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDivideDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const dotDivideDependencies = exports.dotDivideDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotDivide: _factoriesAny.createDotDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js
new file mode 100644
index 0000000..f69a302
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotMultiply.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotMultiplyDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const dotMultiplyDependencies = exports.dotMultiplyDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotMultiply: _factoriesAny.createDotMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js
new file mode 100644
index 0000000..44867d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesDotPow.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotPowDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const dotPowDependencies = exports.dotPowDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDotPow: _factoriesAny.createDotPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js
new file mode 100644
index 0000000..dccc3aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesE.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const eDependencies = exports.eDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createE: _factoriesAny.createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
new file mode 100644
index 0000000..f5318a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.efimovFactorDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const efimovFactorDependencies = exports.efimovFactorDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createEfimovFactor: _factoriesAny.createEfimovFactor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js
new file mode 100644
index 0000000..8332e40
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEigs.generated.js
@@ -0,0 +1,79 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eigsDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesAtanGenerated = require("./dependenciesAtan.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesColumnGenerated = require("./dependenciesColumn.generated.js");
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+var _dependenciesCosGenerated = require("./dependenciesCos.generated.js");
+var _dependenciesDiagGenerated = require("./dependenciesDiag.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesDotGenerated = require("./dependenciesDot.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesImGenerated = require("./dependenciesIm.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMatrixFromColumnsGenerated = require("./dependenciesMatrixFromColumns.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesQrGenerated = require("./dependenciesQr.generated.js");
+var _dependenciesReGenerated = require("./dependenciesRe.generated.js");
+var _dependenciesReshapeGenerated = require("./dependenciesReshape.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUsolveGenerated = require("./dependenciesUsolve.generated.js");
+var _dependenciesUsolveAllGenerated = require("./dependenciesUsolveAll.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const eigsDependencies = exports.eigsDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  atanDependencies: _dependenciesAtanGenerated.atanDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  columnDependencies: _dependenciesColumnGenerated.columnDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  cosDependencies: _dependenciesCosGenerated.cosDependencies,
+  diagDependencies: _dependenciesDiagGenerated.diagDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  dotDependencies: _dependenciesDotGenerated.dotDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  imDependencies: _dependenciesImGenerated.imDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  matrixFromColumnsDependencies: _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  qrDependencies: _dependenciesQrGenerated.qrDependencies,
+  reDependencies: _dependenciesReGenerated.reDependencies,
+  reshapeDependencies: _dependenciesReshapeGenerated.reshapeDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,
+  usolveAllDependencies: _dependenciesUsolveAllGenerated.usolveAllDependencies,
+  createEigs: _factoriesAny.createEigs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js
new file mode 100644
index 0000000..5c6f2d8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectricConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.electricConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const electricConstantDependencies = exports.electricConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElectricConstant: _factoriesAny.createElectricConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js
new file mode 100644
index 0000000..1850f7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElectronMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.electronMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const electronMassDependencies = exports.electronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElectronMass: _factoriesAny.createElectronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
new file mode 100644
index 0000000..cff49e6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.elementaryChargeDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const elementaryChargeDependencies = exports.elementaryChargeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createElementaryCharge: _factoriesAny.createElementaryCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js
new file mode 100644
index 0000000..6dc7e9c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqual.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalDependencies = exports.equalDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqual: _factoriesAny.createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..74c417d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalScalarDependencies = exports.equalScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualScalar: _factoriesAny.createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..cb8c2d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEqualText.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDependencies = void 0;
+var _dependenciesCompareTextGenerated = require("./dependenciesCompareText.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalTextDependencies = exports.equalTextDependencies = {
+  compareTextDependencies: _dependenciesCompareTextGenerated.compareTextDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualText: _factoriesAny.createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js
new file mode 100644
index 0000000..c829914
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesErf.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const erfDependencies = exports.erfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createErf: _factoriesAny.createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..91fc6c7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesEvaluate.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDependencies = void 0;
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const evaluateDependencies = exports.evaluateDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEvaluate: _factoriesAny.createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js
new file mode 100644
index 0000000..40d3405
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExp.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const expDependencies = exports.expDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExp: _factoriesAny.createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js
new file mode 100644
index 0000000..f0c0bad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expmDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const expmDependencies = exports.expmDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm: _factoriesAny.createExpm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..2341cce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesExpm1.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Dependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const expm1Dependencies = exports.expm1Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm1: _factoriesAny.createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..5b0cb68
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFactorial.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDependencies = void 0;
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const factorialDependencies = exports.factorialDependencies = {
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFactorial: _factoriesAny.createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js
new file mode 100644
index 0000000..cf7d620
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFalse.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const falseDependencies = exports.falseDependencies = {
+  createFalse: _factoriesAny.createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js
new file mode 100644
index 0000000..0b764b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFaraday.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.faradayDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const faradayDependencies = exports.faradayDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFaraday: _factoriesAny.createFaraday
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
new file mode 100644
index 0000000..e83d858
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fermiCouplingDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fermiCouplingDependencies = exports.fermiCouplingDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFermiCoupling: _factoriesAny.createFermiCoupling
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFft.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFft.generated.js
new file mode 100644
index 0000000..afcb954
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFft.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fftDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCeilGenerated = require("./dependenciesCeil.generated.js");
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesDotDivideGenerated = require("./dependenciesDotDivide.generated.js");
+var _dependenciesExpGenerated = require("./dependenciesExp.generated.js");
+var _dependenciesIGenerated = require("./dependenciesI.generated.js");
+var _dependenciesLog2Generated = require("./dependenciesLog2.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesTauGenerated = require("./dependenciesTau.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fftDependencies = exports.fftDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,
+  expDependencies: _dependenciesExpGenerated.expDependencies,
+  iDependencies: _dependenciesIGenerated.iDependencies,
+  log2Dependencies: _dependenciesLog2Generated.log2Dependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  tauDependencies: _dependenciesTauGenerated.tauDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFft: _factoriesAny.createFft
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
new file mode 100644
index 0000000..a652c0d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FibonacciHeapDependencies = void 0;
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FibonacciHeapDependencies = exports.FibonacciHeapDependencies = {
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  createFibonacciHeapClass: _factoriesAny.createFibonacciHeapClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js
new file mode 100644
index 0000000..d2a95b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilter.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const filterDependencies = exports.filterDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilter: _factoriesAny.createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..e20f07b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFilterTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const filterTransformDependencies = exports.filterTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilterTransform: _factoriesAny.createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js
new file mode 100644
index 0000000..d23fcd1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFineStructure.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fineStructureDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fineStructureDependencies = exports.fineStructureDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createFineStructure: _factoriesAny.createFineStructure
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
new file mode 100644
index 0000000..71f6d89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.firstRadiationDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const firstRadiationDependencies = exports.firstRadiationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createFirstRadiation: _factoriesAny.createFirstRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js
new file mode 100644
index 0000000..a3991af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFix.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesCeilGenerated = require("./dependenciesCeil.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesFloorGenerated = require("./dependenciesFloor.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fixDependencies = exports.fixDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  floorDependencies: _dependenciesFloorGenerated.floorDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createFix: _factoriesAny.createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js
new file mode 100644
index 0000000..7374fba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFlatten.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.flattenDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const flattenDependencies = exports.flattenDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFlatten: _factoriesAny.createFlatten
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js
new file mode 100644
index 0000000..0dab5f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFloor.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const floorDependencies = exports.floorDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createFloor: _factoriesAny.createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js
new file mode 100644
index 0000000..332f049
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEach.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const forEachDependencies = exports.forEachDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEach: _factoriesAny.createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..97f8396
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesForEachTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const forEachTransformDependencies = exports.forEachTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEachTransform: _factoriesAny.createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js
new file mode 100644
index 0000000..17e9173
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFormat.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const formatDependencies = exports.formatDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFormat: _factoriesAny.createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js
new file mode 100644
index 0000000..01a451b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFraction.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fractionDependencies = void 0;
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fractionDependencies = exports.fractionDependencies = {
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFraction: _factoriesAny.createFraction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js
new file mode 100644
index 0000000..3537798
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFractionClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FractionDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FractionDependencies = exports.FractionDependencies = {
+  createFractionClass: _factoriesAny.createFractionClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFreqz.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFreqz.generated.js
new file mode 100644
index 0000000..e4b9c18
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFreqz.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.freqzDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const freqzDependencies = exports.freqzDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFreqz: _factoriesAny.createFreqz
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..533b6a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionAssignmentNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FunctionAssignmentNodeDependencies = exports.FunctionAssignmentNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFunctionAssignmentNode: _factoriesAny.createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..d49ec5c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesFunctionNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FunctionNodeDependencies = exports.FunctionNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  createFunctionNode: _factoriesAny.createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js
new file mode 100644
index 0000000..af6f35a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGamma.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gammaDependencies = exports.gammaDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGamma: _factoriesAny.createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js
new file mode 100644
index 0000000..21dfe43
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGasConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gasConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gasConstantDependencies = exports.gasConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGasConstant: _factoriesAny.createGasConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js
new file mode 100644
index 0000000..a43a568
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGcd.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gcdDependencies = exports.gcdDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createGcd: _factoriesAny.createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
new file mode 100644
index 0000000..82e4827
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getMatrixDataTypeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const getMatrixDataTypeDependencies = exports.getMatrixDataTypeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGetMatrixDataType: _factoriesAny.createGetMatrixDataType
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
new file mode 100644
index 0000000..51b8b36
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gravitationConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gravitationConstantDependencies = exports.gravitationConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGravitationConstant: _factoriesAny.createGravitationConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js
new file mode 100644
index 0000000..3b16894
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesGravity.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gravityDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gravityDependencies = exports.gravityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createGravity: _factoriesAny.createGravity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
new file mode 100644
index 0000000..8a62590
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hartreeEnergyDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hartreeEnergyDependencies = exports.hartreeEnergyDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createHartreeEnergy: _factoriesAny.createHartreeEnergy
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..6aeb4c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDependencies = void 0;
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hasNumericValueDependencies = exports.hasNumericValueDependencies = {
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHasNumericValue: _factoriesAny.createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js
new file mode 100644
index 0000000..75337a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelp.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDependencies = void 0;
+var _dependenciesHelpClassGenerated = require("./dependenciesHelpClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const helpDependencies = exports.helpDependencies = {
+  HelpDependencies: _dependenciesHelpClassGenerated.HelpDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHelp: _factoriesAny.createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..3d2dcd0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHelpClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.HelpDependencies = void 0;
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const HelpDependencies = exports.HelpDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  createHelpClass: _factoriesAny.createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js
new file mode 100644
index 0000000..a3cfc5a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHex.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hexDependencies = void 0;
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hexDependencies = exports.hexDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHex: _factoriesAny.createHex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js
new file mode 100644
index 0000000..d77515b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesHypot.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hypotDependencies = exports.hypotDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHypot: _factoriesAny.createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js
new file mode 100644
index 0000000..a172b7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesI.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.iDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const iDependencies = exports.iDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  createI: _factoriesAny.createI
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js
new file mode 100644
index 0000000..dc2635c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIdentity.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.identityDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const identityDependencies = exports.identityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIdentity: _factoriesAny.createIdentity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIfft.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIfft.generated.js
new file mode 100644
index 0000000..b39012b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIfft.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ifftDependencies = void 0;
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesDotDivideGenerated = require("./dependenciesDotDivide.generated.js");
+var _dependenciesFftGenerated = require("./dependenciesFft.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ifftDependencies = exports.ifftDependencies = {
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,
+  fftDependencies: _dependenciesFftGenerated.fftDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIfft: _factoriesAny.createIfft
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js
new file mode 100644
index 0000000..5f8f27a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIm.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.imDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const imDependencies = exports.imDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIm: _factoriesAny.createIm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
new file mode 100644
index 0000000..6096907
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ImmutableDenseMatrixDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ImmutableDenseMatrixDependencies = exports.ImmutableDenseMatrixDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  createImmutableDenseMatrixClass: _factoriesAny.createImmutableDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js
new file mode 100644
index 0000000..74abca3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndex.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const indexDependencies = exports.indexDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIndex: _factoriesAny.createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js
new file mode 100644
index 0000000..6731548
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexClass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexDependencies = void 0;
+var _dependenciesImmutableDenseMatrixClassGenerated = require("./dependenciesImmutableDenseMatrixClass.generated.js");
+var _dependenciesGetMatrixDataTypeGenerated = require("./dependenciesGetMatrixDataType.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const IndexDependencies = exports.IndexDependencies = {
+  ImmutableDenseMatrixDependencies: _dependenciesImmutableDenseMatrixClassGenerated.ImmutableDenseMatrixDependencies,
+  getMatrixDataTypeDependencies: _dependenciesGetMatrixDataTypeGenerated.getMatrixDataTypeDependencies,
+  createIndexClass: _factoriesAny.createIndexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..967371d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const IndexNodeDependencies = exports.IndexNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  createIndexNode: _factoriesAny.createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js
new file mode 100644
index 0000000..94fc2f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIndexTransform.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexTransformDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesGetMatrixDataTypeGenerated = require("./dependenciesGetMatrixDataType.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const indexTransformDependencies = exports.indexTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  getMatrixDataTypeDependencies: _dependenciesGetMatrixDataTypeGenerated.getMatrixDataTypeDependencies,
+  createIndexTransform: _factoriesAny.createIndexTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..2534c8a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInfinity.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const InfinityDependencies = exports.InfinityDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createInfinity: _factoriesAny.createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js
new file mode 100644
index 0000000..5ecc970
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIntersect.generated.js
@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.intersectDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const intersectDependencies = exports.intersectDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIntersect: _factoriesAny.createIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js
new file mode 100644
index 0000000..7641b37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInv.generated.js
@@ -0,0 +1,33 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDetGenerated = require("./dependenciesDet.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const invDependencies = exports.invDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  detDependencies: _dependenciesDetGenerated.detDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createInv: _factoriesAny.createInv
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
new file mode 100644
index 0000000..37f933d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.inverseConductanceQuantumDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const inverseConductanceQuantumDependencies = exports.inverseConductanceQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createInverseConductanceQuantum: _factoriesAny.createInverseConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js
new file mode 100644
index 0000000..fa6d7f2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesInvmod.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invmodDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesModGenerated = require("./dependenciesMod.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesXgcdGenerated = require("./dependenciesXgcd.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const invmodDependencies = exports.invmodDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  modDependencies: _dependenciesModGenerated.modDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  xgcdDependencies: _dependenciesXgcdGenerated.xgcdDependencies,
+  createInvmod: _factoriesAny.createInvmod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..35afad2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsInteger.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isIntegerDependencies = exports.isIntegerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsInteger: _factoriesAny.createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..190d036
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNaN.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNaNDependencies = exports.isNaNDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNaN: _factoriesAny.createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..1039abf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNegative.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNegativeDependencies = exports.isNegativeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNegative: _factoriesAny.createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..5ba31d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsNumeric.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNumericDependencies = exports.isNumericDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNumeric: _factoriesAny.createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..0b19335
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPositive.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isPositiveDependencies = exports.isPositiveDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPositive: _factoriesAny.createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..82ebfd0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsPrime.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isPrimeDependencies = exports.isPrimeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPrime: _factoriesAny.createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..1d86159
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesIsZero.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDependencies = void 0;
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isZeroDependencies = exports.isZeroDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsZero: _factoriesAny.createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js
new file mode 100644
index 0000000..30cd592
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKldivergence.generated.js
@@ -0,0 +1,33 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kldivergenceDependencies = void 0;
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesDotDivideGenerated = require("./dependenciesDotDivide.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesLogGenerated = require("./dependenciesLog.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSumGenerated = require("./dependenciesSum.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const kldivergenceDependencies = exports.kldivergenceDependencies = {
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  logDependencies: _dependenciesLogGenerated.logDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  sumDependencies: _dependenciesSumGenerated.sumDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createKldivergence: _factoriesAny.createKldivergence
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js
new file mode 100644
index 0000000..9c6aefc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKlitzing.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.klitzingDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const klitzingDependencies = exports.klitzingDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createKlitzing: _factoriesAny.createKlitzing
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js
new file mode 100644
index 0000000..7e6eff6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesKron.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kronDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const kronDependencies = exports.kronDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createKron: _factoriesAny.createKron
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js
new file mode 100644
index 0000000..42d6d6f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN10.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LN10Dependencies = exports.LN10Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLN10: _factoriesAny.createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js
new file mode 100644
index 0000000..6ea7e58
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLN2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LN2Dependencies = exports.LN2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLN2: _factoriesAny.createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..d86d760
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG10E.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LOG10EDependencies = exports.LOG10EDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLOG10E: _factoriesAny.createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..c85914b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLOG2E.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LOG2EDependencies = exports.LOG2EDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createLOG2E: _factoriesAny.createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js
new file mode 100644
index 0000000..d6f1419
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLarger.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const largerDependencies = exports.largerDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLarger: _factoriesAny.createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..348aecc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLargerEq.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const largerEqDependencies = exports.largerEqDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLargerEq: _factoriesAny.createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js
new file mode 100644
index 0000000..f279e17
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLcm.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lcmDependencies = exports.lcmDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLcm: _factoriesAny.createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js
new file mode 100644
index 0000000..409882d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeafCount.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leafCountDependencies = void 0;
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const leafCountDependencies = exports.leafCountDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLeafCount: _factoriesAny.createLeafCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..bd6c224
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLeftShift.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const leftShiftDependencies = exports.leftShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createLeftShift: _factoriesAny.createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLgamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLgamma.generated.js
new file mode 100644
index 0000000..7c12fe1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLgamma.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lgammaDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lgammaDependencies = exports.lgammaDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLgamma: _factoriesAny.createLgamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js
new file mode 100644
index 0000000..088fc7e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesTypeOfGenerated = require("./dependenciesTypeOf.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const logDependencies = exports.logDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  typeOfDependencies: _dependenciesTypeOfGenerated.typeOfDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog: _factoriesAny.createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js
new file mode 100644
index 0000000..865cd7c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog10.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Dependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log10Dependencies = exports.log10Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog10: _factoriesAny.createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..7b6af55
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog1p.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesLogGenerated = require("./dependenciesLog.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log1pDependencies = exports.log1pDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  logDependencies: _dependenciesLogGenerated.logDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog1p: _factoriesAny.createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js
new file mode 100644
index 0000000..be63826
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLog2.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Dependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log2Dependencies = exports.log2Dependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog2: _factoriesAny.createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js
new file mode 100644
index 0000000..1188507
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLoschmidt.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.loschmidtDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const loschmidtDependencies = exports.loschmidtDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createLoschmidt: _factoriesAny.createLoschmidt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js
new file mode 100644
index 0000000..a7baef8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolve.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lsolveDependencies = exports.lsolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLsolve: _factoriesAny.createLsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js
new file mode 100644
index 0000000..1c2c7ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLsolveAll.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveAllDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lsolveAllDependencies = exports.lsolveAllDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLsolveAll: _factoriesAny.createLsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js
new file mode 100644
index 0000000..84ff4ac
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLup.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lupDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSpaClassGenerated = require("./dependenciesSpaClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lupDependencies = exports.lupDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SpaDependencies: _dependenciesSpaClassGenerated.SpaDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createLup: _factoriesAny.createLup
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js
new file mode 100644
index 0000000..fb3df3f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLusolve.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lusolveDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesLsolveGenerated = require("./dependenciesLsolve.generated.js");
+var _dependenciesLupGenerated = require("./dependenciesLup.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSluGenerated = require("./dependenciesSlu.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUsolveGenerated = require("./dependenciesUsolve.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lusolveDependencies = exports.lusolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  lsolveDependencies: _dependenciesLsolveGenerated.lsolveDependencies,
+  lupDependencies: _dependenciesLupGenerated.lupDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sluDependencies: _dependenciesSluGenerated.sluDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  usolveDependencies: _dependenciesUsolveGenerated.usolveDependencies,
+  createLusolve: _factoriesAny.createLusolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLyap.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLyap.generated.js
new file mode 100644
index 0000000..9a092ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesLyap.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lyapDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSylvesterGenerated = require("./dependenciesSylvester.generated.js");
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lyapDependencies = exports.lyapDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  sylvesterDependencies: _dependenciesSylvesterGenerated.sylvesterDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLyap: _factoriesAny.createLyap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js
new file mode 100644
index 0000000..d8f13d2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMad.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesMedianGenerated = require("./dependenciesMedian.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const madDependencies = exports.madDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  medianDependencies: _dependenciesMedianGenerated.medianDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMad: _factoriesAny.createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
new file mode 100644
index 0000000..7812682
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.magneticConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const magneticConstantDependencies = exports.magneticConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMagneticConstant: _factoriesAny.createMagneticConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
new file mode 100644
index 0000000..8a2d2a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.magneticFluxQuantumDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const magneticFluxQuantumDependencies = exports.magneticFluxQuantumDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMagneticFluxQuantum: _factoriesAny.createMagneticFluxQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js
new file mode 100644
index 0000000..23e401d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMap.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapDependencies = exports.mapDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMap: _factoriesAny.createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlices.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlices.generated.js
new file mode 100644
index 0000000..7184200
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlices.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapSlicesDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapSlicesDependencies = exports.mapSlicesDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapSlices: _factoriesAny.createMapSlices
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js
new file mode 100644
index 0000000..ac2fb51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapSlicesTransformDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapSlicesTransformDependencies = exports.mapSlicesTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapSlicesTransform: _factoriesAny.createMapSlicesTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..42567b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMapTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapTransformDependencies = exports.mapTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapTransform: _factoriesAny.createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..f085dd6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrix.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const matrixDependencies = exports.matrixDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrix: _factoriesAny.createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js
new file mode 100644
index 0000000..f28ed0c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.MatrixDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const MatrixDependencies = exports.MatrixDependencies = {
+  createMatrixClass: _factoriesAny.createMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
new file mode 100644
index 0000000..2722b83
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromColumnsDependencies = void 0;
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const matrixFromColumnsDependencies = exports.matrixFromColumnsDependencies = {
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromColumns: _factoriesAny.createMatrixFromColumns
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
new file mode 100644
index 0000000..affb043
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromFunctionDependencies = void 0;
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const matrixFromFunctionDependencies = exports.matrixFromFunctionDependencies = {
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromFunction: _factoriesAny.createMatrixFromFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
new file mode 100644
index 0000000..bc05055
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromRowsDependencies = void 0;
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const matrixFromRowsDependencies = exports.matrixFromRowsDependencies = {
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMatrixFromRows: _factoriesAny.createMatrixFromRows
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js
new file mode 100644
index 0000000..0913b43
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMax.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const maxDependencies = exports.maxDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMax: _factoriesAny.createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..20a9cd6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMaxTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxTransformDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const maxTransformDependencies = exports.maxTransformDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMaxTransform: _factoriesAny.createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js
new file mode 100644
index 0000000..73fb788
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMean.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const meanDependencies = exports.meanDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMean: _factoriesAny.createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..43b58de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMeanTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const meanTransformDependencies = exports.meanTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMeanTransform: _factoriesAny.createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js
new file mode 100644
index 0000000..7ccea59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMedian.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const medianDependencies = exports.medianDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMedian: _factoriesAny.createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js
new file mode 100644
index 0000000..ea95fc2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMin.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const minDependencies = exports.minDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMin: _factoriesAny.createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..e2b3c6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMinTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minTransformDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const minTransformDependencies = exports.minTransformDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMinTransform: _factoriesAny.createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js
new file mode 100644
index 0000000..0c66c0c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMod.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const modDependencies = exports.modDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createMod: _factoriesAny.createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js
new file mode 100644
index 0000000..120cf46
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMode.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const modeDependencies = exports.modeDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMode: _factoriesAny.createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js
new file mode 100644
index 0000000..359508e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const molarMassDependencies = exports.molarMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarMass: _factoriesAny.createMolarMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
new file mode 100644
index 0000000..685080c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarMassC12Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const molarMassC12Dependencies = exports.molarMassC12Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarMassC12: _factoriesAny.createMolarMassC12
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
new file mode 100644
index 0000000..465673e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarPlanckConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const molarPlanckConstantDependencies = exports.molarPlanckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarPlanckConstant: _factoriesAny.createMolarPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js
new file mode 100644
index 0000000..025d170
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMolarVolume.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.molarVolumeDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const molarVolumeDependencies = exports.molarVolumeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createMolarVolume: _factoriesAny.createMolarVolume
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..7aac091
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultinomial.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multinomialDependencies = exports.multinomialDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultinomial: _factoriesAny.createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..5058b57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiply.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDotGenerated = require("./dependenciesDot.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multiplyDependencies = exports.multiplyDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  dotDependencies: _dependenciesDotGenerated.dotDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiply: _factoriesAny.createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..c93ed59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multiplyScalarDependencies = exports.multiplyScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiplyScalar: _factoriesAny.createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js
new file mode 100644
index 0000000..0a40ca2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNaN.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const NaNDependencies = exports.NaNDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createNaN: _factoriesAny.createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js
new file mode 100644
index 0000000..793c05d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNeutronMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.neutronMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const neutronMassDependencies = exports.neutronMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createNeutronMass: _factoriesAny.createNeutronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js
new file mode 100644
index 0000000..4028831
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNode.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NodeDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const NodeDependencies = exports.NodeDependencies = {
+  createNode: _factoriesAny.createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js
new file mode 100644
index 0000000..a9144a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNorm.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesCtransposeGenerated = require("./dependenciesCtranspose.generated.js");
+var _dependenciesEigsGenerated = require("./dependenciesEigs.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const normDependencies = exports.normDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  ctransposeDependencies: _dependenciesCtransposeGenerated.ctransposeDependencies,
+  eigsDependencies: _dependenciesEigsGenerated.eigsDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNorm: _factoriesAny.createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js
new file mode 100644
index 0000000..0b6d52a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const notDependencies = exports.notDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNot: _factoriesAny.createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..fb7b091
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoot.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nthRootDependencies = exports.nthRootDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoot: _factoriesAny.createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js
new file mode 100644
index 0000000..a2fd939
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNthRoots.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootsDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nthRootsDependencies = exports.nthRootsDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoots: _factoriesAny.createNthRoots
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
new file mode 100644
index 0000000..016d4f9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nuclearMagnetonDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nuclearMagnetonDependencies = exports.nuclearMagnetonDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createNuclearMagneton: _factoriesAny.createNuclearMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js
new file mode 100644
index 0000000..06e6030
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNull.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nullDependencies = exports.nullDependencies = {
+  createNull: _factoriesAny.createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullish.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullish.generated.js
new file mode 100644
index 0000000..dfe4dd2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullish.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullishDependencies = void 0;
+var _dependenciesDeepEqualGenerated = require("./dependenciesDeepEqual.generated.js");
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nullishDependencies = exports.nullishDependencies = {
+  deepEqualDependencies: _dependenciesDeepEqualGenerated.deepEqualDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNullish: _factoriesAny.createNullish
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullishTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullishTransform.generated.js
new file mode 100644
index 0000000..5eca167
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNullishTransform.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullishTransformDependencies = void 0;
+var _dependenciesDeepEqualGenerated = require("./dependenciesDeepEqual.generated.js");
+var _dependenciesFlattenGenerated = require("./dependenciesFlatten.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nullishTransformDependencies = exports.nullishTransformDependencies = {
+  deepEqualDependencies: _dependenciesDeepEqualGenerated.deepEqualDependencies,
+  flattenDependencies: _dependenciesFlattenGenerated.flattenDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNullishTransform: _factoriesAny.createNullishTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js
new file mode 100644
index 0000000..f2daee6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumber.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const numberDependencies = exports.numberDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNumber: _factoriesAny.createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..736f9de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesNumeric.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const numericDependencies = exports.numericDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  createNumeric: _factoriesAny.createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..9d6abee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesObjectNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ObjectNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ObjectNodeDependencies = exports.ObjectNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createObjectNode: _factoriesAny.createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js
new file mode 100644
index 0000000..22a2fc9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOct.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.octDependencies = void 0;
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const octDependencies = exports.octDependencies = {
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOct: _factoriesAny.createOct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js
new file mode 100644
index 0000000..6bf6fa4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOnes.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.onesDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const onesDependencies = exports.onesDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOnes: _factoriesAny.createOnes
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..2787034
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOperatorNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.OperatorNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const OperatorNodeDependencies = exports.OperatorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createOperatorNode: _factoriesAny.createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js
new file mode 100644
index 0000000..de904e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOr.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const orDependencies = exports.orDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOr: _factoriesAny.createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOrTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOrTransform.generated.js
new file mode 100644
index 0000000..83f0370
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesOrTransform.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orTransformDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const orTransformDependencies = exports.orTransformDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOrTransform: _factoriesAny.createOrTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..08de22b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParenthesisNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ParenthesisNodeDependencies = exports.ParenthesisNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createParenthesisNode: _factoriesAny.createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js
new file mode 100644
index 0000000..de8dace
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParse.generated.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAssignmentNode.generated.js");
+var _dependenciesBlockNodeGenerated = require("./dependenciesBlockNode.generated.js");
+var _dependenciesConditionalNodeGenerated = require("./dependenciesConditionalNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesFunctionAssignmentNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesRangeNodeGenerated = require("./dependenciesRangeNode.generated.js");
+var _dependenciesRelationalNodeGenerated = require("./dependenciesRelationalNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const parseDependencies = exports.parseDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  AssignmentNodeDependencies: _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies,
+  BlockNodeDependencies: _dependenciesBlockNodeGenerated.BlockNodeDependencies,
+  ConditionalNodeDependencies: _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies: _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  RangeNodeDependencies: _dependenciesRangeNodeGenerated.RangeNodeDependencies,
+  RelationalNodeDependencies: _dependenciesRelationalNodeGenerated.RelationalNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParse: _factoriesAny.createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js
new file mode 100644
index 0000000..9fa99ea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParser.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parserDependencies = void 0;
+var _dependenciesParserClassGenerated = require("./dependenciesParserClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const parserDependencies = exports.parserDependencies = {
+  ParserDependencies: _dependenciesParserClassGenerated.ParserDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParser: _factoriesAny.createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..665fae4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesParserClass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParserDependencies = void 0;
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ParserDependencies = exports.ParserDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createParserClass: _factoriesAny.createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..3ec52a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDependencies = void 0;
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const partitionSelectDependencies = exports.partitionSelectDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPartitionSelect: _factoriesAny.createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..dd90fb5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPermutations.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDependencies = void 0;
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const permutationsDependencies = exports.permutationsDependencies = {
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPermutations: _factoriesAny.createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js
new file mode 100644
index 0000000..d11ac28
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPhi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const phiDependencies = exports.phiDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createPhi: _factoriesAny.createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js
new file mode 100644
index 0000000..98f8d9e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const piDependencies = exports.piDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createPi: _factoriesAny.createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..492616c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPickRandom.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const pickRandomDependencies = exports.pickRandomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPickRandom: _factoriesAny.createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPinv.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPinv.generated.js
new file mode 100644
index 0000000..73f1f8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPinv.generated.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pinvDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCtransposeGenerated = require("./dependenciesCtranspose.generated.js");
+var _dependenciesDeepEqualGenerated = require("./dependenciesDeepEqual.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesDotGenerated = require("./dependenciesDot.generated.js");
+var _dependenciesDotDivideGenerated = require("./dependenciesDotDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const pinvDependencies = exports.pinvDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  ctransposeDependencies: _dependenciesCtransposeGenerated.ctransposeDependencies,
+  deepEqualDependencies: _dependenciesDeepEqualGenerated.deepEqualDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  dotDependencies: _dependenciesDotGenerated.dotDependencies,
+  dotDivideDependencies: _dependenciesDotDivideGenerated.dotDivideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPinv: _factoriesAny.createPinv
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
new file mode 100644
index 0000000..a201819
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckChargeDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckChargeDependencies = exports.planckChargeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckCharge: _factoriesAny.createPlanckCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
new file mode 100644
index 0000000..067e11d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckConstantDependencies = exports.planckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckConstant: _factoriesAny.createPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js
new file mode 100644
index 0000000..8e3fd7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckLength.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckLengthDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckLengthDependencies = exports.planckLengthDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckLength: _factoriesAny.createPlanckLength
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js
new file mode 100644
index 0000000..131852c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckMassDependencies = exports.planckMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckMass: _factoriesAny.createPlanckMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
new file mode 100644
index 0000000..742e2ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckTemperatureDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckTemperatureDependencies = exports.planckTemperatureDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckTemperature: _factoriesAny.createPlanckTemperature
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js
new file mode 100644
index 0000000..4a24085
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPlanckTime.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.planckTimeDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const planckTimeDependencies = exports.planckTimeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createPlanckTime: _factoriesAny.createPlanckTime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js
new file mode 100644
index 0000000..08b10fb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.polynomialRootDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCbrtGenerated = require("./dependenciesCbrt.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesImGenerated = require("./dependenciesIm.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesReGenerated = require("./dependenciesRe.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypeOfGenerated = require("./dependenciesTypeOf.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const polynomialRootDependencies = exports.polynomialRootDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  cbrtDependencies: _dependenciesCbrtGenerated.cbrtDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  imDependencies: _dependenciesImGenerated.imDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  reDependencies: _dependenciesReGenerated.reDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typeOfDependencies: _dependenciesTypeOfGenerated.typeOfDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createPolynomialRoot: _factoriesAny.createPolynomialRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js
new file mode 100644
index 0000000..9f3cf06
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPow.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const powDependencies = exports.powDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPow: _factoriesAny.createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js
new file mode 100644
index 0000000..61ec88a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrint.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const printDependencies = exports.printDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPrint: _factoriesAny.createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrintTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrintTransform.generated.js
new file mode 100644
index 0000000..de5b63c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesPrintTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const printTransformDependencies = exports.printTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createPrintTransform: _factoriesAny.createPrintTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js
new file mode 100644
index 0000000..81232f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProd.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDependencies = void 0;
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const prodDependencies = exports.prodDependencies = {
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createProd: _factoriesAny.createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js
new file mode 100644
index 0000000..1676078
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesProtonMass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.protonMassDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const protonMassDependencies = exports.protonMassDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createProtonMass: _factoriesAny.createProtonMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js
new file mode 100644
index 0000000..c84ce8e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQr.generated.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.qrDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+var _dependenciesConjGenerated = require("./dependenciesConj.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSignGenerated = require("./dependenciesSign.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const qrDependencies = exports.qrDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  conjDependencies: _dependenciesConjGenerated.conjDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  signDependencies: _dependenciesSignGenerated.signDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createQr: _factoriesAny.createQr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..493abb3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const quantileSeqDependencies = exports.quantileSeqDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createQuantileSeq: _factoriesAny.createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js
new file mode 100644
index 0000000..d7e563d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const quantileSeqTransformDependencies = exports.quantileSeqTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createQuantileSeqTransform: _factoriesAny.createQuantileSeqTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
new file mode 100644
index 0000000..10a77cd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantumOfCirculationDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const quantumOfCirculationDependencies = exports.quantumOfCirculationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createQuantumOfCirculation: _factoriesAny.createQuantumOfCirculation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js
new file mode 100644
index 0000000..bd3adb8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandom.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const randomDependencies = exports.randomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandom: _factoriesAny.createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..bc1bde7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRandomInt.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDependencies = void 0;
+var _dependenciesLog2Generated = require("./dependenciesLog2.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const randomIntDependencies = exports.randomIntDependencies = {
+  log2Dependencies: _dependenciesLog2Generated.log2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandomInt: _factoriesAny.createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js
new file mode 100644
index 0000000..cc7660e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRange.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rangeDependencies = exports.rangeDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRange: _factoriesAny.createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..f1e48ad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RangeDependencies = exports.RangeDependencies = {
+  createRangeClass: _factoriesAny.createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..7aad9a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RangeNodeDependencies = exports.RangeNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRangeNode: _factoriesAny.createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..0e8b174
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRangeTransform.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeTransformDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rangeTransformDependencies = exports.rangeTransformDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRangeTransform: _factoriesAny.createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..7668049
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRationalize.generated.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rationalizeDependencies = exports.rationalizeDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRationalize: _factoriesAny.createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js
new file mode 100644
index 0000000..35789c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRe.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const reDependencies = exports.reDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRe: _factoriesAny.createRe
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
new file mode 100644
index 0000000..4041248
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reducedPlanckConstantDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const reducedPlanckConstantDependencies = exports.reducedPlanckConstantDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createReducedPlanckConstant: _factoriesAny.createReducedPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..62c1626
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRelationalNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RelationalNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RelationalNodeDependencies = exports.RelationalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRelationalNode: _factoriesAny.createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..39e3ff1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReplacer.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.replacerDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const replacerDependencies = exports.replacerDependencies = {
+  createReplacer: _factoriesAny.createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js
new file mode 100644
index 0000000..7587a7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReshape.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reshapeDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const reshapeDependencies = exports.reshapeDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createReshape: _factoriesAny.createReshape
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js
new file mode 100644
index 0000000..4c9546e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResize.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resizeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const resizeDependencies = exports.resizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  createResize: _factoriesAny.createResize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js
new file mode 100644
index 0000000..7b174e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResolve.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDependencies = void 0;
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const resolveDependencies = exports.resolveDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createResolve: _factoriesAny.createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..0ee382c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesResultSet.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ResultSetDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ResultSetDependencies = exports.ResultSetDependencies = {
+  createResultSet: _factoriesAny.createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js
new file mode 100644
index 0000000..8507ead
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesReviver.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reviverDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const reviverDependencies = exports.reviverDependencies = {
+  createReviver: _factoriesAny.createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..a2add6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightArithShift.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rightArithShiftDependencies = exports.rightArithShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRightArithShift: _factoriesAny.createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..ae40dd7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRightLogShift.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rightLogShiftDependencies = exports.rightLogShiftDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRightLogShift: _factoriesAny.createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js
new file mode 100644
index 0000000..ac2bf2d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotate.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotateDependencies = void 0;
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesRotationMatrixGenerated = require("./dependenciesRotationMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rotateDependencies = exports.rotateDependencies = {
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  rotationMatrixDependencies: _dependenciesRotationMatrixGenerated.rotationMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRotate: _factoriesAny.createRotate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
new file mode 100644
index 0000000..b64a159
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotationMatrixDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCosGenerated = require("./dependenciesCos.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNormGenerated = require("./dependenciesNorm.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rotationMatrixDependencies = exports.rotationMatrixDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  cosDependencies: _dependenciesCosGenerated.cosDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  normDependencies: _dependenciesNormGenerated.normDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createRotationMatrix: _factoriesAny.createRotationMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js
new file mode 100644
index 0000000..3b222f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRound.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const roundDependencies = exports.roundDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createRound: _factoriesAny.createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js
new file mode 100644
index 0000000..39b94b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRow.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rowDependencies = exports.rowDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRow: _factoriesAny.createRow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js
new file mode 100644
index 0000000..70fc593
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRowTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowTransformDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rowTransformDependencies = exports.rowTransformDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRowTransform: _factoriesAny.createRowTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js
new file mode 100644
index 0000000..6df96b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesRydberg.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rydbergDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rydbergDependencies = exports.rydbergDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createRydberg: _factoriesAny.createRydberg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..d2257d1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT1_2Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+// eslint-disable-line camelcase
+
+const SQRT1_2Dependencies = exports.SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSQRT1_2: _factoriesAny.createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..f6b0b76
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSQRT2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Dependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SQRT2Dependencies = exports.SQRT2Dependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSQRT2: _factoriesAny.createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
new file mode 100644
index 0000000..48869b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sackurTetrodeDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sackurTetrodeDependencies = exports.sackurTetrodeDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createSackurTetrode: _factoriesAny.createSackurTetrode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSchur.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSchur.generated.js
new file mode 100644
index 0000000..38fdf66
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSchur.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.schurDependencies = void 0;
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesNormGenerated = require("./dependenciesNorm.generated.js");
+var _dependenciesQrGenerated = require("./dependenciesQr.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const schurDependencies = exports.schurDependencies = {
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  normDependencies: _dependenciesNormGenerated.normDependencies,
+  qrDependencies: _dependenciesQrGenerated.qrDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSchur: _factoriesAny.createSchur
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js
new file mode 100644
index 0000000..7c17436
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSec.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const secDependencies = exports.secDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSec: _factoriesAny.createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js
new file mode 100644
index 0000000..954a48d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSech.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sechDependencies = exports.sechDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSech: _factoriesAny.createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
new file mode 100644
index 0000000..25f2773
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secondRadiationDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const secondRadiationDependencies = exports.secondRadiationDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createSecondRadiation: _factoriesAny.createSecondRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js
new file mode 100644
index 0000000..7ad7c4d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetCartesian.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setCartesianDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setCartesianDependencies = exports.setCartesianDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetCartesian: _factoriesAny.createSetCartesian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js
new file mode 100644
index 0000000..048786c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDifference.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDifferenceDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setDifferenceDependencies = exports.setDifferenceDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetDifference: _factoriesAny.createSetDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js
new file mode 100644
index 0000000..047735f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetDistinct.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDistinctDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setDistinctDependencies = exports.setDistinctDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetDistinct: _factoriesAny.createSetDistinct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js
new file mode 100644
index 0000000..7f24e3a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIntersect.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIntersectDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setIntersectDependencies = exports.setIntersectDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetIntersect: _factoriesAny.createSetIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
new file mode 100644
index 0000000..2171853
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIsSubsetDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setIsSubsetDependencies = exports.setIsSubsetDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetIsSubset: _factoriesAny.createSetIsSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
new file mode 100644
index 0000000..404a796
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setMultiplicityDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setMultiplicityDependencies = exports.setMultiplicityDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetMultiplicity: _factoriesAny.createSetMultiplicity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js
new file mode 100644
index 0000000..d35c0d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetPowerset.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setPowersetDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setPowersetDependencies = exports.setPowersetDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetPowerset: _factoriesAny.createSetPowerset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js
new file mode 100644
index 0000000..9b821a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSize.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSizeDependencies = void 0;
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setSizeDependencies = exports.setSizeDependencies = {
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetSize: _factoriesAny.createSetSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
new file mode 100644
index 0000000..6c4bf9b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSymDifferenceDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesSetDifferenceGenerated = require("./dependenciesSetDifference.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setSymDifferenceDependencies = exports.setSymDifferenceDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  setDifferenceDependencies: _dependenciesSetDifferenceGenerated.setDifferenceDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetSymDifference: _factoriesAny.createSetSymDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js
new file mode 100644
index 0000000..0ca3b74
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSetUnion.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setUnionDependencies = void 0;
+var _dependenciesIndexClassGenerated = require("./dependenciesIndexClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesSetIntersectGenerated = require("./dependenciesSetIntersect.generated.js");
+var _dependenciesSetSymDifferenceGenerated = require("./dependenciesSetSymDifference.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const setUnionDependencies = exports.setUnionDependencies = {
+  IndexDependencies: _dependenciesIndexClassGenerated.IndexDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  setIntersectDependencies: _dependenciesSetIntersectGenerated.setIntersectDependencies,
+  setSymDifferenceDependencies: _dependenciesSetSymDifferenceGenerated.setSymDifferenceDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSetUnion: _factoriesAny.createSetUnion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js
new file mode 100644
index 0000000..8a8d566
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSign.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _dependenciesComplexGenerated = require("./dependenciesComplex.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const signDependencies = exports.signDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  complexDependencies: _dependenciesComplexGenerated.complexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSign: _factoriesAny.createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..cc38039
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplify.generated.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesReplacerGenerated = require("./dependenciesReplacer.generated.js");
+var _dependenciesResolveGenerated = require("./dependenciesResolve.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyDependencies = exports.simplifyDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  replacerDependencies: _dependenciesReplacerGenerated.replacerDependencies,
+  resolveDependencies: _dependenciesResolveGenerated.resolveDependencies,
+  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplify: _factoriesAny.createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js
new file mode 100644
index 0000000..a74a21d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyConstantDependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesFractionGenerated = require("./dependenciesFraction.generated.js");
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyConstantDependencies = exports.simplifyConstantDependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  fractionDependencies: _dependenciesFractionGenerated.fractionDependencies,
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplifyConstant: _factoriesAny.createSimplifyConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..24ab57b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyCoreDependencies = exports.simplifyCoreDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplifyCore: _factoriesAny.createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js
new file mode 100644
index 0000000..d598bb1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSin.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sinDependencies = exports.sinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSin: _factoriesAny.createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js
new file mode 100644
index 0000000..3ca69c5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSinh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sinhDependencies = exports.sinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSinh: _factoriesAny.createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js
new file mode 100644
index 0000000..4d61dfe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSize.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sizeDependencies = exports.sizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSize: _factoriesAny.createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js
new file mode 100644
index 0000000..ce824d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSlu.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sluDependencies = void 0;
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sluDependencies = exports.sluDependencies = {
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSlu: _factoriesAny.createSlu
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..5c504a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmaller.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const smallerDependencies = exports.smallerDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmaller: _factoriesAny.createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..ed4615b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSmallerEq.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const smallerEqDependencies = exports.smallerEqDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmallerEq: _factoriesAny.createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSolveODE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSolveODE.generated.js
new file mode 100644
index 0000000..b23de99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSolveODE.generated.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.solveODEDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMaxGenerated = require("./dependenciesMax.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const solveODEDependencies = exports.solveODEDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  maxDependencies: _dependenciesMaxGenerated.maxDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createSolveODE: _factoriesAny.createSolveODE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js
new file mode 100644
index 0000000..94036fd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSort.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sortDependencies = void 0;
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesCompareNatural.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sortDependencies = exports.sortDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  compareNaturalDependencies: _dependenciesCompareNaturalGenerated.compareNaturalDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSort: _factoriesAny.createSort
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js
new file mode 100644
index 0000000..6ffda1e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpaClass.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SpaDependencies = void 0;
+var _dependenciesFibonacciHeapClassGenerated = require("./dependenciesFibonacciHeapClass.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SpaDependencies = exports.SpaDependencies = {
+  FibonacciHeapDependencies: _dependenciesFibonacciHeapClassGenerated.FibonacciHeapDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  createSpaClass: _factoriesAny.createSpaClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js
new file mode 100644
index 0000000..89047ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparse.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sparseDependencies = void 0;
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sparseDependencies = exports.sparseDependencies = {
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSparse: _factoriesAny.createSparse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
new file mode 100644
index 0000000..af95c83
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SparseMatrixDependencies = void 0;
+var _dependenciesMatrixClassGenerated = require("./dependenciesMatrixClass.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SparseMatrixDependencies = exports.SparseMatrixDependencies = {
+  MatrixDependencies: _dependenciesMatrixClassGenerated.MatrixDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSparseMatrixClass: _factoriesAny.createSparseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
new file mode 100644
index 0000000..6a0daf2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.speedOfLightDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const speedOfLightDependencies = exports.speedOfLightDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createSpeedOfLight: _factoriesAny.createSpeedOfLight
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js
new file mode 100644
index 0000000..244bb24
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSplitUnit.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.splitUnitDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const splitUnitDependencies = exports.splitUnitDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSplitUnit: _factoriesAny.createSplitUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..693e1b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrt.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sqrtDependencies = exports.sqrtDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrt: _factoriesAny.createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js
new file mode 100644
index 0000000..c02cf69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqrtm.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtmDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesInvGenerated = require("./dependenciesInv.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesMaxGenerated = require("./dependenciesMax.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sqrtmDependencies = exports.sqrtmDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  invDependencies: _dependenciesInvGenerated.invDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  maxDependencies: _dependenciesMaxGenerated.maxDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrtm: _factoriesAny.createSqrtm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js
new file mode 100644
index 0000000..fe2dc1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSquare.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const squareDependencies = exports.squareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSquare: _factoriesAny.createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js
new file mode 100644
index 0000000..bce917c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSqueeze.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squeezeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const squeezeDependencies = exports.squeezeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqueeze: _factoriesAny.createSqueeze
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js
new file mode 100644
index 0000000..3a20a73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStd.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDependencies = void 0;
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stdDependencies = exports.stdDependencies = {
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStd: _factoriesAny.createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..9869410
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStdTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdTransformDependencies = void 0;
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stdTransformDependencies = exports.stdTransformDependencies = {
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStdTransform: _factoriesAny.createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
new file mode 100644
index 0000000..f5c4ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stefanBoltzmannDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stefanBoltzmannDependencies = exports.stefanBoltzmannDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createStefanBoltzmann: _factoriesAny.createStefanBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..7f7a6d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesStirlingS2.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Dependencies = void 0;
+var _dependenciesBignumberGenerated = require("./dependenciesBignumber.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stirlingS2Dependencies = exports.stirlingS2Dependencies = {
+  bignumberDependencies: _dependenciesBignumberGenerated.bignumberDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createStirlingS2: _factoriesAny.createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js
new file mode 100644
index 0000000..2a14a55
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesString.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stringDependencies = exports.stringDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createString: _factoriesAny.createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js
new file mode 100644
index 0000000..9f658cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubset.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subsetDependencies = exports.subsetDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createSubset: _factoriesAny.createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..d85fe5a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesZerosGenerated = require("./dependenciesZeros.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subsetTransformDependencies = exports.subsetTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  zerosDependencies: _dependenciesZerosGenerated.zerosDependencies,
+  createSubsetTransform: _factoriesAny.createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..784a909
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtract.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesUnaryMinus.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subtractDependencies = exports.subtractDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryMinusDependencies: _dependenciesUnaryMinusGenerated.unaryMinusDependencies,
+  createSubtract: _factoriesAny.createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtractScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtractScalar.generated.js
new file mode 100644
index 0000000..33608da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSubtractScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subtractScalarDependencies = exports.subtractScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubtractScalar: _factoriesAny.createSubtractScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js
new file mode 100644
index 0000000..78927db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSum.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sumDependencies = exports.sumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSum: _factoriesAny.createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..1961331
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSumTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sumTransformDependencies = exports.sumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSumTransform: _factoriesAny.createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSylvester.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSylvester.generated.js
new file mode 100644
index 0000000..b5db13f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSylvester.generated.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sylvesterDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesIdentityGenerated = require("./dependenciesIdentity.generated.js");
+var _dependenciesIndexGenerated = require("./dependenciesIndex.generated.js");
+var _dependenciesLusolveGenerated = require("./dependenciesLusolve.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMatrixFromColumnsGenerated = require("./dependenciesMatrixFromColumns.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesRange.generated.js");
+var _dependenciesSchurGenerated = require("./dependenciesSchur.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTransposeGenerated = require("./dependenciesTranspose.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sylvesterDependencies = exports.sylvesterDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  identityDependencies: _dependenciesIdentityGenerated.identityDependencies,
+  indexDependencies: _dependenciesIndexGenerated.indexDependencies,
+  lusolveDependencies: _dependenciesLusolveGenerated.lusolveDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  matrixFromColumnsDependencies: _dependenciesMatrixFromColumnsGenerated.matrixFromColumnsDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  rangeDependencies: _dependenciesRangeGenerated.rangeDependencies,
+  schurDependencies: _dependenciesSchurGenerated.schurDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  transposeDependencies: _dependenciesTransposeGenerated.transposeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSylvester: _factoriesAny.createSylvester
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..a34e548
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SymbolNodeDependencies = void 0;
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SymbolNodeDependencies = exports.SymbolNodeDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createSymbolNode: _factoriesAny.createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
new file mode 100644
index 0000000..562c7c7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.symbolicEqualDependencies = void 0;
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const symbolicEqualDependencies = exports.symbolicEqualDependencies = {
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSymbolicEqual: _factoriesAny.createSymbolicEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js
new file mode 100644
index 0000000..df5060e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTan.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tanDependencies = exports.tanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTan: _factoriesAny.createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js
new file mode 100644
index 0000000..8b03fed
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTanh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tanhDependencies = exports.tanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTanh: _factoriesAny.createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js
new file mode 100644
index 0000000..3cbd68d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTau.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tauDependencies = exports.tauDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createTau: _factoriesAny.createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
new file mode 100644
index 0000000..6aa9bae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.thomsonCrossSectionDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const thomsonCrossSectionDependencies = exports.thomsonCrossSectionDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createThomsonCrossSection: _factoriesAny.createThomsonCrossSection
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js
new file mode 100644
index 0000000..055da52
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTo.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toDependencies = void 0;
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const toDependencies = exports.toDependencies = {
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTo: _factoriesAny.createTo
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesToBest.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesToBest.generated.js
new file mode 100644
index 0000000..1fdcd30
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesToBest.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toBestDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const toBestDependencies = exports.toBestDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createToBest: _factoriesAny.createToBest
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js
new file mode 100644
index 0000000..0101245
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrace.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.traceDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const traceDependencies = exports.traceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTrace: _factoriesAny.createTrace
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js
new file mode 100644
index 0000000..a50a2e6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTranspose.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transposeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const transposeDependencies = exports.transposeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTranspose: _factoriesAny.createTranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js
new file mode 100644
index 0000000..7a7f863
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTrue.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const trueDependencies = exports.trueDependencies = {
+  createTrue: _factoriesAny.createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..2d69b03
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTypeOf.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const typeOfDependencies = exports.typeOfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTypeOf: _factoriesAny.createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js
new file mode 100644
index 0000000..1cec5b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesTyped.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const typedDependencies = exports.typedDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  createTyped: _factoriesAny.createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..4235a84
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unaryMinusDependencies = exports.unaryMinusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryMinus: _factoriesAny.createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..7f50a4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDependencies = void 0;
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unaryPlusDependencies = exports.unaryPlusDependencies = {
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryPlus: _factoriesAny.createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..71e47a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnequal.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unequalDependencies = exports.unequalDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnequal: _factoriesAny.createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js
new file mode 100644
index 0000000..39ee7e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitClass.generated.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.UnitDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesFractionClassGenerated = require("./dependenciesFractionClass.generated.js");
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesFixGenerated = require("./dependenciesFix.generated.js");
+var _dependenciesFormatGenerated = require("./dependenciesFormat.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesToBestGenerated = require("./dependenciesToBest.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const UnitDependencies = exports.UnitDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  FractionDependencies: _dependenciesFractionClassGenerated.FractionDependencies,
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  fixDependencies: _dependenciesFixGenerated.fixDependencies,
+  formatDependencies: _dependenciesFormatGenerated.formatDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  toBestDependencies: _dependenciesToBestGenerated.toBestDependencies,
+  createUnitClass: _factoriesAny.createUnitClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js
new file mode 100644
index 0000000..fc4cbfb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUnitFunction.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unitDependencies = void 0;
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unitDependencies = exports.unitDependencies = {
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnitFunction: _factoriesAny.createUnitFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..21959cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercaseE.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.EDependencies = void 0;
+var _dependenciesEGenerated = require("./dependenciesE.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const EDependencies = exports.EDependencies = {
+  eDependencies: _dependenciesEGenerated.eDependencies,
+  createUppercaseE: _factoriesAny.createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..3503d4c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUppercasePi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PIDependencies = void 0;
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const PIDependencies = exports.PIDependencies = {
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  createUppercasePi: _factoriesAny.createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js
new file mode 100644
index 0000000..e54ac02
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolve.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const usolveDependencies = exports.usolveDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUsolve: _factoriesAny.createUsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js
new file mode 100644
index 0000000..60f017b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesUsolveAll.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveAllDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const usolveAllDependencies = exports.usolveAllDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUsolveAll: _factoriesAny.createUsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
new file mode 100644
index 0000000..4619717
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.vacuumImpedanceDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const vacuumImpedanceDependencies = exports.vacuumImpedanceDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createVacuumImpedance: _factoriesAny.createVacuumImpedance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js
new file mode 100644
index 0000000..ac9bfc9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVariance.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const varianceDependencies = exports.varianceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVariance: _factoriesAny.createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..a8661c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const varianceTransformDependencies = exports.varianceTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVarianceTransform: _factoriesAny.createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js
new file mode 100644
index 0000000..8987e6b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesVersion.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDependencies = void 0;
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const versionDependencies = exports.versionDependencies = {
+  createVersion: _factoriesAny.createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
new file mode 100644
index 0000000..666712d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.weakMixingAngleDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const weakMixingAngleDependencies = exports.weakMixingAngleDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  createWeakMixingAngle: _factoriesAny.createWeakMixingAngle
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
new file mode 100644
index 0000000..ffead9b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.wienDisplacementDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesUnitClassGenerated = require("./dependenciesUnitClass.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const wienDisplacementDependencies = exports.wienDisplacementDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  UnitDependencies: _dependenciesUnitClassGenerated.UnitDependencies,
+  createWienDisplacement: _factoriesAny.createWienDisplacement
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..5d9ffbc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXgcd.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const xgcdDependencies = exports.xgcdDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXgcd: _factoriesAny.createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js
new file mode 100644
index 0000000..ce4651d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesXor.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDependencies = void 0;
+var _dependenciesDenseMatrixClassGenerated = require("./dependenciesDenseMatrixClass.generated.js");
+var _dependenciesSparseMatrixClassGenerated = require("./dependenciesSparseMatrixClass.generated.js");
+var _dependenciesConcatGenerated = require("./dependenciesConcat.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const xorDependencies = exports.xorDependencies = {
+  DenseMatrixDependencies: _dependenciesDenseMatrixClassGenerated.DenseMatrixDependencies,
+  SparseMatrixDependencies: _dependenciesSparseMatrixClassGenerated.SparseMatrixDependencies,
+  concatDependencies: _dependenciesConcatGenerated.concatDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXor: _factoriesAny.createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js
new file mode 100644
index 0000000..3a5e95a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeros.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zerosDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const zerosDependencies = exports.zerosDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createZeros: _factoriesAny.createZeros
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeta.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeta.generated.js
new file mode 100644
index 0000000..007d273
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZeta.generated.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zetaDependencies = void 0;
+var _dependenciesBigNumberClassGenerated = require("./dependenciesBigNumberClass.generated.js");
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const zetaDependencies = exports.zetaDependencies = {
+  BigNumberDependencies: _dependenciesBigNumberClassGenerated.BigNumberDependencies,
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createZeta: _factoriesAny.createZeta
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZpk2tf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZpk2tf.generated.js
new file mode 100644
index 0000000..926b4ea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesAny/dependenciesZpk2tf.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zpk2tfDependencies = void 0;
+var _dependenciesComplexClassGenerated = require("./dependenciesComplexClass.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesAny = require("../../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const zpk2tfDependencies = exports.zpk2tfDependencies = {
+  ComplexDependencies: _dependenciesComplexClassGenerated.ComplexDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createZpk2tf: _factoriesAny.createZpk2tf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js
new file mode 100644
index 0000000..c93b3d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber.generated.js
@@ -0,0 +1,1447 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "AccessorNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAccessorNodeGenerated.AccessorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ArrayNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesArrayNodeGenerated.ArrayNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "AssignmentNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "BlockNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBlockNodeGenerated.BlockNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ChainDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesChainClassGenerated.ChainDependencies;
+  }
+});
+Object.defineProperty(exports, "ConditionalNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ConstantNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesConstantNodeGenerated.ConstantNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUppercaseEGenerated.EDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionAssignmentNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "FunctionNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFunctionNodeGenerated.FunctionNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "HelpDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHelpClassGenerated.HelpDependencies;
+  }
+});
+Object.defineProperty(exports, "IndexNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexNodeGenerated.IndexNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "InfinityDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesInfinityGenerated.InfinityDependencies;
+  }
+});
+Object.defineProperty(exports, "LN10Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLN10Generated.LN10Dependencies;
+  }
+});
+Object.defineProperty(exports, "LN2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLN2Generated.LN2Dependencies;
+  }
+});
+Object.defineProperty(exports, "LOG10EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLOG10EGenerated.LOG10EDependencies;
+  }
+});
+Object.defineProperty(exports, "LOG2EDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLOG2EGenerated.LOG2EDependencies;
+  }
+});
+Object.defineProperty(exports, "NaNDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNaNGenerated.NaNDependencies;
+  }
+});
+Object.defineProperty(exports, "NodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNodeGenerated.NodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ObjectNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesObjectNodeGenerated.ObjectNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "OperatorNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOperatorNodeGenerated.OperatorNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "PIDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUppercasePiGenerated.PIDependencies;
+  }
+});
+Object.defineProperty(exports, "ParenthesisNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ParserDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParserClassGenerated.ParserDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeClassGenerated.RangeDependencies;
+  }
+});
+Object.defineProperty(exports, "RangeNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeNodeGenerated.RangeNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "RelationalNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRelationalNodeGenerated.RelationalNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "ResultSetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesResultSetGenerated.ResultSetDependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT1_2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSQRT1_2Generated.SQRT1_2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SQRT2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSQRT2Generated.SQRT2Dependencies;
+  }
+});
+Object.defineProperty(exports, "SymbolNodeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSymbolNodeGenerated.SymbolNodeDependencies;
+  }
+});
+Object.defineProperty(exports, "absDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAbsGenerated.absDependencies;
+  }
+});
+Object.defineProperty(exports, "acosDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcosGenerated.acosDependencies;
+  }
+});
+Object.defineProperty(exports, "acoshDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcoshGenerated.acoshDependencies;
+  }
+});
+Object.defineProperty(exports, "acotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcotGenerated.acotDependencies;
+  }
+});
+Object.defineProperty(exports, "acothDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcothGenerated.acothDependencies;
+  }
+});
+Object.defineProperty(exports, "acscDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcscGenerated.acscDependencies;
+  }
+});
+Object.defineProperty(exports, "acschDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAcschGenerated.acschDependencies;
+  }
+});
+Object.defineProperty(exports, "addDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAddGenerated.addDependencies;
+  }
+});
+Object.defineProperty(exports, "addScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAddScalarGenerated.addScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "all", {
+  enumerable: true,
+  get: function () {
+    return _allFactoriesNumber.all;
+  }
+});
+Object.defineProperty(exports, "andDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAndGenerated.andDependencies;
+  }
+});
+Object.defineProperty(exports, "asecDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsecGenerated.asecDependencies;
+  }
+});
+Object.defineProperty(exports, "asechDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsechGenerated.asechDependencies;
+  }
+});
+Object.defineProperty(exports, "asinDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsinGenerated.asinDependencies;
+  }
+});
+Object.defineProperty(exports, "asinhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAsinhGenerated.asinhDependencies;
+  }
+});
+Object.defineProperty(exports, "atan2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtan2Generated.atan2Dependencies;
+  }
+});
+Object.defineProperty(exports, "atanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtanGenerated.atanDependencies;
+  }
+});
+Object.defineProperty(exports, "atanhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesAtanhGenerated.atanhDependencies;
+  }
+});
+Object.defineProperty(exports, "bellNumbersDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBellNumbersGenerated.bellNumbersDependencies;
+  }
+});
+Object.defineProperty(exports, "bigintDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBigintGenerated.bigintDependencies;
+  }
+});
+Object.defineProperty(exports, "bitAndDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitAndGenerated.bitAndDependencies;
+  }
+});
+Object.defineProperty(exports, "bitNotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitNotGenerated.bitNotDependencies;
+  }
+});
+Object.defineProperty(exports, "bitOrDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitOrGenerated.bitOrDependencies;
+  }
+});
+Object.defineProperty(exports, "bitXorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBitXorGenerated.bitXorDependencies;
+  }
+});
+Object.defineProperty(exports, "booleanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesBooleanGenerated.booleanDependencies;
+  }
+});
+Object.defineProperty(exports, "catalanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCatalanGenerated.catalanDependencies;
+  }
+});
+Object.defineProperty(exports, "cbrtDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCbrtGenerated.cbrtDependencies;
+  }
+});
+Object.defineProperty(exports, "ceilDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCeilGenerated.ceilDependencies;
+  }
+});
+Object.defineProperty(exports, "chainDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesChainGenerated.chainDependencies;
+  }
+});
+Object.defineProperty(exports, "cloneDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCloneGenerated.cloneDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCombinationsGenerated.combinationsDependencies;
+  }
+});
+Object.defineProperty(exports, "combinationsWithRepDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCombinationsWithRepGenerated.combinationsWithRepDependencies;
+  }
+});
+Object.defineProperty(exports, "compareDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareGenerated.compareDependencies;
+  }
+});
+Object.defineProperty(exports, "compareNaturalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareNaturalGenerated.compareNaturalDependencies;
+  }
+});
+Object.defineProperty(exports, "compareTextDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompareTextGenerated.compareTextDependencies;
+  }
+});
+Object.defineProperty(exports, "compileDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompileGenerated.compileDependencies;
+  }
+});
+Object.defineProperty(exports, "compositionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCompositionGenerated.compositionDependencies;
+  }
+});
+Object.defineProperty(exports, "corrDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCorrGenerated.corrDependencies;
+  }
+});
+Object.defineProperty(exports, "cosDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCosGenerated.cosDependencies;
+  }
+});
+Object.defineProperty(exports, "coshDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCoshGenerated.coshDependencies;
+  }
+});
+Object.defineProperty(exports, "cotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCotGenerated.cotDependencies;
+  }
+});
+Object.defineProperty(exports, "cothDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCothGenerated.cothDependencies;
+  }
+});
+Object.defineProperty(exports, "cscDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCscGenerated.cscDependencies;
+  }
+});
+Object.defineProperty(exports, "cschDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCschGenerated.cschDependencies;
+  }
+});
+Object.defineProperty(exports, "cubeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCubeGenerated.cubeDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCumSumGenerated.cumsumDependencies;
+  }
+});
+Object.defineProperty(exports, "cumsumTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesCumSumTransformGenerated.cumsumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "deepEqualDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDeepEqualGenerated.deepEqualDependencies;
+  }
+});
+Object.defineProperty(exports, "derivativeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDerivativeGenerated.derivativeDependencies;
+  }
+});
+Object.defineProperty(exports, "divideDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDivideGenerated.divideDependencies;
+  }
+});
+Object.defineProperty(exports, "divideScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesDivideScalarGenerated.divideScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "eDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEGenerated.eDependencies;
+  }
+});
+Object.defineProperty(exports, "equalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualGenerated.equalDependencies;
+  }
+});
+Object.defineProperty(exports, "equalScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualScalarGenerated.equalScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "equalTextDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEqualTextGenerated.equalTextDependencies;
+  }
+});
+Object.defineProperty(exports, "erfDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesErfGenerated.erfDependencies;
+  }
+});
+Object.defineProperty(exports, "evaluateDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesEvaluateGenerated.evaluateDependencies;
+  }
+});
+Object.defineProperty(exports, "expDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesExpGenerated.expDependencies;
+  }
+});
+Object.defineProperty(exports, "expm1Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesExpm1Generated.expm1Dependencies;
+  }
+});
+Object.defineProperty(exports, "factorialDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFactorialGenerated.factorialDependencies;
+  }
+});
+Object.defineProperty(exports, "falseDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFalseGenerated.falseDependencies;
+  }
+});
+Object.defineProperty(exports, "filterDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFilterGenerated.filterDependencies;
+  }
+});
+Object.defineProperty(exports, "filterTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFilterTransformGenerated.filterTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "fixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFixGenerated.fixDependencies;
+  }
+});
+Object.defineProperty(exports, "floorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFloorGenerated.floorDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesForEachGenerated.forEachDependencies;
+  }
+});
+Object.defineProperty(exports, "forEachTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesForEachTransformGenerated.forEachTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "formatDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesFormatGenerated.formatDependencies;
+  }
+});
+Object.defineProperty(exports, "gammaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGammaGenerated.gammaDependencies;
+  }
+});
+Object.defineProperty(exports, "gcdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesGcdGenerated.gcdDependencies;
+  }
+});
+Object.defineProperty(exports, "hasNumericValueDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHasNumericValueGenerated.hasNumericValueDependencies;
+  }
+});
+Object.defineProperty(exports, "helpDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHelpGenerated.helpDependencies;
+  }
+});
+Object.defineProperty(exports, "hypotDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesHypotGenerated.hypotDependencies;
+  }
+});
+Object.defineProperty(exports, "indexDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIndexGenerated.indexDependencies;
+  }
+});
+Object.defineProperty(exports, "isIntegerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsIntegerGenerated.isIntegerDependencies;
+  }
+});
+Object.defineProperty(exports, "isNaNDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNaNGenerated.isNaNDependencies;
+  }
+});
+Object.defineProperty(exports, "isNegativeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNegativeGenerated.isNegativeDependencies;
+  }
+});
+Object.defineProperty(exports, "isNumericDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsNumericGenerated.isNumericDependencies;
+  }
+});
+Object.defineProperty(exports, "isPositiveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsPositiveGenerated.isPositiveDependencies;
+  }
+});
+Object.defineProperty(exports, "isPrimeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsPrimeGenerated.isPrimeDependencies;
+  }
+});
+Object.defineProperty(exports, "isZeroDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesIsZeroGenerated.isZeroDependencies;
+  }
+});
+Object.defineProperty(exports, "largerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLargerGenerated.largerDependencies;
+  }
+});
+Object.defineProperty(exports, "largerEqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLargerEqGenerated.largerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "lcmDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLcmGenerated.lcmDependencies;
+  }
+});
+Object.defineProperty(exports, "leftShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLeftShiftGenerated.leftShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "lgammaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLgammaGenerated.lgammaDependencies;
+  }
+});
+Object.defineProperty(exports, "log10Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog10Generated.log10Dependencies;
+  }
+});
+Object.defineProperty(exports, "log1pDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog1pGenerated.log1pDependencies;
+  }
+});
+Object.defineProperty(exports, "log2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLog2Generated.log2Dependencies;
+  }
+});
+Object.defineProperty(exports, "logDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesLogGenerated.logDependencies;
+  }
+});
+Object.defineProperty(exports, "madDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMadGenerated.madDependencies;
+  }
+});
+Object.defineProperty(exports, "mapDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapGenerated.mapDependencies;
+  }
+});
+Object.defineProperty(exports, "mapSlicesDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapSlicesGenerated.mapSlicesDependencies;
+  }
+});
+Object.defineProperty(exports, "mapSlicesTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapSlicesTransformGenerated.mapSlicesTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "mapTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMapTransformGenerated.mapTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "matrixDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMatrixGenerated.matrixDependencies;
+  }
+});
+Object.defineProperty(exports, "maxDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMaxGenerated.maxDependencies;
+  }
+});
+Object.defineProperty(exports, "maxTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMaxTransformGenerated.maxTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "meanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMeanGenerated.meanDependencies;
+  }
+});
+Object.defineProperty(exports, "meanTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMeanTransformGenerated.meanTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "medianDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMedianGenerated.medianDependencies;
+  }
+});
+Object.defineProperty(exports, "minDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMinGenerated.minDependencies;
+  }
+});
+Object.defineProperty(exports, "minTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMinTransformGenerated.minTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "modDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesModGenerated.modDependencies;
+  }
+});
+Object.defineProperty(exports, "modeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesModeGenerated.modeDependencies;
+  }
+});
+Object.defineProperty(exports, "multinomialDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultinomialGenerated.multinomialDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultiplyGenerated.multiplyDependencies;
+  }
+});
+Object.defineProperty(exports, "multiplyScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "normDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNormGenerated.normDependencies;
+  }
+});
+Object.defineProperty(exports, "notDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNotGenerated.notDependencies;
+  }
+});
+Object.defineProperty(exports, "nthRootDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNthRootGenerated.nthRootDependencies;
+  }
+});
+Object.defineProperty(exports, "nullDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNullGenerated.nullDependencies;
+  }
+});
+Object.defineProperty(exports, "numberDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNumberGenerated.numberDependencies;
+  }
+});
+Object.defineProperty(exports, "numericDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesNumericGenerated.numericDependencies;
+  }
+});
+Object.defineProperty(exports, "orDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesOrGenerated.orDependencies;
+  }
+});
+Object.defineProperty(exports, "parseDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParseGenerated.parseDependencies;
+  }
+});
+Object.defineProperty(exports, "parserDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesParserGenerated.parserDependencies;
+  }
+});
+Object.defineProperty(exports, "partitionSelectDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPartitionSelectGenerated.partitionSelectDependencies;
+  }
+});
+Object.defineProperty(exports, "permutationsDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPermutationsGenerated.permutationsDependencies;
+  }
+});
+Object.defineProperty(exports, "phiDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPhiGenerated.phiDependencies;
+  }
+});
+Object.defineProperty(exports, "piDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPiGenerated.piDependencies;
+  }
+});
+Object.defineProperty(exports, "pickRandomDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPickRandomGenerated.pickRandomDependencies;
+  }
+});
+Object.defineProperty(exports, "powDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPowGenerated.powDependencies;
+  }
+});
+Object.defineProperty(exports, "printDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesPrintGenerated.printDependencies;
+  }
+});
+Object.defineProperty(exports, "prodDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesProdGenerated.prodDependencies;
+  }
+});
+Object.defineProperty(exports, "quantileSeqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesQuantileSeqGenerated.quantileSeqDependencies;
+  }
+});
+Object.defineProperty(exports, "randomDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRandomGenerated.randomDependencies;
+  }
+});
+Object.defineProperty(exports, "randomIntDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRandomIntGenerated.randomIntDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeGenerated.rangeDependencies;
+  }
+});
+Object.defineProperty(exports, "rangeTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRangeTransformGenerated.rangeTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "rationalizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRationalizeGenerated.rationalizeDependencies;
+  }
+});
+Object.defineProperty(exports, "replacerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReplacerGenerated.replacerDependencies;
+  }
+});
+Object.defineProperty(exports, "resolveDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesResolveGenerated.resolveDependencies;
+  }
+});
+Object.defineProperty(exports, "reviverDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesReviverGenerated.reviverDependencies;
+  }
+});
+Object.defineProperty(exports, "rightArithShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRightArithShiftGenerated.rightArithShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "rightLogShiftDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRightLogShiftGenerated.rightLogShiftDependencies;
+  }
+});
+Object.defineProperty(exports, "roundDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesRoundGenerated.roundDependencies;
+  }
+});
+Object.defineProperty(exports, "secDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSecGenerated.secDependencies;
+  }
+});
+Object.defineProperty(exports, "sechDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSechGenerated.sechDependencies;
+  }
+});
+Object.defineProperty(exports, "signDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSignGenerated.signDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyConstantDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyCoreDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies;
+  }
+});
+Object.defineProperty(exports, "simplifyDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSimplifyGenerated.simplifyDependencies;
+  }
+});
+Object.defineProperty(exports, "sinDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSinGenerated.sinDependencies;
+  }
+});
+Object.defineProperty(exports, "sinhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSinhGenerated.sinhDependencies;
+  }
+});
+Object.defineProperty(exports, "sizeDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSizeGenerated.sizeDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSmallerGenerated.smallerDependencies;
+  }
+});
+Object.defineProperty(exports, "smallerEqDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSmallerEqGenerated.smallerEqDependencies;
+  }
+});
+Object.defineProperty(exports, "sqrtDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSqrtGenerated.sqrtDependencies;
+  }
+});
+Object.defineProperty(exports, "squareDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSquareGenerated.squareDependencies;
+  }
+});
+Object.defineProperty(exports, "stdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStdGenerated.stdDependencies;
+  }
+});
+Object.defineProperty(exports, "stdTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStdTransformGenerated.stdTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "stirlingS2Dependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStirlingS2Generated.stirlingS2Dependencies;
+  }
+});
+Object.defineProperty(exports, "stringDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesStringGenerated.stringDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubsetGenerated.subsetDependencies;
+  }
+});
+Object.defineProperty(exports, "subsetTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubsetTransformGenerated.subsetTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubtractGenerated.subtractDependencies;
+  }
+});
+Object.defineProperty(exports, "subtractScalarDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSubtractScalarGenerated.subtractScalarDependencies;
+  }
+});
+Object.defineProperty(exports, "sumDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSumGenerated.sumDependencies;
+  }
+});
+Object.defineProperty(exports, "sumTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesSumTransformGenerated.sumTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "tanDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTanGenerated.tanDependencies;
+  }
+});
+Object.defineProperty(exports, "tanhDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTanhGenerated.tanhDependencies;
+  }
+});
+Object.defineProperty(exports, "tauDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTauGenerated.tauDependencies;
+  }
+});
+Object.defineProperty(exports, "trueDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTrueGenerated.trueDependencies;
+  }
+});
+Object.defineProperty(exports, "typeOfDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTypeOfGenerated.typeOfDependencies;
+  }
+});
+Object.defineProperty(exports, "typedDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesTypedGenerated.typedDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryMinusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnaryMinusGenerated.unaryMinusDependencies;
+  }
+});
+Object.defineProperty(exports, "unaryPlusDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnaryPlusGenerated.unaryPlusDependencies;
+  }
+});
+Object.defineProperty(exports, "unequalDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesUnequalGenerated.unequalDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVarianceGenerated.varianceDependencies;
+  }
+});
+Object.defineProperty(exports, "varianceTransformDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVarianceTransformGenerated.varianceTransformDependencies;
+  }
+});
+Object.defineProperty(exports, "versionDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesVersionGenerated.versionDependencies;
+  }
+});
+Object.defineProperty(exports, "xgcdDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesXgcdGenerated.xgcdDependencies;
+  }
+});
+Object.defineProperty(exports, "xorDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesXorGenerated.xorDependencies;
+  }
+});
+Object.defineProperty(exports, "zetaDependencies", {
+  enumerable: true,
+  get: function () {
+    return _dependenciesZetaGenerated.zetaDependencies;
+  }
+});
+var _dependenciesAbsGenerated = require("./dependenciesNumber/dependenciesAbs.generated.js");
+var _dependenciesAccessorNodeGenerated = require("./dependenciesNumber/dependenciesAccessorNode.generated.js");
+var _dependenciesAcosGenerated = require("./dependenciesNumber/dependenciesAcos.generated.js");
+var _dependenciesAcoshGenerated = require("./dependenciesNumber/dependenciesAcosh.generated.js");
+var _dependenciesAcotGenerated = require("./dependenciesNumber/dependenciesAcot.generated.js");
+var _dependenciesAcothGenerated = require("./dependenciesNumber/dependenciesAcoth.generated.js");
+var _dependenciesAcscGenerated = require("./dependenciesNumber/dependenciesAcsc.generated.js");
+var _dependenciesAcschGenerated = require("./dependenciesNumber/dependenciesAcsch.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesNumber/dependenciesAdd.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesNumber/dependenciesAddScalar.generated.js");
+var _dependenciesAndGenerated = require("./dependenciesNumber/dependenciesAnd.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesNumber/dependenciesArrayNode.generated.js");
+var _dependenciesAsecGenerated = require("./dependenciesNumber/dependenciesAsec.generated.js");
+var _dependenciesAsechGenerated = require("./dependenciesNumber/dependenciesAsech.generated.js");
+var _dependenciesAsinGenerated = require("./dependenciesNumber/dependenciesAsin.generated.js");
+var _dependenciesAsinhGenerated = require("./dependenciesNumber/dependenciesAsinh.generated.js");
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesNumber/dependenciesAssignmentNode.generated.js");
+var _dependenciesAtanGenerated = require("./dependenciesNumber/dependenciesAtan.generated.js");
+var _dependenciesAtan2Generated = require("./dependenciesNumber/dependenciesAtan2.generated.js");
+var _dependenciesAtanhGenerated = require("./dependenciesNumber/dependenciesAtanh.generated.js");
+var _dependenciesBellNumbersGenerated = require("./dependenciesNumber/dependenciesBellNumbers.generated.js");
+var _dependenciesBigintGenerated = require("./dependenciesNumber/dependenciesBigint.generated.js");
+var _dependenciesBitAndGenerated = require("./dependenciesNumber/dependenciesBitAnd.generated.js");
+var _dependenciesBitNotGenerated = require("./dependenciesNumber/dependenciesBitNot.generated.js");
+var _dependenciesBitOrGenerated = require("./dependenciesNumber/dependenciesBitOr.generated.js");
+var _dependenciesBitXorGenerated = require("./dependenciesNumber/dependenciesBitXor.generated.js");
+var _dependenciesBlockNodeGenerated = require("./dependenciesNumber/dependenciesBlockNode.generated.js");
+var _dependenciesBooleanGenerated = require("./dependenciesNumber/dependenciesBoolean.generated.js");
+var _dependenciesCatalanGenerated = require("./dependenciesNumber/dependenciesCatalan.generated.js");
+var _dependenciesCbrtGenerated = require("./dependenciesNumber/dependenciesCbrt.generated.js");
+var _dependenciesCeilGenerated = require("./dependenciesNumber/dependenciesCeil.generated.js");
+var _dependenciesChainGenerated = require("./dependenciesNumber/dependenciesChain.generated.js");
+var _dependenciesChainClassGenerated = require("./dependenciesNumber/dependenciesChainClass.generated.js");
+var _dependenciesCloneGenerated = require("./dependenciesNumber/dependenciesClone.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesNumber/dependenciesCombinations.generated.js");
+var _dependenciesCombinationsWithRepGenerated = require("./dependenciesNumber/dependenciesCombinationsWithRep.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesNumber/dependenciesCompare.generated.js");
+var _dependenciesCompareNaturalGenerated = require("./dependenciesNumber/dependenciesCompareNatural.generated.js");
+var _dependenciesCompareTextGenerated = require("./dependenciesNumber/dependenciesCompareText.generated.js");
+var _dependenciesCompileGenerated = require("./dependenciesNumber/dependenciesCompile.generated.js");
+var _dependenciesCompositionGenerated = require("./dependenciesNumber/dependenciesComposition.generated.js");
+var _dependenciesConditionalNodeGenerated = require("./dependenciesNumber/dependenciesConditionalNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesNumber/dependenciesConstantNode.generated.js");
+var _dependenciesCorrGenerated = require("./dependenciesNumber/dependenciesCorr.generated.js");
+var _dependenciesCosGenerated = require("./dependenciesNumber/dependenciesCos.generated.js");
+var _dependenciesCoshGenerated = require("./dependenciesNumber/dependenciesCosh.generated.js");
+var _dependenciesCotGenerated = require("./dependenciesNumber/dependenciesCot.generated.js");
+var _dependenciesCothGenerated = require("./dependenciesNumber/dependenciesCoth.generated.js");
+var _dependenciesCscGenerated = require("./dependenciesNumber/dependenciesCsc.generated.js");
+var _dependenciesCschGenerated = require("./dependenciesNumber/dependenciesCsch.generated.js");
+var _dependenciesCubeGenerated = require("./dependenciesNumber/dependenciesCube.generated.js");
+var _dependenciesCumSumGenerated = require("./dependenciesNumber/dependenciesCumSum.generated.js");
+var _dependenciesCumSumTransformGenerated = require("./dependenciesNumber/dependenciesCumSumTransform.generated.js");
+var _dependenciesDeepEqualGenerated = require("./dependenciesNumber/dependenciesDeepEqual.generated.js");
+var _dependenciesDerivativeGenerated = require("./dependenciesNumber/dependenciesDerivative.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesNumber/dependenciesDivide.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesNumber/dependenciesDivideScalar.generated.js");
+var _dependenciesEGenerated = require("./dependenciesNumber/dependenciesE.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesNumber/dependenciesEqual.generated.js");
+var _dependenciesEqualScalarGenerated = require("./dependenciesNumber/dependenciesEqualScalar.generated.js");
+var _dependenciesEqualTextGenerated = require("./dependenciesNumber/dependenciesEqualText.generated.js");
+var _dependenciesErfGenerated = require("./dependenciesNumber/dependenciesErf.generated.js");
+var _dependenciesEvaluateGenerated = require("./dependenciesNumber/dependenciesEvaluate.generated.js");
+var _dependenciesExpGenerated = require("./dependenciesNumber/dependenciesExp.generated.js");
+var _dependenciesExpm1Generated = require("./dependenciesNumber/dependenciesExpm1.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesNumber/dependenciesFactorial.generated.js");
+var _dependenciesFalseGenerated = require("./dependenciesNumber/dependenciesFalse.generated.js");
+var _dependenciesFilterGenerated = require("./dependenciesNumber/dependenciesFilter.generated.js");
+var _dependenciesFilterTransformGenerated = require("./dependenciesNumber/dependenciesFilterTransform.generated.js");
+var _dependenciesFixGenerated = require("./dependenciesNumber/dependenciesFix.generated.js");
+var _dependenciesFloorGenerated = require("./dependenciesNumber/dependenciesFloor.generated.js");
+var _dependenciesForEachGenerated = require("./dependenciesNumber/dependenciesForEach.generated.js");
+var _dependenciesForEachTransformGenerated = require("./dependenciesNumber/dependenciesForEachTransform.generated.js");
+var _dependenciesFormatGenerated = require("./dependenciesNumber/dependenciesFormat.generated.js");
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesNumber/dependenciesFunctionNode.generated.js");
+var _dependenciesGammaGenerated = require("./dependenciesNumber/dependenciesGamma.generated.js");
+var _dependenciesGcdGenerated = require("./dependenciesNumber/dependenciesGcd.generated.js");
+var _dependenciesHasNumericValueGenerated = require("./dependenciesNumber/dependenciesHasNumericValue.generated.js");
+var _dependenciesHelpGenerated = require("./dependenciesNumber/dependenciesHelp.generated.js");
+var _dependenciesHelpClassGenerated = require("./dependenciesNumber/dependenciesHelpClass.generated.js");
+var _dependenciesHypotGenerated = require("./dependenciesNumber/dependenciesHypot.generated.js");
+var _dependenciesIndexGenerated = require("./dependenciesNumber/dependenciesIndex.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesNumber/dependenciesIndexNode.generated.js");
+var _dependenciesInfinityGenerated = require("./dependenciesNumber/dependenciesInfinity.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesNumber/dependenciesIsInteger.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesNumber/dependenciesIsNaN.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesNumber/dependenciesIsNegative.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesNumber/dependenciesIsNumeric.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesNumber/dependenciesIsPositive.generated.js");
+var _dependenciesIsPrimeGenerated = require("./dependenciesNumber/dependenciesIsPrime.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesNumber/dependenciesIsZero.generated.js");
+var _dependenciesLN10Generated = require("./dependenciesNumber/dependenciesLN10.generated.js");
+var _dependenciesLN2Generated = require("./dependenciesNumber/dependenciesLN2.generated.js");
+var _dependenciesLOG10EGenerated = require("./dependenciesNumber/dependenciesLOG10E.generated.js");
+var _dependenciesLOG2EGenerated = require("./dependenciesNumber/dependenciesLOG2E.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesNumber/dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesNumber/dependenciesLargerEq.generated.js");
+var _dependenciesLcmGenerated = require("./dependenciesNumber/dependenciesLcm.generated.js");
+var _dependenciesLeftShiftGenerated = require("./dependenciesNumber/dependenciesLeftShift.generated.js");
+var _dependenciesLgammaGenerated = require("./dependenciesNumber/dependenciesLgamma.generated.js");
+var _dependenciesLogGenerated = require("./dependenciesNumber/dependenciesLog.generated.js");
+var _dependenciesLog10Generated = require("./dependenciesNumber/dependenciesLog10.generated.js");
+var _dependenciesLog1pGenerated = require("./dependenciesNumber/dependenciesLog1p.generated.js");
+var _dependenciesLog2Generated = require("./dependenciesNumber/dependenciesLog2.generated.js");
+var _dependenciesMadGenerated = require("./dependenciesNumber/dependenciesMad.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesNumber/dependenciesMap.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesNumber/dependenciesMapSlices.generated.js");
+var _dependenciesMapSlicesTransformGenerated = require("./dependenciesNumber/dependenciesMapSlicesTransform.generated.js");
+var _dependenciesMapTransformGenerated = require("./dependenciesNumber/dependenciesMapTransform.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesNumber/dependenciesMatrix.generated.js");
+var _dependenciesMaxGenerated = require("./dependenciesNumber/dependenciesMax.generated.js");
+var _dependenciesMaxTransformGenerated = require("./dependenciesNumber/dependenciesMaxTransform.generated.js");
+var _dependenciesMeanGenerated = require("./dependenciesNumber/dependenciesMean.generated.js");
+var _dependenciesMeanTransformGenerated = require("./dependenciesNumber/dependenciesMeanTransform.generated.js");
+var _dependenciesMedianGenerated = require("./dependenciesNumber/dependenciesMedian.generated.js");
+var _dependenciesMinGenerated = require("./dependenciesNumber/dependenciesMin.generated.js");
+var _dependenciesMinTransformGenerated = require("./dependenciesNumber/dependenciesMinTransform.generated.js");
+var _dependenciesModGenerated = require("./dependenciesNumber/dependenciesMod.generated.js");
+var _dependenciesModeGenerated = require("./dependenciesNumber/dependenciesMode.generated.js");
+var _dependenciesMultinomialGenerated = require("./dependenciesNumber/dependenciesMultinomial.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesNumber/dependenciesMultiply.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesNumber/dependenciesMultiplyScalar.generated.js");
+var _dependenciesNaNGenerated = require("./dependenciesNumber/dependenciesNaN.generated.js");
+var _dependenciesNodeGenerated = require("./dependenciesNumber/dependenciesNode.generated.js");
+var _dependenciesNormGenerated = require("./dependenciesNumber/dependenciesNorm.generated.js");
+var _dependenciesNotGenerated = require("./dependenciesNumber/dependenciesNot.generated.js");
+var _dependenciesNthRootGenerated = require("./dependenciesNumber/dependenciesNthRoot.generated.js");
+var _dependenciesNullGenerated = require("./dependenciesNumber/dependenciesNull.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber/dependenciesNumber.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumber/dependenciesNumeric.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesNumber/dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesNumber/dependenciesOperatorNode.generated.js");
+var _dependenciesOrGenerated = require("./dependenciesNumber/dependenciesOr.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesNumber/dependenciesParenthesisNode.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesNumber/dependenciesParse.generated.js");
+var _dependenciesParserGenerated = require("./dependenciesNumber/dependenciesParser.generated.js");
+var _dependenciesParserClassGenerated = require("./dependenciesNumber/dependenciesParserClass.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesNumber/dependenciesPartitionSelect.generated.js");
+var _dependenciesPermutationsGenerated = require("./dependenciesNumber/dependenciesPermutations.generated.js");
+var _dependenciesPhiGenerated = require("./dependenciesNumber/dependenciesPhi.generated.js");
+var _dependenciesPiGenerated = require("./dependenciesNumber/dependenciesPi.generated.js");
+var _dependenciesPickRandomGenerated = require("./dependenciesNumber/dependenciesPickRandom.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesNumber/dependenciesPow.generated.js");
+var _dependenciesPrintGenerated = require("./dependenciesNumber/dependenciesPrint.generated.js");
+var _dependenciesProdGenerated = require("./dependenciesNumber/dependenciesProd.generated.js");
+var _dependenciesQuantileSeqGenerated = require("./dependenciesNumber/dependenciesQuantileSeq.generated.js");
+var _dependenciesRandomGenerated = require("./dependenciesNumber/dependenciesRandom.generated.js");
+var _dependenciesRandomIntGenerated = require("./dependenciesNumber/dependenciesRandomInt.generated.js");
+var _dependenciesRangeGenerated = require("./dependenciesNumber/dependenciesRange.generated.js");
+var _dependenciesRangeClassGenerated = require("./dependenciesNumber/dependenciesRangeClass.generated.js");
+var _dependenciesRangeNodeGenerated = require("./dependenciesNumber/dependenciesRangeNode.generated.js");
+var _dependenciesRangeTransformGenerated = require("./dependenciesNumber/dependenciesRangeTransform.generated.js");
+var _dependenciesRationalizeGenerated = require("./dependenciesNumber/dependenciesRationalize.generated.js");
+var _dependenciesRelationalNodeGenerated = require("./dependenciesNumber/dependenciesRelationalNode.generated.js");
+var _dependenciesReplacerGenerated = require("./dependenciesNumber/dependenciesReplacer.generated.js");
+var _dependenciesResolveGenerated = require("./dependenciesNumber/dependenciesResolve.generated.js");
+var _dependenciesResultSetGenerated = require("./dependenciesNumber/dependenciesResultSet.generated.js");
+var _dependenciesReviverGenerated = require("./dependenciesNumber/dependenciesReviver.generated.js");
+var _dependenciesRightArithShiftGenerated = require("./dependenciesNumber/dependenciesRightArithShift.generated.js");
+var _dependenciesRightLogShiftGenerated = require("./dependenciesNumber/dependenciesRightLogShift.generated.js");
+var _dependenciesRoundGenerated = require("./dependenciesNumber/dependenciesRound.generated.js");
+var _dependenciesSQRT1_2Generated = require("./dependenciesNumber/dependenciesSQRT1_2.generated.js");
+var _dependenciesSQRT2Generated = require("./dependenciesNumber/dependenciesSQRT2.generated.js");
+var _dependenciesSecGenerated = require("./dependenciesNumber/dependenciesSec.generated.js");
+var _dependenciesSechGenerated = require("./dependenciesNumber/dependenciesSech.generated.js");
+var _dependenciesSignGenerated = require("./dependenciesNumber/dependenciesSign.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesNumber/dependenciesSimplify.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesNumber/dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesNumber/dependenciesSimplifyCore.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesNumber/dependenciesSin.generated.js");
+var _dependenciesSinhGenerated = require("./dependenciesNumber/dependenciesSinh.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesNumber/dependenciesSize.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesNumber/dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesNumber/dependenciesSmallerEq.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesNumber/dependenciesSqrt.generated.js");
+var _dependenciesSquareGenerated = require("./dependenciesNumber/dependenciesSquare.generated.js");
+var _dependenciesStdGenerated = require("./dependenciesNumber/dependenciesStd.generated.js");
+var _dependenciesStdTransformGenerated = require("./dependenciesNumber/dependenciesStdTransform.generated.js");
+var _dependenciesStirlingS2Generated = require("./dependenciesNumber/dependenciesStirlingS2.generated.js");
+var _dependenciesStringGenerated = require("./dependenciesNumber/dependenciesString.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesNumber/dependenciesSubset.generated.js");
+var _dependenciesSubsetTransformGenerated = require("./dependenciesNumber/dependenciesSubsetTransform.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesNumber/dependenciesSubtract.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesNumber/dependenciesSubtractScalar.generated.js");
+var _dependenciesSumGenerated = require("./dependenciesNumber/dependenciesSum.generated.js");
+var _dependenciesSumTransformGenerated = require("./dependenciesNumber/dependenciesSumTransform.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesNumber/dependenciesSymbolNode.generated.js");
+var _dependenciesTanGenerated = require("./dependenciesNumber/dependenciesTan.generated.js");
+var _dependenciesTanhGenerated = require("./dependenciesNumber/dependenciesTanh.generated.js");
+var _dependenciesTauGenerated = require("./dependenciesNumber/dependenciesTau.generated.js");
+var _dependenciesTrueGenerated = require("./dependenciesNumber/dependenciesTrue.generated.js");
+var _dependenciesTypeOfGenerated = require("./dependenciesNumber/dependenciesTypeOf.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesNumber/dependenciesTyped.generated.js");
+var _dependenciesUnaryMinusGenerated = require("./dependenciesNumber/dependenciesUnaryMinus.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesNumber/dependenciesUnaryPlus.generated.js");
+var _dependenciesUnequalGenerated = require("./dependenciesNumber/dependenciesUnequal.generated.js");
+var _dependenciesUppercaseEGenerated = require("./dependenciesNumber/dependenciesUppercaseE.generated.js");
+var _dependenciesUppercasePiGenerated = require("./dependenciesNumber/dependenciesUppercasePi.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesNumber/dependenciesVariance.generated.js");
+var _dependenciesVarianceTransformGenerated = require("./dependenciesNumber/dependenciesVarianceTransform.generated.js");
+var _dependenciesVersionGenerated = require("./dependenciesNumber/dependenciesVersion.generated.js");
+var _dependenciesXgcdGenerated = require("./dependenciesNumber/dependenciesXgcd.generated.js");
+var _dependenciesXorGenerated = require("./dependenciesNumber/dependenciesXor.generated.js");
+var _dependenciesZetaGenerated = require("./dependenciesNumber/dependenciesZeta.generated.js");
+var _allFactoriesNumber = require("./allFactoriesNumber.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js
new file mode 100644
index 0000000..e9485c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAbs.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const absDependencies = exports.absDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAbs: _factoriesNumber.createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..1e76b37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AccessorNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const AccessorNodeDependencies = exports.AccessorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAccessorNode: _factoriesNumber.createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js
new file mode 100644
index 0000000..ba76716
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcos.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acosDependencies = exports.acosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcos: _factoriesNumber.createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..6d65aa0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcosh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acoshDependencies = exports.acoshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcosh: _factoriesNumber.createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js
new file mode 100644
index 0000000..fa77128
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acotDependencies = exports.acotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcot: _factoriesNumber.createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..26e4d33
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcoth.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acothDependencies = exports.acothDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcoth: _factoriesNumber.createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..97a796a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsc.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acscDependencies = exports.acscDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsc: _factoriesNumber.createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..a732848
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAcsch.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const acschDependencies = exports.acschDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAcsch: _factoriesNumber.createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js
new file mode 100644
index 0000000..0e292c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAdd.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const addDependencies = exports.addDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAdd: _factoriesNumber.createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..51789ef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAddScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const addScalarDependencies = exports.addScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAddScalar: _factoriesNumber.createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js
new file mode 100644
index 0000000..20f1fe3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAnd.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const andDependencies = exports.andDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAnd: _factoriesNumber.createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..dc59bef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesArrayNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArrayNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ArrayNodeDependencies = exports.ArrayNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createArrayNode: _factoriesNumber.createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js
new file mode 100644
index 0000000..57e34a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsec.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asecDependencies = exports.asecDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsec: _factoriesNumber.createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js
new file mode 100644
index 0000000..8723bb2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsech.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asechDependencies = exports.asechDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsech: _factoriesNumber.createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js
new file mode 100644
index 0000000..743cf4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsin.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asinDependencies = exports.asinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsin: _factoriesNumber.createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..9a7c1bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAsinh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const asinhDependencies = exports.asinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAsinh: _factoriesNumber.createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..db3c7f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.AssignmentNodeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSubsetGenerated = require("./dependenciesSubset.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const AssignmentNodeDependencies = exports.AssignmentNodeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  subsetDependencies: _dependenciesSubsetGenerated.subsetDependencies,
+  createAssignmentNode: _factoriesNumber.createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js
new file mode 100644
index 0000000..74f6f0b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atanDependencies = exports.atanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan: _factoriesNumber.createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..fe4d438
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtan2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Dependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atan2Dependencies = exports.atan2Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtan2: _factoriesNumber.createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..6f67c96
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesAtanh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const atanhDependencies = exports.atanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createAtanh: _factoriesNumber.createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..84a4ab6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesStirlingS2Generated = require("./dependenciesStirlingS2.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bellNumbersDependencies = exports.bellNumbersDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  stirlingS2Dependencies: _dependenciesStirlingS2Generated.stirlingS2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBellNumbers: _factoriesNumber.createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBigint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBigint.generated.js
new file mode 100644
index 0000000..711e272
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBigint.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bigintDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bigintDependencies = exports.bigintDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBigint: _factoriesNumber.createBigint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..1d8fb1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitAnd.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitAndDependencies = exports.bitAndDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitAnd: _factoriesNumber.createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..cb2d71e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitNot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitNotDependencies = exports.bitNotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitNot: _factoriesNumber.createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..6ce8e6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitOr.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitOrDependencies = exports.bitOrDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitOr: _factoriesNumber.createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..d1b6408
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBitXor.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const bitXorDependencies = exports.bitXorDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBitXor: _factoriesNumber.createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..aafced2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBlockNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.BlockNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesResultSetGenerated = require("./dependenciesResultSet.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const BlockNodeDependencies = exports.BlockNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  ResultSetDependencies: _dependenciesResultSetGenerated.ResultSetDependencies,
+  createBlockNode: _factoriesNumber.createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..7f19df9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesBoolean.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const booleanDependencies = exports.booleanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createBoolean: _factoriesNumber.createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..cc1737d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCatalan.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const catalanDependencies = exports.catalanDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCatalan: _factoriesNumber.createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..7f34821
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCbrt.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cbrtDependencies = exports.cbrtDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCbrt: _factoriesNumber.createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js
new file mode 100644
index 0000000..5a99231
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCeil.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDependencies = void 0;
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ceilDependencies = exports.ceilDependencies = {
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCeil: _factoriesNumber.createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js
new file mode 100644
index 0000000..e4fcb16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChain.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.chainDependencies = void 0;
+var _dependenciesChainClassGenerated = require("./dependenciesChainClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const chainDependencies = exports.chainDependencies = {
+  ChainDependencies: _dependenciesChainClassGenerated.ChainDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChain: _factoriesNumber.createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..099a462
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesChainClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ChainDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ChainDependencies = exports.ChainDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createChainClass: _factoriesNumber.createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js
new file mode 100644
index 0000000..d635205
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesClone.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cloneDependencies = exports.cloneDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createClone: _factoriesNumber.createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..54f291b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinations.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const combinationsDependencies = exports.combinationsDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinations: _factoriesNumber.createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..3ab0e01
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const combinationsWithRepDependencies = exports.combinationsWithRepDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCombinationsWithRep: _factoriesNumber.createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js
new file mode 100644
index 0000000..a2ef64a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompare.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareDependencies = exports.compareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompare: _factoriesNumber.createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..79b56c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDependencies = void 0;
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareNaturalDependencies = exports.compareNaturalDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareNatural: _factoriesNumber.createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..10831d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompareText.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compareTextDependencies = exports.compareTextDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompareText: _factoriesNumber.createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js
new file mode 100644
index 0000000..e05ece3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCompile.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileDependencies = void 0;
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compileDependencies = exports.compileDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCompile: _factoriesNumber.createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js
new file mode 100644
index 0000000..86fa60b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesComposition.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const compositionDependencies = exports.compositionDependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createComposition: _factoriesNumber.createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..3717bf3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConditionalNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ConditionalNodeDependencies = exports.ConditionalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConditionalNode: _factoriesNumber.createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..a6121e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesConstantNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ConstantNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ConstantNodeDependencies = exports.ConstantNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createConstantNode: _factoriesNumber.createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCorr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCorr.generated.js
new file mode 100644
index 0000000..0406748
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCorr.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.corrDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMeanGenerated = require("./dependenciesMean.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesSumGenerated = require("./dependenciesSum.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const corrDependencies = exports.corrDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  meanDependencies: _dependenciesMeanGenerated.meanDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  sumDependencies: _dependenciesSumGenerated.sumDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCorr: _factoriesNumber.createCorr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js
new file mode 100644
index 0000000..7a1c466
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCos.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cosDependencies = exports.cosDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCos: _factoriesNumber.createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js
new file mode 100644
index 0000000..afb0b87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCosh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const coshDependencies = exports.coshDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCosh: _factoriesNumber.createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js
new file mode 100644
index 0000000..8e2c524
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cotDependencies = exports.cotDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCot: _factoriesNumber.createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js
new file mode 100644
index 0000000..f5eb7b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCoth.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cothDependencies = exports.cothDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCoth: _factoriesNumber.createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js
new file mode 100644
index 0000000..181723c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsc.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cscDependencies = exports.cscDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsc: _factoriesNumber.createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js
new file mode 100644
index 0000000..e4ea771
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCsch.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cschDependencies = exports.cschDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCsch: _factoriesNumber.createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js
new file mode 100644
index 0000000..6735e1b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCube.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cubeDependencies = exports.cubeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createCube: _factoriesNumber.createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..63e1596
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSum.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cumsumDependencies = exports.cumsumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSum: _factoriesNumber.createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..5ab2c2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumsumTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesUnaryPlusGenerated = require("./dependenciesUnaryPlus.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const cumsumTransformDependencies = exports.cumsumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  unaryPlusDependencies: _dependenciesUnaryPlusGenerated.unaryPlusDependencies,
+  createCumSumTransform: _factoriesNumber.createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..dc54e9c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDependencies = void 0;
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const deepEqualDependencies = exports.deepEqualDependencies = {
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDeepEqual: _factoriesNumber.createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..cf41d1f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDerivative.generated.js
@@ -0,0 +1,37 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDependencies = void 0;
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const derivativeDependencies = exports.derivativeDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDerivative: _factoriesNumber.createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js
new file mode 100644
index 0000000..346757e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivide.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const divideDependencies = exports.divideDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivide: _factoriesNumber.createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..64dfeb4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const divideScalarDependencies = exports.divideScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createDivideScalar: _factoriesNumber.createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js
new file mode 100644
index 0000000..cecc000
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesE.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const eDependencies = exports.eDependencies = {
+  createE: _factoriesNumber.createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js
new file mode 100644
index 0000000..a59e816
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqual.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDependencies = void 0;
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalDependencies = exports.equalDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqual: _factoriesNumber.createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..a691430
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalScalarDependencies = exports.equalScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualScalar: _factoriesNumber.createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..220c175
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEqualText.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDependencies = void 0;
+var _dependenciesCompareTextGenerated = require("./dependenciesCompareText.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const equalTextDependencies = exports.equalTextDependencies = {
+  compareTextDependencies: _dependenciesCompareTextGenerated.compareTextDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEqualText: _factoriesNumber.createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js
new file mode 100644
index 0000000..7daf4fa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesErf.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const erfDependencies = exports.erfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createErf: _factoriesNumber.createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..7f62901
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesEvaluate.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDependencies = void 0;
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const evaluateDependencies = exports.evaluateDependencies = {
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createEvaluate: _factoriesNumber.createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js
new file mode 100644
index 0000000..1f6a507
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExp.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const expDependencies = exports.expDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExp: _factoriesNumber.createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..04cf1c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesExpm1.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Dependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const expm1Dependencies = exports.expm1Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createExpm1: _factoriesNumber.createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..b610553
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFactorial.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDependencies = void 0;
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const factorialDependencies = exports.factorialDependencies = {
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFactorial: _factoriesNumber.createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js
new file mode 100644
index 0000000..67e166e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFalse.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const falseDependencies = exports.falseDependencies = {
+  createFalse: _factoriesNumber.createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js
new file mode 100644
index 0000000..141e4f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilter.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const filterDependencies = exports.filterDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilter: _factoriesNumber.createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..9fe1a59
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const filterTransformDependencies = exports.filterTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFilterTransform: _factoriesNumber.createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js
new file mode 100644
index 0000000..f4f5c96
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFix.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDependencies = void 0;
+var _dependenciesCeilGenerated = require("./dependenciesCeil.generated.js");
+var _dependenciesFloorGenerated = require("./dependenciesFloor.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const fixDependencies = exports.fixDependencies = {
+  ceilDependencies: _dependenciesCeilGenerated.ceilDependencies,
+  floorDependencies: _dependenciesFloorGenerated.floorDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFix: _factoriesNumber.createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js
new file mode 100644
index 0000000..582d328
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFloor.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDependencies = void 0;
+var _dependenciesRoundGenerated = require("./dependenciesRound.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const floorDependencies = exports.floorDependencies = {
+  roundDependencies: _dependenciesRoundGenerated.roundDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFloor: _factoriesNumber.createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js
new file mode 100644
index 0000000..81936d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEach.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const forEachDependencies = exports.forEachDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEach: _factoriesNumber.createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..2aa784a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const forEachTransformDependencies = exports.forEachTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createForEachTransform: _factoriesNumber.createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js
new file mode 100644
index 0000000..0479849
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFormat.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const formatDependencies = exports.formatDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFormat: _factoriesNumber.createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..218e5fa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionAssignmentNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FunctionAssignmentNodeDependencies = exports.FunctionAssignmentNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createFunctionAssignmentNode: _factoriesNumber.createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..62c3d4d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.FunctionNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const FunctionNodeDependencies = exports.FunctionNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  createFunctionNode: _factoriesNumber.createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js
new file mode 100644
index 0000000..b27dc79
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGamma.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gammaDependencies = exports.gammaDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGamma: _factoriesNumber.createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js
new file mode 100644
index 0000000..d797983
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesGcd.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const gcdDependencies = exports.gcdDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createGcd: _factoriesNumber.createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..44acb49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDependencies = void 0;
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hasNumericValueDependencies = exports.hasNumericValueDependencies = {
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHasNumericValue: _factoriesNumber.createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js
new file mode 100644
index 0000000..64af532
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelp.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDependencies = void 0;
+var _dependenciesHelpClassGenerated = require("./dependenciesHelpClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const helpDependencies = exports.helpDependencies = {
+  HelpDependencies: _dependenciesHelpClassGenerated.HelpDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHelp: _factoriesNumber.createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..6253896
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHelpClass.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.HelpDependencies = void 0;
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const HelpDependencies = exports.HelpDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  createHelpClass: _factoriesNumber.createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js
new file mode 100644
index 0000000..fb7e015
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesHypot.generated.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const hypotDependencies = exports.hypotDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createHypot: _factoriesNumber.createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js
new file mode 100644
index 0000000..72b8bc7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndex.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const indexDependencies = exports.indexDependencies = {
+  createIndex: _factoriesNumber.createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..c2c40f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIndexNode.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _dependenciesSizeGenerated = require("./dependenciesSize.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const IndexNodeDependencies = exports.IndexNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  sizeDependencies: _dependenciesSizeGenerated.sizeDependencies,
+  createIndexNode: _factoriesNumber.createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..1196315
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesInfinity.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const InfinityDependencies = exports.InfinityDependencies = {
+  createInfinity: _factoriesNumber.createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..2450b89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsInteger.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isIntegerDependencies = exports.isIntegerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsInteger: _factoriesNumber.createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..ae67c93
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNaN.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNaNDependencies = exports.isNaNDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNaN: _factoriesNumber.createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..e6772f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNegative.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNegativeDependencies = exports.isNegativeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNegative: _factoriesNumber.createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..6c7f4c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isNumericDependencies = exports.isNumericDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsNumeric: _factoriesNumber.createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..1e8cedd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPositive.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isPositiveDependencies = exports.isPositiveDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPositive: _factoriesNumber.createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..45bdf5d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsPrime.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isPrimeDependencies = exports.isPrimeDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsPrime: _factoriesNumber.createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..a760963
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesIsZero.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const isZeroDependencies = exports.isZeroDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createIsZero: _factoriesNumber.createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js
new file mode 100644
index 0000000..9b1512c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN10.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Dependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LN10Dependencies = exports.LN10Dependencies = {
+  createLN10: _factoriesNumber.createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js
new file mode 100644
index 0000000..483a4dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLN2.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Dependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LN2Dependencies = exports.LN2Dependencies = {
+  createLN2: _factoriesNumber.createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..e86e5c4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG10E.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LOG10EDependencies = exports.LOG10EDependencies = {
+  createLOG10E: _factoriesNumber.createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..abf38ba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLOG2E.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const LOG2EDependencies = exports.LOG2EDependencies = {
+  createLOG2E: _factoriesNumber.createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js
new file mode 100644
index 0000000..02c305b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLarger.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const largerDependencies = exports.largerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLarger: _factoriesNumber.createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..f6a60a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLargerEq.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const largerEqDependencies = exports.largerEqDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLargerEq: _factoriesNumber.createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js
new file mode 100644
index 0000000..3b1cd75
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLcm.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lcmDependencies = exports.lcmDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLcm: _factoriesNumber.createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..64bb0d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLeftShift.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const leftShiftDependencies = exports.leftShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLeftShift: _factoriesNumber.createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLgamma.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLgamma.generated.js
new file mode 100644
index 0000000..8afdc01
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLgamma.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lgammaDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const lgammaDependencies = exports.lgammaDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLgamma: _factoriesNumber.createLgamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js
new file mode 100644
index 0000000..57d9550
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const logDependencies = exports.logDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog: _factoriesNumber.createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js
new file mode 100644
index 0000000..edfb462
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog10.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Dependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log10Dependencies = exports.log10Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog10: _factoriesNumber.createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..45acff9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog1p.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log1pDependencies = exports.log1pDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog1p: _factoriesNumber.createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js
new file mode 100644
index 0000000..d80d6ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesLog2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Dependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const log2Dependencies = exports.log2Dependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createLog2: _factoriesNumber.createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js
new file mode 100644
index 0000000..9eb37a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMad.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDependencies = void 0;
+var _dependenciesAbsGenerated = require("./dependenciesAbs.generated.js");
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesMedianGenerated = require("./dependenciesMedian.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const madDependencies = exports.madDependencies = {
+  absDependencies: _dependenciesAbsGenerated.absDependencies,
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  medianDependencies: _dependenciesMedianGenerated.medianDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMad: _factoriesNumber.createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js
new file mode 100644
index 0000000..504764d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMap.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapDependencies = exports.mapDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMap: _factoriesNumber.createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlices.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlices.generated.js
new file mode 100644
index 0000000..e83b2f3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlices.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapSlicesDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapSlicesDependencies = exports.mapSlicesDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapSlices: _factoriesNumber.createMapSlices
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js
new file mode 100644
index 0000000..80962b1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapSlicesTransformDependencies = void 0;
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapSlicesTransformDependencies = exports.mapSlicesTransformDependencies = {
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapSlicesTransform: _factoriesNumber.createMapSlicesTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..cc42590
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMapTransform.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapTransformDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const mapTransformDependencies = exports.mapTransformDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMapTransform: _factoriesNumber.createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..21bcd3c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMatrix.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const matrixDependencies = exports.matrixDependencies = {
+  createMatrix: _factoriesNumber.createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js
new file mode 100644
index 0000000..614e6c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMax.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const maxDependencies = exports.maxDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMax: _factoriesNumber.createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..c60d9e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxTransformDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const maxTransformDependencies = exports.maxTransformDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMaxTransform: _factoriesNumber.createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js
new file mode 100644
index 0000000..4d8c88d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMean.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const meanDependencies = exports.meanDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMean: _factoriesNumber.createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..f2fa8f7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const meanTransformDependencies = exports.meanTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMeanTransform: _factoriesNumber.createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js
new file mode 100644
index 0000000..c1cbb1d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMedian.generated.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const medianDependencies = exports.medianDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMedian: _factoriesNumber.createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js
new file mode 100644
index 0000000..75de3d8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMin.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const minDependencies = exports.minDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMin: _factoriesNumber.createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..227b38f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMinTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minTransformDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const minTransformDependencies = exports.minTransformDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMinTransform: _factoriesNumber.createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js
new file mode 100644
index 0000000..ac9ffa6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMod.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const modDependencies = exports.modDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMod: _factoriesNumber.createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js
new file mode 100644
index 0000000..6c66983
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMode.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDependencies = void 0;
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const modeDependencies = exports.modeDependencies = {
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMode: _factoriesNumber.createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..17b6f75
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultinomial.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multinomialDependencies = exports.multinomialDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultinomial: _factoriesNumber.createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..b7c2937
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiply.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multiplyDependencies = exports.multiplyDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiply: _factoriesNumber.createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..0501d3d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const multiplyScalarDependencies = exports.multiplyScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createMultiplyScalar: _factoriesNumber.createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js
new file mode 100644
index 0000000..afdf6ef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNaN.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const NaNDependencies = exports.NaNDependencies = {
+  createNaN: _factoriesNumber.createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js
new file mode 100644
index 0000000..74cf58f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNode.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NodeDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const NodeDependencies = exports.NodeDependencies = {
+  createNode: _factoriesNumber.createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js
new file mode 100644
index 0000000..9993c89
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNorm.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const normDependencies = exports.normDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNorm: _factoriesNumber.createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js
new file mode 100644
index 0000000..c48e858
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const notDependencies = exports.notDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNot: _factoriesNumber.createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..221da34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNthRoot.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nthRootDependencies = exports.nthRootDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNthRoot: _factoriesNumber.createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js
new file mode 100644
index 0000000..6a72e3c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNull.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const nullDependencies = exports.nullDependencies = {
+  createNull: _factoriesNumber.createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js
new file mode 100644
index 0000000..e9e7af2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumber.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const numberDependencies = exports.numberDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createNumber: _factoriesNumber.createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..7b20e94
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesNumeric.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDependencies = void 0;
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const numericDependencies = exports.numericDependencies = {
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  createNumeric: _factoriesNumber.createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..e7da029
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesObjectNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ObjectNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ObjectNodeDependencies = exports.ObjectNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createObjectNode: _factoriesNumber.createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..274dd46
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.OperatorNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const OperatorNodeDependencies = exports.OperatorNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createOperatorNode: _factoriesNumber.createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js
new file mode 100644
index 0000000..36be79c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesOr.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const orDependencies = exports.orDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createOr: _factoriesNumber.createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..f4695b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParenthesisNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ParenthesisNodeDependencies = exports.ParenthesisNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createParenthesisNode: _factoriesNumber.createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js
new file mode 100644
index 0000000..15c9ff8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParse.generated.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesAssignmentNodeGenerated = require("./dependenciesAssignmentNode.generated.js");
+var _dependenciesBlockNodeGenerated = require("./dependenciesBlockNode.generated.js");
+var _dependenciesConditionalNodeGenerated = require("./dependenciesConditionalNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionAssignmentNodeGenerated = require("./dependenciesFunctionAssignmentNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesRangeNodeGenerated = require("./dependenciesRangeNode.generated.js");
+var _dependenciesRelationalNodeGenerated = require("./dependenciesRelationalNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const parseDependencies = exports.parseDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  AssignmentNodeDependencies: _dependenciesAssignmentNodeGenerated.AssignmentNodeDependencies,
+  BlockNodeDependencies: _dependenciesBlockNodeGenerated.BlockNodeDependencies,
+  ConditionalNodeDependencies: _dependenciesConditionalNodeGenerated.ConditionalNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies: _dependenciesFunctionAssignmentNodeGenerated.FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  RangeNodeDependencies: _dependenciesRangeNodeGenerated.RangeNodeDependencies,
+  RelationalNodeDependencies: _dependenciesRelationalNodeGenerated.RelationalNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParse: _factoriesNumber.createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js
new file mode 100644
index 0000000..98aa7b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParser.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parserDependencies = void 0;
+var _dependenciesParserClassGenerated = require("./dependenciesParserClass.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const parserDependencies = exports.parserDependencies = {
+  ParserDependencies: _dependenciesParserClassGenerated.ParserDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createParser: _factoriesNumber.createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..ecce973
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesParserClass.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ParserDependencies = void 0;
+var _dependenciesEvaluateGenerated = require("./dependenciesEvaluate.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ParserDependencies = exports.ParserDependencies = {
+  evaluateDependencies: _dependenciesEvaluateGenerated.evaluateDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  createParserClass: _factoriesNumber.createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..2d7cfd3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDependencies = void 0;
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesIsNumericGenerated = require("./dependenciesIsNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const partitionSelectDependencies = exports.partitionSelectDependencies = {
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  isNumericDependencies: _dependenciesIsNumericGenerated.isNumericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPartitionSelect: _factoriesNumber.createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..2c1fac4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPermutations.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDependencies = void 0;
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const permutationsDependencies = exports.permutationsDependencies = {
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPermutations: _factoriesNumber.createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js
new file mode 100644
index 0000000..3c1e7d2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPhi.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const phiDependencies = exports.phiDependencies = {
+  createPhi: _factoriesNumber.createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js
new file mode 100644
index 0000000..cc98a69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPi.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const piDependencies = exports.piDependencies = {
+  createPi: _factoriesNumber.createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..667e87c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPickRandom.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const pickRandomDependencies = exports.pickRandomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPickRandom: _factoriesNumber.createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js
new file mode 100644
index 0000000..6a173d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPow.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const powDependencies = exports.powDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPow: _factoriesNumber.createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js
new file mode 100644
index 0000000..b0916fd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesPrint.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const printDependencies = exports.printDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createPrint: _factoriesNumber.createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js
new file mode 100644
index 0000000..4cab317
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesProd.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDependencies = void 0;
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const prodDependencies = exports.prodDependencies = {
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createProd: _factoriesNumber.createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..0e24070
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesCompareGenerated = require("./dependenciesCompare.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPartitionSelectGenerated = require("./dependenciesPartitionSelect.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const quantileSeqDependencies = exports.quantileSeqDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  compareDependencies: _dependenciesCompareGenerated.compareDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  partitionSelectDependencies: _dependenciesPartitionSelectGenerated.partitionSelectDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createQuantileSeq: _factoriesNumber.createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js
new file mode 100644
index 0000000..e90d8d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandom.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const randomDependencies = exports.randomDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandom: _factoriesNumber.createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..04c5ee8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRandomInt.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDependencies = void 0;
+var _dependenciesLog2Generated = require("./dependenciesLog2.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const randomIntDependencies = exports.randomIntDependencies = {
+  log2Dependencies: _dependenciesLog2Generated.log2Dependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRandomInt: _factoriesNumber.createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js
new file mode 100644
index 0000000..9c1a24f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRange.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rangeDependencies = exports.rangeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRange: _factoriesNumber.createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..4dd2681
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeClass.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RangeDependencies = exports.RangeDependencies = {
+  createRangeClass: _factoriesNumber.createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..dcdce30
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RangeNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RangeNodeDependencies = exports.RangeNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRangeNode: _factoriesNumber.createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..d3726da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeTransformDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsPositiveGenerated = require("./dependenciesIsPositive.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesLargerEqGenerated = require("./dependenciesLargerEq.generated.js");
+var _dependenciesSmallerGenerated = require("./dependenciesSmaller.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rangeTransformDependencies = exports.rangeTransformDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isPositiveDependencies: _dependenciesIsPositiveGenerated.isPositiveDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  largerEqDependencies: _dependenciesLargerEqGenerated.largerEqDependencies,
+  smallerDependencies: _dependenciesSmallerGenerated.smallerDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRangeTransform: _factoriesNumber.createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..56eb3aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRationalize.generated.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSimplifyGenerated = require("./dependenciesSimplify.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rationalizeDependencies = exports.rationalizeDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  simplifyDependencies: _dependenciesSimplifyGenerated.simplifyDependencies,
+  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRationalize: _factoriesNumber.createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..729e180
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.RelationalNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const RelationalNodeDependencies = exports.RelationalNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createRelationalNode: _factoriesNumber.createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..c091ba7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReplacer.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.replacerDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const replacerDependencies = exports.replacerDependencies = {
+  createReplacer: _factoriesNumber.createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js
new file mode 100644
index 0000000..6f4fd77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResolve.generated.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDependencies = void 0;
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const resolveDependencies = exports.resolveDependencies = {
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createResolve: _factoriesNumber.createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..9e97ede
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesResultSet.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ResultSetDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const ResultSetDependencies = exports.ResultSetDependencies = {
+  createResultSet: _factoriesNumber.createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js
new file mode 100644
index 0000000..c94c35b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesReviver.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reviverDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const reviverDependencies = exports.reviverDependencies = {
+  createReviver: _factoriesNumber.createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..9dcd16e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rightArithShiftDependencies = exports.rightArithShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRightArithShift: _factoriesNumber.createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..a95962b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const rightLogShiftDependencies = exports.rightLogShiftDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRightLogShift: _factoriesNumber.createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js
new file mode 100644
index 0000000..497ae98
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesRound.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const roundDependencies = exports.roundDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createRound: _factoriesNumber.createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..129a7ba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT1_2Dependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+// eslint-disable-line camelcase
+
+const SQRT1_2Dependencies = exports.SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  createSQRT1_2: _factoriesNumber.createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..a252e5a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSQRT2.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Dependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SQRT2Dependencies = exports.SQRT2Dependencies = {
+  createSQRT2: _factoriesNumber.createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js
new file mode 100644
index 0000000..b616955
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSec.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const secDependencies = exports.secDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSec: _factoriesNumber.createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js
new file mode 100644
index 0000000..dcec568
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSech.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sechDependencies = exports.sechDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSech: _factoriesNumber.createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js
new file mode 100644
index 0000000..e0a485d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSign.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const signDependencies = exports.signDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSign: _factoriesNumber.createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..e7c5f60
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplify.generated.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesReplacerGenerated = require("./dependenciesReplacer.generated.js");
+var _dependenciesResolveGenerated = require("./dependenciesResolve.generated.js");
+var _dependenciesSimplifyConstantGenerated = require("./dependenciesSimplifyConstant.generated.js");
+var _dependenciesSimplifyCoreGenerated = require("./dependenciesSimplifyCore.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyDependencies = exports.simplifyDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  replacerDependencies: _dependenciesReplacerGenerated.replacerDependencies,
+  resolveDependencies: _dependenciesResolveGenerated.resolveDependencies,
+  simplifyConstantDependencies: _dependenciesSimplifyConstantGenerated.simplifyConstantDependencies,
+  simplifyCoreDependencies: _dependenciesSimplifyCoreGenerated.simplifyCoreDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplify: _factoriesNumber.createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js
new file mode 100644
index 0000000..a2c8b51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyConstantDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyConstantDependencies = exports.simplifyConstantDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplifyConstant: _factoriesNumber.createSimplifyConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..da13883
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDependencies = void 0;
+var _dependenciesAccessorNodeGenerated = require("./dependenciesAccessorNode.generated.js");
+var _dependenciesArrayNodeGenerated = require("./dependenciesArrayNode.generated.js");
+var _dependenciesConstantNodeGenerated = require("./dependenciesConstantNode.generated.js");
+var _dependenciesFunctionNodeGenerated = require("./dependenciesFunctionNode.generated.js");
+var _dependenciesIndexNodeGenerated = require("./dependenciesIndexNode.generated.js");
+var _dependenciesObjectNodeGenerated = require("./dependenciesObjectNode.generated.js");
+var _dependenciesOperatorNodeGenerated = require("./dependenciesOperatorNode.generated.js");
+var _dependenciesParenthesisNodeGenerated = require("./dependenciesParenthesisNode.generated.js");
+var _dependenciesSymbolNodeGenerated = require("./dependenciesSymbolNode.generated.js");
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesIsZeroGenerated = require("./dependenciesIsZero.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesParseGenerated = require("./dependenciesParse.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const simplifyCoreDependencies = exports.simplifyCoreDependencies = {
+  AccessorNodeDependencies: _dependenciesAccessorNodeGenerated.AccessorNodeDependencies,
+  ArrayNodeDependencies: _dependenciesArrayNodeGenerated.ArrayNodeDependencies,
+  ConstantNodeDependencies: _dependenciesConstantNodeGenerated.ConstantNodeDependencies,
+  FunctionNodeDependencies: _dependenciesFunctionNodeGenerated.FunctionNodeDependencies,
+  IndexNodeDependencies: _dependenciesIndexNodeGenerated.IndexNodeDependencies,
+  ObjectNodeDependencies: _dependenciesObjectNodeGenerated.ObjectNodeDependencies,
+  OperatorNodeDependencies: _dependenciesOperatorNodeGenerated.OperatorNodeDependencies,
+  ParenthesisNodeDependencies: _dependenciesParenthesisNodeGenerated.ParenthesisNodeDependencies,
+  SymbolNodeDependencies: _dependenciesSymbolNodeGenerated.SymbolNodeDependencies,
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  isZeroDependencies: _dependenciesIsZeroGenerated.isZeroDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  parseDependencies: _dependenciesParseGenerated.parseDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSimplifyCore: _factoriesNumber.createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js
new file mode 100644
index 0000000..7839170
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSin.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sinDependencies = exports.sinDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSin: _factoriesNumber.createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js
new file mode 100644
index 0000000..774f86a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSinh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sinhDependencies = exports.sinhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSinh: _factoriesNumber.createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js
new file mode 100644
index 0000000..ec34481
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSize.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDependencies = void 0;
+var _dependenciesMatrixGenerated = require("./dependenciesMatrix.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sizeDependencies = exports.sizeDependencies = {
+  matrixDependencies: _dependenciesMatrixGenerated.matrixDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSize: _factoriesNumber.createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..0638bb8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmaller.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const smallerDependencies = exports.smallerDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmaller: _factoriesNumber.createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..877962a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const smallerEqDependencies = exports.smallerEqDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSmallerEq: _factoriesNumber.createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..b1cc9d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSqrt.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sqrtDependencies = exports.sqrtDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSqrt: _factoriesNumber.createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js
new file mode 100644
index 0000000..f9ad8dd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSquare.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const squareDependencies = exports.squareDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSquare: _factoriesNumber.createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js
new file mode 100644
index 0000000..73dff61
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStd.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDependencies = void 0;
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stdDependencies = exports.stdDependencies = {
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStd: _factoriesNumber.createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..369b1b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStdTransform.generated.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdTransformDependencies = void 0;
+var _dependenciesMapGenerated = require("./dependenciesMap.generated.js");
+var _dependenciesSqrtGenerated = require("./dependenciesSqrt.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _dependenciesVarianceGenerated = require("./dependenciesVariance.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stdTransformDependencies = exports.stdTransformDependencies = {
+  mapDependencies: _dependenciesMapGenerated.mapDependencies,
+  sqrtDependencies: _dependenciesSqrtGenerated.sqrtDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  varianceDependencies: _dependenciesVarianceGenerated.varianceDependencies,
+  createStdTransform: _factoriesNumber.createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..cf455f8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Dependencies = void 0;
+var _dependenciesAddScalarGenerated = require("./dependenciesAddScalar.generated.js");
+var _dependenciesCombinationsGenerated = require("./dependenciesCombinations.generated.js");
+var _dependenciesDivideScalarGenerated = require("./dependenciesDivideScalar.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesIsIntegerGenerated = require("./dependenciesIsInteger.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesLargerGenerated = require("./dependenciesLarger.generated.js");
+var _dependenciesMultiplyScalarGenerated = require("./dependenciesMultiplyScalar.generated.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSubtractScalarGenerated = require("./dependenciesSubtractScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stirlingS2Dependencies = exports.stirlingS2Dependencies = {
+  addScalarDependencies: _dependenciesAddScalarGenerated.addScalarDependencies,
+  combinationsDependencies: _dependenciesCombinationsGenerated.combinationsDependencies,
+  divideScalarDependencies: _dependenciesDivideScalarGenerated.divideScalarDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  isIntegerDependencies: _dependenciesIsIntegerGenerated.isIntegerDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  largerDependencies: _dependenciesLargerGenerated.largerDependencies,
+  multiplyScalarDependencies: _dependenciesMultiplyScalarGenerated.multiplyScalarDependencies,
+  numberDependencies: _dependenciesNumberGenerated.numberDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  subtractScalarDependencies: _dependenciesSubtractScalarGenerated.subtractScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createStirlingS2: _factoriesNumber.createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js
new file mode 100644
index 0000000..ef8705a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesString.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const stringDependencies = exports.stringDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createString: _factoriesNumber.createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js
new file mode 100644
index 0000000..7673178
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubset.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subsetDependencies = exports.subsetDependencies = {
+  createSubset: _factoriesNumber.createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..1cb79b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetTransformDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subsetTransformDependencies = exports.subsetTransformDependencies = {
+  createSubsetTransform: _factoriesNumber.createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..188f60f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtract.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subtractDependencies = exports.subtractDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubtract: _factoriesNumber.createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js
new file mode 100644
index 0000000..9373c85
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractScalarDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const subtractScalarDependencies = exports.subtractScalarDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSubtractScalar: _factoriesNumber.createSubtractScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js
new file mode 100644
index 0000000..9b2904b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSum.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sumDependencies = exports.sumDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSum: _factoriesNumber.createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..ec6215e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSumTransform.generated.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesNumericGenerated = require("./dependenciesNumeric.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const sumTransformDependencies = exports.sumTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  numericDependencies: _dependenciesNumericGenerated.numericDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createSumTransform: _factoriesNumber.createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..df354a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SymbolNodeDependencies = void 0;
+var _dependenciesNodeGenerated = require("./dependenciesNode.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const SymbolNodeDependencies = exports.SymbolNodeDependencies = {
+  NodeDependencies: _dependenciesNodeGenerated.NodeDependencies,
+  createSymbolNode: _factoriesNumber.createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js
new file mode 100644
index 0000000..8b77910
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTan.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tanDependencies = exports.tanDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTan: _factoriesNumber.createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js
new file mode 100644
index 0000000..9e22258
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTanh.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tanhDependencies = exports.tanhDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTanh: _factoriesNumber.createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js
new file mode 100644
index 0000000..aa0458c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTau.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const tauDependencies = exports.tauDependencies = {
+  createTau: _factoriesNumber.createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js
new file mode 100644
index 0000000..53250b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTrue.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const trueDependencies = exports.trueDependencies = {
+  createTrue: _factoriesNumber.createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..f354174
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTypeOf.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const typeOfDependencies = exports.typeOfDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createTypeOf: _factoriesNumber.createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js
new file mode 100644
index 0000000..bf7963e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesTyped.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const typedDependencies = exports.typedDependencies = {
+  createTyped: _factoriesNumber.createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..b9c3371
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unaryMinusDependencies = exports.unaryMinusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryMinus: _factoriesNumber.createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..fe5a51c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unaryPlusDependencies = exports.unaryPlusDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnaryPlus: _factoriesNumber.createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..3ec27ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUnequal.generated.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDependencies = void 0;
+var _dependenciesEqualScalarGenerated = require("./dependenciesEqualScalar.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const unequalDependencies = exports.unequalDependencies = {
+  equalScalarDependencies: _dependenciesEqualScalarGenerated.equalScalarDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createUnequal: _factoriesNumber.createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..18d39e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.EDependencies = void 0;
+var _dependenciesEGenerated = require("./dependenciesE.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const EDependencies = exports.EDependencies = {
+  eDependencies: _dependenciesEGenerated.eDependencies,
+  createUppercaseE: _factoriesNumber.createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..720c460
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PIDependencies = void 0;
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const PIDependencies = exports.PIDependencies = {
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  createUppercasePi: _factoriesNumber.createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js
new file mode 100644
index 0000000..6747629
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVariance.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const varianceDependencies = exports.varianceDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVariance: _factoriesNumber.createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..f90d0a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceTransformDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesIsNaNGenerated = require("./dependenciesIsNaN.generated.js");
+var _dependenciesMapSlicesGenerated = require("./dependenciesMapSlices.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const varianceTransformDependencies = exports.varianceTransformDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  isNaNDependencies: _dependenciesIsNaNGenerated.isNaNDependencies,
+  mapSlicesDependencies: _dependenciesMapSlicesGenerated.mapSlicesDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createVarianceTransform: _factoriesNumber.createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js
new file mode 100644
index 0000000..aeb1a13
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesVersion.generated.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDependencies = void 0;
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const versionDependencies = exports.versionDependencies = {
+  createVersion: _factoriesNumber.createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..8f457ba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXgcd.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const xgcdDependencies = exports.xgcdDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXgcd: _factoriesNumber.createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js
new file mode 100644
index 0000000..2aaaf77
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesXor.generated.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDependencies = void 0;
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const xorDependencies = exports.xorDependencies = {
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createXor: _factoriesNumber.createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesZeta.generated.js b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesZeta.generated.js
new file mode 100644
index 0000000..e2be460
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/dependenciesNumber/dependenciesZeta.generated.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zetaDependencies = void 0;
+var _dependenciesAddGenerated = require("./dependenciesAdd.generated.js");
+var _dependenciesDivideGenerated = require("./dependenciesDivide.generated.js");
+var _dependenciesEqualGenerated = require("./dependenciesEqual.generated.js");
+var _dependenciesFactorialGenerated = require("./dependenciesFactorial.generated.js");
+var _dependenciesGammaGenerated = require("./dependenciesGamma.generated.js");
+var _dependenciesIsNegativeGenerated = require("./dependenciesIsNegative.generated.js");
+var _dependenciesMultiplyGenerated = require("./dependenciesMultiply.generated.js");
+var _dependenciesPiGenerated = require("./dependenciesPi.generated.js");
+var _dependenciesPowGenerated = require("./dependenciesPow.generated.js");
+var _dependenciesSinGenerated = require("./dependenciesSin.generated.js");
+var _dependenciesSmallerEqGenerated = require("./dependenciesSmallerEq.generated.js");
+var _dependenciesSubtractGenerated = require("./dependenciesSubtract.generated.js");
+var _dependenciesTypedGenerated = require("./dependenciesTyped.generated.js");
+var _factoriesNumber = require("../../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const zetaDependencies = exports.zetaDependencies = {
+  addDependencies: _dependenciesAddGenerated.addDependencies,
+  divideDependencies: _dependenciesDivideGenerated.divideDependencies,
+  equalDependencies: _dependenciesEqualGenerated.equalDependencies,
+  factorialDependencies: _dependenciesFactorialGenerated.factorialDependencies,
+  gammaDependencies: _dependenciesGammaGenerated.gammaDependencies,
+  isNegativeDependencies: _dependenciesIsNegativeGenerated.isNegativeDependencies,
+  multiplyDependencies: _dependenciesMultiplyGenerated.multiplyDependencies,
+  piDependencies: _dependenciesPiGenerated.piDependencies,
+  powDependencies: _dependenciesPowGenerated.powDependencies,
+  sinDependencies: _dependenciesSinGenerated.sinDependencies,
+  smallerEqDependencies: _dependenciesSmallerEqGenerated.smallerEqDependencies,
+  subtractDependencies: _dependenciesSubtractGenerated.subtractDependencies,
+  typedDependencies: _dependenciesTypedGenerated.typedDependencies,
+  createZeta: _factoriesNumber.createZeta
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js b/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js
new file mode 100644
index 0000000..ad7cabc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/impureFunctionsAny.generated.js
@@ -0,0 +1,770 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivative = exports.compile = exports.chain = exports.SymbolNode = exports.RelationalNode = exports.RangeNode = exports.Parser = exports.ParenthesisNode = exports.OperatorNode = exports.ObjectNode = exports.Node = exports.IndexNode = exports.Help = exports.FunctionNode = exports.FunctionAssignmentNode = exports.ConstantNode = exports.ConditionalNode = exports.Chain = exports.BlockNode = exports.AssignmentNode = exports.ArrayNode = exports.AccessorNode = void 0;
+Object.defineProperty(exports, "docs", {
+  enumerable: true,
+  get: function () {
+    return _embeddedDocs.embeddedDocs;
+  }
+});
+exports.symbolicEqual = exports.simplifyCore = exports.simplifyConstant = exports.simplify = exports.reviver = exports.resolve = exports.rationalize = exports.parser = exports.parse = exports.leafCount = exports.help = exports.evaluate = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _configReadonly = require("./configReadonly.js");
+var _factoriesAny = require("../factoriesAny.js");
+var _pureFunctionsAnyGenerated = require("./pureFunctionsAny.generated.js");
+var _embeddedDocs = require("../expression/embeddedDocs/embeddedDocs.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const math = {}; // NOT pure!
+const mathWithTransform = {}; // NOT pure!
+const classes = {}; // NOT pure!
+
+const Node = exports.Node = (0, _factoriesAny.createNode)({
+  mathWithTransform
+});
+const ObjectNode = exports.ObjectNode = (0, _factoriesAny.createObjectNode)({
+  Node
+});
+const OperatorNode = exports.OperatorNode = (0, _factoriesAny.createOperatorNode)({
+  Node
+});
+const ParenthesisNode = exports.ParenthesisNode = (0, _factoriesAny.createParenthesisNode)({
+  Node
+});
+const RelationalNode = exports.RelationalNode = (0, _factoriesAny.createRelationalNode)({
+  Node
+});
+const ArrayNode = exports.ArrayNode = (0, _factoriesAny.createArrayNode)({
+  Node
+});
+const BlockNode = exports.BlockNode = (0, _factoriesAny.createBlockNode)({
+  Node,
+  ResultSet: _pureFunctionsAnyGenerated.ResultSet
+});
+const ConditionalNode = exports.ConditionalNode = (0, _factoriesAny.createConditionalNode)({
+  Node
+});
+const ConstantNode = exports.ConstantNode = (0, _factoriesAny.createConstantNode)({
+  Node
+});
+const RangeNode = exports.RangeNode = (0, _factoriesAny.createRangeNode)({
+  Node
+});
+const reviver = exports.reviver = (0, _factoriesAny.createReviver)({
+  classes
+});
+const Chain = exports.Chain = (0, _factoriesAny.createChainClass)({
+  math,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const FunctionAssignmentNode = exports.FunctionAssignmentNode = (0, _factoriesAny.createFunctionAssignmentNode)({
+  Node,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const chain = exports.chain = (0, _factoriesAny.createChain)({
+  Chain,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const AccessorNode = exports.AccessorNode = (0, _factoriesAny.createAccessorNode)({
+  Node,
+  subset: _pureFunctionsAnyGenerated.subset
+});
+const AssignmentNode = exports.AssignmentNode = (0, _factoriesAny.createAssignmentNode)({
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  Node,
+  subset: _pureFunctionsAnyGenerated.subset
+});
+const IndexNode = exports.IndexNode = (0, _factoriesAny.createIndexNode)({
+  Node,
+  size: _pureFunctionsAnyGenerated.size
+});
+const SymbolNode = exports.SymbolNode = (0, _factoriesAny.createSymbolNode)({
+  Unit: _pureFunctionsAnyGenerated.Unit,
+  Node,
+  math
+});
+const FunctionNode = exports.FunctionNode = (0, _factoriesAny.createFunctionNode)({
+  Node,
+  SymbolNode,
+  math
+});
+const parse = exports.parse = (0, _factoriesAny.createParse)({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const resolve = exports.resolve = (0, _factoriesAny.createResolve)({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const simplifyConstant = exports.simplifyConstant = (0, _factoriesAny.createSimplifyConstant)({
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  mathWithTransform,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const compile = exports.compile = (0, _factoriesAny.createCompile)({
+  parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const simplifyCore = exports.simplifyCore = (0, _factoriesAny.createSimplifyCore)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add: _pureFunctionsAnyGenerated.add,
+  divide: _pureFunctionsAnyGenerated.divide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  parse,
+  pow: _pureFunctionsAnyGenerated.pow,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const evaluate = exports.evaluate = (0, _factoriesAny.createEvaluate)({
+  parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const Help = exports.Help = (0, _factoriesAny.createHelpClass)({
+  evaluate
+});
+const Parser = exports.Parser = (0, _factoriesAny.createParserClass)({
+  evaluate,
+  parse
+});
+const simplify = exports.simplify = (0, _factoriesAny.createSimplify)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  equal: _pureFunctionsAnyGenerated.equal,
+  parse,
+  replacer: _pureFunctionsAnyGenerated.replacer,
+  resolve,
+  simplifyConstant,
+  simplifyCore,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const symbolicEqual = exports.symbolicEqual = (0, _factoriesAny.createSymbolicEqual)({
+  OperatorNode,
+  parse,
+  simplify,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const leafCount = exports.leafCount = (0, _factoriesAny.createLeafCount)({
+  parse,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const parser = exports.parser = (0, _factoriesAny.createParser)({
+  Parser,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const rationalize = exports.rationalize = (0, _factoriesAny.createRationalize)({
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add: _pureFunctionsAnyGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsAnyGenerated.divide,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  mathWithTransform,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  parse,
+  pow: _pureFunctionsAnyGenerated.pow,
+  simplify,
+  simplifyConstant,
+  simplifyCore,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const derivative = exports.derivative = (0, _factoriesAny.createDerivative)({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  equal: _pureFunctionsAnyGenerated.equal,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  parse,
+  simplify,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+const help = exports.help = (0, _factoriesAny.createHelp)({
+  Help,
+  mathWithTransform,
+  typed: _pureFunctionsAnyGenerated.typed
+});
+(0, _extends2.default)(math, {
+  e: _pureFunctionsAnyGenerated.e,
+  false: _pureFunctionsAnyGenerated._false,
+  fineStructure: _pureFunctionsAnyGenerated.fineStructure,
+  i: _pureFunctionsAnyGenerated.i,
+  Infinity: _pureFunctionsAnyGenerated._Infinity,
+  LN10: _pureFunctionsAnyGenerated.LN10,
+  LOG10E: _pureFunctionsAnyGenerated.LOG10E,
+  NaN: _pureFunctionsAnyGenerated._NaN,
+  null: _pureFunctionsAnyGenerated._null,
+  phi: _pureFunctionsAnyGenerated.phi,
+  SQRT1_2: _pureFunctionsAnyGenerated.SQRT1_2,
+  sackurTetrode: _pureFunctionsAnyGenerated.sackurTetrode,
+  tau: _pureFunctionsAnyGenerated.tau,
+  true: _pureFunctionsAnyGenerated._true,
+  'E': _pureFunctionsAnyGenerated.e,
+  version: _pureFunctionsAnyGenerated.version,
+  efimovFactor: _pureFunctionsAnyGenerated.efimovFactor,
+  LN2: _pureFunctionsAnyGenerated.LN2,
+  pi: _pureFunctionsAnyGenerated.pi,
+  replacer: _pureFunctionsAnyGenerated.replacer,
+  reviver,
+  SQRT2: _pureFunctionsAnyGenerated.SQRT2,
+  typed: _pureFunctionsAnyGenerated.typed,
+  'PI': _pureFunctionsAnyGenerated.pi,
+  weakMixingAngle: _pureFunctionsAnyGenerated.weakMixingAngle,
+  abs: _pureFunctionsAnyGenerated.abs,
+  acos: _pureFunctionsAnyGenerated.acos,
+  acot: _pureFunctionsAnyGenerated.acot,
+  acsc: _pureFunctionsAnyGenerated.acsc,
+  addScalar: _pureFunctionsAnyGenerated.addScalar,
+  arg: _pureFunctionsAnyGenerated.arg,
+  asech: _pureFunctionsAnyGenerated.asech,
+  asinh: _pureFunctionsAnyGenerated.asinh,
+  atan: _pureFunctionsAnyGenerated.atan,
+  atanh: _pureFunctionsAnyGenerated.atanh,
+  bigint: _pureFunctionsAnyGenerated.bigint,
+  bitNot: _pureFunctionsAnyGenerated.bitNot,
+  boolean: _pureFunctionsAnyGenerated.boolean,
+  clone: _pureFunctionsAnyGenerated.clone,
+  combinations: _pureFunctionsAnyGenerated.combinations,
+  complex: _pureFunctionsAnyGenerated.complex,
+  conj: _pureFunctionsAnyGenerated.conj,
+  cos: _pureFunctionsAnyGenerated.cos,
+  cot: _pureFunctionsAnyGenerated.cot,
+  csc: _pureFunctionsAnyGenerated.csc,
+  cube: _pureFunctionsAnyGenerated.cube,
+  equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+  erf: _pureFunctionsAnyGenerated.erf,
+  exp: _pureFunctionsAnyGenerated.exp,
+  expm1: _pureFunctionsAnyGenerated.expm1,
+  filter: _pureFunctionsAnyGenerated.filter,
+  flatten: _pureFunctionsAnyGenerated.flatten,
+  forEach: _pureFunctionsAnyGenerated.forEach,
+  format: _pureFunctionsAnyGenerated.format,
+  getMatrixDataType: _pureFunctionsAnyGenerated.getMatrixDataType,
+  hex: _pureFunctionsAnyGenerated.hex,
+  im: _pureFunctionsAnyGenerated.im,
+  isInteger: _pureFunctionsAnyGenerated.isInteger,
+  isNegative: _pureFunctionsAnyGenerated.isNegative,
+  isPositive: _pureFunctionsAnyGenerated.isPositive,
+  isZero: _pureFunctionsAnyGenerated.isZero,
+  LOG2E: _pureFunctionsAnyGenerated.LOG2E,
+  lgamma: _pureFunctionsAnyGenerated.lgamma,
+  log10: _pureFunctionsAnyGenerated.log10,
+  log2: _pureFunctionsAnyGenerated.log2,
+  map: _pureFunctionsAnyGenerated.map,
+  multiplyScalar: _pureFunctionsAnyGenerated.multiplyScalar,
+  not: _pureFunctionsAnyGenerated.not,
+  number: _pureFunctionsAnyGenerated.number,
+  oct: _pureFunctionsAnyGenerated.oct,
+  pickRandom: _pureFunctionsAnyGenerated.pickRandom,
+  print: _pureFunctionsAnyGenerated.print,
+  random: _pureFunctionsAnyGenerated.random,
+  re: _pureFunctionsAnyGenerated.re,
+  sec: _pureFunctionsAnyGenerated.sec,
+  sign: _pureFunctionsAnyGenerated.sign,
+  sin: _pureFunctionsAnyGenerated.sin,
+  splitUnit: _pureFunctionsAnyGenerated.splitUnit,
+  square: _pureFunctionsAnyGenerated.square,
+  string: _pureFunctionsAnyGenerated.string,
+  subtractScalar: _pureFunctionsAnyGenerated.subtractScalar,
+  tan: _pureFunctionsAnyGenerated.tan,
+  toBest: _pureFunctionsAnyGenerated.toBest,
+  typeOf: _pureFunctionsAnyGenerated.typeOf,
+  acosh: _pureFunctionsAnyGenerated.acosh,
+  acsch: _pureFunctionsAnyGenerated.acsch,
+  asec: _pureFunctionsAnyGenerated.asec,
+  bignumber: _pureFunctionsAnyGenerated.bignumber,
+  chain,
+  combinationsWithRep: _pureFunctionsAnyGenerated.combinationsWithRep,
+  cosh: _pureFunctionsAnyGenerated.cosh,
+  csch: _pureFunctionsAnyGenerated.csch,
+  isNaN: _pureFunctionsAnyGenerated.isNaN,
+  isPrime: _pureFunctionsAnyGenerated.isPrime,
+  mapSlices: _pureFunctionsAnyGenerated.mapSlices,
+  matrix: _pureFunctionsAnyGenerated.matrix,
+  matrixFromFunction: _pureFunctionsAnyGenerated.matrixFromFunction,
+  ones: _pureFunctionsAnyGenerated.ones,
+  randomInt: _pureFunctionsAnyGenerated.randomInt,
+  reshape: _pureFunctionsAnyGenerated.reshape,
+  sech: _pureFunctionsAnyGenerated.sech,
+  sinh: _pureFunctionsAnyGenerated.sinh,
+  sparse: _pureFunctionsAnyGenerated.sparse,
+  sqrt: _pureFunctionsAnyGenerated.sqrt,
+  squeeze: _pureFunctionsAnyGenerated.squeeze,
+  tanh: _pureFunctionsAnyGenerated.tanh,
+  transpose: _pureFunctionsAnyGenerated.transpose,
+  xgcd: _pureFunctionsAnyGenerated.xgcd,
+  zeros: _pureFunctionsAnyGenerated.zeros,
+  acoth: _pureFunctionsAnyGenerated.acoth,
+  asin: _pureFunctionsAnyGenerated.asin,
+  bin: _pureFunctionsAnyGenerated.bin,
+  concat: _pureFunctionsAnyGenerated.concat,
+  coth: _pureFunctionsAnyGenerated.coth,
+  ctranspose: _pureFunctionsAnyGenerated.ctranspose,
+  diag: _pureFunctionsAnyGenerated.diag,
+  dotMultiply: _pureFunctionsAnyGenerated.dotMultiply,
+  equal: _pureFunctionsAnyGenerated.equal,
+  fraction: _pureFunctionsAnyGenerated.fraction,
+  identity: _pureFunctionsAnyGenerated.identity,
+  isNumeric: _pureFunctionsAnyGenerated.isNumeric,
+  kron: _pureFunctionsAnyGenerated.kron,
+  largerEq: _pureFunctionsAnyGenerated.largerEq,
+  leftShift: _pureFunctionsAnyGenerated.leftShift,
+  mode: _pureFunctionsAnyGenerated.mode,
+  nthRoot: _pureFunctionsAnyGenerated.nthRoot,
+  numeric: _pureFunctionsAnyGenerated.numeric,
+  prod: _pureFunctionsAnyGenerated.prod,
+  resize: _pureFunctionsAnyGenerated.resize,
+  rightArithShift: _pureFunctionsAnyGenerated.rightArithShift,
+  round: _pureFunctionsAnyGenerated.round,
+  size: _pureFunctionsAnyGenerated.size,
+  smaller: _pureFunctionsAnyGenerated.smaller,
+  to: _pureFunctionsAnyGenerated.to,
+  unaryMinus: _pureFunctionsAnyGenerated.unaryMinus,
+  unequal: _pureFunctionsAnyGenerated.unequal,
+  xor: _pureFunctionsAnyGenerated.xor,
+  add: _pureFunctionsAnyGenerated.add,
+  atan2: _pureFunctionsAnyGenerated.atan2,
+  bitAnd: _pureFunctionsAnyGenerated.bitAnd,
+  bitOr: _pureFunctionsAnyGenerated.bitOr,
+  bitXor: _pureFunctionsAnyGenerated.bitXor,
+  cbrt: _pureFunctionsAnyGenerated.cbrt,
+  compare: _pureFunctionsAnyGenerated.compare,
+  compareText: _pureFunctionsAnyGenerated.compareText,
+  count: _pureFunctionsAnyGenerated.count,
+  deepEqual: _pureFunctionsAnyGenerated.deepEqual,
+  divideScalar: _pureFunctionsAnyGenerated.divideScalar,
+  dotDivide: _pureFunctionsAnyGenerated.dotDivide,
+  equalText: _pureFunctionsAnyGenerated.equalText,
+  floor: _pureFunctionsAnyGenerated.floor,
+  gcd: _pureFunctionsAnyGenerated.gcd,
+  hasNumericValue: _pureFunctionsAnyGenerated.hasNumericValue,
+  hypot: _pureFunctionsAnyGenerated.hypot,
+  larger: _pureFunctionsAnyGenerated.larger,
+  log: _pureFunctionsAnyGenerated.log,
+  lsolve: _pureFunctionsAnyGenerated.lsolve,
+  matrixFromColumns: _pureFunctionsAnyGenerated.matrixFromColumns,
+  max: _pureFunctionsAnyGenerated.max,
+  min: _pureFunctionsAnyGenerated.min,
+  mod: _pureFunctionsAnyGenerated.mod,
+  nthRoots: _pureFunctionsAnyGenerated.nthRoots,
+  nullish: _pureFunctionsAnyGenerated.nullish,
+  or: _pureFunctionsAnyGenerated.or,
+  partitionSelect: _pureFunctionsAnyGenerated.partitionSelect,
+  qr: _pureFunctionsAnyGenerated.qr,
+  rightLogShift: _pureFunctionsAnyGenerated.rightLogShift,
+  smallerEq: _pureFunctionsAnyGenerated.smallerEq,
+  subset: _pureFunctionsAnyGenerated.subset,
+  subtract: _pureFunctionsAnyGenerated.subtract,
+  trace: _pureFunctionsAnyGenerated.trace,
+  usolve: _pureFunctionsAnyGenerated.usolve,
+  catalan: _pureFunctionsAnyGenerated.catalan,
+  compareNatural: _pureFunctionsAnyGenerated.compareNatural,
+  composition: _pureFunctionsAnyGenerated.composition,
+  diff: _pureFunctionsAnyGenerated.diff,
+  distance: _pureFunctionsAnyGenerated.distance,
+  dot: _pureFunctionsAnyGenerated.dot,
+  index: _pureFunctionsAnyGenerated.index,
+  invmod: _pureFunctionsAnyGenerated.invmod,
+  lcm: _pureFunctionsAnyGenerated.lcm,
+  log1p: _pureFunctionsAnyGenerated.log1p,
+  lsolveAll: _pureFunctionsAnyGenerated.lsolveAll,
+  matrixFromRows: _pureFunctionsAnyGenerated.matrixFromRows,
+  multiply: _pureFunctionsAnyGenerated.multiply,
+  range: _pureFunctionsAnyGenerated.range,
+  row: _pureFunctionsAnyGenerated.row,
+  setCartesian: _pureFunctionsAnyGenerated.setCartesian,
+  setDistinct: _pureFunctionsAnyGenerated.setDistinct,
+  setIsSubset: _pureFunctionsAnyGenerated.setIsSubset,
+  setPowerset: _pureFunctionsAnyGenerated.setPowerset,
+  slu: _pureFunctionsAnyGenerated.slu,
+  sort: _pureFunctionsAnyGenerated.sort,
+  unaryPlus: _pureFunctionsAnyGenerated.unaryPlus,
+  usolveAll: _pureFunctionsAnyGenerated.usolveAll,
+  zpk2tf: _pureFunctionsAnyGenerated.zpk2tf,
+  and: _pureFunctionsAnyGenerated.and,
+  ceil: _pureFunctionsAnyGenerated.ceil,
+  column: _pureFunctionsAnyGenerated.column,
+  cross: _pureFunctionsAnyGenerated.cross,
+  det: _pureFunctionsAnyGenerated.det,
+  fix: _pureFunctionsAnyGenerated.fix,
+  inv: _pureFunctionsAnyGenerated.inv,
+  pinv: _pureFunctionsAnyGenerated.pinv,
+  pow: _pureFunctionsAnyGenerated.pow,
+  setDifference: _pureFunctionsAnyGenerated.setDifference,
+  setMultiplicity: _pureFunctionsAnyGenerated.setMultiplicity,
+  setSymDifference: _pureFunctionsAnyGenerated.setSymDifference,
+  sqrtm: _pureFunctionsAnyGenerated.sqrtm,
+  sum: _pureFunctionsAnyGenerated.sum,
+  vacuumImpedance: _pureFunctionsAnyGenerated.vacuumImpedance,
+  wienDisplacement: _pureFunctionsAnyGenerated.wienDisplacement,
+  atomicMass: _pureFunctionsAnyGenerated.atomicMass,
+  bohrMagneton: _pureFunctionsAnyGenerated.bohrMagneton,
+  boltzmann: _pureFunctionsAnyGenerated.boltzmann,
+  conductanceQuantum: _pureFunctionsAnyGenerated.conductanceQuantum,
+  coulomb: _pureFunctionsAnyGenerated.coulomb,
+  createUnit: _pureFunctionsAnyGenerated.createUnit,
+  deuteronMass: _pureFunctionsAnyGenerated.deuteronMass,
+  dotPow: _pureFunctionsAnyGenerated.dotPow,
+  electricConstant: _pureFunctionsAnyGenerated.electricConstant,
+  elementaryCharge: _pureFunctionsAnyGenerated.elementaryCharge,
+  expm: _pureFunctionsAnyGenerated.expm,
+  faraday: _pureFunctionsAnyGenerated.faraday,
+  fft: _pureFunctionsAnyGenerated.fft,
+  gamma: _pureFunctionsAnyGenerated.gamma,
+  gravitationConstant: _pureFunctionsAnyGenerated.gravitationConstant,
+  hartreeEnergy: _pureFunctionsAnyGenerated.hartreeEnergy,
+  ifft: _pureFunctionsAnyGenerated.ifft,
+  inverseConductanceQuantum: _pureFunctionsAnyGenerated.inverseConductanceQuantum,
+  klitzing: _pureFunctionsAnyGenerated.klitzing,
+  loschmidt: _pureFunctionsAnyGenerated.loschmidt,
+  magneticConstant: _pureFunctionsAnyGenerated.magneticConstant,
+  molarMass: _pureFunctionsAnyGenerated.molarMass,
+  molarPlanckConstant: _pureFunctionsAnyGenerated.molarPlanckConstant,
+  neutronMass: _pureFunctionsAnyGenerated.neutronMass,
+  nuclearMagneton: _pureFunctionsAnyGenerated.nuclearMagneton,
+  planckCharge: _pureFunctionsAnyGenerated.planckCharge,
+  planckLength: _pureFunctionsAnyGenerated.planckLength,
+  planckTemperature: _pureFunctionsAnyGenerated.planckTemperature,
+  protonMass: _pureFunctionsAnyGenerated.protonMass,
+  quantumOfCirculation: _pureFunctionsAnyGenerated.quantumOfCirculation,
+  reducedPlanckConstant: _pureFunctionsAnyGenerated.reducedPlanckConstant,
+  rydberg: _pureFunctionsAnyGenerated.rydberg,
+  secondRadiation: _pureFunctionsAnyGenerated.secondRadiation,
+  setSize: _pureFunctionsAnyGenerated.setSize,
+  speedOfLight: _pureFunctionsAnyGenerated.speedOfLight,
+  stefanBoltzmann: _pureFunctionsAnyGenerated.stefanBoltzmann,
+  thomsonCrossSection: _pureFunctionsAnyGenerated.thomsonCrossSection,
+  avogadro: _pureFunctionsAnyGenerated.avogadro,
+  bohrRadius: _pureFunctionsAnyGenerated.bohrRadius,
+  coulombConstant: _pureFunctionsAnyGenerated.coulombConstant,
+  divide: _pureFunctionsAnyGenerated.divide,
+  electronMass: _pureFunctionsAnyGenerated.electronMass,
+  factorial: _pureFunctionsAnyGenerated.factorial,
+  firstRadiation: _pureFunctionsAnyGenerated.firstRadiation,
+  gravity: _pureFunctionsAnyGenerated.gravity,
+  intersect: _pureFunctionsAnyGenerated.intersect,
+  lup: _pureFunctionsAnyGenerated.lup,
+  magneticFluxQuantum: _pureFunctionsAnyGenerated.magneticFluxQuantum,
+  molarMassC12: _pureFunctionsAnyGenerated.molarMassC12,
+  multinomial: _pureFunctionsAnyGenerated.multinomial,
+  parse,
+  permutations: _pureFunctionsAnyGenerated.permutations,
+  planckMass: _pureFunctionsAnyGenerated.planckMass,
+  polynomialRoot: _pureFunctionsAnyGenerated.polynomialRoot,
+  resolve,
+  setIntersect: _pureFunctionsAnyGenerated.setIntersect,
+  simplifyConstant,
+  solveODE: _pureFunctionsAnyGenerated.solveODE,
+  stirlingS2: _pureFunctionsAnyGenerated.stirlingS2,
+  unit: _pureFunctionsAnyGenerated.unit,
+  bellNumbers: _pureFunctionsAnyGenerated.bellNumbers,
+  compile,
+  cumsum: _pureFunctionsAnyGenerated.cumsum,
+  eigs: _pureFunctionsAnyGenerated.eigs,
+  fermiCoupling: _pureFunctionsAnyGenerated.fermiCoupling,
+  gasConstant: _pureFunctionsAnyGenerated.gasConstant,
+  kldivergence: _pureFunctionsAnyGenerated.kldivergence,
+  lusolve: _pureFunctionsAnyGenerated.lusolve,
+  mean: _pureFunctionsAnyGenerated.mean,
+  molarVolume: _pureFunctionsAnyGenerated.molarVolume,
+  planckConstant: _pureFunctionsAnyGenerated.planckConstant,
+  quantileSeq: _pureFunctionsAnyGenerated.quantileSeq,
+  setUnion: _pureFunctionsAnyGenerated.setUnion,
+  simplifyCore,
+  variance: _pureFunctionsAnyGenerated.variance,
+  classicalElectronRadius: _pureFunctionsAnyGenerated.classicalElectronRadius,
+  evaluate,
+  median: _pureFunctionsAnyGenerated.median,
+  simplify,
+  symbolicEqual,
+  corr: _pureFunctionsAnyGenerated.corr,
+  freqz: _pureFunctionsAnyGenerated.freqz,
+  leafCount,
+  mad: _pureFunctionsAnyGenerated.mad,
+  parser,
+  rationalize,
+  std: _pureFunctionsAnyGenerated.std,
+  zeta: _pureFunctionsAnyGenerated.zeta,
+  derivative,
+  norm: _pureFunctionsAnyGenerated.norm,
+  rotationMatrix: _pureFunctionsAnyGenerated.rotationMatrix,
+  help,
+  planckTime: _pureFunctionsAnyGenerated.planckTime,
+  schur: _pureFunctionsAnyGenerated.schur,
+  rotate: _pureFunctionsAnyGenerated.rotate,
+  sylvester: _pureFunctionsAnyGenerated.sylvester,
+  lyap: _pureFunctionsAnyGenerated.lyap,
+  config: _configReadonly.config
+});
+(0, _extends2.default)(mathWithTransform, math, {
+  mapSlices: (0, _factoriesAny.createMapSlicesTransform)({
+    isInteger: _pureFunctionsAnyGenerated.isInteger,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  filter: (0, _factoriesAny.createFilterTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  forEach: (0, _factoriesAny.createForEachTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  map: (0, _factoriesAny.createMapTransform)({
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  or: (0, _factoriesAny.createOrTransform)({
+    DenseMatrix: _pureFunctionsAnyGenerated.DenseMatrix,
+    concat: _pureFunctionsAnyGenerated.concat,
+    equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  and: (0, _factoriesAny.createAndTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    concat: _pureFunctionsAnyGenerated.concat,
+    equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    not: _pureFunctionsAnyGenerated.not,
+    typed: _pureFunctionsAnyGenerated.typed,
+    zeros: _pureFunctionsAnyGenerated.zeros
+  }),
+  concat: (0, _factoriesAny.createConcatTransform)({
+    isInteger: _pureFunctionsAnyGenerated.isInteger,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  index: (0, _factoriesAny.createIndexTransform)({
+    Index: _pureFunctionsAnyGenerated.Index,
+    getMatrixDataType: _pureFunctionsAnyGenerated.getMatrixDataType
+  }),
+  print: (0, _factoriesAny.createPrintTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed,
+    zeros: _pureFunctionsAnyGenerated.zeros
+  }),
+  sum: (0, _factoriesAny.createSumTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    config: _configReadonly.config,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  bitAnd: (0, _factoriesAny.createBitAndTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    concat: _pureFunctionsAnyGenerated.concat,
+    equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    not: _pureFunctionsAnyGenerated.not,
+    typed: _pureFunctionsAnyGenerated.typed,
+    zeros: _pureFunctionsAnyGenerated.zeros
+  }),
+  min: (0, _factoriesAny.createMinTransform)({
+    config: _configReadonly.config,
+    isNaN: _pureFunctionsAnyGenerated.isNaN,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    smaller: _pureFunctionsAnyGenerated.smaller,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  nullish: (0, _factoriesAny.createNullishTransform)({
+    deepEqual: _pureFunctionsAnyGenerated.deepEqual,
+    flatten: _pureFunctionsAnyGenerated.flatten,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    size: _pureFunctionsAnyGenerated.size,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  subset: (0, _factoriesAny.createSubsetTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed,
+    zeros: _pureFunctionsAnyGenerated.zeros
+  }),
+  bitOr: (0, _factoriesAny.createBitOrTransform)({
+    DenseMatrix: _pureFunctionsAnyGenerated.DenseMatrix,
+    concat: _pureFunctionsAnyGenerated.concat,
+    equalScalar: _pureFunctionsAnyGenerated.equalScalar,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  cumsum: (0, _factoriesAny.createCumSumTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    typed: _pureFunctionsAnyGenerated.typed,
+    unaryPlus: _pureFunctionsAnyGenerated.unaryPlus
+  }),
+  diff: (0, _factoriesAny.createDiffTransform)({
+    bignumber: _pureFunctionsAnyGenerated.bignumber,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    number: _pureFunctionsAnyGenerated.number,
+    subtract: _pureFunctionsAnyGenerated.subtract,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  max: (0, _factoriesAny.createMaxTransform)({
+    config: _configReadonly.config,
+    isNaN: _pureFunctionsAnyGenerated.isNaN,
+    larger: _pureFunctionsAnyGenerated.larger,
+    numeric: _pureFunctionsAnyGenerated.numeric,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  range: (0, _factoriesAny.createRangeTransform)({
+    bignumber: _pureFunctionsAnyGenerated.bignumber,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    add: _pureFunctionsAnyGenerated.add,
+    config: _configReadonly.config,
+    equal: _pureFunctionsAnyGenerated.equal,
+    isPositive: _pureFunctionsAnyGenerated.isPositive,
+    isZero: _pureFunctionsAnyGenerated.isZero,
+    larger: _pureFunctionsAnyGenerated.larger,
+    largerEq: _pureFunctionsAnyGenerated.largerEq,
+    smaller: _pureFunctionsAnyGenerated.smaller,
+    smallerEq: _pureFunctionsAnyGenerated.smallerEq,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  row: (0, _factoriesAny.createRowTransform)({
+    Index: _pureFunctionsAnyGenerated.Index,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    range: _pureFunctionsAnyGenerated.range,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  column: (0, _factoriesAny.createColumnTransform)({
+    Index: _pureFunctionsAnyGenerated.Index,
+    matrix: _pureFunctionsAnyGenerated.matrix,
+    range: _pureFunctionsAnyGenerated.range,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  mean: (0, _factoriesAny.createMeanTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    divide: _pureFunctionsAnyGenerated.divide,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  quantileSeq: (0, _factoriesAny.createQuantileSeqTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    bignumber: _pureFunctionsAnyGenerated.bignumber,
+    compare: _pureFunctionsAnyGenerated.compare,
+    divide: _pureFunctionsAnyGenerated.divide,
+    isInteger: _pureFunctionsAnyGenerated.isInteger,
+    larger: _pureFunctionsAnyGenerated.larger,
+    mapSlices: _pureFunctionsAnyGenerated.mapSlices,
+    multiply: _pureFunctionsAnyGenerated.multiply,
+    partitionSelect: _pureFunctionsAnyGenerated.partitionSelect,
+    smaller: _pureFunctionsAnyGenerated.smaller,
+    smallerEq: _pureFunctionsAnyGenerated.smallerEq,
+    subtract: _pureFunctionsAnyGenerated.subtract,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  variance: (0, _factoriesAny.createVarianceTransform)({
+    add: _pureFunctionsAnyGenerated.add,
+    divide: _pureFunctionsAnyGenerated.divide,
+    isNaN: _pureFunctionsAnyGenerated.isNaN,
+    mapSlices: _pureFunctionsAnyGenerated.mapSlices,
+    multiply: _pureFunctionsAnyGenerated.multiply,
+    subtract: _pureFunctionsAnyGenerated.subtract,
+    typed: _pureFunctionsAnyGenerated.typed
+  }),
+  std: (0, _factoriesAny.createStdTransform)({
+    map: _pureFunctionsAnyGenerated.map,
+    sqrt: _pureFunctionsAnyGenerated.sqrt,
+    typed: _pureFunctionsAnyGenerated.typed,
+    variance: _pureFunctionsAnyGenerated.variance
+  })
+});
+(0, _extends2.default)(classes, {
+  BigNumber: _pureFunctionsAnyGenerated.BigNumber,
+  Complex: _pureFunctionsAnyGenerated.Complex,
+  Fraction: _pureFunctionsAnyGenerated.Fraction,
+  Matrix: _pureFunctionsAnyGenerated.Matrix,
+  Node,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  Range: _pureFunctionsAnyGenerated.Range,
+  RelationalNode,
+  ResultSet: _pureFunctionsAnyGenerated.ResultSet,
+  ArrayNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  DenseMatrix: _pureFunctionsAnyGenerated.DenseMatrix,
+  RangeNode,
+  Chain,
+  FunctionAssignmentNode,
+  SparseMatrix: _pureFunctionsAnyGenerated.SparseMatrix,
+  ImmutableDenseMatrix: _pureFunctionsAnyGenerated.ImmutableDenseMatrix,
+  Index: _pureFunctionsAnyGenerated.Index,
+  AccessorNode,
+  AssignmentNode,
+  FibonacciHeap: _pureFunctionsAnyGenerated.FibonacciHeap,
+  IndexNode,
+  Spa: _pureFunctionsAnyGenerated.Spa,
+  Unit: _pureFunctionsAnyGenerated.Unit,
+  SymbolNode,
+  FunctionNode,
+  Help,
+  Parser
+});
+Chain.createProxy(math);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js
new file mode 100644
index 0000000..0647e0a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/impureFunctionsNumber.generated.js
@@ -0,0 +1,512 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivative = exports.compile = exports.chain = exports.SymbolNode = exports.RelationalNode = exports.RangeNode = exports.Parser = exports.ParenthesisNode = exports.OperatorNode = exports.ObjectNode = exports.Node = exports.IndexNode = exports.Help = exports.FunctionNode = exports.FunctionAssignmentNode = exports.ConstantNode = exports.ConditionalNode = exports.Chain = exports.BlockNode = exports.AssignmentNode = exports.ArrayNode = exports.AccessorNode = void 0;
+Object.defineProperty(exports, "docs", {
+  enumerable: true,
+  get: function () {
+    return _embeddedDocs.embeddedDocs;
+  }
+});
+exports.simplifyCore = exports.simplifyConstant = exports.simplify = exports.reviver = exports.resolve = exports.rationalize = exports.parser = exports.parse = exports.help = exports.evaluate = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _configReadonly = require("./configReadonly.js");
+var _factoriesNumber = require("../factoriesNumber.js");
+var _pureFunctionsNumberGenerated = require("./pureFunctionsNumber.generated.js");
+var _embeddedDocs = require("../expression/embeddedDocs/embeddedDocs.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const math = {}; // NOT pure!
+const mathWithTransform = {}; // NOT pure!
+const classes = {}; // NOT pure!
+
+const Chain = exports.Chain = (0, _factoriesNumber.createChainClass)({
+  math,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const Node = exports.Node = (0, _factoriesNumber.createNode)({
+  mathWithTransform
+});
+const ObjectNode = exports.ObjectNode = (0, _factoriesNumber.createObjectNode)({
+  Node
+});
+const RangeNode = exports.RangeNode = (0, _factoriesNumber.createRangeNode)({
+  Node
+});
+const RelationalNode = exports.RelationalNode = (0, _factoriesNumber.createRelationalNode)({
+  Node
+});
+const reviver = exports.reviver = (0, _factoriesNumber.createReviver)({
+  classes
+});
+const SymbolNode = exports.SymbolNode = (0, _factoriesNumber.createSymbolNode)({
+  Node,
+  math
+});
+const AccessorNode = exports.AccessorNode = (0, _factoriesNumber.createAccessorNode)({
+  Node,
+  subset: _pureFunctionsNumberGenerated.subset
+});
+const AssignmentNode = exports.AssignmentNode = (0, _factoriesNumber.createAssignmentNode)({
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  Node,
+  subset: _pureFunctionsNumberGenerated.subset
+});
+const BlockNode = exports.BlockNode = (0, _factoriesNumber.createBlockNode)({
+  Node,
+  ResultSet: _pureFunctionsNumberGenerated.ResultSet
+});
+const chain = exports.chain = (0, _factoriesNumber.createChain)({
+  Chain,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const ConditionalNode = exports.ConditionalNode = (0, _factoriesNumber.createConditionalNode)({
+  Node
+});
+const FunctionNode = exports.FunctionNode = (0, _factoriesNumber.createFunctionNode)({
+  Node,
+  SymbolNode,
+  math
+});
+const IndexNode = exports.IndexNode = (0, _factoriesNumber.createIndexNode)({
+  Node,
+  size: _pureFunctionsNumberGenerated.size
+});
+const OperatorNode = exports.OperatorNode = (0, _factoriesNumber.createOperatorNode)({
+  Node
+});
+const ArrayNode = exports.ArrayNode = (0, _factoriesNumber.createArrayNode)({
+  Node
+});
+const ConstantNode = exports.ConstantNode = (0, _factoriesNumber.createConstantNode)({
+  Node
+});
+const FunctionAssignmentNode = exports.FunctionAssignmentNode = (0, _factoriesNumber.createFunctionAssignmentNode)({
+  Node,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const ParenthesisNode = exports.ParenthesisNode = (0, _factoriesNumber.createParenthesisNode)({
+  Node
+});
+const simplifyConstant = exports.simplifyConstant = (0, _factoriesNumber.createSimplifyConstant)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  mathWithTransform,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const parse = exports.parse = (0, _factoriesNumber.createParse)({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const resolve = exports.resolve = (0, _factoriesNumber.createResolve)({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const simplifyCore = exports.simplifyCore = (0, _factoriesNumber.createSimplifyCore)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add: _pureFunctionsNumberGenerated.add,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  parse,
+  pow: _pureFunctionsNumberGenerated.pow,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const compile = exports.compile = (0, _factoriesNumber.createCompile)({
+  parse,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const evaluate = exports.evaluate = (0, _factoriesNumber.createEvaluate)({
+  parse,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const Help = exports.Help = (0, _factoriesNumber.createHelpClass)({
+  evaluate
+});
+const Parser = exports.Parser = (0, _factoriesNumber.createParserClass)({
+  evaluate,
+  parse
+});
+const simplify = exports.simplify = (0, _factoriesNumber.createSimplify)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  equal: _pureFunctionsNumberGenerated.equal,
+  parse,
+  replacer: _pureFunctionsNumberGenerated.replacer,
+  resolve,
+  simplifyConstant,
+  simplifyCore,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const derivative = exports.derivative = (0, _factoriesNumber.createDerivative)({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config: _configReadonly.config,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  parse,
+  simplify,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const rationalize = exports.rationalize = (0, _factoriesNumber.createRationalize)({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add: _pureFunctionsNumberGenerated.add,
+  config: _configReadonly.config,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equal: _pureFunctionsNumberGenerated.equal,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  mathWithTransform,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  parse,
+  pow: _pureFunctionsNumberGenerated.pow,
+  simplify,
+  simplifyConstant,
+  simplifyCore,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const help = exports.help = (0, _factoriesNumber.createHelp)({
+  Help,
+  mathWithTransform,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+const parser = exports.parser = (0, _factoriesNumber.createParser)({
+  Parser,
+  typed: _pureFunctionsNumberGenerated.typed
+});
+(0, _extends2.default)(math, {
+  e: _pureFunctionsNumberGenerated.e,
+  false: _pureFunctionsNumberGenerated._false,
+  index: _pureFunctionsNumberGenerated.index,
+  Infinity: _pureFunctionsNumberGenerated._Infinity,
+  LN10: _pureFunctionsNumberGenerated.LN10,
+  LOG10E: _pureFunctionsNumberGenerated.LOG10E,
+  matrix: _pureFunctionsNumberGenerated.matrix,
+  NaN: _pureFunctionsNumberGenerated._NaN,
+  null: _pureFunctionsNumberGenerated._null,
+  phi: _pureFunctionsNumberGenerated.phi,
+  replacer: _pureFunctionsNumberGenerated.replacer,
+  SQRT1_2: _pureFunctionsNumberGenerated.SQRT1_2,
+  subset: _pureFunctionsNumberGenerated.subset,
+  tau: _pureFunctionsNumberGenerated.tau,
+  typed: _pureFunctionsNumberGenerated.typed,
+  unaryPlus: _pureFunctionsNumberGenerated.unaryPlus,
+  'E': _pureFunctionsNumberGenerated.e,
+  version: _pureFunctionsNumberGenerated.version,
+  xor: _pureFunctionsNumberGenerated.xor,
+  abs: _pureFunctionsNumberGenerated.abs,
+  acos: _pureFunctionsNumberGenerated.acos,
+  acot: _pureFunctionsNumberGenerated.acot,
+  acsc: _pureFunctionsNumberGenerated.acsc,
+  add: _pureFunctionsNumberGenerated.add,
+  and: _pureFunctionsNumberGenerated.and,
+  asec: _pureFunctionsNumberGenerated.asec,
+  asin: _pureFunctionsNumberGenerated.asin,
+  atan: _pureFunctionsNumberGenerated.atan,
+  atanh: _pureFunctionsNumberGenerated.atanh,
+  bigint: _pureFunctionsNumberGenerated.bigint,
+  bitNot: _pureFunctionsNumberGenerated.bitNot,
+  bitXor: _pureFunctionsNumberGenerated.bitXor,
+  boolean: _pureFunctionsNumberGenerated.boolean,
+  cbrt: _pureFunctionsNumberGenerated.cbrt,
+  combinations: _pureFunctionsNumberGenerated.combinations,
+  compare: _pureFunctionsNumberGenerated.compare,
+  compareText: _pureFunctionsNumberGenerated.compareText,
+  cos: _pureFunctionsNumberGenerated.cos,
+  cot: _pureFunctionsNumberGenerated.cot,
+  csc: _pureFunctionsNumberGenerated.csc,
+  cube: _pureFunctionsNumberGenerated.cube,
+  divide: _pureFunctionsNumberGenerated.divide,
+  equalScalar: _pureFunctionsNumberGenerated.equalScalar,
+  erf: _pureFunctionsNumberGenerated.erf,
+  exp: _pureFunctionsNumberGenerated.exp,
+  filter: _pureFunctionsNumberGenerated.filter,
+  forEach: _pureFunctionsNumberGenerated.forEach,
+  format: _pureFunctionsNumberGenerated.format,
+  gamma: _pureFunctionsNumberGenerated.gamma,
+  isInteger: _pureFunctionsNumberGenerated.isInteger,
+  isNegative: _pureFunctionsNumberGenerated.isNegative,
+  isPositive: _pureFunctionsNumberGenerated.isPositive,
+  isZero: _pureFunctionsNumberGenerated.isZero,
+  LOG2E: _pureFunctionsNumberGenerated.LOG2E,
+  largerEq: _pureFunctionsNumberGenerated.largerEq,
+  leftShift: _pureFunctionsNumberGenerated.leftShift,
+  log: _pureFunctionsNumberGenerated.log,
+  log1p: _pureFunctionsNumberGenerated.log1p,
+  map: _pureFunctionsNumberGenerated.map,
+  mean: _pureFunctionsNumberGenerated.mean,
+  mod: _pureFunctionsNumberGenerated.mod,
+  multiply: _pureFunctionsNumberGenerated.multiply,
+  not: _pureFunctionsNumberGenerated.not,
+  number: _pureFunctionsNumberGenerated.number,
+  or: _pureFunctionsNumberGenerated.or,
+  pi: _pureFunctionsNumberGenerated.pi,
+  pow: _pureFunctionsNumberGenerated.pow,
+  random: _pureFunctionsNumberGenerated.random,
+  reviver,
+  rightLogShift: _pureFunctionsNumberGenerated.rightLogShift,
+  SQRT2: _pureFunctionsNumberGenerated.SQRT2,
+  sech: _pureFunctionsNumberGenerated.sech,
+  sin: _pureFunctionsNumberGenerated.sin,
+  size: _pureFunctionsNumberGenerated.size,
+  smallerEq: _pureFunctionsNumberGenerated.smallerEq,
+  square: _pureFunctionsNumberGenerated.square,
+  string: _pureFunctionsNumberGenerated.string,
+  subtract: _pureFunctionsNumberGenerated.subtract,
+  tanh: _pureFunctionsNumberGenerated.tanh,
+  typeOf: _pureFunctionsNumberGenerated.typeOf,
+  unequal: _pureFunctionsNumberGenerated.unequal,
+  xgcd: _pureFunctionsNumberGenerated.xgcd,
+  acoth: _pureFunctionsNumberGenerated.acoth,
+  addScalar: _pureFunctionsNumberGenerated.addScalar,
+  asech: _pureFunctionsNumberGenerated.asech,
+  bitAnd: _pureFunctionsNumberGenerated.bitAnd,
+  chain,
+  combinationsWithRep: _pureFunctionsNumberGenerated.combinationsWithRep,
+  cosh: _pureFunctionsNumberGenerated.cosh,
+  csch: _pureFunctionsNumberGenerated.csch,
+  divideScalar: _pureFunctionsNumberGenerated.divideScalar,
+  equalText: _pureFunctionsNumberGenerated.equalText,
+  expm1: _pureFunctionsNumberGenerated.expm1,
+  isNumeric: _pureFunctionsNumberGenerated.isNumeric,
+  LN2: _pureFunctionsNumberGenerated.LN2,
+  lcm: _pureFunctionsNumberGenerated.lcm,
+  log10: _pureFunctionsNumberGenerated.log10,
+  mapSlices: _pureFunctionsNumberGenerated.mapSlices,
+  multiplyScalar: _pureFunctionsNumberGenerated.multiplyScalar,
+  nthRoot: _pureFunctionsNumberGenerated.nthRoot,
+  pickRandom: _pureFunctionsNumberGenerated.pickRandom,
+  rightArithShift: _pureFunctionsNumberGenerated.rightArithShift,
+  sec: _pureFunctionsNumberGenerated.sec,
+  sinh: _pureFunctionsNumberGenerated.sinh,
+  sqrt: _pureFunctionsNumberGenerated.sqrt,
+  tan: _pureFunctionsNumberGenerated.tan,
+  unaryMinus: _pureFunctionsNumberGenerated.unaryMinus,
+  acosh: _pureFunctionsNumberGenerated.acosh,
+  atan2: _pureFunctionsNumberGenerated.atan2,
+  bitOr: _pureFunctionsNumberGenerated.bitOr,
+  clone: _pureFunctionsNumberGenerated.clone,
+  coth: _pureFunctionsNumberGenerated.coth,
+  equal: _pureFunctionsNumberGenerated.equal,
+  factorial: _pureFunctionsNumberGenerated.factorial,
+  hasNumericValue: _pureFunctionsNumberGenerated.hasNumericValue,
+  isNaN: _pureFunctionsNumberGenerated.isNaN,
+  larger: _pureFunctionsNumberGenerated.larger,
+  log2: _pureFunctionsNumberGenerated.log2,
+  mode: _pureFunctionsNumberGenerated.mode,
+  norm: _pureFunctionsNumberGenerated.norm,
+  partitionSelect: _pureFunctionsNumberGenerated.partitionSelect,
+  print: _pureFunctionsNumberGenerated.print,
+  randomInt: _pureFunctionsNumberGenerated.randomInt,
+  round: _pureFunctionsNumberGenerated.round,
+  simplifyConstant,
+  smaller: _pureFunctionsNumberGenerated.smaller,
+  subtractScalar: _pureFunctionsNumberGenerated.subtractScalar,
+  true: _pureFunctionsNumberGenerated._true,
+  variance: _pureFunctionsNumberGenerated.variance,
+  zeta: _pureFunctionsNumberGenerated.zeta,
+  acsch: _pureFunctionsNumberGenerated.acsch,
+  catalan: _pureFunctionsNumberGenerated.catalan,
+  compareNatural: _pureFunctionsNumberGenerated.compareNatural,
+  composition: _pureFunctionsNumberGenerated.composition,
+  cumsum: _pureFunctionsNumberGenerated.cumsum,
+  floor: _pureFunctionsNumberGenerated.floor,
+  hypot: _pureFunctionsNumberGenerated.hypot,
+  lgamma: _pureFunctionsNumberGenerated.lgamma,
+  median: _pureFunctionsNumberGenerated.median,
+  multinomial: _pureFunctionsNumberGenerated.multinomial,
+  permutations: _pureFunctionsNumberGenerated.permutations,
+  quantileSeq: _pureFunctionsNumberGenerated.quantileSeq,
+  sign: _pureFunctionsNumberGenerated.sign,
+  std: _pureFunctionsNumberGenerated.std,
+  stirlingS2: _pureFunctionsNumberGenerated.stirlingS2,
+  'PI': _pureFunctionsNumberGenerated.pi,
+  asinh: _pureFunctionsNumberGenerated.asinh,
+  ceil: _pureFunctionsNumberGenerated.ceil,
+  deepEqual: _pureFunctionsNumberGenerated.deepEqual,
+  fix: _pureFunctionsNumberGenerated.fix,
+  isPrime: _pureFunctionsNumberGenerated.isPrime,
+  numeric: _pureFunctionsNumberGenerated.numeric,
+  prod: _pureFunctionsNumberGenerated.prod,
+  bellNumbers: _pureFunctionsNumberGenerated.bellNumbers,
+  gcd: _pureFunctionsNumberGenerated.gcd,
+  mad: _pureFunctionsNumberGenerated.mad,
+  range: _pureFunctionsNumberGenerated.range,
+  sum: _pureFunctionsNumberGenerated.sum,
+  corr: _pureFunctionsNumberGenerated.corr,
+  max: _pureFunctionsNumberGenerated.max,
+  parse,
+  resolve,
+  simplifyCore,
+  compile,
+  evaluate,
+  simplify,
+  derivative,
+  min: _pureFunctionsNumberGenerated.min,
+  rationalize,
+  help,
+  parser,
+  config: _configReadonly.config
+});
+(0, _extends2.default)(mathWithTransform, math, {
+  cumsum: (0, _factoriesNumber.createCumSumTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    typed: _pureFunctionsNumberGenerated.typed,
+    unaryPlus: _pureFunctionsNumberGenerated.unaryPlus
+  }),
+  mapSlices: (0, _factoriesNumber.createMapSlicesTransform)({
+    isInteger: _pureFunctionsNumberGenerated.isInteger,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  filter: (0, _factoriesNumber.createFilterTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  forEach: (0, _factoriesNumber.createForEachTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  mean: (0, _factoriesNumber.createMeanTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    divide: _pureFunctionsNumberGenerated.divide,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  subset: (0, _factoriesNumber.createSubsetTransform)({}),
+  map: (0, _factoriesNumber.createMapTransform)({
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  range: (0, _factoriesNumber.createRangeTransform)({
+    matrix: _pureFunctionsNumberGenerated.matrix,
+    add: _pureFunctionsNumberGenerated.add,
+    config: _configReadonly.config,
+    equal: _pureFunctionsNumberGenerated.equal,
+    isPositive: _pureFunctionsNumberGenerated.isPositive,
+    isZero: _pureFunctionsNumberGenerated.isZero,
+    larger: _pureFunctionsNumberGenerated.larger,
+    largerEq: _pureFunctionsNumberGenerated.largerEq,
+    smaller: _pureFunctionsNumberGenerated.smaller,
+    smallerEq: _pureFunctionsNumberGenerated.smallerEq,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  std: (0, _factoriesNumber.createStdTransform)({
+    map: _pureFunctionsNumberGenerated.map,
+    sqrt: _pureFunctionsNumberGenerated.sqrt,
+    typed: _pureFunctionsNumberGenerated.typed,
+    variance: _pureFunctionsNumberGenerated.variance
+  }),
+  sum: (0, _factoriesNumber.createSumTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    config: _configReadonly.config,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  max: (0, _factoriesNumber.createMaxTransform)({
+    config: _configReadonly.config,
+    isNaN: _pureFunctionsNumberGenerated.isNaN,
+    larger: _pureFunctionsNumberGenerated.larger,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  min: (0, _factoriesNumber.createMinTransform)({
+    config: _configReadonly.config,
+    isNaN: _pureFunctionsNumberGenerated.isNaN,
+    numeric: _pureFunctionsNumberGenerated.numeric,
+    smaller: _pureFunctionsNumberGenerated.smaller,
+    typed: _pureFunctionsNumberGenerated.typed
+  }),
+  variance: (0, _factoriesNumber.createVarianceTransform)({
+    add: _pureFunctionsNumberGenerated.add,
+    divide: _pureFunctionsNumberGenerated.divide,
+    isNaN: _pureFunctionsNumberGenerated.isNaN,
+    mapSlices: _pureFunctionsNumberGenerated.mapSlices,
+    multiply: _pureFunctionsNumberGenerated.multiply,
+    subtract: _pureFunctionsNumberGenerated.subtract,
+    typed: _pureFunctionsNumberGenerated.typed
+  })
+});
+(0, _extends2.default)(classes, {
+  Range: _pureFunctionsNumberGenerated.Range,
+  ResultSet: _pureFunctionsNumberGenerated.ResultSet,
+  Chain,
+  Node,
+  ObjectNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  AccessorNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  FunctionNode,
+  IndexNode,
+  OperatorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  ParenthesisNode,
+  Help,
+  Parser
+});
+Chain.createProxy(math);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/mainAny.js b/node_modules/mathjs/lib/cjs/entry/mainAny.js
new file mode 100644
index 0000000..2b46e44
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/mainAny.js
@@ -0,0 +1,115 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  config: true,
+  IndexError: true,
+  DimensionError: true,
+  ArgumentsError: true,
+  create: true,
+  factory: true
+};
+Object.defineProperty(exports, "ArgumentsError", {
+  enumerable: true,
+  get: function () {
+    return _ArgumentsError.ArgumentsError;
+  }
+});
+Object.defineProperty(exports, "DimensionError", {
+  enumerable: true,
+  get: function () {
+    return _DimensionError.DimensionError;
+  }
+});
+Object.defineProperty(exports, "IndexError", {
+  enumerable: true,
+  get: function () {
+    return _IndexError.IndexError;
+  }
+});
+Object.defineProperty(exports, "config", {
+  enumerable: true,
+  get: function () {
+    return _configReadonly.config;
+  }
+});
+Object.defineProperty(exports, "create", {
+  enumerable: true,
+  get: function () {
+    return _create.create;
+  }
+});
+Object.defineProperty(exports, "factory", {
+  enumerable: true,
+  get: function () {
+    return _factory.factory;
+  }
+});
+var _configReadonly = require("./configReadonly.js");
+var _pureFunctionsAnyGenerated = require("./pureFunctionsAny.generated.js");
+Object.keys(_pureFunctionsAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _pureFunctionsAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _pureFunctionsAnyGenerated[key];
+    }
+  });
+});
+var _impureFunctionsAnyGenerated = require("./impureFunctionsAny.generated.js");
+Object.keys(_impureFunctionsAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _impureFunctionsAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _impureFunctionsAnyGenerated[key];
+    }
+  });
+});
+var _typeChecks = require("./typeChecks.js");
+Object.keys(_typeChecks).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _typeChecks[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _typeChecks[key];
+    }
+  });
+});
+var _IndexError = require("../error/IndexError.js");
+var _DimensionError = require("../error/DimensionError.js");
+var _ArgumentsError = require("../error/ArgumentsError.js");
+var _dependenciesAnyGenerated = require("./dependenciesAny.generated.js");
+Object.keys(_dependenciesAnyGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _dependenciesAnyGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _dependenciesAnyGenerated[key];
+    }
+  });
+});
+var _factoriesAny = require("../factoriesAny.js");
+Object.keys(_factoriesAny).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _factoriesAny[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _factoriesAny[key];
+    }
+  });
+});
+var _create = require("../core/create.js");
+var _factory = require("../utils/factory.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/mainNumber.js b/node_modules/mathjs/lib/cjs/entry/mainNumber.js
new file mode 100644
index 0000000..8e1e282
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/mainNumber.js
@@ -0,0 +1,115 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  config: true,
+  IndexError: true,
+  DimensionError: true,
+  ArgumentsError: true,
+  create: true,
+  factory: true
+};
+Object.defineProperty(exports, "ArgumentsError", {
+  enumerable: true,
+  get: function () {
+    return _ArgumentsError.ArgumentsError;
+  }
+});
+Object.defineProperty(exports, "DimensionError", {
+  enumerable: true,
+  get: function () {
+    return _DimensionError.DimensionError;
+  }
+});
+Object.defineProperty(exports, "IndexError", {
+  enumerable: true,
+  get: function () {
+    return _IndexError.IndexError;
+  }
+});
+Object.defineProperty(exports, "config", {
+  enumerable: true,
+  get: function () {
+    return _configReadonly.config;
+  }
+});
+Object.defineProperty(exports, "create", {
+  enumerable: true,
+  get: function () {
+    return _create.create;
+  }
+});
+Object.defineProperty(exports, "factory", {
+  enumerable: true,
+  get: function () {
+    return _factory.factory;
+  }
+});
+var _configReadonly = require("./configReadonly.js");
+var _pureFunctionsNumberGenerated = require("./pureFunctionsNumber.generated.js");
+Object.keys(_pureFunctionsNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _pureFunctionsNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _pureFunctionsNumberGenerated[key];
+    }
+  });
+});
+var _impureFunctionsNumberGenerated = require("./impureFunctionsNumber.generated.js");
+Object.keys(_impureFunctionsNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _impureFunctionsNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _impureFunctionsNumberGenerated[key];
+    }
+  });
+});
+var _typeChecks = require("./typeChecks.js");
+Object.keys(_typeChecks).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _typeChecks[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _typeChecks[key];
+    }
+  });
+});
+var _IndexError = require("../error/IndexError.js");
+var _DimensionError = require("../error/DimensionError.js");
+var _ArgumentsError = require("../error/ArgumentsError.js");
+var _dependenciesNumberGenerated = require("./dependenciesNumber.generated.js");
+Object.keys(_dependenciesNumberGenerated).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _dependenciesNumberGenerated[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _dependenciesNumberGenerated[key];
+    }
+  });
+});
+var _factoriesNumber = require("../factoriesNumber.js");
+Object.keys(_factoriesNumber).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _factoriesNumber[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _factoriesNumber[key];
+    }
+  });
+});
+var _create = require("../core/create.js");
+var _factory = require("../utils/factory.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js b/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js
new file mode 100644
index 0000000..97a28aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/pureFunctionsAny.generated.js
@@ -0,0 +1,1837 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotPow = exports.dotMultiply = exports.dotDivide = exports.dot = exports.divideScalar = exports.divide = exports.distance = exports.diff = exports.diag = exports.deuteronMass = exports.det = exports.deepEqual = exports.cumsum = exports.cube = exports.ctranspose = exports.csch = exports.csc = exports.cross = exports.createUnit = exports.count = exports.coulombConstant = exports.coulomb = exports.coth = exports.cot = exports.cosh = exports.cos = exports.corr = exports.conj = exports.conductanceQuantum = exports.concat = exports.composition = exports.complex = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.column = exports.clone = exports.classicalElectronRadius = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.boltzmann = exports.bohrRadius = exports.bohrMagneton = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bin = exports.bignumber = exports.bigint = exports.bellNumbers = exports.avogadro = exports.atomicMass = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.arg = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.Unit = exports.SparseMatrix = exports.Spa = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.Matrix = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = exports.Index = exports.ImmutableDenseMatrix = exports.Fraction = exports.FibonacciHeap = exports.DenseMatrix = exports.Complex = exports.BigNumber = void 0;
+exports.nullish = exports.nuclearMagneton = exports.nthRoots = exports.nthRoot = exports.not = exports.norm = exports.neutronMass = exports.multiplyScalar = exports.multiply = exports.multinomial = exports.molarVolume = exports.molarPlanckConstant = exports.molarMassC12 = exports.molarMass = exports.mode = exports.mod = exports.min = exports.median = exports.mean = exports.max = exports.matrixFromRows = exports.matrixFromFunction = exports.matrixFromColumns = exports.matrix = exports.mapSlices = exports.map = exports.magneticFluxQuantum = exports.magneticConstant = exports.mad = exports.lyap = exports.lusolve = exports.lup = exports.lsolveAll = exports.lsolve = exports.loschmidt = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.lgamma = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.kron = exports.klitzing = exports.kldivergence = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.invmod = exports.inverseConductanceQuantum = exports.inv = exports.intersect = exports.index = exports.im = exports.ifft = exports.identity = exports.i = exports.hypot = exports.hex = exports.hasNumericValue = exports.hartreeEnergy = exports.gravity = exports.gravitationConstant = exports.getMatrixDataType = exports.gcd = exports.gasConstant = exports.gamma = exports.freqz = exports.fraction = exports.format = exports.forEach = exports.floor = exports.flatten = exports.fix = exports.firstRadiation = exports.fineStructure = exports.filter = exports.fft = exports.fermiCoupling = exports.faraday = exports.factorial = exports.expm1 = exports.expm = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.elementaryCharge = exports.electronMass = exports.electricConstant = exports.eigs = exports.efimovFactor = exports.e = void 0;
+exports.weakMixingAngle = exports.version = exports.variance = exports.vacuumImpedance = exports.usolveAll = exports.usolve = exports.unit = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.transpose = exports.trace = exports.toBest = exports.to = exports.thomsonCrossSection = exports.tau = exports.tanh = exports.tan = exports.sylvester = exports.sum = exports.subtractScalar = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.stefanBoltzmann = exports.std = exports.squeeze = exports.square = exports.sqrtm = exports.sqrt = exports.splitUnit = exports.speedOfLight = exports.sparse = exports.sort = exports.solveODE = exports.smallerEq = exports.smaller = exports.slu = exports.size = exports.sinh = exports.sin = exports.sign = exports.setUnion = exports.setSymDifference = exports.setSize = exports.setPowerset = exports.setMultiplicity = exports.setIsSubset = exports.setIntersect = exports.setDistinct = exports.setDifference = exports.setCartesian = exports.secondRadiation = exports.sech = exports.sec = exports.schur = exports.sackurTetrode = exports.rydberg = exports.row = exports.round = exports.rotationMatrix = exports.rotate = exports.rightLogShift = exports.rightArithShift = exports.resize = exports.reshape = exports.replacer = exports.reducedPlanckConstant = exports.re = exports.range = exports.randomInt = exports.random = exports.quantumOfCirculation = exports.quantileSeq = exports.qr = exports.protonMass = exports.prod = exports.print = exports.pow = exports.polynomialRoot = exports.planckTime = exports.planckTemperature = exports.planckMass = exports.planckLength = exports.planckConstant = exports.planckCharge = exports.pinv = exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.ones = exports.oct = exports.numeric = exports.number = void 0;
+exports.zpk2tf = exports.zeta = exports.zeros = exports.xor = exports.xgcd = exports.wienDisplacement = void 0;
+var _configReadonly = require("./configReadonly.js");
+var _factoriesAny = require("../factoriesAny.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const BigNumber = exports.BigNumber = /* #__PURE__ */(0, _factoriesAny.createBigNumberClass)({
+  config: _configReadonly.config
+});
+const Complex = exports.Complex = /* #__PURE__ */(0, _factoriesAny.createComplexClass)({});
+const e = exports.e = /* #__PURE__ */(0, _factoriesAny.createE)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const _false = exports._false = /* #__PURE__ */(0, _factoriesAny.createFalse)({});
+const fineStructure = exports.fineStructure = /* #__PURE__ */(0, _factoriesAny.createFineStructure)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const Fraction = exports.Fraction = /* #__PURE__ */(0, _factoriesAny.createFractionClass)({});
+const i = exports.i = /* #__PURE__ */(0, _factoriesAny.createI)({
+  Complex
+});
+const _Infinity = exports._Infinity = /* #__PURE__ */(0, _factoriesAny.createInfinity)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const LN10 = exports.LN10 = /* #__PURE__ */(0, _factoriesAny.createLN10)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const LOG10E = exports.LOG10E = /* #__PURE__ */(0, _factoriesAny.createLOG10E)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const Matrix = exports.Matrix = /* #__PURE__ */(0, _factoriesAny.createMatrixClass)({});
+const _NaN = exports._NaN = /* #__PURE__ */(0, _factoriesAny.createNaN)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const _null = exports._null = /* #__PURE__ */(0, _factoriesAny.createNull)({});
+const phi = exports.phi = /* #__PURE__ */(0, _factoriesAny.createPhi)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const Range = exports.Range = /* #__PURE__ */(0, _factoriesAny.createRangeClass)({});
+const ResultSet = exports.ResultSet = /* #__PURE__ */(0, _factoriesAny.createResultSet)({});
+const SQRT1_2 = exports.SQRT1_2 = /* #__PURE__ */(0, _factoriesAny.createSQRT1_2)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const sackurTetrode = exports.sackurTetrode = /* #__PURE__ */(0, _factoriesAny.createSackurTetrode)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const tau = exports.tau = /* #__PURE__ */(0, _factoriesAny.createTau)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const _true = exports._true = /* #__PURE__ */(0, _factoriesAny.createTrue)({});
+const version = exports.version = /* #__PURE__ */(0, _factoriesAny.createVersion)({});
+const DenseMatrix = exports.DenseMatrix = /* #__PURE__ */(0, _factoriesAny.createDenseMatrixClass)({
+  Matrix
+});
+const efimovFactor = exports.efimovFactor = /* #__PURE__ */(0, _factoriesAny.createEfimovFactor)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const LN2 = exports.LN2 = /* #__PURE__ */(0, _factoriesAny.createLN2)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const pi = exports.pi = /* #__PURE__ */(0, _factoriesAny.createPi)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const replacer = exports.replacer = /* #__PURE__ */(0, _factoriesAny.createReplacer)({});
+const SQRT2 = exports.SQRT2 = /* #__PURE__ */(0, _factoriesAny.createSQRT2)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const typed = exports.typed = /* #__PURE__ */(0, _factoriesAny.createTyped)({
+  BigNumber,
+  Complex,
+  DenseMatrix,
+  Fraction
+});
+const weakMixingAngle = exports.weakMixingAngle = /* #__PURE__ */(0, _factoriesAny.createWeakMixingAngle)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const abs = exports.abs = /* #__PURE__ */(0, _factoriesAny.createAbs)({
+  typed
+});
+const acos = exports.acos = /* #__PURE__ */(0, _factoriesAny.createAcos)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const acot = exports.acot = /* #__PURE__ */(0, _factoriesAny.createAcot)({
+  BigNumber,
+  typed
+});
+const acsc = exports.acsc = /* #__PURE__ */(0, _factoriesAny.createAcsc)({
+  BigNumber,
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const addScalar = exports.addScalar = /* #__PURE__ */(0, _factoriesAny.createAddScalar)({
+  typed
+});
+const arg = exports.arg = /* #__PURE__ */(0, _factoriesAny.createArg)({
+  typed
+});
+const asech = exports.asech = /* #__PURE__ */(0, _factoriesAny.createAsech)({
+  BigNumber,
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const asinh = exports.asinh = /* #__PURE__ */(0, _factoriesAny.createAsinh)({
+  typed
+});
+const atan = exports.atan = /* #__PURE__ */(0, _factoriesAny.createAtan)({
+  typed
+});
+const atanh = exports.atanh = /* #__PURE__ */(0, _factoriesAny.createAtanh)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const bigint = exports.bigint = /* #__PURE__ */(0, _factoriesAny.createBigint)({
+  typed
+});
+const bitNot = exports.bitNot = /* #__PURE__ */(0, _factoriesAny.createBitNot)({
+  typed
+});
+const boolean = exports.boolean = /* #__PURE__ */(0, _factoriesAny.createBoolean)({
+  typed
+});
+const clone = exports.clone = /* #__PURE__ */(0, _factoriesAny.createClone)({
+  typed
+});
+const combinations = exports.combinations = /* #__PURE__ */(0, _factoriesAny.createCombinations)({
+  typed
+});
+const complex = exports.complex = /* #__PURE__ */(0, _factoriesAny.createComplex)({
+  Complex,
+  typed
+});
+const conj = exports.conj = /* #__PURE__ */(0, _factoriesAny.createConj)({
+  typed
+});
+const cos = exports.cos = /* #__PURE__ */(0, _factoriesAny.createCos)({
+  typed
+});
+const cot = exports.cot = /* #__PURE__ */(0, _factoriesAny.createCot)({
+  BigNumber,
+  typed
+});
+const csc = exports.csc = /* #__PURE__ */(0, _factoriesAny.createCsc)({
+  BigNumber,
+  typed
+});
+const cube = exports.cube = /* #__PURE__ */(0, _factoriesAny.createCube)({
+  typed
+});
+const equalScalar = exports.equalScalar = /* #__PURE__ */(0, _factoriesAny.createEqualScalar)({
+  config: _configReadonly.config,
+  typed
+});
+const erf = exports.erf = /* #__PURE__ */(0, _factoriesAny.createErf)({
+  typed
+});
+const exp = exports.exp = /* #__PURE__ */(0, _factoriesAny.createExp)({
+  typed
+});
+const expm1 = exports.expm1 = /* #__PURE__ */(0, _factoriesAny.createExpm1)({
+  Complex,
+  typed
+});
+const filter = exports.filter = /* #__PURE__ */(0, _factoriesAny.createFilter)({
+  typed
+});
+const flatten = exports.flatten = /* #__PURE__ */(0, _factoriesAny.createFlatten)({
+  typed
+});
+const forEach = exports.forEach = /* #__PURE__ */(0, _factoriesAny.createForEach)({
+  typed
+});
+const format = exports.format = /* #__PURE__ */(0, _factoriesAny.createFormat)({
+  typed
+});
+const getMatrixDataType = exports.getMatrixDataType = /* #__PURE__ */(0, _factoriesAny.createGetMatrixDataType)({
+  typed
+});
+const hex = exports.hex = /* #__PURE__ */(0, _factoriesAny.createHex)({
+  format,
+  typed
+});
+const im = exports.im = /* #__PURE__ */(0, _factoriesAny.createIm)({
+  typed
+});
+const isInteger = exports.isInteger = /* #__PURE__ */(0, _factoriesAny.createIsInteger)({
+  typed
+});
+const isNegative = exports.isNegative = /* #__PURE__ */(0, _factoriesAny.createIsNegative)({
+  config: _configReadonly.config,
+  typed
+});
+const isPositive = exports.isPositive = /* #__PURE__ */(0, _factoriesAny.createIsPositive)({
+  config: _configReadonly.config,
+  typed
+});
+const isZero = exports.isZero = /* #__PURE__ */(0, _factoriesAny.createIsZero)({
+  equalScalar,
+  typed
+});
+const LOG2E = exports.LOG2E = /* #__PURE__ */(0, _factoriesAny.createLOG2E)({
+  BigNumber,
+  config: _configReadonly.config
+});
+const lgamma = exports.lgamma = /* #__PURE__ */(0, _factoriesAny.createLgamma)({
+  Complex,
+  typed
+});
+const log10 = exports.log10 = /* #__PURE__ */(0, _factoriesAny.createLog10)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const log2 = exports.log2 = /* #__PURE__ */(0, _factoriesAny.createLog2)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const map = exports.map = /* #__PURE__ */(0, _factoriesAny.createMap)({
+  typed
+});
+const multiplyScalar = exports.multiplyScalar = /* #__PURE__ */(0, _factoriesAny.createMultiplyScalar)({
+  typed
+});
+const not = exports.not = /* #__PURE__ */(0, _factoriesAny.createNot)({
+  typed
+});
+const number = exports.number = /* #__PURE__ */(0, _factoriesAny.createNumber)({
+  typed
+});
+const oct = exports.oct = /* #__PURE__ */(0, _factoriesAny.createOct)({
+  format,
+  typed
+});
+const pickRandom = exports.pickRandom = /* #__PURE__ */(0, _factoriesAny.createPickRandom)({
+  config: _configReadonly.config,
+  typed
+});
+const print = exports.print = /* #__PURE__ */(0, _factoriesAny.createPrint)({
+  typed
+});
+const random = exports.random = /* #__PURE__ */(0, _factoriesAny.createRandom)({
+  config: _configReadonly.config,
+  typed
+});
+const re = exports.re = /* #__PURE__ */(0, _factoriesAny.createRe)({
+  typed
+});
+const sec = exports.sec = /* #__PURE__ */(0, _factoriesAny.createSec)({
+  BigNumber,
+  typed
+});
+const sign = exports.sign = /* #__PURE__ */(0, _factoriesAny.createSign)({
+  BigNumber,
+  Fraction,
+  complex,
+  typed
+});
+const sin = exports.sin = /* #__PURE__ */(0, _factoriesAny.createSin)({
+  typed
+});
+const SparseMatrix = exports.SparseMatrix = /* #__PURE__ */(0, _factoriesAny.createSparseMatrixClass)({
+  Matrix,
+  equalScalar,
+  typed
+});
+const splitUnit = exports.splitUnit = /* #__PURE__ */(0, _factoriesAny.createSplitUnit)({
+  typed
+});
+const square = exports.square = /* #__PURE__ */(0, _factoriesAny.createSquare)({
+  typed
+});
+const string = exports.string = /* #__PURE__ */(0, _factoriesAny.createString)({
+  typed
+});
+const subtractScalar = exports.subtractScalar = /* #__PURE__ */(0, _factoriesAny.createSubtractScalar)({
+  typed
+});
+const tan = exports.tan = /* #__PURE__ */(0, _factoriesAny.createTan)({
+  typed
+});
+const toBest = exports.toBest = /* #__PURE__ */(0, _factoriesAny.createToBest)({
+  typed
+});
+const typeOf = exports.typeOf = /* #__PURE__ */(0, _factoriesAny.createTypeOf)({
+  typed
+});
+const acosh = exports.acosh = /* #__PURE__ */(0, _factoriesAny.createAcosh)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const acsch = exports.acsch = /* #__PURE__ */(0, _factoriesAny.createAcsch)({
+  BigNumber,
+  typed
+});
+const asec = exports.asec = /* #__PURE__ */(0, _factoriesAny.createAsec)({
+  BigNumber,
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const bignumber = exports.bignumber = /* #__PURE__ */(0, _factoriesAny.createBignumber)({
+  BigNumber,
+  typed
+});
+const combinationsWithRep = exports.combinationsWithRep = /* #__PURE__ */(0, _factoriesAny.createCombinationsWithRep)({
+  typed
+});
+const cosh = exports.cosh = /* #__PURE__ */(0, _factoriesAny.createCosh)({
+  typed
+});
+const csch = exports.csch = /* #__PURE__ */(0, _factoriesAny.createCsch)({
+  BigNumber,
+  typed
+});
+const isNaN = exports.isNaN = /* #__PURE__ */(0, _factoriesAny.createIsNaN)({
+  typed
+});
+const isPrime = exports.isPrime = /* #__PURE__ */(0, _factoriesAny.createIsPrime)({
+  typed
+});
+const mapSlices = exports.mapSlices = /* #__PURE__ */(0, _factoriesAny.createMapSlices)({
+  isInteger,
+  typed
+});
+const apply = exports.apply = mapSlices;
+const matrix = exports.matrix = /* #__PURE__ */(0, _factoriesAny.createMatrix)({
+  DenseMatrix,
+  Matrix,
+  SparseMatrix,
+  typed
+});
+const matrixFromFunction = exports.matrixFromFunction = /* #__PURE__ */(0, _factoriesAny.createMatrixFromFunction)({
+  isZero,
+  matrix,
+  typed
+});
+const ones = exports.ones = /* #__PURE__ */(0, _factoriesAny.createOnes)({
+  BigNumber,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const randomInt = exports.randomInt = /* #__PURE__ */(0, _factoriesAny.createRandomInt)({
+  config: _configReadonly.config,
+  log2,
+  typed
+});
+const reshape = exports.reshape = /* #__PURE__ */(0, _factoriesAny.createReshape)({
+  isInteger,
+  matrix,
+  typed
+});
+const sech = exports.sech = /* #__PURE__ */(0, _factoriesAny.createSech)({
+  BigNumber,
+  typed
+});
+const sinh = exports.sinh = /* #__PURE__ */(0, _factoriesAny.createSinh)({
+  typed
+});
+const sparse = exports.sparse = /* #__PURE__ */(0, _factoriesAny.createSparse)({
+  SparseMatrix,
+  typed
+});
+const sqrt = exports.sqrt = /* #__PURE__ */(0, _factoriesAny.createSqrt)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const squeeze = exports.squeeze = /* #__PURE__ */(0, _factoriesAny.createSqueeze)({
+  typed
+});
+const tanh = exports.tanh = /* #__PURE__ */(0, _factoriesAny.createTanh)({
+  typed
+});
+const transpose = exports.transpose = /* #__PURE__ */(0, _factoriesAny.createTranspose)({
+  matrix,
+  typed
+});
+const xgcd = exports.xgcd = /* #__PURE__ */(0, _factoriesAny.createXgcd)({
+  BigNumber,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const zeros = exports.zeros = /* #__PURE__ */(0, _factoriesAny.createZeros)({
+  BigNumber,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const acoth = exports.acoth = /* #__PURE__ */(0, _factoriesAny.createAcoth)({
+  BigNumber,
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const asin = exports.asin = /* #__PURE__ */(0, _factoriesAny.createAsin)({
+  Complex,
+  config: _configReadonly.config,
+  typed
+});
+const bin = exports.bin = /* #__PURE__ */(0, _factoriesAny.createBin)({
+  format,
+  typed
+});
+const concat = exports.concat = /* #__PURE__ */(0, _factoriesAny.createConcat)({
+  isInteger,
+  matrix,
+  typed
+});
+const coth = exports.coth = /* #__PURE__ */(0, _factoriesAny.createCoth)({
+  BigNumber,
+  typed
+});
+const ctranspose = exports.ctranspose = /* #__PURE__ */(0, _factoriesAny.createCtranspose)({
+  conj,
+  transpose,
+  typed
+});
+const diag = exports.diag = /* #__PURE__ */(0, _factoriesAny.createDiag)({
+  DenseMatrix,
+  SparseMatrix,
+  matrix,
+  typed
+});
+const dotMultiply = exports.dotMultiply = /* #__PURE__ */(0, _factoriesAny.createDotMultiply)({
+  concat,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+const equal = exports.equal = /* #__PURE__ */(0, _factoriesAny.createEqual)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const fraction = exports.fraction = /* #__PURE__ */(0, _factoriesAny.createFraction)({
+  Fraction,
+  typed
+});
+const identity = exports.identity = /* #__PURE__ */(0, _factoriesAny.createIdentity)({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const isNumeric = exports.isNumeric = /* #__PURE__ */(0, _factoriesAny.createIsNumeric)({
+  typed
+});
+const kron = exports.kron = /* #__PURE__ */(0, _factoriesAny.createKron)({
+  matrix,
+  multiplyScalar,
+  typed
+});
+const largerEq = exports.largerEq = /* #__PURE__ */(0, _factoriesAny.createLargerEq)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const leftShift = exports.leftShift = /* #__PURE__ */(0, _factoriesAny.createLeftShift)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+const mode = exports.mode = /* #__PURE__ */(0, _factoriesAny.createMode)({
+  isNaN,
+  isNumeric,
+  typed
+});
+const nthRoot = exports.nthRoot = /* #__PURE__ */(0, _factoriesAny.createNthRoot)({
+  BigNumber,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const numeric = exports.numeric = /* #__PURE__ */(0, _factoriesAny.createNumeric)({
+  bignumber,
+  fraction,
+  number
+});
+const prod = exports.prod = /* #__PURE__ */(0, _factoriesAny.createProd)({
+  config: _configReadonly.config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+const resize = exports.resize = /* #__PURE__ */(0, _factoriesAny.createResize)({
+  config: _configReadonly.config,
+  matrix
+});
+const rightArithShift = exports.rightArithShift = /* #__PURE__ */(0, _factoriesAny.createRightArithShift)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+const round = exports.round = /* #__PURE__ */(0, _factoriesAny.createRound)({
+  BigNumber,
+  DenseMatrix,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+const size = exports.size = /* #__PURE__ */(0, _factoriesAny.createSize)({
+  matrix,
+  config: _configReadonly.config,
+  typed
+});
+const smaller = exports.smaller = /* #__PURE__ */(0, _factoriesAny.createSmaller)({
+  DenseMatrix,
+  SparseMatrix,
+  bignumber,
+  concat,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const to = exports.to = /* #__PURE__ */(0, _factoriesAny.createTo)({
+  concat,
+  matrix,
+  typed
+});
+const unaryMinus = exports.unaryMinus = /* #__PURE__ */(0, _factoriesAny.createUnaryMinus)({
+  typed
+});
+const unequal = exports.unequal = /* #__PURE__ */(0, _factoriesAny.createUnequal)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  typed
+});
+const xor = exports.xor = /* #__PURE__ */(0, _factoriesAny.createXor)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  matrix,
+  typed
+});
+const add = exports.add = /* #__PURE__ */(0, _factoriesAny.createAdd)({
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const atan2 = exports.atan2 = /* #__PURE__ */(0, _factoriesAny.createAtan2)({
+  BigNumber,
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const bitAnd = exports.bitAnd = /* #__PURE__ */(0, _factoriesAny.createBitAnd)({
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const bitOr = exports.bitOr = /* #__PURE__ */(0, _factoriesAny.createBitOr)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const bitXor = exports.bitXor = /* #__PURE__ */(0, _factoriesAny.createBitXor)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  matrix,
+  typed
+});
+const cbrt = exports.cbrt = /* #__PURE__ */(0, _factoriesAny.createCbrt)({
+  BigNumber,
+  Complex,
+  Fraction,
+  config: _configReadonly.config,
+  isNegative,
+  matrix,
+  typed,
+  unaryMinus
+});
+const compare = exports.compare = /* #__PURE__ */(0, _factoriesAny.createCompare)({
+  BigNumber,
+  DenseMatrix,
+  Fraction,
+  concat,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  typed
+});
+const compareText = exports.compareText = /* #__PURE__ */(0, _factoriesAny.createCompareText)({
+  concat,
+  matrix,
+  typed
+});
+const count = exports.count = /* #__PURE__ */(0, _factoriesAny.createCount)({
+  prod,
+  size,
+  typed
+});
+const deepEqual = exports.deepEqual = /* #__PURE__ */(0, _factoriesAny.createDeepEqual)({
+  equal,
+  typed
+});
+const divideScalar = exports.divideScalar = /* #__PURE__ */(0, _factoriesAny.createDivideScalar)({
+  numeric,
+  typed
+});
+const dotDivide = exports.dotDivide = /* #__PURE__ */(0, _factoriesAny.createDotDivide)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  divideScalar,
+  equalScalar,
+  matrix,
+  typed
+});
+const equalText = exports.equalText = /* #__PURE__ */(0, _factoriesAny.createEqualText)({
+  compareText,
+  isZero,
+  typed
+});
+const floor = exports.floor = /* #__PURE__ */(0, _factoriesAny.createFloor)({
+  DenseMatrix,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+const gcd = exports.gcd = /* #__PURE__ */(0, _factoriesAny.createGcd)({
+  BigNumber,
+  DenseMatrix,
+  concat,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+const hasNumericValue = exports.hasNumericValue = /* #__PURE__ */(0, _factoriesAny.createHasNumericValue)({
+  isNumeric,
+  typed
+});
+const hypot = exports.hypot = /* #__PURE__ */(0, _factoriesAny.createHypot)({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+const ImmutableDenseMatrix = exports.ImmutableDenseMatrix = /* #__PURE__ */(0, _factoriesAny.createImmutableDenseMatrixClass)({
+  DenseMatrix,
+  smaller
+});
+const Index = exports.Index = /* #__PURE__ */(0, _factoriesAny.createIndexClass)({
+  ImmutableDenseMatrix,
+  getMatrixDataType
+});
+const larger = exports.larger = /* #__PURE__ */(0, _factoriesAny.createLarger)({
+  DenseMatrix,
+  SparseMatrix,
+  bignumber,
+  concat,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const log = exports.log = /* #__PURE__ */(0, _factoriesAny.createLog)({
+  Complex,
+  config: _configReadonly.config,
+  divideScalar,
+  typeOf,
+  typed
+});
+const lsolve = exports.lsolve = /* #__PURE__ */(0, _factoriesAny.createLsolve)({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+const matrixFromColumns = exports.matrixFromColumns = /* #__PURE__ */(0, _factoriesAny.createMatrixFromColumns)({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+const max = exports.max = /* #__PURE__ */(0, _factoriesAny.createMax)({
+  config: _configReadonly.config,
+  isNaN,
+  larger,
+  numeric,
+  typed
+});
+const min = exports.min = /* #__PURE__ */(0, _factoriesAny.createMin)({
+  config: _configReadonly.config,
+  isNaN,
+  numeric,
+  smaller,
+  typed
+});
+const mod = exports.mod = /* #__PURE__ */(0, _factoriesAny.createMod)({
+  DenseMatrix,
+  concat,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+const nthRoots = exports.nthRoots = /* #__PURE__ */(0, _factoriesAny.createNthRoots)({
+  Complex,
+  config: _configReadonly.config,
+  divideScalar,
+  typed
+});
+const nullish = exports.nullish = /* #__PURE__ */(0, _factoriesAny.createNullish)({
+  deepEqual,
+  flatten,
+  matrix,
+  size,
+  typed
+});
+const or = exports.or = /* #__PURE__ */(0, _factoriesAny.createOr)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const partitionSelect = exports.partitionSelect = /* #__PURE__ */(0, _factoriesAny.createPartitionSelect)({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+const qr = exports.qr = /* #__PURE__ */(0, _factoriesAny.createQr)({
+  addScalar,
+  complex,
+  conj,
+  divideScalar,
+  equal,
+  identity,
+  isZero,
+  matrix,
+  multiplyScalar,
+  sign,
+  sqrt,
+  subtractScalar,
+  typed,
+  unaryMinus,
+  zeros
+});
+const rightLogShift = exports.rightLogShift = /* #__PURE__ */(0, _factoriesAny.createRightLogShift)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+const smallerEq = exports.smallerEq = /* #__PURE__ */(0, _factoriesAny.createSmallerEq)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config: _configReadonly.config,
+  matrix,
+  typed
+});
+const subset = exports.subset = /* #__PURE__ */(0, _factoriesAny.createSubset)({
+  add,
+  matrix,
+  typed,
+  zeros
+});
+const subtract = exports.subtract = /* #__PURE__ */(0, _factoriesAny.createSubtract)({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+const trace = exports.trace = /* #__PURE__ */(0, _factoriesAny.createTrace)({
+  add,
+  matrix,
+  typed
+});
+const usolve = exports.usolve = /* #__PURE__ */(0, _factoriesAny.createUsolve)({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+const catalan = exports.catalan = /* #__PURE__ */(0, _factoriesAny.createCatalan)({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+const compareNatural = exports.compareNatural = /* #__PURE__ */(0, _factoriesAny.createCompareNatural)({
+  compare,
+  typed
+});
+const composition = exports.composition = /* #__PURE__ */(0, _factoriesAny.createComposition)({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+const diff = exports.diff = /* #__PURE__ */(0, _factoriesAny.createDiff)({
+  matrix,
+  number,
+  subtract,
+  typed
+});
+const distance = exports.distance = /* #__PURE__ */(0, _factoriesAny.createDistance)({
+  abs,
+  addScalar,
+  deepEqual,
+  divideScalar,
+  multiplyScalar,
+  sqrt,
+  subtractScalar,
+  typed
+});
+const dot = exports.dot = /* #__PURE__ */(0, _factoriesAny.createDot)({
+  addScalar,
+  conj,
+  multiplyScalar,
+  size,
+  typed
+});
+const FibonacciHeap = exports.FibonacciHeap = /* #__PURE__ */(0, _factoriesAny.createFibonacciHeapClass)({
+  larger,
+  smaller
+});
+const index = exports.index = /* #__PURE__ */(0, _factoriesAny.createIndex)({
+  Index,
+  typed
+});
+const invmod = exports.invmod = /* #__PURE__ */(0, _factoriesAny.createInvmod)({
+  BigNumber,
+  add,
+  config: _configReadonly.config,
+  equal,
+  isInteger,
+  mod,
+  smaller,
+  typed,
+  xgcd
+});
+const lcm = exports.lcm = /* #__PURE__ */(0, _factoriesAny.createLcm)({
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+const log1p = exports.log1p = /* #__PURE__ */(0, _factoriesAny.createLog1p)({
+  Complex,
+  config: _configReadonly.config,
+  divideScalar,
+  log,
+  typed
+});
+const lsolveAll = exports.lsolveAll = /* #__PURE__ */(0, _factoriesAny.createLsolveAll)({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+const matrixFromRows = exports.matrixFromRows = /* #__PURE__ */(0, _factoriesAny.createMatrixFromRows)({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+const multiply = exports.multiply = /* #__PURE__ */(0, _factoriesAny.createMultiply)({
+  addScalar,
+  dot,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+const range = exports.range = /* #__PURE__ */(0, _factoriesAny.createRange)({
+  bignumber,
+  matrix,
+  add,
+  config: _configReadonly.config,
+  equal,
+  isPositive,
+  isZero,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+const row = exports.row = /* #__PURE__ */(0, _factoriesAny.createRow)({
+  Index,
+  matrix,
+  range,
+  typed
+});
+const setCartesian = exports.setCartesian = /* #__PURE__ */(0, _factoriesAny.createSetCartesian)({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const setDistinct = exports.setDistinct = /* #__PURE__ */(0, _factoriesAny.createSetDistinct)({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const setIsSubset = exports.setIsSubset = /* #__PURE__ */(0, _factoriesAny.createSetIsSubset)({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const setPowerset = exports.setPowerset = /* #__PURE__ */(0, _factoriesAny.createSetPowerset)({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const slu = exports.slu = /* #__PURE__ */(0, _factoriesAny.createSlu)({
+  SparseMatrix,
+  abs,
+  add,
+  divideScalar,
+  larger,
+  largerEq,
+  multiply,
+  subtract,
+  transpose,
+  typed
+});
+const sort = exports.sort = /* #__PURE__ */(0, _factoriesAny.createSort)({
+  compare,
+  compareNatural,
+  matrix,
+  typed
+});
+const unaryPlus = exports.unaryPlus = /* #__PURE__ */(0, _factoriesAny.createUnaryPlus)({
+  config: _configReadonly.config,
+  numeric,
+  typed
+});
+const usolveAll = exports.usolveAll = /* #__PURE__ */(0, _factoriesAny.createUsolveAll)({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+const zpk2tf = exports.zpk2tf = /* #__PURE__ */(0, _factoriesAny.createZpk2tf)({
+  Complex,
+  add,
+  multiply,
+  number,
+  typed
+});
+const and = exports.and = /* #__PURE__ */(0, _factoriesAny.createAnd)({
+  concat,
+  equalScalar,
+  matrix,
+  not,
+  typed,
+  zeros
+});
+const ceil = exports.ceil = /* #__PURE__ */(0, _factoriesAny.createCeil)({
+  DenseMatrix,
+  config: _configReadonly.config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+const column = exports.column = /* #__PURE__ */(0, _factoriesAny.createColumn)({
+  Index,
+  matrix,
+  range,
+  typed
+});
+const cross = exports.cross = /* #__PURE__ */(0, _factoriesAny.createCross)({
+  matrix,
+  multiply,
+  subtract,
+  typed
+});
+const det = exports.det = /* #__PURE__ */(0, _factoriesAny.createDet)({
+  divideScalar,
+  isZero,
+  matrix,
+  multiply,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+const fix = exports.fix = /* #__PURE__ */(0, _factoriesAny.createFix)({
+  Complex,
+  DenseMatrix,
+  ceil,
+  equalScalar,
+  floor,
+  matrix,
+  typed,
+  zeros
+});
+const inv = exports.inv = /* #__PURE__ */(0, _factoriesAny.createInv)({
+  abs,
+  addScalar,
+  det,
+  divideScalar,
+  identity,
+  matrix,
+  multiply,
+  typed,
+  unaryMinus
+});
+const pinv = exports.pinv = /* #__PURE__ */(0, _factoriesAny.createPinv)({
+  Complex,
+  add,
+  ctranspose,
+  deepEqual,
+  divideScalar,
+  dot,
+  dotDivide,
+  equal,
+  inv,
+  matrix,
+  multiply,
+  typed
+});
+const pow = exports.pow = /* #__PURE__ */(0, _factoriesAny.createPow)({
+  Complex,
+  config: _configReadonly.config,
+  fraction,
+  identity,
+  inv,
+  matrix,
+  multiply,
+  number,
+  typed
+});
+const setDifference = exports.setDifference = /* #__PURE__ */(0, _factoriesAny.createSetDifference)({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const setMultiplicity = exports.setMultiplicity = /* #__PURE__ */(0, _factoriesAny.createSetMultiplicity)({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const setSymDifference = exports.setSymDifference = /* #__PURE__ */(0, _factoriesAny.createSetSymDifference)({
+  Index,
+  concat,
+  setDifference,
+  size,
+  subset,
+  typed
+});
+const Spa = exports.Spa = /* #__PURE__ */(0, _factoriesAny.createSpaClass)({
+  FibonacciHeap,
+  addScalar,
+  equalScalar
+});
+const sqrtm = exports.sqrtm = /* #__PURE__ */(0, _factoriesAny.createSqrtm)({
+  abs,
+  add,
+  identity,
+  inv,
+  map,
+  max,
+  multiply,
+  size,
+  sqrt,
+  subtract,
+  typed
+});
+const sum = exports.sum = /* #__PURE__ */(0, _factoriesAny.createSum)({
+  add,
+  config: _configReadonly.config,
+  numeric,
+  typed
+});
+const Unit = exports.Unit = /* #__PURE__ */(0, _factoriesAny.createUnitClass)({
+  BigNumber,
+  Complex,
+  Fraction,
+  abs,
+  addScalar,
+  config: _configReadonly.config,
+  divideScalar,
+  equal,
+  fix,
+  format,
+  isNumeric,
+  multiplyScalar,
+  number,
+  pow,
+  round,
+  subtractScalar,
+  toBest
+});
+const vacuumImpedance = exports.vacuumImpedance = /* #__PURE__ */(0, _factoriesAny.createVacuumImpedance)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const wienDisplacement = exports.wienDisplacement = /* #__PURE__ */(0, _factoriesAny.createWienDisplacement)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const atomicMass = exports.atomicMass = /* #__PURE__ */(0, _factoriesAny.createAtomicMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const bohrMagneton = exports.bohrMagneton = /* #__PURE__ */(0, _factoriesAny.createBohrMagneton)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const boltzmann = exports.boltzmann = /* #__PURE__ */(0, _factoriesAny.createBoltzmann)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const conductanceQuantum = exports.conductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createConductanceQuantum)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const coulomb = exports.coulomb = /* #__PURE__ */(0, _factoriesAny.createCoulomb)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const createUnit = exports.createUnit = /* #__PURE__ */(0, _factoriesAny.createCreateUnit)({
+  Unit,
+  typed
+});
+const deuteronMass = exports.deuteronMass = /* #__PURE__ */(0, _factoriesAny.createDeuteronMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const dotPow = exports.dotPow = /* #__PURE__ */(0, _factoriesAny.createDotPow)({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  pow,
+  typed
+});
+const electricConstant = exports.electricConstant = /* #__PURE__ */(0, _factoriesAny.createElectricConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const elementaryCharge = exports.elementaryCharge = /* #__PURE__ */(0, _factoriesAny.createElementaryCharge)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const expm = exports.expm = /* #__PURE__ */(0, _factoriesAny.createExpm)({
+  abs,
+  add,
+  identity,
+  inv,
+  multiply,
+  typed
+});
+const faraday = exports.faraday = /* #__PURE__ */(0, _factoriesAny.createFaraday)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const fft = exports.fft = /* #__PURE__ */(0, _factoriesAny.createFft)({
+  addScalar,
+  ceil,
+  conj,
+  divideScalar,
+  dotDivide,
+  exp,
+  i,
+  log2,
+  matrix,
+  multiplyScalar,
+  pow,
+  tau,
+  typed
+});
+const gamma = exports.gamma = /* #__PURE__ */(0, _factoriesAny.createGamma)({
+  BigNumber,
+  Complex,
+  config: _configReadonly.config,
+  multiplyScalar,
+  pow,
+  typed
+});
+const gravitationConstant = exports.gravitationConstant = /* #__PURE__ */(0, _factoriesAny.createGravitationConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const hartreeEnergy = exports.hartreeEnergy = /* #__PURE__ */(0, _factoriesAny.createHartreeEnergy)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const ifft = exports.ifft = /* #__PURE__ */(0, _factoriesAny.createIfft)({
+  conj,
+  dotDivide,
+  fft,
+  typed
+});
+const inverseConductanceQuantum = exports.inverseConductanceQuantum = /* #__PURE__ */(0, _factoriesAny.createInverseConductanceQuantum)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const klitzing = exports.klitzing = /* #__PURE__ */(0, _factoriesAny.createKlitzing)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const loschmidt = exports.loschmidt = /* #__PURE__ */(0, _factoriesAny.createLoschmidt)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const magneticConstant = exports.magneticConstant = /* #__PURE__ */(0, _factoriesAny.createMagneticConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const molarMass = exports.molarMass = /* #__PURE__ */(0, _factoriesAny.createMolarMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const molarPlanckConstant = exports.molarPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createMolarPlanckConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const neutronMass = exports.neutronMass = /* #__PURE__ */(0, _factoriesAny.createNeutronMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const nuclearMagneton = exports.nuclearMagneton = /* #__PURE__ */(0, _factoriesAny.createNuclearMagneton)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const planckCharge = exports.planckCharge = /* #__PURE__ */(0, _factoriesAny.createPlanckCharge)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const planckLength = exports.planckLength = /* #__PURE__ */(0, _factoriesAny.createPlanckLength)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const planckTemperature = exports.planckTemperature = /* #__PURE__ */(0, _factoriesAny.createPlanckTemperature)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const protonMass = exports.protonMass = /* #__PURE__ */(0, _factoriesAny.createProtonMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const quantumOfCirculation = exports.quantumOfCirculation = /* #__PURE__ */(0, _factoriesAny.createQuantumOfCirculation)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const reducedPlanckConstant = exports.reducedPlanckConstant = /* #__PURE__ */(0, _factoriesAny.createReducedPlanckConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const rydberg = exports.rydberg = /* #__PURE__ */(0, _factoriesAny.createRydberg)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const secondRadiation = exports.secondRadiation = /* #__PURE__ */(0, _factoriesAny.createSecondRadiation)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const setSize = exports.setSize = /* #__PURE__ */(0, _factoriesAny.createSetSize)({
+  compareNatural,
+  typed
+});
+const speedOfLight = exports.speedOfLight = /* #__PURE__ */(0, _factoriesAny.createSpeedOfLight)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const stefanBoltzmann = exports.stefanBoltzmann = /* #__PURE__ */(0, _factoriesAny.createStefanBoltzmann)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const thomsonCrossSection = exports.thomsonCrossSection = /* #__PURE__ */(0, _factoriesAny.createThomsonCrossSection)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const avogadro = exports.avogadro = /* #__PURE__ */(0, _factoriesAny.createAvogadro)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const bohrRadius = exports.bohrRadius = /* #__PURE__ */(0, _factoriesAny.createBohrRadius)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const coulombConstant = exports.coulombConstant = /* #__PURE__ */(0, _factoriesAny.createCoulombConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const divide = exports.divide = /* #__PURE__ */(0, _factoriesAny.createDivide)({
+  divideScalar,
+  equalScalar,
+  inv,
+  matrix,
+  multiply,
+  typed
+});
+const electronMass = exports.electronMass = /* #__PURE__ */(0, _factoriesAny.createElectronMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const factorial = exports.factorial = /* #__PURE__ */(0, _factoriesAny.createFactorial)({
+  gamma,
+  typed
+});
+const firstRadiation = exports.firstRadiation = /* #__PURE__ */(0, _factoriesAny.createFirstRadiation)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const gravity = exports.gravity = /* #__PURE__ */(0, _factoriesAny.createGravity)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const intersect = exports.intersect = /* #__PURE__ */(0, _factoriesAny.createIntersect)({
+  abs,
+  add,
+  addScalar,
+  config: _configReadonly.config,
+  divideScalar,
+  equalScalar,
+  flatten,
+  isNumeric,
+  isZero,
+  matrix,
+  multiply,
+  multiplyScalar,
+  smaller,
+  subtract,
+  typed
+});
+const lup = exports.lup = /* #__PURE__ */(0, _factoriesAny.createLup)({
+  DenseMatrix,
+  Spa,
+  SparseMatrix,
+  abs,
+  addScalar,
+  divideScalar,
+  equalScalar,
+  larger,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+const magneticFluxQuantum = exports.magneticFluxQuantum = /* #__PURE__ */(0, _factoriesAny.createMagneticFluxQuantum)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const molarMassC12 = exports.molarMassC12 = /* #__PURE__ */(0, _factoriesAny.createMolarMassC12)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const multinomial = exports.multinomial = /* #__PURE__ */(0, _factoriesAny.createMultinomial)({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+const permutations = exports.permutations = /* #__PURE__ */(0, _factoriesAny.createPermutations)({
+  factorial,
+  typed
+});
+const planckMass = exports.planckMass = /* #__PURE__ */(0, _factoriesAny.createPlanckMass)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const polynomialRoot = exports.polynomialRoot = /* #__PURE__ */(0, _factoriesAny.createPolynomialRoot)({
+  add,
+  cbrt,
+  divide,
+  equalScalar,
+  im,
+  isZero,
+  multiply,
+  re,
+  sqrt,
+  subtract,
+  typeOf,
+  typed,
+  unaryMinus
+});
+const setIntersect = exports.setIntersect = /* #__PURE__ */(0, _factoriesAny.createSetIntersect)({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+const solveODE = exports.solveODE = /* #__PURE__ */(0, _factoriesAny.createSolveODE)({
+  abs,
+  add,
+  bignumber,
+  divide,
+  isNegative,
+  isPositive,
+  larger,
+  map,
+  matrix,
+  max,
+  multiply,
+  smaller,
+  subtract,
+  typed,
+  unaryMinus
+});
+const stirlingS2 = exports.stirlingS2 = /* #__PURE__ */(0, _factoriesAny.createStirlingS2)({
+  bignumber,
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtractScalar,
+  typed
+});
+const unit = exports.unit = /* #__PURE__ */(0, _factoriesAny.createUnitFunction)({
+  Unit,
+  typed
+});
+const bellNumbers = exports.bellNumbers = /* #__PURE__ */(0, _factoriesAny.createBellNumbers)({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+const cumsum = exports.cumsum = /* #__PURE__ */(0, _factoriesAny.createCumSum)({
+  add,
+  typed,
+  unaryPlus
+});
+const eigs = exports.eigs = /* #__PURE__ */(0, _factoriesAny.createEigs)({
+  abs,
+  add,
+  addScalar,
+  atan,
+  bignumber,
+  column,
+  complex,
+  config: _configReadonly.config,
+  cos,
+  diag,
+  divideScalar,
+  dot,
+  equal,
+  flatten,
+  im,
+  inv,
+  larger,
+  matrix,
+  matrixFromColumns,
+  multiply,
+  multiplyScalar,
+  number,
+  qr,
+  re,
+  reshape,
+  sin,
+  size,
+  smaller,
+  sqrt,
+  subtract,
+  typed,
+  usolve,
+  usolveAll
+});
+const fermiCoupling = exports.fermiCoupling = /* #__PURE__ */(0, _factoriesAny.createFermiCoupling)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const gasConstant = exports.gasConstant = /* #__PURE__ */(0, _factoriesAny.createGasConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const kldivergence = exports.kldivergence = /* #__PURE__ */(0, _factoriesAny.createKldivergence)({
+  divide,
+  dotDivide,
+  isNumeric,
+  log,
+  map,
+  matrix,
+  multiply,
+  sum,
+  typed
+});
+const lusolve = exports.lusolve = /* #__PURE__ */(0, _factoriesAny.createLusolve)({
+  DenseMatrix,
+  lsolve,
+  lup,
+  matrix,
+  slu,
+  typed,
+  usolve
+});
+const mean = exports.mean = /* #__PURE__ */(0, _factoriesAny.createMean)({
+  add,
+  divide,
+  typed
+});
+const molarVolume = exports.molarVolume = /* #__PURE__ */(0, _factoriesAny.createMolarVolume)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const planckConstant = exports.planckConstant = /* #__PURE__ */(0, _factoriesAny.createPlanckConstant)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const quantileSeq = exports.quantileSeq = /* #__PURE__ */(0, _factoriesAny.createQuantileSeq)({
+  bignumber,
+  add,
+  compare,
+  divide,
+  isInteger,
+  larger,
+  mapSlices,
+  multiply,
+  partitionSelect,
+  smaller,
+  smallerEq,
+  subtract,
+  typed
+});
+const setUnion = exports.setUnion = /* #__PURE__ */(0, _factoriesAny.createSetUnion)({
+  Index,
+  concat,
+  setIntersect,
+  setSymDifference,
+  size,
+  subset,
+  typed
+});
+const variance = exports.variance = /* #__PURE__ */(0, _factoriesAny.createVariance)({
+  add,
+  divide,
+  isNaN,
+  mapSlices,
+  multiply,
+  subtract,
+  typed
+});
+const classicalElectronRadius = exports.classicalElectronRadius = /* #__PURE__ */(0, _factoriesAny.createClassicalElectronRadius)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const median = exports.median = /* #__PURE__ */(0, _factoriesAny.createMedian)({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+const corr = exports.corr = /* #__PURE__ */(0, _factoriesAny.createCorr)({
+  add,
+  divide,
+  matrix,
+  mean,
+  multiply,
+  pow,
+  sqrt,
+  subtract,
+  sum,
+  typed
+});
+const freqz = exports.freqz = /* #__PURE__ */(0, _factoriesAny.createFreqz)({
+  Complex,
+  add,
+  divide,
+  matrix,
+  multiply,
+  typed
+});
+const mad = exports.mad = /* #__PURE__ */(0, _factoriesAny.createMad)({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+const std = exports.std = /* #__PURE__ */(0, _factoriesAny.createStd)({
+  map,
+  sqrt,
+  typed,
+  variance
+});
+const zeta = exports.zeta = /* #__PURE__ */(0, _factoriesAny.createZeta)({
+  BigNumber,
+  Complex,
+  add,
+  config: _configReadonly.config,
+  divide,
+  equal,
+  factorial,
+  gamma,
+  isNegative,
+  multiply,
+  pi,
+  pow,
+  sin,
+  smallerEq,
+  subtract,
+  typed
+});
+const norm = exports.norm = /* #__PURE__ */(0, _factoriesAny.createNorm)({
+  abs,
+  add,
+  conj,
+  ctranspose,
+  eigs,
+  equalScalar,
+  larger,
+  matrix,
+  multiply,
+  pow,
+  smaller,
+  sqrt,
+  typed
+});
+const rotationMatrix = exports.rotationMatrix = /* #__PURE__ */(0, _factoriesAny.createRotationMatrix)({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  config: _configReadonly.config,
+  cos,
+  matrix,
+  multiplyScalar,
+  norm,
+  sin,
+  typed,
+  unaryMinus
+});
+const planckTime = exports.planckTime = /* #__PURE__ */(0, _factoriesAny.createPlanckTime)({
+  BigNumber,
+  Unit,
+  config: _configReadonly.config
+});
+const schur = exports.schur = /* #__PURE__ */(0, _factoriesAny.createSchur)({
+  identity,
+  matrix,
+  multiply,
+  norm,
+  qr,
+  subtract,
+  typed
+});
+const rotate = exports.rotate = /* #__PURE__ */(0, _factoriesAny.createRotate)({
+  multiply,
+  rotationMatrix,
+  typed
+});
+const sylvester = exports.sylvester = /* #__PURE__ */(0, _factoriesAny.createSylvester)({
+  abs,
+  add,
+  concat,
+  identity,
+  index,
+  lusolve,
+  matrix,
+  matrixFromColumns,
+  multiply,
+  range,
+  schur,
+  subset,
+  subtract,
+  transpose,
+  typed
+});
+const lyap = exports.lyap = /* #__PURE__ */(0, _factoriesAny.createLyap)({
+  matrix,
+  multiply,
+  sylvester,
+  transpose,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js b/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js
new file mode 100644
index 0000000..05108da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/pureFunctionsNumber.generated.js
@@ -0,0 +1,618 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mean = exports.max = exports.matrix = exports.mapSlices = exports.map = exports.mad = exports.log2 = exports.log1p = exports.log10 = exports.log = exports.lgamma = exports.leftShift = exports.lcm = exports.largerEq = exports.larger = exports.isZero = exports.isPrime = exports.isPositive = exports.isNumeric = exports.isNegative = exports.isNaN = exports.isInteger = exports.index = exports.hypot = exports.hasNumericValue = exports.gcd = exports.gamma = exports.format = exports.forEach = exports.floor = exports.fix = exports.filter = exports.factorial = exports.expm1 = exports.exp = exports.erf = exports.equalText = exports.equalScalar = exports.equal = exports.e = exports.divideScalar = exports.divide = exports.deepEqual = exports.cumsum = exports.cube = exports.csch = exports.csc = exports.coth = exports.cot = exports.cosh = exports.cos = exports.corr = exports.composition = exports.compareText = exports.compareNatural = exports.compare = exports.combinationsWithRep = exports.combinations = exports.clone = exports.ceil = exports.cbrt = exports.catalan = exports.boolean = exports.bitXor = exports.bitOr = exports.bitNot = exports.bitAnd = exports.bigint = exports.bellNumbers = exports.atanh = exports.atan2 = exports.atan = exports.asinh = exports.asin = exports.asech = exports.asec = exports.apply = exports.and = exports.addScalar = exports.add = exports.acsch = exports.acsc = exports.acoth = exports.acot = exports.acosh = exports.acos = exports.abs = exports._true = exports._null = exports._false = exports._NaN = exports._Infinity = exports.SQRT2 = exports.SQRT1_2 = exports.ResultSet = exports.Range = exports.LOG2E = exports.LOG10E = exports.LN2 = exports.LN10 = void 0;
+exports.zeta = exports.xor = exports.xgcd = exports.version = exports.variance = exports.unequal = exports.unaryPlus = exports.unaryMinus = exports.typed = exports.typeOf = exports.tau = exports.tanh = exports.tan = exports.sum = exports.subtractScalar = exports.subtract = exports.subset = exports.string = exports.stirlingS2 = exports.std = exports.square = exports.sqrt = exports.smallerEq = exports.smaller = exports.size = exports.sinh = exports.sin = exports.sign = exports.sech = exports.sec = exports.round = exports.rightLogShift = exports.rightArithShift = exports.replacer = exports.range = exports.randomInt = exports.random = exports.quantileSeq = exports.prod = exports.print = exports.pow = exports.pickRandom = exports.pi = exports.phi = exports.permutations = exports.partitionSelect = exports.or = exports.numeric = exports.number = exports.nthRoot = exports.not = exports.norm = exports.multiplyScalar = exports.multiply = exports.multinomial = exports.mode = exports.mod = exports.min = exports.median = void 0;
+var _configReadonly = require("./configReadonly.js");
+var _factoriesNumber = require("../factoriesNumber.js");
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+
+const e = exports.e = /* #__PURE__ */(0, _factoriesNumber.createE)({
+  config: _configReadonly.config
+});
+const _false = exports._false = /* #__PURE__ */(0, _factoriesNumber.createFalse)({});
+const index = exports.index = /* #__PURE__ */(0, _factoriesNumber.createIndex)({});
+const _Infinity = exports._Infinity = /* #__PURE__ */(0, _factoriesNumber.createInfinity)({
+  config: _configReadonly.config
+});
+const LN10 = exports.LN10 = /* #__PURE__ */(0, _factoriesNumber.createLN10)({
+  config: _configReadonly.config
+});
+const LOG10E = exports.LOG10E = /* #__PURE__ */(0, _factoriesNumber.createLOG10E)({
+  config: _configReadonly.config
+});
+const matrix = exports.matrix = /* #__PURE__ */(0, _factoriesNumber.createMatrix)({});
+const _NaN = exports._NaN = /* #__PURE__ */(0, _factoriesNumber.createNaN)({
+  config: _configReadonly.config
+});
+const _null = exports._null = /* #__PURE__ */(0, _factoriesNumber.createNull)({});
+const phi = exports.phi = /* #__PURE__ */(0, _factoriesNumber.createPhi)({
+  config: _configReadonly.config
+});
+const Range = exports.Range = /* #__PURE__ */(0, _factoriesNumber.createRangeClass)({});
+const replacer = exports.replacer = /* #__PURE__ */(0, _factoriesNumber.createReplacer)({});
+const ResultSet = exports.ResultSet = /* #__PURE__ */(0, _factoriesNumber.createResultSet)({});
+const SQRT1_2 = exports.SQRT1_2 = /* #__PURE__ */(0, _factoriesNumber.createSQRT1_2)({
+  config: _configReadonly.config
+});
+const subset = exports.subset = /* #__PURE__ */(0, _factoriesNumber.createSubset)({});
+const tau = exports.tau = /* #__PURE__ */(0, _factoriesNumber.createTau)({
+  config: _configReadonly.config
+});
+const typed = exports.typed = /* #__PURE__ */(0, _factoriesNumber.createTyped)({});
+const unaryPlus = exports.unaryPlus = /* #__PURE__ */(0, _factoriesNumber.createUnaryPlus)({
+  typed
+});
+const version = exports.version = /* #__PURE__ */(0, _factoriesNumber.createVersion)({});
+const xor = exports.xor = /* #__PURE__ */(0, _factoriesNumber.createXor)({
+  typed
+});
+const abs = exports.abs = /* #__PURE__ */(0, _factoriesNumber.createAbs)({
+  typed
+});
+const acos = exports.acos = /* #__PURE__ */(0, _factoriesNumber.createAcos)({
+  typed
+});
+const acot = exports.acot = /* #__PURE__ */(0, _factoriesNumber.createAcot)({
+  typed
+});
+const acsc = exports.acsc = /* #__PURE__ */(0, _factoriesNumber.createAcsc)({
+  typed
+});
+const add = exports.add = /* #__PURE__ */(0, _factoriesNumber.createAdd)({
+  typed
+});
+const and = exports.and = /* #__PURE__ */(0, _factoriesNumber.createAnd)({
+  typed
+});
+const asec = exports.asec = /* #__PURE__ */(0, _factoriesNumber.createAsec)({
+  typed
+});
+const asin = exports.asin = /* #__PURE__ */(0, _factoriesNumber.createAsin)({
+  typed
+});
+const atan = exports.atan = /* #__PURE__ */(0, _factoriesNumber.createAtan)({
+  typed
+});
+const atanh = exports.atanh = /* #__PURE__ */(0, _factoriesNumber.createAtanh)({
+  typed
+});
+const bigint = exports.bigint = /* #__PURE__ */(0, _factoriesNumber.createBigint)({
+  typed
+});
+const bitNot = exports.bitNot = /* #__PURE__ */(0, _factoriesNumber.createBitNot)({
+  typed
+});
+const bitXor = exports.bitXor = /* #__PURE__ */(0, _factoriesNumber.createBitXor)({
+  typed
+});
+const boolean = exports.boolean = /* #__PURE__ */(0, _factoriesNumber.createBoolean)({
+  typed
+});
+const cbrt = exports.cbrt = /* #__PURE__ */(0, _factoriesNumber.createCbrt)({
+  typed
+});
+const combinations = exports.combinations = /* #__PURE__ */(0, _factoriesNumber.createCombinations)({
+  typed
+});
+const compare = exports.compare = /* #__PURE__ */(0, _factoriesNumber.createCompare)({
+  config: _configReadonly.config,
+  typed
+});
+const compareText = exports.compareText = /* #__PURE__ */(0, _factoriesNumber.createCompareText)({
+  typed
+});
+const cos = exports.cos = /* #__PURE__ */(0, _factoriesNumber.createCos)({
+  typed
+});
+const cot = exports.cot = /* #__PURE__ */(0, _factoriesNumber.createCot)({
+  typed
+});
+const csc = exports.csc = /* #__PURE__ */(0, _factoriesNumber.createCsc)({
+  typed
+});
+const cube = exports.cube = /* #__PURE__ */(0, _factoriesNumber.createCube)({
+  typed
+});
+const divide = exports.divide = /* #__PURE__ */(0, _factoriesNumber.createDivide)({
+  typed
+});
+const equalScalar = exports.equalScalar = /* #__PURE__ */(0, _factoriesNumber.createEqualScalar)({
+  config: _configReadonly.config,
+  typed
+});
+const erf = exports.erf = /* #__PURE__ */(0, _factoriesNumber.createErf)({
+  typed
+});
+const exp = exports.exp = /* #__PURE__ */(0, _factoriesNumber.createExp)({
+  typed
+});
+const filter = exports.filter = /* #__PURE__ */(0, _factoriesNumber.createFilter)({
+  typed
+});
+const forEach = exports.forEach = /* #__PURE__ */(0, _factoriesNumber.createForEach)({
+  typed
+});
+const format = exports.format = /* #__PURE__ */(0, _factoriesNumber.createFormat)({
+  typed
+});
+const gamma = exports.gamma = /* #__PURE__ */(0, _factoriesNumber.createGamma)({
+  typed
+});
+const isInteger = exports.isInteger = /* #__PURE__ */(0, _factoriesNumber.createIsInteger)({
+  typed
+});
+const isNegative = exports.isNegative = /* #__PURE__ */(0, _factoriesNumber.createIsNegative)({
+  typed
+});
+const isPositive = exports.isPositive = /* #__PURE__ */(0, _factoriesNumber.createIsPositive)({
+  typed
+});
+const isZero = exports.isZero = /* #__PURE__ */(0, _factoriesNumber.createIsZero)({
+  typed
+});
+const LOG2E = exports.LOG2E = /* #__PURE__ */(0, _factoriesNumber.createLOG2E)({
+  config: _configReadonly.config
+});
+const largerEq = exports.largerEq = /* #__PURE__ */(0, _factoriesNumber.createLargerEq)({
+  config: _configReadonly.config,
+  typed
+});
+const leftShift = exports.leftShift = /* #__PURE__ */(0, _factoriesNumber.createLeftShift)({
+  typed
+});
+const log = exports.log = /* #__PURE__ */(0, _factoriesNumber.createLog)({
+  typed
+});
+const log1p = exports.log1p = /* #__PURE__ */(0, _factoriesNumber.createLog1p)({
+  typed
+});
+const map = exports.map = /* #__PURE__ */(0, _factoriesNumber.createMap)({
+  typed
+});
+const mean = exports.mean = /* #__PURE__ */(0, _factoriesNumber.createMean)({
+  add,
+  divide,
+  typed
+});
+const mod = exports.mod = /* #__PURE__ */(0, _factoriesNumber.createMod)({
+  typed
+});
+const multiply = exports.multiply = /* #__PURE__ */(0, _factoriesNumber.createMultiply)({
+  typed
+});
+const not = exports.not = /* #__PURE__ */(0, _factoriesNumber.createNot)({
+  typed
+});
+const number = exports.number = /* #__PURE__ */(0, _factoriesNumber.createNumber)({
+  typed
+});
+const or = exports.or = /* #__PURE__ */(0, _factoriesNumber.createOr)({
+  typed
+});
+const pi = exports.pi = /* #__PURE__ */(0, _factoriesNumber.createPi)({
+  config: _configReadonly.config
+});
+const pow = exports.pow = /* #__PURE__ */(0, _factoriesNumber.createPow)({
+  typed
+});
+const random = exports.random = /* #__PURE__ */(0, _factoriesNumber.createRandom)({
+  config: _configReadonly.config,
+  typed
+});
+const rightLogShift = exports.rightLogShift = /* #__PURE__ */(0, _factoriesNumber.createRightLogShift)({
+  typed
+});
+const SQRT2 = exports.SQRT2 = /* #__PURE__ */(0, _factoriesNumber.createSQRT2)({
+  config: _configReadonly.config
+});
+const sech = exports.sech = /* #__PURE__ */(0, _factoriesNumber.createSech)({
+  typed
+});
+const sin = exports.sin = /* #__PURE__ */(0, _factoriesNumber.createSin)({
+  typed
+});
+const size = exports.size = /* #__PURE__ */(0, _factoriesNumber.createSize)({
+  matrix,
+  config: _configReadonly.config,
+  typed
+});
+const smallerEq = exports.smallerEq = /* #__PURE__ */(0, _factoriesNumber.createSmallerEq)({
+  config: _configReadonly.config,
+  typed
+});
+const square = exports.square = /* #__PURE__ */(0, _factoriesNumber.createSquare)({
+  typed
+});
+const string = exports.string = /* #__PURE__ */(0, _factoriesNumber.createString)({
+  typed
+});
+const subtract = exports.subtract = /* #__PURE__ */(0, _factoriesNumber.createSubtract)({
+  typed
+});
+const tanh = exports.tanh = /* #__PURE__ */(0, _factoriesNumber.createTanh)({
+  typed
+});
+const typeOf = exports.typeOf = /* #__PURE__ */(0, _factoriesNumber.createTypeOf)({
+  typed
+});
+const unequal = exports.unequal = /* #__PURE__ */(0, _factoriesNumber.createUnequal)({
+  equalScalar,
+  typed
+});
+const xgcd = exports.xgcd = /* #__PURE__ */(0, _factoriesNumber.createXgcd)({
+  typed
+});
+const acoth = exports.acoth = /* #__PURE__ */(0, _factoriesNumber.createAcoth)({
+  typed
+});
+const addScalar = exports.addScalar = /* #__PURE__ */(0, _factoriesNumber.createAddScalar)({
+  typed
+});
+const asech = exports.asech = /* #__PURE__ */(0, _factoriesNumber.createAsech)({
+  typed
+});
+const bitAnd = exports.bitAnd = /* #__PURE__ */(0, _factoriesNumber.createBitAnd)({
+  typed
+});
+const combinationsWithRep = exports.combinationsWithRep = /* #__PURE__ */(0, _factoriesNumber.createCombinationsWithRep)({
+  typed
+});
+const cosh = exports.cosh = /* #__PURE__ */(0, _factoriesNumber.createCosh)({
+  typed
+});
+const csch = exports.csch = /* #__PURE__ */(0, _factoriesNumber.createCsch)({
+  typed
+});
+const divideScalar = exports.divideScalar = /* #__PURE__ */(0, _factoriesNumber.createDivideScalar)({
+  typed
+});
+const equalText = exports.equalText = /* #__PURE__ */(0, _factoriesNumber.createEqualText)({
+  compareText,
+  isZero,
+  typed
+});
+const expm1 = exports.expm1 = /* #__PURE__ */(0, _factoriesNumber.createExpm1)({
+  typed
+});
+const isNumeric = exports.isNumeric = /* #__PURE__ */(0, _factoriesNumber.createIsNumeric)({
+  typed
+});
+const LN2 = exports.LN2 = /* #__PURE__ */(0, _factoriesNumber.createLN2)({
+  config: _configReadonly.config
+});
+const lcm = exports.lcm = /* #__PURE__ */(0, _factoriesNumber.createLcm)({
+  typed
+});
+const log10 = exports.log10 = /* #__PURE__ */(0, _factoriesNumber.createLog10)({
+  typed
+});
+const mapSlices = exports.mapSlices = /* #__PURE__ */(0, _factoriesNumber.createMapSlices)({
+  isInteger,
+  typed
+});
+const apply = exports.apply = mapSlices;
+const multiplyScalar = exports.multiplyScalar = /* #__PURE__ */(0, _factoriesNumber.createMultiplyScalar)({
+  typed
+});
+const nthRoot = exports.nthRoot = /* #__PURE__ */(0, _factoriesNumber.createNthRoot)({
+  typed
+});
+const pickRandom = exports.pickRandom = /* #__PURE__ */(0, _factoriesNumber.createPickRandom)({
+  config: _configReadonly.config,
+  typed
+});
+const rightArithShift = exports.rightArithShift = /* #__PURE__ */(0, _factoriesNumber.createRightArithShift)({
+  typed
+});
+const sec = exports.sec = /* #__PURE__ */(0, _factoriesNumber.createSec)({
+  typed
+});
+const sinh = exports.sinh = /* #__PURE__ */(0, _factoriesNumber.createSinh)({
+  typed
+});
+const sqrt = exports.sqrt = /* #__PURE__ */(0, _factoriesNumber.createSqrt)({
+  typed
+});
+const tan = exports.tan = /* #__PURE__ */(0, _factoriesNumber.createTan)({
+  typed
+});
+const unaryMinus = exports.unaryMinus = /* #__PURE__ */(0, _factoriesNumber.createUnaryMinus)({
+  typed
+});
+const acosh = exports.acosh = /* #__PURE__ */(0, _factoriesNumber.createAcosh)({
+  typed
+});
+const atan2 = exports.atan2 = /* #__PURE__ */(0, _factoriesNumber.createAtan2)({
+  typed
+});
+const bitOr = exports.bitOr = /* #__PURE__ */(0, _factoriesNumber.createBitOr)({
+  typed
+});
+const clone = exports.clone = /* #__PURE__ */(0, _factoriesNumber.createClone)({
+  typed
+});
+const coth = exports.coth = /* #__PURE__ */(0, _factoriesNumber.createCoth)({
+  typed
+});
+const equal = exports.equal = /* #__PURE__ */(0, _factoriesNumber.createEqual)({
+  equalScalar,
+  typed
+});
+const factorial = exports.factorial = /* #__PURE__ */(0, _factoriesNumber.createFactorial)({
+  gamma,
+  typed
+});
+const hasNumericValue = exports.hasNumericValue = /* #__PURE__ */(0, _factoriesNumber.createHasNumericValue)({
+  isNumeric,
+  typed
+});
+const isNaN = exports.isNaN = /* #__PURE__ */(0, _factoriesNumber.createIsNaN)({
+  typed
+});
+const larger = exports.larger = /* #__PURE__ */(0, _factoriesNumber.createLarger)({
+  config: _configReadonly.config,
+  typed
+});
+const log2 = exports.log2 = /* #__PURE__ */(0, _factoriesNumber.createLog2)({
+  typed
+});
+const mode = exports.mode = /* #__PURE__ */(0, _factoriesNumber.createMode)({
+  isNaN,
+  isNumeric,
+  typed
+});
+const norm = exports.norm = /* #__PURE__ */(0, _factoriesNumber.createNorm)({
+  typed
+});
+const partitionSelect = exports.partitionSelect = /* #__PURE__ */(0, _factoriesNumber.createPartitionSelect)({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+const print = exports.print = /* #__PURE__ */(0, _factoriesNumber.createPrint)({
+  typed
+});
+const randomInt = exports.randomInt = /* #__PURE__ */(0, _factoriesNumber.createRandomInt)({
+  config: _configReadonly.config,
+  log2,
+  typed
+});
+const round = exports.round = /* #__PURE__ */(0, _factoriesNumber.createRound)({
+  typed
+});
+const smaller = exports.smaller = /* #__PURE__ */(0, _factoriesNumber.createSmaller)({
+  config: _configReadonly.config,
+  typed
+});
+const subtractScalar = exports.subtractScalar = /* #__PURE__ */(0, _factoriesNumber.createSubtractScalar)({
+  typed
+});
+const _true = exports._true = /* #__PURE__ */(0, _factoriesNumber.createTrue)({});
+const variance = exports.variance = /* #__PURE__ */(0, _factoriesNumber.createVariance)({
+  add,
+  divide,
+  isNaN,
+  mapSlices,
+  multiply,
+  subtract,
+  typed
+});
+const zeta = exports.zeta = /* #__PURE__ */(0, _factoriesNumber.createZeta)({
+  add,
+  config: _configReadonly.config,
+  divide,
+  equal,
+  factorial,
+  gamma,
+  isNegative,
+  multiply,
+  pi,
+  pow,
+  sin,
+  smallerEq,
+  subtract,
+  typed
+});
+const acsch = exports.acsch = /* #__PURE__ */(0, _factoriesNumber.createAcsch)({
+  typed
+});
+const catalan = exports.catalan = /* #__PURE__ */(0, _factoriesNumber.createCatalan)({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+const compareNatural = exports.compareNatural = /* #__PURE__ */(0, _factoriesNumber.createCompareNatural)({
+  compare,
+  typed
+});
+const composition = exports.composition = /* #__PURE__ */(0, _factoriesNumber.createComposition)({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+const cumsum = exports.cumsum = /* #__PURE__ */(0, _factoriesNumber.createCumSum)({
+  add,
+  typed,
+  unaryPlus
+});
+const floor = exports.floor = /* #__PURE__ */(0, _factoriesNumber.createFloor)({
+  config: _configReadonly.config,
+  round,
+  typed
+});
+const hypot = exports.hypot = /* #__PURE__ */(0, _factoriesNumber.createHypot)({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+const lgamma = exports.lgamma = /* #__PURE__ */(0, _factoriesNumber.createLgamma)({
+  typed
+});
+const median = exports.median = /* #__PURE__ */(0, _factoriesNumber.createMedian)({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+const multinomial = exports.multinomial = /* #__PURE__ */(0, _factoriesNumber.createMultinomial)({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+const permutations = exports.permutations = /* #__PURE__ */(0, _factoriesNumber.createPermutations)({
+  factorial,
+  typed
+});
+const quantileSeq = exports.quantileSeq = /* #__PURE__ */(0, _factoriesNumber.createQuantileSeq)({
+  add,
+  compare,
+  divide,
+  isInteger,
+  larger,
+  mapSlices,
+  multiply,
+  partitionSelect,
+  smaller,
+  smallerEq,
+  subtract,
+  typed
+});
+const sign = exports.sign = /* #__PURE__ */(0, _factoriesNumber.createSign)({
+  typed
+});
+const std = exports.std = /* #__PURE__ */(0, _factoriesNumber.createStd)({
+  map,
+  sqrt,
+  typed,
+  variance
+});
+const stirlingS2 = exports.stirlingS2 = /* #__PURE__ */(0, _factoriesNumber.createStirlingS2)({
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtractScalar,
+  typed
+});
+const asinh = exports.asinh = /* #__PURE__ */(0, _factoriesNumber.createAsinh)({
+  typed
+});
+const ceil = exports.ceil = /* #__PURE__ */(0, _factoriesNumber.createCeil)({
+  config: _configReadonly.config,
+  round,
+  typed
+});
+const deepEqual = exports.deepEqual = /* #__PURE__ */(0, _factoriesNumber.createDeepEqual)({
+  equal,
+  typed
+});
+const fix = exports.fix = /* #__PURE__ */(0, _factoriesNumber.createFix)({
+  ceil,
+  floor,
+  typed
+});
+const isPrime = exports.isPrime = /* #__PURE__ */(0, _factoriesNumber.createIsPrime)({
+  typed
+});
+const numeric = exports.numeric = /* #__PURE__ */(0, _factoriesNumber.createNumeric)({
+  number
+});
+const prod = exports.prod = /* #__PURE__ */(0, _factoriesNumber.createProd)({
+  config: _configReadonly.config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+const bellNumbers = exports.bellNumbers = /* #__PURE__ */(0, _factoriesNumber.createBellNumbers)({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+const gcd = exports.gcd = /* #__PURE__ */(0, _factoriesNumber.createGcd)({
+  typed
+});
+const mad = exports.mad = /* #__PURE__ */(0, _factoriesNumber.createMad)({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+const range = exports.range = /* #__PURE__ */(0, _factoriesNumber.createRange)({
+  matrix,
+  add,
+  config: _configReadonly.config,
+  equal,
+  isPositive,
+  isZero,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+const sum = exports.sum = /* #__PURE__ */(0, _factoriesNumber.createSum)({
+  add,
+  config: _configReadonly.config,
+  numeric,
+  typed
+});
+const corr = exports.corr = /* #__PURE__ */(0, _factoriesNumber.createCorr)({
+  add,
+  divide,
+  matrix,
+  mean,
+  multiply,
+  pow,
+  sqrt,
+  subtract,
+  sum,
+  typed
+});
+const max = exports.max = /* #__PURE__ */(0, _factoriesNumber.createMax)({
+  config: _configReadonly.config,
+  isNaN,
+  larger,
+  numeric,
+  typed
+});
+const min = exports.min = /* #__PURE__ */(0, _factoriesNumber.createMin)({
+  config: _configReadonly.config,
+  isNaN,
+  numeric,
+  smaller,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/entry/typeChecks.js b/node_modules/mathjs/lib/cjs/entry/typeChecks.js
new file mode 100644
index 0000000..44c58bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/entry/typeChecks.js
@@ -0,0 +1,264 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "isAccessorNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isAccessorNode;
+  }
+});
+Object.defineProperty(exports, "isArray", {
+  enumerable: true,
+  get: function () {
+    return _is.isArray;
+  }
+});
+Object.defineProperty(exports, "isArrayNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isArrayNode;
+  }
+});
+Object.defineProperty(exports, "isAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "isBigInt", {
+  enumerable: true,
+  get: function () {
+    return _is.isBigInt;
+  }
+});
+Object.defineProperty(exports, "isBigNumber", {
+  enumerable: true,
+  get: function () {
+    return _is.isBigNumber;
+  }
+});
+Object.defineProperty(exports, "isBlockNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isBlockNode;
+  }
+});
+Object.defineProperty(exports, "isBoolean", {
+  enumerable: true,
+  get: function () {
+    return _is.isBoolean;
+  }
+});
+Object.defineProperty(exports, "isChain", {
+  enumerable: true,
+  get: function () {
+    return _is.isChain;
+  }
+});
+Object.defineProperty(exports, "isCollection", {
+  enumerable: true,
+  get: function () {
+    return _is.isCollection;
+  }
+});
+Object.defineProperty(exports, "isComplex", {
+  enumerable: true,
+  get: function () {
+    return _is.isComplex;
+  }
+});
+Object.defineProperty(exports, "isConditionalNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isConditionalNode;
+  }
+});
+Object.defineProperty(exports, "isConstantNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isConstantNode;
+  }
+});
+Object.defineProperty(exports, "isDate", {
+  enumerable: true,
+  get: function () {
+    return _is.isDate;
+  }
+});
+Object.defineProperty(exports, "isDenseMatrix", {
+  enumerable: true,
+  get: function () {
+    return _is.isDenseMatrix;
+  }
+});
+Object.defineProperty(exports, "isFraction", {
+  enumerable: true,
+  get: function () {
+    return _is.isFraction;
+  }
+});
+Object.defineProperty(exports, "isFunction", {
+  enumerable: true,
+  get: function () {
+    return _is.isFunction;
+  }
+});
+Object.defineProperty(exports, "isFunctionAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "isFunctionNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isFunctionNode;
+  }
+});
+Object.defineProperty(exports, "isHelp", {
+  enumerable: true,
+  get: function () {
+    return _is.isHelp;
+  }
+});
+Object.defineProperty(exports, "isIndex", {
+  enumerable: true,
+  get: function () {
+    return _is.isIndex;
+  }
+});
+Object.defineProperty(exports, "isIndexNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isIndexNode;
+  }
+});
+Object.defineProperty(exports, "isMap", {
+  enumerable: true,
+  get: function () {
+    return _is.isMap;
+  }
+});
+Object.defineProperty(exports, "isMatrix", {
+  enumerable: true,
+  get: function () {
+    return _is.isMatrix;
+  }
+});
+Object.defineProperty(exports, "isNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isNode;
+  }
+});
+Object.defineProperty(exports, "isNull", {
+  enumerable: true,
+  get: function () {
+    return _is.isNull;
+  }
+});
+Object.defineProperty(exports, "isNumber", {
+  enumerable: true,
+  get: function () {
+    return _is.isNumber;
+  }
+});
+Object.defineProperty(exports, "isObject", {
+  enumerable: true,
+  get: function () {
+    return _is.isObject;
+  }
+});
+Object.defineProperty(exports, "isObjectNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isObjectNode;
+  }
+});
+Object.defineProperty(exports, "isObjectWrappingMap", {
+  enumerable: true,
+  get: function () {
+    return _is.isObjectWrappingMap;
+  }
+});
+Object.defineProperty(exports, "isOperatorNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isOperatorNode;
+  }
+});
+Object.defineProperty(exports, "isParenthesisNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "isPartitionedMap", {
+  enumerable: true,
+  get: function () {
+    return _is.isPartitionedMap;
+  }
+});
+Object.defineProperty(exports, "isRange", {
+  enumerable: true,
+  get: function () {
+    return _is.isRange;
+  }
+});
+Object.defineProperty(exports, "isRangeNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isRangeNode;
+  }
+});
+Object.defineProperty(exports, "isRegExp", {
+  enumerable: true,
+  get: function () {
+    return _is.isRegExp;
+  }
+});
+Object.defineProperty(exports, "isRelationalNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isRelationalNode;
+  }
+});
+Object.defineProperty(exports, "isResultSet", {
+  enumerable: true,
+  get: function () {
+    return _is.isResultSet;
+  }
+});
+Object.defineProperty(exports, "isSparseMatrix", {
+  enumerable: true,
+  get: function () {
+    return _is.isSparseMatrix;
+  }
+});
+Object.defineProperty(exports, "isString", {
+  enumerable: true,
+  get: function () {
+    return _is.isString;
+  }
+});
+Object.defineProperty(exports, "isSymbolNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isSymbolNode;
+  }
+});
+Object.defineProperty(exports, "isUndefined", {
+  enumerable: true,
+  get: function () {
+    return _is.isUndefined;
+  }
+});
+Object.defineProperty(exports, "isUnit", {
+  enumerable: true,
+  get: function () {
+    return _is.isUnit;
+  }
+});
+var _is = require("../utils/is.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/ArgumentsError.js b/node_modules/mathjs/lib/cjs/error/ArgumentsError.js
new file mode 100644
index 0000000..78e6de7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/ArgumentsError.js
@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ArgumentsError = ArgumentsError;
+/**
+ * Create a syntax error with the message:
+ *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'
+ * @param {string} fn     Function name
+ * @param {number} count  Actual argument count
+ * @param {number} min    Minimum required argument count
+ * @param {number} [max]  Maximum required argument count
+ * @extends Error
+ */
+function ArgumentsError(fn, count, min, max) {
+  if (!(this instanceof ArgumentsError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.fn = fn;
+  this.count = count;
+  this.min = min;
+  this.max = max;
+  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';
+  this.stack = new Error().stack;
+}
+ArgumentsError.prototype = new Error();
+ArgumentsError.prototype.constructor = Error;
+ArgumentsError.prototype.name = 'ArgumentsError';
+ArgumentsError.prototype.isArgumentsError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/DimensionError.js b/node_modules/mathjs/lib/cjs/error/DimensionError.js
new file mode 100644
index 0000000..821d407
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/DimensionError.js
@@ -0,0 +1,29 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.DimensionError = DimensionError;
+/**
+ * Create a range error with the message:
+ *     'Dimension mismatch (<actual size> != <expected size>)'
+ * @param {number | number[]} actual        The actual size
+ * @param {number | number[]} expected      The expected size
+ * @param {string} [relation='!=']          Optional relation between actual
+ *                                          and expected size: '!=', '<', etc.
+ * @extends RangeError
+ */
+function DimensionError(actual, expected, relation) {
+  if (!(this instanceof DimensionError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.actual = actual;
+  this.expected = expected;
+  this.relation = relation;
+  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';
+  this.stack = new Error().stack;
+}
+DimensionError.prototype = new RangeError();
+DimensionError.prototype.constructor = RangeError;
+DimensionError.prototype.name = 'DimensionError';
+DimensionError.prototype.isDimensionError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/error/IndexError.js b/node_modules/mathjs/lib/cjs/error/IndexError.js
new file mode 100644
index 0000000..ec6c794
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/error/IndexError.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.IndexError = IndexError;
+/**
+ * Create a range error with the message:
+ *     'Index out of range (index < min)'
+ *     'Index out of range (index < max)'
+ *
+ * @param {number} index     The actual index
+ * @param {number} [min=0]   Minimum index (included)
+ * @param {number} [max]     Maximum index (excluded)
+ * @extends RangeError
+ */
+function IndexError(index, min, max) {
+  if (!(this instanceof IndexError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.index = index;
+  if (arguments.length < 3) {
+    this.min = 0;
+    this.max = min;
+  } else {
+    this.min = min;
+    this.max = max;
+  }
+  if (this.min !== undefined && this.index < this.min) {
+    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';
+  } else if (this.max !== undefined && this.index >= this.max) {
+    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';
+  } else {
+    this.message = 'Index out of range (' + this.index + ')';
+  }
+  this.stack = new Error().stack;
+}
+IndexError.prototype = new RangeError();
+IndexError.prototype.constructor = RangeError;
+IndexError.prototype.name = 'IndexError';
+IndexError.prototype.isIndexError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/Help.js b/node_modules/mathjs/lib/cjs/expression/Help.js
new file mode 100644
index 0000000..a5269c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/Help.js
@@ -0,0 +1,138 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHelpClass = void 0;
+var _is = require("../utils/is.js");
+var _object = require("../utils/object.js");
+var _string = require("../utils/string.js");
+var _factory = require("../utils/factory.js");
+const name = 'Help';
+const dependencies = ['evaluate'];
+const createHelpClass = exports.createHelpClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    evaluate
+  } = _ref;
+  /**
+   * Documentation object
+   * @param {Object} doc  Object containing properties:
+   *                      {string} name
+   *                      {string} category
+   *                      {string} description
+   *                      {string[]} syntax
+   *                      {string[]} examples
+   *                      {string[]} seealso
+   * @constructor
+   */
+  function Help(doc) {
+    if (!(this instanceof Help)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (!doc) throw new Error('Argument "doc" missing');
+    this.doc = doc;
+  }
+
+  /**
+   * Attach type information
+   */
+  Help.prototype.type = 'Help';
+  Help.prototype.isHelp = true;
+
+  /**
+   * Generate a string representation of the Help object
+   * @return {string} Returns a string
+   * @private
+   */
+  Help.prototype.toString = function () {
+    const doc = this.doc || {};
+    let desc = '\n';
+    if (doc.name) {
+      desc += 'Name: ' + doc.name + '\n\n';
+    }
+    if (doc.category) {
+      desc += 'Category: ' + doc.category + '\n\n';
+    }
+    if (doc.description) {
+      desc += 'Description:\n    ' + doc.description + '\n\n';
+    }
+    if (doc.syntax) {
+      desc += 'Syntax:\n    ' + doc.syntax.join('\n    ') + '\n\n';
+    }
+    if (doc.examples) {
+      desc += 'Examples:\n';
+
+      // after evaluating the examples, we restore config in case the examples
+      // did change the config.
+      let configChanged = false;
+      const originalConfig = evaluate('config()');
+      const scope = {
+        config: newConfig => {
+          configChanged = true;
+          return evaluate('config(newConfig)', {
+            newConfig
+          });
+        }
+      };
+      for (let i = 0; i < doc.examples.length; i++) {
+        const expr = doc.examples[i];
+        desc += '    ' + expr + '\n';
+        let res;
+        try {
+          // note: res can be undefined when `expr` is an empty string
+          res = evaluate(expr, scope);
+        } catch (e) {
+          res = e;
+        }
+        if (res !== undefined && !(0, _is.isHelp)(res)) {
+          desc += '        ' + (0, _string.format)(res, {
+            precision: 14
+          }) + '\n';
+        }
+      }
+      desc += '\n';
+      if (configChanged) {
+        evaluate('config(originalConfig)', {
+          originalConfig
+        });
+      }
+    }
+    if (doc.mayThrow && doc.mayThrow.length) {
+      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\n\n';
+    }
+    if (doc.seealso && doc.seealso.length) {
+      desc += 'See also: ' + doc.seealso.join(', ') + '\n';
+    }
+    return desc;
+  };
+
+  /**
+   * Export the help object to JSON
+   */
+  Help.prototype.toJSON = function () {
+    const obj = (0, _object.clone)(this.doc);
+    obj.mathjs = 'Help';
+    return obj;
+  };
+
+  /**
+   * Instantiate a Help object from a JSON object
+   * @param {Object} json
+   * @returns {Help} Returns a new Help object
+   */
+  Help.fromJSON = function (json) {
+    const doc = {};
+    Object.keys(json).filter(prop => prop !== 'mathjs').forEach(prop => {
+      doc[prop] = json[prop];
+    });
+    return new Help(doc);
+  };
+
+  /**
+   * Returns a string representation of the Help object
+   */
+  Help.prototype.valueOf = Help.prototype.toString;
+  return Help;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/Parser.js b/node_modules/mathjs/lib/cjs/expression/Parser.js
new file mode 100644
index 0000000..80f4312
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/Parser.js
@@ -0,0 +1,200 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParserClass = void 0;
+var _factory = require("../utils/factory.js");
+var _is = require("../utils/is.js");
+var _map = require("../utils/map.js");
+const name = 'Parser';
+const dependencies = ['evaluate', 'parse'];
+const createParserClass = exports.createParserClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    evaluate,
+    parse
+  } = _ref;
+  /**
+   * @constructor Parser
+   * Parser contains methods to evaluate or parse expressions, and has a number
+   * of convenience methods to get, set, and remove variables from memory. Parser
+   * keeps a scope containing variables in memory, which is used for all
+   * evaluations.
+   *
+   * Methods:
+   *    const result = parser.evaluate(expr)  // evaluate an expression
+   *    const value = parser.get(name)        // retrieve a variable from the parser
+   *    const values = parser.getAll()        // retrieve all defined variables
+   *    parser.set(name, value)               // set a variable in the parser
+   *    parser.remove(name)                   // clear a variable from the
+   *                                          // parsers scope
+   *    parser.clear()                        // clear the parsers scope
+   *
+   * Example usage:
+   *    const parser = new Parser()
+   *    // Note: there is a convenience method which can be used instead:
+   *    // const parser = new math.parser()
+   *
+   *    // evaluate expressions
+   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *    parser.evaluate('sqrt(-4)')               // 2i
+   *    parser.evaluate('2 inch in cm')           // 5.08 cm
+   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476
+   *
+   *    // define variables and functions
+   *    parser.evaluate('x = 7 / 2')              // 3.5
+   *    parser.evaluate('x + 3')                  // 6.5
+   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)
+   *    parser.evaluate('f(2, 3)')                // 8
+   *
+   *    // get and set variables and functions
+   *    const x = parser.get('x')                 // 3.5
+   *    const f = parser.get('f')                 // function
+   *    const g = f(3, 2)                         // 9
+   *    parser.set('h', 500)
+   *    const i = parser.evaluate('h / 2')        // 250
+   *    parser.set('hello', function (name) {
+   *        return 'hello, ' + name + '!'
+   *    })
+   *    parser.evaluate('hello("user")')          // "hello, user!"
+   *
+   *    // clear defined functions and variables
+   *    parser.clear()
+   *
+   */
+  function Parser() {
+    if (!(this instanceof Parser)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    Object.defineProperty(this, 'scope', {
+      value: (0, _map.createEmptyMap)(),
+      writable: false
+    });
+  }
+
+  /**
+   * Attach type information
+   */
+  Parser.prototype.type = 'Parser';
+  Parser.prototype.isParser = true;
+
+  /**
+   * Parse and evaluate the given expression
+   * @param {string | string[]} expr   A string containing an expression,
+   *                                   for example "2+3", or a list with expressions
+   * @return {*} result     The result, or undefined when the expression was empty
+   * @throws {Error}
+   */
+  Parser.prototype.evaluate = function (expr) {
+    // TODO: validate arguments
+    return evaluate(expr, this.scope);
+  };
+
+  /**
+   * Get a variable (a function or variable) by name from the parsers scope.
+   * Returns undefined when not found
+   * @param {string} name
+   * @return {* | undefined} value
+   */
+  Parser.prototype.get = function (name) {
+    // TODO: validate arguments
+    if (this.scope.has(name)) {
+      return this.scope.get(name);
+    }
+  };
+
+  /**
+   * Get a map with all defined variables
+   * @return {Object} values
+   */
+  Parser.prototype.getAll = function () {
+    return (0, _map.toObject)(this.scope);
+  };
+
+  /**
+   * Get a map with all defined variables
+   * @return {Map} values
+   */
+  Parser.prototype.getAllAsMap = function () {
+    return this.scope;
+  };
+  function isValidVariableName(name) {
+    if (name.length === 0) {
+      return false;
+    }
+    for (let i = 0; i < name.length; i++) {
+      const cPrev = name.charAt(i - 1);
+      const c = name.charAt(i);
+      const cNext = name.charAt(i + 1);
+      const valid = parse.isAlpha(c, cPrev, cNext) || i > 0 && parse.isDigit(c);
+      if (!valid) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  /**
+   * Set a symbol (a function or variable) by name from the parsers scope.
+   * @param {string} name
+   * @param {* | undefined} value
+   */
+  Parser.prototype.set = function (name, value) {
+    if (!isValidVariableName(name)) {
+      throw new Error(`Invalid variable name: '${name}'. Variable names must follow the specified rules.`);
+    }
+    this.scope.set(name, value);
+    return value;
+  };
+
+  /**
+   * Remove a variable from the parsers scope
+   * @param {string} name
+   */
+  Parser.prototype.remove = function (name) {
+    this.scope.delete(name);
+  };
+
+  /**
+   * Clear the scope with variables and functions
+   */
+  Parser.prototype.clear = function () {
+    this.scope.clear();
+  };
+  Parser.prototype.toJSON = function () {
+    const json = {
+      mathjs: 'Parser',
+      variables: {},
+      functions: {}
+    };
+    for (const [name, value] of this.scope) {
+      if ((0, _is.isFunction)(value)) {
+        if (!isExpressionFunction(value)) {
+          throw new Error(`Cannot serialize external function ${name}`);
+        }
+        json.functions[name] = `${value.syntax} = ${value.expr}`;
+      } else {
+        json.variables[name] = value;
+      }
+    }
+    return json;
+  };
+  Parser.fromJSON = function (json) {
+    const parser = new Parser();
+    Object.entries(json.variables).forEach(_ref2 => {
+      let [name, value] = _ref2;
+      return parser.set(name, value);
+    });
+    Object.entries(json.functions).forEach(_ref3 => {
+      let [_name, fn] = _ref3;
+      return parser.evaluate(fn);
+    });
+    return parser;
+  };
+  return Parser;
+}, {
+  isClass: true
+});
+function isExpressionFunction(value) {
+  return typeof value === 'function' && typeof value.syntax === 'string' && typeof value.expr === 'string';
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js
new file mode 100644
index 0000000..0d196e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/Infinity.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.InfinityDocs = void 0;
+const InfinityDocs = exports.InfinityDocs = {
+  name: 'Infinity',
+  category: 'Constants',
+  syntax: ['Infinity'],
+  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',
+  examples: ['Infinity', '1 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js
new file mode 100644
index 0000000..cb72ec4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN10.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN10Docs = void 0;
+const LN10Docs = exports.LN10Docs = {
+  name: 'LN10',
+  category: 'Constants',
+  syntax: ['LN10'],
+  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',
+  examples: ['LN10', 'log(10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js
new file mode 100644
index 0000000..8e02ef2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LN2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LN2Docs = void 0;
+const LN2Docs = exports.LN2Docs = {
+  name: 'LN2',
+  category: 'Constants',
+  syntax: ['LN2'],
+  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',
+  examples: ['LN2', 'log(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js
new file mode 100644
index 0000000..b8f4e1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG10E.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG10EDocs = void 0;
+const LOG10EDocs = exports.LOG10EDocs = {
+  name: 'LOG10E',
+  category: 'Constants',
+  syntax: ['LOG10E'],
+  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',
+  examples: ['LOG10E', 'log(e, 10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js
new file mode 100644
index 0000000..9ed7b87
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/LOG2E.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.LOG2EDocs = void 0;
+const LOG2EDocs = exports.LOG2EDocs = {
+  name: 'LOG2E',
+  category: 'Constants',
+  syntax: ['LOG2E'],
+  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',
+  examples: ['LOG2E', 'log(e, 2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js
new file mode 100644
index 0000000..adab0d3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/NaN.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.NaNDocs = void 0;
+const NaNDocs = exports.NaNDocs = {
+  name: 'NaN',
+  category: 'Constants',
+  syntax: ['NaN'],
+  description: 'Not a number',
+  examples: ['NaN', '0 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js
new file mode 100644
index 0000000..76d2977
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT1_2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT12Docs = void 0;
+const SQRT12Docs = exports.SQRT12Docs = {
+  name: 'SQRT1_2',
+  category: 'Constants',
+  syntax: ['SQRT1_2'],
+  description: 'Returns the square root of 1/2, approximately equal to 0.707',
+  examples: ['SQRT1_2', 'sqrt(1/2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js
new file mode 100644
index 0000000..c119c71
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/SQRT2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.SQRT2Docs = void 0;
+const SQRT2Docs = exports.SQRT2Docs = {
+  name: 'SQRT2',
+  category: 'Constants',
+  syntax: ['SQRT2'],
+  description: 'Returns the square root of 2, approximately equal to 1.414',
+  examples: ['SQRT2', 'sqrt(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js
new file mode 100644
index 0000000..efd8222
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/e.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eDocs = void 0;
+const eDocs = exports.eDocs = {
+  name: 'e',
+  category: 'Constants',
+  syntax: ['e'],
+  description: 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828',
+  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js
new file mode 100644
index 0000000..37d4bbb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/false.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.falseDocs = void 0;
+const falseDocs = exports.falseDocs = {
+  name: 'false',
+  category: 'Constants',
+  syntax: ['false'],
+  description: 'Boolean value false',
+  examples: ['false'],
+  seealso: ['true']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js
new file mode 100644
index 0000000..b0c0f4f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/i.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.iDocs = void 0;
+const iDocs = exports.iDocs = {
+  name: 'i',
+  category: 'Constants',
+  syntax: ['i'],
+  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',
+  examples: ['i', 'i * i', 'sqrt(-1)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js
new file mode 100644
index 0000000..250eca4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/null.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullDocs = void 0;
+const nullDocs = exports.nullDocs = {
+  name: 'null',
+  category: 'Constants',
+  syntax: ['null'],
+  description: 'Value null',
+  examples: ['null'],
+  seealso: ['true', 'false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js
new file mode 100644
index 0000000..46175cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/phi.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.phiDocs = void 0;
+const phiDocs = exports.phiDocs = {
+  name: 'phi',
+  category: 'Constants',
+  syntax: ['phi'],
+  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',
+  examples: ['phi'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js
new file mode 100644
index 0000000..d7b6bea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/pi.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.piDocs = void 0;
+const piDocs = exports.piDocs = {
+  name: 'pi',
+  category: 'Constants',
+  syntax: ['pi'],
+  description: 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159',
+  examples: ['pi', 'sin(pi/2)'],
+  seealso: ['tau']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js
new file mode 100644
index 0000000..da38e95
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/tau.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tauDocs = void 0;
+const tauDocs = exports.tauDocs = {
+  name: 'tau',
+  category: 'Constants',
+  syntax: ['tau'],
+  description: 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',
+  examples: ['tau', '2 * pi'],
+  seealso: ['pi']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js
new file mode 100644
index 0000000..5719e8c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/true.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.trueDocs = void 0;
+const trueDocs = exports.trueDocs = {
+  name: 'true',
+  category: 'Constants',
+  syntax: ['true'],
+  description: 'Boolean value true',
+  examples: ['true'],
+  seealso: ['false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js
new file mode 100644
index 0000000..e215e43
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/constants/version.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.versionDocs = void 0;
+const versionDocs = exports.versionDocs = {
+  name: 'version',
+  category: 'Constants',
+  syntax: ['version'],
+  description: 'A string with the version number of math.js',
+  examples: ['version'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bigint.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bigint.js
new file mode 100644
index 0000000..35a92c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bigint.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bigintDocs = void 0;
+const bigintDocs = exports.bigintDocs = {
+  name: 'bigint',
+  category: 'Construction',
+  syntax: ['bigint(x)'],
+  description: 'Create a bigint, an integer with an arbitrary number of digits, from a number or string.',
+  examples: ['123123123123123123 # a large number will lose digits', 'bigint("123123123123123123")', 'bignumber(["1", "3", "5"])'],
+  seealso: ['boolean', 'bignumber', 'number', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js
new file mode 100644
index 0000000..e852d27
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/bignumber.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bignumberDocs = void 0;
+const bignumberDocs = exports.bignumberDocs = {
+  name: 'bignumber',
+  category: 'Construction',
+  syntax: ['bignumber(x)'],
+  description: 'Create a big number from a number or string.',
+  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber("7.2")', 'bignumber("7.2e500")', 'bignumber([0.1, 0.2, 0.3])'],
+  seealso: ['boolean', 'bigint', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js
new file mode 100644
index 0000000..cac2f0a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/boolean.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.booleanDocs = void 0;
+const booleanDocs = exports.booleanDocs = {
+  name: 'boolean',
+  category: 'Construction',
+  syntax: ['x', 'boolean(x)'],
+  description: 'Convert a string or number into a boolean.',
+  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean("true")', 'boolean("false")', 'boolean([1, 0, 1, 1])'],
+  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js
new file mode 100644
index 0000000..c73b0de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/complex.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexDocs = void 0;
+const complexDocs = exports.complexDocs = {
+  name: 'complex',
+  category: 'Construction',
+  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],
+  description: 'Create a complex number.',
+  examples: ['complex()', 'complex(2, 3)', 'complex("7 - 2i")'],
+  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js
new file mode 100644
index 0000000..13d213a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/createUnit.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitDocs = void 0;
+const createUnitDocs = exports.createUnitDocs = {
+  name: 'createUnit',
+  category: 'Construction',
+  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],
+  description: 'Create a user-defined unit and register it with the Unit type.',
+  examples: ['createUnit("foo")', 'createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})', 'createUnit("mph", "1 mile/hour")'],
+  seealso: ['unit', 'splitUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js
new file mode 100644
index 0000000..b51923b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/fraction.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fractionDocs = void 0;
+const fractionDocs = exports.fractionDocs = {
+  name: 'fraction',
+  category: 'Construction',
+  syntax: ['fraction(num)', 'fraction(matrix)', 'fraction(num,den)', 'fraction({n: num, d: den})'],
+  description: 'Create a fraction from a number or from integer numerator and denominator.',
+  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)', 'fraction({n: 333, d: 53})', 'fraction([sqrt(9), sqrt(10), sqrt(11)])'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js
new file mode 100644
index 0000000..53653e6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/index.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.indexDocs = void 0;
+const indexDocs = exports.indexDocs = {
+  name: 'index',
+  category: 'Construction',
+  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],
+  description: 'Create an index to get or replace a subset of a matrix',
+  examples: ['A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[1:2, 1:2] = 1', 'B = [1, 2, 3]', 'B[B>1 and B<3]'],
+  seealso: ['bignumber', 'boolean', 'complex', 'matrix', 'number', 'range', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js
new file mode 100644
index 0000000..2cd0ecf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/matrix.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixDocs = void 0;
+const matrixDocs = exports.matrixDocs = {
+  name: 'matrix',
+  category: 'Construction',
+  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix("dense")', 'matrix([...])'],
+  description: 'Create a matrix.',
+  examples: ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], "sparse")', 'matrix([3, 4; 5, 6], "sparse", "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js
new file mode 100644
index 0000000..4374c3f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/number.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numberDocs = void 0;
+const numberDocs = exports.numberDocs = {
+  name: 'number',
+  category: 'Construction',
+  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],
+  description: 'Create a number or convert a string or boolean into a number.',
+  examples: ['2', '2e3', '4.05', 'number(2)', 'number("7.2")', 'number(true)', 'number([true, false, true, true])', 'number(unit("52cm"), "m")'],
+  seealso: ['bignumber', 'bigint', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js
new file mode 100644
index 0000000..062dd57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/sparse.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sparseDocs = void 0;
+const sparseDocs = exports.sparseDocs = {
+  name: 'sparse',
+  category: 'Construction',
+  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], "number")'],
+  description: 'Create a sparse matrix.',
+  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js
new file mode 100644
index 0000000..7c03ce9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/splitUnit.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.splitUnitDocs = void 0;
+const splitUnitDocs = exports.splitUnitDocs = {
+  name: 'splitUnit',
+  category: 'Construction',
+  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],
+  description: 'Split a unit in an array of units whose sum is equal to the original unit.',
+  examples: ['splitUnit(1 m, ["feet", "inch"])'],
+  seealso: ['unit', 'createUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js
new file mode 100644
index 0000000..6a07f5f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/string.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stringDocs = void 0;
+const stringDocs = exports.stringDocs = {
+  name: 'string',
+  category: 'Construction',
+  syntax: ['"text"', 'string(x)'],
+  description: 'Create a string or convert a value to a string',
+  examples: ['"Hello World!"', 'string(4.2)', 'string(3 + 2i)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js
new file mode 100644
index 0000000..95bec70
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/construction/unit.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unitDocs = void 0;
+const unitDocs = exports.unitDocs = {
+  name: 'unit',
+  category: 'Construction',
+  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],
+  description: 'Create a unit.',
+  examples: ['5.5 mm', '3 inch', 'unit(7.1, "kilogram")', 'unit("23 deg")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js
new file mode 100644
index 0000000..97b9fce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/config.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.configDocs = void 0;
+const configDocs = exports.configDocs = {
+  name: 'config',
+  category: 'Core',
+  syntax: ['config()', 'config(options)'],
+  description: 'Get configuration or change configuration.',
+  examples: ['config()', '1/3 + 1/4', 'config({number: "Fraction"})', '1/3 + 1/4'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js
new file mode 100644
index 0000000..38353f0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/import.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.importDocs = void 0;
+const importDocs = exports.importDocs = {
+  name: 'import',
+  category: 'Core',
+  syntax: ['import(functions)', 'import(functions, options)'],
+  description: 'Import functions or constants from an object.',
+  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js
new file mode 100644
index 0000000..bddba19
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/core/typed.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typedDocs = void 0;
+const typedDocs = exports.typedDocs = {
+  name: 'typed',
+  category: 'Core',
+  syntax: ['typed(signatures)', 'typed(name, signatures)'],
+  description: 'Create a typed function.',
+  examples: ['double = typed({ "number": f(x)=x+x, "string": f(x)=concat(x,x) })', 'double(2)', 'double("hello")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js
new file mode 100644
index 0000000..8826d4d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/embeddedDocs.js
@@ -0,0 +1,742 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.embeddedDocs = void 0;
+var _e = require("./constants/e.js");
+var _false = require("./constants/false.js");
+var _i = require("./constants/i.js");
+var _Infinity = require("./constants/Infinity.js");
+var _LN = require("./constants/LN10.js");
+var _LN2 = require("./constants/LN2.js");
+var _LOG10E = require("./constants/LOG10E.js");
+var _LOG2E = require("./constants/LOG2E.js");
+var _NaN = require("./constants/NaN.js");
+var _null = require("./constants/null.js");
+var _phi = require("./constants/phi.js");
+var _pi = require("./constants/pi.js");
+var _SQRT1_ = require("./constants/SQRT1_2.js");
+var _SQRT = require("./constants/SQRT2.js");
+var _tau = require("./constants/tau.js");
+var _true = require("./constants/true.js");
+var _version = require("./constants/version.js");
+var _bignumber = require("./construction/bignumber.js");
+var _bigint = require("./construction/bigint.js");
+var _boolean = require("./construction/boolean.js");
+var _complex = require("./construction/complex.js");
+var _createUnit = require("./construction/createUnit.js");
+var _fraction = require("./construction/fraction.js");
+var _index = require("./construction/index.js");
+var _matrix = require("./construction/matrix.js");
+var _number = require("./construction/number.js");
+var _sparse = require("./construction/sparse.js");
+var _splitUnit = require("./construction/splitUnit.js");
+var _string = require("./construction/string.js");
+var _unit = require("./construction/unit.js");
+var _config = require("./core/config.js");
+var _import = require("./core/import.js");
+var _typed = require("./core/typed.js");
+var _derivative = require("./function/algebra/derivative.js");
+var _leafCount = require("./function/algebra/leafCount.js");
+var _lsolve = require("./function/algebra/lsolve.js");
+var _lsolveAll = require("./function/algebra/lsolveAll.js");
+var _lup = require("./function/algebra/lup.js");
+var _lusolve = require("./function/algebra/lusolve.js");
+var _polynomialRoot = require("./function/algebra/polynomialRoot.js");
+var _qr = require("./function/algebra/qr.js");
+var _rationalize = require("./function/algebra/rationalize.js");
+var _resolve = require("./function/algebra/resolve.js");
+var _simplify = require("./function/algebra/simplify.js");
+var _simplifyConstant = require("./function/algebra/simplifyConstant.js");
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+var _slu = require("./function/algebra/slu.js");
+var _symbolicEqual = require("./function/algebra/symbolicEqual.js");
+var _usolve = require("./function/algebra/usolve.js");
+var _usolveAll = require("./function/algebra/usolveAll.js");
+var _abs = require("./function/arithmetic/abs.js");
+var _add = require("./function/arithmetic/add.js");
+var _cbrt = require("./function/arithmetic/cbrt.js");
+var _ceil = require("./function/arithmetic/ceil.js");
+var _cube = require("./function/arithmetic/cube.js");
+var _divide = require("./function/arithmetic/divide.js");
+var _dotDivide = require("./function/arithmetic/dotDivide.js");
+var _dotMultiply = require("./function/arithmetic/dotMultiply.js");
+var _dotPow = require("./function/arithmetic/dotPow.js");
+var _exp = require("./function/arithmetic/exp.js");
+var _expm = require("./function/arithmetic/expm.js");
+var _expm2 = require("./function/arithmetic/expm1.js");
+var _fix = require("./function/arithmetic/fix.js");
+var _floor = require("./function/arithmetic/floor.js");
+var _gcd = require("./function/arithmetic/gcd.js");
+var _hypot = require("./function/arithmetic/hypot.js");
+var _invmod = require("./function/arithmetic/invmod.js");
+var _lcm = require("./function/arithmetic/lcm.js");
+var _log = require("./function/arithmetic/log.js");
+var _log2 = require("./function/arithmetic/log10.js");
+var _log1p = require("./function/arithmetic/log1p.js");
+var _log3 = require("./function/arithmetic/log2.js");
+var _mod = require("./function/arithmetic/mod.js");
+var _multiply = require("./function/arithmetic/multiply.js");
+var _norm = require("./function/arithmetic/norm.js");
+var _nthRoot = require("./function/arithmetic/nthRoot.js");
+var _nthRoots = require("./function/arithmetic/nthRoots.js");
+var _pow = require("./function/arithmetic/pow.js");
+var _round = require("./function/arithmetic/round.js");
+var _sign = require("./function/arithmetic/sign.js");
+var _sqrt = require("./function/arithmetic/sqrt.js");
+var _sqrtm = require("./function/arithmetic/sqrtm.js");
+var _sylvester = require("./function/algebra/sylvester.js");
+var _schur = require("./function/algebra/schur.js");
+var _lyap = require("./function/algebra/lyap.js");
+var _square = require("./function/arithmetic/square.js");
+var _subtract = require("./function/arithmetic/subtract.js");
+var _unaryMinus = require("./function/arithmetic/unaryMinus.js");
+var _unaryPlus = require("./function/arithmetic/unaryPlus.js");
+var _xgcd = require("./function/arithmetic/xgcd.js");
+var _bitAnd = require("./function/bitwise/bitAnd.js");
+var _bitNot = require("./function/bitwise/bitNot.js");
+var _bitOr = require("./function/bitwise/bitOr.js");
+var _bitXor = require("./function/bitwise/bitXor.js");
+var _leftShift = require("./function/bitwise/leftShift.js");
+var _rightArithShift = require("./function/bitwise/rightArithShift.js");
+var _rightLogShift = require("./function/bitwise/rightLogShift.js");
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+var _catalan = require("./function/combinatorics/catalan.js");
+var _composition = require("./function/combinatorics/composition.js");
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+var _arg = require("./function/complex/arg.js");
+var _conj = require("./function/complex/conj.js");
+var _im = require("./function/complex/im.js");
+var _re = require("./function/complex/re.js");
+var _evaluate = require("./function/expression/evaluate.js");
+var _parser = require("./function/expression/parser.js");
+var _parse = require("./function/expression/parse.js");
+var _compile = require("./function/expression/compile.js");
+var _help = require("./function/expression/help.js");
+var _distance = require("./function/geometry/distance.js");
+var _intersect = require("./function/geometry/intersect.js");
+var _and = require("./function/logical/and.js");
+var _not = require("./function/logical/not.js");
+var _nullish = require("./function/logical/nullish.js");
+var _or = require("./function/logical/or.js");
+var _xor = require("./function/logical/xor.js");
+var _mapSlices = require("./function/matrix/mapSlices.js");
+var _column = require("./function/matrix/column.js");
+var _concat = require("./function/matrix/concat.js");
+var _count = require("./function/matrix/count.js");
+var _cross = require("./function/matrix/cross.js");
+var _ctranspose = require("./function/matrix/ctranspose.js");
+var _det = require("./function/matrix/det.js");
+var _diag = require("./function/matrix/diag.js");
+var _diff = require("./function/matrix/diff.js");
+var _dot = require("./function/matrix/dot.js");
+var _eigs = require("./function/matrix/eigs.js");
+var _filter = require("./function/matrix/filter.js");
+var _flatten = require("./function/matrix/flatten.js");
+var _forEach = require("./function/matrix/forEach.js");
+var _getMatrixDataType = require("./function/matrix/getMatrixDataType.js");
+var _identity = require("./function/matrix/identity.js");
+var _inv = require("./function/matrix/inv.js");
+var _pinv = require("./function/matrix/pinv.js");
+var _kron = require("./function/matrix/kron.js");
+var _map = require("./function/matrix/map.js");
+var _matrixFromColumns = require("./function/matrix/matrixFromColumns.js");
+var _matrixFromFunction = require("./function/matrix/matrixFromFunction.js");
+var _matrixFromRows = require("./function/matrix/matrixFromRows.js");
+var _ones = require("./function/matrix/ones.js");
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+var _range = require("./function/matrix/range.js");
+var _reshape = require("./function/matrix/reshape.js");
+var _resize = require("./function/matrix/resize.js");
+var _rotate = require("./function/matrix/rotate.js");
+var _rotationMatrix = require("./function/matrix/rotationMatrix.js");
+var _row = require("./function/matrix/row.js");
+var _size = require("./function/matrix/size.js");
+var _sort = require("./function/matrix/sort.js");
+var _squeeze = require("./function/matrix/squeeze.js");
+var _subset = require("./function/matrix/subset.js");
+var _trace = require("./function/matrix/trace.js");
+var _transpose = require("./function/matrix/transpose.js");
+var _zeros = require("./function/matrix/zeros.js");
+var _fft = require("./function/matrix/fft.js");
+var _ifft = require("./function/matrix/ifft.js");
+var _combinations = require("./function/probability/combinations.js");
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+var _factorial = require("./function/probability/factorial.js");
+var _gamma = require("./function/probability/gamma.js");
+var _lgamma = require("./function/probability/lgamma.js");
+var _kldivergence = require("./function/probability/kldivergence.js");
+var _multinomial = require("./function/probability/multinomial.js");
+var _permutations = require("./function/probability/permutations.js");
+var _pickRandom = require("./function/probability/pickRandom.js");
+var _random = require("./function/probability/random.js");
+var _randomInt = require("./function/probability/randomInt.js");
+var _compare = require("./function/relational/compare.js");
+var _compareNatural = require("./function/relational/compareNatural.js");
+var _compareText = require("./function/relational/compareText.js");
+var _deepEqual = require("./function/relational/deepEqual.js");
+var _equal = require("./function/relational/equal.js");
+var _equalText = require("./function/relational/equalText.js");
+var _larger = require("./function/relational/larger.js");
+var _largerEq = require("./function/relational/largerEq.js");
+var _smaller = require("./function/relational/smaller.js");
+var _smallerEq = require("./function/relational/smallerEq.js");
+var _unequal = require("./function/relational/unequal.js");
+var _setCartesian = require("./function/set/setCartesian.js");
+var _setDifference = require("./function/set/setDifference.js");
+var _setDistinct = require("./function/set/setDistinct.js");
+var _setIntersect = require("./function/set/setIntersect.js");
+var _setIsSubset = require("./function/set/setIsSubset.js");
+var _setMultiplicity = require("./function/set/setMultiplicity.js");
+var _setPowerset = require("./function/set/setPowerset.js");
+var _setSize = require("./function/set/setSize.js");
+var _setSymDifference = require("./function/set/setSymDifference.js");
+var _setUnion = require("./function/set/setUnion.js");
+var _zpk2tf = require("./function/signal/zpk2tf.js");
+var _freqz = require("./function/signal/freqz.js");
+var _erf = require("./function/special/erf.js");
+var _zeta = require("./function/special/zeta.js");
+var _mad = require("./function/statistics/mad.js");
+var _max = require("./function/statistics/max.js");
+var _mean = require("./function/statistics/mean.js");
+var _median = require("./function/statistics/median.js");
+var _min = require("./function/statistics/min.js");
+var _mode = require("./function/statistics/mode.js");
+var _prod = require("./function/statistics/prod.js");
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+var _std = require("./function/statistics/std.js");
+var _cumsum = require("./function/statistics/cumsum.js");
+var _sum = require("./function/statistics/sum.js");
+var _variance = require("./function/statistics/variance.js");
+var _corr = require("./function/statistics/corr.js");
+var _acos = require("./function/trigonometry/acos.js");
+var _acosh = require("./function/trigonometry/acosh.js");
+var _acot = require("./function/trigonometry/acot.js");
+var _acoth = require("./function/trigonometry/acoth.js");
+var _acsc = require("./function/trigonometry/acsc.js");
+var _acsch = require("./function/trigonometry/acsch.js");
+var _asec = require("./function/trigonometry/asec.js");
+var _asech = require("./function/trigonometry/asech.js");
+var _asin = require("./function/trigonometry/asin.js");
+var _asinh = require("./function/trigonometry/asinh.js");
+var _atan = require("./function/trigonometry/atan.js");
+var _atan2 = require("./function/trigonometry/atan2.js");
+var _atanh = require("./function/trigonometry/atanh.js");
+var _cos = require("./function/trigonometry/cos.js");
+var _cosh = require("./function/trigonometry/cosh.js");
+var _cot = require("./function/trigonometry/cot.js");
+var _coth = require("./function/trigonometry/coth.js");
+var _csc = require("./function/trigonometry/csc.js");
+var _csch = require("./function/trigonometry/csch.js");
+var _sec = require("./function/trigonometry/sec.js");
+var _sech = require("./function/trigonometry/sech.js");
+var _sin = require("./function/trigonometry/sin.js");
+var _sinh = require("./function/trigonometry/sinh.js");
+var _tan = require("./function/trigonometry/tan.js");
+var _tanh = require("./function/trigonometry/tanh.js");
+var _to = require("./function/units/to.js");
+var _toBest = require("./function/units/toBest.js");
+var _bin = require("./function/utils/bin.js");
+var _clone = require("./function/utils/clone.js");
+var _format = require("./function/utils/format.js");
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+var _hex = require("./function/utils/hex.js");
+var _isInteger = require("./function/utils/isInteger.js");
+var _isNaN = require("./function/utils/isNaN.js");
+var _isNegative = require("./function/utils/isNegative.js");
+var _isNumeric = require("./function/utils/isNumeric.js");
+var _isPositive = require("./function/utils/isPositive.js");
+var _isPrime = require("./function/utils/isPrime.js");
+var _isZero = require("./function/utils/isZero.js");
+var _numeric = require("./function/utils/numeric.js");
+var _oct = require("./function/utils/oct.js");
+var _print = require("./function/utils/print.js");
+var _typeOf = require("./function/utils/typeOf.js");
+var _solveODE = require("./function/numeric/solveODE.js");
+const embeddedDocs = exports.embeddedDocs = {
+  // construction functions
+  bignumber: _bignumber.bignumberDocs,
+  bigint: _bigint.bigintDocs,
+  boolean: _boolean.booleanDocs,
+  complex: _complex.complexDocs,
+  createUnit: _createUnit.createUnitDocs,
+  fraction: _fraction.fractionDocs,
+  index: _index.indexDocs,
+  matrix: _matrix.matrixDocs,
+  number: _number.numberDocs,
+  sparse: _sparse.sparseDocs,
+  splitUnit: _splitUnit.splitUnitDocs,
+  string: _string.stringDocs,
+  unit: _unit.unitDocs,
+  // constants
+  e: _e.eDocs,
+  E: _e.eDocs,
+  false: _false.falseDocs,
+  i: _i.iDocs,
+  Infinity: _Infinity.InfinityDocs,
+  LN2: _LN2.LN2Docs,
+  LN10: _LN.LN10Docs,
+  LOG2E: _LOG2E.LOG2EDocs,
+  LOG10E: _LOG10E.LOG10EDocs,
+  NaN: _NaN.NaNDocs,
+  null: _null.nullDocs,
+  pi: _pi.piDocs,
+  PI: _pi.piDocs,
+  phi: _phi.phiDocs,
+  SQRT1_2: _SQRT1_.SQRT12Docs,
+  SQRT2: _SQRT.SQRT2Docs,
+  tau: _tau.tauDocs,
+  true: _true.trueDocs,
+  version: _version.versionDocs,
+  // physical constants
+  // TODO: more detailed docs for physical constants
+  speedOfLight: {
+    description: 'Speed of light in vacuum',
+    examples: ['speedOfLight']
+  },
+  gravitationConstant: {
+    description: 'Newtonian constant of gravitation',
+    examples: ['gravitationConstant']
+  },
+  planckConstant: {
+    description: 'Planck constant',
+    examples: ['planckConstant']
+  },
+  reducedPlanckConstant: {
+    description: 'Reduced Planck constant',
+    examples: ['reducedPlanckConstant']
+  },
+  magneticConstant: {
+    description: 'Magnetic constant (vacuum permeability)',
+    examples: ['magneticConstant']
+  },
+  electricConstant: {
+    description: 'Electric constant (vacuum permeability)',
+    examples: ['electricConstant']
+  },
+  vacuumImpedance: {
+    description: 'Characteristic impedance of vacuum',
+    examples: ['vacuumImpedance']
+  },
+  coulomb: {
+    description: 'Coulomb\'s constant. Deprecated in favor of coulombConstant',
+    examples: ['coulombConstant']
+  },
+  coulombConstant: {
+    description: 'Coulomb\'s constant',
+    examples: ['coulombConstant']
+  },
+  elementaryCharge: {
+    description: 'Elementary charge',
+    examples: ['elementaryCharge']
+  },
+  bohrMagneton: {
+    description: 'Bohr magneton',
+    examples: ['bohrMagneton']
+  },
+  conductanceQuantum: {
+    description: 'Conductance quantum',
+    examples: ['conductanceQuantum']
+  },
+  inverseConductanceQuantum: {
+    description: 'Inverse conductance quantum',
+    examples: ['inverseConductanceQuantum']
+  },
+  // josephson: {description: 'Josephson constant', examples: ['josephson']},
+  magneticFluxQuantum: {
+    description: 'Magnetic flux quantum',
+    examples: ['magneticFluxQuantum']
+  },
+  nuclearMagneton: {
+    description: 'Nuclear magneton',
+    examples: ['nuclearMagneton']
+  },
+  klitzing: {
+    description: 'Von Klitzing constant',
+    examples: ['klitzing']
+  },
+  bohrRadius: {
+    description: 'Bohr radius',
+    examples: ['bohrRadius']
+  },
+  classicalElectronRadius: {
+    description: 'Classical electron radius',
+    examples: ['classicalElectronRadius']
+  },
+  electronMass: {
+    description: 'Electron mass',
+    examples: ['electronMass']
+  },
+  fermiCoupling: {
+    description: 'Fermi coupling constant',
+    examples: ['fermiCoupling']
+  },
+  fineStructure: {
+    description: 'Fine-structure constant',
+    examples: ['fineStructure']
+  },
+  hartreeEnergy: {
+    description: 'Hartree energy',
+    examples: ['hartreeEnergy']
+  },
+  protonMass: {
+    description: 'Proton mass',
+    examples: ['protonMass']
+  },
+  deuteronMass: {
+    description: 'Deuteron Mass',
+    examples: ['deuteronMass']
+  },
+  neutronMass: {
+    description: 'Neutron mass',
+    examples: ['neutronMass']
+  },
+  quantumOfCirculation: {
+    description: 'Quantum of circulation',
+    examples: ['quantumOfCirculation']
+  },
+  rydberg: {
+    description: 'Rydberg constant',
+    examples: ['rydberg']
+  },
+  thomsonCrossSection: {
+    description: 'Thomson cross section',
+    examples: ['thomsonCrossSection']
+  },
+  weakMixingAngle: {
+    description: 'Weak mixing angle',
+    examples: ['weakMixingAngle']
+  },
+  efimovFactor: {
+    description: 'Efimov factor',
+    examples: ['efimovFactor']
+  },
+  atomicMass: {
+    description: 'Atomic mass constant',
+    examples: ['atomicMass']
+  },
+  avogadro: {
+    description: 'Avogadro\'s number',
+    examples: ['avogadro']
+  },
+  boltzmann: {
+    description: 'Boltzmann constant',
+    examples: ['boltzmann']
+  },
+  faraday: {
+    description: 'Faraday constant',
+    examples: ['faraday']
+  },
+  firstRadiation: {
+    description: 'First radiation constant',
+    examples: ['firstRadiation']
+  },
+  loschmidt: {
+    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',
+    examples: ['loschmidt']
+  },
+  gasConstant: {
+    description: 'Gas constant',
+    examples: ['gasConstant']
+  },
+  molarPlanckConstant: {
+    description: 'Molar Planck constant',
+    examples: ['molarPlanckConstant']
+  },
+  molarVolume: {
+    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',
+    examples: ['molarVolume']
+  },
+  sackurTetrode: {
+    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',
+    examples: ['sackurTetrode']
+  },
+  secondRadiation: {
+    description: 'Second radiation constant',
+    examples: ['secondRadiation']
+  },
+  stefanBoltzmann: {
+    description: 'Stefan-Boltzmann constant',
+    examples: ['stefanBoltzmann']
+  },
+  wienDisplacement: {
+    description: 'Wien displacement law constant',
+    examples: ['wienDisplacement']
+  },
+  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},
+
+  molarMass: {
+    description: 'Molar mass constant',
+    examples: ['molarMass']
+  },
+  molarMassC12: {
+    description: 'Molar mass constant of carbon-12',
+    examples: ['molarMassC12']
+  },
+  gravity: {
+    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',
+    examples: ['gravity']
+  },
+  planckLength: {
+    description: 'Planck length',
+    examples: ['planckLength']
+  },
+  planckMass: {
+    description: 'Planck mass',
+    examples: ['planckMass']
+  },
+  planckTime: {
+    description: 'Planck time',
+    examples: ['planckTime']
+  },
+  planckCharge: {
+    description: 'Planck charge',
+    examples: ['planckCharge']
+  },
+  planckTemperature: {
+    description: 'Planck temperature',
+    examples: ['planckTemperature']
+  },
+  // functions - algebra
+  derivative: _derivative.derivativeDocs,
+  lsolve: _lsolve.lsolveDocs,
+  lsolveAll: _lsolveAll.lsolveAllDocs,
+  lup: _lup.lupDocs,
+  lusolve: _lusolve.lusolveDocs,
+  leafCount: _leafCount.leafCountDocs,
+  polynomialRoot: _polynomialRoot.polynomialRootDocs,
+  resolve: _resolve.resolveDocs,
+  simplify: _simplify.simplifyDocs,
+  simplifyConstant: _simplifyConstant.simplifyConstantDocs,
+  simplifyCore: _simplifyCore.simplifyCoreDocs,
+  symbolicEqual: _symbolicEqual.symbolicEqualDocs,
+  rationalize: _rationalize.rationalizeDocs,
+  slu: _slu.sluDocs,
+  usolve: _usolve.usolveDocs,
+  usolveAll: _usolveAll.usolveAllDocs,
+  qr: _qr.qrDocs,
+  // functions - arithmetic
+  abs: _abs.absDocs,
+  add: _add.addDocs,
+  cbrt: _cbrt.cbrtDocs,
+  ceil: _ceil.ceilDocs,
+  cube: _cube.cubeDocs,
+  divide: _divide.divideDocs,
+  dotDivide: _dotDivide.dotDivideDocs,
+  dotMultiply: _dotMultiply.dotMultiplyDocs,
+  dotPow: _dotPow.dotPowDocs,
+  exp: _exp.expDocs,
+  expm: _expm.expmDocs,
+  expm1: _expm2.expm1Docs,
+  fix: _fix.fixDocs,
+  floor: _floor.floorDocs,
+  gcd: _gcd.gcdDocs,
+  hypot: _hypot.hypotDocs,
+  lcm: _lcm.lcmDocs,
+  log: _log.logDocs,
+  log2: _log3.log2Docs,
+  log1p: _log1p.log1pDocs,
+  log10: _log2.log10Docs,
+  mod: _mod.modDocs,
+  multiply: _multiply.multiplyDocs,
+  norm: _norm.normDocs,
+  nthRoot: _nthRoot.nthRootDocs,
+  nthRoots: _nthRoots.nthRootsDocs,
+  pow: _pow.powDocs,
+  round: _round.roundDocs,
+  sign: _sign.signDocs,
+  sqrt: _sqrt.sqrtDocs,
+  sqrtm: _sqrtm.sqrtmDocs,
+  square: _square.squareDocs,
+  subtract: _subtract.subtractDocs,
+  unaryMinus: _unaryMinus.unaryMinusDocs,
+  unaryPlus: _unaryPlus.unaryPlusDocs,
+  xgcd: _xgcd.xgcdDocs,
+  invmod: _invmod.invmodDocs,
+  // functions - bitwise
+  bitAnd: _bitAnd.bitAndDocs,
+  bitNot: _bitNot.bitNotDocs,
+  bitOr: _bitOr.bitOrDocs,
+  bitXor: _bitXor.bitXorDocs,
+  leftShift: _leftShift.leftShiftDocs,
+  rightArithShift: _rightArithShift.rightArithShiftDocs,
+  rightLogShift: _rightLogShift.rightLogShiftDocs,
+  // functions - combinatorics
+  bellNumbers: _bellNumbers.bellNumbersDocs,
+  catalan: _catalan.catalanDocs,
+  composition: _composition.compositionDocs,
+  stirlingS2: _stirlingS.stirlingS2Docs,
+  // functions - core
+  config: _config.configDocs,
+  import: _import.importDocs,
+  typed: _typed.typedDocs,
+  // functions - complex
+  arg: _arg.argDocs,
+  conj: _conj.conjDocs,
+  re: _re.reDocs,
+  im: _im.imDocs,
+  // functions - expression
+  evaluate: _evaluate.evaluateDocs,
+  help: _help.helpDocs,
+  parse: _parse.parseDocs,
+  parser: _parser.parserDocs,
+  compile: _compile.compileDocs,
+  // functions - geometry
+  distance: _distance.distanceDocs,
+  intersect: _intersect.intersectDocs,
+  // functions - logical
+  and: _and.andDocs,
+  not: _not.notDocs,
+  nullish: _nullish.nullishDocs,
+  or: _or.orDocs,
+  xor: _xor.xorDocs,
+  // functions - matrix
+  mapSlices: _mapSlices.mapSlicesDocs,
+  concat: _concat.concatDocs,
+  count: _count.countDocs,
+  cross: _cross.crossDocs,
+  column: _column.columnDocs,
+  ctranspose: _ctranspose.ctransposeDocs,
+  det: _det.detDocs,
+  diag: _diag.diagDocs,
+  diff: _diff.diffDocs,
+  dot: _dot.dotDocs,
+  getMatrixDataType: _getMatrixDataType.getMatrixDataTypeDocs,
+  identity: _identity.identityDocs,
+  filter: _filter.filterDocs,
+  flatten: _flatten.flattenDocs,
+  forEach: _forEach.forEachDocs,
+  inv: _inv.invDocs,
+  pinv: _pinv.pinvDocs,
+  eigs: _eigs.eigsDocs,
+  kron: _kron.kronDocs,
+  matrixFromFunction: _matrixFromFunction.matrixFromFunctionDocs,
+  matrixFromRows: _matrixFromRows.matrixFromRowsDocs,
+  matrixFromColumns: _matrixFromColumns.matrixFromColumnsDocs,
+  map: _map.mapDocs,
+  ones: _ones.onesDocs,
+  partitionSelect: _partitionSelect.partitionSelectDocs,
+  range: _range.rangeDocs,
+  resize: _resize.resizeDocs,
+  reshape: _reshape.reshapeDocs,
+  rotate: _rotate.rotateDocs,
+  rotationMatrix: _rotationMatrix.rotationMatrixDocs,
+  row: _row.rowDocs,
+  size: _size.sizeDocs,
+  sort: _sort.sortDocs,
+  squeeze: _squeeze.squeezeDocs,
+  subset: _subset.subsetDocs,
+  trace: _trace.traceDocs,
+  transpose: _transpose.transposeDocs,
+  zeros: _zeros.zerosDocs,
+  fft: _fft.fftDocs,
+  ifft: _ifft.ifftDocs,
+  sylvester: _sylvester.sylvesterDocs,
+  schur: _schur.schurDocs,
+  lyap: _lyap.lyapDocs,
+  // functions - numeric
+  solveODE: _solveODE.solveODEDocs,
+  // functions - probability
+  combinations: _combinations.combinationsDocs,
+  combinationsWithRep: _combinationsWithRep.combinationsWithRepDocs,
+  // distribution: distributionDocs,
+  factorial: _factorial.factorialDocs,
+  gamma: _gamma.gammaDocs,
+  kldivergence: _kldivergence.kldivergenceDocs,
+  lgamma: _lgamma.lgammaDocs,
+  multinomial: _multinomial.multinomialDocs,
+  permutations: _permutations.permutationsDocs,
+  pickRandom: _pickRandom.pickRandomDocs,
+  random: _random.randomDocs,
+  randomInt: _randomInt.randomIntDocs,
+  // functions - relational
+  compare: _compare.compareDocs,
+  compareNatural: _compareNatural.compareNaturalDocs,
+  compareText: _compareText.compareTextDocs,
+  deepEqual: _deepEqual.deepEqualDocs,
+  equal: _equal.equalDocs,
+  equalText: _equalText.equalTextDocs,
+  larger: _larger.largerDocs,
+  largerEq: _largerEq.largerEqDocs,
+  smaller: _smaller.smallerDocs,
+  smallerEq: _smallerEq.smallerEqDocs,
+  unequal: _unequal.unequalDocs,
+  // functions - set
+  setCartesian: _setCartesian.setCartesianDocs,
+  setDifference: _setDifference.setDifferenceDocs,
+  setDistinct: _setDistinct.setDistinctDocs,
+  setIntersect: _setIntersect.setIntersectDocs,
+  setIsSubset: _setIsSubset.setIsSubsetDocs,
+  setMultiplicity: _setMultiplicity.setMultiplicityDocs,
+  setPowerset: _setPowerset.setPowersetDocs,
+  setSize: _setSize.setSizeDocs,
+  setSymDifference: _setSymDifference.setSymDifferenceDocs,
+  setUnion: _setUnion.setUnionDocs,
+  // functions - signal
+  zpk2tf: _zpk2tf.zpk2tfDocs,
+  freqz: _freqz.freqzDocs,
+  // functions - special
+  erf: _erf.erfDocs,
+  zeta: _zeta.zetaDocs,
+  // functions - statistics
+  cumsum: _cumsum.cumSumDocs,
+  mad: _mad.madDocs,
+  max: _max.maxDocs,
+  mean: _mean.meanDocs,
+  median: _median.medianDocs,
+  min: _min.minDocs,
+  mode: _mode.modeDocs,
+  prod: _prod.prodDocs,
+  quantileSeq: _quantileSeq.quantileSeqDocs,
+  std: _std.stdDocs,
+  sum: _sum.sumDocs,
+  variance: _variance.varianceDocs,
+  corr: _corr.corrDocs,
+  // functions - trigonometry
+  acos: _acos.acosDocs,
+  acosh: _acosh.acoshDocs,
+  acot: _acot.acotDocs,
+  acoth: _acoth.acothDocs,
+  acsc: _acsc.acscDocs,
+  acsch: _acsch.acschDocs,
+  asec: _asec.asecDocs,
+  asech: _asech.asechDocs,
+  asin: _asin.asinDocs,
+  asinh: _asinh.asinhDocs,
+  atan: _atan.atanDocs,
+  atanh: _atanh.atanhDocs,
+  atan2: _atan2.atan2Docs,
+  cos: _cos.cosDocs,
+  cosh: _cosh.coshDocs,
+  cot: _cot.cotDocs,
+  coth: _coth.cothDocs,
+  csc: _csc.cscDocs,
+  csch: _csch.cschDocs,
+  sec: _sec.secDocs,
+  sech: _sech.sechDocs,
+  sin: _sin.sinDocs,
+  sinh: _sinh.sinhDocs,
+  tan: _tan.tanDocs,
+  tanh: _tanh.tanhDocs,
+  // functions - units
+  to: _to.toDocs,
+  toBest: _toBest.toBestDocs,
+  // functions - utils
+  clone: _clone.cloneDocs,
+  format: _format.formatDocs,
+  bin: _bin.binDocs,
+  oct: _oct.octDocs,
+  hex: _hex.hexDocs,
+  isNaN: _isNaN.isNaNDocs,
+  isInteger: _isInteger.isIntegerDocs,
+  isNegative: _isNegative.isNegativeDocs,
+  isNumeric: _isNumeric.isNumericDocs,
+  hasNumericValue: _hasNumericValue.hasNumericValueDocs,
+  isPositive: _isPositive.isPositiveDocs,
+  isPrime: _isPrime.isPrimeDocs,
+  isZero: _isZero.isZeroDocs,
+  print: _print.printDocs,
+  typeOf: _typeOf.typeOfDocs,
+  numeric: _numeric.numericDocs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js
new file mode 100644
index 0000000..e986679
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/derivative.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.derivativeDocs = void 0;
+const derivativeDocs = exports.derivativeDocs = {
+  name: 'derivative',
+  category: 'Algebra',
+  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],
+  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',
+  examples: ['derivative("2x^3", "x")', 'derivative("2x^3", "x", {simplify: false})', 'derivative("2x^2 + 3x + 4", "x")', 'derivative("sin(2x)", "x")', 'f = parse("x^2 + x")', 'x = parse("x")', 'df = derivative(f, x)', 'df.evaluate({x: 3})'],
+  seealso: ['simplify', 'parse', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js
new file mode 100644
index 0000000..93447eb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/leafCount.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leafCountDocs = void 0;
+const leafCountDocs = exports.leafCountDocs = {
+  name: 'leafCount',
+  category: 'Algebra',
+  syntax: ['leafCount(expr)'],
+  description: 'Computes the number of leaves in the parse tree of the given expression',
+  examples: ['leafCount("e^(i*pi)-1")', 'leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js
new file mode 100644
index 0000000..0cf5b71
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolve.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveDocs = void 0;
+const lsolveDocs = exports.lsolveDocs = {
+  name: 'lsolve',
+  category: 'Algebra',
+  syntax: ['x=lsolve(L, b)'],
+  description: 'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js
new file mode 100644
index 0000000..4472408
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lsolveAll.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lsolveAllDocs = void 0;
+const lsolveAllDocs = exports.lsolveAllDocs = {
+  name: 'lsolveAll',
+  category: 'Algebra',
+  syntax: ['x=lsolveAll(L, b)'],
+  description: 'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js
new file mode 100644
index 0000000..4d7030d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lup.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lupDocs = void 0;
+const lupDocs = exports.lupDocs = {
+  name: 'lup',
+  category: 'Algebra',
+  syntax: ['lup(m)'],
+  description: 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',
+  examples: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js
new file mode 100644
index 0000000..7f17520
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lusolve.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lusolveDocs = void 0;
+const lusolveDocs = exports.lusolveDocs = {
+  name: 'lusolve',
+  category: 'Algebra',
+  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],
+  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],
+  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lyap.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lyap.js
new file mode 100644
index 0000000..1c894ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/lyap.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lyapDocs = void 0;
+const lyapDocs = exports.lyapDocs = {
+  name: 'lyap',
+  category: 'Algebra',
+  syntax: ['lyap(A,Q)'],
+  description: 'Solves the Continuous-time Lyapunov equation AP+PA\'+Q=0 for P',
+  examples: ['lyap([[-2, 0], [1, -4]], [[3, 1], [1, 3]])', 'A = [[-2, 0], [1, -4]]', 'Q = [[3, 1], [1, 3]]', 'lyap(A,Q)'],
+  seealso: ['schur', 'sylvester']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/polynomialRoot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/polynomialRoot.js
new file mode 100644
index 0000000..c329c4b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/polynomialRoot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.polynomialRootDocs = void 0;
+const polynomialRootDocs = exports.polynomialRootDocs = {
+  name: 'polynomialRoot',
+  category: 'Algebra',
+  syntax: ['x=polynomialRoot(-6, 3)', 'x=polynomialRoot(4, -4, 1)', 'x=polynomialRoot(-8, 12, -6, 1)'],
+  description: 'Finds the roots of a univariate polynomial given by its coefficients starting from constant, linear, and so on, increasing in degree.',
+  examples: ['a = polynomialRoot(-6, 11, -6, 1)'],
+  seealso: ['cbrt', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js
new file mode 100644
index 0000000..ea02732
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/qr.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.qrDocs = void 0;
+const qrDocs = exports.qrDocs = {
+  name: 'qr',
+  category: 'Algebra',
+  syntax: ['qr(A)'],
+  description: 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',
+  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],
+  seealso: ['lup', 'slu', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js
new file mode 100644
index 0000000..d449ce2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/rationalize.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rationalizeDocs = void 0;
+const rationalizeDocs = exports.rationalizeDocs = {
+  name: 'rationalize',
+  category: 'Algebra',
+  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],
+  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',
+  examples: ['rationalize("2x/y - y/(x+1)")', 'rationalize("2x/y - y/(x+1)", true)'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js
new file mode 100644
index 0000000..58eeb4d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/resolve.js
@@ -0,0 +1,15 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resolveDocs = void 0;
+const resolveDocs = exports.resolveDocs = {
+  name: 'resolve',
+  category: 'Algebra',
+  syntax: ['resolve(node, scope)'],
+  description: 'Recursively substitute variables in an expression tree.',
+  examples: ['resolve(parse("1 + x"), { x: 7 })', 'resolve(parse("size(text)"), { text: "Hello World" })', 'resolve(parse("x + y"), { x: parse("3z") })', 'resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],
+  seealso: ['simplify', 'evaluate'],
+  mayThrow: ['ReferenceError']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/schur.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/schur.js
new file mode 100644
index 0000000..1fd2f34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/schur.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.schurDocs = void 0;
+const schurDocs = exports.schurDocs = {
+  name: 'schur',
+  category: 'Algebra',
+  syntax: ['schur(A)'],
+  description: 'Performs a real Schur decomposition of the real matrix A = UTU\'',
+  examples: ['schur([[1, 0], [-4, 3]])', 'A = [[1, 0], [-4, 3]]', 'schur(A)'],
+  seealso: ['lyap', 'sylvester']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js
new file mode 100644
index 0000000..385e7e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplify.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyDocs = void 0;
+const simplifyDocs = exports.simplifyDocs = {
+  name: 'simplify',
+  category: 'Algebra',
+  syntax: ['simplify(expr)', 'simplify(expr, rules)'],
+  description: 'Simplify an expression tree.',
+  examples: ['simplify("3 + 2 / 4")', 'simplify("2x + x")', 'f = parse("x * (x + 2 + x)")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],
+  seealso: ['simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyConstant.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyConstant.js
new file mode 100644
index 0000000..b23cdfc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyConstant.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyConstantDocs = void 0;
+const simplifyConstantDocs = exports.simplifyConstantDocs = {
+  name: 'simplifyConstant',
+  category: 'Algebra',
+  syntax: ['simplifyConstant(expr)', 'simplifyConstant(expr, options)'],
+  description: 'Replace constant subexpressions of node with their values.',
+  examples: ['simplifyConstant("(3-3)*x")', 'simplifyConstant(parse("z-cos(tau/8)"))'],
+  seealso: ['simplify', 'simplifyCore', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..01ebc74
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/simplifyCore.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.simplifyCoreDocs = void 0;
+const simplifyCoreDocs = exports.simplifyCoreDocs = {
+  name: 'simplifyCore',
+  category: 'Algebra',
+  syntax: ['simplifyCore(node)'],
+  description: 'Perform simple one-pass simplifications on an expression tree.',
+  examples: ['simplifyCore(parse("0*x"))', 'simplifyCore(parse("(x+0)*2"))'],
+  seealso: ['simplify', 'simplifyConstant', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js
new file mode 100644
index 0000000..1403e16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/slu.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sluDocs = void 0;
+const sluDocs = exports.sluDocs = {
+  name: 'slu',
+  category: 'Algebra',
+  syntax: ['slu(A, order, threshold)'],
+  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',
+  examples: ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/sylvester.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/sylvester.js
new file mode 100644
index 0000000..d124f2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/sylvester.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sylvesterDocs = void 0;
+const sylvesterDocs = exports.sylvesterDocs = {
+  name: 'sylvester',
+  category: 'Algebra',
+  syntax: ['sylvester(A,B,C)'],
+  description: 'Solves the real-valued Sylvester equation AX+XB=C for X',
+  examples: ['sylvester([[-1, -2], [1, 1]], [[-2, 1], [-1, 2]], [[-3, 2], [3, 0]])', 'A = [[-1, -2], [1, 1]]; B = [[2, -1], [1, -2]]; C = [[-3, 2], [3, 0]]', 'sylvester(A, B, C)'],
+  seealso: ['schur', 'lyap']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..cdd4c49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/symbolicEqual.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.symbolicEqualDocs = void 0;
+const symbolicEqualDocs = exports.symbolicEqualDocs = {
+  name: 'symbolicEqual',
+  category: 'Algebra',
+  syntax: ['symbolicEqual(expr1, expr2)', 'symbolicEqual(expr1, expr2, options)'],
+  description: 'Returns true if the difference of the expressions simplifies to 0',
+  examples: ['symbolicEqual("x*y","y*x")', 'symbolicEqual("abs(x^2)", "x^2")', 'symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],
+  seealso: ['simplify', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js
new file mode 100644
index 0000000..b0bcb2b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolve.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveDocs = void 0;
+const usolveDocs = exports.usolveDocs = {
+  name: 'usolve',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js
new file mode 100644
index 0000000..8c2af3c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/algebra/usolveAll.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.usolveAllDocs = void 0;
+const usolveAllDocs = exports.usolveAllDocs = {
+  name: 'usolveAll',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js
new file mode 100644
index 0000000..d12f229
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/abs.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absDocs = void 0;
+const absDocs = exports.absDocs = {
+  name: 'abs',
+  category: 'Arithmetic',
+  syntax: ['abs(x)'],
+  description: 'Compute the absolute value.',
+  examples: ['abs(3.5)', 'abs(-4.2)'],
+  seealso: ['sign']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js
new file mode 100644
index 0000000..a35fdec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/add.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.addDocs = void 0;
+const addDocs = exports.addDocs = {
+  name: 'add',
+  category: 'Operators',
+  syntax: ['x + y', 'add(x, y)'],
+  description: 'Add two values.',
+  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '"2.3" + "4"'],
+  seealso: ['subtract']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..c16f047
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cbrt.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrtDocs = void 0;
+const cbrtDocs = exports.cbrtDocs = {
+  name: 'cbrt',
+  category: 'Arithmetic',
+  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],
+  description: 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',
+  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],
+  seealso: ['square', 'sqrt', 'cube', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..030e205
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/ceil.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ceilDocs = void 0;
+const ceilDocs = exports.ceilDocs = {
+  name: 'ceil',
+  category: 'Arithmetic',
+  syntax: ['ceil(x)', 'ceil(x, n)', 'ceil(unit, valuelessUnit)', 'ceil(unit, n, valuelessUnit)'],
+  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',
+  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)', 'ceil(3.241cm, cm)', 'ceil(3.241cm, 2, cm)'],
+  seealso: ['floor', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js
new file mode 100644
index 0000000..e81dfb8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/cube.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cubeDocs = void 0;
+const cubeDocs = exports.cubeDocs = {
+  name: 'cube',
+  category: 'Arithmetic',
+  syntax: ['cube(x)'],
+  description: 'Compute the cube of a value. The cube of x is x * x * x.',
+  examples: ['cube(2)', '2^3', '2 * 2 * 2'],
+  seealso: ['multiply', 'square', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js
new file mode 100644
index 0000000..97699d4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/divide.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.divideDocs = void 0;
+const divideDocs = exports.divideDocs = {
+  name: 'divide',
+  category: 'Operators',
+  syntax: ['x / y', 'divide(x, y)'],
+  description: 'Divide two values.',
+  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],
+  seealso: ['multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..4dd03d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotDivide.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDivideDocs = void 0;
+const dotDivideDocs = exports.dotDivideDocs = {
+  name: 'dotDivide',
+  category: 'Operators',
+  syntax: ['x ./ y', 'dotDivide(x, y)'],
+  description: 'Divide two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],
+  seealso: ['multiply', 'dotMultiply', 'divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..efa679e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotMultiplyDocs = void 0;
+const dotMultiplyDocs = exports.dotMultiplyDocs = {
+  name: 'dotMultiply',
+  category: 'Operators',
+  syntax: ['x .* y', 'dotMultiply(x, y)'],
+  description: 'Multiply two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],
+  seealso: ['multiply', 'divide', 'dotDivide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..cf9310d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/dotPow.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotPowDocs = void 0;
+const dotPowDocs = exports.dotPowDocs = {
+  name: 'dotPow',
+  category: 'Operators',
+  syntax: ['x .^ y', 'dotPow(x, y)'],
+  description: 'Calculates the power of x to y element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],
+  seealso: ['pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js
new file mode 100644
index 0000000..560d1d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/exp.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expDocs = void 0;
+const expDocs = exports.expDocs = {
+  name: 'exp',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Calculate the exponent of a value.',
+  examples: ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x))   # Euler\'s formula'],
+  seealso: ['expm', 'expm1', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js
new file mode 100644
index 0000000..e1d0279
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expmDocs = void 0;
+const expmDocs = exports.expmDocs = {
+  name: 'expm',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',
+  examples: ['expm([[0,2],[0,0]])'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..dc95343
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/expm1.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.expm1Docs = void 0;
+const expm1Docs = exports.expm1Docs = {
+  name: 'expm1',
+  category: 'Arithmetic',
+  syntax: ['expm1(x)'],
+  description: 'Calculate the value of subtracting 1 from the exponential value.',
+  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],
+  seealso: ['exp', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js
new file mode 100644
index 0000000..5030007
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/fix.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fixDocs = void 0;
+const fixDocs = exports.fixDocs = {
+  name: 'fix',
+  category: 'Arithmetic',
+  syntax: ['fix(x)', 'fix(x, n)', 'fix(unit, valuelessUnit)', 'fix(unit, n, valuelessUnit)'],
+  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',
+  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)', 'fix(3.241cm, cm)', 'fix(3.241cm, 2, cm)'],
+  seealso: ['ceil', 'floor', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js
new file mode 100644
index 0000000..3db6b6c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/floor.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.floorDocs = void 0;
+const floorDocs = exports.floorDocs = {
+  name: 'floor',
+  category: 'Arithmetic',
+  syntax: ['floor(x)', 'floor(x, n)', 'floor(unit, valuelessUnit)', 'floor(unit, n, valuelessUnit)'],
+  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',
+  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)', 'floor(3.241cm, cm)', 'floor(3.241cm, 2, cm)'],
+  seealso: ['ceil', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..fd6c007
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/gcd.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gcdDocs = void 0;
+const gcdDocs = exports.gcdDocs = {
+  name: 'gcd',
+  category: 'Arithmetic',
+  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],
+  description: 'Compute the greatest common divisor.',
+  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],
+  seealso: ['lcm', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..b10ec20
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/hypot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hypotDocs = void 0;
+const hypotDocs = exports.hypotDocs = {
+  name: 'hypot',
+  category: 'Arithmetic',
+  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],
+  description: 'Calculate the hypotenuse of a list with values.',
+  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],
+  seealso: ['abs', 'norm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..f389aab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/invmod.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invmodDocs = void 0;
+const invmodDocs = exports.invmodDocs = {
+  name: 'invmod',
+  category: 'Arithmetic',
+  syntax: ['invmod(a, b)'],
+  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',
+  examples: ['invmod(8, 12)', 'invmod(7, 13)', 'invmod(15151, 15122)'],
+  seealso: ['gcd', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..d1621c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/lcm.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lcmDocs = void 0;
+const lcmDocs = exports.lcmDocs = {
+  name: 'lcm',
+  category: 'Arithmetic',
+  syntax: ['lcm(x, y)'],
+  description: 'Compute the least common multiple.',
+  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],
+  seealso: ['gcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js
new file mode 100644
index 0000000..2a7739c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.logDocs = void 0;
+const logDocs = exports.logDocs = {
+  name: 'log',
+  category: 'Arithmetic',
+  syntax: ['log(x)', 'log(x, base)'],
+  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',
+  examples: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],
+  seealso: ['exp', 'log1p', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js
new file mode 100644
index 0000000..513e9a2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log10.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log10Docs = void 0;
+const log10Docs = exports.log10Docs = {
+  name: 'log10',
+  category: 'Arithmetic',
+  syntax: ['log10(x)'],
+  description: 'Compute the 10-base logarithm of a value.',
+  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],
+  seealso: ['exp', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..f05ec54
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log1p.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log1pDocs = void 0;
+const log1pDocs = exports.log1pDocs = {
+  name: 'log1p',
+  category: 'Arithmetic',
+  syntax: ['log1p(x)', 'log1p(x, base)'],
+  description: 'Calculate the logarithm of a `value+1`',
+  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],
+  seealso: ['exp', 'log', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js
new file mode 100644
index 0000000..51c098e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/log2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.log2Docs = void 0;
+const log2Docs = exports.log2Docs = {
+  name: 'log2',
+  category: 'Arithmetic',
+  syntax: ['log2(x)'],
+  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',
+  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],
+  seealso: ['exp', 'log1p', 'log', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js
new file mode 100644
index 0000000..42c116c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/mod.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modDocs = void 0;
+const modDocs = exports.modDocs = {
+  name: 'mod',
+  category: 'Operators',
+  syntax: ['x % y', 'x mod y', 'mod(x, y)'],
+  description: 'Calculates the modulus, the remainder of an integer division.',
+  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..d0af98c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/multiply.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multiplyDocs = void 0;
+const multiplyDocs = exports.multiplyDocs = {
+  name: 'multiply',
+  category: 'Operators',
+  syntax: ['x * y', 'multiply(x, y)'],
+  description: 'multiply two values.',
+  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js
new file mode 100644
index 0000000..80c3935
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/norm.js
@@ -0,0 +1,13 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.normDocs = void 0;
+const normDocs = exports.normDocs = {
+  name: 'norm',
+  category: 'Arithmetic',
+  syntax: ['norm(x)', 'norm(x, p)'],
+  description: 'Calculate the norm of a number, vector or matrix.',
+  examples: ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], "inf")', 'norm([[1, 2], [3, 4]], "fro")']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..77de859
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootDocs = void 0;
+const nthRootDocs = exports.nthRootDocs = {
+  name: 'nthRoot',
+  category: 'Arithmetic',
+  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],
+  description: 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation "x^root = A".',
+  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],
+  seealso: ['nthRoots', 'pow', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..edef828
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/nthRoots.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nthRootsDocs = void 0;
+const nthRootsDocs = exports.nthRootsDocs = {
+  name: 'nthRoots',
+  category: 'Arithmetic',
+  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],
+  description: '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation "x^root = A". ' + 'This function returns an array of complex values.',
+  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],
+  seealso: ['sqrt', 'pow', 'nthRoot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js
new file mode 100644
index 0000000..c62f021
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/pow.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.powDocs = void 0;
+const powDocs = exports.powDocs = {
+  name: 'pow',
+  category: 'Operators',
+  syntax: ['x ^ y', 'pow(x, y)'],
+  description: 'Calculates the power of x to y, x^y.',
+  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)', 'pow([[1, 2], [4, 3]], 2)', 'pow([[1, 2], [4, 3]], -1)'],
+  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js
new file mode 100644
index 0000000..ff59b28
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/round.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.roundDocs = void 0;
+const roundDocs = exports.roundDocs = {
+  name: 'round',
+  category: 'Arithmetic',
+  syntax: ['round(x)', 'round(x, n)', 'round(unit, valuelessUnit)', 'round(unit, n, valuelessUnit)'],
+  description: 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',
+  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)', 'round(3.241cm, 2, cm)', 'round([3.2, 3.8, -4.7])'],
+  seealso: ['ceil', 'floor', 'fix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js
new file mode 100644
index 0000000..6ea9fe3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sign.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.signDocs = void 0;
+const signDocs = exports.signDocs = {
+  name: 'sign',
+  category: 'Arithmetic',
+  syntax: ['sign(x)'],
+  description: 'Compute the sign of a value. The sign of a value x is 1 when x>0, -1 when x<0, and 0 when x=0.',
+  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],
+  seealso: ['abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..78cefc8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrt.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtDocs = void 0;
+const sqrtDocs = exports.sqrtDocs = {
+  name: 'sqrt',
+  category: 'Arithmetic',
+  syntax: ['sqrt(x)'],
+  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',
+  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],
+  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js
new file mode 100644
index 0000000..609612d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/sqrtm.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sqrtmDocs = void 0;
+const sqrtmDocs = exports.sqrtmDocs = {
+  name: 'sqrtm',
+  category: 'Arithmetic',
+  syntax: ['sqrtm(x)'],
+  description: 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',
+  examples: ['sqrtm([[33, 24], [48, 57]])'],
+  seealso: ['sqrt', 'abs', 'square', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js
new file mode 100644
index 0000000..1a4ea51
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/square.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squareDocs = void 0;
+const squareDocs = exports.squareDocs = {
+  name: 'square',
+  category: 'Arithmetic',
+  syntax: ['square(x)'],
+  description: 'Compute the square of a value. The square of x is x * x.',
+  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],
+  seealso: ['multiply', 'pow', 'sqrt', 'cube']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..2fd1da7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/subtract.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subtractDocs = void 0;
+const subtractDocs = exports.subtractDocs = {
+  name: 'subtract',
+  category: 'Operators',
+  syntax: ['x - y', 'subtract(x, y)'],
+  description: 'subtract two values.',
+  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],
+  seealso: ['add']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..bc2f335
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryMinusDocs = void 0;
+const unaryMinusDocs = exports.unaryMinusDocs = {
+  name: 'unaryMinus',
+  category: 'Operators',
+  syntax: ['-x', 'unaryMinus(x)'],
+  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',
+  examples: ['-4.5', '-(-5.6)', '-"22"'],
+  seealso: ['add', 'subtract', 'unaryPlus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..263b8ee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unaryPlusDocs = void 0;
+const unaryPlusDocs = exports.unaryPlusDocs = {
+  name: 'unaryPlus',
+  category: 'Operators',
+  syntax: ['+x', 'unaryPlus(x)'],
+  description: 'Converts booleans and strings to numbers.',
+  examples: ['+true', '+"2"'],
+  seealso: ['add', 'subtract', 'unaryMinus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..1d68e0f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/arithmetic/xgcd.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xgcdDocs = void 0;
+const xgcdDocs = exports.xgcdDocs = {
+  name: 'xgcd',
+  category: 'Arithmetic',
+  syntax: ['xgcd(a, b)'],
+  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',
+  examples: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],
+  seealso: ['gcd', 'lcm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..954403d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitAnd.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndDocs = void 0;
+const bitAndDocs = exports.bitAndDocs = {
+  name: 'bitAnd',
+  category: 'Bitwise',
+  syntax: ['x & y', 'bitAnd(x, y)'],
+  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
+  examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
+  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..ec91700
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitNot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitNotDocs = void 0;
+const bitNotDocs = exports.bitNotDocs = {
+  name: 'bitNot',
+  category: 'Bitwise',
+  syntax: ['~x', 'bitNot(x)'],
+  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
+  examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
+  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..e252ef4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitOr.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitOrDocs = void 0;
+const bitOrDocs = exports.bitOrDocs = {
+  name: 'bitOr',
+  category: 'Bitwise',
+  syntax: ['x | y', 'bitOr(x, y)'],
+  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
+  examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..b91aa4e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/bitXor.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitXorDocs = void 0;
+const bitXorDocs = exports.bitXorDocs = {
+  name: 'bitXor',
+  category: 'Bitwise',
+  syntax: ['bitXor(x, y)'],
+  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
+  examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..ff0368c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/leftShift.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.leftShiftDocs = void 0;
+const leftShiftDocs = exports.leftShiftDocs = {
+  name: 'leftShift',
+  category: 'Bitwise',
+  syntax: ['x << y', 'leftShift(x, y)'],
+  description: 'Bitwise left logical shift of a value x by y number of bits.',
+  examples: ['4 << 1', '8 >> 1'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..b8da2a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightArithShift.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightArithShiftDocs = void 0;
+const rightArithShiftDocs = exports.rightArithShiftDocs = {
+  name: 'rightArithShift',
+  category: 'Bitwise',
+  syntax: ['x >> y', 'rightArithShift(x, y)'],
+  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
+  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..5259600
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/bitwise/rightLogShift.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rightLogShiftDocs = void 0;
+const rightLogShiftDocs = exports.rightLogShiftDocs = {
+  name: 'rightLogShift',
+  category: 'Bitwise',
+  syntax: ['x >>> y', 'rightLogShift(x, y)'],
+  description: 'Bitwise right logical shift of a value x by y number of bits.',
+  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..209cfad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bellNumbersDocs = void 0;
+const bellNumbersDocs = exports.bellNumbersDocs = {
+  name: 'bellNumbers',
+  category: 'Combinatorics',
+  syntax: ['bellNumbers(n)'],
+  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['bellNumbers(3)', 'bellNumbers(8)'],
+  seealso: ['stirlingS2']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..b83ff95
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/catalan.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.catalanDocs = void 0;
+const catalanDocs = exports.catalanDocs = {
+  name: 'catalan',
+  category: 'Combinatorics',
+  syntax: ['catalan(n)'],
+  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['catalan(3)', 'catalan(8)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js
new file mode 100644
index 0000000..94672a5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/composition.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compositionDocs = void 0;
+const compositionDocs = exports.compositionDocs = {
+  name: 'composition',
+  category: 'Combinatorics',
+  syntax: ['composition(n, k)'],
+  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',
+  examples: ['composition(5, 3)'],
+  seealso: ['combinations']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..b79ec8f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stirlingS2Docs = void 0;
+const stirlingS2Docs = exports.stirlingS2Docs = {
+  name: 'stirlingS2',
+  category: 'Combinatorics',
+  syntax: ['stirlingS2(n, k)'],
+  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',
+  examples: ['stirlingS2(5, 3)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js
new file mode 100644
index 0000000..d128a92
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/arg.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.argDocs = void 0;
+const argDocs = exports.argDocs = {
+  name: 'arg',
+  category: 'Complex',
+  syntax: ['arg(x)'],
+  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',
+  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],
+  seealso: ['re', 'im', 'conj', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js
new file mode 100644
index 0000000..af7e879
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/conj.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.conjDocs = void 0;
+const conjDocs = exports.conjDocs = {
+  name: 'conj',
+  category: 'Complex',
+  syntax: ['conj(x)'],
+  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',
+  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],
+  seealso: ['re', 'im', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js
new file mode 100644
index 0000000..fa841cf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/im.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.imDocs = void 0;
+const imDocs = exports.imDocs = {
+  name: 'im',
+  category: 'Complex',
+  syntax: ['im(x)'],
+  description: 'Get the imaginary part of a complex number.',
+  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],
+  seealso: ['re', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js
new file mode 100644
index 0000000..c79281f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/complex/re.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reDocs = void 0;
+const reDocs = exports.reDocs = {
+  name: 're',
+  category: 'Complex',
+  syntax: ['re(x)'],
+  description: 'Get the real part of a complex number.',
+  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],
+  seealso: ['im', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/compile.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/compile.js
new file mode 100644
index 0000000..2089ec9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/compile.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileDocs = void 0;
+const compileDocs = exports.compileDocs = {
+  name: 'compile',
+  category: 'Expression',
+  syntax: ['compile(expr) ', 'compile([expr1, expr2, expr3, ...])'],
+  description: 'Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.',
+  examples: ['code1 = compile("sqrt(3^2 + 4^2)")', 'code1.evaluate() ', 'code2 = compile("a * b")', 'code2.evaluate({a: 3, b: 4})'],
+  seealso: ['parser', 'parse', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js
new file mode 100644
index 0000000..59a6b99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/evaluate.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.evaluateDocs = void 0;
+const evaluateDocs = exports.evaluateDocs = {
+  name: 'evaluate',
+  category: 'Expression',
+  syntax: ['evaluate(expression)', 'evaluate(expression, scope)', 'evaluate([expr1, expr2, expr3, ...])', 'evaluate([expr1, expr2, expr3, ...], scope)'],
+  description: 'Evaluate an expression or an array with expressions.',
+  examples: ['evaluate("2 + 3")', 'evaluate("sqrt(16)")', 'evaluate("2 inch to cm")', 'evaluate("sin(x * pi)", { "x": 1/2 })', 'evaluate(["width=2", "height=4","width*height"])'],
+  seealso: ['parser', 'parse', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js
new file mode 100644
index 0000000..bd3871a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/help.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.helpDocs = void 0;
+const helpDocs = exports.helpDocs = {
+  name: 'help',
+  category: 'Expression',
+  syntax: ['help(object)', 'help(string)'],
+  description: 'Display documentation on a function or data type.',
+  examples: ['help(sqrt)', 'help("complex")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parse.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parse.js
new file mode 100644
index 0000000..d8953f3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parse.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parseDocs = void 0;
+const parseDocs = exports.parseDocs = {
+  name: 'parse',
+  category: 'Expression',
+  syntax: ['parse(expr)', 'parse(expr, options)', 'parse([expr1, expr2, expr3, ...])', 'parse([expr1, expr2, expr3, ...], options)'],
+  description: 'Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().',
+  examples: ['node1 = parse("sqrt(3^2 + 4^2)")', 'node1.evaluate()', 'code1 = node1.compile()', 'code1.evaluate()', 'scope = {a: 3, b: 4}', 'node2 = parse("a * b")', 'node2.evaluate(scope)', 'code2 = node2.compile()', 'code2.evaluate(scope)'],
+  seealso: ['parser', 'evaluate', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parser.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parser.js
new file mode 100644
index 0000000..34bf0f5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/expression/parser.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.parserDocs = void 0;
+const parserDocs = exports.parserDocs = {
+  name: 'parser',
+  category: 'Expression',
+  syntax: ['parser()'],
+  description: 'Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.',
+  examples: ['myParser = parser()', 'myParser.evaluate("sqrt(3^2 + 4^2)")', 'myParser.set("x", 3)', 'myParser.evaluate("y = x + 3")', 'myParser.evaluate(["y = x + 3", "y = y + 1"])', 'myParser.get("y")'],
+  seealso: ['evaluate', 'parse', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js
new file mode 100644
index 0000000..0e6d3da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/distance.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distanceDocs = void 0;
+const distanceDocs = exports.distanceDocs = {
+  name: 'distance',
+  category: 'Geometry',
+  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],
+  description: 'Calculates the Euclidean distance between two points.',
+  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js
new file mode 100644
index 0000000..935ba7c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/geometry/intersect.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.intersectDocs = void 0;
+const intersectDocs = exports.intersectDocs = {
+  name: 'intersect',
+  category: 'Geometry',
+  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],
+  description: 'Computes the intersection point of lines and/or planes.',
+  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js
new file mode 100644
index 0000000..248d533
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/and.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andDocs = void 0;
+const andDocs = exports.andDocs = {
+  name: 'and',
+  category: 'Logical',
+  syntax: ['x and y', 'and(x, y)'],
+  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',
+  examples: ['true and false', 'true and true', '2 and 4'],
+  seealso: ['not', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js
new file mode 100644
index 0000000..47492b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/not.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.notDocs = void 0;
+const notDocs = exports.notDocs = {
+  name: 'not',
+  category: 'Logical',
+  syntax: ['not x', 'not(x)'],
+  description: 'Logical not. Flips the boolean value of given argument.',
+  examples: ['not true', 'not false', 'not 2', 'not 0'],
+  seealso: ['and', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/nullish.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/nullish.js
new file mode 100644
index 0000000..3f322d0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/nullish.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nullishDocs = void 0;
+const nullishDocs = exports.nullishDocs = {
+  name: 'nullish',
+  category: 'Logical',
+  syntax: ['x ?? y', 'nullish(x, y)'],
+  description: 'Nullish coalescing operator. Returns the right-hand operand when the left-hand operand is null or undefined, and otherwise returns the left-hand operand.',
+  examples: ['null ?? 42', 'undefined ?? 42', '0 ?? 42', 'false ?? 42', 'null ?? undefined ?? 42'],
+  seealso: ['and', 'or', 'not']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js
new file mode 100644
index 0000000..ce5abe7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/or.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.orDocs = void 0;
+const orDocs = exports.orDocs = {
+  name: 'or',
+  category: 'Logical',
+  syntax: ['x or y', 'or(x, y)'],
+  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',
+  examples: ['true or false', 'false or false', '0 or 4'],
+  seealso: ['not', 'and', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js
new file mode 100644
index 0000000..3d2189c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/logical/xor.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xorDocs = void 0;
+const xorDocs = exports.xorDocs = {
+  name: 'xor',
+  category: 'Logical',
+  syntax: ['x xor y', 'xor(x, y)'],
+  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',
+  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],
+  seealso: ['not', 'and', 'or']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js
new file mode 100644
index 0000000..cbda3dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/column.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.columnDocs = void 0;
+const columnDocs = exports.columnDocs = {
+  name: 'column',
+  category: 'Matrix',
+  syntax: ['column(x, index)'],
+  description: 'Return a column from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],
+  seealso: ['row', 'matrixFromColumns']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js
new file mode 100644
index 0000000..66ed0a4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/concat.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.concatDocs = void 0;
+const concatDocs = exports.concatDocs = {
+  name: 'concat',
+  category: 'Matrix',
+  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],
+  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',
+  examples: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],
+  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js
new file mode 100644
index 0000000..49991b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/count.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.countDocs = void 0;
+const countDocs = exports.countDocs = {
+  name: 'count',
+  category: 'Matrix',
+  syntax: ['count(x)'],
+  description: 'Count the number of elements of a matrix, array or string.',
+  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count("hello world")'],
+  seealso: ['size']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js
new file mode 100644
index 0000000..8df9433
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/cross.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.crossDocs = void 0;
+const crossDocs = exports.crossDocs = {
+  name: 'cross',
+  category: 'Matrix',
+  syntax: ['cross(A, B)'],
+  description: 'Calculate the cross product for two vectors in three dimensional space.',
+  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],
+  seealso: ['multiply', 'dot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..3c5567d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ctranspose.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ctransposeDocs = void 0;
+const ctransposeDocs = exports.ctransposeDocs = {
+  name: 'ctranspose',
+  category: 'Matrix',
+  syntax: ['x\'', 'ctranspose(x)'],
+  description: 'Complex Conjugate and Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'ctranspose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js
new file mode 100644
index 0000000..8902df4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/det.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.detDocs = void 0;
+const detDocs = exports.detDocs = {
+  name: 'det',
+  category: 'Matrix',
+  syntax: ['det(x)'],
+  description: 'Calculate the determinant of a matrix',
+  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],
+  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js
new file mode 100644
index 0000000..55b4dcd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diag.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diagDocs = void 0;
+const diagDocs = exports.diagDocs = {
+  name: 'diag',
+  category: 'Matrix',
+  syntax: ['diag(x)', 'diag(x, k)'],
+  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',
+  examples: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],
+  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js
new file mode 100644
index 0000000..44e5aa1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/diff.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.diffDocs = void 0;
+const diffDocs = exports.diffDocs = {
+  name: 'diff',
+  category: 'Matrix',
+  syntax: ['diff(arr)', 'diff(arr, dim)'],
+  description: ['Create a new matrix or array with the difference of the passed matrix or array.', 'Dim parameter is optional and used to indicate the dimension of the array/matrix to apply the difference', 'If no dimension parameter is passed it is assumed as dimension 0', 'Dimension is zero-based in javascript and one-based in the parser', 'Arrays must be \'rectangular\' meaning arrays like [1, 2]', 'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'],
+  examples: ['A = [1, 2, 4, 7, 0]', 'diff(A)', 'diff(A, 1)', 'B = [[1, 2], [3, 4]]', 'diff(B)', 'diff(B, 1)', 'diff(B, 2)', 'diff(B, bignumber(2))', 'diff([[1, 2], matrix([3, 4])], 2)'],
+  seealso: ['subtract', 'partitionSelect']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js
new file mode 100644
index 0000000..c3eda6a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/dot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dotDocs = void 0;
+const dotDocs = exports.dotDocs = {
+  name: 'dot',
+  category: 'Matrix',
+  syntax: ['dot(A, B)', 'A * B'],
+  description: 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',
+  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],
+  seealso: ['multiply', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js
new file mode 100644
index 0000000..0b960b1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/eigs.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.eigsDocs = void 0;
+const eigsDocs = exports.eigsDocs = {
+  name: 'eigs',
+  category: 'Matrix',
+  syntax: ['eigs(x)'],
+  description: 'Calculate the eigenvalues and optionally eigenvectors of a square matrix',
+  examples: ['eigs([[5, 2.3], [2.3, 1]])', 'eigs([[1, 2, 3], [4, 5, 6], [7, 8, 9]], { precision: 1e-6, eigenvectors: false })'],
+  seealso: ['inv']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/fft.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/fft.js
new file mode 100644
index 0000000..487324f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/fft.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.fftDocs = void 0;
+const fftDocs = exports.fftDocs = {
+  name: 'fft',
+  category: 'Matrix',
+  syntax: ['fft(x)'],
+  description: 'Calculate N-dimensional Fourier transform',
+  examples: ['fft([[1, 0], [1, 0]])'],
+  seealso: ['ifft']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js
new file mode 100644
index 0000000..0e0ba28
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/filter.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.filterDocs = void 0;
+const filterDocs = exports.filterDocs = {
+  name: 'filter',
+  category: 'Matrix',
+  syntax: ['filter(x, test)'],
+  description: 'Filter items in a matrix.',
+  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],
+  seealso: ['sort', 'map', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js
new file mode 100644
index 0000000..971e07f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/flatten.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.flattenDocs = void 0;
+const flattenDocs = exports.flattenDocs = {
+  name: 'flatten',
+  category: 'Matrix',
+  syntax: ['flatten(x)'],
+  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],
+  seealso: ['concat', 'resize', 'size', 'squeeze']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js
new file mode 100644
index 0000000..7e26ff6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/forEach.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.forEachDocs = void 0;
+const forEachDocs = exports.forEachDocs = {
+  name: 'forEach',
+  category: 'Matrix',
+  syntax: ['forEach(x, callback)'],
+  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',
+  examples: ['numberOfPets = {}', 'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;', 'forEach(["Dog","Cat","Cat"], addPet)', 'numberOfPets'],
+  seealso: ['map', 'sort', 'filter']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..6539d57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getMatrixDataTypeDocs = void 0;
+const getMatrixDataTypeDocs = exports.getMatrixDataTypeDocs = {
+  name: 'getMatrixDataType',
+  category: 'Matrix',
+  syntax: ['getMatrixDataType(x)'],
+  description: 'Find the data type of all elements in a matrix or array, ' + 'for example "number" if all items are a number ' + 'and "Complex" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return "mixed".',
+  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, "text"])', 'getMatrixDataType([1, bignumber(4)])'],
+  seealso: ['matrix', 'sparse', 'typeOf']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js
new file mode 100644
index 0000000..b1f3704
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/identity.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.identityDocs = void 0;
+const identityDocs = exports.identityDocs = {
+  name: 'identity',
+  category: 'Matrix',
+  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],
+  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',
+  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ifft.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ifft.js
new file mode 100644
index 0000000..d86d754
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ifft.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.ifftDocs = void 0;
+const ifftDocs = exports.ifftDocs = {
+  name: 'ifft',
+  category: 'Matrix',
+  syntax: ['ifft(x)'],
+  description: 'Calculate N-dimensional inverse Fourier transform',
+  examples: ['ifft([[2, 2], [0, 0]])'],
+  seealso: ['fft']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js
new file mode 100644
index 0000000..07078d5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/inv.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.invDocs = void 0;
+const invDocs = exports.invDocs = {
+  name: 'inv',
+  category: 'Matrix',
+  syntax: ['inv(x)'],
+  description: 'Calculate the inverse of a matrix',
+  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js
new file mode 100644
index 0000000..efd5d50
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/kron.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kronDocs = void 0;
+const kronDocs = exports.kronDocs = {
+  name: 'kron',
+  category: 'Matrix',
+  syntax: ['kron(x, y)'],
+  description: 'Calculates the Kronecker product of 2 matrices or vectors.',
+  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],
+  seealso: ['multiply', 'dot', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js
new file mode 100644
index 0000000..248a84f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/map.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapDocs = void 0;
+const mapDocs = exports.mapDocs = {
+  name: 'map',
+  category: 'Matrix',
+  syntax: ['map(x, callback)', 'map(x, y, ..., callback)'],
+  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array or the matrices/arrays.',
+  examples: ['map([1, 2, 3], square)', 'map([1, 2], [3, 4], f(a,b) = a + b)'],
+  seealso: ['filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/mapSlices.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/mapSlices.js
new file mode 100644
index 0000000..3bb3ecb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/mapSlices.js
@@ -0,0 +1,17 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mapSlicesDocs = void 0;
+const mapSlicesDocs = exports.mapSlicesDocs = {
+  name: 'mapSlices',
+  category: 'Matrix',
+  syntax: ['mapSlices(A, dim, callback)'],
+  description: 'Generate a matrix one dimension less than A by applying callback to ' + 'each slice of A along dimension dim.',
+  examples: ['A = [[1, 2], [3, 4]]', 'mapSlices(A, 1, sum)',
+  // returns [4, 6]
+  'mapSlices(A, 2, prod)' // returns [2, 12]
+  ],
+  seealso: ['map', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..68bba7e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromColumnsDocs = void 0;
+const matrixFromColumnsDocs = exports.matrixFromColumnsDocs = {
+  name: 'matrixFromColumns',
+  category: 'Matrix',
+  syntax: ['matrixFromColumns(...arr)', 'matrixFromColumns(row1, row2)', 'matrixFromColumns(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual columns.',
+  examples: ['matrixFromColumns([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..27ec1c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromFunctionDocs = void 0;
+const matrixFromFunctionDocs = exports.matrixFromFunctionDocs = {
+  name: 'matrixFromFunction',
+  category: 'Matrix',
+  syntax: ['matrixFromFunction(size, fn)', 'matrixFromFunction(size, fn, format)', 'matrixFromFunction(size, fn, format, datatype)', 'matrixFromFunction(size, format, fn)', 'matrixFromFunction(size, format, datatype, fn)'],
+  description: 'Create a matrix by evaluating a generating function at each index.',
+  examples: ['f(I) = I[1] - I[2]', 'matrixFromFunction([3,3], f)', 'g(I) = I[1] - I[2] == 1 ? 4 : 0', 'matrixFromFunction([100, 100], "sparse", g)', 'matrixFromFunction([5], random)'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..8447fbe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/matrixFromRows.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.matrixFromRowsDocs = void 0;
+const matrixFromRowsDocs = exports.matrixFromRowsDocs = {
+  name: 'matrixFromRows',
+  category: 'Matrix',
+  syntax: ['matrixFromRows(...arr)', 'matrixFromRows(row1, row2)', 'matrixFromRows(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual rows.',
+  examples: ['matrixFromRows([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js
new file mode 100644
index 0000000..150d59b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/ones.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.onesDocs = void 0;
+const onesDocs = exports.onesDocs = {
+  name: 'ones',
+  category: 'Matrix',
+  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],
+  description: 'Create a matrix containing ones.',
+  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..ddc8fbe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/partitionSelect.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.partitionSelectDocs = void 0;
+const partitionSelectDocs = exports.partitionSelectDocs = {
+  name: 'partitionSelect',
+  category: 'Matrix',
+  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],
+  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',
+  examples: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect(["C", "B", "A", "D"], 1, compareText)', 'arr = [5, 2, 1]', 'partitionSelect(arr, 0) # returns 1, arr is now: [1, 2, 5]', 'arr', 'partitionSelect(arr, 1, \'desc\') # returns 2, arr is now: [5, 2, 1]', 'arr'],
+  seealso: ['sort']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/pinv.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/pinv.js
new file mode 100644
index 0000000..84e41db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/pinv.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pinvDocs = void 0;
+const pinvDocs = exports.pinvDocs = {
+  name: 'pinv',
+  category: 'Matrix',
+  syntax: ['pinv(x)'],
+  description: 'Calculate the Moore–Penrose inverse of a matrix',
+  examples: ['pinv([1, 2; 3, 4])', 'pinv([[1, 0], [0, 1], [0, 1]])', 'pinv(4)'],
+  seealso: ['inv']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js
new file mode 100644
index 0000000..f16891a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/range.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rangeDocs = void 0;
+const rangeDocs = exports.rangeDocs = {
+  name: 'range',
+  category: 'Type',
+  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],
+  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',
+  examples: ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range("4:10")', 'range(1m, 1m, 3m)', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js
new file mode 100644
index 0000000..d61aa0c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/reshape.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.reshapeDocs = void 0;
+const reshapeDocs = exports.reshapeDocs = {
+  name: 'reshape',
+  category: 'Matrix',
+  syntax: ['reshape(x, sizes)'],
+  description: 'Reshape a multi dimensional array to fit the specified dimensions.',
+  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])', 'reshape([1, 2, 3, 4], [-1, 2])'],
+  seealso: ['size', 'squeeze', 'resize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js
new file mode 100644
index 0000000..9a75b32
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/resize.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.resizeDocs = void 0;
+const resizeDocs = exports.resizeDocs = {
+  name: 'resize',
+  category: 'Matrix',
+  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],
+  description: 'Resize a matrix.',
+  examples: ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize("hello", [8], "!")'],
+  seealso: ['size', 'subset', 'squeeze', 'reshape']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js
new file mode 100644
index 0000000..73e0b1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotate.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotateDocs = void 0;
+const rotateDocs = exports.rotateDocs = {
+  name: 'rotate',
+  category: 'Matrix',
+  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotate([1, 0], pi / 2)', 'rotate(matrix([1, 0]), unit("35deg"))', 'rotate([1, 0, 0], unit("90deg"), [0, 0, 1])', 'rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],
+  seealso: ['matrix', 'rotationMatrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..262c13d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/rotationMatrix.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rotationMatrixDocs = void 0;
+const rotationMatrixDocs = exports.rotationMatrixDocs = {
+  name: 'rotationMatrix',
+  category: 'Matrix',
+  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit("45deg"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],
+  seealso: ['cos', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js
new file mode 100644
index 0000000..24ea4ae
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/row.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.rowDocs = void 0;
+const rowDocs = exports.rowDocs = {
+  name: 'row',
+  category: 'Matrix',
+  syntax: ['row(x, index)'],
+  description: 'Return a row from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],
+  seealso: ['column', 'matrixFromRows']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js
new file mode 100644
index 0000000..3649021
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/size.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sizeDocs = void 0;
+const sizeDocs = exports.sizeDocs = {
+  name: 'size',
+  category: 'Matrix',
+  syntax: ['size(x)'],
+  description: 'Calculate the size of a matrix.',
+  examples: ['size(2.3)', 'size("hello world")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],
+  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js
new file mode 100644
index 0000000..e949529
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/sort.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sortDocs = void 0;
+const sortDocs = exports.sortDocs = {
+  name: 'sort',
+  category: 'Matrix',
+  syntax: ['sort(x)', 'sort(x, compare)'],
+  description: 'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',
+  examples: ['sort([5, 10, 1])', 'sort(["C", "B", "A", "D"], "natural")', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort(["Langdon", "Tom", "Sara"], sortByLength)', 'sort(["10", "1", "2"], "natural")'],
+  seealso: ['map', 'filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js
new file mode 100644
index 0000000..35d2a1a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/squeeze.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.squeezeDocs = void 0;
+const squeezeDocs = exports.squeezeDocs = {
+  name: 'squeeze',
+  category: 'Matrix',
+  syntax: ['squeeze(x)'],
+  description: 'Remove inner and outer singleton dimensions from a matrix.',
+  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js
new file mode 100644
index 0000000..c42caa9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/subset.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.subsetDocs = void 0;
+const subsetDocs = exports.subsetDocs = {
+  name: 'subset',
+  category: 'Matrix',
+  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],
+  description: 'Get or set a subset of the entries of a matrix or ' + 'characters of a string. ' + 'Indexes are one-based. There should be one index specification for ' + 'each dimension of the target. Each specification can be a single ' + 'index, a list of indices, or a range in colon notation `l:u`. ' + 'In a range, both the lower bound l and upper bound u are included; ' + 'and if a bound is omitted it defaults to the most extreme valid value. ' + 'The cartesian product of the indices specified in each dimension ' + 'determines the target of the operation.',
+  examples: ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]', 'f[[1,2], [1,3]] = [9, 10; 11, 12]', 'f'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js
new file mode 100644
index 0000000..df95cad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/trace.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.traceDocs = void 0;
+const traceDocs = exports.traceDocs = {
+  name: 'trace',
+  category: 'Matrix',
+  syntax: ['trace(A)'],
+  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',
+  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js
new file mode 100644
index 0000000..c4ee7ba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/transpose.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.transposeDocs = void 0;
+const transposeDocs = exports.transposeDocs = {
+  name: 'transpose',
+  category: 'Matrix',
+  syntax: ['x\'', 'transpose(x)'],
+  description: 'Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'transpose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js
new file mode 100644
index 0000000..925571f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/matrix/zeros.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zerosDocs = void 0;
+const zerosDocs = exports.zerosDocs = {
+  name: 'zeros',
+  category: 'Matrix',
+  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],
+  description: 'Create a matrix containing zeros.',
+  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/numeric/solveODE.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/numeric/solveODE.js
new file mode 100644
index 0000000..2c5f636
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/numeric/solveODE.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.solveODEDocs = void 0;
+const solveODEDocs = exports.solveODEDocs = {
+  name: 'solveODE',
+  category: 'Numeric',
+  syntax: ['solveODE(func, tspan, y0)', 'solveODE(func, tspan, y0, options)'],
+  description: 'Numerical Integration of Ordinary Differential Equations.',
+  examples: ['f(t,y) = y', 'tspan = [0, 4]', 'solveODE(f, tspan, 1)', 'solveODE(f, tspan, [1, 2])', 'solveODE(f, tspan, 1, { method:"RK23", maxStep:0.1 })'],
+  seealso: ['derivative', 'simplifyCore']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js
new file mode 100644
index 0000000..ab03458
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinations.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsDocs = void 0;
+const combinationsDocs = exports.combinationsDocs = {
+  name: 'combinations',
+  category: 'Probability',
+  syntax: ['combinations(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time',
+  examples: ['combinations(7, 5)'],
+  seealso: ['combinationsWithRep', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..e23ff36
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/combinationsWithRep.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsWithRepDocs = void 0;
+const combinationsWithRepDocs = exports.combinationsWithRepDocs = {
+  name: 'combinationsWithRep',
+  category: 'Probability',
+  syntax: ['combinationsWithRep(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time with replacements.',
+  examples: ['combinationsWithRep(7, 5)'],
+  seealso: ['combinations', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js
new file mode 100644
index 0000000..7e807d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/distribution.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.distributionDocs = void 0;
+const distributionDocs = exports.distributionDocs = {
+  name: 'distribution',
+  category: 'Probability',
+  syntax: ['distribution(name)', 'distribution(name, arg1, arg2, ...)'],
+  description: 'Create a distribution object of a specific type. ' + 'A distribution object contains functions `random([size,] [min,] [max])`, ' + '`randomInt([size,] [min,] [max])` and `pickRandom(array)`. ' + 'Available types of distributions: "uniform", "normal". ' + 'Note that the function distribution is currently not available via the expression parser.',
+  examples: [],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js
new file mode 100644
index 0000000..9e36255
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/factorial.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.factorialDocs = void 0;
+const factorialDocs = exports.factorialDocs = {
+  name: 'factorial',
+  category: 'Probability',
+  syntax: ['n!', 'factorial(n)'],
+  description: 'Compute the factorial of a value',
+  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],
+  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js
new file mode 100644
index 0000000..8734aa5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/gamma.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaDocs = void 0;
+const gammaDocs = exports.gammaDocs = {
+  name: 'gamma',
+  category: 'Probability',
+  syntax: ['gamma(n)'],
+  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',
+  examples: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],
+  seealso: ['factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js
new file mode 100644
index 0000000..1e73b1d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/kldivergence.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.kldivergenceDocs = void 0;
+const kldivergenceDocs = exports.kldivergenceDocs = {
+  name: 'kldivergence',
+  category: 'Probability',
+  syntax: ['kldivergence(x, y)'],
+  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',
+  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/lgamma.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/lgamma.js
new file mode 100644
index 0000000..ba562cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/lgamma.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lgammaDocs = void 0;
+const lgammaDocs = exports.lgammaDocs = {
+  name: 'lgamma',
+  category: 'Probability',
+  syntax: ['lgamma(n)'],
+  description: 'Logarithm of the gamma function for real, positive numbers and complex numbers, ' + 'using Lanczos approximation for numbers and Stirling series for complex numbers.',
+  examples: ['lgamma(4)', 'lgamma(1/2)', 'lgamma(i)', 'lgamma(complex(1.1, 2))'],
+  seealso: ['gamma']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js
new file mode 100644
index 0000000..bdcadfc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/multinomial.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.multinomialDocs = void 0;
+const multinomialDocs = exports.multinomialDocs = {
+  name: 'multinomial',
+  category: 'Probability',
+  syntax: ['multinomial(A)'],
+  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',
+  examples: ['multinomial([1, 2, 1])'],
+  seealso: ['combinations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js
new file mode 100644
index 0000000..1e0663c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/permutations.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.permutationsDocs = void 0;
+const permutationsDocs = exports.permutationsDocs = {
+  name: 'permutations',
+  category: 'Probability',
+  syntax: ['permutations(n)', 'permutations(n, k)'],
+  description: 'Compute the number of permutations of n items taken k at a time',
+  examples: ['permutations(5)', 'permutations(5, 3)'],
+  seealso: ['combinations', 'combinationsWithRep', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js
new file mode 100644
index 0000000..a1cd990
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/pickRandom.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pickRandomDocs = void 0;
+const pickRandomDocs = exports.pickRandomDocs = {
+  name: 'pickRandom',
+  category: 'Probability',
+  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],
+  description: 'Pick a random entry from a given array.',
+  examples: ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js
new file mode 100644
index 0000000..2303843
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/random.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomDocs = void 0;
+const randomDocs = exports.randomDocs = {
+  name: 'random',
+  category: 'Probability',
+  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],
+  description: 'Return a random number.',
+  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],
+  seealso: ['pickRandom', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js
new file mode 100644
index 0000000..54358ca
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/probability/randomInt.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomIntDocs = void 0;
+const randomIntDocs = exports.randomIntDocs = {
+  name: 'randomInt',
+  category: 'Probability',
+  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],
+  description: 'Return a random integer number',
+  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],
+  seealso: ['pickRandom', 'random']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js
new file mode 100644
index 0000000..931c7a3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compare.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareDocs = void 0;
+const compareDocs = exports.compareDocs = {
+  name: 'compare',
+  category: 'Relational',
+  syntax: ['compare(x, y)'],
+  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js
new file mode 100644
index 0000000..b470f09
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareNatural.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareNaturalDocs = void 0;
+const compareNaturalDocs = exports.compareNaturalDocs = {
+  name: 'compareNatural',
+  category: 'Relational',
+  syntax: ['compareNatural(x, y)'],
+  description: 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural("2", "10")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js
new file mode 100644
index 0000000..f27f926
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/compareText.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareTextDocs = void 0;
+const compareTextDocs = exports.compareTextDocs = {
+  name: 'compareText',
+  category: 'Relational',
+  syntax: ['compareText(x, y)'],
+  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareText("B", "A")', 'compareText("A", "B")', 'compareText("A", "A")', 'compareText("2", "10")', 'compare("2", "10")', 'compare(2, 10)', 'compareNatural("2", "10")', 'compareText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js
new file mode 100644
index 0000000..ff2b901
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/deepEqual.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.deepEqualDocs = void 0;
+const deepEqualDocs = exports.deepEqualDocs = {
+  name: 'deepEqual',
+  category: 'Relational',
+  syntax: ['deepEqual(x, y)'],
+  description: 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',
+  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js
new file mode 100644
index 0000000..f2977e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equal.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalDocs = void 0;
+const equalDocs = exports.equalDocs = {
+  name: 'equal',
+  category: 'Relational',
+  syntax: ['x == y', 'equal(x, y)'],
+  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',
+  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],
+  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js
new file mode 100644
index 0000000..e94f9cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/equalText.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.equalTextDocs = void 0;
+const equalTextDocs = exports.equalTextDocs = {
+  name: 'equalText',
+  category: 'Relational',
+  syntax: ['equalText(x, y)'],
+  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',
+  examples: ['equalText("Hello", "Hello")', 'equalText("a", "A")', 'equal("2e3", "2000")', 'equalText("2e3", "2000")', 'equalText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural', 'compareText', 'equal']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js
new file mode 100644
index 0000000..37757c7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/larger.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerDocs = void 0;
+const largerDocs = exports.largerDocs = {
+  name: 'larger',
+  category: 'Relational',
+  syntax: ['x > y', 'larger(x, y)'],
+  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not. Comparing a value with NaN returns false.',
+  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js
new file mode 100644
index 0000000..d93f194
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/largerEq.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.largerEqDocs = void 0;
+const largerEqDocs = exports.largerEqDocs = {
+  name: 'largerEq',
+  category: 'Relational',
+  syntax: ['x >= y', 'largerEq(x, y)'],
+  description: 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',
+  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],
+  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js
new file mode 100644
index 0000000..d763f94
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smaller.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerDocs = void 0;
+const smallerDocs = exports.smallerDocs = {
+  name: 'smaller',
+  category: 'Relational',
+  syntax: ['x < y', 'smaller(x, y)'],
+  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not. Comparing a value with NaN returns false.',
+  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],
+  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js
new file mode 100644
index 0000000..ca9df76
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/smallerEq.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.smallerEqDocs = void 0;
+const smallerEqDocs = exports.smallerEqDocs = {
+  name: 'smallerEq',
+  category: 'Relational',
+  syntax: ['x <= y', 'smallerEq(x, y)'],
+  description: 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],
+  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js
new file mode 100644
index 0000000..2b0cafe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/relational/unequal.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unequalDocs = void 0;
+const unequalDocs = exports.unequalDocs = {
+  name: 'unequal',
+  category: 'Relational',
+  syntax: ['x != y', 'unequal(x, y)'],
+  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',
+  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],
+  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js
new file mode 100644
index 0000000..cec3f68
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setCartesian.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setCartesianDocs = void 0;
+const setCartesianDocs = exports.setCartesianDocs = {
+  name: 'setCartesian',
+  category: 'Set',
+  syntax: ['setCartesian(set1, set2)'],
+  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',
+  examples: ['setCartesian([1, 2], [3, 4])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js
new file mode 100644
index 0000000..07ebe11
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDifference.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDifferenceDocs = void 0;
+const setDifferenceDocs = exports.setDifferenceDocs = {
+  name: 'setDifference',
+  category: 'Set',
+  syntax: ['setDifference(set1, set2)'],
+  description: 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setSymDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js
new file mode 100644
index 0000000..c543acd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setDistinct.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setDistinctDocs = void 0;
+const setDistinctDocs = exports.setDistinctDocs = {
+  name: 'setDistinct',
+  category: 'Set',
+  syntax: ['setDistinct(set)'],
+  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],
+  seealso: ['setMultiplicity']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js
new file mode 100644
index 0000000..2ec82c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIntersect.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIntersectDocs = void 0;
+const setIntersectDocs = exports.setIntersectDocs = {
+  name: 'setIntersect',
+  category: 'Set',
+  syntax: ['setIntersect(set1, set2)'],
+  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js
new file mode 100644
index 0000000..fe4cdef
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setIsSubset.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setIsSubsetDocs = void 0;
+const setIsSubsetDocs = exports.setIsSubsetDocs = {
+  name: 'setIsSubset',
+  category: 'Set',
+  syntax: ['setIsSubset(set1, set2)'],
+  description: 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..cb8e5af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setMultiplicity.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setMultiplicityDocs = void 0;
+const setMultiplicityDocs = exports.setMultiplicityDocs = {
+  name: 'setMultiplicity',
+  category: 'Set',
+  syntax: ['setMultiplicity(element, set)'],
+  description: 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],
+  seealso: ['setDistinct', 'setSize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js
new file mode 100644
index 0000000..5792aa3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setPowerset.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setPowersetDocs = void 0;
+const setPowersetDocs = exports.setPowersetDocs = {
+  name: 'setPowerset',
+  category: 'Set',
+  syntax: ['setPowerset(set)'],
+  description: 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setPowerset([1, 2, 3])'],
+  seealso: ['setCartesian']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js
new file mode 100644
index 0000000..a6583cd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSize.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSizeDocs = void 0;
+const setSizeDocs = exports.setSizeDocs = {
+  name: 'setSize',
+  category: 'Set',
+  syntax: ['setSize(set)', 'setSize(set, unique)'],
+  description: 'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js
new file mode 100644
index 0000000..fc5082d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setSymDifference.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setSymDifferenceDocs = void 0;
+const setSymDifferenceDocs = exports.setSymDifferenceDocs = {
+  name: 'setSymDifference',
+  category: 'Set',
+  syntax: ['setSymDifference(set1, set2)'],
+  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js
new file mode 100644
index 0000000..b04e1a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/set/setUnion.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.setUnionDocs = void 0;
+const setUnionDocs = exports.setUnionDocs = {
+  name: 'setUnion',
+  category: 'Set',
+  syntax: ['setUnion(set1, set2)'],
+  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/freqz.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/freqz.js
new file mode 100644
index 0000000..29ab618
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/freqz.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.freqzDocs = void 0;
+const freqzDocs = exports.freqzDocs = {
+  name: 'freqz',
+  category: 'Signal',
+  syntax: ['freqz(b, a)', 'freqz(b, a, w)'],
+  description: 'Calculates the frequency response of a filter given its numerator and denominator coefficients.',
+  examples: ['freqz([1, 2], [1, 2, 3])', 'freqz([1, 2], [1, 2, 3], [0, 1])', 'freqz([1, 2], [1, 2, 3], 512)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/zpk2tf.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/zpk2tf.js
new file mode 100644
index 0000000..b2c782f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/signal/zpk2tf.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zpk2tfDocs = void 0;
+const zpk2tfDocs = exports.zpk2tfDocs = {
+  name: 'zpk2tf',
+  category: 'Signal',
+  syntax: ['zpk2tf(z, p, k)'],
+  description: 'Compute the transfer function of a zero-pole-gain model.',
+  examples: ['zpk2tf([1, 2], [-1, -2], 1)', 'zpk2tf([1, 2], [-1, -2])', 'zpk2tf([1 - 3i, 2 + 2i], [-1, -2])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js
new file mode 100644
index 0000000..1707384
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/erf.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.erfDocs = void 0;
+const erfDocs = exports.erfDocs = {
+  name: 'erf',
+  category: 'Special',
+  syntax: ['erf(x)'],
+  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',
+  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/zeta.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/zeta.js
new file mode 100644
index 0000000..8a729d7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/special/zeta.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.zetaDocs = void 0;
+const zetaDocs = exports.zetaDocs = {
+  name: 'zeta',
+  category: 'Special',
+  syntax: ['zeta(s)'],
+  description: 'Compute the Riemann Zeta Function using an infinite series and Riemann\'s Functional Equation for the entire complex plane',
+  examples: ['zeta(0.2)', 'zeta(-0.5)', 'zeta(4)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/corr.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/corr.js
new file mode 100644
index 0000000..56d061e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/corr.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.corrDocs = void 0;
+const corrDocs = exports.corrDocs = {
+  name: 'corr',
+  category: 'Statistics',
+  syntax: ['corr(A,B)'],
+  description: 'Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.',
+  examples: ['corr([2, 4, 6, 8],[1, 2, 3, 6])', 'corr(matrix([[1, 2.2, 3, 4.8, 5], [1, 2, 3, 4, 5]]), matrix([[4, 5.3, 6.6, 7, 8], [1, 2, 3, 4, 5]]))'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js
new file mode 100644
index 0000000..7ccc28f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/cumsum.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cumSumDocs = void 0;
+const cumSumDocs = exports.cumSumDocs = {
+  name: 'cumsum',
+  category: 'Statistics',
+  syntax: ['cumsum(a, b, c, ...)', 'cumsum(A)'],
+  description: 'Compute the cumulative sum of all values.',
+  examples: ['cumsum(2, 3, 4, 1)', 'cumsum([2, 3, 4, 1])', 'cumsum([1, 2; 3, 4])', 'cumsum([1, 2; 3, 4], 1)', 'cumsum([1, 2; 3, 4], 2)'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js
new file mode 100644
index 0000000..f65b29f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mad.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.madDocs = void 0;
+const madDocs = exports.madDocs = {
+  name: 'mad',
+  category: 'Statistics',
+  syntax: ['mad(a, b, c, ...)', 'mad(A)'],
+  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',
+  examples: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],
+  seealso: ['mean', 'median', 'std', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js
new file mode 100644
index 0000000..8130b63
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/max.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.maxDocs = void 0;
+const maxDocs = exports.maxDocs = {
+  name: 'max',
+  category: 'Statistics',
+  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dimension)'],
+  description: 'Compute the maximum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',
+  examples: ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js
new file mode 100644
index 0000000..746490e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mean.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.meanDocs = void 0;
+const meanDocs = exports.meanDocs = {
+  name: 'mean',
+  category: 'Statistics',
+  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dimension)'],
+  description: 'Compute the arithmetic mean of a list of values.',
+  examples: ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],
+  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js
new file mode 100644
index 0000000..112d6ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/median.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.medianDocs = void 0;
+const medianDocs = exports.medianDocs = {
+  name: 'median',
+  category: 'Statistics',
+  syntax: ['median(a, b, c, ...)', 'median(A)'],
+  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',
+  examples: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],
+  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js
new file mode 100644
index 0000000..f1beaf8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/min.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.minDocs = void 0;
+const minDocs = exports.minDocs = {
+  name: 'min',
+  category: 'Statistics',
+  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dimension)'],
+  description: 'Compute the minimum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',
+  examples: ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js
new file mode 100644
index 0000000..b086010
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/mode.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.modeDocs = void 0;
+const modeDocs = exports.modeDocs = {
+  name: 'mode',
+  category: 'Statistics',
+  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],
+  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',
+  examples: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js
new file mode 100644
index 0000000..3f9a7d1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/prod.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.prodDocs = void 0;
+const prodDocs = exports.prodDocs = {
+  name: 'prod',
+  category: 'Statistics',
+  syntax: ['prod(a, b, c, ...)', 'prod(A)'],
+  description: 'Compute the product of all values.',
+  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..a72e937
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/quantileSeq.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.quantileSeqDocs = void 0;
+const quantileSeqDocs = exports.quantileSeqDocs = {
+  name: 'quantileSeq',
+  category: 'Statistics',
+  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],
+  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probability are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',
+  examples: ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],
+  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js
new file mode 100644
index 0000000..57ddbdc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/std.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.stdDocs = void 0;
+const stdDocs = exports.stdDocs = {
+  name: 'std',
+  category: 'Statistics',
+  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, dimension)', 'std(A, normalization)', 'std(A, dimension, normalization)'],
+  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], "uncorrected")', 'std([2, 4, 6, 8], "biased")', 'std([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js
new file mode 100644
index 0000000..8d6c3ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/sum.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sumDocs = void 0;
+const sumDocs = exports.sumDocs = {
+  name: 'sum',
+  category: 'Statistics',
+  syntax: ['sum(a, b, c, ...)', 'sum(A)', 'sum(A, dimension)'],
+  description: 'Compute the sum of all values.',
+  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js
new file mode 100644
index 0000000..379f051
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/statistics/variance.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.varianceDocs = void 0;
+const varianceDocs = exports.varianceDocs = {
+  name: 'variance',
+  category: 'Statistics',
+  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, dimension)', 'variance(A, normalization)', 'variance(A, dimension, normalization)'],
+  description: 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], "uncorrected")', 'variance([2, 4, 6, 8], "biased")', 'variance([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js
new file mode 100644
index 0000000..05d01c8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acos.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosDocs = void 0;
+const acosDocs = exports.acosDocs = {
+  name: 'acos',
+  category: 'Trigonometry',
+  syntax: ['acos(x)'],
+  description: 'Compute the inverse cosine of a value in radians.',
+  examples: ['acos(0.5)', 'acos(cos(2.3))'],
+  seealso: ['cos', 'atan', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..3ee6f2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acosh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acoshDocs = void 0;
+const acoshDocs = exports.acoshDocs = {
+  name: 'acosh',
+  category: 'Trigonometry',
+  syntax: ['acosh(x)'],
+  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',
+  examples: ['acosh(1.5)'],
+  seealso: ['cosh', 'asinh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js
new file mode 100644
index 0000000..2f35edf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acotDocs = void 0;
+const acotDocs = exports.acotDocs = {
+  name: 'acot',
+  category: 'Trigonometry',
+  syntax: ['acot(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],
+  seealso: ['cot', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..13d0eee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acoth.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acothDocs = void 0;
+const acothDocs = exports.acothDocs = {
+  name: 'acoth',
+  category: 'Trigonometry',
+  syntax: ['acoth(x)'],
+  description: 'Calculate the inverse hyperbolic tangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',
+  examples: ['acoth(2)', 'acoth(0.5)'],
+  seealso: ['acsch', 'asech']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..9446b55
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsc.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acscDocs = void 0;
+const acscDocs = exports.acscDocs = {
+  name: 'acsc',
+  category: 'Trigonometry',
+  syntax: ['acsc(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],
+  seealso: ['csc', 'asin', 'asec']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..a89abd9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/acsch.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acschDocs = void 0;
+const acschDocs = exports.acschDocs = {
+  name: 'acsch',
+  category: 'Trigonometry',
+  syntax: ['acsch(x)'],
+  description: 'Calculate the inverse hyperbolic cosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',
+  examples: ['acsch(0.5)'],
+  seealso: ['asech', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js
new file mode 100644
index 0000000..2cdd502
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asec.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asecDocs = void 0;
+const asecDocs = exports.asecDocs = {
+  name: 'asec',
+  category: 'Trigonometry',
+  syntax: ['asec(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],
+  seealso: ['acos', 'acot', 'acsc']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js
new file mode 100644
index 0000000..61aad99
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asech.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asechDocs = void 0;
+const asechDocs = exports.asechDocs = {
+  name: 'asech',
+  category: 'Trigonometry',
+  syntax: ['asech(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asech(0.5)'],
+  seealso: ['acsch', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js
new file mode 100644
index 0000000..e2f4a45
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asin.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinDocs = void 0;
+const asinDocs = exports.asinDocs = {
+  name: 'asin',
+  category: 'Trigonometry',
+  syntax: ['asin(x)'],
+  description: 'Compute the inverse sine of a value in radians.',
+  examples: ['asin(0.5)', 'asin(sin(0.5))'],
+  seealso: ['sin', 'acos', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..33a23df
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/asinh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.asinhDocs = void 0;
+const asinhDocs = exports.asinhDocs = {
+  name: 'asinh',
+  category: 'Trigonometry',
+  syntax: ['asinh(x)'],
+  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',
+  examples: ['asinh(0.5)'],
+  seealso: ['acosh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js
new file mode 100644
index 0000000..ab92912
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanDocs = void 0;
+const atanDocs = exports.atanDocs = {
+  name: 'atan',
+  category: 'Trigonometry',
+  syntax: ['atan(x)'],
+  description: 'Compute the inverse tangent of a value in radians.',
+  examples: ['atan(0.5)', 'atan(tan(0.5))'],
+  seealso: ['tan', 'acos', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..0c77024
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atan2.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atan2Docs = void 0;
+const atan2Docs = exports.atan2Docs = {
+  name: 'atan2',
+  category: 'Trigonometry',
+  syntax: ['atan2(y, x)'],
+  description: 'Computes the principal value of the arc tangent of y/x in radians.',
+  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],
+  seealso: ['sin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..9a40ab9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/atanh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.atanhDocs = void 0;
+const atanhDocs = exports.atanhDocs = {
+  name: 'atanh',
+  category: 'Trigonometry',
+  syntax: ['atanh(x)'],
+  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',
+  examples: ['atanh(0.5)'],
+  seealso: ['acosh', 'asinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js
new file mode 100644
index 0000000..1d03c53
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cos.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cosDocs = void 0;
+const cosDocs = exports.cosDocs = {
+  name: 'cos',
+  category: 'Trigonometry',
+  syntax: ['cos(x)'],
+  description: 'Compute the cosine of x in radians.',
+  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['acos', 'sin', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..8c4974f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cosh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.coshDocs = void 0;
+const coshDocs = exports.coshDocs = {
+  name: 'cosh',
+  category: 'Trigonometry',
+  syntax: ['cosh(x)'],
+  description: 'Compute the hyperbolic cosine of x in radians.',
+  examples: ['cosh(0.5)'],
+  seealso: ['sinh', 'tanh', 'coth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js
new file mode 100644
index 0000000..dc6d236
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/cot.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cotDocs = void 0;
+const cotDocs = exports.cotDocs = {
+  name: 'cot',
+  category: 'Trigonometry',
+  syntax: ['cot(x)'],
+  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',
+  examples: ['cot(2)', '1 / tan(2)'],
+  seealso: ['sec', 'csc', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js
new file mode 100644
index 0000000..9befa09
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/coth.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cothDocs = void 0;
+const cothDocs = exports.cothDocs = {
+  name: 'coth',
+  category: 'Trigonometry',
+  syntax: ['coth(x)'],
+  description: 'Compute the hyperbolic cotangent of x in radians.',
+  examples: ['coth(2)', '1 / tanh(2)'],
+  seealso: ['sech', 'csch', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js
new file mode 100644
index 0000000..ef78466
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csc.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cscDocs = void 0;
+const cscDocs = exports.cscDocs = {
+  name: 'csc',
+  category: 'Trigonometry',
+  syntax: ['csc(x)'],
+  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',
+  examples: ['csc(2)', '1 / sin(2)'],
+  seealso: ['sec', 'cot', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js
new file mode 100644
index 0000000..632d002
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/csch.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cschDocs = void 0;
+const cschDocs = exports.cschDocs = {
+  name: 'csch',
+  category: 'Trigonometry',
+  syntax: ['csch(x)'],
+  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',
+  examples: ['csch(2)', '1 / sinh(2)'],
+  seealso: ['sech', 'coth', 'sinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js
new file mode 100644
index 0000000..5012d7b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sec.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.secDocs = void 0;
+const secDocs = exports.secDocs = {
+  name: 'sec',
+  category: 'Trigonometry',
+  syntax: ['sec(x)'],
+  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',
+  examples: ['sec(2)', '1 / cos(2)'],
+  seealso: ['cot', 'csc', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js
new file mode 100644
index 0000000..8eda9d2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sech.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sechDocs = void 0;
+const sechDocs = exports.sechDocs = {
+  name: 'sech',
+  category: 'Trigonometry',
+  syntax: ['sech(x)'],
+  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',
+  examples: ['sech(2)', '1 / cosh(2)'],
+  seealso: ['coth', 'csch', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js
new file mode 100644
index 0000000..ca704e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sin.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinDocs = void 0;
+const sinDocs = exports.sinDocs = {
+  name: 'sin',
+  category: 'Trigonometry',
+  syntax: ['sin(x)'],
+  description: 'Compute the sine of x in radians.',
+  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['asin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..df0303a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/sinh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.sinhDocs = void 0;
+const sinhDocs = exports.sinhDocs = {
+  name: 'sinh',
+  category: 'Trigonometry',
+  syntax: ['sinh(x)'],
+  description: 'Compute the hyperbolic sine of x in radians.',
+  examples: ['sinh(0.5)'],
+  seealso: ['cosh', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js
new file mode 100644
index 0000000..ab89970
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tan.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanDocs = void 0;
+const tanDocs = exports.tanDocs = {
+  name: 'tan',
+  category: 'Trigonometry',
+  syntax: ['tan(x)'],
+  description: 'Compute the tangent of x in radians.',
+  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],
+  seealso: ['atan', 'sin', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..6c677d8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/trigonometry/tanh.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tanhDocs = void 0;
+const tanhDocs = exports.tanhDocs = {
+  name: 'tanh',
+  category: 'Trigonometry',
+  syntax: ['tanh(x)'],
+  description: 'Compute the hyperbolic tangent of x in radians.',
+  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],
+  seealso: ['sinh', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js
new file mode 100644
index 0000000..c7c20f0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/to.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toDocs = void 0;
+const toDocs = exports.toDocs = {
+  name: 'to',
+  category: 'Units',
+  syntax: ['x to unit', 'to(x, unit)'],
+  description: 'Change the unit of a value.',
+  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/toBest.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/toBest.js
new file mode 100644
index 0000000..d50ff54
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/units/toBest.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toBestDocs = void 0;
+const toBestDocs = exports.toBestDocs = {
+  name: 'toBest',
+  category: 'Units',
+  syntax: ['toBest(x)', 'toBest(x, unitList)', 'toBest(x, unitList, options)'],
+  description: 'Converts to the most appropriate display unit.',
+  examples: ['toBest(unit(5000, "m"))', 'toBest(unit(3500000, "W"))', 'toBest(unit(0.000000123, "A"))', 'toBest(unit(10, "m"), "cm")', 'toBest(unit(10, "m"), "mm,km", {offset: 1.5})'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js
new file mode 100644
index 0000000..fe741e2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/bin.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.binDocs = void 0;
+const binDocs = exports.binDocs = {
+  name: 'bin',
+  category: 'Utils',
+  syntax: ['bin(value)'],
+  description: 'Format a number as binary',
+  examples: ['bin(2)'],
+  seealso: ['oct', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js
new file mode 100644
index 0000000..154ef8b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/clone.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cloneDocs = void 0;
+const cloneDocs = exports.cloneDocs = {
+  name: 'clone',
+  category: 'Utils',
+  syntax: ['clone(x)'],
+  description: 'Clone a variable. Creates a copy of primitive variables, and a deep copy of matrices',
+  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone("hello world")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js
new file mode 100644
index 0000000..283dfb5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/format.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.formatDocs = void 0;
+const formatDocs = exports.formatDocs = {
+  name: 'format',
+  category: 'Utils',
+  syntax: ['format(value)', 'format(value, precision)'],
+  description: 'Format a value of any type as string.',
+  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],
+  seealso: ['print']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..9026b05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hasNumericValue.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hasNumericValueDocs = void 0;
+const hasNumericValueDocs = exports.hasNumericValueDocs = {
+  name: 'hasNumericValue',
+  category: 'Utils',
+  syntax: ['hasNumericValue(x)'],
+  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',
+  examples: ['hasNumericValue(2)', 'hasNumericValue("2")', 'isNumeric("2")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js
new file mode 100644
index 0000000..b5733cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/hex.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.hexDocs = void 0;
+const hexDocs = exports.hexDocs = {
+  name: 'hex',
+  category: 'Utils',
+  syntax: ['hex(value)'],
+  description: 'Format a number as hexadecimal',
+  examples: ['hex(240)'],
+  seealso: ['bin', 'oct']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js
new file mode 100644
index 0000000..75108bc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isInteger.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerDocs = void 0;
+const isIntegerDocs = exports.isIntegerDocs = {
+  name: 'isInteger',
+  category: 'Utils',
+  syntax: ['isInteger(x)'],
+  description: 'Test whether a value is an integer number.',
+  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js
new file mode 100644
index 0000000..c1c2060
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNaN.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNaNDocs = void 0;
+const isNaNDocs = exports.isNaNDocs = {
+  name: 'isNaN',
+  category: 'Utils',
+  syntax: ['isNaN(x)'],
+  description: 'Test whether a value is NaN (not a number)',
+  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js
new file mode 100644
index 0000000..d6ce6be
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNegative.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNegativeDocs = void 0;
+const isNegativeDocs = exports.isNegativeDocs = {
+  name: 'isNegative',
+  category: 'Utils',
+  syntax: ['isNegative(x)'],
+  description: 'Test whether a value is negative: smaller than zero.',
+  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js
new file mode 100644
index 0000000..669e126
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isNumeric.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isNumericDocs = void 0;
+const isNumericDocs = exports.isNumericDocs = {
+  name: 'isNumeric',
+  category: 'Utils',
+  syntax: ['isNumeric(x)'],
+  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',
+  examples: ['isNumeric(2)', 'isNumeric("2")', 'hasNumericValue("2")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js
new file mode 100644
index 0000000..5d0903c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPositive.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPositiveDocs = void 0;
+const isPositiveDocs = exports.isPositiveDocs = {
+  name: 'isPositive',
+  category: 'Utils',
+  syntax: ['isPositive(x)'],
+  description: 'Test whether a value is positive: larger than zero.',
+  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js
new file mode 100644
index 0000000..06c8bbf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isPrime.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isPrimeDocs = void 0;
+const isPrimeDocs = exports.isPrimeDocs = {
+  name: 'isPrime',
+  category: 'Utils',
+  syntax: ['isPrime(x)'],
+  description: 'Test whether a value is prime: has no divisors other than itself and one.',
+  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js
new file mode 100644
index 0000000..ecd3ed1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/isZero.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isZeroDocs = void 0;
+const isZeroDocs = exports.isZeroDocs = {
+  name: 'isZero',
+  category: 'Utils',
+  syntax: ['isZero(x)'],
+  description: 'Test whether a value is zero.',
+  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js
new file mode 100644
index 0000000..00ff3b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/numeric.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.numericDocs = void 0;
+const numericDocs = exports.numericDocs = {
+  name: 'numeric',
+  category: 'Utils',
+  syntax: ['numeric(x)'],
+  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.',
+  examples: ['numeric("4")', 'numeric("4", "number")', 'numeric("4", "bigint")', 'numeric("4", "BigNumber")', 'numeric("4", "Fraction")', 'numeric(4, "Fraction")', 'numeric(fraction(2, 5), "number")'],
+  seealso: ['number', 'bigint', 'fraction', 'bignumber', 'string', 'format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js
new file mode 100644
index 0000000..f34b41f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/oct.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.octDocs = void 0;
+const octDocs = exports.octDocs = {
+  name: 'oct',
+  category: 'Utils',
+  syntax: ['oct(value)'],
+  description: 'Format a number as octal',
+  examples: ['oct(56)'],
+  seealso: ['bin', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js
new file mode 100644
index 0000000..cfdcef9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/print.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printDocs = void 0;
+const printDocs = exports.printDocs = {
+  name: 'print',
+  category: 'Utils',
+  syntax: ['print(template, values)', 'print(template, values, precision)'],
+  description: 'Interpolate values into a string template.',
+  examples: ['print("Lucy is $age years old", {age: 5})', 'print("The value of pi is $pi", {pi: pi}, 3)', 'print("Hello, $user.name!", {user: {name: "John"}})', 'print("Values: $1, $2, $3", [6, 9, 4])'],
+  seealso: ['format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js
new file mode 100644
index 0000000..a9a8ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/embeddedDocs/function/utils/typeOf.js
@@ -0,0 +1,14 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.typeOfDocs = void 0;
+const typeOfDocs = exports.typeOfDocs = {
+  name: 'typeOf',
+  category: 'Utils',
+  syntax: ['typeOf(x)'],
+  description: 'Get the type of a variable.',
+  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf("hello world")'],
+  seealso: ['getMatrixDataType']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/compile.js b/node_modules/mathjs/lib/cjs/expression/function/compile.js
new file mode 100644
index 0000000..14a7e02
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/compile.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompile = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'compile';
+const dependencies = ['typed', 'parse'];
+const createCompile = exports.createCompile = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    parse
+  } = _ref;
+  /**
+   * Parse and compile an expression.
+   * Returns a an object with a function `evaluate([scope])` to evaluate the
+   * compiled expression.
+   *
+   * Syntax:
+   *
+   *     math.compile(expr)                       // returns one node
+   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
+   *
+   * Examples:
+   *
+   *     const code1 = math.compile('sqrt(3^2 + 4^2)')
+   *     code1.evaluate() // 5
+   *
+   *     let scope = {a: 3, b: 4}
+   *     const code2 = math.compile('a * b') // 12
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].evaluate() // 12
+   *
+   * See also:
+   *
+   *    parse, evaluate
+   *
+   * @param {string | string[] | Array | Matrix} expr
+   *            The expression to be compiled
+   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code
+   *            An object with the compiled expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function (expr) {
+      return parse(expr).compile();
+    },
+    'Array | Matrix': function (expr) {
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile();
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/evaluate.js b/node_modules/mathjs/lib/cjs/expression/function/evaluate.js
new file mode 100644
index 0000000..17e4b9d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/evaluate.js
@@ -0,0 +1,74 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEvaluate = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _map = require("../../utils/map.js");
+const name = 'evaluate';
+const dependencies = ['typed', 'parse'];
+const createEvaluate = exports.createEvaluate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    parse
+  } = _ref;
+  /**
+   * Evaluate an expression.
+   *
+   * The expression parser does not use JavaScript. Its syntax is close
+   * to JavaScript but more suited for mathematical expressions.
+   * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn
+   * the syntax and get an overview of the exact differences from JavaScript.
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.evaluate(expr)
+   *     math.evaluate(expr, scope)
+   *     math.evaluate([expr1, expr2, expr3, ...])
+   *     math.evaluate([expr1, expr2, expr3, ...], scope)
+   *
+   * Example:
+   *
+   *     math.evaluate('(2+3)/4')                // 1.25
+   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *     math.evaluate('sqrt(-4)')               // 2i
+   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]
+   *
+   *     let scope = {a:3, b:4}
+   *     math.evaluate('a * b', scope)           // 12
+   *
+   * See also:
+   *
+   *    parse, compile
+   *
+   * @param {string | string[] | Matrix} expr   The expression to be evaluated
+   * @param {Object} [scope]                    Scope to read/write variables
+   * @return {*} The result of the expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function (expr) {
+      const scope = (0, _map.createEmptyMap)();
+      return parse(expr).compile().evaluate(scope);
+    },
+    'string, Map | Object': function (expr, scope) {
+      return parse(expr).compile().evaluate(scope);
+    },
+    'Array | Matrix': function (expr) {
+      const scope = (0, _map.createEmptyMap)();
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    },
+    'Array | Matrix, Map | Object': function (expr, scope) {
+      return (0, _collection.deepMap)(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/help.js b/node_modules/mathjs/lib/cjs/expression/function/help.js
new file mode 100644
index 0000000..1d8948b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/help.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHelp = void 0;
+var _factory = require("../../utils/factory.js");
+var _customs = require("../../utils/customs.js");
+var _embeddedDocs = require("../embeddedDocs/embeddedDocs.js");
+var _object = require("../../utils/object.js");
+const name = 'help';
+const dependencies = ['typed', 'mathWithTransform', 'Help'];
+const createHelp = exports.createHelp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    mathWithTransform,
+    Help
+  } = _ref;
+  /**
+   * Retrieve help on a function or data type.
+   * Help files are retrieved from the embedded documentation in math.docs.
+   *
+   * Syntax:
+   *
+   *    math.help(search)
+   *
+   * Examples:
+   *
+   *    console.log(math.help('sin').toString())
+   *    console.log(math.help(math.add).toString())
+   *    console.log(math.help(math.add).toJSON())
+   *
+   * @param {Function | string | Object} search   A function or function name
+   *                                              for which to get help
+   * @return {Help} A help object
+   */
+  return typed(name, {
+    any: function (search) {
+      let prop;
+      let searchName = search;
+      if (typeof search !== 'string') {
+        for (prop in mathWithTransform) {
+          // search in functions and constants
+          if ((0, _object.hasOwnProperty)(mathWithTransform, prop) && search === mathWithTransform[prop]) {
+            searchName = prop;
+            break;
+          }
+        }
+
+        /* TODO: implement help for data types
+         if (!text) {
+         // search data type
+         for (prop in math.type) {
+         if (hasOwnProperty(math, prop)) {
+         if (search === math.type[prop]) {
+         text = prop
+         break
+         }
+         }
+         }
+         }
+         */
+      }
+      const doc = (0, _customs.getSafeProperty)(_embeddedDocs.embeddedDocs, searchName);
+      if (!doc) {
+        const searchText = typeof searchName === 'function' ? searchName.name : searchName;
+        throw new Error('No documentation found on "' + searchText + '"');
+      }
+      return new Help(doc);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/function/parser.js b/node_modules/mathjs/lib/cjs/expression/function/parser.js
new file mode 100644
index 0000000..34b6949
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/function/parser.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParser = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'parser';
+const dependencies = ['typed', 'Parser'];
+const createParser = exports.createParser = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Parser
+  } = _ref;
+  /**
+   * Create a `math.Parser` object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.
+   *
+   * Syntax:
+   *
+   *    math.parser()
+   *
+   * Examples:
+   *
+   *     const parser = new math.parser()
+   *
+   *     // evaluate expressions
+   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
+   *     const b = parser.evaluate('sqrt(-4)')        // 2i
+   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm
+   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476
+   *
+   *     // define variables and functions
+   *     parser.evaluate('x = 7 / 2')             // 3.5
+   *     parser.evaluate('x + 3')                 // 6.5
+   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)
+   *     parser.evaluate('f(2, 3)')               // 8
+   *
+   *     // get and set variables and functions
+   *     const x = parser.get('x')                // 3.5
+   *     const f = parser.get('f')                // function
+   *     const g = f(3, 2)                        // 9
+   *     parser.set('h', 500)
+   *     const i = parser.evaluate('h / 2')       // 250
+   *     parser.set('hello', function (name) {
+   *       return 'hello, ' + name + '!'
+   *     })
+   *     parser.evaluate('hello("user")')         // "hello, user!"
+   *
+   *     // clear defined functions and variables
+   *     parser.clear()
+   *
+   * See also:
+   *
+   *    evaluate, compile, parse
+   *
+   * @return {Parser} Parser
+   */
+  return typed(name, {
+    '': function () {
+      return new Parser();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/keywords.js b/node_modules/mathjs/lib/cjs/expression/keywords.js
new file mode 100644
index 0000000..e89262f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/keywords.js
@@ -0,0 +1,8 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.keywords = void 0;
+// Reserved keywords not allowed to use in the parser
+const keywords = exports.keywords = new Set(['end']);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js b/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js
new file mode 100644
index 0000000..b916377
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/AccessorNode.js
@@ -0,0 +1,196 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAccessorNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _customs = require("../../utils/customs.js");
+var _factory = require("../../utils/factory.js");
+var _access = require("./utils/access.js");
+const name = 'AccessorNode';
+const dependencies = ['subset', 'Node'];
+const createAccessorNode = exports.createAccessorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    subset,
+    Node
+  } = _ref;
+  const access = (0, _access.accessFactory)({
+    subset
+  });
+
+  /**
+   * Are parenthesis needed?
+   * @private
+   */
+  function needParenthesis(node) {
+    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?
+    return !((0, _is.isAccessorNode)(node) || (0, _is.isArrayNode)(node) || (0, _is.isConstantNode)(node) || (0, _is.isFunctionNode)(node) || (0, _is.isObjectNode)(node) || (0, _is.isParenthesisNode)(node) || (0, _is.isSymbolNode)(node));
+  }
+  class AccessorNode extends Node {
+    /**
+     * @constructor AccessorNode
+     * @extends {Node}
+     * Access an object property or get a matrix subset
+     *
+     * @param {Node} object                 The object from which to retrieve
+     *                                      a property or subset.
+     * @param {IndexNode} index             IndexNode containing ranges
+     */
+    constructor(object, index) {
+      super();
+      if (!(0, _is.isNode)(object)) {
+        throw new TypeError('Node expected for parameter "object"');
+      }
+      if (!(0, _is.isIndexNode)(index)) {
+        throw new TypeError('IndexNode expected for parameter "index"');
+      }
+      this.object = object;
+      this.index = index;
+    }
+
+    // readonly property name
+    get name() {
+      if (this.index) {
+        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+      } else {
+        return this.object.name || '';
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isAccessorNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalObject = this.object._compile(math, argNames);
+      const evalIndex = this.index._compile(math, argNames);
+      if (this.index.isObjectProperty()) {
+        const prop = this.index.getObjectProperty();
+        return function evalAccessorNode(scope, args, context) {
+          // get a property from an object evaluated using the scope.
+          return (0, _customs.getSafeProperty)(evalObject(scope, args, context), prop);
+        };
+      } else {
+        return function evalAccessorNode(scope, args, context) {
+          const object = evalObject(scope, args, context);
+          // we pass just object here instead of context:
+          const index = evalIndex(scope, args, object);
+          return access(object, index);
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.object, 'object', this);
+      callback(this.index, 'index', this);
+    }
+
+    /**
+     * Create a new AccessorNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {AccessorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {AccessorNode}
+     */
+    clone() {
+      return new AccessorNode(this.object, this.index);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toString(options) {
+      let object = this.object.toString(options);
+      if (needParenthesis(this.object)) {
+        object = '(' + object + ')';
+      }
+      return object + this.index.toString(options);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toHTML(options) {
+      let object = this.object.toHTML(options);
+      if (needParenthesis(this.object)) {
+        object = '<span class="math-parenthesis math-round-parenthesis">(</span>' + object + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return object + this.index.toHTML(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toTex(options) {
+      let object = this.object.toTex(options);
+      if (needParenthesis(this.object)) {
+        object = '\\left(\' + object + \'\\right)';
+      }
+      return object + this.index.toTex(options);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        object: this.object,
+        index: this.index
+      };
+    }
+
+    /**
+     * Instantiate an AccessorNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "AccessorNode", object: ..., index: ...}`,
+     *     where mathjs is optional
+     * @returns {AccessorNode}
+     */
+    static fromJSON(json) {
+      return new AccessorNode(json.object, json.index);
+    }
+  }
+  (0, _defineProperty2.default)(AccessorNode, "name", name);
+  return AccessorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js b/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js
new file mode 100644
index 0000000..1392b3e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ArrayNode.js
@@ -0,0 +1,183 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createArrayNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'ArrayNode';
+const dependencies = ['Node'];
+const createArrayNode = exports.createArrayNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  class ArrayNode extends Node {
+    /**
+     * @constructor ArrayNode
+     * @extends {Node}
+     * Holds an 1-dimensional array with items
+     * @param {Node[]} [items]   1 dimensional array with items
+     */
+    constructor(items) {
+      super();
+      this.items = items || [];
+
+      // validate input
+      if (!Array.isArray(this.items) || !this.items.every(_is.isNode)) {
+        throw new TypeError('Array containing Nodes expected');
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isArrayNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalItems = (0, _array.map)(this.items, function (item) {
+        return item._compile(math, argNames);
+      });
+      const asMatrix = math.config.matrix !== 'Array';
+      if (asMatrix) {
+        const matrix = math.matrix;
+        return function evalArrayNode(scope, args, context) {
+          return matrix((0, _array.map)(evalItems, function (evalItem) {
+            return evalItem(scope, args, context);
+          }));
+        };
+      } else {
+        return function evalArrayNode(scope, args, context) {
+          return (0, _array.map)(evalItems, function (evalItem) {
+            return evalItem(scope, args, context);
+          });
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (let i = 0; i < this.items.length; i++) {
+        const node = this.items[i];
+        callback(node, 'items[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new ArrayNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ArrayNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const items = [];
+      for (let i = 0; i < this.items.length; i++) {
+        items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));
+      }
+      return new ArrayNode(items);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ArrayNode}
+     */
+    clone() {
+      return new ArrayNode(this.items.slice(0));
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      const items = this.items.map(function (node) {
+        return node.toString(options);
+      });
+      return '[' + items.join(', ') + ']';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        items: this.items
+      };
+    }
+
+    /**
+     * Instantiate an ArrayNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ArrayNode", items: [...]}`,
+     *                       where mathjs is optional
+     * @returns {ArrayNode}
+     */
+    static fromJSON(json) {
+      return new ArrayNode(json.items);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      const items = this.items.map(function (node) {
+        return node.toHTML(options);
+      });
+      return '<span class="math-parenthesis math-square-parenthesis">[</span>' + items.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      function itemsToTex(items, nested) {
+        const mixedItems = items.some(_is.isArrayNode) && !items.every(_is.isArrayNode);
+        const itemsFormRow = nested || mixedItems;
+        const itemSep = itemsFormRow ? '&' : '\\\\';
+        const itemsTex = items.map(function (node) {
+          if (node.items) {
+            return itemsToTex(node.items, !nested);
+          } else {
+            return node.toTex(options);
+          }
+        }).join(itemSep);
+        return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\begin{bmatrix}' + itemsTex + '\\end{bmatrix}' : itemsTex;
+      }
+      return itemsToTex(this.items, false);
+    }
+  }
+  (0, _defineProperty2.default)(ArrayNode, "name", name);
+  return ArrayNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js b/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js
new file mode 100644
index 0000000..ec1a7c2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/AssignmentNode.js
@@ -0,0 +1,313 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAssignmentNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _customs = require("../../utils/customs.js");
+var _factory = require("../../utils/factory.js");
+var _access = require("./utils/access.js");
+var _assign = require("./utils/assign.js");
+var _operators = require("../operators.js");
+const name = 'AssignmentNode';
+const dependencies = ['subset', '?matrix',
+// FIXME: should not be needed at all, should be handled by subset
+'Node'];
+const createAssignmentNode = exports.createAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    subset,
+    matrix,
+    Node
+  } = _ref;
+  const access = (0, _access.accessFactory)({
+    subset
+  });
+  const assign = (0, _assign.assignFactory)({
+    subset,
+    matrix
+  });
+
+  /*
+   * Is parenthesis needed?
+   * @param {node} node
+   * @param {string} [parenthesis='keep']
+   * @param {string} implicit
+   * @private
+   */
+  function needParenthesis(node, parenthesis, implicit) {
+    if (!parenthesis) {
+      parenthesis = 'keep';
+    }
+    const precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);
+    const exprPrecedence = (0, _operators.getPrecedence)(node.value, parenthesis, implicit);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  class AssignmentNode extends Node {
+    /**
+     * @constructor AssignmentNode
+     * @extends {Node}
+     *
+     * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or
+     * replace a subset of a matrix like `A[2,2]=42`.
+     *
+     * Syntax:
+     *
+     *     new AssignmentNode(symbol, value)
+     *     new AssignmentNode(object, index, value)
+     *
+     * Usage:
+     *
+     *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))  // a=2
+     *    new AssignmentNode(new SymbolNode('a'),
+     *                       new IndexNode('b'),
+     *                       new ConstantNode(2))   // a.b=2
+     *    new AssignmentNode(new SymbolNode('a'),
+     *                       new IndexNode(1, 2),
+     *                       new ConstantNode(3))  // a[1,2]=3
+     *
+     * @param {SymbolNode | AccessorNode} object
+     *     Object on which to assign a value
+     * @param {IndexNode} [index=null]
+     *     Index, property name or matrix index. Optional. If not provided
+     *     and `object` is a SymbolNode, the property is assigned to the
+     *     global scope.
+     * @param {Node} value
+     *     The value to be assigned
+     */
+    constructor(object, index, value) {
+      super();
+      this.object = object;
+      this.index = value ? index : null;
+      this.value = value || index;
+
+      // validate input
+      if (!(0, _is.isSymbolNode)(object) && !(0, _is.isAccessorNode)(object)) {
+        throw new TypeError('SymbolNode or AccessorNode expected as "object"');
+      }
+      if ((0, _is.isSymbolNode)(object) && object.name === 'end') {
+        throw new Error('Cannot assign to symbol "end"');
+      }
+      if (this.index && !(0, _is.isIndexNode)(this.index)) {
+        // index is optional
+        throw new TypeError('IndexNode expected as "index"');
+      }
+      if (!(0, _is.isNode)(this.value)) {
+        throw new TypeError('Node expected as "value"');
+      }
+    }
+
+    // class name for typing purposes:
+
+    // readonly property name
+    get name() {
+      if (this.index) {
+        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+      } else {
+        return this.object.name || '';
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isAssignmentNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalObject = this.object._compile(math, argNames);
+      const evalIndex = this.index ? this.index._compile(math, argNames) : null;
+      const evalValue = this.value._compile(math, argNames);
+      const name = this.object.name;
+      if (!this.index) {
+        // apply a variable to the scope, for example `a=2`
+        if (!(0, _is.isSymbolNode)(this.object)) {
+          throw new TypeError('SymbolNode expected as object');
+        }
+        return function evalAssignmentNode(scope, args, context) {
+          const value = evalValue(scope, args, context);
+          scope.set(name, value);
+          return value;
+        };
+      } else if (this.index.isObjectProperty()) {
+        // apply an object property for example `a.b=2`
+        const prop = this.index.getObjectProperty();
+        return function evalAssignmentNode(scope, args, context) {
+          const object = evalObject(scope, args, context);
+          const value = evalValue(scope, args, context);
+          (0, _customs.setSafeProperty)(object, prop, value);
+          return value;
+        };
+      } else if ((0, _is.isSymbolNode)(this.object)) {
+        // update a matrix subset, for example `a[2]=3`
+        return function evalAssignmentNode(scope, args, context) {
+          const childObject = evalObject(scope, args, context);
+          const value = evalValue(scope, args, context);
+          // Important:  we pass childObject instead of context:
+          const index = evalIndex(scope, args, childObject);
+          scope.set(name, assign(childObject, index, value));
+          return value;
+        };
+      } else {
+        // isAccessorNode(node.object) === true
+        // update a matrix subset, for example `a.b[2]=3`
+
+        // we will not use the compile function of the AccessorNode, but
+        // compile it ourselves here as we need the parent object of the
+        // AccessorNode:
+        // wee need to apply the updated object to parent object
+        const evalParentObject = this.object.object._compile(math, argNames);
+        if (this.object.index.isObjectProperty()) {
+          const parentProp = this.object.index.getObjectProperty();
+          return function evalAssignmentNode(scope, args, context) {
+            const parent = evalParentObject(scope, args, context);
+            const childObject = (0, _customs.getSafeProperty)(parent, parentProp);
+            // Important: we pass childObject instead of context:
+            const index = evalIndex(scope, args, childObject);
+            const value = evalValue(scope, args, context);
+            (0, _customs.setSafeProperty)(parent, parentProp, assign(childObject, index, value));
+            return value;
+          };
+        } else {
+          // if some parameters use the 'end' parameter, we need to calculate
+          // the size
+          const evalParentIndex = this.object.index._compile(math, argNames);
+          return function evalAssignmentNode(scope, args, context) {
+            const parent = evalParentObject(scope, args, context);
+            // Important: we pass parent instead of context:
+            const parentIndex = evalParentIndex(scope, args, parent);
+            const childObject = access(parent, parentIndex);
+            // Important:  we pass childObject instead of context
+            const index = evalIndex(scope, args, childObject);
+            const value = evalValue(scope, args, context);
+            assign(parent, parentIndex, assign(childObject, index, value));
+            return value;
+          };
+        }
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.object, 'object', this);
+      if (this.index) {
+        callback(this.index, 'index', this);
+      }
+      callback(this.value, 'value', this);
+    }
+
+    /**
+     * Create a new AssignmentNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {AssignmentNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const object = this._ifNode(callback(this.object, 'object', this));
+      const index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;
+      const value = this._ifNode(callback(this.value, 'value', this));
+      return new AssignmentNode(object, index, value);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {AssignmentNode}
+     */
+    clone() {
+      return new AssignmentNode(this.object, this.index, this.value);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toString(options) {
+      const object = this.object.toString(options);
+      const index = this.index ? this.index.toString(options) : '';
+      let value = this.value.toString(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = '(' + value + ')';
+      }
+      return object + index + ' = ' + value;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        object: this.object,
+        index: this.index,
+        value: this.value
+      };
+    }
+
+    /**
+     * Instantiate an AssignmentNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "AssignmentNode", object: ..., index: ..., value: ...}`,
+     *     where mathjs is optional
+     * @returns {AssignmentNode}
+     */
+    static fromJSON(json) {
+      return new AssignmentNode(json.object, json.index, json.value);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toHTML(options) {
+      const object = this.object.toHTML(options);
+      const index = this.index ? this.index.toHTML(options) : '';
+      let value = this.value.toHTML(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = '<span class="math-paranthesis math-round-parenthesis">(</span>' + value + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+      }
+      return object + index + '<span class="math-operator math-assignment-operator ' + 'math-variable-assignment-operator math-binary-operator">=</span>' + value;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toTex(options) {
+      const object = this.object.toTex(options);
+      const index = this.index ? this.index.toTex(options) : '';
+      let value = this.value.toTex(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = `\\left(${value}\\right)`;
+      }
+      return object + index + '=' + value;
+    }
+  }
+  (0, _defineProperty2.default)(AssignmentNode, "name", name);
+  return AssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js b/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js
new file mode 100644
index 0000000..38b32e4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/BlockNode.js
@@ -0,0 +1,192 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBlockNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'BlockNode';
+const dependencies = ['ResultSet', 'Node'];
+const createBlockNode = exports.createBlockNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    ResultSet,
+    Node
+  } = _ref;
+  class BlockNode extends Node {
+    /**
+     * @constructor BlockNode
+     * @extends {Node}
+     * Holds a set with blocks
+     * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks
+     *            An array with blocks, where a block is constructed as an
+     *            Object with properties block, which is a Node, and visible,
+     *            which is a boolean. The property visible is optional and
+     *            is true by default
+     */
+    constructor(blocks) {
+      super();
+      // validate input, copy blocks
+      if (!Array.isArray(blocks)) throw new Error('Array expected');
+      this.blocks = blocks.map(function (block) {
+        const node = block && block.node;
+        const visible = block && block.visible !== undefined ? block.visible : true;
+        if (!(0, _is.isNode)(node)) throw new TypeError('Property "node" must be a Node');
+        if (typeof visible !== 'boolean') {
+          throw new TypeError('Property "visible" must be a boolean');
+        }
+        return {
+          node,
+          visible
+        };
+      });
+    }
+    get type() {
+      return name;
+    }
+    get isBlockNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalBlocks = (0, _array.map)(this.blocks, function (block) {
+        return {
+          evaluate: block.node._compile(math, argNames),
+          visible: block.visible
+        };
+      });
+      return function evalBlockNodes(scope, args, context) {
+        const results = [];
+        (0, _array.forEach)(evalBlocks, function evalBlockNode(block) {
+          const result = block.evaluate(scope, args, context);
+          if (block.visible) {
+            results.push(result);
+          }
+        });
+        return new ResultSet(results);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child blocks of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (let i = 0; i < this.blocks.length; i++) {
+        callback(this.blocks[i].node, 'blocks[' + i + '].node', this);
+      }
+    }
+
+    /**
+     * Create a new BlockNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {BlockNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const blocks = [];
+      for (let i = 0; i < this.blocks.length; i++) {
+        const block = this.blocks[i];
+        const node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));
+        blocks[i] = {
+          node,
+          visible: block.visible
+        };
+      }
+      return new BlockNode(blocks);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {BlockNode}
+     */
+    clone() {
+      const blocks = this.blocks.map(function (block) {
+        return {
+          node: block.node,
+          visible: block.visible
+        };
+      });
+      return new BlockNode(blocks);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toString(options) + (param.visible ? '' : ';');
+      }).join('\n');
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        blocks: this.blocks
+      };
+    }
+
+    /**
+     * Instantiate an BlockNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "BlockNode", blocks: [{node: ..., visible: false}, ...]}`,
+     *     where mathjs is optional
+     * @returns {BlockNode}
+     */
+    static fromJSON(json) {
+      return new BlockNode(json.blocks);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toHTML(options) + (param.visible ? '' : '<span class="math-separator">;</span>');
+      }).join('<span class="math-separator"><br /></span>');
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toTex(options) + (param.visible ? '' : ';');
+      }).join('\\;\\;\n');
+    }
+  }
+  (0, _defineProperty2.default)(BlockNode, "name", name);
+  return BlockNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js b/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js
new file mode 100644
index 0000000..0839a04
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ConditionalNode.js
@@ -0,0 +1,232 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConditionalNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _operators = require("../operators.js");
+const name = 'ConditionalNode';
+const dependencies = ['Node'];
+const createConditionalNode = exports.createConditionalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  /**
+   * Test whether a condition is met
+   * @param {*} condition
+   * @returns {boolean} true if condition is true or non-zero, else false
+   */
+  function testCondition(condition) {
+    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {
+      return !!condition;
+    }
+    if (condition) {
+      if ((0, _is.isBigNumber)(condition)) {
+        return !condition.isZero();
+      }
+      if ((0, _is.isComplex)(condition)) {
+        return !!(condition.re || condition.im);
+      }
+      if ((0, _is.isUnit)(condition)) {
+        return !!condition.value;
+      }
+    }
+    if (condition === null || condition === undefined) {
+      return false;
+    }
+    throw new TypeError('Unsupported type of condition "' + (0, _is.typeOf)(condition) + '"');
+  }
+  class ConditionalNode extends Node {
+    /**
+     * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'
+     *
+     * @param {Node} condition   Condition, must result in a boolean
+     * @param {Node} trueExpr    Expression evaluated when condition is true
+     * @param {Node} falseExpr   Expression evaluated when condition is true
+     *
+     * @constructor ConditionalNode
+     * @extends {Node}
+     */
+    constructor(condition, trueExpr, falseExpr) {
+      super();
+      if (!(0, _is.isNode)(condition)) {
+        throw new TypeError('Parameter condition must be a Node');
+      }
+      if (!(0, _is.isNode)(trueExpr)) {
+        throw new TypeError('Parameter trueExpr must be a Node');
+      }
+      if (!(0, _is.isNode)(falseExpr)) {
+        throw new TypeError('Parameter falseExpr must be a Node');
+      }
+      this.condition = condition;
+      this.trueExpr = trueExpr;
+      this.falseExpr = falseExpr;
+    }
+    get type() {
+      return name;
+    }
+    get isConditionalNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalCondition = this.condition._compile(math, argNames);
+      const evalTrueExpr = this.trueExpr._compile(math, argNames);
+      const evalFalseExpr = this.falseExpr._compile(math, argNames);
+      return function evalConditionalNode(scope, args, context) {
+        return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.condition, 'condition', this);
+      callback(this.trueExpr, 'trueExpr', this);
+      callback(this.falseExpr, 'falseExpr', this);
+    }
+
+    /**
+     * Create a new ConditionalNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ConditionalNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ConditionalNode}
+     */
+    clone() {
+      return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);
+
+      // Enclose Arguments in parentheses if they are an OperatorNode
+      // or have lower or equal precedence
+      // NOTE: enclosing all OperatorNodes in parentheses is a decision
+      // purely based on aesthetics and readability
+      let condition = this.condition.toString(options);
+      const conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+        condition = '(' + condition + ')';
+      }
+      let trueExpr = this.trueExpr.toString(options);
+      const truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+        trueExpr = '(' + trueExpr + ')';
+      }
+      let falseExpr = this.falseExpr.toString(options);
+      const falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+        falseExpr = '(' + falseExpr + ')';
+      }
+      return condition + ' ? ' + trueExpr + ' : ' + falseExpr;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        condition: this.condition,
+        trueExpr: this.trueExpr,
+        falseExpr: this.falseExpr
+      };
+    }
+
+    /**
+     * Instantiate an ConditionalNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "ConditionalNode",
+     *      "condition": ...,
+     *      "trueExpr": ...,
+     *      "falseExpr": ...}
+     *     ```
+     *     where mathjs is optional
+     * @returns {ConditionalNode}
+     */
+    static fromJSON(json) {
+      return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);
+
+      // Enclose Arguments in parentheses if they are an OperatorNode
+      // or have lower or equal precedence
+      // NOTE: enclosing all OperatorNodes in parentheses is a decision
+      // purely based on aesthetics and readability
+      let condition = this.condition.toHTML(options);
+      const conditionPrecedence = (0, _operators.getPrecedence)(this.condition, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+        condition = '<span class="math-parenthesis math-round-parenthesis">(</span>' + condition + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      let trueExpr = this.trueExpr.toHTML(options);
+      const truePrecedence = (0, _operators.getPrecedence)(this.trueExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+        trueExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + trueExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      let falseExpr = this.falseExpr.toHTML(options);
+      const falsePrecedence = (0, _operators.getPrecedence)(this.falseExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+        falseExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + falseExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return condition + '<span class="math-operator math-conditional-operator">?</span>' + trueExpr + '<span class="math-operator math-conditional-operator">:</span>' + falseExpr;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      return '\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\quad{\\text{if }\\;' + this.condition.toTex(options) + '}\\\\{' + this.falseExpr.toTex(options) + '}, &\\quad{\\text{otherwise}}\\end{cases}';
+    }
+  }
+  (0, _defineProperty2.default)(ConditionalNode, "name", name);
+  return ConditionalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js b/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js
new file mode 100644
index 0000000..7c1bba0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ConstantNode.js
@@ -0,0 +1,186 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConstantNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _string = require("../../utils/string.js");
+var _is = require("../../utils/is.js");
+var _latex = require("../../utils/latex.js");
+var _factory = require("../../utils/factory.js");
+const name = 'ConstantNode';
+const dependencies = ['Node'];
+const createConstantNode = exports.createConstantNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  class ConstantNode extends Node {
+    /**
+     * A ConstantNode holds a constant value like a number or string.
+     *
+     * Usage:
+     *
+     *     new ConstantNode(2.3)
+     *     new ConstantNode('hello')
+     *
+     * @param {*} value    Value can be any type (number, BigNumber, bigint, string, ...)
+     * @constructor ConstantNode
+     * @extends {Node}
+     */
+    constructor(value) {
+      super();
+      this.value = value;
+    }
+    get type() {
+      return name;
+    }
+    get isConstantNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const value = this.value;
+      return function evalConstantNode() {
+        return value;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // nothing to do, we don't have any children
+    }
+
+    /**
+     * Create a new ConstantNode with children produced by the given callback.
+     * Trivial because there are no children.
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {ConstantNode} Returns a clone of the node
+     */
+    map(callback) {
+      return this.clone();
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ConstantNode}
+     */
+    clone() {
+      return new ConstantNode(this.value);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      return (0, _string.format)(this.value, options);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const value = this._toString(options);
+      switch ((0, _is.typeOf)(this.value)) {
+        case 'number':
+        case 'bigint':
+        case 'BigNumber':
+        case 'Fraction':
+          return '<span class="math-number">' + value + '</span>';
+        case 'string':
+          return '<span class="math-string">' + value + '</span>';
+        case 'boolean':
+          return '<span class="math-boolean">' + value + '</span>';
+        case 'null':
+          return '<span class="math-null-symbol">' + value + '</span>';
+        case 'undefined':
+          return '<span class="math-undefined">' + value + '</span>';
+        default:
+          return '<span class="math-symbol">' + value + '</span>';
+      }
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        value: this.value
+      };
+    }
+
+    /**
+     * Instantiate a ConstantNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "SymbolNode", value: 2.3}`,
+     *                       where mathjs is optional
+     * @returns {ConstantNode}
+     */
+    static fromJSON(json) {
+      return new ConstantNode(json.value);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const value = this._toString(options);
+      const type = (0, _is.typeOf)(this.value);
+      switch (type) {
+        case 'string':
+          return '\\mathtt{' + (0, _latex.escapeLatex)(value) + '}';
+        case 'number':
+        case 'BigNumber':
+          {
+            const finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+            if (!finite) {
+              return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
+            }
+            const index = value.toLowerCase().indexOf('e');
+            if (index !== -1) {
+              return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
+            }
+            return value;
+          }
+        case 'bigint':
+          {
+            return value.toString();
+          }
+        case 'Fraction':
+          return this.value.toLatex();
+        default:
+          return value;
+      }
+    }
+  }
+  (0, _defineProperty2.default)(ConstantNode, "name", name);
+  return ConstantNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js b/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js
new file mode 100644
index 0000000..152b562
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/FunctionAssignmentNode.js
@@ -0,0 +1,244 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFunctionAssignmentNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _keywords = require("../keywords.js");
+var _string = require("../../utils/string.js");
+var _array = require("../../utils/array.js");
+var _latex = require("../../utils/latex.js");
+var _operators = require("../operators.js");
+var _factory = require("../../utils/factory.js");
+const name = 'FunctionAssignmentNode';
+const dependencies = ['typed', 'Node'];
+const createFunctionAssignmentNode = exports.createFunctionAssignmentNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Node
+  } = _ref;
+  /**
+   * Is parenthesis needed?
+   * @param {Node} node
+   * @param {Object} parenthesis
+   * @param {string} implicit
+   * @private
+   */
+  function needParenthesis(node, parenthesis, implicit) {
+    const precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);
+    const exprPrecedence = (0, _operators.getPrecedence)(node.expr, parenthesis, implicit);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  class FunctionAssignmentNode extends Node {
+    /**
+     * @constructor FunctionAssignmentNode
+     * @extends {Node}
+     * Function assignment
+     *
+     * @param {string} name           Function name
+     * @param {string[] | Array.<{name: string, type: string}>} params
+     *                                Array with function parameter names, or an
+     *                                array with objects containing the name
+     *                                and type of the parameter
+     * @param {Node} expr             The function expression
+     */
+    constructor(name, params, expr) {
+      super();
+      // validate input
+      if (typeof name !== 'string') {
+        throw new TypeError('String expected for parameter "name"');
+      }
+      if (!Array.isArray(params)) {
+        throw new TypeError('Array containing strings or objects expected for parameter "params"');
+      }
+      if (!(0, _is.isNode)(expr)) {
+        throw new TypeError('Node expected for parameter "expr"');
+      }
+      if (_keywords.keywords.has(name)) {
+        throw new Error('Illegal function name, "' + name + '" is a reserved keyword');
+      }
+      const paramNames = new Set();
+      for (const param of params) {
+        const name = typeof param === 'string' ? param : param.name;
+        if (paramNames.has(name)) {
+          throw new Error(`Duplicate parameter name "${name}"`);
+        } else {
+          paramNames.add(name);
+        }
+      }
+      this.name = name;
+      this.params = params.map(function (param) {
+        return param && param.name || param;
+      });
+      this.types = params.map(function (param) {
+        return param && param.type || 'any';
+      });
+      this.expr = expr;
+    }
+    get type() {
+      return name;
+    }
+    get isFunctionAssignmentNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const childArgNames = Object.create(argNames);
+      (0, _array.forEach)(this.params, function (param) {
+        childArgNames[param] = true;
+      });
+
+      // compile the function expression with the child args
+      const expr = this.expr;
+      const evalExpr = expr._compile(math, childArgNames);
+      const name = this.name;
+      const params = this.params;
+      const signature = (0, _array.join)(this.types, ',');
+      const syntax = name + '(' + (0, _array.join)(this.params, ', ') + ')';
+      return function evalFunctionAssignmentNode(scope, args, context) {
+        const signatures = {};
+        signatures[signature] = function () {
+          const childArgs = Object.create(args);
+          for (let i = 0; i < params.length; i++) {
+            childArgs[params[i]] = arguments[i];
+          }
+          return evalExpr(scope, childArgs, context);
+        };
+        const fn = typed(name, signatures);
+        fn.syntax = syntax;
+        fn.expr = expr.toString();
+        scope.set(name, fn);
+        return fn;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.expr, 'expr', this);
+    }
+
+    /**
+     * Create a new FunctionAssignmentNode whose children are the results of
+     * calling the provided callback function for each child of the original
+     * node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {FunctionAssignmentNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const expr = this._ifNode(callback(this.expr, 'expr', this));
+      return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {FunctionAssignmentNode}
+     */
+    clone() {
+      return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);
+    }
+
+    /**
+     * get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      let expr = this.expr.toString(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = '(' + expr + ')';
+      }
+      return this.name + '(' + this.params.join(', ') + ') = ' + expr;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      const types = this.types;
+      return {
+        mathjs: name,
+        name: this.name,
+        params: this.params.map(function (param, index) {
+          return {
+            name: param,
+            type: types[index]
+          };
+        }),
+        expr: this.expr
+      };
+    }
+
+    /**
+     * Instantiate an FunctionAssignmentNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "FunctionAssignmentNode",
+     *      name: ..., params: ..., expr: ...}
+     *     ```
+     *     where mathjs is optional
+     * @returns {FunctionAssignmentNode}
+     */
+    static fromJSON(json) {
+      return new FunctionAssignmentNode(json.name, json.params, json.expr);
+    }
+
+    /**
+     * get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const params = [];
+      for (let i = 0; i < this.params.length; i++) {
+        params.push('<span class="math-symbol math-parameter">' + (0, _string.escape)(this.params[i]) + '</span>');
+      }
+      let expr = this.expr.toHTML(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + expr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return '<span class="math-function">' + (0, _string.escape)(this.name) + '</span>' + '<span class="math-parenthesis math-round-parenthesis">(</span>' + params.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-round-parenthesis">)</span>' + '<span class="math-operator math-assignment-operator ' + 'math-variable-assignment-operator math-binary-operator">=</span>' + expr;
+    }
+
+    /**
+     * get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      let expr = this.expr.toTex(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = `\\left(${expr}\\right)`;
+      }
+      return '\\mathrm{' + this.name + '}\\left(' + this.params.map(_latex.toSymbol).join(',') + '\\right)=' + expr;
+    }
+  }
+  (0, _defineProperty2.default)(FunctionAssignmentNode, "name", name);
+  return FunctionAssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js b/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js
new file mode 100644
index 0000000..0d700b0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/FunctionNode.js
@@ -0,0 +1,486 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFunctionNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+var _customs = require("../../utils/customs.js");
+var _scope = require("../../utils/scope.js");
+var _factory = require("../../utils/factory.js");
+var _latex = require("../../utils/latex.js");
+const name = 'FunctionNode';
+const dependencies = ['math', 'Node', 'SymbolNode'];
+const createFunctionNode = exports.createFunctionNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  var _FunctionNode;
+  let {
+    math,
+    Node,
+    SymbolNode
+  } = _ref;
+  /* format to fixed length */
+  const strin = entity => (0, _string.format)(entity, {
+    truncate: 78
+  });
+
+  /*
+   * Expand a LaTeX template
+   *
+   * @param {string} template
+   * @param {Node} node
+   * @param {Object} options
+   * @private
+   **/
+  function expandTemplate(template, node, options) {
+    let latex = '';
+
+    // Match everything of the form ${identifier} or ${identifier[2]} or $$
+    // while submatching identifier and 2 (in the second case)
+    const regex = /\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi;
+    let inputPos = 0; // position in the input string
+    let match;
+    while ((match = regex.exec(template)) !== null) {
+      // go through all matches
+      // add everything in front of the match to the LaTeX string
+      latex += template.substring(inputPos, match.index);
+      inputPos = match.index;
+      if (match[0] === '$$') {
+        // escaped dollar sign
+        latex += '$';
+        inputPos++;
+      } else {
+        // template parameter
+        inputPos += match[0].length;
+        const property = node[match[1]];
+        if (!property) {
+          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');
+        }
+        if (match[2] === undefined) {
+          // no square brackets
+          switch (typeof property) {
+            case 'string':
+              latex += property;
+              break;
+            case 'object':
+              if ((0, _is.isNode)(property)) {
+                latex += property.toTex(options);
+              } else if (Array.isArray(property)) {
+                // make array of Nodes into comma separated list
+                latex += property.map(function (arg, index) {
+                  if ((0, _is.isNode)(arg)) {
+                    return arg.toTex(options);
+                  }
+                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');
+                }).join(',');
+              } else {
+                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+              }
+              break;
+            default:
+              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+          }
+        } else {
+          // with square brackets
+          if ((0, _is.isNode)(property[match[2]] && property[match[2]])) {
+            latex += property[match[2]].toTex(options);
+          } else {
+            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');
+          }
+        }
+      }
+    }
+    latex += template.slice(inputPos); // append rest of the template
+
+    return latex;
+  }
+  class FunctionNode extends Node {
+    /**
+     * @constructor FunctionNode
+     * @extends {./Node}
+     * invoke a list with arguments on a node
+     * @param {./Node | string} fn
+     *     Item resolving to a function on which to invoke
+     *     the arguments, typically a SymbolNode or AccessorNode
+     * @param {./Node[]} args
+     */
+    constructor(fn, args) {
+      super();
+      if (typeof fn === 'string') {
+        fn = new SymbolNode(fn);
+      }
+
+      // validate input
+      if (!(0, _is.isNode)(fn)) throw new TypeError('Node expected as parameter "fn"');
+      if (!Array.isArray(args) || !args.every(_is.isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "args"');
+      }
+      this.fn = fn;
+      this.args = args || [];
+    }
+
+    // readonly property name
+    get name() {
+      return this.fn.name || '';
+    }
+    get type() {
+      return name;
+    }
+    get isFunctionNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // compile arguments
+      const evalArgs = this.args.map(arg => arg._compile(math, argNames));
+      if ((0, _is.isSymbolNode)(this.fn)) {
+        const name = this.fn.name;
+        if (!argNames[name]) {
+          // we can statically determine whether the function
+          // has the rawArgs property
+          const fn = name in math ? (0, _customs.getSafeProperty)(math, name) : undefined;
+          const isRaw = typeof fn === 'function' && fn.rawArgs === true;
+          const resolveFn = scope => {
+            let value;
+            if (scope.has(name)) {
+              value = scope.get(name);
+            } else if (name in math) {
+              value = (0, _customs.getSafeProperty)(math, name);
+            } else {
+              return FunctionNode.onUndefinedFunction(name);
+            }
+            if (typeof value === 'function') {
+              return value;
+            }
+            throw new TypeError(`'${name}' is not a function; its value is:\n  ${strin(value)}`);
+          };
+          if (isRaw) {
+            // pass unevaluated parameters (nodes) to the function
+            // "raw" evaluation
+            const rawArgs = this.args;
+            return function evalFunctionNode(scope, args, context) {
+              const fn = resolveFn(scope);
+
+              // the original function can be overwritten in the scope with a non-rawArgs function
+              if (fn.rawArgs === true) {
+                return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args));
+              } else {
+                // "regular" evaluation
+                const values = evalArgs.map(evalArg => evalArg(scope, args, context));
+                return fn(...values);
+              }
+            };
+          } else {
+            // "regular" evaluation
+            switch (evalArgs.length) {
+              case 0:
+                return function evalFunctionNode(scope, args, context) {
+                  const fn = resolveFn(scope);
+                  return fn();
+                };
+              case 1:
+                return function evalFunctionNode(scope, args, context) {
+                  const fn = resolveFn(scope);
+                  const evalArg0 = evalArgs[0];
+                  return fn(evalArg0(scope, args, context));
+                };
+              case 2:
+                return function evalFunctionNode(scope, args, context) {
+                  const fn = resolveFn(scope);
+                  const evalArg0 = evalArgs[0];
+                  const evalArg1 = evalArgs[1];
+                  return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));
+                };
+              default:
+                return function evalFunctionNode(scope, args, context) {
+                  const fn = resolveFn(scope);
+                  const values = evalArgs.map(evalArg => evalArg(scope, args, context));
+                  return fn(...values);
+                };
+            }
+          }
+        } else {
+          // the function symbol is an argName
+          const rawArgs = this.args;
+          return function evalFunctionNode(scope, args, context) {
+            const fn = (0, _customs.getSafeProperty)(args, name);
+            if (typeof fn !== 'function') {
+              throw new TypeError(`Argument '${name}' was not a function; received: ${strin(fn)}`);
+            }
+            if (fn.rawArgs) {
+              // "Raw" evaluation
+              return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args));
+            } else {
+              const values = evalArgs.map(evalArg => evalArg(scope, args, context));
+              return fn.apply(fn, values);
+            }
+          };
+        }
+      } else if ((0, _is.isAccessorNode)(this.fn) && (0, _is.isIndexNode)(this.fn.index) && this.fn.index.isObjectProperty()) {
+        // execute the function with the right context:
+        // the object of the AccessorNode
+
+        const evalObject = this.fn.object._compile(math, argNames);
+        const prop = this.fn.index.getObjectProperty();
+        const rawArgs = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          const object = evalObject(scope, args, context);
+          const fn = (0, _customs.getSafeMethod)(object, prop);
+          if (fn !== null && fn !== void 0 && fn.rawArgs) {
+            // "Raw" evaluation
+            return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args));
+          } else {
+            // "regular" evaluation
+            const values = evalArgs.map(evalArg => evalArg(scope, args, context));
+            return fn.apply(object, values);
+          }
+        };
+      } else {
+        // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()
+        // we have to dynamically determine whether the function has the
+        // rawArgs property
+        const fnExpr = this.fn.toString();
+        const evalFn = this.fn._compile(math, argNames);
+        const rawArgs = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          const fn = evalFn(scope, args, context);
+          if (typeof fn !== 'function') {
+            throw new TypeError(`Expression '${fnExpr}' did not evaluate to a function; value is:` + `\n  ${strin(fn)}`);
+          }
+          if (fn.rawArgs) {
+            // "Raw" evaluation
+            return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args));
+          } else {
+            // "regular" evaluation
+            const values = evalArgs.map(evalArg => evalArg(scope, args, context));
+            return fn.apply(fn, values);
+          }
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.fn, 'fn', this);
+      for (let i = 0; i < this.args.length; i++) {
+        callback(this.args[i], 'args[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new FunctionNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {FunctionNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const fn = this._ifNode(callback(this.fn, 'fn', this));
+      const args = [];
+      for (let i = 0; i < this.args.length; i++) {
+        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+      }
+      return new FunctionNode(fn, args);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {FunctionNode}
+     */
+    clone() {
+      return new FunctionNode(this.fn, this.args.slice(0));
+    }
+
+    /**
+     * Throws an error 'Undefined function {name}'
+     * @param {string} name
+     */
+
+    /**
+     * Get string representation. (wrapper function)
+     * This overrides parts of Node's toString function.
+     * If callback is an object containing callbacks, it
+     * calls the correct callback for the current node,
+     * otherwise it falls back to calling Node's toString
+     * function.
+     *
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    toString(options) {
+      let customString;
+      const name = this.fn.toString(options);
+      if (options && typeof options.handler === 'object' && (0, _object.hasOwnProperty)(options.handler, name)) {
+        // callback is a map of callback functions
+        customString = options.handler[name](this, options);
+      }
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+
+      // fall back to Node's toString
+      return super.toString(options);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const args = this.args.map(function (arg) {
+        return arg.toString(options);
+      });
+      const fn = (0, _is.isFunctionAssignmentNode)(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options);
+
+      // format the arguments like "add(2, 4.2)"
+      return fn + '(' + args.join(', ') + ')';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        fn: this.fn,
+        args: this.args
+      };
+    }
+
+    /**
+     * Instantiate an AssignmentNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "FunctionNode", fn: ..., args: ...}`,
+     *                       where mathjs is optional
+     * @returns {FunctionNode}
+     */
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const args = this.args.map(function (arg) {
+        return arg.toHTML(options);
+      });
+
+      // format the arguments like "add(2, 4.2)"
+      return '<span class="math-function">' + (0, _string.escape)(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + args.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+    }
+
+    /**
+     * Get LaTeX representation. (wrapper function)
+     * This overrides parts of Node's toTex function.
+     * If callback is an object containing callbacks, it
+     * calls the correct callback for the current node,
+     * otherwise it falls back to calling Node's toTex
+     * function.
+     *
+     * @param {Object} options
+     * @return {string}
+     */
+    toTex(options) {
+      let customTex;
+      if (options && typeof options.handler === 'object' && (0, _object.hasOwnProperty)(options.handler, this.name)) {
+        // callback is a map of callback functions
+        customTex = options.handler[this.name](this, options);
+      }
+      if (typeof customTex !== 'undefined') {
+        return customTex;
+      }
+
+      // fall back to Node's toTex
+      return super.toTex(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const args = this.args.map(function (arg) {
+        // get LaTeX of the arguments
+        return arg.toTex(options);
+      });
+      let latexConverter;
+      if (_latex.latexFunctions[this.name]) {
+        latexConverter = _latex.latexFunctions[this.name];
+      }
+
+      // toTex property on the function itself
+      if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {
+        // .toTex is a callback function
+        latexConverter = math[this.name].toTex;
+      }
+      let customToTex;
+      switch (typeof latexConverter) {
+        case 'function':
+          // a callback function
+          customToTex = latexConverter(this, options);
+          break;
+        case 'string':
+          // a template string
+          customToTex = expandTemplate(latexConverter, this, options);
+          break;
+        case 'object':
+          // an object with different "converters" for different
+          // numbers of arguments
+          switch (typeof latexConverter[args.length]) {
+            case 'function':
+              customToTex = latexConverter[args.length](this, options);
+              break;
+            case 'string':
+              customToTex = expandTemplate(latexConverter[args.length], this, options);
+              break;
+          }
+      }
+      if (typeof customToTex !== 'undefined') {
+        return customToTex;
+      }
+      return expandTemplate(_latex.defaultTemplate, this, options);
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type + ':' + this.name;
+    }
+  }
+  _FunctionNode = FunctionNode;
+  (0, _defineProperty2.default)(FunctionNode, "name", name);
+  (0, _defineProperty2.default)(FunctionNode, "onUndefinedFunction", function (name) {
+    throw new Error('Undefined function ' + name);
+  });
+  (0, _defineProperty2.default)(FunctionNode, "fromJSON", function (json) {
+    return new _FunctionNode(json.fn, json.args);
+  });
+  return FunctionNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js b/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js
new file mode 100644
index 0000000..aa3a7db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/IndexNode.js
@@ -0,0 +1,226 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _array = require("../../utils/array.js");
+var _customs = require("../../utils/customs.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _string = require("../../utils/string.js");
+const name = 'IndexNode';
+const dependencies = ['Node', 'size'];
+const createIndexNode = exports.createIndexNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node,
+    size
+  } = _ref;
+  class IndexNode extends Node {
+    /**
+     * @constructor IndexNode
+     * @extends Node
+     *
+     * Describes a subset of a matrix or an object property.
+     * Cannot be used on its own, needs to be used within an AccessorNode or
+     * AssignmentNode.
+     *
+     * @param {Node[]} dimensions
+     * @param {boolean} [dotNotation=false]
+     *     Optional property describing whether this index was written using dot
+     *     notation like `a.b`, or using bracket notation like `a["b"]`
+     *     (which is the default). This property is used for string conversion.
+     */
+    constructor(dimensions, dotNotation) {
+      super();
+      this.dimensions = dimensions;
+      this.dotNotation = dotNotation || false;
+
+      // validate input
+      if (!Array.isArray(dimensions) || !dimensions.every(_is.isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "dimensions"');
+      }
+      if (this.dotNotation && !this.isObjectProperty()) {
+        throw new Error('dotNotation only applicable for object properties');
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isIndexNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // TODO: implement support for bignumber (currently bignumbers are silently
+      //       reduced to numbers when changing the value to zero-based)
+
+      // TODO: Optimization: when the range values are ConstantNodes,
+      //       we can beforehand resolve the zero-based value
+
+      // optimization for a simple object property
+      const evalDimensions = (0, _array.map)(this.dimensions, function (dimension, i) {
+        const needsEnd = dimension.filter(node => node.isSymbolNode && node.name === 'end').length > 0;
+        if (needsEnd) {
+          // SymbolNode 'end' is used inside the index,
+          // like in `A[end]` or `A[end - 2]`
+          const childArgNames = Object.create(argNames);
+          childArgNames.end = true;
+          const _evalDimension = dimension._compile(math, childArgNames);
+          return function evalDimension(scope, args, context) {
+            if (!(0, _is.isMatrix)(context) && !(0, _is.isArray)(context) && !(0, _is.isString)(context)) {
+              throw new TypeError('Cannot resolve "end": ' + 'context must be a Matrix, Array, or string but is ' + (0, _is.typeOf)(context));
+            }
+            const s = size(context).valueOf();
+            const childArgs = Object.create(args);
+            childArgs.end = s[i];
+            return _evalDimension(scope, childArgs, context);
+          };
+        } else {
+          // SymbolNode `end` not used
+          return dimension._compile(math, argNames);
+        }
+      });
+      const index = (0, _customs.getSafeProperty)(math, 'index');
+      return function evalIndexNode(scope, args, context) {
+        const dimensions = (0, _array.map)(evalDimensions, function (evalDimension) {
+          return evalDimension(scope, args, context);
+        });
+        return index(...dimensions);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (let i = 0; i < this.dimensions.length; i++) {
+        callback(this.dimensions[i], 'dimensions[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new IndexNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {IndexNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const dimensions = [];
+      for (let i = 0; i < this.dimensions.length; i++) {
+        dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));
+      }
+      return new IndexNode(dimensions, this.dotNotation);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {IndexNode}
+     */
+    clone() {
+      return new IndexNode(this.dimensions.slice(0), this.dotNotation);
+    }
+
+    /**
+     * Test whether this IndexNode contains a single property name
+     * @return {boolean}
+     */
+    isObjectProperty() {
+      return this.dimensions.length === 1 && (0, _is.isConstantNode)(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';
+    }
+
+    /**
+     * Returns the property name if IndexNode contains a property.
+     * If not, returns null.
+     * @return {string | null}
+     */
+    getObjectProperty() {
+      return this.isObjectProperty() ? this.dimensions[0].value : null;
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      // format the parameters like "[1, 0:5]"
+      return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        dimensions: this.dimensions,
+        dotNotation: this.dotNotation
+      };
+    }
+
+    /**
+     * Instantiate an IndexNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "IndexNode", dimensions: [...], dotNotation: false}`,
+     *     where mathjs is optional
+     * @returns {IndexNode}
+     */
+    static fromJSON(json) {
+      return new IndexNode(json.dimensions, json.dotNotation);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      // format the parameters like "[1, 0:5]"
+      const dimensions = [];
+      for (let i = 0; i < this.dimensions.length; i++) {
+        dimensions[i] = this.dimensions[i].toHTML();
+      }
+      if (this.dotNotation) {
+        return '<span class="math-operator math-accessor-operator">.</span>' + '<span class="math-symbol math-property">' + (0, _string.escape)(this.getObjectProperty()) + '</span>';
+      } else {
+        return '<span class="math-parenthesis math-square-parenthesis">[</span>' + dimensions.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+      }
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const dimensions = this.dimensions.map(function (range) {
+        return range.toTex(options);
+      });
+      return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';
+    }
+  }
+  (0, _defineProperty2.default)(IndexNode, "name", name);
+  return IndexNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/Node.js b/node_modules/mathjs/lib/cjs/expression/node/Node.js
new file mode 100644
index 0000000..9274295
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/Node.js
@@ -0,0 +1,378 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNode = void 0;
+var _is = require("../../utils/is.js");
+var _keywords = require("../keywords.js");
+var _object = require("../../utils/object.js");
+var _factory = require("../../utils/factory.js");
+var _map = require("../../utils/map.js");
+const name = 'Node';
+const dependencies = ['mathWithTransform'];
+const createNode = exports.createNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    mathWithTransform
+  } = _ref;
+  /**
+   * Validate the symbol names of a scope.
+   * Throws an error when the scope contains an illegal symbol.
+   * @param {Object} scope
+   */
+  function _validateScope(scope) {
+    for (const symbol of [..._keywords.keywords]) {
+      if (scope.has(symbol)) {
+        throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword');
+      }
+    }
+  }
+  class Node {
+    get type() {
+      return 'Node';
+    }
+    get isNode() {
+      return true;
+    }
+
+    /**
+     * Evaluate the node
+     * @param {Object} [scope]  Scope to read/write variables
+     * @return {*}              Returns the result
+     */
+    evaluate(scope) {
+      return this.compile().evaluate(scope);
+    }
+
+    /**
+     * Compile the node into an optimized, evauatable JavaScript function
+     * @return {{evaluate: function([Object])}} object
+     *                Returns an object with a function 'evaluate',
+     *                which can be invoked as expr.evaluate([scope: Object]),
+     *                where scope is an optional object with
+     *                variables.
+     */
+    compile() {
+      const expr = this._compile(mathWithTransform, {});
+      const args = {};
+      const context = null;
+      function evaluate(scope) {
+        const s = (0, _map.createMap)(scope);
+        _validateScope(s);
+        return expr(s, args, context);
+      }
+      return {
+        evaluate
+      };
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      throw new Error('Method _compile must be implemented by type ' + this.type);
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot run forEach on a Node interface');
+    }
+
+    /**
+     * Create a new Node whose children are the results of calling the
+     * provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {OperatorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot run map on a Node interface');
+    }
+
+    /**
+     * Validate whether an object is a Node, for use with map
+     * @param {Node} node
+     * @returns {Node} Returns the input if it's a node, else throws an Error
+     * @protected
+     */
+    _ifNode(node) {
+      if (!(0, _is.isNode)(node)) {
+        throw new TypeError('Callback function must return a Node');
+      }
+      return node;
+    }
+
+    /**
+     * Recursively traverse all nodes in a node tree. Executes given callback for
+     * this node and each of its child nodes.
+     * @param {function(node: Node, path: string, parent: Node)} callback
+     *          A callback called for every node in the node tree.
+     */
+    traverse(callback) {
+      // execute callback for itself
+      // eslint-disable-next-line
+      callback(this, null, null);
+
+      // recursively traverse over all children of a node
+      function _traverse(node, callback) {
+        node.forEach(function (child, path, parent) {
+          callback(child, path, parent);
+          _traverse(child, callback);
+        });
+      }
+      _traverse(this, callback);
+    }
+
+    /**
+     * Recursively transform a node tree via a transform function.
+     *
+     * For example, to replace all nodes of type SymbolNode having name 'x' with
+     * a ConstantNode with value 2:
+     *
+     *     const res = Node.transform(function (node, path, parent) {
+     *       if (node && node.isSymbolNode) && (node.name === 'x')) {
+     *         return new ConstantNode(2)
+     *       }
+     *       else {
+     *         return node
+     *       }
+     *     })
+     *
+     * @param {function(node: Node, path: string, parent: Node) : Node} callback
+     *          A mapping function accepting a node, and returning
+     *          a replacement for the node or the original node. The "signature"
+     *          of the callback must be:
+     *          callback(node: Node, index: string, parent: Node) : Node
+     * @return {Node} Returns the original node or its replacement
+     */
+    transform(callback) {
+      function _transform(child, path, parent) {
+        const replacement = callback(child, path, parent);
+        if (replacement !== child) {
+          // stop iterating when the node is replaced
+          return replacement;
+        }
+        return child.map(_transform);
+      }
+      return _transform(this, null, null);
+    }
+
+    /**
+     * Find any node in the node tree matching given filter function. For
+     * example, to find all nodes of type SymbolNode having name 'x':
+     *
+     *     const results = Node.filter(function (node) {
+     *       return (node && node.isSymbolNode) && (node.name === 'x')
+     *     })
+     *
+     * @param {function(node: Node, path: string, parent: Node) : Node} callback
+     *            A test function returning true when a node matches, and false
+     *            otherwise. Function signature:
+     *            callback(node: Node, index: string, parent: Node) : boolean
+     * @return {Node[]} nodes
+     *            An array with nodes matching given filter criteria
+     */
+    filter(callback) {
+      const nodes = [];
+      this.traverse(function (node, path, parent) {
+        if (callback(node, path, parent)) {
+          nodes.push(node);
+        }
+      });
+      return nodes;
+    }
+
+    /**
+     * Create a shallow clone of this node
+     * @return {Node}
+     */
+    clone() {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot clone a Node interface');
+    }
+
+    /**
+     * Create a deep clone of this node
+     * @return {Node}
+     */
+    cloneDeep() {
+      return this.map(function (node) {
+        return node.cloneDeep();
+      });
+    }
+
+    /**
+     * Deep compare this node with another node.
+     * @param {Node} other
+     * @return {boolean} Returns true when both nodes are of the same type and
+     *                   contain the same values (as do their childs)
+     */
+    equals(other) {
+      return other ? this.type === other.type && (0, _object.deepStrictEqual)(this, other) : false;
+    }
+
+    /**
+     * Get string representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)"or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toString(options) {
+      const customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toString(options);
+    }
+
+    /**
+     * Internal function to generate the string output.
+     * This has to be implemented by every Node
+     *
+     * @throws {Error}
+     */
+    _toString() {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toString not implemented for ' + this.type);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * Both .toJSON() and the static .fromJSON(json) should be implemented by all
+     * implementations of Node
+     * @returns {Object}
+     */
+    toJSON() {
+      throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);
+    }
+
+    /**
+     * Get HTML representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)" or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toHTML(options) {
+      const customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toHTML(options);
+    }
+
+    /**
+     * Internal function to generate the HTML output.
+     * This has to be implemented by every Node
+     *
+     * @throws {Error}
+     */
+    _toHTML() {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toHTML not implemented for ' + this.type);
+    }
+
+    /**
+     * Get LaTeX representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)"or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toTex(options) {
+      const customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toTex(options);
+    }
+
+    /**
+     * Internal function to generate the LaTeX output.
+     * This has to be implemented by every Node
+     *
+     * @param {Object} [options]
+     * @throws {Error}
+     */
+    _toTex(options) {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toTex not implemented for ' + this.type);
+    }
+
+    /**
+     * Helper used by `to...` functions.
+     */
+    _getCustomString(options) {
+      if (options && typeof options === 'object') {
+        switch (typeof options.handler) {
+          case 'object':
+          case 'undefined':
+            return;
+          case 'function':
+            return options.handler(this, options);
+          default:
+            throw new TypeError('Object or function expected as callback');
+        }
+      }
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type;
+    }
+
+    /**
+     * Get the content of the current Node.
+     * @return {Node} node
+     **/
+    getContent() {
+      return this;
+    }
+  }
+  return Node;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js b/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js
new file mode 100644
index 0000000..0efc8aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ObjectNode.js
@@ -0,0 +1,200 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createObjectNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _customs = require("../../utils/customs.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _string = require("../../utils/string.js");
+const name = 'ObjectNode';
+const dependencies = ['Node'];
+const createObjectNode = exports.createObjectNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  class ObjectNode extends Node {
+    /**
+     * @constructor ObjectNode
+     * @extends {Node}
+     * Holds an object with keys/values
+     * @param {Object.<string, Node>} [properties]   object with key/value pairs
+     */
+    constructor(properties) {
+      super();
+      this.properties = properties || {};
+
+      // validate input
+      if (properties) {
+        if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {
+          return (0, _is.isNode)(properties[key]);
+        })) {
+          throw new TypeError('Object containing Nodes expected');
+        }
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isObjectNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const evalEntries = {};
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          // we stringify/parse the key here to resolve unicode characters,
+          // so you cannot create a key like {"co\\u006Estructor": null}
+          const stringifiedKey = (0, _string.stringify)(key);
+          const parsedKey = JSON.parse(stringifiedKey);
+          const prop = (0, _customs.getSafeProperty)(this.properties, key);
+          evalEntries[parsedKey] = prop._compile(math, argNames);
+        }
+      }
+      return function evalObjectNode(scope, args, context) {
+        const obj = {};
+        for (const key in evalEntries) {
+          if ((0, _object.hasOwnProperty)(evalEntries, key)) {
+            obj[key] = evalEntries[key](scope, args, context);
+          }
+        }
+        return obj;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this);
+        }
+      }
+    }
+
+    /**
+     * Create a new ObjectNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ObjectNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const properties = {};
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + (0, _string.stringify)(key) + ']', this));
+        }
+      }
+      return new ObjectNode(properties);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ObjectNode}
+     */
+    clone() {
+      const properties = {};
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          properties[key] = this.properties[key];
+        }
+      }
+      return new ObjectNode(properties);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      const entries = [];
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          entries.push((0, _string.stringify)(key) + ': ' + this.properties[key].toString(options));
+        }
+      }
+      return '{' + entries.join(', ') + '}';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        properties: this.properties
+      };
+    }
+
+    /**
+     * Instantiate an OperatorNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ObjectNode", "properties": {...}}`,
+     *                       where mathjs is optional
+     * @returns {ObjectNode}
+     */
+    static fromJSON(json) {
+      return new ObjectNode(json.properties);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      const entries = [];
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          entries.push('<span class="math-symbol math-property">' + (0, _string.escape)(key) + '</span>' + '<span class="math-operator math-assignment-operator ' + 'math-property-assignment-operator math-binary-operator">' + ':</span>' + this.properties[key].toHTML(options));
+        }
+      }
+      return '<span class="math-parenthesis math-curly-parenthesis">{</span>' + entries.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-curly-parenthesis">}</span>';
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const entries = [];
+      for (const key in this.properties) {
+        if ((0, _object.hasOwnProperty)(this.properties, key)) {
+          entries.push('\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\');
+        }
+      }
+      const tex = '\\left\\{\\begin{array}{ll}' + entries.join('\n') + '\\end{array}\\right\\}';
+      return tex;
+    }
+  }
+  (0, _defineProperty2.default)(ObjectNode, "name", name);
+  return ObjectNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js b/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js
new file mode 100644
index 0000000..c1d8bdd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/OperatorNode.js
@@ -0,0 +1,636 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOperatorNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _scope = require("../../utils/scope.js");
+var _string = require("../../utils/string.js");
+var _customs = require("../../utils/customs.js");
+var _operators = require("../operators.js");
+var _latex = require("../../utils/latex.js");
+var _factory = require("../../utils/factory.js");
+const name = 'OperatorNode';
+const dependencies = ['Node'];
+const createOperatorNode = exports.createOperatorNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  /**
+   * Returns true if the expression starts with a constant, under
+   * the current parenthesization:
+   * @param {Node} expression
+   * @param {string} parenthesis
+   * @return {boolean}
+   */
+  function startsWithConstant(expr, parenthesis) {
+    let curNode = expr;
+    if (parenthesis === 'auto') {
+      while ((0, _is.isParenthesisNode)(curNode)) curNode = curNode.content;
+    }
+    if ((0, _is.isConstantNode)(curNode)) return true;
+    if ((0, _is.isOperatorNode)(curNode)) {
+      return startsWithConstant(curNode.args[0], parenthesis);
+    }
+    return false;
+  }
+
+  /**
+   * Calculate which parentheses are necessary. Gets an OperatorNode
+   * (which is the root of the tree) and an Array of Nodes
+   * (this.args) and returns an array where 'true' means that an argument
+   * has to be enclosed in parentheses whereas 'false' means the opposite.
+   *
+   * @param {OperatorNode} root
+   * @param {string} parenthesis
+   * @param {Node[]} args
+   * @param {boolean} latex
+   * @return {boolean[]}
+   * @private
+   */
+  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {
+    // precedence of the root OperatorNode
+    const precedence = (0, _operators.getPrecedence)(root, parenthesis, implicit);
+    const associativity = (0, _operators.getAssociativity)(root, parenthesis);
+    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {
+      return args.map(function (arg) {
+        switch (arg.getContent().type) {
+          // Nodes that don't need extra parentheses
+          case 'ArrayNode':
+          case 'ConstantNode':
+          case 'SymbolNode':
+          case 'ParenthesisNode':
+            return false;
+          default:
+            return true;
+        }
+      });
+    }
+    let result;
+    switch (args.length) {
+      case 0:
+        result = [];
+        break;
+      case 1:
+        // unary operators
+        {
+          // precedence of the operand
+          const operandPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis, implicit, root);
+
+          // handle special cases for LaTeX, where some of the parentheses aren't needed
+          if (latex && operandPrecedence !== null) {
+            let operandIdentifier;
+            let rootIdentifier;
+            if (parenthesis === 'keep') {
+              operandIdentifier = args[0].getIdentifier();
+              rootIdentifier = root.getIdentifier();
+            } else {
+              // Ignore Parenthesis Nodes when not in 'keep' mode
+              operandIdentifier = args[0].getContent().getIdentifier();
+              rootIdentifier = root.getContent().getIdentifier();
+            }
+            if (_operators.properties[precedence][rootIdentifier].latexLeftParens === false) {
+              result = [false];
+              break;
+            }
+            if (_operators.properties[operandPrecedence][operandIdentifier].latexParens === false) {
+              result = [false];
+              break;
+            }
+          }
+          if (operandPrecedence === null) {
+            // if the operand has no defined precedence, no parens are needed
+            result = [false];
+            break;
+          }
+          if (operandPrecedence <= precedence) {
+            // if the operands precedence is lower, parens are needed
+            result = [true];
+            break;
+          }
+
+          // otherwise, no parens needed
+          result = [false];
+        }
+        break;
+      case 2:
+        // binary operators
+        {
+          let lhsParens; // left hand side needs parenthesis?
+          // precedence of the left hand side
+          const lhsPrecedence = (0, _operators.getPrecedence)(args[0], parenthesis, implicit, root);
+          // is the root node associative with the left hand side
+          const assocWithLhs = (0, _operators.isAssociativeWith)(root, args[0], parenthesis);
+          if (lhsPrecedence === null) {
+            // if the left hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            lhsParens = false;
+          } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {
+            // In case of equal precedence, if the root node is left associative
+            // parens are **never** necessary for the left hand side.
+            // If it is right associative however, parens are necessary
+            // if the root node isn't associative with the left hand side
+            lhsParens = true;
+          } else if (lhsPrecedence < precedence) {
+            lhsParens = true;
+          } else {
+            lhsParens = false;
+          }
+          let rhsParens; // right hand side needs parenthesis?
+          // precedence of the right hand side
+          const rhsPrecedence = (0, _operators.getPrecedence)(args[1], parenthesis, implicit, root);
+          // is the root node associative with the right hand side?
+          const assocWithRhs = (0, _operators.isAssociativeWith)(root, args[1], parenthesis);
+          if (rhsPrecedence === null) {
+            // if the right hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            rhsParens = false;
+          } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {
+            // In case of equal precedence, if the root node is right associative
+            // parens are **never** necessary for the right hand side.
+            // If it is left associative however, parens are necessary
+            // if the root node isn't associative with the right hand side
+            rhsParens = true;
+          } else if (rhsPrecedence < precedence) {
+            rhsParens = true;
+          } else {
+            rhsParens = false;
+          }
+
+          // handle special cases for LaTeX, where some of the parentheses aren't needed
+          if (latex) {
+            let rootIdentifier;
+            let lhsIdentifier;
+            let rhsIdentifier;
+            if (parenthesis === 'keep') {
+              rootIdentifier = root.getIdentifier();
+              lhsIdentifier = root.args[0].getIdentifier();
+              rhsIdentifier = root.args[1].getIdentifier();
+            } else {
+              // Ignore ParenthesisNodes when not in 'keep' mode
+              rootIdentifier = root.getContent().getIdentifier();
+              lhsIdentifier = root.args[0].getContent().getIdentifier();
+              rhsIdentifier = root.args[1].getContent().getIdentifier();
+            }
+            if (lhsPrecedence !== null) {
+              if (_operators.properties[precedence][rootIdentifier].latexLeftParens === false) {
+                lhsParens = false;
+              }
+              if (_operators.properties[lhsPrecedence][lhsIdentifier].latexParens === false) {
+                lhsParens = false;
+              }
+            }
+            if (rhsPrecedence !== null) {
+              if (_operators.properties[precedence][rootIdentifier].latexRightParens === false) {
+                rhsParens = false;
+              }
+              if (_operators.properties[rhsPrecedence][rhsIdentifier].latexParens === false) {
+                rhsParens = false;
+              }
+            }
+          }
+          result = [lhsParens, rhsParens];
+        }
+        break;
+      default:
+        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {
+          result = args.map(function (arg) {
+            const argPrecedence = (0, _operators.getPrecedence)(arg, parenthesis, implicit, root);
+            const assocWithArg = (0, _operators.isAssociativeWith)(root, arg, parenthesis);
+            const argAssociativity = (0, _operators.getAssociativity)(arg, parenthesis);
+            if (argPrecedence === null) {
+              // if the argument has no defined precedence, no parens are needed
+              return false;
+            } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {
+              return true;
+            } else if (argPrecedence < precedence) {
+              return true;
+            }
+            return false;
+          });
+        }
+        break;
+    }
+
+    // Handles an edge case of parentheses with implicit multiplication
+    // of ConstantNode.
+    // In that case, parenthesize ConstantNodes that follow an unparenthesized
+    // expression, even though they normally wouldn't be printed.
+    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis !== 'all' && implicit === 'hide') {
+      for (let i = 1; i < result.length; ++i) {
+        if (startsWithConstant(args[i], parenthesis) && !result[i - 1] && (parenthesis !== 'keep' || !(0, _is.isParenthesisNode)(args[i - 1]))) {
+          result[i] = true;
+        }
+      }
+    }
+    return result;
+  }
+  class OperatorNode extends Node {
+    /**
+     * @constructor OperatorNode
+     * @extends {Node}
+     * An operator with two arguments, like 2+3
+     *
+     * @param {string} op           Operator name, for example '+'
+     * @param {string} fn           Function name, for example 'add'
+     * @param {Node[]} args         Operator arguments
+     * @param {boolean} [implicit]  Is this an implicit multiplication?
+     * @param {boolean} [isPercentage] Is this an percentage Operation?
+     */
+    constructor(op, fn, args, implicit, isPercentage) {
+      super();
+      // validate input
+      if (typeof op !== 'string') {
+        throw new TypeError('string expected for parameter "op"');
+      }
+      if (typeof fn !== 'string') {
+        throw new TypeError('string expected for parameter "fn"');
+      }
+      if (!Array.isArray(args) || !args.every(_is.isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "args"');
+      }
+      this.implicit = implicit === true;
+      this.isPercentage = isPercentage === true;
+      this.op = op;
+      this.fn = fn;
+      this.args = args || [];
+    }
+    get type() {
+      return name;
+    }
+    get isOperatorNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // validate fn
+      if (typeof this.fn !== 'string' || !(0, _customs.isSafeMethod)(math, this.fn)) {
+        if (!math[this.fn]) {
+          throw new Error('Function ' + this.fn + ' missing in provided namespace "math"');
+        } else {
+          throw new Error('No access to function "' + this.fn + '"');
+        }
+      }
+      const fn = (0, _customs.getSafeProperty)(math, this.fn);
+      const evalArgs = (0, _array.map)(this.args, function (arg) {
+        return arg._compile(math, argNames);
+      });
+      if (typeof fn === 'function' && fn.rawArgs === true) {
+        // pass unevaluated parameters (nodes) to the function
+        // "raw" evaluation
+        const rawArgs = this.args;
+        return function evalOperatorNode(scope, args, context) {
+          return fn(rawArgs, math, (0, _scope.createSubScope)(scope, args));
+        };
+      } else if (evalArgs.length === 1) {
+        const evalArg0 = evalArgs[0];
+        return function evalOperatorNode(scope, args, context) {
+          return fn(evalArg0(scope, args, context));
+        };
+      } else if (evalArgs.length === 2) {
+        const evalArg0 = evalArgs[0];
+        const evalArg1 = evalArgs[1];
+        return function evalOperatorNode(scope, args, context) {
+          return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));
+        };
+      } else {
+        return function evalOperatorNode(scope, args, context) {
+          return fn.apply(null, (0, _array.map)(evalArgs, function (evalArg) {
+            return evalArg(scope, args, context);
+          }));
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (let i = 0; i < this.args.length; i++) {
+        callback(this.args[i], 'args[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new OperatorNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {OperatorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      const args = [];
+      for (let i = 0; i < this.args.length; i++) {
+        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+      }
+      return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {OperatorNode}
+     */
+    clone() {
+      return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);
+    }
+
+    /**
+     * Check whether this is an unary OperatorNode:
+     * has exactly one argument, like `-a`.
+     * @return {boolean}
+     *     Returns true when an unary operator node, false otherwise.
+     */
+    isUnary() {
+      return this.args.length === 1;
+    }
+
+    /**
+     * Check whether this is a binary OperatorNode:
+     * has exactly two arguments, like `a + b`.
+     * @return {boolean}
+     *     Returns true when a binary operator node, false otherwise.
+     */
+    isBinary() {
+      return this.args.length === 2;
+    }
+
+    /**
+     * Get string representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const implicit = options && options.implicit ? options.implicit : 'hide';
+      const args = this.args;
+      const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+      if (args.length === 1) {
+        // unary operators
+        const assoc = (0, _operators.getAssociativity)(this, parenthesis);
+        let operand = args[0].toString(options);
+        if (parens[0]) {
+          operand = '(' + operand + ')';
+        }
+
+        // for example for "not", we want a space between operand and argument
+        const opIsNamed = /[a-zA-Z]+/.test(this.op);
+        if (assoc === 'right') {
+          // prefix operator
+          return this.op + (opIsNamed ? ' ' : '') + operand;
+        } else if (assoc === 'left') {
+          // postfix
+          return operand + (opIsNamed ? ' ' : '') + this.op;
+        }
+
+        // fall back to postfix
+        return operand + this.op;
+      } else if (args.length === 2) {
+        let lhs = args[0].toString(options); // left hand side
+        let rhs = args[1].toString(options); // right hand side
+        if (parens[0]) {
+          // left hand side in parenthesis?
+          lhs = '(' + lhs + ')';
+        }
+        if (parens[1]) {
+          // right hand side in parenthesis?
+          rhs = '(' + rhs + ')';
+        }
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return lhs + ' ' + rhs;
+        }
+        return lhs + ' ' + this.op + ' ' + rhs;
+      } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        const stringifiedArgs = args.map(function (arg, index) {
+          arg = arg.toString(options);
+          if (parens[index]) {
+            // put in parenthesis?
+            arg = '(' + arg + ')';
+          }
+          return arg;
+        });
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return stringifiedArgs.join(' ');
+        }
+        return stringifiedArgs.join(' ' + this.op + ' ');
+      } else {
+        // fallback to formatting as a function call
+        return this.fn + '(' + this.args.join(', ') + ')';
+      }
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        op: this.op,
+        fn: this.fn,
+        args: this.args,
+        implicit: this.implicit,
+        isPercentage: this.isPercentage
+      };
+    }
+
+    /**
+     * Instantiate an OperatorNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "OperatorNode",
+     *      "op": "+", "fn": "add", "args": [...],
+     *      "implicit": false,
+     *      "isPercentage":false}
+     *     ```
+     *     where mathjs is optional
+     * @returns {OperatorNode}
+     */
+    static fromJSON(json) {
+      return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);
+    }
+
+    /**
+     * Get HTML representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const implicit = options && options.implicit ? options.implicit : 'hide';
+      const args = this.args;
+      const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+      if (args.length === 1) {
+        // unary operators
+        const assoc = (0, _operators.getAssociativity)(this, parenthesis);
+        let operand = args[0].toHTML(options);
+        if (parens[0]) {
+          operand = '<span class="math-parenthesis math-round-parenthesis">(</span>' + operand + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (assoc === 'right') {
+          // prefix operator
+          return '<span class="math-operator math-unary-operator ' + 'math-lefthand-unary-operator">' + (0, _string.escape)(this.op) + '</span>' + operand;
+        } else {
+          // postfix when assoc === 'left' or undefined
+          return operand + '<span class="math-operator math-unary-operator ' + 'math-righthand-unary-operator">' + (0, _string.escape)(this.op) + '</span>';
+        }
+      } else if (args.length === 2) {
+        // binary operatoes
+        let lhs = args[0].toHTML(options); // left hand side
+        let rhs = args[1].toHTML(options); // right hand side
+        if (parens[0]) {
+          // left hand side in parenthesis?
+          lhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + lhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (parens[1]) {
+          // right hand side in parenthesis?
+          rhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + rhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return lhs + '<span class="math-operator math-binary-operator ' + 'math-implicit-binary-operator"></span>' + rhs;
+        }
+        return lhs + '<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + (0, _string.escape)(this.op) + '</span>' + rhs;
+      } else {
+        const stringifiedArgs = args.map(function (arg, index) {
+          arg = arg.toHTML(options);
+          if (parens[index]) {
+            // put in parenthesis?
+            arg = '<span class="math-parenthesis math-round-parenthesis">(</span>' + arg + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+          }
+          return arg;
+        });
+        if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+          if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+            return stringifiedArgs.join('<span class="math-operator math-binary-operator ' + 'math-implicit-binary-operator"></span>');
+          }
+          return stringifiedArgs.join('<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + (0, _string.escape)(this.op) + '</span>');
+        } else {
+          // fallback to formatting as a function call
+          return '<span class="math-function">' + (0, _string.escape)(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">' + '(</span>' + stringifiedArgs.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+        }
+      }
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const implicit = options && options.implicit ? options.implicit : 'hide';
+      const args = this.args;
+      const parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);
+      let op = _latex.latexOperators[this.fn];
+      op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op
+
+      if (args.length === 1) {
+        // unary operators
+        const assoc = (0, _operators.getAssociativity)(this, parenthesis);
+        let operand = args[0].toTex(options);
+        if (parens[0]) {
+          operand = `\\left(${operand}\\right)`;
+        }
+        if (assoc === 'right') {
+          // prefix operator
+          return op + operand;
+        } else if (assoc === 'left') {
+          // postfix operator
+          return operand + op;
+        }
+
+        // fall back to postfix
+        return operand + op;
+      } else if (args.length === 2) {
+        // binary operators
+        const lhs = args[0]; // left hand side
+        let lhsTex = lhs.toTex(options);
+        if (parens[0]) {
+          lhsTex = `\\left(${lhsTex}\\right)`;
+        }
+        const rhs = args[1]; // right hand side
+        let rhsTex = rhs.toTex(options);
+        if (parens[1]) {
+          rhsTex = `\\left(${rhsTex}\\right)`;
+        }
+
+        // handle some exceptions (due to the way LaTeX works)
+        let lhsIdentifier;
+        if (parenthesis === 'keep') {
+          lhsIdentifier = lhs.getIdentifier();
+        } else {
+          // Ignore ParenthesisNodes if in 'keep' mode
+          lhsIdentifier = lhs.getContent().getIdentifier();
+        }
+        switch (this.getIdentifier()) {
+          case 'OperatorNode:divide':
+            // op contains '\\frac' at this point
+            return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';
+          case 'OperatorNode:pow':
+            lhsTex = '{' + lhsTex + '}';
+            rhsTex = '{' + rhsTex + '}';
+            switch (lhsIdentifier) {
+              case 'ConditionalNode': //
+              case 'OperatorNode:divide':
+                lhsTex = `\\left(${lhsTex}\\right)`;
+            }
+            break;
+          case 'OperatorNode:multiply':
+            if (this.implicit && implicit === 'hide') {
+              return lhsTex + '~' + rhsTex;
+            }
+        }
+        return lhsTex + op + rhsTex;
+      } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        const texifiedArgs = args.map(function (arg, index) {
+          arg = arg.toTex(options);
+          if (parens[index]) {
+            arg = `\\left(${arg}\\right)`;
+          }
+          return arg;
+        });
+        if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit && implicit === 'hide') {
+          return texifiedArgs.join('~');
+        }
+        return texifiedArgs.join(op);
+      } else {
+        // fall back to formatting as a function call
+        // as this is a fallback, it doesn't use
+        // fancy function names
+        return '\\mathrm{' + this.fn + '}\\left(' + args.map(function (arg) {
+          return arg.toTex(options);
+        }).join(',') + '\\right)';
+      }
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type + ':' + this.fn;
+    }
+  }
+  (0, _defineProperty2.default)(OperatorNode, "name", name);
+  return OperatorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js b/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js
new file mode 100644
index 0000000..f618575
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/ParenthesisNode.js
@@ -0,0 +1,159 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParenthesisNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'ParenthesisNode';
+const dependencies = ['Node'];
+const createParenthesisNode = exports.createParenthesisNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  class ParenthesisNode extends Node {
+    /**
+     * @constructor ParenthesisNode
+     * @extends {Node}
+     * A parenthesis node describes manual parenthesis from the user input
+     * @param {Node} content
+     * @extends {Node}
+     */
+    constructor(content) {
+      super();
+      // validate input
+      if (!(0, _is.isNode)(content)) {
+        throw new TypeError('Node expected for parameter "content"');
+      }
+      this.content = content;
+    }
+    get type() {
+      return name;
+    }
+    get isParenthesisNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      return this.content._compile(math, argNames);
+    }
+
+    /**
+     * Get the content of the current Node.
+     * @return {Node} content
+     * @override
+     **/
+    getContent() {
+      return this.content.getContent();
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.content, 'content', this);
+    }
+
+    /**
+     * Create a new ParenthesisNode whose child is the result of calling
+     * the provided callback function on the child of this node.
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {ParenthesisNode} Returns a clone of the node
+     */
+    map(callback) {
+      const content = callback(this.content, 'content', this);
+      return new ParenthesisNode(content);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ParenthesisNode}
+     */
+    clone() {
+      return new ParenthesisNode(this.content);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return '(' + this.content.toString(options) + ')';
+      }
+      return this.content.toString(options);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        content: this.content
+      };
+    }
+
+    /**
+     * Instantiate an ParenthesisNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ParenthesisNode", "content": ...}`,
+     *                       where mathjs is optional
+     * @returns {ParenthesisNode}
+     */
+    static fromJSON(json) {
+      return new ParenthesisNode(json.content);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return '<span class="math-parenthesis math-round-parenthesis">(</span>' + this.content.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return this.content.toHTML(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toTex(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return `\\left(${this.content.toTex(options)}\\right)`;
+      }
+      return this.content.toTex(options);
+    }
+  }
+  (0, _defineProperty2.default)(ParenthesisNode, "name", name);
+  return ParenthesisNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js b/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js
new file mode 100644
index 0000000..8d4c09b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/RangeNode.js
@@ -0,0 +1,257 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _operators = require("../operators.js");
+const name = 'RangeNode';
+const dependencies = ['Node'];
+const createRangeNode = exports.createRangeNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  /**
+   * Calculate the necessary parentheses
+   * @param {Node} node
+   * @param {string} parenthesis
+   * @param {string} implicit
+   * @return {Object} parentheses
+   * @private
+   */
+  function calculateNecessaryParentheses(node, parenthesis, implicit) {
+    const precedence = (0, _operators.getPrecedence)(node, parenthesis, implicit);
+    const parens = {};
+    const startPrecedence = (0, _operators.getPrecedence)(node.start, parenthesis, implicit);
+    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';
+    if (node.step) {
+      const stepPrecedence = (0, _operators.getPrecedence)(node.step, parenthesis, implicit);
+      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';
+    }
+    const endPrecedence = (0, _operators.getPrecedence)(node.end, parenthesis, implicit);
+    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';
+    return parens;
+  }
+  class RangeNode extends Node {
+    /**
+     * @constructor RangeNode
+     * @extends {Node}
+     * create a range
+     * @param {Node} start  included lower-bound
+     * @param {Node} end    included upper-bound
+     * @param {Node} [step] optional step
+     */
+    constructor(start, end, step) {
+      super();
+      // validate inputs
+      if (!(0, _is.isNode)(start)) throw new TypeError('Node expected');
+      if (!(0, _is.isNode)(end)) throw new TypeError('Node expected');
+      if (step && !(0, _is.isNode)(step)) throw new TypeError('Node expected');
+      if (arguments.length > 3) throw new Error('Too many arguments');
+      this.start = start; // included lower-bound
+      this.end = end; // included upper-bound
+      this.step = step || null; // optional step
+    }
+    get type() {
+      return name;
+    }
+    get isRangeNode() {
+      return true;
+    }
+
+    /**
+     * Check whether the RangeNode needs the `end` symbol to be defined.
+     * This end is the size of the Matrix in current dimension.
+     * @return {boolean}
+     */
+    needsEnd() {
+      // find all `end` symbols in this RangeNode
+      const endSymbols = this.filter(function (node) {
+        return (0, _is.isSymbolNode)(node) && node.name === 'end';
+      });
+      return endSymbols.length > 0;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const range = math.range;
+      const evalStart = this.start._compile(math, argNames);
+      const evalEnd = this.end._compile(math, argNames);
+      if (this.step) {
+        const evalStep = this.step._compile(math, argNames);
+        return function evalRangeNode(scope, args, context) {
+          return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));
+        };
+      } else {
+        return function evalRangeNode(scope, args, context) {
+          return range(evalStart(scope, args, context), evalEnd(scope, args, context));
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.start, 'start', this);
+      callback(this.end, 'end', this);
+      if (this.step) {
+        callback(this.step, 'step', this);
+      }
+    }
+
+    /**
+     * Create a new RangeNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {RangeNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {RangeNode}
+     */
+    clone() {
+      return new RangeNode(this.start, this.end, this.step && this.step);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+
+      // format string as start:step:stop
+      let str;
+      let start = this.start.toString(options);
+      if (parens.start) {
+        start = '(' + start + ')';
+      }
+      str = start;
+      if (this.step) {
+        let step = this.step.toString(options);
+        if (parens.step) {
+          step = '(' + step + ')';
+        }
+        str += ':' + step;
+      }
+      let end = this.end.toString(options);
+      if (parens.end) {
+        end = '(' + end + ')';
+      }
+      str += ':' + end;
+      return str;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        start: this.start,
+        end: this.end,
+        step: this.step
+      };
+    }
+
+    /**
+     * Instantiate an RangeNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "RangeNode", "start": ..., "end": ..., "step": ...}`,
+     *     where mathjs is optional
+     * @returns {RangeNode}
+     */
+    static fromJSON(json) {
+      return new RangeNode(json.start, json.end, json.step);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+
+      // format string as start:step:stop
+      let str;
+      let start = this.start.toHTML(options);
+      if (parens.start) {
+        start = '<span class="math-parenthesis math-round-parenthesis">(</span>' + start + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      str = start;
+      if (this.step) {
+        let step = this.step.toHTML(options);
+        if (parens.step) {
+          step = '<span class="math-parenthesis math-round-parenthesis">(</span>' + step + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        str += '<span class="math-operator math-range-operator">:</span>' + step;
+      }
+      let end = this.end.toHTML(options);
+      if (parens.end) {
+        end = '<span class="math-parenthesis math-round-parenthesis">(</span>' + end + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      str += '<span class="math-operator math-range-operator">:</span>' + end;
+      return str;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @params {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+      let str = this.start.toTex(options);
+      if (parens.start) {
+        str = `\\left(${str}\\right)`;
+      }
+      if (this.step) {
+        let step = this.step.toTex(options);
+        if (parens.step) {
+          step = `\\left(${step}\\right)`;
+        }
+        str += ':' + step;
+      }
+      let end = this.end.toTex(options);
+      if (parens.end) {
+        end = `\\left(${end}\\right)`;
+      }
+      str += ':' + end;
+      return str;
+    }
+  }
+  (0, _defineProperty2.default)(RangeNode, "name", name);
+  return RangeNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js b/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js
new file mode 100644
index 0000000..b458007
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/RelationalNode.js
@@ -0,0 +1,205 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRelationalNode = void 0;
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+var _operators = require("../operators.js");
+var _string = require("../../utils/string.js");
+var _customs = require("../../utils/customs.js");
+var _latex = require("../../utils/latex.js");
+var _factory = require("../../utils/factory.js");
+const name = 'RelationalNode';
+const dependencies = ['Node'];
+const createRelationalNode = exports.createRelationalNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Node
+  } = _ref;
+  const operatorMap = {
+    equal: '==',
+    unequal: '!=',
+    smaller: '<',
+    larger: '>',
+    smallerEq: '<=',
+    largerEq: '>='
+  };
+  class RelationalNode extends Node {
+    /**
+     * A node representing a chained conditional expression, such as 'x > y > z'
+     *
+     * @param {String[]} conditionals
+     *     An array of conditional operators used to compare the parameters
+     * @param {Node[]} params
+     *     The parameters that will be compared
+     *
+     * @constructor RelationalNode
+     * @extends {Node}
+     */
+    constructor(conditionals, params) {
+      super();
+      if (!Array.isArray(conditionals)) {
+        throw new TypeError('Parameter conditionals must be an array');
+      }
+      if (!Array.isArray(params)) {
+        throw new TypeError('Parameter params must be an array');
+      }
+      if (conditionals.length !== params.length - 1) {
+        throw new TypeError('Parameter params must contain exactly one more element ' + 'than parameter conditionals');
+      }
+      this.conditionals = conditionals;
+      this.params = params;
+    }
+    get type() {
+      return name;
+    }
+    get isRelationalNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const self = this;
+      const compiled = this.params.map(p => p._compile(math, argNames));
+      return function evalRelationalNode(scope, args, context) {
+        let evalLhs;
+        let evalRhs = compiled[0](scope, args, context);
+        for (let i = 0; i < self.conditionals.length; i++) {
+          evalLhs = evalRhs;
+          evalRhs = compiled[i + 1](scope, args, context);
+          const condFn = (0, _customs.getSafeProperty)(math, self.conditionals[i]);
+          if (!condFn(evalLhs, evalRhs)) {
+            return false;
+          }
+        }
+        return true;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);
+    }
+
+    /**
+     * Create a new RelationalNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {RelationalNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {RelationalNode}
+     */
+    clone() {
+      return new RelationalNode(this.conditionals, this.params);
+    }
+
+    /**
+     * Get string representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);
+      const paramStrings = this.params.map(function (p, index) {
+        const paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);
+      });
+      let ret = paramStrings[0];
+      for (let i = 0; i < this.conditionals.length; i++) {
+        ret += ' ' + operatorMap[this.conditionals[i]];
+        ret += ' ' + paramStrings[i + 1];
+      }
+      return ret;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        conditionals: this.conditionals,
+        params: this.params
+      };
+    }
+
+    /**
+     * Instantiate a RelationalNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "RelationalNode", "conditionals": ..., "params": ...}`,
+     *     where mathjs is optional
+     * @returns {RelationalNode}
+     */
+    static fromJSON(json) {
+      return new RelationalNode(json.conditionals, json.params);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);
+      const paramStrings = this.params.map(function (p, index) {
+        const paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class="math-parenthesis math-round-parenthesis">(</span>' + p.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>' : p.toHTML(options);
+      });
+      let ret = paramStrings[0];
+      for (let i = 0; i < this.conditionals.length; i++) {
+        ret += '<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + (0, _string.escape)(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];
+      }
+      return ret;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      const parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      const precedence = (0, _operators.getPrecedence)(this, parenthesis, options && options.implicit);
+      const paramStrings = this.params.map(function (p, index) {
+        const paramPrecedence = (0, _operators.getPrecedence)(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\left(' + p.toTex(options) + '\right)' : p.toTex(options);
+      });
+      let ret = paramStrings[0];
+      for (let i = 0; i < this.conditionals.length; i++) {
+        ret += _latex.latexOperators[this.conditionals[i]] + paramStrings[i + 1];
+      }
+      return ret;
+    }
+  }
+  (0, _defineProperty2.default)(RelationalNode, "name", name);
+  return RelationalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js b/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js
new file mode 100644
index 0000000..90aa5d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/SymbolNode.js
@@ -0,0 +1,199 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSymbolNode = void 0;
+var _string = require("../../utils/string.js");
+var _customs = require("../../utils/customs.js");
+var _factory = require("../../utils/factory.js");
+var _latex = require("../../utils/latex.js");
+const name = 'SymbolNode';
+const dependencies = ['math', '?Unit', 'Node'];
+const createSymbolNode = exports.createSymbolNode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    math,
+    Unit,
+    Node
+  } = _ref;
+  /**
+   * Check whether some name is a valueless unit like "inch".
+   * @param {string} name
+   * @return {boolean}
+   */
+  function isValuelessUnit(name) {
+    return Unit ? Unit.isValuelessUnit(name) : false;
+  }
+  class SymbolNode extends Node {
+    /**
+     * @constructor SymbolNode
+     * @extends {Node}
+     * A symbol node can hold and resolve a symbol
+     * @param {string} name
+     * @extends {Node}
+     */
+    constructor(name) {
+      super();
+      // validate input
+      if (typeof name !== 'string') {
+        throw new TypeError('String expected for parameter "name"');
+      }
+      this.name = name;
+    }
+    get type() {
+      return 'SymbolNode';
+    }
+    get isSymbolNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      const name = this.name;
+      if (argNames[name] === true) {
+        // this is a FunctionAssignment argument
+        // (like an x when inside the expression of a function
+        // assignment `f(x) = ...`)
+        return function (scope, args, context) {
+          return (0, _customs.getSafeProperty)(args, name);
+        };
+      } else if (name in math) {
+        return function (scope, args, context) {
+          return scope.has(name) ? scope.get(name) : (0, _customs.getSafeProperty)(math, name);
+        };
+      } else {
+        const isUnit = isValuelessUnit(name);
+        return function (scope, args, context) {
+          return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // nothing to do, we don't have any children
+    }
+
+    /**
+     * Create a new SymbolNode with children produced by the given callback.
+     * Trivial since a SymbolNode has no children
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {SymbolNode} Returns a clone of the node
+     */
+    map(callback) {
+      return this.clone();
+    }
+
+    /**
+     * Throws an error 'Undefined symbol {name}'
+     * @param {string} name
+     */
+    static onUndefinedSymbol(name) {
+      throw new Error('Undefined symbol ' + name);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {SymbolNode}
+     */
+    clone() {
+      return new SymbolNode(this.name);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      return this.name;
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      const name = (0, _string.escape)(this.name);
+      if (name === 'true' || name === 'false') {
+        return '<span class="math-symbol math-boolean">' + name + '</span>';
+      } else if (name === 'i') {
+        return '<span class="math-symbol math-imaginary-symbol">' + name + '</span>';
+      } else if (name === 'Infinity') {
+        return '<span class="math-symbol math-infinity-symbol">' + name + '</span>';
+      } else if (name === 'NaN') {
+        return '<span class="math-symbol math-nan-symbol">' + name + '</span>';
+      } else if (name === 'null') {
+        return '<span class="math-symbol math-null-symbol">' + name + '</span>';
+      } else if (name === 'undefined') {
+        return '<span class="math-symbol math-undefined-symbol">' + name + '</span>';
+      }
+      return '<span class="math-symbol">' + name + '</span>';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: 'SymbolNode',
+        name: this.name
+      };
+    }
+
+    /**
+     * Instantiate a SymbolNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "SymbolNode", name: "x"}`,
+     *                       where mathjs is optional
+     * @returns {SymbolNode}
+     */
+    static fromJSON(json) {
+      return new SymbolNode(json.name);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toTex(options) {
+      let isUnit = false;
+      if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {
+        isUnit = true;
+      }
+      const symbol = (0, _latex.toSymbol)(this.name, isUnit);
+      if (symbol[0] === '\\') {
+        // no space needed if the symbol starts with '\'
+        return symbol;
+      }
+      // the space prevents symbols from breaking stuff like '\cdot'
+      // if it's written right before the symbol
+      return ' ' + symbol;
+    }
+  }
+  return SymbolNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/utils/access.js b/node_modules/mathjs/lib/cjs/expression/node/utils/access.js
new file mode 100644
index 0000000..1e7b9a0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/utils/access.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.accessFactory = accessFactory;
+var _errorTransform = require("../../transform/utils/errorTransform.js");
+var _customs = require("../../../utils/customs.js");
+function accessFactory(_ref) {
+  let {
+    subset
+  } = _ref;
+  /**
+   * Retrieve part of an object:
+   *
+   * - Retrieve a property from an object
+   * - Retrieve a part of a string
+   * - Retrieve a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @return {Object | Array | Matrix | string} Returns the subset
+   */
+  return function access(object, index) {
+    try {
+      if (Array.isArray(object)) {
+        return subset(object, index);
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index);
+      } else if (typeof object === 'string') {
+        // TODO: move getStringSubset into a separate util file, use that
+        return subset(object, index);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw new TypeError('Cannot apply a numeric index as object property');
+        }
+        return (0, _customs.getSafeProperty)(object, index.getObjectProperty());
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw (0, _errorTransform.errorTransform)(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js b/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js
new file mode 100644
index 0000000..1e86dab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/node/utils/assign.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.assignFactory = assignFactory;
+var _errorTransform = require("../../transform/utils/errorTransform.js");
+var _customs = require("../../../utils/customs.js");
+function assignFactory(_ref) {
+  let {
+    subset,
+    matrix
+  } = _ref;
+  /**
+   * Replace part of an object:
+   *
+   * - Assign a property to an object
+   * - Replace a part of a string
+   * - Replace a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @param {*} value
+   * @return {Object | Array | Matrix | string} Returns the original object
+   *                                            except in case of a string
+   */
+  // TODO: change assign to return the value instead of the object
+  return function assign(object, index, value) {
+    try {
+      if (Array.isArray(object)) {
+        const result = matrix(object).subset(index, value).valueOf();
+
+        // shallow copy all (updated) items into the original array
+        result.forEach((item, index) => {
+          object[index] = item;
+        });
+        return object;
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index, value);
+      } else if (typeof object === 'string') {
+        // TODO: move setStringSubset into a separate util file, use that
+        return subset(object, index, value);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw TypeError('Cannot apply a numeric index as object property');
+        }
+        (0, _customs.setSafeProperty)(object, index.getObjectProperty(), value);
+        return object;
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw (0, _errorTransform.errorTransform)(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/operators.js b/node_modules/mathjs/lib/cjs/expression/operators.js
new file mode 100644
index 0000000..df52071
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/operators.js
@@ -0,0 +1,395 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getAssociativity = getAssociativity;
+exports.getOperator = getOperator;
+exports.getPrecedence = getPrecedence;
+exports.isAssociativeWith = isAssociativeWith;
+exports.properties = void 0;
+var _object = require("../utils/object.js");
+var _is = require("../utils/is.js");
+// list of identifiers of nodes in order of their precedence
+// also contains information about left/right associativity
+// and which other operator the operator is associative with
+// Example:
+// addition is associative with addition and subtraction, because:
+// (a+b)+c=a+(b+c)
+// (a+b)-c=a+(b-c)
+//
+// postfix operators are left associative, prefix operators
+// are right associative
+//
+// It's also possible to set the following properties:
+// latexParens: if set to false, this node doesn't need to be enclosed
+//              in parentheses when using LaTeX
+// latexLeftParens: if set to false, this !OperatorNode's!
+//                  left argument doesn't need to be enclosed
+//                  in parentheses
+// latexRightParens: the same for the right argument
+
+const properties = exports.properties = [{
+  // assignment
+  AssignmentNode: {},
+  FunctionAssignmentNode: {}
+}, {
+  // conditional expression
+  ConditionalNode: {
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false
+    // conditionals don't need parentheses in LaTeX because
+    // they are 2 dimensional
+  }
+}, {
+  // logical or
+  'OperatorNode:or': {
+    op: 'or',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical xor
+  'OperatorNode:xor': {
+    op: 'xor',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical and
+  'OperatorNode:and': {
+    op: 'and',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise or
+  'OperatorNode:bitOr': {
+    op: '|',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise xor
+  'OperatorNode:bitXor': {
+    op: '^|',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise and
+  'OperatorNode:bitAnd': {
+    op: '&',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // relational operators
+  'OperatorNode:equal': {
+    op: '==',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:unequal': {
+    op: '!=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smaller': {
+    op: '<',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:larger': {
+    op: '>',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smallerEq': {
+    op: '<=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:largerEq': {
+    op: '>=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  RelationalNode: {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitshift operators
+  'OperatorNode:leftShift': {
+    op: '<<',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightArithShift': {
+    op: '>>',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightLogShift': {
+    op: '>>>',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unit conversion
+  'OperatorNode:to': {
+    op: 'to',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // range
+  RangeNode: {}
+}, {
+  // addition, subtraction
+  'OperatorNode:add': {
+    op: '+',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']
+  },
+  'OperatorNode:subtract': {
+    op: '-',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // multiply, divide, modulus
+  'OperatorNode:multiply': {
+    op: '*',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  },
+  'OperatorNode:divide': {
+    op: '/',
+    associativity: 'left',
+    associativeWith: [],
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false
+    // fractions don't require parentheses because
+    // they're 2 dimensional, so parens aren't needed
+    // in LaTeX
+  },
+  'OperatorNode:dotMultiply': {
+    op: '.*',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']
+  },
+  'OperatorNode:dotDivide': {
+    op: './',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:mod': {
+    op: 'mod',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // Repeat multiplication for implicit multiplication
+  'OperatorNode:multiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  }
+}, {
+  // unary prefix operators
+  'OperatorNode:unaryPlus': {
+    op: '+',
+    associativity: 'right'
+  },
+  'OperatorNode:unaryMinus': {
+    op: '-',
+    associativity: 'right'
+  },
+  'OperatorNode:bitNot': {
+    op: '~',
+    associativity: 'right'
+  },
+  'OperatorNode:not': {
+    op: 'not',
+    associativity: 'right'
+  }
+}, {
+  // exponentiation
+  'OperatorNode:pow': {
+    op: '^',
+    associativity: 'right',
+    associativeWith: [],
+    latexRightParens: false
+    // the exponent doesn't need parentheses in
+    // LaTeX because it's 2 dimensional
+    // (it's on top)
+  },
+  'OperatorNode:dotPow': {
+    op: '.^',
+    associativity: 'right',
+    associativeWith: []
+  }
+}, {
+  // nullish coalescing
+  'OperatorNode:nullish': {
+    op: '??',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // factorial
+  'OperatorNode:factorial': {
+    op: '!',
+    associativity: 'left'
+  }
+}, {
+  // matrix transpose
+  'OperatorNode:ctranspose': {
+    op: "'",
+    associativity: 'left'
+  }
+}];
+
+/**
+ * Returns the first non-parenthesis internal node, but only
+ * when the 'parenthesis' option is unset or auto.
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {Node}
+ */
+function unwrapParen(_node, parenthesis) {
+  if (!parenthesis || parenthesis !== 'auto') return _node;
+  let node = _node;
+  while ((0, _is.isParenthesisNode)(node)) node = node.content;
+  return node;
+}
+
+/**
+ * Get the precedence of a Node.
+ * Higher number for higher precedence, starting with 0.
+ * Returns null if the precedence is undefined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @param {string} implicit
+ * @param {Node} parent (for determining context for implicit multiplication)
+ * @return {number | null}
+ */
+function getPrecedence(_node, parenthesis, implicit, parent) {
+  let node = _node;
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+  const identifier = node.getIdentifier();
+  let precedence = null;
+  for (let i = 0; i < properties.length; i++) {
+    if (identifier in properties[i]) {
+      precedence = i;
+      break;
+    }
+  }
+  // Bump up precedence of implicit multiplication, except when preceded
+  // by a "Rule 2" fraction ( [unaryOp]constant / constant )
+  if (identifier === 'OperatorNode:multiply' && node.implicit && implicit !== 'show') {
+    const leftArg = unwrapParen(node.args[0], parenthesis);
+    if (!((0, _is.isConstantNode)(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && (0, _is.rule2Node)(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && (0, _is.rule2Node)(unwrapParen(leftArg.args[0], parenthesis)) && (0, _is.isConstantNode)(unwrapParen(leftArg.args[1])))) {
+      precedence += 1;
+    }
+  }
+  return precedence;
+}
+
+/**
+ * Get the associativity of an operator (left or right).
+ * Returns a string containing 'left' or 'right' or null if
+ * the associativity is not defined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {string|null}
+ * @throws {Error}
+ */
+function getAssociativity(_node, parenthesis) {
+  let node = _node;
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+  const identifier = node.getIdentifier();
+  const index = getPrecedence(node, parenthesis);
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+  const property = properties[index][identifier];
+  if ((0, _object.hasOwnProperty)(property, 'associativity')) {
+    if (property.associativity === 'left') {
+      return 'left';
+    }
+    if (property.associativity === 'right') {
+      return 'right';
+    }
+    // associativity is invalid
+    throw Error('\'' + identifier + '\' has the invalid associativity \'' + property.associativity + '\'.');
+  }
+
+  // associativity is undefined
+  return null;
+}
+
+/**
+ * Check if an operator is associative with another operator.
+ * Returns either true or false or null if not defined.
+ *
+ * @param {Node} nodeA
+ * @param {Node} nodeB
+ * @param {string} parenthesis
+ * @return {boolean | null}
+ */
+function isAssociativeWith(nodeA, nodeB, parenthesis) {
+  // ParenthesisNodes are only ignored when not in 'keep' mode
+  const a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;
+  const b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;
+  const identifierA = a.getIdentifier();
+  const identifierB = b.getIdentifier();
+  const index = getPrecedence(a, parenthesis);
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+  const property = properties[index][identifierA];
+  if ((0, _object.hasOwnProperty)(property, 'associativeWith') && property.associativeWith instanceof Array) {
+    for (let i = 0; i < property.associativeWith.length; i++) {
+      if (property.associativeWith[i] === identifierB) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  // associativeWith is not defined
+  return null;
+}
+
+/**
+ * Get the operator associated with a function name.
+ * Returns a string with the operator symbol, or null if the
+ * input is not the name of a function associated with an
+ * operator.
+ *
+ * @param {string} Function name
+ * @return {string | null} Associated operator symbol, if any
+ */
+function getOperator(fn) {
+  const identifier = 'OperatorNode:' + fn;
+  for (const group of properties) {
+    if (identifier in group) {
+      return group[identifier].op;
+    }
+  }
+  return null;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/parse.js b/node_modules/mathjs/lib/cjs/expression/parse.js
new file mode 100644
index 0000000..d6ae30e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/parse.js
@@ -0,0 +1,1648 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createParse = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _factory = require("../utils/factory.js");
+var _is = require("../utils/is.js");
+var _collection = require("../utils/collection.js");
+var _number = require("../utils/number.js");
+var _object = require("../utils/object.js");
+const name = 'parse';
+const dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];
+const createParse = exports.createParse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    numeric,
+    config,
+    AccessorNode,
+    ArrayNode,
+    AssignmentNode,
+    BlockNode,
+    ConditionalNode,
+    ConstantNode,
+    FunctionAssignmentNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    RangeNode,
+    RelationalNode,
+    SymbolNode
+  } = _ref;
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate() or transformed into a functional object via node.compile().
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.parse(expr)
+   *     math.parse(expr, options)
+   *     math.parse([expr1, expr2, expr3, ...])
+   *     math.parse([expr1, expr2, expr3, ...], options)
+   *
+   * Example:
+   *
+   *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+   *     node1.compile().evaluate() // 5
+   *
+   *     let scope = {a:3, b:4}
+   *     const node2 = math.parse('a * b')
+   *     node2.evaluate(scope) // 12
+   *     const code2 = node2.compile()
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].compile().evaluate() // 12
+   *
+   * See also:
+   *
+   *     evaluate, compile
+   *
+   * @param {string | string[] | Matrix} expr          Expression to be parsed
+   * @param {{nodes: Object<string, Node>}} [options]  Available options:
+   *                                                   - `nodes` a set of custom nodes
+   * @return {Node | Node[]} node
+   * @throws {Error}
+   */
+  const parse = typed(name, {
+    string: function (expression) {
+      return parseStart(expression, {});
+    },
+    'Array | Matrix': function (expressions) {
+      return parseMultiple(expressions, {});
+    },
+    'string, Object': function (expression, options) {
+      const extraNodes = options.nodes !== undefined ? options.nodes : {};
+      return parseStart(expression, extraNodes);
+    },
+    'Array | Matrix, Object': parseMultiple
+  });
+  function parseMultiple(expressions) {
+    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    const extraNodes = options.nodes !== undefined ? options.nodes : {};
+
+    // parse an array or matrix with expressions
+    return (0, _collection.deepMap)(expressions, function (elem) {
+      if (typeof elem !== 'string') throw new TypeError('String expected');
+      return parseStart(elem, extraNodes);
+    });
+  }
+
+  // token types enumeration
+  const TOKENTYPE = {
+    NULL: 0,
+    DELIMITER: 1,
+    NUMBER: 2,
+    SYMBOL: 3,
+    UNKNOWN: 4
+  };
+
+  // map with all delimiters
+  const DELIMITERS = {
+    ',': true,
+    '(': true,
+    ')': true,
+    '[': true,
+    ']': true,
+    '{': true,
+    '}': true,
+    '"': true,
+    '\'': true,
+    ';': true,
+    '+': true,
+    '-': true,
+    '*': true,
+    '.*': true,
+    '/': true,
+    './': true,
+    '%': true,
+    '^': true,
+    '.^': true,
+    '~': true,
+    '!': true,
+    '&': true,
+    '|': true,
+    '^|': true,
+    '=': true,
+    ':': true,
+    '?': true,
+    '??': true,
+    '==': true,
+    '!=': true,
+    '<': true,
+    '>': true,
+    '<=': true,
+    '>=': true,
+    '<<': true,
+    '>>': true,
+    '>>>': true
+  };
+
+  // map with all named delimiters
+  const NAMED_DELIMITERS = {
+    mod: true,
+    to: true,
+    in: true,
+    and: true,
+    xor: true,
+    or: true,
+    not: true
+  };
+  const CONSTANTS = {
+    true: true,
+    false: false,
+    null: null,
+    undefined
+  };
+  const NUMERIC_CONSTANTS = ['NaN', 'Infinity'];
+  const ESCAPE_CHARACTERS = {
+    '"': '"',
+    "'": "'",
+    '\\': '\\',
+    '/': '/',
+    b: '\b',
+    f: '\f',
+    n: '\n',
+    r: '\r',
+    t: '\t'
+    // note that \u is handled separately in parseStringToken()
+  };
+  function initialState() {
+    return {
+      extraNodes: {},
+      // current extra nodes, must be careful not to mutate
+      expression: '',
+      // current expression
+      comment: '',
+      // last parsed comment
+      index: 0,
+      // current index in expr
+      token: '',
+      // current token
+      tokenType: TOKENTYPE.NULL,
+      // type of the token
+      nestingLevel: 0,
+      // level of nesting inside parameters, used to ignore newline characters
+      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here
+    };
+  }
+
+  /**
+   * View upto `length` characters of the expression starting at the current character.
+   *
+   * @param {Object} state
+   * @param {number} [length=1] Number of characters to view
+   * @returns {string}
+   * @private
+   */
+  function currentString(state, length) {
+    return state.expression.substr(state.index, length);
+  }
+
+  /**
+   * View the current character. Returns '' if end of expression is reached.
+   *
+   * @param {Object} state
+   * @returns {string}
+   * @private
+   */
+  function currentCharacter(state) {
+    return currentString(state, 1);
+  }
+
+  /**
+   * Get the next character from the expression.
+   * The character is stored into the char c. If the end of the expression is
+   * reached, the function puts an empty string in c.
+   * @private
+   */
+  function next(state) {
+    state.index++;
+  }
+
+  /**
+   * Preview the previous character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+  function prevCharacter(state) {
+    return state.expression.charAt(state.index - 1);
+  }
+
+  /**
+   * Preview the next character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+  function nextCharacter(state) {
+    return state.expression.charAt(state.index + 1);
+  }
+
+  /**
+   * Get next token in the current string expr.
+   * The token and token type are available as token and tokenType
+   * @private
+   */
+  function getToken(state) {
+    state.tokenType = TOKENTYPE.NULL;
+    state.token = '';
+    state.comment = '';
+
+    // skip over ignored characters:
+    while (true) {
+      // comments:
+      if (currentCharacter(state) === '#') {
+        while (currentCharacter(state) !== '\n' && currentCharacter(state) !== '') {
+          state.comment += currentCharacter(state);
+          next(state);
+        }
+      }
+      // whitespace: space, tab, and newline when inside parameters
+      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {
+        next(state);
+      } else {
+        break;
+      }
+    }
+
+    // check for end of expression
+    if (currentCharacter(state) === '') {
+      // token is still empty
+      state.tokenType = TOKENTYPE.DELIMITER;
+      return;
+    }
+
+    // check for new line character
+    if (currentCharacter(state) === '\n' && !state.nestingLevel) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = currentCharacter(state);
+      next(state);
+      return;
+    }
+    const c1 = currentCharacter(state);
+    const c2 = currentString(state, 2);
+    const c3 = currentString(state, 3);
+    if (c3.length === 3 && DELIMITERS[c3]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c3;
+      next(state);
+      next(state);
+      next(state);
+      return;
+    }
+
+    // check for delimiters consisting of 2 characters
+    if (c2.length === 2 && DELIMITERS[c2]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c2;
+      next(state);
+      next(state);
+      return;
+    }
+
+    // check for delimiters consisting of 1 character
+    if (DELIMITERS[c1]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c1;
+      next(state);
+      return;
+    }
+
+    // check for a number
+    if (parse.isDigitDot(c1)) {
+      state.tokenType = TOKENTYPE.NUMBER;
+
+      // check for binary, octal, or hex
+      const c2 = currentString(state, 2);
+      if (c2 === '0b' || c2 === '0o' || c2 === '0x') {
+        state.token += currentCharacter(state);
+        next(state);
+        state.token += currentCharacter(state);
+        next(state);
+        while (parse.isHexDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+        if (currentCharacter(state) === '.') {
+          // this number has a radix point
+          state.token += '.';
+          next(state);
+          // get the digits after the radix
+          while (parse.isHexDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        } else if (currentCharacter(state) === 'i') {
+          // this number has a word size suffix
+          state.token += 'i';
+          next(state);
+          // get the word size
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        }
+        return;
+      }
+
+      // get number, can have a single dot
+      if (currentCharacter(state) === '.') {
+        state.token += currentCharacter(state);
+        next(state);
+        if (!parse.isDigit(currentCharacter(state))) {
+          // this is no number, it is just a dot (can be dot notation)
+          state.tokenType = TOKENTYPE.DELIMITER;
+          return;
+        }
+      } else {
+        while (parse.isDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+      }
+      while (parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+      // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4"
+      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {
+        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {
+          state.token += currentCharacter(state);
+          next(state);
+          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+          // Scientific notation MUST be followed by an exponent
+          if (!parse.isDigit(currentCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+        } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {
+          next(state);
+          throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+        }
+      }
+      return;
+    }
+
+    // check for variables, functions, named operators
+    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {
+      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+      if ((0, _object.hasOwnProperty)(NAMED_DELIMITERS, state.token)) {
+        state.tokenType = TOKENTYPE.DELIMITER;
+      } else {
+        state.tokenType = TOKENTYPE.SYMBOL;
+      }
+      return;
+    }
+
+    // something unknown is found, wrong characters -> a syntax error
+    state.tokenType = TOKENTYPE.UNKNOWN;
+    while (currentCharacter(state) !== '') {
+      state.token += currentCharacter(state);
+      next(state);
+    }
+    throw createSyntaxError(state, 'Syntax error in part "' + state.token + '"');
+  }
+
+  /**
+   * Get next token and skip newline tokens
+   */
+  function getTokenSkipNewline(state) {
+    do {
+      getToken(state);
+    } while (state.token === '\n'); // eslint-disable-line no-unmodified-loop-condition
+  }
+
+  /**
+   * Open parameters.
+   * New line characters will be ignored until closeParams(state) is called
+   */
+  function openParams(state) {
+    state.nestingLevel++;
+  }
+
+  /**
+   * Close parameters.
+   * New line characters will no longer be ignored
+   */
+  function closeParams(state) {
+    state.nestingLevel--;
+  }
+
+  /**
+   * Checks whether the current character `c` is a valid alpha character:
+   *
+   * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+   * - An underscore                        Ascii: _
+   * - A dollar sign                        Ascii: $
+   * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+   * - A greek letter                       Unicode: \u0370 - \u03FF
+   * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+   *
+   * The previous and next characters are needed to determine whether
+   * this character is part of a unicode surrogate pair.
+   *
+   * @param {string} c      Current character in the expression
+   * @param {string} cPrev  Previous character
+   * @param {string} cNext  Next character
+   * @return {boolean}
+   */
+  parse.isAlpha = function isAlpha(c, cPrev, cNext) {
+    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);
+  };
+
+  /**
+   * Test whether a character is a valid latin, greek, or letter-like character
+   * @param {string} c
+   * @return {boolean}
+   */
+  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {
+    return /^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(c);
+  };
+
+  /**
+   * Test whether two given 16 bit characters form a surrogate pair of a
+   * unicode math symbol.
+   *
+   * https://unicode-table.com/en/
+   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+   *
+   * Note: In ES6 will be unicode aware:
+   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+   * https://mathiasbynens.be/notes/es6-unicode-regex
+   *
+   * @param {string} high
+   * @param {string} low
+   * @return {boolean}
+   */
+  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {
+    return /^[\uD835]$/.test(high) && /^[\uDC00-\uDFFF]$/.test(low) && /^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(low);
+  };
+
+  /**
+   * Check whether given character c is a white space character: space, tab, or enter
+   * @param {string} c
+   * @param {number} nestingLevel
+   * @return {boolean}
+   */
+  parse.isWhitespace = function isWhitespace(c, nestingLevel) {
+    // TODO: also take '\r' carriage return as newline? Or does that give problems on mac?
+    return c === ' ' || c === '\t' || c === '\u00A0' || c === '\n' && nestingLevel > 0;
+  };
+
+  /**
+   * Test whether the character c is a decimal mark (dot).
+   * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+   * @param {string} c
+   * @param {string} cNext
+   * @return {boolean}
+   */
+  parse.isDecimalMark = function isDecimalMark(c, cNext) {
+    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';
+  };
+
+  /**
+   * checks if the given char c is a digit or dot
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isDigitDot = function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  };
+
+  /**
+   * checks if the given char c is a digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isDigit = function isDigit(c) {
+    return c >= '0' && c <= '9';
+  };
+
+  /**
+   * checks if the given char c is a hex digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isHexDigit = function isHexDigit(c) {
+    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';
+  };
+
+  /**
+   * Start of the parse levels below, in order of precedence
+   * @return {Node} node
+   * @private
+   */
+  function parseStart(expression, extraNodes) {
+    const state = initialState();
+    (0, _extends2.default)(state, {
+      expression,
+      extraNodes
+    });
+    getToken(state);
+    const node = parseBlock(state);
+
+    // check for garbage at the end of the expression
+    // an expression ends with a empty character '' and tokenType DELIMITER
+    if (state.token !== '') {
+      if (state.tokenType === TOKENTYPE.DELIMITER) {
+        // user entered a not existing operator like "//"
+
+        // TODO: give hints for aliases, for example with "<>" give as hint " did you mean !== ?"
+        throw createError(state, 'Unexpected operator ' + state.token);
+      } else {
+        throw createSyntaxError(state, 'Unexpected part "' + state.token + '"');
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Parse a block with expressions. Expressions can be separated by a newline
+   * character '\n', or by a semicolon ';'. In case of a semicolon, no output
+   * of the preceding line is returned.
+   * @return {Node} node
+   * @private
+   */
+  function parseBlock(state) {
+    let node;
+    const blocks = [];
+    let visible;
+    if (state.token !== '' && state.token !== '\n' && state.token !== ';') {
+      node = parseAssignment(state);
+      if (state.comment) {
+        node.comment = state.comment;
+      }
+    }
+
+    // TODO: simplify this loop
+    while (state.token === '\n' || state.token === ';') {
+      // eslint-disable-line no-unmodified-loop-condition
+      if (blocks.length === 0 && node) {
+        visible = state.token !== ';';
+        blocks.push({
+          node,
+          visible
+        });
+      }
+      getToken(state);
+      if (state.token !== '\n' && state.token !== ';' && state.token !== '') {
+        node = parseAssignment(state);
+        if (state.comment) {
+          node.comment = state.comment;
+        }
+        visible = state.token !== ';';
+        blocks.push({
+          node,
+          visible
+        });
+      }
+    }
+    if (blocks.length > 0) {
+      return new BlockNode(blocks);
+    } else {
+      if (!node) {
+        node = new ConstantNode(undefined);
+        if (state.comment) {
+          node.comment = state.comment;
+        }
+      }
+      return node;
+    }
+  }
+
+  /**
+   * Assignment of a function or variable,
+   * - can be a variable like 'a=2.3'
+   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'
+   * - defining a function like 'f(x) = x^2'
+   * @return {Node} node
+   * @private
+   */
+  function parseAssignment(state) {
+    let name, args, value, valid;
+    const node = parseConditional(state);
+    if (state.token === '=') {
+      if ((0, _is.isSymbolNode)(node)) {
+        // parse a variable assignment like 'a = 2/3'
+        name = node.name;
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(new SymbolNode(name), value);
+      } else if ((0, _is.isAccessorNode)(node)) {
+        // parse a matrix subset assignment like 'A[1,2] = 4'
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(node.object, node.index, value);
+      } else if ((0, _is.isFunctionNode)(node) && (0, _is.isSymbolNode)(node.fn)) {
+        // parse function assignment like 'f(x) = x^2'
+        valid = true;
+        args = [];
+        name = node.name;
+        node.args.forEach(function (arg, index) {
+          if ((0, _is.isSymbolNode)(arg)) {
+            args[index] = arg.name;
+          } else {
+            valid = false;
+          }
+        });
+        if (valid) {
+          getTokenSkipNewline(state);
+          value = parseAssignment(state);
+          return new FunctionAssignmentNode(name, args, value);
+        }
+      }
+      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');
+    }
+    return node;
+  }
+
+  /**
+   * conditional operation
+   *
+   *     condition ? truePart : falsePart
+   *
+   * Note: conditional operator is right-associative
+   *
+   * @return {Node} node
+   * @private
+   */
+  function parseConditional(state) {
+    let node = parseLogicalOr(state);
+    while (state.token === '?') {
+      // eslint-disable-line no-unmodified-loop-condition
+      // set a conditional level, the range operator will be ignored as long
+      // as conditionalLevel === state.nestingLevel.
+      const prev = state.conditionalLevel;
+      state.conditionalLevel = state.nestingLevel;
+      getTokenSkipNewline(state);
+      const condition = node;
+      const trueExpr = parseAssignment(state);
+      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');
+      state.conditionalLevel = null;
+      getTokenSkipNewline(state);
+      const falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity
+
+      node = new ConditionalNode(condition, trueExpr, falseExpr);
+
+      // restore the previous conditional level
+      state.conditionalLevel = prev;
+    }
+    return node;
+  }
+
+  /**
+   * logical or, 'x or y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalOr(state) {
+    let node = parseLogicalXor(state);
+    while (state.token === 'or') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * logical exclusive or, 'x xor y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalXor(state) {
+    let node = parseLogicalAnd(state);
+    while (state.token === 'xor') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * logical and, 'x and y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalAnd(state) {
+    let node = parseBitwiseOr(state);
+    while (state.token === 'and') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise or, 'x | y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseOr(state) {
+    let node = parseBitwiseXor(state);
+    while (state.token === '|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise exclusive or (xor), 'x ^| y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseXor(state) {
+    let node = parseBitwiseAnd(state);
+    while (state.token === '^|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise and, 'x & y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseAnd(state) {
+    let node = parseRelational(state);
+    while (state.token === '&') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * Parse a chained conditional, like 'a > b >= c'
+   * @return {Node} node
+   */
+  function parseRelational(state) {
+    const params = [parseShift(state)];
+    const conditionals = [];
+    const operators = {
+      '==': 'equal',
+      '!=': 'unequal',
+      '<': 'smaller',
+      '>': 'larger',
+      '<=': 'smallerEq',
+      '>=': 'largerEq'
+    };
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      const cond = {
+        name: state.token,
+        fn: operators[state.token]
+      };
+      conditionals.push(cond);
+      getTokenSkipNewline(state);
+      params.push(parseShift(state));
+    }
+    if (params.length === 1) {
+      return params[0];
+    } else if (params.length === 2) {
+      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);
+    } else {
+      return new RelationalNode(conditionals.map(c => c.fn), params);
+    }
+  }
+
+  /**
+   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
+   * @return {Node} node
+   * @private
+   */
+  function parseShift(state) {
+    let node, name, fn, params;
+    node = parseConversion(state);
+    const operators = {
+      '<<': 'leftShift',
+      '>>': 'rightArithShift',
+      '>>>': 'rightLogShift'
+    };
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      params = [node, parseConversion(state)];
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * conversion operators 'to' and 'in'
+   * @return {Node} node
+   * @private
+   */
+  function parseConversion(state) {
+    let node, name, fn, params;
+    node = parseRange(state);
+    const operators = {
+      to: 'to',
+      in: 'to' // alias of 'to'
+    };
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      if (name === 'in' && '])},;'.includes(state.token)) {
+        // end of expression -> this is the unit 'in' ('inch')
+        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
+      } else {
+        // operator 'a to b' or 'a in b'
+        params = [node, parseRange(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+    return node;
+  }
+
+  /**
+   * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc
+   * @return {Node} node
+   * @private
+   */
+  function parseRange(state) {
+    let node;
+    const params = [];
+    if (state.token === ':') {
+      // implicit start=1 (one-based)
+      node = new ConstantNode(1);
+    } else {
+      // explicit start
+      node = parseAddSubtract(state);
+    }
+    if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {
+      // we ignore the range operator when a conditional operator is being processed on the same level
+      params.push(node);
+
+      // parse step and end
+      while (state.token === ':' && params.length < 3) {
+        // eslint-disable-line no-unmodified-loop-condition
+        getTokenSkipNewline(state);
+        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {
+          // implicit end
+          params.push(new SymbolNode('end'));
+        } else {
+          // explicit end
+          params.push(parseAddSubtract(state));
+        }
+      }
+      if (params.length === 3) {
+        // params = [start, step, end]
+        node = new RangeNode(params[0], params[2], params[1]); // start, end, step
+      } else {
+        // length === 2
+        // params = [start, end]
+        node = new RangeNode(params[0], params[1]); // start, end
+      }
+    }
+    return node;
+  }
+
+  /**
+   * add or subtract
+   * @return {Node} node
+   * @private
+   */
+  function parseAddSubtract(state) {
+    let node, name, fn, params;
+    node = parseMultiplyDivideModulusPercentage(state);
+    const operators = {
+      '+': 'add',
+      '-': 'subtract'
+    };
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      const rightNode = parseMultiplyDivideModulusPercentage(state);
+      if (rightNode.isPercentage) {
+        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];
+      } else {
+        params = [node, rightNode];
+      }
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * multiply, divide, modulus, percentage
+   * @return {Node} node
+   * @private
+   */
+  function parseMultiplyDivideModulusPercentage(state) {
+    let node, last, name, fn;
+    node = parseImplicitMultiplication(state);
+    last = node;
+    const operators = {
+      '*': 'multiply',
+      '.*': 'dotMultiply',
+      '/': 'divide',
+      './': 'dotDivide',
+      '%': 'mod',
+      mod: 'mod'
+    };
+    while (true) {
+      if ((0, _object.hasOwnProperty)(operators, state.token)) {
+        // explicit operators
+        name = state.token;
+        fn = operators[name];
+        getTokenSkipNewline(state);
+        if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {
+          // If the expression contains only %, then treat that as /100
+          if (state.token !== '' && operators[state.token]) {
+            const left = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+            name = state.token;
+            fn = operators[name];
+            getTokenSkipNewline(state);
+            last = parseImplicitMultiplication(state);
+            node = new OperatorNode(name, fn, [left, last]);
+          } else {
+            node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+          }
+          // return node
+        } else {
+          last = parseImplicitMultiplication(state);
+          node = new OperatorNode(name, fn, [node, last]);
+        }
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * implicit multiplication
+   * @return {Node} node
+   * @private
+   */
+  function parseImplicitMultiplication(state) {
+    let node, last;
+    node = parseRule2(state);
+    last = node;
+    while (true) {
+      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && (0, _is.isConstantNode)(node) || state.token === 'in' && (0, _is.isOperatorNode)(node) && node.fn === 'unaryMinus' && (0, _is.isConstantNode)(node.args[0]) || state.tokenType === TOKENTYPE.NUMBER && !(0, _is.isConstantNode)(last) && (!(0, _is.isOperatorNode)(last) || last.op === '!') || state.token === '(') {
+        // parse implicit multiplication
+        //
+        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'
+        // number:      implicit multiplication like '(2+3)2'
+        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'
+        last = parseRule2(state);
+        node = new OperatorNode('*', 'multiply', [node, last], true /* implicit */);
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Infamous "rule 2" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370
+   * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164
+   * Explicit division gets higher precedence than implicit multiplication
+   * when the division matches this pattern:
+   *   [unaryPrefixOp]?[number] / [number] [symbol]
+   * @return {Node} node
+   * @private
+   */
+  function parseRule2(state) {
+    let node = parseUnary(state);
+    let last = node;
+    const tokenStates = [];
+    while (true) {
+      // Match the "number /" part of the pattern "number / number symbol"
+      if (state.token === '/' && (0, _is.rule2Node)(last)) {
+        // Look ahead to see if the next token is a number
+        tokenStates.push((0, _extends2.default)({}, state));
+        getTokenSkipNewline(state);
+
+        // Match the "number / number" part of the pattern
+        if (state.tokenType === TOKENTYPE.NUMBER) {
+          // Look ahead again
+          tokenStates.push((0, _extends2.default)({}, state));
+          getTokenSkipNewline(state);
+
+          // Match the "symbol" part of the pattern, or a left parenthesis
+          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(' || state.token === 'in') {
+            // We've matched the pattern "number / number symbol".
+            // Rewind once and build the "number / number" node; the symbol will be consumed later
+            (0, _extends2.default)(state, tokenStates.pop());
+            tokenStates.pop();
+            last = parseUnary(state);
+            node = new OperatorNode('/', 'divide', [node, last]);
+          } else {
+            // Not a match, so rewind
+            tokenStates.pop();
+            (0, _extends2.default)(state, tokenStates.pop());
+            break;
+          }
+        } else {
+          // Not a match, so rewind
+          (0, _extends2.default)(state, tokenStates.pop());
+          break;
+        }
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Unary plus and minus, and logical and bitwise not
+   * @return {Node} node
+   * @private
+   */
+  function parseUnary(state) {
+    let name, params, fn;
+    const operators = {
+      '-': 'unaryMinus',
+      '+': 'unaryPlus',
+      '~': 'bitNot',
+      not: 'not'
+    };
+    if ((0, _object.hasOwnProperty)(operators, state.token)) {
+      fn = operators[state.token];
+      name = state.token;
+      getTokenSkipNewline(state);
+      params = [parseUnary(state)];
+      return new OperatorNode(name, fn, params);
+    }
+    return parsePow(state);
+  }
+
+  /**
+   * power
+   * Note: power operator is right associative
+   * @return {Node} node
+   * @private
+   */
+  function parsePow(state) {
+    let node, name, fn, params;
+    node = parseNullishCoalescing(state);
+    if (state.token === '^' || state.token === '.^') {
+      name = state.token;
+      fn = name === '^' ? 'pow' : 'dotPow';
+      getTokenSkipNewline(state);
+      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * nullish coalescing operator
+   * @return {Node} node
+   * @private
+   */
+  function parseNullishCoalescing(state) {
+    let node = parseLeftHandOperators(state);
+    while (state.token === '??') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * Left hand operators: factorial x!, ctranspose x'
+   * @return {Node} node
+   * @private
+   */
+  function parseLeftHandOperators(state) {
+    let node, name, fn, params;
+    node = parseCustomNodes(state);
+    const operators = {
+      '!': 'factorial',
+      '\'': 'ctranspose'
+    };
+    while ((0, _object.hasOwnProperty)(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getToken(state);
+      params = [node];
+      node = new OperatorNode(name, fn, params);
+      node = parseAccessors(state, node);
+    }
+    return node;
+  }
+
+  /**
+   * Parse a custom node handler. A node handler can be used to process
+   * nodes in a custom way, for example for handling a plot.
+   *
+   * A handler must be passed as second argument of the parse function.
+   * - must extend math.Node
+   * - must contain a function _compile(defs: Object) : string
+   * - must contain a function find(filter: Object) : Node[]
+   * - must contain a function toString() : string
+   * - the constructor is called with a single argument containing all parameters
+   *
+   * For example:
+   *
+   *     nodes = {
+   *       'plot': PlotHandler
+   *     }
+   *
+   * The constructor of the handler is called as:
+   *
+   *     node = new PlotHandler(params)
+   *
+   * The handler will be invoked when evaluating an expression like:
+   *
+   *     node = math.parse('plot(sin(x), x)', nodes)
+   *
+   * @return {Node} node
+   * @private
+   */
+  function parseCustomNodes(state) {
+    let params = [];
+    if (state.tokenType === TOKENTYPE.SYMBOL && (0, _object.hasOwnProperty)(state.extraNodes, state.token)) {
+      const CustomNode = state.extraNodes[state.token];
+      getToken(state);
+
+      // parse parameters
+      if (state.token === '(') {
+        params = [];
+        openParams(state);
+        getToken(state);
+        if (state.token !== ')') {
+          params.push(parseAssignment(state));
+
+          // parse a list with parameters
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+        if (state.token !== ')') {
+          throw createSyntaxError(state, 'Parenthesis ) expected');
+        }
+        closeParams(state);
+        getToken(state);
+      }
+
+      // create a new custom node
+      // noinspection JSValidateTypes
+      return new CustomNode(params);
+    }
+    return parseSymbol(state);
+  }
+
+  /**
+   * parse symbols: functions, variables, constants, units
+   * @return {Node} node
+   * @private
+   */
+  function parseSymbol(state) {
+    let node, name;
+    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+      name = state.token;
+      getToken(state);
+      if ((0, _object.hasOwnProperty)(CONSTANTS, name)) {
+        // true, false, null, ...
+        node = new ConstantNode(CONSTANTS[name]);
+      } else if (NUMERIC_CONSTANTS.includes(name)) {
+        // NaN, Infinity
+        node = new ConstantNode(numeric(name, 'number'));
+      } else {
+        node = new SymbolNode(name);
+      }
+
+      // parse function parameters and matrix index
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseString(state);
+  }
+
+  /**
+   * parse accessors:
+   * - function invocation in round brackets (...), for example sqrt(2)
+   * - index enclosed in square brackets [...], for example A[2,3]
+   * - dot notation for properties, like foo.bar
+   * @param {Object} state
+   * @param {Node} node    Node on which to apply the parameters. If there
+   *                       are no parameters in the expression, the node
+   *                       itself is returned
+   * @param {string[]} [types]  Filter the types of notations
+   *                            can be ['(', '[', '.']
+   * @return {Node} node
+   * @private
+   */
+  function parseAccessors(state, node, types) {
+    let params;
+    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.includes(state.token))) {
+      // eslint-disable-line no-unmodified-loop-condition
+      params = [];
+      if (state.token === '(') {
+        if ((0, _is.isSymbolNode)(node) || (0, _is.isAccessorNode)(node)) {
+          // function invocation like fn(2, 3) or obj.fn(2, 3)
+          openParams(state);
+          getToken(state);
+          if (state.token !== ')') {
+            params.push(parseAssignment(state));
+
+            // parse a list with parameters
+            while (state.token === ',') {
+              // eslint-disable-line no-unmodified-loop-condition
+              getToken(state);
+              params.push(parseAssignment(state));
+            }
+          }
+          if (state.token !== ')') {
+            throw createSyntaxError(state, 'Parenthesis ) expected');
+          }
+          closeParams(state);
+          getToken(state);
+          node = new FunctionNode(node, params);
+        } else {
+          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)
+          // don't parse it here but let it be handled by parseImplicitMultiplication
+          // with correct precedence
+          return node;
+        }
+      } else if (state.token === '[') {
+        // index notation like variable[2, 3]
+        openParams(state);
+        getToken(state);
+        if (state.token !== ']') {
+          params.push(parseAssignment(state));
+
+          // parse a list with parameters
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+        if (state.token !== ']') {
+          throw createSyntaxError(state, 'Parenthesis ] expected');
+        }
+        closeParams(state);
+        getToken(state);
+        node = new AccessorNode(node, new IndexNode(params));
+      } else {
+        // dot notation like variable.prop
+        getToken(state);
+        const isPropertyName = state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS;
+        if (!isPropertyName) {
+          throw createSyntaxError(state, 'Property name expected after dot');
+        }
+        params.push(new ConstantNode(state.token));
+        getToken(state);
+        const dotNotation = true;
+        node = new AccessorNode(node, new IndexNode(params, dotNotation));
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Parse a single or double quoted string.
+   * @return {Node} node
+   * @private
+   */
+  function parseString(state) {
+    let node, str;
+    if (state.token === '"' || state.token === "'") {
+      str = parseStringToken(state, state.token);
+
+      // create constant
+      node = new ConstantNode(str);
+
+      // parse index parameters
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseMatrix(state);
+  }
+
+  /**
+   * Parse a string surrounded by single or double quotes
+   * @param {Object} state
+   * @param {"'" | "\""} quote
+   * @return {string}
+   */
+  function parseStringToken(state, quote) {
+    let str = '';
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {
+      if (currentCharacter(state) === '\\') {
+        next(state);
+        const char = currentCharacter(state);
+        const escapeChar = ESCAPE_CHARACTERS[char];
+        if (escapeChar !== undefined) {
+          // an escaped control character like \" or \n
+          str += escapeChar;
+          state.index += 1;
+        } else if (char === 'u') {
+          // escaped unicode character
+          const unicode = state.expression.slice(state.index + 1, state.index + 5);
+          if (/^[0-9A-Fa-f]{4}$/.test(unicode)) {
+            // test whether the string holds four hexadecimal values
+            str += String.fromCharCode(parseInt(unicode, 16));
+            state.index += 5;
+          } else {
+            throw createSyntaxError(state, `Invalid unicode character \\u${unicode}`);
+          }
+        } else {
+          throw createSyntaxError(state, `Bad escape character \\${char}`);
+        }
+      } else {
+        // any regular character
+        str += currentCharacter(state);
+        next(state);
+      }
+    }
+    getToken(state);
+    if (state.token !== quote) {
+      throw createSyntaxError(state, `End of string ${quote} expected`);
+    }
+    getToken(state);
+    return str;
+  }
+
+  /**
+   * parse the matrix
+   * @return {Node} node
+   * @private
+   */
+  function parseMatrix(state) {
+    let array, params, rows, cols;
+    if (state.token === '[') {
+      // matrix [...]
+      openParams(state);
+      getToken(state);
+      if (state.token !== ']') {
+        // this is a non-empty matrix
+        const row = parseRow(state);
+        if (state.token === ';') {
+          // 2 dimensional array
+          rows = 1;
+          params = [row];
+
+          // the rows of the matrix are separated by dot-comma's
+          while (state.token === ';') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            if (state.token !== ']') {
+              params[rows] = parseRow(state);
+              rows++;
+            }
+          }
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+          closeParams(state);
+          getToken(state);
+
+          // check if the number of columns matches in all rows
+          cols = params[0].items.length;
+          for (let r = 1; r < rows; r++) {
+            if (params[r].items.length !== cols) {
+              throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');
+            }
+          }
+          array = new ArrayNode(params);
+        } else {
+          // 1 dimensional vector
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+          closeParams(state);
+          getToken(state);
+          array = row;
+        }
+      } else {
+        // this is an empty matrix "[ ]"
+        closeParams(state);
+        getToken(state);
+        array = new ArrayNode([]);
+      }
+      return parseAccessors(state, array);
+    }
+    return parseObject(state);
+  }
+
+  /**
+   * Parse a single comma-separated row from a matrix, like 'a, b, c'
+   * @return {ArrayNode} node
+   */
+  function parseRow(state) {
+    const params = [parseAssignment(state)];
+    let len = 1;
+    while (state.token === ',') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getToken(state);
+
+      // parse expression
+      if (state.token !== ']' && state.token !== ';') {
+        params[len] = parseAssignment(state);
+        len++;
+      }
+    }
+    return new ArrayNode(params);
+  }
+
+  /**
+   * parse an object, enclosed in angle brackets{...}, for example {value: 2}
+   * @return {Node} node
+   * @private
+   */
+  function parseObject(state) {
+    if (state.token === '{') {
+      openParams(state);
+      let key;
+      const properties = {};
+      do {
+        getToken(state);
+        if (state.token !== '}') {
+          // parse key
+          if (state.token === '"' || state.token === "'") {
+            key = parseStringToken(state, state.token);
+          } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+            key = state.token;
+            getToken(state);
+          } else {
+            throw createSyntaxError(state, 'Symbol or string expected as object key');
+          }
+
+          // parse key/value separator
+          if (state.token !== ':') {
+            throw createSyntaxError(state, 'Colon : expected after object key');
+          }
+          getToken(state);
+
+          // parse key
+          properties[key] = parseAssignment(state);
+        }
+      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition
+
+      if (state.token !== '}') {
+        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');
+      }
+      closeParams(state);
+      getToken(state);
+      let node = new ObjectNode(properties);
+
+      // parse index parameters
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseNumber(state);
+  }
+
+  /**
+   * parse a number
+   * @return {Node} node
+   * @private
+   */
+  function parseNumber(state) {
+    let numberStr;
+    if (state.tokenType === TOKENTYPE.NUMBER) {
+      // this is a number
+      numberStr = state.token;
+      getToken(state);
+      const numericType = (0, _number.safeNumberType)(numberStr, config);
+      const value = numeric(numberStr, numericType);
+      return new ConstantNode(value);
+    }
+    return parseParentheses(state);
+  }
+
+  /**
+   * parentheses
+   * @return {Node} node
+   * @private
+   */
+  function parseParentheses(state) {
+    let node;
+
+    // check if it is a parenthesized expression
+    if (state.token === '(') {
+      // parentheses (...)
+      openParams(state);
+      getToken(state);
+      node = parseAssignment(state); // start again
+
+      if (state.token !== ')') {
+        throw createSyntaxError(state, 'Parenthesis ) expected');
+      }
+      closeParams(state);
+      getToken(state);
+      node = new ParenthesisNode(node);
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseEnd(state);
+  }
+
+  /**
+   * Evaluated when the expression is not yet ended but expected to end
+   * @return {Node} res
+   * @private
+   */
+  function parseEnd(state) {
+    if (state.token === '') {
+      // syntax error or unexpected end of expression
+      throw createSyntaxError(state, 'Unexpected end of expression');
+    } else {
+      throw createSyntaxError(state, 'Value expected');
+    }
+  }
+
+  /**
+   * Shortcut for getting the current row value (one based)
+   * Returns the line of the currently handled expression
+   * @private
+   */
+  /* TODO: implement keeping track on the row number
+  function row () {
+    return null
+  }
+  */
+
+  /**
+   * Shortcut for getting the current col value (one based)
+   * Returns the column (position) where the last state.token starts
+   * @private
+   */
+  function col(state) {
+    return state.index - state.token.length + 1;
+  }
+
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {SyntaxError} instantiated error
+   * @private
+   */
+  function createSyntaxError(state, message) {
+    const c = col(state);
+    const error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {Error} instantiated error
+   * @private
+   */
+  function createError(state, message) {
+    const c = col(state);
+    const error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  // Now that we can parse, automatically convert strings to Nodes by parsing
+  typed.addConversion({
+    from: 'string',
+    to: 'Node',
+    convert: parse
+  });
+  return parse;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/and.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/and.transform.js
new file mode 100644
index 0000000..494f509
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/and.transform.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAndTransform = void 0;
+var _and = require("../../function/logical/and.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'and';
+const dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];
+const createAndTransform = exports.createAndTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  const and = (0, _and.createAnd)({
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  });
+  function andTransform(args, math, scope) {
+    const condition1 = args[0].compile().evaluate(scope);
+    if (!(0, _is.isCollection)(condition1) && !and(condition1, true)) {
+      return false;
+    }
+    const condition2 = args[1].compile().evaluate(scope);
+    return and(condition1, condition2);
+  }
+  andTransform.rawArgs = true;
+  return andTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/bitAnd.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/bitAnd.transform.js
new file mode 100644
index 0000000..bd1cb36
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/bitAnd.transform.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitAndTransform = void 0;
+var _bitAnd = require("../../function/bitwise/bitAnd.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'bitAnd';
+const dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];
+const createBitAndTransform = exports.createBitAndTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  const bitAnd = (0, _bitAnd.createBitAnd)({
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  });
+  function bitAndTransform(args, math, scope) {
+    const condition1 = args[0].compile().evaluate(scope);
+    if (!(0, _is.isCollection)(condition1)) {
+      if (isNaN(condition1)) {
+        return NaN;
+      }
+      if (condition1 === 0 || condition1 === false) {
+        return 0;
+      }
+    }
+    const condition2 = args[1].compile().evaluate(scope);
+    return bitAnd(condition1, condition2);
+  }
+  bitAndTransform.rawArgs = true;
+  return bitAndTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/bitOr.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/bitOr.transform.js
new file mode 100644
index 0000000..41c0927
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/bitOr.transform.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitOrTransform = void 0;
+var _bitOr = require("../../function/bitwise/bitOr.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'bitOr';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+const createBitOrTransform = exports.createBitOrTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const bitOr = (0, _bitOr.createBitOr)({
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  });
+  function bitOrTransform(args, math, scope) {
+    const condition1 = args[0].compile().evaluate(scope);
+    if (!(0, _is.isCollection)(condition1)) {
+      if (isNaN(condition1)) {
+        return NaN;
+      }
+      if (condition1 === -1) {
+        return -1;
+      }
+      if (condition1 === true) {
+        return 1;
+      }
+    }
+    const condition2 = args[1].compile().evaluate(scope);
+    return bitOr(condition1, condition2);
+  }
+  bitOrTransform.rawArgs = true;
+  return bitOrTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js
new file mode 100644
index 0000000..b03d33c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/column.transform.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createColumnTransform = void 0;
+var _errorTransform = require("./utils/errorTransform.js");
+var _factory = require("../../utils/factory.js");
+var _column = require("../../function/matrix/column.js");
+var _is = require("../../utils/is.js");
+const name = 'column';
+const dependencies = ['typed', 'Index', 'matrix', 'range'];
+
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+const createColumnTransform = exports.createColumnTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  const column = (0, _column.createColumn)({
+    typed,
+    Index,
+    matrix,
+    range
+  });
+
+  // @see: comment of column itself
+  return typed('column', {
+    '...any': function (args) {
+      // change last argument from zero-based to one-based
+      const lastIndex = args.length - 1;
+      const last = args[lastIndex];
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      }
+      try {
+        return column.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js
new file mode 100644
index 0000000..a715ea5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/concat.transform.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConcatTransform = void 0;
+var _is = require("../../utils/is.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _factory = require("../../utils/factory.js");
+var _concat = require("../../function/matrix/concat.js");
+const name = 'concat';
+const dependencies = ['typed', 'matrix', 'isInteger'];
+const createConcatTransform = exports.createConcatTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+  const concat = (0, _concat.createConcat)({
+    typed,
+    matrix,
+    isInteger
+  });
+
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function concat
+   * from one-based to zero based
+   */
+  return typed('concat', {
+    '...any': function (args) {
+      // change last argument from one-based to zero-based
+      const lastIndex = args.length - 1;
+      const last = args[lastIndex];
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      } else if ((0, _is.isBigNumber)(last)) {
+        args[lastIndex] = last.minus(1);
+      }
+      try {
+        return concat.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js
new file mode 100644
index 0000000..91a6b40
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/cumsum.transform.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCumSumTransform = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _cumsum = require("../../function/statistics/cumsum.js");
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+const name = 'cumsum';
+const dependencies = ['typed', 'add', 'unaryPlus'];
+const createCumSumTransform = exports.createCumSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+  const cumsum = (0, _cumsum.createCumSum)({
+    typed,
+    add,
+    unaryPlus
+  });
+  return typed(name, {
+    '...any': function (args) {
+      // change last argument dim from one-based to zero-based
+      if (args.length === 2 && (0, _is.isCollection)(args[0])) {
+        const dim = args[1];
+        if ((0, _is.isNumber)(dim)) {
+          args[1] = dim - 1;
+        } else if ((0, _is.isBigNumber)(dim)) {
+          args[1] = dim.minus(1);
+        }
+      }
+      try {
+        return cumsum.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js
new file mode 100644
index 0000000..dd0015e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/diff.transform.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiffTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _diff = require("../../function/matrix/diff.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'diff';
+const dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];
+const createDiffTransform = exports.createDiffTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  } = _ref;
+  const diff = (0, _diff.createDiff)({
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  });
+
+  /**
+   * Attach a transform function to math.diff
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed(name, {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return diff.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js
new file mode 100644
index 0000000..5b816f3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/filter.transform.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFilterTransform = void 0;
+var _filter = require("../../function/matrix/filter.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+var _transformCallback = require("./utils/transformCallback.js");
+const name = 'filter';
+const dependencies = ['typed'];
+const createFilterTransform = exports.createFilterTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.filter
+   * Adds a property transform containing the transform function.
+   *
+   * This transform adds support for equations as test function for math.filter,
+   * so you can do something like 'filter([3, -2, 5], x > 0)'.
+   */
+  function filterTransform(args, math, scope) {
+    const filter = (0, _filter.createFilter)({
+      typed
+    });
+    const transformCallback = (0, _transformCallback.createTransformCallback)({
+      typed
+    });
+    if (args.length === 0) {
+      return filter();
+    }
+    let x = args[0];
+    if (args.length === 1) {
+      return filter(x);
+    }
+    const N = args.length - 1;
+    let callback = args[N];
+    if (x) {
+      x = _compileAndEvaluate(x, scope);
+    }
+    if (callback) {
+      if ((0, _is.isSymbolNode)(callback) || (0, _is.isFunctionAssignmentNode)(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = (0, _compileInlineExpression.compileInlineExpression)(callback, math, scope);
+      }
+    }
+    return filter(x, transformCallback(callback, N));
+  }
+  filterTransform.rawArgs = true;
+  function _compileAndEvaluate(arg, scope) {
+    return arg.compile().evaluate(scope);
+  }
+  return filterTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js
new file mode 100644
index 0000000..e84c4c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/forEach.transform.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createForEachTransform = void 0;
+var _forEach = require("../../function/matrix/forEach.js");
+var _transformCallback = require("./utils/transformCallback.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+const name = 'forEach';
+const dependencies = ['typed'];
+const createForEachTransform = exports.createForEachTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.forEach
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  const forEach = (0, _forEach.createForEach)({
+    typed
+  });
+  const transformCallback = (0, _transformCallback.createTransformCallback)({
+    typed
+  });
+  function forEachTransform(args, math, scope) {
+    if (args.length === 0) {
+      return forEach();
+    }
+    let x = args[0];
+    if (args.length === 1) {
+      return forEach(x);
+    }
+    const N = args.length - 1;
+    let callback = args[N];
+    if (x) {
+      x = _compileAndEvaluate(x, scope);
+    }
+    if (callback) {
+      if ((0, _is.isSymbolNode)(callback) || (0, _is.isFunctionAssignmentNode)(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = (0, _compileInlineExpression.compileInlineExpression)(callback, math, scope);
+      }
+    }
+    return forEach(x, transformCallback(callback, N));
+  }
+  forEachTransform.rawArgs = true;
+  function _compileAndEvaluate(arg, scope) {
+    return arg.compile().evaluate(scope);
+  }
+  return forEachTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js
new file mode 100644
index 0000000..8eb0f55
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/index.transform.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexTransform = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'index';
+const dependencies = ['Index', 'getMatrixDataType'];
+const createIndexTransform = exports.createIndexTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Index,
+    getMatrixDataType
+  } = _ref;
+  /**
+   * Attach a transform function to math.index
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  return function indexTransform() {
+    const args = [];
+    for (let i = 0, ii = arguments.length; i < ii; i++) {
+      let arg = arguments[i];
+
+      // change from one-based to zero based, convert BigNumber to number and leave Array of Booleans as is
+      if ((0, _is.isRange)(arg)) {
+        arg.start--;
+        arg.end -= arg.step > 0 ? 0 : 2;
+      } else if (arg && arg.isSet === true) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if ((0, _is.isArray)(arg) || (0, _is.isMatrix)(arg)) {
+        if (getMatrixDataType(arg) !== 'boolean') {
+          arg = arg.map(function (v) {
+            return v - 1;
+          });
+        }
+      } else if ((0, _is.isNumber)(arg) || (0, _is.isBigInt)(arg)) {
+        arg--;
+      } else if ((0, _is.isBigNumber)(arg)) {
+        arg = arg.toNumber() - 1;
+      } else if (typeof arg === 'string') {
+        // leave as is
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range');
+      }
+      args[i] = arg;
+    }
+    const res = new Index();
+    Index.apply(res, args);
+    return res;
+  };
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js
new file mode 100644
index 0000000..152eb0d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/map.transform.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMapTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _map = require("../../function/matrix/map.js");
+var _compileInlineExpression = require("./utils/compileInlineExpression.js");
+var _transformCallback = require("./utils/transformCallback.js");
+const name = 'map';
+const dependencies = ['typed'];
+const createMapTransform = exports.createMapTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.map
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  const map = (0, _map.createMap)({
+    typed
+  });
+  const transformCallback = (0, _transformCallback.createTransformCallback)({
+    typed
+  });
+  function mapTransform(args, math, scope) {
+    if (args.length === 0) {
+      return map();
+    }
+    if (args.length === 1) {
+      return map(args[0]);
+    }
+    const N = args.length - 1;
+    let X = args.slice(0, N);
+    let callback = args[N];
+    X = X.map(arg => _compileAndEvaluate(arg, scope));
+    if (callback) {
+      if ((0, _is.isSymbolNode)(callback) || (0, _is.isFunctionAssignmentNode)(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = (0, _compileInlineExpression.compileInlineExpression)(callback, math, scope);
+      }
+    }
+    return map(...X, transformCallback(callback, N));
+    function _compileAndEvaluate(arg, scope) {
+      return arg.compile().evaluate(scope);
+    }
+  }
+  mapTransform.rawArgs = true;
+  return mapTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/mapSlices.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/mapSlices.transform.js
new file mode 100644
index 0000000..9545fcc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/mapSlices.transform.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMapSlicesTransform = void 0;
+var _errorTransform = require("./utils/errorTransform.js");
+var _factory = require("../../utils/factory.js");
+var _mapSlices = require("../../function/matrix/mapSlices.js");
+var _is = require("../../utils/is.js");
+const name = 'mapSlices';
+const dependencies = ['typed', 'isInteger'];
+
+/**
+ * Attach a transform function to math.mapSlices
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function mapSlices
+ * from one-based to zero based
+ */
+const createMapSlicesTransform = exports.createMapSlicesTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isInteger
+  } = _ref;
+  const mapSlices = (0, _mapSlices.createMapSlices)({
+    typed,
+    isInteger
+  });
+
+  // @see: comment of concat itself
+  return typed('mapSlices', {
+    '...any': function (args) {
+      // change dim from one-based to zero-based
+      const dim = args[1];
+      if ((0, _is.isNumber)(dim)) {
+        args[1] = dim - 1;
+      } else if ((0, _is.isBigNumber)(dim)) {
+        args[1] = dim.minus(1);
+      }
+      try {
+        return mapSlices.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true,
+  ..._mapSlices.createMapSlices.meta
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js
new file mode 100644
index 0000000..4b48b33
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/max.transform.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMaxTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _max = require("../../function/statistics/max.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'max';
+const dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];
+const createMaxTransform = exports.createMaxTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  } = _ref;
+  const max = (0, _max.createMax)({
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  });
+
+  /**
+   * Attach a transform function to math.max
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function max
+   * from one-based to zero based
+   */
+  return typed('max', {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return max.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js
new file mode 100644
index 0000000..3786f73
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/mean.transform.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMeanTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _mean = require("../../function/statistics/mean.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'mean';
+const dependencies = ['typed', 'add', 'divide'];
+const createMeanTransform = exports.createMeanTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    divide
+  } = _ref;
+  const mean = (0, _mean.createMean)({
+    typed,
+    add,
+    divide
+  });
+
+  /**
+   * Attach a transform function to math.mean
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function mean
+   * from one-based to zero based
+   */
+  return typed('mean', {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return mean.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js
new file mode 100644
index 0000000..bfa0a83
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/min.transform.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMinTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _min = require("../../function/statistics/min.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'min';
+const dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];
+const createMinTransform = exports.createMinTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  } = _ref;
+  const min = (0, _min.createMin)({
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  });
+
+  /**
+   * Attach a transform function to math.min
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function min
+   * from one-based to zero based
+   */
+  return typed('min', {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return min.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/nullish.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/nullish.transform.js
new file mode 100644
index 0000000..4237b37
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/nullish.transform.js
@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNullishTransform = void 0;
+var _nullish = require("../../function/logical/nullish.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'nullish';
+const dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];
+const createNullishTransform = exports.createNullishTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  } = _ref;
+  const nullish = (0, _nullish.createNullish)({
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  });
+  function nullishTransform(args, math, scope) {
+    const left = args[0].compile().evaluate(scope);
+
+    // If left is not a collection and not nullish, short-circuit and return it
+    if (!(0, _is.isCollection)(left) && left != null && left !== undefined) {
+      return left;
+    }
+
+    // Otherwise evaluate right and apply full nullish semantics (incl. element-wise)
+    const right = args[1].compile().evaluate(scope);
+    return nullish(left, right);
+  }
+  nullishTransform.rawArgs = true;
+  return nullishTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/or.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/or.transform.js
new file mode 100644
index 0000000..08169e7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/or.transform.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOrTransform = void 0;
+var _or = require("../../function/logical/or.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'or';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+const createOrTransform = exports.createOrTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const or = (0, _or.createOr)({
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  });
+  function orTransform(args, math, scope) {
+    const condition1 = args[0].compile().evaluate(scope);
+    if (!(0, _is.isCollection)(condition1) && or(condition1, false)) {
+      return true;
+    }
+    const condition2 = args[1].compile().evaluate(scope);
+    return or(condition1, condition2);
+  }
+  orTransform.rawArgs = true;
+  return orTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/print.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/print.transform.js
new file mode 100644
index 0000000..8872817
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/print.transform.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPrintTransform = void 0;
+var _print = require("../../function/string/print.js");
+var _factory = require("../../utils/factory.js");
+var _print2 = require("../../utils/print.js");
+const name = 'print';
+const dependencies = ['typed', 'matrix', 'zeros', 'add'];
+const createPrintTransform = exports.createPrintTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  const print = (0, _print.createPrint)({
+    typed,
+    matrix,
+    zeros,
+    add
+  });
+  return typed(name, {
+    'string, Object | Array': function (template, values) {
+      return print(_convertTemplateToZeroBasedIndex(template), values);
+    },
+    'string, Object | Array, number | Object': function (template, values, options) {
+      return print(_convertTemplateToZeroBasedIndex(template), values, options);
+    }
+  });
+  function _convertTemplateToZeroBasedIndex(template) {
+    return template.replace(_print2.printTemplate, x => {
+      const parts = x.slice(1).split('.');
+      const result = parts.map(function (part) {
+        if (!isNaN(part) && part.length > 0) {
+          return parseInt(part) - 1;
+        } else {
+          return part;
+        }
+      });
+      return '$' + result.join('.');
+    });
+  }
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/quantileSeq.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/quantileSeq.transform.js
new file mode 100644
index 0000000..885cd03
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/quantileSeq.transform.js
@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createQuantileSeqTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _quantileSeq = require("../../function/statistics/quantileSeq.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'quantileSeq';
+const dependencies = ['typed', 'bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];
+
+/**
+ * Attach a transform function to math.quantileSeq
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+const createQuantileSeqTransform = exports.createQuantileSeqTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  } = _ref;
+  const quantileSeq = (0, _quantileSeq.createQuantileSeq)({
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  });
+  return typed('quantileSeq', {
+    'Array | Matrix, number | BigNumber': quantileSeq,
+    'Array | Matrix, number | BigNumber, number': (arr, prob, dim) => quantileSeq(arr, prob, dimToZeroBase(dim)),
+    'Array | Matrix, number | BigNumber, boolean': quantileSeq,
+    'Array | Matrix, number | BigNumber, boolean, number': (arr, prob, sorted, dim) => quantileSeq(arr, prob, sorted, dimToZeroBase(dim)),
+    'Array | Matrix, Array | Matrix': quantileSeq,
+    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => quantileSeq(data, prob, dimToZeroBase(dim)),
+    'Array | Matrix, Array | Matrix, boolean': quantileSeq,
+    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => quantileSeq(data, prob, sorted, dimToZeroBase(dim))
+  });
+  function dimToZeroBase(dim) {
+    // TODO: find a better way, maybe lastDimToZeroBase could apply to more cases.
+    return (0, _lastDimToZeroBase.lastDimToZeroBase)([[], dim])[1];
+  }
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js
new file mode 100644
index 0000000..977fa22
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/range.transform.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _range = require("../../function/matrix/range.js");
+const name = 'range';
+const dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];
+const createRangeTransform = exports.createRangeTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    equal,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  } = _ref;
+  const range = (0, _range.createRange)({
+    typed,
+    config,
+    matrix,
+    bignumber,
+    equal,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  });
+
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed('range', {
+    '...any': function (args) {
+      const lastIndex = args.length - 1;
+      const last = args[lastIndex];
+      if (typeof last !== 'boolean') {
+        // append a parameter includeEnd=true
+        args.push(true);
+      }
+      return range.apply(null, args);
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js
new file mode 100644
index 0000000..de1844f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/row.transform.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRowTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _row = require("../../function/matrix/row.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _is = require("../../utils/is.js");
+const name = 'row';
+const dependencies = ['typed', 'Index', 'matrix', 'range'];
+
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+const createRowTransform = exports.createRowTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  const row = (0, _row.createRow)({
+    typed,
+    Index,
+    matrix,
+    range
+  });
+
+  // @see: comment of row itself
+  return typed('row', {
+    '...any': function (args) {
+      // change last argument from zero-based to one-based
+      const lastIndex = args.length - 1;
+      const last = args[lastIndex];
+      if ((0, _is.isNumber)(last)) {
+        args[lastIndex] = last - 1;
+      }
+      try {
+        return row.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js
new file mode 100644
index 0000000..c8e5138
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/std.transform.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStdTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _std = require("../../function/statistics/std.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'std';
+const dependencies = ['typed', 'map', 'sqrt', 'variance'];
+
+/**
+ * Attach a transform function to math.std
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+const createStdTransform = exports.createStdTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    map,
+    sqrt,
+    variance
+  } = _ref;
+  const std = (0, _std.createStd)({
+    typed,
+    map,
+    sqrt,
+    variance
+  });
+  return typed('std', {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return std.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js
new file mode 100644
index 0000000..f15ec68
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/subset.transform.js
@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubsetTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _subset = require("../../function/matrix/subset.js");
+const name = 'subset';
+const dependencies = ['typed', 'matrix', 'zeros', 'add'];
+const createSubsetTransform = exports.createSubsetTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  const subset = (0, _subset.createSubset)({
+    typed,
+    matrix,
+    zeros,
+    add
+  });
+
+  /**
+   * Attach a transform function to math.subset
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed('subset', {
+    '...any': function (args) {
+      try {
+        return subset.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js
new file mode 100644
index 0000000..f6a6bd8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/sum.transform.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSumTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _sum = require("../../function/statistics/sum.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+const name = 'sum';
+const dependencies = ['typed', 'config', 'add', 'numeric'];
+const createSumTransform = exports.createSumTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+  const sum = (0, _sum.createSum)({
+    typed,
+    config,
+    add,
+    numeric
+  });
+  return typed(name, {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return sum.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js
new file mode 100644
index 0000000..89b07ba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/compileInlineExpression.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compileInlineExpression = compileInlineExpression;
+var _is = require("../../../utils/is.js");
+var _map = require("../../../utils/map.js");
+/**
+ * Compile an inline expression like "x > 0"
+ * @param {Node} expression
+ * @param {Object} math
+ * @param {Map} scope
+ * @return {function} Returns a function with one argument which fills in the
+ *                    undefined variable (like "x") and evaluates the expression
+ */
+function compileInlineExpression(expression, math, scope) {
+  // find an undefined symbol
+  const symbol = expression.filter(function (node) {
+    return (0, _is.isSymbolNode)(node) && !(node.name in math) && !scope.has(node.name);
+  })[0];
+  if (!symbol) {
+    throw new Error('No undefined variable found in inline expression "' + expression + '"');
+  }
+
+  // create a test function for this equation
+  const name = symbol.name; // variable name
+  const argsScope = new Map();
+  const subScope = new _map.PartitionedMap(scope, argsScope, new Set([name]));
+  const eq = expression.compile();
+  return function inlineExpression(x) {
+    argsScope.set(name, x);
+    return eq.evaluate(subScope);
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/dimToZeroBase.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/dimToZeroBase.js
new file mode 100644
index 0000000..cbc2cc5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/dimToZeroBase.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.dimToZeroBase = dimToZeroBase;
+exports.isNumberOrBigNumber = isNumberOrBigNumber;
+var _is = require("../../../utils/is.js");
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+function dimToZeroBase(dim) {
+  if ((0, _is.isNumber)(dim)) {
+    return dim - 1;
+  } else if ((0, _is.isBigNumber)(dim)) {
+    return dim.minus(1);
+  } else {
+    return dim;
+  }
+}
+function isNumberOrBigNumber(n) {
+  return (0, _is.isNumber)(n) || (0, _is.isBigNumber)(n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js
new file mode 100644
index 0000000..3e85344
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/errorTransform.js
@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.errorTransform = errorTransform;
+var _IndexError = require("../../../error/IndexError.js");
+/**
+ * Transform zero-based indices to one-based indices in errors
+ * @param {Error} err
+ * @returns {Error | IndexError} Returns the transformed error
+ */
+function errorTransform(err) {
+  if (err && err.isIndexError) {
+    return new _IndexError.IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);
+  }
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js
new file mode 100644
index 0000000..dc3cdaf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/lastDimToZeroBase.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lastDimToZeroBase = lastDimToZeroBase;
+var _is = require("../../../utils/is.js");
+var _dimToZeroBase = require("./dimToZeroBase.js");
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+function lastDimToZeroBase(args) {
+  if (args.length === 2 && (0, _is.isCollection)(args[0])) {
+    args = args.slice();
+    const dim = args[1];
+    if ((0, _dimToZeroBase.isNumberOrBigNumber)(dim)) {
+      args[1] = (0, _dimToZeroBase.dimToZeroBase)(dim);
+    }
+  }
+  return args;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/utils/transformCallback.js b/node_modules/mathjs/lib/cjs/expression/transform/utils/transformCallback.js
new file mode 100644
index 0000000..1fdae2a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/utils/transformCallback.js
@@ -0,0 +1,101 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTransformCallback = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'transformCallback';
+const dependencies = ['typed'];
+const createTransformCallback = exports.createTransformCallback = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+         * Transforms the given callback function based on its type and number of arrays.
+         *
+         * @param {Function} callback - The callback function to transform.
+         * @param {number} numberOfArrays - The number of arrays to pass to the callback function.
+         * @returns {*} - The transformed callback function.
+         */
+  return function (callback, numberOfArrays) {
+    if (typed.isTypedFunction(callback)) {
+      return _transformTypedCallbackFunction(callback, numberOfArrays);
+    } else {
+      return _transformCallbackFunction(callback, callback.length, numberOfArrays);
+    }
+  };
+
+  /**
+       * Transforms the given typed callback function based on the number of arrays.
+       *
+       * @param {Function} typedFunction - The typed callback function to transform.
+       * @param {number} numberOfArrays - The number of arrays to pass to the callback function.
+       * @returns {*} - The transformed callback function.
+       */
+  function _transformTypedCallbackFunction(typedFunction, numberOfArrays) {
+    const signatures = Object.fromEntries(Object.entries(typedFunction.signatures).map(_ref2 => {
+      let [signature, callbackFunction] = _ref2;
+      const numberOfCallbackInputs = signature.split(',').length;
+      if (typed.isTypedFunction(callbackFunction)) {
+        return [signature, _transformTypedCallbackFunction(callbackFunction, numberOfArrays)];
+      } else {
+        return [signature, _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays)];
+      }
+    }));
+    if (typeof typedFunction.name === 'string') {
+      return typed(typedFunction.name, signatures);
+    } else {
+      return typed(signatures);
+    }
+  }
+});
+
+/**
+     * Transforms the callback function based on the number of callback inputs and arrays.
+     * There are three cases:
+     * 1. The callback function has N arguments.
+     * 2. The callback function has N+1 arguments.
+     * 3. The callback function has 2N+1 arguments.
+     *
+     * @param {Function} callbackFunction - The callback function to transform.
+     * @param {number} numberOfCallbackInputs - The number of callback inputs.
+     * @param {number} numberOfArrays - The number of arrays.
+     * @returns {Function} The transformed callback function.
+     */
+function _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays) {
+  if (numberOfCallbackInputs === numberOfArrays) {
+    return callbackFunction;
+  } else if (numberOfCallbackInputs === numberOfArrays + 1) {
+    return function () {
+      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+        args[_key] = arguments[_key];
+      }
+      const vals = args.slice(0, numberOfArrays);
+      const idx = _transformDims(args[numberOfArrays]);
+      return callbackFunction(...vals, idx);
+    };
+  } else if (numberOfCallbackInputs > numberOfArrays + 1) {
+    return function () {
+      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        args[_key2] = arguments[_key2];
+      }
+      const vals = args.slice(0, numberOfArrays);
+      const idx = _transformDims(args[numberOfArrays]);
+      const rest = args.slice(numberOfArrays + 1);
+      return callbackFunction(...vals, idx, ...rest);
+    };
+  } else {
+    return callbackFunction;
+  }
+}
+
+/**
+   * Transforms the dimensions by adding 1 to each dimension.
+   *
+   * @param {Array} dims - The dimensions to transform.
+   * @returns {Array} The transformed dimensions.
+   */
+function _transformDims(dims) {
+  return dims.map(dim => dim + 1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js b/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js
new file mode 100644
index 0000000..5087be9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/expression/transform/variance.transform.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVarianceTransform = void 0;
+var _factory = require("../../utils/factory.js");
+var _errorTransform = require("./utils/errorTransform.js");
+var _variance = require("../../function/statistics/variance.js");
+var _lastDimToZeroBase = require("./utils/lastDimToZeroBase.js");
+const name = 'variance';
+const dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];
+
+/**
+ * Attach a transform function to math.var
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function var
+ * from one-based to zero based
+ */
+const createVarianceTransform = exports.createVarianceTransform = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  } = _ref;
+  const variance = (0, _variance.createVariance)({
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  });
+  return typed(name, {
+    '...any': function (args) {
+      args = (0, _lastDimToZeroBase.lastDimToZeroBase)(args);
+      try {
+        return variance.apply(null, args);
+      } catch (err) {
+        throw (0, _errorTransform.errorTransform)(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/factoriesAny.js b/node_modules/mathjs/lib/cjs/factoriesAny.js
new file mode 100644
index 0000000..3f49bc9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/factoriesAny.js
@@ -0,0 +1,2499 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "createAbs", {
+  enumerable: true,
+  get: function () {
+    return _abs.createAbs;
+  }
+});
+Object.defineProperty(exports, "createAccessorNode", {
+  enumerable: true,
+  get: function () {
+    return _AccessorNode.createAccessorNode;
+  }
+});
+Object.defineProperty(exports, "createAcos", {
+  enumerable: true,
+  get: function () {
+    return _acos.createAcos;
+  }
+});
+Object.defineProperty(exports, "createAcosh", {
+  enumerable: true,
+  get: function () {
+    return _acosh.createAcosh;
+  }
+});
+Object.defineProperty(exports, "createAcot", {
+  enumerable: true,
+  get: function () {
+    return _acot.createAcot;
+  }
+});
+Object.defineProperty(exports, "createAcoth", {
+  enumerable: true,
+  get: function () {
+    return _acoth.createAcoth;
+  }
+});
+Object.defineProperty(exports, "createAcsc", {
+  enumerable: true,
+  get: function () {
+    return _acsc.createAcsc;
+  }
+});
+Object.defineProperty(exports, "createAcsch", {
+  enumerable: true,
+  get: function () {
+    return _acsch.createAcsch;
+  }
+});
+Object.defineProperty(exports, "createAdd", {
+  enumerable: true,
+  get: function () {
+    return _add.createAdd;
+  }
+});
+Object.defineProperty(exports, "createAddScalar", {
+  enumerable: true,
+  get: function () {
+    return _addScalar.createAddScalar;
+  }
+});
+Object.defineProperty(exports, "createAnd", {
+  enumerable: true,
+  get: function () {
+    return _and.createAnd;
+  }
+});
+Object.defineProperty(exports, "createAndTransform", {
+  enumerable: true,
+  get: function () {
+    return _andTransform.createAndTransform;
+  }
+});
+Object.defineProperty(exports, "createArg", {
+  enumerable: true,
+  get: function () {
+    return _arg.createArg;
+  }
+});
+Object.defineProperty(exports, "createArrayNode", {
+  enumerable: true,
+  get: function () {
+    return _ArrayNode.createArrayNode;
+  }
+});
+Object.defineProperty(exports, "createAsec", {
+  enumerable: true,
+  get: function () {
+    return _asec.createAsec;
+  }
+});
+Object.defineProperty(exports, "createAsech", {
+  enumerable: true,
+  get: function () {
+    return _asech.createAsech;
+  }
+});
+Object.defineProperty(exports, "createAsin", {
+  enumerable: true,
+  get: function () {
+    return _asin.createAsin;
+  }
+});
+Object.defineProperty(exports, "createAsinh", {
+  enumerable: true,
+  get: function () {
+    return _asinh.createAsinh;
+  }
+});
+Object.defineProperty(exports, "createAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _AssignmentNode.createAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createAtan", {
+  enumerable: true,
+  get: function () {
+    return _atan.createAtan;
+  }
+});
+Object.defineProperty(exports, "createAtan2", {
+  enumerable: true,
+  get: function () {
+    return _atan2.createAtan2;
+  }
+});
+Object.defineProperty(exports, "createAtanh", {
+  enumerable: true,
+  get: function () {
+    return _atanh.createAtanh;
+  }
+});
+Object.defineProperty(exports, "createAtomicMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createAtomicMass;
+  }
+});
+Object.defineProperty(exports, "createAvogadro", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createAvogadro;
+  }
+});
+Object.defineProperty(exports, "createBellNumbers", {
+  enumerable: true,
+  get: function () {
+    return _bellNumbers.createBellNumbers;
+  }
+});
+Object.defineProperty(exports, "createBigNumberClass", {
+  enumerable: true,
+  get: function () {
+    return _BigNumber.createBigNumberClass;
+  }
+});
+Object.defineProperty(exports, "createBigint", {
+  enumerable: true,
+  get: function () {
+    return _bigint.createBigint;
+  }
+});
+Object.defineProperty(exports, "createBignumber", {
+  enumerable: true,
+  get: function () {
+    return _bignumber.createBignumber;
+  }
+});
+Object.defineProperty(exports, "createBin", {
+  enumerable: true,
+  get: function () {
+    return _bin.createBin;
+  }
+});
+Object.defineProperty(exports, "createBitAnd", {
+  enumerable: true,
+  get: function () {
+    return _bitAnd.createBitAnd;
+  }
+});
+Object.defineProperty(exports, "createBitAndTransform", {
+  enumerable: true,
+  get: function () {
+    return _bitAndTransform.createBitAndTransform;
+  }
+});
+Object.defineProperty(exports, "createBitNot", {
+  enumerable: true,
+  get: function () {
+    return _bitNot.createBitNot;
+  }
+});
+Object.defineProperty(exports, "createBitOr", {
+  enumerable: true,
+  get: function () {
+    return _bitOr.createBitOr;
+  }
+});
+Object.defineProperty(exports, "createBitOrTransform", {
+  enumerable: true,
+  get: function () {
+    return _bitOrTransform.createBitOrTransform;
+  }
+});
+Object.defineProperty(exports, "createBitXor", {
+  enumerable: true,
+  get: function () {
+    return _bitXor.createBitXor;
+  }
+});
+Object.defineProperty(exports, "createBlockNode", {
+  enumerable: true,
+  get: function () {
+    return _BlockNode.createBlockNode;
+  }
+});
+Object.defineProperty(exports, "createBohrMagneton", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createBohrMagneton;
+  }
+});
+Object.defineProperty(exports, "createBohrRadius", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createBohrRadius;
+  }
+});
+Object.defineProperty(exports, "createBoltzmann", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createBoltzmann;
+  }
+});
+Object.defineProperty(exports, "createBoolean", {
+  enumerable: true,
+  get: function () {
+    return _boolean.createBoolean;
+  }
+});
+Object.defineProperty(exports, "createCatalan", {
+  enumerable: true,
+  get: function () {
+    return _catalan.createCatalan;
+  }
+});
+Object.defineProperty(exports, "createCbrt", {
+  enumerable: true,
+  get: function () {
+    return _cbrt.createCbrt;
+  }
+});
+Object.defineProperty(exports, "createCeil", {
+  enumerable: true,
+  get: function () {
+    return _ceil.createCeil;
+  }
+});
+Object.defineProperty(exports, "createChain", {
+  enumerable: true,
+  get: function () {
+    return _chain.createChain;
+  }
+});
+Object.defineProperty(exports, "createChainClass", {
+  enumerable: true,
+  get: function () {
+    return _Chain.createChainClass;
+  }
+});
+Object.defineProperty(exports, "createClassicalElectronRadius", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createClassicalElectronRadius;
+  }
+});
+Object.defineProperty(exports, "createClone", {
+  enumerable: true,
+  get: function () {
+    return _clone.createClone;
+  }
+});
+Object.defineProperty(exports, "createColumn", {
+  enumerable: true,
+  get: function () {
+    return _column.createColumn;
+  }
+});
+Object.defineProperty(exports, "createColumnTransform", {
+  enumerable: true,
+  get: function () {
+    return _columnTransform.createColumnTransform;
+  }
+});
+Object.defineProperty(exports, "createCombinations", {
+  enumerable: true,
+  get: function () {
+    return _combinations.createCombinations;
+  }
+});
+Object.defineProperty(exports, "createCombinationsWithRep", {
+  enumerable: true,
+  get: function () {
+    return _combinationsWithRep.createCombinationsWithRep;
+  }
+});
+Object.defineProperty(exports, "createCompare", {
+  enumerable: true,
+  get: function () {
+    return _compare.createCompare;
+  }
+});
+Object.defineProperty(exports, "createCompareNatural", {
+  enumerable: true,
+  get: function () {
+    return _compareNatural.createCompareNatural;
+  }
+});
+Object.defineProperty(exports, "createCompareText", {
+  enumerable: true,
+  get: function () {
+    return _compareText.createCompareText;
+  }
+});
+Object.defineProperty(exports, "createCompile", {
+  enumerable: true,
+  get: function () {
+    return _compile.createCompile;
+  }
+});
+Object.defineProperty(exports, "createComplex", {
+  enumerable: true,
+  get: function () {
+    return _complex.createComplex;
+  }
+});
+Object.defineProperty(exports, "createComplexClass", {
+  enumerable: true,
+  get: function () {
+    return _Complex.createComplexClass;
+  }
+});
+Object.defineProperty(exports, "createComposition", {
+  enumerable: true,
+  get: function () {
+    return _composition.createComposition;
+  }
+});
+Object.defineProperty(exports, "createConcat", {
+  enumerable: true,
+  get: function () {
+    return _concat.createConcat;
+  }
+});
+Object.defineProperty(exports, "createConcatTransform", {
+  enumerable: true,
+  get: function () {
+    return _concatTransform.createConcatTransform;
+  }
+});
+Object.defineProperty(exports, "createConditionalNode", {
+  enumerable: true,
+  get: function () {
+    return _ConditionalNode.createConditionalNode;
+  }
+});
+Object.defineProperty(exports, "createConductanceQuantum", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createConductanceQuantum;
+  }
+});
+Object.defineProperty(exports, "createConj", {
+  enumerable: true,
+  get: function () {
+    return _conj.createConj;
+  }
+});
+Object.defineProperty(exports, "createConstantNode", {
+  enumerable: true,
+  get: function () {
+    return _ConstantNode.createConstantNode;
+  }
+});
+Object.defineProperty(exports, "createCorr", {
+  enumerable: true,
+  get: function () {
+    return _corr.createCorr;
+  }
+});
+Object.defineProperty(exports, "createCos", {
+  enumerable: true,
+  get: function () {
+    return _cos.createCos;
+  }
+});
+Object.defineProperty(exports, "createCosh", {
+  enumerable: true,
+  get: function () {
+    return _cosh.createCosh;
+  }
+});
+Object.defineProperty(exports, "createCot", {
+  enumerable: true,
+  get: function () {
+    return _cot.createCot;
+  }
+});
+Object.defineProperty(exports, "createCoth", {
+  enumerable: true,
+  get: function () {
+    return _coth.createCoth;
+  }
+});
+Object.defineProperty(exports, "createCoulomb", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createCoulomb;
+  }
+});
+Object.defineProperty(exports, "createCoulombConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createCoulombConstant;
+  }
+});
+Object.defineProperty(exports, "createCount", {
+  enumerable: true,
+  get: function () {
+    return _count.createCount;
+  }
+});
+Object.defineProperty(exports, "createCreateUnit", {
+  enumerable: true,
+  get: function () {
+    return _createUnit.createCreateUnit;
+  }
+});
+Object.defineProperty(exports, "createCross", {
+  enumerable: true,
+  get: function () {
+    return _cross.createCross;
+  }
+});
+Object.defineProperty(exports, "createCsc", {
+  enumerable: true,
+  get: function () {
+    return _csc.createCsc;
+  }
+});
+Object.defineProperty(exports, "createCsch", {
+  enumerable: true,
+  get: function () {
+    return _csch.createCsch;
+  }
+});
+Object.defineProperty(exports, "createCtranspose", {
+  enumerable: true,
+  get: function () {
+    return _ctranspose.createCtranspose;
+  }
+});
+Object.defineProperty(exports, "createCube", {
+  enumerable: true,
+  get: function () {
+    return _cube.createCube;
+  }
+});
+Object.defineProperty(exports, "createCumSum", {
+  enumerable: true,
+  get: function () {
+    return _cumsum.createCumSum;
+  }
+});
+Object.defineProperty(exports, "createCumSumTransform", {
+  enumerable: true,
+  get: function () {
+    return _cumsumTransform.createCumSumTransform;
+  }
+});
+Object.defineProperty(exports, "createDeepEqual", {
+  enumerable: true,
+  get: function () {
+    return _deepEqual.createDeepEqual;
+  }
+});
+Object.defineProperty(exports, "createDenseMatrixClass", {
+  enumerable: true,
+  get: function () {
+    return _DenseMatrix.createDenseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createDerivative", {
+  enumerable: true,
+  get: function () {
+    return _derivative.createDerivative;
+  }
+});
+Object.defineProperty(exports, "createDet", {
+  enumerable: true,
+  get: function () {
+    return _det.createDet;
+  }
+});
+Object.defineProperty(exports, "createDeuteronMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createDeuteronMass;
+  }
+});
+Object.defineProperty(exports, "createDiag", {
+  enumerable: true,
+  get: function () {
+    return _diag.createDiag;
+  }
+});
+Object.defineProperty(exports, "createDiff", {
+  enumerable: true,
+  get: function () {
+    return _diff.createDiff;
+  }
+});
+Object.defineProperty(exports, "createDiffTransform", {
+  enumerable: true,
+  get: function () {
+    return _diffTransform.createDiffTransform;
+  }
+});
+Object.defineProperty(exports, "createDistance", {
+  enumerable: true,
+  get: function () {
+    return _distance.createDistance;
+  }
+});
+Object.defineProperty(exports, "createDivide", {
+  enumerable: true,
+  get: function () {
+    return _divide.createDivide;
+  }
+});
+Object.defineProperty(exports, "createDivideScalar", {
+  enumerable: true,
+  get: function () {
+    return _divideScalar.createDivideScalar;
+  }
+});
+Object.defineProperty(exports, "createDot", {
+  enumerable: true,
+  get: function () {
+    return _dot.createDot;
+  }
+});
+Object.defineProperty(exports, "createDotDivide", {
+  enumerable: true,
+  get: function () {
+    return _dotDivide.createDotDivide;
+  }
+});
+Object.defineProperty(exports, "createDotMultiply", {
+  enumerable: true,
+  get: function () {
+    return _dotMultiply.createDotMultiply;
+  }
+});
+Object.defineProperty(exports, "createDotPow", {
+  enumerable: true,
+  get: function () {
+    return _dotPow.createDotPow;
+  }
+});
+Object.defineProperty(exports, "createE", {
+  enumerable: true,
+  get: function () {
+    return _constants.createE;
+  }
+});
+Object.defineProperty(exports, "createEfimovFactor", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createEfimovFactor;
+  }
+});
+Object.defineProperty(exports, "createEigs", {
+  enumerable: true,
+  get: function () {
+    return _eigs.createEigs;
+  }
+});
+Object.defineProperty(exports, "createElectricConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createElectricConstant;
+  }
+});
+Object.defineProperty(exports, "createElectronMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createElectronMass;
+  }
+});
+Object.defineProperty(exports, "createElementaryCharge", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createElementaryCharge;
+  }
+});
+Object.defineProperty(exports, "createEqual", {
+  enumerable: true,
+  get: function () {
+    return _equal.createEqual;
+  }
+});
+Object.defineProperty(exports, "createEqualScalar", {
+  enumerable: true,
+  get: function () {
+    return _equalScalar.createEqualScalar;
+  }
+});
+Object.defineProperty(exports, "createEqualText", {
+  enumerable: true,
+  get: function () {
+    return _equalText.createEqualText;
+  }
+});
+Object.defineProperty(exports, "createErf", {
+  enumerable: true,
+  get: function () {
+    return _erf.createErf;
+  }
+});
+Object.defineProperty(exports, "createEvaluate", {
+  enumerable: true,
+  get: function () {
+    return _evaluate.createEvaluate;
+  }
+});
+Object.defineProperty(exports, "createExp", {
+  enumerable: true,
+  get: function () {
+    return _exp.createExp;
+  }
+});
+Object.defineProperty(exports, "createExpm", {
+  enumerable: true,
+  get: function () {
+    return _expm2.createExpm;
+  }
+});
+Object.defineProperty(exports, "createExpm1", {
+  enumerable: true,
+  get: function () {
+    return _expm.createExpm1;
+  }
+});
+Object.defineProperty(exports, "createFactorial", {
+  enumerable: true,
+  get: function () {
+    return _factorial.createFactorial;
+  }
+});
+Object.defineProperty(exports, "createFalse", {
+  enumerable: true,
+  get: function () {
+    return _constants.createFalse;
+  }
+});
+Object.defineProperty(exports, "createFaraday", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createFaraday;
+  }
+});
+Object.defineProperty(exports, "createFermiCoupling", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createFermiCoupling;
+  }
+});
+Object.defineProperty(exports, "createFft", {
+  enumerable: true,
+  get: function () {
+    return _fft.createFft;
+  }
+});
+Object.defineProperty(exports, "createFibonacciHeapClass", {
+  enumerable: true,
+  get: function () {
+    return _FibonacciHeap.createFibonacciHeapClass;
+  }
+});
+Object.defineProperty(exports, "createFilter", {
+  enumerable: true,
+  get: function () {
+    return _filter.createFilter;
+  }
+});
+Object.defineProperty(exports, "createFilterTransform", {
+  enumerable: true,
+  get: function () {
+    return _filterTransform.createFilterTransform;
+  }
+});
+Object.defineProperty(exports, "createFineStructure", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createFineStructure;
+  }
+});
+Object.defineProperty(exports, "createFirstRadiation", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createFirstRadiation;
+  }
+});
+Object.defineProperty(exports, "createFix", {
+  enumerable: true,
+  get: function () {
+    return _fix.createFix;
+  }
+});
+Object.defineProperty(exports, "createFlatten", {
+  enumerable: true,
+  get: function () {
+    return _flatten.createFlatten;
+  }
+});
+Object.defineProperty(exports, "createFloor", {
+  enumerable: true,
+  get: function () {
+    return _floor.createFloor;
+  }
+});
+Object.defineProperty(exports, "createForEach", {
+  enumerable: true,
+  get: function () {
+    return _forEach.createForEach;
+  }
+});
+Object.defineProperty(exports, "createForEachTransform", {
+  enumerable: true,
+  get: function () {
+    return _forEachTransform.createForEachTransform;
+  }
+});
+Object.defineProperty(exports, "createFormat", {
+  enumerable: true,
+  get: function () {
+    return _format.createFormat;
+  }
+});
+Object.defineProperty(exports, "createFraction", {
+  enumerable: true,
+  get: function () {
+    return _fraction.createFraction;
+  }
+});
+Object.defineProperty(exports, "createFractionClass", {
+  enumerable: true,
+  get: function () {
+    return _Fraction.createFractionClass;
+  }
+});
+Object.defineProperty(exports, "createFreqz", {
+  enumerable: true,
+  get: function () {
+    return _freqz.createFreqz;
+  }
+});
+Object.defineProperty(exports, "createFunctionAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _FunctionAssignmentNode.createFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createFunctionNode", {
+  enumerable: true,
+  get: function () {
+    return _FunctionNode.createFunctionNode;
+  }
+});
+Object.defineProperty(exports, "createGamma", {
+  enumerable: true,
+  get: function () {
+    return _gamma.createGamma;
+  }
+});
+Object.defineProperty(exports, "createGasConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createGasConstant;
+  }
+});
+Object.defineProperty(exports, "createGcd", {
+  enumerable: true,
+  get: function () {
+    return _gcd.createGcd;
+  }
+});
+Object.defineProperty(exports, "createGetMatrixDataType", {
+  enumerable: true,
+  get: function () {
+    return _getMatrixDataType.createGetMatrixDataType;
+  }
+});
+Object.defineProperty(exports, "createGravitationConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createGravitationConstant;
+  }
+});
+Object.defineProperty(exports, "createGravity", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createGravity;
+  }
+});
+Object.defineProperty(exports, "createHartreeEnergy", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createHartreeEnergy;
+  }
+});
+Object.defineProperty(exports, "createHasNumericValue", {
+  enumerable: true,
+  get: function () {
+    return _hasNumericValue.createHasNumericValue;
+  }
+});
+Object.defineProperty(exports, "createHelp", {
+  enumerable: true,
+  get: function () {
+    return _help.createHelp;
+  }
+});
+Object.defineProperty(exports, "createHelpClass", {
+  enumerable: true,
+  get: function () {
+    return _Help.createHelpClass;
+  }
+});
+Object.defineProperty(exports, "createHex", {
+  enumerable: true,
+  get: function () {
+    return _hex.createHex;
+  }
+});
+Object.defineProperty(exports, "createHypot", {
+  enumerable: true,
+  get: function () {
+    return _hypot.createHypot;
+  }
+});
+Object.defineProperty(exports, "createI", {
+  enumerable: true,
+  get: function () {
+    return _constants.createI;
+  }
+});
+Object.defineProperty(exports, "createIdentity", {
+  enumerable: true,
+  get: function () {
+    return _identity.createIdentity;
+  }
+});
+Object.defineProperty(exports, "createIfft", {
+  enumerable: true,
+  get: function () {
+    return _ifft.createIfft;
+  }
+});
+Object.defineProperty(exports, "createIm", {
+  enumerable: true,
+  get: function () {
+    return _im.createIm;
+  }
+});
+Object.defineProperty(exports, "createImmutableDenseMatrixClass", {
+  enumerable: true,
+  get: function () {
+    return _ImmutableDenseMatrix.createImmutableDenseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createIndex", {
+  enumerable: true,
+  get: function () {
+    return _index.createIndex;
+  }
+});
+Object.defineProperty(exports, "createIndexClass", {
+  enumerable: true,
+  get: function () {
+    return _MatrixIndex.createIndexClass;
+  }
+});
+Object.defineProperty(exports, "createIndexNode", {
+  enumerable: true,
+  get: function () {
+    return _IndexNode.createIndexNode;
+  }
+});
+Object.defineProperty(exports, "createIndexTransform", {
+  enumerable: true,
+  get: function () {
+    return _indexTransform.createIndexTransform;
+  }
+});
+Object.defineProperty(exports, "createInfinity", {
+  enumerable: true,
+  get: function () {
+    return _constants.createInfinity;
+  }
+});
+Object.defineProperty(exports, "createIntersect", {
+  enumerable: true,
+  get: function () {
+    return _intersect.createIntersect;
+  }
+});
+Object.defineProperty(exports, "createInv", {
+  enumerable: true,
+  get: function () {
+    return _inv.createInv;
+  }
+});
+Object.defineProperty(exports, "createInverseConductanceQuantum", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createInverseConductanceQuantum;
+  }
+});
+Object.defineProperty(exports, "createInvmod", {
+  enumerable: true,
+  get: function () {
+    return _invmod.createInvmod;
+  }
+});
+Object.defineProperty(exports, "createIsInteger", {
+  enumerable: true,
+  get: function () {
+    return _isInteger.createIsInteger;
+  }
+});
+Object.defineProperty(exports, "createIsNaN", {
+  enumerable: true,
+  get: function () {
+    return _isNaN.createIsNaN;
+  }
+});
+Object.defineProperty(exports, "createIsNegative", {
+  enumerable: true,
+  get: function () {
+    return _isNegative.createIsNegative;
+  }
+});
+Object.defineProperty(exports, "createIsNumeric", {
+  enumerable: true,
+  get: function () {
+    return _isNumeric.createIsNumeric;
+  }
+});
+Object.defineProperty(exports, "createIsPositive", {
+  enumerable: true,
+  get: function () {
+    return _isPositive.createIsPositive;
+  }
+});
+Object.defineProperty(exports, "createIsPrime", {
+  enumerable: true,
+  get: function () {
+    return _isPrime.createIsPrime;
+  }
+});
+Object.defineProperty(exports, "createIsZero", {
+  enumerable: true,
+  get: function () {
+    return _isZero.createIsZero;
+  }
+});
+Object.defineProperty(exports, "createKldivergence", {
+  enumerable: true,
+  get: function () {
+    return _kldivergence.createKldivergence;
+  }
+});
+Object.defineProperty(exports, "createKlitzing", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createKlitzing;
+  }
+});
+Object.defineProperty(exports, "createKron", {
+  enumerable: true,
+  get: function () {
+    return _kron.createKron;
+  }
+});
+Object.defineProperty(exports, "createLN10", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLN10;
+  }
+});
+Object.defineProperty(exports, "createLN2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLN2;
+  }
+});
+Object.defineProperty(exports, "createLOG10E", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLOG10E;
+  }
+});
+Object.defineProperty(exports, "createLOG2E", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLOG2E;
+  }
+});
+Object.defineProperty(exports, "createLarger", {
+  enumerable: true,
+  get: function () {
+    return _larger.createLarger;
+  }
+});
+Object.defineProperty(exports, "createLargerEq", {
+  enumerable: true,
+  get: function () {
+    return _largerEq.createLargerEq;
+  }
+});
+Object.defineProperty(exports, "createLcm", {
+  enumerable: true,
+  get: function () {
+    return _lcm.createLcm;
+  }
+});
+Object.defineProperty(exports, "createLeafCount", {
+  enumerable: true,
+  get: function () {
+    return _leafCount.createLeafCount;
+  }
+});
+Object.defineProperty(exports, "createLeftShift", {
+  enumerable: true,
+  get: function () {
+    return _leftShift.createLeftShift;
+  }
+});
+Object.defineProperty(exports, "createLgamma", {
+  enumerable: true,
+  get: function () {
+    return _lgamma.createLgamma;
+  }
+});
+Object.defineProperty(exports, "createLog", {
+  enumerable: true,
+  get: function () {
+    return _log3.createLog;
+  }
+});
+Object.defineProperty(exports, "createLog10", {
+  enumerable: true,
+  get: function () {
+    return _log.createLog10;
+  }
+});
+Object.defineProperty(exports, "createLog1p", {
+  enumerable: true,
+  get: function () {
+    return _log1p.createLog1p;
+  }
+});
+Object.defineProperty(exports, "createLog2", {
+  enumerable: true,
+  get: function () {
+    return _log2.createLog2;
+  }
+});
+Object.defineProperty(exports, "createLoschmidt", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createLoschmidt;
+  }
+});
+Object.defineProperty(exports, "createLsolve", {
+  enumerable: true,
+  get: function () {
+    return _lsolve.createLsolve;
+  }
+});
+Object.defineProperty(exports, "createLsolveAll", {
+  enumerable: true,
+  get: function () {
+    return _lsolveAll.createLsolveAll;
+  }
+});
+Object.defineProperty(exports, "createLup", {
+  enumerable: true,
+  get: function () {
+    return _lup.createLup;
+  }
+});
+Object.defineProperty(exports, "createLusolve", {
+  enumerable: true,
+  get: function () {
+    return _lusolve.createLusolve;
+  }
+});
+Object.defineProperty(exports, "createLyap", {
+  enumerable: true,
+  get: function () {
+    return _lyap.createLyap;
+  }
+});
+Object.defineProperty(exports, "createMad", {
+  enumerable: true,
+  get: function () {
+    return _mad.createMad;
+  }
+});
+Object.defineProperty(exports, "createMagneticConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMagneticConstant;
+  }
+});
+Object.defineProperty(exports, "createMagneticFluxQuantum", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMagneticFluxQuantum;
+  }
+});
+Object.defineProperty(exports, "createMap", {
+  enumerable: true,
+  get: function () {
+    return _map.createMap;
+  }
+});
+Object.defineProperty(exports, "createMapSlices", {
+  enumerable: true,
+  get: function () {
+    return _mapSlices.createMapSlices;
+  }
+});
+Object.defineProperty(exports, "createMapSlicesTransform", {
+  enumerable: true,
+  get: function () {
+    return _mapSlicesTransform.createMapSlicesTransform;
+  }
+});
+Object.defineProperty(exports, "createMapTransform", {
+  enumerable: true,
+  get: function () {
+    return _mapTransform.createMapTransform;
+  }
+});
+Object.defineProperty(exports, "createMatrix", {
+  enumerable: true,
+  get: function () {
+    return _matrix.createMatrix;
+  }
+});
+Object.defineProperty(exports, "createMatrixClass", {
+  enumerable: true,
+  get: function () {
+    return _Matrix.createMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromColumns", {
+  enumerable: true,
+  get: function () {
+    return _matrixFromColumns.createMatrixFromColumns;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromFunction", {
+  enumerable: true,
+  get: function () {
+    return _matrixFromFunction.createMatrixFromFunction;
+  }
+});
+Object.defineProperty(exports, "createMatrixFromRows", {
+  enumerable: true,
+  get: function () {
+    return _matrixFromRows.createMatrixFromRows;
+  }
+});
+Object.defineProperty(exports, "createMax", {
+  enumerable: true,
+  get: function () {
+    return _max.createMax;
+  }
+});
+Object.defineProperty(exports, "createMaxTransform", {
+  enumerable: true,
+  get: function () {
+    return _maxTransform.createMaxTransform;
+  }
+});
+Object.defineProperty(exports, "createMean", {
+  enumerable: true,
+  get: function () {
+    return _mean.createMean;
+  }
+});
+Object.defineProperty(exports, "createMeanTransform", {
+  enumerable: true,
+  get: function () {
+    return _meanTransform.createMeanTransform;
+  }
+});
+Object.defineProperty(exports, "createMedian", {
+  enumerable: true,
+  get: function () {
+    return _median.createMedian;
+  }
+});
+Object.defineProperty(exports, "createMin", {
+  enumerable: true,
+  get: function () {
+    return _min.createMin;
+  }
+});
+Object.defineProperty(exports, "createMinTransform", {
+  enumerable: true,
+  get: function () {
+    return _minTransform.createMinTransform;
+  }
+});
+Object.defineProperty(exports, "createMod", {
+  enumerable: true,
+  get: function () {
+    return _mod.createMod;
+  }
+});
+Object.defineProperty(exports, "createMode", {
+  enumerable: true,
+  get: function () {
+    return _mode.createMode;
+  }
+});
+Object.defineProperty(exports, "createMolarMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMolarMass;
+  }
+});
+Object.defineProperty(exports, "createMolarMassC12", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMolarMassC12;
+  }
+});
+Object.defineProperty(exports, "createMolarPlanckConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMolarPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createMolarVolume", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createMolarVolume;
+  }
+});
+Object.defineProperty(exports, "createMultinomial", {
+  enumerable: true,
+  get: function () {
+    return _multinomial.createMultinomial;
+  }
+});
+Object.defineProperty(exports, "createMultiply", {
+  enumerable: true,
+  get: function () {
+    return _multiply.createMultiply;
+  }
+});
+Object.defineProperty(exports, "createMultiplyScalar", {
+  enumerable: true,
+  get: function () {
+    return _multiplyScalar.createMultiplyScalar;
+  }
+});
+Object.defineProperty(exports, "createNaN", {
+  enumerable: true,
+  get: function () {
+    return _constants.createNaN;
+  }
+});
+Object.defineProperty(exports, "createNeutronMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createNeutronMass;
+  }
+});
+Object.defineProperty(exports, "createNode", {
+  enumerable: true,
+  get: function () {
+    return _Node.createNode;
+  }
+});
+Object.defineProperty(exports, "createNorm", {
+  enumerable: true,
+  get: function () {
+    return _norm.createNorm;
+  }
+});
+Object.defineProperty(exports, "createNot", {
+  enumerable: true,
+  get: function () {
+    return _not.createNot;
+  }
+});
+Object.defineProperty(exports, "createNthRoot", {
+  enumerable: true,
+  get: function () {
+    return _nthRoot.createNthRoot;
+  }
+});
+Object.defineProperty(exports, "createNthRoots", {
+  enumerable: true,
+  get: function () {
+    return _nthRoots.createNthRoots;
+  }
+});
+Object.defineProperty(exports, "createNuclearMagneton", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createNuclearMagneton;
+  }
+});
+Object.defineProperty(exports, "createNull", {
+  enumerable: true,
+  get: function () {
+    return _constants.createNull;
+  }
+});
+Object.defineProperty(exports, "createNullish", {
+  enumerable: true,
+  get: function () {
+    return _nullish.createNullish;
+  }
+});
+Object.defineProperty(exports, "createNullishTransform", {
+  enumerable: true,
+  get: function () {
+    return _nullishTransform.createNullishTransform;
+  }
+});
+Object.defineProperty(exports, "createNumber", {
+  enumerable: true,
+  get: function () {
+    return _number.createNumber;
+  }
+});
+Object.defineProperty(exports, "createNumeric", {
+  enumerable: true,
+  get: function () {
+    return _numeric.createNumeric;
+  }
+});
+Object.defineProperty(exports, "createObjectNode", {
+  enumerable: true,
+  get: function () {
+    return _ObjectNode.createObjectNode;
+  }
+});
+Object.defineProperty(exports, "createOct", {
+  enumerable: true,
+  get: function () {
+    return _oct.createOct;
+  }
+});
+Object.defineProperty(exports, "createOnes", {
+  enumerable: true,
+  get: function () {
+    return _ones.createOnes;
+  }
+});
+Object.defineProperty(exports, "createOperatorNode", {
+  enumerable: true,
+  get: function () {
+    return _OperatorNode.createOperatorNode;
+  }
+});
+Object.defineProperty(exports, "createOr", {
+  enumerable: true,
+  get: function () {
+    return _or.createOr;
+  }
+});
+Object.defineProperty(exports, "createOrTransform", {
+  enumerable: true,
+  get: function () {
+    return _orTransform.createOrTransform;
+  }
+});
+Object.defineProperty(exports, "createParenthesisNode", {
+  enumerable: true,
+  get: function () {
+    return _ParenthesisNode.createParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "createParse", {
+  enumerable: true,
+  get: function () {
+    return _parse.createParse;
+  }
+});
+Object.defineProperty(exports, "createParser", {
+  enumerable: true,
+  get: function () {
+    return _parser.createParser;
+  }
+});
+Object.defineProperty(exports, "createParserClass", {
+  enumerable: true,
+  get: function () {
+    return _Parser.createParserClass;
+  }
+});
+Object.defineProperty(exports, "createPartitionSelect", {
+  enumerable: true,
+  get: function () {
+    return _partitionSelect.createPartitionSelect;
+  }
+});
+Object.defineProperty(exports, "createPermutations", {
+  enumerable: true,
+  get: function () {
+    return _permutations.createPermutations;
+  }
+});
+Object.defineProperty(exports, "createPhi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createPhi;
+  }
+});
+Object.defineProperty(exports, "createPi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createPi;
+  }
+});
+Object.defineProperty(exports, "createPickRandom", {
+  enumerable: true,
+  get: function () {
+    return _pickRandom.createPickRandom;
+  }
+});
+Object.defineProperty(exports, "createPinv", {
+  enumerable: true,
+  get: function () {
+    return _pinv.createPinv;
+  }
+});
+Object.defineProperty(exports, "createPlanckCharge", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckCharge;
+  }
+});
+Object.defineProperty(exports, "createPlanckConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createPlanckLength", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckLength;
+  }
+});
+Object.defineProperty(exports, "createPlanckMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckMass;
+  }
+});
+Object.defineProperty(exports, "createPlanckTemperature", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckTemperature;
+  }
+});
+Object.defineProperty(exports, "createPlanckTime", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createPlanckTime;
+  }
+});
+Object.defineProperty(exports, "createPolynomialRoot", {
+  enumerable: true,
+  get: function () {
+    return _polynomialRoot.createPolynomialRoot;
+  }
+});
+Object.defineProperty(exports, "createPow", {
+  enumerable: true,
+  get: function () {
+    return _pow.createPow;
+  }
+});
+Object.defineProperty(exports, "createPrint", {
+  enumerable: true,
+  get: function () {
+    return _print.createPrint;
+  }
+});
+Object.defineProperty(exports, "createPrintTransform", {
+  enumerable: true,
+  get: function () {
+    return _printTransform.createPrintTransform;
+  }
+});
+Object.defineProperty(exports, "createProd", {
+  enumerable: true,
+  get: function () {
+    return _prod.createProd;
+  }
+});
+Object.defineProperty(exports, "createProtonMass", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createProtonMass;
+  }
+});
+Object.defineProperty(exports, "createQr", {
+  enumerable: true,
+  get: function () {
+    return _qr.createQr;
+  }
+});
+Object.defineProperty(exports, "createQuantileSeq", {
+  enumerable: true,
+  get: function () {
+    return _quantileSeq.createQuantileSeq;
+  }
+});
+Object.defineProperty(exports, "createQuantileSeqTransform", {
+  enumerable: true,
+  get: function () {
+    return _quantileSeqTransform.createQuantileSeqTransform;
+  }
+});
+Object.defineProperty(exports, "createQuantumOfCirculation", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createQuantumOfCirculation;
+  }
+});
+Object.defineProperty(exports, "createRandom", {
+  enumerable: true,
+  get: function () {
+    return _random.createRandom;
+  }
+});
+Object.defineProperty(exports, "createRandomInt", {
+  enumerable: true,
+  get: function () {
+    return _randomInt.createRandomInt;
+  }
+});
+Object.defineProperty(exports, "createRange", {
+  enumerable: true,
+  get: function () {
+    return _range.createRange;
+  }
+});
+Object.defineProperty(exports, "createRangeClass", {
+  enumerable: true,
+  get: function () {
+    return _Range.createRangeClass;
+  }
+});
+Object.defineProperty(exports, "createRangeNode", {
+  enumerable: true,
+  get: function () {
+    return _RangeNode.createRangeNode;
+  }
+});
+Object.defineProperty(exports, "createRangeTransform", {
+  enumerable: true,
+  get: function () {
+    return _rangeTransform.createRangeTransform;
+  }
+});
+Object.defineProperty(exports, "createRationalize", {
+  enumerable: true,
+  get: function () {
+    return _rationalize.createRationalize;
+  }
+});
+Object.defineProperty(exports, "createRe", {
+  enumerable: true,
+  get: function () {
+    return _re.createRe;
+  }
+});
+Object.defineProperty(exports, "createReducedPlanckConstant", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createReducedPlanckConstant;
+  }
+});
+Object.defineProperty(exports, "createRelationalNode", {
+  enumerable: true,
+  get: function () {
+    return _RelationalNode.createRelationalNode;
+  }
+});
+Object.defineProperty(exports, "createReplacer", {
+  enumerable: true,
+  get: function () {
+    return _replacer.createReplacer;
+  }
+});
+Object.defineProperty(exports, "createReshape", {
+  enumerable: true,
+  get: function () {
+    return _reshape.createReshape;
+  }
+});
+Object.defineProperty(exports, "createResize", {
+  enumerable: true,
+  get: function () {
+    return _resize.createResize;
+  }
+});
+Object.defineProperty(exports, "createResolve", {
+  enumerable: true,
+  get: function () {
+    return _resolve.createResolve;
+  }
+});
+Object.defineProperty(exports, "createResultSet", {
+  enumerable: true,
+  get: function () {
+    return _ResultSet.createResultSet;
+  }
+});
+Object.defineProperty(exports, "createReviver", {
+  enumerable: true,
+  get: function () {
+    return _reviver.createReviver;
+  }
+});
+Object.defineProperty(exports, "createRightArithShift", {
+  enumerable: true,
+  get: function () {
+    return _rightArithShift.createRightArithShift;
+  }
+});
+Object.defineProperty(exports, "createRightLogShift", {
+  enumerable: true,
+  get: function () {
+    return _rightLogShift.createRightLogShift;
+  }
+});
+Object.defineProperty(exports, "createRotate", {
+  enumerable: true,
+  get: function () {
+    return _rotate.createRotate;
+  }
+});
+Object.defineProperty(exports, "createRotationMatrix", {
+  enumerable: true,
+  get: function () {
+    return _rotationMatrix.createRotationMatrix;
+  }
+});
+Object.defineProperty(exports, "createRound", {
+  enumerable: true,
+  get: function () {
+    return _round.createRound;
+  }
+});
+Object.defineProperty(exports, "createRow", {
+  enumerable: true,
+  get: function () {
+    return _row.createRow;
+  }
+});
+Object.defineProperty(exports, "createRowTransform", {
+  enumerable: true,
+  get: function () {
+    return _rowTransform.createRowTransform;
+  }
+});
+Object.defineProperty(exports, "createRydberg", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createRydberg;
+  }
+});
+Object.defineProperty(exports, "createSQRT1_2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createSQRT1_2;
+  }
+});
+Object.defineProperty(exports, "createSQRT2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createSQRT2;
+  }
+});
+Object.defineProperty(exports, "createSackurTetrode", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createSackurTetrode;
+  }
+});
+Object.defineProperty(exports, "createSchur", {
+  enumerable: true,
+  get: function () {
+    return _schur.createSchur;
+  }
+});
+Object.defineProperty(exports, "createSec", {
+  enumerable: true,
+  get: function () {
+    return _sec.createSec;
+  }
+});
+Object.defineProperty(exports, "createSech", {
+  enumerable: true,
+  get: function () {
+    return _sech.createSech;
+  }
+});
+Object.defineProperty(exports, "createSecondRadiation", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createSecondRadiation;
+  }
+});
+Object.defineProperty(exports, "createSetCartesian", {
+  enumerable: true,
+  get: function () {
+    return _setCartesian.createSetCartesian;
+  }
+});
+Object.defineProperty(exports, "createSetDifference", {
+  enumerable: true,
+  get: function () {
+    return _setDifference.createSetDifference;
+  }
+});
+Object.defineProperty(exports, "createSetDistinct", {
+  enumerable: true,
+  get: function () {
+    return _setDistinct.createSetDistinct;
+  }
+});
+Object.defineProperty(exports, "createSetIntersect", {
+  enumerable: true,
+  get: function () {
+    return _setIntersect.createSetIntersect;
+  }
+});
+Object.defineProperty(exports, "createSetIsSubset", {
+  enumerable: true,
+  get: function () {
+    return _setIsSubset.createSetIsSubset;
+  }
+});
+Object.defineProperty(exports, "createSetMultiplicity", {
+  enumerable: true,
+  get: function () {
+    return _setMultiplicity.createSetMultiplicity;
+  }
+});
+Object.defineProperty(exports, "createSetPowerset", {
+  enumerable: true,
+  get: function () {
+    return _setPowerset.createSetPowerset;
+  }
+});
+Object.defineProperty(exports, "createSetSize", {
+  enumerable: true,
+  get: function () {
+    return _setSize.createSetSize;
+  }
+});
+Object.defineProperty(exports, "createSetSymDifference", {
+  enumerable: true,
+  get: function () {
+    return _setSymDifference.createSetSymDifference;
+  }
+});
+Object.defineProperty(exports, "createSetUnion", {
+  enumerable: true,
+  get: function () {
+    return _setUnion.createSetUnion;
+  }
+});
+Object.defineProperty(exports, "createSign", {
+  enumerable: true,
+  get: function () {
+    return _sign.createSign;
+  }
+});
+Object.defineProperty(exports, "createSimplify", {
+  enumerable: true,
+  get: function () {
+    return _simplify.createSimplify;
+  }
+});
+Object.defineProperty(exports, "createSimplifyConstant", {
+  enumerable: true,
+  get: function () {
+    return _simplifyConstant.createSimplifyConstant;
+  }
+});
+Object.defineProperty(exports, "createSimplifyCore", {
+  enumerable: true,
+  get: function () {
+    return _simplifyCore.createSimplifyCore;
+  }
+});
+Object.defineProperty(exports, "createSin", {
+  enumerable: true,
+  get: function () {
+    return _sin.createSin;
+  }
+});
+Object.defineProperty(exports, "createSinh", {
+  enumerable: true,
+  get: function () {
+    return _sinh.createSinh;
+  }
+});
+Object.defineProperty(exports, "createSize", {
+  enumerable: true,
+  get: function () {
+    return _size.createSize;
+  }
+});
+Object.defineProperty(exports, "createSlu", {
+  enumerable: true,
+  get: function () {
+    return _slu.createSlu;
+  }
+});
+Object.defineProperty(exports, "createSmaller", {
+  enumerable: true,
+  get: function () {
+    return _smaller.createSmaller;
+  }
+});
+Object.defineProperty(exports, "createSmallerEq", {
+  enumerable: true,
+  get: function () {
+    return _smallerEq.createSmallerEq;
+  }
+});
+Object.defineProperty(exports, "createSolveODE", {
+  enumerable: true,
+  get: function () {
+    return _solveODE.createSolveODE;
+  }
+});
+Object.defineProperty(exports, "createSort", {
+  enumerable: true,
+  get: function () {
+    return _sort.createSort;
+  }
+});
+Object.defineProperty(exports, "createSpaClass", {
+  enumerable: true,
+  get: function () {
+    return _Spa.createSpaClass;
+  }
+});
+Object.defineProperty(exports, "createSparse", {
+  enumerable: true,
+  get: function () {
+    return _sparse.createSparse;
+  }
+});
+Object.defineProperty(exports, "createSparseMatrixClass", {
+  enumerable: true,
+  get: function () {
+    return _SparseMatrix.createSparseMatrixClass;
+  }
+});
+Object.defineProperty(exports, "createSpeedOfLight", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createSpeedOfLight;
+  }
+});
+Object.defineProperty(exports, "createSplitUnit", {
+  enumerable: true,
+  get: function () {
+    return _splitUnit.createSplitUnit;
+  }
+});
+Object.defineProperty(exports, "createSqrt", {
+  enumerable: true,
+  get: function () {
+    return _sqrt.createSqrt;
+  }
+});
+Object.defineProperty(exports, "createSqrtm", {
+  enumerable: true,
+  get: function () {
+    return _sqrtm.createSqrtm;
+  }
+});
+Object.defineProperty(exports, "createSquare", {
+  enumerable: true,
+  get: function () {
+    return _square.createSquare;
+  }
+});
+Object.defineProperty(exports, "createSqueeze", {
+  enumerable: true,
+  get: function () {
+    return _squeeze.createSqueeze;
+  }
+});
+Object.defineProperty(exports, "createStd", {
+  enumerable: true,
+  get: function () {
+    return _std.createStd;
+  }
+});
+Object.defineProperty(exports, "createStdTransform", {
+  enumerable: true,
+  get: function () {
+    return _stdTransform.createStdTransform;
+  }
+});
+Object.defineProperty(exports, "createStefanBoltzmann", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createStefanBoltzmann;
+  }
+});
+Object.defineProperty(exports, "createStirlingS2", {
+  enumerable: true,
+  get: function () {
+    return _stirlingS.createStirlingS2;
+  }
+});
+Object.defineProperty(exports, "createString", {
+  enumerable: true,
+  get: function () {
+    return _string.createString;
+  }
+});
+Object.defineProperty(exports, "createSubset", {
+  enumerable: true,
+  get: function () {
+    return _subset.createSubset;
+  }
+});
+Object.defineProperty(exports, "createSubsetTransform", {
+  enumerable: true,
+  get: function () {
+    return _subsetTransform.createSubsetTransform;
+  }
+});
+Object.defineProperty(exports, "createSubtract", {
+  enumerable: true,
+  get: function () {
+    return _subtract.createSubtract;
+  }
+});
+Object.defineProperty(exports, "createSubtractScalar", {
+  enumerable: true,
+  get: function () {
+    return _subtractScalar.createSubtractScalar;
+  }
+});
+Object.defineProperty(exports, "createSum", {
+  enumerable: true,
+  get: function () {
+    return _sum.createSum;
+  }
+});
+Object.defineProperty(exports, "createSumTransform", {
+  enumerable: true,
+  get: function () {
+    return _sumTransform.createSumTransform;
+  }
+});
+Object.defineProperty(exports, "createSylvester", {
+  enumerable: true,
+  get: function () {
+    return _sylvester.createSylvester;
+  }
+});
+Object.defineProperty(exports, "createSymbolNode", {
+  enumerable: true,
+  get: function () {
+    return _SymbolNode.createSymbolNode;
+  }
+});
+Object.defineProperty(exports, "createSymbolicEqual", {
+  enumerable: true,
+  get: function () {
+    return _symbolicEqual.createSymbolicEqual;
+  }
+});
+Object.defineProperty(exports, "createTan", {
+  enumerable: true,
+  get: function () {
+    return _tan.createTan;
+  }
+});
+Object.defineProperty(exports, "createTanh", {
+  enumerable: true,
+  get: function () {
+    return _tanh.createTanh;
+  }
+});
+Object.defineProperty(exports, "createTau", {
+  enumerable: true,
+  get: function () {
+    return _constants.createTau;
+  }
+});
+Object.defineProperty(exports, "createThomsonCrossSection", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createThomsonCrossSection;
+  }
+});
+Object.defineProperty(exports, "createTo", {
+  enumerable: true,
+  get: function () {
+    return _to.createTo;
+  }
+});
+Object.defineProperty(exports, "createToBest", {
+  enumerable: true,
+  get: function () {
+    return _toBest.createToBest;
+  }
+});
+Object.defineProperty(exports, "createTrace", {
+  enumerable: true,
+  get: function () {
+    return _trace.createTrace;
+  }
+});
+Object.defineProperty(exports, "createTranspose", {
+  enumerable: true,
+  get: function () {
+    return _transpose.createTranspose;
+  }
+});
+Object.defineProperty(exports, "createTrue", {
+  enumerable: true,
+  get: function () {
+    return _constants.createTrue;
+  }
+});
+Object.defineProperty(exports, "createTypeOf", {
+  enumerable: true,
+  get: function () {
+    return _typeOf.createTypeOf;
+  }
+});
+Object.defineProperty(exports, "createTyped", {
+  enumerable: true,
+  get: function () {
+    return _typed.createTyped;
+  }
+});
+Object.defineProperty(exports, "createUnaryMinus", {
+  enumerable: true,
+  get: function () {
+    return _unaryMinus.createUnaryMinus;
+  }
+});
+Object.defineProperty(exports, "createUnaryPlus", {
+  enumerable: true,
+  get: function () {
+    return _unaryPlus.createUnaryPlus;
+  }
+});
+Object.defineProperty(exports, "createUnequal", {
+  enumerable: true,
+  get: function () {
+    return _unequal.createUnequal;
+  }
+});
+Object.defineProperty(exports, "createUnitClass", {
+  enumerable: true,
+  get: function () {
+    return _Unit.createUnitClass;
+  }
+});
+Object.defineProperty(exports, "createUnitFunction", {
+  enumerable: true,
+  get: function () {
+    return _unit.createUnitFunction;
+  }
+});
+Object.defineProperty(exports, "createUppercaseE", {
+  enumerable: true,
+  get: function () {
+    return _constants.createUppercaseE;
+  }
+});
+Object.defineProperty(exports, "createUppercasePi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createUppercasePi;
+  }
+});
+Object.defineProperty(exports, "createUsolve", {
+  enumerable: true,
+  get: function () {
+    return _usolve.createUsolve;
+  }
+});
+Object.defineProperty(exports, "createUsolveAll", {
+  enumerable: true,
+  get: function () {
+    return _usolveAll.createUsolveAll;
+  }
+});
+Object.defineProperty(exports, "createVacuumImpedance", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createVacuumImpedance;
+  }
+});
+Object.defineProperty(exports, "createVariance", {
+  enumerable: true,
+  get: function () {
+    return _variance.createVariance;
+  }
+});
+Object.defineProperty(exports, "createVarianceTransform", {
+  enumerable: true,
+  get: function () {
+    return _varianceTransform.createVarianceTransform;
+  }
+});
+Object.defineProperty(exports, "createVersion", {
+  enumerable: true,
+  get: function () {
+    return _constants.createVersion;
+  }
+});
+Object.defineProperty(exports, "createWeakMixingAngle", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createWeakMixingAngle;
+  }
+});
+Object.defineProperty(exports, "createWienDisplacement", {
+  enumerable: true,
+  get: function () {
+    return _physicalConstants.createWienDisplacement;
+  }
+});
+Object.defineProperty(exports, "createXgcd", {
+  enumerable: true,
+  get: function () {
+    return _xgcd.createXgcd;
+  }
+});
+Object.defineProperty(exports, "createXor", {
+  enumerable: true,
+  get: function () {
+    return _xor.createXor;
+  }
+});
+Object.defineProperty(exports, "createZeros", {
+  enumerable: true,
+  get: function () {
+    return _zeros.createZeros;
+  }
+});
+Object.defineProperty(exports, "createZeta", {
+  enumerable: true,
+  get: function () {
+    return _zeta.createZeta;
+  }
+});
+Object.defineProperty(exports, "createZpk2tf", {
+  enumerable: true,
+  get: function () {
+    return _zpk2tf.createZpk2tf;
+  }
+});
+var _typed = require("./core/function/typed.js");
+var _ResultSet = require("./type/resultset/ResultSet.js");
+var _BigNumber = require("./type/bignumber/BigNumber.js");
+var _Complex = require("./type/complex/Complex.js");
+var _Fraction = require("./type/fraction/Fraction.js");
+var _Range = require("./type/matrix/Range.js");
+var _Matrix = require("./type/matrix/Matrix.js");
+var _DenseMatrix = require("./type/matrix/DenseMatrix.js");
+var _clone = require("./function/utils/clone.js");
+var _isInteger = require("./function/utils/isInteger.js");
+var _isNegative = require("./function/utils/isNegative.js");
+var _isNumeric = require("./function/utils/isNumeric.js");
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+var _isPositive = require("./function/utils/isPositive.js");
+var _isZero = require("./function/utils/isZero.js");
+var _isNaN = require("./function/utils/isNaN.js");
+var _typeOf = require("./function/utils/typeOf.js");
+var _equalScalar = require("./function/relational/equalScalar.js");
+var _SparseMatrix = require("./type/matrix/SparseMatrix.js");
+var _number = require("./type/number.js");
+var _bigint = require("./type/bigint.js");
+var _string = require("./type/string.js");
+var _boolean = require("./type/boolean.js");
+var _bignumber = require("./type/bignumber/function/bignumber.js");
+var _complex = require("./type/complex/function/complex.js");
+var _fraction = require("./type/fraction/function/fraction.js");
+var _matrix = require("./type/matrix/function/matrix.js");
+var _matrixFromFunction = require("./function/matrix/matrixFromFunction.js");
+var _matrixFromRows = require("./function/matrix/matrixFromRows.js");
+var _matrixFromColumns = require("./function/matrix/matrixFromColumns.js");
+var _splitUnit = require("./type/unit/function/splitUnit.js");
+var _unaryMinus = require("./function/arithmetic/unaryMinus.js");
+var _unaryPlus = require("./function/arithmetic/unaryPlus.js");
+var _abs = require("./function/arithmetic/abs.js");
+var _mapSlices = require("./function/matrix/mapSlices.js");
+var _addScalar = require("./function/arithmetic/addScalar.js");
+var _subtractScalar = require("./function/arithmetic/subtractScalar.js");
+var _cbrt = require("./function/arithmetic/cbrt.js");
+var _ceil = require("./function/arithmetic/ceil.js");
+var _cube = require("./function/arithmetic/cube.js");
+var _exp = require("./function/arithmetic/exp.js");
+var _expm = require("./function/arithmetic/expm1.js");
+var _fix = require("./function/arithmetic/fix.js");
+var _floor = require("./function/arithmetic/floor.js");
+var _gcd = require("./function/arithmetic/gcd.js");
+var _lcm = require("./function/arithmetic/lcm.js");
+var _log = require("./function/arithmetic/log10.js");
+var _log2 = require("./function/arithmetic/log2.js");
+var _mod = require("./function/arithmetic/mod.js");
+var _multiplyScalar = require("./function/arithmetic/multiplyScalar.js");
+var _multiply = require("./function/arithmetic/multiply.js");
+var _nthRoot = require("./function/arithmetic/nthRoot.js");
+var _sign = require("./function/arithmetic/sign.js");
+var _sqrt = require("./function/arithmetic/sqrt.js");
+var _square = require("./function/arithmetic/square.js");
+var _subtract = require("./function/arithmetic/subtract.js");
+var _xgcd = require("./function/arithmetic/xgcd.js");
+var _invmod = require("./function/arithmetic/invmod.js");
+var _dotMultiply = require("./function/arithmetic/dotMultiply.js");
+var _bitAnd = require("./function/bitwise/bitAnd.js");
+var _bitNot = require("./function/bitwise/bitNot.js");
+var _bitOr = require("./function/bitwise/bitOr.js");
+var _bitXor = require("./function/bitwise/bitXor.js");
+var _arg = require("./function/complex/arg.js");
+var _conj = require("./function/complex/conj.js");
+var _im = require("./function/complex/im.js");
+var _re = require("./function/complex/re.js");
+var _not = require("./function/logical/not.js");
+var _nullish = require("./function/logical/nullish.js");
+var _or = require("./function/logical/or.js");
+var _xor = require("./function/logical/xor.js");
+var _concat = require("./function/matrix/concat.js");
+var _column = require("./function/matrix/column.js");
+var _count = require("./function/matrix/count.js");
+var _cross = require("./function/matrix/cross.js");
+var _diag = require("./function/matrix/diag.js");
+var _filter = require("./function/matrix/filter.js");
+var _flatten = require("./function/matrix/flatten.js");
+var _forEach = require("./function/matrix/forEach.js");
+var _getMatrixDataType = require("./function/matrix/getMatrixDataType.js");
+var _identity = require("./function/matrix/identity.js");
+var _kron = require("./function/matrix/kron.js");
+var _map = require("./function/matrix/map.js");
+var _diff = require("./function/matrix/diff.js");
+var _ones = require("./function/matrix/ones.js");
+var _range = require("./function/matrix/range.js");
+var _reshape = require("./function/matrix/reshape.js");
+var _resize = require("./function/matrix/resize.js");
+var _rotate = require("./function/matrix/rotate.js");
+var _rotationMatrix = require("./function/matrix/rotationMatrix.js");
+var _row = require("./function/matrix/row.js");
+var _size = require("./function/matrix/size.js");
+var _squeeze = require("./function/matrix/squeeze.js");
+var _subset = require("./function/matrix/subset.js");
+var _transpose = require("./function/matrix/transpose.js");
+var _ctranspose = require("./function/matrix/ctranspose.js");
+var _zeros = require("./function/matrix/zeros.js");
+var _fft = require("./function/matrix/fft.js");
+var _ifft = require("./function/matrix/ifft.js");
+var _solveODE = require("./function/numeric/solveODE.js");
+var _erf = require("./function/special/erf.js");
+var _zeta = require("./function/special/zeta.js");
+var _mode = require("./function/statistics/mode.js");
+var _prod = require("./function/statistics/prod.js");
+var _format = require("./function/string/format.js");
+var _bin = require("./function/string/bin.js");
+var _oct = require("./function/string/oct.js");
+var _hex = require("./function/string/hex.js");
+var _print = require("./function/string/print.js");
+var _to = require("./function/unit/to.js");
+var _toBest = require("./function/unit/toBest.js");
+var _isPrime = require("./function/utils/isPrime.js");
+var _numeric = require("./function/utils/numeric.js");
+var _divideScalar = require("./function/arithmetic/divideScalar.js");
+var _pow = require("./function/arithmetic/pow.js");
+var _round = require("./function/arithmetic/round.js");
+var _log3 = require("./function/arithmetic/log.js");
+var _log1p = require("./function/arithmetic/log1p.js");
+var _nthRoots = require("./function/arithmetic/nthRoots.js");
+var _dotPow = require("./function/arithmetic/dotPow.js");
+var _dotDivide = require("./function/arithmetic/dotDivide.js");
+var _lsolve = require("./function/algebra/solver/lsolve.js");
+var _usolve = require("./function/algebra/solver/usolve.js");
+var _lsolveAll = require("./function/algebra/solver/lsolveAll.js");
+var _usolveAll = require("./function/algebra/solver/usolveAll.js");
+var _leftShift = require("./function/bitwise/leftShift.js");
+var _rightArithShift = require("./function/bitwise/rightArithShift.js");
+var _rightLogShift = require("./function/bitwise/rightLogShift.js");
+var _and = require("./function/logical/and.js");
+var _compare = require("./function/relational/compare.js");
+var _compareNatural = require("./function/relational/compareNatural.js");
+var _compareText = require("./function/relational/compareText.js");
+var _equal = require("./function/relational/equal.js");
+var _equalText = require("./function/relational/equalText.js");
+var _smaller = require("./function/relational/smaller.js");
+var _smallerEq = require("./function/relational/smallerEq.js");
+var _larger = require("./function/relational/larger.js");
+var _largerEq = require("./function/relational/largerEq.js");
+var _deepEqual = require("./function/relational/deepEqual.js");
+var _unequal = require("./function/relational/unequal.js");
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+var _sort = require("./function/matrix/sort.js");
+var _max = require("./function/statistics/max.js");
+var _min = require("./function/statistics/min.js");
+var _ImmutableDenseMatrix = require("./type/matrix/ImmutableDenseMatrix.js");
+var _MatrixIndex = require("./type/matrix/MatrixIndex.js");
+var _FibonacciHeap = require("./type/matrix/FibonacciHeap.js");
+var _Spa = require("./type/matrix/Spa.js");
+var _Unit = require("./type/unit/Unit.js");
+var _unit = require("./type/unit/function/unit.js");
+var _sparse = require("./type/matrix/function/sparse.js");
+var _createUnit = require("./type/unit/function/createUnit.js");
+var _acos = require("./function/trigonometry/acos.js");
+var _acosh = require("./function/trigonometry/acosh.js");
+var _acot = require("./function/trigonometry/acot.js");
+var _acoth = require("./function/trigonometry/acoth.js");
+var _acsc = require("./function/trigonometry/acsc.js");
+var _acsch = require("./function/trigonometry/acsch.js");
+var _asec = require("./function/trigonometry/asec.js");
+var _asech = require("./function/trigonometry/asech.js");
+var _asin = require("./function/trigonometry/asin.js");
+var _asinh = require("./function/trigonometry/asinh.js");
+var _atan = require("./function/trigonometry/atan.js");
+var _atan2 = require("./function/trigonometry/atan2.js");
+var _atanh = require("./function/trigonometry/atanh.js");
+var _cos = require("./function/trigonometry/cos.js");
+var _cosh = require("./function/trigonometry/cosh.js");
+var _cot = require("./function/trigonometry/cot.js");
+var _coth = require("./function/trigonometry/coth.js");
+var _csc = require("./function/trigonometry/csc.js");
+var _csch = require("./function/trigonometry/csch.js");
+var _sec = require("./function/trigonometry/sec.js");
+var _sech = require("./function/trigonometry/sech.js");
+var _sin = require("./function/trigonometry/sin.js");
+var _sinh = require("./function/trigonometry/sinh.js");
+var _tan = require("./function/trigonometry/tan.js");
+var _tanh = require("./function/trigonometry/tanh.js");
+var _setCartesian = require("./function/set/setCartesian.js");
+var _setDifference = require("./function/set/setDifference.js");
+var _setDistinct = require("./function/set/setDistinct.js");
+var _setIntersect = require("./function/set/setIntersect.js");
+var _setIsSubset = require("./function/set/setIsSubset.js");
+var _setMultiplicity = require("./function/set/setMultiplicity.js");
+var _setPowerset = require("./function/set/setPowerset.js");
+var _setSize = require("./function/set/setSize.js");
+var _setSymDifference = require("./function/set/setSymDifference.js");
+var _setUnion = require("./function/set/setUnion.js");
+var _add = require("./function/arithmetic/add.js");
+var _hypot = require("./function/arithmetic/hypot.js");
+var _norm = require("./function/arithmetic/norm.js");
+var _dot = require("./function/matrix/dot.js");
+var _trace = require("./function/matrix/trace.js");
+var _index = require("./type/matrix/function/index.js");
+var _Node = require("./expression/node/Node.js");
+var _AccessorNode = require("./expression/node/AccessorNode.js");
+var _ArrayNode = require("./expression/node/ArrayNode.js");
+var _AssignmentNode = require("./expression/node/AssignmentNode.js");
+var _BlockNode = require("./expression/node/BlockNode.js");
+var _ConditionalNode = require("./expression/node/ConditionalNode.js");
+var _ConstantNode = require("./expression/node/ConstantNode.js");
+var _FunctionAssignmentNode = require("./expression/node/FunctionAssignmentNode.js");
+var _IndexNode = require("./expression/node/IndexNode.js");
+var _ObjectNode = require("./expression/node/ObjectNode.js");
+var _OperatorNode = require("./expression/node/OperatorNode.js");
+var _ParenthesisNode = require("./expression/node/ParenthesisNode.js");
+var _RangeNode = require("./expression/node/RangeNode.js");
+var _RelationalNode = require("./expression/node/RelationalNode.js");
+var _SymbolNode = require("./expression/node/SymbolNode.js");
+var _FunctionNode = require("./expression/node/FunctionNode.js");
+var _parse = require("./expression/parse.js");
+var _compile = require("./expression/function/compile.js");
+var _evaluate = require("./expression/function/evaluate.js");
+var _Parser = require("./expression/Parser.js");
+var _parser = require("./expression/function/parser.js");
+var _lup = require("./function/algebra/decomposition/lup.js");
+var _qr = require("./function/algebra/decomposition/qr.js");
+var _slu = require("./function/algebra/decomposition/slu.js");
+var _lusolve = require("./function/algebra/solver/lusolve.js");
+var _polynomialRoot = require("./function/algebra/polynomialRoot.js");
+var _Help = require("./expression/Help.js");
+var _Chain = require("./type/chain/Chain.js");
+var _help = require("./expression/function/help.js");
+var _chain = require("./type/chain/function/chain.js");
+var _det = require("./function/matrix/det.js");
+var _inv = require("./function/matrix/inv.js");
+var _pinv = require("./function/matrix/pinv.js");
+var _eigs = require("./function/matrix/eigs.js");
+var _expm2 = require("./function/matrix/expm.js");
+var _sqrtm = require("./function/matrix/sqrtm.js");
+var _sylvester = require("./function/algebra/sylvester.js");
+var _schur = require("./function/algebra/decomposition/schur.js");
+var _lyap = require("./function/algebra/lyap.js");
+var _divide = require("./function/arithmetic/divide.js");
+var _distance = require("./function/geometry/distance.js");
+var _intersect = require("./function/geometry/intersect.js");
+var _sum = require("./function/statistics/sum.js");
+var _cumsum = require("./function/statistics/cumsum.js");
+var _mean = require("./function/statistics/mean.js");
+var _median = require("./function/statistics/median.js");
+var _mad = require("./function/statistics/mad.js");
+var _variance = require("./function/statistics/variance.js");
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+var _std = require("./function/statistics/std.js");
+var _corr = require("./function/statistics/corr.js");
+var _combinations = require("./function/probability/combinations.js");
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+var _gamma = require("./function/probability/gamma.js");
+var _lgamma = require("./function/probability/lgamma.js");
+var _factorial = require("./function/probability/factorial.js");
+var _kldivergence = require("./function/probability/kldivergence.js");
+var _multinomial = require("./function/probability/multinomial.js");
+var _permutations = require("./function/probability/permutations.js");
+var _pickRandom = require("./function/probability/pickRandom.js");
+var _random = require("./function/probability/random.js");
+var _randomInt = require("./function/probability/randomInt.js");
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+var _catalan = require("./function/combinatorics/catalan.js");
+var _composition = require("./function/combinatorics/composition.js");
+var _leafCount = require("./function/algebra/leafCount.js");
+var _simplify = require("./function/algebra/simplify.js");
+var _simplifyConstant = require("./function/algebra/simplifyConstant.js");
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+var _resolve = require("./function/algebra/resolve.js");
+var _symbolicEqual = require("./function/algebra/symbolicEqual.js");
+var _derivative = require("./function/algebra/derivative.js");
+var _rationalize = require("./function/algebra/rationalize.js");
+var _zpk2tf = require("./function/signal/zpk2tf.js");
+var _freqz = require("./function/signal/freqz.js");
+var _reviver = require("./json/reviver.js");
+var _replacer = require("./json/replacer.js");
+var _constants = require("./constants.js");
+var _physicalConstants = require("./type/unit/physicalConstants.js");
+var _mapSlicesTransform = require("./expression/transform/mapSlices.transform.js");
+var _columnTransform = require("./expression/transform/column.transform.js");
+var _filterTransform = require("./expression/transform/filter.transform.js");
+var _forEachTransform = require("./expression/transform/forEach.transform.js");
+var _indexTransform = require("./expression/transform/index.transform.js");
+var _mapTransform = require("./expression/transform/map.transform.js");
+var _maxTransform = require("./expression/transform/max.transform.js");
+var _meanTransform = require("./expression/transform/mean.transform.js");
+var _minTransform = require("./expression/transform/min.transform.js");
+var _rangeTransform = require("./expression/transform/range.transform.js");
+var _rowTransform = require("./expression/transform/row.transform.js");
+var _subsetTransform = require("./expression/transform/subset.transform.js");
+var _concatTransform = require("./expression/transform/concat.transform.js");
+var _diffTransform = require("./expression/transform/diff.transform.js");
+var _stdTransform = require("./expression/transform/std.transform.js");
+var _sumTransform = require("./expression/transform/sum.transform.js");
+var _quantileSeqTransform = require("./expression/transform/quantileSeq.transform.js");
+var _cumsumTransform = require("./expression/transform/cumsum.transform.js");
+var _varianceTransform = require("./expression/transform/variance.transform.js");
+var _printTransform = require("./expression/transform/print.transform.js");
+var _andTransform = require("./expression/transform/and.transform.js");
+var _orTransform = require("./expression/transform/or.transform.js");
+var _nullishTransform = require("./expression/transform/nullish.transform.js");
+var _bitAndTransform = require("./expression/transform/bitAnd.transform.js");
+var _bitOrTransform = require("./expression/transform/bitOr.transform.js");
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/factoriesNumber.js b/node_modules/mathjs/lib/cjs/factoriesNumber.js
new file mode 100644
index 0000000..7bd0997
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/factoriesNumber.js
@@ -0,0 +1,1063 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAbs = void 0;
+Object.defineProperty(exports, "createAccessorNode", {
+  enumerable: true,
+  get: function () {
+    return _AccessorNode.createAccessorNode;
+  }
+});
+exports.createAnd = exports.createAddScalar = exports.createAdd = exports.createAcsch = exports.createAcsc = exports.createAcoth = exports.createAcot = exports.createAcosh = exports.createAcos = void 0;
+Object.defineProperty(exports, "createArrayNode", {
+  enumerable: true,
+  get: function () {
+    return _ArrayNode.createArrayNode;
+  }
+});
+exports.createAsinh = exports.createAsin = exports.createAsech = exports.createAsec = void 0;
+Object.defineProperty(exports, "createAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _AssignmentNode.createAssignmentNode;
+  }
+});
+exports.createAtanh = exports.createAtan2 = exports.createAtan = void 0;
+Object.defineProperty(exports, "createBellNumbers", {
+  enumerable: true,
+  get: function () {
+    return _bellNumbers.createBellNumbers;
+  }
+});
+Object.defineProperty(exports, "createBigint", {
+  enumerable: true,
+  get: function () {
+    return _bigint.createBigint;
+  }
+});
+exports.createBitXor = exports.createBitOr = exports.createBitNot = exports.createBitAnd = void 0;
+Object.defineProperty(exports, "createBlockNode", {
+  enumerable: true,
+  get: function () {
+    return _BlockNode.createBlockNode;
+  }
+});
+Object.defineProperty(exports, "createBoolean", {
+  enumerable: true,
+  get: function () {
+    return _boolean.createBoolean;
+  }
+});
+Object.defineProperty(exports, "createCatalan", {
+  enumerable: true,
+  get: function () {
+    return _catalan.createCatalan;
+  }
+});
+exports.createCbrt = void 0;
+Object.defineProperty(exports, "createCeil", {
+  enumerable: true,
+  get: function () {
+    return _ceil.createCeilNumber;
+  }
+});
+Object.defineProperty(exports, "createChain", {
+  enumerable: true,
+  get: function () {
+    return _chain.createChain;
+  }
+});
+Object.defineProperty(exports, "createChainClass", {
+  enumerable: true,
+  get: function () {
+    return _Chain.createChainClass;
+  }
+});
+Object.defineProperty(exports, "createClone", {
+  enumerable: true,
+  get: function () {
+    return _clone.createClone;
+  }
+});
+exports.createCombinations = void 0;
+Object.defineProperty(exports, "createCombinationsWithRep", {
+  enumerable: true,
+  get: function () {
+    return _combinationsWithRep.createCombinationsWithRep;
+  }
+});
+Object.defineProperty(exports, "createCompare", {
+  enumerable: true,
+  get: function () {
+    return _compare.createCompareNumber;
+  }
+});
+Object.defineProperty(exports, "createCompareNatural", {
+  enumerable: true,
+  get: function () {
+    return _compareNatural.createCompareNatural;
+  }
+});
+Object.defineProperty(exports, "createCompareText", {
+  enumerable: true,
+  get: function () {
+    return _compareText.createCompareTextNumber;
+  }
+});
+Object.defineProperty(exports, "createCompile", {
+  enumerable: true,
+  get: function () {
+    return _compile.createCompile;
+  }
+});
+Object.defineProperty(exports, "createComposition", {
+  enumerable: true,
+  get: function () {
+    return _composition.createComposition;
+  }
+});
+Object.defineProperty(exports, "createConditionalNode", {
+  enumerable: true,
+  get: function () {
+    return _ConditionalNode.createConditionalNode;
+  }
+});
+Object.defineProperty(exports, "createConstantNode", {
+  enumerable: true,
+  get: function () {
+    return _ConstantNode.createConstantNode;
+  }
+});
+Object.defineProperty(exports, "createCorr", {
+  enumerable: true,
+  get: function () {
+    return _corr.createCorr;
+  }
+});
+exports.createCube = exports.createCsch = exports.createCsc = exports.createCoth = exports.createCot = exports.createCosh = exports.createCos = void 0;
+Object.defineProperty(exports, "createCumSum", {
+  enumerable: true,
+  get: function () {
+    return _cumsum.createCumSum;
+  }
+});
+Object.defineProperty(exports, "createCumSumTransform", {
+  enumerable: true,
+  get: function () {
+    return _cumsumTransform.createCumSumTransform;
+  }
+});
+Object.defineProperty(exports, "createDeepEqual", {
+  enumerable: true,
+  get: function () {
+    return _deepEqual.createDeepEqual;
+  }
+});
+Object.defineProperty(exports, "createDerivative", {
+  enumerable: true,
+  get: function () {
+    return _derivative.createDerivative;
+  }
+});
+exports.createDivideScalar = exports.createDivide = void 0;
+Object.defineProperty(exports, "createE", {
+  enumerable: true,
+  get: function () {
+    return _constants.createE;
+  }
+});
+Object.defineProperty(exports, "createEqual", {
+  enumerable: true,
+  get: function () {
+    return _equal.createEqualNumber;
+  }
+});
+Object.defineProperty(exports, "createEqualScalar", {
+  enumerable: true,
+  get: function () {
+    return _equalScalar.createEqualScalarNumber;
+  }
+});
+Object.defineProperty(exports, "createEqualText", {
+  enumerable: true,
+  get: function () {
+    return _equalText.createEqualText;
+  }
+});
+Object.defineProperty(exports, "createErf", {
+  enumerable: true,
+  get: function () {
+    return _erf.createErf;
+  }
+});
+Object.defineProperty(exports, "createEvaluate", {
+  enumerable: true,
+  get: function () {
+    return _evaluate.createEvaluate;
+  }
+});
+exports.createExpm1 = exports.createExp = void 0;
+Object.defineProperty(exports, "createFactorial", {
+  enumerable: true,
+  get: function () {
+    return _factorial.createFactorial;
+  }
+});
+Object.defineProperty(exports, "createFalse", {
+  enumerable: true,
+  get: function () {
+    return _constants.createFalse;
+  }
+});
+Object.defineProperty(exports, "createFilter", {
+  enumerable: true,
+  get: function () {
+    return _filter.createFilter;
+  }
+});
+Object.defineProperty(exports, "createFilterTransform", {
+  enumerable: true,
+  get: function () {
+    return _filterTransform.createFilterTransform;
+  }
+});
+Object.defineProperty(exports, "createFix", {
+  enumerable: true,
+  get: function () {
+    return _fix.createFixNumber;
+  }
+});
+Object.defineProperty(exports, "createFloor", {
+  enumerable: true,
+  get: function () {
+    return _floor.createFloorNumber;
+  }
+});
+Object.defineProperty(exports, "createForEach", {
+  enumerable: true,
+  get: function () {
+    return _forEach.createForEach;
+  }
+});
+Object.defineProperty(exports, "createForEachTransform", {
+  enumerable: true,
+  get: function () {
+    return _forEachTransform.createForEachTransform;
+  }
+});
+Object.defineProperty(exports, "createFormat", {
+  enumerable: true,
+  get: function () {
+    return _format.createFormat;
+  }
+});
+Object.defineProperty(exports, "createFunctionAssignmentNode", {
+  enumerable: true,
+  get: function () {
+    return _FunctionAssignmentNode.createFunctionAssignmentNode;
+  }
+});
+Object.defineProperty(exports, "createFunctionNode", {
+  enumerable: true,
+  get: function () {
+    return _FunctionNode.createFunctionNode;
+  }
+});
+exports.createGcd = exports.createGamma = void 0;
+Object.defineProperty(exports, "createHasNumericValue", {
+  enumerable: true,
+  get: function () {
+    return _hasNumericValue.createHasNumericValue;
+  }
+});
+Object.defineProperty(exports, "createHelp", {
+  enumerable: true,
+  get: function () {
+    return _help.createHelp;
+  }
+});
+Object.defineProperty(exports, "createHelpClass", {
+  enumerable: true,
+  get: function () {
+    return _Help.createHelpClass;
+  }
+});
+Object.defineProperty(exports, "createHypot", {
+  enumerable: true,
+  get: function () {
+    return _hypot.createHypot;
+  }
+});
+exports.createIndex = void 0;
+Object.defineProperty(exports, "createIndexNode", {
+  enumerable: true,
+  get: function () {
+    return _IndexNode.createIndexNode;
+  }
+});
+Object.defineProperty(exports, "createInfinity", {
+  enumerable: true,
+  get: function () {
+    return _constants.createInfinity;
+  }
+});
+exports.createIsNegative = exports.createIsNaN = exports.createIsInteger = void 0;
+Object.defineProperty(exports, "createIsNumeric", {
+  enumerable: true,
+  get: function () {
+    return _isNumeric.createIsNumeric;
+  }
+});
+exports.createIsPositive = void 0;
+Object.defineProperty(exports, "createIsPrime", {
+  enumerable: true,
+  get: function () {
+    return _isPrime.createIsPrime;
+  }
+});
+exports.createIsZero = void 0;
+Object.defineProperty(exports, "createLN10", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLN10;
+  }
+});
+Object.defineProperty(exports, "createLN2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLN2;
+  }
+});
+Object.defineProperty(exports, "createLOG10E", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLOG10E;
+  }
+});
+Object.defineProperty(exports, "createLOG2E", {
+  enumerable: true,
+  get: function () {
+    return _constants.createLOG2E;
+  }
+});
+Object.defineProperty(exports, "createLarger", {
+  enumerable: true,
+  get: function () {
+    return _larger.createLargerNumber;
+  }
+});
+Object.defineProperty(exports, "createLargerEq", {
+  enumerable: true,
+  get: function () {
+    return _largerEq.createLargerEqNumber;
+  }
+});
+exports.createLeftShift = exports.createLcm = void 0;
+exports.createLog2 = exports.createLog1p = exports.createLog10 = exports.createLog = exports.createLgamma = void 0;
+Object.defineProperty(exports, "createMad", {
+  enumerable: true,
+  get: function () {
+    return _mad.createMad;
+  }
+});
+Object.defineProperty(exports, "createMap", {
+  enumerable: true,
+  get: function () {
+    return _map.createMap;
+  }
+});
+Object.defineProperty(exports, "createMapSlices", {
+  enumerable: true,
+  get: function () {
+    return _mapSlices.createMapSlices;
+  }
+});
+Object.defineProperty(exports, "createMapSlicesTransform", {
+  enumerable: true,
+  get: function () {
+    return _mapSlicesTransform.createMapSlicesTransform;
+  }
+});
+Object.defineProperty(exports, "createMapTransform", {
+  enumerable: true,
+  get: function () {
+    return _mapTransform.createMapTransform;
+  }
+});
+exports.createMatrix = void 0;
+Object.defineProperty(exports, "createMax", {
+  enumerable: true,
+  get: function () {
+    return _max.createMax;
+  }
+});
+Object.defineProperty(exports, "createMaxTransform", {
+  enumerable: true,
+  get: function () {
+    return _maxTransform.createMaxTransform;
+  }
+});
+Object.defineProperty(exports, "createMean", {
+  enumerable: true,
+  get: function () {
+    return _mean.createMean;
+  }
+});
+Object.defineProperty(exports, "createMeanTransform", {
+  enumerable: true,
+  get: function () {
+    return _meanTransform.createMeanTransform;
+  }
+});
+Object.defineProperty(exports, "createMedian", {
+  enumerable: true,
+  get: function () {
+    return _median.createMedian;
+  }
+});
+Object.defineProperty(exports, "createMin", {
+  enumerable: true,
+  get: function () {
+    return _min.createMin;
+  }
+});
+Object.defineProperty(exports, "createMinTransform", {
+  enumerable: true,
+  get: function () {
+    return _minTransform.createMinTransform;
+  }
+});
+exports.createMod = void 0;
+Object.defineProperty(exports, "createMode", {
+  enumerable: true,
+  get: function () {
+    return _mode.createMode;
+  }
+});
+Object.defineProperty(exports, "createMultinomial", {
+  enumerable: true,
+  get: function () {
+    return _multinomial.createMultinomial;
+  }
+});
+exports.createMultiplyScalar = exports.createMultiply = void 0;
+Object.defineProperty(exports, "createNaN", {
+  enumerable: true,
+  get: function () {
+    return _constants.createNaN;
+  }
+});
+Object.defineProperty(exports, "createNode", {
+  enumerable: true,
+  get: function () {
+    return _Node.createNode;
+  }
+});
+exports.createNthRoot = exports.createNot = exports.createNorm = void 0;
+Object.defineProperty(exports, "createNull", {
+  enumerable: true,
+  get: function () {
+    return _constants.createNull;
+  }
+});
+Object.defineProperty(exports, "createNumber", {
+  enumerable: true,
+  get: function () {
+    return _number.createNumber;
+  }
+});
+Object.defineProperty(exports, "createNumeric", {
+  enumerable: true,
+  get: function () {
+    return _numeric.createNumeric;
+  }
+});
+Object.defineProperty(exports, "createObjectNode", {
+  enumerable: true,
+  get: function () {
+    return _ObjectNode.createObjectNode;
+  }
+});
+Object.defineProperty(exports, "createOperatorNode", {
+  enumerable: true,
+  get: function () {
+    return _OperatorNode.createOperatorNode;
+  }
+});
+exports.createOr = void 0;
+Object.defineProperty(exports, "createParenthesisNode", {
+  enumerable: true,
+  get: function () {
+    return _ParenthesisNode.createParenthesisNode;
+  }
+});
+Object.defineProperty(exports, "createParse", {
+  enumerable: true,
+  get: function () {
+    return _parse.createParse;
+  }
+});
+Object.defineProperty(exports, "createParser", {
+  enumerable: true,
+  get: function () {
+    return _parser.createParser;
+  }
+});
+Object.defineProperty(exports, "createParserClass", {
+  enumerable: true,
+  get: function () {
+    return _Parser.createParserClass;
+  }
+});
+Object.defineProperty(exports, "createPartitionSelect", {
+  enumerable: true,
+  get: function () {
+    return _partitionSelect.createPartitionSelect;
+  }
+});
+Object.defineProperty(exports, "createPermutations", {
+  enumerable: true,
+  get: function () {
+    return _permutations.createPermutations;
+  }
+});
+Object.defineProperty(exports, "createPhi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createPhi;
+  }
+});
+Object.defineProperty(exports, "createPi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createPi;
+  }
+});
+Object.defineProperty(exports, "createPickRandom", {
+  enumerable: true,
+  get: function () {
+    return _pickRandom.createPickRandom;
+  }
+});
+exports.createPow = void 0;
+Object.defineProperty(exports, "createPrint", {
+  enumerable: true,
+  get: function () {
+    return _print.createPrint;
+  }
+});
+Object.defineProperty(exports, "createProd", {
+  enumerable: true,
+  get: function () {
+    return _prod.createProd;
+  }
+});
+Object.defineProperty(exports, "createQuantileSeq", {
+  enumerable: true,
+  get: function () {
+    return _quantileSeq.createQuantileSeq;
+  }
+});
+Object.defineProperty(exports, "createRandom", {
+  enumerable: true,
+  get: function () {
+    return _random.createRandomNumber;
+  }
+});
+Object.defineProperty(exports, "createRandomInt", {
+  enumerable: true,
+  get: function () {
+    return _randomInt.createRandomInt;
+  }
+});
+Object.defineProperty(exports, "createRange", {
+  enumerable: true,
+  get: function () {
+    return _range.createRange;
+  }
+});
+Object.defineProperty(exports, "createRangeClass", {
+  enumerable: true,
+  get: function () {
+    return _Range.createRangeClass;
+  }
+});
+Object.defineProperty(exports, "createRangeNode", {
+  enumerable: true,
+  get: function () {
+    return _RangeNode.createRangeNode;
+  }
+});
+Object.defineProperty(exports, "createRangeTransform", {
+  enumerable: true,
+  get: function () {
+    return _rangeTransform.createRangeTransform;
+  }
+});
+Object.defineProperty(exports, "createRationalize", {
+  enumerable: true,
+  get: function () {
+    return _rationalize.createRationalize;
+  }
+});
+Object.defineProperty(exports, "createRelationalNode", {
+  enumerable: true,
+  get: function () {
+    return _RelationalNode.createRelationalNode;
+  }
+});
+Object.defineProperty(exports, "createReplacer", {
+  enumerable: true,
+  get: function () {
+    return _replacer.createReplacer;
+  }
+});
+Object.defineProperty(exports, "createResolve", {
+  enumerable: true,
+  get: function () {
+    return _resolve.createResolve;
+  }
+});
+Object.defineProperty(exports, "createResultSet", {
+  enumerable: true,
+  get: function () {
+    return _ResultSet.createResultSet;
+  }
+});
+Object.defineProperty(exports, "createReviver", {
+  enumerable: true,
+  get: function () {
+    return _reviver.createReviver;
+  }
+});
+exports.createRound = exports.createRightLogShift = exports.createRightArithShift = void 0;
+Object.defineProperty(exports, "createSQRT1_2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createSQRT1_2;
+  }
+});
+Object.defineProperty(exports, "createSQRT2", {
+  enumerable: true,
+  get: function () {
+    return _constants.createSQRT2;
+  }
+});
+exports.createSign = exports.createSech = exports.createSec = void 0;
+Object.defineProperty(exports, "createSimplify", {
+  enumerable: true,
+  get: function () {
+    return _simplify.createSimplify;
+  }
+});
+Object.defineProperty(exports, "createSimplifyConstant", {
+  enumerable: true,
+  get: function () {
+    return _simplifyConstant.createSimplifyConstant;
+  }
+});
+Object.defineProperty(exports, "createSimplifyCore", {
+  enumerable: true,
+  get: function () {
+    return _simplifyCore.createSimplifyCore;
+  }
+});
+exports.createSinh = exports.createSin = void 0;
+Object.defineProperty(exports, "createSize", {
+  enumerable: true,
+  get: function () {
+    return _size.createSize;
+  }
+});
+Object.defineProperty(exports, "createSmaller", {
+  enumerable: true,
+  get: function () {
+    return _smaller.createSmallerNumber;
+  }
+});
+Object.defineProperty(exports, "createSmallerEq", {
+  enumerable: true,
+  get: function () {
+    return _smallerEq.createSmallerEqNumber;
+  }
+});
+exports.createSquare = exports.createSqrt = void 0;
+Object.defineProperty(exports, "createStd", {
+  enumerable: true,
+  get: function () {
+    return _std.createStd;
+  }
+});
+Object.defineProperty(exports, "createStdTransform", {
+  enumerable: true,
+  get: function () {
+    return _stdTransform.createStdTransform;
+  }
+});
+Object.defineProperty(exports, "createStirlingS2", {
+  enumerable: true,
+  get: function () {
+    return _stirlingS.createStirlingS2;
+  }
+});
+Object.defineProperty(exports, "createString", {
+  enumerable: true,
+  get: function () {
+    return _string.createString;
+  }
+});
+exports.createSubtractScalar = exports.createSubtract = exports.createSubsetTransform = exports.createSubset = void 0;
+Object.defineProperty(exports, "createSum", {
+  enumerable: true,
+  get: function () {
+    return _sum.createSum;
+  }
+});
+Object.defineProperty(exports, "createSumTransform", {
+  enumerable: true,
+  get: function () {
+    return _sumTransform.createSumTransform;
+  }
+});
+Object.defineProperty(exports, "createSymbolNode", {
+  enumerable: true,
+  get: function () {
+    return _SymbolNode.createSymbolNode;
+  }
+});
+exports.createTanh = exports.createTan = void 0;
+Object.defineProperty(exports, "createTau", {
+  enumerable: true,
+  get: function () {
+    return _constants.createTau;
+  }
+});
+Object.defineProperty(exports, "createTrue", {
+  enumerable: true,
+  get: function () {
+    return _constants.createTrue;
+  }
+});
+Object.defineProperty(exports, "createTypeOf", {
+  enumerable: true,
+  get: function () {
+    return _typeOf.createTypeOf;
+  }
+});
+Object.defineProperty(exports, "createTyped", {
+  enumerable: true,
+  get: function () {
+    return _typed.createTyped;
+  }
+});
+exports.createUnaryPlus = exports.createUnaryMinus = void 0;
+Object.defineProperty(exports, "createUnequal", {
+  enumerable: true,
+  get: function () {
+    return _unequal.createUnequalNumber;
+  }
+});
+Object.defineProperty(exports, "createUppercaseE", {
+  enumerable: true,
+  get: function () {
+    return _constants.createUppercaseE;
+  }
+});
+Object.defineProperty(exports, "createUppercasePi", {
+  enumerable: true,
+  get: function () {
+    return _constants.createUppercasePi;
+  }
+});
+Object.defineProperty(exports, "createVariance", {
+  enumerable: true,
+  get: function () {
+    return _variance.createVariance;
+  }
+});
+Object.defineProperty(exports, "createVarianceTransform", {
+  enumerable: true,
+  get: function () {
+    return _varianceTransform.createVarianceTransform;
+  }
+});
+Object.defineProperty(exports, "createVersion", {
+  enumerable: true,
+  get: function () {
+    return _constants.createVersion;
+  }
+});
+exports.createXor = exports.createXgcd = void 0;
+Object.defineProperty(exports, "createZeta", {
+  enumerable: true,
+  get: function () {
+    return _zeta.createZeta;
+  }
+});
+var _index = require("./plain/number/index.js");
+var _factory = require("./utils/factory.js");
+var _noop = require("./utils/noop.js");
+var _typed = require("./core/function/typed.js");
+var _ResultSet = require("./type/resultset/ResultSet.js");
+var _Range = require("./type/matrix/Range.js");
+var _Help = require("./expression/Help.js");
+var _Chain = require("./type/chain/Chain.js");
+var _help = require("./expression/function/help.js");
+var _chain = require("./type/chain/function/chain.js");
+var _resolve = require("./function/algebra/resolve.js");
+var _simplify = require("./function/algebra/simplify.js");
+var _simplifyConstant = require("./function/algebra/simplifyConstant.js");
+var _simplifyCore = require("./function/algebra/simplifyCore.js");
+var _derivative = require("./function/algebra/derivative.js");
+var _rationalize = require("./function/algebra/rationalize.js");
+var _ceil = require("./function/arithmetic/ceil.js");
+var _fix = require("./function/arithmetic/fix.js");
+var _floor = require("./function/arithmetic/floor.js");
+var _hypot = require("./function/arithmetic/hypot.js");
+var _stirlingS = require("./function/combinatorics/stirlingS2.js");
+var _bellNumbers = require("./function/combinatorics/bellNumbers.js");
+var _catalan = require("./function/combinatorics/catalan.js");
+var _composition = require("./function/combinatorics/composition.js");
+var _constants = require("./constants.js");
+var _number = require("./type/number.js");
+var _bigint = require("./type/bigint.js");
+var _string = require("./type/string.js");
+var _boolean = require("./type/boolean.js");
+var _parser = require("./expression/function/parser.js");
+var _Node = require("./expression/node/Node.js");
+var _AccessorNode = require("./expression/node/AccessorNode.js");
+var _ArrayNode = require("./expression/node/ArrayNode.js");
+var _AssignmentNode = require("./expression/node/AssignmentNode.js");
+var _BlockNode = require("./expression/node/BlockNode.js");
+var _ConditionalNode = require("./expression/node/ConditionalNode.js");
+var _ConstantNode = require("./expression/node/ConstantNode.js");
+var _FunctionAssignmentNode = require("./expression/node/FunctionAssignmentNode.js");
+var _IndexNode = require("./expression/node/IndexNode.js");
+var _ObjectNode = require("./expression/node/ObjectNode.js");
+var _OperatorNode = require("./expression/node/OperatorNode.js");
+var _ParenthesisNode = require("./expression/node/ParenthesisNode.js");
+var _RangeNode = require("./expression/node/RangeNode.js");
+var _RelationalNode = require("./expression/node/RelationalNode.js");
+var _SymbolNode = require("./expression/node/SymbolNode.js");
+var _FunctionNode = require("./expression/node/FunctionNode.js");
+var _parse = require("./expression/parse.js");
+var _compile = require("./expression/function/compile.js");
+var _evaluate = require("./expression/function/evaluate.js");
+var _Parser = require("./expression/Parser.js");
+var _mapSlices = require("./function/matrix/mapSlices.js");
+var _filter = require("./function/matrix/filter.js");
+var _forEach = require("./function/matrix/forEach.js");
+var _map = require("./function/matrix/map.js");
+var _range = require("./function/matrix/range.js");
+var _size = require("./function/matrix/size.js");
+var _partitionSelect = require("./function/matrix/partitionSelect.js");
+var _combinationsWithRep = require("./function/probability/combinationsWithRep.js");
+var _factorial = require("./function/probability/factorial.js");
+var _multinomial = require("./function/probability/multinomial.js");
+var _permutations = require("./function/probability/permutations.js");
+var _pickRandom = require("./function/probability/pickRandom.js");
+var _random = require("./function/probability/random.js");
+var _randomInt = require("./function/probability/randomInt.js");
+var _equalScalar = require("./function/relational/equalScalar.js");
+var _compare = require("./function/relational/compare.js");
+var _compareNatural = require("./function/relational/compareNatural.js");
+var _compareText = require("./function/relational/compareText.js");
+var _equal = require("./function/relational/equal.js");
+var _equalText = require("./function/relational/equalText.js");
+var _smaller = require("./function/relational/smaller.js");
+var _smallerEq = require("./function/relational/smallerEq.js");
+var _larger = require("./function/relational/larger.js");
+var _largerEq = require("./function/relational/largerEq.js");
+var _deepEqual = require("./function/relational/deepEqual.js");
+var _unequal = require("./function/relational/unequal.js");
+var _erf = require("./function/special/erf.js");
+var _zeta = require("./function/special/zeta.js");
+var _mode = require("./function/statistics/mode.js");
+var _prod = require("./function/statistics/prod.js");
+var _max = require("./function/statistics/max.js");
+var _min = require("./function/statistics/min.js");
+var _sum = require("./function/statistics/sum.js");
+var _cumsum = require("./function/statistics/cumsum.js");
+var _mean = require("./function/statistics/mean.js");
+var _median = require("./function/statistics/median.js");
+var _mad = require("./function/statistics/mad.js");
+var _variance = require("./function/statistics/variance.js");
+var _quantileSeq = require("./function/statistics/quantileSeq.js");
+var _std = require("./function/statistics/std.js");
+var _corr = require("./function/statistics/corr.js");
+var _format = require("./function/string/format.js");
+var _print = require("./function/string/print.js");
+var _mapSlicesTransform = require("./expression/transform/mapSlices.transform.js");
+var _filterTransform = require("./expression/transform/filter.transform.js");
+var _forEachTransform = require("./expression/transform/forEach.transform.js");
+var _mapTransform = require("./expression/transform/map.transform.js");
+var _maxTransform = require("./expression/transform/max.transform.js");
+var _meanTransform = require("./expression/transform/mean.transform.js");
+var _minTransform = require("./expression/transform/min.transform.js");
+var _rangeTransform = require("./expression/transform/range.transform.js");
+var _stdTransform = require("./expression/transform/std.transform.js");
+var _sumTransform = require("./expression/transform/sum.transform.js");
+var _cumsumTransform = require("./expression/transform/cumsum.transform.js");
+var _varianceTransform = require("./expression/transform/variance.transform.js");
+var _clone = require("./function/utils/clone.js");
+var _isNumeric = require("./function/utils/isNumeric.js");
+var _hasNumericValue = require("./function/utils/hasNumericValue.js");
+var _typeOf = require("./function/utils/typeOf.js");
+var _isPrime = require("./function/utils/isPrime.js");
+var _numeric = require("./function/utils/numeric.js");
+var _reviver = require("./json/reviver.js");
+var _replacer = require("./json/replacer.js");
+// ----------------------------------------------------------------------------
+// classes and functions
+
+// core
+
+// classes
+
+// algebra
+
+// arithmetic
+const createUnaryMinus = exports.createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', _index.unaryMinusNumber);
+const createUnaryPlus = exports.createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', _index.unaryPlusNumber);
+const createAbs = exports.createAbs = /* #__PURE__ */createNumberFactory('abs', _index.absNumber);
+const createAddScalar = exports.createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', _index.addNumber);
+const createSubtractScalar = exports.createSubtractScalar = /* #__PURE__ */createNumberFactory('subtractScalar', _index.subtractNumber);
+const createCbrt = exports.createCbrt = /* #__PURE__ */createNumberFactory('cbrt', _index.cbrtNumber);
+const createCube = exports.createCube = /* #__PURE__ */createNumberFactory('cube', _index.cubeNumber);
+const createExp = exports.createExp = /* #__PURE__ */createNumberFactory('exp', _index.expNumber);
+const createExpm1 = exports.createExpm1 = /* #__PURE__ */createNumberFactory('expm1', _index.expm1Number);
+const createGcd = exports.createGcd = /* #__PURE__ */createNumberFactory('gcd', _index.gcdNumber);
+const createLcm = exports.createLcm = /* #__PURE__ */createNumberFactory('lcm', _index.lcmNumber);
+const createLog10 = exports.createLog10 = /* #__PURE__ */createNumberFactory('log10', _index.log10Number);
+const createLog2 = exports.createLog2 = /* #__PURE__ */createNumberFactory('log2', _index.log2Number);
+const createMod = exports.createMod = /* #__PURE__ */createNumberFactory('mod', _index.modNumber);
+const createMultiplyScalar = exports.createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', _index.multiplyNumber);
+const createMultiply = exports.createMultiply = /* #__PURE__ */createNumberFactory('multiply', _index.multiplyNumber);
+const createNthRoot = exports.createNthRoot = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('nthRoot', _index.nthRootNumber);
+const createSign = exports.createSign = /* #__PURE__ */createNumberFactory('sign', _index.signNumber);
+const createSqrt = exports.createSqrt = /* #__PURE__ */createNumberFactory('sqrt', _index.sqrtNumber);
+const createSquare = exports.createSquare = /* #__PURE__ */createNumberFactory('square', _index.squareNumber);
+const createSubtract = exports.createSubtract = /* #__PURE__ */createNumberFactory('subtract', _index.subtractNumber);
+const createXgcd = exports.createXgcd = /* #__PURE__ */createNumberFactory('xgcd', _index.xgcdNumber);
+const createDivideScalar = exports.createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', _index.divideNumber);
+const createPow = exports.createPow = /* #__PURE__ */createNumberFactory('pow', _index.powNumber);
+const createRound = exports.createRound = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('round', _index.roundNumber);
+const createLog = exports.createLog = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('log', _index.logNumber);
+const createLog1p = exports.createLog1p = /* #__PURE__ */createNumberFactory('log1p', _index.log1pNumber);
+const createAdd = exports.createAdd = /* #__PURE__ */createNumberFactory('add', _index.addNumber);
+const createNorm = exports.createNorm = /* #__PURE__ */createNumberFactory('norm', _index.normNumber);
+const createDivide = exports.createDivide = /* #__PURE__ */createNumberFactory('divide', _index.divideNumber);
+
+// bitwise
+const createBitAnd = exports.createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', _index.bitAndNumber);
+const createBitNot = exports.createBitNot = /* #__PURE__ */createNumberFactory('bitNot', _index.bitNotNumber);
+const createBitOr = exports.createBitOr = /* #__PURE__ */createNumberFactory('bitOr', _index.bitOrNumber);
+const createBitXor = exports.createBitXor = /* #__PURE__ */createNumberFactory('bitXor', _index.bitXorNumber);
+const createLeftShift = exports.createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', _index.leftShiftNumber);
+const createRightArithShift = exports.createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', _index.rightArithShiftNumber);
+const createRightLogShift = exports.createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', _index.rightLogShiftNumber);
+
+// combinatorics
+
+// constants
+
+// create
+
+// expression
+
+// logical
+const createAnd = exports.createAnd = /* #__PURE__ */createNumberFactory('and', _index.andNumber);
+const createNot = exports.createNot = /* #__PURE__ */createNumberFactory('not', _index.notNumber);
+const createOr = exports.createOr = /* #__PURE__ */createNumberFactory('or', _index.orNumber);
+const createXor = exports.createXor = /* #__PURE__ */createNumberFactory('xor', _index.xorNumber);
+
+// matrix
+
+// FIXME: create a lightweight "number" implementation of subset only supporting plain objects/arrays
+const createIndex = exports.createIndex = /* #__PURE__ */(0, _factory.factory)('index', [], () => _noop.noIndex);
+const createMatrix = exports.createMatrix = /* #__PURE__ */(0, _factory.factory)('matrix', [], () => _noop.noMatrix); // FIXME: needed now because subset transform needs it. Remove the need for it in subset
+const createSubset = exports.createSubset = /* #__PURE__ */(0, _factory.factory)('subset', [], () => _noop.noSubset);
+// TODO: provide number+array implementations for map, filter, forEach, zeros, ...?
+// TODO: create range implementation for range?
+
+// probability
+const createCombinations = exports.createCombinations = createNumberFactory('combinations', _index.combinationsNumber);
+const createGamma = exports.createGamma = createNumberFactory('gamma', _index.gammaNumber);
+const createLgamma = exports.createLgamma = createNumberFactory('lgamma', _index.lgammaNumber);
+
+// relational
+
+// special
+
+// statistics
+
+// string
+
+// trigonometry
+const createAcos = exports.createAcos = /* #__PURE__ */createNumberFactory('acos', _index.acosNumber);
+const createAcosh = exports.createAcosh = /* #__PURE__ */createNumberFactory('acosh', _index.acoshNumber);
+const createAcot = exports.createAcot = /* #__PURE__ */createNumberFactory('acot', _index.acotNumber);
+const createAcoth = exports.createAcoth = /* #__PURE__ */createNumberFactory('acoth', _index.acothNumber);
+const createAcsc = exports.createAcsc = /* #__PURE__ */createNumberFactory('acsc', _index.acscNumber);
+const createAcsch = exports.createAcsch = /* #__PURE__ */createNumberFactory('acsch', _index.acschNumber);
+const createAsec = exports.createAsec = /* #__PURE__ */createNumberFactory('asec', _index.asecNumber);
+const createAsech = exports.createAsech = /* #__PURE__ */createNumberFactory('asech', _index.asechNumber);
+const createAsin = exports.createAsin = /* #__PURE__ */createNumberFactory('asin', _index.asinNumber);
+const createAsinh = exports.createAsinh = /* #__PURE__ */createNumberFactory('asinh', _index.asinhNumber);
+const createAtan = exports.createAtan = /* #__PURE__ */createNumberFactory('atan', _index.atanNumber);
+const createAtan2 = exports.createAtan2 = /* #__PURE__ */createNumberFactory('atan2', _index.atan2Number);
+const createAtanh = exports.createAtanh = /* #__PURE__ */createNumberFactory('atanh', _index.atanhNumber);
+const createCos = exports.createCos = /* #__PURE__ */createNumberFactory('cos', _index.cosNumber);
+const createCosh = exports.createCosh = /* #__PURE__ */createNumberFactory('cosh', _index.coshNumber);
+const createCot = exports.createCot = /* #__PURE__ */createNumberFactory('cot', _index.cotNumber);
+const createCoth = exports.createCoth = /* #__PURE__ */createNumberFactory('coth', _index.cothNumber);
+const createCsc = exports.createCsc = /* #__PURE__ */createNumberFactory('csc', _index.cscNumber);
+const createCsch = exports.createCsch = /* #__PURE__ */createNumberFactory('csch', _index.cschNumber);
+const createSec = exports.createSec = /* #__PURE__ */createNumberFactory('sec', _index.secNumber);
+const createSech = exports.createSech = /* #__PURE__ */createNumberFactory('sech', _index.sechNumber);
+const createSin = exports.createSin = /* #__PURE__ */createNumberFactory('sin', _index.sinNumber);
+const createSinh = exports.createSinh = /* #__PURE__ */createNumberFactory('sinh', _index.sinhNumber);
+const createTan = exports.createTan = /* #__PURE__ */createNumberFactory('tan', _index.tanNumber);
+const createTanh = exports.createTanh = /* #__PURE__ */createNumberFactory('tanh', _index.tanhNumber);
+
+// transforms
+
+const createSubsetTransform = exports.createSubsetTransform = /* #__PURE__ */(0, _factory.factory)('subset', [], () => _noop.noSubset, {
+  isTransformFunction: true
+});
+
+// utils
+
+const createIsInteger = exports.createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', _index.isIntegerNumber);
+const createIsNegative = exports.createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', _index.isNegativeNumber);
+const createIsPositive = exports.createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', _index.isPositiveNumber);
+const createIsZero = exports.createIsZero = /* #__PURE__ */createNumberFactory('isZero', _index.isZeroNumber);
+const createIsNaN = exports.createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', _index.isNaNNumber);
+
+// json
+
+// helper functions to create a factory function for a function which only needs typed-function
+function createNumberFactory(name, fn) {
+  return (0, _factory.factory)(name, ['typed'], _ref => {
+    let {
+      typed
+    } = _ref;
+    return typed(fn);
+  });
+}
+function createNumberOptionalSecondArgFactory(name, fn) {
+  return (0, _factory.factory)(name, ['typed'], _ref2 => {
+    let {
+      typed
+    } = _ref2;
+    return typed({
+      number: fn,
+      'number,number': fn
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js
new file mode 100644
index 0000000..e3327e4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/lup.js
@@ -0,0 +1,382 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLup = void 0;
+var _object = require("../../../utils/object.js");
+var _factory = require("../../../utils/factory.js");
+const name = 'lup';
+const dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];
+const createLup = exports.createLup = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    larger,
+    equalScalar,
+    unaryMinus,
+    DenseMatrix,
+    SparseMatrix,
+    Spa
+  } = _ref;
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
+   * row permutation vector `p` where `A[p,:] = L * U`
+   *
+   * Syntax:
+   *
+   *    math.lup(A)
+   *
+   * Example:
+   *
+   *    const m = [[2, 1], [1, 4]]
+   *    const r = math.lup(m)
+   *    // r = {
+   *    //   L: [[1, 0], [0.5, 1]],
+   *    //   U: [[2, 1], [0, 3.5]],
+   *    //   P: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    slu, lsolve, lusolve, usolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.
+   *
+   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.
+   */
+  return typed(name, {
+    DenseMatrix: function (m) {
+      return _denseLUP(m);
+    },
+    SparseMatrix: function (m) {
+      return _sparseLUP(m);
+    },
+    Array: function (a) {
+      // create dense matrix from array
+      const m = matrix(a);
+      // lup, use matrix implementation
+      const r = _denseLUP(m);
+      // result
+      return {
+        L: r.L.valueOf(),
+        U: r.U.valueOf(),
+        p: r.p
+      };
+    }
+  });
+  function _denseLUP(m) {
+    // rows & columns
+    const rows = m._size[0];
+    const columns = m._size[1];
+    // minimum rows and columns
+    let n = Math.min(rows, columns);
+    // matrix array, clone original data
+    const data = (0, _object.clone)(m._data);
+    // l matrix arrays
+    const ldata = [];
+    const lsize = [rows, n];
+    // u matrix arrays
+    const udata = [];
+    const usize = [n, columns];
+    // vars
+    let i, j, k;
+    // permutation vector
+    const p = [];
+    for (i = 0; i < rows; i++) {
+      p[i] = i;
+    }
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows
+        for (i = 0; i < rows; i++) {
+          // min i,j
+          const min = Math.min(i, j);
+          // v[i, j]
+          let s = 0;
+          // loop up to min
+          for (k = 0; k < min; k++) {
+            // s = l[i, k] - data[k, j]
+            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));
+          }
+          data[i][j] = subtractScalar(data[i][j], s);
+        }
+      }
+      // row with larger value in cvector, row >= j
+      let pi = j;
+      let pabsv = 0;
+      let vjj = 0;
+      // loop rows
+      for (i = j; i < rows; i++) {
+        // data @ i, j
+        const v = data[i][j];
+        // absolute value
+        const absv = abs(v);
+        // value is greater than pivote value
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = i;
+          // update max value
+          pabsv = absv;
+          // value @ [j, j]
+          vjj = v;
+        }
+      }
+      // swap rows (j <-> pi)
+      if (j !== pi) {
+        // swap values j <-> pi in p
+        p[j] = [p[pi], p[pi] = p[j]][0];
+        // swap j <-> pi in data
+        DenseMatrix._swapRows(j, pi, data);
+      }
+      // check column is in lower triangular matrix
+      if (j < rows) {
+        // loop rows (lower triangular matrix)
+        for (i = j + 1; i < rows; i++) {
+          // value @ i, j
+          const vij = data[i][j];
+          if (!equalScalar(vij, 0)) {
+            // update data
+            data[i][j] = divideScalar(data[i][j], vjj);
+          }
+        }
+      }
+    }
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // initialize row in arrays
+        if (j === 0) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i] = [];
+          }
+          // L
+          ldata[i] = [];
+        }
+        // check we are in the upper triangular matrix
+        if (i < j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          }
+          // check column exists in lower triangular matrix
+          if (j < rows) {
+            // L
+            ldata[i][j] = 0;
+          }
+          continue;
+        }
+        // diagonal value
+        if (i === j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          }
+          // check column exists in lower triangular matrix
+          if (j < rows) {
+            // L
+            ldata[i][j] = 1;
+          }
+          continue;
+        }
+        // check row exists in upper triangular matrix
+        if (i < columns) {
+          // U
+          udata[i][j] = 0;
+        }
+        // check column exists in lower triangular matrix
+        if (j < rows) {
+          // L
+          ldata[i][j] = data[i][j];
+        }
+      }
+    }
+    // l matrix
+    const l = new DenseMatrix({
+      data: ldata,
+      size: lsize
+    });
+    // u matrix
+    const u = new DenseMatrix({
+      data: udata,
+      size: usize
+    });
+    // p vector
+    const pv = [];
+    for (i = 0, n = p.length; i < n; i++) {
+      pv[p[i]] = i;
+    }
+    // return matrices
+    return {
+      L: l,
+      U: u,
+      p: pv,
+      toString: function () {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+  function _sparseLUP(m) {
+    // rows & columns
+    const rows = m._size[0];
+    const columns = m._size[1];
+    // minimum rows and columns
+    const n = Math.min(rows, columns);
+    // matrix arrays (will not be modified, thanks to permutation vector)
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+    // l matrix arrays
+    const lvalues = [];
+    const lindex = [];
+    const lptr = [];
+    const lsize = [rows, n];
+    // u matrix arrays
+    const uvalues = [];
+    const uindex = [];
+    const uptr = [];
+    const usize = [n, columns];
+    // vars
+    let i, j, k;
+    // permutation vectors, (current index -> original index) and (original index -> current index)
+    const pvCo = [];
+    const pvOc = [];
+    for (i = 0; i < rows; i++) {
+      pvCo[i] = i;
+      pvOc[i] = i;
+    }
+    // swap indices in permutation vectors (condition x < y)!
+    const swapIndeces = function (x, y) {
+      // find pv indeces getting data from x and y
+      const kx = pvOc[x];
+      const ky = pvOc[y];
+      // update permutation vector current -> original
+      pvCo[kx] = y;
+      pvCo[ky] = x;
+      // update permutation vector original -> current
+      pvOc[x] = ky;
+      pvOc[y] = kx;
+    };
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // sparse accumulator
+      const spa = new Spa();
+      // check lower triangular matrix has a value @ column j
+      if (j < rows) {
+        // update ptr
+        lptr.push(lvalues.length);
+        // first value in j column for lower triangular matrix
+        lvalues.push(1);
+        lindex.push(j);
+      }
+      // update ptr
+      uptr.push(uvalues.length);
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = ptr[j];
+      const k1 = ptr[j + 1];
+      // copy column j into sparse accumulator
+      for (k = k0; k < k1; k++) {
+        // row
+        i = index[k];
+        // copy column values into sparse accumulator (use permutation vector)
+        spa.set(pvCo[i], values[k]);
+      }
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows in column j (above diagonal)
+        spa.forEach(0, j - 1, function (k, vkj) {
+          // loop rows in column k (L)
+          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {
+            // check row is below k
+            if (i > k) {
+              // update spa value
+              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));
+            }
+          });
+        });
+      }
+      // row with larger value in spa, row >= j
+      let pi = j;
+      let vjj = spa.get(j);
+      let pabsv = abs(vjj);
+      // loop values in spa (order by row, below diagonal)
+      spa.forEach(j + 1, rows - 1, function (x, v) {
+        // absolute value
+        const absv = abs(v);
+        // value is greater than pivote value
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = x;
+          // update max value
+          pabsv = absv;
+          // value @ [j, j]
+          vjj = v;
+        }
+      });
+      // swap rows (j <-> pi)
+      if (j !== pi) {
+        // swap values j <-> pi in L
+        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr);
+        // swap values j <-> pi in U
+        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr);
+        // swap values in spa
+        spa.swap(j, pi);
+        // update permutation vector (swap values @ j, pi)
+        swapIndeces(j, pi);
+      }
+      // loop values in spa (order by row)
+      spa.forEach(0, rows - 1, function (x, v) {
+        // check we are above diagonal
+        if (x <= j) {
+          // update upper triangular matrix
+          uvalues.push(v);
+          uindex.push(x);
+        } else {
+          // update value
+          v = divideScalar(v, vjj);
+          // check value is non zero
+          if (!equalScalar(v, 0)) {
+            // update lower triangular matrix
+            lvalues.push(v);
+            lindex.push(x);
+          }
+        }
+      });
+    }
+    // update ptrs
+    uptr.push(uvalues.length);
+    lptr.push(lvalues.length);
+
+    // return matrices
+    return {
+      L: new SparseMatrix({
+        values: lvalues,
+        index: lindex,
+        ptr: lptr,
+        size: lsize
+      }),
+      U: new SparseMatrix({
+        values: uvalues,
+        index: uindex,
+        ptr: uptr,
+        size: usize
+      }),
+      p: pvCo,
+      toString: function () {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js
new file mode 100644
index 0000000..09aa2e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/qr.js
@@ -0,0 +1,229 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createQr = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _factory = require("../../../utils/factory.js");
+const name = 'qr';
+const dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'complex'];
+const createQr = exports.createQr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    zeros,
+    identity,
+    isZero,
+    equal,
+    sign,
+    sqrt,
+    conj,
+    unaryMinus,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    complex
+  } = _ref;
+  /**
+   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
+   * two matrices (`Q`, `R`) where `Q` is an
+   * orthogonal matrix and `R` is an upper triangular matrix.
+   *
+   * Syntax:
+   *
+   *    math.qr(A)
+   *
+   * Example:
+   *
+   *    const m = [
+   *      [1, -1,  4],
+   *      [1,  4, -2],
+   *      [1,  4,  2],
+   *      [1,  -1, 0]
+   *    ]
+   *    const result = math.qr(m)
+   *    // r = {
+   *    //   Q: [
+   *    //     [0.5, -0.5,   0.5],
+   *    //     [0.5,  0.5,  -0.5],
+   *    //     [0.5,  0.5,   0.5],
+   *    //     [0.5, -0.5,  -0.5],
+   *    //   ],
+   *    //   R: [
+   *    //     [2, 3,  2],
+   *    //     [0, 5, -2],
+   *    //     [0, 0,  4],
+   *    //     [0, 0,  0]
+   *    //   ]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lusolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array
+   * for which to get the QR decomposition.
+   *
+   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal
+   * matrix and R: the upper triangular matrix
+   */
+  return (0, _extends2.default)(typed(name, {
+    DenseMatrix: function (m) {
+      return _denseQR(m);
+    },
+    SparseMatrix: function (m) {
+      return _sparseQR(m);
+    },
+    Array: function (a) {
+      // create dense matrix from array
+      const m = matrix(a);
+      // lup, use matrix implementation
+      const r = _denseQR(m);
+      // result
+      return {
+        Q: r.Q.valueOf(),
+        R: r.R.valueOf()
+      };
+    }
+  }), {
+    _denseQRimpl
+  });
+  function _denseQRimpl(m) {
+    // rows & columns (m x n)
+    const rows = m._size[0]; // m
+    const cols = m._size[1]; // n
+
+    const Q = identity([rows], 'dense');
+    const Qdata = Q._data;
+    const R = m.clone();
+    const Rdata = R._data;
+
+    // vars
+    let i, j, k;
+    const w = zeros([rows], '');
+    for (k = 0; k < Math.min(cols, rows); ++k) {
+      /*
+       * **k-th Household matrix**
+       *
+       * The matrix I - 2*v*transpose(v)
+       * x     = first column of A
+       * x1    = first element of x
+       * alpha = x1 / |x1| * |x|
+       * e1    = tranpose([1, 0, 0, ...])
+       * u     = x - alpha * e1
+       * v     = u / |u|
+       *
+       * Household matrix = I - 2 * v * tranpose(v)
+       *
+       *  * Initially Q = I and R = A.
+       *  * Household matrix is a reflection in a plane normal to v which
+       *    will zero out all but the top right element in R.
+       *  * Appplying reflection to both Q and R will not change product.
+       *  * Repeat this process on the (1,1) minor to get R as an upper
+       *    triangular matrix.
+       *  * Reflections leave the magnitude of the columns of Q unchanged
+       *    so Q remains othoganal.
+       *
+       */
+
+      const pivot = Rdata[k][k];
+      const sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));
+      const conjSgn = conj(sgn);
+      let alphaSquared = 0;
+      for (i = k; i < rows; i++) {
+        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));
+      }
+      const alpha = multiplyScalar(sgn, sqrt(alphaSquared));
+      if (!isZero(alpha)) {
+        // first element in vector u
+        const u1 = subtractScalar(pivot, alpha);
+
+        // w = v * u1 / |u|    (only elements k to (rows-1) are used)
+        w[k] = 1;
+        for (i = k + 1; i < rows; i++) {
+          w[i] = divideScalar(Rdata[i][k], u1);
+        }
+
+        // tau = - conj(u1 / alpha)
+        const tau = unaryMinus(conj(divideScalar(u1, alpha)));
+        let s;
+
+        /*
+         * tau and w have been choosen so that
+         *
+         * 2 * v * tranpose(v) = tau * w * tranpose(w)
+         */
+
+        /*
+         * -- calculate R = R - tau * w * tranpose(w) * R --
+         * Only do calculation with rows k to (rows-1)
+         * Additionally columns 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+        for (j = k; j < cols; j++) {
+          s = 0.0;
+
+          // calculate jth element of [tranpose(w) * R]
+          for (i = k; i < rows; i++) {
+            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));
+          }
+
+          // calculate the jth element of [tau * transpose(w) * R]
+          s = multiplyScalar(s, tau);
+          for (i = k; i < rows; i++) {
+            Rdata[i][j] = multiplyScalar(subtractScalar(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);
+          }
+        }
+        /*
+         * -- calculate Q = Q - tau * Q * w * transpose(w) --
+         * Q is a square matrix (rows x rows)
+         * Only do calculation with columns k to (rows-1)
+         * Additionally rows 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+        for (i = 0; i < rows; i++) {
+          s = 0.0;
+
+          // calculate ith element of [Q * w]
+          for (j = k; j < rows; j++) {
+            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));
+          }
+
+          // calculate the ith element of [tau * Q * w]
+          s = multiplyScalar(s, tau);
+          for (j = k; j < rows; ++j) {
+            Qdata[i][j] = divideScalar(subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);
+          }
+        }
+      }
+    }
+
+    // return matrices
+    return {
+      Q,
+      R,
+      toString: function () {
+        return 'Q: ' + this.Q.toString() + '\nR: ' + this.R.toString();
+      }
+    };
+  }
+  function _denseQR(m) {
+    const ret = _denseQRimpl(m);
+    const Rdata = ret.R._data;
+    if (m._data.length > 0) {
+      const zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;
+      for (let i = 0; i < Rdata.length; ++i) {
+        for (let j = 0; j < i && j < (Rdata[0] || []).length; ++j) {
+          Rdata[i][j] = zero;
+        }
+      }
+    }
+    return ret;
+  }
+  function _sparseQR(m) {
+    throw new Error('qr not implemented for sparse matrices yet');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/schur.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/schur.js
new file mode 100644
index 0000000..a00a947
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/schur.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSchur = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'schur';
+const dependencies = ['typed', 'matrix', 'identity', 'multiply', 'qr', 'norm', 'subtract'];
+const createSchur = exports.createSchur = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    identity,
+    multiply,
+    qr,
+    norm,
+    subtract
+  } = _ref;
+  /**
+   *
+   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal
+   * and T is upper quasi-triangular.
+   * https://en.wikipedia.org/wiki/Schur_decomposition
+   *
+   * Syntax:
+   *
+   *     math.schur(A)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 0], [-4, 3]]
+   *     math.schur(A) // returns {T: [[3, 4], [0, 1]], R: [[0, 1], [-1, 0]]}
+   *
+   * See also:
+   *
+   *     sylvester, lyap, qr
+   *
+   * @param {Array | Matrix} A  Matrix A
+   * @return {{U: Array | Matrix, T: Array | Matrix}} Object containing both matrix U and T of the Schur Decomposition A=UTU'
+   */
+  return typed(name, {
+    Array: function (X) {
+      const r = _schur(matrix(X));
+      return {
+        U: r.U.valueOf(),
+        T: r.T.valueOf()
+      };
+    },
+    Matrix: function (X) {
+      return _schur(X);
+    }
+  });
+  function _schur(X) {
+    const n = X.size()[0];
+    let A = X;
+    let U = identity(n);
+    let k = 0;
+    let A0;
+    do {
+      A0 = A;
+      const QR = qr(A);
+      const Q = QR.Q;
+      const R = QR.R;
+      A = multiply(R, Q);
+      U = multiply(U, Q);
+      if (k++ > 100) {
+        break;
+      }
+    } while (norm(subtract(A, A0)) > 1e-4);
+    return {
+      U,
+      T: A
+    };
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js
new file mode 100644
index 0000000..a471b82
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/decomposition/slu.js
@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSlu = void 0;
+var _number = require("../../../utils/number.js");
+var _factory = require("../../../utils/factory.js");
+var _csSqr = require("../sparse/csSqr.js");
+var _csLu = require("../sparse/csLu.js");
+const name = 'slu';
+const dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+const createSlu = exports.createSlu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    add,
+    multiply,
+    transpose,
+    divideScalar,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  const csSqr = (0, _csSqr.createCsSqr)({
+    add,
+    multiply,
+    transpose
+  });
+  const csLu = (0, _csLu.createCsLu)({
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  });
+
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
+   *
+   * `P * A * Q = L * U`
+   *
+   * Syntax:
+   *
+   *    math.slu(A, order, threshold)
+   *
+   * Examples:
+   *
+   *    const A = math.sparse([[4,3], [6, 3]])
+   *    math.slu(A, 1, 0.001)
+   *    // returns:
+   *    // {
+   *    //   L: [[1, 0], [1.5, 1]]
+   *    //   U: [[4, 3], [0, -1.5]]
+   *    //   p: [0, 1]
+   *    //   q: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lsolve, usolve, lusolve
+   *
+   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.
+   * @param {Number}       order          The Symbolic Ordering and Analysis order:
+   *                                       0 - Natural ordering, no permutation vector q is returned
+   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'
+   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.
+   *                                           This is appropriatefor LU factorization of unsymmetric matrices.
+   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.
+   *                                           A dense row is a row with more than 10*sqr(columns) entries.
+   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.
+   */
+  return typed(name, {
+    'SparseMatrix, number, number': function (a, order, threshold) {
+      // verify order
+      if (!(0, _number.isInteger)(order) || order < 0 || order > 3) {
+        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');
+      }
+      // verify threshold
+      if (threshold < 0 || threshold > 1) {
+        throw new Error('Partial pivoting threshold must be a number from 0 to 1');
+      }
+
+      // perform symbolic ordering and analysis
+      const s = csSqr(order, a, false);
+
+      // perform lu decomposition
+      const f = csLu(a, s, threshold);
+
+      // return decomposition
+      return {
+        L: f.L,
+        U: f.U,
+        p: f.pinv,
+        q: s.q,
+        toString: function () {
+          return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\np: ' + this.p.toString() + (this.q ? '\nq: ' + this.q.toString() : '') + '\n';
+        }
+      };
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/derivative.js b/node_modules/mathjs/lib/cjs/function/algebra/derivative.js
new file mode 100644
index 0000000..fdc5fe6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/derivative.js
@@ -0,0 +1,512 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDerivative = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+const name = 'derivative';
+const dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+const createDerivative = exports.createDerivative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    parse,
+    simplify,
+    equal,
+    isZero,
+    numeric,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  /**
+   * Takes the derivative of an expression expressed in parser Nodes.
+   * The derivative will be taken over the supplied variable in the
+   * second parameter. If there are multiple variables in the expression,
+   * it will return a partial derivative.
+   *
+   * This uses rules of differentiation which can be found here:
+   *
+   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+   *
+   * Syntax:
+   *
+   *     math.derivative(expr, variable)
+   *     math.derivative(expr, variable, options)
+   *
+   * Examples:
+   *
+   *     math.derivative('x^2', 'x')                     // Node '2 * x'
+   *     math.derivative('x^2', 'x', {simplify: false})  // Node '2 * 1 * x ^ (2 - 1)'
+   *     math.derivative('sin(2x)', 'x'))                // Node '2 * cos(2 * x)'
+   *     math.derivative('2*x', 'x').evaluate()          // number 2
+   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8
+   *     const f = math.parse('x^2')
+   *     const x = math.parse('x')
+   *     math.derivative(f, x)                           // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, parse, evaluate
+   *
+   * @param  {Node | string} expr           The expression to differentiate
+   * @param  {SymbolNode | string} variable The variable over which to differentiate
+   * @param  {{simplify: boolean}} [options]
+   *                         There is one option available, `simplify`, which
+   *                         is true by default. When false, output will not
+   *                         be simplified.
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  function plainDerivative(expr, variable) {
+    let options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {
+      simplify: true
+    };
+    const cache = new Map();
+    const variableName = variable.name;
+    function isConstCached(node) {
+      const cached = cache.get(node);
+      if (cached !== undefined) {
+        return cached;
+      }
+      const res = _isConst(isConstCached, node, variableName);
+      cache.set(node, res);
+      return res;
+    }
+    const res = _derivative(expr, isConstCached);
+    return options.simplify ? simplify(res) : res;
+  }
+  function parseIdentifier(string) {
+    const symbol = parse(string);
+    if (!symbol.isSymbolNode) {
+      throw new TypeError('Invalid variable. ' + `Cannot parse ${JSON.stringify(string)} into a variable in function derivative`);
+    }
+    return symbol;
+  }
+  const derivative = typed(name, {
+    'Node, SymbolNode': plainDerivative,
+    'Node, SymbolNode, Object': plainDerivative,
+    'Node, string': (node, symbol) => plainDerivative(node, parseIdentifier(symbol)),
+    'Node, string, Object': (node, symbol, options) => plainDerivative(node, parseIdentifier(symbol), options)
+
+    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}
+    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {
+      let res = expr
+      for (let i = 0; i < order; i++) {
+        <create caching isConst>
+        res = _derivative(res, isConst)
+      }
+      return res
+    }
+    */
+  });
+  derivative._simplify = true;
+  derivative.toTex = function (deriv) {
+    return _derivTex.apply(null, deriv.args);
+  };
+
+  // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.
+  // NOTE: the optional "order" parameter here is currently unused
+  const _derivTex = typed('_derivTex', {
+    'Node, SymbolNode': function (expr, x) {
+      if ((0, _is.isConstantNode)(expr) && (0, _is.typeOf)(expr.value) === 'string') {
+        return _derivTex(parse(expr.value).toString(), x.toString(), 1);
+      } else {
+        return _derivTex(expr.toTex(), x.toString(), 1);
+      }
+    },
+    'Node, ConstantNode': function (expr, x) {
+      if ((0, _is.typeOf)(x.value) === 'string') {
+        return _derivTex(expr, parse(x.value));
+      } else {
+        throw new Error("The second parameter to 'derivative' is a non-string constant");
+      }
+    },
+    'Node, SymbolNode, ConstantNode': function (expr, x, order) {
+      return _derivTex(expr.toString(), x.name, order.value);
+    },
+    'string, string, number': function (expr, x, order) {
+      let d;
+      if (order === 1) {
+        d = '{d\\over d' + x + '}';
+      } else {
+        d = '{d^{' + order + '}\\over d' + x + '^{' + order + '}}';
+      }
+      return d + `\\left[${expr}\\right]`;
+    }
+  });
+
+  /**
+   * Checks if a node is constants (e.g. 2 + 2).
+   * Accepts (usually memoized) version of self as the first parameter for recursive calls.
+   * Classification is done as follows:
+   *
+   *   1. ConstantNodes are constants.
+   *   2. If there exists a SymbolNode, of which we are differentiating over,
+   *      in the subtree it is not constant.
+   *
+   * @param  {function} isConst  Function that tells whether sub-expression is a constant
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {string} varName     Variable that we are differentiating
+   * @return {boolean}  if node is constant
+   */
+  const _isConst = typed('_isConst', {
+    'function, ConstantNode, string': function () {
+      return true;
+    },
+    'function, SymbolNode, string': function (isConst, node, varName) {
+      // Treat other variables like constants. For reasoning, see:
+      //   https://en.wikipedia.org/wiki/Partial_derivative
+      return node.name !== varName;
+    },
+    'function, ParenthesisNode, string': function (isConst, node, varName) {
+      return isConst(node.content, varName);
+    },
+    'function, FunctionAssignmentNode, string': function (isConst, node, varName) {
+      if (!node.params.includes(varName)) {
+        return true;
+      }
+      return isConst(node.expr, varName);
+    },
+    'function, FunctionNode | OperatorNode, string': function (isConst, node, varName) {
+      return node.args.every(arg => isConst(arg, varName));
+    }
+  });
+
+  /**
+   * Applies differentiation rules.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {function} isConst  Function that tells if a node is constant
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  const _derivative = typed('_derivative', {
+    'ConstantNode, function': function () {
+      return createConstantNode(0);
+    },
+    'SymbolNode, function': function (node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      return createConstantNode(1);
+    },
+    'ParenthesisNode, function': function (node, isConst) {
+      return new ParenthesisNode(_derivative(node.content, isConst));
+    },
+    'FunctionAssignmentNode, function': function (node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      return _derivative(node.expr, isConst);
+    },
+    'FunctionNode, function': function (node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      const arg0 = node.args[0];
+      let arg1;
+      let div = false; // is output a fraction?
+      let negative = false; // is output negative?
+
+      let funcDerivative;
+      switch (node.name) {
+        case 'cbrt':
+          // d/dx(cbrt(x)) = 1 / (3x^(2/3))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);
+          break;
+        case 'sqrt':
+        case 'nthRoot':
+          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))
+          if (node.args.length === 1) {
+            div = true;
+            funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);
+          } else if (node.args.length === 2) {
+            // Rearrange from nthRoot(x, a) -> x^(1/a)
+            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]);
+            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), isConst);
+          }
+          break;
+        case 'log10':
+          arg1 = createConstantNode(10);
+        /* fall through! */
+        case 'log':
+          if (!arg1 && node.args.length === 1) {
+            // d/dx(log(x)) = 1 / x
+            funcDerivative = arg0.clone();
+            div = true;
+          } else if (node.args.length === 1 && arg1 || node.args.length === 2 && isConst(node.args[1])) {
+            // d/dx(log(x, c)) = 1 / (x*ln(c))
+            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);
+            div = true;
+          } else if (node.args.length === 2) {
+            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))
+            return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), isConst);
+          }
+          break;
+        case 'pow':
+          if (node.args.length === 2) {
+            // Pass to pow operator node parser
+            return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), isConst);
+          }
+          break;
+        case 'exp':
+          // d/dx(e^x) = e^x
+          funcDerivative = new FunctionNode('exp', [arg0.clone()]);
+          break;
+        case 'sin':
+          // d/dx(sin(x)) = cos(x)
+          funcDerivative = new FunctionNode('cos', [arg0.clone()]);
+          break;
+        case 'cos':
+          // d/dx(cos(x)) = -sin(x)
+          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);
+          break;
+        case 'tan':
+          // d/dx(tan(x)) = sec(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'sec':
+          // d/dx(sec(x)) = sec(x)tan(x)
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);
+          break;
+        case 'csc':
+          // d/dx(csc(x)) = -csc(x)cot(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);
+          break;
+        case 'cot':
+          // d/dx(cot(x)) = -csc(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'asin':
+          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+        case 'acos':
+          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+        case 'atan':
+          // d/dx(atan(x)) = 1 / (x^2 + 1)
+          div = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+        case 'asec':
+          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acsc':
+          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acot':
+          // d/dx(acot(x)) = -1 / (x^2 + 1)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+        case 'sinh':
+          // d/dx(sinh(x)) = cosh(x)
+          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);
+          break;
+        case 'cosh':
+          // d/dx(cosh(x)) = sinh(x)
+          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);
+          break;
+        case 'tanh':
+          // d/dx(tanh(x)) = sech(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'sech':
+          // d/dx(sech(x)) = -sech(x)tanh(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);
+          break;
+        case 'csch':
+          // d/dx(csch(x)) = -csch(x)coth(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);
+          break;
+        case 'coth':
+          // d/dx(coth(x)) = -csch(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'asinh':
+          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+        case 'acosh':
+          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+        case 'atanh':
+          // d/dx(atanh(x)) = 1 / (1 - x^2)
+          div = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+        case 'asech':
+          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);
+          break;
+        case 'acsch':
+          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acoth':
+          // d/dx(acoth(x)) = -1 / (1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+        case 'abs':
+          // d/dx(abs(x)) = abs(x)/x
+          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);
+          break;
+        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)
+        default:
+          throw new Error('Cannot process function "' + node.name + '" in derivative: ' + 'the function is not supported, undefined, or the number of arguments passed to it are not supported');
+      }
+      let op, func;
+      if (div) {
+        op = '/';
+        func = 'divide';
+      } else {
+        op = '*';
+        func = 'multiply';
+      }
+
+      /* Apply chain rule to all functions:
+         F(x)  = f(g(x))
+         F'(x) = g'(x)*f'(g(x)) */
+      let chainDerivative = _derivative(arg0, isConst);
+      if (negative) {
+        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);
+      }
+      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);
+    },
+    'OperatorNode, function': function (node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      if (node.op === '+') {
+        // d/dx(sum(f(x)) = sum(f'(x))
+        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {
+          return _derivative(arg, isConst);
+        }));
+      }
+      if (node.op === '-') {
+        // d/dx(+/-f(x)) = +/-f'(x)
+        if (node.isUnary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], isConst)]);
+        }
+
+        // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)
+        if (node.isBinary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], isConst), _derivative(node.args[1], isConst)]);
+        }
+      }
+      if (node.op === '*') {
+        // d/dx(c*f(x)) = c*f'(x)
+        const constantTerms = node.args.filter(function (arg) {
+          return isConst(arg);
+        });
+        if (constantTerms.length > 0) {
+          const nonConstantTerms = node.args.filter(function (arg) {
+            return !isConst(arg);
+          });
+          const nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);
+          const newArgs = constantTerms.concat(_derivative(nonConstantNode, isConst));
+          return new OperatorNode('*', 'multiply', newArgs);
+        }
+
+        // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)
+        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {
+          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {
+            return argInner === argOuter ? _derivative(argInner, isConst) : argInner.clone();
+          }));
+        }));
+      }
+      if (node.op === '/' && node.isBinary()) {
+        const arg0 = node.args[0];
+        const arg1 = node.args[1];
+
+        // d/dx(f(x) / c) = f'(x) / c
+        if (isConst(arg1)) {
+          return new OperatorNode('/', 'divide', [_derivative(arg0, isConst), arg1]);
+        }
+
+        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)
+        if (isConst(arg0)) {
+          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, isConst), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);
+        }
+
+        // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2
+        return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, isConst), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, isConst)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);
+      }
+      if (node.op === '^' && node.isBinary()) {
+        const arg0 = node.args[0];
+        const arg1 = node.args[1];
+        if (isConst(arg0)) {
+          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1
+          if ((0, _is.isConstantNode)(arg0) && (isZero(arg0.value) || equal(arg0.value, 1))) {
+            return createConstantNode(0);
+          }
+
+          // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)
+          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [arg0.clone()]), _derivative(arg1.clone(), isConst)])]);
+        }
+        if (isConst(arg1)) {
+          if ((0, _is.isConstantNode)(arg1)) {
+            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0
+            if (isZero(arg1.value)) {
+              return createConstantNode(0);
+            }
+            // Ignore exponent; f(x)^1 = f(x)
+            if (equal(arg1.value, 1)) {
+              return _derivative(arg0, isConst);
+            }
+          }
+
+          // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)
+          const powMinusOne = new OperatorNode('^', 'pow', [arg0.clone(), new OperatorNode('-', 'subtract', [arg1, createConstantNode(1)])]);
+          return new OperatorNode('*', 'multiply', [arg1.clone(), new OperatorNode('*', 'multiply', [_derivative(arg0, isConst), powMinusOne])]);
+        }
+
+        // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]
+        return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [arg0.clone(), arg1.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(arg0, isConst), new OperatorNode('/', 'divide', [arg1.clone(), arg0.clone()])]), new OperatorNode('*', 'multiply', [_derivative(arg1, isConst), new FunctionNode('log', [arg0.clone()])])])]);
+      }
+      throw new Error('Cannot process operator "' + node.op + '" in derivative: ' + 'the operator is not supported, undefined, or the number of arguments passed to it are not supported');
+    }
+  });
+
+  /**
+   * Helper function to create a constant node with a specific type
+   * (number, BigNumber, Fraction)
+   * @param {number} value
+   * @param {string} [valueType]
+   * @return {ConstantNode}
+   */
+  function createConstantNode(value, valueType) {
+    return new ConstantNode(numeric(value, valueType || (0, _number.safeNumberType)(String(value), config)));
+  }
+  return derivative;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js b/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js
new file mode 100644
index 0000000..bb6d65a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/leafCount.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLeafCount = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'leafCount';
+const dependencies = ['parse', 'typed'];
+const createLeafCount = exports.createLeafCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    parse,
+    typed
+  } = _ref;
+  // This does the real work, but we don't have to recurse through
+  // a typed call if we separate it out
+  function countLeaves(node) {
+    let count = 0;
+    node.forEach(n => {
+      count += countLeaves(n);
+    });
+    return count || 1;
+  }
+
+  /**
+   * Gives the number of "leaf nodes" in the parse tree of the given expression
+   * A leaf node is one that has no subexpressions, essentially either a
+   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the
+   * unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   *
+   * The `simplify()` function should generally not increase the `leafCount()`
+   * of an expression, although currently there is no guarantee that it never
+   * does so. In many cases, `simplify()` reduces the leaf count.
+   *
+   * Syntax:
+   *
+   *     math.leafCount(expr)
+   *
+   * Examples:
+   *
+   *     math.leafCount('x') // 1
+   *     math.leafCount(math.parse('a*d-b*c')) // 4
+   *     math.leafCount('[a,b;c,d][0,1]') // 6
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param {Node|string} expr    The expression to count the leaves of
+   *
+   * @return {number}  The number of leaves of `expr`
+   *
+   */
+  return typed(name, {
+    Node: function (expr) {
+      return countLeaves(expr);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/lyap.js b/node_modules/mathjs/lib/cjs/function/algebra/lyap.js
new file mode 100644
index 0000000..1548e7b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/lyap.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLyap = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'lyap';
+const dependencies = ['typed', 'matrix', 'sylvester', 'multiply', 'transpose'];
+const createLyap = exports.createLyap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    sylvester,
+    multiply,
+    transpose
+  } = _ref;
+  /**
+   *
+   * Solves the Continuous-time Lyapunov equation AP+PA'+Q=0 for P, where
+   * Q is an input matrix. When Q is symmetric, P is also symmetric. Notice
+   * that different equivalent definitions exist for the Continuous-time
+   * Lyapunov equation.
+   * https://en.wikipedia.org/wiki/Lyapunov_equation
+   *
+   * Syntax:
+   *
+   *     math.lyap(A, Q)
+   *
+   * Examples:
+   *
+   *     const A = [[-2, 0], [1, -4]]
+   *     const Q = [[3, 1], [1, 3]]
+   *     const P = math.lyap(A, Q)
+   *
+   * See also:
+   *
+   *     sylvester, schur
+   *
+   * @param {Matrix | Array} A  Matrix A
+   * @param {Matrix | Array} Q  Matrix Q
+   * @return {Matrix | Array} Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q
+   */
+  return typed(name, {
+    'Matrix, Matrix': function (A, Q) {
+      return sylvester(A, transpose(A), multiply(-1, Q));
+    },
+    'Array, Matrix': function (A, Q) {
+      return sylvester(matrix(A), transpose(matrix(A)), multiply(-1, Q));
+    },
+    'Matrix, Array': function (A, Q) {
+      return sylvester(A, transpose(matrix(A)), matrix(multiply(-1, Q)));
+    },
+    'Array, Array': function (A, Q) {
+      return sylvester(matrix(A), transpose(matrix(A)), matrix(multiply(-1, Q))).toArray();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/polynomialRoot.js b/node_modules/mathjs/lib/cjs/function/algebra/polynomialRoot.js
new file mode 100644
index 0000000..dc7ec39
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/polynomialRoot.js
@@ -0,0 +1,128 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPolynomialRoot = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'polynomialRoot';
+const dependencies = ['typed', 'isZero', 'equalScalar', 'add', 'subtract', 'multiply', 'divide', 'sqrt', 'unaryMinus', 'cbrt', 'typeOf', 'im', 're'];
+const createPolynomialRoot = exports.createPolynomialRoot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isZero,
+    equalScalar,
+    add,
+    subtract,
+    multiply,
+    divide,
+    sqrt,
+    unaryMinus,
+    cbrt,
+    typeOf,
+    im,
+    re
+  } = _ref;
+  /**
+   * Finds the numerical values of the distinct roots of a polynomial with real or complex coefficients.
+   * Currently operates only on linear, quadratic, and cubic polynomials using the standard
+   * formulas for the roots.
+   *
+   * Syntax:
+   *
+   *     math.polynomialRoot(constant, linearCoeff, quadraticCoeff, cubicCoeff)
+   *
+   * Examples:
+   *     // linear
+   *     math.polynomialRoot(6, 3)                                        // [-2]
+   *     math.polynomialRoot(math.complex(6,3), 3)                        // [-2 - i]
+   *     math.polynomialRoot(math.complex(6,3), math.complex(2,1))        // [-3 + 0i]
+   *     // quadratic
+   *     math.polynomialRoot(2, -3, 1)                                    // [2, 1]
+   *     math.polynomialRoot(8, 8, 2)                                     // [-2]
+   *     math.polynomialRoot(-2, 0, 1)                                    // [1.4142135623730951, -1.4142135623730951]
+   *     math.polynomialRoot(2, -2, 1)                                    // [1 + i, 1 - i]
+   *     math.polynomialRoot(math.complex(1,3), math.complex(-3, -2), 1)  // [2 + i, 1 + i]
+   *     // cubic
+   *     math.polynomialRoot(-6, 11, -6, 1)                               // [1, 3, 2]
+   *     math.polynomialRoot(-8, 0, 0, 1)                                 // [-1 - 1.7320508075688774i, 2, -1 + 1.7320508075688774i]
+   *     math.polynomialRoot(0, 8, 8, 2)                                  // [0, -2]
+   *     math.polynomialRoot(1, 1, 1, 1)                                  // [-1 + 0i, 0 - i, 0 + i]
+   *
+   * See also:
+   *     cbrt, sqrt
+   *
+   * @param {... number | Complex} coeffs
+   *     The coefficients of the polynomial, starting with with the constant coefficent, followed
+   *     by the linear coefficient and subsequent coefficients of increasing powers.
+   * @return {Array} The distinct roots of the polynomial
+   */
+
+  return typed(name, {
+    'number|Complex, ...number|Complex': (constant, restCoeffs) => {
+      const coeffs = [constant, ...restCoeffs];
+      while (coeffs.length > 0 && isZero(coeffs[coeffs.length - 1])) {
+        coeffs.pop();
+      }
+      if (coeffs.length < 2) {
+        throw new RangeError(`Polynomial [${constant}, ${restCoeffs}] must have a non-zero non-constant coefficient`);
+      }
+      switch (coeffs.length) {
+        case 2:
+          // linear
+          return [unaryMinus(divide(coeffs[0], coeffs[1]))];
+        case 3:
+          {
+            // quadratic
+            const [c, b, a] = coeffs;
+            const denom = multiply(2, a);
+            const d1 = multiply(b, b);
+            const d2 = multiply(4, a, c);
+            if (equalScalar(d1, d2)) return [divide(unaryMinus(b), denom)];
+            const discriminant = sqrt(subtract(d1, d2));
+            return [divide(subtract(discriminant, b), denom), divide(subtract(unaryMinus(discriminant), b), denom)];
+          }
+        case 4:
+          {
+            // cubic, cf. https://en.wikipedia.org/wiki/Cubic_equation
+            const [d, c, b, a] = coeffs;
+            const denom = unaryMinus(multiply(3, a));
+            const D0_1 = multiply(b, b);
+            const D0_2 = multiply(3, a, c);
+            const D1_1 = add(multiply(2, b, b, b), multiply(27, a, a, d));
+            const D1_2 = multiply(9, a, b, c);
+            if (equalScalar(D0_1, D0_2) && equalScalar(D1_1, D1_2)) {
+              return [divide(b, denom)];
+            }
+            const Delta0 = subtract(D0_1, D0_2);
+            const Delta1 = subtract(D1_1, D1_2);
+            const discriminant1 = add(multiply(18, a, b, c, d), multiply(b, b, c, c));
+            const discriminant2 = add(multiply(4, b, b, b, d), multiply(4, a, c, c, c), multiply(27, a, a, d, d));
+            if (equalScalar(discriminant1, discriminant2)) {
+              return [divide(subtract(multiply(4, a, b, c), add(multiply(9, a, a, d), multiply(b, b, b))), multiply(a, Delta0)),
+              // simple root
+              divide(subtract(multiply(9, a, d), multiply(b, c)), multiply(2, Delta0)) // double root
+              ];
+            }
+            // OK, we have three distinct roots
+            let Ccubed;
+            if (equalScalar(D0_1, D0_2)) {
+              Ccubed = Delta1;
+            } else {
+              Ccubed = divide(add(Delta1, sqrt(subtract(multiply(Delta1, Delta1), multiply(4, Delta0, Delta0, Delta0)))), 2);
+            }
+            const allRoots = true;
+            const rawRoots = cbrt(Ccubed, allRoots).toArray().map(C => divide(add(b, C, divide(Delta0, C)), denom));
+            return rawRoots.map(r => {
+              if (typeOf(r) === 'Complex' && equalScalar(re(r), re(r) + im(r))) {
+                return re(r);
+              }
+              return r;
+            });
+          }
+        default:
+          throw new RangeError(`only implemented for cubic or lower-order polynomials, not ${coeffs}`);
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js b/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js
new file mode 100644
index 0000000..49ea9a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/rationalize.js
@@ -0,0 +1,825 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRationalize = void 0;
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'rationalize';
+const dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplifyConstant', 'simplifyCore', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode', 'ParenthesisNode'];
+const createRationalize = exports.createRationalize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    config,
+    typed,
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    parse,
+    simplifyConstant,
+    simplifyCore,
+    simplify,
+    fraction,
+    bignumber,
+    mathWithTransform,
+    matrix,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode,
+    ParenthesisNode
+  } = _ref;
+  /**
+   * Transform a rationalizable expression in a rational fraction.
+   * If rational fraction is one variable polynomial then converts
+   * the numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   *
+   * Syntax:
+   *
+   *     math.rationalize(expr)
+   *     math.rationalize(expr, detailed)
+   *     math.rationalize(expr, scope)
+   *     math.rationalize(expr, scope, detailed)
+   *
+   * Examples:
+   *
+   *     math.rationalize('sin(x)+y')
+   *                   //  Error: There is an unsolved function call
+   *     math.rationalize('2x/y - y/(x+1)')
+   *                   // (2*x^2-y^2+2*x)/(x*y+y)
+   *     math.rationalize('(2x+1)^6')
+   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
+   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
+   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
+   *
+   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+   *     math.rationalize('x+x+x+y',{})    // 3*x+y
+   *
+   *     const ret = math.rationalize('x+x+x+y',{},true)
+   *                   // ret.expression=3*x+y, ret.variables = ["x","y"]
+   *     const ret = math.rationalize('-2+5x^2',{},true)
+   *                   // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param  {Node|string} expr    The expression to check if is a polynomial expression
+   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input
+   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)
+   *
+   * @return {Object | Node}    The rational polynomial of `expr` or an object
+   *            `{expression, numerator, denominator, variables, coefficients}`, where
+   *              `expression` is a `Node` with the node simplified expression,
+   *              `numerator` is a `Node` with the simplified numerator of expression,
+   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),
+   *              `variables` is an array with variable names,
+   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent
+   *           {Expression Node}  node simplified expression
+   *
+   */
+  function _rationalize(expr) {
+    let scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    let detailed = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    const setRules = rulesRationalize(); // Rules for change polynomial in near canonical form
+    const polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial
+    const nVars = polyRet.variables.length;
+    const noExactFractions = {
+      exactFractions: false
+    };
+    const withExactFractions = {
+      exactFractions: true
+    };
+    expr = polyRet.expression;
+    if (nVars >= 1) {
+      // If expression in not a constant
+      expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)
+      let sBefore; // Previous expression
+      let rules;
+      let eDistrDiv = true;
+      let redoInic = false;
+      // Apply the initial rules, including succ div rules:
+      expr = simplify(expr, setRules.firstRules, {}, noExactFractions);
+      let s;
+      while (true) {
+        // Alternate applying successive division rules and distr.div.rules
+        // until there are no more changes:
+        rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;
+        expr = simplify(expr, rules, {}, withExactFractions);
+        eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules
+
+        s = expr.toString();
+        if (s === sBefore) {
+          break; // No changes : end of the loop
+        }
+        redoInic = true;
+        sBefore = s;
+      }
+      if (redoInic) {
+        // Apply first rules again without succ div rules (if there are changes)
+        expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions);
+      }
+      // Apply final rules:
+      expr = simplify(expr, setRules.finalRules, {}, noExactFractions);
+    } // NVars >= 1
+
+    const coefficients = [];
+    const retRationalize = {};
+    if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {
+      // Separate numerator from denominator
+      if (nVars === 1) {
+        expr.args[0] = polyToCanonical(expr.args[0], coefficients);
+        expr.args[1] = polyToCanonical(expr.args[1]);
+      }
+      if (detailed) {
+        retRationalize.numerator = expr.args[0];
+        retRationalize.denominator = expr.args[1];
+      }
+    } else {
+      if (nVars === 1) {
+        expr = polyToCanonical(expr, coefficients);
+      }
+      if (detailed) {
+        retRationalize.numerator = expr;
+        retRationalize.denominator = null;
+      }
+    }
+    // nVars
+
+    if (!detailed) return expr;
+    retRationalize.coefficients = coefficients;
+    retRationalize.variables = polyRet.variables;
+    retRationalize.expression = expr;
+    return retRationalize;
+  }
+  return typed(name, {
+    Node: _rationalize,
+    'Node, boolean': (expr, detailed) => _rationalize(expr, {}, detailed),
+    'Node, Object': _rationalize,
+    'Node, Object, boolean': _rationalize
+  }); // end of typed rationalize
+
+  /**
+   *  Function to simplify an expression using an optional scope and
+   *  return it if the expression is a polynomial expression, i.e.
+   *  an expression with one or more variables and the operators
+   *  +, -, *, and ^, where the exponent can only be a positive integer.
+   *
+   * Syntax:
+   *
+   *     polynomial(expr,scope,extended, rules)
+   *
+   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression
+   * @param  {object} scope           Optional scope for expression simplification
+   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.
+   * @param  {array}  rules           Optional. Default is no rule.
+   *
+   *
+   * @return {Object}
+   *            {Object} node:   node simplified expression
+   *            {Array}  variables:  variable names
+   */
+  function polynomial(expr, scope, extended, rules) {
+    const variables = [];
+    const node = simplify(expr, rules, scope, {
+      exactFractions: false
+    }); // Resolves any variables and functions with all defined parameters
+    extended = !!extended;
+    const oper = '+-*' + (extended ? '/' : '');
+    recPoly(node);
+    const retFunc = {};
+    retFunc.expression = node;
+    retFunc.variables = variables;
+    return retFunc;
+
+    // -------------------------------------------------------------------------------------------------------
+
+    /**
+     *  Function to simplify an expression using an optional scope and
+     *  return it if the expression is a polynomial expression, i.e.
+     *  an expression with one or more variables and the operators
+     *  +, -, *, and ^, where the exponent can only be a positive integer.
+     *
+     * Syntax:
+     *
+     *     recPoly(node)
+     *
+     *
+     * @param  {Node} node               The current sub tree expression in recursion
+     *
+     * @return                           nothing, throw an exception if error
+     */
+    function recPoly(node) {
+      const tp = node.type; // node type
+      if (tp === 'FunctionNode') {
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        if (node.op === '^') {
+          // TODO: handle negative exponents like in '1/x^(-2)'
+          if (node.args[1].type !== 'ConstantNode' || !(0, _number.isInteger)(parseFloat(node.args[1].value))) {
+            throw new Error('There is a non-integer exponent');
+          } else {
+            recPoly(node.args[0]);
+          }
+        } else {
+          if (!oper.includes(node.op)) {
+            throw new Error('Operator ' + node.op + ' invalid in polynomial expression');
+          }
+          for (let i = 0; i < node.args.length; i++) {
+            recPoly(node.args[i]);
+          }
+        } // type of operator
+      } else if (tp === 'SymbolNode') {
+        const name = node.name; // variable name
+        const pos = variables.indexOf(name);
+        if (pos === -1) {
+          // new variable in expression
+          variables.push(name);
+        }
+      } else if (tp === 'ParenthesisNode') {
+        recPoly(node.content);
+      } else if (tp !== 'ConstantNode') {
+        throw new Error('type ' + tp + ' is not allowed in polynomial expression');
+      }
+    } // end of recPoly
+  } // end of polynomial
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   * Return a rule set to rationalize an polynomial expression in rationalize
+   *
+   * Syntax:
+   *
+   *     rulesRationalize()
+   *
+   * @return {array}        rule set to rationalize an polynomial expression
+   */
+  function rulesRationalize() {
+    const oldRules = [simplifyCore,
+    // sCore
+    {
+      l: 'n+n',
+      r: '2*n'
+    }, {
+      l: 'n+-n',
+      r: '0'
+    }, simplifyConstant,
+    // sConstant
+    {
+      l: 'n*(n1^-1)',
+      r: 'n/n1'
+    }, {
+      l: 'n*n1^-n2',
+      r: 'n/n1^n2'
+    }, {
+      l: 'n1^-1',
+      r: '1/n1'
+    }, {
+      l: 'n*(n1/n2)',
+      r: '(n*n1)/n2'
+    }, {
+      l: '1*n',
+      r: 'n'
+    }];
+    const rulesFirst = [{
+      l: '(-n1)/(-n2)',
+      r: 'n1/n2'
+    },
+    // Unary division
+    {
+      l: '(-n1)*(-n2)',
+      r: 'n1*n2'
+    },
+    // Unary multiplication
+    {
+      l: 'n1--n2',
+      r: 'n1+n2'
+    },
+    // '--' elimination
+    {
+      l: 'n1-n2',
+      r: 'n1+(-n2)'
+    },
+    // Subtraction turn into add with un�ry minus
+    {
+      l: '(n1+n2)*n3',
+      r: '(n1*n3 + n2*n3)'
+    },
+    // Distributive 1
+    {
+      l: 'n1*(n2+n3)',
+      r: '(n1*n2+n1*n3)'
+    },
+    // Distributive 2
+    {
+      l: 'c1*n + c2*n',
+      r: '(c1+c2)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n + n',
+      r: '(c1+1)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n - c2*n',
+      r: '(c1-c2)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n - n',
+      r: '(c1-1)*n'
+    },
+    // Joining constants
+    {
+      l: 'v/c',
+      r: '(1/c)*v'
+    },
+    // variable/constant (new!)
+    {
+      l: 'v/-c',
+      r: '-(1/c)*v'
+    },
+    // variable/constant (new!)
+    {
+      l: '-v*-c',
+      r: 'c*v'
+    },
+    // Inversion constant and variable 1
+    {
+      l: '-v*c',
+      r: '-c*v'
+    },
+    // Inversion constant and variable 2
+    {
+      l: 'v*-c',
+      r: '-c*v'
+    },
+    // Inversion constant and variable 3
+    {
+      l: 'v*c',
+      r: 'c*v'
+    },
+    // Inversion constant and variable 4
+    {
+      l: '-(-n1*n2)',
+      r: '(n1*n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(n1*n2)',
+      r: '(-n1*n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(-n1+n2)',
+      r: '(n1-n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(n1+n2)',
+      r: '(-n1-n2)'
+    },
+    // Unary propagation
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    },
+    // Power to Power
+    {
+      l: '-(-n1/n2)',
+      r: '(n1/n2)'
+    },
+    // Division and Unary
+    {
+      l: '-(n1/n2)',
+      r: '(-n1/n2)'
+    }]; // Divisao and Unary
+
+    const rulesDistrDiv = [{
+      l: '(n1/n2 + n3/n4)',
+      r: '((n1*n4 + n3*n2)/(n2*n4))'
+    },
+    // Sum of fractions
+    {
+      l: '(n1/n2 + n3)',
+      r: '((n1 + n3*n2)/n2)'
+    },
+    // Sum fraction with number 1
+    {
+      l: '(n1 + n2/n3)',
+      r: '((n1*n3 + n2)/n3)'
+    }]; // Sum fraction with number 1
+
+    const rulesSucDiv = [{
+      l: '(n1/(n2/n3))',
+      r: '((n1*n3)/n2)'
+    },
+    // Division simplification
+    {
+      l: '(n1/n2/n3)',
+      r: '(n1/(n2*n3))'
+    }];
+    const setRules = {}; // rules set in 4 steps.
+
+    // All rules => infinite loop
+    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)
+
+    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set
+    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules
+    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules
+    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.
+
+    // Division simplification
+
+    // Second rule set.
+    // There is no aggregate expression with parentesis, but the only variable can be scattered.
+    setRules.finalRules = [simplifyCore,
+    // simplify.rules[0]
+    {
+      l: 'n*-n',
+      r: '-n^2'
+    },
+    // Joining multiply with power 1
+    {
+      l: 'n*n',
+      r: 'n^2'
+    },
+    // Joining multiply with power 2
+    simplifyConstant,
+    // simplify.rules[14] old 3rd index in oldRules
+    {
+      l: 'n*-n^n1',
+      r: '-n^(n1+1)'
+    },
+    // Joining multiply with power 3
+    {
+      l: 'n*n^n1',
+      r: 'n^(n1+1)'
+    },
+    // Joining multiply with power 4
+    {
+      l: 'n^n1*-n^n2',
+      r: '-n^(n1+n2)'
+    },
+    // Joining multiply with power 5
+    {
+      l: 'n^n1*n^n2',
+      r: 'n^(n1+n2)'
+    },
+    // Joining multiply with power 6
+    {
+      l: 'n^n1*-n',
+      r: '-n^(n1+1)'
+    },
+    // Joining multiply with power 7
+    {
+      l: 'n^n1*n',
+      r: 'n^(n1+1)'
+    },
+    // Joining multiply with power 8
+    {
+      l: 'n^n1/-n',
+      r: '-n^(n1-1)'
+    },
+    // Joining multiply with power 8
+    {
+      l: 'n^n1/n',
+      r: 'n^(n1-1)'
+    },
+    // Joining division with power 1
+    {
+      l: 'n/-n^n1',
+      r: '-n^(1-n1)'
+    },
+    // Joining division with power 2
+    {
+      l: 'n/n^n1',
+      r: 'n^(1-n1)'
+    },
+    // Joining division with power 3
+    {
+      l: 'n^n1/-n^n2',
+      r: 'n^(n1-n2)'
+    },
+    // Joining division with power 4
+    {
+      l: 'n^n1/n^n2',
+      r: 'n^(n1-n2)'
+    },
+    // Joining division with power 5
+    {
+      l: 'n1+(-n2*n3)',
+      r: 'n1-n2*n3'
+    },
+    // Solving useless parenthesis 1
+    {
+      l: 'v*(-c)',
+      r: '-c*v'
+    },
+    // Solving useless unary 2
+    {
+      l: 'n1+-n2',
+      r: 'n1-n2'
+    },
+    // Solving +- together (new!)
+    {
+      l: 'v*c',
+      r: 'c*v'
+    },
+    // inversion constant with variable
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    } // Power to Power
+    ];
+    return setRules;
+  } // End rulesRationalize
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   *  Expand recursively a tree node for handling with expressions with exponents
+   *  (it's not for constants, symbols or functions with exponents)
+   *  PS: The other parameters are internal for recursion
+   *
+   * Syntax:
+   *
+   *     expandPower(node)
+   *
+   * @param  {Node} node         Current expression node
+   * @param  {node} parent       Parent current node inside the recursion
+   * @param  (int}               Parent number of chid inside the rercursion
+   *
+   * @return {node}        node expression with all powers expanded.
+   */
+  function expandPower(node, parent, indParent) {
+    const tp = node.type;
+    const internal = arguments.length > 1; // TRUE in internal calls
+
+    if (tp === 'OperatorNode' && node.isBinary()) {
+      let does = false;
+      let val;
+      if (node.op === '^') {
+        // First operator: Parenthesis or UnaryMinus
+        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {
+          // Second operator: Constant
+          val = parseFloat(node.args[1].value);
+          does = val >= 2 && (0, _number.isInteger)(val);
+        }
+      }
+      if (does) {
+        // Exponent >= 2
+        // Before:
+        //            operator A --> Subtree
+        // parent pow
+        //            constant
+        //
+        if (val > 2) {
+          // Exponent > 2,
+          // AFTER:  (exponent > 2)
+          //             operator A --> Subtree
+          // parent  *
+          //                 deep clone (operator A --> Subtree
+          //             pow
+          //                 constant - 1
+          //
+          const nEsqTopo = node.args[0];
+          const nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);
+          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);
+        } else {
+          // Expo = 2 - no power
+          // AFTER:  (exponent =  2)
+          //             operator A --> Subtree
+          // parent   oper
+          //            deep clone (operator A --> Subtree)
+          //
+          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);
+        }
+        if (internal) {
+          // Change parent references in internal recursive calls
+          if (indParent === 'content') {
+            parent.content = node;
+          } else {
+            parent.args[indParent] = node;
+          }
+        }
+      } // does
+    } // binary OperatorNode
+
+    if (tp === 'ParenthesisNode') {
+      // Recursion
+      expandPower(node.content, node, 'content');
+    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {
+      for (let i = 0; i < node.args.length; i++) {
+        expandPower(node.args[i], node, i);
+      }
+    }
+    if (!internal) {
+      // return the root node
+      return node;
+    }
+  } // End expandPower
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   * Auxilary function for rationalize
+   * Convert near canonical polynomial in one variable in a canonical polynomial
+   * with one term for each exponent in decreasing order
+   *
+   * Syntax:
+   *
+   *     polyToCanonical(node [, coefficients])
+   *
+   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression
+   *
+   *        The string or tree expression needs to be at below syntax, with free spaces:
+   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+
+   *       Where 'var' is one variable with any valid name
+   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1
+   *             'expo' are integers greater than 0. It can be omitted if equal than 1.
+   *
+   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent
+   *
+   *
+   * @return {node}        new node tree with one variable polynomial or string error.
+   */
+  function polyToCanonical(node, coefficients) {
+    if (coefficients === undefined) {
+      coefficients = [];
+    } // coefficients.
+
+    coefficients[0] = 0; // index is the exponent
+    const o = {};
+    o.cte = 1;
+    o.oper = '+';
+
+    // fire: mark with * or ^ when finds * or ^ down tree, reset to "" with + and -.
+    //       It is used to deduce the exponent: 1 for *, 0 for "".
+    o.fire = '';
+    let maxExpo = 0; // maximum exponent
+    let varname = ''; // variable name
+
+    recurPol(node, null, o);
+    maxExpo = coefficients.length - 1;
+    let first = true;
+    let no;
+    for (let i = maxExpo; i >= 0; i--) {
+      if (coefficients[i] === 0) continue;
+      let n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));
+      const op = coefficients[i] < 0 ? '-' : '+';
+      if (i > 0) {
+        // Is not a constant without variable
+        let n2 = new SymbolNode(varname);
+        if (i > 1) {
+          const n3 = new ConstantNode(i);
+          n2 = new OperatorNode('^', 'pow', [n2, n3]);
+        }
+        if (coefficients[i] === -1 && first) {
+          n1 = new OperatorNode('-', 'unaryMinus', [n2]);
+        } else if (Math.abs(coefficients[i]) === 1) {
+          n1 = n2;
+        } else {
+          n1 = new OperatorNode('*', 'multiply', [n1, n2]);
+        }
+      }
+      if (first) {
+        no = n1;
+      } else if (op === '+') {
+        no = new OperatorNode('+', 'add', [no, n1]);
+      } else {
+        no = new OperatorNode('-', 'subtract', [no, n1]);
+      }
+      first = false;
+    } // for
+
+    if (first) {
+      return new ConstantNode(0);
+    } else {
+      return no;
+    }
+
+    /**
+     * Recursive auxilary function inside polyToCanonical for
+     * converting expression in canonical form
+     *
+     * Syntax:
+     *
+     *     recurPol(node, noPai, obj)
+     *
+     * @param  {Node} node        The current subpolynomial expression
+     * @param  {Node | Null}  noPai   The current parent node
+     * @param  {object}    obj        Object with many internal flags
+     *
+     * @return {}                    No return. If error, throws an exception
+     */
+    function recurPol(node, noPai, o) {
+      const tp = node.type;
+      if (tp === 'FunctionNode') {
+        // ***** FunctionName *****
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        // ***** OperatorName *****
+        if (!'+-*^'.includes(node.op)) throw new Error('Operator ' + node.op + ' invalid');
+        if (noPai !== null) {
+          // -(unary),^  : children of *,+,-
+          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+
+          // -,+,* : children of +,-
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+
+          // -,+ : first child
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+        } // Has parent
+
+        // Firers: ^,*       Old:   ^,&,-(unary): firers
+        if (node.op === '^' || node.op === '*') {
+          o.fire = node.op;
+        }
+        for (let i = 0; i < node.args.length; i++) {
+          // +,-: reset fire
+          if (node.fn === 'unaryMinus') o.oper = '-';
+          if (node.op === '+' || node.fn === 'subtract') {
+            o.fire = '';
+            o.cte = 1; // default if there is no constant
+            o.oper = i === 0 ? '+' : node.op;
+          }
+          o.noFil = i; // number of son
+          recurPol(node.args[i], node, o);
+        } // for in children
+      } else if (tp === 'SymbolNode') {
+        // ***** SymbolName *****
+        if (node.name !== varname && varname !== '') {
+          throw new Error('There is more than one variable');
+        }
+        varname = node.name;
+        if (noPai === null) {
+          coefficients[1] = 1;
+          return;
+        }
+
+        // ^: Symbol is First child
+        if (noPai.op === '^' && o.noFil !== 0) {
+          throw new Error('In power the variable should be the first parameter');
+        }
+
+        // *: Symbol is Second child
+        if (noPai.op === '*' && o.noFil !== 1) {
+          throw new Error('In multiply the variable should be the second parameter');
+        }
+
+        // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)
+        if (o.fire === '' || o.fire === '*') {
+          if (maxExpo < 1) coefficients[1] = 0;
+          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(1, maxExpo);
+        }
+      } else if (tp === 'ConstantNode') {
+        const valor = parseFloat(node.value);
+        if (noPai === null) {
+          coefficients[0] = valor;
+          return;
+        }
+        if (noPai.op === '^') {
+          // cte: second  child of power
+          if (o.noFil !== 1) throw new Error('Constant cannot be powered');
+          if (!(0, _number.isInteger)(valor) || valor <= 0) {
+            throw new Error('Non-integer exponent is not allowed');
+          }
+          for (let i = maxExpo + 1; i < valor; i++) coefficients[i] = 0;
+          if (valor > maxExpo) coefficients[valor] = 0;
+          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(valor, maxExpo);
+          return;
+        }
+        o.cte = valor;
+
+        // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.
+        if (o.fire === '') {
+          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);
+        }
+      } else {
+        throw new Error('Type ' + tp + ' is not allowed');
+      }
+    } // End of recurPol
+  } // End of polyToCanonical
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/resolve.js b/node_modules/mathjs/lib/cjs/function/algebra/resolve.js
new file mode 100644
index 0000000..9fcbfac
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/resolve.js
@@ -0,0 +1,103 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResolve = void 0;
+var _map = require("../../utils/map.js");
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'resolve';
+const dependencies = ['typed', 'parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];
+const createResolve = exports.createResolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    parse,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode
+  } = _ref;
+  /**
+   * resolve(expr, scope) replaces variable nodes with their scoped values
+   *
+   * Syntax:
+   *
+   *     math.resolve(expr, scope)
+   *
+   * Examples:
+   *
+   *     math.resolve('x + y', {x:1, y:2})           // Node '1 + 2'
+   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node '1 + 2'
+   *     math.simplify('x+y', {x:2, y: math.parse('x+x')}).toString() // "6"
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node | Node[]} node
+   *     The expression tree (or trees) to be simplified
+   * @param {Object} scope
+   *     Scope specifying variables to be resolved
+   * @return {Node | Node[]} Returns `node` with variables recursively substituted.
+   * @throws {ReferenceError}
+   *     If there is a cyclic dependency among the variables in `scope`,
+   *     resolution is impossible and a ReferenceError is thrown.
+   */
+  function _resolve(node, scope) {
+    let within = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Set();
+    // note `within`:
+    // `within` is not documented, since it is for internal cycle
+    // detection only
+    if (!scope) {
+      return node;
+    }
+    if ((0, _is.isSymbolNode)(node)) {
+      if (within.has(node.name)) {
+        const variables = Array.from(within).join(', ');
+        throw new ReferenceError(`recursive loop of variable definitions among {${variables}}`);
+      }
+      const value = scope.get(node.name);
+      if ((0, _is.isNode)(value)) {
+        const nextWithin = new Set(within);
+        nextWithin.add(node.name);
+        return _resolve(value, scope, nextWithin);
+      } else if (typeof value === 'number') {
+        return parse(String(value));
+      } else if (value !== undefined) {
+        return new ConstantNode(value);
+      } else {
+        return node;
+      }
+    } else if ((0, _is.isOperatorNode)(node)) {
+      const args = node.args.map(function (arg) {
+        return _resolve(arg, scope, within);
+      });
+      return new OperatorNode(node.op, node.fn, args, node.implicit);
+    } else if ((0, _is.isParenthesisNode)(node)) {
+      return new ParenthesisNode(_resolve(node.content, scope, within));
+    } else if ((0, _is.isFunctionNode)(node)) {
+      const args = node.args.map(function (arg) {
+        return _resolve(arg, scope, within);
+      });
+      return new FunctionNode(node.name, args);
+    }
+
+    // Otherwise just recursively resolve any children (might also work
+    // for some of the above special cases)
+    return node.map(child => _resolve(child, scope, within));
+  }
+  return typed('resolve', {
+    Node: _resolve,
+    'Node, Map | null | undefined': _resolve,
+    'Node, Object': (n, scope) => _resolve(n, (0, _map.createMap)(scope)),
+    // For arrays and matrices, we map `self` rather than `_resolve`
+    // because resolve is fairly expensive anyway, and this way
+    // we get nice error messages if one entry in the array has wrong type.
+    'Array | Matrix': typed.referToSelf(self => A => A.map(n => self(n))),
+    'Array | Matrix, null | undefined': typed.referToSelf(self => A => A.map(n => self(n))),
+    'Array, Object': typed.referTo('Array,Map', selfAM => (A, scope) => selfAM(A, (0, _map.createMap)(scope))),
+    'Matrix, Object': typed.referTo('Matrix,Map', selfMM => (A, scope) => selfMM(A, (0, _map.createMap)(scope))),
+    'Array | Matrix, Map': typed.referToSelf(self => (A, scope) => A.map(n => self(n, scope)))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify.js
new file mode 100644
index 0000000..2a0e412
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify.js
@@ -0,0 +1,1252 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplify = void 0;
+var _is = require("../../utils/is.js");
+var _wildcards = require("./simplify/wildcards.js");
+var _factory = require("../../utils/factory.js");
+var _util = require("./simplify/util.js");
+var _object = require("../../utils/object.js");
+var _map = require("../../utils/map.js");
+const name = 'simplify';
+const dependencies = ['typed', 'parse', 'equal', 'resolve', 'simplifyConstant', 'simplifyCore', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode', 'replacer'];
+const createSimplify = exports.createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    parse,
+    equal,
+    resolve,
+    simplifyConstant,
+    simplifyCore,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode,
+    replacer
+  } = _ref;
+  const {
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    unflattenr,
+    unflattenl,
+    createMakeNodeFunction,
+    defaultContext,
+    realContext,
+    positiveContext
+  } = (0, _util.createUtil)({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+
+  /**
+   * Simplify an expression tree.
+   *
+   * A list of rules are applied to an expression, repeating over the list until
+   * no further changes are made.
+   * It's possible to pass a custom set of rules to the function as second
+   * argument. A rule can be specified as an object, string, or function:
+   *
+   *     const rules = [
+   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
+   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',
+   *       function (node) {
+   *         // ... return a new node or return the node unchanged
+   *         return node
+   *       }
+   *     ]
+   *
+   * String and object rules consist of a left and right pattern. The left is
+   * used to match against the expression and the right determines what matches
+   * are replaced with. The main difference between a pattern and a normal
+   * expression is that variables starting with the following characters are
+   * interpreted as wildcards:
+   *
+   * - 'n' - Matches any node [Node]
+   * - 'c' - Matches a constant literal (5 or 3.2) [ConstantNode]
+   * - 'cl' - Matches a constant literal; same as c [ConstantNode]
+   * - 'cd' - Matches a decimal literal (5 or -3.2) [ConstantNode or unaryMinus wrapping a ConstantNode]
+   * - 'ce' - Matches a constant expression (-5 or √3) [Expressions consisting of only ConstantNodes, functions, and operators]
+   * - 'v' - Matches a variable; anything not matched by c (-5 or x) [Node that is not a ConstantNode]
+   * - 'vl' - Matches a variable literal (x or y) [SymbolNode]
+   * - 'vd' - Matches a non-decimal expression; anything not matched by cd (x or √3) [Node that is not a ConstantNode or unaryMinus that is wrapping a ConstantNode]
+   * - 've' - Matches a variable expression; anything not matched by ce (x or 2x) [Expressions that contain a SymbolNode or other non-constant term]
+   *
+   * The default list of rules is exposed on the function as `simplify.rules`
+   * and can be used as a basis to built a set of custom rules. Note that since
+   * the `simplifyCore` function is in the default list of rules, by default
+   * simplify will convert any function calls in the expression that have
+   * operator equivalents to their operator forms.
+   *
+   * To specify a rule as a string, separate the left and right pattern by '->'
+   * When specifying a rule as an object, the following keys are meaningful:
+   * - l - the left pattern
+   * - r - the right pattern
+   * - s - in lieu of l and r, the string form that is broken at -> to give them
+   * - repeat - whether to repeat this rule until the expression stabilizes
+   * - assuming - gives a context object, as in the 'context' option to
+   *     simplify. Every property in the context object must match the current
+   *     context in order, or else the rule will not be applied.
+   * - imposeContext - gives a context object, as in the 'context' option to
+   *     simplify. Any settings specified will override the incoming context
+   *     for all matches of this rule.
+   *
+   * For more details on the theory, see:
+   *
+   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+   *
+   *  An optional `options` argument can be passed as last argument of `simplify`.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+   *    and any changes to it, along with the rule responsible, to console
+   *  - `context` (simplify.defaultContext): an object giving properties of
+   *    each operator, which determine what simplifications are allowed. The
+   *    currently meaningful properties are commutative, associative,
+   *    total (whether the operation is defined for all arguments), and
+   *    trivial (whether the operation applied to a single argument leaves
+   *    that argument unchanged). The default context is very permissive and
+   *    allows almost all simplifications. Only properties differing from
+   *    the default need to be specified; the default context is used as a
+   *    fallback. Additional contexts `simplify.realContext` and
+   *    `simplify.positiveContext` are supplied to cause simplify to perform
+   *    just simplifications guaranteed to preserve all values of the expression
+   *    assuming all variables and subexpressions are real numbers or
+   *    positive real numbers, respectively. (Note that these are in some cases
+   *    more restrictive than the default context; for example, the default
+   *    context will allow `x/x` to simplify to 1, whereas
+   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)
+   *  - `exactFractions` (true): whether to try to convert all constants to
+   *    exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   *    be expressed as fractions only when both numerator and denominator
+   *    are smaller than `fractionsLimit`.
+   *
+   * Syntax:
+   *
+   *     math.simplify(expr)
+   *     math.simplify(expr, rules)
+   *     math.simplify(expr, rules)
+   *     math.simplify(expr, rules, scope)
+   *     math.simplify(expr, rules, scope, options)
+   *     math.simplify(expr, scope)
+   *     math.simplify(expr, scope, options)
+   *
+   * Examples:
+   *
+   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node "2 * x"
+   *     math.simplify('2 * 3 * x', {x: 4})        // Node "24"
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simplify(f)                          // Node "2 * x"
+   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node "x * 2 / 5"
+   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
+   *
+   * See also:
+   *
+   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve
+   *
+   * @param {Node | string} expr
+   *            The expression to be simplified
+   * @param {SimplifyRule[]} [rules]
+   *            Optional list with custom rules
+   * @param {Object} [scope] Optional scope with variables
+   * @param {SimplifyOptions} [options] Optional configuration settings
+   * @return {Node} Returns the simplified form of `expr`
+   */
+  typed.addConversion({
+    from: 'Object',
+    to: 'Map',
+    convert: _map.createMap
+  });
+  const simplify = typed('simplify', {
+    Node: _simplify,
+    'Node, Map': (expr, scope) => _simplify(expr, false, scope),
+    'Node, Map, Object': (expr, scope, options) => _simplify(expr, false, scope, options),
+    'Node, Array': _simplify,
+    'Node, Array, Map': _simplify,
+    'Node, Array, Map, Object': _simplify
+  });
+  typed.removeConversion({
+    from: 'Object',
+    to: 'Map',
+    convert: _map.createMap
+  });
+  simplify.defaultContext = defaultContext;
+  simplify.realContext = realContext;
+  simplify.positiveContext = positiveContext;
+  function removeParens(node) {
+    return node.transform(function (node) {
+      return (0, _is.isParenthesisNode)(node) ? removeParens(node.content) : node;
+    });
+  }
+
+  // All constants that are allowed in rules
+  const SUPPORTED_CONSTANTS = {
+    true: true,
+    false: true,
+    e: true,
+    i: true,
+    Infinity: true,
+    LN2: true,
+    LN10: true,
+    LOG2E: true,
+    LOG10E: true,
+    NaN: true,
+    phi: true,
+    pi: true,
+    SQRT1_2: true,
+    SQRT2: true,
+    tau: true
+    // null: false,
+    // undefined: false,
+    // version: false,
+  };
+
+  // Array of strings, used to build the ruleSet.
+  // Each l (left side) and r (right side) are parsed by
+  // the expression parser into a node tree.
+  // Left hand sides are matched to subtrees within the
+  // expression to be parsed and replaced with the right
+  // hand side.
+  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])
+  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.
+  // It is possible to get into an infinite loop with conflicting rules
+  simplify.rules = [simplifyCore,
+  // { l: 'n+0', r: 'n' },     // simplifyCore
+  // { l: 'n^0', r: '1' },     // simplifyCore
+  // { l: '0*n', r: '0' },     // simplifyCore
+  // { l: 'n/n', r: '1'},      // simplifyCore
+  // { l: 'n^1', r: 'n' },     // simplifyCore
+  // { l: '+n1', r:'n1' },     // simplifyCore
+  // { l: 'n--n1', r:'n+n1' }, // simplifyCore
+  {
+    l: 'log(e)',
+    r: '1'
+  },
+  // temporary rules
+  // Note initially we tend constants to the right because like-term
+  // collection prefers the left, and we would rather collect nonconstants
+  {
+    s: 'n-n1 -> n+-n1',
+    // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n-n -> 0',
+    // partial alternative when we can't always subtract
+    assuming: {
+      subtract: {
+        total: false
+      }
+    }
+  }, {
+    s: '-(cl*v) -> v * (-cl)',
+    // make non-constant terms positive
+    assuming: {
+      multiply: {
+        commutative: true
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(cl*v) -> (-cl) * v',
+    // non-commutative version, part 1
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(v*cl) -> v * (-cl)',
+    // non-commutative version, part 2
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    l: '-(n1/n2)',
+    r: '-n1/n2'
+  }, {
+    l: '-v',
+    r: 'v * (-1)'
+  },
+  // finish making non-constant terms positive
+  {
+    l: '(n1 + n2)*(-1)',
+    r: 'n1*(-1) + n2*(-1)',
+    repeat: true
+  },
+  // expand negations to achieve as much sign cancellation as possible
+  {
+    l: 'n/n1^n2',
+    r: 'n*n1^-n2'
+  },
+  // temporarily replace 'divide' so we can further flatten the 'multiply' operator
+  {
+    l: 'n/n1',
+    r: 'n*n1^-1'
+  }, {
+    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // expand nested exponentiation
+  {
+    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // 1/(1/n) = n needs 1/n to exist
+  },
+  // collect like factors; into a sum, only do this for nonconstants
+  {
+    l: ' vd   * ( vd   * n1 + n2)',
+    r: 'vd^2       * n1 +  vd   * n2'
+  }, {
+    s: ' vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // v*1/v = v^(1+-1) needs 1/v
+  }, {
+    s: 'vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    s: 'vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    l: 'n*n',
+    r: 'n^2'
+  }, {
+    s: 'n * n^n1 -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // n*1/n = n^(-1+1) needs 1/n
+  }, {
+    s: 'n^n1 * n^n2 -> n^(n1+n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // ditto for n^2*1/n^2
+  },
+  // Unfortunately, to deal with more complicated cancellations, it
+  // becomes necessary to simplify constants twice per pass. It's not
+  // terribly expensive compared to matching rules, so this should not
+  // pose a performance problem.
+  simplifyConstant,
+  // First: before collecting like terms
+
+  // collect like terms
+  {
+    s: 'n+n -> 2*n',
+    assuming: {
+      add: {
+        total: true
+      }
+    } // 2 = 1 + 1 needs to exist
+  }, {
+    l: 'n+-n',
+    r: '0'
+  }, {
+    l: 'vd*n + vd',
+    r: 'vd*(n+1)'
+  },
+  // NOTE: leftmost position is special:
+  {
+    l: 'n3*n1 + n3*n2',
+    r: 'n3*(n1+n2)'
+  },
+  // All sub-monomials tried there.
+  {
+    l: 'n3^(-n4)*n1 +   n3  * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'
+  }, {
+    l: 'n3^(-n4)*n1 + n3^n5 * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  },
+  // noncommutative additional cases (term collection & factoring)
+  {
+    s: 'n*vd + vd -> (n+1)*vd',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'vd + n*vd -> (1+n)*vd',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n^n1 * n -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    l: 'n*cd + cd',
+    r: '(n+1)*cd'
+  }, {
+    s: 'cd*n + cd -> cd*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'cd + cd*n -> cd*(1+n)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, simplifyConstant,
+  // Second: before returning expressions to "standard form"
+
+  // make factors positive (and undo 'make non-constant terms positive')
+  {
+    s: '(-n)*n1 -> -(n*n1)',
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n1*(-n) -> -(n1*n)',
+    // in case * non-commutative
+    assuming: {
+      subtract: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // final ordering of constants
+  {
+    s: 'ce+ve -> ve+ce',
+    assuming: {
+      add: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      add: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'vd*cd -> cd*vd',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // undo temporary rules
+  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant
+  {
+    l: 'n+-n1',
+    r: 'n-n1'
+  },
+  // undo replace 'subtract'
+  {
+    l: 'n+-(n1)',
+    r: 'n-(n1)'
+  }, {
+    s: 'n*(n1^-1) -> n/n1',
+    // undo replace 'divide'; for * commutative
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    s: 'n*n1^-n2 -> n/n1^n2',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    s: 'n^-1 -> 1/n',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    l: 'n^1',
+    r: 'n'
+  },
+  // can be produced by power cancellation
+  {
+    s: 'n*(n1/n2) -> (n*n1)/n2',
+    // '*' before '/'
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    s: 'n-(n1+n2) -> n-n1-n2',
+    // '-' before '+'
+    assuming: {
+      addition: {
+        associative: true,
+        commutative: true
+      }
+    }
+  },
+  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
+  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
+
+  // simplifyConstant can leave an extra factor of 1, which can always
+  // be eliminated, since the identity always commutes
+  {
+    l: '1*n',
+    r: 'n',
+    imposeContext: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: 'n1/(n2/n3) -> (n1*n3)/n2',
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    l: 'n1/(-n2)',
+    r: '-n1/n2'
+  }];
+
+  /**
+   * Takes any rule object as allowed by the specification in simplify
+   * and puts it in a standard form used by applyRule
+   */
+  function _canonicalizeRule(ruleObject, context) {
+    const newRule = {};
+    if (ruleObject.s) {
+      const lr = ruleObject.s.split('->');
+      if (lr.length === 2) {
+        newRule.l = lr[0];
+        newRule.r = lr[1];
+      } else {
+        throw SyntaxError('Could not parse rule: ' + ruleObject.s);
+      }
+    } else {
+      newRule.l = ruleObject.l;
+      newRule.r = ruleObject.r;
+    }
+    newRule.l = removeParens(parse(newRule.l));
+    newRule.r = removeParens(parse(newRule.r));
+    for (const prop of ['imposeContext', 'repeat', 'assuming']) {
+      if (prop in ruleObject) {
+        newRule[prop] = ruleObject[prop];
+      }
+    }
+    if (ruleObject.evaluate) {
+      newRule.evaluate = parse(ruleObject.evaluate);
+    }
+    if (isAssociative(newRule.l, context)) {
+      const nonCommutative = !isCommutative(newRule.l, context);
+      let leftExpandsym;
+      // Gen. the LHS placeholder used in this NC-context specific expansion rules
+      if (nonCommutative) leftExpandsym = _getExpandPlaceholderSymbol();
+      const makeNode = createMakeNodeFunction(newRule.l);
+      const expandsym = _getExpandPlaceholderSymbol();
+      newRule.expanded = {};
+      newRule.expanded.l = makeNode([newRule.l, expandsym]);
+      // Push the expandsym into the deepest possible branch.
+      // This helps to match the newRule against nodes returned from getSplits() later on.
+      flatten(newRule.expanded.l, context);
+      unflattenr(newRule.expanded.l, context);
+      newRule.expanded.r = makeNode([newRule.r, expandsym]);
+
+      // In and for a non-commutative context, attempting with yet additional expansion rules makes
+      // way for more matches cases of multi-arg expressions; such that associative rules (such as
+      // 'n*n -> n^2') can be applied to exprs. such as 'a * b * b' and 'a * b * b * a'.
+      if (nonCommutative) {
+        // 'Non-commutative' 1: LHS (placeholder) only
+        newRule.expandedNC1 = {};
+        newRule.expandedNC1.l = makeNode([leftExpandsym, newRule.l]);
+        newRule.expandedNC1.r = makeNode([leftExpandsym, newRule.r]);
+        // 'Non-commutative' 2: farmost LHS and RHS placeholders
+        newRule.expandedNC2 = {};
+        newRule.expandedNC2.l = makeNode([leftExpandsym, newRule.expanded.l]);
+        newRule.expandedNC2.r = makeNode([leftExpandsym, newRule.expanded.r]);
+      }
+    }
+    return newRule;
+  }
+
+  /**
+   * Parse the string array of rules into nodes
+   *
+   * Example syntax for rules:
+   *
+   * Position constants to the left in a product:
+   * { l: 'n1 * c1', r: 'c1 * n1' }
+   * n1 is any Node, and c1 is a ConstantNode.
+   *
+   * Apply difference of squares formula:
+   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }
+   * n1, n2 mean any Node.
+   *
+   * Short hand notation:
+   * 'n1 * c1 -> c1 * n1'
+   */
+  function _buildRules(rules, context) {
+    // Array of rules to be used to simplify expressions
+    const ruleSet = [];
+    for (let i = 0; i < rules.length; i++) {
+      let rule = rules[i];
+      let newRule;
+      const ruleType = typeof rule;
+      switch (ruleType) {
+        case 'string':
+          rule = {
+            s: rule
+          };
+        /* falls through */
+        case 'object':
+          newRule = _canonicalizeRule(rule, context);
+          break;
+        case 'function':
+          newRule = rule;
+          break;
+        default:
+          throw TypeError('Unsupported type of rule: ' + ruleType);
+      }
+      // console.log('Adding rule: ' + rules[i])
+      // console.log(newRule)
+      ruleSet.push(newRule);
+    }
+    return ruleSet;
+  }
+  let _lastsym = 0;
+  function _getExpandPlaceholderSymbol() {
+    return new SymbolNode('_p' + _lastsym++);
+  }
+  function _simplify(expr, rules) {
+    let scope = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : (0, _map.createEmptyMap)();
+    let options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+    const debug = options.consoleDebug;
+    rules = _buildRules(rules || simplify.rules, options.context);
+    let res = resolve(expr, scope);
+    res = removeParens(res);
+    const visited = {};
+    let str = res.toString({
+      parenthesis: 'all'
+    });
+    while (!visited[str]) {
+      visited[str] = true;
+      _lastsym = 0; // counter for placeholder symbols
+      let laststr = str;
+      if (debug) console.log('Working on: ', str);
+      for (let i = 0; i < rules.length; i++) {
+        let rulestr = '';
+        if (typeof rules[i] === 'function') {
+          res = rules[i](res, options);
+          if (debug) rulestr = rules[i].name;
+        } else {
+          flatten(res, options.context);
+          res = applyRule(res, rules[i], options.context);
+          if (debug) {
+            rulestr = `${rules[i].l.toString()} -> ${rules[i].r.toString()}`;
+          }
+        }
+        if (debug) {
+          const newstr = res.toString({
+            parenthesis: 'all'
+          });
+          if (newstr !== laststr) {
+            console.log('Applying', rulestr, 'produced', newstr);
+            laststr = newstr;
+          }
+        }
+        /* Use left-heavy binary tree internally,
+         * since custom rule functions may expect it
+         */
+        unflattenl(res, options.context);
+      }
+      str = res.toString({
+        parenthesis: 'all'
+      });
+    }
+    return res;
+  }
+  function mapRule(nodes, rule, context) {
+    let resNodes = nodes;
+    if (nodes) {
+      for (let i = 0; i < nodes.length; ++i) {
+        const newNode = applyRule(nodes[i], rule, context);
+        if (newNode !== nodes[i]) {
+          if (resNodes === nodes) {
+            resNodes = nodes.slice();
+          }
+          resNodes[i] = newNode;
+        }
+      }
+    }
+    return resNodes;
+  }
+
+  /**
+   * Returns a simplfied form of node, or the original node if no simplification was possible.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object | Function} rule
+   * @param  {Object} context -- information about assumed properties of operators
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
+   */
+  function applyRule(node, rule, context) {
+    //    console.log('Entering applyRule("', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '",', node.toString({parenthesis:'all'}),')')
+
+    // check that the assumptions for this rule are satisfied by the current
+    // context:
+    if (rule.assuming) {
+      for (const symbol in rule.assuming) {
+        for (const property in rule.assuming[symbol]) {
+          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {
+            return node;
+          }
+        }
+      }
+    }
+    const mergedContext = mergeContext(rule.imposeContext, context);
+
+    // Do not clone node unless we find a match
+    let res = node;
+
+    // First replace our child nodes with their simplified versions
+    // If a child could not be simplified, applying the rule to it
+    // will have no effect since the node is returned unchanged
+    if (res instanceof OperatorNode || res instanceof FunctionNode) {
+      const newArgs = mapRule(res.args, rule, context);
+      if (newArgs !== res.args) {
+        res = res.clone();
+        res.args = newArgs;
+      }
+    } else if (res instanceof ParenthesisNode) {
+      if (res.content) {
+        const newContent = applyRule(res.content, rule, context);
+        if (newContent !== res.content) {
+          res = new ParenthesisNode(newContent);
+        }
+      }
+    } else if (res instanceof ArrayNode) {
+      const newItems = mapRule(res.items, rule, context);
+      if (newItems !== res.items) {
+        res = new ArrayNode(newItems);
+      }
+    } else if (res instanceof AccessorNode) {
+      let newObj = res.object;
+      if (res.object) {
+        newObj = applyRule(res.object, rule, context);
+      }
+      let newIndex = res.index;
+      if (res.index) {
+        newIndex = applyRule(res.index, rule, context);
+      }
+      if (newObj !== res.object || newIndex !== res.index) {
+        res = new AccessorNode(newObj, newIndex);
+      }
+    } else if (res instanceof IndexNode) {
+      const newDims = mapRule(res.dimensions, rule, context);
+      if (newDims !== res.dimensions) {
+        res = new IndexNode(newDims);
+      }
+    } else if (res instanceof ObjectNode) {
+      let changed = false;
+      const newProps = {};
+      for (const prop in res.properties) {
+        newProps[prop] = applyRule(res.properties[prop], rule, context);
+        if (newProps[prop] !== res.properties[prop]) {
+          changed = true;
+        }
+      }
+      if (changed) {
+        res = new ObjectNode(newProps);
+      }
+    }
+
+    // Try to match a rule against this node
+    let repl = rule.r;
+    let matches = _ruleMatch(rule.l, res, mergedContext)[0];
+
+    // If the rule is associative operator, we can try matching it while allowing additional terms.
+    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+    if (!matches && rule.expanded) {
+      repl = rule.expanded.r;
+      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
+    }
+    // Additional, non-commutative context expansion-rules
+    if (!matches && rule.expandedNC1) {
+      repl = rule.expandedNC1.r;
+      matches = _ruleMatch(rule.expandedNC1.l, res, mergedContext)[0];
+      if (!matches) {
+        // Existence of NC1 implies NC2
+        repl = rule.expandedNC2.r;
+        matches = _ruleMatch(rule.expandedNC2.l, res, mergedContext)[0];
+      }
+    }
+    if (matches) {
+      // const before = res.toString({parenthesis: 'all'})
+
+      // Create a new node by cloning the rhs of the matched rule
+      // we keep any implicit multiplication state if relevant
+      const implicit = res.implicit;
+      res = repl.clone();
+      if (implicit && 'implicit' in repl) {
+        res.implicit = true;
+      }
+
+      // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+      res = res.transform(function (node) {
+        if (node.isSymbolNode && (0, _object.hasOwnProperty)(matches.placeholders, node.name)) {
+          return matches.placeholders[node.name].clone();
+        } else {
+          return node;
+        }
+      });
+
+      // const after = res.toString({parenthesis: 'all'})
+      // console.log('Simplified ' + before + ' to ' + after)
+    }
+    if (rule.repeat && res !== node) {
+      res = applyRule(res, rule, context);
+    }
+    return res;
+  }
+
+  /**
+   * Get (binary) combinations of a flattened binary node
+   * e.g. +(node1, node2, node3) -> [
+   *        +(node1,  +(node2, node3)),
+   *        +(node2,  +(node1, node3)),
+   *        +(node3,  +(node1, node2))]
+   *
+   */
+  function getSplits(node, context) {
+    const res = [];
+    let right, rightArgs;
+    const makeNode = createMakeNodeFunction(node);
+    if (isCommutative(node, context)) {
+      for (let i = 0; i < node.args.length; i++) {
+        rightArgs = node.args.slice(0);
+        rightArgs.splice(i, 1);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([node.args[i], right]));
+      }
+    } else {
+      // Keep order, but try all parenthesizations
+      for (let i = 1; i < node.args.length; i++) {
+        let left = node.args[0];
+        if (i > 1) {
+          left = makeNode(node.args.slice(0, i));
+        }
+        rightArgs = node.args.slice(i);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([left, right]));
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Returns the set union of two match-placeholders or null if there is a conflict.
+   */
+  function mergeMatch(match1, match2) {
+    const res = {
+      placeholders: {}
+    };
+
+    // Some matches may not have placeholders; this is OK
+    if (!match1.placeholders && !match2.placeholders) {
+      return res;
+    } else if (!match1.placeholders) {
+      return match2;
+    } else if (!match2.placeholders) {
+      return match1;
+    }
+
+    // Placeholders with the same key must match exactly
+    for (const key in match1.placeholders) {
+      if ((0, _object.hasOwnProperty)(match1.placeholders, key)) {
+        res.placeholders[key] = match1.placeholders[key];
+        if ((0, _object.hasOwnProperty)(match2.placeholders, key)) {
+          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {
+            return null;
+          }
+        }
+      }
+    }
+    for (const key in match2.placeholders) {
+      if ((0, _object.hasOwnProperty)(match2.placeholders, key)) {
+        res.placeholders[key] = match2.placeholders[key];
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   */
+  function combineChildMatches(list1, list2) {
+    const res = [];
+    if (list1.length === 0 || list2.length === 0) {
+      return res;
+    }
+    let merged;
+    for (let i1 = 0; i1 < list1.length; i1++) {
+      for (let i2 = 0; i2 < list2.length; i2++) {
+        merged = mergeMatch(list1[i1], list2[i2]);
+        if (merged) {
+          res.push(merged);
+        }
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   * Returns a list of unique matches.
+   */
+  function mergeChildMatches(childMatches) {
+    if (childMatches.length === 0) {
+      return childMatches;
+    }
+    const sets = childMatches.reduce(combineChildMatches);
+    const uniqueSets = [];
+    const unique = {};
+    for (let i = 0; i < sets.length; i++) {
+      const s = JSON.stringify(sets[i], replacer);
+      if (!unique[s]) {
+        unique[s] = true;
+        uniqueSets.push(sets[i]);
+      }
+    }
+    return uniqueSets;
+  }
+
+  /**
+   * Determines whether node matches rule.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param {Object} context -- provides assumed properties of operators
+   * @param {Boolean} isSplit -- whether we are in process of splitting an
+   *                    n-ary operator node into possible binary combinations.
+   *                    Defaults to false.
+   * @return {Object} Information about the match, if it exists.
+   */
+  function _ruleMatch(rule, node, context, isSplit) {
+    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
+    //    console.log('rule = ' + rule)
+    //    console.log('node = ' + node)
+
+    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')
+    let res = [{
+      placeholders: {}
+    }];
+    if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {
+      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly
+      if (rule instanceof OperatorNode) {
+        if (rule.op !== node.op || rule.fn !== node.fn) {
+          return [];
+        }
+      } else if (rule instanceof FunctionNode) {
+        if (rule.name !== node.name) {
+          return [];
+        }
+      }
+
+      // rule and node match. Search the children of rule and node.
+      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {
+        // Expect non-associative operators to match exactly,
+        // except in any order if operator is commutative
+        let childMatches = [];
+        for (let i = 0; i < rule.args.length; i++) {
+          const childMatch = _ruleMatch(rule.args[i], node.args[i], context);
+          if (childMatch.length === 0) {
+            // Child did not match, so stop searching immediately
+            break;
+          }
+          // The child matched, so add the information returned from the child to our result
+          childMatches.push(childMatch);
+        }
+        if (childMatches.length !== rule.args.length) {
+          if (!isCommutative(node, context) ||
+          // exact match in order needed
+          rule.args.length === 1) {
+            // nothing to commute
+            return [];
+          }
+          if (rule.args.length > 2) {
+            /* Need to generate all permutations and try them.
+             * It's a bit complicated, and unlikely to come up since there
+             * are very few ternary or higher operators. So punt for now.
+             */
+            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');
+          }
+          /* Exactly two arguments, try them reversed */
+          const leftMatch = _ruleMatch(rule.args[0], node.args[1], context);
+          if (leftMatch.length === 0) {
+            return [];
+          }
+          const rightMatch = _ruleMatch(rule.args[1], node.args[0], context);
+          if (rightMatch.length === 0) {
+            return [];
+          }
+          childMatches = [leftMatch, rightMatch];
+        }
+        res = mergeChildMatches(childMatches);
+      } else if (node.args.length >= 2 && rule.args.length === 2) {
+        // node is flattened, rule is not
+        // Associative operators/functions can be split in different ways so we check if the rule
+        // matches for each of them and return their union.
+        const splits = getSplits(node, context);
+        let splitMatches = [];
+        for (let i = 0; i < splits.length; i++) {
+          const matchSet = _ruleMatch(rule, splits[i], context, true); // recursing at the same tree depth here
+          splitMatches = splitMatches.concat(matchSet);
+        }
+        return splitMatches;
+      } else if (rule.args.length > 2) {
+        throw Error('Unexpected non-binary associative function: ' + rule.toString());
+      } else {
+        // Incorrect number of arguments in rule and node, so no match
+        return [];
+      }
+    } else if (rule instanceof SymbolNode) {
+      // If the rule is a SymbolNode, then it carries a special meaning
+      // according to the first one or two characters of the symbol node name.
+      // These meanings are expalined in the documentation for simplify()
+      if (rule.name.length === 0) {
+        throw new Error('Symbol in rule has 0 length...!?');
+      }
+      if (SUPPORTED_CONSTANTS[rule.name]) {
+        // built-in constant must match exactly
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } else {
+        // wildcards are composed of up to two alphabetic or underscore characters
+        switch (rule.name[1] >= 'a' && rule.name[1] <= 'z' ? rule.name.substring(0, 2) : rule.name[0]) {
+          case 'n':
+          case '_p':
+            // rule matches _anything_, so assign this node to the rule.name placeholder
+            // Assign node to the rule.name placeholder.
+            // Our parent will check for matches among placeholders.
+            res[0].placeholders[rule.name] = node;
+            break;
+          case 'c':
+          case 'cl':
+            // rule matches a ConstantNode
+            if ((0, _wildcards.isConstantNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'v':
+            // rule matches anything other than a ConstantNode
+            if (!(0, _wildcards.isConstantNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vl':
+            // rule matches VariableNode
+            if ((0, _wildcards.isVariableNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'cd':
+            // rule matches a ConstantNode or unaryMinus-wrapped ConstantNode
+            if ((0, _wildcards.isNumericNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vd':
+            // rule matches anything other than a ConstantNode or unaryMinus-wrapped ConstantNode
+            if (!(0, _wildcards.isNumericNode)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'ce':
+            // rule matches expressions that have a constant value
+            if ((0, _wildcards.isConstantExpression)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 've':
+            // rule matches expressions that do not have a constant value
+            if (!(0, _wildcards.isConstantExpression)(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          default:
+            throw new Error('Invalid symbol in rule: ' + rule.name);
+        }
+      }
+    } else if (rule instanceof ConstantNode) {
+      // Literal constant must match exactly
+      if (!equal(rule.value, node.value)) {
+        return [];
+      }
+    } else {
+      // Some other node was encountered which we aren't prepared for, so no match
+      return [];
+    }
+
+    // It's a match!
+
+    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')
+    return res;
+  }
+
+  /**
+   * Determines whether p and q (and all their children nodes) are identical.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q
+   * @return {Object} Information about the match, if it exists.
+   */
+  function _exactMatch(p, q) {
+    if (p instanceof ConstantNode && q instanceof ConstantNode) {
+      if (!equal(p.value, q.value)) {
+        return false;
+      }
+    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {
+      if (p.name !== q.name) {
+        return false;
+      }
+    } else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {
+      if (p instanceof OperatorNode) {
+        if (p.op !== q.op || p.fn !== q.fn) {
+          return false;
+        }
+      } else if (p instanceof FunctionNode) {
+        if (p.name !== q.name) {
+          return false;
+        }
+      }
+      if (p.args.length !== q.args.length) {
+        return false;
+      }
+      for (let i = 0; i < p.args.length; i++) {
+        if (!_exactMatch(p.args[i], q.args[i])) {
+          return false;
+        }
+      }
+    } else {
+      return false;
+    }
+    return true;
+  }
+  return simplify;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js
new file mode 100644
index 0000000..9c445f4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify/util.js
@@ -0,0 +1,269 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUtil = void 0;
+var _is = require("../../../utils/is.js");
+var _factory = require("../../../utils/factory.js");
+var _object = require("../../../utils/object.js");
+const name = 'simplifyUtil';
+const dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];
+const createUtil = exports.createUtil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  // TODO commutative/associative properties rely on the arguments
+  // e.g. multiply is not commutative for matrices
+  // The properties should be calculated from an argument to simplify, or possibly something in math.config
+  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments
+
+  /* So that properties of an operator fit on one line: */
+  const T = true;
+  const F = false;
+  const defaultName = 'defaultF';
+  const defaultContext = {
+    /*      */add: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /**/unaryPlus: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /* */subtract: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+    /* */multiply: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /*   */divide: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+    /*    */paren: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: F
+    },
+    /* */defaultF: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    }
+  };
+  const realContext = {
+    divide: {
+      total: F
+    },
+    log: {
+      total: F
+    }
+  };
+  const positiveContext = {
+    subtract: {
+      total: F
+    },
+    abs: {
+      trivial: T
+    },
+    log: {
+      total: T
+    }
+  };
+  function hasProperty(nodeOrName, property) {
+    let context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultContext;
+    let name = defaultName;
+    if (typeof nodeOrName === 'string') {
+      name = nodeOrName;
+    } else if ((0, _is.isOperatorNode)(nodeOrName)) {
+      name = nodeOrName.fn.toString();
+    } else if ((0, _is.isFunctionNode)(nodeOrName)) {
+      name = nodeOrName.name;
+    } else if ((0, _is.isParenthesisNode)(nodeOrName)) {
+      name = 'paren';
+    }
+    if ((0, _object.hasOwnProperty)(context, name)) {
+      const properties = context[name];
+      if ((0, _object.hasOwnProperty)(properties, property)) {
+        return properties[property];
+      }
+      if ((0, _object.hasOwnProperty)(defaultContext, name)) {
+        return defaultContext[name][property];
+      }
+    }
+    if ((0, _object.hasOwnProperty)(context, defaultName)) {
+      const properties = context[defaultName];
+      if ((0, _object.hasOwnProperty)(properties, property)) {
+        return properties[property];
+      }
+      return defaultContext[defaultName][property];
+    }
+    /* name not found in context and context has no global default */
+    /* So use default context. */
+    if ((0, _object.hasOwnProperty)(defaultContext, name)) {
+      const properties = defaultContext[name];
+      if ((0, _object.hasOwnProperty)(properties, property)) {
+        return properties[property];
+      }
+    }
+    return defaultContext[defaultName][property];
+  }
+  function isCommutative(node) {
+    let context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'commutative', context);
+  }
+  function isAssociative(node) {
+    let context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'associative', context);
+  }
+
+  /**
+   * Merge the given contexts, with primary overriding secondary
+   * wherever they might conflict
+   */
+  function mergeContext(primary, secondary) {
+    const merged = {
+      ...primary
+    };
+    for (const prop in secondary) {
+      if ((0, _object.hasOwnProperty)(primary, prop)) {
+        merged[prop] = {
+          ...secondary[prop],
+          ...primary[prop]
+        };
+      } else {
+        merged[prop] = secondary[prop];
+      }
+    }
+    return merged;
+  }
+
+  /**
+   * Flatten all associative operators in an expression tree.
+   * Assumes parentheses have already been removed.
+   */
+  function flatten(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return node;
+    }
+    node.args = allChildren(node, context);
+    for (let i = 0; i < node.args.length; i++) {
+      flatten(node.args[i], context);
+    }
+  }
+
+  /**
+   * Get the children of a node as if it has been flattened.
+   * TODO implement for FunctionNodes
+   */
+  function allChildren(node, context) {
+    let op;
+    const children = [];
+    const findChildren = function (node) {
+      for (let i = 0; i < node.args.length; i++) {
+        const child = node.args[i];
+        if ((0, _is.isOperatorNode)(child) && op === child.op) {
+          findChildren(child);
+        } else {
+          children.push(child);
+        }
+      }
+    };
+    if (isAssociative(node, context)) {
+      op = node.op;
+      findChildren(node);
+      return children;
+    } else {
+      return node.args;
+    }
+  }
+
+  /**
+   *  Unflatten all flattened operators to a right-heavy binary tree.
+   */
+  function unflattenr(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+    const makeNode = createMakeNodeFunction(node);
+    const l = node.args.length;
+    for (let i = 0; i < l; i++) {
+      unflattenr(node.args[i], context);
+    }
+    if (l > 2 && isAssociative(node, context)) {
+      let curnode = node.args.pop();
+      while (node.args.length > 0) {
+        curnode = makeNode([node.args.pop(), curnode]);
+      }
+      node.args = curnode.args;
+    }
+  }
+
+  /**
+   *  Unflatten all flattened operators to a left-heavy binary tree.
+   */
+  function unflattenl(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+    const makeNode = createMakeNodeFunction(node);
+    const l = node.args.length;
+    for (let i = 0; i < l; i++) {
+      unflattenl(node.args[i], context);
+    }
+    if (l > 2 && isAssociative(node, context)) {
+      let curnode = node.args.shift();
+      while (node.args.length > 0) {
+        curnode = makeNode([curnode, node.args.shift()]);
+      }
+      node.args = curnode.args;
+    }
+  }
+  function createMakeNodeFunction(node) {
+    if ((0, _is.isOperatorNode)(node)) {
+      return function (args) {
+        try {
+          return new OperatorNode(node.op, node.fn, args, node.implicit);
+        } catch (err) {
+          console.error(err);
+          return [];
+        }
+      };
+    } else {
+      return function (args) {
+        return new FunctionNode(new SymbolNode(node.name), args);
+      };
+    }
+  }
+  return {
+    createMakeNodeFunction,
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    allChildren,
+    unflattenr,
+    unflattenl,
+    defaultContext,
+    realContext,
+    positiveContext
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplify/wildcards.js b/node_modules/mathjs/lib/cjs/function/algebra/simplify/wildcards.js
new file mode 100644
index 0000000..b18a248
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplify/wildcards.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isConstantExpression = isConstantExpression;
+Object.defineProperty(exports, "isConstantNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isConstantNode;
+  }
+});
+exports.isNumericNode = isNumericNode;
+Object.defineProperty(exports, "isVariableNode", {
+  enumerable: true,
+  get: function () {
+    return _is.isSymbolNode;
+  }
+});
+var _is = require("../../../utils/is.js");
+function isNumericNode(x) {
+  return (0, _is.isConstantNode)(x) || (0, _is.isOperatorNode)(x) && x.isUnary() && (0, _is.isConstantNode)(x.args[0]);
+}
+function isConstantExpression(x) {
+  if ((0, _is.isConstantNode)(x)) {
+    // Basic Constant types
+    return true;
+  }
+  if (((0, _is.isFunctionNode)(x) || (0, _is.isOperatorNode)(x)) && x.args.every(isConstantExpression)) {
+    // Can be constant depending on arguments
+    return true;
+  }
+  if ((0, _is.isParenthesisNode)(x) && isConstantExpression(x.content)) {
+    // Parenthesis are transparent
+    return true;
+  }
+  return false; // Probably missing some edge cases
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplifyConstant.js b/node_modules/mathjs/lib/cjs/function/algebra/simplifyConstant.js
new file mode 100644
index 0000000..2749034
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplifyConstant.js
@@ -0,0 +1,472 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplifyConstant = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _util = require("./simplify/util.js");
+var _noop = require("../../utils/noop.js");
+const name = 'simplifyConstant';
+const dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];
+const createSimplifyConstant = exports.createSimplifyConstant = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    mathWithTransform,
+    matrix,
+    fraction,
+    bignumber,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  const {
+    isCommutative,
+    isAssociative,
+    allChildren,
+    createMakeNodeFunction
+  } = (0, _util.createUtil)({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+
+  /**
+   * simplifyConstant() takes a mathjs expression (either a Node representing
+   * a parse tree or a string which it parses to produce a node), and replaces
+   * any subexpression of it consisting entirely of constants with the computed
+   * value of that subexpression.
+   *
+   * Syntax:
+   *
+   *     math.simplifyConstant(expr)
+   *     math.simplifyConstant(expr, options)
+   *
+   * Examples:
+   *
+   *     math.simplifyConstant('x + 4*3/6')  // Node "x + 2"
+   *     math.simplifyConstant('z cos(0)')   // Node "z 1"
+   *     math.simplifyConstant('(5.2 + 1.08)t', {exactFractions: false})  // Node "6.28 t"
+   *
+   * See also:
+   *
+   *     simplify, simplifyCore, resolve, derivative
+   *
+   * @param {Node | string} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with constant subexpressions evaluated
+   */
+  const simplifyConstant = typed('simplifyConstant', {
+    Node: node => _ensureNode(foldFraction(node, {})),
+    'Node, Object': function (expr, options) {
+      return _ensureNode(foldFraction(expr, options));
+    }
+  });
+  function _removeFractions(thing) {
+    if ((0, _is.isFraction)(thing)) {
+      return thing.valueOf();
+    }
+    if (thing instanceof Array) {
+      return thing.map(_removeFractions);
+    }
+    if ((0, _is.isMatrix)(thing)) {
+      return matrix(_removeFractions(thing.valueOf()));
+    }
+    return thing;
+  }
+  function _eval(fnname, args, options) {
+    try {
+      return mathWithTransform[fnname].apply(null, args);
+    } catch (ignore) {
+      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions
+      args = args.map(_removeFractions);
+      return _toNumber(mathWithTransform[fnname].apply(null, args), options);
+    }
+  }
+  const _toNode = typed({
+    Fraction: _fractionToNode,
+    number: function (n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n);
+    },
+    BigNumber: function (n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n); // old parameters: (n.toString(), 'number')
+    },
+    bigint: function (n) {
+      if (n < 0n) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n);
+    },
+    Complex: function (s) {
+      throw new Error('Cannot convert Complex number to Node');
+    },
+    string: function (s) {
+      return new ConstantNode(s);
+    },
+    Matrix: function (m) {
+      return new ArrayNode(m.valueOf().map(e => _toNode(e)));
+    }
+  });
+  function _ensureNode(thing) {
+    if ((0, _is.isNode)(thing)) {
+      return thing;
+    }
+    return _toNode(thing);
+  }
+
+  // convert a number to a fraction only if it can be expressed exactly,
+  // and when both numerator and denominator are small enough
+  function _exactFraction(n, options) {
+    const exactFractions = options && options.exactFractions !== false;
+    if (exactFractions && isFinite(n) && fraction) {
+      const f = fraction(n);
+      const fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default
+
+      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {
+        return f;
+      }
+    }
+    return n;
+  }
+
+  // Convert numbers to a preferred number type in preference order: Fraction, number, Complex
+  // BigNumbers are left alone
+  const _toNumber = typed({
+    'string, Object': function (s, options) {
+      const numericType = (0, _number.safeNumberType)(s, config);
+      if (numericType === 'BigNumber') {
+        if (bignumber === undefined) {
+          (0, _noop.noBignumber)();
+        }
+        return bignumber(s);
+      } else if (numericType === 'bigint') {
+        return BigInt(s);
+      } else if (numericType === 'Fraction') {
+        if (fraction === undefined) {
+          (0, _noop.noFraction)();
+        }
+        return fraction(s);
+      } else {
+        const n = parseFloat(s);
+        return _exactFraction(n, options);
+      }
+    },
+    'Fraction, Object': function (s, options) {
+      return s;
+    },
+    // we don't need options here
+
+    'BigNumber, Object': function (s, options) {
+      return s;
+    },
+    // we don't need options here
+
+    'number, Object': function (s, options) {
+      return _exactFraction(s, options);
+    },
+    'bigint, Object': function (s, options) {
+      return s;
+    },
+    'Complex, Object': function (s, options) {
+      if (s.im !== 0) {
+        return s;
+      }
+      return _exactFraction(s.re, options);
+    },
+    'Matrix, Object': function (s, options) {
+      return matrix(_exactFraction(s.valueOf()));
+    },
+    'Array, Object': function (s, options) {
+      return s.map(_exactFraction);
+    }
+  });
+  function unaryMinusNode(n) {
+    return new OperatorNode('-', 'unaryMinus', [n]);
+  }
+  function _fractionToNode(f) {
+    // note: we convert await from bigint values, because bigint values gives issues with divisions: 1n/2n=0n and not 0.5
+    const fromBigInt = value => config.number === 'BigNumber' && bignumber ? bignumber(value) : Number(value);
+    const numeratorValue = f.s * f.n;
+    const numeratorNode = numeratorValue < 0n ? new OperatorNode('-', 'unaryMinus', [new ConstantNode(-fromBigInt(numeratorValue))]) : new ConstantNode(fromBigInt(numeratorValue));
+    return f.d === 1n ? numeratorNode : new OperatorNode('/', 'divide', [numeratorNode, new ConstantNode(fromBigInt(f.d))]);
+  }
+
+  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */
+  function _foldAccessor(obj, index, options) {
+    if (!(0, _is.isIndexNode)(index)) {
+      // don't know what to do with that...
+      return new AccessorNode(_ensureNode(obj), _ensureNode(index));
+    }
+    if ((0, _is.isArrayNode)(obj) || (0, _is.isMatrix)(obj)) {
+      const remainingDims = Array.from(index.dimensions);
+      /* We will resolve constant indices one at a time, looking
+       * just in the first or second dimensions because (a) arrays
+       * of more than two dimensions are likely rare, and (b) pulling
+       * out the third or higher dimension would be pretty intricate.
+       * The price is that we miss simplifying [..3d array][x,y,1]
+       */
+      while (remainingDims.length > 0) {
+        if ((0, _is.isConstantNode)(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {
+          const first = _toNumber(remainingDims.shift().value, options);
+          if ((0, _is.isArrayNode)(obj)) {
+            obj = obj.items[first - 1];
+          } else {
+            // matrix
+            obj = obj.valueOf()[first - 1];
+            if (obj instanceof Array) {
+              obj = matrix(obj);
+            }
+          }
+        } else if (remainingDims.length > 1 && (0, _is.isConstantNode)(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {
+          const second = _toNumber(remainingDims[1].value, options);
+          const tryItems = [];
+          const fromItems = (0, _is.isArrayNode)(obj) ? obj.items : obj.valueOf();
+          for (const item of fromItems) {
+            if ((0, _is.isArrayNode)(item)) {
+              tryItems.push(item.items[second - 1]);
+            } else if ((0, _is.isMatrix)(obj)) {
+              tryItems.push(item[second - 1]);
+            } else {
+              break;
+            }
+          }
+          if (tryItems.length === fromItems.length) {
+            if ((0, _is.isArrayNode)(obj)) {
+              obj = new ArrayNode(tryItems);
+            } else {
+              // matrix
+              obj = matrix(tryItems);
+            }
+            remainingDims.splice(1, 1);
+          } else {
+            // extracting slice along 2nd dimension failed, give up
+            break;
+          }
+        } else {
+          // neither 1st or 2nd dimension is constant, give up
+          break;
+        }
+      }
+      if (remainingDims.length === index.dimensions.length) {
+        /* No successful constant indexing */
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      if (remainingDims.length > 0) {
+        /* Indexed some but not all dimensions */
+        index = new IndexNode(remainingDims);
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      /* All dimensions were constant, access completely resolved */
+      return obj;
+    }
+    if ((0, _is.isObjectNode)(obj) && index.dimensions.length === 1 && (0, _is.isConstantNode)(index.dimensions[0])) {
+      const key = index.dimensions[0].value;
+      if (key in obj.properties) {
+        return obj.properties[key];
+      }
+      return new ConstantNode(); // undefined
+    }
+    /* Don't know how to index this sort of obj, at least not with this index */
+    return new AccessorNode(_ensureNode(obj), index);
+  }
+
+  /*
+   * Create a binary tree from a list of Fractions and Nodes.
+   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so
+   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).
+   * @param args - list of Fractions and Nodes
+   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions
+   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes
+   * if args.length is 1, returns args[0]
+   * @return - Either a Node representing a binary expression or Fraction
+   */
+  function foldOp(fn, args, makeNode, options) {
+    const first = args.shift();
+
+    // In the following reduction, sofar always has one of the three following
+    // forms: [NODE], [CONSTANT], or [NODE, CONSTANT]
+    const reduction = args.reduce((sofar, next) => {
+      if (!(0, _is.isNode)(next)) {
+        const last = sofar.pop();
+        if ((0, _is.isNode)(last)) {
+          return [last, next];
+        }
+        // Two constants in a row, try to fold them into one
+        try {
+          sofar.push(_eval(fn, [last, next], options));
+          return sofar;
+        } catch (ignoreandcontinue) {
+          sofar.push(last);
+          // fall through to Node case
+        }
+      }
+
+      // Encountered a Node, or failed folding --
+      // collapse everything so far into a single tree:
+      sofar.push(_ensureNode(sofar.pop()));
+      const newtree = sofar.length === 1 ? sofar[0] : makeNode(sofar);
+      return [makeNode([newtree, _ensureNode(next)])];
+    }, [first]);
+    if (reduction.length === 1) {
+      return reduction[0];
+    }
+    // Might end up with a tree and a constant at the end:
+    return makeNode([reduction[0], _toNode(reduction[1])]);
+  }
+
+  // destroys the original node and returns a folded one
+  function foldFraction(node, options) {
+    switch (node.type) {
+      case 'SymbolNode':
+        return node;
+      case 'ConstantNode':
+        switch (typeof node.value) {
+          case 'number':
+            return _toNumber(node.value, options);
+          case 'bigint':
+            return _toNumber(node.value, options);
+          case 'string':
+            return node.value;
+          default:
+            if (!isNaN(node.value)) return _toNumber(node.value, options);
+        }
+        return node;
+      case 'FunctionNode':
+        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {
+          return node;
+        }
+        {
+          // Process operators as OperatorNode
+          const operatorFunctions = ['add', 'multiply'];
+          if (!operatorFunctions.includes(node.name)) {
+            const args = node.args.map(arg => foldFraction(arg, options));
+
+            // If all args are numbers
+            if (!args.some(_is.isNode)) {
+              try {
+                return _eval(node.name, args, options);
+              } catch (ignoreandcontinue) {}
+            }
+
+            // Size of a matrix does not depend on entries
+            if (node.name === 'size' && args.length === 1 && (0, _is.isArrayNode)(args[0])) {
+              const sz = [];
+              let section = args[0];
+              while ((0, _is.isArrayNode)(section)) {
+                sz.push(section.items.length);
+                section = section.items[0];
+              }
+              return matrix(sz);
+            }
+
+            // Convert all args to nodes and construct a symbolic function call
+            return new FunctionNode(node.name, args.map(_ensureNode));
+          } else {
+            // treat as operator
+          }
+        }
+      /* falls through */
+      case 'OperatorNode':
+        {
+          const fn = node.fn.toString();
+          let args;
+          let res;
+          const makeNode = createMakeNodeFunction(node);
+          if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
+            args = [foldFraction(node.args[0], options)];
+            if (!(0, _is.isNode)(args[0])) {
+              res = _eval(fn, args, options);
+            } else {
+              res = makeNode(args);
+            }
+          } else if (isAssociative(node, options.context)) {
+            args = allChildren(node, options.context);
+            args = args.map(arg => foldFraction(arg, options));
+            if (isCommutative(fn, options.context)) {
+              // commutative binary operator
+              const consts = [];
+              const vars = [];
+              for (let i = 0; i < args.length; i++) {
+                if (!(0, _is.isNode)(args[i])) {
+                  consts.push(args[i]);
+                } else {
+                  vars.push(args[i]);
+                }
+              }
+              if (consts.length > 1) {
+                res = foldOp(fn, consts, makeNode, options);
+                vars.unshift(res);
+                res = foldOp(fn, vars, makeNode, options);
+              } else {
+                // we won't change the children order since it's not neccessary
+                res = foldOp(fn, args, makeNode, options);
+              }
+            } else {
+              // non-commutative binary operator
+              res = foldOp(fn, args, makeNode, options);
+            }
+          } else {
+            // non-associative binary operator
+            args = node.args.map(arg => foldFraction(arg, options));
+            res = foldOp(fn, args, makeNode, options);
+          }
+          return res;
+        }
+      case 'ParenthesisNode':
+        // remove the uneccessary parenthesis
+        return foldFraction(node.content, options);
+      case 'AccessorNode':
+        return _foldAccessor(foldFraction(node.object, options), foldFraction(node.index, options), options);
+      case 'ArrayNode':
+        {
+          const foldItems = node.items.map(item => foldFraction(item, options));
+          if (foldItems.some(_is.isNode)) {
+            return new ArrayNode(foldItems.map(_ensureNode));
+          }
+          /* All literals -- return a Matrix so we can operate on it */
+          return matrix(foldItems);
+        }
+      case 'IndexNode':
+        {
+          return new IndexNode(node.dimensions.map(n => simplifyConstant(n, options)));
+        }
+      case 'ObjectNode':
+        {
+          const foldProps = {};
+          for (const prop in node.properties) {
+            foldProps[prop] = simplifyConstant(node.properties[prop], options);
+          }
+          return new ObjectNode(foldProps);
+        }
+      case 'AssignmentNode':
+      /* falls through */
+      case 'BlockNode':
+      /* falls through */
+      case 'FunctionAssignmentNode':
+      /* falls through */
+      case 'RangeNode':
+      /* falls through */
+      case 'ConditionalNode':
+      /* falls through */
+      default:
+        throw new Error(`Unimplemented node type in simplifyConstant: ${node.type}`);
+    }
+  }
+  return simplifyConstant;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..0e21b5d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/simplifyCore.js
@@ -0,0 +1,297 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSimplifyCore = void 0;
+var _is = require("../../utils/is.js");
+var _operators = require("../../expression/operators.js");
+var _util = require("./simplify/util.js");
+var _factory = require("../../utils/factory.js");
+const name = 'simplifyCore';
+const dependencies = ['typed', 'parse', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+const createSimplifyCore = exports.createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    parse,
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  const node0 = new ConstantNode(0);
+  const node1 = new ConstantNode(1);
+  const nodeT = new ConstantNode(true);
+  const nodeF = new ConstantNode(false);
+  // test if a node will always have a boolean value (true/false)
+  // not sure if this list is complete
+  function isAlwaysBoolean(node) {
+    return (0, _is.isOperatorNode)(node) && ['and', 'not', 'or'].includes(node.op);
+  }
+  const {
+    hasProperty,
+    isCommutative
+  } = (0, _util.createUtil)({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+  /**
+   * simplifyCore() performs single pass simplification suitable for
+   * applications requiring ultimate performance. To roughly summarize,
+   * it handles cases along the lines of simplifyConstant() but where
+   * knowledge of a single argument is sufficient to determine the value.
+   * In contrast, simplify() extends simplifyCore() with additional passes
+   * to provide deeper simplification (such as gathering like terms).
+   *
+   * Specifically, simplifyCore:
+   *
+   * * Converts all function calls with operator equivalents to their
+   *   operator forms.
+   * * Removes operators or function calls that are guaranteed to have no
+   *   effect (such as unary '+').
+   * * Removes double unary '-', '~', and 'not'
+   * * Eliminates addition/subtraction of 0 and multiplication/division/powers
+   *   by 1 or 0.
+   * * Converts addition of a negation into subtraction.
+   * * Eliminates logical operations with constant true or false leading
+   *   arguments.
+   * * Puts constants on the left of a product, if multiplication is
+   *   considered commutative by the options (which is the default)
+   *
+   * Syntax:
+   *
+   *     math.simplifyCore(expr)
+   *     math.simplifyCore(expr, options)
+   *
+   * Examples:
+   *
+   *     const f = math.parse('2 * 1 * x ^ (1 - 0)')
+   *     math.simplifyCore(f)                          // Node "2 * x"
+   *     math.simplify('2 * 1 * x ^ (1 - 0)', [math.simplifyCore]) // Node "2 * x"
+   *
+   * See also:
+   *
+   *     simplify, simplifyConstant, resolve, derivative
+   *
+   * @param {Node | string} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with basic simplifications applied
+   */
+  function _simplifyCore(nodeToSimplify) {
+    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    const context = options ? options.context : undefined;
+    if (hasProperty(nodeToSimplify, 'trivial', context)) {
+      // This node does nothing if it has only one argument, so if so,
+      // return that argument simplified
+      if ((0, _is.isFunctionNode)(nodeToSimplify) && nodeToSimplify.args.length === 1) {
+        return _simplifyCore(nodeToSimplify.args[0], options);
+      }
+      // For other node types, we try the generic methods
+      let simpChild = false;
+      let childCount = 0;
+      nodeToSimplify.forEach(c => {
+        ++childCount;
+        if (childCount === 1) {
+          simpChild = _simplifyCore(c, options);
+        }
+      });
+      if (childCount === 1) {
+        return simpChild;
+      }
+    }
+    let node = nodeToSimplify;
+    if ((0, _is.isFunctionNode)(node)) {
+      const op = (0, _operators.getOperator)(node.name);
+      if (op) {
+        // Replace FunctionNode with a new OperatorNode
+        if (node.args.length > 2 && hasProperty(node, 'associative', context)) {
+          // unflatten into binary operations since that's what simplifyCore handles
+          while (node.args.length > 2) {
+            const last = node.args.pop();
+            const seclast = node.args.pop();
+            node.args.push(new OperatorNode(op, node.name, [last, seclast]));
+          }
+        }
+        node = new OperatorNode(op, node.name, node.args);
+      } else {
+        return new FunctionNode(_simplifyCore(node.fn), node.args.map(n => _simplifyCore(n, options)));
+      }
+    }
+    if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
+      const a0 = _simplifyCore(node.args[0], options);
+      if (node.op === '~') {
+        // bitwise not
+        if ((0, _is.isOperatorNode)(a0) && a0.isUnary() && a0.op === '~') {
+          return a0.args[0];
+        }
+      }
+      if (node.op === 'not') {
+        // logical not
+        if ((0, _is.isOperatorNode)(a0) && a0.isUnary() && a0.op === 'not') {
+          // Has the effect of turning the argument into a boolean
+          // So can only eliminate the double negation if
+          // the inside is already boolean
+          if (isAlwaysBoolean(a0.args[0])) {
+            return a0.args[0];
+          }
+        }
+      }
+      let finish = true;
+      if (node.op === '-') {
+        // unary minus
+        if ((0, _is.isOperatorNode)(a0)) {
+          if (a0.isBinary() && a0.fn === 'subtract') {
+            node = new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);
+            finish = false; // continue to process the new binary node
+          }
+          if (a0.isUnary() && a0.op === '-') {
+            return a0.args[0];
+          }
+        }
+      }
+      if (finish) return new OperatorNode(node.op, node.fn, [a0]);
+    }
+    if ((0, _is.isOperatorNode)(node) && node.isBinary()) {
+      const a0 = _simplifyCore(node.args[0], options);
+      let a1 = _simplifyCore(node.args[1], options);
+      if (node.op === '+') {
+        if ((0, _is.isConstantNode)(a0) && isZero(a0.value)) {
+          return a1;
+        }
+        if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {
+          return a0;
+        }
+        if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {
+          a1 = a1.args[0];
+          node = new OperatorNode('-', 'subtract', [a0, a1]);
+        }
+      }
+      if (node.op === '-') {
+        if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {
+          return _simplifyCore(new OperatorNode('+', 'add', [a0, a1.args[0]]), options);
+        }
+        if ((0, _is.isConstantNode)(a0) && isZero(a0.value)) {
+          return _simplifyCore(new OperatorNode('-', 'unaryMinus', [a1]));
+        }
+        if ((0, _is.isConstantNode)(a1) && isZero(a1.value)) {
+          return a0;
+        }
+        return new OperatorNode(node.op, node.fn, [a0, a1]);
+      }
+      if (node.op === '*') {
+        if ((0, _is.isConstantNode)(a0)) {
+          if (isZero(a0.value)) {
+            return node0;
+          } else if (equal(a0.value, 1)) {
+            return a1;
+          }
+        }
+        if ((0, _is.isConstantNode)(a1)) {
+          if (isZero(a1.value)) {
+            return node0;
+          } else if (equal(a1.value, 1)) {
+            return a0;
+          }
+          if (isCommutative(node, context)) {
+            return new OperatorNode(node.op, node.fn, [a1, a0], node.implicit); // constants on left
+          }
+        }
+        return new OperatorNode(node.op, node.fn, [a0, a1], node.implicit);
+      }
+      if (node.op === '/') {
+        if ((0, _is.isConstantNode)(a0) && isZero(a0.value)) {
+          return node0;
+        }
+        if ((0, _is.isConstantNode)(a1) && equal(a1.value, 1)) {
+          return a0;
+        }
+        return new OperatorNode(node.op, node.fn, [a0, a1]);
+      }
+      if (node.op === '^') {
+        if ((0, _is.isConstantNode)(a1)) {
+          if (isZero(a1.value)) {
+            return node1;
+          } else if (equal(a1.value, 1)) {
+            return a0;
+          }
+        }
+      }
+      if (node.op === 'and') {
+        if ((0, _is.isConstantNode)(a0)) {
+          if (a0.value) {
+            if (isAlwaysBoolean(a1)) return a1;
+            if ((0, _is.isConstantNode)(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
+          } else {
+            return nodeF;
+          }
+        }
+        if ((0, _is.isConstantNode)(a1)) {
+          if (a1.value) {
+            if (isAlwaysBoolean(a0)) return a0;
+          } else {
+            return nodeF;
+          }
+        }
+      }
+      if (node.op === 'or') {
+        if ((0, _is.isConstantNode)(a0)) {
+          if (a0.value) {
+            return nodeT;
+          } else {
+            if (isAlwaysBoolean(a1)) return a1;
+          }
+        }
+        if ((0, _is.isConstantNode)(a1)) {
+          if (a1.value) {
+            return nodeT;
+          } else {
+            if (isAlwaysBoolean(a0)) return a0;
+          }
+        }
+      }
+      return new OperatorNode(node.op, node.fn, [a0, a1]);
+    }
+    if ((0, _is.isOperatorNode)(node)) {
+      return new OperatorNode(node.op, node.fn, node.args.map(a => _simplifyCore(a, options)));
+    }
+    if ((0, _is.isArrayNode)(node)) {
+      return new ArrayNode(node.items.map(n => _simplifyCore(n, options)));
+    }
+    if ((0, _is.isAccessorNode)(node)) {
+      return new AccessorNode(_simplifyCore(node.object, options), _simplifyCore(node.index, options));
+    }
+    if ((0, _is.isIndexNode)(node)) {
+      return new IndexNode(node.dimensions.map(n => _simplifyCore(n, options)));
+    }
+    if ((0, _is.isObjectNode)(node)) {
+      const newProps = {};
+      for (const prop in node.properties) {
+        newProps[prop] = _simplifyCore(node.properties[prop], options);
+      }
+      return new ObjectNode(newProps);
+    }
+    // cannot simplify
+    return node;
+  }
+  return typed(name, {
+    Node: _simplifyCore,
+    'Node,Object': _simplifyCore
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js
new file mode 100644
index 0000000..fb5d6bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolve.js
@@ -0,0 +1,163 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLsolve = void 0;
+var _factory = require("../../../utils/factory.js");
+var _solveValidation = require("./utils/solveValidation.js");
+const name = 'lsolve';
+const dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+const createLsolve = exports.createLsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  const solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix
+  });
+
+  /**
+   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolve(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolve(a, b)  // [[-5.5], [20]]
+   *
+   * See also:
+   *
+   *    lsolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function (m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function (m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function (a, b) {
+      const m = matrix(a);
+      const r = _denseForwardSubstitution(m, b);
+      return r.valueOf();
+    }
+  });
+  function _denseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    const bdata = b._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+
+    // result
+    const x = [];
+    const mdata = m._data;
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      const bj = bdata[j][0] || 0;
+      let xj;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        const vjj = mdata[j][j];
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        xj = divideScalar(bj, vjj);
+
+        // loop rows
+        for (let i = j + 1; i < rows; i++) {
+          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // degenerate row, we can choose any value
+        xj = 0;
+      }
+      x[j] = [xj];
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+  function _sparseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    const bdata = b._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+
+    // result
+    const x = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      const bj = bdata[j][0] || 0;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        let vjj = 0;
+        // matrix values & indices (column j)
+        const jValues = [];
+        const jIndices = [];
+
+        // first and last index in the column
+        const firstIndex = ptr[j];
+        const lastIndex = ptr[j + 1];
+
+        // values in column, find value at [j, j]
+        for (let k = firstIndex; k < lastIndex; k++) {
+          const i = index[k];
+
+          // check row (rows are not sorted!)
+          if (i === j) {
+            vjj = values[k];
+          } else if (i > j) {
+            // store lower triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        }
+
+        // at this point we must have a value in vjj
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        const xj = divideScalar(bj, vjj);
+        for (let k = 0, l = jIndices.length; k < l; k++) {
+          const i = jIndices[k];
+          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, jValues[k]))];
+        }
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js
new file mode 100644
index 0000000..c2e40e6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lsolveAll.js
@@ -0,0 +1,192 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLsolveAll = void 0;
+var _factory = require("../../../utils/factory.js");
+var _solveValidation = require("./utils/solveValidation.js");
+const name = 'lsolveAll';
+const dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+const createLsolveAll = exports.createLsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  const solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix
+  });
+
+  /**
+   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolveAll(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]
+   *
+   * See also:
+   *
+   *    lsolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function (m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function (m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function (a, b) {
+      const m = matrix(a);
+      const R = _denseForwardSubstitution(m, b);
+      return R.map(r => r.valueOf());
+    }
+  });
+  function _denseForwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+
+    // array of right-hand sides
+    const B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    const M = m._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+
+    // loop columns
+    for (let i = 0; i < columns; i++) {
+      let L = B.length;
+
+      // loop right-hand sides
+      for (let k = 0; k < L; k++) {
+        const b = B[k];
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], M[i][i]);
+          for (let j = i + 1; j < columns; j++) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          const bNew = [...b];
+          bNew[i] = 1;
+          for (let j = i + 1; j < columns; j++) {
+            bNew[j] = subtractScalar(bNew[j], M[j][i]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+  function _sparseForwardSubstitution(m, b_) {
+    // array of right-hand sides
+    const B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    const rows = m._size[0];
+    const columns = m._size[1];
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+
+    // loop columns
+    for (let i = 0; i < columns; i++) {
+      let L = B.length;
+
+      // loop right-hand sides
+      for (let k = 0; k < L; k++) {
+        const b = B[k];
+
+        // values & indices (column i)
+        const iValues = [];
+        const iIndices = [];
+
+        // first & last indeces in column
+        const firstIndex = ptr[i];
+        const lastIndex = ptr[i + 1];
+
+        // find the value at [i, i]
+        let Mii = 0;
+        for (let j = firstIndex; j < lastIndex; j++) {
+          const J = index[j];
+          // check row
+          if (J === i) {
+            Mii = values[j];
+          } else if (J > i) {
+            // store lower triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], Mii);
+          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {
+            const J = iIndices[j];
+            b[J] = subtractScalar(b[J], multiplyScalar(b[i], iValues[j]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          const bNew = [...b];
+          bNew[i] = 1;
+          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {
+            const J = iIndices[j];
+            bNew[J] = subtractScalar(bNew[J], iValues[j]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js
new file mode 100644
index 0000000..8227019
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/lusolve.js
@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLusolve = void 0;
+var _is = require("../../../utils/is.js");
+var _factory = require("../../../utils/factory.js");
+var _solveValidation = require("./utils/solveValidation.js");
+var _csIpvec = require("../sparse/csIpvec.js");
+const name = 'lusolve';
+const dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];
+const createLusolve = exports.createLusolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    lup,
+    slu,
+    usolve,
+    lsolve,
+    DenseMatrix
+  } = _ref;
+  const solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix
+  });
+
+  /**
+   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+   *
+   * Syntax:
+   *
+   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b
+   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
+   *
+   * Examples:
+   *
+   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
+   *
+   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]
+   *
+   *    const f = math.lup(m)
+   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
+   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = math.lusolve(a, b)  // [[2], [5]]
+   *
+   * See also:
+   *
+   *    lup, slu, lsolve, usolve
+   *
+   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition
+   * @param {Matrix | Array} b               Column Vector
+   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
+   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
+   *
+   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b
+   */
+  return typed(name, {
+    'Array, Array | Matrix': function (a, b) {
+      a = matrix(a);
+      const d = lup(a);
+      const x = _lusolve(d.L, d.U, d.p, null, b);
+      return x.valueOf();
+    },
+    'DenseMatrix, Array | Matrix': function (a, b) {
+      const d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix': function (a, b) {
+      const d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix, number, number': function (a, b, order, threshold) {
+      const d = slu(a, order, threshold);
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    },
+    'Object, Array | Matrix': function (d, b) {
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    }
+  });
+  function _toMatrix(a) {
+    if ((0, _is.isMatrix)(a)) {
+      return a;
+    }
+    if ((0, _is.isArray)(a)) {
+      return matrix(a);
+    }
+    throw new TypeError('Invalid Matrix LU decomposition');
+  }
+  function _lusolve(l, u, p, q, b) {
+    // verify decomposition
+    l = _toMatrix(l);
+    u = _toMatrix(u);
+
+    // apply row permutations if needed (b is a DenseMatrix)
+    if (p) {
+      b = solveValidation(l, b, true);
+      b._data = (0, _csIpvec.csIpvec)(p, b._data);
+    }
+
+    // use forward substitution to resolve L * y = b
+    const y = lsolve(l, b);
+    // use backward substitution to resolve U * x = y
+    const x = usolve(u, y);
+
+    // apply column permutations if needed (x is a DenseMatrix)
+    if (q) {
+      x._data = (0, _csIpvec.csIpvec)(q, x._data);
+    }
+    return x;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js
new file mode 100644
index 0000000..e36877d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolve.js
@@ -0,0 +1,167 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUsolve = void 0;
+var _factory = require("../../../utils/factory.js");
+var _solveValidation = require("./utils/solveValidation.js");
+const name = 'usolve';
+const dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+const createUsolve = exports.createUsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  const solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix
+  });
+
+  /**
+   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolve(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolve(a, b)  // [[8], [9]]
+   *
+   * See also:
+   *
+   *    usolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function (m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function (m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function (a, b) {
+      const m = matrix(a);
+      const r = _denseBackwardSubstitution(m, b);
+      return r.valueOf();
+    }
+  });
+  function _denseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    const bdata = b._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+
+    // result
+    const x = [];
+    const mdata = m._data;
+    // loop columns backwards
+    for (let j = columns - 1; j >= 0; j--) {
+      // b[j]
+      const bj = bdata[j][0] || 0;
+      // x[j]
+      let xj;
+      if (!equalScalar(bj, 0)) {
+        // value at [j, j]
+        const vjj = mdata[j][j];
+        if (equalScalar(vjj, 0)) {
+          // system cannot be solved
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        xj = divideScalar(bj, vjj);
+
+        // loop rows
+        for (let i = j - 1; i >= 0; i--) {
+          // update copy of b
+          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // zero value at j
+        xj = 0;
+      }
+      // update x
+      x[j] = [xj];
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+  function _sparseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    const bdata = b._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+
+    // result
+    const x = [];
+
+    // loop columns backwards
+    for (let j = columns - 1; j >= 0; j--) {
+      const bj = bdata[j][0] || 0;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        let vjj = 0;
+
+        // upper triangular matrix values & index (column j)
+        const jValues = [];
+        const jIndices = [];
+
+        // first & last indeces in column
+        const firstIndex = ptr[j];
+        const lastIndex = ptr[j + 1];
+
+        // values in column, find value at [j, j], loop backwards
+        for (let k = lastIndex - 1; k >= firstIndex; k--) {
+          const i = index[k];
+
+          // check row (rows are not sorted!)
+          if (i === j) {
+            vjj = values[k];
+          } else if (i < j) {
+            // store upper triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        }
+
+        // at this point we must have a value in vjj
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        const xj = divideScalar(bj, vjj);
+        for (let k = 0, lastIndex = jIndices.length; k < lastIndex; k++) {
+          const i = jIndices[k];
+          bdata[i] = [subtractScalar(bdata[i][0], multiplyScalar(xj, jValues[k]))];
+        }
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js
new file mode 100644
index 0000000..5b6b5de
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/usolveAll.js
@@ -0,0 +1,196 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUsolveAll = void 0;
+var _factory = require("../../../utils/factory.js");
+var _solveValidation = require("./utils/solveValidation.js");
+const name = 'usolveAll';
+const dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+const createUsolveAll = exports.createUsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  const solveValidation = (0, _solveValidation.createSolveValidation)({
+    DenseMatrix
+  });
+
+  /**
+   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolveAll(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]
+   *
+   * See also:
+   *
+   *    usolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function (m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function (m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function (a, b) {
+      const m = matrix(a);
+      const R = _denseBackwardSubstitution(m, b);
+      return R.map(r => r.valueOf());
+    }
+  });
+  function _denseBackwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+
+    // array of right-hand sides
+    const B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    const M = m._data;
+    const rows = m._size[0];
+    const columns = m._size[1];
+
+    // loop columns backwards
+    for (let i = columns - 1; i >= 0; i--) {
+      let L = B.length;
+
+      // loop right-hand sides
+      for (let k = 0; k < L; k++) {
+        const b = B[k];
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], M[i][i]);
+          for (let j = i - 1; j >= 0; j--) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          const bNew = [...b];
+          bNew[i] = 1;
+          for (let j = i - 1; j >= 0; j--) {
+            bNew[j] = subtractScalar(bNew[j], M[j][i]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+  function _sparseBackwardSubstitution(m, b_) {
+    // array of right-hand sides
+    const B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    const rows = m._size[0];
+    const columns = m._size[1];
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+
+    // loop columns backwards
+    for (let i = columns - 1; i >= 0; i--) {
+      let L = B.length;
+
+      // loop right-hand sides
+      for (let k = 0; k < L; k++) {
+        const b = B[k];
+
+        // values & indices (column i)
+        const iValues = [];
+        const iIndices = [];
+
+        // first & last indeces in column
+        const firstIndex = ptr[i];
+        const lastIndex = ptr[i + 1];
+
+        // find the value at [i, i]
+        let Mii = 0;
+        for (let j = lastIndex - 1; j >= firstIndex; j--) {
+          const J = index[j];
+          // check row
+          if (J === i) {
+            Mii = values[j];
+          } else if (J < i) {
+            // store upper triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], Mii);
+
+          // loop upper triangular
+          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {
+            const J = iIndices[j];
+            b[J] = subtractScalar(b[J], multiplyScalar(b[i], iValues[j]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          const bNew = [...b];
+          bNew[i] = 1;
+
+          // loop upper triangular
+          for (let j = 0, lastIndex = iIndices.length; j < lastIndex; j++) {
+            const J = iIndices[j];
+            bNew[J] = subtractScalar(bNew[J], iValues[j]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js b/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js
new file mode 100644
index 0000000..c0defc6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/solver/utils/solveValidation.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSolveValidation = createSolveValidation;
+var _is = require("../../../../utils/is.js");
+var _array = require("../../../../utils/array.js");
+var _string = require("../../../../utils/string.js");
+function createSolveValidation(_ref) {
+  let {
+    DenseMatrix
+  } = _ref;
+  /**
+   * Validates matrix and column vector b for backward/forward substitution algorithms.
+   *
+   * @param {Matrix} m            An N x N matrix
+   * @param {Array | Matrix} b    A column vector
+   * @param {Boolean} copy        Return a copy of vector b
+   *
+   * @return {DenseMatrix}        Dense column vector b
+   */
+  return function solveValidation(m, b, copy) {
+    const mSize = m.size();
+    if (mSize.length !== 2) {
+      throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(mSize) + ')');
+    }
+    const rows = mSize[0];
+    const columns = mSize[1];
+    if (rows !== columns) {
+      throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(mSize) + ')');
+    }
+    let data = [];
+    if ((0, _is.isMatrix)(b)) {
+      const bSize = b.size();
+      const bdata = b._data;
+
+      // 1-dim vector
+      if (bSize.length === 1) {
+        if (bSize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (let i = 0; i < rows; i++) {
+          data[i] = [bdata[i]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1],
+          datatype: b._datatype
+        });
+      }
+
+      // 2-dim column
+      if (bSize.length === 2) {
+        if (bSize[0] !== rows || bSize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        if ((0, _is.isDenseMatrix)(b)) {
+          if (copy) {
+            data = [];
+            for (let i = 0; i < rows; i++) {
+              data[i] = [bdata[i][0]];
+            }
+            return new DenseMatrix({
+              data,
+              size: [rows, 1],
+              datatype: b._datatype
+            });
+          }
+          return b;
+        }
+        if ((0, _is.isSparseMatrix)(b)) {
+          for (let i = 0; i < rows; i++) {
+            data[i] = [0];
+          }
+          const values = b._values;
+          const index = b._index;
+          const ptr = b._ptr;
+          for (let k1 = ptr[1], k = ptr[0]; k < k1; k++) {
+            const i = index[k];
+            data[i][0] = values[k];
+          }
+          return new DenseMatrix({
+            data,
+            size: [rows, 1],
+            datatype: b._datatype
+          });
+        }
+      }
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+    if ((0, _is.isArray)(b)) {
+      const bsize = (0, _array.arraySize)(b);
+      if (bsize.length === 1) {
+        if (bsize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (let i = 0; i < rows; i++) {
+          data[i] = [b[i]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1]
+        });
+      }
+      if (bsize.length === 2) {
+        if (bsize[0] !== rows || bsize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (let i = 0; i < rows; i++) {
+          data[i] = [b[i][0]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1]
+        });
+      }
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js
new file mode 100644
index 0000000..5569cdd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csAmd.js
@@ -0,0 +1,587 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsAmd = void 0;
+var _factory = require("../../../utils/factory.js");
+var _csFkeep = require("./csFkeep.js");
+var _csFlip = require("./csFlip.js");
+var _csTdfs = require("./csTdfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csAmd';
+const dependencies = ['add', 'multiply', 'transpose'];
+const createCsAmd = exports.createCsAmd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  /**
+   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used
+   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization
+   * than A. It is a gready method that selects the sparsest pivot row and column during the course
+   * of a right looking sparse Cholesky factorization.
+   *
+   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
+   * @param {Matrix} m        Sparse Matrix
+   */
+  return function csAmd(order, a) {
+    // check input parameters
+    if (!a || order <= 0 || order > 3) {
+      return null;
+    }
+    // a matrix arrays
+    const asize = a._size;
+    // rows and columns
+    const m = asize[0];
+    const n = asize[1];
+    // initialize vars
+    let lemax = 0;
+    // dense threshold
+    let dense = Math.max(16, 10 * Math.sqrt(n));
+    dense = Math.min(n - 2, dense);
+    // create target matrix C
+    const cm = _createTargetMatrix(order, a, m, n, dense);
+    // drop diagonal entries
+    (0, _csFkeep.csFkeep)(cm, _diag, null);
+    // C matrix arrays
+    const cindex = cm._index;
+    const cptr = cm._ptr;
+
+    // number of nonzero elements in C
+    let cnz = cptr[n];
+
+    // allocate result (n+1)
+    const P = [];
+
+    // create workspace (8 * (n + 1))
+    const W = [];
+    const len = 0; // first n + 1 entries
+    const nv = n + 1; // next n + 1 entries
+    const next = 2 * (n + 1); // next n + 1 entries
+    const head = 3 * (n + 1); // next n + 1 entries
+    const elen = 4 * (n + 1); // next n + 1 entries
+    const degree = 5 * (n + 1); // next n + 1 entries
+    const w = 6 * (n + 1); // next n + 1 entries
+    const hhead = 7 * (n + 1); // last n + 1 entries
+
+    // use P as workspace for last
+    const last = P;
+
+    // initialize quotient graph
+    let mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree);
+
+    // initialize degree lists
+    let nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next);
+
+    // minimum degree node
+    let mindeg = 0;
+
+    // vars
+    let i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d;
+
+    // while (selecting pivots) do
+    while (nel < n) {
+      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first
+      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow
+      // many nodes have been eliminated.
+      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++);
+      if (W[next + k] !== -1) {
+        last[W[next + k]] = -1;
+      }
+      // remove k from degree list
+      W[head + mindeg] = W[next + k];
+      // elenk = |Ek|
+      const elenk = W[elen + k];
+      // # of nodes k represents
+      let nvk = W[nv + k];
+      // W[nv + k] nodes of A eliminated
+      nel += nvk;
+
+      // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is
+      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the
+      // degree lists. All elements e in Ek are absorved into element k.
+      let dk = 0;
+      // flag k as in Lk
+      W[nv + k] = -nvk;
+      let p = cptr[k];
+      // do in place if W[elen + k] === 0
+      const pk1 = elenk === 0 ? p : cnz;
+      let pk2 = pk1;
+      for (k1 = 1; k1 <= elenk + 1; k1++) {
+        if (k1 > elenk) {
+          // search the nodes in k
+          e = k;
+          // list of nodes starts at cindex[pj]
+          pj = p;
+          // length of list of nodes in k
+          ln = W[len + k] - elenk;
+        } else {
+          // search the nodes in e
+          e = cindex[p++];
+          pj = cptr[e];
+          // length of list of nodes in e
+          ln = W[len + e];
+        }
+        for (k2 = 1; k2 <= ln; k2++) {
+          i = cindex[pj++];
+          // check  node i dead, or seen
+          if ((nvi = W[nv + i]) <= 0) {
+            continue;
+          }
+          // W[degree + Lk] += size of node i
+          dk += nvi;
+          // negate W[nv + i] to denote i in Lk
+          W[nv + i] = -nvi;
+          // place i in Lk
+          cindex[pk2++] = i;
+          if (W[next + i] !== -1) {
+            last[W[next + i]] = last[i];
+          }
+          // check we need to remove i from degree list
+          if (last[i] !== -1) {
+            W[next + last[i]] = W[next + i];
+          } else {
+            W[head + W[degree + i]] = W[next + i];
+          }
+        }
+        if (e !== k) {
+          // absorb e into k
+          cptr[e] = (0, _csFlip.csFlip)(k);
+          // e is now a dead element
+          W[w + e] = 0;
+        }
+      }
+      // cindex[cnz...nzmax] is free
+      if (elenk !== 0) {
+        cnz = pk2;
+      }
+      // external degree of k - |Lk\i|
+      W[degree + k] = dk;
+      // element k is in cindex[pk1..pk2-1]
+      cptr[k] = pk1;
+      W[len + k] = pk2 - pk1;
+      // k is now an element
+      W[elen + k] = -2;
+
+      // Find set differences. The scan1 function now computes the set differences |Le \ Lk| for all elements e. At the start of the
+      // scan, no entry in the w array is greater than or equal to mark.
+
+      // clear w if necessary
+      mark = _wclear(mark, lemax, W, w, n);
+      // scan 1: find |Le\Lk|
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check if W[elen + i] empty, skip it
+        if ((eln = W[elen + i]) <= 0) {
+          continue;
+        }
+        // W[nv + i] was negated
+        nvi = -W[nv + i];
+        const wnvi = mark - nvi;
+        // scan Ei
+        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {
+          e = cindex[p];
+          if (W[w + e] >= mark) {
+            // decrement |Le\Lk|
+            W[w + e] -= nvi;
+          } else if (W[w + e] !== 0) {
+            // ensure e is a live element, 1st time e seen in scan 1
+            W[w + e] = W[degree + e] + wnvi;
+          }
+        }
+      }
+
+      // degree update
+      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash
+      // function h(i) for all nodes in Lk.
+
+      // scan2: degree update
+      for (pk = pk1; pk < pk2; pk++) {
+        // consider node i in Lk
+        i = cindex[pk];
+        p1 = cptr[i];
+        p2 = p1 + W[elen + i] - 1;
+        pn = p1;
+        // scan Ei
+        for (h = 0, d = 0, p = p1; p <= p2; p++) {
+          e = cindex[p];
+          // check e is an unabsorbed element
+          if (W[w + e] !== 0) {
+            // dext = |Le\Lk|
+            const dext = W[w + e] - mark;
+            if (dext > 0) {
+              // sum up the set differences
+              d += dext;
+              // keep e in Ei
+              cindex[pn++] = e;
+              // compute the hash of node i
+              h += e;
+            } else {
+              // aggressive absorb. e->k
+              cptr[e] = (0, _csFlip.csFlip)(k);
+              // e is a dead element
+              W[w + e] = 0;
+            }
+          }
+        }
+        // W[elen + i] = |Ei|
+        W[elen + i] = pn - p1 + 1;
+        const p3 = pn;
+        const p4 = p1 + W[len + i];
+        // prune edges in Ai
+        for (p = p2 + 1; p < p4; p++) {
+          j = cindex[p];
+          // check node j dead or in Lk
+          const nvj = W[nv + j];
+          if (nvj <= 0) {
+            continue;
+          }
+          // degree(i) += |j|
+          d += nvj;
+          // place j in node list of i
+          cindex[pn++] = j;
+          // compute hash for node i
+          h += j;
+        }
+        // check for mass elimination
+        if (d === 0) {
+          // absorb i into k
+          cptr[i] = (0, _csFlip.csFlip)(k);
+          nvi = -W[nv + i];
+          // |Lk| -= |i|
+          dk -= nvi;
+          // |k| += W[nv + i]
+          nvk += nvi;
+          nel += nvi;
+          W[nv + i] = 0;
+          // node i is dead
+          W[elen + i] = -1;
+        } else {
+          // update degree(i)
+          W[degree + i] = Math.min(W[degree + i], d);
+          // move first node to end
+          cindex[pn] = cindex[p3];
+          // move 1st el. to end of Ei
+          cindex[p3] = cindex[p1];
+          // add k as 1st element in of Ei
+          cindex[p1] = k;
+          // new len of adj. list of node i
+          W[len + i] = pn - p1 + 1;
+          // finalize hash of i
+          h = (h < 0 ? -h : h) % n;
+          // place i in hash bucket
+          W[next + i] = W[hhead + h];
+          W[hhead + h] = i;
+          // save hash of i in last[i]
+          last[i] = h;
+        }
+      }
+      // finalize |Lk|
+      W[degree + k] = dk;
+      lemax = Math.max(lemax, dk);
+      // clear w
+      mark = _wclear(mark + lemax, lemax, W, w, n);
+
+      // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.
+      // If two nodes have identical adjacency lists, their hash functions wil be identical.
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check i is dead, skip it
+        if (W[nv + i] >= 0) {
+          continue;
+        }
+        // scan hash bucket of node i
+        h = last[i];
+        i = W[hhead + h];
+        // hash bucket will be empty
+        W[hhead + h] = -1;
+        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {
+          ln = W[len + i];
+          eln = W[elen + i];
+          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {
+            W[w + cindex[p]] = mark;
+          }
+          let jlast = i;
+          // compare i with all j
+          for (j = W[next + i]; j !== -1;) {
+            let ok = W[len + j] === ln && W[elen + j] === eln;
+            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {
+              // compare i and j
+              if (W[w + cindex[p]] !== mark) {
+                ok = 0;
+              }
+            }
+            // check i and j are identical
+            if (ok) {
+              // absorb j into i
+              cptr[j] = (0, _csFlip.csFlip)(i);
+              W[nv + i] += W[nv + j];
+              W[nv + j] = 0;
+              // node j is dead
+              W[elen + j] = -1;
+              // delete j from hash bucket
+              j = W[next + j];
+              W[next + jlast] = j;
+            } else {
+              // j and i are different
+              jlast = j;
+              j = W[next + j];
+            }
+          }
+        }
+      }
+
+      // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.
+      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.
+      for (p = pk1, pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check  i is dead, skip it
+        if ((nvi = -W[nv + i]) <= 0) {
+          continue;
+        }
+        // restore W[nv + i]
+        W[nv + i] = nvi;
+        // compute external degree(i)
+        d = W[degree + i] + dk - nvi;
+        d = Math.min(d, n - nel - nvi);
+        if (W[head + d] !== -1) {
+          last[W[head + d]] = i;
+        }
+        // put i back in degree list
+        W[next + i] = W[head + d];
+        last[i] = -1;
+        W[head + d] = i;
+        // find new minimum degree
+        mindeg = Math.min(mindeg, d);
+        W[degree + i] = d;
+        // place i in Lk
+        cindex[p++] = i;
+      }
+      // # nodes absorbed into k
+      W[nv + k] = nvk;
+      // length of adj list of element k
+      if ((W[len + k] = p - pk1) === 0) {
+        // k is a root of the tree
+        cptr[k] = -1;
+        // k is now a dead element
+        W[w + k] = 0;
+      }
+      if (elenk !== 0) {
+        // free unused space in Lk
+        cnz = p;
+      }
+    }
+
+    // Postordering. The elimination is complete, but no permutation has been computed. All that is left
+    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if
+    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation
+    // is computed. The tree is restored by unflipping all of ptr.
+
+    // fix assembly tree
+    for (i = 0; i < n; i++) {
+      cptr[i] = (0, _csFlip.csFlip)(cptr[i]);
+    }
+    for (j = 0; j <= n; j++) {
+      W[head + j] = -1;
+    }
+    // place unordered nodes in lists
+    for (j = n; j >= 0; j--) {
+      // skip if j is an element
+      if (W[nv + j] > 0) {
+        continue;
+      }
+      // place j in list of its parent
+      W[next + j] = W[head + cptr[j]];
+      W[head + cptr[j]] = j;
+    }
+    // place elements in lists
+    for (e = n; e >= 0; e--) {
+      // skip unless e is an element
+      if (W[nv + e] <= 0) {
+        continue;
+      }
+      if (cptr[e] !== -1) {
+        // place e in list of its parent
+        W[next + e] = W[head + cptr[e]];
+        W[head + cptr[e]] = e;
+      }
+    }
+    // postorder the assembly tree
+    for (k = 0, i = 0; i <= n; i++) {
+      if (cptr[i] === -1) {
+        k = (0, _csTdfs.csTdfs)(i, k, W, head, next, P, w);
+      }
+    }
+    // remove last item in array
+    P.splice(P.length - 1, 1);
+    // return P
+    return P;
+  };
+
+  /**
+   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation
+   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.
+   *
+   * Order: 0
+   *   A natural ordering P=null matrix is returned.
+   *
+   * Order: 1
+   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.
+   *   P = M + M'
+   *
+   * Order: 2
+   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.
+   *   P = M' * M
+   *
+   * Order: 3
+   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
+   *   P = M' * M
+   */
+  function _createTargetMatrix(order, a, m, n, dense) {
+    // compute A'
+    const at = transpose(a);
+
+    // check order = 1, matrix must be square
+    if (order === 1 && n === m) {
+      // C = A + A'
+      return add(a, at);
+    }
+
+    // check order = 2, drop dense columns from M'
+    if (order === 2) {
+      // transpose arrays
+      const tindex = at._index;
+      const tptr = at._ptr;
+      // new column index
+      let p2 = 0;
+      // loop A' columns (rows)
+      for (let j = 0; j < m; j++) {
+        // column j of AT starts here
+        let p = tptr[j];
+        // new column j starts here
+        tptr[j] = p2;
+        // skip dense col j
+        if (tptr[j + 1] - p > dense) {
+          continue;
+        }
+        // map rows in column j of A
+        for (const p1 = tptr[j + 1]; p < p1; p++) {
+          tindex[p2++] = tindex[p];
+        }
+      }
+      // finalize AT
+      tptr[m] = p2;
+      // recreate A from new transpose matrix
+      a = transpose(at);
+      // use A' * A
+      return multiply(at, a);
+    }
+
+    // use A' * A, square or rectangular matrix
+    return multiply(at, a);
+  }
+
+  /**
+   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:
+   *
+   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.
+   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).
+   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.
+   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).
+   */
+  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {
+    // Initialize quotient graph
+    for (let k = 0; k < n; k++) {
+      W[len + k] = cptr[k + 1] - cptr[k];
+    }
+    W[len + n] = 0;
+    // initialize workspace
+    for (let i = 0; i <= n; i++) {
+      // degree list i is empty
+      W[head + i] = -1;
+      last[i] = -1;
+      W[next + i] = -1;
+      // hash list i is empty
+      W[hhead + i] = -1;
+      // node i is just one node
+      W[nv + i] = 1;
+      // node i is alive
+      W[w + i] = 1;
+      // Ek of node i is empty
+      W[elen + i] = 0;
+      // degree of node i
+      W[degree + i] = W[len + i];
+    }
+    // clear w
+    const mark = _wclear(0, 0, W, w, n);
+    // n is a dead element
+    W[elen + n] = -2;
+    // n is a root of assembly tree
+    cptr[n] = -1;
+    // n is a dead element
+    W[w + n] = 0;
+    // return mark
+    return mark;
+  }
+
+  /**
+   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with
+   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the
+   * output permutation p.
+   */
+  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {
+    // result
+    let nel = 0;
+    // loop columns
+    for (let i = 0; i < n; i++) {
+      // degree @ i
+      const d = W[degree + i];
+      // check node i is empty
+      if (d === 0) {
+        // element i is dead
+        W[elen + i] = -2;
+        nel++;
+        // i is a root of assembly tree
+        cptr[i] = -1;
+        W[w + i] = 0;
+      } else if (d > dense) {
+        // absorb i into element n
+        W[nv + i] = 0;
+        // node i is dead
+        W[elen + i] = -1;
+        nel++;
+        cptr[i] = (0, _csFlip.csFlip)(n);
+        W[nv + n]++;
+      } else {
+        const h = W[head + d];
+        if (h !== -1) {
+          last[h] = i;
+        }
+        // put node i in degree list d
+        W[next + i] = W[head + d];
+        W[head + d] = i;
+      }
+    }
+    return nel;
+  }
+  function _wclear(mark, lemax, W, w, n) {
+    if (mark < 2 || mark + lemax < 0) {
+      for (let k = 0; k < n; k++) {
+        if (W[w + k] !== 0) {
+          W[w + k] = 1;
+        }
+      }
+      mark = 2;
+    }
+    // at this point, W [0..n-1] < mark holds
+    return mark;
+  }
+  function _diag(i, j) {
+    return i !== j;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js
new file mode 100644
index 0000000..a9c7e1d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csChol.js
@@ -0,0 +1,164 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsChol = void 0;
+var _factory = require("../../../utils/factory.js");
+var _csEreach = require("./csEreach.js");
+var _csSymperm = require("./csSymperm.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csChol';
+const dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
+const createCsChol = exports.createCsChol = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    divideScalar,
+    sqrt,
+    subtract,
+    multiply,
+    im,
+    re,
+    conj,
+    equal,
+    smallerEq,
+    SparseMatrix
+  } = _ref;
+  const csSymperm = (0, _csSymperm.createCsSymperm)({
+    conj,
+    SparseMatrix
+  });
+
+  /**
+   * Computes the Cholesky factorization of matrix A. It computes L and P so
+   * L * L' = P * A * P'
+   *
+   * @param {Matrix}  m               The A Matrix to factorize, only upper triangular part used
+   * @param {Object}  s               The symbolic analysis from cs_schol()
+   *
+   * @return {Number}                 The numeric Cholesky factorization of A or null
+   */
+  return function csChol(m, s) {
+    // validate input
+    if (!m) {
+      return null;
+    }
+    // m arrays
+    const size = m._size;
+    // columns
+    const n = size[1];
+    // symbolic analysis result
+    const parent = s.parent;
+    const cp = s.cp;
+    const pinv = s.pinv;
+    // L arrays
+    const lvalues = [];
+    const lindex = [];
+    const lptr = [];
+    // L
+    const L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    });
+    // vars
+    const c = []; // (2 * n)
+    const x = []; // (n)
+    // compute C = P * A * P'
+    const cm = pinv ? csSymperm(m, pinv, 1) : m;
+    // C matrix arrays
+    const cvalues = cm._values;
+    const cindex = cm._index;
+    const cptr = cm._ptr;
+    // vars
+    let k, p;
+    // initialize variables
+    for (k = 0; k < n; k++) {
+      lptr[k] = c[k] = cp[k];
+    }
+    // compute L(k,:) for L*L' = C
+    for (k = 0; k < n; k++) {
+      // nonzero pattern of L(k,:)
+      let top = (0, _csEreach.csEreach)(cm, k, parent, c);
+      // x (0:k) is now zero
+      x[k] = 0;
+      // x = full(triu(C(:,k)))
+      for (p = cptr[k]; p < cptr[k + 1]; p++) {
+        if (cindex[p] <= k) {
+          x[cindex[p]] = cvalues[p];
+        }
+      }
+      // d = C(k,k)
+      let d = x[k];
+      // clear x for k+1st iteration
+      x[k] = 0;
+      // solve L(0:k-1,0:k-1) * x = C(:,k)
+      for (; top < n; top++) {
+        // s[top..n-1] is pattern of L(k,:)
+        const i = s[top];
+        // L(k,i) = x (i) / L(i,i)
+        const lki = divideScalar(x[i], lvalues[lptr[i]]);
+        // clear x for k+1st iteration
+        x[i] = 0;
+        for (p = lptr[i] + 1; p < c[i]; p++) {
+          // row
+          const r = lindex[p];
+          // update x[r]
+          x[r] = subtract(x[r], multiply(lvalues[p], lki));
+        }
+        // d = d - L(k,i)*L(k,i)
+        d = subtract(d, multiply(lki, conj(lki)));
+        p = c[i]++;
+        // store L(k,i) in column i
+        lindex[p] = k;
+        lvalues[p] = conj(lki);
+      }
+      // compute L(k,k)
+      if (smallerEq(re(d), 0) || !equal(im(d), 0)) {
+        // not pos def
+        return null;
+      }
+      p = c[k]++;
+      //  store L(k,k) = sqrt(d) in column k
+      lindex[p] = k;
+      lvalues[p] = sqrt(d);
+    }
+    // finalize L
+    lptr[n] = cp[n];
+    // P matrix
+    let P;
+    // check we need to calculate P
+    if (pinv) {
+      // P arrays
+      const pvalues = [];
+      const pindex = [];
+      const pptr = [];
+      // create P matrix
+      for (p = 0; p < n; p++) {
+        // initialize ptr (one value per column)
+        pptr[p] = p;
+        // index (apply permutation vector)
+        pindex.push(pinv[p]);
+        // value 1
+        pvalues.push(1);
+      }
+      // update ptr
+      pptr[n] = n;
+      // P
+      P = new SparseMatrix({
+        values: pvalues,
+        index: pindex,
+        ptr: pptr,
+        size: [n, n]
+      });
+    }
+    // return L & P
+    return {
+      L,
+      P
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js
new file mode 100644
index 0000000..c131993
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCounts.js
@@ -0,0 +1,133 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsCounts = void 0;
+var _factory = require("../../../utils/factory.js");
+var _csLeaf = require("./csLeaf.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csCounts';
+const dependencies = ['transpose'];
+const createCsCounts = exports.createCsCounts = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    transpose
+  } = _ref;
+  /**
+   * Computes the column counts using the upper triangular part of A.
+   * It transposes A internally, none of the input parameters are modified.
+   *
+   * @param {Matrix} a           The sparse matrix A
+   *
+   * @param {Matrix} ata         Count the columns of A'A instead
+   *
+   * @return                     An array of size n of the column counts or null on error
+   */
+  return function (a, parent, post, ata) {
+    // check inputs
+    if (!a || !parent || !post) {
+      return null;
+    }
+    // a matrix arrays
+    const asize = a._size;
+    // rows and columns
+    const m = asize[0];
+    const n = asize[1];
+    // variables
+    let i, j, k, J, p, p0, p1;
+
+    // workspace size
+    const s = 4 * n + (ata ? n + m + 1 : 0);
+    // allocate workspace
+    const w = []; // (s)
+    const ancestor = 0; // first n entries
+    const maxfirst = n; // next n entries
+    const prevleaf = 2 * n; // next n entries
+    const first = 3 * n; // next n entries
+    const head = 4 * n; // next n + 1 entries (used when ata is true)
+    const next = 5 * n + 1; // last entries in workspace
+    // clear workspace w[0..s-1]
+    for (k = 0; k < s; k++) {
+      w[k] = -1;
+    }
+
+    // allocate result
+    const colcount = []; // (n)
+
+    // AT = A'
+    const at = transpose(a);
+    // at arrays
+    const tindex = at._index;
+    const tptr = at._ptr;
+
+    // find w[first + j]
+    for (k = 0; k < n; k++) {
+      j = post[k];
+      // colcount[j]=1 if j is a leaf
+      colcount[j] = w[first + j] === -1 ? 1 : 0;
+      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {
+        w[first + j] = k;
+      }
+    }
+
+    // initialize ata if needed
+    if (ata) {
+      // invert post
+      for (k = 0; k < n; k++) {
+        w[post[k]] = k;
+      }
+      // loop rows (columns in AT)
+      for (i = 0; i < m; i++) {
+        // values in column i of AT
+        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {
+          k = Math.min(k, w[tindex[p]]);
+        }
+        // place row i in linked list k
+        w[next + i] = w[head + k];
+        w[head + k] = i;
+      }
+    }
+
+    // each node in its own set
+    for (i = 0; i < n; i++) {
+      w[ancestor + i] = i;
+    }
+    for (k = 0; k < n; k++) {
+      // j is the kth node in postordered etree
+      j = post[k];
+      // check j is not a root
+      if (parent[j] !== -1) {
+        colcount[parent[j]]--;
+      }
+
+      // J=j for LL'=A case
+      for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {
+        for (p = tptr[J]; p < tptr[J + 1]; p++) {
+          i = tindex[p];
+          const r = (0, _csLeaf.csLeaf)(i, j, w, first, maxfirst, prevleaf, ancestor);
+          // check A(i,j) is in skeleton
+          if (r.jleaf >= 1) {
+            colcount[j]++;
+          }
+          // check account for overlap in q
+          if (r.jleaf === 2) {
+            colcount[r.q]--;
+          }
+        }
+      }
+      if (parent[j] !== -1) {
+        w[ancestor + j] = parent[j];
+      }
+    }
+    // sum up colcount's of each child
+    for (j = 0; j < n; j++) {
+      if (parent[j] !== -1) {
+        colcount[parent[j]] += colcount[j];
+      }
+    }
+    return colcount;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js
new file mode 100644
index 0000000..2035a26
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csCumsum.js
@@ -0,0 +1,34 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csCumsum = csCumsum;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * It sets the p[i] equal to the sum of c[0] through c[i-1].
+ *
+ * @param {Array}   ptr             The Sparse Matrix ptr array
+ * @param {Array}   c               The Sparse Matrix ptr array
+ * @param {Number}  n               The number of columns
+ */
+function csCumsum(ptr, c, n) {
+  // variables
+  let i;
+  let nz = 0;
+  for (i = 0; i < n; i++) {
+    // initialize ptr @ i
+    ptr[i] = nz;
+    // increment number of nonzeros
+    nz += c[i];
+    // also copy p[0..n-1] back into c[0..n-1]
+    c[i] = ptr[i];
+  }
+  // finalize ptr
+  ptr[n] = nz;
+  // return sum (c [0..n-1])
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js
new file mode 100644
index 0000000..437e115
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csDfs.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csDfs = csDfs;
+var _csMarked = require("./csMarked.js");
+var _csMark = require("./csMark.js");
+var _csUnflip = require("./csUnflip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
+ * at nodes in B (see csReach()).
+ *
+ * @param {Number}  j               The starting node for the DFS algorithm
+ * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored
+ * @param {Number}  top             Start index in stack xi[top..n-1]
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+ *
+ * @return {Number}                 New value of top
+ */
+function csDfs(j, g, top, xi, pinv) {
+  // g arrays
+  const index = g._index;
+  const ptr = g._ptr;
+  const size = g._size;
+  // columns
+  const n = size[1];
+  // vars
+  let i, p, p2;
+  // initialize head
+  let head = 0;
+  // initialize the recursion stack
+  xi[0] = j;
+  // loop
+  while (head >= 0) {
+    // get j from the top of the recursion stack
+    j = xi[head];
+    // apply permutation vector
+    const jnew = pinv ? pinv[j] : j;
+    // check node j is marked
+    if (!(0, _csMarked.csMarked)(ptr, j)) {
+      // mark node j as visited
+      (0, _csMark.csMark)(ptr, j);
+      // update stack (last n entries in xi)
+      xi[n + head] = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew]);
+    }
+    // node j done if no unvisited neighbors
+    let done = 1;
+    // examine all neighbors of j, stack (last n entries in xi)
+    for (p = xi[n + head], p2 = jnew < 0 ? 0 : (0, _csUnflip.csUnflip)(ptr[jnew + 1]); p < p2; p++) {
+      // consider neighbor node i
+      i = index[p];
+      // check we have visited node i, skip it
+      if ((0, _csMarked.csMarked)(ptr, i)) {
+        continue;
+      }
+      // pause depth-first search of node j, update stack (last n entries in xi)
+      xi[n + head] = p;
+      // start dfs at node i
+      xi[++head] = i;
+      // node j is not done
+      done = 0;
+      // break, to start dfs(i)
+      break;
+    }
+    // check depth-first search at node j is done
+    if (done) {
+      // remove j from the recursion stack
+      head--;
+      // and place in the output stack
+      xi[--top] = j;
+    }
+  }
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js
new file mode 100644
index 0000000..022fcf5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEreach.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csEreach = csEreach;
+var _csMark = require("./csMark.js");
+var _csMarked = require("./csMarked.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
+ *
+ * @param {Matrix}  a               The A matrix
+ * @param {Number}  k               The kth column in A
+ * @param {Array}   parent          The parent vector from the symbolic analysis result
+ * @param {Array}   w               The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ */
+function csEreach(a, k, parent, w) {
+  // a arrays
+  const aindex = a._index;
+  const aptr = a._ptr;
+  const asize = a._size;
+  // columns
+  const n = asize[1];
+  // initialize top
+  let top = n;
+  // vars
+  let p, p0, p1, len;
+  // mark node k as visited
+  (0, _csMark.csMark)(w, k);
+  // loop values & index for column k
+  for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+    // A(i,k) is nonzero
+    let i = aindex[p];
+    // only use upper triangular part of A
+    if (i > k) {
+      continue;
+    }
+    // traverse up etree
+    for (len = 0; !(0, _csMarked.csMarked)(w, i); i = parent[i]) {
+      // L(k,i) is nonzero, last n entries in w
+      w[n + len++] = i;
+      // mark i as visited
+      (0, _csMark.csMark)(w, i);
+    }
+    while (len > 0) {
+      // decrement top & len
+      --top;
+      --len;
+      // push path onto stack, last n entries in w
+      w[n + top] = w[n + len];
+    }
+  }
+  // unmark all nodes
+  for (p = top; p < n; p++) {
+    // use stack value, last n entries in w
+    (0, _csMark.csMark)(w, w[n + p]);
+  }
+  // unmark node k
+  (0, _csMark.csMark)(w, k);
+  // s[top..n-1] contains pattern of L(k,:)
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js
new file mode 100644
index 0000000..d2b7bda
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csEtree.js
@@ -0,0 +1,77 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csEtree = csEtree;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Computes the elimination tree of Matrix A (using triu(A)) or the
+ * elimination tree of A'A without forming A'A.
+ *
+ * @param {Matrix}  a               The A Matrix
+ * @param {boolean} ata             A value of true the function computes the etree of A'A
+ */
+function csEtree(a, ata) {
+  // check inputs
+  if (!a) {
+    return null;
+  }
+  // a arrays
+  const aindex = a._index;
+  const aptr = a._ptr;
+  const asize = a._size;
+  // rows & columns
+  const m = asize[0];
+  const n = asize[1];
+
+  // allocate result
+  const parent = []; // (n)
+
+  // allocate workspace
+  const w = []; // (n + (ata ? m : 0))
+  const ancestor = 0; // first n entries in w
+  const prev = n; // last m entries (ata = true)
+
+  let i, inext;
+
+  // check we are calculating A'A
+  if (ata) {
+    // initialize workspace
+    for (i = 0; i < m; i++) {
+      w[prev + i] = -1;
+    }
+  }
+  // loop columns
+  for (let k = 0; k < n; k++) {
+    // node k has no parent yet
+    parent[k] = -1;
+    // nor does k have an ancestor
+    w[ancestor + k] = -1;
+    // values in column k
+    for (let p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+      // row
+      const r = aindex[p];
+      // node
+      i = ata ? w[prev + r] : r;
+      // traverse from i to k
+      for (; i !== -1 && i < k; i = inext) {
+        // inext = ancestor of i
+        inext = w[ancestor + i];
+        // path compression
+        w[ancestor + i] = k;
+        // check no anc., parent is k
+        if (inext === -1) {
+          parent[i] = k;
+        }
+      }
+      if (ata) {
+        w[prev + r] = k;
+      }
+    }
+  }
+  return parent;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js
new file mode 100644
index 0000000..6d916d1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFkeep.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csFkeep = csFkeep;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
+ *
+ * @param {Matrix}   a              The sparse matrix
+ * @param {function} callback       The callback function, function will be invoked with the following args:
+ *                                    - The entry row
+ *                                    - The entry column
+ *                                    - The entry value
+ *                                    - The state parameter
+ * @param {any}      other          The state
+ *
+ * @return                          The number of nonzero elements in the matrix
+ */
+function csFkeep(a, callback, other) {
+  // a arrays
+  const avalues = a._values;
+  const aindex = a._index;
+  const aptr = a._ptr;
+  const asize = a._size;
+  // columns
+  const n = asize[1];
+  // nonzero items
+  let nz = 0;
+  // loop columns
+  for (let j = 0; j < n; j++) {
+    // get current location of col j
+    let p = aptr[j];
+    // record new location of col j
+    aptr[j] = nz;
+    for (; p < aptr[j + 1]; p++) {
+      // check we need to keep this item
+      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {
+        // keep A(i,j)
+        aindex[nz] = aindex[p];
+        // check we need to process values (pattern only)
+        if (avalues) {
+          avalues[nz] = avalues[p];
+        }
+        // increment nonzero items
+        nz++;
+      }
+    }
+  }
+  // finalize A
+  aptr[n] = nz;
+  // trim arrays
+  aindex.splice(nz, aindex.length - nz);
+  // check we need to process values (pattern only)
+  if (avalues) {
+    avalues.splice(nz, avalues.length - nz);
+  }
+  // return number of nonzero items
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js
new file mode 100644
index 0000000..bcc13a5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csFlip.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csFlip = csFlip;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * This function "flips" its input about the integer -1.
+ *
+ * @param {Number}  i               The value to flip
+ */
+function csFlip(i) {
+  // flip the value
+  return -i - 2;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js
new file mode 100644
index 0000000..0d63ef9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csIpvec.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csIpvec = csIpvec;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
+ *
+ * @param {Array} p           The permutation vector of length n. null value denotes identity
+ * @param {Array} b           The input vector
+ *
+ * @return {Array}            The output vector x = P'b
+ */
+function csIpvec(p, b) {
+  // vars
+  let k;
+  const n = b.length;
+  const x = [];
+  // check permutation vector was provided, p = null denotes identity
+  if (p) {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // apply permutation
+      x[p[k]] = b[k];
+    }
+  } else {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // x[i] = b[i]
+      x[k] = b[k];
+    }
+  }
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js
new file mode 100644
index 0000000..4e4d93b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLeaf.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csLeaf = csLeaf;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * This function determines if j is a leaf of the ith row subtree.
+ * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
+ *
+ * @param {Number}  i               The ith row subtree
+ * @param {Number}  j               The node to test
+ * @param {Array}   w               The workspace array
+ * @param {Number}  first           The index offset within the workspace for the first array
+ * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array
+ * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array
+ * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
+ *
+ * @return {Object}
+ */
+function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
+  let s, sparent;
+
+  // our result
+  let jleaf = 0;
+  let q;
+
+  // check j is a leaf
+  if (i <= j || w[first + j] <= w[maxfirst + i]) {
+    return -1;
+  }
+  // update max first[j] seen so far
+  w[maxfirst + i] = w[first + j];
+  // jprev = previous leaf of ith subtree
+  const jprev = w[prevleaf + i];
+  w[prevleaf + i] = j;
+
+  // check j is first or subsequent leaf
+  if (jprev === -1) {
+    // 1st leaf, q = root of ith subtree
+    jleaf = 1;
+    q = i;
+  } else {
+    // update jleaf
+    jleaf = 2;
+    // q = least common ancester (jprev,j)
+    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]);
+    for (s = jprev; s !== q; s = sparent) {
+      // path compression
+      sparent = w[ancestor + s];
+      w[ancestor + s] = q;
+    }
+  }
+  return {
+    jleaf,
+    q
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js
new file mode 100644
index 0000000..e74ca25
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csLu.js
@@ -0,0 +1,188 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsLu = void 0;
+var _factory = require("../../../utils/factory.js");
+var _csSpsolve = require("./csSpsolve.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csLu';
+const dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+const createCsLu = exports.createCsLu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  const csSpsolve = (0, _csSpsolve.createCsSpsolve)({
+    divideScalar,
+    multiply,
+    subtract
+  });
+
+  /**
+   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization
+   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L
+   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so
+   * L * U = A(p, q), where p is the inverse of pinv.
+   *
+   * @param {Matrix}  m               The A Matrix to factorize
+   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing
+   *                                  column ordering q
+   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Number}                 The numeric LU factorization of A or null
+   */
+  return function csLu(m, s, tol) {
+    // validate input
+    if (!m) {
+      return null;
+    }
+    // m arrays
+    const size = m._size;
+    // columns
+    const n = size[1];
+    // symbolic analysis result
+    let q;
+    let lnz = 100;
+    let unz = 100;
+    // update symbolic analysis parameters
+    if (s) {
+      q = s.q;
+      lnz = s.lnz || lnz;
+      unz = s.unz || unz;
+    }
+    // L arrays
+    const lvalues = []; // (lnz)
+    const lindex = []; // (lnz)
+    const lptr = []; // (n + 1)
+    // L
+    const L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    });
+    // U arrays
+    const uvalues = []; // (unz)
+    const uindex = []; // (unz)
+    const uptr = []; // (n + 1)
+    // U
+    const U = new SparseMatrix({
+      values: uvalues,
+      index: uindex,
+      ptr: uptr,
+      size: [n, n]
+    });
+    // inverse of permutation vector
+    const pinv = []; // (n)
+    // vars
+    let i, p;
+    // allocate arrays
+    const x = []; // (n)
+    const xi = []; // (2 * n)
+    // initialize variables
+    for (i = 0; i < n; i++) {
+      // clear workspace
+      x[i] = 0;
+      // no rows pivotal yet
+      pinv[i] = -1;
+      // no cols of L yet
+      lptr[i + 1] = 0;
+    }
+    // reset number of nonzero elements in L and U
+    lnz = 0;
+    unz = 0;
+    // compute L(:,k) and U(:,k)
+    for (let k = 0; k < n; k++) {
+      // update ptr
+      lptr[k] = lnz;
+      uptr[k] = unz;
+      // apply column permutations if needed
+      const col = q ? q[k] : k;
+      // solve triangular system, x = L\A(:,col)
+      const top = csSpsolve(L, m, col, xi, x, pinv, 1);
+      // find pivot
+      let ipiv = -1;
+      let a = -1;
+      // loop xi[] from top -> n
+      for (p = top; p < n; p++) {
+        // x[i] is nonzero
+        i = xi[p];
+        // check row i is not yet pivotal
+        if (pinv[i] < 0) {
+          // absolute value of x[i]
+          const xabs = abs(x[i]);
+          // check absoulte value is greater than pivot value
+          if (larger(xabs, a)) {
+            // largest pivot candidate so far
+            a = xabs;
+            ipiv = i;
+          }
+        } else {
+          // x(i) is the entry U(pinv[i],k)
+          uindex[unz] = pinv[i];
+          uvalues[unz++] = x[i];
+        }
+      }
+      // validate we found a valid pivot
+      if (ipiv === -1 || a <= 0) {
+        return null;
+      }
+      // update actual pivot column, give preference to diagonal value
+      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {
+        ipiv = col;
+      }
+      // the chosen pivot
+      const pivot = x[ipiv];
+      // last entry in U(:,k) is U(k,k)
+      uindex[unz] = k;
+      uvalues[unz++] = pivot;
+      // ipiv is the kth pivot row
+      pinv[ipiv] = k;
+      // first entry in L(:,k) is L(k,k) = 1
+      lindex[lnz] = ipiv;
+      lvalues[lnz++] = 1;
+      // L(k+1:n,k) = x / pivot
+      for (p = top; p < n; p++) {
+        // row
+        i = xi[p];
+        // check x(i) is an entry in L(:,k)
+        if (pinv[i] < 0) {
+          // save unpermuted row in L
+          lindex[lnz] = i;
+          // scale pivot column
+          lvalues[lnz++] = divideScalar(x[i], pivot);
+        }
+        // x[0..n-1] = 0 for next k
+        x[i] = 0;
+      }
+    }
+    // update ptr
+    lptr[n] = lnz;
+    uptr[n] = unz;
+    // fix row indices of L for final pinv
+    for (p = 0; p < lnz; p++) {
+      lindex[p] = pinv[lindex[p]];
+    }
+    // trim arrays
+    lvalues.splice(lnz, lvalues.length - lnz);
+    lindex.splice(lnz, lindex.length - lnz);
+    uvalues.splice(unz, uvalues.length - unz);
+    uindex.splice(unz, uindex.length - unz);
+    // return LU factor
+    return {
+      L,
+      U,
+      pinv
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js
new file mode 100644
index 0000000..7845048
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMark.js
@@ -0,0 +1,21 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csMark = csMark;
+var _csFlip = require("./csFlip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Marks the node at w[j]
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ */
+function csMark(w, j) {
+  // mark w[j]
+  w[j] = (0, _csFlip.csFlip)(w[j]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js
new file mode 100644
index 0000000..0c61e7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csMarked.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csMarked = csMarked;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Checks if the node at w[j] is marked
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ */
+function csMarked(w, j) {
+  // check node is marked
+  return w[j] < 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js
new file mode 100644
index 0000000..abd5e7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPermute.js
@@ -0,0 +1,67 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csPermute = csPermute;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Permutes a sparse matrix C = P * A * Q
+ *
+ * @param {SparseMatrix}  a         The Matrix A
+ * @param {Array}   pinv            The row permutation vector
+ * @param {Array}   q               The column permutation vector
+ * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise
+ *
+ * @return {Matrix}                 C = P * A * Q, null on error
+ */
+function csPermute(a, pinv, q, values) {
+  // a arrays
+  const avalues = a._values;
+  const aindex = a._index;
+  const aptr = a._ptr;
+  const asize = a._size;
+  const adt = a._datatype;
+  // rows & columns
+  const m = asize[0];
+  const n = asize[1];
+  // c arrays
+  const cvalues = values && a._values ? [] : null;
+  const cindex = []; // (aptr[n])
+  const cptr = []; // (n + 1)
+  // initialize vars
+  let nz = 0;
+  // loop columns
+  for (let k = 0; k < n; k++) {
+    // column k of C is column q[k] of A
+    cptr[k] = nz;
+    // apply column permutation
+    const j = q ? q[k] : k;
+    // loop values in column j of A
+    for (let t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {
+      // row i of A is row pinv[i] of C
+      const r = pinv ? pinv[aindex[t]] : aindex[t];
+      // index
+      cindex[nz] = r;
+      // check we need to populate values
+      if (cvalues) {
+        cvalues[nz] = avalues[t];
+      }
+      // increment number of nonzero elements
+      nz++;
+    }
+  }
+  // finalize the last column of C
+  cptr[n] = nz;
+  // return C matrix
+  return a.createSparseMatrix({
+    values: cvalues,
+    index: cindex,
+    ptr: cptr,
+    size: [m, n],
+    datatype: adt
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js
new file mode 100644
index 0000000..384e72b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csPost.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csPost = csPost;
+var _csTdfs = require("./csTdfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Post order a tree of forest
+ *
+ * @param {Array}   parent          The tree or forest
+ * @param {Number}  n               Number of columns
+ */
+function csPost(parent, n) {
+  // check inputs
+  if (!parent) {
+    return null;
+  }
+  // vars
+  let k = 0;
+  let j;
+  // allocate result
+  const post = []; // (n)
+  // workspace, head: first n entries, next: next n entries, stack: last n entries
+  const w = []; // (3 * n)
+  const head = 0;
+  const next = n;
+  const stack = 2 * n;
+  // initialize workspace
+  for (j = 0; j < n; j++) {
+    // empty linked lists
+    w[head + j] = -1;
+  }
+  // traverse nodes in reverse order
+  for (j = n - 1; j >= 0; j--) {
+    // check j is a root
+    if (parent[j] === -1) {
+      continue;
+    }
+    // add j to list of its parent
+    w[next + j] = w[head + parent[j]];
+    w[head + parent[j]] = j;
+  }
+  // loop nodes
+  for (j = 0; j < n; j++) {
+    // skip j if it is not a root
+    if (parent[j] !== -1) {
+      continue;
+    }
+    // depth-first search
+    k = (0, _csTdfs.csTdfs)(j, k, w, head, next, post, stack);
+  }
+  return post;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js
new file mode 100644
index 0000000..2975d6d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csReach.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csReach = csReach;
+var _csMarked = require("./csMarked.js");
+var _csMark = require("./csMark.js");
+var _csDfs = require("./csDfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
+ * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
+ * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
+ *
+ * @param {Matrix}  g               The G matrix
+ * @param {Matrix}  b               The B matrix
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ */
+function csReach(g, b, k, xi, pinv) {
+  // g arrays
+  const gptr = g._ptr;
+  const gsize = g._size;
+  // b arrays
+  const bindex = b._index;
+  const bptr = b._ptr;
+  // columns
+  const n = gsize[1];
+  // vars
+  let p, p0, p1;
+  // initialize top
+  let top = n;
+  // loop column indeces in B
+  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+    // node i
+    const i = bindex[p];
+    // check node i is marked
+    if (!(0, _csMarked.csMarked)(gptr, i)) {
+      // start a dfs at unmarked node i
+      top = (0, _csDfs.csDfs)(i, g, top, xi, pinv);
+    }
+  }
+  // loop columns from top -> n - 1
+  for (p = top; p < n; p++) {
+    // restore G
+    (0, _csMark.csMark)(gptr, xi[p]);
+  }
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js
new file mode 100644
index 0000000..3e45875
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSpsolve.js
@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSpsolve = void 0;
+var _csReach = require("./csReach.js");
+var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csSpsolve';
+const dependencies = ['divideScalar', 'multiply', 'subtract'];
+const createCsSpsolve = exports.createCsSpsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    divideScalar,
+    multiply,
+    subtract
+  } = _ref;
+  /**
+   * The function csSpsolve() computes the solution to G * x = bk, where bk is the
+   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the
+   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U
+   * is upper triangular with the diagonal entry as the last entry in each column.
+   *
+   * @param {Matrix}  g               The G matrix
+   * @param {Matrix}  b               The B matrix
+   * @param {Number}  k               The kth column in B
+   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+   *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+   * @param {Array}   x               The soluton to the linear system G * x = b
+   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+   * @param {boolean} lo              The lower (true) upper triangular (false) flag
+   *
+   * @return {Number}                 The index for the nonzero pattern
+   */
+  return function csSpsolve(g, b, k, xi, x, pinv, lo) {
+    // g arrays
+    const gvalues = g._values;
+    const gindex = g._index;
+    const gptr = g._ptr;
+    const gsize = g._size;
+    // columns
+    const n = gsize[1];
+    // b arrays
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    // vars
+    let p, p0, p1, q;
+    // xi[top..n-1] = csReach(B(:,k))
+    const top = (0, _csReach.csReach)(g, b, k, xi, pinv);
+    // clear x
+    for (p = top; p < n; p++) {
+      x[xi[p]] = 0;
+    }
+    // scatter b
+    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+      x[bindex[p]] = bvalues[p];
+    }
+    // loop columns
+    for (let px = top; px < n; px++) {
+      // x array index for px
+      const j = xi[px];
+      // apply permutation vector (U x = b), j maps to column J of G
+      const J = pinv ? pinv[j] : j;
+      // check column J is empty
+      if (J < 0) {
+        continue;
+      }
+      // column value indeces in G, p0 <= p < p1
+      p0 = gptr[J];
+      p1 = gptr[J + 1];
+      // x(j) /= G(j,j)
+      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]);
+      // first entry L(j,j)
+      p = lo ? p0 + 1 : p0;
+      q = lo ? p1 : p1 - 1;
+      // loop
+      for (; p < q; p++) {
+        // row
+        const i = gindex[p];
+        // x(i) -= G(i,j) * x(j)
+        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));
+      }
+    }
+    // return top of stack
+    return top;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js
new file mode 100644
index 0000000..a6bbaa1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSqr.js
@@ -0,0 +1,186 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSqr = void 0;
+var _csPermute = require("./csPermute.js");
+var _csPost = require("./csPost.js");
+var _csEtree = require("./csEtree.js");
+var _csAmd = require("./csAmd.js");
+var _csCounts = require("./csCounts.js");
+var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csSqr';
+const dependencies = ['add', 'multiply', 'transpose'];
+const createCsSqr = exports.createCsSqr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  const csAmd = (0, _csAmd.createCsAmd)({
+    add,
+    multiply,
+    transpose
+  });
+  const csCounts = (0, _csCounts.createCsCounts)({
+    transpose
+  });
+
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   */
+  return function csSqr(order, a, qr) {
+    // a arrays
+    const aptr = a._ptr;
+    const asize = a._size;
+    // columns
+    const n = asize[1];
+    // vars
+    let k;
+    // symbolic analysis result
+    const s = {};
+    // fill-reducing ordering
+    s.q = csAmd(order, a);
+    // validate results
+    if (order && !s.q) {
+      return null;
+    }
+    // QR symbolic analysis
+    if (qr) {
+      // apply permutations if needed
+      const c = order ? (0, _csPermute.csPermute)(a, null, s.q, 0) : a;
+      // etree of C'*C, where C=A(:,q)
+      s.parent = (0, _csEtree.csEtree)(c, 1);
+      // post order elimination tree
+      const post = (0, _csPost.csPost)(s.parent, n);
+      // col counts chol(C'*C)
+      s.cp = csCounts(c, s.parent, post, 1);
+      // check we have everything needed to calculate number of nonzero elements
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    }
+    // return result S
+    return s;
+  };
+
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+  function _vcount(a, s) {
+    // a arrays
+    const aptr = a._ptr;
+    const aindex = a._index;
+    const asize = a._size;
+    // rows & columns
+    const m = asize[0];
+    const n = asize[1];
+    // initialize s arrays
+    s.pinv = []; // (m + n)
+    s.leftmost = []; // (m)
+    // vars
+    const parent = s.parent;
+    const pinv = s.pinv;
+    const leftmost = s.leftmost;
+    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+    const w = []; // (m + 3 * n)
+    const next = 0;
+    const head = m;
+    const tail = m + n;
+    const nque = m + 2 * n;
+    // vars
+    let i, k, p, p0, p1;
+    // initialize w
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    }
+    // initialize row arrays
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    }
+    // loop columns backwards
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    }
+    // scan rows in reverse order
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i];
+      // check row i is empty
+      if (k === -1) {
+        continue;
+      }
+      // first row in queue k
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      }
+      // put i at head of queue k
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+    s.lnz = 0;
+    s.m2 = m;
+    // find row permutation and nnz(V)
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k];
+      // count V(k,k) as nonzero
+      s.lnz++;
+      // add a fictitious row
+      if (i < 0) {
+        i = s.m2++;
+      }
+      // associate row i with V(:,k)
+      pinv[i] = k;
+      // skip if V(k+1:m,k) is empty
+      if (--nque[k] <= 0) {
+        continue;
+      }
+      // nque[k] is nnz (V(k+1:m,k))
+      s.lnz += w[nque + k];
+      // move all rows to parent of k
+      const pa = parent[k];
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+    return true;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js
new file mode 100644
index 0000000..9f435f5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csSymperm.js
@@ -0,0 +1,100 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsSymperm = void 0;
+var _csCumsum = require("./csCumsum.js");
+var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+const name = 'csSymperm';
+const dependencies = ['conj', 'SparseMatrix'];
+const createCsSymperm = exports.createCsSymperm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    conj,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const asize = a._size;
+    // columns
+    const n = asize[1];
+    // C matrix arrays
+    const cvalues = values && avalues ? [] : null;
+    const cindex = []; // (nz)
+    const cptr = []; // (n + 1)
+    // variables
+    let i, i2, j, j2, p, p0, p1;
+    // create workspace vector
+    const w = []; // (n)
+    // count entries in each column of C
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // column count of C
+        w[Math.max(i2, j2)]++;
+      }
+    }
+    // compute column pointers of C
+    (0, _csCumsum.csCumsum)(cptr, w, n);
+    // loop columns
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // C index for column j2
+        const q = w[Math.max(i2, j2)]++;
+        // update C index for entry q
+        cindex[q] = Math.min(i2, j2);
+        // check we need to process values
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    }
+    // return C matrix
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js
new file mode 100644
index 0000000..b1fa1aa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csTdfs.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csTdfs = csTdfs;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ */
+function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  let top = 0;
+  // place j on the stack
+  w[stack] = j;
+  // while (stack is not empty)
+  while (top >= 0) {
+    // p = top of stack
+    const p = w[stack + top];
+    // i = youngest child of p
+    const i = w[head + p];
+    if (i === -1) {
+      // p has no unordered children left
+      top--;
+      // node p is the kth postordered node
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i];
+      // increment top
+      ++top;
+      // start dfs on child node i
+      w[stack + top] = i;
+    }
+  }
+  return k;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js
new file mode 100644
index 0000000..31c0304
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sparse/csUnflip.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.csUnflip = csUnflip;
+var _csFlip = require("./csFlip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Flips the value if it is negative of returns the same value otherwise.
+ *
+ * @param {Number}  i               The value to flip
+ */
+function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? (0, _csFlip.csFlip)(i) : i;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/sylvester.js b/node_modules/mathjs/lib/cjs/function/algebra/sylvester.js
new file mode 100644
index 0000000..bf6e311
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/sylvester.js
@@ -0,0 +1,124 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSylvester = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'sylvester';
+const dependencies = ['typed', 'schur', 'matrixFromColumns', 'matrix', 'multiply', 'range', 'concat', 'transpose', 'index', 'subset', 'add', 'subtract', 'identity', 'lusolve', 'abs'];
+const createSylvester = exports.createSylvester = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    schur,
+    matrixFromColumns,
+    matrix,
+    multiply,
+    range,
+    concat,
+    transpose,
+    index,
+    subset,
+    add,
+    subtract,
+    identity,
+    lusolve,
+    abs
+  } = _ref;
+  /**
+   *
+   * Solves the real-valued Sylvester equation AX+XB=C for X, where A, B and C are
+   * matrices of appropriate dimensions, being A and B squared. Notice that other
+   * equivalent definitions for the Sylvester equation exist and this function
+   * assumes the one presented in the original publication of the the Bartels-
+   * Stewart algorithm, which is implemented by this function.
+   * https://en.wikipedia.org/wiki/Sylvester_equation
+   *
+   * Syntax:
+   *
+   *     math.sylvester(A, B, C)
+   *
+   * Examples:
+   *
+   *     const A = [[-1, -2], [1, 1]]
+   *     const B = [[2, -1], [1, -2]]
+   *     const C = [[-3, 2], [3, 0]]
+   *     math.sylvester(A, B, C)      // returns DenseMatrix [[-0.25, 0.25], [1.5, -1.25]]
+   *
+   * See also:
+   *
+   *     schur, lyap
+   *
+   * @param {Matrix | Array} A  Matrix A
+   * @param {Matrix | Array} B  Matrix B
+   * @param {Matrix | Array} C  Matrix C
+   * @return {Matrix | Array}   Matrix X, solving the Sylvester equation
+   */
+  return typed(name, {
+    'Matrix, Matrix, Matrix': _sylvester,
+    'Array, Matrix, Matrix': function (A, B, C) {
+      return _sylvester(matrix(A), B, C);
+    },
+    'Array, Array, Matrix': function (A, B, C) {
+      return _sylvester(matrix(A), matrix(B), C);
+    },
+    'Array, Matrix, Array': function (A, B, C) {
+      return _sylvester(matrix(A), B, matrix(C));
+    },
+    'Matrix, Array, Matrix': function (A, B, C) {
+      return _sylvester(A, matrix(B), C);
+    },
+    'Matrix, Array, Array': function (A, B, C) {
+      return _sylvester(A, matrix(B), matrix(C));
+    },
+    'Matrix, Matrix, Array': function (A, B, C) {
+      return _sylvester(A, B, matrix(C));
+    },
+    'Array, Array, Array': function (A, B, C) {
+      return _sylvester(matrix(A), matrix(B), matrix(C)).toArray();
+    }
+  });
+  function _sylvester(A, B, C) {
+    const n = B.size()[0];
+    const m = A.size()[0];
+    const sA = schur(A);
+    const F = sA.T;
+    const U = sA.U;
+    const sB = schur(multiply(-1, B));
+    const G = sB.T;
+    const V = sB.U;
+    const D = multiply(multiply(transpose(U), C), V);
+    const all = range(0, m);
+    const y = [];
+    const hc = (a, b) => concat(a, b, 1);
+    const vc = (a, b) => concat(a, b, 0);
+    for (let k = 0; k < n; k++) {
+      if (k < n - 1 && abs(subset(G, index(k + 1, k))) > 1e-5) {
+        let RHS = vc(subset(D, index(all, k)), subset(D, index(all, k + 1)));
+        for (let j = 0; j < k; j++) {
+          RHS = add(RHS, vc(multiply(y[j], subset(G, index(j, k))), multiply(y[j], subset(G, index(j, k + 1)))));
+        }
+        const gkk = multiply(identity(m), multiply(-1, subset(G, index(k, k))));
+        const gmk = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k))));
+        const gkm = multiply(identity(m), multiply(-1, subset(G, index(k, k + 1))));
+        const gmm = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k + 1))));
+        const LHS = vc(hc(add(F, gkk), gmk), hc(gkm, add(F, gmm)));
+        const yAux = lusolve(LHS, RHS);
+        y[k] = yAux.subset(index(range(0, m), 0));
+        y[k + 1] = yAux.subset(index(range(m, 2 * m), 0));
+        k++;
+      } else {
+        let RHS = subset(D, index(all, k));
+        for (let j = 0; j < k; j++) {
+          RHS = add(RHS, multiply(y[j], subset(G, index(j, k))));
+        }
+        const gkk = subset(G, index(k, k));
+        const LHS = subtract(F, multiply(gkk, identity(m)));
+        y[k] = lusolve(LHS, RHS);
+      }
+    }
+    const Y = matrix(matrixFromColumns(...y));
+    const X = multiply(U, multiply(Y, transpose(V)));
+    return X;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..30434b3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/algebra/symbolicEqual.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSymbolicEqual = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'symbolicEqual';
+const dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+const createSymbolicEqual = exports.createSymbolicEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    parse,
+    simplify,
+    typed,
+    OperatorNode
+  } = _ref;
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *     math.symbolicEqual(expr1, expr2)
+   *     math.symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *     math.symbolicEqual('x*y', 'y*x') // Returns true
+   *     math.symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false
+   *     math.symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true
+   *     math.symbolicEqual('abs(x)','x') // Returns false
+   *     math.symbolicEqual('abs(x)','x', simplify.positiveContext) // Returns true
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  function _symbolicEqual(e1, e2) {
+    let options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+    const diff = new OperatorNode('-', 'subtract', [e1, e2]);
+    const simplified = simplify(diff, {}, options);
+    return (0, _is.isConstantNode)(simplified) && !simplified.value;
+  }
+  return typed(name, {
+    'Node, Node': _symbolicEqual,
+    'Node, Node, Object': _symbolicEqual
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js b/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js
new file mode 100644
index 0000000..dd1a1f0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/abs.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAbs = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _index = require("../../plain/number/index.js");
+const name = 'abs';
+const dependencies = ['typed'];
+const createAbs = exports.createAbs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: _index.absNumber,
+    'Complex | BigNumber | Fraction | Unit': x => x.abs(),
+    bigint: x => x < 0n ? -x : x,
+    // deep map collection, skip zeros since abs(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self, true))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/add.js b/node_modules/mathjs/lib/cjs/function/arithmetic/add.js
new file mode 100644
index 0000000..578e020
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/add.js
@@ -0,0 +1,89 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAdd = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo04xSidSid = require("../../type/matrix/utils/matAlgo04xSidSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'add';
+const dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];
+const createAdd = exports.createAdd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    addScalar,
+    equalScalar,
+    DenseMatrix,
+    SparseMatrix,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  /**
+   * Add two or more values, `x + y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.add(x, y)
+   *    math.add(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.add(2, 3)               // returns number 5
+   *    math.add(2, 3, 4)            // returns number 9
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(-4, 1)
+   *    math.add(a, b)               // returns Complex -2 + 4i
+   *
+   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   *    const c = math.unit('5 cm')
+   *    const d = math.unit('2.1 mm')
+   *    math.add(c, d)               // returns Unit 52.1 mm
+   *
+   *    math.add("2.3", "4")         // returns number 6.3
+   *
+   * See also:
+   *
+   *    subtract, sum
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
+  return typed(name, {
+    'any, any': addScalar,
+    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {
+      let result = self(x, y);
+      for (let i = 0; i < rest.length; i++) {
+        result = self(result, rest[i]);
+      }
+      return result;
+    })
+  }, matrixAlgorithmSuite({
+    elop: addScalar,
+    DS: matAlgo01xDSid,
+    SS: matAlgo04xSidSid,
+    Ss: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js
new file mode 100644
index 0000000..4bfc050
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/addScalar.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAddScalar = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'addScalar';
+const dependencies = ['typed'];
+const createAddScalar = exports.createAddScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Add two scalar values, `x + y`.
+   * This function is meant for internal use: it is used by the public function
+   * `add`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to add
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to add
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Sum of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': _index.addNumber,
+    'Complex, Complex': function (x, y) {
+      return x.add(y);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return x.plus(y);
+    },
+    'bigint, bigint': function (x, y) {
+      return x + y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return x.add(y);
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (x.value === null || x.value === undefined) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+      if (y.value === null || y.value === undefined) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      const res = x.clone();
+      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..63d962b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/cbrt.js
@@ -0,0 +1,137 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCbrt = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _index = require("../../plain/number/index.js");
+const name = 'cbrt';
+const dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
+const createCbrt = exports.createCbrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    config,
+    typed,
+    isNegative,
+    unaryMinus,
+    matrix,
+    Complex,
+    BigNumber,
+    Fraction
+  } = _ref;
+  /**
+   * Calculate the cubic root of a value.
+   *
+   * To avoid confusion with the matrix cube root, this function does not
+   * apply to matrices. For a matrix, to take the cube root elementwise,
+   * see the examples.
+   *
+   * Syntax:
+   *
+   *    math.cbrt(x)
+   *    math.cbrt(x, allRoots)
+   *
+   * Examples:
+   *
+   *    math.cbrt(27)                  // returns 3
+   *    math.cube(3)                   // returns 27
+   *    math.cbrt(-64)                 // returns -4
+   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
+   *    math.map([27, 64, 125], x => math.cbrt(x))       // returns [3, 4, 5]
+   *
+   *    const x = math.complex('8i')
+   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i
+   *    math.cbrt(x, true)             // returns Matrix [
+   *                                    //    1.7320508075689 + i
+   *                                    //   -1.7320508075689 + i
+   *                                    //   -2i
+   *                                    // ]
+   *
+   * See also:
+   *
+   *    square, sqrt, cube
+   *
+   * @param {number | BigNumber | Complex | Unit} x
+   *            Value for which to calculate the cubic root.
+   * @param {boolean} [allRoots]  Optional, false by default. Only applicable
+   *            when `x` is a number or complex number. If true, all complex
+   *            roots are returned, if false (default) the principal root is
+   *            returned.
+   * @return {number | BigNumber | Complex | Unit}
+   *            Returns the cubic root of `x`
+   */
+  return typed(name, {
+    number: _index.cbrtNumber,
+    // note: signature 'number, boolean' is also supported,
+    //       created by typed as it knows how to convert number to Complex
+
+    Complex: _cbrtComplex,
+    'Complex, boolean': _cbrtComplex,
+    BigNumber: function (x) {
+      return x.cbrt();
+    },
+    Unit: _cbrtUnit
+  });
+
+  /**
+   * Calculate the cubic root for a complex number
+   * @param {Complex} x
+   * @param {boolean} [allRoots]   If true, the function will return an array
+   *                               with all three roots. If false or undefined,
+   *                               the principal root is returned.
+   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
+   * @private
+   */
+  function _cbrtComplex(x, allRoots) {
+    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers
+
+    const arg3 = x.arg() / 3;
+    const abs = x.abs();
+
+    // principal root:
+    const principal = new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3).exp());
+    if (allRoots) {
+      const all = [principal, new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex((0, _index.cbrtNumber)(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
+      return config.matrix === 'Array' ? all : matrix(all);
+    } else {
+      return principal;
+    }
+  }
+
+  /**
+   * Calculate the cubic root for a Unit
+   * @param {Unit} x
+   * @return {Unit} Returns the cubic root of x
+   * @private
+   */
+  function _cbrtUnit(x) {
+    if (x.value && (0, _is.isComplex)(x.value)) {
+      let result = x.clone();
+      result.value = 1.0;
+      result = result.pow(1.0 / 3); // Compute the units
+      result.value = _cbrtComplex(x.value); // Compute the value
+      return result;
+    } else {
+      const negate = isNegative(x.value);
+      if (negate) {
+        x.value = unaryMinus(x.value);
+      }
+
+      // TODO: create a helper function for this
+      let third;
+      if ((0, _is.isBigNumber)(x.value)) {
+        third = new BigNumber(1).div(3);
+      } else if ((0, _is.isFraction)(x.value)) {
+        third = new Fraction(1, 3);
+      } else {
+        third = 1 / 3;
+      }
+      const result = x.pow(third);
+      if (negate) {
+        result.value = unaryMinus(result.value);
+      }
+      return result;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..20cdecf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/ceil.js
@@ -0,0 +1,195 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCeilNumber = exports.createCeil = void 0;
+var _decimal = _interopRequireDefault(require("decimal.js"));
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+const name = 'ceil';
+const dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+const bigTen = new _decimal.default(10);
+const createCeilNumber = exports.createCeilNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', 'round'], _ref => {
+  let {
+    typed,
+    config,
+    round
+  } = _ref;
+  function _ceilNumber(x) {
+    // See ./floor.js _floorNumber for rationale here
+    const c = Math.ceil(x);
+    const r = round(x);
+    if (c === r) return c;
+    if ((0, _number.nearlyEqual)(x, r, config.relTol, config.absTol) && !(0, _number.nearlyEqual)(x, c, config.relTol, config.absTol)) {
+      return r;
+    }
+    return c;
+  }
+  return typed(name, {
+    number: _ceilNumber,
+    'number, number': function (x, n) {
+      if (!(0, _number.isInteger)(n)) {
+        throw new RangeError('number of decimals in function ceil must be an integer');
+      }
+      if (n < 0 || n > 15) {
+        throw new RangeError('number of decimals in ceil number must be in range 0-15');
+      }
+      const shift = 10 ** n;
+      return _ceilNumber(x * shift) / shift;
+    }
+  });
+});
+const createCeil = exports.createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref2 => {
+  let {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const ceilNumber = createCeilNumber({
+    typed,
+    config,
+    round
+  });
+  function _bigCeil(x) {
+    // see ./floor.js _floorNumber for rationale
+    const bne = (a, b) => (0, _nearlyEqual.nearlyEqual)(a, b, config.relTol, config.absTol);
+    const c = x.ceil();
+    const r = round(x);
+    if (c.eq(r)) return c;
+    if (bne(x, r) && !bne(x, c)) return r;
+    return c;
+  }
+  /**
+   * Round a value towards plus infinity
+   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.ceil(x)
+   *    math.ceil(x, n)
+   *    math.ceil(unit, valuelessUnit)
+   *    math.ceil(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.ceil(3.2)               // returns number 4
+   *    math.ceil(3.8)               // returns number 4
+   *    math.ceil(-4.2)              // returns number -4
+   *    math.ceil(-4.7)              // returns number -4
+   *
+   *    math.ceil(3.212, 2)          // returns number 3.22
+   *    math.ceil(3.288, 2)          // returns number 3.29
+   *    math.ceil(-4.212, 2)         // returns number -4.21
+   *    math.ceil(-4.782, 2)         // returns number -4.78
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.ceil(c)                 // returns Complex 4 - 2i
+   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.ceil(unit, 1, cm)      // returns Unit 3.3 cm
+   *    math.ceil(unit, 1, mm)      // returns Unit 32.5 mm
+   *
+   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]
+   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]
+   *
+   * See also:
+   *
+   *    floor, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('ceil', {
+    number: ceilNumber.signatures.number,
+    'number,number': ceilNumber.signatures['number,number'],
+    Complex: function (x) {
+      return x.ceil();
+    },
+    'Complex, number': function (x, n) {
+      return x.ceil(n);
+    },
+    'Complex, BigNumber': function (x, n) {
+      return x.ceil(n.toNumber());
+    },
+    BigNumber: _bigCeil,
+    'BigNumber, BigNumber': function (x, n) {
+      const shift = bigTen.pow(n);
+      return _bigCeil(x.mul(shift)).div(shift);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function (x) {
+      return x.ceil();
+    },
+    'Fraction, number': function (x, n) {
+      return x.ceil(n);
+    },
+    'Fraction, BigNumber': function (x, n) {
+      return x.ceil(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      const valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, self, true);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, i => self(i, n), true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js b/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js
new file mode 100644
index 0000000..e28c103
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/cube.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCube = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'cube';
+const dependencies = ['typed'];
+const createCube = exports.createCube = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the cube of a value, `x * x * x`.
+   * To avoid confusion with `pow(M,3)`, this function does not apply to matrices.
+   * If you wish to cube every entry of a matrix, see the examples.
+   *
+   * Syntax:
+   *
+   *    math.cube(x)
+   *
+   * Examples:
+   *
+   *    math.cube(2)            // returns number 8
+   *    math.pow(2, 3)          // returns number 8
+   *    math.cube(4)            // returns number 64
+   *    4 * 4 * 4               // returns number 64
+   *
+   *    math.map([1, 2, 3, 4], math.cube) // returns Array [1, 8, 27, 64]
+   *
+   * See also:
+   *
+   *    multiply, square, pow, cbrt
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x  Number for which to calculate the cube
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit} Cube of x
+   */
+  return typed(name, {
+    number: _index.cubeNumber,
+    Complex: function (x) {
+      return x.mul(x).mul(x); // Is faster than pow(x, 3)
+    },
+    BigNumber: function (x) {
+      return x.times(x).times(x);
+    },
+    bigint: function (x) {
+      return x * x * x;
+    },
+    Fraction: function (x) {
+      return x.pow(3); // Is faster than mul()mul()mul()
+    },
+    Unit: function (x) {
+      return x.pow(3);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js b/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js
new file mode 100644
index 0000000..22829ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/divide.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDivide = void 0;
+var _factory = require("../../utils/factory.js");
+var _object = require("../../utils/object.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+const name = 'divide';
+const dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];
+const createDivide = exports.createDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    multiply,
+    equalScalar,
+    divideScalar,
+    inv
+  } = _ref;
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+
+  /**
+   * Divide two values, `x / y`.
+   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
+   *
+   * Syntax:
+   *
+   *    math.divide(x, y)
+   *
+   * Examples:
+   *
+   *    math.divide(2, 3)            // returns number 0.6666666666666666
+   *
+   *    const a = math.complex(5, 14)
+   *    const b = math.complex(4, 1)
+   *    math.divide(a, b)            // returns Complex 2 + 3i
+   *
+   *    const c = [[7, -6], [13, -4]]
+   *    const d = [[1, 2], [4, 3]]
+   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]
+   *
+   *    const e = math.unit('18 km')
+   *    math.divide(e, 4.5)          // returns Unit 4 km
+   *
+   * See also:
+   *
+   *    multiply
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x   Numerator
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix} y          Denominator
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`
+   */
+  return typed('divide', (0, _object.extend)({
+    // we extend the signatures of divideScalar with signatures dealing with matrices
+
+    'Array | Matrix, Array | Matrix': function (x, y) {
+      // TODO: implement matrix right division using pseudo inverse
+      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html
+      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html
+      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour
+      return multiply(x, inv(y));
+    },
+    'DenseMatrix, any': function (x, y) {
+      return matAlgo14xDs(x, y, divideScalar, false);
+    },
+    'SparseMatrix, any': function (x, y) {
+      return matAlgo11xS0s(x, y, divideScalar, false);
+    },
+    'Array, any': function (x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array | Matrix': function (x, y) {
+      return multiply(x, inv(y));
+    }
+  }, divideScalar.signatures));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js
new file mode 100644
index 0000000..49fd13d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/divideScalar.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDivideScalar = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'divideScalar';
+const dependencies = ['typed', 'numeric'];
+const createDivideScalar = exports.createDivideScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    numeric
+  } = _ref;
+  /**
+   * Divide two scalar values, `x / y`.
+   * This function is meant for internal use: it is used by the public functions
+   * `divide` and `inv`.
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   Numerator
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Denominator
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Quotient, `x / y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': function (x, y) {
+      return x / y;
+    },
+    'Complex, Complex': function (x, y) {
+      return x.div(y);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return x.div(y);
+    },
+    'bigint, bigint': function (x, y) {
+      return x / y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return x.div(y);
+    },
+    'Unit, number | Complex | Fraction | BigNumber | Unit': (x, y) => x.divide(y),
+    'number | Fraction | Complex | BigNumber, Unit': (x, y) => y.divideInto(x)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..31a8cd6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotDivide.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotDivide = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'dotDivide';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createDotDivide = exports.createDotDivide = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    divideScalar,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Divide two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotDivide(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotDivide(2, 4)   // returns 0.5
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]
+   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]
+   *
+   * See also:
+   *
+   *    divide, multiply, dotMultiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: divideScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..f98805d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotMultiply = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo09xS0Sf = require("../../type/matrix/utils/matAlgo09xS0Sf.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'dotMultiply';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar', 'concat'];
+const createDotMultiply = exports.createDotMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    multiplyScalar,
+    concat
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo09xS0Sf = (0, _matAlgo09xS0Sf.createMatAlgo09xS0Sf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Multiply two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotMultiply(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotMultiply(2, 4) // returns 8
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
+   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]
+   *
+   * See also:
+   *
+   *    multiply, divide, dotDivide
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: multiplyScalar,
+    SS: matAlgo09xS0Sf,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..ece00a0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/dotPow.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDotPow = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'dotPow';
+const dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createDotPow = exports.createDotPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar,
+    matrix,
+    pow,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const powScalarSignatures = {};
+  for (const signature in pow.signatures) {
+    if (Object.prototype.hasOwnProperty.call(pow.signatures, signature)) {
+      if (!signature.includes('Matrix') && !signature.includes('Array')) {
+        powScalarSignatures[signature] = pow.signatures[signature];
+      }
+    }
+  }
+  const powScalar = typed(powScalarSignatures);
+
+  /**
+   * Calculates the power of x to y element wise.
+   *
+   * Syntax:
+   *
+   *    math.dotPow(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotPow(2, 3)            // returns number 8
+   *
+   *    const a = [[1, 2], [4, 3]]
+   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]
+   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    pow, sqrt, multiply
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: powScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js b/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js
new file mode 100644
index 0000000..24670a5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/exp.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExp = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'exp';
+const dependencies = ['typed'];
+const createExp = exports.createExp = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the exponential of a value.
+   * For matrices, if you want the matrix exponential of square matrix, use
+   * the `expm` function; if you want to take the exponential of each element,
+   * see the examples.
+   *
+   * Syntax:
+   *
+   *    math.exp(x)
+   *
+   * Examples:
+   *
+   *    math.exp(2)                  // returns number 7.3890560989306495
+   *    math.pow(math.e, 2)          // returns number 7.3890560989306495
+   *    math.log(math.exp(2))        // returns number 2
+   *
+   *    math.map([1, 2, 3], math.exp)
+   *    // returns Array [
+   *    //   2.718281828459045,
+   *    //   7.3890560989306495,
+   *    //   20.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    expm1, expm, log, pow
+   *
+   * @param {number | BigNumber | Complex} x  A number to exponentiate
+   * @return {number | BigNumber | Complex} Exponential of `x`
+   */
+  return typed(name, {
+    number: _index.expNumber,
+    Complex: function (x) {
+      return x.exp();
+    },
+    BigNumber: function (x) {
+      return x.exp();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..4a91a7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/expm1.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExpm1 = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'expm1';
+const dependencies = ['typed', 'Complex'];
+const createExpm1 = exports.createExpm1 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the value of subtracting 1 from the exponential value.
+   * This function is more accurate than `math.exp(x)-1` when `x` is near 0
+   * To avoid ambiguity with the matrix exponential `expm`, this function
+   * does not operate on matrices; if you wish to apply it elementwise, see
+   * the examples.
+   *
+   * Syntax:
+   *
+   *    math.expm1(x)
+   *
+   * Examples:
+   *
+   *    math.expm1(2)                      // returns number 6.38905609893065
+   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495
+   *    math.expm1(1e-8)                   // returns number 1.0000000050000001e-8
+   *    math.exp(1e-8) - 1                 // returns number 9.9999999392253e-9
+   *    math.log(math.expm1(2) + 1)        // returns number 2
+   *
+   *    math.map([1, 2, 3], math.expm1)
+   *    // returns Array [
+   *    //   1.718281828459045,
+   *    //   6.3890560989306495,
+   *    //   19.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    exp, expm, log, pow
+   *
+   * @param {number | BigNumber | Complex} x  The number to exponentiate
+   * @return {number | BigNumber | Complex} Exponential of `x`, minus one
+   */
+  return typed(name, {
+    number: _index.expm1Number,
+    Complex: function (x) {
+      const r = Math.exp(x.re);
+      return new Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));
+    },
+    BigNumber: function (x) {
+      return x.exp().minus(1);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js b/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js
new file mode 100644
index 0000000..e90292a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/fix.js
@@ -0,0 +1,154 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFixNumber = exports.createFix = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+const name = 'fix';
+const dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor', 'equalScalar', 'zeros', 'DenseMatrix'];
+const createFixNumber = exports.createFixNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'ceil', 'floor'], _ref => {
+  let {
+    typed,
+    ceil,
+    floor
+  } = _ref;
+  return typed(name, {
+    number: function (x) {
+      return x > 0 ? floor(x) : ceil(x);
+    },
+    'number, number': function (x, n) {
+      return x > 0 ? floor(x, n) : ceil(x, n);
+    }
+  });
+});
+const createFix = exports.createFix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref2 => {
+  let {
+    typed,
+    Complex,
+    matrix,
+    ceil,
+    floor,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const fixNumber = createFixNumber({
+    typed,
+    ceil,
+    floor
+  });
+  /**
+   * Round a value towards zero.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.fix(x)
+   *    math.fix(x,n)
+   *    math.fix(unit, valuelessUnit)
+   *    math.fix(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.fix(3.2)                // returns number 3
+   *    math.fix(3.8)                // returns number 3
+   *    math.fix(-4.2)               // returns number -4
+   *    math.fix(-4.7)               // returns number -4
+   *
+   *    math.fix(3.12, 1)                // returns number 3.1
+   *    math.fix(3.18, 1)                // returns number 3.1
+   *    math.fix(-4.12, 1)               // returns number -4.1
+   *    math.fix(-4.17, 1)               // returns number -4.1
+   *
+   *    const c = math.complex(3.22, -2.78)
+   *    math.fix(c)                  // returns Complex 3 - 2i
+   *    math.fix(c, 1)               // returns Complex 3.2 -2.7i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.fix(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.fix(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]
+   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]
+   *
+   * See also:
+   *
+   *    ceil, floor, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('fix', {
+    number: fixNumber.signatures.number,
+    'number, number | BigNumber': fixNumber.signatures['number,number'],
+    Complex: function (x) {
+      return new Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));
+    },
+    'Complex, number': function (x, n) {
+      return new Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    'Complex, BigNumber': function (x, bn) {
+      const n = bn.toNumber();
+      return new Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    BigNumber: function (x) {
+      return x.isNegative() ? ceil(x) : floor(x);
+    },
+    'BigNumber, number | BigNumber': function (x, n) {
+      return x.isNegative() ? ceil(x, n) : floor(x, n);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function (x) {
+      return x.s < 0n ? x.ceil() : x.floor();
+    },
+    'Fraction, number | BigNumber': function (x, n) {
+      return x.s < 0n ? ceil(x, n) : floor(x, n);
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      const valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return (0, _collection.deepMap)(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return (0, _collection.deepMap)(x, self, true);
+    }),
+    'Array | Matrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return (0, _collection.deepMap)(x, i => self(i, n), true);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js b/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js
new file mode 100644
index 0000000..55b623e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/floor.js
@@ -0,0 +1,205 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFloorNumber = exports.createFloor = void 0;
+var _decimal = _interopRequireDefault(require("decimal.js"));
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+const name = 'floor';
+const dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+const bigTen = new _decimal.default(10);
+const createFloorNumber = exports.createFloorNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', 'round'], _ref => {
+  let {
+    typed,
+    config,
+    round
+  } = _ref;
+  function _floorNumber(x) {
+    // First, if the floor and the round are identical we can be
+    // quite comfortable that is the best answer:
+    const f = Math.floor(x);
+    const r = round(x);
+    if (f === r) return f;
+    // OK, they are different. If x is truly distinct from f but
+    // appears indistinguishable from r, presume it really is just
+    // the integer r with rounding/computation error, and return that
+    if ((0, _number.nearlyEqual)(x, r, config.relTol, config.absTol) && !(0, _number.nearlyEqual)(x, f, config.relTol, config.absTol)) {
+      return r;
+    }
+    // Otherwise (x distinct from both r and f, or indistinguishable from
+    // both r and f) may as well just return f, as that's the best
+    // candidate we can discern:
+    return f;
+  }
+  return typed(name, {
+    number: _floorNumber,
+    'number, number': function (x, n) {
+      if (!(0, _number.isInteger)(n)) {
+        throw new RangeError('number of decimals in function floor must be an integer');
+      }
+      if (n < 0 || n > 15) {
+        throw new RangeError('number of decimals in floor number must be in range 0 - 15');
+      }
+      const shift = 10 ** n;
+      return _floorNumber(x * shift) / shift;
+    }
+  });
+});
+const createFloor = exports.createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref2 => {
+  let {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const floorNumber = createFloorNumber({
+    typed,
+    config,
+    round
+  });
+  function _bigFloor(x) {
+    // see _floorNumber above for rationale
+    const bne = (a, b) => (0, _nearlyEqual.nearlyEqual)(a, b, config.relTol, config.absTol);
+    const f = x.floor();
+    const r = round(x);
+    if (f.eq(r)) return f;
+    if (bne(x, r) && !bne(x, f)) return r;
+    return f;
+  }
+  /**
+   * Round a value towards minus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.floor(x)
+   *    math.floor(x, n)
+   *    math.floor(unit, valuelessUnit)
+   *    math.floor(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.floor(3.2)              // returns number 3
+   *    math.floor(3.8)              // returns number 3
+   *    math.floor(-4.2)             // returns number -5
+   *    math.floor(-4.7)             // returns number -5
+   *
+   *    math.floor(3.212, 2)          // returns number 3.21
+   *    math.floor(3.288, 2)          // returns number 3.28
+   *    math.floor(-4.212, 2)         // returns number -4.22
+   *    math.floor(-4.782, 2)         // returns number -4.79
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.floor(c)                 // returns Complex 3 - 3i
+   *    math.floor(c, 1)              // returns Complex 3.2 -2.8i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.floor(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.floor(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]
+   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]
+   *
+   *    math.floor(math.tau, [2, 3])  // returns Array [6.28, 6.283]
+   *
+   *    // Note that floor(array, array) currently not implemented.
+   *
+   * See also:
+   *
+   *    ceil, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('floor', {
+    number: floorNumber.signatures.number,
+    'number,number': floorNumber.signatures['number,number'],
+    Complex: function (x) {
+      return x.floor();
+    },
+    'Complex, number': function (x, n) {
+      return x.floor(n);
+    },
+    'Complex, BigNumber': function (x, n) {
+      return x.floor(n.toNumber());
+    },
+    BigNumber: _bigFloor,
+    'BigNumber, BigNumber': function (x, n) {
+      const shift = bigTen.pow(n);
+      return _bigFloor(x.mul(shift)).div(shift);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function (x) {
+      return x.floor();
+    },
+    'Fraction, number': function (x, n) {
+      return x.floor(n);
+    },
+    'Fraction, BigNumber': function (x, n) {
+      return x.floor(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      const valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since floor(0) = 0
+      return (0, _collection.deepMap)(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since floor(0) = 0
+      return (0, _collection.deepMap)(x, self, true);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return (0, _collection.deepMap)(x, i => self(i, n), true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..0f9276d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/gcd.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGcd = void 0;
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _mod = require("./mod.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo04xSidSid = require("../../type/matrix/utils/matAlgo04xSidSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _ArgumentsError = require("../../error/ArgumentsError.js");
+const name = 'gcd';
+const dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix', 'concat'];
+const gcdTypes = 'number | BigNumber | Fraction | Matrix | Array';
+const gcdManyTypesSignature = `${gcdTypes}, ${gcdTypes}, ...${gcdTypes}`;
+function is1d(array) {
+  return !array.some(element => Array.isArray(element));
+}
+const createGcd = exports.createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    config,
+    round,
+    equalScalar,
+    zeros,
+    BigNumber,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const mod = (0, _mod.createMod)({
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  });
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the greatest common divisor for two or more values or arrays.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gcd(a, b)
+   *    math.gcd(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.gcd(8, 12)              // returns 4
+   *    math.gcd(-4, 6)              // returns 2
+   *    math.gcd(25, 15, -10)        // returns 5
+   *
+   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]
+   *
+   * See also:
+   *
+   *    lcm, xgcd
+   *
+   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor
+   */
+  return typed(name, {
+    'number, number': _gcdNumber,
+    'BigNumber, BigNumber': _gcdBigNumber,
+    'Fraction, Fraction': (x, y) => x.gcd(y)
+  }, matrixAlgorithmSuite({
+    SS: matAlgo04xSidSid,
+    DS: matAlgo01xDSid,
+    Ss: matAlgo10xSids
+  }), {
+    [gcdManyTypesSignature]: typed.referToSelf(self => (a, b, args) => {
+      let res = self(a, b);
+      for (let i = 0; i < args.length; i++) {
+        res = self(res, args[i]);
+      }
+      return res;
+    }),
+    Array: typed.referToSelf(self => array => {
+      if (array.length === 1 && Array.isArray(array[0]) && is1d(array[0])) {
+        return self(...array[0]);
+      }
+      if (is1d(array)) {
+        return self(...array);
+      }
+      throw new _ArgumentsError.ArgumentsError('gcd() supports only 1d matrices!');
+    }),
+    Matrix: typed.referToSelf(self => matrix => {
+      return self(matrix.toArray());
+    })
+  });
+
+  /**
+  * Calculate gcd for numbers
+  * @param {number} a
+  * @param {number} b
+  * @returns {number} Returns the greatest common denominator of a and b
+  * @private
+  */
+  function _gcdNumber(a, b) {
+    if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    let r;
+    while (b !== 0) {
+      r = mod(a, b);
+      a = b;
+      b = r;
+    }
+    return a < 0 ? -a : a;
+  }
+
+  /**
+   * Calculate gcd for BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns greatest common denominator of a and b
+   * @private
+   */
+  function _gcdBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    const zero = new BigNumber(0);
+    while (!b.isZero()) {
+      const r = mod(a, b);
+      a = b;
+      b = r;
+    }
+    return a.lt(zero) ? a.neg() : a;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..97b4218
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/hypot.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHypot = void 0;
+var _factory = require("../../utils/factory.js");
+var _array = require("../../utils/array.js");
+var _is = require("../../utils/is.js");
+const name = 'hypot';
+const dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
+const createHypot = exports.createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    sqrt,
+    smaller,
+    isPositive
+  } = _ref;
+  /**
+   * Calculate the hypotenuse of a list with values. The hypotenuse is defined as:
+   *
+   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
+   *
+   * For matrix input, the hypotenuse is calculated for all values in the matrix.
+   *
+   * Syntax:
+   *
+   *     math.hypot(a, b, ...)
+   *     math.hypot([a, b, c, ...])
+   *
+   * Examples:
+   *
+   *     math.hypot(3, 4)      // 5
+   *     math.hypot(3, 4, 5)   // 7.0710678118654755
+   *     math.hypot([3, 4, 5]) // 7.0710678118654755
+   *     math.hypot(-2)        // 2
+   *
+   * See also:
+   *
+   *     abs, norm
+   *
+   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.
+   *                                                          Matrix and Array input is flattened and returns a
+   *                                                          single number for the whole matrix.
+   * @return {number | BigNumber} Returns the hypothenusa of the input values.
+   */
+  return typed(name, {
+    '... number | BigNumber': _hypot,
+    Array: _hypot,
+    Matrix: M => _hypot((0, _array.flatten)(M.toArray(), true))
+  });
+
+  /**
+   * Calculate the hypotenuse for an Array with values
+   * @param {Array.<number | BigNumber>} args
+   * @return {number | BigNumber} Returns the result
+   * @private
+   */
+  function _hypot(args) {
+    // code based on `hypot` from es6-shim:
+    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
+    let result = 0;
+    let largest = 0;
+    for (let i = 0; i < args.length; i++) {
+      if ((0, _is.isComplex)(args[i])) {
+        throw new TypeError('Unexpected type of argument to hypot');
+      }
+      const value = abs(args[i]);
+      if (smaller(largest, value)) {
+        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
+        result = addScalar(result, 1);
+        largest = value;
+      } else {
+        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
+      }
+    }
+    return multiplyScalar(largest, sqrt(result));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..d6b8ed2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/invmod.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createInvmod = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'invmod';
+const dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
+const createInvmod = exports.createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    BigNumber,
+    xgcd,
+    equal,
+    smaller,
+    mod,
+    add,
+    isInteger
+  } = _ref;
+  /**
+   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+   *
+   * Syntax:
+   *
+   *    math.invmod(a, b)
+   *
+   * Examples:
+   *
+   *    math.invmod(8, 12)             // returns NaN
+   *    math.invmod(7, 13)             // returns 2
+   *    math.invmod(15151, 15122)      // returns 10429
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {number | BigNumber }  Returns an integer number
+   *                              where `invmod(a,b)*a ≣ 1 (mod b)`
+   */
+  return typed(name, {
+    'number, number': invmod,
+    'BigNumber, BigNumber': invmod
+  });
+  function invmod(a, b) {
+    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
+    a = mod(a, b);
+    if (equal(b, 0)) throw new Error('Divisor must be non zero');
+    let res = xgcd(a, b);
+    res = res.valueOf();
+    let [gcd, inv] = res;
+    if (!equal(gcd, BigNumber(1))) return NaN;
+    inv = mod(inv, b);
+    if (smaller(inv, BigNumber(0))) inv = add(inv, b);
+    return inv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..a3f30c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/lcm.js
@@ -0,0 +1,116 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLcm = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo06xS0S = require("../../type/matrix/utils/matAlgo06xS0S0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'lcm';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];
+const createLcm = exports.createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    concat
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const lcmTypes = 'number | BigNumber | Fraction | Matrix | Array';
+  const lcmManySignature = {};
+  lcmManySignature[`${lcmTypes}, ${lcmTypes}, ...${lcmTypes}`] = typed.referToSelf(self => (a, b, args) => {
+    let res = self(a, b);
+    for (let i = 0; i < args.length; i++) {
+      res = self(res, args[i]);
+    }
+    return res;
+  });
+
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   *
+   * lcm is defined as:
+   *
+   *     lcm(a, b) = abs(a * b) / gcd(a, b)
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.lcm(a, b)
+   *    math.lcm(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.lcm(4, 6)               // returns 12
+   *    math.lcm(6, 21)              // returns 42
+   *    math.lcm(6, 21, 5)           // returns 210
+   *
+   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Array | Matrix}                           The least common multiple
+   */
+  return typed(name, {
+    'number, number': _index.lcmNumber,
+    'BigNumber, BigNumber': _lcmBigNumber,
+    'Fraction, Fraction': (x, y) => x.lcm(y)
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }), lcmManySignature);
+
+  /**
+   * Calculate lcm for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns the least common multiple of a and b
+   * @private
+   */
+  function _lcmBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function lcm must be integer numbers');
+    }
+    if (a.isZero()) {
+      return a;
+    }
+    if (b.isZero()) {
+      return b;
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    // evaluate lcm here inline to reduce overhead
+    const prod = a.times(b);
+    while (!b.isZero()) {
+      const t = b;
+      b = a.mod(t);
+      a = t;
+    }
+    return prod.div(a).abs();
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log.js
new file mode 100644
index 0000000..0b75856
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log.js
@@ -0,0 +1,93 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog = void 0;
+var _factory = require("../../utils/factory.js");
+var _bigint = require("../../utils/bigint.js");
+var _index = require("../../plain/number/index.js");
+const name = 'log';
+const dependencies = ['config', 'typed', 'typeOf', 'divideScalar', 'Complex'];
+const nlg16 = Math.log(16);
+const createLog = exports.createLog = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    typeOf,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the logarithm of a value.
+   *
+   * To avoid confusion with the matrix logarithm, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.log(x)
+   *    math.log(x, base)
+   *
+   * Examples:
+   *
+   *    math.log(3.5)                  // returns 1.252762968495368
+   *    math.exp(math.log(2.4))        // returns 2.4
+   *
+   *    math.pow(10, 4)                // returns 10000
+   *    math.log(10000, 10)            // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *
+   *    math.log(1024, 2)              // returns 10
+   *    math.pow(2, 10)                // returns 1024
+   *
+   * See also:
+   *
+   *    exp, log2, log10, log1p
+   *
+   * @param {number | BigNumber | Fraction | Complex} x
+   *            Value for which to calculate the logarithm.
+   * @param {number | BigNumber | Fraction | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x` is calculated.
+   * @return {number | BigNumber | Fraction | Complex}
+   *            Returns the logarithm of `x`
+   */
+  function complexLog(c) {
+    return c.log();
+  }
+  function complexLogNumber(x) {
+    return complexLog(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function (x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.logNumber)(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLogNumber(x);
+      }
+    },
+    bigint: (0, _bigint.promoteLogarithm)(nlg16, _index.logNumber, config, complexLogNumber),
+    Complex: complexLog,
+    BigNumber: function (x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLogNumber(x.toNumber());
+      }
+    },
+    'any, any': typed.referToSelf(self => (x, base) => {
+      // calculate logarithm for a specified base, log(x, base)
+
+      if (typeOf(x) === 'Fraction' && typeOf(base) === 'Fraction') {
+        const result = x.log(base);
+        if (result !== null) {
+          return result;
+        }
+      }
+      return divideScalar(self(x), self(base));
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js
new file mode 100644
index 0000000..d2c0a4d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log10.js
@@ -0,0 +1,73 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog10 = void 0;
+var _index = require("../../plain/number/index.js");
+var _bigint = require("../../utils/bigint.js");
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'log10';
+const dependencies = ['typed', 'config', 'Complex'];
+const log16 = (0, _index.log10Number)(16);
+const createLog10 = exports.createLog10 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log10(x)
+   *
+   * Examples:
+   *
+   *    math.log10(0.00001)            // returns -5
+   *    math.log10(10000)              // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *    math.pow(10, 4)                // returns 10000
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log2
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 10-base logarithm of `x`
+   */
+
+  function complexLog(c) {
+    return c.log().div(Math.LN10);
+  }
+  function complexLogNumber(x) {
+    return complexLog(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function (x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.log10Number)(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLogNumber(x);
+      }
+    },
+    bigint: (0, _bigint.promoteLogarithm)(log16, _index.log10Number, config, complexLogNumber),
+    Complex: complexLog,
+    BigNumber: function (x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log();
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLogNumber(x.toNumber());
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..e68a466
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log1p.js
@@ -0,0 +1,87 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog1p = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+const name = 'log1p';
+const dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
+const createLog1p = exports.createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    divideScalar,
+    log,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the logarithm of a `value+1`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log1p(x)
+   *    math.log1p(x, base)
+   *
+   * Examples:
+   *
+   *    math.log1p(2.5)                 // returns 1.252762968495368
+   *    math.exp(math.log1p(1.4))       // returns 2.4
+   *
+   *    math.pow(10, 4)                 // returns 10000
+   *    math.log1p(9999, 10)            // returns 4
+   *    math.log1p(9999) / math.log(10) // returns 4
+   *
+   * See also:
+   *
+   *    exp, log, log2, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm of `x+1`.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x+1` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x+1`
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x >= -1 || config.predictable) {
+        return (0, _number.log1p)(x);
+      } else {
+        // negative value -> complex value computation
+        return _log1pComplex(new Complex(x, 0));
+      }
+    },
+    Complex: _log1pComplex,
+    BigNumber: function (x) {
+      const y = x.plus(1);
+      if (!y.isNegative() || config.predictable) {
+        return y.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log1pComplex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self)),
+    'any, any': typed.referToSelf(self => (x, base) => {
+      // calculate logarithm for a specified base, log1p(x, base)
+      return divideScalar(self(x), log(base));
+    })
+  });
+
+  /**
+   * Calculate the natural logarithm of a complex number + 1
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+  function _log1pComplex(x) {
+    const xRe1p = x.re + 1;
+    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js b/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js
new file mode 100644
index 0000000..f19542f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/log2.js
@@ -0,0 +1,79 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLog2 = void 0;
+var _index = require("../../plain/number/index.js");
+var _bigint = require("../../utils/bigint.js");
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'log2';
+const dependencies = ['typed', 'config', 'Complex'];
+const createLog2 = exports.createLog2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log2(x)
+   *
+   * Examples:
+   *
+   *    math.log2(0.03125)           // returns -5
+   *    math.log2(16)                // returns 4
+   *    math.log2(16) / math.log2(2) // returns 4
+   *    math.pow(2, 4)               // returns 16
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 2-base logarithm of `x`
+   */
+  function complexLog2Number(x) {
+    return _log2Complex(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function (x) {
+      if (x >= 0 || config.predictable) {
+        return (0, _index.log2Number)(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLog2Number(x);
+      }
+    },
+    bigint: (0, _bigint.promoteLogarithm)(4, _index.log2Number, config, complexLog2Number),
+    Complex: _log2Complex,
+    BigNumber: function (x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log(2);
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLog2Number(x.toNumber());
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+
+  /**
+   * Calculate log2 for a complex value
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+  function _log2Complex(x) {
+    const newX = Math.sqrt(x.re * x.re + x.im * x.im);
+    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js b/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js
new file mode 100644
index 0000000..3fdc081
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/mod.js
@@ -0,0 +1,139 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMod = void 0;
+var _factory = require("../../utils/factory.js");
+var _floor = require("./floor.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo05xSfSf = require("../../type/matrix/utils/matAlgo05xSfSf.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'mod';
+const dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+const createMod = exports.createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const floor = (0, _floor.createFloor)({
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  });
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculates the modulus, the remainder of an integer division.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * The modulus is defined as:
+   *
+   *     x - y * floor(x / y)
+   *
+   * See https://en.wikipedia.org/wiki/Modulo_operation.
+   *
+   * Syntax:
+   *
+   *    math.mod(x, y)
+   *
+   * Examples:
+   *
+   *    math.mod(8, 3)                // returns 2
+   *    math.mod(11, 2)               // returns 1
+   *
+   *    function isOdd(x) {
+   *      return math.mod(x, 2) != 0
+   *    }
+   *
+   *    isOdd(2)                      // returns false
+   *    isOdd(3)                      // returns true
+   *
+   * See also:
+   *
+   *    divide
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} x Dividend
+   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} y Divisor
+   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
+   */
+  return typed(name, {
+    'number, number': _modNumber,
+    'BigNumber, BigNumber': function (x, y) {
+      return y.isZero() ? x : x.sub(y.mul(floor(x.div(y))));
+    },
+    'bigint, bigint': function (x, y) {
+      if (y === 0n) {
+        return x;
+      }
+      if (x < 0) {
+        const m = x % y;
+        return m === 0n ? m : m + y;
+      }
+      return x % y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return y.equals(0) ? x : x.sub(y.mul(floor(x.div(y))));
+    }
+  }, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+
+  /**
+  * Calculate the modulus of two numbers
+  * @param {number} x
+  * @param {number} y
+  * @returns {number} res
+  * @private
+  */
+  function _modNumber(x, y) {
+    // We don't use JavaScript's % operator here as this doesn't work
+    // correctly for x < 0 and x === 0
+    // see https://en.wikipedia.org/wiki/Modulo_operation
+
+    // We use mathjs floor to handle errors associated with
+    // precision float approximation
+    return y === 0 ? x : x - y * floor(x / y);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..fe11843
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/multiply.js
@@ -0,0 +1,886 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultiply = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+const name = 'multiply';
+const dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];
+const createMultiply = exports.createMultiply = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    addScalar,
+    multiplyScalar,
+    equalScalar,
+    dot
+  } = _ref;
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  function _validateMatrixDimensions(size1, size2) {
+    // check left operand dimensions
+    switch (size1.length) {
+      case 1:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Vector x Vector
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');
+            }
+            break;
+          case 2:
+            // Vector x Matrix
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');
+            }
+            break;
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+        break;
+      case 2:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Matrix x Vector
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');
+            }
+            break;
+          case 2:
+            // Matrix x Matrix
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');
+            }
+            break;
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+        break;
+      default:
+        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');
+    }
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (N)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {number}             Scalar value
+   */
+  function _multiplyVectorVector(a, b, n) {
+    // check empty vector
+    if (n === 0) {
+      throw new Error('Cannot multiply two empty vectors');
+    }
+    return dot(a, b);
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Matrix         (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+  function _multiplyVectorMatrix(a, b) {
+    // process storage
+    if (b.storage() !== 'dense') {
+      throw new Error('Support for SparseMatrix not implemented');
+    }
+    return _multiplyVectorDenseMatrix(a, b);
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Dense Matrix   (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+  function _multiplyVectorDenseMatrix(a, b) {
+    // a dense
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype || a.getDataType();
+    // b dense
+    const bdata = b._data;
+    const bsize = b._size;
+    const bdt = b._datatype || b.getDataType();
+    // rows & columns
+    const alength = asize[0];
+    const bcolumns = bsize[1];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    const c = [];
+
+    // loop matrix columns
+    for (let j = 0; j < bcolumns; j++) {
+      // sum (do not initialize it with zero)
+      let sum = mf(adata[0], bdata[0][j]);
+      // loop vector
+      for (let i = 1; i < alength; i++) {
+        // multiply & accumulate
+        sum = af(sum, mf(adata[i], bdata[i][j]));
+      }
+      c[j] = sum;
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {Matrix}             Dense Vector   (M)
+   */
+  const _multiplyMatrixVector = typed('_multiplyMatrixVector', {
+    'DenseMatrix, any': _multiplyDenseMatrixVector,
+    'SparseMatrix, any': _multiplySparseMatrixVector
+  });
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Matrix         (NxC)
+   *
+   * @return {Matrix}             Matrix         (MxC)
+   */
+  const _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {
+    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,
+    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,
+    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,
+    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix
+  });
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix  (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             Dense Vector (M)
+   */
+  function _multiplyDenseMatrixVector(a, b) {
+    // a dense
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype || a.getDataType();
+    // b dense
+    const bdata = b._data;
+    const bdt = b._datatype || b.getDataType();
+    // rows & columns
+    const arows = asize[0];
+    const acolumns = asize[1];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    const c = [];
+
+    // loop matrix a rows
+    for (let i = 0; i < arows; i++) {
+      // current row
+      const row = adata[i];
+      // sum (do not initialize it with zero)
+      let sum = mf(row[0], bdata[0]);
+      // loop matrix a columns
+      for (let j = 1; j < acolumns; j++) {
+        // multiply & accumulate
+        sum = af(sum, mf(row[j], bdata[j]));
+      }
+      c[i] = sum;
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            DenseMatrix    (NxC)
+   *
+   * @return {Matrix}             DenseMatrix    (MxC)
+   */
+  function _multiplyDenseMatrixDenseMatrix(a, b) {
+    // getDataType()
+    // a dense
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype || a.getDataType();
+    // b dense
+    const bdata = b._data;
+    const bsize = b._size;
+    const bdt = b._datatype || b.getDataType();
+    // rows & columns
+    const arows = asize[0];
+    const acolumns = asize[1];
+    const bcolumns = bsize[1];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    const c = [];
+
+    // loop matrix a rows
+    for (let i = 0; i < arows; i++) {
+      // current row
+      const row = adata[i];
+      // initialize row array
+      c[i] = [];
+      // loop matrix b columns
+      for (let j = 0; j < bcolumns; j++) {
+        // sum (avoid initializing sum to zero)
+        let sum = mf(row[0], bdata[0][j]);
+        // loop matrix a columns
+        for (let x = 1; x < acolumns; x++) {
+          // multiply & accumulate
+          sum = af(sum, mf(row[x], bdata[x][j]));
+        }
+        c[i][j] = sum;
+      }
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            SparseMatrix   (NxC)
+   *
+   * @return {Matrix}             SparseMatrix   (MxC)
+   */
+  function _multiplyDenseMatrixSparseMatrix(a, b) {
+    // a dense
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype || a.getDataType();
+    // b sparse
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+    // validate b matrix
+    if (!bvalues) {
+      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');
+    }
+    // rows & columns
+    const arows = asize[0];
+    const bcolumns = bsize[1];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+    // equalScalar signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // result
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+    // c matrix
+    const c = b.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // loop b columns
+    for (let jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // indeces in column jb
+      const kb0 = bptr[jb];
+      const kb1 = bptr[jb + 1];
+      // do not process column jb if no data exists
+      if (kb1 > kb0) {
+        // last row mark processed
+        let last = 0;
+        // loop a rows
+        for (let i = 0; i < arows; i++) {
+          // column mark
+          const mark = i + 1;
+          // C[i, jb]
+          let cij;
+          // values in b column j
+          for (let kb = kb0; kb < kb1; kb++) {
+            // row
+            const ib = bindex[kb];
+            // check value has been initialized
+            if (last !== mark) {
+              // first value in column jb
+              cij = mf(adata[i][ib], bvalues[kb]);
+              // update mark
+              last = mark;
+            } else {
+              // accumulate value
+              cij = af(cij, mf(adata[i][ib], bvalues[kb]));
+            }
+          }
+          // check column has been processed and value != 0
+          if (last === mark && !eq(cij, zero)) {
+            // push row & value
+            cindex.push(i);
+            cvalues.push(cij);
+          }
+        }
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix    (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             SparseMatrix    (M, 1)
+   */
+  function _multiplySparseMatrixVector(a, b) {
+    // a sparse
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // validate a matrix
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    }
+    // b dense
+    const bdata = b._data;
+    const bdt = b._datatype || b.getDataType();
+    // rows & columns
+    const arows = a._size[0];
+    const brows = b._size[0];
+    // result
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+    // equalScalar signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // workspace
+    const x = [];
+    // vector with marks indicating a value x[i] exists in a given column
+    const w = [];
+
+    // update ptr
+    cptr[0] = 0;
+    // rows in b
+    for (let ib = 0; ib < brows; ib++) {
+      // b[ib]
+      const vbi = bdata[ib];
+      // check b[ib] != 0, avoid loops
+      if (!eq(vbi, zero)) {
+        // A values & index in ib column
+        for (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+          // a row
+          const ia = aindex[ka];
+          // check value exists in current j
+          if (!w[ia]) {
+            // ia is new entry in j
+            w[ia] = true;
+            // add i to pattern of C
+            cindex.push(ia);
+            // x(ia) = A
+            x[ia] = mf(vbi, avalues[ka]);
+          } else {
+            // i exists in C already
+            x[ia] = af(x[ia], mf(vbi, avalues[ka]));
+          }
+        }
+      }
+    }
+    // copy values from x to column jb of c
+    for (let p1 = cindex.length, p = 0; p < p1; p++) {
+      // row
+      const ic = cindex[p];
+      // copy value
+      cvalues[p] = x[ic];
+    }
+    // update ptr
+    cptr[1] = cindex.length;
+
+    // matrix to return
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, 1],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            DenseMatrix       (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+  function _multiplySparseMatrixDenseMatrix(a, b) {
+    // a sparse
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // validate a matrix
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    }
+    // b dense
+    const bdata = b._data;
+    const bdt = b._datatype || b.getDataType();
+    // rows & columns
+    const arows = a._size[0];
+    const brows = b._size[0];
+    const bcolumns = b._size[1];
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+    // equalScalar signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // result
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+    // c matrix
+    const c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // workspace
+    const x = [];
+    // vector with marks indicating a value x[i] exists in a given column
+    const w = [];
+
+    // loop b columns
+    for (let jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // mark in workspace for current column
+      const mark = jb + 1;
+      // rows in jb
+      for (let ib = 0; ib < brows; ib++) {
+        // b[ib, jb]
+        const vbij = bdata[ib][jb];
+        // check b[ib, jb] != 0, avoid loops
+        if (!eq(vbij, zero)) {
+          // A values & index in ib column
+          for (let ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // a row
+            const ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+              // x(ia) = A
+              x[ia] = mf(vbij, avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(vbij, avalues[ka]));
+            }
+          }
+        }
+      }
+      // copy values from x to column jb of c
+      for (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+        // row
+        const ic = cindex[p];
+        // copy value
+        cvalues[p] = x[ic];
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            SparseMatrix      (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+  function _multiplySparseMatrixSparseMatrix(a, b) {
+    // a sparse
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // b sparse
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // rows & columns
+    const arows = a._size[0];
+    const bcolumns = b._size[1];
+    // flag indicating both matrices (a & b) contain data
+    const values = avalues && bvalues;
+
+    // datatype
+    let dt;
+    // addScalar signature to use
+    let af = addScalar;
+    // multiplyScalar signature to use
+    let mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    const cvalues = values ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+    // c matrix
+    const c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // workspace
+    const x = values ? [] : undefined;
+    // vector with marks indicating a value x[i] exists in a given column
+    const w = [];
+    // variables
+    let ka, ka0, ka1, kb, kb0, kb1, ia, ib;
+    // loop b columns
+    for (let jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // mark in workspace for current column
+      const mark = jb + 1;
+      // B values & index in j
+      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {
+        // b row
+        ib = bindex[kb];
+        // check we need to process values
+        if (values) {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+              // x(ia) = A
+              x[ia] = mf(bvalues[kb], avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));
+            }
+          }
+        } else {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+            }
+          }
+        }
+      }
+      // check we need to process matrix values (pattern matrix)
+      if (values) {
+        // copy values from x to column jb of c
+        for (let p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+          // row
+          const ic = cindex[p];
+          // copy value
+          cvalues[p] = x[ic];
+        }
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * Multiply two or more values, `x * y`.
+   * For matrices, the matrix product is calculated.
+   *
+   * Syntax:
+   *
+   *    math.multiply(x, y)
+   *    math.multiply(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.multiply(4, 5.2)        // returns number 20.8
+   *    math.multiply(2, 3, 4)       // returns number 24
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.multiply(a, b)          // returns Complex 5 + 14i
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    const d = [[1, 2, 3], [3, -4, 7]]
+   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]
+   *
+   *    const e = math.unit('2.1 km')
+   *    math.multiply(3, e)          // returns Unit 6.3 km
+   *
+   * See also:
+   *
+   *    divide, prod, cross, dot
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to multiply
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
+   */
+  return typed(name, multiplyScalar, {
+    // we extend the signatures of multiplyScalar with signatures dealing with matrices
+
+    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {
+      // check dimensions
+      _validateMatrixDimensions((0, _array.arraySize)(x), (0, _array.arraySize)(y));
+
+      // use dense matrix implementation
+      const m = selfMM(matrix(x), matrix(y));
+      // return array or scalar
+      return (0, _is.isMatrix)(m) ? m.valueOf() : m;
+    }),
+    'Matrix, Matrix': function (x, y) {
+      // dimensions
+      const xsize = x.size();
+      const ysize = y.size();
+
+      // check dimensions
+      _validateMatrixDimensions(xsize, ysize);
+
+      // process dimensions
+      if (xsize.length === 1) {
+        // process y dimensions
+        if (ysize.length === 1) {
+          // Vector * Vector
+          return _multiplyVectorVector(x, y, xsize[0]);
+        }
+        // Vector * Matrix
+        return _multiplyVectorMatrix(x, y);
+      }
+      // process y dimensions
+      if (ysize.length === 1) {
+        // Matrix * Vector
+        return _multiplyMatrixVector(x, y);
+      }
+      // Matrix * Matrix
+      return _multiplyMatrixMatrix(x, y);
+    },
+    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM => (x, y) => selfMM(x, matrix(y))),
+    'Array, Matrix': typed.referToSelf(self => (x, y) => {
+      // use Matrix * Matrix implementation
+      return self(matrix(x, y.storage()), y);
+    }),
+    'SparseMatrix, any': function (x, y) {
+      return matAlgo11xS0s(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function (x, y) {
+      return matAlgo14xDs(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function (x, y) {
+      return matAlgo11xS0s(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function (x, y) {
+      return matAlgo14xDs(y, x, multiplyScalar, true);
+    },
+    'Array, any': function (x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function (x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();
+    },
+    'any, any': multiplyScalar,
+    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {
+      let result = self(x, y);
+      for (let i = 0; i < rest.length; i++) {
+        result = self(result, rest[i]);
+      }
+      return result;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js
new file mode 100644
index 0000000..9a3c10b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/multiplyScalar.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultiplyScalar = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'multiplyScalar';
+const dependencies = ['typed'];
+const createMultiplyScalar = exports.createMultiplyScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Multiply two scalar values, `x * y`.
+   * This function is meant for internal use: it is used by the public function
+   * `multiply`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to multiply
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to multiply
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Multiplication of `x` and `y`
+   * @private
+   */
+  return typed('multiplyScalar', {
+    'number, number': _index.multiplyNumber,
+    'Complex, Complex': function (x, y) {
+      return x.mul(y);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return x.times(y);
+    },
+    'bigint, bigint': function (x, y) {
+      return x * y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return x.mul(y);
+    },
+    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),
+    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js b/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js
new file mode 100644
index 0000000..997aa8d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/norm.js
@@ -0,0 +1,293 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNorm = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'norm';
+const dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];
+const createNorm = exports.createNorm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    add,
+    pow,
+    conj,
+    sqrt,
+    multiply,
+    equalScalar,
+    larger,
+    smaller,
+    matrix,
+    ctranspose,
+    eigs
+  } = _ref;
+  /**
+   * Calculate the norm of a number, vector or matrix.
+   *
+   * The second parameter p is optional. If not provided, it defaults to 2.
+   *
+   * Syntax:
+   *
+   *    math.norm(x)
+   *    math.norm(x, p)
+   *
+   * Examples:
+   *
+   *    math.abs(-3.5)                         // returns 3.5
+   *    math.norm(-3.5)                        // returns 3.5
+   *
+   *    math.norm(math.complex(3, -4))         // returns 5
+   *
+   *    math.norm([1, 2, -3], Infinity)        // returns 3
+   *    math.norm([1, 2, -3], -Infinity)       // returns 1
+   *
+   *    math.norm([3, 4], 2)                   // returns 5
+   *
+   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6
+   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7
+   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661
+   *
+   * See also:
+   *
+   *    abs, hypot
+   *
+   * @param  {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the norm
+   * @param  {number | BigNumber | string} [p=2]
+   *            Vector space.
+   *            Supported numbers include Infinity and -Infinity.
+   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)
+   * @return {number | BigNumber} the p-norm
+   */
+  return typed(name, {
+    number: Math.abs,
+    Complex: function (x) {
+      return x.abs();
+    },
+    BigNumber: function (x) {
+      // norm(x) = abs(x)
+      return x.abs();
+    },
+    boolean: function (x) {
+      // norm(x) = abs(x)
+      return Math.abs(x);
+    },
+    Array: function (x) {
+      return _norm(matrix(x), 2);
+    },
+    Matrix: function (x) {
+      return _norm(x, 2);
+    },
+    'Array, number | BigNumber | string': function (x, p) {
+      return _norm(matrix(x), p);
+    },
+    'Matrix, number | BigNumber | string': function (x, p) {
+      return _norm(x, p);
+    }
+  });
+
+  /**
+   * Calculate the plus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNormPlusInfinity(x) {
+    // norm(x, Infinity) = max(abs(x))
+    let pinf = 0;
+    // skip zeros since abs(0) === 0
+    x.forEach(function (value) {
+      const v = abs(value);
+      if (larger(v, pinf)) {
+        pinf = v;
+      }
+    }, true);
+    return pinf;
+  }
+
+  /**
+   * Calculate the minus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNormMinusInfinity(x) {
+    // norm(x, -Infinity) = min(abs(x))
+    let ninf;
+    // skip zeros since abs(0) === 0
+    x.forEach(function (value) {
+      const v = abs(value);
+      if (!ninf || smaller(v, ninf)) {
+        ninf = v;
+      }
+    }, true);
+    return ninf || 0;
+  }
+
+  /**
+   * Calculate the norm for a vector
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNorm(x, p) {
+    // check p
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _vectorNormPlusInfinity(x);
+    }
+    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {
+      return _vectorNormMinusInfinity(x);
+    }
+    if (p === 'fro') {
+      return _norm(x, 2);
+    }
+    if (typeof p === 'number' && !isNaN(p)) {
+      // check p != 0
+      if (!equalScalar(p, 0)) {
+        // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p
+        let n = 0;
+        // skip zeros since abs(0) === 0
+        x.forEach(function (value) {
+          n = add(pow(abs(value), p), n);
+        }, true);
+        return pow(n, 1 / p);
+      }
+      return Number.POSITIVE_INFINITY;
+    }
+    // invalid parameter value
+    throw new Error('Unsupported parameter value');
+  }
+
+  /**
+   * Calculate the Frobenius norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormFrobenius(x) {
+    // norm(x) = sqrt(sum(diag(x'x)))
+    let fro = 0;
+    x.forEach(function (value, index) {
+      fro = add(fro, multiply(value, conj(value)));
+    });
+    return abs(sqrt(fro));
+  }
+
+  /**
+   * Calculate the norm L1 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormOne(x) {
+    // norm(x) = the largest column sum
+    const c = [];
+    // result
+    let maxc = 0;
+    // skip zeros since abs(0) == 0
+    x.forEach(function (value, index) {
+      const j = index[1];
+      const cj = add(c[j] || 0, abs(value));
+      if (larger(cj, maxc)) {
+        maxc = cj;
+      }
+      c[j] = cj;
+    }, true);
+    return maxc;
+  }
+
+  /**
+   * Calculate the norm L2 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormTwo(x) {
+    // norm(x) = sqrt( max eigenvalue of A*.A)
+    const sizeX = x.size();
+    if (sizeX[0] !== sizeX[1]) {
+      throw new RangeError('Invalid matrix dimensions');
+    }
+    const tx = ctranspose(x);
+    const squaredX = multiply(tx, x);
+    const eigenVals = eigs(squaredX).values.toArray();
+    const rho = eigenVals[eigenVals.length - 1];
+    return abs(sqrt(rho));
+  }
+
+  /**
+   * Calculate the infinity norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormInfinity(x) {
+    // norm(x) = the largest row sum
+    const r = [];
+    // result
+    let maxr = 0;
+    // skip zeros since abs(0) == 0
+    x.forEach(function (value, index) {
+      const i = index[0];
+      const ri = add(r[i] || 0, abs(value));
+      if (larger(ri, maxr)) {
+        maxr = ri;
+      }
+      r[i] = ri;
+    }, true);
+    return maxr;
+  }
+
+  /**
+   * Calculate the norm for a 2D Matrix (M*N)
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNorm(x, p) {
+    // check p
+    if (p === 1) {
+      return _matrixNormOne(x);
+    }
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _matrixNormInfinity(x);
+    }
+    if (p === 'fro') {
+      return _matrixNormFrobenius(x);
+    }
+    if (p === 2) {
+      return _matrixNormTwo(x);
+    } // invalid parameter value
+
+    throw new Error('Unsupported parameter value ' + p);
+  }
+
+  /**
+   * Calculate the norm for an array
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _norm(x, p) {
+    // size
+    const sizeX = x.size();
+
+    // check if it is a vector
+    if (sizeX.length === 1) {
+      return _vectorNorm(x, p);
+    }
+    // MxN matrix
+    if (sizeX.length === 2) {
+      if (sizeX[0] && sizeX[1]) {
+        return _matrixNorm(x, p);
+      } else {
+        throw new RangeError('Invalid matrix dimensions');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..4c53f40
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoot.js
@@ -0,0 +1,172 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNthRootNumber = exports.createNthRoot = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo06xS0S = require("../../type/matrix/utils/matAlgo06xS0S0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'nthRoot';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'concat'];
+const createNthRoot = exports.createNthRoot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the nth root of a value.
+   * The principal nth root of a positive real number A, is the positive real
+   * solution of the equation
+   *
+   *     x^root = A
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *     math.nthRoot(a)
+   *     math.nthRoot(a, root)
+   *
+   * Examples:
+   *
+   *     math.nthRoot(9, 2)    // returns 3 (since 3^2 == 9)
+   *     math.sqrt(9)          // returns 3 (since 3^2 == 9)
+   *     math.nthRoot(64, 3)   // returns 4 (since 4^3 == 64)
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param {number | BigNumber | Array | Matrix | Complex} a
+   *              Value for which to calculate the nth root
+   * @param {number | BigNumber} [root=2]    The root.
+   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`
+   */
+  function complexErr() {
+    throw new Error('Complex number not supported in function nthRoot. Use nthRoots instead.');
+  }
+  return typed(name, {
+    number: _index.nthRootNumber,
+    'number, number': _index.nthRootNumber,
+    BigNumber: x => _bigNthRoot(x, new BigNumber(2)),
+    'BigNumber, BigNumber': _bigNthRoot,
+    Complex: complexErr,
+    'Complex, number': complexErr,
+    Array: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(matrix(x), 2).valueOf()),
+    DenseMatrix: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(x, 2)),
+    SparseMatrix: typed.referTo('SparseMatrix,number', selfSn => x => selfSn(x, 2)),
+    'SparseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse + sparse
+        return matAlgo06xS0S0(x, y, self);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    }),
+    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // dense + sparse
+        return matAlgo01xDSid(x, y, self, false);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    }),
+    'Array, SparseMatrix': typed.referTo('DenseMatrix,SparseMatrix', selfDS => (x, y) => selfDS(matrix(x), y)),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse - scalar
+        return matAlgo11xS0s(y, x, self, true);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    })
+  }, matrixAlgorithmSuite({
+    scalar: 'number | BigNumber',
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: false
+  }));
+
+  /**
+   * Calculate the nth root of a for BigNumbers, solve x^root == a
+   * https://rosettacode.org/wiki/Nth_root#JavaScript
+   * @param {BigNumber} a
+   * @param {BigNumber} root
+   * @private
+   */
+  function _bigNthRoot(a, root) {
+    const precision = BigNumber.precision;
+    const Big = BigNumber.clone({
+      precision: precision + 2
+    });
+    const zero = new BigNumber(0);
+    const one = new Big(1);
+    const inv = root.isNegative();
+    if (inv) {
+      root = root.neg();
+    }
+    if (root.isZero()) {
+      throw new Error('Root must be non-zero');
+    }
+    if (a.isNegative() && !root.abs().mod(2).equals(1)) {
+      throw new Error('Root must be odd when a is negative.');
+    }
+
+    // edge cases zero and infinity
+    if (a.isZero()) {
+      return inv ? new Big(Infinity) : 0;
+    }
+    if (!a.isFinite()) {
+      return inv ? zero : a;
+    }
+    let x = a.abs().pow(one.div(root));
+    // If a < 0, we require that root is an odd integer,
+    // so (-1) ^ (1/root) = -1
+    x = a.isNeg() ? x.neg() : x;
+    return new BigNumber((inv ? one.div(x) : x).toPrecision(precision));
+  }
+});
+const createNthRootNumber = exports.createNthRootNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], _ref2 => {
+  let {
+    typed
+  } = _ref2;
+  return typed(name, {
+    number: _index.nthRootNumber,
+    'number, number': _index.nthRootNumber
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..0718e93
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/nthRoots.js
@@ -0,0 +1,117 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNthRoots = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'nthRoots';
+const dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+const createNthRoots = exports.createNthRoots = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+  /**
+   * Each function here returns a real multiple of i as a Complex value.
+   * @param  {number} val
+   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3
+   */
+  // This is used to fix float artifacts for zero-valued components.
+  const _calculateExactResult = [function realPos(val) {
+    return new Complex(val, 0);
+  }, function imagPos(val) {
+    return new Complex(0, val);
+  }, function realNeg(val) {
+    return new Complex(-val, 0);
+  }, function imagNeg(val) {
+    return new Complex(0, -val);
+  }];
+
+  /**
+   * Calculate the nth root of a Complex Number a using De Movire's Theorem.
+   * @param  {Complex} a
+   * @param  {number} root
+   * @return {Array} array of n Complex Roots
+   */
+  function _nthComplexRoots(a, root) {
+    if (root < 0) throw new Error('Root must be greater than zero');
+    if (root === 0) throw new Error('Root must be non-zero');
+    if (root % 1 !== 0) throw new Error('Root must be an integer');
+    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)];
+    const aIsNumeric = typeof a === 'number';
+    let offset;
+    // determine the offset (argument of a)/(pi/2)
+    if (aIsNumeric || a.re === 0 || a.im === 0) {
+      if (aIsNumeric) {
+        offset = 2 * +(a < 0); // numeric value on the real axis
+      } else if (a.im === 0) {
+        offset = 2 * +(a.re < 0); // complex value on the real axis
+      } else {
+        offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis
+      }
+    }
+    const arg = a.arg();
+    const abs = a.abs();
+    const roots = [];
+    const r = Math.pow(abs, 1 / root);
+    for (let k = 0; k < root; k++) {
+      const halfPiFactor = (offset + 4 * k) / root;
+      /**
+       * If (offset + 4*k)/root is an integral multiple of pi/2
+       * then we can produce a more exact result.
+       */
+      if (halfPiFactor === Math.round(halfPiFactor)) {
+        roots.push(_calculateExactResult[halfPiFactor % 4](r));
+        continue;
+      }
+      roots.push(new Complex({
+        r,
+        phi: (arg + 2 * Math.PI * k) / root
+      }));
+    }
+    return roots;
+  }
+
+  /**
+   * Calculate the nth roots of a value.
+   * An nth root of a positive real number A,
+   * is a positive real solution of the equation "x^root = A".
+   * This function returns an array of complex values.
+   *
+   * Syntax:
+   *
+   *    math.nthRoots(x)
+   *    math.nthRoots(x, root)
+   *
+   * Examples:
+   *
+   *    math.nthRoots(1)
+   *    // returns [
+   *    //   {re: 1, im: 0},
+   *    //   {re: -1, im: 0}
+   *    // ]
+   *    math.nthRoots(1, 3)
+   *    // returns [
+   *    //   { re: 1, im: 0 },
+   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },
+   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }
+   *    // ]
+   *
+   * See also:
+   *
+   *    nthRoot, pow, sqrt
+   *
+   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded
+   * @param {number} [root=2] Optional root, default value is 2
+   * @return {number | BigNumber | Fraction | Complex} Returns the nth roots
+   */
+  return typed(name, {
+    Complex: function (x) {
+      return _nthComplexRoots(x, 2);
+    },
+    'Complex, number': _nthComplexRoots
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js b/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js
new file mode 100644
index 0000000..213004c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/pow.js
@@ -0,0 +1,198 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPow = void 0;
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _array = require("../../utils/array.js");
+var _index = require("../../plain/number/index.js");
+const name = 'pow';
+const dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'inv', 'fraction', 'number', 'Complex'];
+const createPow = exports.createPow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    identity,
+    multiply,
+    matrix,
+    inv,
+    number,
+    fraction,
+    Complex
+  } = _ref;
+  /**
+   * Calculates the power of x to y, `x ^ y`.
+   *
+   * Matrix exponentiation is supported for square matrices `x` and integers `y`:
+   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is
+   * negative, `x` must be invertible, and then this function returns
+   * inv(x)^(-y).
+   *
+   * For cubic roots of negative numbers, the function returns the principal
+   * root by default. In order to let the function return the real root,
+   * math.js can be configured with `math.config({predictable: true})`.
+   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
+   *
+   * Syntax:
+   *
+   *    math.pow(x, y)
+   *
+   * Examples:
+   *
+   *    math.pow(2, 3)               // returns number 8
+   *
+   *    const a = math.complex(2, 3)
+   *    math.pow(a, 2)                // returns Complex -5 + 12i
+   *
+   *    const b = [[1, 2], [4, 3]]
+   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]
+   *
+   * See also:
+   *
+   *    multiply, sqrt, cbrt, nthRoot
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | bigint | Complex} y                          The exponent
+   * @return {number | BigNumber | bigint | Complex | Array | Matrix} The value of `x` to the power `y`
+   */
+  return typed(name, {
+    'number, number': _pow,
+    'Complex, Complex': function (x, y) {
+      return x.pow(y);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      if (y.isInteger() || x >= 0 || config.predictable) {
+        return x.pow(y);
+      } else {
+        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0);
+      }
+    },
+    'bigint, bigint': (x, y) => x ** y,
+    'Fraction, Fraction': function (x, y) {
+      const result = x.pow(y);
+      if (result != null) {
+        return result;
+      }
+      if (config.predictable) {
+        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');
+      } else {
+        return _pow(x.valueOf(), y.valueOf());
+      }
+    },
+    'Array, number': _powArray,
+    'Array, BigNumber': function (x, y) {
+      return _powArray(x, y.toNumber());
+    },
+    'Matrix, number': _powMatrix,
+    'Matrix, BigNumber': function (x, y) {
+      return _powMatrix(x, y.toNumber());
+    },
+    'Unit, number | BigNumber': function (x, y) {
+      return x.pow(y);
+    }
+  });
+
+  /**
+   * Calculates the power of x to y, x^y, for two numbers.
+   * @param {number} x
+   * @param {number} y
+   * @return {number | Complex} res
+   * @private
+   */
+  function _pow(x, y) {
+    // Alternatively could define a 'realmode' config option or something, but
+    // 'predictable' will work for now
+    if (config.predictable && !(0, _number.isInteger)(y) && x < 0) {
+      // Check to see if y can be represented as a fraction
+      try {
+        const yFrac = fraction(y);
+        const yNum = number(yFrac);
+        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {
+          if (yFrac.d % 2n === 1n) {
+            return (yFrac.n % 2n === 0n ? 1 : -1) * Math.pow(-x, y);
+          }
+        }
+      } catch (ex) {
+        // fraction() throws an error if y is Infinity, etc.
+      }
+
+      // Unable to express y as a fraction, so continue on
+    }
+
+    // **for predictable mode** x^Infinity === NaN if x < -1
+    // N.B. this behavour is different from `Math.pow` which gives
+    // (-2)^Infinity === Infinity
+    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {
+      return NaN;
+    }
+    if ((0, _number.isInteger)(y) || x >= 0 || config.predictable) {
+      return (0, _index.powNumber)(x, y);
+    } else {
+      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow
+
+      // x^Infinity === 0 if -1 < x < 1
+      // A real number 0 is returned instead of complex(0)
+      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+        return 0;
+      }
+      return new Complex(x, 0).pow(y, 0);
+    }
+  }
+
+  /**
+   * Calculate the power of a 2d array
+   * @param {Array} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a integer value (positive if `x` is not invertible)
+   * @returns {Array}
+   * @private
+   */
+  function _powArray(x, y) {
+    if (!(0, _number.isInteger)(y)) {
+      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')');
+    }
+    // verify that A is a 2 dimensional square matrix
+    const s = (0, _array.arraySize)(x);
+    if (s.length !== 2) {
+      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');
+    }
+    if (s[0] !== s[1]) {
+      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');
+    }
+    if (y < 0) {
+      try {
+        return _powArray(inv(x), -y);
+      } catch (error) {
+        if (error.message === 'Cannot calculate inverse, determinant is zero') {
+          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')');
+        }
+        throw error;
+      }
+    }
+    let res = identity(s[0]).valueOf();
+    let px = x;
+    while (y >= 1) {
+      if ((y & 1) === 1) {
+        res = multiply(px, res);
+      }
+      y >>= 1;
+      px = multiply(px, px);
+    }
+    return res;
+  }
+
+  /**
+   * Calculate the power of a 2d matrix
+   * @param {Matrix} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Matrix}
+   * @private
+   */
+  function _powMatrix(x, y) {
+    return matrix(_powArray(x.valueOf(), y));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/round.js b/node_modules/mathjs/lib/cjs/function/arithmetic/round.js
new file mode 100644
index 0000000..38e76be
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/round.js
@@ -0,0 +1,210 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRound = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _index = require("../../plain/number/index.js");
+const NO_INT = 'Number of decimals in function round must be an integer';
+const name = 'round';
+const dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];
+const createRound = exports.createRound = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    equalScalar,
+    zeros,
+    BigNumber,
+    DenseMatrix
+  } = _ref;
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  function toExponent(epsilon) {
+    return Math.abs((0, _number.splitNumber)(epsilon).exponent);
+  }
+
+  /**
+   * Round a value towards the nearest rounded value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.round(x)
+   *    math.round(x, n)
+   *    math.round(unit, valuelessUnit)
+   *    math.round(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.round(3.22)             // returns number 3
+   *    math.round(3.82)             // returns number 4
+   *    math.round(-4.2)             // returns number -4
+   *    math.round(-4.7)             // returns number -5
+   *    math.round(3.22, 1)          // returns number 3.2
+   *    math.round(3.88, 1)          // returns number 3.9
+   *    math.round(-4.21, 1)         // returns number -4.2
+   *    math.round(-4.71, 1)         // returns number -4.7
+   *    math.round(math.pi, 3)       // returns number 3.142
+   *    math.round(123.45678, 2)     // returns number 123.46
+   *
+   *    const c = math.complex(3.2, -2.7)
+   *    math.round(c)                // returns Complex 3 - 3i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.round(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.round(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
+   *
+   * See also:
+   *
+   *    ceil, fix, floor
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed(name, {
+    number: function (x) {
+      // Handle round off errors by first rounding to relTol precision
+      const xEpsilon = (0, _index.roundNumber)(x, toExponent(config.relTol));
+      const xSelected = (0, _number.nearlyEqual)(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return (0, _index.roundNumber)(xSelected);
+    },
+    'number, number': function (x, n) {
+      // Same as number: unless user specifies more decimals than relTol
+      const epsilonExponent = toExponent(config.relTol);
+      if (n >= epsilonExponent) {
+        return (0, _index.roundNumber)(x, n);
+      }
+      const xEpsilon = (0, _index.roundNumber)(x, epsilonExponent);
+      const xSelected = (0, _number.nearlyEqual)(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return (0, _index.roundNumber)(xSelected, n);
+    },
+    'number, BigNumber': function (x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      return new BigNumber(x).toDecimalPlaces(n.toNumber());
+    },
+    Complex: function (x) {
+      return x.round();
+    },
+    'Complex, number': function (x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n);
+    },
+    'Complex, BigNumber': function (x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      const _n = n.toNumber();
+      return x.round(_n);
+    },
+    BigNumber: function (x) {
+      // Handle round off errors by first rounding to relTol precision
+      const xEpsilon = new BigNumber(x).toDecimalPlaces(toExponent(config.relTol));
+      const xSelected = (0, _nearlyEqual.nearlyEqual)(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return xSelected.toDecimalPlaces(0);
+    },
+    'BigNumber, BigNumber': function (x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      // Same as BigNumber: unless user specifies more decimals than relTol
+      const epsilonExponent = toExponent(config.relTol);
+      if (n >= epsilonExponent) {
+        return x.toDecimalPlaces(n.toNumber());
+      }
+      const xEpsilon = x.toDecimalPlaces(epsilonExponent);
+      const xSelected = (0, _nearlyEqual.nearlyEqual)(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return xSelected.toDecimalPlaces(n.toNumber());
+    },
+    // bigints can't be rounded
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function (x) {
+      return x.round();
+    },
+    'Fraction, number': function (x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n);
+    },
+    'Fraction, BigNumber': function (x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      const valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since round(0) = 0
+      return (0, _collection.deepMap)(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since round(0) = 0
+      return (0, _collection.deepMap)(x, self, true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      return matAlgo11xS0s(x, n, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      return matAlgo14xDs(x, n, self, false);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), n, self, false).valueOf();
+    }),
+    'number | Complex | BigNumber | Fraction, SparseMatrix': typed.referToSelf(self => (x, n) => {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(n.size(), n.storage());
+      }
+      return matAlgo12xSfs(n, x, self, true);
+    }),
+    'number | Complex | BigNumber | Fraction, DenseMatrix': typed.referToSelf(self => (x, n) => {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(n.size(), n.storage());
+      }
+      return matAlgo14xDs(n, x, self, true);
+    }),
+    'number | Complex | BigNumber | Fraction, Array': typed.referToSelf(self => (x, n) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(n), x, self, true).valueOf();
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js b/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js
new file mode 100644
index 0000000..8ed1ea1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/sign.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSign = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _index = require("../../plain/number/index.js");
+const name = 'sign';
+const dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];
+const createSign = exports.createSign = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber,
+    complex,
+    Fraction
+  } = _ref;
+  /**
+   * Compute the sign of a value. The sign of a value x is:
+   *
+   * -  1 when x > 0
+   * - -1 when x < 0
+   * -  0 when x == 0
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sign(x)
+   *
+   * Examples:
+   *
+   *    math.sign(3.5)               // returns 1
+   *    math.sign(-4.2)              // returns -1
+   *    math.sign(0)                 // returns 0
+   *
+   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]
+   *
+   * See also:
+   *
+   *    abs
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x
+   *            The number for which to determine the sign
+   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}
+   *            The sign of `x`
+   */
+  return typed(name, {
+    number: _index.signNumber,
+    Complex: function (x) {
+      return x.im === 0 ? complex((0, _index.signNumber)(x.re)) : x.sign();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(x.cmp(0));
+    },
+    bigint: function (x) {
+      return x > 0n ? 1n : x < 0n ? -1n : 0n;
+    },
+    Fraction: function (x) {
+      return x.n === 0n ? new Fraction(0) : new Fraction(x.s);
+    },
+    // deep map collection, skip zeros since sign(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self, true)),
+    Unit: typed.referToSelf(self => x => {
+      if (!x._isDerived() && x.units[0].unit.offset !== 0) {
+        throw new TypeError('sign is ambiguous for units with offset');
+      }
+      return typed.find(self, x.valueType())(x.value);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..d0a159b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/sqrt.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqrt = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'sqrt';
+const dependencies = ['config', 'typed', 'Complex'];
+const createSqrt = exports.createSqrt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    config,
+    typed,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the square root of a value.
+   *
+   * For matrices, if you want the matrix square root of a square matrix,
+   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to
+   * a matrix M, use `math.map(M, math.sqrt)`.
+   *
+   * Syntax:
+   *
+   *    math.sqrt(x)
+   *
+   * Examples:
+   *
+   *    math.sqrt(25)                // returns 5
+   *    math.square(5)               // returns 25
+   *    math.sqrt(-4)                // returns Complex 2i
+   *
+   * See also:
+   *
+   *    square, multiply, cube, cbrt, sqrtm
+   *
+   * @param {number | BigNumber | Complex | Unit} x
+   *            Value for which to calculate the square root.
+   * @return {number | BigNumber | Complex | Unit}
+   *            Returns the square root of `x`
+   */
+  return typed('sqrt', {
+    number: _sqrtNumber,
+    Complex: function (x) {
+      return x.sqrt();
+    },
+    BigNumber: function (x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.sqrt();
+      } else {
+        // negative value -> downgrade to number to do complex value computation
+        return _sqrtNumber(x.toNumber());
+      }
+    },
+    Unit: function (x) {
+      // Someday will work for complex units when they are implemented
+      return x.pow(0.5);
+    }
+  });
+
+  /**
+   * Calculate sqrt for a number
+   * @param {number} x
+   * @returns {number | Complex} Returns the square root of x
+   * @private
+   */
+  function _sqrtNumber(x) {
+    if (isNaN(x)) {
+      return NaN;
+    } else if (x >= 0 || config.predictable) {
+      return Math.sqrt(x);
+    } else {
+      return new Complex(x, 0).sqrt();
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/square.js b/node_modules/mathjs/lib/cjs/function/arithmetic/square.js
new file mode 100644
index 0000000..279334d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/square.js
@@ -0,0 +1,61 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSquare = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'square';
+const dependencies = ['typed'];
+const createSquare = exports.createSquare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the square of a value, `x * x`.
+   * To avoid confusion with multiplying a square matrix by itself,
+   * this function does not apply to matrices. If you wish to square
+   * every element of a matrix, see the examples.
+   *
+   * Syntax:
+   *
+   *    math.square(x)
+   *
+   * Examples:
+   *
+   *    math.square(2)           // returns number 4
+   *    math.square(3)           // returns number 9
+   *    math.pow(3, 2)           // returns number 9
+   *    math.multiply(3, 3)      // returns number 9
+   *
+   *    math.map([1, 2, 3, 4], math.square)  // returns Array [1, 4, 9, 16]
+   *
+   * See also:
+   *
+   *    multiply, cube, sqrt, pow
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x
+   *            Number for which to calculate the square
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}
+   *            Squared value
+   */
+  return typed(name, {
+    number: _index.squareNumber,
+    Complex: function (x) {
+      return x.mul(x);
+    },
+    BigNumber: function (x) {
+      return x.times(x);
+    },
+    bigint: function (x) {
+      return x * x;
+    },
+    Fraction: function (x) {
+      return x.mul(x);
+    },
+    Unit: function (x) {
+      return x.pow(2);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..ebd04a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/subtract.js
@@ -0,0 +1,92 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubtract = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo05xSfSf = require("../../type/matrix/utils/matAlgo05xSfSf.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'subtract';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'subtractScalar', 'unaryMinus', 'DenseMatrix', 'concat'];
+const createSubtract = exports.createSubtract = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    subtractScalar,
+    unaryMinus,
+    DenseMatrix,
+    concat
+  } = _ref;
+  // TODO: split function subtract in two: subtract and subtractScalar
+
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Subtract two values, `x - y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.subtract(x, y)
+   *
+   * Examples:
+   *
+   *    math.subtract(5.3, 2)        // returns number 3.3
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.subtract(a, b)          // returns Complex -2 + 2i
+   *
+   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]
+   *
+   *    const c = math.unit('2.1 km')
+   *    const d = math.unit('500m')
+   *    math.subtract(c, d)          // returns Unit 1.6 km
+   *
+   * See also:
+   *
+   *    add
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Initial value
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`
+   */
+  return typed(name, {
+    'any, any': subtractScalar
+  }, matrixAlgorithmSuite({
+    elop: subtractScalar,
+    SS: matAlgo05xSfSf,
+    DS: matAlgo01xDSid,
+    SD: matAlgo03xDSf,
+    Ss: matAlgo12xSfs,
+    sS: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/subtractScalar.js b/node_modules/mathjs/lib/cjs/function/arithmetic/subtractScalar.js
new file mode 100644
index 0000000..6a2da88
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/subtractScalar.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubtractScalar = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'subtractScalar';
+const dependencies = ['typed'];
+const createSubtractScalar = exports.createSubtractScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Subtract two scalar values, `x - y`.
+   * This function is meant for internal use: it is used by the public function
+   * `subtract`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to be subtracted from `x`
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Difference of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': _index.subtractNumber,
+    'Complex, Complex': function (x, y) {
+      return x.sub(y);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return x.minus(y);
+    },
+    'bigint, bigint': function (x, y) {
+      return x - y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return x.sub(y);
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (x.value === null || x.value === undefined) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+      if (y.value === null || y.value === undefined) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      const res = x.clone();
+      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..34844db
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnaryMinus = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _index = require("../../plain/number/index.js");
+const name = 'unaryMinus';
+const dependencies = ['typed'];
+const createUnaryMinus = exports.createUnaryMinus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Inverse the sign of a value, apply a unary minus operation.
+   *
+   * For matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real and
+   * complex value are inverted.
+   *
+   * Syntax:
+   *
+   *    math.unaryMinus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryMinus(3.5)      // returns -3.5
+   *    math.unaryMinus(-4.2)     // returns 4.2
+   *
+   * See also:
+   *
+   *    add, subtract, unaryPlus
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.
+   */
+  return typed(name, {
+    number: _index.unaryMinusNumber,
+    'Complex | BigNumber | Fraction': x => x.neg(),
+    bigint: x => -x,
+    Unit: typed.referToSelf(self => x => {
+      const res = x.clone();
+      res.value = typed.find(self, res.valueType())(x.value);
+      return res;
+    }),
+    // deep map collection, skip zeros since unaryMinus(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self, true))
+
+    // TODO: add support for string
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..af6da31
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnaryPlus = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+var _index = require("../../plain/number/index.js");
+var _number = require("../../utils/number.js");
+const name = 'unaryPlus';
+const dependencies = ['typed', 'config', 'numeric'];
+const createUnaryPlus = exports.createUnaryPlus = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric
+  } = _ref;
+  /**
+   * Unary plus operation.
+   * Boolean values and strings will be converted to a number, numeric values will be returned as is.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.unaryPlus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryPlus(3.5)      // returns 3.5
+   *    math.unaryPlus(1)     // returns 1
+   *
+   * See also:
+   *
+   *    unaryMinus, add, subtract
+   *
+   * @param  {number | BigNumber | bigint | Fraction | string | Complex | Unit | Array | Matrix} x
+   *            Input value
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns the input value when numeric, converts to a number when input is non-numeric.
+   */
+  return typed(name, {
+    number: _index.unaryPlusNumber,
+    Complex: function (x) {
+      return x; // complex numbers are immutable
+    },
+    BigNumber: function (x) {
+      return x; // bignumbers are immutable
+    },
+    bigint: function (x) {
+      return x;
+    },
+    Fraction: function (x) {
+      return x; // fractions are immutable
+    },
+    Unit: function (x) {
+      return x.clone();
+    },
+    // deep map collection, skip zeros since unaryPlus(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self, true)),
+    boolean: function (x) {
+      return numeric(x ? 1 : 0, config.number);
+    },
+    string: function (x) {
+      return numeric(x, (0, _number.safeNumberType)(x, config));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..e79cd9f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/arithmetic/xgcd.js
@@ -0,0 +1,97 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createXgcd = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'xgcd';
+const dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+const createXgcd = exports.createXgcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the extended greatest common divisor for two values.
+   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   *
+   * Syntax:
+   *
+   *    math.xgcd(a, b)
+   *
+   * Examples:
+   *
+   *    math.xgcd(8, 12)             // returns [4, -1, 1]
+   *    math.gcd(8, 12)              // returns 4
+   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]
+   *
+   * See also:
+   *
+   *    gcd, lcm
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`
+   *                              where `div = gcd(a, b)` and `a*m + b*n = div`
+   */
+  return typed(name, {
+    'number, number': function (a, b) {
+      const res = (0, _index.xgcdNumber)(a, b);
+      return config.matrix === 'Array' ? res : matrix(res);
+    },
+    'BigNumber, BigNumber': _xgcdBigNumber
+    // TODO: implement support for Fraction
+  });
+
+  /**
+   * Calculate xgcd for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @return {BigNumber[]} result
+   * @private
+   */
+  function _xgcdBigNumber(a, b) {
+    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+    let
+    // used to swap two variables
+    t;
+    let
+    // quotient
+    q;
+    let
+    // remainder
+    r;
+    const zero = new BigNumber(0);
+    const one = new BigNumber(1);
+    let x = zero;
+    let lastx = one;
+    let y = one;
+    let lasty = zero;
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function xgcd must be integer numbers');
+    }
+    while (!b.isZero()) {
+      q = a.div(b).floor();
+      r = a.mod(b);
+      t = x;
+      x = lastx.minus(q.times(x));
+      lastx = t;
+      t = y;
+      y = lasty.minus(q.times(y));
+      lasty = t;
+      a = b;
+      b = r;
+    }
+    let res;
+    if (a.lt(zero)) {
+      res = [a.neg(), lastx.neg(), lasty.neg()];
+    } else {
+      res = [a, !a.isZero() ? lastx : 0, lasty];
+    }
+    return config.matrix === 'Array' ? res : matrix(res);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..9d419ff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitAnd.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitAnd = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo06xS0S = require("../../type/matrix/utils/matAlgo06xS0S0.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'bitAnd';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];
+const createBitAnd = exports.createBitAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    concat
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise AND two values, `x & y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitAnd(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitAnd(53, 131)               // returns number 1
+   *
+   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]
+   *
+   * See also:
+   *
+   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to and
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to and
+   * @return {number | BigNumber | bigint | Array | Matrix} AND of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': _index.bitAndNumber,
+    'BigNumber, BigNumber': _bitwise.bitAndBigNumber,
+    'bigint, bigint': (x, y) => x & y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..98aa3e6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitNot.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitNot = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'bitNot';
+const dependencies = ['typed'];
+const createBitNot = exports.createBitNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Bitwise NOT value, `~x`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.bitNot(x)
+   *
+   * Examples:
+   *
+   *    math.bitNot(1)               // returns number -2
+   *
+   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, -5]
+   *
+   * See also:
+   *
+   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to not
+   * @return {number | BigNumber | bigint | Array | Matrix} NOT of `x`
+   */
+  return typed(name, {
+    number: _index.bitNotNumber,
+    BigNumber: _bitwise.bitNotBigNumber,
+    bigint: x => ~x,
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..f269ec2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitOr.js
@@ -0,0 +1,73 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitOr = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo04xSidSid = require("../../type/matrix/utils/matAlgo04xSidSid.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'bitOr';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+const createBitOr = exports.createBitOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo04xSidSid = (0, _matAlgo04xSidSid.createMatAlgo04xSidSid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise OR two values, `x | y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the lowest print base.
+   *
+   * Syntax:
+   *
+   *    math.bitOr(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitOr(1, 2)               // returns number 3
+   *
+   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to or
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to or
+   * @return {number | BigNumber | bigint | Array | Matrix} OR of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': _index.bitOrNumber,
+    'BigNumber, BigNumber': _bitwise.bitOrBigNumber,
+    'bigint, bigint': (x, y) => x | y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo04xSidSid,
+    DS: matAlgo01xDSid,
+    Ss: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..928601f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/bitXor.js
@@ -0,0 +1,72 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBitXor = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'bitXor';
+const dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createBitXor = exports.createBitXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise XOR two values, `x ^ y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitXor(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitXor(1, 2)               // returns number 3
+   *
+   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to xor
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to xor
+   * @return {number | BigNumber | bigint | Array | Matrix} XOR of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': _index.bitXorNumber,
+    'BigNumber, BigNumber': _bitwise.bitXor,
+    'bigint, bigint': (x, y) => x ^ y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..e686e6e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/leftShift.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLeftShift = void 0;
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo08xS0Sid = require("../../type/matrix/utils/matAlgo08xS0Sid.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _useMatrixForArrayScalar = require("./useMatrixForArrayScalar.js");
+var _index = require("../../plain/number/index.js");
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+const name = 'leftShift';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+const createLeftShift = exports.createLeftShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, `x << y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.leftShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.leftShift(1, 2)               // returns number 4
+   *
+   *    math.leftShift([1, 2, 4], 4)       // returns Array [16, 32, 64]
+   *
+   * See also:
+   *
+   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber | bigint} y Amount of shifts
+   * @return {number | BigNumber | bigint | Array | Matrix} `x` shifted left `y` times
+   */
+  return typed(name, {
+    'number, number': _index.leftShiftNumber,
+    'BigNumber, BigNumber': _bitwise.leftShiftBigNumber,
+    'bigint, bigint': (x, y) => x << y,
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..2c2af03
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/rightArithShift.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightArithShift = void 0;
+var _bitwise = require("../../utils/bignumber/bitwise.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo08xS0Sid = require("../../type/matrix/utils/matAlgo08xS0Sid.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _useMatrixForArrayScalar = require("./useMatrixForArrayScalar.js");
+var _index = require("../../plain/number/index.js");
+const name = 'rightArithShift';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+const createRightArithShift = exports.createRightArithShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightArithShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightArithShift(4, 2)               // returns number 1
+   *
+   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 4]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber | bigint} y Amount of shifts
+   * @return {number | BigNumber | bigint | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+  return typed(name, {
+    'number, number': _index.rightArithShiftNumber,
+    'BigNumber, BigNumber': _bitwise.rightArithShiftBigNumber,
+    'bigint, bigint': (x, y) => x >> y,
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..e35c2cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/rightLogShift.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRightLogShift = void 0;
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
+var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
+var _matAlgo08xS0Sid = require("../../type/matrix/utils/matAlgo08xS0Sid.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+var _useMatrixForArrayScalar = require("./useMatrixForArrayScalar.js");
+const name = 'rightLogShift';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+const createRightLogShift = exports.createRightLogShift = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
+    typed
+  });
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo08xS0Sid = (0, _matAlgo08xS0Sid.createMatAlgo08xS0Sid)({
+    typed,
+    equalScalar
+  });
+  const matAlgo10xSids = (0, _matAlgo10xSids.createMatAlgo10xSids)({
+    typed,
+    DenseMatrix
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const useMatrixForArrayScalar = (0, _useMatrixForArrayScalar.createUseMatrixForArrayScalar)({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightLogShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightLogShift(4, 2)               // returns number 1
+   *
+   *    math.rightLogShift([16, 32, 64], 4)    // returns Array [1, 2, 4]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
+   *
+   * @param  {number | Array | Matrix} x Value to be shifted
+   * @param  {number} y Amount of shifts
+   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': _index.rightLogShiftNumber,
+    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
+
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/bitwise/useMatrixForArrayScalar.js b/node_modules/mathjs/lib/cjs/function/bitwise/useMatrixForArrayScalar.js
new file mode 100644
index 0000000..8b1a863
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/bitwise/useMatrixForArrayScalar.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUseMatrixForArrayScalar = void 0;
+var _factory = require("../../utils/factory.js");
+const createUseMatrixForArrayScalar = exports.createUseMatrixForArrayScalar = /* #__PURE__ */(0, _factory.factory)('useMatrixForArrayScalar', ['typed', 'matrix'], _ref => {
+  let {
+    typed,
+    matrix
+  } = _ref;
+  return {
+    'Array, number': typed.referTo('DenseMatrix, number', selfDn => (x, y) => selfDn(matrix(x), y).valueOf()),
+    'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber', selfDB => (x, y) => selfDB(matrix(x), y).valueOf()),
+    'number, Array': typed.referTo('number, DenseMatrix', selfnD => (x, y) => selfnD(x, matrix(y)).valueOf()),
+    'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix', selfBD => (x, y) => selfBD(x, matrix(y)).valueOf())
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..1dc1b92
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBellNumbers = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'bellNumbers';
+const dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
+const createBellNumbers = exports.createBellNumbers = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    isNegative,
+    isInteger,
+    stirlingS2
+  } = _ref;
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
+   * bellNumbers only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.bellNumbers(n)
+   *
+   * Examples:
+   *
+   *    math.bellNumbers(3) // returns 5
+   *    math.bellNumbers(8) // returns 4140
+   *
+   * See also:
+   *
+   *    stirlingS2
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @return {Number | BigNumber}     B(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function (n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function bellNumbers');
+      }
+
+      // Sum (k=0, n) S(n,k).
+      let result = 0;
+      for (let i = 0; i <= n; i++) {
+        result = addScalar(result, stirlingS2(n, i));
+      }
+      return result;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..3f4646d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/catalan.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCatalan = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'catalan';
+const dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
+const createCatalan = exports.createCatalan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    combinations,
+    isNegative,
+    isInteger
+  } = _ref;
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many different types.
+   * catalan only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.catalan(n)
+   *
+   * Examples:
+   *
+   *    math.catalan(3) // returns 5
+   *    math.catalan(8) // returns 1430
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    nth Catalan number
+   * @return {Number | BigNumber}     Cn(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function (n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function catalan');
+      }
+      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js b/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js
new file mode 100644
index 0000000..f13ca1e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/composition.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComposition = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'composition';
+const dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
+const createComposition = exports.createComposition = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    combinations,
+    isPositive,
+    isNegative,
+    isInteger,
+    larger
+  } = _ref;
+  /**
+   * The composition counts of n into k parts.
+   *
+   * composition only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *   math.composition(n, k)
+   *
+   * Examples:
+   *
+   *    math.composition(5, 3) // returns 6
+   *
+   * See also:
+   *
+   *    combinations
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function (n, k) {
+      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {
+        throw new TypeError('Positive integer value expected in function composition');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function composition');
+      }
+      return combinations(addScalar(n, -1), addScalar(k, -1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..7e7dfcc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,92 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStirlingS2 = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'stirlingS2';
+const dependencies = ['typed', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];
+const createStirlingS2 = exports.createStirlingS2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    factorial,
+    combinations,
+    isNegative,
+    isInteger,
+    number,
+    bignumber,
+    larger
+  } = _ref;
+  const smallCache = [];
+  const bigCache = [];
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to partition
+   * a set of n labelled objects into k nonempty unlabelled subsets.
+   * stirlingS2 only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   *  If n = k or k = 1 <= n, then s(n,k) = 1
+   *  If k = 0 < n, then s(n,k) = 0
+   *
+   * Note that if either n or k is supplied as a BigNumber, the result will be
+   * as well.
+   *
+   * Syntax:
+   *
+   *   math.stirlingS2(n, k)
+   *
+   * Examples:
+   *
+   *    math.stirlingS2(5, 3) //returns 25
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     S(n,k)
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function (n, k) {
+      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {
+        throw new TypeError('Non-negative integer value expected in function stirlingS2');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function stirlingS2');
+      }
+      const big = !((0, _is.isNumber)(n) && (0, _is.isNumber)(k));
+      const cache = big ? bigCache : smallCache;
+      const make = big ? bignumber : number;
+      const nn = number(n);
+      const nk = number(k);
+      /* See if we already have the value: */
+      if (cache[nn] && cache[nn].length > nk) {
+        return cache[nn][nk];
+      }
+      /* Fill the cache */
+      for (let m = 0; m <= nn; ++m) {
+        if (!cache[m]) {
+          cache[m] = [m === 0 ? make(1) : make(0)];
+        }
+        if (m === 0) continue;
+        const row = cache[m];
+        const prev = cache[m - 1];
+        for (let i = row.length; i <= m && i <= nk; ++i) {
+          if (i === m) {
+            row[i] = 1;
+          } else {
+            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);
+          }
+        }
+      }
+      return cache[nn][nk];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/arg.js b/node_modules/mathjs/lib/cjs/function/complex/arg.js
new file mode 100644
index 0000000..21c7f90
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/arg.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createArg = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+const name = 'arg';
+const dependencies = ['typed'];
+const createArg = exports.createArg = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the argument of a complex value.
+   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.arg(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 2)
+   *    math.arg(a) / math.pi          // returns number 0.25
+   *
+   *    const b = math.complex('2 + 3i')
+   *    math.arg(b)                    // returns number 0.982793723247329
+   *    math.atan2(3, 2)               // returns number 0.982793723247329
+   *
+   * See also:
+   *
+   *    re, im, conj, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The argument of x
+   */
+  return typed(name, {
+    number: function (x) {
+      return Math.atan2(0, x);
+    },
+    BigNumber: function (x) {
+      return x.constructor.atan2(0, x);
+    },
+    Complex: function (x) {
+      return x.arg();
+    },
+    // TODO: implement BigNumber support for function arg
+
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/conj.js b/node_modules/mathjs/lib/cjs/function/complex/conj.js
new file mode 100644
index 0000000..bd6c6da
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/conj.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConj = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+const name = 'conj';
+const dependencies = ['typed'];
+const createConj = exports.createConj = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the complex conjugate of a complex value.
+   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.conj(x)
+   *
+   * Examples:
+   *
+   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i
+   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i
+   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i
+   *
+   * See also:
+   *
+   *    re, im, arg, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Complex | Array | Matrix | Unit}
+   *            The complex conjugate of x
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction': x => x,
+    Complex: x => x.conjugate(),
+    Unit: typed.referToSelf(self => x => new x.constructor(self(x.toNumeric()), x.formatUnits())),
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/im.js b/node_modules/mathjs/lib/cjs/function/complex/im.js
new file mode 100644
index 0000000..f082801
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/im.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIm = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+const name = 'im';
+const dependencies = ['typed'];
+const createIm = exports.createIm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Get the imaginary part of a complex number.
+   * For a complex number `a + bi`, the function returns `b`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.im(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number -5.2
+   *    math.re(math.complex(2.4))     // returns number 0
+   *
+   * See also:
+   *
+   *    re, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The imaginary part of x
+   */
+  return typed(name, {
+    number: () => 0,
+    'BigNumber | Fraction': x => x.mul(0),
+    Complex: x => x.im,
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/complex/re.js b/node_modules/mathjs/lib/cjs/function/complex/re.js
new file mode 100644
index 0000000..9886d65
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/complex/re.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRe = void 0;
+var _factory = require("../../utils/factory.js");
+var _collection = require("../../utils/collection.js");
+const name = 're';
+const dependencies = ['typed'];
+const createRe = exports.createRe = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Get the real part of a complex number.
+   * For a complex number `a + bi`, the function returns `a`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.re(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number 0
+   *    math.re(math.complex(2.4))     // returns number 2.4
+   *
+   * See also:
+   *
+   *    im, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The real part of x
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction': x => x,
+    Complex: x => x.re,
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/geometry/distance.js b/node_modules/mathjs/lib/cjs/function/geometry/distance.js
new file mode 100644
index 0000000..792453b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/geometry/distance.js
@@ -0,0 +1,311 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDistance = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'distance';
+const dependencies = ['typed', 'addScalar', 'subtractScalar', 'divideScalar', 'multiplyScalar', 'deepEqual', 'sqrt', 'abs'];
+const createDistance = exports.createDistance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    deepEqual,
+    sqrt,
+    abs
+  } = _ref;
+  /**
+    * Calculates:
+    *    The eucledian distance between two points in N-dimensional spaces.
+    *    Distance between point and a line in 2 and 3 dimensional spaces.
+    *    Pairwise distance between a set of 2D or 3D points
+    * NOTE:
+    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
+    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
+    *
+    * Syntax:
+    *
+    *    math.distance([x1,y1], [x2,y2])
+    *    math.distance({pointOneX, pointOneY}, {pointTwoX, pointTwoY})
+    *    math.distance([x1,y1,z1], [x2,y2,z2])
+    *    math.distance({pointOneX, pointOneY, pointOneZ}, {pointTwoX, pointTwoY, pointTwoZ})
+    *    math.distance([x1,y1,z1,a1], [x2,y2,z2,a2])
+    *    math.distance([[x1,y1], [x2,y2], [x3,y3]])
+    *    math.distance([[x1,y1,z1], [x2,y2,z2], [x3,y3,z3]])
+    *    math.distance([pointX,pointY], [a,b,c])
+    *    math.distance([pointX,pointY], [lineOnePtX,lineOnePtY], [lineTwoPtX,lineTwoPtY])
+    *    math.distance({pointX, pointY}, {lineOnePtX, lineOnePtY}, {lineTwoPtX, lineTwoPtY})
+    *    math.distance([pointX,pointY,pointZ], [x0, y0, z0, a, b, c])
+    *    math.distance({pointX, pointY, pointZ}, {x0, y0, z0, a, b, c})
+    *
+    * Examples:
+    *    math.distance([0,0], [4,4])                     // Returns 5.656854249492381
+    *    math.distance(
+    *     {pointOneX: 0, pointOneY: 0},
+    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951
+    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.7416573867739413
+    *    math.distance(
+    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
+    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3
+    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2
+    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]
+    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]
+    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387
+    *    math.distance([0, 0], [3, 0], [0, 4])        // Returns 2.4
+    *    math.distance(
+    *     {pointX: 0, pointY: 0},
+    *     {lineOnePtX: 3, lineOnePtY: 0},
+    *     {lineTwoPtX: 0, lineTwoPtY: 4})                // Returns 2.4
+    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857
+    *    math.distance(
+    *     {pointX: 2, pointY: 3, pointZ: 1},
+    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1})       // Returns 2.3204774044612857
+    *
+    * @param {Array | Matrix | Object} x    Co-ordinates of first point
+    * @param {Array | Matrix | Object} y    Co-ordinates of second point
+    * @return {Number | BigNumber} Returns the distance from two/three points
+  */
+  return typed(name, {
+    'Array, Array, Array': function (x, y, z) {
+      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)
+      if (x.length === 2 && y.length === 2 && z.length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+        }
+        if (!_2d(z)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+        }
+        if (deepEqual(y, z)) {
+          throw new TypeError('LinePoint1 should not be same with LinePoint2');
+        }
+        const xCoeff = subtractScalar(z[1], y[1]);
+        const yCoeff = subtractScalar(y[0], z[0]);
+        const constant = subtractScalar(multiplyScalar(z[0], y[1]), multiplyScalar(y[0], z[1]));
+        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object, Object': function (x, y, z) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');
+        }
+        if (!_2d(z)) {
+          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');
+        }
+        if (deepEqual(_objectToArray(y), _objectToArray(z))) {
+          throw new TypeError('LinePoint1 should not be same with LinePoint2');
+        }
+        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {
+          const xCoeff = subtractScalar(z.lineTwoPtY, y.lineOnePtY);
+          const yCoeff = subtractScalar(y.lineOnePtX, z.lineTwoPtX);
+          const constant = subtractScalar(multiplyScalar(z.lineTwoPtX, y.lineOnePtY), multiplyScalar(y.lineOnePtX, z.lineTwoPtY));
+          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Array, Array': function (x, y) {
+      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])
+      if (x.length === 2 && y.length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+        }
+        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);
+      } else if (x.length === 3 && y.length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+        }
+        if (!_parametricLine(y)) {
+          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');
+        }
+        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);
+      } else if (x.length === y.length && x.length > 0) {
+        // Point to Point N-dimensions
+        if (!_containsOnlyNumbers(x)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+        if (!_containsOnlyNumbers(y)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+        return _euclideanDistance(x, y);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object': function (x, y) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');
+        }
+        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {
+          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');
+        }
+        if (!_parametricLine(y)) {
+          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');
+        }
+        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {
+          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {
+        // Point to Point 2D
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');
+        }
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {
+        // Point to Point 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');
+        }
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    Array: function (arr) {
+      if (!_pairwise(arr)) {
+        throw new TypeError('Incorrect array format entered for pairwise distance calculation');
+      }
+      return _distancePairwise(arr);
+    }
+  });
+  function _isNumber(a) {
+    // distance supports numbers and bignumbers
+    return typeof a === 'number' || (0, _is.isBigNumber)(a);
+  }
+  function _2d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]);
+  }
+  function _3d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);
+  }
+  function _containsOnlyNumbers(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (!Array.isArray(a)) {
+      a = _objectToArray(a);
+    }
+    return a.every(_isNumber);
+  }
+  function _parametricLine(a) {
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);
+  }
+  function _objectToArray(o) {
+    const keys = Object.keys(o);
+    const a = [];
+    for (let i = 0; i < keys.length; i++) {
+      a.push(o[keys[i]]);
+    }
+    return a;
+  }
+  function _pairwise(a) {
+    // checks for valid arguments passed to _distancePairwise(Array)
+    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {
+      if (a.some(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {
+        return false;
+      }
+    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {
+      if (a.some(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {
+        return false;
+      }
+    } else {
+      return false;
+    }
+    return true;
+  }
+  function _distancePointLine2D(x, y, a, b, c) {
+    const num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));
+    const den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));
+    return divideScalar(num, den);
+  }
+  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {
+    let num = [subtractScalar(multiplyScalar(subtractScalar(y0, y), c), multiplyScalar(subtractScalar(z0, z), b)), subtractScalar(multiplyScalar(subtractScalar(z0, z), a), multiplyScalar(subtractScalar(x0, x), c)), subtractScalar(multiplyScalar(subtractScalar(x0, x), b), multiplyScalar(subtractScalar(y0, y), a))];
+    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));
+    const den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));
+    return divideScalar(num, den);
+  }
+  function _euclideanDistance(x, y) {
+    const vectorSize = x.length;
+    let result = 0;
+    let diff = 0;
+    for (let i = 0; i < vectorSize; i++) {
+      diff = subtractScalar(x[i], y[i]);
+      result = addScalar(multiplyScalar(diff, diff), result);
+    }
+    return sqrt(result);
+  }
+  function _distancePairwise(a) {
+    const result = [];
+    let pointA = [];
+    let pointB = [];
+    for (let i = 0; i < a.length - 1; i++) {
+      for (let j = i + 1; j < a.length; j++) {
+        if (a[0].length === 2) {
+          pointA = [a[i][0], a[i][1]];
+          pointB = [a[j][0], a[j][1]];
+        } else if (a[0].length === 3) {
+          pointA = [a[i][0], a[i][1], a[i][2]];
+          pointB = [a[j][0], a[j][1], a[j][2]];
+        }
+        result.push(_euclideanDistance(pointA, pointB));
+      }
+    }
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/geometry/intersect.js b/node_modules/mathjs/lib/cjs/function/geometry/intersect.js
new file mode 100644
index 0000000..af857e9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/geometry/intersect.js
@@ -0,0 +1,206 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIntersect = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'intersect';
+const dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];
+const createIntersect = exports.createIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    abs,
+    add,
+    addScalar,
+    matrix,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    subtract,
+    smaller,
+    equalScalar,
+    flatten,
+    isZero,
+    isNumeric
+  } = _ref;
+  /**
+   * Calculates the point of intersection of two lines in two or three dimensions
+   * and of a line and a plane in three dimensions. The inputs are in the form of
+   * arrays or 1 dimensional matrices. The line intersection functions return null
+   * if the lines do not meet.
+   *
+   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
+   *
+   * Syntax:
+   *
+   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
+   *    math.intersect(endPoint1, endPoint2, planeCoefficients)
+   *
+   * Examples:
+   *
+   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]
+   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]
+   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]
+   *
+   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line
+   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line
+   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line
+   *                              OR Co-efficients of the plane's equation
+   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line
+   *                              OR undefined if the calculation is for line and plane
+   * @return {Array}              Returns the point of intersection of lines/lines-planes
+   */
+  return typed('intersect', {
+    'Array, Array, Array': _AAA,
+    'Array, Array, Array, Array': _AAAA,
+    'Matrix, Matrix, Matrix': function (x, y, plane) {
+      const arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf());
+      return arr === null ? null : matrix(arr);
+    },
+    'Matrix, Matrix, Matrix, Matrix': function (w, x, y, z) {
+      // TODO: output matrix type should match input matrix type
+      const arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf());
+      return arr === null ? null : matrix(arr);
+    }
+  });
+  function _AAA(x, y, plane) {
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    plane = _coerceArr(plane);
+    if (!_3d(x)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+    }
+    if (!_3d(y)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+    }
+    if (!_4d(plane)) {
+      throw new TypeError('Array with 4 numbers expected as third argument');
+    }
+    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);
+  }
+  function _AAAA(w, x, y, z) {
+    w = _coerceArr(w);
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    z = _coerceArr(z);
+    if (w.length === 2) {
+      if (!_2d(w)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+      }
+      if (!_2d(x)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+      }
+      if (!_2d(y)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+      }
+      if (!_2d(z)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');
+      }
+      return _intersect2d(w, x, y, z);
+    } else if (w.length === 3) {
+      if (!_3d(w)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+      }
+      if (!_3d(x)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+      }
+      if (!_3d(y)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');
+      }
+      if (!_3d(z)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');
+      }
+      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);
+    } else {
+      throw new TypeError('Arrays with two or thee dimensional points expected');
+    }
+  }
+
+  /** Coerce row and column 2-dim arrays to 1-dim array */
+  function _coerceArr(arr) {
+    // row matrix
+    if (arr.length === 1) return arr[0];
+
+    // column matrix
+    if (arr.length > 1 && Array.isArray(arr[0])) {
+      if (arr.every(el => Array.isArray(el) && el.length === 1)) return flatten(arr);
+    }
+    return arr;
+  }
+  function _2d(x) {
+    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1]);
+  }
+  function _3d(x) {
+    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]);
+  }
+  function _4d(x) {
+    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3]);
+  }
+  function _intersect2d(p1a, p1b, p2a, p2b) {
+    const o1 = p1a;
+    const o2 = p2a;
+    const d1 = subtract(o1, p1b);
+    const d2 = subtract(o2, p2b);
+    const det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));
+    if (isZero(det)) return null;
+    if (smaller(abs(det), config.relTol)) {
+      return null;
+    }
+    const d20o11 = multiplyScalar(d2[0], o1[1]);
+    const d21o10 = multiplyScalar(d2[1], o1[0]);
+    const d20o21 = multiplyScalar(d2[0], o2[1]);
+    const d21o20 = multiplyScalar(d2[1], o2[0]);
+    const t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);
+    return add(multiply(d1, t), o1);
+  }
+  function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {
+    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)
+    const add1 = multiplyScalar(subtract(a, b), subtract(c, d));
+    const add2 = multiplyScalar(subtract(e, f), subtract(g, h));
+    const add3 = multiplyScalar(subtract(i, j), subtract(k, l));
+    return addScalar(addScalar(add1, add2), add3);
+  }
+  function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {
+    const d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);
+    const d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);
+    const d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);
+    const d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);
+    const d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);
+    const numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343));
+    const denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321));
+    if (isZero(denominator)) return null;
+    const ta = divideScalar(numerator, denominator);
+    const tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);
+    const pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));
+    const pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));
+    const paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));
+    const pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));
+    const pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));
+    const pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));
+    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {
+      return [pax, pay, paz];
+    } else {
+      return null;
+    }
+  }
+  function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {
+    const x1x = multiplyScalar(x1, x);
+    const x2x = multiplyScalar(x2, x);
+    const y1y = multiplyScalar(y1, y);
+    const y2y = multiplyScalar(y2, y);
+    const z1z = multiplyScalar(z1, z);
+    const z2z = multiplyScalar(z2, z);
+    const numerator = subtract(subtract(subtract(c, x1x), y1y), z1z);
+    const denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z);
+    const t = divideScalar(numerator, denominator);
+    const px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));
+    const py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));
+    const pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));
+    return [px, py, pz];
+    // TODO: Add cases when line is parallel to the plane:
+    //       (a) no intersection,
+    //       (b) line contained in plane
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/and.js b/node_modules/mathjs/lib/cjs/function/logical/and.js
new file mode 100644
index 0000000..cb92ff1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/and.js
@@ -0,0 +1,128 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAnd = void 0;
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo06xS0S = require("../../type/matrix/utils/matAlgo06xS0S0.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'and';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not', 'concat'];
+const createAnd = exports.createAnd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo06xS0S0 = (0, _matAlgo06xS0S.createMatAlgo06xS0S0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.and(x, y)
+   *
+   * Examples:
+   *
+   *    math.and(2, 4)   // returns true
+   *
+   *    a = [2, 0, 0]
+   *    b = [3, 7, 0]
+   *    c = 0
+   *
+   *    math.and(a, b)   // returns [true, false, false]
+   *    math.and(a, c)   // returns [false, false, false]
+   *
+   * See also:
+   *
+   *    not, or, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when both inputs are defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': _index.andNumber,
+    'Complex, Complex': function (x, y) {
+      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();
+    },
+    'bigint, bigint': _index.andNumber,
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0)),
+    'SparseMatrix, any': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, any': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'any, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo11xS0s(y, x, self, true);
+    }),
+    'any, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    }),
+    'Array, any': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return self(matrix(x), y).valueOf();
+    }),
+    'any, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return self(x, matrix(y)).valueOf();
+    })
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/not.js b/node_modules/mathjs/lib/cjs/function/logical/not.js
new file mode 100644
index 0000000..bc38d42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/not.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNot = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'not';
+const dependencies = ['typed'];
+const createNot = exports.createNot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Logical `not`. Flips boolean value of a given parameter.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.not(x)
+   *
+   * Examples:
+   *
+   *    math.not(2)      // returns false
+   *    math.not(0)      // returns true
+   *    math.not(true)   // returns false
+   *
+   *    a = [2, -7, 0]
+   *    math.not(a)      // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    and, or, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when input is a zero or empty value.
+   */
+  return typed(name, {
+    'null | undefined': () => true,
+    number: _index.notNumber,
+    Complex: function (x) {
+      return x.re === 0 && x.im === 0;
+    },
+    BigNumber: function (x) {
+      return x.isZero() || x.isNaN();
+    },
+    bigint: x => !x,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/nullish.js b/node_modules/mathjs/lib/cjs/function/logical/nullish.js
new file mode 100644
index 0000000..e6de8bb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/nullish.js
@@ -0,0 +1,87 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNullish = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
+var _matAlgo13xDD = require("../../type/matrix/utils/matAlgo13xDD.js");
+var _DimensionError = require("../../error/DimensionError.js");
+const name = 'nullish';
+const dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];
+const createNullish = exports.createNullish = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+  const matAlgo13xDD = (0, _matAlgo13xDD.createMatAlgo13xDD)({
+    typed
+  });
+
+  /**
+   * Nullish coalescing operator (??). Returns the right-hand side operand
+   * when the left-hand side operand is null or undefined, and otherwise
+   * returns the left-hand side operand.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.nullish(x, y)
+   *
+   * Examples:
+   *
+   *    math.nullish(null, 42)        // returns 42
+   *    math.nullish(undefined, 42)   // returns 42
+   *    math.nullish(0, 42)           // returns 0
+   *    math.nullish(false, 42)       // returns false
+   *    math.nullish('', 42)          // returns ''
+   *
+   *    // Object property access with fallback
+   *    const obj = {foo: 7, bar: 3}
+   *    math.nullish(obj.baz, 0)      // returns 0
+   *
+   * See also:
+   *
+   *    and, or, not
+   *
+   * @param  {*} x First value to check
+   * @param  {*} y Fallback value
+   * @return {*} Returns y when x is null or undefined, otherwise returns x
+   */
+
+  return typed(name, {
+    // Scalar and SparseMatrix-first short-circuit handlers
+    'number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any': (x, _y) => x,
+    'null, any': (_x, y) => y,
+    'undefined, any': (_x, y) => y,
+    // SparseMatrix-first with collection RHS: enforce exact shape match
+    'SparseMatrix, Array | Matrix': (x, y) => {
+      const sx = flatten(size(x).valueOf()); // work around #3529/#3530
+      const sy = flatten(size(y).valueOf());
+      if (deepEqual(sx, sy)) return x;
+      throw new _DimensionError.DimensionError(sx, sy);
+    },
+    // DenseMatrix-first handlers (no broadcasting between collections)
+    'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, y, self)),
+    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(x, y, self, false)),
+    'DenseMatrix, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, matrix(y), self)),
+    'DenseMatrix, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(x, y, self, false)),
+    // Array-first handlers (bridge via matrix() where needed)
+    'Array, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), matrix(y), self).valueOf()),
+    'Array, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), y, self)),
+    'Array, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(matrix(x), y, self, false)),
+    'Array, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(matrix(x), y, self, false).valueOf())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/or.js b/node_modules/mathjs/lib/cjs/function/logical/or.js
new file mode 100644
index 0000000..8680743
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/or.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOr = void 0;
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo05xSfSf = require("../../type/matrix/utils/matAlgo05xSfSf.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'or';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+const createOr = exports.createOr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.or(x, y)
+   *
+   * Examples:
+   *
+   *    math.or(2, 4)   // returns true
+   *
+   *    a = [2, 5, 0]
+   *    b = [0, 22, 0]
+   *    c = 0
+   *
+   *    math.or(a, b)   // returns [true, true, false]
+   *    math.or(b, c)   // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    and, not, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': _index.orNumber,
+    'Complex, Complex': function (x, y) {
+      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();
+    },
+    'bigint, bigint': _index.orNumber,
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))
+  }, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/logical/xor.js b/node_modules/mathjs/lib/cjs/function/logical/xor.js
new file mode 100644
index 0000000..681b39e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/logical/xor.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createXor = void 0;
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _index = require("../../plain/number/index.js");
+const name = 'xor';
+const dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createXor = exports.createXor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.xor(x, y)
+   *
+   * Examples:
+   *
+   *    math.xor(2, 4)   // returns false
+   *
+   *    a = [2, 0, 0]
+   *    b = [2, 7, 0]
+   *    c = 0
+   *
+   *    math.xor(a, b)   // returns [false, true, false]
+   *    math.xor(a, c)   // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    and, not, or
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one and only one input is defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': _index.xorNumber,
+    'Complex, Complex': function (x, y) {
+      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);
+    },
+    'bigint, bigint': _index.xorNumber,
+    'BigNumber, BigNumber': function (x, y) {
+      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))
+  }, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/column.js b/node_modules/mathjs/lib/cjs/function/matrix/column.js
new file mode 100644
index 0000000..9646021
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/column.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createColumn = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+const name = 'column';
+const dependencies = ['typed', 'Index', 'matrix', 'range'];
+const createColumn = exports.createColumn = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  /**
+   * Return a column from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.column(value, index)
+   *
+   * Example:
+   *
+   *     // get a column
+   *     const d = [[1, 2], [3, 4]]
+   *     math.column(d, 1) // returns [[2], [4]]
+   *
+   * See also:
+   *
+   *     row
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} column           The index of the column
+   * @return {Array | Matrix}         The retrieved column
+   */
+  return typed(name, {
+    'Matrix, number': _column,
+    'Array, number': function (value, column) {
+      return _column(matrix((0, _object.clone)(value)), column).valueOf();
+    }
+  });
+
+  /**
+   * Retrieve a column of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} column  The index of the column
+   * @return {Matrix}        The retrieved column
+   */
+  function _column(value, column) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    (0, _array.validateIndex)(column, value.size()[1]);
+    const rowRange = range(0, value.size()[0]);
+    const index = new Index(rowRange, column);
+    const result = value.subset(index);
+    return (0, _is.isMatrix)(result) ? result : matrix([[result]]);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/concat.js b/node_modules/mathjs/lib/cjs/function/matrix/concat.js
new file mode 100644
index 0000000..785e0e4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/concat.js
@@ -0,0 +1,110 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createConcat = void 0;
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+var _IndexError = require("../../error/IndexError.js");
+var _DimensionError = require("../../error/DimensionError.js");
+var _factory = require("../../utils/factory.js");
+const name = 'concat';
+const dependencies = ['typed', 'matrix', 'isInteger'];
+const createConcat = exports.createConcat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+  /**
+   * Concatenate two or more matrices.
+   *
+   * Syntax:
+   *
+   *     math.concat(A, B, C, ...)
+   *     math.concat(A, B, C, ..., dim)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *   By default the last dimension of the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [5, 6]]
+   *    const B = [[3, 4], [7, 8]]
+   *
+   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
+   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
+   *    math.concat('hello', ' ', 'world') // returns 'hello world'
+   *
+   * See also:
+   *
+   *    size, squeeze, subset, transpose
+   *
+   * @param {... Array | Matrix} args     Two or more matrices
+   * @return {Array | Matrix} Concatenated matrix
+   */
+  return typed(name, {
+    // TODO: change signature to '...Array | Matrix, dim?' when supported
+    '...Array | Matrix | number | BigNumber': function (args) {
+      let i;
+      const len = args.length;
+      let dim = -1; // zero-based dimension
+      let prevDim;
+      let asMatrix = false;
+      const matrices = []; // contains multi dimensional arrays
+
+      for (i = 0; i < len; i++) {
+        const arg = args[i];
+
+        // test whether we need to return a Matrix (if not we return an Array)
+        if ((0, _is.isMatrix)(arg)) {
+          asMatrix = true;
+        }
+        if ((0, _is.isNumber)(arg) || (0, _is.isBigNumber)(arg)) {
+          if (i !== len - 1) {
+            throw new Error('Dimension must be specified as last argument');
+          }
+
+          // last argument contains the dimension on which to concatenate
+          prevDim = dim;
+          dim = arg.valueOf(); // change BigNumber to number
+
+          if (!isInteger(dim)) {
+            throw new TypeError('Integer number expected for dimension');
+          }
+          if (dim < 0 || i > 0 && dim > prevDim) {
+            // TODO: would be more clear when throwing a DimensionError here
+            throw new _IndexError.IndexError(dim, prevDim + 1);
+          }
+        } else {
+          // this is a matrix or array
+          const m = (0, _object.clone)(arg).valueOf();
+          const size = (0, _array.arraySize)(m);
+          matrices[i] = m;
+          prevDim = dim;
+          dim = size.length - 1;
+
+          // verify whether each of the matrices has the same number of dimensions
+          if (i > 0 && dim !== prevDim) {
+            throw new _DimensionError.DimensionError(prevDim + 1, dim + 1);
+          }
+        }
+      }
+      if (matrices.length === 0) {
+        throw new SyntaxError('At least one matrix expected');
+      }
+      let res = matrices.shift();
+      while (matrices.length) {
+        res = (0, _array.concat)(res, matrices.shift(), dim);
+      }
+      return asMatrix ? matrix(res) : res;
+    },
+    '...string': function (args) {
+      return args.join('');
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/count.js b/node_modules/mathjs/lib/cjs/function/matrix/count.js
new file mode 100644
index 0000000..508d2cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/count.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCount = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'count';
+const dependencies = ['typed', 'size', 'prod'];
+const createCount = exports.createCount = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    prod
+  } = _ref;
+  /**
+   * Count the number of elements of a matrix, array or string.
+   *
+   * Syntax:
+   *
+   *     math.count(x)
+   *
+   * Examples:
+   *
+   *     math.count('hello world')        // returns 11
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.count(A)                    // returns 6
+   *     math.count(math.range(1,6))      // returns 5
+   *
+   * See also:
+   *
+   *     size
+   *
+   * @param {string | Array | Matrix} x  A matrix or string
+   * @return {number} An integer with the elements in `x`.
+   */
+  return typed(name, {
+    string: function (x) {
+      return x.length;
+    },
+    'Matrix | Array': function (x) {
+      return prod(size(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/cross.js b/node_modules/mathjs/lib/cjs/function/matrix/cross.js
new file mode 100644
index 0000000..9394464
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/cross.js
@@ -0,0 +1,87 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCross = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'cross';
+const dependencies = ['typed', 'matrix', 'subtract', 'multiply'];
+const createCross = exports.createCross = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    subtract,
+    multiply
+  } = _ref;
+  /**
+   * Calculate the cross product for two vectors in three dimensional space.
+   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
+   * as:
+   *
+   *    cross(A, B) = [
+   *      a2 * b3 - a3 * b2,
+   *      a3 * b1 - a1 * b3,
+   *      a1 * b2 - a2 * b1
+   *    ]
+   *
+   * If one of the input vectors has a dimension greater than 1, the output
+   * vector will be a 1x3 (2-dimensional) matrix.
+   *
+   * Syntax:
+   *
+   *    math.cross(x, y)
+   *
+   * Examples:
+   *
+   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]
+   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]
+   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]
+   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
+   *
+   * See also:
+   *
+   *    dot, multiply
+   *
+   * @param  {Array | Matrix} x   First vector
+   * @param  {Array | Matrix} y   Second vector
+   * @return {Array | Matrix}     Returns the cross product of `x` and `y`
+   */
+  return typed(name, {
+    'Matrix, Matrix': function (x, y) {
+      return matrix(_cross(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function (x, y) {
+      return matrix(_cross(x.toArray(), y));
+    },
+    'Array, Matrix': function (x, y) {
+      return matrix(_cross(x, y.toArray()));
+    },
+    'Array, Array': _cross
+  });
+
+  /**
+   * Calculate the cross product for two arrays
+   * @param {Array} x  First vector
+   * @param {Array} y  Second vector
+   * @returns {Array} Returns the cross product of x and y
+   * @private
+   */
+  function _cross(x, y) {
+    const highestDimension = Math.max((0, _array.arraySize)(x).length, (0, _array.arraySize)(y).length);
+    x = (0, _array.squeeze)(x);
+    y = (0, _array.squeeze)(y);
+    const xSize = (0, _array.arraySize)(x);
+    const ySize = (0, _array.arraySize)(y);
+    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {
+      throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');
+    }
+    const product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];
+    if (highestDimension > 1) {
+      return [product];
+    } else {
+      return product;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..b1e7625
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/ctranspose.js
@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCtranspose = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'ctranspose';
+const dependencies = ['typed', 'transpose', 'conj'];
+const createCtranspose = exports.createCtranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    transpose,
+    conj
+  } = _ref;
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is
+   * taken. This is equivalent to complex conjugation for scalars and
+   * vectors.
+   *
+   * Syntax:
+   *
+   *     math.ctranspose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
+   *     math.ctranspose(A)      // returns [[1, 4], [2, 5], [3, {re:6,im:-7}]]
+   *
+   * See also:
+   *
+   *     transpose, diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be ctransposed
+   * @return {Array | Matrix}   The ctransposed matrix
+   */
+  return typed(name, {
+    any: function (x) {
+      return conj(transpose(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/det.js b/node_modules/mathjs/lib/cjs/function/matrix/det.js
new file mode 100644
index 0000000..81e9eb9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/det.js
@@ -0,0 +1,148 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDet = void 0;
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+const name = 'det';
+const dependencies = ['typed', 'matrix', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];
+const createDet = exports.createDet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    subtractScalar,
+    multiply,
+    divideScalar,
+    isZero,
+    unaryMinus
+  } = _ref;
+  /**
+   * Calculate the determinant of a matrix.
+   *
+   * Syntax:
+   *
+   *    math.det(x)
+   *
+   * Examples:
+   *
+   *    math.det([[1, 2], [3, 4]]) // returns -2
+   *
+   *    const A = [
+   *      [-2, 2, 3],
+   *      [-1, 1, 3],
+   *      [2, 0, -1]
+   *    ]
+   *    math.det(A) // returns 6
+   *
+   * See also:
+   *
+   *    inv
+   *
+   * @param {Array | Matrix} x  A matrix
+   * @return {number} The determinant of `x`
+   */
+  return typed(name, {
+    any: function (x) {
+      return (0, _object.clone)(x);
+    },
+    'Array | Matrix': function det(x) {
+      let size;
+      if ((0, _is.isMatrix)(x)) {
+        size = x.size();
+      } else if (Array.isArray(x)) {
+        x = matrix(x);
+        size = x.size();
+      } else {
+        // a scalar
+        size = [];
+      }
+      switch (size.length) {
+        case 0:
+          // scalar
+          return (0, _object.clone)(x);
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            return (0, _object.clone)(x.valueOf()[0]);
+          }
+          if (size[0] === 0) {
+            return 1; // det of an empty matrix is per definition 1
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+        case 2:
+          {
+            // two-dimensional array
+            const rows = size[0];
+            const cols = size[1];
+            if (rows === cols) {
+              return _det(x.clone().valueOf(), rows, cols);
+            }
+            if (cols === 0) {
+              return 1; // det of an empty matrix is per definition 1
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    }
+  });
+
+  /**
+   * Calculate the determinant of a matrix
+   * @param {Array[]} matrix  A square, two dimensional matrix
+   * @param {number} rows     Number of rows of the matrix (zero-based)
+   * @param {number} cols     Number of columns of the matrix (zero-based)
+   * @returns {number} det
+   * @private
+   */
+  function _det(matrix, rows, cols) {
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      return (0, _object.clone)(matrix[0][0]);
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
+      return subtractScalar(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
+    } else {
+      // Bareiss algorithm
+      // this algorithm have same complexity as LUP decomposition (O(n^3))
+      // but it preserve precision of floating point more relative to the LUP decomposition
+      let negated = false;
+      const rowIndices = new Array(rows).fill(0).map((_, i) => i); // matrix index of row i
+      for (let k = 0; k < rows; k++) {
+        let k_ = rowIndices[k];
+        if (isZero(matrix[k_][k])) {
+          let _k;
+          for (_k = k + 1; _k < rows; _k++) {
+            if (!isZero(matrix[rowIndices[_k]][k])) {
+              k_ = rowIndices[_k];
+              rowIndices[_k] = rowIndices[k];
+              rowIndices[k] = k_;
+              negated = !negated;
+              break;
+            }
+          }
+          if (_k === rows) return matrix[k_][k]; // some zero of the type
+        }
+        const piv = matrix[k_][k];
+        const piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];
+        for (let i = k + 1; i < rows; i++) {
+          const i_ = rowIndices[i];
+          for (let j = k + 1; j < rows; j++) {
+            matrix[i_][j] = divideScalar(subtractScalar(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);
+          }
+        }
+      }
+      const det = matrix[rowIndices[rows - 1]][rows - 1];
+      return negated ? unaryMinus(det) : det;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/diag.js b/node_modules/mathjs/lib/cjs/function/matrix/diag.js
new file mode 100644
index 0000000..c87efdd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/diag.js
@@ -0,0 +1,161 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiag = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'diag';
+const dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];
+const createDiag = exports.createDiag = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix
+   *
+   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
+   * When k is positive, the values are placed on the super diagonal.
+   * When k is negative, the values are placed on the sub diagonal.
+   *
+   * Syntax:
+   *
+   *     math.diag(X)
+   *     math.diag(X, format)
+   *     math.diag(X, k)
+   *     math.diag(X, k, format)
+   *
+   * Examples:
+   *
+   *     // create a diagonal matrix
+   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
+   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *
+   *    // retrieve the diagonal from a matrix
+   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
+   *    math.diag(a)   // returns [1, 5, 9]
+   *
+   * See also:
+   *
+   *     ones, zeros, identity
+   *
+   * @param {Matrix | Array} x          A two dimensional matrix or a vector
+   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled
+   *                                    in or retrieved.
+   * @param {string} [format='dense']   The matrix storage format.
+   *
+   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.
+   */
+  return typed(name, {
+    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments
+
+    Array: function (x) {
+      return _diag(x, 0, (0, _array.arraySize)(x), null);
+    },
+    'Array, number': function (x, k) {
+      return _diag(x, k, (0, _array.arraySize)(x), null);
+    },
+    'Array, BigNumber': function (x, k) {
+      return _diag(x, k.toNumber(), (0, _array.arraySize)(x), null);
+    },
+    'Array, string': function (x, format) {
+      return _diag(x, 0, (0, _array.arraySize)(x), format);
+    },
+    'Array, number, string': function (x, k, format) {
+      return _diag(x, k, (0, _array.arraySize)(x), format);
+    },
+    'Array, BigNumber, string': function (x, k, format) {
+      return _diag(x, k.toNumber(), (0, _array.arraySize)(x), format);
+    },
+    Matrix: function (x) {
+      return _diag(x, 0, x.size(), x.storage());
+    },
+    'Matrix, number': function (x, k) {
+      return _diag(x, k, x.size(), x.storage());
+    },
+    'Matrix, BigNumber': function (x, k) {
+      return _diag(x, k.toNumber(), x.size(), x.storage());
+    },
+    'Matrix, string': function (x, format) {
+      return _diag(x, 0, x.size(), format);
+    },
+    'Matrix, number, string': function (x, k, format) {
+      return _diag(x, k, x.size(), format);
+    },
+    'Matrix, BigNumber, string': function (x, k, format) {
+      return _diag(x, k.toNumber(), x.size(), format);
+    }
+  });
+
+  /**
+   * Creeate diagonal matrix from a vector or vice versa
+   * @param {Array | Matrix} x
+   * @param {number} k
+   * @param {string} format Storage format for matrix. If null,
+   *                          an Array is returned
+   * @returns {Array | Matrix}
+   * @private
+   */
+  function _diag(x, k, size, format) {
+    if (!(0, _number.isInteger)(k)) {
+      throw new TypeError('Second parameter in function diag must be an integer');
+    }
+    const kSuper = k > 0 ? k : 0;
+    const kSub = k < 0 ? -k : 0;
+
+    // check dimensions
+    switch (size.length) {
+      case 1:
+        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);
+      case 2:
+        return _getDiagonal(x, k, format, size, kSub, kSuper);
+    }
+    throw new RangeError('Matrix for function diag must be 2 dimensional');
+  }
+  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {
+    // matrix size
+    const ms = [l + kSub, l + kSuper];
+    if (format && format !== 'sparse' && format !== 'dense') {
+      throw new TypeError(`Unknown matrix type ${format}"`);
+    }
+
+    // create diagonal matrix
+    const m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k);
+    // check we need to return a matrix
+    return format !== null ? m : m.valueOf();
+  }
+  function _getDiagonal(x, k, format, s, kSub, kSuper) {
+    // check x is a Matrix
+    if ((0, _is.isMatrix)(x)) {
+      // get diagonal matrix
+      const dm = x.diagonal(k);
+      // check we need to return a matrix
+      if (format !== null) {
+        // check we need to change matrix format
+        if (format !== dm.storage()) {
+          return matrix(dm, format);
+        }
+        return dm;
+      }
+      return dm.valueOf();
+    }
+    // vector size
+    const n = Math.min(s[0] - kSub, s[1] - kSuper);
+    // diagonal values
+    const vector = [];
+    // loop diagonal
+    for (let i = 0; i < n; i++) {
+      vector[i] = x[i + kSub][i + kSuper];
+    }
+    // check we need to return a matrix
+    return format !== null ? matrix(vector) : vector;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/diff.js b/node_modules/mathjs/lib/cjs/function/matrix/diff.js
new file mode 100644
index 0000000..a41ffe8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/diff.js
@@ -0,0 +1,169 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDiff = void 0;
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _is = require("../../utils/is.js");
+const name = 'diff';
+const dependencies = ['typed', 'matrix', 'subtract', 'number'];
+const createDiff = exports.createDiff = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    subtract,
+    number
+  } = _ref;
+  /**
+   * Create a new matrix or array of the difference between elements of the given array
+   * The optional dim parameter lets you specify the dimension to evaluate the difference of
+   * If no dimension parameter is passed it is assumed as dimension 0
+   *
+   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber
+   * Arrays must be 'rectangular' meaning arrays like [1, 2]
+   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays
+   *
+   * Syntax:
+   *
+   *     math.diff(arr)
+   *     math.diff(arr, dim)
+   *
+   * Examples:
+   *
+   *     const arr = [1, 2, 4, 7, 0]
+   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)
+   *     math.diff(math.matrix(arr)) // returns Matrix [1, 2, 3, -7]
+   *
+   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]
+   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *
+   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3
+   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed
+   *
+   *     // These will all produce the same result
+   *     math.diff([[1, 2], [3, 4]])
+   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])
+   *     math.diff([[1, 2], math.matrix([3, 4])])
+   *     math.diff([math.matrix([1, 2]), [3, 4]])
+   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix
+   *
+   * See Also:
+   *
+   *      sum
+   *      subtract
+   *      partitionSelect
+   *
+   * @param {Array | Matrix} arr      An array or matrix
+   * @param {number | BigNumber} dim  Dimension
+   * @return {Array | Matrix}         Difference between array elements in given dimension
+   */
+  return typed(name, {
+    'Array | Matrix': function (arr) {
+      // No dimension specified => assume dimension 0
+      if ((0, _is.isMatrix)(arr)) {
+        return matrix(_diff(arr.toArray()));
+      } else {
+        return _diff(arr);
+      }
+    },
+    'Array | Matrix, number': function (arr, dim) {
+      if (!(0, _number.isInteger)(dim)) throw new RangeError('Dimension must be a whole number');
+      if ((0, _is.isMatrix)(arr)) {
+        return matrix(_recursive(arr.toArray(), dim));
+      } else {
+        return _recursive(arr, dim);
+      }
+    },
+    'Array, BigNumber': typed.referTo('Array,number', selfAn => (arr, dim) => selfAn(arr, number(dim))),
+    'Matrix, BigNumber': typed.referTo('Matrix,number', selfMn => (arr, dim) => selfMn(arr, number(dim)))
+  });
+
+  /**
+   * Recursively find the correct dimension in the array/matrix
+   * Then Apply _diff to that dimension
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     Dimension
+   * @return {Array}         resulting array
+   */
+  function _recursive(arr, dim) {
+    if ((0, _is.isMatrix)(arr)) {
+      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly
+    }
+    if (!Array.isArray(arr)) {
+      throw RangeError('Array/Matrix does not have that many dimensions');
+    }
+    if (dim > 0) {
+      const result = [];
+      arr.forEach(element => {
+        result.push(_recursive(element, dim - 1));
+      });
+      return result;
+    } else if (dim === 0) {
+      return _diff(arr);
+    } else {
+      throw RangeError('Cannot have negative dimension');
+    }
+  }
+
+  /**
+   * Difference between elements in the array
+   *
+   * @param {Array} arr      An array
+   * @return {Array}         resulting array
+   */
+  function _diff(arr) {
+    const result = [];
+    const size = arr.length;
+    for (let i = 1; i < size; i++) {
+      result.push(_ElementDiff(arr[i - 1], arr[i]));
+    }
+    return result;
+  }
+
+  /**
+   * Difference between 2 objects
+   *
+   * @param {Object} obj1    First object
+   * @param {Object} obj2    Second object
+   * @return {Array}         resulting array
+   */
+  function _ElementDiff(obj1, obj2) {
+    // Convert matrices to arrays
+    if ((0, _is.isMatrix)(obj1)) obj1 = obj1.toArray();
+    if ((0, _is.isMatrix)(obj2)) obj2 = obj2.toArray();
+    const obj1IsArray = Array.isArray(obj1);
+    const obj2IsArray = Array.isArray(obj2);
+    if (obj1IsArray && obj2IsArray) {
+      return _ArrayDiff(obj1, obj2);
+    }
+    if (!obj1IsArray && !obj2IsArray) {
+      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)
+    }
+    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');
+  }
+
+  /**
+   * Difference of elements in 2 arrays
+   *
+   * @param {Array} arr1     Array 1
+   * @param {Array} arr2     Array 2
+   * @return {Array}         resulting array
+   */
+  function _ArrayDiff(arr1, arr2) {
+    if (arr1.length !== arr2.length) {
+      throw RangeError('Not all sub-arrays have the same length');
+    }
+    const result = [];
+    const size = arr1.length;
+    for (let i = 0; i < size; i++) {
+      result.push(_ElementDiff(arr1[i], arr2[i]));
+    }
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/dot.js b/node_modules/mathjs/lib/cjs/function/matrix/dot.js
new file mode 100644
index 0000000..c04627c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/dot.js
@@ -0,0 +1,162 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDot = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'dot';
+const dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];
+const createDot = exports.createDot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    addScalar,
+    multiplyScalar,
+    conj,
+    size
+  } = _ref;
+  /**
+   * Calculate the dot product of two vectors. The dot product of
+   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
+   *
+   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
+   *
+   * Syntax:
+   *
+   *    math.dot(x, y)
+   *
+   * Examples:
+   *
+   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15
+   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15
+   *
+   * See also:
+   *
+   *    multiply, cross
+   *
+   * @param  {Array | Matrix} x     First vector
+   * @param  {Array | Matrix} y     Second vector
+   * @return {number}               Returns the dot product of `x` and `y`
+   */
+  return typed(name, {
+    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,
+    'SparseMatrix, SparseMatrix': _sparseDot
+  });
+  function _validateDim(x, y) {
+    const xSize = _size(x);
+    const ySize = _size(y);
+    let xLen, yLen;
+    if (xSize.length === 1) {
+      xLen = xSize[0];
+    } else if (xSize.length === 2 && xSize[1] === 1) {
+      xLen = xSize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');
+    }
+    if (ySize.length === 1) {
+      yLen = ySize[0];
+    } else if (ySize.length === 2 && ySize[1] === 1) {
+      yLen = ySize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');
+    }
+    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');
+    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');
+    return xLen;
+  }
+  function _denseDot(a, b) {
+    const N = _validateDim(a, b);
+    const adata = (0, _is.isMatrix)(a) ? a._data : a;
+    const adt = (0, _is.isMatrix)(a) ? a._datatype || a.getDataType() : undefined;
+    const bdata = (0, _is.isMatrix)(b) ? b._data : b;
+    const bdt = (0, _is.isMatrix)(b) ? b._datatype || b.getDataType() : undefined;
+
+    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)
+    const aIsColumn = _size(a).length === 2;
+    const bIsColumn = _size(b).length === 2;
+    let add = addScalar;
+    let mul = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      const dt = adt;
+      // find signatures that matches (dt, dt)
+      add = typed.find(addScalar, [dt, dt]);
+      mul = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // both vectors 1-dimensional
+    if (!aIsColumn && !bIsColumn) {
+      let c = mul(conj(adata[0]), bdata[0]);
+      for (let i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i]), bdata[i]));
+      }
+      return c;
+    }
+
+    // a is 1-dim, b is column
+    if (!aIsColumn && bIsColumn) {
+      let c = mul(conj(adata[0]), bdata[0][0]);
+      for (let i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i]), bdata[i][0]));
+      }
+      return c;
+    }
+
+    // a is column, b is 1-dim
+    if (aIsColumn && !bIsColumn) {
+      let c = mul(conj(adata[0][0]), bdata[0]);
+      for (let i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i][0]), bdata[i]));
+      }
+      return c;
+    }
+
+    // both vectors are column
+    if (aIsColumn && bIsColumn) {
+      let c = mul(conj(adata[0][0]), bdata[0][0]);
+      for (let i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i][0]), bdata[i][0]));
+      }
+      return c;
+    }
+  }
+  function _sparseDot(x, y) {
+    _validateDim(x, y);
+    const xindex = x._index;
+    const xvalues = x._values;
+    const yindex = y._index;
+    const yvalues = y._values;
+
+    // TODO optimize add & mul using datatype
+    let c = 0;
+    const add = addScalar;
+    const mul = multiplyScalar;
+    let i = 0;
+    let j = 0;
+    while (i < xindex.length && j < yindex.length) {
+      const I = xindex[i];
+      const J = yindex[j];
+      if (I < J) {
+        i++;
+        continue;
+      }
+      if (I > J) {
+        j++;
+        continue;
+      }
+      if (I === J) {
+        c = add(c, mul(xvalues[i], yvalues[j]));
+        i++;
+        j++;
+      }
+    }
+    return c;
+  }
+
+  // TODO remove this once #1771 is fixed
+  function _size(x) {
+    return (0, _is.isMatrix)(x) ? x.size() : size(x);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs.js
new file mode 100644
index 0000000..808caf2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs.js
@@ -0,0 +1,335 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEigs = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _factory = require("../../utils/factory.js");
+var _string = require("../../utils/string.js");
+var _complexEigs = require("./eigs/complexEigs.js");
+var _realSymmetric = require("./eigs/realSymmetric.js");
+var _is = require("../../utils/is.js");
+const name = 'eigs';
+
+// The absolute state of math.js's dependency system:
+const dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];
+const createEigs = exports.createEigs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    config,
+    typed,
+    matrix,
+    addScalar,
+    subtract,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    divideScalar,
+    inv,
+    bignumber,
+    multiply,
+    add,
+    larger,
+    column,
+    flatten,
+    number,
+    complex,
+    sqrt,
+    diag,
+    size,
+    reshape,
+    qr,
+    usolve,
+    usolveAll,
+    im,
+    re,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+  const doRealSymmetric = (0, _realSymmetric.createRealSymmetric)({
+    config,
+    addScalar,
+    subtract,
+    column,
+    flatten,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    complex,
+    multiply,
+    add
+  });
+  const doComplexEigs = (0, _complexEigs.createComplexEigs)({
+    config,
+    addScalar,
+    subtract,
+    multiply,
+    multiplyScalar,
+    flatten,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    size,
+    reshape,
+    qr,
+    inv,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  });
+
+  /**
+   * Compute eigenvalues and optionally eigenvectors of a square matrix.
+   * The eigenvalues are sorted by their absolute value, ascending, and
+   * returned as a vector in the `values` property of the returned project.
+   * An eigenvalue with algebraic multiplicity k will be listed k times, so
+   * that the returned `values` vector always has length equal to the size
+   * of the input matrix.
+   *
+   * The `eigenvectors` property of the return value provides the eigenvectors.
+   * It is an array of plain objects: the `value` property of each gives the
+   * associated eigenvalue, and the `vector` property gives the eigenvector
+   * itself. Note that the same `value` property will occur as many times in
+   * the list provided by `eigenvectors` as the geometric multiplicity of
+   * that value.
+   *
+   * If the algorithm fails to converge, it will throw an error –
+   * in that case, however, you may still find useful information
+   * in `err.values` and `err.vectors`.
+   *
+   * Note that the 'precision' option does not directly specify the _accuracy_
+   * of the returned eigenvalues. Rather, it determines how small an entry
+   * of the iterative approximations to an upper triangular matrix must be
+   * in order to be considered zero. The actual accuracy of the returned
+   * eigenvalues may be greater or less than the precision, depending on the
+   * conditioning of the matrix and how far apart or close the actual
+   * eigenvalues are. Note that currently, relatively simple, "traditional"
+   * methods of eigenvalue computation are being used; this is not a modern,
+   * high-precision eigenvalue computation. That said, it should typically
+   * produce fairly reasonable results.
+   *
+   * Syntax:
+   *
+   *     math.eigs(x, [prec])
+   *     math.eigs(x, {options})
+   *
+   * Examples:
+   *
+   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math
+   *     const H = [[5, 2.3], [2.3, 1]]
+   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]
+   *     const E = ans.values
+   *     const V = ans.eigenvectors
+   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))
+   *     const U = matrixFromColumns(...V.map(obj => obj.vector))
+   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible
+   *     E[0] == UTxHxU[0][0]  // returns true always
+   *
+   *     // Compute only approximate eigenvalues:
+   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {Array | Matrix} x  Matrix to be diagonalized
+   *
+   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.relTol, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.
+   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.
+   *
+   */
+  return typed('eigs', {
+    // The conversion to matrix in the first two implementations,
+    // just to convert back to an array right away in
+    // computeValuesAndVectors, is unfortunate, and should perhaps be
+    // streamlined. It is done because the Matrix object carries some
+    // type information about its entries, and so constructing the matrix
+    // is a roundabout way of doing type detection.
+    Array: function (x) {
+      return doEigs(matrix(x));
+    },
+    'Array, number|BigNumber': function (x, prec) {
+      return doEigs(matrix(x), {
+        precision: prec
+      });
+    },
+    'Array, Object'(x, opts) {
+      return doEigs(matrix(x), opts);
+    },
+    Matrix: function (mat) {
+      return doEigs(mat, {
+        matricize: true
+      });
+    },
+    'Matrix, number|BigNumber': function (mat, prec) {
+      return doEigs(mat, {
+        precision: prec,
+        matricize: true
+      });
+    },
+    'Matrix, Object': function (mat, opts) {
+      const useOpts = {
+        matricize: true
+      };
+      (0, _extends2.default)(useOpts, opts);
+      return doEigs(mat, useOpts);
+    }
+  });
+  function doEigs(mat) {
+    var _opts$precision;
+    let opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    const computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true;
+    const prec = (_opts$precision = opts.precision) !== null && _opts$precision !== void 0 ? _opts$precision : config.relTol;
+    const result = computeValuesAndVectors(mat, prec, computeVectors);
+    if (opts.matricize) {
+      result.values = matrix(result.values);
+      if (computeVectors) {
+        result.eigenvectors = result.eigenvectors.map(_ref2 => {
+          let {
+            value,
+            vector
+          } = _ref2;
+          return {
+            value,
+            vector: matrix(vector)
+          };
+        });
+      }
+    }
+    if (computeVectors) {
+      Object.defineProperty(result, 'vectors', {
+        enumerable: false,
+        // to make sure that the eigenvectors can still be
+        // converted to string.
+        get: () => {
+          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors');
+        }
+      });
+    }
+    return result;
+  }
+  function computeValuesAndVectors(mat, prec, computeVectors) {
+    const arr = mat.toArray(); // NOTE: arr is guaranteed to be unaliased
+    // and so safe to modify in place
+    const asize = mat.size();
+    if (asize.length !== 2 || asize[0] !== asize[1]) {
+      throw new RangeError(`Matrix must be square (size: ${(0, _string.format)(asize)})`);
+    }
+    const N = asize[0];
+    if (isReal(arr, N, prec)) {
+      coerceReal(arr, N); // modifies arr by side effect
+
+      if (isSymmetric(arr, N, prec)) {
+        const type = coerceTypes(mat, arr, N); // modifies arr by side effect
+        return doRealSymmetric(arr, N, prec, type, computeVectors);
+      }
+    }
+    const type = coerceTypes(mat, arr, N); // modifies arr by side effect
+    return doComplexEigs(arr, N, prec, type, computeVectors);
+  }
+
+  /** @return {boolean} */
+  function isSymmetric(arr, N, prec) {
+    for (let i = 0; i < N; i++) {
+      for (let j = i; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+
+  /** @return {boolean} */
+  function isReal(arr, N, prec) {
+    for (let i = 0; i < N; i++) {
+      for (let j = 0; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+  function coerceReal(arr, N) {
+    for (let i = 0; i < N; i++) {
+      for (let j = 0; j < N; j++) {
+        arr[i][j] = re(arr[i][j]);
+      }
+    }
+  }
+
+  /** @return {'number' | 'BigNumber' | 'Complex'} */
+  function coerceTypes(mat, arr, N) {
+    /** @type {string} */
+    const type = mat.datatype();
+    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {
+      return type;
+    }
+    let hasNumber = false;
+    let hasBig = false;
+    let hasComplex = false;
+    for (let i = 0; i < N; i++) {
+      for (let j = 0; j < N; j++) {
+        const el = arr[i][j];
+        if ((0, _is.isNumber)(el) || (0, _is.isFraction)(el)) {
+          hasNumber = true;
+        } else if ((0, _is.isBigNumber)(el)) {
+          hasBig = true;
+        } else if ((0, _is.isComplex)(el)) {
+          hasComplex = true;
+        } else {
+          throw TypeError('Unsupported type in Matrix: ' + (0, _is.typeOf)(el));
+        }
+      }
+    }
+    if (hasBig && hasComplex) {
+      console.warn('Complex BigNumbers not supported, this operation will lose precission.');
+    }
+    if (hasComplex) {
+      for (let i = 0; i < N; i++) {
+        for (let j = 0; j < N; j++) {
+          arr[i][j] = complex(arr[i][j]);
+        }
+      }
+      return 'Complex';
+    }
+    if (hasBig) {
+      for (let i = 0; i < N; i++) {
+        for (let j = 0; j < N; j++) {
+          arr[i][j] = bignumber(arr[i][j]);
+        }
+      }
+      return 'BigNumber';
+    }
+    if (hasNumber) {
+      for (let i = 0; i < N; i++) {
+        for (let j = 0; j < N; j++) {
+          arr[i][j] = number(arr[i][j]);
+        }
+      }
+      return 'number';
+    } else {
+      throw TypeError('Matrix contains unsupported types only.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js
new file mode 100644
index 0000000..d9c7e42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs/complexEigs.js
@@ -0,0 +1,701 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplexEigs = createComplexEigs;
+var _object = require("../../../utils/object.js");
+function createComplexEigs(_ref) {
+  let {
+    addScalar,
+    subtract,
+    flatten,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    size,
+    reshape,
+    inv,
+    qr,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+  /**
+   * @param {number[][]} arr the matrix to find eigenvalues of
+   * @param {number} N size of the matrix
+   * @param {number|BigNumber} prec precision, anything lower will be considered zero
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors should we find eigenvectors?
+   *
+   * @returns {{ values: number[], vectors: number[][] }}
+   */
+  function complexEigs(arr, N, prec, type) {
+    let findVectors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
+    // TODO check if any row/col are zero except the diagonal
+
+    // make sure corresponding rows and columns have similar magnitude
+    // important because of numerical stability
+    // MODIFIES arr by side effect!
+    const R = balance(arr, N, prec, type, findVectors);
+
+    // R is the row transformation matrix
+    // arr = A' = R A R^-1, A is the original matrix
+    // (if findVectors is false, R is undefined)
+    // (And so to return to original matrix: A = R^-1 arr R)
+
+    // TODO if magnitudes of elements vary over many orders,
+    // move greatest elements to the top left corner
+
+    // using similarity transformations, reduce the matrix
+    // to Hessenberg form (upper triangular plus one subdiagonal row)
+    // updates the transformation matrix R with new row operationsq
+    // MODIFIES arr by side effect!
+    reduceToHessenberg(arr, N, prec, type, findVectors, R);
+    // still true that original A = R^-1 arr R)
+
+    // find eigenvalues
+    const {
+      values,
+      C
+    } = iterateUntilTriangular(arr, N, prec, type, findVectors);
+
+    // values is the list of eigenvalues, C is the column
+    // transformation matrix that transforms arr, the hessenberg
+    // matrix, to upper triangular
+    // (So U = C^-1 arr C and the relationship between current arr
+    // and original A is unchanged.)
+
+    if (findVectors) {
+      const eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type);
+      return {
+        values,
+        eigenvectors
+      };
+    }
+    return {
+      values
+    };
+  }
+
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]}
+   */
+  function balance(arr, N, prec, type, findVectors) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const realzero = big ? bignumber(0) : 0;
+    const one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    const realone = big ? bignumber(1) : 1;
+
+    // base of the floating-point arithmetic
+    const radix = big ? bignumber(10) : 2;
+    const radixSq = multiplyScalar(radix, radix);
+
+    // the diagonal transformation matrix R
+    let Rdiag;
+    if (findVectors) {
+      Rdiag = Array(N).fill(one);
+    }
+
+    // this isn't the only time we loop thru the matrix...
+    let last = false;
+    while (!last) {
+      // ...haha I'm joking! unless...
+      last = true;
+      for (let i = 0; i < N; i++) {
+        // compute the taxicab norm of i-th column and row
+        // TODO optimize for complex numbers
+        let colNorm = realzero;
+        let rowNorm = realzero;
+        for (let j = 0; j < N; j++) {
+          if (i === j) continue;
+          colNorm = addScalar(colNorm, abs(arr[j][i]));
+          rowNorm = addScalar(rowNorm, abs(arr[i][j]));
+        }
+        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {
+          // find integer power closest to balancing the matrix
+          // (we want to scale only by integer powers of radix,
+          // so that we don't lose any precision due to round-off)
+
+          let f = realone;
+          let c = colNorm;
+          const rowDivRadix = divideScalar(rowNorm, radix);
+          const rowMulRadix = multiplyScalar(rowNorm, radix);
+          while (smaller(c, rowDivRadix)) {
+            c = multiplyScalar(c, radixSq);
+            f = multiplyScalar(f, radix);
+          }
+          while (larger(c, rowMulRadix)) {
+            c = divideScalar(c, radixSq);
+            f = divideScalar(f, radix);
+          }
+
+          // check whether balancing is needed
+          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)
+          const condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95));
+
+          // apply balancing similarity transformation
+          if (condition) {
+            // we should loop once again to check whether
+            // another rebalancing is needed
+            last = false;
+            const g = divideScalar(1, f);
+            for (let j = 0; j < N; j++) {
+              if (i === j) {
+                continue;
+              }
+              arr[i][j] = multiplyScalar(arr[i][j], g);
+              arr[j][i] = multiplyScalar(arr[j][i], f);
+            }
+
+            // keep track of transformations
+            if (findVectors) {
+              Rdiag[i] = multiplyScalar(Rdiag[i], g);
+            }
+          }
+        }
+      }
+    }
+
+    // return the diagonal row transformation matrix
+    return findVectors ? diag(Rdiag) : null;
+  }
+
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors
+   * @param {number[][]} R the row transformation matrix that will be modified
+   */
+  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    if (big) {
+      prec = bignumber(prec);
+    }
+    for (let i = 0; i < N - 2; i++) {
+      // Find the largest subdiag element in the i-th col
+
+      let maxIndex = 0;
+      let max = zero;
+      for (let j = i + 1; j < N; j++) {
+        const el = arr[j][i];
+        if (smaller(abs(max), abs(el))) {
+          max = el;
+          maxIndex = j;
+        }
+      }
+
+      // This col is pivoted, no need to do anything
+      if (smaller(abs(max), prec)) {
+        continue;
+      }
+      if (maxIndex !== i + 1) {
+        // Interchange maxIndex-th and (i+1)-th row
+        const tmp1 = arr[maxIndex];
+        arr[maxIndex] = arr[i + 1];
+        arr[i + 1] = tmp1;
+
+        // Interchange maxIndex-th and (i+1)-th column
+        for (let j = 0; j < N; j++) {
+          const tmp2 = arr[j][maxIndex];
+          arr[j][maxIndex] = arr[j][i + 1];
+          arr[j][i + 1] = tmp2;
+        }
+
+        // keep track of transformations
+        if (findVectors) {
+          const tmp3 = R[maxIndex];
+          R[maxIndex] = R[i + 1];
+          R[i + 1] = tmp3;
+        }
+      }
+
+      // Reduce following rows and columns
+      for (let j = i + 2; j < N; j++) {
+        const n = divideScalar(arr[j][i], max);
+        if (n === 0) {
+          continue;
+        }
+
+        // from j-th row subtract n-times (i+1)th row
+        for (let k = 0; k < N; k++) {
+          arr[j][k] = subtract(arr[j][k], multiplyScalar(n, arr[i + 1][k]));
+        }
+
+        // to (i+1)th column add n-times j-th column
+        for (let k = 0; k < N; k++) {
+          arr[k][i + 1] = addScalar(arr[k][i + 1], multiplyScalar(n, arr[k][j]));
+        }
+
+        // keep track of transformations
+        if (findVectors) {
+          for (let k = 0; k < N; k++) {
+            R[j][k] = subtract(R[j][k], multiplyScalar(n, R[i + 1][k]));
+          }
+        }
+      }
+    }
+    return R;
+  }
+
+  /**
+   * @returns {{values: values, C: Matrix}}
+   * @see Press, Wiliams: Numerical recipes in Fortran 77
+   * @see https://en.wikipedia.org/wiki/QR_algorithm
+   */
+  function iterateUntilTriangular(A, N, prec, type, findVectors) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    if (big) {
+      prec = bignumber(prec);
+    }
+
+    // The Francis Algorithm
+    // The core idea of this algorithm is that doing successive
+    // A' = QtAQ transformations will eventually converge to block-
+    // upper-triangular with diagonal blocks either 1x1 or 2x2.
+    // The Q here is the one from the QR decomposition, A = QR.
+    // Since the eigenvalues of a block-upper-triangular matrix are
+    // the eigenvalues of its diagonal blocks and we know how to find
+    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.
+
+    let arr = (0, _object.clone)(A);
+
+    // the list of converged eigenvalues
+    const lambdas = [];
+
+    // size of arr, which will get smaller as eigenvalues converge
+    let n = N;
+
+    // the diagonal of the block-diagonal matrix that turns
+    // converged 2x2 matrices into upper triangular matrices
+    const Sdiag = [];
+
+    // N×N matrix describing the overall transformation done during the QR algorithm
+    let Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;
+
+    // nxn matrix describing the QR transformations done since last convergence
+    let Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined;
+
+    // last eigenvalue converged before this many steps
+    let lastConvergenceBefore = 0;
+    while (lastConvergenceBefore <= 100) {
+      lastConvergenceBefore += 1;
+
+      // TODO if the convergence is slow, do something clever
+
+      // Perform the factorization
+
+      const k = arr[n - 1][n - 1]; // TODO this is apparently a somewhat
+      // old-fashioned choice; ideally set close to an eigenvalue, or
+      // perhaps better yet switch to the implicit QR version that is sometimes
+      // specifically called the "Francis algorithm" that is alluded to
+      // in the following TODO. (Or perhaps we switch to an independently
+      // optimized third-party package for the linear algebra operations...)
+
+      for (let i = 0; i < n; i++) {
+        arr[i][i] = subtract(arr[i][i], k);
+      }
+
+      // TODO do an implicit QR transformation
+      const {
+        Q,
+        R
+      } = qr(arr);
+      arr = multiply(R, Q);
+      for (let i = 0; i < n; i++) {
+        arr[i][i] = addScalar(arr[i][i], k);
+      }
+
+      // keep track of transformations
+      if (findVectors) {
+        Qpartial = multiply(Qpartial, Q);
+      }
+
+      // The rightmost diagonal element converged to an eigenvalue
+      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {
+        lastConvergenceBefore = 0;
+        lambdas.push(arr[n - 1][n - 1]);
+
+        // keep track of transformations
+        if (findVectors) {
+          Sdiag.unshift([[1]]);
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+          if (n > 1) {
+            Qpartial = diag(Array(n - 1).fill(one));
+          }
+        }
+
+        // reduce the matrix size
+        n -= 1;
+        arr.pop();
+        for (let i = 0; i < n; i++) {
+          arr[i].pop();
+        }
+
+        // The rightmost diagonal 2x2 block converged
+      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
+        lastConvergenceBefore = 0;
+        const ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
+        lambdas.push(...ll);
+
+        // keep track of transformations
+        if (findVectors) {
+          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+          if (n > 2) {
+            Qpartial = diag(Array(n - 2).fill(one));
+          }
+        }
+
+        // reduce the matrix size
+        n -= 2;
+        arr.pop();
+        arr.pop();
+        for (let i = 0; i < n; i++) {
+          arr[i].pop();
+          arr[i].pop();
+        }
+      }
+      if (n === 0) {
+        break;
+      }
+    }
+
+    // standard sorting
+    lambdas.sort((a, b) => +subtract(abs(a), abs(b)));
+
+    // the algorithm didn't converge
+    if (lastConvergenceBefore > 100) {
+      const err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));
+      err.values = lambdas;
+      err.vectors = [];
+      throw err;
+    }
+
+    // combine the overall QR transformation Qtotal with the subsequent
+    // transformation S that turns the diagonal 2x2 blocks to upper triangular
+    const C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;
+    return {
+      values: lambdas,
+      C
+    };
+  }
+
+  /**
+   * @param {Matrix} A hessenberg-form matrix
+   * @param {number} N size of A
+   * @param {Matrix} C column transformation matrix that turns A into upper triangular
+   * @param {Matrix} R similarity that turns original matrix into A
+   * @param {number[]} values array of eigenvalues of A
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]} eigenvalues
+   */
+  function findEigenvectors(A, N, C, R, values, prec, type) {
+    const Cinv = inv(C);
+    const U = multiply(Cinv, A, C);
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    const one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    // turn values into a kind of "multiset"
+    // this way it is easier to find eigenvectors
+    const uniqueValues = [];
+    const multiplicities = [];
+    for (const lambda of values) {
+      const i = indexOf(uniqueValues, lambda, equal);
+      if (i === -1) {
+        uniqueValues.push(lambda);
+        multiplicities.push(1);
+      } else {
+        multiplicities[i] += 1;
+      }
+    }
+
+    // find eigenvectors by solving U − lambdaE = 0
+    // TODO replace with an iterative eigenvector algorithm
+    // (this one might fail for imprecise eigenvalues)
+
+    const vectors = [];
+    const len = uniqueValues.length;
+    const b = Array(N).fill(zero);
+    const E = diag(Array(N).fill(one));
+    for (let i = 0; i < len; i++) {
+      const lambda = uniqueValues[i];
+      const S = subtract(U, multiply(lambda, E)); // the characteristic matrix
+
+      let solutions = usolveAll(S, b);
+      solutions.shift(); // ignore the null vector
+
+      // looks like we missed something, try inverse iteration
+      // But if that fails, just presume that the original matrix truly
+      // was defective.
+      while (solutions.length < multiplicities[i]) {
+        const approxVec = inverseIterate(S, N, solutions, prec, type);
+        if (approxVec === null) {
+          break;
+        } // no more vectors were found
+        solutions.push(approxVec);
+      }
+
+      // Transform back into original array coordinates
+      const correction = multiply(inv(R), C);
+      solutions = solutions.map(v => multiply(correction, v));
+      vectors.push(...solutions.map(v => ({
+        value: lambda,
+        vector: flatten(v)
+      })));
+    }
+    return vectors;
+  }
+
+  /**
+   * Compute the eigenvalues of an 2x2 matrix
+   * @return {[number,number]}
+   */
+  function eigenvalues2x2(a, b, c, d) {
+    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 A - 4 detA )
+    const trA = addScalar(a, d);
+    const detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));
+    const x = multiplyScalar(trA, 0.5);
+    const y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);
+    return [addScalar(x, y), subtract(x, y)];
+  }
+
+  /**
+   * For an 2x2 matrix compute the transformation matrix S,
+   * so that SAS^-1 is an upper triangular matrix
+   * @return {[[number,number],[number,number]]}
+   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf
+   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html
+   */
+  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    const one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    // matrix is already upper triangular
+    // return an identity matrix
+    if (smaller(abs(c), prec)) {
+      return [[one, zero], [zero, one]];
+    }
+
+    // matrix is diagonalizable
+    // return its eigenvectors as columns
+    if (larger(abs(subtract(l1, l2)), prec)) {
+      return [[subtract(l1, d), subtract(l2, d)], [c, c]];
+    }
+
+    // matrix is not diagonalizable
+    // compute diagonal elements of N = A - lambdaI
+    const na = subtract(a, l1);
+    const nd = subtract(d, l1);
+
+    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )
+    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )
+
+    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {
+      return [[na, one], [c, zero]];
+    } else {
+      return [[b, zero], [nd, one]];
+    }
+  }
+
+  /**
+   * Enlarge the matrix from nxn to NxN, setting the new
+   * elements to 1 on diagonal and 0 elsewhere
+   */
+  function inflateMatrix(arr, N) {
+    // add columns
+    for (let i = 0; i < arr.length; i++) {
+      arr[i].push(...Array(N - arr[i].length).fill(0));
+    }
+
+    // add rows
+    for (let i = arr.length; i < N; i++) {
+      arr.push(Array(N).fill(0));
+      arr[i][i] = 1;
+    }
+    return arr;
+  }
+
+  /**
+   * Create a block-diagonal matrix with the given square matrices on the diagonal
+   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal
+   * @param {number} N the size of the resulting matrix
+   */
+  function blockDiag(arr, N) {
+    const M = [];
+    for (let i = 0; i < N; i++) {
+      M[i] = Array(N).fill(0);
+    }
+    let I = 0;
+    for (const sub of arr) {
+      const n = sub.length;
+      for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+          M[I + i][I + j] = sub[i][j];
+        }
+      }
+      I += n;
+    }
+    return M;
+  }
+
+  /**
+   * Finds the index of an element in an array using a custom equality function
+   * @template T
+   * @param {Array<T>} arr array in which to search
+   * @param {T} el the element to find
+   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`
+   * @returns {number} the index of `el`, or -1 when it's not in `arr`
+   */
+  function indexOf(arr, el, fn) {
+    for (let i = 0; i < arr.length; i++) {
+      if (fn(arr[i], el)) {
+        return i;
+      }
+    }
+    return -1;
+  }
+
+  /**
+   * Provided a near-singular upper-triangular matrix A and a list of vectors,
+   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal
+   * to each vector in the list
+   * @template T
+   * @param {T[][]} A near-singular square matrix
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {number} prec epsilon
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @return {T[] | null} eigenvector
+   *
+   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration
+   */
+  function inverseIterate(A, N, orthog, prec, type) {
+    const largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;
+    let b; // the vector
+
+    // you better choose a random vector before I count to five
+    let i = 0;
+    for (; i < 5; ++i) {
+      b = randomOrthogonalVector(N, orthog, type);
+      try {
+        b = usolve(A, b);
+      } catch (_unused) {
+        // That direction didn't work, likely because the original matrix
+        // was defective. But still make the full number of tries...
+        continue;
+      }
+      if (larger(norm(b), largeNum)) {
+        break;
+      }
+    }
+    if (i >= 5) {
+      return null; // couldn't find any orthogonal vector in the image
+    }
+
+    // you better converge before I count to ten
+    i = 0;
+    while (true) {
+      const c = usolve(A, b);
+      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {
+        break;
+      }
+      if (++i >= 10) {
+        return null;
+      }
+      b = normalize(c);
+    }
+    return b;
+  }
+
+  /**
+   * Generates a random unit vector of dimension N, orthogonal to each vector in the list
+   * @template T
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} random vector
+   */
+  function randomOrthogonalVector(N, orthog, type) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+
+    // generate random vector with the correct type
+    let v = Array(N).fill(0).map(_ => 2 * Math.random() - 1);
+    if (big) {
+      v = v.map(n => bignumber(n));
+    }
+    if (cplx) {
+      v = v.map(n => complex(n));
+    }
+
+    // project to orthogonal complement
+    v = orthogonalComplement(v, orthog);
+
+    // normalize
+    return normalize(v, type);
+  }
+
+  /**
+   * Project vector v to the orthogonal complement of an array of vectors
+   */
+  function orthogonalComplement(v, orthog) {
+    const vectorShape = size(v);
+    for (let w of orthog) {
+      w = reshape(w, vectorShape); // make sure this is just a vector computation
+      // v := v − (w, v)/|w|^2 w
+      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));
+    }
+    return v;
+  }
+
+  /**
+   * Calculate the norm of a vector.
+   * We can't use math.norm because factory can't handle circular dependency.
+   * Seriously, I'm really fed up with factory.
+   */
+  function norm(v) {
+    return abs(sqrt(dot(v, v)));
+  }
+
+  /**
+   * Normalize a vector
+   * @template T
+   * @param {T[]} v
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} normalized vec
+   */
+  function normalize(v, type) {
+    const big = type === 'BigNumber';
+    const cplx = type === 'Complex';
+    const one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    return multiply(divideScalar(one, norm(v)), v);
+  }
+  return complexEigs;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymmetric.js b/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymmetric.js
new file mode 100644
index 0000000..5ed0f0f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/eigs/realSymmetric.js
@@ -0,0 +1,303 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRealSymmetric = createRealSymmetric;
+var _object = require("../../../utils/object.js");
+function createRealSymmetric(_ref) {
+  let {
+    config,
+    addScalar,
+    subtract,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    multiply,
+    add
+  } = _ref;
+  /**
+   * @param {number[] | BigNumber[]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number' | 'BigNumber'} type
+   */
+  function main(arr, N) {
+    let prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.relTol;
+    let type = arguments.length > 3 ? arguments[3] : undefined;
+    let computeVectors = arguments.length > 4 ? arguments[4] : undefined;
+    if (type === 'number') {
+      return diag(arr, prec, computeVectors);
+    }
+    if (type === 'BigNumber') {
+      return diagBig(arr, prec, computeVectors);
+    }
+    throw TypeError('Unsupported data type: ' + type);
+  }
+
+  // diagonalization implementation for number (efficient)
+  function diag(x, precision, computeVectors) {
+    const N = x.length;
+    const e0 = Math.abs(precision / N);
+    let psi;
+    let Sij;
+    if (computeVectors) {
+      Sij = new Array(N);
+      // Sij is Identity Matrix
+      for (let i = 0; i < N; i++) {
+        Sij[i] = Array(N).fill(0);
+        Sij[i][i] = 1.0;
+      }
+    }
+    // initial error
+    let Vab = getAij(x);
+    while (Math.abs(Vab[1]) >= Math.abs(e0)) {
+      const i = Vab[0][0];
+      const j = Vab[0][1];
+      psi = getTheta(x[i][i], x[j][j], x[i][j]);
+      x = x1(x, psi, i, j);
+      if (computeVectors) Sij = Sij1(Sij, psi, i, j);
+      Vab = getAij(x);
+    }
+    const Ei = Array(N).fill(0); // eigenvalues
+    for (let i = 0; i < N; i++) {
+      Ei[i] = x[i][i];
+    }
+    return sorting((0, _object.clone)(Ei), Sij, computeVectors);
+  }
+
+  // diagonalization implementation for bigNumber
+  function diagBig(x, precision, computeVectors) {
+    const N = x.length;
+    const e0 = abs(precision / N);
+    let psi;
+    let Sij;
+    if (computeVectors) {
+      Sij = new Array(N);
+      // Sij is Identity Matrix
+      for (let i = 0; i < N; i++) {
+        Sij[i] = Array(N).fill(0);
+        Sij[i][i] = 1.0;
+      }
+    }
+    // initial error
+    let Vab = getAijBig(x);
+    while (abs(Vab[1]) >= abs(e0)) {
+      const i = Vab[0][0];
+      const j = Vab[0][1];
+      psi = getThetaBig(x[i][i], x[j][j], x[i][j]);
+      x = x1Big(x, psi, i, j);
+      if (computeVectors) Sij = Sij1Big(Sij, psi, i, j);
+      Vab = getAijBig(x);
+    }
+    const Ei = Array(N).fill(0); // eigenvalues
+    for (let i = 0; i < N; i++) {
+      Ei[i] = x[i][i];
+    }
+    // return [clone(Ei), clone(Sij)]
+    return sorting((0, _object.clone)(Ei), Sij, computeVectors);
+  }
+
+  // get angle
+  function getTheta(aii, ajj, aij) {
+    const denom = ajj - aii;
+    if (Math.abs(denom) <= config.relTol) {
+      return Math.PI / 4.0;
+    } else {
+      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));
+    }
+  }
+
+  // get angle
+  function getThetaBig(aii, ajj, aij) {
+    const denom = subtract(ajj, aii);
+    if (abs(denom) <= config.relTol) {
+      return bignumber(-1).acos().div(4);
+    } else {
+      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));
+    }
+  }
+
+  // update eigvec
+  function Sij1(Sij, theta, i, j) {
+    const N = Sij.length;
+    const c = Math.cos(theta);
+    const s = Math.sin(theta);
+    const Ski = Array(N).fill(0);
+    const Skj = Array(N).fill(0);
+    for (let k = 0; k < N; k++) {
+      Ski[k] = c * Sij[k][i] - s * Sij[k][j];
+      Skj[k] = s * Sij[k][i] + c * Sij[k][j];
+    }
+    for (let k = 0; k < N; k++) {
+      Sij[k][i] = Ski[k];
+      Sij[k][j] = Skj[k];
+    }
+    return Sij;
+  }
+  // update eigvec for overlap
+  function Sij1Big(Sij, theta, i, j) {
+    const N = Sij.length;
+    const c = cos(theta);
+    const s = sin(theta);
+    const Ski = Array(N).fill(bignumber(0));
+    const Skj = Array(N).fill(bignumber(0));
+    for (let k = 0; k < N; k++) {
+      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));
+      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));
+    }
+    for (let k = 0; k < N; k++) {
+      Sij[k][i] = Ski[k];
+      Sij[k][j] = Skj[k];
+    }
+    return Sij;
+  }
+
+  // update matrix
+  function x1Big(Hij, theta, i, j) {
+    const N = Hij.length;
+    const c = bignumber(cos(theta));
+    const s = bignumber(sin(theta));
+    const c2 = multiplyScalar(c, c);
+    const s2 = multiplyScalar(s, s);
+    const Aki = Array(N).fill(bignumber(0));
+    const Akj = Array(N).fill(bignumber(0));
+    // 2cs Hij
+    const csHij = multiply(bignumber(2), c, s, Hij[i][j]);
+    //  Aii
+    const Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));
+    const Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]));
+    // 0  to i
+    for (let k = 0; k < N; k++) {
+      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));
+      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));
+    }
+    // Modify Hij
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = bignumber(0);
+    Hij[j][i] = bignumber(0);
+    // 0  to i
+    for (let k = 0; k < N; k++) {
+      if (k !== i && k !== j) {
+        Hij[i][k] = Aki[k];
+        Hij[k][i] = Aki[k];
+        Hij[j][k] = Akj[k];
+        Hij[k][j] = Akj[k];
+      }
+    }
+    return Hij;
+  }
+
+  // update matrix
+  function x1(Hij, theta, i, j) {
+    const N = Hij.length;
+    const c = Math.cos(theta);
+    const s = Math.sin(theta);
+    const c2 = c * c;
+    const s2 = s * s;
+    const Aki = Array(N).fill(0);
+    const Akj = Array(N).fill(0);
+    //  Aii
+    const Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];
+    const Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j];
+    // 0  to i
+    for (let k = 0; k < N; k++) {
+      Aki[k] = c * Hij[i][k] - s * Hij[j][k];
+      Akj[k] = s * Hij[i][k] + c * Hij[j][k];
+    }
+    // Modify Hij
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = 0;
+    Hij[j][i] = 0;
+    // 0  to i
+    for (let k = 0; k < N; k++) {
+      if (k !== i && k !== j) {
+        Hij[i][k] = Aki[k];
+        Hij[k][i] = Aki[k];
+        Hij[j][k] = Akj[k];
+        Hij[k][j] = Akj[k];
+      }
+    }
+    return Hij;
+  }
+
+  // get max off-diagonal value from Upper Diagonal
+  function getAij(Mij) {
+    const N = Mij.length;
+    let maxMij = 0;
+    let maxIJ = [0, 1];
+    for (let i = 0; i < N; i++) {
+      for (let j = i + 1; j < N; j++) {
+        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {
+          maxMij = Math.abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+    return [maxIJ, maxMij];
+  }
+
+  // get max off-diagonal value from Upper Diagonal
+  function getAijBig(Mij) {
+    const N = Mij.length;
+    let maxMij = 0;
+    let maxIJ = [0, 1];
+    for (let i = 0; i < N; i++) {
+      for (let j = i + 1; j < N; j++) {
+        if (abs(maxMij) < abs(Mij[i][j])) {
+          maxMij = abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+    return [maxIJ, maxMij];
+  }
+
+  // sort results
+  function sorting(E, S, computeVectors) {
+    const N = E.length;
+    const values = Array(N);
+    let vecs;
+    if (computeVectors) {
+      vecs = Array(N);
+      for (let k = 0; k < N; k++) {
+        vecs[k] = Array(N);
+      }
+    }
+    for (let i = 0; i < N; i++) {
+      let minID = 0;
+      let minE = E[0];
+      for (let j = 0; j < E.length; j++) {
+        if (abs(E[j]) < abs(minE)) {
+          minID = j;
+          minE = E[minID];
+        }
+      }
+      values[i] = E.splice(minID, 1)[0];
+      if (computeVectors) {
+        for (let k = 0; k < N; k++) {
+          vecs[i][k] = S[k][minID];
+          S[k].splice(minID, 1);
+        }
+      }
+    }
+    if (!computeVectors) return {
+      values
+    };
+    const eigenvectors = vecs.map((vector, i) => ({
+      value: values[i],
+      vector
+    }));
+    return {
+      values,
+      eigenvectors
+    };
+  }
+  return main;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/expm.js b/node_modules/mathjs/lib/cjs/function/matrix/expm.js
new file mode 100644
index 0000000..f44e112
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/expm.js
@@ -0,0 +1,160 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createExpm = void 0;
+var _is = require("../../utils/is.js");
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+const name = 'expm';
+const dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];
+const createExpm = exports.createExpm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    add,
+    identity,
+    inv,
+    multiply
+  } = _ref;
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
+   * Not to be confused with exp(a), which performs element-wise
+   * exponentiation.
+   *
+   * The exponential is calculated using the Padé approximant with scaling and
+   * squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
+   * Matrix," by Moler and Van Loan.
+   *
+   * Syntax:
+   *
+   *     math.expm(x)
+   *
+   * Examples:
+   *
+   *     const A = [[0,2],[0,0]]
+   *     math.expm(A)        // returns [[1,2],[0,1]]
+   *
+   * See also:
+   *
+   *     exp
+   *
+   * @param {Matrix} x  A square Matrix
+   * @return {Matrix}   The exponential of x
+   */
+  return typed(name, {
+    Matrix: function (A) {
+      // Check matrix size
+      const size = A.size();
+      if (size.length !== 2 || size[0] !== size[1]) {
+        throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+      const n = size[0];
+
+      // Desired accuracy of the approximant (The actual accuracy
+      // will be affected by round-off error)
+      const eps = 1e-15;
+
+      // The Padé approximant is not so accurate when the values of A
+      // are "large", so scale A by powers of two. Then compute the
+      // exponential, and square the result repeatedly according to
+      // the identity e^A = (e^(A/m))^m
+
+      // Compute infinity-norm of A, ||A||, to see how "big" it is
+      const infNorm = infinityNorm(A);
+
+      // Find the optimal scaling factor and number of terms in the
+      // Padé approximant to reach the desired accuracy
+      const params = findParams(infNorm, eps);
+      const q = params.q;
+      const j = params.j;
+
+      // The Pade approximation to e^A is:
+      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)
+      // where
+      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i
+      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i
+
+      // Scale A by 1 / 2^j
+      const Apos = multiply(A, Math.pow(2, -j));
+
+      // The i=0 term is just the identity matrix
+      let N = identity(n);
+      let D = identity(n);
+
+      // Initialization (i=0)
+      let factor = 1;
+
+      // Initialization (i=1)
+      let AposToI = Apos; // Cloning not necessary
+      let alternate = -1;
+      for (let i = 1; i <= q; i++) {
+        if (i > 1) {
+          AposToI = multiply(AposToI, Apos);
+          alternate = -alternate;
+        }
+        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);
+        N = add(N, multiply(factor, AposToI));
+        D = add(D, multiply(factor * alternate, AposToI));
+      }
+      let R = multiply(inv(D), N);
+
+      // Square j times
+      for (let i = 0; i < j; i++) {
+        R = multiply(R, R);
+      }
+      return (0, _is.isSparseMatrix)(A) ? A.createSparseMatrix(R) : R;
+    }
+  });
+  function infinityNorm(A) {
+    const n = A.size()[0];
+    let infNorm = 0;
+    for (let i = 0; i < n; i++) {
+      let rowSum = 0;
+      for (let j = 0; j < n; j++) {
+        rowSum += abs(A.get([i, j]));
+      }
+      infNorm = Math.max(rowSum, infNorm);
+    }
+    return infNorm;
+  }
+
+  /**
+   * Find the best parameters for the Pade approximant given
+   * the matrix norm and desired accuracy. Returns the first acceptable
+   * combination in order of increasing computational load.
+   */
+  function findParams(infNorm, eps) {
+    const maxSearchSize = 30;
+    for (let k = 0; k < maxSearchSize; k++) {
+      for (let q = 0; q <= k; q++) {
+        const j = k - q;
+        if (errorEstimate(infNorm, q, j) < eps) {
+          return {
+            q,
+            j
+          };
+        }
+      }
+    }
+    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');
+  }
+
+  /**
+   * Returns the estimated error of the Pade approximant for the given
+   * parameters.
+   */
+  function errorEstimate(infNorm, q, j) {
+    let qfac = 1;
+    for (let i = 2; i <= q; i++) {
+      qfac *= i;
+    }
+    let twoqfac = qfac;
+    for (let i = q + 1; i <= 2 * q; i++) {
+      twoqfac *= i;
+    }
+    const twoqp1fac = twoqfac * (2 * q + 1);
+    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/fft.js b/node_modules/mathjs/lib/cjs/function/matrix/fft.js
new file mode 100644
index 0000000..ddab998
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/fft.js
@@ -0,0 +1,134 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFft = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'fft';
+const dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'divideScalar', 'exp', 'tau', 'i', 'dotDivide', 'conj', 'pow', 'ceil', 'log2'];
+const createFft = exports.createFft = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    addScalar,
+    multiplyScalar,
+    divideScalar,
+    exp,
+    tau,
+    i: I,
+    dotDivide,
+    conj,
+    pow,
+    ceil,
+    log2
+  } = _ref;
+  /**
+   * Calculate N-dimensional Fourier transform
+   *
+   * Syntax:
+   *
+   *     math.fft(arr)
+   *
+   * Examples:
+   *
+   *    math.fft([[1, 0], [1, 0]]) // returns [[{re:2, im:0}, {re:2, im:0}], [{re:0, im:0}, {re:0, im:0}]]
+   *
+   *
+   * See Also:
+   *
+   *      ifft
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  return typed(name, {
+    Array: _ndFft,
+    Matrix: function (matrix) {
+      return matrix.create(_ndFft(matrix.valueOf()), matrix.datatype());
+    }
+  });
+
+  /**
+   * Perform an N-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _ndFft(arr) {
+    const size = (0, _array.arraySize)(arr);
+    if (size.length === 1) return _fft(arr, size[0]);
+    // ndFft along dimension 1,...,N-1 then 1dFft along dimension 0
+    return _1dFft(arr.map(slice => _ndFft(slice, size.slice(1))), 0);
+  }
+
+  /**
+   * Perform an 1-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     dimension of the array to perform on
+   * @return {Array}         resulting array
+   */
+  function _1dFft(arr, dim) {
+    const size = (0, _array.arraySize)(arr);
+    if (dim !== 0) return new Array(size[0]).fill(0).map((_, i) => _1dFft(arr[i], dim - 1));
+    if (size.length === 1) return _fft(arr);
+    function _transpose(arr) {
+      // Swap first 2 dimensions
+      const size = (0, _array.arraySize)(arr);
+      return new Array(size[1]).fill(0).map((_, j) => new Array(size[0]).fill(0).map((_, i) => arr[i][j]));
+    }
+    return _transpose(_1dFft(_transpose(arr), 1));
+  }
+  /**
+   * Perform an 1-dimensional non-power-of-2 Fourier transform using Chirp-Z Transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _czt(arr) {
+    const n = arr.length;
+    const w = exp(divideScalar(multiplyScalar(-1, multiplyScalar(I, tau)), n));
+    const chirp = [];
+    for (let i = 1 - n; i < n; i++) {
+      chirp.push(pow(w, divideScalar(pow(i, 2), 2)));
+    }
+    const N2 = pow(2, ceil(log2(n + n - 1)));
+    const xp = [...new Array(n).fill(0).map((_, i) => multiplyScalar(arr[i], chirp[n - 1 + i])), ...new Array(N2 - n).fill(0)];
+    const ichirp = [...new Array(n + n - 1).fill(0).map((_, i) => divideScalar(1, chirp[i])), ...new Array(N2 - (n + n - 1)).fill(0)];
+    const fftXp = _fft(xp);
+    const fftIchirp = _fft(ichirp);
+    const fftProduct = new Array(N2).fill(0).map((_, i) => multiplyScalar(fftXp[i], fftIchirp[i]));
+    const ifftProduct = dotDivide(conj(_ndFft(conj(fftProduct))), N2);
+    const ret = [];
+    for (let i = n - 1; i < n + n - 1; i++) {
+      ret.push(multiplyScalar(ifftProduct[i], chirp[i]));
+    }
+    return ret;
+  }
+  /**
+   * Perform an 1-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _fft(arr) {
+    const len = arr.length;
+    if (len === 1) return [arr[0]];
+    if (len % 2 === 0) {
+      const ret = [..._fft(arr.filter((_, i) => i % 2 === 0), len / 2), ..._fft(arr.filter((_, i) => i % 2 === 1), len / 2)];
+      for (let k = 0; k < len / 2; k++) {
+        const p = ret[k];
+        const q = multiplyScalar(ret[k + len / 2], exp(multiplyScalar(multiplyScalar(tau, I), divideScalar(-k, len))));
+        ret[k] = addScalar(p, q);
+        ret[k + len / 2] = addScalar(p, multiplyScalar(-1, q));
+      }
+      return ret;
+    } else {
+      // use chirp-z transform for non-power-of-2 FFT
+      return _czt(arr);
+    }
+    // throw new Error('Can only calculate FFT of power-of-two size')
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/filter.js b/node_modules/mathjs/lib/cjs/function/matrix/filter.js
new file mode 100644
index 0000000..4c2c9bf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/filter.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFilter = void 0;
+var _optimizeCallback = require("../../utils/optimizeCallback.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'filter';
+const dependencies = ['typed'];
+const createFilter = exports.createFilter = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   *
+   * The callback is invoked with three arguments: the current value,
+   * the current index, and the matrix operated upon.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.filter(x, test)
+   *
+   * Examples:
+   *
+   *    function isPositive (x) {
+   *      return x > 0
+   *    }
+   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
+   *
+   *    math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
+   *
+   * See also:
+   *
+   *    forEach, map, sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to filter
+   * @param {Function | RegExp} test
+   *        A function or regular expression to test items.
+   *        All entries for which `test` returns true are returned.
+   *        When `test` is a function, it is invoked with three parameters:
+   *        the value of the element, the index of the element, and the
+   *        matrix/array being traversed. The function must return a boolean.
+   * @return {Matrix | Array} Returns the filtered matrix.
+   */
+  return typed('filter', {
+    'Array, function': _filterCallback,
+    'Matrix, function': function (x, test) {
+      return x.create(_filterCallback(x.valueOf(), test), x.datatype());
+    },
+    'Array, RegExp': _array.filterRegExp,
+    'Matrix, RegExp': function (x, test) {
+      return x.create((0, _array.filterRegExp)(x.valueOf(), test), x.datatype());
+    }
+  });
+});
+
+/**
+ * Filter values in a callback given a callback function
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+function _filterCallback(x, callback) {
+  const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, x, 'filter');
+  if (fastCallback.isUnary) {
+    return (0, _array.filter)(x, fastCallback.fn);
+  }
+  return (0, _array.filter)(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    return fastCallback.fn(value, [index], array);
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/flatten.js b/node_modules/mathjs/lib/cjs/function/matrix/flatten.js
new file mode 100644
index 0000000..dc449cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/flatten.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFlatten = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'flatten';
+const dependencies = ['typed'];
+const createFlatten = exports.createFlatten = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Flatten a multidimensional matrix into a single dimensional matrix.
+   * A new matrix is returned, the original matrix is left untouched.
+   *
+   * Syntax:
+   *
+   *    math.flatten(x)
+   *
+   * Examples:
+   *
+   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]
+   *
+   * See also:
+   *
+   *    concat, resize, size, squeeze
+   *
+   * @param {Matrix | Array} x   Matrix to be flattened
+   * @return {Matrix | Array} Returns the flattened matrix
+   */
+  return typed(name, {
+    Array: function (x) {
+      return (0, _array.flatten)(x);
+    },
+    Matrix: function (x) {
+      // Return the same matrix type as x (Dense or Sparse Matrix)
+      // Return the same data type as x
+      return x.create((0, _array.flatten)(x.valueOf(), true), x.datatype());
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/forEach.js b/node_modules/mathjs/lib/cjs/function/matrix/forEach.js
new file mode 100644
index 0000000..9ddc042
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/forEach.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createForEach = void 0;
+var _optimizeCallback = require("../../utils/optimizeCallback.js");
+var _factory = require("../../utils/factory.js");
+var _array = require("../../utils/array.js");
+const name = 'forEach';
+const dependencies = ['typed'];
+const createForEach = exports.createForEach = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given callback function.
+   *
+   * The callback is invoked with three arguments: the current value,
+   * the current index, and the matrix operated upon.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.forEach(x, callback)
+   *
+   * Examples:
+   *
+   *    math.forEach([1, 2, 3], function(value) {
+   *      console.log(value)
+   *    })
+   *    // outputs 1, 2, 3
+   *
+   * See also:
+   *
+   *    filter, map, sort
+   *
+   * @param {Matrix | Array} x    The matrix to iterate on.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix/array being traversed.
+   */
+  return typed(name, {
+    'Array, function': _forEach,
+    'Matrix, function': function (x, callback) {
+      x.forEach(callback);
+    }
+  });
+});
+
+/**
+ * forEach for a multidimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @private
+ */
+function _forEach(array, callback) {
+  const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, array, name);
+  (0, _array.deepForEach)(array, fastCallback.fn, fastCallback.isUnary);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..0c14716
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGetMatrixDataType = void 0;
+var _factory = require("../../utils/factory.js");
+var _array = require("../../utils/array.js");
+var _is = require("../../utils/is.js");
+const name = 'getMatrixDataType';
+const dependencies = ['typed'];
+const createGetMatrixDataType = exports.createGetMatrixDataType = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Find the data type of all elements in a matrix or array,
+   * for example 'number' if all items are a number and 'Complex' if all values
+   * are complex numbers.
+   * If a matrix contains more than one data type, it will return 'mixed'.
+   *
+   * Syntax:
+   *
+   *    math.getMatrixDataType(x)
+   *
+   * Examples:
+   *
+   *    const x = [ [1, 2, 3], [4, 5, 6] ]
+   *    const mixedX = [ [1, true], [2, 3] ]
+   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3)] ]
+   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
+   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
+   *    const sparse = math.sparse(x)
+   *    const dense = math.matrix(x)
+   *    math.getMatrixDataType(x)   // returns 'number'
+   *    math.getMatrixDataType(sparse)   // returns 'number'
+   *    math.getMatrixDataType(dense)   // returns 'number'
+   *    math.getMatrixDataType(mixedX) // returns 'mixed'
+   *    math.getMatrixDataType(fractionX) // returns 'Fraction'
+   *    math.getMatrixDataType(unitX) // returns 'Unit'
+   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'
+   *
+   * See also:
+   *  SparseMatrix, DenseMatrix
+   *
+   * @param {...Matrix | Array} x   The Matrix with values.
+   *
+   * @return {string} A string representation of the matrix type
+   */
+  return typed(name, {
+    Array: function (x) {
+      return (0, _array.getArrayDataType)(x, _is.typeOf);
+    },
+    Matrix: function (x) {
+      return x.getDataType();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/identity.js b/node_modules/mathjs/lib/cjs/function/matrix/identity.js
new file mode 100644
index 0000000..c0f3d71
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/identity.js
@@ -0,0 +1,142 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIdentity = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'identity';
+const dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];
+const createIdentity = exports.createIdentity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    BigNumber,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n.
+   * The matrix has ones on the diagonal and zeros elsewhere.
+   *
+   * Syntax:
+   *
+   *    math.identity(n)
+   *    math.identity(n, format)
+   *    math.identity(m, n)
+   *    math.identity(m, n, format)
+   *    math.identity([m, n])
+   *    math.identity([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]
+   *
+   * See also:
+   *
+   *    diag, ones, zeros, size, range
+   *
+   * @param {...number | Matrix | Array} size   The size for the matrix
+   * @param {string} [format]                   The Matrix storage format
+   *
+   * @return {Matrix | Array | number} A matrix with ones on the diagonal.
+   */
+  return typed(name, {
+    '': function () {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function (format) {
+      return matrix(format);
+    },
+    'number | BigNumber': function (rows) {
+      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, string': function (rows, format) {
+      return _identity(rows, rows, format);
+    },
+    'number | BigNumber, number | BigNumber': function (rows, cols) {
+      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, number | BigNumber, string': function (rows, cols, format) {
+      return _identity(rows, cols, format);
+    },
+    Array: function (size) {
+      return _identityVector(size);
+    },
+    'Array, string': function (size, format) {
+      return _identityVector(size, format);
+    },
+    Matrix: function (size) {
+      return _identityVector(size.valueOf(), size.storage());
+    },
+    'Matrix, string': function (size, format) {
+      return _identityVector(size.valueOf(), format);
+    }
+  });
+  function _identityVector(size, format) {
+    switch (size.length) {
+      case 0:
+        return format ? matrix(format) : [];
+      case 1:
+        return _identity(size[0], size[0], format);
+      case 2:
+        return _identity(size[0], size[1], format);
+      default:
+        throw new Error('Vector containing two values expected');
+    }
+  }
+
+  /**
+   * Create an identity matrix
+   * @param {number | BigNumber} rows
+   * @param {number | BigNumber} cols
+   * @param {string} [format]
+   * @returns {Matrix}
+   * @private
+   */
+  function _identity(rows, cols, format) {
+    // BigNumber constructor with the right precision
+    const Big = (0, _is.isBigNumber)(rows) || (0, _is.isBigNumber)(cols) ? BigNumber : null;
+    if ((0, _is.isBigNumber)(rows)) rows = rows.toNumber();
+    if ((0, _is.isBigNumber)(cols)) cols = cols.toNumber();
+    if (!(0, _number.isInteger)(rows) || rows < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+    if (!(0, _number.isInteger)(cols) || cols < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+    const one = Big ? new BigNumber(1) : 1;
+    const defaultValue = Big ? new Big(0) : 0;
+    const size = [rows, cols];
+
+    // check we need to return a matrix
+    if (format) {
+      // create diagonal matrix (use optimized implementation for storage format)
+      if (format === 'sparse') {
+        return SparseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+      if (format === 'dense') {
+        return DenseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+      throw new TypeError(`Unknown matrix type "${format}"`);
+    }
+
+    // create and resize array
+    const res = (0, _array.resize)([], size, defaultValue);
+    // fill in ones on the diagonal
+    const minimum = rows < cols ? rows : cols;
+    // fill diagonal
+    for (let d = 0; d < minimum; d++) {
+      res[d][d] = one;
+    }
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/ifft.js b/node_modules/mathjs/lib/cjs/function/matrix/ifft.js
new file mode 100644
index 0000000..22bc6e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/ifft.js
@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIfft = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'ifft';
+const dependencies = ['typed', 'fft', 'dotDivide', 'conj'];
+const createIfft = exports.createIfft = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    fft,
+    dotDivide,
+    conj
+  } = _ref;
+  /**
+   * Calculate N-dimensional inverse Fourier transform
+   *
+   * Syntax:
+   *
+   *     math.ifft(arr)
+   *
+   * Examples:
+   *
+   *    math.ifft([[2, 2], [0, 0]]) // returns [[{re:1, im:0}, {re:0, im:0}], [{re:1, im:0}, {re:0, im:0}]]
+   *
+   * See Also:
+   *
+   *      fft
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  return typed(name, {
+    'Array | Matrix': function (arr) {
+      const size = (0, _is.isMatrix)(arr) ? arr.size() : (0, _array.arraySize)(arr);
+      return dotDivide(conj(fft(conj(arr))), size.reduce((acc, curr) => acc * curr, 1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/inv.js b/node_modules/mathjs/lib/cjs/function/matrix/inv.js
new file mode 100644
index 0000000..58947fc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/inv.js
@@ -0,0 +1,190 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createInv = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _string = require("../../utils/string.js");
+const name = 'inv';
+const dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
+const createInv = exports.createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divideScalar,
+    addScalar,
+    multiply,
+    unaryMinus,
+    det,
+    identity,
+    abs
+  } = _ref;
+  /**
+   * Calculate the inverse of a square matrix.
+   *
+   * Syntax:
+   *
+   *     math.inv(x)
+   *
+   * Examples:
+   *
+   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]
+   *     math.inv(4)                 // returns 0.25
+   *     1 / 4                       // returns 0.25
+   *
+   * See also:
+   *
+   *     det, transpose
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function (x) {
+      const size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);
+      switch (size.length) {
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            if ((0, _is.isMatrix)(x)) {
+              return matrix([divideScalar(1, x.valueOf()[0])]);
+            } else {
+              return [divideScalar(1, x[0])];
+            }
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+        case 2:
+          // two dimensional array
+          {
+            const rows = size[0];
+            const cols = size[1];
+            if (rows === cols) {
+              if ((0, _is.isMatrix)(x)) {
+                return matrix(_inv(x.valueOf(), rows, cols), x.storage());
+              } else {
+                // return an Array
+                return _inv(x, rows, cols);
+              }
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    },
+    any: function (x) {
+      // scalar
+      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
+    }
+  });
+
+  /**
+   * Calculate the inverse of a square matrix
+   * @param {Array[]} mat     A square matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns, must equal rows
+   * @return {Array[]} inv    Inverse matrix
+   * @private
+   */
+  function _inv(mat, rows, cols) {
+    let r, s, f, value, temp;
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      value = mat[0][0];
+      if (value === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+      return [[divideScalar(1, value)]];
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      const d = det(mat);
+      if (d === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
+    } else {
+      // this is a matrix of 3 x 3 or larger
+      // calculate inverse using gauss-jordan elimination
+      //      https://en.wikipedia.org/wiki/Gaussian_elimination
+      //      http://mathworld.wolfram.com/MatrixInverse.html
+      //      http://math.uww.edu/~mcfarlat/inverse.htm
+
+      // make a copy of the matrix (only the arrays, not of the elements)
+      const A = mat.concat();
+      for (r = 0; r < rows; r++) {
+        A[r] = A[r].concat();
+      }
+
+      // create an identity matrix which in the end will contain the
+      // matrix inverse
+      const B = identity(rows).valueOf();
+
+      // loop over all columns, and perform row reductions
+      for (let c = 0; c < cols; c++) {
+        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
+        let ABig = abs(A[c][c]);
+        let rBig = c;
+        r = c + 1;
+        while (r < rows) {
+          if (abs(A[r][c]) > ABig) {
+            ABig = abs(A[r][c]);
+            rBig = r;
+          }
+          r++;
+        }
+        if (ABig === 0) {
+          throw Error('Cannot calculate inverse, determinant is zero');
+        }
+        r = rBig;
+        if (r !== c) {
+          temp = A[c];
+          A[c] = A[r];
+          A[r] = temp;
+          temp = B[c];
+          B[c] = B[r];
+          B[r] = temp;
+        }
+
+        // eliminate non-zero values on the other rows at column c
+        const Ac = A[c];
+        const Bc = B[c];
+        for (r = 0; r < rows; r++) {
+          const Ar = A[r];
+          const Br = B[r];
+          if (r !== c) {
+            // eliminate value at column c and row r
+            if (Ar[c] !== 0) {
+              f = divideScalar(unaryMinus(Ar[c]), Ac[c]);
+
+              // add (f * row c) to row r to eliminate the value
+              // at column c
+              for (s = c; s < cols; s++) {
+                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
+              }
+              for (s = 0; s < cols; s++) {
+                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
+              }
+            }
+          } else {
+            // normalize value at Acc to 1,
+            // divide each value on row r with the value at Acc
+            f = Ac[c];
+            for (s = c; s < cols; s++) {
+              Ar[s] = divideScalar(Ar[s], f);
+            }
+            for (s = 0; s < cols; s++) {
+              Br[s] = divideScalar(Br[s], f);
+            }
+          }
+        }
+      }
+      return B;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/kron.js b/node_modules/mathjs/lib/cjs/function/matrix/kron.js
new file mode 100644
index 0000000..bb3f845
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/kron.js
@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createKron = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'kron';
+const dependencies = ['typed', 'matrix', 'multiplyScalar'];
+const createKron = exports.createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    multiplyScalar
+  } = _ref;
+  /**
+     * Calculates the Kronecker product of 2 matrices or vectors.
+     *
+     * NOTE: If a one dimensional vector / matrix is given, it will be
+     * wrapped so its two dimensions.
+     * See the examples.
+     *
+     * Syntax:
+     *
+     *    math.kron(x, y)
+     *
+     * Examples:
+     *
+     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
+     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
+     *
+     *    math.kron([1,1], [2,3,4])
+     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]
+     *
+     * See also:
+     *
+     *    multiply, dot, cross
+     *
+     * @param  {Array | Matrix} x     First vector
+     * @param  {Array | Matrix} y     Second vector
+     * @return {Array | Matrix}       Returns the Kronecker product of `x` and `y`
+     */
+  return typed(name, {
+    'Matrix, Matrix': function (x, y) {
+      return matrix(_kron(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function (x, y) {
+      return matrix(_kron(x.toArray(), y));
+    },
+    'Array, Matrix': function (x, y) {
+      return matrix(_kron(x, y.toArray()));
+    },
+    'Array, Array': _kron
+  });
+
+  /**
+     * Calculate the Kronecker product of two matrices / vectors
+     * @param {Array} a  First vector
+     * @param {Array} b  Second vector
+     * @returns {Array} Returns the Kronecker product of x and y
+     * @private
+     */
+  function _kron(a, b) {
+    // Deal with the dimensions of the matricies.
+    if ((0, _array.arraySize)(a).length === 1) {
+      // Wrap it in a 2D Matrix
+      a = [a];
+    }
+    if ((0, _array.arraySize)(b).length === 1) {
+      // Wrap it in a 2D Matrix
+      b = [b];
+    }
+    if ((0, _array.arraySize)(a).length > 2 || (0, _array.arraySize)(b).length > 2) {
+      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
+    }
+    const t = [];
+    let r = [];
+    return a.map(function (a) {
+      return b.map(function (b) {
+        r = [];
+        t.push(r);
+        return a.map(function (y) {
+          return b.map(function (x) {
+            return r.push(multiplyScalar(y, x));
+          });
+        });
+      });
+    }) && t;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/map.js b/node_modules/mathjs/lib/cjs/function/matrix/map.js
new file mode 100644
index 0000000..c309625
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/map.js
@@ -0,0 +1,226 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMap = void 0;
+var _optimizeCallback = require("../../utils/optimizeCallback.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'map';
+const dependencies = ['typed'];
+const createMap = exports.createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Create a new matrix or array with the results of a callback function executed on
+   * each entry of a given matrix/array.
+   *
+   * For each entry of the input,
+   *
+   * the callback is invoked with 2N + 1 arguments:
+   * the N values of the entry, the index at which that entry occurs, and the N full
+   * broadcasted matrix/array being traversed where N is the number of matrices being traversed.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.map(x, callback)
+   *    math.map(x, y, ..., callback)
+   *
+   * Examples:
+   *
+   *    math.map([1, 2, 3], function(value) {
+   *      return value * value
+   *    })  // returns [1, 4, 9]
+   *    math.map([1, 2], [3, 4], function(a, b) {
+   *     return a + b
+   *    })  // returns [4, 6]
+   *
+   *    // The callback is normally called with three arguments:
+   *    //    callback(value, index, Array)
+   *    // If you want to call with only one argument, use:
+   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']
+   *    // It can also be called with 2N + 1 arguments: for N arrays
+   *    //    callback(value1, value2, index, BroadcastedArray1, BroadcastedArray2)
+   *
+   * See also:
+   *
+   *    filter, forEach, sort
+   *
+   * @param {Matrix | Array} x    The input to iterate on.
+   * @param {Function} callback
+   *     The function to call (as described above) on each entry of the input
+   * @return {Matrix | array}
+   *     Transformed map of x; always has the same type and shape as x
+   */
+  return typed(name, {
+    'Array, function': _mapArray,
+    'Matrix, function': function (x, callback) {
+      return x.map(callback);
+    },
+    'Array|Matrix, Array|Matrix, ...Array|Matrix|function': (A, B, rest) => _mapMultiple([A, B, ...rest.slice(0, rest.length - 1)], rest[rest.length - 1])
+  });
+
+  /**
+  * Maps over multiple arrays or matrices.
+  *
+  * @param {Array<Array|Matrix>} Arrays - An array of arrays or matrices to map over.
+  * @param {function} multiCallback - The callback function to apply to each element.
+  * @throws {Error} If the last argument is not a callback function.
+  * @returns {Array|Matrix} A new array or matrix with each element being the result of the callback function.
+  *
+  * @example
+  * _mapMultiple([[1, 2, 3], [4, 5, 6]], (a, b) => a + b); // Returns [5, 7, 9]
+  */
+  function _mapMultiple(Arrays, multiCallback) {
+    if (typeof multiCallback !== 'function') {
+      throw new Error('Last argument must be a callback function');
+    }
+    const firstArrayIsMatrix = Arrays[0].isMatrix;
+    const sizes = Arrays.map(M => M.isMatrix ? M.size() : (0, _array.arraySize)(M));
+    const newSize = (0, _array.broadcastSizes)(...sizes);
+    const numberOfArrays = Arrays.length;
+    const _get = firstArrayIsMatrix ? (matrix, idx) => matrix.get(idx) : _array.get;
+    const firstValues = Arrays.map((collection, i) => {
+      const firstIndex = sizes[i].map(() => 0);
+      return collection.isMatrix ? collection.get(firstIndex) : (0, _array.get)(collection, firstIndex);
+    });
+    const callbackArgCount = typed.isTypedFunction(multiCallback) ? _getTypedCallbackArgCount(multiCallback, firstValues, newSize.map(() => 0), Arrays) : _getCallbackArgCount(multiCallback, numberOfArrays);
+    if (callbackArgCount < 2) {
+      const callback = _getLimitedCallback(callbackArgCount, multiCallback, null);
+      return mapMultiple(Arrays, callback);
+    }
+    const broadcastedArrays = firstArrayIsMatrix ? Arrays.map(M => M.isMatrix ? M.create((0, _array.broadcastTo)(M.toArray(), newSize), M.datatype()) : Arrays[0].create((0, _array.broadcastTo)(M.valueOf(), newSize))) : Arrays.map(M => M.isMatrix ? (0, _array.broadcastTo)(M.toArray(), newSize) : (0, _array.broadcastTo)(M, newSize));
+    const callback = _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays);
+    const broadcastedArraysCallback = (x, idx) => callback([x, ...broadcastedArrays.slice(1).map(array => _get(array, idx))], idx);
+    if (firstArrayIsMatrix) {
+      return broadcastedArrays[0].map(broadcastedArraysCallback);
+    } else {
+      return _mapArray(broadcastedArrays[0], broadcastedArraysCallback);
+    }
+  }
+  function mapMultiple(collections, callback) {
+    // collections can be matrices or arrays
+    // callback must be a function of the form (collections, [index])
+    const firstCollection = collections[0];
+    const arrays = collections.map(collection => collection.isMatrix ? collection.valueOf() : collection);
+    const sizes = collections.map(collection => collection.isMatrix ? collection.size() : (0, _array.arraySize)(collection));
+    const finalSize = (0, _array.broadcastSizes)(...sizes);
+    // the offset means for each initial array, how much smaller is it than the final size
+    const offsets = sizes.map(size => finalSize.length - size.length);
+    const maxDepth = finalSize.length - 1;
+    const callbackUsesIndex = callback.length > 1;
+    const index = callbackUsesIndex ? [] : null;
+    const resultsArray = iterate(arrays, 0);
+    if (firstCollection.isMatrix) {
+      const resultsMatrix = firstCollection.create();
+      resultsMatrix._data = resultsArray;
+      resultsMatrix._size = finalSize;
+      return resultsMatrix;
+    } else {
+      return resultsArray;
+    }
+    function iterate(arrays) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      // each array can have different sizes
+      const currentDimensionSize = finalSize[depth];
+      const result = Array(currentDimensionSize);
+      if (depth < maxDepth) {
+        for (let i = 0; i < currentDimensionSize; i++) {
+          if (index) index[depth] = i;
+          // if there is an offset greater than the current dimension
+          // pass the array, if the size of the array is 1 pass the first
+          // element of the array
+          result[i] = iterate(arrays.map((array, arrayIndex) => offsets[arrayIndex] > depth ? array : array.length === 1 ? array[0] : array[i]), depth + 1);
+        }
+      } else {
+        for (let i = 0; i < currentDimensionSize; i++) {
+          if (index) index[depth] = i;
+          result[i] = callback(arrays.map(a => a.length === 1 ? a[0] : a[i]), index ? index.slice() : undefined);
+        }
+      }
+      return result;
+    }
+  }
+
+  /**
+    * Creates a limited callback based on the argument pattern.
+    * @param {number} callbackArgCount - The argument pattern (0, 1, or 2)
+    * @param {Function} multiCallback - The original callback function
+    * @param {Array} broadcastedArrays - The broadcasted arrays (for case 2)
+    * @returns {Function} The limited callback function
+    */
+  function _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays) {
+    switch (callbackArgCount) {
+      case 0:
+        return x => multiCallback(...x);
+      case 1:
+        return (x, idx) => multiCallback(...x, idx);
+      case 2:
+        return (x, idx) => multiCallback(...x, idx, ...broadcastedArrays);
+    }
+  }
+
+  /**
+     * Determines the argument pattern of a regular callback function.
+     * @param {Function} callback - The callback function to analyze
+     * @param {number} numberOfArrays - Number of arrays being processed
+     * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays
+     */
+  function _getCallbackArgCount(callback, numberOfArrays) {
+    const callbackStr = callback.toString();
+    // Check if the callback function uses `arguments`
+    if (/arguments/.test(callbackStr)) return 2;
+
+    // Extract the parameters of the callback function
+    const paramsStr = callbackStr.match(/\(.*?\)/);
+    // Check if the callback function uses rest parameters
+    if (/\.\.\./.test(paramsStr)) return 2;
+    if (callback.length > numberOfArrays + 1) {
+      return 2;
+    }
+    if (callback.length === numberOfArrays + 1) {
+      return 1;
+    }
+    return 0;
+  }
+
+  /**
+  * Determines the argument pattern of a typed callback function.
+  * @param {Function} callback - The typed callback function to analyze
+  * @param {Array} values - Sample values for signature resolution
+  * @param {Array} idx - Sample index for signature resolution
+  * @param {Array} arrays - Sample arrays for signature resolution
+  * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays
+  */
+
+  function _getTypedCallbackArgCount(callback, values, idx, arrays) {
+    if (typed.resolve(callback, [...values, idx, ...arrays]) !== null) {
+      return 2;
+    }
+    if (typed.resolve(callback, [...values, idx]) !== null) {
+      return 1;
+    }
+    if (typed.resolve(callback, values) !== null) {
+      return 0;
+    }
+    // this should never happen
+    return 0;
+  }
+  /**
+  * Map for a multi dimensional array
+  * @param {Array} array
+  * @param {Function} callback
+  * @return {Array}
+  * @private
+  */
+  function _mapArray(array, callback) {
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, array, name);
+    return (0, _array.deepMap)(array, fastCallback.fn, fastCallback.isUnary);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/mapSlices.js b/node_modules/mathjs/lib/cjs/function/matrix/mapSlices.js
new file mode 100644
index 0000000..bac5af6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/mapSlices.js
@@ -0,0 +1,124 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMapSlices = void 0;
+var _factory = require("../../utils/factory.js");
+var _array = require("../../utils/array.js");
+var _is = require("../../utils/is.js");
+var _IndexError = require("../../error/IndexError.js");
+const name = 'mapSlices';
+const dependencies = ['typed', 'isInteger'];
+const createMapSlices = exports.createMapSlices = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isInteger
+  } = _ref;
+  /**
+   * Apply a function that maps an array to a scalar
+   * along a given axis of a matrix or array.
+   * Returns a new matrix or array with one less dimension than the input.
+   *
+   * Syntax:
+   *
+   *     math.mapSlices(A, dim, callback)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [3, 4]]
+   *    const sum = math.sum
+   *
+   *    math.mapSlices(A, 0, sum)             // returns [4, 6]
+   *    math.mapSlices(A, 1, sum)             // returns [3, 7]
+   *
+   * See also:
+   *
+   *    map, filter, forEach
+   *
+   * Note:
+   *
+   *    `mapSlices()` is also currently available via its deprecated
+   *    synonym `apply()`.
+   *
+   * @param {Array | Matrix} array   The input Matrix
+   * @param {number} dim             The dimension along which the callback is applied
+   * @param {Function} callback      The callback function that is applied. This Function
+   *                                 should take an array or 1-d matrix as an input and
+   *                                 return a number.
+   * @return {Array | Matrix} res    The residual matrix with the function mapped on the slices over some dimension.
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber, function': function (mat, dim, callback) {
+      if (!isInteger(dim)) {
+        throw new TypeError('Integer number expected for dimension');
+      }
+      const size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();
+      if (dim < 0 || dim >= size.length) {
+        throw new _IndexError.IndexError(dim, size.length);
+      }
+      if ((0, _is.isMatrix)(mat)) {
+        return mat.create(_mapSlices(mat.valueOf(), dim, callback), mat.datatype());
+      } else {
+        return _mapSlices(mat, dim, callback);
+      }
+    }
+  });
+}, {
+  formerly: 'apply'
+});
+
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+function _mapSlices(mat, dim, callback) {
+  let i, ret, tran;
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      return callback(mat);
+    } else {
+      tran = _switch(mat);
+      ret = [];
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _mapSlices(tran[i], dim - 1, callback);
+      }
+      return ret;
+    }
+  } else {
+    ret = [];
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _mapSlices(mat[i], dim - 1, callback);
+    }
+    return ret;
+  }
+}
+
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+function _switch(mat) {
+  const I = mat.length;
+  const J = mat[0].length;
+  let i, j;
+  const ret = [];
+  for (j = 0; j < J; j++) {
+    const tmp = [];
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+    ret.push(tmp);
+  }
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..f0fad5d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,94 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromColumns = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'matrixFromColumns';
+const dependencies = ['typed', 'matrix', 'flatten', 'size'];
+const createMatrixFromColumns = exports.createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+  /**
+   * Create a dense matrix from vectors as individual columns.
+   * If you pass row vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromColumns(...arr)
+   *    math.matrixFromColumns(col1, col2)
+   *    math.matrixFromColumns(col1, col2, col3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromColumns(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromRows, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} cols Multiple columns
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function (arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function (arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    }
+
+    // TODO implement this properly for SparseMatrix
+  });
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');
+    const N = checkVectorTypeAndReturnLength(arr[0]);
+
+    // create an array with empty rows
+    const result = [];
+    for (let i = 0; i < N; i++) {
+      result[i] = [];
+    }
+
+    // loop columns
+    for (const col of arr) {
+      const colLength = checkVectorTypeAndReturnLength(col);
+      if (colLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));
+      }
+      const f = flatten(col);
+
+      // push a value to each row
+      for (let i = 0; i < N; i++) {
+        result[i].push(f[i]);
+      }
+    }
+    return result;
+  }
+  function checkVectorTypeAndReturnLength(vec) {
+    const s = size(vec);
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..7ed6d95
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,113 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromFunction = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'matrixFromFunction';
+const dependencies = ['typed', 'matrix', 'isZero'];
+const createMatrixFromFunction = exports.createMatrixFromFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    isZero
+  } = _ref;
+  /**
+   * Create a matrix by evaluating a generating function at each index.
+   * The simplest overload returns a multi-dimensional array as long as `size`
+   * is an array.
+   * Passing `size` as a Matrix or specifying a `format` will result in
+   * returning a Matrix.
+   *
+   * Syntax:
+   *
+   *    math.matrixFromFunction(size, fn)
+   *    math.matrixFromFunction(size, fn, format)
+   *    math.matrixFromFunction(size, fn, format, datatype)
+   *    math.matrixFromFunction(size, format, fn)
+   *    math.matrixFromFunction(size, format, datatype, fn)
+   *
+   * Where:
+   *
+   *    - `size: (number[] | Matrix)`
+   *      A vector giving the extent of the array to be created in each
+   *      dimension. If size has one entry, a vector is created; if it
+   *      has two, a rectangular array/Matrix is created; if three, a
+   *      three-dimensional array/Matrix is created; and so on.
+   *    - `fn: (index: number[]) => MathType`
+   *      The callback function that will generate the entries of the
+   *      matrix. It is called in turn with the index of each entry of
+   *      the matrix. The index is always an ordinary array of numbers
+   *      with the same length as _size_. So for vectors, you will get
+   *      indices like `[0]` or `[1]`, whereas for matrices, you will
+   *      get indices like `[2, 0]` or `[1,3]`. The return value may
+   *      be any type that can go in an array or Matrix entry, although
+   *      if you supply the _datatype_ argument, you must yourself ensure
+   *      the type of the return value matches. Note that currently,
+   *      your callback _fn_ will receive 0-based indices for the matrix
+   *      entries, regardless of whether matrixFromFunction is invoked
+   *      directly from JavaScript or via the mathjs expression language.
+   *    - `format: 'dense'|'sparse'`
+   *      Specifies the storage format for the resulting Matrix. Note that
+   *      if this argument is given, the return value will always be a
+   *      Matrix (rather than possibly an Array).
+   *    - `datatype: string`
+   *      Specifies the data type of entries of the new matrix. If given,
+   *      it should be the name of a data type that mathjs supports, as
+   *      returned by the math.typeOf function. It is up to the caller
+   *      to make certain that all values returned by _fn_ are consistent
+   *      with this datatype if specified.
+   *
+   * Examples:
+   *
+   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix
+   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix
+   *    math.matrixFromFunction([5], i => math.random()) // a random vector
+   *
+   * See also:
+   *
+   *    matrix, typeOf, zeros
+   *
+   * @param {Array | Matrix} size   The size of the matrix to be created
+   * @param {function} fn           Callback function invoked for every entry in the matrix
+   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]     Type of the values
+   * @return {Array | Matrix} Returns the created matrix
+   */
+  return typed(name, {
+    'Array | Matrix, function, string, string': function (size, fn, format, datatype) {
+      return _create(size, fn, format, datatype);
+    },
+    'Array | Matrix, function, string': function (size, fn, format) {
+      return _create(size, fn, format);
+    },
+    'Matrix, function': function (size, fn) {
+      return _create(size, fn, 'dense');
+    },
+    'Array, function': function (size, fn) {
+      return _create(size, fn, 'dense').toArray();
+    },
+    'Array | Matrix, string, function': function (size, format, fn) {
+      return _create(size, fn, format);
+    },
+    'Array | Matrix, string, string, function': function (size, format, datatype, fn) {
+      return _create(size, fn, format, datatype);
+    }
+  });
+  function _create(size, fn, format, datatype) {
+    let m;
+    if (datatype !== undefined) {
+      m = matrix(format, datatype);
+    } else {
+      m = matrix(format);
+    }
+    m.resize(size);
+    m.forEach(function (_, index) {
+      const val = fn(index);
+      if (isZero(val)) return;
+      m.set(index, val);
+    });
+    return m;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..1b606ea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/matrixFromRows.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixFromRows = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'matrixFromRows';
+const dependencies = ['typed', 'matrix', 'flatten', 'size'];
+const createMatrixFromRows = exports.createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+  /**
+   * Create a dense matrix from vectors as individual rows.
+   * If you pass column vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromRows(...arr)
+   *    math.matrixFromRows(row1, row2)
+   *    math.matrixFromRows(row1, row2, row3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromRows(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromColumns, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} rows  Multiple rows
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function (arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function (arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    }
+
+    // TODO implement this properly for SparseMatrix
+  });
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');
+    const N = checkVectorTypeAndReturnLength(arr[0]);
+    const result = [];
+    for (const row of arr) {
+      const rowLength = checkVectorTypeAndReturnLength(row);
+      if (rowLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));
+      }
+      result.push(flatten(row));
+    }
+    return result;
+  }
+  function checkVectorTypeAndReturnLength(vec) {
+    const s = size(vec);
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/ones.js b/node_modules/mathjs/lib/cjs/function/matrix/ones.js
new file mode 100644
index 0000000..05298dd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/ones.js
@@ -0,0 +1,129 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOnes = void 0;
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'ones';
+const dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+const createOnes = exports.createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.ones(m)
+   *    math.ones(m, format)
+   *    math.ones(m, n)
+   *    math.ones(m, n, format)
+   *    math.ones([m, n])
+   *    math.ones([m, n], format)
+   *    math.ones([m, n, p, ...])
+   *    math.ones([m, n, p, ...], format)
+   *
+   * Examples:
+   *
+   *    math.ones()                    // returns []
+   *    math.ones(3)                   // returns [1, 1, 1]
+   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
+   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]
+   *
+   * See also:
+   *
+   *    zeros, identity, size, range
+   *
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix | number}  A matrix filled with ones
+   */
+  return typed('ones', {
+    '': function () {
+      return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');
+    },
+    // math.ones(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function (size) {
+      const last = size[size.length - 1];
+      if (typeof last === 'string') {
+        const format = size.pop();
+        return _ones(size, format);
+      } else if (config.matrix === 'Array') {
+        return _ones(size);
+      } else {
+        return _ones(size, 'default');
+      }
+    },
+    Array: _ones,
+    Matrix: function (size) {
+      const format = size.storage();
+      return _ones(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function (size, format) {
+      return _ones(size.valueOf(), format);
+    }
+  });
+
+  /**
+   * Create an Array or Matrix with ones
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+  function _ones(size, format) {
+    const hasBigNumbers = _normalize(size);
+    const defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
+    _validate(size);
+    if (format) {
+      // return a matrix
+      const m = matrix(format);
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+      return m;
+    } else {
+      // return an Array
+      const arr = [];
+      if (size.length > 0) {
+        return (0, _array.resize)(arr, size, defaultValue);
+      }
+      return arr;
+    }
+  }
+
+  // replace BigNumbers with numbers, returns true if size contained BigNumbers
+  function _normalize(size) {
+    let hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if ((0, _is.isBigNumber)(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  }
+
+  // validate arguments
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {
+        throw new Error('Parameters in function ones must be positive integers');
+      }
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..fddc52b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/partitionSelect.js
@@ -0,0 +1,149 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPartitionSelect = void 0;
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'partitionSelect';
+const dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
+const createPartitionSelect = exports.createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isNumeric,
+    isNaN: mathIsNaN,
+    compare
+  } = _ref;
+  const asc = compare;
+  const desc = (a, b) => -compare(a, b);
+
+  /**
+   * Partition-based selection of an array or 1D matrix.
+   * Will find the kth smallest value, and mutates the input array.
+   * Uses Quickselect.
+   *
+   * Syntax:
+   *
+   *    math.partitionSelect(x, k)
+   *    math.partitionSelect(x, k, compare)
+   *
+   * Examples:
+   *
+   *    math.partitionSelect([5, 10, 1], 2)                               // returns 10
+   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1, math.compareText)   // returns 'B'
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
+   *
+   *    // the input array is mutated
+   *    arr = [5, 2, 1]
+   *    math.partitionSelect(arr, 0) // returns 1, arr is now: [1, 2, 5]
+   *    math.partitionSelect(arr, 1, 'desc') // returns 2, arr is now: [5, 2, 1]
+   *
+   * See also:
+   *
+   *    sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Number} k            The kth smallest value to be retrieved zero-based index
+   * @param {Function | 'asc' | 'desc'} [compare='asc']
+   *        An optional comparator function. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {*} Returns the kth lowest value.
+   */
+  return typed(name, {
+    'Array | Matrix, number': function (x, k) {
+      return _partitionSelect(x, k, asc);
+    },
+    'Array | Matrix, number, string': function (x, k, compare) {
+      if (compare === 'asc') {
+        return _partitionSelect(x, k, asc);
+      } else if (compare === 'desc') {
+        return _partitionSelect(x, k, desc);
+      } else {
+        throw new Error('Compare string must be "asc" or "desc"');
+      }
+    },
+    'Array | Matrix, number, function': _partitionSelect
+  });
+  function _partitionSelect(x, k, compare) {
+    if (!(0, _number.isInteger)(k) || k < 0) {
+      throw new Error('k must be a non-negative integer');
+    }
+    if ((0, _is.isMatrix)(x)) {
+      const size = x.size();
+      if (size.length > 1) {
+        throw new Error('Only one dimensional matrices supported');
+      }
+      return quickSelect(x.valueOf(), k, compare);
+    }
+    if (Array.isArray(x)) {
+      return quickSelect(x, k, compare);
+    }
+  }
+
+  /**
+   * Quickselect algorithm.
+   * Code adapted from:
+   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html
+   *
+   * @param {Array} arr
+   * @param {Number} k
+   * @param {Function} compare
+   * @private
+   */
+  function quickSelect(arr, k, compare) {
+    if (k >= arr.length) {
+      throw new Error('k out of bounds');
+    }
+
+    // check for NaN values since these can cause an infinite while loop
+    for (let i = 0; i < arr.length; i++) {
+      if (isNumeric(arr[i]) && mathIsNaN(arr[i])) {
+        return arr[i]; // return NaN
+      }
+    }
+    let from = 0;
+    let to = arr.length - 1;
+
+    // if from == to we reached the kth element
+    while (from < to) {
+      let r = from;
+      let w = to;
+      const pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from];
+
+      // stop if the reader and writer meets
+      while (r < w) {
+        // arr[r] >= pivot
+        if (compare(arr[r], pivot) >= 0) {
+          // put the large values at the end
+          const tmp = arr[w];
+          arr[w] = arr[r];
+          arr[r] = tmp;
+          --w;
+        } else {
+          // the value is smaller than the pivot, skip
+          ++r;
+        }
+      }
+
+      // if we stepped up (r++) we need to step one down (arr[r] > pivot)
+      if (compare(arr[r], pivot) > 0) {
+        --r;
+      }
+
+      // the r pointer is on the end of the first k elements
+      if (k <= r) {
+        to = r;
+      } else {
+        from = r + 1;
+      }
+    }
+    return arr[k];
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/pinv.js b/node_modules/mathjs/lib/cjs/function/matrix/pinv.js
new file mode 100644
index 0000000..6b03499
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/pinv.js
@@ -0,0 +1,185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPinv = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+const name = 'pinv';
+const dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];
+const createPinv = exports.createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    inv,
+    deepEqual,
+    equal,
+    dotDivide,
+    dot,
+    ctranspose,
+    divideScalar,
+    multiply,
+    add,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix.
+   *
+   * Syntax:
+   *
+   *     math.pinv(x)
+   *
+   * Examples:
+   *
+   *     math.pinv([[1, 2], [3, 4]])          // returns [[-2, 1], [1.5, -0.5]]
+   *     math.pinv([[1, 0], [0, 1], [0, 1]])  // returns [[1, 0, 0], [0, 0.5, 0.5]]
+   *     math.pinv(4)                         // returns 0.25
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function (x) {
+      const size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);
+      switch (size.length) {
+        case 1:
+          // vector
+          if (_isZeros(x)) return ctranspose(x); // null vector
+          if (size[0] === 1) {
+            return inv(x); // invertible matrix
+          } else {
+            return dotDivide(ctranspose(x), dot(x, x));
+          }
+        case 2:
+          // two dimensional array
+          {
+            if (_isZeros(x)) return ctranspose(x); // zero matrixx
+            const rows = size[0];
+            const cols = size[1];
+            if (rows === cols) {
+              try {
+                return inv(x); // invertible matrix
+              } catch (err) {
+                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {
+                  // Expected
+                } else {
+                  throw err;
+                }
+              }
+            }
+            if ((0, _is.isMatrix)(x)) {
+              return matrix(_pinv(x.valueOf(), rows, cols), x.storage());
+            } else {
+              // return an Array
+              return _pinv(x, rows, cols);
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    },
+    any: function (x) {
+      // scalar
+      if (equal(x, 0)) return (0, _object.clone)(x); // zero
+      return divideScalar(1, x);
+    }
+  });
+
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]} pinv    Pseudoinverse matrix
+   * @private
+   */
+  function _pinv(mat, rows, cols) {
+    const {
+      C,
+      F
+    } = _rankFact(mat, rows, cols); // TODO: Use SVD instead (may improve precision)
+    const Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C));
+    const Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))));
+    return multiply(Fpinv, Cpinv);
+  }
+
+  /**
+   * Calculate the reduced row echelon form of a matrix
+   *
+   * Modified from https://rosettacode.org/wiki/Reduced_row_echelon_form
+   *
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]}        Reduced row echelon form
+   * @private
+   */
+  function _rref(mat, rows, cols) {
+    const M = (0, _object.clone)(mat);
+    let lead = 0;
+    for (let r = 0; r < rows; r++) {
+      if (cols <= lead) {
+        return M;
+      }
+      let i = r;
+      while (_isZero(M[i][lead])) {
+        i++;
+        if (rows === i) {
+          i = r;
+          lead++;
+          if (cols === lead) {
+            return M;
+          }
+        }
+      }
+      [M[i], M[r]] = [M[r], M[i]];
+      let val = M[r][lead];
+      for (let j = 0; j < cols; j++) {
+        M[r][j] = dotDivide(M[r][j], val);
+      }
+      for (let i = 0; i < rows; i++) {
+        if (i === r) continue;
+        val = M[i][lead];
+        for (let j = 0; j < cols; j++) {
+          M[i][j] = add(M[i][j], multiply(-1, multiply(val, M[r][j])));
+        }
+      }
+      lead++;
+    }
+    return M;
+  }
+
+  /**
+   * Calculate the rank factorization of a matrix
+   *
+   * @param {Array[]} mat                  A matrix (M)
+   * @param {number} rows                  Number of rows
+   * @param {number} cols                  Number of columns
+   * @return {{C: Array, F: Array}}        rank factorization where M = C F
+   * @private
+   */
+  function _rankFact(mat, rows, cols) {
+    const rref = _rref(mat, rows, cols);
+    const C = mat.map((_, i) => _.filter((_, j) => j < rows && !_isZero(dot(rref[j], rref[j]))));
+    const F = rref.filter((_, i) => !_isZero(dot(rref[i], rref[i])));
+    return {
+      C,
+      F
+    };
+  }
+  function _isZero(x) {
+    return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)));
+  }
+  function _isZeros(arr) {
+    return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/range.js b/node_modules/mathjs/lib/cjs/function/matrix/range.js
new file mode 100644
index 0000000..558fe15
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/range.js
@@ -0,0 +1,241 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRange = void 0;
+var _factory = require("../../utils/factory.js");
+var _noop = require("../../utils/noop.js");
+const name = 'range';
+const dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];
+const createRange = exports.createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  } = _ref;
+  /**
+   * Create a matrix or array containing a range of values.
+   * By default, the range end is excluded. This can be customized by providing
+   * an extra parameter `includeEnd`.
+   *
+   * Syntax:
+   *
+   *     math.range(str [, includeEnd])               // Create a range from a string,
+   *                                                  // where the string contains the
+   *                                                  // start, optional step, and end,
+   *                                                  // separated by a colon.
+   *     math.range(start, end [, includeEnd])        // Create a range with start and
+   *                                                  // end and a step size of 1.
+   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,
+   *                                                  // and end.
+   *
+   * Where:
+   *
+   * - `str: string`
+   *   A string 'start:end' or 'start:step:end'
+   * - `start: {number | bigint | BigNumber | Fraction | Unit}`
+   *   Start of the range
+   * - `end: number | bigint | BigNumber | Fraction | Unit`
+   *   End of the range, excluded by default, included when parameter includeEnd=true
+   * - `step: number | bigint | BigNumber | Fraction | Unit`
+   *   Step size. Default value is 1.
+   * - `includeEnd: boolean`
+   *   Option to specify whether to include the end or not. False by default.
+   *
+   * The function returns a `DenseMatrix` when the library is configured with
+   * `config = { matrix: 'Matrix' }, and returns an Array otherwise.
+   * Note that the type of the returned values is taken from the type of the
+   * provided start/end value. If only one of these is a built-in `number` type,
+   * it will be promoted to the type of the other endpoint. However, in the case
+   * of Unit values, both endpoints must have compatible units, and the return
+   * value will have compatible units as well.
+   *
+   * Examples:
+   *
+   *     math.range(2, 6)        // [2, 3, 4, 5]
+   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]
+   *     math.range('2:1:6')     // [2, 3, 4, 5]
+   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]
+   *     math.range(2, math.fraction(8,3), math.fraction(1,3)) // [fraction(2), fraction(7,3)]
+   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]
+   *
+   * See also:
+   *
+   *     ones, zeros, size, subset
+   *
+   * @param {*} args   Parameters describing the range's `start`, `end`, and optional `step`.
+   * @return {Array | Matrix} range
+   */
+  return typed(name, {
+    // TODO: simplify signatures when typed-function supports default values and optional arguments
+
+    string: _strRange,
+    'string, boolean': _strRange,
+    number: function (oops) {
+      throw new TypeError(`Too few arguments to function range(): ${oops}`);
+    },
+    boolean: function (oops) {
+      throw new TypeError(`Unexpected type of argument 1 to function range(): ${oops}, number|bigint|BigNumber|Fraction`);
+    },
+    'number, number': function (start, end) {
+      return _out(_range(start, end, 1, false));
+    },
+    'number, number, number': function (start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'number, number, boolean': function (start, end, includeEnd) {
+      return _out(_range(start, end, 1, includeEnd));
+    },
+    'number, number, number, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    // Handle bigints; if either limit is bigint, range should be too
+    'bigint, bigint|number': function (start, end) {
+      return _out(_range(start, end, 1n, false));
+    },
+    'number, bigint': function (start, end) {
+      return _out(_range(BigInt(start), end, 1n, false));
+    },
+    'bigint, bigint|number, bigint|number': function (start, end, step) {
+      return _out(_range(start, end, BigInt(step), false));
+    },
+    'number, bigint, bigint|number': function (start, end, step) {
+      return _out(_range(BigInt(start), end, BigInt(step), false));
+    },
+    'bigint, bigint|number, boolean': function (start, end, includeEnd) {
+      return _out(_range(start, end, 1n, includeEnd));
+    },
+    'number, bigint, boolean': function (start, end, includeEnd) {
+      return _out(_range(BigInt(start), end, 1n, includeEnd));
+    },
+    'bigint, bigint|number, bigint|number, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(start, end, BigInt(step), includeEnd));
+    },
+    'number, bigint, bigint|number, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(BigInt(start), end, BigInt(step), includeEnd));
+    },
+    'BigNumber, BigNumber': function (start, end) {
+      const BigNumber = start.constructor;
+      return _out(_range(start, end, new BigNumber(1), false));
+    },
+    'BigNumber, BigNumber, BigNumber': function (start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'BigNumber, BigNumber, boolean': function (start, end, includeEnd) {
+      const BigNumber = start.constructor;
+      return _out(_range(start, end, new BigNumber(1), includeEnd));
+    },
+    'BigNumber, BigNumber, BigNumber, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    'Fraction, Fraction': function (start, end) {
+      return _out(_range(start, end, 1, false));
+    },
+    'Fraction, Fraction, Fraction': function (start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'Fraction, Fraction, boolean': function (start, end, includeEnd) {
+      return _out(_range(start, end, 1, includeEnd));
+    },
+    'Fraction, Fraction, Fraction, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    'Unit, Unit, Unit': function (start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'Unit, Unit, Unit, boolean': function (start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    }
+  });
+  function _out(arr) {
+    if (config.matrix === 'Matrix') {
+      return matrix ? matrix(arr) : (0, _noop.noMatrix)();
+    }
+    return arr;
+  }
+  function _strRange(str, includeEnd) {
+    const r = _parse(str);
+    if (!r) {
+      throw new SyntaxError('String "' + str + '" is no valid range');
+    }
+    if (config.number === 'BigNumber') {
+      if (bignumber === undefined) {
+        (0, _noop.noBignumber)();
+      }
+      return _out(_range(bignumber(r.start), bignumber(r.end), bignumber(r.step)), includeEnd);
+    } else {
+      return _out(_range(r.start, r.end, r.step, includeEnd));
+    }
+  }
+
+  /**
+   * Create a range with numbers or BigNumbers
+   * @param {number | BigNumber | Unit} start
+   * @param {number | BigNumber | Unit} end
+   * @param {number | BigNumber | Unit} step
+   * @param {boolean} includeEnd
+   * @returns {Array} range
+   * @private
+   */
+  function _range(start, end, step, includeEnd) {
+    const array = [];
+    if (isZero(step)) throw new Error('Step must be non-zero');
+    const ongoing = isPositive(step) ? includeEnd ? smallerEq : smaller : includeEnd ? largerEq : larger;
+    let x = start;
+    while (ongoing(x, end)) {
+      array.push(x);
+      x = add(x, step);
+    }
+    return array;
+  }
+
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @param {string} str
+   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
+   * @private
+   */
+  function _parse(str) {
+    const args = str.split(':');
+
+    // number
+    const nums = args.map(function (arg) {
+      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string
+      return Number(arg);
+    });
+    const invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+    if (invalid) {
+      return null;
+    }
+    switch (nums.length) {
+      case 2:
+        return {
+          start: nums[0],
+          end: nums[1],
+          step: 1
+        };
+      case 3:
+        return {
+          start: nums[0],
+          end: nums[2],
+          step: nums[1]
+        };
+      default:
+        return null;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/reshape.js b/node_modules/mathjs/lib/cjs/function/matrix/reshape.js
new file mode 100644
index 0000000..d8cd4e3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/reshape.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReshape = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'reshape';
+const dependencies = ['typed', 'isInteger', 'matrix'];
+const createReshape = exports.createReshape = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isInteger
+  } = _ref;
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   *
+   * Syntax:
+   *
+   *     math.reshape(x, sizes)
+   *
+   * Examples:
+   *
+   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
+   *     // returns Array  [[1, 2, 3], [4, 5, 6]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [1, 4])
+   *     // returns Array  [[1, 2, 3, 4]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [4])
+   *     // returns Array [1, 2, 3, 4]
+   *
+   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
+   *     math.reshape(x, [2, 2, 2])
+   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
+   *
+   *    math.reshape([1, 2, 3, 4], [-1, 2])
+   *    // returns Matrix [[1, 2], [3, 4]]
+   *
+   * See also:
+   *
+   *     size, squeeze, resize
+   *
+   * @param {Array | Matrix | *} x  Matrix to be reshaped
+   * @param {number[]} sizes        One dimensional array with integral sizes for
+   *                                each dimension. One -1 is allowed as wildcard,
+   *                                which calculates this dimension automatically.
+   *
+   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`
+   *
+   * @throws {TypeError}            If `sizes` does not contain solely integers
+   * @throws {DimensionError}       If the product of the new dimension sizes does
+   *                                not equal that of the old ones
+   */
+  return typed(name, {
+    'Matrix, Array': function (x, sizes) {
+      return x.reshape(sizes, true);
+    },
+    'Array, Array': function (x, sizes) {
+      sizes.forEach(function (size) {
+        if (!isInteger(size)) {
+          throw new TypeError('Invalid size for dimension: ' + size);
+        }
+      });
+      return (0, _array.reshape)(x, sizes);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/resize.js b/node_modules/mathjs/lib/cjs/function/matrix/resize.js
new file mode 100644
index 0000000..6b54e85
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/resize.js
@@ -0,0 +1,126 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResize = void 0;
+var _is = require("../../utils/is.js");
+var _DimensionError = require("../../error/DimensionError.js");
+var _ArgumentsError = require("../../error/ArgumentsError.js");
+var _number = require("../../utils/number.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'resize';
+const dependencies = ['config', 'matrix'];
+const createResize = exports.createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    config,
+    matrix
+  } = _ref;
+  /**
+   * Resize a matrix
+   *
+   * Syntax:
+   *
+   *     math.resize(x, size)
+   *     math.resize(x, size, defaultValue)
+   *
+   * Examples:
+   *
+   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]
+   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]
+   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]
+   *     math.resize("hello", [8], "!")    // returns string 'hello!!!'
+   *
+   * See also:
+   *
+   *     size, squeeze, subset, reshape
+   *
+   * @param {Array | Matrix | *} x             Matrix to be resized
+   * @param {Array | Matrix} size              One dimensional array with numbers
+   * @param {number | string} [defaultValue=0] Zero by default, except in
+   *                                           case of a string, in that case
+   *                                           defaultValue = ' '
+   * @return {* | Array | Matrix} A resized clone of matrix `x`
+   */
+  // TODO: rework resize to a typed-function
+  return function resize(x, size, defaultValue) {
+    if (arguments.length !== 2 && arguments.length !== 3) {
+      throw new _ArgumentsError.ArgumentsError('resize', arguments.length, 2, 3);
+    }
+    if ((0, _is.isMatrix)(size)) {
+      size = size.valueOf(); // get Array
+    }
+    if ((0, _is.isBigNumber)(size[0])) {
+      // convert bignumbers to numbers
+      size = size.map(function (value) {
+        return !(0, _is.isBigNumber)(value) ? value : value.toNumber();
+      });
+    }
+
+    // check x is a Matrix
+    if ((0, _is.isMatrix)(x)) {
+      // use optimized matrix implementation, return copy
+      return x.resize(size, defaultValue, true);
+    }
+    if (typeof x === 'string') {
+      // resize string
+      return _resizeString(x, size, defaultValue);
+    }
+
+    // check result should be a matrix
+    const asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
+    if (size.length === 0) {
+      // output a scalar
+      while (Array.isArray(x)) {
+        x = x[0];
+      }
+      return (0, _object.clone)(x);
+    } else {
+      // output an array/matrix
+      if (!Array.isArray(x)) {
+        x = [x];
+      }
+      x = (0, _object.clone)(x);
+      const res = (0, _array.resize)(x, size, defaultValue);
+      return asMatrix ? matrix(res) : res;
+    }
+  };
+
+  /**
+   * Resize a string
+   * @param {string} str
+   * @param {number[]} size
+   * @param {string} [defaultChar=' ']
+   * @private
+   */
+  function _resizeString(str, size, defaultChar) {
+    if (defaultChar !== undefined) {
+      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
+        throw new TypeError('Single character expected as defaultValue');
+      }
+    } else {
+      defaultChar = ' ';
+    }
+    if (size.length !== 1) {
+      throw new _DimensionError.DimensionError(size.length, 1);
+    }
+    const len = size[0];
+    if (typeof len !== 'number' || !(0, _number.isInteger)(len)) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');
+    }
+    if (str.length > len) {
+      return str.substring(0, len);
+    } else if (str.length < len) {
+      let res = str;
+      for (let i = 0, ii = len - str.length; i < ii; i++) {
+        res += defaultChar;
+      }
+      return res;
+    } else {
+      return str;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/rotate.js b/node_modules/mathjs/lib/cjs/function/matrix/rotate.js
new file mode 100644
index 0000000..5a65c61
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/rotate.js
@@ -0,0 +1,77 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRotate = void 0;
+var _factory = require("../../utils/factory.js");
+var _array = require("../../utils/array.js");
+const name = 'rotate';
+const dependencies = ['typed', 'multiply', 'rotationMatrix'];
+const createRotate = exports.createRotate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    multiply,
+    rotationMatrix
+  } = _ref;
+  /**
+     * Rotate a vector of size 1x2 counter-clockwise by a given angle
+     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis
+     *
+     * Syntax:
+     *
+     *    math.rotate(w, theta)
+     *    math.rotate(w, theta, v)
+     *
+     * Examples:
+     *
+     *    math.rotate([11, 12], math.pi / 2)                           // returns [-12, 11]
+     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns [-12, 11]
+     *
+     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns [0, 1, 0]
+     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns Matrix [0, 1, 0]
+     *
+     *    math.rotate([1, 0], math.complex(1 + i))                     // returns [cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)]
+     *
+     * See also:
+     *
+     *    matrix, rotationMatrix
+     *
+     * @param {Array | Matrix} w                             Vector to rotate
+     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+     * @param {Array | Matrix} [v]                           Rotation axis
+     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+     */
+  return typed(name, {
+    'Array , number | BigNumber | Complex | Unit': function (w, theta) {
+      _validateSize(w, 2);
+      const matrixRes = multiply(rotationMatrix(theta), w);
+      return matrixRes.toArray();
+    },
+    'Matrix , number | BigNumber | Complex | Unit': function (w, theta) {
+      _validateSize(w, 2);
+      return multiply(rotationMatrix(theta), w);
+    },
+    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {
+      _validateSize(w, 3);
+      const matrixRes = multiply(rotationMatrix(theta, v), w);
+      return matrixRes;
+    },
+    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function (w, theta, v) {
+      _validateSize(w, 3);
+      return multiply(rotationMatrix(theta, v), w);
+    }
+  });
+  function _validateSize(v, expectedSize) {
+    const actualSize = Array.isArray(v) ? (0, _array.arraySize)(v) : v.size();
+    if (actualSize.length > 2) {
+      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`);
+    }
+    if (actualSize.length === 2 && actualSize[1] !== 1) {
+      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`);
+    }
+    if (actualSize[0] !== expectedSize) {
+      throw new RangeError(`Vector must be of dimensions 1x${expectedSize}`);
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..3129f42
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/rotationMatrix.js
@@ -0,0 +1,166 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRotationMatrix = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'rotationMatrix';
+const dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];
+const createRotationMatrix = exports.createRotationMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    multiplyScalar,
+    addScalar,
+    unaryMinus,
+    norm,
+    BigNumber,
+    matrix,
+    DenseMatrix,
+    SparseMatrix,
+    cos,
+    sin
+  } = _ref;
+  /**
+   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).
+   *
+   * Syntax:
+   *
+   *    math.rotationMatrix(theta)
+   *    math.rotationMatrix(theta, format)
+   *    math.rotationMatrix(theta, [v])
+   *    math.rotationMatrix(theta, [v], format)
+   *
+   * Examples:
+   *
+   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]
+   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]
+   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]
+   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]
+   *
+   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]
+   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])
+   *
+   *
+   * See also:
+   *
+   *    matrix, cos, sin
+   *
+   *
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @param {string} [format]                              Result Matrix storage format
+   * @return {Array | Matrix}                              Rotation matrix
+   */
+
+  return typed(name, {
+    '': function () {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function (format) {
+      return matrix(format);
+    },
+    'number | BigNumber | Complex | Unit': function (theta) {
+      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber | Complex | Unit, string': function (theta, format) {
+      return _rotationMatrix2x2(theta, format);
+    },
+    'number | BigNumber | Complex | Unit, Array': function (theta, v) {
+      const matrixV = matrix(v);
+      _validateVector(matrixV);
+      return _rotationMatrix3x3(theta, matrixV, undefined);
+    },
+    'number | BigNumber | Complex | Unit, Matrix': function (theta, v) {
+      _validateVector(v);
+      const storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);
+      return _rotationMatrix3x3(theta, v, storageType);
+    },
+    'number | BigNumber | Complex | Unit, Array, string': function (theta, v, format) {
+      const matrixV = matrix(v);
+      _validateVector(matrixV);
+      return _rotationMatrix3x3(theta, matrixV, format);
+    },
+    'number | BigNumber | Complex | Unit, Matrix, string': function (theta, v, format) {
+      _validateVector(v);
+      return _rotationMatrix3x3(theta, v, format);
+    }
+  });
+
+  /**
+   * Returns 2x2 matrix of 2D rotation of angle theta
+   *
+   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle
+   * @param {string} format                              The result Matrix storage format
+   * @returns {Matrix}
+   * @private
+   */
+  function _rotationMatrix2x2(theta, format) {
+    const Big = (0, _is.isBigNumber)(theta);
+    const minusOne = Big ? new BigNumber(-1) : -1;
+    const cosTheta = cos(theta);
+    const sinTheta = sin(theta);
+    const data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];
+    return _convertToFormat(data, format);
+  }
+  function _validateVector(v) {
+    const size = v.size();
+    if (size.length < 1 || size[0] !== 3) {
+      throw new RangeError('Vector must be of dimensions 1x3');
+    }
+  }
+  function _mul(array) {
+    return array.reduce((p, curr) => multiplyScalar(p, curr));
+  }
+  function _convertToFormat(data, format) {
+    if (format) {
+      if (format === 'sparse') {
+        return new SparseMatrix(data);
+      }
+      if (format === 'dense') {
+        return new DenseMatrix(data);
+      }
+      throw new TypeError(`Unknown matrix type "${format}"`);
+    }
+    return data;
+  }
+
+  /**
+   * Returns a 3x3 matrix of rotation of angle theta around vector v
+   *
+   * @param {number | BigNumber | Complex | Unit} theta The rotation angle
+   * @param {Matrix} v                                  The rotation axis vector
+   * @param {string} format                             The storage format of the resulting matrix
+   * @returns {Matrix}
+   * @private
+   */
+  function _rotationMatrix3x3(theta, v, format) {
+    const normV = norm(v);
+    if (normV === 0) {
+      throw new RangeError('Rotation around zero vector');
+    }
+    const Big = (0, _is.isBigNumber)(theta) ? BigNumber : null;
+    const one = Big ? new Big(1) : 1;
+    const minusOne = Big ? new Big(-1) : -1;
+    const vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;
+    const vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;
+    const vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;
+    const c = cos(theta);
+    const oneMinusC = addScalar(one, unaryMinus(c));
+    const s = sin(theta);
+    const r11 = addScalar(c, _mul([vx, vx, oneMinusC]));
+    const r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));
+    const r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));
+    const r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));
+    const r22 = addScalar(c, _mul([vy, vy, oneMinusC]));
+    const r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));
+    const r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));
+    const r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));
+    const r33 = addScalar(c, _mul([vz, vz, oneMinusC]));
+    const data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];
+    return _convertToFormat(data, format);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/row.js b/node_modules/mathjs/lib/cjs/function/matrix/row.js
new file mode 100644
index 0000000..4c8b272
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/row.js
@@ -0,0 +1,65 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRow = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+const name = 'row';
+const dependencies = ['typed', 'Index', 'matrix', 'range'];
+const createRow = exports.createRow = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  /**
+   * Return a row from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.row(value, index)
+   *
+   * Example:
+   *
+   *     // get a row
+   *     const d = [[1, 2], [3, 4]]
+   *     math.row(d, 1) // returns [[3, 4]]
+   *
+   * See also:
+   *
+   *     column
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} row              The index of the row
+   * @return {Array | Matrix}         The retrieved row
+   */
+  return typed(name, {
+    'Matrix, number': _row,
+    'Array, number': function (value, row) {
+      return _row(matrix((0, _object.clone)(value)), row).valueOf();
+    }
+  });
+
+  /**
+   * Retrieve a row of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} row     The index of the row
+   * @return {Matrix}        The retrieved row
+   */
+  function _row(value, row) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    (0, _array.validateIndex)(row, value.size()[0]);
+    const columnRange = range(0, value.size()[1]);
+    const index = new Index(row, columnRange);
+    const result = value.subset(index);
+    return (0, _is.isMatrix)(result) ? result : matrix([[result]]);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/size.js b/node_modules/mathjs/lib/cjs/function/matrix/size.js
new file mode 100644
index 0000000..f40b9a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/size.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSize = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _noop = require("../../utils/noop.js");
+const name = 'size';
+const dependencies = ['typed', 'config', '?matrix'];
+const createSize = exports.createSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix
+  } = _ref;
+  /**
+   * Calculate the size of a matrix or scalar.
+   *
+   * Syntax:
+   *
+   *     math.size(x)
+   *
+   * Examples:
+   *
+   *     math.size(2.3)                       // returns []
+   *     math.size('hello world')             // returns [11]
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.size(A)                         // returns [2, 3]
+   *     math.size(math.range(1,6).toArray()) // returns [5]
+   *
+   * See also:
+   *
+   *     count, resize, squeeze, subset
+   *
+   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix
+   * @return {Array | Matrix} A vector with size of `x`.
+   */
+  return typed(name, {
+    Matrix: function (x) {
+      return x.create(x.size(), 'number');
+    },
+    Array: _array.arraySize,
+    string: function (x) {
+      return config.matrix === 'Array' ? [x.length] : matrix([x.length], 'dense', 'number');
+    },
+    'number | Complex | BigNumber | Unit | boolean | null': function (x) {
+      // scalar
+      return config.matrix === 'Array' ? [] : matrix ? matrix([], 'dense', 'number') : (0, _noop.noMatrix)();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/sort.js b/node_modules/mathjs/lib/cjs/function/matrix/sort.js
new file mode 100644
index 0000000..6be9626
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/sort.js
@@ -0,0 +1,119 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSort = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'sort';
+const dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];
+const createSort = exports.createSort = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    compare,
+    compareNatural
+  } = _ref;
+  const compareAsc = compare;
+  const compareDesc = (a, b) => -compare(a, b);
+
+  /**
+   * Sort the items in a matrix.
+   *
+   * Syntax:
+   *
+   *    math.sort(x)
+   *    math.sort(x, compare)
+   *
+   * Examples:
+   *
+   *    math.sort([5, 10, 1]) // returns [1, 5, 10]
+   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
+   *    // returns ['A', 'B', 'C', 'D']
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
+   *    // returns ['Tom', 'Sara', 'Langdon']
+   *
+   * See also:
+   *
+   *    filter, forEach, map, compare, compareNatural
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']
+   *        An optional _comparator function or name. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {Matrix | Array} Returns the sorted matrix.
+   */
+  return typed(name, {
+    Array: function (x) {
+      _arrayIsVector(x);
+      return x.sort(compareAsc);
+    },
+    Matrix: function (x) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(compareAsc), x.storage());
+    },
+    'Array, function': function (x, _comparator) {
+      _arrayIsVector(x);
+      return x.sort(_comparator);
+    },
+    'Matrix, function': function (x, _comparator) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(_comparator), x.storage());
+    },
+    'Array, string': function (x, order) {
+      _arrayIsVector(x);
+      return x.sort(_comparator(order));
+    },
+    'Matrix, string': function (x, order) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(_comparator(order)), x.storage());
+    }
+  });
+
+  /**
+   * Get the comparator for given order ('asc', 'desc', 'natural')
+   * @param {'asc' | 'desc' | 'natural'} order
+   * @return {Function} Returns a _comparator function
+   */
+  function _comparator(order) {
+    if (order === 'asc') {
+      return compareAsc;
+    } else if (order === 'desc') {
+      return compareDesc;
+    } else if (order === 'natural') {
+      return compareNatural;
+    } else {
+      throw new Error('String "asc", "desc", or "natural" expected');
+    }
+  }
+
+  /**
+   * Validate whether an array is one dimensional
+   * Throws an error when this is not the case
+   * @param {Array} array
+   * @private
+   */
+  function _arrayIsVector(array) {
+    if ((0, _array.arraySize)(array).length !== 1) {
+      throw new Error('One dimensional array expected');
+    }
+  }
+
+  /**
+   * Validate whether a matrix is one dimensional
+   * Throws an error when this is not the case
+   * @param {Matrix} matrix
+   * @private
+   */
+  function _matrixIsVector(matrix) {
+    if (matrix.size().length !== 1) {
+      throw new Error('One dimensional matrix expected');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js b/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js
new file mode 100644
index 0000000..3c8f271
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/sqrtm.js
@@ -0,0 +1,105 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqrtm = void 0;
+var _is = require("../../utils/is.js");
+var _string = require("../../utils/string.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'sqrtm';
+const dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
+const createSqrtm = exports.createSqrtm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    add,
+    multiply,
+    map,
+    sqrt,
+    subtract,
+    inv,
+    size,
+    max,
+    identity
+  } = _ref;
+  const _maxIterations = 1e3;
+  const _tolerance = 1e-6;
+
+  /**
+   * Calculate the principal square root matrix using the Denman–Beavers iterative method
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   * @private
+   */
+  function _denmanBeavers(A) {
+    let error;
+    let iterations = 0;
+    let Y = A;
+    let Z = identity(size(A));
+    do {
+      const Yk = Y;
+      Y = multiply(0.5, add(Yk, inv(Z)));
+      Z = multiply(0.5, add(Z, inv(Yk)));
+      error = max(abs(subtract(Y, Yk)));
+      if (error > _tolerance && ++iterations > _maxIterations) {
+        throw new Error('computing square root of matrix: iterative method could not converge');
+      }
+    } while (error > _tolerance);
+    return Y;
+  }
+
+  /**
+   * Calculate the principal square root of a square matrix.
+   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix
+   *
+   * Syntax:
+   *
+   *     math.sqrtm(A)
+   *
+   * Examples:
+   *
+   *     math.sqrtm([[33, 24], [48, 57]]) // returns [[5, 2], [4, 7]]
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   */
+  return typed(name, {
+    'Array | Matrix': function (A) {
+      const size = (0, _is.isMatrix)(A) ? A.size() : (0, _array.arraySize)(A);
+      switch (size.length) {
+        case 1:
+          // Single element Array | Matrix
+          if (size[0] === 1) {
+            return map(A, sqrt);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+          }
+        case 2:
+          {
+            // Two-dimensional Array | Matrix
+            const rows = size[0];
+            const cols = size[1];
+            if (rows === cols) {
+              return _denmanBeavers(A);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
+            }
+          }
+        default:
+          // Multi dimensional array
+          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js b/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js
new file mode 100644
index 0000000..78ba0f9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/squeeze.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSqueeze = void 0;
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'squeeze';
+const dependencies = ['typed'];
+const createSqueeze = exports.createSqueeze = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+   *
+   * Syntax:
+   *
+   *     math.squeeze(x)
+   *
+   * Examples:
+   *
+   *     math.squeeze([3])           // returns 3
+   *     math.squeeze([[3]])         // returns 3
+   *
+   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)
+   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)
+   *
+   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)
+   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)
+   *
+   *     // only inner and outer dimensions are removed
+   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *
+   * See also:
+   *
+   *     subset
+   *
+   * @param {Matrix | Array} x      Matrix to be squeezed
+   * @return {Matrix | Array} Squeezed matrix
+   */
+  return typed(name, {
+    Array: function (x) {
+      return (0, _array.squeeze)((0, _object.clone)(x));
+    },
+    Matrix: function (x) {
+      const res = (0, _array.squeeze)(x.toArray());
+      // FIXME: return the same type of matrix as the input
+      return Array.isArray(res) ? x.create(res, x.datatype()) : res;
+    },
+    any: function (x) {
+      // scalar
+      return (0, _object.clone)(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/subset.js b/node_modules/mathjs/lib/cjs/function/matrix/subset.js
new file mode 100644
index 0000000..dd448ee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/subset.js
@@ -0,0 +1,279 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubset = void 0;
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+var _customs = require("../../utils/customs.js");
+var _DimensionError = require("../../error/DimensionError.js");
+var _factory = require("../../utils/factory.js");
+const name = 'subset';
+const dependencies = ['typed', 'matrix', 'zeros', 'add'];
+const createSubset = exports.createSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  /**
+   * Get or set a subset of a matrix or string.
+   *
+   * Syntax:
+   *     math.subset(value, index)                                // retrieve a subset
+   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset
+   *
+   * Examples:
+   *
+   *     // get a subset
+   *     const d = [[1, 2], [3, 4]]
+   *     math.subset(d, math.index(1, 0))             // returns 3
+   *     math.subset(d, math.index([0, 1], 1))        // returns [[2], [4]]
+   *     math.subset(d, math.index([false, true], 0)) // returns [[3]]
+   *
+   *     // replace a subset
+   *     const e = []
+   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 0, 6]]
+   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 0, 6], [0, 7, 0]]
+   *     math.subset(g, math.index([false, true], 1), 8)          // returns [[5, 0, 6], [0, 8, 0]]
+   *
+   *     // get submatrix using ranges
+   *     const M = [
+   *       [1,2,3],
+   *       [4,5,6],
+   *       [7,8,9]
+   *     ]
+   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1, 2, 3], [4, 5, 6]]
+   *
+   * See also:
+   *
+   *     size, resize, squeeze, index
+   *
+   * @param {Array | Matrix | string} matrix  An array, matrix, or string
+   * @param {Index} index
+   *    For each dimension of the target, specifies an index or a list of
+   *    indices to fetch or set. `subset` uses the cartesian product of
+   *    the indices specified in each dimension.
+   * @param {*} [replacement]                 An array, matrix, or scalar.
+   *                                          If provided, the subset is replaced with replacement.
+   *                                          If not provided, the subset is returned
+   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when
+   *                                          the matrix is resized. If not provided,
+   *                                          math.matrix elements will be left undefined.
+   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.
+   */
+
+  return typed(name, {
+    // get subset
+    'Matrix, Index': function (value, index) {
+      if ((0, _array.isEmptyIndex)(index)) {
+        return matrix();
+      }
+      (0, _array.validateIndexSourceSize)(value, index);
+      return value.subset(index);
+    },
+    'Array, Index': typed.referTo('Matrix, Index', function (subsetRef) {
+      return function (value, index) {
+        const subsetResult = subsetRef(matrix(value), index);
+        return index.isScalar() ? subsetResult : subsetResult.valueOf();
+      };
+    }),
+    'Object, Index': _getObjectProperty,
+    'string, Index': _getSubstring,
+    // set subset
+    'Matrix, Index, any, any': function (value, index, replacement, defaultValue) {
+      if ((0, _array.isEmptyIndex)(index)) {
+        return value;
+      }
+      (0, _array.validateIndexSourceSize)(value, index);
+      return value.clone().subset(index, _broadcastReplacement(replacement, index), defaultValue);
+    },
+    'Array, Index, any, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement, defaultValue) {
+        const subsetResult = subsetRef(matrix(value), index, replacement, defaultValue);
+        return subsetResult.isMatrix ? subsetResult.valueOf() : subsetResult;
+      };
+    }),
+    'Array, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement) {
+        return subsetRef(matrix(value), index, replacement, undefined).valueOf();
+      };
+    }),
+    'Matrix, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement) {
+        return subsetRef(value, index, replacement, undefined);
+      };
+    }),
+    'string, Index, string': _setSubstring,
+    'string, Index, string, string': _setSubstring,
+    'Object, Index, any': _setObjectProperty
+  });
+
+  /**
+   * Broadcasts a replacment value to be the same size as index
+   * @param {number | BigNumber | Array | Matrix} replacement Replacement value to try to broadcast
+   * @param {*} index Index value
+   * @returns broadcasted replacement that matches the size of index
+   */
+
+  function _broadcastReplacement(replacement, index) {
+    if (typeof replacement === 'string') {
+      throw new Error('can\'t boradcast a string');
+    }
+    if (index._isScalar) {
+      return replacement;
+    }
+    const indexSize = index.size();
+    if (indexSize.every(d => d > 0)) {
+      try {
+        return add(replacement, zeros(indexSize));
+      } catch (error) {
+        return replacement;
+      }
+    } else {
+      return replacement;
+    }
+  }
+});
+
+/**
+ * Retrieve a subset of a string
+ * @param {string} str            string from which to get a substring
+ * @param {Index} index           An index or list of indices (character positions)
+ * @returns {string} substring
+ * @private
+ */
+function _getSubstring(str, index) {
+  if (!(0, _is.isIndex)(index)) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+  if ((0, _array.isEmptyIndex)(index)) {
+    return '';
+  }
+  (0, _array.validateIndexSourceSize)(Array.from(str), index);
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size().length, 1);
+  }
+
+  // validate whether the range is out of range
+  const strLen = str.length;
+  (0, _array.validateIndex)(index.min()[0], strLen);
+  (0, _array.validateIndex)(index.max()[0], strLen);
+  const range = index.dimension(0);
+  let substr = '';
+  range.forEach(function (v) {
+    substr += str.charAt(v);
+  });
+  return substr;
+}
+
+/**
+ * Replace a substring in a string
+ * @param {string} str            string to be replaced
+ * @param {Index} index           An index or list of indices (character positions)
+ * @param {string} replacement    Replacement string
+ * @param {string} [defaultValue] Default value to be used when resizing
+ *                                the string. is ' ' by default
+ * @returns {string} result
+ * @private
+ */
+function _setSubstring(str, index, replacement, defaultValue) {
+  if (!index || index.isIndex !== true) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+  if ((0, _array.isEmptyIndex)(index)) {
+    return str;
+  }
+  (0, _array.validateIndexSourceSize)(Array.from(str), index);
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size().length, 1);
+  }
+  if (defaultValue !== undefined) {
+    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {
+      throw new TypeError('Single character expected as defaultValue');
+    }
+  } else {
+    defaultValue = ' ';
+  }
+  const range = index.dimension(0);
+  const len = range.size()[0];
+  if (len !== replacement.length) {
+    throw new _DimensionError.DimensionError(range.size()[0], replacement.length);
+  }
+
+  // validate whether the range is out of range
+  const strLen = str.length;
+  (0, _array.validateIndex)(index.min()[0]);
+  (0, _array.validateIndex)(index.max()[0]);
+
+  // copy the string into an array with characters
+  const chars = [];
+  for (let i = 0; i < strLen; i++) {
+    chars[i] = str.charAt(i);
+  }
+  range.forEach(function (v, i) {
+    chars[v] = replacement.charAt(i[0]);
+  });
+
+  // initialize undefined characters with a space
+  if (chars.length > strLen) {
+    for (let i = strLen - 1, len = chars.length; i < len; i++) {
+      if (!chars[i]) {
+        chars[i] = defaultValue;
+      }
+    }
+  }
+  return chars.join('');
+}
+
+/**
+ * Retrieve a property from an object
+ * @param {Object} object
+ * @param {Index} index
+ * @return {*} Returns the value of the property
+ * @private
+ */
+function _getObjectProperty(object, index) {
+  if ((0, _array.isEmptyIndex)(index)) {
+    return undefined;
+  }
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size(), 1);
+  }
+  const key = index.dimension(0);
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+  return (0, _customs.getSafeProperty)(object, key);
+}
+
+/**
+ * Set a property on an object
+ * @param {Object} object
+ * @param {Index} index
+ * @param {*} replacement
+ * @return {*} Returns the updated object
+ * @private
+ */
+function _setObjectProperty(object, index, replacement) {
+  if ((0, _array.isEmptyIndex)(index)) {
+    return object;
+  }
+  if (index.size().length !== 1) {
+    throw new _DimensionError.DimensionError(index.size(), 1);
+  }
+  const key = index.dimension(0);
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+
+  // clone the object, and apply the property to the clone
+  const updated = (0, _object.clone)(object);
+  (0, _customs.setSafeProperty)(updated, key, replacement);
+  return updated;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/trace.js b/node_modules/mathjs/lib/cjs/function/matrix/trace.js
new file mode 100644
index 0000000..d947434
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/trace.js
@@ -0,0 +1,134 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTrace = void 0;
+var _object = require("../../utils/object.js");
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+const name = 'trace';
+const dependencies = ['typed', 'matrix', 'add'];
+const createTrace = exports.createTrace = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    add
+  } = _ref;
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   *
+   * Syntax:
+   *
+   *    math.trace(x)
+   *
+   * Examples:
+   *
+   *    math.trace([[1, 2], [3, 4]]) // returns 5
+   *
+   *    const A = [
+   *      [1, 2, 3],
+   *      [-1, 2, 3],
+   *      [2, 0, 3]
+   *    ]
+   *    math.trace(A) // returns 6
+   *
+   * See also:
+   *
+   *    diag
+   *
+   * @param {Array | Matrix} x  A matrix
+   *
+   * @return {number} The trace of `x`
+   */
+  return typed('trace', {
+    Array: function _arrayTrace(x) {
+      // use dense matrix implementation
+      return _denseTrace(matrix(x));
+    },
+    SparseMatrix: _sparseTrace,
+    DenseMatrix: _denseTrace,
+    any: _object.clone
+  });
+  function _denseTrace(m) {
+    // matrix size & data
+    const size = m._size;
+    const data = m._data;
+
+    // process dimensions
+    switch (size.length) {
+      case 1:
+        // vector
+        if (size[0] === 1) {
+          // return data[0]
+          return (0, _object.clone)(data[0]);
+        }
+        throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+      case 2:
+        {
+          // two dimensional
+          const rows = size[0];
+          const cols = size[1];
+          if (rows === cols) {
+            // calulate sum
+            let sum = 0;
+            // loop diagonal
+            for (let i = 0; i < rows; i++) {
+              sum = add(sum, data[i][i]);
+            }
+            // return trace
+            return sum;
+          } else {
+            throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+          }
+        }
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be two dimensional (size: ' + (0, _string.format)(size) + ')');
+    }
+  }
+  function _sparseTrace(m) {
+    // matrix arrays
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+    const size = m._size;
+    // check dimensions
+    const rows = size[0];
+    const columns = size[1];
+    // matrix must be square
+    if (rows === columns) {
+      // calulate sum
+      let sum = 0;
+      // check we have data (avoid looping columns)
+      if (values.length > 0) {
+        // loop columns
+        for (let j = 0; j < columns; j++) {
+          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+          const k0 = ptr[j];
+          const k1 = ptr[j + 1];
+          // loop k within [k0, k1[
+          for (let k = k0; k < k1; k++) {
+            // row index
+            const i = index[k];
+            // check row
+            if (i === j) {
+              // accumulate value
+              sum = add(sum, values[k]);
+              // exit loop
+              break;
+            }
+            if (i > j) {
+              // exit loop, no value on the diagonal for column j
+              break;
+            }
+          }
+        }
+      }
+      // return trace
+      return sum;
+    }
+    throw new RangeError('Matrix must be square (size: ' + (0, _string.format)(size) + ')');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/transpose.js b/node_modules/mathjs/lib/cjs/function/matrix/transpose.js
new file mode 100644
index 0000000..f7e158d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/transpose.js
@@ -0,0 +1,166 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTranspose = void 0;
+var _object = require("../../utils/object.js");
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+const name = 'transpose';
+const dependencies = ['typed', 'matrix'];
+const createTranspose = exports.createTranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix
+  } = _ref;
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only applicable to two dimensional matrices containing
+   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
+   * vectors and scalars return the input unchanged.
+   *
+   * Syntax:
+   *
+   *     math.transpose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]
+   *
+   * See also:
+   *
+   *     diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be transposed
+   * @return {Array | Matrix}   The transposed matrix
+   */
+  return typed(name, {
+    Array: x => transposeMatrix(matrix(x)).valueOf(),
+    Matrix: transposeMatrix,
+    any: _object.clone // scalars
+  });
+  function transposeMatrix(x) {
+    // matrix size
+    const size = x.size();
+
+    // result
+    let c;
+
+    // process dimensions
+    switch (size.length) {
+      case 1:
+        // vector
+        c = x.clone();
+        break;
+      case 2:
+        {
+          // rows and columns
+          const rows = size[0];
+          const columns = size[1];
+
+          // check columns
+          if (columns === 0) {
+            // throw exception
+            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + (0, _string.format)(size) + ')');
+          }
+
+          // process storage format
+          switch (x.storage()) {
+            case 'dense':
+              c = _denseTranspose(x, rows, columns);
+              break;
+            case 'sparse':
+              c = _sparseTranspose(x, rows, columns);
+              break;
+          }
+        }
+        break;
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + (0, _string.format)(size) + ')');
+    }
+    return c;
+  }
+  function _denseTranspose(m, rows, columns) {
+    // matrix array
+    const data = m._data;
+    // transposed matrix data
+    const transposed = [];
+    let transposedRow;
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // initialize row
+      transposedRow = transposed[j] = [];
+      // loop rows
+      for (let i = 0; i < rows; i++) {
+        // set data
+        transposedRow[i] = (0, _object.clone)(data[i][j]);
+      }
+    }
+    // return matrix
+    return m.createDenseMatrix({
+      data: transposed,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+  function _sparseTranspose(m, rows, columns) {
+    // matrix arrays
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+    // result matrices
+    const cvalues = values ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+    // row counts
+    const w = [];
+    for (let x = 0; x < rows; x++) {
+      w[x] = 0;
+    }
+    // vars
+    let p, l, j;
+    // loop values in matrix
+    for (p = 0, l = index.length; p < l; p++) {
+      // number of values in row
+      w[index[p]]++;
+    }
+    // cumulative sum
+    let sum = 0;
+    // initialize cptr with the cummulative sum of row counts
+    for (let i = 0; i < rows; i++) {
+      // update cptr
+      cptr.push(sum);
+      // update sum
+      sum += w[i];
+      // update w
+      w[i] = cptr[i];
+    }
+    // update cptr
+    cptr.push(sum);
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // values & index in column
+      for (let k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {
+        // C values & index
+        const q = w[index[k]]++;
+        // C[j, i] = A[i, j]
+        cindex[q] = j;
+        // check we need to process values (pattern matrix)
+        if (values) {
+          cvalues[q] = (0, _object.clone)(values[k]);
+        }
+      }
+    }
+    // return matrix
+    return m.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/matrix/zeros.js b/node_modules/mathjs/lib/cjs/function/matrix/zeros.js
new file mode 100644
index 0000000..0d072a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/matrix/zeros.js
@@ -0,0 +1,129 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createZeros = void 0;
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'zeros';
+const dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+const createZeros = exports.createZeros = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.zeros(m)
+   *    math.zeros(m, format)
+   *    math.zeros(m, n)
+   *    math.zeros(m, n, format)
+   *    math.zeros([m, n])
+   *    math.zeros([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.zeros()                   // returns []
+   *    math.zeros(3)                  // returns [0, 0, 0]
+   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
+   *    math.zeros(3, 'dense')         // returns [0, 0, 0]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]
+   *
+   * See also:
+   *
+   *    ones, identity, size, range
+   *
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix}           A matrix filled with zeros
+   */
+  return typed(name, {
+    '': function () {
+      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');
+    },
+    // math.zeros(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function (size) {
+      const last = size[size.length - 1];
+      if (typeof last === 'string') {
+        const format = size.pop();
+        return _zeros(size, format);
+      } else if (config.matrix === 'Array') {
+        return _zeros(size);
+      } else {
+        return _zeros(size, 'default');
+      }
+    },
+    Array: _zeros,
+    Matrix: function (size) {
+      const format = size.storage();
+      return _zeros(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function (size, format) {
+      return _zeros(size.valueOf(), format);
+    }
+  });
+
+  /**
+   * Create an Array or Matrix with zeros
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+  function _zeros(size, format) {
+    const hasBigNumbers = _normalize(size);
+    const defaultValue = hasBigNumbers ? new BigNumber(0) : 0;
+    _validate(size);
+    if (format) {
+      // return a matrix
+      const m = matrix(format);
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+      return m;
+    } else {
+      // return an Array
+      const arr = [];
+      if (size.length > 0) {
+        return (0, _array.resize)(arr, size, defaultValue);
+      }
+      return arr;
+    }
+  }
+
+  // replace BigNumbers with numbers, returns true if size contained BigNumbers
+  function _normalize(size) {
+    let hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if ((0, _is.isBigNumber)(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  }
+
+  // validate arguments
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {
+        throw new Error('Parameters in function zeros must be positive integers');
+      }
+    });
+  }
+});
+
+// TODO: zeros contains almost the same code as ones. Reuse this?
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/numeric/solveODE.js b/node_modules/mathjs/lib/cjs/function/numeric/solveODE.js
new file mode 100644
index 0000000..f55aaad
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/numeric/solveODE.js
@@ -0,0 +1,289 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSolveODE = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'solveODE';
+const dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'max', 'map', 'abs', 'isPositive', 'isNegative', 'larger', 'smaller', 'matrix', 'bignumber', 'unaryMinus'];
+const createSolveODE = exports.createSolveODE = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    max,
+    map,
+    abs,
+    isPositive,
+    isNegative,
+    larger,
+    smaller,
+    matrix,
+    bignumber,
+    unaryMinus
+  } = _ref;
+  /**
+     * Numerical Integration of Ordinary Differential Equations
+     *
+     * Two variable step methods are provided:
+     * - "RK23": Bogacki–Shampine method
+     * - "RK45": Dormand-Prince method RK5(4)7M (default)
+     *
+     * The arguments are expected as follows.
+     *
+     * - `func` should be the forcing function `f(t, y)`
+     * - `tspan` should be a vector of two numbers or units `[tStart, tEnd]`
+     * - `y0` the initial state values, should be a scalar or a flat array
+     * - `options` should be an object with the following information:
+     *   - `method` ('RK45'): ['RK23', 'RK45']
+     *   - `tol` (1e-3): Numeric tolerance of the method, the solver keeps the error estimates less than this value
+     *   - `firstStep`: Initial step size
+     *   - `minStep`: minimum step size of the method
+     *   - `maxStep`: maximum step size of the method
+     *   - `minDelta` (0.2): minimum ratio of change for the step
+     *   - `maxDelta` (5): maximum ratio of change for the step
+     *   - `maxIter` (1e4): maximum number of iterations
+     *
+     * The returned value is an object with `{t, y}` please note that even though `t` means time, it can represent any other independant variable like `x`:
+     * - `t` an array of size `[n]`
+     * - `y` the states array can be in two ways
+     *   - **if `y0` is a scalar:** returns an array-like of size `[n]`
+     *   - **if `y0` is a flat array-like of size [m]:** returns an array like of size `[n, m]`
+     *
+     * Syntax:
+     *
+     *     math.solveODE(func, tspan, y0)
+     *     math.solveODE(func, tspan, y0, options)
+     *
+     * Examples:
+     *
+     *     function func(t, y) {return y}
+     *     const tspan = [0, 4]
+     *     const y0 = 1
+     *     math.solveODE(func, tspan, y0)
+     *     math.solveODE(func, tspan, [1, 2])
+     *     math.solveODE(func, tspan, y0, { method:"RK23", maxStep:0.1 })
+     *
+     * See also:
+     *
+     *     derivative, simplifyCore
+     *
+     * @param {function} func The forcing function f(t,y)
+     * @param {Array | Matrix} tspan The time span
+     * @param {number | BigNumber | Unit | Array | Matrix} y0 The initial value
+     * @param {Object} [options] Optional configuration options
+     * @return {Object} Return an object with t and y values as arrays
+     */
+
+  function _rk(butcherTableau) {
+    // generates an adaptive runge kutta method from it's butcher tableau
+
+    return function (f, tspan, y0, options) {
+      // adaptive runge kutta methods
+      const wrongTSpan = !(tspan.length === 2 && (tspan.every(isNumOrBig) || tspan.every(_is.isUnit)));
+      if (wrongTSpan) {
+        throw new Error('"tspan" must be an Array of two numeric values or two units [tStart, tEnd]');
+      }
+      const t0 = tspan[0]; // initial time
+      const tf = tspan[1]; // final time
+      const isForwards = larger(tf, t0);
+      const firstStep = options.firstStep;
+      if (firstStep !== undefined && !isPositive(firstStep)) {
+        throw new Error('"firstStep" must be positive');
+      }
+      const maxStep = options.maxStep;
+      if (maxStep !== undefined && !isPositive(maxStep)) {
+        throw new Error('"maxStep" must be positive');
+      }
+      const minStep = options.minStep;
+      if (minStep && isNegative(minStep)) {
+        throw new Error('"minStep" must be positive or zero');
+      }
+      const timeVars = [t0, tf, firstStep, minStep, maxStep].filter(x => x !== undefined);
+      if (!(timeVars.every(isNumOrBig) || timeVars.every(_is.isUnit))) {
+        throw new Error('Inconsistent type of "t" dependant variables');
+      }
+      const steps = 1; // divide time in this number of steps
+      const tol = options.tol ? options.tol : 1e-4; // define a tolerance (must be an option)
+      const minDelta = options.minDelta ? options.minDelta : 0.2;
+      const maxDelta = options.maxDelta ? options.maxDelta : 5;
+      const maxIter = options.maxIter ? options.maxIter : 10000; // stop inifite evaluation if something goes wrong
+      const hasBigNumbers = [t0, tf, ...y0, maxStep, minStep].some(_is.isBigNumber);
+      const [a, c, b, bp] = hasBigNumbers ? [bignumber(butcherTableau.a), bignumber(butcherTableau.c), bignumber(butcherTableau.b), bignumber(butcherTableau.bp)] : [butcherTableau.a, butcherTableau.c, butcherTableau.b, butcherTableau.bp];
+      let h = firstStep ? isForwards ? firstStep : unaryMinus(firstStep) : divide(subtract(tf, t0), steps); // define the first step size
+      const t = [t0]; // start the time array
+      const y = [y0]; // start the solution array
+
+      const deltaB = subtract(b, bp); // b - bp
+
+      let n = 0;
+      let iter = 0;
+      const ongoing = _createOngoing(isForwards);
+      const trimStep = _createTrimStep(isForwards);
+      // iterate unitil it reaches either the final time or maximum iterations
+      while (ongoing(t[n], tf)) {
+        const k = [];
+
+        // trim the time step so that it doesn't overshoot
+        h = trimStep(t[n], tf, h);
+
+        // calculate the first value of k
+        k.push(f(t[n], y[n]));
+
+        // calculate the rest of the values of k
+        for (let i = 1; i < c.length; ++i) {
+          k.push(f(add(t[n], multiply(c[i], h)), add(y[n], multiply(h, a[i], k))));
+        }
+
+        // estimate the error by comparing solutions of different orders
+        const TE = max(abs(map(multiply(deltaB, k), X => (0, _is.isUnit)(X) ? X.value : X)));
+        if (TE < tol && tol / TE > 1 / 4) {
+          // push solution if within tol
+          t.push(add(t[n], h));
+          y.push(add(y[n], multiply(h, b, k)));
+          n++;
+        }
+
+        // estimate the delta value that will affect the step size
+        let delta = 0.84 * (tol / TE) ** (1 / 5);
+        if (smaller(delta, minDelta)) {
+          delta = minDelta;
+        } else if (larger(delta, maxDelta)) {
+          delta = maxDelta;
+        }
+        delta = hasBigNumbers ? bignumber(delta) : delta;
+        h = multiply(h, delta);
+        if (maxStep && larger(abs(h), maxStep)) {
+          h = isForwards ? maxStep : unaryMinus(maxStep);
+        } else if (minStep && smaller(abs(h), minStep)) {
+          h = isForwards ? minStep : unaryMinus(minStep);
+        }
+        iter++;
+        if (iter > maxIter) {
+          throw new Error('Maximum number of iterations reached, try changing options');
+        }
+      }
+      return {
+        t,
+        y
+      };
+    };
+  }
+  function _rk23(f, tspan, y0, options) {
+    // Bogacki–Shampine method
+
+    // Define the butcher table
+    const a = [[], [1 / 2], [0, 3 / 4], [2 / 9, 1 / 3, 4 / 9]];
+    const c = [null, 1 / 2, 3 / 4, 1];
+    const b = [2 / 9, 1 / 3, 4 / 9, 0];
+    const bp = [7 / 24, 1 / 4, 1 / 3, 1 / 8];
+    const butcherTableau = {
+      a,
+      c,
+      b,
+      bp
+    };
+
+    // Solve an adaptive step size rk method
+    return _rk(butcherTableau)(f, tspan, y0, options);
+  }
+  function _rk45(f, tspan, y0, options) {
+    // Dormand Prince method
+
+    // Define the butcher tableau
+    const a = [[], [1 / 5], [3 / 40, 9 / 40], [44 / 45, -56 / 15, 32 / 9], [19372 / 6561, -25360 / 2187, 64448 / 6561, -212 / 729], [9017 / 3168, -355 / 33, 46732 / 5247, 49 / 176, -5103 / 18656], [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84]];
+    const c = [null, 1 / 5, 3 / 10, 4 / 5, 8 / 9, 1, 1];
+    const b = [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84, 0];
+    const bp = [5179 / 57600, 0, 7571 / 16695, 393 / 640, -92097 / 339200, 187 / 2100, 1 / 40];
+    const butcherTableau = {
+      a,
+      c,
+      b,
+      bp
+    };
+
+    // Solve an adaptive step size rk method
+    return _rk(butcherTableau)(f, tspan, y0, options);
+  }
+  function _solveODE(f, tspan, y0, opt) {
+    const method = opt.method ? opt.method : 'RK45';
+    const methods = {
+      RK23: _rk23,
+      RK45: _rk45
+    };
+    if (method.toUpperCase() in methods) {
+      const methodOptions = {
+        ...opt
+      }; // clone the options object
+      delete methodOptions.method; // delete the method as it won't be needed
+      return methods[method.toUpperCase()](f, tspan, y0, methodOptions);
+    } else {
+      // throw an error indicating there is no such method
+      const methodsWithQuotes = Object.keys(methods).map(x => `"${x}"`);
+      // generates a string of methods like: "BDF", "RK23" and "RK45"
+      const availableMethodsString = `${methodsWithQuotes.slice(0, -1).join(', ')} and ${methodsWithQuotes.slice(-1)}`;
+      throw new Error(`Unavailable method "${method}". Available methods are ${availableMethodsString}`);
+    }
+  }
+  function _createOngoing(isForwards) {
+    // returns the correct function to test if it's still iterating
+    return isForwards ? smaller : larger;
+  }
+  function _createTrimStep(isForwards) {
+    const outOfBounds = isForwards ? larger : smaller;
+    return function (t, tf, h) {
+      const next = add(t, h);
+      return outOfBounds(next, tf) ? subtract(tf, t) : h;
+    };
+  }
+  function isNumOrBig(x) {
+    // checks if it's a number or bignumber
+    return (0, _is.isBigNumber)(x) || (0, _is.isNumber)(x);
+  }
+  function _matrixSolveODE(f, T, y0, options) {
+    // receives matrices and returns matrices
+    const sol = _solveODE(f, T.toArray(), y0.toArray(), options);
+    return {
+      t: matrix(sol.t),
+      y: matrix(sol.y)
+    };
+  }
+  return typed('solveODE', {
+    'function, Array, Array, Object': _solveODE,
+    'function, Matrix, Matrix, Object': _matrixSolveODE,
+    'function, Array, Array': (f, T, y0) => _solveODE(f, T, y0, {}),
+    'function, Matrix, Matrix': (f, T, y0) => _matrixSolveODE(f, T, y0, {}),
+    'function, Array, number | BigNumber | Unit': (f, T, y0) => {
+      const sol = _solveODE(f, T, [y0], {});
+      return {
+        t: sol.t,
+        y: sol.y.map(Y => Y[0])
+      };
+    },
+    'function, Matrix, number | BigNumber | Unit': (f, T, y0) => {
+      const sol = _solveODE(f, T.toArray(), [y0], {});
+      return {
+        t: matrix(sol.t),
+        y: matrix(sol.y.map(Y => Y[0]))
+      };
+    },
+    'function, Array, number | BigNumber | Unit, Object': (f, T, y0, options) => {
+      const sol = _solveODE(f, T, [y0], options);
+      return {
+        t: sol.t,
+        y: sol.y.map(Y => Y[0])
+      };
+    },
+    'function, Matrix, number | BigNumber | Unit, Object': (f, T, y0, options) => {
+      const sol = _solveODE(f, T.toArray(), [y0], options);
+      return {
+        t: matrix(sol.t),
+        y: matrix(sol.y.map(Y => Y[0]))
+      };
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/combinations.js b/node_modules/mathjs/lib/cjs/function/probability/combinations.js
new file mode 100644
index 0000000..bab7bcc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/combinations.js
@@ -0,0 +1,75 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCombinations = void 0;
+var _factory = require("../../utils/factory.js");
+var _combinations = require("../../plain/number/combinations.js");
+const name = 'combinations';
+const dependencies = ['typed'];
+const createCombinations = exports.createCombinations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities.
+   *
+   * Combinations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.combinations(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinations(7, 5) // returns 21
+   *
+   * See also:
+   *
+   *    combinationsWithRep, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations.
+   */
+  return typed(name, {
+    'number, number': _combinations.combinationsNumber,
+    'BigNumber, BigNumber': function (n, k) {
+      const BigNumber = n.constructor;
+      let result, i;
+      const nMinusk = n.minus(k);
+      const one = new BigNumber(1);
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinations');
+      }
+      if (k.gt(n)) {
+        throw new TypeError('k must be less than n in function combinations');
+      }
+      result = one;
+      if (k.lt(nMinusk)) {
+        for (i = one; i.lte(nMinusk); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusk.plus(i)).dividedBy(i);
+        }
+      }
+      return result;
+    }
+
+    // TODO: implement support for collection in combinations
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..1890792
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/combinationsWithRep.js
@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCombinationsWithRep = void 0;
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _product = require("../../utils/product.js");
+const name = 'combinationsWithRep';
+const dependencies = ['typed'];
+const createCombinationsWithRep = exports.createCombinationsWithRep = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities, allowing individual outcomes to be repeated more than once.
+   *
+   * CombinationsWithRep only takes integer arguments.
+   * The following condition must be enforced: k <= n + k -1.
+   *
+   * Syntax:
+   *
+   *     math.combinationsWithRep(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinationsWithRep(7, 5) // returns 462
+   *
+   * See also:
+   *
+   *    combinations, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations with replacement.
+   */
+  return typed(name, {
+    'number, number': function (n, k) {
+      if (!(0, _number.isInteger)(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (!(0, _number.isInteger)(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (n < 1) {
+        throw new TypeError('k must be less than or equal to n + k - 1');
+      }
+      if (k < n - 1) {
+        const prodrange = (0, _product.product)(n, n + k - 1);
+        return prodrange / (0, _product.product)(1, k);
+      }
+      const prodrange = (0, _product.product)(k + 1, n + k - 1);
+      return prodrange / (0, _product.product)(1, n - 1);
+    },
+    'BigNumber, BigNumber': function (n, k) {
+      const BigNumber = n.constructor;
+      let result, i;
+      const one = new BigNumber(1);
+      const nMinusOne = n.minus(one);
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (n.lt(one)) {
+        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');
+      }
+      result = one;
+      if (k.lt(nMinusOne)) {
+        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusOne.plus(i)).dividedBy(i);
+        }
+      }
+      return result;
+    }
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/factorial.js b/node_modules/mathjs/lib/cjs/function/probability/factorial.js
new file mode 100644
index 0000000..2932e26
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/factorial.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFactorial = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'factorial';
+const dependencies = ['typed', 'gamma'];
+const createFactorial = exports.createFactorial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    gamma
+  } = _ref;
+  /**
+   * Compute the factorial of a value
+   *
+   * Factorial only supports an integer value as argument.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.factorial(n)
+   *
+   * Examples:
+   *
+   *    math.factorial(5)    // returns 120
+   *    math.factorial(3)    // returns 6
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, gamma, permutations
+   *
+   * @param {number | BigNumber | Array | Matrix} n   An integer number
+   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`
+   */
+  return typed(name, {
+    number: function (n) {
+      if (n < 0) {
+        throw new Error('Value must be non-negative');
+      }
+      return gamma(n + 1);
+    },
+    BigNumber: function (n) {
+      if (n.isNegative()) {
+        throw new Error('Value must be non-negative');
+      }
+      return gamma(n.plus(1));
+    },
+    'Array | Matrix': typed.referToSelf(self => n => (0, _collection.deepMap)(n, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/gamma.js b/node_modules/mathjs/lib/cjs/function/probability/gamma.js
new file mode 100644
index 0000000..d9494a6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/gamma.js
@@ -0,0 +1,126 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createGamma = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'gamma';
+const dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];
+const createGamma = exports.createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    multiplyScalar,
+    pow,
+    BigNumber,
+    Complex
+  } = _ref;
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large values.
+   *
+   * To avoid confusion with the matrix Gamma function, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.gamma(n)
+   *
+   * Examples:
+   *
+   *    math.gamma(5)       // returns 24
+   *    math.gamma(-0.5)    // returns -3.5449077018110335
+   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i
+   *
+   * See also:
+   *
+   *    combinations, factorial, permutations
+   *
+   * @param {number | BigNumber | Complex} n   A real or complex number
+   * @return {number | BigNumber | Complex}    The gamma of `n`
+   */
+
+  function gammaComplex(n) {
+    if (n.im === 0) {
+      return (0, _index.gammaNumber)(n.re);
+    }
+
+    // Lanczos approximation doesn't work well with real part lower than 0.5
+    // So reflection formula is required
+    if (n.re < 0.5) {
+      // Euler's reflection formula
+      // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+      // thanks to imperfect sin implementation sin(PI * n) != 0
+      // we can safely use it anyway
+      const t = new Complex(1 - n.re, -n.im);
+      const r = new Complex(Math.PI * n.re, Math.PI * n.im);
+      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(t));
+    }
+
+    // Lanczos approximation
+    // z -= 1
+    n = new Complex(n.re - 1, n.im);
+
+    // x = gammaPval[0]
+    let x = new Complex(_index.gammaP[0], 0);
+    // for (i, gammaPval) in enumerate(gammaP):
+    for (let i = 1; i < _index.gammaP.length; ++i) {
+      // x += gammaPval / (z + i)
+      const gammaPval = new Complex(_index.gammaP[i], 0);
+      x = x.add(gammaPval.div(n.add(i)));
+    }
+    // t = z + gammaG + 0.5
+    const t = new Complex(n.re + _index.gammaG + 0.5, n.im);
+
+    // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+    const twoPiSqrt = Math.sqrt(2 * Math.PI);
+    const tpow = t.pow(n.add(0.5));
+    const expt = t.neg().exp();
+
+    // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+    return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+  }
+  return typed(name, {
+    number: _index.gammaNumber,
+    Complex: gammaComplex,
+    BigNumber: function (n) {
+      if (n.isInteger()) {
+        return n.isNegative() || n.isZero() ? new BigNumber(Infinity) : bigFactorial(n.minus(1));
+      }
+      if (!n.isFinite()) {
+        return new BigNumber(n.isNegative() ? NaN : Infinity);
+      }
+      throw new Error('Integer BigNumber expected');
+    }
+  });
+
+  /**
+   * Calculate factorial for a BigNumber
+   * @param {BigNumber} n
+   * @returns {BigNumber} Returns the factorial of n
+   */
+  function bigFactorial(n) {
+    if (n < 8) {
+      return new BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);
+    }
+    const precision = config.precision + (Math.log(n.toNumber()) | 0);
+    const Big = BigNumber.clone({
+      precision
+    });
+    if (n % 2 === 1) {
+      return n.times(bigFactorial(new BigNumber(n - 1)));
+    }
+    let p = n;
+    let prod = new Big(n);
+    let sum = n.toNumber();
+    while (p > 2) {
+      p -= 2;
+      sum += p;
+      prod = prod.times(sum);
+    }
+    return new BigNumber(prod.toPrecision(BigNumber.precision));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js b/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js
new file mode 100644
index 0000000..41cf6d6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/kldivergence.js
@@ -0,0 +1,83 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createKldivergence = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'kldivergence';
+const dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];
+const createKldivergence = exports.createKldivergence = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    divide,
+    sum,
+    multiply,
+    map,
+    dotDivide,
+    log,
+    isNumeric
+  } = _ref;
+  /**
+     * Calculate the Kullback-Leibler (KL) divergence  between two distributions
+     *
+     * Syntax:
+     *
+     *     math.kldivergence(x, y)
+     *
+     * Examples:
+     *
+     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153
+     *
+     *
+     * @param  {Array | Matrix} q    First vector
+     * @param  {Array | Matrix} p    Second vector
+     * @return {number}              Returns distance between q and p
+     */
+  return typed(name, {
+    'Array, Array': function (q, p) {
+      return _kldiv(matrix(q), matrix(p));
+    },
+    'Matrix, Array': function (q, p) {
+      return _kldiv(q, matrix(p));
+    },
+    'Array, Matrix': function (q, p) {
+      return _kldiv(matrix(q), p);
+    },
+    'Matrix, Matrix': function (q, p) {
+      return _kldiv(q, p);
+    }
+  });
+  function _kldiv(q, p) {
+    const plength = p.size().length;
+    const qlength = q.size().length;
+    if (plength > 1) {
+      throw new Error('first object must be one dimensional');
+    }
+    if (qlength > 1) {
+      throw new Error('second object must be one dimensional');
+    }
+    if (plength !== qlength) {
+      throw new Error('Length of two vectors must be equal');
+    }
+
+    // Before calculation, apply normalization
+    const sumq = sum(q);
+    if (sumq === 0) {
+      throw new Error('Sum of elements in first object must be non zero');
+    }
+    const sump = sum(p);
+    if (sump === 0) {
+      throw new Error('Sum of elements in second object must be non zero');
+    }
+    const qnorm = divide(q, sum(q));
+    const pnorm = divide(p, sum(p));
+    const result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), x => log(x))));
+    if (isNumeric(result)) {
+      return result;
+    } else {
+      return Number.NaN;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/lgamma.js b/node_modules/mathjs/lib/cjs/function/probability/lgamma.js
new file mode 100644
index 0000000..b0664a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/lgamma.js
@@ -0,0 +1,143 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLgamma = void 0;
+var _index = require("../../plain/number/index.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+/* eslint-disable no-loss-of-precision */
+
+// References
+// ----------
+// [1] Hare, "Computing the Principal Branch of log-Gamma", Journal of Algorithms, 1997.
+// [2] https://math.stackexchange.com/questions/1338753/how-do-i-calculate-values-for-gamma-function-with-complex-arguments
+
+const name = 'lgamma';
+const dependencies = ['Complex', 'typed'];
+const createLgamma = exports.createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Complex,
+    typed
+  } = _ref;
+  // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get
+  // sufficient accuracy.
+  //
+  // These two values are copied from Scipy implementation:
+  // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L37
+  const SMALL_RE = 7;
+  const SMALL_IM = 7;
+
+  /**
+   * The coefficients are B[2*n]/(2*n*(2*n - 1)) where B[2*n] is the (2*n)th Bernoulli number. See (1.1) in [1].
+   *
+   * If you cannot access the paper, can also get these values from the formula in [2].
+   *
+   *    1 /     12 = 0.00833333333333333333333333333333
+   *    1 /    360 = 0.00277777777777777777777777777778
+   * ...
+   * 3617 / 133400 = 0.02955065359477124183006535947712
+   */
+  const coeffs = [-2.955065359477124183e-2, 6.4102564102564102564e-3, -1.9175269175269175269e-3, 8.4175084175084175084e-4, -5.952380952380952381e-4, 7.9365079365079365079e-4, -2.7777777777777777778e-3, 8.3333333333333333333e-2];
+
+  /**
+   * Logarithm of the gamma function for real, positive numbers and complex numbers,
+   * using Lanczos approximation for numbers and Stirling series for complex numbers.
+   *
+   * Syntax:
+   *
+   *    math.lgamma(n)
+   *
+   * Examples:
+   *
+   *    math.lgamma(5)       // returns 3.178053830347945
+   *    math.lgamma(0)       // returns Infinity
+   *    math.lgamma(-0.5)    // returns NaN
+   *    math.lgamma(math.i)  // returns -0.6509231993018536 - 1.8724366472624294i
+   *
+   * See also:
+   *
+   *    gamma
+   *
+   * @param {number | Complex} n   A real or complex number
+   * @return {number | Complex}    The log gamma of `n`
+   */
+  return typed(name, {
+    number: _index.lgammaNumber,
+    Complex: lgammaComplex,
+    BigNumber: function () {
+      throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber");
+    }
+  });
+  function lgammaComplex(n) {
+    const TWOPI = 6.2831853071795864769252842; // 2*pi
+    const LOGPI = 1.1447298858494001741434262; // log(pi)
+
+    const REFLECTION = 0.1;
+    if (n.isNaN()) {
+      return new Complex(NaN, NaN);
+    } else if (n.im === 0) {
+      return new Complex((0, _index.lgammaNumber)(n.re), 0);
+    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
+      return lgammaStirling(n);
+    } else if (n.re <= REFLECTION) {
+      // Reflection formula. see Proposition 3.1 in [1]
+      const tmp = (0, _number.copysign)(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25);
+      const a = n.mul(Math.PI).sin().log();
+      const b = lgammaComplex(new Complex(1 - n.re, -n.im));
+      return new Complex(LOGPI, tmp).sub(a).sub(b);
+    } else if (n.im >= 0) {
+      return lgammaRecurrence(n);
+    } else {
+      return lgammaRecurrence(n.conjugate()).conjugate();
+    }
+  }
+  function lgammaStirling(z) {
+    // formula ref in [2]
+    // computation ref:
+    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L101
+
+    // left part
+
+    // x (log(x) - 1) + 1/2 (log(2PI) - log(x))
+    // => (x - 0.5) * log(x) - x + log(2PI) / 2
+    const leftPart = z.sub(0.5).mul(z.log()).sub(z).add(_index.lnSqrt2PI);
+
+    // right part
+
+    const rz = new Complex(1, 0).div(z);
+    const rzz = rz.div(z);
+    let a = coeffs[0];
+    let b = coeffs[1];
+    const r = 2 * rzz.re;
+    const s = rzz.re * rzz.re + rzz.im * rzz.im;
+    for (let i = 2; i < 8; i++) {
+      const tmp = b;
+      b = -s * a + coeffs[i];
+      a = r * a + tmp;
+    }
+    const rightPart = rz.mul(rzz.mul(a).add(b));
+
+    // plus left and right
+
+    return leftPart.add(rightPart);
+  }
+  function lgammaRecurrence(z) {
+    // computation ref:
+    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L78
+
+    let signflips = 0;
+    let sb = 0;
+    let shiftprod = z;
+    z = z.add(1);
+    while (z.re <= SMALL_RE) {
+      shiftprod = shiftprod.mul(z);
+      const nsb = shiftprod.im < 0 ? 1 : 0;
+      if (nsb !== 0 && sb === 0) signflips++;
+      sb = nsb;
+      z = z.add(1);
+    }
+    return lgammaStirling(z).sub(shiftprod.log()).sub(new Complex(0, signflips * 2 * Math.PI * 1));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/multinomial.js b/node_modules/mathjs/lib/cjs/function/probability/multinomial.js
new file mode 100644
index 0000000..6ef829b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/multinomial.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMultinomial = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'multinomial';
+const dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];
+const createMultinomial = exports.createMultinomial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    divide,
+    multiply,
+    factorial,
+    isInteger,
+    isPositive
+  } = _ref;
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
+   *
+   * multinomial takes one array of integers as an argument.
+   * The following condition must be enforced: every ai <= 0
+   *
+   * Syntax:
+   *
+   *     math.multinomial(a) // a is an array type
+   *
+   * Examples:
+   *
+   *    math.multinomial([1,2,1]) // returns 12
+   *
+   * See also:
+   *
+   *    combinations, factorial
+   *
+   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset
+   * @return {Number | BigNumber}         Multinomial coefficient.
+   */
+  return typed(name, {
+    'Array | Matrix': function (a) {
+      let sum = 0;
+      let denom = 1;
+      (0, _collection.deepForEach)(a, function (ai) {
+        if (!isInteger(ai) || !isPositive(ai)) {
+          throw new TypeError('Positive integer value expected in function multinomial');
+        }
+        sum = add(sum, ai);
+        denom = multiply(denom, factorial(ai));
+      });
+      return divide(factorial(sum), denom);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/permutations.js b/node_modules/mathjs/lib/cjs/function/probability/permutations.js
new file mode 100644
index 0000000..f1694dc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/permutations.js
@@ -0,0 +1,84 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPermutations = void 0;
+var _number = require("../../utils/number.js");
+var _product = require("../../utils/product.js");
+var _factory = require("../../utils/factory.js");
+const name = 'permutations';
+const dependencies = ['typed', 'factorial'];
+const createPermutations = exports.createPermutations = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    factorial
+  } = _ref;
+  /**
+   * Compute the number of ways of obtaining an ordered subset of `k` elements
+   * from a set of `n` elements.
+   *
+   * Permutations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.permutations(n)
+   *     math.permutations(n, k)
+   *
+   * Examples:
+   *
+   *    math.permutations(5)     // 120
+   *    math.permutations(5, 3)  // 60
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, factorial
+   *
+   * @param {number | BigNumber} n   The number of objects in total
+   * @param {number | BigNumber} [k] The number of objects in the subset
+   * @return {number | BigNumber}    The number of permutations
+   */
+  return typed(name, {
+    'number | BigNumber': factorial,
+    'number, number': function (n, k) {
+      if (!(0, _number.isInteger)(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (!(0, _number.isInteger)(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (k > n) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+      // Permute n objects, k at a time
+      return (0, _product.product)(n - k + 1, n);
+    },
+    'BigNumber, BigNumber': function (n, k) {
+      let result, i;
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (k.gt(n)) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+      const one = n.mul(0).add(1);
+      result = one;
+      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
+        result = result.times(i);
+      }
+      return result;
+    }
+
+    // TODO: implement support for collection in permutations
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js b/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js
new file mode 100644
index 0000000..2607481
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/pickRandom.js
@@ -0,0 +1,156 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPickRandom = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _seededRNG = require("./util/seededRNG.js");
+const name = 'pickRandom';
+const dependencies = ['typed', 'config', '?on'];
+const createPickRandom = exports.createPickRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  let rng = (0, _seededRNG.createRng)(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Random pick one or more values from a one dimensional array.
+   * Array elements are picked using a random function with uniform or weighted distribution.
+   *
+   * Syntax:
+   *
+   *     math.pickRandom(array)
+   *     math.pickRandom(array, number)
+   *     math.pickRandom(array, weights)
+   *     math.pickRandom(array, number, weights)
+   *     math.pickRandom(array, weights, number)
+   *     math.pickRandom(array, { weights, number, elementWise })
+   *
+   * Examples:
+   *
+   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
+   *
+   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })
+   *         // returns one of the items in the array
+   *
+   * See also:
+   *
+   *     random, randomInt
+   *
+   * @param {Array | Matrix} array     A one dimensional array
+   * @param {Int} number               An int or float
+   * @param {Array | Matrix} weights   An array of ints or floats
+   * @return {number | Array}          Returns a single random value from array when number is undefined.
+   *                                   Returns an array with the configured number of elements when number is defined.
+   */
+  return typed(name, {
+    'Array | Matrix': function (possibles) {
+      return _pickRandom(possibles, {});
+    },
+    'Array | Matrix, Object': function (possibles, options) {
+      return _pickRandom(possibles, options);
+    },
+    'Array | Matrix, number': function (possibles, number) {
+      return _pickRandom(possibles, {
+        number
+      });
+    },
+    'Array | Matrix, Array | Matrix': function (possibles, weights) {
+      return _pickRandom(possibles, {
+        weights
+      });
+    },
+    'Array | Matrix, Array | Matrix, number': function (possibles, weights, number) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    },
+    'Array | Matrix, number, Array | Matrix': function (possibles, number, weights) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    }
+  });
+
+  /**
+   * @param {Array | Matrix} possibles
+   * @param {{
+   *   number?: number,
+   *   weights?: Array | Matrix,
+   *   elementWise: boolean
+   * }} options
+   * @returns {number | Array}
+   * @private
+   */
+  function _pickRandom(possibles, _ref2) {
+    let {
+      number,
+      weights,
+      elementWise = true
+    } = _ref2;
+    const single = typeof number === 'undefined';
+    if (single) {
+      number = 1;
+    }
+    const createMatrix = (0, _is.isMatrix)(possibles) ? possibles.create : (0, _is.isMatrix)(weights) ? weights.create : null;
+    possibles = possibles.valueOf(); // get Array
+    if (weights) {
+      weights = weights.valueOf(); // get Array
+    }
+    if (elementWise === true) {
+      possibles = (0, _array.flatten)(possibles);
+      weights = (0, _array.flatten)(weights);
+    }
+    let totalWeights = 0;
+    if (typeof weights !== 'undefined') {
+      if (weights.length !== possibles.length) {
+        throw new Error('Weights must have the same length as possibles');
+      }
+      for (let i = 0, len = weights.length; i < len; i++) {
+        if (!(0, _is.isNumber)(weights[i]) || weights[i] < 0) {
+          throw new Error('Weights must be an array of positive numbers');
+        }
+        totalWeights += weights[i];
+      }
+    }
+    const length = possibles.length;
+    const result = [];
+    let pick;
+    while (result.length < number) {
+      if (typeof weights === 'undefined') {
+        pick = possibles[Math.floor(rng() * length)];
+      } else {
+        let randKey = rng() * totalWeights;
+        for (let i = 0, len = possibles.length; i < len; i++) {
+          randKey -= weights[i];
+          if (randKey < 0) {
+            pick = possibles[i];
+            break;
+          }
+        }
+      }
+      result.push(pick);
+    }
+    return single ? result[0] : createMatrix ? createMatrix(result) : result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/random.js b/node_modules/mathjs/lib/cjs/function/probability/random.js
new file mode 100644
index 0000000..e1824a1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/random.js
@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRandomNumber = exports.createRandom = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+var _seededRNG = require("./util/seededRNG.js");
+var _randomMatrix2 = require("./util/randomMatrix.js");
+const name = 'random';
+const dependencies = ['typed', 'config', '?on'];
+const createRandom = exports.createRandom = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  let rng = (0, _seededRNG.createRng)(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Return a random number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.random()                // generate a random number between 0 and 1
+   *     math.random(max)             // generate a random number between 0 and max
+   *     math.random(min, max)        // generate a random number between min and max
+   *     math.random(size)            // generate a matrix with random numbers between 0 and 1
+   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max
+   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max
+   *
+   * Examples:
+   *
+   *     math.random()       // returns a random number between 0 and 1
+   *     math.random(100)    // returns a random number between 0 and 100
+   *     math.random(30, 40) // returns a random number between 30 and 40
+   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
+   *
+   * See also:
+   *
+   *     randomInt, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random number
+   */
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max),
+    'Array | Matrix': size => _randomMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)
+  });
+  function _randomMatrix(size, min, max) {
+    const res = (0, _randomMatrix2.randomMatrix)(size.valueOf(), () => _random(min, max));
+    return (0, _is.isMatrix)(size) ? size.create(res, 'number') : res;
+  }
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
+
+// number only implementation of random, no matrix support
+// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?
+const createRandomNumber = exports.createRandomNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', '?on'], _ref2 => {
+  let {
+    typed,
+    config,
+    on,
+    matrix
+  } = _ref2;
+  // seeded pseudo random number generator1
+  let rng = (0, _seededRNG.createRng)(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max)
+  });
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/randomInt.js b/node_modules/mathjs/lib/cjs/function/probability/randomInt.js
new file mode 100644
index 0000000..73feebd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/randomInt.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRandomInt = void 0;
+var _factory = require("../../utils/factory.js");
+var _randomMatrix = require("./util/randomMatrix.js");
+var _seededRNG = require("./util/seededRNG.js");
+var _is = require("../../utils/is.js");
+const name = 'randomInt';
+const dependencies = ['typed', 'config', 'log2', '?on'];
+const createRandomInt = exports.createRandomInt = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    log2,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  let rng = (0, _seededRNG.createRng)(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = (0, _seededRNG.createRng)(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Return a random integer number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.randomInt()                // generate either 0 or 1, randomly
+   *     math.randomInt(max)             // generate a random integer between 0 and max
+   *     math.randomInt(min, max)        // generate a random integer between min and max
+   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1
+   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max
+   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max
+   *
+   * Examples:
+   *
+   *     math.randomInt(100)    // returns a random integer between 0 and 100
+   *     math.randomInt(30, 40) // returns a random integer between 30 and 40
+   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
+   *
+   * See also:
+   *
+   *     random, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random integer value
+   */
+  return typed(name, {
+    '': () => _randomInt(0, 2),
+    number: max => _randomInt(0, max),
+    'number, number': (min, max) => _randomInt(min, max),
+    bigint: max => _randomBigint(0n, max),
+    'bigint, bigint': _randomBigint,
+    'Array | Matrix': size => _randomIntMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)
+  });
+  function _randomIntMatrix(size, min, max) {
+    const res = (0, _randomMatrix.randomMatrix)(size.valueOf(), () => _randomInt(min, max));
+    return (0, _is.isMatrix)(size) ? size.create(res, 'number') : res;
+  }
+  function _randomInt(min, max) {
+    return Math.floor(min + rng() * (max - min));
+  }
+  function _randomBigint(min, max) {
+    const simpleCutoff = 2n ** 30n;
+    const width = max - min; // number of choices
+    if (width <= simpleCutoff) {
+      // do it with number type
+      return min + BigInt(_randomInt(0, Number(width)));
+    }
+    // Too big to choose accurately that way. Instead, choose the correct
+    // number of random bits to cover the width, and repeat until the
+    // resulting number falls within the width
+    const bits = log2(width);
+    let picked = width;
+    while (picked >= width) {
+      picked = 0n;
+      for (let i = 0; i < bits; ++i) {
+        picked = 2n * picked + (rng() < 0.5 ? 0n : 1n);
+      }
+    }
+    return min + picked;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js b/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js
new file mode 100644
index 0000000..76ee766
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/util/randomMatrix.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.randomMatrix = randomMatrix;
+/**
+ * This is a util function for generating a random matrix recursively.
+ * @param {number[]} size
+ * @param {function} random
+ * @returns {Array}
+ */
+function randomMatrix(size, random) {
+  const data = [];
+  size = size.slice(0);
+  if (size.length > 1) {
+    for (let i = 0, length = size.shift(); i < length; i++) {
+      data.push(randomMatrix(size, random));
+    }
+  } else {
+    for (let i = 0, length = size.shift(); i < length; i++) {
+      data.push(random());
+    }
+  }
+  return data;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js b/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js
new file mode 100644
index 0000000..2d6889d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/probability/util/seededRNG.js
@@ -0,0 +1,26 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRng = createRng;
+var _seedrandom = _interopRequireDefault(require("seedrandom"));
+const singletonRandom = /* #__PURE__ */(0, _seedrandom.default)(Date.now());
+function createRng(randomSeed) {
+  let random;
+
+  // create a new random generator with given seed
+  function setSeed(seed) {
+    random = seed === null ? singletonRandom : (0, _seedrandom.default)(String(seed));
+  }
+
+  // initialize a seeded pseudo random number generator with config's random seed
+  setSeed(randomSeed);
+
+  // wrapper function so the rng can be updated via generator
+  function rng() {
+    return random();
+  }
+  return rng;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compare.js b/node_modules/mathjs/lib/cjs/function/relational/compare.js
new file mode 100644
index 0000000..4aa2284
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compare.js
@@ -0,0 +1,120 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareNumber = exports.createCompare = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matAlgo05xSfSf = require("../../type/matrix/utils/matAlgo05xSfSf.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'compare';
+const dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix', 'concat'];
+const createCompare = exports.createCompare = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    BigNumber,
+    Fraction,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo05xSfSf = (0, _matAlgo05xSfSf.createMatAlgo05xSfSf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * x and y are considered equal when the relative difference between x and y
+   * is smaller than the configured absTol and relTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.compare(x, y)
+   *
+   * Examples:
+   *
+   *    math.compare(6, 1)           // returns 1
+   *    math.compare(2, 3)           // returns -1
+   *    math.compare(7, 7)           // returns 0
+   *    math.compare('10', '2')      // returns 1
+   *    math.compare('1000', '1e3')  // returns 0
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compare(a, b)           // returns 1
+   *
+   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} y Second value to compare
+   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the result of the comparison:
+   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, createCompareNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': function (x, y) {
+      return x === y ? 0 : x > y ? 1 : -1;
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return (0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol) ? new BigNumber(0) : new BigNumber(x.cmp(y));
+    },
+    'bigint, bigint': function (x, y) {
+      return x === y ? 0n : x > y ? 1n : -1n;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return new Fraction(x.compare(y));
+    },
+    'Complex, Complex': function () {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createCompareNumber = exports.createCompareNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.relTol, config.absTol) ? 0 : x > y ? 1 : -1;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js b/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js
new file mode 100644
index 0000000..f85ca13
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compareNatural.js
@@ -0,0 +1,281 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareNatural = void 0;
+var _javascriptNaturalSort = _interopRequireDefault(require("javascript-natural-sort"));
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'compareNatural';
+const dependencies = ['typed', 'compare'];
+const createCompareNatural = exports.createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    compare
+  } = _ref;
+  const compareBooleans = compare.signatures['boolean,boolean'];
+
+  /**
+   * Compare two values of any type in a deterministic, natural way.
+   *
+   * For numeric values, the function works the same as `math.compare`.
+   * For types of values that can't be compared mathematically,
+   * the function compares in a natural way.
+   *
+   * For numeric values, x and y are considered equal when the relative
+   * difference between x and y is smaller than the configured relTol and absTol.
+   * The function cannot be used to compare values smaller than
+   * approximately 2.22e-16.
+   *
+   * For Complex numbers, first the real parts are compared. If equal,
+   * the imaginary parts are compared.
+   *
+   * Strings are compared with a natural sorting algorithm, which
+   * orders strings in a "logic" way following some heuristics.
+   * This differs from the function `compare`, which converts the string
+   * into a numeric value and compares that. The function `compareText`
+   * on the other hand compares text lexically.
+   *
+   * Arrays and Matrices are compared value by value until there is an
+   * unequal pair of values encountered. Objects are compared by sorted
+   * keys until the keys or their values are unequal.
+   *
+   * Syntax:
+   *
+   *    math.compareNatural(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareNatural(6, 1)              // returns 1
+   *    math.compareNatural(2, 3)              // returns -1
+   *    math.compareNatural(7, 7)              // returns 0
+   *
+   *    math.compareNatural('10', '2')         // returns 1
+   *    math.compareText('10', '2')            // returns -1
+   *    math.compare('10', '2')                // returns 1
+   *
+   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
+   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1
+   *    math.compare('Answer: 10', 'Answer: 2')
+   *        // Error: Cannot convert "Answer: 10" to a number
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compareNatural(a, b)              // returns 1
+   *
+   *    const c = math.complex('2 + 3i')
+   *    const d = math.complex('2 + 4i')
+   *    math.compareNatural(c, d)              // returns -1
+   *
+   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
+   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1
+   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1
+   *    math.compareNatural([1, 2], [1, 2])       // returns 0
+   *
+   *    math.compareNatural({a: 2}, {a: 4})       // returns -1
+   *
+   * See also:
+   *
+   *    compare, compareText
+   *
+   * @param  {*} x First value to compare
+   * @param  {*} y Second value to compare
+   * @return {number} Returns the result of the comparison:
+   *                  1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, {
+    'any, any': _compareNatural
+  }); // just to check # args
+
+  function _compareNatural(x, y) {
+    const typeX = (0, _is.typeOf)(x);
+    const typeY = (0, _is.typeOf)(y);
+    let c;
+
+    // numeric types
+    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
+      c = compare(x, y);
+      if (c.toString() !== '0') {
+        // c can be number, BigNumber, or Fraction
+        return c > 0 ? 1 : -1; // return a number
+      } else {
+        return (0, _javascriptNaturalSort.default)(typeX, typeY);
+      }
+    }
+
+    // matrix types
+    const matTypes = ['Array', 'DenseMatrix', 'SparseMatrix'];
+    if (matTypes.includes(typeX) || matTypes.includes(typeY)) {
+      c = compareMatricesAndArrays(_compareNatural, x, y);
+      if (c !== 0) {
+        return c;
+      } else {
+        return (0, _javascriptNaturalSort.default)(typeX, typeY);
+      }
+    }
+
+    // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
+    if (typeX !== typeY) {
+      return (0, _javascriptNaturalSort.default)(typeX, typeY);
+    }
+    if (typeX === 'Complex') {
+      return compareComplexNumbers(x, y);
+    }
+    if (typeX === 'Unit') {
+      if (x.equalBase(y)) {
+        return _compareNatural(x.value, y.value);
+      }
+
+      // compare by units
+      return compareArrays(_compareNatural, x.formatUnits(), y.formatUnits());
+    }
+    if (typeX === 'boolean') {
+      return compareBooleans(x, y);
+    }
+    if (typeX === 'string') {
+      return (0, _javascriptNaturalSort.default)(x, y);
+    }
+    if (typeX === 'Object') {
+      return compareObjects(_compareNatural, x, y);
+    }
+    if (typeX === 'null') {
+      return 0;
+    }
+    if (typeX === 'undefined') {
+      return 0;
+    }
+
+    // this should not occur...
+    throw new TypeError('Unsupported type of value "' + typeX + '"');
+  }
+
+  /**
+   * Compare mixed matrix/array types, by converting to same-shaped array.
+   * This comparator is non-deterministic regarding input types.
+   * @param {Array | SparseMatrix | DenseMatrix | *} x
+   * @param {Array | SparseMatrix | DenseMatrix | *} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareMatricesAndArrays(compareNatural, x, y) {
+    if ((0, _is.isSparseMatrix)(x) && (0, _is.isSparseMatrix)(y)) {
+      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);
+    }
+    if ((0, _is.isSparseMatrix)(x)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x.toArray(), y);
+    }
+    if ((0, _is.isSparseMatrix)(y)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x, y.toArray());
+    }
+
+    // convert DenseArray into Array
+    if ((0, _is.isDenseMatrix)(x)) {
+      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);
+    }
+    if ((0, _is.isDenseMatrix)(y)) {
+      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);
+    }
+
+    // convert scalars to array
+    if (!Array.isArray(x)) {
+      return compareMatricesAndArrays(compareNatural, [x], y);
+    }
+    if (!Array.isArray(y)) {
+      return compareMatricesAndArrays(compareNatural, x, [y]);
+    }
+    return compareArrays(compareNatural, x, y);
+  }
+
+  /**
+   * Compare two Arrays
+   *
+   * - First, compares value by value
+   * - Next, if all corresponding values are equal,
+   *   look at the length: longest array will be considered largest
+   *
+   * @param {Array} x
+   * @param {Array} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareArrays(compareNatural, x, y) {
+    // compare each value
+    for (let i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {
+      const v = compareNatural(x[i], y[i]);
+      if (v !== 0) {
+        return v;
+      }
+    }
+
+    // compare the size of the arrays
+    if (x.length > y.length) {
+      return 1;
+    }
+    if (x.length < y.length) {
+      return -1;
+    }
+
+    // both Arrays have equal size and content
+    return 0;
+  }
+
+  /**
+   * Compare two objects
+   *
+   * - First, compare sorted property names
+   * - Next, compare the property values
+   *
+   * @param {Object} x
+   * @param {Object} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareObjects(compareNatural, x, y) {
+    const keysX = Object.keys(x);
+    const keysY = Object.keys(y);
+
+    // compare keys
+    keysX.sort(_javascriptNaturalSort.default);
+    keysY.sort(_javascriptNaturalSort.default);
+    const c = compareArrays(compareNatural, keysX, keysY);
+    if (c !== 0) {
+      return c;
+    }
+
+    // compare values
+    for (let i = 0; i < keysX.length; i++) {
+      const v = compareNatural(x[keysX[i]], y[keysY[i]]);
+      if (v !== 0) {
+        return v;
+      }
+    }
+    return 0;
+  }
+});
+
+/**
+ * Compare two complex numbers, `x` and `y`:
+ *
+ * - First, compare the real values of `x` and `y`
+ * - If equal, compare the imaginary values of `x` and `y`
+ *
+ * @params {Complex} x
+ * @params {Complex} y
+ * @returns {number} Returns the comparison result: -1, 0, or 1
+ */
+function compareComplexNumbers(x, y) {
+  if (x.re > y.re) {
+    return 1;
+  }
+  if (x.re < y.re) {
+    return -1;
+  }
+  if (x.im > y.im) {
+    return 1;
+  }
+  if (x.im < y.im) {
+    return -1;
+  }
+  return 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compareText.js b/node_modules/mathjs/lib/cjs/function/relational/compareText.js
new file mode 100644
index 0000000..588df7e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compareText.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareTextNumber = exports.createCompareText = void 0;
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'compareText';
+const dependencies = ['typed', 'matrix', 'concat'];
+_string.compareText.signature = 'any, any';
+const createCompareText = exports.createCompareText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    concat
+  } = _ref;
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Compare two strings lexically. Comparison is case sensitive.
+   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.compareText(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareText('B', 'A')     // returns 1
+   *    math.compareText('2', '10')    // returns 1
+   *    math.compare('2', '10')        // returns -1
+   *    math.compareNatural('2', '10') // returns -1
+   *
+   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, equalText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns the result of the comparison:
+   *                                        1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, _string.compareText, matrixAlgorithmSuite({
+    elop: _string.compareText,
+    Ds: true
+  }));
+});
+const createCompareTextNumber = exports.createCompareTextNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed'], _ref2 => {
+  let {
+    typed
+  } = _ref2;
+  return typed(name, _string.compareText);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/compareUnits.js b/node_modules/mathjs/lib/cjs/function/relational/compareUnits.js
new file mode 100644
index 0000000..e9d8d57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/compareUnits.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCompareUnits = void 0;
+var _factory = require("../../utils/factory.js");
+const createCompareUnits = exports.createCompareUnits = /* #__PURE__ */(0, _factory.factory)('compareUnits', ['typed'], _ref => {
+  let {
+    typed
+  } = _ref;
+  return {
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);
+    })
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js b/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js
new file mode 100644
index 0000000..2fbdc0d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/deepEqual.js
@@ -0,0 +1,80 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDeepEqual = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'deepEqual';
+const dependencies = ['typed', 'equal'];
+const createDeepEqual = exports.createDeepEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equal
+  } = _ref;
+  /**
+   * Test element wise whether two matrices are equal.
+   * The function accepts both matrices and scalar values.
+   *
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.deepEqual(x, y)
+   *
+   * Examples:
+   *
+   *    math.deepEqual(2, 4)   // returns false
+   *
+   *    a = [2, 5, 1]
+   *    b = [2, 7, 1]
+   *
+   *    math.deepEqual(a, b)   // returns false
+   *    math.equal(a, b)       // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    equal, unequal
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns true when the input matrices have the same size and each of their elements is equal.
+   */
+  return typed(name, {
+    'any, any': function (x, y) {
+      return _deepEqual(x.valueOf(), y.valueOf());
+    }
+  });
+
+  /**
+   * Test whether two arrays have the same size and all elements are equal
+   * @param {Array | *} x
+   * @param {Array | *} y
+   * @return {boolean} Returns true if both arrays are deep equal
+   */
+  function _deepEqual(x, y) {
+    if (Array.isArray(x)) {
+      if (Array.isArray(y)) {
+        const len = x.length;
+        if (len !== y.length) {
+          return false;
+        }
+        for (let i = 0; i < len; i++) {
+          if (!_deepEqual(x[i], y[i])) {
+            return false;
+          }
+        }
+        return true;
+      } else {
+        return false;
+      }
+    } else {
+      if (Array.isArray(y)) {
+        return false;
+      } else {
+        return equal(x, y);
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equal.js b/node_modules/mathjs/lib/cjs/function/relational/equal.js
new file mode 100644
index 0000000..0f68111
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equal.js
@@ -0,0 +1,117 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualNumber = exports.createEqual = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'equal';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createEqual = exports.createEqual = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is only
+   * equal to `null` and nothing else, and `undefined` is only equal to
+   * `undefined` and nothing else. Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.equal(x, y)
+   *
+   * Examples:
+   *
+   *    math.equal(2 + 2, 3)         // returns false
+   *    math.equal(2 + 2, 4)         // returns true
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.equal(a, b)             // returns true
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.equal(c, d)             // returns [true, false, true]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.equal("1000", "1e3")    // returns true
+   *    math.equal(0, null)          // returns false
+   *
+   * See also:
+   *
+   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText
+   *
+   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false
+   */
+  return typed(name, createEqualNumber({
+    typed,
+    equalScalar
+  }), matrixAlgorithmSuite({
+    elop: equalScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createEqualNumber = exports.createEqualNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], _ref2 => {
+  let {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function (x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+      if (y === null) {
+        return x === null;
+      }
+      if (x === undefined) {
+        return y === undefined;
+      }
+      if (y === undefined) {
+        return x === undefined;
+      }
+      return equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js b/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js
new file mode 100644
index 0000000..134f0ee
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equalScalar.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualScalarNumber = exports.createEqualScalar = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _complex = require("../../utils/complex.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'equalScalar';
+const dependencies = ['typed', 'config'];
+const createEqualScalar = exports.createEqualScalar = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config
+  } = _ref;
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Test whether two scalar values are nearly equal.
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex | Unit} x   First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex} y          Second value to compare
+   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false
+   * @private
+   */
+  return typed(name, {
+    'boolean, boolean': function (x, y) {
+      return x === y;
+    },
+    'number, number': function (x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    },
+    'BigNumber, BigNumber': function (x, y) {
+      return x.eq(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': function (x, y) {
+      return x === y;
+    },
+    'Fraction, Fraction': function (x, y) {
+      return x.equals(y);
+    },
+    'Complex, Complex': function (x, y) {
+      return (0, _complex.complexEquals)(x, y, config.relTol, config.absTol);
+    }
+  }, compareUnits);
+});
+const createEqualScalarNumber = exports.createEqualScalarNumber = (0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return (0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/equalText.js b/node_modules/mathjs/lib/cjs/function/relational/equalText.js
new file mode 100644
index 0000000..c7a65d8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/equalText.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createEqualText = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'equalText';
+const dependencies = ['typed', 'compareText', 'isZero'];
+const createEqualText = exports.createEqualText = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    compareText,
+    isZero
+  } = _ref;
+  /**
+   * Check equality of two strings. Comparison is case sensitive.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.equalText(x, y)
+   *
+   * Examples:
+   *
+   *    math.equalText('Hello', 'Hello')     // returns true
+   *    math.equalText('a', 'A')             // returns false
+   *    math.equal('2e3', '2000')            // returns true
+   *    math.equalText('2e3', '2000')        // returns false
+   *
+   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    equal, compareText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.
+   */
+  return typed(name, {
+    'any, any': function (x, y) {
+      return isZero(compareText(x, y));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/larger.js b/node_modules/mathjs/lib/cjs/function/relational/larger.js
new file mode 100644
index 0000000..6af9c2e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/larger.js
@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLargerNumber = exports.createLarger = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'larger';
+const dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createLarger = exports.createLarger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    bignumber,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Test whether value x is larger than y.
+   *
+   * The function returns true when x is larger than y and the relative
+   * difference between x and y is larger than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.larger(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 3)             // returns false
+   *    math.larger(5, 2 + 2)         // returns true
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.larger(a, b)             // returns false
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, largerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
+   */
+  function bignumLarger(x, y) {
+    return x.gt(y) && !(0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol);
+  }
+  return typed(name, createLargerNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x > y,
+    'BigNumber, BigNumber': bignumLarger,
+    'bigint, bigint': (x, y) => x > y,
+    'Fraction, Fraction': (x, y) => x.compare(y) === 1,
+    'Fraction, BigNumber': function (x, y) {
+      return bignumLarger(bignumber(x), y);
+    },
+    'BigNumber, Fraction': function (x, y) {
+      return bignumLarger(x, bignumber(y));
+    },
+    'Complex, Complex': function () {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createLargerNumber = exports.createLargerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return x > y && !(0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/largerEq.js b/node_modules/mathjs/lib/cjs/function/relational/largerEq.js
new file mode 100644
index 0000000..40c021b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/largerEq.js
@@ -0,0 +1,104 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createLargerEqNumber = exports.createLargerEq = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'largerEq';
+const dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createLargerEq = exports.createLargerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Test whether value x is larger or equal to y.
+   *
+   * The function returns true when x is larger than y or the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.largerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 1 + 1)         // returns false
+   *    math.largerEq(2, 1 + 1)       // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
+   */
+  return typed(name, createLargerEqNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x >= y,
+    'BigNumber, BigNumber': function (x, y) {
+      return x.gte(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': function (x, y) {
+      return x >= y;
+    },
+    'Fraction, Fraction': (x, y) => x.compare(y) !== -1,
+    'Complex, Complex': function () {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createLargerEqNumber = exports.createLargerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return x >= y || (0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/smaller.js b/node_modules/mathjs/lib/cjs/function/relational/smaller.js
new file mode 100644
index 0000000..569cfe5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/smaller.js
@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSmallerNumber = exports.createSmaller = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'smaller';
+const dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createSmaller = exports.createSmaller = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    bignumber,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Test whether value x is smaller than y.
+   *
+   * The function returns true when x is smaller than y and the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smaller(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(2, 3)            // returns true
+   *    math.smaller(5, 2 * 2)        // returns false
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.smaller(a, b)            // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smallerEq, smaller, smallerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+  function bignumSmaller(x, y) {
+    return x.lt(y) && !(0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol);
+  }
+  return typed(name, createSmallerNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x < y,
+    'BigNumber, BigNumber': bignumSmaller,
+    'bigint, bigint': (x, y) => x < y,
+    'Fraction, Fraction': (x, y) => x.compare(y) === -1,
+    'Fraction, BigNumber': function (x, y) {
+      return bignumSmaller(bignumber(x), y);
+    },
+    'BigNumber, Fraction': function (x, y) {
+      return bignumSmaller(x, bignumber(y));
+    },
+    'Complex, Complex': function (x, y) {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createSmallerNumber = exports.createSmallerNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return x < y && !(0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js b/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js
new file mode 100644
index 0000000..eb2a32b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/smallerEq.js
@@ -0,0 +1,102 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSmallerEqNumber = exports.createSmallerEq = void 0;
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+var _compareUnits = require("./compareUnits.js");
+const name = 'smallerEq';
+const dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createSmallerEq = exports.createSmallerEq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+  const compareUnits = (0, _compareUnits.createCompareUnits)({
+    typed
+  });
+
+  /**
+   * Test whether value x is smaller or equal to y.
+   *
+   * The function returns true when x is smaller than y or the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smallerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(1 + 2, 3)        // returns false
+   *    math.smallerEq(1 + 2, 3)      // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+  return typed(name, createSmallerEqNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x <= y,
+    'BigNumber, BigNumber': function (x, y) {
+      return x.lte(y) || (0, _nearlyEqual.nearlyEqual)(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': (x, y) => x <= y,
+    'Fraction, Fraction': (x, y) => x.compare(y) !== 1,
+    'Complex, Complex': function () {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+const createSmallerEqNumber = exports.createSmallerEqNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config'], _ref2 => {
+  let {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function (x, y) {
+      return x <= y || (0, _number.nearlyEqual)(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/relational/unequal.js b/node_modules/mathjs/lib/cjs/function/relational/unequal.js
new file mode 100644
index 0000000..6cc23a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/relational/unequal.js
@@ -0,0 +1,120 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnequalNumber = exports.createUnequal = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo07xSSf = require("../../type/matrix/utils/matAlgo07xSSf.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'unequal';
+const dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+const createUnequal = exports.createUnequal = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo07xSSf = (0, _matAlgo07xSSf.createMatAlgo07xSSf)({
+    typed,
+    SparseMatrix
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Test whether two values are unequal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * larger than the configured relTol and absTol. The function cannot be used to compare
+   * values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
+   * Strings are compared by their numerical value.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is unequal
+   * with everything except `null`, and `undefined` is unequal with everything
+   * except `undefined`.
+   *
+   * Syntax:
+   *
+   *    math.unequal(x, y)
+   *
+   * Examples:
+   *
+   *    math.unequal(2 + 2, 3)       // returns true
+   *    math.unequal(2 + 2, 4)       // returns false
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.unequal(a, b)           // returns false
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.unequal(c, d)           // returns [false, true, false]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.unequal(0, null)        // returns true
+   * See also:
+   *
+   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
+   */
+  return typed(name, createUnequalNumber({
+    typed,
+    equalScalar
+  }), matrixAlgorithmSuite({
+    elop: _unequal,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+  function _unequal(x, y) {
+    return !equalScalar(x, y);
+  }
+});
+const createUnequalNumber = exports.createUnequalNumber = (0, _factory.factory)(name, ['typed', 'equalScalar'], _ref2 => {
+  let {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function (x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+      if (y === null) {
+        return x !== null;
+      }
+      if (x === undefined) {
+        return y !== undefined;
+      }
+      if (y === undefined) {
+        return x !== undefined;
+      }
+      return !equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setCartesian.js b/node_modules/mathjs/lib/cjs/function/set/setCartesian.js
new file mode 100644
index 0000000..665cfb9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setCartesian.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetCartesian = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setCartesian';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+const createSetCartesian = exports.createSetCartesian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the cartesian product of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays
+   * and the values will be sorted in ascending order before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setCartesian(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
+   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference, setPowerset
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The cartesian product of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      let result = [];
+      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {
+        // if any of them is empty, return empty
+        const b1 = (0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
+        const b2 = (0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);
+        result = [];
+        for (let i = 0; i < b1.length; i++) {
+          for (let j = 0; j < b2.length; j++) {
+            result.push([b1[i], b2[j]]);
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return result;
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setDifference.js b/node_modules/mathjs/lib/cjs/function/set/setDifference.js
new file mode 100644
index 0000000..e6c609b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setDifference.js
@@ -0,0 +1,77 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetDifference = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setDifference';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+const createSetDifference = exports.createSetDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]
+   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setSymDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      let result;
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty-anything=empty
+        result = [];
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything-empty=anything
+        return (0, _array.flatten)(a1.toArray());
+      } else {
+        const b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        const b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        let inb2;
+        for (let i = 0; i < b1.length; i++) {
+          inb2 = false;
+          for (let j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              inb2 = true;
+              break;
+            }
+          }
+          if (!inb2) {
+            result.push(b1[i]);
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return (0, _array.generalize)(result);
+      }
+      // return a matrix otherwise
+      return new DenseMatrix((0, _array.generalize)(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setDistinct.js b/node_modules/mathjs/lib/cjs/function/set/setDistinct.js
new file mode 100644
index 0000000..4a90e86
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setDistinct.js
@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetDistinct = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setDistinct';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+const createSetDistinct = exports.createSetDistinct = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Collect the distinct elements of a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDistinct(set)
+   *
+   * Examples:
+   *
+   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]
+   *
+   * See also:
+   *
+   *    setMultiplicity
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {Array | Matrix}    A set containing the distinc elements of the multiset
+   */
+  return typed(name, {
+    'Array | Matrix': function (a) {
+      let result;
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        result = [];
+      } else {
+        const b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        result = [];
+        result.push(b[0]);
+        for (let i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            result.push(b[i]);
+          }
+        }
+      }
+      // return an array, if the input was an array
+      if (Array.isArray(a)) {
+        return result;
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setIntersect.js b/node_modules/mathjs/lib/cjs/function/set/setIntersect.js
new file mode 100644
index 0000000..d85c5ab
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setIntersect.js
@@ -0,0 +1,69 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetIntersect = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setIntersect';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+const createSetIntersect = exports.createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the intersection of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIntersect(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]
+   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]
+   *
+   * See also:
+   *
+   *    setUnion, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The intersection of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      let result;
+      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
+        // of any of them is empty, return empty
+        result = [];
+      } else {
+        const b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        const b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        for (let i = 0; i < b1.length; i++) {
+          for (let j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              result.push(b1[i]);
+              break;
+            }
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return (0, _array.generalize)(result);
+      }
+      // return a matrix otherwise
+      return new DenseMatrix((0, _array.generalize)(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js b/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
new file mode 100644
index 0000000..b5f9a78
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setIsSubset.js
@@ -0,0 +1,68 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetIsSubset = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setIsSubset';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+const createSetIsSubset = exports.createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIsSubset(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false
+   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {boolean} Returns true when a1 is a subset of a2, returns false otherwise
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty is a subset of anything
+        return true;
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything is not a subset of empty
+        return false;
+      }
+      const b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+      const b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+      let inb2;
+      for (let i = 0; i < b1.length; i++) {
+        inb2 = false;
+        for (let j = 0; j < b2.length; j++) {
+          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+            // the identifier is always a decimal int
+            inb2 = true;
+            break;
+          }
+        }
+        if (inb2 === false) {
+          return false;
+        }
+      }
+      return true;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..34cb1b6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setMultiplicity.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetMultiplicity = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setMultiplicity';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+const createSetMultiplicity = exports.createSetMultiplicity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Count the multiplicity of an element in a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setMultiplicity(element, set)
+   *
+   * Examples:
+   *
+   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1
+   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2
+   *
+   * See also:
+   *
+   *    setDistinct, setSize
+   *
+   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset
+   * @param {Array | Matrix}     a  A multiset
+   * @return {number}            The number of how many times the multiset contains the element
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | Complex, Array | Matrix': function (e, a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return 0
+        return 0;
+      }
+      const b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray());
+      let count = 0;
+      for (let i = 0; i < b.length; i++) {
+        if (compareNatural(b[i], e) === 0) {
+          count++;
+        }
+      }
+      return count;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setPowerset.js b/node_modules/mathjs/lib/cjs/function/set/setPowerset.js
new file mode 100644
index 0000000..9edb068
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setPowerset.js
@@ -0,0 +1,81 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetPowerset = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setPowerset';
+const dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+const createSetPowerset = exports.createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setPowerset(set)
+   *
+   * Examples:
+   *
+   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
+   *
+   * See also:
+   *
+   *    setCartesian
+   *
+   * @param {Array | Matrix}    a  A (multi)set
+   * @return {Array}    The powerset of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function (a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        return [];
+      }
+      const b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+      const result = [];
+      let number = 0;
+      while (number.toString(2).length <= b.length) {
+        result.push(_subset(b, number.toString(2).split('').reverse()));
+        number++;
+      }
+      // can not return a matrix, because of the different size of the subarrays
+      return _sort(result);
+    }
+  });
+
+  // create subset
+  function _subset(array, bitarray) {
+    const result = [];
+    for (let i = 0; i < bitarray.length; i++) {
+      if (bitarray[i] === '1') {
+        result.push(array[i]);
+      }
+    }
+    return result;
+  }
+
+  // sort subsests by length
+  function _sort(array) {
+    let temp = [];
+    for (let i = array.length - 1; i > 0; i--) {
+      for (let j = 0; j < i; j++) {
+        if (array[j].length > array[j + 1].length) {
+          temp = array[j];
+          array[j] = array[j + 1];
+          array[j + 1] = temp;
+        }
+      }
+    }
+    return array;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setSize.js b/node_modules/mathjs/lib/cjs/function/set/setSize.js
new file mode 100644
index 0000000..a650f69
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setSize.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetSize = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setSize';
+const dependencies = ['typed', 'compareNatural'];
+const createSetSize = exports.createSetSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    compareNatural
+  } = _ref;
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSize(set)
+   *    math.setSize(set, unique)
+   *
+   * Examples:
+   *
+   *    math.setSize([1, 2, 2, 4])          // returns 4
+   *    math.setSize([1, 2, 2, 4], true)    // returns 3
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix} a  A multiset
+   * @param {boolean} [unique]  If true, only the unique values are counted. False by default
+   * @return {number}           The number of elements of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function (a) {
+      return Array.isArray(a) ? (0, _array.flatten)(a).length : (0, _array.flatten)(a.toArray()).length;
+    },
+    'Array | Matrix, boolean': function (a, unique) {
+      if (unique === false || a.length === 0) {
+        return Array.isArray(a) ? (0, _array.flatten)(a).length : (0, _array.flatten)(a.toArray()).length;
+      } else {
+        const b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        let count = 1;
+        for (let i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            count++;
+          }
+        }
+        return count;
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js b/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js
new file mode 100644
index 0000000..5f2e994
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setSymDifference.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetSymDifference = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setSymDifference';
+const dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
+const createSetSymDifference = exports.createSetSymDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    concat,
+    subset,
+    setDifference,
+    Index
+  } = _ref;
+  /**
+   * Create the symmetric difference of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSymDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]
+   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The symmetric difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return (0, _array.flatten)(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return (0, _array.flatten)(a1);
+      }
+      const b1 = (0, _array.flatten)(a1);
+      const b2 = (0, _array.flatten)(a2);
+      return concat(setDifference(b1, b2), setDifference(b2, b1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/set/setUnion.js b/node_modules/mathjs/lib/cjs/function/set/setUnion.js
new file mode 100644
index 0000000..e573f57
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/set/setUnion.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSetUnion = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'setUnion';
+const dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
+const createSetUnion = exports.createSetUnion = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    size,
+    concat,
+    subset,
+    setIntersect,
+    setSymDifference,
+    Index
+  } = _ref;
+  /**
+   * Create the union of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setUnion(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]
+   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *    setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The union of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function (a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return (0, _array.flatten)(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return (0, _array.flatten)(a1);
+      }
+      const b1 = (0, _array.flatten)(a1);
+      const b2 = (0, _array.flatten)(a2);
+      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/signal/freqz.js b/node_modules/mathjs/lib/cjs/function/signal/freqz.js
new file mode 100644
index 0000000..ac8412b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/signal/freqz.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFreqz = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'freqz';
+const dependencies = ['typed', 'add', 'multiply', 'Complex', 'divide', 'matrix'];
+const createFreqz = exports.createFreqz = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    multiply,
+    Complex,
+    divide,
+    matrix
+  } = _ref;
+  /**
+     * Calculates the frequency response of a filter given its numerator and denominator coefficients.
+     *
+     * Syntax:
+     *    math.freqz(b, a)
+     *    math.freqz(b, a, w)
+     *
+     * Examples:
+     *   math.freqz([1, 2], [1, 2, 3], 4) // returns { h: [0.5 + 0i, 0.4768589245763655 + 0.2861153547458193i, 0.25000000000000006 + 0.75i, -0.770976571635189 + 0.4625859429811135i], w: [0, 0.7853981633974483, 1.5707963267948966, 2.356194490192345 ] }
+     *   math.freqz([1, 2], [1, 2, 3], [0, 1]) // returns { h: [0.5 + 0i, 0.45436781 + 0.38598051i], w: [0, 1] }
+     *
+     * See also:
+     *  zpk2tf
+     *
+     * @param {Array.<number>} b The numerator coefficients of the filter.
+     * @param {Array.<number>} a The denominator coefficients of the filter.
+     * @param {Array.<number>} [w] A vector of frequencies (in radians/sample) at which the frequency response is to be computed or the number of points to compute (if a number is not provided, the default is 512 points)
+     * @returns {Object} An object with two properties: h, a vector containing the complex frequency response, and w, a vector containing the normalized frequencies (in radians/sample) at which the response was computed.
+     *
+     *
+     */
+  return typed(name, {
+    'Array, Array': function (b, a) {
+      const w = createBins(512);
+      return _freqz(b, a, w);
+    },
+    'Array, Array, Array': function (b, a, w) {
+      return _freqz(b, a, w);
+    },
+    'Array, Array, number': function (b, a, w) {
+      if (w < 0) {
+        throw new Error('w must be a positive number');
+      }
+      const w2 = createBins(w);
+      return _freqz(b, a, w2);
+    },
+    'Matrix, Matrix': function (b, a) {
+      // console.log('here')
+      const _w = createBins(512);
+      const {
+        w,
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), _w);
+      return {
+        w: matrix(w),
+        h: matrix(h)
+      };
+    },
+    'Matrix, Matrix, Matrix': function (b, a, w) {
+      const {
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), w.valueOf());
+      return {
+        h: matrix(h),
+        w: matrix(w)
+      };
+    },
+    'Matrix, Matrix, number': function (b, a, w) {
+      if (w < 0) {
+        throw new Error('w must be a positive number');
+      }
+      const _w = createBins(w);
+      const {
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), _w);
+      return {
+        h: matrix(h),
+        w: matrix(_w)
+      };
+    }
+  });
+  function _freqz(b, a, w) {
+    const num = [];
+    const den = [];
+    for (let i = 0; i < w.length; i++) {
+      let sumNum = Complex(0, 0);
+      let sumDen = Complex(0, 0);
+      for (let j = 0; j < b.length; j++) {
+        sumNum = add(sumNum, multiply(b[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))));
+      }
+      for (let j = 0; j < a.length; j++) {
+        sumDen = add(sumDen, multiply(a[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))));
+      }
+      num.push(sumNum);
+      den.push(sumDen);
+    }
+    const h = [];
+    for (let i = 0; i < num.length; i++) {
+      h.push(divide(num[i], den[i]));
+    }
+    return {
+      h,
+      w
+    };
+  }
+  function createBins(n) {
+    const bins = [];
+    for (let i = 0; i < n; i++) {
+      bins.push(i / n * Math.PI);
+    }
+    return bins;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/signal/zpk2tf.js b/node_modules/mathjs/lib/cjs/function/signal/zpk2tf.js
new file mode 100644
index 0000000..2c0ab88
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/signal/zpk2tf.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createZpk2tf = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'zpk2tf';
+const dependencies = ['typed', 'add', 'multiply', 'Complex', 'number'];
+const createZpk2tf = exports.createZpk2tf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    multiply,
+    Complex,
+    number
+  } = _ref;
+  /**
+     * Compute the transfer function of a zero-pole-gain model.
+     *
+     * Syntax:
+     *      math.zpk2tf(z, p, k)
+     *
+     * Examples:
+     *    math.zpk2tf([1, 2], [-1, -2], 1)    // returns [[1, -3, 2], [1, 3, 2]]
+     *
+     * See also:
+     *   freqz
+     *
+     * @param {Array} z Array of zeros values
+     * @param {Array} p Array of poles values
+     * @param {number} k Gain value
+     * @return {Array} Two dimensional array containing the numerator (first row) and denominator (second row) polynomials
+     *
+     */
+  return typed(name, {
+    'Array,Array,number': function (z, p, k) {
+      return _zpk2tf(z, p, k);
+    },
+    'Array,Array': function (z, p) {
+      return _zpk2tf(z, p, 1);
+    },
+    'Matrix,Matrix,number': function (z, p, k) {
+      return _zpk2tf(z.valueOf(), p.valueOf(), k);
+    },
+    'Matrix,Matrix': function (z, p) {
+      return _zpk2tf(z.valueOf(), p.valueOf(), 1);
+    }
+  });
+  function _zpk2tf(z, p, k) {
+    // if z is bignumber, convert it to number
+    if (z.some(el => el.type === 'BigNumber')) {
+      z = z.map(el => number(el));
+    }
+    // if p is bignumber, convert it to number
+    if (p.some(el => el.type === 'BigNumber')) {
+      p = p.map(el => number(el));
+    }
+    let num = [Complex(1, 0)];
+    let den = [Complex(1, 0)];
+    for (let i = 0; i < z.length; i++) {
+      let zero = z[i];
+      if (typeof zero === 'number') zero = Complex(zero, 0);
+      num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)]);
+    }
+    for (let i = 0; i < p.length; i++) {
+      let pole = p[i];
+      if (typeof pole === 'number') pole = Complex(pole, 0);
+      den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)]);
+    }
+    for (let i = 0; i < num.length; i++) {
+      num[i] = multiply(num[i], k);
+    }
+    return [num, den];
+  }
+  function _multiply(a, b) {
+    const c = [];
+    for (let i = 0; i < a.length + b.length - 1; i++) {
+      c[i] = Complex(0, 0);
+      for (let j = 0; j < a.length; j++) {
+        if (i - j >= 0 && i - j < b.length) {
+          c[i] = add(c[i], multiply(a[j], b[i - j]));
+        }
+      }
+    }
+    return c;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/special/erf.js b/node_modules/mathjs/lib/cjs/function/special/erf.js
new file mode 100644
index 0000000..ae57167
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/special/erf.js
@@ -0,0 +1,161 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createErf = void 0;
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+/* eslint-disable no-loss-of-precision */
+
+const name = 'erf';
+const dependencies = ['typed'];
+const createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   *
+   * This is a translation of W. J. Cody's Fortran implementation from 1987
+   * ( https://www.netlib.org/specfun/erf ). See the AMS publication
+   * "Rational Chebyshev Approximations for the Error Function" by W. J. Cody
+   * for an explanation of this process.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.erf(x)
+   *
+   * Examples:
+   *
+   *    math.erf(0.2)    // returns 0.22270258921047847
+   *    math.erf(-0.5)   // returns -0.5204998778130465
+   *    math.erf(4)      // returns 0.9999999845827421
+   *
+   * See also:
+   *    zeta
+   *
+   * @param {number | Array | Matrix} x   A real number
+   * @return {number | Array | Matrix}    The erf of `x`
+   */
+  return typed('name', {
+    number: function (x) {
+      const y = Math.abs(x);
+      if (y >= MAX_NUM) {
+        return (0, _number.sign)(x);
+      }
+      if (y <= THRESH) {
+        return (0, _number.sign)(x) * erf1(y);
+      }
+      if (y <= 4.0) {
+        return (0, _number.sign)(x) * (1 - erfc2(y));
+      }
+      return (0, _number.sign)(x) * (1 - erfc3(y));
+    },
+    'Array | Matrix': typed.referToSelf(self => n => (0, _collection.deepMap)(n, self))
+
+    // TODO: For complex numbers, use the approximation for the Faddeeva function
+    //  from "More Efficient Computation of the Complex Error Function" (AMS)
+  });
+
+  /**
+   * Approximates the error function erf() for x <= 0.46875 using this function:
+   *               n
+   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
+   *              j=0
+   */
+  function erf1(y) {
+    const ysq = y * y;
+    let xnum = P[0][4] * ysq;
+    let xden = ysq;
+    let i;
+    for (i = 0; i < 3; i += 1) {
+      xnum = (xnum + P[0][i]) * ysq;
+      xden = (xden + Q[0][i]) * ysq;
+    }
+    return y * (xnum + P[0][3]) / (xden + Q[0][3]);
+  }
+
+  /**
+   * Approximates the complement of the error function erfc() for
+   * 0.46875 <= x <= 4.0 using this function:
+   *                       n
+   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
+   *                      j=0
+   */
+  function erfc2(y) {
+    let xnum = P[1][8] * y;
+    let xden = y;
+    let i;
+    for (i = 0; i < 7; i += 1) {
+      xnum = (xnum + P[1][i]) * y;
+      xden = (xden + Q[1][i]) * y;
+    }
+    const result = (xnum + P[1][7]) / (xden + Q[1][7]);
+    const ysq = parseInt(y * 16) / 16;
+    const del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+
+  /**
+   * Approximates the complement of the error function erfc() for x > 4.0 using
+   * this function:
+   *
+   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +
+   *               n
+   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
+   *              j=0
+   */
+  function erfc3(y) {
+    let ysq = 1 / (y * y);
+    let xnum = P[2][5] * ysq;
+    let xden = ysq;
+    let i;
+    for (i = 0; i < 4; i += 1) {
+      xnum = (xnum + P[2][i]) * ysq;
+      xden = (xden + Q[2][i]) * ysq;
+    }
+    let result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
+    result = (SQRPI - result) / y;
+    ysq = parseInt(y * 16) / 16;
+    const del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+});
+
+/**
+ * Upper bound for the first approximation interval, 0 <= x <= THRESH
+ * @constant
+ */
+const THRESH = 0.46875;
+
+/**
+ * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
+ * @constant
+ */
+const SQRPI = 5.6418958354775628695e-1;
+
+/**
+ * Coefficients for each term of the numerator sum (p_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+const P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
+
+/**
+ * Coefficients for each term of the denominator sum (q_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+const Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
+
+/**
+ * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
+ * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
+ * return 1
+ */
+const MAX_NUM = Math.pow(2, 53);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/special/zeta.js b/node_modules/mathjs/lib/cjs/function/special/zeta.js
new file mode 100644
index 0000000..2dad474
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/special/zeta.js
@@ -0,0 +1,154 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createZeta = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'zeta';
+const dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi'];
+const createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    multiply,
+    pow,
+    divide,
+    factorial,
+    equal,
+    smallerEq,
+    isNegative,
+    gamma,
+    sin,
+    subtract,
+    add,
+    Complex,
+    BigNumber,
+    pi
+  } = _ref;
+  /**
+   * Compute the Riemann Zeta function of a value using an infinite series for
+   * all of the complex plane using Riemann's Functional equation.
+   *
+   * Based off the paper by Xavier Gourdon and Pascal Sebah
+   * ( http://numbers.computation.free.fr/Constants/Miscellaneous/zetaevaluations.pdf )
+   *
+   * Implementation and slight modification by Anik Patel
+   *
+   * Note: the implementation is accurate up to about 6 digits.
+   *
+   * Syntax:
+   *
+   *    math.zeta(n)
+   *
+   * Examples:
+   *
+   *    math.zeta(5)       // returns 1.0369277551433895
+   *    math.zeta(-0.5)    // returns -0.2078862249773449
+   *    math.zeta(math.i)  // returns 0.0033002236853253153 - 0.4181554491413212i
+   *
+   * See also:
+   *    erf
+   *
+   * @param {number | Complex | BigNumber} s   A Real, Complex or BigNumber parameter to the Riemann Zeta Function
+   * @return {number | Complex | BigNumber}    The Riemann Zeta of `s`
+   */
+  return typed(name, {
+    number: s => zetaNumeric(s, value => value, () => 20),
+    BigNumber: s => zetaNumeric(s, value => new BigNumber(value), () => {
+      // relTol is for example 1e-12. Extract the positive exponent 12 from that
+      return Math.abs(Math.log10(config.relTol));
+    }),
+    Complex: zetaComplex
+  });
+
+  /**
+   * @param {number | BigNumber} s
+   * @param {(value: number) => number | BigNumber} createValue
+   * @param {(value: number | BigNumber | Complex) => number} determineDigits
+   * @returns {number | BigNumber}
+   */
+  function zetaNumeric(s, createValue, determineDigits) {
+    if (equal(s, 0)) {
+      return createValue(-0.5);
+    }
+    if (equal(s, 1)) {
+      return createValue(NaN);
+    }
+    if (!isFinite(s)) {
+      return isNegative(s) ? createValue(NaN) : createValue(1);
+    }
+    return zeta(s, createValue, determineDigits, s => s);
+  }
+
+  /**
+   * @param {Complex} s
+   * @returns {Complex}
+   */
+  function zetaComplex(s) {
+    if (s.re === 0 && s.im === 0) {
+      return new Complex(-0.5);
+    }
+    if (s.re === 1) {
+      return new Complex(NaN, NaN);
+    }
+    if (s.re === Infinity && s.im === 0) {
+      return new Complex(1);
+    }
+    if (s.im === Infinity || s.re === -Infinity) {
+      return new Complex(NaN, NaN);
+    }
+    return zeta(s, value => value, s => Math.round(1.3 * 15 + 0.9 * Math.abs(s.im)), s => s.re);
+  }
+
+  /**
+   * @param {number | BigNumber | Complex} s
+   * @param {(value: number) => number | BigNumber | Complex} createValue
+   * @param {(value: number | BigNumber | Complex) => number} determineDigits
+   * @param {(value: number | BigNumber | Complex) => number} getRe
+   * @returns {*|number}
+   */
+  function zeta(s, createValue, determineDigits, getRe) {
+    const n = determineDigits(s);
+    if (getRe(s) > -(n - 1) / 2) {
+      return f(s, createValue(n), createValue);
+    } else {
+      // Function Equation for reflection to x < 1
+      let c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)));
+      c = multiply(c, sin(multiply(divide(createValue(pi), 2), s)));
+      c = multiply(c, gamma(subtract(1, s)));
+      return multiply(c, zeta(subtract(1, s), createValue, determineDigits, getRe));
+    }
+  }
+
+  /**
+   * Calculate a portion of the sum
+   * @param {number | BigNumber} k   a positive integer
+   * @param {number | BigNumber} n   a positive integer
+   * @return {number}    the portion of the sum
+   **/
+  function d(k, n) {
+    let S = k;
+    for (let j = k; smallerEq(j, n); j = add(j, 1)) {
+      const factor = divide(multiply(factorial(add(n, subtract(j, 1))), pow(4, j)), multiply(factorial(subtract(n, j)), factorial(multiply(2, j))));
+      S = add(S, factor);
+    }
+    return multiply(n, S);
+  }
+
+  /**
+   * Calculate the positive Riemann Zeta function
+   * @param {number} s   a real or complex number with s.re > 1
+   * @param {number} n   a positive integer
+   * @param {(number) => number | BigNumber | Complex} createValue
+   * @return {number}    Riemann Zeta of s
+   **/
+  function f(s, n, createValue) {
+    const c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))));
+    let S = createValue(0);
+    for (let k = createValue(1); smallerEq(k, n); k = add(k, 1)) {
+      S = add(S, divide(multiply((-1) ** (k - 1), d(k, n)), pow(k, s)));
+    }
+    return multiply(c, S);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/corr.js b/node_modules/mathjs/lib/cjs/function/statistics/corr.js
new file mode 100644
index 0000000..aecef66
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/corr.js
@@ -0,0 +1,90 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCorr = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'corr';
+const dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide'];
+const createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    sqrt,
+    sum,
+    add,
+    subtract,
+    multiply,
+    pow,
+    divide
+  } = _ref;
+  /**
+   * Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.
+   *
+   * Syntax:
+   *
+   *     math.corr(A, B)
+   *
+   * Examples:
+   *
+   *     math.corr([1, 2, 3, 4, 5], [4, 5, 6, 7, 8])     // returns 1
+   *     math.corr([1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8])     //returns 0.9569941688503644
+   *     math.corr([[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]],[[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]])   // returns [1,1]
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array | Matrix} A The first array or matrix to compute correlation coefficient
+   * @param {Array | Matrix} B The second array or matrix to compute correlation coefficient
+   * @return {*} The correlation coefficient
+   */
+  return typed(name, {
+    'Array, Array': function (A, B) {
+      return _corr(A, B);
+    },
+    'Matrix, Matrix': function (A, B) {
+      const res = _corr(A.toArray(), B.toArray());
+      return Array.isArray(res) ? matrix(res) : res;
+    }
+  });
+  /**
+   * Calculate the correlation coefficient between two arrays or matrices.
+   * @param {Array | Matrix} A
+   * @param {Array | Matrix} B
+   * @return {*} correlation coefficient
+   * @private
+   */
+  function _corr(A, B) {
+    const correlations = [];
+    if (Array.isArray(A[0]) && Array.isArray(B[0])) {
+      if (A.length !== B.length) {
+        throw new SyntaxError('Dimension mismatch. Array A and B must have the same length.');
+      }
+      for (let i = 0; i < A.length; i++) {
+        if (A[i].length !== B[i].length) {
+          throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');
+        }
+        correlations.push(correlation(A[i], B[i]));
+      }
+      return correlations;
+    } else {
+      if (A.length !== B.length) {
+        throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');
+      }
+      return correlation(A, B);
+    }
+  }
+  function correlation(A, B) {
+    const n = A.length;
+    const sumX = sum(A);
+    const sumY = sum(B);
+    const sumXY = A.reduce((acc, x, index) => add(acc, multiply(x, B[index])), 0);
+    const sumXSquare = sum(A.map(x => pow(x, 2)));
+    const sumYSquare = sum(B.map(y => pow(y, 2)));
+    const numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY));
+    const denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))));
+    return divide(numerator, denominator);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js b/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js
new file mode 100644
index 0000000..70151d5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/cumsum.js
@@ -0,0 +1,129 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCumSum = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _switch2 = require("../../utils/switch.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+var _array = require("../../utils/array.js");
+var _IndexError = require("../../error/IndexError.js");
+const name = 'cumsum';
+const dependencies = ['typed', 'add', 'unaryPlus'];
+const createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+  /**
+   * Compute the cumulative sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the cumulative sums
+   * along a specified dimension (defaulting to the first) will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.cumsum(a, b, c, ...)
+   *     math.cumsum(A)
+   *
+   * Examples:
+   *
+   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]
+   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]
+   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]
+   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, sum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The cumulative sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    Array: _cumsum,
+    Matrix: function (matrix) {
+      return matrix.create(_cumsum(matrix.valueOf(), matrix.datatype()));
+    },
+    // sum([a, b, c, d, ...], dim)
+    'Array, number | BigNumber': _ncumSumDim,
+    'Matrix, number | BigNumber': function (matrix, dim) {
+      return matrix.create(_ncumSumDim(matrix.valueOf(), dim), matrix.datatype());
+    },
+    // cumsum(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('All values expected to be scalar in function cumsum');
+      }
+      return _cumsum(args);
+    }
+  });
+
+  /**
+     * Recursively calculate the cumulative sum of an n-dimensional array
+     * @param {Array} array
+     * @return {number} cumsum
+     * @private
+     */
+  function _cumsum(array) {
+    try {
+      return _cumsummap(array);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
+    }
+  }
+  function _cumsummap(array) {
+    if (array.length === 0) {
+      return [];
+    }
+    const sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
+    for (let i = 1; i < array.length; ++i) {
+      // Must use add below and not addScalar for the case of summing a
+      // 2+-dimensional array along the 0th dimension (the row vectors,
+      // or higher-d analogues, are literally added to each other).
+      sums.push(add(sums[i - 1], array[i]));
+    }
+    return sums;
+  }
+  function _ncumSumDim(array, dim) {
+    const size = (0, _array.arraySize)(array);
+    if (dim < 0 || dim >= size.length) {
+      // TODO: would be more clear when throwing a DimensionError here
+      throw new _IndexError.IndexError(dim, size.length);
+    }
+    try {
+      return _cumsumDimensional(array, dim);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
+    }
+  }
+
+  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
+  function _cumsumDimensional(mat, dim) {
+    let i, ret, tran;
+    if (dim <= 0) {
+      const initialValue = mat[0][0];
+      if (!Array.isArray(initialValue)) {
+        return _cumsummap(mat);
+      } else {
+        tran = (0, _switch2._switch)(mat);
+        ret = [];
+        for (i = 0; i < tran.length; i++) {
+          ret[i] = _cumsumDimensional(tran[i], dim - 1);
+        }
+        return ret;
+      }
+    } else {
+      ret = [];
+      for (i = 0; i < mat.length; i++) {
+        ret[i] = _cumsumDimensional(mat[i], dim - 1);
+      }
+      return ret;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mad.js b/node_modules/mathjs/lib/cjs/function/statistics/mad.js
new file mode 100644
index 0000000..2a7e1b7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mad.js
@@ -0,0 +1,70 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMad = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'mad';
+const dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
+const createMad = exports.createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    map,
+    median,
+    subtract
+  } = _ref;
+  /**
+   * Compute the median absolute deviation of a matrix or a list with values.
+   * The median absolute deviation is defined as the median of the absolute
+   * deviations from the median.
+   *
+   * Syntax:
+   *
+   *     math.mad(a, b, c, ...)
+   *     math.mad(A)
+   *
+   * Examples:
+   *
+   *     math.mad(10, 20, 30)             // returns 10
+   *     math.mad([1, 2, 3])              // returns 1
+   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
+   *
+   * See also:
+   *
+   *     median, mean, std, abs
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or multiple scalar values.
+   * @return {*} The median absolute deviation.
+   */
+  return typed(name, {
+    // mad([a, b, c, d, ...])
+    'Array | Matrix': _mad,
+    // mad(a, b, c, d, ...)
+    '...': function (args) {
+      return _mad(args);
+    }
+  });
+  function _mad(array) {
+    array = (0, _array.flatten)(array.valueOf());
+    if (array.length === 0) {
+      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
+    }
+    try {
+      const med = median(array);
+      return median(map(array, function (value) {
+        return abs(subtract(value, med));
+      }));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.includes('median')) {
+        throw new TypeError(err.message.replace('median', 'mad'));
+      } else {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mad');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/max.js b/node_modules/mathjs/lib/cjs/function/statistics/max.js
new file mode 100644
index 0000000..ed0d1a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/max.js
@@ -0,0 +1,112 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMax = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'max';
+const dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];
+const createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the maximum value of a matrix or a  list with values.
+   * In case of a multidimensional array, the maximum of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.max(a, b, c, ...)
+   *     math.max(A)
+   *     math.max(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.max(2, 1, 4, 3)                  // returns 4
+   *     math.max([2, 1, 4, 3])                // returns 4
+   *
+   *     // maximum over a specified dimension (zero-based)
+   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
+   *     math.max([[2, 5], [4, 3], [1, 7]], 1) // returns [5, 4, 7]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, min, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The maximum value
+   */
+  return typed(name, {
+    // max([a, b, c, d, ...])
+    'Array | Matrix': _max,
+    // max([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function (array, dim) {
+      return (0, _collection.reduce)(array, dim.valueOf(), _largest);
+    },
+    // max(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function max');
+      }
+      return _max(args);
+    }
+  });
+
+  /**
+   * Return the largest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is largest, or y when y is largest
+   * @private
+   */
+  function _largest(x, y) {
+    try {
+      return larger(x, y) ? x : y;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', y);
+    }
+  }
+
+  /**
+   * Recursively calculate the maximum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} max
+   * @private
+   */
+  function _max(array) {
+    let res;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        if (mathIsNaN(value)) {
+          res = value;
+        } else if (res === undefined || larger(value, res)) {
+          res = value;
+        }
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'max', value);
+      }
+    });
+    if (res === undefined) {
+      throw new Error('Cannot calculate max of an empty array');
+    }
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof res === 'string') {
+      res = numeric(res, (0, _number.safeNumberType)(res, config));
+    }
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mean.js b/node_modules/mathjs/lib/cjs/function/statistics/mean.js
new file mode 100644
index 0000000..3bc247f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mean.js
@@ -0,0 +1,100 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMean = void 0;
+var _collection = require("../../utils/collection.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'mean';
+const dependencies = ['typed', 'add', 'divide'];
+const createMean = exports.createMean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    divide
+  } = _ref;
+  /**
+   * Compute the mean value of matrix or a list with values.
+   * In case of a multidimensional array, the mean of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.mean(a, b, c, ...)
+   *     math.mean(A)
+   *     math.mean(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.mean(2, 1, 4, 3)                     // returns 2.5
+   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725
+   *
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]
+   *
+   * See also:
+   *
+   *     median, min, max, sum, prod, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The mean of all values
+   */
+  return typed(name, {
+    // mean([a, b, c, d, ...])
+    'Array | Matrix': _mean,
+    // mean([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nmeanDim,
+    // mean(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function mean');
+      }
+      return _mean(args);
+    }
+  });
+
+  /**
+   * Calculate the mean value in an n-dimensional array, returning a
+   * n-1 dimensional array
+   * @param {Array} array
+   * @param {number} dim
+   * @return {number} mean
+   * @private
+   */
+  function _nmeanDim(array, dim) {
+    try {
+      const sum = (0, _collection.reduce)(array, dim, add);
+      const s = Array.isArray(array) ? (0, _array.arraySize)(array) : array.size();
+      return divide(sum, s[dim]);
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean');
+    }
+  }
+
+  /**
+   * Recursively calculate the mean value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} mean
+   * @private
+   */
+  function _mean(array) {
+    let sum;
+    let num = 0;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'mean', value);
+      }
+    });
+    if (num === 0) {
+      throw new Error('Cannot calculate the mean of an empty array');
+    }
+    return divide(sum, num);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/median.js b/node_modules/mathjs/lib/cjs/function/statistics/median.js
new file mode 100644
index 0000000..6110dd5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/median.js
@@ -0,0 +1,114 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMedian = void 0;
+var _collection = require("../../utils/collection.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'median';
+const dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];
+const createMedian = exports.createMedian = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    divide,
+    compare,
+    partitionSelect
+  } = _ref;
+  /**
+   * Recursively calculate the median of an n-dimensional array
+   * @param {Array} array
+   * @return {Number} median
+   * @private
+   */
+  function _median(array) {
+    try {
+      array = (0, _array.flatten)(array.valueOf());
+      const num = array.length;
+      if (num === 0) {
+        throw new Error('Cannot calculate median of an empty array');
+      }
+      if (num % 2 === 0) {
+        // even: return the average of the two middle values
+        const mid = num / 2 - 1;
+        const right = partitionSelect(array, mid + 1);
+
+        // array now partitioned at mid + 1, take max of left part
+        let left = array[mid];
+        for (let i = 0; i < mid; ++i) {
+          if (compare(array[i], left) > 0) {
+            left = array[i];
+          }
+        }
+        return middle2(left, right);
+      } else {
+        // odd: return the middle value
+        const m = partitionSelect(array, (num - 1) / 2);
+        return middle(m);
+      }
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'median');
+    }
+  }
+
+  // helper function to type check the middle value of the array
+  const middle = typed({
+    'number | BigNumber | Complex | Unit': function (value) {
+      return value;
+    }
+  });
+
+  // helper function to type check the two middle value of the array
+  const middle2 = typed({
+    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function (left, right) {
+      return divide(add(left, right), 2);
+    }
+  });
+
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned.
+   * Supported types of values are: Number, BigNumber, Unit
+   *
+   * In case of a (multi dimensional) array or matrix, the median of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.median(a, b, c, ...)
+   *     math.median(A)
+   *
+   * Examples:
+   *
+   *     math.median(5, 2, 7)        // returns 5
+   *     math.median([3, -1, 5, 7])  // returns 4
+   *
+   * See also:
+   *
+   *     mean, min, max, sum, prod, std, variance, quantileSeq
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The median
+   */
+  return typed(name, {
+    // median([a, b, c, d, ...])
+    'Array | Matrix': _median,
+    // median([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function (array, dim) {
+      // TODO: implement median(A, dim)
+      throw new Error('median(A, dim) is not yet supported');
+      // return reduce(arguments[0], arguments[1], ...)
+    },
+    // median(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function median');
+      }
+      return _median(args);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/min.js b/node_modules/mathjs/lib/cjs/function/statistics/min.js
new file mode 100644
index 0000000..30c9c60
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/min.js
@@ -0,0 +1,112 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMin = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'min';
+const dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];
+const createMin = exports.createMin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the minimum value of a matrix or a  list of values.
+   * In case of a multidimensional array, the minimum of the flattened array
+   * will be calculated. When `dim` is provided, the minimum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.min(a, b, c, ...)
+   *     math.min(A)
+   *     math.min(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.min(2, 1, 4, 3)                  // returns 1
+   *     math.min([2, 1, 4, 3])                // returns 1
+   *
+   *     // minimum over a specified dimension (zero-based)
+   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
+   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, max, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The minimum value
+   */
+  return typed(name, {
+    // min([a, b, c, d, ...])
+    'Array | Matrix': _min,
+    // min([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function (array, dim) {
+      return (0, _collection.reduce)(array, dim.valueOf(), _smallest);
+    },
+    // min(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function min');
+      }
+      return _min(args);
+    }
+  });
+
+  /**
+   * Return the smallest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is smallest, or y when y is smallest
+   * @private
+   */
+  function _smallest(x, y) {
+    try {
+      return smaller(x, y) ? x : y;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'min', y);
+    }
+  }
+
+  /**
+   * Recursively calculate the minimum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} min
+   * @private
+   */
+  function _min(array) {
+    let min;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        if (mathIsNaN(value)) {
+          min = value;
+        } else if (min === undefined || smaller(value, min)) {
+          min = value;
+        }
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'min', value);
+      }
+    });
+    if (min === undefined) {
+      throw new Error('Cannot calculate min of an empty array');
+    }
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof min === 'string') {
+      min = numeric(min, (0, _number.safeNumberType)(min, config));
+    }
+    return min;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/mode.js b/node_modules/mathjs/lib/cjs/function/statistics/mode.js
new file mode 100644
index 0000000..e234e1d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/mode.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMode = void 0;
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'mode';
+const dependencies = ['typed', 'isNaN', 'isNumeric'];
+const createMode = exports.createMode = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isNaN: mathIsNaN,
+    isNumeric
+  } = _ref;
+  /**
+  * Computes the mode of a set of numbers or a list with values(numbers or characters).
+  * If there are multiple modes, it returns a list of those values.
+  *
+  * Syntax:
+  *
+  *     math.mode(a, b, c, ...)
+  *     math.mode(A)
+  *
+  * Examples:
+  *
+  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]
+  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]
+  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]
+  *     math.mode('a','a','b','c')                           // returns ["a"]
+  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, "abc"]
+  *
+  * See also:
+  *
+  *     median,
+  *     mean
+  *
+  * @param {... *} args  A single matrix
+  * @return {*} The mode of all values
+  */
+  return typed(name, {
+    'Array | Matrix': _mode,
+    '...': function (args) {
+      return _mode(args);
+    }
+  });
+
+  /**
+   * Calculates the mode in an 1-dimensional array
+   * @param {Array} values
+   * @return {Array} mode
+   * @private
+   */
+  function _mode(values) {
+    values = (0, _array.flatten)(values.valueOf());
+    const num = values.length;
+    if (num === 0) {
+      throw new Error('Cannot calculate mode of an empty array');
+    }
+    const count = {};
+    let mode = [];
+    let max = 0;
+    for (let i = 0; i < values.length; i++) {
+      const value = values[i];
+      if (isNumeric(value) && mathIsNaN(value)) {
+        throw new Error('Cannot calculate mode of an array containing NaN values');
+      }
+      if (!(value in count)) {
+        count[value] = 0;
+      }
+      count[value]++;
+      if (count[value] === max) {
+        mode.push(value);
+      } else if (count[value] > max) {
+        max = count[value];
+        mode = [value];
+      }
+    }
+    return mode;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/prod.js b/node_modules/mathjs/lib/cjs/function/statistics/prod.js
new file mode 100644
index 0000000..4506444
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/prod.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createProd = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'prod';
+const dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];
+const createProd = exports.createProd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    multiplyScalar,
+    numeric
+  } = _ref;
+  /**
+   * Compute the product of a matrix or a list with values.
+   * In case of a multidimensional array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.prod(a, b, c, ...)
+   *     math.prod(A)
+   *
+   * Examples:
+   *
+   *     math.multiply(2, 3)           // returns 6
+   *     math.prod(2, 3)               // returns 6
+   *     math.prod(2, 3, 4)            // returns 24
+   *     math.prod([2, 3, 4])          // returns 24
+   *     math.prod([[2, 5], [4, 3]])   // returns 120
+   *
+   * See also:
+   *
+   *    mean, median, min, max, sum, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The product of all values
+   */
+  return typed(name, {
+    // prod([a, b, c, d, ...])
+    'Array | Matrix': _prod,
+    // prod([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function (array, dim) {
+      // TODO: implement prod(A, dim)
+      throw new Error('prod(A, dim) is not yet supported');
+      // return reduce(arguments[0], arguments[1], math.prod)
+    },
+    // prod(a, b, c, d, ...)
+    '...': function (args) {
+      return _prod(args);
+    }
+  });
+
+  /**
+   * Recursively calculate the product of an n-dimensional array
+   * @param {Array} array
+   * @return {number} prod
+   * @private
+   */
+  function _prod(array) {
+    let prod;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        prod = prod === undefined ? value : multiplyScalar(prod, value);
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'prod', value);
+      }
+    });
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof prod === 'string') {
+      prod = numeric(prod, (0, _number.safeNumberType)(prod, config));
+    }
+    if (prod === undefined) {
+      throw new Error('Cannot calculate prod of an empty array');
+    }
+    return prod;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..fce9b25
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/quantileSeq.js
@@ -0,0 +1,167 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createQuantileSeq = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+const name = 'quantileSeq';
+const dependencies = ['typed', '?bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];
+const createQuantileSeq = exports.createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  } = _ref;
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned.
+   * Supported types of sequence values are: Number, BigNumber, Unit
+   * Supported types of probability are: Number, BigNumber
+   *
+   * In case of a multidimensional array or matrix, the prob order quantile
+   * of all elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.quantileSeq(A, prob[, sorted])
+   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])
+   *     math.quantileSeq(A, N[, sorted])
+   *
+   * Examples:
+   *
+   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4
+   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]
+   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]
+   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array, Matrix} data                A single matrix or Array
+   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is
+   *                                            the amount of evenly distributed steps of
+   *                                            probabilities; only one of these options can
+   *                                            be provided
+   * @param {Boolean} sorted=false              is data sorted in ascending order
+   * @return {Number, BigNumber, Unit, Array}   Quantile(s)
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber': (data, p) => _quantileSeqProbNumber(data, p, false),
+    'Array | Matrix, number | BigNumber, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbNumber),
+    'Array | Matrix, number | BigNumber, boolean': _quantileSeqProbNumber,
+    'Array | Matrix, number | BigNumber, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbNumber),
+    'Array | Matrix, Array | Matrix': (data, p) => _quantileSeqProbCollection(data, p, false),
+    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbCollection),
+    'Array | Matrix, Array | Matrix, boolean': _quantileSeqProbCollection,
+    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbCollection)
+  });
+  function _quantileSeqDim(data, prob, sorted, dim, fn) {
+    return mapSlices(data, dim, x => fn(x, prob, sorted));
+  }
+  function _quantileSeqProbNumber(data, probOrN, sorted) {
+    let probArr;
+    const dataArr = data.valueOf();
+    if (smaller(probOrN, 0)) {
+      throw new Error('N/prob must be non-negative');
+    }
+    if (smallerEq(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], prob[,sorted])
+      return (0, _is.isNumber)(probOrN) ? _quantileSeq(dataArr, probOrN, sorted) : bignumber(_quantileSeq(dataArr, probOrN, sorted));
+    }
+    if (larger(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], N[,sorted])
+      if (!isInteger(probOrN)) {
+        throw new Error('N must be a positive integer');
+      }
+
+      // largest possible Array length is 2^32-1
+      // 2^32 < 10^15, thus safe conversion guaranteed
+      if (larger(probOrN, 4294967295)) {
+        throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
+      }
+      const nPlusOne = add(probOrN, 1);
+      probArr = [];
+      for (let i = 0; smaller(i, probOrN); i++) {
+        const prob = divide(i + 1, nPlusOne);
+        probArr.push(_quantileSeq(dataArr, prob, sorted));
+      }
+      return (0, _is.isNumber)(probOrN) ? probArr : bignumber(probArr);
+    }
+  }
+
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array, Matrix} array
+   * @param {Array, Matrix} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+
+  function _quantileSeqProbCollection(data, probOrN, sorted) {
+    const dataArr = data.valueOf();
+    // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
+    const probOrNArr = probOrN.valueOf();
+    const probArr = [];
+    for (let i = 0; i < probOrNArr.length; ++i) {
+      probArr.push(_quantileSeq(dataArr, probOrNArr[i], sorted));
+    }
+    return probArr;
+  }
+
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array} array
+   * @param {Number, BigNumber} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+  function _quantileSeq(array, prob, sorted) {
+    const flat = (0, _array.flatten)(array);
+    const len = flat.length;
+    if (len === 0) {
+      throw new Error('Cannot calculate quantile of an empty sequence');
+    }
+    const index = (0, _is.isNumber)(prob) ? prob * (len - 1) : prob.times(len - 1);
+    const integerPart = (0, _is.isNumber)(prob) ? Math.floor(index) : index.floor().toNumber();
+    const fracPart = (0, _is.isNumber)(prob) ? index % 1 : index.minus(integerPart);
+    if (isInteger(index)) {
+      return sorted ? flat[index] : partitionSelect(flat, (0, _is.isNumber)(prob) ? index : index.valueOf());
+    }
+    let left;
+    let right;
+    if (sorted) {
+      left = flat[integerPart];
+      right = flat[integerPart + 1];
+    } else {
+      right = partitionSelect(flat, integerPart + 1);
+
+      // max of partition is kth largest
+      left = flat[integerPart];
+      for (let i = 0; i < integerPart; ++i) {
+        if (compare(flat[i], left) > 0) {
+          left = flat[i];
+        }
+      }
+    }
+    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+    return add(multiply(left, subtract(1, fracPart)), multiply(right, fracPart));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/std.js b/node_modules/mathjs/lib/cjs/function/statistics/std.js
new file mode 100644
index 0000000..9cc1bba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/std.js
@@ -0,0 +1,103 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createStd = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'std';
+const dependencies = ['typed', 'map', 'sqrt', 'variance'];
+const createStd = exports.createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    map,
+    sqrt,
+    variance
+  } = _ref;
+  /**
+   * Compute the standard deviation of a matrix or a  list with values.
+   * The standard deviations is defined as the square root of the variance:
+   * `std(A) = sqrt(variance(A))`.
+   * In case of a (multi dimensional) array or matrix, the standard deviation
+   * over all elements will be calculated by default, unless an axis is specified
+   * in which case the standard deviation will be computed along that axis.
+   *
+   * Additionally, it is possible to compute the standard deviation along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Syntax:
+   *
+   *     math.std(a, b, c, ...)
+   *     math.std(A)
+   *     math.std(A, normalization)
+   *     math.std(A, dimension)
+   *     math.std(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.std(2, 4, 6)                     // returns 2
+   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611
+   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
+   *     math.std([2, 4, 6, 8], 'biased')      // returns 2
+   *
+   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707
+   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, sum, variance
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the standard deviation for a matrix
+   * @return {*} The standard deviation
+   */
+  return typed(name, {
+    // std([a, b, c, d, ...])
+    'Array | Matrix': _std,
+    // std([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _std,
+    // std([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': _std,
+    // std([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _std,
+    // std(a, b, c, d, ...)
+    '...': function (args) {
+      return _std(args);
+    }
+  });
+  function _std(array, normalization) {
+    if (array.length === 0) {
+      throw new SyntaxError('Function std requires one or more parameters (0 provided)');
+    }
+    try {
+      const v = variance.apply(null, arguments);
+      if ((0, _is.isCollection)(v)) {
+        return map(v, sqrt);
+      } else {
+        return sqrt(v);
+      }
+    } catch (err) {
+      if (err instanceof TypeError && err.message.includes(' variance')) {
+        throw new TypeError(err.message.replace(' variance', ' std'));
+      } else {
+        throw err;
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/sum.js b/node_modules/mathjs/lib/cjs/function/statistics/sum.js
new file mode 100644
index 0000000..533593d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/sum.js
@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSum = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const name = 'sum';
+const dependencies = ['typed', 'config', 'add', 'numeric'];
+const createSum = exports.createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+  /**
+   * Compute the sum of a matrix or a list with values.
+   * In case of a multidimensional array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.sum(a, b, c, ...)
+   *     math.sum(A)
+   *     math.sum(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.sum(2, 1, 4, 3)               // returns 10
+   *     math.sum([2, 1, 4, 3])             // returns 10
+   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, cumsum
+   *
+   * @param {... *} args  A single matrix or multiple scalar values
+   * @return {*} The sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    'Array | Matrix': _sum,
+    // sum([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nsumDim,
+    // sum(a, b, c, d, ...)
+    '...': function (args) {
+      if ((0, _collection.containsCollections)(args)) {
+        throw new TypeError('Scalar values expected in function sum');
+      }
+      return _sum(args);
+    }
+  });
+
+  /**
+   * Recursively calculate the sum of an n-dimensional array
+   * @param {Array | Matrix} array
+   * @return {number} sum
+   * @private
+   */
+  function _sum(array) {
+    let sum;
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum', value);
+      }
+    });
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (sum === undefined) {
+      sum = numeric(0, config.number);
+    }
+    if (typeof sum === 'string') {
+      sum = numeric(sum, (0, _number.safeNumberType)(sum, config));
+    }
+    return sum;
+  }
+  function _nsumDim(array, dim) {
+    try {
+      const sum = (0, _collection.reduce)(array, dim, add);
+      return sum;
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js b/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js
new file mode 100644
index 0000000..e411eb8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/utils/improveErrorMessage.js
@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.improveErrorMessage = improveErrorMessage;
+var _is = require("../../../utils/is.js");
+/**
+ * Improve error messages for statistics functions. Errors are typically
+ * thrown in an internally used function like larger, causing the error
+ * not to mention the function (like max) which is actually used by the user.
+ *
+ * @param {Error} err
+ * @param {String} fnName
+ * @param {*} [value]
+ * @return {Error}
+ */
+function improveErrorMessage(err, fnName, value) {
+  // TODO: add information with the index (also needs transform in expression parser)
+  let details;
+  if (String(err).includes('Unexpected type')) {
+    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
+    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
+  }
+  if (String(err).includes('complex numbers')) {
+    details = arguments.length > 2 ? ' (type: ' + (0, _is.typeOf)(value) + ', value: ' + JSON.stringify(value) + ')' : '';
+    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
+  }
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/statistics/variance.js b/node_modules/mathjs/lib/cjs/function/statistics/variance.js
new file mode 100644
index 0000000..ee1e3e1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/statistics/variance.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createVariance = void 0;
+var _collection = require("../../utils/collection.js");
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _improveErrorMessage = require("./utils/improveErrorMessage.js");
+const DEFAULT_NORMALIZATION = 'unbiased';
+const name = 'variance';
+const dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];
+const createVariance = exports.createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the variance of a matrix or a  list with values.
+   * In case of a multidimensional array or matrix, the variance over all
+   * elements will be calculated.
+   *
+   * Additionally, it is possible to compute the variance along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Note that older browser may not like the variable name `var`. In that
+   * case, the function can be called as `math['var'](...)` instead of
+   * `math.var(...)`.
+   *
+   * Syntax:
+   *
+   *     math.variance(a, b, c, ...)
+   *     math.variance(A)
+   *     math.variance(A, normalization)
+   *     math.variance(A, dimension)
+   *     math.variance(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.variance(2, 4, 6)                     // returns 4
+   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667
+   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
+   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4
+   *
+   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, std, sum
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the variance for a matrix
+   * @return {*} The variance
+   */
+  return typed(name, {
+    // variance([a, b, c, d, ...])
+    'Array | Matrix': function (array) {
+      return _var(array, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _var,
+    // variance([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': function (array, dim) {
+      return _varDim(array, dim, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _varDim,
+    // variance(a, b, c, d, ...)
+    '...': function (args) {
+      return _var(args, DEFAULT_NORMALIZATION);
+    }
+  });
+
+  /**
+   * Recursively calculate the variance of an n-dimensional array
+   * @param {Array} array
+   * @param {string} normalization
+   *                        Determines how to normalize the variance:
+   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)
+   *                        - 'uncorrected' The sum of squared errors is divided by n
+   *                        - 'biased'      The sum of squared errors is divided by (n + 1)
+   * @return {number | BigNumber} variance
+   * @private
+   */
+  function _var(array, normalization) {
+    let sum;
+    let num = 0;
+    if (array.length === 0) {
+      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+    }
+
+    // calculate the mean and number of elements
+    (0, _collection.deepForEach)(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance', value);
+      }
+    });
+    if (num === 0) throw new Error('Cannot calculate variance of an empty array');
+    const mean = divide(sum, num);
+
+    // calculate the variance
+    sum = undefined;
+    (0, _collection.deepForEach)(array, function (value) {
+      const diff = subtract(value, mean);
+      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));
+    });
+    if (mathIsNaN(sum)) {
+      return sum;
+    }
+    switch (normalization) {
+      case 'uncorrected':
+        return divide(sum, num);
+      case 'biased':
+        return divide(sum, num + 1);
+      case 'unbiased':
+        {
+          const zero = (0, _is.isBigNumber)(sum) ? sum.mul(0) : 0;
+          return num === 1 ? zero : divide(sum, num - 1);
+        }
+      default:
+        throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
+    }
+  }
+  function _varDim(array, dim, normalization) {
+    try {
+      if (array.length === 0) {
+        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+      }
+      return mapSlices(array, dim, x => _var(x, normalization));
+    } catch (err) {
+      throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/bin.js b/node_modules/mathjs/lib/cjs/function/string/bin.js
new file mode 100644
index 0000000..15fb683
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/bin.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBin = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'bin';
+const dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as binary.
+ *
+ * Syntax:
+ *
+ *    math.bin(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0b10"
+ *    math.bin(2)
+ *
+ * See also:
+ *
+ *    oct
+ *    hex
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+const createBin = exports.createBin = (0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function (n) {
+      return format(n, {
+        notation: 'bin'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function (n, wordSize) {
+      return format(n, {
+        notation: 'bin',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/format.js b/node_modules/mathjs/lib/cjs/function/string/format.js
new file mode 100644
index 0000000..8c5db61
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/format.js
@@ -0,0 +1,137 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFormat = void 0;
+var _string = require("../../utils/string.js");
+var _factory = require("../../utils/factory.js");
+const name = 'format';
+const dependencies = ['typed'];
+const createFormat = exports.createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Format a value of any type into a string.
+   *
+   * Syntax:
+   *
+   *    math.format(value)
+   *    math.format(value, options)
+   *    math.format(value, precision)
+   *    math.format(value, callback)
+   *
+   * Where:
+   *
+   *  - `value: *`
+   *    The value to be formatted
+   *  - `options: Object`
+   *    An object with formatting options. Available options:
+   *    - `notation: string`
+   *      Number notation. Choose from:
+   *      - `'fixed'`
+   *        Always use regular number notation.
+   *        For example `'123.40'` and `'14000000'`
+   *      - `'exponential'`
+   *        Always use exponential notation.
+   *        For example `'1.234e+2'` and `'1.4e+7'`
+   *      - `'engineering'`
+   *        Always use engineering notation: always have exponential notation,
+   *        and select the exponent to be a multiple of `3`.
+   *        For example `'123.4e+0'` and `'14.0e+6'`
+   *      - `'auto'` (default)
+   *        Regular number notation for numbers having an absolute value between
+   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.
+   *        Lower bound is included, upper bound is excluded.
+   *        For example `'123.4'` and `'1.4e7'`.
+   *      - `'bin'`, `'oct'`, or `'hex'`
+   *        Format the number using binary, octal, or hexadecimal notation.
+   *        For example `'0b1101'` and `'0x10fe'`.
+   *    - `wordSize: number | BigNumber`
+   *      The word size in bits to use for formatting in binary, octal, or
+   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`
+   *      values for `notation` option. When this option is defined the value
+   *      is formatted as a signed twos complement integer of the given word
+   *      size and the size suffix is appended to the output.
+   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.
+   *      Default value is undefined.
+   *    - `precision: number | BigNumber`
+   *      Limit the number of digits of the formatted value.
+   *      For regular numbers, must be a number between `0` and `16`.
+   *      For bignumbers, the maximum depends on the configured precision,
+   *      see function `config()`.
+   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,
+   *      `precision` defines the total number of significant digits returned.
+   *      In case of notation `'fixed'`, `precision` defines the number of
+   *      significant digits after the decimal point.
+   *      `precision` is undefined by default.
+   *    - `lowerExp: number`
+   *      Exponent determining the lower boundary for formatting a value with
+   *      an exponent when `notation='auto'`. Default value is `-3`.
+   *    - `upperExp: number`
+   *      Exponent determining the upper boundary for formatting a value with
+   *      an exponent when `notation='auto'`. Default value is `5`.
+   *    - `fraction: string`. Available values: `'ratio'` (default) or `'decimal'`.
+   *      For example `format(fraction(1, 3))` will output `'1/3'` when `'ratio'`
+   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.
+   *    - `truncate: number`. Specifies the maximum allowed length of the
+   *      returned string. If it had been longer, the excess characters
+   *      are deleted and replaced with `'...'`.
+   * - `callback: function`
+   *   A custom formatting function, invoked for all numeric elements in `value`,
+   *   for example all elements of a matrix, or the real and imaginary
+   *   parts of a complex number. This callback can be used to override the
+   *   built-in numeric notation with any type of formatting. Function `callback`
+   *   is called with `value` as parameter and must return a string.
+   *
+   * When `value` is an Object:
+   *
+   * - When the object contains a property `format` being a function, this function
+   *   is invoked as `value.format(options)` and the result is returned.
+   * - When the object has its own `toString` method, this method is invoked
+   *   and the result is returned.
+   * - In other cases the function will loop over all object properties and
+   *   return JSON object notation like '{"a": 2, "b": 3}'.
+   *
+   * When value is a function:
+   *
+   * - When the function has a property `syntax`, it returns this
+   *   syntax description.
+   * - In other cases, a string `'function'` is returned.
+   *
+   * Examples:
+   *
+   *    math.format(6.4)                                        // returns '6.4'
+   *    math.format(1240000)                                    // returns '1.24e+6'
+   *    math.format(1/3)                                        // returns '0.3333333333333333'
+   *    math.format(1/3, 3)                                     // returns '0.333'
+   *    math.format(21385, 2)                                   // returns '21000'
+   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'
+   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'
+   *    math.format(12400, {notation: 'engineering'})           // returns '12.4e+3'
+   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'
+   *
+   *    function formatCurrency(value) {
+   *      // return currency notation with two digits:
+   *      return '$' + value.toFixed(2)
+   *
+   *      // you could also use math.format inside the callback:
+   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})
+   *    }
+   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'
+   *
+   * See also:
+   *
+   *    print
+   *
+   * @param {*} value                               Value to be stringified
+   * @param {Object | Function | number} [options]  Formatting options
+   * @return {string} The formatted value
+   */
+  return typed(name, {
+    any: _string.format,
+    'any, Object | function | number | BigNumber': _string.format
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/hex.js b/node_modules/mathjs/lib/cjs/function/string/hex.js
new file mode 100644
index 0000000..8f00345
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/hex.js
@@ -0,0 +1,49 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHex = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'hex';
+const dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as hexadecimal.
+ *
+ * Syntax:
+ *
+ *    math.hex(value)
+ *
+ * Examples:
+ *
+ *    math.hex(240) // returns "0xf0"
+ *
+ * See also:
+ *
+ *    oct
+ *    bin
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+const createHex = exports.createHex = (0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function (n) {
+      return format(n, {
+        notation: 'hex'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function (n, wordSize) {
+      return format(n, {
+        notation: 'hex',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/oct.js b/node_modules/mathjs/lib/cjs/function/string/oct.js
new file mode 100644
index 0000000..1330914
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/oct.js
@@ -0,0 +1,51 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createOct = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'oct';
+const dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as octal.
+ *
+ * Syntax:
+ *
+ *    math.oct(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0o70"
+ *    math.oct(56)
+ *
+ * See also:
+ *
+ *    bin
+ *    hex
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+const createOct = exports.createOct = (0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function (n) {
+      return format(n, {
+        notation: 'oct'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function (n, wordSize) {
+      return format(n, {
+        notation: 'oct',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/string/print.js b/node_modules/mathjs/lib/cjs/function/string/print.js
new file mode 100644
index 0000000..338863d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/string/print.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createPrint = void 0;
+var _string = require("../../utils/string.js");
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _print2 = require("../../utils/print.js");
+const name = 'print';
+const dependencies = ['typed'];
+const createPrint = exports.createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Interpolate values into a string template.
+   *
+   * Syntax:
+   *
+   *     math.print(template, values)
+   *     math.print(template, values, precision)
+   *     math.print(template, values, options)
+   *
+   * Example usage:
+   *
+   *     // the following outputs: 'Lucy is 5 years old'
+   *     math.print('Lucy is $age years old', {age: 5})
+   *
+   *     // the following outputs: 'The value of pi is 3.141592654'
+   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)
+   *
+   *     // the following outputs: 'Hello Mary! The date is 2013-03-23'
+   *     math.print('Hello $user.name! The date is $date', {
+   *       user: {
+   *         name: 'Mary',
+   *       },
+   *       date: '2013-03-23'
+   *     })
+   *
+   *     // the following outputs: 'My favorite fruits are apples and bananas !'
+   *     math.print('My favorite fruits are $0 and $1 !', [
+   *       'apples',
+   *       'bananas'
+   *     ])
+   *
+   * See also:
+   *
+   *     format
+   *
+   * @param {string} template           A string containing variable placeholders.
+   * @param {Object | Array | Matrix}   values An object or array containing variables
+   *                                    which will be filled in in the template.
+   * @param {number | Object} [options] Formatting options,
+   *                                    or the number of digits to format numbers.
+   *                                    See function math.format for a description
+   *                                    of all options.
+   * @return {string} Interpolated string
+   */
+  return typed(name, {
+    // note: Matrix will be converted automatically to an Array
+    'string, Object | Array': _print,
+    'string, Object | Array, number | Object': _print
+  });
+});
+
+/**
+ * Interpolate values into a string template.
+ * @param {string} template
+ * @param {Object} values
+ * @param {number | Object} [options]
+ * @returns {string} Interpolated string
+ * @private
+ */
+function _print(template, values, options) {
+  return template.replace(_print2.printTemplate, function (original, key) {
+    const keys = key.split('.');
+    let value = values[keys.shift()];
+    if (value !== undefined && value.isMatrix) {
+      value = value.toArray();
+    }
+    while (keys.length && value !== undefined) {
+      const k = keys.shift();
+      value = k ? value[k] : value + '.';
+    }
+    if (value !== undefined) {
+      if (!(0, _is.isString)(value)) {
+        return (0, _string.format)(value, options);
+      } else {
+        return value;
+      }
+    }
+    return original;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js
new file mode 100644
index 0000000..1d028c1
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acos.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcos = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'acos';
+const dependencies = ['typed', 'config', 'Complex'];
+const createAcos = exports.createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the inverse cosine of a value.
+   *
+   * To avoid confusion with the matrix arccosine, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acos(x)
+   *
+   * Examples:
+   *
+   *    math.acos(0.5)           // returns number 1.0471975511965979
+   *    math.acos(math.cos(1.5)) // returns number 1.5
+   *
+   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cos, atan, asin
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} The arc cosine of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.acos(x);
+      } else {
+        return new Complex(x, 0).acos();
+      }
+    },
+    Complex: function (x) {
+      return x.acos();
+    },
+    BigNumber: function (x) {
+      return x.acos();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..38a2212
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acosh.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcosh = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'acosh';
+const dependencies = ['typed', 'config', 'Complex'];
+const createAcosh = exports.createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arccos of a value,
+   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acosh(x)
+   *
+   * Examples:
+   *
+   *    math.acosh(1.5)       // returns 0.9624236501192069
+   *
+   * See also:
+   *
+   *    cosh, asinh, atanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccosine of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x >= 1 || config.predictable) {
+        return (0, _index.acoshNumber)(x);
+      }
+      if (x <= -1) {
+        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
+      }
+      return new Complex(x, 0).acosh();
+    },
+    Complex: function (x) {
+      return x.acosh();
+    },
+    BigNumber: function (x) {
+      return x.acosh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js
new file mode 100644
index 0000000..6557853
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acot.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcot = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'acot';
+const dependencies = ['typed', 'BigNumber'];
+const createAcot = exports.createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+   *
+   * To avoid confusion with the matrix arccotanget, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acot(x)
+   *
+   * Examples:
+   *
+   *    math.acot(0.5)           // returns number 1.1071487177940904
+   *    math.acot(2)             // returns number 0.4636476090008061
+   *    math.acot(math.cot(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    cot, atan
+   *
+   * @param {number | BigNumber| Complex} x   Function input
+   * @return {number | BigNumber| Complex} The arc cotangent of x
+   */
+  return typed(name, {
+    number: _index.acotNumber,
+    Complex: function (x) {
+      return x.acot();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).atan();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..76eb637
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acoth.js
@@ -0,0 +1,54 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcoth = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'acoth';
+const dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+const createAcoth = exports.createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse hyperbolic tangent of a value,
+   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+   *
+   * To avoid confusion with the matrix inverse hyperbolic tangent, this
+   * function does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acoth(x)
+   *
+   * Examples:
+   *
+   *    math.acoth(0.5)     // returns 0.5493061443340548 - 1.5707963267948966i
+   *
+   * See also:
+   *
+   *    acsch, asech
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccotangent of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x >= 1 || x <= -1 || config.predictable) {
+        return (0, _index.acothNumber)(x);
+      }
+      return new Complex(x, 0).acoth();
+    },
+    Complex: function (x) {
+      return x.acoth();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).atanh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..c2e0f49
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acsc.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcsc = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'acsc';
+const dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+const createAcsc = exports.createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+   *
+   * To avoid confusion with the matrix arccosecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acsc(x)
+   *
+   * Examples:
+   *
+   *    math.acsc(2)             // returns 0.5235987755982989
+   *    math.acsc(0.5)           // returns Complex 1.5707963267948966 -1.3169578969248166i
+   *    math.acsc(math.csc(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    csc, asin, asec
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc cosecant of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return (0, _index.acscNumber)(x);
+      }
+      return new Complex(x, 0).acsc();
+    },
+    Complex: function (x) {
+      return x.acsc();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).asin();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..e107e5d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/acsch.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAcsch = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'acsch';
+const dependencies = ['typed', 'BigNumber'];
+const createAcsch = exports.createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse hyperbolic cosecant of a value,
+   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+   *
+   * To avoid confusion with the matrix inverse hyperbolic cosecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acsch(x)
+   *
+   * Examples:
+   *
+   *    math.acsch(0.5)       // returns 1.4436354751788103
+   *
+   * See also:
+   *
+   *    asech, acoth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccosecant of x
+   */
+  return typed(name, {
+    number: _index.acschNumber,
+    Complex: function (x) {
+      return x.acsch();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).asinh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js
new file mode 100644
index 0000000..0c12783
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asec.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsec = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'asec';
+const dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+const createAsec = exports.createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
+   *
+   * To avoid confusion with the matrix arcsecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asec(x)
+   *
+   * Examples:
+   *
+   *    math.asec(2)             // returns 1.0471975511965979
+   *    math.asec(math.sec(1.5)) // returns 1.5
+   *
+   *    math.asec(0.5)           // returns Complex 0 + 1.3169578969248166i
+   *
+   * See also:
+   *
+   *    acos, acot, acsc
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} The arc secant of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return (0, _index.asecNumber)(x);
+      }
+      return new Complex(x, 0).asec();
+    },
+    Complex: function (x) {
+      return x.asec();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).acos();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js
new file mode 100644
index 0000000..de716ce
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asech.js
@@ -0,0 +1,59 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsech = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'asech';
+const dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+const createAsech = exports.createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arcsecant of a value,
+   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic arcsecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asech(x)
+   *
+   * Examples:
+   *
+   *    math.asech(0.5)       // returns 1.3169578969248166
+   *
+   * See also:
+   *
+   *    acsch, acoth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arcsecant of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        const xInv = 1 / x;
+        if (xInv > 0 || config.predictable) {
+          return (0, _index.asechNumber)(x);
+        }
+        const ret = Math.sqrt(xInv * xInv - 1);
+        return new Complex(Math.log(ret - xInv), Math.PI);
+      }
+      return new Complex(x, 0).asech();
+    },
+    Complex: function (x) {
+      return x.asech();
+    },
+    BigNumber: function (x) {
+      return new BigNumber(1).div(x).acosh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js
new file mode 100644
index 0000000..0ad73c7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asin.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsin = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'asin';
+const dependencies = ['typed', 'config', 'Complex'];
+const createAsin = exports.createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the inverse sine of a value.
+   *
+   * To avoid confusion with the matric arcsine, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asin(x)
+   *
+   * Examples:
+   *
+   *    math.asin(0.5)           // returns number 0.5235987755982989
+   *    math.asin(math.sin(1.5)) // returns number 1.5
+   *
+   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166i
+   *
+   * See also:
+   *
+   *    sin, atan, acos
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc sine of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.asin(x);
+      } else {
+        return new Complex(x, 0).asin();
+      }
+    },
+    Complex: function (x) {
+      return x.asin();
+    },
+    BigNumber: function (x) {
+      return x.asin();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..e0df5cb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/asinh.js
@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAsinh = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'asinh';
+const dependencies = ['typed'];
+const createAsinh = exports.createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arcsine of a value,
+   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+   *
+   * To avoid confusion with the matrix hyperbolic arcsine, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asinh(x)
+   *
+   * Examples:
+   *
+   *    math.asinh(0.5)       // returns 0.48121182505960347
+   *
+   * See also:
+   *
+   *    acosh, atanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arcsine of x
+   */
+  return typed('asinh', {
+    number: _index.asinhNumber,
+    Complex: function (x) {
+      return x.asinh();
+    },
+    BigNumber: function (x) {
+      return x.asinh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js
new file mode 100644
index 0000000..d1ef90d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atan.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtan = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'atan';
+const dependencies = ['typed'];
+const createAtan = exports.createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the inverse tangent of a value.
+   *
+   * To avoid confusion with matrix arctangent, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.atan(x)
+   *
+   * Examples:
+   *
+   *    math.atan(0.5)           // returns number 0.4636476090008061
+   *    math.atan(2)             // returns number 1.1071487177940904
+   *    math.atan(math.tan(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    tan, asin, acos
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc tangent of x
+   */
+  return typed('atan', {
+    number: function (x) {
+      return Math.atan(x);
+    },
+    Complex: function (x) {
+      return x.atan();
+    },
+    BigNumber: function (x) {
+      return x.atan();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..08ac2ac
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atan2.js
@@ -0,0 +1,96 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtan2 = void 0;
+var _factory = require("../../utils/factory.js");
+var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
+var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
+var _matAlgo09xS0Sf = require("../../type/matrix/utils/matAlgo09xS0Sf.js");
+var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
+var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'atan2';
+const dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];
+const createAtan2 = exports.createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber,
+    DenseMatrix,
+    concat
+  } = _ref;
+  const matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
+    typed,
+    equalScalar
+  });
+  const matAlgo03xDSf = (0, _matAlgo03xDSf.createMatAlgo03xDSf)({
+    typed
+  });
+  const matAlgo09xS0Sf = (0, _matAlgo09xS0Sf.createMatAlgo09xS0Sf)({
+    typed,
+    equalScalar
+  });
+  const matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
+    typed,
+    equalScalar
+  });
+  const matAlgo12xSfs = (0, _matAlgo12xSfs.createMatAlgo12xSfs)({
+    typed,
+    DenseMatrix
+  });
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x.
+   * By providing two arguments, the right quadrant of the computed angle can be
+   * determined.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan2(y, x)
+   *
+   * Examples:
+   *
+   *    math.atan2(2, 2) / math.pi       // returns number 0.25
+   *
+   *    const angle = math.unit(60, 'deg')
+   *    const x = math.cos(angle)
+   *    const y = math.sin(angle)
+   *    math.atan2(y, x) * 180 / math.pi  // returns 60
+   *
+   *    math.atan(2)             // returns number 1.1071487177940904
+   *
+   * See also:
+   *
+   *    tan, atan, sin, cos
+   *
+   * @param {number | Array | Matrix} y  Second dimension
+   * @param {number | Array | Matrix} x  First dimension
+   * @return {number | Array | Matrix} Four-quadrant inverse tangent
+   */
+  return typed(name, {
+    'number, number': Math.atan2,
+    // Complex numbers doesn't seem to have a reasonable implementation of
+    // atan2(). Even Matlab removed the support, after they only calculated
+    // the atan only on base of the real part of the numbers and ignored
+    // the imaginary.
+
+    'BigNumber, BigNumber': (y, x) => BigNumber.atan2(y, x)
+  }, matrixAlgorithmSuite({
+    scalar: 'number | BigNumber',
+    SS: matAlgo09xS0Sf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..4f58486
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/atanh.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createAtanh = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'atanh';
+const dependencies = ['typed', 'config', 'Complex'];
+const createAtanh = exports.createAtanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arctangent of a value,
+   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+   *
+   * To avoid confusion with the matrix hyperbolic arctangent, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.atanh(x)
+   *
+   * Examples:
+   *
+   *    math.atanh(0.5)       // returns 0.5493061443340549
+   *
+   * See also:
+   *
+   *    acosh, asinh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arctangent of x
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        return (0, _index.atanhNumber)(x);
+      }
+      return new Complex(x, 0).atanh();
+    },
+    Complex: function (x) {
+      return x.atanh();
+    },
+    BigNumber: function (x) {
+      return x.atanh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js
new file mode 100644
index 0000000..f6b525c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cos.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCos = void 0;
+var _factory = require("../../utils/factory.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'cos';
+const dependencies = ['typed'];
+const createCos = exports.createCos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the cosine of a value.
+   *
+   * To avoid confusion with the matrix cosine, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cos(x)
+   *
+   * Examples:
+   *
+   *    math.cos(2)                      // returns number -0.4161468365471422
+   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475
+   *    math.cos(math.unit(180, 'deg'))  // returns number -1
+   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Cosine of x
+   */
+  return typed(name, {
+    number: Math.cos,
+    'Complex | BigNumber': x => x.cos()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..1185bea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cosh.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCosh = void 0;
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+const name = 'cosh';
+const dependencies = ['typed'];
+const createCosh = exports.createCosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cosine of a value,
+   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+   *
+   * To avoid confusion with the matrix hyperbolic cosine, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cosh(x)
+   *
+   * Examples:
+   *
+   *    math.cosh(0.5)       // returns number 1.1276259652063807
+   *
+   * See also:
+   *
+   *    sinh, tanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cosine of x
+   */
+  return typed(name, {
+    number: _number.cosh,
+    'Complex | BigNumber': x => x.cosh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js b/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js
new file mode 100644
index 0000000..3db5309
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/cot.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCot = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'cot';
+const dependencies = ['typed', 'BigNumber'];
+const createCot = exports.createCot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
+   *
+   * To avoid confusion with the matrix cotangent, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cot(x)
+   *
+   * Examples:
+   *
+   *    math.cot(2)      // returns number -0.45765755436028577
+   *    1 / math.tan(2)  // returns number -0.45765755436028577
+   *
+   * See also:
+   *
+   *    tan, sec, csc
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cotangent of x
+   */
+  return typed(name, {
+    number: _index.cotNumber,
+    Complex: x => x.cot(),
+    BigNumber: x => new BigNumber(1).div(x.tan())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js b/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js
new file mode 100644
index 0000000..6471792
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/coth.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCoth = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'coth';
+const dependencies = ['typed', 'BigNumber'];
+const createCoth = exports.createCoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cotangent of a value,
+   * defined as `coth(x) = 1 / tanh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic cotangent, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.coth(x)
+   *
+   * Examples:
+   *
+   *    // coth(x) = 1 / tanh(x)
+   *    math.coth(2)         // returns 1.0373147207275482
+   *    1 / math.tanh(2)     // returns 1.0373147207275482
+   *
+   * See also:
+   *
+   *    sinh, tanh, cosh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cotangent of x
+   */
+  return typed(name, {
+    number: _index.cothNumber,
+    Complex: x => x.coth(),
+    BigNumber: x => new BigNumber(1).div(x.tanh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js b/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js
new file mode 100644
index 0000000..738de7f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/csc.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsc = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'csc';
+const dependencies = ['typed', 'BigNumber'];
+const createCsc = exports.createCsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+   *
+   * To avoid confusion with the matrix cosecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.csc(x)
+   *
+   * Examples:
+   *
+   *    math.csc(2)      // returns number 1.099750170294617
+   *    1 / math.sin(2)  // returns number 1.099750170294617
+   *
+   * See also:
+   *
+   *    sin, sec, cot
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Cosecant of x
+   */
+  return typed(name, {
+    number: _index.cscNumber,
+    Complex: x => x.csc(),
+    BigNumber: x => new BigNumber(1).div(x.sin())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js b/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js
new file mode 100644
index 0000000..e538e34
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/csch.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCsch = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'csch';
+const dependencies = ['typed', 'BigNumber'];
+const createCsch = exports.createCsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cosecant of a value,
+   * defined as `csch(x) = 1 / sinh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic cosecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.csch(x)
+   *
+   * Examples:
+   *
+   *    // csch(x) = 1/ sinh(x)
+   *    math.csch(0.5)       // returns 1.9190347513349437
+   *    1 / math.sinh(0.5)   // returns 1.9190347513349437
+   *
+   * See also:
+   *
+   *    sinh, sech, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cosecant of x
+   */
+  return typed(name, {
+    number: _index.cschNumber,
+    Complex: x => x.csch(),
+    BigNumber: x => new BigNumber(1).div(x.sinh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js
new file mode 100644
index 0000000..a6a4daa
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sec.js
@@ -0,0 +1,48 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSec = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'sec';
+const dependencies = ['typed', 'BigNumber'];
+const createSec = exports.createSec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+   *
+   * To avoid confusion with the matrix secant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sec(x)
+   *
+   * Examples:
+   *
+   *    math.sec(2)      // returns number -2.4029979617223822
+   *    1 / math.cos(2)  // returns number -2.4029979617223822
+   *
+   * See also:
+   *
+   *    cos, csc, cot
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Secant of x
+   */
+  return typed(name, {
+    number: _index.secNumber,
+    Complex: x => x.sec(),
+    BigNumber: x => new BigNumber(1).div(x.cos())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js
new file mode 100644
index 0000000..91d464a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sech.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSech = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'sech';
+const dependencies = ['typed', 'BigNumber'];
+const createSech = exports.createSech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic secant of a value,
+   * defined as `sech(x) = 1 / cosh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic secant, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sech(x)
+   *
+   * Examples:
+   *
+   *    // sech(x) = 1/ cosh(x)
+   *    math.sech(0.5)       // returns 0.886818883970074
+   *    1 / math.cosh(0.5)   // returns 0.886818883970074
+   *
+   * See also:
+   *
+   *    cosh, csch, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic secant of x
+   */
+  return typed(name, {
+    number: _index.sechNumber,
+    Complex: x => x.sech(),
+    BigNumber: x => new BigNumber(1).div(x.cosh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js
new file mode 100644
index 0000000..e8994af
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sin.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSin = void 0;
+var _factory = require("../../utils/factory.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'sin';
+const dependencies = ['typed'];
+const createSin = exports.createSin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the sine of a value.
+   *
+   * To avoid confusion with the matrix sine, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sin(x)
+   *
+   * Examples:
+   *
+   *    math.sin(2)                      // returns number 0.9092974268256813
+   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475
+   *    math.sin(math.unit(90, 'deg'))   // returns number 1
+   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Sine of x
+   */
+  return typed(name, {
+    number: Math.sin,
+    'Complex | BigNumber': x => x.sin()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..871d8f3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/sinh.js
@@ -0,0 +1,41 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSinh = void 0;
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'sinh';
+const dependencies = ['typed'];
+const createSinh = exports.createSinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic sine of a value,
+   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+   *
+   * To avoid confusion with the matrix hyperbolic sine, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sinh(x)
+   *
+   * Examples:
+   *
+   *    math.sinh(0.5)       // returns number 0.5210953054937474
+   *
+   * See also:
+   *
+   *    cosh, tanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic sine of x
+   */
+  return typed(name, {
+    number: _index.sinhNumber,
+    'Complex | BigNumber': x => x.sinh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js b/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js
new file mode 100644
index 0000000..f9ae346
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/tan.js
@@ -0,0 +1,47 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTan = void 0;
+var _factory = require("../../utils/factory.js");
+var _trigUnit = require("./trigUnit.js");
+const name = 'tan';
+const dependencies = ['typed'];
+const createTan = exports.createTan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  const trigUnit = (0, _trigUnit.createTrigUnit)({
+    typed
+  });
+
+  /**
+   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
+   *
+   * To avoid confusion with the matrix tangent, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.tan(x)
+   *
+   * Examples:
+   *
+   *    math.tan(0.5)                    // returns number 0.5463024898437905
+   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905
+   *    math.tan(math.pi / 4)            // returns number 1
+   *    math.tan(math.unit(45, 'deg'))   // returns number 1
+   *
+   * See also:
+   *
+   *    atan, sin, cos
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Tangent of x
+   */
+  return typed(name, {
+    number: Math.tan,
+    'Complex | BigNumber': x => x.tan()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..02e32f6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/tanh.js
@@ -0,0 +1,44 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTanh = void 0;
+var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
+const name = 'tanh';
+const dependencies = ['typed'];
+const createTanh = exports.createTanh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic tangent of a value,
+   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+   *
+   * To avoid confusion with matrix hyperbolic tangent, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.tanh(x)
+   *
+   * Examples:
+   *
+   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
+   *    math.tanh(0.5)                   // returns 0.46211715726000974
+   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974
+   *    1 / math.coth(0.5)               // returns 0.46211715726000974
+   *
+   * See also:
+   *
+   *    sinh, cosh, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic tangent of x
+   */
+  return typed('tanh', {
+    number: _number.tanh,
+    'Complex | BigNumber': x => x.tanh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/trigonometry/trigUnit.js b/node_modules/mathjs/lib/cjs/function/trigonometry/trigUnit.js
new file mode 100644
index 0000000..ae62dc5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/trigonometry/trigUnit.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTrigUnit = void 0;
+var _factory = require("../../utils/factory.js");
+const createTrigUnit = exports.createTrigUnit = /* #__PURE__ */(0, _factory.factory)('trigUnit', ['typed'], _ref => {
+  let {
+    typed
+  } = _ref;
+  return {
+    Unit: typed.referToSelf(self => x => {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cot is no angle');
+      }
+      return typed.find(self, x.valueType())(x.value);
+    })
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/unit/to.js b/node_modules/mathjs/lib/cjs/function/unit/to.js
new file mode 100644
index 0000000..d660324
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/unit/to.js
@@ -0,0 +1,52 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTo = void 0;
+var _factory = require("../../utils/factory.js");
+var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
+const name = 'to';
+const dependencies = ['typed', 'matrix', 'concat'];
+const createTo = exports.createTo = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    concat
+  } = _ref;
+  const matrixAlgorithmSuite = (0, _matrixAlgorithmSuite.createMatrixAlgorithmSuite)({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Change the unit of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.to(x, unit)
+   *
+   * Examples:
+   *
+   *    math.to(math.unit('2 inch'), 'cm')             // returns Unit 5.08 cm
+   *    math.to(math.unit('2 inch'), math.unit('cm'))  // returns Unit 5.08 cm
+   *    math.to(math.unit(16, 'bytes'), 'bits')        // returns Unit 128 bits
+   *
+   * See also:
+   *
+   *    unit
+   *
+   * @param {Unit | Array | Matrix} x     The unit to be converted.
+   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like "cm"
+   *                                      or a unit without value.
+   * @return {Unit | Array | Matrix} value with changed, fixed unit.
+   */
+  return typed(name, {
+    'Unit, Unit | string': (x, unit) => x.to(unit)
+  }, matrixAlgorithmSuite({
+    Ds: true
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/unit/toBest.js b/node_modules/mathjs/lib/cjs/function/unit/toBest.js
new file mode 100644
index 0000000..2b2cf9a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/unit/toBest.js
@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createToBest = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'toBest';
+const dependencies = ['typed'];
+const createToBest = exports.createToBest = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Converts a unit to the most appropriate display unit.
+   * When no preferred units are provided, the function automatically find the best prefix.
+   * When preferred units are provided, it converts to
+   * the unit that gives a value closest to 1.
+   *
+   * Syntax:
+   *
+   *    math.toBest(unit)
+   *    math.toBest(unit, unitList)
+   *    math.toBest(unit, unitList, options)
+   *
+   * Where:
+   * - `unitList` is an optional array of preferred target units as string or Unit.
+   * - `options` is an optional object with options, formed as follows:
+   * - `offset`: number | BigNumber
+   *
+   * Examples:
+   *
+   *   math.unit(0.05, 'm').toBest(['cm', 'mm'])                 // returns Unit 5 cm
+   *   math.unit(2 / 3, 'cm').toBest()                           // returns Unit 0.6666666666666666 cm
+   *   math.unit(10, 'm').toBest(['mm', 'km'], { offset: 1.5 })  // returns Unit 10000 mm
+   *
+   * See also:
+   *
+   *    unit, to, format
+   *
+   * @param {Unit} x                          The unit to be converted
+   * @param {Array<string>} [unitList=[]]     Optional array of preferred target units
+   * @param {Object} [options]                Optional options object
+   * @return {Unit}                           Value converted to the best matching unit
+   */
+  return typed(name, {
+    Unit: x => x.toBest(),
+    'Unit, string': (x, unitList) => x.toBest(unitList.split(',')),
+    'Unit, string, Object': (x, unitList, options) => x.toBest(unitList.split(','), options),
+    'Unit, Array': (x, unitList) => x.toBest(unitList),
+    'Unit, Array, Object': (x, unitList, options) => x.toBest(unitList, options)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/clone.js b/node_modules/mathjs/lib/cjs/function/utils/clone.js
new file mode 100644
index 0000000..4bc2548
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/clone.js
@@ -0,0 +1,36 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createClone = void 0;
+var _object = require("../../utils/object.js");
+var _factory = require("../../utils/factory.js");
+const name = 'clone';
+const dependencies = ['typed'];
+const createClone = exports.createClone = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Clone an object. Will make a deep copy of the data.
+   *
+   * Syntax:
+   *
+   *     math.clone(x)
+   *
+   * Examples:
+   *
+   *    math.clone(3.5)                   // returns number 3.5
+   *    math.clone(math.complex('2-4i'))  // returns Complex 2 - 4i
+   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg
+   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]
+   *    math.clone("hello world")         // returns string "hello world"
+   *
+   * @param {*} x   Object to be cloned
+   * @return {*} A clone of object x
+   */
+  return typed(name, {
+    any: _object.clone
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..223171a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/hasNumericValue.js
@@ -0,0 +1,56 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createHasNumericValue = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'hasNumericValue';
+const dependencies = ['typed', 'isNumeric'];
+const createHasNumericValue = exports.createHasNumericValue = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    isNumeric
+  } = _ref;
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * In case of a string, true is returned if the string contains a numeric value.
+   *
+   * Syntax:
+   *
+   *     math.hasNumericValue(x)
+   *
+   * Examples:
+   *
+   *    math.hasNumericValue(2)                     // returns true
+   *    math.hasNumericValue('2')                   // returns true
+   *    math.isNumeric('2')                         // returns false
+   *    math.hasNumericValue(0)                     // returns true
+   *    math.hasNumericValue(math.bignumber('500')) // returns true
+   *    math.hasNumericValue(math.bigint('42'))     // returns true
+   *    math.hasNumericValue(42n)                   // returns true
+   *    math.hasNumericValue(math.fraction(4))      // returns true
+   *    math.hasNumericValue(math.complex('2-4i'))  // returns false
+   *    math.hasNumericValue(false)                 // returns true
+   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, isNumeric
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    boolean: () => true,
+    string: function (x) {
+      return x.trim().length > 0 && !isNaN(Number(x));
+    },
+    any: function (x) {
+      return isNumeric(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isInteger.js b/node_modules/mathjs/lib/cjs/function/utils/isInteger.js
new file mode 100644
index 0000000..25c3c5c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isInteger.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsInteger = void 0;
+var _collection = require("../../utils/collection.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'isInteger';
+const dependencies = ['typed'];
+const createIsInteger = exports.createIsInteger = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is an integer number.
+   * The function supports `number`, `BigNumber`, and `Fraction`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isInteger(x)
+   *
+   * Examples:
+   *
+   *    math.isInteger(2)                     // returns true
+   *    math.isInteger(0)                     // returns true
+   *    math.isInteger(0.5)                   // returns false
+   *    math.isInteger(math.bignumber(500))   // returns true
+   *    math.isInteger(math.fraction(4))      // returns true
+   *    math.isInteger('3')                   // returns true
+   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]
+   *    math.isInteger(math.complex('2-4i'))  // throws TypeError
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isZero
+   *
+   * @param {number | BigNumber | bigint | Fraction | Array | Matrix} x   Value to be tested
+   * @return {boolean}  Returns true when `x` contains a numeric, integer value.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _number.isInteger,
+    // TODO: what to do with isInteger(add(0.1, 0.2))  ?
+
+    BigNumber: function (x) {
+      return x.isInt();
+    },
+    bigint: function (x) {
+      return true;
+    },
+    Fraction: function (x) {
+      return x.d === 1n;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNaN.js b/node_modules/mathjs/lib/cjs/function/utils/isNaN.js
new file mode 100644
index 0000000..5c6678a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNaN.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNaN = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+const name = 'isNaN';
+const dependencies = ['typed'];
+const createIsNaN = exports.createIsNaN = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is NaN (not a number).
+   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNaN(x)
+   *
+   * Examples:
+   *
+   *    math.isNaN(3)                     // returns false
+   *    math.isNaN(NaN)                   // returns true
+   *    math.isNaN(0)                     // returns false
+   *    math.isNaN(math.bignumber(NaN))   // returns true
+   *    math.isNaN(math.bignumber(0))     // returns false
+   *    math.isNaN(math.fraction(-2, 5))  // returns false
+   *    math.isNaN('-2')                  // returns false
+   *    math.isNaN([2, 0, -3, NaN])       // returns [false, false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isNegative, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is NaN.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: _index.isNaNNumber,
+    BigNumber: function (x) {
+      return x.isNaN();
+    },
+    bigint: function (x) {
+      return false;
+    },
+    Fraction: function (x) {
+      return false;
+    },
+    Complex: function (x) {
+      return x.isNaN();
+    },
+    Unit: function (x) {
+      return Number.isNaN(x.value);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNegative.js b/node_modules/mathjs/lib/cjs/function/utils/isNegative.js
new file mode 100644
index 0000000..97ff589
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNegative.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNegative = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+const name = 'isNegative';
+const dependencies = ['typed', 'config'];
+const createIsNegative = exports.createIsNegative = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config
+  } = _ref;
+  /**
+   * Test whether a value is negative: smaller than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNegative(x)
+   *
+   * Examples:
+   *
+   *    math.isNegative(3)                     // returns false
+   *    math.isNegative(-2)                    // returns true
+   *    math.isNegative(0)                     // returns false
+   *    math.isNegative(-0)                    // returns false
+   *    math.isNegative(math.bignumber(2))     // returns false
+   *    math.isNegative(math.fraction(-2, 5))  // returns true
+   *    math.isNegative('-2')                  // returns true
+   *    math.isNegative([2, 0, -3])            // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: x => (0, _number.nearlyEqual)(x, 0, config.relTol, config.absTol) ? false : (0, _index.isNegativeNumber)(x),
+    BigNumber: x => (0, _nearlyEqual.nearlyEqual)(x, new x.constructor(0), config.relTol, config.absTol) ? false : x.isNeg() && !x.isZero() && !x.isNaN(),
+    bigint: x => x < 0n,
+    Fraction: x => x.s < 0n,
+    // It's enough to decide on the sign
+
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js b/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js
new file mode 100644
index 0000000..49c2bea
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isNumeric.js
@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsNumeric = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'isNumeric';
+const dependencies = ['typed'];
+const createIsNumeric = exports.createIsNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNumeric(x)
+   *
+   * Examples:
+   *
+   *    math.isNumeric(2)                     // returns true
+   *    math.isNumeric('2')                   // returns false
+   *    math.hasNumericValue('2')             // returns true
+   *    math.isNumeric(0)                     // returns true
+   *    math.isNumeric(math.bignumber('42'))  // returns true
+   *    math.isNumeric(math.bigint('42'))     // returns true
+   *    math.isNumeric(math.fraction(4))      // returns true
+   *    math.isNumeric(math.complex('2-4i'))  // returns false
+   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, hasNumericValue
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, or `boolean`. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    'number | BigNumber | bigint | Fraction | boolean': () => true,
+    'Complex | Unit | string | null | undefined | Node': () => false,
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isPositive.js b/node_modules/mathjs/lib/cjs/function/utils/isPositive.js
new file mode 100644
index 0000000..089d92e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isPositive.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsPositive = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+var _index = require("../../plain/number/index.js");
+var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
+var _number = require("../../utils/number.js");
+const name = 'isPositive';
+const dependencies = ['typed', 'config'];
+const createIsPositive = exports.createIsPositive = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config
+  } = _ref;
+  /**
+   * Test whether a value is positive: larger than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPositive(x)
+   *
+   * Examples:
+   *
+   *    math.isPositive(3)                     // returns true
+   *    math.isPositive(-2)                    // returns false
+   *    math.isPositive(0)                     // returns false
+   *    math.isPositive(-0)                    // returns false
+   *    math.isPositive(0.5)                   // returns true
+   *    math.isPositive(math.bignumber(2))     // returns true
+   *    math.isPositive(math.fraction(-2, 5))  // returns false
+   *    math.isPositive(math.fraction(1, 3))   // returns true
+   *    math.isPositive('2')                   // returns true
+   *    math.isPositive([2, 0, -3])            // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: x => (0, _number.nearlyEqual)(x, 0, config.relTol, config.absTol) ? false : (0, _index.isPositiveNumber)(x),
+    BigNumber: x => (0, _nearlyEqual.nearlyEqual)(x, new x.constructor(0), config.relTol, config.absTol) ? false : !x.isNeg() && !x.isZero() && !x.isNaN(),
+    bigint: x => x > 0n,
+    Fraction: x => x.s > 0n && x.n > 0n,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isPrime.js b/node_modules/mathjs/lib/cjs/function/utils/isPrime.js
new file mode 100644
index 0000000..0f48389
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isPrime.js
@@ -0,0 +1,136 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsPrime = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'isPrime';
+const dependencies = ['typed'];
+const createIsPrime = exports.createIsPrime = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is prime: has no divisors other than itself and one.
+   * The function supports type `number`, `bignumber`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPrime(x)
+   *
+   * Examples:
+   *
+   *    math.isPrime(3)                     // returns true
+   *    math.isPrime(-2)                    // returns false
+   *    math.isPrime(0)                     // returns false
+   *    math.isPrime(-0)                    // returns false
+   *    math.isPrime(0.5)                   // returns false
+   *    math.isPrime('2')                   // returns true
+   *    math.isPrime([2, 17, 100])           // returns [true, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: function (x) {
+      if (x <= 3) {
+        return x > 1;
+      }
+      if (x % 2 === 0 || x % 3 === 0) {
+        return false;
+      }
+      for (let i = 5; i * i <= x; i += 6) {
+        if (x % i === 0 || x % (i + 2) === 0) {
+          return false;
+        }
+      }
+      return true;
+    },
+    bigint: function (x) {
+      if (x <= 3n) {
+        return x > 1n;
+      }
+      if (x % 2n === 0n || x % 3n === 0n) {
+        return false;
+      }
+      for (let i = 5n; i * i <= x; i += 6n) {
+        if (x % i === 0n || x % (i + 2n) === 0n) {
+          return false;
+        }
+      }
+      return true;
+    },
+    BigNumber: function (n) {
+      if (n.lte(3)) return n.gt(1);
+      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;
+      if (n.lt(Math.pow(2, 32))) {
+        const x = n.toNumber();
+        for (let i = 5; i * i <= x; i += 6) {
+          if (x % i === 0 || x % (i + 2) === 0) {
+            return false;
+          }
+        }
+        return true;
+      }
+      function modPow(base, exponent, modulus) {
+        // exponent can be huge, use non-recursive variant
+        let accumulator = 1;
+        while (!exponent.eq(0)) {
+          if (exponent.mod(2).eq(0)) {
+            exponent = exponent.div(2);
+            base = base.mul(base).mod(modulus);
+          } else {
+            exponent = exponent.sub(1);
+            accumulator = base.mul(accumulator).mod(modulus);
+          }
+        }
+        return accumulator;
+      }
+
+      // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants
+      const Decimal = n.constructor.clone({
+        precision: n.toFixed(0).length * 2
+      });
+      n = new Decimal(n);
+      let r = 0;
+      let d = n.sub(1);
+      while (d.mod(2).eq(0)) {
+        d = d.div(2);
+        r += 1;
+      }
+      let bases = null;
+      // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases
+      if (n.lt('3317044064679887385961981')) {
+        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(x => x < n);
+      } else {
+        const max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)));
+        bases = [];
+        for (let i = 2; i <= max; i += 1) {
+          bases.push(max);
+        }
+      }
+      for (let i = 0; i < bases.length; i += 1) {
+        const a = bases[i];
+        const adn = modPow(n.sub(n).add(a), d, n);
+        if (!adn.eq(1)) {
+          for (let i = 0, x = adn; !x.eq(n.sub(1)); i += 1, x = x.mul(x).mod(n)) {
+            if (i === r - 1) {
+              return false;
+            }
+          }
+        }
+      }
+      return true;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/isZero.js b/node_modules/mathjs/lib/cjs/function/utils/isZero.js
new file mode 100644
index 0000000..500b9c9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/isZero.js
@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIsZero = void 0;
+var _collection = require("../../utils/collection.js");
+var _factory = require("../../utils/factory.js");
+const name = 'isZero';
+const dependencies = ['typed', 'equalScalar'];
+const createIsZero = exports.createIsZero = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Test whether a value is zero.
+   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,
+   * `Complex`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isZero(x)
+   *
+   * Examples:
+   *
+   *    math.isZero(0)                      // returns true
+   *    math.isZero(2)                      // returns false
+   *    math.isZero(0.5)                    // returns false
+   *    math.isZero(math.bignumber(0))      // returns true
+   *    math.isZero(math.fraction(0))       // returns true
+   *    math.isZero(math.fraction(1,3))     // returns false
+   *    math.isZero(math.complex('2 - 4i')) // returns false
+   *    math.isZero(math.complex('0i'))     // returns true
+   *    math.isZero('0')                    // returns true
+   *    math.isZero('2')                    // returns false
+   *    math.isZero([2, 0, -3])             // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    'number | BigNumber | Complex | Fraction': x => equalScalar(x, 0),
+    bigint: x => x === 0n,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/numeric.js b/node_modules/mathjs/lib/cjs/function/utils/numeric.js
new file mode 100644
index 0000000..fdb83fd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/numeric.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNumeric = void 0;
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _noop = require("../../utils/noop.js");
+const name = 'numeric';
+const dependencies = ['number', '?bignumber', '?fraction'];
+const createNumeric = exports.createNumeric = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    number,
+    bignumber,
+    fraction
+  } = _ref;
+  const validInputTypes = {
+    string: true,
+    number: true,
+    BigNumber: true,
+    Fraction: true
+  };
+
+  // Load the conversion functions for each output type
+  const validOutputTypes = {
+    number: x => number(x),
+    BigNumber: bignumber ? x => bignumber(x) : _noop.noBignumber,
+    bigint: x => BigInt(x),
+    Fraction: fraction ? x => fraction(x) : _noop.noFraction
+  };
+
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.
+   *
+   * Syntax:
+   *
+   *    math.numeric(x)
+   *    math.numeric(value, outputType)
+   *
+   * Examples:
+   *
+   *    math.numeric('4')                           // returns 4
+   *    math.numeric('4', 'number')                 // returns 4
+   *    math.numeric('4', 'bigint')                 // returns 4n
+   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4
+   *    math.numeric('4', 'Fraction')               // returns Fraction 4
+   *    math.numeric(4, 'Fraction')                 // returns Fraction 4
+   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4
+   *
+   * See also:
+   *
+   *    number, fraction, bignumber, bigint, string, format
+   *
+   * @param {string | number | BigNumber | bigint | Fraction } value
+   *              A numeric value or a string containing a numeric value
+   * @param {string} outputType
+   *              Desired numeric output type.
+   *              Available values: 'number', 'BigNumber', or 'Fraction'
+   * @return {number | BigNumber | bigint | Fraction}
+   *              Returns an instance of the numeric in the requested type
+   */
+  return function numeric(value) {
+    let outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';
+    let check = arguments.length > 2 ? arguments[2] : undefined;
+    if (check !== undefined) {
+      throw new SyntaxError('numeric() takes one or two arguments');
+    }
+    const inputType = (0, _is.typeOf)(value);
+    if (!(inputType in validInputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' of type "' + inputType + '"; valid input types are ' + Object.keys(validInputTypes).join(', '));
+    }
+    if (!(outputType in validOutputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' to type "' + outputType + '"; valid output types are ' + Object.keys(validOutputTypes).join(', '));
+    }
+    if (outputType === inputType) {
+      return value;
+    } else {
+      return validOutputTypes[outputType](value);
+    }
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/function/utils/typeOf.js b/node_modules/mathjs/lib/cjs/function/utils/typeOf.js
new file mode 100644
index 0000000..701477e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/function/utils/typeOf.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createTypeOf = void 0;
+var _factory = require("../../utils/factory.js");
+var _is = require("../../utils/is.js");
+const name = 'typeOf';
+const dependencies = ['typed'];
+const createTypeOf = exports.createTypeOf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Determine the type of an entity.
+   *
+   * Syntax:
+   *
+   *    math.typeOf(x)
+   *
+   * Examples:
+   *
+   *    // This list is intended to include all relevant types, for testing
+   *    // purposes:
+   *    math.typeOf(3.5)                      // returns 'number'
+   *    math.typeOf(42n)                      // returns 'bigint'
+   *    math.typeOf(math.complex('2-4i'))     // returns 'Complex'
+   *    math.typeOf(math.unit('45 deg'))      // returns 'Unit'
+   *    math.typeOf('hello world')            // returns 'string'
+   *    math.typeOf(null)                     // returns 'null'
+   *    math.typeOf(true)                     // returns 'boolean'
+   *    math.typeOf([1, 2, 3])                // returns 'Array'
+   *    math.typeOf(new Date())               // returns 'Date'
+   *    math.typeOf(function () {})           // returns 'function'
+   *    math.typeOf({a: 2, b: 3})             // returns 'Object'
+   *    math.typeOf(/a regexp/)               // returns 'RegExp'
+   *    math.typeOf(undefined)                // returns 'undefined'
+   *    math.typeOf(math.bignumber('23e99'))  // returns 'BigNumber'
+   *    math.typeOf(math.chain(2))            // returns 'Chain'
+   *    math.typeOf(math.fraction(1, 3))      // returns 'Fraction'
+   *    math.typeOf(math.help('sqrt'))        // returns 'Help'
+   *    math.typeOf(math.index(1, 3))         // returns 'Index'
+   *    math.typeOf(math.matrix([[1],[3]]))   // returns 'DenseMatrix'
+   *    math.typeOf(math.matrix([],'sparse')) // returns 'SparseMatrix'
+   *    math.typeOf(new math.Range(0, 10))    // returns 'Range'
+   *    math.typeOf(math.evaluate('a=2\na'))  // returns 'ResultSet'
+   *    math.typeOf(math.parse('A[2]'))       // returns 'AccessorNode'
+   *    math.typeOf(math.parse('[1,2,3]'))    // returns 'ArrayNode'
+   *    math.typeOf(math.parse('x=2'))        // returns 'AssignmentNode'
+   *    math.typeOf(math.parse('a=2; b=3'))   // returns 'BlockNode'
+   *    math.typeOf(math.parse('x<0?-1:1'))   // returns 'ConditionalNode'
+   *    math.typeOf(math.parse('2.3'))        // returns 'ConstantNode'
+   *    math.typeOf(math.parse('f(x)=x^2'))   // returns 'FunctionAssignmentNode'
+   *    math.typeOf(math.parse('sqrt(4)'))    // returns 'FunctionNode'
+   *    math.typeOf(math.parse('A[2]').index) // returns 'IndexNode'
+   *    math.typeOf(math.parse('{a:2}'))      // returns 'ObjectNode'
+   *    math.typeOf(math.parse('(2+3)'))      // returns 'ParenthesisNode'
+   *    math.typeOf(math.parse('1:10'))       // returns 'RangeNode'
+   *    math.typeOf(math.parse('a<b<c'))      // returns 'RelationalNode'
+   *    math.typeOf(math.parse('x'))          // returns 'SymbolNode'
+   *
+   * @param {*} x     The variable for which to test the type.
+   * @return {string} Returns the name of the type. Primitive types are lower case,
+   *                  non-primitive types are upper-camel-case.
+   *                  For example 'number', 'string', 'Array', 'Date'.
+   */
+  return typed(name, {
+    any: _is.typeOf
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/header.js b/node_modules/mathjs/lib/cjs/header.js
new file mode 100644
index 0000000..ce91afb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/header.js
@@ -0,0 +1,26 @@
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version 14.9.1
+ * @date    2025-10-10
+ *
+ * @license
+ * Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+ *
+ * https://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.
+ */
diff --git a/node_modules/mathjs/lib/cjs/index.js b/node_modules/mathjs/lib/cjs/index.js
new file mode 100644
index 0000000..4b3a856
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/index.js
@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _mainAny = require("./entry/mainAny.js");
+Object.keys(_mainAny).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mainAny[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _mainAny[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/json/replacer.js b/node_modules/mathjs/lib/cjs/json/replacer.js
new file mode 100644
index 0000000..811a8b4
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/json/replacer.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReplacer = void 0;
+var _factory = require("../utils/factory.js");
+const name = 'replacer';
+const dependencies = [];
+const createReplacer = exports.createReplacer = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * Stringify data types into their JSON representation.
+   * Most data types can be serialized using their `.toJSON` method,
+   * but not all, for example the number `Infinity`. For these cases you have
+   * to use the replacer. Example usage:
+   *
+   *     JSON.stringify([2, Infinity], math.replacer)
+   *
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the replaced object
+   */
+  return function replacer(key, value) {
+    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON
+    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {
+      return {
+        mathjs: 'number',
+        value: String(value)
+      };
+    }
+    if (typeof value === 'bigint') {
+      return {
+        mathjs: 'bigint',
+        value: String(value)
+      };
+    }
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/json/reviver.js b/node_modules/mathjs/lib/cjs/json/reviver.js
new file mode 100644
index 0000000..3e49405
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/json/reviver.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createReviver = void 0;
+var _factory = require("../utils/factory.js");
+const name = 'reviver';
+const dependencies = ['classes'];
+const createReviver = exports.createReviver = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    classes
+  } = _ref;
+  /**
+   * Instantiate mathjs data types from their JSON representation
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the revived object
+   */
+  return function reviver(key, value) {
+    const constructor = classes[value && value.mathjs];
+    if (constructor && typeof constructor.fromJSON === 'function') {
+      return constructor.fromJSON(value);
+    }
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/number.js b/node_modules/mathjs/lib/cjs/number.js
new file mode 100644
index 0000000..8272a21
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/number.js
@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _mainNumber = require("./entry/mainNumber.js");
+Object.keys(_mainNumber).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _mainNumber[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _mainNumber[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/package.json b/node_modules/mathjs/lib/cjs/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js b/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js
new file mode 100644
index 0000000..cd66883
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/bignumber/arithmetic.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absBigNumber = absBigNumber;
+exports.addBigNumber = addBigNumber;
+exports.divideBigNumber = divideBigNumber;
+exports.multiplyBigNumber = multiplyBigNumber;
+exports.subtractBigNumber = subtractBigNumber;
+const signature1 = 'BigNumber';
+const signature2 = 'BigNumber, BigNumber';
+function absBigNumber(a) {
+  return a.abs();
+}
+absBigNumber.signature = signature1;
+function addBigNumber(a, b) {
+  return a.add(b);
+}
+addBigNumber.signature = signature2;
+function subtractBigNumber(a, b) {
+  return a.sub(b);
+}
+subtractBigNumber.signature = signature2;
+function multiplyBigNumber(a, b) {
+  return a.mul(b);
+}
+multiplyBigNumber.signature = signature2;
+function divideBigNumber(a, b) {
+  return a.div(b);
+}
+divideBigNumber.signature = signature2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/bignumber/index.js b/node_modules/mathjs/lib/cjs/plain/bignumber/index.js
new file mode 100644
index 0000000..7b60254
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/bignumber/index.js
@@ -0,0 +1,29 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _exportNames = {
+  bignumber: true
+};
+exports.bignumber = bignumber;
+var _decimal = _interopRequireDefault(require("decimal.js"));
+var _arithmetic = require("./arithmetic.js");
+Object.keys(_arithmetic).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _arithmetic[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _arithmetic[key];
+    }
+  });
+});
+// TODO: this is ugly. Instead, be able to pass your own isBigNumber function to typed?
+const BigNumber = _decimal.default.clone();
+BigNumber.prototype.isBigNumber = true;
+function bignumber(x) {
+  return new BigNumber(x);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js b/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js
new file mode 100644
index 0000000..1322dbf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/arithmetic.js
@@ -0,0 +1,334 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.absNumber = absNumber;
+exports.addNumber = addNumber;
+exports.cbrtNumber = cbrtNumber;
+exports.cubeNumber = cubeNumber;
+exports.divideNumber = divideNumber;
+exports.expNumber = expNumber;
+exports.expm1Number = expm1Number;
+exports.gcdNumber = gcdNumber;
+exports.lcmNumber = lcmNumber;
+exports.log10Number = log10Number;
+exports.log1pNumber = log1pNumber;
+exports.log2Number = log2Number;
+exports.logNumber = logNumber;
+exports.modNumber = modNumber;
+exports.multiplyNumber = multiplyNumber;
+exports.normNumber = normNumber;
+exports.nthRootNumber = nthRootNumber;
+exports.powNumber = powNumber;
+exports.roundNumber = roundNumber;
+exports.signNumber = signNumber;
+exports.sqrtNumber = sqrtNumber;
+exports.squareNumber = squareNumber;
+exports.subtractNumber = subtractNumber;
+exports.unaryMinusNumber = unaryMinusNumber;
+exports.unaryPlusNumber = unaryPlusNumber;
+exports.xgcdNumber = xgcdNumber;
+var _number = require("../../utils/number.js");
+const n1 = 'number';
+const n2 = 'number, number';
+function absNumber(a) {
+  return Math.abs(a);
+}
+absNumber.signature = n1;
+function addNumber(a, b) {
+  return a + b;
+}
+addNumber.signature = n2;
+function subtractNumber(a, b) {
+  return a - b;
+}
+subtractNumber.signature = n2;
+function multiplyNumber(a, b) {
+  return a * b;
+}
+multiplyNumber.signature = n2;
+function divideNumber(a, b) {
+  return a / b;
+}
+divideNumber.signature = n2;
+function unaryMinusNumber(x) {
+  return -x;
+}
+unaryMinusNumber.signature = n1;
+function unaryPlusNumber(x) {
+  return x;
+}
+unaryPlusNumber.signature = n1;
+function cbrtNumber(x) {
+  return (0, _number.cbrt)(x);
+}
+cbrtNumber.signature = n1;
+function cubeNumber(x) {
+  return x * x * x;
+}
+cubeNumber.signature = n1;
+function expNumber(x) {
+  return Math.exp(x);
+}
+expNumber.signature = n1;
+function expm1Number(x) {
+  return (0, _number.expm1)(x);
+}
+expm1Number.signature = n1;
+
+/**
+ * Calculate gcd for numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the greatest common denominator of a and b
+ */
+function gcdNumber(a, b) {
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function gcd must be integer numbers');
+  }
+
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  let r;
+  while (b !== 0) {
+    r = a % b;
+    a = b;
+    b = r;
+  }
+  return a < 0 ? -a : a;
+}
+gcdNumber.signature = n2;
+
+/**
+ * Calculate lcm for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the least common multiple of a and b
+ */
+function lcmNumber(a, b) {
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function lcm must be integer numbers');
+  }
+  if (a === 0 || b === 0) {
+    return 0;
+  }
+
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  // evaluate lcm here inline to reduce overhead
+  let t;
+  const prod = a * b;
+  while (b !== 0) {
+    t = b;
+    b = a % t;
+    a = t;
+  }
+  return Math.abs(prod / a);
+}
+lcmNumber.signature = n2;
+
+/**
+ * Calculate the logarithm of a value, optionally to a given base.
+ * @param {number} x
+ * @param {number | null | undefined} base
+ * @return {number}
+ */
+function logNumber(x, y) {
+  if (y) {
+    return Math.log(x) / Math.log(y);
+  }
+  return Math.log(x);
+}
+
+/**
+ * Calculate the 10-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+function log10Number(x) {
+  return (0, _number.log10)(x);
+}
+log10Number.signature = n1;
+
+/**
+ * Calculate the 2-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+function log2Number(x) {
+  return (0, _number.log2)(x);
+}
+log2Number.signature = n1;
+
+/**
+ * Calculate the natural logarithm of a `number+1`
+ * @param {number} x
+ * @returns {number}
+ */
+function log1pNumber(x) {
+  return (0, _number.log1p)(x);
+}
+log1pNumber.signature = n1;
+
+/**
+ * Calculate the modulus of two numbers
+ * @param {number} x
+ * @param {number} y
+ * @returns {number} res
+ * @private
+ */
+function modNumber(x, y) {
+  // We don't use JavaScript's % operator here as this doesn't work
+  // correctly for x < 0 and x === 0
+  // see https://en.wikipedia.org/wiki/Modulo_operation
+  return y === 0 ? x : x - y * Math.floor(x / y);
+}
+modNumber.signature = n2;
+
+/**
+ * Calculate the nth root of a, solve x^root == a
+ * http://rosettacode.org/wiki/Nth_root#JavaScript
+ * @param {number} a
+ * @param {number} [2] root
+ * @private
+ */
+function nthRootNumber(a) {
+  let root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
+  const inv = root < 0;
+  if (inv) {
+    root = -root;
+  }
+  if (root === 0) {
+    throw new Error('Root must be non-zero');
+  }
+  if (a < 0 && Math.abs(root) % 2 !== 1) {
+    throw new Error('Root must be odd when a is negative.');
+  }
+
+  // edge cases zero and infinity
+  if (a === 0) {
+    return inv ? Infinity : 0;
+  }
+  if (!isFinite(a)) {
+    return inv ? 0 : a;
+  }
+  let x = Math.pow(Math.abs(a), 1 / root);
+  // If a < 0, we require that root is an odd integer,
+  // so (-1) ^ (1/root) = -1
+  x = a < 0 ? -x : x;
+  return inv ? 1 / x : x;
+
+  // Very nice algorithm, but fails with nthRoot(-2, 3).
+  // Newton's method has some well-known problems at times:
+  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
+  /*
+  let x = 1 // Initial guess
+  let xPrev = 1
+  let i = 0
+  const iMax = 10000
+  do {
+    const delta = (a / Math.pow(x, root - 1) - x) / root
+    xPrev = x
+    x = x + delta
+    i++
+  }
+  while (xPrev !== x && i < iMax)
+   if (xPrev !== x) {
+    throw new Error('Function nthRoot failed to converge')
+  }
+   return inv ? 1 / x : x
+  */
+}
+function signNumber(x) {
+  return (0, _number.sign)(x);
+}
+signNumber.signature = n1;
+function sqrtNumber(x) {
+  return Math.sqrt(x);
+}
+sqrtNumber.signature = n1;
+function squareNumber(x) {
+  return x * x;
+}
+squareNumber.signature = n1;
+
+/**
+ * Calculate xgcd for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @return {number} result
+ * @private
+ */
+function xgcdNumber(a, b) {
+  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+  let t; // used to swap two variables
+  let q; // quotient
+  let r; // remainder
+  let x = 0;
+  let lastx = 1;
+  let y = 1;
+  let lasty = 0;
+  if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
+    throw new Error('Parameters in function xgcd must be integer numbers');
+  }
+  while (b) {
+    q = Math.floor(a / b);
+    r = a - q * b;
+    t = x;
+    x = lastx - q * x;
+    lastx = t;
+    t = y;
+    y = lasty - q * y;
+    lasty = t;
+    a = b;
+    b = r;
+  }
+  let res;
+  if (a < 0) {
+    res = [-a, -lastx, -lasty];
+  } else {
+    res = [a, a ? lastx : 0, lasty];
+  }
+  return res;
+}
+xgcdNumber.signature = n2;
+
+/**
+ * Calculates the power of x to y, x^y, for two numbers.
+ * @param {number} x
+ * @param {number} y
+ * @return {number} res
+ */
+function powNumber(x, y) {
+  // x^Infinity === 0 if -1 < x < 1
+  // A real number 0 is returned instead of complex(0)
+  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+    return 0;
+  }
+  return Math.pow(x, y);
+}
+powNumber.signature = n2;
+
+/**
+ * round a number to the given number of decimals, or to zero if decimals is
+ * not provided
+ * @param {number} value
+ * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)
+ * @return {number} roundedValue
+ */
+function roundNumber(value) {
+  let decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  if (!(0, _number.isInteger)(decimals) || decimals < 0 || decimals > 15) {
+    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');
+  }
+  return parseFloat((0, _number.toFixed)(value, decimals));
+}
+
+/**
+ * Calculate the norm of a number, the absolute value.
+ * @param {number} x
+ * @return {number}
+ */
+function normNumber(x) {
+  return Math.abs(x);
+}
+normNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/bitwise.js b/node_modules/mathjs/lib/cjs/plain/number/bitwise.js
new file mode 100644
index 0000000..36e24cc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/bitwise.js
@@ -0,0 +1,64 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndNumber = bitAndNumber;
+exports.bitNotNumber = bitNotNumber;
+exports.bitOrNumber = bitOrNumber;
+exports.bitXorNumber = bitXorNumber;
+exports.leftShiftNumber = leftShiftNumber;
+exports.rightArithShiftNumber = rightArithShiftNumber;
+exports.rightLogShiftNumber = rightLogShiftNumber;
+var _number = require("../../utils/number.js");
+const n1 = 'number';
+const n2 = 'number, number';
+function bitAndNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+  return x & y;
+}
+bitAndNumber.signature = n2;
+function bitNotNumber(x) {
+  if (!(0, _number.isInteger)(x)) {
+    throw new Error('Integer expected in function bitNot');
+  }
+  return ~x;
+}
+bitNotNumber.signature = n1;
+function bitOrNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitOr');
+  }
+  return x | y;
+}
+bitOrNumber.signature = n2;
+function bitXorNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function bitXor');
+  }
+  return x ^ y;
+}
+bitXorNumber.signature = n2;
+function leftShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function leftShift');
+  }
+  return x << y;
+}
+leftShiftNumber.signature = n2;
+function rightArithShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+  return x >> y;
+}
+rightArithShiftNumber.signature = n2;
+function rightLogShiftNumber(x, y) {
+  if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
+    throw new Error('Integers expected in function rightLogShift');
+  }
+  return x >>> y;
+}
+rightLogShiftNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/combinations.js b/node_modules/mathjs/lib/cjs/plain/number/combinations.js
new file mode 100644
index 0000000..5a66705
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/combinations.js
@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.combinationsNumber = combinationsNumber;
+var _number = require("../../utils/number.js");
+var _product = require("../../utils/product.js");
+function combinationsNumber(n, k) {
+  if (!(0, _number.isInteger)(n) || n < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+  if (!(0, _number.isInteger)(k) || k < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+  if (k > n) {
+    throw new TypeError('k must be less than or equal to n');
+  }
+  const nMinusk = n - k;
+  let answer = 1;
+  const firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;
+  let nextdivisor = 2;
+  const lastdivisor = k < nMinusk ? k : nMinusk;
+  // balance multiplications and divisions to try to keep intermediate values
+  // in exact-integer range as long as possible
+  for (let nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
+  }
+  // for big n, k, floating point may have caused weirdness in remainder
+  if (nextdivisor <= lastdivisor) {
+    answer /= (0, _product.product)(nextdivisor, lastdivisor);
+  }
+  return answer;
+}
+combinationsNumber.signature = 'number, number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/constants.js b/node_modules/mathjs/lib/cjs/plain/number/constants.js
new file mode 100644
index 0000000..e177333
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/constants.js
@@ -0,0 +1,10 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.tau = exports.pi = exports.phi = exports.e = void 0;
+const pi = exports.pi = Math.PI;
+const tau = exports.tau = 2 * Math.PI;
+const e = exports.e = Math.E;
+const phi = exports.phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/index.js b/node_modules/mathjs/lib/cjs/plain/number/index.js
new file mode 100644
index 0000000..118255a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/index.js
@@ -0,0 +1,104 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var _arithmetic = require("./arithmetic.js");
+Object.keys(_arithmetic).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _arithmetic[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _arithmetic[key];
+    }
+  });
+});
+var _bitwise = require("./bitwise.js");
+Object.keys(_bitwise).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _bitwise[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _bitwise[key];
+    }
+  });
+});
+var _combinations = require("./combinations.js");
+Object.keys(_combinations).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _combinations[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _combinations[key];
+    }
+  });
+});
+var _constants = require("./constants.js");
+Object.keys(_constants).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _constants[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _constants[key];
+    }
+  });
+});
+var _logical = require("./logical.js");
+Object.keys(_logical).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _logical[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _logical[key];
+    }
+  });
+});
+var _relational = require("./relational.js");
+Object.keys(_relational).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _relational[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _relational[key];
+    }
+  });
+});
+var _probability = require("./probability.js");
+Object.keys(_probability).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _probability[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _probability[key];
+    }
+  });
+});
+var _trigonometry = require("./trigonometry.js");
+Object.keys(_trigonometry).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _trigonometry[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _trigonometry[key];
+    }
+  });
+});
+var _utils = require("./utils.js");
+Object.keys(_utils).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _utils[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _utils[key];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/logical.js b/node_modules/mathjs/lib/cjs/plain/number/logical.js
new file mode 100644
index 0000000..b1eb72a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/logical.js
@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.andNumber = andNumber;
+exports.notNumber = notNumber;
+exports.orNumber = orNumber;
+exports.xorNumber = xorNumber;
+const n1 = 'number';
+const n2 = 'number, number';
+function notNumber(x) {
+  return !x;
+}
+notNumber.signature = n1;
+function orNumber(x, y) {
+  return !!(x || y);
+}
+orNumber.signature = n2;
+function xorNumber(x, y) {
+  return !!x !== !!y;
+}
+xorNumber.signature = n2;
+function andNumber(x, y) {
+  return !!(x && y);
+}
+andNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/probability.js b/node_modules/mathjs/lib/cjs/plain/number/probability.js
new file mode 100644
index 0000000..72c7f7e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/probability.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.gammaG = void 0;
+exports.gammaNumber = gammaNumber;
+exports.lgammaN = exports.lgammaG = exports.gammaP = void 0;
+exports.lgammaNumber = lgammaNumber;
+exports.lnSqrt2PI = exports.lgammaSeries = void 0;
+var _number = require("../../utils/number.js");
+var _product = require("../../utils/product.js");
+/* eslint-disable no-loss-of-precision */
+
+function gammaNumber(n) {
+  let x;
+  if ((0, _number.isInteger)(n)) {
+    if (n <= 0) {
+      return isFinite(n) ? Infinity : NaN;
+    }
+    if (n > 171) {
+      return Infinity; // Will overflow
+    }
+    return (0, _product.product)(1, n - 1);
+  }
+  if (n < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));
+  }
+  if (n >= 171.35) {
+    return Infinity; // will overflow
+  }
+  if (n > 85.0) {
+    // Extended Stirling Approx
+    const twoN = n * n;
+    const threeN = twoN * n;
+    const fourN = threeN * n;
+    const fiveN = fourN * n;
+    return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));
+  }
+  --n;
+  x = gammaP[0];
+  for (let i = 1; i < gammaP.length; ++i) {
+    x += gammaP[i] / (n + i);
+  }
+  const t = n + gammaG + 0.5;
+  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;
+}
+gammaNumber.signature = 'number';
+
+// TODO: comment on the variables g and p
+
+const gammaG = exports.gammaG = 4.7421875;
+const gammaP = exports.gammaP = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];
+
+// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code
+
+// log(2 * pi) / 2
+const lnSqrt2PI = exports.lnSqrt2PI = 0.91893853320467274178;
+const lgammaG = exports.lgammaG = 5; // Lanczos parameter "g"
+const lgammaN = exports.lgammaN = 7; // Range of coefficients "n"
+
+const lgammaSeries = exports.lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];
+function lgammaNumber(n) {
+  if (n < 0) return NaN;
+  if (n === 0) return Infinity;
+  if (!isFinite(n)) return n;
+  if (n < 0.5) {
+    // Use Euler's reflection formula:
+    // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))
+    return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n);
+  }
+
+  // Compute the logarithm of the Gamma function using the Lanczos method
+
+  n = n - 1;
+  const base = n + lgammaG + 0.5; // Base of the Lanczos exponential
+  let sum = lgammaSeries[0];
+
+  // We start with the terms that have the smallest coefficients and largest denominator
+  for (let i = lgammaN - 1; i >= 1; i--) {
+    sum += lgammaSeries[i] / (n + i);
+  }
+  return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum);
+}
+lgammaNumber.signature = 'number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/relational.js b/node_modules/mathjs/lib/cjs/plain/number/relational.js
new file mode 100644
index 0000000..9a390c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/relational.js
@@ -0,0 +1 @@
+"use strict";
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js b/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js
new file mode 100644
index 0000000..70c1860
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/trigonometry.js
@@ -0,0 +1,142 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.acosNumber = acosNumber;
+exports.acoshNumber = acoshNumber;
+exports.acotNumber = acotNumber;
+exports.acothNumber = acothNumber;
+exports.acscNumber = acscNumber;
+exports.acschNumber = acschNumber;
+exports.asecNumber = asecNumber;
+exports.asechNumber = asechNumber;
+exports.asinNumber = asinNumber;
+exports.asinhNumber = asinhNumber;
+exports.atan2Number = atan2Number;
+exports.atanNumber = atanNumber;
+exports.atanhNumber = atanhNumber;
+exports.cosNumber = cosNumber;
+exports.coshNumber = coshNumber;
+exports.cotNumber = cotNumber;
+exports.cothNumber = cothNumber;
+exports.cscNumber = cscNumber;
+exports.cschNumber = cschNumber;
+exports.secNumber = secNumber;
+exports.sechNumber = sechNumber;
+exports.sinNumber = sinNumber;
+exports.sinhNumber = sinhNumber;
+exports.tanNumber = tanNumber;
+exports.tanhNumber = tanhNumber;
+var _number = require("../../utils/number.js");
+const n1 = 'number';
+const n2 = 'number, number';
+function acosNumber(x) {
+  return Math.acos(x);
+}
+acosNumber.signature = n1;
+function acoshNumber(x) {
+  return (0, _number.acosh)(x);
+}
+acoshNumber.signature = n1;
+function acotNumber(x) {
+  return Math.atan(1 / x);
+}
+acotNumber.signature = n1;
+function acothNumber(x) {
+  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;
+}
+acothNumber.signature = n1;
+function acscNumber(x) {
+  return Math.asin(1 / x);
+}
+acscNumber.signature = n1;
+function acschNumber(x) {
+  const xInv = 1 / x;
+  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));
+}
+acschNumber.signature = n1;
+function asecNumber(x) {
+  return Math.acos(1 / x);
+}
+asecNumber.signature = n1;
+function asechNumber(x) {
+  const xInv = 1 / x;
+  const ret = Math.sqrt(xInv * xInv - 1);
+  return Math.log(ret + xInv);
+}
+asechNumber.signature = n1;
+function asinNumber(x) {
+  return Math.asin(x);
+}
+asinNumber.signature = n1;
+function asinhNumber(x) {
+  return (0, _number.asinh)(x);
+}
+asinhNumber.signature = n1;
+function atanNumber(x) {
+  return Math.atan(x);
+}
+atanNumber.signature = n1;
+function atan2Number(y, x) {
+  return Math.atan2(y, x);
+}
+atan2Number.signature = n2;
+function atanhNumber(x) {
+  return (0, _number.atanh)(x);
+}
+atanhNumber.signature = n1;
+function cosNumber(x) {
+  return Math.cos(x);
+}
+cosNumber.signature = n1;
+function coshNumber(x) {
+  return (0, _number.cosh)(x);
+}
+coshNumber.signature = n1;
+function cotNumber(x) {
+  return 1 / Math.tan(x);
+}
+cotNumber.signature = n1;
+function cothNumber(x) {
+  const e = Math.exp(2 * x);
+  return (e + 1) / (e - 1);
+}
+cothNumber.signature = n1;
+function cscNumber(x) {
+  return 1 / Math.sin(x);
+}
+cscNumber.signature = n1;
+function cschNumber(x) {
+  // consider values close to zero (+/-)
+  if (x === 0) {
+    return Number.POSITIVE_INFINITY;
+  } else {
+    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * (0, _number.sign)(x);
+  }
+}
+cschNumber.signature = n1;
+function secNumber(x) {
+  return 1 / Math.cos(x);
+}
+secNumber.signature = n1;
+function sechNumber(x) {
+  return 2 / (Math.exp(x) + Math.exp(-x));
+}
+sechNumber.signature = n1;
+function sinNumber(x) {
+  return Math.sin(x);
+}
+sinNumber.signature = n1;
+function sinhNumber(x) {
+  return (0, _number.sinh)(x);
+}
+sinhNumber.signature = n1;
+function tanNumber(x) {
+  return Math.tan(x);
+}
+tanNumber.signature = n1;
+function tanhNumber(x) {
+  return (0, _number.tanh)(x);
+}
+tanhNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/plain/number/utils.js b/node_modules/mathjs/lib/cjs/plain/number/utils.js
new file mode 100644
index 0000000..225a74d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/plain/number/utils.js
@@ -0,0 +1,32 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isIntegerNumber = isIntegerNumber;
+exports.isNaNNumber = isNaNNumber;
+exports.isNegativeNumber = isNegativeNumber;
+exports.isPositiveNumber = isPositiveNumber;
+exports.isZeroNumber = isZeroNumber;
+var _number = require("../../utils/number.js");
+const n1 = 'number';
+function isIntegerNumber(x) {
+  return (0, _number.isInteger)(x);
+}
+isIntegerNumber.signature = n1;
+function isNegativeNumber(x) {
+  return x < 0;
+}
+isNegativeNumber.signature = n1;
+function isPositiveNumber(x) {
+  return x > 0;
+}
+isPositiveNumber.signature = n1;
+function isZeroNumber(x) {
+  return x === 0;
+}
+isZeroNumber.signature = n1;
+function isNaNNumber(x) {
+  return Number.isNaN(x);
+}
+isNaNNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/bigint.js b/node_modules/mathjs/lib/cjs/type/bigint.js
new file mode 100644
index 0000000..7dbbc1f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/bigint.js
@@ -0,0 +1,71 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBigint = void 0;
+var _factory = require("../utils/factory.js");
+var _collection = require("../utils/collection.js");
+const name = 'bigint';
+const dependencies = ['typed'];
+const createBigint = exports.createBigint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Create a bigint or convert a string, boolean, or unit to a bigint.
+   * When value is a matrix, all elements will be converted to bigint.
+   *
+   * Syntax:
+   *
+   *    math.bigint(value)
+   *
+   * Examples:
+   *
+   *    math.bigint(2)                         // returns 2n
+   *    math.bigint('123')                     // returns 123n
+   *    math.bigint(true)                      // returns 1n
+   *    math.bigint([true, false, true, true]) // returns [1n, 0n, 1n, 1n]
+   *
+   * See also:
+   *
+   *    number, bignumber, boolean, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | bigint | Fraction | boolean | Array | Matrix | null} [value]  Value to be converted
+   * @return {bigint | Array | Matrix} The created bigint
+   */
+  const bigint = typed('bigint', {
+    '': function () {
+      return 0n;
+    },
+    bigint: function (x) {
+      return x;
+    },
+    number: function (x) {
+      return BigInt(x.toFixed());
+    },
+    BigNumber: function (x) {
+      return BigInt(x.round().toString());
+    },
+    Fraction: function (x) {
+      return BigInt(x.valueOf().toFixed());
+    },
+    'string | boolean': function (x) {
+      return BigInt(x);
+    },
+    null: function (x) {
+      return 0n;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+
+  // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"bigint","value":"123"}
+  //
+  // into a bigint 123n
+  bigint.fromJSON = function (json) {
+    return BigInt(json.value);
+  };
+  return bigint;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js b/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js
new file mode 100644
index 0000000..2681d08
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/bignumber/BigNumber.js
@@ -0,0 +1,64 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBigNumberClass = void 0;
+var _decimal = _interopRequireDefault(require("decimal.js"));
+var _factory = require("../../utils/factory.js");
+const name = 'BigNumber';
+const dependencies = ['?on', 'config'];
+const createBigNumberClass = exports.createBigNumberClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    on,
+    config
+  } = _ref;
+  const BigNumber = _decimal.default.clone({
+    precision: config.precision,
+    modulo: _decimal.default.EUCLID
+  });
+  BigNumber.prototype = Object.create(BigNumber.prototype);
+
+  /**
+   * Attach type information
+   */
+  BigNumber.prototype.type = 'BigNumber';
+  BigNumber.prototype.isBigNumber = true;
+
+  /**
+   * Get a JSON representation of a BigNumber containing
+   * type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "BigNumber", "value": "0.2"}`
+   */
+  BigNumber.prototype.toJSON = function () {
+    return {
+      mathjs: 'BigNumber',
+      value: this.toString()
+    };
+  };
+
+  /**
+   * Instantiate a BigNumber from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "BigNumber", "value": "0.2"}`
+   * @return {BigNumber}
+   */
+  BigNumber.fromJSON = function (json) {
+    return new BigNumber(json.value);
+  };
+  if (on) {
+    // listen for changed in the configuration, automatically apply changed precision
+    on('config', function (curr, prev) {
+      if (curr.precision !== prev.precision) {
+        BigNumber.config({
+          precision: curr.precision
+        });
+      }
+    });
+  }
+  return BigNumber;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js b/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js
new file mode 100644
index 0000000..c129014
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/bignumber/function/bignumber.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBignumber = void 0;
+var _factory = require("../../../utils/factory.js");
+var _collection = require("../../../utils/collection.js");
+const name = 'bignumber';
+const dependencies = ['typed', 'BigNumber'];
+const createBignumber = exports.createBignumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to BigNumber.
+   *
+   * Syntax:
+   *
+   *    math.bignumber(x)
+   *
+   * Examples:
+   *
+   *    0.1 + 0.2                                  // returns number 0.30000000000000004
+   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3
+   *
+   *
+   *    7.2e500                                    // returns number Infinity
+   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500
+   *
+   * See also:
+   *
+   *    number, bigint, boolean, complex, index, matrix, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | bigint | Array | Matrix | boolean | null} [value]  Value for the big number,
+   *                                                    0 by default.
+   * @returns {BigNumber} The created bignumber
+   */
+  return typed('bignumber', {
+    '': function () {
+      return new BigNumber(0);
+    },
+    number: function (x) {
+      // convert to string to prevent errors in case of >15 digits
+      return new BigNumber(x + '');
+    },
+    string: function (x) {
+      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+      if (wordSizeSuffixMatch) {
+        // x has a word size suffix
+        const size = wordSizeSuffixMatch[2];
+        const n = BigNumber(wordSizeSuffixMatch[1]);
+        const twoPowSize = new BigNumber(2).pow(Number(size));
+        if (n.gt(twoPowSize.sub(1))) {
+          throw new SyntaxError(`String "${x}" is out of range`);
+        }
+        const twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);
+        if (n.gte(twoPowSizeSubOne)) {
+          return n.sub(twoPowSize);
+        } else {
+          return n;
+        }
+      }
+      return new BigNumber(x);
+    },
+    BigNumber: function (x) {
+      // we assume a BigNumber is immutable
+      return x;
+    },
+    bigint: function (x) {
+      return new BigNumber(x.toString());
+    },
+    Unit: typed.referToSelf(self => x => {
+      const clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    Fraction: function (x) {
+      return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));
+    },
+    null: function (_x) {
+      return new BigNumber(0);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/boolean.js b/node_modules/mathjs/lib/cjs/type/boolean.js
new file mode 100644
index 0000000..07301c3
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/boolean.js
@@ -0,0 +1,76 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBoolean = void 0;
+var _factory = require("../utils/factory.js");
+var _collection = require("../utils/collection.js");
+const name = 'boolean';
+const dependencies = ['typed'];
+const createBoolean = exports.createBoolean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Create a boolean or convert a string or number to a boolean.
+   * In case of a number, `true` is returned for non-zero numbers, and `false` in
+   * case of zero.
+   * Strings can be `'true'` or `'false'`, or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   *
+   * Syntax:
+   *
+   *    math.boolean(x)
+   *
+   * Examples:
+   *
+   *    math.boolean(0)     // returns false
+   *    math.boolean(1)     // returns true
+   *    math.boolean(-3)     // returns true
+   *    math.boolean('true')     // returns true
+   *    math.boolean('false')     // returns false
+   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]
+   *
+   * See also:
+   *
+   *    bignumber, complex, index, matrix, string, unit
+   *
+   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type
+   * @return {boolean | Array | Matrix} The boolean value
+   */
+  return typed(name, {
+    '': function () {
+      return false;
+    },
+    boolean: function (x) {
+      return x;
+    },
+    number: function (x) {
+      return !!x;
+    },
+    null: function (x) {
+      return false;
+    },
+    BigNumber: function (x) {
+      return !x.isZero();
+    },
+    string: function (x) {
+      // try case insensitive
+      const lcase = x.toLowerCase();
+      if (lcase === 'true') {
+        return true;
+      } else if (lcase === 'false') {
+        return false;
+      }
+
+      // test whether value is a valid number
+      const num = Number(x);
+      if (x !== '' && !isNaN(num)) {
+        return !!num;
+      }
+      throw new Error('Cannot convert "' + x + '" to a boolean');
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/chain/Chain.js b/node_modules/mathjs/lib/cjs/type/chain/Chain.js
new file mode 100644
index 0000000..b592898
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/chain/Chain.js
@@ -0,0 +1,216 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createChainClass = void 0;
+var _is = require("../../utils/is.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+var _factory = require("../../utils/factory.js");
+const name = 'Chain';
+const dependencies = ['?on', 'math', 'typed'];
+const createChainClass = exports.createChainClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    on,
+    math,
+    typed
+  } = _ref;
+  /**
+   * @constructor Chain
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing chain.done(), which will return
+   * the final value.
+   *
+   * The Chain has a number of special functions:
+   * - done()             Finalize the chained operation and return the
+   *                      chain's value.
+   * - valueOf()          The same as done()
+   * - toString()         Returns a string representation of the chain's value.
+   *
+   * @param {*} [value]
+   */
+  function Chain(value) {
+    if (!(this instanceof Chain)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if ((0, _is.isChain)(value)) {
+      this.value = value.value;
+    } else {
+      this.value = value;
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Chain.prototype.type = 'Chain';
+  Chain.prototype.isChain = true;
+
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method valueOf()
+   * @returns {*} value
+   */
+  Chain.prototype.done = function () {
+    return this.value;
+  };
+
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method done()
+   * @returns {*} value
+   */
+  Chain.prototype.valueOf = function () {
+    return this.value;
+  };
+
+  /**
+   * Get a string representation of the value in the chain
+   * @returns {string}
+   */
+  Chain.prototype.toString = function () {
+    return (0, _string.format)(this.value);
+  };
+
+  /**
+   * Get a JSON representation of the chain
+   * @returns {Object}
+   */
+  Chain.prototype.toJSON = function () {
+    return {
+      mathjs: 'Chain',
+      value: this.value
+    };
+  };
+
+  /**
+   * Instantiate a Chain from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "Chain", value: ...}`,
+   *                       where mathjs is optional
+   * @returns {Chain}
+   */
+  Chain.fromJSON = function (json) {
+    return new Chain(json.value);
+  };
+
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {Function} fn      The function to be proxied
+   *                           If fn is no function, it is silently ignored.
+   * @private
+   */
+  function createProxy(name, fn) {
+    if (typeof fn === 'function') {
+      Chain.prototype[name] = chainify(fn);
+    }
+  }
+
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {function} resolver   The function resolving with the
+   *                              function to be proxied
+   * @private
+   */
+  function createLazyProxy(name, resolver) {
+    (0, _object.lazy)(Chain.prototype, name, function outerResolver() {
+      const fn = resolver();
+      if (typeof fn === 'function') {
+        return chainify(fn);
+      }
+      return undefined; // if not a function, ignore
+    });
+  }
+
+  /**
+   * Make a function chainable
+   * @param {function} fn
+   * @return {Function} chain function
+   * @private
+   */
+  function chainify(fn) {
+    return function () {
+      // Here, `this` will be the context of a Chain instance
+      if (arguments.length === 0) {
+        return new Chain(fn(this.value));
+      }
+      const args = [this.value];
+      for (let i = 0; i < arguments.length; i++) {
+        args[i + 1] = arguments[i];
+      }
+      if (typed.isTypedFunction(fn)) {
+        const sigObject = typed.resolve(fn, args);
+        // We want to detect if a rest parameter has matched across the
+        // value in the chain and the current arguments of this call.
+        // That is the case if and only if the matching signature has
+        // exactly one parameter (which then must be a rest parameter
+        // as it is matching at least two actual arguments).
+        if (sigObject.params.length === 1) {
+          throw new Error('chain function ' + fn.name + ' cannot match rest parameter between chain value and additional arguments.');
+        }
+        return new Chain(sigObject.implementation.apply(fn, args));
+      }
+      return new Chain(fn.apply(fn, args));
+    };
+  }
+
+  /**
+   * Create a proxy for a single method, or an object with multiple methods.
+   * Example usage:
+   *
+   *   Chain.createProxy('add', function add (x, y) {...})
+   *   Chain.createProxy({
+   *     add:      function add (x, y) {...},
+   *     subtract: function subtract (x, y) {...}
+   *   }
+   *
+   * @param {string | Object} arg0   A name (string), or an object with
+   *                                 functions
+   * @param {*} [arg1]               A function, when arg0 is a name
+   */
+  Chain.createProxy = function (arg0, arg1) {
+    if (typeof arg0 === 'string') {
+      // createProxy(name, value)
+      createProxy(arg0, arg1);
+    } else {
+      // createProxy(values)
+      for (const name in arg0) {
+        if ((0, _object.hasOwnProperty)(arg0, name) && excludedNames[name] === undefined) {
+          createLazyProxy(name, () => arg0[name]);
+        }
+      }
+    }
+  };
+  const excludedNames = {
+    expression: true,
+    docs: true,
+    type: true,
+    classes: true,
+    json: true,
+    error: true,
+    isChain: true // conflicts with the property isChain of a Chain instance
+  };
+
+  // create proxy for everything that is in math.js
+  Chain.createProxy(math);
+
+  // register on the import event, automatically add a proxy for every imported function.
+  if (on) {
+    on('import', function (name, resolver, path) {
+      if (!path) {
+        // an imported function (not a data type or something special)
+        createLazyProxy(name, resolver);
+      }
+    });
+  }
+  return Chain;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/chain/function/chain.js b/node_modules/mathjs/lib/cjs/type/chain/function/chain.js
new file mode 100644
index 0000000..7911b64
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/chain/function/chain.js
@@ -0,0 +1,58 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createChain = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'chain';
+const dependencies = ['typed', 'Chain'];
+const createChain = exports.createChain = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Chain
+  } = _ref;
+  /**
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing `chain.done()`, which returns
+   * the final value.
+   *
+   * The chain has a number of special functions:
+   *
+   * - `done()`     Finalize the chain and return the chain's value.
+   * - `valueOf()`  The same as `done()`
+   * - `toString()` Executes `math.format()` onto the chain's value, returning
+   *                a string representation of the value.
+   *
+   * Syntax:
+   *
+   *    math.chain(value)
+   *
+   * Examples:
+   *
+   *     math.chain(3)
+   *         .add(4)
+   *         .subtract(2)
+   *         .done()     // 5
+   *
+   *     math.chain( [[1, 2], [3, 4]] )
+   *         .subset(math.index(0, 0), 8)
+   *         .multiply(3)
+   *         .done()     // [[24, 6], [9, 12]]
+   *
+   * @param {*} [value]   A value of any type on which to start a chained operation.
+   * @return {math.Chain} The created chain
+   */
+  return typed(name, {
+    '': function () {
+      return new Chain();
+    },
+    any: function (value) {
+      return new Chain(value);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/complex/Complex.js b/node_modules/mathjs/lib/cjs/type/complex/Complex.js
new file mode 100644
index 0000000..d0eecba
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/complex/Complex.js
@@ -0,0 +1,201 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplexClass = void 0;
+var _complex = _interopRequireDefault(require("complex.js"));
+var _number = require("../../utils/number.js");
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+const name = 'Complex';
+const dependencies = [];
+const createComplexClass = exports.createComplexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(_complex.default, 'name', {
+    value: 'Complex'
+  });
+  _complex.default.prototype.constructor = _complex.default;
+  _complex.default.prototype.type = 'Complex';
+  _complex.default.prototype.isComplex = true;
+
+  /**
+   * Get a JSON representation of the complex number
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Complex", "re": 2, "im": 3}`
+   */
+  _complex.default.prototype.toJSON = function () {
+    return {
+      mathjs: 'Complex',
+      re: this.re,
+      im: this.im
+    };
+  };
+
+  /*
+   * Return the value of the complex number in polar notation
+   * The angle phi will be set in the interval of [-pi, pi].
+   * @return {{r: number, phi: number}} Returns and object with properties r and phi.
+   */
+  _complex.default.prototype.toPolar = function () {
+    return {
+      r: this.abs(),
+      phi: this.arg()
+    };
+  };
+
+  /**
+   * Get a string representation of the complex number,
+   * with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string} str
+   */
+  _complex.default.prototype.format = function (options) {
+    let str = '';
+    let im = this.im;
+    let re = this.re;
+    const strRe = (0, _number.format)(this.re, options);
+    const strIm = (0, _number.format)(this.im, options);
+
+    // round either re or im when smaller than the configured precision
+    const precision = (0, _is.isNumber)(options) ? options : options ? options.precision : null;
+    if (precision !== null) {
+      const epsilon = Math.pow(10, -precision);
+      if (Math.abs(re / im) < epsilon) {
+        re = 0;
+      }
+      if (Math.abs(im / re) < epsilon) {
+        im = 0;
+      }
+    }
+    if (im === 0) {
+      // real value
+      str = strRe;
+    } else if (re === 0) {
+      // purely complex value
+      if (im === 1) {
+        str = 'i';
+      } else if (im === -1) {
+        str = '-i';
+      } else {
+        str = strIm + 'i';
+      }
+    } else {
+      // complex value
+      if (im < 0) {
+        if (im === -1) {
+          str = strRe + ' - i';
+        } else {
+          str = strRe + ' - ' + strIm.substring(1) + 'i';
+        }
+      } else {
+        if (im === 1) {
+          str = strRe + ' + i';
+        } else {
+          str = strRe + ' + ' + strIm + 'i';
+        }
+      }
+    }
+    return str;
+  };
+
+  /**
+   * Create a complex number from polar coordinates
+   *
+   * Usage:
+   *
+   *     Complex.fromPolar(r: number, phi: number) : Complex
+   *     Complex.fromPolar({r: number, phi: number}) : Complex
+   *
+   * @param {*} args...
+   * @return {Complex}
+   */
+  _complex.default.fromPolar = function (args) {
+    switch (arguments.length) {
+      case 1:
+        {
+          const arg = arguments[0];
+          if (typeof arg === 'object') {
+            return (0, _complex.default)(arg);
+          } else {
+            throw new TypeError('Input has to be an object with r and phi keys.');
+          }
+        }
+      case 2:
+        {
+          const r = arguments[0];
+          let phi = arguments[1];
+          if ((0, _is.isNumber)(r)) {
+            if ((0, _is.isUnit)(phi) && phi.hasBase('ANGLE')) {
+              // convert unit to a number in radians
+              phi = phi.toNumber('rad');
+            }
+            if ((0, _is.isNumber)(phi)) {
+              return new _complex.default({
+                r,
+                phi
+              });
+            }
+            throw new TypeError('Phi is not a number nor an angle unit.');
+          } else {
+            throw new TypeError('Radius r is not a number.');
+          }
+        }
+      default:
+        throw new SyntaxError('Wrong number of arguments in function fromPolar');
+    }
+  };
+  _complex.default.prototype.valueOf = _complex.default.prototype.toString;
+
+  /**
+   * Create a Complex number from a JSON object
+   * @param {Object} json  A JSON Object structured as
+   *                       {"mathjs": "Complex", "re": 2, "im": 3}
+   *                       All properties are optional, default values
+   *                       for `re` and `im` are 0.
+   * @return {Complex} Returns a new Complex number
+   */
+  _complex.default.fromJSON = function (json) {
+    return new _complex.default(json);
+  };
+
+  /**
+   * Compare two complex numbers, `a` and `b`:
+   *
+   * - Returns 1 when the real part of `a` is larger than the real part of `b`
+   * - Returns -1 when the real part of `a` is smaller than the real part of `b`
+   * - Returns 1 when the real parts are equal
+   *   and the imaginary part of `a` is larger than the imaginary part of `b`
+   * - Returns -1 when the real parts are equal
+   *   and the imaginary part of `a` is smaller than the imaginary part of `b`
+   * - Returns 0 when both real and imaginary parts are equal.
+   *
+   * @params {Complex} a
+   * @params {Complex} b
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  _complex.default.compare = function (a, b) {
+    if (a.re > b.re) {
+      return 1;
+    }
+    if (a.re < b.re) {
+      return -1;
+    }
+    if (a.im > b.im) {
+      return 1;
+    }
+    if (a.im < b.im) {
+      return -1;
+    }
+    return 0;
+  };
+  return _complex.default;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/complex/function/complex.js b/node_modules/mathjs/lib/cjs/type/complex/function/complex.js
new file mode 100644
index 0000000..a48a0c6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/complex/function/complex.js
@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createComplex = void 0;
+var _factory = require("../../../utils/factory.js");
+var _collection = require("../../../utils/collection.js");
+const name = 'complex';
+const dependencies = ['typed', 'Complex'];
+const createComplex = exports.createComplex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Complex
+  } = _ref;
+  /**
+   * Create a complex value or convert a value to a complex value.
+   *
+   * Syntax:
+   *
+   *     math.complex()                           // creates a complex value with zero
+   *                                              // as real and imaginary part.
+   *     math.complex(re : number, im : string)   // creates a complex value with provided
+   *                                              // values for real and imaginary part.
+   *     math.complex(re : number)                // creates a complex value with provided
+   *                                              // real value and zero imaginary part.
+   *     math.complex(complex : Complex)          // clones the provided complex value.
+   *     math.complex(arg : string)               // parses a string into a complex value.
+   *     math.complex(array : Array)              // converts the elements of the array
+   *                                              // or matrix element wise into a
+   *                                              // complex value.
+   *     math.complex({re: number, im: number})   // creates a complex value with provided
+   *                                              // values for real an imaginary part.
+   *     math.complex({r: number, phi: number})   // creates a complex value with provided
+   *                                              // polar coordinates
+   *
+   * Examples:
+   *
+   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i
+   *    a.re = 5                          // a = Complex 5 - 4i
+   *    const i = a.im                    // Number -4
+   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i
+   *    const c = math.complex()          // Complex 0 + 0i
+   *    const d = math.add(a, b)          // Complex 5 + 2i
+   *
+   * See also:
+   *
+   *    bignumber, boolean, index, matrix, number, string, unit
+   *
+   * @param {* | Array | Matrix} [args]
+   *            Arguments specifying the real and imaginary part of the complex number
+   * @return {Complex | Array | Matrix} Returns a complex value
+   */
+  return typed('complex', {
+    '': function () {
+      return Complex.ZERO;
+    },
+    number: function (x) {
+      return new Complex(x, 0);
+    },
+    'number, number': function (re, im) {
+      return new Complex(re, im);
+    },
+    // TODO: this signature should be redundant
+    'BigNumber, BigNumber': function (re, im) {
+      return new Complex(re.toNumber(), im.toNumber());
+    },
+    Fraction: function (x) {
+      return new Complex(x.valueOf(), 0);
+    },
+    Complex: function (x) {
+      return x.clone();
+    },
+    string: function (x) {
+      return Complex(x); // for example '2 + 3i'
+    },
+    null: function (x) {
+      return Complex(0);
+    },
+    Object: function (x) {
+      if ('re' in x && 'im' in x) {
+        return new Complex(x.re, x.im);
+      }
+      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {
+        return new Complex(x);
+      }
+      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js b/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js
new file mode 100644
index 0000000..2bcde78
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/fraction/Fraction.js
@@ -0,0 +1,48 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFractionClass = void 0;
+var _fraction = _interopRequireDefault(require("fraction.js"));
+var _factory = require("../../utils/factory.js");
+const name = 'Fraction';
+const dependencies = [];
+const createFractionClass = exports.createFractionClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(_fraction.default, 'name', {
+    value: 'Fraction'
+  });
+  _fraction.default.prototype.constructor = _fraction.default;
+  _fraction.default.prototype.type = 'Fraction';
+  _fraction.default.prototype.isFraction = true;
+
+  /**
+   * Get a JSON representation of a Fraction containing type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Fraction", "n": "3", "d": "8"}`
+   */
+  _fraction.default.prototype.toJSON = function () {
+    return {
+      mathjs: 'Fraction',
+      n: String(this.s * this.n),
+      d: String(this.d)
+    };
+  };
+
+  /**
+   * Instantiate a Fraction from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "Fraction", "n": "3", "d": "8"}`
+   * @return {BigNumber}
+   */
+  _fraction.default.fromJSON = function (json) {
+    return new _fraction.default(json);
+  };
+  return _fraction.default;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js b/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js
new file mode 100644
index 0000000..8f8a6dd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/fraction/function/fraction.js
@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFraction = void 0;
+var _factory = require("../../../utils/factory.js");
+var _collection = require("../../../utils/collection.js");
+const name = 'fraction';
+const dependencies = ['typed', 'Fraction'];
+const createFraction = exports.createFraction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Fraction
+  } = _ref;
+  /**
+   * Create a fraction or convert a value to a fraction.
+   *
+   * With one numeric argument, produces the closest rational approximation to the
+   * input.
+   * With two arguments, the first is the numerator and the second is the denominator,
+   * and creates the corresponding fraction. Both numerator and denominator must be
+   * integers.
+   * With one object argument, looks for the integer numerator as the value of property
+   * 'n' and the integer denominator as the value of property 'd'.
+   * With a matrix argument, creates a matrix of the same shape with entries
+   * converted into fractions.
+   *
+   * Syntax:
+   *     math.fraction(value)
+   *     math.fraction(numerator, denominator)
+   *     math.fraction({n: numerator, d: denominator})
+   *     math.fraction(matrix: Array | Matrix)
+   *
+   * Examples:
+   *
+   *     math.fraction(6.283)             // returns Fraction 6283/1000
+   *     math.fraction(1, 3)              // returns Fraction 1/3
+   *     math.fraction('2/3')             // returns Fraction 2/3
+   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3
+   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]
+   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer
+   *
+   * See also:
+   *
+   *    bignumber, number, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | bigint | Unit | Array | Matrix} [args]
+   *            Arguments specifying the value, or numerator and denominator of
+   *            the fraction
+   * @return {Fraction | Array | Matrix} Returns a fraction
+   */
+  return typed('fraction', {
+    number: function (x) {
+      if (!isFinite(x) || isNaN(x)) {
+        throw new Error(x + ' cannot be represented as a fraction');
+      }
+      return new Fraction(x);
+    },
+    string: function (x) {
+      return new Fraction(x);
+    },
+    'number, number': function (numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    'bigint, bigint': function (numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    null: function (x) {
+      return new Fraction(0);
+    },
+    BigNumber: function (x) {
+      return new Fraction(x.toString());
+    },
+    bigint: function (x) {
+      return new Fraction(x.toString());
+    },
+    Fraction: function (x) {
+      return x; // fractions are immutable
+    },
+    Unit: typed.referToSelf(self => x => {
+      const clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    Object: function (x) {
+      return new Fraction(x);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js
new file mode 100644
index 0000000..083dfc8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/DenseMatrix.js
@@ -0,0 +1,1038 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createDenseMatrixClass = void 0;
+var _is = require("../../utils/is.js");
+var _array = require("../../utils/array.js");
+var _string = require("../../utils/string.js");
+var _number = require("../../utils/number.js");
+var _object = require("../../utils/object.js");
+var _DimensionError = require("../../error/DimensionError.js");
+var _factory = require("../../utils/factory.js");
+var _optimizeCallback = require("../../utils/optimizeCallback.js");
+// deno-lint-ignore-file no-this-alias
+
+const name = 'DenseMatrix';
+const dependencies = ['Matrix'];
+const createDenseMatrixClass = exports.createDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    Matrix
+  } = _ref;
+  /**
+   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
+   * @class DenseMatrix
+   * @enum {{ value, index: number[] }}
+   */
+  function DenseMatrix(data, datatype) {
+    if (!(this instanceof DenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if ((0, _is.isMatrix)(data)) {
+      // check data is a DenseMatrix
+      if (data.type === 'DenseMatrix') {
+        // clone data & size
+        this._data = (0, _object.clone)(data._data);
+        this._size = (0, _object.clone)(data._size);
+        this._datatype = datatype || data._datatype;
+      } else {
+        // build data from existing matrix
+        this._data = data.toArray();
+        this._size = data.size();
+        this._datatype = datatype || data._datatype;
+      }
+    } else if (data && (0, _is.isArray)(data.data) && (0, _is.isArray)(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      // verify the dimensions of the array
+      (0, _array.validate)(this._data, this._size);
+      this._datatype = datatype || data.datatype;
+    } else if ((0, _is.isArray)(data)) {
+      // replace nested Matrices with Arrays
+      this._data = preprocess(data);
+      // get the dimensions of the array
+      this._size = (0, _array.arraySize)(this._data);
+      // verify the dimensions of the array, TODO: compute size while processing array
+      (0, _array.validate)(this._data, this._size);
+      // data type unknown
+      this._datatype = datatype;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+    }
+  }
+  DenseMatrix.prototype = new Matrix();
+
+  /**
+   * Create a new DenseMatrix
+   */
+  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(DenseMatrix, 'name', {
+    value: 'DenseMatrix'
+  });
+  DenseMatrix.prototype.constructor = DenseMatrix;
+  DenseMatrix.prototype.type = 'DenseMatrix';
+  DenseMatrix.prototype.isDenseMatrix = true;
+
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf DenseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+  DenseMatrix.prototype.getDataType = function () {
+    return (0, _array.getArrayDataType)(this._data, _is.typeOf);
+  };
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()  // retrieve storage format
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The storage format.
+   */
+  DenseMatrix.prototype.storage = function () {
+    return 'dense';
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()   // retrieve matrix datatype
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The datatype.
+   */
+  DenseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+
+  /**
+   * Create a new DenseMatrix
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+  DenseMatrix.prototype.create = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof DenseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    switch (arguments.length) {
+      case 1:
+        return _get(this, index);
+
+      // intentional fall through
+      case 2:
+      case 3:
+        return _set(this, index, replacement, defaultValue);
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  /**
+   * Get a single element from the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  DenseMatrix.prototype.get = function (index) {
+    return (0, _array.get)(this._data, index);
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {DenseMatrix} self
+   */
+  DenseMatrix.prototype.set = function (index, value, defaultValue) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length < this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length, '<');
+    }
+    let i, ii, indexI;
+
+    // enlarge matrix when needed
+    const size = index.map(function (i) {
+      return i + 1;
+    });
+    _fit(this, size, defaultValue);
+
+    // traverse over the dimensions
+    let data = this._data;
+    for (i = 0, ii = index.length - 1; i < ii; i++) {
+      indexI = index[i];
+      (0, _array.validateIndex)(indexI, data.length);
+      data = data[indexI];
+    }
+
+    // set new value
+    indexI = index[index.length - 1];
+    (0, _array.validateIndex)(indexI, data.length);
+    data[indexI] = value;
+    return this;
+  };
+
+  /**
+   * Get a submatrix of this matrix
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index   Zero-based index
+   * @private
+   */
+  function _get(matrix, index) {
+    if (!(0, _is.isIndex)(index)) {
+      throw new TypeError('Invalid index');
+    }
+    const isScalar = index.isScalar();
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(index.min());
+    } else {
+      // validate dimensions
+      const size = index.size();
+      if (size.length !== matrix._size.length) {
+        throw new _DimensionError.DimensionError(size.length, matrix._size.length);
+      }
+
+      // validate if any of the ranges in the index is out of range
+      const min = index.min();
+      const max = index.max();
+      for (let i = 0, ii = matrix._size.length; i < ii; i++) {
+        (0, _array.validateIndex)(min[i], matrix._size[i]);
+        (0, _array.validateIndex)(max[i], matrix._size[i]);
+      }
+
+      // retrieve submatrix
+      const returnMatrix = new DenseMatrix([]);
+      const submatrix = _getSubmatrix(matrix._data, index);
+      returnMatrix._size = submatrix.size;
+      returnMatrix._datatype = matrix._datatype;
+      returnMatrix._data = submatrix.data;
+      return returnMatrix;
+    }
+  }
+
+  /**
+   * Get a submatrix of a multi dimensional matrix.
+   * Index is not checked for correct number or length of dimensions.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @return {Array} submatrix
+   * @private
+   */
+  function _getSubmatrix(data, index) {
+    const maxDepth = index.size().length - 1;
+    const size = Array(maxDepth);
+    return {
+      data: getSubmatrixRecursive(data),
+      size
+    };
+    function getSubmatrixRecursive(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      const ranges = index.dimension(depth);
+      size[depth] = ranges.size()[0];
+      if (depth < maxDepth) {
+        return ranges.map(rangeIndex => {
+          (0, _array.validateIndex)(rangeIndex, data.length);
+          return getSubmatrixRecursive(data[rangeIndex], depth + 1);
+        }).valueOf();
+      } else {
+        return ranges.map(rangeIndex => {
+          (0, _array.validateIndex)(rangeIndex, data.length);
+          return data[rangeIndex];
+        }).valueOf();
+      }
+    }
+  }
+
+  /**
+   * Replace a submatrix in this matrix
+   * Indexes are zero-based.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index
+   * @param {DenseMatrix | Array | *} submatrix
+   * @param {*} defaultValue          Default value, filled in on new entries when
+   *                                  the matrix is resized.
+   * @return {DenseMatrix} matrix
+   * @private
+   */
+  function _set(matrix, index, submatrix, defaultValue) {
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    }
+
+    // get index size and check whether the index contains a single value
+    const iSize = index.size();
+    const isScalar = index.isScalar();
+
+    // calculate the size of the submatrix, and convert it into an Array if needed
+    let sSize;
+    if ((0, _is.isMatrix)(submatrix)) {
+      sSize = submatrix.size();
+      submatrix = submatrix.valueOf();
+    } else {
+      sSize = (0, _array.arraySize)(submatrix);
+    }
+    if (isScalar) {
+      // set a scalar
+
+      // check whether submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // set a submatrix
+
+      // broadcast submatrix
+      if (!(0, _object.deepStrictEqual)(sSize, iSize)) {
+        try {
+          if (sSize.length === 0) {
+            submatrix = (0, _array.broadcastTo)([submatrix], iSize);
+          } else {
+            submatrix = (0, _array.broadcastTo)(submatrix, iSize);
+          }
+          sSize = (0, _array.arraySize)(submatrix);
+        } catch (_unused) {}
+      }
+
+      // validate dimensions
+      if (iSize.length < matrix._size.length) {
+        throw new _DimensionError.DimensionError(iSize.length, matrix._size.length, '<');
+      }
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        let i = 0;
+        let outer = 0;
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        }
+
+        // unsqueeze both outer and inner dimensions
+        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);
+      }
+
+      // check whether the size of the submatrix matches the index size
+      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {
+        throw new _DimensionError.DimensionError(iSize, sSize, '>');
+      }
+
+      // enlarge matrix when needed
+      const size = index.max().map(function (i) {
+        return i + 1;
+      });
+      _fit(matrix, size, defaultValue);
+
+      // insert the sub matrix
+      _setSubmatrix(matrix._data, index, submatrix);
+    }
+    return matrix;
+  }
+
+  /**
+   * Replace a submatrix of a multi dimensional matrix.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {Array} submatrix
+   * @private
+   */
+  function _setSubmatrix(data, index, submatrix) {
+    const maxDepth = index.size().length - 1;
+    setSubmatrixRecursive(data, submatrix);
+    function setSubmatrixRecursive(data, submatrix) {
+      let depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+      const range = index.dimension(depth);
+      if (depth < maxDepth) {
+        range.forEach((rangeIndex, i) => {
+          (0, _array.validateIndex)(rangeIndex, data.length);
+          setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);
+        });
+      } else {
+        range.forEach((rangeIndex, i) => {
+          (0, _array.validateIndex)(rangeIndex, data.length);
+          data[rangeIndex] = submatrix[i[0]];
+        });
+      }
+    }
+  }
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof DenseMatrix
+   * @param {number[] || Matrix} size The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!(0, _is.isCollection)(size)) {
+      throw new TypeError('Array or Matrix expected');
+    }
+
+    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+    const sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+
+    // matrix to resize
+    const m = copy ? this.clone() : this;
+    // resize matrix
+    return _resize(m, sizeArray, defaultValue);
+  };
+  function _resize(matrix, size, defaultValue) {
+    // check size
+    if (size.length === 0) {
+      // first value in matrix
+      let v = matrix._data;
+      // go deep
+      while ((0, _is.isArray)(v)) {
+        v = v[0];
+      }
+      return v;
+    }
+    // resize matrix
+    matrix._size = size.slice(0); // copy the array
+    matrix._data = (0, _array.resize)(matrix._data, matrix._size, defaultValue);
+    // return matrix
+    return matrix;
+  }
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof DenseMatrix
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  DenseMatrix.prototype.reshape = function (size, copy) {
+    const m = copy ? this.clone() : this;
+    m._data = (0, _array.reshape)(m._data, size);
+    const currentLength = m._size.reduce((length, size) => length * size);
+    m._size = (0, _array.processSizesWildcard)(size, currentLength);
+    return m;
+  };
+
+  /**
+   * Enlarge the matrix when it is smaller than given size.
+   * If the matrix is larger or equal sized, nothing is done.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix           The matrix to be resized
+   * @param {number[]} size
+   * @param {*} defaultValue          Default value, filled in on new entries.
+   * @private
+   */
+  function _fit(matrix, size, defaultValue) {
+    const
+    // copy the array
+    newSize = matrix._size.slice(0);
+    let changed = false;
+
+    // add dimensions when needed
+    while (newSize.length < size.length) {
+      newSize.push(0);
+      changed = true;
+    }
+
+    // enlarge size when needed
+    for (let i = 0, ii = size.length; i < ii; i++) {
+      if (size[i] > newSize[i]) {
+        newSize[i] = size[i];
+        changed = true;
+      }
+    }
+    if (changed) {
+      // resize only when size is changed
+      _resize(matrix, newSize, defaultValue);
+    }
+  }
+
+  /**
+   * Create a clone of the matrix
+   * @memberof DenseMatrix
+   * @return {DenseMatrix} clone
+   */
+  DenseMatrix.prototype.clone = function () {
+    const m = new DenseMatrix({
+      data: (0, _object.clone)(this._data),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof DenseMatrix
+   * @returns {number[]} size
+   */
+  DenseMatrix.prototype.size = function () {
+    return this._size.slice(0); // return a clone of _size
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
+   *
+   * @return {DenseMatrix} matrix
+   */
+  DenseMatrix.prototype.map = function (callback) {
+    let skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    const me = this;
+    const maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return me.clone();
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me, 'map', isUnary);
+    const fastCallbackFn = fastCallback.fn;
+    const result = me.create(undefined, me._datatype);
+    result._size = me._size;
+    if (isUnary || fastCallback.isUnary) {
+      result._data = iterateUnary(me._data);
+      return result;
+    }
+    if (maxDepth === 0) {
+      const inputData = me.valueOf();
+      const data = Array(inputData.length);
+      for (let i = 0; i < inputData.length; i++) {
+        data[i] = fastCallbackFn(inputData[i], [i], me);
+      }
+      result._data = data;
+      return result;
+    }
+    const index = [];
+    result._data = iterate(me._data);
+    return result;
+    function iterate(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      const result = Array(data.length);
+      if (depth < maxDepth) {
+        for (let i = 0; i < data.length; i++) {
+          index[depth] = i;
+          result[i] = iterate(data[i], depth + 1);
+        }
+      } else {
+        for (let i = 0; i < data.length; i++) {
+          index[depth] = i;
+          result[i] = fastCallbackFn(data[i], index.slice(), me);
+        }
+      }
+      return result;
+    }
+    function iterateUnary(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      const result = Array(data.length);
+      if (depth < maxDepth) {
+        for (let i = 0; i < data.length; i++) {
+          result[i] = iterateUnary(data[i], depth + 1);
+        }
+      } else {
+        for (let i = 0; i < data.length; i++) {
+          result[i] = fastCallbackFn(data[i]);
+        }
+      }
+      return result;
+    }
+  };
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
+   */
+  DenseMatrix.prototype.forEach = function (callback) {
+    let skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    let isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    const me = this;
+    const maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return;
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me, 'map', isUnary);
+    const fastCallbackFn = fastCallback.fn;
+    if (isUnary || fastCallback.isUnary) {
+      iterateUnary(me._data);
+      return;
+    }
+    if (maxDepth === 0) {
+      for (let i = 0; i < me._data.length; i++) {
+        fastCallbackFn(me._data[i], [i], me);
+      }
+      return;
+    }
+    const index = [];
+    iterate(me._data);
+    function iterate(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (let i = 0; i < data.length; i++) {
+          index[depth] = i;
+          iterate(data[i], depth + 1);
+        }
+      } else {
+        for (let i = 0; i < data.length; i++) {
+          index[depth] = i;
+          fastCallbackFn(data[i], index.slice(), me);
+        }
+      }
+    }
+    function iterateUnary(data) {
+      let depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (let i = 0; i < data.length; i++) {
+          iterateUnary(data[i], depth + 1);
+        }
+      } else {
+        for (let i = 0; i < data.length; i++) {
+          fastCallbackFn(data[i]);
+        }
+      }
+    }
+  };
+
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  DenseMatrix.prototype[Symbol.iterator] = function* () {
+    const maxDepth = this._size.length - 1;
+    if (maxDepth < 0) {
+      return;
+    }
+    if (maxDepth === 0) {
+      for (let i = 0; i < this._data.length; i++) {
+        yield {
+          value: this._data[i],
+          index: [i]
+        };
+      }
+      return;
+    }
+
+    // Multi-dimensional matrix: iterate over all elements
+    const index = Array(maxDepth + 1).fill(0);
+    const totalElements = this._size.reduce((a, b) => a * b, 1);
+    for (let count = 0; count < totalElements; count++) {
+      // Traverse to the current element using indices
+      let current = this._data;
+      for (let d = 0; d < maxDepth; d++) {
+        current = current[index[d]];
+      }
+      yield {
+        value: current[index[maxDepth]],
+        index: index.slice()
+      };
+
+      // Increment indices for next element
+      for (let d = maxDepth; d >= 0; d--) {
+        index[d]++;
+        if (index[d] < this._size[d]) break;
+        index[d] = 0;
+      }
+    }
+  };
+
+  /**
+   * Returns an array containing the rows of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+  DenseMatrix.prototype.rows = function () {
+    const result = [];
+    const s = this.size();
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+    const data = this._data;
+    for (const row of data) {
+      result.push(new DenseMatrix([row], this._datatype));
+    }
+    return result;
+  };
+
+  /**
+   * Returns an array containing the columns of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+  DenseMatrix.prototype.columns = function () {
+    const result = [];
+    const s = this.size();
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+    const data = this._data;
+    for (let i = 0; i < s[1]; i++) {
+      const col = data.map(row => [row[i]]);
+      result.push(new DenseMatrix(col, this._datatype));
+    }
+    return result;
+  };
+
+  /**
+   * Create an Array with a copy of the data of the DenseMatrix
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+  DenseMatrix.prototype.toArray = function () {
+    return (0, _object.clone)(this._data);
+  };
+
+  /**
+   * Get the primitive value of the DenseMatrix: a multidimensional array
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+  DenseMatrix.prototype.valueOf = function () {
+    return this._data;
+  };
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof DenseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  DenseMatrix.prototype.format = function (options) {
+    return (0, _string.format)(this._data, options);
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {string} str
+   */
+  DenseMatrix.prototype.toString = function () {
+    return (0, _string.format)(this._data);
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {Object}
+   */
+  DenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'DenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof DenseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix with the diagonal values.
+   */
+  DenseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    const kSuper = k > 0 ? k : 0;
+    const kSub = k < 0 ? -k : 0;
+
+    // rows & columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+
+    // number diagonal values
+    const n = Math.min(rows - kSub, columns - kSuper);
+
+    // x is a matrix get diagonal from matrix
+    const data = [];
+
+    // loop rows
+    for (let i = 0; i < n; i++) {
+      data[i] = this._data[i + kSub][i + kSuper];
+    }
+
+    // create DenseMatrix
+    return new DenseMatrix({
+      data,
+      size: [n],
+      datatype: this._datatype
+    });
+  };
+
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {Array} size                     The matrix size.
+   * @param {number | Matrix | Array } value The values for the diagonal.
+   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]          The default value for non-diagonal
+   * @param {string} [datatype]              The datatype for the diagonal
+   *
+   * @returns {DenseMatrix}
+   */
+  DenseMatrix.diagonal = function (size, value, k, defaultValue) {
+    if (!(0, _is.isArray)(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // map size & validate
+    size = size.map(function (s) {
+      // check it is a big number
+      if ((0, _is.isBigNumber)(s)) {
+        // convert it
+        s = s.toNumber();
+      }
+      // validate arguments
+      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+      return s;
+    });
+
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    const kSuper = k > 0 ? k : 0;
+    const kSub = k < 0 ? -k : 0;
+
+    // rows and columns
+    const rows = size[0];
+    const columns = size[1];
+
+    // number of non-zero items
+    const n = Math.min(rows - kSub, columns - kSuper);
+
+    // value extraction function
+    let _value;
+
+    // check value
+    if ((0, _is.isArray)(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      }
+      // define function
+      _value = function (i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if ((0, _is.isMatrix)(value)) {
+      // matrix size
+      const ms = value.size();
+      // validate matrix
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      }
+      // define function
+      _value = function (i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function () {
+        // return value
+        return value;
+      };
+    }
+
+    // discover default value if needed
+    if (!defaultValue) {
+      // check first value in array
+      defaultValue = (0, _is.isBigNumber)(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero
+      : 0;
+    }
+
+    // empty array
+    let data = [];
+
+    // check we need to resize array
+    if (size.length > 0) {
+      // resize array
+      data = (0, _array.resize)(data, size, defaultValue);
+      // fill diagonal
+      for (let d = 0; d < n; d++) {
+        data[d + kSub][d + kSuper] = _value(d);
+      }
+    }
+
+    // create DenseMatrix
+    return new DenseMatrix({
+      data,
+      size: [rows, columns]
+    });
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof DenseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "DenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {DenseMatrix}
+   */
+  DenseMatrix.fromJSON = function (json) {
+    return new DenseMatrix(json);
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  DenseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {
+      throw new Error('Row index must be positive integers');
+    }
+    // check dimensions
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    // validate index
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[0]);
+
+    // swap rows
+    DenseMatrix._swapRows(i, j, this._data);
+    // return current instance
+    return this;
+  };
+
+  /**
+   * Swap rows i and j in Dense Matrix data structure.
+   *
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   * @param {Array} data     Matrix data
+   */
+  DenseMatrix._swapRows = function (i, j, data) {
+    // swap values i <-> j
+    const vi = data[i];
+    data[i] = data[j];
+    data[j] = vi;
+  };
+
+  /**
+   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
+   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays
+   * @memberof DenseMatrix
+   * @param {Array | Matrix} data
+   * @return {Array} data
+   */
+  function preprocess(data) {
+    if ((0, _is.isMatrix)(data)) {
+      return preprocess(data.valueOf());
+    }
+    if ((0, _is.isArray)(data)) {
+      return data.map(preprocess);
+    }
+    return data;
+  }
+  return DenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js b/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js
new file mode 100644
index 0000000..cd83f22
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/FibonacciHeap.js
@@ -0,0 +1,357 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createFibonacciHeapClass = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'FibonacciHeap';
+const dependencies = ['smaller', 'larger'];
+const createFibonacciHeapClass = exports.createFibonacciHeapClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    smaller,
+    larger
+  } = _ref;
+  const oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);
+
+  /**
+   * Fibonacci Heap implementation, used interally for Matrix math.
+   * @class FibonacciHeap
+   * @constructor FibonacciHeap
+   */
+  function FibonacciHeap() {
+    if (!(this instanceof FibonacciHeap)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    // initialize fields
+    this._minimum = null;
+    this._size = 0;
+  }
+
+  /**
+   * Attach type information
+   */
+  FibonacciHeap.prototype.type = 'FibonacciHeap';
+  FibonacciHeap.prototype.isFibonacciHeap = true;
+
+  /**
+   * Inserts a new data element into the heap. No heap consolidation is
+   * performed at this time, the new node is simply inserted into the root
+   * list of this heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.insert = function (key, value) {
+    // create node
+    const node = {
+      key,
+      value,
+      degree: 0
+    };
+    // check we have a node in the minimum
+    if (this._minimum) {
+      // minimum node
+      const minimum = this._minimum;
+      // update left & right of node
+      node.left = minimum;
+      node.right = minimum.right;
+      minimum.right = node;
+      node.right.left = node;
+      // update minimum node in heap if needed
+      if (smaller(key, minimum.key)) {
+        // node has a smaller key, use it as minimum
+        this._minimum = node;
+      }
+    } else {
+      // set left & right
+      node.left = node;
+      node.right = node;
+      // this is the first node
+      this._minimum = node;
+    }
+    // increment number of nodes in heap
+    this._size++;
+    // return node
+    return node;
+  };
+
+  /**
+   * Returns the number of nodes in heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.size = function () {
+    return this._size;
+  };
+
+  /**
+   * Removes all elements from this heap.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.clear = function () {
+    this._minimum = null;
+    this._size = 0;
+  };
+
+  /**
+   * Returns true if the heap is empty, otherwise false.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.isEmpty = function () {
+    return this._size === 0;
+  };
+
+  /**
+   * Extracts the node with minimum key from heap. Amortized running
+   * time: O(log n).
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.extractMinimum = function () {
+    // node to remove
+    const node = this._minimum;
+    // check we have a minimum
+    if (node === null) {
+      return node;
+    }
+    // current minimum
+    let minimum = this._minimum;
+    // get number of children
+    let numberOfChildren = node.degree;
+    // pointer to the first child
+    let x = node.child;
+    // for each child of node do...
+    while (numberOfChildren > 0) {
+      // store node in right side
+      const tempRight = x.right;
+      // remove x from child list
+      x.left.right = x.right;
+      x.right.left = x.left;
+      // add x to root list of heap
+      x.left = minimum;
+      x.right = minimum.right;
+      minimum.right = x;
+      x.right.left = x;
+      // set Parent[x] to null
+      x.parent = null;
+      x = tempRight;
+      numberOfChildren--;
+    }
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left;
+    // update minimum
+    if (node === node.right) {
+      // empty
+      minimum = null;
+    } else {
+      // update minimum
+      minimum = node.right;
+      // we need to update the pointer to the root with minimum key
+      minimum = _findMinimumNode(minimum, this._size);
+    }
+    // decrement size of heap
+    this._size--;
+    // update minimum
+    this._minimum = minimum;
+    // return node
+    return node;
+  };
+
+  /**
+   * Removes a node from the heap given the reference to the node. The trees
+   * in the heap will be consolidated, if necessary. This operation may fail
+   * to remove the correct element if there are nodes with key value -Infinity.
+   * Running time: O(log n) amortized.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.remove = function (node) {
+    // decrease key value
+    this._minimum = _decreaseKey(this._minimum, node, -1);
+    // remove the smallest
+    this.extractMinimum();
+  };
+
+  /**
+   * Decreases the key value for a heap node, given the new value to take on.
+   * The structure of the heap may be changed and will not be consolidated.
+   * Running time: O(1) amortized.
+   * @memberof FibonacciHeap
+   */
+  function _decreaseKey(minimum, node, key) {
+    // set node key
+    node.key = key;
+    // get parent node
+    const parent = node.parent;
+    if (parent && smaller(node.key, parent.key)) {
+      // remove node from parent
+      _cut(minimum, node, parent);
+      // remove all nodes from parent to the root parent
+      _cascadingCut(minimum, parent);
+    }
+    // update minimum node if needed
+    if (smaller(node.key, minimum.key)) {
+      minimum = node;
+    }
+    // return minimum
+    return minimum;
+  }
+
+  /**
+   * The reverse of the link operation: removes node from the child list of parent.
+   * This method assumes that min is non-null. Running time: O(1).
+   * @memberof FibonacciHeap
+   */
+  function _cut(minimum, node, parent) {
+    // remove node from parent children and decrement Degree[parent]
+    node.left.right = node.right;
+    node.right.left = node.left;
+    parent.degree--;
+    // reset y.child if necessary
+    if (parent.child === node) {
+      parent.child = node.right;
+    }
+    // remove child if degree is 0
+    if (parent.degree === 0) {
+      parent.child = null;
+    }
+    // add node to root list of heap
+    node.left = minimum;
+    node.right = minimum.right;
+    minimum.right = node;
+    node.right.left = node;
+    // set parent[node] to null
+    node.parent = null;
+    // set mark[node] to false
+    node.mark = false;
+  }
+
+  /**
+   * Performs a cascading cut operation. This cuts node from its parent and then
+   * does the same for its parent, and so on up the tree.
+   * Running time: O(log n); O(1) excluding the recursion.
+   * @memberof FibonacciHeap
+   */
+  function _cascadingCut(minimum, node) {
+    // store parent node
+    const parent = node.parent;
+    // if there's a parent...
+    if (!parent) {
+      return;
+    }
+    // if node is unmarked, set it marked
+    if (!node.mark) {
+      node.mark = true;
+    } else {
+      // it's marked, cut it from parent
+      _cut(minimum, node, parent);
+      // cut its parent as well
+      _cascadingCut(parent);
+    }
+  }
+
+  /**
+   * Make the first node a child of the second one. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  const _linkNodes = function (node, parent) {
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left;
+    // make node a Child of parent
+    node.parent = parent;
+    if (!parent.child) {
+      parent.child = node;
+      node.right = node;
+      node.left = node;
+    } else {
+      node.left = parent.child;
+      node.right = parent.child.right;
+      parent.child.right = node;
+      node.right.left = node;
+    }
+    // increase degree[parent]
+    parent.degree++;
+    // set mark[node] false
+    node.mark = false;
+  };
+  function _findMinimumNode(minimum, size) {
+    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree
+    const arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1;
+    // create list with initial capacity
+    const array = new Array(arraySize);
+    // find the number of root nodes.
+    let numRoots = 0;
+    let x = minimum;
+    if (x) {
+      numRoots++;
+      x = x.right;
+      while (x !== minimum) {
+        numRoots++;
+        x = x.right;
+      }
+    }
+    // vars
+    let y;
+    // For each node in root list do...
+    while (numRoots > 0) {
+      // access this node's degree..
+      let d = x.degree;
+      // get next node
+      const next = x.right;
+      // check if there is a node already in array with the same degree
+      while (true) {
+        // get node with the same degree is any
+        y = array[d];
+        if (!y) {
+          break;
+        }
+        // make one node with the same degree a child of the other, do this based on the key value.
+        if (larger(x.key, y.key)) {
+          const temp = y;
+          y = x;
+          x = temp;
+        }
+        // make y a child of x
+        _linkNodes(y, x);
+        // we have handled this degree, go to next one.
+        array[d] = null;
+        d++;
+      }
+      // save this node for later when we might encounter another of the same degree.
+      array[d] = x;
+      // move forward through list.
+      x = next;
+      numRoots--;
+    }
+    // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].
+    minimum = null;
+    // loop nodes in array
+    for (let i = 0; i < arraySize; i++) {
+      // get current node
+      y = array[i];
+      if (!y) {
+        continue;
+      }
+      // check if we have a linked list
+      if (minimum) {
+        // First remove node from root list.
+        y.left.right = y.right;
+        y.right.left = y.left;
+        // now add to root list, again.
+        y.left = minimum;
+        y.right = minimum.right;
+        minimum.right = y;
+        y.right.left = y;
+        // check if this is a new min.
+        if (smaller(y.key, minimum.key)) {
+          minimum = y;
+        }
+      } else {
+        minimum = y;
+      }
+    }
+    return minimum;
+  }
+  return FibonacciHeap;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js
new file mode 100644
index 0000000..9a43e05
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/ImmutableDenseMatrix.js
@@ -0,0 +1,227 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createImmutableDenseMatrixClass = void 0;
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _factory = require("../../utils/factory.js");
+const name = 'ImmutableDenseMatrix';
+const dependencies = ['smaller', 'DenseMatrix'];
+const createImmutableDenseMatrixClass = exports.createImmutableDenseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    smaller,
+    DenseMatrix
+  } = _ref;
+  function ImmutableDenseMatrix(data, datatype) {
+    if (!(this instanceof ImmutableDenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if ((0, _is.isMatrix)(data) || (0, _is.isArray)(data)) {
+      // use DenseMatrix implementation
+      const matrix = new DenseMatrix(data, datatype);
+      // internal structures
+      this._data = matrix._data;
+      this._size = matrix._size;
+      this._datatype = matrix._datatype;
+      this._min = null;
+      this._max = null;
+    } else if (data && (0, _is.isArray)(data.data) && (0, _is.isArray)(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      this._datatype = data.datatype;
+      this._min = typeof data.min !== 'undefined' ? data.min : null;
+      this._max = typeof data.max !== 'undefined' ? data.max : null;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+      this._min = null;
+      this._max = null;
+    }
+  }
+  ImmutableDenseMatrix.prototype = new DenseMatrix();
+
+  /**
+   * Attach type information
+   */
+  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';
+  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | ImmutableDenseMatrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  ImmutableDenseMatrix.prototype.subset = function (index) {
+    switch (arguments.length) {
+      case 1:
+        {
+          // use base implementation
+          const m = DenseMatrix.prototype.subset.call(this, index);
+          // check result is a matrix
+          if ((0, _is.isMatrix)(m)) {
+            // return immutable matrix
+            return new ImmutableDenseMatrix({
+              data: m._data,
+              size: m._size,
+              datatype: m._datatype
+            });
+          }
+          return m;
+        }
+      // intentional fall through
+      case 2:
+      case 3:
+        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @param {Number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {ImmutableDenseMatrix} self
+   */
+  ImmutableDenseMatrix.prototype.set = function () {
+    throw new Error('Cannot invoke set on an Immutable Matrix instance');
+  };
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {Number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  ImmutableDenseMatrix.prototype.resize = function () {
+    throw new Error('Cannot invoke resize on an Immutable Matrix instance');
+  };
+
+  /**
+   * Disallows reshaping in favor of immutability.
+   *
+   * @throws {Error} Operation not allowed
+   */
+  ImmutableDenseMatrix.prototype.reshape = function () {
+    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @return {ImmutableDenseMatrix} clone
+   */
+  ImmutableDenseMatrix.prototype.clone = function () {
+    return new ImmutableDenseMatrix({
+      data: (0, _object.clone)(this._data),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @returns {Object}
+   */
+  ImmutableDenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'ImmutableDenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ImmutableDenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {ImmutableDenseMatrix}
+   */
+  ImmutableDenseMatrix.fromJSON = function (json) {
+    return new ImmutableDenseMatrix(json);
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @param {Number} i       Matrix row index 1
+   * @param {Number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  ImmutableDenseMatrix.prototype.swapRows = function () {
+    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');
+  };
+
+  /**
+   * Calculate the minimum value in the set
+   * @return {Number | undefined} min
+   */
+  ImmutableDenseMatrix.prototype.min = function () {
+    // check min has been calculated before
+    if (this._min === null) {
+      // minimum
+      let m = null;
+      // compute min
+      this.forEach(function (v) {
+        if (m === null || smaller(v, m)) {
+          m = v;
+        }
+      });
+      this._min = m !== null ? m : undefined;
+    }
+    return this._min;
+  };
+
+  /**
+   * Calculate the maximum value in the set
+   * @return {Number | undefined} max
+   */
+  ImmutableDenseMatrix.prototype.max = function () {
+    // check max has been calculated before
+    if (this._max === null) {
+      // maximum
+      let m = null;
+      // compute max
+      this.forEach(function (v) {
+        if (m === null || smaller(m, v)) {
+          m = v;
+        }
+      });
+      this._max = m !== null ? m : undefined;
+    }
+    return this._max;
+  };
+  return ImmutableDenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js b/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js
new file mode 100644
index 0000000..2c0344d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Matrix.js
@@ -0,0 +1,248 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixClass = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'Matrix';
+const dependencies = [];
+const createMatrixClass = exports.createMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * @constructor Matrix
+   *
+   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional
+   * array. A matrix can be constructed as:
+   *
+   *     let matrix = math.matrix(data)
+   *
+   * Matrix contains the functions to resize, get and set values, get the size,
+   * clone the matrix and to convert the matrix to a vector, array, or scalar.
+   * Furthermore, one can iterate over the matrix using map and forEach.
+   * The internal Array of the Matrix can be accessed using the function valueOf.
+   *
+   * Example usage:
+   *
+   *     let matrix = math.matrix([[1, 2], [3, 4]])
+   *     matix.size()              // [2, 2]
+   *     matrix.resize([3, 2], 5)
+   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]
+   *     matrix.subset([1,2])       // 3 (indexes are zero-based)
+   *
+   */
+  function Matrix() {
+    if (!(this instanceof Matrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Matrix.prototype.type = 'Matrix';
+  Matrix.prototype.isMatrix = true;
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @return {string}           The storage format.
+   */
+  Matrix.prototype.storage = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke storage on a Matrix interface');
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @return {string}           The datatype.
+   */
+  Matrix.prototype.datatype = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke datatype on a Matrix interface');
+  };
+
+  /**
+   * Create a new Matrix With the type of the current matrix instance
+   * @param {Array | Object} data
+   * @param {string} [datatype]
+   */
+  Matrix.prototype.create = function (data, datatype) {
+    throw new Error('Cannot invoke create on a Matrix interface');
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  Matrix.prototype.subset = function (index, replacement, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke subset on a Matrix interface');
+  };
+
+  /**
+   * Get a single element from the matrix.
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  Matrix.prototype.get = function (index) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke get on a Matrix interface');
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {Matrix} self
+   */
+  Matrix.prototype.set = function (index, value, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke set on a Matrix interface');
+  };
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  Matrix.prototype.resize = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke resize on a Matrix interface');
+  };
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  Matrix.prototype.reshape = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke reshape on a Matrix interface');
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @return {Matrix} clone
+   */
+  Matrix.prototype.clone = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke clone on a Matrix interface');
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @returns {number[]} size
+   */
+  Matrix.prototype.size = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke size on a Matrix interface');
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {Matrix} matrix
+   */
+  Matrix.prototype.map = function (callback, skipZeros) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke map on a Matrix interface');
+  };
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+  Matrix.prototype.forEach = function (callback) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke forEach on a Matrix interface');
+  };
+
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  Matrix.prototype[Symbol.iterator] = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot iterate a Matrix interface');
+  };
+
+  /**
+   * Create an Array with a copy of the data of the Matrix
+   * @returns {Array} array
+   */
+  Matrix.prototype.toArray = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toArray on a Matrix interface');
+  };
+
+  /**
+   * Get the primitive value of the Matrix: a multidimensional array
+   * @returns {Array} array
+   */
+  Matrix.prototype.valueOf = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke valueOf on a Matrix interface');
+  };
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  Matrix.prototype.format = function (options) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke format on a Matrix interface');
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @returns {string} str
+   */
+  Matrix.prototype.toString = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toString on a Matrix interface');
+  };
+  return Matrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js b/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js
new file mode 100644
index 0000000..b715268
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/MatrixIndex.js
@@ -0,0 +1,310 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndexClass = void 0;
+var _is = require("../../utils/is.js");
+var _object = require("../../utils/object.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'Index';
+const dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType'];
+const createIndexClass = exports.createIndexClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    ImmutableDenseMatrix,
+    getMatrixDataType
+  } = _ref;
+  /**
+   * Create an index. An Index can store ranges and sets for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Usage:
+   *     const index = new Index(range1, range2, matrix1, array1, ...)
+   *
+   * Where each parameter can be any of:
+   *     A number
+   *     A string (containing a name of an object property)
+   *     An instance of Range
+   *     An Array with the Set values
+   *     An Array with Booleans
+   *     A Matrix with the Set values
+   *     A Matrix with Booleans
+   *
+   * The parameters start, end, and step must be integer numbers.
+   *
+   * @class Index
+   * @Constructor Index
+   * @param {...*} ranges
+   */
+  function Index(ranges) {
+    if (!(this instanceof Index)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    this._dimensions = [];
+    this._sourceSize = [];
+    this._isScalar = true;
+    for (let i = 0, ii = arguments.length; i < ii; i++) {
+      const arg = arguments[i];
+      const argIsArray = (0, _is.isArray)(arg);
+      const argIsMatrix = (0, _is.isMatrix)(arg);
+      const argType = typeof arg;
+      let sourceSize = null;
+      if ((0, _is.isRange)(arg)) {
+        this._dimensions.push(arg);
+        this._isScalar = false;
+      } else if (argIsArray || argIsMatrix) {
+        // create matrix
+        let m;
+        if (getMatrixDataType(arg) === 'boolean') {
+          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf());
+          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf());
+          sourceSize = arg.valueOf().length;
+        } else {
+          m = _createImmutableMatrix(arg.valueOf());
+        }
+        this._dimensions.push(m);
+        // size
+        const size = m.size();
+        // scalar
+        if (size.length !== 1 || size[0] !== 1 || sourceSize !== null) {
+          this._isScalar = false;
+        }
+      } else if (argType === 'number') {
+        this._dimensions.push(_createImmutableMatrix([arg]));
+      } else if (argType === 'bigint') {
+        this._dimensions.push(_createImmutableMatrix([Number(arg)]));
+      } else if (argType === 'string') {
+        // object property (arguments.count should be 1)
+        this._dimensions.push(arg);
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range');
+      }
+      this._sourceSize.push(sourceSize);
+      // TODO: implement support for wildcard '*'
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Index.prototype.type = 'Index';
+  Index.prototype.isIndex = true;
+  function _createImmutableMatrix(arg) {
+    // loop array elements
+    for (let i = 0, l = arg.length; i < l; i++) {
+      if (typeof arg[i] !== 'number' || !(0, _number.isInteger)(arg[i])) {
+        throw new TypeError('Index parameters must be positive integer numbers');
+      }
+    }
+    // create matrix
+    return new ImmutableDenseMatrix(arg);
+  }
+
+  /**
+   * Create a clone of the index
+   * @memberof Index
+   * @return {Index} clone
+   */
+  Index.prototype.clone = function () {
+    const index = new Index();
+    index._dimensions = (0, _object.clone)(this._dimensions);
+    index._isScalar = this._isScalar;
+    index._sourceSize = this._sourceSize;
+    return index;
+  };
+
+  /**
+   * Create an index from an array with ranges/numbers
+   * @memberof Index
+   * @param {Array.<Array | number>} ranges
+   * @return {Index} index
+   * @private
+   */
+  Index.create = function (ranges) {
+    const index = new Index();
+    Index.apply(index, ranges);
+    return index;
+  };
+
+  /**
+   * Retrieve the size of the index, the number of elements for each dimension.
+   * @memberof Index
+   * @returns {number[]} size
+   */
+  Index.prototype.size = function () {
+    const size = [];
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      const d = this._dimensions[i];
+      size[i] = typeof d === 'string' ? 1 : d.size()[0];
+    }
+    return size;
+  };
+
+  /**
+   * Get the maximum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} max
+   */
+  Index.prototype.max = function () {
+    const values = [];
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      const range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.max();
+    }
+    return values;
+  };
+
+  /**
+   * Get the minimum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} min
+   */
+  Index.prototype.min = function () {
+    const values = [];
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      const range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.min();
+    }
+    return values;
+  };
+
+  /**
+   * Loop over each of the ranges of the index
+   * @memberof Index
+   * @param {Function} callback   Called for each range with a Range as first
+   *                              argument, the dimension as second, and the
+   *                              index object as third.
+   */
+  Index.prototype.forEach = function (callback) {
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      callback(this._dimensions[i], i, this);
+    }
+  };
+
+  /**
+   * Retrieve the dimension for the given index
+   * @memberof Index
+   * @param {Number} dim                  Number of the dimension
+   * @returns {Range | null} range
+   */
+  Index.prototype.dimension = function (dim) {
+    if (typeof dim !== 'number') {
+      return null;
+    }
+    return this._dimensions[dim] || null;
+  };
+
+  /**
+   * Test whether this index contains an object property
+   * @returns {boolean} Returns true if the index is an object property
+   */
+  Index.prototype.isObjectProperty = function () {
+    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';
+  };
+
+  /**
+   * Returns the object property name when the Index holds a single object property,
+   * else returns null
+   * @returns {string | null}
+   */
+  Index.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this._dimensions[0] : null;
+  };
+
+  /**
+   * Test whether this index contains only a single value.
+   *
+   * This is the case when the index is created with only scalar values as ranges,
+   * not for ranges resolving into a single value.
+   * @memberof Index
+   * @return {boolean} isScalar
+   */
+  Index.prototype.isScalar = function () {
+    return this._isScalar;
+  };
+
+  /**
+   * Expand the Index into an array.
+   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
+   * @memberof Index
+   * @returns {Array} array
+   */
+  Index.prototype.toArray = function () {
+    const array = [];
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      const dimension = this._dimensions[i];
+      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());
+    }
+    return array;
+  };
+
+  /**
+   * Get the primitive value of the Index, a two dimensional array.
+   * Equivalent to Index.toArray().
+   * @memberof Index
+   * @returns {Array} array
+   */
+  Index.prototype.valueOf = Index.prototype.toArray;
+
+  /**
+   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
+   * @memberof Index
+   * @returns {String} str
+   */
+  Index.prototype.toString = function () {
+    const strings = [];
+    for (let i = 0, ii = this._dimensions.length; i < ii; i++) {
+      const dimension = this._dimensions[i];
+      if (typeof dimension === 'string') {
+        strings.push(JSON.stringify(dimension));
+      } else {
+        strings.push(dimension.toString());
+      }
+    }
+    return '[' + strings.join(', ') + ']';
+  };
+
+  /**
+   * Get a JSON representation of the Index
+   * @memberof Index
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   */
+  Index.prototype.toJSON = function () {
+    return {
+      mathjs: 'Index',
+      dimensions: this._dimensions
+    };
+  };
+
+  /**
+   * Instantiate an Index from a JSON object
+   * @memberof Index
+   * @param {Object} json A JSON object structured as:
+   *                     `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   * @return {Index}
+   */
+  Index.fromJSON = function (json) {
+    return Index.create(json.dimensions);
+  };
+  return Index;
+}, {
+  isClass: true
+});
+
+/**
+ * Receives an array of booleans and returns an array of Numbers for Index
+ * @param {Array} booleanArrayIndex An array of booleans
+ * @return {Array} A set of numbers ready for index
+ */
+function _booleansArrayToNumbersForIndex(booleanArrayIndex) {
+  // gets an array of booleans and returns an array of numbers
+  const indexOfNumbers = [];
+  booleanArrayIndex.forEach((bool, idx) => {
+    if (bool) {
+      indexOfNumbers.push(idx);
+    }
+  });
+  return indexOfNumbers;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Range.js b/node_modules/mathjs/lib/cjs/type/matrix/Range.js
new file mode 100644
index 0000000..35659bc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Range.js
@@ -0,0 +1,320 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createRangeClass = void 0;
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+var _factory = require("../../utils/factory.js");
+const name = 'Range';
+const dependencies = [];
+const createRangeClass = exports.createRangeClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * Create a range of numbers. A range has a start, step, and end,
+   * and contains functions to iterate over the range.
+   *
+   * A range can be constructed as:
+   *
+   *     const range = new Range(start, end)
+   *     const range = new Range(start, end, step)
+   *
+   * Note that the endpoints and step may be specified with other numeric
+   * types such as bigint or BigNumber, but they will be demoted to the
+   * built-in `number` type and the Range will only contain numbers. The
+   * rationale for this demotion is that Range objects are primarily used
+   * for indexing Matrix objects, and Matrix objects may only be indexed
+   * with `number`s.
+   *
+   * To get the result of the range:
+   *     range.forEach(function (x) {
+   *         console.log(x)
+   *     })
+   *     range.map(function (x) {
+   *         return math.sin(x)
+   *     })
+   *     range.toArray()
+   *
+   * Example usage:
+   *
+   *     const c = new Range(2, 6)       // 2:1:5
+   *     c.toArray()                     // [2, 3, 4, 5]
+   *     const d = new Range(2, -3, -1)  // 2:-1:-2
+   *     d.toArray()                     // [2, 1, 0, -1, -2]
+   *
+   * @class Range
+   * @constructor Range
+   * @param {number} start  included lower bound
+   * @param {number} end    excluded upper bound
+   * @param {number} [step] step size, default value is 1
+   */
+  function Range(start, end, step) {
+    if (!(this instanceof Range)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    const hasStart = start !== null && start !== undefined;
+    const hasEnd = end !== null && end !== undefined;
+    const hasStep = step !== null && step !== undefined;
+    if (hasStart) {
+      if ((0, _is.isBigNumber)(start)) {
+        start = start.toNumber();
+      } else if (typeof start !== 'number' && !(0, _is.isBigInt)(start)) {
+        throw new TypeError('Parameter start must be a number or bigint');
+      }
+    }
+    if (hasEnd) {
+      if ((0, _is.isBigNumber)(end)) {
+        end = end.toNumber();
+      } else if (typeof end !== 'number' && !(0, _is.isBigInt)(end)) {
+        throw new TypeError('Parameter end must be a number or bigint');
+      }
+    }
+    if (hasStep) {
+      if ((0, _is.isBigNumber)(step)) {
+        step = step.toNumber();
+      } else if (typeof step !== 'number' && !(0, _is.isBigInt)(step)) {
+        throw new TypeError('Parameter step must be a number or bigint');
+      }
+    }
+    this.start = hasStart ? parseFloat(start) : 0;
+    this.end = hasEnd ? parseFloat(end) : 0;
+    this.step = hasStep ? parseFloat(step) : 1;
+    if (hasStep && (0, _number.nearlyEqual)(this.step, 0)) {
+      throw new Error('Step must not be zero');
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Range.prototype.type = 'Range';
+  Range.prototype.isRange = true;
+
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @memberof Range
+   * @param {string} str
+   * @return {Range | null} range
+   */
+  Range.parse = function (str) {
+    if (typeof str !== 'string') {
+      return null;
+    }
+    const args = str.split(':');
+    const nums = args.map(function (arg) {
+      return parseFloat(arg);
+    });
+    const invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+    if (invalid) {
+      return null;
+    }
+    switch (nums.length) {
+      case 2:
+        return new Range(nums[0], nums[1]);
+      case 3:
+        return new Range(nums[0], nums[2], nums[1]);
+      default:
+        return null;
+    }
+  };
+
+  /**
+   * Create a clone of the range
+   * @return {Range} clone
+   */
+  Range.prototype.clone = function () {
+    return new Range(this.start, this.end, this.step);
+  };
+
+  /**
+   * Retrieve the size of the range.
+   * Returns an array containing one number, the number of elements in the range.
+   * @memberof Range
+   * @returns {number[]} size
+   */
+  Range.prototype.size = function () {
+    let len = 0;
+    const start = this.start;
+    const step = this.step;
+    const end = this.end;
+    const diff = end - start;
+    if ((0, _number.sign)(step) === (0, _number.sign)(diff)) {
+      len = Math.ceil(diff / step);
+    } else if (diff === 0) {
+      len = 0;
+    }
+    if (isNaN(len)) {
+      len = 0;
+    }
+    return [len];
+  };
+
+  /**
+   * Calculate the minimum value in the range
+   * @memberof Range
+   * @return {number | undefined} min
+   */
+  Range.prototype.min = function () {
+    const size = this.size()[0];
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start;
+      } else {
+        // negative step
+        return this.start + (size - 1) * this.step;
+      }
+    } else {
+      return undefined;
+    }
+  };
+
+  /**
+   * Calculate the maximum value in the range
+   * @memberof Range
+   * @return {number | undefined} max
+   */
+  Range.prototype.max = function () {
+    const size = this.size()[0];
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start + (size - 1) * this.step;
+      } else {
+        // negative step
+        return this.start;
+      }
+    } else {
+      return undefined;
+    }
+  };
+
+  /**
+   * Execute a callback function for each value in the range.
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Range being traversed.
+   */
+  Range.prototype.forEach = function (callback) {
+    let x = this.start;
+    const step = this.step;
+    const end = this.end;
+    let i = 0;
+    if (step > 0) {
+      while (x < end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    } else if (step < 0) {
+      while (x > end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    }
+  };
+
+  /**
+   * Execute a callback function for each value in the Range, and return the
+   * results as an array
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @returns {Array} array
+   */
+  Range.prototype.map = function (callback) {
+    const array = [];
+    this.forEach(function (value, index, obj) {
+      array[index[0]] = callback(value, index, obj);
+    });
+    return array;
+  };
+
+  /**
+   * Create an Array with a copy of the Ranges data
+   * @memberof Range
+   * @returns {Array} array
+   */
+  Range.prototype.toArray = function () {
+    const array = [];
+    this.forEach(function (value, index) {
+      array[index[0]] = value;
+    });
+    return array;
+  };
+
+  /**
+   * Get the primitive value of the Range, a one dimensional array
+   * @memberof Range
+   * @returns {Array} array
+   */
+  Range.prototype.valueOf = function () {
+    // TODO: implement a caching mechanism for range.valueOf()
+    return this.toArray();
+  };
+
+  /**
+   * Get a string representation of the range, with optional formatting options.
+   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
+   * @memberof Range
+   * @param {Object | number | function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  Range.prototype.format = function (options) {
+    let str = (0, _number.format)(this.start, options);
+    if (this.step !== 1) {
+      str += ':' + (0, _number.format)(this.step, options);
+    }
+    str += ':' + (0, _number.format)(this.end, options);
+    return str;
+  };
+
+  /**
+   * Get a string representation of the range.
+   * @memberof Range
+   * @returns {string}
+   */
+  Range.prototype.toString = function () {
+    return this.format();
+  };
+
+  /**
+   * Get a JSON representation of the range
+   * @memberof Range
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   */
+  Range.prototype.toJSON = function () {
+    return {
+      mathjs: 'Range',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+
+  /**
+   * Instantiate a Range from a JSON object
+   * @memberof Range
+   * @param {Object} json A JSON object structured as:
+   *                      `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   * @return {Range}
+   */
+  Range.fromJSON = function (json) {
+    return new Range(json.start, json.end, json.step);
+  };
+  return Range;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/Spa.js b/node_modules/mathjs/lib/cjs/type/matrix/Spa.js
new file mode 100644
index 0000000..b38bea2
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/Spa.js
@@ -0,0 +1,142 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSpaClass = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'Spa';
+const dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];
+const createSpaClass = exports.createSpaClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    addScalar,
+    equalScalar,
+    FibonacciHeap
+  } = _ref;
+  /**
+   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array
+   * of the vector elements and an ordered list of non-zero elements.
+   */
+  function Spa() {
+    if (!(this instanceof Spa)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    // allocate vector, TODO use typed arrays
+    this._values = [];
+    this._heap = new FibonacciHeap();
+  }
+
+  /**
+   * Attach type information
+   */
+  Spa.prototype.type = 'Spa';
+  Spa.prototype.isSpa = true;
+
+  /**
+   * Set the value for index i.
+   *
+   * @param {number} i                       The index
+   * @param {number | BigNumber | Complex}   The value at index i
+   */
+  Spa.prototype.set = function (i, v) {
+    // check we have a value @ i
+    if (!this._values[i]) {
+      // insert in heap
+      const node = this._heap.insert(i, v);
+      // set the value @ i
+      this._values[i] = node;
+    } else {
+      // update the value @ i
+      this._values[i].value = v;
+    }
+  };
+  Spa.prototype.get = function (i) {
+    const node = this._values[i];
+    if (node) {
+      return node.value;
+    }
+    return 0;
+  };
+  Spa.prototype.accumulate = function (i, v) {
+    // node @ i
+    let node = this._values[i];
+    if (!node) {
+      // insert in heap
+      node = this._heap.insert(i, v);
+      // initialize value
+      this._values[i] = node;
+    } else {
+      // accumulate value
+      node.value = addScalar(node.value, v);
+    }
+  };
+  Spa.prototype.forEach = function (from, to, callback) {
+    // references
+    const heap = this._heap;
+    const values = this._values;
+    // nodes
+    const nodes = [];
+    // node with minimum key, save it
+    let node = heap.extractMinimum();
+    if (node) {
+      nodes.push(node);
+    }
+    // extract nodes from heap (ordered)
+    while (node && node.key <= to) {
+      // check it is in range
+      if (node.key >= from) {
+        // check value is not zero
+        if (!equalScalar(node.value, 0)) {
+          // invoke callback
+          callback(node.key, node.value, this);
+        }
+      }
+      // extract next node, save it
+      node = heap.extractMinimum();
+      if (node) {
+        nodes.push(node);
+      }
+    }
+    // reinsert all nodes in heap
+    for (let i = 0; i < nodes.length; i++) {
+      // current node
+      const n = nodes[i];
+      // insert node in heap
+      node = heap.insert(n.key, n.value);
+      // update values
+      values[node.key] = node;
+    }
+  };
+  Spa.prototype.swap = function (i, j) {
+    // node @ i and j
+    let nodei = this._values[i];
+    let nodej = this._values[j];
+    // check we need to insert indeces
+    if (!nodei && nodej) {
+      // insert in heap
+      nodei = this._heap.insert(i, nodej.value);
+      // remove from heap
+      this._heap.remove(nodej);
+      // set values
+      this._values[i] = nodei;
+      this._values[j] = undefined;
+    } else if (nodei && !nodej) {
+      // insert in heap
+      nodej = this._heap.insert(j, nodei.value);
+      // remove from heap
+      this._heap.remove(nodei);
+      // set values
+      this._values[j] = nodej;
+      this._values[i] = undefined;
+    } else if (nodei && nodej) {
+      // swap values
+      const v = nodei.value;
+      nodei.value = nodej.value;
+      nodej.value = v;
+    }
+  };
+  return Spa;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js b/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js
new file mode 100644
index 0000000..eb7f777
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/SparseMatrix.js
@@ -0,0 +1,1493 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSparseMatrixClass = void 0;
+var _is = require("../../utils/is.js");
+var _number = require("../../utils/number.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+var _array = require("../../utils/array.js");
+var _factory = require("../../utils/factory.js");
+var _DimensionError = require("../../error/DimensionError.js");
+var _optimizeCallback = require("../../utils/optimizeCallback.js");
+const name = 'SparseMatrix';
+const dependencies = ['typed', 'equalScalar', 'Matrix'];
+const createSparseMatrixClass = exports.createSparseMatrixClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar,
+    Matrix
+  } = _ref;
+  /**
+   * Sparse Matrix implementation. This type implements
+   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))
+   * format for two-dimensional sparse matrices.
+   * @class SparseMatrix
+   */
+  function SparseMatrix(data, datatype) {
+    if (!(this instanceof SparseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !(0, _is.isString)(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if ((0, _is.isMatrix)(data)) {
+      // create from matrix
+      _createFromMatrix(this, data, datatype);
+    } else if (data && (0, _is.isArray)(data.index) && (0, _is.isArray)(data.ptr) && (0, _is.isArray)(data.size)) {
+      // initialize fields
+      this._values = data.values;
+      this._index = data.index;
+      this._ptr = data.ptr;
+      this._size = data.size;
+      this._datatype = datatype || data.datatype;
+    } else if ((0, _is.isArray)(data)) {
+      // create from array
+      _createFromArray(this, data, datatype);
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + (0, _is.typeOf)(data) + ')');
+    } else {
+      // nothing provided
+      this._values = [];
+      this._index = [];
+      this._ptr = [0];
+      this._size = [0, 0];
+      this._datatype = datatype;
+    }
+  }
+  function _createFromMatrix(matrix, source, datatype) {
+    // check matrix type
+    if (source.type === 'SparseMatrix') {
+      // clone arrays
+      matrix._values = source._values ? (0, _object.clone)(source._values) : undefined;
+      matrix._index = (0, _object.clone)(source._index);
+      matrix._ptr = (0, _object.clone)(source._ptr);
+      matrix._size = (0, _object.clone)(source._size);
+      matrix._datatype = datatype || source._datatype;
+    } else {
+      // build from matrix data
+      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);
+    }
+  }
+  function _createFromArray(matrix, data, datatype) {
+    // initialize fields
+    matrix._values = [];
+    matrix._index = [];
+    matrix._ptr = [];
+    matrix._datatype = datatype;
+    // discover rows & columns, do not use math.size() to avoid looping array twice
+    const rows = data.length;
+    let columns = 0;
+
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    if ((0, _is.isString)(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, datatype);
+    }
+
+    // check we have rows (empty array)
+    if (rows > 0) {
+      // column index
+      let j = 0;
+      do {
+        // store pointer to values index
+        matrix._ptr.push(matrix._index.length);
+        // loop rows
+        for (let i = 0; i < rows; i++) {
+          // current row
+          const row = data[i];
+          // check row is an array
+          if ((0, _is.isArray)(row)) {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < row.length) {
+              columns = row.length;
+            }
+            // check row has column
+            if (j < row.length) {
+              // value
+              const v = row[j];
+              // check value != 0
+              if (!eq(v, zero)) {
+                // store value
+                matrix._values.push(v);
+                // index
+                matrix._index.push(i);
+              }
+            }
+          } else {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < 1) {
+              columns = 1;
+            }
+            // check value != 0 (row is a scalar)
+            if (!eq(row, zero)) {
+              // store value
+              matrix._values.push(row);
+              // index
+              matrix._index.push(i);
+            }
+          }
+        }
+        // increment index
+        j++;
+      } while (j < columns);
+    }
+    // store number of values in ptr
+    matrix._ptr.push(matrix._index.length);
+    // size
+    matrix._size = [rows, columns];
+  }
+  SparseMatrix.prototype = new Matrix();
+
+  /**
+   * Create a new SparseMatrix
+   */
+  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(SparseMatrix, 'name', {
+    value: 'SparseMatrix'
+  });
+  SparseMatrix.prototype.constructor = SparseMatrix;
+  SparseMatrix.prototype.type = 'SparseMatrix';
+  SparseMatrix.prototype.isSparseMatrix = true;
+
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf SparseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+  SparseMatrix.prototype.getDataType = function () {
+    return (0, _array.getArrayDataType)(this._values, _is.typeOf);
+  };
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The storage format.
+   */
+  SparseMatrix.prototype.storage = function () {
+    return 'sparse';
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The datatype.
+   */
+  SparseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+
+  /**
+   * Create a new SparseMatrix
+   * @memberof SparseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+  SparseMatrix.prototype.create = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+
+  /**
+   * Get the matrix density.
+   *
+   * Usage:
+   *     const density = matrix.density()                   // retrieve matrix density
+   *
+   * @memberof SparseMatrix
+   * @return {number}           The matrix density.
+   */
+  SparseMatrix.prototype.density = function () {
+    // rows & columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+    // calculate density
+    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof SparseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke subset on a Pattern only matrix');
+    }
+
+    // check arguments
+    switch (arguments.length) {
+      case 1:
+        return _getsubset(this, index);
+
+      // intentional fall through
+      case 2:
+      case 3:
+        return _setsubset(this, index, replacement, defaultValue);
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  function _getsubset(matrix, idx) {
+    // check idx
+    if (!(0, _is.isIndex)(idx)) {
+      throw new TypeError('Invalid index');
+    }
+    const isScalar = idx.isScalar();
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(idx.min());
+    }
+    // validate dimensions
+    const size = idx.size();
+    if (size.length !== matrix._size.length) {
+      throw new _DimensionError.DimensionError(size.length, matrix._size.length);
+    }
+
+    // vars
+    let i, ii, k, kk;
+
+    // validate if any of the ranges in the index is out of range
+    const min = idx.min();
+    const max = idx.max();
+    for (i = 0, ii = matrix._size.length; i < ii; i++) {
+      (0, _array.validateIndex)(min[i], matrix._size[i]);
+      (0, _array.validateIndex)(max[i], matrix._size[i]);
+    }
+
+    // matrix arrays
+    const mvalues = matrix._values;
+    const mindex = matrix._index;
+    const mptr = matrix._ptr;
+
+    // rows & columns dimensions for result matrix
+    const rows = idx.dimension(0);
+    const columns = idx.dimension(1);
+
+    // workspace & permutation vector
+    const w = [];
+    const pv = [];
+
+    // loop rows in resulting matrix
+    rows.forEach(function (i, r) {
+      // update permutation vector
+      pv[i] = r[0];
+      // mark i in workspace
+      w[i] = true;
+    });
+
+    // result matrix arrays
+    const values = mvalues ? [] : undefined;
+    const index = [];
+    const ptr = [];
+
+    // loop columns in result matrix
+    columns.forEach(function (j) {
+      // update ptr
+      ptr.push(index.length);
+      // loop values in column j
+      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {
+        // row
+        i = mindex[k];
+        // check row is in result matrix
+        if (w[i] === true) {
+          // push index
+          index.push(pv[i]);
+          // check we need to process values
+          if (values) {
+            values.push(mvalues[k]);
+          }
+        }
+      }
+    });
+    // update ptr
+    ptr.push(index.length);
+
+    // return matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size,
+      datatype: matrix._datatype
+    });
+  }
+  function _setsubset(matrix, index, submatrix, defaultValue) {
+    // check index
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    }
+
+    // get index size and check whether the index contains a single value
+    const iSize = index.size();
+    const isScalar = index.isScalar();
+
+    // calculate the size of the submatrix, and convert it into an Array if needed
+    let sSize;
+    if ((0, _is.isMatrix)(submatrix)) {
+      // submatrix size
+      sSize = submatrix.size();
+      // use array representation
+      submatrix = submatrix.toArray();
+    } else {
+      // get submatrix size (array, scalar)
+      sSize = (0, _array.arraySize)(submatrix);
+    }
+
+    // check index is a scalar
+    if (isScalar) {
+      // verify submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+      // set value
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // validate dimensions, index size must be one or two dimensions
+      if (iSize.length !== 1 && iSize.length !== 2) {
+        throw new _DimensionError.DimensionError(iSize.length, matrix._size.length, '<');
+      }
+
+      // check submatrix and index have the same dimensions
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        let i = 0;
+        let outer = 0;
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        }
+        // unsqueeze both outer and inner dimensions
+        submatrix = (0, _array.unsqueeze)(submatrix, iSize.length, outer, sSize);
+      }
+
+      // check whether the size of the submatrix matches the index size
+      if (!(0, _object.deepStrictEqual)(iSize, sSize)) {
+        throw new _DimensionError.DimensionError(iSize, sSize, '>');
+      }
+
+      // insert the sub matrix
+      if (iSize.length === 1) {
+        // if the replacement index only has 1 dimension, go trough each one and set its value
+        const range = index.dimension(0);
+        range.forEach(function (dataIndex, subIndex) {
+          (0, _array.validateIndex)(dataIndex);
+          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);
+        });
+      } else {
+        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index
+        const firstDimensionRange = index.dimension(0);
+        const secondDimensionRange = index.dimension(1);
+        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {
+          (0, _array.validateIndex)(firstDataIndex);
+          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {
+            (0, _array.validateIndex)(secondDataIndex);
+            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);
+          });
+        });
+      }
+    }
+    return matrix;
+  }
+
+  /**
+   * Get a single element from the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  SparseMatrix.prototype.get = function (index) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length !== this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length);
+    }
+
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke get on a Pattern only matrix');
+    }
+
+    // row and column
+    const i = index[0];
+    const j = index[1];
+
+    // check i, j are valid
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[1]);
+
+    // find value index
+    const k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);
+    // check k is prior to next column k and it is in the correct row
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      return this._values[k];
+    }
+    return 0;
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} v
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be set to zero.
+   * @return {SparseMatrix} self
+   */
+  SparseMatrix.prototype.set = function (index, v, defaultValue) {
+    if (!(0, _is.isArray)(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length !== this._size.length) {
+      throw new _DimensionError.DimensionError(index.length, this._size.length);
+    }
+
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke set on a Pattern only matrix');
+    }
+
+    // row and column
+    const i = index[0];
+    const j = index[1];
+
+    // rows & columns
+    let rows = this._size[0];
+    let columns = this._size[1];
+
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    if ((0, _is.isString)(this._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, this._datatype);
+    }
+
+    // check we need to resize matrix
+    if (i > rows - 1 || j > columns - 1) {
+      // resize matrix
+      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue);
+      // update rows & columns
+      rows = this._size[0];
+      columns = this._size[1];
+    }
+
+    // check i, j are valid
+    (0, _array.validateIndex)(i, rows);
+    (0, _array.validateIndex)(j, columns);
+
+    // find value index
+    const k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);
+    // check k is prior to next column k and it is in the correct row
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      // check value != 0
+      if (!eq(v, zero)) {
+        // update value
+        this._values[k] = v;
+      } else {
+        // remove value from matrix
+        _remove(k, j, this._values, this._index, this._ptr);
+      }
+    } else {
+      if (!eq(v, zero)) {
+        // insert value @ (i, j)
+        _insert(k, i, j, v, this._values, this._index, this._ptr);
+      }
+    }
+    return this;
+  };
+  function _getValueIndex(i, top, bottom, index) {
+    // check row is on the bottom side
+    if (bottom - top === 0) {
+      return bottom;
+    }
+    // loop rows [top, bottom[
+    for (let r = top; r < bottom; r++) {
+      // check we found value index
+      if (index[r] === i) {
+        return r;
+      }
+    }
+    // we did not find row
+    return top;
+  }
+  function _remove(k, j, values, index, ptr) {
+    // remove value @ k
+    values.splice(k, 1);
+    index.splice(k, 1);
+    // update pointers
+    for (let x = j + 1; x < ptr.length; x++) {
+      ptr[x]--;
+    }
+  }
+  function _insert(k, i, j, v, values, index, ptr) {
+    // insert value
+    values.splice(k, 0, v);
+    // update row for k
+    index.splice(k, 0, i);
+    // update column pointers
+    for (let x = j + 1; x < ptr.length; x++) {
+      ptr[x]++;
+    }
+  }
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof SparseMatrix
+   * @param {number[] | Matrix} size  The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!(0, _is.isCollection)(size)) {
+      throw new TypeError('Array or Matrix expected');
+    }
+
+    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+    const sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+    if (sizeArray.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // check sizes
+    sizeArray.forEach(function (value) {
+      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {
+        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(sizeArray) + ')');
+      }
+    });
+
+    // matrix to resize
+    const m = copy ? this.clone() : this;
+    // resize matrix
+    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);
+  };
+  function _resize(matrix, rows, columns, defaultValue) {
+    // value to insert at the time of growing matrix
+    let value = defaultValue || 0;
+
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    if ((0, _is.isString)(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, matrix._datatype);
+      // convert value to the same datatype
+      value = typed.convert(value, matrix._datatype);
+    }
+
+    // should we insert the value?
+    const ins = !eq(value, zero);
+
+    // old columns and rows
+    const r = matrix._size[0];
+    let c = matrix._size[1];
+    let i, j, k;
+
+    // check we need to increase columns
+    if (columns > c) {
+      // loop new columns
+      for (j = c; j < columns; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._values.length;
+        // check we need to insert matrix._values
+        if (ins) {
+          // loop rows
+          for (i = 0; i < r; i++) {
+            // add new matrix._values
+            matrix._values.push(value);
+            // update matrix._index
+            matrix._index.push(i);
+          }
+        }
+      }
+      // store number of matrix._values in matrix._ptr
+      matrix._ptr[columns] = matrix._values.length;
+    } else if (columns < c) {
+      // truncate matrix._ptr
+      matrix._ptr.splice(columns + 1, c - columns);
+      // truncate matrix._values and matrix._index
+      matrix._values.splice(matrix._ptr[columns], matrix._values.length);
+      matrix._index.splice(matrix._ptr[columns], matrix._index.length);
+    }
+    // update columns
+    c = columns;
+
+    // check we need to increase rows
+    if (rows > r) {
+      // check we have to insert values
+      if (ins) {
+        // inserts
+        let n = 0;
+        // loop columns
+        for (j = 0; j < c; j++) {
+          // update matrix._ptr for current column
+          matrix._ptr[j] = matrix._ptr[j] + n;
+          // where to insert matrix._values
+          k = matrix._ptr[j + 1] + n;
+          // pointer
+          let p = 0;
+          // loop new rows, initialize pointer
+          for (i = r; i < rows; i++, p++) {
+            // add value
+            matrix._values.splice(k + p, 0, value);
+            // update matrix._index
+            matrix._index.splice(k + p, 0, i);
+            // increment inserts
+            n++;
+          }
+        }
+        // store number of matrix._values in matrix._ptr
+        matrix._ptr[c] = matrix._values.length;
+      }
+    } else if (rows < r) {
+      // deletes
+      let d = 0;
+      // loop columns
+      for (j = 0; j < c; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._ptr[j] - d;
+        // where matrix._values start for next column
+        const k0 = matrix._ptr[j];
+        const k1 = matrix._ptr[j + 1] - d;
+        // loop matrix._index
+        for (k = k0; k < k1; k++) {
+          // row
+          i = matrix._index[k];
+          // check we need to delete value and matrix._index
+          if (i > rows - 1) {
+            // remove value
+            matrix._values.splice(k, 1);
+            // remove item from matrix._index
+            matrix._index.splice(k, 1);
+            // increase deletes
+            d++;
+          }
+        }
+      }
+      // update matrix._ptr for current column
+      matrix._ptr[j] = matrix._values.length;
+    }
+    // update matrix._size
+    matrix._size[0] = rows;
+    matrix._size[1] = columns;
+    // return matrix
+    return matrix;
+  }
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof SparseMatrix
+   * @param {number[]} sizes          The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  SparseMatrix.prototype.reshape = function (sizes, copy) {
+    // validate arguments
+    if (!(0, _is.isArray)(sizes)) {
+      throw new TypeError('Array expected');
+    }
+    if (sizes.length !== 2) {
+      throw new Error('Sparse matrices can only be reshaped in two dimensions');
+    }
+
+    // check sizes
+    sizes.forEach(function (value) {
+      if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value <= -2 || value === 0) {
+        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + (0, _string.format)(sizes) + ')');
+      }
+    });
+    const currentLength = this._size[0] * this._size[1];
+    sizes = (0, _array.processSizesWildcard)(sizes, currentLength);
+    const newLength = sizes[0] * sizes[1];
+
+    // m * n must not change
+    if (currentLength !== newLength) {
+      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');
+    }
+
+    // matrix to reshape
+    const m = copy ? this.clone() : this;
+
+    // return unchanged if the same shape
+    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {
+      return m;
+    }
+
+    // Convert to COO format (generate a column index)
+    const colIndex = [];
+    for (let i = 0; i < m._ptr.length; i++) {
+      for (let j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {
+        colIndex.push(i);
+      }
+    }
+
+    // Clone the values array
+    const values = m._values.slice();
+
+    // Clone the row index array
+    const rowIndex = m._index.slice();
+
+    // Transform the (row, column) indices
+    for (let i = 0; i < m._index.length; i++) {
+      const r1 = rowIndex[i];
+      const c1 = colIndex[i];
+      const flat = r1 * m._size[1] + c1;
+      colIndex[i] = flat % sizes[1];
+      rowIndex[i] = Math.floor(flat / sizes[1]);
+    }
+
+    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored
+    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,
+    // sorting several arrays based on some other array.
+
+    // OR, we could easily just:
+
+    // 1. Remove all values from the matrix
+    m._values.length = 0;
+    m._index.length = 0;
+    m._ptr.length = sizes[1] + 1;
+    m._size = sizes.slice();
+    for (let i = 0; i < m._ptr.length; i++) {
+      m._ptr[i] = 0;
+    }
+
+    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)
+    // This step is probably the most time-consuming
+    for (let h = 0; h < values.length; h++) {
+      const i = rowIndex[h];
+      const j = colIndex[h];
+      const v = values[h];
+      const k = _getValueIndex(i, m._ptr[j], m._ptr[j + 1], m._index);
+      _insert(k, i, j, v, m._values, m._index, m._ptr);
+    }
+
+    // The value indices are inserted out of order, but apparently that's... still OK?
+
+    return m;
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @memberof SparseMatrix
+   * @return {SparseMatrix} clone
+   */
+  SparseMatrix.prototype.clone = function () {
+    const m = new SparseMatrix({
+      values: this._values ? (0, _object.clone)(this._values) : undefined,
+      index: (0, _object.clone)(this._index),
+      ptr: (0, _object.clone)(this._ptr),
+      size: (0, _object.clone)(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof SparseMatrix
+   * @returns {number[]} size
+   */
+  SparseMatrix.prototype.size = function () {
+    return this._size.slice(0); // copy the Array
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {SparseMatrix} matrix
+   */
+  SparseMatrix.prototype.map = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke map on a Pattern only matrix');
+    }
+    // matrix instance
+    const me = this;
+    // rows and columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me, 'map');
+    // invoke callback
+    const invoke = function (v, i, j) {
+      // invoke callback
+      return fastCallback.fn(v, [i, j], me);
+    };
+    // invoke _map
+    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on the interval
+   * [minRow..maxRow, minColumn..maxColumn].
+   */
+  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {
+    // result arrays
+    const values = [];
+    const index = [];
+    const ptr = [];
+
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    if ((0, _is.isString)(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, matrix._datatype);
+    }
+
+    // invoke callback
+    const invoke = function (v, x, y) {
+      // invoke callback
+      const value = callback(v, x, y);
+      // check value != 0
+      if (!eq(value, zero)) {
+        // store value
+        values.push(value);
+        // index
+        index.push(x);
+      }
+    };
+    // loop columns
+    for (let j = minColumn; j <= maxColumn; j++) {
+      // store pointer to values index
+      ptr.push(values.length);
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = matrix._ptr[j];
+      const k1 = matrix._ptr[j + 1];
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (let k = k0; k < k1; k++) {
+          // row index
+          const i = matrix._index[k];
+          // check i is in range
+          if (i >= minRow && i <= maxRow) {
+            // value @ k
+            invoke(matrix._values[k], i - minRow, j - minColumn);
+          }
+        }
+      } else {
+        // create a cache holding all defined values
+        const values = {};
+        for (let k = k0; k < k1; k++) {
+          const i = matrix._index[k];
+          values[i] = matrix._values[k];
+        }
+
+        // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+        for (let i = minRow; i <= maxRow; i++) {
+          const value = i in values ? values[i] : 0;
+          invoke(value, i - minRow, j - minColumn);
+        }
+      }
+    }
+
+    // store number of values in ptr
+    ptr.push(values.length);
+    // return sparse matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]
+    });
+  }
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *                              If false, the indices are guaranteed to be in order,
+   *                              if true, the indices can be unordered.
+   */
+  SparseMatrix.prototype.forEach = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke forEach on a Pattern only matrix');
+    }
+    // matrix instance
+    const me = this;
+    // rows and columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+    const fastCallback = (0, _optimizeCallback.optimizeCallback)(callback, me, 'forEach');
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = this._ptr[j];
+      const k1 = this._ptr[j + 1];
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (let k = k0; k < k1; k++) {
+          // row index
+          const i = this._index[k];
+
+          // value @ k
+          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized
+          fastCallback.fn(this._values[k], [i, j], me);
+        }
+      } else {
+        // create a cache holding all defined values
+        const values = {};
+        for (let k = k0; k < k1; k++) {
+          const i = this._index[k];
+          values[i] = this._values[k];
+        }
+
+        // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+        for (let i = 0; i < rows; i++) {
+          const value = i in values ? values[i] : 0;
+          fastCallback.fn(value, [i, j], me);
+        }
+      }
+    }
+  };
+
+  /**
+   * Iterate over the matrix elements, skipping zeros
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  SparseMatrix.prototype[Symbol.iterator] = function* () {
+    if (!this._values) {
+      throw new Error('Cannot iterate a Pattern only matrix');
+    }
+    const columns = this._size[1];
+    for (let j = 0; j < columns; j++) {
+      const k0 = this._ptr[j];
+      const k1 = this._ptr[j + 1];
+      for (let k = k0; k < k1; k++) {
+        // row index
+        const i = this._index[k];
+        yield {
+          value: this._values[k],
+          index: [i, j]
+        };
+      }
+    }
+  };
+
+  /**
+   * Create an Array with a copy of the data of the SparseMatrix
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+  SparseMatrix.prototype.toArray = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, true);
+  };
+
+  /**
+   * Get the primitive value of the SparseMatrix: a two dimensions array
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+  SparseMatrix.prototype.valueOf = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, false);
+  };
+  function _toArray(values, index, ptr, size, copy) {
+    // rows and columns
+    const rows = size[0];
+    const columns = size[1];
+    // result
+    const a = [];
+    // vars
+    let i, j;
+    // initialize array
+    for (i = 0; i < rows; i++) {
+      a[i] = [];
+      for (j = 0; j < columns; j++) {
+        a[i][j] = 0;
+      }
+    }
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = ptr[j];
+      const k1 = ptr[j + 1];
+      // loop k within [k0, k1[
+      for (let k = k0; k < k1; k++) {
+        // row index
+        i = index[k];
+        // set value (use one for pattern matrix)
+        a[i][j] = values ? copy ? (0, _object.clone)(values[k]) : values[k] : 1;
+      }
+    }
+    return a;
+  }
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof SparseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  SparseMatrix.prototype.format = function (options) {
+    // rows and columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+    // density
+    const density = this.density();
+    // rows & columns
+    let str = 'Sparse Matrix [' + (0, _string.format)(rows, options) + ' x ' + (0, _string.format)(columns, options) + '] density: ' + (0, _string.format)(density, options) + '\n';
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = this._ptr[j];
+      const k1 = this._ptr[j + 1];
+      // loop k within [k0, k1[
+      for (let k = k0; k < k1; k++) {
+        // row index
+        const i = this._index[k];
+        // append value
+        str += '\n    (' + (0, _string.format)(i, options) + ', ' + (0, _string.format)(j, options) + ') ==> ' + (this._values ? (0, _string.format)(this._values[k], options) : 'X');
+      }
+    }
+    return str;
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {string} str
+   */
+  SparseMatrix.prototype.toString = function () {
+    return (0, _string.format)(this.toArray());
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {Object}
+   */
+  SparseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'SparseMatrix',
+      values: this._values,
+      index: this._index,
+      ptr: this._ptr,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof SparseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix vector with the diagonal values.
+   */
+  SparseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    const kSuper = k > 0 ? k : 0;
+    const kSub = k < 0 ? -k : 0;
+
+    // rows & columns
+    const rows = this._size[0];
+    const columns = this._size[1];
+
+    // number diagonal values
+    const n = Math.min(rows - kSub, columns - kSuper);
+
+    // diagonal arrays
+    const values = [];
+    const index = [];
+    const ptr = [];
+    // initial ptr value
+    ptr[0] = 0;
+    // loop columns
+    for (let j = kSuper; j < columns && values.length < n; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = this._ptr[j];
+      const k1 = this._ptr[j + 1];
+      // loop x within [k0, k1[
+      for (let x = k0; x < k1; x++) {
+        // row index
+        const i = this._index[x];
+        // check row
+        if (i === j - kSuper + kSub) {
+          // value on this column
+          values.push(this._values[x]);
+          // store row
+          index[values.length - 1] = i - kSub;
+          // exit loop
+          break;
+        }
+      }
+    }
+    // close ptr
+    ptr.push(values.length);
+    // return matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [n, 1]
+    });
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof SparseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,
+   *                       where mathjs is optional
+   * @returns {SparseMatrix}
+   */
+  SparseMatrix.fromJSON = function (json) {
+    return new SparseMatrix(json);
+  };
+
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {Array} size                       The matrix size.
+   * @param {number | Array | Matrix } value   The values for the diagonal.
+   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]            The default value for non-diagonal
+   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.
+   *
+   * @returns {SparseMatrix}
+   */
+  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {
+    if (!(0, _is.isArray)(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // map size & validate
+    size = size.map(function (s) {
+      // check it is a big number
+      if ((0, _is.isBigNumber)(s)) {
+        // convert it
+        s = s.toNumber();
+      }
+      // validate arguments
+      if (!(0, _is.isNumber)(s) || !(0, _number.isInteger)(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+      return s;
+    });
+
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if ((0, _is.isBigNumber)(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!(0, _is.isNumber)(k) || !(0, _number.isInteger)(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    if ((0, _is.isString)(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, datatype);
+    }
+    const kSuper = k > 0 ? k : 0;
+    const kSub = k < 0 ? -k : 0;
+
+    // rows and columns
+    const rows = size[0];
+    const columns = size[1];
+
+    // number of non-zero items
+    const n = Math.min(rows - kSub, columns - kSuper);
+
+    // value extraction function
+    let _value;
+
+    // check value
+    if ((0, _is.isArray)(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      }
+      // define function
+      _value = function (i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if ((0, _is.isMatrix)(value)) {
+      // matrix size
+      const ms = value.size();
+      // validate matrix
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      }
+      // define function
+      _value = function (i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function () {
+        // return value
+        return value;
+      };
+    }
+
+    // create arrays
+    const values = [];
+    const index = [];
+    const ptr = [];
+
+    // loop items
+    for (let j = 0; j < columns; j++) {
+      // number of rows with value
+      ptr.push(values.length);
+      // diagonal index
+      const i = j - kSuper;
+      // check we need to set diagonal value
+      if (i >= 0 && i < n) {
+        // get value @ i
+        const v = _value(i);
+        // check for zero
+        if (!eq(v, zero)) {
+          // column
+          index.push(i + kSub);
+          // add value
+          values.push(v);
+        }
+      }
+    }
+    // last value should be number of values
+    ptr.push(values.length);
+    // create SparseMatrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [rows, columns]
+    });
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  SparseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!(0, _is.isNumber)(i) || !(0, _number.isInteger)(i) || !(0, _is.isNumber)(j) || !(0, _number.isInteger)(j)) {
+      throw new Error('Row index must be positive integers');
+    }
+    // check dimensions
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    // validate index
+    (0, _array.validateIndex)(i, this._size[0]);
+    (0, _array.validateIndex)(j, this._size[0]);
+
+    // swap rows
+    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);
+    // return current instance
+    return this;
+  };
+
+  /**
+   * Loop rows with data in column j.
+   *
+   * @param {number} j            Column
+   * @param {Array} values        Matrix values
+   * @param {Array} index         Matrix row indeces
+   * @param {Array} ptr           Matrix column pointers
+   * @param {Function} callback   Callback function invoked for every row in column j
+   */
+  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {
+    // indeces for column j
+    const k0 = ptr[j];
+    const k1 = ptr[j + 1];
+
+    // loop
+    for (let k = k0; k < k1; k++) {
+      // invoke callback
+      callback(index[k], values[k]);
+    }
+  };
+
+  /**
+   * Swap rows x and y in Sparse Matrix data structures.
+   *
+   * @param {number} x         Matrix row index 1
+   * @param {number} y         Matrix row index 2
+   * @param {number} columns   Number of columns in matrix
+   * @param {Array} values     Matrix values
+   * @param {Array} index      Matrix row indeces
+   * @param {Array} ptr        Matrix column pointers
+   */
+  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      const k0 = ptr[j];
+      const k1 = ptr[j + 1];
+      // find value index @ x
+      const kx = _getValueIndex(x, k0, k1, index);
+      // find value index @ x
+      const ky = _getValueIndex(y, k0, k1, index);
+      // check both rows exist in matrix
+      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {
+        // swap values (check for pattern matrix)
+        if (values) {
+          const v = values[kx];
+          values[kx] = values[ky];
+          values[ky] = v;
+        }
+        // next column
+        continue;
+      }
+      // check x row exist & no y row
+      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {
+        // value @ x (check for pattern matrix)
+        const vx = values ? values[kx] : undefined;
+        // insert value @ y
+        index.splice(ky, 0, y);
+        if (values) {
+          values.splice(ky, 0, vx);
+        }
+        // remove value @ x (adjust array index if needed)
+        index.splice(ky <= kx ? kx + 1 : kx, 1);
+        if (values) {
+          values.splice(ky <= kx ? kx + 1 : kx, 1);
+        }
+        // next column
+        continue;
+      }
+      // check y row exist & no x row
+      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {
+        // value @ y (check for pattern matrix)
+        const vy = values ? values[ky] : undefined;
+        // insert value @ x
+        index.splice(kx, 0, x);
+        if (values) {
+          values.splice(kx, 0, vy);
+        }
+        // remove value @ y (adjust array index if needed)
+        index.splice(kx <= ky ? ky + 1 : ky, 1);
+        if (values) {
+          values.splice(kx <= ky ? ky + 1 : ky, 1);
+        }
+      }
+    }
+  };
+  return SparseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/index.js b/node_modules/mathjs/lib/cjs/type/matrix/function/index.js
new file mode 100644
index 0000000..fcc8cb0
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/index.js
@@ -0,0 +1,70 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createIndex = void 0;
+var _is = require("../../../utils/is.js");
+var _factory = require("../../../utils/factory.js");
+const name = 'index';
+const dependencies = ['typed', 'Index'];
+const createIndex = exports.createIndex = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Index
+  } = _ref;
+  /**
+   * Create an index. An Index can store ranges having start, step, and end
+   * for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Syntax:
+   *
+   *     math.index(range1, range2, ...)
+   *
+   * Where each range can be any of:
+   *
+   * - A number
+   * - A string for getting/setting an object property
+   * - An instance of `Range`
+   * - A one-dimensional Array or a Matrix with numbers or booleans
+   *
+   * Indexes must be zero-based, integer numbers.
+   *
+   * Examples:
+   *
+   *    const b = [1, 2, 3, 4, 5]
+   *    math.subset(b, math.index([1, 2, 3]))                         // returns [2, 3, 4]
+   *    math.subset(b, math.index([false, true, true, true, false]))  // returns [2, 3, 4]
+   *
+   *    const a = math.matrix([[1, 2], [3, 4]])
+   *    a.subset(math.index(0, 1))             // returns 2
+   *    a.subset(math.index(0, [false, true])) // returns 2
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, matrix, number, string, unit
+   *
+   * @param {...*} ranges   Zero or more ranges or numbers.
+   * @return {Index}        Returns the created index
+   */
+  return typed(name, {
+    '...number | string | BigNumber | Range | Array | Matrix': function (args) {
+      const ranges = args.map(function (arg) {
+        if ((0, _is.isBigNumber)(arg)) {
+          return arg.toNumber(); // convert BigNumber to Number
+        } else if ((0, _is.isArray)(arg) || (0, _is.isMatrix)(arg)) {
+          return arg.map(function (elem) {
+            // convert BigNumber to Number
+            return (0, _is.isBigNumber)(elem) ? elem.toNumber() : elem;
+          });
+        } else {
+          return arg;
+        }
+      });
+      const res = new Index();
+      Index.apply(res, ranges);
+      return res;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js b/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js
new file mode 100644
index 0000000..0766331
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/matrix.js
@@ -0,0 +1,88 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrix = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'matrix';
+const dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];
+const createMatrix = exports.createMatrix = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Supported storage formats are 'dense' and 'sparse'.
+   *
+   * Syntax:
+   *
+   *    math.matrix()                         // creates an empty matrix using default storage format (dense).
+   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).
+   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.
+   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.
+   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.
+   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
+   *
+   * Examples:
+   *
+   *    let m = math.matrix([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, sparse
+   *
+   * @param {Array | Matrix} [data]    A multi dimensional array
+   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]        Type of the values
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function () {
+      return _create([]);
+    },
+    string: function (format) {
+      return _create([], format);
+    },
+    'string, string': function (format, datatype) {
+      return _create([], format, datatype);
+    },
+    Array: function (data) {
+      return _create(data);
+    },
+    Matrix: function (data) {
+      return _create(data, data.storage());
+    },
+    'Array | Matrix, string': _create,
+    'Array | Matrix, string, string': _create
+  });
+
+  /**
+   * Create a new Matrix with given storage format
+   * @param {Array} data
+   * @param {string} [format]
+   * @param {string} [datatype]
+   * @returns {Matrix} Returns a new Matrix
+   * @private
+   */
+  function _create(data, format, datatype) {
+    // get storage format constructor
+    if (format === 'dense' || format === 'default' || format === undefined) {
+      return new DenseMatrix(data, datatype);
+    }
+    if (format === 'sparse') {
+      return new SparseMatrix(data, datatype);
+    }
+    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js b/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js
new file mode 100644
index 0000000..38d7ff5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/function/sparse.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSparse = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'sparse';
+const dependencies = ['typed', 'SparseMatrix'];
+const createSparse = exports.createSparse = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a Sparse Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Note that a Sparse Matrix is always 2-dimensional, so for example if
+   * you create one from a plain array of _n_ numbers, you get an _n_ by 1
+   * Sparse "column vector".
+   *
+   * Syntax:
+   *
+   *    math.sparse()               // creates an empty sparse matrix.
+   *    math.sparse(data)           // creates a sparse matrix with initial data.
+   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
+   *
+   * Examples:
+   *
+   *    let m = math.sparse([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *    let v = math.sparse([0, 0, 1])
+   *    v.size()                        // Array [3, 1]
+   *    v.get([2, 0])                   // number 1
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, matrix
+   *
+   * @param {Array | Matrix} [data]    A two dimensional array
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function () {
+      return new SparseMatrix([]);
+    },
+    string: function (datatype) {
+      return new SparseMatrix([], datatype);
+    },
+    'Array | Matrix': function (data) {
+      return new SparseMatrix(data);
+    },
+    'Array | Matrix, string': function (data, datatype) {
+      return new SparseMatrix(data, datatype);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/broadcast.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/broadcast.js
new file mode 100644
index 0000000..deb786e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/broadcast.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.broadcast = broadcast;
+var _array = require("../../../utils/array.js");
+var _object = require("../../../utils/object.js");
+/**
+* Broadcasts two matrices, and return both in an array
+* It checks if it's possible with broadcasting rules
+*
+* @param {Matrix}   A      First Matrix
+* @param {Matrix}   B      Second Matrix
+*
+* @return {Matrix[]}      [ broadcastedA, broadcastedB ]
+*/
+
+function broadcast(A, B) {
+  if ((0, _object.deepStrictEqual)(A.size(), B.size())) {
+    // If matrices have the same size return them
+    return [A, B];
+  }
+
+  // calculate the broadcasted sizes
+  const newSize = (0, _array.broadcastSizes)(A.size(), B.size());
+
+  // return the array with the two broadcasted matrices
+  return [A, B].map(M => _broadcastTo(M, newSize));
+}
+
+/**
+ * Broadcasts a matrix to the given size.
+ *
+ * @param {Matrix} M - The matrix to be broadcasted.
+ * @param {number[]} size - The desired size of the broadcasted matrix.
+ * @returns {Matrix} The broadcasted matrix.
+ * @throws {Error} If the size parameter is not an array of numbers.
+ */
+function _broadcastTo(M, size) {
+  if ((0, _object.deepStrictEqual)(M.size(), size)) {
+    return M;
+  }
+  return M.create((0, _array.broadcastTo)(M.valueOf(), size), M.datatype());
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo01xDSid.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo01xDSid.js
new file mode 100644
index 0000000..0df668b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo01xDSid.js
@@ -0,0 +1,118 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo01xDSid = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo01xDSid';
+const dependencies = ['typed'];
+const createMatAlgo01xDSid = exports.createMatAlgo01xDSid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  Dij          ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    const adata = denseMatrix._data;
+    const asize = denseMatrix._size;
+    const adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    const bvalues = sparseMatrix._values;
+    const bindex = sparseMatrix._index;
+    const bptr = sparseMatrix._ptr;
+    const bsize = sparseMatrix._size;
+    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // process data types
+    const dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined;
+    // callback function
+    const cf = dt ? typed.find(callback, [dt, dt]) : callback;
+
+    // vars
+    let i, j;
+
+    // result (DenseMatrix)
+    const cdata = [];
+    // initialize c
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    }
+
+    // workspace
+    const x = [];
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // loop columns in b
+    for (j = 0; j < columns; j++) {
+      // column mark
+      const mark = j + 1;
+      // values in column j
+      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // update workspace
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        // mark i as updated
+        w[i] = mark;
+      }
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // check row is in workspace
+        if (w[i] === mark) {
+          // c[i][j] was already calculated
+          cdata[i][j] = x[i];
+        } else {
+          // item does not exist in S
+          cdata[i][j] = adata[i][j];
+        }
+      }
+    }
+
+    // return dense matrix
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo02xDS0.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo02xDS0.js
new file mode 100644
index 0000000..9f6657e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo02xDS0.js
@@ -0,0 +1,122 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo02xDS0 = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo02xDS0';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo02xDS0 = exports.createMatAlgo02xDS0 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function matAlgo02xDS0(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    const adata = denseMatrix._data;
+    const asize = denseMatrix._size;
+    const adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    const bvalues = sparseMatrix._values;
+    const bindex = sparseMatrix._index;
+    const bptr = sparseMatrix._ptr;
+    const bsize = sparseMatrix._size;
+    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result (SparseMatrix)
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+
+    // loop columns in b
+    for (let j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // values in column j
+      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        const i = bindex[k];
+        // update C(i,j)
+        const cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        // check for nonzero
+        if (!eq(cij, zero)) {
+          // push i & v
+          cindex.push(i);
+          cvalues.push(cij);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return sparseMatrix.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo03xDSf.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo03xDSf.js
new file mode 100644
index 0000000..03de89f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo03xDSf.js
@@ -0,0 +1,128 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo03xDSf = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo03xDSf';
+const dependencies = ['typed'];
+const createMatAlgo03xDSf = exports.createMatAlgo03xDSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked M*N times.
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(Dij, 0)    ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function matAlgo03xDSf(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    const adata = denseMatrix._data;
+    const asize = denseMatrix._size;
+    const adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    const bvalues = sparseMatrix._values;
+    const bindex = sparseMatrix._index;
+    const bptr = sparseMatrix._ptr;
+    const bsize = sparseMatrix._size;
+    const bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result (DenseMatrix)
+    const cdata = [];
+
+    // initialize dense matrix
+    for (let z = 0; z < rows; z++) {
+      // initialize row
+      cdata[z] = [];
+    }
+
+    // workspace
+    const x = [];
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // loop columns in b
+    for (let j = 0; j < columns; j++) {
+      // column mark
+      const mark = j + 1;
+      // values in column j
+      for (let k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        const i = bindex[k];
+        // update workspace
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        w[i] = mark;
+      }
+      // process workspace
+      for (let y = 0; y < rows; y++) {
+        // check we have a calculated value for current row
+        if (w[y] === mark) {
+          // use calculated value
+          cdata[y][j] = x[y];
+        } else {
+          // calculate value
+          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);
+        }
+      }
+    }
+
+    // return dense matrix
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo04xSidSid.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo04xSidSid.js
new file mode 100644
index 0000000..dde74fe
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo04xSidSid.js
@@ -0,0 +1,185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo04xSidSid = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo04xSidSid';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo04xSidSid = exports.createMatAlgo04xSidSid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0
+   *          └  B(i,j)       ; A(i,j) === 0
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo04xSidSid(a, b, callback) {
+    // sparse matrix arrays
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = avalues && bvalues ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+
+    // workspace
+    const xa = avalues && bvalues ? [] : undefined;
+    const xb = avalues && bvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    const wa = [];
+    const wb = [];
+
+    // vars
+    let i, j, k, k0, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      const mark = j + 1;
+      // loop A(:,j)
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // update c
+        cindex.push(i);
+        // update workspace
+        wa[i] = mark;
+        // check we need to process values
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      }
+      // loop B(:,j)
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check row exists in A
+        if (wa[i] === mark) {
+          // update record in xa @ i
+          if (xa) {
+            // invoke callback
+            const v = cf(xa[i], bvalues[k]);
+            // check for zero
+            if (!eq(v, zero)) {
+              // update workspace
+              xa[i] = v;
+            } else {
+              // remove mark (index will be removed later)
+              wa[i] = null;
+            }
+          }
+        } else {
+          // update c
+          cindex.push(i);
+          // update workspace
+          wb[i] = mark;
+          // check we need to process values
+          if (xb) {
+            xb[i] = bvalues[k];
+          }
+        }
+      }
+      // check we need to process values (non pattern matrix)
+      if (xa && xb) {
+        // initialize first index in j
+        k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          i = cindex[k];
+          // check workspace has value @ i
+          if (wa[i] === mark) {
+            // push value (Aij != 0 || (Aij != 0 && Bij != 0))
+            cvalues[k] = xa[i];
+            // increment pointer
+            k++;
+          } else if (wb[i] === mark) {
+            // push value (bij != 0)
+            cvalues[k] = xb[i];
+            // increment pointer
+            k++;
+          } else {
+            // remove index @ k
+            cindex.splice(k, 1);
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo05xSfSf.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo05xSfSf.js
new file mode 100644
index 0000000..9b0427c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo05xSfSf.js
@@ -0,0 +1,177 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo05xSfSf = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo05xSfSf';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo05xSfSf = exports.createMatAlgo05xSfSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo05xSfSf(a, b, callback) {
+    // sparse matrix arrays
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = avalues && bvalues ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+
+    // workspaces
+    const xa = cvalues ? [] : undefined;
+    const xb = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    const wa = [];
+    const wb = [];
+
+    // vars
+    let i, j, k, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      const mark = j + 1;
+      // loop values A(:,j)
+      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // push index
+        cindex.push(i);
+        // update workspace
+        wa[i] = mark;
+        // check we need to process values
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      }
+      // loop values B(:,j)
+      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check row existed in A
+        if (wa[i] !== mark) {
+          // push index
+          cindex.push(i);
+        }
+        // update workspace
+        wb[i] = mark;
+        // check we need to process values
+        if (xb) {
+          xb[i] = bvalues[k];
+        }
+      }
+      // check we need to process values (non pattern matrix)
+      if (cvalues) {
+        // initialize first index in j
+        k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          i = cindex[k];
+          // marks
+          const wai = wa[i];
+          const wbi = wb[i];
+          // check Aij or Bij are nonzero
+          if (wai === mark || wbi === mark) {
+            // matrix values @ i,j
+            const va = wai === mark ? xa[i] : zero;
+            const vb = wbi === mark ? xb[i] : zero;
+            // Cij
+            const vc = cf(va, vb);
+            // check for zero
+            if (!eq(vc, zero)) {
+              // push value
+              cvalues.push(vc);
+              // increment pointer
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo06xS0S0.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo06xS0S0.js
new file mode 100644
index 0000000..664af19
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo06xS0S0.js
@@ -0,0 +1,159 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo06xS0S0 = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+var _collection = require("../../../utils/collection.js");
+const name = 'matAlgo06xS0S0';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo06xS0S0 = exports.createMatAlgo06xS0S0 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo06xS0S0(a, b, callback) {
+    // sparse matrix arrays
+    const avalues = a._values;
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    const bvalues = b._values;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = avalues && bvalues ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+
+    // workspaces
+    const x = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    const w = [];
+    // marks indicating value in a given row has been updated
+    const u = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      const mark = j + 1;
+      // scatter the values of A(:,j) into workspace
+      (0, _collection.scatter)(a, j, w, x, u, mark, cindex, cf);
+      // scatter the values of B(:,j) into workspace
+      (0, _collection.scatter)(b, j, w, x, u, mark, cindex, cf);
+      // check we need to process values (non pattern matrix)
+      if (x) {
+        // initialize first index in j
+        let k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          const i = cindex[k];
+          // check function was invoked on current row (Aij !=0 && Bij != 0)
+          if (u[i] === mark) {
+            // value @ i
+            const v = x[i];
+            // check for zero value
+            if (!eq(v, zero)) {
+              // push value
+              cvalues.push(v);
+              // increment pointer
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          } else {
+            // remove value @ i, do not increment pointer
+            cindex.splice(k, 1);
+          }
+        }
+      } else {
+        // initialize first index in j
+        let p = cptr[j];
+        // loop index in j
+        while (p < cindex.length) {
+          // row
+          const r = cindex[p];
+          // check function was invoked on current row (Aij !=0 && Bij != 0)
+          if (u[r] !== mark) {
+            // remove value @ i, do not increment pointer
+            cindex.splice(p, 1);
+          } else {
+            // increment pointer
+            p++;
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo07xSSf.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo07xSSf.js
new file mode 100644
index 0000000..42b3496
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo07xSSf.js
@@ -0,0 +1,121 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo07xSSf = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo07xSSf';
+const dependencies = ['typed', 'SparseMatrix'];
+const createMatAlgo07xSSf = exports.createMatAlgo07xSSf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    SparseMatrix
+  } = _ref;
+  /**
+  * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).
+  * Callback function invoked MxN times.
+  *
+  * C(i,j) = f(Aij, Bij)
+  *
+  * @param {Matrix}   a                 The SparseMatrix instance (A)
+  * @param {Matrix}   b                 The SparseMatrix instance (B)
+  * @param {Function} callback          The f(Aij,Bij) operation to invoke
+  *
+  * @return {Matrix}                    SparseMatrix (C)
+  *
+  * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+  */
+  return function matAlgo07xSSf(a, b, callback) {
+    // sparse matrix arrays
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    let zero = 0;
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      dt = adt;
+      zero = typed.convert(0, dt);
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays for sparse format
+    const cvalues = [];
+    const cindex = [];
+    const cptr = new Array(columns + 1).fill(0); // Start with column pointer array
+
+    // workspaces
+    const xa = [];
+    const xb = [];
+    const wa = [];
+    const wb = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      const mark = j + 1;
+      let nonZeroCount = 0;
+      _scatter(a, j, wa, xa, mark);
+      _scatter(b, j, wb, xb, mark);
+
+      // loop rows
+      for (let i = 0; i < rows; i++) {
+        const va = wa[i] === mark ? xa[i] : zero;
+        const vb = wb[i] === mark ? xb[i] : zero;
+
+        // invoke callback
+        const cij = cf(va, vb);
+        // Store all non zero and true values
+        if (cij !== 0 && cij !== false) {
+          cindex.push(i); // row index
+          cvalues.push(cij); // computed value
+          nonZeroCount++;
+        }
+      }
+
+      // Update column pointer with cumulative count of non-zero values
+      cptr[j + 1] = cptr[j] + nonZeroCount;
+    }
+
+    // Return the result as a sparse matrix
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+  function _scatter(m, j, w, x, mark) {
+    // a arrays
+    const values = m._values;
+    const index = m._index;
+    const ptr = m._ptr;
+    // loop values in column j
+    for (let k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {
+      // row
+      const i = index[k];
+      // update workspace
+      w[i] = mark;
+      x[i] = values[k];
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo08xS0Sid.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo08xS0Sid.js
new file mode 100644
index 0000000..82bfddb
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo08xS0Sid.js
@@ -0,0 +1,160 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo08xS0Sid = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo08xS0Sid';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo08xS0Sid = exports.createMatAlgo08xS0Sid = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo08xS0Sid(a, b, callback) {
+    // sparse matrix arrays
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues || !bvalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrices');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+
+    // workspace
+    const x = [];
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // vars
+    let k, k0, k1, i;
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      const mark = j + 1;
+      // loop values in a
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // mark workspace
+        w[i] = mark;
+        // set value
+        x[i] = avalues[k];
+        // add index
+        cindex.push(i);
+      }
+      // loop values in b
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check value exists in workspace
+        if (w[i] === mark) {
+          // evaluate callback
+          x[i] = cf(x[i], bvalues[k]);
+        }
+      }
+      // initialize first index in j
+      k = cptr[j];
+      // loop index in j
+      while (k < cindex.length) {
+        // row
+        i = cindex[k];
+        // value @ i
+        const v = x[i];
+        // check for zero value
+        if (!eq(v, zero)) {
+          // push value
+          cvalues.push(v);
+          // increment pointer
+          k++;
+        } else {
+          // remove value @ i, do not increment pointer
+          cindex.splice(k, 1);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo09xS0Sf.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo09xS0Sf.js
new file mode 100644
index 0000000..cc28ebd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo09xS0Sf.js
@@ -0,0 +1,148 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo09xS0Sf = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo09xS0Sf';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo09xS0Sf = exports.createMatAlgo09xS0Sf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).
+   * Callback function invoked NZA times, number of nonzero elements in A.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo09xS0Sf(a, b, callback) {
+    // sparse matrix arrays
+    const avalues = a._values;
+    const aindex = a._index;
+    const aptr = a._ptr;
+    const asize = a._size;
+    const adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    const bvalues = b._values;
+    const bindex = b._index;
+    const bptr = b._ptr;
+    const bsize = b._size;
+    const bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = avalues && bvalues ? [] : undefined;
+    const cindex = [];
+    const cptr = [];
+
+    // workspaces
+    const x = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // vars
+    let i, j, k, k0, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // column mark
+      const mark = j + 1;
+      // check we need to process values
+      if (x) {
+        // loop B(:,j)
+        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+          // row
+          i = bindex[k];
+          // update workspace
+          w[i] = mark;
+          x[i] = bvalues[k];
+        }
+      }
+      // loop A(:,j)
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // check we need to process values
+        if (x) {
+          // b value @ i,j
+          const vb = w[i] === mark ? x[i] : zero;
+          // invoke f
+          const vc = cf(avalues[k], vb);
+          // check zero value
+          if (!eq(vc, zero)) {
+            // push index
+            cindex.push(i);
+            // push value
+            cvalues.push(vc);
+          }
+        } else {
+          // push index
+          cindex.push(i);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo10xSids.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo10xSids.js
new file mode 100644
index 0000000..24031a7
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo10xSids.js
@@ -0,0 +1,111 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo10xSids = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'matAlgo10xSids';
+const dependencies = ['typed', 'DenseMatrix'];
+const createMatAlgo10xSids = exports.createMatAlgo10xSids = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  b          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo10xSids(s, b, callback, inverse) {
+    // sparse matrix arrays
+    const avalues = s._values;
+    const aindex = s._index;
+    const aptr = s._ptr;
+    const asize = s._size;
+    const adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cdata = [];
+
+    // workspaces
+    const x = [];
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // columns mark
+      const mark = j + 1;
+      // values in j
+      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        const r = aindex[k];
+        // update workspace
+        x[r] = avalues[k];
+        w[r] = mark;
+      }
+      // loop rows
+      for (let i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        }
+        // check sparse matrix has a value @ i,j
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = b;
+        }
+      }
+    }
+
+    // return dense matrix
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo11xS0s.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo11xS0s.js
new file mode 100644
index 0000000..8aae4e8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo11xS0s.js
@@ -0,0 +1,109 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo11xS0s = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'matAlgo11xS0s';
+const dependencies = ['typed', 'equalScalar'];
+const createMatAlgo11xS0s = exports.createMatAlgo11xS0s = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo11xS0s(s, b, callback, inverse) {
+    // sparse matrix arrays
+    const avalues = s._values;
+    const aindex = s._index;
+    const aptr = s._ptr;
+    const asize = s._size;
+    const adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // equal signature to use
+    let eq = equalScalar;
+    // zero value
+    let zero = 0;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cvalues = [];
+    const cindex = [];
+    const cptr = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // initialize ptr
+      cptr[j] = cindex.length;
+      // values in j
+      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        const i = aindex[k];
+        // invoke callback
+        const v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);
+        // check value is zero
+        if (!eq(v, zero)) {
+          // push index & value
+          cindex.push(i);
+          cvalues.push(v);
+        }
+      }
+    }
+    // update ptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return s.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo12xSfs.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo12xSfs.js
new file mode 100644
index 0000000..7090a8c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo12xSfs.js
@@ -0,0 +1,111 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo12xSfs = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'matAlgo12xSfs';
+const dependencies = ['typed', 'DenseMatrix'];
+const createMatAlgo12xSfs = exports.createMatAlgo12xSfs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked MxN times.
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(0, b)    ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo12xSfs(s, b, callback, inverse) {
+    // sparse matrix arrays
+    const avalues = s._values;
+    const aindex = s._index;
+    const aptr = s._ptr;
+    const asize = s._size;
+    const adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    const rows = asize[0];
+    const columns = asize[1];
+
+    // datatype
+    let dt;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    const cdata = [];
+
+    // workspaces
+    const x = [];
+    // marks indicating we have a value in x for a given column
+    const w = [];
+
+    // loop columns
+    for (let j = 0; j < columns; j++) {
+      // columns mark
+      const mark = j + 1;
+      // values in j
+      for (let k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        const r = aindex[k];
+        // update workspace
+        x[r] = avalues[k];
+        w[r] = mark;
+      }
+      // loop rows
+      for (let i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        }
+        // check sparse matrix has a value @ i,j
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);
+        }
+      }
+    }
+
+    // return dense matrix
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo13xDD.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo13xDD.js
new file mode 100644
index 0000000..3c4ce7a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo13xDD.js
@@ -0,0 +1,100 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo13xDD = void 0;
+var _factory = require("../../../utils/factory.js");
+var _DimensionError = require("../../../error/DimensionError.js");
+const name = 'matAlgo13xDD';
+const dependencies = ['typed'];
+const createMatAlgo13xDD = exports.createMatAlgo13xDD = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, Bij..z)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Matrix}   b                 The DenseMatrix instance (B)
+   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658
+   */
+  return function matAlgo13xDD(a, b, callback) {
+    // a arrays
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype;
+    // b arrays
+    const bdata = b._data;
+    const bsize = b._size;
+    const bdt = b._datatype;
+    // c arrays
+    const csize = [];
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new _DimensionError.DimensionError(asize.length, bsize.length);
+    }
+
+    // validate each one of the dimension sizes
+    for (let s = 0; s < asize.length; s++) {
+      // must match
+      if (asize[s] !== bsize[s]) {
+        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+      }
+      // update dimension in c
+      csize[s] = asize[s];
+    }
+
+    // datatype
+    let dt;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt;
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // populate cdata, iterate through dimensions
+    const cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];
+
+    // c matrix
+    return a.createDenseMatrix({
+      data: cdata,
+      size: csize,
+      datatype: dt
+    });
+  };
+
+  // recursive function
+  function _iterate(f, level, s, n, av, bv) {
+    // initialize array for this level
+    const cv = [];
+    // check we reach the last level
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (let i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = f(av[i], bv[i]);
+      }
+    } else {
+      // iterate current level
+      for (let j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);
+      }
+    }
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo14xDs.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo14xDs.js
new file mode 100644
index 0000000..89033d9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matAlgo14xDs.js
@@ -0,0 +1,82 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatAlgo14xDs = void 0;
+var _factory = require("../../../utils/factory.js");
+var _object = require("../../../utils/object.js");
+const name = 'matAlgo14xDs';
+const dependencies = ['typed'];
+const createMatAlgo14xDs = exports.createMatAlgo14xDs = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, b)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij..z,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042
+   */
+  return function matAlgo14xDs(a, b, callback, inverse) {
+    // a arrays
+    const adata = a._data;
+    const asize = a._size;
+    const adt = a._datatype;
+
+    // datatype
+    let dt;
+    // callback signature to use
+    let cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // populate cdata, iterate through dimensions
+    const cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];
+
+    // c matrix
+    return a.createDenseMatrix({
+      data: cdata,
+      size: (0, _object.clone)(asize),
+      datatype: dt
+    });
+  };
+
+  // recursive function
+  function _iterate(f, level, s, n, av, bv, inverse) {
+    // initialize array for this level
+    const cv = [];
+    // check we reach the last level
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (let i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);
+      }
+    } else {
+      // iterate current level
+      for (let j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);
+      }
+    }
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/matrix/utils/matrixAlgorithmSuite.js b/node_modules/mathjs/lib/cjs/type/matrix/utils/matrixAlgorithmSuite.js
new file mode 100644
index 0000000..70cabe6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/matrix/utils/matrixAlgorithmSuite.js
@@ -0,0 +1,158 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createMatrixAlgorithmSuite = void 0;
+var _factory = require("../../../utils/factory.js");
+var _object = require("../../../utils/object.js");
+var _matAlgo13xDD = require("./matAlgo13xDD.js");
+var _matAlgo14xDs = require("./matAlgo14xDs.js");
+var _broadcast = require("./broadcast.js");
+const name = 'matrixAlgorithmSuite';
+const dependencies = ['typed', 'matrix'];
+const createMatrixAlgorithmSuite = exports.createMatrixAlgorithmSuite = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix
+  } = _ref;
+  const matAlgo13xDD = (0, _matAlgo13xDD.createMatAlgo13xDD)({
+    typed
+  });
+  const matAlgo14xDs = (0, _matAlgo14xDs.createMatAlgo14xDs)({
+    typed
+  });
+
+  /**
+   * Return a signatures object with the usual boilerplate of
+   * matrix algorithms, based on a plain options object with the
+   * following properties:
+   *   elop: function -- the elementwise operation to use, defaults to self
+   *   SS: function -- the algorithm to apply for two sparse matrices
+   *   DS: function -- the algorithm to apply for a dense and a sparse matrix
+   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped
+   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar
+   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped
+   *   scalar: string -- typed-function type for scalars, defaults to 'any'
+   *
+   * If Ss is not specified, no matrix-scalar signatures are generated.
+   *
+   * @param {object} options
+   * @return {Object<string, function>} signatures
+   */
+  return function matrixAlgorithmSuite(options) {
+    const elop = options.elop;
+    const SD = options.SD || options.DS;
+    let matrixSignatures;
+    if (elop) {
+      // First the dense ones
+      matrixSignatures = {
+        'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...(0, _broadcast.broadcast)(x, y), elop),
+        'Array, Array': (x, y) => matAlgo13xDD(...(0, _broadcast.broadcast)(matrix(x), matrix(y)), elop).valueOf(),
+        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...(0, _broadcast.broadcast)(matrix(x), y), elop),
+        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...(0, _broadcast.broadcast)(x, matrix(y)), elop)
+      };
+      // Now incorporate sparse matrices
+      if (options.SS) {
+        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...(0, _broadcast.broadcast)(x, y), elop, false);
+      }
+      if (options.DS) {
+        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...(0, _broadcast.broadcast)(x, y), elop, false);
+        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...(0, _broadcast.broadcast)(matrix(x), y), elop, false);
+      }
+      if (SD) {
+        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...(0, _broadcast.broadcast)(y, x), elop, true);
+        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...(0, _broadcast.broadcast)(matrix(y), x), elop, true);
+      }
+    } else {
+      // No elop, use this
+      // First the dense ones
+      matrixSignatures = {
+        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...(0, _broadcast.broadcast)(x, y), self);
+        }),
+        'Array, Array': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...(0, _broadcast.broadcast)(matrix(x), matrix(y)), self).valueOf();
+        }),
+        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...(0, _broadcast.broadcast)(matrix(x), y), self);
+        }),
+        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...(0, _broadcast.broadcast)(x, matrix(y)), self);
+        })
+      };
+      // Now incorporate sparse matrices
+      if (options.SS) {
+        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.SS(...(0, _broadcast.broadcast)(x, y), self, false);
+        });
+      }
+      if (options.DS) {
+        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.DS(...(0, _broadcast.broadcast)(x, y), self, false);
+        });
+        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.DS(...(0, _broadcast.broadcast)(matrix(x), y), self, false);
+        });
+      }
+      if (SD) {
+        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return SD(...(0, _broadcast.broadcast)(y, x), self, true);
+        });
+        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {
+          return SD(...(0, _broadcast.broadcast)(matrix(y), x), self, true);
+        });
+      }
+    }
+
+    // Now add the scalars
+    const scalar = options.scalar || 'any';
+    const Ds = options.Ds || options.Ss;
+    if (Ds) {
+      if (elop) {
+        matrixSignatures['DenseMatrix,' + scalar] = (x, y) => matAlgo14xDs(x, y, elop, false);
+        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);
+        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();
+        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();
+      } else {
+        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(x, y, self, false);
+        });
+        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(y, x, self, true);
+        });
+        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(matrix(x), y, self, false).valueOf();
+        });
+        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+        });
+      }
+    }
+    const sS = options.sS !== undefined ? options.sS : options.Ss;
+    if (elop) {
+      if (options.Ss) {
+        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);
+      }
+      if (sS) {
+        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);
+      }
+    } else {
+      if (options.Ss) {
+        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return options.Ss(x, y, self, false);
+        });
+      }
+      if (sS) {
+        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return sS(y, x, self, true);
+        });
+      }
+    }
+    // Also pull in the scalar signatures if the operator is a typed function
+    if (elop && elop.signatures) {
+      (0, _object.extend)(matrixSignatures, elop.signatures);
+    }
+    return matrixSignatures;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/number.js b/node_modules/mathjs/lib/cjs/type/number.js
new file mode 100644
index 0000000..d50d677
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/number.js
@@ -0,0 +1,156 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createNumber = void 0;
+var _factory = require("../utils/factory.js");
+var _collection = require("../utils/collection.js");
+const name = 'number';
+const dependencies = ['typed'];
+
+/**
+ * Separates the radix, integer part, and fractional part of a non decimal number string
+ * @param {string} input string to parse
+ * @returns {object} the parts of the string or null if not a valid input
+ */
+function getNonDecimalNumberParts(input) {
+  const nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);
+  if (nonDecimalWithRadixMatch) {
+    const radix = {
+      '0b': 2,
+      '0o': 8,
+      '0x': 16
+    }[nonDecimalWithRadixMatch[1]];
+    const integerPart = nonDecimalWithRadixMatch[2];
+    const fractionalPart = nonDecimalWithRadixMatch[3];
+    return {
+      input,
+      radix,
+      integerPart,
+      fractionalPart
+    };
+  } else {
+    return null;
+  }
+}
+
+/**
+ * Makes a number from a radix, and integer part, and a fractional part
+ * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)
+ * @returns {number} the number
+ */
+function makeNumberFromNonDecimalParts(parts) {
+  const n = parseInt(parts.integerPart, parts.radix);
+  let f = 0;
+  for (let i = 0; i < parts.fractionalPart.length; i++) {
+    const digitValue = parseInt(parts.fractionalPart[i], parts.radix);
+    f += digitValue / Math.pow(parts.radix, i + 1);
+  }
+  const result = n + f;
+  if (isNaN(result)) {
+    throw new SyntaxError('String "' + parts.input + '" is not a valid number');
+  }
+  return result;
+}
+const createNumber = exports.createNumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   *
+   * Syntax:
+   *
+   *    math.number(value)
+   *    math.number(unit, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.number(2)                         // returns number 2
+   *    math.number('7.2')                     // returns number 7.2
+   *    math.number(true)                      // returns number 1
+   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]
+   *    math.number(math.unit('52cm'), 'm')    // returns 0.52
+   *
+   * See also:
+   *
+   *    bignumber, bigint, boolean, numeric, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted
+   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number
+   * @return {number | Array | Matrix} The created number
+   */
+  const number = typed('number', {
+    '': function () {
+      return 0;
+    },
+    number: function (x) {
+      return x;
+    },
+    string: function (x) {
+      if (x === 'NaN') return NaN;
+      const nonDecimalNumberParts = getNonDecimalNumberParts(x);
+      if (nonDecimalNumberParts) {
+        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);
+      }
+      let size = 0;
+      const wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+      if (wordSizeSuffixMatch) {
+        // x includes a size suffix like 0xffffi32, so we extract
+        // the suffix and remove it from x
+        size = Number(wordSizeSuffixMatch[2]);
+        x = wordSizeSuffixMatch[1];
+      }
+      let num = Number(x);
+      if (isNaN(num)) {
+        throw new SyntaxError('String "' + x + '" is not a valid number');
+      }
+      if (wordSizeSuffixMatch) {
+        // x is a signed bin, oct, or hex literal
+        // num is the value of string x if x is interpreted as unsigned
+        if (num > 2 ** size - 1) {
+          // literal is too large for size suffix
+          throw new SyntaxError(`String "${x}" is out of range`);
+        }
+        // check if the bit at index size - 1 is set and if so do the twos complement
+        if (num >= 2 ** (size - 1)) {
+          num = num - 2 ** size;
+        }
+      }
+      return num;
+    },
+    BigNumber: function (x) {
+      return x.toNumber();
+    },
+    bigint: function (x) {
+      return Number(x);
+    },
+    Fraction: function (x) {
+      return x.valueOf();
+    },
+    Unit: typed.referToSelf(self => x => {
+      const clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    null: function (x) {
+      return 0;
+    },
+    'Unit, string | Unit': function (unit, valuelessUnit) {
+      return unit.toNumber(valuelessUnit);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+
+  // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"number","value":"2.3"}
+  //
+  // into a number 2.3
+  number.fromJSON = function (json) {
+    return parseFloat(json.value);
+  };
+  return number;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js b/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js
new file mode 100644
index 0000000..ae837b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/resultset/ResultSet.js
@@ -0,0 +1,74 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createResultSet = void 0;
+var _factory = require("../../utils/factory.js");
+const name = 'ResultSet';
+const dependencies = [];
+const createResultSet = exports.createResultSet = /* #__PURE__ */(0, _factory.factory)(name, dependencies, () => {
+  /**
+   * A ResultSet contains a list or results
+   * @class ResultSet
+   * @param {Array} entries
+   * @constructor ResultSet
+   */
+  function ResultSet(entries) {
+    if (!(this instanceof ResultSet)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    this.entries = entries || [];
+  }
+
+  /**
+   * Attach type information
+   */
+  ResultSet.prototype.type = 'ResultSet';
+  ResultSet.prototype.isResultSet = true;
+
+  /**
+   * Returns the array with results hold by this ResultSet
+   * @memberof ResultSet
+   * @returns {Array} entries
+   */
+  ResultSet.prototype.valueOf = function () {
+    return this.entries;
+  };
+
+  /**
+   * Returns the stringified results of the ResultSet
+   * @memberof ResultSet
+   * @returns {string} string
+   */
+  ResultSet.prototype.toString = function () {
+    return '[' + this.entries.map(String).join(', ') + ']';
+  };
+
+  /**
+   * Get a JSON representation of the ResultSet
+   * @memberof ResultSet
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "ResultSet", "entries": [...]}`
+   */
+  ResultSet.prototype.toJSON = function () {
+    return {
+      mathjs: 'ResultSet',
+      entries: this.entries
+    };
+  };
+
+  /**
+   * Instantiate a ResultSet from a JSON object
+   * @memberof ResultSet
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "ResultSet", "entries": [...]}`
+   * @return {ResultSet}
+   */
+  ResultSet.fromJSON = function (json) {
+    return new ResultSet(json.entries);
+  };
+  return ResultSet;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/string.js b/node_modules/mathjs/lib/cjs/type/string.js
new file mode 100644
index 0000000..7bba07f
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/string.js
@@ -0,0 +1,60 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createString = void 0;
+var _factory = require("../utils/factory.js");
+var _collection = require("../utils/collection.js");
+var _number = require("../utils/number.js");
+const name = 'string';
+const dependencies = ['typed'];
+const createString = exports.createString = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Create a string or convert any object into a string.
+   * Elements of Arrays and Matrices are processed element wise.
+   *
+   * Syntax:
+   *
+   *    math.string(value)
+   *
+   * Examples:
+   *
+   *    math.string(4.2)                // returns string '4.2'
+   *    math.string(math.complex(3, 2)) // returns string '3 + 2i'
+   *
+   *    const u = math.unit(5, 'km')
+   *    math.string(u.to('m'))          // returns string '5000 m'
+   *
+   *    math.string([true, false])      // returns ['true', 'false']
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, unit
+   *
+   * @param {* | Array | Matrix | null} [value]  A value to convert to a string
+   * @return {string | Array | Matrix} The created string
+   */
+  return typed(name, {
+    '': function () {
+      return '';
+    },
+    number: _number.format,
+    null: function (x) {
+      return 'null';
+    },
+    boolean: function (x) {
+      return x + '';
+    },
+    string: function (x) {
+      return x;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self)),
+    any: function (x) {
+      return String(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/Unit.js b/node_modules/mathjs/lib/cjs/type/unit/Unit.js
new file mode 100644
index 0000000..13f613b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/Unit.js
@@ -0,0 +1,3990 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitClass = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _is = require("../../utils/is.js");
+var _factory = require("../../utils/factory.js");
+var _function = require("../../utils/function.js");
+var _string = require("../../utils/string.js");
+var _object = require("../../utils/object.js");
+var _constants = require("../../utils/bignumber/constants.js");
+const name = 'Unit';
+const dependencies = ['?on', 'config', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'toBest', 'number', 'Complex', 'BigNumber', 'Fraction'];
+const createUnitClass = exports.createUnitClass = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    on,
+    config,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    abs,
+    fix,
+    round,
+    equal,
+    isNumeric,
+    format,
+    toBest,
+    number,
+    Complex,
+    BigNumber,
+    Fraction
+  } = _ref;
+  const toNumber = number;
+  /**
+   * A unit can be constructed in the following ways:
+   *
+   *     const a = new Unit(value, valuelessUnit)
+   *     const b = new Unit(null, valuelessUnit)
+   *     const c = Unit.parse(str)
+   *
+   * Example usage:
+   *
+   *     const a = new Unit(5, 'cm')               // 50 mm
+   *     const b = Unit.parse('23 kg')             // 23 kg
+   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m
+   *     const d = new Unit(9.81, "m/s^2")         // 9.81 m/s^2
+   *
+   * @class Unit
+   * @constructor Unit
+   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   */
+  function Unit(value, valuelessUnit) {
+    if (!(this instanceof Unit)) {
+      throw new Error('Constructor must be called with the new operator');
+    }
+    if (!(value === null || value === undefined || isNumeric(value) || (0, _is.isComplex)(value))) {
+      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');
+    }
+    this.fixPrefix = false; // if true, function format will not search for the
+    // best prefix but leave it as initially provided.
+    // fixPrefix is set true by the method Unit.to
+
+    // The justification behind this is that if the constructor is explicitly called,
+    // the caller wishes the units to be returned exactly as supplied.
+    this.skipAutomaticSimplification = true;
+    if (valuelessUnit === undefined) {
+      this.units = [];
+      this.dimensions = BASE_DIMENSIONS.map(x => 0);
+    } else if (typeof valuelessUnit === 'string') {
+      const u = Unit.parse(valuelessUnit);
+      this.units = u.units;
+      this.dimensions = u.dimensions;
+    } else if ((0, _is.isUnit)(valuelessUnit) && valuelessUnit.value === null) {
+      // clone from valuelessUnit
+      this.fixPrefix = valuelessUnit.fixPrefix;
+      this.skipAutomaticSimplification = valuelessUnit.skipAutomaticSimplification;
+      this.dimensions = valuelessUnit.dimensions.slice(0);
+      this.units = valuelessUnit.units.map(u => (0, _extends2.default)({}, u));
+    } else {
+      throw new TypeError('Second parameter in Unit constructor must be a string or valueless Unit');
+    }
+    this.value = this._normalize(value);
+  }
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(Unit, 'name', {
+    value: 'Unit'
+  });
+  Unit.prototype.constructor = Unit;
+  Unit.prototype.type = 'Unit';
+  Unit.prototype.isUnit = true;
+
+  // private variables and functions for the Unit parser
+  let text, index, c;
+  function skipWhitespace() {
+    while (c === ' ' || c === '\t') {
+      next();
+    }
+  }
+  function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  }
+  function isDigit(c) {
+    return c >= '0' && c <= '9';
+  }
+  function next() {
+    index++;
+    c = text.charAt(index);
+  }
+  function revert(oldIndex) {
+    index = oldIndex;
+    c = text.charAt(index);
+  }
+  function parseNumber() {
+    let number = '';
+    const oldIndex = index;
+    if (c === '+') {
+      next();
+    } else if (c === '-') {
+      number += c;
+      next();
+    }
+    if (!isDigitDot(c)) {
+      // a + or - must be followed by a digit
+      revert(oldIndex);
+      return null;
+    }
+
+    // get number, can have a single dot
+    if (c === '.') {
+      number += c;
+      next();
+      if (!isDigit(c)) {
+        // this is no legal number, it is just a dot
+        revert(oldIndex);
+        return null;
+      }
+    } else {
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+      if (c === '.') {
+        number += c;
+        next();
+      }
+    }
+    while (isDigit(c)) {
+      number += c;
+      next();
+    }
+
+    // check for exponential notation like "2.3e-4" or "1.23e50"
+    if (c === 'E' || c === 'e') {
+      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as "4exabytes"
+
+      let tentativeNumber = '';
+      const tentativeIndex = index;
+      tentativeNumber += c;
+      next();
+      if (c === '+' || c === '-') {
+        tentativeNumber += c;
+        next();
+      }
+
+      // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)
+      if (!isDigit(c)) {
+        // The e or E must belong to something else, so return the number without the e or E.
+        revert(tentativeIndex);
+        return number;
+      }
+
+      // We can now safely say that this is scientific notation.
+      number = number + tentativeNumber;
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+    }
+    return number;
+  }
+  function parseUnit() {
+    let unitName = '';
+
+    // Alphanumeric characters only; matches [a-zA-Z0-9]
+    while (isDigit(c) || Unit.isValidAlpha(c)) {
+      unitName += c;
+      next();
+    }
+
+    // Must begin with [a-zA-Z]
+    const firstC = unitName.charAt(0);
+    if (Unit.isValidAlpha(firstC)) {
+      return unitName;
+    } else {
+      return null;
+    }
+  }
+  function parseCharacter(toFind) {
+    if (c === toFind) {
+      next();
+      return toFind;
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Parse a string into a unit. The value of the unit is parsed as number,
+   * BigNumber, or Fraction depending on the math.js config setting `number`.
+   *
+   * Throws an exception if the provided string does not contain a valid unit or
+   * cannot be parsed.
+   * @memberof Unit
+   * @param {string} str        A string like "5.2 inch", "4e2 cm/s^2"
+   * @return {Unit} unit
+   */
+  Unit.parse = function (str, options) {
+    options = options || {};
+    text = str;
+    index = -1;
+    c = '';
+    if (typeof text !== 'string') {
+      throw new TypeError('Invalid argument in Unit.parse, string expected');
+    }
+    const unit = new Unit();
+    unit.units = [];
+    let powerMultiplierCurrent = 1;
+    let expectingUnit = false;
+
+    // A unit should follow this pattern:
+    // [number] ...[ [*/] unit[^number] ]
+    // unit[^number] ... [ [*/] unit[^number] ]
+
+    // Rules:
+    // number is any floating point number.
+    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!
+    // The string may optionally begin with a number.
+    // Each unit may optionally be followed by ^number.
+    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:
+    //   2m^2kg/s^2
+    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:
+    //   4erg
+
+    next();
+    skipWhitespace();
+
+    // Optional number at the start of the string
+    const valueStr = parseNumber();
+    let value = null;
+    if (valueStr) {
+      if (config.number === 'BigNumber') {
+        value = new BigNumber(valueStr);
+      } else if (config.number === 'Fraction') {
+        try {
+          // not all numbers can be turned in Fractions, for example very small numbers not
+          value = new Fraction(valueStr);
+        } catch (err) {
+          value = parseFloat(valueStr);
+        }
+      } else {
+        // number
+        value = parseFloat(valueStr);
+      }
+      skipWhitespace(); // Whitespace is not required here
+
+      // handle multiplication or division right after the value, like '1/s'
+      if (parseCharacter('*')) {
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      }
+    }
+
+    // Stack to keep track of powerMultipliers applied to each parentheses group
+    const powerMultiplierStack = [];
+
+    // Running product of all elements in powerMultiplierStack
+    let powerMultiplierStackProduct = 1;
+    while (true) {
+      skipWhitespace();
+
+      // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack
+      // A '(' will always appear directly before a unit.
+      while (c === '(') {
+        powerMultiplierStack.push(powerMultiplierCurrent);
+        powerMultiplierStackProduct *= powerMultiplierCurrent;
+        powerMultiplierCurrent = 1;
+        next();
+        skipWhitespace();
+      }
+
+      // Is there something here?
+      let uStr;
+      if (c) {
+        const oldC = c;
+        uStr = parseUnit();
+        if (uStr === null) {
+          throw new SyntaxError('Unexpected "' + oldC + '" in "' + text + '" at index ' + index.toString());
+        }
+      } else {
+        // End of input.
+        break;
+      }
+
+      // Verify the unit exists and get the prefix (if any)
+      const res = _findUnit(uStr);
+      if (res === null) {
+        // Unit not found.
+        throw new SyntaxError('Unit "' + uStr + '" not found.');
+      }
+      let power = powerMultiplierCurrent * powerMultiplierStackProduct;
+      // Is there a "^ number"?
+      skipWhitespace();
+      if (parseCharacter('^')) {
+        skipWhitespace();
+        const p = parseNumber();
+        if (p === null) {
+          // No valid number found for the power!
+          throw new SyntaxError('In "' + str + '", "^" must be followed by a floating-point number');
+        }
+        power *= p;
+      }
+
+      // Add the unit to the list
+      unit.units.push({
+        unit: res.unit,
+        prefix: res.prefix,
+        power
+      });
+      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;
+      }
+
+      // Check for and consume closing parentheses, popping from the stack.
+      // A ')' will always follow a unit.
+      skipWhitespace();
+      while (c === ')') {
+        if (powerMultiplierStack.length === 0) {
+          throw new SyntaxError('Unmatched ")" in "' + text + '" at index ' + index.toString());
+        }
+        powerMultiplierStackProduct /= powerMultiplierStack.pop();
+        next();
+        skipWhitespace();
+      }
+
+      // "*" and "/" should mean we are expecting something to come next.
+      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.
+      expectingUnit = false;
+      if (parseCharacter('*')) {
+        // explicit multiplication
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        // division
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      } else {
+        // implicit multiplication
+        powerMultiplierCurrent = 1;
+      }
+
+      // Replace the unit into the auto unit system
+      if (res.unit.base) {
+        const baseDim = res.unit.base.key;
+        UNIT_SYSTEMS.auto[baseDim] = {
+          unit: res.unit,
+          prefix: res.prefix
+        };
+      }
+    }
+
+    // Has the string been entirely consumed?
+    skipWhitespace();
+    if (c) {
+      throw new SyntaxError('Could not parse: "' + str + '"');
+    }
+
+    // Is there a trailing slash?
+    if (expectingUnit) {
+      throw new SyntaxError('Trailing characters: "' + str + '"');
+    }
+
+    // Is the parentheses stack empty?
+    if (powerMultiplierStack.length !== 0) {
+      throw new SyntaxError('Unmatched "(" in "' + text + '"');
+    }
+
+    // Are there any units at all?
+    if (unit.units.length === 0 && !options.allowNoUnits) {
+      throw new SyntaxError('"' + str + '" contains no units');
+    }
+    unit.value = value !== undefined ? unit._normalize(value) : null;
+    return unit;
+  };
+
+  /**
+   * create a copy of this unit
+   * @memberof Unit
+   * @return {Unit} Returns a cloned version of the unit
+   */
+  Unit.prototype.clone = function () {
+    const unit = new Unit();
+    unit.fixPrefix = this.fixPrefix;
+    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;
+    unit.value = (0, _object.clone)(this.value);
+    unit.dimensions = this.dimensions.slice(0);
+    unit.units = [];
+    for (let i = 0; i < this.units.length; i++) {
+      unit.units[i] = {};
+      for (const p in this.units[i]) {
+        if ((0, _object.hasOwnProperty)(this.units[i], p)) {
+          unit.units[i][p] = this.units[i][p];
+        }
+      }
+    }
+    return unit;
+  };
+
+  /**
+   * Return the type of the value of this unit
+   *
+   * @memberof Unit
+   * @return {string} type of the value of the unit
+   */
+  Unit.prototype.valueType = function () {
+    return (0, _is.typeOf)(this.value);
+  };
+
+  /**
+   * Return whether the unit is derived (such as m/s, or cm^2, but not N)
+   * @memberof Unit
+   * @return {boolean} True if the unit is derived
+   * @private
+   */
+  Unit.prototype._isDerived = function () {
+    if (this.units.length === 0) {
+      return false;
+    }
+    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;
+  };
+
+  /**
+   * Normalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number | BigNumber | Fraction | boolean} value
+   * @return {number | BigNumber | Fraction | boolean} normalized value
+   * @private
+   */
+  Unit.prototype._normalize = function (value) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+    let res = value;
+    const convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+    for (let i = 0; i < this.units.length; i++) {
+      const unitValue = convert(this.units[i].unit.value);
+      const unitPrefixValue = convert(this.units[i].prefix.value);
+      const unitPower = convert(this.units[i].power);
+      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+    return res;
+  };
+
+  /**
+   * Denormalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number} value
+   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)
+   * @return {number} denormalized value
+   * @private
+   */
+  Unit.prototype._denormalize = function (value, prefixValue) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+    let res = value;
+    const convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+    for (let i = 0; i < this.units.length; i++) {
+      const unitValue = convert(this.units[i].unit.value);
+      const unitPrefixValue = convert(this.units[i].prefix.value);
+      const unitPower = convert(this.units[i].power);
+      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+    return res;
+  };
+
+  /**
+   * Find a unit from a string
+   * @memberof Unit
+   * @param {string} str              A string like 'cm' or 'inch'
+   * @returns {Object | null} result  When found, an object with fields unit and
+   *                                  prefix is returned. Else, null is returned.
+   * @private
+   */
+  const _findUnit = (0, _function.memoize)(str => {
+    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.
+    if ((0, _object.hasOwnProperty)(UNITS, str)) {
+      const unit = UNITS[str];
+      const prefix = unit.prefixes[''];
+      return {
+        unit,
+        prefix
+      };
+    }
+    for (const name in UNITS) {
+      if ((0, _object.hasOwnProperty)(UNITS, name)) {
+        if ((0, _string.endsWith)(str, name)) {
+          const unit = UNITS[name];
+          const prefixLen = str.length - name.length;
+          const prefixName = str.substring(0, prefixLen);
+          const prefix = (0, _object.hasOwnProperty)(unit.prefixes, prefixName) ? unit.prefixes[prefixName] : undefined;
+          if (prefix !== undefined) {
+            // store unit, prefix, and value
+            return {
+              unit,
+              prefix
+            };
+          }
+        }
+      }
+    }
+    return null;
+  }, {
+    hasher: args => args[0],
+    limit: 100
+  });
+
+  /**
+   * Test if the given expression is a unit.
+   * The unit can have a prefix but cannot have a value.
+   * @memberof Unit
+   * @param {string} name   A string to be tested whether it is a value less unit.
+   *                        The unit can have prefix, like "cm"
+   * @return {boolean}      true if the given string is a unit
+   */
+  Unit.isValuelessUnit = function (name) {
+    return _findUnit(name) !== null;
+  };
+
+  /**
+   * check if this unit has given base unit
+   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
+   * @memberof Unit
+   * @param {BASE_UNIT | string | undefined} base
+   */
+  Unit.prototype.hasBase = function (base) {
+    if (typeof base === 'string') {
+      base = BASE_UNITS[base];
+    }
+    if (!base) {
+      return false;
+    }
+
+    // All dimensions must be the same
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+    return true;
+  };
+
+  /**
+   * Check if this unit has a base or bases equal to another base or bases
+   * For derived units, the exponent on each base also must match
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if equal base
+   */
+  Unit.prototype.equalBase = function (other) {
+    // All dimensions must be the same
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+    return true;
+  };
+
+  /**
+   * Check if this unit equals another unit
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if both units are equal
+   */
+  Unit.prototype.equals = function (other) {
+    return this.equalBase(other) && equal(this.value, other.value);
+  };
+
+  /**
+   * Multiply this unit with another one or with a scalar
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} product of this unit and the other unit
+   */
+  Unit.prototype.multiply = function (_other) {
+    const res = this.clone();
+    const other = (0, _is.isUnit)(_other) ? _other : new Unit(_other);
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);
+    }
+
+    // Append other's units list onto res
+    for (let i = 0; i < other.units.length; i++) {
+      // Make a shallow copy of every unit
+      const inverted = {
+        ...other.units[i]
+      };
+      res.units.push(inverted);
+    }
+
+    // If at least one operand has a value, then the result should also have a value
+    if (this.value !== null || other.value !== null) {
+      const valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      const valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
+      res.value = multiplyScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+    if ((0, _is.isUnit)(_other)) {
+      res.skipAutomaticSimplification = false;
+    }
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Divide a number by this unit
+   *
+   * @memberof Unit
+   * @param {numeric} numerator
+   * @param {unit} result of dividing numerator by this unit
+   */
+  Unit.prototype.divideInto = function (numerator) {
+    return new Unit(numerator).divide(this);
+  };
+
+  /**
+   * Divide this unit by another one
+   * @memberof Unit
+   * @param {Unit | numeric} other
+   * @return {Unit} result of dividing this unit by the other unit
+   */
+  Unit.prototype.divide = function (_other) {
+    const res = this.clone();
+    const other = (0, _is.isUnit)(_other) ? _other : new Unit(_other);
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);
+    }
+
+    // Invert and append other's units list onto res
+    for (let i = 0; i < other.units.length; i++) {
+      // Make a shallow copy of every unit
+      const inverted = {
+        ...other.units[i],
+        power: -other.units[i].power
+      };
+      res.units.push(inverted);
+    }
+
+    // If at least one operand has a value, the result should have a value
+    if (this.value !== null || other.value !== null) {
+      const valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      const valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
+      res.value = divideScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+    if ((0, _is.isUnit)(_other)) {
+      res.skipAutomaticSimplification = false;
+    }
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Calculate the power of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} p
+   * @returns {Unit}      The result: this^p
+   */
+  Unit.prototype.pow = function (p) {
+    const res = this.clone();
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) * p;
+    }
+
+    // Adjust the power of each unit in the list
+    for (let i = 0; i < res.units.length; i++) {
+      res.units[i].power *= p;
+    }
+    if (res.value !== null) {
+      res.value = pow(res.value, p);
+
+      // only allow numeric output, we don't want to return a Complex number
+      // if (!isNumeric(res.value)) {
+      //  res.value = NaN
+      // }
+      // Update: Complex supported now
+    } else {
+      res.value = null;
+    }
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise
+   * @param {Unit} unit
+   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise
+   */
+  function getNumericIfUnitless(unit) {
+    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {
+      return unit.value;
+    } else {
+      return unit;
+    }
+  }
+
+  /**
+   * Create a value one with the numeric type of `typeOfValue`.
+   * For example, `one(new BigNumber(3))` returns `BigNumber(1)`
+   * @param {number | Fraction | BigNumber} typeOfValue
+   * @returns {number | Fraction | BigNumber}
+   */
+  function one(typeOfValue) {
+    // TODO: this is a workaround to prevent the following BigNumber conversion error from throwing:
+    //  "TypeError: Cannot implicitly convert a number with >15 significant digits to BigNumber"
+    //  see https://github.com/josdejong/mathjs/issues/3450
+    //      https://github.com/josdejong/mathjs/pull/3375
+    const convert = Unit._getNumberConverter((0, _is.typeOf)(typeOfValue));
+    return convert(1);
+  }
+
+  /**
+   * Calculate the absolute value of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} x
+   * @returns {Unit}      The result: |x|, absolute value of x
+   */
+  Unit.prototype.abs = function () {
+    const ret = this.clone();
+    if (ret.value !== null) {
+      if (ret._isDerived() || ret.units.length === 0 || ret.units[0].unit.offset === 0) {
+        ret.value = abs(ret.value);
+      } else {
+        // To give the correct, but unexpected, results for units with an offset.
+        // For example, abs(-283.15 degC) = -263.15 degC !!!
+        // We must take the offset into consideration here
+        const convert = ret._numberConverter(); // convert to Fraction or BigNumber if needed
+        const unitValue = convert(ret.units[0].unit.value);
+        const nominalOffset = convert(ret.units[0].unit.offset);
+        const unitOffset = multiplyScalar(unitValue, nominalOffset);
+        ret.value = subtractScalar(abs(addScalar(ret.value, unitOffset)), unitOffset);
+      }
+    }
+    for (const i in ret.units) {
+      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {
+        ret.units[i].unit = UNITS.W;
+      }
+    }
+    return ret;
+  };
+
+  /**
+   * Convert the unit to a specific unit name.
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.
+   */
+  Unit.prototype.to = function (valuelessUnit) {
+    const value = this.value === null ? this._normalize(1) : this.value;
+    let other;
+    if (typeof valuelessUnit === 'string') {
+      other = Unit.parse(valuelessUnit);
+    } else if ((0, _is.isUnit)(valuelessUnit)) {
+      other = valuelessUnit.clone();
+    } else {
+      throw new Error('String or Unit expected as parameter');
+    }
+    if (!this.equalBase(other)) {
+      throw new Error(`Units do not match ('${other.toString()}' != '${this.toString()}')`);
+    }
+    if (other.value !== null) {
+      throw new Error('Cannot convert to a unit with a value');
+    }
+    if (this.value === null || this._isDerived() || this.units.length === 0 || other.units.length === 0 || this.units[0].unit.offset === other.units[0].unit.offset) {
+      other.value = (0, _object.clone)(value);
+    } else {
+      /* Need to adjust value by difference in offset to convert */
+      const convert = Unit._getNumberConverter((0, _is.typeOf)(value)); // convert to Fraction or BigNumber if needed
+
+      const thisUnitValue = this.units[0].unit.value;
+      const thisNominalOffset = this.units[0].unit.offset;
+      const thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);
+      const otherUnitValue = other.units[0].unit.value;
+      const otherNominalOffset = other.units[0].unit.offset;
+      const otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);
+      other.value = addScalar(value, convert(subtractScalar(thisUnitOffset, otherUnitOffset)));
+    }
+    other.fixPrefix = true;
+    other.skipAutomaticSimplification = true;
+    return other;
+  };
+
+  /**
+   * Return the value of the unit when represented with given valueless unit
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number} Returns the unit value as number.
+   */
+  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric
+  Unit.prototype.toNumber = function (valuelessUnit) {
+    return toNumber(this.toNumeric(valuelessUnit));
+  };
+
+  /**
+   * Return the value of the unit in the original numeric type
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number | BigNumber | Fraction} Returns the unit value
+   */
+  Unit.prototype.toNumeric = function (valuelessUnit) {
+    let other;
+    if (valuelessUnit) {
+      // Allow getting the numeric value without converting to a different unit
+      other = this.to(valuelessUnit);
+    } else {
+      other = this.clone();
+    }
+    if (other._isDerived() || other.units.length === 0) {
+      return other._denormalize(other.value);
+    } else {
+      return other._denormalize(other.value, other.units[0].prefix.value);
+    }
+  };
+
+  /**
+   * Get a string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.toString = function () {
+    return this.format();
+  };
+
+  /**
+   * Get a JSON representation of the unit
+   * @memberof Unit
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   */
+  Unit.prototype.toJSON = function () {
+    return {
+      mathjs: 'Unit',
+      value: this._denormalize(this.value),
+      unit: this.units.length > 0 ? this.formatUnits() : null,
+      fixPrefix: this.fixPrefix
+    };
+  };
+
+  /**
+   * Instantiate a Unit from a JSON object
+   * @memberof Unit
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   * @return {Unit}
+   */
+  Unit.fromJSON = function (json) {
+    var _json$unit;
+    const unit = new Unit(json.value, (_json$unit = json.unit) !== null && _json$unit !== void 0 ? _json$unit : undefined);
+    unit.fixPrefix = json.fixPrefix || false;
+    return unit;
+  };
+
+  /**
+   * Returns the string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.valueOf = Unit.prototype.toString;
+
+  /**
+   * Simplify this Unit's unit list and return a new Unit with the simplified list.
+   * The returned Unit will contain a list of the "best" units for formatting.
+   */
+  Unit.prototype.simplify = function () {
+    const ret = this.clone();
+    const proposedUnitList = [];
+
+    // Search for a matching base
+    let matchingBase;
+    for (const key in currentUnitSystem) {
+      if ((0, _object.hasOwnProperty)(currentUnitSystem, key)) {
+        if (ret.hasBase(BASE_UNITS[key])) {
+          matchingBase = key;
+          break;
+        }
+      }
+    }
+    if (matchingBase === 'NONE') {
+      ret.units = [];
+    } else {
+      let matchingUnit;
+      if (matchingBase) {
+        // Does the unit system have a matching unit?
+        if ((0, _object.hasOwnProperty)(currentUnitSystem, matchingBase)) {
+          matchingUnit = currentUnitSystem[matchingBase];
+        }
+      }
+      if (matchingUnit) {
+        ret.units = [{
+          unit: matchingUnit.unit,
+          prefix: matchingUnit.prefix,
+          power: 1.0
+        }];
+      } else {
+        // Multiple units or units with powers are formatted like this:
+        // 5 (kg m^2) / (s^3 mol)
+        // Build an representation from the base units of the current unit system
+        let missingBaseDim = false;
+        for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+          const baseDim = BASE_DIMENSIONS[i];
+          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+            if ((0, _object.hasOwnProperty)(currentUnitSystem, baseDim)) {
+              proposedUnitList.push({
+                unit: currentUnitSystem[baseDim].unit,
+                prefix: currentUnitSystem[baseDim].prefix,
+                power: ret.dimensions[i] || 0
+              });
+            } else {
+              missingBaseDim = true;
+            }
+          }
+        }
+
+        // Is the proposed unit list "simpler" than the existing one?
+        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {
+          // Replace this unit list with the proposed list
+          ret.units = proposedUnitList;
+        }
+      }
+    }
+    return ret;
+  };
+
+  /**
+   * Returns a new Unit in the SI system with the same value as this one
+   */
+  Unit.prototype.toSI = function () {
+    const ret = this.clone();
+    const proposedUnitList = [];
+
+    // Multiple units or units with powers are formatted like this:
+    // 5 (kg m^2) / (s^3 mol)
+    // Build an representation from the base units of the SI unit system
+    for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+      const baseDim = BASE_DIMENSIONS[i];
+      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+        if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS.si, baseDim)) {
+          proposedUnitList.push({
+            unit: UNIT_SYSTEMS.si[baseDim].unit,
+            prefix: UNIT_SYSTEMS.si[baseDim].prefix,
+            power: ret.dimensions[i] || 0
+          });
+        } else {
+          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');
+        }
+      }
+    }
+
+    // Replace this unit list with the proposed list
+    ret.units = proposedUnitList;
+    ret.fixPrefix = true;
+    ret.skipAutomaticSimplification = true;
+    if (this.value !== null) {
+      ret.value = null;
+      return this.to(ret);
+    }
+    return ret;
+  };
+
+  /**
+   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.formatUnits = function () {
+    let strNum = '';
+    let strDen = '';
+    let nNum = 0;
+    let nDen = 0;
+    for (let i = 0; i < this.units.length; i++) {
+      if (this.units[i].power > 0) {
+        nNum++;
+        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {
+          strNum += '^' + this.units[i].power;
+        }
+      } else if (this.units[i].power < 0) {
+        nDen++;
+      }
+    }
+    if (nDen > 0) {
+      for (let i = 0; i < this.units.length; i++) {
+        if (this.units[i].power < 0) {
+          if (nNum > 0) {
+            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+            if (Math.abs(this.units[i].power + 1.0) > 1e-15) {
+              strDen += '^' + -this.units[i].power;
+            }
+          } else {
+            strDen += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+            strDen += '^' + this.units[i].power;
+          }
+        }
+      }
+    }
+    // Remove leading " "
+    strNum = strNum.substr(1);
+    strDen = strDen.substr(1);
+
+    // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting
+    if (nNum > 1 && nDen > 0) {
+      strNum = '(' + strNum + ')';
+    }
+    if (nDen > 1 && nNum > 0) {
+      strDen = '(' + strDen + ')';
+    }
+    let str = strNum;
+    if (nNum > 0 && nDen > 0) {
+      str += ' / ';
+    }
+    str += strDen;
+    return str;
+  };
+
+  /**
+   * Get a unit, with optional formatting options.
+   * @memberof Unit
+   * @param {string[] | Unit[]} [units]  Array of units strings or valueLess Unit objects in wich choose the best one
+   * @param {Object} [options]  Options for parsing the unit. See parseUnit for details.
+   *
+   * @return {Unit} Returns a new Unit with the given value and unit.
+   */
+  Unit.prototype.toBest = function () {
+    let unitList = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
+    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    if (unitList && !Array.isArray(unitList)) {
+      throw new Error('Invalid unit type. Expected string or Unit.');
+    }
+    const startPrefixes = this.units[0].unit.prefixes;
+    if (unitList && unitList.length > 0) {
+      const unitObjects = unitList.map(u => {
+        let unit = null;
+        if (typeof u === 'string') {
+          unit = Unit.parse(u);
+          if (!unit) {
+            throw new Error('Invalid unit type. Expected compatible string or Unit.');
+          }
+        } else if (!(0, _is.isUnit)(u)) {
+          throw new Error('Invalid unit type. Expected compatible string or Unit.');
+        }
+        if (unit === null) {
+          unit = u.clone();
+        }
+        try {
+          this.to(unit.formatUnits());
+          return unit;
+        } catch (e) {
+          throw new Error('Invalid unit type. Expected compatible string or Unit.');
+        }
+      });
+      const prefixes = unitObjects.map(el => el.units[0].prefix);
+      this.units[0].unit.prefixes = prefixes.reduce((acc, prefix) => {
+        acc[prefix.name] = prefix;
+        return acc;
+      }, {});
+      this.units[0].prefix = prefixes[0];
+    }
+    const result = formatBest(this, options).simp;
+    this.units[0].unit.prefixes = startPrefixes;
+    result.fixPrefix = true;
+    return result;
+  };
+  /**
+   * Get a string representation of the Unit, with optional formatting options.
+   * @memberof Unit
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string}
+   */
+  Unit.prototype.format = function (options) {
+    const {
+      simp,
+      valueStr,
+      unitStr
+    } = formatBest(this, options);
+    let str = valueStr;
+    if (simp.value && (0, _is.isComplex)(simp.value)) {
+      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing
+    }
+    if (unitStr.length > 0 && str.length > 0) {
+      str += ' ';
+    }
+    str += unitStr;
+    return str;
+  };
+
+  /**
+  * Helper function to normalize a unit for conversion and formatting
+  * @param {Unit} unit The unit to be normalized
+  * @return {Object} Object with normalized unit and value
+  * @private
+  */
+  function formatBest(unit) {
+    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    // Simplfy the unit list, unless it is valueless or was created directly in the
+    // constructor or as the result of to or toSI
+    const simp = unit.skipAutomaticSimplification || unit.value === null ? unit.clone() : unit.simplify();
+
+    // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.
+    handleVAandVARUnits(simp);
+    // Now apply the best prefix
+    // Units must have only one unit and not have the fixPrefix flag set
+    applyBestPrefixIfNeeded(simp, options.offset);
+    const value = simp._denormalize(simp.value);
+    const valueStr = simp.value !== null ? format(value, options || {}) : '';
+    const unitStr = simp.formatUnits();
+    return {
+      simp,
+      valueStr,
+      unitStr
+    };
+  }
+
+  /**
+   * Helper to handle VA and VAR units
+   * @param {Unit} simp The unit to be normalized
+   */
+  function handleVAandVARUnits(simp) {
+    let isImaginary = false;
+    if (typeof simp.value !== 'undefined' && simp.value !== null && (0, _is.isComplex)(simp.value)) {
+      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute
+      isImaginary = Math.abs(simp.value.re) < 1e-14;
+    }
+    for (const i in simp.units) {
+      if ((0, _object.hasOwnProperty)(simp.units, i)) {
+        if (simp.units[i].unit) {
+          if (simp.units[i].unit.name === 'VA' && isImaginary) {
+            simp.units[i].unit = UNITS.VAR;
+          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {
+            simp.units[i].unit = UNITS.VA;
+          }
+        }
+      }
+    }
+  }
+
+  /**
+   * Helper to apply the best prefix if needed
+   * @param {Unit} simp The unit to be normalized
+   */
+  function applyBestPrefixIfNeeded(simp, offset) {
+    if (simp.units.length === 1 && !simp.fixPrefix) {
+      // Units must have integer powers, otherwise the prefix will change the
+      // outputted value by not-an-integer-power-of-ten
+      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {
+        // Apply the best prefix
+        simp.units[0].prefix = simp._bestPrefix(offset);
+      }
+    }
+  }
+
+  /**
+   * Calculate the best prefix using current value.
+   * @memberof Unit
+   * @returns {Object} prefix
+   * @param {number} [offset]  Optional offset for the best prefix calculation (default 1.2)
+   * @private
+   */
+  Unit.prototype._bestPrefix = function () {
+    let offset = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 1.2;
+    if (this.units.length !== 1) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+
+    // find the best prefix value (resulting in the value of which
+    // the absolute value of the log10 is closest to zero,
+    // though with a little offset of 1.2 for nicer values: you get a
+    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...
+
+    // Note: the units value can be any numeric type, but to find the best
+    // prefix it's enough to work with limited precision of a regular number
+    // Update: using mathjs abs since we also allow complex numbers
+    const absValue = this.value !== null ? abs(this.value) : 0;
+    const absUnitValue = abs(this.units[0].unit.value);
+    let bestPrefix = this.units[0].prefix;
+    if (absValue === 0) {
+      return bestPrefix;
+    }
+    const power = this.units[0].power;
+    let bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - offset;
+    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix
+    bestDiff = Math.abs(bestDiff);
+    const prefixes = this.units[0].unit.prefixes;
+    for (const p in prefixes) {
+      if ((0, _object.hasOwnProperty)(prefixes, p)) {
+        const prefix = prefixes[p];
+        if (prefix.scientific) {
+          const diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - offset);
+          if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {
+            // choose the prefix with the smallest diff, or if equal, choose the one
+            // with the shortest name (can happen with SHORTLONG for example)
+            bestPrefix = prefix;
+            bestDiff = diff;
+          }
+        }
+      }
+    }
+    return bestPrefix;
+  };
+
+  /**
+   * Returns an array of units whose sum is equal to this unit
+   * @memberof Unit
+   * @param {Array} [parts] An array of strings or valueless units.
+   *
+   *   Example:
+   *
+   *   const u = new Unit(1, 'm')
+   *   u.splitUnit(['feet', 'inch'])
+   *     [ 3 feet, 3.3700787401575 inch ]
+   *
+   * @return {Array} An array of units.
+   */
+  Unit.prototype.splitUnit = function (parts) {
+    let x = this.clone();
+    const ret = [];
+    for (let i = 0; i < parts.length; i++) {
+      // Convert x to the requested unit
+      x = x.to(parts[i]);
+      if (i === parts.length - 1) break;
+
+      // Get the numeric value of this unit
+      const xNumeric = x.toNumeric();
+
+      // Check to see if xNumeric is nearly equal to an integer,
+      // since fix can incorrectly round down if there is round-off error
+      const xRounded = round(xNumeric);
+      let xFixed;
+      const isNearlyEqual = equal(xRounded, xNumeric);
+      if (isNearlyEqual) {
+        xFixed = xRounded;
+      } else {
+        xFixed = fix(x.toNumeric());
+      }
+      const y = new Unit(xFixed, parts[i].toString());
+      ret.push(y);
+      x = subtractScalar(x, y);
+    }
+
+    // This little bit fixes a bug where the remainder should be 0 but is a little bit off.
+    // But instead of comparing x, the remainder, with zero--we will compare the sum of
+    // all the parts so far with the original value. If they are nearly equal,
+    // we set the remainder to 0.
+    let testSum = 0;
+    for (let i = 0; i < ret.length; i++) {
+      testSum = addScalar(testSum, ret[i].value);
+    }
+    if (equal(testSum, this.value)) {
+      x.value = 0;
+    }
+    ret.push(x);
+    return ret;
+  };
+  const PREFIXES = {
+    NONE: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      }
+    },
+    SHORT: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e1,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e2,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e27,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e30,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-1,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-2,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-3,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-6,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-9,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-12,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-15,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-18,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-21,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-24,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-27,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-30,
+        scientific: true
+      }
+    },
+    LONG: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      deca: {
+        name: 'deca',
+        value: 1e1,
+        scientific: false
+      },
+      hecto: {
+        name: 'hecto',
+        value: 1e2,
+        scientific: false
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      },
+      ronna: {
+        name: 'ronna',
+        value: 1e27,
+        scientific: true
+      },
+      quetta: {
+        name: 'quetta',
+        value: 1e30,
+        scientific: true
+      },
+      deci: {
+        name: 'deci',
+        value: 1e-1,
+        scientific: false
+      },
+      centi: {
+        name: 'centi',
+        value: 1e-2,
+        scientific: false
+      },
+      milli: {
+        name: 'milli',
+        value: 1e-3,
+        scientific: true
+      },
+      micro: {
+        name: 'micro',
+        value: 1e-6,
+        scientific: true
+      },
+      nano: {
+        name: 'nano',
+        value: 1e-9,
+        scientific: true
+      },
+      pico: {
+        name: 'pico',
+        value: 1e-12,
+        scientific: true
+      },
+      femto: {
+        name: 'femto',
+        value: 1e-15,
+        scientific: true
+      },
+      atto: {
+        name: 'atto',
+        value: 1e-18,
+        scientific: true
+      },
+      zepto: {
+        name: 'zepto',
+        value: 1e-21,
+        scientific: true
+      },
+      yocto: {
+        name: 'yocto',
+        value: 1e-24,
+        scientific: true
+      },
+      ronto: {
+        name: 'ronto',
+        value: 1e-27,
+        scientific: true
+      },
+      quecto: {
+        name: 'quecto',
+        value: 1e-30,
+        scientific: true
+      }
+    },
+    SQUARED: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e2,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e4,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e6,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e12,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e18,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e24,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e30,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e36,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e42,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e48,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e54,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e60,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-2,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-4,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-6,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-12,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-18,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-24,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-30,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-36,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-42,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-48,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-54,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-60,
+        scientific: true
+      }
+    },
+    CUBIC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e3,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e6,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e9,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e18,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e27,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e36,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e45,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e54,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e63,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e72,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e81,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e90,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-3,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-6,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-9,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-18,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-27,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-36,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-45,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-54,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-63,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-72,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-81,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-90,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      Ki: {
+        name: 'Ki',
+        value: 1024,
+        scientific: true
+      },
+      Mi: {
+        name: 'Mi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      Gi: {
+        name: 'Gi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      Ti: {
+        name: 'Ti',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      Pi: {
+        name: 'Pi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      Ei: {
+        name: 'Ei',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      Zi: {
+        name: 'Zi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      Yi: {
+        name: 'Yi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BINARY_LONG_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_LONG_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kibi: {
+        name: 'kibi',
+        value: 1024,
+        scientific: true
+      },
+      mebi: {
+        name: 'mebi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      gibi: {
+        name: 'gibi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      tebi: {
+        name: 'tebi',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      pebi: {
+        name: 'pebi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      exi: {
+        name: 'exi',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      zebi: {
+        name: 'zebi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      yobi: {
+        name: 'yobi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BTU: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      MM: {
+        name: 'MM',
+        value: 1e6,
+        scientific: true
+      }
+    }
+  };
+  PREFIXES.SHORTLONG = (0, _extends2.default)({}, PREFIXES.SHORT, PREFIXES.LONG);
+  PREFIXES.BINARY_SHORT = (0, _extends2.default)({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);
+  PREFIXES.BINARY_LONG = (0, _extends2.default)({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);
+
+  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:
+   * Index  Dimension
+   * -----  ---------
+   *   0    Length
+   *   1    Mass
+   *   2    Time
+   *   3    Current
+   *   4    Temperature
+   *   5    Luminous intensity
+   *   6    Amount of substance
+   *   7    Angle
+   *   8    Bit (digital)
+   * For example, the unit "298.15 K" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit "1 cal / (gm °C)" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].
+   *
+   */
+
+  const BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];
+  const BASE_UNITS = {
+    NONE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    MASS: {
+      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    LENGTH: {
+      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]
+    },
+    TIME: {
+      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]
+    },
+    CURRENT: {
+      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]
+    },
+    TEMPERATURE: {
+      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]
+    },
+    LUMINOUS_INTENSITY: {
+      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]
+    },
+    AMOUNT_OF_SUBSTANCE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]
+    },
+    FORCE: {
+      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    SURFACE: {
+      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]
+    },
+    VOLUME: {
+      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]
+    },
+    ENERGY: {
+      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]
+    },
+    POWER: {
+      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]
+    },
+    PRESSURE: {
+      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CHARGE: {
+      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CAPACITANCE: {
+      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_POTENTIAL: {
+      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_RESISTANCE: {
+      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_INDUCTANCE: {
+      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CONDUCTANCE: {
+      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX: {
+      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX_DENSITY: {
+      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]
+    },
+    FREQUENCY: {
+      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]
+    },
+    ANGLE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]
+    },
+    BIT: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]
+    }
+  };
+  for (const key in BASE_UNITS) {
+    if ((0, _object.hasOwnProperty)(BASE_UNITS, key)) {
+      BASE_UNITS[key].key = key;
+    }
+  }
+  const BASE_UNIT_NONE = {};
+  const UNIT_NONE = {
+    name: '',
+    base: BASE_UNIT_NONE,
+    value: 1,
+    offset: 0,
+    dimensions: BASE_DIMENSIONS.map(x => 0)
+  };
+  const UNITS = {
+    // length
+    meter: {
+      name: 'meter',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    inch: {
+      name: 'inch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    foot: {
+      name: 'foot',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yard: {
+      name: 'yard',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mile: {
+      name: 'mile',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    link: {
+      name: 'link',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rod: {
+      name: 'rod',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.0292,
+      offset: 0
+    },
+    chain: {
+      name: 'chain',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    angstrom: {
+      name: 'angstrom',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1e-10,
+      offset: 0
+    },
+    m: {
+      name: 'm',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    in: {
+      name: 'in',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    ft: {
+      name: 'ft',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yd: {
+      name: 'yd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mi: {
+      name: 'mi',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    li: {
+      name: 'li',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rd: {
+      name: 'rd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.029210,
+      offset: 0
+    },
+    ch: {
+      name: 'ch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    mil: {
+      name: 'mil',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000254,
+      offset: 0
+    },
+    // 1/1000 inch
+
+    // Surface
+    m2: {
+      name: 'm2',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.SQUARED,
+      value: 1,
+      offset: 0
+    },
+    sqin: {
+      name: 'sqin',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.00064516,
+      offset: 0
+    },
+    // 645.16 mm2
+    sqft: {
+      name: 'sqft',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.09290304,
+      offset: 0
+    },
+    // 0.09290304 m2
+    sqyd: {
+      name: 'sqyd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.83612736,
+      offset: 0
+    },
+    // 0.83612736 m2
+    sqmi: {
+      name: 'sqmi',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 2589988.110336,
+      offset: 0
+    },
+    // 2.589988110336 km2
+    sqrd: {
+      name: 'sqrd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 25.29295,
+      offset: 0
+    },
+    // 25.29295 m2
+    sqch: {
+      name: 'sqch',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 404.6873,
+      offset: 0
+    },
+    // 404.6873 m2
+    sqmil: {
+      name: 'sqmil',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 6.4516e-10,
+      offset: 0
+    },
+    // 6.4516 * 10^-10 m2
+    acre: {
+      name: 'acre',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 4046.86,
+      offset: 0
+    },
+    // 4046.86 m2
+    hectare: {
+      name: 'hectare',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 10000,
+      offset: 0
+    },
+    // 10000 m2
+
+    // Volume
+    m3: {
+      name: 'm3',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.CUBIC,
+      value: 1,
+      offset: 0
+    },
+    L: {
+      name: 'L',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    l: {
+      name: 'l',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    litre: {
+      name: 'litre',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    cuin: {
+      name: 'cuin',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1.6387064e-5,
+      offset: 0
+    },
+    // 1.6387064e-5 m3
+    cuft: {
+      name: 'cuft',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.028316846592,
+      offset: 0
+    },
+    // 28.316 846 592 L
+    cuyd: {
+      name: 'cuyd',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.764554857984,
+      offset: 0
+    },
+    // 764.554 857 984 L
+    teaspoon: {
+      name: 'teaspoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000005,
+      offset: 0
+    },
+    // 5 mL
+    tablespoon: {
+      name: 'tablespoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000015,
+      offset: 0
+    },
+    // 15 mL
+    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup
+    drop: {
+      name: 'drop',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    gtt: {
+      name: 'gtt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+
+    // Liquid volume
+    minim: {
+      name: 'minim',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000000061611519921875,
+      offset: 0
+    },
+    // 1/61440 gallons
+    fluiddram: {
+      name: 'fluiddram',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911953125,
+      offset: 0
+    },
+    // 1/1024 gallons
+    fluidounce: {
+      name: 'fluidounce',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000295735295625,
+      offset: 0
+    },
+    // 1/128 gallons
+    gill: {
+      name: 'gill',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00011829411825,
+      offset: 0
+    },
+    // 1/32 gallons
+    cc: {
+      name: 'cc',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1e-6,
+      offset: 0
+    },
+    // 1e-6 L
+    cup: {
+      name: 'cup',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882365,
+      offset: 0
+    },
+    // 1/16 gallons
+    pint: {
+      name: 'pint',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000473176473,
+      offset: 0
+    },
+    // 1/8 gallons
+    quart: {
+      name: 'quart',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000946352946,
+      offset: 0
+    },
+    // 1/4 gallons
+    gallon: {
+      name: 'gallon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785411784,
+      offset: 0
+    },
+    // 3.785411784 L
+    beerbarrel: {
+      name: 'beerbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.117347765304,
+      offset: 0
+    },
+    // 31 gallons
+    oilbarrel: {
+      name: 'oilbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.158987294928,
+      offset: 0
+    },
+    // 42 gallons
+    hogshead: {
+      name: 'hogshead',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.238480942392,
+      offset: 0
+    },
+    // 63 gallons
+
+    // Mass
+    g: {
+      name: 'g',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    gram: {
+      name: 'gram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    ton: {
+      name: 'ton',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 907.18474,
+      offset: 0
+    },
+    t: {
+      name: 't',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 1000,
+      offset: 0
+    },
+    tonne: {
+      name: 'tonne',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 1000,
+      offset: 0
+    },
+    grain: {
+      name: 'grain',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dram: {
+      name: 'dram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    ounce: {
+      name: 'ounce',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    poundmass: {
+      name: 'poundmass',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    hundredweight: {
+      name: 'hundredweight',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    stick: {
+      name: 'stick',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 115e-3,
+      offset: 0
+    },
+    stone: {
+      name: 'stone',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 6.35029318,
+      offset: 0
+    },
+    gr: {
+      name: 'gr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dr: {
+      name: 'dr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    oz: {
+      name: 'oz',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    lbm: {
+      name: 'lbm',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    cwt: {
+      name: 'cwt',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    // Time
+    s: {
+      name: 's',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    min: {
+      name: 'min',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    h: {
+      name: 'h',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    second: {
+      name: 'second',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    sec: {
+      name: 'sec',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    minute: {
+      name: 'minute',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    hour: {
+      name: 'hour',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    day: {
+      name: 'day',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 86400,
+      offset: 0
+    },
+    week: {
+      name: 'week',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 7 * 86400,
+      offset: 0
+    },
+    month: {
+      name: 'month',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 2629800,
+      // 1/12th of Julian year
+      offset: 0
+    },
+    year: {
+      name: 'year',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600,
+      // Julian year
+      offset: 0
+    },
+    decade: {
+      name: 'decade',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 315576000,
+      // Julian decade
+      offset: 0
+    },
+    century: {
+      name: 'century',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3155760000,
+      // Julian century
+      offset: 0
+    },
+    millennium: {
+      name: 'millennium',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600000,
+      // Julian millennium
+      offset: 0
+    },
+    // Frequency
+    hertz: {
+      name: 'Hertz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    Hz: {
+      name: 'Hz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    // Angle
+    rad: {
+      name: 'rad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    radian: {
+      name: 'radian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888
+    deg: {
+      name: 'deg',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    degree: {
+      name: 'degree',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399
+    grad: {
+      name: 'grad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    gradian: {
+      name: 'gradian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793
+    cycle: {
+      name: 'cycle',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795
+    arcsec: {
+      name: 'arcsec',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477
+    arcmin: {
+      name: 'arcmin',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // Electric current
+    A: {
+      name: 'A',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    ampere: {
+      name: 'ampere',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // Temperature
+    // K(C) = °C + 273.15
+    // K(F) = (°F + 459.67) * (5 / 9)
+    // K(R) = °R * (5 / 9)
+    K: {
+      name: 'K',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    degC: {
+      name: 'degC',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 273.15
+    },
+    degF: {
+      name: 'degF',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: new Fraction(5, 9),
+      offset: 459.67
+    },
+    degR: {
+      name: 'degR',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: new Fraction(5, 9),
+      offset: 0
+    },
+    kelvin: {
+      name: 'kelvin',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    celsius: {
+      name: 'celsius',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 273.15
+    },
+    fahrenheit: {
+      name: 'fahrenheit',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: new Fraction(5, 9),
+      offset: 459.67
+    },
+    rankine: {
+      name: 'rankine',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: new Fraction(5, 9),
+      offset: 0
+    },
+    // amount of substance
+    mol: {
+      name: 'mol',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    mole: {
+      name: 'mole',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // luminous intensity
+    cd: {
+      name: 'cd',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    candela: {
+      name: 'candela',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // TODO: units STERADIAN
+    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+
+    // Force
+    N: {
+      name: 'N',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    newton: {
+      name: 'newton',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    dyn: {
+      name: 'dyn',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 0.00001,
+      offset: 0
+    },
+    dyne: {
+      name: 'dyne',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 0.00001,
+      offset: 0
+    },
+    lbf: {
+      name: 'lbf',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    poundforce: {
+      name: 'poundforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    kip: {
+      name: 'kip',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 4448.2216,
+      offset: 0
+    },
+    kilogramforce: {
+      name: 'kilogramforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    // Energy
+    J: {
+      name: 'J',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    joule: {
+      name: 'joule',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    erg: {
+      name: 'erg',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both kiloerg and kerg are acceptable
+      value: 1e-7,
+      offset: 0
+    },
+    Wh: {
+      name: 'Wh',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 3600,
+      offset: 0
+    },
+    BTU: {
+      name: 'BTU',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.BTU,
+      value: 1055.05585262,
+      offset: 0
+    },
+    eV: {
+      name: 'eV',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    electronvolt: {
+      name: 'electronvolt',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    // Power
+    W: {
+      name: 'W',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    watt: {
+      name: 'watt',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    hp: {
+      name: 'hp',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.NONE,
+      value: 745.6998715386,
+      offset: 0
+    },
+    // Electrical power units
+    VAR: {
+      name: 'VAR',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: Complex.I,
+      offset: 0
+    },
+    VA: {
+      name: 'VA',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Pressure
+    Pa: {
+      name: 'Pa',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    psi: {
+      name: 'psi',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 6894.75729276459,
+      offset: 0
+    },
+    atm: {
+      name: 'atm',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 101325,
+      offset: 0
+    },
+    bar: {
+      name: 'bar',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORTLONG,
+      value: 100000,
+      offset: 0
+    },
+    torr: {
+      name: 'torr',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmHg: {
+      name: 'mmHg',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmH2O: {
+      name: 'mmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    cmH2O: {
+      name: 'cmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 98.0665,
+      offset: 0
+    },
+    // Electric charge
+    coulomb: {
+      name: 'coulomb',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    C: {
+      name: 'C',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric capacitance
+    farad: {
+      name: 'farad',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    F: {
+      name: 'F',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric potential
+    volt: {
+      name: 'volt',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    V: {
+      name: 'V',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric resistance
+    ohm: {
+      name: 'ohm',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both Mohm and megaohm are acceptable
+      value: 1,
+      offset: 0
+    },
+    /*
+     * Unicode breaks in browsers if charset is not specified
+    Ω: {
+      name: 'Ω',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    */
+    // Electric inductance
+    henry: {
+      name: 'henry',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    H: {
+      name: 'H',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric conductance
+    siemens: {
+      name: 'siemens',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    S: {
+      name: 'S',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux
+    weber: {
+      name: 'weber',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    Wb: {
+      name: 'Wb',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux density
+    tesla: {
+      name: 'tesla',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    T: {
+      name: 'T',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Binary
+    b: {
+      name: 'b',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 1,
+      offset: 0
+    },
+    bits: {
+      name: 'bits',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 1,
+      offset: 0
+    },
+    B: {
+      name: 'B',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 8,
+      offset: 0
+    },
+    bytes: {
+      name: 'bytes',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 8,
+      offset: 0
+    }
+  };
+
+  // aliases (formerly plurals)
+  // note that ALIASES is only used at creation to create more entries in UNITS by copying the aliased units
+  const ALIASES = {
+    meters: 'meter',
+    inches: 'inch',
+    feet: 'foot',
+    yards: 'yard',
+    miles: 'mile',
+    links: 'link',
+    rods: 'rod',
+    chains: 'chain',
+    angstroms: 'angstrom',
+    lt: 'l',
+    litres: 'litre',
+    liter: 'litre',
+    liters: 'litre',
+    teaspoons: 'teaspoon',
+    tablespoons: 'tablespoon',
+    minims: 'minim',
+    fldr: 'fluiddram',
+    fluiddrams: 'fluiddram',
+    floz: 'fluidounce',
+    fluidounces: 'fluidounce',
+    gi: 'gill',
+    gills: 'gill',
+    cp: 'cup',
+    cups: 'cup',
+    pt: 'pint',
+    pints: 'pint',
+    qt: 'quart',
+    quarts: 'quart',
+    gal: 'gallon',
+    gallons: 'gallon',
+    bbl: 'beerbarrel',
+    beerbarrels: 'beerbarrel',
+    obl: 'oilbarrel',
+    oilbarrels: 'oilbarrel',
+    hogsheads: 'hogshead',
+    gtts: 'gtt',
+    grams: 'gram',
+    tons: 'ton',
+    tonnes: 'tonne',
+    grains: 'grain',
+    drams: 'dram',
+    ounces: 'ounce',
+    poundmasses: 'poundmass',
+    hundredweights: 'hundredweight',
+    sticks: 'stick',
+    lb: 'lbm',
+    lbs: 'lbm',
+    kips: 'kip',
+    kgf: 'kilogramforce',
+    acres: 'acre',
+    hectares: 'hectare',
+    sqfeet: 'sqft',
+    sqyard: 'sqyd',
+    sqmile: 'sqmi',
+    sqmiles: 'sqmi',
+    mmhg: 'mmHg',
+    mmh2o: 'mmH2O',
+    cmh2o: 'cmH2O',
+    seconds: 'second',
+    secs: 'second',
+    minutes: 'minute',
+    mins: 'minute',
+    hours: 'hour',
+    hr: 'hour',
+    hrs: 'hour',
+    days: 'day',
+    weeks: 'week',
+    months: 'month',
+    years: 'year',
+    decades: 'decade',
+    centuries: 'century',
+    millennia: 'millennium',
+    hertz: 'hertz',
+    radians: 'radian',
+    degrees: 'degree',
+    gradians: 'gradian',
+    cycles: 'cycle',
+    arcsecond: 'arcsec',
+    arcseconds: 'arcsec',
+    arcminute: 'arcmin',
+    arcminutes: 'arcmin',
+    BTUs: 'BTU',
+    watts: 'watt',
+    joules: 'joule',
+    amperes: 'ampere',
+    amps: 'ampere',
+    amp: 'ampere',
+    coulombs: 'coulomb',
+    volts: 'volt',
+    ohms: 'ohm',
+    farads: 'farad',
+    webers: 'weber',
+    teslas: 'tesla',
+    electronvolts: 'electronvolt',
+    moles: 'mole',
+    bit: 'bits',
+    byte: 'bytes'
+  };
+
+  /**
+   * Calculate the values for the angle units.
+   * Value is calculated as number or BigNumber depending on the configuration
+   * @param {{number: 'number' | 'BigNumber'}} config
+   */
+  function calculateAngleValues(config) {
+    if (config.number === 'BigNumber') {
+      const pi = (0, _constants.createBigNumberPi)(BigNumber);
+      UNITS.rad.value = new BigNumber(1);
+      UNITS.deg.value = pi.div(180); // 2 * pi / 360
+      UNITS.grad.value = pi.div(200); // 2 * pi / 400
+      UNITS.cycle.value = pi.times(2); // 2 * pi
+      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600
+      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60
+    } else {
+      // number
+      UNITS.rad.value = 1;
+      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360
+      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400
+      UNITS.cycle.value = Math.PI * 2; // 2 * pi
+      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600
+      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60
+    }
+
+    // copy to the full names of the angles
+    UNITS.radian.value = UNITS.rad.value;
+    UNITS.degree.value = UNITS.deg.value;
+    UNITS.gradian.value = UNITS.grad.value;
+  }
+
+  // apply the angle values now
+  calculateAngleValues(config);
+  if (on) {
+    // recalculate the values on change of configuration
+    on('config', function (curr, prev) {
+      if (curr.number !== prev.number) {
+        calculateAngleValues(curr);
+      }
+    });
+  }
+
+  /**
+   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.
+   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).
+   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.
+   */
+  const UNIT_SYSTEMS = {
+    si: {
+      // Base units
+      NONE: {
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE['']
+      },
+      LENGTH: {
+        unit: UNITS.m,
+        prefix: PREFIXES.SHORT['']
+      },
+      MASS: {
+        unit: UNITS.g,
+        prefix: PREFIXES.SHORT.k
+      },
+      TIME: {
+        unit: UNITS.s,
+        prefix: PREFIXES.SHORT['']
+      },
+      CURRENT: {
+        unit: UNITS.A,
+        prefix: PREFIXES.SHORT['']
+      },
+      TEMPERATURE: {
+        unit: UNITS.K,
+        prefix: PREFIXES.SHORT['']
+      },
+      LUMINOUS_INTENSITY: {
+        unit: UNITS.cd,
+        prefix: PREFIXES.SHORT['']
+      },
+      AMOUNT_OF_SUBSTANCE: {
+        unit: UNITS.mol,
+        prefix: PREFIXES.SHORT['']
+      },
+      ANGLE: {
+        unit: UNITS.rad,
+        prefix: PREFIXES.SHORT['']
+      },
+      BIT: {
+        unit: UNITS.bits,
+        prefix: PREFIXES.SHORT['']
+      },
+      // Derived units
+      FORCE: {
+        unit: UNITS.N,
+        prefix: PREFIXES.SHORT['']
+      },
+      ENERGY: {
+        unit: UNITS.J,
+        prefix: PREFIXES.SHORT['']
+      },
+      POWER: {
+        unit: UNITS.W,
+        prefix: PREFIXES.SHORT['']
+      },
+      PRESSURE: {
+        unit: UNITS.Pa,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CHARGE: {
+        unit: UNITS.C,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CAPACITANCE: {
+        unit: UNITS.F,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_POTENTIAL: {
+        unit: UNITS.V,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_RESISTANCE: {
+        unit: UNITS.ohm,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_INDUCTANCE: {
+        unit: UNITS.H,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CONDUCTANCE: {
+        unit: UNITS.S,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX: {
+        unit: UNITS.Wb,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX_DENSITY: {
+        unit: UNITS.T,
+        prefix: PREFIXES.SHORT['']
+      },
+      FREQUENCY: {
+        unit: UNITS.Hz,
+        prefix: PREFIXES.SHORT['']
+      }
+    }
+  };
+
+  // Clone to create the other unit systems
+  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.cgs.LENGTH = {
+    unit: UNITS.m,
+    prefix: PREFIXES.SHORT.c
+  };
+  UNIT_SYSTEMS.cgs.MASS = {
+    unit: UNITS.g,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.FORCE = {
+    unit: UNITS.dyn,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.ENERGY = {
+    unit: UNITS.erg,
+    prefix: PREFIXES.NONE['']
+  };
+  // there are wholly 4 unique cgs systems for electricity and magnetism,
+  // so let's not worry about it unless somebody complains
+
+  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.us.LENGTH = {
+    unit: UNITS.ft,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.MASS = {
+    unit: UNITS.lbm,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.TEMPERATURE = {
+    unit: UNITS.degF,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.FORCE = {
+    unit: UNITS.lbf,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.ENERGY = {
+    unit: UNITS.BTU,
+    prefix: PREFIXES.BTU['']
+  };
+  UNIT_SYSTEMS.us.POWER = {
+    unit: UNITS.hp,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.PRESSURE = {
+    unit: UNITS.psi,
+    prefix: PREFIXES.NONE['']
+  };
+
+  // Add additional unit systems here.
+
+  // Choose a unit system to seed the auto unit system.
+  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+
+  // Set the current unit system
+  let currentUnitSystem = UNIT_SYSTEMS.auto;
+
+  /**
+   * Set a unit system for formatting derived units.
+   * @memberof Unit
+   * @param {string} [name] The name of the unit system.
+   */
+  Unit.setUnitSystem = function (name) {
+    if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, name)) {
+      currentUnitSystem = UNIT_SYSTEMS[name];
+    } else {
+      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));
+    }
+  };
+
+  /**
+   * Return the current unit system.
+   * @memberof Unit
+   * @return {string} The current unit system.
+   */
+  Unit.getUnitSystem = function () {
+    for (const key in UNIT_SYSTEMS) {
+      if ((0, _object.hasOwnProperty)(UNIT_SYSTEMS, key)) {
+        if (UNIT_SYSTEMS[key] === currentUnitSystem) {
+          return key;
+        }
+      }
+    }
+  };
+
+  /**
+   * Converters to convert from number to an other numeric type like BigNumber
+   * or Fraction
+   */
+  Unit.typeConverters = {
+    BigNumber: function (x) {
+      if (x !== null && x !== void 0 && x.isFraction) return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));
+      return new BigNumber(x + ''); // stringify to prevent constructor error
+    },
+    Fraction: function (x) {
+      return new Fraction(x);
+    },
+    Complex: function (x) {
+      return x;
+    },
+    number: function (x) {
+      if (x !== null && x !== void 0 && x.isFraction) return number(x);
+      return x;
+    }
+  };
+
+  /**
+   * Retrieve the right converter function corresponding with this unit's
+   * value
+   *
+   * @memberof Unit
+   * @return {Function}
+   */
+  Unit.prototype._numberConverter = function () {
+    const convert = Unit.typeConverters[this.valueType()];
+    if (convert) {
+      return convert;
+    }
+    throw new TypeError('Unsupported Unit value type "' + this.valueType() + '"');
+  };
+
+  /**
+   * Retrieve the right convertor function corresponding with the type
+   * of provided exampleValue.
+   *
+   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'
+   *                        In case of an unknown type,
+   * @return {Function}
+   */
+  Unit._getNumberConverter = function (type) {
+    if (!Unit.typeConverters[type]) {
+      throw new TypeError('Unsupported type "' + type + '"');
+    }
+    return Unit.typeConverters[type];
+  };
+
+  // Add dimensions to each built-in unit
+  for (const key in UNITS) {
+    if ((0, _object.hasOwnProperty)(UNITS, key)) {
+      const unit = UNITS[key];
+      unit.dimensions = unit.base.dimensions;
+    }
+  }
+
+  // Create aliases
+  for (const name in ALIASES) {
+    if ((0, _object.hasOwnProperty)(ALIASES, name)) {
+      const unit = UNITS[ALIASES[name]];
+      const alias = {};
+      for (const key in unit) {
+        if ((0, _object.hasOwnProperty)(unit, key)) {
+          alias[key] = unit[key];
+        }
+      }
+      alias.name = name;
+      UNITS[name] = alias;
+    }
+  }
+
+  /**
+   * Checks if a character is a valid latin letter (upper or lower case).
+   * Note that this function can be overridden, for example to allow support of other alphabets.
+   * @memberof Unit
+   * @param {string} c Tested character
+   * @return {boolean} true if the character is a latin letter
+   */
+  Unit.isValidAlpha = function isValidAlpha(c) {
+    return /^[a-zA-Z]$/.test(c);
+  };
+  function assertUnitNameIsValid(name) {
+    for (let i = 0; i < name.length; i++) {
+      c = name.charAt(i);
+      if (i === 0 && !Unit.isValidAlpha(c)) {
+        throw new Error('Invalid unit name (must begin with alpha character): "' + name + '"');
+      }
+      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {
+        throw new Error('Invalid unit name (only alphanumeric characters are allowed): "' + name + '"');
+      }
+    }
+  }
+
+  /**
+   * Wrapper around createUnitSingle.
+   * Example:
+   *  createUnit( {
+   *     foo: {
+   *       prefixes: 'long',
+   *       baseName: 'essence-of-foo'
+   *     },
+   *     bar: '40 foo',
+   *     baz: {
+   *       definition: '1 bar/hour',
+   *       prefixes: 'long'
+   *     }
+   *   },
+   *   {
+   *     override: true
+   *   })
+   * @memberof Unit
+   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.
+   * @param {object} options
+   * @return {Unit} the last created unit
+   */
+  Unit.createUnit = function (obj, options) {
+    if (typeof obj !== 'object') {
+      throw new TypeError("createUnit expects first parameter to be of type 'Object'");
+    }
+
+    // Remove all units and aliases we are overriding
+    if (options && options.override) {
+      for (const key in obj) {
+        if ((0, _object.hasOwnProperty)(obj, key)) {
+          Unit.deleteUnit(key);
+        }
+        if (obj[key].aliases) {
+          for (let i = 0; i < obj[key].aliases.length; i++) {
+            Unit.deleteUnit(obj[key].aliases[i]);
+          }
+        }
+      }
+    }
+
+    // TODO: traverse multiple times until all units have been added
+    let lastUnit;
+    for (const key in obj) {
+      if ((0, _object.hasOwnProperty)(obj, key)) {
+        lastUnit = Unit.createUnitSingle(key, obj[key]);
+      }
+    }
+    return lastUnit;
+  };
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * Example:
+   *  createUnitSingle('knot', '0.514444444 m/s')
+   *
+   * @memberof Unit
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string | Unit | object} definition      Definition of the unit in terms
+   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,
+   * or an Object. If an Object, may have the following properties:
+   *   - definition {string | Unit} The definition of this unit.
+   *   - prefixes {string} "none", "short", "long", "binary_short", or "binary_long".
+   *     The default is "none".
+   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']
+   *   - offset {Numeric} An offset to apply when converting from the unit. For
+   *     example, the offset for celsius is 273.15 and the offset for farhenheit
+   *     is 459.67. Default is 0.
+   *   - baseName {string} If the unit's dimension does not match that of any other
+   *     base unit, the name of the newly create base unit. Otherwise, this property
+   *     has no effect.
+   *
+   * @return {Unit}
+   */
+  Unit.createUnitSingle = function (name, obj) {
+    if (typeof obj === 'undefined' || obj === null) {
+      obj = {};
+    }
+    if (typeof name !== 'string') {
+      throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");
+    }
+
+    // Check collisions with existing units
+    if ((0, _object.hasOwnProperty)(UNITS, name)) {
+      throw new Error('Cannot create unit "' + name + '": a unit with that name already exists');
+    }
+
+    // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.
+
+    assertUnitNameIsValid(name);
+    let defUnit = null; // The Unit from which the new unit will be created.
+    let aliases = [];
+    let offset = 0;
+    let definition;
+    let prefixes;
+    let baseName;
+    if (obj && obj.type === 'Unit') {
+      defUnit = obj.clone();
+    } else if (typeof obj === 'string') {
+      if (obj !== '') {
+        definition = obj;
+      }
+    } else if (typeof obj === 'object') {
+      definition = obj.definition;
+      prefixes = obj.prefixes;
+      offset = obj.offset;
+      baseName = obj.baseName;
+      if (obj.aliases) {
+        aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array
+      }
+    } else {
+      throw new TypeError('Cannot create unit "' + name + '" from "' + obj.toString() + '": expecting "string" or "Unit" or "Object"');
+    }
+    if (aliases) {
+      for (let i = 0; i < aliases.length; i++) {
+        if ((0, _object.hasOwnProperty)(UNITS, aliases[i])) {
+          throw new Error('Cannot create alias "' + aliases[i] + '": a unit with that name already exists');
+        }
+      }
+    }
+    if (definition && typeof definition === 'string' && !defUnit) {
+      try {
+        defUnit = Unit.parse(definition, {
+          allowNoUnits: true
+        });
+      } catch (ex) {
+        ex.message = 'Could not create unit "' + name + '" from "' + definition + '": ' + ex.message;
+        throw ex;
+      }
+    } else if (definition && definition.type === 'Unit') {
+      defUnit = definition.clone();
+    }
+    aliases = aliases || [];
+    offset = offset || 0;
+    if (prefixes && prefixes.toUpperCase) {
+      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;
+    } else {
+      prefixes = PREFIXES.NONE;
+    }
+
+    // If defUnit is null, it is because the user did not
+    // specify a defintion. So create a new base dimension.
+    let newUnit = {};
+    if (!defUnit) {
+      // Add a new base dimension
+      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {
+        throw new Error('Cannot create new base unit "' + name + '": a base unit with that name already exists (and cannot be overridden)');
+      }
+      BASE_DIMENSIONS.push(baseName);
+
+      // Push 0 onto existing base units
+      for (const b in BASE_UNITS) {
+        if ((0, _object.hasOwnProperty)(BASE_UNITS, b)) {
+          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;
+        }
+      }
+
+      // Add the new base unit
+      const newBaseUnit = {
+        dimensions: []
+      };
+      for (let i = 0; i < BASE_DIMENSIONS.length; i++) {
+        newBaseUnit.dimensions[i] = 0;
+      }
+      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;
+      newBaseUnit.key = baseName;
+      BASE_UNITS[baseName] = newBaseUnit;
+      newUnit = {
+        name,
+        value: 1,
+        dimensions: BASE_UNITS[baseName].dimensions.slice(0),
+        prefixes,
+        offset,
+        base: BASE_UNITS[baseName]
+      };
+      currentUnitSystem[baseName] = {
+        unit: newUnit,
+        prefix: PREFIXES.NONE['']
+      };
+    } else {
+      newUnit = {
+        name,
+        value: defUnit.value,
+        dimensions: defUnit.dimensions.slice(0),
+        prefixes,
+        offset
+      };
+
+      // Create a new base if no matching base exists
+      let anyMatch = false;
+      for (const i in BASE_UNITS) {
+        if ((0, _object.hasOwnProperty)(BASE_UNITS, i)) {
+          let match = true;
+          for (let j = 0; j < BASE_DIMENSIONS.length; j++) {
+            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[i].dimensions[j] || 0)) > 1e-12) {
+              match = false;
+              break;
+            }
+          }
+          if (match) {
+            anyMatch = true;
+            newUnit.base = BASE_UNITS[i];
+            break;
+          }
+        }
+      }
+      if (!anyMatch) {
+        baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+        // Add the new base unit
+        const newBaseUnit = {
+          dimensions: defUnit.dimensions.slice(0)
+        };
+        newBaseUnit.key = baseName;
+        BASE_UNITS[baseName] = newBaseUnit;
+        currentUnitSystem[baseName] = {
+          unit: newUnit,
+          prefix: PREFIXES.NONE['']
+        };
+        newUnit.base = BASE_UNITS[baseName];
+      }
+    }
+    Unit.UNITS[name] = newUnit;
+    for (let i = 0; i < aliases.length; i++) {
+      const aliasName = aliases[i];
+      const alias = {};
+      for (const key in newUnit) {
+        if ((0, _object.hasOwnProperty)(newUnit, key)) {
+          alias[key] = newUnit[key];
+        }
+      }
+      alias.name = aliasName;
+      Unit.UNITS[aliasName] = alias;
+    }
+
+    // delete the memoization cache because we created a new unit
+    delete _findUnit.cache;
+    return new Unit(null, name);
+  };
+  Unit.deleteUnit = function (name) {
+    delete Unit.UNITS[name];
+
+    // delete the memoization cache because we deleted a unit
+    delete _findUnit.cache;
+  };
+
+  // expose arrays with prefixes, dimensions, units, systems
+  Unit.PREFIXES = PREFIXES;
+  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;
+  Unit.BASE_UNITS = BASE_UNITS;
+  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;
+  Unit.UNITS = UNITS;
+  return Unit;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js b/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js
new file mode 100644
index 0000000..1038a3b
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/createUnit.js
@@ -0,0 +1,85 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createCreateUnit = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'createUnit';
+const dependencies = ['typed', 'Unit'];
+const createCreateUnit = exports.createCreateUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Unit
+  } = _ref;
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   *
+   * Syntax:
+   *
+   *     math.createUnit({
+   *       baseUnit1: {
+   *         aliases: [string, ...]
+   *         prefixes: object
+   *       },
+   *       unit2: {
+   *         definition: string,
+   *         aliases: [string, ...]
+   *         prefixes: object,
+   *         offset: number
+   *       },
+   *       unit3: string    // Shortcut
+   *     })
+   *
+   *     // Another shortcut:
+   *     math.createUnit(string, unit : string, [object])
+   *
+   * Examples:
+   *
+   *     math.createUnit('foo')
+   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
+   *     math.createUnit('mph', '1 mile/hour')
+   *     math.createUnit('km', math.unit(1000, 'm'))
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, UnitDefinition, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
+   * @param {Object} options   (optional) An object containing any of the following properties:
+   *     - `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".
+   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']
+   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @return {Unit} The new unit
+   */
+  return typed(name, {
+    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.
+    'Object, Object': function (obj, options) {
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    Object: function (obj) {
+      return Unit.createUnit(obj, {});
+    },
+    // Shortcut method for creating one unit.
+    'string, Unit | string | Object, Object': function (name, def, options) {
+      const obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    'string, Unit | string | Object': function (name, def) {
+      const obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, {});
+    },
+    // Without a definition, creates a base unit.
+    string: function (name) {
+      const obj = {};
+      obj[name] = {};
+      return Unit.createUnit(obj, {});
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js b/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js
new file mode 100644
index 0000000..b2d0226
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/splitUnit.js
@@ -0,0 +1,38 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSplitUnit = void 0;
+var _factory = require("../../../utils/factory.js");
+const name = 'splitUnit';
+const dependencies = ['typed'];
+const createSplitUnit = exports.createSplitUnit = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
+  /**
+   * Split a unit in an array of units whose sum is equal to the original unit.
+   *
+   * Syntax:
+   *
+   *     math.splitUnit(unit: Unit, parts: Array.<Unit>)
+   *
+   * Example:
+   *
+   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
+   *     // [ 3 feet, 3.3700787401575 inch ]
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @param {Array} [parts] An array of strings or valueless units.
+   * @return {Array} An array of units.
+   */
+  return typed(name, {
+    'Unit, Array': function (unit, parts) {
+      return unit.splitUnit(parts);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/function/unit.js b/node_modules/mathjs/lib/cjs/type/unit/function/unit.js
new file mode 100644
index 0000000..cdd12a8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/function/unit.js
@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createUnitFunction = void 0;
+var _factory = require("../../../utils/factory.js");
+var _collection = require("../../../utils/collection.js");
+const name = 'unit';
+const dependencies = ['typed', 'Unit'];
+
+// This function is named createUnitFunction to prevent a naming conflict with createUnit
+const createUnitFunction = exports.createUnitFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    Unit
+  } = _ref;
+  /**
+   * Create a unit. Depending on the passed arguments, the function
+   * will create and return a new math.Unit object.
+   * When a matrix is provided, all elements will be converted to units.
+   *
+   * Syntax:
+   *
+   *     math.unit(unit : string)
+   *     math.unit(value : number, valuelessUnit : Unit)
+   *     math.unit(value : number, valuelessUnit : string)
+   *
+   * Examples:
+   *
+   *    const kph = math.unit('km/h')   // returns Unit km/h (valueless)
+   *    const v = math.unit(25, kph)    // returns Unit 25 km/h
+   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm
+   *    const b = math.unit('23 kg')    // returns Unit 23 kg
+   *    a.to('m')                       // returns Unit 0.05 m
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, string, createUnit
+   *
+   * @param {* | Array | Matrix} args   A number and unit.
+   * @return {Unit | Array | Matrix}    The created unit
+   */
+
+  return typed(name, {
+    Unit: function (x) {
+      return x.clone();
+    },
+    string: function (x) {
+      if (Unit.isValuelessUnit(x)) {
+        return new Unit(null, x); // a pure unit
+      }
+      return Unit.parse(x, {
+        allowNoUnits: true
+      }); // a unit with value, like '5cm'
+    },
+    'number | BigNumber | Fraction | Complex, string | Unit': function (value, unit) {
+      return new Unit(value, unit);
+    },
+    'number | BigNumber | Fraction': function (value) {
+      // dimensionless
+      return new Unit(value);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => (0, _collection.deepMap)(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js b/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js
new file mode 100644
index 0000000..5c1774c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/type/unit/physicalConstants.js
@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createWienDisplacement = exports.createWeakMixingAngle = exports.createVacuumImpedance = exports.createThomsonCrossSection = exports.createStefanBoltzmann = exports.createSpeedOfLight = exports.createSecondRadiation = exports.createSackurTetrode = exports.createRydberg = exports.createReducedPlanckConstant = exports.createQuantumOfCirculation = exports.createProtonMass = exports.createPlanckTime = exports.createPlanckTemperature = exports.createPlanckMass = exports.createPlanckLength = exports.createPlanckConstant = exports.createPlanckCharge = exports.createNuclearMagneton = exports.createNeutronMass = exports.createMolarVolume = exports.createMolarPlanckConstant = exports.createMolarMassC12 = exports.createMolarMass = exports.createMagneticFluxQuantum = exports.createMagneticConstant = exports.createLoschmidt = exports.createKlitzing = exports.createJosephson = exports.createInverseConductanceQuantum = exports.createHartreeEnergy = exports.createGravity = exports.createGravitationConstant = exports.createGasConstant = exports.createFirstRadiation = exports.createFineStructure = exports.createFermiCoupling = exports.createFaraday = exports.createElementaryCharge = exports.createElectronMass = exports.createElectricConstant = exports.createEfimovFactor = exports.createDeuteronMass = exports.createCoulombConstant = exports.createCoulomb = exports.createConductanceQuantum = exports.createClassicalElectronRadius = exports.createBoltzmann = exports.createBohrRadius = exports.createBohrMagneton = exports.createAvogadro = exports.createAtomicMass = void 0;
+var _factory = require("../../utils/factory.js");
+// Source: https://en.wikipedia.org/wiki/Physical_constant
+
+// Universal constants
+const createSpeedOfLight = exports.createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');
+const createGravitationConstant = exports.createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');
+const createPlanckConstant = exports.createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');
+const createReducedPlanckConstant = exports.createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s');
+
+// Electromagnetic constants
+const createMagneticConstant = exports.createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');
+const createElectricConstant = exports.createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');
+const createVacuumImpedance = exports.createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');
+const createCoulomb = exports.createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2'); // Deprecated in favor of coulombConstant
+const createCoulombConstant = exports.createCoulombConstant = /* #__PURE__ */unitFactory('coulombConstant', '8.987551792261171e9', 'N m^2 C^-2');
+const createElementaryCharge = exports.createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');
+const createBohrMagneton = exports.createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');
+const createConductanceQuantum = exports.createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');
+const createInverseConductanceQuantum = exports.createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');
+const createMagneticFluxQuantum = exports.createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');
+const createNuclearMagneton = exports.createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');
+const createKlitzing = exports.createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');
+const createJosephson = exports.createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed
+
+// Atomic and nuclear constants
+const createBohrRadius = exports.createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');
+const createClassicalElectronRadius = exports.createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');
+const createElectronMass = exports.createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');
+const createFermiCoupling = exports.createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');
+const createFineStructure = exports.createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);
+const createHartreeEnergy = exports.createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');
+const createProtonMass = exports.createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');
+const createDeuteronMass = exports.createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');
+const createNeutronMass = exports.createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');
+const createQuantumOfCirculation = exports.createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');
+const createRydberg = exports.createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');
+const createThomsonCrossSection = exports.createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');
+const createWeakMixingAngle = exports.createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);
+const createEfimovFactor = exports.createEfimovFactor = numberFactory('efimovFactor', 22.7);
+
+// Physico-chemical constants
+const createAtomicMass = exports.createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');
+const createAvogadro = exports.createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');
+const createBoltzmann = exports.createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');
+const createFaraday = exports.createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');
+const createFirstRadiation = exports.createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2');
+// TODO spectralRadiance = 1.1910429723971881e-16 W m^2 sr^-1
+const createLoschmidt = exports.createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');
+const createGasConstant = exports.createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');
+const createMolarPlanckConstant = exports.createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');
+const createMolarVolume = exports.createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');
+const createSackurTetrode = exports.createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);
+const createSecondRadiation = exports.createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');
+const createStefanBoltzmann = exports.createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');
+const createWienDisplacement = exports.createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K');
+
+// Adopted values
+const createMolarMass = exports.createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');
+const createMolarMassC12 = exports.createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');
+const createGravity = exports.createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2');
+// atm is defined in Unit.js
+
+// Natural units
+const createPlanckLength = exports.createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');
+const createPlanckMass = exports.createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');
+const createPlanckTime = exports.createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');
+const createPlanckCharge = exports.createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');
+const createPlanckTemperature = exports.createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K');
+
+// helper function to create a factory function which creates a physical constant,
+// a Unit with either a number value or a BigNumber value depending on the configuration
+function unitFactory(name, valueStr, unitStr) {
+  const dependencies = ['config', 'Unit', 'BigNumber'];
+  return (0, _factory.factory)(name, dependencies, _ref => {
+    let {
+      config,
+      Unit,
+      BigNumber
+    } = _ref;
+    // Note that we can parse into number or BigNumber.
+    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values
+    // Therefore we dont use Unit.parse()
+    const value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);
+    const unit = new Unit(value, unitStr);
+    unit.fixPrefix = true;
+    return unit;
+  });
+}
+
+// helper function to create a factory function which creates a numeric constant,
+// either a number or BigNumber depending on the configuration
+function numberFactory(name, value) {
+  const dependencies = ['config', 'BigNumber'];
+  return (0, _factory.factory)(name, dependencies, _ref2 => {
+    let {
+      config,
+      BigNumber
+    } = _ref2;
+    return config.number === 'BigNumber' ? new BigNumber(value) : value;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/array.js b/node_modules/mathjs/lib/cjs/utils/array.js
new file mode 100644
index 0000000..f46a5b5
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/array.js
@@ -0,0 +1,968 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.arraySize = arraySize;
+exports.broadcastArrays = broadcastArrays;
+exports.broadcastSizes = broadcastSizes;
+exports.broadcastTo = broadcastTo;
+exports.checkBroadcastingRules = checkBroadcastingRules;
+exports.clone = clone;
+exports.concat = concat;
+exports.deepForEach = deepForEach;
+exports.deepMap = deepMap;
+exports.filter = filter;
+exports.filterRegExp = filterRegExp;
+exports.flatten = flatten;
+exports.forEach = forEach;
+exports.generalize = generalize;
+exports.get = get;
+exports.getArrayDataType = getArrayDataType;
+exports.identify = identify;
+exports.initial = initial;
+exports.isEmptyIndex = isEmptyIndex;
+exports.join = join;
+exports.last = last;
+exports.map = map;
+exports.processSizesWildcard = processSizesWildcard;
+exports.reshape = reshape;
+exports.resize = resize;
+exports.squeeze = squeeze;
+exports.stretch = stretch;
+exports.unsqueeze = unsqueeze;
+exports.validate = validate;
+exports.validateIndex = validateIndex;
+exports.validateIndexSourceSize = validateIndexSourceSize;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _number = require("./number.js");
+var _is = require("./is.js");
+var _string = require("./string.js");
+var _DimensionError = require("../error/DimensionError.js");
+var _IndexError = require("../error/IndexError.js");
+var _object = require("./object.js");
+/**
+ * Calculate the size of a multi dimensional array.
+ * This function checks the size of the first entry, it does not validate
+ * whether all dimensions match. (use function `validate` for that)
+ * @param {Array} x
+ * @return {number[]} size
+ */
+function arraySize(x) {
+  const s = [];
+  while (Array.isArray(x)) {
+    s.push(x.length);
+    x = x[0];
+  }
+  return s;
+}
+
+/**
+ * Recursively validate whether each element in a multi dimensional array
+ * has a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @param {number} dim     Current dimension
+ * @throws DimensionError
+ * @private
+ */
+function _validate(array, size, dim) {
+  let i;
+  const len = array.length;
+  if (len !== size[dim]) {
+    throw new _DimensionError.DimensionError(len, size[dim]);
+  }
+  if (dim < size.length - 1) {
+    // recursively validate each child array
+    const dimNext = dim + 1;
+    for (i = 0; i < len; i++) {
+      const child = array[i];
+      if (!Array.isArray(child)) {
+        throw new _DimensionError.DimensionError(size.length - 1, size.length, '<');
+      }
+      _validate(array[i], size, dimNext);
+    }
+  } else {
+    // last dimension. none of the children may be an array
+    for (i = 0; i < len; i++) {
+      if (Array.isArray(array[i])) {
+        throw new _DimensionError.DimensionError(size.length + 1, size.length, '>');
+      }
+    }
+  }
+}
+
+/**
+ * Validate whether each element in a multi dimensional array has
+ * a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @throws DimensionError
+ */
+function validate(array, size) {
+  const isScalar = size.length === 0;
+  if (isScalar) {
+    // scalar
+    if (Array.isArray(array)) {
+      throw new _DimensionError.DimensionError(array.length, 0);
+    }
+  } else {
+    // array
+    _validate(array, size, 0);
+  }
+}
+
+/**
+ * Validate whether the source of the index matches the size of the Array
+ * @param {Array | Matrix} value    Array to be validated
+ * @param {Index} index  Index with the source information to validate
+ * @throws DimensionError
+ */
+function validateIndexSourceSize(value, index) {
+  const valueSize = value.isMatrix ? value._size : arraySize(value);
+  const sourceSize = index._sourceSize;
+  // checks if the source size is not null and matches the valueSize
+  sourceSize.forEach((sourceDim, i) => {
+    if (sourceDim !== null && sourceDim !== valueSize[i]) {
+      throw new _DimensionError.DimensionError(sourceDim, valueSize[i]);
+    }
+  });
+}
+
+/**
+ * Test whether index is an integer number with index >= 0 and index < length
+ * when length is provided
+ * @param {number} index    Zero-based index
+ * @param {number} [length] Length of the array
+ */
+function validateIndex(index, length) {
+  if (index !== undefined) {
+    if (!(0, _is.isNumber)(index) || !(0, _number.isInteger)(index)) {
+      throw new TypeError('Index must be an integer (value: ' + index + ')');
+    }
+    if (index < 0 || typeof length === 'number' && index >= length) {
+      throw new _IndexError.IndexError(index, length);
+    }
+  }
+}
+
+/**
+ * Test if an index has empty values
+ * @param {Index} index    Zero-based index
+ */
+function isEmptyIndex(index) {
+  for (let i = 0; i < index._dimensions.length; ++i) {
+    const dimension = index._dimensions[i];
+    if (dimension._data && (0, _is.isArray)(dimension._data)) {
+      if (dimension._size[0] === 0) {
+        return true;
+      }
+    } else if (dimension.isRange) {
+      if (dimension.start === dimension.end) {
+        return true;
+      }
+    } else if ((0, _is.isString)(dimension)) {
+      if (dimension.length === 0) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+
+/**
+ * Resize a multi dimensional array. The resized array is returned.
+ * @param {Array | number} array         Array to be resized
+ * @param {number[]} size Array with the size of each dimension
+ * @param {*} [defaultValue=0]  Value to be filled in new entries,
+ *                              zero by default. Specify for example `null`,
+ *                              to clearly see entries that are not explicitly
+ *                              set.
+ * @return {Array} array         The resized array
+ */
+function resize(array, size, defaultValue) {
+  // check the type of the arguments
+  if (!Array.isArray(size)) {
+    throw new TypeError('Array expected');
+  }
+  if (size.length === 0) {
+    throw new Error('Resizing to scalar is not supported');
+  }
+
+  // check whether size contains positive integers
+  size.forEach(function (value) {
+    if (!(0, _is.isNumber)(value) || !(0, _number.isInteger)(value) || value < 0) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');
+    }
+  });
+
+  // convert number to an array
+  if ((0, _is.isNumber)(array) || (0, _is.isBigNumber)(array)) {
+    array = [array];
+  }
+
+  // recursively resize the array
+  const _defaultValue = defaultValue !== undefined ? defaultValue : 0;
+  _resize(array, size, 0, _defaultValue);
+  return array;
+}
+
+/**
+ * Recursively resize a multi dimensional array
+ * @param {Array} array         Array to be resized
+ * @param {number[]} size       Array with the size of each dimension
+ * @param {number} dim          Current dimension
+ * @param {*} [defaultValue]    Value to be filled in new entries,
+ *                              undefined by default.
+ * @private
+ */
+function _resize(array, size, dim, defaultValue) {
+  let i;
+  let elem;
+  const oldLen = array.length;
+  const newLen = size[dim];
+  const minLen = Math.min(oldLen, newLen);
+
+  // apply new length
+  array.length = newLen;
+  if (dim < size.length - 1) {
+    // non-last dimension
+    const dimNext = dim + 1;
+
+    // resize existing child arrays
+    for (i = 0; i < minLen; i++) {
+      // resize child array
+      elem = array[i];
+      if (!Array.isArray(elem)) {
+        elem = [elem]; // add a dimension
+        array[i] = elem;
+      }
+      _resize(elem, size, dimNext, defaultValue);
+    }
+
+    // create new child arrays
+    for (i = minLen; i < newLen; i++) {
+      // get child array
+      elem = [];
+      array[i] = elem;
+
+      // resize new child array
+      _resize(elem, size, dimNext, defaultValue);
+    }
+  } else {
+    // last dimension
+
+    // remove dimensions of existing values
+    for (i = 0; i < minLen; i++) {
+      while (Array.isArray(array[i])) {
+        array[i] = array[i][0];
+      }
+    }
+
+    // fill new elements with the default value
+    for (i = minLen; i < newLen; i++) {
+      array[i] = defaultValue;
+    }
+  }
+}
+
+/**
+ * Re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {number[]} sizes        List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ *
+ * @throws {DimensionError}       If the product of the new dimension sizes does
+ *                                not equal that of the old ones
+ */
+function reshape(array, sizes) {
+  const flatArray = flatten(array, true); // since it has rectangular
+  const currentLength = flatArray.length;
+  if (!Array.isArray(array) || !Array.isArray(sizes)) {
+    throw new TypeError('Array expected');
+  }
+  if (sizes.length === 0) {
+    throw new _DimensionError.DimensionError(0, currentLength, '!=');
+  }
+  sizes = processSizesWildcard(sizes, currentLength);
+  const newLength = product(sizes);
+  if (currentLength !== newLength) {
+    throw new _DimensionError.DimensionError(newLength, currentLength, '!=');
+  }
+  try {
+    return _reshape(flatArray, sizes);
+  } catch (e) {
+    if (e instanceof _DimensionError.DimensionError) {
+      throw new _DimensionError.DimensionError(newLength, currentLength, '!=');
+    }
+    throw e;
+  }
+}
+
+/**
+ * Replaces the wildcard -1 in the sizes array.
+ * @param {number[]} sizes  List of sizes for each dimension. At most one wildcard.
+ * @param {number} currentLength  Number of elements in the array.
+ * @throws {Error}                If more than one wildcard or unable to replace it.
+ * @returns {number[]}      The sizes array with wildcard replaced.
+ */
+function processSizesWildcard(sizes, currentLength) {
+  const newLength = product(sizes);
+  const processedSizes = sizes.slice();
+  const WILDCARD = -1;
+  const wildCardIndex = sizes.indexOf(WILDCARD);
+  const isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;
+  if (isMoreThanOneWildcard) {
+    throw new Error('More than one wildcard in sizes');
+  }
+  const hasWildcard = wildCardIndex >= 0;
+  const canReplaceWildcard = currentLength % newLength === 0;
+  if (hasWildcard) {
+    if (canReplaceWildcard) {
+      processedSizes[wildCardIndex] = -currentLength / newLength;
+    } else {
+      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);
+    }
+  }
+  return processedSizes;
+}
+
+/**
+ * Computes the product of all array elements.
+ * @param {number[]} array Array of factors
+ * @returns {number}            Product of all elements
+ */
+function product(array) {
+  return array.reduce((prev, curr) => prev * curr, 1);
+}
+
+/**
+ * Iteratively re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {number[]} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ */
+
+function _reshape(array, sizes) {
+  // testing if there are enough elements for the requested shape
+  let tmpArray = array;
+  let tmpArray2;
+  // for each dimension starting by the last one and ignoring the first one
+  for (let sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {
+    const size = sizes[sizeIndex];
+    tmpArray2 = [];
+
+    // aggregate the elements of the current tmpArray in elements of the requested size
+    const length = tmpArray.length / size;
+    for (let i = 0; i < length; i++) {
+      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));
+    }
+    // set it as the new tmpArray for the next loop turn or for return
+    tmpArray = tmpArray2;
+  }
+  return tmpArray;
+}
+
+/**
+ * Squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {Array} [size]
+ * @returns {Array} returns the array itself
+ */
+function squeeze(array, size) {
+  const s = size || arraySize(array);
+
+  // squeeze outer dimensions
+  while (Array.isArray(array) && array.length === 1) {
+    array = array[0];
+    s.shift();
+  }
+
+  // find the first dimension to be squeezed
+  let dims = s.length;
+  while (s[dims - 1] === 1) {
+    dims--;
+  }
+
+  // squeeze inner dimensions
+  if (dims < s.length) {
+    array = _squeeze(array, dims, 0);
+    s.length = dims;
+  }
+  return array;
+}
+
+/**
+ * Recursively squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+function _squeeze(array, dims, dim) {
+  let i, ii;
+  if (dim < dims) {
+    const next = dim + 1;
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _squeeze(array[i], dims, next);
+    }
+  } else {
+    while (Array.isArray(array)) {
+      array = array[0];
+    }
+  }
+  return array;
+}
+
+/**
+ * Unsqueeze a multi dimensional array: add dimensions when missing
+ *
+ * Parameter `size` will be mutated to match the new, unsqueezed matrix size.
+ *
+ * @param {Array} array
+ * @param {number} dims       Desired number of dimensions of the array
+ * @param {number} [outer]    Number of outer dimensions to be added
+ * @param {Array} [size] Current size of array.
+ * @returns {Array} returns the array itself
+ * @private
+ */
+function unsqueeze(array, dims, outer, size) {
+  const s = size || arraySize(array);
+
+  // unsqueeze outer dimensions
+  if (outer) {
+    for (let i = 0; i < outer; i++) {
+      array = [array];
+      s.unshift(1);
+    }
+  }
+
+  // unsqueeze inner dimensions
+  array = _unsqueeze(array, dims, 0);
+  while (s.length < dims) {
+    s.push(1);
+  }
+  return array;
+}
+
+/**
+ * Recursively unsqueeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the unsqueezed array
+ * @private
+ */
+function _unsqueeze(array, dims, dim) {
+  let i, ii;
+  if (Array.isArray(array)) {
+    const next = dim + 1;
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _unsqueeze(array[i], dims, next);
+    }
+  } else {
+    for (let d = dim; d < dims; d++) {
+      array = [array];
+    }
+  }
+  return array;
+}
+/**
+ * Flatten a multi dimensional array, put all elements in a one dimensional
+ * array
+ * @param {Array} array   A multi dimensional array
+ * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)
+ * @return {Array}        The flattened array (1 dimensional)
+ */
+function flatten(array) {
+  let isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  if (!Array.isArray(array)) {
+    // if not an array, return as is
+    return array;
+  }
+  if (typeof isRectangular !== 'boolean') {
+    throw new TypeError('Boolean expected for second argument of flatten');
+  }
+  const flat = [];
+  if (isRectangular) {
+    _flattenRectangular(array);
+  } else {
+    _flatten(array);
+  }
+  return flat;
+  function _flatten(array) {
+    for (let i = 0; i < array.length; i++) {
+      const item = array[i];
+      if (Array.isArray(item)) {
+        _flatten(item);
+      } else {
+        flat.push(item);
+      }
+    }
+  }
+  function _flattenRectangular(array) {
+    if (Array.isArray(array[0])) {
+      for (let i = 0; i < array.length; i++) {
+        _flattenRectangular(array[i]);
+      }
+    } else {
+      for (let i = 0; i < array.length; i++) {
+        flat.push(array[i]);
+      }
+    }
+  }
+}
+
+/**
+ * A safe map
+ * @param {Array} array
+ * @param {function} callback
+ */
+function map(array, callback) {
+  return Array.prototype.map.call(array, callback);
+}
+
+/**
+ * A safe forEach
+ * @param {Array} array
+ * @param {function} callback
+ */
+function forEach(array, callback) {
+  Array.prototype.forEach.call(array, callback);
+}
+
+/**
+ * A safe filter
+ * @param {Array} array
+ * @param {function} callback
+ */
+function filter(array, callback) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+  return Array.prototype.filter.call(array, callback);
+}
+
+/**
+ * Filter values in an array given a regular expression
+ * @param {Array} array
+ * @param {RegExp} regexp
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+function filterRegExp(array, regexp) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+  return Array.prototype.filter.call(array, entry => regexp.test(entry));
+}
+
+/**
+ * A safe join
+ * @param {Array} array
+ * @param {string} separator
+ */
+function join(array, separator) {
+  return Array.prototype.join.call(array, separator);
+}
+
+/**
+ * Assign a numeric identifier to every element of a sorted array
+ * @param {Array} a  An array
+ * @return {Array} An array of objects containing the original value and its identifier
+ */
+function identify(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+  if (a.length === 0) {
+    return a;
+  }
+  const b = [];
+  let count = 0;
+  b[0] = {
+    value: a[0],
+    identifier: 0
+  };
+  for (let i = 1; i < a.length; i++) {
+    if (a[i] === a[i - 1]) {
+      count++;
+    } else {
+      count = 0;
+    }
+    b.push({
+      value: a[i],
+      identifier: count
+    });
+  }
+  return b;
+}
+
+/**
+ * Remove the numeric identifier from the elements
+ * @param {array} a  An array
+ * @return {array} An array of values without identifiers
+ */
+function generalize(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+  if (a.length === 0) {
+    return a;
+  }
+  const b = [];
+  for (let i = 0; i < a.length; i++) {
+    b.push(a[i].value);
+  }
+  return b;
+}
+
+/**
+ * Check the datatype of a given object
+ * This is a low level implementation that should only be used by
+ * parent Matrix classes such as SparseMatrix or DenseMatrix
+ * This method does not validate Array Matrix shape
+ * @param {Array} array
+ * @param {function} typeOf   Callback function to use to determine the type of a value
+ * @return {string}
+ */
+function getArrayDataType(array, typeOf) {
+  let type; // to hold type info
+  let length = 0; // to hold length value to ensure it has consistent sizes
+
+  for (let i = 0; i < array.length; i++) {
+    const item = array[i];
+    const isArray = Array.isArray(item);
+
+    // Saving the target matrix row size
+    if (i === 0 && isArray) {
+      length = item.length;
+    }
+
+    // If the current item is an array but the length does not equal the targetVectorSize
+    if (isArray && item.length !== length) {
+      return undefined;
+    }
+    const itemType = isArray ? getArrayDataType(item, typeOf) // recurse into a nested array
+    : typeOf(item);
+    if (type === undefined) {
+      type = itemType; // first item
+    } else if (type !== itemType) {
+      return 'mixed';
+    } else {
+      // we're good, everything has the same type so far
+    }
+  }
+  return type;
+}
+
+/**
+ * Return the last item from an array
+ * @param {Array} array
+ * @returns {*}
+ */
+function last(array) {
+  return array[array.length - 1];
+}
+
+/**
+ * Get all but the last element of array.
+ * @param {Array} array
+ * @returns {Array}
+ */
+function initial(array) {
+  return array.slice(0, array.length - 1);
+}
+
+/**
+ * Recursively concatenate two matrices.
+ * The contents of the matrices are not cloned.
+ * @param {Array} a             Multi dimensional array
+ * @param {Array} b             Multi dimensional array
+ * @param {number} concatDim    The dimension on which to concatenate (zero-based)
+ * @param {number} dim          The current dim (zero-based)
+ * @return {Array} c            The concatenated matrix
+ * @private
+ */
+function concatRecursive(a, b, concatDim, dim) {
+  if (dim < concatDim) {
+    // recurse into next dimension
+    if (a.length !== b.length) {
+      throw new _DimensionError.DimensionError(a.length, b.length);
+    }
+    const c = [];
+    for (let i = 0; i < a.length; i++) {
+      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);
+    }
+    return c;
+  } else {
+    // concatenate this dimension
+    return a.concat(b);
+  }
+}
+
+/**
+ * Concatenates many arrays in the specified direction
+ * @param {...Array} arrays All the arrays to concatenate
+ * @param {number} concatDim The dimension on which to concatenate (zero-based)
+ * @returns {Array}
+ */
+function concat() {
+  const arrays = Array.prototype.slice.call(arguments, 0, -1);
+  const concatDim = Array.prototype.slice.call(arguments, -1);
+  if (arrays.length === 1) {
+    return arrays[0];
+  }
+  if (arrays.length > 1) {
+    return arrays.slice(1).reduce(function (A, B) {
+      return concatRecursive(A, B, concatDim, 0);
+    }, arrays[0]);
+  } else {
+    throw new Error('Wrong number of arguments in function concat');
+  }
+}
+
+/**
+ * Receives two or more sizes and gets the broadcasted size for both.
+ * @param  {...number[]} sizes Sizes to broadcast together
+ * @returns {number[]} The broadcasted size
+ */
+function broadcastSizes() {
+  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {
+    sizes[_key] = arguments[_key];
+  }
+  const dimensions = sizes.map(s => s.length);
+  const N = Math.max(...dimensions);
+  const sizeMax = new Array(N).fill(null);
+  // check for every size
+  for (let i = 0; i < sizes.length; i++) {
+    const size = sizes[i];
+    const dim = dimensions[i];
+    for (let j = 0; j < dim; j++) {
+      const n = N - dim + j;
+      if (size[j] > sizeMax[n]) {
+        sizeMax[n] = size[j];
+      }
+    }
+  }
+  for (let i = 0; i < sizes.length; i++) {
+    checkBroadcastingRules(sizes[i], sizeMax);
+  }
+  return sizeMax;
+}
+
+/**
+ * Checks if it's possible to broadcast a size to another size
+ * @param {number[]} size The size of the array to check
+ * @param {number[]} toSize The size of the array to validate if it can be broadcasted to
+ */
+function checkBroadcastingRules(size, toSize) {
+  const N = toSize.length;
+  const dim = size.length;
+  for (let j = 0; j < dim; j++) {
+    const n = N - dim + j;
+    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {
+      throw new Error(`shape mismatch: mismatch is found in arg with shape (${size}) not possible to broadcast dimension ${dim} with size ${size[j]} to size ${toSize[n]}`);
+    }
+  }
+}
+
+/**
+ * Broadcasts a single array to a certain size
+ * @param {Array} array Array to be broadcasted
+ * @param {number[]} toSize Size to broadcast the array
+ * @returns {Array} The broadcasted array
+ */
+function broadcastTo(array, toSize) {
+  let Asize = arraySize(array);
+  if ((0, _object.deepStrictEqual)(Asize, toSize)) {
+    return array;
+  }
+  checkBroadcastingRules(Asize, toSize);
+  const broadcastedSize = broadcastSizes(Asize, toSize);
+  const N = broadcastedSize.length;
+  const paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];
+  let A = clone(array);
+  // reshape A if needed to make it ready for concat
+  if (Asize.length < N) {
+    A = reshape(A, paddedSize);
+    Asize = arraySize(A);
+  }
+
+  // stretches the array on each dimension to make it the same size as index
+  for (let dim = 0; dim < N; dim++) {
+    if (Asize[dim] < broadcastedSize[dim]) {
+      A = stretch(A, broadcastedSize[dim], dim);
+      Asize = arraySize(A);
+    }
+  }
+  return A;
+}
+
+/**
+ * Broadcasts arrays and returns the broadcasted arrays in an array
+ * @param  {...Array | any} arrays
+ * @returns {Array[]} The broadcasted arrays
+ */
+function broadcastArrays() {
+  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    arrays[_key2] = arguments[_key2];
+  }
+  if (arrays.length === 0) {
+    throw new Error('Insufficient number of arguments in function broadcastArrays');
+  }
+  if (arrays.length === 1) {
+    return arrays[0];
+  }
+  const sizes = arrays.map(function (array) {
+    return arraySize(array);
+  });
+  const broadcastedSize = broadcastSizes(...sizes);
+  const broadcastedArrays = [];
+  arrays.forEach(function (array) {
+    broadcastedArrays.push(broadcastTo(array, broadcastedSize));
+  });
+  return broadcastedArrays;
+}
+
+/**
+ * Stretches a matrix up to a certain size in a certain dimension
+ * @param {Array} arrayToStretch
+ * @param {number[]} sizeToStretch
+ * @param {number} dimToStretch
+ * @returns {Array} The stretched array
+ */
+function stretch(arrayToStretch, sizeToStretch, dimToStretch) {
+  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);
+}
+
+/**
+* Retrieves a single element from an array given an index.
+*
+* @param {Array} array - The array from which to retrieve the value.
+* @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.
+* @returns {*} - The value at the specified position in the array.
+*
+* @example
+* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];
+* const index = [1, 0, 1];
+* console.log(get(arr, index)); // 6
+*/
+function get(array, index) {
+  if (!Array.isArray(array)) {
+    throw new Error('Array expected');
+  }
+  const size = arraySize(array);
+  if (index.length !== size.length) {
+    throw new _DimensionError.DimensionError(index.length, size.length);
+  }
+  for (let x = 0; x < index.length; x++) {
+    validateIndex(index[x], size[x]);
+  }
+  return index.reduce((acc, curr) => acc[curr], array);
+}
+
+/**
+ * Recursively maps over each element of nested array using a provided callback function.
+ *
+ * @param {Array} array - The array to be mapped.
+ * @param {Function} callback - The function to execute on each element, taking three arguments:
+ *   - `value` (any): The current element being processed in the array.
+ *   - `index` (Array<number>): The index of the current element being processed in the array.
+ *   - `array` (Array): The array `deepMap` was called upon.
+ * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
+ * @returns {Array} A new array with each element being the result of the callback function.
+ */
+function deepMap(array, callback) {
+  let skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+  if (array.length === 0) {
+    return [];
+  }
+  if (skipIndex) {
+    return recursiveMap(array);
+  }
+  const index = [];
+  return recursiveMapWithIndex(array, 0);
+  function recursiveMapWithIndex(value, depth) {
+    if (Array.isArray(value)) {
+      const N = value.length;
+      const result = Array(N);
+      for (let i = 0; i < N; i++) {
+        index[depth] = i;
+        result[i] = recursiveMapWithIndex(value[i], depth + 1);
+      }
+      return result;
+    } else {
+      return callback(value, index.slice(0, depth), array);
+    }
+  }
+  function recursiveMap(value) {
+    if (Array.isArray(value)) {
+      const N = value.length;
+      const result = Array(N);
+      for (let i = 0; i < N; i++) {
+        result[i] = recursiveMap(value[i]);
+      }
+      return result;
+    } else {
+      return callback(value);
+    }
+  }
+}
+
+/**
+ * Recursively iterates over each element in a multi-dimensional array and applies a callback function.
+ *
+ * @param {Array} array - The multi-dimensional array to iterate over.
+ * @param {Function} callback - The function to execute for each element. It receives three arguments:
+ *   - {any} value: The current element being processed in the array.
+ *   - {Array<number>} index: The index of the current element in each dimension.
+ *   - {Array} array: The original array being processed.
+ * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
+ */
+function deepForEach(array, callback) {
+  let skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+  if (array.length === 0) {
+    return;
+  }
+  if (skipIndex) {
+    recursiveForEach(array);
+    return;
+  }
+  const index = [];
+  recursiveForEachWithIndex(array, 0);
+  function recursiveForEachWithIndex(value, depth) {
+    if (Array.isArray(value)) {
+      const N = value.length;
+      for (let i = 0; i < N; i++) {
+        index[depth] = i;
+        recursiveForEachWithIndex(value[i], depth + 1);
+      }
+    } else {
+      callback(value, index.slice(0, depth), array);
+    }
+  }
+  function recursiveForEach(value) {
+    if (Array.isArray(value)) {
+      const N = value.length;
+      for (let i = 0; i < N; i++) {
+        recursiveForEach(value[i]);
+      }
+    } else {
+      callback(value);
+    }
+  }
+}
+
+/**
+ * Deep clones a multidimensional array
+ * @param {Array} array
+ * @returns {Array} cloned array
+ */
+function clone(array) {
+  return (0, _extends2.default)([], array);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bigint.js b/node_modules/mathjs/lib/cjs/utils/bigint.js
new file mode 100644
index 0000000..1ad2f10
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bigint.js
@@ -0,0 +1,33 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.promoteLogarithm = promoteLogarithm;
+/**
+ * Build a bigint logarithm function from a number logarithm,
+ * still returning a number. The idea is that 15 hexadecimal digits
+ * (60 bits) saturates the mantissa of the log, and each additional hex
+ * digit effectively just adds the log of 16 to the resulting value. So
+ * convert the most significant 15 hex digits to a number and take its
+ * log, and then add the log of 16 for each additional hex digit that
+ * was in the bigint.
+ * For negative numbers (complex logarithms), following the bignum
+ * implementation, it just downgrades to number and uses the complex result.
+ * @param {number} log16  the log of 16
+ * @param {(number) -> number} numberLog  the logarithm function for numbers
+ * @param {ConfigurationObject} config  the mathjs configuration
+ * @param {(number) -> Complex} cplx  the associated Complex log
+ * @returns {(bigint) -> number}   the corresponding logarithm for bigints
+ */
+function promoteLogarithm(log16, numberLog, config, cplx) {
+  return function (b) {
+    if (b > 0 || config.predictable) {
+      if (b <= 0) return NaN;
+      const s = b.toString(16);
+      const s15 = s.substring(0, 15);
+      return log16 * (s.length - s15.length) + numberLog(Number('0x' + s15));
+    }
+    return cplx(b.toNumber());
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js b/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js
new file mode 100644
index 0000000..6cd4440
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/bitwise.js
@@ -0,0 +1,411 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.bitAndBigNumber = bitAndBigNumber;
+exports.bitNotBigNumber = bitNotBigNumber;
+exports.bitOrBigNumber = bitOrBigNumber;
+exports.bitXor = bitXor;
+exports.bitwise = bitwise;
+exports.leftShiftBigNumber = leftShiftBigNumber;
+exports.rightArithShiftBigNumber = rightArithShiftBigNumber;
+/**
+ * Bitwise and for Bignumbers
+ *
+ * Special Cases:
+ *   N &  n =  N
+ *   n &  0 =  0
+ *   n & -1 =  n
+ *   n &  n =  n
+ *   I &  I =  I
+ *  -I & -I = -I
+ *   I & -I =  0
+ *   I &  n =  n
+ *   I & -n =  I
+ *  -I &  n =  0
+ *  -I & -n = -I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` & `y`, is fully precise
+ * @private
+ */
+function bitAndBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+  const BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.eq(-1) || x.eq(y)) {
+    return x;
+  }
+  if (y.isZero() || x.eq(-1)) {
+    return y;
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      if (x.isNegative() === y.isNegative()) {
+        return x;
+      }
+      return new BigNumber(0);
+    }
+    if (!x.isFinite()) {
+      if (y.isNegative()) {
+        return x;
+      }
+      if (x.isNegative()) {
+        return new BigNumber(0);
+      }
+      return y;
+    }
+    if (!y.isFinite()) {
+      if (x.isNegative()) {
+        return y;
+      }
+      if (y.isNegative()) {
+        return new BigNumber(0);
+      }
+      return x;
+    }
+  }
+  return bitwise(x, y, function (a, b) {
+    return a & b;
+  });
+}
+
+/**
+ * Bitwise not
+ * @param {BigNumber} x
+ * @return {BigNumber} Result of ~`x`, fully precise
+ *
+ */
+function bitNotBigNumber(x) {
+  if (x.isFinite() && !x.isInteger()) {
+    throw new Error('Integer expected in function bitNot');
+  }
+  const BigNumber = x.constructor;
+  const prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  const result = x.plus(new BigNumber(1));
+  result.s = -result.s || null;
+  BigNumber.config({
+    precision: prevPrec
+  });
+  return result;
+}
+
+/**
+ * Bitwise OR for BigNumbers
+ *
+ * Special Cases:
+ *   N |  n =  N
+ *   n |  0 =  n
+ *   n | -1 = -1
+ *   n |  n =  n
+ *   I |  I =  I
+ *  -I | -I = -I
+ *   I | -n = -1
+ *   I | -I = -1
+ *   I |  n =  I
+ *  -I |  n = -I
+ *  -I | -n = -n
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` | `y`, fully precise
+ */
+function bitOrBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitOr');
+  }
+  const BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  const negOne = new BigNumber(-1);
+  if (x.isZero() || y.eq(negOne) || x.eq(y)) {
+    return y;
+  }
+  if (y.isZero() || x.eq(negOne)) {
+    return x;
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {
+      return negOne;
+    }
+    if (x.isNegative() && y.isNegative()) {
+      return x.isFinite() ? x : y;
+    }
+    return x.isFinite() ? y : x;
+  }
+  return bitwise(x, y, function (a, b) {
+    return a | b;
+  });
+}
+
+/**
+ * Applies bitwise function to numbers
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @param {function (a, b)} func
+ * @return {BigNumber}
+ */
+function bitwise(x, y, func) {
+  const BigNumber = x.constructor;
+  let xBits, yBits;
+  const xSign = +(x.s < 0);
+  const ySign = +(y.s < 0);
+  if (xSign) {
+    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));
+    for (let i = 0; i < xBits.length; ++i) {
+      xBits[i] ^= 1;
+    }
+  } else {
+    xBits = decCoefficientToBinaryString(x);
+  }
+  if (ySign) {
+    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));
+    for (let i = 0; i < yBits.length; ++i) {
+      yBits[i] ^= 1;
+    }
+  } else {
+    yBits = decCoefficientToBinaryString(y);
+  }
+  let minBits, maxBits, minSign;
+  if (xBits.length <= yBits.length) {
+    minBits = xBits;
+    maxBits = yBits;
+    minSign = xSign;
+  } else {
+    minBits = yBits;
+    maxBits = xBits;
+    minSign = ySign;
+  }
+  let shortLen = minBits.length;
+  let longLen = maxBits.length;
+  const expFuncVal = func(xSign, ySign) ^ 1;
+  let outVal = new BigNumber(expFuncVal ^ 1);
+  let twoPower = new BigNumber(1);
+  const two = new BigNumber(2);
+  const prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  while (shortLen > 0) {
+    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+    twoPower = twoPower.times(two);
+  }
+  while (longLen > 0) {
+    if (func(minSign, maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+    twoPower = twoPower.times(two);
+  }
+  BigNumber.config({
+    precision: prevPrec
+  });
+  if (expFuncVal === 0) {
+    outVal.s = -outVal.s;
+  }
+  return outVal;
+}
+
+/* Extracted from decimal.js, and edited to specialize. */
+function decCoefficientToBinaryString(x) {
+  // Convert to string
+  const a = x.d; // array with digits
+  let r = a[0] + '';
+  for (let i = 1; i < a.length; ++i) {
+    let s = a[i] + '';
+    for (let z = 7 - s.length; z--;) {
+      s = '0' + s;
+    }
+    r += s;
+  }
+  let j = r.length;
+  while (r.charAt(j) === '0') {
+    j--;
+  }
+  let xe = x.e;
+  let str = r.slice(0, j + 1 || 1);
+  const strL = str.length;
+  if (xe > 0) {
+    if (++xe > strL) {
+      // Append zeros.
+      xe -= strL;
+      while (xe--) {
+        str += '0';
+      }
+    } else if (xe < strL) {
+      str = str.slice(0, xe) + '.' + str.slice(xe);
+    }
+  }
+
+  // Convert from base 10 (decimal) to base 2
+  const arr = [0];
+  for (let i = 0; i < str.length;) {
+    let arrL = arr.length;
+    while (arrL--) {
+      arr[arrL] *= 10;
+    }
+    arr[0] += parseInt(str.charAt(i++)); // convert to int
+    for (let j = 0; j < arr.length; ++j) {
+      if (arr[j] > 1) {
+        if (arr[j + 1] === null || arr[j + 1] === undefined) {
+          arr[j + 1] = 0;
+        }
+        arr[j + 1] += arr[j] >> 1;
+        arr[j] &= 1;
+      }
+    }
+  }
+  return arr.reverse();
+}
+
+/**
+ * Bitwise XOR for BigNumbers
+ *
+ * Special Cases:
+ *   N ^  n =  N
+ *   n ^  0 =  n
+ *   n ^  n =  0
+ *   n ^ -1 = ~n
+ *   I ^  n =  I
+ *   I ^ -n = -I
+ *   I ^ -I = -1
+ *  -I ^  n = -I
+ *  -I ^ -n =  I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` ^ `y`, fully precise
+ *
+ */
+function bitXor(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitXor');
+  }
+  const BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero()) {
+    return y;
+  }
+  if (y.isZero()) {
+    return x;
+  }
+  if (x.eq(y)) {
+    return new BigNumber(0);
+  }
+  const negOne = new BigNumber(-1);
+  if (x.eq(negOne)) {
+    return bitNotBigNumber(y);
+  }
+  if (y.eq(negOne)) {
+    return bitNotBigNumber(x);
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      return negOne;
+    }
+    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);
+  }
+  return bitwise(x, y, function (a, b) {
+    return a ^ b;
+  });
+}
+
+/**
+ * Bitwise left shift
+ *
+ * Special Cases:
+ *  n << -n = N
+ *  n <<  N = N
+ *  N <<  n = N
+ *  n <<  0 = n
+ *  0 <<  n = 0
+ *  I <<  I = N
+ *  I <<  n = I
+ *  n <<  I = I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` << `y`
+ *
+ */
+function leftShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function leftShift');
+  }
+  const BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+  if (!x.isFinite() && !y.isFinite()) {
+    return new BigNumber(NaN);
+  }
+
+  // Math.pow(2, y) is fully precise for y < 55, and fast
+  if (y.lt(55)) {
+    return x.times(Math.pow(2, y.toNumber()) + '');
+  }
+  return x.times(new BigNumber(2).pow(y));
+}
+
+/*
+ * Special Cases:
+ *   n >> -n =  N
+ *   n >>  N =  N
+ *   N >>  n =  N
+ *   I >>  I =  N
+ *   n >>  0 =  n
+ *   I >>  n =  I
+ *  -I >>  n = -I
+ *  -I >>  I = -I
+ *   n >>  I =  I
+ *  -n >>  I = -1
+ *   0 >>  n =  0
+ *
+ * @param {BigNumber} value
+ * @param {BigNumber} value
+ * @return {BigNumber} Result of `x` >> `y`
+ *
+ */
+function rightArithShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+  const BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+  if (!y.isFinite()) {
+    if (x.isNegative()) {
+      return new BigNumber(-1);
+    }
+    if (!x.isFinite()) {
+      return new BigNumber(NaN);
+    }
+    return new BigNumber(0);
+  }
+
+  // Math.pow(2, y) is fully precise for y < 55, and fast
+  if (y.lt(55)) {
+    return x.div(Math.pow(2, y.toNumber()) + '').floor();
+  }
+  return x.div(new BigNumber(2).pow(y)).floor();
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js b/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js
new file mode 100644
index 0000000..5a3bccd
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/constants.js
@@ -0,0 +1,62 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createBigNumberTau = exports.createBigNumberPi = exports.createBigNumberPhi = exports.createBigNumberE = void 0;
+var _function = require("../function.js");
+/**
+ * Calculate BigNumber e
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns e
+ */
+const createBigNumberE = exports.createBigNumberE = (0, _function.memoize)(function (BigNumber) {
+  return new BigNumber(1).exp();
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns phi
+ */
+const createBigNumberPhi = exports.createBigNumberPhi = (0, _function.memoize)(function (BigNumber) {
+  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber pi.
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns pi
+ */
+const createBigNumberPi = exports.createBigNumberPi = (0, _function.memoize)(function (BigNumber) {
+  return BigNumber.acos(-1);
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber tau, tau = 2 * pi
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns tau
+ */
+const createBigNumberTau = exports.createBigNumberTau = (0, _function.memoize)(function (BigNumber) {
+  return createBigNumberPi(BigNumber).times(2);
+}, {
+  hasher
+});
+
+/**
+ * Create a hash for a BigNumber constructor function. The created has is
+ * the configured precision
+ * @param {Array} args         Supposed to contain a single entry with
+ *                             a BigNumber constructor
+ * @return {number} precision
+ * @private
+ */
+function hasher(args) {
+  return args[0].precision;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js b/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js
new file mode 100644
index 0000000..c72212a
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/formatter.js
@@ -0,0 +1,251 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.format = format;
+exports.toEngineering = toEngineering;
+exports.toExponential = toExponential;
+exports.toFixed = toFixed;
+var _is = require("../is.js");
+var _number = require("../number.js");
+/**
+ * Formats a BigNumber in a given base
+ * @param {BigNumber} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+function formatBigNumberToBase(n, base, size) {
+  const BigNumberCtor = n.constructor;
+  const big2 = new BigNumberCtor(2);
+  let suffix = '';
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+    if (!(0, _number.isInteger)(size)) {
+      throw new Error('size must be an integer');
+    }
+    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {
+      throw new Error(`Value must be in range [-2^${size - 1}, 2^${size - 1}-1]`);
+    }
+    if (!n.isInteger()) {
+      throw new Error('Value must be an integer');
+    }
+    if (n.lessThan(0)) {
+      n = n.add(big2.pow(size));
+    }
+    suffix = `i${size}`;
+  }
+  switch (base) {
+    case 2:
+      return `${n.toBinary()}${suffix}`;
+    case 8:
+      return `${n.toOctal()}${suffix}`;
+    case 16:
+      return `${n.toHexadecimal()}${suffix}`;
+    default:
+      throw new Error(`Base ${base} not supported `);
+  }
+}
+
+/**
+ * Convert a BigNumber to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lower` and `upper` bounds, and uses
+ *                                          exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+ *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'
+ *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'
+ *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'
+ *
+ * @param {BigNumber} value
+ * @param {Object | Function | number | BigNumber} [options]
+ * @return {string} str The formatted value
+ */
+function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  }
+
+  // handle special cases
+  if (!value.isFinite()) {
+    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';
+  }
+  const {
+    notation,
+    precision,
+    wordSize
+  } = (0, _number.normalizeFormatOptions)(options);
+
+  // handle the various notations
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+    case 'exponential':
+      return toExponential(value, precision);
+    case 'engineering':
+      return toEngineering(value, precision);
+    case 'bin':
+      return formatBigNumberToBase(value, 2, wordSize);
+    case 'oct':
+      return formatBigNumberToBase(value, 8, wordSize);
+    case 'hex':
+      return formatBigNumberToBase(value, 16, wordSize);
+    case 'auto':
+      {
+        // determine lower and upper bound for exponential notation.
+        // TODO: implement support for upper and lower to be BigNumbers themselves
+        const lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);
+        const upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);
+
+        // handle special case zero
+        if (value.isZero()) return '0';
+
+        // determine whether or not to output exponential notation
+        let str;
+        const rounded = value.toSignificantDigits(precision);
+        const exp = rounded.e;
+        if (exp >= lowerExp && exp < upperExp) {
+          // normal number notation
+          str = rounded.toFixed();
+        } else {
+          // exponential notation
+          str = toExponential(value, precision);
+        }
+
+        // remove trailing zeros after the decimal point
+        return str.replace(/((\.\d*?)(0+))($|e)/, function () {
+          const digits = arguments[2];
+          const e = arguments[4];
+          return digits !== '.' ? digits + e : e;
+        });
+      }
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+
+/**
+ * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+function toEngineering(value, precision) {
+  // find nearest lower multiple of 3 for exponent
+  const e = value.e;
+  const newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+
+  // find difference in exponents, and calculate the value without exponent
+  const valueWithoutExp = value.mul(Math.pow(10, -newExp));
+  let valueStr = valueWithoutExp.toPrecision(precision);
+  if (valueStr.includes('e')) {
+    const BigNumber = value.constructor;
+    valueStr = new BigNumber(valueStr).toFixed();
+  }
+  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+}
+
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ * @returns {string} str
+ */
+function toExponential(value, precision) {
+  if (precision !== undefined) {
+    return value.toExponential(precision - 1); // Note the offset of one
+  } else {
+    return value.toExponential();
+  }
+}
+
+/**
+ * Format a number with fixed notation.
+ * @param {BigNumber} value
+ * @param {number} [precision=undefined] Optional number of decimals after the
+ *                                       decimal point. Undefined by default.
+ */
+function toFixed(value, precision) {
+  return value.toFixed(precision);
+}
+function _toNumberOrDefault(value, defaultValue) {
+  if ((0, _is.isNumber)(value)) {
+    return value;
+  } else if ((0, _is.isBigNumber)(value)) {
+    return value.toNumber();
+  } else {
+    return defaultValue;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js b/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js
new file mode 100644
index 0000000..8872358
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/bignumber/nearlyEqual.js
@@ -0,0 +1,45 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.nearlyEqual = nearlyEqual;
+/**
+ * Compares two BigNumbers.
+ * @param {BigNumber} a - First value to compare
+ * @param {BigNumber} b - Second value to compare
+ * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.
+ * @param {number} [absTol=0] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.
+ * @returns {boolean} whether the two numbers are nearly equal
+ * @throws {Error} If `relTol` is less than or equal to 0.
+ * @throws {Error} If `absTol` is less than 0.
+ *
+ * @example
+ * nearlyEqual(1.000000001, 1.0, 1e-9);            // true
+ * nearlyEqual(1.000000002, 1.0, 0);            // false
+ * nearlyEqual(1.0, 1.009, undefined, 0.02);       // true
+ * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true
+ */
+function nearlyEqual(a, b) {
+  let relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-9;
+  let absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+  if (relTol <= 0) {
+    throw new Error('Relative tolerance must be greater than 0');
+  }
+  if (absTol < 0) {
+    throw new Error('Absolute tolerance must be at least 0');
+  }
+  // NaN
+  if (a.isNaN() || b.isNaN()) {
+    return false;
+  }
+  if (!a.isFinite() || !b.isFinite()) {
+    return a.eq(b);
+  }
+  // use "==" operator, handles infinities
+  if (a.eq(b)) {
+    return true;
+  }
+  // abs(a-b) <= max(relTol * max(abs(a), abs(b)), absTol)
+  return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/collection.js b/node_modules/mathjs/lib/cjs/utils/collection.js
new file mode 100644
index 0000000..179bc72
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/collection.js
@@ -0,0 +1,185 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.containsCollections = containsCollections;
+exports.deepForEach = deepForEach;
+exports.deepMap = deepMap;
+exports.reduce = reduce;
+exports.scatter = scatter;
+var _is = require("./is.js");
+var _IndexError = require("../error/IndexError.js");
+var _array = require("./array.js");
+var _switch2 = require("./switch.js");
+/**
+ * Test whether an array contains collections
+ * @param {Array} array
+ * @returns {boolean} Returns true when the array contains one or multiple
+ *                    collections (Arrays or Matrices). Returns false otherwise.
+ */
+function containsCollections(array) {
+  for (let i = 0; i < array.length; i++) {
+    if ((0, _is.isCollection)(array[i])) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/**
+ * Recursively loop over all elements in a given multi dimensional array
+ * and invoke the callback on each of the elements.
+ * @param {Array | Matrix} array
+ * @param {Function} callback     The callback method is invoked with one
+ *                                parameter: the current element in the array
+ */
+function deepForEach(array, callback) {
+  if ((0, _is.isMatrix)(array)) {
+    array.forEach(x => callback(x), false, true);
+  } else {
+    (0, _array.deepForEach)(array, callback, true);
+  }
+}
+
+/**
+ * Execute the callback function element wise for each element in array and any
+ * nested array
+ * Returns an array with the results
+ * @param {Array | Matrix} array
+ * @param {Function} callback   The callback is called with two parameters:
+ *                              value1 and value2, which contain the current
+ *                              element of both arrays.
+ * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+ *
+ * @return {Array | Matrix} res
+ */
+function deepMap(array, callback, skipZeros) {
+  if (!skipZeros) {
+    if ((0, _is.isMatrix)(array)) {
+      return array.map(x => callback(x), false, true);
+    } else {
+      return (0, _array.deepMap)(array, callback, true);
+    }
+  }
+  const skipZerosCallback = x => x === 0 ? x : callback(x);
+  if ((0, _is.isMatrix)(array)) {
+    return array.map(x => skipZerosCallback(x), false, true);
+  } else {
+    return (0, _array.deepMap)(array, skipZerosCallback, true);
+  }
+}
+
+/**
+ * Reduce a given matrix or array to a new matrix or
+ * array with one less dimension, applying the given
+ * callback in the selected dimension.
+ * @param {Array | Matrix} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @return {Array | Matrix} res
+ */
+function reduce(mat, dim, callback) {
+  const size = Array.isArray(mat) ? (0, _array.arraySize)(mat) : mat.size();
+  if (dim < 0 || dim >= size.length) {
+    // TODO: would be more clear when throwing a DimensionError here
+    throw new _IndexError.IndexError(dim, size.length);
+  }
+  if ((0, _is.isMatrix)(mat)) {
+    return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());
+  } else {
+    return _reduce(mat, dim, callback);
+  }
+}
+
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+function _reduce(mat, dim, callback) {
+  let i, ret, val, tran;
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      val = mat[0];
+      for (i = 1; i < mat.length; i++) {
+        val = callback(val, mat[i]);
+      }
+      return val;
+    } else {
+      tran = (0, _switch2._switch)(mat);
+      ret = [];
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _reduce(tran[i], dim - 1, callback);
+      }
+      return ret;
+    }
+  } else {
+    ret = [];
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _reduce(mat[i], dim - 1, callback);
+    }
+    return ret;
+  }
+}
+
+// TODO: document function scatter
+function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {
+  // a arrays
+  const avalues = a._values;
+  const aindex = a._index;
+  const aptr = a._ptr;
+
+  // vars
+  let k, k0, k1, i;
+
+  // check we need to process values (pattern matrix)
+  if (x) {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k];
+      // check value exists in current j
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark;
+        // add i to pattern of C
+        cindex.push(i);
+        // x(i) = A, check we need to call function this time
+        if (update) {
+          // copy value to workspace calling callback function
+          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);
+          // function was called on current row
+          u[i] = mark;
+        } else {
+          // copy value to workspace
+          x[i] = avalues[k];
+        }
+      } else {
+        // i exists in C already
+        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);
+        // function was called on current row
+        u[i] = mark;
+      }
+    }
+  } else {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k];
+      // check value exists in current j
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark;
+        // add i to pattern of C
+        cindex.push(i);
+      } else {
+        // indicate function was called on current row
+        u[i] = mark;
+      }
+    }
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/complex.js b/node_modules/mathjs/lib/cjs/utils/complex.js
new file mode 100644
index 0000000..6302cf8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/complex.js
@@ -0,0 +1,19 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.complexEquals = complexEquals;
+var _number = require("./number.js");
+/**
+ * Test whether two complex values are equal provided a given relTol and absTol.
+ * Does not use or change the global Complex.EPSILON setting
+ * @param {Complex} x - The first complex number for comparison.
+ * @param {Complex} y - The second complex number for comparison.
+ * @param {number} relTol - The relative tolerance for comparison.
+ * @param {number} absTol - The absolute tolerance for comparison.
+ * @returns {boolean} - Returns true if the two complex numbers are equal within the given tolerances, otherwise returns false.
+ */
+function complexEquals(x, y, relTol, absTol) {
+  return (0, _number.nearlyEqual)(x.re, y.re, relTol, absTol) && (0, _number.nearlyEqual)(x.im, y.im, relTol, absTol);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/customs.js b/node_modules/mathjs/lib/cjs/utils/customs.js
new file mode 100644
index 0000000..1d03b5e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/customs.js
@@ -0,0 +1,151 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.getSafeMethod = getSafeMethod;
+exports.getSafeProperty = getSafeProperty;
+exports.isPlainObject = isPlainObject;
+exports.isSafeMethod = isSafeMethod;
+exports.isSafeProperty = isSafeProperty;
+exports.setSafeProperty = setSafeProperty;
+var _object = require("./object.js");
+/**
+ * Get a property of a plain object
+ * Throws an error in case the object is not a plain object or the
+ * property is not defined on the object itself
+ * @param {Object} object
+ * @param {string} prop
+ * @return {*} Returns the property value when safe
+ */
+function getSafeProperty(object, prop) {
+  // only allow getting safe properties of a plain object
+  if (isSafeProperty(object, prop)) {
+    return object[prop];
+  }
+  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {
+    throw new Error('Cannot access method "' + prop + '" as a property');
+  }
+  throw new Error('No access to property "' + prop + '"');
+}
+
+/**
+ * Set a property on a plain object.
+ * Throws an error in case the object is not a plain object or the
+ * property would override an inherited property like .constructor or .toString
+ * @param {Object} object
+ * @param {string} prop
+ * @param {*} value
+ * @return {*} Returns the value
+ */
+// TODO: merge this function into access.js?
+function setSafeProperty(object, prop, value) {
+  // only allow setting safe properties of a plain object
+  if (isSafeProperty(object, prop)) {
+    object[prop] = value;
+    return value;
+  }
+  throw new Error('No access to property "' + prop + '"');
+}
+
+/**
+ * Test whether a property is safe to use on an object or Array.
+ * For example .toString and .constructor are not safe
+ * @param {Object | Array} object
+ * @param {string} prop
+ * @return {boolean} Returns true when safe
+ */
+function isSafeProperty(object, prop) {
+  if (!isPlainObject(object) && !Array.isArray(object)) {
+    return false;
+  }
+  // SAFE: whitelisted
+  // e.g length
+  if ((0, _object.hasOwnProperty)(safeNativeProperties, prop)) {
+    return true;
+  }
+  // UNSAFE: inherited from Object prototype
+  // e.g constructor
+  if (prop in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  }
+  // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+  if (prop in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+  return true;
+}
+
+/**
+ * Validate whether a method is safe.
+ * Throws an error when that's not the case.
+ * @param {Object} object
+ * @param {string} method
+ * @return {function} Returns the method when valid
+ */
+function getSafeMethod(object, method) {
+  if (!isSafeMethod(object, method)) {
+    throw new Error('No access to method "' + method + '"');
+  }
+  return object[method];
+}
+
+/**
+ * Check whether a method is safe.
+ * Throws an error when that's not the case (for example for `constructor`).
+ * @param {Object} object
+ * @param {string} method
+ * @return {boolean} Returns true when safe, false otherwise
+ */
+function isSafeMethod(object, method) {
+  if (object === null || object === undefined || typeof object[method] !== 'function') {
+    return false;
+  }
+  // UNSAFE: ghosted
+  // e.g overridden toString
+  // Note that IE10 doesn't support __proto__ and we can't do this check there.
+  if ((0, _object.hasOwnProperty)(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {
+    return false;
+  }
+  // SAFE: whitelisted
+  // e.g toString
+  if ((0, _object.hasOwnProperty)(safeNativeMethods, method)) {
+    return true;
+  }
+  // UNSAFE: inherited from Object prototype
+  // e.g constructor
+  if (method in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  }
+  // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+  if (method in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+  return true;
+}
+function isPlainObject(object) {
+  return typeof object === 'object' && object && object.constructor === Object;
+}
+const safeNativeProperties = {
+  length: true,
+  name: true
+};
+const safeNativeMethods = {
+  toString: true,
+  valueOf: true,
+  toLocaleString: true
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/emitter.js b/node_modules/mathjs/lib/cjs/utils/emitter.js
new file mode 100644
index 0000000..17d650d
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/emitter.js
@@ -0,0 +1,24 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.mixin = mixin;
+var _tinyEmitter = _interopRequireDefault(require("tiny-emitter"));
+/**
+ * Extend given object with emitter functions `on`, `off`, `once`, `emit`
+ * @param {Object} obj
+ * @return {Object} obj
+ */
+function mixin(obj) {
+  // create event emitter
+  const emitter = new _tinyEmitter.default();
+
+  // bind methods to obj (we don't want to expose the emitter.e Array...)
+  obj.on = emitter.on.bind(emitter);
+  obj.off = emitter.off.bind(emitter);
+  obj.once = emitter.once.bind(emitter);
+  obj.emit = emitter.emit.bind(emitter);
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/factory.js b/node_modules/mathjs/lib/cjs/utils/factory.js
new file mode 100644
index 0000000..5e2cefc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/factory.js
@@ -0,0 +1,140 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.assertDependencies = assertDependencies;
+exports.create = create;
+exports.factory = factory;
+exports.isFactory = isFactory;
+exports.isOptionalDependency = isOptionalDependency;
+exports.sortFactories = sortFactories;
+exports.stripOptionalNotation = stripOptionalNotation;
+var _object = require("./object.js");
+/**
+ * Create a factory function, which can be used to inject dependencies.
+ *
+ * The created functions are memoized, a consecutive call of the factory
+ * with the exact same inputs will return the same function instance.
+ * The memoized cache is exposed on `factory.cache` and can be cleared
+ * if needed.
+ *
+ * Example:
+ *
+ *     const name = 'log'
+ *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']
+ *
+ *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {
+ *       // ... create the function log here and return it
+ *     }
+ *
+ * @param {string} name           Name of the function to be created
+ * @param {string[]} dependencies The names of all required dependencies
+ * @param {function} create       Callback function called with an object with all dependencies
+ * @param {Object} [meta]
+ *     Optional object with meta information that will be attached
+ *     to the created factory function as property `meta`. For explanation
+ *     of what meta properties can be specified and what they mean, see
+ *     docs/core/extension.md.
+ * @returns {function}
+ */
+function factory(name, dependencies, create, meta) {
+  function assertAndCreate(scope) {
+    // we only pass the requested dependencies to the factory function
+    // to prevent functions to rely on dependencies that are not explicitly
+    // requested.
+    const deps = (0, _object.pickShallow)(scope, dependencies.map(stripOptionalNotation));
+    assertDependencies(name, dependencies, scope);
+    return create(deps);
+  }
+  assertAndCreate.isFactory = true;
+  assertAndCreate.fn = name;
+  assertAndCreate.dependencies = dependencies.slice().sort();
+  if (meta) {
+    assertAndCreate.meta = meta;
+  }
+  return assertAndCreate;
+}
+
+/**
+ * Sort all factories such that when loading in order, the dependencies are resolved.
+ *
+ * @param {Array} factories
+ * @returns {Array} Returns a new array with the sorted factories.
+ */
+function sortFactories(factories) {
+  const factoriesByName = {};
+  factories.forEach(factory => {
+    factoriesByName[factory.fn] = factory;
+  });
+  function containsDependency(factory, dependency) {
+    // TODO: detect circular references
+    if (isFactory(factory)) {
+      if (factory.dependencies.includes(dependency.fn || dependency.name)) {
+        return true;
+      }
+      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {
+        return true;
+      }
+    }
+    return false;
+  }
+  const sorted = [];
+  function addFactory(factory) {
+    let index = 0;
+    while (index < sorted.length && !containsDependency(sorted[index], factory)) {
+      index++;
+    }
+    sorted.splice(index, 0, factory);
+  }
+
+  // sort regular factory functions
+  factories.filter(isFactory).forEach(addFactory);
+
+  // sort legacy factory functions AFTER the regular factory functions
+  factories.filter(factory => !isFactory(factory)).forEach(addFactory);
+  return sorted;
+}
+
+// TODO: comment or cleanup if unused in the end
+function create(factories) {
+  let scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  sortFactories(factories).forEach(factory => factory(scope));
+  return scope;
+}
+
+/**
+ * Test whether an object is a factory. This is the case when it has
+ * properties name, dependencies, and a function create.
+ * @param {*} obj
+ * @returns {boolean}
+ */
+function isFactory(obj) {
+  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);
+}
+
+/**
+ * Assert that all dependencies of a list with dependencies are available in the provided scope.
+ *
+ * Will throw an exception when there are dependencies missing.
+ *
+ * @param {string} name   Name for the function to be created. Used to generate a useful error message
+ * @param {string[]} dependencies
+ * @param {Object} scope
+ */
+function assertDependencies(name, dependencies, scope) {
+  const allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals
+  .every(dependency => scope[dependency] !== undefined);
+  if (!allDefined) {
+    const missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);
+
+    // TODO: create a custom error class for this, a MathjsError or something like that
+    throw new Error(`Cannot create function "${name}", ` + `some dependencies are missing: ${missingDependencies.map(d => `"${d}"`).join(', ')}.`);
+  }
+}
+function isOptionalDependency(dependency) {
+  return dependency && dependency[0] === '?';
+}
+function stripOptionalNotation(dependency) {
+  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/function.js b/node_modules/mathjs/lib/cjs/utils/function.js
new file mode 100644
index 0000000..36e5053
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/function.js
@@ -0,0 +1,92 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.memoize = memoize;
+exports.memoizeCompare = memoizeCompare;
+var _lruQueue = require("./lruQueue.js");
+// function utils
+
+/**
+ * Memoize a given function by caching the computed result.
+ * The cache of a memoized function can be cleared by deleting the `cache`
+ * property of the function.
+ *
+ * @param {function} fn                     The function to be memoized.
+ *                                          Must be a pure function.
+ * @param {Object} [options]
+ * @param {function(args: Array): string} [options.hasher]
+ *    A custom hash builder. Is JSON.stringify by default.
+ * @param {number | undefined} [options.limit]
+ *    Maximum number of values that may be cached. Undefined indicates
+ *    unlimited (default)
+ * @return {function}                       Returns the memoized function
+ */
+function memoize(fn) {
+  let {
+    hasher,
+    limit
+  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  limit = limit == null ? Number.POSITIVE_INFINITY : limit;
+  hasher = hasher == null ? JSON.stringify : hasher;
+  return function memoize() {
+    if (typeof memoize.cache !== 'object') {
+      memoize.cache = {
+        values: new Map(),
+        lru: (0, _lruQueue.lruQueue)(limit || Number.POSITIVE_INFINITY)
+      };
+    }
+    const args = [];
+    for (let i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+    const hash = hasher(args);
+    if (memoize.cache.values.has(hash)) {
+      memoize.cache.lru.hit(hash);
+      return memoize.cache.values.get(hash);
+    }
+    const newVal = fn.apply(fn, args);
+    memoize.cache.values.set(hash, newVal);
+    memoize.cache.values.delete(memoize.cache.lru.hit(hash));
+    return newVal;
+  };
+}
+
+/**
+ * Memoize a given function by caching all results and the arguments,
+ * and comparing against the arguments of previous results before
+ * executing again.
+ * This is less performant than `memoize` which calculates a hash,
+ * which is very fast to compare. Use `memoizeCompare` only when it is
+ * not possible to create a unique serializable hash from the function
+ * arguments.
+ * The isEqual function must compare two sets of arguments
+ * and return true when equal (can be a deep equality check for example).
+ * @param {function} fn
+ * @param {function(a: *, b: *) : boolean} isEqual
+ * @returns {function}
+ */
+function memoizeCompare(fn, isEqual) {
+  const memoize = function memoize() {
+    const args = [];
+    for (let i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+    for (let c = 0; c < memoize.cache.length; c++) {
+      const cached = memoize.cache[c];
+      if (isEqual(args, cached.args)) {
+        // TODO: move this cache entry to the top so recently used entries move up?
+        return cached.res;
+      }
+    }
+    const res = fn.apply(fn, args);
+    memoize.cache.unshift({
+      args,
+      res
+    });
+    return res;
+  };
+  memoize.cache = [];
+  return memoize;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/is.js b/node_modules/mathjs/lib/cjs/utils/is.js
new file mode 100644
index 0000000..e23b2b6
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/is.js
@@ -0,0 +1,245 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isAccessorNode = isAccessorNode;
+exports.isArray = void 0;
+exports.isArrayNode = isArrayNode;
+exports.isAssignmentNode = isAssignmentNode;
+exports.isBigInt = isBigInt;
+exports.isBigNumber = isBigNumber;
+exports.isBlockNode = isBlockNode;
+exports.isBoolean = isBoolean;
+exports.isChain = isChain;
+exports.isCollection = isCollection;
+exports.isComplex = isComplex;
+exports.isConditionalNode = isConditionalNode;
+exports.isConstantNode = isConstantNode;
+exports.isDate = isDate;
+exports.isDenseMatrix = isDenseMatrix;
+exports.isFraction = isFraction;
+exports.isFunction = isFunction;
+exports.isFunctionAssignmentNode = isFunctionAssignmentNode;
+exports.isFunctionNode = isFunctionNode;
+exports.isHelp = isHelp;
+exports.isIndex = isIndex;
+exports.isIndexNode = isIndexNode;
+exports.isMap = isMap;
+exports.isMatrix = isMatrix;
+exports.isNode = isNode;
+exports.isNull = isNull;
+exports.isNumber = isNumber;
+exports.isObject = isObject;
+exports.isObjectNode = isObjectNode;
+exports.isObjectWrappingMap = isObjectWrappingMap;
+exports.isOperatorNode = isOperatorNode;
+exports.isParenthesisNode = isParenthesisNode;
+exports.isPartitionedMap = isPartitionedMap;
+exports.isRange = isRange;
+exports.isRangeNode = isRangeNode;
+exports.isRegExp = isRegExp;
+exports.isRelationalNode = isRelationalNode;
+exports.isResultSet = isResultSet;
+exports.isSparseMatrix = isSparseMatrix;
+exports.isString = isString;
+exports.isSymbolNode = isSymbolNode;
+exports.isUndefined = isUndefined;
+exports.isUnit = isUnit;
+exports.rule2Node = rule2Node;
+exports.typeOf = typeOf;
+var _map = require("./map.js");
+// type checks for all known types
+//
+// note that:
+//
+// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.
+//   instanceof cannot be used because that would not allow to pass data from
+//   one instance of math.js to another since each has it's own instance of Unit.
+// - check the `isUnit` property via the constructor, so there will be no
+//   matches for "fake" instances like plain objects with a property `isUnit`.
+//   That is important for security reasons.
+// - It must not be possible to override the type checks used internally,
+//   for security reasons, so these functions are not exposed in the expression
+//   parser.
+
+function isNumber(x) {
+  return typeof x === 'number';
+}
+function isBigNumber(x) {
+  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {
+    return false;
+  }
+  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {
+    return true;
+  }
+  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {
+    return true;
+  }
+  return false;
+}
+function isBigInt(x) {
+  return typeof x === 'bigint';
+}
+function isComplex(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
+}
+function isFraction(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;
+}
+function isUnit(x) {
+  return x && x.constructor.prototype.isUnit === true || false;
+}
+function isString(x) {
+  return typeof x === 'string';
+}
+const isArray = exports.isArray = Array.isArray;
+function isMatrix(x) {
+  return x && x.constructor.prototype.isMatrix === true || false;
+}
+
+/**
+ * Test whether a value is a collection: an Array or Matrix
+ * @param {*} x
+ * @returns {boolean} isCollection
+ */
+function isCollection(x) {
+  return Array.isArray(x) || isMatrix(x);
+}
+function isDenseMatrix(x) {
+  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+function isSparseMatrix(x) {
+  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+function isRange(x) {
+  return x && x.constructor.prototype.isRange === true || false;
+}
+function isIndex(x) {
+  return x && x.constructor.prototype.isIndex === true || false;
+}
+function isBoolean(x) {
+  return typeof x === 'boolean';
+}
+function isResultSet(x) {
+  return x && x.constructor.prototype.isResultSet === true || false;
+}
+function isHelp(x) {
+  return x && x.constructor.prototype.isHelp === true || false;
+}
+function isFunction(x) {
+  return typeof x === 'function';
+}
+function isDate(x) {
+  return x instanceof Date;
+}
+function isRegExp(x) {
+  return x instanceof RegExp;
+}
+function isObject(x) {
+  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));
+}
+
+/**
+ * Returns `true` if the passed object appears to be a Map (i.e. duck typing).
+ *
+ * Methods looked for are `get`, `set`, `keys` and `has`.
+ *
+ * @param {Map | object} object
+ * @returns
+ */
+function isMap(object) {
+  // We can use the fast instanceof, or a slower duck typing check.
+  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.
+  if (!object) {
+    return false;
+  }
+  return object instanceof Map || object instanceof _map.ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';
+}
+function isPartitionedMap(object) {
+  return isMap(object) && isMap(object.a) && isMap(object.b);
+}
+function isObjectWrappingMap(object) {
+  return isMap(object) && isObject(object.wrappedObject);
+}
+function isNull(x) {
+  return x === null;
+}
+function isUndefined(x) {
+  return x === undefined;
+}
+function isAccessorNode(x) {
+  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isArrayNode(x) {
+  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isAssignmentNode(x) {
+  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isBlockNode(x) {
+  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isConditionalNode(x) {
+  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isConstantNode(x) {
+  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+/* Very specialized: returns true for those nodes which in the numerator of
+   a fraction means that the division in that fraction has precedence over implicit
+   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but
+   6!/8 x parses as 6! / (8x). It is located here because it is shared between
+   parse.js and OperatorNode.js (for parsing and printing, respectively).
+
+   This should *not* be exported from mathjs, unlike most of the tests here.
+   Its name does not start with 'is' to prevent utils/snapshot.js from thinking
+   it should be exported.
+*/
+function rule2Node(node) {
+  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);
+}
+function isFunctionAssignmentNode(x) {
+  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isFunctionNode(x) {
+  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isIndexNode(x) {
+  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isNode(x) {
+  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isObjectNode(x) {
+  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isOperatorNode(x) {
+  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isParenthesisNode(x) {
+  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isRangeNode(x) {
+  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isRelationalNode(x) {
+  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isSymbolNode(x) {
+  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;
+}
+function isChain(x) {
+  return x && x.constructor.prototype.isChain === true || false;
+}
+function typeOf(x) {
+  const t = typeof x;
+  if (t === 'object') {
+    if (x === null) return 'null';
+    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal
+    if (x.constructor && x.constructor.name) return x.constructor.name;
+    return 'Object'; // just in case
+  }
+  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/latex.js b/node_modules/mathjs/lib/cjs/utils/latex.js
new file mode 100644
index 0000000..0a5e352
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/latex.js
@@ -0,0 +1,500 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.defaultTemplate = void 0;
+exports.escapeLatex = escapeLatex;
+exports.latexSymbols = exports.latexOperators = exports.latexFunctions = void 0;
+exports.toSymbol = toSymbol;
+var _escapeLatex = _interopRequireDefault(require("escape-latex"));
+var _object = require("./object.js");
+/* eslint no-template-curly-in-string: "off" */
+
+const latexSymbols = exports.latexSymbols = {
+  // GREEK LETTERS
+  Alpha: 'A',
+  alpha: '\\alpha',
+  Beta: 'B',
+  beta: '\\beta',
+  Gamma: '\\Gamma',
+  gamma: '\\gamma',
+  Delta: '\\Delta',
+  delta: '\\delta',
+  Epsilon: 'E',
+  epsilon: '\\epsilon',
+  varepsilon: '\\varepsilon',
+  Zeta: 'Z',
+  zeta: '\\zeta',
+  Eta: 'H',
+  eta: '\\eta',
+  Theta: '\\Theta',
+  theta: '\\theta',
+  vartheta: '\\vartheta',
+  Iota: 'I',
+  iota: '\\iota',
+  Kappa: 'K',
+  kappa: '\\kappa',
+  varkappa: '\\varkappa',
+  Lambda: '\\Lambda',
+  lambda: '\\lambda',
+  Mu: 'M',
+  mu: '\\mu',
+  Nu: 'N',
+  nu: '\\nu',
+  Xi: '\\Xi',
+  xi: '\\xi',
+  Omicron: 'O',
+  omicron: 'o',
+  Pi: '\\Pi',
+  pi: '\\pi',
+  varpi: '\\varpi',
+  Rho: 'P',
+  rho: '\\rho',
+  varrho: '\\varrho',
+  Sigma: '\\Sigma',
+  sigma: '\\sigma',
+  varsigma: '\\varsigma',
+  Tau: 'T',
+  tau: '\\tau',
+  Upsilon: '\\Upsilon',
+  upsilon: '\\upsilon',
+  Phi: '\\Phi',
+  phi: '\\phi',
+  varphi: '\\varphi',
+  Chi: 'X',
+  chi: '\\chi',
+  Psi: '\\Psi',
+  psi: '\\psi',
+  Omega: '\\Omega',
+  omega: '\\omega',
+  // logic
+  true: '\\mathrm{True}',
+  false: '\\mathrm{False}',
+  // other
+  i: 'i',
+  // TODO use \i ??
+  inf: '\\infty',
+  Inf: '\\infty',
+  infinity: '\\infty',
+  Infinity: '\\infty',
+  oo: '\\infty',
+  lim: '\\lim',
+  undefined: '\\mathbf{?}'
+};
+const latexOperators = exports.latexOperators = {
+  transpose: '^\\top',
+  ctranspose: '^H',
+  factorial: '!',
+  pow: '^',
+  dotPow: '.^\\wedge',
+  // TODO find ideal solution
+  unaryPlus: '+',
+  unaryMinus: '-',
+  bitNot: '\\~',
+  // TODO find ideal solution
+  not: '\\neg',
+  multiply: '\\cdot',
+  divide: '\\frac',
+  // TODO how to handle that properly?
+  dotMultiply: '.\\cdot',
+  // TODO find ideal solution
+  dotDivide: '.:',
+  // TODO find ideal solution
+  mod: '\\mod',
+  add: '+',
+  subtract: '-',
+  to: '\\rightarrow',
+  leftShift: '<<',
+  rightArithShift: '>>',
+  rightLogShift: '>>>',
+  equal: '=',
+  unequal: '\\neq',
+  smaller: '<',
+  larger: '>',
+  smallerEq: '\\leq',
+  largerEq: '\\geq',
+  bitAnd: '\\&',
+  bitXor: '\\underline{|}',
+  bitOr: '|',
+  and: '\\wedge',
+  xor: '\\veebar',
+  or: '\\vee'
+};
+const latexFunctions = exports.latexFunctions = {
+  // arithmetic
+  abs: {
+    1: '\\left|${args[0]}\\right|'
+  },
+  add: {
+    2: `\\left(\${args[0]}${latexOperators.add}\${args[1]}\\right)`
+  },
+  cbrt: {
+    1: '\\sqrt[3]{${args[0]}}'
+  },
+  ceil: {
+    1: '\\left\\lceil${args[0]}\\right\\rceil'
+  },
+  cube: {
+    1: '\\left(${args[0]}\\right)^3'
+  },
+  divide: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  dotDivide: {
+    2: `\\left(\${args[0]}${latexOperators.dotDivide}\${args[1]}\\right)`
+  },
+  dotMultiply: {
+    2: `\\left(\${args[0]}${latexOperators.dotMultiply}\${args[1]}\\right)`
+  },
+  dotPow: {
+    2: `\\left(\${args[0]}${latexOperators.dotPow}\${args[1]}\\right)`
+  },
+  exp: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  expm1: `\\left(e${latexOperators.pow}{\${args[0]}}-1\\right)`,
+  fix: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  floor: {
+    1: '\\left\\lfloor${args[0]}\\right\\rfloor'
+  },
+  fraction: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  gcd: '\\gcd\\left(${args}\\right)',
+  hypot: '\\hypot\\left(${args}\\right)',
+  log: {
+    1: '\\ln\\left(${args[0]}\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}\\right)'
+  },
+  log10: {
+    1: '\\log_{10}\\left(${args[0]}\\right)'
+  },
+  log1p: {
+    1: '\\ln\\left(${args[0]}+1\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}+1\\right)'
+  },
+  log2: '\\log_{2}\\left(${args[0]}\\right)',
+  mod: {
+    2: `\\left(\${args[0]}${latexOperators.mod}\${args[1]}\\right)`
+  },
+  multiply: {
+    2: `\\left(\${args[0]}${latexOperators.multiply}\${args[1]}\\right)`
+  },
+  norm: {
+    1: '\\left\\|${args[0]}\\right\\|',
+    2: undefined // use default template
+  },
+  nthRoot: {
+    2: '\\sqrt[${args[1]}]{${args[0]}}'
+  },
+  nthRoots: {
+    2: '\\{y : y^${args[1]} = {${args[0]}}\\}'
+  },
+  pow: {
+    2: `\\left(\${args[0]}\\right)${latexOperators.pow}{\${args[1]}}`
+  },
+  round: {
+    1: '\\left\\lfloor${args[0]}\\right\\rceil',
+    2: undefined // use default template
+  },
+  sign: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  sqrt: {
+    1: '\\sqrt{${args[0]}}'
+  },
+  square: {
+    1: '\\left(${args[0]}\\right)^2'
+  },
+  subtract: {
+    2: `\\left(\${args[0]}${latexOperators.subtract}\${args[1]}\\right)`
+  },
+  unaryMinus: {
+    1: `${latexOperators.unaryMinus}\\left(\${args[0]}\\right)`
+  },
+  unaryPlus: {
+    1: `${latexOperators.unaryPlus}\\left(\${args[0]}\\right)`
+  },
+  // bitwise
+  bitAnd: {
+    2: `\\left(\${args[0]}${latexOperators.bitAnd}\${args[1]}\\right)`
+  },
+  bitNot: {
+    1: latexOperators.bitNot + '\\left(${args[0]}\\right)'
+  },
+  bitOr: {
+    2: `\\left(\${args[0]}${latexOperators.bitOr}\${args[1]}\\right)`
+  },
+  bitXor: {
+    2: `\\left(\${args[0]}${latexOperators.bitXor}\${args[1]}\\right)`
+  },
+  leftShift: {
+    2: `\\left(\${args[0]}${latexOperators.leftShift}\${args[1]}\\right)`
+  },
+  rightArithShift: {
+    2: `\\left(\${args[0]}${latexOperators.rightArithShift}\${args[1]}\\right)`
+  },
+  rightLogShift: {
+    2: `\\left(\${args[0]}${latexOperators.rightLogShift}\${args[1]}\\right)`
+  },
+  // combinatorics
+  bellNumbers: {
+    1: '\\mathrm{B}_{${args[0]}}'
+  },
+  catalan: {
+    1: '\\mathrm{C}_{${args[0]}}'
+  },
+  stirlingS2: {
+    2: '\\mathrm{S}\\left(${args}\\right)'
+  },
+  // complex
+  arg: {
+    1: '\\arg\\left(${args[0]}\\right)'
+  },
+  conj: {
+    1: '\\left(${args[0]}\\right)^*'
+  },
+  im: {
+    1: '\\Im\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  re: {
+    1: '\\Re\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  // logical
+  and: {
+    2: `\\left(\${args[0]}${latexOperators.and}\${args[1]}\\right)`
+  },
+  not: {
+    1: latexOperators.not + '\\left(${args[0]}\\right)'
+  },
+  or: {
+    2: `\\left(\${args[0]}${latexOperators.or}\${args[1]}\\right)`
+  },
+  xor: {
+    2: `\\left(\${args[0]}${latexOperators.xor}\${args[1]}\\right)`
+  },
+  // matrix
+  cross: {
+    2: '\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)'
+  },
+  ctranspose: {
+    1: `\\left(\${args[0]}\\right)${latexOperators.ctranspose}`
+  },
+  det: {
+    1: '\\det\\left(${args[0]}\\right)'
+  },
+  dot: {
+    2: '\\left(${args[0]}\\cdot${args[1]}\\right)'
+  },
+  expm: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  inv: {
+    1: '\\left(${args[0]}\\right)^{-1}'
+  },
+  pinv: {
+    1: '\\left(${args[0]}\\right)^{+}'
+  },
+  sqrtm: {
+    1: `{\${args[0]}}${latexOperators.pow}{\\frac{1}{2}}`
+  },
+  trace: {
+    1: '\\mathrm{tr}\\left(${args[0]}\\right)'
+  },
+  transpose: {
+    1: `\\left(\${args[0]}\\right)${latexOperators.transpose}`
+  },
+  // probability
+  combinations: {
+    2: '\\binom{${args[0]}}{${args[1]}}'
+  },
+  combinationsWithRep: {
+    2: '\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)'
+  },
+  factorial: {
+    1: `\\left(\${args[0]}\\right)${latexOperators.factorial}`
+  },
+  gamma: {
+    1: '\\Gamma\\left(${args[0]}\\right)'
+  },
+  lgamma: {
+    1: '\\ln\\Gamma\\left(${args[0]}\\right)'
+  },
+  // relational
+  equal: {
+    2: `\\left(\${args[0]}${latexOperators.equal}\${args[1]}\\right)`
+  },
+  larger: {
+    2: `\\left(\${args[0]}${latexOperators.larger}\${args[1]}\\right)`
+  },
+  largerEq: {
+    2: `\\left(\${args[0]}${latexOperators.largerEq}\${args[1]}\\right)`
+  },
+  smaller: {
+    2: `\\left(\${args[0]}${latexOperators.smaller}\${args[1]}\\right)`
+  },
+  smallerEq: {
+    2: `\\left(\${args[0]}${latexOperators.smallerEq}\${args[1]}\\right)`
+  },
+  unequal: {
+    2: `\\left(\${args[0]}${latexOperators.unequal}\${args[1]}\\right)`
+  },
+  // special
+  erf: {
+    1: 'erf\\left(${args[0]}\\right)'
+  },
+  // statistics
+  max: '\\max\\left(${args}\\right)',
+  min: '\\min\\left(${args}\\right)',
+  variance: '\\mathrm{Var}\\left(${args}\\right)',
+  // trigonometry
+  acos: {
+    1: '\\cos^{-1}\\left(${args[0]}\\right)'
+  },
+  acosh: {
+    1: '\\cosh^{-1}\\left(${args[0]}\\right)'
+  },
+  acot: {
+    1: '\\cot^{-1}\\left(${args[0]}\\right)'
+  },
+  acoth: {
+    1: '\\coth^{-1}\\left(${args[0]}\\right)'
+  },
+  acsc: {
+    1: '\\csc^{-1}\\left(${args[0]}\\right)'
+  },
+  acsch: {
+    1: '\\mathrm{csch}^{-1}\\left(${args[0]}\\right)'
+  },
+  asec: {
+    1: '\\sec^{-1}\\left(${args[0]}\\right)'
+  },
+  asech: {
+    1: '\\mathrm{sech}^{-1}\\left(${args[0]}\\right)'
+  },
+  asin: {
+    1: '\\sin^{-1}\\left(${args[0]}\\right)'
+  },
+  asinh: {
+    1: '\\sinh^{-1}\\left(${args[0]}\\right)'
+  },
+  atan: {
+    1: '\\tan^{-1}\\left(${args[0]}\\right)'
+  },
+  atan2: {
+    2: '\\mathrm{atan2}\\left(${args}\\right)'
+  },
+  atanh: {
+    1: '\\tanh^{-1}\\left(${args[0]}\\right)'
+  },
+  cos: {
+    1: '\\cos\\left(${args[0]}\\right)'
+  },
+  cosh: {
+    1: '\\cosh\\left(${args[0]}\\right)'
+  },
+  cot: {
+    1: '\\cot\\left(${args[0]}\\right)'
+  },
+  coth: {
+    1: '\\coth\\left(${args[0]}\\right)'
+  },
+  csc: {
+    1: '\\csc\\left(${args[0]}\\right)'
+  },
+  csch: {
+    1: '\\mathrm{csch}\\left(${args[0]}\\right)'
+  },
+  sec: {
+    1: '\\sec\\left(${args[0]}\\right)'
+  },
+  sech: {
+    1: '\\mathrm{sech}\\left(${args[0]}\\right)'
+  },
+  sin: {
+    1: '\\sin\\left(${args[0]}\\right)'
+  },
+  sinh: {
+    1: '\\sinh\\left(${args[0]}\\right)'
+  },
+  tan: {
+    1: '\\tan\\left(${args[0]}\\right)'
+  },
+  tanh: {
+    1: '\\tanh\\left(${args[0]}\\right)'
+  },
+  // unit
+  to: {
+    2: `\\left(\${args[0]}${latexOperators.to}\${args[1]}\\right)`
+  },
+  // utils
+  numeric: function (node, options) {
+    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.
+    return node.args[0].toTex();
+  },
+  // type
+  number: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  },
+  string: {
+    0: '\\mathtt{""}',
+    1: '\\mathrm{string}\\left(${args[0]}\\right)'
+  },
+  bignumber: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  bigint: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  complex: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: `\\left(\\left(\${args[0]}\\right)+${latexSymbols.i}\\cdot\\left(\${args[1]}\\right)\\right)`
+  },
+  matrix: {
+    0: '\\begin{bmatrix}\\end{bmatrix}',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(${args[0]}\\right)'
+  },
+  sparse: {
+    0: '\\begin{bsparse}\\end{bsparse}',
+    1: '\\left(${args[0]}\\right)'
+  },
+  unit: {
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  }
+};
+const defaultTemplate = exports.defaultTemplate = '\\mathrm{${name}}\\left(${args}\\right)';
+const latexUnits = {
+  deg: '^\\circ'
+};
+function escapeLatex(string) {
+  return (0, _escapeLatex.default)(string, {
+    preserveFormatting: true
+  });
+}
+
+// @param {string} name
+// @param {boolean} isUnit
+function toSymbol(name, isUnit) {
+  isUnit = typeof isUnit === 'undefined' ? false : isUnit;
+  if (isUnit) {
+    if ((0, _object.hasOwnProperty)(latexUnits, name)) {
+      return latexUnits[name];
+    }
+    return '\\mathrm{' + escapeLatex(name) + '}';
+  }
+  if ((0, _object.hasOwnProperty)(latexSymbols, name)) {
+    return latexSymbols[name];
+  }
+  return escapeLatex(name);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/log.js b/node_modules/mathjs/lib/cjs/utils/log.js
new file mode 100644
index 0000000..53705bc
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/log.js
@@ -0,0 +1,22 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.warnOnce = void 0;
+/**
+ * Log a console.warn message only once
+ */
+const warnOnce = exports.warnOnce = (() => {
+  const messages = {};
+  return function warnOnce() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    const message = args.join(', ');
+    if (!messages[message]) {
+      messages[message] = true;
+      console.warn('Warning:', ...args);
+    }
+  };
+})();
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/lruQueue.js b/node_modules/mathjs/lib/cjs/utils/lruQueue.js
new file mode 100644
index 0000000..4f8534e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/lruQueue.js
@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.lruQueue = lruQueue;
+// (c) 2018, Mariusz Nowak
+// SPDX-License-Identifier: ISC
+// Derived from https://github.com/medikoo/lru-queue
+function lruQueue(limit) {
+  let size = 0;
+  let base = 1;
+  let queue = Object.create(null);
+  let map = Object.create(null);
+  let index = 0;
+  const del = function (id) {
+    const oldIndex = map[id];
+    if (!oldIndex) return;
+    delete queue[oldIndex];
+    delete map[id];
+    --size;
+    if (base !== oldIndex) return;
+    if (!size) {
+      index = 0;
+      base = 1;
+      return;
+    }
+    while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}
+  };
+  limit = Math.abs(limit);
+  return {
+    hit: function (id) {
+      const oldIndex = map[id];
+      const nuIndex = ++index;
+      queue[nuIndex] = id;
+      map[id] = nuIndex;
+      if (!oldIndex) {
+        ++size;
+        if (size <= limit) return undefined;
+        id = queue[base];
+        del(id);
+        return id;
+      }
+      delete queue[oldIndex];
+      if (base !== oldIndex) return undefined;
+      while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}
+      return undefined;
+    },
+    delete: del,
+    clear: function () {
+      size = index = 0;
+      base = 1;
+      queue = Object.create(null);
+      map = Object.create(null);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/map.js b/node_modules/mathjs/lib/cjs/utils/map.js
new file mode 100644
index 0000000..b66191c
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/map.js
@@ -0,0 +1,214 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.PartitionedMap = exports.ObjectWrappingMap = void 0;
+exports.assign = assign;
+exports.createEmptyMap = createEmptyMap;
+exports.createMap = createMap;
+exports.toObject = toObject;
+var _customs = require("./customs.js");
+var _is = require("./is.js");
+/**
+ * A map facade on a bare object.
+ *
+ * The small number of methods needed to implement a scope,
+ * forwarding on to the SafeProperty functions. Over time, the codebase
+ * will stop using this method, as all objects will be Maps, rather than
+ * more security prone objects.
+ */
+class ObjectWrappingMap {
+  constructor(object) {
+    this.wrappedObject = object;
+    this[Symbol.iterator] = this.entries;
+  }
+  keys() {
+    return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();
+  }
+  get(key) {
+    return (0, _customs.getSafeProperty)(this.wrappedObject, key);
+  }
+  set(key, value) {
+    (0, _customs.setSafeProperty)(this.wrappedObject, key, value);
+    return this;
+  }
+  has(key) {
+    return (0, _customs.isSafeProperty)(this.wrappedObject, key) && key in this.wrappedObject;
+  }
+  entries() {
+    return mapIterator(this.keys(), key => [key, this.get(key)]);
+  }
+  forEach(callback) {
+    for (const key of this.keys()) {
+      callback(this.get(key), key, this);
+    }
+  }
+  delete(key) {
+    if ((0, _customs.isSafeProperty)(this.wrappedObject, key)) {
+      delete this.wrappedObject[key];
+    }
+  }
+  clear() {
+    for (const key of this.keys()) {
+      this.delete(key);
+    }
+  }
+  get size() {
+    return Object.keys(this.wrappedObject).length;
+  }
+}
+
+/**
+ * Create a map with two partitions: a and b.
+ * The set with bKeys determines which keys/values are read/written to map b,
+ * all other values are read/written to map a
+ *
+ * For example:
+ *
+ *   const a = new Map()
+ *   const b = new Map()
+ *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))
+ *
+ * In this case, values `x` and `y` are read/written to map `b`,
+ * all other values are read/written to map `a`.
+ */
+exports.ObjectWrappingMap = ObjectWrappingMap;
+class PartitionedMap {
+  /**
+   * @param {Map} a
+   * @param {Map} b
+   * @param {Set} bKeys
+   */
+  constructor(a, b, bKeys) {
+    this.a = a;
+    this.b = b;
+    this.bKeys = bKeys;
+    this[Symbol.iterator] = this.entries;
+  }
+  get(key) {
+    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);
+  }
+  set(key, value) {
+    if (this.bKeys.has(key)) {
+      this.b.set(key, value);
+    } else {
+      this.a.set(key, value);
+    }
+    return this;
+  }
+  has(key) {
+    return this.b.has(key) || this.a.has(key);
+  }
+  keys() {
+    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();
+  }
+  entries() {
+    return mapIterator(this.keys(), key => [key, this.get(key)]);
+  }
+  forEach(callback) {
+    for (const key of this.keys()) {
+      callback(this.get(key), key, this);
+    }
+  }
+  delete(key) {
+    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);
+  }
+  clear() {
+    this.a.clear();
+    this.b.clear();
+  }
+  get size() {
+    return [...this.keys()].length;
+  }
+}
+
+/**
+ * Create a new iterator that maps over the provided iterator, applying a mapping function to each item
+ */
+exports.PartitionedMap = PartitionedMap;
+function mapIterator(it, callback) {
+  return {
+    next: () => {
+      const n = it.next();
+      return n.done ? n : {
+        value: callback(n.value),
+        done: false
+      };
+    }
+  };
+}
+
+/**
+ * Creates an empty map, or whatever your platform's polyfill is.
+ *
+ * @returns an empty Map or Map like object.
+ */
+function createEmptyMap() {
+  return new Map();
+}
+
+/**
+ * Creates a Map from the given object.
+ *
+ * @param { Map | { [key: string]: unknown } | undefined } mapOrObject
+ * @returns
+ */
+function createMap(mapOrObject) {
+  if (!mapOrObject) {
+    return createEmptyMap();
+  }
+  if ((0, _is.isMap)(mapOrObject)) {
+    return mapOrObject;
+  }
+  if ((0, _is.isObject)(mapOrObject)) {
+    return new ObjectWrappingMap(mapOrObject);
+  }
+  throw new Error('createMap can create maps from objects or Maps');
+}
+
+/**
+ * Unwraps a map into an object.
+ *
+ * @param {Map} map
+ * @returns { [key: string]: unknown }
+ */
+function toObject(map) {
+  if (map instanceof ObjectWrappingMap) {
+    return map.wrappedObject;
+  }
+  const object = {};
+  for (const key of map.keys()) {
+    const value = map.get(key);
+    (0, _customs.setSafeProperty)(object, key, value);
+  }
+  return object;
+}
+
+/**
+ * Copies the contents of key-value pairs from each `objects` in to `map`.
+ *
+ * Object is `objects` can be a `Map` or object.
+ *
+ * This is the `Map` analog to `Object.assign`.
+ */
+function assign(map) {
+  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    objects[_key - 1] = arguments[_key];
+  }
+  for (const args of objects) {
+    if (!args) {
+      continue;
+    }
+    if ((0, _is.isMap)(args)) {
+      for (const key of args.keys()) {
+        map.set(key, args.get(key));
+      }
+    } else if ((0, _is.isObject)(args)) {
+      for (const key of Object.keys(args)) {
+        map.set(key, args[key]);
+      }
+    }
+  }
+  return map;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/noop.js b/node_modules/mathjs/lib/cjs/utils/noop.js
new file mode 100644
index 0000000..48c334e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/noop.js
@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.noBignumber = noBignumber;
+exports.noFraction = noFraction;
+exports.noIndex = noIndex;
+exports.noMatrix = noMatrix;
+exports.noSubset = noSubset;
+function noBignumber() {
+  throw new Error('No "bignumber" implementation available');
+}
+function noFraction() {
+  throw new Error('No "fraction" implementation available');
+}
+function noMatrix() {
+  throw new Error('No "matrix" implementation available');
+}
+function noIndex() {
+  throw new Error('No "index" implementation available');
+}
+function noSubset() {
+  throw new Error('No "matrix" implementation available');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/number.js b/node_modules/mathjs/lib/cjs/utils/number.js
new file mode 100644
index 0000000..f8abb4e
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/number.js
@@ -0,0 +1,749 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.cbrt = exports.atanh = exports.asinh = exports.acosh = void 0;
+exports.copysign = copysign;
+exports.cosh = void 0;
+exports.digits = digits;
+exports.expm1 = void 0;
+exports.format = format;
+exports.isInteger = isInteger;
+exports.log2 = exports.log1p = exports.log10 = void 0;
+exports.nearlyEqual = nearlyEqual;
+exports.normalizeFormatOptions = normalizeFormatOptions;
+exports.roundDigits = roundDigits;
+exports.safeNumberType = safeNumberType;
+exports.sinh = exports.sign = void 0;
+exports.splitNumber = splitNumber;
+exports.tanh = void 0;
+exports.toEngineering = toEngineering;
+exports.toExponential = toExponential;
+exports.toFixed = toFixed;
+exports.toPrecision = toPrecision;
+var _is = require("./is.js");
+/**
+ * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue
+ */
+
+/**
+ * Check if a number is integer
+ * @param {number | boolean} value
+ * @return {boolean} isInteger
+ */
+function isInteger(value) {
+  if (typeof value === 'boolean') {
+    return true;
+  }
+  return isFinite(value) ? value === Math.round(value) : false;
+}
+
+/**
+ * Ensure the number type is compatible with the provided value.
+ * If not, return 'number' instead.
+ *
+ * For example:
+ *
+ *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })
+ *
+ * will return 'number' and not 'bigint' because trying to create a bigint with
+ * value 2.3 would throw an exception.
+ *
+ * @param {string} numberStr
+ * @param {{
+ *   number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'
+ *   numberFallback: 'number' | 'BigNumber'
+ * }} config
+ * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}
+ */
+function safeNumberType(numberStr, config) {
+  if (config.number === 'bigint') {
+    try {
+      BigInt(numberStr);
+    } catch (_unused) {
+      return config.numberFallback;
+    }
+  }
+  return config.number;
+}
+
+/**
+ * Calculate the sign of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const sign = exports.sign = Math.sign || function (x) {
+  if (x > 0) {
+    return 1;
+  } else if (x < 0) {
+    return -1;
+  } else {
+    return 0;
+  }
+};
+
+/**
+ * Calculate the base-2 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const log2 = exports.log2 = Math.log2 || function log2(x) {
+  return Math.log(x) / Math.LN2;
+};
+
+/**
+ * Calculate the base-10 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const log10 = exports.log10 = Math.log10 || function log10(x) {
+  return Math.log(x) / Math.LN10;
+};
+
+/**
+ * Calculate the natural logarithm of a number + 1
+ * @param {number} x
+ * @returns {number}
+ */
+const log1p = exports.log1p = Math.log1p || function (x) {
+  return Math.log(x + 1);
+};
+
+/**
+ * Calculate cubic root for a number
+ *
+ * Code from es6-shim.js:
+ *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
+ *
+ * @param {number} x
+ * @returns {number} Returns the cubic root of x
+ */
+const cbrt = exports.cbrt = Math.cbrt || function cbrt(x) {
+  if (x === 0) {
+    return x;
+  }
+  const negate = x < 0;
+  let result;
+  if (negate) {
+    x = -x;
+  }
+  if (isFinite(x)) {
+    result = Math.exp(Math.log(x) / 3);
+    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods
+    result = (x / (result * result) + 2 * result) / 3;
+  } else {
+    result = x;
+  }
+  return negate ? -result : result;
+};
+
+/**
+ * Calculates exponentiation minus 1
+ * @param {number} x
+ * @return {number} res
+ */
+const expm1 = exports.expm1 = Math.expm1 || function expm1(x) {
+  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;
+};
+
+/**
+ * Formats a number in a given base
+ * @param {number} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+function formatNumberToBase(n, base, size) {
+  const prefixes = {
+    2: '0b',
+    8: '0o',
+    16: '0x'
+  };
+  const prefix = prefixes[base];
+  let suffix = '';
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {
+      throw new Error(`Value must be in range [-2^${size - 1}, 2^${size - 1}-1]`);
+    }
+    if (!isInteger(n)) {
+      throw new Error('Value must be an integer');
+    }
+    if (n < 0) {
+      n = n + 2 ** size;
+    }
+    suffix = `i${size}`;
+  }
+  let sign = '';
+  if (n < 0) {
+    n = -n;
+    sign = '-';
+  }
+  return `${sign}${prefix}${n.toString(base)}${suffix}`;
+}
+
+/**
+ * Convert a number to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'engineering'    Always use engineering notation.
+ *                                          For example '123.4e+0' and '14.0e+6'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lowerExp` and `upperExp` bounds, and
+ *                                          uses exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default,
+ *                                          not rounding any digits.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12.071, {notation: 'fixed'})                // '12'
+ *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'
+ *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'
+ *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'
+ *
+ * @param {number} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  }
+
+  // handle special cases
+  if (value === Infinity) {
+    return 'Infinity';
+  } else if (value === -Infinity) {
+    return '-Infinity';
+  } else if (isNaN(value)) {
+    return 'NaN';
+  }
+  const {
+    notation,
+    precision,
+    wordSize
+  } = normalizeFormatOptions(options);
+
+  // handle the various notations
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+    case 'exponential':
+      return toExponential(value, precision);
+    case 'engineering':
+      return toEngineering(value, precision);
+    case 'bin':
+      return formatNumberToBase(value, 2, wordSize);
+    case 'oct':
+      return formatNumberToBase(value, 8, wordSize);
+    case 'hex':
+      return formatNumberToBase(value, 16, wordSize);
+    case 'auto':
+      // remove trailing zeros after the decimal point
+      return toPrecision(value, precision, options).replace(/((\.\d*?)(0+))($|e)/, function () {
+        const digits = arguments[2];
+        const e = arguments[4];
+        return digits !== '.' ? digits + e : e;
+      });
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+
+/**
+ * Normalize format options into an object:
+ *   {
+ *     notation: string,
+ *     precision: number | undefined,
+ *     wordSize: number | undefined
+ *   }
+ */
+function normalizeFormatOptions(options) {
+  // default values for options
+  let notation = 'auto';
+  let precision;
+  let wordSize;
+  if (options !== undefined) {
+    if ((0, _is.isNumber)(options)) {
+      precision = options;
+    } else if ((0, _is.isBigNumber)(options)) {
+      precision = options.toNumber();
+    } else if ((0, _is.isObject)(options)) {
+      if (options.precision !== undefined) {
+        precision = _toNumberOrThrow(options.precision, () => {
+          throw new Error('Option "precision" must be a number or BigNumber');
+        });
+      }
+      if (options.wordSize !== undefined) {
+        wordSize = _toNumberOrThrow(options.wordSize, () => {
+          throw new Error('Option "wordSize" must be a number or BigNumber');
+        });
+      }
+      if (options.notation) {
+        notation = options.notation;
+      }
+    } else {
+      throw new Error('Unsupported type of options, number, BigNumber, or object expected');
+    }
+  }
+  return {
+    notation,
+    precision,
+    wordSize
+  };
+}
+
+/**
+ * Split a number into sign, coefficients, and exponent
+ * @param {number | string} value
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ */
+function splitNumber(value) {
+  // parse the input value
+  const match = String(value).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);
+  if (!match) {
+    throw new SyntaxError('Invalid number ' + value);
+  }
+  const sign = match[1];
+  const digits = match[2];
+  let exponent = parseFloat(match[4] || '0');
+  const dot = digits.indexOf('.');
+  exponent += dot !== -1 ? dot - 1 : digits.length - 1;
+  const coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)
+  .replace(/^0*/, function (zeros) {
+    // remove leading zeros, add their count to the exponent
+    exponent -= zeros.length;
+    return '';
+  }).replace(/0*$/, '') // remove trailing zeros
+  .split('').map(function (d) {
+    return parseInt(d);
+  });
+  if (coefficients.length === 0) {
+    coefficients.push(0);
+    exponent++;
+  }
+  return {
+    sign,
+    coefficients,
+    exponent
+  };
+}
+
+/**
+ * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+function toEngineering(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+  const split = splitNumber(value);
+  const rounded = roundDigits(split, precision);
+  const e = rounded.exponent;
+  const c = rounded.coefficients;
+
+  // find nearest lower multiple of 3 for exponent
+  const newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+  if ((0, _is.isNumber)(precision)) {
+    // add zeroes to give correct sig figs
+    while (precision > c.length || e - newExp + 1 > c.length) {
+      c.push(0);
+    }
+  } else {
+    // concatenate coefficients with necessary zeros
+    // add zeros if necessary (for example: 1e+8 -> 100e+6)
+    const missingZeros = Math.abs(e - newExp) - (c.length - 1);
+    for (let i = 0; i < missingZeros; i++) {
+      c.push(0);
+    }
+  }
+
+  // find difference in exponents
+  let expDiff = Math.abs(e - newExp);
+  let decimalIdx = 1;
+
+  // push decimal index over by expDiff times
+  while (expDiff > 0) {
+    decimalIdx++;
+    expDiff--;
+  }
+
+  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.
+  // otherwise concat with the rest of the coefficients
+  const decimals = c.slice(decimalIdx).join('');
+  const decimalVal = (0, _is.isNumber)(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';
+  const str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+  return rounded.sign + str;
+}
+
+/**
+ * Format a number with fixed notation.
+ * @param {number | string} value
+ * @param {number} [precision=undefined]  Optional number of decimals after the
+ *                                        decimal point. null by default.
+ */
+function toFixed(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+  const splitValue = splitNumber(value);
+  const rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;
+  let c = rounded.coefficients;
+  let p = rounded.exponent + 1; // exponent may have changed
+
+  // append zeros if needed
+  const pp = p + (precision || 0);
+  if (c.length < pp) {
+    c = c.concat(zeros(pp - c.length));
+  }
+
+  // prepend zeros if needed
+  if (p < 0) {
+    c = zeros(-p + 1).concat(c);
+    p = 1;
+  }
+
+  // insert a dot if needed
+  if (p < c.length) {
+    c.splice(p, 0, p === 0 ? '0.' : '.');
+  }
+  return rounded.sign + c.join('');
+}
+
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ */
+function toExponential(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  // round if needed, else create a clone
+  const split = splitNumber(value);
+  const rounded = precision ? roundDigits(split, precision) : split;
+  let c = rounded.coefficients;
+  const e = rounded.exponent;
+
+  // append zeros if needed
+  if (c.length < precision) {
+    c = c.concat(zeros(precision - c.length));
+  }
+
+  // format as `C.CCCe+EEE` or `C.CCCe-EEE`
+  const first = c.shift();
+  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;
+}
+
+/**
+ * Format a number with a certain precision
+ * @param {number | string} value
+ * @param {number} [precision=undefined] Optional number of digits.
+ * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]
+ *                                       By default:
+ *                                         lowerExp = -3 (incl)
+ *                                         upper = +5 (excl)
+ * @return {string}
+ */
+function toPrecision(value, precision, options) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  // determine lower and upper bound for exponential notation.
+  const lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);
+  const upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);
+  const split = splitNumber(value);
+  const rounded = precision ? roundDigits(split, precision) : split;
+  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {
+    // exponential notation
+    return toExponential(value, precision);
+  } else {
+    let c = rounded.coefficients;
+    const e = rounded.exponent;
+
+    // append trailing zeros
+    if (c.length < precision) {
+      c = c.concat(zeros(precision - c.length));
+    }
+
+    // append trailing zeros
+    // TODO: simplify the next statement
+    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));
+
+    // prepend zeros
+    c = zeros(-e).concat(c);
+    const dot = e > 0 ? e : 0;
+    if (dot < c.length - 1) {
+      c.splice(dot + 1, 0, '.');
+    }
+    return rounded.sign + c.join('');
+  }
+}
+
+/**
+ * Round the number of digits of a number *
+ * @param {SplitValue} split       A value split with .splitNumber(value)
+ * @param {number} precision  A positive integer
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ *              with rounded digits
+ */
+function roundDigits(split, precision) {
+  // create a clone
+  const rounded = {
+    sign: split.sign,
+    coefficients: split.coefficients,
+    exponent: split.exponent
+  };
+  const c = rounded.coefficients;
+
+  // prepend zeros if needed
+  while (precision <= 0) {
+    c.unshift(0);
+    rounded.exponent++;
+    precision++;
+  }
+  if (c.length > precision) {
+    const removed = c.splice(precision, c.length - precision);
+    if (removed[0] >= 5) {
+      let i = precision - 1;
+      c[i]++;
+      while (c[i] === 10) {
+        c.pop();
+        if (i === 0) {
+          c.unshift(0);
+          rounded.exponent++;
+          i++;
+        }
+        i--;
+        c[i]++;
+      }
+    }
+  }
+  return rounded;
+}
+
+/**
+ * Create an array filled with zeros.
+ * @param {number} length
+ * @return {Array}
+ */
+function zeros(length) {
+  const arr = [];
+  for (let i = 0; i < length; i++) {
+    arr.push(0);
+  }
+  return arr;
+}
+
+/**
+ * Count the number of significant digits of a number.
+ *
+ * For example:
+ *   2.34 returns 3
+ *   0.0034 returns 2
+ *   120.5e+30 returns 4
+ *
+ * @param {number} value
+ * @return {number} digits   Number of significant digits
+ */
+function digits(value) {
+  return value.toExponential().replace(/e.*$/, '') // remove exponential notation
+  .replace(/^0\.?0*|\./, '') // remove decimal point and leading zeros
+  .length;
+}
+
+/**
+ * Compares two floating point numbers.
+ * @param {number} a - First value to compare
+ * @param {number} b - Second value to compare
+ * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.
+ * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.
+ * @return {boolean} whether the two numbers are nearly equal
+ *
+ * @throws {Error} If `relTol` is less than or equal to 0.
+ * @throws {Error} If `absTol` is less than 0.
+ *
+ * @example
+ * nearlyEqual(1.000000001, 1.0, 1e-8);            // true
+ * nearlyEqual(1.000000002, 1.0, 0);            // false
+ * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true
+ * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true
+ */
+function nearlyEqual(a, b) {
+  let relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;
+  let absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+  if (relTol <= 0) {
+    throw new Error('Relative tolerance must be greater than 0');
+  }
+  if (absTol < 0) {
+    throw new Error('Absolute tolerance must be at least 0');
+  }
+
+  // NaN
+  if (isNaN(a) || isNaN(b)) {
+    return false;
+  }
+  if (!isFinite(a) || !isFinite(b)) {
+    return a === b;
+  }
+  if (a === b) {
+    return true;
+  }
+
+  // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)
+  return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);
+}
+
+/**
+ * Calculate the hyperbolic arccos of a number
+ * @param {number} x
+ * @return {number}
+ */
+const acosh = exports.acosh = Math.acosh || function (x) {
+  return Math.log(Math.sqrt(x * x - 1) + x);
+};
+const asinh = exports.asinh = Math.asinh || function (x) {
+  return Math.log(Math.sqrt(x * x + 1) + x);
+};
+
+/**
+ * Calculate the hyperbolic arctangent of a number
+ * @param {number} x
+ * @return {number}
+ */
+const atanh = exports.atanh = Math.atanh || function (x) {
+  return Math.log((1 + x) / (1 - x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic cosine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const cosh = exports.cosh = Math.cosh || function (x) {
+  return (Math.exp(x) + Math.exp(-x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic sine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const sinh = exports.sinh = Math.sinh || function (x) {
+  return (Math.exp(x) - Math.exp(-x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic tangent of a number
+ * @param {number} x
+ * @returns {number}
+ */
+const tanh = exports.tanh = Math.tanh || function (x) {
+  const e = Math.exp(2 * x);
+  return (e - 1) / (e + 1);
+};
+
+/**
+ * Returns a value with the magnitude of x and the sign of y.
+ * @param {number} x
+ * @param {number} y
+ * @returns {number}
+ */
+function copysign(x, y) {
+  const signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;
+  const signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;
+  return signx ^ signy ? -x : x;
+}
+function _toNumberOrThrow(value, onError) {
+  if ((0, _is.isNumber)(value)) {
+    return value;
+  } else if ((0, _is.isBigNumber)(value)) {
+    return value.toNumber();
+  } else {
+    onError();
+  }
+}
+function _toNumberOrDefault(value, defaultValue) {
+  if ((0, _is.isNumber)(value)) {
+    return value;
+  } else if ((0, _is.isBigNumber)(value)) {
+    return value.toNumber();
+  } else {
+    return defaultValue;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/object.js b/node_modules/mathjs/lib/cjs/utils/object.js
new file mode 100644
index 0000000..f7c8bdf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/object.js
@@ -0,0 +1,395 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.canDefineProperty = canDefineProperty;
+exports.clone = clone;
+exports.deepExtend = deepExtend;
+exports.deepFlatten = deepFlatten;
+exports.deepStrictEqual = deepStrictEqual;
+exports.extend = extend;
+exports.get = get;
+exports.hasOwnProperty = hasOwnProperty;
+exports.isLegacyFactory = isLegacyFactory;
+exports.lazy = lazy;
+exports.mapObject = mapObject;
+exports.pick = pick;
+exports.pickShallow = pickShallow;
+exports.set = set;
+exports.traverse = traverse;
+var _is = require("./is.js");
+/**
+ * Clone an object
+ *
+ *     clone(x)
+ *
+ * Can clone any primitive type, array, and object.
+ * If x has a function clone, this function will be invoked to clone the object.
+ *
+ * @param {*} x
+ * @return {*} clone
+ */
+function clone(x) {
+  const type = typeof x;
+
+  // immutable primitive types
+  if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' || x === null || x === undefined) {
+    return x;
+  }
+
+  // use clone function of the object when available
+  if (typeof x.clone === 'function') {
+    return x.clone();
+  }
+
+  // array
+  if (Array.isArray(x)) {
+    return x.map(function (value) {
+      return clone(value);
+    });
+  }
+  if (x instanceof Date) return new Date(x.valueOf());
+  if ((0, _is.isBigNumber)(x)) return x; // bignumbers are immutable
+
+  // object
+  if ((0, _is.isObject)(x)) {
+    return mapObject(x, clone);
+  }
+  if (type === 'function') {
+    // we assume that the function is immutable
+    return x;
+  }
+  throw new TypeError(`Cannot clone: unknown type of value (value: ${x})`);
+}
+
+/**
+ * Apply map to all properties of an object
+ * @param {Object} object
+ * @param {function} callback
+ * @return {Object} Returns a copy of the object with mapped properties
+ */
+function mapObject(object, callback) {
+  const clone = {};
+  for (const key in object) {
+    if (hasOwnProperty(object, key)) {
+      clone[key] = callback(object[key]);
+    }
+  }
+  return clone;
+}
+
+/**
+ * Extend object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @return {Object} a
+ */
+function extend(a, b) {
+  for (const prop in b) {
+    if (hasOwnProperty(b, prop)) {
+      a[prop] = b[prop];
+    }
+  }
+  return a;
+}
+
+/**
+ * Deep extend an object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @returns {Object}
+ */
+function deepExtend(a, b) {
+  // TODO: add support for Arrays to deepExtend
+  if (Array.isArray(b)) {
+    throw new TypeError('Arrays are not supported by deepExtend');
+  }
+  for (const prop in b) {
+    // We check against prop not being in Object.prototype or Function.prototype
+    // to prevent polluting for example Object.__proto__.
+    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {
+      if (b[prop] && b[prop].constructor === Object) {
+        if (a[prop] === undefined) {
+          a[prop] = {};
+        }
+        if (a[prop] && a[prop].constructor === Object) {
+          deepExtend(a[prop], b[prop]);
+        } else {
+          a[prop] = b[prop];
+        }
+      } else if (Array.isArray(b[prop])) {
+        throw new TypeError('Arrays are not supported by deepExtend');
+      } else {
+        a[prop] = b[prop];
+      }
+    }
+  }
+  return a;
+}
+
+/**
+ * Deep test equality of all fields in two pairs of arrays or objects.
+ * Compares values and functions strictly (ie. 2 is not the same as '2').
+ * @param {Array | Object} a
+ * @param {Array | Object} b
+ * @returns {boolean}
+ */
+function deepStrictEqual(a, b) {
+  let prop, i, len;
+  if (Array.isArray(a)) {
+    if (!Array.isArray(b)) {
+      return false;
+    }
+    if (a.length !== b.length) {
+      return false;
+    }
+    for (i = 0, len = a.length; i < len; i++) {
+      if (!deepStrictEqual(a[i], b[i])) {
+        return false;
+      }
+    }
+    return true;
+  } else if (typeof a === 'function') {
+    return a === b;
+  } else if (a instanceof Object) {
+    if (Array.isArray(b) || !(b instanceof Object)) {
+      return false;
+    }
+    for (prop in a) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {
+        return false;
+      }
+    }
+    for (prop in b) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in a)) {
+        return false;
+      }
+    }
+    return true;
+  } else {
+    return a === b;
+  }
+}
+
+/**
+ * Recursively flatten a nested object.
+ * @param {Object} nestedObject
+ * @return {Object} Returns the flattened object
+ */
+function deepFlatten(nestedObject) {
+  const flattenedObject = {};
+  _deepFlatten(nestedObject, flattenedObject);
+  return flattenedObject;
+}
+
+// helper function used by deepFlatten
+function _deepFlatten(nestedObject, flattenedObject) {
+  for (const prop in nestedObject) {
+    if (hasOwnProperty(nestedObject, prop)) {
+      const value = nestedObject[prop];
+      if (typeof value === 'object' && value !== null) {
+        _deepFlatten(value, flattenedObject);
+      } else {
+        flattenedObject[prop] = value;
+      }
+    }
+  }
+}
+
+/**
+ * Test whether the current JavaScript engine supports Object.defineProperty
+ * @returns {boolean} returns true if supported
+ */
+function canDefineProperty() {
+  // test needed for broken IE8 implementation
+  try {
+    if (Object.defineProperty) {
+      Object.defineProperty({}, 'x', {
+        get: function () {
+          return null;
+        }
+      });
+      return true;
+    }
+  } catch (e) {}
+  return false;
+}
+
+/**
+ * Attach a lazy loading property to a constant.
+ * The given function `fn` is called once when the property is first requested.
+ *
+ * @param {Object} object         Object where to add the property
+ * @param {string} prop           Property name
+ * @param {Function} valueResolver Function returning the property value. Called
+ *                                without arguments.
+ */
+function lazy(object, prop, valueResolver) {
+  let _uninitialized = true;
+  let _value;
+  Object.defineProperty(object, prop, {
+    get: function () {
+      if (_uninitialized) {
+        _value = valueResolver();
+        _uninitialized = false;
+      }
+      return _value;
+    },
+    set: function (value) {
+      _value = value;
+      _uninitialized = false;
+    },
+    configurable: true,
+    enumerable: true
+  });
+}
+
+/**
+ * Traverse a path into an object.
+ * When a namespace is missing, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path   A dot separated string like 'name.space'
+ * @return {Object} Returns the object at the end of the path
+ */
+function traverse(object, path) {
+  if (path && typeof path === 'string') {
+    return traverse(object, path.split('.'));
+  }
+  let obj = object;
+  if (path) {
+    for (let i = 0; i < path.length; i++) {
+      const key = path[i];
+      if (!(key in obj)) {
+        obj[key] = {};
+      }
+      obj = obj[key];
+    }
+  }
+  return obj;
+}
+
+/**
+ * A safe hasOwnProperty
+ * @param {Object} object
+ * @param {string} property
+ */
+function hasOwnProperty(object, property) {
+  return object && Object.hasOwnProperty.call(object, property);
+}
+
+/**
+ * Test whether an object is a factory. a factory has fields:
+ *
+ * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)
+ * - name: string (optional)
+ * - path: string    A dot separated path (optional)
+ * - math: boolean   If true (false by default), the math namespace is passed
+ *                   as fifth argument of the factory function
+ *
+ * @param {*} object
+ * @returns {boolean}
+ */
+function isLegacyFactory(object) {
+  return object && typeof object.factory === 'function';
+}
+
+/**
+ * Get a nested property from an object
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @returns {Object}
+ */
+function get(object, path) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return get(object, path.split('.'));
+    } else {
+      return object[path];
+    }
+  }
+  let child = object;
+  for (let i = 0; i < path.length; i++) {
+    const key = path[i];
+    child = child ? child[key] : undefined;
+  }
+  return child;
+}
+
+/**
+ * Set a nested property in an object
+ * Mutates the object itself
+ * If the path doesn't exist, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @param {*} value
+ * @returns {Object}
+ */
+function set(object, path, value) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return set(object, path.split('.'), value);
+    } else {
+      object[path] = value;
+      return object;
+    }
+  }
+  let child = object;
+  for (let i = 0; i < path.length - 1; i++) {
+    const key = path[i];
+    if (child[key] === undefined) {
+      child[key] = {};
+    }
+    child = child[key];
+  }
+  if (path.length > 0) {
+    const lastKey = path[path.length - 1];
+    child[lastKey] = value;
+  }
+  return object;
+}
+
+/**
+ * Create an object composed of the picked object properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @param {function} [transform] Optional value to transform a value when picking it
+ * @return {Object}
+ */
+function pick(object, properties, transform) {
+  const copy = {};
+  for (let i = 0; i < properties.length; i++) {
+    const key = properties[i];
+    const value = get(object, key);
+    if (value !== undefined) {
+      set(copy, key, transform ? transform(value, key) : value);
+    }
+  }
+  return copy;
+}
+
+/**
+ * Shallow version of pick, creating an object composed of the picked object properties
+ * but not for nested properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @return {Object}
+ */
+function pickShallow(object, properties) {
+  const copy = {};
+  for (let i = 0; i < properties.length; i++) {
+    const key = properties[i];
+    const value = object[key];
+    if (value !== undefined) {
+      copy[key] = value;
+    }
+  }
+  return copy;
+}
+
+// helper function to test whether a string contains a path like 'user.name'
+function isPath(str) {
+  return str.includes('.');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/optimizeCallback.js b/node_modules/mathjs/lib/cjs/utils/optimizeCallback.js
new file mode 100644
index 0000000..2d1df33
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/optimizeCallback.js
@@ -0,0 +1,158 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.optimizeCallback = optimizeCallback;
+var _typedFunction = _interopRequireDefault(require("typed-function"));
+var _array = require("./array.js");
+var _is = require("./is.js");
+/**
+ * Simplifies a callback function by reducing its complexity and potentially improving its performance.
+ *
+ * @param {Function} callback The original callback function to simplify.
+ * @param {Array|Matrix} array The array that will be used with the callback function.
+ * @param {string} name The name of the function that is using the callback.
+ * @param {boolean} isUnary If true, the callback function is unary and will be optimized as such.
+ * @returns {Function} Returns a simplified version of the callback function.
+ */
+function optimizeCallback(callback, array, name, isUnary) {
+  if (_typedFunction.default.isTypedFunction(callback)) {
+    let numberOfArguments;
+    if (isUnary) {
+      numberOfArguments = 1;
+    } else {
+      const firstIndex = (array.isMatrix ? array.size() : (0, _array.arraySize)(array)).map(() => 0);
+      const firstValue = array.isMatrix ? array.get(firstIndex) : (0, _array.get)(array, firstIndex);
+      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array);
+    }
+    let fastCallback;
+    if (array.isMatrix && array.dataType !== 'mixed' && array.dataType !== undefined) {
+      const singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments);
+      fastCallback = singleSignature !== undefined ? singleSignature : callback;
+    } else {
+      fastCallback = callback;
+    }
+    if (numberOfArguments >= 1 && numberOfArguments <= 3) {
+      return {
+        isUnary: numberOfArguments === 1,
+        fn: function () {
+          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+            args[_key] = arguments[_key];
+          }
+          return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);
+        }
+      };
+    }
+    return {
+      isUnary: false,
+      fn: function () {
+        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+          args[_key2] = arguments[_key2];
+        }
+        return _tryFunctionWithArgs(fastCallback, args, name, callback.name);
+      }
+    };
+  }
+  if (isUnary === undefined) {
+    return {
+      isUnary: _findIfCallbackIsUnary(callback),
+      fn: callback
+    };
+  } else {
+    return {
+      isUnary,
+      fn: callback
+    };
+  }
+}
+function _findSingleSignatureWithArity(callback, arity) {
+  const matchingFunctions = [];
+  Object.entries(callback.signatures).forEach(_ref => {
+    let [signature, func] = _ref;
+    if (signature.split(',').length === arity) {
+      matchingFunctions.push(func);
+    }
+  });
+  if (matchingFunctions.length === 1) {
+    return matchingFunctions[0];
+  }
+}
+
+/**
+ * Determines if a given callback function is unary (i.e., takes exactly one argument).
+ *
+ * This function checks the following conditions to determine if the callback is unary:
+ * 1. The callback function should have exactly one parameter.
+ * 2. The callback function should not use the `arguments` object.
+ * 3. The callback function should not use rest parameters (`...`).
+ * If in doubt, this function shall return `false` to be safe
+ *
+ * @param {Function} callback - The callback function to be checked.
+ * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.
+ */
+function _findIfCallbackIsUnary(callback) {
+  if (callback.length !== 1) return false;
+  const callbackStr = callback.toString();
+  // Check if the callback function uses `arguments`
+  if (/arguments/.test(callbackStr)) return false;
+
+  // Extract the parameters of the callback function
+  const paramsStr = callbackStr.match(/\(.*?\)/);
+  // Check if the callback function uses rest parameters
+  if (/\.\.\./.test(paramsStr)) return false;
+  return true;
+}
+function _findNumberOfArgumentsTyped(callback, value, index, array) {
+  const testArgs = [value, index, array];
+  for (let i = 3; i > 0; i--) {
+    const args = testArgs.slice(0, i);
+    if (_typedFunction.default.resolve(callback, args) !== null) {
+      return i;
+    }
+  }
+}
+
+/**
+   * @param {function} func The selected function taken from one of the signatures of the callback function
+   * @param {Array} args List with arguments to apply to the selected signature
+   * @param {string} mappingFnName the name of the function that is using the callback
+   * @param {string} callbackName the name of the callback function
+   * @returns {*} Returns the return value of the invoked signature
+   * @throws {TypeError} Throws an error when no matching signature was found
+   */
+function _tryFunctionWithArgs(func, args, mappingFnName, callbackName) {
+  try {
+    return func(...args);
+  } catch (err) {
+    _createCallbackError(err, args, mappingFnName, callbackName);
+  }
+}
+
+/**
+ * Creates and throws a detailed TypeError when a callback function fails.
+ *
+ * @param {Error} err The original error thrown by the callback function.
+ * @param {Array} args The arguments that were passed to the callback function.
+ * @param {string} mappingFnName The name of the function that is using the callback.
+ * @param {string} callbackName The name of the callback function.
+ * @throws {TypeError} Throws a detailed TypeError with enriched error message.
+ */
+function _createCallbackError(err, args, mappingFnName, callbackName) {
+  var _err$data;
+  // Enrich the error message so the user understands that it took place inside the callback function
+  if (err instanceof TypeError && ((_err$data = err.data) === null || _err$data === void 0 ? void 0 : _err$data.category) === 'wrongType') {
+    const argsDesc = [];
+    argsDesc.push(`value: ${(0, _is.typeOf)(args[0])}`);
+    if (args.length >= 2) {
+      argsDesc.push(`index: ${(0, _is.typeOf)(args[1])}`);
+    }
+    if (args.length >= 3) {
+      argsDesc.push(`array: ${(0, _is.typeOf)(args[2])}`);
+    }
+    throw new TypeError(`Function ${mappingFnName} cannot apply callback arguments ` + `${callbackName}(${argsDesc.join(', ')}) at index ${JSON.stringify(args[1])}`);
+  } else {
+    throw new TypeError(`Function ${mappingFnName} cannot apply callback arguments ` + `to function ${callbackName}: ${err.message}`);
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/print.js b/node_modules/mathjs/lib/cjs/utils/print.js
new file mode 100644
index 0000000..701f0a9
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/print.js
@@ -0,0 +1,7 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.printTemplate = void 0;
+const printTemplate = exports.printTemplate = /\$([\w.]+)/g;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/product.js b/node_modules/mathjs/lib/cjs/utils/product.js
new file mode 100644
index 0000000..181ea12
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/product.js
@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.product = product;
+/** @param {number} i
+ *  @param {number} n
+ *  @returns {number} product of i to n
+ */
+function product(i, n) {
+  if (n < i) {
+    return 1;
+  }
+  if (n === i) {
+    return n;
+  }
+  const half = n + i >> 1; // divide (n + i) by 2 and truncate to integer
+  return product(i, half) * product(half + 1, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/scope.js b/node_modules/mathjs/lib/cjs/utils/scope.js
new file mode 100644
index 0000000..de3b381
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/scope.js
@@ -0,0 +1,23 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSubScope = createSubScope;
+var _map = require("./map.js");
+/**
+ * Create a new scope which can access the parent scope,
+ * but does not affect it when written. This is suitable for variable definitions
+ * within a block node, or function definition.
+ *
+ * If parent scope has a createSubScope method, it delegates to that. Otherwise,
+ * creates an empty map, and copies the parent scope to it, adding in
+ * the remaining `args`.
+ *
+ * @param {Map} parentScope
+ * @param  {Object} args
+ * @returns {PartitionedMap}
+ */
+function createSubScope(parentScope, args) {
+  return new _map.PartitionedMap(parentScope, new _map.ObjectWrappingMap(args), new Set(Object.keys(args)));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/snapshot.js b/node_modules/mathjs/lib/cjs/utils/snapshot.js
new file mode 100644
index 0000000..46f77b8
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/snapshot.js
@@ -0,0 +1,254 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createSnapshotFromFactories = createSnapshotFromFactories;
+exports.validateBundle = validateBundle;
+exports.validateTypeOf = void 0;
+var _extends2 = _interopRequireDefault(require("@babel/runtime/helpers/extends"));
+var _assert = _interopRequireDefault(require("assert"));
+var allIsFunctions = _interopRequireWildcard(require("./is.js"));
+var _create = require("../core/create.js");
+var _string = require("./string.js");
+function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
+/**
+ * This file contains helper methods to create expected snapshot structures
+ * of both instance and ES6 exports.
+ *
+ * The files are located here and not under /test or /tools so it's transpiled
+ * into ES5 code under /lib and can be used straight by node.js
+ */
+
+const validateTypeOf = exports.validateTypeOf = allIsFunctions.typeOf;
+function validateBundle(expectedBundleStructure, bundle) {
+  const originalWarn = console.warn;
+  console.warn = function () {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    if (args.join(' ').includes('is moved to') && args.join(' ').includes('Please use the new location instead')) {
+      // Ignore warnings like:
+      // Warning: math.type.isNumber is moved to math.isNumber in v6.0.0. Please use the new location instead.
+      return;
+    }
+    originalWarn.apply(console, args);
+  };
+  try {
+    const issues = [];
+
+    // see whether all expected functions and objects are there
+    traverse(expectedBundleStructure, (expectedType, path) => {
+      const actualValue = get(bundle, path);
+      const actualType = validateTypeOf(actualValue);
+      const message = actualType === 'undefined' ? 'Missing entry in bundle. ' + `Path: ${JSON.stringify(path)}, expected type: ${expectedType}, actual type: ${actualType}` : 'Unexpected entry type in bundle. ' + `Path: ${JSON.stringify(path)}, expected type: ${expectedType}, actual type: ${actualType}`;
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    });
+
+    // see whether there are any functions or objects that shouldn't be there
+    traverse(bundle, (actualValue, path) => {
+      const actualType = validateTypeOf(actualValue);
+      const expectedType = get(expectedBundleStructure, path) || 'undefined';
+
+      // FIXME: ugly to have these special cases
+      if (path.join('.').includes('docs.')) {
+        // ignore the contents of docs
+        return;
+      }
+      if (path.join('.').includes('all.')) {
+        // ignore the contents of all dependencies
+        return;
+      }
+      const message = expectedType === 'undefined' ? 'Unknown entry in bundle. ' + 'Is there a new function added which is missing in this snapshot test? ' + `Path: ${JSON.stringify(path)}, expected type: ${expectedType}, actual type: ${actualType}` : 'Unexpected entry type in bundle. ' + `Path: ${JSON.stringify(path)}, expected type: ${expectedType}, actual type: ${actualType}`;
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    });
+
+    // assert on the first issue (if any)
+    if (issues.length > 0) {
+      const {
+        actualType,
+        expectedType,
+        message
+      } = issues[0];
+      console.warn(`${issues.length} bundle issues found`);
+      _assert.default.strictEqual(actualType, expectedType, message);
+    }
+  } finally {
+    console.warn = originalWarn;
+  }
+}
+
+/**
+ * Based on an object with factory functions, create the expected
+ * structures for ES6 export and a mathjs instance.
+ * @param {Object} factories
+ * @return {{expectedInstanceStructure: Object, expectedES6Structure: Object}}
+ */
+function createSnapshotFromFactories(factories) {
+  const math = (0, _create.create)(factories);
+  const allFactoryFunctions = {};
+  const allFunctionsConstantsClasses = {};
+  const allFunctionsConstants = {};
+  const allTransformFunctions = {};
+  const allDependencyCollections = {};
+  const allClasses = {};
+  const allNodeClasses = {};
+  Object.keys(factories).forEach(factoryName => {
+    var _factory$meta$formerl, _factory$meta;
+    const factory = factories[factoryName];
+    const name = factory.fn;
+    const isTransformFunction = factory.meta && factory.meta.isTransformFunction;
+    const isClass = !isLowerCase(name[0]) && validateTypeOf(math[name]) === 'function';
+    const dependenciesName = factory.fn + (isTransformFunction ? 'Transform' : '') + 'Dependencies';
+    const former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';
+    allFactoryFunctions[factoryName] = 'function';
+    allFunctionsConstantsClasses[name] = validateTypeOf(math[name]);
+    if (former) {
+      allFunctionsConstantsClasses[former] = allFunctionsConstantsClasses[name];
+    }
+    allDependencyCollections[dependenciesName] = 'Object';
+    if (isTransformFunction) {
+      allTransformFunctions[name] = 'function';
+      if (former) allTransformFunctions[former] = 'function';
+    }
+    if (isClass) {
+      if ((0, _string.endsWith)(name, 'Node')) {
+        allNodeClasses[name] = 'function';
+      } else {
+        allClasses[name] = 'function';
+      }
+    } else {
+      allFunctionsConstants[name] = validateTypeOf(math[name]);
+      if (former) allFunctionsConstants[former] = allFunctionsConstants[name];
+    }
+  });
+  let embeddedDocs = {};
+  Object.keys(factories).forEach(factoryName => {
+    const factory = factories[factoryName];
+    const name = factory.fn;
+    if (isLowerCase(factory.fn[0])) {
+      // ignore class names starting with upper case
+      embeddedDocs[name] = 'Object';
+    }
+  });
+  embeddedDocs = exclude(embeddedDocs, ['equalScalar', 'addScalar', 'subtractScalar', 'multiplyScalar', 'print', 'divideScalar', 'parse', 'compile', 'parser', 'chain', 'coulomb', 'reviver', 'replacer']);
+  const allTypeChecks = {};
+  Object.keys(allIsFunctions).forEach(name => {
+    if (name.indexOf('is') === 0) {
+      allTypeChecks[name] = 'function';
+    }
+  });
+  const allErrorClasses = {
+    ArgumentsError: 'function',
+    DimensionError: 'function',
+    IndexError: 'function'
+  };
+  const expectedInstanceStructure = {
+    ...allFunctionsConstantsClasses,
+    on: 'function',
+    off: 'function',
+    once: 'function',
+    emit: 'function',
+    import: 'function',
+    config: 'function',
+    create: 'function',
+    factory: 'function',
+    ...allTypeChecks,
+    ...allErrorClasses,
+    expression: {
+      transform: {
+        ...allTransformFunctions
+      },
+      mathWithTransform: {
+        // note that we don't have classes here,
+        // only functions and constants are allowed in the editor
+        ...exclude(allFunctionsConstants, ['chain']),
+        config: 'function'
+      }
+    }
+  };
+  const expectedES6Structure = {
+    // functions
+    ...exclude(allFunctionsConstantsClasses, ['E', 'false', 'Infinity', 'NaN', 'null', 'PI', 'true']),
+    create: 'function',
+    config: 'function',
+    factory: 'function',
+    _true: 'boolean',
+    _false: 'boolean',
+    _null: 'null',
+    _Infinity: 'number',
+    _NaN: 'number',
+    ...allTypeChecks,
+    ...allErrorClasses,
+    ...allDependencyCollections,
+    ...allFactoryFunctions,
+    docs: embeddedDocs
+  };
+  return {
+    expectedInstanceStructure,
+    expectedES6Structure
+  };
+}
+function traverse(obj) {
+  let callback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : (value, path) => {};
+  let path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  // FIXME: ugly to have these special cases
+  if (path.length > 0 && path[0].includes('Dependencies')) {
+    // special case for objects holding a collection of dependencies
+    callback(obj, path);
+  } else if (validateTypeOf(obj) === 'Array') {
+    obj.map((item, index) => traverse(item, callback, path.concat(index)));
+  } else if (validateTypeOf(obj) === 'Object') {
+    Object.keys(obj).forEach(key => {
+      // FIXME: ugly to have these special cases
+      // ignore special case of deprecated docs
+      if (key === 'docs' && path.join('.') === 'expression') {
+        return;
+      }
+      traverse(obj[key], callback, path.concat(key));
+    });
+  } else {
+    callback(obj, path);
+  }
+}
+function get(object, path) {
+  let child = object;
+  for (let i = 0; i < path.length; i++) {
+    const key = path[i];
+    child = child ? child[key] : undefined;
+  }
+  return child;
+}
+
+/**
+ * Create a copy of the provided `object` and delete
+ * all properties listed in `excludedProperties`
+ * @param {Object} object
+ * @param {string[]} excludedProperties
+ * @return {Object}
+ */
+function exclude(object, excludedProperties) {
+  const strippedObject = (0, _extends2.default)({}, object);
+  excludedProperties.forEach(excludedProperty => {
+    delete strippedObject[excludedProperty];
+  });
+  return strippedObject;
+}
+function isLowerCase(text) {
+  return typeof text === 'string' && text.toLowerCase() === text;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/string.js b/node_modules/mathjs/lib/cjs/utils/string.js
new file mode 100644
index 0000000..0fa30cf
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/string.js
@@ -0,0 +1,203 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.compareText = compareText;
+exports.endsWith = endsWith;
+exports.escape = escape;
+exports.format = format;
+exports.stringify = stringify;
+var _is = require("./is.js");
+var _number = require("./number.js");
+var _formatter = require("./bignumber/formatter.js");
+/**
+ * Check if a text ends with a certain string.
+ * @param {string} text
+ * @param {string} search
+ */
+function endsWith(text, search) {
+  const start = text.length - search.length;
+  const end = text.length;
+  return text.substring(start, end) === search;
+}
+
+/**
+ * Format a value of any type into a string.
+ *
+ * Usage:
+ *     math.format(value)
+ *     math.format(value, precision)
+ *     math.format(value, options)
+ *
+ * When value is a function:
+ *
+ * - When the function has a property `syntax`, it returns this
+ *   syntax description.
+ * - In other cases, a string `'function'` is returned.
+ *
+ * When `value` is an Object:
+ *
+ * - When the object contains a property `format` being a function, this
+ *   function is invoked as `value.format(options)` and the result is returned.
+ * - When the object has its own `toString` method, this method is invoked
+ *   and the result is returned.
+ * - In other cases the function will loop over all object properties and
+ *   return JSON object notation like '{"a": 2, "b": 3}'.
+ *
+ * Example usage:
+ *     math.format(2/7)                // '0.2857142857142857'
+ *     math.format(math.pi, 3)         // '3.14'
+ *     math.format(new Complex(2, 3))  // '2 + 3i'
+ *     math.format('hello')            // '"hello"'
+ *
+ * @param {*} value             Value to be stringified
+ * @param {Object | number | Function} [options]
+ *     Formatting options. See src/utils/number.js:format for a
+ *     description of the available options controlling number output.
+ *     This generic "format" also supports the option property `truncate: NN`
+ *     giving the maximum number NN of characters to return (if there would
+ *     have been more, they are deleted and replaced by an ellipsis).
+ * @return {string} str
+ */
+function format(value, options) {
+  const result = _format(value, options);
+  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {
+    return result.substring(0, options.truncate - 3) + '...';
+  }
+  return result;
+}
+function _format(value, options) {
+  if (typeof value === 'number') {
+    return (0, _number.format)(value, options);
+  }
+  if ((0, _is.isBigNumber)(value)) {
+    return (0, _formatter.format)(value, options);
+  }
+
+  // note: we use unsafe duck-typing here to check for Fractions, this is
+  // ok here since we're only invoking toString or concatenating its values
+  if (looksLikeFraction(value)) {
+    if (!options || options.fraction !== 'decimal') {
+      // output as ratio, like '1/3'
+      return `${value.s * value.n}/${value.d}`;
+    } else {
+      // output as decimal, like '0.(3)'
+      return value.toString();
+    }
+  }
+  if (Array.isArray(value)) {
+    return formatArray(value, options);
+  }
+  if ((0, _is.isString)(value)) {
+    return stringify(value);
+  }
+  if (typeof value === 'function') {
+    return value.syntax ? String(value.syntax) : 'function';
+  }
+  if (value && typeof value === 'object') {
+    if (typeof value.format === 'function') {
+      return value.format(options);
+    } else if (value && value.toString(options) !== {}.toString()) {
+      // this object has a non-native toString method, use that one
+      return value.toString(options);
+    } else {
+      const entries = Object.keys(value).map(key => {
+        return stringify(key) + ': ' + format(value[key], options);
+      });
+      return '{' + entries.join(', ') + '}';
+    }
+  }
+  return String(value);
+}
+
+/**
+ * Stringify a value into a string enclosed in double quotes.
+ * Unescaped double quotes and backslashes inside the value are escaped.
+ * @param {*} value
+ * @return {string}
+ */
+function stringify(value) {
+  const text = String(value);
+  let escaped = '';
+  let i = 0;
+  while (i < text.length) {
+    const c = text.charAt(i);
+    escaped += c in controlCharacters ? controlCharacters[c] : c;
+    i++;
+  }
+  return '"' + escaped + '"';
+}
+const controlCharacters = {
+  '"': '\\"',
+  '\\': '\\\\',
+  '\b': '\\b',
+  '\f': '\\f',
+  '\n': '\\n',
+  '\r': '\\r',
+  '\t': '\\t'
+};
+
+/**
+ * Escape special HTML characters
+ * @param {*} value
+ * @return {string}
+ */
+function escape(value) {
+  let text = String(value);
+  text = text.replace(/&/g, '&amp;').replace(/"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
+  return text;
+}
+
+/**
+ * Recursively format an n-dimensional matrix
+ * Example output: "[[1, 2], [3, 4]]"
+ * @param {Array} array
+ * @param {Object | number | Function} [options]  Formatting options. See
+ *                                                lib/utils/number:format for a
+ *                                                description of the available
+ *                                                options.
+ * @returns {string} str
+ */
+function formatArray(array, options) {
+  if (Array.isArray(array)) {
+    let str = '[';
+    const len = array.length;
+    for (let i = 0; i < len; i++) {
+      if (i !== 0) {
+        str += ', ';
+      }
+      str += formatArray(array[i], options);
+    }
+    str += ']';
+    return str;
+  } else {
+    return format(array, options);
+  }
+}
+
+/**
+ * Check whether a value looks like a Fraction (unsafe duck-type check)
+ * @param {*} value
+ * @return {boolean}
+ */
+function looksLikeFraction(value) {
+  return value && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;
+}
+
+/**
+ * Compare two strings
+ * @param {string} x
+ * @param {string} y
+ * @returns {number}
+ */
+function compareText(x, y) {
+  // we don't want to convert numbers to string, only accept string input
+  if (!(0, _is.isString)(x)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(x) + ', index: 0)');
+  }
+  if (!(0, _is.isString)(y)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + (0, _is.typeOf)(y) + ', index: 1)');
+  }
+  return x === y ? 0 : x > y ? 1 : -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/utils/switch.js b/node_modules/mathjs/lib/cjs/utils/switch.js
new file mode 100644
index 0000000..ad5f8ec
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/utils/switch.js
@@ -0,0 +1,26 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports._switch = _switch;
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+function _switch(mat) {
+  const I = mat.length;
+  const J = mat[0].length;
+  let i, j;
+  const ret = [];
+  for (j = 0; j < J; j++) {
+    const tmp = [];
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+    ret.push(tmp);
+  }
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/cjs/version.js b/node_modules/mathjs/lib/cjs/version.js
new file mode 100644
index 0000000..c28cf16
--- /dev/null
+++ b/node_modules/mathjs/lib/cjs/version.js
@@ -0,0 +1,9 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.version = void 0;
+const version = exports.version = '14.9.1';
+// Note: This file is automatically generated when building math.js.
+// Changes made in this file will be overwritten.
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/constants.js b/node_modules/mathjs/lib/esm/constants.js
new file mode 100644
index 0000000..191b47f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/constants.js
@@ -0,0 +1,124 @@
+import { factory } from './utils/factory.js';
+import { version } from './version.js';
+import { createBigNumberE, createBigNumberPhi, createBigNumberPi, createBigNumberTau } from './utils/bignumber/constants.js';
+import { pi, tau, e, phi } from './plain/number/index.js';
+export var createTrue = /* #__PURE__ */factory('true', [], () => true);
+export var createFalse = /* #__PURE__ */factory('false', [], () => false);
+export var createNull = /* #__PURE__ */factory('null', [], () => null);
+export var createInfinity = /* #__PURE__ */recreateFactory('Infinity', ['config', '?BigNumber'], _ref => {
+  var {
+    config,
+    BigNumber
+  } = _ref;
+  return config.number === 'BigNumber' ? new BigNumber(Infinity) : Infinity;
+});
+export var createNaN = /* #__PURE__ */recreateFactory('NaN', ['config', '?BigNumber'], _ref2 => {
+  var {
+    config,
+    BigNumber
+  } = _ref2;
+  return config.number === 'BigNumber' ? new BigNumber(NaN) : NaN;
+});
+export var createPi = /* #__PURE__ */recreateFactory('pi', ['config', '?BigNumber'], _ref3 => {
+  var {
+    config,
+    BigNumber
+  } = _ref3;
+  return config.number === 'BigNumber' ? createBigNumberPi(BigNumber) : pi;
+});
+export var createTau = /* #__PURE__ */recreateFactory('tau', ['config', '?BigNumber'], _ref4 => {
+  var {
+    config,
+    BigNumber
+  } = _ref4;
+  return config.number === 'BigNumber' ? createBigNumberTau(BigNumber) : tau;
+});
+export var createE = /* #__PURE__ */recreateFactory('e', ['config', '?BigNumber'], _ref5 => {
+  var {
+    config,
+    BigNumber
+  } = _ref5;
+  return config.number === 'BigNumber' ? createBigNumberE(BigNumber) : e;
+});
+
+// golden ratio, (1+sqrt(5))/2
+export var createPhi = /* #__PURE__ */recreateFactory('phi', ['config', '?BigNumber'], _ref6 => {
+  var {
+    config,
+    BigNumber
+  } = _ref6;
+  return config.number === 'BigNumber' ? createBigNumberPhi(BigNumber) : phi;
+});
+export var createLN2 = /* #__PURE__ */recreateFactory('LN2', ['config', '?BigNumber'], _ref7 => {
+  var {
+    config,
+    BigNumber
+  } = _ref7;
+  return config.number === 'BigNumber' ? new BigNumber(2).ln() : Math.LN2;
+});
+export var createLN10 = /* #__PURE__ */recreateFactory('LN10', ['config', '?BigNumber'], _ref8 => {
+  var {
+    config,
+    BigNumber
+  } = _ref8;
+  return config.number === 'BigNumber' ? new BigNumber(10).ln() : Math.LN10;
+});
+export var createLOG2E = /* #__PURE__ */recreateFactory('LOG2E', ['config', '?BigNumber'], _ref9 => {
+  var {
+    config,
+    BigNumber
+  } = _ref9;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(2).ln()) : Math.LOG2E;
+});
+export var createLOG10E = /* #__PURE__ */recreateFactory('LOG10E', ['config', '?BigNumber'], _ref0 => {
+  var {
+    config,
+    BigNumber
+  } = _ref0;
+  return config.number === 'BigNumber' ? new BigNumber(1).div(new BigNumber(10).ln()) : Math.LOG10E;
+});
+export var createSQRT1_2 = /* #__PURE__ */recreateFactory(
+// eslint-disable-line camelcase
+'SQRT1_2', ['config', '?BigNumber'], _ref1 => {
+  var {
+    config,
+    BigNumber
+  } = _ref1;
+  return config.number === 'BigNumber' ? new BigNumber('0.5').sqrt() : Math.SQRT1_2;
+});
+export var createSQRT2 = /* #__PURE__ */recreateFactory('SQRT2', ['config', '?BigNumber'], _ref10 => {
+  var {
+    config,
+    BigNumber
+  } = _ref10;
+  return config.number === 'BigNumber' ? new BigNumber(2).sqrt() : Math.SQRT2;
+});
+export var createI = /* #__PURE__ */recreateFactory('i', ['Complex'], _ref11 => {
+  var {
+    Complex
+  } = _ref11;
+  return Complex.I;
+});
+
+// for backward compatibility with v5
+export var createUppercasePi = /* #__PURE__ */factory('PI', ['pi'], _ref12 => {
+  var {
+    pi
+  } = _ref12;
+  return pi;
+});
+export var createUppercaseE = /* #__PURE__ */factory('E', ['e'], _ref13 => {
+  var {
+    e
+  } = _ref13;
+  return e;
+});
+export var createVersion = /* #__PURE__ */factory('version', [], () => version);
+
+// helper function to create a factory with a flag recreateOnConfigChange
+// idea: allow passing optional properties to be attached to the factory function as 4th argument?
+function recreateFactory(name, dependencies, create) {
+  return factory(name, dependencies, create, {
+    recreateOnConfigChange: true
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/config.js b/node_modules/mathjs/lib/esm/core/config.js
new file mode 100644
index 0000000..10861f7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/config.js
@@ -0,0 +1,25 @@
+export var DEFAULT_CONFIG = {
+  // minimum relative difference between two compared values,
+  // used by all comparison functions
+  relTol: 1e-12,
+  // minimum absolute difference between two compared values,
+  // used by all comparison functions
+  absTol: 1e-15,
+  // type of default matrix output. Choose 'matrix' (default) or 'array'
+  matrix: 'Matrix',
+  // type of default number output. Choose 'number' (default) 'BigNumber', 'bigint', or 'Fraction'
+  number: 'number',
+  // type of fallback used for config { number: 'bigint' } when a value cannot be represented
+  // in the configured numeric type. Choose 'number' (default) or 'BigNumber'.
+  numberFallback: 'number',
+  // number of significant digits in BigNumbers
+  precision: 64,
+  // predictable output type of functions. When true, output type depends only
+  // on the input types. When false (default), output type can vary depending
+  // on input values. For example `math.sqrt(-4)` returns `complex('2i')` when
+  // predictable is false, and returns `NaN` when true.
+  predictable: false,
+  // random seed for seeded pseudo random number generation
+  // null = randomly seed
+  randomSeed: null
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/create.js b/node_modules/mathjs/lib/esm/core/create.js
new file mode 100644
index 0000000..15baadf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/create.js
@@ -0,0 +1,205 @@
+import _extends from "@babel/runtime/helpers/extends";
+import typedFunction from 'typed-function';
+import { ArgumentsError } from '../error/ArgumentsError.js';
+import { DimensionError } from '../error/DimensionError.js';
+import { IndexError } from '../error/IndexError.js';
+import { factory, isFactory } from '../utils/factory.js';
+import { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isObjectWrappingMap, isOperatorNode, isParenthesisNode, isPartitionedMap, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../utils/is.js';
+import { deepFlatten, isLegacyFactory } from '../utils/object.js';
+import * as emitter from './../utils/emitter.js';
+import { DEFAULT_CONFIG } from './config.js';
+import { configFactory } from './function/config.js';
+import { importFactory } from './function/import.js';
+
+/**
+ * Create a mathjs instance from given factory functions and optionally config
+ *
+ * Usage:
+ *
+ *     const mathjs1 = create({ createAdd, createMultiply, ...})
+ *     const config = { number: 'BigNumber' }
+ *     const mathjs2 = create(all, config)
+ *
+ * @param {Object} [factories] An object with factory functions
+ *                             The object can contain nested objects,
+ *                             all nested objects will be flattened.
+ * @param {Object} [config]    Available options:
+ *                            {number} relTol
+ *                              Minimum relative difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {number} absTol
+ *                              Minimum absolute difference between two
+ *                              compared values, used by all comparison functions.
+ *                            {string} matrix
+ *                              A string 'Matrix' (default) or 'Array'.
+ *                            {string} number
+ *                              A string 'number' (default), 'BigNumber', or 'Fraction'
+ *                            {number} precision
+ *                              The number of significant digits for BigNumbers.
+ *                              Not applicable for Numbers.
+ *                            {boolean} predictable
+ *                              Predictable output type of functions. When true,
+ *                              output type depends only on the input types. When
+ *                              false (default), output type can vary depending
+ *                              on input values. For example `math.sqrt(-4)`
+ *                              returns `complex('2i')` when predictable is false, and
+ *                              returns `NaN` when true.
+ *                            {string} randomSeed
+ *                              Random seed for seeded pseudo random number generator.
+ *                              Set to null to randomly seed.
+ * @returns {Object} Returns a bare-bone math.js instance containing
+ *                   functions:
+ *                   - `import` to add new functions
+ *                   - `config` to change configuration
+ *                   - `on`, `off`, `once`, `emit` for events
+ */
+export function create(factories, config) {
+  var configInternal = _extends({}, DEFAULT_CONFIG, config);
+
+  // simple test for ES5 support
+  if (typeof Object.create !== 'function') {
+    throw new Error('ES5 not supported by this JavaScript engine. ' + 'Please load the es5-shim and es5-sham library for compatibility.');
+  }
+
+  // create the mathjs instance
+  var math = emitter.mixin({
+    // only here for backward compatibility for legacy factory functions
+    isNumber,
+    isComplex,
+    isBigNumber,
+    isBigInt,
+    isFraction,
+    isUnit,
+    isString,
+    isArray,
+    isMatrix,
+    isCollection,
+    isDenseMatrix,
+    isSparseMatrix,
+    isRange,
+    isIndex,
+    isBoolean,
+    isResultSet,
+    isHelp,
+    isFunction,
+    isDate,
+    isRegExp,
+    isObject,
+    isMap,
+    isPartitionedMap,
+    isObjectWrappingMap,
+    isNull,
+    isUndefined,
+    isAccessorNode,
+    isArrayNode,
+    isAssignmentNode,
+    isBlockNode,
+    isConditionalNode,
+    isConstantNode,
+    isFunctionAssignmentNode,
+    isFunctionNode,
+    isIndexNode,
+    isNode,
+    isObjectNode,
+    isOperatorNode,
+    isParenthesisNode,
+    isRangeNode,
+    isRelationalNode,
+    isSymbolNode,
+    isChain
+  });
+
+  // load config function and apply provided config
+  math.config = configFactory(configInternal, math.emit);
+  math.expression = {
+    transform: {},
+    mathWithTransform: {
+      config: math.config
+    }
+  };
+
+  // cached factories and instances used by function load
+  var legacyFactories = [];
+  var legacyInstances = [];
+
+  /**
+   * Load a function or data type from a factory.
+   * If the function or data type already exists, the existing instance is
+   * returned.
+   * @param {Function} factory
+   * @returns {*}
+   */
+  function load(factory) {
+    if (isFactory(factory)) {
+      return factory(math);
+    }
+    var firstProperty = factory[Object.keys(factory)[0]];
+    if (isFactory(firstProperty)) {
+      return firstProperty(math);
+    }
+    if (!isLegacyFactory(factory)) {
+      console.warn('Factory object with properties `type`, `name`, and `factory` expected', factory);
+      throw new Error('Factory object with properties `type`, `name`, and `factory` expected');
+    }
+    var index = legacyFactories.indexOf(factory);
+    var instance;
+    if (index === -1) {
+      // doesn't yet exist
+      if (factory.math === true) {
+        // pass with math namespace
+        instance = factory.factory(math.type, configInternal, load, math.typed, math);
+      } else {
+        instance = factory.factory(math.type, configInternal, load, math.typed);
+      }
+
+      // append to the cache
+      legacyFactories.push(factory);
+      legacyInstances.push(instance);
+    } else {
+      // already existing function, return the cached instance
+      instance = legacyInstances[index];
+    }
+    return instance;
+  }
+  var importedFactories = {};
+
+  // load the import function
+  function lazyTyped() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    return math.typed.apply(math.typed, args);
+  }
+  lazyTyped.isTypedFunction = typedFunction.isTypedFunction;
+  var internalImport = importFactory(lazyTyped, load, math, importedFactories);
+  math.import = internalImport;
+
+  // listen for changes in config, import all functions again when changed
+  // TODO: move this listener into the import function?
+  math.on('config', () => {
+    Object.values(importedFactories).forEach(factory => {
+      if (factory && factory.meta && factory.meta.recreateOnConfigChange) {
+        // FIXME: only re-create when the current instance is the same as was initially created
+        // FIXME: delete the functions/constants before importing them again?
+        internalImport(factory, {
+          override: true
+        });
+      }
+    });
+  });
+
+  // the create function exposed on the mathjs instance is bound to
+  // the factory functions passed before
+  math.create = create.bind(null, factories);
+
+  // export factory function
+  math.factory = factory;
+
+  // import the factory functions like createAdd as an array instead of object,
+  // else they will get a different naming (`createAdd` instead of `add`).
+  math.import(Object.values(deepFlatten(factories)));
+  math.ArgumentsError = ArgumentsError;
+  math.DimensionError = DimensionError;
+  math.IndexError = IndexError;
+  return math;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/config.js b/node_modules/mathjs/lib/esm/core/function/config.js
new file mode 100644
index 0000000..56915e2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/config.js
@@ -0,0 +1,107 @@
+import { clone, deepExtend } from '../../utils/object.js';
+import { DEFAULT_CONFIG } from '../config.js';
+export var MATRIX_OPTIONS = ['Matrix', 'Array']; // valid values for option matrix
+export var NUMBER_OPTIONS = ['number', 'BigNumber', 'bigint', 'Fraction']; // valid values for option number
+
+export function configFactory(config, emit) {
+  /**
+   * Set configuration options for math.js, and get current options.
+   * Will emit a 'config' event, with arguments (curr, prev, changes).
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *     math.config(config: Object): Object
+   *
+   * Examples:
+   *
+   *     import { create, all } from 'mathjs'
+   *
+   *     // create a mathjs instance
+   *     const math = create(all)
+   *
+   *     math.config().number                // outputs 'number'
+   *     math.evaluate('0.4')                // outputs number 0.4
+   *     math.config({number: 'Fraction'})
+   *     math.evaluate('0.4')                // outputs Fraction 2/5
+   *
+   * @param {Object} [options] Available options:
+   *                            {number} relTol
+   *                              Minimum relative difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {number} absTol
+   *                              Minimum absolute difference between two
+   *                              compared values, used by all comparison functions.
+   *                            {string} matrix
+   *                              A string 'Matrix' (default) or 'Array'.
+   *                            {string} number
+   *                              A string 'number' (default), 'BigNumber', 'bigint', or 'Fraction'
+   *                            {number} precision
+   *                              The number of significant digits for BigNumbers.
+   *                              Not applicable for Numbers.
+   *                            {string} parenthesis
+   *                              How to display parentheses in LaTeX and string
+   *                              output.
+   *                            {string} randomSeed
+   *                              Random seed for seeded pseudo random number generator.
+   *                              Set to null to randomly seed.
+   * @return {Object} Returns the current configuration
+   */
+  function _config(options) {
+    if (options) {
+      if (options.epsilon !== undefined) {
+        // this if is only for backwards compatibility, it can be removed in the future.
+        console.warn('Warning: The configuration option "epsilon" is deprecated. Use "relTol" and "absTol" instead.');
+        var optionsFix = clone(options);
+        optionsFix.relTol = options.epsilon;
+        optionsFix.absTol = options.epsilon * 1e-3;
+        delete optionsFix.epsilon;
+        return _config(optionsFix);
+      }
+      var prev = clone(config);
+
+      // validate some of the options
+      validateOption(options, 'matrix', MATRIX_OPTIONS);
+      validateOption(options, 'number', NUMBER_OPTIONS);
+
+      // merge options
+      deepExtend(config, options);
+      var curr = clone(config);
+      var changes = clone(options);
+
+      // emit 'config' event
+      emit('config', curr, prev, changes);
+      return curr;
+    } else {
+      return clone(config);
+    }
+  }
+
+  // attach the valid options to the function so they can be extended
+  _config.MATRIX_OPTIONS = MATRIX_OPTIONS;
+  _config.NUMBER_OPTIONS = NUMBER_OPTIONS;
+
+  // attach the config properties as readonly properties to the config function
+  Object.keys(DEFAULT_CONFIG).forEach(key => {
+    Object.defineProperty(_config, key, {
+      get: () => config[key],
+      enumerable: true,
+      configurable: true
+    });
+  });
+  return _config;
+}
+
+/**
+ * Validate an option
+ * @param {Object} options         Object with options
+ * @param {string} name            Name of the option to validate
+ * @param {Array.<string>} values  Array with valid values for this option
+ */
+function validateOption(options, name, values) {
+  if (options[name] !== undefined && !values.includes(options[name])) {
+    // unknown value
+    console.warn('Warning: Unknown value "' + options[name] + '" for configuration option "' + name + '". ' + 'Available options: ' + values.map(value => JSON.stringify(value)).join(', ') + '.');
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/import.js b/node_modules/mathjs/lib/esm/core/function/import.js
new file mode 100644
index 0000000..015d0a7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/import.js
@@ -0,0 +1,341 @@
+import { isBigNumber, isComplex, isFraction, isMatrix, isObject, isUnit } from '../../utils/is.js';
+import { isFactory, stripOptionalNotation } from '../../utils/factory.js';
+import { hasOwnProperty, lazy } from '../../utils/object.js';
+import { ArgumentsError } from '../../error/ArgumentsError.js';
+export function importFactory(typed, load, math, importedFactories) {
+  /**
+   * Import functions from an object or a module.
+   *
+   * This function is only available on a mathjs instance created using `create`.
+   *
+   * Syntax:
+   *
+   *    math.import(functions)
+   *    math.import(functions, options)
+   *
+   * Where:
+   *
+   * - `functions: Object`
+   *   An object with functions or factories to be imported.
+   * - `options: Object` An object with import options. Available options:
+   *   - `override: boolean`
+   *     If true, existing functions will be overwritten. False by default.
+   *   - `silent: boolean`
+   *     If true, the function will not throw errors on duplicates or invalid
+   *     types. False by default.
+   *   - `wrap: boolean`
+   *     If true, the functions will be wrapped in a wrapper function
+   *     which converts data types like Matrix to primitive data types like Array.
+   *     The wrapper is needed when extending math.js with libraries which do not
+   *     support these data type. False by default.
+   *
+   * Examples:
+   *
+   *    import { create, all } from 'mathjs'
+   *    import * as numbers from 'numbers'
+   *
+   *    // create a mathjs instance
+   *    const math = create(all)
+   *
+   *    // define new functions and variables
+   *    math.import({
+   *      myvalue: 42,
+   *      hello: function (name) {
+   *        return 'hello, ' + name + '!'
+   *      }
+   *    })
+   *
+   *    // use the imported function and variable
+   *    math.myvalue * 2               // 84
+   *    math.hello('user')             // 'hello, user!'
+   *
+   *    // import the npm module 'numbers'
+   *    // (must be installed first with `npm install numbers`)
+   *    math.import(numbers, {wrap: true})
+   *
+   *    math.fibonacci(7) // returns 13
+   *
+   * @param {Object | Array} functions  Object with functions to be imported.
+   * @param {Object} [options]          Import options.
+   */
+  function mathImport(functions, options) {
+    var num = arguments.length;
+    if (num !== 1 && num !== 2) {
+      throw new ArgumentsError('import', num, 1, 2);
+    }
+    if (!options) {
+      options = {};
+    }
+    function flattenImports(flatValues, value, name) {
+      if (Array.isArray(value)) {
+        value.forEach(item => flattenImports(flatValues, item));
+      } else if (isObject(value) || isModule(value)) {
+        for (var _name in value) {
+          if (hasOwnProperty(value, _name)) {
+            flattenImports(flatValues, value[_name], _name);
+          }
+        }
+      } else if (isFactory(value) || name !== undefined) {
+        var flatName = isFactory(value) ? isTransformFunctionFactory(value) ? value.fn + '.transform' // TODO: this is ugly
+        : value.fn : name;
+
+        // we allow importing the same function twice if it points to the same implementation
+        if (hasOwnProperty(flatValues, flatName) && flatValues[flatName] !== value && !options.silent) {
+          throw new Error('Cannot import "' + flatName + '" twice');
+        }
+        flatValues[flatName] = value;
+      } else {
+        if (!options.silent) {
+          throw new TypeError('Factory, Object, or Array expected');
+        }
+      }
+    }
+    var flatValues = {};
+    flattenImports(flatValues, functions);
+    for (var name in flatValues) {
+      if (hasOwnProperty(flatValues, name)) {
+        // console.log('import', name)
+        var value = flatValues[name];
+        if (isFactory(value)) {
+          // we ignore name here and enforce the name of the factory
+          // maybe at some point we do want to allow overriding it
+          // in that case we can implement an option overrideFactoryNames: true
+          _importFactory(value, options);
+        } else if (isSupportedType(value)) {
+          _import(name, value, options);
+        } else {
+          if (!options.silent) {
+            throw new TypeError('Factory, Object, or Array expected');
+          }
+        }
+      }
+    }
+  }
+
+  /**
+   * Add a property to the math namespace
+   * @param {string} name
+   * @param {*} value
+   * @param {Object} options  See import for a description of the options
+   * @private
+   */
+  function _import(name, value, options) {
+    var _math$Unit;
+    // TODO: refactor this function, it's to complicated and contains duplicate code
+    if (options.wrap && typeof value === 'function') {
+      // create a wrapper around the function
+      value = _wrap(value);
+    }
+
+    // turn a plain function with a typed-function signature into a typed-function
+    if (hasTypedFunctionSignature(value)) {
+      value = typed(name, {
+        [value.signature]: value
+      });
+    }
+    if (typed.isTypedFunction(math[name]) && typed.isTypedFunction(value)) {
+      if (options.override) {
+        // give the typed function the right name
+        value = typed(name, value.signatures);
+      } else {
+        // merge the existing and typed function
+        value = typed(math[name], value);
+      }
+      math[name] = value;
+      delete importedFactories[name];
+      _importTransform(name, value);
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+    var isDefined = math[name] !== undefined;
+    var isValuelessUnit = (_math$Unit = math.Unit) === null || _math$Unit === void 0 ? void 0 : _math$Unit.isValuelessUnit(name);
+    if (!isDefined && !isValuelessUnit || options.override) {
+      math[name] = value;
+      delete importedFactories[name];
+      _importTransform(name, value);
+      math.emit('import', name, function resolver() {
+        return value;
+      });
+      return;
+    }
+    if (!options.silent) {
+      throw new Error('Cannot import "' + name + '": already exists');
+    }
+  }
+  function _importTransform(name, value) {
+    if (value && typeof value.transform === 'function') {
+      math.expression.transform[name] = value.transform;
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value.transform;
+      }
+    } else {
+      // remove existing transform
+      delete math.expression.transform[name];
+      if (allowedInExpressions(name)) {
+        math.expression.mathWithTransform[name] = value;
+      }
+    }
+  }
+  function _deleteTransform(name) {
+    delete math.expression.transform[name];
+    if (allowedInExpressions(name)) {
+      math.expression.mathWithTransform[name] = math[name];
+    } else {
+      delete math.expression.mathWithTransform[name];
+    }
+  }
+
+  /**
+   * Create a wrapper a round an function which converts the arguments
+   * to their primitive values (like convert a Matrix to Array)
+   * @param {Function} fn
+   * @return {Function} Returns the wrapped function
+   * @private
+   */
+  function _wrap(fn) {
+    var wrapper = function wrapper() {
+      var args = [];
+      for (var i = 0, len = arguments.length; i < len; i++) {
+        var arg = arguments[i];
+        args[i] = arg && arg.valueOf();
+      }
+      return fn.apply(math, args);
+    };
+    if (fn.transform) {
+      wrapper.transform = fn.transform;
+    }
+    return wrapper;
+  }
+
+  /**
+   * Import an instance of a factory into math.js
+   * @param {function(scope: object)} factory
+   * @param {Object} options  See import for a description of the options
+   * @param {string} [name=factory.name] Optional custom name
+   * @private
+   */
+  function _importFactory(factory, options) {
+    var _factory$meta$formerl, _factory$meta;
+    var name = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : factory.fn;
+    if (name.includes('.')) {
+      throw new Error('Factory name should not contain a nested path. ' + 'Name: ' + JSON.stringify(name));
+    }
+    var namespace = isTransformFunctionFactory(factory) ? math.expression.transform : math;
+    var existingTransform = name in math.expression.transform;
+    var existing = hasOwnProperty(namespace, name) ? namespace[name] : undefined;
+    var resolver = function resolver() {
+      // collect all dependencies, handle finding both functions and classes and other special cases
+      var dependencies = {};
+      factory.dependencies.map(stripOptionalNotation).forEach(dependency => {
+        if (dependency.includes('.')) {
+          throw new Error('Factory dependency should not contain a nested path. ' + 'Name: ' + JSON.stringify(dependency));
+        }
+        if (dependency === 'math') {
+          dependencies.math = math;
+        } else if (dependency === 'mathWithTransform') {
+          dependencies.mathWithTransform = math.expression.mathWithTransform;
+        } else if (dependency === 'classes') {
+          // special case for json reviver
+          dependencies.classes = math;
+        } else {
+          dependencies[dependency] = math[dependency];
+        }
+      });
+      var instance = /* #__PURE__ */factory(dependencies);
+      if (instance && typeof instance.transform === 'function') {
+        throw new Error('Transforms cannot be attached to factory functions. ' + 'Please create a separate function for it with export const path = "expression.transform"');
+      }
+      if (existing === undefined || options.override) {
+        return instance;
+      }
+      if (typed.isTypedFunction(existing) && typed.isTypedFunction(instance)) {
+        // merge the existing and new typed function
+        return typed(existing, instance);
+      }
+      if (options.silent) {
+        // keep existing, ignore imported function
+        return existing;
+      } else {
+        throw new Error('Cannot import "' + name + '": already exists');
+      }
+    };
+    var former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';
+    var needsTransform = isTransformFunctionFactory(factory) || factoryAllowedInExpressions(factory);
+    var withTransform = math.expression.mathWithTransform;
+
+    // TODO: add unit test with non-lazy factory
+    if (!factory.meta || factory.meta.lazy !== false) {
+      lazy(namespace, name, resolver);
+      if (former) lazy(namespace, former, resolver);
+
+      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+        if (former) _deleteTransform(former);
+      } else {
+        if (needsTransform) {
+          lazy(withTransform, name, () => namespace[name]);
+          if (former) lazy(withTransform, former, () => namespace[name]);
+        }
+      }
+    } else {
+      namespace[name] = resolver();
+      if (former) namespace[former] = namespace[name];
+
+      // FIXME: remove the `if (existing &&` condition again. Can we make sure subset is loaded before subset.transform? (Name collision, and no dependencies between the two)
+      if (existing && existingTransform) {
+        _deleteTransform(name);
+        if (former) _deleteTransform(former);
+      } else {
+        if (needsTransform) {
+          lazy(withTransform, name, () => namespace[name]);
+          if (former) lazy(withTransform, former, () => namespace[name]);
+        }
+      }
+    }
+
+    // TODO: improve factories, store a list with imports instead which can be re-played
+    importedFactories[name] = factory;
+    math.emit('import', name, resolver);
+  }
+
+  /**
+   * Check whether given object is a type which can be imported
+   * @param {Function | number | string | boolean | null | Unit | Complex} object
+   * @return {boolean}
+   * @private
+   */
+  function isSupportedType(object) {
+    return typeof object === 'function' || typeof object === 'number' || typeof object === 'string' || typeof object === 'boolean' || object === null || isUnit(object) || isComplex(object) || isBigNumber(object) || isFraction(object) || isMatrix(object) || Array.isArray(object);
+  }
+  function isModule(object) {
+    return typeof object === 'object' && object[Symbol.toStringTag] === 'Module';
+  }
+  function hasTypedFunctionSignature(fn) {
+    return typeof fn === 'function' && typeof fn.signature === 'string';
+  }
+  function allowedInExpressions(name) {
+    return !hasOwnProperty(unsafe, name);
+  }
+  function factoryAllowedInExpressions(factory) {
+    return !factory.fn.includes('.') &&
+    // FIXME: make checking on path redundant, check on meta data instead
+    !hasOwnProperty(unsafe, factory.fn) && (!factory.meta || !factory.meta.isClass);
+  }
+  function isTransformFunctionFactory(factory) {
+    return factory !== undefined && factory.meta !== undefined && factory.meta.isTransformFunction === true || false;
+  }
+
+  // namespaces and functions not available in the parser for safety reasons
+  var unsafe = {
+    expression: true,
+    type: true,
+    docs: true,
+    error: true,
+    json: true,
+    chain: true // chain method not supported. Note that there is a unit chain too.
+  };
+  return mathImport;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/core/function/typed.js b/node_modules/mathjs/lib/esm/core/function/typed.js
new file mode 100644
index 0000000..7ea4b99
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/core/function/typed.js
@@ -0,0 +1,455 @@
+/**
+ * Create a typed-function which checks the types of the arguments and
+ * can match them against multiple provided signatures. The typed-function
+ * automatically converts inputs in order to find a matching signature.
+ * Typed functions throw informative errors in case of wrong input arguments.
+ *
+ * See the library [typed-function](https://github.com/josdejong/typed-function)
+ * for detailed documentation.
+ *
+ * Syntax:
+ *
+ *     math.typed(name, signatures) : function
+ *     math.typed(signatures) : function
+ *
+ * Examples:
+ *
+ *     // create a typed function with multiple types per argument (type union)
+ *     const fn2 = typed({
+ *       'number | boolean': function (b) {
+ *         return 'b is a number or boolean'
+ *       },
+ *       'string, number | boolean': function (a, b) {
+ *         return 'a is a string, b is a number or boolean'
+ *       }
+ *     })
+ *
+ *     // create a typed function with an any type argument
+ *     const log = typed({
+ *       'string, any': function (event, data) {
+ *         console.log('event: ' + event + ', data: ' + JSON.stringify(data))
+ *       }
+ *     })
+ *
+ * @param {string} [name]                          Optional name for the typed-function
+ * @param {Object<string, function>} signatures   Object with one or multiple function signatures
+ * @returns {function} The created typed-function.
+ */
+
+import typedFunction from 'typed-function';
+import { factory } from '../../utils/factory.js';
+import { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigInt, isBigNumber, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMap, isMatrix, isNode, isNull, isNumber, isObject, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRegExp, isRelationalNode, isResultSet, isSparseMatrix, isString, isSymbolNode, isUndefined, isUnit } from '../../utils/is.js';
+import { digits } from '../../utils/number.js';
+
+// returns a new instance of typed-function
+var _createTyped2 = function _createTyped() {
+  // initially, return the original instance of typed-function
+  // consecutively, return a new instance from typed.create.
+  _createTyped2 = typedFunction.create;
+  return typedFunction;
+};
+var dependencies = ['?BigNumber', '?Complex', '?DenseMatrix', '?Fraction'];
+
+/**
+ * Factory function for creating a new typed instance
+ * @param {Object} dependencies   Object with data types like Complex and BigNumber
+ * @returns {Function}
+ */
+export var createTyped = /* #__PURE__ */factory('typed', dependencies, function createTyped(_ref) {
+  var {
+    BigNumber,
+    Complex,
+    DenseMatrix,
+    Fraction
+  } = _ref;
+  // TODO: typed-function must be able to silently ignore signatures with unknown data types
+
+  // get a new instance of typed-function
+  var typed = _createTyped2();
+
+  // define all types. The order of the types determines in which order function
+  // arguments are type-checked (so for performance it's important to put the
+  // most used types first).
+  typed.clear();
+  typed.addTypes([{
+    name: 'number',
+    test: isNumber
+  }, {
+    name: 'Complex',
+    test: isComplex
+  }, {
+    name: 'BigNumber',
+    test: isBigNumber
+  }, {
+    name: 'bigint',
+    test: isBigInt
+  }, {
+    name: 'Fraction',
+    test: isFraction
+  }, {
+    name: 'Unit',
+    test: isUnit
+  },
+  // The following type matches a valid variable name, i.e., an alphanumeric
+  // string starting with an alphabetic character. It is used (at least)
+  // in the definition of the derivative() function, as the argument telling
+  // what to differentiate over must (currently) be a variable.
+  // TODO: deprecate the identifier type (it's not used anymore, see https://github.com/josdejong/mathjs/issues/3253)
+  {
+    name: 'identifier',
+    test: s => isString && /^(?:[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])(?:[0-9A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0560-\u0588\u05D0-\u05EA\u05EF-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u0860-\u086A\u0870-\u0887\u0889-\u088E\u08A0-\u08C9\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u09FC\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0AF9\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58-\u0C5A\u0C5D\u0C60\u0C61\u0C80\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D04-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D54-\u0D56\u0D5F-\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E86-\u0E8A\u0E8C-\u0EA3\u0EA5\u0EA7-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F5\u13F8-\u13FD\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u1711\u171F-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1878\u1880-\u1884\u1887-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4C\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1C80-\u1C8A\u1C90-\u1CBA\u1CBD-\u1CBF\u1CE9-\u1CEC\u1CEE-\u1CF3\u1CF5\u1CF6\u1CFA\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312F\u3131-\u318E\u31A0-\u31BF\u31F0-\u31FF\u3400-\u4DBF\u4E00-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA7CD\uA7D0\uA7D1\uA7D3\uA7D5-\uA7DC\uA7F2-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA8FD\uA8FE\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB69\uAB70-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF2D-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDCB0-\uDCD3\uDCD8-\uDCFB\uDD00-\uDD27\uDD30-\uDD63\uDD70-\uDD7A\uDD7C-\uDD8A\uDD8C-\uDD92\uDD94\uDD95\uDD97-\uDDA1\uDDA3-\uDDB1\uDDB3-\uDDB9\uDDBB\uDDBC\uDDC0-\uDDF3\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67\uDF80-\uDF85\uDF87-\uDFB0\uDFB2-\uDFBA]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDCE0-\uDCF2\uDCF4\uDCF5\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE35\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48\uDC80-\uDCB2\uDCC0-\uDCF2\uDD00-\uDD23\uDD4A-\uDD65\uDD6F-\uDD85\uDE80-\uDEA9\uDEB0\uDEB1\uDEC2-\uDEC4\uDF00-\uDF1C\uDF27\uDF30-\uDF45\uDF70-\uDF81\uDFB0-\uDFC4\uDFE0-\uDFF6]|\uD804[\uDC03-\uDC37\uDC71\uDC72\uDC75\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD44\uDD47\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDDDC\uDE00-\uDE11\uDE13-\uDE2B\uDE3F\uDE40\uDE80-\uDE86\uDE88\uDE8A-\uDE8D\uDE8F-\uDE9D\uDE9F-\uDEA8\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF50\uDF5D-\uDF61\uDF80-\uDF89\uDF8B\uDF8E\uDF90-\uDFB5\uDFB7\uDFD1\uDFD3]|\uD805[\uDC00-\uDC34\uDC47-\uDC4A\uDC5F-\uDC61\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDDD8-\uDDDB\uDE00-\uDE2F\uDE44\uDE80-\uDEAA\uDEB8\uDF00-\uDF1A\uDF40-\uDF46]|\uD806[\uDC00-\uDC2B\uDCA0-\uDCDF\uDCFF-\uDD06\uDD09\uDD0C-\uDD13\uDD15\uDD16\uDD18-\uDD2F\uDD3F\uDD41\uDDA0-\uDDA7\uDDAA-\uDDD0\uDDE1\uDDE3\uDE00\uDE0B-\uDE32\uDE3A\uDE50\uDE5C-\uDE89\uDE9D\uDEB0-\uDEF8\uDFC0-\uDFE0]|\uD807[\uDC00-\uDC08\uDC0A-\uDC2E\uDC40\uDC72-\uDC8F\uDD00-\uDD06\uDD08\uDD09\uDD0B-\uDD30\uDD46\uDD60-\uDD65\uDD67\uDD68\uDD6A-\uDD89\uDD98\uDEE0-\uDEF2\uDF02\uDF04-\uDF10\uDF12-\uDF33\uDFB0]|\uD808[\uDC00-\uDF99]|\uD809[\uDC80-\uDD43]|\uD80B[\uDF90-\uDFF0]|[\uD80C\uD80E\uD80F\uD81C-\uD820\uD822\uD840-\uD868\uD86A-\uD86C\uD86F-\uD872\uD874-\uD879\uD880-\uD883\uD885-\uD887][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2F\uDC41-\uDC46\uDC60-\uDFFF]|\uD810[\uDC00-\uDFFA]|\uD811[\uDC00-\uDE46]|\uD818[\uDD00-\uDD1D]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE70-\uDEBE\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDD40-\uDD6C\uDE40-\uDE7F\uDF00-\uDF4A\uDF50\uDF93-\uDF9F\uDFE0\uDFE1\uDFE3]|\uD821[\uDC00-\uDFF7]|\uD823[\uDC00-\uDCD5\uDCFF-\uDD08]|\uD82B[\uDFF0-\uDFF3\uDFF5-\uDFFB\uDFFD\uDFFE]|\uD82C[\uDC00-\uDD22\uDD32\uDD50-\uDD52\uDD55\uDD64-\uDD67\uDD70-\uDEFB]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD837[\uDF00-\uDF1E\uDF25-\uDF2A]|\uD838[\uDC30-\uDC6D\uDD00-\uDD2C\uDD37-\uDD3D\uDD4E\uDE90-\uDEAD\uDEC0-\uDEEB]|\uD839[\uDCD0-\uDCEB\uDDD0-\uDDED\uDDF0\uDFE0-\uDFE6\uDFE8-\uDFEB\uDFED\uDFEE\uDFF0-\uDFFE]|\uD83A[\uDC00-\uDCC4\uDD00-\uDD43\uDD4B]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDEDF\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF39\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D\uDC20-\uDFFF]|\uD873[\uDC00-\uDEA1\uDEB0-\uDFFF]|\uD87A[\uDC00-\uDFE0\uDFF0-\uDFFF]|\uD87B[\uDC00-\uDE5D]|\uD87E[\uDC00-\uDE1D]|\uD884[\uDC00-\uDF4A\uDF50-\uDFFF]|\uD888[\uDC00-\uDFAF])*$/.test(s)
+  }, {
+    name: 'string',
+    test: isString
+  }, {
+    name: 'Chain',
+    test: isChain
+  }, {
+    name: 'Array',
+    test: isArray
+  }, {
+    name: 'Matrix',
+    test: isMatrix
+  }, {
+    name: 'DenseMatrix',
+    test: isDenseMatrix
+  }, {
+    name: 'SparseMatrix',
+    test: isSparseMatrix
+  }, {
+    name: 'Range',
+    test: isRange
+  }, {
+    name: 'Index',
+    test: isIndex
+  }, {
+    name: 'boolean',
+    test: isBoolean
+  }, {
+    name: 'ResultSet',
+    test: isResultSet
+  }, {
+    name: 'Help',
+    test: isHelp
+  }, {
+    name: 'function',
+    test: isFunction
+  }, {
+    name: 'Date',
+    test: isDate
+  }, {
+    name: 'RegExp',
+    test: isRegExp
+  }, {
+    name: 'null',
+    test: isNull
+  }, {
+    name: 'undefined',
+    test: isUndefined
+  }, {
+    name: 'AccessorNode',
+    test: isAccessorNode
+  }, {
+    name: 'ArrayNode',
+    test: isArrayNode
+  }, {
+    name: 'AssignmentNode',
+    test: isAssignmentNode
+  }, {
+    name: 'BlockNode',
+    test: isBlockNode
+  }, {
+    name: 'ConditionalNode',
+    test: isConditionalNode
+  }, {
+    name: 'ConstantNode',
+    test: isConstantNode
+  }, {
+    name: 'FunctionNode',
+    test: isFunctionNode
+  }, {
+    name: 'FunctionAssignmentNode',
+    test: isFunctionAssignmentNode
+  }, {
+    name: 'IndexNode',
+    test: isIndexNode
+  }, {
+    name: 'Node',
+    test: isNode
+  }, {
+    name: 'ObjectNode',
+    test: isObjectNode
+  }, {
+    name: 'OperatorNode',
+    test: isOperatorNode
+  }, {
+    name: 'ParenthesisNode',
+    test: isParenthesisNode
+  }, {
+    name: 'RangeNode',
+    test: isRangeNode
+  }, {
+    name: 'RelationalNode',
+    test: isRelationalNode
+  }, {
+    name: 'SymbolNode',
+    test: isSymbolNode
+  }, {
+    name: 'Map',
+    test: isMap
+  }, {
+    name: 'Object',
+    test: isObject
+  } // order 'Object' last, it matches on other classes too
+  ]);
+  typed.addConversions([{
+    from: 'number',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+
+      // note: conversion from number to BigNumber can fail if x has >15 digits
+      if (digits(x) > 15) {
+        throw new TypeError('Cannot implicitly convert a number with >15 significant digits to BigNumber ' + '(value: ' + x + '). ' + 'Use function bignumber(x) to convert to BigNumber.');
+      }
+      return new BigNumber(x);
+    }
+  }, {
+    from: 'number',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x, 0);
+    }
+  }, {
+    from: 'BigNumber',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x.toNumber(), 0);
+    }
+  }, {
+    from: 'bigint',
+    to: 'number',
+    convert: function convert(x) {
+      if (x > Number.MAX_SAFE_INTEGER) {
+        throw new TypeError('Cannot implicitly convert bigint to number: ' + 'value exceeds the max safe integer value (value: ' + x + ')');
+      }
+      return Number(x);
+    }
+  }, {
+    from: 'bigint',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      return new BigNumber(x.toString());
+    }
+  }, {
+    from: 'bigint',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      return new Fraction(x);
+    }
+  }, {
+    from: 'Fraction',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      throw new TypeError('Cannot implicitly convert a Fraction to BigNumber or vice versa. ' + 'Use function bignumber(x) to convert to BigNumber or fraction(x) to convert to Fraction.');
+    }
+  }, {
+    from: 'Fraction',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      return new Complex(x.valueOf(), 0);
+    }
+  }, {
+    from: 'number',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      var f = new Fraction(x);
+      if (f.valueOf() !== x) {
+        throw new TypeError('Cannot implicitly convert a number to a Fraction when there will be a loss of precision ' + '(value: ' + x + '). ' + 'Use function fraction(x) to convert to Fraction.');
+      }
+      return f;
+    }
+  }, {
+    // FIXME: add conversion from Fraction to number, for example for `sqrt(fraction(1,3))`
+    //  from: 'Fraction',
+    //  to: 'number',
+    //  convert: function (x) {
+    //    return x.valueOf()
+    //  }
+    // }, {
+    from: 'string',
+    to: 'number',
+    convert: function convert(x) {
+      var n = Number(x);
+      if (isNaN(n)) {
+        throw new Error('Cannot convert "' + x + '" to a number');
+      }
+      return n;
+    }
+  }, {
+    from: 'string',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      try {
+        return new BigNumber(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigNumber');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'bigint',
+    convert: function convert(x) {
+      try {
+        return BigInt(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to BigInt');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      try {
+        return new Fraction(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Fraction');
+      }
+    }
+  }, {
+    from: 'string',
+    to: 'Complex',
+    convert: function convert(x) {
+      if (!Complex) {
+        throwNoComplex(x);
+      }
+      try {
+        return new Complex(x);
+      } catch (err) {
+        throw new Error('Cannot convert "' + x + '" to Complex');
+      }
+    }
+  }, {
+    from: 'boolean',
+    to: 'number',
+    convert: function convert(x) {
+      return +x;
+    }
+  }, {
+    from: 'boolean',
+    to: 'BigNumber',
+    convert: function convert(x) {
+      if (!BigNumber) {
+        throwNoBignumber(x);
+      }
+      return new BigNumber(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'bigint',
+    convert: function convert(x) {
+      return BigInt(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'Fraction',
+    convert: function convert(x) {
+      if (!Fraction) {
+        throwNoFraction(x);
+      }
+      return new Fraction(+x);
+    }
+  }, {
+    from: 'boolean',
+    to: 'string',
+    convert: function convert(x) {
+      return String(x);
+    }
+  }, {
+    from: 'Array',
+    to: 'Matrix',
+    convert: function convert(array) {
+      if (!DenseMatrix) {
+        throwNoMatrix();
+      }
+      return new DenseMatrix(array);
+    }
+  }, {
+    from: 'Matrix',
+    to: 'Array',
+    convert: function convert(matrix) {
+      return matrix.valueOf();
+    }
+  }]);
+
+  // Provide a suggestion on how to call a function elementwise
+  // This was added primarily as guidance for the v10 -> v11 transition,
+  // and could potentially be removed in the future if it no longer seems
+  // to be helpful.
+  typed.onMismatch = (name, args, signatures) => {
+    var usualError = typed.createError(name, args, signatures);
+    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&
+    // check if the function can be unary:
+    signatures.some(sig => !sig.params.includes(','))) {
+      var err = new TypeError("Function '".concat(name, "' doesn't apply to matrices. To call it ") + "elementwise on a matrix 'M', try 'map(M, ".concat(name, ")'."));
+      err.data = usualError.data;
+      throw err;
+    }
+    throw usualError;
+  };
+
+  // Provide a suggestion on how to call a function elementwise
+  // This was added primarily as guidance for the v10 -> v11 transition,
+  // and could potentially be removed in the future if it no longer seems
+  // to be helpful.
+  typed.onMismatch = (name, args, signatures) => {
+    var usualError = typed.createError(name, args, signatures);
+    if (['wrongType', 'mismatch'].includes(usualError.data.category) && args.length === 1 && isCollection(args[0]) &&
+    // check if the function can be unary:
+    signatures.some(sig => !sig.params.includes(','))) {
+      var err = new TypeError("Function '".concat(name, "' doesn't apply to matrices. To call it ") + "elementwise on a matrix 'M', try 'map(M, ".concat(name, ")'."));
+      err.data = usualError.data;
+      throw err;
+    }
+    throw usualError;
+  };
+  return typed;
+});
+function throwNoBignumber(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a BigNumber: no class 'BigNumber' provided"));
+}
+function throwNoComplex(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Complex number: no class 'Complex' provided"));
+}
+function throwNoMatrix() {
+  throw new Error('Cannot convert array into a Matrix: no class \'DenseMatrix\' provided');
+}
+function throwNoFraction(x) {
+  throw new Error("Cannot convert value ".concat(x, " into a Fraction, no class 'Fraction' provided."));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/defaultInstance.js b/node_modules/mathjs/lib/esm/defaultInstance.js
new file mode 100644
index 0000000..630e984
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/defaultInstance.js
@@ -0,0 +1,3 @@
+import * as all from './factoriesAny.js';
+import { create } from './core/create.js';
+export default create(all);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js b/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js
new file mode 100644
index 0000000..b4e11fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/allFactoriesAny.js
@@ -0,0 +1,3 @@
+// creating all factories here in a separate file is needed to get tree-shaking working
+import * as allFactories from '../factoriesAny.js';
+export var all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js b/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js
new file mode 100644
index 0000000..e4221a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/allFactoriesNumber.js
@@ -0,0 +1,3 @@
+// creating all factories here in a separate file is needed to get tree-shaking working
+import * as allFactories from '../factoriesNumber.js';
+export var all = allFactories;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/configReadonly.js b/node_modules/mathjs/lib/esm/entry/configReadonly.js
new file mode 100644
index 0000000..c6f5702
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/configReadonly.js
@@ -0,0 +1,15 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { DEFAULT_CONFIG } from '../core/config.js';
+import { MATRIX_OPTIONS, NUMBER_OPTIONS } from '../core/function/config.js';
+
+// create a read-only version of config
+export var config = function config(options) {
+  if (options) {
+    throw new Error('The global config is readonly. \n' + 'Please create a mathjs instance if you want to change the default configuration. \n' + 'Example:\n' + '\n' + '  import { create, all } from \'mathjs\';\n' + '  const mathjs = create(all);\n' + '  mathjs.config({ number: \'BigNumber\' });\n');
+  }
+  return Object.freeze(DEFAULT_CONFIG);
+};
+_extends(config, DEFAULT_CONFIG, {
+  MATRIX_OPTIONS,
+  NUMBER_OPTIONS
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js
new file mode 100644
index 0000000..7123a0f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny.generated.js
@@ -0,0 +1,371 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+export { absDependencies } from './dependenciesAny/dependenciesAbs.generated.js';
+export { AccessorNodeDependencies } from './dependenciesAny/dependenciesAccessorNode.generated.js';
+export { acosDependencies } from './dependenciesAny/dependenciesAcos.generated.js';
+export { acoshDependencies } from './dependenciesAny/dependenciesAcosh.generated.js';
+export { acotDependencies } from './dependenciesAny/dependenciesAcot.generated.js';
+export { acothDependencies } from './dependenciesAny/dependenciesAcoth.generated.js';
+export { acscDependencies } from './dependenciesAny/dependenciesAcsc.generated.js';
+export { acschDependencies } from './dependenciesAny/dependenciesAcsch.generated.js';
+export { addDependencies } from './dependenciesAny/dependenciesAdd.generated.js';
+export { addScalarDependencies } from './dependenciesAny/dependenciesAddScalar.generated.js';
+export { andDependencies } from './dependenciesAny/dependenciesAnd.generated.js';
+export { andTransformDependencies } from './dependenciesAny/dependenciesAndTransform.generated.js';
+export { argDependencies } from './dependenciesAny/dependenciesArg.generated.js';
+export { ArrayNodeDependencies } from './dependenciesAny/dependenciesArrayNode.generated.js';
+export { asecDependencies } from './dependenciesAny/dependenciesAsec.generated.js';
+export { asechDependencies } from './dependenciesAny/dependenciesAsech.generated.js';
+export { asinDependencies } from './dependenciesAny/dependenciesAsin.generated.js';
+export { asinhDependencies } from './dependenciesAny/dependenciesAsinh.generated.js';
+export { AssignmentNodeDependencies } from './dependenciesAny/dependenciesAssignmentNode.generated.js';
+export { atanDependencies } from './dependenciesAny/dependenciesAtan.generated.js';
+export { atan2Dependencies } from './dependenciesAny/dependenciesAtan2.generated.js';
+export { atanhDependencies } from './dependenciesAny/dependenciesAtanh.generated.js';
+export { atomicMassDependencies } from './dependenciesAny/dependenciesAtomicMass.generated.js';
+export { avogadroDependencies } from './dependenciesAny/dependenciesAvogadro.generated.js';
+export { bellNumbersDependencies } from './dependenciesAny/dependenciesBellNumbers.generated.js';
+export { BigNumberDependencies } from './dependenciesAny/dependenciesBigNumberClass.generated.js';
+export { bigintDependencies } from './dependenciesAny/dependenciesBigint.generated.js';
+export { bignumberDependencies } from './dependenciesAny/dependenciesBignumber.generated.js';
+export { binDependencies } from './dependenciesAny/dependenciesBin.generated.js';
+export { bitAndDependencies } from './dependenciesAny/dependenciesBitAnd.generated.js';
+export { bitAndTransformDependencies } from './dependenciesAny/dependenciesBitAndTransform.generated.js';
+export { bitNotDependencies } from './dependenciesAny/dependenciesBitNot.generated.js';
+export { bitOrDependencies } from './dependenciesAny/dependenciesBitOr.generated.js';
+export { bitOrTransformDependencies } from './dependenciesAny/dependenciesBitOrTransform.generated.js';
+export { bitXorDependencies } from './dependenciesAny/dependenciesBitXor.generated.js';
+export { BlockNodeDependencies } from './dependenciesAny/dependenciesBlockNode.generated.js';
+export { bohrMagnetonDependencies } from './dependenciesAny/dependenciesBohrMagneton.generated.js';
+export { bohrRadiusDependencies } from './dependenciesAny/dependenciesBohrRadius.generated.js';
+export { boltzmannDependencies } from './dependenciesAny/dependenciesBoltzmann.generated.js';
+export { booleanDependencies } from './dependenciesAny/dependenciesBoolean.generated.js';
+export { catalanDependencies } from './dependenciesAny/dependenciesCatalan.generated.js';
+export { cbrtDependencies } from './dependenciesAny/dependenciesCbrt.generated.js';
+export { ceilDependencies } from './dependenciesAny/dependenciesCeil.generated.js';
+export { chainDependencies } from './dependenciesAny/dependenciesChain.generated.js';
+export { ChainDependencies } from './dependenciesAny/dependenciesChainClass.generated.js';
+export { classicalElectronRadiusDependencies } from './dependenciesAny/dependenciesClassicalElectronRadius.generated.js';
+export { cloneDependencies } from './dependenciesAny/dependenciesClone.generated.js';
+export { columnDependencies } from './dependenciesAny/dependenciesColumn.generated.js';
+export { columnTransformDependencies } from './dependenciesAny/dependenciesColumnTransform.generated.js';
+export { combinationsDependencies } from './dependenciesAny/dependenciesCombinations.generated.js';
+export { combinationsWithRepDependencies } from './dependenciesAny/dependenciesCombinationsWithRep.generated.js';
+export { compareDependencies } from './dependenciesAny/dependenciesCompare.generated.js';
+export { compareNaturalDependencies } from './dependenciesAny/dependenciesCompareNatural.generated.js';
+export { compareTextDependencies } from './dependenciesAny/dependenciesCompareText.generated.js';
+export { compileDependencies } from './dependenciesAny/dependenciesCompile.generated.js';
+export { complexDependencies } from './dependenciesAny/dependenciesComplex.generated.js';
+export { ComplexDependencies } from './dependenciesAny/dependenciesComplexClass.generated.js';
+export { compositionDependencies } from './dependenciesAny/dependenciesComposition.generated.js';
+export { concatDependencies } from './dependenciesAny/dependenciesConcat.generated.js';
+export { concatTransformDependencies } from './dependenciesAny/dependenciesConcatTransform.generated.js';
+export { ConditionalNodeDependencies } from './dependenciesAny/dependenciesConditionalNode.generated.js';
+export { conductanceQuantumDependencies } from './dependenciesAny/dependenciesConductanceQuantum.generated.js';
+export { conjDependencies } from './dependenciesAny/dependenciesConj.generated.js';
+export { ConstantNodeDependencies } from './dependenciesAny/dependenciesConstantNode.generated.js';
+export { corrDependencies } from './dependenciesAny/dependenciesCorr.generated.js';
+export { cosDependencies } from './dependenciesAny/dependenciesCos.generated.js';
+export { coshDependencies } from './dependenciesAny/dependenciesCosh.generated.js';
+export { cotDependencies } from './dependenciesAny/dependenciesCot.generated.js';
+export { cothDependencies } from './dependenciesAny/dependenciesCoth.generated.js';
+export { coulombDependencies } from './dependenciesAny/dependenciesCoulomb.generated.js';
+export { coulombConstantDependencies } from './dependenciesAny/dependenciesCoulombConstant.generated.js';
+export { countDependencies } from './dependenciesAny/dependenciesCount.generated.js';
+export { createUnitDependencies } from './dependenciesAny/dependenciesCreateUnit.generated.js';
+export { crossDependencies } from './dependenciesAny/dependenciesCross.generated.js';
+export { cscDependencies } from './dependenciesAny/dependenciesCsc.generated.js';
+export { cschDependencies } from './dependenciesAny/dependenciesCsch.generated.js';
+export { ctransposeDependencies } from './dependenciesAny/dependenciesCtranspose.generated.js';
+export { cubeDependencies } from './dependenciesAny/dependenciesCube.generated.js';
+export { cumsumDependencies } from './dependenciesAny/dependenciesCumSum.generated.js';
+export { cumsumTransformDependencies } from './dependenciesAny/dependenciesCumSumTransform.generated.js';
+export { deepEqualDependencies } from './dependenciesAny/dependenciesDeepEqual.generated.js';
+export { DenseMatrixDependencies } from './dependenciesAny/dependenciesDenseMatrixClass.generated.js';
+export { derivativeDependencies } from './dependenciesAny/dependenciesDerivative.generated.js';
+export { detDependencies } from './dependenciesAny/dependenciesDet.generated.js';
+export { deuteronMassDependencies } from './dependenciesAny/dependenciesDeuteronMass.generated.js';
+export { diagDependencies } from './dependenciesAny/dependenciesDiag.generated.js';
+export { diffDependencies } from './dependenciesAny/dependenciesDiff.generated.js';
+export { diffTransformDependencies } from './dependenciesAny/dependenciesDiffTransform.generated.js';
+export { distanceDependencies } from './dependenciesAny/dependenciesDistance.generated.js';
+export { divideDependencies } from './dependenciesAny/dependenciesDivide.generated.js';
+export { divideScalarDependencies } from './dependenciesAny/dependenciesDivideScalar.generated.js';
+export { dotDependencies } from './dependenciesAny/dependenciesDot.generated.js';
+export { dotDivideDependencies } from './dependenciesAny/dependenciesDotDivide.generated.js';
+export { dotMultiplyDependencies } from './dependenciesAny/dependenciesDotMultiply.generated.js';
+export { dotPowDependencies } from './dependenciesAny/dependenciesDotPow.generated.js';
+export { eDependencies } from './dependenciesAny/dependenciesE.generated.js';
+export { efimovFactorDependencies } from './dependenciesAny/dependenciesEfimovFactor.generated.js';
+export { eigsDependencies } from './dependenciesAny/dependenciesEigs.generated.js';
+export { electricConstantDependencies } from './dependenciesAny/dependenciesElectricConstant.generated.js';
+export { electronMassDependencies } from './dependenciesAny/dependenciesElectronMass.generated.js';
+export { elementaryChargeDependencies } from './dependenciesAny/dependenciesElementaryCharge.generated.js';
+export { equalDependencies } from './dependenciesAny/dependenciesEqual.generated.js';
+export { equalScalarDependencies } from './dependenciesAny/dependenciesEqualScalar.generated.js';
+export { equalTextDependencies } from './dependenciesAny/dependenciesEqualText.generated.js';
+export { erfDependencies } from './dependenciesAny/dependenciesErf.generated.js';
+export { evaluateDependencies } from './dependenciesAny/dependenciesEvaluate.generated.js';
+export { expDependencies } from './dependenciesAny/dependenciesExp.generated.js';
+export { expmDependencies } from './dependenciesAny/dependenciesExpm.generated.js';
+export { expm1Dependencies } from './dependenciesAny/dependenciesExpm1.generated.js';
+export { factorialDependencies } from './dependenciesAny/dependenciesFactorial.generated.js';
+export { falseDependencies } from './dependenciesAny/dependenciesFalse.generated.js';
+export { faradayDependencies } from './dependenciesAny/dependenciesFaraday.generated.js';
+export { fermiCouplingDependencies } from './dependenciesAny/dependenciesFermiCoupling.generated.js';
+export { fftDependencies } from './dependenciesAny/dependenciesFft.generated.js';
+export { FibonacciHeapDependencies } from './dependenciesAny/dependenciesFibonacciHeapClass.generated.js';
+export { filterDependencies } from './dependenciesAny/dependenciesFilter.generated.js';
+export { filterTransformDependencies } from './dependenciesAny/dependenciesFilterTransform.generated.js';
+export { fineStructureDependencies } from './dependenciesAny/dependenciesFineStructure.generated.js';
+export { firstRadiationDependencies } from './dependenciesAny/dependenciesFirstRadiation.generated.js';
+export { fixDependencies } from './dependenciesAny/dependenciesFix.generated.js';
+export { flattenDependencies } from './dependenciesAny/dependenciesFlatten.generated.js';
+export { floorDependencies } from './dependenciesAny/dependenciesFloor.generated.js';
+export { forEachDependencies } from './dependenciesAny/dependenciesForEach.generated.js';
+export { forEachTransformDependencies } from './dependenciesAny/dependenciesForEachTransform.generated.js';
+export { formatDependencies } from './dependenciesAny/dependenciesFormat.generated.js';
+export { fractionDependencies } from './dependenciesAny/dependenciesFraction.generated.js';
+export { FractionDependencies } from './dependenciesAny/dependenciesFractionClass.generated.js';
+export { freqzDependencies } from './dependenciesAny/dependenciesFreqz.generated.js';
+export { FunctionAssignmentNodeDependencies } from './dependenciesAny/dependenciesFunctionAssignmentNode.generated.js';
+export { FunctionNodeDependencies } from './dependenciesAny/dependenciesFunctionNode.generated.js';
+export { gammaDependencies } from './dependenciesAny/dependenciesGamma.generated.js';
+export { gasConstantDependencies } from './dependenciesAny/dependenciesGasConstant.generated.js';
+export { gcdDependencies } from './dependenciesAny/dependenciesGcd.generated.js';
+export { getMatrixDataTypeDependencies } from './dependenciesAny/dependenciesGetMatrixDataType.generated.js';
+export { gravitationConstantDependencies } from './dependenciesAny/dependenciesGravitationConstant.generated.js';
+export { gravityDependencies } from './dependenciesAny/dependenciesGravity.generated.js';
+export { hartreeEnergyDependencies } from './dependenciesAny/dependenciesHartreeEnergy.generated.js';
+export { hasNumericValueDependencies } from './dependenciesAny/dependenciesHasNumericValue.generated.js';
+export { helpDependencies } from './dependenciesAny/dependenciesHelp.generated.js';
+export { HelpDependencies } from './dependenciesAny/dependenciesHelpClass.generated.js';
+export { hexDependencies } from './dependenciesAny/dependenciesHex.generated.js';
+export { hypotDependencies } from './dependenciesAny/dependenciesHypot.generated.js';
+export { iDependencies } from './dependenciesAny/dependenciesI.generated.js';
+export { identityDependencies } from './dependenciesAny/dependenciesIdentity.generated.js';
+export { ifftDependencies } from './dependenciesAny/dependenciesIfft.generated.js';
+export { imDependencies } from './dependenciesAny/dependenciesIm.generated.js';
+export { ImmutableDenseMatrixDependencies } from './dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js';
+export { indexDependencies } from './dependenciesAny/dependenciesIndex.generated.js';
+export { IndexDependencies } from './dependenciesAny/dependenciesIndexClass.generated.js';
+export { IndexNodeDependencies } from './dependenciesAny/dependenciesIndexNode.generated.js';
+export { indexTransformDependencies } from './dependenciesAny/dependenciesIndexTransform.generated.js';
+export { InfinityDependencies } from './dependenciesAny/dependenciesInfinity.generated.js';
+export { intersectDependencies } from './dependenciesAny/dependenciesIntersect.generated.js';
+export { invDependencies } from './dependenciesAny/dependenciesInv.generated.js';
+export { inverseConductanceQuantumDependencies } from './dependenciesAny/dependenciesInverseConductanceQuantum.generated.js';
+export { invmodDependencies } from './dependenciesAny/dependenciesInvmod.generated.js';
+export { isIntegerDependencies } from './dependenciesAny/dependenciesIsInteger.generated.js';
+export { isNaNDependencies } from './dependenciesAny/dependenciesIsNaN.generated.js';
+export { isNegativeDependencies } from './dependenciesAny/dependenciesIsNegative.generated.js';
+export { isNumericDependencies } from './dependenciesAny/dependenciesIsNumeric.generated.js';
+export { isPositiveDependencies } from './dependenciesAny/dependenciesIsPositive.generated.js';
+export { isPrimeDependencies } from './dependenciesAny/dependenciesIsPrime.generated.js';
+export { isZeroDependencies } from './dependenciesAny/dependenciesIsZero.generated.js';
+export { kldivergenceDependencies } from './dependenciesAny/dependenciesKldivergence.generated.js';
+export { klitzingDependencies } from './dependenciesAny/dependenciesKlitzing.generated.js';
+export { kronDependencies } from './dependenciesAny/dependenciesKron.generated.js';
+export { LN10Dependencies } from './dependenciesAny/dependenciesLN10.generated.js';
+export { LN2Dependencies } from './dependenciesAny/dependenciesLN2.generated.js';
+export { LOG10EDependencies } from './dependenciesAny/dependenciesLOG10E.generated.js';
+export { LOG2EDependencies } from './dependenciesAny/dependenciesLOG2E.generated.js';
+export { largerDependencies } from './dependenciesAny/dependenciesLarger.generated.js';
+export { largerEqDependencies } from './dependenciesAny/dependenciesLargerEq.generated.js';
+export { lcmDependencies } from './dependenciesAny/dependenciesLcm.generated.js';
+export { leafCountDependencies } from './dependenciesAny/dependenciesLeafCount.generated.js';
+export { leftShiftDependencies } from './dependenciesAny/dependenciesLeftShift.generated.js';
+export { lgammaDependencies } from './dependenciesAny/dependenciesLgamma.generated.js';
+export { logDependencies } from './dependenciesAny/dependenciesLog.generated.js';
+export { log10Dependencies } from './dependenciesAny/dependenciesLog10.generated.js';
+export { log1pDependencies } from './dependenciesAny/dependenciesLog1p.generated.js';
+export { log2Dependencies } from './dependenciesAny/dependenciesLog2.generated.js';
+export { loschmidtDependencies } from './dependenciesAny/dependenciesLoschmidt.generated.js';
+export { lsolveDependencies } from './dependenciesAny/dependenciesLsolve.generated.js';
+export { lsolveAllDependencies } from './dependenciesAny/dependenciesLsolveAll.generated.js';
+export { lupDependencies } from './dependenciesAny/dependenciesLup.generated.js';
+export { lusolveDependencies } from './dependenciesAny/dependenciesLusolve.generated.js';
+export { lyapDependencies } from './dependenciesAny/dependenciesLyap.generated.js';
+export { madDependencies } from './dependenciesAny/dependenciesMad.generated.js';
+export { magneticConstantDependencies } from './dependenciesAny/dependenciesMagneticConstant.generated.js';
+export { magneticFluxQuantumDependencies } from './dependenciesAny/dependenciesMagneticFluxQuantum.generated.js';
+export { mapDependencies } from './dependenciesAny/dependenciesMap.generated.js';
+export { mapSlicesDependencies } from './dependenciesAny/dependenciesMapSlices.generated.js';
+export { mapSlicesTransformDependencies } from './dependenciesAny/dependenciesMapSlicesTransform.generated.js';
+export { mapTransformDependencies } from './dependenciesAny/dependenciesMapTransform.generated.js';
+export { matrixDependencies } from './dependenciesAny/dependenciesMatrix.generated.js';
+export { MatrixDependencies } from './dependenciesAny/dependenciesMatrixClass.generated.js';
+export { matrixFromColumnsDependencies } from './dependenciesAny/dependenciesMatrixFromColumns.generated.js';
+export { matrixFromFunctionDependencies } from './dependenciesAny/dependenciesMatrixFromFunction.generated.js';
+export { matrixFromRowsDependencies } from './dependenciesAny/dependenciesMatrixFromRows.generated.js';
+export { maxDependencies } from './dependenciesAny/dependenciesMax.generated.js';
+export { maxTransformDependencies } from './dependenciesAny/dependenciesMaxTransform.generated.js';
+export { meanDependencies } from './dependenciesAny/dependenciesMean.generated.js';
+export { meanTransformDependencies } from './dependenciesAny/dependenciesMeanTransform.generated.js';
+export { medianDependencies } from './dependenciesAny/dependenciesMedian.generated.js';
+export { minDependencies } from './dependenciesAny/dependenciesMin.generated.js';
+export { minTransformDependencies } from './dependenciesAny/dependenciesMinTransform.generated.js';
+export { modDependencies } from './dependenciesAny/dependenciesMod.generated.js';
+export { modeDependencies } from './dependenciesAny/dependenciesMode.generated.js';
+export { molarMassDependencies } from './dependenciesAny/dependenciesMolarMass.generated.js';
+export { molarMassC12Dependencies } from './dependenciesAny/dependenciesMolarMassC12.generated.js';
+export { molarPlanckConstantDependencies } from './dependenciesAny/dependenciesMolarPlanckConstant.generated.js';
+export { molarVolumeDependencies } from './dependenciesAny/dependenciesMolarVolume.generated.js';
+export { multinomialDependencies } from './dependenciesAny/dependenciesMultinomial.generated.js';
+export { multiplyDependencies } from './dependenciesAny/dependenciesMultiply.generated.js';
+export { multiplyScalarDependencies } from './dependenciesAny/dependenciesMultiplyScalar.generated.js';
+export { NaNDependencies } from './dependenciesAny/dependenciesNaN.generated.js';
+export { neutronMassDependencies } from './dependenciesAny/dependenciesNeutronMass.generated.js';
+export { NodeDependencies } from './dependenciesAny/dependenciesNode.generated.js';
+export { normDependencies } from './dependenciesAny/dependenciesNorm.generated.js';
+export { notDependencies } from './dependenciesAny/dependenciesNot.generated.js';
+export { nthRootDependencies } from './dependenciesAny/dependenciesNthRoot.generated.js';
+export { nthRootsDependencies } from './dependenciesAny/dependenciesNthRoots.generated.js';
+export { nuclearMagnetonDependencies } from './dependenciesAny/dependenciesNuclearMagneton.generated.js';
+export { nullDependencies } from './dependenciesAny/dependenciesNull.generated.js';
+export { nullishDependencies } from './dependenciesAny/dependenciesNullish.generated.js';
+export { nullishTransformDependencies } from './dependenciesAny/dependenciesNullishTransform.generated.js';
+export { numberDependencies } from './dependenciesAny/dependenciesNumber.generated.js';
+export { numericDependencies } from './dependenciesAny/dependenciesNumeric.generated.js';
+export { ObjectNodeDependencies } from './dependenciesAny/dependenciesObjectNode.generated.js';
+export { octDependencies } from './dependenciesAny/dependenciesOct.generated.js';
+export { onesDependencies } from './dependenciesAny/dependenciesOnes.generated.js';
+export { OperatorNodeDependencies } from './dependenciesAny/dependenciesOperatorNode.generated.js';
+export { orDependencies } from './dependenciesAny/dependenciesOr.generated.js';
+export { orTransformDependencies } from './dependenciesAny/dependenciesOrTransform.generated.js';
+export { ParenthesisNodeDependencies } from './dependenciesAny/dependenciesParenthesisNode.generated.js';
+export { parseDependencies } from './dependenciesAny/dependenciesParse.generated.js';
+export { parserDependencies } from './dependenciesAny/dependenciesParser.generated.js';
+export { ParserDependencies } from './dependenciesAny/dependenciesParserClass.generated.js';
+export { partitionSelectDependencies } from './dependenciesAny/dependenciesPartitionSelect.generated.js';
+export { permutationsDependencies } from './dependenciesAny/dependenciesPermutations.generated.js';
+export { phiDependencies } from './dependenciesAny/dependenciesPhi.generated.js';
+export { piDependencies } from './dependenciesAny/dependenciesPi.generated.js';
+export { pickRandomDependencies } from './dependenciesAny/dependenciesPickRandom.generated.js';
+export { pinvDependencies } from './dependenciesAny/dependenciesPinv.generated.js';
+export { planckChargeDependencies } from './dependenciesAny/dependenciesPlanckCharge.generated.js';
+export { planckConstantDependencies } from './dependenciesAny/dependenciesPlanckConstant.generated.js';
+export { planckLengthDependencies } from './dependenciesAny/dependenciesPlanckLength.generated.js';
+export { planckMassDependencies } from './dependenciesAny/dependenciesPlanckMass.generated.js';
+export { planckTemperatureDependencies } from './dependenciesAny/dependenciesPlanckTemperature.generated.js';
+export { planckTimeDependencies } from './dependenciesAny/dependenciesPlanckTime.generated.js';
+export { polynomialRootDependencies } from './dependenciesAny/dependenciesPolynomialRoot.generated.js';
+export { powDependencies } from './dependenciesAny/dependenciesPow.generated.js';
+export { printDependencies } from './dependenciesAny/dependenciesPrint.generated.js';
+export { printTransformDependencies } from './dependenciesAny/dependenciesPrintTransform.generated.js';
+export { prodDependencies } from './dependenciesAny/dependenciesProd.generated.js';
+export { protonMassDependencies } from './dependenciesAny/dependenciesProtonMass.generated.js';
+export { qrDependencies } from './dependenciesAny/dependenciesQr.generated.js';
+export { quantileSeqDependencies } from './dependenciesAny/dependenciesQuantileSeq.generated.js';
+export { quantileSeqTransformDependencies } from './dependenciesAny/dependenciesQuantileSeqTransform.generated.js';
+export { quantumOfCirculationDependencies } from './dependenciesAny/dependenciesQuantumOfCirculation.generated.js';
+export { randomDependencies } from './dependenciesAny/dependenciesRandom.generated.js';
+export { randomIntDependencies } from './dependenciesAny/dependenciesRandomInt.generated.js';
+export { rangeDependencies } from './dependenciesAny/dependenciesRange.generated.js';
+export { RangeDependencies } from './dependenciesAny/dependenciesRangeClass.generated.js';
+export { RangeNodeDependencies } from './dependenciesAny/dependenciesRangeNode.generated.js';
+export { rangeTransformDependencies } from './dependenciesAny/dependenciesRangeTransform.generated.js';
+export { rationalizeDependencies } from './dependenciesAny/dependenciesRationalize.generated.js';
+export { reDependencies } from './dependenciesAny/dependenciesRe.generated.js';
+export { reducedPlanckConstantDependencies } from './dependenciesAny/dependenciesReducedPlanckConstant.generated.js';
+export { RelationalNodeDependencies } from './dependenciesAny/dependenciesRelationalNode.generated.js';
+export { replacerDependencies } from './dependenciesAny/dependenciesReplacer.generated.js';
+export { reshapeDependencies } from './dependenciesAny/dependenciesReshape.generated.js';
+export { resizeDependencies } from './dependenciesAny/dependenciesResize.generated.js';
+export { resolveDependencies } from './dependenciesAny/dependenciesResolve.generated.js';
+export { ResultSetDependencies } from './dependenciesAny/dependenciesResultSet.generated.js';
+export { reviverDependencies } from './dependenciesAny/dependenciesReviver.generated.js';
+export { rightArithShiftDependencies } from './dependenciesAny/dependenciesRightArithShift.generated.js';
+export { rightLogShiftDependencies } from './dependenciesAny/dependenciesRightLogShift.generated.js';
+export { rotateDependencies } from './dependenciesAny/dependenciesRotate.generated.js';
+export { rotationMatrixDependencies } from './dependenciesAny/dependenciesRotationMatrix.generated.js';
+export { roundDependencies } from './dependenciesAny/dependenciesRound.generated.js';
+export { rowDependencies } from './dependenciesAny/dependenciesRow.generated.js';
+export { rowTransformDependencies } from './dependenciesAny/dependenciesRowTransform.generated.js';
+export { rydbergDependencies } from './dependenciesAny/dependenciesRydberg.generated.js';
+export { SQRT1_2Dependencies } from './dependenciesAny/dependenciesSQRT1_2.generated.js'; // eslint-disable-line camelcase
+export { SQRT2Dependencies } from './dependenciesAny/dependenciesSQRT2.generated.js';
+export { sackurTetrodeDependencies } from './dependenciesAny/dependenciesSackurTetrode.generated.js';
+export { schurDependencies } from './dependenciesAny/dependenciesSchur.generated.js';
+export { secDependencies } from './dependenciesAny/dependenciesSec.generated.js';
+export { sechDependencies } from './dependenciesAny/dependenciesSech.generated.js';
+export { secondRadiationDependencies } from './dependenciesAny/dependenciesSecondRadiation.generated.js';
+export { setCartesianDependencies } from './dependenciesAny/dependenciesSetCartesian.generated.js';
+export { setDifferenceDependencies } from './dependenciesAny/dependenciesSetDifference.generated.js';
+export { setDistinctDependencies } from './dependenciesAny/dependenciesSetDistinct.generated.js';
+export { setIntersectDependencies } from './dependenciesAny/dependenciesSetIntersect.generated.js';
+export { setIsSubsetDependencies } from './dependenciesAny/dependenciesSetIsSubset.generated.js';
+export { setMultiplicityDependencies } from './dependenciesAny/dependenciesSetMultiplicity.generated.js';
+export { setPowersetDependencies } from './dependenciesAny/dependenciesSetPowerset.generated.js';
+export { setSizeDependencies } from './dependenciesAny/dependenciesSetSize.generated.js';
+export { setSymDifferenceDependencies } from './dependenciesAny/dependenciesSetSymDifference.generated.js';
+export { setUnionDependencies } from './dependenciesAny/dependenciesSetUnion.generated.js';
+export { signDependencies } from './dependenciesAny/dependenciesSign.generated.js';
+export { simplifyDependencies } from './dependenciesAny/dependenciesSimplify.generated.js';
+export { simplifyConstantDependencies } from './dependenciesAny/dependenciesSimplifyConstant.generated.js';
+export { simplifyCoreDependencies } from './dependenciesAny/dependenciesSimplifyCore.generated.js';
+export { sinDependencies } from './dependenciesAny/dependenciesSin.generated.js';
+export { sinhDependencies } from './dependenciesAny/dependenciesSinh.generated.js';
+export { sizeDependencies } from './dependenciesAny/dependenciesSize.generated.js';
+export { sluDependencies } from './dependenciesAny/dependenciesSlu.generated.js';
+export { smallerDependencies } from './dependenciesAny/dependenciesSmaller.generated.js';
+export { smallerEqDependencies } from './dependenciesAny/dependenciesSmallerEq.generated.js';
+export { solveODEDependencies } from './dependenciesAny/dependenciesSolveODE.generated.js';
+export { sortDependencies } from './dependenciesAny/dependenciesSort.generated.js';
+export { SpaDependencies } from './dependenciesAny/dependenciesSpaClass.generated.js';
+export { sparseDependencies } from './dependenciesAny/dependenciesSparse.generated.js';
+export { SparseMatrixDependencies } from './dependenciesAny/dependenciesSparseMatrixClass.generated.js';
+export { speedOfLightDependencies } from './dependenciesAny/dependenciesSpeedOfLight.generated.js';
+export { splitUnitDependencies } from './dependenciesAny/dependenciesSplitUnit.generated.js';
+export { sqrtDependencies } from './dependenciesAny/dependenciesSqrt.generated.js';
+export { sqrtmDependencies } from './dependenciesAny/dependenciesSqrtm.generated.js';
+export { squareDependencies } from './dependenciesAny/dependenciesSquare.generated.js';
+export { squeezeDependencies } from './dependenciesAny/dependenciesSqueeze.generated.js';
+export { stdDependencies } from './dependenciesAny/dependenciesStd.generated.js';
+export { stdTransformDependencies } from './dependenciesAny/dependenciesStdTransform.generated.js';
+export { stefanBoltzmannDependencies } from './dependenciesAny/dependenciesStefanBoltzmann.generated.js';
+export { stirlingS2Dependencies } from './dependenciesAny/dependenciesStirlingS2.generated.js';
+export { stringDependencies } from './dependenciesAny/dependenciesString.generated.js';
+export { subsetDependencies } from './dependenciesAny/dependenciesSubset.generated.js';
+export { subsetTransformDependencies } from './dependenciesAny/dependenciesSubsetTransform.generated.js';
+export { subtractDependencies } from './dependenciesAny/dependenciesSubtract.generated.js';
+export { subtractScalarDependencies } from './dependenciesAny/dependenciesSubtractScalar.generated.js';
+export { sumDependencies } from './dependenciesAny/dependenciesSum.generated.js';
+export { sumTransformDependencies } from './dependenciesAny/dependenciesSumTransform.generated.js';
+export { sylvesterDependencies } from './dependenciesAny/dependenciesSylvester.generated.js';
+export { SymbolNodeDependencies } from './dependenciesAny/dependenciesSymbolNode.generated.js';
+export { symbolicEqualDependencies } from './dependenciesAny/dependenciesSymbolicEqual.generated.js';
+export { tanDependencies } from './dependenciesAny/dependenciesTan.generated.js';
+export { tanhDependencies } from './dependenciesAny/dependenciesTanh.generated.js';
+export { tauDependencies } from './dependenciesAny/dependenciesTau.generated.js';
+export { thomsonCrossSectionDependencies } from './dependenciesAny/dependenciesThomsonCrossSection.generated.js';
+export { toDependencies } from './dependenciesAny/dependenciesTo.generated.js';
+export { toBestDependencies } from './dependenciesAny/dependenciesToBest.generated.js';
+export { traceDependencies } from './dependenciesAny/dependenciesTrace.generated.js';
+export { transposeDependencies } from './dependenciesAny/dependenciesTranspose.generated.js';
+export { trueDependencies } from './dependenciesAny/dependenciesTrue.generated.js';
+export { typeOfDependencies } from './dependenciesAny/dependenciesTypeOf.generated.js';
+export { typedDependencies } from './dependenciesAny/dependenciesTyped.generated.js';
+export { unaryMinusDependencies } from './dependenciesAny/dependenciesUnaryMinus.generated.js';
+export { unaryPlusDependencies } from './dependenciesAny/dependenciesUnaryPlus.generated.js';
+export { unequalDependencies } from './dependenciesAny/dependenciesUnequal.generated.js';
+export { UnitDependencies } from './dependenciesAny/dependenciesUnitClass.generated.js';
+export { unitDependencies } from './dependenciesAny/dependenciesUnitFunction.generated.js';
+export { EDependencies } from './dependenciesAny/dependenciesUppercaseE.generated.js';
+export { PIDependencies } from './dependenciesAny/dependenciesUppercasePi.generated.js';
+export { usolveDependencies } from './dependenciesAny/dependenciesUsolve.generated.js';
+export { usolveAllDependencies } from './dependenciesAny/dependenciesUsolveAll.generated.js';
+export { vacuumImpedanceDependencies } from './dependenciesAny/dependenciesVacuumImpedance.generated.js';
+export { varianceDependencies } from './dependenciesAny/dependenciesVariance.generated.js';
+export { varianceTransformDependencies } from './dependenciesAny/dependenciesVarianceTransform.generated.js';
+export { versionDependencies } from './dependenciesAny/dependenciesVersion.generated.js';
+export { weakMixingAngleDependencies } from './dependenciesAny/dependenciesWeakMixingAngle.generated.js';
+export { wienDisplacementDependencies } from './dependenciesAny/dependenciesWienDisplacement.generated.js';
+export { xgcdDependencies } from './dependenciesAny/dependenciesXgcd.generated.js';
+export { xorDependencies } from './dependenciesAny/dependenciesXor.generated.js';
+export { zerosDependencies } from './dependenciesAny/dependenciesZeros.generated.js';
+export { zetaDependencies } from './dependenciesAny/dependenciesZeta.generated.js';
+export { zpk2tfDependencies } from './dependenciesAny/dependenciesZpk2tf.generated.js';
+export { all } from './allFactoriesAny.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js
new file mode 100644
index 0000000..fd8dd2f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAbs.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAbs } from '../../factoriesAny.js';
+export var absDependencies = {
+  typedDependencies,
+  createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..08601f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAccessorNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAccessorNode } from '../../factoriesAny.js';
+export var AccessorNodeDependencies = {
+  NodeDependencies,
+  subsetDependencies,
+  createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js
new file mode 100644
index 0000000..a88d60d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcos.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcos } from '../../factoriesAny.js';
+export var acosDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..f5ff7aa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcosh.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcosh } from '../../factoriesAny.js';
+export var acoshDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js
new file mode 100644
index 0000000..178f6a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcot.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcot } from '../../factoriesAny.js';
+export var acotDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..0bc9997
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcoth.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcoth } from '../../factoriesAny.js';
+export var acothDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..cc075d4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsc.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsc } from '../../factoriesAny.js';
+export var acscDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..197e00b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAcsch.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsch } from '../../factoriesAny.js';
+export var acschDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js
new file mode 100644
index 0000000..2806c0f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAdd.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAdd } from '../../factoriesAny.js';
+export var addDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  addScalarDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..d1cb442
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAddScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAddScalar } from '../../factoriesAny.js';
+export var addScalarDependencies = {
+  typedDependencies,
+  createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js
new file mode 100644
index 0000000..acc9883
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAnd.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { notDependencies } from './dependenciesNot.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createAnd } from '../../factoriesAny.js';
+export var andDependencies = {
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  notDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAndTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAndTransform.generated.js
new file mode 100644
index 0000000..d22c0cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAndTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { notDependencies } from './dependenciesNot.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createAndTransform } from '../../factoriesAny.js';
+export var andTransformDependencies = {
+  addDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  notDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createAndTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js
new file mode 100644
index 0000000..6181dfe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArg.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createArg } from '../../factoriesAny.js';
+export var argDependencies = {
+  typedDependencies,
+  createArg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..66403fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesArrayNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createArrayNode } from '../../factoriesAny.js';
+export var ArrayNodeDependencies = {
+  NodeDependencies,
+  createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js
new file mode 100644
index 0000000..3173050
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsec.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsec } from '../../factoriesAny.js';
+export var asecDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js
new file mode 100644
index 0000000..d061320
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsech.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsech } from '../../factoriesAny.js';
+export var asechDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  typedDependencies,
+  createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js
new file mode 100644
index 0000000..1367635
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsin.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsin } from '../../factoriesAny.js';
+export var asinDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..bcce057
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAsinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsinh } from '../../factoriesAny.js';
+export var asinhDependencies = {
+  typedDependencies,
+  createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..28d47d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAssignmentNode } from '../../factoriesAny.js';
+export var AssignmentNodeDependencies = {
+  matrixDependencies,
+  NodeDependencies,
+  subsetDependencies,
+  createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js
new file mode 100644
index 0000000..b9b5fcc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan } from '../../factoriesAny.js';
+export var atanDependencies = {
+  typedDependencies,
+  createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..9071251
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtan2.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan2 } from '../../factoriesAny.js';
+export var atan2Dependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..ab877f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtanh.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtanh } from '../../factoriesAny.js';
+export var atanhDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js
new file mode 100644
index 0000000..84ad047
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAtomicMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createAtomicMass } from '../../factoriesAny.js';
+export var atomicMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createAtomicMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js
new file mode 100644
index 0000000..f2339b0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesAvogadro.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createAvogadro } from '../../factoriesAny.js';
+export var avogadroDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createAvogadro
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..369a7f0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBellNumbers.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { stirlingS2Dependencies } from './dependenciesStirlingS2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBellNumbers } from '../../factoriesAny.js';
+export var bellNumbersDependencies = {
+  addScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  stirlingS2Dependencies,
+  typedDependencies,
+  createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
new file mode 100644
index 0000000..fcc8438
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigNumberClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createBigNumberClass } from '../../factoriesAny.js';
+export var BigNumberDependencies = {
+  createBigNumberClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigint.generated.js
new file mode 100644
index 0000000..a67aeea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBigint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBigint } from '../../factoriesAny.js';
+export var bigintDependencies = {
+  typedDependencies,
+  createBigint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js
new file mode 100644
index 0000000..e9aabaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBignumber.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBignumber } from '../../factoriesAny.js';
+export var bignumberDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createBignumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js
new file mode 100644
index 0000000..37befba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBin.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBin } from '../../factoriesAny.js';
+export var binDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createBin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..d248298
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAnd.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitAnd } from '../../factoriesAny.js';
+export var bitAndDependencies = {
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAndTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAndTransform.generated.js
new file mode 100644
index 0000000..a5f0274
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitAndTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { notDependencies } from './dependenciesNot.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createBitAndTransform } from '../../factoriesAny.js';
+export var bitAndTransformDependencies = {
+  addDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  notDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createBitAndTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..f4ecf43
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitNot } from '../../factoriesAny.js';
+export var bitNotDependencies = {
+  typedDependencies,
+  createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..d24033d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOr.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitOr } from '../../factoriesAny.js';
+export var bitOrDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOrTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOrTransform.generated.js
new file mode 100644
index 0000000..075aaf6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitOrTransform.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitOrTransform } from '../../factoriesAny.js';
+export var bitOrTransformDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitOrTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..35fa96a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBitXor.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitXor } from '../../factoriesAny.js';
+export var bitXorDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..d55f841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBlockNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { ResultSetDependencies } from './dependenciesResultSet.generated.js';
+import { createBlockNode } from '../../factoriesAny.js';
+export var BlockNodeDependencies = {
+  NodeDependencies,
+  ResultSetDependencies,
+  createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
new file mode 100644
index 0000000..fd4895f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrMagneton.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBohrMagneton } from '../../factoriesAny.js';
+export var bohrMagnetonDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBohrMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js
new file mode 100644
index 0000000..aea8671
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBohrRadius.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBohrRadius } from '../../factoriesAny.js';
+export var bohrRadiusDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBohrRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js
new file mode 100644
index 0000000..3ce13ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoltzmann.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createBoltzmann } from '../../factoriesAny.js';
+export var boltzmannDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..61e5c46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesBoolean.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBoolean } from '../../factoriesAny.js';
+export var booleanDependencies = {
+  typedDependencies,
+  createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..06264f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCatalan.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCatalan } from '../../factoriesAny.js';
+export var catalanDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..051d9c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCbrt.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createCbrt } from '../../factoriesAny.js';
+export var cbrtDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  FractionDependencies,
+  isNegativeDependencies,
+  matrixDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js
new file mode 100644
index 0000000..fa6d3b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCeil.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createCeil } from '../../factoriesAny.js';
+export var ceilDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js
new file mode 100644
index 0000000..8d9e793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChain.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ChainDependencies } from './dependenciesChainClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChain } from '../../factoriesAny.js';
+export var chainDependencies = {
+  ChainDependencies,
+  typedDependencies,
+  createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..19a1f4b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesChainClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChainClass } from '../../factoriesAny.js';
+export var ChainDependencies = {
+  typedDependencies,
+  createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
new file mode 100644
index 0000000..2de8c67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClassicalElectronRadius.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createClassicalElectronRadius } from '../../factoriesAny.js';
+export var classicalElectronRadiusDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createClassicalElectronRadius
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js
new file mode 100644
index 0000000..2e9077b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesClone.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createClone } from '../../factoriesAny.js';
+export var cloneDependencies = {
+  typedDependencies,
+  createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js
new file mode 100644
index 0000000..61447d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumn.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createColumn } from '../../factoriesAny.js';
+export var columnDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createColumn
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js
new file mode 100644
index 0000000..d6bc3ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesColumnTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createColumnTransform } from '../../factoriesAny.js';
+export var columnTransformDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createColumnTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..926c7cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinations.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinations } from '../../factoriesAny.js';
+export var combinationsDependencies = {
+  typedDependencies,
+  createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..271eeaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinationsWithRep } from '../../factoriesAny.js';
+export var combinationsWithRepDependencies = {
+  typedDependencies,
+  createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js
new file mode 100644
index 0000000..f8acf75
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompare.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompare } from '../../factoriesAny.js';
+export var compareDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  FractionDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..8ecb045
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareNatural.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareNatural } from '../../factoriesAny.js';
+export var compareNaturalDependencies = {
+  compareDependencies,
+  typedDependencies,
+  createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..b01987f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompareText.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareText } from '../../factoriesAny.js';
+export var compareTextDependencies = {
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js
new file mode 100644
index 0000000..c4e6841
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCompile.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompile } from '../../factoriesAny.js';
+export var compileDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js
new file mode 100644
index 0000000..42e2055
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComplex } from '../../factoriesAny.js';
+export var complexDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createComplex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js
new file mode 100644
index 0000000..abd54d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComplexClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createComplexClass } from '../../factoriesAny.js';
+export var ComplexDependencies = {
+  createComplexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js
new file mode 100644
index 0000000..c585659
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesComposition.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComposition } from '../../factoriesAny.js';
+export var compositionDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  isPositiveDependencies,
+  largerDependencies,
+  typedDependencies,
+  createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js
new file mode 100644
index 0000000..9a9956c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcat.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConcat } from '../../factoriesAny.js';
+export var concatDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createConcat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js
new file mode 100644
index 0000000..11baf40
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConcatTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConcatTransform } from '../../factoriesAny.js';
+export var concatTransformDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createConcatTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..8001ce1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConditionalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConditionalNode } from '../../factoriesAny.js';
+export var ConditionalNodeDependencies = {
+  NodeDependencies,
+  createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
new file mode 100644
index 0000000..61ef521
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConductanceQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createConductanceQuantum } from '../../factoriesAny.js';
+export var conductanceQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js
new file mode 100644
index 0000000..4d698d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConj.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createConj } from '../../factoriesAny.js';
+export var conjDependencies = {
+  typedDependencies,
+  createConj
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..338fde0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesConstantNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConstantNode } from '../../factoriesAny.js';
+export var ConstantNodeDependencies = {
+  NodeDependencies,
+  createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCorr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCorr.generated.js
new file mode 100644
index 0000000..ffe2fd1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCorr.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { meanDependencies } from './dependenciesMean.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { sumDependencies } from './dependenciesSum.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCorr } from '../../factoriesAny.js';
+export var corrDependencies = {
+  addDependencies,
+  divideDependencies,
+  matrixDependencies,
+  meanDependencies,
+  multiplyDependencies,
+  powDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  sumDependencies,
+  typedDependencies,
+  createCorr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js
new file mode 100644
index 0000000..ee553b4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCos } from '../../factoriesAny.js';
+export var cosDependencies = {
+  typedDependencies,
+  createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js
new file mode 100644
index 0000000..4c352e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCosh } from '../../factoriesAny.js';
+export var coshDependencies = {
+  typedDependencies,
+  createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js
new file mode 100644
index 0000000..478e8c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCot.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCot } from '../../factoriesAny.js';
+export var cotDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js
new file mode 100644
index 0000000..62f4381
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoth.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCoth } from '../../factoriesAny.js';
+export var cothDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js
new file mode 100644
index 0000000..59be861
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulomb.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createCoulomb } from '../../factoriesAny.js';
+export var coulombDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createCoulomb
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulombConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulombConstant.generated.js
new file mode 100644
index 0000000..c7dd4a8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCoulombConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createCoulombConstant } from '../../factoriesAny.js';
+export var coulombConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createCoulombConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js
new file mode 100644
index 0000000..40d37b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCount.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { prodDependencies } from './dependenciesProd.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCount } from '../../factoriesAny.js';
+export var countDependencies = {
+  prodDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js
new file mode 100644
index 0000000..cdfe9d8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCreateUnit.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCreateUnit } from '../../factoriesAny.js';
+export var createUnitDependencies = {
+  UnitDependencies,
+  typedDependencies,
+  createCreateUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js
new file mode 100644
index 0000000..91b7ad4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCross.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCross } from '../../factoriesAny.js';
+export var crossDependencies = {
+  matrixDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createCross
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js
new file mode 100644
index 0000000..5cc6190
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsc.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsc } from '../../factoriesAny.js';
+export var cscDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js
new file mode 100644
index 0000000..5ce6e0b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCsch.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsch } from '../../factoriesAny.js';
+export var cschDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js
new file mode 100644
index 0000000..4d0cec5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCtranspose.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCtranspose } from '../../factoriesAny.js';
+export var ctransposeDependencies = {
+  conjDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createCtranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js
new file mode 100644
index 0000000..f42092f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCube.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCube } from '../../factoriesAny.js';
+export var cubeDependencies = {
+  typedDependencies,
+  createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..05941ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSum } from '../../factoriesAny.js';
+export var cumsumDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..fef6c6e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSumTransform } from '../../factoriesAny.js';
+export var cumsumTransformDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..94eb7b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeepEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDeepEqual } from '../../factoriesAny.js';
+export var deepEqualDependencies = {
+  equalDependencies,
+  typedDependencies,
+  createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
new file mode 100644
index 0000000..bad8bd2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDenseMatrixClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { createDenseMatrixClass } from '../../factoriesAny.js';
+export var DenseMatrixDependencies = {
+  MatrixDependencies,
+  createDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..3ac3894
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDerivative.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDerivative } from '../../factoriesAny.js';
+export var derivativeDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  numericDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js
new file mode 100644
index 0000000..7a706ab
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDet.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createDet } from '../../factoriesAny.js';
+export var detDependencies = {
+  divideScalarDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createDet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
new file mode 100644
index 0000000..605ff5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDeuteronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createDeuteronMass } from '../../factoriesAny.js';
+export var deuteronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createDeuteronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js
new file mode 100644
index 0000000..b852edf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiag.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiag } from '../../factoriesAny.js';
+export var diagDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createDiag
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js
new file mode 100644
index 0000000..433e6b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiff.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiff } from '../../factoriesAny.js';
+export var diffDependencies = {
+  matrixDependencies,
+  numberDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createDiff
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js
new file mode 100644
index 0000000..4781b34
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDiffTransform.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDiffTransform } from '../../factoriesAny.js';
+export var diffTransformDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  numberDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createDiffTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js
new file mode 100644
index 0000000..5e034ee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDistance.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { deepEqualDependencies } from './dependenciesDeepEqual.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDistance } from '../../factoriesAny.js';
+export var distanceDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  deepEqualDependencies,
+  divideScalarDependencies,
+  multiplyScalarDependencies,
+  sqrtDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createDistance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js
new file mode 100644
index 0000000..4db584f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivide.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivide } from '../../factoriesAny.js';
+export var divideDependencies = {
+  divideScalarDependencies,
+  equalScalarDependencies,
+  invDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..8333cb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDivideScalar.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivideScalar } from '../../factoriesAny.js';
+export var divideScalarDependencies = {
+  numericDependencies,
+  typedDependencies,
+  createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js
new file mode 100644
index 0000000..6f5a94a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDot.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDot } from '../../factoriesAny.js';
+export var dotDependencies = {
+  addScalarDependencies,
+  conjDependencies,
+  multiplyScalarDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createDot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js
new file mode 100644
index 0000000..6fd411a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotDivide.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotDivide } from '../../factoriesAny.js';
+export var dotDivideDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createDotDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js
new file mode 100644
index 0000000..63b2c77
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotMultiply.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotMultiply } from '../../factoriesAny.js';
+export var dotMultiplyDependencies = {
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createDotMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js
new file mode 100644
index 0000000..c97e977
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesDotPow.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDotPow } from '../../factoriesAny.js';
+export var dotPowDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  powDependencies,
+  typedDependencies,
+  createDotPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js
new file mode 100644
index 0000000..d4f8086
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createE } from '../../factoriesAny.js';
+export var eDependencies = {
+  BigNumberDependencies,
+  createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
new file mode 100644
index 0000000..e4a46fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEfimovFactor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createEfimovFactor } from '../../factoriesAny.js';
+export var efimovFactorDependencies = {
+  BigNumberDependencies,
+  createEfimovFactor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js
new file mode 100644
index 0000000..7dacf86
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEigs.generated.js
@@ -0,0 +1,72 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { atanDependencies } from './dependenciesAtan.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { columnDependencies } from './dependenciesColumn.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { cosDependencies } from './dependenciesCos.generated.js';
+import { diagDependencies } from './dependenciesDiag.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { dotDependencies } from './dependenciesDot.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { imDependencies } from './dependenciesIm.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { matrixFromColumnsDependencies } from './dependenciesMatrixFromColumns.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { qrDependencies } from './dependenciesQr.generated.js';
+import { reDependencies } from './dependenciesRe.generated.js';
+import { reshapeDependencies } from './dependenciesReshape.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { usolveDependencies } from './dependenciesUsolve.generated.js';
+import { usolveAllDependencies } from './dependenciesUsolveAll.generated.js';
+import { createEigs } from '../../factoriesAny.js';
+export var eigsDependencies = {
+  absDependencies,
+  addDependencies,
+  addScalarDependencies,
+  atanDependencies,
+  bignumberDependencies,
+  columnDependencies,
+  complexDependencies,
+  cosDependencies,
+  diagDependencies,
+  divideScalarDependencies,
+  dotDependencies,
+  equalDependencies,
+  flattenDependencies,
+  imDependencies,
+  invDependencies,
+  largerDependencies,
+  matrixDependencies,
+  matrixFromColumnsDependencies,
+  multiplyDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  qrDependencies,
+  reDependencies,
+  reshapeDependencies,
+  sinDependencies,
+  sizeDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  usolveDependencies,
+  usolveAllDependencies,
+  createEigs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js
new file mode 100644
index 0000000..711df06
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectricConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElectricConstant } from '../../factoriesAny.js';
+export var electricConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElectricConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js
new file mode 100644
index 0000000..75b98ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElectronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElectronMass } from '../../factoriesAny.js';
+export var electronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElectronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
new file mode 100644
index 0000000..85874ee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesElementaryCharge.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createElementaryCharge } from '../../factoriesAny.js';
+export var elementaryChargeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createElementaryCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js
new file mode 100644
index 0000000..d05cbe7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqual.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqual } from '../../factoriesAny.js';
+export var equalDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..ac93e47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualScalar } from '../../factoriesAny.js';
+export var equalScalarDependencies = {
+  typedDependencies,
+  createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..7336e81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEqualText.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareTextDependencies } from './dependenciesCompareText.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualText } from '../../factoriesAny.js';
+export var equalTextDependencies = {
+  compareTextDependencies,
+  isZeroDependencies,
+  typedDependencies,
+  createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js
new file mode 100644
index 0000000..ff4636e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesErf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createErf } from '../../factoriesAny.js';
+export var erfDependencies = {
+  typedDependencies,
+  createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..dc0ce5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesEvaluate.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEvaluate } from '../../factoriesAny.js';
+export var evaluateDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js
new file mode 100644
index 0000000..803f469
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExp.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExp } from '../../factoriesAny.js';
+export var expDependencies = {
+  typedDependencies,
+  createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js
new file mode 100644
index 0000000..13c62ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm } from '../../factoriesAny.js';
+export var expmDependencies = {
+  absDependencies,
+  addDependencies,
+  identityDependencies,
+  invDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createExpm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..00c7bf4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesExpm1.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm1 } from '../../factoriesAny.js';
+export var expm1Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..fae74be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFactorial.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFactorial } from '../../factoriesAny.js';
+export var factorialDependencies = {
+  gammaDependencies,
+  typedDependencies,
+  createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js
new file mode 100644
index 0000000..5694706
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFalse.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFalse } from '../../factoriesAny.js';
+export var falseDependencies = {
+  createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js
new file mode 100644
index 0000000..b97f80b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFaraday.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFaraday } from '../../factoriesAny.js';
+export var faradayDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFaraday
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
new file mode 100644
index 0000000..daab210
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFermiCoupling.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFermiCoupling } from '../../factoriesAny.js';
+export var fermiCouplingDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFermiCoupling
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFft.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFft.generated.js
new file mode 100644
index 0000000..303aa12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFft.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { ceilDependencies } from './dependenciesCeil.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { dotDivideDependencies } from './dependenciesDotDivide.generated.js';
+import { expDependencies } from './dependenciesExp.generated.js';
+import { iDependencies } from './dependenciesI.generated.js';
+import { log2Dependencies } from './dependenciesLog2.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { tauDependencies } from './dependenciesTau.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFft } from '../../factoriesAny.js';
+export var fftDependencies = {
+  addScalarDependencies,
+  ceilDependencies,
+  conjDependencies,
+  divideScalarDependencies,
+  dotDivideDependencies,
+  expDependencies,
+  iDependencies,
+  log2Dependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  powDependencies,
+  tauDependencies,
+  typedDependencies,
+  createFft
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
new file mode 100644
index 0000000..7df71d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFibonacciHeapClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { createFibonacciHeapClass } from '../../factoriesAny.js';
+export var FibonacciHeapDependencies = {
+  largerDependencies,
+  smallerDependencies,
+  createFibonacciHeapClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js
new file mode 100644
index 0000000..d564159
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilter.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilter } from '../../factoriesAny.js';
+export var filterDependencies = {
+  typedDependencies,
+  createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..48a768c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFilterTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilterTransform } from '../../factoriesAny.js';
+export var filterTransformDependencies = {
+  typedDependencies,
+  createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js
new file mode 100644
index 0000000..d30692d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFineStructure.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createFineStructure } from '../../factoriesAny.js';
+export var fineStructureDependencies = {
+  BigNumberDependencies,
+  createFineStructure
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
new file mode 100644
index 0000000..571fb9b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFirstRadiation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createFirstRadiation } from '../../factoriesAny.js';
+export var firstRadiationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createFirstRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js
new file mode 100644
index 0000000..390b0d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFix.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { ceilDependencies } from './dependenciesCeil.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { floorDependencies } from './dependenciesFloor.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createFix } from '../../factoriesAny.js';
+export var fixDependencies = {
+  ComplexDependencies,
+  DenseMatrixDependencies,
+  ceilDependencies,
+  equalScalarDependencies,
+  floorDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js
new file mode 100644
index 0000000..f53888b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFlatten.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFlatten } from '../../factoriesAny.js';
+export var flattenDependencies = {
+  typedDependencies,
+  createFlatten
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js
new file mode 100644
index 0000000..9d681fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFloor.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createFloor } from '../../factoriesAny.js';
+export var floorDependencies = {
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js
new file mode 100644
index 0000000..e39b6fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEach.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEach } from '../../factoriesAny.js';
+export var forEachDependencies = {
+  typedDependencies,
+  createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..1d33837
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesForEachTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEachTransform } from '../../factoriesAny.js';
+export var forEachTransformDependencies = {
+  typedDependencies,
+  createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js
new file mode 100644
index 0000000..d7d47cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFormat.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFormat } from '../../factoriesAny.js';
+export var formatDependencies = {
+  typedDependencies,
+  createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js
new file mode 100644
index 0000000..502b793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFraction.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFraction } from '../../factoriesAny.js';
+export var fractionDependencies = {
+  FractionDependencies,
+  typedDependencies,
+  createFraction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js
new file mode 100644
index 0000000..139d2b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFractionClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFractionClass } from '../../factoriesAny.js';
+export var FractionDependencies = {
+  createFractionClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFreqz.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFreqz.generated.js
new file mode 100644
index 0000000..f60cfd9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFreqz.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFreqz } from '../../factoriesAny.js';
+export var freqzDependencies = {
+  ComplexDependencies,
+  addDependencies,
+  divideDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createFreqz
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..a191dcd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFunctionAssignmentNode } from '../../factoriesAny.js';
+export var FunctionAssignmentNodeDependencies = {
+  NodeDependencies,
+  typedDependencies,
+  createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..45d4dbd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesFunctionNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { createFunctionNode } from '../../factoriesAny.js';
+export var FunctionNodeDependencies = {
+  NodeDependencies,
+  SymbolNodeDependencies,
+  createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js
new file mode 100644
index 0000000..56cabf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGamma.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGamma } from '../../factoriesAny.js';
+export var gammaDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  multiplyScalarDependencies,
+  powDependencies,
+  typedDependencies,
+  createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js
new file mode 100644
index 0000000..ffc3038
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGasConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGasConstant } from '../../factoriesAny.js';
+export var gasConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGasConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js
new file mode 100644
index 0000000..becb59f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGcd.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createGcd } from '../../factoriesAny.js';
+export var gcdDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
new file mode 100644
index 0000000..8e7a996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGetMatrixDataType.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGetMatrixDataType } from '../../factoriesAny.js';
+export var getMatrixDataTypeDependencies = {
+  typedDependencies,
+  createGetMatrixDataType
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
new file mode 100644
index 0000000..0f7f12a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravitationConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGravitationConstant } from '../../factoriesAny.js';
+export var gravitationConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGravitationConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js
new file mode 100644
index 0000000..1030929
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesGravity.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createGravity } from '../../factoriesAny.js';
+export var gravityDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createGravity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
new file mode 100644
index 0000000..76a305d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHartreeEnergy.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createHartreeEnergy } from '../../factoriesAny.js';
+export var hartreeEnergyDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createHartreeEnergy
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..5eb4dfb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHasNumericValue } from '../../factoriesAny.js';
+export var hasNumericValueDependencies = {
+  isNumericDependencies,
+  typedDependencies,
+  createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js
new file mode 100644
index 0000000..58549f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelp.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { HelpDependencies } from './dependenciesHelpClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHelp } from '../../factoriesAny.js';
+export var helpDependencies = {
+  HelpDependencies,
+  typedDependencies,
+  createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..9ce8fa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHelpClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { createHelpClass } from '../../factoriesAny.js';
+export var HelpDependencies = {
+  evaluateDependencies,
+  createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js
new file mode 100644
index 0000000..480205f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHex } from '../../factoriesAny.js';
+export var hexDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createHex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js
new file mode 100644
index 0000000..8100654
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesHypot.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHypot } from '../../factoriesAny.js';
+export var hypotDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  isPositiveDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js
new file mode 100644
index 0000000..045dbf0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesI.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { createI } from '../../factoriesAny.js';
+export var iDependencies = {
+  ComplexDependencies,
+  createI
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js
new file mode 100644
index 0000000..4e118ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIdentity.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIdentity } from '../../factoriesAny.js';
+export var identityDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createIdentity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIfft.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIfft.generated.js
new file mode 100644
index 0000000..e8d8d9c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIfft.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { dotDivideDependencies } from './dependenciesDotDivide.generated.js';
+import { fftDependencies } from './dependenciesFft.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIfft } from '../../factoriesAny.js';
+export var ifftDependencies = {
+  conjDependencies,
+  dotDivideDependencies,
+  fftDependencies,
+  typedDependencies,
+  createIfft
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js
new file mode 100644
index 0000000..1e7da81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIm } from '../../factoriesAny.js';
+export var imDependencies = {
+  typedDependencies,
+  createIm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
new file mode 100644
index 0000000..8f5067d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesImmutableDenseMatrixClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { createImmutableDenseMatrixClass } from '../../factoriesAny.js';
+export var ImmutableDenseMatrixDependencies = {
+  DenseMatrixDependencies,
+  smallerDependencies,
+  createImmutableDenseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js
new file mode 100644
index 0000000..900da1e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndex.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIndex } from '../../factoriesAny.js';
+export var indexDependencies = {
+  IndexDependencies,
+  typedDependencies,
+  createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js
new file mode 100644
index 0000000..8b160c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ImmutableDenseMatrixDependencies } from './dependenciesImmutableDenseMatrixClass.generated.js';
+import { getMatrixDataTypeDependencies } from './dependenciesGetMatrixDataType.generated.js';
+import { createIndexClass } from '../../factoriesAny.js';
+export var IndexDependencies = {
+  ImmutableDenseMatrixDependencies,
+  getMatrixDataTypeDependencies,
+  createIndexClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..8f2bc19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { createIndexNode } from '../../factoriesAny.js';
+export var IndexNodeDependencies = {
+  NodeDependencies,
+  sizeDependencies,
+  createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js
new file mode 100644
index 0000000..3fb64ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIndexTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { getMatrixDataTypeDependencies } from './dependenciesGetMatrixDataType.generated.js';
+import { createIndexTransform } from '../../factoriesAny.js';
+export var indexTransformDependencies = {
+  IndexDependencies,
+  getMatrixDataTypeDependencies,
+  createIndexTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..870e9e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInfinity.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createInfinity } from '../../factoriesAny.js';
+export var InfinityDependencies = {
+  BigNumberDependencies,
+  createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js
new file mode 100644
index 0000000..46ff3fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIntersect.generated.js
@@ -0,0 +1,36 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIntersect } from '../../factoriesAny.js';
+export var intersectDependencies = {
+  absDependencies,
+  addDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  flattenDependencies,
+  isNumericDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js
new file mode 100644
index 0000000..8a19c5f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInv.generated.js
@@ -0,0 +1,26 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { detDependencies } from './dependenciesDet.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createInv } from '../../factoriesAny.js';
+export var invDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  detDependencies,
+  divideScalarDependencies,
+  identityDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createInv
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
new file mode 100644
index 0000000..2cd33b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInverseConductanceQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createInverseConductanceQuantum } from '../../factoriesAny.js';
+export var inverseConductanceQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createInverseConductanceQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js
new file mode 100644
index 0000000..461ee3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesInvmod.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { modDependencies } from './dependenciesMod.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { xgcdDependencies } from './dependenciesXgcd.generated.js';
+import { createInvmod } from '../../factoriesAny.js';
+export var invmodDependencies = {
+  BigNumberDependencies,
+  addDependencies,
+  equalDependencies,
+  isIntegerDependencies,
+  modDependencies,
+  smallerDependencies,
+  typedDependencies,
+  xgcdDependencies,
+  createInvmod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..d71f2b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsInteger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsInteger } from '../../factoriesAny.js';
+export var isIntegerDependencies = {
+  typedDependencies,
+  createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..797b48a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNaN } from '../../factoriesAny.js';
+export var isNaNDependencies = {
+  typedDependencies,
+  createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..f2b83ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNegative.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNegative } from '../../factoriesAny.js';
+export var isNegativeDependencies = {
+  typedDependencies,
+  createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..00cdec9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNumeric } from '../../factoriesAny.js';
+export var isNumericDependencies = {
+  typedDependencies,
+  createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..1aa1b12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPositive.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPositive } from '../../factoriesAny.js';
+export var isPositiveDependencies = {
+  typedDependencies,
+  createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..f714257
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsPrime.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPrime } from '../../factoriesAny.js';
+export var isPrimeDependencies = {
+  typedDependencies,
+  createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..7e28646
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesIsZero.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsZero } from '../../factoriesAny.js';
+export var isZeroDependencies = {
+  equalScalarDependencies,
+  typedDependencies,
+  createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js
new file mode 100644
index 0000000..15edb1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKldivergence.generated.js
@@ -0,0 +1,26 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { dotDivideDependencies } from './dependenciesDotDivide.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { logDependencies } from './dependenciesLog.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sumDependencies } from './dependenciesSum.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createKldivergence } from '../../factoriesAny.js';
+export var kldivergenceDependencies = {
+  divideDependencies,
+  dotDivideDependencies,
+  isNumericDependencies,
+  logDependencies,
+  mapDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  sumDependencies,
+  typedDependencies,
+  createKldivergence
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js
new file mode 100644
index 0000000..c8439b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKlitzing.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createKlitzing } from '../../factoriesAny.js';
+export var klitzingDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createKlitzing
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js
new file mode 100644
index 0000000..38af28c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesKron.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createKron } from '../../factoriesAny.js';
+export var kronDependencies = {
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createKron
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js
new file mode 100644
index 0000000..f2d08b7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN10.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLN10 } from '../../factoriesAny.js';
+export var LN10Dependencies = {
+  BigNumberDependencies,
+  createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js
new file mode 100644
index 0000000..9c5386c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLN2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLN2 } from '../../factoriesAny.js';
+export var LN2Dependencies = {
+  BigNumberDependencies,
+  createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..ef35cd5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG10E.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLOG10E } from '../../factoriesAny.js';
+export var LOG10EDependencies = {
+  BigNumberDependencies,
+  createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..c9e71e3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLOG2E.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createLOG2E } from '../../factoriesAny.js';
+export var LOG2EDependencies = {
+  BigNumberDependencies,
+  createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js
new file mode 100644
index 0000000..d91f032
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLarger.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLarger } from '../../factoriesAny.js';
+export var largerDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  bignumberDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..2cc17fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLargerEq.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLargerEq } from '../../factoriesAny.js';
+export var largerEqDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js
new file mode 100644
index 0000000..191be38
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLcm.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLcm } from '../../factoriesAny.js';
+export var lcmDependencies = {
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js
new file mode 100644
index 0000000..29a4a9f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeafCount.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLeafCount } from '../../factoriesAny.js';
+export var leafCountDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createLeafCount
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..66b63b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLeftShift.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createLeftShift } from '../../factoriesAny.js';
+export var leftShiftDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLgamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLgamma.generated.js
new file mode 100644
index 0000000..de9a2fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLgamma.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLgamma } from '../../factoriesAny.js';
+export var lgammaDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createLgamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js
new file mode 100644
index 0000000..3a5a131
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { typeOfDependencies } from './dependenciesTypeOf.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog } from '../../factoriesAny.js';
+export var logDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  typeOfDependencies,
+  typedDependencies,
+  createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js
new file mode 100644
index 0000000..e5db01f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog10.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog10 } from '../../factoriesAny.js';
+export var log10Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..95cdacf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog1p.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { logDependencies } from './dependenciesLog.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog1p } from '../../factoriesAny.js';
+export var log1pDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  logDependencies,
+  typedDependencies,
+  createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js
new file mode 100644
index 0000000..0f9eb10
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLog2.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog2 } from '../../factoriesAny.js';
+export var log2Dependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js
new file mode 100644
index 0000000..e2559c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLoschmidt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createLoschmidt } from '../../factoriesAny.js';
+export var loschmidtDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createLoschmidt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js
new file mode 100644
index 0000000..5a20446
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLsolve } from '../../factoriesAny.js';
+export var lsolveDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createLsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js
new file mode 100644
index 0000000..a190c2f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLsolveAll.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLsolveAll } from '../../factoriesAny.js';
+export var lsolveAllDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createLsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js
new file mode 100644
index 0000000..659c798
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLup.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SpaDependencies } from './dependenciesSpaClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createLup } from '../../factoriesAny.js';
+export var lupDependencies = {
+  DenseMatrixDependencies,
+  SpaDependencies,
+  SparseMatrixDependencies,
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  largerDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createLup
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js
new file mode 100644
index 0000000..265740a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLusolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { lsolveDependencies } from './dependenciesLsolve.generated.js';
+import { lupDependencies } from './dependenciesLup.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sluDependencies } from './dependenciesSlu.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { usolveDependencies } from './dependenciesUsolve.generated.js';
+import { createLusolve } from '../../factoriesAny.js';
+export var lusolveDependencies = {
+  DenseMatrixDependencies,
+  lsolveDependencies,
+  lupDependencies,
+  matrixDependencies,
+  sluDependencies,
+  typedDependencies,
+  usolveDependencies,
+  createLusolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLyap.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLyap.generated.js
new file mode 100644
index 0000000..799f98d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesLyap.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sylvesterDependencies } from './dependenciesSylvester.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLyap } from '../../factoriesAny.js';
+export var lyapDependencies = {
+  matrixDependencies,
+  multiplyDependencies,
+  sylvesterDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createLyap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js
new file mode 100644
index 0000000..82b4091
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMad.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { medianDependencies } from './dependenciesMedian.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMad } from '../../factoriesAny.js';
+export var madDependencies = {
+  absDependencies,
+  mapDependencies,
+  medianDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
new file mode 100644
index 0000000..3ad2da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMagneticConstant } from '../../factoriesAny.js';
+export var magneticConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMagneticConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
new file mode 100644
index 0000000..178fe1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMagneticFluxQuantum.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMagneticFluxQuantum } from '../../factoriesAny.js';
+export var magneticFluxQuantumDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMagneticFluxQuantum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js
new file mode 100644
index 0000000..a3e60dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMap.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMap } from '../../factoriesAny.js';
+export var mapDependencies = {
+  typedDependencies,
+  createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlices.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlices.generated.js
new file mode 100644
index 0000000..a4cfd19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlices.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapSlices } from '../../factoriesAny.js';
+export var mapSlicesDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createMapSlices
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js
new file mode 100644
index 0000000..4a642b4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapSlicesTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapSlicesTransform } from '../../factoriesAny.js';
+export var mapSlicesTransformDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createMapSlicesTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..dbc5460
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMapTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapTransform } from '../../factoriesAny.js';
+export var mapTransformDependencies = {
+  typedDependencies,
+  createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..ab09ac4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrix.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrix } from '../../factoriesAny.js';
+export var matrixDependencies = {
+  DenseMatrixDependencies,
+  MatrixDependencies,
+  SparseMatrixDependencies,
+  typedDependencies,
+  createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js
new file mode 100644
index 0000000..12ff246
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createMatrixClass } from '../../factoriesAny.js';
+export var MatrixDependencies = {
+  createMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
new file mode 100644
index 0000000..b63e1b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromColumns.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromColumns } from '../../factoriesAny.js';
+export var matrixFromColumnsDependencies = {
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createMatrixFromColumns
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
new file mode 100644
index 0000000..a20f85b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromFunction.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromFunction } from '../../factoriesAny.js';
+export var matrixFromFunctionDependencies = {
+  isZeroDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createMatrixFromFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
new file mode 100644
index 0000000..adf7c20
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMatrixFromRows.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMatrixFromRows } from '../../factoriesAny.js';
+export var matrixFromRowsDependencies = {
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createMatrixFromRows
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js
new file mode 100644
index 0000000..046b811
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMax.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMax } from '../../factoriesAny.js';
+export var maxDependencies = {
+  isNaNDependencies,
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..b492145
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMaxTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMaxTransform } from '../../factoriesAny.js';
+export var maxTransformDependencies = {
+  isNaNDependencies,
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js
new file mode 100644
index 0000000..1d5b71b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMean.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMean } from '../../factoriesAny.js';
+export var meanDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..478c6d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMeanTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMeanTransform } from '../../factoriesAny.js';
+export var meanTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js
new file mode 100644
index 0000000..6618e5c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMedian.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMedian } from '../../factoriesAny.js';
+export var medianDependencies = {
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js
new file mode 100644
index 0000000..f2dd559
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMin.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMin } from '../../factoriesAny.js';
+export var minDependencies = {
+  isNaNDependencies,
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..e809197
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMinTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMinTransform } from '../../factoriesAny.js';
+export var minTransformDependencies = {
+  isNaNDependencies,
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js
new file mode 100644
index 0000000..54cad6f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMod.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createMod } from '../../factoriesAny.js';
+export var modDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  roundDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js
new file mode 100644
index 0000000..1bcd89b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMode } from '../../factoriesAny.js';
+export var modeDependencies = {
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js
new file mode 100644
index 0000000..f1e27ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarMass } from '../../factoriesAny.js';
+export var molarMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
new file mode 100644
index 0000000..728a849
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarMassC12.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarMassC12 } from '../../factoriesAny.js';
+export var molarMassC12Dependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarMassC12
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
new file mode 100644
index 0000000..288b280
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarPlanckConstant } from '../../factoriesAny.js';
+export var molarPlanckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js
new file mode 100644
index 0000000..f8f7312
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMolarVolume.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createMolarVolume } from '../../factoriesAny.js';
+export var molarVolumeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createMolarVolume
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..f72fb19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultinomial.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultinomial } from '../../factoriesAny.js';
+export var multinomialDependencies = {
+  addDependencies,
+  divideDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isPositiveDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..5b6a14b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiply.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { dotDependencies } from './dependenciesDot.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiply } from '../../factoriesAny.js';
+export var multiplyDependencies = {
+  addScalarDependencies,
+  dotDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..c47ed5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiplyScalar } from '../../factoriesAny.js';
+export var multiplyScalarDependencies = {
+  typedDependencies,
+  createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js
new file mode 100644
index 0000000..159644f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createNaN } from '../../factoriesAny.js';
+export var NaNDependencies = {
+  BigNumberDependencies,
+  createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js
new file mode 100644
index 0000000..4e85f4f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNeutronMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createNeutronMass } from '../../factoriesAny.js';
+export var neutronMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createNeutronMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js
new file mode 100644
index 0000000..41e5cf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNode.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNode } from '../../factoriesAny.js';
+export var NodeDependencies = {
+  createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js
new file mode 100644
index 0000000..8acf1ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNorm.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { ctransposeDependencies } from './dependenciesCtranspose.generated.js';
+import { eigsDependencies } from './dependenciesEigs.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNorm } from '../../factoriesAny.js';
+export var normDependencies = {
+  absDependencies,
+  addDependencies,
+  conjDependencies,
+  ctransposeDependencies,
+  eigsDependencies,
+  equalScalarDependencies,
+  largerDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  powDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js
new file mode 100644
index 0000000..0954db4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNot } from '../../factoriesAny.js';
+export var notDependencies = {
+  typedDependencies,
+  createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..f82ca35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoot.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoot } from '../../factoriesAny.js';
+export var nthRootDependencies = {
+  BigNumberDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js
new file mode 100644
index 0000000..830652c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNthRoots.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoots } from '../../factoriesAny.js';
+export var nthRootsDependencies = {
+  ComplexDependencies,
+  divideScalarDependencies,
+  typedDependencies,
+  createNthRoots
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
new file mode 100644
index 0000000..aff4825
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNuclearMagneton.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createNuclearMagneton } from '../../factoriesAny.js';
+export var nuclearMagnetonDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createNuclearMagneton
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js
new file mode 100644
index 0000000..8aa017c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNull.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNull } from '../../factoriesAny.js';
+export var nullDependencies = {
+  createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullish.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullish.generated.js
new file mode 100644
index 0000000..719cbc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullish.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { deepEqualDependencies } from './dependenciesDeepEqual.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNullish } from '../../factoriesAny.js';
+export var nullishDependencies = {
+  deepEqualDependencies,
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createNullish
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullishTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullishTransform.generated.js
new file mode 100644
index 0000000..da1448e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNullishTransform.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { deepEqualDependencies } from './dependenciesDeepEqual.generated.js';
+import { flattenDependencies } from './dependenciesFlatten.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNullishTransform } from '../../factoriesAny.js';
+export var nullishTransformDependencies = {
+  deepEqualDependencies,
+  flattenDependencies,
+  matrixDependencies,
+  sizeDependencies,
+  typedDependencies,
+  createNullishTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js
new file mode 100644
index 0000000..6bde859
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumber.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNumber } from '../../factoriesAny.js';
+export var numberDependencies = {
+  typedDependencies,
+  createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..cb0b193
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesNumeric.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { createNumeric } from '../../factoriesAny.js';
+export var numericDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  numberDependencies,
+  createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..d0b0d71
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesObjectNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createObjectNode } from '../../factoriesAny.js';
+export var ObjectNodeDependencies = {
+  NodeDependencies,
+  createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js
new file mode 100644
index 0000000..38c424c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOct.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOct } from '../../factoriesAny.js';
+export var octDependencies = {
+  formatDependencies,
+  typedDependencies,
+  createOct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js
new file mode 100644
index 0000000..d486f28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOnes.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOnes } from '../../factoriesAny.js';
+export var onesDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createOnes
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..64ff770
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOperatorNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createOperatorNode } from '../../factoriesAny.js';
+export var OperatorNodeDependencies = {
+  NodeDependencies,
+  createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js
new file mode 100644
index 0000000..9b4a16c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOr.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOr } from '../../factoriesAny.js';
+export var orDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOrTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOrTransform.generated.js
new file mode 100644
index 0000000..852045c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesOrTransform.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOrTransform } from '../../factoriesAny.js';
+export var orTransformDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createOrTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..92d4445
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createParenthesisNode } from '../../factoriesAny.js';
+export var ParenthesisNodeDependencies = {
+  NodeDependencies,
+  createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js
new file mode 100644
index 0000000..136168d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParse.generated.js
@@ -0,0 +1,42 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';
+import { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';
+import { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';
+import { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParse } from '../../factoriesAny.js';
+export var parseDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  AssignmentNodeDependencies,
+  BlockNodeDependencies,
+  ConditionalNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  RangeNodeDependencies,
+  RelationalNodeDependencies,
+  SymbolNodeDependencies,
+  numericDependencies,
+  typedDependencies,
+  createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js
new file mode 100644
index 0000000..f50f56a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParser.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ParserDependencies } from './dependenciesParserClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParser } from '../../factoriesAny.js';
+export var parserDependencies = {
+  ParserDependencies,
+  typedDependencies,
+  createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..b689be9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesParserClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createParserClass } from '../../factoriesAny.js';
+export var ParserDependencies = {
+  evaluateDependencies,
+  parseDependencies,
+  createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..ecd2205
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPartitionSelect } from '../../factoriesAny.js';
+export var partitionSelectDependencies = {
+  compareDependencies,
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..2c5449b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPermutations.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPermutations } from '../../factoriesAny.js';
+export var permutationsDependencies = {
+  factorialDependencies,
+  typedDependencies,
+  createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js
new file mode 100644
index 0000000..fa8e2c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPhi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createPhi } from '../../factoriesAny.js';
+export var phiDependencies = {
+  BigNumberDependencies,
+  createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js
new file mode 100644
index 0000000..2327874
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createPi } from '../../factoriesAny.js';
+export var piDependencies = {
+  BigNumberDependencies,
+  createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..a6809db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPickRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPickRandom } from '../../factoriesAny.js';
+export var pickRandomDependencies = {
+  typedDependencies,
+  createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPinv.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPinv.generated.js
new file mode 100644
index 0000000..d1dedbc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPinv.generated.js
@@ -0,0 +1,32 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { ctransposeDependencies } from './dependenciesCtranspose.generated.js';
+import { deepEqualDependencies } from './dependenciesDeepEqual.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { dotDependencies } from './dependenciesDot.generated.js';
+import { dotDivideDependencies } from './dependenciesDotDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPinv } from '../../factoriesAny.js';
+export var pinvDependencies = {
+  ComplexDependencies,
+  addDependencies,
+  ctransposeDependencies,
+  deepEqualDependencies,
+  divideScalarDependencies,
+  dotDependencies,
+  dotDivideDependencies,
+  equalDependencies,
+  invDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createPinv
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
new file mode 100644
index 0000000..b3849ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckCharge.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckCharge } from '../../factoriesAny.js';
+export var planckChargeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckCharge
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
new file mode 100644
index 0000000..d2c4c62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckConstant } from '../../factoriesAny.js';
+export var planckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js
new file mode 100644
index 0000000..221d993
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckLength.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckLength } from '../../factoriesAny.js';
+export var planckLengthDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckLength
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js
new file mode 100644
index 0000000..209989d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckMass } from '../../factoriesAny.js';
+export var planckMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
new file mode 100644
index 0000000..7eac32c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTemperature.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckTemperature } from '../../factoriesAny.js';
+export var planckTemperatureDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckTemperature
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js
new file mode 100644
index 0000000..9d07160
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPlanckTime.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createPlanckTime } from '../../factoriesAny.js';
+export var planckTimeDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createPlanckTime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js
new file mode 100644
index 0000000..1879945
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPolynomialRoot.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { cbrtDependencies } from './dependenciesCbrt.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { imDependencies } from './dependenciesIm.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { reDependencies } from './dependenciesRe.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typeOfDependencies } from './dependenciesTypeOf.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createPolynomialRoot } from '../../factoriesAny.js';
+export var polynomialRootDependencies = {
+  addDependencies,
+  cbrtDependencies,
+  divideDependencies,
+  equalScalarDependencies,
+  imDependencies,
+  isZeroDependencies,
+  multiplyDependencies,
+  reDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typeOfDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createPolynomialRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js
new file mode 100644
index 0000000..3c84571
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPow.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPow } from '../../factoriesAny.js';
+export var powDependencies = {
+  ComplexDependencies,
+  fractionDependencies,
+  identityDependencies,
+  invDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  numberDependencies,
+  typedDependencies,
+  createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js
new file mode 100644
index 0000000..731a3bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPrint } from '../../factoriesAny.js';
+export var printDependencies = {
+  typedDependencies,
+  createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrintTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrintTransform.generated.js
new file mode 100644
index 0000000..d80d6c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesPrintTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createPrintTransform } from '../../factoriesAny.js';
+export var printTransformDependencies = {
+  addDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createPrintTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js
new file mode 100644
index 0000000..59fe201
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createProd } from '../../factoriesAny.js';
+export var prodDependencies = {
+  multiplyScalarDependencies,
+  numericDependencies,
+  typedDependencies,
+  createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js
new file mode 100644
index 0000000..351feae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesProtonMass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createProtonMass } from '../../factoriesAny.js';
+export var protonMassDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createProtonMass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js
new file mode 100644
index 0000000..047a07b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQr.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { conjDependencies } from './dependenciesConj.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { signDependencies } from './dependenciesSign.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createQr } from '../../factoriesAny.js';
+export var qrDependencies = {
+  addScalarDependencies,
+  complexDependencies,
+  conjDependencies,
+  divideScalarDependencies,
+  equalDependencies,
+  identityDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  signDependencies,
+  sqrtDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  zerosDependencies,
+  createQr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..d6a2e24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createQuantileSeq } from '../../factoriesAny.js';
+export var quantileSeqDependencies = {
+  bignumberDependencies,
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  isIntegerDependencies,
+  largerDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  partitionSelectDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js
new file mode 100644
index 0000000..181b847
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantileSeqTransform.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createQuantileSeqTransform } from '../../factoriesAny.js';
+export var quantileSeqTransformDependencies = {
+  addDependencies,
+  bignumberDependencies,
+  compareDependencies,
+  divideDependencies,
+  isIntegerDependencies,
+  largerDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  partitionSelectDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createQuantileSeqTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
new file mode 100644
index 0000000..5f05d77
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesQuantumOfCirculation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createQuantumOfCirculation } from '../../factoriesAny.js';
+export var quantumOfCirculationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createQuantumOfCirculation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js
new file mode 100644
index 0000000..b11fb5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandom } from '../../factoriesAny.js';
+export var randomDependencies = {
+  typedDependencies,
+  createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..6086a51
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRandomInt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { log2Dependencies } from './dependenciesLog2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandomInt } from '../../factoriesAny.js';
+export var randomIntDependencies = {
+  log2Dependencies,
+  typedDependencies,
+  createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js
new file mode 100644
index 0000000..b295430
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRange.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRange } from '../../factoriesAny.js';
+export var rangeDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  addDependencies,
+  equalDependencies,
+  isPositiveDependencies,
+  isZeroDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..dc28667
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createRangeClass } from '../../factoriesAny.js';
+export var RangeDependencies = {
+  createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..829b356
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRangeNode } from '../../factoriesAny.js';
+export var RangeNodeDependencies = {
+  NodeDependencies,
+  createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..8bed71c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRangeTransform.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRangeTransform } from '../../factoriesAny.js';
+export var rangeTransformDependencies = {
+  bignumberDependencies,
+  matrixDependencies,
+  addDependencies,
+  equalDependencies,
+  isPositiveDependencies,
+  isZeroDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..b444849
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRationalize.generated.js
@@ -0,0 +1,56 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { simplifyConstantDependencies } from './dependenciesSimplifyConstant.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRationalize } from '../../factoriesAny.js';
+export var rationalizeDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  simplifyDependencies,
+  simplifyConstantDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js
new file mode 100644
index 0000000..addd9fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRe.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRe } from '../../factoriesAny.js';
+export var reDependencies = {
+  typedDependencies,
+  createRe
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
new file mode 100644
index 0000000..58f1fcd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReducedPlanckConstant.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createReducedPlanckConstant } from '../../factoriesAny.js';
+export var reducedPlanckConstantDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createReducedPlanckConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..f76b3f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRelationalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRelationalNode } from '../../factoriesAny.js';
+export var RelationalNodeDependencies = {
+  NodeDependencies,
+  createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..6fcdff6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReplacer.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReplacer } from '../../factoriesAny.js';
+export var replacerDependencies = {
+  createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js
new file mode 100644
index 0000000..1668dd9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReshape.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createReshape } from '../../factoriesAny.js';
+export var reshapeDependencies = {
+  isIntegerDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createReshape
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js
new file mode 100644
index 0000000..3ffb8bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResize.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { createResize } from '../../factoriesAny.js';
+export var resizeDependencies = {
+  matrixDependencies,
+  createResize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js
new file mode 100644
index 0000000..4512fae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResolve.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createResolve } from '../../factoriesAny.js';
+export var resolveDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  parseDependencies,
+  typedDependencies,
+  createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..41f61b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesResultSet.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createResultSet } from '../../factoriesAny.js';
+export var ResultSetDependencies = {
+  createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js
new file mode 100644
index 0000000..3dd5918
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesReviver.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReviver } from '../../factoriesAny.js';
+export var reviverDependencies = {
+  createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..daf2347
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightArithShift.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRightArithShift } from '../../factoriesAny.js';
+export var rightArithShiftDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..22dade3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRightLogShift.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRightLogShift } from '../../factoriesAny.js';
+export var rightLogShiftDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js
new file mode 100644
index 0000000..faf69a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotate.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { rotationMatrixDependencies } from './dependenciesRotationMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRotate } from '../../factoriesAny.js';
+export var rotateDependencies = {
+  multiplyDependencies,
+  rotationMatrixDependencies,
+  typedDependencies,
+  createRotate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
new file mode 100644
index 0000000..667ce47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRotationMatrix.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { cosDependencies } from './dependenciesCos.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { normDependencies } from './dependenciesNorm.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createRotationMatrix } from '../../factoriesAny.js';
+export var rotationMatrixDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  addScalarDependencies,
+  cosDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  normDependencies,
+  sinDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createRotationMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js
new file mode 100644
index 0000000..38f9715
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRound.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createRound } from '../../factoriesAny.js';
+export var roundDependencies = {
+  BigNumberDependencies,
+  DenseMatrixDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js
new file mode 100644
index 0000000..78165be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRow.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRow } from '../../factoriesAny.js';
+export var rowDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createRow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js
new file mode 100644
index 0000000..b5d752f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRowTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRowTransform } from '../../factoriesAny.js';
+export var rowTransformDependencies = {
+  IndexDependencies,
+  matrixDependencies,
+  rangeDependencies,
+  typedDependencies,
+  createRowTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js
new file mode 100644
index 0000000..7494da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesRydberg.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createRydberg } from '../../factoriesAny.js';
+export var rydbergDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createRydberg
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..1b52232
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSQRT1_2 } from '../../factoriesAny.js'; // eslint-disable-line camelcase
+
+export var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  BigNumberDependencies,
+  createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..3ed6f02
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSQRT2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSQRT2 } from '../../factoriesAny.js';
+export var SQRT2Dependencies = {
+  BigNumberDependencies,
+  createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
new file mode 100644
index 0000000..c5dcbee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSackurTetrode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createSackurTetrode } from '../../factoriesAny.js';
+export var sackurTetrodeDependencies = {
+  BigNumberDependencies,
+  createSackurTetrode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSchur.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSchur.generated.js
new file mode 100644
index 0000000..d378d60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSchur.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { normDependencies } from './dependenciesNorm.generated.js';
+import { qrDependencies } from './dependenciesQr.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSchur } from '../../factoriesAny.js';
+export var schurDependencies = {
+  identityDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  normDependencies,
+  qrDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSchur
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js
new file mode 100644
index 0000000..cadafe2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSec.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSec } from '../../factoriesAny.js';
+export var secDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js
new file mode 100644
index 0000000..51c336e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSech.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSech } from '../../factoriesAny.js';
+export var sechDependencies = {
+  BigNumberDependencies,
+  typedDependencies,
+  createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
new file mode 100644
index 0000000..29a2a14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSecondRadiation.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createSecondRadiation } from '../../factoriesAny.js';
+export var secondRadiationDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createSecondRadiation
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js
new file mode 100644
index 0000000..5156f57
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetCartesian.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetCartesian } from '../../factoriesAny.js';
+export var setCartesianDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetCartesian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js
new file mode 100644
index 0000000..da3d014
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDifference.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetDifference } from '../../factoriesAny.js';
+export var setDifferenceDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js
new file mode 100644
index 0000000..2fa0712
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetDistinct.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetDistinct } from '../../factoriesAny.js';
+export var setDistinctDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetDistinct
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js
new file mode 100644
index 0000000..9af570f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIntersect.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetIntersect } from '../../factoriesAny.js';
+export var setIntersectDependencies = {
+  DenseMatrixDependencies,
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetIntersect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
new file mode 100644
index 0000000..a868e2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetIsSubset.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetIsSubset } from '../../factoriesAny.js';
+export var setIsSubsetDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetIsSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
new file mode 100644
index 0000000..4a9cdeb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetMultiplicity.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetMultiplicity } from '../../factoriesAny.js';
+export var setMultiplicityDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetMultiplicity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js
new file mode 100644
index 0000000..9914a7d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetPowerset.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetPowerset } from '../../factoriesAny.js';
+export var setPowersetDependencies = {
+  IndexDependencies,
+  compareNaturalDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetPowerset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js
new file mode 100644
index 0000000..7dcdab9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetSize } from '../../factoriesAny.js';
+export var setSizeDependencies = {
+  compareNaturalDependencies,
+  typedDependencies,
+  createSetSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
new file mode 100644
index 0000000..3a3cee2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetSymDifference.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { setDifferenceDependencies } from './dependenciesSetDifference.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetSymDifference } from '../../factoriesAny.js';
+export var setSymDifferenceDependencies = {
+  IndexDependencies,
+  concatDependencies,
+  setDifferenceDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetSymDifference
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js
new file mode 100644
index 0000000..c288bf6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSetUnion.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { IndexDependencies } from './dependenciesIndexClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { setIntersectDependencies } from './dependenciesSetIntersect.generated.js';
+import { setSymDifferenceDependencies } from './dependenciesSetSymDifference.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSetUnion } from '../../factoriesAny.js';
+export var setUnionDependencies = {
+  IndexDependencies,
+  concatDependencies,
+  setIntersectDependencies,
+  setSymDifferenceDependencies,
+  sizeDependencies,
+  subsetDependencies,
+  typedDependencies,
+  createSetUnion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js
new file mode 100644
index 0000000..e3f38ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSign.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { complexDependencies } from './dependenciesComplex.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSign } from '../../factoriesAny.js';
+export var signDependencies = {
+  BigNumberDependencies,
+  FractionDependencies,
+  complexDependencies,
+  typedDependencies,
+  createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..056e865
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplify.generated.js
@@ -0,0 +1,40 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { replacerDependencies } from './dependenciesReplacer.generated.js';
+import { resolveDependencies } from './dependenciesResolve.generated.js';
+import { simplifyConstantDependencies } from './dependenciesSimplifyConstant.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplify } from '../../factoriesAny.js';
+export var simplifyDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  parseDependencies,
+  replacerDependencies,
+  resolveDependencies,
+  simplifyConstantDependencies,
+  simplifyCoreDependencies,
+  typedDependencies,
+  createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js
new file mode 100644
index 0000000..e437aa7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyConstant.generated.js
@@ -0,0 +1,32 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { fractionDependencies } from './dependenciesFraction.generated.js';
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplifyConstant } from '../../factoriesAny.js';
+export var simplifyConstantDependencies = {
+  bignumberDependencies,
+  fractionDependencies,
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  SymbolNodeDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSimplifyConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..aea2f14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,44 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplifyCore } from '../../factoriesAny.js';
+export var simplifyCoreDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js
new file mode 100644
index 0000000..44dc216
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSin } from '../../factoriesAny.js';
+export var sinDependencies = {
+  typedDependencies,
+  createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js
new file mode 100644
index 0000000..6eacc28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSinh } from '../../factoriesAny.js';
+export var sinhDependencies = {
+  typedDependencies,
+  createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js
new file mode 100644
index 0000000..19d3a80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSize } from '../../factoriesAny.js';
+export var sizeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js
new file mode 100644
index 0000000..a348ceb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSlu.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSlu } from '../../factoriesAny.js';
+export var sluDependencies = {
+  SparseMatrixDependencies,
+  absDependencies,
+  addDependencies,
+  divideScalarDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createSlu
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..fc80104
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmaller.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmaller } from '../../factoriesAny.js';
+export var smallerDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  bignumberDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..2b3a5f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSmallerEq.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmallerEq } from '../../factoriesAny.js';
+export var smallerEqDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSolveODE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSolveODE.generated.js
new file mode 100644
index 0000000..622f62c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSolveODE.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { maxDependencies } from './dependenciesMax.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createSolveODE } from '../../factoriesAny.js';
+export var solveODEDependencies = {
+  absDependencies,
+  addDependencies,
+  bignumberDependencies,
+  divideDependencies,
+  isNegativeDependencies,
+  isPositiveDependencies,
+  largerDependencies,
+  mapDependencies,
+  matrixDependencies,
+  maxDependencies,
+  multiplyDependencies,
+  smallerDependencies,
+  subtractDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createSolveODE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js
new file mode 100644
index 0000000..7ce4fa8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSort.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { compareNaturalDependencies } from './dependenciesCompareNatural.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSort } from '../../factoriesAny.js';
+export var sortDependencies = {
+  compareDependencies,
+  compareNaturalDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSort
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js
new file mode 100644
index 0000000..2a2c95c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpaClass.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { FibonacciHeapDependencies } from './dependenciesFibonacciHeapClass.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { createSpaClass } from '../../factoriesAny.js';
+export var SpaDependencies = {
+  FibonacciHeapDependencies,
+  addScalarDependencies,
+  equalScalarDependencies,
+  createSpaClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js
new file mode 100644
index 0000000..2166043
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparse.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSparse } from '../../factoriesAny.js';
+export var sparseDependencies = {
+  SparseMatrixDependencies,
+  typedDependencies,
+  createSparse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
new file mode 100644
index 0000000..220d4be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSparseMatrixClass.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { MatrixDependencies } from './dependenciesMatrixClass.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSparseMatrixClass } from '../../factoriesAny.js';
+export var SparseMatrixDependencies = {
+  MatrixDependencies,
+  equalScalarDependencies,
+  typedDependencies,
+  createSparseMatrixClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
new file mode 100644
index 0000000..963a387
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSpeedOfLight.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createSpeedOfLight } from '../../factoriesAny.js';
+export var speedOfLightDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createSpeedOfLight
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js
new file mode 100644
index 0000000..67bfa6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSplitUnit.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSplitUnit } from '../../factoriesAny.js';
+export var splitUnitDependencies = {
+  typedDependencies,
+  createSplitUnit
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..f2a68df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrt } from '../../factoriesAny.js';
+export var sqrtDependencies = {
+  ComplexDependencies,
+  typedDependencies,
+  createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js
new file mode 100644
index 0000000..ad6688f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqrtm.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { invDependencies } from './dependenciesInv.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { maxDependencies } from './dependenciesMax.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrtm } from '../../factoriesAny.js';
+export var sqrtmDependencies = {
+  absDependencies,
+  addDependencies,
+  identityDependencies,
+  invDependencies,
+  mapDependencies,
+  maxDependencies,
+  multiplyDependencies,
+  sizeDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSqrtm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js
new file mode 100644
index 0000000..8c24c0e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSquare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSquare } from '../../factoriesAny.js';
+export var squareDependencies = {
+  typedDependencies,
+  createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js
new file mode 100644
index 0000000..09c4252
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSqueeze.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqueeze } from '../../factoriesAny.js';
+export var squeezeDependencies = {
+  typedDependencies,
+  createSqueeze
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js
new file mode 100644
index 0000000..ae94431
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStd.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStd } from '../../factoriesAny.js';
+export var stdDependencies = {
+  mapDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..c2ff940
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStdTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStdTransform } from '../../factoriesAny.js';
+export var stdTransformDependencies = {
+  mapDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
new file mode 100644
index 0000000..ee5c4d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStefanBoltzmann.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createStefanBoltzmann } from '../../factoriesAny.js';
+export var stefanBoltzmannDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createStefanBoltzmann
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..de8a193
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesStirlingS2.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { bignumberDependencies } from './dependenciesBignumber.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createStirlingS2 } from '../../factoriesAny.js';
+export var stirlingS2Dependencies = {
+  bignumberDependencies,
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  largerDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js
new file mode 100644
index 0000000..e7d173e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesString.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createString } from '../../factoriesAny.js';
+export var stringDependencies = {
+  typedDependencies,
+  createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js
new file mode 100644
index 0000000..0b4285d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubset.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createSubset } from '../../factoriesAny.js';
+export var subsetDependencies = {
+  addDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..0fb19e5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { zerosDependencies } from './dependenciesZeros.generated.js';
+import { createSubsetTransform } from '../../factoriesAny.js';
+export var subsetTransformDependencies = {
+  addDependencies,
+  matrixDependencies,
+  typedDependencies,
+  zerosDependencies,
+  createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..a10379a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtract.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryMinusDependencies } from './dependenciesUnaryMinus.generated.js';
+import { createSubtract } from '../../factoriesAny.js';
+export var subtractDependencies = {
+  DenseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  unaryMinusDependencies,
+  createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtractScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtractScalar.generated.js
new file mode 100644
index 0000000..b339578
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSubtractScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubtractScalar } from '../../factoriesAny.js';
+export var subtractScalarDependencies = {
+  typedDependencies,
+  createSubtractScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js
new file mode 100644
index 0000000..49fc33d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSum } from '../../factoriesAny.js';
+export var sumDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..a21526f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSumTransform } from '../../factoriesAny.js';
+export var sumTransformDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSylvester.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSylvester.generated.js
new file mode 100644
index 0000000..371d0c5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSylvester.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { identityDependencies } from './dependenciesIdentity.generated.js';
+import { indexDependencies } from './dependenciesIndex.generated.js';
+import { lusolveDependencies } from './dependenciesLusolve.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { matrixFromColumnsDependencies } from './dependenciesMatrixFromColumns.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { rangeDependencies } from './dependenciesRange.generated.js';
+import { schurDependencies } from './dependenciesSchur.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { transposeDependencies } from './dependenciesTranspose.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSylvester } from '../../factoriesAny.js';
+export var sylvesterDependencies = {
+  absDependencies,
+  addDependencies,
+  concatDependencies,
+  identityDependencies,
+  indexDependencies,
+  lusolveDependencies,
+  matrixDependencies,
+  matrixFromColumnsDependencies,
+  multiplyDependencies,
+  rangeDependencies,
+  schurDependencies,
+  subsetDependencies,
+  subtractDependencies,
+  transposeDependencies,
+  typedDependencies,
+  createSylvester
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..dcde6cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createSymbolNode } from '../../factoriesAny.js';
+export var SymbolNodeDependencies = {
+  UnitDependencies,
+  NodeDependencies,
+  createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
new file mode 100644
index 0000000..6f529c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesSymbolicEqual.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSymbolicEqual } from '../../factoriesAny.js';
+export var symbolicEqualDependencies = {
+  OperatorNodeDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createSymbolicEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js
new file mode 100644
index 0000000..e445666
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTan } from '../../factoriesAny.js';
+export var tanDependencies = {
+  typedDependencies,
+  createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js
new file mode 100644
index 0000000..d770f24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTanh } from '../../factoriesAny.js';
+export var tanhDependencies = {
+  typedDependencies,
+  createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js
new file mode 100644
index 0000000..8cf5bda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTau.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createTau } from '../../factoriesAny.js';
+export var tauDependencies = {
+  BigNumberDependencies,
+  createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
new file mode 100644
index 0000000..92d52f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesThomsonCrossSection.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createThomsonCrossSection } from '../../factoriesAny.js';
+export var thomsonCrossSectionDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createThomsonCrossSection
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js
new file mode 100644
index 0000000..c1f15e7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTo.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTo } from '../../factoriesAny.js';
+export var toDependencies = {
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createTo
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesToBest.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesToBest.generated.js
new file mode 100644
index 0000000..b74bd1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesToBest.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createToBest } from '../../factoriesAny.js';
+export var toBestDependencies = {
+  typedDependencies,
+  createToBest
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js
new file mode 100644
index 0000000..48b6db0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrace.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTrace } from '../../factoriesAny.js';
+export var traceDependencies = {
+  addDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createTrace
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js
new file mode 100644
index 0000000..d89ace7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTranspose.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTranspose } from '../../factoriesAny.js';
+export var transposeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createTranspose
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js
new file mode 100644
index 0000000..c4e92e0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTrue.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTrue } from '../../factoriesAny.js';
+export var trueDependencies = {
+  createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..d9aa68b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTypeOf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTypeOf } from '../../factoriesAny.js';
+export var typeOfDependencies = {
+  typedDependencies,
+  createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js
new file mode 100644
index 0000000..61e4723
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesTyped.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { createTyped } from '../../factoriesAny.js';
+export var typedDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  DenseMatrixDependencies,
+  FractionDependencies,
+  createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..465375d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryMinus } from '../../factoriesAny.js';
+export var unaryMinusDependencies = {
+  typedDependencies,
+  createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..5b63a38
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryPlus } from '../../factoriesAny.js';
+export var unaryPlusDependencies = {
+  numericDependencies,
+  typedDependencies,
+  createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..09199fb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnequal.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnequal } from '../../factoriesAny.js';
+export var unequalDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js
new file mode 100644
index 0000000..674182a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitClass.generated.js
@@ -0,0 +1,40 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { FractionDependencies } from './dependenciesFractionClass.generated.js';
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { fixDependencies } from './dependenciesFix.generated.js';
+import { formatDependencies } from './dependenciesFormat.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { toBestDependencies } from './dependenciesToBest.generated.js';
+import { createUnitClass } from '../../factoriesAny.js';
+export var UnitDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  FractionDependencies,
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  equalDependencies,
+  fixDependencies,
+  formatDependencies,
+  isNumericDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  roundDependencies,
+  subtractScalarDependencies,
+  toBestDependencies,
+  createUnitClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js
new file mode 100644
index 0000000..2b82164
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUnitFunction.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnitFunction } from '../../factoriesAny.js';
+export var unitDependencies = {
+  UnitDependencies,
+  typedDependencies,
+  createUnitFunction
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..2c7a8a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercaseE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { eDependencies } from './dependenciesE.generated.js';
+import { createUppercaseE } from '../../factoriesAny.js';
+export var EDependencies = {
+  eDependencies,
+  createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..fe09896
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUppercasePi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { piDependencies } from './dependenciesPi.generated.js';
+import { createUppercasePi } from '../../factoriesAny.js';
+export var PIDependencies = {
+  piDependencies,
+  createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js
new file mode 100644
index 0000000..ca89b20
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolve.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUsolve } from '../../factoriesAny.js';
+export var usolveDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createUsolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js
new file mode 100644
index 0000000..263b99f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesUsolveAll.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUsolveAll } from '../../factoriesAny.js';
+export var usolveAllDependencies = {
+  DenseMatrixDependencies,
+  divideScalarDependencies,
+  equalScalarDependencies,
+  matrixDependencies,
+  multiplyScalarDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createUsolveAll
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
new file mode 100644
index 0000000..6be2fb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVacuumImpedance.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createVacuumImpedance } from '../../factoriesAny.js';
+export var vacuumImpedanceDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createVacuumImpedance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js
new file mode 100644
index 0000000..624066f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVariance.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVariance } from '../../factoriesAny.js';
+export var varianceDependencies = {
+  addDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..a5e7a1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVarianceTransform } from '../../factoriesAny.js';
+export var varianceTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js
new file mode 100644
index 0000000..7c895fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesVersion.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createVersion } from '../../factoriesAny.js';
+export var versionDependencies = {
+  createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
new file mode 100644
index 0000000..716bbf1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWeakMixingAngle.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { createWeakMixingAngle } from '../../factoriesAny.js';
+export var weakMixingAngleDependencies = {
+  BigNumberDependencies,
+  createWeakMixingAngle
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
new file mode 100644
index 0000000..221b0b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesWienDisplacement.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { UnitDependencies } from './dependenciesUnitClass.generated.js';
+import { createWienDisplacement } from '../../factoriesAny.js';
+export var wienDisplacementDependencies = {
+  BigNumberDependencies,
+  UnitDependencies,
+  createWienDisplacement
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..a2e24d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXgcd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXgcd } from '../../factoriesAny.js';
+export var xgcdDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js
new file mode 100644
index 0000000..8375996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesXor.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { DenseMatrixDependencies } from './dependenciesDenseMatrixClass.generated.js';
+import { SparseMatrixDependencies } from './dependenciesSparseMatrixClass.generated.js';
+import { concatDependencies } from './dependenciesConcat.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXor } from '../../factoriesAny.js';
+export var xorDependencies = {
+  DenseMatrixDependencies,
+  SparseMatrixDependencies,
+  concatDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js
new file mode 100644
index 0000000..de21eba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeros.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createZeros } from '../../factoriesAny.js';
+export var zerosDependencies = {
+  BigNumberDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createZeros
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeta.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeta.generated.js
new file mode 100644
index 0000000..b75ed9f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZeta.generated.js
@@ -0,0 +1,38 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { BigNumberDependencies } from './dependenciesBigNumberClass.generated.js';
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { piDependencies } from './dependenciesPi.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createZeta } from '../../factoriesAny.js';
+export var zetaDependencies = {
+  BigNumberDependencies,
+  ComplexDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  factorialDependencies,
+  gammaDependencies,
+  isNegativeDependencies,
+  multiplyDependencies,
+  piDependencies,
+  powDependencies,
+  sinDependencies,
+  smallerEqDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createZeta
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZpk2tf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZpk2tf.generated.js
new file mode 100644
index 0000000..bae859a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesAny/dependenciesZpk2tf.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ComplexDependencies } from './dependenciesComplexClass.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createZpk2tf } from '../../factoriesAny.js';
+export var zpk2tfDependencies = {
+  ComplexDependencies,
+  addDependencies,
+  multiplyDependencies,
+  numberDependencies,
+  typedDependencies,
+  createZpk2tf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js
new file mode 100644
index 0000000..2d7d76e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber.generated.js
@@ -0,0 +1,210 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+export { absDependencies } from './dependenciesNumber/dependenciesAbs.generated.js';
+export { AccessorNodeDependencies } from './dependenciesNumber/dependenciesAccessorNode.generated.js';
+export { acosDependencies } from './dependenciesNumber/dependenciesAcos.generated.js';
+export { acoshDependencies } from './dependenciesNumber/dependenciesAcosh.generated.js';
+export { acotDependencies } from './dependenciesNumber/dependenciesAcot.generated.js';
+export { acothDependencies } from './dependenciesNumber/dependenciesAcoth.generated.js';
+export { acscDependencies } from './dependenciesNumber/dependenciesAcsc.generated.js';
+export { acschDependencies } from './dependenciesNumber/dependenciesAcsch.generated.js';
+export { addDependencies } from './dependenciesNumber/dependenciesAdd.generated.js';
+export { addScalarDependencies } from './dependenciesNumber/dependenciesAddScalar.generated.js';
+export { andDependencies } from './dependenciesNumber/dependenciesAnd.generated.js';
+export { ArrayNodeDependencies } from './dependenciesNumber/dependenciesArrayNode.generated.js';
+export { asecDependencies } from './dependenciesNumber/dependenciesAsec.generated.js';
+export { asechDependencies } from './dependenciesNumber/dependenciesAsech.generated.js';
+export { asinDependencies } from './dependenciesNumber/dependenciesAsin.generated.js';
+export { asinhDependencies } from './dependenciesNumber/dependenciesAsinh.generated.js';
+export { AssignmentNodeDependencies } from './dependenciesNumber/dependenciesAssignmentNode.generated.js';
+export { atanDependencies } from './dependenciesNumber/dependenciesAtan.generated.js';
+export { atan2Dependencies } from './dependenciesNumber/dependenciesAtan2.generated.js';
+export { atanhDependencies } from './dependenciesNumber/dependenciesAtanh.generated.js';
+export { bellNumbersDependencies } from './dependenciesNumber/dependenciesBellNumbers.generated.js';
+export { bigintDependencies } from './dependenciesNumber/dependenciesBigint.generated.js';
+export { bitAndDependencies } from './dependenciesNumber/dependenciesBitAnd.generated.js';
+export { bitNotDependencies } from './dependenciesNumber/dependenciesBitNot.generated.js';
+export { bitOrDependencies } from './dependenciesNumber/dependenciesBitOr.generated.js';
+export { bitXorDependencies } from './dependenciesNumber/dependenciesBitXor.generated.js';
+export { BlockNodeDependencies } from './dependenciesNumber/dependenciesBlockNode.generated.js';
+export { booleanDependencies } from './dependenciesNumber/dependenciesBoolean.generated.js';
+export { catalanDependencies } from './dependenciesNumber/dependenciesCatalan.generated.js';
+export { cbrtDependencies } from './dependenciesNumber/dependenciesCbrt.generated.js';
+export { ceilDependencies } from './dependenciesNumber/dependenciesCeil.generated.js';
+export { chainDependencies } from './dependenciesNumber/dependenciesChain.generated.js';
+export { ChainDependencies } from './dependenciesNumber/dependenciesChainClass.generated.js';
+export { cloneDependencies } from './dependenciesNumber/dependenciesClone.generated.js';
+export { combinationsDependencies } from './dependenciesNumber/dependenciesCombinations.generated.js';
+export { combinationsWithRepDependencies } from './dependenciesNumber/dependenciesCombinationsWithRep.generated.js';
+export { compareDependencies } from './dependenciesNumber/dependenciesCompare.generated.js';
+export { compareNaturalDependencies } from './dependenciesNumber/dependenciesCompareNatural.generated.js';
+export { compareTextDependencies } from './dependenciesNumber/dependenciesCompareText.generated.js';
+export { compileDependencies } from './dependenciesNumber/dependenciesCompile.generated.js';
+export { compositionDependencies } from './dependenciesNumber/dependenciesComposition.generated.js';
+export { ConditionalNodeDependencies } from './dependenciesNumber/dependenciesConditionalNode.generated.js';
+export { ConstantNodeDependencies } from './dependenciesNumber/dependenciesConstantNode.generated.js';
+export { corrDependencies } from './dependenciesNumber/dependenciesCorr.generated.js';
+export { cosDependencies } from './dependenciesNumber/dependenciesCos.generated.js';
+export { coshDependencies } from './dependenciesNumber/dependenciesCosh.generated.js';
+export { cotDependencies } from './dependenciesNumber/dependenciesCot.generated.js';
+export { cothDependencies } from './dependenciesNumber/dependenciesCoth.generated.js';
+export { cscDependencies } from './dependenciesNumber/dependenciesCsc.generated.js';
+export { cschDependencies } from './dependenciesNumber/dependenciesCsch.generated.js';
+export { cubeDependencies } from './dependenciesNumber/dependenciesCube.generated.js';
+export { cumsumDependencies } from './dependenciesNumber/dependenciesCumSum.generated.js';
+export { cumsumTransformDependencies } from './dependenciesNumber/dependenciesCumSumTransform.generated.js';
+export { deepEqualDependencies } from './dependenciesNumber/dependenciesDeepEqual.generated.js';
+export { derivativeDependencies } from './dependenciesNumber/dependenciesDerivative.generated.js';
+export { divideDependencies } from './dependenciesNumber/dependenciesDivide.generated.js';
+export { divideScalarDependencies } from './dependenciesNumber/dependenciesDivideScalar.generated.js';
+export { eDependencies } from './dependenciesNumber/dependenciesE.generated.js';
+export { equalDependencies } from './dependenciesNumber/dependenciesEqual.generated.js';
+export { equalScalarDependencies } from './dependenciesNumber/dependenciesEqualScalar.generated.js';
+export { equalTextDependencies } from './dependenciesNumber/dependenciesEqualText.generated.js';
+export { erfDependencies } from './dependenciesNumber/dependenciesErf.generated.js';
+export { evaluateDependencies } from './dependenciesNumber/dependenciesEvaluate.generated.js';
+export { expDependencies } from './dependenciesNumber/dependenciesExp.generated.js';
+export { expm1Dependencies } from './dependenciesNumber/dependenciesExpm1.generated.js';
+export { factorialDependencies } from './dependenciesNumber/dependenciesFactorial.generated.js';
+export { falseDependencies } from './dependenciesNumber/dependenciesFalse.generated.js';
+export { filterDependencies } from './dependenciesNumber/dependenciesFilter.generated.js';
+export { filterTransformDependencies } from './dependenciesNumber/dependenciesFilterTransform.generated.js';
+export { fixDependencies } from './dependenciesNumber/dependenciesFix.generated.js';
+export { floorDependencies } from './dependenciesNumber/dependenciesFloor.generated.js';
+export { forEachDependencies } from './dependenciesNumber/dependenciesForEach.generated.js';
+export { forEachTransformDependencies } from './dependenciesNumber/dependenciesForEachTransform.generated.js';
+export { formatDependencies } from './dependenciesNumber/dependenciesFormat.generated.js';
+export { FunctionAssignmentNodeDependencies } from './dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js';
+export { FunctionNodeDependencies } from './dependenciesNumber/dependenciesFunctionNode.generated.js';
+export { gammaDependencies } from './dependenciesNumber/dependenciesGamma.generated.js';
+export { gcdDependencies } from './dependenciesNumber/dependenciesGcd.generated.js';
+export { hasNumericValueDependencies } from './dependenciesNumber/dependenciesHasNumericValue.generated.js';
+export { helpDependencies } from './dependenciesNumber/dependenciesHelp.generated.js';
+export { HelpDependencies } from './dependenciesNumber/dependenciesHelpClass.generated.js';
+export { hypotDependencies } from './dependenciesNumber/dependenciesHypot.generated.js';
+export { indexDependencies } from './dependenciesNumber/dependenciesIndex.generated.js';
+export { IndexNodeDependencies } from './dependenciesNumber/dependenciesIndexNode.generated.js';
+export { InfinityDependencies } from './dependenciesNumber/dependenciesInfinity.generated.js';
+export { isIntegerDependencies } from './dependenciesNumber/dependenciesIsInteger.generated.js';
+export { isNaNDependencies } from './dependenciesNumber/dependenciesIsNaN.generated.js';
+export { isNegativeDependencies } from './dependenciesNumber/dependenciesIsNegative.generated.js';
+export { isNumericDependencies } from './dependenciesNumber/dependenciesIsNumeric.generated.js';
+export { isPositiveDependencies } from './dependenciesNumber/dependenciesIsPositive.generated.js';
+export { isPrimeDependencies } from './dependenciesNumber/dependenciesIsPrime.generated.js';
+export { isZeroDependencies } from './dependenciesNumber/dependenciesIsZero.generated.js';
+export { LN10Dependencies } from './dependenciesNumber/dependenciesLN10.generated.js';
+export { LN2Dependencies } from './dependenciesNumber/dependenciesLN2.generated.js';
+export { LOG10EDependencies } from './dependenciesNumber/dependenciesLOG10E.generated.js';
+export { LOG2EDependencies } from './dependenciesNumber/dependenciesLOG2E.generated.js';
+export { largerDependencies } from './dependenciesNumber/dependenciesLarger.generated.js';
+export { largerEqDependencies } from './dependenciesNumber/dependenciesLargerEq.generated.js';
+export { lcmDependencies } from './dependenciesNumber/dependenciesLcm.generated.js';
+export { leftShiftDependencies } from './dependenciesNumber/dependenciesLeftShift.generated.js';
+export { lgammaDependencies } from './dependenciesNumber/dependenciesLgamma.generated.js';
+export { logDependencies } from './dependenciesNumber/dependenciesLog.generated.js';
+export { log10Dependencies } from './dependenciesNumber/dependenciesLog10.generated.js';
+export { log1pDependencies } from './dependenciesNumber/dependenciesLog1p.generated.js';
+export { log2Dependencies } from './dependenciesNumber/dependenciesLog2.generated.js';
+export { madDependencies } from './dependenciesNumber/dependenciesMad.generated.js';
+export { mapDependencies } from './dependenciesNumber/dependenciesMap.generated.js';
+export { mapSlicesDependencies } from './dependenciesNumber/dependenciesMapSlices.generated.js';
+export { mapSlicesTransformDependencies } from './dependenciesNumber/dependenciesMapSlicesTransform.generated.js';
+export { mapTransformDependencies } from './dependenciesNumber/dependenciesMapTransform.generated.js';
+export { matrixDependencies } from './dependenciesNumber/dependenciesMatrix.generated.js';
+export { maxDependencies } from './dependenciesNumber/dependenciesMax.generated.js';
+export { maxTransformDependencies } from './dependenciesNumber/dependenciesMaxTransform.generated.js';
+export { meanDependencies } from './dependenciesNumber/dependenciesMean.generated.js';
+export { meanTransformDependencies } from './dependenciesNumber/dependenciesMeanTransform.generated.js';
+export { medianDependencies } from './dependenciesNumber/dependenciesMedian.generated.js';
+export { minDependencies } from './dependenciesNumber/dependenciesMin.generated.js';
+export { minTransformDependencies } from './dependenciesNumber/dependenciesMinTransform.generated.js';
+export { modDependencies } from './dependenciesNumber/dependenciesMod.generated.js';
+export { modeDependencies } from './dependenciesNumber/dependenciesMode.generated.js';
+export { multinomialDependencies } from './dependenciesNumber/dependenciesMultinomial.generated.js';
+export { multiplyDependencies } from './dependenciesNumber/dependenciesMultiply.generated.js';
+export { multiplyScalarDependencies } from './dependenciesNumber/dependenciesMultiplyScalar.generated.js';
+export { NaNDependencies } from './dependenciesNumber/dependenciesNaN.generated.js';
+export { NodeDependencies } from './dependenciesNumber/dependenciesNode.generated.js';
+export { normDependencies } from './dependenciesNumber/dependenciesNorm.generated.js';
+export { notDependencies } from './dependenciesNumber/dependenciesNot.generated.js';
+export { nthRootDependencies } from './dependenciesNumber/dependenciesNthRoot.generated.js';
+export { nullDependencies } from './dependenciesNumber/dependenciesNull.generated.js';
+export { numberDependencies } from './dependenciesNumber/dependenciesNumber.generated.js';
+export { numericDependencies } from './dependenciesNumber/dependenciesNumeric.generated.js';
+export { ObjectNodeDependencies } from './dependenciesNumber/dependenciesObjectNode.generated.js';
+export { OperatorNodeDependencies } from './dependenciesNumber/dependenciesOperatorNode.generated.js';
+export { orDependencies } from './dependenciesNumber/dependenciesOr.generated.js';
+export { ParenthesisNodeDependencies } from './dependenciesNumber/dependenciesParenthesisNode.generated.js';
+export { parseDependencies } from './dependenciesNumber/dependenciesParse.generated.js';
+export { parserDependencies } from './dependenciesNumber/dependenciesParser.generated.js';
+export { ParserDependencies } from './dependenciesNumber/dependenciesParserClass.generated.js';
+export { partitionSelectDependencies } from './dependenciesNumber/dependenciesPartitionSelect.generated.js';
+export { permutationsDependencies } from './dependenciesNumber/dependenciesPermutations.generated.js';
+export { phiDependencies } from './dependenciesNumber/dependenciesPhi.generated.js';
+export { piDependencies } from './dependenciesNumber/dependenciesPi.generated.js';
+export { pickRandomDependencies } from './dependenciesNumber/dependenciesPickRandom.generated.js';
+export { powDependencies } from './dependenciesNumber/dependenciesPow.generated.js';
+export { printDependencies } from './dependenciesNumber/dependenciesPrint.generated.js';
+export { prodDependencies } from './dependenciesNumber/dependenciesProd.generated.js';
+export { quantileSeqDependencies } from './dependenciesNumber/dependenciesQuantileSeq.generated.js';
+export { randomDependencies } from './dependenciesNumber/dependenciesRandom.generated.js';
+export { randomIntDependencies } from './dependenciesNumber/dependenciesRandomInt.generated.js';
+export { rangeDependencies } from './dependenciesNumber/dependenciesRange.generated.js';
+export { RangeDependencies } from './dependenciesNumber/dependenciesRangeClass.generated.js';
+export { RangeNodeDependencies } from './dependenciesNumber/dependenciesRangeNode.generated.js';
+export { rangeTransformDependencies } from './dependenciesNumber/dependenciesRangeTransform.generated.js';
+export { rationalizeDependencies } from './dependenciesNumber/dependenciesRationalize.generated.js';
+export { RelationalNodeDependencies } from './dependenciesNumber/dependenciesRelationalNode.generated.js';
+export { replacerDependencies } from './dependenciesNumber/dependenciesReplacer.generated.js';
+export { resolveDependencies } from './dependenciesNumber/dependenciesResolve.generated.js';
+export { ResultSetDependencies } from './dependenciesNumber/dependenciesResultSet.generated.js';
+export { reviverDependencies } from './dependenciesNumber/dependenciesReviver.generated.js';
+export { rightArithShiftDependencies } from './dependenciesNumber/dependenciesRightArithShift.generated.js';
+export { rightLogShiftDependencies } from './dependenciesNumber/dependenciesRightLogShift.generated.js';
+export { roundDependencies } from './dependenciesNumber/dependenciesRound.generated.js';
+export { SQRT1_2Dependencies } from './dependenciesNumber/dependenciesSQRT1_2.generated.js'; // eslint-disable-line camelcase
+export { SQRT2Dependencies } from './dependenciesNumber/dependenciesSQRT2.generated.js';
+export { secDependencies } from './dependenciesNumber/dependenciesSec.generated.js';
+export { sechDependencies } from './dependenciesNumber/dependenciesSech.generated.js';
+export { signDependencies } from './dependenciesNumber/dependenciesSign.generated.js';
+export { simplifyDependencies } from './dependenciesNumber/dependenciesSimplify.generated.js';
+export { simplifyConstantDependencies } from './dependenciesNumber/dependenciesSimplifyConstant.generated.js';
+export { simplifyCoreDependencies } from './dependenciesNumber/dependenciesSimplifyCore.generated.js';
+export { sinDependencies } from './dependenciesNumber/dependenciesSin.generated.js';
+export { sinhDependencies } from './dependenciesNumber/dependenciesSinh.generated.js';
+export { sizeDependencies } from './dependenciesNumber/dependenciesSize.generated.js';
+export { smallerDependencies } from './dependenciesNumber/dependenciesSmaller.generated.js';
+export { smallerEqDependencies } from './dependenciesNumber/dependenciesSmallerEq.generated.js';
+export { sqrtDependencies } from './dependenciesNumber/dependenciesSqrt.generated.js';
+export { squareDependencies } from './dependenciesNumber/dependenciesSquare.generated.js';
+export { stdDependencies } from './dependenciesNumber/dependenciesStd.generated.js';
+export { stdTransformDependencies } from './dependenciesNumber/dependenciesStdTransform.generated.js';
+export { stirlingS2Dependencies } from './dependenciesNumber/dependenciesStirlingS2.generated.js';
+export { stringDependencies } from './dependenciesNumber/dependenciesString.generated.js';
+export { subsetDependencies } from './dependenciesNumber/dependenciesSubset.generated.js';
+export { subsetTransformDependencies } from './dependenciesNumber/dependenciesSubsetTransform.generated.js';
+export { subtractDependencies } from './dependenciesNumber/dependenciesSubtract.generated.js';
+export { subtractScalarDependencies } from './dependenciesNumber/dependenciesSubtractScalar.generated.js';
+export { sumDependencies } from './dependenciesNumber/dependenciesSum.generated.js';
+export { sumTransformDependencies } from './dependenciesNumber/dependenciesSumTransform.generated.js';
+export { SymbolNodeDependencies } from './dependenciesNumber/dependenciesSymbolNode.generated.js';
+export { tanDependencies } from './dependenciesNumber/dependenciesTan.generated.js';
+export { tanhDependencies } from './dependenciesNumber/dependenciesTanh.generated.js';
+export { tauDependencies } from './dependenciesNumber/dependenciesTau.generated.js';
+export { trueDependencies } from './dependenciesNumber/dependenciesTrue.generated.js';
+export { typeOfDependencies } from './dependenciesNumber/dependenciesTypeOf.generated.js';
+export { typedDependencies } from './dependenciesNumber/dependenciesTyped.generated.js';
+export { unaryMinusDependencies } from './dependenciesNumber/dependenciesUnaryMinus.generated.js';
+export { unaryPlusDependencies } from './dependenciesNumber/dependenciesUnaryPlus.generated.js';
+export { unequalDependencies } from './dependenciesNumber/dependenciesUnequal.generated.js';
+export { EDependencies } from './dependenciesNumber/dependenciesUppercaseE.generated.js';
+export { PIDependencies } from './dependenciesNumber/dependenciesUppercasePi.generated.js';
+export { varianceDependencies } from './dependenciesNumber/dependenciesVariance.generated.js';
+export { varianceTransformDependencies } from './dependenciesNumber/dependenciesVarianceTransform.generated.js';
+export { versionDependencies } from './dependenciesNumber/dependenciesVersion.generated.js';
+export { xgcdDependencies } from './dependenciesNumber/dependenciesXgcd.generated.js';
+export { xorDependencies } from './dependenciesNumber/dependenciesXor.generated.js';
+export { zetaDependencies } from './dependenciesNumber/dependenciesZeta.generated.js';
+export { all } from './allFactoriesNumber.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js
new file mode 100644
index 0000000..8e76a18
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAbs.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAbs } from '../../factoriesNumber.js';
+export var absDependencies = {
+  typedDependencies,
+  createAbs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
new file mode 100644
index 0000000..eb1fee5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAccessorNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAccessorNode } from '../../factoriesNumber.js';
+export var AccessorNodeDependencies = {
+  NodeDependencies,
+  subsetDependencies,
+  createAccessorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js
new file mode 100644
index 0000000..898a51e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcos } from '../../factoriesNumber.js';
+export var acosDependencies = {
+  typedDependencies,
+  createAcos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js
new file mode 100644
index 0000000..b84cc05
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcosh } from '../../factoriesNumber.js';
+export var acoshDependencies = {
+  typedDependencies,
+  createAcosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js
new file mode 100644
index 0000000..f8db302
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcot } from '../../factoriesNumber.js';
+export var acotDependencies = {
+  typedDependencies,
+  createAcot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js
new file mode 100644
index 0000000..a14ff92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcoth.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcoth } from '../../factoriesNumber.js';
+export var acothDependencies = {
+  typedDependencies,
+  createAcoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js
new file mode 100644
index 0000000..bc87242
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsc.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsc } from '../../factoriesNumber.js';
+export var acscDependencies = {
+  typedDependencies,
+  createAcsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js
new file mode 100644
index 0000000..3faae99
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAcsch.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAcsch } from '../../factoriesNumber.js';
+export var acschDependencies = {
+  typedDependencies,
+  createAcsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js
new file mode 100644
index 0000000..a440e5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAdd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAdd } from '../../factoriesNumber.js';
+export var addDependencies = {
+  typedDependencies,
+  createAdd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js
new file mode 100644
index 0000000..47cb618
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAddScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAddScalar } from '../../factoriesNumber.js';
+export var addScalarDependencies = {
+  typedDependencies,
+  createAddScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js
new file mode 100644
index 0000000..045289d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAnd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAnd } from '../../factoriesNumber.js';
+export var andDependencies = {
+  typedDependencies,
+  createAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js
new file mode 100644
index 0000000..0651558
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesArrayNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createArrayNode } from '../../factoriesNumber.js';
+export var ArrayNodeDependencies = {
+  NodeDependencies,
+  createArrayNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js
new file mode 100644
index 0000000..79fafbe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsec.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsec } from '../../factoriesNumber.js';
+export var asecDependencies = {
+  typedDependencies,
+  createAsec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js
new file mode 100644
index 0000000..607f607
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsech.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsech } from '../../factoriesNumber.js';
+export var asechDependencies = {
+  typedDependencies,
+  createAsech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js
new file mode 100644
index 0000000..631c616
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsin } from '../../factoriesNumber.js';
+export var asinDependencies = {
+  typedDependencies,
+  createAsin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js
new file mode 100644
index 0000000..d55d45e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAsinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAsinh } from '../../factoriesNumber.js';
+export var asinhDependencies = {
+  typedDependencies,
+  createAsinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
new file mode 100644
index 0000000..7f83cec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAssignmentNode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { subsetDependencies } from './dependenciesSubset.generated.js';
+import { createAssignmentNode } from '../../factoriesNumber.js';
+export var AssignmentNodeDependencies = {
+  matrixDependencies,
+  NodeDependencies,
+  subsetDependencies,
+  createAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js
new file mode 100644
index 0000000..ed88d81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan } from '../../factoriesNumber.js';
+export var atanDependencies = {
+  typedDependencies,
+  createAtan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js
new file mode 100644
index 0000000..8aaaafa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtan2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtan2 } from '../../factoriesNumber.js';
+export var atan2Dependencies = {
+  typedDependencies,
+  createAtan2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js
new file mode 100644
index 0000000..d5b8076
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesAtanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createAtanh } from '../../factoriesNumber.js';
+export var atanhDependencies = {
+  typedDependencies,
+  createAtanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
new file mode 100644
index 0000000..5464e7a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBellNumbers.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { stirlingS2Dependencies } from './dependenciesStirlingS2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBellNumbers } from '../../factoriesNumber.js';
+export var bellNumbersDependencies = {
+  addScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  stirlingS2Dependencies,
+  typedDependencies,
+  createBellNumbers
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBigint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBigint.generated.js
new file mode 100644
index 0000000..77f9760
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBigint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBigint } from '../../factoriesNumber.js';
+export var bigintDependencies = {
+  typedDependencies,
+  createBigint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js
new file mode 100644
index 0000000..68268db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitAnd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitAnd } from '../../factoriesNumber.js';
+export var bitAndDependencies = {
+  typedDependencies,
+  createBitAnd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js
new file mode 100644
index 0000000..a8c3bdc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitNot } from '../../factoriesNumber.js';
+export var bitNotDependencies = {
+  typedDependencies,
+  createBitNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js
new file mode 100644
index 0000000..4aeaeda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitOr.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitOr } from '../../factoriesNumber.js';
+export var bitOrDependencies = {
+  typedDependencies,
+  createBitOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js
new file mode 100644
index 0000000..81badcb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBitXor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBitXor } from '../../factoriesNumber.js';
+export var bitXorDependencies = {
+  typedDependencies,
+  createBitXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js
new file mode 100644
index 0000000..0043939
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBlockNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { ResultSetDependencies } from './dependenciesResultSet.generated.js';
+import { createBlockNode } from '../../factoriesNumber.js';
+export var BlockNodeDependencies = {
+  NodeDependencies,
+  ResultSetDependencies,
+  createBlockNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js
new file mode 100644
index 0000000..f25ec83
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesBoolean.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createBoolean } from '../../factoriesNumber.js';
+export var booleanDependencies = {
+  typedDependencies,
+  createBoolean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js
new file mode 100644
index 0000000..1933851
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCatalan.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCatalan } from '../../factoriesNumber.js';
+export var catalanDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  multiplyScalarDependencies,
+  typedDependencies,
+  createCatalan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js
new file mode 100644
index 0000000..48c4f97
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCbrt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCbrt } from '../../factoriesNumber.js';
+export var cbrtDependencies = {
+  typedDependencies,
+  createCbrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js
new file mode 100644
index 0000000..8563817
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCeil.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCeil } from '../../factoriesNumber.js';
+export var ceilDependencies = {
+  roundDependencies,
+  typedDependencies,
+  createCeil
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js
new file mode 100644
index 0000000..71e7b15
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChain.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ChainDependencies } from './dependenciesChainClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChain } from '../../factoriesNumber.js';
+export var chainDependencies = {
+  ChainDependencies,
+  typedDependencies,
+  createChain
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js
new file mode 100644
index 0000000..6a1b57f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesChainClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createChainClass } from '../../factoriesNumber.js';
+export var ChainDependencies = {
+  typedDependencies,
+  createChainClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js
new file mode 100644
index 0000000..8041edc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesClone.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createClone } from '../../factoriesNumber.js';
+export var cloneDependencies = {
+  typedDependencies,
+  createClone
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js
new file mode 100644
index 0000000..9cda3b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinations.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinations } from '../../factoriesNumber.js';
+export var combinationsDependencies = {
+  typedDependencies,
+  createCombinations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
new file mode 100644
index 0000000..e1e4790
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCombinationsWithRep.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCombinationsWithRep } from '../../factoriesNumber.js';
+export var combinationsWithRepDependencies = {
+  typedDependencies,
+  createCombinationsWithRep
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js
new file mode 100644
index 0000000..c884350
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompare } from '../../factoriesNumber.js';
+export var compareDependencies = {
+  typedDependencies,
+  createCompare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
new file mode 100644
index 0000000..9755e62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareNatural.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareNatural } from '../../factoriesNumber.js';
+export var compareNaturalDependencies = {
+  compareDependencies,
+  typedDependencies,
+  createCompareNatural
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js
new file mode 100644
index 0000000..ea978ce
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompareText.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompareText } from '../../factoriesNumber.js';
+export var compareTextDependencies = {
+  typedDependencies,
+  createCompareText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js
new file mode 100644
index 0000000..542a1f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCompile.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCompile } from '../../factoriesNumber.js';
+export var compileDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createCompile
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js
new file mode 100644
index 0000000..f330d8e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesComposition.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createComposition } from '../../factoriesNumber.js';
+export var compositionDependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  isPositiveDependencies,
+  largerDependencies,
+  typedDependencies,
+  createComposition
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
new file mode 100644
index 0000000..4c34e6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConditionalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConditionalNode } from '../../factoriesNumber.js';
+export var ConditionalNodeDependencies = {
+  NodeDependencies,
+  createConditionalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js
new file mode 100644
index 0000000..475a167
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesConstantNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createConstantNode } from '../../factoriesNumber.js';
+export var ConstantNodeDependencies = {
+  NodeDependencies,
+  createConstantNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCorr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCorr.generated.js
new file mode 100644
index 0000000..d5c9449
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCorr.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { meanDependencies } from './dependenciesMean.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { sumDependencies } from './dependenciesSum.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCorr } from '../../factoriesNumber.js';
+export var corrDependencies = {
+  addDependencies,
+  divideDependencies,
+  matrixDependencies,
+  meanDependencies,
+  multiplyDependencies,
+  powDependencies,
+  sqrtDependencies,
+  subtractDependencies,
+  sumDependencies,
+  typedDependencies,
+  createCorr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js
new file mode 100644
index 0000000..3e5005c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCos.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCos } from '../../factoriesNumber.js';
+export var cosDependencies = {
+  typedDependencies,
+  createCos
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js
new file mode 100644
index 0000000..2baafcc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCosh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCosh } from '../../factoriesNumber.js';
+export var coshDependencies = {
+  typedDependencies,
+  createCosh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js
new file mode 100644
index 0000000..674ee60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCot } from '../../factoriesNumber.js';
+export var cotDependencies = {
+  typedDependencies,
+  createCot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js
new file mode 100644
index 0000000..7a0499a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCoth.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCoth } from '../../factoriesNumber.js';
+export var cothDependencies = {
+  typedDependencies,
+  createCoth
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js
new file mode 100644
index 0000000..9f657c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsc.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsc } from '../../factoriesNumber.js';
+export var cscDependencies = {
+  typedDependencies,
+  createCsc
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js
new file mode 100644
index 0000000..1744426
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCsch.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCsch } from '../../factoriesNumber.js';
+export var cschDependencies = {
+  typedDependencies,
+  createCsch
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js
new file mode 100644
index 0000000..c4ae1d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCube.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createCube } from '../../factoriesNumber.js';
+export var cubeDependencies = {
+  typedDependencies,
+  createCube
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js
new file mode 100644
index 0000000..fb98496
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSum } from '../../factoriesNumber.js';
+export var cumsumDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
new file mode 100644
index 0000000..4bc32c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesCumSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { unaryPlusDependencies } from './dependenciesUnaryPlus.generated.js';
+import { createCumSumTransform } from '../../factoriesNumber.js';
+export var cumsumTransformDependencies = {
+  addDependencies,
+  typedDependencies,
+  unaryPlusDependencies,
+  createCumSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
new file mode 100644
index 0000000..994ed63
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDeepEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDeepEqual } from '../../factoriesNumber.js';
+export var deepEqualDependencies = {
+  equalDependencies,
+  typedDependencies,
+  createDeepEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js
new file mode 100644
index 0000000..388309d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDerivative.generated.js
@@ -0,0 +1,30 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDerivative } from '../../factoriesNumber.js';
+export var derivativeDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  numericDependencies,
+  parseDependencies,
+  simplifyDependencies,
+  typedDependencies,
+  createDerivative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js
new file mode 100644
index 0000000..cc18b98
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivide.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivide } from '../../factoriesNumber.js';
+export var divideDependencies = {
+  typedDependencies,
+  createDivide
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
new file mode 100644
index 0000000..7471996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesDivideScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createDivideScalar } from '../../factoriesNumber.js';
+export var divideScalarDependencies = {
+  typedDependencies,
+  createDivideScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js
new file mode 100644
index 0000000..734a86c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesE.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createE } from '../../factoriesNumber.js';
+export var eDependencies = {
+  createE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js
new file mode 100644
index 0000000..f6efd58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqual.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqual } from '../../factoriesNumber.js';
+export var equalDependencies = {
+  equalScalarDependencies,
+  typedDependencies,
+  createEqual
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
new file mode 100644
index 0000000..e8985ab
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualScalar } from '../../factoriesNumber.js';
+export var equalScalarDependencies = {
+  typedDependencies,
+  createEqualScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js
new file mode 100644
index 0000000..cfcbd90
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEqualText.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareTextDependencies } from './dependenciesCompareText.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEqualText } from '../../factoriesNumber.js';
+export var equalTextDependencies = {
+  compareTextDependencies,
+  isZeroDependencies,
+  typedDependencies,
+  createEqualText
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js
new file mode 100644
index 0000000..ccc3714
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesErf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createErf } from '../../factoriesNumber.js';
+export var erfDependencies = {
+  typedDependencies,
+  createErf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js
new file mode 100644
index 0000000..b843c1c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesEvaluate.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createEvaluate } from '../../factoriesNumber.js';
+export var evaluateDependencies = {
+  parseDependencies,
+  typedDependencies,
+  createEvaluate
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js
new file mode 100644
index 0000000..f1af13b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExp.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExp } from '../../factoriesNumber.js';
+export var expDependencies = {
+  typedDependencies,
+  createExp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js
new file mode 100644
index 0000000..5379c46
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesExpm1.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createExpm1 } from '../../factoriesNumber.js';
+export var expm1Dependencies = {
+  typedDependencies,
+  createExpm1
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js
new file mode 100644
index 0000000..9fe7608
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFactorial.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFactorial } from '../../factoriesNumber.js';
+export var factorialDependencies = {
+  gammaDependencies,
+  typedDependencies,
+  createFactorial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js
new file mode 100644
index 0000000..ba9c2d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFalse.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createFalse } from '../../factoriesNumber.js';
+export var falseDependencies = {
+  createFalse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js
new file mode 100644
index 0000000..365fbe3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilter.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilter } from '../../factoriesNumber.js';
+export var filterDependencies = {
+  typedDependencies,
+  createFilter
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
new file mode 100644
index 0000000..9195d5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFilterTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFilterTransform } from '../../factoriesNumber.js';
+export var filterTransformDependencies = {
+  typedDependencies,
+  createFilterTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js
new file mode 100644
index 0000000..b0599c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFix.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ceilDependencies } from './dependenciesCeil.generated.js';
+import { floorDependencies } from './dependenciesFloor.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFix } from '../../factoriesNumber.js';
+export var fixDependencies = {
+  ceilDependencies,
+  floorDependencies,
+  typedDependencies,
+  createFix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js
new file mode 100644
index 0000000..d0a65ab
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFloor.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { roundDependencies } from './dependenciesRound.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFloor } from '../../factoriesNumber.js';
+export var floorDependencies = {
+  roundDependencies,
+  typedDependencies,
+  createFloor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js
new file mode 100644
index 0000000..7bbdc94
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEach.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEach } from '../../factoriesNumber.js';
+export var forEachDependencies = {
+  typedDependencies,
+  createForEach
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
new file mode 100644
index 0000000..f300f41
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesForEachTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createForEachTransform } from '../../factoriesNumber.js';
+export var forEachTransformDependencies = {
+  typedDependencies,
+  createForEachTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js
new file mode 100644
index 0000000..7be7c47
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFormat.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFormat } from '../../factoriesNumber.js';
+export var formatDependencies = {
+  typedDependencies,
+  createFormat
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
new file mode 100644
index 0000000..fd579c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionAssignmentNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createFunctionAssignmentNode } from '../../factoriesNumber.js';
+export var FunctionAssignmentNodeDependencies = {
+  NodeDependencies,
+  typedDependencies,
+  createFunctionAssignmentNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
new file mode 100644
index 0000000..24ec5d6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesFunctionNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { createFunctionNode } from '../../factoriesNumber.js';
+export var FunctionNodeDependencies = {
+  NodeDependencies,
+  SymbolNodeDependencies,
+  createFunctionNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js
new file mode 100644
index 0000000..c380fe5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGamma.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGamma } from '../../factoriesNumber.js';
+export var gammaDependencies = {
+  typedDependencies,
+  createGamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js
new file mode 100644
index 0000000..47feec3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesGcd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createGcd } from '../../factoriesNumber.js';
+export var gcdDependencies = {
+  typedDependencies,
+  createGcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
new file mode 100644
index 0000000..d742528
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHasNumericValue.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHasNumericValue } from '../../factoriesNumber.js';
+export var hasNumericValueDependencies = {
+  isNumericDependencies,
+  typedDependencies,
+  createHasNumericValue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js
new file mode 100644
index 0000000..6afd037
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelp.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { HelpDependencies } from './dependenciesHelpClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHelp } from '../../factoriesNumber.js';
+export var helpDependencies = {
+  HelpDependencies,
+  typedDependencies,
+  createHelp
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js
new file mode 100644
index 0000000..79b6fa0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHelpClass.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { createHelpClass } from '../../factoriesNumber.js';
+export var HelpDependencies = {
+  evaluateDependencies,
+  createHelpClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js
new file mode 100644
index 0000000..fc777ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesHypot.generated.js
@@ -0,0 +1,24 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createHypot } from '../../factoriesNumber.js';
+export var hypotDependencies = {
+  absDependencies,
+  addScalarDependencies,
+  divideScalarDependencies,
+  isPositiveDependencies,
+  multiplyScalarDependencies,
+  smallerDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  createHypot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js
new file mode 100644
index 0000000..52f74db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndex.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createIndex } from '../../factoriesNumber.js';
+export var indexDependencies = {
+  createIndex
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js
new file mode 100644
index 0000000..2d83eb2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIndexNode.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { sizeDependencies } from './dependenciesSize.generated.js';
+import { createIndexNode } from '../../factoriesNumber.js';
+export var IndexNodeDependencies = {
+  NodeDependencies,
+  sizeDependencies,
+  createIndexNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js
new file mode 100644
index 0000000..9e44daf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesInfinity.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createInfinity } from '../../factoriesNumber.js';
+export var InfinityDependencies = {
+  createInfinity
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js
new file mode 100644
index 0000000..e00294f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsInteger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsInteger } from '../../factoriesNumber.js';
+export var isIntegerDependencies = {
+  typedDependencies,
+  createIsInteger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js
new file mode 100644
index 0000000..abb7251
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNaN.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNaN } from '../../factoriesNumber.js';
+export var isNaNDependencies = {
+  typedDependencies,
+  createIsNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js
new file mode 100644
index 0000000..853c1cb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNegative.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNegative } from '../../factoriesNumber.js';
+export var isNegativeDependencies = {
+  typedDependencies,
+  createIsNegative
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
new file mode 100644
index 0000000..92559b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsNumeric } from '../../factoriesNumber.js';
+export var isNumericDependencies = {
+  typedDependencies,
+  createIsNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js
new file mode 100644
index 0000000..f0364ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPositive.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPositive } from '../../factoriesNumber.js';
+export var isPositiveDependencies = {
+  typedDependencies,
+  createIsPositive
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js
new file mode 100644
index 0000000..6640f72
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsPrime.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsPrime } from '../../factoriesNumber.js';
+export var isPrimeDependencies = {
+  typedDependencies,
+  createIsPrime
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js
new file mode 100644
index 0000000..5421b80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesIsZero.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createIsZero } from '../../factoriesNumber.js';
+export var isZeroDependencies = {
+  typedDependencies,
+  createIsZero
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js
new file mode 100644
index 0000000..1400488
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN10.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLN10 } from '../../factoriesNumber.js';
+export var LN10Dependencies = {
+  createLN10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js
new file mode 100644
index 0000000..c2d6f69
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLN2.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLN2 } from '../../factoriesNumber.js';
+export var LN2Dependencies = {
+  createLN2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js
new file mode 100644
index 0000000..c2b3459
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG10E.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLOG10E } from '../../factoriesNumber.js';
+export var LOG10EDependencies = {
+  createLOG10E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js
new file mode 100644
index 0000000..f3160ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLOG2E.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createLOG2E } from '../../factoriesNumber.js';
+export var LOG2EDependencies = {
+  createLOG2E
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js
new file mode 100644
index 0000000..2f61473
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLarger.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLarger } from '../../factoriesNumber.js';
+export var largerDependencies = {
+  typedDependencies,
+  createLarger
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js
new file mode 100644
index 0000000..a4bb0d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLargerEq.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLargerEq } from '../../factoriesNumber.js';
+export var largerEqDependencies = {
+  typedDependencies,
+  createLargerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js
new file mode 100644
index 0000000..e4bd1f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLcm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLcm } from '../../factoriesNumber.js';
+export var lcmDependencies = {
+  typedDependencies,
+  createLcm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js
new file mode 100644
index 0000000..73200ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLeftShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLeftShift } from '../../factoriesNumber.js';
+export var leftShiftDependencies = {
+  typedDependencies,
+  createLeftShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLgamma.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLgamma.generated.js
new file mode 100644
index 0000000..6efa8be
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLgamma.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLgamma } from '../../factoriesNumber.js';
+export var lgammaDependencies = {
+  typedDependencies,
+  createLgamma
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js
new file mode 100644
index 0000000..cb01c2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog } from '../../factoriesNumber.js';
+export var logDependencies = {
+  typedDependencies,
+  createLog
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js
new file mode 100644
index 0000000..1fe8881
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog10.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog10 } from '../../factoriesNumber.js';
+export var log10Dependencies = {
+  typedDependencies,
+  createLog10
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js
new file mode 100644
index 0000000..ca3d2c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog1p.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog1p } from '../../factoriesNumber.js';
+export var log1pDependencies = {
+  typedDependencies,
+  createLog1p
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js
new file mode 100644
index 0000000..b05a6f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesLog2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createLog2 } from '../../factoriesNumber.js';
+export var log2Dependencies = {
+  typedDependencies,
+  createLog2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js
new file mode 100644
index 0000000..b0f4b23
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMad.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { absDependencies } from './dependenciesAbs.generated.js';
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { medianDependencies } from './dependenciesMedian.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMad } from '../../factoriesNumber.js';
+export var madDependencies = {
+  absDependencies,
+  mapDependencies,
+  medianDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createMad
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js
new file mode 100644
index 0000000..471b19e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMap.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMap } from '../../factoriesNumber.js';
+export var mapDependencies = {
+  typedDependencies,
+  createMap
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlices.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlices.generated.js
new file mode 100644
index 0000000..b3e8325
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlices.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapSlices } from '../../factoriesNumber.js';
+export var mapSlicesDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createMapSlices
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js
new file mode 100644
index 0000000..68e46db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapSlicesTransform.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapSlicesTransform } from '../../factoriesNumber.js';
+export var mapSlicesTransformDependencies = {
+  isIntegerDependencies,
+  typedDependencies,
+  createMapSlicesTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js
new file mode 100644
index 0000000..5164952
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMapTransform.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMapTransform } from '../../factoriesNumber.js';
+export var mapTransformDependencies = {
+  typedDependencies,
+  createMapTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js
new file mode 100644
index 0000000..243ce4d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMatrix.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createMatrix } from '../../factoriesNumber.js';
+export var matrixDependencies = {
+  createMatrix
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js
new file mode 100644
index 0000000..4dde0b0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMax.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMax } from '../../factoriesNumber.js';
+export var maxDependencies = {
+  isNaNDependencies,
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMax
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
new file mode 100644
index 0000000..98653ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMaxTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMaxTransform } from '../../factoriesNumber.js';
+export var maxTransformDependencies = {
+  isNaNDependencies,
+  largerDependencies,
+  numericDependencies,
+  typedDependencies,
+  createMaxTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js
new file mode 100644
index 0000000..b98f47c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMean.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMean } from '../../factoriesNumber.js';
+export var meanDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMean
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
new file mode 100644
index 0000000..303d649
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMeanTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMeanTransform } from '../../factoriesNumber.js';
+export var meanTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  typedDependencies,
+  createMeanTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js
new file mode 100644
index 0000000..901be99
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMedian.generated.js
@@ -0,0 +1,18 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMedian } from '../../factoriesNumber.js';
+export var medianDependencies = {
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  partitionSelectDependencies,
+  typedDependencies,
+  createMedian
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js
new file mode 100644
index 0000000..84f41b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMin.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMin } from '../../factoriesNumber.js';
+export var minDependencies = {
+  isNaNDependencies,
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js
new file mode 100644
index 0000000..5739c5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMinTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMinTransform } from '../../factoriesNumber.js';
+export var minTransformDependencies = {
+  isNaNDependencies,
+  numericDependencies,
+  smallerDependencies,
+  typedDependencies,
+  createMinTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js
new file mode 100644
index 0000000..05a3684
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMod.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMod } from '../../factoriesNumber.js';
+export var modDependencies = {
+  typedDependencies,
+  createMod
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js
new file mode 100644
index 0000000..536d896
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMode.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMode } from '../../factoriesNumber.js';
+export var modeDependencies = {
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createMode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js
new file mode 100644
index 0000000..58da7ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultinomial.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultinomial } from '../../factoriesNumber.js';
+export var multinomialDependencies = {
+  addDependencies,
+  divideDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isPositiveDependencies,
+  multiplyDependencies,
+  typedDependencies,
+  createMultinomial
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js
new file mode 100644
index 0000000..85e70b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiply.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiply } from '../../factoriesNumber.js';
+export var multiplyDependencies = {
+  typedDependencies,
+  createMultiply
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
new file mode 100644
index 0000000..9227ace
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesMultiplyScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createMultiplyScalar } from '../../factoriesNumber.js';
+export var multiplyScalarDependencies = {
+  typedDependencies,
+  createMultiplyScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js
new file mode 100644
index 0000000..f1d9672
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNaN.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNaN } from '../../factoriesNumber.js';
+export var NaNDependencies = {
+  createNaN
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js
new file mode 100644
index 0000000..65103e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNode.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNode } from '../../factoriesNumber.js';
+export var NodeDependencies = {
+  createNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js
new file mode 100644
index 0000000..c717d33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNorm.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNorm } from '../../factoriesNumber.js';
+export var normDependencies = {
+  typedDependencies,
+  createNorm
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js
new file mode 100644
index 0000000..7dd2bfb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNot } from '../../factoriesNumber.js';
+export var notDependencies = {
+  typedDependencies,
+  createNot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js
new file mode 100644
index 0000000..7ec9c5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNthRoot.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNthRoot } from '../../factoriesNumber.js';
+export var nthRootDependencies = {
+  typedDependencies,
+  createNthRoot
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js
new file mode 100644
index 0000000..4fa0bcb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNull.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createNull } from '../../factoriesNumber.js';
+export var nullDependencies = {
+  createNull
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js
new file mode 100644
index 0000000..c694992
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumber.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createNumber } from '../../factoriesNumber.js';
+export var numberDependencies = {
+  typedDependencies,
+  createNumber
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js
new file mode 100644
index 0000000..525b859
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesNumeric.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { createNumeric } from '../../factoriesNumber.js';
+export var numericDependencies = {
+  numberDependencies,
+  createNumeric
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js
new file mode 100644
index 0000000..4575c9e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesObjectNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createObjectNode } from '../../factoriesNumber.js';
+export var ObjectNodeDependencies = {
+  NodeDependencies,
+  createObjectNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
new file mode 100644
index 0000000..a694cce
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOperatorNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createOperatorNode } from '../../factoriesNumber.js';
+export var OperatorNodeDependencies = {
+  NodeDependencies,
+  createOperatorNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js
new file mode 100644
index 0000000..6c4cd33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesOr.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createOr } from '../../factoriesNumber.js';
+export var orDependencies = {
+  typedDependencies,
+  createOr
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
new file mode 100644
index 0000000..e21611e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParenthesisNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createParenthesisNode } from '../../factoriesNumber.js';
+export var ParenthesisNodeDependencies = {
+  NodeDependencies,
+  createParenthesisNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js
new file mode 100644
index 0000000..63c742e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParse.generated.js
@@ -0,0 +1,42 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { AssignmentNodeDependencies } from './dependenciesAssignmentNode.generated.js';
+import { BlockNodeDependencies } from './dependenciesBlockNode.generated.js';
+import { ConditionalNodeDependencies } from './dependenciesConditionalNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionAssignmentNodeDependencies } from './dependenciesFunctionAssignmentNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { RangeNodeDependencies } from './dependenciesRangeNode.generated.js';
+import { RelationalNodeDependencies } from './dependenciesRelationalNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParse } from '../../factoriesNumber.js';
+export var parseDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  AssignmentNodeDependencies,
+  BlockNodeDependencies,
+  ConditionalNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  RangeNodeDependencies,
+  RelationalNodeDependencies,
+  SymbolNodeDependencies,
+  numericDependencies,
+  typedDependencies,
+  createParse
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js
new file mode 100644
index 0000000..b7c3dba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParser.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ParserDependencies } from './dependenciesParserClass.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createParser } from '../../factoriesNumber.js';
+export var parserDependencies = {
+  ParserDependencies,
+  typedDependencies,
+  createParser
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js
new file mode 100644
index 0000000..d6810ba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesParserClass.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { evaluateDependencies } from './dependenciesEvaluate.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { createParserClass } from '../../factoriesNumber.js';
+export var ParserDependencies = {
+  evaluateDependencies,
+  parseDependencies,
+  createParserClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
new file mode 100644
index 0000000..87a18c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPartitionSelect.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { isNumericDependencies } from './dependenciesIsNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPartitionSelect } from '../../factoriesNumber.js';
+export var partitionSelectDependencies = {
+  compareDependencies,
+  isNaNDependencies,
+  isNumericDependencies,
+  typedDependencies,
+  createPartitionSelect
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js
new file mode 100644
index 0000000..319d5b7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPermutations.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPermutations } from '../../factoriesNumber.js';
+export var permutationsDependencies = {
+  factorialDependencies,
+  typedDependencies,
+  createPermutations
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js
new file mode 100644
index 0000000..085d93e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPhi.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createPhi } from '../../factoriesNumber.js';
+export var phiDependencies = {
+  createPhi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js
new file mode 100644
index 0000000..76ba1ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPi.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createPi } from '../../factoriesNumber.js';
+export var piDependencies = {
+  createPi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js
new file mode 100644
index 0000000..9d030e5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPickRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPickRandom } from '../../factoriesNumber.js';
+export var pickRandomDependencies = {
+  typedDependencies,
+  createPickRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js
new file mode 100644
index 0000000..afa55f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPow.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPow } from '../../factoriesNumber.js';
+export var powDependencies = {
+  typedDependencies,
+  createPow
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js
new file mode 100644
index 0000000..2c84688
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesPrint.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createPrint } from '../../factoriesNumber.js';
+export var printDependencies = {
+  typedDependencies,
+  createPrint
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js
new file mode 100644
index 0000000..c510314
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesProd.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createProd } from '../../factoriesNumber.js';
+export var prodDependencies = {
+  multiplyScalarDependencies,
+  numericDependencies,
+  typedDependencies,
+  createProd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
new file mode 100644
index 0000000..2a7eb95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesQuantileSeq.generated.js
@@ -0,0 +1,32 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { compareDependencies } from './dependenciesCompare.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { partitionSelectDependencies } from './dependenciesPartitionSelect.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createQuantileSeq } from '../../factoriesNumber.js';
+export var quantileSeqDependencies = {
+  addDependencies,
+  compareDependencies,
+  divideDependencies,
+  isIntegerDependencies,
+  largerDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  partitionSelectDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createQuantileSeq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js
new file mode 100644
index 0000000..604e834
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandom.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandom } from '../../factoriesNumber.js';
+export var randomDependencies = {
+  typedDependencies,
+  createRandom
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js
new file mode 100644
index 0000000..bd431ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRandomInt.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { log2Dependencies } from './dependenciesLog2.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRandomInt } from '../../factoriesNumber.js';
+export var randomIntDependencies = {
+  log2Dependencies,
+  typedDependencies,
+  createRandomInt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js
new file mode 100644
index 0000000..2378802
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRange.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRange } from '../../factoriesNumber.js';
+export var rangeDependencies = {
+  matrixDependencies,
+  addDependencies,
+  equalDependencies,
+  isPositiveDependencies,
+  isZeroDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRange
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js
new file mode 100644
index 0000000..51eb295
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeClass.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createRangeClass } from '../../factoriesNumber.js';
+export var RangeDependencies = {
+  createRangeClass
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js
new file mode 100644
index 0000000..78457e1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRangeNode } from '../../factoriesNumber.js';
+export var RangeNodeDependencies = {
+  NodeDependencies,
+  createRangeNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
new file mode 100644
index 0000000..47ba0f4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRangeTransform.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isPositiveDependencies } from './dependenciesIsPositive.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { largerEqDependencies } from './dependenciesLargerEq.generated.js';
+import { smallerDependencies } from './dependenciesSmaller.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRangeTransform } from '../../factoriesNumber.js';
+export var rangeTransformDependencies = {
+  matrixDependencies,
+  addDependencies,
+  equalDependencies,
+  isPositiveDependencies,
+  isZeroDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  typedDependencies,
+  createRangeTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js
new file mode 100644
index 0000000..1d0831a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRationalize.generated.js
@@ -0,0 +1,52 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { simplifyDependencies } from './dependenciesSimplify.generated.js';
+import { simplifyConstantDependencies } from './dependenciesSimplifyConstant.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRationalize } from '../../factoriesNumber.js';
+export var rationalizeDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  matrixDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  simplifyDependencies,
+  simplifyConstantDependencies,
+  simplifyCoreDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createRationalize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
new file mode 100644
index 0000000..b833c77
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRelationalNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createRelationalNode } from '../../factoriesNumber.js';
+export var RelationalNodeDependencies = {
+  NodeDependencies,
+  createRelationalNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js
new file mode 100644
index 0000000..93af6ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReplacer.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReplacer } from '../../factoriesNumber.js';
+export var replacerDependencies = {
+  createReplacer
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js
new file mode 100644
index 0000000..420973d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResolve.generated.js
@@ -0,0 +1,20 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createResolve } from '../../factoriesNumber.js';
+export var resolveDependencies = {
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  parseDependencies,
+  typedDependencies,
+  createResolve
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js
new file mode 100644
index 0000000..859c522
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesResultSet.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createResultSet } from '../../factoriesNumber.js';
+export var ResultSetDependencies = {
+  createResultSet
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js
new file mode 100644
index 0000000..00bc722
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesReviver.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createReviver } from '../../factoriesNumber.js';
+export var reviverDependencies = {
+  createReviver
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
new file mode 100644
index 0000000..335469c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightArithShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRightArithShift } from '../../factoriesNumber.js';
+export var rightArithShiftDependencies = {
+  typedDependencies,
+  createRightArithShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
new file mode 100644
index 0000000..e07b745
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRightLogShift.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRightLogShift } from '../../factoriesNumber.js';
+export var rightLogShiftDependencies = {
+  typedDependencies,
+  createRightLogShift
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js
new file mode 100644
index 0000000..6a77140
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesRound.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createRound } from '../../factoriesNumber.js';
+export var roundDependencies = {
+  typedDependencies,
+  createRound
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
new file mode 100644
index 0000000..38a4da2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT1_2.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSQRT1_2 } from '../../factoriesNumber.js'; // eslint-disable-line camelcase
+
+export var SQRT1_2Dependencies = {
+  // eslint-disable-line camelcase
+  createSQRT1_2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js
new file mode 100644
index 0000000..5898c96
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSQRT2.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSQRT2 } from '../../factoriesNumber.js';
+export var SQRT2Dependencies = {
+  createSQRT2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js
new file mode 100644
index 0000000..037c4d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSec.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSec } from '../../factoriesNumber.js';
+export var secDependencies = {
+  typedDependencies,
+  createSec
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js
new file mode 100644
index 0000000..b37d296
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSech.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSech } from '../../factoriesNumber.js';
+export var sechDependencies = {
+  typedDependencies,
+  createSech
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js
new file mode 100644
index 0000000..27bf617
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSign.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSign } from '../../factoriesNumber.js';
+export var signDependencies = {
+  typedDependencies,
+  createSign
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js
new file mode 100644
index 0000000..4ee4498
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplify.generated.js
@@ -0,0 +1,40 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { replacerDependencies } from './dependenciesReplacer.generated.js';
+import { resolveDependencies } from './dependenciesResolve.generated.js';
+import { simplifyConstantDependencies } from './dependenciesSimplifyConstant.generated.js';
+import { simplifyCoreDependencies } from './dependenciesSimplifyCore.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplify } from '../../factoriesNumber.js';
+export var simplifyDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  equalDependencies,
+  parseDependencies,
+  replacerDependencies,
+  resolveDependencies,
+  simplifyConstantDependencies,
+  simplifyCoreDependencies,
+  typedDependencies,
+  createSimplify
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js
new file mode 100644
index 0000000..ddd2810
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyConstant.generated.js
@@ -0,0 +1,28 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplifyConstant } from '../../factoriesNumber.js';
+export var simplifyConstantDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  SymbolNodeDependencies,
+  matrixDependencies,
+  typedDependencies,
+  createSimplifyConstant
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
new file mode 100644
index 0000000..19208d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSimplifyCore.generated.js
@@ -0,0 +1,44 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { AccessorNodeDependencies } from './dependenciesAccessorNode.generated.js';
+import { ArrayNodeDependencies } from './dependenciesArrayNode.generated.js';
+import { ConstantNodeDependencies } from './dependenciesConstantNode.generated.js';
+import { FunctionNodeDependencies } from './dependenciesFunctionNode.generated.js';
+import { IndexNodeDependencies } from './dependenciesIndexNode.generated.js';
+import { ObjectNodeDependencies } from './dependenciesObjectNode.generated.js';
+import { OperatorNodeDependencies } from './dependenciesOperatorNode.generated.js';
+import { ParenthesisNodeDependencies } from './dependenciesParenthesisNode.generated.js';
+import { SymbolNodeDependencies } from './dependenciesSymbolNode.generated.js';
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { isZeroDependencies } from './dependenciesIsZero.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { parseDependencies } from './dependenciesParse.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSimplifyCore } from '../../factoriesNumber.js';
+export var simplifyCoreDependencies = {
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  SymbolNodeDependencies,
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  isZeroDependencies,
+  multiplyDependencies,
+  parseDependencies,
+  powDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createSimplifyCore
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js
new file mode 100644
index 0000000..36e19f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSin.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSin } from '../../factoriesNumber.js';
+export var sinDependencies = {
+  typedDependencies,
+  createSin
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js
new file mode 100644
index 0000000..526371a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSinh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSinh } from '../../factoriesNumber.js';
+export var sinhDependencies = {
+  typedDependencies,
+  createSinh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js
new file mode 100644
index 0000000..7bf5f8c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSize.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { matrixDependencies } from './dependenciesMatrix.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSize } from '../../factoriesNumber.js';
+export var sizeDependencies = {
+  matrixDependencies,
+  typedDependencies,
+  createSize
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js
new file mode 100644
index 0000000..c1a70ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmaller.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmaller } from '../../factoriesNumber.js';
+export var smallerDependencies = {
+  typedDependencies,
+  createSmaller
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
new file mode 100644
index 0000000..8cea526
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSmallerEq.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSmallerEq } from '../../factoriesNumber.js';
+export var smallerEqDependencies = {
+  typedDependencies,
+  createSmallerEq
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js
new file mode 100644
index 0000000..4da7267
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSqrt.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSqrt } from '../../factoriesNumber.js';
+export var sqrtDependencies = {
+  typedDependencies,
+  createSqrt
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js
new file mode 100644
index 0000000..71799ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSquare.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSquare } from '../../factoriesNumber.js';
+export var squareDependencies = {
+  typedDependencies,
+  createSquare
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js
new file mode 100644
index 0000000..b279cf6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStd.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStd } from '../../factoriesNumber.js';
+export var stdDependencies = {
+  mapDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js
new file mode 100644
index 0000000..4d7be6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStdTransform.generated.js
@@ -0,0 +1,16 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { mapDependencies } from './dependenciesMap.generated.js';
+import { sqrtDependencies } from './dependenciesSqrt.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { varianceDependencies } from './dependenciesVariance.generated.js';
+import { createStdTransform } from '../../factoriesNumber.js';
+export var stdTransformDependencies = {
+  mapDependencies,
+  sqrtDependencies,
+  typedDependencies,
+  varianceDependencies,
+  createStdTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
new file mode 100644
index 0000000..0c958b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesStirlingS2.generated.js
@@ -0,0 +1,32 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addScalarDependencies } from './dependenciesAddScalar.generated.js';
+import { combinationsDependencies } from './dependenciesCombinations.generated.js';
+import { divideScalarDependencies } from './dependenciesDivideScalar.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { isIntegerDependencies } from './dependenciesIsInteger.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { largerDependencies } from './dependenciesLarger.generated.js';
+import { multiplyScalarDependencies } from './dependenciesMultiplyScalar.generated.js';
+import { numberDependencies } from './dependenciesNumber.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { subtractScalarDependencies } from './dependenciesSubtractScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createStirlingS2 } from '../../factoriesNumber.js';
+export var stirlingS2Dependencies = {
+  addScalarDependencies,
+  combinationsDependencies,
+  divideScalarDependencies,
+  factorialDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  largerDependencies,
+  multiplyScalarDependencies,
+  numberDependencies,
+  powDependencies,
+  subtractScalarDependencies,
+  typedDependencies,
+  createStirlingS2
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js
new file mode 100644
index 0000000..57db84e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesString.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createString } from '../../factoriesNumber.js';
+export var stringDependencies = {
+  typedDependencies,
+  createString
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js
new file mode 100644
index 0000000..668726f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubset.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSubset } from '../../factoriesNumber.js';
+export var subsetDependencies = {
+  createSubset
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
new file mode 100644
index 0000000..6a3251a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubsetTransform.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createSubsetTransform } from '../../factoriesNumber.js';
+export var subsetTransformDependencies = {
+  createSubsetTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js
new file mode 100644
index 0000000..3f3e157
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtract.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubtract } from '../../factoriesNumber.js';
+export var subtractDependencies = {
+  typedDependencies,
+  createSubtract
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js
new file mode 100644
index 0000000..7f69b07
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSubtractScalar.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSubtractScalar } from '../../factoriesNumber.js';
+export var subtractScalarDependencies = {
+  typedDependencies,
+  createSubtractScalar
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js
new file mode 100644
index 0000000..9aa4cf5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSum.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSum } from '../../factoriesNumber.js';
+export var sumDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSum
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js
new file mode 100644
index 0000000..19b997f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSumTransform.generated.js
@@ -0,0 +1,14 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { numericDependencies } from './dependenciesNumeric.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createSumTransform } from '../../factoriesNumber.js';
+export var sumTransformDependencies = {
+  addDependencies,
+  numericDependencies,
+  typedDependencies,
+  createSumTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
new file mode 100644
index 0000000..aca084a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesSymbolNode.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { NodeDependencies } from './dependenciesNode.generated.js';
+import { createSymbolNode } from '../../factoriesNumber.js';
+export var SymbolNodeDependencies = {
+  NodeDependencies,
+  createSymbolNode
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js
new file mode 100644
index 0000000..cf31167
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTan.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTan } from '../../factoriesNumber.js';
+export var tanDependencies = {
+  typedDependencies,
+  createTan
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js
new file mode 100644
index 0000000..701f718
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTanh.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTanh } from '../../factoriesNumber.js';
+export var tanhDependencies = {
+  typedDependencies,
+  createTanh
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js
new file mode 100644
index 0000000..ca81ba7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTau.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTau } from '../../factoriesNumber.js';
+export var tauDependencies = {
+  createTau
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js
new file mode 100644
index 0000000..c29345a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTrue.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTrue } from '../../factoriesNumber.js';
+export var trueDependencies = {
+  createTrue
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js
new file mode 100644
index 0000000..dd137bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTypeOf.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createTypeOf } from '../../factoriesNumber.js';
+export var typeOfDependencies = {
+  typedDependencies,
+  createTypeOf
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js
new file mode 100644
index 0000000..2daf5ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesTyped.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createTyped } from '../../factoriesNumber.js';
+export var typedDependencies = {
+  createTyped
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
new file mode 100644
index 0000000..a7a3254
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryMinus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryMinus } from '../../factoriesNumber.js';
+export var unaryMinusDependencies = {
+  typedDependencies,
+  createUnaryMinus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
new file mode 100644
index 0000000..dd0851d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnaryPlus.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnaryPlus } from '../../factoriesNumber.js';
+export var unaryPlusDependencies = {
+  typedDependencies,
+  createUnaryPlus
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js
new file mode 100644
index 0000000..cff54df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUnequal.generated.js
@@ -0,0 +1,12 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { equalScalarDependencies } from './dependenciesEqualScalar.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createUnequal } from '../../factoriesNumber.js';
+export var unequalDependencies = {
+  equalScalarDependencies,
+  typedDependencies,
+  createUnequal
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
new file mode 100644
index 0000000..152876b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercaseE.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { eDependencies } from './dependenciesE.generated.js';
+import { createUppercaseE } from '../../factoriesNumber.js';
+export var EDependencies = {
+  eDependencies,
+  createUppercaseE
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
new file mode 100644
index 0000000..02189a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesUppercasePi.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { piDependencies } from './dependenciesPi.generated.js';
+import { createUppercasePi } from '../../factoriesNumber.js';
+export var PIDependencies = {
+  piDependencies,
+  createUppercasePi
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js
new file mode 100644
index 0000000..0820e1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVariance.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVariance } from '../../factoriesNumber.js';
+export var varianceDependencies = {
+  addDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVariance
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
new file mode 100644
index 0000000..dbfe7a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVarianceTransform.generated.js
@@ -0,0 +1,22 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { isNaNDependencies } from './dependenciesIsNaN.generated.js';
+import { mapSlicesDependencies } from './dependenciesMapSlices.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createVarianceTransform } from '../../factoriesNumber.js';
+export var varianceTransformDependencies = {
+  addDependencies,
+  divideDependencies,
+  isNaNDependencies,
+  mapSlicesDependencies,
+  multiplyDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createVarianceTransform
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js
new file mode 100644
index 0000000..c16c379
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesVersion.generated.js
@@ -0,0 +1,8 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { createVersion } from '../../factoriesNumber.js';
+export var versionDependencies = {
+  createVersion
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js
new file mode 100644
index 0000000..749e8e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXgcd.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXgcd } from '../../factoriesNumber.js';
+export var xgcdDependencies = {
+  typedDependencies,
+  createXgcd
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js
new file mode 100644
index 0000000..192daf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesXor.generated.js
@@ -0,0 +1,10 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createXor } from '../../factoriesNumber.js';
+export var xorDependencies = {
+  typedDependencies,
+  createXor
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesZeta.generated.js b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesZeta.generated.js
new file mode 100644
index 0000000..02d3083
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/dependenciesNumber/dependenciesZeta.generated.js
@@ -0,0 +1,34 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { addDependencies } from './dependenciesAdd.generated.js';
+import { divideDependencies } from './dependenciesDivide.generated.js';
+import { equalDependencies } from './dependenciesEqual.generated.js';
+import { factorialDependencies } from './dependenciesFactorial.generated.js';
+import { gammaDependencies } from './dependenciesGamma.generated.js';
+import { isNegativeDependencies } from './dependenciesIsNegative.generated.js';
+import { multiplyDependencies } from './dependenciesMultiply.generated.js';
+import { piDependencies } from './dependenciesPi.generated.js';
+import { powDependencies } from './dependenciesPow.generated.js';
+import { sinDependencies } from './dependenciesSin.generated.js';
+import { smallerEqDependencies } from './dependenciesSmallerEq.generated.js';
+import { subtractDependencies } from './dependenciesSubtract.generated.js';
+import { typedDependencies } from './dependenciesTyped.generated.js';
+import { createZeta } from '../../factoriesNumber.js';
+export var zetaDependencies = {
+  addDependencies,
+  divideDependencies,
+  equalDependencies,
+  factorialDependencies,
+  gammaDependencies,
+  isNegativeDependencies,
+  multiplyDependencies,
+  piDependencies,
+  powDependencies,
+  sinDependencies,
+  smallerEqDependencies,
+  subtractDependencies,
+  typedDependencies,
+  createZeta
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js b/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js
new file mode 100644
index 0000000..bf90bde
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/impureFunctionsAny.generated.js
@@ -0,0 +1,757 @@
+import _extends from "@babel/runtime/helpers/extends";
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createNode, createObjectNode, createOperatorNode, createParenthesisNode, createRelationalNode, createArrayNode, createBlockNode, createConditionalNode, createConstantNode, createRangeNode, createReviver, createChainClass, createFunctionAssignmentNode, createChain, createAccessorNode, createAssignmentNode, createIndexNode, createSymbolNode, createFunctionNode, createParse, createResolve, createSimplifyConstant, createCompile, createSimplifyCore, createEvaluate, createHelpClass, createParserClass, createSimplify, createSymbolicEqual, createLeafCount, createParser, createRationalize, createDerivative, createHelp, createMapSlicesTransform, createFilterTransform, createForEachTransform, createMapTransform, createOrTransform, createAndTransform, createConcatTransform, createIndexTransform, createPrintTransform, createSumTransform, createBitAndTransform, createMinTransform, createNullishTransform, createSubsetTransform, createBitOrTransform, createCumSumTransform, createDiffTransform, createMaxTransform, createRangeTransform, createRowTransform, createColumnTransform, createMeanTransform, createQuantileSeqTransform, createVarianceTransform, createStdTransform } from '../factoriesAny.js';
+import { BigNumber, Complex, e, _false, fineStructure, Fraction, i, _Infinity, LN10, LOG10E, Matrix, _NaN, _null, phi, Range, ResultSet, SQRT1_2,
+// eslint-disable-line camelcase
+sackurTetrode, tau, _true, version, DenseMatrix, efimovFactor, LN2, pi, replacer, SQRT2, typed, weakMixingAngle, abs, acos, acot, acsc, addScalar, arg, asech, asinh, atan, atanh, bigint, bitNot, boolean, clone, combinations, complex, conj, cos, cot, csc, cube, equalScalar, erf, exp, expm1, filter, flatten, forEach, format, getMatrixDataType, hex, im, isInteger, isNegative, isPositive, isZero, LOG2E, lgamma, log10, log2, map, multiplyScalar, not, number, oct, pickRandom, print, random, re, sec, sign, sin, SparseMatrix, splitUnit, square, string, subtractScalar, tan, toBest, typeOf, acosh, acsch, asec, bignumber, combinationsWithRep, cosh, csch, isNaN, isPrime, mapSlices, matrix, matrixFromFunction, ones, randomInt, reshape, sech, sinh, sparse, sqrt, squeeze, tanh, transpose, xgcd, zeros, acoth, asin, bin, concat, coth, ctranspose, diag, dotMultiply, equal, fraction, identity, isNumeric, kron, largerEq, leftShift, mode, nthRoot, numeric, prod, resize, rightArithShift, round, size, smaller, to, unaryMinus, unequal, xor, add, atan2, bitAnd, bitOr, bitXor, cbrt, compare, compareText, count, deepEqual, divideScalar, dotDivide, equalText, floor, gcd, hasNumericValue, hypot, ImmutableDenseMatrix, Index, larger, log, lsolve, matrixFromColumns, max, min, mod, nthRoots, nullish, or, partitionSelect, qr, rightLogShift, smallerEq, subset, subtract, trace, usolve, catalan, compareNatural, composition, diff, distance, dot, FibonacciHeap, index, invmod, lcm, log1p, lsolveAll, matrixFromRows, multiply, range, row, setCartesian, setDistinct, setIsSubset, setPowerset, slu, sort, unaryPlus, usolveAll, zpk2tf, and, ceil, column, cross, det, fix, inv, pinv, pow, setDifference, setMultiplicity, setSymDifference, Spa, sqrtm, sum, Unit, vacuumImpedance, wienDisplacement, atomicMass, bohrMagneton, boltzmann, conductanceQuantum, coulomb, createUnit, deuteronMass, dotPow, electricConstant, elementaryCharge, expm, faraday, fft, gamma, gravitationConstant, hartreeEnergy, ifft, inverseConductanceQuantum, klitzing, loschmidt, magneticConstant, molarMass, molarPlanckConstant, neutronMass, nuclearMagneton, planckCharge, planckLength, planckTemperature, protonMass, quantumOfCirculation, reducedPlanckConstant, rydberg, secondRadiation, setSize, speedOfLight, stefanBoltzmann, thomsonCrossSection, avogadro, bohrRadius, coulombConstant, divide, electronMass, factorial, firstRadiation, gravity, intersect, lup, magneticFluxQuantum, molarMassC12, multinomial, permutations, planckMass, polynomialRoot, setIntersect, solveODE, stirlingS2, unit, bellNumbers, cumsum, eigs, fermiCoupling, gasConstant, kldivergence, lusolve, mean, molarVolume, planckConstant, quantileSeq, setUnion, variance, classicalElectronRadius, median, corr, freqz, mad, std, zeta, norm, rotationMatrix, planckTime, schur, rotate, sylvester, lyap } from './pureFunctionsAny.generated.js';
+var math = {}; // NOT pure!
+var mathWithTransform = {}; // NOT pure!
+var classes = {}; // NOT pure!
+
+export var Node = createNode({
+  mathWithTransform
+});
+export var ObjectNode = createObjectNode({
+  Node
+});
+export var OperatorNode = createOperatorNode({
+  Node
+});
+export var ParenthesisNode = createParenthesisNode({
+  Node
+});
+export var RelationalNode = createRelationalNode({
+  Node
+});
+export var ArrayNode = createArrayNode({
+  Node
+});
+export var BlockNode = createBlockNode({
+  Node,
+  ResultSet
+});
+export var ConditionalNode = createConditionalNode({
+  Node
+});
+export var ConstantNode = createConstantNode({
+  Node
+});
+export var RangeNode = createRangeNode({
+  Node
+});
+export var reviver = createReviver({
+  classes
+});
+export var Chain = createChainClass({
+  math,
+  typed
+});
+export var FunctionAssignmentNode = createFunctionAssignmentNode({
+  Node,
+  typed
+});
+export var chain = createChain({
+  Chain,
+  typed
+});
+export var AccessorNode = createAccessorNode({
+  Node,
+  subset
+});
+export var AssignmentNode = createAssignmentNode({
+  matrix,
+  Node,
+  subset
+});
+export var IndexNode = createIndexNode({
+  Node,
+  size
+});
+export var SymbolNode = createSymbolNode({
+  Unit,
+  Node,
+  math
+});
+export var FunctionNode = createFunctionNode({
+  Node,
+  SymbolNode,
+  math
+});
+export var parse = createParse({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config,
+  numeric,
+  typed
+});
+export var resolve = createResolve({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse,
+  typed
+});
+export var simplifyConstant = createSimplifyConstant({
+  bignumber,
+  fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  SymbolNode,
+  config,
+  mathWithTransform,
+  matrix,
+  typed
+});
+export var compile = createCompile({
+  parse,
+  typed
+});
+export var simplifyCore = createSimplifyCore({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  divide,
+  equal,
+  isZero,
+  multiply,
+  parse,
+  pow,
+  subtract,
+  typed
+});
+export var evaluate = createEvaluate({
+  parse,
+  typed
+});
+export var Help = createHelpClass({
+  evaluate
+});
+export var Parser = createParserClass({
+  evaluate,
+  parse
+});
+export var simplify = createSimplify({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  equal,
+  parse,
+  replacer,
+  resolve,
+  simplifyConstant,
+  simplifyCore,
+  typed
+});
+export var symbolicEqual = createSymbolicEqual({
+  OperatorNode,
+  parse,
+  simplify,
+  typed
+});
+export var leafCount = createLeafCount({
+  parse,
+  typed
+});
+export var parser = createParser({
+  Parser,
+  typed
+});
+export var rationalize = createRationalize({
+  bignumber,
+  fraction,
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  simplify,
+  simplifyConstant,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var derivative = createDerivative({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config,
+  equal,
+  isZero,
+  numeric,
+  parse,
+  simplify,
+  typed
+});
+export var help = createHelp({
+  Help,
+  mathWithTransform,
+  typed
+});
+_extends(math, {
+  e,
+  false: _false,
+  fineStructure,
+  i,
+  Infinity: _Infinity,
+  LN10,
+  LOG10E,
+  NaN: _NaN,
+  null: _null,
+  phi,
+  SQRT1_2,
+  sackurTetrode,
+  tau,
+  true: _true,
+  'E': e,
+  version,
+  efimovFactor,
+  LN2,
+  pi,
+  replacer,
+  reviver,
+  SQRT2,
+  typed,
+  'PI': pi,
+  weakMixingAngle,
+  abs,
+  acos,
+  acot,
+  acsc,
+  addScalar,
+  arg,
+  asech,
+  asinh,
+  atan,
+  atanh,
+  bigint,
+  bitNot,
+  boolean,
+  clone,
+  combinations,
+  complex,
+  conj,
+  cos,
+  cot,
+  csc,
+  cube,
+  equalScalar,
+  erf,
+  exp,
+  expm1,
+  filter,
+  flatten,
+  forEach,
+  format,
+  getMatrixDataType,
+  hex,
+  im,
+  isInteger,
+  isNegative,
+  isPositive,
+  isZero,
+  LOG2E,
+  lgamma,
+  log10,
+  log2,
+  map,
+  multiplyScalar,
+  not,
+  number,
+  oct,
+  pickRandom,
+  print,
+  random,
+  re,
+  sec,
+  sign,
+  sin,
+  splitUnit,
+  square,
+  string,
+  subtractScalar,
+  tan,
+  toBest,
+  typeOf,
+  acosh,
+  acsch,
+  asec,
+  bignumber,
+  chain,
+  combinationsWithRep,
+  cosh,
+  csch,
+  isNaN,
+  isPrime,
+  mapSlices,
+  matrix,
+  matrixFromFunction,
+  ones,
+  randomInt,
+  reshape,
+  sech,
+  sinh,
+  sparse,
+  sqrt,
+  squeeze,
+  tanh,
+  transpose,
+  xgcd,
+  zeros,
+  acoth,
+  asin,
+  bin,
+  concat,
+  coth,
+  ctranspose,
+  diag,
+  dotMultiply,
+  equal,
+  fraction,
+  identity,
+  isNumeric,
+  kron,
+  largerEq,
+  leftShift,
+  mode,
+  nthRoot,
+  numeric,
+  prod,
+  resize,
+  rightArithShift,
+  round,
+  size,
+  smaller,
+  to,
+  unaryMinus,
+  unequal,
+  xor,
+  add,
+  atan2,
+  bitAnd,
+  bitOr,
+  bitXor,
+  cbrt,
+  compare,
+  compareText,
+  count,
+  deepEqual,
+  divideScalar,
+  dotDivide,
+  equalText,
+  floor,
+  gcd,
+  hasNumericValue,
+  hypot,
+  larger,
+  log,
+  lsolve,
+  matrixFromColumns,
+  max,
+  min,
+  mod,
+  nthRoots,
+  nullish,
+  or,
+  partitionSelect,
+  qr,
+  rightLogShift,
+  smallerEq,
+  subset,
+  subtract,
+  trace,
+  usolve,
+  catalan,
+  compareNatural,
+  composition,
+  diff,
+  distance,
+  dot,
+  index,
+  invmod,
+  lcm,
+  log1p,
+  lsolveAll,
+  matrixFromRows,
+  multiply,
+  range,
+  row,
+  setCartesian,
+  setDistinct,
+  setIsSubset,
+  setPowerset,
+  slu,
+  sort,
+  unaryPlus,
+  usolveAll,
+  zpk2tf,
+  and,
+  ceil,
+  column,
+  cross,
+  det,
+  fix,
+  inv,
+  pinv,
+  pow,
+  setDifference,
+  setMultiplicity,
+  setSymDifference,
+  sqrtm,
+  sum,
+  vacuumImpedance,
+  wienDisplacement,
+  atomicMass,
+  bohrMagneton,
+  boltzmann,
+  conductanceQuantum,
+  coulomb,
+  createUnit,
+  deuteronMass,
+  dotPow,
+  electricConstant,
+  elementaryCharge,
+  expm,
+  faraday,
+  fft,
+  gamma,
+  gravitationConstant,
+  hartreeEnergy,
+  ifft,
+  inverseConductanceQuantum,
+  klitzing,
+  loschmidt,
+  magneticConstant,
+  molarMass,
+  molarPlanckConstant,
+  neutronMass,
+  nuclearMagneton,
+  planckCharge,
+  planckLength,
+  planckTemperature,
+  protonMass,
+  quantumOfCirculation,
+  reducedPlanckConstant,
+  rydberg,
+  secondRadiation,
+  setSize,
+  speedOfLight,
+  stefanBoltzmann,
+  thomsonCrossSection,
+  avogadro,
+  bohrRadius,
+  coulombConstant,
+  divide,
+  electronMass,
+  factorial,
+  firstRadiation,
+  gravity,
+  intersect,
+  lup,
+  magneticFluxQuantum,
+  molarMassC12,
+  multinomial,
+  parse,
+  permutations,
+  planckMass,
+  polynomialRoot,
+  resolve,
+  setIntersect,
+  simplifyConstant,
+  solveODE,
+  stirlingS2,
+  unit,
+  bellNumbers,
+  compile,
+  cumsum,
+  eigs,
+  fermiCoupling,
+  gasConstant,
+  kldivergence,
+  lusolve,
+  mean,
+  molarVolume,
+  planckConstant,
+  quantileSeq,
+  setUnion,
+  simplifyCore,
+  variance,
+  classicalElectronRadius,
+  evaluate,
+  median,
+  simplify,
+  symbolicEqual,
+  corr,
+  freqz,
+  leafCount,
+  mad,
+  parser,
+  rationalize,
+  std,
+  zeta,
+  derivative,
+  norm,
+  rotationMatrix,
+  help,
+  planckTime,
+  schur,
+  rotate,
+  sylvester,
+  lyap,
+  config
+});
+_extends(mathWithTransform, math, {
+  mapSlices: createMapSlicesTransform({
+    isInteger,
+    typed
+  }),
+  filter: createFilterTransform({
+    typed
+  }),
+  forEach: createForEachTransform({
+    typed
+  }),
+  map: createMapTransform({
+    typed
+  }),
+  or: createOrTransform({
+    DenseMatrix,
+    concat,
+    equalScalar,
+    matrix,
+    typed
+  }),
+  and: createAndTransform({
+    add,
+    concat,
+    equalScalar,
+    matrix,
+    not,
+    typed,
+    zeros
+  }),
+  concat: createConcatTransform({
+    isInteger,
+    matrix,
+    typed
+  }),
+  index: createIndexTransform({
+    Index,
+    getMatrixDataType
+  }),
+  print: createPrintTransform({
+    add,
+    matrix,
+    typed,
+    zeros
+  }),
+  sum: createSumTransform({
+    add,
+    config,
+    numeric,
+    typed
+  }),
+  bitAnd: createBitAndTransform({
+    add,
+    concat,
+    equalScalar,
+    matrix,
+    not,
+    typed,
+    zeros
+  }),
+  min: createMinTransform({
+    config,
+    isNaN,
+    numeric,
+    smaller,
+    typed
+  }),
+  nullish: createNullishTransform({
+    deepEqual,
+    flatten,
+    matrix,
+    size,
+    typed
+  }),
+  subset: createSubsetTransform({
+    add,
+    matrix,
+    typed,
+    zeros
+  }),
+  bitOr: createBitOrTransform({
+    DenseMatrix,
+    concat,
+    equalScalar,
+    matrix,
+    typed
+  }),
+  cumsum: createCumSumTransform({
+    add,
+    typed,
+    unaryPlus
+  }),
+  diff: createDiffTransform({
+    bignumber,
+    matrix,
+    number,
+    subtract,
+    typed
+  }),
+  max: createMaxTransform({
+    config,
+    isNaN,
+    larger,
+    numeric,
+    typed
+  }),
+  range: createRangeTransform({
+    bignumber,
+    matrix,
+    add,
+    config,
+    equal,
+    isPositive,
+    isZero,
+    larger,
+    largerEq,
+    smaller,
+    smallerEq,
+    typed
+  }),
+  row: createRowTransform({
+    Index,
+    matrix,
+    range,
+    typed
+  }),
+  column: createColumnTransform({
+    Index,
+    matrix,
+    range,
+    typed
+  }),
+  mean: createMeanTransform({
+    add,
+    divide,
+    typed
+  }),
+  quantileSeq: createQuantileSeqTransform({
+    add,
+    bignumber,
+    compare,
+    divide,
+    isInteger,
+    larger,
+    mapSlices,
+    multiply,
+    partitionSelect,
+    smaller,
+    smallerEq,
+    subtract,
+    typed
+  }),
+  variance: createVarianceTransform({
+    add,
+    divide,
+    isNaN,
+    mapSlices,
+    multiply,
+    subtract,
+    typed
+  }),
+  std: createStdTransform({
+    map,
+    sqrt,
+    typed,
+    variance
+  })
+});
+_extends(classes, {
+  BigNumber,
+  Complex,
+  Fraction,
+  Matrix,
+  Node,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  Range,
+  RelationalNode,
+  ResultSet,
+  ArrayNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  DenseMatrix,
+  RangeNode,
+  Chain,
+  FunctionAssignmentNode,
+  SparseMatrix,
+  ImmutableDenseMatrix,
+  Index,
+  AccessorNode,
+  AssignmentNode,
+  FibonacciHeap,
+  IndexNode,
+  Spa,
+  Unit,
+  SymbolNode,
+  FunctionNode,
+  Help,
+  Parser
+});
+Chain.createProxy(math);
+export { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js b/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js
new file mode 100644
index 0000000..624ac09
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/impureFunctionsNumber.generated.js
@@ -0,0 +1,499 @@
+import _extends from "@babel/runtime/helpers/extends";
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createChainClass, createNode, createObjectNode, createRangeNode, createRelationalNode, createReviver, createSymbolNode, createAccessorNode, createAssignmentNode, createBlockNode, createChain, createConditionalNode, createFunctionNode, createIndexNode, createOperatorNode, createArrayNode, createConstantNode, createFunctionAssignmentNode, createParenthesisNode, createSimplifyConstant, createParse, createResolve, createSimplifyCore, createCompile, createEvaluate, createHelpClass, createParserClass, createSimplify, createDerivative, createRationalize, createHelp, createParser, createCumSumTransform, createMapSlicesTransform, createFilterTransform, createForEachTransform, createMeanTransform, createSubsetTransform, createMapTransform, createRangeTransform, createStdTransform, createSumTransform, createMaxTransform, createMinTransform, createVarianceTransform } from '../factoriesNumber.js';
+import { e, _false, index, _Infinity, LN10, LOG10E, matrix, _NaN, _null, phi, Range, replacer, ResultSet, SQRT1_2,
+// eslint-disable-line camelcase
+subset, tau, typed, unaryPlus, version, xor, abs, acos, acot, acsc, add, and, asec, asin, atan, atanh, bigint, bitNot, bitXor, boolean, cbrt, combinations, compare, compareText, cos, cot, csc, cube, divide, equalScalar, erf, exp, filter, forEach, format, gamma, isInteger, isNegative, isPositive, isZero, LOG2E, largerEq, leftShift, log, log1p, map, mean, mod, multiply, not, number, or, pi, pow, random, rightLogShift, SQRT2, sech, sin, size, smallerEq, square, string, subtract, tanh, typeOf, unequal, xgcd, acoth, addScalar, asech, bitAnd, combinationsWithRep, cosh, csch, divideScalar, equalText, expm1, isNumeric, LN2, lcm, log10, mapSlices, multiplyScalar, nthRoot, pickRandom, rightArithShift, sec, sinh, sqrt, tan, unaryMinus, acosh, atan2, bitOr, clone, coth, equal, factorial, hasNumericValue, isNaN, larger, log2, mode, norm, partitionSelect, print, randomInt, round, smaller, subtractScalar, _true, variance, zeta, acsch, catalan, compareNatural, composition, cumsum, floor, hypot, lgamma, median, multinomial, permutations, quantileSeq, sign, std, stirlingS2, asinh, ceil, deepEqual, fix, isPrime, numeric, prod, bellNumbers, gcd, mad, range, sum, corr, max, min } from './pureFunctionsNumber.generated.js';
+var math = {}; // NOT pure!
+var mathWithTransform = {}; // NOT pure!
+var classes = {}; // NOT pure!
+
+export var Chain = createChainClass({
+  math,
+  typed
+});
+export var Node = createNode({
+  mathWithTransform
+});
+export var ObjectNode = createObjectNode({
+  Node
+});
+export var RangeNode = createRangeNode({
+  Node
+});
+export var RelationalNode = createRelationalNode({
+  Node
+});
+export var reviver = createReviver({
+  classes
+});
+export var SymbolNode = createSymbolNode({
+  Node,
+  math
+});
+export var AccessorNode = createAccessorNode({
+  Node,
+  subset
+});
+export var AssignmentNode = createAssignmentNode({
+  matrix,
+  Node,
+  subset
+});
+export var BlockNode = createBlockNode({
+  Node,
+  ResultSet
+});
+export var chain = createChain({
+  Chain,
+  typed
+});
+export var ConditionalNode = createConditionalNode({
+  Node
+});
+export var FunctionNode = createFunctionNode({
+  Node,
+  SymbolNode,
+  math
+});
+export var IndexNode = createIndexNode({
+  Node,
+  size
+});
+export var OperatorNode = createOperatorNode({
+  Node
+});
+export var ArrayNode = createArrayNode({
+  Node
+});
+export var ConstantNode = createConstantNode({
+  Node
+});
+export var FunctionAssignmentNode = createFunctionAssignmentNode({
+  Node,
+  typed
+});
+export var ParenthesisNode = createParenthesisNode({
+  Node
+});
+export var simplifyConstant = createSimplifyConstant({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  SymbolNode,
+  config,
+  mathWithTransform,
+  matrix,
+  typed
+});
+export var parse = createParse({
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  config,
+  numeric,
+  typed
+});
+export var resolve = createResolve({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  parse,
+  typed
+});
+export var simplifyCore = createSimplifyCore({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  divide,
+  equal,
+  isZero,
+  multiply,
+  parse,
+  pow,
+  subtract,
+  typed
+});
+export var compile = createCompile({
+  parse,
+  typed
+});
+export var evaluate = createEvaluate({
+  parse,
+  typed
+});
+export var Help = createHelpClass({
+  evaluate
+});
+export var Parser = createParserClass({
+  evaluate,
+  parse
+});
+export var simplify = createSimplify({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  equal,
+  parse,
+  replacer,
+  resolve,
+  simplifyConstant,
+  simplifyCore,
+  typed
+});
+export var derivative = createDerivative({
+  ConstantNode,
+  FunctionNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  config,
+  equal,
+  isZero,
+  numeric,
+  parse,
+  simplify,
+  typed
+});
+export var rationalize = createRationalize({
+  AccessorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  SymbolNode,
+  add,
+  config,
+  divide,
+  equal,
+  isZero,
+  mathWithTransform,
+  matrix,
+  multiply,
+  parse,
+  pow,
+  simplify,
+  simplifyConstant,
+  simplifyCore,
+  subtract,
+  typed
+});
+export var help = createHelp({
+  Help,
+  mathWithTransform,
+  typed
+});
+export var parser = createParser({
+  Parser,
+  typed
+});
+_extends(math, {
+  e,
+  false: _false,
+  index,
+  Infinity: _Infinity,
+  LN10,
+  LOG10E,
+  matrix,
+  NaN: _NaN,
+  null: _null,
+  phi,
+  replacer,
+  SQRT1_2,
+  subset,
+  tau,
+  typed,
+  unaryPlus,
+  'E': e,
+  version,
+  xor,
+  abs,
+  acos,
+  acot,
+  acsc,
+  add,
+  and,
+  asec,
+  asin,
+  atan,
+  atanh,
+  bigint,
+  bitNot,
+  bitXor,
+  boolean,
+  cbrt,
+  combinations,
+  compare,
+  compareText,
+  cos,
+  cot,
+  csc,
+  cube,
+  divide,
+  equalScalar,
+  erf,
+  exp,
+  filter,
+  forEach,
+  format,
+  gamma,
+  isInteger,
+  isNegative,
+  isPositive,
+  isZero,
+  LOG2E,
+  largerEq,
+  leftShift,
+  log,
+  log1p,
+  map,
+  mean,
+  mod,
+  multiply,
+  not,
+  number,
+  or,
+  pi,
+  pow,
+  random,
+  reviver,
+  rightLogShift,
+  SQRT2,
+  sech,
+  sin,
+  size,
+  smallerEq,
+  square,
+  string,
+  subtract,
+  tanh,
+  typeOf,
+  unequal,
+  xgcd,
+  acoth,
+  addScalar,
+  asech,
+  bitAnd,
+  chain,
+  combinationsWithRep,
+  cosh,
+  csch,
+  divideScalar,
+  equalText,
+  expm1,
+  isNumeric,
+  LN2,
+  lcm,
+  log10,
+  mapSlices,
+  multiplyScalar,
+  nthRoot,
+  pickRandom,
+  rightArithShift,
+  sec,
+  sinh,
+  sqrt,
+  tan,
+  unaryMinus,
+  acosh,
+  atan2,
+  bitOr,
+  clone,
+  coth,
+  equal,
+  factorial,
+  hasNumericValue,
+  isNaN,
+  larger,
+  log2,
+  mode,
+  norm,
+  partitionSelect,
+  print,
+  randomInt,
+  round,
+  simplifyConstant,
+  smaller,
+  subtractScalar,
+  true: _true,
+  variance,
+  zeta,
+  acsch,
+  catalan,
+  compareNatural,
+  composition,
+  cumsum,
+  floor,
+  hypot,
+  lgamma,
+  median,
+  multinomial,
+  permutations,
+  quantileSeq,
+  sign,
+  std,
+  stirlingS2,
+  'PI': pi,
+  asinh,
+  ceil,
+  deepEqual,
+  fix,
+  isPrime,
+  numeric,
+  prod,
+  bellNumbers,
+  gcd,
+  mad,
+  range,
+  sum,
+  corr,
+  max,
+  parse,
+  resolve,
+  simplifyCore,
+  compile,
+  evaluate,
+  simplify,
+  derivative,
+  min,
+  rationalize,
+  help,
+  parser,
+  config
+});
+_extends(mathWithTransform, math, {
+  cumsum: createCumSumTransform({
+    add,
+    typed,
+    unaryPlus
+  }),
+  mapSlices: createMapSlicesTransform({
+    isInteger,
+    typed
+  }),
+  filter: createFilterTransform({
+    typed
+  }),
+  forEach: createForEachTransform({
+    typed
+  }),
+  mean: createMeanTransform({
+    add,
+    divide,
+    typed
+  }),
+  subset: createSubsetTransform({}),
+  map: createMapTransform({
+    typed
+  }),
+  range: createRangeTransform({
+    matrix,
+    add,
+    config,
+    equal,
+    isPositive,
+    isZero,
+    larger,
+    largerEq,
+    smaller,
+    smallerEq,
+    typed
+  }),
+  std: createStdTransform({
+    map,
+    sqrt,
+    typed,
+    variance
+  }),
+  sum: createSumTransform({
+    add,
+    config,
+    numeric,
+    typed
+  }),
+  max: createMaxTransform({
+    config,
+    isNaN,
+    larger,
+    numeric,
+    typed
+  }),
+  min: createMinTransform({
+    config,
+    isNaN,
+    numeric,
+    smaller,
+    typed
+  }),
+  variance: createVarianceTransform({
+    add,
+    divide,
+    isNaN,
+    mapSlices,
+    multiply,
+    subtract,
+    typed
+  })
+});
+_extends(classes, {
+  Range,
+  ResultSet,
+  Chain,
+  Node,
+  ObjectNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  AccessorNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  FunctionNode,
+  IndexNode,
+  OperatorNode,
+  ArrayNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  ParenthesisNode,
+  Help,
+  Parser
+});
+Chain.createProxy(math);
+export { embeddedDocs as docs } from '../expression/embeddedDocs/embeddedDocs.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/mainAny.js b/node_modules/mathjs/lib/esm/entry/mainAny.js
new file mode 100644
index 0000000..c45eb98
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/mainAny.js
@@ -0,0 +1,22 @@
+// configuration
+export { config } from './configReadonly.js';
+
+// functions and constants
+export * from './pureFunctionsAny.generated.js';
+export * from './impureFunctionsAny.generated.js';
+export * from './typeChecks.js';
+
+// error classes
+export { IndexError } from '../error/IndexError.js';
+export { DimensionError } from '../error/DimensionError.js';
+export { ArgumentsError } from '../error/ArgumentsError.js';
+
+// dependency groups
+export * from './dependenciesAny.generated.js';
+
+// factory functions
+export * from '../factoriesAny.js';
+
+// core
+export { create } from '../core/create.js';
+export { factory } from '../utils/factory.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/mainNumber.js b/node_modules/mathjs/lib/esm/entry/mainNumber.js
new file mode 100644
index 0000000..e9e3ee0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/mainNumber.js
@@ -0,0 +1,22 @@
+// configuration
+export { config } from './configReadonly.js';
+
+// functions and constants
+export * from './pureFunctionsNumber.generated.js';
+export * from './impureFunctionsNumber.generated.js';
+export * from './typeChecks.js';
+
+// error classes
+export { IndexError } from '../error/IndexError.js';
+export { DimensionError } from '../error/DimensionError.js';
+export { ArgumentsError } from '../error/ArgumentsError.js';
+
+// dependency groups
+export * from './dependenciesNumber.generated.js';
+
+// factory functions
+export * from '../factoriesNumber.js';
+
+// core
+export { create } from '../core/create.js';
+export { factory } from '../utils/factory.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js b/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js
new file mode 100644
index 0000000..f6af91d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js
@@ -0,0 +1,1829 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createBigNumberClass, createComplexClass, createE, createFalse, createFineStructure, createFractionClass, createI, createInfinity, createLN10, createLOG10E, createMatrixClass, createNaN, createNull, createPhi, createRangeClass, createResultSet, createSQRT1_2,
+// eslint-disable-line camelcase
+createSackurTetrode, createTau, createTrue, createVersion, createDenseMatrixClass, createEfimovFactor, createLN2, createPi, createReplacer, createSQRT2, createTyped, createWeakMixingAngle, createAbs, createAcos, createAcot, createAcsc, createAddScalar, createArg, createAsech, createAsinh, createAtan, createAtanh, createBigint, createBitNot, createBoolean, createClone, createCombinations, createComplex, createConj, createCos, createCot, createCsc, createCube, createEqualScalar, createErf, createExp, createExpm1, createFilter, createFlatten, createForEach, createFormat, createGetMatrixDataType, createHex, createIm, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createToBest, createTypeOf, createAcosh, createAcsch, createAsec, createBignumber, createCombinationsWithRep, createCosh, createCsch, createIsNaN, createIsPrime, createMapSlices, createMatrix, createMatrixFromFunction, createOnes, createRandomInt, createReshape, createSech, createSinh, createSparse, createSqrt, createSqueeze, createTanh, createTranspose, createXgcd, createZeros, createAcoth, createAsin, createBin, createConcat, createCoth, createCtranspose, createDiag, createDotMultiply, createEqual, createFraction, createIdentity, createIsNumeric, createKron, createLargerEq, createLeftShift, createMode, createNthRoot, createNumeric, createProd, createResize, createRightArithShift, createRound, createSize, createSmaller, createTo, createUnaryMinus, createUnequal, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCbrt, createCompare, createCompareText, createCount, createDeepEqual, createDivideScalar, createDotDivide, createEqualText, createFloor, createGcd, createHasNumericValue, createHypot, createImmutableDenseMatrixClass, createIndexClass, createLarger, createLog, createLsolve, createMatrixFromColumns, createMax, createMin, createMod, createNthRoots, createNullish, createOr, createPartitionSelect, createQr, createRightLogShift, createSmallerEq, createSubset, createSubtract, createTrace, createUsolve, createCatalan, createCompareNatural, createComposition, createDiff, createDistance, createDot, createFibonacciHeapClass, createIndex, createInvmod, createLcm, createLog1p, createLsolveAll, createMatrixFromRows, createMultiply, createRange, createRow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSlu, createSort, createUnaryPlus, createUsolveAll, createZpk2tf, createAnd, createCeil, createColumn, createCross, createDet, createFix, createInv, createPinv, createPow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSpaClass, createSqrtm, createSum, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCoulomb, createCreateUnit, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createExpm, createFaraday, createFft, createGamma, createGravitationConstant, createHartreeEnergy, createIfft, createInverseConductanceQuantum, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSecondRadiation, createSetSize, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCoulombConstant, createDivide, createElectronMass, createFactorial, createFirstRadiation, createGravity, createIntersect, createLup, createMagneticFluxQuantum, createMolarMassC12, createMultinomial, createPermutations, createPlanckMass, createPolynomialRoot, createSetIntersect, createSolveODE, createStirlingS2, createUnitFunction, createBellNumbers, createCumSum, createEigs, createFermiCoupling, createGasConstant, createKldivergence, createLusolve, createMean, createMolarVolume, createPlanckConstant, createQuantileSeq, createSetUnion, createVariance, createClassicalElectronRadius, createMedian, createCorr, createFreqz, createMad, createStd, createZeta, createNorm, createRotationMatrix, createPlanckTime, createSchur, createRotate, createSylvester, createLyap } from '../factoriesAny.js';
+export var BigNumber = /* #__PURE__ */createBigNumberClass({
+  config
+});
+export var Complex = /* #__PURE__ */createComplexClass({});
+export var e = /* #__PURE__ */createE({
+  BigNumber,
+  config
+});
+export var _false = /* #__PURE__ */createFalse({});
+export var fineStructure = /* #__PURE__ */createFineStructure({
+  BigNumber,
+  config
+});
+export var Fraction = /* #__PURE__ */createFractionClass({});
+export var i = /* #__PURE__ */createI({
+  Complex
+});
+export var _Infinity = /* #__PURE__ */createInfinity({
+  BigNumber,
+  config
+});
+export var LN10 = /* #__PURE__ */createLN10({
+  BigNumber,
+  config
+});
+export var LOG10E = /* #__PURE__ */createLOG10E({
+  BigNumber,
+  config
+});
+export var Matrix = /* #__PURE__ */createMatrixClass({});
+export var _NaN = /* #__PURE__ */createNaN({
+  BigNumber,
+  config
+});
+export var _null = /* #__PURE__ */createNull({});
+export var phi = /* #__PURE__ */createPhi({
+  BigNumber,
+  config
+});
+export var Range = /* #__PURE__ */createRangeClass({});
+export var ResultSet = /* #__PURE__ */createResultSet({});
+export var SQRT1_2 = /* #__PURE__ */createSQRT1_2({
+  BigNumber,
+  config
+});
+export var sackurTetrode = /* #__PURE__ */createSackurTetrode({
+  BigNumber,
+  config
+});
+export var tau = /* #__PURE__ */createTau({
+  BigNumber,
+  config
+});
+export var _true = /* #__PURE__ */createTrue({});
+export var version = /* #__PURE__ */createVersion({});
+export var DenseMatrix = /* #__PURE__ */createDenseMatrixClass({
+  Matrix
+});
+export var efimovFactor = /* #__PURE__ */createEfimovFactor({
+  BigNumber,
+  config
+});
+export var LN2 = /* #__PURE__ */createLN2({
+  BigNumber,
+  config
+});
+export var pi = /* #__PURE__ */createPi({
+  BigNumber,
+  config
+});
+export var replacer = /* #__PURE__ */createReplacer({});
+export var SQRT2 = /* #__PURE__ */createSQRT2({
+  BigNumber,
+  config
+});
+export var typed = /* #__PURE__ */createTyped({
+  BigNumber,
+  Complex,
+  DenseMatrix,
+  Fraction
+});
+export var weakMixingAngle = /* #__PURE__ */createWeakMixingAngle({
+  BigNumber,
+  config
+});
+export var abs = /* #__PURE__ */createAbs({
+  typed
+});
+export var acos = /* #__PURE__ */createAcos({
+  Complex,
+  config,
+  typed
+});
+export var acot = /* #__PURE__ */createAcot({
+  BigNumber,
+  typed
+});
+export var acsc = /* #__PURE__ */createAcsc({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var addScalar = /* #__PURE__ */createAddScalar({
+  typed
+});
+export var arg = /* #__PURE__ */createArg({
+  typed
+});
+export var asech = /* #__PURE__ */createAsech({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var asinh = /* #__PURE__ */createAsinh({
+  typed
+});
+export var atan = /* #__PURE__ */createAtan({
+  typed
+});
+export var atanh = /* #__PURE__ */createAtanh({
+  Complex,
+  config,
+  typed
+});
+export var bigint = /* #__PURE__ */createBigint({
+  typed
+});
+export var bitNot = /* #__PURE__ */createBitNot({
+  typed
+});
+export var boolean = /* #__PURE__ */createBoolean({
+  typed
+});
+export var clone = /* #__PURE__ */createClone({
+  typed
+});
+export var combinations = /* #__PURE__ */createCombinations({
+  typed
+});
+export var complex = /* #__PURE__ */createComplex({
+  Complex,
+  typed
+});
+export var conj = /* #__PURE__ */createConj({
+  typed
+});
+export var cos = /* #__PURE__ */createCos({
+  typed
+});
+export var cot = /* #__PURE__ */createCot({
+  BigNumber,
+  typed
+});
+export var csc = /* #__PURE__ */createCsc({
+  BigNumber,
+  typed
+});
+export var cube = /* #__PURE__ */createCube({
+  typed
+});
+export var equalScalar = /* #__PURE__ */createEqualScalar({
+  config,
+  typed
+});
+export var erf = /* #__PURE__ */createErf({
+  typed
+});
+export var exp = /* #__PURE__ */createExp({
+  typed
+});
+export var expm1 = /* #__PURE__ */createExpm1({
+  Complex,
+  typed
+});
+export var filter = /* #__PURE__ */createFilter({
+  typed
+});
+export var flatten = /* #__PURE__ */createFlatten({
+  typed
+});
+export var forEach = /* #__PURE__ */createForEach({
+  typed
+});
+export var format = /* #__PURE__ */createFormat({
+  typed
+});
+export var getMatrixDataType = /* #__PURE__ */createGetMatrixDataType({
+  typed
+});
+export var hex = /* #__PURE__ */createHex({
+  format,
+  typed
+});
+export var im = /* #__PURE__ */createIm({
+  typed
+});
+export var isInteger = /* #__PURE__ */createIsInteger({
+  typed
+});
+export var isNegative = /* #__PURE__ */createIsNegative({
+  config,
+  typed
+});
+export var isPositive = /* #__PURE__ */createIsPositive({
+  config,
+  typed
+});
+export var isZero = /* #__PURE__ */createIsZero({
+  equalScalar,
+  typed
+});
+export var LOG2E = /* #__PURE__ */createLOG2E({
+  BigNumber,
+  config
+});
+export var lgamma = /* #__PURE__ */createLgamma({
+  Complex,
+  typed
+});
+export var log10 = /* #__PURE__ */createLog10({
+  Complex,
+  config,
+  typed
+});
+export var log2 = /* #__PURE__ */createLog2({
+  Complex,
+  config,
+  typed
+});
+export var map = /* #__PURE__ */createMap({
+  typed
+});
+export var multiplyScalar = /* #__PURE__ */createMultiplyScalar({
+  typed
+});
+export var not = /* #__PURE__ */createNot({
+  typed
+});
+export var number = /* #__PURE__ */createNumber({
+  typed
+});
+export var oct = /* #__PURE__ */createOct({
+  format,
+  typed
+});
+export var pickRandom = /* #__PURE__ */createPickRandom({
+  config,
+  typed
+});
+export var print = /* #__PURE__ */createPrint({
+  typed
+});
+export var random = /* #__PURE__ */createRandom({
+  config,
+  typed
+});
+export var re = /* #__PURE__ */createRe({
+  typed
+});
+export var sec = /* #__PURE__ */createSec({
+  BigNumber,
+  typed
+});
+export var sign = /* #__PURE__ */createSign({
+  BigNumber,
+  Fraction,
+  complex,
+  typed
+});
+export var sin = /* #__PURE__ */createSin({
+  typed
+});
+export var SparseMatrix = /* #__PURE__ */createSparseMatrixClass({
+  Matrix,
+  equalScalar,
+  typed
+});
+export var splitUnit = /* #__PURE__ */createSplitUnit({
+  typed
+});
+export var square = /* #__PURE__ */createSquare({
+  typed
+});
+export var string = /* #__PURE__ */createString({
+  typed
+});
+export var subtractScalar = /* #__PURE__ */createSubtractScalar({
+  typed
+});
+export var tan = /* #__PURE__ */createTan({
+  typed
+});
+export var toBest = /* #__PURE__ */createToBest({
+  typed
+});
+export var typeOf = /* #__PURE__ */createTypeOf({
+  typed
+});
+export var acosh = /* #__PURE__ */createAcosh({
+  Complex,
+  config,
+  typed
+});
+export var acsch = /* #__PURE__ */createAcsch({
+  BigNumber,
+  typed
+});
+export var asec = /* #__PURE__ */createAsec({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var bignumber = /* #__PURE__ */createBignumber({
+  BigNumber,
+  typed
+});
+export var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({
+  typed
+});
+export var cosh = /* #__PURE__ */createCosh({
+  typed
+});
+export var csch = /* #__PURE__ */createCsch({
+  BigNumber,
+  typed
+});
+export var isNaN = /* #__PURE__ */createIsNaN({
+  typed
+});
+export var isPrime = /* #__PURE__ */createIsPrime({
+  typed
+});
+export var mapSlices = /* #__PURE__ */createMapSlices({
+  isInteger,
+  typed
+});
+export var apply = mapSlices;
+export var matrix = /* #__PURE__ */createMatrix({
+  DenseMatrix,
+  Matrix,
+  SparseMatrix,
+  typed
+});
+export var matrixFromFunction = /* #__PURE__ */createMatrixFromFunction({
+  isZero,
+  matrix,
+  typed
+});
+export var ones = /* #__PURE__ */createOnes({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var randomInt = /* #__PURE__ */createRandomInt({
+  config,
+  log2,
+  typed
+});
+export var reshape = /* #__PURE__ */createReshape({
+  isInteger,
+  matrix,
+  typed
+});
+export var sech = /* #__PURE__ */createSech({
+  BigNumber,
+  typed
+});
+export var sinh = /* #__PURE__ */createSinh({
+  typed
+});
+export var sparse = /* #__PURE__ */createSparse({
+  SparseMatrix,
+  typed
+});
+export var sqrt = /* #__PURE__ */createSqrt({
+  Complex,
+  config,
+  typed
+});
+export var squeeze = /* #__PURE__ */createSqueeze({
+  typed
+});
+export var tanh = /* #__PURE__ */createTanh({
+  typed
+});
+export var transpose = /* #__PURE__ */createTranspose({
+  matrix,
+  typed
+});
+export var xgcd = /* #__PURE__ */createXgcd({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var zeros = /* #__PURE__ */createZeros({
+  BigNumber,
+  config,
+  matrix,
+  typed
+});
+export var acoth = /* #__PURE__ */createAcoth({
+  BigNumber,
+  Complex,
+  config,
+  typed
+});
+export var asin = /* #__PURE__ */createAsin({
+  Complex,
+  config,
+  typed
+});
+export var bin = /* #__PURE__ */createBin({
+  format,
+  typed
+});
+export var concat = /* #__PURE__ */createConcat({
+  isInteger,
+  matrix,
+  typed
+});
+export var coth = /* #__PURE__ */createCoth({
+  BigNumber,
+  typed
+});
+export var ctranspose = /* #__PURE__ */createCtranspose({
+  conj,
+  transpose,
+  typed
+});
+export var diag = /* #__PURE__ */createDiag({
+  DenseMatrix,
+  SparseMatrix,
+  matrix,
+  typed
+});
+export var dotMultiply = /* #__PURE__ */createDotMultiply({
+  concat,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var equal = /* #__PURE__ */createEqual({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var fraction = /* #__PURE__ */createFraction({
+  Fraction,
+  typed
+});
+export var identity = /* #__PURE__ */createIdentity({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  config,
+  matrix,
+  typed
+});
+export var isNumeric = /* #__PURE__ */createIsNumeric({
+  typed
+});
+export var kron = /* #__PURE__ */createKron({
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var largerEq = /* #__PURE__ */createLargerEq({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config,
+  matrix,
+  typed
+});
+export var leftShift = /* #__PURE__ */createLeftShift({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var mode = /* #__PURE__ */createMode({
+  isNaN,
+  isNumeric,
+  typed
+});
+export var nthRoot = /* #__PURE__ */createNthRoot({
+  BigNumber,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var numeric = /* #__PURE__ */createNumeric({
+  bignumber,
+  fraction,
+  number
+});
+export var prod = /* #__PURE__ */createProd({
+  config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+export var resize = /* #__PURE__ */createResize({
+  config,
+  matrix
+});
+export var rightArithShift = /* #__PURE__ */createRightArithShift({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var round = /* #__PURE__ */createRound({
+  BigNumber,
+  DenseMatrix,
+  config,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var size = /* #__PURE__ */createSize({
+  matrix,
+  config,
+  typed
+});
+export var smaller = /* #__PURE__ */createSmaller({
+  DenseMatrix,
+  SparseMatrix,
+  bignumber,
+  concat,
+  config,
+  matrix,
+  typed
+});
+export var to = /* #__PURE__ */createTo({
+  concat,
+  matrix,
+  typed
+});
+export var unaryMinus = /* #__PURE__ */createUnaryMinus({
+  typed
+});
+export var unequal = /* #__PURE__ */createUnequal({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config,
+  equalScalar,
+  matrix,
+  typed
+});
+export var xor = /* #__PURE__ */createXor({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  matrix,
+  typed
+});
+export var add = /* #__PURE__ */createAdd({
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var atan2 = /* #__PURE__ */createAtan2({
+  BigNumber,
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var bitAnd = /* #__PURE__ */createBitAnd({
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var bitOr = /* #__PURE__ */createBitOr({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var bitXor = /* #__PURE__ */createBitXor({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  matrix,
+  typed
+});
+export var cbrt = /* #__PURE__ */createCbrt({
+  BigNumber,
+  Complex,
+  Fraction,
+  config,
+  isNegative,
+  matrix,
+  typed,
+  unaryMinus
+});
+export var compare = /* #__PURE__ */createCompare({
+  BigNumber,
+  DenseMatrix,
+  Fraction,
+  concat,
+  config,
+  equalScalar,
+  matrix,
+  typed
+});
+export var compareText = /* #__PURE__ */createCompareText({
+  concat,
+  matrix,
+  typed
+});
+export var count = /* #__PURE__ */createCount({
+  prod,
+  size,
+  typed
+});
+export var deepEqual = /* #__PURE__ */createDeepEqual({
+  equal,
+  typed
+});
+export var divideScalar = /* #__PURE__ */createDivideScalar({
+  numeric,
+  typed
+});
+export var dotDivide = /* #__PURE__ */createDotDivide({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  divideScalar,
+  equalScalar,
+  matrix,
+  typed
+});
+export var equalText = /* #__PURE__ */createEqualText({
+  compareText,
+  isZero,
+  typed
+});
+export var floor = /* #__PURE__ */createFloor({
+  DenseMatrix,
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+export var gcd = /* #__PURE__ */createGcd({
+  BigNumber,
+  DenseMatrix,
+  concat,
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+export var hasNumericValue = /* #__PURE__ */createHasNumericValue({
+  isNumeric,
+  typed
+});
+export var hypot = /* #__PURE__ */createHypot({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+export var ImmutableDenseMatrix = /* #__PURE__ */createImmutableDenseMatrixClass({
+  DenseMatrix,
+  smaller
+});
+export var Index = /* #__PURE__ */createIndexClass({
+  ImmutableDenseMatrix,
+  getMatrixDataType
+});
+export var larger = /* #__PURE__ */createLarger({
+  DenseMatrix,
+  SparseMatrix,
+  bignumber,
+  concat,
+  config,
+  matrix,
+  typed
+});
+export var log = /* #__PURE__ */createLog({
+  Complex,
+  config,
+  divideScalar,
+  typeOf,
+  typed
+});
+export var lsolve = /* #__PURE__ */createLsolve({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+export var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+export var max = /* #__PURE__ */createMax({
+  config,
+  isNaN,
+  larger,
+  numeric,
+  typed
+});
+export var min = /* #__PURE__ */createMin({
+  config,
+  isNaN,
+  numeric,
+  smaller,
+  typed
+});
+export var mod = /* #__PURE__ */createMod({
+  DenseMatrix,
+  concat,
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+export var nthRoots = /* #__PURE__ */createNthRoots({
+  Complex,
+  config,
+  divideScalar,
+  typed
+});
+export var nullish = /* #__PURE__ */createNullish({
+  deepEqual,
+  flatten,
+  matrix,
+  size,
+  typed
+});
+export var or = /* #__PURE__ */createOr({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var partitionSelect = /* #__PURE__ */createPartitionSelect({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+export var qr = /* #__PURE__ */createQr({
+  addScalar,
+  complex,
+  conj,
+  divideScalar,
+  equal,
+  identity,
+  isZero,
+  matrix,
+  multiplyScalar,
+  sign,
+  sqrt,
+  subtractScalar,
+  typed,
+  unaryMinus,
+  zeros
+});
+export var rightLogShift = /* #__PURE__ */createRightLogShift({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  typed,
+  zeros
+});
+export var smallerEq = /* #__PURE__ */createSmallerEq({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  config,
+  matrix,
+  typed
+});
+export var subset = /* #__PURE__ */createSubset({
+  add,
+  matrix,
+  typed,
+  zeros
+});
+export var subtract = /* #__PURE__ */createSubtract({
+  DenseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+export var trace = /* #__PURE__ */createTrace({
+  add,
+  matrix,
+  typed
+});
+export var usolve = /* #__PURE__ */createUsolve({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+export var catalan = /* #__PURE__ */createCatalan({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+export var compareNatural = /* #__PURE__ */createCompareNatural({
+  compare,
+  typed
+});
+export var composition = /* #__PURE__ */createComposition({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+export var diff = /* #__PURE__ */createDiff({
+  matrix,
+  number,
+  subtract,
+  typed
+});
+export var distance = /* #__PURE__ */createDistance({
+  abs,
+  addScalar,
+  deepEqual,
+  divideScalar,
+  multiplyScalar,
+  sqrt,
+  subtractScalar,
+  typed
+});
+export var dot = /* #__PURE__ */createDot({
+  addScalar,
+  conj,
+  multiplyScalar,
+  size,
+  typed
+});
+export var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({
+  larger,
+  smaller
+});
+export var index = /* #__PURE__ */createIndex({
+  Index,
+  typed
+});
+export var invmod = /* #__PURE__ */createInvmod({
+  BigNumber,
+  add,
+  config,
+  equal,
+  isInteger,
+  mod,
+  smaller,
+  typed,
+  xgcd
+});
+export var lcm = /* #__PURE__ */createLcm({
+  concat,
+  equalScalar,
+  matrix,
+  typed
+});
+export var log1p = /* #__PURE__ */createLog1p({
+  Complex,
+  config,
+  divideScalar,
+  log,
+  typed
+});
+export var lsolveAll = /* #__PURE__ */createLsolveAll({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+export var matrixFromRows = /* #__PURE__ */createMatrixFromRows({
+  flatten,
+  matrix,
+  size,
+  typed
+});
+export var multiply = /* #__PURE__ */createMultiply({
+  addScalar,
+  dot,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  typed
+});
+export var range = /* #__PURE__ */createRange({
+  bignumber,
+  matrix,
+  add,
+  config,
+  equal,
+  isPositive,
+  isZero,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+export var row = /* #__PURE__ */createRow({
+  Index,
+  matrix,
+  range,
+  typed
+});
+export var setCartesian = /* #__PURE__ */createSetCartesian({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setDistinct = /* #__PURE__ */createSetDistinct({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setIsSubset = /* #__PURE__ */createSetIsSubset({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setPowerset = /* #__PURE__ */createSetPowerset({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var slu = /* #__PURE__ */createSlu({
+  SparseMatrix,
+  abs,
+  add,
+  divideScalar,
+  larger,
+  largerEq,
+  multiply,
+  subtract,
+  transpose,
+  typed
+});
+export var sort = /* #__PURE__ */createSort({
+  compare,
+  compareNatural,
+  matrix,
+  typed
+});
+export var unaryPlus = /* #__PURE__ */createUnaryPlus({
+  config,
+  numeric,
+  typed
+});
+export var usolveAll = /* #__PURE__ */createUsolveAll({
+  DenseMatrix,
+  divideScalar,
+  equalScalar,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed
+});
+export var zpk2tf = /* #__PURE__ */createZpk2tf({
+  Complex,
+  add,
+  multiply,
+  number,
+  typed
+});
+export var and = /* #__PURE__ */createAnd({
+  concat,
+  equalScalar,
+  matrix,
+  not,
+  typed,
+  zeros
+});
+export var ceil = /* #__PURE__ */createCeil({
+  DenseMatrix,
+  config,
+  equalScalar,
+  matrix,
+  round,
+  typed,
+  zeros
+});
+export var column = /* #__PURE__ */createColumn({
+  Index,
+  matrix,
+  range,
+  typed
+});
+export var cross = /* #__PURE__ */createCross({
+  matrix,
+  multiply,
+  subtract,
+  typed
+});
+export var det = /* #__PURE__ */createDet({
+  divideScalar,
+  isZero,
+  matrix,
+  multiply,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+export var fix = /* #__PURE__ */createFix({
+  Complex,
+  DenseMatrix,
+  ceil,
+  equalScalar,
+  floor,
+  matrix,
+  typed,
+  zeros
+});
+export var inv = /* #__PURE__ */createInv({
+  abs,
+  addScalar,
+  det,
+  divideScalar,
+  identity,
+  matrix,
+  multiply,
+  typed,
+  unaryMinus
+});
+export var pinv = /* #__PURE__ */createPinv({
+  Complex,
+  add,
+  ctranspose,
+  deepEqual,
+  divideScalar,
+  dot,
+  dotDivide,
+  equal,
+  inv,
+  matrix,
+  multiply,
+  typed
+});
+export var pow = /* #__PURE__ */createPow({
+  Complex,
+  config,
+  fraction,
+  identity,
+  inv,
+  matrix,
+  multiply,
+  number,
+  typed
+});
+export var setDifference = /* #__PURE__ */createSetDifference({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setMultiplicity = /* #__PURE__ */createSetMultiplicity({
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var setSymDifference = /* #__PURE__ */createSetSymDifference({
+  Index,
+  concat,
+  setDifference,
+  size,
+  subset,
+  typed
+});
+export var Spa = /* #__PURE__ */createSpaClass({
+  FibonacciHeap,
+  addScalar,
+  equalScalar
+});
+export var sqrtm = /* #__PURE__ */createSqrtm({
+  abs,
+  add,
+  identity,
+  inv,
+  map,
+  max,
+  multiply,
+  size,
+  sqrt,
+  subtract,
+  typed
+});
+export var sum = /* #__PURE__ */createSum({
+  add,
+  config,
+  numeric,
+  typed
+});
+export var Unit = /* #__PURE__ */createUnitClass({
+  BigNumber,
+  Complex,
+  Fraction,
+  abs,
+  addScalar,
+  config,
+  divideScalar,
+  equal,
+  fix,
+  format,
+  isNumeric,
+  multiplyScalar,
+  number,
+  pow,
+  round,
+  subtractScalar,
+  toBest
+});
+export var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({
+  BigNumber,
+  Unit,
+  config
+});
+export var wienDisplacement = /* #__PURE__ */createWienDisplacement({
+  BigNumber,
+  Unit,
+  config
+});
+export var atomicMass = /* #__PURE__ */createAtomicMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var bohrMagneton = /* #__PURE__ */createBohrMagneton({
+  BigNumber,
+  Unit,
+  config
+});
+export var boltzmann = /* #__PURE__ */createBoltzmann({
+  BigNumber,
+  Unit,
+  config
+});
+export var conductanceQuantum = /* #__PURE__ */createConductanceQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var coulomb = /* #__PURE__ */createCoulomb({
+  BigNumber,
+  Unit,
+  config
+});
+export var createUnit = /* #__PURE__ */createCreateUnit({
+  Unit,
+  typed
+});
+export var deuteronMass = /* #__PURE__ */createDeuteronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var dotPow = /* #__PURE__ */createDotPow({
+  DenseMatrix,
+  SparseMatrix,
+  concat,
+  equalScalar,
+  matrix,
+  pow,
+  typed
+});
+export var electricConstant = /* #__PURE__ */createElectricConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var elementaryCharge = /* #__PURE__ */createElementaryCharge({
+  BigNumber,
+  Unit,
+  config
+});
+export var expm = /* #__PURE__ */createExpm({
+  abs,
+  add,
+  identity,
+  inv,
+  multiply,
+  typed
+});
+export var faraday = /* #__PURE__ */createFaraday({
+  BigNumber,
+  Unit,
+  config
+});
+export var fft = /* #__PURE__ */createFft({
+  addScalar,
+  ceil,
+  conj,
+  divideScalar,
+  dotDivide,
+  exp,
+  i,
+  log2,
+  matrix,
+  multiplyScalar,
+  pow,
+  tau,
+  typed
+});
+export var gamma = /* #__PURE__ */createGamma({
+  BigNumber,
+  Complex,
+  config,
+  multiplyScalar,
+  pow,
+  typed
+});
+export var gravitationConstant = /* #__PURE__ */createGravitationConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({
+  BigNumber,
+  Unit,
+  config
+});
+export var ifft = /* #__PURE__ */createIfft({
+  conj,
+  dotDivide,
+  fft,
+  typed
+});
+export var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var klitzing = /* #__PURE__ */createKlitzing({
+  BigNumber,
+  Unit,
+  config
+});
+export var loschmidt = /* #__PURE__ */createLoschmidt({
+  BigNumber,
+  Unit,
+  config
+});
+export var magneticConstant = /* #__PURE__ */createMagneticConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarMass = /* #__PURE__ */createMolarMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarPlanckConstant = /* #__PURE__ */createMolarPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var neutronMass = /* #__PURE__ */createNeutronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckCharge = /* #__PURE__ */createPlanckCharge({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckLength = /* #__PURE__ */createPlanckLength({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckTemperature = /* #__PURE__ */createPlanckTemperature({
+  BigNumber,
+  Unit,
+  config
+});
+export var protonMass = /* #__PURE__ */createProtonMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({
+  BigNumber,
+  Unit,
+  config
+});
+export var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var rydberg = /* #__PURE__ */createRydberg({
+  BigNumber,
+  Unit,
+  config
+});
+export var secondRadiation = /* #__PURE__ */createSecondRadiation({
+  BigNumber,
+  Unit,
+  config
+});
+export var setSize = /* #__PURE__ */createSetSize({
+  compareNatural,
+  typed
+});
+export var speedOfLight = /* #__PURE__ */createSpeedOfLight({
+  BigNumber,
+  Unit,
+  config
+});
+export var stefanBoltzmann = /* #__PURE__ */createStefanBoltzmann({
+  BigNumber,
+  Unit,
+  config
+});
+export var thomsonCrossSection = /* #__PURE__ */createThomsonCrossSection({
+  BigNumber,
+  Unit,
+  config
+});
+export var avogadro = /* #__PURE__ */createAvogadro({
+  BigNumber,
+  Unit,
+  config
+});
+export var bohrRadius = /* #__PURE__ */createBohrRadius({
+  BigNumber,
+  Unit,
+  config
+});
+export var coulombConstant = /* #__PURE__ */createCoulombConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var divide = /* #__PURE__ */createDivide({
+  divideScalar,
+  equalScalar,
+  inv,
+  matrix,
+  multiply,
+  typed
+});
+export var electronMass = /* #__PURE__ */createElectronMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var factorial = /* #__PURE__ */createFactorial({
+  gamma,
+  typed
+});
+export var firstRadiation = /* #__PURE__ */createFirstRadiation({
+  BigNumber,
+  Unit,
+  config
+});
+export var gravity = /* #__PURE__ */createGravity({
+  BigNumber,
+  Unit,
+  config
+});
+export var intersect = /* #__PURE__ */createIntersect({
+  abs,
+  add,
+  addScalar,
+  config,
+  divideScalar,
+  equalScalar,
+  flatten,
+  isNumeric,
+  isZero,
+  matrix,
+  multiply,
+  multiplyScalar,
+  smaller,
+  subtract,
+  typed
+});
+export var lup = /* #__PURE__ */createLup({
+  DenseMatrix,
+  Spa,
+  SparseMatrix,
+  abs,
+  addScalar,
+  divideScalar,
+  equalScalar,
+  larger,
+  matrix,
+  multiplyScalar,
+  subtractScalar,
+  typed,
+  unaryMinus
+});
+export var magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({
+  BigNumber,
+  Unit,
+  config
+});
+export var molarMassC12 = /* #__PURE__ */createMolarMassC12({
+  BigNumber,
+  Unit,
+  config
+});
+export var multinomial = /* #__PURE__ */createMultinomial({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+export var permutations = /* #__PURE__ */createPermutations({
+  factorial,
+  typed
+});
+export var planckMass = /* #__PURE__ */createPlanckMass({
+  BigNumber,
+  Unit,
+  config
+});
+export var polynomialRoot = /* #__PURE__ */createPolynomialRoot({
+  add,
+  cbrt,
+  divide,
+  equalScalar,
+  im,
+  isZero,
+  multiply,
+  re,
+  sqrt,
+  subtract,
+  typeOf,
+  typed,
+  unaryMinus
+});
+export var setIntersect = /* #__PURE__ */createSetIntersect({
+  DenseMatrix,
+  Index,
+  compareNatural,
+  size,
+  subset,
+  typed
+});
+export var solveODE = /* #__PURE__ */createSolveODE({
+  abs,
+  add,
+  bignumber,
+  divide,
+  isNegative,
+  isPositive,
+  larger,
+  map,
+  matrix,
+  max,
+  multiply,
+  smaller,
+  subtract,
+  typed,
+  unaryMinus
+});
+export var stirlingS2 = /* #__PURE__ */createStirlingS2({
+  bignumber,
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtractScalar,
+  typed
+});
+export var unit = /* #__PURE__ */createUnitFunction({
+  Unit,
+  typed
+});
+export var bellNumbers = /* #__PURE__ */createBellNumbers({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+export var cumsum = /* #__PURE__ */createCumSum({
+  add,
+  typed,
+  unaryPlus
+});
+export var eigs = /* #__PURE__ */createEigs({
+  abs,
+  add,
+  addScalar,
+  atan,
+  bignumber,
+  column,
+  complex,
+  config,
+  cos,
+  diag,
+  divideScalar,
+  dot,
+  equal,
+  flatten,
+  im,
+  inv,
+  larger,
+  matrix,
+  matrixFromColumns,
+  multiply,
+  multiplyScalar,
+  number,
+  qr,
+  re,
+  reshape,
+  sin,
+  size,
+  smaller,
+  sqrt,
+  subtract,
+  typed,
+  usolve,
+  usolveAll
+});
+export var fermiCoupling = /* #__PURE__ */createFermiCoupling({
+  BigNumber,
+  Unit,
+  config
+});
+export var gasConstant = /* #__PURE__ */createGasConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var kldivergence = /* #__PURE__ */createKldivergence({
+  divide,
+  dotDivide,
+  isNumeric,
+  log,
+  map,
+  matrix,
+  multiply,
+  sum,
+  typed
+});
+export var lusolve = /* #__PURE__ */createLusolve({
+  DenseMatrix,
+  lsolve,
+  lup,
+  matrix,
+  slu,
+  typed,
+  usolve
+});
+export var mean = /* #__PURE__ */createMean({
+  add,
+  divide,
+  typed
+});
+export var molarVolume = /* #__PURE__ */createMolarVolume({
+  BigNumber,
+  Unit,
+  config
+});
+export var planckConstant = /* #__PURE__ */createPlanckConstant({
+  BigNumber,
+  Unit,
+  config
+});
+export var quantileSeq = /* #__PURE__ */createQuantileSeq({
+  bignumber,
+  add,
+  compare,
+  divide,
+  isInteger,
+  larger,
+  mapSlices,
+  multiply,
+  partitionSelect,
+  smaller,
+  smallerEq,
+  subtract,
+  typed
+});
+export var setUnion = /* #__PURE__ */createSetUnion({
+  Index,
+  concat,
+  setIntersect,
+  setSymDifference,
+  size,
+  subset,
+  typed
+});
+export var variance = /* #__PURE__ */createVariance({
+  add,
+  divide,
+  isNaN,
+  mapSlices,
+  multiply,
+  subtract,
+  typed
+});
+export var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({
+  BigNumber,
+  Unit,
+  config
+});
+export var median = /* #__PURE__ */createMedian({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+export var corr = /* #__PURE__ */createCorr({
+  add,
+  divide,
+  matrix,
+  mean,
+  multiply,
+  pow,
+  sqrt,
+  subtract,
+  sum,
+  typed
+});
+export var freqz = /* #__PURE__ */createFreqz({
+  Complex,
+  add,
+  divide,
+  matrix,
+  multiply,
+  typed
+});
+export var mad = /* #__PURE__ */createMad({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+export var std = /* #__PURE__ */createStd({
+  map,
+  sqrt,
+  typed,
+  variance
+});
+export var zeta = /* #__PURE__ */createZeta({
+  BigNumber,
+  Complex,
+  add,
+  config,
+  divide,
+  equal,
+  factorial,
+  gamma,
+  isNegative,
+  multiply,
+  pi,
+  pow,
+  sin,
+  smallerEq,
+  subtract,
+  typed
+});
+export var norm = /* #__PURE__ */createNorm({
+  abs,
+  add,
+  conj,
+  ctranspose,
+  eigs,
+  equalScalar,
+  larger,
+  matrix,
+  multiply,
+  pow,
+  smaller,
+  sqrt,
+  typed
+});
+export var rotationMatrix = /* #__PURE__ */createRotationMatrix({
+  BigNumber,
+  DenseMatrix,
+  SparseMatrix,
+  addScalar,
+  config,
+  cos,
+  matrix,
+  multiplyScalar,
+  norm,
+  sin,
+  typed,
+  unaryMinus
+});
+export var planckTime = /* #__PURE__ */createPlanckTime({
+  BigNumber,
+  Unit,
+  config
+});
+export var schur = /* #__PURE__ */createSchur({
+  identity,
+  matrix,
+  multiply,
+  norm,
+  qr,
+  subtract,
+  typed
+});
+export var rotate = /* #__PURE__ */createRotate({
+  multiply,
+  rotationMatrix,
+  typed
+});
+export var sylvester = /* #__PURE__ */createSylvester({
+  abs,
+  add,
+  concat,
+  identity,
+  index,
+  lusolve,
+  matrix,
+  matrixFromColumns,
+  multiply,
+  range,
+  schur,
+  subset,
+  subtract,
+  transpose,
+  typed
+});
+export var lyap = /* #__PURE__ */createLyap({
+  matrix,
+  multiply,
+  sylvester,
+  transpose,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js b/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js
new file mode 100644
index 0000000..0efa35b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/pureFunctionsNumber.generated.js
@@ -0,0 +1,612 @@
+/**
+ * THIS FILE IS AUTO-GENERATED
+ * DON'T MAKE CHANGES HERE
+ */
+import { config } from './configReadonly.js';
+import { createE, createFalse, createIndex, createInfinity, createLN10, createLOG10E, createMatrix, createNaN, createNull, createPhi, createRangeClass, createReplacer, createResultSet, createSQRT1_2,
+// eslint-disable-line camelcase
+createSubset, createTau, createTyped, createUnaryPlus, createVersion, createXor, createAbs, createAcos, createAcot, createAcsc, createAdd, createAnd, createAsec, createAsin, createAtan, createAtanh, createBigint, createBitNot, createBitXor, createBoolean, createCbrt, createCombinations, createCompare, createCompareText, createCos, createCot, createCsc, createCube, createDivide, createEqualScalar, createErf, createExp, createFilter, createForEach, createFormat, createGamma, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLargerEq, createLeftShift, createLog, createLog1p, createMap, createMean, createMod, createMultiply, createNot, createNumber, createOr, createPi, createPow, createRandom, createRightLogShift, createSQRT2, createSech, createSin, createSize, createSmallerEq, createSquare, createString, createSubtract, createTanh, createTypeOf, createUnequal, createXgcd, createAcoth, createAddScalar, createAsech, createBitAnd, createCombinationsWithRep, createCosh, createCsch, createDivideScalar, createEqualText, createExpm1, createIsNumeric, createLN2, createLcm, createLog10, createMapSlices, createMultiplyScalar, createNthRoot, createPickRandom, createRightArithShift, createSec, createSinh, createSqrt, createTan, createUnaryMinus, createAcosh, createAtan2, createBitOr, createClone, createCoth, createEqual, createFactorial, createHasNumericValue, createIsNaN, createLarger, createLog2, createMode, createNorm, createPartitionSelect, createPrint, createRandomInt, createRound, createSmaller, createSubtractScalar, createTrue, createVariance, createZeta, createAcsch, createCatalan, createCompareNatural, createComposition, createCumSum, createFloor, createHypot, createLgamma, createMedian, createMultinomial, createPermutations, createQuantileSeq, createSign, createStd, createStirlingS2, createAsinh, createCeil, createDeepEqual, createFix, createIsPrime, createNumeric, createProd, createBellNumbers, createGcd, createMad, createRange, createSum, createCorr, createMax, createMin } from '../factoriesNumber.js';
+export var e = /* #__PURE__ */createE({
+  config
+});
+export var _false = /* #__PURE__ */createFalse({});
+export var index = /* #__PURE__ */createIndex({});
+export var _Infinity = /* #__PURE__ */createInfinity({
+  config
+});
+export var LN10 = /* #__PURE__ */createLN10({
+  config
+});
+export var LOG10E = /* #__PURE__ */createLOG10E({
+  config
+});
+export var matrix = /* #__PURE__ */createMatrix({});
+export var _NaN = /* #__PURE__ */createNaN({
+  config
+});
+export var _null = /* #__PURE__ */createNull({});
+export var phi = /* #__PURE__ */createPhi({
+  config
+});
+export var Range = /* #__PURE__ */createRangeClass({});
+export var replacer = /* #__PURE__ */createReplacer({});
+export var ResultSet = /* #__PURE__ */createResultSet({});
+export var SQRT1_2 = /* #__PURE__ */createSQRT1_2({
+  config
+});
+export var subset = /* #__PURE__ */createSubset({});
+export var tau = /* #__PURE__ */createTau({
+  config
+});
+export var typed = /* #__PURE__ */createTyped({});
+export var unaryPlus = /* #__PURE__ */createUnaryPlus({
+  typed
+});
+export var version = /* #__PURE__ */createVersion({});
+export var xor = /* #__PURE__ */createXor({
+  typed
+});
+export var abs = /* #__PURE__ */createAbs({
+  typed
+});
+export var acos = /* #__PURE__ */createAcos({
+  typed
+});
+export var acot = /* #__PURE__ */createAcot({
+  typed
+});
+export var acsc = /* #__PURE__ */createAcsc({
+  typed
+});
+export var add = /* #__PURE__ */createAdd({
+  typed
+});
+export var and = /* #__PURE__ */createAnd({
+  typed
+});
+export var asec = /* #__PURE__ */createAsec({
+  typed
+});
+export var asin = /* #__PURE__ */createAsin({
+  typed
+});
+export var atan = /* #__PURE__ */createAtan({
+  typed
+});
+export var atanh = /* #__PURE__ */createAtanh({
+  typed
+});
+export var bigint = /* #__PURE__ */createBigint({
+  typed
+});
+export var bitNot = /* #__PURE__ */createBitNot({
+  typed
+});
+export var bitXor = /* #__PURE__ */createBitXor({
+  typed
+});
+export var boolean = /* #__PURE__ */createBoolean({
+  typed
+});
+export var cbrt = /* #__PURE__ */createCbrt({
+  typed
+});
+export var combinations = /* #__PURE__ */createCombinations({
+  typed
+});
+export var compare = /* #__PURE__ */createCompare({
+  config,
+  typed
+});
+export var compareText = /* #__PURE__ */createCompareText({
+  typed
+});
+export var cos = /* #__PURE__ */createCos({
+  typed
+});
+export var cot = /* #__PURE__ */createCot({
+  typed
+});
+export var csc = /* #__PURE__ */createCsc({
+  typed
+});
+export var cube = /* #__PURE__ */createCube({
+  typed
+});
+export var divide = /* #__PURE__ */createDivide({
+  typed
+});
+export var equalScalar = /* #__PURE__ */createEqualScalar({
+  config,
+  typed
+});
+export var erf = /* #__PURE__ */createErf({
+  typed
+});
+export var exp = /* #__PURE__ */createExp({
+  typed
+});
+export var filter = /* #__PURE__ */createFilter({
+  typed
+});
+export var forEach = /* #__PURE__ */createForEach({
+  typed
+});
+export var format = /* #__PURE__ */createFormat({
+  typed
+});
+export var gamma = /* #__PURE__ */createGamma({
+  typed
+});
+export var isInteger = /* #__PURE__ */createIsInteger({
+  typed
+});
+export var isNegative = /* #__PURE__ */createIsNegative({
+  typed
+});
+export var isPositive = /* #__PURE__ */createIsPositive({
+  typed
+});
+export var isZero = /* #__PURE__ */createIsZero({
+  typed
+});
+export var LOG2E = /* #__PURE__ */createLOG2E({
+  config
+});
+export var largerEq = /* #__PURE__ */createLargerEq({
+  config,
+  typed
+});
+export var leftShift = /* #__PURE__ */createLeftShift({
+  typed
+});
+export var log = /* #__PURE__ */createLog({
+  typed
+});
+export var log1p = /* #__PURE__ */createLog1p({
+  typed
+});
+export var map = /* #__PURE__ */createMap({
+  typed
+});
+export var mean = /* #__PURE__ */createMean({
+  add,
+  divide,
+  typed
+});
+export var mod = /* #__PURE__ */createMod({
+  typed
+});
+export var multiply = /* #__PURE__ */createMultiply({
+  typed
+});
+export var not = /* #__PURE__ */createNot({
+  typed
+});
+export var number = /* #__PURE__ */createNumber({
+  typed
+});
+export var or = /* #__PURE__ */createOr({
+  typed
+});
+export var pi = /* #__PURE__ */createPi({
+  config
+});
+export var pow = /* #__PURE__ */createPow({
+  typed
+});
+export var random = /* #__PURE__ */createRandom({
+  config,
+  typed
+});
+export var rightLogShift = /* #__PURE__ */createRightLogShift({
+  typed
+});
+export var SQRT2 = /* #__PURE__ */createSQRT2({
+  config
+});
+export var sech = /* #__PURE__ */createSech({
+  typed
+});
+export var sin = /* #__PURE__ */createSin({
+  typed
+});
+export var size = /* #__PURE__ */createSize({
+  matrix,
+  config,
+  typed
+});
+export var smallerEq = /* #__PURE__ */createSmallerEq({
+  config,
+  typed
+});
+export var square = /* #__PURE__ */createSquare({
+  typed
+});
+export var string = /* #__PURE__ */createString({
+  typed
+});
+export var subtract = /* #__PURE__ */createSubtract({
+  typed
+});
+export var tanh = /* #__PURE__ */createTanh({
+  typed
+});
+export var typeOf = /* #__PURE__ */createTypeOf({
+  typed
+});
+export var unequal = /* #__PURE__ */createUnequal({
+  equalScalar,
+  typed
+});
+export var xgcd = /* #__PURE__ */createXgcd({
+  typed
+});
+export var acoth = /* #__PURE__ */createAcoth({
+  typed
+});
+export var addScalar = /* #__PURE__ */createAddScalar({
+  typed
+});
+export var asech = /* #__PURE__ */createAsech({
+  typed
+});
+export var bitAnd = /* #__PURE__ */createBitAnd({
+  typed
+});
+export var combinationsWithRep = /* #__PURE__ */createCombinationsWithRep({
+  typed
+});
+export var cosh = /* #__PURE__ */createCosh({
+  typed
+});
+export var csch = /* #__PURE__ */createCsch({
+  typed
+});
+export var divideScalar = /* #__PURE__ */createDivideScalar({
+  typed
+});
+export var equalText = /* #__PURE__ */createEqualText({
+  compareText,
+  isZero,
+  typed
+});
+export var expm1 = /* #__PURE__ */createExpm1({
+  typed
+});
+export var isNumeric = /* #__PURE__ */createIsNumeric({
+  typed
+});
+export var LN2 = /* #__PURE__ */createLN2({
+  config
+});
+export var lcm = /* #__PURE__ */createLcm({
+  typed
+});
+export var log10 = /* #__PURE__ */createLog10({
+  typed
+});
+export var mapSlices = /* #__PURE__ */createMapSlices({
+  isInteger,
+  typed
+});
+export var apply = mapSlices;
+export var multiplyScalar = /* #__PURE__ */createMultiplyScalar({
+  typed
+});
+export var nthRoot = /* #__PURE__ */createNthRoot({
+  typed
+});
+export var pickRandom = /* #__PURE__ */createPickRandom({
+  config,
+  typed
+});
+export var rightArithShift = /* #__PURE__ */createRightArithShift({
+  typed
+});
+export var sec = /* #__PURE__ */createSec({
+  typed
+});
+export var sinh = /* #__PURE__ */createSinh({
+  typed
+});
+export var sqrt = /* #__PURE__ */createSqrt({
+  typed
+});
+export var tan = /* #__PURE__ */createTan({
+  typed
+});
+export var unaryMinus = /* #__PURE__ */createUnaryMinus({
+  typed
+});
+export var acosh = /* #__PURE__ */createAcosh({
+  typed
+});
+export var atan2 = /* #__PURE__ */createAtan2({
+  typed
+});
+export var bitOr = /* #__PURE__ */createBitOr({
+  typed
+});
+export var clone = /* #__PURE__ */createClone({
+  typed
+});
+export var coth = /* #__PURE__ */createCoth({
+  typed
+});
+export var equal = /* #__PURE__ */createEqual({
+  equalScalar,
+  typed
+});
+export var factorial = /* #__PURE__ */createFactorial({
+  gamma,
+  typed
+});
+export var hasNumericValue = /* #__PURE__ */createHasNumericValue({
+  isNumeric,
+  typed
+});
+export var isNaN = /* #__PURE__ */createIsNaN({
+  typed
+});
+export var larger = /* #__PURE__ */createLarger({
+  config,
+  typed
+});
+export var log2 = /* #__PURE__ */createLog2({
+  typed
+});
+export var mode = /* #__PURE__ */createMode({
+  isNaN,
+  isNumeric,
+  typed
+});
+export var norm = /* #__PURE__ */createNorm({
+  typed
+});
+export var partitionSelect = /* #__PURE__ */createPartitionSelect({
+  compare,
+  isNaN,
+  isNumeric,
+  typed
+});
+export var print = /* #__PURE__ */createPrint({
+  typed
+});
+export var randomInt = /* #__PURE__ */createRandomInt({
+  config,
+  log2,
+  typed
+});
+export var round = /* #__PURE__ */createRound({
+  typed
+});
+export var smaller = /* #__PURE__ */createSmaller({
+  config,
+  typed
+});
+export var subtractScalar = /* #__PURE__ */createSubtractScalar({
+  typed
+});
+export var _true = /* #__PURE__ */createTrue({});
+export var variance = /* #__PURE__ */createVariance({
+  add,
+  divide,
+  isNaN,
+  mapSlices,
+  multiply,
+  subtract,
+  typed
+});
+export var zeta = /* #__PURE__ */createZeta({
+  add,
+  config,
+  divide,
+  equal,
+  factorial,
+  gamma,
+  isNegative,
+  multiply,
+  pi,
+  pow,
+  sin,
+  smallerEq,
+  subtract,
+  typed
+});
+export var acsch = /* #__PURE__ */createAcsch({
+  typed
+});
+export var catalan = /* #__PURE__ */createCatalan({
+  addScalar,
+  combinations,
+  divideScalar,
+  isInteger,
+  isNegative,
+  multiplyScalar,
+  typed
+});
+export var compareNatural = /* #__PURE__ */createCompareNatural({
+  compare,
+  typed
+});
+export var composition = /* #__PURE__ */createComposition({
+  addScalar,
+  combinations,
+  isInteger,
+  isNegative,
+  isPositive,
+  larger,
+  typed
+});
+export var cumsum = /* #__PURE__ */createCumSum({
+  add,
+  typed,
+  unaryPlus
+});
+export var floor = /* #__PURE__ */createFloor({
+  config,
+  round,
+  typed
+});
+export var hypot = /* #__PURE__ */createHypot({
+  abs,
+  addScalar,
+  divideScalar,
+  isPositive,
+  multiplyScalar,
+  smaller,
+  sqrt,
+  typed
+});
+export var lgamma = /* #__PURE__ */createLgamma({
+  typed
+});
+export var median = /* #__PURE__ */createMedian({
+  add,
+  compare,
+  divide,
+  partitionSelect,
+  typed
+});
+export var multinomial = /* #__PURE__ */createMultinomial({
+  add,
+  divide,
+  factorial,
+  isInteger,
+  isPositive,
+  multiply,
+  typed
+});
+export var permutations = /* #__PURE__ */createPermutations({
+  factorial,
+  typed
+});
+export var quantileSeq = /* #__PURE__ */createQuantileSeq({
+  add,
+  compare,
+  divide,
+  isInteger,
+  larger,
+  mapSlices,
+  multiply,
+  partitionSelect,
+  smaller,
+  smallerEq,
+  subtract,
+  typed
+});
+export var sign = /* #__PURE__ */createSign({
+  typed
+});
+export var std = /* #__PURE__ */createStd({
+  map,
+  sqrt,
+  typed,
+  variance
+});
+export var stirlingS2 = /* #__PURE__ */createStirlingS2({
+  addScalar,
+  combinations,
+  divideScalar,
+  factorial,
+  isInteger,
+  isNegative,
+  larger,
+  multiplyScalar,
+  number,
+  pow,
+  subtractScalar,
+  typed
+});
+export var asinh = /* #__PURE__ */createAsinh({
+  typed
+});
+export var ceil = /* #__PURE__ */createCeil({
+  config,
+  round,
+  typed
+});
+export var deepEqual = /* #__PURE__ */createDeepEqual({
+  equal,
+  typed
+});
+export var fix = /* #__PURE__ */createFix({
+  ceil,
+  floor,
+  typed
+});
+export var isPrime = /* #__PURE__ */createIsPrime({
+  typed
+});
+export var numeric = /* #__PURE__ */createNumeric({
+  number
+});
+export var prod = /* #__PURE__ */createProd({
+  config,
+  multiplyScalar,
+  numeric,
+  typed
+});
+export var bellNumbers = /* #__PURE__ */createBellNumbers({
+  addScalar,
+  isInteger,
+  isNegative,
+  stirlingS2,
+  typed
+});
+export var gcd = /* #__PURE__ */createGcd({
+  typed
+});
+export var mad = /* #__PURE__ */createMad({
+  abs,
+  map,
+  median,
+  subtract,
+  typed
+});
+export var range = /* #__PURE__ */createRange({
+  matrix,
+  add,
+  config,
+  equal,
+  isPositive,
+  isZero,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  typed
+});
+export var sum = /* #__PURE__ */createSum({
+  add,
+  config,
+  numeric,
+  typed
+});
+export var corr = /* #__PURE__ */createCorr({
+  add,
+  divide,
+  matrix,
+  mean,
+  multiply,
+  pow,
+  sqrt,
+  subtract,
+  sum,
+  typed
+});
+export var max = /* #__PURE__ */createMax({
+  config,
+  isNaN,
+  larger,
+  numeric,
+  typed
+});
+export var min = /* #__PURE__ */createMin({
+  config,
+  isNaN,
+  numeric,
+  smaller,
+  typed
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/entry/typeChecks.js b/node_modules/mathjs/lib/esm/entry/typeChecks.js
new file mode 100644
index 0000000..3071835
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/entry/typeChecks.js
@@ -0,0 +1,2 @@
+// util functions
+export { isAccessorNode, isArray, isArrayNode, isAssignmentNode, isBigNumber, isBigInt, isBlockNode, isBoolean, isChain, isCollection, isComplex, isConditionalNode, isConstantNode, isDate, isDenseMatrix, isFraction, isFunction, isFunctionAssignmentNode, isFunctionNode, isHelp, isIndex, isIndexNode, isMatrix, isNode, isNull, isNumber, isString, isUndefined, isObject, isMap, isPartitionedMap, isObjectWrappingMap, isObjectNode, isOperatorNode, isParenthesisNode, isRange, isRangeNode, isRelationalNode, isRegExp, isResultSet, isSparseMatrix, isSymbolNode, isUnit } from '../utils/is.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/ArgumentsError.js b/node_modules/mathjs/lib/esm/error/ArgumentsError.js
new file mode 100644
index 0000000..82da95e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/ArgumentsError.js
@@ -0,0 +1,24 @@
+/**
+ * Create a syntax error with the message:
+ *     'Wrong number of arguments in function <fn> (<count> provided, <min>-<max> expected)'
+ * @param {string} fn     Function name
+ * @param {number} count  Actual argument count
+ * @param {number} min    Minimum required argument count
+ * @param {number} [max]  Maximum required argument count
+ * @extends Error
+ */
+export function ArgumentsError(fn, count, min, max) {
+  if (!(this instanceof ArgumentsError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.fn = fn;
+  this.count = count;
+  this.min = min;
+  this.max = max;
+  this.message = 'Wrong number of arguments in function ' + fn + ' (' + count + ' provided, ' + min + (max !== undefined && max !== null ? '-' + max : '') + ' expected)';
+  this.stack = new Error().stack;
+}
+ArgumentsError.prototype = new Error();
+ArgumentsError.prototype.constructor = Error;
+ArgumentsError.prototype.name = 'ArgumentsError';
+ArgumentsError.prototype.isArgumentsError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/DimensionError.js b/node_modules/mathjs/lib/esm/error/DimensionError.js
new file mode 100644
index 0000000..f488487
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/DimensionError.js
@@ -0,0 +1,23 @@
+/**
+ * Create a range error with the message:
+ *     'Dimension mismatch (<actual size> != <expected size>)'
+ * @param {number | number[]} actual        The actual size
+ * @param {number | number[]} expected      The expected size
+ * @param {string} [relation='!=']          Optional relation between actual
+ *                                          and expected size: '!=', '<', etc.
+ * @extends RangeError
+ */
+export function DimensionError(actual, expected, relation) {
+  if (!(this instanceof DimensionError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.actual = actual;
+  this.expected = expected;
+  this.relation = relation;
+  this.message = 'Dimension mismatch (' + (Array.isArray(actual) ? '[' + actual.join(', ') + ']' : actual) + ' ' + (this.relation || '!=') + ' ' + (Array.isArray(expected) ? '[' + expected.join(', ') + ']' : expected) + ')';
+  this.stack = new Error().stack;
+}
+DimensionError.prototype = new RangeError();
+DimensionError.prototype.constructor = RangeError;
+DimensionError.prototype.name = 'DimensionError';
+DimensionError.prototype.isDimensionError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/error/IndexError.js b/node_modules/mathjs/lib/esm/error/IndexError.js
new file mode 100644
index 0000000..9755958
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/error/IndexError.js
@@ -0,0 +1,35 @@
+/**
+ * Create a range error with the message:
+ *     'Index out of range (index < min)'
+ *     'Index out of range (index < max)'
+ *
+ * @param {number} index     The actual index
+ * @param {number} [min=0]   Minimum index (included)
+ * @param {number} [max]     Maximum index (excluded)
+ * @extends RangeError
+ */
+export function IndexError(index, min, max) {
+  if (!(this instanceof IndexError)) {
+    throw new SyntaxError('Constructor must be called with the new operator');
+  }
+  this.index = index;
+  if (arguments.length < 3) {
+    this.min = 0;
+    this.max = min;
+  } else {
+    this.min = min;
+    this.max = max;
+  }
+  if (this.min !== undefined && this.index < this.min) {
+    this.message = 'Index out of range (' + this.index + ' < ' + this.min + ')';
+  } else if (this.max !== undefined && this.index >= this.max) {
+    this.message = 'Index out of range (' + this.index + ' > ' + (this.max - 1) + ')';
+  } else {
+    this.message = 'Index out of range (' + this.index + ')';
+  }
+  this.stack = new Error().stack;
+}
+IndexError.prototype = new RangeError();
+IndexError.prototype.constructor = RangeError;
+IndexError.prototype.name = 'IndexError';
+IndexError.prototype.isIndexError = true;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/Help.js b/node_modules/mathjs/lib/esm/expression/Help.js
new file mode 100644
index 0000000..5f18914
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/Help.js
@@ -0,0 +1,132 @@
+import { isHelp } from '../utils/is.js';
+import { clone } from '../utils/object.js';
+import { format } from '../utils/string.js';
+import { factory } from '../utils/factory.js';
+var name = 'Help';
+var dependencies = ['evaluate'];
+export var createHelpClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    evaluate
+  } = _ref;
+  /**
+   * Documentation object
+   * @param {Object} doc  Object containing properties:
+   *                      {string} name
+   *                      {string} category
+   *                      {string} description
+   *                      {string[]} syntax
+   *                      {string[]} examples
+   *                      {string[]} seealso
+   * @constructor
+   */
+  function Help(doc) {
+    if (!(this instanceof Help)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (!doc) throw new Error('Argument "doc" missing');
+    this.doc = doc;
+  }
+
+  /**
+   * Attach type information
+   */
+  Help.prototype.type = 'Help';
+  Help.prototype.isHelp = true;
+
+  /**
+   * Generate a string representation of the Help object
+   * @return {string} Returns a string
+   * @private
+   */
+  Help.prototype.toString = function () {
+    var doc = this.doc || {};
+    var desc = '\n';
+    if (doc.name) {
+      desc += 'Name: ' + doc.name + '\n\n';
+    }
+    if (doc.category) {
+      desc += 'Category: ' + doc.category + '\n\n';
+    }
+    if (doc.description) {
+      desc += 'Description:\n    ' + doc.description + '\n\n';
+    }
+    if (doc.syntax) {
+      desc += 'Syntax:\n    ' + doc.syntax.join('\n    ') + '\n\n';
+    }
+    if (doc.examples) {
+      desc += 'Examples:\n';
+
+      // after evaluating the examples, we restore config in case the examples
+      // did change the config.
+      var configChanged = false;
+      var originalConfig = evaluate('config()');
+      var scope = {
+        config: newConfig => {
+          configChanged = true;
+          return evaluate('config(newConfig)', {
+            newConfig
+          });
+        }
+      };
+      for (var i = 0; i < doc.examples.length; i++) {
+        var expr = doc.examples[i];
+        desc += '    ' + expr + '\n';
+        var res = void 0;
+        try {
+          // note: res can be undefined when `expr` is an empty string
+          res = evaluate(expr, scope);
+        } catch (e) {
+          res = e;
+        }
+        if (res !== undefined && !isHelp(res)) {
+          desc += '        ' + format(res, {
+            precision: 14
+          }) + '\n';
+        }
+      }
+      desc += '\n';
+      if (configChanged) {
+        evaluate('config(originalConfig)', {
+          originalConfig
+        });
+      }
+    }
+    if (doc.mayThrow && doc.mayThrow.length) {
+      desc += 'Throws: ' + doc.mayThrow.join(', ') + '\n\n';
+    }
+    if (doc.seealso && doc.seealso.length) {
+      desc += 'See also: ' + doc.seealso.join(', ') + '\n';
+    }
+    return desc;
+  };
+
+  /**
+   * Export the help object to JSON
+   */
+  Help.prototype.toJSON = function () {
+    var obj = clone(this.doc);
+    obj.mathjs = 'Help';
+    return obj;
+  };
+
+  /**
+   * Instantiate a Help object from a JSON object
+   * @param {Object} json
+   * @returns {Help} Returns a new Help object
+   */
+  Help.fromJSON = function (json) {
+    var doc = {};
+    Object.keys(json).filter(prop => prop !== 'mathjs').forEach(prop => {
+      doc[prop] = json[prop];
+    });
+    return new Help(doc);
+  };
+
+  /**
+   * Returns a string representation of the Help object
+   */
+  Help.prototype.valueOf = Help.prototype.toString;
+  return Help;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/Parser.js b/node_modules/mathjs/lib/esm/expression/Parser.js
new file mode 100644
index 0000000..290c5cc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/Parser.js
@@ -0,0 +1,194 @@
+import { factory } from '../utils/factory.js';
+import { isFunction } from '../utils/is.js';
+import { createEmptyMap, toObject } from '../utils/map.js';
+var name = 'Parser';
+var dependencies = ['evaluate', 'parse'];
+export var createParserClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    evaluate,
+    parse
+  } = _ref;
+  /**
+   * @constructor Parser
+   * Parser contains methods to evaluate or parse expressions, and has a number
+   * of convenience methods to get, set, and remove variables from memory. Parser
+   * keeps a scope containing variables in memory, which is used for all
+   * evaluations.
+   *
+   * Methods:
+   *    const result = parser.evaluate(expr)  // evaluate an expression
+   *    const value = parser.get(name)        // retrieve a variable from the parser
+   *    const values = parser.getAll()        // retrieve all defined variables
+   *    parser.set(name, value)               // set a variable in the parser
+   *    parser.remove(name)                   // clear a variable from the
+   *                                          // parsers scope
+   *    parser.clear()                        // clear the parsers scope
+   *
+   * Example usage:
+   *    const parser = new Parser()
+   *    // Note: there is a convenience method which can be used instead:
+   *    // const parser = new math.parser()
+   *
+   *    // evaluate expressions
+   *    parser.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *    parser.evaluate('sqrt(-4)')               // 2i
+   *    parser.evaluate('2 inch in cm')           // 5.08 cm
+   *    parser.evaluate('cos(45 deg)')            // 0.7071067811865476
+   *
+   *    // define variables and functions
+   *    parser.evaluate('x = 7 / 2')              // 3.5
+   *    parser.evaluate('x + 3')                  // 6.5
+   *    parser.evaluate('f(x, y) = x^y')          // f(x, y)
+   *    parser.evaluate('f(2, 3)')                // 8
+   *
+   *    // get and set variables and functions
+   *    const x = parser.get('x')                 // 3.5
+   *    const f = parser.get('f')                 // function
+   *    const g = f(3, 2)                         // 9
+   *    parser.set('h', 500)
+   *    const i = parser.evaluate('h / 2')        // 250
+   *    parser.set('hello', function (name) {
+   *        return 'hello, ' + name + '!'
+   *    })
+   *    parser.evaluate('hello("user")')          // "hello, user!"
+   *
+   *    // clear defined functions and variables
+   *    parser.clear()
+   *
+   */
+  function Parser() {
+    if (!(this instanceof Parser)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    Object.defineProperty(this, 'scope', {
+      value: createEmptyMap(),
+      writable: false
+    });
+  }
+
+  /**
+   * Attach type information
+   */
+  Parser.prototype.type = 'Parser';
+  Parser.prototype.isParser = true;
+
+  /**
+   * Parse and evaluate the given expression
+   * @param {string | string[]} expr   A string containing an expression,
+   *                                   for example "2+3", or a list with expressions
+   * @return {*} result     The result, or undefined when the expression was empty
+   * @throws {Error}
+   */
+  Parser.prototype.evaluate = function (expr) {
+    // TODO: validate arguments
+    return evaluate(expr, this.scope);
+  };
+
+  /**
+   * Get a variable (a function or variable) by name from the parsers scope.
+   * Returns undefined when not found
+   * @param {string} name
+   * @return {* | undefined} value
+   */
+  Parser.prototype.get = function (name) {
+    // TODO: validate arguments
+    if (this.scope.has(name)) {
+      return this.scope.get(name);
+    }
+  };
+
+  /**
+   * Get a map with all defined variables
+   * @return {Object} values
+   */
+  Parser.prototype.getAll = function () {
+    return toObject(this.scope);
+  };
+
+  /**
+   * Get a map with all defined variables
+   * @return {Map} values
+   */
+  Parser.prototype.getAllAsMap = function () {
+    return this.scope;
+  };
+  function isValidVariableName(name) {
+    if (name.length === 0) {
+      return false;
+    }
+    for (var i = 0; i < name.length; i++) {
+      var cPrev = name.charAt(i - 1);
+      var c = name.charAt(i);
+      var cNext = name.charAt(i + 1);
+      var valid = parse.isAlpha(c, cPrev, cNext) || i > 0 && parse.isDigit(c);
+      if (!valid) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  /**
+   * Set a symbol (a function or variable) by name from the parsers scope.
+   * @param {string} name
+   * @param {* | undefined} value
+   */
+  Parser.prototype.set = function (name, value) {
+    if (!isValidVariableName(name)) {
+      throw new Error("Invalid variable name: '".concat(name, "'. Variable names must follow the specified rules."));
+    }
+    this.scope.set(name, value);
+    return value;
+  };
+
+  /**
+   * Remove a variable from the parsers scope
+   * @param {string} name
+   */
+  Parser.prototype.remove = function (name) {
+    this.scope.delete(name);
+  };
+
+  /**
+   * Clear the scope with variables and functions
+   */
+  Parser.prototype.clear = function () {
+    this.scope.clear();
+  };
+  Parser.prototype.toJSON = function () {
+    var json = {
+      mathjs: 'Parser',
+      variables: {},
+      functions: {}
+    };
+    for (var [_name2, value] of this.scope) {
+      if (isFunction(value)) {
+        if (!isExpressionFunction(value)) {
+          throw new Error("Cannot serialize external function ".concat(_name2));
+        }
+        json.functions[_name2] = "".concat(value.syntax, " = ").concat(value.expr);
+      } else {
+        json.variables[_name2] = value;
+      }
+    }
+    return json;
+  };
+  Parser.fromJSON = function (json) {
+    var parser = new Parser();
+    Object.entries(json.variables).forEach(_ref2 => {
+      var [name, value] = _ref2;
+      return parser.set(name, value);
+    });
+    Object.entries(json.functions).forEach(_ref3 => {
+      var [_name, fn] = _ref3;
+      return parser.evaluate(fn);
+    });
+    return parser;
+  };
+  return Parser;
+}, {
+  isClass: true
+});
+function isExpressionFunction(value) {
+  return typeof value === 'function' && typeof value.syntax === 'string' && typeof value.expr === 'string';
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js
new file mode 100644
index 0000000..665c06c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/Infinity.js
@@ -0,0 +1,8 @@
+export var InfinityDocs = {
+  name: 'Infinity',
+  category: 'Constants',
+  syntax: ['Infinity'],
+  description: 'Infinity, a number which is larger than the maximum number that can be handled by a floating point number.',
+  examples: ['Infinity', '1 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js
new file mode 100644
index 0000000..14cee58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN10.js
@@ -0,0 +1,8 @@
+export var LN10Docs = {
+  name: 'LN10',
+  category: 'Constants',
+  syntax: ['LN10'],
+  description: 'Returns the natural logarithm of 10, approximately equal to 2.302',
+  examples: ['LN10', 'log(10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js
new file mode 100644
index 0000000..4cdd420
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LN2.js
@@ -0,0 +1,8 @@
+export var LN2Docs = {
+  name: 'LN2',
+  category: 'Constants',
+  syntax: ['LN2'],
+  description: 'Returns the natural logarithm of 2, approximately equal to 0.693',
+  examples: ['LN2', 'log(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js
new file mode 100644
index 0000000..2bc29fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG10E.js
@@ -0,0 +1,8 @@
+export var LOG10EDocs = {
+  name: 'LOG10E',
+  category: 'Constants',
+  syntax: ['LOG10E'],
+  description: 'Returns the base-10 logarithm of E, approximately equal to 0.434',
+  examples: ['LOG10E', 'log(e, 10)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js
new file mode 100644
index 0000000..91352dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/LOG2E.js
@@ -0,0 +1,8 @@
+export var LOG2EDocs = {
+  name: 'LOG2E',
+  category: 'Constants',
+  syntax: ['LOG2E'],
+  description: 'Returns the base-2 logarithm of E, approximately equal to 1.442',
+  examples: ['LOG2E', 'log(e, 2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js
new file mode 100644
index 0000000..f44bd42
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/NaN.js
@@ -0,0 +1,8 @@
+export var NaNDocs = {
+  name: 'NaN',
+  category: 'Constants',
+  syntax: ['NaN'],
+  description: 'Not a number',
+  examples: ['NaN', '0 / 0'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js
new file mode 100644
index 0000000..c08a377
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT1_2.js
@@ -0,0 +1,8 @@
+export var SQRT12Docs = {
+  name: 'SQRT1_2',
+  category: 'Constants',
+  syntax: ['SQRT1_2'],
+  description: 'Returns the square root of 1/2, approximately equal to 0.707',
+  examples: ['SQRT1_2', 'sqrt(1/2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js
new file mode 100644
index 0000000..638c4b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/SQRT2.js
@@ -0,0 +1,8 @@
+export var SQRT2Docs = {
+  name: 'SQRT2',
+  category: 'Constants',
+  syntax: ['SQRT2'],
+  description: 'Returns the square root of 2, approximately equal to 1.414',
+  examples: ['SQRT2', 'sqrt(2)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js
new file mode 100644
index 0000000..e82480a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/e.js
@@ -0,0 +1,8 @@
+export var eDocs = {
+  name: 'e',
+  category: 'Constants',
+  syntax: ['e'],
+  description: 'Euler\'s number, the base of the natural logarithm. Approximately equal to 2.71828',
+  examples: ['e', 'e ^ 2', 'exp(2)', 'log(e)'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js
new file mode 100644
index 0000000..78c1791
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/false.js
@@ -0,0 +1,8 @@
+export var falseDocs = {
+  name: 'false',
+  category: 'Constants',
+  syntax: ['false'],
+  description: 'Boolean value false',
+  examples: ['false'],
+  seealso: ['true']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js
new file mode 100644
index 0000000..69d62ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/i.js
@@ -0,0 +1,8 @@
+export var iDocs = {
+  name: 'i',
+  category: 'Constants',
+  syntax: ['i'],
+  description: 'Imaginary unit, defined as i*i=-1. A complex number is described as a + b*i, where a is the real part, and b is the imaginary part.',
+  examples: ['i', 'i * i', 'sqrt(-1)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js
new file mode 100644
index 0000000..1d6a721
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/null.js
@@ -0,0 +1,8 @@
+export var nullDocs = {
+  name: 'null',
+  category: 'Constants',
+  syntax: ['null'],
+  description: 'Value null',
+  examples: ['null'],
+  seealso: ['true', 'false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js
new file mode 100644
index 0000000..bb48c9a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/phi.js
@@ -0,0 +1,8 @@
+export var phiDocs = {
+  name: 'phi',
+  category: 'Constants',
+  syntax: ['phi'],
+  description: 'Phi is the golden ratio. Two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Phi is defined as `(1 + sqrt(5)) / 2` and is approximately 1.618034...',
+  examples: ['phi'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js
new file mode 100644
index 0000000..c34ae2e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/pi.js
@@ -0,0 +1,8 @@
+export var piDocs = {
+  name: 'pi',
+  category: 'Constants',
+  syntax: ['pi'],
+  description: 'The number pi is a mathematical constant that is the ratio of a circle\'s circumference to its diameter, and is approximately equal to 3.14159',
+  examples: ['pi', 'sin(pi/2)'],
+  seealso: ['tau']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js
new file mode 100644
index 0000000..0256449
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/tau.js
@@ -0,0 +1,8 @@
+export var tauDocs = {
+  name: 'tau',
+  category: 'Constants',
+  syntax: ['tau'],
+  description: 'Tau is the ratio constant of a circle\'s circumference to radius, equal to 2 * pi, approximately 6.2832.',
+  examples: ['tau', '2 * pi'],
+  seealso: ['pi']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js
new file mode 100644
index 0000000..52c8f1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/true.js
@@ -0,0 +1,8 @@
+export var trueDocs = {
+  name: 'true',
+  category: 'Constants',
+  syntax: ['true'],
+  description: 'Boolean value true',
+  examples: ['true'],
+  seealso: ['false']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js
new file mode 100644
index 0000000..c58c20a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/constants/version.js
@@ -0,0 +1,8 @@
+export var versionDocs = {
+  name: 'version',
+  category: 'Constants',
+  syntax: ['version'],
+  description: 'A string with the version number of math.js',
+  examples: ['version'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bigint.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bigint.js
new file mode 100644
index 0000000..8d965b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bigint.js
@@ -0,0 +1,8 @@
+export var bigintDocs = {
+  name: 'bigint',
+  category: 'Construction',
+  syntax: ['bigint(x)'],
+  description: 'Create a bigint, an integer with an arbitrary number of digits, from a number or string.',
+  examples: ['123123123123123123 # a large number will lose digits', 'bigint("123123123123123123")', 'bignumber(["1", "3", "5"])'],
+  seealso: ['boolean', 'bignumber', 'number', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js
new file mode 100644
index 0000000..e2e58e8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/bignumber.js
@@ -0,0 +1,8 @@
+export var bignumberDocs = {
+  name: 'bignumber',
+  category: 'Construction',
+  syntax: ['bignumber(x)'],
+  description: 'Create a big number from a number or string.',
+  examples: ['0.1 + 0.2', 'bignumber(0.1) + bignumber(0.2)', 'bignumber("7.2")', 'bignumber("7.2e500")', 'bignumber([0.1, 0.2, 0.3])'],
+  seealso: ['boolean', 'bigint', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js
new file mode 100644
index 0000000..38f2053
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/boolean.js
@@ -0,0 +1,8 @@
+export var booleanDocs = {
+  name: 'boolean',
+  category: 'Construction',
+  syntax: ['x', 'boolean(x)'],
+  description: 'Convert a string or number into a boolean.',
+  examples: ['boolean(0)', 'boolean(1)', 'boolean(3)', 'boolean("true")', 'boolean("false")', 'boolean([1, 0, 1, 1])'],
+  seealso: ['bignumber', 'complex', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js
new file mode 100644
index 0000000..abbc0f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/complex.js
@@ -0,0 +1,8 @@
+export var complexDocs = {
+  name: 'complex',
+  category: 'Construction',
+  syntax: ['complex()', 'complex(re, im)', 'complex(string)'],
+  description: 'Create a complex number.',
+  examples: ['complex()', 'complex(2, 3)', 'complex("7 - 2i")'],
+  seealso: ['bignumber', 'boolean', 'index', 'matrix', 'number', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js
new file mode 100644
index 0000000..444836d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/createUnit.js
@@ -0,0 +1,8 @@
+export var createUnitDocs = {
+  name: 'createUnit',
+  category: 'Construction',
+  syntax: ['createUnit(definitions)', 'createUnit(name, definition)'],
+  description: 'Create a user-defined unit and register it with the Unit type.',
+  examples: ['createUnit("foo")', 'createUnit("knot", {definition: "0.514444444 m/s", aliases: ["knots", "kt", "kts"]})', 'createUnit("mph", "1 mile/hour")'],
+  seealso: ['unit', 'splitUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js
new file mode 100644
index 0000000..922eb1a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/fraction.js
@@ -0,0 +1,8 @@
+export var fractionDocs = {
+  name: 'fraction',
+  category: 'Construction',
+  syntax: ['fraction(num)', 'fraction(matrix)', 'fraction(num,den)', 'fraction({n: num, d: den})'],
+  description: 'Create a fraction from a number or from integer numerator and denominator.',
+  examples: ['fraction(0.125)', 'fraction(1, 3) + fraction(2, 5)', 'fraction({n: 333, d: 53})', 'fraction([sqrt(9), sqrt(10), sqrt(11)])'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js
new file mode 100644
index 0000000..f0f9389
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/index.js
@@ -0,0 +1,8 @@
+export var indexDocs = {
+  name: 'index',
+  category: 'Construction',
+  syntax: ['[start]', '[start:end]', '[start:step:end]', '[start1, start 2, ...]', '[start1:end1, start2:end2, ...]', '[start1:step1:end1, start2:step2:end2, ...]'],
+  description: 'Create an index to get or replace a subset of a matrix',
+  examples: ['A = [1, 2, 3; 4, 5, 6]', 'A[1, :]', 'A[1, 2] = 50', 'A[1:2, 1:2] = 1', 'B = [1, 2, 3]', 'B[B>1 and B<3]'],
+  seealso: ['bignumber', 'boolean', 'complex', 'matrix', 'number', 'range', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js
new file mode 100644
index 0000000..bb51892
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/matrix.js
@@ -0,0 +1,8 @@
+export var matrixDocs = {
+  name: 'matrix',
+  category: 'Construction',
+  syntax: ['[]', '[a1, b1, ...; a2, b2, ...]', 'matrix()', 'matrix("dense")', 'matrix([...])'],
+  description: 'Create a matrix.',
+  examples: ['[]', '[1, 2, 3]', '[1, 2, 3; 4, 5, 6]', 'matrix()', 'matrix([3, 4])', 'matrix([3, 4; 5, 6], "sparse")', 'matrix([3, 4; 5, 6], "sparse", "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js
new file mode 100644
index 0000000..4219ce5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/number.js
@@ -0,0 +1,8 @@
+export var numberDocs = {
+  name: 'number',
+  category: 'Construction',
+  syntax: ['x', 'number(x)', 'number(unit, valuelessUnit)'],
+  description: 'Create a number or convert a string or boolean into a number.',
+  examples: ['2', '2e3', '4.05', 'number(2)', 'number("7.2")', 'number(true)', 'number([true, false, true, true])', 'number(unit("52cm"), "m")'],
+  seealso: ['bignumber', 'bigint', 'boolean', 'complex', 'fraction', 'index', 'matrix', 'string', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js
new file mode 100644
index 0000000..b6a776c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/sparse.js
@@ -0,0 +1,8 @@
+export var sparseDocs = {
+  name: 'sparse',
+  category: 'Construction',
+  syntax: ['sparse()', 'sparse([a1, b1, ...; a1, b2, ...])', 'sparse([a1, b1, ...; a1, b2, ...], "number")'],
+  description: 'Create a sparse matrix.',
+  examples: ['sparse()', 'sparse([3, 4; 5, 6])', 'sparse([3, 0; 5, 0], "number")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'number', 'string', 'unit', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js
new file mode 100644
index 0000000..2b1354b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/splitUnit.js
@@ -0,0 +1,8 @@
+export var splitUnitDocs = {
+  name: 'splitUnit',
+  category: 'Construction',
+  syntax: ['splitUnit(unit: Unit, parts: Unit[])'],
+  description: 'Split a unit in an array of units whose sum is equal to the original unit.',
+  examples: ['splitUnit(1 m, ["feet", "inch"])'],
+  seealso: ['unit', 'createUnit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js
new file mode 100644
index 0000000..deb8406
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/string.js
@@ -0,0 +1,8 @@
+export var stringDocs = {
+  name: 'string',
+  category: 'Construction',
+  syntax: ['"text"', 'string(x)'],
+  description: 'Create a string or convert a value to a string',
+  examples: ['"Hello World!"', 'string(4.2)', 'string(3 + 2i)'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'unit']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js
new file mode 100644
index 0000000..197f655
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/construction/unit.js
@@ -0,0 +1,8 @@
+export var unitDocs = {
+  name: 'unit',
+  category: 'Construction',
+  syntax: ['value unit', 'unit(value, unit)', 'unit(string)'],
+  description: 'Create a unit.',
+  examples: ['5.5 mm', '3 inch', 'unit(7.1, "kilogram")', 'unit("23 deg")'],
+  seealso: ['bignumber', 'boolean', 'complex', 'index', 'matrix', 'number', 'string']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js
new file mode 100644
index 0000000..3864bfd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/config.js
@@ -0,0 +1,8 @@
+export var configDocs = {
+  name: 'config',
+  category: 'Core',
+  syntax: ['config()', 'config(options)'],
+  description: 'Get configuration or change configuration.',
+  examples: ['config()', '1/3 + 1/4', 'config({number: "Fraction"})', '1/3 + 1/4'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js
new file mode 100644
index 0000000..35df7c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/import.js
@@ -0,0 +1,8 @@
+export var importDocs = {
+  name: 'import',
+  category: 'Core',
+  syntax: ['import(functions)', 'import(functions, options)'],
+  description: 'Import functions or constants from an object.',
+  examples: ['import({myFn: f(x)=x^2, myConstant: 32 })', 'myFn(2)', 'myConstant'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js
new file mode 100644
index 0000000..1e73879
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/core/typed.js
@@ -0,0 +1,8 @@
+export var typedDocs = {
+  name: 'typed',
+  category: 'Core',
+  syntax: ['typed(signatures)', 'typed(name, signatures)'],
+  description: 'Create a typed function.',
+  examples: ['double = typed({ "number": f(x)=x+x, "string": f(x)=concat(x,x) })', 'double(2)', 'double("hello")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js
new file mode 100644
index 0000000..0b73b88
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/embeddedDocs.js
@@ -0,0 +1,736 @@
+import { eDocs } from './constants/e.js';
+import { falseDocs } from './constants/false.js';
+import { iDocs } from './constants/i.js';
+import { InfinityDocs } from './constants/Infinity.js';
+import { LN10Docs } from './constants/LN10.js';
+import { LN2Docs } from './constants/LN2.js';
+import { LOG10EDocs } from './constants/LOG10E.js';
+import { LOG2EDocs } from './constants/LOG2E.js';
+import { NaNDocs } from './constants/NaN.js';
+import { nullDocs } from './constants/null.js';
+import { phiDocs } from './constants/phi.js';
+import { piDocs } from './constants/pi.js';
+import { SQRT12Docs } from './constants/SQRT1_2.js';
+import { SQRT2Docs } from './constants/SQRT2.js';
+import { tauDocs } from './constants/tau.js';
+import { trueDocs } from './constants/true.js';
+import { versionDocs } from './constants/version.js';
+import { bignumberDocs } from './construction/bignumber.js';
+import { bigintDocs } from './construction/bigint.js';
+import { booleanDocs } from './construction/boolean.js';
+import { complexDocs } from './construction/complex.js';
+import { createUnitDocs } from './construction/createUnit.js';
+import { fractionDocs } from './construction/fraction.js';
+import { indexDocs } from './construction/index.js';
+import { matrixDocs } from './construction/matrix.js';
+import { numberDocs } from './construction/number.js';
+import { sparseDocs } from './construction/sparse.js';
+import { splitUnitDocs } from './construction/splitUnit.js';
+import { stringDocs } from './construction/string.js';
+import { unitDocs } from './construction/unit.js';
+import { configDocs } from './core/config.js';
+import { importDocs } from './core/import.js';
+import { typedDocs } from './core/typed.js';
+import { derivativeDocs } from './function/algebra/derivative.js';
+import { leafCountDocs } from './function/algebra/leafCount.js';
+import { lsolveDocs } from './function/algebra/lsolve.js';
+import { lsolveAllDocs } from './function/algebra/lsolveAll.js';
+import { lupDocs } from './function/algebra/lup.js';
+import { lusolveDocs } from './function/algebra/lusolve.js';
+import { polynomialRootDocs } from './function/algebra/polynomialRoot.js';
+import { qrDocs } from './function/algebra/qr.js';
+import { rationalizeDocs } from './function/algebra/rationalize.js';
+import { resolveDocs } from './function/algebra/resolve.js';
+import { simplifyDocs } from './function/algebra/simplify.js';
+import { simplifyConstantDocs } from './function/algebra/simplifyConstant.js';
+import { simplifyCoreDocs } from './function/algebra/simplifyCore.js';
+import { sluDocs } from './function/algebra/slu.js';
+import { symbolicEqualDocs } from './function/algebra/symbolicEqual.js';
+import { usolveDocs } from './function/algebra/usolve.js';
+import { usolveAllDocs } from './function/algebra/usolveAll.js';
+import { absDocs } from './function/arithmetic/abs.js';
+import { addDocs } from './function/arithmetic/add.js';
+import { cbrtDocs } from './function/arithmetic/cbrt.js';
+import { ceilDocs } from './function/arithmetic/ceil.js';
+import { cubeDocs } from './function/arithmetic/cube.js';
+import { divideDocs } from './function/arithmetic/divide.js';
+import { dotDivideDocs } from './function/arithmetic/dotDivide.js';
+import { dotMultiplyDocs } from './function/arithmetic/dotMultiply.js';
+import { dotPowDocs } from './function/arithmetic/dotPow.js';
+import { expDocs } from './function/arithmetic/exp.js';
+import { expmDocs } from './function/arithmetic/expm.js';
+import { expm1Docs } from './function/arithmetic/expm1.js';
+import { fixDocs } from './function/arithmetic/fix.js';
+import { floorDocs } from './function/arithmetic/floor.js';
+import { gcdDocs } from './function/arithmetic/gcd.js';
+import { hypotDocs } from './function/arithmetic/hypot.js';
+import { invmodDocs } from './function/arithmetic/invmod.js';
+import { lcmDocs } from './function/arithmetic/lcm.js';
+import { logDocs } from './function/arithmetic/log.js';
+import { log10Docs } from './function/arithmetic/log10.js';
+import { log1pDocs } from './function/arithmetic/log1p.js';
+import { log2Docs } from './function/arithmetic/log2.js';
+import { modDocs } from './function/arithmetic/mod.js';
+import { multiplyDocs } from './function/arithmetic/multiply.js';
+import { normDocs } from './function/arithmetic/norm.js';
+import { nthRootDocs } from './function/arithmetic/nthRoot.js';
+import { nthRootsDocs } from './function/arithmetic/nthRoots.js';
+import { powDocs } from './function/arithmetic/pow.js';
+import { roundDocs } from './function/arithmetic/round.js';
+import { signDocs } from './function/arithmetic/sign.js';
+import { sqrtDocs } from './function/arithmetic/sqrt.js';
+import { sqrtmDocs } from './function/arithmetic/sqrtm.js';
+import { sylvesterDocs } from './function/algebra/sylvester.js';
+import { schurDocs } from './function/algebra/schur.js';
+import { lyapDocs } from './function/algebra/lyap.js';
+import { squareDocs } from './function/arithmetic/square.js';
+import { subtractDocs } from './function/arithmetic/subtract.js';
+import { unaryMinusDocs } from './function/arithmetic/unaryMinus.js';
+import { unaryPlusDocs } from './function/arithmetic/unaryPlus.js';
+import { xgcdDocs } from './function/arithmetic/xgcd.js';
+import { bitAndDocs } from './function/bitwise/bitAnd.js';
+import { bitNotDocs } from './function/bitwise/bitNot.js';
+import { bitOrDocs } from './function/bitwise/bitOr.js';
+import { bitXorDocs } from './function/bitwise/bitXor.js';
+import { leftShiftDocs } from './function/bitwise/leftShift.js';
+import { rightArithShiftDocs } from './function/bitwise/rightArithShift.js';
+import { rightLogShiftDocs } from './function/bitwise/rightLogShift.js';
+import { bellNumbersDocs } from './function/combinatorics/bellNumbers.js';
+import { catalanDocs } from './function/combinatorics/catalan.js';
+import { compositionDocs } from './function/combinatorics/composition.js';
+import { stirlingS2Docs } from './function/combinatorics/stirlingS2.js';
+import { argDocs } from './function/complex/arg.js';
+import { conjDocs } from './function/complex/conj.js';
+import { imDocs } from './function/complex/im.js';
+import { reDocs } from './function/complex/re.js';
+import { evaluateDocs } from './function/expression/evaluate.js';
+import { parserDocs } from './function/expression/parser.js';
+import { parseDocs } from './function/expression/parse.js';
+import { compileDocs } from './function/expression/compile.js';
+import { helpDocs } from './function/expression/help.js';
+import { distanceDocs } from './function/geometry/distance.js';
+import { intersectDocs } from './function/geometry/intersect.js';
+import { andDocs } from './function/logical/and.js';
+import { notDocs } from './function/logical/not.js';
+import { nullishDocs } from './function/logical/nullish.js';
+import { orDocs } from './function/logical/or.js';
+import { xorDocs } from './function/logical/xor.js';
+import { mapSlicesDocs } from './function/matrix/mapSlices.js';
+import { columnDocs } from './function/matrix/column.js';
+import { concatDocs } from './function/matrix/concat.js';
+import { countDocs } from './function/matrix/count.js';
+import { crossDocs } from './function/matrix/cross.js';
+import { ctransposeDocs } from './function/matrix/ctranspose.js';
+import { detDocs } from './function/matrix/det.js';
+import { diagDocs } from './function/matrix/diag.js';
+import { diffDocs } from './function/matrix/diff.js';
+import { dotDocs } from './function/matrix/dot.js';
+import { eigsDocs } from './function/matrix/eigs.js';
+import { filterDocs } from './function/matrix/filter.js';
+import { flattenDocs } from './function/matrix/flatten.js';
+import { forEachDocs } from './function/matrix/forEach.js';
+import { getMatrixDataTypeDocs } from './function/matrix/getMatrixDataType.js';
+import { identityDocs } from './function/matrix/identity.js';
+import { invDocs } from './function/matrix/inv.js';
+import { pinvDocs } from './function/matrix/pinv.js';
+import { kronDocs } from './function/matrix/kron.js';
+import { mapDocs } from './function/matrix/map.js';
+import { matrixFromColumnsDocs } from './function/matrix/matrixFromColumns.js';
+import { matrixFromFunctionDocs } from './function/matrix/matrixFromFunction.js';
+import { matrixFromRowsDocs } from './function/matrix/matrixFromRows.js';
+import { onesDocs } from './function/matrix/ones.js';
+import { partitionSelectDocs } from './function/matrix/partitionSelect.js';
+import { rangeDocs } from './function/matrix/range.js';
+import { reshapeDocs } from './function/matrix/reshape.js';
+import { resizeDocs } from './function/matrix/resize.js';
+import { rotateDocs } from './function/matrix/rotate.js';
+import { rotationMatrixDocs } from './function/matrix/rotationMatrix.js';
+import { rowDocs } from './function/matrix/row.js';
+import { sizeDocs } from './function/matrix/size.js';
+import { sortDocs } from './function/matrix/sort.js';
+import { squeezeDocs } from './function/matrix/squeeze.js';
+import { subsetDocs } from './function/matrix/subset.js';
+import { traceDocs } from './function/matrix/trace.js';
+import { transposeDocs } from './function/matrix/transpose.js';
+import { zerosDocs } from './function/matrix/zeros.js';
+import { fftDocs } from './function/matrix/fft.js';
+import { ifftDocs } from './function/matrix/ifft.js';
+import { combinationsDocs } from './function/probability/combinations.js';
+import { combinationsWithRepDocs } from './function/probability/combinationsWithRep.js';
+import { factorialDocs } from './function/probability/factorial.js';
+import { gammaDocs } from './function/probability/gamma.js';
+import { lgammaDocs } from './function/probability/lgamma.js';
+import { kldivergenceDocs } from './function/probability/kldivergence.js';
+import { multinomialDocs } from './function/probability/multinomial.js';
+import { permutationsDocs } from './function/probability/permutations.js';
+import { pickRandomDocs } from './function/probability/pickRandom.js';
+import { randomDocs } from './function/probability/random.js';
+import { randomIntDocs } from './function/probability/randomInt.js';
+import { compareDocs } from './function/relational/compare.js';
+import { compareNaturalDocs } from './function/relational/compareNatural.js';
+import { compareTextDocs } from './function/relational/compareText.js';
+import { deepEqualDocs } from './function/relational/deepEqual.js';
+import { equalDocs } from './function/relational/equal.js';
+import { equalTextDocs } from './function/relational/equalText.js';
+import { largerDocs } from './function/relational/larger.js';
+import { largerEqDocs } from './function/relational/largerEq.js';
+import { smallerDocs } from './function/relational/smaller.js';
+import { smallerEqDocs } from './function/relational/smallerEq.js';
+import { unequalDocs } from './function/relational/unequal.js';
+import { setCartesianDocs } from './function/set/setCartesian.js';
+import { setDifferenceDocs } from './function/set/setDifference.js';
+import { setDistinctDocs } from './function/set/setDistinct.js';
+import { setIntersectDocs } from './function/set/setIntersect.js';
+import { setIsSubsetDocs } from './function/set/setIsSubset.js';
+import { setMultiplicityDocs } from './function/set/setMultiplicity.js';
+import { setPowersetDocs } from './function/set/setPowerset.js';
+import { setSizeDocs } from './function/set/setSize.js';
+import { setSymDifferenceDocs } from './function/set/setSymDifference.js';
+import { setUnionDocs } from './function/set/setUnion.js';
+import { zpk2tfDocs } from './function/signal/zpk2tf.js';
+import { freqzDocs } from './function/signal/freqz.js';
+import { erfDocs } from './function/special/erf.js';
+import { zetaDocs } from './function/special/zeta.js';
+import { madDocs } from './function/statistics/mad.js';
+import { maxDocs } from './function/statistics/max.js';
+import { meanDocs } from './function/statistics/mean.js';
+import { medianDocs } from './function/statistics/median.js';
+import { minDocs } from './function/statistics/min.js';
+import { modeDocs } from './function/statistics/mode.js';
+import { prodDocs } from './function/statistics/prod.js';
+import { quantileSeqDocs } from './function/statistics/quantileSeq.js';
+import { stdDocs } from './function/statistics/std.js';
+import { cumSumDocs } from './function/statistics/cumsum.js';
+import { sumDocs } from './function/statistics/sum.js';
+import { varianceDocs } from './function/statistics/variance.js';
+import { corrDocs } from './function/statistics/corr.js';
+import { acosDocs } from './function/trigonometry/acos.js';
+import { acoshDocs } from './function/trigonometry/acosh.js';
+import { acotDocs } from './function/trigonometry/acot.js';
+import { acothDocs } from './function/trigonometry/acoth.js';
+import { acscDocs } from './function/trigonometry/acsc.js';
+import { acschDocs } from './function/trigonometry/acsch.js';
+import { asecDocs } from './function/trigonometry/asec.js';
+import { asechDocs } from './function/trigonometry/asech.js';
+import { asinDocs } from './function/trigonometry/asin.js';
+import { asinhDocs } from './function/trigonometry/asinh.js';
+import { atanDocs } from './function/trigonometry/atan.js';
+import { atan2Docs } from './function/trigonometry/atan2.js';
+import { atanhDocs } from './function/trigonometry/atanh.js';
+import { cosDocs } from './function/trigonometry/cos.js';
+import { coshDocs } from './function/trigonometry/cosh.js';
+import { cotDocs } from './function/trigonometry/cot.js';
+import { cothDocs } from './function/trigonometry/coth.js';
+import { cscDocs } from './function/trigonometry/csc.js';
+import { cschDocs } from './function/trigonometry/csch.js';
+import { secDocs } from './function/trigonometry/sec.js';
+import { sechDocs } from './function/trigonometry/sech.js';
+import { sinDocs } from './function/trigonometry/sin.js';
+import { sinhDocs } from './function/trigonometry/sinh.js';
+import { tanDocs } from './function/trigonometry/tan.js';
+import { tanhDocs } from './function/trigonometry/tanh.js';
+import { toDocs } from './function/units/to.js';
+import { toBestDocs } from './function/units/toBest.js';
+import { binDocs } from './function/utils/bin.js';
+import { cloneDocs } from './function/utils/clone.js';
+import { formatDocs } from './function/utils/format.js';
+import { hasNumericValueDocs } from './function/utils/hasNumericValue.js';
+import { hexDocs } from './function/utils/hex.js';
+import { isIntegerDocs } from './function/utils/isInteger.js';
+import { isNaNDocs } from './function/utils/isNaN.js';
+import { isNegativeDocs } from './function/utils/isNegative.js';
+import { isNumericDocs } from './function/utils/isNumeric.js';
+import { isPositiveDocs } from './function/utils/isPositive.js';
+import { isPrimeDocs } from './function/utils/isPrime.js';
+import { isZeroDocs } from './function/utils/isZero.js';
+import { numericDocs } from './function/utils/numeric.js';
+import { octDocs } from './function/utils/oct.js';
+import { printDocs } from './function/utils/print.js';
+import { typeOfDocs } from './function/utils/typeOf.js';
+import { solveODEDocs } from './function/numeric/solveODE.js';
+export var embeddedDocs = {
+  // construction functions
+  bignumber: bignumberDocs,
+  bigint: bigintDocs,
+  boolean: booleanDocs,
+  complex: complexDocs,
+  createUnit: createUnitDocs,
+  fraction: fractionDocs,
+  index: indexDocs,
+  matrix: matrixDocs,
+  number: numberDocs,
+  sparse: sparseDocs,
+  splitUnit: splitUnitDocs,
+  string: stringDocs,
+  unit: unitDocs,
+  // constants
+  e: eDocs,
+  E: eDocs,
+  false: falseDocs,
+  i: iDocs,
+  Infinity: InfinityDocs,
+  LN2: LN2Docs,
+  LN10: LN10Docs,
+  LOG2E: LOG2EDocs,
+  LOG10E: LOG10EDocs,
+  NaN: NaNDocs,
+  null: nullDocs,
+  pi: piDocs,
+  PI: piDocs,
+  phi: phiDocs,
+  SQRT1_2: SQRT12Docs,
+  SQRT2: SQRT2Docs,
+  tau: tauDocs,
+  true: trueDocs,
+  version: versionDocs,
+  // physical constants
+  // TODO: more detailed docs for physical constants
+  speedOfLight: {
+    description: 'Speed of light in vacuum',
+    examples: ['speedOfLight']
+  },
+  gravitationConstant: {
+    description: 'Newtonian constant of gravitation',
+    examples: ['gravitationConstant']
+  },
+  planckConstant: {
+    description: 'Planck constant',
+    examples: ['planckConstant']
+  },
+  reducedPlanckConstant: {
+    description: 'Reduced Planck constant',
+    examples: ['reducedPlanckConstant']
+  },
+  magneticConstant: {
+    description: 'Magnetic constant (vacuum permeability)',
+    examples: ['magneticConstant']
+  },
+  electricConstant: {
+    description: 'Electric constant (vacuum permeability)',
+    examples: ['electricConstant']
+  },
+  vacuumImpedance: {
+    description: 'Characteristic impedance of vacuum',
+    examples: ['vacuumImpedance']
+  },
+  coulomb: {
+    description: 'Coulomb\'s constant. Deprecated in favor of coulombConstant',
+    examples: ['coulombConstant']
+  },
+  coulombConstant: {
+    description: 'Coulomb\'s constant',
+    examples: ['coulombConstant']
+  },
+  elementaryCharge: {
+    description: 'Elementary charge',
+    examples: ['elementaryCharge']
+  },
+  bohrMagneton: {
+    description: 'Bohr magneton',
+    examples: ['bohrMagneton']
+  },
+  conductanceQuantum: {
+    description: 'Conductance quantum',
+    examples: ['conductanceQuantum']
+  },
+  inverseConductanceQuantum: {
+    description: 'Inverse conductance quantum',
+    examples: ['inverseConductanceQuantum']
+  },
+  // josephson: {description: 'Josephson constant', examples: ['josephson']},
+  magneticFluxQuantum: {
+    description: 'Magnetic flux quantum',
+    examples: ['magneticFluxQuantum']
+  },
+  nuclearMagneton: {
+    description: 'Nuclear magneton',
+    examples: ['nuclearMagneton']
+  },
+  klitzing: {
+    description: 'Von Klitzing constant',
+    examples: ['klitzing']
+  },
+  bohrRadius: {
+    description: 'Bohr radius',
+    examples: ['bohrRadius']
+  },
+  classicalElectronRadius: {
+    description: 'Classical electron radius',
+    examples: ['classicalElectronRadius']
+  },
+  electronMass: {
+    description: 'Electron mass',
+    examples: ['electronMass']
+  },
+  fermiCoupling: {
+    description: 'Fermi coupling constant',
+    examples: ['fermiCoupling']
+  },
+  fineStructure: {
+    description: 'Fine-structure constant',
+    examples: ['fineStructure']
+  },
+  hartreeEnergy: {
+    description: 'Hartree energy',
+    examples: ['hartreeEnergy']
+  },
+  protonMass: {
+    description: 'Proton mass',
+    examples: ['protonMass']
+  },
+  deuteronMass: {
+    description: 'Deuteron Mass',
+    examples: ['deuteronMass']
+  },
+  neutronMass: {
+    description: 'Neutron mass',
+    examples: ['neutronMass']
+  },
+  quantumOfCirculation: {
+    description: 'Quantum of circulation',
+    examples: ['quantumOfCirculation']
+  },
+  rydberg: {
+    description: 'Rydberg constant',
+    examples: ['rydberg']
+  },
+  thomsonCrossSection: {
+    description: 'Thomson cross section',
+    examples: ['thomsonCrossSection']
+  },
+  weakMixingAngle: {
+    description: 'Weak mixing angle',
+    examples: ['weakMixingAngle']
+  },
+  efimovFactor: {
+    description: 'Efimov factor',
+    examples: ['efimovFactor']
+  },
+  atomicMass: {
+    description: 'Atomic mass constant',
+    examples: ['atomicMass']
+  },
+  avogadro: {
+    description: 'Avogadro\'s number',
+    examples: ['avogadro']
+  },
+  boltzmann: {
+    description: 'Boltzmann constant',
+    examples: ['boltzmann']
+  },
+  faraday: {
+    description: 'Faraday constant',
+    examples: ['faraday']
+  },
+  firstRadiation: {
+    description: 'First radiation constant',
+    examples: ['firstRadiation']
+  },
+  loschmidt: {
+    description: 'Loschmidt constant at T=273.15 K and p=101.325 kPa',
+    examples: ['loschmidt']
+  },
+  gasConstant: {
+    description: 'Gas constant',
+    examples: ['gasConstant']
+  },
+  molarPlanckConstant: {
+    description: 'Molar Planck constant',
+    examples: ['molarPlanckConstant']
+  },
+  molarVolume: {
+    description: 'Molar volume of an ideal gas at T=273.15 K and p=101.325 kPa',
+    examples: ['molarVolume']
+  },
+  sackurTetrode: {
+    description: 'Sackur-Tetrode constant at T=1 K and p=101.325 kPa',
+    examples: ['sackurTetrode']
+  },
+  secondRadiation: {
+    description: 'Second radiation constant',
+    examples: ['secondRadiation']
+  },
+  stefanBoltzmann: {
+    description: 'Stefan-Boltzmann constant',
+    examples: ['stefanBoltzmann']
+  },
+  wienDisplacement: {
+    description: 'Wien displacement law constant',
+    examples: ['wienDisplacement']
+  },
+  // spectralRadiance: {description: 'First radiation constant for spectral radiance', examples: ['spectralRadiance']},
+
+  molarMass: {
+    description: 'Molar mass constant',
+    examples: ['molarMass']
+  },
+  molarMassC12: {
+    description: 'Molar mass constant of carbon-12',
+    examples: ['molarMassC12']
+  },
+  gravity: {
+    description: 'Standard acceleration of gravity (standard acceleration of free-fall on Earth)',
+    examples: ['gravity']
+  },
+  planckLength: {
+    description: 'Planck length',
+    examples: ['planckLength']
+  },
+  planckMass: {
+    description: 'Planck mass',
+    examples: ['planckMass']
+  },
+  planckTime: {
+    description: 'Planck time',
+    examples: ['planckTime']
+  },
+  planckCharge: {
+    description: 'Planck charge',
+    examples: ['planckCharge']
+  },
+  planckTemperature: {
+    description: 'Planck temperature',
+    examples: ['planckTemperature']
+  },
+  // functions - algebra
+  derivative: derivativeDocs,
+  lsolve: lsolveDocs,
+  lsolveAll: lsolveAllDocs,
+  lup: lupDocs,
+  lusolve: lusolveDocs,
+  leafCount: leafCountDocs,
+  polynomialRoot: polynomialRootDocs,
+  resolve: resolveDocs,
+  simplify: simplifyDocs,
+  simplifyConstant: simplifyConstantDocs,
+  simplifyCore: simplifyCoreDocs,
+  symbolicEqual: symbolicEqualDocs,
+  rationalize: rationalizeDocs,
+  slu: sluDocs,
+  usolve: usolveDocs,
+  usolveAll: usolveAllDocs,
+  qr: qrDocs,
+  // functions - arithmetic
+  abs: absDocs,
+  add: addDocs,
+  cbrt: cbrtDocs,
+  ceil: ceilDocs,
+  cube: cubeDocs,
+  divide: divideDocs,
+  dotDivide: dotDivideDocs,
+  dotMultiply: dotMultiplyDocs,
+  dotPow: dotPowDocs,
+  exp: expDocs,
+  expm: expmDocs,
+  expm1: expm1Docs,
+  fix: fixDocs,
+  floor: floorDocs,
+  gcd: gcdDocs,
+  hypot: hypotDocs,
+  lcm: lcmDocs,
+  log: logDocs,
+  log2: log2Docs,
+  log1p: log1pDocs,
+  log10: log10Docs,
+  mod: modDocs,
+  multiply: multiplyDocs,
+  norm: normDocs,
+  nthRoot: nthRootDocs,
+  nthRoots: nthRootsDocs,
+  pow: powDocs,
+  round: roundDocs,
+  sign: signDocs,
+  sqrt: sqrtDocs,
+  sqrtm: sqrtmDocs,
+  square: squareDocs,
+  subtract: subtractDocs,
+  unaryMinus: unaryMinusDocs,
+  unaryPlus: unaryPlusDocs,
+  xgcd: xgcdDocs,
+  invmod: invmodDocs,
+  // functions - bitwise
+  bitAnd: bitAndDocs,
+  bitNot: bitNotDocs,
+  bitOr: bitOrDocs,
+  bitXor: bitXorDocs,
+  leftShift: leftShiftDocs,
+  rightArithShift: rightArithShiftDocs,
+  rightLogShift: rightLogShiftDocs,
+  // functions - combinatorics
+  bellNumbers: bellNumbersDocs,
+  catalan: catalanDocs,
+  composition: compositionDocs,
+  stirlingS2: stirlingS2Docs,
+  // functions - core
+  config: configDocs,
+  import: importDocs,
+  typed: typedDocs,
+  // functions - complex
+  arg: argDocs,
+  conj: conjDocs,
+  re: reDocs,
+  im: imDocs,
+  // functions - expression
+  evaluate: evaluateDocs,
+  help: helpDocs,
+  parse: parseDocs,
+  parser: parserDocs,
+  compile: compileDocs,
+  // functions - geometry
+  distance: distanceDocs,
+  intersect: intersectDocs,
+  // functions - logical
+  and: andDocs,
+  not: notDocs,
+  nullish: nullishDocs,
+  or: orDocs,
+  xor: xorDocs,
+  // functions - matrix
+  mapSlices: mapSlicesDocs,
+  concat: concatDocs,
+  count: countDocs,
+  cross: crossDocs,
+  column: columnDocs,
+  ctranspose: ctransposeDocs,
+  det: detDocs,
+  diag: diagDocs,
+  diff: diffDocs,
+  dot: dotDocs,
+  getMatrixDataType: getMatrixDataTypeDocs,
+  identity: identityDocs,
+  filter: filterDocs,
+  flatten: flattenDocs,
+  forEach: forEachDocs,
+  inv: invDocs,
+  pinv: pinvDocs,
+  eigs: eigsDocs,
+  kron: kronDocs,
+  matrixFromFunction: matrixFromFunctionDocs,
+  matrixFromRows: matrixFromRowsDocs,
+  matrixFromColumns: matrixFromColumnsDocs,
+  map: mapDocs,
+  ones: onesDocs,
+  partitionSelect: partitionSelectDocs,
+  range: rangeDocs,
+  resize: resizeDocs,
+  reshape: reshapeDocs,
+  rotate: rotateDocs,
+  rotationMatrix: rotationMatrixDocs,
+  row: rowDocs,
+  size: sizeDocs,
+  sort: sortDocs,
+  squeeze: squeezeDocs,
+  subset: subsetDocs,
+  trace: traceDocs,
+  transpose: transposeDocs,
+  zeros: zerosDocs,
+  fft: fftDocs,
+  ifft: ifftDocs,
+  sylvester: sylvesterDocs,
+  schur: schurDocs,
+  lyap: lyapDocs,
+  // functions - numeric
+  solveODE: solveODEDocs,
+  // functions - probability
+  combinations: combinationsDocs,
+  combinationsWithRep: combinationsWithRepDocs,
+  // distribution: distributionDocs,
+  factorial: factorialDocs,
+  gamma: gammaDocs,
+  kldivergence: kldivergenceDocs,
+  lgamma: lgammaDocs,
+  multinomial: multinomialDocs,
+  permutations: permutationsDocs,
+  pickRandom: pickRandomDocs,
+  random: randomDocs,
+  randomInt: randomIntDocs,
+  // functions - relational
+  compare: compareDocs,
+  compareNatural: compareNaturalDocs,
+  compareText: compareTextDocs,
+  deepEqual: deepEqualDocs,
+  equal: equalDocs,
+  equalText: equalTextDocs,
+  larger: largerDocs,
+  largerEq: largerEqDocs,
+  smaller: smallerDocs,
+  smallerEq: smallerEqDocs,
+  unequal: unequalDocs,
+  // functions - set
+  setCartesian: setCartesianDocs,
+  setDifference: setDifferenceDocs,
+  setDistinct: setDistinctDocs,
+  setIntersect: setIntersectDocs,
+  setIsSubset: setIsSubsetDocs,
+  setMultiplicity: setMultiplicityDocs,
+  setPowerset: setPowersetDocs,
+  setSize: setSizeDocs,
+  setSymDifference: setSymDifferenceDocs,
+  setUnion: setUnionDocs,
+  // functions - signal
+  zpk2tf: zpk2tfDocs,
+  freqz: freqzDocs,
+  // functions - special
+  erf: erfDocs,
+  zeta: zetaDocs,
+  // functions - statistics
+  cumsum: cumSumDocs,
+  mad: madDocs,
+  max: maxDocs,
+  mean: meanDocs,
+  median: medianDocs,
+  min: minDocs,
+  mode: modeDocs,
+  prod: prodDocs,
+  quantileSeq: quantileSeqDocs,
+  std: stdDocs,
+  sum: sumDocs,
+  variance: varianceDocs,
+  corr: corrDocs,
+  // functions - trigonometry
+  acos: acosDocs,
+  acosh: acoshDocs,
+  acot: acotDocs,
+  acoth: acothDocs,
+  acsc: acscDocs,
+  acsch: acschDocs,
+  asec: asecDocs,
+  asech: asechDocs,
+  asin: asinDocs,
+  asinh: asinhDocs,
+  atan: atanDocs,
+  atanh: atanhDocs,
+  atan2: atan2Docs,
+  cos: cosDocs,
+  cosh: coshDocs,
+  cot: cotDocs,
+  coth: cothDocs,
+  csc: cscDocs,
+  csch: cschDocs,
+  sec: secDocs,
+  sech: sechDocs,
+  sin: sinDocs,
+  sinh: sinhDocs,
+  tan: tanDocs,
+  tanh: tanhDocs,
+  // functions - units
+  to: toDocs,
+  toBest: toBestDocs,
+  // functions - utils
+  clone: cloneDocs,
+  format: formatDocs,
+  bin: binDocs,
+  oct: octDocs,
+  hex: hexDocs,
+  isNaN: isNaNDocs,
+  isInteger: isIntegerDocs,
+  isNegative: isNegativeDocs,
+  isNumeric: isNumericDocs,
+  hasNumericValue: hasNumericValueDocs,
+  isPositive: isPositiveDocs,
+  isPrime: isPrimeDocs,
+  isZero: isZeroDocs,
+  print: printDocs,
+  typeOf: typeOfDocs,
+  numeric: numericDocs
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js
new file mode 100644
index 0000000..755c5db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/derivative.js
@@ -0,0 +1,8 @@
+export var derivativeDocs = {
+  name: 'derivative',
+  category: 'Algebra',
+  syntax: ['derivative(expr, variable)', 'derivative(expr, variable, {simplify: boolean})'],
+  description: 'Takes the derivative of an expression expressed in parser Nodes. The derivative will be taken over the supplied variable in the second parameter. If there are multiple variables in the expression, it will return a partial derivative.',
+  examples: ['derivative("2x^3", "x")', 'derivative("2x^3", "x", {simplify: false})', 'derivative("2x^2 + 3x + 4", "x")', 'derivative("sin(2x)", "x")', 'f = parse("x^2 + x")', 'x = parse("x")', 'df = derivative(f, x)', 'df.evaluate({x: 3})'],
+  seealso: ['simplify', 'parse', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js
new file mode 100644
index 0000000..5b7acd8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/leafCount.js
@@ -0,0 +1,8 @@
+export var leafCountDocs = {
+  name: 'leafCount',
+  category: 'Algebra',
+  syntax: ['leafCount(expr)'],
+  description: 'Computes the number of leaves in the parse tree of the given expression',
+  examples: ['leafCount("e^(i*pi)-1")', 'leafCount(parse("{a: 22/7, b: 10^(1/2)}"))'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js
new file mode 100644
index 0000000..e45f544
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolve.js
@@ -0,0 +1,8 @@
+export var lsolveDocs = {
+  name: 'lsolve',
+  category: 'Algebra',
+  syntax: ['x=lsolve(L, b)'],
+  description: 'Finds one solution of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolveAll', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js
new file mode 100644
index 0000000..2bdf1d1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lsolveAll.js
@@ -0,0 +1,8 @@
+export var lsolveAllDocs = {
+  name: 'lsolveAll',
+  category: 'Algebra',
+  syntax: ['x=lsolveAll(L, b)'],
+  description: 'Finds all solutions of the linear system L * x = b where L is an [n x n] lower triangular matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lsolve(a, b)'],
+  seealso: ['lsolve', 'lup', 'lusolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js
new file mode 100644
index 0000000..4b3af50
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lup.js
@@ -0,0 +1,8 @@
+export var lupDocs = {
+  name: 'lup',
+  category: 'Algebra',
+  syntax: ['lup(m)'],
+  description: 'Calculate the Matrix LU decomposition with partial pivoting. Matrix A is decomposed in three matrices (L, U, P) where P * A = L * U',
+  examples: ['lup([[2, 1], [1, 4]])', 'lup(matrix([[2, 1], [1, 4]]))', 'lup(sparse([[2, 1], [1, 4]]))'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'slu', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js
new file mode 100644
index 0000000..25a4709
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lusolve.js
@@ -0,0 +1,8 @@
+export var lusolveDocs = {
+  name: 'lusolve',
+  category: 'Algebra',
+  syntax: ['x=lusolve(A, b)', 'x=lusolve(lu, b)'],
+  description: 'Solves the linear system A * x = b where A is an [n x n] matrix and b is a [n] column vector.',
+  examples: ['a = [-2, 3; 2, 1]', 'b = [11, 9]', 'x = lusolve(a, b)'],
+  seealso: ['lup', 'slu', 'lsolve', 'usolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lyap.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lyap.js
new file mode 100644
index 0000000..5d92c34
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/lyap.js
@@ -0,0 +1,8 @@
+export var lyapDocs = {
+  name: 'lyap',
+  category: 'Algebra',
+  syntax: ['lyap(A,Q)'],
+  description: 'Solves the Continuous-time Lyapunov equation AP+PA\'+Q=0 for P',
+  examples: ['lyap([[-2, 0], [1, -4]], [[3, 1], [1, 3]])', 'A = [[-2, 0], [1, -4]]', 'Q = [[3, 1], [1, 3]]', 'lyap(A,Q)'],
+  seealso: ['schur', 'sylvester']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/polynomialRoot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/polynomialRoot.js
new file mode 100644
index 0000000..015c69b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/polynomialRoot.js
@@ -0,0 +1,8 @@
+export var polynomialRootDocs = {
+  name: 'polynomialRoot',
+  category: 'Algebra',
+  syntax: ['x=polynomialRoot(-6, 3)', 'x=polynomialRoot(4, -4, 1)', 'x=polynomialRoot(-8, 12, -6, 1)'],
+  description: 'Finds the roots of a univariate polynomial given by its coefficients starting from constant, linear, and so on, increasing in degree.',
+  examples: ['a = polynomialRoot(-6, 11, -6, 1)'],
+  seealso: ['cbrt', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js
new file mode 100644
index 0000000..f6e2433
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/qr.js
@@ -0,0 +1,8 @@
+export var qrDocs = {
+  name: 'qr',
+  category: 'Algebra',
+  syntax: ['qr(A)'],
+  description: 'Calculates the Matrix QR decomposition. Matrix `A` is decomposed in two matrices (`Q`, `R`) where `Q` is an orthogonal matrix and `R` is an upper triangular matrix.',
+  examples: ['qr([[1, -1,  4], [1,  4, -2], [1,  4,  2], [1,  -1, 0]])'],
+  seealso: ['lup', 'slu', 'matrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js
new file mode 100644
index 0000000..0e93662
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/rationalize.js
@@ -0,0 +1,8 @@
+export var rationalizeDocs = {
+  name: 'rationalize',
+  category: 'Algebra',
+  syntax: ['rationalize(expr)', 'rationalize(expr, scope)', 'rationalize(expr, scope, detailed)'],
+  description: 'Transform a rationalizable expression in a rational fraction. If rational fraction is one variable polynomial then converts the numerator and denominator in canonical form, with decreasing exponents, returning the coefficients of numerator.',
+  examples: ['rationalize("2x/y - y/(x+1)")', 'rationalize("2x/y - y/(x+1)", true)'],
+  seealso: ['simplify']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js
new file mode 100644
index 0000000..05cf54d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/resolve.js
@@ -0,0 +1,9 @@
+export var resolveDocs = {
+  name: 'resolve',
+  category: 'Algebra',
+  syntax: ['resolve(node, scope)'],
+  description: 'Recursively substitute variables in an expression tree.',
+  examples: ['resolve(parse("1 + x"), { x: 7 })', 'resolve(parse("size(text)"), { text: "Hello World" })', 'resolve(parse("x + y"), { x: parse("3z") })', 'resolve(parse("3x"), { x: parse("y+z"), z: parse("w^y") })'],
+  seealso: ['simplify', 'evaluate'],
+  mayThrow: ['ReferenceError']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/schur.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/schur.js
new file mode 100644
index 0000000..45de73d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/schur.js
@@ -0,0 +1,8 @@
+export var schurDocs = {
+  name: 'schur',
+  category: 'Algebra',
+  syntax: ['schur(A)'],
+  description: 'Performs a real Schur decomposition of the real matrix A = UTU\'',
+  examples: ['schur([[1, 0], [-4, 3]])', 'A = [[1, 0], [-4, 3]]', 'schur(A)'],
+  seealso: ['lyap', 'sylvester']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js
new file mode 100644
index 0000000..a777a97
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplify.js
@@ -0,0 +1,8 @@
+export var simplifyDocs = {
+  name: 'simplify',
+  category: 'Algebra',
+  syntax: ['simplify(expr)', 'simplify(expr, rules)'],
+  description: 'Simplify an expression tree.',
+  examples: ['simplify("3 + 2 / 4")', 'simplify("2x + x")', 'f = parse("x * (x + 2 + x)")', 'simplified = simplify(f)', 'simplified.evaluate({x: 2})'],
+  seealso: ['simplifyCore', 'derivative', 'evaluate', 'parse', 'rationalize', 'resolve']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyConstant.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyConstant.js
new file mode 100644
index 0000000..8881281
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyConstant.js
@@ -0,0 +1,8 @@
+export var simplifyConstantDocs = {
+  name: 'simplifyConstant',
+  category: 'Algebra',
+  syntax: ['simplifyConstant(expr)', 'simplifyConstant(expr, options)'],
+  description: 'Replace constant subexpressions of node with their values.',
+  examples: ['simplifyConstant("(3-3)*x")', 'simplifyConstant(parse("z-cos(tau/8)"))'],
+  seealso: ['simplify', 'simplifyCore', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..4eed2a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/simplifyCore.js
@@ -0,0 +1,8 @@
+export var simplifyCoreDocs = {
+  name: 'simplifyCore',
+  category: 'Algebra',
+  syntax: ['simplifyCore(node)'],
+  description: 'Perform simple one-pass simplifications on an expression tree.',
+  examples: ['simplifyCore(parse("0*x"))', 'simplifyCore(parse("(x+0)*2"))'],
+  seealso: ['simplify', 'simplifyConstant', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js
new file mode 100644
index 0000000..f1527e2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/slu.js
@@ -0,0 +1,8 @@
+export var sluDocs = {
+  name: 'slu',
+  category: 'Algebra',
+  syntax: ['slu(A, order, threshold)'],
+  description: 'Calculate the Matrix LU decomposition with full pivoting. Matrix A is decomposed in two matrices (L, U) and two permutation vectors (pinv, q) where P * A * Q = L * U',
+  examples: ['slu(sparse([4.5, 0, 3.2, 0; 3.1, 2.9, 0, 0.9; 0, 1.7, 3, 0; 3.5, 0.4, 0, 1]), 1, 0.001)'],
+  seealso: ['lusolve', 'lsolve', 'usolve', 'matrix', 'sparse', 'lup', 'qr']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/sylvester.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/sylvester.js
new file mode 100644
index 0000000..6b42976
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/sylvester.js
@@ -0,0 +1,8 @@
+export var sylvesterDocs = {
+  name: 'sylvester',
+  category: 'Algebra',
+  syntax: ['sylvester(A,B,C)'],
+  description: 'Solves the real-valued Sylvester equation AX+XB=C for X',
+  examples: ['sylvester([[-1, -2], [1, 1]], [[-2, 1], [-1, 2]], [[-3, 2], [3, 0]])', 'A = [[-1, -2], [1, 1]]; B = [[2, -1], [1, -2]]; C = [[-3, 2], [3, 0]]', 'sylvester(A, B, C)'],
+  seealso: ['schur', 'lyap']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..87b25fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/symbolicEqual.js
@@ -0,0 +1,8 @@
+export var symbolicEqualDocs = {
+  name: 'symbolicEqual',
+  category: 'Algebra',
+  syntax: ['symbolicEqual(expr1, expr2)', 'symbolicEqual(expr1, expr2, options)'],
+  description: 'Returns true if the difference of the expressions simplifies to 0',
+  examples: ['symbolicEqual("x*y","y*x")', 'symbolicEqual("abs(x^2)", "x^2")', 'symbolicEqual("abs(x)", "x", {context: {abs: {trivial: true}}})'],
+  seealso: ['simplify', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js
new file mode 100644
index 0000000..4020054
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolve.js
@@ -0,0 +1,8 @@
+export var usolveDocs = {
+  name: 'usolve',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds one solution of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolveAll', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js
new file mode 100644
index 0000000..b05833a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/algebra/usolveAll.js
@@ -0,0 +1,8 @@
+export var usolveAllDocs = {
+  name: 'usolveAll',
+  category: 'Algebra',
+  syntax: ['x=usolve(U, b)'],
+  description: 'Finds all solutions of the linear system U * x = b where U is an [n x n] upper triangular matrix and b is a [n] column vector.',
+  examples: ['x=usolve(sparse([1, 1, 1, 1; 0, 1, 1, 1; 0, 0, 1, 1; 0, 0, 0, 1]), [1; 2; 3; 4])'],
+  seealso: ['usolve', 'lup', 'lusolve', 'lsolve', 'matrix', 'sparse']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js
new file mode 100644
index 0000000..27c8f89
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/abs.js
@@ -0,0 +1,8 @@
+export var absDocs = {
+  name: 'abs',
+  category: 'Arithmetic',
+  syntax: ['abs(x)'],
+  description: 'Compute the absolute value.',
+  examples: ['abs(3.5)', 'abs(-4.2)'],
+  seealso: ['sign']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js
new file mode 100644
index 0000000..50c902b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/add.js
@@ -0,0 +1,8 @@
+export var addDocs = {
+  name: 'add',
+  category: 'Operators',
+  syntax: ['x + y', 'add(x, y)'],
+  description: 'Add two values.',
+  examples: ['a = 2.1 + 3.6', 'a - 3.6', '3 + 2i', '3 cm + 2 inch', '"2.3" + "4"'],
+  seealso: ['subtract']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..225cd12
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cbrt.js
@@ -0,0 +1,8 @@
+export var cbrtDocs = {
+  name: 'cbrt',
+  category: 'Arithmetic',
+  syntax: ['cbrt(x)', 'cbrt(x, allRoots)'],
+  description: 'Compute the cubic root value. If x = y * y * y, then y is the cubic root of x. When `x` is a number or complex number, an optional second argument `allRoots` can be provided to return all three cubic roots. If not provided, the principal root is returned',
+  examples: ['cbrt(64)', 'cube(4)', 'cbrt(-8)', 'cbrt(2 + 3i)', 'cbrt(8i)', 'cbrt(8i, true)', 'cbrt(27 m^3)'],
+  seealso: ['square', 'sqrt', 'cube', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js
new file mode 100644
index 0000000..02c57a7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/ceil.js
@@ -0,0 +1,8 @@
+export var ceilDocs = {
+  name: 'ceil',
+  category: 'Arithmetic',
+  syntax: ['ceil(x)', 'ceil(x, n)', 'ceil(unit, valuelessUnit)', 'ceil(unit, n, valuelessUnit)'],
+  description: 'Round a value towards plus infinity. If x is complex, both real and imaginary part are rounded towards plus infinity.',
+  examples: ['ceil(3.2)', 'ceil(3.8)', 'ceil(-4.2)', 'ceil(3.241cm, cm)', 'ceil(3.241cm, 2, cm)'],
+  seealso: ['floor', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js
new file mode 100644
index 0000000..db2ea35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/cube.js
@@ -0,0 +1,8 @@
+export var cubeDocs = {
+  name: 'cube',
+  category: 'Arithmetic',
+  syntax: ['cube(x)'],
+  description: 'Compute the cube of a value. The cube of x is x * x * x.',
+  examples: ['cube(2)', '2^3', '2 * 2 * 2'],
+  seealso: ['multiply', 'square', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js
new file mode 100644
index 0000000..350eaa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/divide.js
@@ -0,0 +1,8 @@
+export var divideDocs = {
+  name: 'divide',
+  category: 'Operators',
+  syntax: ['x / y', 'divide(x, y)'],
+  description: 'Divide two values.',
+  examples: ['a = 2 / 3', 'a * 3', '4.5 / 2', '3 + 4 / 2', '(3 + 4) / 2', '18 km / 4.5'],
+  seealso: ['multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..d0124ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotDivide.js
@@ -0,0 +1,8 @@
+export var dotDivideDocs = {
+  name: 'dotDivide',
+  category: 'Operators',
+  syntax: ['x ./ y', 'dotDivide(x, y)'],
+  description: 'Divide two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a ./ b'],
+  seealso: ['multiply', 'dotMultiply', 'divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..f66bba9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotMultiply.js
@@ -0,0 +1,8 @@
+export var dotMultiplyDocs = {
+  name: 'dotMultiply',
+  category: 'Operators',
+  syntax: ['x .* y', 'dotMultiply(x, y)'],
+  description: 'Multiply two values element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'b = [2, 1, 1; 3, 2, 5]', 'a .* b'],
+  seealso: ['multiply', 'divide', 'dotDivide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..a977c1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/dotPow.js
@@ -0,0 +1,8 @@
+export var dotPowDocs = {
+  name: 'dotPow',
+  category: 'Operators',
+  syntax: ['x .^ y', 'dotPow(x, y)'],
+  description: 'Calculates the power of x to y element wise.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a .^ 2'],
+  seealso: ['pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js
new file mode 100644
index 0000000..0067c84
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/exp.js
@@ -0,0 +1,8 @@
+export var expDocs = {
+  name: 'exp',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Calculate the exponent of a value.',
+  examples: ['exp(1.3)', 'e ^ 1.3', 'log(exp(1.3))', 'x = 2.4', '(exp(i*x) == cos(x) + i*sin(x))   # Euler\'s formula'],
+  seealso: ['expm', 'expm1', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js
new file mode 100644
index 0000000..8fc045c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm.js
@@ -0,0 +1,8 @@
+export var expmDocs = {
+  name: 'expm',
+  category: 'Arithmetic',
+  syntax: ['exp(x)'],
+  description: 'Compute the matrix exponential, expm(A) = e^A. ' + 'The matrix must be square. ' + 'Not to be confused with exp(a), which performs element-wise exponentiation.',
+  examples: ['expm([[0,2],[0,0]])'],
+  seealso: ['exp']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js
new file mode 100644
index 0000000..28098a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/expm1.js
@@ -0,0 +1,8 @@
+export var expm1Docs = {
+  name: 'expm1',
+  category: 'Arithmetic',
+  syntax: ['expm1(x)'],
+  description: 'Calculate the value of subtracting 1 from the exponential value.',
+  examples: ['expm1(2)', 'pow(e, 2) - 1', 'log(expm1(2) + 1)'],
+  seealso: ['exp', 'pow', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js
new file mode 100644
index 0000000..3859cb5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/fix.js
@@ -0,0 +1,8 @@
+export var fixDocs = {
+  name: 'fix',
+  category: 'Arithmetic',
+  syntax: ['fix(x)', 'fix(x, n)', 'fix(unit, valuelessUnit)', 'fix(unit, n, valuelessUnit)'],
+  description: 'Round a value towards zero. If x is complex, both real and imaginary part are rounded towards zero.',
+  examples: ['fix(3.2)', 'fix(3.8)', 'fix(-4.2)', 'fix(-4.8)', 'fix(3.241cm, cm)', 'fix(3.241cm, 2, cm)'],
+  seealso: ['ceil', 'floor', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js
new file mode 100644
index 0000000..e2f0963
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/floor.js
@@ -0,0 +1,8 @@
+export var floorDocs = {
+  name: 'floor',
+  category: 'Arithmetic',
+  syntax: ['floor(x)', 'floor(x, n)', 'floor(unit, valuelessUnit)', 'floor(unit, n, valuelessUnit)'],
+  description: 'Round a value towards minus infinity.If x is complex, both real and imaginary part are rounded towards minus infinity.',
+  examples: ['floor(3.2)', 'floor(3.8)', 'floor(-4.2)', 'floor(3.241cm, cm)', 'floor(3.241cm, 2, cm)'],
+  seealso: ['ceil', 'fix', 'round']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js
new file mode 100644
index 0000000..3944fc2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/gcd.js
@@ -0,0 +1,8 @@
+export var gcdDocs = {
+  name: 'gcd',
+  category: 'Arithmetic',
+  syntax: ['gcd(a, b)', 'gcd(a, b, c, ...)'],
+  description: 'Compute the greatest common divisor.',
+  examples: ['gcd(8, 12)', 'gcd(-4, 6)', 'gcd(25, 15, -10)'],
+  seealso: ['lcm', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js
new file mode 100644
index 0000000..fa65019
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/hypot.js
@@ -0,0 +1,8 @@
+export var hypotDocs = {
+  name: 'hypot',
+  category: 'Arithmetic',
+  syntax: ['hypot(a, b, c, ...)', 'hypot([a, b, c, ...])'],
+  description: 'Calculate the hypotenuse of a list with values.',
+  examples: ['hypot(3, 4)', 'sqrt(3^2 + 4^2)', 'hypot(-2)', 'hypot([3, 4, 5])'],
+  seealso: ['abs', 'norm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js
new file mode 100644
index 0000000..3ad8e2a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/invmod.js
@@ -0,0 +1,8 @@
+export var invmodDocs = {
+  name: 'invmod',
+  category: 'Arithmetic',
+  syntax: ['invmod(a, b)'],
+  description: 'Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation ax ≣ 1 (mod b)',
+  examples: ['invmod(8, 12)', 'invmod(7, 13)', 'invmod(15151, 15122)'],
+  seealso: ['gcd', 'xgcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js
new file mode 100644
index 0000000..3b6309f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/lcm.js
@@ -0,0 +1,8 @@
+export var lcmDocs = {
+  name: 'lcm',
+  category: 'Arithmetic',
+  syntax: ['lcm(x, y)'],
+  description: 'Compute the least common multiple.',
+  examples: ['lcm(4, 6)', 'lcm(6, 21)', 'lcm(6, 21, 5)'],
+  seealso: ['gcd']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js
new file mode 100644
index 0000000..af228dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log.js
@@ -0,0 +1,8 @@
+export var logDocs = {
+  name: 'log',
+  category: 'Arithmetic',
+  syntax: ['log(x)', 'log(x, base)'],
+  description: 'Compute the logarithm of a value. If no base is provided, the natural logarithm of x is calculated. If base if provided, the logarithm is calculated for the specified base. log(x, base) is defined as log(x) / log(base).',
+  examples: ['log(3.5)', 'a = log(2.4)', 'exp(a)', '10 ^ 4', 'log(10000, 10)', 'log(10000) / log(10)', 'b = log(1024, 2)', '2 ^ b'],
+  seealso: ['exp', 'log1p', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js
new file mode 100644
index 0000000..4687c87
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log10.js
@@ -0,0 +1,8 @@
+export var log10Docs = {
+  name: 'log10',
+  category: 'Arithmetic',
+  syntax: ['log10(x)'],
+  description: 'Compute the 10-base logarithm of a value.',
+  examples: ['log10(0.00001)', 'log10(10000)', '10 ^ 4', 'log(10000) / log(10)', 'log(10000, 10)'],
+  seealso: ['exp', 'log']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js
new file mode 100644
index 0000000..4c0a5cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log1p.js
@@ -0,0 +1,8 @@
+export var log1pDocs = {
+  name: 'log1p',
+  category: 'Arithmetic',
+  syntax: ['log1p(x)', 'log1p(x, base)'],
+  description: 'Calculate the logarithm of a `value+1`',
+  examples: ['log1p(2.5)', 'exp(log1p(1.4))', 'pow(10, 4)', 'log1p(9999, 10)', 'log1p(9999) / log(10)'],
+  seealso: ['exp', 'log', 'log2', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js
new file mode 100644
index 0000000..faf07cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/log2.js
@@ -0,0 +1,8 @@
+export var log2Docs = {
+  name: 'log2',
+  category: 'Arithmetic',
+  syntax: ['log2(x)'],
+  description: 'Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.',
+  examples: ['log2(0.03125)', 'log2(16)', 'log2(16) / log2(2)', 'pow(2, 4)'],
+  seealso: ['exp', 'log1p', 'log', 'log10']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js
new file mode 100644
index 0000000..f8eda30
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/mod.js
@@ -0,0 +1,8 @@
+export var modDocs = {
+  name: 'mod',
+  category: 'Operators',
+  syntax: ['x % y', 'x mod y', 'mod(x, y)'],
+  description: 'Calculates the modulus, the remainder of an integer division.',
+  examples: ['7 % 3', '11 % 2', '10 mod 4', 'isOdd(x) = x % 2', 'isOdd(2)', 'isOdd(3)'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js
new file mode 100644
index 0000000..1f28098
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/multiply.js
@@ -0,0 +1,8 @@
+export var multiplyDocs = {
+  name: 'multiply',
+  category: 'Operators',
+  syntax: ['x * y', 'multiply(x, y)'],
+  description: 'multiply two values.',
+  examples: ['a = 2.1 * 3.4', 'a / 3.4', '2 * 3 + 4', '2 * (3 + 4)', '3 * 2.1 km'],
+  seealso: ['divide']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js
new file mode 100644
index 0000000..129579e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/norm.js
@@ -0,0 +1,7 @@
+export var normDocs = {
+  name: 'norm',
+  category: 'Arithmetic',
+  syntax: ['norm(x)', 'norm(x, p)'],
+  description: 'Calculate the norm of a number, vector or matrix.',
+  examples: ['abs(-3.5)', 'norm(-3.5)', 'norm(3 - 4i)', 'norm([1, 2, -3], Infinity)', 'norm([1, 2, -3], -Infinity)', 'norm([3, 4], 2)', 'norm([[1, 2], [3, 4]], 1)', 'norm([[1, 2], [3, 4]], "inf")', 'norm([[1, 2], [3, 4]], "fro")']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..9cf2442
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoot.js
@@ -0,0 +1,8 @@
+export var nthRootDocs = {
+  name: 'nthRoot',
+  category: 'Arithmetic',
+  syntax: ['nthRoot(a)', 'nthRoot(a, root)'],
+  description: 'Calculate the nth root of a value. ' + 'The principal nth root of a positive real number A, ' + 'is the positive real solution of the equation "x^root = A".',
+  examples: ['4 ^ 3', 'nthRoot(64, 3)', 'nthRoot(9, 2)', 'sqrt(9)'],
+  seealso: ['nthRoots', 'pow', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..2b5de3c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/nthRoots.js
@@ -0,0 +1,8 @@
+export var nthRootsDocs = {
+  name: 'nthRoots',
+  category: 'Arithmetic',
+  syntax: ['nthRoots(A)', 'nthRoots(A, root)'],
+  description: '' + 'Calculate the nth roots of a value. ' + 'An nth root of a positive real number A, ' + 'is a positive real solution of the equation "x^root = A". ' + 'This function returns an array of complex values.',
+  examples: ['nthRoots(1)', 'nthRoots(1, 3)'],
+  seealso: ['sqrt', 'pow', 'nthRoot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js
new file mode 100644
index 0000000..3924b92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/pow.js
@@ -0,0 +1,8 @@
+export var powDocs = {
+  name: 'pow',
+  category: 'Operators',
+  syntax: ['x ^ y', 'pow(x, y)'],
+  description: 'Calculates the power of x to y, x^y.',
+  examples: ['2^3', '2*2*2', '1 + e ^ (pi * i)', 'pow([[1, 2], [4, 3]], 2)', 'pow([[1, 2], [4, 3]], -1)'],
+  seealso: ['multiply', 'nthRoot', 'nthRoots', 'sqrt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js
new file mode 100644
index 0000000..aefd523
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/round.js
@@ -0,0 +1,8 @@
+export var roundDocs = {
+  name: 'round',
+  category: 'Arithmetic',
+  syntax: ['round(x)', 'round(x, n)', 'round(unit, valuelessUnit)', 'round(unit, n, valuelessUnit)'],
+  description: 'round a value towards the nearest integer.If x is complex, both real and imaginary part are rounded towards the nearest integer. When n is specified, the value is rounded to n decimals.',
+  examples: ['round(3.2)', 'round(3.8)', 'round(-4.2)', 'round(-4.8)', 'round(pi, 3)', 'round(123.45678, 2)', 'round(3.241cm, 2, cm)', 'round([3.2, 3.8, -4.7])'],
+  seealso: ['ceil', 'floor', 'fix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js
new file mode 100644
index 0000000..c34fae4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sign.js
@@ -0,0 +1,8 @@
+export var signDocs = {
+  name: 'sign',
+  category: 'Arithmetic',
+  syntax: ['sign(x)'],
+  description: 'Compute the sign of a value. The sign of a value x is 1 when x>0, -1 when x<0, and 0 when x=0.',
+  examples: ['sign(3.5)', 'sign(-4.2)', 'sign(0)'],
+  seealso: ['abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..9fc19ac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrt.js
@@ -0,0 +1,8 @@
+export var sqrtDocs = {
+  name: 'sqrt',
+  category: 'Arithmetic',
+  syntax: ['sqrt(x)'],
+  description: 'Compute the square root value. If x = y * y, then y is the square root of x.',
+  examples: ['sqrt(25)', '5 * 5', 'sqrt(-1)'],
+  seealso: ['square', 'sqrtm', 'multiply', 'nthRoot', 'nthRoots', 'pow']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js
new file mode 100644
index 0000000..859deb3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/sqrtm.js
@@ -0,0 +1,8 @@
+export var sqrtmDocs = {
+  name: 'sqrtm',
+  category: 'Arithmetic',
+  syntax: ['sqrtm(x)'],
+  description: 'Calculate the principal square root of a square matrix. The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.',
+  examples: ['sqrtm([[33, 24], [48, 57]])'],
+  seealso: ['sqrt', 'abs', 'square', 'multiply']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js
new file mode 100644
index 0000000..5c858f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/square.js
@@ -0,0 +1,8 @@
+export var squareDocs = {
+  name: 'square',
+  category: 'Arithmetic',
+  syntax: ['square(x)'],
+  description: 'Compute the square of a value. The square of x is x * x.',
+  examples: ['square(3)', 'sqrt(9)', '3^2', '3 * 3'],
+  seealso: ['multiply', 'pow', 'sqrt', 'cube']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js
new file mode 100644
index 0000000..c6a2084
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/subtract.js
@@ -0,0 +1,8 @@
+export var subtractDocs = {
+  name: 'subtract',
+  category: 'Operators',
+  syntax: ['x - y', 'subtract(x, y)'],
+  description: 'subtract two values.',
+  examples: ['a = 5.3 - 2', 'a + 2', '2/3 - 1/6', '2 * 3 - 3', '2.1 km - 500m'],
+  seealso: ['add']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..e4dcbaf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryMinus.js
@@ -0,0 +1,8 @@
+export var unaryMinusDocs = {
+  name: 'unaryMinus',
+  category: 'Operators',
+  syntax: ['-x', 'unaryMinus(x)'],
+  description: 'Inverse the sign of a value. Converts booleans and strings to numbers.',
+  examples: ['-4.5', '-(-5.6)', '-"22"'],
+  seealso: ['add', 'subtract', 'unaryPlus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..783efc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/unaryPlus.js
@@ -0,0 +1,8 @@
+export var unaryPlusDocs = {
+  name: 'unaryPlus',
+  category: 'Operators',
+  syntax: ['+x', 'unaryPlus(x)'],
+  description: 'Converts booleans and strings to numbers.',
+  examples: ['+true', '+"2"'],
+  seealso: ['add', 'subtract', 'unaryMinus']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..a0ec1de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/arithmetic/xgcd.js
@@ -0,0 +1,8 @@
+export var xgcdDocs = {
+  name: 'xgcd',
+  category: 'Arithmetic',
+  syntax: ['xgcd(a, b)'],
+  description: 'Calculate the extended greatest common divisor for two values. The result is an array [d, x, y] with 3 entries, where d is the greatest common divisor, and d = x * a + y * b.',
+  examples: ['xgcd(8, 12)', 'gcd(8, 12)', 'xgcd(36163, 21199)'],
+  seealso: ['gcd', 'lcm']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..5e4af2a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitAnd.js
@@ -0,0 +1,8 @@
+export var bitAndDocs = {
+  name: 'bitAnd',
+  category: 'Bitwise',
+  syntax: ['x & y', 'bitAnd(x, y)'],
+  description: 'Bitwise AND operation. Performs the logical AND operation on each pair of the corresponding bits of the two given values by multiplying them. If both bits in the compared position are 1, the bit in the resulting binary representation is 1, otherwise, the result is 0',
+  examples: ['5 & 3', 'bitAnd(53, 131)', '[1, 12, 31] & 42'],
+  seealso: ['bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js
new file mode 100644
index 0000000..905841f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitNot.js
@@ -0,0 +1,8 @@
+export var bitNotDocs = {
+  name: 'bitNot',
+  category: 'Bitwise',
+  syntax: ['~x', 'bitNot(x)'],
+  description: 'Bitwise NOT operation. Performs a logical negation on each bit of the given value. Bits that are 0 become 1, and those that are 1 become 0.',
+  examples: ['~1', '~2', 'bitNot([2, -3, 4])'],
+  seealso: ['bitAnd', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js
new file mode 100644
index 0000000..2e98ee5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitOr.js
@@ -0,0 +1,8 @@
+export var bitOrDocs = {
+  name: 'bitOr',
+  category: 'Bitwise',
+  syntax: ['x | y', 'bitOr(x, y)'],
+  description: 'Bitwise OR operation. Performs the logical inclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if the first bit is 1 or the second bit is 1 or both bits are 1, otherwise, the result is 0.',
+  examples: ['5 | 3', 'bitOr([1, 2, 3], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitXor', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js
new file mode 100644
index 0000000..4be877e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/bitXor.js
@@ -0,0 +1,8 @@
+export var bitXorDocs = {
+  name: 'bitXor',
+  category: 'Bitwise',
+  syntax: ['bitXor(x, y)'],
+  description: 'Bitwise XOR operation, exclusive OR. Performs the logical exclusive OR operation on each pair of corresponding bits of the two given values. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1.',
+  examples: ['bitOr(1, 2)', 'bitXor([2, 3, 4], 4)'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'leftShift', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js
new file mode 100644
index 0000000..a693a22
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/leftShift.js
@@ -0,0 +1,8 @@
+export var leftShiftDocs = {
+  name: 'leftShift',
+  category: 'Bitwise',
+  syntax: ['x << y', 'leftShift(x, y)'],
+  description: 'Bitwise left logical shift of a value x by y number of bits.',
+  examples: ['4 << 1', '8 >> 1'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'rightArithShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..107a877
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightArithShift.js
@@ -0,0 +1,8 @@
+export var rightArithShiftDocs = {
+  name: 'rightArithShift',
+  category: 'Bitwise',
+  syntax: ['x >> y', 'rightArithShift(x, y)'],
+  description: 'Bitwise right arithmetic shift of a value x by y number of bits.',
+  examples: ['8 >> 1', '4 << 1', '-12 >> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightLogShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..fed62da
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/bitwise/rightLogShift.js
@@ -0,0 +1,8 @@
+export var rightLogShiftDocs = {
+  name: 'rightLogShift',
+  category: 'Bitwise',
+  syntax: ['x >>> y', 'rightLogShift(x, y)'],
+  description: 'Bitwise right logical shift of a value x by y number of bits.',
+  examples: ['8 >>> 1', '4 << 1', '-12 >>> 2'],
+  seealso: ['bitAnd', 'bitNot', 'bitOr', 'bitXor', 'leftShift', 'rightArithShift']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..2a24de3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/bellNumbers.js
@@ -0,0 +1,8 @@
+export var bellNumbersDocs = {
+  name: 'bellNumbers',
+  category: 'Combinatorics',
+  syntax: ['bellNumbers(n)'],
+  description: 'The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S. `bellNumbers` only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['bellNumbers(3)', 'bellNumbers(8)'],
+  seealso: ['stirlingS2']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js
new file mode 100644
index 0000000..e68903b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/catalan.js
@@ -0,0 +1,8 @@
+export var catalanDocs = {
+  name: 'catalan',
+  category: 'Combinatorics',
+  syntax: ['catalan(n)'],
+  description: 'The Catalan Numbers enumerate combinatorial structures of many different types. catalan only takes integer arguments. The following condition must be enforced: n >= 0.',
+  examples: ['catalan(3)', 'catalan(8)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js
new file mode 100644
index 0000000..17ddea5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/composition.js
@@ -0,0 +1,8 @@
+export var compositionDocs = {
+  name: 'composition',
+  category: 'Combinatorics',
+  syntax: ['composition(n, k)'],
+  description: 'The composition counts of n into k parts. composition only takes integer arguments. The following condition must be enforced: k <= n.',
+  examples: ['composition(5, 3)'],
+  seealso: ['combinations']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..42da118
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/combinatorics/stirlingS2.js
@@ -0,0 +1,8 @@
+export var stirlingS2Docs = {
+  name: 'stirlingS2',
+  category: 'Combinatorics',
+  syntax: ['stirlingS2(n, k)'],
+  description: 'he Stirling numbers of the second kind, counts the number of ways to partition a set of n labelled objects into k nonempty unlabelled subsets. `stirlingS2` only takes integer arguments. The following condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) = 1.',
+  examples: ['stirlingS2(5, 3)'],
+  seealso: ['bellNumbers']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js
new file mode 100644
index 0000000..365d159
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/arg.js
@@ -0,0 +1,8 @@
+export var argDocs = {
+  name: 'arg',
+  category: 'Complex',
+  syntax: ['arg(x)'],
+  description: 'Compute the argument of a complex value. If x = a+bi, the argument is computed as atan2(b, a).',
+  examples: ['arg(2 + 2i)', 'atan2(3, 2)', 'arg(2 + 3i)'],
+  seealso: ['re', 'im', 'conj', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js
new file mode 100644
index 0000000..95d6966
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/conj.js
@@ -0,0 +1,8 @@
+export var conjDocs = {
+  name: 'conj',
+  category: 'Complex',
+  syntax: ['conj(x)'],
+  description: 'Compute the complex conjugate of a complex value. If x = a+bi, the complex conjugate is a-bi.',
+  examples: ['conj(2 + 3i)', 'conj(2 - 3i)', 'conj(-5.2i)'],
+  seealso: ['re', 'im', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js
new file mode 100644
index 0000000..1ef8686
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/im.js
@@ -0,0 +1,8 @@
+export var imDocs = {
+  name: 'im',
+  category: 'Complex',
+  syntax: ['im(x)'],
+  description: 'Get the imaginary part of a complex number.',
+  examples: ['im(2 + 3i)', 're(2 + 3i)', 'im(-5.2i)', 'im(2.4)'],
+  seealso: ['re', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js
new file mode 100644
index 0000000..5ba0074
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/complex/re.js
@@ -0,0 +1,8 @@
+export var reDocs = {
+  name: 're',
+  category: 'Complex',
+  syntax: ['re(x)'],
+  description: 'Get the real part of a complex number.',
+  examples: ['re(2 + 3i)', 'im(2 + 3i)', 're(-5.2i)', 're(2.4)'],
+  seealso: ['im', 'conj', 'abs', 'arg']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/compile.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/compile.js
new file mode 100644
index 0000000..3cd29fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/compile.js
@@ -0,0 +1,8 @@
+export var compileDocs = {
+  name: 'compile',
+  category: 'Expression',
+  syntax: ['compile(expr) ', 'compile([expr1, expr2, expr3, ...])'],
+  description: 'Parse and compile an expression. Returns a an object with a function evaluate([scope]) to evaluate the compiled expression.',
+  examples: ['code1 = compile("sqrt(3^2 + 4^2)")', 'code1.evaluate() ', 'code2 = compile("a * b")', 'code2.evaluate({a: 3, b: 4})'],
+  seealso: ['parser', 'parse', 'evaluate']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js
new file mode 100644
index 0000000..742e721
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/evaluate.js
@@ -0,0 +1,8 @@
+export var evaluateDocs = {
+  name: 'evaluate',
+  category: 'Expression',
+  syntax: ['evaluate(expression)', 'evaluate(expression, scope)', 'evaluate([expr1, expr2, expr3, ...])', 'evaluate([expr1, expr2, expr3, ...], scope)'],
+  description: 'Evaluate an expression or an array with expressions.',
+  examples: ['evaluate("2 + 3")', 'evaluate("sqrt(16)")', 'evaluate("2 inch to cm")', 'evaluate("sin(x * pi)", { "x": 1/2 })', 'evaluate(["width=2", "height=4","width*height"])'],
+  seealso: ['parser', 'parse', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js
new file mode 100644
index 0000000..51d9401
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/help.js
@@ -0,0 +1,8 @@
+export var helpDocs = {
+  name: 'help',
+  category: 'Expression',
+  syntax: ['help(object)', 'help(string)'],
+  description: 'Display documentation on a function or data type.',
+  examples: ['help(sqrt)', 'help("complex")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parse.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parse.js
new file mode 100644
index 0000000..8e72d0c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parse.js
@@ -0,0 +1,8 @@
+export var parseDocs = {
+  name: 'parse',
+  category: 'Expression',
+  syntax: ['parse(expr)', 'parse(expr, options)', 'parse([expr1, expr2, expr3, ...])', 'parse([expr1, expr2, expr3, ...], options)'],
+  description: 'Parse an expression. Returns a node tree, which can be evaluated by invoking node.evaluate() or transformed into a functional object via node.compile().',
+  examples: ['node1 = parse("sqrt(3^2 + 4^2)")', 'node1.evaluate()', 'code1 = node1.compile()', 'code1.evaluate()', 'scope = {a: 3, b: 4}', 'node2 = parse("a * b")', 'node2.evaluate(scope)', 'code2 = node2.compile()', 'code2.evaluate(scope)'],
+  seealso: ['parser', 'evaluate', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parser.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parser.js
new file mode 100644
index 0000000..6cd59fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/expression/parser.js
@@ -0,0 +1,8 @@
+export var parserDocs = {
+  name: 'parser',
+  category: 'Expression',
+  syntax: ['parser()'],
+  description: 'Create a parser object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.',
+  examples: ['myParser = parser()', 'myParser.evaluate("sqrt(3^2 + 4^2)")', 'myParser.set("x", 3)', 'myParser.evaluate("y = x + 3")', 'myParser.evaluate(["y = x + 3", "y = y + 1"])', 'myParser.get("y")'],
+  seealso: ['evaluate', 'parse', 'compile']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js
new file mode 100644
index 0000000..f372020
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/distance.js
@@ -0,0 +1,8 @@
+export var distanceDocs = {
+  name: 'distance',
+  category: 'Geometry',
+  syntax: ['distance([x1, y1], [x2, y2])', 'distance([[x1, y1], [x2, y2]])'],
+  description: 'Calculates the Euclidean distance between two points.',
+  examples: ['distance([0,0], [4,4])', 'distance([[0,0], [4,4]])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js
new file mode 100644
index 0000000..ebf61d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/geometry/intersect.js
@@ -0,0 +1,8 @@
+export var intersectDocs = {
+  name: 'intersect',
+  category: 'Geometry',
+  syntax: ['intersect(expr1, expr2, expr3, expr4)', 'intersect(expr1, expr2, expr3)'],
+  description: 'Computes the intersection point of lines and/or planes.',
+  examples: ['intersect([0, 0], [10, 10], [10, 0], [0, 10])', 'intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js
new file mode 100644
index 0000000..88112d0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/and.js
@@ -0,0 +1,8 @@
+export var andDocs = {
+  name: 'and',
+  category: 'Logical',
+  syntax: ['x and y', 'and(x, y)'],
+  description: 'Logical and. Test whether two values are both defined with a nonzero/nonempty value.',
+  examples: ['true and false', 'true and true', '2 and 4'],
+  seealso: ['not', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js
new file mode 100644
index 0000000..e5a7c58
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/not.js
@@ -0,0 +1,8 @@
+export var notDocs = {
+  name: 'not',
+  category: 'Logical',
+  syntax: ['not x', 'not(x)'],
+  description: 'Logical not. Flips the boolean value of given argument.',
+  examples: ['not true', 'not false', 'not 2', 'not 0'],
+  seealso: ['and', 'or', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/nullish.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/nullish.js
new file mode 100644
index 0000000..764e000
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/nullish.js
@@ -0,0 +1,8 @@
+export var nullishDocs = {
+  name: 'nullish',
+  category: 'Logical',
+  syntax: ['x ?? y', 'nullish(x, y)'],
+  description: 'Nullish coalescing operator. Returns the right-hand operand when the left-hand operand is null or undefined, and otherwise returns the left-hand operand.',
+  examples: ['null ?? 42', 'undefined ?? 42', '0 ?? 42', 'false ?? 42', 'null ?? undefined ?? 42'],
+  seealso: ['and', 'or', 'not']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js
new file mode 100644
index 0000000..dbcd620
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/or.js
@@ -0,0 +1,8 @@
+export var orDocs = {
+  name: 'or',
+  category: 'Logical',
+  syntax: ['x or y', 'or(x, y)'],
+  description: 'Logical or. Test if at least one value is defined with a nonzero/nonempty value.',
+  examples: ['true or false', 'false or false', '0 or 4'],
+  seealso: ['not', 'and', 'xor']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js
new file mode 100644
index 0000000..c362d93
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/logical/xor.js
@@ -0,0 +1,8 @@
+export var xorDocs = {
+  name: 'xor',
+  category: 'Logical',
+  syntax: ['x xor y', 'xor(x, y)'],
+  description: 'Logical exclusive or, xor. Test whether one and only one value is defined with a nonzero/nonempty value.',
+  examples: ['true xor false', 'false xor false', 'true xor true', '0 xor 4'],
+  seealso: ['not', 'and', 'or']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js
new file mode 100644
index 0000000..2a2ee86
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/column.js
@@ -0,0 +1,8 @@
+export var columnDocs = {
+  name: 'column',
+  category: 'Matrix',
+  syntax: ['column(x, index)'],
+  description: 'Return a column from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'column(A, 1)', 'column(A, 2)'],
+  seealso: ['row', 'matrixFromColumns']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js
new file mode 100644
index 0000000..b865da7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/concat.js
@@ -0,0 +1,8 @@
+export var concatDocs = {
+  name: 'concat',
+  category: 'Matrix',
+  syntax: ['concat(A, B, C, ...)', 'concat(A, B, C, ..., dim)'],
+  description: 'Concatenate matrices. By default, the matrices are concatenated by the last dimension. The dimension on which to concatenate can be provided as last argument.',
+  examples: ['A = [1, 2; 5, 6]', 'B = [3, 4; 7, 8]', 'concat(A, B)', 'concat(A, B, 1)', 'concat(A, B, 2)'],
+  seealso: ['det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js
new file mode 100644
index 0000000..6237021
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/count.js
@@ -0,0 +1,8 @@
+export var countDocs = {
+  name: 'count',
+  category: 'Matrix',
+  syntax: ['count(x)'],
+  description: 'Count the number of elements of a matrix, array or string.',
+  examples: ['a = [1, 2; 3, 4; 5, 6]', 'count(a)', 'size(a)', 'count("hello world")'],
+  seealso: ['size']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js
new file mode 100644
index 0000000..c9eed54
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/cross.js
@@ -0,0 +1,8 @@
+export var crossDocs = {
+  name: 'cross',
+  category: 'Matrix',
+  syntax: ['cross(A, B)'],
+  description: 'Calculate the cross product for two vectors in three dimensional space.',
+  examples: ['cross([1, 1, 0],  [0, 1, 1])', 'cross([3, -3, 1], [4, 9, 2])', 'cross([2, 3, 4],  [5, 6, 7])'],
+  seealso: ['multiply', 'dot']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js
new file mode 100644
index 0000000..730680e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ctranspose.js
@@ -0,0 +1,8 @@
+export var ctransposeDocs = {
+  name: 'ctranspose',
+  category: 'Matrix',
+  syntax: ['x\'', 'ctranspose(x)'],
+  description: 'Complex Conjugate and Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'ctranspose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js
new file mode 100644
index 0000000..79e0c92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/det.js
@@ -0,0 +1,8 @@
+export var detDocs = {
+  name: 'det',
+  category: 'Matrix',
+  syntax: ['det(x)'],
+  description: 'Calculate the determinant of a matrix',
+  examples: ['det([1, 2; 3, 4])', 'det([-2, 2, 3; -1, 1, 3; 2, 0, -1])'],
+  seealso: ['concat', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js
new file mode 100644
index 0000000..b6f65c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diag.js
@@ -0,0 +1,8 @@
+export var diagDocs = {
+  name: 'diag',
+  category: 'Matrix',
+  syntax: ['diag(x)', 'diag(x, k)'],
+  description: 'Create a diagonal matrix or retrieve the diagonal of a matrix. When x is a vector, a matrix with the vector values on the diagonal will be returned. When x is a matrix, a vector with the diagonal values of the matrix is returned. When k is provided, the k-th diagonal will be filled in or retrieved, if k is positive, the values are placed on the super diagonal. When k is negative, the values are placed on the sub diagonal.',
+  examples: ['diag(1:3)', 'diag(1:3, 1)', 'a = [1, 2, 3; 4, 5, 6; 7, 8, 9]', 'diag(a)'],
+  seealso: ['concat', 'det', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js
new file mode 100644
index 0000000..518aa59
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/diff.js
@@ -0,0 +1,8 @@
+export var diffDocs = {
+  name: 'diff',
+  category: 'Matrix',
+  syntax: ['diff(arr)', 'diff(arr, dim)'],
+  description: ['Create a new matrix or array with the difference of the passed matrix or array.', 'Dim parameter is optional and used to indicate the dimension of the array/matrix to apply the difference', 'If no dimension parameter is passed it is assumed as dimension 0', 'Dimension is zero-based in javascript and one-based in the parser', 'Arrays must be \'rectangular\' meaning arrays like [1, 2]', 'If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays'],
+  examples: ['A = [1, 2, 4, 7, 0]', 'diff(A)', 'diff(A, 1)', 'B = [[1, 2], [3, 4]]', 'diff(B)', 'diff(B, 1)', 'diff(B, 2)', 'diff(B, bignumber(2))', 'diff([[1, 2], matrix([3, 4])], 2)'],
+  seealso: ['subtract', 'partitionSelect']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js
new file mode 100644
index 0000000..05d137d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/dot.js
@@ -0,0 +1,8 @@
+export var dotDocs = {
+  name: 'dot',
+  category: 'Matrix',
+  syntax: ['dot(A, B)', 'A * B'],
+  description: 'Calculate the dot product of two vectors. ' + 'The dot product of A = [a1, a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] ' + 'is defined as dot(A, B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn',
+  examples: ['dot([2, 4, 1], [2, 2, 3])', '[2, 4, 1] * [2, 2, 3]'],
+  seealso: ['multiply', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js
new file mode 100644
index 0000000..56bfea9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/eigs.js
@@ -0,0 +1,8 @@
+export var eigsDocs = {
+  name: 'eigs',
+  category: 'Matrix',
+  syntax: ['eigs(x)'],
+  description: 'Calculate the eigenvalues and optionally eigenvectors of a square matrix',
+  examples: ['eigs([[5, 2.3], [2.3, 1]])', 'eigs([[1, 2, 3], [4, 5, 6], [7, 8, 9]], { precision: 1e-6, eigenvectors: false })'],
+  seealso: ['inv']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/fft.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/fft.js
new file mode 100644
index 0000000..6a372a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/fft.js
@@ -0,0 +1,8 @@
+export var fftDocs = {
+  name: 'fft',
+  category: 'Matrix',
+  syntax: ['fft(x)'],
+  description: 'Calculate N-dimensional Fourier transform',
+  examples: ['fft([[1, 0], [1, 0]])'],
+  seealso: ['ifft']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js
new file mode 100644
index 0000000..01658cd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/filter.js
@@ -0,0 +1,8 @@
+export var filterDocs = {
+  name: 'filter',
+  category: 'Matrix',
+  syntax: ['filter(x, test)'],
+  description: 'Filter items in a matrix.',
+  examples: ['isPositive(x) = x > 0', 'filter([6, -2, -1, 4, 3], isPositive)', 'filter([6, -2, 0, 1, 0], x != 0)'],
+  seealso: ['sort', 'map', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js
new file mode 100644
index 0000000..02660a9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/flatten.js
@@ -0,0 +1,8 @@
+export var flattenDocs = {
+  name: 'flatten',
+  category: 'Matrix',
+  syntax: ['flatten(x)'],
+  description: 'Flatten a multi dimensional matrix into a single dimensional matrix.',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'size(a)', 'b = flatten(a)', 'size(b)'],
+  seealso: ['concat', 'resize', 'size', 'squeeze']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js
new file mode 100644
index 0000000..11f11dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/forEach.js
@@ -0,0 +1,8 @@
+export var forEachDocs = {
+  name: 'forEach',
+  category: 'Matrix',
+  syntax: ['forEach(x, callback)'],
+  description: 'Iterates over all elements of a matrix/array, and executes the given callback function.',
+  examples: ['numberOfPets = {}', 'addPet(n) = numberOfPets[n] = (numberOfPets[n] ? numberOfPets[n]:0 ) + 1;', 'forEach(["Dog","Cat","Cat"], addPet)', 'numberOfPets'],
+  seealso: ['map', 'sort', 'filter']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..cc1daa2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/getMatrixDataType.js
@@ -0,0 +1,8 @@
+export var getMatrixDataTypeDocs = {
+  name: 'getMatrixDataType',
+  category: 'Matrix',
+  syntax: ['getMatrixDataType(x)'],
+  description: 'Find the data type of all elements in a matrix or array, ' + 'for example "number" if all items are a number ' + 'and "Complex" if all values are complex numbers. ' + 'If a matrix contains more than one data type, it will return "mixed".',
+  examples: ['getMatrixDataType([1, 2, 3])', 'getMatrixDataType([[5 cm], [2 inch]])', 'getMatrixDataType([1, "text"])', 'getMatrixDataType([1, bignumber(4)])'],
+  seealso: ['matrix', 'sparse', 'typeOf']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js
new file mode 100644
index 0000000..c3d717e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/identity.js
@@ -0,0 +1,8 @@
+export var identityDocs = {
+  name: 'identity',
+  category: 'Matrix',
+  syntax: ['identity(n)', 'identity(m, n)', 'identity([m, n])'],
+  description: 'Returns the identity matrix with size m-by-n. The matrix has ones on the diagonal and zeros elsewhere.',
+  examples: ['identity(3)', 'identity(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'identity(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ifft.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ifft.js
new file mode 100644
index 0000000..99b6ce8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ifft.js
@@ -0,0 +1,8 @@
+export var ifftDocs = {
+  name: 'ifft',
+  category: 'Matrix',
+  syntax: ['ifft(x)'],
+  description: 'Calculate N-dimensional inverse Fourier transform',
+  examples: ['ifft([[2, 2], [0, 0]])'],
+  seealso: ['fft']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js
new file mode 100644
index 0000000..db48c64
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/inv.js
@@ -0,0 +1,8 @@
+export var invDocs = {
+  name: 'inv',
+  category: 'Matrix',
+  syntax: ['inv(x)'],
+  description: 'Calculate the inverse of a matrix',
+  examples: ['inv([1, 2; 3, 4])', 'inv(4)', '1 / 4'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js
new file mode 100644
index 0000000..9d655ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/kron.js
@@ -0,0 +1,8 @@
+export var kronDocs = {
+  name: 'kron',
+  category: 'Matrix',
+  syntax: ['kron(x, y)'],
+  description: 'Calculates the Kronecker product of 2 matrices or vectors.',
+  examples: ['kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])', 'kron([1,1], [2,3,4])'],
+  seealso: ['multiply', 'dot', 'cross']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js
new file mode 100644
index 0000000..711294e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/map.js
@@ -0,0 +1,8 @@
+export var mapDocs = {
+  name: 'map',
+  category: 'Matrix',
+  syntax: ['map(x, callback)', 'map(x, y, ..., callback)'],
+  description: 'Create a new matrix or array with the results of the callback function executed on each entry of the matrix/array or the matrices/arrays.',
+  examples: ['map([1, 2, 3], square)', 'map([1, 2], [3, 4], f(a,b) = a + b)'],
+  seealso: ['filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/mapSlices.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/mapSlices.js
new file mode 100644
index 0000000..04196fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/mapSlices.js
@@ -0,0 +1,11 @@
+export var mapSlicesDocs = {
+  name: 'mapSlices',
+  category: 'Matrix',
+  syntax: ['mapSlices(A, dim, callback)'],
+  description: 'Generate a matrix one dimension less than A by applying callback to ' + 'each slice of A along dimension dim.',
+  examples: ['A = [[1, 2], [3, 4]]', 'mapSlices(A, 1, sum)',
+  // returns [4, 6]
+  'mapSlices(A, 2, prod)' // returns [2, 12]
+  ],
+  seealso: ['map', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..7d9a8e4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromColumns.js
@@ -0,0 +1,8 @@
+export var matrixFromColumnsDocs = {
+  name: 'matrixFromColumns',
+  category: 'Matrix',
+  syntax: ['matrixFromColumns(...arr)', 'matrixFromColumns(row1, row2)', 'matrixFromColumns(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual columns.',
+  examples: ['matrixFromColumns([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..b872299
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromFunction.js
@@ -0,0 +1,8 @@
+export var matrixFromFunctionDocs = {
+  name: 'matrixFromFunction',
+  category: 'Matrix',
+  syntax: ['matrixFromFunction(size, fn)', 'matrixFromFunction(size, fn, format)', 'matrixFromFunction(size, fn, format, datatype)', 'matrixFromFunction(size, format, fn)', 'matrixFromFunction(size, format, datatype, fn)'],
+  description: 'Create a matrix by evaluating a generating function at each index.',
+  examples: ['f(I) = I[1] - I[2]', 'matrixFromFunction([3,3], f)', 'g(I) = I[1] - I[2] == 1 ? 4 : 0', 'matrixFromFunction([100, 100], "sparse", g)', 'matrixFromFunction([5], random)'],
+  seealso: ['matrix', 'matrixFromRows', 'matrixFromColumns', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..2ffdb7c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/matrixFromRows.js
@@ -0,0 +1,8 @@
+export var matrixFromRowsDocs = {
+  name: 'matrixFromRows',
+  category: 'Matrix',
+  syntax: ['matrixFromRows(...arr)', 'matrixFromRows(row1, row2)', 'matrixFromRows(row1, row2, row3)'],
+  description: 'Create a dense matrix from vectors as individual rows.',
+  examples: ['matrixFromRows([1, 2, 3], [[4],[5],[6]])'],
+  seealso: ['matrix', 'matrixFromColumns', 'matrixFromFunction', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js
new file mode 100644
index 0000000..793db0e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/ones.js
@@ -0,0 +1,8 @@
+export var onesDocs = {
+  name: 'ones',
+  category: 'Matrix',
+  syntax: ['ones(m)', 'ones(m, n)', 'ones(m, n, p, ...)', 'ones([m])', 'ones([m, n])', 'ones([m, n, p, ...])'],
+  description: 'Create a matrix containing ones.',
+  examples: ['ones(3)', 'ones(3, 5)', 'ones([2,3]) * 4.5', 'a = [1, 2, 3; 4, 5, 6]', 'ones(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..b896b3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/partitionSelect.js
@@ -0,0 +1,8 @@
+export var partitionSelectDocs = {
+  name: 'partitionSelect',
+  category: 'Matrix',
+  syntax: ['partitionSelect(x, k)', 'partitionSelect(x, k, compare)'],
+  description: 'Partition-based selection of an array or 1D matrix. Will find the kth smallest value, and mutates the input array. Uses Quickselect.',
+  examples: ['partitionSelect([5, 10, 1], 2)', 'partitionSelect(["C", "B", "A", "D"], 1, compareText)', 'arr = [5, 2, 1]', 'partitionSelect(arr, 0) # returns 1, arr is now: [1, 2, 5]', 'arr', 'partitionSelect(arr, 1, \'desc\') # returns 2, arr is now: [5, 2, 1]', 'arr'],
+  seealso: ['sort']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/pinv.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/pinv.js
new file mode 100644
index 0000000..93a7a43
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/pinv.js
@@ -0,0 +1,8 @@
+export var pinvDocs = {
+  name: 'pinv',
+  category: 'Matrix',
+  syntax: ['pinv(x)'],
+  description: 'Calculate the Moore–Penrose inverse of a matrix',
+  examples: ['pinv([1, 2; 3, 4])', 'pinv([[1, 0], [0, 1], [0, 1]])', 'pinv(4)'],
+  seealso: ['inv']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js
new file mode 100644
index 0000000..d059efc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/range.js
@@ -0,0 +1,8 @@
+export var rangeDocs = {
+  name: 'range',
+  category: 'Type',
+  syntax: ['start:end', 'start:step:end', 'range(start, end)', 'range(start, end, step)', 'range(string)'],
+  description: 'Create a range. Lower bound of the range is included, upper bound is excluded.',
+  examples: ['1:5', '3:-1:-3', 'range(3, 7)', 'range(0, 12, 2)', 'range("4:10")', 'range(1m, 1m, 3m)', 'a = [1, 2, 3, 4; 5, 6, 7, 8]', 'a[1:2, 1:2]'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'size', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js
new file mode 100644
index 0000000..4a7e1da
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/reshape.js
@@ -0,0 +1,8 @@
+export var reshapeDocs = {
+  name: 'reshape',
+  category: 'Matrix',
+  syntax: ['reshape(x, sizes)'],
+  description: 'Reshape a multi dimensional array to fit the specified dimensions.',
+  examples: ['reshape([1, 2, 3, 4, 5, 6], [2, 3])', 'reshape([[1, 2], [3, 4]], [1, 4])', 'reshape([[1, 2], [3, 4]], [4])', 'reshape([1, 2, 3, 4], [-1, 2])'],
+  seealso: ['size', 'squeeze', 'resize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js
new file mode 100644
index 0000000..8ff141a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/resize.js
@@ -0,0 +1,8 @@
+export var resizeDocs = {
+  name: 'resize',
+  category: 'Matrix',
+  syntax: ['resize(x, size)', 'resize(x, size, defaultValue)'],
+  description: 'Resize a matrix.',
+  examples: ['resize([1,2,3,4,5], [3])', 'resize([1,2,3], [5])', 'resize([1,2,3], [5], -1)', 'resize(2, [2, 3])', 'resize("hello", [8], "!")'],
+  seealso: ['size', 'subset', 'squeeze', 'reshape']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js
new file mode 100644
index 0000000..8d45123
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotate.js
@@ -0,0 +1,8 @@
+export var rotateDocs = {
+  name: 'rotate',
+  category: 'Matrix',
+  syntax: ['rotate(w, theta)', 'rotate(w, theta, v)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotate([1, 0], pi / 2)', 'rotate(matrix([1, 0]), unit("35deg"))', 'rotate([1, 0, 0], unit("90deg"), [0, 0, 1])', 'rotate(matrix([1, 0, 0]), unit("90deg"), matrix([0, 0, 1]))'],
+  seealso: ['matrix', 'rotationMatrix']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..52c553d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/rotationMatrix.js
@@ -0,0 +1,8 @@
+export var rotationMatrixDocs = {
+  name: 'rotationMatrix',
+  category: 'Matrix',
+  syntax: ['rotationMatrix(theta)', 'rotationMatrix(theta, v)', 'rotationMatrix(theta, v, format)'],
+  description: 'Returns a 2-D rotation matrix (2x2) for a given angle (in radians). ' + 'Returns a 2-D rotation matrix (3x3) of a given angle (in radians) around given axis.',
+  examples: ['rotationMatrix(pi / 2)', 'rotationMatrix(unit("45deg"), [0, 0, 1])', 'rotationMatrix(1, matrix([0, 0, 1]), "sparse")'],
+  seealso: ['cos', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js
new file mode 100644
index 0000000..ca6626b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/row.js
@@ -0,0 +1,8 @@
+export var rowDocs = {
+  name: 'row',
+  category: 'Matrix',
+  syntax: ['row(x, index)'],
+  description: 'Return a row from a matrix or array.',
+  examples: ['A = [[1, 2], [3, 4]]', 'row(A, 1)', 'row(A, 2)'],
+  seealso: ['column', 'matrixFromRows']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js
new file mode 100644
index 0000000..a93282e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/size.js
@@ -0,0 +1,8 @@
+export var sizeDocs = {
+  name: 'size',
+  category: 'Matrix',
+  syntax: ['size(x)'],
+  description: 'Calculate the size of a matrix.',
+  examples: ['size(2.3)', 'size("hello world")', 'a = [1, 2; 3, 4; 5, 6]', 'size(a)', 'size(1:6)'],
+  seealso: ['concat', 'count', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'squeeze', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js
new file mode 100644
index 0000000..5f21063
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/sort.js
@@ -0,0 +1,8 @@
+export var sortDocs = {
+  name: 'sort',
+  category: 'Matrix',
+  syntax: ['sort(x)', 'sort(x, compare)'],
+  description: 'Sort the items in a matrix. Compare can be a string "asc", "desc", "natural", or a custom sort function.',
+  examples: ['sort([5, 10, 1])', 'sort(["C", "B", "A", "D"], "natural")', 'sortByLength(a, b) = size(a)[1] - size(b)[1]', 'sort(["Langdon", "Tom", "Sara"], sortByLength)', 'sort(["10", "1", "2"], "natural")'],
+  seealso: ['map', 'filter', 'forEach']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js
new file mode 100644
index 0000000..bd699fe
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/squeeze.js
@@ -0,0 +1,8 @@
+export var squeezeDocs = {
+  name: 'squeeze',
+  category: 'Matrix',
+  syntax: ['squeeze(x)'],
+  description: 'Remove inner and outer singleton dimensions from a matrix.',
+  examples: ['a = zeros(3,2,1)', 'size(squeeze(a))', 'b = zeros(1,1,3)', 'size(squeeze(b))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'subset', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js
new file mode 100644
index 0000000..9c3907e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/subset.js
@@ -0,0 +1,8 @@
+export var subsetDocs = {
+  name: 'subset',
+  category: 'Matrix',
+  syntax: ['value(index)', 'value(index) = replacement', 'subset(value, [index])', 'subset(value, [index], replacement)'],
+  description: 'Get or set a subset of the entries of a matrix or ' + 'characters of a string. ' + 'Indexes are one-based. There should be one index specification for ' + 'each dimension of the target. Each specification can be a single ' + 'index, a list of indices, or a range in colon notation `l:u`. ' + 'In a range, both the lower bound l and upper bound u are included; ' + 'and if a bound is omitted it defaults to the most extreme valid value. ' + 'The cartesian product of the indices specified in each dimension ' + 'determines the target of the operation.',
+  examples: ['d = [1, 2; 3, 4]', 'e = []', 'e[1, 1:2] = [5, 6]', 'e[2, :] = [7, 8]', 'f = d * e', 'f[2, 1]', 'f[:, 1]', 'f[[1,2], [1,3]] = [9, 10; 11, 12]', 'f'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'trace', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js
new file mode 100644
index 0000000..863f7f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/trace.js
@@ -0,0 +1,8 @@
+export var traceDocs = {
+  name: 'trace',
+  category: 'Matrix',
+  syntax: ['trace(A)'],
+  description: 'Calculate the trace of a matrix: the sum of the elements on the main diagonal of a square matrix.',
+  examples: ['A = [1, 2, 3; -1, 2, 3; 2, 0, 3]', 'trace(A)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'transpose', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js
new file mode 100644
index 0000000..a565ec5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/transpose.js
@@ -0,0 +1,8 @@
+export var transposeDocs = {
+  name: 'transpose',
+  category: 'Matrix',
+  syntax: ['x\'', 'transpose(x)'],
+  description: 'Transpose a matrix',
+  examples: ['a = [1, 2, 3; 4, 5, 6]', 'a\'', 'transpose(a)'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'zeros']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js
new file mode 100644
index 0000000..c6bbeb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/matrix/zeros.js
@@ -0,0 +1,8 @@
+export var zerosDocs = {
+  name: 'zeros',
+  category: 'Matrix',
+  syntax: ['zeros(m)', 'zeros(m, n)', 'zeros(m, n, p, ...)', 'zeros([m])', 'zeros([m, n])', 'zeros([m, n, p, ...])'],
+  description: 'Create a matrix containing zeros.',
+  examples: ['zeros(3)', 'zeros(3, 5)', 'a = [1, 2, 3; 4, 5, 6]', 'zeros(size(a))'],
+  seealso: ['concat', 'det', 'diag', 'identity', 'inv', 'ones', 'range', 'size', 'squeeze', 'subset', 'trace', 'transpose']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/numeric/solveODE.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/numeric/solveODE.js
new file mode 100644
index 0000000..412cac9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/numeric/solveODE.js
@@ -0,0 +1,8 @@
+export var solveODEDocs = {
+  name: 'solveODE',
+  category: 'Numeric',
+  syntax: ['solveODE(func, tspan, y0)', 'solveODE(func, tspan, y0, options)'],
+  description: 'Numerical Integration of Ordinary Differential Equations.',
+  examples: ['f(t,y) = y', 'tspan = [0, 4]', 'solveODE(f, tspan, 1)', 'solveODE(f, tspan, [1, 2])', 'solveODE(f, tspan, 1, { method:"RK23", maxStep:0.1 })'],
+  seealso: ['derivative', 'simplifyCore']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js
new file mode 100644
index 0000000..e9d3396
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinations.js
@@ -0,0 +1,8 @@
+export var combinationsDocs = {
+  name: 'combinations',
+  category: 'Probability',
+  syntax: ['combinations(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time',
+  examples: ['combinations(7, 5)'],
+  seealso: ['combinationsWithRep', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..1938bf8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/combinationsWithRep.js
@@ -0,0 +1,8 @@
+export var combinationsWithRepDocs = {
+  name: 'combinationsWithRep',
+  category: 'Probability',
+  syntax: ['combinationsWithRep(n, k)'],
+  description: 'Compute the number of combinations of n items taken k at a time with replacements.',
+  examples: ['combinationsWithRep(7, 5)'],
+  seealso: ['combinations', 'permutations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js
new file mode 100644
index 0000000..fce3ffb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/distribution.js
@@ -0,0 +1,8 @@
+export var distributionDocs = {
+  name: 'distribution',
+  category: 'Probability',
+  syntax: ['distribution(name)', 'distribution(name, arg1, arg2, ...)'],
+  description: 'Create a distribution object of a specific type. ' + 'A distribution object contains functions `random([size,] [min,] [max])`, ' + '`randomInt([size,] [min,] [max])` and `pickRandom(array)`. ' + 'Available types of distributions: "uniform", "normal". ' + 'Note that the function distribution is currently not available via the expression parser.',
+  examples: [],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js
new file mode 100644
index 0000000..a3086a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/factorial.js
@@ -0,0 +1,8 @@
+export var factorialDocs = {
+  name: 'factorial',
+  category: 'Probability',
+  syntax: ['n!', 'factorial(n)'],
+  description: 'Compute the factorial of a value',
+  examples: ['5!', '5 * 4 * 3 * 2 * 1', '3!'],
+  seealso: ['combinations', 'combinationsWithRep', 'permutations', 'gamma']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js
new file mode 100644
index 0000000..a5101a2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/gamma.js
@@ -0,0 +1,8 @@
+export var gammaDocs = {
+  name: 'gamma',
+  category: 'Probability',
+  syntax: ['gamma(n)'],
+  description: 'Compute the gamma function. For small values, the Lanczos approximation is used, and for large values the extended Stirling approximation.',
+  examples: ['gamma(4)', '3!', 'gamma(1/2)', 'sqrt(pi)'],
+  seealso: ['factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js
new file mode 100644
index 0000000..f9e967a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/kldivergence.js
@@ -0,0 +1,8 @@
+export var kldivergenceDocs = {
+  name: 'kldivergence',
+  category: 'Probability',
+  syntax: ['kldivergence(x, y)'],
+  description: 'Calculate the Kullback-Leibler (KL) divergence  between two distributions.',
+  examples: ['kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/lgamma.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/lgamma.js
new file mode 100644
index 0000000..0c9c7ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/lgamma.js
@@ -0,0 +1,8 @@
+export var lgammaDocs = {
+  name: 'lgamma',
+  category: 'Probability',
+  syntax: ['lgamma(n)'],
+  description: 'Logarithm of the gamma function for real, positive numbers and complex numbers, ' + 'using Lanczos approximation for numbers and Stirling series for complex numbers.',
+  examples: ['lgamma(4)', 'lgamma(1/2)', 'lgamma(i)', 'lgamma(complex(1.1, 2))'],
+  seealso: ['gamma']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js
new file mode 100644
index 0000000..d32e1f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/multinomial.js
@@ -0,0 +1,8 @@
+export var multinomialDocs = {
+  name: 'multinomial',
+  category: 'Probability',
+  syntax: ['multinomial(A)'],
+  description: 'Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities. multinomial takes one array of integers as an argument. The following condition must be enforced: every ai > 0.',
+  examples: ['multinomial([1, 2, 1])'],
+  seealso: ['combinations', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js
new file mode 100644
index 0000000..f955d24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/permutations.js
@@ -0,0 +1,8 @@
+export var permutationsDocs = {
+  name: 'permutations',
+  category: 'Probability',
+  syntax: ['permutations(n)', 'permutations(n, k)'],
+  description: 'Compute the number of permutations of n items taken k at a time',
+  examples: ['permutations(5)', 'permutations(5, 3)'],
+  seealso: ['combinations', 'combinationsWithRep', 'factorial']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js
new file mode 100644
index 0000000..4acf5dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/pickRandom.js
@@ -0,0 +1,8 @@
+export var pickRandomDocs = {
+  name: 'pickRandom',
+  category: 'Probability',
+  syntax: ['pickRandom(array)', 'pickRandom(array, number)', 'pickRandom(array, weights)', 'pickRandom(array, number, weights)', 'pickRandom(array, weights, number)'],
+  description: 'Pick a random entry from a given array.',
+  examples: ['pickRandom(0:10)', 'pickRandom([1, 3, 1, 6])', 'pickRandom([1, 3, 1, 6], 2)', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], 2, [2, 3, 2, 1])', 'pickRandom([1, 3, 1, 6], [2, 3, 2, 1], 2)'],
+  seealso: ['random', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js
new file mode 100644
index 0000000..69d6711
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/random.js
@@ -0,0 +1,8 @@
+export var randomDocs = {
+  name: 'random',
+  category: 'Probability',
+  syntax: ['random()', 'random(max)', 'random(min, max)', 'random(size)', 'random(size, max)', 'random(size, min, max)'],
+  description: 'Return a random number.',
+  examples: ['random()', 'random(10, 20)', 'random([2, 3])'],
+  seealso: ['pickRandom', 'randomInt']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js
new file mode 100644
index 0000000..6518fc3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/probability/randomInt.js
@@ -0,0 +1,8 @@
+export var randomIntDocs = {
+  name: 'randomInt',
+  category: 'Probability',
+  syntax: ['randomInt(max)', 'randomInt(min, max)', 'randomInt(size)', 'randomInt(size, max)', 'randomInt(size, min, max)'],
+  description: 'Return a random integer number',
+  examples: ['randomInt(10, 20)', 'randomInt([2, 3], 10)'],
+  seealso: ['pickRandom', 'random']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js
new file mode 100644
index 0000000..17361a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compare.js
@@ -0,0 +1,8 @@
+export var compareDocs = {
+  name: 'compare',
+  category: 'Relational',
+  syntax: ['compare(x, y)'],
+  description: 'Compare two values. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compare(2, 3)', 'compare(3, 2)', 'compare(2, 2)', 'compare(5cm, 40mm)', 'compare(2, [1, 2, 3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compareNatural', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js
new file mode 100644
index 0000000..c4202df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareNatural.js
@@ -0,0 +1,8 @@
+export var compareNaturalDocs = {
+  name: 'compareNatural',
+  category: 'Relational',
+  syntax: ['compareNatural(x, y)'],
+  description: 'Compare two values of any type in a deterministic, natural way. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareNatural(2, 3)', 'compareNatural(3, 2)', 'compareNatural(2, 2)', 'compareNatural(5cm, 40mm)', 'compareNatural("2", "10")', 'compareNatural(2 + 3i, 2 + 4i)', 'compareNatural([1, 2, 4], [1, 2, 3])', 'compareNatural([1, 5], [1, 2, 3])', 'compareNatural([1, 2], [1, 2])', 'compareNatural({a: 2}, {a: 4})'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare', 'compareText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js
new file mode 100644
index 0000000..7225760
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/compareText.js
@@ -0,0 +1,8 @@
+export var compareTextDocs = {
+  name: 'compareText',
+  category: 'Relational',
+  syntax: ['compareText(x, y)'],
+  description: 'Compare two strings lexically. Comparison is case sensitive. ' + 'Returns 1 when x > y, -1 when x < y, and 0 when x == y.',
+  examples: ['compareText("B", "A")', 'compareText("A", "B")', 'compareText("A", "A")', 'compareText("2", "10")', 'compare("2", "10")', 'compare(2, 10)', 'compareNatural("2", "10")', 'compareText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js
new file mode 100644
index 0000000..7332e8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/deepEqual.js
@@ -0,0 +1,8 @@
+export var deepEqualDocs = {
+  name: 'deepEqual',
+  category: 'Relational',
+  syntax: ['deepEqual(x, y)'],
+  description: 'Check equality of two matrices element wise. Returns true if the size of both matrices is equal and when and each of the elements are equal.',
+  examples: ['deepEqual([1,3,4], [1,3,4])', 'deepEqual([1,3,4], [1,3])'],
+  seealso: ['equal', 'unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js
new file mode 100644
index 0000000..e0c956d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equal.js
@@ -0,0 +1,8 @@
+export var equalDocs = {
+  name: 'equal',
+  category: 'Relational',
+  syntax: ['x == y', 'equal(x, y)'],
+  description: 'Check equality of two values. Returns true if the values are equal, and false if not.',
+  examples: ['2+2 == 3', '2+2 == 4', 'a = 3.2', 'b = 6-2.8', 'a == b', '50cm == 0.5m'],
+  seealso: ['unequal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual', 'equalText']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js
new file mode 100644
index 0000000..f02230e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/equalText.js
@@ -0,0 +1,8 @@
+export var equalTextDocs = {
+  name: 'equalText',
+  category: 'Relational',
+  syntax: ['equalText(x, y)'],
+  description: 'Check equality of two strings. Comparison is case sensitive. Returns true if the values are equal, and false if not.',
+  examples: ['equalText("Hello", "Hello")', 'equalText("a", "A")', 'equal("2e3", "2000")', 'equalText("2e3", "2000")', 'equalText("B", ["A", "B", "C"])'],
+  seealso: ['compare', 'compareNatural', 'compareText', 'equal']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js
new file mode 100644
index 0000000..c5b28ad
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/larger.js
@@ -0,0 +1,8 @@
+export var largerDocs = {
+  name: 'larger',
+  category: 'Relational',
+  syntax: ['x > y', 'larger(x, y)'],
+  description: 'Check if value x is larger than y. Returns true if x is larger than y, and false if not. Comparing a value with NaN returns false.',
+  examples: ['2 > 3', '5 > 2*2', 'a = 3.3', 'b = 6-2.8', '(a > b)', '(b < a)', '5 cm > 2 inch'],
+  seealso: ['equal', 'unequal', 'smaller', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js
new file mode 100644
index 0000000..22fc8e2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/largerEq.js
@@ -0,0 +1,8 @@
+export var largerEqDocs = {
+  name: 'largerEq',
+  category: 'Relational',
+  syntax: ['x >= y', 'largerEq(x, y)'],
+  description: 'Check if value x is larger or equal to y. Returns true if x is larger or equal to y, and false if not.',
+  examples: ['2 >= 1+1', '2 > 1+1', 'a = 3.2', 'b = 6-2.8', '(a >= b)'],
+  seealso: ['equal', 'unequal', 'smallerEq', 'smaller', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js
new file mode 100644
index 0000000..31f616f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smaller.js
@@ -0,0 +1,8 @@
+export var smallerDocs = {
+  name: 'smaller',
+  category: 'Relational',
+  syntax: ['x < y', 'smaller(x, y)'],
+  description: 'Check if value x is smaller than value y. Returns true if x is smaller than y, and false if not. Comparing a value with NaN returns false.',
+  examples: ['2 < 3', '5 < 2*2', 'a = 3.3', 'b = 6-2.8', '(a < b)', '5 cm < 2 inch'],
+  seealso: ['equal', 'unequal', 'larger', 'smallerEq', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js
new file mode 100644
index 0000000..c0a7b0a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/smallerEq.js
@@ -0,0 +1,8 @@
+export var smallerEqDocs = {
+  name: 'smallerEq',
+  category: 'Relational',
+  syntax: ['x <= y', 'smallerEq(x, y)'],
+  description: 'Check if value x is smaller or equal to value y. Returns true if x is smaller than y, and false if not.',
+  examples: ['2 <= 1+1', '2 < 1+1', 'a = 3.2', 'b = 6-2.8', '(a <= b)'],
+  seealso: ['equal', 'unequal', 'larger', 'smaller', 'largerEq', 'compare']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js
new file mode 100644
index 0000000..df7b95b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/relational/unequal.js
@@ -0,0 +1,8 @@
+export var unequalDocs = {
+  name: 'unequal',
+  category: 'Relational',
+  syntax: ['x != y', 'unequal(x, y)'],
+  description: 'Check unequality of two values. Returns true if the values are unequal, and false if they are equal.',
+  examples: ['2+2 != 3', '2+2 != 4', 'a = 3.2', 'b = 6-2.8', 'a != b', '50cm != 0.5m', '5 cm != 2 inch'],
+  seealso: ['equal', 'smaller', 'larger', 'smallerEq', 'largerEq', 'compare', 'deepEqual']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js
new file mode 100644
index 0000000..2c80f7b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setCartesian.js
@@ -0,0 +1,8 @@
+export var setCartesianDocs = {
+  name: 'setCartesian',
+  category: 'Set',
+  syntax: ['setCartesian(set1, set2)'],
+  description: 'Create the cartesian product of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays and the values will be sorted in ascending order before the operation.',
+  examples: ['setCartesian([1, 2], [3, 4])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference', 'setPowerset']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js
new file mode 100644
index 0000000..844f47b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDifference.js
@@ -0,0 +1,8 @@
+export var setDifferenceDocs = {
+  name: 'setDifference',
+  category: 'Set',
+  syntax: ['setDifference(set1, set2)'],
+  description: 'Create the difference of two (multi)sets: every element of set1, that is not the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setSymDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js
new file mode 100644
index 0000000..50d839e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setDistinct.js
@@ -0,0 +1,8 @@
+export var setDistinctDocs = {
+  name: 'setDistinct',
+  category: 'Set',
+  syntax: ['setDistinct(set)'],
+  description: 'Collect the distinct elements of a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setDistinct([1, 1, 1, 2, 2, 3])'],
+  seealso: ['setMultiplicity']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js
new file mode 100644
index 0000000..b8dd9eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIntersect.js
@@ -0,0 +1,8 @@
+export var setIntersectDocs = {
+  name: 'setIntersect',
+  category: 'Set',
+  syntax: ['setIntersect(set1, set2)'],
+  description: 'Create the intersection of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIntersect([1, 2, 3, 4], [3, 4, 5, 6])', 'setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js
new file mode 100644
index 0000000..095c83f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setIsSubset.js
@@ -0,0 +1,8 @@
+export var setIsSubsetDocs = {
+  name: 'setIsSubset',
+  category: 'Set',
+  syntax: ['setIsSubset(set1, set2)'],
+  description: 'Check whether a (multi)set is a subset of another (multi)set: every element of set1 is the element of set2. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setIsSubset([1, 2], [3, 4, 5, 6])', 'setIsSubset([3, 4], [3, 4, 5, 6])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js
new file mode 100644
index 0000000..8ad1670
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setMultiplicity.js
@@ -0,0 +1,8 @@
+export var setMultiplicityDocs = {
+  name: 'setMultiplicity',
+  category: 'Set',
+  syntax: ['setMultiplicity(element, set)'],
+  description: 'Count the multiplicity of an element in a multiset. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setMultiplicity(1, [1, 2, 2, 4])', 'setMultiplicity(2, [1, 2, 2, 4])'],
+  seealso: ['setDistinct', 'setSize']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js
new file mode 100644
index 0000000..b868e6e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setPowerset.js
@@ -0,0 +1,8 @@
+export var setPowersetDocs = {
+  name: 'setPowerset',
+  category: 'Set',
+  syntax: ['setPowerset(set)'],
+  description: 'Create the powerset of a (multi)set: the powerset contains very possible subsets of a (multi)set. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setPowerset([1, 2, 3])'],
+  seealso: ['setCartesian']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js
new file mode 100644
index 0000000..dbeff60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSize.js
@@ -0,0 +1,8 @@
+export var setSizeDocs = {
+  name: 'setSize',
+  category: 'Set',
+  syntax: ['setSize(set)', 'setSize(set, unique)'],
+  description: 'Count the number of elements of a (multi)set. When the second parameter "unique" is true, count only the unique values. A multi-dimension array will be converted to a single-dimension array before the operation.',
+  examples: ['setSize([1, 2, 2, 4])', 'setSize([1, 2, 2, 4], true)'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js
new file mode 100644
index 0000000..f3bdcd6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setSymDifference.js
@@ -0,0 +1,8 @@
+export var setSymDifferenceDocs = {
+  name: 'setSymDifference',
+  category: 'Set',
+  syntax: ['setSymDifference(set1, set2)'],
+  description: 'Create the symmetric difference of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])', 'setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setUnion', 'setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js
new file mode 100644
index 0000000..fadee5b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/set/setUnion.js
@@ -0,0 +1,8 @@
+export var setUnionDocs = {
+  name: 'setUnion',
+  category: 'Set',
+  syntax: ['setUnion(set1, set2)'],
+  description: 'Create the union of two (multi)sets. Multi-dimension arrays will be converted to single-dimension arrays before the operation.',
+  examples: ['setUnion([1, 2, 3, 4], [3, 4, 5, 6])', 'setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])'],
+  seealso: ['setIntersect', 'setDifference']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/freqz.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/freqz.js
new file mode 100644
index 0000000..f175874
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/freqz.js
@@ -0,0 +1,8 @@
+export var freqzDocs = {
+  name: 'freqz',
+  category: 'Signal',
+  syntax: ['freqz(b, a)', 'freqz(b, a, w)'],
+  description: 'Calculates the frequency response of a filter given its numerator and denominator coefficients.',
+  examples: ['freqz([1, 2], [1, 2, 3])', 'freqz([1, 2], [1, 2, 3], [0, 1])', 'freqz([1, 2], [1, 2, 3], 512)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/zpk2tf.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/zpk2tf.js
new file mode 100644
index 0000000..7d39325
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/signal/zpk2tf.js
@@ -0,0 +1,8 @@
+export var zpk2tfDocs = {
+  name: 'zpk2tf',
+  category: 'Signal',
+  syntax: ['zpk2tf(z, p, k)'],
+  description: 'Compute the transfer function of a zero-pole-gain model.',
+  examples: ['zpk2tf([1, 2], [-1, -2], 1)', 'zpk2tf([1, 2], [-1, -2])', 'zpk2tf([1 - 3i, 2 + 2i], [-1, -2])'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js
new file mode 100644
index 0000000..2a2f63b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/erf.js
@@ -0,0 +1,8 @@
+export var erfDocs = {
+  name: 'erf',
+  category: 'Special',
+  syntax: ['erf(x)'],
+  description: 'Compute the erf function of a value using a rational Chebyshev approximations for different intervals of x',
+  examples: ['erf(0.2)', 'erf(-0.5)', 'erf(4)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/zeta.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/zeta.js
new file mode 100644
index 0000000..fd0d020
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/special/zeta.js
@@ -0,0 +1,8 @@
+export var zetaDocs = {
+  name: 'zeta',
+  category: 'Special',
+  syntax: ['zeta(s)'],
+  description: 'Compute the Riemann Zeta Function using an infinite series and Riemann\'s Functional Equation for the entire complex plane',
+  examples: ['zeta(0.2)', 'zeta(-0.5)', 'zeta(4)'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/corr.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/corr.js
new file mode 100644
index 0000000..9509463
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/corr.js
@@ -0,0 +1,8 @@
+export var corrDocs = {
+  name: 'corr',
+  category: 'Statistics',
+  syntax: ['corr(A,B)'],
+  description: 'Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.',
+  examples: ['corr([2, 4, 6, 8],[1, 2, 3, 6])', 'corr(matrix([[1, 2.2, 3, 4.8, 5], [1, 2, 3, 4, 5]]), matrix([[4, 5.3, 6.6, 7, 8], [1, 2, 3, 4, 5]]))'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js
new file mode 100644
index 0000000..18c3556
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/cumsum.js
@@ -0,0 +1,8 @@
+export var cumSumDocs = {
+  name: 'cumsum',
+  category: 'Statistics',
+  syntax: ['cumsum(a, b, c, ...)', 'cumsum(A)'],
+  description: 'Compute the cumulative sum of all values.',
+  examples: ['cumsum(2, 3, 4, 1)', 'cumsum([2, 3, 4, 1])', 'cumsum([1, 2; 3, 4])', 'cumsum([1, 2; 3, 4], 1)', 'cumsum([1, 2; 3, 4], 2)'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js
new file mode 100644
index 0000000..3ad0341
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mad.js
@@ -0,0 +1,8 @@
+export var madDocs = {
+  name: 'mad',
+  category: 'Statistics',
+  syntax: ['mad(a, b, c, ...)', 'mad(A)'],
+  description: 'Compute the median absolute deviation of a matrix or a list with values. The median absolute deviation is defined as the median of the absolute deviations from the median.',
+  examples: ['mad(10, 20, 30)', 'mad([1, 2, 3])'],
+  seealso: ['mean', 'median', 'std', 'abs']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js
new file mode 100644
index 0000000..6ae2428
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/max.js
@@ -0,0 +1,8 @@
+export var maxDocs = {
+  name: 'max',
+  category: 'Statistics',
+  syntax: ['max(a, b, c, ...)', 'max(A)', 'max(A, dimension)'],
+  description: 'Compute the maximum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',
+  examples: ['max(2, 3, 4, 1)', 'max([2, 3, 4, 1])', 'max([2, 5; 4, 3])', 'max([2, 5; 4, 3], 1)', 'max([2, 5; 4, 3], 2)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['mean', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js
new file mode 100644
index 0000000..3ae39f4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mean.js
@@ -0,0 +1,8 @@
+export var meanDocs = {
+  name: 'mean',
+  category: 'Statistics',
+  syntax: ['mean(a, b, c, ...)', 'mean(A)', 'mean(A, dimension)'],
+  description: 'Compute the arithmetic mean of a list of values.',
+  examples: ['mean(2, 3, 4, 1)', 'mean([2, 3, 4, 1])', 'mean([2, 5; 4, 3])', 'mean([2, 5; 4, 3], 1)', 'mean([2, 5; 4, 3], 2)', 'mean([1.0, 2.7, 3.2, 4.0])'],
+  seealso: ['max', 'median', 'min', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js
new file mode 100644
index 0000000..7461756
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/median.js
@@ -0,0 +1,8 @@
+export var medianDocs = {
+  name: 'median',
+  category: 'Statistics',
+  syntax: ['median(a, b, c, ...)', 'median(A)'],
+  description: 'Compute the median of all values. The values are sorted and the middle value is returned. In case of an even number of values, the average of the two middle values is returned.',
+  examples: ['median(5, 2, 7)', 'median([3, -1, 5, 7])'],
+  seealso: ['max', 'mean', 'min', 'prod', 'std', 'sum', 'variance', 'quantileSeq']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js
new file mode 100644
index 0000000..af4fc92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/min.js
@@ -0,0 +1,8 @@
+export var minDocs = {
+  name: 'min',
+  category: 'Statistics',
+  syntax: ['min(a, b, c, ...)', 'min(A)', 'min(A, dimension)'],
+  description: 'Compute the minimum value of a list of values. If any NaN values are found, the function yields the last NaN in the input.',
+  examples: ['min(2, 3, 4, 1)', 'min([2, 3, 4, 1])', 'min([2, 5; 4, 3])', 'min([2, 5; 4, 3], 1)', 'min([2, 5; 4, 3], 2)', 'min(2.7, 7.1, -4.5, 2.0, 4.1)', 'max(2.7, 7.1, -4.5, 2.0, 4.1)'],
+  seealso: ['max', 'mean', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js
new file mode 100644
index 0000000..e61e57c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/mode.js
@@ -0,0 +1,8 @@
+export var modeDocs = {
+  name: 'mode',
+  category: 'Statistics',
+  syntax: ['mode(a, b, c, ...)', 'mode(A)', 'mode(A, a, b, B, c, ...)'],
+  description: 'Computes the mode of all values as an array. In case mode being more than one, multiple values are returned in an array.',
+  examples: ['mode(2, 1, 4, 3, 1)', 'mode([1, 2.7, 3.2, 4, 2.7])', 'mode(1, 4, 6, 1, 6)'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js
new file mode 100644
index 0000000..7f86d23
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/prod.js
@@ -0,0 +1,8 @@
+export var prodDocs = {
+  name: 'prod',
+  category: 'Statistics',
+  syntax: ['prod(a, b, c, ...)', 'prod(A)'],
+  description: 'Compute the product of all values.',
+  examples: ['prod(2, 3, 4)', 'prod([2, 3, 4])', 'prod([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..e95eaac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/quantileSeq.js
@@ -0,0 +1,8 @@
+export var quantileSeqDocs = {
+  name: 'quantileSeq',
+  category: 'Statistics',
+  syntax: ['quantileSeq(A, prob[, sorted])', 'quantileSeq(A, [prob1, prob2, ...][, sorted])', 'quantileSeq(A, N[, sorted])'],
+  description: 'Compute the prob order quantile of a matrix or a list with values. The sequence is sorted and the middle value is returned. Supported types of sequence values are: Number, BigNumber, Unit Supported types of probability are: Number, BigNumber. \n\nIn case of a (multi dimensional) array or matrix, the prob order quantile of all elements will be calculated.',
+  examples: ['quantileSeq([3, -1, 5, 7], 0.5)', 'quantileSeq([3, -1, 5, 7], [1/3, 2/3])', 'quantileSeq([3, -1, 5, 7], 2)', 'quantileSeq([-1, 3, 5, 7], 0.5, true)'],
+  seealso: ['mean', 'median', 'min', 'max', 'prod', 'std', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js
new file mode 100644
index 0000000..8149980
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/std.js
@@ -0,0 +1,8 @@
+export var stdDocs = {
+  name: 'std',
+  category: 'Statistics',
+  syntax: ['std(a, b, c, ...)', 'std(A)', 'std(A, dimension)', 'std(A, normalization)', 'std(A, dimension, normalization)'],
+  description: 'Compute the standard deviation of all values, defined as std(A) = sqrt(variance(A)). Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['std(2, 4, 6)', 'std([2, 4, 6, 8])', 'std([2, 4, 6, 8], "uncorrected")', 'std([2, 4, 6, 8], "biased")', 'std([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'prod', 'sum', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js
new file mode 100644
index 0000000..93d0723
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/sum.js
@@ -0,0 +1,8 @@
+export var sumDocs = {
+  name: 'sum',
+  category: 'Statistics',
+  syntax: ['sum(a, b, c, ...)', 'sum(A)', 'sum(A, dimension)'],
+  description: 'Compute the sum of all values.',
+  examples: ['sum(2, 3, 4, 1)', 'sum([2, 3, 4, 1])', 'sum([2, 5; 4, 3])'],
+  seealso: ['max', 'mean', 'median', 'min', 'prod', 'std', 'variance']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js
new file mode 100644
index 0000000..1158062
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/statistics/variance.js
@@ -0,0 +1,8 @@
+export var varianceDocs = {
+  name: 'variance',
+  category: 'Statistics',
+  syntax: ['variance(a, b, c, ...)', 'variance(A)', 'variance(A, dimension)', 'variance(A, normalization)', 'variance(A, dimension, normalization)'],
+  description: 'Compute the variance of all values. Optional parameter normalization can be "unbiased" (default), "uncorrected", or "biased".',
+  examples: ['variance(2, 4, 6)', 'variance([2, 4, 6, 8])', 'variance([2, 4, 6, 8], "uncorrected")', 'variance([2, 4, 6, 8], "biased")', 'variance([1, 2, 3; 4, 5, 6])'],
+  seealso: ['max', 'mean', 'min', 'median', 'min', 'prod', 'std', 'sum']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js
new file mode 100644
index 0000000..f2aafc9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acos.js
@@ -0,0 +1,8 @@
+export var acosDocs = {
+  name: 'acos',
+  category: 'Trigonometry',
+  syntax: ['acos(x)'],
+  description: 'Compute the inverse cosine of a value in radians.',
+  examples: ['acos(0.5)', 'acos(cos(2.3))'],
+  seealso: ['cos', 'atan', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js
new file mode 100644
index 0000000..e8be448
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acosh.js
@@ -0,0 +1,8 @@
+export var acoshDocs = {
+  name: 'acosh',
+  category: 'Trigonometry',
+  syntax: ['acosh(x)'],
+  description: 'Calculate the hyperbolic arccos of a value, defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.',
+  examples: ['acosh(1.5)'],
+  seealso: ['cosh', 'asinh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js
new file mode 100644
index 0000000..96dc7df
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acot.js
@@ -0,0 +1,8 @@
+export var acotDocs = {
+  name: 'acot',
+  category: 'Trigonometry',
+  syntax: ['acot(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acot(0.5)', 'acot(cot(0.5))', 'acot(2)'],
+  seealso: ['cot', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js
new file mode 100644
index 0000000..85d3955
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acoth.js
@@ -0,0 +1,8 @@
+export var acothDocs = {
+  name: 'acoth',
+  category: 'Trigonometry',
+  syntax: ['acoth(x)'],
+  description: 'Calculate the inverse hyperbolic tangent of a value, defined as `acoth(x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.',
+  examples: ['acoth(2)', 'acoth(0.5)'],
+  seealso: ['acsch', 'asech']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js
new file mode 100644
index 0000000..9d93a03
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsc.js
@@ -0,0 +1,8 @@
+export var acscDocs = {
+  name: 'acsc',
+  category: 'Trigonometry',
+  syntax: ['acsc(x)'],
+  description: 'Calculate the inverse cotangent of a value.',
+  examples: ['acsc(2)', 'acsc(csc(0.5))', 'acsc(0.5)'],
+  seealso: ['csc', 'asin', 'asec']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js
new file mode 100644
index 0000000..492b548
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/acsch.js
@@ -0,0 +1,8 @@
+export var acschDocs = {
+  name: 'acsch',
+  category: 'Trigonometry',
+  syntax: ['acsch(x)'],
+  description: 'Calculate the inverse hyperbolic cosecant of a value, defined as `acsch(x) = ln(1/x + sqrt(1/x^2 + 1))`.',
+  examples: ['acsch(0.5)'],
+  seealso: ['asech', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js
new file mode 100644
index 0000000..2b3a0c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asec.js
@@ -0,0 +1,8 @@
+export var asecDocs = {
+  name: 'asec',
+  category: 'Trigonometry',
+  syntax: ['asec(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asec(0.5)', 'asec(sec(0.5))', 'asec(2)'],
+  seealso: ['acos', 'acot', 'acsc']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js
new file mode 100644
index 0000000..ed223d8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asech.js
@@ -0,0 +1,8 @@
+export var asechDocs = {
+  name: 'asech',
+  category: 'Trigonometry',
+  syntax: ['asech(x)'],
+  description: 'Calculate the inverse secant of a value.',
+  examples: ['asech(0.5)'],
+  seealso: ['acsch', 'acoth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js
new file mode 100644
index 0000000..4d956e9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asin.js
@@ -0,0 +1,8 @@
+export var asinDocs = {
+  name: 'asin',
+  category: 'Trigonometry',
+  syntax: ['asin(x)'],
+  description: 'Compute the inverse sine of a value in radians.',
+  examples: ['asin(0.5)', 'asin(sin(0.5))'],
+  seealso: ['sin', 'acos', 'atan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js
new file mode 100644
index 0000000..ae60da9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/asinh.js
@@ -0,0 +1,8 @@
+export var asinhDocs = {
+  name: 'asinh',
+  category: 'Trigonometry',
+  syntax: ['asinh(x)'],
+  description: 'Calculate the hyperbolic arcsine of a value, defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.',
+  examples: ['asinh(0.5)'],
+  seealso: ['acosh', 'atanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js
new file mode 100644
index 0000000..3b94dc6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan.js
@@ -0,0 +1,8 @@
+export var atanDocs = {
+  name: 'atan',
+  category: 'Trigonometry',
+  syntax: ['atan(x)'],
+  description: 'Compute the inverse tangent of a value in radians.',
+  examples: ['atan(0.5)', 'atan(tan(0.5))'],
+  seealso: ['tan', 'acos', 'asin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js
new file mode 100644
index 0000000..2489919
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atan2.js
@@ -0,0 +1,8 @@
+export var atan2Docs = {
+  name: 'atan2',
+  category: 'Trigonometry',
+  syntax: ['atan2(y, x)'],
+  description: 'Computes the principal value of the arc tangent of y/x in radians.',
+  examples: ['atan2(2, 2) / pi', 'angle = 60 deg in rad', 'x = cos(angle)', 'y = sin(angle)', 'atan2(y, x)'],
+  seealso: ['sin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js
new file mode 100644
index 0000000..3065fd7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/atanh.js
@@ -0,0 +1,8 @@
+export var atanhDocs = {
+  name: 'atanh',
+  category: 'Trigonometry',
+  syntax: ['atanh(x)'],
+  description: 'Calculate the hyperbolic arctangent of a value, defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.',
+  examples: ['atanh(0.5)'],
+  seealso: ['acosh', 'asinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js
new file mode 100644
index 0000000..6fecbbc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cos.js
@@ -0,0 +1,8 @@
+export var cosDocs = {
+  name: 'cos',
+  category: 'Trigonometry',
+  syntax: ['cos(x)'],
+  description: 'Compute the cosine of x in radians.',
+  examples: ['cos(2)', 'cos(pi / 4) ^ 2', 'cos(180 deg)', 'cos(60 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['acos', 'sin', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js
new file mode 100644
index 0000000..b9b6a81
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cosh.js
@@ -0,0 +1,8 @@
+export var coshDocs = {
+  name: 'cosh',
+  category: 'Trigonometry',
+  syntax: ['cosh(x)'],
+  description: 'Compute the hyperbolic cosine of x in radians.',
+  examples: ['cosh(0.5)'],
+  seealso: ['sinh', 'tanh', 'coth']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js
new file mode 100644
index 0000000..3b48e1f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/cot.js
@@ -0,0 +1,8 @@
+export var cotDocs = {
+  name: 'cot',
+  category: 'Trigonometry',
+  syntax: ['cot(x)'],
+  description: 'Compute the cotangent of x in radians. Defined as 1/tan(x)',
+  examples: ['cot(2)', '1 / tan(2)'],
+  seealso: ['sec', 'csc', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js
new file mode 100644
index 0000000..605e125
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/coth.js
@@ -0,0 +1,8 @@
+export var cothDocs = {
+  name: 'coth',
+  category: 'Trigonometry',
+  syntax: ['coth(x)'],
+  description: 'Compute the hyperbolic cotangent of x in radians.',
+  examples: ['coth(2)', '1 / tanh(2)'],
+  seealso: ['sech', 'csch', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js
new file mode 100644
index 0000000..0ab3e1d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csc.js
@@ -0,0 +1,8 @@
+export var cscDocs = {
+  name: 'csc',
+  category: 'Trigonometry',
+  syntax: ['csc(x)'],
+  description: 'Compute the cosecant of x in radians. Defined as 1/sin(x)',
+  examples: ['csc(2)', '1 / sin(2)'],
+  seealso: ['sec', 'cot', 'sin']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js
new file mode 100644
index 0000000..7c1e0f6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/csch.js
@@ -0,0 +1,8 @@
+export var cschDocs = {
+  name: 'csch',
+  category: 'Trigonometry',
+  syntax: ['csch(x)'],
+  description: 'Compute the hyperbolic cosecant of x in radians. Defined as 1/sinh(x)',
+  examples: ['csch(2)', '1 / sinh(2)'],
+  seealso: ['sech', 'coth', 'sinh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js
new file mode 100644
index 0000000..68e37dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sec.js
@@ -0,0 +1,8 @@
+export var secDocs = {
+  name: 'sec',
+  category: 'Trigonometry',
+  syntax: ['sec(x)'],
+  description: 'Compute the secant of x in radians. Defined as 1/cos(x)',
+  examples: ['sec(2)', '1 / cos(2)'],
+  seealso: ['cot', 'csc', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js
new file mode 100644
index 0000000..3a51e19
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sech.js
@@ -0,0 +1,8 @@
+export var sechDocs = {
+  name: 'sech',
+  category: 'Trigonometry',
+  syntax: ['sech(x)'],
+  description: 'Compute the hyperbolic secant of x in radians. Defined as 1/cosh(x)',
+  examples: ['sech(2)', '1 / cosh(2)'],
+  seealso: ['coth', 'csch', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js
new file mode 100644
index 0000000..79de9f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sin.js
@@ -0,0 +1,8 @@
+export var sinDocs = {
+  name: 'sin',
+  category: 'Trigonometry',
+  syntax: ['sin(x)'],
+  description: 'Compute the sine of x in radians.',
+  examples: ['sin(2)', 'sin(pi / 4) ^ 2', 'sin(90 deg)', 'sin(30 deg)', 'sin(0.2)^2 + cos(0.2)^2'],
+  seealso: ['asin', 'cos', 'tan']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js
new file mode 100644
index 0000000..4656c82
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/sinh.js
@@ -0,0 +1,8 @@
+export var sinhDocs = {
+  name: 'sinh',
+  category: 'Trigonometry',
+  syntax: ['sinh(x)'],
+  description: 'Compute the hyperbolic sine of x in radians.',
+  examples: ['sinh(0.5)'],
+  seealso: ['cosh', 'tanh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js
new file mode 100644
index 0000000..0a96d8e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tan.js
@@ -0,0 +1,8 @@
+export var tanDocs = {
+  name: 'tan',
+  category: 'Trigonometry',
+  syntax: ['tan(x)'],
+  description: 'Compute the tangent of x in radians.',
+  examples: ['tan(0.5)', 'sin(0.5) / cos(0.5)', 'tan(pi / 4)', 'tan(45 deg)'],
+  seealso: ['atan', 'sin', 'cos']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js
new file mode 100644
index 0000000..61cf2dd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/trigonometry/tanh.js
@@ -0,0 +1,8 @@
+export var tanhDocs = {
+  name: 'tanh',
+  category: 'Trigonometry',
+  syntax: ['tanh(x)'],
+  description: 'Compute the hyperbolic tangent of x in radians.',
+  examples: ['tanh(0.5)', 'sinh(0.5) / cosh(0.5)'],
+  seealso: ['sinh', 'cosh']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js
new file mode 100644
index 0000000..090ebee
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/to.js
@@ -0,0 +1,8 @@
+export var toDocs = {
+  name: 'to',
+  category: 'Units',
+  syntax: ['x to unit', 'to(x, unit)'],
+  description: 'Change the unit of a value.',
+  examples: ['5 inch to cm', '3.2kg to g', '16 bytes in bits'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/toBest.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/toBest.js
new file mode 100644
index 0000000..86000b8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/units/toBest.js
@@ -0,0 +1,8 @@
+export var toBestDocs = {
+  name: 'toBest',
+  category: 'Units',
+  syntax: ['toBest(x)', 'toBest(x, unitList)', 'toBest(x, unitList, options)'],
+  description: 'Converts to the most appropriate display unit.',
+  examples: ['toBest(unit(5000, "m"))', 'toBest(unit(3500000, "W"))', 'toBest(unit(0.000000123, "A"))', 'toBest(unit(10, "m"), "cm")', 'toBest(unit(10, "m"), "mm,km", {offset: 1.5})'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js
new file mode 100644
index 0000000..e7f1ac2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/bin.js
@@ -0,0 +1,8 @@
+export var binDocs = {
+  name: 'bin',
+  category: 'Utils',
+  syntax: ['bin(value)'],
+  description: 'Format a number as binary',
+  examples: ['bin(2)'],
+  seealso: ['oct', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js
new file mode 100644
index 0000000..17685b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/clone.js
@@ -0,0 +1,8 @@
+export var cloneDocs = {
+  name: 'clone',
+  category: 'Utils',
+  syntax: ['clone(x)'],
+  description: 'Clone a variable. Creates a copy of primitive variables, and a deep copy of matrices',
+  examples: ['clone(3.5)', 'clone(2 - 4i)', 'clone(45 deg)', 'clone([1, 2; 3, 4])', 'clone("hello world")'],
+  seealso: []
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js
new file mode 100644
index 0000000..a2d5544
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/format.js
@@ -0,0 +1,8 @@
+export var formatDocs = {
+  name: 'format',
+  category: 'Utils',
+  syntax: ['format(value)', 'format(value, precision)'],
+  description: 'Format a value of any type as string.',
+  examples: ['format(2.3)', 'format(3 - 4i)', 'format([])', 'format(pi, 3)'],
+  seealso: ['print']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..fdc397c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hasNumericValue.js
@@ -0,0 +1,8 @@
+export var hasNumericValueDocs = {
+  name: 'hasNumericValue',
+  category: 'Utils',
+  syntax: ['hasNumericValue(x)'],
+  description: 'Test whether a value is an numeric value. ' + 'In case of a string, true is returned if the string contains a numeric value.',
+  examples: ['hasNumericValue(2)', 'hasNumericValue("2")', 'isNumeric("2")', 'hasNumericValue(0)', 'hasNumericValue(bignumber(500))', 'hasNumericValue(fraction(0.125))', 'hasNumericValue(2 + 3i)', 'hasNumericValue([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'isNumeric']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js
new file mode 100644
index 0000000..9764dc4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/hex.js
@@ -0,0 +1,8 @@
+export var hexDocs = {
+  name: 'hex',
+  category: 'Utils',
+  syntax: ['hex(value)'],
+  description: 'Format a number as hexadecimal',
+  examples: ['hex(240)'],
+  seealso: ['bin', 'oct']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js
new file mode 100644
index 0000000..5b87586
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isInteger.js
@@ -0,0 +1,8 @@
+export var isIntegerDocs = {
+  name: 'isInteger',
+  category: 'Utils',
+  syntax: ['isInteger(x)'],
+  description: 'Test whether a value is an integer number.',
+  examples: ['isInteger(2)', 'isInteger(3.5)', 'isInteger([3, 0.5, -2])'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js
new file mode 100644
index 0000000..87bc055
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNaN.js
@@ -0,0 +1,8 @@
+export var isNaNDocs = {
+  name: 'isNaN',
+  category: 'Utils',
+  syntax: ['isNaN(x)'],
+  description: 'Test whether a value is NaN (not a number)',
+  examples: ['isNaN(2)', 'isNaN(0 / 0)', 'isNaN(NaN)', 'isNaN(Infinity)'],
+  seealso: ['isNegative', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js
new file mode 100644
index 0000000..a0f90c5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNegative.js
@@ -0,0 +1,8 @@
+export var isNegativeDocs = {
+  name: 'isNegative',
+  category: 'Utils',
+  syntax: ['isNegative(x)'],
+  description: 'Test whether a value is negative: smaller than zero.',
+  examples: ['isNegative(2)', 'isNegative(0)', 'isNegative(-4)', 'isNegative([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isPositive', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js
new file mode 100644
index 0000000..9ecb3d3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isNumeric.js
@@ -0,0 +1,8 @@
+export var isNumericDocs = {
+  name: 'isNumeric',
+  category: 'Utils',
+  syntax: ['isNumeric(x)'],
+  description: 'Test whether a value is a numeric value. ' + 'Returns true when the input is a number, BigNumber, Fraction, or boolean.',
+  examples: ['isNumeric(2)', 'isNumeric("2")', 'hasNumericValue("2")', 'isNumeric(0)', 'isNumeric(bignumber(500))', 'isNumeric(fraction(0.125))', 'isNumeric(2 + 3i)', 'isNumeric([2.3, "foo", false])'],
+  seealso: ['isInteger', 'isZero', 'isNegative', 'isPositive', 'isNaN', 'hasNumericValue']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js
new file mode 100644
index 0000000..3af6886
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPositive.js
@@ -0,0 +1,8 @@
+export var isPositiveDocs = {
+  name: 'isPositive',
+  category: 'Utils',
+  syntax: ['isPositive(x)'],
+  description: 'Test whether a value is positive: larger than zero.',
+  examples: ['isPositive(2)', 'isPositive(0)', 'isPositive(-4)', 'isPositive([3, 0.5, -2])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js
new file mode 100644
index 0000000..a46ed17
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isPrime.js
@@ -0,0 +1,8 @@
+export var isPrimeDocs = {
+  name: 'isPrime',
+  category: 'Utils',
+  syntax: ['isPrime(x)'],
+  description: 'Test whether a value is prime: has no divisors other than itself and one.',
+  examples: ['isPrime(3)', 'isPrime(-2)', 'isPrime([2, 17, 100])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isZero']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js
new file mode 100644
index 0000000..3e08770
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/isZero.js
@@ -0,0 +1,8 @@
+export var isZeroDocs = {
+  name: 'isZero',
+  category: 'Utils',
+  syntax: ['isZero(x)'],
+  description: 'Test whether a value is zero.',
+  examples: ['isZero(2)', 'isZero(0)', 'isZero(-4)', 'isZero([3, 0, -2, 0])'],
+  seealso: ['isInteger', 'isNumeric', 'isNegative', 'isPositive']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js
new file mode 100644
index 0000000..382f6c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/numeric.js
@@ -0,0 +1,8 @@
+export var numericDocs = {
+  name: 'numeric',
+  category: 'Utils',
+  syntax: ['numeric(x)'],
+  description: 'Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.',
+  examples: ['numeric("4")', 'numeric("4", "number")', 'numeric("4", "bigint")', 'numeric("4", "BigNumber")', 'numeric("4", "Fraction")', 'numeric(4, "Fraction")', 'numeric(fraction(2, 5), "number")'],
+  seealso: ['number', 'bigint', 'fraction', 'bignumber', 'string', 'format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js
new file mode 100644
index 0000000..535a28b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/oct.js
@@ -0,0 +1,8 @@
+export var octDocs = {
+  name: 'oct',
+  category: 'Utils',
+  syntax: ['oct(value)'],
+  description: 'Format a number as octal',
+  examples: ['oct(56)'],
+  seealso: ['bin', 'hex']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js
new file mode 100644
index 0000000..6671b0c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/print.js
@@ -0,0 +1,8 @@
+export var printDocs = {
+  name: 'print',
+  category: 'Utils',
+  syntax: ['print(template, values)', 'print(template, values, precision)'],
+  description: 'Interpolate values into a string template.',
+  examples: ['print("Lucy is $age years old", {age: 5})', 'print("The value of pi is $pi", {pi: pi}, 3)', 'print("Hello, $user.name!", {user: {name: "John"}})', 'print("Values: $1, $2, $3", [6, 9, 4])'],
+  seealso: ['format']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js
new file mode 100644
index 0000000..91629c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/embeddedDocs/function/utils/typeOf.js
@@ -0,0 +1,8 @@
+export var typeOfDocs = {
+  name: 'typeOf',
+  category: 'Utils',
+  syntax: ['typeOf(x)'],
+  description: 'Get the type of a variable.',
+  examples: ['typeOf(3.5)', 'typeOf(2 - 4i)', 'typeOf(45 deg)', 'typeOf("hello world")'],
+  seealso: ['getMatrixDataType']
+};
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/compile.js b/node_modules/mathjs/lib/esm/expression/function/compile.js
new file mode 100644
index 0000000..b9441a7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/compile.js
@@ -0,0 +1,54 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'compile';
+var dependencies = ['typed', 'parse'];
+export var createCompile = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse
+  } = _ref;
+  /**
+   * Parse and compile an expression.
+   * Returns a an object with a function `evaluate([scope])` to evaluate the
+   * compiled expression.
+   *
+   * Syntax:
+   *
+   *     math.compile(expr)                       // returns one node
+   *     math.compile([expr1, expr2, expr3, ...]) // returns an array with nodes
+   *
+   * Examples:
+   *
+   *     const code1 = math.compile('sqrt(3^2 + 4^2)')
+   *     code1.evaluate() // 5
+   *
+   *     let scope = {a: 3, b: 4}
+   *     const code2 = math.compile('a * b') // 12
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.compile(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].evaluate() // 12
+   *
+   * See also:
+   *
+   *    parse, evaluate
+   *
+   * @param {string | string[] | Array | Matrix} expr
+   *            The expression to be compiled
+   * @return {{evaluate: Function} | Array.<{evaluate: Function}>} code
+   *            An object with the compiled expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      return parse(expr).compile();
+    },
+    'Array | Matrix': function Array__Matrix(expr) {
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile();
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/evaluate.js b/node_modules/mathjs/lib/esm/expression/function/evaluate.js
new file mode 100644
index 0000000..a4a68d0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/evaluate.js
@@ -0,0 +1,68 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { createEmptyMap } from '../../utils/map.js';
+var name = 'evaluate';
+var dependencies = ['typed', 'parse'];
+export var createEvaluate = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse
+  } = _ref;
+  /**
+   * Evaluate an expression.
+   *
+   * The expression parser does not use JavaScript. Its syntax is close
+   * to JavaScript but more suited for mathematical expressions.
+   * See [https://mathjs.org/docs/expressions/syntax.html](https://mathjs.org/docs/expressions/syntax.html) to learn
+   * the syntax and get an overview of the exact differences from JavaScript.
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.evaluate(expr)
+   *     math.evaluate(expr, scope)
+   *     math.evaluate([expr1, expr2, expr3, ...])
+   *     math.evaluate([expr1, expr2, expr3, ...], scope)
+   *
+   * Example:
+   *
+   *     math.evaluate('(2+3)/4')                // 1.25
+   *     math.evaluate('sqrt(3^2 + 4^2)')        // 5
+   *     math.evaluate('sqrt(-4)')               // 2i
+   *     math.evaluate(['a=3', 'b=4', 'a*b'])    // [3, 4, 12]
+   *
+   *     let scope = {a:3, b:4}
+   *     math.evaluate('a * b', scope)           // 12
+   *
+   * See also:
+   *
+   *    parse, compile
+   *
+   * @param {string | string[] | Matrix} expr   The expression to be evaluated
+   * @param {Object} [scope]                    Scope to read/write variables
+   * @return {*} The result of the expression
+   * @throws {Error}
+   */
+  return typed(name, {
+    string: function string(expr) {
+      var scope = createEmptyMap();
+      return parse(expr).compile().evaluate(scope);
+    },
+    'string, Map | Object': function string_Map__Object(expr, scope) {
+      return parse(expr).compile().evaluate(scope);
+    },
+    'Array | Matrix': function Array__Matrix(expr) {
+      var scope = createEmptyMap();
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    },
+    'Array | Matrix, Map | Object': function Array__Matrix_Map__Object(expr, scope) {
+      return deepMap(expr, function (entry) {
+        return parse(entry).compile().evaluate(scope);
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/help.js b/node_modules/mathjs/lib/esm/expression/function/help.js
new file mode 100644
index 0000000..8252aba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/help.js
@@ -0,0 +1,66 @@
+import { factory } from '../../utils/factory.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { embeddedDocs } from '../embeddedDocs/embeddedDocs.js';
+import { hasOwnProperty } from '../../utils/object.js';
+var name = 'help';
+var dependencies = ['typed', 'mathWithTransform', 'Help'];
+export var createHelp = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    mathWithTransform,
+    Help
+  } = _ref;
+  /**
+   * Retrieve help on a function or data type.
+   * Help files are retrieved from the embedded documentation in math.docs.
+   *
+   * Syntax:
+   *
+   *    math.help(search)
+   *
+   * Examples:
+   *
+   *    console.log(math.help('sin').toString())
+   *    console.log(math.help(math.add).toString())
+   *    console.log(math.help(math.add).toJSON())
+   *
+   * @param {Function | string | Object} search   A function or function name
+   *                                              for which to get help
+   * @return {Help} A help object
+   */
+  return typed(name, {
+    any: function any(search) {
+      var prop;
+      var searchName = search;
+      if (typeof search !== 'string') {
+        for (prop in mathWithTransform) {
+          // search in functions and constants
+          if (hasOwnProperty(mathWithTransform, prop) && search === mathWithTransform[prop]) {
+            searchName = prop;
+            break;
+          }
+        }
+
+        /* TODO: implement help for data types
+         if (!text) {
+         // search data type
+         for (prop in math.type) {
+         if (hasOwnProperty(math, prop)) {
+         if (search === math.type[prop]) {
+         text = prop
+         break
+         }
+         }
+         }
+         }
+         */
+      }
+      var doc = getSafeProperty(embeddedDocs, searchName);
+      if (!doc) {
+        var searchText = typeof searchName === 'function' ? searchName.name : searchName;
+        throw new Error('No documentation found on "' + searchText + '"');
+      }
+      return new Help(doc);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/function/parser.js b/node_modules/mathjs/lib/esm/expression/function/parser.js
new file mode 100644
index 0000000..efb4df0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/function/parser.js
@@ -0,0 +1,57 @@
+import { factory } from '../../utils/factory.js';
+var name = 'parser';
+var dependencies = ['typed', 'Parser'];
+export var createParser = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Parser
+  } = _ref;
+  /**
+   * Create a `math.Parser` object that keeps a context of variables and their values, allowing the evaluation of expressions in that context.
+   *
+   * Syntax:
+   *
+   *    math.parser()
+   *
+   * Examples:
+   *
+   *     const parser = new math.parser()
+   *
+   *     // evaluate expressions
+   *     const a = parser.evaluate('sqrt(3^2 + 4^2)') // 5
+   *     const b = parser.evaluate('sqrt(-4)')        // 2i
+   *     const c = parser.evaluate('2 inch in cm')    // 5.08 cm
+   *     const d = parser.evaluate('cos(45 deg)')     // 0.7071067811865476
+   *
+   *     // define variables and functions
+   *     parser.evaluate('x = 7 / 2')             // 3.5
+   *     parser.evaluate('x + 3')                 // 6.5
+   *     parser.evaluate('f(x, y) = x^y')         // f(x, y)
+   *     parser.evaluate('f(2, 3)')               // 8
+   *
+   *     // get and set variables and functions
+   *     const x = parser.get('x')                // 3.5
+   *     const f = parser.get('f')                // function
+   *     const g = f(3, 2)                        // 9
+   *     parser.set('h', 500)
+   *     const i = parser.evaluate('h / 2')       // 250
+   *     parser.set('hello', function (name) {
+   *       return 'hello, ' + name + '!'
+   *     })
+   *     parser.evaluate('hello("user")')         // "hello, user!"
+   *
+   *     // clear defined functions and variables
+   *     parser.clear()
+   *
+   * See also:
+   *
+   *    evaluate, compile, parse
+   *
+   * @return {Parser} Parser
+   */
+  return typed(name, {
+    '': function _() {
+      return new Parser();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/keywords.js b/node_modules/mathjs/lib/esm/expression/keywords.js
new file mode 100644
index 0000000..4ab02b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/keywords.js
@@ -0,0 +1,2 @@
+// Reserved keywords not allowed to use in the parser
+export var keywords = new Set(['end']);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js b/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js
new file mode 100644
index 0000000..de4b92d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/AccessorNode.js
@@ -0,0 +1,189 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isNode, isObjectNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { accessFactory } from './utils/access.js';
+var name = 'AccessorNode';
+var dependencies = ['subset', 'Node'];
+export var createAccessorNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    subset,
+    Node
+  } = _ref;
+  var access = accessFactory({
+    subset
+  });
+
+  /**
+   * Are parenthesis needed?
+   * @private
+   */
+  function needParenthesis(node) {
+    // TODO: maybe make a method on the nodes which tells whether they need parenthesis?
+    return !(isAccessorNode(node) || isArrayNode(node) || isConstantNode(node) || isFunctionNode(node) || isObjectNode(node) || isParenthesisNode(node) || isSymbolNode(node));
+  }
+  class AccessorNode extends Node {
+    /**
+     * @constructor AccessorNode
+     * @extends {Node}
+     * Access an object property or get a matrix subset
+     *
+     * @param {Node} object                 The object from which to retrieve
+     *                                      a property or subset.
+     * @param {IndexNode} index             IndexNode containing ranges
+     */
+    constructor(object, index) {
+      super();
+      if (!isNode(object)) {
+        throw new TypeError('Node expected for parameter "object"');
+      }
+      if (!isIndexNode(index)) {
+        throw new TypeError('IndexNode expected for parameter "index"');
+      }
+      this.object = object;
+      this.index = index;
+    }
+
+    // readonly property name
+    get name() {
+      if (this.index) {
+        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+      } else {
+        return this.object.name || '';
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isAccessorNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalObject = this.object._compile(math, argNames);
+      var evalIndex = this.index._compile(math, argNames);
+      if (this.index.isObjectProperty()) {
+        var prop = this.index.getObjectProperty();
+        return function evalAccessorNode(scope, args, context) {
+          // get a property from an object evaluated using the scope.
+          return getSafeProperty(evalObject(scope, args, context), prop);
+        };
+      } else {
+        return function evalAccessorNode(scope, args, context) {
+          var object = evalObject(scope, args, context);
+          // we pass just object here instead of context:
+          var index = evalIndex(scope, args, object);
+          return access(object, index);
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.object, 'object', this);
+      callback(this.index, 'index', this);
+    }
+
+    /**
+     * Create a new AccessorNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {AccessorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new AccessorNode(this._ifNode(callback(this.object, 'object', this)), this._ifNode(callback(this.index, 'index', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {AccessorNode}
+     */
+    clone() {
+      return new AccessorNode(this.object, this.index);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toString(options) {
+      var object = this.object.toString(options);
+      if (needParenthesis(this.object)) {
+        object = '(' + object + ')';
+      }
+      return object + this.index.toString(options);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toHTML(options) {
+      var object = this.object.toHTML(options);
+      if (needParenthesis(this.object)) {
+        object = '<span class="math-parenthesis math-round-parenthesis">(</span>' + object + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return object + this.index.toHTML(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toTex(options) {
+      var object = this.object.toTex(options);
+      if (needParenthesis(this.object)) {
+        object = '\\left(\' + object + \'\\right)';
+      }
+      return object + this.index.toTex(options);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        object: this.object,
+        index: this.index
+      };
+    }
+
+    /**
+     * Instantiate an AccessorNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "AccessorNode", object: ..., index: ...}`,
+     *     where mathjs is optional
+     * @returns {AccessorNode}
+     */
+    static fromJSON(json) {
+      return new AccessorNode(json.object, json.index);
+    }
+  }
+  _defineProperty(AccessorNode, "name", name);
+  return AccessorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js b/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js
new file mode 100644
index 0000000..9382a2c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ArrayNode.js
@@ -0,0 +1,176 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isArrayNode, isNode } from '../../utils/is.js';
+import { map } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ArrayNode';
+var dependencies = ['Node'];
+export var createArrayNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  class ArrayNode extends Node {
+    /**
+     * @constructor ArrayNode
+     * @extends {Node}
+     * Holds an 1-dimensional array with items
+     * @param {Node[]} [items]   1 dimensional array with items
+     */
+    constructor(items) {
+      super();
+      this.items = items || [];
+
+      // validate input
+      if (!Array.isArray(this.items) || !this.items.every(isNode)) {
+        throw new TypeError('Array containing Nodes expected');
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isArrayNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalItems = map(this.items, function (item) {
+        return item._compile(math, argNames);
+      });
+      var asMatrix = math.config.matrix !== 'Array';
+      if (asMatrix) {
+        var matrix = math.matrix;
+        return function evalArrayNode(scope, args, context) {
+          return matrix(map(evalItems, function (evalItem) {
+            return evalItem(scope, args, context);
+          }));
+        };
+      } else {
+        return function evalArrayNode(scope, args, context) {
+          return map(evalItems, function (evalItem) {
+            return evalItem(scope, args, context);
+          });
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (var i = 0; i < this.items.length; i++) {
+        var node = this.items[i];
+        callback(node, 'items[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new ArrayNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ArrayNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var items = [];
+      for (var i = 0; i < this.items.length; i++) {
+        items[i] = this._ifNode(callback(this.items[i], 'items[' + i + ']', this));
+      }
+      return new ArrayNode(items);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ArrayNode}
+     */
+    clone() {
+      return new ArrayNode(this.items.slice(0));
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      var items = this.items.map(function (node) {
+        return node.toString(options);
+      });
+      return '[' + items.join(', ') + ']';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        items: this.items
+      };
+    }
+
+    /**
+     * Instantiate an ArrayNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ArrayNode", items: [...]}`,
+     *                       where mathjs is optional
+     * @returns {ArrayNode}
+     */
+    static fromJSON(json) {
+      return new ArrayNode(json.items);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      var items = this.items.map(function (node) {
+        return node.toHTML(options);
+      });
+      return '<span class="math-parenthesis math-square-parenthesis">[</span>' + items.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      function itemsToTex(items, nested) {
+        var mixedItems = items.some(isArrayNode) && !items.every(isArrayNode);
+        var itemsFormRow = nested || mixedItems;
+        var itemSep = itemsFormRow ? '&' : '\\\\';
+        var itemsTex = items.map(function (node) {
+          if (node.items) {
+            return itemsToTex(node.items, !nested);
+          } else {
+            return node.toTex(options);
+          }
+        }).join(itemSep);
+        return mixedItems || !itemsFormRow || itemsFormRow && !nested ? '\\begin{bmatrix}' + itemsTex + '\\end{bmatrix}' : itemsTex;
+      }
+      return itemsToTex(this.items, false);
+    }
+  }
+  _defineProperty(ArrayNode, "name", name);
+  return ArrayNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js b/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js
new file mode 100644
index 0000000..dacaadb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/AssignmentNode.js
@@ -0,0 +1,306 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isAccessorNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';
+import { getSafeProperty, setSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { accessFactory } from './utils/access.js';
+import { assignFactory } from './utils/assign.js';
+import { getPrecedence } from '../operators.js';
+var name = 'AssignmentNode';
+var dependencies = ['subset', '?matrix',
+// FIXME: should not be needed at all, should be handled by subset
+'Node'];
+export var createAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    subset,
+    matrix,
+    Node
+  } = _ref;
+  var access = accessFactory({
+    subset
+  });
+  var assign = assignFactory({
+    subset,
+    matrix
+  });
+
+  /*
+   * Is parenthesis needed?
+   * @param {node} node
+   * @param {string} [parenthesis='keep']
+   * @param {string} implicit
+   * @private
+   */
+  function needParenthesis(node, parenthesis, implicit) {
+    if (!parenthesis) {
+      parenthesis = 'keep';
+    }
+    var precedence = getPrecedence(node, parenthesis, implicit);
+    var exprPrecedence = getPrecedence(node.value, parenthesis, implicit);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  class AssignmentNode extends Node {
+    /**
+     * @constructor AssignmentNode
+     * @extends {Node}
+     *
+     * Define a symbol, like `a=3.2`, update a property like `a.b=3.2`, or
+     * replace a subset of a matrix like `A[2,2]=42`.
+     *
+     * Syntax:
+     *
+     *     new AssignmentNode(symbol, value)
+     *     new AssignmentNode(object, index, value)
+     *
+     * Usage:
+     *
+     *    new AssignmentNode(new SymbolNode('a'), new ConstantNode(2))  // a=2
+     *    new AssignmentNode(new SymbolNode('a'),
+     *                       new IndexNode('b'),
+     *                       new ConstantNode(2))   // a.b=2
+     *    new AssignmentNode(new SymbolNode('a'),
+     *                       new IndexNode(1, 2),
+     *                       new ConstantNode(3))  // a[1,2]=3
+     *
+     * @param {SymbolNode | AccessorNode} object
+     *     Object on which to assign a value
+     * @param {IndexNode} [index=null]
+     *     Index, property name or matrix index. Optional. If not provided
+     *     and `object` is a SymbolNode, the property is assigned to the
+     *     global scope.
+     * @param {Node} value
+     *     The value to be assigned
+     */
+    constructor(object, index, value) {
+      super();
+      this.object = object;
+      this.index = value ? index : null;
+      this.value = value || index;
+
+      // validate input
+      if (!isSymbolNode(object) && !isAccessorNode(object)) {
+        throw new TypeError('SymbolNode or AccessorNode expected as "object"');
+      }
+      if (isSymbolNode(object) && object.name === 'end') {
+        throw new Error('Cannot assign to symbol "end"');
+      }
+      if (this.index && !isIndexNode(this.index)) {
+        // index is optional
+        throw new TypeError('IndexNode expected as "index"');
+      }
+      if (!isNode(this.value)) {
+        throw new TypeError('Node expected as "value"');
+      }
+    }
+
+    // class name for typing purposes:
+
+    // readonly property name
+    get name() {
+      if (this.index) {
+        return this.index.isObjectProperty() ? this.index.getObjectProperty() : '';
+      } else {
+        return this.object.name || '';
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isAssignmentNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalObject = this.object._compile(math, argNames);
+      var evalIndex = this.index ? this.index._compile(math, argNames) : null;
+      var evalValue = this.value._compile(math, argNames);
+      var name = this.object.name;
+      if (!this.index) {
+        // apply a variable to the scope, for example `a=2`
+        if (!isSymbolNode(this.object)) {
+          throw new TypeError('SymbolNode expected as object');
+        }
+        return function evalAssignmentNode(scope, args, context) {
+          var value = evalValue(scope, args, context);
+          scope.set(name, value);
+          return value;
+        };
+      } else if (this.index.isObjectProperty()) {
+        // apply an object property for example `a.b=2`
+        var prop = this.index.getObjectProperty();
+        return function evalAssignmentNode(scope, args, context) {
+          var object = evalObject(scope, args, context);
+          var value = evalValue(scope, args, context);
+          setSafeProperty(object, prop, value);
+          return value;
+        };
+      } else if (isSymbolNode(this.object)) {
+        // update a matrix subset, for example `a[2]=3`
+        return function evalAssignmentNode(scope, args, context) {
+          var childObject = evalObject(scope, args, context);
+          var value = evalValue(scope, args, context);
+          // Important:  we pass childObject instead of context:
+          var index = evalIndex(scope, args, childObject);
+          scope.set(name, assign(childObject, index, value));
+          return value;
+        };
+      } else {
+        // isAccessorNode(node.object) === true
+        // update a matrix subset, for example `a.b[2]=3`
+
+        // we will not use the compile function of the AccessorNode, but
+        // compile it ourselves here as we need the parent object of the
+        // AccessorNode:
+        // wee need to apply the updated object to parent object
+        var evalParentObject = this.object.object._compile(math, argNames);
+        if (this.object.index.isObjectProperty()) {
+          var parentProp = this.object.index.getObjectProperty();
+          return function evalAssignmentNode(scope, args, context) {
+            var parent = evalParentObject(scope, args, context);
+            var childObject = getSafeProperty(parent, parentProp);
+            // Important: we pass childObject instead of context:
+            var index = evalIndex(scope, args, childObject);
+            var value = evalValue(scope, args, context);
+            setSafeProperty(parent, parentProp, assign(childObject, index, value));
+            return value;
+          };
+        } else {
+          // if some parameters use the 'end' parameter, we need to calculate
+          // the size
+          var evalParentIndex = this.object.index._compile(math, argNames);
+          return function evalAssignmentNode(scope, args, context) {
+            var parent = evalParentObject(scope, args, context);
+            // Important: we pass parent instead of context:
+            var parentIndex = evalParentIndex(scope, args, parent);
+            var childObject = access(parent, parentIndex);
+            // Important:  we pass childObject instead of context
+            var index = evalIndex(scope, args, childObject);
+            var value = evalValue(scope, args, context);
+            assign(parent, parentIndex, assign(childObject, index, value));
+            return value;
+          };
+        }
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.object, 'object', this);
+      if (this.index) {
+        callback(this.index, 'index', this);
+      }
+      callback(this.value, 'value', this);
+    }
+
+    /**
+     * Create a new AssignmentNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {AssignmentNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var object = this._ifNode(callback(this.object, 'object', this));
+      var index = this.index ? this._ifNode(callback(this.index, 'index', this)) : null;
+      var value = this._ifNode(callback(this.value, 'value', this));
+      return new AssignmentNode(object, index, value);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {AssignmentNode}
+     */
+    clone() {
+      return new AssignmentNode(this.object, this.index, this.value);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toString(options) {
+      var object = this.object.toString(options);
+      var index = this.index ? this.index.toString(options) : '';
+      var value = this.value.toString(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = '(' + value + ')';
+      }
+      return object + index + ' = ' + value;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        object: this.object,
+        index: this.index,
+        value: this.value
+      };
+    }
+
+    /**
+     * Instantiate an AssignmentNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "AssignmentNode", object: ..., index: ..., value: ...}`,
+     *     where mathjs is optional
+     * @returns {AssignmentNode}
+     */
+    static fromJSON(json) {
+      return new AssignmentNode(json.object, json.index, json.value);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toHTML(options) {
+      var object = this.object.toHTML(options);
+      var index = this.index ? this.index.toHTML(options) : '';
+      var value = this.value.toHTML(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = '<span class="math-paranthesis math-round-parenthesis">(</span>' + value + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+      }
+      return object + index + '<span class="math-operator math-assignment-operator ' + 'math-variable-assignment-operator math-binary-operator">=</span>' + value;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string}
+     */
+    _toTex(options) {
+      var object = this.object.toTex(options);
+      var index = this.index ? this.index.toTex(options) : '';
+      var value = this.value.toTex(options);
+      if (needParenthesis(this, options && options.parenthesis, options && options.implicit)) {
+        value = "\\left(".concat(value, "\\right)");
+      }
+      return object + index + '=' + value;
+    }
+  }
+  _defineProperty(AssignmentNode, "name", name);
+  return AssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/BlockNode.js b/node_modules/mathjs/lib/esm/expression/node/BlockNode.js
new file mode 100644
index 0000000..e32f428
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/BlockNode.js
@@ -0,0 +1,185 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isNode } from '../../utils/is.js';
+import { forEach, map } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'BlockNode';
+var dependencies = ['ResultSet', 'Node'];
+export var createBlockNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    ResultSet,
+    Node
+  } = _ref;
+  class BlockNode extends Node {
+    /**
+     * @constructor BlockNode
+     * @extends {Node}
+     * Holds a set with blocks
+     * @param {Array.<{node: Node} | {node: Node, visible: boolean}>} blocks
+     *            An array with blocks, where a block is constructed as an
+     *            Object with properties block, which is a Node, and visible,
+     *            which is a boolean. The property visible is optional and
+     *            is true by default
+     */
+    constructor(blocks) {
+      super();
+      // validate input, copy blocks
+      if (!Array.isArray(blocks)) throw new Error('Array expected');
+      this.blocks = blocks.map(function (block) {
+        var node = block && block.node;
+        var visible = block && block.visible !== undefined ? block.visible : true;
+        if (!isNode(node)) throw new TypeError('Property "node" must be a Node');
+        if (typeof visible !== 'boolean') {
+          throw new TypeError('Property "visible" must be a boolean');
+        }
+        return {
+          node,
+          visible
+        };
+      });
+    }
+    get type() {
+      return name;
+    }
+    get isBlockNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalBlocks = map(this.blocks, function (block) {
+        return {
+          evaluate: block.node._compile(math, argNames),
+          visible: block.visible
+        };
+      });
+      return function evalBlockNodes(scope, args, context) {
+        var results = [];
+        forEach(evalBlocks, function evalBlockNode(block) {
+          var result = block.evaluate(scope, args, context);
+          if (block.visible) {
+            results.push(result);
+          }
+        });
+        return new ResultSet(results);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child blocks of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (var i = 0; i < this.blocks.length; i++) {
+        callback(this.blocks[i].node, 'blocks[' + i + '].node', this);
+      }
+    }
+
+    /**
+     * Create a new BlockNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {BlockNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var blocks = [];
+      for (var i = 0; i < this.blocks.length; i++) {
+        var block = this.blocks[i];
+        var node = this._ifNode(callback(block.node, 'blocks[' + i + '].node', this));
+        blocks[i] = {
+          node,
+          visible: block.visible
+        };
+      }
+      return new BlockNode(blocks);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {BlockNode}
+     */
+    clone() {
+      var blocks = this.blocks.map(function (block) {
+        return {
+          node: block.node,
+          visible: block.visible
+        };
+      });
+      return new BlockNode(blocks);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toString(options) + (param.visible ? '' : ';');
+      }).join('\n');
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        blocks: this.blocks
+      };
+    }
+
+    /**
+     * Instantiate an BlockNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "BlockNode", blocks: [{node: ..., visible: false}, ...]}`,
+     *     where mathjs is optional
+     * @returns {BlockNode}
+     */
+    static fromJSON(json) {
+      return new BlockNode(json.blocks);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toHTML(options) + (param.visible ? '' : '<span class="math-separator">;</span>');
+      }).join('<span class="math-separator"><br /></span>');
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      return this.blocks.map(function (param) {
+        return param.node.toTex(options) + (param.visible ? '' : ';');
+      }).join('\\;\\;\n');
+    }
+  }
+  _defineProperty(BlockNode, "name", name);
+  return BlockNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js b/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js
new file mode 100644
index 0000000..3dfb8c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ConditionalNode.js
@@ -0,0 +1,225 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isBigNumber, isComplex, isNode, isUnit, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { getPrecedence } from '../operators.js';
+var name = 'ConditionalNode';
+var dependencies = ['Node'];
+export var createConditionalNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  /**
+   * Test whether a condition is met
+   * @param {*} condition
+   * @returns {boolean} true if condition is true or non-zero, else false
+   */
+  function testCondition(condition) {
+    if (typeof condition === 'number' || typeof condition === 'boolean' || typeof condition === 'string') {
+      return !!condition;
+    }
+    if (condition) {
+      if (isBigNumber(condition)) {
+        return !condition.isZero();
+      }
+      if (isComplex(condition)) {
+        return !!(condition.re || condition.im);
+      }
+      if (isUnit(condition)) {
+        return !!condition.value;
+      }
+    }
+    if (condition === null || condition === undefined) {
+      return false;
+    }
+    throw new TypeError('Unsupported type of condition "' + typeOf(condition) + '"');
+  }
+  class ConditionalNode extends Node {
+    /**
+     * A lazy evaluating conditional operator: 'condition ? trueExpr : falseExpr'
+     *
+     * @param {Node} condition   Condition, must result in a boolean
+     * @param {Node} trueExpr    Expression evaluated when condition is true
+     * @param {Node} falseExpr   Expression evaluated when condition is true
+     *
+     * @constructor ConditionalNode
+     * @extends {Node}
+     */
+    constructor(condition, trueExpr, falseExpr) {
+      super();
+      if (!isNode(condition)) {
+        throw new TypeError('Parameter condition must be a Node');
+      }
+      if (!isNode(trueExpr)) {
+        throw new TypeError('Parameter trueExpr must be a Node');
+      }
+      if (!isNode(falseExpr)) {
+        throw new TypeError('Parameter falseExpr must be a Node');
+      }
+      this.condition = condition;
+      this.trueExpr = trueExpr;
+      this.falseExpr = falseExpr;
+    }
+    get type() {
+      return name;
+    }
+    get isConditionalNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalCondition = this.condition._compile(math, argNames);
+      var evalTrueExpr = this.trueExpr._compile(math, argNames);
+      var evalFalseExpr = this.falseExpr._compile(math, argNames);
+      return function evalConditionalNode(scope, args, context) {
+        return testCondition(evalCondition(scope, args, context)) ? evalTrueExpr(scope, args, context) : evalFalseExpr(scope, args, context);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.condition, 'condition', this);
+      callback(this.trueExpr, 'trueExpr', this);
+      callback(this.falseExpr, 'falseExpr', this);
+    }
+
+    /**
+     * Create a new ConditionalNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ConditionalNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new ConditionalNode(this._ifNode(callback(this.condition, 'condition', this)), this._ifNode(callback(this.trueExpr, 'trueExpr', this)), this._ifNode(callback(this.falseExpr, 'falseExpr', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ConditionalNode}
+     */
+    clone() {
+      return new ConditionalNode(this.condition, this.trueExpr, this.falseExpr);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var precedence = getPrecedence(this, parenthesis, options && options.implicit);
+
+      // Enclose Arguments in parentheses if they are an OperatorNode
+      // or have lower or equal precedence
+      // NOTE: enclosing all OperatorNodes in parentheses is a decision
+      // purely based on aesthetics and readability
+      var condition = this.condition.toString(options);
+      var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+        condition = '(' + condition + ')';
+      }
+      var trueExpr = this.trueExpr.toString(options);
+      var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+        trueExpr = '(' + trueExpr + ')';
+      }
+      var falseExpr = this.falseExpr.toString(options);
+      var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+        falseExpr = '(' + falseExpr + ')';
+      }
+      return condition + ' ? ' + trueExpr + ' : ' + falseExpr;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        condition: this.condition,
+        trueExpr: this.trueExpr,
+        falseExpr: this.falseExpr
+      };
+    }
+
+    /**
+     * Instantiate an ConditionalNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "ConditionalNode",
+     *      "condition": ...,
+     *      "trueExpr": ...,
+     *      "falseExpr": ...}
+     *     ```
+     *     where mathjs is optional
+     * @returns {ConditionalNode}
+     */
+    static fromJSON(json) {
+      return new ConditionalNode(json.condition, json.trueExpr, json.falseExpr);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var precedence = getPrecedence(this, parenthesis, options && options.implicit);
+
+      // Enclose Arguments in parentheses if they are an OperatorNode
+      // or have lower or equal precedence
+      // NOTE: enclosing all OperatorNodes in parentheses is a decision
+      // purely based on aesthetics and readability
+      var condition = this.condition.toHTML(options);
+      var conditionPrecedence = getPrecedence(this.condition, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.condition.type === 'OperatorNode' || conditionPrecedence !== null && conditionPrecedence <= precedence) {
+        condition = '<span class="math-parenthesis math-round-parenthesis">(</span>' + condition + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      var trueExpr = this.trueExpr.toHTML(options);
+      var truePrecedence = getPrecedence(this.trueExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.trueExpr.type === 'OperatorNode' || truePrecedence !== null && truePrecedence <= precedence) {
+        trueExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + trueExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      var falseExpr = this.falseExpr.toHTML(options);
+      var falsePrecedence = getPrecedence(this.falseExpr, parenthesis, options && options.implicit);
+      if (parenthesis === 'all' || this.falseExpr.type === 'OperatorNode' || falsePrecedence !== null && falsePrecedence <= precedence) {
+        falseExpr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + falseExpr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return condition + '<span class="math-operator math-conditional-operator">?</span>' + trueExpr + '<span class="math-operator math-conditional-operator">:</span>' + falseExpr;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      return '\\begin{cases} {' + this.trueExpr.toTex(options) + '}, &\\quad{\\text{if }\\;' + this.condition.toTex(options) + '}\\\\{' + this.falseExpr.toTex(options) + '}, &\\quad{\\text{otherwise}}\\end{cases}';
+    }
+  }
+  _defineProperty(ConditionalNode, "name", name);
+  return ConditionalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js b/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js
new file mode 100644
index 0000000..908eb87
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ConstantNode.js
@@ -0,0 +1,179 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { format } from '../../utils/string.js';
+import { typeOf } from '../../utils/is.js';
+import { escapeLatex } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ConstantNode';
+var dependencies = ['Node'];
+export var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  class ConstantNode extends Node {
+    /**
+     * A ConstantNode holds a constant value like a number or string.
+     *
+     * Usage:
+     *
+     *     new ConstantNode(2.3)
+     *     new ConstantNode('hello')
+     *
+     * @param {*} value    Value can be any type (number, BigNumber, bigint, string, ...)
+     * @constructor ConstantNode
+     * @extends {Node}
+     */
+    constructor(value) {
+      super();
+      this.value = value;
+    }
+    get type() {
+      return name;
+    }
+    get isConstantNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var value = this.value;
+      return function evalConstantNode() {
+        return value;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // nothing to do, we don't have any children
+    }
+
+    /**
+     * Create a new ConstantNode with children produced by the given callback.
+     * Trivial because there are no children.
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {ConstantNode} Returns a clone of the node
+     */
+    map(callback) {
+      return this.clone();
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ConstantNode}
+     */
+    clone() {
+      return new ConstantNode(this.value);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      return format(this.value, options);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var value = this._toString(options);
+      switch (typeOf(this.value)) {
+        case 'number':
+        case 'bigint':
+        case 'BigNumber':
+        case 'Fraction':
+          return '<span class="math-number">' + value + '</span>';
+        case 'string':
+          return '<span class="math-string">' + value + '</span>';
+        case 'boolean':
+          return '<span class="math-boolean">' + value + '</span>';
+        case 'null':
+          return '<span class="math-null-symbol">' + value + '</span>';
+        case 'undefined':
+          return '<span class="math-undefined">' + value + '</span>';
+        default:
+          return '<span class="math-symbol">' + value + '</span>';
+      }
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        value: this.value
+      };
+    }
+
+    /**
+     * Instantiate a ConstantNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "SymbolNode", value: 2.3}`,
+     *                       where mathjs is optional
+     * @returns {ConstantNode}
+     */
+    static fromJSON(json) {
+      return new ConstantNode(json.value);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var value = this._toString(options);
+      var type = typeOf(this.value);
+      switch (type) {
+        case 'string':
+          return '\\mathtt{' + escapeLatex(value) + '}';
+        case 'number':
+        case 'BigNumber':
+          {
+            var finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+            if (!finite) {
+              return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
+            }
+            var index = value.toLowerCase().indexOf('e');
+            if (index !== -1) {
+              return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
+            }
+            return value;
+          }
+        case 'bigint':
+          {
+            return value.toString();
+          }
+        case 'Fraction':
+          return this.value.toLatex();
+        default:
+          return value;
+      }
+    }
+  }
+  _defineProperty(ConstantNode, "name", name);
+  return ConstantNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js b/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js
new file mode 100644
index 0000000..632744d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/FunctionAssignmentNode.js
@@ -0,0 +1,237 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isNode } from '../../utils/is.js';
+import { keywords } from '../keywords.js';
+import { escape } from '../../utils/string.js';
+import { forEach, join } from '../../utils/array.js';
+import { toSymbol } from '../../utils/latex.js';
+import { getPrecedence } from '../operators.js';
+import { factory } from '../../utils/factory.js';
+var name = 'FunctionAssignmentNode';
+var dependencies = ['typed', 'Node'];
+export var createFunctionAssignmentNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Node
+  } = _ref;
+  /**
+   * Is parenthesis needed?
+   * @param {Node} node
+   * @param {Object} parenthesis
+   * @param {string} implicit
+   * @private
+   */
+  function needParenthesis(node, parenthesis, implicit) {
+    var precedence = getPrecedence(node, parenthesis, implicit);
+    var exprPrecedence = getPrecedence(node.expr, parenthesis, implicit);
+    return parenthesis === 'all' || exprPrecedence !== null && exprPrecedence <= precedence;
+  }
+  class FunctionAssignmentNode extends Node {
+    /**
+     * @constructor FunctionAssignmentNode
+     * @extends {Node}
+     * Function assignment
+     *
+     * @param {string} name           Function name
+     * @param {string[] | Array.<{name: string, type: string}>} params
+     *                                Array with function parameter names, or an
+     *                                array with objects containing the name
+     *                                and type of the parameter
+     * @param {Node} expr             The function expression
+     */
+    constructor(name, params, expr) {
+      super();
+      // validate input
+      if (typeof name !== 'string') {
+        throw new TypeError('String expected for parameter "name"');
+      }
+      if (!Array.isArray(params)) {
+        throw new TypeError('Array containing strings or objects expected for parameter "params"');
+      }
+      if (!isNode(expr)) {
+        throw new TypeError('Node expected for parameter "expr"');
+      }
+      if (keywords.has(name)) {
+        throw new Error('Illegal function name, "' + name + '" is a reserved keyword');
+      }
+      var paramNames = new Set();
+      for (var param of params) {
+        var _name = typeof param === 'string' ? param : param.name;
+        if (paramNames.has(_name)) {
+          throw new Error("Duplicate parameter name \"".concat(_name, "\""));
+        } else {
+          paramNames.add(_name);
+        }
+      }
+      this.name = name;
+      this.params = params.map(function (param) {
+        return param && param.name || param;
+      });
+      this.types = params.map(function (param) {
+        return param && param.type || 'any';
+      });
+      this.expr = expr;
+    }
+    get type() {
+      return name;
+    }
+    get isFunctionAssignmentNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var childArgNames = Object.create(argNames);
+      forEach(this.params, function (param) {
+        childArgNames[param] = true;
+      });
+
+      // compile the function expression with the child args
+      var expr = this.expr;
+      var evalExpr = expr._compile(math, childArgNames);
+      var name = this.name;
+      var params = this.params;
+      var signature = join(this.types, ',');
+      var syntax = name + '(' + join(this.params, ', ') + ')';
+      return function evalFunctionAssignmentNode(scope, args, context) {
+        var signatures = {};
+        signatures[signature] = function () {
+          var childArgs = Object.create(args);
+          for (var i = 0; i < params.length; i++) {
+            childArgs[params[i]] = arguments[i];
+          }
+          return evalExpr(scope, childArgs, context);
+        };
+        var fn = typed(name, signatures);
+        fn.syntax = syntax;
+        fn.expr = expr.toString();
+        scope.set(name, fn);
+        return fn;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.expr, 'expr', this);
+    }
+
+    /**
+     * Create a new FunctionAssignmentNode whose children are the results of
+     * calling the provided callback function for each child of the original
+     * node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {FunctionAssignmentNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var expr = this._ifNode(callback(this.expr, 'expr', this));
+      return new FunctionAssignmentNode(this.name, this.params.slice(0), expr);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {FunctionAssignmentNode}
+     */
+    clone() {
+      return new FunctionAssignmentNode(this.name, this.params.slice(0), this.expr);
+    }
+
+    /**
+     * get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var expr = this.expr.toString(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = '(' + expr + ')';
+      }
+      return this.name + '(' + this.params.join(', ') + ') = ' + expr;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      var types = this.types;
+      return {
+        mathjs: name,
+        name: this.name,
+        params: this.params.map(function (param, index) {
+          return {
+            name: param,
+            type: types[index]
+          };
+        }),
+        expr: this.expr
+      };
+    }
+
+    /**
+     * Instantiate an FunctionAssignmentNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "FunctionAssignmentNode",
+     *      name: ..., params: ..., expr: ...}
+     *     ```
+     *     where mathjs is optional
+     * @returns {FunctionAssignmentNode}
+     */
+    static fromJSON(json) {
+      return new FunctionAssignmentNode(json.name, json.params, json.expr);
+    }
+
+    /**
+     * get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var params = [];
+      for (var i = 0; i < this.params.length; i++) {
+        params.push('<span class="math-symbol math-parameter">' + escape(this.params[i]) + '</span>');
+      }
+      var expr = this.expr.toHTML(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = '<span class="math-parenthesis math-round-parenthesis">(</span>' + expr + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return '<span class="math-function">' + escape(this.name) + '</span>' + '<span class="math-parenthesis math-round-parenthesis">(</span>' + params.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-round-parenthesis">)</span>' + '<span class="math-operator math-assignment-operator ' + 'math-variable-assignment-operator math-binary-operator">=</span>' + expr;
+    }
+
+    /**
+     * get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var expr = this.expr.toTex(options);
+      if (needParenthesis(this, parenthesis, options && options.implicit)) {
+        expr = "\\left(".concat(expr, "\\right)");
+      }
+      return '\\mathrm{' + this.name + '}\\left(' + this.params.map(toSymbol).join(',') + '\\right)=' + expr;
+    }
+  }
+  _defineProperty(FunctionAssignmentNode, "name", name);
+  return FunctionAssignmentNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js b/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js
new file mode 100644
index 0000000..19e896d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/FunctionNode.js
@@ -0,0 +1,479 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isAccessorNode, isFunctionAssignmentNode, isIndexNode, isNode, isSymbolNode } from '../../utils/is.js';
+import { escape, format } from '../../utils/string.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { getSafeProperty, getSafeMethod } from '../../utils/customs.js';
+import { createSubScope } from '../../utils/scope.js';
+import { factory } from '../../utils/factory.js';
+import { defaultTemplate, latexFunctions } from '../../utils/latex.js';
+var name = 'FunctionNode';
+var dependencies = ['math', 'Node', 'SymbolNode'];
+export var createFunctionNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var _FunctionNode;
+  var {
+    math,
+    Node,
+    SymbolNode
+  } = _ref;
+  /* format to fixed length */
+  var strin = entity => format(entity, {
+    truncate: 78
+  });
+
+  /*
+   * Expand a LaTeX template
+   *
+   * @param {string} template
+   * @param {Node} node
+   * @param {Object} options
+   * @private
+   **/
+  function expandTemplate(template, node, options) {
+    var latex = '';
+
+    // Match everything of the form ${identifier} or ${identifier[2]} or $$
+    // while submatching identifier and 2 (in the second case)
+    var regex = /\$(?:\{([a-z_][a-z_0-9]*)(?:\[([0-9]+)\])?\}|\$)/gi;
+    var inputPos = 0; // position in the input string
+    var match;
+    while ((match = regex.exec(template)) !== null) {
+      // go through all matches
+      // add everything in front of the match to the LaTeX string
+      latex += template.substring(inputPos, match.index);
+      inputPos = match.index;
+      if (match[0] === '$$') {
+        // escaped dollar sign
+        latex += '$';
+        inputPos++;
+      } else {
+        // template parameter
+        inputPos += match[0].length;
+        var property = node[match[1]];
+        if (!property) {
+          throw new ReferenceError('Template: Property ' + match[1] + ' does not exist.');
+        }
+        if (match[2] === undefined) {
+          // no square brackets
+          switch (typeof property) {
+            case 'string':
+              latex += property;
+              break;
+            case 'object':
+              if (isNode(property)) {
+                latex += property.toTex(options);
+              } else if (Array.isArray(property)) {
+                // make array of Nodes into comma separated list
+                latex += property.map(function (arg, index) {
+                  if (isNode(arg)) {
+                    return arg.toTex(options);
+                  }
+                  throw new TypeError('Template: ' + match[1] + '[' + index + '] is not a Node.');
+                }).join(',');
+              } else {
+                throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+              }
+              break;
+            default:
+              throw new TypeError('Template: ' + match[1] + ' has to be a Node, String or array of Nodes');
+          }
+        } else {
+          // with square brackets
+          if (isNode(property[match[2]] && property[match[2]])) {
+            latex += property[match[2]].toTex(options);
+          } else {
+            throw new TypeError('Template: ' + match[1] + '[' + match[2] + '] is not a Node.');
+          }
+        }
+      }
+    }
+    latex += template.slice(inputPos); // append rest of the template
+
+    return latex;
+  }
+  class FunctionNode extends Node {
+    /**
+     * @constructor FunctionNode
+     * @extends {./Node}
+     * invoke a list with arguments on a node
+     * @param {./Node | string} fn
+     *     Item resolving to a function on which to invoke
+     *     the arguments, typically a SymbolNode or AccessorNode
+     * @param {./Node[]} args
+     */
+    constructor(fn, args) {
+      super();
+      if (typeof fn === 'string') {
+        fn = new SymbolNode(fn);
+      }
+
+      // validate input
+      if (!isNode(fn)) throw new TypeError('Node expected as parameter "fn"');
+      if (!Array.isArray(args) || !args.every(isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "args"');
+      }
+      this.fn = fn;
+      this.args = args || [];
+    }
+
+    // readonly property name
+    get name() {
+      return this.fn.name || '';
+    }
+    get type() {
+      return name;
+    }
+    get isFunctionNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // compile arguments
+      var evalArgs = this.args.map(arg => arg._compile(math, argNames));
+      if (isSymbolNode(this.fn)) {
+        var _name = this.fn.name;
+        if (!argNames[_name]) {
+          // we can statically determine whether the function
+          // has the rawArgs property
+          var fn = _name in math ? getSafeProperty(math, _name) : undefined;
+          var isRaw = typeof fn === 'function' && fn.rawArgs === true;
+          var resolveFn = scope => {
+            var value;
+            if (scope.has(_name)) {
+              value = scope.get(_name);
+            } else if (_name in math) {
+              value = getSafeProperty(math, _name);
+            } else {
+              return FunctionNode.onUndefinedFunction(_name);
+            }
+            if (typeof value === 'function') {
+              return value;
+            }
+            throw new TypeError("'".concat(_name, "' is not a function; its value is:\n  ").concat(strin(value)));
+          };
+          if (isRaw) {
+            // pass unevaluated parameters (nodes) to the function
+            // "raw" evaluation
+            var rawArgs = this.args;
+            return function evalFunctionNode(scope, args, context) {
+              var fn = resolveFn(scope);
+
+              // the original function can be overwritten in the scope with a non-rawArgs function
+              if (fn.rawArgs === true) {
+                return fn(rawArgs, math, createSubScope(scope, args));
+              } else {
+                // "regular" evaluation
+                var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+                return fn(...values);
+              }
+            };
+          } else {
+            // "regular" evaluation
+            switch (evalArgs.length) {
+              case 0:
+                return function evalFunctionNode(scope, args, context) {
+                  var fn = resolveFn(scope);
+                  return fn();
+                };
+              case 1:
+                return function evalFunctionNode(scope, args, context) {
+                  var fn = resolveFn(scope);
+                  var evalArg0 = evalArgs[0];
+                  return fn(evalArg0(scope, args, context));
+                };
+              case 2:
+                return function evalFunctionNode(scope, args, context) {
+                  var fn = resolveFn(scope);
+                  var evalArg0 = evalArgs[0];
+                  var evalArg1 = evalArgs[1];
+                  return fn(evalArg0(scope, args, context), evalArg1(scope, args, context));
+                };
+              default:
+                return function evalFunctionNode(scope, args, context) {
+                  var fn = resolveFn(scope);
+                  var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+                  return fn(...values);
+                };
+            }
+          }
+        } else {
+          // the function symbol is an argName
+          var _rawArgs = this.args;
+          return function evalFunctionNode(scope, args, context) {
+            var fn = getSafeProperty(args, _name);
+            if (typeof fn !== 'function') {
+              throw new TypeError("Argument '".concat(_name, "' was not a function; received: ").concat(strin(fn)));
+            }
+            if (fn.rawArgs) {
+              // "Raw" evaluation
+              return fn(_rawArgs, math, createSubScope(scope, args));
+            } else {
+              var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+              return fn.apply(fn, values);
+            }
+          };
+        }
+      } else if (isAccessorNode(this.fn) && isIndexNode(this.fn.index) && this.fn.index.isObjectProperty()) {
+        // execute the function with the right context:
+        // the object of the AccessorNode
+
+        var evalObject = this.fn.object._compile(math, argNames);
+        var prop = this.fn.index.getObjectProperty();
+        var _rawArgs2 = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          var object = evalObject(scope, args, context);
+          var fn = getSafeMethod(object, prop);
+          if (fn !== null && fn !== void 0 && fn.rawArgs) {
+            // "Raw" evaluation
+            return fn(_rawArgs2, math, createSubScope(scope, args));
+          } else {
+            // "regular" evaluation
+            var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+            return fn.apply(object, values);
+          }
+        };
+      } else {
+        // node.fn.isAccessorNode && !node.fn.index.isObjectProperty()
+        // we have to dynamically determine whether the function has the
+        // rawArgs property
+        var fnExpr = this.fn.toString();
+        var evalFn = this.fn._compile(math, argNames);
+        var _rawArgs3 = this.args;
+        return function evalFunctionNode(scope, args, context) {
+          var fn = evalFn(scope, args, context);
+          if (typeof fn !== 'function') {
+            throw new TypeError("Expression '".concat(fnExpr, "' did not evaluate to a function; value is:") + "\n  ".concat(strin(fn)));
+          }
+          if (fn.rawArgs) {
+            // "Raw" evaluation
+            return fn(_rawArgs3, math, createSubScope(scope, args));
+          } else {
+            // "regular" evaluation
+            var values = evalArgs.map(evalArg => evalArg(scope, args, context));
+            return fn.apply(fn, values);
+          }
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.fn, 'fn', this);
+      for (var i = 0; i < this.args.length; i++) {
+        callback(this.args[i], 'args[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new FunctionNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {FunctionNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var fn = this._ifNode(callback(this.fn, 'fn', this));
+      var args = [];
+      for (var i = 0; i < this.args.length; i++) {
+        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+      }
+      return new FunctionNode(fn, args);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {FunctionNode}
+     */
+    clone() {
+      return new FunctionNode(this.fn, this.args.slice(0));
+    }
+
+    /**
+     * Throws an error 'Undefined function {name}'
+     * @param {string} name
+     */
+
+    /**
+     * Get string representation. (wrapper function)
+     * This overrides parts of Node's toString function.
+     * If callback is an object containing callbacks, it
+     * calls the correct callback for the current node,
+     * otherwise it falls back to calling Node's toString
+     * function.
+     *
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    toString(options) {
+      var customString;
+      var name = this.fn.toString(options);
+      if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, name)) {
+        // callback is a map of callback functions
+        customString = options.handler[name](this, options);
+      }
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+
+      // fall back to Node's toString
+      return super.toString(options);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var args = this.args.map(function (arg) {
+        return arg.toString(options);
+      });
+      var fn = isFunctionAssignmentNode(this.fn) ? '(' + this.fn.toString(options) + ')' : this.fn.toString(options);
+
+      // format the arguments like "add(2, 4.2)"
+      return fn + '(' + args.join(', ') + ')';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        fn: this.fn,
+        args: this.args
+      };
+    }
+
+    /**
+     * Instantiate an AssignmentNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "FunctionNode", fn: ..., args: ...}`,
+     *                       where mathjs is optional
+     * @returns {FunctionNode}
+     */
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var args = this.args.map(function (arg) {
+        return arg.toHTML(options);
+      });
+
+      // format the arguments like "add(2, 4.2)"
+      return '<span class="math-function">' + escape(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">(</span>' + args.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+    }
+
+    /**
+     * Get LaTeX representation. (wrapper function)
+     * This overrides parts of Node's toTex function.
+     * If callback is an object containing callbacks, it
+     * calls the correct callback for the current node,
+     * otherwise it falls back to calling Node's toTex
+     * function.
+     *
+     * @param {Object} options
+     * @return {string}
+     */
+    toTex(options) {
+      var customTex;
+      if (options && typeof options.handler === 'object' && hasOwnProperty(options.handler, this.name)) {
+        // callback is a map of callback functions
+        customTex = options.handler[this.name](this, options);
+      }
+      if (typeof customTex !== 'undefined') {
+        return customTex;
+      }
+
+      // fall back to Node's toTex
+      return super.toTex(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var args = this.args.map(function (arg) {
+        // get LaTeX of the arguments
+        return arg.toTex(options);
+      });
+      var latexConverter;
+      if (latexFunctions[this.name]) {
+        latexConverter = latexFunctions[this.name];
+      }
+
+      // toTex property on the function itself
+      if (math[this.name] && (typeof math[this.name].toTex === 'function' || typeof math[this.name].toTex === 'object' || typeof math[this.name].toTex === 'string')) {
+        // .toTex is a callback function
+        latexConverter = math[this.name].toTex;
+      }
+      var customToTex;
+      switch (typeof latexConverter) {
+        case 'function':
+          // a callback function
+          customToTex = latexConverter(this, options);
+          break;
+        case 'string':
+          // a template string
+          customToTex = expandTemplate(latexConverter, this, options);
+          break;
+        case 'object':
+          // an object with different "converters" for different
+          // numbers of arguments
+          switch (typeof latexConverter[args.length]) {
+            case 'function':
+              customToTex = latexConverter[args.length](this, options);
+              break;
+            case 'string':
+              customToTex = expandTemplate(latexConverter[args.length], this, options);
+              break;
+          }
+      }
+      if (typeof customToTex !== 'undefined') {
+        return customToTex;
+      }
+      return expandTemplate(defaultTemplate, this, options);
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type + ':' + this.name;
+    }
+  }
+  _FunctionNode = FunctionNode;
+  _defineProperty(FunctionNode, "name", name);
+  _defineProperty(FunctionNode, "onUndefinedFunction", function (name) {
+    throw new Error('Undefined function ' + name);
+  });
+  _defineProperty(FunctionNode, "fromJSON", function (json) {
+    return new _FunctionNode(json.fn, json.args);
+  });
+  return FunctionNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/IndexNode.js b/node_modules/mathjs/lib/esm/expression/node/IndexNode.js
new file mode 100644
index 0000000..5c91a21
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/IndexNode.js
@@ -0,0 +1,219 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { map } from '../../utils/array.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { isArray, isConstantNode, isMatrix, isNode, isString, typeOf } from '../../utils/is.js';
+import { escape } from '../../utils/string.js';
+var name = 'IndexNode';
+var dependencies = ['Node', 'size'];
+export var createIndexNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node,
+    size
+  } = _ref;
+  class IndexNode extends Node {
+    /**
+     * @constructor IndexNode
+     * @extends Node
+     *
+     * Describes a subset of a matrix or an object property.
+     * Cannot be used on its own, needs to be used within an AccessorNode or
+     * AssignmentNode.
+     *
+     * @param {Node[]} dimensions
+     * @param {boolean} [dotNotation=false]
+     *     Optional property describing whether this index was written using dot
+     *     notation like `a.b`, or using bracket notation like `a["b"]`
+     *     (which is the default). This property is used for string conversion.
+     */
+    constructor(dimensions, dotNotation) {
+      super();
+      this.dimensions = dimensions;
+      this.dotNotation = dotNotation || false;
+
+      // validate input
+      if (!Array.isArray(dimensions) || !dimensions.every(isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "dimensions"');
+      }
+      if (this.dotNotation && !this.isObjectProperty()) {
+        throw new Error('dotNotation only applicable for object properties');
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isIndexNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // TODO: implement support for bignumber (currently bignumbers are silently
+      //       reduced to numbers when changing the value to zero-based)
+
+      // TODO: Optimization: when the range values are ConstantNodes,
+      //       we can beforehand resolve the zero-based value
+
+      // optimization for a simple object property
+      var evalDimensions = map(this.dimensions, function (dimension, i) {
+        var needsEnd = dimension.filter(node => node.isSymbolNode && node.name === 'end').length > 0;
+        if (needsEnd) {
+          // SymbolNode 'end' is used inside the index,
+          // like in `A[end]` or `A[end - 2]`
+          var childArgNames = Object.create(argNames);
+          childArgNames.end = true;
+          var _evalDimension = dimension._compile(math, childArgNames);
+          return function evalDimension(scope, args, context) {
+            if (!isMatrix(context) && !isArray(context) && !isString(context)) {
+              throw new TypeError('Cannot resolve "end": ' + 'context must be a Matrix, Array, or string but is ' + typeOf(context));
+            }
+            var s = size(context).valueOf();
+            var childArgs = Object.create(args);
+            childArgs.end = s[i];
+            return _evalDimension(scope, childArgs, context);
+          };
+        } else {
+          // SymbolNode `end` not used
+          return dimension._compile(math, argNames);
+        }
+      });
+      var index = getSafeProperty(math, 'index');
+      return function evalIndexNode(scope, args, context) {
+        var dimensions = map(evalDimensions, function (evalDimension) {
+          return evalDimension(scope, args, context);
+        });
+        return index(...dimensions);
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (var i = 0; i < this.dimensions.length; i++) {
+        callback(this.dimensions[i], 'dimensions[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new IndexNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {IndexNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var dimensions = [];
+      for (var i = 0; i < this.dimensions.length; i++) {
+        dimensions[i] = this._ifNode(callback(this.dimensions[i], 'dimensions[' + i + ']', this));
+      }
+      return new IndexNode(dimensions, this.dotNotation);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {IndexNode}
+     */
+    clone() {
+      return new IndexNode(this.dimensions.slice(0), this.dotNotation);
+    }
+
+    /**
+     * Test whether this IndexNode contains a single property name
+     * @return {boolean}
+     */
+    isObjectProperty() {
+      return this.dimensions.length === 1 && isConstantNode(this.dimensions[0]) && typeof this.dimensions[0].value === 'string';
+    }
+
+    /**
+     * Returns the property name if IndexNode contains a property.
+     * If not, returns null.
+     * @return {string | null}
+     */
+    getObjectProperty() {
+      return this.isObjectProperty() ? this.dimensions[0].value : null;
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      // format the parameters like "[1, 0:5]"
+      return this.dotNotation ? '.' + this.getObjectProperty() : '[' + this.dimensions.join(', ') + ']';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        dimensions: this.dimensions,
+        dotNotation: this.dotNotation
+      };
+    }
+
+    /**
+     * Instantiate an IndexNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "IndexNode", dimensions: [...], dotNotation: false}`,
+     *     where mathjs is optional
+     * @returns {IndexNode}
+     */
+    static fromJSON(json) {
+      return new IndexNode(json.dimensions, json.dotNotation);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      // format the parameters like "[1, 0:5]"
+      var dimensions = [];
+      for (var i = 0; i < this.dimensions.length; i++) {
+        dimensions[i] = this.dimensions[i].toHTML();
+      }
+      if (this.dotNotation) {
+        return '<span class="math-operator math-accessor-operator">.</span>' + '<span class="math-symbol math-property">' + escape(this.getObjectProperty()) + '</span>';
+      } else {
+        return '<span class="math-parenthesis math-square-parenthesis">[</span>' + dimensions.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-square-parenthesis">]</span>';
+      }
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var dimensions = this.dimensions.map(function (range) {
+        return range.toTex(options);
+      });
+      return this.dotNotation ? '.' + this.getObjectProperty() + '' : '_{' + dimensions.join(',') + '}';
+    }
+  }
+  _defineProperty(IndexNode, "name", name);
+  return IndexNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/Node.js b/node_modules/mathjs/lib/esm/expression/node/Node.js
new file mode 100644
index 0000000..17a7671
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/Node.js
@@ -0,0 +1,372 @@
+import { isNode } from '../../utils/is.js';
+import { keywords } from '../keywords.js';
+import { deepStrictEqual } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+import { createMap } from '../../utils/map.js';
+var name = 'Node';
+var dependencies = ['mathWithTransform'];
+export var createNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    mathWithTransform
+  } = _ref;
+  /**
+   * Validate the symbol names of a scope.
+   * Throws an error when the scope contains an illegal symbol.
+   * @param {Object} scope
+   */
+  function _validateScope(scope) {
+    for (var symbol of [...keywords]) {
+      if (scope.has(symbol)) {
+        throw new Error('Scope contains an illegal symbol, "' + symbol + '" is a reserved keyword');
+      }
+    }
+  }
+  class Node {
+    get type() {
+      return 'Node';
+    }
+    get isNode() {
+      return true;
+    }
+
+    /**
+     * Evaluate the node
+     * @param {Object} [scope]  Scope to read/write variables
+     * @return {*}              Returns the result
+     */
+    evaluate(scope) {
+      return this.compile().evaluate(scope);
+    }
+
+    /**
+     * Compile the node into an optimized, evauatable JavaScript function
+     * @return {{evaluate: function([Object])}} object
+     *                Returns an object with a function 'evaluate',
+     *                which can be invoked as expr.evaluate([scope: Object]),
+     *                where scope is an optional object with
+     *                variables.
+     */
+    compile() {
+      var expr = this._compile(mathWithTransform, {});
+      var args = {};
+      var context = null;
+      function evaluate(scope) {
+        var s = createMap(scope);
+        _validateScope(s);
+        return expr(s, args, context);
+      }
+      return {
+        evaluate
+      };
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      throw new Error('Method _compile must be implemented by type ' + this.type);
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot run forEach on a Node interface');
+    }
+
+    /**
+     * Create a new Node whose children are the results of calling the
+     * provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {OperatorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot run map on a Node interface');
+    }
+
+    /**
+     * Validate whether an object is a Node, for use with map
+     * @param {Node} node
+     * @returns {Node} Returns the input if it's a node, else throws an Error
+     * @protected
+     */
+    _ifNode(node) {
+      if (!isNode(node)) {
+        throw new TypeError('Callback function must return a Node');
+      }
+      return node;
+    }
+
+    /**
+     * Recursively traverse all nodes in a node tree. Executes given callback for
+     * this node and each of its child nodes.
+     * @param {function(node: Node, path: string, parent: Node)} callback
+     *          A callback called for every node in the node tree.
+     */
+    traverse(callback) {
+      // execute callback for itself
+      // eslint-disable-next-line
+      callback(this, null, null);
+
+      // recursively traverse over all children of a node
+      function _traverse(node, callback) {
+        node.forEach(function (child, path, parent) {
+          callback(child, path, parent);
+          _traverse(child, callback);
+        });
+      }
+      _traverse(this, callback);
+    }
+
+    /**
+     * Recursively transform a node tree via a transform function.
+     *
+     * For example, to replace all nodes of type SymbolNode having name 'x' with
+     * a ConstantNode with value 2:
+     *
+     *     const res = Node.transform(function (node, path, parent) {
+     *       if (node && node.isSymbolNode) && (node.name === 'x')) {
+     *         return new ConstantNode(2)
+     *       }
+     *       else {
+     *         return node
+     *       }
+     *     })
+     *
+     * @param {function(node: Node, path: string, parent: Node) : Node} callback
+     *          A mapping function accepting a node, and returning
+     *          a replacement for the node or the original node. The "signature"
+     *          of the callback must be:
+     *          callback(node: Node, index: string, parent: Node) : Node
+     * @return {Node} Returns the original node or its replacement
+     */
+    transform(callback) {
+      function _transform(child, path, parent) {
+        var replacement = callback(child, path, parent);
+        if (replacement !== child) {
+          // stop iterating when the node is replaced
+          return replacement;
+        }
+        return child.map(_transform);
+      }
+      return _transform(this, null, null);
+    }
+
+    /**
+     * Find any node in the node tree matching given filter function. For
+     * example, to find all nodes of type SymbolNode having name 'x':
+     *
+     *     const results = Node.filter(function (node) {
+     *       return (node && node.isSymbolNode) && (node.name === 'x')
+     *     })
+     *
+     * @param {function(node: Node, path: string, parent: Node) : Node} callback
+     *            A test function returning true when a node matches, and false
+     *            otherwise. Function signature:
+     *            callback(node: Node, index: string, parent: Node) : boolean
+     * @return {Node[]} nodes
+     *            An array with nodes matching given filter criteria
+     */
+    filter(callback) {
+      var nodes = [];
+      this.traverse(function (node, path, parent) {
+        if (callback(node, path, parent)) {
+          nodes.push(node);
+        }
+      });
+      return nodes;
+    }
+
+    /**
+     * Create a shallow clone of this node
+     * @return {Node}
+     */
+    clone() {
+      // must be implemented by each of the Node implementations
+      throw new Error('Cannot clone a Node interface');
+    }
+
+    /**
+     * Create a deep clone of this node
+     * @return {Node}
+     */
+    cloneDeep() {
+      return this.map(function (node) {
+        return node.cloneDeep();
+      });
+    }
+
+    /**
+     * Deep compare this node with another node.
+     * @param {Node} other
+     * @return {boolean} Returns true when both nodes are of the same type and
+     *                   contain the same values (as do their childs)
+     */
+    equals(other) {
+      return other ? this.type === other.type && deepStrictEqual(this, other) : false;
+    }
+
+    /**
+     * Get string representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)"or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toString(options) {
+      var customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toString(options);
+    }
+
+    /**
+     * Internal function to generate the string output.
+     * This has to be implemented by every Node
+     *
+     * @throws {Error}
+     */
+    _toString() {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toString not implemented for ' + this.type);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * Both .toJSON() and the static .fromJSON(json) should be implemented by all
+     * implementations of Node
+     * @returns {Object}
+     */
+    toJSON() {
+      throw new Error('Cannot serialize object: toJSON not implemented by ' + this.type);
+    }
+
+    /**
+     * Get HTML representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)" or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toHTML(options) {
+      var customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toHTML(options);
+    }
+
+    /**
+     * Internal function to generate the HTML output.
+     * This has to be implemented by every Node
+     *
+     * @throws {Error}
+     */
+    _toHTML() {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toHTML not implemented for ' + this.type);
+    }
+
+    /**
+     * Get LaTeX representation. (wrapper function)
+     *
+     * This function can get an object of the following form:
+     * {
+     *    handler: //This can be a callback function of the form
+     *             // "function callback(node, options)"or
+     *             // a map that maps function names (used in FunctionNodes)
+     *             // to callbacks
+     *    parenthesis: "keep" //the parenthesis option (This is optional)
+     * }
+     *
+     * @param {Object} [options]
+     * @return {string}
+     */
+    toTex(options) {
+      var customString = this._getCustomString(options);
+      if (typeof customString !== 'undefined') {
+        return customString;
+      }
+      return this._toTex(options);
+    }
+
+    /**
+     * Internal function to generate the LaTeX output.
+     * This has to be implemented by every Node
+     *
+     * @param {Object} [options]
+     * @throws {Error}
+     */
+    _toTex(options) {
+      // must be implemented by each of the Node implementations
+      throw new Error('_toTex not implemented for ' + this.type);
+    }
+
+    /**
+     * Helper used by `to...` functions.
+     */
+    _getCustomString(options) {
+      if (options && typeof options === 'object') {
+        switch (typeof options.handler) {
+          case 'object':
+          case 'undefined':
+            return;
+          case 'function':
+            return options.handler(this, options);
+          default:
+            throw new TypeError('Object or function expected as callback');
+        }
+      }
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type;
+    }
+
+    /**
+     * Get the content of the current Node.
+     * @return {Node} node
+     **/
+    getContent() {
+      return this;
+    }
+  }
+  return Node;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js b/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js
new file mode 100644
index 0000000..c5156ef
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ObjectNode.js
@@ -0,0 +1,193 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { isNode } from '../../utils/is.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { escape, stringify } from '../../utils/string.js';
+var name = 'ObjectNode';
+var dependencies = ['Node'];
+export var createObjectNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  class ObjectNode extends Node {
+    /**
+     * @constructor ObjectNode
+     * @extends {Node}
+     * Holds an object with keys/values
+     * @param {Object.<string, Node>} [properties]   object with key/value pairs
+     */
+    constructor(properties) {
+      super();
+      this.properties = properties || {};
+
+      // validate input
+      if (properties) {
+        if (!(typeof properties === 'object') || !Object.keys(properties).every(function (key) {
+          return isNode(properties[key]);
+        })) {
+          throw new TypeError('Object containing Nodes expected');
+        }
+      }
+    }
+    get type() {
+      return name;
+    }
+    get isObjectNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var evalEntries = {};
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          // we stringify/parse the key here to resolve unicode characters,
+          // so you cannot create a key like {"co\\u006Estructor": null}
+          var stringifiedKey = stringify(key);
+          var parsedKey = JSON.parse(stringifiedKey);
+          var prop = getSafeProperty(this.properties, key);
+          evalEntries[parsedKey] = prop._compile(math, argNames);
+        }
+      }
+      return function evalObjectNode(scope, args, context) {
+        var obj = {};
+        for (var _key in evalEntries) {
+          if (hasOwnProperty(evalEntries, _key)) {
+            obj[_key] = evalEntries[_key](scope, args, context);
+          }
+        }
+        return obj;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          callback(this.properties[key], 'properties[' + stringify(key) + ']', this);
+        }
+      }
+    }
+
+    /**
+     * Create a new ObjectNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {ObjectNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var properties = {};
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          properties[key] = this._ifNode(callback(this.properties[key], 'properties[' + stringify(key) + ']', this));
+        }
+      }
+      return new ObjectNode(properties);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ObjectNode}
+     */
+    clone() {
+      var properties = {};
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          properties[key] = this.properties[key];
+        }
+      }
+      return new ObjectNode(properties);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      var entries = [];
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          entries.push(stringify(key) + ': ' + this.properties[key].toString(options));
+        }
+      }
+      return '{' + entries.join(', ') + '}';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        properties: this.properties
+      };
+    }
+
+    /**
+     * Instantiate an OperatorNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ObjectNode", "properties": {...}}`,
+     *                       where mathjs is optional
+     * @returns {ObjectNode}
+     */
+    static fromJSON(json) {
+      return new ObjectNode(json.properties);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      var entries = [];
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          entries.push('<span class="math-symbol math-property">' + escape(key) + '</span>' + '<span class="math-operator math-assignment-operator ' + 'math-property-assignment-operator math-binary-operator">' + ':</span>' + this.properties[key].toHTML(options));
+        }
+      }
+      return '<span class="math-parenthesis math-curly-parenthesis">{</span>' + entries.join('<span class="math-separator">,</span>') + '<span class="math-parenthesis math-curly-parenthesis">}</span>';
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var entries = [];
+      for (var key in this.properties) {
+        if (hasOwnProperty(this.properties, key)) {
+          entries.push('\\mathbf{' + key + ':} & ' + this.properties[key].toTex(options) + '\\\\');
+        }
+      }
+      var tex = '\\left\\{\\begin{array}{ll}' + entries.join('\n') + '\\end{array}\\right\\}';
+      return tex;
+    }
+  }
+  _defineProperty(ObjectNode, "name", name);
+  return ObjectNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js b/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js
new file mode 100644
index 0000000..61a8339
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/OperatorNode.js
@@ -0,0 +1,629 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isNode, isConstantNode, isOperatorNode, isParenthesisNode } from '../../utils/is.js';
+import { map } from '../../utils/array.js';
+import { createSubScope } from '../../utils/scope.js';
+import { escape } from '../../utils/string.js';
+import { getSafeProperty, isSafeMethod } from '../../utils/customs.js';
+import { getAssociativity, getPrecedence, isAssociativeWith, properties } from '../operators.js';
+import { latexOperators } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'OperatorNode';
+var dependencies = ['Node'];
+export var createOperatorNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  /**
+   * Returns true if the expression starts with a constant, under
+   * the current parenthesization:
+   * @param {Node} expression
+   * @param {string} parenthesis
+   * @return {boolean}
+   */
+  function startsWithConstant(expr, parenthesis) {
+    var curNode = expr;
+    if (parenthesis === 'auto') {
+      while (isParenthesisNode(curNode)) curNode = curNode.content;
+    }
+    if (isConstantNode(curNode)) return true;
+    if (isOperatorNode(curNode)) {
+      return startsWithConstant(curNode.args[0], parenthesis);
+    }
+    return false;
+  }
+
+  /**
+   * Calculate which parentheses are necessary. Gets an OperatorNode
+   * (which is the root of the tree) and an Array of Nodes
+   * (this.args) and returns an array where 'true' means that an argument
+   * has to be enclosed in parentheses whereas 'false' means the opposite.
+   *
+   * @param {OperatorNode} root
+   * @param {string} parenthesis
+   * @param {Node[]} args
+   * @param {boolean} latex
+   * @return {boolean[]}
+   * @private
+   */
+  function calculateNecessaryParentheses(root, parenthesis, implicit, args, latex) {
+    // precedence of the root OperatorNode
+    var precedence = getPrecedence(root, parenthesis, implicit);
+    var associativity = getAssociativity(root, parenthesis);
+    if (parenthesis === 'all' || args.length > 2 && root.getIdentifier() !== 'OperatorNode:add' && root.getIdentifier() !== 'OperatorNode:multiply') {
+      return args.map(function (arg) {
+        switch (arg.getContent().type) {
+          // Nodes that don't need extra parentheses
+          case 'ArrayNode':
+          case 'ConstantNode':
+          case 'SymbolNode':
+          case 'ParenthesisNode':
+            return false;
+          default:
+            return true;
+        }
+      });
+    }
+    var result;
+    switch (args.length) {
+      case 0:
+        result = [];
+        break;
+      case 1:
+        // unary operators
+        {
+          // precedence of the operand
+          var operandPrecedence = getPrecedence(args[0], parenthesis, implicit, root);
+
+          // handle special cases for LaTeX, where some of the parentheses aren't needed
+          if (latex && operandPrecedence !== null) {
+            var operandIdentifier;
+            var rootIdentifier;
+            if (parenthesis === 'keep') {
+              operandIdentifier = args[0].getIdentifier();
+              rootIdentifier = root.getIdentifier();
+            } else {
+              // Ignore Parenthesis Nodes when not in 'keep' mode
+              operandIdentifier = args[0].getContent().getIdentifier();
+              rootIdentifier = root.getContent().getIdentifier();
+            }
+            if (properties[precedence][rootIdentifier].latexLeftParens === false) {
+              result = [false];
+              break;
+            }
+            if (properties[operandPrecedence][operandIdentifier].latexParens === false) {
+              result = [false];
+              break;
+            }
+          }
+          if (operandPrecedence === null) {
+            // if the operand has no defined precedence, no parens are needed
+            result = [false];
+            break;
+          }
+          if (operandPrecedence <= precedence) {
+            // if the operands precedence is lower, parens are needed
+            result = [true];
+            break;
+          }
+
+          // otherwise, no parens needed
+          result = [false];
+        }
+        break;
+      case 2:
+        // binary operators
+        {
+          var lhsParens; // left hand side needs parenthesis?
+          // precedence of the left hand side
+          var lhsPrecedence = getPrecedence(args[0], parenthesis, implicit, root);
+          // is the root node associative with the left hand side
+          var assocWithLhs = isAssociativeWith(root, args[0], parenthesis);
+          if (lhsPrecedence === null) {
+            // if the left hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            lhsParens = false;
+          } else if (lhsPrecedence === precedence && associativity === 'right' && !assocWithLhs) {
+            // In case of equal precedence, if the root node is left associative
+            // parens are **never** necessary for the left hand side.
+            // If it is right associative however, parens are necessary
+            // if the root node isn't associative with the left hand side
+            lhsParens = true;
+          } else if (lhsPrecedence < precedence) {
+            lhsParens = true;
+          } else {
+            lhsParens = false;
+          }
+          var rhsParens; // right hand side needs parenthesis?
+          // precedence of the right hand side
+          var rhsPrecedence = getPrecedence(args[1], parenthesis, implicit, root);
+          // is the root node associative with the right hand side?
+          var assocWithRhs = isAssociativeWith(root, args[1], parenthesis);
+          if (rhsPrecedence === null) {
+            // if the right hand side has no defined precedence, no parens are needed
+            // FunctionNode for example
+            rhsParens = false;
+          } else if (rhsPrecedence === precedence && associativity === 'left' && !assocWithRhs) {
+            // In case of equal precedence, if the root node is right associative
+            // parens are **never** necessary for the right hand side.
+            // If it is left associative however, parens are necessary
+            // if the root node isn't associative with the right hand side
+            rhsParens = true;
+          } else if (rhsPrecedence < precedence) {
+            rhsParens = true;
+          } else {
+            rhsParens = false;
+          }
+
+          // handle special cases for LaTeX, where some of the parentheses aren't needed
+          if (latex) {
+            var _rootIdentifier;
+            var lhsIdentifier;
+            var rhsIdentifier;
+            if (parenthesis === 'keep') {
+              _rootIdentifier = root.getIdentifier();
+              lhsIdentifier = root.args[0].getIdentifier();
+              rhsIdentifier = root.args[1].getIdentifier();
+            } else {
+              // Ignore ParenthesisNodes when not in 'keep' mode
+              _rootIdentifier = root.getContent().getIdentifier();
+              lhsIdentifier = root.args[0].getContent().getIdentifier();
+              rhsIdentifier = root.args[1].getContent().getIdentifier();
+            }
+            if (lhsPrecedence !== null) {
+              if (properties[precedence][_rootIdentifier].latexLeftParens === false) {
+                lhsParens = false;
+              }
+              if (properties[lhsPrecedence][lhsIdentifier].latexParens === false) {
+                lhsParens = false;
+              }
+            }
+            if (rhsPrecedence !== null) {
+              if (properties[precedence][_rootIdentifier].latexRightParens === false) {
+                rhsParens = false;
+              }
+              if (properties[rhsPrecedence][rhsIdentifier].latexParens === false) {
+                rhsParens = false;
+              }
+            }
+          }
+          result = [lhsParens, rhsParens];
+        }
+        break;
+      default:
+        if (root.getIdentifier() === 'OperatorNode:add' || root.getIdentifier() === 'OperatorNode:multiply') {
+          result = args.map(function (arg) {
+            var argPrecedence = getPrecedence(arg, parenthesis, implicit, root);
+            var assocWithArg = isAssociativeWith(root, arg, parenthesis);
+            var argAssociativity = getAssociativity(arg, parenthesis);
+            if (argPrecedence === null) {
+              // if the argument has no defined precedence, no parens are needed
+              return false;
+            } else if (precedence === argPrecedence && associativity === argAssociativity && !assocWithArg) {
+              return true;
+            } else if (argPrecedence < precedence) {
+              return true;
+            }
+            return false;
+          });
+        }
+        break;
+    }
+
+    // Handles an edge case of parentheses with implicit multiplication
+    // of ConstantNode.
+    // In that case, parenthesize ConstantNodes that follow an unparenthesized
+    // expression, even though they normally wouldn't be printed.
+    if (args.length >= 2 && root.getIdentifier() === 'OperatorNode:multiply' && root.implicit && parenthesis !== 'all' && implicit === 'hide') {
+      for (var i = 1; i < result.length; ++i) {
+        if (startsWithConstant(args[i], parenthesis) && !result[i - 1] && (parenthesis !== 'keep' || !isParenthesisNode(args[i - 1]))) {
+          result[i] = true;
+        }
+      }
+    }
+    return result;
+  }
+  class OperatorNode extends Node {
+    /**
+     * @constructor OperatorNode
+     * @extends {Node}
+     * An operator with two arguments, like 2+3
+     *
+     * @param {string} op           Operator name, for example '+'
+     * @param {string} fn           Function name, for example 'add'
+     * @param {Node[]} args         Operator arguments
+     * @param {boolean} [implicit]  Is this an implicit multiplication?
+     * @param {boolean} [isPercentage] Is this an percentage Operation?
+     */
+    constructor(op, fn, args, implicit, isPercentage) {
+      super();
+      // validate input
+      if (typeof op !== 'string') {
+        throw new TypeError('string expected for parameter "op"');
+      }
+      if (typeof fn !== 'string') {
+        throw new TypeError('string expected for parameter "fn"');
+      }
+      if (!Array.isArray(args) || !args.every(isNode)) {
+        throw new TypeError('Array containing Nodes expected for parameter "args"');
+      }
+      this.implicit = implicit === true;
+      this.isPercentage = isPercentage === true;
+      this.op = op;
+      this.fn = fn;
+      this.args = args || [];
+    }
+    get type() {
+      return name;
+    }
+    get isOperatorNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      // validate fn
+      if (typeof this.fn !== 'string' || !isSafeMethod(math, this.fn)) {
+        if (!math[this.fn]) {
+          throw new Error('Function ' + this.fn + ' missing in provided namespace "math"');
+        } else {
+          throw new Error('No access to function "' + this.fn + '"');
+        }
+      }
+      var fn = getSafeProperty(math, this.fn);
+      var evalArgs = map(this.args, function (arg) {
+        return arg._compile(math, argNames);
+      });
+      if (typeof fn === 'function' && fn.rawArgs === true) {
+        // pass unevaluated parameters (nodes) to the function
+        // "raw" evaluation
+        var rawArgs = this.args;
+        return function evalOperatorNode(scope, args, context) {
+          return fn(rawArgs, math, createSubScope(scope, args));
+        };
+      } else if (evalArgs.length === 1) {
+        var evalArg0 = evalArgs[0];
+        return function evalOperatorNode(scope, args, context) {
+          return fn(evalArg0(scope, args, context));
+        };
+      } else if (evalArgs.length === 2) {
+        var _evalArg = evalArgs[0];
+        var evalArg1 = evalArgs[1];
+        return function evalOperatorNode(scope, args, context) {
+          return fn(_evalArg(scope, args, context), evalArg1(scope, args, context));
+        };
+      } else {
+        return function evalOperatorNode(scope, args, context) {
+          return fn.apply(null, map(evalArgs, function (evalArg) {
+            return evalArg(scope, args, context);
+          }));
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      for (var i = 0; i < this.args.length; i++) {
+        callback(this.args[i], 'args[' + i + ']', this);
+      }
+    }
+
+    /**
+     * Create a new OperatorNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {OperatorNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      var args = [];
+      for (var i = 0; i < this.args.length; i++) {
+        args[i] = this._ifNode(callback(this.args[i], 'args[' + i + ']', this));
+      }
+      return new OperatorNode(this.op, this.fn, args, this.implicit, this.isPercentage);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {OperatorNode}
+     */
+    clone() {
+      return new OperatorNode(this.op, this.fn, this.args.slice(0), this.implicit, this.isPercentage);
+    }
+
+    /**
+     * Check whether this is an unary OperatorNode:
+     * has exactly one argument, like `-a`.
+     * @return {boolean}
+     *     Returns true when an unary operator node, false otherwise.
+     */
+    isUnary() {
+      return this.args.length === 1;
+    }
+
+    /**
+     * Check whether this is a binary OperatorNode:
+     * has exactly two arguments, like `a + b`.
+     * @return {boolean}
+     *     Returns true when a binary operator node, false otherwise.
+     */
+    isBinary() {
+      return this.args.length === 2;
+    }
+
+    /**
+     * Get string representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var implicit = options && options.implicit ? options.implicit : 'hide';
+      var args = this.args;
+      var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+      if (args.length === 1) {
+        // unary operators
+        var assoc = getAssociativity(this, parenthesis);
+        var operand = args[0].toString(options);
+        if (parens[0]) {
+          operand = '(' + operand + ')';
+        }
+
+        // for example for "not", we want a space between operand and argument
+        var opIsNamed = /[a-zA-Z]+/.test(this.op);
+        if (assoc === 'right') {
+          // prefix operator
+          return this.op + (opIsNamed ? ' ' : '') + operand;
+        } else if (assoc === 'left') {
+          // postfix
+          return operand + (opIsNamed ? ' ' : '') + this.op;
+        }
+
+        // fall back to postfix
+        return operand + this.op;
+      } else if (args.length === 2) {
+        var lhs = args[0].toString(options); // left hand side
+        var rhs = args[1].toString(options); // right hand side
+        if (parens[0]) {
+          // left hand side in parenthesis?
+          lhs = '(' + lhs + ')';
+        }
+        if (parens[1]) {
+          // right hand side in parenthesis?
+          rhs = '(' + rhs + ')';
+        }
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return lhs + ' ' + rhs;
+        }
+        return lhs + ' ' + this.op + ' ' + rhs;
+      } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        var stringifiedArgs = args.map(function (arg, index) {
+          arg = arg.toString(options);
+          if (parens[index]) {
+            // put in parenthesis?
+            arg = '(' + arg + ')';
+          }
+          return arg;
+        });
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return stringifiedArgs.join(' ');
+        }
+        return stringifiedArgs.join(' ' + this.op + ' ');
+      } else {
+        // fallback to formatting as a function call
+        return this.fn + '(' + this.args.join(', ') + ')';
+      }
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        op: this.op,
+        fn: this.fn,
+        args: this.args,
+        implicit: this.implicit,
+        isPercentage: this.isPercentage
+      };
+    }
+
+    /**
+     * Instantiate an OperatorNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     ```
+     *     {"mathjs": "OperatorNode",
+     *      "op": "+", "fn": "add", "args": [...],
+     *      "implicit": false,
+     *      "isPercentage":false}
+     *     ```
+     *     where mathjs is optional
+     * @returns {OperatorNode}
+     */
+    static fromJSON(json) {
+      return new OperatorNode(json.op, json.fn, json.args, json.implicit, json.isPercentage);
+    }
+
+    /**
+     * Get HTML representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var implicit = options && options.implicit ? options.implicit : 'hide';
+      var args = this.args;
+      var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, false);
+      if (args.length === 1) {
+        // unary operators
+        var assoc = getAssociativity(this, parenthesis);
+        var operand = args[0].toHTML(options);
+        if (parens[0]) {
+          operand = '<span class="math-parenthesis math-round-parenthesis">(</span>' + operand + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (assoc === 'right') {
+          // prefix operator
+          return '<span class="math-operator math-unary-operator ' + 'math-lefthand-unary-operator">' + escape(this.op) + '</span>' + operand;
+        } else {
+          // postfix when assoc === 'left' or undefined
+          return operand + '<span class="math-operator math-unary-operator ' + 'math-righthand-unary-operator">' + escape(this.op) + '</span>';
+        }
+      } else if (args.length === 2) {
+        // binary operatoes
+        var lhs = args[0].toHTML(options); // left hand side
+        var rhs = args[1].toHTML(options); // right hand side
+        if (parens[0]) {
+          // left hand side in parenthesis?
+          lhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + lhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (parens[1]) {
+          // right hand side in parenthesis?
+          rhs = '<span class="math-parenthesis math-round-parenthesis">(</span>' + rhs + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+          return lhs + '<span class="math-operator math-binary-operator ' + 'math-implicit-binary-operator"></span>' + rhs;
+        }
+        return lhs + '<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + escape(this.op) + '</span>' + rhs;
+      } else {
+        var stringifiedArgs = args.map(function (arg, index) {
+          arg = arg.toHTML(options);
+          if (parens[index]) {
+            // put in parenthesis?
+            arg = '<span class="math-parenthesis math-round-parenthesis">(</span>' + arg + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+          }
+          return arg;
+        });
+        if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+          if (this.implicit && this.getIdentifier() === 'OperatorNode:multiply' && implicit === 'hide') {
+            return stringifiedArgs.join('<span class="math-operator math-binary-operator ' + 'math-implicit-binary-operator"></span>');
+          }
+          return stringifiedArgs.join('<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + escape(this.op) + '</span>');
+        } else {
+          // fallback to formatting as a function call
+          return '<span class="math-function">' + escape(this.fn) + '</span><span class="math-paranthesis math-round-parenthesis">' + '(</span>' + stringifiedArgs.join('<span class="math-separator">,</span>') + '<span class="math-paranthesis math-round-parenthesis">)</span>';
+        }
+      }
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var implicit = options && options.implicit ? options.implicit : 'hide';
+      var args = this.args;
+      var parens = calculateNecessaryParentheses(this, parenthesis, implicit, args, true);
+      var op = latexOperators[this.fn];
+      op = typeof op === 'undefined' ? this.op : op; // fall back to using this.op
+
+      if (args.length === 1) {
+        // unary operators
+        var assoc = getAssociativity(this, parenthesis);
+        var operand = args[0].toTex(options);
+        if (parens[0]) {
+          operand = "\\left(".concat(operand, "\\right)");
+        }
+        if (assoc === 'right') {
+          // prefix operator
+          return op + operand;
+        } else if (assoc === 'left') {
+          // postfix operator
+          return operand + op;
+        }
+
+        // fall back to postfix
+        return operand + op;
+      } else if (args.length === 2) {
+        // binary operators
+        var lhs = args[0]; // left hand side
+        var lhsTex = lhs.toTex(options);
+        if (parens[0]) {
+          lhsTex = "\\left(".concat(lhsTex, "\\right)");
+        }
+        var rhs = args[1]; // right hand side
+        var rhsTex = rhs.toTex(options);
+        if (parens[1]) {
+          rhsTex = "\\left(".concat(rhsTex, "\\right)");
+        }
+
+        // handle some exceptions (due to the way LaTeX works)
+        var lhsIdentifier;
+        if (parenthesis === 'keep') {
+          lhsIdentifier = lhs.getIdentifier();
+        } else {
+          // Ignore ParenthesisNodes if in 'keep' mode
+          lhsIdentifier = lhs.getContent().getIdentifier();
+        }
+        switch (this.getIdentifier()) {
+          case 'OperatorNode:divide':
+            // op contains '\\frac' at this point
+            return op + '{' + lhsTex + '}' + '{' + rhsTex + '}';
+          case 'OperatorNode:pow':
+            lhsTex = '{' + lhsTex + '}';
+            rhsTex = '{' + rhsTex + '}';
+            switch (lhsIdentifier) {
+              case 'ConditionalNode': //
+              case 'OperatorNode:divide':
+                lhsTex = "\\left(".concat(lhsTex, "\\right)");
+            }
+            break;
+          case 'OperatorNode:multiply':
+            if (this.implicit && implicit === 'hide') {
+              return lhsTex + '~' + rhsTex;
+            }
+        }
+        return lhsTex + op + rhsTex;
+      } else if (args.length > 2 && (this.getIdentifier() === 'OperatorNode:add' || this.getIdentifier() === 'OperatorNode:multiply')) {
+        var texifiedArgs = args.map(function (arg, index) {
+          arg = arg.toTex(options);
+          if (parens[index]) {
+            arg = "\\left(".concat(arg, "\\right)");
+          }
+          return arg;
+        });
+        if (this.getIdentifier() === 'OperatorNode:multiply' && this.implicit && implicit === 'hide') {
+          return texifiedArgs.join('~');
+        }
+        return texifiedArgs.join(op);
+      } else {
+        // fall back to formatting as a function call
+        // as this is a fallback, it doesn't use
+        // fancy function names
+        return '\\mathrm{' + this.fn + '}\\left(' + args.map(function (arg) {
+          return arg.toTex(options);
+        }).join(',') + '\\right)';
+      }
+    }
+
+    /**
+     * Get identifier.
+     * @return {string}
+     */
+    getIdentifier() {
+      return this.type + ':' + this.fn;
+    }
+  }
+  _defineProperty(OperatorNode, "name", name);
+  return OperatorNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js b/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js
new file mode 100644
index 0000000..630f44b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/ParenthesisNode.js
@@ -0,0 +1,152 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ParenthesisNode';
+var dependencies = ['Node'];
+export var createParenthesisNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  class ParenthesisNode extends Node {
+    /**
+     * @constructor ParenthesisNode
+     * @extends {Node}
+     * A parenthesis node describes manual parenthesis from the user input
+     * @param {Node} content
+     * @extends {Node}
+     */
+    constructor(content) {
+      super();
+      // validate input
+      if (!isNode(content)) {
+        throw new TypeError('Node expected for parameter "content"');
+      }
+      this.content = content;
+    }
+    get type() {
+      return name;
+    }
+    get isParenthesisNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      return this.content._compile(math, argNames);
+    }
+
+    /**
+     * Get the content of the current Node.
+     * @return {Node} content
+     * @override
+     **/
+    getContent() {
+      return this.content.getContent();
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.content, 'content', this);
+    }
+
+    /**
+     * Create a new ParenthesisNode whose child is the result of calling
+     * the provided callback function on the child of this node.
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {ParenthesisNode} Returns a clone of the node
+     */
+    map(callback) {
+      var content = callback(this.content, 'content', this);
+      return new ParenthesisNode(content);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {ParenthesisNode}
+     */
+    clone() {
+      return new ParenthesisNode(this.content);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return '(' + this.content.toString(options) + ')';
+      }
+      return this.content.toString(options);
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        content: this.content
+      };
+    }
+
+    /**
+     * Instantiate an ParenthesisNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "ParenthesisNode", "content": ...}`,
+     *                       where mathjs is optional
+     * @returns {ParenthesisNode}
+     */
+    static fromJSON(json) {
+      return new ParenthesisNode(json.content);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return '<span class="math-parenthesis math-round-parenthesis">(</span>' + this.content.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      return this.content.toHTML(options);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toTex(options) {
+      if (!options || options && !options.parenthesis || options && options.parenthesis === 'keep') {
+        return "\\left(".concat(this.content.toTex(options), "\\right)");
+      }
+      return this.content.toTex(options);
+    }
+  }
+  _defineProperty(ParenthesisNode, "name", name);
+  return ParenthesisNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/RangeNode.js b/node_modules/mathjs/lib/esm/expression/node/RangeNode.js
new file mode 100644
index 0000000..e30edf7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/RangeNode.js
@@ -0,0 +1,250 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { isNode, isSymbolNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { getPrecedence } from '../operators.js';
+var name = 'RangeNode';
+var dependencies = ['Node'];
+export var createRangeNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  /**
+   * Calculate the necessary parentheses
+   * @param {Node} node
+   * @param {string} parenthesis
+   * @param {string} implicit
+   * @return {Object} parentheses
+   * @private
+   */
+  function calculateNecessaryParentheses(node, parenthesis, implicit) {
+    var precedence = getPrecedence(node, parenthesis, implicit);
+    var parens = {};
+    var startPrecedence = getPrecedence(node.start, parenthesis, implicit);
+    parens.start = startPrecedence !== null && startPrecedence <= precedence || parenthesis === 'all';
+    if (node.step) {
+      var stepPrecedence = getPrecedence(node.step, parenthesis, implicit);
+      parens.step = stepPrecedence !== null && stepPrecedence <= precedence || parenthesis === 'all';
+    }
+    var endPrecedence = getPrecedence(node.end, parenthesis, implicit);
+    parens.end = endPrecedence !== null && endPrecedence <= precedence || parenthesis === 'all';
+    return parens;
+  }
+  class RangeNode extends Node {
+    /**
+     * @constructor RangeNode
+     * @extends {Node}
+     * create a range
+     * @param {Node} start  included lower-bound
+     * @param {Node} end    included upper-bound
+     * @param {Node} [step] optional step
+     */
+    constructor(start, end, step) {
+      super();
+      // validate inputs
+      if (!isNode(start)) throw new TypeError('Node expected');
+      if (!isNode(end)) throw new TypeError('Node expected');
+      if (step && !isNode(step)) throw new TypeError('Node expected');
+      if (arguments.length > 3) throw new Error('Too many arguments');
+      this.start = start; // included lower-bound
+      this.end = end; // included upper-bound
+      this.step = step || null; // optional step
+    }
+    get type() {
+      return name;
+    }
+    get isRangeNode() {
+      return true;
+    }
+
+    /**
+     * Check whether the RangeNode needs the `end` symbol to be defined.
+     * This end is the size of the Matrix in current dimension.
+     * @return {boolean}
+     */
+    needsEnd() {
+      // find all `end` symbols in this RangeNode
+      var endSymbols = this.filter(function (node) {
+        return isSymbolNode(node) && node.name === 'end';
+      });
+      return endSymbols.length > 0;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var range = math.range;
+      var evalStart = this.start._compile(math, argNames);
+      var evalEnd = this.end._compile(math, argNames);
+      if (this.step) {
+        var evalStep = this.step._compile(math, argNames);
+        return function evalRangeNode(scope, args, context) {
+          return range(evalStart(scope, args, context), evalEnd(scope, args, context), evalStep(scope, args, context));
+        };
+      } else {
+        return function evalRangeNode(scope, args, context) {
+          return range(evalStart(scope, args, context), evalEnd(scope, args, context));
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      callback(this.start, 'start', this);
+      callback(this.end, 'end', this);
+      if (this.step) {
+        callback(this.step, 'step', this);
+      }
+    }
+
+    /**
+     * Create a new RangeNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {RangeNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new RangeNode(this._ifNode(callback(this.start, 'start', this)), this._ifNode(callback(this.end, 'end', this)), this.step && this._ifNode(callback(this.step, 'step', this)));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {RangeNode}
+     */
+    clone() {
+      return new RangeNode(this.start, this.end, this.step && this.step);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+
+      // format string as start:step:stop
+      var str;
+      var start = this.start.toString(options);
+      if (parens.start) {
+        start = '(' + start + ')';
+      }
+      str = start;
+      if (this.step) {
+        var step = this.step.toString(options);
+        if (parens.step) {
+          step = '(' + step + ')';
+        }
+        str += ':' + step;
+      }
+      var end = this.end.toString(options);
+      if (parens.end) {
+        end = '(' + end + ')';
+      }
+      str += ':' + end;
+      return str;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        start: this.start,
+        end: this.end,
+        step: this.step
+      };
+    }
+
+    /**
+     * Instantiate an RangeNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "RangeNode", "start": ..., "end": ..., "step": ...}`,
+     *     where mathjs is optional
+     * @returns {RangeNode}
+     */
+    static fromJSON(json) {
+      return new RangeNode(json.start, json.end, json.step);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+
+      // format string as start:step:stop
+      var str;
+      var start = this.start.toHTML(options);
+      if (parens.start) {
+        start = '<span class="math-parenthesis math-round-parenthesis">(</span>' + start + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      str = start;
+      if (this.step) {
+        var step = this.step.toHTML(options);
+        if (parens.step) {
+          step = '<span class="math-parenthesis math-round-parenthesis">(</span>' + step + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+        }
+        str += '<span class="math-operator math-range-operator">:</span>' + step;
+      }
+      var end = this.end.toHTML(options);
+      if (parens.end) {
+        end = '<span class="math-parenthesis math-round-parenthesis">(</span>' + end + '<span class="math-parenthesis math-round-parenthesis">)</span>';
+      }
+      str += '<span class="math-operator math-range-operator">:</span>' + end;
+      return str;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @params {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var parens = calculateNecessaryParentheses(this, parenthesis, options && options.implicit);
+      var str = this.start.toTex(options);
+      if (parens.start) {
+        str = "\\left(".concat(str, "\\right)");
+      }
+      if (this.step) {
+        var step = this.step.toTex(options);
+        if (parens.step) {
+          step = "\\left(".concat(step, "\\right)");
+        }
+        str += ':' + step;
+      }
+      var end = this.end.toTex(options);
+      if (parens.end) {
+        end = "\\left(".concat(end, "\\right)");
+      }
+      str += ':' + end;
+      return str;
+    }
+  }
+  _defineProperty(RangeNode, "name", name);
+  return RangeNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js b/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js
new file mode 100644
index 0000000..dd654c7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/RelationalNode.js
@@ -0,0 +1,198 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import { getPrecedence } from '../operators.js';
+import { escape } from '../../utils/string.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { latexOperators } from '../../utils/latex.js';
+import { factory } from '../../utils/factory.js';
+var name = 'RelationalNode';
+var dependencies = ['Node'];
+export var createRelationalNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Node
+  } = _ref;
+  var operatorMap = {
+    equal: '==',
+    unequal: '!=',
+    smaller: '<',
+    larger: '>',
+    smallerEq: '<=',
+    largerEq: '>='
+  };
+  class RelationalNode extends Node {
+    /**
+     * A node representing a chained conditional expression, such as 'x > y > z'
+     *
+     * @param {String[]} conditionals
+     *     An array of conditional operators used to compare the parameters
+     * @param {Node[]} params
+     *     The parameters that will be compared
+     *
+     * @constructor RelationalNode
+     * @extends {Node}
+     */
+    constructor(conditionals, params) {
+      super();
+      if (!Array.isArray(conditionals)) {
+        throw new TypeError('Parameter conditionals must be an array');
+      }
+      if (!Array.isArray(params)) {
+        throw new TypeError('Parameter params must be an array');
+      }
+      if (conditionals.length !== params.length - 1) {
+        throw new TypeError('Parameter params must contain exactly one more element ' + 'than parameter conditionals');
+      }
+      this.conditionals = conditionals;
+      this.params = params;
+    }
+    get type() {
+      return name;
+    }
+    get isRelationalNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var self = this;
+      var compiled = this.params.map(p => p._compile(math, argNames));
+      return function evalRelationalNode(scope, args, context) {
+        var evalLhs;
+        var evalRhs = compiled[0](scope, args, context);
+        for (var i = 0; i < self.conditionals.length; i++) {
+          evalLhs = evalRhs;
+          evalRhs = compiled[i + 1](scope, args, context);
+          var condFn = getSafeProperty(math, self.conditionals[i]);
+          if (!condFn(evalLhs, evalRhs)) {
+            return false;
+          }
+        }
+        return true;
+      };
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      this.params.forEach((n, i) => callback(n, 'params[' + i + ']', this), this);
+    }
+
+    /**
+     * Create a new RelationalNode whose children are the results of calling
+     * the provided callback function for each child of the original node.
+     * @param {function(child: Node, path: string, parent: Node): Node} callback
+     * @returns {RelationalNode} Returns a transformed copy of the node
+     */
+    map(callback) {
+      return new RelationalNode(this.conditionals.slice(), this.params.map((n, i) => this._ifNode(callback(n, 'params[' + i + ']', this)), this));
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {RelationalNode}
+     */
+    clone() {
+      return new RelationalNode(this.conditionals, this.params);
+    }
+
+    /**
+     * Get string representation.
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toString(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var precedence = getPrecedence(this, parenthesis, options && options.implicit);
+      var paramStrings = this.params.map(function (p, index) {
+        var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '(' + p.toString(options) + ')' : p.toString(options);
+      });
+      var ret = paramStrings[0];
+      for (var i = 0; i < this.conditionals.length; i++) {
+        ret += ' ' + operatorMap[this.conditionals[i]];
+        ret += ' ' + paramStrings[i + 1];
+      }
+      return ret;
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: name,
+        conditionals: this.conditionals,
+        params: this.params
+      };
+    }
+
+    /**
+     * Instantiate a RelationalNode from its JSON representation
+     * @param {Object} json
+     *     An object structured like
+     *     `{"mathjs": "RelationalNode", "conditionals": ..., "params": ...}`,
+     *     where mathjs is optional
+     * @returns {RelationalNode}
+     */
+    static fromJSON(json) {
+      return new RelationalNode(json.conditionals, json.params);
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toHTML(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var precedence = getPrecedence(this, parenthesis, options && options.implicit);
+      var paramStrings = this.params.map(function (p, index) {
+        var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '<span class="math-parenthesis math-round-parenthesis">(</span>' + p.toHTML(options) + '<span class="math-parenthesis math-round-parenthesis">)</span>' : p.toHTML(options);
+      });
+      var ret = paramStrings[0];
+      for (var i = 0; i < this.conditionals.length; i++) {
+        ret += '<span class="math-operator math-binary-operator ' + 'math-explicit-binary-operator">' + escape(operatorMap[this.conditionals[i]]) + '</span>' + paramStrings[i + 1];
+      }
+      return ret;
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     */
+    _toTex(options) {
+      var parenthesis = options && options.parenthesis ? options.parenthesis : 'keep';
+      var precedence = getPrecedence(this, parenthesis, options && options.implicit);
+      var paramStrings = this.params.map(function (p, index) {
+        var paramPrecedence = getPrecedence(p, parenthesis, options && options.implicit);
+        return parenthesis === 'all' || paramPrecedence !== null && paramPrecedence <= precedence ? '\\left(' + p.toTex(options) + '\right)' : p.toTex(options);
+      });
+      var ret = paramStrings[0];
+      for (var i = 0; i < this.conditionals.length; i++) {
+        ret += latexOperators[this.conditionals[i]] + paramStrings[i + 1];
+      }
+      return ret;
+    }
+  }
+  _defineProperty(RelationalNode, "name", name);
+  return RelationalNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js b/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js
new file mode 100644
index 0000000..1f46062
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/SymbolNode.js
@@ -0,0 +1,193 @@
+import { escape } from '../../utils/string.js';
+import { getSafeProperty } from '../../utils/customs.js';
+import { factory } from '../../utils/factory.js';
+import { toSymbol } from '../../utils/latex.js';
+var name = 'SymbolNode';
+var dependencies = ['math', '?Unit', 'Node'];
+export var createSymbolNode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    math,
+    Unit,
+    Node
+  } = _ref;
+  /**
+   * Check whether some name is a valueless unit like "inch".
+   * @param {string} name
+   * @return {boolean}
+   */
+  function isValuelessUnit(name) {
+    return Unit ? Unit.isValuelessUnit(name) : false;
+  }
+  class SymbolNode extends Node {
+    /**
+     * @constructor SymbolNode
+     * @extends {Node}
+     * A symbol node can hold and resolve a symbol
+     * @param {string} name
+     * @extends {Node}
+     */
+    constructor(name) {
+      super();
+      // validate input
+      if (typeof name !== 'string') {
+        throw new TypeError('String expected for parameter "name"');
+      }
+      this.name = name;
+    }
+    get type() {
+      return 'SymbolNode';
+    }
+    get isSymbolNode() {
+      return true;
+    }
+
+    /**
+     * Compile a node into a JavaScript function.
+     * This basically pre-calculates as much as possible and only leaves open
+     * calculations which depend on a dynamic scope with variables.
+     * @param {Object} math     Math.js namespace with functions and constants.
+     * @param {Object} argNames An object with argument names as key and `true`
+     *                          as value. Used in the SymbolNode to optimize
+     *                          for arguments from user assigned functions
+     *                          (see FunctionAssignmentNode) or special symbols
+     *                          like `end` (see IndexNode).
+     * @return {function} Returns a function which can be called like:
+     *                        evalNode(scope: Object, args: Object, context: *)
+     */
+    _compile(math, argNames) {
+      var name = this.name;
+      if (argNames[name] === true) {
+        // this is a FunctionAssignment argument
+        // (like an x when inside the expression of a function
+        // assignment `f(x) = ...`)
+        return function (scope, args, context) {
+          return getSafeProperty(args, name);
+        };
+      } else if (name in math) {
+        return function (scope, args, context) {
+          return scope.has(name) ? scope.get(name) : getSafeProperty(math, name);
+        };
+      } else {
+        var isUnit = isValuelessUnit(name);
+        return function (scope, args, context) {
+          return scope.has(name) ? scope.get(name) : isUnit ? new Unit(null, name) : SymbolNode.onUndefinedSymbol(name);
+        };
+      }
+    }
+
+    /**
+     * Execute a callback for each of the child nodes of this node
+     * @param {function(child: Node, path: string, parent: Node)} callback
+     */
+    forEach(callback) {
+      // nothing to do, we don't have any children
+    }
+
+    /**
+     * Create a new SymbolNode with children produced by the given callback.
+     * Trivial since a SymbolNode has no children
+     * @param {function(child: Node, path: string, parent: Node) : Node} callback
+     * @returns {SymbolNode} Returns a clone of the node
+     */
+    map(callback) {
+      return this.clone();
+    }
+
+    /**
+     * Throws an error 'Undefined symbol {name}'
+     * @param {string} name
+     */
+    static onUndefinedSymbol(name) {
+      throw new Error('Undefined symbol ' + name);
+    }
+
+    /**
+     * Create a clone of this node, a shallow copy
+     * @return {SymbolNode}
+     */
+    clone() {
+      return new SymbolNode(this.name);
+    }
+
+    /**
+     * Get string representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toString(options) {
+      return this.name;
+    }
+
+    /**
+     * Get HTML representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toHTML(options) {
+      var name = escape(this.name);
+      if (name === 'true' || name === 'false') {
+        return '<span class="math-symbol math-boolean">' + name + '</span>';
+      } else if (name === 'i') {
+        return '<span class="math-symbol math-imaginary-symbol">' + name + '</span>';
+      } else if (name === 'Infinity') {
+        return '<span class="math-symbol math-infinity-symbol">' + name + '</span>';
+      } else if (name === 'NaN') {
+        return '<span class="math-symbol math-nan-symbol">' + name + '</span>';
+      } else if (name === 'null') {
+        return '<span class="math-symbol math-null-symbol">' + name + '</span>';
+      } else if (name === 'undefined') {
+        return '<span class="math-symbol math-undefined-symbol">' + name + '</span>';
+      }
+      return '<span class="math-symbol">' + name + '</span>';
+    }
+
+    /**
+     * Get a JSON representation of the node
+     * @returns {Object}
+     */
+    toJSON() {
+      return {
+        mathjs: 'SymbolNode',
+        name: this.name
+      };
+    }
+
+    /**
+     * Instantiate a SymbolNode from its JSON representation
+     * @param {Object} json  An object structured like
+     *                       `{"mathjs": "SymbolNode", name: "x"}`,
+     *                       where mathjs is optional
+     * @returns {SymbolNode}
+     */
+    static fromJSON(json) {
+      return new SymbolNode(json.name);
+    }
+
+    /**
+     * Get LaTeX representation
+     * @param {Object} options
+     * @return {string} str
+     * @override
+     */
+    _toTex(options) {
+      var isUnit = false;
+      if (typeof math[this.name] === 'undefined' && isValuelessUnit(this.name)) {
+        isUnit = true;
+      }
+      var symbol = toSymbol(this.name, isUnit);
+      if (symbol[0] === '\\') {
+        // no space needed if the symbol starts with '\'
+        return symbol;
+      }
+      // the space prevents symbols from breaking stuff like '\cdot'
+      // if it's written right before the symbol
+      return ' ' + symbol;
+    }
+  }
+  return SymbolNode;
+}, {
+  isClass: true,
+  isNode: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/utils/access.js b/node_modules/mathjs/lib/esm/expression/node/utils/access.js
new file mode 100644
index 0000000..4da61c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/utils/access.js
@@ -0,0 +1,40 @@
+import { errorTransform } from '../../transform/utils/errorTransform.js';
+import { getSafeProperty } from '../../../utils/customs.js';
+export function accessFactory(_ref) {
+  var {
+    subset
+  } = _ref;
+  /**
+   * Retrieve part of an object:
+   *
+   * - Retrieve a property from an object
+   * - Retrieve a part of a string
+   * - Retrieve a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @return {Object | Array | Matrix | string} Returns the subset
+   */
+  return function access(object, index) {
+    try {
+      if (Array.isArray(object)) {
+        return subset(object, index);
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index);
+      } else if (typeof object === 'string') {
+        // TODO: move getStringSubset into a separate util file, use that
+        return subset(object, index);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw new TypeError('Cannot apply a numeric index as object property');
+        }
+        return getSafeProperty(object, index.getObjectProperty());
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw errorTransform(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/node/utils/assign.js b/node_modules/mathjs/lib/esm/expression/node/utils/assign.js
new file mode 100644
index 0000000..84fd91c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/node/utils/assign.js
@@ -0,0 +1,51 @@
+import { errorTransform } from '../../transform/utils/errorTransform.js';
+import { setSafeProperty } from '../../../utils/customs.js';
+export function assignFactory(_ref) {
+  var {
+    subset,
+    matrix
+  } = _ref;
+  /**
+   * Replace part of an object:
+   *
+   * - Assign a property to an object
+   * - Replace a part of a string
+   * - Replace a matrix subset
+   *
+   * @param {Object | Array | Matrix | string} object
+   * @param {Index} index
+   * @param {*} value
+   * @return {Object | Array | Matrix | string} Returns the original object
+   *                                            except in case of a string
+   */
+  // TODO: change assign to return the value instead of the object
+  return function assign(object, index, value) {
+    try {
+      if (Array.isArray(object)) {
+        var result = matrix(object).subset(index, value).valueOf();
+
+        // shallow copy all (updated) items into the original array
+        result.forEach((item, index) => {
+          object[index] = item;
+        });
+        return object;
+      } else if (object && typeof object.subset === 'function') {
+        // Matrix
+        return object.subset(index, value);
+      } else if (typeof object === 'string') {
+        // TODO: move setStringSubset into a separate util file, use that
+        return subset(object, index, value);
+      } else if (typeof object === 'object') {
+        if (!index.isObjectProperty()) {
+          throw TypeError('Cannot apply a numeric index as object property');
+        }
+        setSafeProperty(object, index.getObjectProperty(), value);
+        return object;
+      } else {
+        throw new TypeError('Cannot apply index: unsupported type of object');
+      }
+    } catch (err) {
+      throw errorTransform(err);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/operators.js b/node_modules/mathjs/lib/esm/expression/operators.js
new file mode 100644
index 0000000..8623058
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/operators.js
@@ -0,0 +1,384 @@
+// list of identifiers of nodes in order of their precedence
+// also contains information about left/right associativity
+// and which other operator the operator is associative with
+// Example:
+// addition is associative with addition and subtraction, because:
+// (a+b)+c=a+(b+c)
+// (a+b)-c=a+(b-c)
+//
+// postfix operators are left associative, prefix operators
+// are right associative
+//
+// It's also possible to set the following properties:
+// latexParens: if set to false, this node doesn't need to be enclosed
+//              in parentheses when using LaTeX
+// latexLeftParens: if set to false, this !OperatorNode's!
+//                  left argument doesn't need to be enclosed
+//                  in parentheses
+// latexRightParens: the same for the right argument
+import { hasOwnProperty } from '../utils/object.js';
+import { isConstantNode, isParenthesisNode, rule2Node } from '../utils/is.js';
+export var properties = [{
+  // assignment
+  AssignmentNode: {},
+  FunctionAssignmentNode: {}
+}, {
+  // conditional expression
+  ConditionalNode: {
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false
+    // conditionals don't need parentheses in LaTeX because
+    // they are 2 dimensional
+  }
+}, {
+  // logical or
+  'OperatorNode:or': {
+    op: 'or',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical xor
+  'OperatorNode:xor': {
+    op: 'xor',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // logical and
+  'OperatorNode:and': {
+    op: 'and',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise or
+  'OperatorNode:bitOr': {
+    op: '|',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise xor
+  'OperatorNode:bitXor': {
+    op: '^|',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitwise and
+  'OperatorNode:bitAnd': {
+    op: '&',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // relational operators
+  'OperatorNode:equal': {
+    op: '==',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:unequal': {
+    op: '!=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smaller': {
+    op: '<',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:larger': {
+    op: '>',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:smallerEq': {
+    op: '<=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:largerEq': {
+    op: '>=',
+    associativity: 'left',
+    associativeWith: []
+  },
+  RelationalNode: {
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // bitshift operators
+  'OperatorNode:leftShift': {
+    op: '<<',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightArithShift': {
+    op: '>>',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:rightLogShift': {
+    op: '>>>',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // unit conversion
+  'OperatorNode:to': {
+    op: 'to',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // range
+  RangeNode: {}
+}, {
+  // addition, subtraction
+  'OperatorNode:add': {
+    op: '+',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:add', 'OperatorNode:subtract']
+  },
+  'OperatorNode:subtract': {
+    op: '-',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // multiply, divide, modulus
+  'OperatorNode:multiply': {
+    op: '*',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  },
+  'OperatorNode:divide': {
+    op: '/',
+    associativity: 'left',
+    associativeWith: [],
+    latexLeftParens: false,
+    latexRightParens: false,
+    latexParens: false
+    // fractions don't require parentheses because
+    // they're 2 dimensional, so parens aren't needed
+    // in LaTeX
+  },
+  'OperatorNode:dotMultiply': {
+    op: '.*',
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'OperatorNode:dotMultiply', 'OperatorNode:doDivide']
+  },
+  'OperatorNode:dotDivide': {
+    op: './',
+    associativity: 'left',
+    associativeWith: []
+  },
+  'OperatorNode:mod': {
+    op: 'mod',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // Repeat multiplication for implicit multiplication
+  'OperatorNode:multiply': {
+    associativity: 'left',
+    associativeWith: ['OperatorNode:multiply', 'OperatorNode:divide', 'Operator:dotMultiply', 'Operator:dotDivide']
+  }
+}, {
+  // unary prefix operators
+  'OperatorNode:unaryPlus': {
+    op: '+',
+    associativity: 'right'
+  },
+  'OperatorNode:unaryMinus': {
+    op: '-',
+    associativity: 'right'
+  },
+  'OperatorNode:bitNot': {
+    op: '~',
+    associativity: 'right'
+  },
+  'OperatorNode:not': {
+    op: 'not',
+    associativity: 'right'
+  }
+}, {
+  // exponentiation
+  'OperatorNode:pow': {
+    op: '^',
+    associativity: 'right',
+    associativeWith: [],
+    latexRightParens: false
+    // the exponent doesn't need parentheses in
+    // LaTeX because it's 2 dimensional
+    // (it's on top)
+  },
+  'OperatorNode:dotPow': {
+    op: '.^',
+    associativity: 'right',
+    associativeWith: []
+  }
+}, {
+  // nullish coalescing
+  'OperatorNode:nullish': {
+    op: '??',
+    associativity: 'left',
+    associativeWith: []
+  }
+}, {
+  // factorial
+  'OperatorNode:factorial': {
+    op: '!',
+    associativity: 'left'
+  }
+}, {
+  // matrix transpose
+  'OperatorNode:ctranspose': {
+    op: "'",
+    associativity: 'left'
+  }
+}];
+
+/**
+ * Returns the first non-parenthesis internal node, but only
+ * when the 'parenthesis' option is unset or auto.
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {Node}
+ */
+function unwrapParen(_node, parenthesis) {
+  if (!parenthesis || parenthesis !== 'auto') return _node;
+  var node = _node;
+  while (isParenthesisNode(node)) node = node.content;
+  return node;
+}
+
+/**
+ * Get the precedence of a Node.
+ * Higher number for higher precedence, starting with 0.
+ * Returns null if the precedence is undefined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @param {string} implicit
+ * @param {Node} parent (for determining context for implicit multiplication)
+ * @return {number | null}
+ */
+export function getPrecedence(_node, parenthesis, implicit, parent) {
+  var node = _node;
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+  var identifier = node.getIdentifier();
+  var precedence = null;
+  for (var i = 0; i < properties.length; i++) {
+    if (identifier in properties[i]) {
+      precedence = i;
+      break;
+    }
+  }
+  // Bump up precedence of implicit multiplication, except when preceded
+  // by a "Rule 2" fraction ( [unaryOp]constant / constant )
+  if (identifier === 'OperatorNode:multiply' && node.implicit && implicit !== 'show') {
+    var leftArg = unwrapParen(node.args[0], parenthesis);
+    if (!(isConstantNode(leftArg) && parent && parent.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(parent.args[0], parenthesis))) && !(leftArg.getIdentifier() === 'OperatorNode:divide' && rule2Node(unwrapParen(leftArg.args[0], parenthesis)) && isConstantNode(unwrapParen(leftArg.args[1])))) {
+      precedence += 1;
+    }
+  }
+  return precedence;
+}
+
+/**
+ * Get the associativity of an operator (left or right).
+ * Returns a string containing 'left' or 'right' or null if
+ * the associativity is not defined.
+ *
+ * @param {Node} _node
+ * @param {string} parenthesis
+ * @return {string|null}
+ * @throws {Error}
+ */
+export function getAssociativity(_node, parenthesis) {
+  var node = _node;
+  if (parenthesis !== 'keep') {
+    // ParenthesisNodes are only ignored when not in 'keep' mode
+    node = _node.getContent();
+  }
+  var identifier = node.getIdentifier();
+  var index = getPrecedence(node, parenthesis);
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+  var property = properties[index][identifier];
+  if (hasOwnProperty(property, 'associativity')) {
+    if (property.associativity === 'left') {
+      return 'left';
+    }
+    if (property.associativity === 'right') {
+      return 'right';
+    }
+    // associativity is invalid
+    throw Error('\'' + identifier + '\' has the invalid associativity \'' + property.associativity + '\'.');
+  }
+
+  // associativity is undefined
+  return null;
+}
+
+/**
+ * Check if an operator is associative with another operator.
+ * Returns either true or false or null if not defined.
+ *
+ * @param {Node} nodeA
+ * @param {Node} nodeB
+ * @param {string} parenthesis
+ * @return {boolean | null}
+ */
+export function isAssociativeWith(nodeA, nodeB, parenthesis) {
+  // ParenthesisNodes are only ignored when not in 'keep' mode
+  var a = parenthesis !== 'keep' ? nodeA.getContent() : nodeA;
+  var b = parenthesis !== 'keep' ? nodeA.getContent() : nodeB;
+  var identifierA = a.getIdentifier();
+  var identifierB = b.getIdentifier();
+  var index = getPrecedence(a, parenthesis);
+  if (index === null) {
+    // node isn't in the list
+    return null;
+  }
+  var property = properties[index][identifierA];
+  if (hasOwnProperty(property, 'associativeWith') && property.associativeWith instanceof Array) {
+    for (var i = 0; i < property.associativeWith.length; i++) {
+      if (property.associativeWith[i] === identifierB) {
+        return true;
+      }
+    }
+    return false;
+  }
+
+  // associativeWith is not defined
+  return null;
+}
+
+/**
+ * Get the operator associated with a function name.
+ * Returns a string with the operator symbol, or null if the
+ * input is not the name of a function associated with an
+ * operator.
+ *
+ * @param {string} Function name
+ * @return {string | null} Associated operator symbol, if any
+ */
+export function getOperator(fn) {
+  var identifier = 'OperatorNode:' + fn;
+  for (var group of properties) {
+    if (identifier in group) {
+      return group[identifier].op;
+    }
+  }
+  return null;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/parse.js b/node_modules/mathjs/lib/esm/expression/parse.js
new file mode 100644
index 0000000..6dd6e59
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/parse.js
@@ -0,0 +1,1641 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { factory } from '../utils/factory.js';
+import { isAccessorNode, isConstantNode, isFunctionNode, isOperatorNode, isSymbolNode, rule2Node } from '../utils/is.js';
+import { deepMap } from '../utils/collection.js';
+import { safeNumberType } from '../utils/number.js';
+import { hasOwnProperty } from '../utils/object.js';
+var name = 'parse';
+var dependencies = ['typed', 'numeric', 'config', 'AccessorNode', 'ArrayNode', 'AssignmentNode', 'BlockNode', 'ConditionalNode', 'ConstantNode', 'FunctionAssignmentNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'RangeNode', 'RelationalNode', 'SymbolNode'];
+export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    numeric,
+    config,
+    AccessorNode,
+    ArrayNode,
+    AssignmentNode,
+    BlockNode,
+    ConditionalNode,
+    ConstantNode,
+    FunctionAssignmentNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    RangeNode,
+    RelationalNode,
+    SymbolNode
+  } = _ref;
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate() or transformed into a functional object via node.compile().
+   *
+   * Note the evaluating arbitrary expressions may involve security risks,
+   * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+   *
+   * Syntax:
+   *
+   *     math.parse(expr)
+   *     math.parse(expr, options)
+   *     math.parse([expr1, expr2, expr3, ...])
+   *     math.parse([expr1, expr2, expr3, ...], options)
+   *
+   * Example:
+   *
+   *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+   *     node1.compile().evaluate() // 5
+   *
+   *     let scope = {a:3, b:4}
+   *     const node2 = math.parse('a * b')
+   *     node2.evaluate(scope) // 12
+   *     const code2 = node2.compile()
+   *     code2.evaluate(scope) // 12
+   *     scope.a = 5
+   *     code2.evaluate(scope) // 20
+   *
+   *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+   *     nodes[2].compile().evaluate() // 12
+   *
+   * See also:
+   *
+   *     evaluate, compile
+   *
+   * @param {string | string[] | Matrix} expr          Expression to be parsed
+   * @param {{nodes: Object<string, Node>}} [options]  Available options:
+   *                                                   - `nodes` a set of custom nodes
+   * @return {Node | Node[]} node
+   * @throws {Error}
+   */
+  var parse = typed(name, {
+    string: function string(expression) {
+      return parseStart(expression, {});
+    },
+    'Array | Matrix': function Array__Matrix(expressions) {
+      return parseMultiple(expressions, {});
+    },
+    'string, Object': function string_Object(expression, options) {
+      var extraNodes = options.nodes !== undefined ? options.nodes : {};
+      return parseStart(expression, extraNodes);
+    },
+    'Array | Matrix, Object': parseMultiple
+  });
+  function parseMultiple(expressions) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var extraNodes = options.nodes !== undefined ? options.nodes : {};
+
+    // parse an array or matrix with expressions
+    return deepMap(expressions, function (elem) {
+      if (typeof elem !== 'string') throw new TypeError('String expected');
+      return parseStart(elem, extraNodes);
+    });
+  }
+
+  // token types enumeration
+  var TOKENTYPE = {
+    NULL: 0,
+    DELIMITER: 1,
+    NUMBER: 2,
+    SYMBOL: 3,
+    UNKNOWN: 4
+  };
+
+  // map with all delimiters
+  var DELIMITERS = {
+    ',': true,
+    '(': true,
+    ')': true,
+    '[': true,
+    ']': true,
+    '{': true,
+    '}': true,
+    '"': true,
+    '\'': true,
+    ';': true,
+    '+': true,
+    '-': true,
+    '*': true,
+    '.*': true,
+    '/': true,
+    './': true,
+    '%': true,
+    '^': true,
+    '.^': true,
+    '~': true,
+    '!': true,
+    '&': true,
+    '|': true,
+    '^|': true,
+    '=': true,
+    ':': true,
+    '?': true,
+    '??': true,
+    '==': true,
+    '!=': true,
+    '<': true,
+    '>': true,
+    '<=': true,
+    '>=': true,
+    '<<': true,
+    '>>': true,
+    '>>>': true
+  };
+
+  // map with all named delimiters
+  var NAMED_DELIMITERS = {
+    mod: true,
+    to: true,
+    in: true,
+    and: true,
+    xor: true,
+    or: true,
+    not: true
+  };
+  var CONSTANTS = {
+    true: true,
+    false: false,
+    null: null,
+    undefined
+  };
+  var NUMERIC_CONSTANTS = ['NaN', 'Infinity'];
+  var ESCAPE_CHARACTERS = {
+    '"': '"',
+    "'": "'",
+    '\\': '\\',
+    '/': '/',
+    b: '\b',
+    f: '\f',
+    n: '\n',
+    r: '\r',
+    t: '\t'
+    // note that \u is handled separately in parseStringToken()
+  };
+  function initialState() {
+    return {
+      extraNodes: {},
+      // current extra nodes, must be careful not to mutate
+      expression: '',
+      // current expression
+      comment: '',
+      // last parsed comment
+      index: 0,
+      // current index in expr
+      token: '',
+      // current token
+      tokenType: TOKENTYPE.NULL,
+      // type of the token
+      nestingLevel: 0,
+      // level of nesting inside parameters, used to ignore newline characters
+      conditionalLevel: null // when a conditional is being parsed, the level of the conditional is stored here
+    };
+  }
+
+  /**
+   * View upto `length` characters of the expression starting at the current character.
+   *
+   * @param {Object} state
+   * @param {number} [length=1] Number of characters to view
+   * @returns {string}
+   * @private
+   */
+  function currentString(state, length) {
+    return state.expression.substr(state.index, length);
+  }
+
+  /**
+   * View the current character. Returns '' if end of expression is reached.
+   *
+   * @param {Object} state
+   * @returns {string}
+   * @private
+   */
+  function currentCharacter(state) {
+    return currentString(state, 1);
+  }
+
+  /**
+   * Get the next character from the expression.
+   * The character is stored into the char c. If the end of the expression is
+   * reached, the function puts an empty string in c.
+   * @private
+   */
+  function next(state) {
+    state.index++;
+  }
+
+  /**
+   * Preview the previous character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+  function prevCharacter(state) {
+    return state.expression.charAt(state.index - 1);
+  }
+
+  /**
+   * Preview the next character from the expression.
+   * @return {string} cNext
+   * @private
+   */
+  function nextCharacter(state) {
+    return state.expression.charAt(state.index + 1);
+  }
+
+  /**
+   * Get next token in the current string expr.
+   * The token and token type are available as token and tokenType
+   * @private
+   */
+  function getToken(state) {
+    state.tokenType = TOKENTYPE.NULL;
+    state.token = '';
+    state.comment = '';
+
+    // skip over ignored characters:
+    while (true) {
+      // comments:
+      if (currentCharacter(state) === '#') {
+        while (currentCharacter(state) !== '\n' && currentCharacter(state) !== '') {
+          state.comment += currentCharacter(state);
+          next(state);
+        }
+      }
+      // whitespace: space, tab, and newline when inside parameters
+      if (parse.isWhitespace(currentCharacter(state), state.nestingLevel)) {
+        next(state);
+      } else {
+        break;
+      }
+    }
+
+    // check for end of expression
+    if (currentCharacter(state) === '') {
+      // token is still empty
+      state.tokenType = TOKENTYPE.DELIMITER;
+      return;
+    }
+
+    // check for new line character
+    if (currentCharacter(state) === '\n' && !state.nestingLevel) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = currentCharacter(state);
+      next(state);
+      return;
+    }
+    var c1 = currentCharacter(state);
+    var c2 = currentString(state, 2);
+    var c3 = currentString(state, 3);
+    if (c3.length === 3 && DELIMITERS[c3]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c3;
+      next(state);
+      next(state);
+      next(state);
+      return;
+    }
+
+    // check for delimiters consisting of 2 characters
+    if (c2.length === 2 && DELIMITERS[c2]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c2;
+      next(state);
+      next(state);
+      return;
+    }
+
+    // check for delimiters consisting of 1 character
+    if (DELIMITERS[c1]) {
+      state.tokenType = TOKENTYPE.DELIMITER;
+      state.token = c1;
+      next(state);
+      return;
+    }
+
+    // check for a number
+    if (parse.isDigitDot(c1)) {
+      state.tokenType = TOKENTYPE.NUMBER;
+
+      // check for binary, octal, or hex
+      var _c = currentString(state, 2);
+      if (_c === '0b' || _c === '0o' || _c === '0x') {
+        state.token += currentCharacter(state);
+        next(state);
+        state.token += currentCharacter(state);
+        next(state);
+        while (parse.isHexDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+        if (currentCharacter(state) === '.') {
+          // this number has a radix point
+          state.token += '.';
+          next(state);
+          // get the digits after the radix
+          while (parse.isHexDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        } else if (currentCharacter(state) === 'i') {
+          // this number has a word size suffix
+          state.token += 'i';
+          next(state);
+          // get the word size
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+        }
+        return;
+      }
+
+      // get number, can have a single dot
+      if (currentCharacter(state) === '.') {
+        state.token += currentCharacter(state);
+        next(state);
+        if (!parse.isDigit(currentCharacter(state))) {
+          // this is no number, it is just a dot (can be dot notation)
+          state.tokenType = TOKENTYPE.DELIMITER;
+          return;
+        }
+      } else {
+        while (parse.isDigit(currentCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+        if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+          state.token += currentCharacter(state);
+          next(state);
+        }
+      }
+      while (parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+      // check for exponential notation like "2.3e-4", "1.23e50" or "2e+4"
+      if (currentCharacter(state) === 'E' || currentCharacter(state) === 'e') {
+        if (parse.isDigit(nextCharacter(state)) || nextCharacter(state) === '-' || nextCharacter(state) === '+') {
+          state.token += currentCharacter(state);
+          next(state);
+          if (currentCharacter(state) === '+' || currentCharacter(state) === '-') {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+          // Scientific notation MUST be followed by an exponent
+          if (!parse.isDigit(currentCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+          while (parse.isDigit(currentCharacter(state))) {
+            state.token += currentCharacter(state);
+            next(state);
+          }
+          if (parse.isDecimalMark(currentCharacter(state), nextCharacter(state))) {
+            throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+          }
+        } else if (parse.isDecimalMark(nextCharacter(state), state.expression.charAt(state.index + 2))) {
+          next(state);
+          throw createSyntaxError(state, 'Digit expected, got "' + currentCharacter(state) + '"');
+        }
+      }
+      return;
+    }
+
+    // check for variables, functions, named operators
+    if (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state))) {
+      while (parse.isAlpha(currentCharacter(state), prevCharacter(state), nextCharacter(state)) || parse.isDigit(currentCharacter(state))) {
+        state.token += currentCharacter(state);
+        next(state);
+      }
+      if (hasOwnProperty(NAMED_DELIMITERS, state.token)) {
+        state.tokenType = TOKENTYPE.DELIMITER;
+      } else {
+        state.tokenType = TOKENTYPE.SYMBOL;
+      }
+      return;
+    }
+
+    // something unknown is found, wrong characters -> a syntax error
+    state.tokenType = TOKENTYPE.UNKNOWN;
+    while (currentCharacter(state) !== '') {
+      state.token += currentCharacter(state);
+      next(state);
+    }
+    throw createSyntaxError(state, 'Syntax error in part "' + state.token + '"');
+  }
+
+  /**
+   * Get next token and skip newline tokens
+   */
+  function getTokenSkipNewline(state) {
+    do {
+      getToken(state);
+    } while (state.token === '\n'); // eslint-disable-line no-unmodified-loop-condition
+  }
+
+  /**
+   * Open parameters.
+   * New line characters will be ignored until closeParams(state) is called
+   */
+  function openParams(state) {
+    state.nestingLevel++;
+  }
+
+  /**
+   * Close parameters.
+   * New line characters will no longer be ignored
+   */
+  function closeParams(state) {
+    state.nestingLevel--;
+  }
+
+  /**
+   * Checks whether the current character `c` is a valid alpha character:
+   *
+   * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+   * - An underscore                        Ascii: _
+   * - A dollar sign                        Ascii: $
+   * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+   * - A greek letter                       Unicode: \u0370 - \u03FF
+   * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+   *
+   * The previous and next characters are needed to determine whether
+   * this character is part of a unicode surrogate pair.
+   *
+   * @param {string} c      Current character in the expression
+   * @param {string} cPrev  Previous character
+   * @param {string} cNext  Next character
+   * @return {boolean}
+   */
+  parse.isAlpha = function isAlpha(c, cPrev, cNext) {
+    return parse.isValidLatinOrGreek(c) || parse.isValidMathSymbol(c, cNext) || parse.isValidMathSymbol(cPrev, c);
+  };
+
+  /**
+   * Test whether a character is a valid latin, greek, or letter-like character
+   * @param {string} c
+   * @return {boolean}
+   */
+  parse.isValidLatinOrGreek = function isValidLatinOrGreek(c) {
+    return /^[a-zA-Z_$\u00C0-\u02AF\u0370-\u03FF\u2100-\u214F]$/.test(c);
+  };
+
+  /**
+   * Test whether two given 16 bit characters form a surrogate pair of a
+   * unicode math symbol.
+   *
+   * https://unicode-table.com/en/
+   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+   *
+   * Note: In ES6 will be unicode aware:
+   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+   * https://mathiasbynens.be/notes/es6-unicode-regex
+   *
+   * @param {string} high
+   * @param {string} low
+   * @return {boolean}
+   */
+  parse.isValidMathSymbol = function isValidMathSymbol(high, low) {
+    return /^[\uD835]$/.test(high) && /^[\uDC00-\uDFFF]$/.test(low) && /^[^\uDC55\uDC9D\uDCA0\uDCA1\uDCA3\uDCA4\uDCA7\uDCA8\uDCAD\uDCBA\uDCBC\uDCC4\uDD06\uDD0B\uDD0C\uDD15\uDD1D\uDD3A\uDD3F\uDD45\uDD47-\uDD49\uDD51\uDEA6\uDEA7\uDFCC\uDFCD]$/.test(low);
+  };
+
+  /**
+   * Check whether given character c is a white space character: space, tab, or enter
+   * @param {string} c
+   * @param {number} nestingLevel
+   * @return {boolean}
+   */
+  parse.isWhitespace = function isWhitespace(c, nestingLevel) {
+    // TODO: also take '\r' carriage return as newline? Or does that give problems on mac?
+    return c === ' ' || c === '\t' || c === '\u00A0' || c === '\n' && nestingLevel > 0;
+  };
+
+  /**
+   * Test whether the character c is a decimal mark (dot).
+   * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+   * @param {string} c
+   * @param {string} cNext
+   * @return {boolean}
+   */
+  parse.isDecimalMark = function isDecimalMark(c, cNext) {
+    return c === '.' && cNext !== '/' && cNext !== '*' && cNext !== '^';
+  };
+
+  /**
+   * checks if the given char c is a digit or dot
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isDigitDot = function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  };
+
+  /**
+   * checks if the given char c is a digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isDigit = function isDigit(c) {
+    return c >= '0' && c <= '9';
+  };
+
+  /**
+   * checks if the given char c is a hex digit
+   * @param {string} c   a string with one character
+   * @return {boolean}
+   */
+  parse.isHexDigit = function isHexDigit(c) {
+    return c >= '0' && c <= '9' || c >= 'a' && c <= 'f' || c >= 'A' && c <= 'F';
+  };
+
+  /**
+   * Start of the parse levels below, in order of precedence
+   * @return {Node} node
+   * @private
+   */
+  function parseStart(expression, extraNodes) {
+    var state = initialState();
+    _extends(state, {
+      expression,
+      extraNodes
+    });
+    getToken(state);
+    var node = parseBlock(state);
+
+    // check for garbage at the end of the expression
+    // an expression ends with a empty character '' and tokenType DELIMITER
+    if (state.token !== '') {
+      if (state.tokenType === TOKENTYPE.DELIMITER) {
+        // user entered a not existing operator like "//"
+
+        // TODO: give hints for aliases, for example with "<>" give as hint " did you mean !== ?"
+        throw createError(state, 'Unexpected operator ' + state.token);
+      } else {
+        throw createSyntaxError(state, 'Unexpected part "' + state.token + '"');
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Parse a block with expressions. Expressions can be separated by a newline
+   * character '\n', or by a semicolon ';'. In case of a semicolon, no output
+   * of the preceding line is returned.
+   * @return {Node} node
+   * @private
+   */
+  function parseBlock(state) {
+    var node;
+    var blocks = [];
+    var visible;
+    if (state.token !== '' && state.token !== '\n' && state.token !== ';') {
+      node = parseAssignment(state);
+      if (state.comment) {
+        node.comment = state.comment;
+      }
+    }
+
+    // TODO: simplify this loop
+    while (state.token === '\n' || state.token === ';') {
+      // eslint-disable-line no-unmodified-loop-condition
+      if (blocks.length === 0 && node) {
+        visible = state.token !== ';';
+        blocks.push({
+          node,
+          visible
+        });
+      }
+      getToken(state);
+      if (state.token !== '\n' && state.token !== ';' && state.token !== '') {
+        node = parseAssignment(state);
+        if (state.comment) {
+          node.comment = state.comment;
+        }
+        visible = state.token !== ';';
+        blocks.push({
+          node,
+          visible
+        });
+      }
+    }
+    if (blocks.length > 0) {
+      return new BlockNode(blocks);
+    } else {
+      if (!node) {
+        node = new ConstantNode(undefined);
+        if (state.comment) {
+          node.comment = state.comment;
+        }
+      }
+      return node;
+    }
+  }
+
+  /**
+   * Assignment of a function or variable,
+   * - can be a variable like 'a=2.3'
+   * - or a updating an existing variable like 'matrix(2,3:5)=[6,7,8]'
+   * - defining a function like 'f(x) = x^2'
+   * @return {Node} node
+   * @private
+   */
+  function parseAssignment(state) {
+    var name, args, value, valid;
+    var node = parseConditional(state);
+    if (state.token === '=') {
+      if (isSymbolNode(node)) {
+        // parse a variable assignment like 'a = 2/3'
+        name = node.name;
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(new SymbolNode(name), value);
+      } else if (isAccessorNode(node)) {
+        // parse a matrix subset assignment like 'A[1,2] = 4'
+        getTokenSkipNewline(state);
+        value = parseAssignment(state);
+        return new AssignmentNode(node.object, node.index, value);
+      } else if (isFunctionNode(node) && isSymbolNode(node.fn)) {
+        // parse function assignment like 'f(x) = x^2'
+        valid = true;
+        args = [];
+        name = node.name;
+        node.args.forEach(function (arg, index) {
+          if (isSymbolNode(arg)) {
+            args[index] = arg.name;
+          } else {
+            valid = false;
+          }
+        });
+        if (valid) {
+          getTokenSkipNewline(state);
+          value = parseAssignment(state);
+          return new FunctionAssignmentNode(name, args, value);
+        }
+      }
+      throw createSyntaxError(state, 'Invalid left hand side of assignment operator =');
+    }
+    return node;
+  }
+
+  /**
+   * conditional operation
+   *
+   *     condition ? truePart : falsePart
+   *
+   * Note: conditional operator is right-associative
+   *
+   * @return {Node} node
+   * @private
+   */
+  function parseConditional(state) {
+    var node = parseLogicalOr(state);
+    while (state.token === '?') {
+      // eslint-disable-line no-unmodified-loop-condition
+      // set a conditional level, the range operator will be ignored as long
+      // as conditionalLevel === state.nestingLevel.
+      var prev = state.conditionalLevel;
+      state.conditionalLevel = state.nestingLevel;
+      getTokenSkipNewline(state);
+      var condition = node;
+      var trueExpr = parseAssignment(state);
+      if (state.token !== ':') throw createSyntaxError(state, 'False part of conditional expression expected');
+      state.conditionalLevel = null;
+      getTokenSkipNewline(state);
+      var falseExpr = parseAssignment(state); // Note: check for conditional operator again, right associativity
+
+      node = new ConditionalNode(condition, trueExpr, falseExpr);
+
+      // restore the previous conditional level
+      state.conditionalLevel = prev;
+    }
+    return node;
+  }
+
+  /**
+   * logical or, 'x or y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalOr(state) {
+    var node = parseLogicalXor(state);
+    while (state.token === 'or') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('or', 'or', [node, parseLogicalXor(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * logical exclusive or, 'x xor y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalXor(state) {
+    var node = parseLogicalAnd(state);
+    while (state.token === 'xor') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('xor', 'xor', [node, parseLogicalAnd(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * logical and, 'x and y'
+   * @return {Node} node
+   * @private
+   */
+  function parseLogicalAnd(state) {
+    var node = parseBitwiseOr(state);
+    while (state.token === 'and') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('and', 'and', [node, parseBitwiseOr(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise or, 'x | y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseOr(state) {
+    var node = parseBitwiseXor(state);
+    while (state.token === '|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('|', 'bitOr', [node, parseBitwiseXor(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise exclusive or (xor), 'x ^| y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseXor(state) {
+    var node = parseBitwiseAnd(state);
+    while (state.token === '^|') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('^|', 'bitXor', [node, parseBitwiseAnd(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * bitwise and, 'x & y'
+   * @return {Node} node
+   * @private
+   */
+  function parseBitwiseAnd(state) {
+    var node = parseRelational(state);
+    while (state.token === '&') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('&', 'bitAnd', [node, parseRelational(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * Parse a chained conditional, like 'a > b >= c'
+   * @return {Node} node
+   */
+  function parseRelational(state) {
+    var params = [parseShift(state)];
+    var conditionals = [];
+    var operators = {
+      '==': 'equal',
+      '!=': 'unequal',
+      '<': 'smaller',
+      '>': 'larger',
+      '<=': 'smallerEq',
+      '>=': 'largerEq'
+    };
+    while (hasOwnProperty(operators, state.token)) {
+      // eslint-disable-line no-unmodified-loop-condition
+      var cond = {
+        name: state.token,
+        fn: operators[state.token]
+      };
+      conditionals.push(cond);
+      getTokenSkipNewline(state);
+      params.push(parseShift(state));
+    }
+    if (params.length === 1) {
+      return params[0];
+    } else if (params.length === 2) {
+      return new OperatorNode(conditionals[0].name, conditionals[0].fn, params);
+    } else {
+      return new RelationalNode(conditionals.map(c => c.fn), params);
+    }
+  }
+
+  /**
+   * Bitwise left shift, bitwise right arithmetic shift, bitwise right logical shift
+   * @return {Node} node
+   * @private
+   */
+  function parseShift(state) {
+    var node, name, fn, params;
+    node = parseConversion(state);
+    var operators = {
+      '<<': 'leftShift',
+      '>>': 'rightArithShift',
+      '>>>': 'rightLogShift'
+    };
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      params = [node, parseConversion(state)];
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * conversion operators 'to' and 'in'
+   * @return {Node} node
+   * @private
+   */
+  function parseConversion(state) {
+    var node, name, fn, params;
+    node = parseRange(state);
+    var operators = {
+      to: 'to',
+      in: 'to' // alias of 'to'
+    };
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      if (name === 'in' && '])},;'.includes(state.token)) {
+        // end of expression -> this is the unit 'in' ('inch')
+        node = new OperatorNode('*', 'multiply', [node, new SymbolNode('in')], true);
+      } else {
+        // operator 'a to b' or 'a in b'
+        params = [node, parseRange(state)];
+        node = new OperatorNode(name, fn, params);
+      }
+    }
+    return node;
+  }
+
+  /**
+   * parse range, "start:end", "start:step:end", ":", "start:", ":end", etc
+   * @return {Node} node
+   * @private
+   */
+  function parseRange(state) {
+    var node;
+    var params = [];
+    if (state.token === ':') {
+      // implicit start=1 (one-based)
+      node = new ConstantNode(1);
+    } else {
+      // explicit start
+      node = parseAddSubtract(state);
+    }
+    if (state.token === ':' && state.conditionalLevel !== state.nestingLevel) {
+      // we ignore the range operator when a conditional operator is being processed on the same level
+      params.push(node);
+
+      // parse step and end
+      while (state.token === ':' && params.length < 3) {
+        // eslint-disable-line no-unmodified-loop-condition
+        getTokenSkipNewline(state);
+        if (state.token === ')' || state.token === ']' || state.token === ',' || state.token === '') {
+          // implicit end
+          params.push(new SymbolNode('end'));
+        } else {
+          // explicit end
+          params.push(parseAddSubtract(state));
+        }
+      }
+      if (params.length === 3) {
+        // params = [start, step, end]
+        node = new RangeNode(params[0], params[2], params[1]); // start, end, step
+      } else {
+        // length === 2
+        // params = [start, end]
+        node = new RangeNode(params[0], params[1]); // start, end
+      }
+    }
+    return node;
+  }
+
+  /**
+   * add or subtract
+   * @return {Node} node
+   * @private
+   */
+  function parseAddSubtract(state) {
+    var node, name, fn, params;
+    node = parseMultiplyDivideModulusPercentage(state);
+    var operators = {
+      '+': 'add',
+      '-': 'subtract'
+    };
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getTokenSkipNewline(state);
+      var rightNode = parseMultiplyDivideModulusPercentage(state);
+      if (rightNode.isPercentage) {
+        params = [node, new OperatorNode('*', 'multiply', [node, rightNode])];
+      } else {
+        params = [node, rightNode];
+      }
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * multiply, divide, modulus, percentage
+   * @return {Node} node
+   * @private
+   */
+  function parseMultiplyDivideModulusPercentage(state) {
+    var node, last, name, fn;
+    node = parseImplicitMultiplication(state);
+    last = node;
+    var operators = {
+      '*': 'multiply',
+      '.*': 'dotMultiply',
+      '/': 'divide',
+      './': 'dotDivide',
+      '%': 'mod',
+      mod: 'mod'
+    };
+    while (true) {
+      if (hasOwnProperty(operators, state.token)) {
+        // explicit operators
+        name = state.token;
+        fn = operators[name];
+        getTokenSkipNewline(state);
+        if (name === '%' && state.tokenType === TOKENTYPE.DELIMITER && state.token !== '(') {
+          // If the expression contains only %, then treat that as /100
+          if (state.token !== '' && operators[state.token]) {
+            var left = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+            name = state.token;
+            fn = operators[name];
+            getTokenSkipNewline(state);
+            last = parseImplicitMultiplication(state);
+            node = new OperatorNode(name, fn, [left, last]);
+          } else {
+            node = new OperatorNode('/', 'divide', [node, new ConstantNode(100)], false, true);
+          }
+          // return node
+        } else {
+          last = parseImplicitMultiplication(state);
+          node = new OperatorNode(name, fn, [node, last]);
+        }
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * implicit multiplication
+   * @return {Node} node
+   * @private
+   */
+  function parseImplicitMultiplication(state) {
+    var node, last;
+    node = parseRule2(state);
+    last = node;
+    while (true) {
+      if (state.tokenType === TOKENTYPE.SYMBOL || state.token === 'in' && isConstantNode(node) || state.token === 'in' && isOperatorNode(node) && node.fn === 'unaryMinus' && isConstantNode(node.args[0]) || state.tokenType === TOKENTYPE.NUMBER && !isConstantNode(last) && (!isOperatorNode(last) || last.op === '!') || state.token === '(') {
+        // parse implicit multiplication
+        //
+        // symbol:      implicit multiplication like '2a', '(2+3)a', 'a b'
+        // number:      implicit multiplication like '(2+3)2'
+        // parenthesis: implicit multiplication like '2(3+4)', '(3+4)(1+2)'
+        last = parseRule2(state);
+        node = new OperatorNode('*', 'multiply', [node, last], true /* implicit */);
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Infamous "rule 2" as described in https://github.com/josdejong/mathjs/issues/792#issuecomment-361065370
+   * And as amended in https://github.com/josdejong/mathjs/issues/2370#issuecomment-1054052164
+   * Explicit division gets higher precedence than implicit multiplication
+   * when the division matches this pattern:
+   *   [unaryPrefixOp]?[number] / [number] [symbol]
+   * @return {Node} node
+   * @private
+   */
+  function parseRule2(state) {
+    var node = parseUnary(state);
+    var last = node;
+    var tokenStates = [];
+    while (true) {
+      // Match the "number /" part of the pattern "number / number symbol"
+      if (state.token === '/' && rule2Node(last)) {
+        // Look ahead to see if the next token is a number
+        tokenStates.push(_extends({}, state));
+        getTokenSkipNewline(state);
+
+        // Match the "number / number" part of the pattern
+        if (state.tokenType === TOKENTYPE.NUMBER) {
+          // Look ahead again
+          tokenStates.push(_extends({}, state));
+          getTokenSkipNewline(state);
+
+          // Match the "symbol" part of the pattern, or a left parenthesis
+          if (state.tokenType === TOKENTYPE.SYMBOL || state.token === '(' || state.token === 'in') {
+            // We've matched the pattern "number / number symbol".
+            // Rewind once and build the "number / number" node; the symbol will be consumed later
+            _extends(state, tokenStates.pop());
+            tokenStates.pop();
+            last = parseUnary(state);
+            node = new OperatorNode('/', 'divide', [node, last]);
+          } else {
+            // Not a match, so rewind
+            tokenStates.pop();
+            _extends(state, tokenStates.pop());
+            break;
+          }
+        } else {
+          // Not a match, so rewind
+          _extends(state, tokenStates.pop());
+          break;
+        }
+      } else {
+        break;
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Unary plus and minus, and logical and bitwise not
+   * @return {Node} node
+   * @private
+   */
+  function parseUnary(state) {
+    var name, params, fn;
+    var operators = {
+      '-': 'unaryMinus',
+      '+': 'unaryPlus',
+      '~': 'bitNot',
+      not: 'not'
+    };
+    if (hasOwnProperty(operators, state.token)) {
+      fn = operators[state.token];
+      name = state.token;
+      getTokenSkipNewline(state);
+      params = [parseUnary(state)];
+      return new OperatorNode(name, fn, params);
+    }
+    return parsePow(state);
+  }
+
+  /**
+   * power
+   * Note: power operator is right associative
+   * @return {Node} node
+   * @private
+   */
+  function parsePow(state) {
+    var node, name, fn, params;
+    node = parseNullishCoalescing(state);
+    if (state.token === '^' || state.token === '.^') {
+      name = state.token;
+      fn = name === '^' ? 'pow' : 'dotPow';
+      getTokenSkipNewline(state);
+      params = [node, parseUnary(state)]; // Go back to unary, we can have '2^-3'
+      node = new OperatorNode(name, fn, params);
+    }
+    return node;
+  }
+
+  /**
+   * nullish coalescing operator
+   * @return {Node} node
+   * @private
+   */
+  function parseNullishCoalescing(state) {
+    var node = parseLeftHandOperators(state);
+    while (state.token === '??') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getTokenSkipNewline(state);
+      node = new OperatorNode('??', 'nullish', [node, parseLeftHandOperators(state)]);
+    }
+    return node;
+  }
+
+  /**
+   * Left hand operators: factorial x!, ctranspose x'
+   * @return {Node} node
+   * @private
+   */
+  function parseLeftHandOperators(state) {
+    var node, name, fn, params;
+    node = parseCustomNodes(state);
+    var operators = {
+      '!': 'factorial',
+      '\'': 'ctranspose'
+    };
+    while (hasOwnProperty(operators, state.token)) {
+      name = state.token;
+      fn = operators[name];
+      getToken(state);
+      params = [node];
+      node = new OperatorNode(name, fn, params);
+      node = parseAccessors(state, node);
+    }
+    return node;
+  }
+
+  /**
+   * Parse a custom node handler. A node handler can be used to process
+   * nodes in a custom way, for example for handling a plot.
+   *
+   * A handler must be passed as second argument of the parse function.
+   * - must extend math.Node
+   * - must contain a function _compile(defs: Object) : string
+   * - must contain a function find(filter: Object) : Node[]
+   * - must contain a function toString() : string
+   * - the constructor is called with a single argument containing all parameters
+   *
+   * For example:
+   *
+   *     nodes = {
+   *       'plot': PlotHandler
+   *     }
+   *
+   * The constructor of the handler is called as:
+   *
+   *     node = new PlotHandler(params)
+   *
+   * The handler will be invoked when evaluating an expression like:
+   *
+   *     node = math.parse('plot(sin(x), x)', nodes)
+   *
+   * @return {Node} node
+   * @private
+   */
+  function parseCustomNodes(state) {
+    var params = [];
+    if (state.tokenType === TOKENTYPE.SYMBOL && hasOwnProperty(state.extraNodes, state.token)) {
+      var CustomNode = state.extraNodes[state.token];
+      getToken(state);
+
+      // parse parameters
+      if (state.token === '(') {
+        params = [];
+        openParams(state);
+        getToken(state);
+        if (state.token !== ')') {
+          params.push(parseAssignment(state));
+
+          // parse a list with parameters
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+        if (state.token !== ')') {
+          throw createSyntaxError(state, 'Parenthesis ) expected');
+        }
+        closeParams(state);
+        getToken(state);
+      }
+
+      // create a new custom node
+      // noinspection JSValidateTypes
+      return new CustomNode(params);
+    }
+    return parseSymbol(state);
+  }
+
+  /**
+   * parse symbols: functions, variables, constants, units
+   * @return {Node} node
+   * @private
+   */
+  function parseSymbol(state) {
+    var node, name;
+    if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+      name = state.token;
+      getToken(state);
+      if (hasOwnProperty(CONSTANTS, name)) {
+        // true, false, null, ...
+        node = new ConstantNode(CONSTANTS[name]);
+      } else if (NUMERIC_CONSTANTS.includes(name)) {
+        // NaN, Infinity
+        node = new ConstantNode(numeric(name, 'number'));
+      } else {
+        node = new SymbolNode(name);
+      }
+
+      // parse function parameters and matrix index
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseString(state);
+  }
+
+  /**
+   * parse accessors:
+   * - function invocation in round brackets (...), for example sqrt(2)
+   * - index enclosed in square brackets [...], for example A[2,3]
+   * - dot notation for properties, like foo.bar
+   * @param {Object} state
+   * @param {Node} node    Node on which to apply the parameters. If there
+   *                       are no parameters in the expression, the node
+   *                       itself is returned
+   * @param {string[]} [types]  Filter the types of notations
+   *                            can be ['(', '[', '.']
+   * @return {Node} node
+   * @private
+   */
+  function parseAccessors(state, node, types) {
+    var params;
+    while ((state.token === '(' || state.token === '[' || state.token === '.') && (!types || types.includes(state.token))) {
+      // eslint-disable-line no-unmodified-loop-condition
+      params = [];
+      if (state.token === '(') {
+        if (isSymbolNode(node) || isAccessorNode(node)) {
+          // function invocation like fn(2, 3) or obj.fn(2, 3)
+          openParams(state);
+          getToken(state);
+          if (state.token !== ')') {
+            params.push(parseAssignment(state));
+
+            // parse a list with parameters
+            while (state.token === ',') {
+              // eslint-disable-line no-unmodified-loop-condition
+              getToken(state);
+              params.push(parseAssignment(state));
+            }
+          }
+          if (state.token !== ')') {
+            throw createSyntaxError(state, 'Parenthesis ) expected');
+          }
+          closeParams(state);
+          getToken(state);
+          node = new FunctionNode(node, params);
+        } else {
+          // implicit multiplication like (2+3)(4+5) or sqrt(2)(1+2)
+          // don't parse it here but let it be handled by parseImplicitMultiplication
+          // with correct precedence
+          return node;
+        }
+      } else if (state.token === '[') {
+        // index notation like variable[2, 3]
+        openParams(state);
+        getToken(state);
+        if (state.token !== ']') {
+          params.push(parseAssignment(state));
+
+          // parse a list with parameters
+          while (state.token === ',') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            params.push(parseAssignment(state));
+          }
+        }
+        if (state.token !== ']') {
+          throw createSyntaxError(state, 'Parenthesis ] expected');
+        }
+        closeParams(state);
+        getToken(state);
+        node = new AccessorNode(node, new IndexNode(params));
+      } else {
+        // dot notation like variable.prop
+        getToken(state);
+        var isPropertyName = state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS;
+        if (!isPropertyName) {
+          throw createSyntaxError(state, 'Property name expected after dot');
+        }
+        params.push(new ConstantNode(state.token));
+        getToken(state);
+        var dotNotation = true;
+        node = new AccessorNode(node, new IndexNode(params, dotNotation));
+      }
+    }
+    return node;
+  }
+
+  /**
+   * Parse a single or double quoted string.
+   * @return {Node} node
+   * @private
+   */
+  function parseString(state) {
+    var node, str;
+    if (state.token === '"' || state.token === "'") {
+      str = parseStringToken(state, state.token);
+
+      // create constant
+      node = new ConstantNode(str);
+
+      // parse index parameters
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseMatrix(state);
+  }
+
+  /**
+   * Parse a string surrounded by single or double quotes
+   * @param {Object} state
+   * @param {"'" | "\""} quote
+   * @return {string}
+   */
+  function parseStringToken(state, quote) {
+    var str = '';
+    while (currentCharacter(state) !== '' && currentCharacter(state) !== quote) {
+      if (currentCharacter(state) === '\\') {
+        next(state);
+        var char = currentCharacter(state);
+        var escapeChar = ESCAPE_CHARACTERS[char];
+        if (escapeChar !== undefined) {
+          // an escaped control character like \" or \n
+          str += escapeChar;
+          state.index += 1;
+        } else if (char === 'u') {
+          // escaped unicode character
+          var unicode = state.expression.slice(state.index + 1, state.index + 5);
+          if (/^[0-9A-Fa-f]{4}$/.test(unicode)) {
+            // test whether the string holds four hexadecimal values
+            str += String.fromCharCode(parseInt(unicode, 16));
+            state.index += 5;
+          } else {
+            throw createSyntaxError(state, "Invalid unicode character \\u".concat(unicode));
+          }
+        } else {
+          throw createSyntaxError(state, "Bad escape character \\".concat(char));
+        }
+      } else {
+        // any regular character
+        str += currentCharacter(state);
+        next(state);
+      }
+    }
+    getToken(state);
+    if (state.token !== quote) {
+      throw createSyntaxError(state, "End of string ".concat(quote, " expected"));
+    }
+    getToken(state);
+    return str;
+  }
+
+  /**
+   * parse the matrix
+   * @return {Node} node
+   * @private
+   */
+  function parseMatrix(state) {
+    var array, params, rows, cols;
+    if (state.token === '[') {
+      // matrix [...]
+      openParams(state);
+      getToken(state);
+      if (state.token !== ']') {
+        // this is a non-empty matrix
+        var row = parseRow(state);
+        if (state.token === ';') {
+          // 2 dimensional array
+          rows = 1;
+          params = [row];
+
+          // the rows of the matrix are separated by dot-comma's
+          while (state.token === ';') {
+            // eslint-disable-line no-unmodified-loop-condition
+            getToken(state);
+            if (state.token !== ']') {
+              params[rows] = parseRow(state);
+              rows++;
+            }
+          }
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+          closeParams(state);
+          getToken(state);
+
+          // check if the number of columns matches in all rows
+          cols = params[0].items.length;
+          for (var r = 1; r < rows; r++) {
+            if (params[r].items.length !== cols) {
+              throw createError(state, 'Column dimensions mismatch ' + '(' + params[r].items.length + ' !== ' + cols + ')');
+            }
+          }
+          array = new ArrayNode(params);
+        } else {
+          // 1 dimensional vector
+          if (state.token !== ']') {
+            throw createSyntaxError(state, 'End of matrix ] expected');
+          }
+          closeParams(state);
+          getToken(state);
+          array = row;
+        }
+      } else {
+        // this is an empty matrix "[ ]"
+        closeParams(state);
+        getToken(state);
+        array = new ArrayNode([]);
+      }
+      return parseAccessors(state, array);
+    }
+    return parseObject(state);
+  }
+
+  /**
+   * Parse a single comma-separated row from a matrix, like 'a, b, c'
+   * @return {ArrayNode} node
+   */
+  function parseRow(state) {
+    var params = [parseAssignment(state)];
+    var len = 1;
+    while (state.token === ',') {
+      // eslint-disable-line no-unmodified-loop-condition
+      getToken(state);
+
+      // parse expression
+      if (state.token !== ']' && state.token !== ';') {
+        params[len] = parseAssignment(state);
+        len++;
+      }
+    }
+    return new ArrayNode(params);
+  }
+
+  /**
+   * parse an object, enclosed in angle brackets{...}, for example {value: 2}
+   * @return {Node} node
+   * @private
+   */
+  function parseObject(state) {
+    if (state.token === '{') {
+      openParams(state);
+      var key;
+      var properties = {};
+      do {
+        getToken(state);
+        if (state.token !== '}') {
+          // parse key
+          if (state.token === '"' || state.token === "'") {
+            key = parseStringToken(state, state.token);
+          } else if (state.tokenType === TOKENTYPE.SYMBOL || state.tokenType === TOKENTYPE.DELIMITER && state.token in NAMED_DELIMITERS) {
+            key = state.token;
+            getToken(state);
+          } else {
+            throw createSyntaxError(state, 'Symbol or string expected as object key');
+          }
+
+          // parse key/value separator
+          if (state.token !== ':') {
+            throw createSyntaxError(state, 'Colon : expected after object key');
+          }
+          getToken(state);
+
+          // parse key
+          properties[key] = parseAssignment(state);
+        }
+      } while (state.token === ','); // eslint-disable-line no-unmodified-loop-condition
+
+      if (state.token !== '}') {
+        throw createSyntaxError(state, 'Comma , or bracket } expected after object value');
+      }
+      closeParams(state);
+      getToken(state);
+      var node = new ObjectNode(properties);
+
+      // parse index parameters
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseNumber(state);
+  }
+
+  /**
+   * parse a number
+   * @return {Node} node
+   * @private
+   */
+  function parseNumber(state) {
+    var numberStr;
+    if (state.tokenType === TOKENTYPE.NUMBER) {
+      // this is a number
+      numberStr = state.token;
+      getToken(state);
+      var numericType = safeNumberType(numberStr, config);
+      var value = numeric(numberStr, numericType);
+      return new ConstantNode(value);
+    }
+    return parseParentheses(state);
+  }
+
+  /**
+   * parentheses
+   * @return {Node} node
+   * @private
+   */
+  function parseParentheses(state) {
+    var node;
+
+    // check if it is a parenthesized expression
+    if (state.token === '(') {
+      // parentheses (...)
+      openParams(state);
+      getToken(state);
+      node = parseAssignment(state); // start again
+
+      if (state.token !== ')') {
+        throw createSyntaxError(state, 'Parenthesis ) expected');
+      }
+      closeParams(state);
+      getToken(state);
+      node = new ParenthesisNode(node);
+      node = parseAccessors(state, node);
+      return node;
+    }
+    return parseEnd(state);
+  }
+
+  /**
+   * Evaluated when the expression is not yet ended but expected to end
+   * @return {Node} res
+   * @private
+   */
+  function parseEnd(state) {
+    if (state.token === '') {
+      // syntax error or unexpected end of expression
+      throw createSyntaxError(state, 'Unexpected end of expression');
+    } else {
+      throw createSyntaxError(state, 'Value expected');
+    }
+  }
+
+  /**
+   * Shortcut for getting the current row value (one based)
+   * Returns the line of the currently handled expression
+   * @private
+   */
+  /* TODO: implement keeping track on the row number
+  function row () {
+    return null
+  }
+  */
+
+  /**
+   * Shortcut for getting the current col value (one based)
+   * Returns the column (position) where the last state.token starts
+   * @private
+   */
+  function col(state) {
+    return state.index - state.token.length + 1;
+  }
+
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {SyntaxError} instantiated error
+   * @private
+   */
+  function createSyntaxError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  /**
+   * Create an error
+   * @param {Object} state
+   * @param {string} message
+   * @return {Error} instantiated error
+   * @private
+   */
+  function createError(state, message) {
+    var c = col(state);
+    var error = new SyntaxError(message + ' (char ' + c + ')');
+    error.char = c;
+    return error;
+  }
+
+  // Now that we can parse, automatically convert strings to Nodes by parsing
+  typed.addConversion({
+    from: 'string',
+    to: 'Node',
+    convert: parse
+  });
+  return parse;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/and.transform.js b/node_modules/mathjs/lib/esm/expression/transform/and.transform.js
new file mode 100644
index 0000000..9c80960
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/and.transform.js
@@ -0,0 +1,35 @@
+import { createAnd } from '../../function/logical/and.js';
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'and';
+var dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];
+export var createAndTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  var and = createAnd({
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  });
+  function andTransform(args, math, scope) {
+    var condition1 = args[0].compile().evaluate(scope);
+    if (!isCollection(condition1) && !and(condition1, true)) {
+      return false;
+    }
+    var condition2 = args[1].compile().evaluate(scope);
+    return and(condition1, condition2);
+  }
+  andTransform.rawArgs = true;
+  return andTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/bitAnd.transform.js b/node_modules/mathjs/lib/esm/expression/transform/bitAnd.transform.js
new file mode 100644
index 0000000..0985a33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/bitAnd.transform.js
@@ -0,0 +1,40 @@
+import { createBitAnd } from '../../function/bitwise/bitAnd.js';
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'bitAnd';
+var dependencies = ['typed', 'matrix', 'zeros', 'add', 'equalScalar', 'not', 'concat'];
+export var createBitAndTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  var bitAnd = createBitAnd({
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  });
+  function bitAndTransform(args, math, scope) {
+    var condition1 = args[0].compile().evaluate(scope);
+    if (!isCollection(condition1)) {
+      if (isNaN(condition1)) {
+        return NaN;
+      }
+      if (condition1 === 0 || condition1 === false) {
+        return 0;
+      }
+    }
+    var condition2 = args[1].compile().evaluate(scope);
+    return bitAnd(condition1, condition2);
+  }
+  bitAndTransform.rawArgs = true;
+  return bitAndTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/bitOr.transform.js b/node_modules/mathjs/lib/esm/expression/transform/bitOr.transform.js
new file mode 100644
index 0000000..9f154f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/bitOr.transform.js
@@ -0,0 +1,41 @@
+import { createBitOr } from '../../function/bitwise/bitOr.js';
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'bitOr';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+export var createBitOrTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var bitOr = createBitOr({
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  });
+  function bitOrTransform(args, math, scope) {
+    var condition1 = args[0].compile().evaluate(scope);
+    if (!isCollection(condition1)) {
+      if (isNaN(condition1)) {
+        return NaN;
+      }
+      if (condition1 === -1) {
+        return -1;
+      }
+      if (condition1 === true) {
+        return 1;
+      }
+    }
+    var condition2 = args[1].compile().evaluate(scope);
+    return bitOr(condition1, condition2);
+  }
+  bitOrTransform.rawArgs = true;
+  return bitOrTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/column.transform.js b/node_modules/mathjs/lib/esm/expression/transform/column.transform.js
new file mode 100644
index 0000000..ccfb0a3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/column.transform.js
@@ -0,0 +1,47 @@
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createColumn } from '../../function/matrix/column.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+export var createColumnTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  var column = createColumn({
+    typed,
+    Index,
+    matrix,
+    range
+  });
+
+  // @see: comment of column itself
+  return typed('column', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      }
+      try {
+        return column.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js b/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js
new file mode 100644
index 0000000..737876d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/concat.transform.js
@@ -0,0 +1,45 @@
+import { isBigNumber, isNumber } from '../../utils/is.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createConcat } from '../../function/matrix/concat.js';
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+export var createConcatTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+  var concat = createConcat({
+    typed,
+    matrix,
+    isInteger
+  });
+
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function concat
+   * from one-based to zero based
+   */
+  return typed('concat', {
+    '...any': function any(args) {
+      // change last argument from one-based to zero-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      } else if (isBigNumber(last)) {
+        args[lastIndex] = last.minus(1);
+      }
+      try {
+        return concat.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js b/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js
new file mode 100644
index 0000000..049dc14
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/cumsum.transform.js
@@ -0,0 +1,46 @@
+import { isBigNumber, isCollection, isNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createCumSum } from '../../function/statistics/cumsum.js';
+
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+export var createCumSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+  var cumsum = createCumSum({
+    typed,
+    add,
+    unaryPlus
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      // change last argument dim from one-based to zero-based
+      if (args.length === 2 && isCollection(args[0])) {
+        var dim = args[1];
+        if (isNumber(dim)) {
+          args[1] = dim - 1;
+        } else if (isBigNumber(dim)) {
+          args[1] = dim.minus(1);
+        }
+      }
+      try {
+        return cumsum.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js b/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js
new file mode 100644
index 0000000..970cf80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/diff.transform.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createDiff } from '../../function/matrix/diff.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number', 'bignumber'];
+export var createDiffTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  } = _ref;
+  var diff = createDiff({
+    typed,
+    matrix,
+    subtract,
+    number,
+    bignumber
+  });
+
+  /**
+   * Attach a transform function to math.diff
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return diff.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js b/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js
new file mode 100644
index 0000000..33e383f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/filter.transform.js
@@ -0,0 +1,56 @@
+import { createFilter } from '../../function/matrix/filter.js';
+import { factory } from '../../utils/factory.js';
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+import { createTransformCallback } from './utils/transformCallback.js';
+var name = 'filter';
+var dependencies = ['typed'];
+export var createFilterTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.filter
+   * Adds a property transform containing the transform function.
+   *
+   * This transform adds support for equations as test function for math.filter,
+   * so you can do something like 'filter([3, -2, 5], x > 0)'.
+   */
+  function filterTransform(args, math, scope) {
+    var filter = createFilter({
+      typed
+    });
+    var transformCallback = createTransformCallback({
+      typed
+    });
+    if (args.length === 0) {
+      return filter();
+    }
+    var x = args[0];
+    if (args.length === 1) {
+      return filter(x);
+    }
+    var N = args.length - 1;
+    var callback = args[N];
+    if (x) {
+      x = _compileAndEvaluate(x, scope);
+    }
+    if (callback) {
+      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = compileInlineExpression(callback, math, scope);
+      }
+    }
+    return filter(x, transformCallback(callback, N));
+  }
+  filterTransform.rawArgs = true;
+  function _compileAndEvaluate(arg, scope) {
+    return arg.compile().evaluate(scope);
+  }
+  return filterTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js b/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js
new file mode 100644
index 0000000..4934561
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/forEach.transform.js
@@ -0,0 +1,55 @@
+import { createForEach } from '../../function/matrix/forEach.js';
+import { createTransformCallback } from './utils/transformCallback.js';
+import { factory } from '../../utils/factory.js';
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+var name = 'forEach';
+var dependencies = ['typed'];
+export var createForEachTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.forEach
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  var forEach = createForEach({
+    typed
+  });
+  var transformCallback = createTransformCallback({
+    typed
+  });
+  function forEachTransform(args, math, scope) {
+    if (args.length === 0) {
+      return forEach();
+    }
+    var x = args[0];
+    if (args.length === 1) {
+      return forEach(x);
+    }
+    var N = args.length - 1;
+    var callback = args[N];
+    if (x) {
+      x = _compileAndEvaluate(x, scope);
+    }
+    if (callback) {
+      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = compileInlineExpression(callback, math, scope);
+      }
+    }
+    return forEach(x, transformCallback(callback, N));
+  }
+  forEachTransform.rawArgs = true;
+  function _compileAndEvaluate(arg, scope) {
+    return arg.compile().evaluate(scope);
+  }
+  return forEachTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/index.transform.js b/node_modules/mathjs/lib/esm/expression/transform/index.transform.js
new file mode 100644
index 0000000..4a4e6a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/index.transform.js
@@ -0,0 +1,52 @@
+import { isArray, isBigInt, isBigNumber, isMatrix, isNumber, isRange } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'index';
+var dependencies = ['Index', 'getMatrixDataType'];
+export var createIndexTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Index,
+    getMatrixDataType
+  } = _ref;
+  /**
+   * Attach a transform function to math.index
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  return function indexTransform() {
+    var args = [];
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i];
+
+      // change from one-based to zero based, convert BigNumber to number and leave Array of Booleans as is
+      if (isRange(arg)) {
+        arg.start--;
+        arg.end -= arg.step > 0 ? 0 : 2;
+      } else if (arg && arg.isSet === true) {
+        arg = arg.map(function (v) {
+          return v - 1;
+        });
+      } else if (isArray(arg) || isMatrix(arg)) {
+        if (getMatrixDataType(arg) !== 'boolean') {
+          arg = arg.map(function (v) {
+            return v - 1;
+          });
+        }
+      } else if (isNumber(arg) || isBigInt(arg)) {
+        arg--;
+      } else if (isBigNumber(arg)) {
+        arg = arg.toNumber() - 1;
+      } else if (typeof arg === 'string') {
+        // leave as is
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range');
+      }
+      args[i] = arg;
+    }
+    var res = new Index();
+    Index.apply(res, args);
+    return res;
+  };
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/map.transform.js b/node_modules/mathjs/lib/esm/expression/transform/map.transform.js
new file mode 100644
index 0000000..252a862
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/map.transform.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { isFunctionAssignmentNode, isSymbolNode } from '../../utils/is.js';
+import { createMap } from '../../function/matrix/map.js';
+import { compileInlineExpression } from './utils/compileInlineExpression.js';
+import { createTransformCallback } from './utils/transformCallback.js';
+var name = 'map';
+var dependencies = ['typed'];
+export var createMapTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Attach a transform function to math.map
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a one-based index instead of a zero-based index
+   */
+  var map = createMap({
+    typed
+  });
+  var transformCallback = createTransformCallback({
+    typed
+  });
+  function mapTransform(args, math, scope) {
+    if (args.length === 0) {
+      return map();
+    }
+    if (args.length === 1) {
+      return map(args[0]);
+    }
+    var N = args.length - 1;
+    var X = args.slice(0, N);
+    var callback = args[N];
+    X = X.map(arg => _compileAndEvaluate(arg, scope));
+    if (callback) {
+      if (isSymbolNode(callback) || isFunctionAssignmentNode(callback)) {
+        // a function pointer, like filter([3, -2, 5], myTestFunction)
+        callback = _compileAndEvaluate(callback, scope);
+      } else {
+        // an expression like filter([3, -2, 5], x > 0)
+        callback = compileInlineExpression(callback, math, scope);
+      }
+    }
+    return map(...X, transformCallback(callback, N));
+    function _compileAndEvaluate(arg, scope) {
+      return arg.compile().evaluate(scope);
+    }
+  }
+  mapTransform.rawArgs = true;
+  return mapTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/mapSlices.transform.js b/node_modules/mathjs/lib/esm/expression/transform/mapSlices.transform.js
new file mode 100644
index 0000000..acd41dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/mapSlices.transform.js
@@ -0,0 +1,47 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+import { errorTransform } from './utils/errorTransform.js';
+import { factory } from '../../utils/factory.js';
+import { createMapSlices } from '../../function/matrix/mapSlices.js';
+import { isBigNumber, isNumber } from '../../utils/is.js';
+var name = 'mapSlices';
+var dependencies = ['typed', 'isInteger'];
+
+/**
+ * Attach a transform function to math.mapSlices
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function mapSlices
+ * from one-based to zero based
+ */
+export var createMapSlicesTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+  var mapSlices = createMapSlices({
+    typed,
+    isInteger
+  });
+
+  // @see: comment of concat itself
+  return typed('mapSlices', {
+    '...any': function any(args) {
+      // change dim from one-based to zero-based
+      var dim = args[1];
+      if (isNumber(dim)) {
+        args[1] = dim - 1;
+      } else if (isBigNumber(dim)) {
+        args[1] = dim.minus(1);
+      }
+      try {
+        return mapSlices.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, _objectSpread({
+  isTransformFunction: true
+}, createMapSlices.meta));
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/max.transform.js b/node_modules/mathjs/lib/esm/expression/transform/max.transform.js
new file mode 100644
index 0000000..a3c66f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/max.transform.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMax } from '../../function/statistics/max.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];
+export var createMaxTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  } = _ref;
+  var max = createMax({
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  });
+
+  /**
+   * Attach a transform function to math.max
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function max
+   * from one-based to zero based
+   */
+  return typed('max', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return max.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js b/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js
new file mode 100644
index 0000000..8d080f7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/mean.transform.js
@@ -0,0 +1,38 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMean } from '../../function/statistics/mean.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+export var createMeanTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide
+  } = _ref;
+  var mean = createMean({
+    typed,
+    add,
+    divide
+  });
+
+  /**
+   * Attach a transform function to math.mean
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function mean
+   * from one-based to zero based
+   */
+  return typed('mean', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return mean.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/min.transform.js b/node_modules/mathjs/lib/esm/expression/transform/min.transform.js
new file mode 100644
index 0000000..67f85d6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/min.transform.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createMin } from '../../function/statistics/min.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];
+export var createMinTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  } = _ref;
+  var min = createMin({
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  });
+
+  /**
+   * Attach a transform function to math.min
+   * Adds a property transform containing the transform function.
+   *
+   * This transform changed the last `dim` parameter of function min
+   * from one-based to zero based
+   */
+  return typed('min', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return min.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/nullish.transform.js b/node_modules/mathjs/lib/esm/expression/transform/nullish.transform.js
new file mode 100644
index 0000000..70f91ca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/nullish.transform.js
@@ -0,0 +1,37 @@
+import { createNullish } from '../../function/logical/nullish.js';
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'nullish';
+var dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];
+export var createNullishTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  } = _ref;
+  var nullish = createNullish({
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  });
+  function nullishTransform(args, math, scope) {
+    var left = args[0].compile().evaluate(scope);
+
+    // If left is not a collection and not nullish, short-circuit and return it
+    if (!isCollection(left) && left != null && left !== undefined) {
+      return left;
+    }
+
+    // Otherwise evaluate right and apply full nullish semantics (incl. element-wise)
+    var right = args[1].compile().evaluate(scope);
+    return nullish(left, right);
+  }
+  nullishTransform.rawArgs = true;
+  return nullishTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/or.transform.js b/node_modules/mathjs/lib/esm/expression/transform/or.transform.js
new file mode 100644
index 0000000..1b1920e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/or.transform.js
@@ -0,0 +1,33 @@
+import { createOr } from '../../function/logical/or.js';
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'or';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+export var createOrTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var or = createOr({
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  });
+  function orTransform(args, math, scope) {
+    var condition1 = args[0].compile().evaluate(scope);
+    if (!isCollection(condition1) && or(condition1, false)) {
+      return true;
+    }
+    var condition2 = args[1].compile().evaluate(scope);
+    return or(condition1, condition2);
+  }
+  orTransform.rawArgs = true;
+  return orTransform;
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/print.transform.js b/node_modules/mathjs/lib/esm/expression/transform/print.transform.js
new file mode 100644
index 0000000..645000d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/print.transform.js
@@ -0,0 +1,42 @@
+import { createPrint } from '../../function/string/print.js';
+import { factory } from '../../utils/factory.js';
+import { printTemplate } from '../../utils/print.js';
+var name = 'print';
+var dependencies = ['typed', 'matrix', 'zeros', 'add'];
+export var createPrintTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  var print = createPrint({
+    typed,
+    matrix,
+    zeros,
+    add
+  });
+  return typed(name, {
+    'string, Object | Array': function string_Object__Array(template, values) {
+      return print(_convertTemplateToZeroBasedIndex(template), values);
+    },
+    'string, Object | Array, number | Object': function string_Object__Array_number__Object(template, values, options) {
+      return print(_convertTemplateToZeroBasedIndex(template), values, options);
+    }
+  });
+  function _convertTemplateToZeroBasedIndex(template) {
+    return template.replace(printTemplate, x => {
+      var parts = x.slice(1).split('.');
+      var result = parts.map(function (part) {
+        if (!isNaN(part) && part.length > 0) {
+          return parseInt(part) - 1;
+        } else {
+          return part;
+        }
+      });
+      return '$' + result.join('.');
+    });
+  }
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/quantileSeq.transform.js b/node_modules/mathjs/lib/esm/expression/transform/quantileSeq.transform.js
new file mode 100644
index 0000000..8e5c0b9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/quantileSeq.transform.js
@@ -0,0 +1,61 @@
+import { factory } from '../../utils/factory.js';
+import { createQuantileSeq } from '../../function/statistics/quantileSeq.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'quantileSeq';
+var dependencies = ['typed', 'bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];
+
+/**
+ * Attach a transform function to math.quantileSeq
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+export var createQuantileSeqTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  } = _ref;
+  var quantileSeq = createQuantileSeq({
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  });
+  return typed('quantileSeq', {
+    'Array | Matrix, number | BigNumber': quantileSeq,
+    'Array | Matrix, number | BigNumber, number': (arr, prob, dim) => quantileSeq(arr, prob, dimToZeroBase(dim)),
+    'Array | Matrix, number | BigNumber, boolean': quantileSeq,
+    'Array | Matrix, number | BigNumber, boolean, number': (arr, prob, sorted, dim) => quantileSeq(arr, prob, sorted, dimToZeroBase(dim)),
+    'Array | Matrix, Array | Matrix': quantileSeq,
+    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => quantileSeq(data, prob, dimToZeroBase(dim)),
+    'Array | Matrix, Array | Matrix, boolean': quantileSeq,
+    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => quantileSeq(data, prob, sorted, dimToZeroBase(dim))
+  });
+  function dimToZeroBase(dim) {
+    // TODO: find a better way, maybe lastDimToZeroBase could apply to more cases.
+    return lastDimToZeroBase([[], dim])[1];
+  }
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/range.transform.js b/node_modules/mathjs/lib/esm/expression/transform/range.transform.js
new file mode 100644
index 0000000..b7f3f78
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/range.transform.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { createRange } from '../../function/matrix/range.js';
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];
+export var createRangeTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    equal,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  } = _ref;
+  var range = createRange({
+    typed,
+    config,
+    matrix,
+    bignumber,
+    equal,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  });
+
+  /**
+   * Attach a transform function to math.range
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed('range', {
+    '...any': function any(args) {
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+      if (typeof last !== 'boolean') {
+        // append a parameter includeEnd=true
+        args.push(true);
+      }
+      return range.apply(null, args);
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/row.transform.js b/node_modules/mathjs/lib/esm/expression/transform/row.transform.js
new file mode 100644
index 0000000..2bb7084
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/row.transform.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { createRow } from '../../function/matrix/row.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+
+/**
+ * Attach a transform function to matrix.column
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `index` parameter of function column
+ * from zero-based to one-based
+ */
+export var createRowTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  var row = createRow({
+    typed,
+    Index,
+    matrix,
+    range
+  });
+
+  // @see: comment of row itself
+  return typed('row', {
+    '...any': function any(args) {
+      // change last argument from zero-based to one-based
+      var lastIndex = args.length - 1;
+      var last = args[lastIndex];
+      if (isNumber(last)) {
+        args[lastIndex] = last - 1;
+      }
+      try {
+        return row.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/std.transform.js b/node_modules/mathjs/lib/esm/expression/transform/std.transform.js
new file mode 100644
index 0000000..5e83737
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/std.transform.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+import { createStd } from '../../function/statistics/std.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'std';
+var dependencies = ['typed', 'map', 'sqrt', 'variance'];
+
+/**
+ * Attach a transform function to math.std
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function std
+ * from one-based to zero based
+ */
+export var createStdTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    map,
+    sqrt,
+    variance
+  } = _ref;
+  var std = createStd({
+    typed,
+    map,
+    sqrt,
+    variance
+  });
+  return typed('std', {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return std.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js b/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js
new file mode 100644
index 0000000..23f29cf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/subset.transform.js
@@ -0,0 +1,37 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createSubset } from '../../function/matrix/subset.js';
+var name = 'subset';
+var dependencies = ['typed', 'matrix', 'zeros', 'add'];
+export var createSubsetTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  var subset = createSubset({
+    typed,
+    matrix,
+    zeros,
+    add
+  });
+
+  /**
+   * Attach a transform function to math.subset
+   * Adds a property transform containing the transform function.
+   *
+   * This transform creates a range which includes the end value
+   */
+  return typed('subset', {
+    '...any': function any(args) {
+      try {
+        return subset.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js b/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js
new file mode 100644
index 0000000..d5a27f8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/sum.transform.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createSum } from '../../function/statistics/sum.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+
+/**
+ * Attach a transform function to math.sum
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the last `dim` parameter of function sum
+ * from one-based to zero based
+ */
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+export var createSumTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+  var sum = createSum({
+    typed,
+    config,
+    add,
+    numeric
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return sum.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js b/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js
new file mode 100644
index 0000000..96f7c32
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/compileInlineExpression.js
@@ -0,0 +1,30 @@
+import { isSymbolNode } from '../../../utils/is.js';
+import { PartitionedMap } from '../../../utils/map.js';
+
+/**
+ * Compile an inline expression like "x > 0"
+ * @param {Node} expression
+ * @param {Object} math
+ * @param {Map} scope
+ * @return {function} Returns a function with one argument which fills in the
+ *                    undefined variable (like "x") and evaluates the expression
+ */
+export function compileInlineExpression(expression, math, scope) {
+  // find an undefined symbol
+  var symbol = expression.filter(function (node) {
+    return isSymbolNode(node) && !(node.name in math) && !scope.has(node.name);
+  })[0];
+  if (!symbol) {
+    throw new Error('No undefined variable found in inline expression "' + expression + '"');
+  }
+
+  // create a test function for this equation
+  var name = symbol.name; // variable name
+  var argsScope = new Map();
+  var subScope = new PartitionedMap(scope, argsScope, new Set([name]));
+  var eq = expression.compile();
+  return function inlineExpression(x) {
+    argsScope.set(name, x);
+    return eq.evaluate(subScope);
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/dimToZeroBase.js b/node_modules/mathjs/lib/esm/expression/transform/utils/dimToZeroBase.js
new file mode 100644
index 0000000..6c17d76
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/dimToZeroBase.js
@@ -0,0 +1,16 @@
+import { isNumber, isBigNumber } from '../../../utils/is.js';
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+export function dimToZeroBase(dim) {
+  if (isNumber(dim)) {
+    return dim - 1;
+  } else if (isBigNumber(dim)) {
+    return dim.minus(1);
+  } else {
+    return dim;
+  }
+}
+export function isNumberOrBigNumber(n) {
+  return isNumber(n) || isBigNumber(n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js b/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js
new file mode 100644
index 0000000..b64f7ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/errorTransform.js
@@ -0,0 +1,13 @@
+import { IndexError } from '../../../error/IndexError.js';
+
+/**
+ * Transform zero-based indices to one-based indices in errors
+ * @param {Error} err
+ * @returns {Error | IndexError} Returns the transformed error
+ */
+export function errorTransform(err) {
+  if (err && err.isIndexError) {
+    return new IndexError(err.index + 1, err.min + 1, err.max !== undefined ? err.max + 1 : undefined);
+  }
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js b/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js
new file mode 100644
index 0000000..d2d939c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/lastDimToZeroBase.js
@@ -0,0 +1,15 @@
+import { isCollection } from '../../../utils/is.js';
+import { dimToZeroBase, isNumberOrBigNumber } from './dimToZeroBase.js';
+/**
+ * Change last argument dim from one-based to zero-based.
+ */
+export function lastDimToZeroBase(args) {
+  if (args.length === 2 && isCollection(args[0])) {
+    args = args.slice();
+    var dim = args[1];
+    if (isNumberOrBigNumber(dim)) {
+      args[1] = dimToZeroBase(dim);
+    }
+  }
+  return args;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/utils/transformCallback.js b/node_modules/mathjs/lib/esm/expression/transform/utils/transformCallback.js
new file mode 100644
index 0000000..090a0c2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/utils/transformCallback.js
@@ -0,0 +1,95 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'transformCallback';
+var dependencies = ['typed'];
+export var createTransformCallback = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+         * Transforms the given callback function based on its type and number of arrays.
+         *
+         * @param {Function} callback - The callback function to transform.
+         * @param {number} numberOfArrays - The number of arrays to pass to the callback function.
+         * @returns {*} - The transformed callback function.
+         */
+  return function (callback, numberOfArrays) {
+    if (typed.isTypedFunction(callback)) {
+      return _transformTypedCallbackFunction(callback, numberOfArrays);
+    } else {
+      return _transformCallbackFunction(callback, callback.length, numberOfArrays);
+    }
+  };
+
+  /**
+       * Transforms the given typed callback function based on the number of arrays.
+       *
+       * @param {Function} typedFunction - The typed callback function to transform.
+       * @param {number} numberOfArrays - The number of arrays to pass to the callback function.
+       * @returns {*} - The transformed callback function.
+       */
+  function _transformTypedCallbackFunction(typedFunction, numberOfArrays) {
+    var signatures = Object.fromEntries(Object.entries(typedFunction.signatures).map(_ref2 => {
+      var [signature, callbackFunction] = _ref2;
+      var numberOfCallbackInputs = signature.split(',').length;
+      if (typed.isTypedFunction(callbackFunction)) {
+        return [signature, _transformTypedCallbackFunction(callbackFunction, numberOfArrays)];
+      } else {
+        return [signature, _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays)];
+      }
+    }));
+    if (typeof typedFunction.name === 'string') {
+      return typed(typedFunction.name, signatures);
+    } else {
+      return typed(signatures);
+    }
+  }
+});
+
+/**
+     * Transforms the callback function based on the number of callback inputs and arrays.
+     * There are three cases:
+     * 1. The callback function has N arguments.
+     * 2. The callback function has N+1 arguments.
+     * 3. The callback function has 2N+1 arguments.
+     *
+     * @param {Function} callbackFunction - The callback function to transform.
+     * @param {number} numberOfCallbackInputs - The number of callback inputs.
+     * @param {number} numberOfArrays - The number of arrays.
+     * @returns {Function} The transformed callback function.
+     */
+function _transformCallbackFunction(callbackFunction, numberOfCallbackInputs, numberOfArrays) {
+  if (numberOfCallbackInputs === numberOfArrays) {
+    return callbackFunction;
+  } else if (numberOfCallbackInputs === numberOfArrays + 1) {
+    return function () {
+      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+        args[_key] = arguments[_key];
+      }
+      var vals = args.slice(0, numberOfArrays);
+      var idx = _transformDims(args[numberOfArrays]);
+      return callbackFunction(...vals, idx);
+    };
+  } else if (numberOfCallbackInputs > numberOfArrays + 1) {
+    return function () {
+      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+        args[_key2] = arguments[_key2];
+      }
+      var vals = args.slice(0, numberOfArrays);
+      var idx = _transformDims(args[numberOfArrays]);
+      var rest = args.slice(numberOfArrays + 1);
+      return callbackFunction(...vals, idx, ...rest);
+    };
+  } else {
+    return callbackFunction;
+  }
+}
+
+/**
+   * Transforms the dimensions by adding 1 to each dimension.
+   *
+   * @param {Array} dims - The dimensions to transform.
+   * @returns {Array} The transformed dimensions.
+   */
+function _transformDims(dims) {
+  return dims.map(dim => dim + 1);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js b/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js
new file mode 100644
index 0000000..c53c553
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/expression/transform/variance.transform.js
@@ -0,0 +1,46 @@
+import { factory } from '../../utils/factory.js';
+import { errorTransform } from './utils/errorTransform.js';
+import { createVariance } from '../../function/statistics/variance.js';
+import { lastDimToZeroBase } from './utils/lastDimToZeroBase.js';
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];
+
+/**
+ * Attach a transform function to math.var
+ * Adds a property transform containing the transform function.
+ *
+ * This transform changed the `dim` parameter of function var
+ * from one-based to zero based
+ */
+export var createVarianceTransform = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  } = _ref;
+  var variance = createVariance({
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  });
+  return typed(name, {
+    '...any': function any(args) {
+      args = lastDimToZeroBase(args);
+      try {
+        return variance.apply(null, args);
+      } catch (err) {
+        throw errorTransform(err);
+      }
+    }
+  });
+}, {
+  isTransformFunction: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/factoriesAny.js b/node_modules/mathjs/lib/esm/factoriesAny.js
new file mode 100644
index 0000000..3f5253c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/factoriesAny.js
@@ -0,0 +1,300 @@
+export { createTyped } from './core/function/typed.js';
+export { createResultSet } from './type/resultset/ResultSet.js';
+export { createBigNumberClass } from './type/bignumber/BigNumber.js';
+export { createComplexClass } from './type/complex/Complex.js';
+export { createFractionClass } from './type/fraction/Fraction.js';
+export { createRangeClass } from './type/matrix/Range.js';
+export { createMatrixClass } from './type/matrix/Matrix.js';
+export { createDenseMatrixClass } from './type/matrix/DenseMatrix.js';
+export { createClone } from './function/utils/clone.js';
+export { createIsInteger } from './function/utils/isInteger.js';
+export { createIsNegative } from './function/utils/isNegative.js';
+export { createIsNumeric } from './function/utils/isNumeric.js';
+export { createHasNumericValue } from './function/utils/hasNumericValue.js';
+export { createIsPositive } from './function/utils/isPositive.js';
+export { createIsZero } from './function/utils/isZero.js';
+export { createIsNaN } from './function/utils/isNaN.js';
+export { createTypeOf } from './function/utils/typeOf.js';
+export { createEqualScalar } from './function/relational/equalScalar.js';
+export { createSparseMatrixClass } from './type/matrix/SparseMatrix.js';
+export { createNumber } from './type/number.js';
+export { createBigint } from './type/bigint.js';
+export { createString } from './type/string.js';
+export { createBoolean } from './type/boolean.js';
+export { createBignumber } from './type/bignumber/function/bignumber.js';
+export { createComplex } from './type/complex/function/complex.js';
+export { createFraction } from './type/fraction/function/fraction.js';
+export { createMatrix } from './type/matrix/function/matrix.js';
+export { createMatrixFromFunction } from './function/matrix/matrixFromFunction.js';
+export { createMatrixFromRows } from './function/matrix/matrixFromRows.js';
+export { createMatrixFromColumns } from './function/matrix/matrixFromColumns.js';
+export { createSplitUnit } from './type/unit/function/splitUnit.js';
+export { createUnaryMinus } from './function/arithmetic/unaryMinus.js';
+export { createUnaryPlus } from './function/arithmetic/unaryPlus.js';
+export { createAbs } from './function/arithmetic/abs.js';
+export { createMapSlices } from './function/matrix/mapSlices.js';
+export { createAddScalar } from './function/arithmetic/addScalar.js';
+export { createSubtractScalar } from './function/arithmetic/subtractScalar.js';
+export { createCbrt } from './function/arithmetic/cbrt.js';
+export { createCeil } from './function/arithmetic/ceil.js';
+export { createCube } from './function/arithmetic/cube.js';
+export { createExp } from './function/arithmetic/exp.js';
+export { createExpm1 } from './function/arithmetic/expm1.js';
+export { createFix } from './function/arithmetic/fix.js';
+export { createFloor } from './function/arithmetic/floor.js';
+export { createGcd } from './function/arithmetic/gcd.js';
+export { createLcm } from './function/arithmetic/lcm.js';
+export { createLog10 } from './function/arithmetic/log10.js';
+export { createLog2 } from './function/arithmetic/log2.js';
+export { createMod } from './function/arithmetic/mod.js';
+export { createMultiplyScalar } from './function/arithmetic/multiplyScalar.js';
+export { createMultiply } from './function/arithmetic/multiply.js';
+export { createNthRoot } from './function/arithmetic/nthRoot.js';
+export { createSign } from './function/arithmetic/sign.js';
+export { createSqrt } from './function/arithmetic/sqrt.js';
+export { createSquare } from './function/arithmetic/square.js';
+export { createSubtract } from './function/arithmetic/subtract.js';
+export { createXgcd } from './function/arithmetic/xgcd.js';
+export { createInvmod } from './function/arithmetic/invmod.js';
+export { createDotMultiply } from './function/arithmetic/dotMultiply.js';
+export { createBitAnd } from './function/bitwise/bitAnd.js';
+export { createBitNot } from './function/bitwise/bitNot.js';
+export { createBitOr } from './function/bitwise/bitOr.js';
+export { createBitXor } from './function/bitwise/bitXor.js';
+export { createArg } from './function/complex/arg.js';
+export { createConj } from './function/complex/conj.js';
+export { createIm } from './function/complex/im.js';
+export { createRe } from './function/complex/re.js';
+export { createNot } from './function/logical/not.js';
+export { createNullish } from './function/logical/nullish.js';
+export { createOr } from './function/logical/or.js';
+export { createXor } from './function/logical/xor.js';
+export { createConcat } from './function/matrix/concat.js';
+export { createColumn } from './function/matrix/column.js';
+export { createCount } from './function/matrix/count.js';
+export { createCross } from './function/matrix/cross.js';
+export { createDiag } from './function/matrix/diag.js';
+export { createFilter } from './function/matrix/filter.js';
+export { createFlatten } from './function/matrix/flatten.js';
+export { createForEach } from './function/matrix/forEach.js';
+export { createGetMatrixDataType } from './function/matrix/getMatrixDataType.js';
+export { createIdentity } from './function/matrix/identity.js';
+export { createKron } from './function/matrix/kron.js';
+export { createMap } from './function/matrix/map.js';
+export { createDiff } from './function/matrix/diff.js';
+export { createOnes } from './function/matrix/ones.js';
+export { createRange } from './function/matrix/range.js';
+export { createReshape } from './function/matrix/reshape.js';
+export { createResize } from './function/matrix/resize.js';
+export { createRotate } from './function/matrix/rotate.js';
+export { createRotationMatrix } from './function/matrix/rotationMatrix.js';
+export { createRow } from './function/matrix/row.js';
+export { createSize } from './function/matrix/size.js';
+export { createSqueeze } from './function/matrix/squeeze.js';
+export { createSubset } from './function/matrix/subset.js';
+export { createTranspose } from './function/matrix/transpose.js';
+export { createCtranspose } from './function/matrix/ctranspose.js';
+export { createZeros } from './function/matrix/zeros.js';
+export { createFft } from './function/matrix/fft.js';
+export { createIfft } from './function/matrix/ifft.js';
+export { createSolveODE } from './function/numeric/solveODE.js';
+export { createErf } from './function/special/erf.js';
+export { createZeta } from './function/special/zeta.js';
+export { createMode } from './function/statistics/mode.js';
+export { createProd } from './function/statistics/prod.js';
+export { createFormat } from './function/string/format.js';
+export { createBin } from './function/string/bin.js';
+export { createOct } from './function/string/oct.js';
+export { createHex } from './function/string/hex.js';
+export { createPrint } from './function/string/print.js';
+export { createTo } from './function/unit/to.js';
+export { createToBest } from './function/unit/toBest.js';
+export { createIsPrime } from './function/utils/isPrime.js';
+export { createNumeric } from './function/utils/numeric.js';
+export { createDivideScalar } from './function/arithmetic/divideScalar.js';
+export { createPow } from './function/arithmetic/pow.js';
+export { createRound } from './function/arithmetic/round.js';
+export { createLog } from './function/arithmetic/log.js';
+export { createLog1p } from './function/arithmetic/log1p.js';
+export { createNthRoots } from './function/arithmetic/nthRoots.js';
+export { createDotPow } from './function/arithmetic/dotPow.js';
+export { createDotDivide } from './function/arithmetic/dotDivide.js';
+export { createLsolve } from './function/algebra/solver/lsolve.js';
+export { createUsolve } from './function/algebra/solver/usolve.js';
+export { createLsolveAll } from './function/algebra/solver/lsolveAll.js';
+export { createUsolveAll } from './function/algebra/solver/usolveAll.js';
+export { createLeftShift } from './function/bitwise/leftShift.js';
+export { createRightArithShift } from './function/bitwise/rightArithShift.js';
+export { createRightLogShift } from './function/bitwise/rightLogShift.js';
+export { createAnd } from './function/logical/and.js';
+export { createCompare } from './function/relational/compare.js';
+export { createCompareNatural } from './function/relational/compareNatural.js';
+export { createCompareText } from './function/relational/compareText.js';
+export { createEqual } from './function/relational/equal.js';
+export { createEqualText } from './function/relational/equalText.js';
+export { createSmaller } from './function/relational/smaller.js';
+export { createSmallerEq } from './function/relational/smallerEq.js';
+export { createLarger } from './function/relational/larger.js';
+export { createLargerEq } from './function/relational/largerEq.js';
+export { createDeepEqual } from './function/relational/deepEqual.js';
+export { createUnequal } from './function/relational/unequal.js';
+export { createPartitionSelect } from './function/matrix/partitionSelect.js';
+export { createSort } from './function/matrix/sort.js';
+export { createMax } from './function/statistics/max.js';
+export { createMin } from './function/statistics/min.js';
+export { createImmutableDenseMatrixClass } from './type/matrix/ImmutableDenseMatrix.js';
+export { createIndexClass } from './type/matrix/MatrixIndex.js';
+export { createFibonacciHeapClass } from './type/matrix/FibonacciHeap.js';
+export { createSpaClass } from './type/matrix/Spa.js';
+export { createUnitClass } from './type/unit/Unit.js';
+export { createUnitFunction } from './type/unit/function/unit.js';
+export { createSparse } from './type/matrix/function/sparse.js';
+export { createCreateUnit } from './type/unit/function/createUnit.js';
+export { createAcos } from './function/trigonometry/acos.js';
+export { createAcosh } from './function/trigonometry/acosh.js';
+export { createAcot } from './function/trigonometry/acot.js';
+export { createAcoth } from './function/trigonometry/acoth.js';
+export { createAcsc } from './function/trigonometry/acsc.js';
+export { createAcsch } from './function/trigonometry/acsch.js';
+export { createAsec } from './function/trigonometry/asec.js';
+export { createAsech } from './function/trigonometry/asech.js';
+export { createAsin } from './function/trigonometry/asin.js';
+export { createAsinh } from './function/trigonometry/asinh.js';
+export { createAtan } from './function/trigonometry/atan.js';
+export { createAtan2 } from './function/trigonometry/atan2.js';
+export { createAtanh } from './function/trigonometry/atanh.js';
+export { createCos } from './function/trigonometry/cos.js';
+export { createCosh } from './function/trigonometry/cosh.js';
+export { createCot } from './function/trigonometry/cot.js';
+export { createCoth } from './function/trigonometry/coth.js';
+export { createCsc } from './function/trigonometry/csc.js';
+export { createCsch } from './function/trigonometry/csch.js';
+export { createSec } from './function/trigonometry/sec.js';
+export { createSech } from './function/trigonometry/sech.js';
+export { createSin } from './function/trigonometry/sin.js';
+export { createSinh } from './function/trigonometry/sinh.js';
+export { createTan } from './function/trigonometry/tan.js';
+export { createTanh } from './function/trigonometry/tanh.js';
+export { createSetCartesian } from './function/set/setCartesian.js';
+export { createSetDifference } from './function/set/setDifference.js';
+export { createSetDistinct } from './function/set/setDistinct.js';
+export { createSetIntersect } from './function/set/setIntersect.js';
+export { createSetIsSubset } from './function/set/setIsSubset.js';
+export { createSetMultiplicity } from './function/set/setMultiplicity.js';
+export { createSetPowerset } from './function/set/setPowerset.js';
+export { createSetSize } from './function/set/setSize.js';
+export { createSetSymDifference } from './function/set/setSymDifference.js';
+export { createSetUnion } from './function/set/setUnion.js';
+export { createAdd } from './function/arithmetic/add.js';
+export { createHypot } from './function/arithmetic/hypot.js';
+export { createNorm } from './function/arithmetic/norm.js';
+export { createDot } from './function/matrix/dot.js';
+export { createTrace } from './function/matrix/trace.js';
+export { createIndex } from './type/matrix/function/index.js';
+export { createNode } from './expression/node/Node.js';
+export { createAccessorNode } from './expression/node/AccessorNode.js';
+export { createArrayNode } from './expression/node/ArrayNode.js';
+export { createAssignmentNode } from './expression/node/AssignmentNode.js';
+export { createBlockNode } from './expression/node/BlockNode.js';
+export { createConditionalNode } from './expression/node/ConditionalNode.js';
+export { createConstantNode } from './expression/node/ConstantNode.js';
+export { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';
+export { createIndexNode } from './expression/node/IndexNode.js';
+export { createObjectNode } from './expression/node/ObjectNode.js';
+export { createOperatorNode } from './expression/node/OperatorNode.js';
+export { createParenthesisNode } from './expression/node/ParenthesisNode.js';
+export { createRangeNode } from './expression/node/RangeNode.js';
+export { createRelationalNode } from './expression/node/RelationalNode.js';
+export { createSymbolNode } from './expression/node/SymbolNode.js';
+export { createFunctionNode } from './expression/node/FunctionNode.js';
+export { createParse } from './expression/parse.js';
+export { createCompile } from './expression/function/compile.js';
+export { createEvaluate } from './expression/function/evaluate.js';
+export { createParserClass } from './expression/Parser.js';
+export { createParser } from './expression/function/parser.js';
+export { createLup } from './function/algebra/decomposition/lup.js';
+export { createQr } from './function/algebra/decomposition/qr.js';
+export { createSlu } from './function/algebra/decomposition/slu.js';
+export { createLusolve } from './function/algebra/solver/lusolve.js';
+export { createPolynomialRoot } from './function/algebra/polynomialRoot.js';
+export { createHelpClass } from './expression/Help.js';
+export { createChainClass } from './type/chain/Chain.js';
+export { createHelp } from './expression/function/help.js';
+export { createChain } from './type/chain/function/chain.js';
+export { createDet } from './function/matrix/det.js';
+export { createInv } from './function/matrix/inv.js';
+export { createPinv } from './function/matrix/pinv.js';
+export { createEigs } from './function/matrix/eigs.js';
+export { createExpm } from './function/matrix/expm.js';
+export { createSqrtm } from './function/matrix/sqrtm.js';
+export { createSylvester } from './function/algebra/sylvester.js';
+export { createSchur } from './function/algebra/decomposition/schur.js';
+export { createLyap } from './function/algebra/lyap.js';
+export { createDivide } from './function/arithmetic/divide.js';
+export { createDistance } from './function/geometry/distance.js';
+export { createIntersect } from './function/geometry/intersect.js';
+export { createSum } from './function/statistics/sum.js';
+export { createCumSum } from './function/statistics/cumsum.js';
+export { createMean } from './function/statistics/mean.js';
+export { createMedian } from './function/statistics/median.js';
+export { createMad } from './function/statistics/mad.js';
+export { createVariance } from './function/statistics/variance.js';
+export { createQuantileSeq } from './function/statistics/quantileSeq.js';
+export { createStd } from './function/statistics/std.js';
+export { createCorr } from './function/statistics/corr.js';
+export { createCombinations } from './function/probability/combinations.js';
+export { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';
+export { createGamma } from './function/probability/gamma.js';
+export { createLgamma } from './function/probability/lgamma.js';
+export { createFactorial } from './function/probability/factorial.js';
+export { createKldivergence } from './function/probability/kldivergence.js';
+export { createMultinomial } from './function/probability/multinomial.js';
+export { createPermutations } from './function/probability/permutations.js';
+export { createPickRandom } from './function/probability/pickRandom.js';
+export { createRandom } from './function/probability/random.js';
+export { createRandomInt } from './function/probability/randomInt.js';
+export { createStirlingS2 } from './function/combinatorics/stirlingS2.js';
+export { createBellNumbers } from './function/combinatorics/bellNumbers.js';
+export { createCatalan } from './function/combinatorics/catalan.js';
+export { createComposition } from './function/combinatorics/composition.js';
+export { createLeafCount } from './function/algebra/leafCount.js';
+export { createSimplify } from './function/algebra/simplify.js';
+export { createSimplifyConstant } from './function/algebra/simplifyConstant.js';
+export { createSimplifyCore } from './function/algebra/simplifyCore.js';
+export { createResolve } from './function/algebra/resolve.js';
+export { createSymbolicEqual } from './function/algebra/symbolicEqual.js';
+export { createDerivative } from './function/algebra/derivative.js';
+export { createRationalize } from './function/algebra/rationalize.js';
+export { createZpk2tf } from './function/signal/zpk2tf.js';
+export { createFreqz } from './function/signal/freqz.js';
+export { createReviver } from './json/reviver.js';
+export { createReplacer } from './json/replacer.js';
+export { createE, createUppercaseE, createFalse, createI, createInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2,
+// eslint-disable-line camelcase
+createSQRT2, createTau, createTrue, createVersion } from './constants.js';
+export { createAtomicMass, createAvogadro, createBohrMagneton, createBohrRadius, createBoltzmann, createClassicalElectronRadius, createConductanceQuantum, createCoulomb, createCoulombConstant, createDeuteronMass, createEfimovFactor, createElectricConstant, createElectronMass, createElementaryCharge, createFaraday, createFermiCoupling, createFineStructure, createFirstRadiation, createGasConstant, createGravitationConstant, createGravity, createHartreeEnergy, createInverseConductanceQuantum, createKlitzing, createLoschmidt, createMagneticConstant, createMagneticFluxQuantum, createMolarMass, createMolarMassC12, createMolarPlanckConstant, createMolarVolume, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckConstant, createPlanckLength, createPlanckMass, createPlanckTemperature, createPlanckTime, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSackurTetrode, createSecondRadiation, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createVacuumImpedance, createWeakMixingAngle, createWienDisplacement } from './type/unit/physicalConstants.js';
+export { createMapSlicesTransform } from './expression/transform/mapSlices.transform.js';
+export { createColumnTransform } from './expression/transform/column.transform.js';
+export { createFilterTransform } from './expression/transform/filter.transform.js';
+export { createForEachTransform } from './expression/transform/forEach.transform.js';
+export { createIndexTransform } from './expression/transform/index.transform.js';
+export { createMapTransform } from './expression/transform/map.transform.js';
+export { createMaxTransform } from './expression/transform/max.transform.js';
+export { createMeanTransform } from './expression/transform/mean.transform.js';
+export { createMinTransform } from './expression/transform/min.transform.js';
+export { createRangeTransform } from './expression/transform/range.transform.js';
+export { createRowTransform } from './expression/transform/row.transform.js';
+export { createSubsetTransform } from './expression/transform/subset.transform.js';
+export { createConcatTransform } from './expression/transform/concat.transform.js';
+export { createDiffTransform } from './expression/transform/diff.transform.js';
+export { createStdTransform } from './expression/transform/std.transform.js';
+export { createSumTransform } from './expression/transform/sum.transform.js';
+export { createQuantileSeqTransform } from './expression/transform/quantileSeq.transform.js';
+export { createCumSumTransform } from './expression/transform/cumsum.transform.js';
+export { createVarianceTransform } from './expression/transform/variance.transform.js';
+export { createPrintTransform } from './expression/transform/print.transform.js';
+export { createAndTransform } from './expression/transform/and.transform.js';
+export { createOrTransform } from './expression/transform/or.transform.js';
+export { createNullishTransform } from './expression/transform/nullish.transform.js';
+export { createBitAndTransform } from './expression/transform/bitAnd.transform.js';
+export { createBitOrTransform } from './expression/transform/bitOr.transform.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/factoriesNumber.js b/node_modules/mathjs/lib/esm/factoriesNumber.js
new file mode 100644
index 0000000..6365ed1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/factoriesNumber.js
@@ -0,0 +1,266 @@
+import { absNumber, acoshNumber, acosNumber, acothNumber, acotNumber, acschNumber, acscNumber, addNumber, andNumber, asechNumber, asecNumber, asinhNumber, asinNumber, atan2Number, atanhNumber, atanNumber, bitAndNumber, bitNotNumber, bitOrNumber, bitXorNumber, cbrtNumber, combinationsNumber, coshNumber, cosNumber, cothNumber, cotNumber, cschNumber, cscNumber, cubeNumber, divideNumber, expm1Number, expNumber, gammaNumber, gcdNumber, isIntegerNumber, isNaNNumber, isNegativeNumber, isPositiveNumber, isZeroNumber, lcmNumber, leftShiftNumber, lgammaNumber, log10Number, log1pNumber, log2Number, logNumber, modNumber, multiplyNumber, normNumber, notNumber, nthRootNumber, orNumber, powNumber, rightArithShiftNumber, rightLogShiftNumber, roundNumber, sechNumber, secNumber, signNumber, sinhNumber, sinNumber, sqrtNumber, squareNumber, subtractNumber, tanhNumber, tanNumber, unaryMinusNumber, unaryPlusNumber, xgcdNumber, xorNumber } from './plain/number/index.js';
+import { factory } from './utils/factory.js';
+import { noIndex, noMatrix, noSubset } from './utils/noop.js';
+
+// ----------------------------------------------------------------------------
+// classes and functions
+
+// core
+export { createTyped } from './core/function/typed.js';
+
+// classes
+export { createResultSet } from './type/resultset/ResultSet.js';
+export { createRangeClass } from './type/matrix/Range.js';
+export { createHelpClass } from './expression/Help.js';
+export { createChainClass } from './type/chain/Chain.js';
+export { createHelp } from './expression/function/help.js';
+export { createChain } from './type/chain/function/chain.js';
+
+// algebra
+export { createResolve } from './function/algebra/resolve.js';
+export { createSimplify } from './function/algebra/simplify.js';
+export { createSimplifyConstant } from './function/algebra/simplifyConstant.js';
+export { createSimplifyCore } from './function/algebra/simplifyCore.js';
+export { createDerivative } from './function/algebra/derivative.js';
+export { createRationalize } from './function/algebra/rationalize.js';
+
+// arithmetic
+export var createUnaryMinus = /* #__PURE__ */createNumberFactory('unaryMinus', unaryMinusNumber);
+export var createUnaryPlus = /* #__PURE__ */createNumberFactory('unaryPlus', unaryPlusNumber);
+export var createAbs = /* #__PURE__ */createNumberFactory('abs', absNumber);
+export var createAddScalar = /* #__PURE__ */createNumberFactory('addScalar', addNumber);
+export var createSubtractScalar = /* #__PURE__ */createNumberFactory('subtractScalar', subtractNumber);
+export var createCbrt = /* #__PURE__ */createNumberFactory('cbrt', cbrtNumber);
+export { createCeilNumber as createCeil } from './function/arithmetic/ceil.js';
+export var createCube = /* #__PURE__ */createNumberFactory('cube', cubeNumber);
+export var createExp = /* #__PURE__ */createNumberFactory('exp', expNumber);
+export var createExpm1 = /* #__PURE__ */createNumberFactory('expm1', expm1Number);
+export { createFixNumber as createFix } from './function/arithmetic/fix.js';
+export { createFloorNumber as createFloor } from './function/arithmetic/floor.js';
+export var createGcd = /* #__PURE__ */createNumberFactory('gcd', gcdNumber);
+export var createLcm = /* #__PURE__ */createNumberFactory('lcm', lcmNumber);
+export var createLog10 = /* #__PURE__ */createNumberFactory('log10', log10Number);
+export var createLog2 = /* #__PURE__ */createNumberFactory('log2', log2Number);
+export var createMod = /* #__PURE__ */createNumberFactory('mod', modNumber);
+export var createMultiplyScalar = /* #__PURE__ */createNumberFactory('multiplyScalar', multiplyNumber);
+export var createMultiply = /* #__PURE__ */createNumberFactory('multiply', multiplyNumber);
+export var createNthRoot = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('nthRoot', nthRootNumber);
+export var createSign = /* #__PURE__ */createNumberFactory('sign', signNumber);
+export var createSqrt = /* #__PURE__ */createNumberFactory('sqrt', sqrtNumber);
+export var createSquare = /* #__PURE__ */createNumberFactory('square', squareNumber);
+export var createSubtract = /* #__PURE__ */createNumberFactory('subtract', subtractNumber);
+export var createXgcd = /* #__PURE__ */createNumberFactory('xgcd', xgcdNumber);
+export var createDivideScalar = /* #__PURE__ */createNumberFactory('divideScalar', divideNumber);
+export var createPow = /* #__PURE__ */createNumberFactory('pow', powNumber);
+export var createRound = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('round', roundNumber);
+export var createLog = /* #__PURE__ */
+createNumberOptionalSecondArgFactory('log', logNumber);
+export var createLog1p = /* #__PURE__ */createNumberFactory('log1p', log1pNumber);
+export var createAdd = /* #__PURE__ */createNumberFactory('add', addNumber);
+export { createHypot } from './function/arithmetic/hypot.js';
+export var createNorm = /* #__PURE__ */createNumberFactory('norm', normNumber);
+export var createDivide = /* #__PURE__ */createNumberFactory('divide', divideNumber);
+
+// bitwise
+export var createBitAnd = /* #__PURE__ */createNumberFactory('bitAnd', bitAndNumber);
+export var createBitNot = /* #__PURE__ */createNumberFactory('bitNot', bitNotNumber);
+export var createBitOr = /* #__PURE__ */createNumberFactory('bitOr', bitOrNumber);
+export var createBitXor = /* #__PURE__ */createNumberFactory('bitXor', bitXorNumber);
+export var createLeftShift = /* #__PURE__ */createNumberFactory('leftShift', leftShiftNumber);
+export var createRightArithShift = /* #__PURE__ */createNumberFactory('rightArithShift', rightArithShiftNumber);
+export var createRightLogShift = /* #__PURE__ */createNumberFactory('rightLogShift', rightLogShiftNumber);
+
+// combinatorics
+export { createStirlingS2 } from './function/combinatorics/stirlingS2.js';
+export { createBellNumbers } from './function/combinatorics/bellNumbers.js';
+export { createCatalan } from './function/combinatorics/catalan.js';
+export { createComposition } from './function/combinatorics/composition.js';
+
+// constants
+export { createE, createUppercaseE, createFalse,
+// createI,
+createInfinity, createLN10, createLN2, createLOG10E, createLOG2E, createNaN, createNull, createPhi, createPi, createUppercasePi, createSQRT1_2,
+// eslint-disable-line camelcase
+createSQRT2, createTau, createTrue, createVersion } from './constants.js';
+
+// create
+export { createNumber } from './type/number.js';
+export { createBigint } from './type/bigint.js';
+export { createString } from './type/string.js';
+export { createBoolean } from './type/boolean.js';
+export { createParser } from './expression/function/parser.js';
+
+// expression
+export { createNode } from './expression/node/Node.js';
+export { createAccessorNode } from './expression/node/AccessorNode.js';
+export { createArrayNode } from './expression/node/ArrayNode.js';
+export { createAssignmentNode } from './expression/node/AssignmentNode.js';
+export { createBlockNode } from './expression/node/BlockNode.js';
+export { createConditionalNode } from './expression/node/ConditionalNode.js';
+export { createConstantNode } from './expression/node/ConstantNode.js';
+export { createFunctionAssignmentNode } from './expression/node/FunctionAssignmentNode.js';
+export { createIndexNode } from './expression/node/IndexNode.js';
+export { createObjectNode } from './expression/node/ObjectNode.js';
+export { createOperatorNode } from './expression/node/OperatorNode.js';
+export { createParenthesisNode } from './expression/node/ParenthesisNode.js';
+export { createRangeNode } from './expression/node/RangeNode.js';
+export { createRelationalNode } from './expression/node/RelationalNode.js';
+export { createSymbolNode } from './expression/node/SymbolNode.js';
+export { createFunctionNode } from './expression/node/FunctionNode.js';
+export { createParse } from './expression/parse.js';
+export { createCompile } from './expression/function/compile.js';
+export { createEvaluate } from './expression/function/evaluate.js';
+export { createParserClass } from './expression/Parser.js';
+
+// logical
+export var createAnd = /* #__PURE__ */createNumberFactory('and', andNumber);
+export var createNot = /* #__PURE__ */createNumberFactory('not', notNumber);
+export var createOr = /* #__PURE__ */createNumberFactory('or', orNumber);
+export var createXor = /* #__PURE__ */createNumberFactory('xor', xorNumber);
+
+// matrix
+export { createMapSlices } from './function/matrix/mapSlices.js';
+export { createFilter } from './function/matrix/filter.js';
+export { createForEach } from './function/matrix/forEach.js';
+export { createMap } from './function/matrix/map.js';
+export { createRange } from './function/matrix/range.js';
+export { createSize } from './function/matrix/size.js';
+// FIXME: create a lightweight "number" implementation of subset only supporting plain objects/arrays
+export var createIndex = /* #__PURE__ */factory('index', [], () => noIndex);
+export var createMatrix = /* #__PURE__ */factory('matrix', [], () => noMatrix); // FIXME: needed now because subset transform needs it. Remove the need for it in subset
+export var createSubset = /* #__PURE__ */factory('subset', [], () => noSubset);
+// TODO: provide number+array implementations for map, filter, forEach, zeros, ...?
+// TODO: create range implementation for range?
+export { createPartitionSelect } from './function/matrix/partitionSelect.js';
+
+// probability
+export var createCombinations = createNumberFactory('combinations', combinationsNumber);
+export var createGamma = createNumberFactory('gamma', gammaNumber);
+export var createLgamma = createNumberFactory('lgamma', lgammaNumber);
+export { createCombinationsWithRep } from './function/probability/combinationsWithRep.js';
+export { createFactorial } from './function/probability/factorial.js';
+export { createMultinomial } from './function/probability/multinomial.js';
+export { createPermutations } from './function/probability/permutations.js';
+export { createPickRandom } from './function/probability/pickRandom.js';
+export { createRandomNumber as createRandom } from './function/probability/random.js';
+export { createRandomInt } from './function/probability/randomInt.js';
+
+// relational
+export { createEqualScalarNumber as createEqualScalar } from './function/relational/equalScalar.js';
+export { createCompareNumber as createCompare } from './function/relational/compare.js';
+export { createCompareNatural } from './function/relational/compareNatural.js';
+export { createCompareTextNumber as createCompareText } from './function/relational/compareText.js';
+export { createEqualNumber as createEqual } from './function/relational/equal.js';
+export { createEqualText } from './function/relational/equalText.js';
+export { createSmallerNumber as createSmaller } from './function/relational/smaller.js';
+export { createSmallerEqNumber as createSmallerEq } from './function/relational/smallerEq.js';
+export { createLargerNumber as createLarger } from './function/relational/larger.js';
+export { createLargerEqNumber as createLargerEq } from './function/relational/largerEq.js';
+export { createDeepEqual } from './function/relational/deepEqual.js';
+export { createUnequalNumber as createUnequal } from './function/relational/unequal.js';
+
+// special
+export { createErf } from './function/special/erf.js';
+export { createZeta } from './function/special/zeta.js';
+// statistics
+export { createMode } from './function/statistics/mode.js';
+export { createProd } from './function/statistics/prod.js';
+export { createMax } from './function/statistics/max.js';
+export { createMin } from './function/statistics/min.js';
+export { createSum } from './function/statistics/sum.js';
+export { createCumSum } from './function/statistics/cumsum.js';
+export { createMean } from './function/statistics/mean.js';
+export { createMedian } from './function/statistics/median.js';
+export { createMad } from './function/statistics/mad.js';
+export { createVariance } from './function/statistics/variance.js';
+export { createQuantileSeq } from './function/statistics/quantileSeq.js';
+export { createStd } from './function/statistics/std.js';
+export { createCorr } from './function/statistics/corr.js';
+
+// string
+export { createFormat } from './function/string/format.js';
+export { createPrint } from './function/string/print.js';
+
+// trigonometry
+export var createAcos = /* #__PURE__ */createNumberFactory('acos', acosNumber);
+export var createAcosh = /* #__PURE__ */createNumberFactory('acosh', acoshNumber);
+export var createAcot = /* #__PURE__ */createNumberFactory('acot', acotNumber);
+export var createAcoth = /* #__PURE__ */createNumberFactory('acoth', acothNumber);
+export var createAcsc = /* #__PURE__ */createNumberFactory('acsc', acscNumber);
+export var createAcsch = /* #__PURE__ */createNumberFactory('acsch', acschNumber);
+export var createAsec = /* #__PURE__ */createNumberFactory('asec', asecNumber);
+export var createAsech = /* #__PURE__ */createNumberFactory('asech', asechNumber);
+export var createAsin = /* #__PURE__ */createNumberFactory('asin', asinNumber);
+export var createAsinh = /* #__PURE__ */createNumberFactory('asinh', asinhNumber);
+export var createAtan = /* #__PURE__ */createNumberFactory('atan', atanNumber);
+export var createAtan2 = /* #__PURE__ */createNumberFactory('atan2', atan2Number);
+export var createAtanh = /* #__PURE__ */createNumberFactory('atanh', atanhNumber);
+export var createCos = /* #__PURE__ */createNumberFactory('cos', cosNumber);
+export var createCosh = /* #__PURE__ */createNumberFactory('cosh', coshNumber);
+export var createCot = /* #__PURE__ */createNumberFactory('cot', cotNumber);
+export var createCoth = /* #__PURE__ */createNumberFactory('coth', cothNumber);
+export var createCsc = /* #__PURE__ */createNumberFactory('csc', cscNumber);
+export var createCsch = /* #__PURE__ */createNumberFactory('csch', cschNumber);
+export var createSec = /* #__PURE__ */createNumberFactory('sec', secNumber);
+export var createSech = /* #__PURE__ */createNumberFactory('sech', sechNumber);
+export var createSin = /* #__PURE__ */createNumberFactory('sin', sinNumber);
+export var createSinh = /* #__PURE__ */createNumberFactory('sinh', sinhNumber);
+export var createTan = /* #__PURE__ */createNumberFactory('tan', tanNumber);
+export var createTanh = /* #__PURE__ */createNumberFactory('tanh', tanhNumber);
+
+// transforms
+export { createMapSlicesTransform } from './expression/transform/mapSlices.transform.js';
+export { createFilterTransform } from './expression/transform/filter.transform.js';
+export { createForEachTransform } from './expression/transform/forEach.transform.js';
+export { createMapTransform } from './expression/transform/map.transform.js';
+export { createMaxTransform } from './expression/transform/max.transform.js';
+export { createMeanTransform } from './expression/transform/mean.transform.js';
+export { createMinTransform } from './expression/transform/min.transform.js';
+export { createRangeTransform } from './expression/transform/range.transform.js';
+export var createSubsetTransform = /* #__PURE__ */factory('subset', [], () => noSubset, {
+  isTransformFunction: true
+});
+export { createStdTransform } from './expression/transform/std.transform.js';
+export { createSumTransform } from './expression/transform/sum.transform.js';
+export { createCumSumTransform } from './expression/transform/cumsum.transform.js';
+export { createVarianceTransform } from './expression/transform/variance.transform.js';
+
+// utils
+export { createClone } from './function/utils/clone.js';
+export var createIsInteger = /* #__PURE__ */createNumberFactory('isInteger', isIntegerNumber);
+export var createIsNegative = /* #__PURE__ */createNumberFactory('isNegative', isNegativeNumber);
+export { createIsNumeric } from './function/utils/isNumeric.js';
+export { createHasNumericValue } from './function/utils/hasNumericValue.js';
+export var createIsPositive = /* #__PURE__ */createNumberFactory('isPositive', isPositiveNumber);
+export var createIsZero = /* #__PURE__ */createNumberFactory('isZero', isZeroNumber);
+export var createIsNaN = /* #__PURE__ */createNumberFactory('isNaN', isNaNNumber);
+export { createTypeOf } from './function/utils/typeOf.js';
+export { createIsPrime } from './function/utils/isPrime.js';
+export { createNumeric } from './function/utils/numeric.js';
+
+// json
+export { createReviver } from './json/reviver.js';
+export { createReplacer } from './json/replacer.js';
+
+// helper functions to create a factory function for a function which only needs typed-function
+function createNumberFactory(name, fn) {
+  return factory(name, ['typed'], _ref => {
+    var {
+      typed
+    } = _ref;
+    return typed(fn);
+  });
+}
+function createNumberOptionalSecondArgFactory(name, fn) {
+  return factory(name, ['typed'], _ref2 => {
+    var {
+      typed
+    } = _ref2;
+    return typed({
+      number: fn,
+      'number,number': fn
+    });
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js
new file mode 100644
index 0000000..aa4c6b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/lup.js
@@ -0,0 +1,379 @@
+import { clone } from '../../../utils/object.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'lup';
+var dependencies = ['typed', 'matrix', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'larger', 'equalScalar', 'unaryMinus', 'DenseMatrix', 'SparseMatrix', 'Spa'];
+export var createLup = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    larger,
+    equalScalar,
+    unaryMinus,
+    DenseMatrix,
+    SparseMatrix,
+    Spa
+  } = _ref;
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix `A` is decomposed in two matrices (`L`, `U`) and a
+   * row permutation vector `p` where `A[p,:] = L * U`
+   *
+   * Syntax:
+   *
+   *    math.lup(A)
+   *
+   * Example:
+   *
+   *    const m = [[2, 1], [1, 4]]
+   *    const r = math.lup(m)
+   *    // r = {
+   *    //   L: [[1, 0], [0.5, 1]],
+   *    //   U: [[2, 1], [0, 3.5]],
+   *    //   P: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    slu, lsolve, lusolve, usolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array for which to get the LUP decomposition.
+   *
+   * @return {{L: Array | Matrix, U: Array | Matrix, P: Array.<number>}} The lower triangular matrix, the upper triangular matrix and the permutation matrix.
+   */
+  return typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseLUP(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseLUP(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a);
+      // lup, use matrix implementation
+      var r = _denseLUP(m);
+      // result
+      return {
+        L: r.L.valueOf(),
+        U: r.U.valueOf(),
+        p: r.p
+      };
+    }
+  });
+  function _denseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1];
+    // minimum rows and columns
+    var n = Math.min(rows, columns);
+    // matrix array, clone original data
+    var data = clone(m._data);
+    // l matrix arrays
+    var ldata = [];
+    var lsize = [rows, n];
+    // u matrix arrays
+    var udata = [];
+    var usize = [n, columns];
+    // vars
+    var i, j, k;
+    // permutation vector
+    var p = [];
+    for (i = 0; i < rows; i++) {
+      p[i] = i;
+    }
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows
+        for (i = 0; i < rows; i++) {
+          // min i,j
+          var min = Math.min(i, j);
+          // v[i, j]
+          var s = 0;
+          // loop up to min
+          for (k = 0; k < min; k++) {
+            // s = l[i, k] - data[k, j]
+            s = addScalar(s, multiplyScalar(data[i][k], data[k][j]));
+          }
+          data[i][j] = subtractScalar(data[i][j], s);
+        }
+      }
+      // row with larger value in cvector, row >= j
+      var pi = j;
+      var pabsv = 0;
+      var vjj = 0;
+      // loop rows
+      for (i = j; i < rows; i++) {
+        // data @ i, j
+        var v = data[i][j];
+        // absolute value
+        var absv = abs(v);
+        // value is greater than pivote value
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = i;
+          // update max value
+          pabsv = absv;
+          // value @ [j, j]
+          vjj = v;
+        }
+      }
+      // swap rows (j <-> pi)
+      if (j !== pi) {
+        // swap values j <-> pi in p
+        p[j] = [p[pi], p[pi] = p[j]][0];
+        // swap j <-> pi in data
+        DenseMatrix._swapRows(j, pi, data);
+      }
+      // check column is in lower triangular matrix
+      if (j < rows) {
+        // loop rows (lower triangular matrix)
+        for (i = j + 1; i < rows; i++) {
+          // value @ i, j
+          var vij = data[i][j];
+          if (!equalScalar(vij, 0)) {
+            // update data
+            data[i][j] = divideScalar(data[i][j], vjj);
+          }
+        }
+      }
+    }
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // initialize row in arrays
+        if (j === 0) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i] = [];
+          }
+          // L
+          ldata[i] = [];
+        }
+        // check we are in the upper triangular matrix
+        if (i < j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          }
+          // check column exists in lower triangular matrix
+          if (j < rows) {
+            // L
+            ldata[i][j] = 0;
+          }
+          continue;
+        }
+        // diagonal value
+        if (i === j) {
+          // check row exists in upper triangular matrix
+          if (i < columns) {
+            // U
+            udata[i][j] = data[i][j];
+          }
+          // check column exists in lower triangular matrix
+          if (j < rows) {
+            // L
+            ldata[i][j] = 1;
+          }
+          continue;
+        }
+        // check row exists in upper triangular matrix
+        if (i < columns) {
+          // U
+          udata[i][j] = 0;
+        }
+        // check column exists in lower triangular matrix
+        if (j < rows) {
+          // L
+          ldata[i][j] = data[i][j];
+        }
+      }
+    }
+    // l matrix
+    var l = new DenseMatrix({
+      data: ldata,
+      size: lsize
+    });
+    // u matrix
+    var u = new DenseMatrix({
+      data: udata,
+      size: usize
+    });
+    // p vector
+    var pv = [];
+    for (i = 0, n = p.length; i < n; i++) {
+      pv[p[i]] = i;
+    }
+    // return matrices
+    return {
+      L: l,
+      U: u,
+      p: pv,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+  function _sparseLUP(m) {
+    // rows & columns
+    var rows = m._size[0];
+    var columns = m._size[1];
+    // minimum rows and columns
+    var n = Math.min(rows, columns);
+    // matrix arrays (will not be modified, thanks to permutation vector)
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    // l matrix arrays
+    var lvalues = [];
+    var lindex = [];
+    var lptr = [];
+    var lsize = [rows, n];
+    // u matrix arrays
+    var uvalues = [];
+    var uindex = [];
+    var uptr = [];
+    var usize = [n, columns];
+    // vars
+    var i, j, k;
+    // permutation vectors, (current index -> original index) and (original index -> current index)
+    var pvCo = [];
+    var pvOc = [];
+    for (i = 0; i < rows; i++) {
+      pvCo[i] = i;
+      pvOc[i] = i;
+    }
+    // swap indices in permutation vectors (condition x < y)!
+    var swapIndeces = function swapIndeces(x, y) {
+      // find pv indeces getting data from x and y
+      var kx = pvOc[x];
+      var ky = pvOc[y];
+      // update permutation vector current -> original
+      pvCo[kx] = y;
+      pvCo[ky] = x;
+      // update permutation vector original -> current
+      pvOc[x] = ky;
+      pvOc[y] = kx;
+    };
+    // loop columns
+    var _loop = function _loop() {
+      // sparse accumulator
+      var spa = new Spa();
+      // check lower triangular matrix has a value @ column j
+      if (j < rows) {
+        // update ptr
+        lptr.push(lvalues.length);
+        // first value in j column for lower triangular matrix
+        lvalues.push(1);
+        lindex.push(j);
+      }
+      // update ptr
+      uptr.push(uvalues.length);
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1];
+      // copy column j into sparse accumulator
+      for (k = k0; k < k1; k++) {
+        // row
+        i = index[k];
+        // copy column values into sparse accumulator (use permutation vector)
+        spa.set(pvCo[i], values[k]);
+      }
+      // skip first column in upper triangular matrix
+      if (j > 0) {
+        // loop rows in column j (above diagonal)
+        spa.forEach(0, j - 1, function (k, vkj) {
+          // loop rows in column k (L)
+          SparseMatrix._forEachRow(k, lvalues, lindex, lptr, function (i, vik) {
+            // check row is below k
+            if (i > k) {
+              // update spa value
+              spa.accumulate(i, unaryMinus(multiplyScalar(vik, vkj)));
+            }
+          });
+        });
+      }
+      // row with larger value in spa, row >= j
+      var pi = j;
+      var vjj = spa.get(j);
+      var pabsv = abs(vjj);
+      // loop values in spa (order by row, below diagonal)
+      spa.forEach(j + 1, rows - 1, function (x, v) {
+        // absolute value
+        var absv = abs(v);
+        // value is greater than pivote value
+        if (larger(absv, pabsv)) {
+          // store row
+          pi = x;
+          // update max value
+          pabsv = absv;
+          // value @ [j, j]
+          vjj = v;
+        }
+      });
+      // swap rows (j <-> pi)
+      if (j !== pi) {
+        // swap values j <-> pi in L
+        SparseMatrix._swapRows(j, pi, lsize[1], lvalues, lindex, lptr);
+        // swap values j <-> pi in U
+        SparseMatrix._swapRows(j, pi, usize[1], uvalues, uindex, uptr);
+        // swap values in spa
+        spa.swap(j, pi);
+        // update permutation vector (swap values @ j, pi)
+        swapIndeces(j, pi);
+      }
+      // loop values in spa (order by row)
+      spa.forEach(0, rows - 1, function (x, v) {
+        // check we are above diagonal
+        if (x <= j) {
+          // update upper triangular matrix
+          uvalues.push(v);
+          uindex.push(x);
+        } else {
+          // update value
+          v = divideScalar(v, vjj);
+          // check value is non zero
+          if (!equalScalar(v, 0)) {
+            // update lower triangular matrix
+            lvalues.push(v);
+            lindex.push(x);
+          }
+        }
+      });
+    };
+    for (j = 0; j < columns; j++) {
+      _loop();
+    }
+    // update ptrs
+    uptr.push(uvalues.length);
+    lptr.push(lvalues.length);
+
+    // return matrices
+    return {
+      L: new SparseMatrix({
+        values: lvalues,
+        index: lindex,
+        ptr: lptr,
+        size: lsize
+      }),
+      U: new SparseMatrix({
+        values: uvalues,
+        index: uindex,
+        ptr: uptr,
+        size: usize
+      }),
+      p: pvCo,
+      toString: function toString() {
+        return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\nP: ' + this.p;
+      }
+    };
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js
new file mode 100644
index 0000000..ad79a33
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/qr.js
@@ -0,0 +1,222 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { factory } from '../../../utils/factory.js';
+var name = 'qr';
+var dependencies = ['typed', 'matrix', 'zeros', 'identity', 'isZero', 'equal', 'sign', 'sqrt', 'conj', 'unaryMinus', 'addScalar', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'complex'];
+export var createQr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    zeros,
+    identity,
+    isZero,
+    equal,
+    sign,
+    sqrt,
+    conj,
+    unaryMinus,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    complex
+  } = _ref;
+  /**
+   * Calculate the Matrix QR decomposition. Matrix `A` is decomposed in
+   * two matrices (`Q`, `R`) where `Q` is an
+   * orthogonal matrix and `R` is an upper triangular matrix.
+   *
+   * Syntax:
+   *
+   *    math.qr(A)
+   *
+   * Example:
+   *
+   *    const m = [
+   *      [1, -1,  4],
+   *      [1,  4, -2],
+   *      [1,  4,  2],
+   *      [1,  -1, 0]
+   *    ]
+   *    const result = math.qr(m)
+   *    // r = {
+   *    //   Q: [
+   *    //     [0.5, -0.5,   0.5],
+   *    //     [0.5,  0.5,  -0.5],
+   *    //     [0.5,  0.5,   0.5],
+   *    //     [0.5, -0.5,  -0.5],
+   *    //   ],
+   *    //   R: [
+   *    //     [2, 3,  2],
+   *    //     [0, 5, -2],
+   *    //     [0, 0,  4],
+   *    //     [0, 0,  0]
+   *    //   ]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lusolve
+   *
+   * @param {Matrix | Array} A    A two dimensional matrix or array
+   * for which to get the QR decomposition.
+   *
+   * @return {{Q: Array | Matrix, R: Array | Matrix}} Q: the orthogonal
+   * matrix and R: the upper triangular matrix
+   */
+  return _extends(typed(name, {
+    DenseMatrix: function DenseMatrix(m) {
+      return _denseQR(m);
+    },
+    SparseMatrix: function SparseMatrix(m) {
+      return _sparseQR(m);
+    },
+    Array: function Array(a) {
+      // create dense matrix from array
+      var m = matrix(a);
+      // lup, use matrix implementation
+      var r = _denseQR(m);
+      // result
+      return {
+        Q: r.Q.valueOf(),
+        R: r.R.valueOf()
+      };
+    }
+  }), {
+    _denseQRimpl
+  });
+  function _denseQRimpl(m) {
+    // rows & columns (m x n)
+    var rows = m._size[0]; // m
+    var cols = m._size[1]; // n
+
+    var Q = identity([rows], 'dense');
+    var Qdata = Q._data;
+    var R = m.clone();
+    var Rdata = R._data;
+
+    // vars
+    var i, j, k;
+    var w = zeros([rows], '');
+    for (k = 0; k < Math.min(cols, rows); ++k) {
+      /*
+       * **k-th Household matrix**
+       *
+       * The matrix I - 2*v*transpose(v)
+       * x     = first column of A
+       * x1    = first element of x
+       * alpha = x1 / |x1| * |x|
+       * e1    = tranpose([1, 0, 0, ...])
+       * u     = x - alpha * e1
+       * v     = u / |u|
+       *
+       * Household matrix = I - 2 * v * tranpose(v)
+       *
+       *  * Initially Q = I and R = A.
+       *  * Household matrix is a reflection in a plane normal to v which
+       *    will zero out all but the top right element in R.
+       *  * Appplying reflection to both Q and R will not change product.
+       *  * Repeat this process on the (1,1) minor to get R as an upper
+       *    triangular matrix.
+       *  * Reflections leave the magnitude of the columns of Q unchanged
+       *    so Q remains othoganal.
+       *
+       */
+
+      var pivot = Rdata[k][k];
+      var sgn = unaryMinus(equal(pivot, 0) ? 1 : sign(pivot));
+      var conjSgn = conj(sgn);
+      var alphaSquared = 0;
+      for (i = k; i < rows; i++) {
+        alphaSquared = addScalar(alphaSquared, multiplyScalar(Rdata[i][k], conj(Rdata[i][k])));
+      }
+      var alpha = multiplyScalar(sgn, sqrt(alphaSquared));
+      if (!isZero(alpha)) {
+        // first element in vector u
+        var u1 = subtractScalar(pivot, alpha);
+
+        // w = v * u1 / |u|    (only elements k to (rows-1) are used)
+        w[k] = 1;
+        for (i = k + 1; i < rows; i++) {
+          w[i] = divideScalar(Rdata[i][k], u1);
+        }
+
+        // tau = - conj(u1 / alpha)
+        var tau = unaryMinus(conj(divideScalar(u1, alpha)));
+        var s = void 0;
+
+        /*
+         * tau and w have been choosen so that
+         *
+         * 2 * v * tranpose(v) = tau * w * tranpose(w)
+         */
+
+        /*
+         * -- calculate R = R - tau * w * tranpose(w) * R --
+         * Only do calculation with rows k to (rows-1)
+         * Additionally columns 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+        for (j = k; j < cols; j++) {
+          s = 0.0;
+
+          // calculate jth element of [tranpose(w) * R]
+          for (i = k; i < rows; i++) {
+            s = addScalar(s, multiplyScalar(conj(w[i]), Rdata[i][j]));
+          }
+
+          // calculate the jth element of [tau * transpose(w) * R]
+          s = multiplyScalar(s, tau);
+          for (i = k; i < rows; i++) {
+            Rdata[i][j] = multiplyScalar(subtractScalar(Rdata[i][j], multiplyScalar(w[i], s)), conjSgn);
+          }
+        }
+        /*
+         * -- calculate Q = Q - tau * Q * w * transpose(w) --
+         * Q is a square matrix (rows x rows)
+         * Only do calculation with columns k to (rows-1)
+         * Additionally rows 0 to (k-1) will not be changed by this
+         *   multiplication so do not bother recalculating them
+         */
+        for (i = 0; i < rows; i++) {
+          s = 0.0;
+
+          // calculate ith element of [Q * w]
+          for (j = k; j < rows; j++) {
+            s = addScalar(s, multiplyScalar(Qdata[i][j], w[j]));
+          }
+
+          // calculate the ith element of [tau * Q * w]
+          s = multiplyScalar(s, tau);
+          for (j = k; j < rows; ++j) {
+            Qdata[i][j] = divideScalar(subtractScalar(Qdata[i][j], multiplyScalar(s, conj(w[j]))), conjSgn);
+          }
+        }
+      }
+    }
+
+    // return matrices
+    return {
+      Q,
+      R,
+      toString: function toString() {
+        return 'Q: ' + this.Q.toString() + '\nR: ' + this.R.toString();
+      }
+    };
+  }
+  function _denseQR(m) {
+    var ret = _denseQRimpl(m);
+    var Rdata = ret.R._data;
+    if (m._data.length > 0) {
+      var zero = Rdata[0][0].type === 'Complex' ? complex(0) : 0;
+      for (var i = 0; i < Rdata.length; ++i) {
+        for (var j = 0; j < i && j < (Rdata[0] || []).length; ++j) {
+          Rdata[i][j] = zero;
+        }
+      }
+    }
+    return ret;
+  }
+  function _sparseQR(m) {
+    throw new Error('qr not implemented for sparse matrices yet');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/schur.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/schur.js
new file mode 100644
index 0000000..a3ee46f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/schur.js
@@ -0,0 +1,70 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'schur';
+var dependencies = ['typed', 'matrix', 'identity', 'multiply', 'qr', 'norm', 'subtract'];
+export var createSchur = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    identity,
+    multiply,
+    qr,
+    norm,
+    subtract
+  } = _ref;
+  /**
+   *
+   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal
+   * and T is upper quasi-triangular.
+   * https://en.wikipedia.org/wiki/Schur_decomposition
+   *
+   * Syntax:
+   *
+   *     math.schur(A)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 0], [-4, 3]]
+   *     math.schur(A) // returns {T: [[3, 4], [0, 1]], R: [[0, 1], [-1, 0]]}
+   *
+   * See also:
+   *
+   *     sylvester, lyap, qr
+   *
+   * @param {Array | Matrix} A  Matrix A
+   * @return {{U: Array | Matrix, T: Array | Matrix}} Object containing both matrix U and T of the Schur Decomposition A=UTU'
+   */
+  return typed(name, {
+    Array: function Array(X) {
+      var r = _schur(matrix(X));
+      return {
+        U: r.U.valueOf(),
+        T: r.T.valueOf()
+      };
+    },
+    Matrix: function Matrix(X) {
+      return _schur(X);
+    }
+  });
+  function _schur(X) {
+    var n = X.size()[0];
+    var A = X;
+    var U = identity(n);
+    var k = 0;
+    var A0;
+    do {
+      A0 = A;
+      var QR = qr(A);
+      var Q = QR.Q;
+      var R = QR.R;
+      A = multiply(R, Q);
+      U = multiply(U, Q);
+      if (k++ > 100) {
+        break;
+      }
+    } while (norm(subtract(A, A0)) > 1e-4);
+    return {
+      U,
+      T: A
+    };
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js b/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js
new file mode 100644
index 0000000..13f07f9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/decomposition/slu.js
@@ -0,0 +1,101 @@
+import { isInteger } from '../../../utils/number.js';
+import { factory } from '../../../utils/factory.js';
+import { createCsSqr } from '../sparse/csSqr.js';
+import { createCsLu } from '../sparse/csLu.js';
+var name = 'slu';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'transpose', 'divideScalar', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+export var createSlu = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    multiply,
+    transpose,
+    divideScalar,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  var csSqr = createCsSqr({
+    add,
+    multiply,
+    transpose
+  });
+  var csLu = createCsLu({
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  });
+
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting. Sparse Matrix `A` is decomposed in two matrices (`L`, `U`) and two permutation vectors (`pinv`, `q`) where
+   *
+   * `P * A * Q = L * U`
+   *
+   * Syntax:
+   *
+   *    math.slu(A, order, threshold)
+   *
+   * Examples:
+   *
+   *    const A = math.sparse([[4,3], [6, 3]])
+   *    math.slu(A, 1, 0.001)
+   *    // returns:
+   *    // {
+   *    //   L: [[1, 0], [1.5, 1]]
+   *    //   U: [[4, 3], [0, -1.5]]
+   *    //   p: [0, 1]
+   *    //   q: [0, 1]
+   *    // }
+   *
+   * See also:
+   *
+   *    lup, lsolve, usolve, lusolve
+   *
+   * @param {SparseMatrix} A              A two dimensional sparse matrix for which to get the LU decomposition.
+   * @param {Number}       order          The Symbolic Ordering and Analysis order:
+   *                                       0 - Natural ordering, no permutation vector q is returned
+   *                                       1 - Matrix must be square, symbolic ordering and analisis is performed on M = A + A'
+   *                                       2 - Symbolic ordering and analisis is performed on M = A' * A. Dense columns from A' are dropped, A recreated from A'.
+   *                                           This is appropriatefor LU factorization of unsymmetric matrices.
+   *                                       3 - Symbolic ordering and analisis is performed on M = A' * A. This is best used for LU factorization is matrix M has no dense rows.
+   *                                           A dense row is a row with more than 10*sqr(columns) entries.
+   * @param {Number}       threshold       Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Object} The lower triangular matrix, the upper triangular matrix and the permutation vectors.
+   */
+  return typed(name, {
+    'SparseMatrix, number, number': function SparseMatrix_number_number(a, order, threshold) {
+      // verify order
+      if (!isInteger(order) || order < 0 || order > 3) {
+        throw new Error('Symbolic Ordering and Analysis order must be an integer number in the interval [0, 3]');
+      }
+      // verify threshold
+      if (threshold < 0 || threshold > 1) {
+        throw new Error('Partial pivoting threshold must be a number from 0 to 1');
+      }
+
+      // perform symbolic ordering and analysis
+      var s = csSqr(order, a, false);
+
+      // perform lu decomposition
+      var f = csLu(a, s, threshold);
+
+      // return decomposition
+      return {
+        L: f.L,
+        U: f.U,
+        p: f.pinv,
+        q: s.q,
+        toString: function toString() {
+          return 'L: ' + this.L.toString() + '\nU: ' + this.U.toString() + '\np: ' + this.p.toString() + (this.q ? '\nq: ' + this.q.toString() : '') + '\n';
+        }
+      };
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/derivative.js b/node_modules/mathjs/lib/esm/function/algebra/derivative.js
new file mode 100644
index 0000000..276bbd6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/derivative.js
@@ -0,0 +1,506 @@
+import { isConstantNode, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+var name = 'derivative';
+var dependencies = ['typed', 'config', 'parse', 'simplify', 'equal', 'isZero', 'numeric', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+export var createDerivative = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    parse,
+    simplify,
+    equal,
+    isZero,
+    numeric,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  /**
+   * Takes the derivative of an expression expressed in parser Nodes.
+   * The derivative will be taken over the supplied variable in the
+   * second parameter. If there are multiple variables in the expression,
+   * it will return a partial derivative.
+   *
+   * This uses rules of differentiation which can be found here:
+   *
+   * - [Differentiation rules (Wikipedia)](https://en.wikipedia.org/wiki/Differentiation_rules)
+   *
+   * Syntax:
+   *
+   *     math.derivative(expr, variable)
+   *     math.derivative(expr, variable, options)
+   *
+   * Examples:
+   *
+   *     math.derivative('x^2', 'x')                     // Node '2 * x'
+   *     math.derivative('x^2', 'x', {simplify: false})  // Node '2 * 1 * x ^ (2 - 1)'
+   *     math.derivative('sin(2x)', 'x'))                // Node '2 * cos(2 * x)'
+   *     math.derivative('2*x', 'x').evaluate()          // number 2
+   *     math.derivative('x^2', 'x').evaluate({x: 4})    // number 8
+   *     const f = math.parse('x^2')
+   *     const x = math.parse('x')
+   *     math.derivative(f, x)                           // Node {2 * x}
+   *
+   * See also:
+   *
+   *     simplify, parse, evaluate
+   *
+   * @param  {Node | string} expr           The expression to differentiate
+   * @param  {SymbolNode | string} variable The variable over which to differentiate
+   * @param  {{simplify: boolean}} [options]
+   *                         There is one option available, `simplify`, which
+   *                         is true by default. When false, output will not
+   *                         be simplified.
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  function plainDerivative(expr, variable) {
+    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {
+      simplify: true
+    };
+    var cache = new Map();
+    var variableName = variable.name;
+    function isConstCached(node) {
+      var cached = cache.get(node);
+      if (cached !== undefined) {
+        return cached;
+      }
+      var res = _isConst(isConstCached, node, variableName);
+      cache.set(node, res);
+      return res;
+    }
+    var res = _derivative(expr, isConstCached);
+    return options.simplify ? simplify(res) : res;
+  }
+  function parseIdentifier(string) {
+    var symbol = parse(string);
+    if (!symbol.isSymbolNode) {
+      throw new TypeError('Invalid variable. ' + "Cannot parse ".concat(JSON.stringify(string), " into a variable in function derivative"));
+    }
+    return symbol;
+  }
+  var derivative = typed(name, {
+    'Node, SymbolNode': plainDerivative,
+    'Node, SymbolNode, Object': plainDerivative,
+    'Node, string': (node, symbol) => plainDerivative(node, parseIdentifier(symbol)),
+    'Node, string, Object': (node, symbol, options) => plainDerivative(node, parseIdentifier(symbol), options)
+
+    /* TODO: implement and test syntax with order of derivatives -> implement as an option {order: number}
+    'Node, SymbolNode, ConstantNode': function (expr, variable, {order}) {
+      let res = expr
+      for (let i = 0; i < order; i++) {
+        <create caching isConst>
+        res = _derivative(res, isConst)
+      }
+      return res
+    }
+    */
+  });
+  derivative._simplify = true;
+  derivative.toTex = function (deriv) {
+    return _derivTex.apply(null, deriv.args);
+  };
+
+  // FIXME: move the toTex method of derivative to latex.js. Difficulty is that it relies on parse.
+  // NOTE: the optional "order" parameter here is currently unused
+  var _derivTex = typed('_derivTex', {
+    'Node, SymbolNode': function Node_SymbolNode(expr, x) {
+      if (isConstantNode(expr) && typeOf(expr.value) === 'string') {
+        return _derivTex(parse(expr.value).toString(), x.toString(), 1);
+      } else {
+        return _derivTex(expr.toTex(), x.toString(), 1);
+      }
+    },
+    'Node, ConstantNode': function Node_ConstantNode(expr, x) {
+      if (typeOf(x.value) === 'string') {
+        return _derivTex(expr, parse(x.value));
+      } else {
+        throw new Error("The second parameter to 'derivative' is a non-string constant");
+      }
+    },
+    'Node, SymbolNode, ConstantNode': function Node_SymbolNode_ConstantNode(expr, x, order) {
+      return _derivTex(expr.toString(), x.name, order.value);
+    },
+    'string, string, number': function string_string_number(expr, x, order) {
+      var d;
+      if (order === 1) {
+        d = '{d\\over d' + x + '}';
+      } else {
+        d = '{d^{' + order + '}\\over d' + x + '^{' + order + '}}';
+      }
+      return d + "\\left[".concat(expr, "\\right]");
+    }
+  });
+
+  /**
+   * Checks if a node is constants (e.g. 2 + 2).
+   * Accepts (usually memoized) version of self as the first parameter for recursive calls.
+   * Classification is done as follows:
+   *
+   *   1. ConstantNodes are constants.
+   *   2. If there exists a SymbolNode, of which we are differentiating over,
+   *      in the subtree it is not constant.
+   *
+   * @param  {function} isConst  Function that tells whether sub-expression is a constant
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {string} varName     Variable that we are differentiating
+   * @return {boolean}  if node is constant
+   */
+  var _isConst = typed('_isConst', {
+    'function, ConstantNode, string': function function_ConstantNode_string() {
+      return true;
+    },
+    'function, SymbolNode, string': function function_SymbolNode_string(isConst, node, varName) {
+      // Treat other variables like constants. For reasoning, see:
+      //   https://en.wikipedia.org/wiki/Partial_derivative
+      return node.name !== varName;
+    },
+    'function, ParenthesisNode, string': function function_ParenthesisNode_string(isConst, node, varName) {
+      return isConst(node.content, varName);
+    },
+    'function, FunctionAssignmentNode, string': function function_FunctionAssignmentNode_string(isConst, node, varName) {
+      if (!node.params.includes(varName)) {
+        return true;
+      }
+      return isConst(node.expr, varName);
+    },
+    'function, FunctionNode | OperatorNode, string': function function_FunctionNode__OperatorNode_string(isConst, node, varName) {
+      return node.args.every(arg => isConst(arg, varName));
+    }
+  });
+
+  /**
+   * Applies differentiation rules.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {function} isConst  Function that tells if a node is constant
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode}    The derivative of `expr`
+   */
+  var _derivative = typed('_derivative', {
+    'ConstantNode, function': function ConstantNode_function() {
+      return createConstantNode(0);
+    },
+    'SymbolNode, function': function SymbolNode_function(node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      return createConstantNode(1);
+    },
+    'ParenthesisNode, function': function ParenthesisNode_function(node, isConst) {
+      return new ParenthesisNode(_derivative(node.content, isConst));
+    },
+    'FunctionAssignmentNode, function': function FunctionAssignmentNode_function(node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      return _derivative(node.expr, isConst);
+    },
+    'FunctionNode, function': function FunctionNode_function(node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      var arg0 = node.args[0];
+      var arg1;
+      var div = false; // is output a fraction?
+      var negative = false; // is output negative?
+
+      var funcDerivative;
+      switch (node.name) {
+        case 'cbrt':
+          // d/dx(cbrt(x)) = 1 / (3x^(2/3))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(3), new OperatorNode('^', 'pow', [arg0, new OperatorNode('/', 'divide', [createConstantNode(2), createConstantNode(3)])])]);
+          break;
+        case 'sqrt':
+        case 'nthRoot':
+          // d/dx(sqrt(x)) = 1 / (2*sqrt(x))
+          if (node.args.length === 1) {
+            div = true;
+            funcDerivative = new OperatorNode('*', 'multiply', [createConstantNode(2), new FunctionNode('sqrt', [arg0])]);
+          } else if (node.args.length === 2) {
+            // Rearrange from nthRoot(x, a) -> x^(1/a)
+            arg1 = new OperatorNode('/', 'divide', [createConstantNode(1), node.args[1]]);
+            return _derivative(new OperatorNode('^', 'pow', [arg0, arg1]), isConst);
+          }
+          break;
+        case 'log10':
+          arg1 = createConstantNode(10);
+        /* fall through! */
+        case 'log':
+          if (!arg1 && node.args.length === 1) {
+            // d/dx(log(x)) = 1 / x
+            funcDerivative = arg0.clone();
+            div = true;
+          } else if (node.args.length === 1 && arg1 || node.args.length === 2 && isConst(node.args[1])) {
+            // d/dx(log(x, c)) = 1 / (x*ln(c))
+            funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('log', [arg1 || node.args[1]])]);
+            div = true;
+          } else if (node.args.length === 2) {
+            // d/dx(log(f(x), g(x))) = d/dx(log(f(x)) / log(g(x)))
+            return _derivative(new OperatorNode('/', 'divide', [new FunctionNode('log', [arg0]), new FunctionNode('log', [node.args[1]])]), isConst);
+          }
+          break;
+        case 'pow':
+          if (node.args.length === 2) {
+            // Pass to pow operator node parser
+            return _derivative(new OperatorNode('^', 'pow', [arg0, node.args[1]]), isConst);
+          }
+          break;
+        case 'exp':
+          // d/dx(e^x) = e^x
+          funcDerivative = new FunctionNode('exp', [arg0.clone()]);
+          break;
+        case 'sin':
+          // d/dx(sin(x)) = cos(x)
+          funcDerivative = new FunctionNode('cos', [arg0.clone()]);
+          break;
+        case 'cos':
+          // d/dx(cos(x)) = -sin(x)
+          funcDerivative = new OperatorNode('-', 'unaryMinus', [new FunctionNode('sin', [arg0.clone()])]);
+          break;
+        case 'tan':
+          // d/dx(tan(x)) = sec(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sec', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'sec':
+          // d/dx(sec(x)) = sec(x)tan(x)
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tan', [arg0.clone()])]);
+          break;
+        case 'csc':
+          // d/dx(csc(x)) = -csc(x)cot(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('cot', [arg0.clone()])]);
+          break;
+        case 'cot':
+          // d/dx(cot(x)) = -csc(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csc', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'asin':
+          // d/dx(asin(x)) = 1 / sqrt(1 - x^2)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+        case 'acos':
+          // d/dx(acos(x)) = -1 / sqrt(1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])]);
+          break;
+        case 'atan':
+          // d/dx(atan(x)) = 1 / (x^2 + 1)
+          div = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+        case 'asec':
+          // d/dx(asec(x)) = 1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acsc':
+          // d/dx(acsc(x)) = -1 / (|x|*sqrt(x^2 - 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acot':
+          // d/dx(acot(x)) = -1 / (x^2 + 1)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)]);
+          break;
+        case 'sinh':
+          // d/dx(sinh(x)) = cosh(x)
+          funcDerivative = new FunctionNode('cosh', [arg0.clone()]);
+          break;
+        case 'cosh':
+          // d/dx(cosh(x)) = sinh(x)
+          funcDerivative = new FunctionNode('sinh', [arg0.clone()]);
+          break;
+        case 'tanh':
+          // d/dx(tanh(x)) = sech(x)^2
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('sech', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'sech':
+          // d/dx(sech(x)) = -sech(x)tanh(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('tanh', [arg0.clone()])]);
+          break;
+        case 'csch':
+          // d/dx(csch(x)) = -csch(x)coth(x)
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [node, new FunctionNode('coth', [arg0.clone()])]);
+          break;
+        case 'coth':
+          // d/dx(coth(x)) = -csch(x)^2
+          negative = true;
+          funcDerivative = new OperatorNode('^', 'pow', [new FunctionNode('csch', [arg0.clone()]), createConstantNode(2)]);
+          break;
+        case 'asinh':
+          // d/dx(asinh(x)) = 1 / sqrt(x^2 + 1)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+        case 'acosh':
+          // d/dx(acosh(x)) = 1 / sqrt(x^2 - 1); XXX potentially only for x >= 1 (the real spectrum)
+          div = true;
+          funcDerivative = new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])]);
+          break;
+        case 'atanh':
+          // d/dx(atanh(x)) = 1 / (1 - x^2)
+          div = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+        case 'asech':
+          // d/dx(asech(x)) = -1 / (x*sqrt(1 - x^2))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [arg0.clone(), new FunctionNode('sqrt', [new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])])])]);
+          break;
+        case 'acsch':
+          // d/dx(acsch(x)) = -1 / (|x|*sqrt(x^2 + 1))
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('*', 'multiply', [new FunctionNode('abs', [arg0.clone()]), new FunctionNode('sqrt', [new OperatorNode('+', 'add', [new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)]), createConstantNode(1)])])]);
+          break;
+        case 'acoth':
+          // d/dx(acoth(x)) = -1 / (1 - x^2)
+          div = true;
+          negative = true;
+          funcDerivative = new OperatorNode('-', 'subtract', [createConstantNode(1), new OperatorNode('^', 'pow', [arg0.clone(), createConstantNode(2)])]);
+          break;
+        case 'abs':
+          // d/dx(abs(x)) = abs(x)/x
+          funcDerivative = new OperatorNode('/', 'divide', [new FunctionNode(new SymbolNode('abs'), [arg0.clone()]), arg0.clone()]);
+          break;
+        case 'gamma': // Needs digamma function, d/dx(gamma(x)) = gamma(x)digamma(x)
+        default:
+          throw new Error('Cannot process function "' + node.name + '" in derivative: ' + 'the function is not supported, undefined, or the number of arguments passed to it are not supported');
+      }
+      var op, func;
+      if (div) {
+        op = '/';
+        func = 'divide';
+      } else {
+        op = '*';
+        func = 'multiply';
+      }
+
+      /* Apply chain rule to all functions:
+         F(x)  = f(g(x))
+         F'(x) = g'(x)*f'(g(x)) */
+      var chainDerivative = _derivative(arg0, isConst);
+      if (negative) {
+        chainDerivative = new OperatorNode('-', 'unaryMinus', [chainDerivative]);
+      }
+      return new OperatorNode(op, func, [chainDerivative, funcDerivative]);
+    },
+    'OperatorNode, function': function OperatorNode_function(node, isConst) {
+      if (isConst(node)) {
+        return createConstantNode(0);
+      }
+      if (node.op === '+') {
+        // d/dx(sum(f(x)) = sum(f'(x))
+        return new OperatorNode(node.op, node.fn, node.args.map(function (arg) {
+          return _derivative(arg, isConst);
+        }));
+      }
+      if (node.op === '-') {
+        // d/dx(+/-f(x)) = +/-f'(x)
+        if (node.isUnary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], isConst)]);
+        }
+
+        // Linearity of differentiation, d/dx(f(x) +/- g(x)) = f'(x) +/- g'(x)
+        if (node.isBinary()) {
+          return new OperatorNode(node.op, node.fn, [_derivative(node.args[0], isConst), _derivative(node.args[1], isConst)]);
+        }
+      }
+      if (node.op === '*') {
+        // d/dx(c*f(x)) = c*f'(x)
+        var constantTerms = node.args.filter(function (arg) {
+          return isConst(arg);
+        });
+        if (constantTerms.length > 0) {
+          var nonConstantTerms = node.args.filter(function (arg) {
+            return !isConst(arg);
+          });
+          var nonConstantNode = nonConstantTerms.length === 1 ? nonConstantTerms[0] : new OperatorNode('*', 'multiply', nonConstantTerms);
+          var newArgs = constantTerms.concat(_derivative(nonConstantNode, isConst));
+          return new OperatorNode('*', 'multiply', newArgs);
+        }
+
+        // Product Rule, d/dx(f(x)*g(x)) = f'(x)*g(x) + f(x)*g'(x)
+        return new OperatorNode('+', 'add', node.args.map(function (argOuter) {
+          return new OperatorNode('*', 'multiply', node.args.map(function (argInner) {
+            return argInner === argOuter ? _derivative(argInner, isConst) : argInner.clone();
+          }));
+        }));
+      }
+      if (node.op === '/' && node.isBinary()) {
+        var arg0 = node.args[0];
+        var arg1 = node.args[1];
+
+        // d/dx(f(x) / c) = f'(x) / c
+        if (isConst(arg1)) {
+          return new OperatorNode('/', 'divide', [_derivative(arg0, isConst), arg1]);
+        }
+
+        // Reciprocal Rule, d/dx(c / f(x)) = -c(f'(x)/f(x)^2)
+        if (isConst(arg0)) {
+          return new OperatorNode('*', 'multiply', [new OperatorNode('-', 'unaryMinus', [arg0]), new OperatorNode('/', 'divide', [_derivative(arg1, isConst), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])])]);
+        }
+
+        // Quotient rule, d/dx(f(x) / g(x)) = (f'(x)g(x) - f(x)g'(x)) / g(x)^2
+        return new OperatorNode('/', 'divide', [new OperatorNode('-', 'subtract', [new OperatorNode('*', 'multiply', [_derivative(arg0, isConst), arg1.clone()]), new OperatorNode('*', 'multiply', [arg0.clone(), _derivative(arg1, isConst)])]), new OperatorNode('^', 'pow', [arg1.clone(), createConstantNode(2)])]);
+      }
+      if (node.op === '^' && node.isBinary()) {
+        var _arg = node.args[0];
+        var _arg2 = node.args[1];
+        if (isConst(_arg)) {
+          // If is secretly constant; 0^f(x) = 1 (in JS), 1^f(x) = 1
+          if (isConstantNode(_arg) && (isZero(_arg.value) || equal(_arg.value, 1))) {
+            return createConstantNode(0);
+          }
+
+          // d/dx(c^f(x)) = c^f(x)*ln(c)*f'(x)
+          return new OperatorNode('*', 'multiply', [node, new OperatorNode('*', 'multiply', [new FunctionNode('log', [_arg.clone()]), _derivative(_arg2.clone(), isConst)])]);
+        }
+        if (isConst(_arg2)) {
+          if (isConstantNode(_arg2)) {
+            // If is secretly constant; f(x)^0 = 1 -> d/dx(1) = 0
+            if (isZero(_arg2.value)) {
+              return createConstantNode(0);
+            }
+            // Ignore exponent; f(x)^1 = f(x)
+            if (equal(_arg2.value, 1)) {
+              return _derivative(_arg, isConst);
+            }
+          }
+
+          // Elementary Power Rule, d/dx(f(x)^c) = c*f'(x)*f(x)^(c-1)
+          var powMinusOne = new OperatorNode('^', 'pow', [_arg.clone(), new OperatorNode('-', 'subtract', [_arg2, createConstantNode(1)])]);
+          return new OperatorNode('*', 'multiply', [_arg2.clone(), new OperatorNode('*', 'multiply', [_derivative(_arg, isConst), powMinusOne])]);
+        }
+
+        // Functional Power Rule, d/dx(f^g) = f^g*[f'*(g/f) + g'ln(f)]
+        return new OperatorNode('*', 'multiply', [new OperatorNode('^', 'pow', [_arg.clone(), _arg2.clone()]), new OperatorNode('+', 'add', [new OperatorNode('*', 'multiply', [_derivative(_arg, isConst), new OperatorNode('/', 'divide', [_arg2.clone(), _arg.clone()])]), new OperatorNode('*', 'multiply', [_derivative(_arg2, isConst), new FunctionNode('log', [_arg.clone()])])])]);
+      }
+      throw new Error('Cannot process operator "' + node.op + '" in derivative: ' + 'the operator is not supported, undefined, or the number of arguments passed to it are not supported');
+    }
+  });
+
+  /**
+   * Helper function to create a constant node with a specific type
+   * (number, BigNumber, Fraction)
+   * @param {number} value
+   * @param {string} [valueType]
+   * @return {ConstantNode}
+   */
+  function createConstantNode(value, valueType) {
+    return new ConstantNode(numeric(value, valueType || safeNumberType(String(value), config)));
+  }
+  return derivative;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/leafCount.js b/node_modules/mathjs/lib/esm/function/algebra/leafCount.js
new file mode 100644
index 0000000..b8ea7d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/leafCount.js
@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+var name = 'leafCount';
+var dependencies = ['parse', 'typed'];
+export var createLeafCount = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    typed
+  } = _ref;
+  // This does the real work, but we don't have to recurse through
+  // a typed call if we separate it out
+  function countLeaves(node) {
+    var count = 0;
+    node.forEach(n => {
+      count += countLeaves(n);
+    });
+    return count || 1;
+  }
+
+  /**
+   * Gives the number of "leaf nodes" in the parse tree of the given expression
+   * A leaf node is one that has no subexpressions, essentially either a
+   * symbol or a constant. Note that `5!` has just one leaf, the '5'; the
+   * unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   *
+   * The `simplify()` function should generally not increase the `leafCount()`
+   * of an expression, although currently there is no guarantee that it never
+   * does so. In many cases, `simplify()` reduces the leaf count.
+   *
+   * Syntax:
+   *
+   *     math.leafCount(expr)
+   *
+   * Examples:
+   *
+   *     math.leafCount('x') // 1
+   *     math.leafCount(math.parse('a*d-b*c')) // 4
+   *     math.leafCount('[a,b;c,d][0,1]') // 6
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param {Node|string} expr    The expression to count the leaves of
+   *
+   * @return {number}  The number of leaves of `expr`
+   *
+   */
+  return typed(name, {
+    Node: function Node(expr) {
+      return countLeaves(expr);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/lyap.js b/node_modules/mathjs/lib/esm/function/algebra/lyap.js
new file mode 100644
index 0000000..007a006
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/lyap.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+var name = 'lyap';
+var dependencies = ['typed', 'matrix', 'sylvester', 'multiply', 'transpose'];
+export var createLyap = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    sylvester,
+    multiply,
+    transpose
+  } = _ref;
+  /**
+   *
+   * Solves the Continuous-time Lyapunov equation AP+PA'+Q=0 for P, where
+   * Q is an input matrix. When Q is symmetric, P is also symmetric. Notice
+   * that different equivalent definitions exist for the Continuous-time
+   * Lyapunov equation.
+   * https://en.wikipedia.org/wiki/Lyapunov_equation
+   *
+   * Syntax:
+   *
+   *     math.lyap(A, Q)
+   *
+   * Examples:
+   *
+   *     const A = [[-2, 0], [1, -4]]
+   *     const Q = [[3, 1], [1, 3]]
+   *     const P = math.lyap(A, Q)
+   *
+   * See also:
+   *
+   *     sylvester, schur
+   *
+   * @param {Matrix | Array} A  Matrix A
+   * @param {Matrix | Array} Q  Matrix Q
+   * @return {Matrix | Array} Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q
+   */
+  return typed(name, {
+    'Matrix, Matrix': function Matrix_Matrix(A, Q) {
+      return sylvester(A, transpose(A), multiply(-1, Q));
+    },
+    'Array, Matrix': function Array_Matrix(A, Q) {
+      return sylvester(matrix(A), transpose(matrix(A)), multiply(-1, Q));
+    },
+    'Matrix, Array': function Matrix_Array(A, Q) {
+      return sylvester(A, transpose(matrix(A)), matrix(multiply(-1, Q)));
+    },
+    'Array, Array': function Array_Array(A, Q) {
+      return sylvester(matrix(A), transpose(matrix(A)), matrix(multiply(-1, Q))).toArray();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/polynomialRoot.js b/node_modules/mathjs/lib/esm/function/algebra/polynomialRoot.js
new file mode 100644
index 0000000..d195254
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/polynomialRoot.js
@@ -0,0 +1,122 @@
+import { factory } from '../../utils/factory.js';
+var name = 'polynomialRoot';
+var dependencies = ['typed', 'isZero', 'equalScalar', 'add', 'subtract', 'multiply', 'divide', 'sqrt', 'unaryMinus', 'cbrt', 'typeOf', 'im', 're'];
+export var createPolynomialRoot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isZero,
+    equalScalar,
+    add,
+    subtract,
+    multiply,
+    divide,
+    sqrt,
+    unaryMinus,
+    cbrt,
+    typeOf,
+    im,
+    re
+  } = _ref;
+  /**
+   * Finds the numerical values of the distinct roots of a polynomial with real or complex coefficients.
+   * Currently operates only on linear, quadratic, and cubic polynomials using the standard
+   * formulas for the roots.
+   *
+   * Syntax:
+   *
+   *     math.polynomialRoot(constant, linearCoeff, quadraticCoeff, cubicCoeff)
+   *
+   * Examples:
+   *     // linear
+   *     math.polynomialRoot(6, 3)                                        // [-2]
+   *     math.polynomialRoot(math.complex(6,3), 3)                        // [-2 - i]
+   *     math.polynomialRoot(math.complex(6,3), math.complex(2,1))        // [-3 + 0i]
+   *     // quadratic
+   *     math.polynomialRoot(2, -3, 1)                                    // [2, 1]
+   *     math.polynomialRoot(8, 8, 2)                                     // [-2]
+   *     math.polynomialRoot(-2, 0, 1)                                    // [1.4142135623730951, -1.4142135623730951]
+   *     math.polynomialRoot(2, -2, 1)                                    // [1 + i, 1 - i]
+   *     math.polynomialRoot(math.complex(1,3), math.complex(-3, -2), 1)  // [2 + i, 1 + i]
+   *     // cubic
+   *     math.polynomialRoot(-6, 11, -6, 1)                               // [1, 3, 2]
+   *     math.polynomialRoot(-8, 0, 0, 1)                                 // [-1 - 1.7320508075688774i, 2, -1 + 1.7320508075688774i]
+   *     math.polynomialRoot(0, 8, 8, 2)                                  // [0, -2]
+   *     math.polynomialRoot(1, 1, 1, 1)                                  // [-1 + 0i, 0 - i, 0 + i]
+   *
+   * See also:
+   *     cbrt, sqrt
+   *
+   * @param {... number | Complex} coeffs
+   *     The coefficients of the polynomial, starting with with the constant coefficent, followed
+   *     by the linear coefficient and subsequent coefficients of increasing powers.
+   * @return {Array} The distinct roots of the polynomial
+   */
+
+  return typed(name, {
+    'number|Complex, ...number|Complex': (constant, restCoeffs) => {
+      var coeffs = [constant, ...restCoeffs];
+      while (coeffs.length > 0 && isZero(coeffs[coeffs.length - 1])) {
+        coeffs.pop();
+      }
+      if (coeffs.length < 2) {
+        throw new RangeError("Polynomial [".concat(constant, ", ").concat(restCoeffs, "] must have a non-zero non-constant coefficient"));
+      }
+      switch (coeffs.length) {
+        case 2:
+          // linear
+          return [unaryMinus(divide(coeffs[0], coeffs[1]))];
+        case 3:
+          {
+            // quadratic
+            var [c, b, a] = coeffs;
+            var denom = multiply(2, a);
+            var d1 = multiply(b, b);
+            var d2 = multiply(4, a, c);
+            if (equalScalar(d1, d2)) return [divide(unaryMinus(b), denom)];
+            var discriminant = sqrt(subtract(d1, d2));
+            return [divide(subtract(discriminant, b), denom), divide(subtract(unaryMinus(discriminant), b), denom)];
+          }
+        case 4:
+          {
+            // cubic, cf. https://en.wikipedia.org/wiki/Cubic_equation
+            var [d, _c, _b, _a] = coeffs;
+            var _denom = unaryMinus(multiply(3, _a));
+            var D0_1 = multiply(_b, _b);
+            var D0_2 = multiply(3, _a, _c);
+            var D1_1 = add(multiply(2, _b, _b, _b), multiply(27, _a, _a, d));
+            var D1_2 = multiply(9, _a, _b, _c);
+            if (equalScalar(D0_1, D0_2) && equalScalar(D1_1, D1_2)) {
+              return [divide(_b, _denom)];
+            }
+            var Delta0 = subtract(D0_1, D0_2);
+            var Delta1 = subtract(D1_1, D1_2);
+            var discriminant1 = add(multiply(18, _a, _b, _c, d), multiply(_b, _b, _c, _c));
+            var discriminant2 = add(multiply(4, _b, _b, _b, d), multiply(4, _a, _c, _c, _c), multiply(27, _a, _a, d, d));
+            if (equalScalar(discriminant1, discriminant2)) {
+              return [divide(subtract(multiply(4, _a, _b, _c), add(multiply(9, _a, _a, d), multiply(_b, _b, _b))), multiply(_a, Delta0)),
+              // simple root
+              divide(subtract(multiply(9, _a, d), multiply(_b, _c)), multiply(2, Delta0)) // double root
+              ];
+            }
+            // OK, we have three distinct roots
+            var Ccubed;
+            if (equalScalar(D0_1, D0_2)) {
+              Ccubed = Delta1;
+            } else {
+              Ccubed = divide(add(Delta1, sqrt(subtract(multiply(Delta1, Delta1), multiply(4, Delta0, Delta0, Delta0)))), 2);
+            }
+            var allRoots = true;
+            var rawRoots = cbrt(Ccubed, allRoots).toArray().map(C => divide(add(_b, C, divide(Delta0, C)), _denom));
+            return rawRoots.map(r => {
+              if (typeOf(r) === 'Complex' && equalScalar(re(r), re(r) + im(r))) {
+                return re(r);
+              }
+              return r;
+            });
+          }
+        default:
+          throw new RangeError("only implemented for cubic or lower-order polynomials, not ".concat(coeffs));
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/rationalize.js b/node_modules/mathjs/lib/esm/function/algebra/rationalize.js
new file mode 100644
index 0000000..ef702ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/rationalize.js
@@ -0,0 +1,819 @@
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'rationalize';
+var dependencies = ['config', 'typed', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'parse', 'simplifyConstant', 'simplifyCore', 'simplify', '?bignumber', '?fraction', 'mathWithTransform', 'matrix', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode', 'ParenthesisNode'];
+export var createRationalize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    parse,
+    simplifyConstant,
+    simplifyCore,
+    simplify,
+    fraction,
+    bignumber,
+    mathWithTransform,
+    matrix,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode,
+    ParenthesisNode
+  } = _ref;
+  /**
+   * Transform a rationalizable expression in a rational fraction.
+   * If rational fraction is one variable polynomial then converts
+   * the numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   *
+   * Syntax:
+   *
+   *     math.rationalize(expr)
+   *     math.rationalize(expr, detailed)
+   *     math.rationalize(expr, scope)
+   *     math.rationalize(expr, scope, detailed)
+   *
+   * Examples:
+   *
+   *     math.rationalize('sin(x)+y')
+   *                   //  Error: There is an unsolved function call
+   *     math.rationalize('2x/y - y/(x+1)')
+   *                   // (2*x^2-y^2+2*x)/(x*y+y)
+   *     math.rationalize('(2x+1)^6')
+   *                   // 64*x^6+192*x^5+240*x^4+160*x^3+60*x^2+12*x+1
+   *     math.rationalize('2x/( (2x-1) / (3x+2) ) - 5x/ ( (3x+4) / (2x^2-5) ) + 3')
+   *                   // -20*x^4+28*x^3+104*x^2+6*x-12)/(6*x^2+5*x-4)
+   *     math.rationalize('x/(1-x)/(x-2)/(x-3)/(x-4) + 2x/ ( (1-2x)/(2-3x) )/ ((3-4x)/(4-5x) )') =
+   *                   // (-30*x^7+344*x^6-1506*x^5+3200*x^4-3472*x^3+1846*x^2-381*x)/
+   *                   //     (-8*x^6+90*x^5-383*x^4+780*x^3-797*x^2+390*x-72)
+   *
+   *     math.rationalize('x+x+x+y',{y:1}) // 3*x+1
+   *     math.rationalize('x+x+x+y',{})    // 3*x+y
+   *
+   *     const ret = math.rationalize('x+x+x+y',{},true)
+   *                   // ret.expression=3*x+y, ret.variables = ["x","y"]
+   *     const ret = math.rationalize('-2+5x^2',{},true)
+   *                   // ret.expression=5*x^2-2, ret.variables = ["x"], ret.coefficients=[-2,0,5]
+   *
+   * See also:
+   *
+   *     simplify
+   *
+   * @param  {Node|string} expr    The expression to check if is a polynomial expression
+   * @param  {Object|boolean}      optional scope of expression or true for already evaluated rational expression at input
+   * @param  {Boolean}  detailed   optional True if return an object, false if return expression node (default)
+   *
+   * @return {Object | Node}    The rational polynomial of `expr` or an object
+   *            `{expression, numerator, denominator, variables, coefficients}`, where
+   *              `expression` is a `Node` with the node simplified expression,
+   *              `numerator` is a `Node` with the simplified numerator of expression,
+   *              `denominator` is a `Node` or `boolean` with the simplified denominator or `false` (if there is no denominator),
+   *              `variables` is an array with variable names,
+   *              and `coefficients` is an array with coefficients of numerator sorted by increased exponent
+   *           {Expression Node}  node simplified expression
+   *
+   */
+  function _rationalize(expr) {
+    var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var detailed = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    var setRules = rulesRationalize(); // Rules for change polynomial in near canonical form
+    var polyRet = polynomial(expr, scope, true, setRules.firstRules); // Check if expression is a rationalizable polynomial
+    var nVars = polyRet.variables.length;
+    var noExactFractions = {
+      exactFractions: false
+    };
+    var withExactFractions = {
+      exactFractions: true
+    };
+    expr = polyRet.expression;
+    if (nVars >= 1) {
+      // If expression in not a constant
+      expr = expandPower(expr); // First expand power of polynomials (cannot be made from rules!)
+      var sBefore; // Previous expression
+      var rules;
+      var eDistrDiv = true;
+      var redoInic = false;
+      // Apply the initial rules, including succ div rules:
+      expr = simplify(expr, setRules.firstRules, {}, noExactFractions);
+      var s;
+      while (true) {
+        // Alternate applying successive division rules and distr.div.rules
+        // until there are no more changes:
+        rules = eDistrDiv ? setRules.distrDivRules : setRules.sucDivRules;
+        expr = simplify(expr, rules, {}, withExactFractions);
+        eDistrDiv = !eDistrDiv; // Swap between Distr.Div and Succ. Div. Rules
+
+        s = expr.toString();
+        if (s === sBefore) {
+          break; // No changes : end of the loop
+        }
+        redoInic = true;
+        sBefore = s;
+      }
+      if (redoInic) {
+        // Apply first rules again without succ div rules (if there are changes)
+        expr = simplify(expr, setRules.firstRulesAgain, {}, noExactFractions);
+      }
+      // Apply final rules:
+      expr = simplify(expr, setRules.finalRules, {}, noExactFractions);
+    } // NVars >= 1
+
+    var coefficients = [];
+    var retRationalize = {};
+    if (expr.type === 'OperatorNode' && expr.isBinary() && expr.op === '/') {
+      // Separate numerator from denominator
+      if (nVars === 1) {
+        expr.args[0] = polyToCanonical(expr.args[0], coefficients);
+        expr.args[1] = polyToCanonical(expr.args[1]);
+      }
+      if (detailed) {
+        retRationalize.numerator = expr.args[0];
+        retRationalize.denominator = expr.args[1];
+      }
+    } else {
+      if (nVars === 1) {
+        expr = polyToCanonical(expr, coefficients);
+      }
+      if (detailed) {
+        retRationalize.numerator = expr;
+        retRationalize.denominator = null;
+      }
+    }
+    // nVars
+
+    if (!detailed) return expr;
+    retRationalize.coefficients = coefficients;
+    retRationalize.variables = polyRet.variables;
+    retRationalize.expression = expr;
+    return retRationalize;
+  }
+  return typed(name, {
+    Node: _rationalize,
+    'Node, boolean': (expr, detailed) => _rationalize(expr, {}, detailed),
+    'Node, Object': _rationalize,
+    'Node, Object, boolean': _rationalize
+  }); // end of typed rationalize
+
+  /**
+   *  Function to simplify an expression using an optional scope and
+   *  return it if the expression is a polynomial expression, i.e.
+   *  an expression with one or more variables and the operators
+   *  +, -, *, and ^, where the exponent can only be a positive integer.
+   *
+   * Syntax:
+   *
+   *     polynomial(expr,scope,extended, rules)
+   *
+   * @param  {Node | string} expr     The expression to simplify and check if is polynomial expression
+   * @param  {object} scope           Optional scope for expression simplification
+   * @param  {boolean} extended       Optional. Default is false. When true allows divide operator.
+   * @param  {array}  rules           Optional. Default is no rule.
+   *
+   *
+   * @return {Object}
+   *            {Object} node:   node simplified expression
+   *            {Array}  variables:  variable names
+   */
+  function polynomial(expr, scope, extended, rules) {
+    var variables = [];
+    var node = simplify(expr, rules, scope, {
+      exactFractions: false
+    }); // Resolves any variables and functions with all defined parameters
+    extended = !!extended;
+    var oper = '+-*' + (extended ? '/' : '');
+    recPoly(node);
+    var retFunc = {};
+    retFunc.expression = node;
+    retFunc.variables = variables;
+    return retFunc;
+
+    // -------------------------------------------------------------------------------------------------------
+
+    /**
+     *  Function to simplify an expression using an optional scope and
+     *  return it if the expression is a polynomial expression, i.e.
+     *  an expression with one or more variables and the operators
+     *  +, -, *, and ^, where the exponent can only be a positive integer.
+     *
+     * Syntax:
+     *
+     *     recPoly(node)
+     *
+     *
+     * @param  {Node} node               The current sub tree expression in recursion
+     *
+     * @return                           nothing, throw an exception if error
+     */
+    function recPoly(node) {
+      var tp = node.type; // node type
+      if (tp === 'FunctionNode') {
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        if (node.op === '^') {
+          // TODO: handle negative exponents like in '1/x^(-2)'
+          if (node.args[1].type !== 'ConstantNode' || !isInteger(parseFloat(node.args[1].value))) {
+            throw new Error('There is a non-integer exponent');
+          } else {
+            recPoly(node.args[0]);
+          }
+        } else {
+          if (!oper.includes(node.op)) {
+            throw new Error('Operator ' + node.op + ' invalid in polynomial expression');
+          }
+          for (var i = 0; i < node.args.length; i++) {
+            recPoly(node.args[i]);
+          }
+        } // type of operator
+      } else if (tp === 'SymbolNode') {
+        var _name = node.name; // variable name
+        var pos = variables.indexOf(_name);
+        if (pos === -1) {
+          // new variable in expression
+          variables.push(_name);
+        }
+      } else if (tp === 'ParenthesisNode') {
+        recPoly(node.content);
+      } else if (tp !== 'ConstantNode') {
+        throw new Error('type ' + tp + ' is not allowed in polynomial expression');
+      }
+    } // end of recPoly
+  } // end of polynomial
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   * Return a rule set to rationalize an polynomial expression in rationalize
+   *
+   * Syntax:
+   *
+   *     rulesRationalize()
+   *
+   * @return {array}        rule set to rationalize an polynomial expression
+   */
+  function rulesRationalize() {
+    var oldRules = [simplifyCore,
+    // sCore
+    {
+      l: 'n+n',
+      r: '2*n'
+    }, {
+      l: 'n+-n',
+      r: '0'
+    }, simplifyConstant,
+    // sConstant
+    {
+      l: 'n*(n1^-1)',
+      r: 'n/n1'
+    }, {
+      l: 'n*n1^-n2',
+      r: 'n/n1^n2'
+    }, {
+      l: 'n1^-1',
+      r: '1/n1'
+    }, {
+      l: 'n*(n1/n2)',
+      r: '(n*n1)/n2'
+    }, {
+      l: '1*n',
+      r: 'n'
+    }];
+    var rulesFirst = [{
+      l: '(-n1)/(-n2)',
+      r: 'n1/n2'
+    },
+    // Unary division
+    {
+      l: '(-n1)*(-n2)',
+      r: 'n1*n2'
+    },
+    // Unary multiplication
+    {
+      l: 'n1--n2',
+      r: 'n1+n2'
+    },
+    // '--' elimination
+    {
+      l: 'n1-n2',
+      r: 'n1+(-n2)'
+    },
+    // Subtraction turn into add with un�ry minus
+    {
+      l: '(n1+n2)*n3',
+      r: '(n1*n3 + n2*n3)'
+    },
+    // Distributive 1
+    {
+      l: 'n1*(n2+n3)',
+      r: '(n1*n2+n1*n3)'
+    },
+    // Distributive 2
+    {
+      l: 'c1*n + c2*n',
+      r: '(c1+c2)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n + n',
+      r: '(c1+1)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n - c2*n',
+      r: '(c1-c2)*n'
+    },
+    // Joining constants
+    {
+      l: 'c1*n - n',
+      r: '(c1-1)*n'
+    },
+    // Joining constants
+    {
+      l: 'v/c',
+      r: '(1/c)*v'
+    },
+    // variable/constant (new!)
+    {
+      l: 'v/-c',
+      r: '-(1/c)*v'
+    },
+    // variable/constant (new!)
+    {
+      l: '-v*-c',
+      r: 'c*v'
+    },
+    // Inversion constant and variable 1
+    {
+      l: '-v*c',
+      r: '-c*v'
+    },
+    // Inversion constant and variable 2
+    {
+      l: 'v*-c',
+      r: '-c*v'
+    },
+    // Inversion constant and variable 3
+    {
+      l: 'v*c',
+      r: 'c*v'
+    },
+    // Inversion constant and variable 4
+    {
+      l: '-(-n1*n2)',
+      r: '(n1*n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(n1*n2)',
+      r: '(-n1*n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(-n1+n2)',
+      r: '(n1-n2)'
+    },
+    // Unary propagation
+    {
+      l: '-(n1+n2)',
+      r: '(-n1-n2)'
+    },
+    // Unary propagation
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    },
+    // Power to Power
+    {
+      l: '-(-n1/n2)',
+      r: '(n1/n2)'
+    },
+    // Division and Unary
+    {
+      l: '-(n1/n2)',
+      r: '(-n1/n2)'
+    }]; // Divisao and Unary
+
+    var rulesDistrDiv = [{
+      l: '(n1/n2 + n3/n4)',
+      r: '((n1*n4 + n3*n2)/(n2*n4))'
+    },
+    // Sum of fractions
+    {
+      l: '(n1/n2 + n3)',
+      r: '((n1 + n3*n2)/n2)'
+    },
+    // Sum fraction with number 1
+    {
+      l: '(n1 + n2/n3)',
+      r: '((n1*n3 + n2)/n3)'
+    }]; // Sum fraction with number 1
+
+    var rulesSucDiv = [{
+      l: '(n1/(n2/n3))',
+      r: '((n1*n3)/n2)'
+    },
+    // Division simplification
+    {
+      l: '(n1/n2/n3)',
+      r: '(n1/(n2*n3))'
+    }];
+    var setRules = {}; // rules set in 4 steps.
+
+    // All rules => infinite loop
+    // setRules.allRules =oldRules.concat(rulesFirst,rulesDistrDiv,rulesSucDiv)
+
+    setRules.firstRules = oldRules.concat(rulesFirst, rulesSucDiv); // First rule set
+    setRules.distrDivRules = rulesDistrDiv; // Just distr. div. rules
+    setRules.sucDivRules = rulesSucDiv; // Jus succ. div. rules
+    setRules.firstRulesAgain = oldRules.concat(rulesFirst); // Last rules set without succ. div.
+
+    // Division simplification
+
+    // Second rule set.
+    // There is no aggregate expression with parentesis, but the only variable can be scattered.
+    setRules.finalRules = [simplifyCore,
+    // simplify.rules[0]
+    {
+      l: 'n*-n',
+      r: '-n^2'
+    },
+    // Joining multiply with power 1
+    {
+      l: 'n*n',
+      r: 'n^2'
+    },
+    // Joining multiply with power 2
+    simplifyConstant,
+    // simplify.rules[14] old 3rd index in oldRules
+    {
+      l: 'n*-n^n1',
+      r: '-n^(n1+1)'
+    },
+    // Joining multiply with power 3
+    {
+      l: 'n*n^n1',
+      r: 'n^(n1+1)'
+    },
+    // Joining multiply with power 4
+    {
+      l: 'n^n1*-n^n2',
+      r: '-n^(n1+n2)'
+    },
+    // Joining multiply with power 5
+    {
+      l: 'n^n1*n^n2',
+      r: 'n^(n1+n2)'
+    },
+    // Joining multiply with power 6
+    {
+      l: 'n^n1*-n',
+      r: '-n^(n1+1)'
+    },
+    // Joining multiply with power 7
+    {
+      l: 'n^n1*n',
+      r: 'n^(n1+1)'
+    },
+    // Joining multiply with power 8
+    {
+      l: 'n^n1/-n',
+      r: '-n^(n1-1)'
+    },
+    // Joining multiply with power 8
+    {
+      l: 'n^n1/n',
+      r: 'n^(n1-1)'
+    },
+    // Joining division with power 1
+    {
+      l: 'n/-n^n1',
+      r: '-n^(1-n1)'
+    },
+    // Joining division with power 2
+    {
+      l: 'n/n^n1',
+      r: 'n^(1-n1)'
+    },
+    // Joining division with power 3
+    {
+      l: 'n^n1/-n^n2',
+      r: 'n^(n1-n2)'
+    },
+    // Joining division with power 4
+    {
+      l: 'n^n1/n^n2',
+      r: 'n^(n1-n2)'
+    },
+    // Joining division with power 5
+    {
+      l: 'n1+(-n2*n3)',
+      r: 'n1-n2*n3'
+    },
+    // Solving useless parenthesis 1
+    {
+      l: 'v*(-c)',
+      r: '-c*v'
+    },
+    // Solving useless unary 2
+    {
+      l: 'n1+-n2',
+      r: 'n1-n2'
+    },
+    // Solving +- together (new!)
+    {
+      l: 'v*c',
+      r: 'c*v'
+    },
+    // inversion constant with variable
+    {
+      l: '(n1^n2)^n3',
+      r: '(n1^(n2*n3))'
+    } // Power to Power
+    ];
+    return setRules;
+  } // End rulesRationalize
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   *  Expand recursively a tree node for handling with expressions with exponents
+   *  (it's not for constants, symbols or functions with exponents)
+   *  PS: The other parameters are internal for recursion
+   *
+   * Syntax:
+   *
+   *     expandPower(node)
+   *
+   * @param  {Node} node         Current expression node
+   * @param  {node} parent       Parent current node inside the recursion
+   * @param  (int}               Parent number of chid inside the rercursion
+   *
+   * @return {node}        node expression with all powers expanded.
+   */
+  function expandPower(node, parent, indParent) {
+    var tp = node.type;
+    var internal = arguments.length > 1; // TRUE in internal calls
+
+    if (tp === 'OperatorNode' && node.isBinary()) {
+      var does = false;
+      var val;
+      if (node.op === '^') {
+        // First operator: Parenthesis or UnaryMinus
+        if ((node.args[0].type === 'ParenthesisNode' || node.args[0].type === 'OperatorNode') && node.args[1].type === 'ConstantNode') {
+          // Second operator: Constant
+          val = parseFloat(node.args[1].value);
+          does = val >= 2 && isInteger(val);
+        }
+      }
+      if (does) {
+        // Exponent >= 2
+        // Before:
+        //            operator A --> Subtree
+        // parent pow
+        //            constant
+        //
+        if (val > 2) {
+          // Exponent > 2,
+          // AFTER:  (exponent > 2)
+          //             operator A --> Subtree
+          // parent  *
+          //                 deep clone (operator A --> Subtree
+          //             pow
+          //                 constant - 1
+          //
+          var nEsqTopo = node.args[0];
+          var nDirTopo = new OperatorNode('^', 'pow', [node.args[0].cloneDeep(), new ConstantNode(val - 1)]);
+          node = new OperatorNode('*', 'multiply', [nEsqTopo, nDirTopo]);
+        } else {
+          // Expo = 2 - no power
+          // AFTER:  (exponent =  2)
+          //             operator A --> Subtree
+          // parent   oper
+          //            deep clone (operator A --> Subtree)
+          //
+          node = new OperatorNode('*', 'multiply', [node.args[0], node.args[0].cloneDeep()]);
+        }
+        if (internal) {
+          // Change parent references in internal recursive calls
+          if (indParent === 'content') {
+            parent.content = node;
+          } else {
+            parent.args[indParent] = node;
+          }
+        }
+      } // does
+    } // binary OperatorNode
+
+    if (tp === 'ParenthesisNode') {
+      // Recursion
+      expandPower(node.content, node, 'content');
+    } else if (tp !== 'ConstantNode' && tp !== 'SymbolNode') {
+      for (var i = 0; i < node.args.length; i++) {
+        expandPower(node.args[i], node, i);
+      }
+    }
+    if (!internal) {
+      // return the root node
+      return node;
+    }
+  } // End expandPower
+
+  // ---------------------------------------------------------------------------------------
+  /**
+   * Auxilary function for rationalize
+   * Convert near canonical polynomial in one variable in a canonical polynomial
+   * with one term for each exponent in decreasing order
+   *
+   * Syntax:
+   *
+   *     polyToCanonical(node [, coefficients])
+   *
+   * @param  {Node | string} expr       The near canonical polynomial expression to convert in a a canonical polynomial expression
+   *
+   *        The string or tree expression needs to be at below syntax, with free spaces:
+   *         (  (^(-)? | [+-]? )cte (*)? var (^expo)?  | cte )+
+   *       Where 'var' is one variable with any valid name
+   *             'cte' are real numeric constants with any value. It can be omitted if equal than 1
+   *             'expo' are integers greater than 0. It can be omitted if equal than 1.
+   *
+   * @param  {array}   coefficients             Optional returns coefficients sorted by increased exponent
+   *
+   *
+   * @return {node}        new node tree with one variable polynomial or string error.
+   */
+  function polyToCanonical(node, coefficients) {
+    if (coefficients === undefined) {
+      coefficients = [];
+    } // coefficients.
+
+    coefficients[0] = 0; // index is the exponent
+    var o = {};
+    o.cte = 1;
+    o.oper = '+';
+
+    // fire: mark with * or ^ when finds * or ^ down tree, reset to "" with + and -.
+    //       It is used to deduce the exponent: 1 for *, 0 for "".
+    o.fire = '';
+    var maxExpo = 0; // maximum exponent
+    var varname = ''; // variable name
+
+    recurPol(node, null, o);
+    maxExpo = coefficients.length - 1;
+    var first = true;
+    var no;
+    for (var i = maxExpo; i >= 0; i--) {
+      if (coefficients[i] === 0) continue;
+      var n1 = new ConstantNode(first ? coefficients[i] : Math.abs(coefficients[i]));
+      var op = coefficients[i] < 0 ? '-' : '+';
+      if (i > 0) {
+        // Is not a constant without variable
+        var n2 = new SymbolNode(varname);
+        if (i > 1) {
+          var n3 = new ConstantNode(i);
+          n2 = new OperatorNode('^', 'pow', [n2, n3]);
+        }
+        if (coefficients[i] === -1 && first) {
+          n1 = new OperatorNode('-', 'unaryMinus', [n2]);
+        } else if (Math.abs(coefficients[i]) === 1) {
+          n1 = n2;
+        } else {
+          n1 = new OperatorNode('*', 'multiply', [n1, n2]);
+        }
+      }
+      if (first) {
+        no = n1;
+      } else if (op === '+') {
+        no = new OperatorNode('+', 'add', [no, n1]);
+      } else {
+        no = new OperatorNode('-', 'subtract', [no, n1]);
+      }
+      first = false;
+    } // for
+
+    if (first) {
+      return new ConstantNode(0);
+    } else {
+      return no;
+    }
+
+    /**
+     * Recursive auxilary function inside polyToCanonical for
+     * converting expression in canonical form
+     *
+     * Syntax:
+     *
+     *     recurPol(node, noPai, obj)
+     *
+     * @param  {Node} node        The current subpolynomial expression
+     * @param  {Node | Null}  noPai   The current parent node
+     * @param  {object}    obj        Object with many internal flags
+     *
+     * @return {}                    No return. If error, throws an exception
+     */
+    function recurPol(node, noPai, o) {
+      var tp = node.type;
+      if (tp === 'FunctionNode') {
+        // ***** FunctionName *****
+        // No function call in polynomial expression
+        throw new Error('There is an unsolved function call');
+      } else if (tp === 'OperatorNode') {
+        // ***** OperatorName *****
+        if (!'+-*^'.includes(node.op)) throw new Error('Operator ' + node.op + ' invalid');
+        if (noPai !== null) {
+          // -(unary),^  : children of *,+,-
+          if ((node.fn === 'unaryMinus' || node.fn === 'pow') && noPai.fn !== 'add' && noPai.fn !== 'subtract' && noPai.fn !== 'multiply') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+
+          // -,+,* : children of +,-
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'multiply') && noPai.fn !== 'add' && noPai.fn !== 'subtract') {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+
+          // -,+ : first child
+          if ((node.fn === 'subtract' || node.fn === 'add' || node.fn === 'unaryMinus') && o.noFil !== 0) {
+            throw new Error('Invalid ' + node.op + ' placing');
+          }
+        } // Has parent
+
+        // Firers: ^,*       Old:   ^,&,-(unary): firers
+        if (node.op === '^' || node.op === '*') {
+          o.fire = node.op;
+        }
+        for (var _i = 0; _i < node.args.length; _i++) {
+          // +,-: reset fire
+          if (node.fn === 'unaryMinus') o.oper = '-';
+          if (node.op === '+' || node.fn === 'subtract') {
+            o.fire = '';
+            o.cte = 1; // default if there is no constant
+            o.oper = _i === 0 ? '+' : node.op;
+          }
+          o.noFil = _i; // number of son
+          recurPol(node.args[_i], node, o);
+        } // for in children
+      } else if (tp === 'SymbolNode') {
+        // ***** SymbolName *****
+        if (node.name !== varname && varname !== '') {
+          throw new Error('There is more than one variable');
+        }
+        varname = node.name;
+        if (noPai === null) {
+          coefficients[1] = 1;
+          return;
+        }
+
+        // ^: Symbol is First child
+        if (noPai.op === '^' && o.noFil !== 0) {
+          throw new Error('In power the variable should be the first parameter');
+        }
+
+        // *: Symbol is Second child
+        if (noPai.op === '*' && o.noFil !== 1) {
+          throw new Error('In multiply the variable should be the second parameter');
+        }
+
+        // Symbol: firers '',* => it means there is no exponent above, so it's 1 (cte * var)
+        if (o.fire === '' || o.fire === '*') {
+          if (maxExpo < 1) coefficients[1] = 0;
+          coefficients[1] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(1, maxExpo);
+        }
+      } else if (tp === 'ConstantNode') {
+        var valor = parseFloat(node.value);
+        if (noPai === null) {
+          coefficients[0] = valor;
+          return;
+        }
+        if (noPai.op === '^') {
+          // cte: second  child of power
+          if (o.noFil !== 1) throw new Error('Constant cannot be powered');
+          if (!isInteger(valor) || valor <= 0) {
+            throw new Error('Non-integer exponent is not allowed');
+          }
+          for (var _i2 = maxExpo + 1; _i2 < valor; _i2++) coefficients[_i2] = 0;
+          if (valor > maxExpo) coefficients[valor] = 0;
+          coefficients[valor] += o.cte * (o.oper === '+' ? 1 : -1);
+          maxExpo = Math.max(valor, maxExpo);
+          return;
+        }
+        o.cte = valor;
+
+        // Cte: firer '' => There is no exponent and no multiplication, so the exponent is 0.
+        if (o.fire === '') {
+          coefficients[0] += o.cte * (o.oper === '+' ? 1 : -1);
+        }
+      } else {
+        throw new Error('Type ' + tp + ' is not allowed');
+      }
+    } // End of recurPol
+  } // End of polyToCanonical
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/resolve.js b/node_modules/mathjs/lib/esm/function/algebra/resolve.js
new file mode 100644
index 0000000..925cdb5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/resolve.js
@@ -0,0 +1,97 @@
+import { createMap } from '../../utils/map.js';
+import { isFunctionNode, isNode, isOperatorNode, isParenthesisNode, isSymbolNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'resolve';
+var dependencies = ['typed', 'parse', 'ConstantNode', 'FunctionNode', 'OperatorNode', 'ParenthesisNode'];
+export var createResolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse,
+    ConstantNode,
+    FunctionNode,
+    OperatorNode,
+    ParenthesisNode
+  } = _ref;
+  /**
+   * resolve(expr, scope) replaces variable nodes with their scoped values
+   *
+   * Syntax:
+   *
+   *     math.resolve(expr, scope)
+   *
+   * Examples:
+   *
+   *     math.resolve('x + y', {x:1, y:2})           // Node '1 + 2'
+   *     math.resolve(math.parse('x+y'), {x:1, y:2}) // Node '1 + 2'
+   *     math.simplify('x+y', {x:2, y: math.parse('x+x')}).toString() // "6"
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node | Node[]} node
+   *     The expression tree (or trees) to be simplified
+   * @param {Object} scope
+   *     Scope specifying variables to be resolved
+   * @return {Node | Node[]} Returns `node` with variables recursively substituted.
+   * @throws {ReferenceError}
+   *     If there is a cyclic dependency among the variables in `scope`,
+   *     resolution is impossible and a ReferenceError is thrown.
+   */
+  function _resolve(node, scope) {
+    var within = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : new Set();
+    // note `within`:
+    // `within` is not documented, since it is for internal cycle
+    // detection only
+    if (!scope) {
+      return node;
+    }
+    if (isSymbolNode(node)) {
+      if (within.has(node.name)) {
+        var variables = Array.from(within).join(', ');
+        throw new ReferenceError("recursive loop of variable definitions among {".concat(variables, "}"));
+      }
+      var value = scope.get(node.name);
+      if (isNode(value)) {
+        var nextWithin = new Set(within);
+        nextWithin.add(node.name);
+        return _resolve(value, scope, nextWithin);
+      } else if (typeof value === 'number') {
+        return parse(String(value));
+      } else if (value !== undefined) {
+        return new ConstantNode(value);
+      } else {
+        return node;
+      }
+    } else if (isOperatorNode(node)) {
+      var args = node.args.map(function (arg) {
+        return _resolve(arg, scope, within);
+      });
+      return new OperatorNode(node.op, node.fn, args, node.implicit);
+    } else if (isParenthesisNode(node)) {
+      return new ParenthesisNode(_resolve(node.content, scope, within));
+    } else if (isFunctionNode(node)) {
+      var _args = node.args.map(function (arg) {
+        return _resolve(arg, scope, within);
+      });
+      return new FunctionNode(node.name, _args);
+    }
+
+    // Otherwise just recursively resolve any children (might also work
+    // for some of the above special cases)
+    return node.map(child => _resolve(child, scope, within));
+  }
+  return typed('resolve', {
+    Node: _resolve,
+    'Node, Map | null | undefined': _resolve,
+    'Node, Object': (n, scope) => _resolve(n, createMap(scope)),
+    // For arrays and matrices, we map `self` rather than `_resolve`
+    // because resolve is fairly expensive anyway, and this way
+    // we get nice error messages if one entry in the array has wrong type.
+    'Array | Matrix': typed.referToSelf(self => A => A.map(n => self(n))),
+    'Array | Matrix, null | undefined': typed.referToSelf(self => A => A.map(n => self(n))),
+    'Array, Object': typed.referTo('Array,Map', selfAM => (A, scope) => selfAM(A, createMap(scope))),
+    'Matrix, Object': typed.referTo('Matrix,Map', selfMM => (A, scope) => selfMM(A, createMap(scope))),
+    'Array | Matrix, Map': typed.referToSelf(self => (A, scope) => A.map(n => self(n, scope)))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify.js b/node_modules/mathjs/lib/esm/function/algebra/simplify.js
new file mode 100644
index 0000000..849503a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify.js
@@ -0,0 +1,1246 @@
+import { isParenthesisNode } from '../../utils/is.js';
+import { isConstantNode, isVariableNode, isNumericNode, isConstantExpression } from './simplify/wildcards.js';
+import { factory } from '../../utils/factory.js';
+import { createUtil } from './simplify/util.js';
+import { hasOwnProperty } from '../../utils/object.js';
+import { createEmptyMap, createMap } from '../../utils/map.js';
+var name = 'simplify';
+var dependencies = ['typed', 'parse', 'equal', 'resolve', 'simplifyConstant', 'simplifyCore', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode', 'replacer'];
+export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse,
+    equal,
+    resolve,
+    simplifyConstant,
+    simplifyCore,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode,
+    replacer
+  } = _ref;
+  var {
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    unflattenr,
+    unflattenl,
+    createMakeNodeFunction,
+    defaultContext,
+    realContext,
+    positiveContext
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+
+  /**
+   * Simplify an expression tree.
+   *
+   * A list of rules are applied to an expression, repeating over the list until
+   * no further changes are made.
+   * It's possible to pass a custom set of rules to the function as second
+   * argument. A rule can be specified as an object, string, or function:
+   *
+   *     const rules = [
+   *       { l: 'n1*n3 + n2*n3', r: '(n1+n2)*n3' },
+   *       'n1*n3 + n2*n3 -> (n1+n2)*n3',
+   *       function (node) {
+   *         // ... return a new node or return the node unchanged
+   *         return node
+   *       }
+   *     ]
+   *
+   * String and object rules consist of a left and right pattern. The left is
+   * used to match against the expression and the right determines what matches
+   * are replaced with. The main difference between a pattern and a normal
+   * expression is that variables starting with the following characters are
+   * interpreted as wildcards:
+   *
+   * - 'n' - Matches any node [Node]
+   * - 'c' - Matches a constant literal (5 or 3.2) [ConstantNode]
+   * - 'cl' - Matches a constant literal; same as c [ConstantNode]
+   * - 'cd' - Matches a decimal literal (5 or -3.2) [ConstantNode or unaryMinus wrapping a ConstantNode]
+   * - 'ce' - Matches a constant expression (-5 or √3) [Expressions consisting of only ConstantNodes, functions, and operators]
+   * - 'v' - Matches a variable; anything not matched by c (-5 or x) [Node that is not a ConstantNode]
+   * - 'vl' - Matches a variable literal (x or y) [SymbolNode]
+   * - 'vd' - Matches a non-decimal expression; anything not matched by cd (x or √3) [Node that is not a ConstantNode or unaryMinus that is wrapping a ConstantNode]
+   * - 've' - Matches a variable expression; anything not matched by ce (x or 2x) [Expressions that contain a SymbolNode or other non-constant term]
+   *
+   * The default list of rules is exposed on the function as `simplify.rules`
+   * and can be used as a basis to built a set of custom rules. Note that since
+   * the `simplifyCore` function is in the default list of rules, by default
+   * simplify will convert any function calls in the expression that have
+   * operator equivalents to their operator forms.
+   *
+   * To specify a rule as a string, separate the left and right pattern by '->'
+   * When specifying a rule as an object, the following keys are meaningful:
+   * - l - the left pattern
+   * - r - the right pattern
+   * - s - in lieu of l and r, the string form that is broken at -> to give them
+   * - repeat - whether to repeat this rule until the expression stabilizes
+   * - assuming - gives a context object, as in the 'context' option to
+   *     simplify. Every property in the context object must match the current
+   *     context in order, or else the rule will not be applied.
+   * - imposeContext - gives a context object, as in the 'context' option to
+   *     simplify. Any settings specified will override the incoming context
+   *     for all matches of this rule.
+   *
+   * For more details on the theory, see:
+   *
+   * - [Strategies for simplifying math expressions (Stackoverflow)](https://stackoverflow.com/questions/7540227/strategies-for-simplifying-math-expressions)
+   * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
+   *
+   *  An optional `options` argument can be passed as last argument of `simplify`.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+   *    and any changes to it, along with the rule responsible, to console
+   *  - `context` (simplify.defaultContext): an object giving properties of
+   *    each operator, which determine what simplifications are allowed. The
+   *    currently meaningful properties are commutative, associative,
+   *    total (whether the operation is defined for all arguments), and
+   *    trivial (whether the operation applied to a single argument leaves
+   *    that argument unchanged). The default context is very permissive and
+   *    allows almost all simplifications. Only properties differing from
+   *    the default need to be specified; the default context is used as a
+   *    fallback. Additional contexts `simplify.realContext` and
+   *    `simplify.positiveContext` are supplied to cause simplify to perform
+   *    just simplifications guaranteed to preserve all values of the expression
+   *    assuming all variables and subexpressions are real numbers or
+   *    positive real numbers, respectively. (Note that these are in some cases
+   *    more restrictive than the default context; for example, the default
+   *    context will allow `x/x` to simplify to 1, whereas
+   *    `simplify.realContext` will not, as `0/0` is not equal to 1.)
+   *  - `exactFractions` (true): whether to try to convert all constants to
+   *    exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+   *    be expressed as fractions only when both numerator and denominator
+   *    are smaller than `fractionsLimit`.
+   *
+   * Syntax:
+   *
+   *     math.simplify(expr)
+   *     math.simplify(expr, rules)
+   *     math.simplify(expr, rules)
+   *     math.simplify(expr, rules, scope)
+   *     math.simplify(expr, rules, scope, options)
+   *     math.simplify(expr, scope)
+   *     math.simplify(expr, scope, options)
+   *
+   * Examples:
+   *
+   *     math.simplify('2 * 1 * x ^ (2 - 1)')      // Node "2 * x"
+   *     math.simplify('2 * 3 * x', {x: 4})        // Node "24"
+   *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
+   *     math.simplify(f)                          // Node "2 * x"
+   *     math.simplify('0.4 * x', {}, {exactFractions: true})  // Node "x * 2 / 5"
+   *     math.simplify('0.4 * x', {}, {exactFractions: false}) // Node "0.4 * x"
+   *
+   * See also:
+   *
+   *     simplifyCore, derivative, evaluate, parse, rationalize, resolve
+   *
+   * @param {Node | string} expr
+   *            The expression to be simplified
+   * @param {SimplifyRule[]} [rules]
+   *            Optional list with custom rules
+   * @param {Object} [scope] Optional scope with variables
+   * @param {SimplifyOptions} [options] Optional configuration settings
+   * @return {Node} Returns the simplified form of `expr`
+   */
+  typed.addConversion({
+    from: 'Object',
+    to: 'Map',
+    convert: createMap
+  });
+  var simplify = typed('simplify', {
+    Node: _simplify,
+    'Node, Map': (expr, scope) => _simplify(expr, false, scope),
+    'Node, Map, Object': (expr, scope, options) => _simplify(expr, false, scope, options),
+    'Node, Array': _simplify,
+    'Node, Array, Map': _simplify,
+    'Node, Array, Map, Object': _simplify
+  });
+  typed.removeConversion({
+    from: 'Object',
+    to: 'Map',
+    convert: createMap
+  });
+  simplify.defaultContext = defaultContext;
+  simplify.realContext = realContext;
+  simplify.positiveContext = positiveContext;
+  function removeParens(node) {
+    return node.transform(function (node) {
+      return isParenthesisNode(node) ? removeParens(node.content) : node;
+    });
+  }
+
+  // All constants that are allowed in rules
+  var SUPPORTED_CONSTANTS = {
+    true: true,
+    false: true,
+    e: true,
+    i: true,
+    Infinity: true,
+    LN2: true,
+    LN10: true,
+    LOG2E: true,
+    LOG10E: true,
+    NaN: true,
+    phi: true,
+    pi: true,
+    SQRT1_2: true,
+    SQRT2: true,
+    tau: true
+    // null: false,
+    // undefined: false,
+    // version: false,
+  };
+
+  // Array of strings, used to build the ruleSet.
+  // Each l (left side) and r (right side) are parsed by
+  // the expression parser into a node tree.
+  // Left hand sides are matched to subtrees within the
+  // expression to be parsed and replaced with the right
+  // hand side.
+  // TODO: Add support for constraints on constants (either in the form of a '=' expression or a callback [callback allows things like comparing symbols alphabetically])
+  // To evaluate lhs constants for rhs constants, use: { l: 'c1+c2', r: 'c3', evaluate: 'c3 = c1 + c2' }. Multiple assignments are separated by ';' in block format.
+  // It is possible to get into an infinite loop with conflicting rules
+  simplify.rules = [simplifyCore,
+  // { l: 'n+0', r: 'n' },     // simplifyCore
+  // { l: 'n^0', r: '1' },     // simplifyCore
+  // { l: '0*n', r: '0' },     // simplifyCore
+  // { l: 'n/n', r: '1'},      // simplifyCore
+  // { l: 'n^1', r: 'n' },     // simplifyCore
+  // { l: '+n1', r:'n1' },     // simplifyCore
+  // { l: 'n--n1', r:'n+n1' }, // simplifyCore
+  {
+    l: 'log(e)',
+    r: '1'
+  },
+  // temporary rules
+  // Note initially we tend constants to the right because like-term
+  // collection prefers the left, and we would rather collect nonconstants
+  {
+    s: 'n-n1 -> n+-n1',
+    // temporarily replace 'subtract' so we can further flatten the 'add' operator
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n-n -> 0',
+    // partial alternative when we can't always subtract
+    assuming: {
+      subtract: {
+        total: false
+      }
+    }
+  }, {
+    s: '-(cl*v) -> v * (-cl)',
+    // make non-constant terms positive
+    assuming: {
+      multiply: {
+        commutative: true
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(cl*v) -> (-cl) * v',
+    // non-commutative version, part 1
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: '-(v*cl) -> v * (-cl)',
+    // non-commutative version, part 2
+    assuming: {
+      multiply: {
+        commutative: false
+      },
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    l: '-(n1/n2)',
+    r: '-n1/n2'
+  }, {
+    l: '-v',
+    r: 'v * (-1)'
+  },
+  // finish making non-constant terms positive
+  {
+    l: '(n1 + n2)*(-1)',
+    r: 'n1*(-1) + n2*(-1)',
+    repeat: true
+  },
+  // expand negations to achieve as much sign cancellation as possible
+  {
+    l: 'n/n1^n2',
+    r: 'n*n1^-n2'
+  },
+  // temporarily replace 'divide' so we can further flatten the 'multiply' operator
+  {
+    l: 'n/n1',
+    r: 'n*n1^-1'
+  }, {
+    s: '(n1*n2)^n3 -> n1^n3 * n2^n3',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: '(n1*n2)^(-1) -> n2^(-1) * n1^(-1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // expand nested exponentiation
+  {
+    s: '(n ^ n1) ^ n2 -> n ^ (n1 * n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // 1/(1/n) = n needs 1/n to exist
+  },
+  // collect like factors; into a sum, only do this for nonconstants
+  {
+    l: ' vd   * ( vd   * n1 + n2)',
+    r: 'vd^2       * n1 +  vd   * n2'
+  }, {
+    s: ' vd   * (vd^n4 * n1 + n2)   ->  vd^(1+n4)  * n1 +  vd   * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // v*1/v = v^(1+-1) needs 1/v
+  }, {
+    s: 'vd^n3 * ( vd   * n1 + n2)   ->  vd^(n3+1)  * n1 + vd^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    s: 'vd^n3 * (vd^n4 * n1 + n2)   ->  vd^(n3+n4) * n1 + vd^n3 * n2',
+    assuming: {
+      divide: {
+        total: true
+      }
+    }
+  }, {
+    l: 'n*n',
+    r: 'n^2'
+  }, {
+    s: 'n * n^n1 -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // n*1/n = n^(-1+1) needs 1/n
+  }, {
+    s: 'n^n1 * n^n2 -> n^(n1+n2)',
+    assuming: {
+      divide: {
+        total: true
+      }
+    } // ditto for n^2*1/n^2
+  },
+  // Unfortunately, to deal with more complicated cancellations, it
+  // becomes necessary to simplify constants twice per pass. It's not
+  // terribly expensive compared to matching rules, so this should not
+  // pose a performance problem.
+  simplifyConstant,
+  // First: before collecting like terms
+
+  // collect like terms
+  {
+    s: 'n+n -> 2*n',
+    assuming: {
+      add: {
+        total: true
+      }
+    } // 2 = 1 + 1 needs to exist
+  }, {
+    l: 'n+-n',
+    r: '0'
+  }, {
+    l: 'vd*n + vd',
+    r: 'vd*(n+1)'
+  },
+  // NOTE: leftmost position is special:
+  {
+    l: 'n3*n1 + n3*n2',
+    r: 'n3*(n1+n2)'
+  },
+  // All sub-monomials tried there.
+  {
+    l: 'n3^(-n4)*n1 +   n3  * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+1) *n2)'
+  }, {
+    l: 'n3^(-n4)*n1 + n3^n5 * n2',
+    r: 'n3^(-n4)*(n1 + n3^(n4+n5)*n2)'
+  },
+  // noncommutative additional cases (term collection & factoring)
+  {
+    s: 'n*vd + vd -> (n+1)*vd',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'vd + n*vd -> (1+n)*vd',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3 + n2*n3 -> (n1+n2)*n3',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n^n1 * n -> n^(n1+1)',
+    assuming: {
+      divide: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3    -> (n1 + n2*n3^(n4 +  1))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'n1*n3^(-n4) + n2 * n3^n5 -> (n1 + n2*n3^(n4 + n5))*n3^(-n4)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    l: 'n*cd + cd',
+    r: '(n+1)*cd'
+  }, {
+    s: 'cd*n + cd -> cd*(n+1)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'cd + cd*n -> cd*(1+n)',
+    assuming: {
+      multiply: {
+        commutative: false
+      }
+    }
+  }, simplifyConstant,
+  // Second: before returning expressions to "standard form"
+
+  // make factors positive (and undo 'make non-constant terms positive')
+  {
+    s: '(-n)*n1 -> -(n*n1)',
+    assuming: {
+      subtract: {
+        total: true
+      }
+    }
+  }, {
+    s: 'n1*(-n) -> -(n1*n)',
+    // in case * non-commutative
+    assuming: {
+      subtract: {
+        total: true
+      },
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // final ordering of constants
+  {
+    s: 'ce+ve -> ve+ce',
+    assuming: {
+      add: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      add: {
+        commutative: false
+      }
+    }
+  }, {
+    s: 'vd*cd -> cd*vd',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    },
+    imposeContext: {
+      multiply: {
+        commutative: false
+      }
+    }
+  },
+  // undo temporary rules
+  // { l: '(-1) * n', r: '-n' }, // #811 added test which proved this is redundant
+  {
+    l: 'n+-n1',
+    r: 'n-n1'
+  },
+  // undo replace 'subtract'
+  {
+    l: 'n+-(n1)',
+    r: 'n-(n1)'
+  }, {
+    s: 'n*(n1^-1) -> n/n1',
+    // undo replace 'divide'; for * commutative
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    s: 'n*n1^-n2 -> n/n1^n2',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    s: 'n^-1 -> 1/n',
+    assuming: {
+      multiply: {
+        commutative: true
+      }
+    } // o.w. / not conventional
+  }, {
+    l: 'n^1',
+    r: 'n'
+  },
+  // can be produced by power cancellation
+  {
+    s: 'n*(n1/n2) -> (n*n1)/n2',
+    // '*' before '/'
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    s: 'n-(n1+n2) -> n-n1-n2',
+    // '-' before '+'
+    assuming: {
+      addition: {
+        associative: true,
+        commutative: true
+      }
+    }
+  },
+  // { l: '(n1/n2)/n3', r: 'n1/(n2*n3)' },
+  // { l: '(n*n1)/(n*n2)', r: 'n1/n2' },
+
+  // simplifyConstant can leave an extra factor of 1, which can always
+  // be eliminated, since the identity always commutes
+  {
+    l: '1*n',
+    r: 'n',
+    imposeContext: {
+      multiply: {
+        commutative: true
+      }
+    }
+  }, {
+    s: 'n1/(n2/n3) -> (n1*n3)/n2',
+    assuming: {
+      multiply: {
+        associative: true
+      }
+    }
+  }, {
+    l: 'n1/(-n2)',
+    r: '-n1/n2'
+  }];
+
+  /**
+   * Takes any rule object as allowed by the specification in simplify
+   * and puts it in a standard form used by applyRule
+   */
+  function _canonicalizeRule(ruleObject, context) {
+    var newRule = {};
+    if (ruleObject.s) {
+      var lr = ruleObject.s.split('->');
+      if (lr.length === 2) {
+        newRule.l = lr[0];
+        newRule.r = lr[1];
+      } else {
+        throw SyntaxError('Could not parse rule: ' + ruleObject.s);
+      }
+    } else {
+      newRule.l = ruleObject.l;
+      newRule.r = ruleObject.r;
+    }
+    newRule.l = removeParens(parse(newRule.l));
+    newRule.r = removeParens(parse(newRule.r));
+    for (var prop of ['imposeContext', 'repeat', 'assuming']) {
+      if (prop in ruleObject) {
+        newRule[prop] = ruleObject[prop];
+      }
+    }
+    if (ruleObject.evaluate) {
+      newRule.evaluate = parse(ruleObject.evaluate);
+    }
+    if (isAssociative(newRule.l, context)) {
+      var nonCommutative = !isCommutative(newRule.l, context);
+      var leftExpandsym;
+      // Gen. the LHS placeholder used in this NC-context specific expansion rules
+      if (nonCommutative) leftExpandsym = _getExpandPlaceholderSymbol();
+      var makeNode = createMakeNodeFunction(newRule.l);
+      var expandsym = _getExpandPlaceholderSymbol();
+      newRule.expanded = {};
+      newRule.expanded.l = makeNode([newRule.l, expandsym]);
+      // Push the expandsym into the deepest possible branch.
+      // This helps to match the newRule against nodes returned from getSplits() later on.
+      flatten(newRule.expanded.l, context);
+      unflattenr(newRule.expanded.l, context);
+      newRule.expanded.r = makeNode([newRule.r, expandsym]);
+
+      // In and for a non-commutative context, attempting with yet additional expansion rules makes
+      // way for more matches cases of multi-arg expressions; such that associative rules (such as
+      // 'n*n -> n^2') can be applied to exprs. such as 'a * b * b' and 'a * b * b * a'.
+      if (nonCommutative) {
+        // 'Non-commutative' 1: LHS (placeholder) only
+        newRule.expandedNC1 = {};
+        newRule.expandedNC1.l = makeNode([leftExpandsym, newRule.l]);
+        newRule.expandedNC1.r = makeNode([leftExpandsym, newRule.r]);
+        // 'Non-commutative' 2: farmost LHS and RHS placeholders
+        newRule.expandedNC2 = {};
+        newRule.expandedNC2.l = makeNode([leftExpandsym, newRule.expanded.l]);
+        newRule.expandedNC2.r = makeNode([leftExpandsym, newRule.expanded.r]);
+      }
+    }
+    return newRule;
+  }
+
+  /**
+   * Parse the string array of rules into nodes
+   *
+   * Example syntax for rules:
+   *
+   * Position constants to the left in a product:
+   * { l: 'n1 * c1', r: 'c1 * n1' }
+   * n1 is any Node, and c1 is a ConstantNode.
+   *
+   * Apply difference of squares formula:
+   * { l: '(n1 - n2) * (n1 + n2)', r: 'n1^2 - n2^2' }
+   * n1, n2 mean any Node.
+   *
+   * Short hand notation:
+   * 'n1 * c1 -> c1 * n1'
+   */
+  function _buildRules(rules, context) {
+    // Array of rules to be used to simplify expressions
+    var ruleSet = [];
+    for (var i = 0; i < rules.length; i++) {
+      var rule = rules[i];
+      var newRule = void 0;
+      var ruleType = typeof rule;
+      switch (ruleType) {
+        case 'string':
+          rule = {
+            s: rule
+          };
+        /* falls through */
+        case 'object':
+          newRule = _canonicalizeRule(rule, context);
+          break;
+        case 'function':
+          newRule = rule;
+          break;
+        default:
+          throw TypeError('Unsupported type of rule: ' + ruleType);
+      }
+      // console.log('Adding rule: ' + rules[i])
+      // console.log(newRule)
+      ruleSet.push(newRule);
+    }
+    return ruleSet;
+  }
+  var _lastsym = 0;
+  function _getExpandPlaceholderSymbol() {
+    return new SymbolNode('_p' + _lastsym++);
+  }
+  function _simplify(expr, rules) {
+    var scope = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : createEmptyMap();
+    var options = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : {};
+    var debug = options.consoleDebug;
+    rules = _buildRules(rules || simplify.rules, options.context);
+    var res = resolve(expr, scope);
+    res = removeParens(res);
+    var visited = {};
+    var str = res.toString({
+      parenthesis: 'all'
+    });
+    while (!visited[str]) {
+      visited[str] = true;
+      _lastsym = 0; // counter for placeholder symbols
+      var laststr = str;
+      if (debug) console.log('Working on: ', str);
+      for (var i = 0; i < rules.length; i++) {
+        var rulestr = '';
+        if (typeof rules[i] === 'function') {
+          res = rules[i](res, options);
+          if (debug) rulestr = rules[i].name;
+        } else {
+          flatten(res, options.context);
+          res = applyRule(res, rules[i], options.context);
+          if (debug) {
+            rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+          }
+        }
+        if (debug) {
+          var newstr = res.toString({
+            parenthesis: 'all'
+          });
+          if (newstr !== laststr) {
+            console.log('Applying', rulestr, 'produced', newstr);
+            laststr = newstr;
+          }
+        }
+        /* Use left-heavy binary tree internally,
+         * since custom rule functions may expect it
+         */
+        unflattenl(res, options.context);
+      }
+      str = res.toString({
+        parenthesis: 'all'
+      });
+    }
+    return res;
+  }
+  function mapRule(nodes, rule, context) {
+    var resNodes = nodes;
+    if (nodes) {
+      for (var i = 0; i < nodes.length; ++i) {
+        var newNode = applyRule(nodes[i], rule, context);
+        if (newNode !== nodes[i]) {
+          if (resNodes === nodes) {
+            resNodes = nodes.slice();
+          }
+          resNodes[i] = newNode;
+        }
+      }
+    }
+    return resNodes;
+  }
+
+  /**
+   * Returns a simplfied form of node, or the original node if no simplification was possible.
+   *
+   * @param  {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param  {Object | Function} rule
+   * @param  {Object} context -- information about assumed properties of operators
+   * @return {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} The simplified form of `expr`, or the original node if no simplification was possible.
+   */
+  function applyRule(node, rule, context) {
+    //    console.log('Entering applyRule("', rule.l.toString({parenthesis:'all'}), '->', rule.r.toString({parenthesis:'all'}), '",', node.toString({parenthesis:'all'}),')')
+
+    // check that the assumptions for this rule are satisfied by the current
+    // context:
+    if (rule.assuming) {
+      for (var symbol in rule.assuming) {
+        for (var property in rule.assuming[symbol]) {
+          if (hasProperty(symbol, property, context) !== rule.assuming[symbol][property]) {
+            return node;
+          }
+        }
+      }
+    }
+    var mergedContext = mergeContext(rule.imposeContext, context);
+
+    // Do not clone node unless we find a match
+    var res = node;
+
+    // First replace our child nodes with their simplified versions
+    // If a child could not be simplified, applying the rule to it
+    // will have no effect since the node is returned unchanged
+    if (res instanceof OperatorNode || res instanceof FunctionNode) {
+      var newArgs = mapRule(res.args, rule, context);
+      if (newArgs !== res.args) {
+        res = res.clone();
+        res.args = newArgs;
+      }
+    } else if (res instanceof ParenthesisNode) {
+      if (res.content) {
+        var newContent = applyRule(res.content, rule, context);
+        if (newContent !== res.content) {
+          res = new ParenthesisNode(newContent);
+        }
+      }
+    } else if (res instanceof ArrayNode) {
+      var newItems = mapRule(res.items, rule, context);
+      if (newItems !== res.items) {
+        res = new ArrayNode(newItems);
+      }
+    } else if (res instanceof AccessorNode) {
+      var newObj = res.object;
+      if (res.object) {
+        newObj = applyRule(res.object, rule, context);
+      }
+      var newIndex = res.index;
+      if (res.index) {
+        newIndex = applyRule(res.index, rule, context);
+      }
+      if (newObj !== res.object || newIndex !== res.index) {
+        res = new AccessorNode(newObj, newIndex);
+      }
+    } else if (res instanceof IndexNode) {
+      var newDims = mapRule(res.dimensions, rule, context);
+      if (newDims !== res.dimensions) {
+        res = new IndexNode(newDims);
+      }
+    } else if (res instanceof ObjectNode) {
+      var changed = false;
+      var newProps = {};
+      for (var prop in res.properties) {
+        newProps[prop] = applyRule(res.properties[prop], rule, context);
+        if (newProps[prop] !== res.properties[prop]) {
+          changed = true;
+        }
+      }
+      if (changed) {
+        res = new ObjectNode(newProps);
+      }
+    }
+
+    // Try to match a rule against this node
+    var repl = rule.r;
+    var matches = _ruleMatch(rule.l, res, mergedContext)[0];
+
+    // If the rule is associative operator, we can try matching it while allowing additional terms.
+    // This allows us to match rules like 'n+n' to the expression '(1+x)+x' or even 'x+1+x' if the operator is commutative.
+    if (!matches && rule.expanded) {
+      repl = rule.expanded.r;
+      matches = _ruleMatch(rule.expanded.l, res, mergedContext)[0];
+    }
+    // Additional, non-commutative context expansion-rules
+    if (!matches && rule.expandedNC1) {
+      repl = rule.expandedNC1.r;
+      matches = _ruleMatch(rule.expandedNC1.l, res, mergedContext)[0];
+      if (!matches) {
+        // Existence of NC1 implies NC2
+        repl = rule.expandedNC2.r;
+        matches = _ruleMatch(rule.expandedNC2.l, res, mergedContext)[0];
+      }
+    }
+    if (matches) {
+      // const before = res.toString({parenthesis: 'all'})
+
+      // Create a new node by cloning the rhs of the matched rule
+      // we keep any implicit multiplication state if relevant
+      var implicit = res.implicit;
+      res = repl.clone();
+      if (implicit && 'implicit' in repl) {
+        res.implicit = true;
+      }
+
+      // Replace placeholders with their respective nodes without traversing deeper into the replaced nodes
+      res = res.transform(function (node) {
+        if (node.isSymbolNode && hasOwnProperty(matches.placeholders, node.name)) {
+          return matches.placeholders[node.name].clone();
+        } else {
+          return node;
+        }
+      });
+
+      // const after = res.toString({parenthesis: 'all'})
+      // console.log('Simplified ' + before + ' to ' + after)
+    }
+    if (rule.repeat && res !== node) {
+      res = applyRule(res, rule, context);
+    }
+    return res;
+  }
+
+  /**
+   * Get (binary) combinations of a flattened binary node
+   * e.g. +(node1, node2, node3) -> [
+   *        +(node1,  +(node2, node3)),
+   *        +(node2,  +(node1, node3)),
+   *        +(node3,  +(node1, node2))]
+   *
+   */
+  function getSplits(node, context) {
+    var res = [];
+    var right, rightArgs;
+    var makeNode = createMakeNodeFunction(node);
+    if (isCommutative(node, context)) {
+      for (var i = 0; i < node.args.length; i++) {
+        rightArgs = node.args.slice(0);
+        rightArgs.splice(i, 1);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([node.args[i], right]));
+      }
+    } else {
+      // Keep order, but try all parenthesizations
+      for (var _i = 1; _i < node.args.length; _i++) {
+        var left = node.args[0];
+        if (_i > 1) {
+          left = makeNode(node.args.slice(0, _i));
+        }
+        rightArgs = node.args.slice(_i);
+        right = rightArgs.length === 1 ? rightArgs[0] : makeNode(rightArgs);
+        res.push(makeNode([left, right]));
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Returns the set union of two match-placeholders or null if there is a conflict.
+   */
+  function mergeMatch(match1, match2) {
+    var res = {
+      placeholders: {}
+    };
+
+    // Some matches may not have placeholders; this is OK
+    if (!match1.placeholders && !match2.placeholders) {
+      return res;
+    } else if (!match1.placeholders) {
+      return match2;
+    } else if (!match2.placeholders) {
+      return match1;
+    }
+
+    // Placeholders with the same key must match exactly
+    for (var key in match1.placeholders) {
+      if (hasOwnProperty(match1.placeholders, key)) {
+        res.placeholders[key] = match1.placeholders[key];
+        if (hasOwnProperty(match2.placeholders, key)) {
+          if (!_exactMatch(match1.placeholders[key], match2.placeholders[key])) {
+            return null;
+          }
+        }
+      }
+    }
+    for (var _key in match2.placeholders) {
+      if (hasOwnProperty(match2.placeholders, _key)) {
+        res.placeholders[_key] = match2.placeholders[_key];
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Combine two lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   */
+  function combineChildMatches(list1, list2) {
+    var res = [];
+    if (list1.length === 0 || list2.length === 0) {
+      return res;
+    }
+    var merged;
+    for (var i1 = 0; i1 < list1.length; i1++) {
+      for (var i2 = 0; i2 < list2.length; i2++) {
+        merged = mergeMatch(list1[i1], list2[i2]);
+        if (merged) {
+          res.push(merged);
+        }
+      }
+    }
+    return res;
+  }
+
+  /**
+   * Combine multiple lists of matches by applying mergeMatch to the cartesian product of two lists of matches.
+   * Each list represents matches found in one child of a node.
+   * Returns a list of unique matches.
+   */
+  function mergeChildMatches(childMatches) {
+    if (childMatches.length === 0) {
+      return childMatches;
+    }
+    var sets = childMatches.reduce(combineChildMatches);
+    var uniqueSets = [];
+    var unique = {};
+    for (var i = 0; i < sets.length; i++) {
+      var s = JSON.stringify(sets[i], replacer);
+      if (!unique[s]) {
+        unique[s] = true;
+        uniqueSets.push(sets[i]);
+      }
+    }
+    return uniqueSets;
+  }
+
+  /**
+   * Determines whether node matches rule.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} rule
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} node
+   * @param {Object} context -- provides assumed properties of operators
+   * @param {Boolean} isSplit -- whether we are in process of splitting an
+   *                    n-ary operator node into possible binary combinations.
+   *                    Defaults to false.
+   * @return {Object} Information about the match, if it exists.
+   */
+  function _ruleMatch(rule, node, context, isSplit) {
+    //    console.log('Entering _ruleMatch(' + JSON.stringify(rule) + ', ' + JSON.stringify(node) + ')')
+    //    console.log('rule = ' + rule)
+    //    console.log('node = ' + node)
+
+    //    console.log('Entering _ruleMatch(', rule.toString({parenthesis:'all'}), ', ', node.toString({parenthesis:'all'}), ', ', context, ')')
+    var res = [{
+      placeholders: {}
+    }];
+    if (rule instanceof OperatorNode && node instanceof OperatorNode || rule instanceof FunctionNode && node instanceof FunctionNode) {
+      // If the rule is an OperatorNode or a FunctionNode, then node must match exactly
+      if (rule instanceof OperatorNode) {
+        if (rule.op !== node.op || rule.fn !== node.fn) {
+          return [];
+        }
+      } else if (rule instanceof FunctionNode) {
+        if (rule.name !== node.name) {
+          return [];
+        }
+      }
+
+      // rule and node match. Search the children of rule and node.
+      if (node.args.length === 1 && rule.args.length === 1 || !isAssociative(node, context) && node.args.length === rule.args.length || isSplit) {
+        // Expect non-associative operators to match exactly,
+        // except in any order if operator is commutative
+        var childMatches = [];
+        for (var i = 0; i < rule.args.length; i++) {
+          var childMatch = _ruleMatch(rule.args[i], node.args[i], context);
+          if (childMatch.length === 0) {
+            // Child did not match, so stop searching immediately
+            break;
+          }
+          // The child matched, so add the information returned from the child to our result
+          childMatches.push(childMatch);
+        }
+        if (childMatches.length !== rule.args.length) {
+          if (!isCommutative(node, context) ||
+          // exact match in order needed
+          rule.args.length === 1) {
+            // nothing to commute
+            return [];
+          }
+          if (rule.args.length > 2) {
+            /* Need to generate all permutations and try them.
+             * It's a bit complicated, and unlikely to come up since there
+             * are very few ternary or higher operators. So punt for now.
+             */
+            throw new Error('permuting >2 commutative non-associative rule arguments not yet implemented');
+          }
+          /* Exactly two arguments, try them reversed */
+          var leftMatch = _ruleMatch(rule.args[0], node.args[1], context);
+          if (leftMatch.length === 0) {
+            return [];
+          }
+          var rightMatch = _ruleMatch(rule.args[1], node.args[0], context);
+          if (rightMatch.length === 0) {
+            return [];
+          }
+          childMatches = [leftMatch, rightMatch];
+        }
+        res = mergeChildMatches(childMatches);
+      } else if (node.args.length >= 2 && rule.args.length === 2) {
+        // node is flattened, rule is not
+        // Associative operators/functions can be split in different ways so we check if the rule
+        // matches for each of them and return their union.
+        var splits = getSplits(node, context);
+        var splitMatches = [];
+        for (var _i2 = 0; _i2 < splits.length; _i2++) {
+          var matchSet = _ruleMatch(rule, splits[_i2], context, true); // recursing at the same tree depth here
+          splitMatches = splitMatches.concat(matchSet);
+        }
+        return splitMatches;
+      } else if (rule.args.length > 2) {
+        throw Error('Unexpected non-binary associative function: ' + rule.toString());
+      } else {
+        // Incorrect number of arguments in rule and node, so no match
+        return [];
+      }
+    } else if (rule instanceof SymbolNode) {
+      // If the rule is a SymbolNode, then it carries a special meaning
+      // according to the first one or two characters of the symbol node name.
+      // These meanings are expalined in the documentation for simplify()
+      if (rule.name.length === 0) {
+        throw new Error('Symbol in rule has 0 length...!?');
+      }
+      if (SUPPORTED_CONSTANTS[rule.name]) {
+        // built-in constant must match exactly
+        if (rule.name !== node.name) {
+          return [];
+        }
+      } else {
+        // wildcards are composed of up to two alphabetic or underscore characters
+        switch (rule.name[1] >= 'a' && rule.name[1] <= 'z' ? rule.name.substring(0, 2) : rule.name[0]) {
+          case 'n':
+          case '_p':
+            // rule matches _anything_, so assign this node to the rule.name placeholder
+            // Assign node to the rule.name placeholder.
+            // Our parent will check for matches among placeholders.
+            res[0].placeholders[rule.name] = node;
+            break;
+          case 'c':
+          case 'cl':
+            // rule matches a ConstantNode
+            if (isConstantNode(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'v':
+            // rule matches anything other than a ConstantNode
+            if (!isConstantNode(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vl':
+            // rule matches VariableNode
+            if (isVariableNode(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'cd':
+            // rule matches a ConstantNode or unaryMinus-wrapped ConstantNode
+            if (isNumericNode(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'vd':
+            // rule matches anything other than a ConstantNode or unaryMinus-wrapped ConstantNode
+            if (!isNumericNode(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 'ce':
+            // rule matches expressions that have a constant value
+            if (isConstantExpression(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          case 've':
+            // rule matches expressions that do not have a constant value
+            if (!isConstantExpression(node)) {
+              res[0].placeholders[rule.name] = node;
+            } else {
+              // mis-match: rule does not encompass current node
+              return [];
+            }
+            break;
+          default:
+            throw new Error('Invalid symbol in rule: ' + rule.name);
+        }
+      }
+    } else if (rule instanceof ConstantNode) {
+      // Literal constant must match exactly
+      if (!equal(rule.value, node.value)) {
+        return [];
+      }
+    } else {
+      // Some other node was encountered which we aren't prepared for, so no match
+      return [];
+    }
+
+    // It's a match!
+
+    // console.log('_ruleMatch(' + rule.toString() + ', ' + node.toString() + ') found a match')
+    return res;
+  }
+
+  /**
+   * Determines whether p and q (and all their children nodes) are identical.
+   *
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} p
+   * @param {ConstantNode | SymbolNode | ParenthesisNode | FunctionNode | OperatorNode} q
+   * @return {Object} Information about the match, if it exists.
+   */
+  function _exactMatch(p, q) {
+    if (p instanceof ConstantNode && q instanceof ConstantNode) {
+      if (!equal(p.value, q.value)) {
+        return false;
+      }
+    } else if (p instanceof SymbolNode && q instanceof SymbolNode) {
+      if (p.name !== q.name) {
+        return false;
+      }
+    } else if (p instanceof OperatorNode && q instanceof OperatorNode || p instanceof FunctionNode && q instanceof FunctionNode) {
+      if (p instanceof OperatorNode) {
+        if (p.op !== q.op || p.fn !== q.fn) {
+          return false;
+        }
+      } else if (p instanceof FunctionNode) {
+        if (p.name !== q.name) {
+          return false;
+        }
+      }
+      if (p.args.length !== q.args.length) {
+        return false;
+      }
+      for (var i = 0; i < p.args.length; i++) {
+        if (!_exactMatch(p.args[i], q.args[i])) {
+          return false;
+        }
+      }
+    } else {
+      return false;
+    }
+    return true;
+  }
+  return simplify;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js b/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js
new file mode 100644
index 0000000..5d63949
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify/util.js
@@ -0,0 +1,261 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+import { isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+import { hasOwnProperty } from '../../../utils/object.js';
+var name = 'simplifyUtil';
+var dependencies = ['FunctionNode', 'OperatorNode', 'SymbolNode'];
+export var createUtil = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  // TODO commutative/associative properties rely on the arguments
+  // e.g. multiply is not commutative for matrices
+  // The properties should be calculated from an argument to simplify, or possibly something in math.config
+  // the other option is for typed() to specify a return type so that we can evaluate the type of arguments
+
+  /* So that properties of an operator fit on one line: */
+  var T = true;
+  var F = false;
+  var defaultName = 'defaultF';
+  var defaultContext = {
+    /*      */add: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /**/unaryPlus: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /* */subtract: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+    /* */multiply: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: T
+    },
+    /*   */divide: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    },
+    /*    */paren: {
+      trivial: T,
+      total: T,
+      commutative: T,
+      associative: F
+    },
+    /* */defaultF: {
+      trivial: F,
+      total: T,
+      commutative: F,
+      associative: F
+    }
+  };
+  var realContext = {
+    divide: {
+      total: F
+    },
+    log: {
+      total: F
+    }
+  };
+  var positiveContext = {
+    subtract: {
+      total: F
+    },
+    abs: {
+      trivial: T
+    },
+    log: {
+      total: T
+    }
+  };
+  function hasProperty(nodeOrName, property) {
+    var context = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : defaultContext;
+    var name = defaultName;
+    if (typeof nodeOrName === 'string') {
+      name = nodeOrName;
+    } else if (isOperatorNode(nodeOrName)) {
+      name = nodeOrName.fn.toString();
+    } else if (isFunctionNode(nodeOrName)) {
+      name = nodeOrName.name;
+    } else if (isParenthesisNode(nodeOrName)) {
+      name = 'paren';
+    }
+    if (hasOwnProperty(context, name)) {
+      var properties = context[name];
+      if (hasOwnProperty(properties, property)) {
+        return properties[property];
+      }
+      if (hasOwnProperty(defaultContext, name)) {
+        return defaultContext[name][property];
+      }
+    }
+    if (hasOwnProperty(context, defaultName)) {
+      var _properties = context[defaultName];
+      if (hasOwnProperty(_properties, property)) {
+        return _properties[property];
+      }
+      return defaultContext[defaultName][property];
+    }
+    /* name not found in context and context has no global default */
+    /* So use default context. */
+    if (hasOwnProperty(defaultContext, name)) {
+      var _properties2 = defaultContext[name];
+      if (hasOwnProperty(_properties2, property)) {
+        return _properties2[property];
+      }
+    }
+    return defaultContext[defaultName][property];
+  }
+  function isCommutative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'commutative', context);
+  }
+  function isAssociative(node) {
+    var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultContext;
+    return hasProperty(node, 'associative', context);
+  }
+
+  /**
+   * Merge the given contexts, with primary overriding secondary
+   * wherever they might conflict
+   */
+  function mergeContext(primary, secondary) {
+    var merged = _objectSpread({}, primary);
+    for (var prop in secondary) {
+      if (hasOwnProperty(primary, prop)) {
+        merged[prop] = _objectSpread(_objectSpread({}, secondary[prop]), primary[prop]);
+      } else {
+        merged[prop] = secondary[prop];
+      }
+    }
+    return merged;
+  }
+
+  /**
+   * Flatten all associative operators in an expression tree.
+   * Assumes parentheses have already been removed.
+   */
+  function flatten(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return node;
+    }
+    node.args = allChildren(node, context);
+    for (var i = 0; i < node.args.length; i++) {
+      flatten(node.args[i], context);
+    }
+  }
+
+  /**
+   * Get the children of a node as if it has been flattened.
+   * TODO implement for FunctionNodes
+   */
+  function allChildren(node, context) {
+    var op;
+    var children = [];
+    var _findChildren = function findChildren(node) {
+      for (var i = 0; i < node.args.length; i++) {
+        var child = node.args[i];
+        if (isOperatorNode(child) && op === child.op) {
+          _findChildren(child);
+        } else {
+          children.push(child);
+        }
+      }
+    };
+    if (isAssociative(node, context)) {
+      op = node.op;
+      _findChildren(node);
+      return children;
+    } else {
+      return node.args;
+    }
+  }
+
+  /**
+   *  Unflatten all flattened operators to a right-heavy binary tree.
+   */
+  function unflattenr(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+    for (var i = 0; i < l; i++) {
+      unflattenr(node.args[i], context);
+    }
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.pop();
+      while (node.args.length > 0) {
+        curnode = makeNode([node.args.pop(), curnode]);
+      }
+      node.args = curnode.args;
+    }
+  }
+
+  /**
+   *  Unflatten all flattened operators to a left-heavy binary tree.
+   */
+  function unflattenl(node, context) {
+    if (!node.args || node.args.length === 0) {
+      return;
+    }
+    var makeNode = createMakeNodeFunction(node);
+    var l = node.args.length;
+    for (var i = 0; i < l; i++) {
+      unflattenl(node.args[i], context);
+    }
+    if (l > 2 && isAssociative(node, context)) {
+      var curnode = node.args.shift();
+      while (node.args.length > 0) {
+        curnode = makeNode([curnode, node.args.shift()]);
+      }
+      node.args = curnode.args;
+    }
+  }
+  function createMakeNodeFunction(node) {
+    if (isOperatorNode(node)) {
+      return function (args) {
+        try {
+          return new OperatorNode(node.op, node.fn, args, node.implicit);
+        } catch (err) {
+          console.error(err);
+          return [];
+        }
+      };
+    } else {
+      return function (args) {
+        return new FunctionNode(new SymbolNode(node.name), args);
+      };
+    }
+  }
+  return {
+    createMakeNodeFunction,
+    hasProperty,
+    isCommutative,
+    isAssociative,
+    mergeContext,
+    flatten,
+    allChildren,
+    unflattenr,
+    unflattenl,
+    defaultContext,
+    realContext,
+    positiveContext
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplify/wildcards.js b/node_modules/mathjs/lib/esm/function/algebra/simplify/wildcards.js
new file mode 100644
index 0000000..557ac1c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplify/wildcards.js
@@ -0,0 +1,20 @@
+import { isConstantNode, isFunctionNode, isOperatorNode, isParenthesisNode } from '../../../utils/is.js';
+export { isConstantNode, isSymbolNode as isVariableNode } from '../../../utils/is.js';
+export function isNumericNode(x) {
+  return isConstantNode(x) || isOperatorNode(x) && x.isUnary() && isConstantNode(x.args[0]);
+}
+export function isConstantExpression(x) {
+  if (isConstantNode(x)) {
+    // Basic Constant types
+    return true;
+  }
+  if ((isFunctionNode(x) || isOperatorNode(x)) && x.args.every(isConstantExpression)) {
+    // Can be constant depending on arguments
+    return true;
+  }
+  if (isParenthesisNode(x) && isConstantExpression(x.content)) {
+    // Parenthesis are transparent
+    return true;
+  }
+  return false; // Probably missing some edge cases
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplifyConstant.js b/node_modules/mathjs/lib/esm/function/algebra/simplifyConstant.js
new file mode 100644
index 0000000..c4f6cf9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplifyConstant.js
@@ -0,0 +1,466 @@
+import { isFraction, isMatrix, isNode, isArrayNode, isConstantNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+import { createUtil } from './simplify/util.js';
+import { noBignumber, noFraction } from '../../utils/noop.js';
+var name = 'simplifyConstant';
+var dependencies = ['typed', 'config', 'mathWithTransform', 'matrix', '?fraction', '?bignumber', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'SymbolNode'];
+export var createSimplifyConstant = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    mathWithTransform,
+    matrix,
+    fraction,
+    bignumber,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    SymbolNode
+  } = _ref;
+  var {
+    isCommutative,
+    isAssociative,
+    allChildren,
+    createMakeNodeFunction
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+
+  /**
+   * simplifyConstant() takes a mathjs expression (either a Node representing
+   * a parse tree or a string which it parses to produce a node), and replaces
+   * any subexpression of it consisting entirely of constants with the computed
+   * value of that subexpression.
+   *
+   * Syntax:
+   *
+   *     math.simplifyConstant(expr)
+   *     math.simplifyConstant(expr, options)
+   *
+   * Examples:
+   *
+   *     math.simplifyConstant('x + 4*3/6')  // Node "x + 2"
+   *     math.simplifyConstant('z cos(0)')   // Node "z 1"
+   *     math.simplifyConstant('(5.2 + 1.08)t', {exactFractions: false})  // Node "6.28 t"
+   *
+   * See also:
+   *
+   *     simplify, simplifyCore, resolve, derivative
+   *
+   * @param {Node | string} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with constant subexpressions evaluated
+   */
+  var simplifyConstant = typed('simplifyConstant', {
+    Node: node => _ensureNode(foldFraction(node, {})),
+    'Node, Object': function Node_Object(expr, options) {
+      return _ensureNode(foldFraction(expr, options));
+    }
+  });
+  function _removeFractions(thing) {
+    if (isFraction(thing)) {
+      return thing.valueOf();
+    }
+    if (thing instanceof Array) {
+      return thing.map(_removeFractions);
+    }
+    if (isMatrix(thing)) {
+      return matrix(_removeFractions(thing.valueOf()));
+    }
+    return thing;
+  }
+  function _eval(fnname, args, options) {
+    try {
+      return mathWithTransform[fnname].apply(null, args);
+    } catch (ignore) {
+      // sometimes the implicit type conversion causes the evaluation to fail, so we'll try again after removing Fractions
+      args = args.map(_removeFractions);
+      return _toNumber(mathWithTransform[fnname].apply(null, args), options);
+    }
+  }
+  var _toNode = typed({
+    Fraction: _fractionToNode,
+    number: function number(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n < 0) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n); // old parameters: (n.toString(), 'number')
+    },
+    bigint: function bigint(n) {
+      if (n < 0n) {
+        return unaryMinusNode(new ConstantNode(-n));
+      }
+      return new ConstantNode(n);
+    },
+    Complex: function Complex(s) {
+      throw new Error('Cannot convert Complex number to Node');
+    },
+    string: function string(s) {
+      return new ConstantNode(s);
+    },
+    Matrix: function Matrix(m) {
+      return new ArrayNode(m.valueOf().map(e => _toNode(e)));
+    }
+  });
+  function _ensureNode(thing) {
+    if (isNode(thing)) {
+      return thing;
+    }
+    return _toNode(thing);
+  }
+
+  // convert a number to a fraction only if it can be expressed exactly,
+  // and when both numerator and denominator are small enough
+  function _exactFraction(n, options) {
+    var exactFractions = options && options.exactFractions !== false;
+    if (exactFractions && isFinite(n) && fraction) {
+      var f = fraction(n);
+      var fractionsLimit = options && typeof options.fractionsLimit === 'number' ? options.fractionsLimit : Infinity; // no limit by default
+
+      if (f.valueOf() === n && f.n < fractionsLimit && f.d < fractionsLimit) {
+        return f;
+      }
+    }
+    return n;
+  }
+
+  // Convert numbers to a preferred number type in preference order: Fraction, number, Complex
+  // BigNumbers are left alone
+  var _toNumber = typed({
+    'string, Object': function string_Object(s, options) {
+      var numericType = safeNumberType(s, config);
+      if (numericType === 'BigNumber') {
+        if (bignumber === undefined) {
+          noBignumber();
+        }
+        return bignumber(s);
+      } else if (numericType === 'bigint') {
+        return BigInt(s);
+      } else if (numericType === 'Fraction') {
+        if (fraction === undefined) {
+          noFraction();
+        }
+        return fraction(s);
+      } else {
+        var n = parseFloat(s);
+        return _exactFraction(n, options);
+      }
+    },
+    'Fraction, Object': function Fraction_Object(s, options) {
+      return s;
+    },
+    // we don't need options here
+
+    'BigNumber, Object': function BigNumber_Object(s, options) {
+      return s;
+    },
+    // we don't need options here
+
+    'number, Object': function number_Object(s, options) {
+      return _exactFraction(s, options);
+    },
+    'bigint, Object': function bigint_Object(s, options) {
+      return s;
+    },
+    'Complex, Object': function Complex_Object(s, options) {
+      if (s.im !== 0) {
+        return s;
+      }
+      return _exactFraction(s.re, options);
+    },
+    'Matrix, Object': function Matrix_Object(s, options) {
+      return matrix(_exactFraction(s.valueOf()));
+    },
+    'Array, Object': function Array_Object(s, options) {
+      return s.map(_exactFraction);
+    }
+  });
+  function unaryMinusNode(n) {
+    return new OperatorNode('-', 'unaryMinus', [n]);
+  }
+  function _fractionToNode(f) {
+    // note: we convert await from bigint values, because bigint values gives issues with divisions: 1n/2n=0n and not 0.5
+    var fromBigInt = value => config.number === 'BigNumber' && bignumber ? bignumber(value) : Number(value);
+    var numeratorValue = f.s * f.n;
+    var numeratorNode = numeratorValue < 0n ? new OperatorNode('-', 'unaryMinus', [new ConstantNode(-fromBigInt(numeratorValue))]) : new ConstantNode(fromBigInt(numeratorValue));
+    return f.d === 1n ? numeratorNode : new OperatorNode('/', 'divide', [numeratorNode, new ConstantNode(fromBigInt(f.d))]);
+  }
+
+  /* Handles constant indexing of ArrayNodes, matrices, and ObjectNodes */
+  function _foldAccessor(obj, index, options) {
+    if (!isIndexNode(index)) {
+      // don't know what to do with that...
+      return new AccessorNode(_ensureNode(obj), _ensureNode(index));
+    }
+    if (isArrayNode(obj) || isMatrix(obj)) {
+      var remainingDims = Array.from(index.dimensions);
+      /* We will resolve constant indices one at a time, looking
+       * just in the first or second dimensions because (a) arrays
+       * of more than two dimensions are likely rare, and (b) pulling
+       * out the third or higher dimension would be pretty intricate.
+       * The price is that we miss simplifying [..3d array][x,y,1]
+       */
+      while (remainingDims.length > 0) {
+        if (isConstantNode(remainingDims[0]) && typeof remainingDims[0].value !== 'string') {
+          var first = _toNumber(remainingDims.shift().value, options);
+          if (isArrayNode(obj)) {
+            obj = obj.items[first - 1];
+          } else {
+            // matrix
+            obj = obj.valueOf()[first - 1];
+            if (obj instanceof Array) {
+              obj = matrix(obj);
+            }
+          }
+        } else if (remainingDims.length > 1 && isConstantNode(remainingDims[1]) && typeof remainingDims[1].value !== 'string') {
+          var second = _toNumber(remainingDims[1].value, options);
+          var tryItems = [];
+          var fromItems = isArrayNode(obj) ? obj.items : obj.valueOf();
+          for (var item of fromItems) {
+            if (isArrayNode(item)) {
+              tryItems.push(item.items[second - 1]);
+            } else if (isMatrix(obj)) {
+              tryItems.push(item[second - 1]);
+            } else {
+              break;
+            }
+          }
+          if (tryItems.length === fromItems.length) {
+            if (isArrayNode(obj)) {
+              obj = new ArrayNode(tryItems);
+            } else {
+              // matrix
+              obj = matrix(tryItems);
+            }
+            remainingDims.splice(1, 1);
+          } else {
+            // extracting slice along 2nd dimension failed, give up
+            break;
+          }
+        } else {
+          // neither 1st or 2nd dimension is constant, give up
+          break;
+        }
+      }
+      if (remainingDims.length === index.dimensions.length) {
+        /* No successful constant indexing */
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      if (remainingDims.length > 0) {
+        /* Indexed some but not all dimensions */
+        index = new IndexNode(remainingDims);
+        return new AccessorNode(_ensureNode(obj), index);
+      }
+      /* All dimensions were constant, access completely resolved */
+      return obj;
+    }
+    if (isObjectNode(obj) && index.dimensions.length === 1 && isConstantNode(index.dimensions[0])) {
+      var key = index.dimensions[0].value;
+      if (key in obj.properties) {
+        return obj.properties[key];
+      }
+      return new ConstantNode(); // undefined
+    }
+    /* Don't know how to index this sort of obj, at least not with this index */
+    return new AccessorNode(_ensureNode(obj), index);
+  }
+
+  /*
+   * Create a binary tree from a list of Fractions and Nodes.
+   * Tries to fold Fractions by evaluating them until the first Node in the list is hit, so
+   * `args` should be sorted to have the Fractions at the start (if the operator is commutative).
+   * @param args - list of Fractions and Nodes
+   * @param fn - evaluator for the binary operation evaluator that accepts two Fractions
+   * @param makeNode - creates a binary OperatorNode/FunctionNode from a list of child Nodes
+   * if args.length is 1, returns args[0]
+   * @return - Either a Node representing a binary expression or Fraction
+   */
+  function foldOp(fn, args, makeNode, options) {
+    var first = args.shift();
+
+    // In the following reduction, sofar always has one of the three following
+    // forms: [NODE], [CONSTANT], or [NODE, CONSTANT]
+    var reduction = args.reduce((sofar, next) => {
+      if (!isNode(next)) {
+        var last = sofar.pop();
+        if (isNode(last)) {
+          return [last, next];
+        }
+        // Two constants in a row, try to fold them into one
+        try {
+          sofar.push(_eval(fn, [last, next], options));
+          return sofar;
+        } catch (ignoreandcontinue) {
+          sofar.push(last);
+          // fall through to Node case
+        }
+      }
+
+      // Encountered a Node, or failed folding --
+      // collapse everything so far into a single tree:
+      sofar.push(_ensureNode(sofar.pop()));
+      var newtree = sofar.length === 1 ? sofar[0] : makeNode(sofar);
+      return [makeNode([newtree, _ensureNode(next)])];
+    }, [first]);
+    if (reduction.length === 1) {
+      return reduction[0];
+    }
+    // Might end up with a tree and a constant at the end:
+    return makeNode([reduction[0], _toNode(reduction[1])]);
+  }
+
+  // destroys the original node and returns a folded one
+  function foldFraction(node, options) {
+    switch (node.type) {
+      case 'SymbolNode':
+        return node;
+      case 'ConstantNode':
+        switch (typeof node.value) {
+          case 'number':
+            return _toNumber(node.value, options);
+          case 'bigint':
+            return _toNumber(node.value, options);
+          case 'string':
+            return node.value;
+          default:
+            if (!isNaN(node.value)) return _toNumber(node.value, options);
+        }
+        return node;
+      case 'FunctionNode':
+        if (mathWithTransform[node.name] && mathWithTransform[node.name].rawArgs) {
+          return node;
+        }
+        {
+          // Process operators as OperatorNode
+          var operatorFunctions = ['add', 'multiply'];
+          if (!operatorFunctions.includes(node.name)) {
+            var args = node.args.map(arg => foldFraction(arg, options));
+
+            // If all args are numbers
+            if (!args.some(isNode)) {
+              try {
+                return _eval(node.name, args, options);
+              } catch (ignoreandcontinue) {}
+            }
+
+            // Size of a matrix does not depend on entries
+            if (node.name === 'size' && args.length === 1 && isArrayNode(args[0])) {
+              var sz = [];
+              var section = args[0];
+              while (isArrayNode(section)) {
+                sz.push(section.items.length);
+                section = section.items[0];
+              }
+              return matrix(sz);
+            }
+
+            // Convert all args to nodes and construct a symbolic function call
+            return new FunctionNode(node.name, args.map(_ensureNode));
+          } else {
+            // treat as operator
+          }
+        }
+      /* falls through */
+      case 'OperatorNode':
+        {
+          var fn = node.fn.toString();
+          var _args;
+          var res;
+          var makeNode = createMakeNodeFunction(node);
+          if (isOperatorNode(node) && node.isUnary()) {
+            _args = [foldFraction(node.args[0], options)];
+            if (!isNode(_args[0])) {
+              res = _eval(fn, _args, options);
+            } else {
+              res = makeNode(_args);
+            }
+          } else if (isAssociative(node, options.context)) {
+            _args = allChildren(node, options.context);
+            _args = _args.map(arg => foldFraction(arg, options));
+            if (isCommutative(fn, options.context)) {
+              // commutative binary operator
+              var consts = [];
+              var vars = [];
+              for (var i = 0; i < _args.length; i++) {
+                if (!isNode(_args[i])) {
+                  consts.push(_args[i]);
+                } else {
+                  vars.push(_args[i]);
+                }
+              }
+              if (consts.length > 1) {
+                res = foldOp(fn, consts, makeNode, options);
+                vars.unshift(res);
+                res = foldOp(fn, vars, makeNode, options);
+              } else {
+                // we won't change the children order since it's not neccessary
+                res = foldOp(fn, _args, makeNode, options);
+              }
+            } else {
+              // non-commutative binary operator
+              res = foldOp(fn, _args, makeNode, options);
+            }
+          } else {
+            // non-associative binary operator
+            _args = node.args.map(arg => foldFraction(arg, options));
+            res = foldOp(fn, _args, makeNode, options);
+          }
+          return res;
+        }
+      case 'ParenthesisNode':
+        // remove the uneccessary parenthesis
+        return foldFraction(node.content, options);
+      case 'AccessorNode':
+        return _foldAccessor(foldFraction(node.object, options), foldFraction(node.index, options), options);
+      case 'ArrayNode':
+        {
+          var foldItems = node.items.map(item => foldFraction(item, options));
+          if (foldItems.some(isNode)) {
+            return new ArrayNode(foldItems.map(_ensureNode));
+          }
+          /* All literals -- return a Matrix so we can operate on it */
+          return matrix(foldItems);
+        }
+      case 'IndexNode':
+        {
+          return new IndexNode(node.dimensions.map(n => simplifyConstant(n, options)));
+        }
+      case 'ObjectNode':
+        {
+          var foldProps = {};
+          for (var prop in node.properties) {
+            foldProps[prop] = simplifyConstant(node.properties[prop], options);
+          }
+          return new ObjectNode(foldProps);
+        }
+      case 'AssignmentNode':
+      /* falls through */
+      case 'BlockNode':
+      /* falls through */
+      case 'FunctionAssignmentNode':
+      /* falls through */
+      case 'RangeNode':
+      /* falls through */
+      case 'ConditionalNode':
+      /* falls through */
+      default:
+        throw new Error("Unimplemented node type in simplifyConstant: ".concat(node.type));
+    }
+  }
+  return simplifyConstant;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js b/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js
new file mode 100644
index 0000000..07139bc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/simplifyCore.js
@@ -0,0 +1,291 @@
+import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';
+import { getOperator } from '../../expression/operators.js';
+import { createUtil } from './simplify/util.js';
+import { factory } from '../../utils/factory.js';
+var name = 'simplifyCore';
+var dependencies = ['typed', 'parse', 'equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
+export var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    parse,
+    equal,
+    isZero,
+    add,
+    subtract,
+    multiply,
+    divide,
+    pow,
+    AccessorNode,
+    ArrayNode,
+    ConstantNode,
+    FunctionNode,
+    IndexNode,
+    ObjectNode,
+    OperatorNode,
+    ParenthesisNode,
+    SymbolNode
+  } = _ref;
+  var node0 = new ConstantNode(0);
+  var node1 = new ConstantNode(1);
+  var nodeT = new ConstantNode(true);
+  var nodeF = new ConstantNode(false);
+  // test if a node will always have a boolean value (true/false)
+  // not sure if this list is complete
+  function isAlwaysBoolean(node) {
+    return isOperatorNode(node) && ['and', 'not', 'or'].includes(node.op);
+  }
+  var {
+    hasProperty,
+    isCommutative
+  } = createUtil({
+    FunctionNode,
+    OperatorNode,
+    SymbolNode
+  });
+  /**
+   * simplifyCore() performs single pass simplification suitable for
+   * applications requiring ultimate performance. To roughly summarize,
+   * it handles cases along the lines of simplifyConstant() but where
+   * knowledge of a single argument is sufficient to determine the value.
+   * In contrast, simplify() extends simplifyCore() with additional passes
+   * to provide deeper simplification (such as gathering like terms).
+   *
+   * Specifically, simplifyCore:
+   *
+   * * Converts all function calls with operator equivalents to their
+   *   operator forms.
+   * * Removes operators or function calls that are guaranteed to have no
+   *   effect (such as unary '+').
+   * * Removes double unary '-', '~', and 'not'
+   * * Eliminates addition/subtraction of 0 and multiplication/division/powers
+   *   by 1 or 0.
+   * * Converts addition of a negation into subtraction.
+   * * Eliminates logical operations with constant true or false leading
+   *   arguments.
+   * * Puts constants on the left of a product, if multiplication is
+   *   considered commutative by the options (which is the default)
+   *
+   * Syntax:
+   *
+   *     math.simplifyCore(expr)
+   *     math.simplifyCore(expr, options)
+   *
+   * Examples:
+   *
+   *     const f = math.parse('2 * 1 * x ^ (1 - 0)')
+   *     math.simplifyCore(f)                          // Node "2 * x"
+   *     math.simplify('2 * 1 * x ^ (1 - 0)', [math.simplifyCore]) // Node "2 * x"
+   *
+   * See also:
+   *
+   *     simplify, simplifyConstant, resolve, derivative
+   *
+   * @param {Node | string} node
+   *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with basic simplifications applied
+   */
+  function _simplifyCore(nodeToSimplify) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var context = options ? options.context : undefined;
+    if (hasProperty(nodeToSimplify, 'trivial', context)) {
+      // This node does nothing if it has only one argument, so if so,
+      // return that argument simplified
+      if (isFunctionNode(nodeToSimplify) && nodeToSimplify.args.length === 1) {
+        return _simplifyCore(nodeToSimplify.args[0], options);
+      }
+      // For other node types, we try the generic methods
+      var simpChild = false;
+      var childCount = 0;
+      nodeToSimplify.forEach(c => {
+        ++childCount;
+        if (childCount === 1) {
+          simpChild = _simplifyCore(c, options);
+        }
+      });
+      if (childCount === 1) {
+        return simpChild;
+      }
+    }
+    var node = nodeToSimplify;
+    if (isFunctionNode(node)) {
+      var op = getOperator(node.name);
+      if (op) {
+        // Replace FunctionNode with a new OperatorNode
+        if (node.args.length > 2 && hasProperty(node, 'associative', context)) {
+          // unflatten into binary operations since that's what simplifyCore handles
+          while (node.args.length > 2) {
+            var last = node.args.pop();
+            var seclast = node.args.pop();
+            node.args.push(new OperatorNode(op, node.name, [last, seclast]));
+          }
+        }
+        node = new OperatorNode(op, node.name, node.args);
+      } else {
+        return new FunctionNode(_simplifyCore(node.fn), node.args.map(n => _simplifyCore(n, options)));
+      }
+    }
+    if (isOperatorNode(node) && node.isUnary()) {
+      var a0 = _simplifyCore(node.args[0], options);
+      if (node.op === '~') {
+        // bitwise not
+        if (isOperatorNode(a0) && a0.isUnary() && a0.op === '~') {
+          return a0.args[0];
+        }
+      }
+      if (node.op === 'not') {
+        // logical not
+        if (isOperatorNode(a0) && a0.isUnary() && a0.op === 'not') {
+          // Has the effect of turning the argument into a boolean
+          // So can only eliminate the double negation if
+          // the inside is already boolean
+          if (isAlwaysBoolean(a0.args[0])) {
+            return a0.args[0];
+          }
+        }
+      }
+      var finish = true;
+      if (node.op === '-') {
+        // unary minus
+        if (isOperatorNode(a0)) {
+          if (a0.isBinary() && a0.fn === 'subtract') {
+            node = new OperatorNode('-', 'subtract', [a0.args[1], a0.args[0]]);
+            finish = false; // continue to process the new binary node
+          }
+          if (a0.isUnary() && a0.op === '-') {
+            return a0.args[0];
+          }
+        }
+      }
+      if (finish) return new OperatorNode(node.op, node.fn, [a0]);
+    }
+    if (isOperatorNode(node) && node.isBinary()) {
+      var _a = _simplifyCore(node.args[0], options);
+      var a1 = _simplifyCore(node.args[1], options);
+      if (node.op === '+') {
+        if (isConstantNode(_a) && isZero(_a.value)) {
+          return a1;
+        }
+        if (isConstantNode(a1) && isZero(a1.value)) {
+          return _a;
+        }
+        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {
+          a1 = a1.args[0];
+          node = new OperatorNode('-', 'subtract', [_a, a1]);
+        }
+      }
+      if (node.op === '-') {
+        if (isOperatorNode(a1) && a1.isUnary() && a1.op === '-') {
+          return _simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);
+        }
+        if (isConstantNode(_a) && isZero(_a.value)) {
+          return _simplifyCore(new OperatorNode('-', 'unaryMinus', [a1]));
+        }
+        if (isConstantNode(a1) && isZero(a1.value)) {
+          return _a;
+        }
+        return new OperatorNode(node.op, node.fn, [_a, a1]);
+      }
+      if (node.op === '*') {
+        if (isConstantNode(_a)) {
+          if (isZero(_a.value)) {
+            return node0;
+          } else if (equal(_a.value, 1)) {
+            return a1;
+          }
+        }
+        if (isConstantNode(a1)) {
+          if (isZero(a1.value)) {
+            return node0;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          }
+          if (isCommutative(node, context)) {
+            return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
+          }
+        }
+        return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+      }
+      if (node.op === '/') {
+        if (isConstantNode(_a) && isZero(_a.value)) {
+          return node0;
+        }
+        if (isConstantNode(a1) && equal(a1.value, 1)) {
+          return _a;
+        }
+        return new OperatorNode(node.op, node.fn, [_a, a1]);
+      }
+      if (node.op === '^') {
+        if (isConstantNode(a1)) {
+          if (isZero(a1.value)) {
+            return node1;
+          } else if (equal(a1.value, 1)) {
+            return _a;
+          }
+        }
+      }
+      if (node.op === 'and') {
+        if (isConstantNode(_a)) {
+          if (_a.value) {
+            if (isAlwaysBoolean(a1)) return a1;
+            if (isConstantNode(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
+          } else {
+            return nodeF;
+          }
+        }
+        if (isConstantNode(a1)) {
+          if (a1.value) {
+            if (isAlwaysBoolean(_a)) return _a;
+          } else {
+            return nodeF;
+          }
+        }
+      }
+      if (node.op === 'or') {
+        if (isConstantNode(_a)) {
+          if (_a.value) {
+            return nodeT;
+          } else {
+            if (isAlwaysBoolean(a1)) return a1;
+          }
+        }
+        if (isConstantNode(a1)) {
+          if (a1.value) {
+            return nodeT;
+          } else {
+            if (isAlwaysBoolean(_a)) return _a;
+          }
+        }
+      }
+      return new OperatorNode(node.op, node.fn, [_a, a1]);
+    }
+    if (isOperatorNode(node)) {
+      return new OperatorNode(node.op, node.fn, node.args.map(a => _simplifyCore(a, options)));
+    }
+    if (isArrayNode(node)) {
+      return new ArrayNode(node.items.map(n => _simplifyCore(n, options)));
+    }
+    if (isAccessorNode(node)) {
+      return new AccessorNode(_simplifyCore(node.object, options), _simplifyCore(node.index, options));
+    }
+    if (isIndexNode(node)) {
+      return new IndexNode(node.dimensions.map(n => _simplifyCore(n, options)));
+    }
+    if (isObjectNode(node)) {
+      var newProps = {};
+      for (var prop in node.properties) {
+        newProps[prop] = _simplifyCore(node.properties[prop], options);
+      }
+      return new ObjectNode(newProps);
+    }
+    // cannot simplify
+    return node;
+  }
+  return typed(name, {
+    Node: _simplifyCore,
+    'Node,Object': _simplifyCore
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js
new file mode 100644
index 0000000..ed0bc60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolve.js
@@ -0,0 +1,157 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'lsolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+export var createLsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+
+  /**
+   * Finds one solution of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix. Throws an error if there's no solution.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolve(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolve(a, b)  // [[-5.5], [20]]
+   *
+   * See also:
+   *
+   *    lsolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {
+      var m = matrix(a);
+      var r = _denseForwardSubstitution(m, b);
+      return r.valueOf();
+    }
+  });
+  function _denseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+
+    // result
+    var x = [];
+    var mdata = m._data;
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+      var xj = void 0;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        var vjj = mdata[j][j];
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        xj = divideScalar(bj, vjj);
+
+        // loop rows
+        for (var i = j + 1; i < rows; i++) {
+          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // degenerate row, we can choose any value
+        xj = 0;
+      }
+      x[j] = [xj];
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+  function _sparseForwardSubstitution(m, b) {
+    // validate matrix and vector, return copy of column vector b
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+
+    // result
+    var x = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      var bj = bdata[j][0] || 0;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        var vjj = 0;
+        // matrix values & indices (column j)
+        var jValues = [];
+        var jIndices = [];
+
+        // first and last index in the column
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1];
+
+        // values in column, find value at [j, j]
+        for (var k = firstIndex; k < lastIndex; k++) {
+          var i = index[k];
+
+          // check row (rows are not sorted!)
+          if (i === j) {
+            vjj = values[k];
+          } else if (i > j) {
+            // store lower triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        }
+
+        // at this point we must have a value in vjj
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        var xj = divideScalar(bj, vjj);
+        for (var _k = 0, l = jIndices.length; _k < l; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtractScalar(bdata[_i][0] || 0, multiplyScalar(xj, jValues[_k]))];
+        }
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js
new file mode 100644
index 0000000..a6f2d8c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lsolveAll.js
@@ -0,0 +1,186 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'lsolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+export var createLsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+
+  /**
+   * Finds all solutions of a linear equation system by forwards substitution. Matrix must be a lower triangular matrix.
+   *
+   * `L * x = b`
+   *
+   * Syntax:
+   *
+   *    math.lsolveAll(L, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = lsolveAll(a, b)  // [ [[-5.5], [20]] ]
+   *
+   * See also:
+   *
+   *    lsolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} L       A N x N matrix or array (L)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {
+      return _sparseForwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {
+      return _denseForwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {
+      var m = matrix(a);
+      var R = _denseForwardSubstitution(m, b);
+      return R.map(r => r.valueOf());
+    }
+  });
+  function _denseForwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+
+    // loop columns
+    for (var i = 0; i < columns; i++) {
+      var L = B.length;
+
+      // loop right-hand sides
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], M[i][i]);
+          for (var j = i + 1; j < columns; j++) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          var bNew = [...b];
+          bNew[i] = 1;
+          for (var _j = i + 1; _j < columns; _j++) {
+            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+  function _sparseForwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+
+    // loop columns
+    for (var i = 0; i < columns; i++) {
+      var L = B.length;
+
+      // loop right-hand sides
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        // values & indices (column i)
+        var iValues = [];
+        var iIndices = [];
+
+        // first & last indeces in column
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1];
+
+        // find the value at [i, i]
+        var Mii = 0;
+        for (var j = firstIndex; j < lastIndex; j++) {
+          var J = index[j];
+          // check row
+          if (J === i) {
+            Mii = values[j];
+          } else if (J > i) {
+            // store lower triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], Mii);
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtractScalar(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          var bNew = [...b];
+          bNew[i] = 1;
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtractScalar(bNew[_J2], iValues[_j3]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js
new file mode 100644
index 0000000..a0109e6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/lusolve.js
@@ -0,0 +1,108 @@
+import { isArray, isMatrix } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+import { csIpvec } from '../sparse/csIpvec.js';
+var name = 'lusolve';
+var dependencies = ['typed', 'matrix', 'lup', 'slu', 'usolve', 'lsolve', 'DenseMatrix'];
+export var createLusolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    lup,
+    slu,
+    usolve,
+    lsolve,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+
+  /**
+   * Solves the linear system `A * x = b` where `A` is an [n x n] matrix and `b` is a [n] column vector.
+   *
+   * Syntax:
+   *
+   *    math.lusolve(A, b)     // returns column vector with the solution to the linear system A * x = b
+   *    math.lusolve(lup, b)   // returns column vector with the solution to the linear system A * x = b, lup = math.lup(A)
+   *
+   * Examples:
+   *
+   *    const m = [[1, 0, 0, 0], [0, 2, 0, 0], [0, 0, 3, 0], [0, 0, 0, 4]]
+   *
+   *    const x = math.lusolve(m, [-1, -1, -1, -1])        // x = [[-1], [-0.5], [-1/3], [-0.25]]
+   *
+   *    const f = math.lup(m)
+   *    const x1 = math.lusolve(f, [-1, -1, -1, -1])       // x1 = [[-1], [-0.5], [-1/3], [-0.25]]
+   *    const x2 = math.lusolve(f, [1, 2, 1, -1])          // x2 = [[1], [1], [1/3], [-0.25]]
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = math.lusolve(a, b)  // [[2], [5]]
+   *
+   * See also:
+   *
+   *    lup, slu, lsolve, usolve
+   *
+   * @param {Matrix | Array | Object} A      Invertible Matrix or the Matrix LU decomposition
+   * @param {Matrix | Array} b               Column Vector
+   * @param {number} [order]                 The Symbolic Ordering and Analysis order, see slu for details. Matrix must be a SparseMatrix
+   * @param {Number} [threshold]             Partial pivoting threshold (1 for partial pivoting), see slu for details. Matrix must be a SparseMatrix.
+   *
+   * @return {DenseMatrix | Array}           Column vector with the solution to the linear system A * x = b
+   */
+  return typed(name, {
+    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {
+      a = matrix(a);
+      var d = lup(a);
+      var x = _lusolve(d.L, d.U, d.p, null, b);
+      return x.valueOf();
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(a, b) {
+      var d = lup(a);
+      return _lusolve(d.L, d.U, d.p, null, b);
+    },
+    'SparseMatrix, Array | Matrix, number, number': function SparseMatrix_Array__Matrix_number_number(a, b, order, threshold) {
+      var d = slu(a, order, threshold);
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    },
+    'Object, Array | Matrix': function Object_Array__Matrix(d, b) {
+      return _lusolve(d.L, d.U, d.p, d.q, b);
+    }
+  });
+  function _toMatrix(a) {
+    if (isMatrix(a)) {
+      return a;
+    }
+    if (isArray(a)) {
+      return matrix(a);
+    }
+    throw new TypeError('Invalid Matrix LU decomposition');
+  }
+  function _lusolve(l, u, p, q, b) {
+    // verify decomposition
+    l = _toMatrix(l);
+    u = _toMatrix(u);
+
+    // apply row permutations if needed (b is a DenseMatrix)
+    if (p) {
+      b = solveValidation(l, b, true);
+      b._data = csIpvec(p, b._data);
+    }
+
+    // use forward substitution to resolve L * y = b
+    var y = lsolve(l, b);
+    // use backward substitution to resolve U * x = y
+    var x = usolve(u, y);
+
+    // apply column permutations if needed (x is a DenseMatrix)
+    if (q) {
+      x._data = csIpvec(q, x._data);
+    }
+    return x;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js b/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js
new file mode 100644
index 0000000..5ca5d9d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/usolve.js
@@ -0,0 +1,161 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'usolve';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+export var createUsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+
+  /**
+   * Finds one solution of a linear equation system by backward substitution. Matrix must be an upper triangular matrix. Throws an error if there's no solution.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolve(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolve(a, b)  // [[8], [9]]
+   *
+   * See also:
+   *
+   *    usolveAll, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix | Array}  A column vector with the linear system solution (x)
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {
+      var m = matrix(a);
+      var r = _denseBackwardSubstitution(m, b);
+      return r.valueOf();
+    }
+  });
+  function _denseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+
+    // result
+    var x = [];
+    var mdata = m._data;
+    // loop columns backwards
+    for (var j = columns - 1; j >= 0; j--) {
+      // b[j]
+      var bj = bdata[j][0] || 0;
+      // x[j]
+      var xj = void 0;
+      if (!equalScalar(bj, 0)) {
+        // value at [j, j]
+        var vjj = mdata[j][j];
+        if (equalScalar(vjj, 0)) {
+          // system cannot be solved
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        xj = divideScalar(bj, vjj);
+
+        // loop rows
+        for (var i = j - 1; i >= 0; i--) {
+          // update copy of b
+          bdata[i] = [subtractScalar(bdata[i][0] || 0, multiplyScalar(xj, mdata[i][j]))];
+        }
+      } else {
+        // zero value at j
+        xj = 0;
+      }
+      // update x
+      x[j] = [xj];
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+  function _sparseBackwardSubstitution(m, b) {
+    // make b into a column vector
+    b = solveValidation(m, b, true);
+    var bdata = b._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+
+    // result
+    var x = [];
+
+    // loop columns backwards
+    for (var j = columns - 1; j >= 0; j--) {
+      var bj = bdata[j][0] || 0;
+      if (!equalScalar(bj, 0)) {
+        // non-degenerate row, find solution
+
+        var vjj = 0;
+
+        // upper triangular matrix values & index (column j)
+        var jValues = [];
+        var jIndices = [];
+
+        // first & last indeces in column
+        var firstIndex = ptr[j];
+        var lastIndex = ptr[j + 1];
+
+        // values in column, find value at [j, j], loop backwards
+        for (var k = lastIndex - 1; k >= firstIndex; k--) {
+          var i = index[k];
+
+          // check row (rows are not sorted!)
+          if (i === j) {
+            vjj = values[k];
+          } else if (i < j) {
+            // store upper triangular
+            jValues.push(values[k]);
+            jIndices.push(i);
+          }
+        }
+
+        // at this point we must have a value in vjj
+        if (equalScalar(vjj, 0)) {
+          throw new Error('Linear system cannot be solved since matrix is singular');
+        }
+        var xj = divideScalar(bj, vjj);
+        for (var _k = 0, _lastIndex = jIndices.length; _k < _lastIndex; _k++) {
+          var _i = jIndices[_k];
+          bdata[_i] = [subtractScalar(bdata[_i][0], multiplyScalar(xj, jValues[_k]))];
+        }
+        x[j] = [xj];
+      } else {
+        // degenerate row, we can choose any value
+        x[j] = [0];
+      }
+    }
+    return new DenseMatrix({
+      data: x,
+      size: [rows, 1]
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js b/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js
new file mode 100644
index 0000000..39366c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/usolveAll.js
@@ -0,0 +1,190 @@
+import { factory } from '../../../utils/factory.js';
+import { createSolveValidation } from './utils/solveValidation.js';
+var name = 'usolveAll';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'multiplyScalar', 'subtractScalar', 'equalScalar', 'DenseMatrix'];
+export var createUsolveAll = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    multiplyScalar,
+    subtractScalar,
+    equalScalar,
+    DenseMatrix
+  } = _ref;
+  var solveValidation = createSolveValidation({
+    DenseMatrix
+  });
+
+  /**
+   * Finds all solutions of a linear equation system by backward substitution. Matrix must be an upper triangular matrix.
+   *
+   * `U * x = b`
+   *
+   * Syntax:
+   *
+   *    math.usolveAll(U, b)
+   *
+   * Examples:
+   *
+   *    const a = [[-2, 3], [2, 1]]
+   *    const b = [11, 9]
+   *    const x = usolveAll(a, b)  // [ [[8], [9]] ]
+   *
+   * See also:
+   *
+   *    usolve, lup, slu, usolve, lusolve
+   *
+   * @param {Matrix, Array} U       A N x N matrix or array (U)
+   * @param {Matrix, Array} b       A column vector with the b values
+   *
+   * @return {DenseMatrix[] | Array[]}  An array of affine-independent column vectors (x) that solve the linear system
+   */
+  return typed(name, {
+    'SparseMatrix, Array | Matrix': function SparseMatrix_Array__Matrix(m, b) {
+      return _sparseBackwardSubstitution(m, b);
+    },
+    'DenseMatrix, Array | Matrix': function DenseMatrix_Array__Matrix(m, b) {
+      return _denseBackwardSubstitution(m, b);
+    },
+    'Array, Array | Matrix': function Array_Array__Matrix(a, b) {
+      var m = matrix(a);
+      var R = _denseBackwardSubstitution(m, b);
+      return R.map(r => r.valueOf());
+    }
+  });
+  function _denseBackwardSubstitution(m, b_) {
+    // the algorithm is derived from
+    // https://www.overleaf.com/read/csvgqdxggyjv
+
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var M = m._data;
+    var rows = m._size[0];
+    var columns = m._size[1];
+
+    // loop columns backwards
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length;
+
+      // loop right-hand sides
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+        if (!equalScalar(M[i][i], 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], M[i][i]);
+          for (var j = i - 1; j >= 0; j--) {
+            // b[j] -= b[i] * M[j,i]
+            b[j] = subtractScalar(b[j], multiplyScalar(b[i], M[j][i]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          var bNew = [...b];
+          bNew[i] = 1;
+          for (var _j = i - 1; _j >= 0; _j--) {
+            bNew[_j] = subtractScalar(bNew[_j], M[_j][i]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+  function _sparseBackwardSubstitution(m, b_) {
+    // array of right-hand sides
+    var B = [solveValidation(m, b_, true)._data.map(e => e[0])];
+    var rows = m._size[0];
+    var columns = m._size[1];
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+
+    // loop columns backwards
+    for (var i = columns - 1; i >= 0; i--) {
+      var L = B.length;
+
+      // loop right-hand sides
+      for (var k = 0; k < L; k++) {
+        var b = B[k];
+
+        // values & indices (column i)
+        var iValues = [];
+        var iIndices = [];
+
+        // first & last indeces in column
+        var firstIndex = ptr[i];
+        var lastIndex = ptr[i + 1];
+
+        // find the value at [i, i]
+        var Mii = 0;
+        for (var j = lastIndex - 1; j >= firstIndex; j--) {
+          var J = index[j];
+          // check row
+          if (J === i) {
+            Mii = values[j];
+          } else if (J < i) {
+            // store upper triangular
+            iValues.push(values[j]);
+            iIndices.push(J);
+          }
+        }
+        if (!equalScalar(Mii, 0)) {
+          // non-singular row
+
+          b[i] = divideScalar(b[i], Mii);
+
+          // loop upper triangular
+          for (var _j2 = 0, _lastIndex = iIndices.length; _j2 < _lastIndex; _j2++) {
+            var _J = iIndices[_j2];
+            b[_J] = subtractScalar(b[_J], multiplyScalar(b[i], iValues[_j2]));
+          }
+        } else if (!equalScalar(b[i], 0)) {
+          // singular row, nonzero RHS
+
+          if (k === 0) {
+            // There is no valid solution
+            return [];
+          } else {
+            // This RHS is invalid but other solutions may still exist
+            B.splice(k, 1);
+            k -= 1;
+            L -= 1;
+          }
+        } else if (k === 0) {
+          // singular row, RHS is zero
+
+          var bNew = [...b];
+          bNew[i] = 1;
+
+          // loop upper triangular
+          for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {
+            var _J2 = iIndices[_j3];
+            bNew[_J2] = subtractScalar(bNew[_J2], iValues[_j3]);
+          }
+          B.push(bNew);
+        }
+      }
+    }
+    return B.map(x => new DenseMatrix({
+      data: x.map(e => [e]),
+      size: [rows, 1]
+    }));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js b/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js
new file mode 100644
index 0000000..42239a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/solver/utils/solveValidation.js
@@ -0,0 +1,115 @@
+import { isArray, isMatrix, isDenseMatrix, isSparseMatrix } from '../../../../utils/is.js';
+import { arraySize } from '../../../../utils/array.js';
+import { format } from '../../../../utils/string.js';
+export function createSolveValidation(_ref) {
+  var {
+    DenseMatrix
+  } = _ref;
+  /**
+   * Validates matrix and column vector b for backward/forward substitution algorithms.
+   *
+   * @param {Matrix} m            An N x N matrix
+   * @param {Array | Matrix} b    A column vector
+   * @param {Boolean} copy        Return a copy of vector b
+   *
+   * @return {DenseMatrix}        Dense column vector b
+   */
+  return function solveValidation(m, b, copy) {
+    var mSize = m.size();
+    if (mSize.length !== 2) {
+      throw new RangeError('Matrix must be two dimensional (size: ' + format(mSize) + ')');
+    }
+    var rows = mSize[0];
+    var columns = mSize[1];
+    if (rows !== columns) {
+      throw new RangeError('Matrix must be square (size: ' + format(mSize) + ')');
+    }
+    var data = [];
+    if (isMatrix(b)) {
+      var bSize = b.size();
+      var bdata = b._data;
+
+      // 1-dim vector
+      if (bSize.length === 1) {
+        if (bSize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (var i = 0; i < rows; i++) {
+          data[i] = [bdata[i]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1],
+          datatype: b._datatype
+        });
+      }
+
+      // 2-dim column
+      if (bSize.length === 2) {
+        if (bSize[0] !== rows || bSize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        if (isDenseMatrix(b)) {
+          if (copy) {
+            data = [];
+            for (var _i = 0; _i < rows; _i++) {
+              data[_i] = [bdata[_i][0]];
+            }
+            return new DenseMatrix({
+              data,
+              size: [rows, 1],
+              datatype: b._datatype
+            });
+          }
+          return b;
+        }
+        if (isSparseMatrix(b)) {
+          for (var _i2 = 0; _i2 < rows; _i2++) {
+            data[_i2] = [0];
+          }
+          var values = b._values;
+          var index = b._index;
+          var ptr = b._ptr;
+          for (var k1 = ptr[1], k = ptr[0]; k < k1; k++) {
+            var _i3 = index[k];
+            data[_i3][0] = values[k];
+          }
+          return new DenseMatrix({
+            data,
+            size: [rows, 1],
+            datatype: b._datatype
+          });
+        }
+      }
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+    if (isArray(b)) {
+      var bsize = arraySize(b);
+      if (bsize.length === 1) {
+        if (bsize[0] !== rows) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (var _i4 = 0; _i4 < rows; _i4++) {
+          data[_i4] = [b[_i4]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1]
+        });
+      }
+      if (bsize.length === 2) {
+        if (bsize[0] !== rows || bsize[1] !== 1) {
+          throw new RangeError('Dimension mismatch. Matrix columns must match vector length.');
+        }
+        for (var _i5 = 0; _i5 < rows; _i5++) {
+          data[_i5] = [b[_i5][0]];
+        }
+        return new DenseMatrix({
+          data,
+          size: [rows, 1]
+        });
+      }
+      throw new RangeError('Dimension mismatch. The right side has to be either 1- or 2-dimensional vector.');
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js
new file mode 100644
index 0000000..c83299c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csAmd.js
@@ -0,0 +1,580 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { factory } from '../../../utils/factory.js';
+import { csFkeep } from './csFkeep.js';
+import { csFlip } from './csFlip.js';
+import { csTdfs } from './csTdfs.js';
+var name = 'csAmd';
+var dependencies = ['add', 'multiply', 'transpose'];
+export var createCsAmd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  /**
+   * Approximate minimum degree ordering. The minimum degree algorithm is a widely used
+   * heuristic for finding a permutation P so that P*A*P' has fewer nonzeros in its factorization
+   * than A. It is a gready method that selects the sparsest pivot row and column during the course
+   * of a right looking sparse Cholesky factorization.
+   *
+   * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
+   * @param {Matrix} m        Sparse Matrix
+   */
+  return function csAmd(order, a) {
+    // check input parameters
+    if (!a || order <= 0 || order > 3) {
+      return null;
+    }
+    // a matrix arrays
+    var asize = a._size;
+    // rows and columns
+    var m = asize[0];
+    var n = asize[1];
+    // initialize vars
+    var lemax = 0;
+    // dense threshold
+    var dense = Math.max(16, 10 * Math.sqrt(n));
+    dense = Math.min(n - 2, dense);
+    // create target matrix C
+    var cm = _createTargetMatrix(order, a, m, n, dense);
+    // drop diagonal entries
+    csFkeep(cm, _diag, null);
+    // C matrix arrays
+    var cindex = cm._index;
+    var cptr = cm._ptr;
+
+    // number of nonzero elements in C
+    var cnz = cptr[n];
+
+    // allocate result (n+1)
+    var P = [];
+
+    // create workspace (8 * (n + 1))
+    var W = [];
+    var len = 0; // first n + 1 entries
+    var nv = n + 1; // next n + 1 entries
+    var next = 2 * (n + 1); // next n + 1 entries
+    var head = 3 * (n + 1); // next n + 1 entries
+    var elen = 4 * (n + 1); // next n + 1 entries
+    var degree = 5 * (n + 1); // next n + 1 entries
+    var w = 6 * (n + 1); // next n + 1 entries
+    var hhead = 7 * (n + 1); // last n + 1 entries
+
+    // use P as workspace for last
+    var last = P;
+
+    // initialize quotient graph
+    var mark = _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree);
+
+    // initialize degree lists
+    var nel = _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next);
+
+    // minimum degree node
+    var mindeg = 0;
+
+    // vars
+    var i, j, k, k1, k2, e, pj, ln, nvi, pk, eln, p1, p2, pn, h, d;
+
+    // while (selecting pivots) do
+    while (nel < n) {
+      // select node of minimum approximate degree. amd() is now ready to start eliminating the graph. It first
+      // finds a node k of minimum degree and removes it from its degree list. The variable nel keeps track of thow
+      // many nodes have been eliminated.
+      for (k = -1; mindeg < n && (k = W[head + mindeg]) === -1; mindeg++);
+      if (W[next + k] !== -1) {
+        last[W[next + k]] = -1;
+      }
+      // remove k from degree list
+      W[head + mindeg] = W[next + k];
+      // elenk = |Ek|
+      var elenk = W[elen + k];
+      // # of nodes k represents
+      var nvk = W[nv + k];
+      // W[nv + k] nodes of A eliminated
+      nel += nvk;
+
+      // Construct a new element. The new element Lk is constructed in place if |Ek| = 0. nv[i] is
+      // negated for all nodes i in Lk to flag them as members of this set. Each node i is removed from the
+      // degree lists. All elements e in Ek are absorved into element k.
+      var dk = 0;
+      // flag k as in Lk
+      W[nv + k] = -nvk;
+      var p = cptr[k];
+      // do in place if W[elen + k] === 0
+      var pk1 = elenk === 0 ? p : cnz;
+      var pk2 = pk1;
+      for (k1 = 1; k1 <= elenk + 1; k1++) {
+        if (k1 > elenk) {
+          // search the nodes in k
+          e = k;
+          // list of nodes starts at cindex[pj]
+          pj = p;
+          // length of list of nodes in k
+          ln = W[len + k] - elenk;
+        } else {
+          // search the nodes in e
+          e = cindex[p++];
+          pj = cptr[e];
+          // length of list of nodes in e
+          ln = W[len + e];
+        }
+        for (k2 = 1; k2 <= ln; k2++) {
+          i = cindex[pj++];
+          // check  node i dead, or seen
+          if ((nvi = W[nv + i]) <= 0) {
+            continue;
+          }
+          // W[degree + Lk] += size of node i
+          dk += nvi;
+          // negate W[nv + i] to denote i in Lk
+          W[nv + i] = -nvi;
+          // place i in Lk
+          cindex[pk2++] = i;
+          if (W[next + i] !== -1) {
+            last[W[next + i]] = last[i];
+          }
+          // check we need to remove i from degree list
+          if (last[i] !== -1) {
+            W[next + last[i]] = W[next + i];
+          } else {
+            W[head + W[degree + i]] = W[next + i];
+          }
+        }
+        if (e !== k) {
+          // absorb e into k
+          cptr[e] = csFlip(k);
+          // e is now a dead element
+          W[w + e] = 0;
+        }
+      }
+      // cindex[cnz...nzmax] is free
+      if (elenk !== 0) {
+        cnz = pk2;
+      }
+      // external degree of k - |Lk\i|
+      W[degree + k] = dk;
+      // element k is in cindex[pk1..pk2-1]
+      cptr[k] = pk1;
+      W[len + k] = pk2 - pk1;
+      // k is now an element
+      W[elen + k] = -2;
+
+      // Find set differences. The scan1 function now computes the set differences |Le \ Lk| for all elements e. At the start of the
+      // scan, no entry in the w array is greater than or equal to mark.
+
+      // clear w if necessary
+      mark = _wclear(mark, lemax, W, w, n);
+      // scan 1: find |Le\Lk|
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check if W[elen + i] empty, skip it
+        if ((eln = W[elen + i]) <= 0) {
+          continue;
+        }
+        // W[nv + i] was negated
+        nvi = -W[nv + i];
+        var wnvi = mark - nvi;
+        // scan Ei
+        for (p = cptr[i], p1 = cptr[i] + eln - 1; p <= p1; p++) {
+          e = cindex[p];
+          if (W[w + e] >= mark) {
+            // decrement |Le\Lk|
+            W[w + e] -= nvi;
+          } else if (W[w + e] !== 0) {
+            // ensure e is a live element, 1st time e seen in scan 1
+            W[w + e] = W[degree + e] + wnvi;
+          }
+        }
+      }
+
+      // degree update
+      // The second pass computes the approximate degree di, prunes the sets Ei and Ai, and computes a hash
+      // function h(i) for all nodes in Lk.
+
+      // scan2: degree update
+      for (pk = pk1; pk < pk2; pk++) {
+        // consider node i in Lk
+        i = cindex[pk];
+        p1 = cptr[i];
+        p2 = p1 + W[elen + i] - 1;
+        pn = p1;
+        // scan Ei
+        for (h = 0, d = 0, p = p1; p <= p2; p++) {
+          e = cindex[p];
+          // check e is an unabsorbed element
+          if (W[w + e] !== 0) {
+            // dext = |Le\Lk|
+            var dext = W[w + e] - mark;
+            if (dext > 0) {
+              // sum up the set differences
+              d += dext;
+              // keep e in Ei
+              cindex[pn++] = e;
+              // compute the hash of node i
+              h += e;
+            } else {
+              // aggressive absorb. e->k
+              cptr[e] = csFlip(k);
+              // e is a dead element
+              W[w + e] = 0;
+            }
+          }
+        }
+        // W[elen + i] = |Ei|
+        W[elen + i] = pn - p1 + 1;
+        var p3 = pn;
+        var p4 = p1 + W[len + i];
+        // prune edges in Ai
+        for (p = p2 + 1; p < p4; p++) {
+          j = cindex[p];
+          // check node j dead or in Lk
+          var nvj = W[nv + j];
+          if (nvj <= 0) {
+            continue;
+          }
+          // degree(i) += |j|
+          d += nvj;
+          // place j in node list of i
+          cindex[pn++] = j;
+          // compute hash for node i
+          h += j;
+        }
+        // check for mass elimination
+        if (d === 0) {
+          // absorb i into k
+          cptr[i] = csFlip(k);
+          nvi = -W[nv + i];
+          // |Lk| -= |i|
+          dk -= nvi;
+          // |k| += W[nv + i]
+          nvk += nvi;
+          nel += nvi;
+          W[nv + i] = 0;
+          // node i is dead
+          W[elen + i] = -1;
+        } else {
+          // update degree(i)
+          W[degree + i] = Math.min(W[degree + i], d);
+          // move first node to end
+          cindex[pn] = cindex[p3];
+          // move 1st el. to end of Ei
+          cindex[p3] = cindex[p1];
+          // add k as 1st element in of Ei
+          cindex[p1] = k;
+          // new len of adj. list of node i
+          W[len + i] = pn - p1 + 1;
+          // finalize hash of i
+          h = (h < 0 ? -h : h) % n;
+          // place i in hash bucket
+          W[next + i] = W[hhead + h];
+          W[hhead + h] = i;
+          // save hash of i in last[i]
+          last[i] = h;
+        }
+      }
+      // finalize |Lk|
+      W[degree + k] = dk;
+      lemax = Math.max(lemax, dk);
+      // clear w
+      mark = _wclear(mark + lemax, lemax, W, w, n);
+
+      // Supernode detection. Supernode detection relies on the hash function h(i) computed for each node i.
+      // If two nodes have identical adjacency lists, their hash functions wil be identical.
+      for (pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check i is dead, skip it
+        if (W[nv + i] >= 0) {
+          continue;
+        }
+        // scan hash bucket of node i
+        h = last[i];
+        i = W[hhead + h];
+        // hash bucket will be empty
+        W[hhead + h] = -1;
+        for (; i !== -1 && W[next + i] !== -1; i = W[next + i], mark++) {
+          ln = W[len + i];
+          eln = W[elen + i];
+          for (p = cptr[i] + 1; p <= cptr[i] + ln - 1; p++) {
+            W[w + cindex[p]] = mark;
+          }
+          var jlast = i;
+          // compare i with all j
+          for (j = W[next + i]; j !== -1;) {
+            var ok = W[len + j] === ln && W[elen + j] === eln;
+            for (p = cptr[j] + 1; ok && p <= cptr[j] + ln - 1; p++) {
+              // compare i and j
+              if (W[w + cindex[p]] !== mark) {
+                ok = 0;
+              }
+            }
+            // check i and j are identical
+            if (ok) {
+              // absorb j into i
+              cptr[j] = csFlip(i);
+              W[nv + i] += W[nv + j];
+              W[nv + j] = 0;
+              // node j is dead
+              W[elen + j] = -1;
+              // delete j from hash bucket
+              j = W[next + j];
+              W[next + jlast] = j;
+            } else {
+              // j and i are different
+              jlast = j;
+              j = W[next + j];
+            }
+          }
+        }
+      }
+
+      // Finalize new element. The elimination of node k is nearly complete. All nodes i in Lk are scanned one last time.
+      // Node i is removed from Lk if it is dead. The flagged status of nv[i] is cleared.
+      for (p = pk1, pk = pk1; pk < pk2; pk++) {
+        i = cindex[pk];
+        // check  i is dead, skip it
+        if ((nvi = -W[nv + i]) <= 0) {
+          continue;
+        }
+        // restore W[nv + i]
+        W[nv + i] = nvi;
+        // compute external degree(i)
+        d = W[degree + i] + dk - nvi;
+        d = Math.min(d, n - nel - nvi);
+        if (W[head + d] !== -1) {
+          last[W[head + d]] = i;
+        }
+        // put i back in degree list
+        W[next + i] = W[head + d];
+        last[i] = -1;
+        W[head + d] = i;
+        // find new minimum degree
+        mindeg = Math.min(mindeg, d);
+        W[degree + i] = d;
+        // place i in Lk
+        cindex[p++] = i;
+      }
+      // # nodes absorbed into k
+      W[nv + k] = nvk;
+      // length of adj list of element k
+      if ((W[len + k] = p - pk1) === 0) {
+        // k is a root of the tree
+        cptr[k] = -1;
+        // k is now a dead element
+        W[w + k] = 0;
+      }
+      if (elenk !== 0) {
+        // free unused space in Lk
+        cnz = p;
+      }
+    }
+
+    // Postordering. The elimination is complete, but no permutation has been computed. All that is left
+    // of the graph is the assembly tree (ptr) and a set of dead nodes and elements (i is a dead node if
+    // nv[i] is zero and a dead element if nv[i] > 0). It is from this information only that the final permutation
+    // is computed. The tree is restored by unflipping all of ptr.
+
+    // fix assembly tree
+    for (i = 0; i < n; i++) {
+      cptr[i] = csFlip(cptr[i]);
+    }
+    for (j = 0; j <= n; j++) {
+      W[head + j] = -1;
+    }
+    // place unordered nodes in lists
+    for (j = n; j >= 0; j--) {
+      // skip if j is an element
+      if (W[nv + j] > 0) {
+        continue;
+      }
+      // place j in list of its parent
+      W[next + j] = W[head + cptr[j]];
+      W[head + cptr[j]] = j;
+    }
+    // place elements in lists
+    for (e = n; e >= 0; e--) {
+      // skip unless e is an element
+      if (W[nv + e] <= 0) {
+        continue;
+      }
+      if (cptr[e] !== -1) {
+        // place e in list of its parent
+        W[next + e] = W[head + cptr[e]];
+        W[head + cptr[e]] = e;
+      }
+    }
+    // postorder the assembly tree
+    for (k = 0, i = 0; i <= n; i++) {
+      if (cptr[i] === -1) {
+        k = csTdfs(i, k, W, head, next, P, w);
+      }
+    }
+    // remove last item in array
+    P.splice(P.length - 1, 1);
+    // return P
+    return P;
+  };
+
+  /**
+   * Creates the matrix that will be used by the approximate minimum degree ordering algorithm. The function accepts the matrix M as input and returns a permutation
+   * vector P. The amd algorithm operates on a symmetrix matrix, so one of three symmetric matrices is formed.
+   *
+   * Order: 0
+   *   A natural ordering P=null matrix is returned.
+   *
+   * Order: 1
+   *   Matrix must be square. This is appropriate for a Cholesky or LU factorization.
+   *   P = M + M'
+   *
+   * Order: 2
+   *   Dense columns from M' are dropped, M recreated from M'. This is appropriatefor LU factorization of unsymmetric matrices.
+   *   P = M' * M
+   *
+   * Order: 3
+   *   This is best used for QR factorization or LU factorization is matrix M has no dense rows. A dense row is a row with more than 10*sqr(columns) entries.
+   *   P = M' * M
+   */
+  function _createTargetMatrix(order, a, m, n, dense) {
+    // compute A'
+    var at = transpose(a);
+
+    // check order = 1, matrix must be square
+    if (order === 1 && n === m) {
+      // C = A + A'
+      return add(a, at);
+    }
+
+    // check order = 2, drop dense columns from M'
+    if (order === 2) {
+      // transpose arrays
+      var tindex = at._index;
+      var tptr = at._ptr;
+      // new column index
+      var p2 = 0;
+      // loop A' columns (rows)
+      for (var j = 0; j < m; j++) {
+        // column j of AT starts here
+        var p = tptr[j];
+        // new column j starts here
+        tptr[j] = p2;
+        // skip dense col j
+        if (tptr[j + 1] - p > dense) {
+          continue;
+        }
+        // map rows in column j of A
+        for (var p1 = tptr[j + 1]; p < p1; p++) {
+          tindex[p2++] = tindex[p];
+        }
+      }
+      // finalize AT
+      tptr[m] = p2;
+      // recreate A from new transpose matrix
+      a = transpose(at);
+      // use A' * A
+      return multiply(at, a);
+    }
+
+    // use A' * A, square or rectangular matrix
+    return multiply(at, a);
+  }
+
+  /**
+   * Initialize quotient graph. There are four kind of nodes and elements that must be represented:
+   *
+   *  - A live node is a node i (or a supernode) that has not been selected as a pivot nad has not been merged into another supernode.
+   *  - A dead node i is one that has been removed from the graph, having been absorved into r = flip(ptr[i]).
+   *  - A live element e is one that is in the graph, having been formed when node e was selected as the pivot.
+   *  - A dead element e is one that has benn absorved into a subsequent element s = flip(ptr[e]).
+   */
+  function _initializeQuotientGraph(n, cptr, W, len, head, last, next, hhead, nv, w, elen, degree) {
+    // Initialize quotient graph
+    for (var k = 0; k < n; k++) {
+      W[len + k] = cptr[k + 1] - cptr[k];
+    }
+    W[len + n] = 0;
+    // initialize workspace
+    for (var i = 0; i <= n; i++) {
+      // degree list i is empty
+      W[head + i] = -1;
+      last[i] = -1;
+      W[next + i] = -1;
+      // hash list i is empty
+      W[hhead + i] = -1;
+      // node i is just one node
+      W[nv + i] = 1;
+      // node i is alive
+      W[w + i] = 1;
+      // Ek of node i is empty
+      W[elen + i] = 0;
+      // degree of node i
+      W[degree + i] = W[len + i];
+    }
+    // clear w
+    var mark = _wclear(0, 0, W, w, n);
+    // n is a dead element
+    W[elen + n] = -2;
+    // n is a root of assembly tree
+    cptr[n] = -1;
+    // n is a dead element
+    W[w + n] = 0;
+    // return mark
+    return mark;
+  }
+
+  /**
+   * Initialize degree lists. Each node is placed in its degree lists. Nodes of zero degree are eliminated immediately. Nodes with
+   * degree >= dense are alsol eliminated and merged into a placeholder node n, a dead element. Thes nodes will appera last in the
+   * output permutation p.
+   */
+  function _initializeDegreeLists(n, cptr, W, degree, elen, w, dense, nv, head, last, next) {
+    // result
+    var nel = 0;
+    // loop columns
+    for (var i = 0; i < n; i++) {
+      // degree @ i
+      var d = W[degree + i];
+      // check node i is empty
+      if (d === 0) {
+        // element i is dead
+        W[elen + i] = -2;
+        nel++;
+        // i is a root of assembly tree
+        cptr[i] = -1;
+        W[w + i] = 0;
+      } else if (d > dense) {
+        // absorb i into element n
+        W[nv + i] = 0;
+        // node i is dead
+        W[elen + i] = -1;
+        nel++;
+        cptr[i] = csFlip(n);
+        W[nv + n]++;
+      } else {
+        var h = W[head + d];
+        if (h !== -1) {
+          last[h] = i;
+        }
+        // put node i in degree list d
+        W[next + i] = W[head + d];
+        W[head + d] = i;
+      }
+    }
+    return nel;
+  }
+  function _wclear(mark, lemax, W, w, n) {
+    if (mark < 2 || mark + lemax < 0) {
+      for (var k = 0; k < n; k++) {
+        if (W[w + k] !== 0) {
+          W[w + k] = 1;
+        }
+      }
+      mark = 2;
+    }
+    // at this point, W [0..n-1] < mark holds
+    return mark;
+  }
+  function _diag(i, j) {
+    return i !== j;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js
new file mode 100644
index 0000000..3ea2422
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csChol.js
@@ -0,0 +1,157 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { factory } from '../../../utils/factory.js';
+import { csEreach } from './csEreach.js';
+import { createCsSymperm } from './csSymperm.js';
+var name = 'csChol';
+var dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
+export var createCsChol = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    divideScalar,
+    sqrt,
+    subtract,
+    multiply,
+    im,
+    re,
+    conj,
+    equal,
+    smallerEq,
+    SparseMatrix
+  } = _ref;
+  var csSymperm = createCsSymperm({
+    conj,
+    SparseMatrix
+  });
+
+  /**
+   * Computes the Cholesky factorization of matrix A. It computes L and P so
+   * L * L' = P * A * P'
+   *
+   * @param {Matrix}  m               The A Matrix to factorize, only upper triangular part used
+   * @param {Object}  s               The symbolic analysis from cs_schol()
+   *
+   * @return {Number}                 The numeric Cholesky factorization of A or null
+   */
+  return function csChol(m, s) {
+    // validate input
+    if (!m) {
+      return null;
+    }
+    // m arrays
+    var size = m._size;
+    // columns
+    var n = size[1];
+    // symbolic analysis result
+    var parent = s.parent;
+    var cp = s.cp;
+    var pinv = s.pinv;
+    // L arrays
+    var lvalues = [];
+    var lindex = [];
+    var lptr = [];
+    // L
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    });
+    // vars
+    var c = []; // (2 * n)
+    var x = []; // (n)
+    // compute C = P * A * P'
+    var cm = pinv ? csSymperm(m, pinv, 1) : m;
+    // C matrix arrays
+    var cvalues = cm._values;
+    var cindex = cm._index;
+    var cptr = cm._ptr;
+    // vars
+    var k, p;
+    // initialize variables
+    for (k = 0; k < n; k++) {
+      lptr[k] = c[k] = cp[k];
+    }
+    // compute L(k,:) for L*L' = C
+    for (k = 0; k < n; k++) {
+      // nonzero pattern of L(k,:)
+      var top = csEreach(cm, k, parent, c);
+      // x (0:k) is now zero
+      x[k] = 0;
+      // x = full(triu(C(:,k)))
+      for (p = cptr[k]; p < cptr[k + 1]; p++) {
+        if (cindex[p] <= k) {
+          x[cindex[p]] = cvalues[p];
+        }
+      }
+      // d = C(k,k)
+      var d = x[k];
+      // clear x for k+1st iteration
+      x[k] = 0;
+      // solve L(0:k-1,0:k-1) * x = C(:,k)
+      for (; top < n; top++) {
+        // s[top..n-1] is pattern of L(k,:)
+        var i = s[top];
+        // L(k,i) = x (i) / L(i,i)
+        var lki = divideScalar(x[i], lvalues[lptr[i]]);
+        // clear x for k+1st iteration
+        x[i] = 0;
+        for (p = lptr[i] + 1; p < c[i]; p++) {
+          // row
+          var r = lindex[p];
+          // update x[r]
+          x[r] = subtract(x[r], multiply(lvalues[p], lki));
+        }
+        // d = d - L(k,i)*L(k,i)
+        d = subtract(d, multiply(lki, conj(lki)));
+        p = c[i]++;
+        // store L(k,i) in column i
+        lindex[p] = k;
+        lvalues[p] = conj(lki);
+      }
+      // compute L(k,k)
+      if (smallerEq(re(d), 0) || !equal(im(d), 0)) {
+        // not pos def
+        return null;
+      }
+      p = c[k]++;
+      //  store L(k,k) = sqrt(d) in column k
+      lindex[p] = k;
+      lvalues[p] = sqrt(d);
+    }
+    // finalize L
+    lptr[n] = cp[n];
+    // P matrix
+    var P;
+    // check we need to calculate P
+    if (pinv) {
+      // P arrays
+      var pvalues = [];
+      var pindex = [];
+      var pptr = [];
+      // create P matrix
+      for (p = 0; p < n; p++) {
+        // initialize ptr (one value per column)
+        pptr[p] = p;
+        // index (apply permutation vector)
+        pindex.push(pinv[p]);
+        // value 1
+        pvalues.push(1);
+      }
+      // update ptr
+      pptr[n] = n;
+      // P
+      P = new SparseMatrix({
+        values: pvalues,
+        index: pindex,
+        ptr: pptr,
+        size: [n, n]
+      });
+    }
+    // return L & P
+    return {
+      L,
+      P
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js
new file mode 100644
index 0000000..9eaa2bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCounts.js
@@ -0,0 +1,126 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { factory } from '../../../utils/factory.js';
+import { csLeaf } from './csLeaf.js';
+var name = 'csCounts';
+var dependencies = ['transpose'];
+export var createCsCounts = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    transpose
+  } = _ref;
+  /**
+   * Computes the column counts using the upper triangular part of A.
+   * It transposes A internally, none of the input parameters are modified.
+   *
+   * @param {Matrix} a           The sparse matrix A
+   *
+   * @param {Matrix} ata         Count the columns of A'A instead
+   *
+   * @return                     An array of size n of the column counts or null on error
+   */
+  return function (a, parent, post, ata) {
+    // check inputs
+    if (!a || !parent || !post) {
+      return null;
+    }
+    // a matrix arrays
+    var asize = a._size;
+    // rows and columns
+    var m = asize[0];
+    var n = asize[1];
+    // variables
+    var i, j, k, J, p, p0, p1;
+
+    // workspace size
+    var s = 4 * n + (ata ? n + m + 1 : 0);
+    // allocate workspace
+    var w = []; // (s)
+    var ancestor = 0; // first n entries
+    var maxfirst = n; // next n entries
+    var prevleaf = 2 * n; // next n entries
+    var first = 3 * n; // next n entries
+    var head = 4 * n; // next n + 1 entries (used when ata is true)
+    var next = 5 * n + 1; // last entries in workspace
+    // clear workspace w[0..s-1]
+    for (k = 0; k < s; k++) {
+      w[k] = -1;
+    }
+
+    // allocate result
+    var colcount = []; // (n)
+
+    // AT = A'
+    var at = transpose(a);
+    // at arrays
+    var tindex = at._index;
+    var tptr = at._ptr;
+
+    // find w[first + j]
+    for (k = 0; k < n; k++) {
+      j = post[k];
+      // colcount[j]=1 if j is a leaf
+      colcount[j] = w[first + j] === -1 ? 1 : 0;
+      for (; j !== -1 && w[first + j] === -1; j = parent[j]) {
+        w[first + j] = k;
+      }
+    }
+
+    // initialize ata if needed
+    if (ata) {
+      // invert post
+      for (k = 0; k < n; k++) {
+        w[post[k]] = k;
+      }
+      // loop rows (columns in AT)
+      for (i = 0; i < m; i++) {
+        // values in column i of AT
+        for (k = n, p0 = tptr[i], p1 = tptr[i + 1], p = p0; p < p1; p++) {
+          k = Math.min(k, w[tindex[p]]);
+        }
+        // place row i in linked list k
+        w[next + i] = w[head + k];
+        w[head + k] = i;
+      }
+    }
+
+    // each node in its own set
+    for (i = 0; i < n; i++) {
+      w[ancestor + i] = i;
+    }
+    for (k = 0; k < n; k++) {
+      // j is the kth node in postordered etree
+      j = post[k];
+      // check j is not a root
+      if (parent[j] !== -1) {
+        colcount[parent[j]]--;
+      }
+
+      // J=j for LL'=A case
+      for (J = ata ? w[head + k] : j; J !== -1; J = ata ? w[next + J] : -1) {
+        for (p = tptr[J]; p < tptr[J + 1]; p++) {
+          i = tindex[p];
+          var r = csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor);
+          // check A(i,j) is in skeleton
+          if (r.jleaf >= 1) {
+            colcount[j]++;
+          }
+          // check account for overlap in q
+          if (r.jleaf === 2) {
+            colcount[r.q]--;
+          }
+        }
+      }
+      if (parent[j] !== -1) {
+        w[ancestor + j] = parent[j];
+      }
+    }
+    // sum up colcount's of each child
+    for (j = 0; j < n; j++) {
+      if (parent[j] !== -1) {
+        colcount[parent[j]] += colcount[j];
+      }
+    }
+    return colcount;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js
new file mode 100644
index 0000000..1c89ada
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csCumsum.js
@@ -0,0 +1,28 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * It sets the p[i] equal to the sum of c[0] through c[i-1].
+ *
+ * @param {Array}   ptr             The Sparse Matrix ptr array
+ * @param {Array}   c               The Sparse Matrix ptr array
+ * @param {Number}  n               The number of columns
+ */
+export function csCumsum(ptr, c, n) {
+  // variables
+  var i;
+  var nz = 0;
+  for (i = 0; i < n; i++) {
+    // initialize ptr @ i
+    ptr[i] = nz;
+    // increment number of nonzeros
+    nz += c[i];
+    // also copy p[0..n-1] back into c[0..n-1]
+    c[i] = ptr[i];
+  }
+  // finalize ptr
+  ptr[n] = nz;
+  // return sum (c [0..n-1])
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js
new file mode 100644
index 0000000..79e3f96
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csDfs.js
@@ -0,0 +1,76 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csMarked } from './csMarked.js';
+import { csMark } from './csMark.js';
+import { csUnflip } from './csUnflip.js';
+
+/**
+ * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
+ * at nodes in B (see csReach()).
+ *
+ * @param {Number}  j               The starting node for the DFS algorithm
+ * @param {Matrix}  g               The G matrix to search, ptr array modified, then restored
+ * @param {Number}  top             Start index in stack xi[top..n-1]
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+ *
+ * @return {Number}                 New value of top
+ */
+export function csDfs(j, g, top, xi, pinv) {
+  // g arrays
+  var index = g._index;
+  var ptr = g._ptr;
+  var size = g._size;
+  // columns
+  var n = size[1];
+  // vars
+  var i, p, p2;
+  // initialize head
+  var head = 0;
+  // initialize the recursion stack
+  xi[0] = j;
+  // loop
+  while (head >= 0) {
+    // get j from the top of the recursion stack
+    j = xi[head];
+    // apply permutation vector
+    var jnew = pinv ? pinv[j] : j;
+    // check node j is marked
+    if (!csMarked(ptr, j)) {
+      // mark node j as visited
+      csMark(ptr, j);
+      // update stack (last n entries in xi)
+      xi[n + head] = jnew < 0 ? 0 : csUnflip(ptr[jnew]);
+    }
+    // node j done if no unvisited neighbors
+    var done = 1;
+    // examine all neighbors of j, stack (last n entries in xi)
+    for (p = xi[n + head], p2 = jnew < 0 ? 0 : csUnflip(ptr[jnew + 1]); p < p2; p++) {
+      // consider neighbor node i
+      i = index[p];
+      // check we have visited node i, skip it
+      if (csMarked(ptr, i)) {
+        continue;
+      }
+      // pause depth-first search of node j, update stack (last n entries in xi)
+      xi[n + head] = p;
+      // start dfs at node i
+      xi[++head] = i;
+      // node j is not done
+      done = 0;
+      // break, to start dfs(i)
+      break;
+    }
+    // check depth-first search at node j is done
+    if (done) {
+      // remove j from the recursion stack
+      head--;
+      // and place in the output stack
+      xi[--top] = j;
+    }
+  }
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js
new file mode 100644
index 0000000..3d16615
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEreach.js
@@ -0,0 +1,63 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csMark } from './csMark.js';
+import { csMarked } from './csMarked.js';
+
+/**
+ * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
+ *
+ * @param {Matrix}  a               The A matrix
+ * @param {Number}  k               The kth column in A
+ * @param {Array}   parent          The parent vector from the symbolic analysis result
+ * @param {Array}   w               The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ */
+export function csEreach(a, k, parent, w) {
+  // a arrays
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  // columns
+  var n = asize[1];
+  // initialize top
+  var top = n;
+  // vars
+  var p, p0, p1, len;
+  // mark node k as visited
+  csMark(w, k);
+  // loop values & index for column k
+  for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+    // A(i,k) is nonzero
+    var i = aindex[p];
+    // only use upper triangular part of A
+    if (i > k) {
+      continue;
+    }
+    // traverse up etree
+    for (len = 0; !csMarked(w, i); i = parent[i]) {
+      // L(k,i) is nonzero, last n entries in w
+      w[n + len++] = i;
+      // mark i as visited
+      csMark(w, i);
+    }
+    while (len > 0) {
+      // decrement top & len
+      --top;
+      --len;
+      // push path onto stack, last n entries in w
+      w[n + top] = w[n + len];
+    }
+  }
+  // unmark all nodes
+  for (p = top; p < n; p++) {
+    // use stack value, last n entries in w
+    csMark(w, w[n + p]);
+  }
+  // unmark node k
+  csMark(w, k);
+  // s[top..n-1] contains pattern of L(k,:)
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js
new file mode 100644
index 0000000..0b0b29c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csEtree.js
@@ -0,0 +1,71 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Computes the elimination tree of Matrix A (using triu(A)) or the
+ * elimination tree of A'A without forming A'A.
+ *
+ * @param {Matrix}  a               The A Matrix
+ * @param {boolean} ata             A value of true the function computes the etree of A'A
+ */
+export function csEtree(a, ata) {
+  // check inputs
+  if (!a) {
+    return null;
+  }
+  // a arrays
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  // rows & columns
+  var m = asize[0];
+  var n = asize[1];
+
+  // allocate result
+  var parent = []; // (n)
+
+  // allocate workspace
+  var w = []; // (n + (ata ? m : 0))
+  var ancestor = 0; // first n entries in w
+  var prev = n; // last m entries (ata = true)
+
+  var i, inext;
+
+  // check we are calculating A'A
+  if (ata) {
+    // initialize workspace
+    for (i = 0; i < m; i++) {
+      w[prev + i] = -1;
+    }
+  }
+  // loop columns
+  for (var k = 0; k < n; k++) {
+    // node k has no parent yet
+    parent[k] = -1;
+    // nor does k have an ancestor
+    w[ancestor + k] = -1;
+    // values in column k
+    for (var p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+      // row
+      var r = aindex[p];
+      // node
+      i = ata ? w[prev + r] : r;
+      // traverse from i to k
+      for (; i !== -1 && i < k; i = inext) {
+        // inext = ancestor of i
+        inext = w[ancestor + i];
+        // path compression
+        w[ancestor + i] = k;
+        // check no anc., parent is k
+        if (inext === -1) {
+          parent[i] = k;
+        }
+      }
+      if (ata) {
+        w[prev + r] = k;
+      }
+    }
+  }
+  return parent;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js
new file mode 100644
index 0000000..cd1e003
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFkeep.js
@@ -0,0 +1,58 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
+ *
+ * @param {Matrix}   a              The sparse matrix
+ * @param {function} callback       The callback function, function will be invoked with the following args:
+ *                                    - The entry row
+ *                                    - The entry column
+ *                                    - The entry value
+ *                                    - The state parameter
+ * @param {any}      other          The state
+ *
+ * @return                          The number of nonzero elements in the matrix
+ */
+export function csFkeep(a, callback, other) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  // columns
+  var n = asize[1];
+  // nonzero items
+  var nz = 0;
+  // loop columns
+  for (var j = 0; j < n; j++) {
+    // get current location of col j
+    var p = aptr[j];
+    // record new location of col j
+    aptr[j] = nz;
+    for (; p < aptr[j + 1]; p++) {
+      // check we need to keep this item
+      if (callback(aindex[p], j, avalues ? avalues[p] : 1, other)) {
+        // keep A(i,j)
+        aindex[nz] = aindex[p];
+        // check we need to process values (pattern only)
+        if (avalues) {
+          avalues[nz] = avalues[p];
+        }
+        // increment nonzero items
+        nz++;
+      }
+    }
+  }
+  // finalize A
+  aptr[n] = nz;
+  // trim arrays
+  aindex.splice(nz, aindex.length - nz);
+  // check we need to process values (pattern only)
+  if (avalues) {
+    avalues.splice(nz, avalues.length - nz);
+  }
+  // return number of nonzero items
+  return nz;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js
new file mode 100644
index 0000000..f375c03
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csFlip.js
@@ -0,0 +1,13 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * This function "flips" its input about the integer -1.
+ *
+ * @param {Number}  i               The value to flip
+ */
+export function csFlip(i) {
+  // flip the value
+  return -i - 2;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js
new file mode 100644
index 0000000..8a4eb24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csIpvec.js
@@ -0,0 +1,33 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
+ *
+ * @param {Array} p           The permutation vector of length n. null value denotes identity
+ * @param {Array} b           The input vector
+ *
+ * @return {Array}            The output vector x = P'b
+ */
+export function csIpvec(p, b) {
+  // vars
+  var k;
+  var n = b.length;
+  var x = [];
+  // check permutation vector was provided, p = null denotes identity
+  if (p) {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // apply permutation
+      x[p[k]] = b[k];
+    }
+  } else {
+    // loop vector
+    for (k = 0; k < n; k++) {
+      // x[i] = b[i]
+      x[k] = b[k];
+    }
+  }
+  return x;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js
new file mode 100644
index 0000000..9b23e52
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLeaf.js
@@ -0,0 +1,56 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * This function determines if j is a leaf of the ith row subtree.
+ * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
+ *
+ * @param {Number}  i               The ith row subtree
+ * @param {Number}  j               The node to test
+ * @param {Array}   w               The workspace array
+ * @param {Number}  first           The index offset within the workspace for the first array
+ * @param {Number}  maxfirst        The index offset within the workspace for the maxfirst array
+ * @param {Number}  prevleaf        The index offset within the workspace for the prevleaf array
+ * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
+ *
+ * @return {Object}
+ */
+export function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
+  var s, sparent;
+
+  // our result
+  var jleaf = 0;
+  var q;
+
+  // check j is a leaf
+  if (i <= j || w[first + j] <= w[maxfirst + i]) {
+    return -1;
+  }
+  // update max first[j] seen so far
+  w[maxfirst + i] = w[first + j];
+  // jprev = previous leaf of ith subtree
+  var jprev = w[prevleaf + i];
+  w[prevleaf + i] = j;
+
+  // check j is first or subsequent leaf
+  if (jprev === -1) {
+    // 1st leaf, q = root of ith subtree
+    jleaf = 1;
+    q = i;
+  } else {
+    // update jleaf
+    jleaf = 2;
+    // q = least common ancester (jprev,j)
+    for (q = jprev; q !== w[ancestor + q]; q = w[ancestor + q]);
+    for (s = jprev; s !== q; s = sparent) {
+      // path compression
+      sparent = w[ancestor + s];
+      w[ancestor + s] = q;
+    }
+  }
+  return {
+    jleaf,
+    q
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js
new file mode 100644
index 0000000..544f4fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csLu.js
@@ -0,0 +1,182 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+import { factory } from '../../../utils/factory.js';
+import { createCsSpsolve } from './csSpsolve.js';
+var name = 'csLu';
+var dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
+export var createCsLu = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    abs,
+    divideScalar,
+    multiply,
+    subtract,
+    larger,
+    largerEq,
+    SparseMatrix
+  } = _ref;
+  var csSpsolve = createCsSpsolve({
+    divideScalar,
+    multiply,
+    subtract
+  });
+
+  /**
+   * Computes the numeric LU factorization of the sparse matrix A. Implements a Left-looking LU factorization
+   * algorithm that computes L and U one column at a tume. At the kth step, it access columns 1 to k-1 of L
+   * and column k of A. Given the fill-reducing column ordering q (see parameter s) computes L, U and pinv so
+   * L * U = A(p, q), where p is the inverse of pinv.
+   *
+   * @param {Matrix}  m               The A Matrix to factorize
+   * @param {Object}  s               The symbolic analysis from csSqr(). Provides the fill-reducing
+   *                                  column ordering q
+   * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)
+   *
+   * @return {Number}                 The numeric LU factorization of A or null
+   */
+  return function csLu(m, s, tol) {
+    // validate input
+    if (!m) {
+      return null;
+    }
+    // m arrays
+    var size = m._size;
+    // columns
+    var n = size[1];
+    // symbolic analysis result
+    var q;
+    var lnz = 100;
+    var unz = 100;
+    // update symbolic analysis parameters
+    if (s) {
+      q = s.q;
+      lnz = s.lnz || lnz;
+      unz = s.unz || unz;
+    }
+    // L arrays
+    var lvalues = []; // (lnz)
+    var lindex = []; // (lnz)
+    var lptr = []; // (n + 1)
+    // L
+    var L = new SparseMatrix({
+      values: lvalues,
+      index: lindex,
+      ptr: lptr,
+      size: [n, n]
+    });
+    // U arrays
+    var uvalues = []; // (unz)
+    var uindex = []; // (unz)
+    var uptr = []; // (n + 1)
+    // U
+    var U = new SparseMatrix({
+      values: uvalues,
+      index: uindex,
+      ptr: uptr,
+      size: [n, n]
+    });
+    // inverse of permutation vector
+    var pinv = []; // (n)
+    // vars
+    var i, p;
+    // allocate arrays
+    var x = []; // (n)
+    var xi = []; // (2 * n)
+    // initialize variables
+    for (i = 0; i < n; i++) {
+      // clear workspace
+      x[i] = 0;
+      // no rows pivotal yet
+      pinv[i] = -1;
+      // no cols of L yet
+      lptr[i + 1] = 0;
+    }
+    // reset number of nonzero elements in L and U
+    lnz = 0;
+    unz = 0;
+    // compute L(:,k) and U(:,k)
+    for (var k = 0; k < n; k++) {
+      // update ptr
+      lptr[k] = lnz;
+      uptr[k] = unz;
+      // apply column permutations if needed
+      var col = q ? q[k] : k;
+      // solve triangular system, x = L\A(:,col)
+      var top = csSpsolve(L, m, col, xi, x, pinv, 1);
+      // find pivot
+      var ipiv = -1;
+      var a = -1;
+      // loop xi[] from top -> n
+      for (p = top; p < n; p++) {
+        // x[i] is nonzero
+        i = xi[p];
+        // check row i is not yet pivotal
+        if (pinv[i] < 0) {
+          // absolute value of x[i]
+          var xabs = abs(x[i]);
+          // check absoulte value is greater than pivot value
+          if (larger(xabs, a)) {
+            // largest pivot candidate so far
+            a = xabs;
+            ipiv = i;
+          }
+        } else {
+          // x(i) is the entry U(pinv[i],k)
+          uindex[unz] = pinv[i];
+          uvalues[unz++] = x[i];
+        }
+      }
+      // validate we found a valid pivot
+      if (ipiv === -1 || a <= 0) {
+        return null;
+      }
+      // update actual pivot column, give preference to diagonal value
+      if (pinv[col] < 0 && largerEq(abs(x[col]), multiply(a, tol))) {
+        ipiv = col;
+      }
+      // the chosen pivot
+      var pivot = x[ipiv];
+      // last entry in U(:,k) is U(k,k)
+      uindex[unz] = k;
+      uvalues[unz++] = pivot;
+      // ipiv is the kth pivot row
+      pinv[ipiv] = k;
+      // first entry in L(:,k) is L(k,k) = 1
+      lindex[lnz] = ipiv;
+      lvalues[lnz++] = 1;
+      // L(k+1:n,k) = x / pivot
+      for (p = top; p < n; p++) {
+        // row
+        i = xi[p];
+        // check x(i) is an entry in L(:,k)
+        if (pinv[i] < 0) {
+          // save unpermuted row in L
+          lindex[lnz] = i;
+          // scale pivot column
+          lvalues[lnz++] = divideScalar(x[i], pivot);
+        }
+        // x[0..n-1] = 0 for next k
+        x[i] = 0;
+      }
+    }
+    // update ptr
+    lptr[n] = lnz;
+    uptr[n] = unz;
+    // fix row indices of L for final pinv
+    for (p = 0; p < lnz; p++) {
+      lindex[p] = pinv[lindex[p]];
+    }
+    // trim arrays
+    lvalues.splice(lnz, lvalues.length - lnz);
+    lindex.splice(lnz, lindex.length - lnz);
+    uvalues.splice(unz, uvalues.length - unz);
+    uindex.splice(unz, uindex.length - unz);
+    // return LU factor
+    return {
+      L,
+      U,
+      pinv
+    };
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js
new file mode 100644
index 0000000..ace68c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMark.js
@@ -0,0 +1,16 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+import { csFlip } from './csFlip.js';
+
+/**
+ * Marks the node at w[j]
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ */
+export function csMark(w, j) {
+  // mark w[j]
+  w[j] = csFlip(w[j]);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js
new file mode 100644
index 0000000..0d0e5b5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csMarked.js
@@ -0,0 +1,14 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Checks if the node at w[j] is marked
+ *
+ * @param {Array}   w               The array
+ * @param {Number}  j               The array index
+ */
+export function csMarked(w, j) {
+  // check node is marked
+  return w[j] < 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js
new file mode 100644
index 0000000..044b656
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPermute.js
@@ -0,0 +1,61 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Permutes a sparse matrix C = P * A * Q
+ *
+ * @param {SparseMatrix}  a         The Matrix A
+ * @param {Array}   pinv            The row permutation vector
+ * @param {Array}   q               The column permutation vector
+ * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise
+ *
+ * @return {Matrix}                 C = P * A * Q, null on error
+ */
+export function csPermute(a, pinv, q, values) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+  var asize = a._size;
+  var adt = a._datatype;
+  // rows & columns
+  var m = asize[0];
+  var n = asize[1];
+  // c arrays
+  var cvalues = values && a._values ? [] : null;
+  var cindex = []; // (aptr[n])
+  var cptr = []; // (n + 1)
+  // initialize vars
+  var nz = 0;
+  // loop columns
+  for (var k = 0; k < n; k++) {
+    // column k of C is column q[k] of A
+    cptr[k] = nz;
+    // apply column permutation
+    var j = q ? q[k] : k;
+    // loop values in column j of A
+    for (var t0 = aptr[j], t1 = aptr[j + 1], t = t0; t < t1; t++) {
+      // row i of A is row pinv[i] of C
+      var r = pinv ? pinv[aindex[t]] : aindex[t];
+      // index
+      cindex[nz] = r;
+      // check we need to populate values
+      if (cvalues) {
+        cvalues[nz] = avalues[t];
+      }
+      // increment number of nonzero elements
+      nz++;
+    }
+  }
+  // finalize the last column of C
+  cptr[n] = nz;
+  // return C matrix
+  return a.createSparseMatrix({
+    values: cvalues,
+    index: cindex,
+    ptr: cptr,
+    size: [m, n],
+    datatype: adt
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js
new file mode 100644
index 0000000..6ff7c3f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csPost.js
@@ -0,0 +1,52 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csTdfs } from './csTdfs.js';
+
+/**
+ * Post order a tree of forest
+ *
+ * @param {Array}   parent          The tree or forest
+ * @param {Number}  n               Number of columns
+ */
+export function csPost(parent, n) {
+  // check inputs
+  if (!parent) {
+    return null;
+  }
+  // vars
+  var k = 0;
+  var j;
+  // allocate result
+  var post = []; // (n)
+  // workspace, head: first n entries, next: next n entries, stack: last n entries
+  var w = []; // (3 * n)
+  var head = 0;
+  var next = n;
+  var stack = 2 * n;
+  // initialize workspace
+  for (j = 0; j < n; j++) {
+    // empty linked lists
+    w[head + j] = -1;
+  }
+  // traverse nodes in reverse order
+  for (j = n - 1; j >= 0; j--) {
+    // check j is a root
+    if (parent[j] === -1) {
+      continue;
+    }
+    // add j to list of its parent
+    w[next + j] = w[head + parent[j]];
+    w[head + parent[j]] = j;
+  }
+  // loop nodes
+  for (j = 0; j < n; j++) {
+    // skip j if it is not a root
+    if (parent[j] !== -1) {
+      continue;
+    }
+    // depth-first search
+    k = csTdfs(j, k, w, head, next, post, stack);
+  }
+  return post;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js
new file mode 100644
index 0000000..2f49fb9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csReach.js
@@ -0,0 +1,52 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+import { csMarked } from './csMarked.js';
+import { csMark } from './csMark.js';
+import { csDfs } from './csDfs.js';
+
+/**
+ * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
+ * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
+ * nonzero pattern xi of the solution x to the sparse linear system Lx=b is given by X=Reach(B).
+ *
+ * @param {Matrix}  g               The G matrix
+ * @param {Matrix}  b               The B matrix
+ * @param {Number}  k               The kth column in B
+ * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+ *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+ * @param {Array}   pinv            The inverse row permutation vector
+ *
+ * @return {Number}                 The index for the nonzero pattern
+ */
+export function csReach(g, b, k, xi, pinv) {
+  // g arrays
+  var gptr = g._ptr;
+  var gsize = g._size;
+  // b arrays
+  var bindex = b._index;
+  var bptr = b._ptr;
+  // columns
+  var n = gsize[1];
+  // vars
+  var p, p0, p1;
+  // initialize top
+  var top = n;
+  // loop column indeces in B
+  for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+    // node i
+    var i = bindex[p];
+    // check node i is marked
+    if (!csMarked(gptr, i)) {
+      // start a dfs at unmarked node i
+      top = csDfs(i, g, top, xi, pinv);
+    }
+  }
+  // loop columns from top -> n - 1
+  for (p = top; p < n; p++) {
+    // restore G
+    csMark(gptr, xi[p]);
+  }
+  return top;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js
new file mode 100644
index 0000000..82f6f6a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSpsolve.js
@@ -0,0 +1,84 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csReach } from './csReach.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSpsolve';
+var dependencies = ['divideScalar', 'multiply', 'subtract'];
+export var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    divideScalar,
+    multiply,
+    subtract
+  } = _ref;
+  /**
+   * The function csSpsolve() computes the solution to G * x = bk, where bk is the
+   * kth column of B. When lo is true, the function assumes G = L is lower triangular with the
+   * diagonal entry as the first entry in each column. When lo is true, the function assumes G = U
+   * is upper triangular with the diagonal entry as the last entry in each column.
+   *
+   * @param {Matrix}  g               The G matrix
+   * @param {Matrix}  b               The B matrix
+   * @param {Number}  k               The kth column in B
+   * @param {Array}   xi              The nonzero pattern xi[top] .. xi[n - 1], an array of size = 2 * n
+   *                                  The first n entries is the nonzero pattern, the last n entries is the stack
+   * @param {Array}   x               The soluton to the linear system G * x = b
+   * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
+   * @param {boolean} lo              The lower (true) upper triangular (false) flag
+   *
+   * @return {Number}                 The index for the nonzero pattern
+   */
+  return function csSpsolve(g, b, k, xi, x, pinv, lo) {
+    // g arrays
+    var gvalues = g._values;
+    var gindex = g._index;
+    var gptr = g._ptr;
+    var gsize = g._size;
+    // columns
+    var n = gsize[1];
+    // b arrays
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    // vars
+    var p, p0, p1, q;
+    // xi[top..n-1] = csReach(B(:,k))
+    var top = csReach(g, b, k, xi, pinv);
+    // clear x
+    for (p = top; p < n; p++) {
+      x[xi[p]] = 0;
+    }
+    // scatter b
+    for (p0 = bptr[k], p1 = bptr[k + 1], p = p0; p < p1; p++) {
+      x[bindex[p]] = bvalues[p];
+    }
+    // loop columns
+    for (var px = top; px < n; px++) {
+      // x array index for px
+      var j = xi[px];
+      // apply permutation vector (U x = b), j maps to column J of G
+      var J = pinv ? pinv[j] : j;
+      // check column J is empty
+      if (J < 0) {
+        continue;
+      }
+      // column value indeces in G, p0 <= p < p1
+      p0 = gptr[J];
+      p1 = gptr[J + 1];
+      // x(j) /= G(j,j)
+      x[j] = divideScalar(x[j], gvalues[lo ? p0 : p1 - 1]);
+      // first entry L(j,j)
+      p = lo ? p0 + 1 : p0;
+      q = lo ? p1 : p1 - 1;
+      // loop
+      for (; p < q; p++) {
+        // row
+        var i = gindex[p];
+        // x(i) -= G(i,j) * x(j)
+        x[i] = subtract(x[i], multiply(gvalues[p], x[j]));
+      }
+    }
+    // return top of stack
+    return top;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js
new file mode 100644
index 0000000..a26579a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js
@@ -0,0 +1,179 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csPermute } from './csPermute.js';
+import { csPost } from './csPost.js';
+import { csEtree } from './csEtree.js';
+import { createCsAmd } from './csAmd.js';
+import { createCsCounts } from './csCounts.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSqr';
+var dependencies = ['add', 'multiply', 'transpose'];
+export var createCsSqr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  var csAmd = createCsAmd({
+    add,
+    multiply,
+    transpose
+  });
+  var csCounts = createCsCounts({
+    transpose
+  });
+
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   */
+  return function csSqr(order, a, qr) {
+    // a arrays
+    var aptr = a._ptr;
+    var asize = a._size;
+    // columns
+    var n = asize[1];
+    // vars
+    var k;
+    // symbolic analysis result
+    var s = {};
+    // fill-reducing ordering
+    s.q = csAmd(order, a);
+    // validate results
+    if (order && !s.q) {
+      return null;
+    }
+    // QR symbolic analysis
+    if (qr) {
+      // apply permutations if needed
+      var c = order ? csPermute(a, null, s.q, 0) : a;
+      // etree of C'*C, where C=A(:,q)
+      s.parent = csEtree(c, 1);
+      // post order elimination tree
+      var post = csPost(s.parent, n);
+      // col counts chol(C'*C)
+      s.cp = csCounts(c, s.parent, post, 1);
+      // check we have everything needed to calculate number of nonzero elements
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    }
+    // return result S
+    return s;
+  };
+
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+  function _vcount(a, s) {
+    // a arrays
+    var aptr = a._ptr;
+    var aindex = a._index;
+    var asize = a._size;
+    // rows & columns
+    var m = asize[0];
+    var n = asize[1];
+    // initialize s arrays
+    s.pinv = []; // (m + n)
+    s.leftmost = []; // (m)
+    // vars
+    var parent = s.parent;
+    var pinv = s.pinv;
+    var leftmost = s.leftmost;
+    // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+    var w = []; // (m + 3 * n)
+    var next = 0;
+    var head = m;
+    var tail = m + n;
+    var nque = m + 2 * n;
+    // vars
+    var i, k, p, p0, p1;
+    // initialize w
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    }
+    // initialize row arrays
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    }
+    // loop columns backwards
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    }
+    // scan rows in reverse order
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i];
+      // check row i is empty
+      if (k === -1) {
+        continue;
+      }
+      // first row in queue k
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      }
+      // put i at head of queue k
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+    s.lnz = 0;
+    s.m2 = m;
+    // find row permutation and nnz(V)
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k];
+      // count V(k,k) as nonzero
+      s.lnz++;
+      // add a fictitious row
+      if (i < 0) {
+        i = s.m2++;
+      }
+      // associate row i with V(:,k)
+      pinv[i] = k;
+      // skip if V(k+1:m,k) is empty
+      if (--nque[k] <= 0) {
+        continue;
+      }
+      // nque[k] is nnz (V(k+1:m,k))
+      s.lnz += w[nque + k];
+      // move all rows to parent of k
+      var pa = parent[k];
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+    return true;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js
new file mode 100644
index 0000000..f1b0321
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js
@@ -0,0 +1,93 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csCumsum } from './csCumsum.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSymperm';
+var dependencies = ['conj', 'SparseMatrix'];
+export var createCsSymperm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    conj,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    // columns
+    var n = asize[1];
+    // C matrix arrays
+    var cvalues = values && avalues ? [] : null;
+    var cindex = []; // (nz)
+    var cptr = []; // (n + 1)
+    // variables
+    var i, i2, j, j2, p, p0, p1;
+    // create workspace vector
+    var w = []; // (n)
+    // count entries in each column of C
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // column count of C
+        w[Math.max(i2, j2)]++;
+      }
+    }
+    // compute column pointers of C
+    csCumsum(cptr, w, n);
+    // loop columns
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j;
+      // loop values in column j
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p];
+        // skip lower triangular part of A
+        if (i > j) {
+          continue;
+        }
+        // row i of A is row i2 of C
+        i2 = pinv ? pinv[i] : i;
+        // C index for column j2
+        var q = w[Math.max(i2, j2)]++;
+        // update C index for entry q
+        cindex[q] = Math.min(i2, j2);
+        // check we need to process values
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    }
+    // return C matrix
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js
new file mode 100644
index 0000000..d4b851c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js
@@ -0,0 +1,42 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ */
+export function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  var top = 0;
+  // place j on the stack
+  w[stack] = j;
+  // while (stack is not empty)
+  while (top >= 0) {
+    // p = top of stack
+    var p = w[stack + top];
+    // i = youngest child of p
+    var i = w[head + p];
+    if (i === -1) {
+      // p has no unordered children left
+      top--;
+      // node p is the kth postordered node
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i];
+      // increment top
+      ++top;
+      // start dfs on child node i
+      w[stack + top] = i;
+    }
+  }
+  return k;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js b/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js
new file mode 100644
index 0000000..923dc28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js
@@ -0,0 +1,14 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+import { csFlip } from './csFlip.js';
+
+/**
+ * Flips the value if it is negative of returns the same value otherwise.
+ *
+ * @param {Number}  i               The value to flip
+ */
+export function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? csFlip(i) : i;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/sylvester.js b/node_modules/mathjs/lib/esm/function/algebra/sylvester.js
new file mode 100644
index 0000000..7db0b93
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/sylvester.js
@@ -0,0 +1,118 @@
+import { factory } from '../../utils/factory.js';
+var name = 'sylvester';
+var dependencies = ['typed', 'schur', 'matrixFromColumns', 'matrix', 'multiply', 'range', 'concat', 'transpose', 'index', 'subset', 'add', 'subtract', 'identity', 'lusolve', 'abs'];
+export var createSylvester = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    schur,
+    matrixFromColumns,
+    matrix,
+    multiply,
+    range,
+    concat,
+    transpose,
+    index,
+    subset,
+    add,
+    subtract,
+    identity,
+    lusolve,
+    abs
+  } = _ref;
+  /**
+   *
+   * Solves the real-valued Sylvester equation AX+XB=C for X, where A, B and C are
+   * matrices of appropriate dimensions, being A and B squared. Notice that other
+   * equivalent definitions for the Sylvester equation exist and this function
+   * assumes the one presented in the original publication of the the Bartels-
+   * Stewart algorithm, which is implemented by this function.
+   * https://en.wikipedia.org/wiki/Sylvester_equation
+   *
+   * Syntax:
+   *
+   *     math.sylvester(A, B, C)
+   *
+   * Examples:
+   *
+   *     const A = [[-1, -2], [1, 1]]
+   *     const B = [[2, -1], [1, -2]]
+   *     const C = [[-3, 2], [3, 0]]
+   *     math.sylvester(A, B, C)      // returns DenseMatrix [[-0.25, 0.25], [1.5, -1.25]]
+   *
+   * See also:
+   *
+   *     schur, lyap
+   *
+   * @param {Matrix | Array} A  Matrix A
+   * @param {Matrix | Array} B  Matrix B
+   * @param {Matrix | Array} C  Matrix C
+   * @return {Matrix | Array}   Matrix X, solving the Sylvester equation
+   */
+  return typed(name, {
+    'Matrix, Matrix, Matrix': _sylvester,
+    'Array, Matrix, Matrix': function Array_Matrix_Matrix(A, B, C) {
+      return _sylvester(matrix(A), B, C);
+    },
+    'Array, Array, Matrix': function Array_Array_Matrix(A, B, C) {
+      return _sylvester(matrix(A), matrix(B), C);
+    },
+    'Array, Matrix, Array': function Array_Matrix_Array(A, B, C) {
+      return _sylvester(matrix(A), B, matrix(C));
+    },
+    'Matrix, Array, Matrix': function Matrix_Array_Matrix(A, B, C) {
+      return _sylvester(A, matrix(B), C);
+    },
+    'Matrix, Array, Array': function Matrix_Array_Array(A, B, C) {
+      return _sylvester(A, matrix(B), matrix(C));
+    },
+    'Matrix, Matrix, Array': function Matrix_Matrix_Array(A, B, C) {
+      return _sylvester(A, B, matrix(C));
+    },
+    'Array, Array, Array': function Array_Array_Array(A, B, C) {
+      return _sylvester(matrix(A), matrix(B), matrix(C)).toArray();
+    }
+  });
+  function _sylvester(A, B, C) {
+    var n = B.size()[0];
+    var m = A.size()[0];
+    var sA = schur(A);
+    var F = sA.T;
+    var U = sA.U;
+    var sB = schur(multiply(-1, B));
+    var G = sB.T;
+    var V = sB.U;
+    var D = multiply(multiply(transpose(U), C), V);
+    var all = range(0, m);
+    var y = [];
+    var hc = (a, b) => concat(a, b, 1);
+    var vc = (a, b) => concat(a, b, 0);
+    for (var k = 0; k < n; k++) {
+      if (k < n - 1 && abs(subset(G, index(k + 1, k))) > 1e-5) {
+        var RHS = vc(subset(D, index(all, k)), subset(D, index(all, k + 1)));
+        for (var j = 0; j < k; j++) {
+          RHS = add(RHS, vc(multiply(y[j], subset(G, index(j, k))), multiply(y[j], subset(G, index(j, k + 1)))));
+        }
+        var gkk = multiply(identity(m), multiply(-1, subset(G, index(k, k))));
+        var gmk = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k))));
+        var gkm = multiply(identity(m), multiply(-1, subset(G, index(k, k + 1))));
+        var gmm = multiply(identity(m), multiply(-1, subset(G, index(k + 1, k + 1))));
+        var LHS = vc(hc(add(F, gkk), gmk), hc(gkm, add(F, gmm)));
+        var yAux = lusolve(LHS, RHS);
+        y[k] = yAux.subset(index(range(0, m), 0));
+        y[k + 1] = yAux.subset(index(range(m, 2 * m), 0));
+        k++;
+      } else {
+        var _RHS = subset(D, index(all, k));
+        for (var _j = 0; _j < k; _j++) {
+          _RHS = add(_RHS, multiply(y[_j], subset(G, index(_j, k))));
+        }
+        var _gkk = subset(G, index(k, k));
+        var _LHS = subtract(F, multiply(_gkk, identity(m)));
+        y[k] = lusolve(_LHS, _RHS);
+      }
+    }
+    var Y = matrix(matrixFromColumns(...y));
+    var X = multiply(U, multiply(Y, transpose(V)));
+    return X;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js b/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js
new file mode 100644
index 0000000..ad92304
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js
@@ -0,0 +1,60 @@
+import { isConstantNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'symbolicEqual';
+var dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+export var createSymbolicEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    simplify,
+    typed,
+    OperatorNode
+  } = _ref;
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *     math.symbolicEqual(expr1, expr2)
+   *     math.symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *     math.symbolicEqual('x*y', 'y*x') // Returns true
+   *     math.symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}}) // Returns false
+   *     math.symbolicEqual('x/y', '(y*x^(-1))^(-1)') // Returns true
+   *     math.symbolicEqual('abs(x)','x') // Returns false
+   *     math.symbolicEqual('abs(x)','x', simplify.positiveContext) // Returns true
+   *
+   * See also:
+   *
+   *     simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  function _symbolicEqual(e1, e2) {
+    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+    var diff = new OperatorNode('-', 'subtract', [e1, e2]);
+    var simplified = simplify(diff, {}, options);
+    return isConstantNode(simplified) && !simplified.value;
+  }
+  return typed(name, {
+    'Node, Node': _symbolicEqual,
+    'Node, Node, Object': _symbolicEqual
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/abs.js b/node_modules/mathjs/lib/esm/function/arithmetic/abs.js
new file mode 100644
index 0000000..8a89a06
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/abs.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { absNumber } from '../../plain/number/index.js';
+var name = 'abs';
+var dependencies = ['typed'];
+export var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: absNumber,
+    'Complex | BigNumber | Fraction | Unit': x => x.abs(),
+    bigint: x => x < 0n ? -x : x,
+    // deep map collection, skip zeros since abs(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/add.js b/node_modules/mathjs/lib/esm/function/arithmetic/add.js
new file mode 100644
index 0000000..93704bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/add.js
@@ -0,0 +1,83 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'add';
+var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix', 'concat'];
+export var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    equalScalar,
+    DenseMatrix,
+    SparseMatrix,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo04xSidSid = createMatAlgo04xSidSid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  /**
+   * Add two or more values, `x + y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.add(x, y)
+   *    math.add(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.add(2, 3)               // returns number 5
+   *    math.add(2, 3, 4)            // returns number 9
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(-4, 1)
+   *    math.add(a, b)               // returns Complex -2 + 4i
+   *
+   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   *    const c = math.unit('5 cm')
+   *    const d = math.unit('2.1 mm')
+   *    math.add(c, d)               // returns Unit 52.1 mm
+   *
+   *    math.add("2.3", "4")         // returns number 6.3
+   *
+   * See also:
+   *
+   *    subtract, sum
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
+  return typed(name, {
+    'any, any': addScalar,
+    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {
+      var result = self(x, y);
+      for (var i = 0; i < rest.length; i++) {
+        result = self(result, rest[i]);
+      }
+      return result;
+    })
+  }, matrixAlgorithmSuite({
+    elop: addScalar,
+    DS: matAlgo01xDSid,
+    SS: matAlgo04xSidSid,
+    Ss: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js
new file mode 100644
index 0000000..490e90b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+import { addNumber } from '../../plain/number/index.js';
+var name = 'addScalar';
+var dependencies = ['typed'];
+export var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Add two scalar values, `x + y`.
+   * This function is meant for internal use: it is used by the public function
+   * `add`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to add
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to add
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Sum of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': addNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.add(y);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.plus(y);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x + y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return x.add(y);
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (x.value === null || x.value === undefined) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+      if (y.value === null || y.value === undefined) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      var res = x.clone();
+      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js b/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js
new file mode 100644
index 0000000..1038b2b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/cbrt.js
@@ -0,0 +1,131 @@
+import { factory } from '../../utils/factory.js';
+import { isBigNumber, isComplex, isFraction } from '../../utils/is.js';
+import { cbrtNumber } from '../../plain/number/index.js';
+var name = 'cbrt';
+var dependencies = ['config', 'typed', 'isNegative', 'unaryMinus', 'matrix', 'Complex', 'BigNumber', 'Fraction'];
+export var createCbrt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    isNegative,
+    unaryMinus,
+    matrix,
+    Complex,
+    BigNumber,
+    Fraction
+  } = _ref;
+  /**
+   * Calculate the cubic root of a value.
+   *
+   * To avoid confusion with the matrix cube root, this function does not
+   * apply to matrices. For a matrix, to take the cube root elementwise,
+   * see the examples.
+   *
+   * Syntax:
+   *
+   *    math.cbrt(x)
+   *    math.cbrt(x, allRoots)
+   *
+   * Examples:
+   *
+   *    math.cbrt(27)                  // returns 3
+   *    math.cube(3)                   // returns 27
+   *    math.cbrt(-64)                 // returns -4
+   *    math.cbrt(math.unit('27 m^3')) // returns Unit 3 m
+   *    math.map([27, 64, 125], x => math.cbrt(x))       // returns [3, 4, 5]
+   *
+   *    const x = math.complex('8i')
+   *    math.cbrt(x)                   // returns Complex 1.7320508075689 + i
+   *    math.cbrt(x, true)             // returns Matrix [
+   *                                    //    1.7320508075689 + i
+   *                                    //   -1.7320508075689 + i
+   *                                    //   -2i
+   *                                    // ]
+   *
+   * See also:
+   *
+   *    square, sqrt, cube
+   *
+   * @param {number | BigNumber | Complex | Unit} x
+   *            Value for which to calculate the cubic root.
+   * @param {boolean} [allRoots]  Optional, false by default. Only applicable
+   *            when `x` is a number or complex number. If true, all complex
+   *            roots are returned, if false (default) the principal root is
+   *            returned.
+   * @return {number | BigNumber | Complex | Unit}
+   *            Returns the cubic root of `x`
+   */
+  return typed(name, {
+    number: cbrtNumber,
+    // note: signature 'number, boolean' is also supported,
+    //       created by typed as it knows how to convert number to Complex
+
+    Complex: _cbrtComplex,
+    'Complex, boolean': _cbrtComplex,
+    BigNumber: function BigNumber(x) {
+      return x.cbrt();
+    },
+    Unit: _cbrtUnit
+  });
+
+  /**
+   * Calculate the cubic root for a complex number
+   * @param {Complex} x
+   * @param {boolean} [allRoots]   If true, the function will return an array
+   *                               with all three roots. If false or undefined,
+   *                               the principal root is returned.
+   * @returns {Complex | Array.<Complex> | Matrix.<Complex>} Returns the cubic root(s) of x
+   * @private
+   */
+  function _cbrtComplex(x, allRoots) {
+    // https://www.wikiwand.com/en/Cube_root#/Complex_numbers
+
+    var arg3 = x.arg() / 3;
+    var abs = x.abs();
+
+    // principal root:
+    var principal = new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3).exp());
+    if (allRoots) {
+      var all = [principal, new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 + Math.PI * 2 / 3).exp()), new Complex(cbrtNumber(abs), 0).mul(new Complex(0, arg3 - Math.PI * 2 / 3).exp())];
+      return config.matrix === 'Array' ? all : matrix(all);
+    } else {
+      return principal;
+    }
+  }
+
+  /**
+   * Calculate the cubic root for a Unit
+   * @param {Unit} x
+   * @return {Unit} Returns the cubic root of x
+   * @private
+   */
+  function _cbrtUnit(x) {
+    if (x.value && isComplex(x.value)) {
+      var result = x.clone();
+      result.value = 1.0;
+      result = result.pow(1.0 / 3); // Compute the units
+      result.value = _cbrtComplex(x.value); // Compute the value
+      return result;
+    } else {
+      var negate = isNegative(x.value);
+      if (negate) {
+        x.value = unaryMinus(x.value);
+      }
+
+      // TODO: create a helper function for this
+      var third;
+      if (isBigNumber(x.value)) {
+        third = new BigNumber(1).div(3);
+      } else if (isFraction(x.value)) {
+        third = new Fraction(1, 3);
+      } else {
+        third = 1 / 3;
+      }
+      var _result = x.pow(third);
+      if (negate) {
+        _result.value = unaryMinus(_result.value);
+      }
+      return _result;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js b/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js
new file mode 100644
index 0000000..3bb02f7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/ceil.js
@@ -0,0 +1,188 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { isInteger, nearlyEqual } from '../../utils/number.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+var name = 'ceil';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+var bigTen = new Decimal(10);
+export var createCeilNumber = /* #__PURE__ */factory(name, ['typed', 'config', 'round'], _ref => {
+  var {
+    typed,
+    config,
+    round
+  } = _ref;
+  function _ceilNumber(x) {
+    // See ./floor.js _floorNumber for rationale here
+    var c = Math.ceil(x);
+    var r = round(x);
+    if (c === r) return c;
+    if (nearlyEqual(x, r, config.relTol, config.absTol) && !nearlyEqual(x, c, config.relTol, config.absTol)) {
+      return r;
+    }
+    return c;
+  }
+  return typed(name, {
+    number: _ceilNumber,
+    'number, number': function number_number(x, n) {
+      if (!isInteger(n)) {
+        throw new RangeError('number of decimals in function ceil must be an integer');
+      }
+      if (n < 0 || n > 15) {
+        throw new RangeError('number of decimals in ceil number must be in range 0-15');
+      }
+      var shift = 10 ** n;
+      return _ceilNumber(x * shift) / shift;
+    }
+  });
+});
+export var createCeil = /* #__PURE__ */factory(name, dependencies, _ref2 => {
+  var {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var ceilNumber = createCeilNumber({
+    typed,
+    config,
+    round
+  });
+  function _bigCeil(x) {
+    // see ./floor.js _floorNumber for rationale
+    var bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol);
+    var c = x.ceil();
+    var r = round(x);
+    if (c.eq(r)) return c;
+    if (bne(x, r) && !bne(x, c)) return r;
+    return c;
+  }
+  /**
+   * Round a value towards plus infinity
+   * If `x` is complex, both real and imaginary part are rounded towards plus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.ceil(x)
+   *    math.ceil(x, n)
+   *    math.ceil(unit, valuelessUnit)
+   *    math.ceil(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.ceil(3.2)               // returns number 4
+   *    math.ceil(3.8)               // returns number 4
+   *    math.ceil(-4.2)              // returns number -4
+   *    math.ceil(-4.7)              // returns number -4
+   *
+   *    math.ceil(3.212, 2)          // returns number 3.22
+   *    math.ceil(3.288, 2)          // returns number 3.29
+   *    math.ceil(-4.212, 2)         // returns number -4.21
+   *    math.ceil(-4.782, 2)         // returns number -4.78
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.ceil(c)                 // returns Complex 4 - 2i
+   *    math.ceil(c, 1)              // returns Complex 3.3 - 2.7i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.ceil(unit, 1, cm)      // returns Unit 3.3 cm
+   *    math.ceil(unit, 1, mm)      // returns Unit 32.5 mm
+   *
+   *    math.ceil([3.2, 3.8, -4.7])  // returns Array [4, 4, -4]
+   *    math.ceil([3.21, 3.82, -4.71], 1)  // returns Array [3.3, 3.9, -4.7]
+   *
+   * See also:
+   *
+   *    floor, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('ceil', {
+    number: ceilNumber.signatures.number,
+    'number,number': ceilNumber.signatures['number,number'],
+    Complex: function Complex(x) {
+      return x.ceil();
+    },
+    'Complex, number': function Complex_number(x, n) {
+      return x.ceil(n);
+    },
+    'Complex, BigNumber': function Complex_BigNumber(x, n) {
+      return x.ceil(n.toNumber());
+    },
+    BigNumber: _bigCeil,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {
+      var shift = bigTen.pow(n);
+      return _bigCeil(x.mul(shift)).div(shift);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function Fraction(x) {
+      return x.ceil();
+    },
+    'Fraction, number': function Fraction_number(x, n) {
+      return x.ceil(n);
+    },
+    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {
+      return x.ceil(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      var valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, self, true);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, i => self(i, n), true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/cube.js b/node_modules/mathjs/lib/esm/function/arithmetic/cube.js
new file mode 100644
index 0000000..71aad9e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/cube.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { cubeNumber } from '../../plain/number/index.js';
+var name = 'cube';
+var dependencies = ['typed'];
+export var createCube = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the cube of a value, `x * x * x`.
+   * To avoid confusion with `pow(M,3)`, this function does not apply to matrices.
+   * If you wish to cube every entry of a matrix, see the examples.
+   *
+   * Syntax:
+   *
+   *    math.cube(x)
+   *
+   * Examples:
+   *
+   *    math.cube(2)            // returns number 8
+   *    math.pow(2, 3)          // returns number 8
+   *    math.cube(4)            // returns number 64
+   *    4 * 4 * 4               // returns number 64
+   *
+   *    math.map([1, 2, 3, 4], math.cube) // returns Array [1, 8, 27, 64]
+   *
+   * See also:
+   *
+   *    multiply, square, pow, cbrt
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x  Number for which to calculate the cube
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit} Cube of x
+   */
+  return typed(name, {
+    number: cubeNumber,
+    Complex: function Complex(x) {
+      return x.mul(x).mul(x); // Is faster than pow(x, 3)
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x).times(x);
+    },
+    bigint: function bigint(x) {
+      return x * x * x;
+    },
+    Fraction: function Fraction(x) {
+      return x.pow(3); // Is faster than mul()mul()mul()
+    },
+    Unit: function Unit(x) {
+      return x.pow(3);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/divide.js b/node_modules/mathjs/lib/esm/function/arithmetic/divide.js
new file mode 100644
index 0000000..9c2001e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/divide.js
@@ -0,0 +1,79 @@
+import { factory } from '../../utils/factory.js';
+import { extend } from '../../utils/object.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+var name = 'divide';
+var dependencies = ['typed', 'matrix', 'multiply', 'equalScalar', 'divideScalar', 'inv'];
+export var createDivide = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    multiply,
+    equalScalar,
+    divideScalar,
+    inv
+  } = _ref;
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+
+  /**
+   * Divide two values, `x / y`.
+   * To divide matrices, `x` is multiplied with the inverse of `y`: `x * inv(y)`.
+   *
+   * Syntax:
+   *
+   *    math.divide(x, y)
+   *
+   * Examples:
+   *
+   *    math.divide(2, 3)            // returns number 0.6666666666666666
+   *
+   *    const a = math.complex(5, 14)
+   *    const b = math.complex(4, 1)
+   *    math.divide(a, b)            // returns Complex 2 + 3i
+   *
+   *    const c = [[7, -6], [13, -4]]
+   *    const d = [[1, 2], [4, 3]]
+   *    math.divide(c, d)            // returns Array [[-9, 4], [-11, 6]]
+   *
+   *    const e = math.unit('18 km')
+   *    math.divide(e, 4.5)          // returns Unit 4 km
+   *
+   * See also:
+   *
+   *    multiply
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x   Numerator
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix} y          Denominator
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}                      Quotient, `x / y`
+   */
+  return typed('divide', extend({
+    // we extend the signatures of divideScalar with signatures dealing with matrices
+
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(x, y) {
+      // TODO: implement matrix right division using pseudo inverse
+      // https://www.mathworks.nl/help/matlab/ref/mrdivide.html
+      // https://www.gnu.org/software/octave/doc/interpreter/Arithmetic-Ops.html
+      // https://stackoverflow.com/questions/12263932/how-does-gnu-octave-matrix-division-work-getting-unexpected-behaviour
+      return multiply(x, inv(y));
+    },
+    'DenseMatrix, any': function DenseMatrix_any(x, y) {
+      return matAlgo14xDs(x, y, divideScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrix_any(x, y) {
+      return matAlgo11xS0s(x, y, divideScalar, false);
+    },
+    'Array, any': function Array_any(x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), y, divideScalar, false).valueOf();
+    },
+    'any, Array | Matrix': function any_Array__Matrix(x, y) {
+      return multiply(x, inv(y));
+    }
+  }, divideScalar.signatures));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js
new file mode 100644
index 0000000..bec7bac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+var name = 'divideScalar';
+var dependencies = ['typed', 'numeric'];
+export var createDivideScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    numeric
+  } = _ref;
+  /**
+   * Divide two scalar values, `x / y`.
+   * This function is meant for internal use: it is used by the public functions
+   * `divide` and `inv`.
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   Numerator
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Denominator
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Quotient, `x / y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return x / y;
+    },
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.div(y);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.div(y);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x / y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return x.div(y);
+    },
+    'Unit, number | Complex | Fraction | BigNumber | Unit': (x, y) => x.divide(y),
+    'number | Fraction | Complex | BigNumber, Unit': (x, y) => y.divideInto(x)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js
new file mode 100644
index 0000000..ce7472f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotDivide.js
@@ -0,0 +1,79 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'dotDivide';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'divideScalar', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createDotDivide = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    divideScalar,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Divide two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotDivide(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotDivide(2, 4)   // returns 0.5
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotDivide(a, b)   // returns [[3, 2.5], [1.2, 0.5]]
+   *    math.divide(a, b)      // returns [[1.75, 0.75], [-1.75, 2.25]]
+   *
+   * See also:
+   *
+   *    divide, multiply, dotMultiply
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Numerator
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Denominator
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Quotient, `x ./ y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: divideScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js
new file mode 100644
index 0000000..8e60c9a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotMultiply.js
@@ -0,0 +1,66 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'dotMultiply';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'multiplyScalar', 'concat'];
+export var createDotMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    multiplyScalar,
+    concat
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo09xS0Sf = createMatAlgo09xS0Sf({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Multiply two matrices element wise. The function accepts both matrices and
+   * scalar values.
+   *
+   * Syntax:
+   *
+   *    math.dotMultiply(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotMultiply(2, 4) // returns 8
+   *
+   *    a = [[9, 5], [6, 1]]
+   *    b = [[3, 2], [5, 2]]
+   *
+   *    math.dotMultiply(a, b) // returns [[27, 10], [30, 2]]
+   *    math.multiply(a, b)    // returns [[52, 28], [23, 14]]
+   *
+   * See also:
+   *
+   *    multiply, divide, dotDivide
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x Left hand value
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Right hand value
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}                    Multiplication of `x` and `y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: multiplyScalar,
+    SS: matAlgo09xS0Sf,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js b/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js
new file mode 100644
index 0000000..56765fd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/dotPow.js
@@ -0,0 +1,79 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'dotPow';
+var dependencies = ['typed', 'equalScalar', 'matrix', 'pow', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createDotPow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar,
+    matrix,
+    pow,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var powScalarSignatures = {};
+  for (var signature in pow.signatures) {
+    if (Object.prototype.hasOwnProperty.call(pow.signatures, signature)) {
+      if (!signature.includes('Matrix') && !signature.includes('Array')) {
+        powScalarSignatures[signature] = pow.signatures[signature];
+      }
+    }
+  }
+  var powScalar = typed(powScalarSignatures);
+
+  /**
+   * Calculates the power of x to y element wise.
+   *
+   * Syntax:
+   *
+   *    math.dotPow(x, y)
+   *
+   * Examples:
+   *
+   *    math.dotPow(2, 3)            // returns number 8
+   *
+   *    const a = [[1, 2], [4, 3]]
+   *    math.dotPow(a, 2)            // returns Array [[1, 4], [16, 9]]
+   *    math.pow(a, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   * See also:
+   *
+   *    pow, sqrt, multiply
+   *
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | Complex | Unit | Array | Matrix} y  The exponent
+   * @return {number | BigNumber | Complex | Unit | Array | Matrix}                     The value of `x` to the power `y`
+   */
+  return typed(name, matrixAlgorithmSuite({
+    elop: powScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/exp.js b/node_modules/mathjs/lib/esm/function/arithmetic/exp.js
new file mode 100644
index 0000000..50f3c6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/exp.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+import { expNumber } from '../../plain/number/index.js';
+var name = 'exp';
+var dependencies = ['typed'];
+export var createExp = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the exponential of a value.
+   * For matrices, if you want the matrix exponential of square matrix, use
+   * the `expm` function; if you want to take the exponential of each element,
+   * see the examples.
+   *
+   * Syntax:
+   *
+   *    math.exp(x)
+   *
+   * Examples:
+   *
+   *    math.exp(2)                  // returns number 7.3890560989306495
+   *    math.pow(math.e, 2)          // returns number 7.3890560989306495
+   *    math.log(math.exp(2))        // returns number 2
+   *
+   *    math.map([1, 2, 3], math.exp)
+   *    // returns Array [
+   *    //   2.718281828459045,
+   *    //   7.3890560989306495,
+   *    //   20.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    expm1, expm, log, pow
+   *
+   * @param {number | BigNumber | Complex} x  A number to exponentiate
+   * @return {number | BigNumber | Complex} Exponential of `x`
+   */
+  return typed(name, {
+    number: expNumber,
+    Complex: function Complex(x) {
+      return x.exp();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js b/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js
new file mode 100644
index 0000000..6515327
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/expm1.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { expm1Number } from '../../plain/number/index.js';
+var name = 'expm1';
+var dependencies = ['typed', 'Complex'];
+export var createExpm1 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Complex: _Complex
+  } = _ref;
+  /**
+   * Calculate the value of subtracting 1 from the exponential value.
+   * This function is more accurate than `math.exp(x)-1` when `x` is near 0
+   * To avoid ambiguity with the matrix exponential `expm`, this function
+   * does not operate on matrices; if you wish to apply it elementwise, see
+   * the examples.
+   *
+   * Syntax:
+   *
+   *    math.expm1(x)
+   *
+   * Examples:
+   *
+   *    math.expm1(2)                      // returns number 6.38905609893065
+   *    math.pow(math.e, 2) - 1            // returns number 6.3890560989306495
+   *    math.expm1(1e-8)                   // returns number 1.0000000050000001e-8
+   *    math.exp(1e-8) - 1                 // returns number 9.9999999392253e-9
+   *    math.log(math.expm1(2) + 1)        // returns number 2
+   *
+   *    math.map([1, 2, 3], math.expm1)
+   *    // returns Array [
+   *    //   1.718281828459045,
+   *    //   6.3890560989306495,
+   *    //   19.085536923187668
+   *    // ]
+   *
+   * See also:
+   *
+   *    exp, expm, log, pow
+   *
+   * @param {number | BigNumber | Complex} x  The number to exponentiate
+   * @return {number | BigNumber | Complex} Exponential of `x`, minus one
+   */
+  return typed(name, {
+    number: expm1Number,
+    Complex: function Complex(x) {
+      var r = Math.exp(x.re);
+      return new _Complex(r * Math.cos(x.im) - 1, r * Math.sin(x.im));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.exp().minus(1);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/fix.js b/node_modules/mathjs/lib/esm/function/arithmetic/fix.js
new file mode 100644
index 0000000..a8fbf2a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/fix.js
@@ -0,0 +1,148 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+var name = 'fix';
+var dependencies = ['typed', 'Complex', 'matrix', 'ceil', 'floor', 'equalScalar', 'zeros', 'DenseMatrix'];
+export var createFixNumber = /* #__PURE__ */factory(name, ['typed', 'ceil', 'floor'], _ref => {
+  var {
+    typed,
+    ceil,
+    floor
+  } = _ref;
+  return typed(name, {
+    number: function number(x) {
+      return x > 0 ? floor(x) : ceil(x);
+    },
+    'number, number': function number_number(x, n) {
+      return x > 0 ? floor(x, n) : ceil(x, n);
+    }
+  });
+});
+export var createFix = /* #__PURE__ */factory(name, dependencies, _ref2 => {
+  var {
+    typed,
+    Complex: _Complex,
+    matrix,
+    ceil,
+    floor,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var fixNumber = createFixNumber({
+    typed,
+    ceil,
+    floor
+  });
+  /**
+   * Round a value towards zero.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.fix(x)
+   *    math.fix(x,n)
+   *    math.fix(unit, valuelessUnit)
+   *    math.fix(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.fix(3.2)                // returns number 3
+   *    math.fix(3.8)                // returns number 3
+   *    math.fix(-4.2)               // returns number -4
+   *    math.fix(-4.7)               // returns number -4
+   *
+   *    math.fix(3.12, 1)                // returns number 3.1
+   *    math.fix(3.18, 1)                // returns number 3.1
+   *    math.fix(-4.12, 1)               // returns number -4.1
+   *    math.fix(-4.17, 1)               // returns number -4.1
+   *
+   *    const c = math.complex(3.22, -2.78)
+   *    math.fix(c)                  // returns Complex 3 - 2i
+   *    math.fix(c, 1)               // returns Complex 3.2 -2.7i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.fix(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.fix(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.fix([3.2, 3.8, -4.7])      // returns Array [3, 3, -4]
+   *    math.fix([3.2, 3.8, -4.7], 1)   // returns Array [3.2, 3.8, -4.7]
+   *
+   * See also:
+   *
+   *    ceil, floor, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('fix', {
+    number: fixNumber.signatures.number,
+    'number, number | BigNumber': fixNumber.signatures['number,number'],
+    Complex: function Complex(x) {
+      return new _Complex(x.re > 0 ? Math.floor(x.re) : Math.ceil(x.re), x.im > 0 ? Math.floor(x.im) : Math.ceil(x.im));
+    },
+    'Complex, number': function Complex_number(x, n) {
+      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    'Complex, BigNumber': function Complex_BigNumber(x, bn) {
+      var n = bn.toNumber();
+      return new _Complex(x.re > 0 ? floor(x.re, n) : ceil(x.re, n), x.im > 0 ? floor(x.im, n) : ceil(x.im, n));
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isNegative() ? ceil(x) : floor(x);
+    },
+    'BigNumber, number | BigNumber': function BigNumber_number__BigNumber(x, n) {
+      return x.isNegative() ? ceil(x, n) : floor(x, n);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function Fraction(x) {
+      return x.s < 0n ? x.ceil() : x.floor();
+    },
+    'Fraction, number | BigNumber': function Fraction_number__BigNumber(x, n) {
+      return x.s < 0n ? ceil(x, n) : floor(x, n);
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      var valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return deepMap(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return deepMap(x, self, true);
+    }),
+    'Array | Matrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since fix(0) = 0
+      return deepMap(x, i => self(i, n), true);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/floor.js b/node_modules/mathjs/lib/esm/function/arithmetic/floor.js
new file mode 100644
index 0000000..1b6f388
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/floor.js
@@ -0,0 +1,198 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { isInteger, nearlyEqual } from '../../utils/number.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+var name = 'floor';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
+var bigTen = new Decimal(10);
+export var createFloorNumber = /* #__PURE__ */factory(name, ['typed', 'config', 'round'], _ref => {
+  var {
+    typed,
+    config,
+    round
+  } = _ref;
+  function _floorNumber(x) {
+    // First, if the floor and the round are identical we can be
+    // quite comfortable that is the best answer:
+    var f = Math.floor(x);
+    var r = round(x);
+    if (f === r) return f;
+    // OK, they are different. If x is truly distinct from f but
+    // appears indistinguishable from r, presume it really is just
+    // the integer r with rounding/computation error, and return that
+    if (nearlyEqual(x, r, config.relTol, config.absTol) && !nearlyEqual(x, f, config.relTol, config.absTol)) {
+      return r;
+    }
+    // Otherwise (x distinct from both r and f, or indistinguishable from
+    // both r and f) may as well just return f, as that's the best
+    // candidate we can discern:
+    return f;
+  }
+  return typed(name, {
+    number: _floorNumber,
+    'number, number': function number_number(x, n) {
+      if (!isInteger(n)) {
+        throw new RangeError('number of decimals in function floor must be an integer');
+      }
+      if (n < 0 || n > 15) {
+        throw new RangeError('number of decimals in floor number must be in range 0 - 15');
+      }
+      var shift = 10 ** n;
+      return _floorNumber(x * shift) / shift;
+    }
+  });
+});
+export var createFloor = /* #__PURE__ */factory(name, dependencies, _ref2 => {
+  var {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  } = _ref2;
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var floorNumber = createFloorNumber({
+    typed,
+    config,
+    round
+  });
+  function _bigFloor(x) {
+    // see _floorNumber above for rationale
+    var bne = (a, b) => bigNearlyEqual(a, b, config.relTol, config.absTol);
+    var f = x.floor();
+    var r = round(x);
+    if (f.eq(r)) return f;
+    if (bne(x, r) && !bne(x, f)) return r;
+    return f;
+  }
+  /**
+   * Round a value towards minus infinity.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.floor(x)
+   *    math.floor(x, n)
+   *    math.floor(unit, valuelessUnit)
+   *    math.floor(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.floor(3.2)              // returns number 3
+   *    math.floor(3.8)              // returns number 3
+   *    math.floor(-4.2)             // returns number -5
+   *    math.floor(-4.7)             // returns number -5
+   *
+   *    math.floor(3.212, 2)          // returns number 3.21
+   *    math.floor(3.288, 2)          // returns number 3.28
+   *    math.floor(-4.212, 2)         // returns number -4.22
+   *    math.floor(-4.782, 2)         // returns number -4.79
+   *
+   *    const c = math.complex(3.24, -2.71)
+   *    math.floor(c)                 // returns Complex 3 - 3i
+   *    math.floor(c, 1)              // returns Complex 3.2 -2.8i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.floor(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.floor(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.floor([3.2, 3.8, -4.7])       // returns Array [3, 3, -5]
+   *    math.floor([3.21, 3.82, -4.71], 1)  // returns Array [3.2, 3.8, -4.8]
+   *
+   *    math.floor(math.tau, [2, 3])  // returns Array [6.28, 6.283]
+   *
+   *    // Note that floor(array, array) currently not implemented.
+   *
+   * See also:
+   *
+   *    ceil, fix, round
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed('floor', {
+    number: floorNumber.signatures.number,
+    'number,number': floorNumber.signatures['number,number'],
+    Complex: function Complex(x) {
+      return x.floor();
+    },
+    'Complex, number': function Complex_number(x, n) {
+      return x.floor(n);
+    },
+    'Complex, BigNumber': function Complex_BigNumber(x, n) {
+      return x.floor(n.toNumber());
+    },
+    BigNumber: _bigFloor,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {
+      var shift = bigTen.pow(n);
+      return _bigFloor(x.mul(shift)).div(shift);
+    },
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function Fraction(x) {
+      return x.floor();
+    },
+    'Fraction, number': function Fraction_number(x, n) {
+      return x.floor(n);
+    },
+    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {
+      return x.floor(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      var valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since floor(0) = 0
+      return deepMap(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since floor(0) = 0
+      return deepMap(x, self, true);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // deep map collection, skip zeros since ceil(0) = 0
+      return deepMap(x, i => self(i, n), true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | Complex | Fraction | BigNumber, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+    }),
+    'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(self => (x, y) => {
+      if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
+      if (y.storage() === 'dense') {
+        return matAlgo14xDs(y, x, self, true);
+      }
+      return matAlgo12xSfs(y, x, self, true);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js b/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js
new file mode 100644
index 0000000..6214af1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/gcd.js
@@ -0,0 +1,153 @@
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMod } from './mod.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { ArgumentsError } from '../../error/ArgumentsError.js';
+var name = 'gcd';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix', 'concat'];
+var gcdTypes = 'number | BigNumber | Fraction | Matrix | Array';
+var gcdManyTypesSignature = "".concat(gcdTypes, ", ").concat(gcdTypes, ", ...").concat(gcdTypes);
+function is1d(array) {
+  return !array.some(element => Array.isArray(element));
+}
+export var createGcd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    config,
+    round,
+    equalScalar,
+    zeros,
+    BigNumber,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var mod = createMod({
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  });
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo04xSidSid = createMatAlgo04xSidSid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the greatest common divisor for two or more values or arrays.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.gcd(a, b)
+   *    math.gcd(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.gcd(8, 12)              // returns 4
+   *    math.gcd(-4, 6)              // returns 2
+   *    math.gcd(25, 15, -10)        // returns 5
+   *
+   *    math.gcd([8, -4], [12, 6])   // returns [4, 2]
+   *
+   * See also:
+   *
+   *    lcm, xgcd
+   *
+   * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor
+   */
+  return typed(name, {
+    'number, number': _gcdNumber,
+    'BigNumber, BigNumber': _gcdBigNumber,
+    'Fraction, Fraction': (x, y) => x.gcd(y)
+  }, matrixAlgorithmSuite({
+    SS: matAlgo04xSidSid,
+    DS: matAlgo01xDSid,
+    Ss: matAlgo10xSids
+  }), {
+    [gcdManyTypesSignature]: typed.referToSelf(self => (a, b, args) => {
+      var res = self(a, b);
+      for (var i = 0; i < args.length; i++) {
+        res = self(res, args[i]);
+      }
+      return res;
+    }),
+    Array: typed.referToSelf(self => array => {
+      if (array.length === 1 && Array.isArray(array[0]) && is1d(array[0])) {
+        return self(...array[0]);
+      }
+      if (is1d(array)) {
+        return self(...array);
+      }
+      throw new ArgumentsError('gcd() supports only 1d matrices!');
+    }),
+    Matrix: typed.referToSelf(self => matrix => {
+      return self(matrix.toArray());
+    })
+  });
+
+  /**
+  * Calculate gcd for numbers
+  * @param {number} a
+  * @param {number} b
+  * @returns {number} Returns the greatest common denominator of a and b
+  * @private
+  */
+  function _gcdNumber(a, b) {
+    if (!isInteger(a) || !isInteger(b)) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    var r;
+    while (b !== 0) {
+      r = mod(a, b);
+      a = b;
+      b = r;
+    }
+    return a < 0 ? -a : a;
+  }
+
+  /**
+   * Calculate gcd for BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns greatest common denominator of a and b
+   * @private
+   */
+  function _gcdBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function gcd must be integer numbers');
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    var zero = new BigNumber(0);
+    while (!b.isZero()) {
+      var r = mod(a, b);
+      a = b;
+      b = r;
+    }
+    return a.lt(zero) ? a.neg() : a;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js b/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js
new file mode 100644
index 0000000..54513db
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/hypot.js
@@ -0,0 +1,77 @@
+import { factory } from '../../utils/factory.js';
+import { flatten } from '../../utils/array.js';
+import { isComplex } from '../../utils/is.js';
+var name = 'hypot';
+var dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
+export var createHypot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    sqrt,
+    smaller,
+    isPositive
+  } = _ref;
+  /**
+   * Calculate the hypotenuse of a list with values. The hypotenuse is defined as:
+   *
+   *     hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...)
+   *
+   * For matrix input, the hypotenuse is calculated for all values in the matrix.
+   *
+   * Syntax:
+   *
+   *     math.hypot(a, b, ...)
+   *     math.hypot([a, b, c, ...])
+   *
+   * Examples:
+   *
+   *     math.hypot(3, 4)      // 5
+   *     math.hypot(3, 4, 5)   // 7.0710678118654755
+   *     math.hypot([3, 4, 5]) // 7.0710678118654755
+   *     math.hypot(-2)        // 2
+   *
+   * See also:
+   *
+   *     abs, norm
+   *
+   * @param {... number | BigNumber | Array | Matrix} args    A list with numeric values or an Array or Matrix.
+   *                                                          Matrix and Array input is flattened and returns a
+   *                                                          single number for the whole matrix.
+   * @return {number | BigNumber} Returns the hypothenusa of the input values.
+   */
+  return typed(name, {
+    '... number | BigNumber': _hypot,
+    Array: _hypot,
+    Matrix: M => _hypot(flatten(M.toArray(), true))
+  });
+
+  /**
+   * Calculate the hypotenuse for an Array with values
+   * @param {Array.<number | BigNumber>} args
+   * @return {number | BigNumber} Returns the result
+   * @private
+   */
+  function _hypot(args) {
+    // code based on `hypot` from es6-shim:
+    // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
+    var result = 0;
+    var largest = 0;
+    for (var i = 0; i < args.length; i++) {
+      if (isComplex(args[i])) {
+        throw new TypeError('Unexpected type of argument to hypot');
+      }
+      var value = abs(args[i]);
+      if (smaller(largest, value)) {
+        result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
+        result = addScalar(result, 1);
+        largest = value;
+      } else {
+        result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
+      }
+    }
+    return multiplyScalar(largest, sqrt(result));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js b/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js
new file mode 100644
index 0000000..18ba0c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/invmod.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+var name = 'invmod';
+var dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
+export var createInvmod = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    BigNumber,
+    xgcd,
+    equal,
+    smaller,
+    mod,
+    add,
+    isInteger
+  } = _ref;
+  /**
+   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+   *
+   * Syntax:
+   *
+   *    math.invmod(a, b)
+   *
+   * Examples:
+   *
+   *    math.invmod(8, 12)             // returns NaN
+   *    math.invmod(7, 13)             // returns 2
+   *    math.invmod(15151, 15122)      // returns 10429
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {number | BigNumber }  Returns an integer number
+   *                              where `invmod(a,b)*a ≣ 1 (mod b)`
+   */
+  return typed(name, {
+    'number, number': invmod,
+    'BigNumber, BigNumber': invmod
+  });
+  function invmod(a, b) {
+    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
+    a = mod(a, b);
+    if (equal(b, 0)) throw new Error('Divisor must be non zero');
+    var res = xgcd(a, b);
+    res = res.valueOf();
+    var [gcd, inv] = res;
+    if (!equal(gcd, BigNumber(1))) return NaN;
+    inv = mod(inv, b);
+    if (smaller(inv, BigNumber(0))) inv = add(inv, b);
+    return inv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js b/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js
new file mode 100644
index 0000000..b82301a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/lcm.js
@@ -0,0 +1,110 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { lcmNumber } from '../../plain/number/index.js';
+var name = 'lcm';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];
+export var createLcm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    concat
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo06xS0S0 = createMatAlgo06xS0S0({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var lcmTypes = 'number | BigNumber | Fraction | Matrix | Array';
+  var lcmManySignature = {};
+  lcmManySignature["".concat(lcmTypes, ", ").concat(lcmTypes, ", ...").concat(lcmTypes)] = typed.referToSelf(self => (a, b, args) => {
+    var res = self(a, b);
+    for (var i = 0; i < args.length; i++) {
+      res = self(res, args[i]);
+    }
+    return res;
+  });
+
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   *
+   * lcm is defined as:
+   *
+   *     lcm(a, b) = abs(a * b) / gcd(a, b)
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.lcm(a, b)
+   *    math.lcm(a, b, c, ...)
+   *
+   * Examples:
+   *
+   *    math.lcm(4, 6)               // returns 12
+   *    math.lcm(6, 21)              // returns 42
+   *    math.lcm(6, 21, 5)           // returns 210
+   *
+   *    math.lcm([4, 6], [6, 21])    // returns [12, 42]
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers
+   * @return {number | BigNumber | Array | Matrix}                           The least common multiple
+   */
+  return typed(name, {
+    'number, number': lcmNumber,
+    'BigNumber, BigNumber': _lcmBigNumber,
+    'Fraction, Fraction': (x, y) => x.lcm(y)
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }), lcmManySignature);
+
+  /**
+   * Calculate lcm for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @returns {BigNumber} Returns the least common multiple of a and b
+   * @private
+   */
+  function _lcmBigNumber(a, b) {
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function lcm must be integer numbers');
+    }
+    if (a.isZero()) {
+      return a;
+    }
+    if (b.isZero()) {
+      return b;
+    }
+
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    // evaluate lcm here inline to reduce overhead
+    var prod = a.times(b);
+    while (!b.isZero()) {
+      var t = b;
+      b = a.mod(t);
+      a = t;
+    }
+    return prod.div(a).abs();
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log.js b/node_modules/mathjs/lib/esm/function/arithmetic/log.js
new file mode 100644
index 0000000..6b8749c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log.js
@@ -0,0 +1,87 @@
+import { factory } from '../../utils/factory.js';
+import { promoteLogarithm } from '../../utils/bigint.js';
+import { logNumber } from '../../plain/number/index.js';
+var name = 'log';
+var dependencies = ['config', 'typed', 'typeOf', 'divideScalar', 'Complex'];
+var nlg16 = Math.log(16);
+export var createLog = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    typeOf,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the logarithm of a value.
+   *
+   * To avoid confusion with the matrix logarithm, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.log(x)
+   *    math.log(x, base)
+   *
+   * Examples:
+   *
+   *    math.log(3.5)                  // returns 1.252762968495368
+   *    math.exp(math.log(2.4))        // returns 2.4
+   *
+   *    math.pow(10, 4)                // returns 10000
+   *    math.log(10000, 10)            // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *
+   *    math.log(1024, 2)              // returns 10
+   *    math.pow(2, 10)                // returns 1024
+   *
+   * See also:
+   *
+   *    exp, log2, log10, log1p
+   *
+   * @param {number | BigNumber | Fraction | Complex} x
+   *            Value for which to calculate the logarithm.
+   * @param {number | BigNumber | Fraction | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x` is calculated.
+   * @return {number | BigNumber | Fraction | Complex}
+   *            Returns the logarithm of `x`
+   */
+  function complexLog(c) {
+    return c.log();
+  }
+  function complexLogNumber(x) {
+    return complexLog(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return logNumber(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLogNumber(x);
+      }
+    },
+    bigint: promoteLogarithm(nlg16, logNumber, config, complexLogNumber),
+    Complex: complexLog,
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLogNumber(x.toNumber());
+      }
+    },
+    'any, any': typed.referToSelf(self => (x, base) => {
+      // calculate logarithm for a specified base, log(x, base)
+
+      if (typeOf(x) === 'Fraction' && typeOf(base) === 'Fraction') {
+        var result = x.log(base);
+        if (result !== null) {
+          return result;
+        }
+      }
+      return divideScalar(self(x), self(base));
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log10.js b/node_modules/mathjs/lib/esm/function/arithmetic/log10.js
new file mode 100644
index 0000000..72b3342
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log10.js
@@ -0,0 +1,67 @@
+import { log10Number } from '../../plain/number/index.js';
+import { promoteLogarithm } from '../../utils/bigint.js';
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'log10';
+var dependencies = ['typed', 'config', 'Complex'];
+var log16 = log10Number(16);
+export var createLog10 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log10(x)
+   *
+   * Examples:
+   *
+   *    math.log10(0.00001)            // returns -5
+   *    math.log10(10000)              // returns 4
+   *    math.log(10000) / math.log(10) // returns 4
+   *    math.pow(10, 4)                // returns 10000
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log2
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 10-base logarithm of `x`
+   */
+
+  function complexLog(c) {
+    return c.log().div(Math.LN10);
+  }
+  function complexLogNumber(x) {
+    return complexLog(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return log10Number(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLogNumber(x);
+      }
+    },
+    bigint: promoteLogarithm(log16, log10Number, config, complexLogNumber),
+    Complex: complexLog,
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log();
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLogNumber(x.toNumber());
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js b/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js
new file mode 100644
index 0000000..284d7f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log1p.js
@@ -0,0 +1,81 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { log1p as _log1p } from '../../utils/number.js';
+var name = 'log1p';
+var dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
+export var createLog1p = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    divideScalar,
+    log,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the logarithm of a `value+1`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log1p(x)
+   *    math.log1p(x, base)
+   *
+   * Examples:
+   *
+   *    math.log1p(2.5)                 // returns 1.252762968495368
+   *    math.exp(math.log1p(1.4))       // returns 2.4
+   *
+   *    math.pow(10, 4)                 // returns 10000
+   *    math.log1p(9999, 10)            // returns 4
+   *    math.log1p(9999) / math.log(10) // returns 4
+   *
+   * See also:
+   *
+   *    exp, log, log2, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm of `x+1`.
+   * @param {number | BigNumber | Complex} [base=e]
+   *            Optional base for the logarithm. If not provided, the natural
+   *            logarithm of `x+1` is calculated.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the logarithm of `x+1`
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 || config.predictable) {
+        return _log1p(x);
+      } else {
+        // negative value -> complex value computation
+        return _log1pComplex(new Complex(x, 0));
+      }
+    },
+    Complex: _log1pComplex,
+    BigNumber: function BigNumber(x) {
+      var y = x.plus(1);
+      if (!y.isNegative() || config.predictable) {
+        return y.ln();
+      } else {
+        // downgrade to number, return Complex valued result
+        return _log1pComplex(new Complex(x.toNumber(), 0));
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self)),
+    'any, any': typed.referToSelf(self => (x, base) => {
+      // calculate logarithm for a specified base, log1p(x, base)
+      return divideScalar(self(x), log(base));
+    })
+  });
+
+  /**
+   * Calculate the natural logarithm of a complex number + 1
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+  function _log1pComplex(x) {
+    var xRe1p = x.re + 1;
+    return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/log2.js b/node_modules/mathjs/lib/esm/function/arithmetic/log2.js
new file mode 100644
index 0000000..9d808a1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/log2.js
@@ -0,0 +1,73 @@
+import { log2Number } from '../../plain/number/index.js';
+import { promoteLogarithm } from '../../utils/bigint.js';
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'log2';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createLog2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.log2(x)
+   *
+   * Examples:
+   *
+   *    math.log2(0.03125)           // returns -5
+   *    math.log2(16)                // returns 4
+   *    math.log2(16) / math.log2(2) // returns 4
+   *    math.pow(2, 4)               // returns 16
+   *
+   * See also:
+   *
+   *    exp, log, log1p, log10
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the logarithm.
+   * @return {number | BigNumber | Complex | Array | Matrix}
+   *            Returns the 2-base logarithm of `x`
+   */
+  function complexLog2Number(x) {
+    return _log2Complex(new Complex(x, 0));
+  }
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 0 || config.predictable) {
+        return log2Number(x);
+      } else {
+        // negative value -> complex value computation
+        return complexLog2Number(x);
+      }
+    },
+    bigint: promoteLogarithm(4, log2Number, config, complexLog2Number),
+    Complex: _log2Complex,
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.log(2);
+      } else {
+        // downgrade to number, return Complex valued result
+        return complexLog2Number(x.toNumber());
+      }
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+
+  /**
+   * Calculate log2 for a complex value
+   * @param {Complex} x
+   * @returns {Complex}
+   * @private
+   */
+  function _log2Complex(x) {
+    var newX = Math.sqrt(x.re * x.re + x.im * x.im);
+    return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/mod.js b/node_modules/mathjs/lib/esm/function/arithmetic/mod.js
new file mode 100644
index 0000000..18953f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/mod.js
@@ -0,0 +1,133 @@
+import { factory } from '../../utils/factory.js';
+import { createFloor } from './floor.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'mod';
+var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+export var createMod = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var floor = createFloor({
+    typed,
+    config,
+    round,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix
+  });
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo05xSfSf = createMatAlgo05xSfSf({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculates the modulus, the remainder of an integer division.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * The modulus is defined as:
+   *
+   *     x - y * floor(x / y)
+   *
+   * See https://en.wikipedia.org/wiki/Modulo_operation.
+   *
+   * Syntax:
+   *
+   *    math.mod(x, y)
+   *
+   * Examples:
+   *
+   *    math.mod(8, 3)                // returns 2
+   *    math.mod(11, 2)               // returns 1
+   *
+   *    function isOdd(x) {
+   *      return math.mod(x, 2) != 0
+   *    }
+   *
+   *    isOdd(2)                      // returns false
+   *    isOdd(3)                      // returns true
+   *
+   * See also:
+   *
+   *    divide
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} x Dividend
+   * @param  {number | BigNumber | bigint | Fraction | Array | Matrix} y Divisor
+   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
+   */
+  return typed(name, {
+    'number, number': _modNumber,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return y.isZero() ? x : x.sub(y.mul(floor(x.div(y))));
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      if (y === 0n) {
+        return x;
+      }
+      if (x < 0) {
+        var m = x % y;
+        return m === 0n ? m : m + y;
+      }
+      return x % y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return y.equals(0) ? x : x.sub(y.mul(floor(x.div(y))));
+    }
+  }, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+
+  /**
+  * Calculate the modulus of two numbers
+  * @param {number} x
+  * @param {number} y
+  * @returns {number} res
+  * @private
+  */
+  function _modNumber(x, y) {
+    // We don't use JavaScript's % operator here as this doesn't work
+    // correctly for x < 0 and x === 0
+    // see https://en.wikipedia.org/wiki/Modulo_operation
+
+    // We use mathjs floor to handle errors associated with
+    // precision float approximation
+    return y === 0 ? x : x - y * floor(x / y);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js b/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js
new file mode 100644
index 0000000..ddcafc3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js
@@ -0,0 +1,880 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+var name = 'multiply';
+var dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'equalScalar', 'dot'];
+export var createMultiply = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    multiplyScalar,
+    equalScalar,
+    dot
+  } = _ref;
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  function _validateMatrixDimensions(size1, size2) {
+    // check left operand dimensions
+    switch (size1.length) {
+      case 1:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Vector x Vector
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vectors must have the same length');
+            }
+            break;
+          case 2:
+            // Vector x Matrix
+            if (size1[0] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Vector length (' + size1[0] + ') must match Matrix rows (' + size2[0] + ')');
+            }
+            break;
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+        break;
+      case 2:
+        // check size2
+        switch (size2.length) {
+          case 1:
+            // Matrix x Vector
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix columns (' + size1[1] + ') must match Vector length (' + size2[0] + ')');
+            }
+            break;
+          case 2:
+            // Matrix x Matrix
+            if (size1[1] !== size2[0]) {
+              // throw error
+              throw new RangeError('Dimension mismatch in multiplication. Matrix A columns (' + size1[1] + ') must match Matrix B rows (' + size2[0] + ')');
+            }
+            break;
+          default:
+            throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix B has ' + size2.length + ' dimensions)');
+        }
+        break;
+      default:
+        throw new Error('Can only multiply a 1 or 2 dimensional matrix (Matrix A has ' + size1.length + ' dimensions)');
+    }
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (N)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {number}             Scalar value
+   */
+  function _multiplyVectorVector(a, b, n) {
+    // check empty vector
+    if (n === 0) {
+      throw new Error('Cannot multiply two empty vectors');
+    }
+    return dot(a, b);
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Matrix         (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+  function _multiplyVectorMatrix(a, b) {
+    // process storage
+    if (b.storage() !== 'dense') {
+      throw new Error('Support for SparseMatrix not implemented');
+    }
+    return _multiplyVectorDenseMatrix(a, b);
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Dense Vector   (M)
+   * @param {Matrix} b            Dense Matrix   (MxN)
+   *
+   * @return {Matrix}             Dense Vector   (N)
+   */
+  function _multiplyVectorDenseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype || a.getDataType();
+    // b dense
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype || b.getDataType();
+    // rows & columns
+    var alength = asize[0];
+    var bcolumns = bsize[1];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    var c = [];
+
+    // loop matrix columns
+    for (var j = 0; j < bcolumns; j++) {
+      // sum (do not initialize it with zero)
+      var sum = mf(adata[0], bdata[0][j]);
+      // loop vector
+      for (var i = 1; i < alength; i++) {
+        // multiply & accumulate
+        sum = af(sum, mf(adata[i], bdata[i][j]));
+      }
+      c[j] = sum;
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Dense Vector   (N)
+   *
+   * @return {Matrix}             Dense Vector   (M)
+   */
+  var _multiplyMatrixVector = typed('_multiplyMatrixVector', {
+    'DenseMatrix, any': _multiplyDenseMatrixVector,
+    'SparseMatrix, any': _multiplySparseMatrixVector
+  });
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            Matrix         (MxN)
+   * @param {Matrix} b            Matrix         (NxC)
+   *
+   * @return {Matrix}             Matrix         (MxC)
+   */
+  var _multiplyMatrixMatrix = typed('_multiplyMatrixMatrix', {
+    'DenseMatrix, DenseMatrix': _multiplyDenseMatrixDenseMatrix,
+    'DenseMatrix, SparseMatrix': _multiplyDenseMatrixSparseMatrix,
+    'SparseMatrix, DenseMatrix': _multiplySparseMatrixDenseMatrix,
+    'SparseMatrix, SparseMatrix': _multiplySparseMatrixSparseMatrix
+  });
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix  (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             Dense Vector (M)
+   */
+  function _multiplyDenseMatrixVector(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype || a.getDataType();
+    // b dense
+    var bdata = b._data;
+    var bdt = b._datatype || b.getDataType();
+    // rows & columns
+    var arows = asize[0];
+    var acolumns = asize[1];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    var c = [];
+
+    // loop matrix a rows
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i];
+      // sum (do not initialize it with zero)
+      var sum = mf(row[0], bdata[0]);
+      // loop matrix a columns
+      for (var j = 1; j < acolumns; j++) {
+        // multiply & accumulate
+        sum = af(sum, mf(row[j], bdata[j]));
+      }
+      c[i] = sum;
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            DenseMatrix    (NxC)
+   *
+   * @return {Matrix}             DenseMatrix    (MxC)
+   */
+  function _multiplyDenseMatrixDenseMatrix(a, b) {
+    // getDataType()
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype || a.getDataType();
+    // b dense
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype || b.getDataType();
+    // rows & columns
+    var arows = asize[0];
+    var acolumns = asize[1];
+    var bcolumns = bsize[1];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    var c = [];
+
+    // loop matrix a rows
+    for (var i = 0; i < arows; i++) {
+      // current row
+      var row = adata[i];
+      // initialize row array
+      c[i] = [];
+      // loop matrix b columns
+      for (var j = 0; j < bcolumns; j++) {
+        // sum (avoid initializing sum to zero)
+        var sum = mf(row[0], bdata[0][j]);
+        // loop matrix a columns
+        for (var x = 1; x < acolumns; x++) {
+          // multiply & accumulate
+          sum = af(sum, mf(row[x], bdata[x][j]));
+        }
+        c[i][j] = sum;
+      }
+    }
+
+    // return matrix
+    return a.createDenseMatrix({
+      data: c,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            DenseMatrix    (MxN)
+   * @param {Matrix} b            SparseMatrix   (NxC)
+   *
+   * @return {Matrix}             SparseMatrix   (MxC)
+   */
+  function _multiplyDenseMatrixSparseMatrix(a, b) {
+    // a dense
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype || a.getDataType();
+    // b sparse
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+    // validate b matrix
+    if (!bvalues) {
+      throw new Error('Cannot multiply Dense Matrix times Pattern only Matrix');
+    }
+    // rows & columns
+    var arows = asize[0];
+    var bcolumns = bsize[1];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+    // equalScalar signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // result
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+    // c matrix
+    var c = b.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // loop b columns
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // indeces in column jb
+      var kb0 = bptr[jb];
+      var kb1 = bptr[jb + 1];
+      // do not process column jb if no data exists
+      if (kb1 > kb0) {
+        // last row mark processed
+        var last = 0;
+        // loop a rows
+        for (var i = 0; i < arows; i++) {
+          // column mark
+          var mark = i + 1;
+          // C[i, jb]
+          var cij = void 0;
+          // values in b column j
+          for (var kb = kb0; kb < kb1; kb++) {
+            // row
+            var ib = bindex[kb];
+            // check value has been initialized
+            if (last !== mark) {
+              // first value in column jb
+              cij = mf(adata[i][ib], bvalues[kb]);
+              // update mark
+              last = mark;
+            } else {
+              // accumulate value
+              cij = af(cij, mf(adata[i][ib], bvalues[kb]));
+            }
+          }
+          // check column has been processed and value != 0
+          if (last === mark && !eq(cij, zero)) {
+            // push row & value
+            cindex.push(i);
+            cvalues.push(cij);
+          }
+        }
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix    (MxN)
+   * @param {Matrix} b            Dense Vector (N)
+   *
+   * @return {Matrix}             SparseMatrix    (M, 1)
+   */
+  function _multiplySparseMatrixVector(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // validate a matrix
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    }
+    // b dense
+    var bdata = b._data;
+    var bdt = b._datatype || b.getDataType();
+    // rows & columns
+    var arows = a._size[0];
+    var brows = b._size[0];
+    // result
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+    // equalScalar signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // workspace
+    var x = [];
+    // vector with marks indicating a value x[i] exists in a given column
+    var w = [];
+
+    // update ptr
+    cptr[0] = 0;
+    // rows in b
+    for (var ib = 0; ib < brows; ib++) {
+      // b[ib]
+      var vbi = bdata[ib];
+      // check b[ib] != 0, avoid loops
+      if (!eq(vbi, zero)) {
+        // A values & index in ib column
+        for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+          // a row
+          var ia = aindex[ka];
+          // check value exists in current j
+          if (!w[ia]) {
+            // ia is new entry in j
+            w[ia] = true;
+            // add i to pattern of C
+            cindex.push(ia);
+            // x(ia) = A
+            x[ia] = mf(vbi, avalues[ka]);
+          } else {
+            // i exists in C already
+            x[ia] = af(x[ia], mf(vbi, avalues[ka]));
+          }
+        }
+      }
+    }
+    // copy values from x to column jb of c
+    for (var p1 = cindex.length, p = 0; p < p1; p++) {
+      // row
+      var ic = cindex[p];
+      // copy value
+      cvalues[p] = x[ic];
+    }
+    // update ptr
+    cptr[1] = cindex.length;
+
+    // matrix to return
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, 1],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            DenseMatrix       (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+  function _multiplySparseMatrixDenseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // validate a matrix
+    if (!avalues) {
+      throw new Error('Cannot multiply Pattern only Matrix times Dense Matrix');
+    }
+    // b dense
+    var bdata = b._data;
+    var bdt = b._datatype || b.getDataType();
+    // rows & columns
+    var arows = a._size[0];
+    var brows = b._size[0];
+    var bcolumns = b._size[1];
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+    // equalScalar signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+    }
+
+    // result
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+    // c matrix
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // workspace
+    var x = [];
+    // vector with marks indicating a value x[i] exists in a given column
+    var w = [];
+
+    // loop b columns
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // mark in workspace for current column
+      var mark = jb + 1;
+      // rows in jb
+      for (var ib = 0; ib < brows; ib++) {
+        // b[ib, jb]
+        var vbij = bdata[ib][jb];
+        // check b[ib, jb] != 0, avoid loops
+        if (!eq(vbij, zero)) {
+          // A values & index in ib column
+          for (var ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // a row
+            var ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+              // x(ia) = A
+              x[ia] = mf(vbij, avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(vbij, avalues[ka]));
+            }
+          }
+        }
+      }
+      // copy values from x to column jb of c
+      for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+        // row
+        var ic = cindex[p];
+        // copy value
+        cvalues[p] = x[ic];
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * C = A * B
+   *
+   * @param {Matrix} a            SparseMatrix      (MxN)
+   * @param {Matrix} b            SparseMatrix      (NxC)
+   *
+   * @return {Matrix}             SparseMatrix      (MxC)
+   */
+  function _multiplySparseMatrixSparseMatrix(a, b) {
+    // a sparse
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // b sparse
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // rows & columns
+    var arows = a._size[0];
+    var bcolumns = b._size[1];
+    // flag indicating both matrices (a & b) contain data
+    var values = avalues && bvalues;
+
+    // datatype
+    var dt;
+    // addScalar signature to use
+    var af = addScalar;
+    // multiplyScalar signature to use
+    var mf = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signatures that matches (dt, dt)
+      af = typed.find(addScalar, [dt, dt]);
+      mf = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // result
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+    // c matrix
+    var c = a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [arows, bcolumns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+
+    // workspace
+    var x = values ? [] : undefined;
+    // vector with marks indicating a value x[i] exists in a given column
+    var w = [];
+    // variables
+    var ka, ka0, ka1, kb, kb0, kb1, ia, ib;
+    // loop b columns
+    for (var jb = 0; jb < bcolumns; jb++) {
+      // update ptr
+      cptr[jb] = cindex.length;
+      // mark in workspace for current column
+      var mark = jb + 1;
+      // B values & index in j
+      for (kb0 = bptr[jb], kb1 = bptr[jb + 1], kb = kb0; kb < kb1; kb++) {
+        // b row
+        ib = bindex[kb];
+        // check we need to process values
+        if (values) {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+              // x(ia) = A
+              x[ia] = mf(bvalues[kb], avalues[ka]);
+            } else {
+              // i exists in C already
+              x[ia] = af(x[ia], mf(bvalues[kb], avalues[ka]));
+            }
+          }
+        } else {
+          // loop values in a[:,ib]
+          for (ka0 = aptr[ib], ka1 = aptr[ib + 1], ka = ka0; ka < ka1; ka++) {
+            // row
+            ia = aindex[ka];
+            // check value exists in current j
+            if (w[ia] !== mark) {
+              // ia is new entry in j
+              w[ia] = mark;
+              // add i to pattern of C
+              cindex.push(ia);
+            }
+          }
+        }
+      }
+      // check we need to process matrix values (pattern matrix)
+      if (values) {
+        // copy values from x to column jb of c
+        for (var p0 = cptr[jb], p1 = cindex.length, p = p0; p < p1; p++) {
+          // row
+          var ic = cindex[p];
+          // copy value
+          cvalues[p] = x[ic];
+        }
+      }
+    }
+    // update ptr
+    cptr[bcolumns] = cindex.length;
+
+    // return sparse matrix
+    return c;
+  }
+
+  /**
+   * Multiply two or more values, `x * y`.
+   * For matrices, the matrix product is calculated.
+   *
+   * Syntax:
+   *
+   *    math.multiply(x, y)
+   *    math.multiply(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.multiply(4, 5.2)        // returns number 20.8
+   *    math.multiply(2, 3, 4)       // returns number 24
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.multiply(a, b)          // returns Complex 5 + 14i
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    const d = [[1, 2, 3], [3, -4, 7]]
+   *    math.multiply(c, d)          // returns Array [[7, -6, 17], [13, -4, 33]]
+   *
+   *    const e = math.unit('2.1 km')
+   *    math.multiply(3, e)          // returns Unit 6.3 km
+   *
+   * See also:
+   *
+   *    divide, prod, cross, dot
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x First value to multiply
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Second value to multiply
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Multiplication of `x` and `y`
+   */
+  return typed(name, multiplyScalar, {
+    // we extend the signatures of multiplyScalar with signatures dealing with matrices
+
+    'Array, Array': typed.referTo('Matrix, Matrix', selfMM => (x, y) => {
+      // check dimensions
+      _validateMatrixDimensions(arraySize(x), arraySize(y));
+
+      // use dense matrix implementation
+      var m = selfMM(matrix(x), matrix(y));
+      // return array or scalar
+      return isMatrix(m) ? m.valueOf() : m;
+    }),
+    'Matrix, Matrix': function Matrix_Matrix(x, y) {
+      // dimensions
+      var xsize = x.size();
+      var ysize = y.size();
+
+      // check dimensions
+      _validateMatrixDimensions(xsize, ysize);
+
+      // process dimensions
+      if (xsize.length === 1) {
+        // process y dimensions
+        if (ysize.length === 1) {
+          // Vector * Vector
+          return _multiplyVectorVector(x, y, xsize[0]);
+        }
+        // Vector * Matrix
+        return _multiplyVectorMatrix(x, y);
+      }
+      // process y dimensions
+      if (ysize.length === 1) {
+        // Matrix * Vector
+        return _multiplyMatrixVector(x, y);
+      }
+      // Matrix * Matrix
+      return _multiplyMatrixMatrix(x, y);
+    },
+    'Matrix, Array': typed.referTo('Matrix,Matrix', selfMM => (x, y) => selfMM(x, matrix(y))),
+    'Array, Matrix': typed.referToSelf(self => (x, y) => {
+      // use Matrix * Matrix implementation
+      return self(matrix(x, y.storage()), y);
+    }),
+    'SparseMatrix, any': function SparseMatrix_any(x, y) {
+      return matAlgo11xS0s(x, y, multiplyScalar, false);
+    },
+    'DenseMatrix, any': function DenseMatrix_any(x, y) {
+      return matAlgo14xDs(x, y, multiplyScalar, false);
+    },
+    'any, SparseMatrix': function any_SparseMatrix(x, y) {
+      return matAlgo11xS0s(y, x, multiplyScalar, true);
+    },
+    'any, DenseMatrix': function any_DenseMatrix(x, y) {
+      return matAlgo14xDs(y, x, multiplyScalar, true);
+    },
+    'Array, any': function Array_any(x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), y, multiplyScalar, false).valueOf();
+    },
+    'any, Array': function any_Array(x, y) {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(y), x, multiplyScalar, true).valueOf();
+    },
+    'any, any': multiplyScalar,
+    'any, any, ...any': typed.referToSelf(self => (x, y, rest) => {
+      var result = self(x, y);
+      for (var i = 0; i < rest.length; i++) {
+        result = self(result, rest[i]);
+      }
+      return result;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js
new file mode 100644
index 0000000..f46b18f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js
@@ -0,0 +1,38 @@
+import { factory } from '../../utils/factory.js';
+import { multiplyNumber } from '../../plain/number/index.js';
+var name = 'multiplyScalar';
+var dependencies = ['typed'];
+export var createMultiplyScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Multiply two scalar values, `x * y`.
+   * This function is meant for internal use: it is used by the public function
+   * `multiply`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value to multiply
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to multiply
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Multiplication of `x` and `y`
+   * @private
+   */
+  return typed('multiplyScalar', {
+    'number, number': multiplyNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.mul(y);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.times(y);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x * y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return x.mul(y);
+    },
+    'number | Fraction | BigNumber | Complex, Unit': (x, y) => y.multiply(x),
+    'Unit, number | Fraction | BigNumber | Complex | Unit': (x, y) => x.multiply(y)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/norm.js b/node_modules/mathjs/lib/esm/function/arithmetic/norm.js
new file mode 100644
index 0000000..c307ca3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/norm.js
@@ -0,0 +1,287 @@
+import { factory } from '../../utils/factory.js';
+var name = 'norm';
+var dependencies = ['typed', 'abs', 'add', 'pow', 'conj', 'sqrt', 'multiply', 'equalScalar', 'larger', 'smaller', 'matrix', 'ctranspose', 'eigs'];
+export var createNorm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    pow,
+    conj,
+    sqrt,
+    multiply,
+    equalScalar,
+    larger,
+    smaller,
+    matrix,
+    ctranspose,
+    eigs
+  } = _ref;
+  /**
+   * Calculate the norm of a number, vector or matrix.
+   *
+   * The second parameter p is optional. If not provided, it defaults to 2.
+   *
+   * Syntax:
+   *
+   *    math.norm(x)
+   *    math.norm(x, p)
+   *
+   * Examples:
+   *
+   *    math.abs(-3.5)                         // returns 3.5
+   *    math.norm(-3.5)                        // returns 3.5
+   *
+   *    math.norm(math.complex(3, -4))         // returns 5
+   *
+   *    math.norm([1, 2, -3], Infinity)        // returns 3
+   *    math.norm([1, 2, -3], -Infinity)       // returns 1
+   *
+   *    math.norm([3, 4], 2)                   // returns 5
+   *
+   *    math.norm([[1, 2], [3, 4]], 1)          // returns 6
+   *    math.norm([[1, 2], [3, 4]], 'inf')     // returns 7
+   *    math.norm([[1, 2], [3, 4]], 'fro')     // returns 5.477225575051661
+   *
+   * See also:
+   *
+   *    abs, hypot
+   *
+   * @param  {number | BigNumber | Complex | Array | Matrix} x
+   *            Value for which to calculate the norm
+   * @param  {number | BigNumber | string} [p=2]
+   *            Vector space.
+   *            Supported numbers include Infinity and -Infinity.
+   *            Supported strings are: 'inf', '-inf', and 'fro' (The Frobenius norm)
+   * @return {number | BigNumber} the p-norm
+   */
+  return typed(name, {
+    number: Math.abs,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      // norm(x) = abs(x)
+      return x.abs();
+    },
+    boolean: function boolean(x) {
+      // norm(x) = abs(x)
+      return Math.abs(x);
+    },
+    Array: function Array(x) {
+      return _norm(matrix(x), 2);
+    },
+    Matrix: function Matrix(x) {
+      return _norm(x, 2);
+    },
+    'Array, number | BigNumber | string': function Array_number__BigNumber__string(x, p) {
+      return _norm(matrix(x), p);
+    },
+    'Matrix, number | BigNumber | string': function Matrix_number__BigNumber__string(x, p) {
+      return _norm(x, p);
+    }
+  });
+
+  /**
+   * Calculate the plus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNormPlusInfinity(x) {
+    // norm(x, Infinity) = max(abs(x))
+    var pinf = 0;
+    // skip zeros since abs(0) === 0
+    x.forEach(function (value) {
+      var v = abs(value);
+      if (larger(v, pinf)) {
+        pinf = v;
+      }
+    }, true);
+    return pinf;
+  }
+
+  /**
+   * Calculate the minus infinity norm for a vector
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNormMinusInfinity(x) {
+    // norm(x, -Infinity) = min(abs(x))
+    var ninf;
+    // skip zeros since abs(0) === 0
+    x.forEach(function (value) {
+      var v = abs(value);
+      if (!ninf || smaller(v, ninf)) {
+        ninf = v;
+      }
+    }, true);
+    return ninf || 0;
+  }
+
+  /**
+   * Calculate the norm for a vector
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _vectorNorm(x, p) {
+    // check p
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _vectorNormPlusInfinity(x);
+    }
+    if (p === Number.NEGATIVE_INFINITY || p === '-inf') {
+      return _vectorNormMinusInfinity(x);
+    }
+    if (p === 'fro') {
+      return _norm(x, 2);
+    }
+    if (typeof p === 'number' && !isNaN(p)) {
+      // check p != 0
+      if (!equalScalar(p, 0)) {
+        // norm(x, p) = sum(abs(xi) ^ p) ^ 1/p
+        var n = 0;
+        // skip zeros since abs(0) === 0
+        x.forEach(function (value) {
+          n = add(pow(abs(value), p), n);
+        }, true);
+        return pow(n, 1 / p);
+      }
+      return Number.POSITIVE_INFINITY;
+    }
+    // invalid parameter value
+    throw new Error('Unsupported parameter value');
+  }
+
+  /**
+   * Calculate the Frobenius norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormFrobenius(x) {
+    // norm(x) = sqrt(sum(diag(x'x)))
+    var fro = 0;
+    x.forEach(function (value, index) {
+      fro = add(fro, multiply(value, conj(value)));
+    });
+    return abs(sqrt(fro));
+  }
+
+  /**
+   * Calculate the norm L1 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormOne(x) {
+    // norm(x) = the largest column sum
+    var c = [];
+    // result
+    var maxc = 0;
+    // skip zeros since abs(0) == 0
+    x.forEach(function (value, index) {
+      var j = index[1];
+      var cj = add(c[j] || 0, abs(value));
+      if (larger(cj, maxc)) {
+        maxc = cj;
+      }
+      c[j] = cj;
+    }, true);
+    return maxc;
+  }
+
+  /**
+   * Calculate the norm L2 for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormTwo(x) {
+    // norm(x) = sqrt( max eigenvalue of A*.A)
+    var sizeX = x.size();
+    if (sizeX[0] !== sizeX[1]) {
+      throw new RangeError('Invalid matrix dimensions');
+    }
+    var tx = ctranspose(x);
+    var squaredX = multiply(tx, x);
+    var eigenVals = eigs(squaredX).values.toArray();
+    var rho = eigenVals[eigenVals.length - 1];
+    return abs(sqrt(rho));
+  }
+
+  /**
+   * Calculate the infinity norm for a matrix
+   * @param {Matrix} x
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNormInfinity(x) {
+    // norm(x) = the largest row sum
+    var r = [];
+    // result
+    var maxr = 0;
+    // skip zeros since abs(0) == 0
+    x.forEach(function (value, index) {
+      var i = index[0];
+      var ri = add(r[i] || 0, abs(value));
+      if (larger(ri, maxr)) {
+        maxr = ri;
+      }
+      r[i] = ri;
+    }, true);
+    return maxr;
+  }
+
+  /**
+   * Calculate the norm for a 2D Matrix (M*N)
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _matrixNorm(x, p) {
+    // check p
+    if (p === 1) {
+      return _matrixNormOne(x);
+    }
+    if (p === Number.POSITIVE_INFINITY || p === 'inf') {
+      return _matrixNormInfinity(x);
+    }
+    if (p === 'fro') {
+      return _matrixNormFrobenius(x);
+    }
+    if (p === 2) {
+      return _matrixNormTwo(x);
+    } // invalid parameter value
+
+    throw new Error('Unsupported parameter value ' + p);
+  }
+
+  /**
+   * Calculate the norm for an array
+   * @param {Matrix} x
+   * @param {number | string} p
+   * @returns {number} Returns the norm
+   * @private
+   */
+  function _norm(x, p) {
+    // size
+    var sizeX = x.size();
+
+    // check if it is a vector
+    if (sizeX.length === 1) {
+      return _vectorNorm(x, p);
+    }
+    // MxN matrix
+    if (sizeX.length === 2) {
+      if (sizeX[0] && sizeX[1]) {
+        return _matrixNorm(x, p);
+      } else {
+        throw new RangeError('Invalid matrix dimensions');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js
new file mode 100644
index 0000000..505e18b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoot.js
@@ -0,0 +1,166 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { nthRootNumber } from '../../plain/number/index.js';
+var name = 'nthRoot';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'concat'];
+export var createNthRoot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber: _BigNumber,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo06xS0S0 = createMatAlgo06xS0S0({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the nth root of a value.
+   * The principal nth root of a positive real number A, is the positive real
+   * solution of the equation
+   *
+   *     x^root = A
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *     math.nthRoot(a)
+   *     math.nthRoot(a, root)
+   *
+   * Examples:
+   *
+   *     math.nthRoot(9, 2)    // returns 3 (since 3^2 == 9)
+   *     math.sqrt(9)          // returns 3 (since 3^2 == 9)
+   *     math.nthRoot(64, 3)   // returns 4 (since 4^3 == 64)
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param {number | BigNumber | Array | Matrix | Complex} a
+   *              Value for which to calculate the nth root
+   * @param {number | BigNumber} [root=2]    The root.
+   * @return {number | Complex | Array | Matrix} Returns the nth root of `a`
+   */
+  function complexErr() {
+    throw new Error('Complex number not supported in function nthRoot. Use nthRoots instead.');
+  }
+  return typed(name, {
+    number: nthRootNumber,
+    'number, number': nthRootNumber,
+    BigNumber: x => _bigNthRoot(x, new _BigNumber(2)),
+    'BigNumber, BigNumber': _bigNthRoot,
+    Complex: complexErr,
+    'Complex, number': complexErr,
+    Array: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(matrix(x), 2).valueOf()),
+    DenseMatrix: typed.referTo('DenseMatrix,number', selfDn => x => selfDn(x, 2)),
+    SparseMatrix: typed.referTo('SparseMatrix,number', selfSn => x => selfSn(x, 2)),
+    'SparseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse + sparse
+        return matAlgo06xS0S0(x, y, self);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    }),
+    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // dense + sparse
+        return matAlgo01xDSid(x, y, self, false);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    }),
+    'Array, SparseMatrix': typed.referTo('DenseMatrix,SparseMatrix', selfDS => (x, y) => selfDS(matrix(x), y)),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // density must be one (no zeros in matrix)
+      if (y.density() === 1) {
+        // sparse - scalar
+        return matAlgo11xS0s(y, x, self, true);
+      } else {
+        // throw exception
+        throw new Error('Root must be non-zero');
+      }
+    })
+  }, matrixAlgorithmSuite({
+    scalar: 'number | BigNumber',
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: false
+  }));
+
+  /**
+   * Calculate the nth root of a for BigNumbers, solve x^root == a
+   * https://rosettacode.org/wiki/Nth_root#JavaScript
+   * @param {BigNumber} a
+   * @param {BigNumber} root
+   * @private
+   */
+  function _bigNthRoot(a, root) {
+    var precision = _BigNumber.precision;
+    var Big = _BigNumber.clone({
+      precision: precision + 2
+    });
+    var zero = new _BigNumber(0);
+    var one = new Big(1);
+    var inv = root.isNegative();
+    if (inv) {
+      root = root.neg();
+    }
+    if (root.isZero()) {
+      throw new Error('Root must be non-zero');
+    }
+    if (a.isNegative() && !root.abs().mod(2).equals(1)) {
+      throw new Error('Root must be odd when a is negative.');
+    }
+
+    // edge cases zero and infinity
+    if (a.isZero()) {
+      return inv ? new Big(Infinity) : 0;
+    }
+    if (!a.isFinite()) {
+      return inv ? zero : a;
+    }
+    var x = a.abs().pow(one.div(root));
+    // If a < 0, we require that root is an odd integer,
+    // so (-1) ^ (1/root) = -1
+    x = a.isNeg() ? x.neg() : x;
+    return new _BigNumber((inv ? one.div(x) : x).toPrecision(precision));
+  }
+});
+export var createNthRootNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
+  var {
+    typed
+  } = _ref2;
+  return typed(name, {
+    number: nthRootNumber,
+    'number, number': nthRootNumber
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js
new file mode 100644
index 0000000..f84347b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/nthRoots.js
@@ -0,0 +1,111 @@
+import { factory } from '../../utils/factory.js';
+var name = 'nthRoots';
+var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
+export var createNthRoots = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    divideScalar,
+    Complex
+  } = _ref;
+  /**
+   * Each function here returns a real multiple of i as a Complex value.
+   * @param  {number} val
+   * @return {Complex} val, i*val, -val or -i*val for index 0, 1, 2, 3
+   */
+  // This is used to fix float artifacts for zero-valued components.
+  var _calculateExactResult = [function realPos(val) {
+    return new Complex(val, 0);
+  }, function imagPos(val) {
+    return new Complex(0, val);
+  }, function realNeg(val) {
+    return new Complex(-val, 0);
+  }, function imagNeg(val) {
+    return new Complex(0, -val);
+  }];
+
+  /**
+   * Calculate the nth root of a Complex Number a using De Movire's Theorem.
+   * @param  {Complex} a
+   * @param  {number} root
+   * @return {Array} array of n Complex Roots
+   */
+  function _nthComplexRoots(a, root) {
+    if (root < 0) throw new Error('Root must be greater than zero');
+    if (root === 0) throw new Error('Root must be non-zero');
+    if (root % 1 !== 0) throw new Error('Root must be an integer');
+    if (a === 0 || a.abs() === 0) return [new Complex(0, 0)];
+    var aIsNumeric = typeof a === 'number';
+    var offset;
+    // determine the offset (argument of a)/(pi/2)
+    if (aIsNumeric || a.re === 0 || a.im === 0) {
+      if (aIsNumeric) {
+        offset = 2 * +(a < 0); // numeric value on the real axis
+      } else if (a.im === 0) {
+        offset = 2 * +(a.re < 0); // complex value on the real axis
+      } else {
+        offset = 2 * +(a.im < 0) + 1; // complex value on the imaginary axis
+      }
+    }
+    var arg = a.arg();
+    var abs = a.abs();
+    var roots = [];
+    var r = Math.pow(abs, 1 / root);
+    for (var k = 0; k < root; k++) {
+      var halfPiFactor = (offset + 4 * k) / root;
+      /**
+       * If (offset + 4*k)/root is an integral multiple of pi/2
+       * then we can produce a more exact result.
+       */
+      if (halfPiFactor === Math.round(halfPiFactor)) {
+        roots.push(_calculateExactResult[halfPiFactor % 4](r));
+        continue;
+      }
+      roots.push(new Complex({
+        r,
+        phi: (arg + 2 * Math.PI * k) / root
+      }));
+    }
+    return roots;
+  }
+
+  /**
+   * Calculate the nth roots of a value.
+   * An nth root of a positive real number A,
+   * is a positive real solution of the equation "x^root = A".
+   * This function returns an array of complex values.
+   *
+   * Syntax:
+   *
+   *    math.nthRoots(x)
+   *    math.nthRoots(x, root)
+   *
+   * Examples:
+   *
+   *    math.nthRoots(1)
+   *    // returns [
+   *    //   {re: 1, im: 0},
+   *    //   {re: -1, im: 0}
+   *    // ]
+   *    math.nthRoots(1, 3)
+   *    // returns [
+   *    //   { re: 1, im: 0 },
+   *    //   { re: -0.4999999999999998, im: 0.8660254037844387 },
+   *    //   { re: -0.5000000000000004, im: -0.8660254037844385 }
+   *    // ]
+   *
+   * See also:
+   *
+   *    nthRoot, pow, sqrt
+   *
+   * @param {number | BigNumber | Fraction | Complex} x Number to be rounded
+   * @param {number} [root=2] Optional root, default value is 2
+   * @return {number | BigNumber | Fraction | Complex} Returns the nth roots
+   */
+  return typed(name, {
+    Complex: function Complex(x) {
+      return _nthComplexRoots(x, 2);
+    },
+    'Complex, number': _nthComplexRoots
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/pow.js b/node_modules/mathjs/lib/esm/function/arithmetic/pow.js
new file mode 100644
index 0000000..0a93a56
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/pow.js
@@ -0,0 +1,192 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { arraySize as size } from '../../utils/array.js';
+import { powNumber } from '../../plain/number/index.js';
+var name = 'pow';
+var dependencies = ['typed', 'config', 'identity', 'multiply', 'matrix', 'inv', 'fraction', 'number', 'Complex'];
+export var createPow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    identity,
+    multiply,
+    matrix,
+    inv,
+    number,
+    fraction,
+    Complex
+  } = _ref;
+  /**
+   * Calculates the power of x to y, `x ^ y`.
+   *
+   * Matrix exponentiation is supported for square matrices `x` and integers `y`:
+   * when `y` is nonnegative, `x` may be any square matrix; and when `y` is
+   * negative, `x` must be invertible, and then this function returns
+   * inv(x)^(-y).
+   *
+   * For cubic roots of negative numbers, the function returns the principal
+   * root by default. In order to let the function return the real root,
+   * math.js can be configured with `math.config({predictable: true})`.
+   * To retrieve all cubic roots of a value, use `math.cbrt(x, true)`.
+   *
+   * Syntax:
+   *
+   *    math.pow(x, y)
+   *
+   * Examples:
+   *
+   *    math.pow(2, 3)               // returns number 8
+   *
+   *    const a = math.complex(2, 3)
+   *    math.pow(a, 2)                // returns Complex -5 + 12i
+   *
+   *    const b = [[1, 2], [4, 3]]
+   *    math.pow(b, 2)               // returns Array [[9, 8], [16, 17]]
+   *
+   *    const c = [[1, 2], [4, 3]]
+   *    math.pow(c, -1)               // returns Array [[-0.6, 0.4], [0.8, -0.2]]
+   *
+   * See also:
+   *
+   *    multiply, sqrt, cbrt, nthRoot
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x  The base
+   * @param  {number | BigNumber | bigint | Complex} y                          The exponent
+   * @return {number | BigNumber | bigint | Complex | Array | Matrix} The value of `x` to the power `y`
+   */
+  return typed(name, {
+    'number, number': _pow,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.pow(y);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      if (y.isInteger() || x >= 0 || config.predictable) {
+        return x.pow(y);
+      } else {
+        return new Complex(x.toNumber(), 0).pow(y.toNumber(), 0);
+      }
+    },
+    'bigint, bigint': (x, y) => x ** y,
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      var result = x.pow(y);
+      if (result != null) {
+        return result;
+      }
+      if (config.predictable) {
+        throw new Error('Result of pow is non-rational and cannot be expressed as a fraction');
+      } else {
+        return _pow(x.valueOf(), y.valueOf());
+      }
+    },
+    'Array, number': _powArray,
+    'Array, BigNumber': function Array_BigNumber(x, y) {
+      return _powArray(x, y.toNumber());
+    },
+    'Matrix, number': _powMatrix,
+    'Matrix, BigNumber': function Matrix_BigNumber(x, y) {
+      return _powMatrix(x, y.toNumber());
+    },
+    'Unit, number | BigNumber': function Unit_number__BigNumber(x, y) {
+      return x.pow(y);
+    }
+  });
+
+  /**
+   * Calculates the power of x to y, x^y, for two numbers.
+   * @param {number} x
+   * @param {number} y
+   * @return {number | Complex} res
+   * @private
+   */
+  function _pow(x, y) {
+    // Alternatively could define a 'realmode' config option or something, but
+    // 'predictable' will work for now
+    if (config.predictable && !isInteger(y) && x < 0) {
+      // Check to see if y can be represented as a fraction
+      try {
+        var yFrac = fraction(y);
+        var yNum = number(yFrac);
+        if (y === yNum || Math.abs((y - yNum) / y) < 1e-14) {
+          if (yFrac.d % 2n === 1n) {
+            return (yFrac.n % 2n === 0n ? 1 : -1) * Math.pow(-x, y);
+          }
+        }
+      } catch (ex) {
+        // fraction() throws an error if y is Infinity, etc.
+      }
+
+      // Unable to express y as a fraction, so continue on
+    }
+
+    // **for predictable mode** x^Infinity === NaN if x < -1
+    // N.B. this behavour is different from `Math.pow` which gives
+    // (-2)^Infinity === Infinity
+    if (config.predictable && (x < -1 && y === Infinity || x > -1 && x < 0 && y === -Infinity)) {
+      return NaN;
+    }
+    if (isInteger(y) || x >= 0 || config.predictable) {
+      return powNumber(x, y);
+    } else {
+      // TODO: the following infinity checks are duplicated from powNumber. Deduplicate this somehow
+
+      // x^Infinity === 0 if -1 < x < 1
+      // A real number 0 is returned instead of complex(0)
+      if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+        return 0;
+      }
+      return new Complex(x, 0).pow(y, 0);
+    }
+  }
+
+  /**
+   * Calculate the power of a 2d array
+   * @param {Array} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a integer value (positive if `x` is not invertible)
+   * @returns {Array}
+   * @private
+   */
+  function _powArray(x, y) {
+    if (!isInteger(y)) {
+      throw new TypeError('For A^b, b must be an integer (value is ' + y + ')');
+    }
+    // verify that A is a 2 dimensional square matrix
+    var s = size(x);
+    if (s.length !== 2) {
+      throw new Error('For A^b, A must be 2 dimensional (A has ' + s.length + ' dimensions)');
+    }
+    if (s[0] !== s[1]) {
+      throw new Error('For A^b, A must be square (size is ' + s[0] + 'x' + s[1] + ')');
+    }
+    if (y < 0) {
+      try {
+        return _powArray(inv(x), -y);
+      } catch (error) {
+        if (error.message === 'Cannot calculate inverse, determinant is zero') {
+          throw new TypeError('For A^b, when A is not invertible, b must be a positive integer (value is ' + y + ')');
+        }
+        throw error;
+      }
+    }
+    var res = identity(s[0]).valueOf();
+    var px = x;
+    while (y >= 1) {
+      if ((y & 1) === 1) {
+        res = multiply(px, res);
+      }
+      y >>= 1;
+      px = multiply(px, px);
+    }
+    return res;
+  }
+
+  /**
+   * Calculate the power of a 2d matrix
+   * @param {Matrix} x     must be a 2 dimensional, square matrix
+   * @param {number} y    a positive, integer value
+   * @returns {Matrix}
+   * @private
+   */
+  function _powMatrix(x, y) {
+    return matrix(_powArray(x.valueOf(), y));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/round.js b/node_modules/mathjs/lib/esm/function/arithmetic/round.js
new file mode 100644
index 0000000..0863891
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/round.js
@@ -0,0 +1,204 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { nearlyEqual, splitNumber } from '../../utils/number.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { roundNumber } from '../../plain/number/index.js';
+var NO_INT = 'Number of decimals in function round must be an integer';
+var name = 'round';
+var dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'zeros', 'BigNumber', 'DenseMatrix'];
+export var createRound = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    equalScalar,
+    zeros,
+    BigNumber: _BigNumber,
+    DenseMatrix
+  } = _ref;
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  function toExponent(epsilon) {
+    return Math.abs(splitNumber(epsilon).exponent);
+  }
+
+  /**
+   * Round a value towards the nearest rounded value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.round(x)
+   *    math.round(x, n)
+   *    math.round(unit, valuelessUnit)
+   *    math.round(unit, n, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.round(3.22)             // returns number 3
+   *    math.round(3.82)             // returns number 4
+   *    math.round(-4.2)             // returns number -4
+   *    math.round(-4.7)             // returns number -5
+   *    math.round(3.22, 1)          // returns number 3.2
+   *    math.round(3.88, 1)          // returns number 3.9
+   *    math.round(-4.21, 1)         // returns number -4.2
+   *    math.round(-4.71, 1)         // returns number -4.7
+   *    math.round(math.pi, 3)       // returns number 3.142
+   *    math.round(123.45678, 2)     // returns number 123.46
+   *
+   *    const c = math.complex(3.2, -2.7)
+   *    math.round(c)                // returns Complex 3 - 3i
+   *
+   *    const unit = math.unit('3.241 cm')
+   *    const cm = math.unit('cm')
+   *    const mm = math.unit('mm')
+   *    math.round(unit, 1, cm)      // returns Unit 3.2 cm
+   *    math.round(unit, 1, mm)      // returns Unit 32.4 mm
+   *
+   *    math.round([3.2, 3.8, -4.7]) // returns Array [3, 4, -5]
+   *
+   * See also:
+   *
+   *    ceil, fix, floor
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x  Value to be rounded
+   * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
+   * @param  {Unit} [valuelessUnit]                                        A valueless unit
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Rounded value
+   */
+  return typed(name, {
+    number: function number(x) {
+      // Handle round off errors by first rounding to relTol precision
+      var xEpsilon = roundNumber(x, toExponent(config.relTol));
+      var xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return roundNumber(xSelected);
+    },
+    'number, number': function number_number(x, n) {
+      // Same as number: unless user specifies more decimals than relTol
+      var epsilonExponent = toExponent(config.relTol);
+      if (n >= epsilonExponent) {
+        return roundNumber(x, n);
+      }
+      var xEpsilon = roundNumber(x, epsilonExponent);
+      var xSelected = nearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return roundNumber(xSelected, n);
+    },
+    'number, BigNumber': function number_BigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      return new _BigNumber(x).toDecimalPlaces(n.toNumber());
+    },
+    Complex: function Complex(x) {
+      return x.round();
+    },
+    'Complex, number': function Complex_number(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n);
+    },
+    'Complex, BigNumber': function Complex_BigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      var _n = n.toNumber();
+      return x.round(_n);
+    },
+    BigNumber: function BigNumber(x) {
+      // Handle round off errors by first rounding to relTol precision
+      var xEpsilon = new _BigNumber(x).toDecimalPlaces(toExponent(config.relTol));
+      var xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return xSelected.toDecimalPlaces(0);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+
+      // Same as BigNumber: unless user specifies more decimals than relTol
+      var epsilonExponent = toExponent(config.relTol);
+      if (n >= epsilonExponent) {
+        return x.toDecimalPlaces(n.toNumber());
+      }
+      var xEpsilon = x.toDecimalPlaces(epsilonExponent);
+      var xSelected = bigNearlyEqual(x, xEpsilon, config.relTol, config.absTol) ? xEpsilon : x;
+      return xSelected.toDecimalPlaces(n.toNumber());
+    },
+    // bigints can't be rounded
+    bigint: b => b,
+    'bigint, number': (b, _dummy) => b,
+    'bigint, BigNumber': (b, _dummy) => b,
+    Fraction: function Fraction(x) {
+      return x.round();
+    },
+    'Fraction, number': function Fraction_number(x, n) {
+      if (n % 1) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n);
+    },
+    'Fraction, BigNumber': function Fraction_BigNumber(x, n) {
+      if (!n.isInteger()) {
+        throw new TypeError(NO_INT);
+      }
+      return x.round(n.toNumber());
+    },
+    'Unit, number, Unit': typed.referToSelf(self => function (x, n, unit) {
+      var valueless = x.toNumeric(unit);
+      return unit.multiply(self(valueless, n));
+    }),
+    'Unit, BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => self(x, n.toNumber(), unit)),
+    'Array | Matrix, number | BigNumber, Unit': typed.referToSelf(self => (x, n, unit) => {
+      // deep map collection, skip zeros since round(0) = 0
+      return deepMap(x, value => self(value, n, unit), true);
+    }),
+    'Array | Matrix | Unit, Unit': typed.referToSelf(self => (x, unit) => self(x, 0, unit)),
+    'Array | Matrix': typed.referToSelf(self => x => {
+      // deep map collection, skip zeros since round(0) = 0
+      return deepMap(x, self, true);
+    }),
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      return matAlgo11xS0s(x, n, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      return matAlgo14xDs(x, n, self, false);
+    }),
+    'Array, number | BigNumber': typed.referToSelf(self => (x, n) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(x), n, self, false).valueOf();
+    }),
+    'number | Complex | BigNumber | Fraction, SparseMatrix': typed.referToSelf(self => (x, n) => {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(n.size(), n.storage());
+      }
+      return matAlgo12xSfs(n, x, self, true);
+    }),
+    'number | Complex | BigNumber | Fraction, DenseMatrix': typed.referToSelf(self => (x, n) => {
+      // check scalar is zero
+      if (equalScalar(x, 0)) {
+        // do not execute algorithm, result will be a zero matrix
+        return zeros(n.size(), n.storage());
+      }
+      return matAlgo14xDs(n, x, self, true);
+    }),
+    'number | Complex | BigNumber | Fraction, Array': typed.referToSelf(self => (x, n) => {
+      // use matrix implementation
+      return matAlgo14xDs(matrix(n), x, self, true).valueOf();
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/sign.js b/node_modules/mathjs/lib/esm/function/arithmetic/sign.js
new file mode 100644
index 0000000..93ce057
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/sign.js
@@ -0,0 +1,66 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { signNumber } from '../../plain/number/index.js';
+var name = 'sign';
+var dependencies = ['typed', 'BigNumber', 'Fraction', 'complex'];
+export var createSign = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber,
+    complex,
+    Fraction: _Fraction
+  } = _ref;
+  /**
+   * Compute the sign of a value. The sign of a value x is:
+   *
+   * -  1 when x > 0
+   * - -1 when x < 0
+   * -  0 when x == 0
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.sign(x)
+   *
+   * Examples:
+   *
+   *    math.sign(3.5)               // returns 1
+   *    math.sign(-4.2)              // returns -1
+   *    math.sign(0)                 // returns 0
+   *
+   *    math.sign([3, 5, -2, 0, 2])  // returns [1, 1, -1, 0, 1]
+   *
+   * See also:
+   *
+   *    abs
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit} x
+   *            The number for which to determine the sign
+   * @return {number | BigNumber | bigint | Fraction | Complex | Array | Matrix | Unit}
+   *            The sign of `x`
+   */
+  return typed(name, {
+    number: signNumber,
+    Complex: function Complex(x) {
+      return x.im === 0 ? complex(signNumber(x.re)) : x.sign();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(x.cmp(0));
+    },
+    bigint: function bigint(x) {
+      return x > 0n ? 1n : x < 0n ? -1n : 0n;
+    },
+    Fraction: function Fraction(x) {
+      return x.n === 0n ? new _Fraction(0) : new _Fraction(x.s);
+    },
+    // deep map collection, skip zeros since sign(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),
+    Unit: typed.referToSelf(self => x => {
+      if (!x._isDerived() && x.units[0].unit.offset !== 0) {
+        throw new TypeError('sign is ambiguous for units with offset');
+      }
+      return typed.find(self, x.valueType())(x.value);
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js b/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js
new file mode 100644
index 0000000..af7a1c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/sqrt.js
@@ -0,0 +1,70 @@
+import { factory } from '../../utils/factory.js';
+var name = 'sqrt';
+var dependencies = ['config', 'typed', 'Complex'];
+export var createSqrt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the square root of a value.
+   *
+   * For matrices, if you want the matrix square root of a square matrix,
+   * use the `sqrtm` function. If you wish to apply `sqrt` elementwise to
+   * a matrix M, use `math.map(M, math.sqrt)`.
+   *
+   * Syntax:
+   *
+   *    math.sqrt(x)
+   *
+   * Examples:
+   *
+   *    math.sqrt(25)                // returns 5
+   *    math.square(5)               // returns 25
+   *    math.sqrt(-4)                // returns Complex 2i
+   *
+   * See also:
+   *
+   *    square, multiply, cube, cbrt, sqrtm
+   *
+   * @param {number | BigNumber | Complex | Unit} x
+   *            Value for which to calculate the square root.
+   * @return {number | BigNumber | Complex | Unit}
+   *            Returns the square root of `x`
+   */
+  return typed('sqrt', {
+    number: _sqrtNumber,
+    Complex: function Complex(x) {
+      return x.sqrt();
+    },
+    BigNumber: function BigNumber(x) {
+      if (!x.isNegative() || config.predictable) {
+        return x.sqrt();
+      } else {
+        // negative value -> downgrade to number to do complex value computation
+        return _sqrtNumber(x.toNumber());
+      }
+    },
+    Unit: function Unit(x) {
+      // Someday will work for complex units when they are implemented
+      return x.pow(0.5);
+    }
+  });
+
+  /**
+   * Calculate sqrt for a number
+   * @param {number} x
+   * @returns {number | Complex} Returns the square root of x
+   * @private
+   */
+  function _sqrtNumber(x) {
+    if (isNaN(x)) {
+      return NaN;
+    } else if (x >= 0 || config.predictable) {
+      return Math.sqrt(x);
+    } else {
+      return new Complex(x, 0).sqrt();
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/square.js b/node_modules/mathjs/lib/esm/function/arithmetic/square.js
new file mode 100644
index 0000000..373b11f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/square.js
@@ -0,0 +1,55 @@
+import { factory } from '../../utils/factory.js';
+import { squareNumber } from '../../plain/number/index.js';
+var name = 'square';
+var dependencies = ['typed'];
+export var createSquare = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the square of a value, `x * x`.
+   * To avoid confusion with multiplying a square matrix by itself,
+   * this function does not apply to matrices. If you wish to square
+   * every element of a matrix, see the examples.
+   *
+   * Syntax:
+   *
+   *    math.square(x)
+   *
+   * Examples:
+   *
+   *    math.square(2)           // returns number 4
+   *    math.square(3)           // returns number 9
+   *    math.pow(3, 2)           // returns number 9
+   *    math.multiply(3, 3)      // returns number 9
+   *
+   *    math.map([1, 2, 3, 4], math.square)  // returns Array [1, 4, 9, 16]
+   *
+   * See also:
+   *
+   *    multiply, cube, sqrt, pow
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x
+   *            Number for which to calculate the square
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}
+   *            Squared value
+   */
+  return typed(name, {
+    number: squareNumber,
+    Complex: function Complex(x) {
+      return x.mul(x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.times(x);
+    },
+    bigint: function bigint(x) {
+      return x * x;
+    },
+    Fraction: function Fraction(x) {
+      return x.mul(x);
+    },
+    Unit: function Unit(x) {
+      return x.pow(2);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js b/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js
new file mode 100644
index 0000000..e5cee04
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/subtract.js
@@ -0,0 +1,86 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'subtract';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'subtractScalar', 'unaryMinus', 'DenseMatrix', 'concat'];
+export var createSubtract = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    subtractScalar,
+    unaryMinus,
+    DenseMatrix,
+    concat
+  } = _ref;
+  // TODO: split function subtract in two: subtract and subtractScalar
+
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo05xSfSf = createMatAlgo05xSfSf({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Subtract two values, `x - y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.subtract(x, y)
+   *
+   * Examples:
+   *
+   *    math.subtract(5.3, 2)        // returns number 3.3
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(4, 1)
+   *    math.subtract(a, b)          // returns Complex -2 + 2i
+   *
+   *    math.subtract([5, 7, 4], 4)  // returns Array [1, 3, 0]
+   *
+   *    const c = math.unit('2.1 km')
+   *    const d = math.unit('500m')
+   *    math.subtract(c, d)          // returns Unit 1.6 km
+   *
+   * See also:
+   *
+   *    add
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Initial value
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} y Value to subtract from `x`
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Subtraction of `x` and `y`
+   */
+  return typed(name, {
+    'any, any': subtractScalar
+  }, matrixAlgorithmSuite({
+    elop: subtractScalar,
+    SS: matAlgo05xSfSf,
+    DS: matAlgo01xDSid,
+    SD: matAlgo03xDSf,
+    Ss: matAlgo12xSfs,
+    sS: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js b/node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js
new file mode 100644
index 0000000..44b07c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+import { subtractNumber } from '../../plain/number/index.js';
+var name = 'subtractScalar';
+var dependencies = ['typed'];
+export var createSubtractScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Subtract two scalar values, `x - y`.
+   * This function is meant for internal use: it is used by the public function
+   * `subtract`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit} x   First value
+   * @param  {number | BigNumber | bigint | Fraction | Complex} y          Second value to be subtracted from `x`
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit}     Difference of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': subtractNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.sub(y);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.minus(y);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x - y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return x.sub(y);
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (x.value === null || x.value === undefined) {
+        throw new Error('Parameter x contains a unit with undefined value');
+      }
+      if (y.value === null || y.value === undefined) {
+        throw new Error('Parameter y contains a unit with undefined value');
+      }
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      var res = x.clone();
+      res.value = typed.find(self, [res.valueType(), y.valueType()])(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    })
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js b/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js
new file mode 100644
index 0000000..696c665
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { unaryMinusNumber } from '../../plain/number/index.js';
+var name = 'unaryMinus';
+var dependencies = ['typed'];
+export var createUnaryMinus = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Inverse the sign of a value, apply a unary minus operation.
+   *
+   * For matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real and
+   * complex value are inverted.
+   *
+   * Syntax:
+   *
+   *    math.unaryMinus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryMinus(3.5)      // returns -3.5
+   *    math.unaryMinus(-4.2)     // returns 4.2
+   *
+   * See also:
+   *
+   *    add, subtract, unaryPlus
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} x Number to be inverted.
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix} Returns the value with inverted sign.
+   */
+  return typed(name, {
+    number: unaryMinusNumber,
+    'Complex | BigNumber | Fraction': x => x.neg(),
+    bigint: x => -x,
+    Unit: typed.referToSelf(self => x => {
+      var res = x.clone();
+      res.value = typed.find(self, res.valueType())(x.value);
+      return res;
+    }),
+    // deep map collection, skip zeros since unaryMinus(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true))
+
+    // TODO: add support for string
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js b/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js
new file mode 100644
index 0000000..411b331
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/unaryPlus.js
@@ -0,0 +1,63 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { unaryPlusNumber } from '../../plain/number/index.js';
+import { safeNumberType } from '../../utils/number.js';
+var name = 'unaryPlus';
+var dependencies = ['typed', 'config', 'numeric'];
+export var createUnaryPlus = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric
+  } = _ref;
+  /**
+   * Unary plus operation.
+   * Boolean values and strings will be converted to a number, numeric values will be returned as is.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.unaryPlus(x)
+   *
+   * Examples:
+   *
+   *    math.unaryPlus(3.5)      // returns 3.5
+   *    math.unaryPlus(1)     // returns 1
+   *
+   * See also:
+   *
+   *    unaryMinus, add, subtract
+   *
+   * @param  {number | BigNumber | bigint | Fraction | string | Complex | Unit | Array | Matrix} x
+   *            Input value
+   * @return {number | BigNumber | bigint | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns the input value when numeric, converts to a number when input is non-numeric.
+   */
+  return typed(name, {
+    number: unaryPlusNumber,
+    Complex: function Complex(x) {
+      return x; // complex numbers are immutable
+    },
+    BigNumber: function BigNumber(x) {
+      return x; // bignumbers are immutable
+    },
+    bigint: function bigint(x) {
+      return x;
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    // deep map collection, skip zeros since unaryPlus(0) = 0
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self, true)),
+    boolean: function boolean(x) {
+      return numeric(x ? 1 : 0, config.number);
+    },
+    string: function string(x) {
+      return numeric(x, safeNumberType(x, config));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js b/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js
new file mode 100644
index 0000000..5cabe42
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/arithmetic/xgcd.js
@@ -0,0 +1,91 @@
+import { factory } from '../../utils/factory.js';
+import { xgcdNumber } from '../../plain/number/index.js';
+var name = 'xgcd';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createXgcd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Calculate the extended greatest common divisor for two values.
+   * See https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   *
+   * Syntax:
+   *
+   *    math.xgcd(a, b)
+   *
+   * Examples:
+   *
+   *    math.xgcd(8, 12)             // returns [4, -1, 1]
+   *    math.gcd(8, 12)              // returns 4
+   *    math.xgcd(36163, 21199)      // returns [1247, -7, 12]
+   *
+   * See also:
+   *
+   *    gcd, lcm
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {Array}              Returns an array containing 3 integers `[div, m, n]`
+   *                              where `div = gcd(a, b)` and `a*m + b*n = div`
+   */
+  return typed(name, {
+    'number, number': function number_number(a, b) {
+      var res = xgcdNumber(a, b);
+      return config.matrix === 'Array' ? res : matrix(res);
+    },
+    'BigNumber, BigNumber': _xgcdBigNumber
+    // TODO: implement support for Fraction
+  });
+
+  /**
+   * Calculate xgcd for two BigNumbers
+   * @param {BigNumber} a
+   * @param {BigNumber} b
+   * @return {BigNumber[]} result
+   * @private
+   */
+  function _xgcdBigNumber(a, b) {
+    // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+    var
+    // used to swap two variables
+    t;
+    var
+    // quotient
+    q;
+    var
+    // remainder
+    r;
+    var zero = new BigNumber(0);
+    var one = new BigNumber(1);
+    var x = zero;
+    var lastx = one;
+    var y = one;
+    var lasty = zero;
+    if (!a.isInt() || !b.isInt()) {
+      throw new Error('Parameters in function xgcd must be integer numbers');
+    }
+    while (!b.isZero()) {
+      q = a.div(b).floor();
+      r = a.mod(b);
+      t = x;
+      x = lastx.minus(q.times(x));
+      lastx = t;
+      t = y;
+      y = lasty.minus(q.times(y));
+      lasty = t;
+      a = b;
+      b = r;
+    }
+    var res;
+    if (a.lt(zero)) {
+      res = [a.neg(), lastx.neg(), lasty.neg()];
+    } else {
+      res = [a, !a.isZero() ? lastx : 0, lasty];
+    }
+    return config.matrix === 'Array' ? res : matrix(res);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js b/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js
new file mode 100644
index 0000000..e96ab8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitAnd.js
@@ -0,0 +1,66 @@
+import { bitAndBigNumber } from '../../utils/bignumber/bitwise.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { bitAndNumber } from '../../plain/number/index.js';
+var name = 'bitAnd';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'concat'];
+export var createBitAnd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    concat
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo06xS0S0 = createMatAlgo06xS0S0({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise AND two values, `x & y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitAnd(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitAnd(53, 131)               // returns number 1
+   *
+   *    math.bitAnd([1, 12, 31], 42)       // returns Array [0, 8, 10]
+   *
+   * See also:
+   *
+   *    bitNot, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to and
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to and
+   * @return {number | BigNumber | bigint | Array | Matrix} AND of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': bitAndNumber,
+    'BigNumber, BigNumber': bitAndBigNumber,
+    'bigint, bigint': (x, y) => x & y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0,
+    Ss: matAlgo11xS0s
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js b/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js
new file mode 100644
index 0000000..98b3bcd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitNot.js
@@ -0,0 +1,39 @@
+import { bitNotBigNumber } from '../../utils/bignumber/bitwise.js';
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { bitNotNumber } from '../../plain/number/index.js';
+var name = 'bitNot';
+var dependencies = ['typed'];
+export var createBitNot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Bitwise NOT value, `~x`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.bitNot(x)
+   *
+   * Examples:
+   *
+   *    math.bitNot(1)               // returns number -2
+   *
+   *    math.bitNot([2, -3, 4])      // returns Array [-3, 2, -5]
+   *
+   * See also:
+   *
+   *    bitAnd, bitOr, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to not
+   * @return {number | BigNumber | bigint | Array | Matrix} NOT of `x`
+   */
+  return typed(name, {
+    number: bitNotNumber,
+    BigNumber: bitNotBigNumber,
+    bigint: x => ~x,
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js b/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js
new file mode 100644
index 0000000..2b43619
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitOr.js
@@ -0,0 +1,67 @@
+import { bitOrBigNumber } from '../../utils/bignumber/bitwise.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatAlgo04xSidSid } from '../../type/matrix/utils/matAlgo04xSidSid.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { bitOrNumber } from '../../plain/number/index.js';
+var name = 'bitOr';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+export var createBitOr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo04xSidSid = createMatAlgo04xSidSid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise OR two values, `x | y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the lowest print base.
+   *
+   * Syntax:
+   *
+   *    math.bitOr(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitOr(1, 2)               // returns number 3
+   *
+   *    math.bitOr([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitXor, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to or
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to or
+   * @return {number | BigNumber | bigint | Array | Matrix} OR of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': bitOrNumber,
+    'BigNumber, BigNumber': bitOrBigNumber,
+    'bigint, bigint': (x, y) => x | y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo04xSidSid,
+    DS: matAlgo01xDSid,
+    Ss: matAlgo10xSids
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js b/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js
new file mode 100644
index 0000000..1e87a92
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/bitXor.js
@@ -0,0 +1,66 @@
+import { bitXor as bigBitXor } from '../../utils/bignumber/bitwise.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { bitXorNumber } from '../../plain/number/index.js';
+var name = 'bitXor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createBitXor = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Bitwise XOR two values, `x ^ y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.bitXor(x, y)
+   *
+   * Examples:
+   *
+   *    math.bitXor(1, 2)               // returns number 3
+   *
+   *    math.bitXor([2, 3, 4], 4)       // returns Array [6, 7, 0]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, leftShift, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x First value to xor
+   * @param  {number | BigNumber | bigint | Array | Matrix} y Second value to xor
+   * @return {number | BigNumber | bigint | Array | Matrix} XOR of `x` and `y`
+   */
+  return typed(name, {
+    'number, number': bitXorNumber,
+    'BigNumber, BigNumber': bigBitXor,
+    'bigint, bigint': (x, y) => x ^ y
+  }, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js b/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js
new file mode 100644
index 0000000..bbcc6e0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/leftShift.js
@@ -0,0 +1,115 @@
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';
+import { leftShiftNumber } from '../../plain/number/index.js';
+import { leftShiftBigNumber } from '../../utils/bignumber/bitwise.js';
+var name = 'leftShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+export var createLeftShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, `x << y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.leftShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.leftShift(1, 2)               // returns number 4
+   *
+   *    math.leftShift([1, 2, 4], 4)       // returns Array [16, 32, 64]
+   *
+   * See also:
+   *
+   *    leftShift, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber | bigint} y Amount of shifts
+   * @return {number | BigNumber | bigint | Array | Matrix} `x` shifted left `y` times
+   */
+  return typed(name, {
+    'number, number': leftShiftNumber,
+    'BigNumber, BigNumber': leftShiftBigNumber,
+    'bigint, bigint': (x, y) => x << y,
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js b/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js
new file mode 100644
index 0000000..03eaacf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/rightArithShift.js
@@ -0,0 +1,115 @@
+import { rightArithShiftBigNumber } from '../../utils/bignumber/bitwise.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';
+import { rightArithShiftNumber } from '../../plain/number/index.js';
+var name = 'rightArithShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+export var createRightArithShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, `x >> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightArithShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightArithShift(4, 2)               // returns number 1
+   *
+   *    math.rightArithShift([16, -32, 64], 4)   // returns Array [1, -2, 4]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, rightArithShift, rightLogShift
+   *
+   * @param  {number | BigNumber | bigint | Array | Matrix} x Value to be shifted
+   * @param  {number | BigNumber | bigint} y Amount of shifts
+   * @return {number | BigNumber | bigint | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+  return typed(name, {
+    'number, number': rightArithShiftNumber,
+    'BigNumber, BigNumber': rightArithShiftBigNumber,
+    'bigint, bigint': (x, y) => x >> y,
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js b/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js
new file mode 100644
index 0000000..b849509
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/rightLogShift.js
@@ -0,0 +1,115 @@
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { createMatAlgo01xDSid } from '../../type/matrix/utils/matAlgo01xDSid.js';
+import { createMatAlgo10xSids } from '../../type/matrix/utils/matAlgo10xSids.js';
+import { createMatAlgo08xS0Sid } from '../../type/matrix/utils/matAlgo08xS0Sid.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { rightLogShiftNumber } from '../../plain/number/index.js';
+import { createUseMatrixForArrayScalar } from './useMatrixForArrayScalar.js';
+var name = 'rightLogShift';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix', 'concat'];
+export var createRightLogShift = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo01xDSid = createMatAlgo01xDSid({
+    typed
+  });
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo08xS0Sid = createMatAlgo08xS0Sid({
+    typed,
+    equalScalar
+  });
+  var matAlgo10xSids = createMatAlgo10xSids({
+    typed,
+    DenseMatrix
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var useMatrixForArrayScalar = createUseMatrixForArrayScalar({
+    typed,
+    matrix
+  });
+
+  /**
+   * Bitwise right logical shift of value x by y number of bits, `x >>> y`.
+   * For matrices, the function is evaluated element wise.
+   * For units, the function is evaluated on the best prefix base.
+   *
+   * Syntax:
+   *
+   *    math.rightLogShift(x, y)
+   *
+   * Examples:
+   *
+   *    math.rightLogShift(4, 2)               // returns number 1
+   *
+   *    math.rightLogShift([16, 32, 64], 4)    // returns Array [1, 2, 4]
+   *
+   * See also:
+   *
+   *    bitAnd, bitNot, bitOr, bitXor, leftShift, rightLogShift
+   *
+   * @param  {number | Array | Matrix} x Value to be shifted
+   * @param  {number} y Amount of shifts
+   * @return {number | Array | Matrix} `x` zero-filled shifted right `y` times
+   */
+
+  return typed(name, {
+    'number, number': rightLogShiftNumber,
+    // 'BigNumber, BigNumber': ..., // TODO: implement BigNumber support for rightLogShift
+
+    'SparseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, number | BigNumber': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(y, 0)) {
+        return x.clone();
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'number | BigNumber, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo10xSids(y, x, self, true);
+    }),
+    'number | BigNumber, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (equalScalar(x, 0)) {
+        return zeros(y.size(), y.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    })
+  }, useMatrixForArrayScalar, matrixAlgorithmSuite({
+    SS: matAlgo08xS0Sid,
+    DS: matAlgo01xDSid,
+    SD: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/bitwise/useMatrixForArrayScalar.js b/node_modules/mathjs/lib/esm/function/bitwise/useMatrixForArrayScalar.js
new file mode 100644
index 0000000..5cd79ec
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/bitwise/useMatrixForArrayScalar.js
@@ -0,0 +1,13 @@
+import { factory } from '../../utils/factory.js';
+export var createUseMatrixForArrayScalar = /* #__PURE__ */factory('useMatrixForArrayScalar', ['typed', 'matrix'], _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  return {
+    'Array, number': typed.referTo('DenseMatrix, number', selfDn => (x, y) => selfDn(matrix(x), y).valueOf()),
+    'Array, BigNumber': typed.referTo('DenseMatrix, BigNumber', selfDB => (x, y) => selfDB(matrix(x), y).valueOf()),
+    'number, Array': typed.referTo('number, DenseMatrix', selfnD => (x, y) => selfnD(x, matrix(y)).valueOf()),
+    'BigNumber, Array': typed.referTo('BigNumber, DenseMatrix', selfBD => (x, y) => selfBD(x, matrix(y)).valueOf())
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js b/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js
new file mode 100644
index 0000000..8b0b07d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/bellNumbers.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+var name = 'bellNumbers';
+var dependencies = ['typed', 'addScalar', 'isNegative', 'isInteger', 'stirlingS2'];
+export var createBellNumbers = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    isNegative,
+    isInteger,
+    stirlingS2
+  } = _ref;
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition is a pairwise disjoint subset of S whose union is S.
+   * bellNumbers only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.bellNumbers(n)
+   *
+   * Examples:
+   *
+   *    math.bellNumbers(3) // returns 5
+   *    math.bellNumbers(8) // returns 4140
+   *
+   * See also:
+   *
+   *    stirlingS2
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @return {Number | BigNumber}     B(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function number__BigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function bellNumbers');
+      }
+
+      // Sum (k=0, n) S(n,k).
+      var result = 0;
+      for (var i = 0; i <= n; i++) {
+        result = addScalar(result, stirlingS2(n, i));
+      }
+      return result;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js b/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js
new file mode 100644
index 0000000..986d076
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/catalan.js
@@ -0,0 +1,43 @@
+import { factory } from '../../utils/factory.js';
+var name = 'catalan';
+var dependencies = ['typed', 'addScalar', 'divideScalar', 'multiplyScalar', 'combinations', 'isNegative', 'isInteger'];
+export var createCatalan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    divideScalar,
+    multiplyScalar,
+    combinations,
+    isNegative,
+    isInteger
+  } = _ref;
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many different types.
+   * catalan only takes integer arguments.
+   * The following condition must be enforced: n >= 0
+   *
+   * Syntax:
+   *
+   *   math.catalan(n)
+   *
+   * Examples:
+   *
+   *    math.catalan(3) // returns 5
+   *    math.catalan(8) // returns 1430
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    nth Catalan number
+   * @return {Number | BigNumber}     Cn(n)
+   */
+  return typed(name, {
+    'number | BigNumber': function number__BigNumber(n) {
+      if (!isInteger(n) || isNegative(n)) {
+        throw new TypeError('Non-negative integer value expected in function catalan');
+      }
+      return divideScalar(combinations(multiplyScalar(n, 2), n), addScalar(n, 1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/composition.js b/node_modules/mathjs/lib/esm/function/combinatorics/composition.js
new file mode 100644
index 0000000..a7ff05c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/composition.js
@@ -0,0 +1,46 @@
+import { factory } from '../../utils/factory.js';
+var name = 'composition';
+var dependencies = ['typed', 'addScalar', 'combinations', 'isNegative', 'isPositive', 'isInteger', 'larger'];
+export var createComposition = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    combinations,
+    isPositive,
+    isNegative,
+    isInteger,
+    larger
+  } = _ref;
+  /**
+   * The composition counts of n into k parts.
+   *
+   * composition only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *   math.composition(n, k)
+   *
+   * Examples:
+   *
+   *    math.composition(5, 3) // returns 6
+   *
+   * See also:
+   *
+   *    combinations
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     Returns the composition counts of n into k parts.
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, k) {
+      if (!isInteger(n) || !isPositive(n) || !isInteger(k) || !isPositive(k)) {
+        throw new TypeError('Positive integer value expected in function composition');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function composition');
+      }
+      return combinations(addScalar(n, -1), addScalar(k, -1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js b/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js
new file mode 100644
index 0000000..539bcac
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/combinatorics/stirlingS2.js
@@ -0,0 +1,86 @@
+import { factory } from '../../utils/factory.js';
+import { isNumber } from '../../utils/is.js';
+var name = 'stirlingS2';
+var dependencies = ['typed', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'factorial', 'combinations', 'isNegative', 'isInteger', 'number', '?bignumber', 'larger'];
+export var createStirlingS2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    factorial,
+    combinations,
+    isNegative,
+    isInteger,
+    number,
+    bignumber,
+    larger
+  } = _ref;
+  var smallCache = [];
+  var bigCache = [];
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to partition
+   * a set of n labelled objects into k nonempty unlabelled subsets.
+   * stirlingS2 only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   *  If n = k or k = 1 <= n, then s(n,k) = 1
+   *  If k = 0 < n, then s(n,k) = 0
+   *
+   * Note that if either n or k is supplied as a BigNumber, the result will be
+   * as well.
+   *
+   * Syntax:
+   *
+   *   math.stirlingS2(n, k)
+   *
+   * Examples:
+   *
+   *    math.stirlingS2(5, 3) //returns 25
+   *
+   * See also:
+   *
+   *    bellNumbers
+   *
+   * @param {Number | BigNumber} n    Total number of objects in the set
+   * @param {Number | BigNumber} k    Number of objects in the subset
+   * @return {Number | BigNumber}     S(n,k)
+   */
+  return typed(name, {
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, k) {
+      if (!isInteger(n) || isNegative(n) || !isInteger(k) || isNegative(k)) {
+        throw new TypeError('Non-negative integer value expected in function stirlingS2');
+      } else if (larger(k, n)) {
+        throw new TypeError('k must be less than or equal to n in function stirlingS2');
+      }
+      var big = !(isNumber(n) && isNumber(k));
+      var cache = big ? bigCache : smallCache;
+      var make = big ? bignumber : number;
+      var nn = number(n);
+      var nk = number(k);
+      /* See if we already have the value: */
+      if (cache[nn] && cache[nn].length > nk) {
+        return cache[nn][nk];
+      }
+      /* Fill the cache */
+      for (var m = 0; m <= nn; ++m) {
+        if (!cache[m]) {
+          cache[m] = [m === 0 ? make(1) : make(0)];
+        }
+        if (m === 0) continue;
+        var row = cache[m];
+        var prev = cache[m - 1];
+        for (var i = row.length; i <= m && i <= nk; ++i) {
+          if (i === m) {
+            row[i] = 1;
+          } else {
+            row[i] = addScalar(multiplyScalar(make(i), prev[i]), prev[i - 1]);
+          }
+        }
+      }
+      return cache[nn][nk];
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/arg.js b/node_modules/mathjs/lib/esm/function/complex/arg.js
new file mode 100644
index 0000000..d3d10c8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/arg.js
@@ -0,0 +1,50 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'arg';
+var dependencies = ['typed'];
+export var createArg = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the argument of a complex value.
+   * For a complex number `a + bi`, the argument is computed as `atan2(b, a)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.arg(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 2)
+   *    math.arg(a) / math.pi          // returns number 0.25
+   *
+   *    const b = math.complex('2 + 3i')
+   *    math.arg(b)                    // returns number 0.982793723247329
+   *    math.atan2(3, 2)               // returns number 0.982793723247329
+   *
+   * See also:
+   *
+   *    re, im, conj, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The argument of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      return Math.atan2(0, x);
+    },
+    BigNumber: function BigNumber(x) {
+      return x.constructor.atan2(0, x);
+    },
+    Complex: function Complex(x) {
+      return x.arg();
+    },
+    // TODO: implement BigNumber support for function arg
+
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/conj.js b/node_modules/mathjs/lib/esm/function/complex/conj.js
new file mode 100644
index 0000000..bef1b28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/conj.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'conj';
+var dependencies = ['typed'];
+export var createConj = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the complex conjugate of a complex value.
+   * If `x = a+bi`, the complex conjugate of `x` is `a - bi`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.conj(x)
+   *
+   * Examples:
+   *
+   *    math.conj(math.complex('2 + 3i'))  // returns Complex 2 - 3i
+   *    math.conj(math.complex('2 - 3i'))  // returns Complex 2 + 3i
+   *    math.conj(math.complex('-5.2i'))  // returns Complex 5.2i
+   *
+   * See also:
+   *
+   *    re, im, arg, abs
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix | Unit} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Complex | Array | Matrix | Unit}
+   *            The complex conjugate of x
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction': x => x,
+    Complex: x => x.conjugate(),
+    Unit: typed.referToSelf(self => x => new x.constructor(self(x.toNumeric()), x.formatUnits())),
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/im.js b/node_modules/mathjs/lib/esm/function/complex/im.js
new file mode 100644
index 0000000..8501b57
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/im.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 'im';
+var dependencies = ['typed'];
+export var createIm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Get the imaginary part of a complex number.
+   * For a complex number `a + bi`, the function returns `b`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.im(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number -5.2
+   *    math.re(math.complex(2.4))     // returns number 0
+   *
+   * See also:
+   *
+   *    re, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The imaginary part of x
+   */
+  return typed(name, {
+    number: () => 0,
+    'BigNumber | Fraction': x => x.mul(0),
+    Complex: x => x.im,
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/complex/re.js b/node_modules/mathjs/lib/esm/function/complex/re.js
new file mode 100644
index 0000000..148f0c3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/complex/re.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+var name = 're';
+var dependencies = ['typed'];
+export var createRe = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Get the real part of a complex number.
+   * For a complex number `a + bi`, the function returns `a`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.re(x)
+   *
+   * Examples:
+   *
+   *    const a = math.complex(2, 3)
+   *    math.re(a)                     // returns number 2
+   *    math.im(a)                     // returns number 3
+   *
+   *    math.re(math.complex('-5.2i')) // returns number 0
+   *    math.re(math.complex(2.4))     // returns number 2.4
+   *
+   * See also:
+   *
+   *    im, conj, abs, arg
+   *
+   * @param {number | BigNumber | Complex | Array | Matrix} x
+   *            A complex number or array with complex numbers
+   * @return {number | BigNumber | Array | Matrix} The real part of x
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction': x => x,
+    Complex: x => x.re,
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/geometry/distance.js b/node_modules/mathjs/lib/esm/function/geometry/distance.js
new file mode 100644
index 0000000..dc7d83c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/geometry/distance.js
@@ -0,0 +1,305 @@
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'distance';
+var dependencies = ['typed', 'addScalar', 'subtractScalar', 'divideScalar', 'multiplyScalar', 'deepEqual', 'sqrt', 'abs'];
+export var createDistance = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    deepEqual,
+    sqrt,
+    abs
+  } = _ref;
+  /**
+    * Calculates:
+    *    The eucledian distance between two points in N-dimensional spaces.
+    *    Distance between point and a line in 2 and 3 dimensional spaces.
+    *    Pairwise distance between a set of 2D or 3D points
+    * NOTE:
+    *    When substituting coefficients of a line(a, b and c), use ax + by + c = 0 instead of ax + by = c
+    *    For parametric equation of a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b, c)
+    *
+    * Syntax:
+    *
+    *    math.distance([x1,y1], [x2,y2])
+    *    math.distance({pointOneX, pointOneY}, {pointTwoX, pointTwoY})
+    *    math.distance([x1,y1,z1], [x2,y2,z2])
+    *    math.distance({pointOneX, pointOneY, pointOneZ}, {pointTwoX, pointTwoY, pointTwoZ})
+    *    math.distance([x1,y1,z1,a1], [x2,y2,z2,a2])
+    *    math.distance([[x1,y1], [x2,y2], [x3,y3]])
+    *    math.distance([[x1,y1,z1], [x2,y2,z2], [x3,y3,z3]])
+    *    math.distance([pointX,pointY], [a,b,c])
+    *    math.distance([pointX,pointY], [lineOnePtX,lineOnePtY], [lineTwoPtX,lineTwoPtY])
+    *    math.distance({pointX, pointY}, {lineOnePtX, lineOnePtY}, {lineTwoPtX, lineTwoPtY})
+    *    math.distance([pointX,pointY,pointZ], [x0, y0, z0, a, b, c])
+    *    math.distance({pointX, pointY, pointZ}, {x0, y0, z0, a, b, c})
+    *
+    * Examples:
+    *    math.distance([0,0], [4,4])                     // Returns 5.656854249492381
+    *    math.distance(
+    *     {pointOneX: 0, pointOneY: 0},
+    *     {pointTwoX: 10, pointTwoY: 10})                // Returns 14.142135623730951
+    *    math.distance([1, 0, 1], [4, -2, 2])            // Returns 3.7416573867739413
+    *    math.distance(
+    *     {pointOneX: 4, pointOneY: 5, pointOneZ: 8},
+    *     {pointTwoX: 2, pointTwoY: 7, pointTwoZ: 9})    // Returns 3
+    *    math.distance([1, 0, 1, 0], [0, -1, 0, -1])     // Returns 2
+    *    math.distance([[1, 2], [1, 2], [1, 3]])         // Returns [0, 1, 1]
+    *    math.distance([[1,2,4], [1,2,6], [8,1,3]])      // Returns [2, 7.14142842854285, 7.681145747868608]
+    *    math.distance([10, 10], [8, 1, 3])              // Returns 11.535230316796387
+    *    math.distance([0, 0], [3, 0], [0, 4])        // Returns 2.4
+    *    math.distance(
+    *     {pointX: 0, pointY: 0},
+    *     {lineOnePtX: 3, lineOnePtY: 0},
+    *     {lineTwoPtX: 0, lineTwoPtY: 4})                // Returns 2.4
+    *    math.distance([2, 3, 1], [1, 1, 2, 5, 0, 1])    // Returns 2.3204774044612857
+    *    math.distance(
+    *     {pointX: 2, pointY: 3, pointZ: 1},
+    *     {x0: 1, y0: 1, z0: 2, a: 5, b: 0, c: 1})       // Returns 2.3204774044612857
+    *
+    * @param {Array | Matrix | Object} x    Co-ordinates of first point
+    * @param {Array | Matrix | Object} y    Co-ordinates of second point
+    * @return {Number | BigNumber} Returns the distance from two/three points
+  */
+  return typed(name, {
+    'Array, Array, Array': function Array_Array_Array(x, y, z) {
+      // Point to Line 2D (x=Point, y=LinePoint1, z=LinePoint2)
+      if (x.length === 2 && y.length === 2 && z.length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+        }
+        if (!_2d(z)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+        }
+        if (deepEqual(y, z)) {
+          throw new TypeError('LinePoint1 should not be same with LinePoint2');
+        }
+        var xCoeff = subtractScalar(z[1], y[1]);
+        var yCoeff = subtractScalar(y[0], z[0]);
+        var constant = subtractScalar(multiplyScalar(z[0], y[1]), multiplyScalar(y[0], z[1]));
+        return _distancePointLine2D(x[0], x[1], xCoeff, yCoeff, constant);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object, Object': function Object_Object_Object(x, y, z) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 2 && Object.keys(z).length === 2) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Values of lineOnePtX and lineOnePtY should be numbers or BigNumbers');
+        }
+        if (!_2d(z)) {
+          throw new TypeError('Values of lineTwoPtX and lineTwoPtY should be numbers or BigNumbers');
+        }
+        if (deepEqual(_objectToArray(y), _objectToArray(z))) {
+          throw new TypeError('LinePoint1 should not be same with LinePoint2');
+        }
+        if ('pointX' in x && 'pointY' in x && 'lineOnePtX' in y && 'lineOnePtY' in y && 'lineTwoPtX' in z && 'lineTwoPtY' in z) {
+          var xCoeff = subtractScalar(z.lineTwoPtY, y.lineOnePtY);
+          var yCoeff = subtractScalar(y.lineOnePtX, z.lineTwoPtX);
+          var constant = subtractScalar(multiplyScalar(z.lineTwoPtX, y.lineOnePtY), multiplyScalar(y.lineOnePtX, z.lineTwoPtY));
+          return _distancePointLine2D(x.pointX, x.pointY, xCoeff, yCoeff, constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Array, Array': function Array_Array(x, y) {
+      // Point to Line 2D (x=[pointX, pointY], y=[x-coeff, y-coeff, const])
+      if (x.length === 2 && y.length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+        }
+        return _distancePointLine2D(x[0], x[1], y[0], y[1], y[2]);
+      } else if (x.length === 3 && y.length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+        }
+        if (!_parametricLine(y)) {
+          throw new TypeError('Array with 6 numbers or BigNumbers expected for second argument');
+        }
+        return _distancePointLine3D(x[0], x[1], x[2], y[0], y[1], y[2], y[3], y[4], y[5]);
+      } else if (x.length === y.length && x.length > 0) {
+        // Point to Point N-dimensions
+        if (!_containsOnlyNumbers(x)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+        if (!_containsOnlyNumbers(y)) {
+          throw new TypeError('All values of an array should be numbers or BigNumbers');
+        }
+        return _euclideanDistance(x, y);
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    'Object, Object': function Object_Object(x, y) {
+      if (Object.keys(x).length === 2 && Object.keys(y).length === 3) {
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointX and pointY should be numbers or BigNumbers');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Values of xCoeffLine, yCoeffLine and constant should be numbers or BigNumbers');
+        }
+        if ('pointX' in x && 'pointY' in x && 'xCoeffLine' in y && 'yCoeffLine' in y && 'constant' in y) {
+          return _distancePointLine2D(x.pointX, x.pointY, y.xCoeffLine, y.yCoeffLine, y.constant);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 6) {
+        // Point to Line 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointX, pointY and pointZ should be numbers or BigNumbers');
+        }
+        if (!_parametricLine(y)) {
+          throw new TypeError('Values of x0, y0, z0, a, b and c should be numbers or BigNumbers');
+        }
+        if ('pointX' in x && 'pointY' in x && 'x0' in y && 'y0' in y && 'z0' in y && 'a' in y && 'b' in y && 'c' in y) {
+          return _distancePointLine3D(x.pointX, x.pointY, x.pointZ, y.x0, y.y0, y.z0, y.a, y.b, y.c);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 2 && Object.keys(y).length === 2) {
+        // Point to Point 2D
+        if (!_2d(x)) {
+          throw new TypeError('Values of pointOneX and pointOneY should be numbers or BigNumbers');
+        }
+        if (!_2d(y)) {
+          throw new TypeError('Values of pointTwoX and pointTwoY should be numbers or BigNumbers');
+        }
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointTwoX' in y && 'pointTwoY' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY], [y.pointTwoX, y.pointTwoY]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else if (Object.keys(x).length === 3 && Object.keys(y).length === 3) {
+        // Point to Point 3D
+        if (!_3d(x)) {
+          throw new TypeError('Values of pointOneX, pointOneY and pointOneZ should be numbers or BigNumbers');
+        }
+        if (!_3d(y)) {
+          throw new TypeError('Values of pointTwoX, pointTwoY and pointTwoZ should be numbers or BigNumbers');
+        }
+        if ('pointOneX' in x && 'pointOneY' in x && 'pointOneZ' in x && 'pointTwoX' in y && 'pointTwoY' in y && 'pointTwoZ' in y) {
+          return _euclideanDistance([x.pointOneX, x.pointOneY, x.pointOneZ], [y.pointTwoX, y.pointTwoY, y.pointTwoZ]);
+        } else {
+          throw new TypeError('Key names do not match');
+        }
+      } else {
+        throw new TypeError('Invalid Arguments: Try again');
+      }
+    },
+    Array: function Array(arr) {
+      if (!_pairwise(arr)) {
+        throw new TypeError('Incorrect array format entered for pairwise distance calculation');
+      }
+      return _distancePairwise(arr);
+    }
+  });
+  function _isNumber(a) {
+    // distance supports numbers and bignumbers
+    return typeof a === 'number' || isBigNumber(a);
+  }
+  function _2d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]);
+  }
+  function _3d(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]);
+  }
+  function _containsOnlyNumbers(a) {
+    // checks if the number of arguments are correct in count and are valid (should be numbers)
+    if (!Array.isArray(a)) {
+      a = _objectToArray(a);
+    }
+    return a.every(_isNumber);
+  }
+  function _parametricLine(a) {
+    if (a.constructor !== Array) {
+      a = _objectToArray(a);
+    }
+    return _isNumber(a[0]) && _isNumber(a[1]) && _isNumber(a[2]) && _isNumber(a[3]) && _isNumber(a[4]) && _isNumber(a[5]);
+  }
+  function _objectToArray(o) {
+    var keys = Object.keys(o);
+    var a = [];
+    for (var i = 0; i < keys.length; i++) {
+      a.push(o[keys[i]]);
+    }
+    return a;
+  }
+  function _pairwise(a) {
+    // checks for valid arguments passed to _distancePairwise(Array)
+    if (a[0].length === 2 && _isNumber(a[0][0]) && _isNumber(a[0][1])) {
+      if (a.some(aI => aI.length !== 2 || !_isNumber(aI[0]) || !_isNumber(aI[1]))) {
+        return false;
+      }
+    } else if (a[0].length === 3 && _isNumber(a[0][0]) && _isNumber(a[0][1]) && _isNumber(a[0][2])) {
+      if (a.some(aI => aI.length !== 3 || !_isNumber(aI[0]) || !_isNumber(aI[1]) || !_isNumber(aI[2]))) {
+        return false;
+      }
+    } else {
+      return false;
+    }
+    return true;
+  }
+  function _distancePointLine2D(x, y, a, b, c) {
+    var num = abs(addScalar(addScalar(multiplyScalar(a, x), multiplyScalar(b, y)), c));
+    var den = sqrt(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)));
+    return divideScalar(num, den);
+  }
+  function _distancePointLine3D(x, y, z, x0, y0, z0, a, b, c) {
+    var num = [subtractScalar(multiplyScalar(subtractScalar(y0, y), c), multiplyScalar(subtractScalar(z0, z), b)), subtractScalar(multiplyScalar(subtractScalar(z0, z), a), multiplyScalar(subtractScalar(x0, x), c)), subtractScalar(multiplyScalar(subtractScalar(x0, x), b), multiplyScalar(subtractScalar(y0, y), a))];
+    num = sqrt(addScalar(addScalar(multiplyScalar(num[0], num[0]), multiplyScalar(num[1], num[1])), multiplyScalar(num[2], num[2])));
+    var den = sqrt(addScalar(addScalar(multiplyScalar(a, a), multiplyScalar(b, b)), multiplyScalar(c, c)));
+    return divideScalar(num, den);
+  }
+  function _euclideanDistance(x, y) {
+    var vectorSize = x.length;
+    var result = 0;
+    var diff = 0;
+    for (var i = 0; i < vectorSize; i++) {
+      diff = subtractScalar(x[i], y[i]);
+      result = addScalar(multiplyScalar(diff, diff), result);
+    }
+    return sqrt(result);
+  }
+  function _distancePairwise(a) {
+    var result = [];
+    var pointA = [];
+    var pointB = [];
+    for (var i = 0; i < a.length - 1; i++) {
+      for (var j = i + 1; j < a.length; j++) {
+        if (a[0].length === 2) {
+          pointA = [a[i][0], a[i][1]];
+          pointB = [a[j][0], a[j][1]];
+        } else if (a[0].length === 3) {
+          pointA = [a[i][0], a[i][1], a[i][2]];
+          pointB = [a[j][0], a[j][1], a[j][2]];
+        }
+        result.push(_euclideanDistance(pointA, pointB));
+      }
+    }
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/geometry/intersect.js b/node_modules/mathjs/lib/esm/function/geometry/intersect.js
new file mode 100644
index 0000000..6d6a772
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/geometry/intersect.js
@@ -0,0 +1,200 @@
+import { factory } from '../../utils/factory.js';
+var name = 'intersect';
+var dependencies = ['typed', 'config', 'abs', 'add', 'addScalar', 'matrix', 'multiply', 'multiplyScalar', 'divideScalar', 'subtract', 'smaller', 'equalScalar', 'flatten', 'isZero', 'isNumeric'];
+export var createIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    abs,
+    add,
+    addScalar,
+    matrix,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    subtract,
+    smaller,
+    equalScalar,
+    flatten,
+    isZero,
+    isNumeric
+  } = _ref;
+  /**
+   * Calculates the point of intersection of two lines in two or three dimensions
+   * and of a line and a plane in three dimensions. The inputs are in the form of
+   * arrays or 1 dimensional matrices. The line intersection functions return null
+   * if the lines do not meet.
+   *
+   * Note: Fill the plane coefficients as `x + y + z = c` and not as `x + y + z + c = 0`.
+   *
+   * Syntax:
+   *
+   *    math.intersect(endPoint1Line1, endPoint2Line1, endPoint1Line2, endPoint2Line2)
+   *    math.intersect(endPoint1, endPoint2, planeCoefficients)
+   *
+   * Examples:
+   *
+   *    math.intersect([0, 0], [10, 10], [10, 0], [0, 10])              // Returns [5, 5]
+   *    math.intersect([0, 0, 0], [10, 10, 0], [10, 0, 0], [0, 10, 0])  // Returns [5, 5, 0]
+   *    math.intersect([1, 0, 1],  [4, -2, 2], [1, 1, 1, 6])            // Returns [7, -4, 3]
+   *
+   * @param  {Array | Matrix} w   Co-ordinates of first end-point of first line
+   * @param  {Array | Matrix} x   Co-ordinates of second end-point of first line
+   * @param  {Array | Matrix} y   Co-ordinates of first end-point of second line
+   *                              OR Co-efficients of the plane's equation
+   * @param  {Array | Matrix} z   Co-ordinates of second end-point of second line
+   *                              OR undefined if the calculation is for line and plane
+   * @return {Array}              Returns the point of intersection of lines/lines-planes
+   */
+  return typed('intersect', {
+    'Array, Array, Array': _AAA,
+    'Array, Array, Array, Array': _AAAA,
+    'Matrix, Matrix, Matrix': function Matrix_Matrix_Matrix(x, y, plane) {
+      var arr = _AAA(x.valueOf(), y.valueOf(), plane.valueOf());
+      return arr === null ? null : matrix(arr);
+    },
+    'Matrix, Matrix, Matrix, Matrix': function Matrix_Matrix_Matrix_Matrix(w, x, y, z) {
+      // TODO: output matrix type should match input matrix type
+      var arr = _AAAA(w.valueOf(), x.valueOf(), y.valueOf(), z.valueOf());
+      return arr === null ? null : matrix(arr);
+    }
+  });
+  function _AAA(x, y, plane) {
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    plane = _coerceArr(plane);
+    if (!_3d(x)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+    }
+    if (!_3d(y)) {
+      throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+    }
+    if (!_4d(plane)) {
+      throw new TypeError('Array with 4 numbers expected as third argument');
+    }
+    return _intersectLinePlane(x[0], x[1], x[2], y[0], y[1], y[2], plane[0], plane[1], plane[2], plane[3]);
+  }
+  function _AAAA(w, x, y, z) {
+    w = _coerceArr(w);
+    x = _coerceArr(x);
+    y = _coerceArr(y);
+    z = _coerceArr(z);
+    if (w.length === 2) {
+      if (!_2d(w)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for first argument');
+      }
+      if (!_2d(x)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for second argument');
+      }
+      if (!_2d(y)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for third argument');
+      }
+      if (!_2d(z)) {
+        throw new TypeError('Array with 2 numbers or BigNumbers expected for fourth argument');
+      }
+      return _intersect2d(w, x, y, z);
+    } else if (w.length === 3) {
+      if (!_3d(w)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for first argument');
+      }
+      if (!_3d(x)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for second argument');
+      }
+      if (!_3d(y)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for third argument');
+      }
+      if (!_3d(z)) {
+        throw new TypeError('Array with 3 numbers or BigNumbers expected for fourth argument');
+      }
+      return _intersect3d(w[0], w[1], w[2], x[0], x[1], x[2], y[0], y[1], y[2], z[0], z[1], z[2]);
+    } else {
+      throw new TypeError('Arrays with two or thee dimensional points expected');
+    }
+  }
+
+  /** Coerce row and column 2-dim arrays to 1-dim array */
+  function _coerceArr(arr) {
+    // row matrix
+    if (arr.length === 1) return arr[0];
+
+    // column matrix
+    if (arr.length > 1 && Array.isArray(arr[0])) {
+      if (arr.every(el => Array.isArray(el) && el.length === 1)) return flatten(arr);
+    }
+    return arr;
+  }
+  function _2d(x) {
+    return x.length === 2 && isNumeric(x[0]) && isNumeric(x[1]);
+  }
+  function _3d(x) {
+    return x.length === 3 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]);
+  }
+  function _4d(x) {
+    return x.length === 4 && isNumeric(x[0]) && isNumeric(x[1]) && isNumeric(x[2]) && isNumeric(x[3]);
+  }
+  function _intersect2d(p1a, p1b, p2a, p2b) {
+    var o1 = p1a;
+    var o2 = p2a;
+    var d1 = subtract(o1, p1b);
+    var d2 = subtract(o2, p2b);
+    var det = subtract(multiplyScalar(d1[0], d2[1]), multiplyScalar(d2[0], d1[1]));
+    if (isZero(det)) return null;
+    if (smaller(abs(det), config.relTol)) {
+      return null;
+    }
+    var d20o11 = multiplyScalar(d2[0], o1[1]);
+    var d21o10 = multiplyScalar(d2[1], o1[0]);
+    var d20o21 = multiplyScalar(d2[0], o2[1]);
+    var d21o20 = multiplyScalar(d2[1], o2[0]);
+    var t = divideScalar(addScalar(subtract(subtract(d20o11, d21o10), d20o21), d21o20), det);
+    return add(multiply(d1, t), o1);
+  }
+  function _intersect3dHelper(a, b, c, d, e, f, g, h, i, j, k, l) {
+    // (a - b)*(c - d) + (e - f)*(g - h) + (i - j)*(k - l)
+    var add1 = multiplyScalar(subtract(a, b), subtract(c, d));
+    var add2 = multiplyScalar(subtract(e, f), subtract(g, h));
+    var add3 = multiplyScalar(subtract(i, j), subtract(k, l));
+    return addScalar(addScalar(add1, add2), add3);
+  }
+  function _intersect3d(x1, y1, z1, x2, y2, z2, x3, y3, z3, x4, y4, z4) {
+    var d1343 = _intersect3dHelper(x1, x3, x4, x3, y1, y3, y4, y3, z1, z3, z4, z3);
+    var d4321 = _intersect3dHelper(x4, x3, x2, x1, y4, y3, y2, y1, z4, z3, z2, z1);
+    var d1321 = _intersect3dHelper(x1, x3, x2, x1, y1, y3, y2, y1, z1, z3, z2, z1);
+    var d4343 = _intersect3dHelper(x4, x3, x4, x3, y4, y3, y4, y3, z4, z3, z4, z3);
+    var d2121 = _intersect3dHelper(x2, x1, x2, x1, y2, y1, y2, y1, z2, z1, z2, z1);
+    var numerator = subtract(multiplyScalar(d1343, d4321), multiplyScalar(d1321, d4343));
+    var denominator = subtract(multiplyScalar(d2121, d4343), multiplyScalar(d4321, d4321));
+    if (isZero(denominator)) return null;
+    var ta = divideScalar(numerator, denominator);
+    var tb = divideScalar(addScalar(d1343, multiplyScalar(ta, d4321)), d4343);
+    var pax = addScalar(x1, multiplyScalar(ta, subtract(x2, x1)));
+    var pay = addScalar(y1, multiplyScalar(ta, subtract(y2, y1)));
+    var paz = addScalar(z1, multiplyScalar(ta, subtract(z2, z1)));
+    var pbx = addScalar(x3, multiplyScalar(tb, subtract(x4, x3)));
+    var pby = addScalar(y3, multiplyScalar(tb, subtract(y4, y3)));
+    var pbz = addScalar(z3, multiplyScalar(tb, subtract(z4, z3)));
+    if (equalScalar(pax, pbx) && equalScalar(pay, pby) && equalScalar(paz, pbz)) {
+      return [pax, pay, paz];
+    } else {
+      return null;
+    }
+  }
+  function _intersectLinePlane(x1, y1, z1, x2, y2, z2, x, y, z, c) {
+    var x1x = multiplyScalar(x1, x);
+    var x2x = multiplyScalar(x2, x);
+    var y1y = multiplyScalar(y1, y);
+    var y2y = multiplyScalar(y2, y);
+    var z1z = multiplyScalar(z1, z);
+    var z2z = multiplyScalar(z2, z);
+    var numerator = subtract(subtract(subtract(c, x1x), y1y), z1z);
+    var denominator = subtract(subtract(subtract(addScalar(addScalar(x2x, y2y), z2z), x1x), y1y), z1z);
+    var t = divideScalar(numerator, denominator);
+    var px = addScalar(x1, multiplyScalar(t, subtract(x2, x1)));
+    var py = addScalar(y1, multiplyScalar(t, subtract(y2, y1)));
+    var pz = addScalar(z1, multiplyScalar(t, subtract(z2, z1)));
+    return [px, py, pz];
+    // TODO: Add cases when line is parallel to the plane:
+    //       (a) no intersection,
+    //       (b) line contained in plane
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/and.js b/node_modules/mathjs/lib/esm/function/logical/and.js
new file mode 100644
index 0000000..33c7f5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/and.js
@@ -0,0 +1,122 @@
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { createMatAlgo06xS0S0 } from '../../type/matrix/utils/matAlgo06xS0S0.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { andNumber } from '../../plain/number/index.js';
+var name = 'and';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'zeros', 'not', 'concat'];
+export var createAnd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    zeros,
+    not,
+    concat
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo06xS0S0 = createMatAlgo06xS0S0({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `and`. Test whether two values are both defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.and(x, y)
+   *
+   * Examples:
+   *
+   *    math.and(2, 4)   // returns true
+   *
+   *    a = [2, 0, 0]
+   *    b = [3, 7, 0]
+   *    c = 0
+   *
+   *    math.and(a, b)   // returns [true, false, false]
+   *    math.and(a, c)   // returns [false, false, false]
+   *
+   * See also:
+   *
+   *    not, or, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when both inputs are defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': andNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return (x.re !== 0 || x.im !== 0) && (y.re !== 0 || y.im !== 0);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return !x.isZero() && !y.isZero() && !x.isNaN() && !y.isNaN();
+    },
+    'bigint, bigint': andNumber,
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0)),
+    'SparseMatrix, any': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo11xS0s(x, y, self, false);
+    }),
+    'DenseMatrix, any': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(y)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo14xDs(x, y, self, false);
+    }),
+    'any, SparseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo11xS0s(y, x, self, true);
+    }),
+    'any, DenseMatrix': typed.referToSelf(self => (x, y) => {
+      // check scalar
+      if (not(x)) {
+        // return zero matrix
+        return zeros(x.size(), x.storage());
+      }
+      return matAlgo14xDs(y, x, self, true);
+    }),
+    'Array, any': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return self(matrix(x), y).valueOf();
+    }),
+    'any, Array': typed.referToSelf(self => (x, y) => {
+      // use matrix implementation
+      return self(x, matrix(y)).valueOf();
+    })
+  }, matrixAlgorithmSuite({
+    SS: matAlgo06xS0S0,
+    DS: matAlgo02xDS0
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/not.js b/node_modules/mathjs/lib/esm/function/logical/not.js
new file mode 100644
index 0000000..5e0ae17
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/not.js
@@ -0,0 +1,48 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { notNumber } from '../../plain/number/index.js';
+var name = 'not';
+var dependencies = ['typed'];
+export var createNot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Logical `not`. Flips boolean value of a given parameter.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.not(x)
+   *
+   * Examples:
+   *
+   *    math.not(2)      // returns false
+   *    math.not(0)      // returns true
+   *    math.not(true)   // returns false
+   *
+   *    a = [2, -7, 0]
+   *    math.not(a)      // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    and, or, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when input is a zero or empty value.
+   */
+  return typed(name, {
+    'null | undefined': () => true,
+    number: notNumber,
+    Complex: function Complex(x) {
+      return x.re === 0 && x.im === 0;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.isZero() || x.isNaN();
+    },
+    bigint: x => !x,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/nullish.js b/node_modules/mathjs/lib/esm/function/logical/nullish.js
new file mode 100644
index 0000000..01c780b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/nullish.js
@@ -0,0 +1,81 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo14xDs } from '../../type/matrix/utils/matAlgo14xDs.js';
+import { createMatAlgo13xDD } from '../../type/matrix/utils/matAlgo13xDD.js';
+import { DimensionError } from '../../error/DimensionError.js';
+var name = 'nullish';
+var dependencies = ['typed', 'matrix', 'size', 'flatten', 'deepEqual'];
+export var createNullish = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    size,
+    flatten,
+    deepEqual
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+  var matAlgo13xDD = createMatAlgo13xDD({
+    typed
+  });
+
+  /**
+   * Nullish coalescing operator (??). Returns the right-hand side operand
+   * when the left-hand side operand is null or undefined, and otherwise
+   * returns the left-hand side operand.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.nullish(x, y)
+   *
+   * Examples:
+   *
+   *    math.nullish(null, 42)        // returns 42
+   *    math.nullish(undefined, 42)   // returns 42
+   *    math.nullish(0, 42)           // returns 0
+   *    math.nullish(false, 42)       // returns false
+   *    math.nullish('', 42)          // returns ''
+   *
+   *    // Object property access with fallback
+   *    const obj = {foo: 7, bar: 3}
+   *    math.nullish(obj.baz, 0)      // returns 0
+   *
+   * See also:
+   *
+   *    and, or, not
+   *
+   * @param  {*} x First value to check
+   * @param  {*} y Fallback value
+   * @return {*} Returns y when x is null or undefined, otherwise returns x
+   */
+
+  return typed(name, {
+    // Scalar and SparseMatrix-first short-circuit handlers
+    'number|bigint|Complex|BigNumber|Fraction|Unit|string|boolean|SparseMatrix, any': (x, _y) => x,
+    'null, any': (_x, y) => y,
+    'undefined, any': (_x, y) => y,
+    // SparseMatrix-first with collection RHS: enforce exact shape match
+    'SparseMatrix, Array | Matrix': (x, y) => {
+      var sx = flatten(size(x).valueOf()); // work around #3529/#3530
+      var sy = flatten(size(y).valueOf());
+      if (deepEqual(sx, sy)) return x;
+      throw new DimensionError(sx, sy);
+    },
+    // DenseMatrix-first handlers (no broadcasting between collections)
+    'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, y, self)),
+    'DenseMatrix, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(x, y, self, false)),
+    'DenseMatrix, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(x, matrix(y), self)),
+    'DenseMatrix, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(x, y, self, false)),
+    // Array-first handlers (bridge via matrix() where needed)
+    'Array, Array': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), matrix(y), self).valueOf()),
+    'Array, DenseMatrix': typed.referToSelf(self => (x, y) => matAlgo13xDD(matrix(x), y, self)),
+    'Array, SparseMatrix': typed.referToSelf(self => (x, y) => matAlgo03xDSf(matrix(x), y, self, false)),
+    'Array, any': typed.referToSelf(self => (x, y) => matAlgo14xDs(matrix(x), y, self, false).valueOf())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/or.js b/node_modules/mathjs/lib/esm/function/logical/or.js
new file mode 100644
index 0000000..94fef72
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/or.js
@@ -0,0 +1,77 @@
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { orNumber } from '../../plain/number/index.js';
+var name = 'or';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat'];
+export var createOr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo05xSfSf = createMatAlgo05xSfSf({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `or`. Test if at least one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.or(x, y)
+   *
+   * Examples:
+   *
+   *    math.or(2, 4)   // returns true
+   *
+   *    a = [2, 5, 0]
+   *    b = [0, 22, 0]
+   *    c = 0
+   *
+   *    math.or(a, b)   // returns [true, true, false]
+   *    math.or(b, c)   // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    and, not, xor
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one of the inputs is defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': orNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return x.re !== 0 || x.im !== 0 || y.re !== 0 || y.im !== 0;
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return !x.isZero() && !x.isNaN() || !y.isZero() && !y.isNaN();
+    },
+    'bigint, bigint': orNumber,
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))
+  }, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/logical/xor.js b/node_modules/mathjs/lib/esm/function/logical/xor.js
new file mode 100644
index 0000000..8c46cc3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/logical/xor.js
@@ -0,0 +1,77 @@
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { xorNumber } from '../../plain/number/index.js';
+var name = 'xor';
+var dependencies = ['typed', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createXor = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Logical `xor`. Test whether one and only one value is defined with a nonzero/nonempty value.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.xor(x, y)
+   *
+   * Examples:
+   *
+   *    math.xor(2, 4)   // returns false
+   *
+   *    a = [2, 0, 0]
+   *    b = [2, 7, 0]
+   *    c = 0
+   *
+   *    math.xor(a, b)   // returns [false, true, false]
+   *    math.xor(a, c)   // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    and, not, or
+   *
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} x First value to check
+   * @param  {number | BigNumber | bigint | Complex | Unit | Array | Matrix} y Second value to check
+   * @return {boolean | Array | Matrix}
+   *            Returns true when one and only one input is defined with a nonzero/nonempty value.
+   */
+  return typed(name, {
+    'number, number': xorNumber,
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return (x.re !== 0 || x.im !== 0) !== (y.re !== 0 || y.im !== 0);
+    },
+    'bigint, bigint': xorNumber,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return (!x.isZero() && !x.isNaN()) !== (!y.isZero() && !y.isNaN());
+    },
+    'Unit, Unit': typed.referToSelf(self => (x, y) => self(x.value || 0, y.value || 0))
+  }, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/column.js b/node_modules/mathjs/lib/esm/function/matrix/column.js
new file mode 100644
index 0000000..d0b4a24
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/column.js
@@ -0,0 +1,59 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { validateIndex } from '../../utils/array.js';
+var name = 'column';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+export var createColumn = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  /**
+   * Return a column from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.column(value, index)
+   *
+   * Example:
+   *
+   *     // get a column
+   *     const d = [[1, 2], [3, 4]]
+   *     math.column(d, 1) // returns [[2], [4]]
+   *
+   * See also:
+   *
+   *     row
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} column           The index of the column
+   * @return {Array | Matrix}         The retrieved column
+   */
+  return typed(name, {
+    'Matrix, number': _column,
+    'Array, number': function Array_number(value, column) {
+      return _column(matrix(clone(value)), column).valueOf();
+    }
+  });
+
+  /**
+   * Retrieve a column of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} column  The index of the column
+   * @return {Matrix}        The retrieved column
+   */
+  function _column(value, column) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    validateIndex(column, value.size()[1]);
+    var rowRange = range(0, value.size()[0]);
+    var index = new Index(rowRange, column);
+    var result = value.subset(index);
+    return isMatrix(result) ? result : matrix([[result]]);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/concat.js b/node_modules/mathjs/lib/esm/function/matrix/concat.js
new file mode 100644
index 0000000..4c8d793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/concat.js
@@ -0,0 +1,104 @@
+import { isBigNumber, isMatrix, isNumber } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { arraySize, concat as _concat } from '../../utils/array.js';
+import { IndexError } from '../../error/IndexError.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+var name = 'concat';
+var dependencies = ['typed', 'matrix', 'isInteger'];
+export var createConcat = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isInteger
+  } = _ref;
+  /**
+   * Concatenate two or more matrices.
+   *
+   * Syntax:
+   *
+   *     math.concat(A, B, C, ...)
+   *     math.concat(A, B, C, ..., dim)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *   By default the last dimension of the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [5, 6]]
+   *    const B = [[3, 4], [7, 8]]
+   *
+   *    math.concat(A, B)                  // returns [[1, 2, 3, 4], [5, 6, 7, 8]]
+   *    math.concat(A, B, 0)               // returns [[1, 2], [5, 6], [3, 4], [7, 8]]
+   *    math.concat('hello', ' ', 'world') // returns 'hello world'
+   *
+   * See also:
+   *
+   *    size, squeeze, subset, transpose
+   *
+   * @param {... Array | Matrix} args     Two or more matrices
+   * @return {Array | Matrix} Concatenated matrix
+   */
+  return typed(name, {
+    // TODO: change signature to '...Array | Matrix, dim?' when supported
+    '...Array | Matrix | number | BigNumber': function Array__Matrix__number__BigNumber(args) {
+      var i;
+      var len = args.length;
+      var dim = -1; // zero-based dimension
+      var prevDim;
+      var asMatrix = false;
+      var matrices = []; // contains multi dimensional arrays
+
+      for (i = 0; i < len; i++) {
+        var arg = args[i];
+
+        // test whether we need to return a Matrix (if not we return an Array)
+        if (isMatrix(arg)) {
+          asMatrix = true;
+        }
+        if (isNumber(arg) || isBigNumber(arg)) {
+          if (i !== len - 1) {
+            throw new Error('Dimension must be specified as last argument');
+          }
+
+          // last argument contains the dimension on which to concatenate
+          prevDim = dim;
+          dim = arg.valueOf(); // change BigNumber to number
+
+          if (!isInteger(dim)) {
+            throw new TypeError('Integer number expected for dimension');
+          }
+          if (dim < 0 || i > 0 && dim > prevDim) {
+            // TODO: would be more clear when throwing a DimensionError here
+            throw new IndexError(dim, prevDim + 1);
+          }
+        } else {
+          // this is a matrix or array
+          var m = clone(arg).valueOf();
+          var size = arraySize(m);
+          matrices[i] = m;
+          prevDim = dim;
+          dim = size.length - 1;
+
+          // verify whether each of the matrices has the same number of dimensions
+          if (i > 0 && dim !== prevDim) {
+            throw new DimensionError(prevDim + 1, dim + 1);
+          }
+        }
+      }
+      if (matrices.length === 0) {
+        throw new SyntaxError('At least one matrix expected');
+      }
+      var res = matrices.shift();
+      while (matrices.length) {
+        res = _concat(res, matrices.shift(), dim);
+      }
+      return asMatrix ? matrix(res) : res;
+    },
+    '...string': function string(args) {
+      return args.join('');
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/count.js b/node_modules/mathjs/lib/esm/function/matrix/count.js
new file mode 100644
index 0000000..c611970
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/count.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+var name = 'count';
+var dependencies = ['typed', 'size', 'prod'];
+export var createCount = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    prod
+  } = _ref;
+  /**
+   * Count the number of elements of a matrix, array or string.
+   *
+   * Syntax:
+   *
+   *     math.count(x)
+   *
+   * Examples:
+   *
+   *     math.count('hello world')        // returns 11
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.count(A)                    // returns 6
+   *     math.count(math.range(1,6))      // returns 5
+   *
+   * See also:
+   *
+   *     size
+   *
+   * @param {string | Array | Matrix} x  A matrix or string
+   * @return {number} An integer with the elements in `x`.
+   */
+  return typed(name, {
+    string: function string(x) {
+      return x.length;
+    },
+    'Matrix | Array': function Matrix__Array(x) {
+      return prod(size(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/cross.js b/node_modules/mathjs/lib/esm/function/matrix/cross.js
new file mode 100644
index 0000000..43647f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/cross.js
@@ -0,0 +1,81 @@
+import { arraySize, squeeze } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'cross';
+var dependencies = ['typed', 'matrix', 'subtract', 'multiply'];
+export var createCross = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    multiply
+  } = _ref;
+  /**
+   * Calculate the cross product for two vectors in three dimensional space.
+   * The cross product of `A = [a1, a2, a3]` and `B = [b1, b2, b3]` is defined
+   * as:
+   *
+   *    cross(A, B) = [
+   *      a2 * b3 - a3 * b2,
+   *      a3 * b1 - a1 * b3,
+   *      a1 * b2 - a2 * b1
+   *    ]
+   *
+   * If one of the input vectors has a dimension greater than 1, the output
+   * vector will be a 1x3 (2-dimensional) matrix.
+   *
+   * Syntax:
+   *
+   *    math.cross(x, y)
+   *
+   * Examples:
+   *
+   *    math.cross([1, 1, 0],   [0, 1, 1])       // Returns [1, -1, 1]
+   *    math.cross([3, -3, 1],  [4, 9, 2])       // Returns [-15, -2, 39]
+   *    math.cross([2, 3, 4],   [5, 6, 7])       // Returns [-3, 6, -3]
+   *    math.cross([[1, 2, 3]], [[4], [5], [6]]) // Returns [[-3, 6, -3]]
+   *
+   * See also:
+   *
+   *    dot, multiply
+   *
+   * @param  {Array | Matrix} x   First vector
+   * @param  {Array | Matrix} y   Second vector
+   * @return {Array | Matrix}     Returns the cross product of `x` and `y`
+   */
+  return typed(name, {
+    'Matrix, Matrix': function Matrix_Matrix(x, y) {
+      return matrix(_cross(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function Matrix_Array(x, y) {
+      return matrix(_cross(x.toArray(), y));
+    },
+    'Array, Matrix': function Array_Matrix(x, y) {
+      return matrix(_cross(x, y.toArray()));
+    },
+    'Array, Array': _cross
+  });
+
+  /**
+   * Calculate the cross product for two arrays
+   * @param {Array} x  First vector
+   * @param {Array} y  Second vector
+   * @returns {Array} Returns the cross product of x and y
+   * @private
+   */
+  function _cross(x, y) {
+    var highestDimension = Math.max(arraySize(x).length, arraySize(y).length);
+    x = squeeze(x);
+    y = squeeze(y);
+    var xSize = arraySize(x);
+    var ySize = arraySize(y);
+    if (xSize.length !== 1 || ySize.length !== 1 || xSize[0] !== 3 || ySize[0] !== 3) {
+      throw new RangeError('Vectors with length 3 expected ' + '(Size A = [' + xSize.join(', ') + '], B = [' + ySize.join(', ') + '])');
+    }
+    var product = [subtract(multiply(x[1], y[2]), multiply(x[2], y[1])), subtract(multiply(x[2], y[0]), multiply(x[0], y[2])), subtract(multiply(x[0], y[1]), multiply(x[1], y[0]))];
+    if (highestDimension > 1) {
+      return [product];
+    } else {
+      return product;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js b/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js
new file mode 100644
index 0000000..d4a3654
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/ctranspose.js
@@ -0,0 +1,37 @@
+import { factory } from '../../utils/factory.js';
+var name = 'ctranspose';
+var dependencies = ['typed', 'transpose', 'conj'];
+export var createCtranspose = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    transpose,
+    conj
+  } = _ref;
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is
+   * taken. This is equivalent to complex conjugation for scalars and
+   * vectors.
+   *
+   * Syntax:
+   *
+   *     math.ctranspose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, math.complex(6,7)]]
+   *     math.ctranspose(A)      // returns [[1, 4], [2, 5], [3, {re:6,im:-7}]]
+   *
+   * See also:
+   *
+   *     transpose, diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be ctransposed
+   * @return {Array | Matrix}   The ctransposed matrix
+   */
+  return typed(name, {
+    any: function any(x) {
+      return conj(transpose(x));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/det.js b/node_modules/mathjs/lib/esm/function/matrix/det.js
new file mode 100644
index 0000000..a90df04
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/det.js
@@ -0,0 +1,142 @@
+import { isMatrix } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'det';
+var dependencies = ['typed', 'matrix', 'subtractScalar', 'multiply', 'divideScalar', 'isZero', 'unaryMinus'];
+export var createDet = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtractScalar,
+    multiply,
+    divideScalar,
+    isZero,
+    unaryMinus
+  } = _ref;
+  /**
+   * Calculate the determinant of a matrix.
+   *
+   * Syntax:
+   *
+   *    math.det(x)
+   *
+   * Examples:
+   *
+   *    math.det([[1, 2], [3, 4]]) // returns -2
+   *
+   *    const A = [
+   *      [-2, 2, 3],
+   *      [-1, 1, 3],
+   *      [2, 0, -1]
+   *    ]
+   *    math.det(A) // returns 6
+   *
+   * See also:
+   *
+   *    inv
+   *
+   * @param {Array | Matrix} x  A matrix
+   * @return {number} The determinant of `x`
+   */
+  return typed(name, {
+    any: function any(x) {
+      return clone(x);
+    },
+    'Array | Matrix': function det(x) {
+      var size;
+      if (isMatrix(x)) {
+        size = x.size();
+      } else if (Array.isArray(x)) {
+        x = matrix(x);
+        size = x.size();
+      } else {
+        // a scalar
+        size = [];
+      }
+      switch (size.length) {
+        case 0:
+          // scalar
+          return clone(x);
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            return clone(x.valueOf()[0]);
+          }
+          if (size[0] === 0) {
+            return 1; // det of an empty matrix is per definition 1
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+        case 2:
+          {
+            // two-dimensional array
+            var rows = size[0];
+            var cols = size[1];
+            if (rows === cols) {
+              return _det(x.clone().valueOf(), rows, cols);
+            }
+            if (cols === 0) {
+              return 1; // det of an empty matrix is per definition 1
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    }
+  });
+
+  /**
+   * Calculate the determinant of a matrix
+   * @param {Array[]} matrix  A square, two dimensional matrix
+   * @param {number} rows     Number of rows of the matrix (zero-based)
+   * @param {number} cols     Number of columns of the matrix (zero-based)
+   * @returns {number} det
+   * @private
+   */
+  function _det(matrix, rows, cols) {
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      return clone(matrix[0][0]);
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      // the determinant of [a11,a12;a21,a22] is det = a11*a22-a21*a12
+      return subtractScalar(multiply(matrix[0][0], matrix[1][1]), multiply(matrix[1][0], matrix[0][1]));
+    } else {
+      // Bareiss algorithm
+      // this algorithm have same complexity as LUP decomposition (O(n^3))
+      // but it preserve precision of floating point more relative to the LUP decomposition
+      var negated = false;
+      var rowIndices = new Array(rows).fill(0).map((_, i) => i); // matrix index of row i
+      for (var k = 0; k < rows; k++) {
+        var k_ = rowIndices[k];
+        if (isZero(matrix[k_][k])) {
+          var _k = void 0;
+          for (_k = k + 1; _k < rows; _k++) {
+            if (!isZero(matrix[rowIndices[_k]][k])) {
+              k_ = rowIndices[_k];
+              rowIndices[_k] = rowIndices[k];
+              rowIndices[k] = k_;
+              negated = !negated;
+              break;
+            }
+          }
+          if (_k === rows) return matrix[k_][k]; // some zero of the type
+        }
+        var piv = matrix[k_][k];
+        var piv_ = k === 0 ? 1 : matrix[rowIndices[k - 1]][k - 1];
+        for (var i = k + 1; i < rows; i++) {
+          var i_ = rowIndices[i];
+          for (var j = k + 1; j < rows; j++) {
+            matrix[i_][j] = divideScalar(subtractScalar(multiply(matrix[i_][j], piv), multiply(matrix[i_][k], matrix[k_][j])), piv_);
+          }
+        }
+      }
+      var det = matrix[rowIndices[rows - 1]][rows - 1];
+      return negated ? unaryMinus(det) : det;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/diag.js b/node_modules/mathjs/lib/esm/function/matrix/diag.js
new file mode 100644
index 0000000..af27a95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/diag.js
@@ -0,0 +1,155 @@
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'diag';
+var dependencies = ['typed', 'matrix', 'DenseMatrix', 'SparseMatrix'];
+export var createDiag = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix
+   *
+   * When `x` is a vector, a matrix with vector `x` on the diagonal will be returned.
+   * When `x` is a two dimensional matrix, the matrixes `k`th diagonal will be returned as vector.
+   * When k is positive, the values are placed on the super diagonal.
+   * When k is negative, the values are placed on the sub diagonal.
+   *
+   * Syntax:
+   *
+   *     math.diag(X)
+   *     math.diag(X, format)
+   *     math.diag(X, k)
+   *     math.diag(X, k, format)
+   *
+   * Examples:
+   *
+   *     // create a diagonal matrix
+   *     math.diag([1, 2, 3])      // returns [[1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *     math.diag([1, 2, 3], 1)   // returns [[0, 1, 0, 0], [0, 0, 2, 0], [0, 0, 0, 3]]
+   *     math.diag([1, 2, 3], -1)  // returns [[0, 0, 0], [1, 0, 0], [0, 2, 0], [0, 0, 3]]
+   *
+   *    // retrieve the diagonal from a matrix
+   *    const a = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
+   *    math.diag(a)   // returns [1, 5, 9]
+   *
+   * See also:
+   *
+   *     ones, zeros, identity
+   *
+   * @param {Matrix | Array} x          A two dimensional matrix or a vector
+   * @param {number | BigNumber} [k=0]  The diagonal where the vector will be filled
+   *                                    in or retrieved.
+   * @param {string} [format='dense']   The matrix storage format.
+   *
+   * @returns {Matrix | Array} Diagonal matrix from input vector, or diagonal from input matrix.
+   */
+  return typed(name, {
+    // FIXME: simplify this huge amount of signatures as soon as typed-function supports optional arguments
+
+    Array: function Array(x) {
+      return _diag(x, 0, arraySize(x), null);
+    },
+    'Array, number': function Array_number(x, k) {
+      return _diag(x, k, arraySize(x), null);
+    },
+    'Array, BigNumber': function Array_BigNumber(x, k) {
+      return _diag(x, k.toNumber(), arraySize(x), null);
+    },
+    'Array, string': function Array_string(x, format) {
+      return _diag(x, 0, arraySize(x), format);
+    },
+    'Array, number, string': function Array_number_string(x, k, format) {
+      return _diag(x, k, arraySize(x), format);
+    },
+    'Array, BigNumber, string': function Array_BigNumber_string(x, k, format) {
+      return _diag(x, k.toNumber(), arraySize(x), format);
+    },
+    Matrix: function Matrix(x) {
+      return _diag(x, 0, x.size(), x.storage());
+    },
+    'Matrix, number': function Matrix_number(x, k) {
+      return _diag(x, k, x.size(), x.storage());
+    },
+    'Matrix, BigNumber': function Matrix_BigNumber(x, k) {
+      return _diag(x, k.toNumber(), x.size(), x.storage());
+    },
+    'Matrix, string': function Matrix_string(x, format) {
+      return _diag(x, 0, x.size(), format);
+    },
+    'Matrix, number, string': function Matrix_number_string(x, k, format) {
+      return _diag(x, k, x.size(), format);
+    },
+    'Matrix, BigNumber, string': function Matrix_BigNumber_string(x, k, format) {
+      return _diag(x, k.toNumber(), x.size(), format);
+    }
+  });
+
+  /**
+   * Creeate diagonal matrix from a vector or vice versa
+   * @param {Array | Matrix} x
+   * @param {number} k
+   * @param {string} format Storage format for matrix. If null,
+   *                          an Array is returned
+   * @returns {Array | Matrix}
+   * @private
+   */
+  function _diag(x, k, size, format) {
+    if (!isInteger(k)) {
+      throw new TypeError('Second parameter in function diag must be an integer');
+    }
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0;
+
+    // check dimensions
+    switch (size.length) {
+      case 1:
+        return _createDiagonalMatrix(x, k, format, size[0], kSub, kSuper);
+      case 2:
+        return _getDiagonal(x, k, format, size, kSub, kSuper);
+    }
+    throw new RangeError('Matrix for function diag must be 2 dimensional');
+  }
+  function _createDiagonalMatrix(x, k, format, l, kSub, kSuper) {
+    // matrix size
+    var ms = [l + kSub, l + kSuper];
+    if (format && format !== 'sparse' && format !== 'dense') {
+      throw new TypeError("Unknown matrix type ".concat(format, "\""));
+    }
+
+    // create diagonal matrix
+    var m = format === 'sparse' ? SparseMatrix.diagonal(ms, x, k) : DenseMatrix.diagonal(ms, x, k);
+    // check we need to return a matrix
+    return format !== null ? m : m.valueOf();
+  }
+  function _getDiagonal(x, k, format, s, kSub, kSuper) {
+    // check x is a Matrix
+    if (isMatrix(x)) {
+      // get diagonal matrix
+      var dm = x.diagonal(k);
+      // check we need to return a matrix
+      if (format !== null) {
+        // check we need to change matrix format
+        if (format !== dm.storage()) {
+          return matrix(dm, format);
+        }
+        return dm;
+      }
+      return dm.valueOf();
+    }
+    // vector size
+    var n = Math.min(s[0] - kSub, s[1] - kSuper);
+    // diagonal values
+    var vector = [];
+    // loop diagonal
+    for (var i = 0; i < n; i++) {
+      vector[i] = x[i + kSub][i + kSuper];
+    }
+    // check we need to return a matrix
+    return format !== null ? matrix(vector) : vector;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/diff.js b/node_modules/mathjs/lib/esm/function/matrix/diff.js
new file mode 100644
index 0000000..ca211d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/diff.js
@@ -0,0 +1,163 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'diff';
+var dependencies = ['typed', 'matrix', 'subtract', 'number'];
+export var createDiff = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    subtract,
+    number
+  } = _ref;
+  /**
+   * Create a new matrix or array of the difference between elements of the given array
+   * The optional dim parameter lets you specify the dimension to evaluate the difference of
+   * If no dimension parameter is passed it is assumed as dimension 0
+   *
+   * Dimension is zero-based in javascript and one-based in the parser and can be a number or bignumber
+   * Arrays must be 'rectangular' meaning arrays like [1, 2]
+   * If something is passed as a matrix it will be returned as a matrix but other than that all matrices are converted to arrays
+   *
+   * Syntax:
+   *
+   *     math.diff(arr)
+   *     math.diff(arr, dim)
+   *
+   * Examples:
+   *
+   *     const arr = [1, 2, 4, 7, 0]
+   *     math.diff(arr) // returns [1, 2, 3, -7] (no dimension passed so 0 is assumed)
+   *     math.diff(math.matrix(arr)) // returns Matrix [1, 2, 3, -7]
+   *
+   *     const arr = [[1, 2, 3, 4, 5], [1, 2, 3, 4, 5], [9, 8, 7, 6, 4]]
+   *     math.diff(arr) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 0) // returns [[0, 0, 0, 0, 0], [8, 6, 4, 2, -1]]
+   *     math.diff(arr, 1) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *     math.diff(arr, math.bignumber(1)) // returns [[1, 1, 1, 1], [1, 1, 1, 1], [-1, -1, -1, -2]]
+   *
+   *     math.diff(arr, 2) // throws RangeError as arr is 2 dimensional not 3
+   *     math.diff(arr, -1) // throws RangeError as negative dimensions are not allowed
+   *
+   *     // These will all produce the same result
+   *     math.diff([[1, 2], [3, 4]])
+   *     math.diff([math.matrix([1, 2]), math.matrix([3, 4])])
+   *     math.diff([[1, 2], math.matrix([3, 4])])
+   *     math.diff([math.matrix([1, 2]), [3, 4]])
+   *     // They do not produce the same result as  math.diff(math.matrix([[1, 2], [3, 4]])) as this returns a matrix
+   *
+   * See Also:
+   *
+   *      sum
+   *      subtract
+   *      partitionSelect
+   *
+   * @param {Array | Matrix} arr      An array or matrix
+   * @param {number | BigNumber} dim  Dimension
+   * @return {Array | Matrix}         Difference between array elements in given dimension
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(arr) {
+      // No dimension specified => assume dimension 0
+      if (isMatrix(arr)) {
+        return matrix(_diff(arr.toArray()));
+      } else {
+        return _diff(arr);
+      }
+    },
+    'Array | Matrix, number': function Array__Matrix_number(arr, dim) {
+      if (!isInteger(dim)) throw new RangeError('Dimension must be a whole number');
+      if (isMatrix(arr)) {
+        return matrix(_recursive(arr.toArray(), dim));
+      } else {
+        return _recursive(arr, dim);
+      }
+    },
+    'Array, BigNumber': typed.referTo('Array,number', selfAn => (arr, dim) => selfAn(arr, number(dim))),
+    'Matrix, BigNumber': typed.referTo('Matrix,number', selfMn => (arr, dim) => selfMn(arr, number(dim)))
+  });
+
+  /**
+   * Recursively find the correct dimension in the array/matrix
+   * Then Apply _diff to that dimension
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     Dimension
+   * @return {Array}         resulting array
+   */
+  function _recursive(arr, dim) {
+    if (isMatrix(arr)) {
+      arr = arr.toArray(); // Makes sure arrays like [ matrix([0, 1]), matrix([1, 0]) ] are processed properly
+    }
+    if (!Array.isArray(arr)) {
+      throw RangeError('Array/Matrix does not have that many dimensions');
+    }
+    if (dim > 0) {
+      var result = [];
+      arr.forEach(element => {
+        result.push(_recursive(element, dim - 1));
+      });
+      return result;
+    } else if (dim === 0) {
+      return _diff(arr);
+    } else {
+      throw RangeError('Cannot have negative dimension');
+    }
+  }
+
+  /**
+   * Difference between elements in the array
+   *
+   * @param {Array} arr      An array
+   * @return {Array}         resulting array
+   */
+  function _diff(arr) {
+    var result = [];
+    var size = arr.length;
+    for (var i = 1; i < size; i++) {
+      result.push(_ElementDiff(arr[i - 1], arr[i]));
+    }
+    return result;
+  }
+
+  /**
+   * Difference between 2 objects
+   *
+   * @param {Object} obj1    First object
+   * @param {Object} obj2    Second object
+   * @return {Array}         resulting array
+   */
+  function _ElementDiff(obj1, obj2) {
+    // Convert matrices to arrays
+    if (isMatrix(obj1)) obj1 = obj1.toArray();
+    if (isMatrix(obj2)) obj2 = obj2.toArray();
+    var obj1IsArray = Array.isArray(obj1);
+    var obj2IsArray = Array.isArray(obj2);
+    if (obj1IsArray && obj2IsArray) {
+      return _ArrayDiff(obj1, obj2);
+    }
+    if (!obj1IsArray && !obj2IsArray) {
+      return subtract(obj2, obj1); // Difference is (second - first) NOT (first - second)
+    }
+    throw TypeError('Cannot calculate difference between 1 array and 1 non-array');
+  }
+
+  /**
+   * Difference of elements in 2 arrays
+   *
+   * @param {Array} arr1     Array 1
+   * @param {Array} arr2     Array 2
+   * @return {Array}         resulting array
+   */
+  function _ArrayDiff(arr1, arr2) {
+    if (arr1.length !== arr2.length) {
+      throw RangeError('Not all sub-arrays have the same length');
+    }
+    var result = [];
+    var size = arr1.length;
+    for (var i = 0; i < size; i++) {
+      result.push(_ElementDiff(arr1[i], arr2[i]));
+    }
+    return result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/dot.js b/node_modules/mathjs/lib/esm/function/matrix/dot.js
new file mode 100644
index 0000000..8bc4793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/dot.js
@@ -0,0 +1,156 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'dot';
+var dependencies = ['typed', 'addScalar', 'multiplyScalar', 'conj', 'size'];
+export var createDot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    addScalar,
+    multiplyScalar,
+    conj,
+    size
+  } = _ref;
+  /**
+   * Calculate the dot product of two vectors. The dot product of
+   * `A = [a1, a2, ..., an]` and `B = [b1, b2, ..., bn]` is defined as:
+   *
+   *    dot(A, B) = conj(a1) * b1 + conj(a2) * b2 + ... + conj(an) * bn
+   *
+   * Syntax:
+   *
+   *    math.dot(x, y)
+   *
+   * Examples:
+   *
+   *    math.dot([2, 4, 1], [2, 2, 3])       // returns number 15
+   *    math.multiply([2, 4, 1], [2, 2, 3])  // returns number 15
+   *
+   * See also:
+   *
+   *    multiply, cross
+   *
+   * @param  {Array | Matrix} x     First vector
+   * @param  {Array | Matrix} y     Second vector
+   * @return {number}               Returns the dot product of `x` and `y`
+   */
+  return typed(name, {
+    'Array | DenseMatrix, Array | DenseMatrix': _denseDot,
+    'SparseMatrix, SparseMatrix': _sparseDot
+  });
+  function _validateDim(x, y) {
+    var xSize = _size(x);
+    var ySize = _size(y);
+    var xLen, yLen;
+    if (xSize.length === 1) {
+      xLen = xSize[0];
+    } else if (xSize.length === 2 && xSize[1] === 1) {
+      xLen = xSize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + xSize.join(', ') + ')');
+    }
+    if (ySize.length === 1) {
+      yLen = ySize[0];
+    } else if (ySize.length === 2 && ySize[1] === 1) {
+      yLen = ySize[0];
+    } else {
+      throw new RangeError('Expected a column vector, instead got a matrix of size (' + ySize.join(', ') + ')');
+    }
+    if (xLen !== yLen) throw new RangeError('Vectors must have equal length (' + xLen + ' != ' + yLen + ')');
+    if (xLen === 0) throw new RangeError('Cannot calculate the dot product of empty vectors');
+    return xLen;
+  }
+  function _denseDot(a, b) {
+    var N = _validateDim(a, b);
+    var adata = isMatrix(a) ? a._data : a;
+    var adt = isMatrix(a) ? a._datatype || a.getDataType() : undefined;
+    var bdata = isMatrix(b) ? b._data : b;
+    var bdt = isMatrix(b) ? b._datatype || b.getDataType() : undefined;
+
+    // are these 2-dimensional column vectors? (as opposed to 1-dimensional vectors)
+    var aIsColumn = _size(a).length === 2;
+    var bIsColumn = _size(b).length === 2;
+    var add = addScalar;
+    var mul = multiplyScalar;
+
+    // process data types
+    if (adt && bdt && adt === bdt && typeof adt === 'string' && adt !== 'mixed') {
+      var dt = adt;
+      // find signatures that matches (dt, dt)
+      add = typed.find(addScalar, [dt, dt]);
+      mul = typed.find(multiplyScalar, [dt, dt]);
+    }
+
+    // both vectors 1-dimensional
+    if (!aIsColumn && !bIsColumn) {
+      var c = mul(conj(adata[0]), bdata[0]);
+      for (var i = 1; i < N; i++) {
+        c = add(c, mul(conj(adata[i]), bdata[i]));
+      }
+      return c;
+    }
+
+    // a is 1-dim, b is column
+    if (!aIsColumn && bIsColumn) {
+      var _c = mul(conj(adata[0]), bdata[0][0]);
+      for (var _i = 1; _i < N; _i++) {
+        _c = add(_c, mul(conj(adata[_i]), bdata[_i][0]));
+      }
+      return _c;
+    }
+
+    // a is column, b is 1-dim
+    if (aIsColumn && !bIsColumn) {
+      var _c2 = mul(conj(adata[0][0]), bdata[0]);
+      for (var _i2 = 1; _i2 < N; _i2++) {
+        _c2 = add(_c2, mul(conj(adata[_i2][0]), bdata[_i2]));
+      }
+      return _c2;
+    }
+
+    // both vectors are column
+    if (aIsColumn && bIsColumn) {
+      var _c3 = mul(conj(adata[0][0]), bdata[0][0]);
+      for (var _i3 = 1; _i3 < N; _i3++) {
+        _c3 = add(_c3, mul(conj(adata[_i3][0]), bdata[_i3][0]));
+      }
+      return _c3;
+    }
+  }
+  function _sparseDot(x, y) {
+    _validateDim(x, y);
+    var xindex = x._index;
+    var xvalues = x._values;
+    var yindex = y._index;
+    var yvalues = y._values;
+
+    // TODO optimize add & mul using datatype
+    var c = 0;
+    var add = addScalar;
+    var mul = multiplyScalar;
+    var i = 0;
+    var j = 0;
+    while (i < xindex.length && j < yindex.length) {
+      var I = xindex[i];
+      var J = yindex[j];
+      if (I < J) {
+        i++;
+        continue;
+      }
+      if (I > J) {
+        j++;
+        continue;
+      }
+      if (I === J) {
+        c = add(c, mul(xvalues[i], yvalues[j]));
+        i++;
+        j++;
+      }
+    }
+    return c;
+  }
+
+  // TODO remove this once #1771 is fixed
+  function _size(x) {
+    return isMatrix(x) ? x.size() : size(x);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs.js b/node_modules/mathjs/lib/esm/function/matrix/eigs.js
new file mode 100644
index 0000000..fdde565
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs.js
@@ -0,0 +1,328 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { factory } from '../../utils/factory.js';
+import { format } from '../../utils/string.js';
+import { createComplexEigs } from './eigs/complexEigs.js';
+import { createRealSymmetric } from './eigs/realSymmetric.js';
+import { typeOf, isNumber, isBigNumber, isComplex, isFraction } from '../../utils/is.js';
+var name = 'eigs';
+
+// The absolute state of math.js's dependency system:
+var dependencies = ['config', 'typed', 'matrix', 'addScalar', 'equal', 'subtract', 'abs', 'atan', 'cos', 'sin', 'multiplyScalar', 'divideScalar', 'inv', 'bignumber', 'multiply', 'add', 'larger', 'column', 'flatten', 'number', 'complex', 'sqrt', 'diag', 'size', 'reshape', 'qr', 'usolve', 'usolveAll', 'im', 're', 'smaller', 'matrixFromColumns', 'dot'];
+export var createEigs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    typed,
+    matrix,
+    addScalar,
+    subtract,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    divideScalar,
+    inv,
+    bignumber,
+    multiply,
+    add,
+    larger,
+    column,
+    flatten,
+    number,
+    complex,
+    sqrt,
+    diag,
+    size,
+    reshape,
+    qr,
+    usolve,
+    usolveAll,
+    im,
+    re,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+  var doRealSymmetric = createRealSymmetric({
+    config,
+    addScalar,
+    subtract,
+    column,
+    flatten,
+    equal,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    complex,
+    multiply,
+    add
+  });
+  var doComplexEigs = createComplexEigs({
+    config,
+    addScalar,
+    subtract,
+    multiply,
+    multiplyScalar,
+    flatten,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    size,
+    reshape,
+    qr,
+    inv,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  });
+
+  /**
+   * Compute eigenvalues and optionally eigenvectors of a square matrix.
+   * The eigenvalues are sorted by their absolute value, ascending, and
+   * returned as a vector in the `values` property of the returned project.
+   * An eigenvalue with algebraic multiplicity k will be listed k times, so
+   * that the returned `values` vector always has length equal to the size
+   * of the input matrix.
+   *
+   * The `eigenvectors` property of the return value provides the eigenvectors.
+   * It is an array of plain objects: the `value` property of each gives the
+   * associated eigenvalue, and the `vector` property gives the eigenvector
+   * itself. Note that the same `value` property will occur as many times in
+   * the list provided by `eigenvectors` as the geometric multiplicity of
+   * that value.
+   *
+   * If the algorithm fails to converge, it will throw an error –
+   * in that case, however, you may still find useful information
+   * in `err.values` and `err.vectors`.
+   *
+   * Note that the 'precision' option does not directly specify the _accuracy_
+   * of the returned eigenvalues. Rather, it determines how small an entry
+   * of the iterative approximations to an upper triangular matrix must be
+   * in order to be considered zero. The actual accuracy of the returned
+   * eigenvalues may be greater or less than the precision, depending on the
+   * conditioning of the matrix and how far apart or close the actual
+   * eigenvalues are. Note that currently, relatively simple, "traditional"
+   * methods of eigenvalue computation are being used; this is not a modern,
+   * high-precision eigenvalue computation. That said, it should typically
+   * produce fairly reasonable results.
+   *
+   * Syntax:
+   *
+   *     math.eigs(x, [prec])
+   *     math.eigs(x, {options})
+   *
+   * Examples:
+   *
+   *     const { eigs, multiply, column, transpose, matrixFromColumns } = math
+   *     const H = [[5, 2.3], [2.3, 1]]
+   *     const ans = eigs(H) // returns {values: [E1,E2...sorted], eigenvectors: [{value: E1, vector: v2}, {value: e, vector: v2}, ...]
+   *     const E = ans.values
+   *     const V = ans.eigenvectors
+   *     multiply(H, V[0].vector)) // returns multiply(E[0], V[0].vector))
+   *     const U = matrixFromColumns(...V.map(obj => obj.vector))
+   *     const UTxHxU = multiply(transpose(U), H, U) // diagonalizes H if possible
+   *     E[0] == UTxHxU[0][0]  // returns true always
+   *
+   *     // Compute only approximate eigenvalues:
+   *     const {values} = eigs(H, {eigenvectors: false, precision: 1e-6})
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {Array | Matrix} x  Matrix to be diagonalized
+   *
+   * @param {number | BigNumber | OptsObject} [opts] Object with keys `precision`, defaulting to config.relTol, and `eigenvectors`, defaulting to true and specifying whether to compute eigenvectors. If just a number, specifies precision.
+   * @return {{values: Array|Matrix, eigenvectors?: Array<EVobj>}} Object containing an array of eigenvalues and an array of {value: number|BigNumber, vector: Array|Matrix} objects. The eigenvectors property is undefined if eigenvectors were not requested.
+   *
+   */
+  return typed('eigs', {
+    // The conversion to matrix in the first two implementations,
+    // just to convert back to an array right away in
+    // computeValuesAndVectors, is unfortunate, and should perhaps be
+    // streamlined. It is done because the Matrix object carries some
+    // type information about its entries, and so constructing the matrix
+    // is a roundabout way of doing type detection.
+    Array: function Array(x) {
+      return doEigs(matrix(x));
+    },
+    'Array, number|BigNumber': function Array_numberBigNumber(x, prec) {
+      return doEigs(matrix(x), {
+        precision: prec
+      });
+    },
+    'Array, Object'(x, opts) {
+      return doEigs(matrix(x), opts);
+    },
+    Matrix: function Matrix(mat) {
+      return doEigs(mat, {
+        matricize: true
+      });
+    },
+    'Matrix, number|BigNumber': function Matrix_numberBigNumber(mat, prec) {
+      return doEigs(mat, {
+        precision: prec,
+        matricize: true
+      });
+    },
+    'Matrix, Object': function Matrix_Object(mat, opts) {
+      var useOpts = {
+        matricize: true
+      };
+      _extends(useOpts, opts);
+      return doEigs(mat, useOpts);
+    }
+  });
+  function doEigs(mat) {
+    var _opts$precision;
+    var opts = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    var computeVectors = 'eigenvectors' in opts ? opts.eigenvectors : true;
+    var prec = (_opts$precision = opts.precision) !== null && _opts$precision !== void 0 ? _opts$precision : config.relTol;
+    var result = computeValuesAndVectors(mat, prec, computeVectors);
+    if (opts.matricize) {
+      result.values = matrix(result.values);
+      if (computeVectors) {
+        result.eigenvectors = result.eigenvectors.map(_ref2 => {
+          var {
+            value,
+            vector
+          } = _ref2;
+          return {
+            value,
+            vector: matrix(vector)
+          };
+        });
+      }
+    }
+    if (computeVectors) {
+      Object.defineProperty(result, 'vectors', {
+        enumerable: false,
+        // to make sure that the eigenvectors can still be
+        // converted to string.
+        get: () => {
+          throw new Error('eigs(M).vectors replaced with eigs(M).eigenvectors');
+        }
+      });
+    }
+    return result;
+  }
+  function computeValuesAndVectors(mat, prec, computeVectors) {
+    var arr = mat.toArray(); // NOTE: arr is guaranteed to be unaliased
+    // and so safe to modify in place
+    var asize = mat.size();
+    if (asize.length !== 2 || asize[0] !== asize[1]) {
+      throw new RangeError("Matrix must be square (size: ".concat(format(asize), ")"));
+    }
+    var N = asize[0];
+    if (isReal(arr, N, prec)) {
+      coerceReal(arr, N); // modifies arr by side effect
+
+      if (isSymmetric(arr, N, prec)) {
+        var _type = coerceTypes(mat, arr, N); // modifies arr by side effect
+        return doRealSymmetric(arr, N, prec, _type, computeVectors);
+      }
+    }
+    var type = coerceTypes(mat, arr, N); // modifies arr by side effect
+    return doComplexEigs(arr, N, prec, type, computeVectors);
+  }
+
+  /** @return {boolean} */
+  function isSymmetric(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = i; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(subtract(arr[i][j], arr[j][i]))), prec)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+
+  /** @return {boolean} */
+  function isReal(arr, N, prec) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        // TODO proper comparison of bignum and frac
+        if (larger(bignumber(abs(im(arr[i][j]))), prec)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+  function coerceReal(arr, N) {
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        arr[i][j] = re(arr[i][j]);
+      }
+    }
+  }
+
+  /** @return {'number' | 'BigNumber' | 'Complex'} */
+  function coerceTypes(mat, arr, N) {
+    /** @type {string} */
+    var type = mat.datatype();
+    if (type === 'number' || type === 'BigNumber' || type === 'Complex') {
+      return type;
+    }
+    var hasNumber = false;
+    var hasBig = false;
+    var hasComplex = false;
+    for (var i = 0; i < N; i++) {
+      for (var j = 0; j < N; j++) {
+        var el = arr[i][j];
+        if (isNumber(el) || isFraction(el)) {
+          hasNumber = true;
+        } else if (isBigNumber(el)) {
+          hasBig = true;
+        } else if (isComplex(el)) {
+          hasComplex = true;
+        } else {
+          throw TypeError('Unsupported type in Matrix: ' + typeOf(el));
+        }
+      }
+    }
+    if (hasBig && hasComplex) {
+      console.warn('Complex BigNumbers not supported, this operation will lose precission.');
+    }
+    if (hasComplex) {
+      for (var _i = 0; _i < N; _i++) {
+        for (var _j = 0; _j < N; _j++) {
+          arr[_i][_j] = complex(arr[_i][_j]);
+        }
+      }
+      return 'Complex';
+    }
+    if (hasBig) {
+      for (var _i2 = 0; _i2 < N; _i2++) {
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          arr[_i2][_j2] = bignumber(arr[_i2][_j2]);
+        }
+      }
+      return 'BigNumber';
+    }
+    if (hasNumber) {
+      for (var _i3 = 0; _i3 < N; _i3++) {
+        for (var _j3 = 0; _j3 < N; _j3++) {
+          arr[_i3][_j3] = number(arr[_i3][_j3]);
+        }
+      }
+      return 'number';
+    } else {
+      throw TypeError('Matrix contains unsupported types only.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js b/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js
new file mode 100644
index 0000000..2463c42
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs/complexEigs.js
@@ -0,0 +1,698 @@
+import { clone } from '../../../utils/object.js';
+export function createComplexEigs(_ref) {
+  var {
+    addScalar,
+    subtract,
+    flatten,
+    multiply,
+    multiplyScalar,
+    divideScalar,
+    sqrt,
+    abs,
+    bignumber,
+    diag,
+    size,
+    reshape,
+    inv,
+    qr,
+    usolve,
+    usolveAll,
+    equal,
+    complex,
+    larger,
+    smaller,
+    matrixFromColumns,
+    dot
+  } = _ref;
+  /**
+   * @param {number[][]} arr the matrix to find eigenvalues of
+   * @param {number} N size of the matrix
+   * @param {number|BigNumber} prec precision, anything lower will be considered zero
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors should we find eigenvectors?
+   *
+   * @returns {{ values: number[], vectors: number[][] }}
+   */
+  function complexEigs(arr, N, prec, type) {
+    var findVectors = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
+    // TODO check if any row/col are zero except the diagonal
+
+    // make sure corresponding rows and columns have similar magnitude
+    // important because of numerical stability
+    // MODIFIES arr by side effect!
+    var R = balance(arr, N, prec, type, findVectors);
+
+    // R is the row transformation matrix
+    // arr = A' = R A R^-1, A is the original matrix
+    // (if findVectors is false, R is undefined)
+    // (And so to return to original matrix: A = R^-1 arr R)
+
+    // TODO if magnitudes of elements vary over many orders,
+    // move greatest elements to the top left corner
+
+    // using similarity transformations, reduce the matrix
+    // to Hessenberg form (upper triangular plus one subdiagonal row)
+    // updates the transformation matrix R with new row operationsq
+    // MODIFIES arr by side effect!
+    reduceToHessenberg(arr, N, prec, type, findVectors, R);
+    // still true that original A = R^-1 arr R)
+
+    // find eigenvalues
+    var {
+      values,
+      C
+    } = iterateUntilTriangular(arr, N, prec, type, findVectors);
+
+    // values is the list of eigenvalues, C is the column
+    // transformation matrix that transforms arr, the hessenberg
+    // matrix, to upper triangular
+    // (So U = C^-1 arr C and the relationship between current arr
+    // and original A is unchanged.)
+
+    if (findVectors) {
+      var eigenvectors = findEigenvectors(arr, N, C, R, values, prec, type);
+      return {
+        values,
+        eigenvectors
+      };
+    }
+    return {
+      values
+    };
+  }
+
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]}
+   */
+  function balance(arr, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var realzero = big ? bignumber(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    var realone = big ? bignumber(1) : 1;
+
+    // base of the floating-point arithmetic
+    var radix = big ? bignumber(10) : 2;
+    var radixSq = multiplyScalar(radix, radix);
+
+    // the diagonal transformation matrix R
+    var Rdiag;
+    if (findVectors) {
+      Rdiag = Array(N).fill(one);
+    }
+
+    // this isn't the only time we loop thru the matrix...
+    var last = false;
+    while (!last) {
+      // ...haha I'm joking! unless...
+      last = true;
+      for (var i = 0; i < N; i++) {
+        // compute the taxicab norm of i-th column and row
+        // TODO optimize for complex numbers
+        var colNorm = realzero;
+        var rowNorm = realzero;
+        for (var j = 0; j < N; j++) {
+          if (i === j) continue;
+          colNorm = addScalar(colNorm, abs(arr[j][i]));
+          rowNorm = addScalar(rowNorm, abs(arr[i][j]));
+        }
+        if (!equal(colNorm, 0) && !equal(rowNorm, 0)) {
+          // find integer power closest to balancing the matrix
+          // (we want to scale only by integer powers of radix,
+          // so that we don't lose any precision due to round-off)
+
+          var f = realone;
+          var c = colNorm;
+          var rowDivRadix = divideScalar(rowNorm, radix);
+          var rowMulRadix = multiplyScalar(rowNorm, radix);
+          while (smaller(c, rowDivRadix)) {
+            c = multiplyScalar(c, radixSq);
+            f = multiplyScalar(f, radix);
+          }
+          while (larger(c, rowMulRadix)) {
+            c = divideScalar(c, radixSq);
+            f = divideScalar(f, radix);
+          }
+
+          // check whether balancing is needed
+          // condition = (c + rowNorm) / f < 0.95 * (colNorm + rowNorm)
+          var condition = smaller(divideScalar(addScalar(c, rowNorm), f), multiplyScalar(addScalar(colNorm, rowNorm), 0.95));
+
+          // apply balancing similarity transformation
+          if (condition) {
+            // we should loop once again to check whether
+            // another rebalancing is needed
+            last = false;
+            var g = divideScalar(1, f);
+            for (var _j = 0; _j < N; _j++) {
+              if (i === _j) {
+                continue;
+              }
+              arr[i][_j] = multiplyScalar(arr[i][_j], g);
+              arr[_j][i] = multiplyScalar(arr[_j][i], f);
+            }
+
+            // keep track of transformations
+            if (findVectors) {
+              Rdiag[i] = multiplyScalar(Rdiag[i], g);
+            }
+          }
+        }
+      }
+    }
+
+    // return the diagonal row transformation matrix
+    return findVectors ? diag(Rdiag) : null;
+  }
+
+  /**
+   * @param {number[][]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @param {boolean} findVectors
+   * @param {number[][]} R the row transformation matrix that will be modified
+   */
+  function reduceToHessenberg(arr, N, prec, type, findVectors, R) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    if (big) {
+      prec = bignumber(prec);
+    }
+    for (var i = 0; i < N - 2; i++) {
+      // Find the largest subdiag element in the i-th col
+
+      var maxIndex = 0;
+      var max = zero;
+      for (var j = i + 1; j < N; j++) {
+        var el = arr[j][i];
+        if (smaller(abs(max), abs(el))) {
+          max = el;
+          maxIndex = j;
+        }
+      }
+
+      // This col is pivoted, no need to do anything
+      if (smaller(abs(max), prec)) {
+        continue;
+      }
+      if (maxIndex !== i + 1) {
+        // Interchange maxIndex-th and (i+1)-th row
+        var tmp1 = arr[maxIndex];
+        arr[maxIndex] = arr[i + 1];
+        arr[i + 1] = tmp1;
+
+        // Interchange maxIndex-th and (i+1)-th column
+        for (var _j2 = 0; _j2 < N; _j2++) {
+          var tmp2 = arr[_j2][maxIndex];
+          arr[_j2][maxIndex] = arr[_j2][i + 1];
+          arr[_j2][i + 1] = tmp2;
+        }
+
+        // keep track of transformations
+        if (findVectors) {
+          var tmp3 = R[maxIndex];
+          R[maxIndex] = R[i + 1];
+          R[i + 1] = tmp3;
+        }
+      }
+
+      // Reduce following rows and columns
+      for (var _j3 = i + 2; _j3 < N; _j3++) {
+        var n = divideScalar(arr[_j3][i], max);
+        if (n === 0) {
+          continue;
+        }
+
+        // from j-th row subtract n-times (i+1)th row
+        for (var k = 0; k < N; k++) {
+          arr[_j3][k] = subtract(arr[_j3][k], multiplyScalar(n, arr[i + 1][k]));
+        }
+
+        // to (i+1)th column add n-times j-th column
+        for (var _k = 0; _k < N; _k++) {
+          arr[_k][i + 1] = addScalar(arr[_k][i + 1], multiplyScalar(n, arr[_k][_j3]));
+        }
+
+        // keep track of transformations
+        if (findVectors) {
+          for (var _k2 = 0; _k2 < N; _k2++) {
+            R[_j3][_k2] = subtract(R[_j3][_k2], multiplyScalar(n, R[i + 1][_k2]));
+          }
+        }
+      }
+    }
+    return R;
+  }
+
+  /**
+   * @returns {{values: values, C: Matrix}}
+   * @see Press, Wiliams: Numerical recipes in Fortran 77
+   * @see https://en.wikipedia.org/wiki/QR_algorithm
+   */
+  function iterateUntilTriangular(A, N, prec, type, findVectors) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    if (big) {
+      prec = bignumber(prec);
+    }
+
+    // The Francis Algorithm
+    // The core idea of this algorithm is that doing successive
+    // A' = QtAQ transformations will eventually converge to block-
+    // upper-triangular with diagonal blocks either 1x1 or 2x2.
+    // The Q here is the one from the QR decomposition, A = QR.
+    // Since the eigenvalues of a block-upper-triangular matrix are
+    // the eigenvalues of its diagonal blocks and we know how to find
+    // eigenvalues of a 2x2 matrix, we know the eigenvalues of A.
+
+    var arr = clone(A);
+
+    // the list of converged eigenvalues
+    var lambdas = [];
+
+    // size of arr, which will get smaller as eigenvalues converge
+    var n = N;
+
+    // the diagonal of the block-diagonal matrix that turns
+    // converged 2x2 matrices into upper triangular matrices
+    var Sdiag = [];
+
+    // N×N matrix describing the overall transformation done during the QR algorithm
+    var Qtotal = findVectors ? diag(Array(N).fill(one)) : undefined;
+
+    // nxn matrix describing the QR transformations done since last convergence
+    var Qpartial = findVectors ? diag(Array(n).fill(one)) : undefined;
+
+    // last eigenvalue converged before this many steps
+    var lastConvergenceBefore = 0;
+    while (lastConvergenceBefore <= 100) {
+      lastConvergenceBefore += 1;
+
+      // TODO if the convergence is slow, do something clever
+
+      // Perform the factorization
+
+      var k = arr[n - 1][n - 1]; // TODO this is apparently a somewhat
+      // old-fashioned choice; ideally set close to an eigenvalue, or
+      // perhaps better yet switch to the implicit QR version that is sometimes
+      // specifically called the "Francis algorithm" that is alluded to
+      // in the following TODO. (Or perhaps we switch to an independently
+      // optimized third-party package for the linear algebra operations...)
+
+      for (var i = 0; i < n; i++) {
+        arr[i][i] = subtract(arr[i][i], k);
+      }
+
+      // TODO do an implicit QR transformation
+      var {
+        Q,
+        R
+      } = qr(arr);
+      arr = multiply(R, Q);
+      for (var _i = 0; _i < n; _i++) {
+        arr[_i][_i] = addScalar(arr[_i][_i], k);
+      }
+
+      // keep track of transformations
+      if (findVectors) {
+        Qpartial = multiply(Qpartial, Q);
+      }
+
+      // The rightmost diagonal element converged to an eigenvalue
+      if (n === 1 || smaller(abs(arr[n - 1][n - 2]), prec)) {
+        lastConvergenceBefore = 0;
+        lambdas.push(arr[n - 1][n - 1]);
+
+        // keep track of transformations
+        if (findVectors) {
+          Sdiag.unshift([[1]]);
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+          if (n > 1) {
+            Qpartial = diag(Array(n - 1).fill(one));
+          }
+        }
+
+        // reduce the matrix size
+        n -= 1;
+        arr.pop();
+        for (var _i2 = 0; _i2 < n; _i2++) {
+          arr[_i2].pop();
+        }
+
+        // The rightmost diagonal 2x2 block converged
+      } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
+        lastConvergenceBefore = 0;
+        var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
+        lambdas.push(...ll);
+
+        // keep track of transformations
+        if (findVectors) {
+          Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
+          inflateMatrix(Qpartial, N);
+          Qtotal = multiply(Qtotal, Qpartial);
+          if (n > 2) {
+            Qpartial = diag(Array(n - 2).fill(one));
+          }
+        }
+
+        // reduce the matrix size
+        n -= 2;
+        arr.pop();
+        arr.pop();
+        for (var _i3 = 0; _i3 < n; _i3++) {
+          arr[_i3].pop();
+          arr[_i3].pop();
+        }
+      }
+      if (n === 0) {
+        break;
+      }
+    }
+
+    // standard sorting
+    lambdas.sort((a, b) => +subtract(abs(a), abs(b)));
+
+    // the algorithm didn't converge
+    if (lastConvergenceBefore > 100) {
+      var err = Error('The eigenvalues failed to converge. Only found these eigenvalues: ' + lambdas.join(', '));
+      err.values = lambdas;
+      err.vectors = [];
+      throw err;
+    }
+
+    // combine the overall QR transformation Qtotal with the subsequent
+    // transformation S that turns the diagonal 2x2 blocks to upper triangular
+    var C = findVectors ? multiply(Qtotal, blockDiag(Sdiag, N)) : undefined;
+    return {
+      values: lambdas,
+      C
+    };
+  }
+
+  /**
+   * @param {Matrix} A hessenberg-form matrix
+   * @param {number} N size of A
+   * @param {Matrix} C column transformation matrix that turns A into upper triangular
+   * @param {Matrix} R similarity that turns original matrix into A
+   * @param {number[]} values array of eigenvalues of A
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {number[][]} eigenvalues
+   */
+  function findEigenvectors(A, N, C, R, values, prec, type) {
+    var Cinv = inv(C);
+    var U = multiply(Cinv, A, C);
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    // turn values into a kind of "multiset"
+    // this way it is easier to find eigenvectors
+    var uniqueValues = [];
+    var multiplicities = [];
+    for (var lambda of values) {
+      var i = indexOf(uniqueValues, lambda, equal);
+      if (i === -1) {
+        uniqueValues.push(lambda);
+        multiplicities.push(1);
+      } else {
+        multiplicities[i] += 1;
+      }
+    }
+
+    // find eigenvectors by solving U − lambdaE = 0
+    // TODO replace with an iterative eigenvector algorithm
+    // (this one might fail for imprecise eigenvalues)
+
+    var vectors = [];
+    var len = uniqueValues.length;
+    var b = Array(N).fill(zero);
+    var E = diag(Array(N).fill(one));
+    var _loop = function _loop() {
+      var lambda = uniqueValues[_i4];
+      var S = subtract(U, multiply(lambda, E)); // the characteristic matrix
+
+      var solutions = usolveAll(S, b);
+      solutions.shift(); // ignore the null vector
+
+      // looks like we missed something, try inverse iteration
+      // But if that fails, just presume that the original matrix truly
+      // was defective.
+      while (solutions.length < multiplicities[_i4]) {
+        var approxVec = inverseIterate(S, N, solutions, prec, type);
+        if (approxVec === null) {
+          break;
+        } // no more vectors were found
+        solutions.push(approxVec);
+      }
+
+      // Transform back into original array coordinates
+      var correction = multiply(inv(R), C);
+      solutions = solutions.map(v => multiply(correction, v));
+      vectors.push(...solutions.map(v => ({
+        value: lambda,
+        vector: flatten(v)
+      })));
+    };
+    for (var _i4 = 0; _i4 < len; _i4++) {
+      _loop();
+    }
+    return vectors;
+  }
+
+  /**
+   * Compute the eigenvalues of an 2x2 matrix
+   * @return {[number,number]}
+   */
+  function eigenvalues2x2(a, b, c, d) {
+    // lambda_+- = 1/2 trA +- 1/2 sqrt( tr^2 A - 4 detA )
+    var trA = addScalar(a, d);
+    var detA = subtract(multiplyScalar(a, d), multiplyScalar(b, c));
+    var x = multiplyScalar(trA, 0.5);
+    var y = multiplyScalar(sqrt(subtract(multiplyScalar(trA, trA), multiplyScalar(4, detA))), 0.5);
+    return [addScalar(x, y), subtract(x, y)];
+  }
+
+  /**
+   * For an 2x2 matrix compute the transformation matrix S,
+   * so that SAS^-1 is an upper triangular matrix
+   * @return {[[number,number],[number,number]]}
+   * @see https://math.berkeley.edu/~ogus/old/Math_54-05/webfoils/jordan.pdf
+   * @see http://people.math.harvard.edu/~knill/teaching/math21b2004/exhibits/2dmatrices/index.html
+   */
+  function jordanBase2x2(a, b, c, d, l1, l2, prec, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var zero = big ? bignumber(0) : cplx ? complex(0) : 0;
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+
+    // matrix is already upper triangular
+    // return an identity matrix
+    if (smaller(abs(c), prec)) {
+      return [[one, zero], [zero, one]];
+    }
+
+    // matrix is diagonalizable
+    // return its eigenvectors as columns
+    if (larger(abs(subtract(l1, l2)), prec)) {
+      return [[subtract(l1, d), subtract(l2, d)], [c, c]];
+    }
+
+    // matrix is not diagonalizable
+    // compute diagonal elements of N = A - lambdaI
+    var na = subtract(a, l1);
+    var nd = subtract(d, l1);
+
+    // col(N,2) = 0  implies  S = ( col(N,1), e_1 )
+    // col(N,2) != 0 implies  S = ( col(N,2), e_2 )
+
+    if (smaller(abs(b), prec) && smaller(abs(nd), prec)) {
+      return [[na, one], [c, zero]];
+    } else {
+      return [[b, zero], [nd, one]];
+    }
+  }
+
+  /**
+   * Enlarge the matrix from nxn to NxN, setting the new
+   * elements to 1 on diagonal and 0 elsewhere
+   */
+  function inflateMatrix(arr, N) {
+    // add columns
+    for (var i = 0; i < arr.length; i++) {
+      arr[i].push(...Array(N - arr[i].length).fill(0));
+    }
+
+    // add rows
+    for (var _i5 = arr.length; _i5 < N; _i5++) {
+      arr.push(Array(N).fill(0));
+      arr[_i5][_i5] = 1;
+    }
+    return arr;
+  }
+
+  /**
+   * Create a block-diagonal matrix with the given square matrices on the diagonal
+   * @param {Matrix[] | number[][][]} arr array of matrices to be placed on the diagonal
+   * @param {number} N the size of the resulting matrix
+   */
+  function blockDiag(arr, N) {
+    var M = [];
+    for (var i = 0; i < N; i++) {
+      M[i] = Array(N).fill(0);
+    }
+    var I = 0;
+    for (var sub of arr) {
+      var n = sub.length;
+      for (var _i6 = 0; _i6 < n; _i6++) {
+        for (var j = 0; j < n; j++) {
+          M[I + _i6][I + j] = sub[_i6][j];
+        }
+      }
+      I += n;
+    }
+    return M;
+  }
+
+  /**
+   * Finds the index of an element in an array using a custom equality function
+   * @template T
+   * @param {Array<T>} arr array in which to search
+   * @param {T} el the element to find
+   * @param {function(T, T): boolean} fn the equality function, first argument is an element of `arr`, the second is always `el`
+   * @returns {number} the index of `el`, or -1 when it's not in `arr`
+   */
+  function indexOf(arr, el, fn) {
+    for (var i = 0; i < arr.length; i++) {
+      if (fn(arr[i], el)) {
+        return i;
+      }
+    }
+    return -1;
+  }
+
+  /**
+   * Provided a near-singular upper-triangular matrix A and a list of vectors,
+   * finds an eigenvector of A with the smallest eigenvalue, which is orthogonal
+   * to each vector in the list
+   * @template T
+   * @param {T[][]} A near-singular square matrix
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {number} prec epsilon
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @return {T[] | null} eigenvector
+   *
+   * @see Numerical Recipes for Fortran 77 – 11.7 Eigenvalues or Eigenvectors by Inverse Iteration
+   */
+  function inverseIterate(A, N, orthog, prec, type) {
+    var largeNum = type === 'BigNumber' ? bignumber(1000) : 1000;
+    var b; // the vector
+
+    // you better choose a random vector before I count to five
+    var i = 0;
+    for (; i < 5; ++i) {
+      b = randomOrthogonalVector(N, orthog, type);
+      try {
+        b = usolve(A, b);
+      } catch (_unused) {
+        // That direction didn't work, likely because the original matrix
+        // was defective. But still make the full number of tries...
+        continue;
+      }
+      if (larger(norm(b), largeNum)) {
+        break;
+      }
+    }
+    if (i >= 5) {
+      return null; // couldn't find any orthogonal vector in the image
+    }
+
+    // you better converge before I count to ten
+    i = 0;
+    while (true) {
+      var c = usolve(A, b);
+      if (smaller(norm(orthogonalComplement(b, [c])), prec)) {
+        break;
+      }
+      if (++i >= 10) {
+        return null;
+      }
+      b = normalize(c);
+    }
+    return b;
+  }
+
+  /**
+   * Generates a random unit vector of dimension N, orthogonal to each vector in the list
+   * @template T
+   * @param {number} N dimension
+   * @param {T[][]} orthog list of vectors
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} random vector
+   */
+  function randomOrthogonalVector(N, orthog, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+
+    // generate random vector with the correct type
+    var v = Array(N).fill(0).map(_ => 2 * Math.random() - 1);
+    if (big) {
+      v = v.map(n => bignumber(n));
+    }
+    if (cplx) {
+      v = v.map(n => complex(n));
+    }
+
+    // project to orthogonal complement
+    v = orthogonalComplement(v, orthog);
+
+    // normalize
+    return normalize(v, type);
+  }
+
+  /**
+   * Project vector v to the orthogonal complement of an array of vectors
+   */
+  function orthogonalComplement(v, orthog) {
+    var vectorShape = size(v);
+    for (var w of orthog) {
+      w = reshape(w, vectorShape); // make sure this is just a vector computation
+      // v := v − (w, v)/|w|^2 w
+      v = subtract(v, multiply(divideScalar(dot(w, v), dot(w, w)), w));
+    }
+    return v;
+  }
+
+  /**
+   * Calculate the norm of a vector.
+   * We can't use math.norm because factory can't handle circular dependency.
+   * Seriously, I'm really fed up with factory.
+   */
+  function norm(v) {
+    return abs(sqrt(dot(v, v)));
+  }
+
+  /**
+   * Normalize a vector
+   * @template T
+   * @param {T[]} v
+   * @param {'number'|'BigNumber'|'Complex'} type
+   * @returns {T[]} normalized vec
+   */
+  function normalize(v, type) {
+    var big = type === 'BigNumber';
+    var cplx = type === 'Complex';
+    var one = big ? bignumber(1) : cplx ? complex(1) : 1;
+    return multiply(divideScalar(one, norm(v)), v);
+  }
+  return complexEigs;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js b/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js
new file mode 100644
index 0000000..0b38087
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/eigs/realSymmetric.js
@@ -0,0 +1,297 @@
+import { clone } from '../../../utils/object.js';
+export function createRealSymmetric(_ref) {
+  var {
+    config,
+    addScalar,
+    subtract,
+    abs,
+    atan,
+    cos,
+    sin,
+    multiplyScalar,
+    inv,
+    bignumber,
+    multiply,
+    add
+  } = _ref;
+  /**
+   * @param {number[] | BigNumber[]} arr
+   * @param {number} N
+   * @param {number} prec
+   * @param {'number' | 'BigNumber'} type
+   */
+  function main(arr, N) {
+    var prec = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : config.relTol;
+    var type = arguments.length > 3 ? arguments[3] : undefined;
+    var computeVectors = arguments.length > 4 ? arguments[4] : undefined;
+    if (type === 'number') {
+      return diag(arr, prec, computeVectors);
+    }
+    if (type === 'BigNumber') {
+      return diagBig(arr, prec, computeVectors);
+    }
+    throw TypeError('Unsupported data type: ' + type);
+  }
+
+  // diagonalization implementation for number (efficient)
+  function diag(x, precision, computeVectors) {
+    var N = x.length;
+    var e0 = Math.abs(precision / N);
+    var psi;
+    var Sij;
+    if (computeVectors) {
+      Sij = new Array(N);
+      // Sij is Identity Matrix
+      for (var i = 0; i < N; i++) {
+        Sij[i] = Array(N).fill(0);
+        Sij[i][i] = 1.0;
+      }
+    }
+    // initial error
+    var Vab = getAij(x);
+    while (Math.abs(Vab[1]) >= Math.abs(e0)) {
+      var _i = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getTheta(x[_i][_i], x[j][j], x[_i][j]);
+      x = x1(x, psi, _i, j);
+      if (computeVectors) Sij = Sij1(Sij, psi, _i, j);
+      Vab = getAij(x);
+    }
+    var Ei = Array(N).fill(0); // eigenvalues
+    for (var _i2 = 0; _i2 < N; _i2++) {
+      Ei[_i2] = x[_i2][_i2];
+    }
+    return sorting(clone(Ei), Sij, computeVectors);
+  }
+
+  // diagonalization implementation for bigNumber
+  function diagBig(x, precision, computeVectors) {
+    var N = x.length;
+    var e0 = abs(precision / N);
+    var psi;
+    var Sij;
+    if (computeVectors) {
+      Sij = new Array(N);
+      // Sij is Identity Matrix
+      for (var i = 0; i < N; i++) {
+        Sij[i] = Array(N).fill(0);
+        Sij[i][i] = 1.0;
+      }
+    }
+    // initial error
+    var Vab = getAijBig(x);
+    while (abs(Vab[1]) >= abs(e0)) {
+      var _i3 = Vab[0][0];
+      var j = Vab[0][1];
+      psi = getThetaBig(x[_i3][_i3], x[j][j], x[_i3][j]);
+      x = x1Big(x, psi, _i3, j);
+      if (computeVectors) Sij = Sij1Big(Sij, psi, _i3, j);
+      Vab = getAijBig(x);
+    }
+    var Ei = Array(N).fill(0); // eigenvalues
+    for (var _i4 = 0; _i4 < N; _i4++) {
+      Ei[_i4] = x[_i4][_i4];
+    }
+    // return [clone(Ei), clone(Sij)]
+    return sorting(clone(Ei), Sij, computeVectors);
+  }
+
+  // get angle
+  function getTheta(aii, ajj, aij) {
+    var denom = ajj - aii;
+    if (Math.abs(denom) <= config.relTol) {
+      return Math.PI / 4.0;
+    } else {
+      return 0.5 * Math.atan(2.0 * aij / (ajj - aii));
+    }
+  }
+
+  // get angle
+  function getThetaBig(aii, ajj, aij) {
+    var denom = subtract(ajj, aii);
+    if (abs(denom) <= config.relTol) {
+      return bignumber(-1).acos().div(4);
+    } else {
+      return multiplyScalar(0.5, atan(multiply(2.0, aij, inv(denom))));
+    }
+  }
+
+  // update eigvec
+  function Sij1(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var Ski = Array(N).fill(0);
+    var Skj = Array(N).fill(0);
+    for (var k = 0; k < N; k++) {
+      Ski[k] = c * Sij[k][i] - s * Sij[k][j];
+      Skj[k] = s * Sij[k][i] + c * Sij[k][j];
+    }
+    for (var _k = 0; _k < N; _k++) {
+      Sij[_k][i] = Ski[_k];
+      Sij[_k][j] = Skj[_k];
+    }
+    return Sij;
+  }
+  // update eigvec for overlap
+  function Sij1Big(Sij, theta, i, j) {
+    var N = Sij.length;
+    var c = cos(theta);
+    var s = sin(theta);
+    var Ski = Array(N).fill(bignumber(0));
+    var Skj = Array(N).fill(bignumber(0));
+    for (var k = 0; k < N; k++) {
+      Ski[k] = subtract(multiplyScalar(c, Sij[k][i]), multiplyScalar(s, Sij[k][j]));
+      Skj[k] = addScalar(multiplyScalar(s, Sij[k][i]), multiplyScalar(c, Sij[k][j]));
+    }
+    for (var _k2 = 0; _k2 < N; _k2++) {
+      Sij[_k2][i] = Ski[_k2];
+      Sij[_k2][j] = Skj[_k2];
+    }
+    return Sij;
+  }
+
+  // update matrix
+  function x1Big(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = bignumber(cos(theta));
+    var s = bignumber(sin(theta));
+    var c2 = multiplyScalar(c, c);
+    var s2 = multiplyScalar(s, s);
+    var Aki = Array(N).fill(bignumber(0));
+    var Akj = Array(N).fill(bignumber(0));
+    // 2cs Hij
+    var csHij = multiply(bignumber(2), c, s, Hij[i][j]);
+    //  Aii
+    var Aii = addScalar(subtract(multiplyScalar(c2, Hij[i][i]), csHij), multiplyScalar(s2, Hij[j][j]));
+    var Ajj = add(multiplyScalar(s2, Hij[i][i]), csHij, multiplyScalar(c2, Hij[j][j]));
+    // 0  to i
+    for (var k = 0; k < N; k++) {
+      Aki[k] = subtract(multiplyScalar(c, Hij[i][k]), multiplyScalar(s, Hij[j][k]));
+      Akj[k] = addScalar(multiplyScalar(s, Hij[i][k]), multiplyScalar(c, Hij[j][k]));
+    }
+    // Modify Hij
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = bignumber(0);
+    Hij[j][i] = bignumber(0);
+    // 0  to i
+    for (var _k3 = 0; _k3 < N; _k3++) {
+      if (_k3 !== i && _k3 !== j) {
+        Hij[i][_k3] = Aki[_k3];
+        Hij[_k3][i] = Aki[_k3];
+        Hij[j][_k3] = Akj[_k3];
+        Hij[_k3][j] = Akj[_k3];
+      }
+    }
+    return Hij;
+  }
+
+  // update matrix
+  function x1(Hij, theta, i, j) {
+    var N = Hij.length;
+    var c = Math.cos(theta);
+    var s = Math.sin(theta);
+    var c2 = c * c;
+    var s2 = s * s;
+    var Aki = Array(N).fill(0);
+    var Akj = Array(N).fill(0);
+    //  Aii
+    var Aii = c2 * Hij[i][i] - 2 * c * s * Hij[i][j] + s2 * Hij[j][j];
+    var Ajj = s2 * Hij[i][i] + 2 * c * s * Hij[i][j] + c2 * Hij[j][j];
+    // 0  to i
+    for (var k = 0; k < N; k++) {
+      Aki[k] = c * Hij[i][k] - s * Hij[j][k];
+      Akj[k] = s * Hij[i][k] + c * Hij[j][k];
+    }
+    // Modify Hij
+    Hij[i][i] = Aii;
+    Hij[j][j] = Ajj;
+    Hij[i][j] = 0;
+    Hij[j][i] = 0;
+    // 0  to i
+    for (var _k4 = 0; _k4 < N; _k4++) {
+      if (_k4 !== i && _k4 !== j) {
+        Hij[i][_k4] = Aki[_k4];
+        Hij[_k4][i] = Aki[_k4];
+        Hij[j][_k4] = Akj[_k4];
+        Hij[_k4][j] = Akj[_k4];
+      }
+    }
+    return Hij;
+  }
+
+  // get max off-diagonal value from Upper Diagonal
+  function getAij(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (Math.abs(maxMij) < Math.abs(Mij[i][j])) {
+          maxMij = Math.abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+    return [maxIJ, maxMij];
+  }
+
+  // get max off-diagonal value from Upper Diagonal
+  function getAijBig(Mij) {
+    var N = Mij.length;
+    var maxMij = 0;
+    var maxIJ = [0, 1];
+    for (var i = 0; i < N; i++) {
+      for (var j = i + 1; j < N; j++) {
+        if (abs(maxMij) < abs(Mij[i][j])) {
+          maxMij = abs(Mij[i][j]);
+          maxIJ = [i, j];
+        }
+      }
+    }
+    return [maxIJ, maxMij];
+  }
+
+  // sort results
+  function sorting(E, S, computeVectors) {
+    var N = E.length;
+    var values = Array(N);
+    var vecs;
+    if (computeVectors) {
+      vecs = Array(N);
+      for (var k = 0; k < N; k++) {
+        vecs[k] = Array(N);
+      }
+    }
+    for (var i = 0; i < N; i++) {
+      var minID = 0;
+      var minE = E[0];
+      for (var j = 0; j < E.length; j++) {
+        if (abs(E[j]) < abs(minE)) {
+          minID = j;
+          minE = E[minID];
+        }
+      }
+      values[i] = E.splice(minID, 1)[0];
+      if (computeVectors) {
+        for (var _k5 = 0; _k5 < N; _k5++) {
+          vecs[i][_k5] = S[_k5][minID];
+          S[_k5].splice(minID, 1);
+        }
+      }
+    }
+    if (!computeVectors) return {
+      values
+    };
+    var eigenvectors = vecs.map((vector, i) => ({
+      value: values[i],
+      vector
+    }));
+    return {
+      values,
+      eigenvectors
+    };
+  }
+  return main;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/expm.js b/node_modules/mathjs/lib/esm/function/matrix/expm.js
new file mode 100644
index 0000000..23a2ce9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/expm.js
@@ -0,0 +1,154 @@
+import { isSparseMatrix } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'expm';
+var dependencies = ['typed', 'abs', 'add', 'identity', 'inv', 'multiply'];
+export var createExpm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    identity,
+    inv,
+    multiply
+  } = _ref;
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be square.
+   * Not to be confused with exp(a), which performs element-wise
+   * exponentiation.
+   *
+   * The exponential is calculated using the Padé approximant with scaling and
+   * squaring; see "Nineteen Dubious Ways to Compute the Exponential of a
+   * Matrix," by Moler and Van Loan.
+   *
+   * Syntax:
+   *
+   *     math.expm(x)
+   *
+   * Examples:
+   *
+   *     const A = [[0,2],[0,0]]
+   *     math.expm(A)        // returns [[1,2],[0,1]]
+   *
+   * See also:
+   *
+   *     exp
+   *
+   * @param {Matrix} x  A square Matrix
+   * @return {Matrix}   The exponential of x
+   */
+  return typed(name, {
+    Matrix: function Matrix(A) {
+      // Check matrix size
+      var size = A.size();
+      if (size.length !== 2 || size[0] !== size[1]) {
+        throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+      }
+      var n = size[0];
+
+      // Desired accuracy of the approximant (The actual accuracy
+      // will be affected by round-off error)
+      var eps = 1e-15;
+
+      // The Padé approximant is not so accurate when the values of A
+      // are "large", so scale A by powers of two. Then compute the
+      // exponential, and square the result repeatedly according to
+      // the identity e^A = (e^(A/m))^m
+
+      // Compute infinity-norm of A, ||A||, to see how "big" it is
+      var infNorm = infinityNorm(A);
+
+      // Find the optimal scaling factor and number of terms in the
+      // Padé approximant to reach the desired accuracy
+      var params = findParams(infNorm, eps);
+      var q = params.q;
+      var j = params.j;
+
+      // The Pade approximation to e^A is:
+      // Rqq(A) = Dqq(A) ^ -1 * Nqq(A)
+      // where
+      // Nqq(A) = sum(i=0, q, (2q-i)!p! / [ (2q)!i!(q-i)! ] A^i
+      // Dqq(A) = sum(i=0, q, (2q-i)!q! / [ (2q)!i!(q-i)! ] (-A)^i
+
+      // Scale A by 1 / 2^j
+      var Apos = multiply(A, Math.pow(2, -j));
+
+      // The i=0 term is just the identity matrix
+      var N = identity(n);
+      var D = identity(n);
+
+      // Initialization (i=0)
+      var factor = 1;
+
+      // Initialization (i=1)
+      var AposToI = Apos; // Cloning not necessary
+      var alternate = -1;
+      for (var i = 1; i <= q; i++) {
+        if (i > 1) {
+          AposToI = multiply(AposToI, Apos);
+          alternate = -alternate;
+        }
+        factor = factor * (q - i + 1) / ((2 * q - i + 1) * i);
+        N = add(N, multiply(factor, AposToI));
+        D = add(D, multiply(factor * alternate, AposToI));
+      }
+      var R = multiply(inv(D), N);
+
+      // Square j times
+      for (var _i = 0; _i < j; _i++) {
+        R = multiply(R, R);
+      }
+      return isSparseMatrix(A) ? A.createSparseMatrix(R) : R;
+    }
+  });
+  function infinityNorm(A) {
+    var n = A.size()[0];
+    var infNorm = 0;
+    for (var i = 0; i < n; i++) {
+      var rowSum = 0;
+      for (var j = 0; j < n; j++) {
+        rowSum += abs(A.get([i, j]));
+      }
+      infNorm = Math.max(rowSum, infNorm);
+    }
+    return infNorm;
+  }
+
+  /**
+   * Find the best parameters for the Pade approximant given
+   * the matrix norm and desired accuracy. Returns the first acceptable
+   * combination in order of increasing computational load.
+   */
+  function findParams(infNorm, eps) {
+    var maxSearchSize = 30;
+    for (var k = 0; k < maxSearchSize; k++) {
+      for (var q = 0; q <= k; q++) {
+        var j = k - q;
+        if (errorEstimate(infNorm, q, j) < eps) {
+          return {
+            q,
+            j
+          };
+        }
+      }
+    }
+    throw new Error('Could not find acceptable parameters to compute the matrix exponential (try increasing maxSearchSize in expm.js)');
+  }
+
+  /**
+   * Returns the estimated error of the Pade approximant for the given
+   * parameters.
+   */
+  function errorEstimate(infNorm, q, j) {
+    var qfac = 1;
+    for (var i = 2; i <= q; i++) {
+      qfac *= i;
+    }
+    var twoqfac = qfac;
+    for (var _i2 = q + 1; _i2 <= 2 * q; _i2++) {
+      twoqfac *= _i2;
+    }
+    var twoqp1fac = twoqfac * (2 * q + 1);
+    return 8.0 * Math.pow(infNorm / Math.pow(2, j), 2 * q) * qfac * qfac / (twoqfac * twoqp1fac);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/fft.js b/node_modules/mathjs/lib/esm/function/matrix/fft.js
new file mode 100644
index 0000000..3036178
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/fft.js
@@ -0,0 +1,128 @@
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'fft';
+var dependencies = ['typed', 'matrix', 'addScalar', 'multiplyScalar', 'divideScalar', 'exp', 'tau', 'i', 'dotDivide', 'conj', 'pow', 'ceil', 'log2'];
+export var createFft = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    multiplyScalar,
+    divideScalar,
+    exp,
+    tau,
+    i: I,
+    dotDivide,
+    conj,
+    pow,
+    ceil,
+    log2
+  } = _ref;
+  /**
+   * Calculate N-dimensional Fourier transform
+   *
+   * Syntax:
+   *
+   *     math.fft(arr)
+   *
+   * Examples:
+   *
+   *    math.fft([[1, 0], [1, 0]]) // returns [[{re:2, im:0}, {re:2, im:0}], [{re:0, im:0}, {re:0, im:0}]]
+   *
+   *
+   * See Also:
+   *
+   *      ifft
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  return typed(name, {
+    Array: _ndFft,
+    Matrix: function Matrix(matrix) {
+      return matrix.create(_ndFft(matrix.valueOf()), matrix.datatype());
+    }
+  });
+
+  /**
+   * Perform an N-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _ndFft(arr) {
+    var size = arraySize(arr);
+    if (size.length === 1) return _fft(arr, size[0]);
+    // ndFft along dimension 1,...,N-1 then 1dFft along dimension 0
+    return _1dFft(arr.map(slice => _ndFft(slice, size.slice(1))), 0);
+  }
+
+  /**
+   * Perform an 1-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @param {number} dim     dimension of the array to perform on
+   * @return {Array}         resulting array
+   */
+  function _1dFft(arr, dim) {
+    var size = arraySize(arr);
+    if (dim !== 0) return new Array(size[0]).fill(0).map((_, i) => _1dFft(arr[i], dim - 1));
+    if (size.length === 1) return _fft(arr);
+    function _transpose(arr) {
+      // Swap first 2 dimensions
+      var size = arraySize(arr);
+      return new Array(size[1]).fill(0).map((_, j) => new Array(size[0]).fill(0).map((_, i) => arr[i][j]));
+    }
+    return _transpose(_1dFft(_transpose(arr), 1));
+  }
+  /**
+   * Perform an 1-dimensional non-power-of-2 Fourier transform using Chirp-Z Transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _czt(arr) {
+    var n = arr.length;
+    var w = exp(divideScalar(multiplyScalar(-1, multiplyScalar(I, tau)), n));
+    var chirp = [];
+    for (var i = 1 - n; i < n; i++) {
+      chirp.push(pow(w, divideScalar(pow(i, 2), 2)));
+    }
+    var N2 = pow(2, ceil(log2(n + n - 1)));
+    var xp = [...new Array(n).fill(0).map((_, i) => multiplyScalar(arr[i], chirp[n - 1 + i])), ...new Array(N2 - n).fill(0)];
+    var ichirp = [...new Array(n + n - 1).fill(0).map((_, i) => divideScalar(1, chirp[i])), ...new Array(N2 - (n + n - 1)).fill(0)];
+    var fftXp = _fft(xp);
+    var fftIchirp = _fft(ichirp);
+    var fftProduct = new Array(N2).fill(0).map((_, i) => multiplyScalar(fftXp[i], fftIchirp[i]));
+    var ifftProduct = dotDivide(conj(_ndFft(conj(fftProduct))), N2);
+    var ret = [];
+    for (var _i = n - 1; _i < n + n - 1; _i++) {
+      ret.push(multiplyScalar(ifftProduct[_i], chirp[_i]));
+    }
+    return ret;
+  }
+  /**
+   * Perform an 1-dimensional Fourier transform
+   *
+   * @param {Array} arr      The array
+   * @return {Array}         resulting array
+   */
+  function _fft(arr) {
+    var len = arr.length;
+    if (len === 1) return [arr[0]];
+    if (len % 2 === 0) {
+      var ret = [..._fft(arr.filter((_, i) => i % 2 === 0), len / 2), ..._fft(arr.filter((_, i) => i % 2 === 1), len / 2)];
+      for (var k = 0; k < len / 2; k++) {
+        var p = ret[k];
+        var q = multiplyScalar(ret[k + len / 2], exp(multiplyScalar(multiplyScalar(tau, I), divideScalar(-k, len))));
+        ret[k] = addScalar(p, q);
+        ret[k + len / 2] = addScalar(p, multiplyScalar(-1, q));
+      }
+      return ret;
+    } else {
+      // use chirp-z transform for non-power-of-2 FFT
+      return _czt(arr);
+    }
+    // throw new Error('Can only calculate FFT of power-of-two size')
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/filter.js b/node_modules/mathjs/lib/esm/function/matrix/filter.js
new file mode 100644
index 0000000..50850f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/filter.js
@@ -0,0 +1,74 @@
+import { optimizeCallback } from '../../utils/optimizeCallback.js';
+import { filter, filterRegExp } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'filter';
+var dependencies = ['typed'];
+export var createFilter = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   *
+   * The callback is invoked with three arguments: the current value,
+   * the current index, and the matrix operated upon.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.filter(x, test)
+   *
+   * Examples:
+   *
+   *    function isPositive (x) {
+   *      return x > 0
+   *    }
+   *    math.filter([6, -2, -1, 4, 3], isPositive) // returns [6, 4, 3]
+   *
+   *    math.filter(["23", "foo", "100", "55", "bar"], /[0-9]+/) // returns ["23", "100", "55"]
+   *
+   * See also:
+   *
+   *    forEach, map, sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to filter
+   * @param {Function | RegExp} test
+   *        A function or regular expression to test items.
+   *        All entries for which `test` returns true are returned.
+   *        When `test` is a function, it is invoked with three parameters:
+   *        the value of the element, the index of the element, and the
+   *        matrix/array being traversed. The function must return a boolean.
+   * @return {Matrix | Array} Returns the filtered matrix.
+   */
+  return typed('filter', {
+    'Array, function': _filterCallback,
+    'Matrix, function': function Matrix_function(x, test) {
+      return x.create(_filterCallback(x.valueOf(), test), x.datatype());
+    },
+    'Array, RegExp': filterRegExp,
+    'Matrix, RegExp': function Matrix_RegExp(x, test) {
+      return x.create(filterRegExp(x.valueOf(), test), x.datatype());
+    }
+  });
+});
+
+/**
+ * Filter values in a callback given a callback function
+ * @param {Array} x
+ * @param {Function} callback
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+function _filterCallback(x, callback) {
+  var fastCallback = optimizeCallback(callback, x, 'filter');
+  if (fastCallback.isUnary) {
+    return filter(x, fastCallback.fn);
+  }
+  return filter(x, function (value, index, array) {
+    // invoke the callback function with the right number of arguments
+    return fastCallback.fn(value, [index], array);
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/flatten.js b/node_modules/mathjs/lib/esm/function/matrix/flatten.js
new file mode 100644
index 0000000..5e2574f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/flatten.js
@@ -0,0 +1,38 @@
+import { flatten as flattenArray } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'flatten';
+var dependencies = ['typed'];
+export var createFlatten = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Flatten a multidimensional matrix into a single dimensional matrix.
+   * A new matrix is returned, the original matrix is left untouched.
+   *
+   * Syntax:
+   *
+   *    math.flatten(x)
+   *
+   * Examples:
+   *
+   *    math.flatten([[1,2], [3,4]])   // returns [1, 2, 3, 4]
+   *
+   * See also:
+   *
+   *    concat, resize, size, squeeze
+   *
+   * @param {Matrix | Array} x   Matrix to be flattened
+   * @return {Matrix | Array} Returns the flattened matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return flattenArray(x);
+    },
+    Matrix: function Matrix(x) {
+      // Return the same matrix type as x (Dense or Sparse Matrix)
+      // Return the same data type as x
+      return x.create(flattenArray(x.valueOf(), true), x.datatype());
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/forEach.js b/node_modules/mathjs/lib/esm/function/matrix/forEach.js
new file mode 100644
index 0000000..881a590
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/forEach.js
@@ -0,0 +1,57 @@
+import { optimizeCallback } from '../../utils/optimizeCallback.js';
+import { factory } from '../../utils/factory.js';
+import { deepForEach } from '../../utils/array.js';
+var name = 'forEach';
+var dependencies = ['typed'];
+export var createForEach = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given callback function.
+   *
+   * The callback is invoked with three arguments: the current value,
+   * the current index, and the matrix operated upon.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.forEach(x, callback)
+   *
+   * Examples:
+   *
+   *    math.forEach([1, 2, 3], function(value) {
+   *      console.log(value)
+   *    })
+   *    // outputs 1, 2, 3
+   *
+   * See also:
+   *
+   *    filter, map, sort
+   *
+   * @param {Matrix | Array} x    The matrix to iterate on.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix/array being traversed.
+   */
+  return typed(name, {
+    'Array, function': _forEach,
+    'Matrix, function': function Matrix_function(x, callback) {
+      x.forEach(callback);
+    }
+  });
+});
+
+/**
+ * forEach for a multidimensional array
+ * @param {Array} array
+ * @param {Function} callback
+ * @private
+ */
+function _forEach(array, callback) {
+  var fastCallback = optimizeCallback(callback, array, name);
+  deepForEach(array, fastCallback.fn, fastCallback.isUnary);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js b/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js
new file mode 100644
index 0000000..5bc7862
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/getMatrixDataType.js
@@ -0,0 +1,52 @@
+import { factory } from '../../utils/factory.js';
+import { getArrayDataType } from '../../utils/array.js';
+import { typeOf } from '../../utils/is.js';
+var name = 'getMatrixDataType';
+var dependencies = ['typed'];
+export var createGetMatrixDataType = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Find the data type of all elements in a matrix or array,
+   * for example 'number' if all items are a number and 'Complex' if all values
+   * are complex numbers.
+   * If a matrix contains more than one data type, it will return 'mixed'.
+   *
+   * Syntax:
+   *
+   *    math.getMatrixDataType(x)
+   *
+   * Examples:
+   *
+   *    const x = [ [1, 2, 3], [4, 5, 6] ]
+   *    const mixedX = [ [1, true], [2, 3] ]
+   *    const fractionX = [ [math.fraction(1, 3)], [math.fraction(1, 3)] ]
+   *    const unitX = [ [math.unit('5cm')], [math.unit('5cm')] ]
+   *    const bigNumberX = [ [math.bignumber(1)], [math.bignumber(0)] ]
+   *    const sparse = math.sparse(x)
+   *    const dense = math.matrix(x)
+   *    math.getMatrixDataType(x)   // returns 'number'
+   *    math.getMatrixDataType(sparse)   // returns 'number'
+   *    math.getMatrixDataType(dense)   // returns 'number'
+   *    math.getMatrixDataType(mixedX) // returns 'mixed'
+   *    math.getMatrixDataType(fractionX) // returns 'Fraction'
+   *    math.getMatrixDataType(unitX) // returns 'Unit'
+   *    math.getMatrixDataType(bigNumberX) // return 'BigNumber'
+   *
+   * See also:
+   *  SparseMatrix, DenseMatrix
+   *
+   * @param {...Matrix | Array} x   The Matrix with values.
+   *
+   * @return {string} A string representation of the matrix type
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return getArrayDataType(x, typeOf);
+    },
+    Matrix: function Matrix(x) {
+      return x.getDataType();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/identity.js b/node_modules/mathjs/lib/esm/function/matrix/identity.js
new file mode 100644
index 0000000..8211793
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/identity.js
@@ -0,0 +1,136 @@
+import { isBigNumber } from '../../utils/is.js';
+import { resize } from '../../utils/array.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'identity';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix'];
+export var createIdentity = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n.
+   * The matrix has ones on the diagonal and zeros elsewhere.
+   *
+   * Syntax:
+   *
+   *    math.identity(n)
+   *    math.identity(n, format)
+   *    math.identity(m, n)
+   *    math.identity(m, n, format)
+   *    math.identity([m, n])
+   *    math.identity([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.identity(3)                    // returns [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+   *    math.identity(3, 2)                 // returns [[1, 0], [0, 1], [0, 0]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.identity(math.size(A))         // returns [[1, 0, 0], [0, 1, 0]]
+   *
+   * See also:
+   *
+   *    diag, ones, zeros, size, range
+   *
+   * @param {...number | Matrix | Array} size   The size for the matrix
+   * @param {string} [format]                   The Matrix storage format
+   *
+   * @return {Matrix | Array | number} A matrix with ones on the diagonal.
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber': function number__BigNumber(rows) {
+      return _identity(rows, rows, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, string': function number__BigNumber_string(rows, format) {
+      return _identity(rows, rows, format);
+    },
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(rows, cols) {
+      return _identity(rows, cols, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber, number | BigNumber, string': function number__BigNumber_number__BigNumber_string(rows, cols, format) {
+      return _identity(rows, cols, format);
+    },
+    Array: function Array(size) {
+      return _identityVector(size);
+    },
+    'Array, string': function Array_string(size, format) {
+      return _identityVector(size, format);
+    },
+    Matrix: function Matrix(size) {
+      return _identityVector(size.valueOf(), size.storage());
+    },
+    'Matrix, string': function Matrix_string(size, format) {
+      return _identityVector(size.valueOf(), format);
+    }
+  });
+  function _identityVector(size, format) {
+    switch (size.length) {
+      case 0:
+        return format ? matrix(format) : [];
+      case 1:
+        return _identity(size[0], size[0], format);
+      case 2:
+        return _identity(size[0], size[1], format);
+      default:
+        throw new Error('Vector containing two values expected');
+    }
+  }
+
+  /**
+   * Create an identity matrix
+   * @param {number | BigNumber} rows
+   * @param {number | BigNumber} cols
+   * @param {string} [format]
+   * @returns {Matrix}
+   * @private
+   */
+  function _identity(rows, cols, format) {
+    // BigNumber constructor with the right precision
+    var Big = isBigNumber(rows) || isBigNumber(cols) ? BigNumber : null;
+    if (isBigNumber(rows)) rows = rows.toNumber();
+    if (isBigNumber(cols)) cols = cols.toNumber();
+    if (!isInteger(rows) || rows < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+    if (!isInteger(cols) || cols < 1) {
+      throw new Error('Parameters in function identity must be positive integers');
+    }
+    var one = Big ? new BigNumber(1) : 1;
+    var defaultValue = Big ? new Big(0) : 0;
+    var size = [rows, cols];
+
+    // check we need to return a matrix
+    if (format) {
+      // create diagonal matrix (use optimized implementation for storage format)
+      if (format === 'sparse') {
+        return SparseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+      if (format === 'dense') {
+        return DenseMatrix.diagonal(size, one, 0, defaultValue);
+      }
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    }
+
+    // create and resize array
+    var res = resize([], size, defaultValue);
+    // fill in ones on the diagonal
+    var minimum = rows < cols ? rows : cols;
+    // fill diagonal
+    for (var d = 0; d < minimum; d++) {
+      res[d][d] = one;
+    }
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/ifft.js b/node_modules/mathjs/lib/esm/function/matrix/ifft.js
new file mode 100644
index 0000000..b5c8101
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/ifft.js
@@ -0,0 +1,37 @@
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'ifft';
+var dependencies = ['typed', 'fft', 'dotDivide', 'conj'];
+export var createIfft = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    fft,
+    dotDivide,
+    conj
+  } = _ref;
+  /**
+   * Calculate N-dimensional inverse Fourier transform
+   *
+   * Syntax:
+   *
+   *     math.ifft(arr)
+   *
+   * Examples:
+   *
+   *    math.ifft([[2, 2], [0, 0]]) // returns [[{re:1, im:0}, {re:0, im:0}], [{re:1, im:0}, {re:0, im:0}]]
+   *
+   * See Also:
+   *
+   *      fft
+   *
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(arr) {
+      var size = isMatrix(arr) ? arr.size() : arraySize(arr);
+      return dotDivide(conj(fft(conj(arr))), size.reduce((acc, curr) => acc * curr, 1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/inv.js b/node_modules/mathjs/lib/esm/function/matrix/inv.js
new file mode 100644
index 0000000..9aab431
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/inv.js
@@ -0,0 +1,184 @@
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { format } from '../../utils/string.js';
+var name = 'inv';
+var dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
+export var createInv = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divideScalar,
+    addScalar,
+    multiply,
+    unaryMinus,
+    det,
+    identity,
+    abs
+  } = _ref;
+  /**
+   * Calculate the inverse of a square matrix.
+   *
+   * Syntax:
+   *
+   *     math.inv(x)
+   *
+   * Examples:
+   *
+   *     math.inv([[1, 2], [3, 4]])  // returns [[-2, 1], [1.5, -0.5]]
+   *     math.inv(4)                 // returns 0.25
+   *     1 / 4                       // returns 0.25
+   *
+   * See also:
+   *
+   *     det, transpose
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(x) {
+      var size = isMatrix(x) ? x.size() : arraySize(x);
+      switch (size.length) {
+        case 1:
+          // vector
+          if (size[0] === 1) {
+            if (isMatrix(x)) {
+              return matrix([divideScalar(1, x.valueOf()[0])]);
+            } else {
+              return [divideScalar(1, x[0])];
+            }
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+        case 2:
+          // two dimensional array
+          {
+            var rows = size[0];
+            var cols = size[1];
+            if (rows === cols) {
+              if (isMatrix(x)) {
+                return matrix(_inv(x.valueOf(), rows, cols), x.storage());
+              } else {
+                // return an Array
+                return _inv(x, rows, cols);
+              }
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    },
+    any: function any(x) {
+      // scalar
+      return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
+    }
+  });
+
+  /**
+   * Calculate the inverse of a square matrix
+   * @param {Array[]} mat     A square matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns, must equal rows
+   * @return {Array[]} inv    Inverse matrix
+   * @private
+   */
+  function _inv(mat, rows, cols) {
+    var r, s, f, value, temp;
+    if (rows === 1) {
+      // this is a 1 x 1 matrix
+      value = mat[0][0];
+      if (value === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+      return [[divideScalar(1, value)]];
+    } else if (rows === 2) {
+      // this is a 2 x 2 matrix
+      var d = det(mat);
+      if (d === 0) {
+        throw Error('Cannot calculate inverse, determinant is zero');
+      }
+      return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
+    } else {
+      // this is a matrix of 3 x 3 or larger
+      // calculate inverse using gauss-jordan elimination
+      //      https://en.wikipedia.org/wiki/Gaussian_elimination
+      //      http://mathworld.wolfram.com/MatrixInverse.html
+      //      http://math.uww.edu/~mcfarlat/inverse.htm
+
+      // make a copy of the matrix (only the arrays, not of the elements)
+      var A = mat.concat();
+      for (r = 0; r < rows; r++) {
+        A[r] = A[r].concat();
+      }
+
+      // create an identity matrix which in the end will contain the
+      // matrix inverse
+      var B = identity(rows).valueOf();
+
+      // loop over all columns, and perform row reductions
+      for (var c = 0; c < cols; c++) {
+        // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
+        var ABig = abs(A[c][c]);
+        var rBig = c;
+        r = c + 1;
+        while (r < rows) {
+          if (abs(A[r][c]) > ABig) {
+            ABig = abs(A[r][c]);
+            rBig = r;
+          }
+          r++;
+        }
+        if (ABig === 0) {
+          throw Error('Cannot calculate inverse, determinant is zero');
+        }
+        r = rBig;
+        if (r !== c) {
+          temp = A[c];
+          A[c] = A[r];
+          A[r] = temp;
+          temp = B[c];
+          B[c] = B[r];
+          B[r] = temp;
+        }
+
+        // eliminate non-zero values on the other rows at column c
+        var Ac = A[c];
+        var Bc = B[c];
+        for (r = 0; r < rows; r++) {
+          var Ar = A[r];
+          var Br = B[r];
+          if (r !== c) {
+            // eliminate value at column c and row r
+            if (Ar[c] !== 0) {
+              f = divideScalar(unaryMinus(Ar[c]), Ac[c]);
+
+              // add (f * row c) to row r to eliminate the value
+              // at column c
+              for (s = c; s < cols; s++) {
+                Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
+              }
+              for (s = 0; s < cols; s++) {
+                Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
+              }
+            }
+          } else {
+            // normalize value at Acc to 1,
+            // divide each value on row r with the value at Acc
+            f = Ac[c];
+            for (s = c; s < cols; s++) {
+              Ar[s] = divideScalar(Ar[s], f);
+            }
+            for (s = 0; s < cols; s++) {
+              Br[s] = divideScalar(Br[s], f);
+            }
+          }
+        }
+      }
+      return B;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/kron.js b/node_modules/mathjs/lib/esm/function/matrix/kron.js
new file mode 100644
index 0000000..6e7ae27
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/kron.js
@@ -0,0 +1,85 @@
+import { arraySize as size } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'kron';
+var dependencies = ['typed', 'matrix', 'multiplyScalar'];
+export var createKron = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    multiplyScalar
+  } = _ref;
+  /**
+     * Calculates the Kronecker product of 2 matrices or vectors.
+     *
+     * NOTE: If a one dimensional vector / matrix is given, it will be
+     * wrapped so its two dimensions.
+     * See the examples.
+     *
+     * Syntax:
+     *
+     *    math.kron(x, y)
+     *
+     * Examples:
+     *
+     *    math.kron([[1, 0], [0, 1]], [[1, 2], [3, 4]])
+     *    // returns [ [ 1, 2, 0, 0 ], [ 3, 4, 0, 0 ], [ 0, 0, 1, 2 ], [ 0, 0, 3, 4 ] ]
+     *
+     *    math.kron([1,1], [2,3,4])
+     *    // returns [ [ 2, 3, 4, 2, 3, 4 ] ]
+     *
+     * See also:
+     *
+     *    multiply, dot, cross
+     *
+     * @param  {Array | Matrix} x     First vector
+     * @param  {Array | Matrix} y     Second vector
+     * @return {Array | Matrix}       Returns the Kronecker product of `x` and `y`
+     */
+  return typed(name, {
+    'Matrix, Matrix': function Matrix_Matrix(x, y) {
+      return matrix(_kron(x.toArray(), y.toArray()));
+    },
+    'Matrix, Array': function Matrix_Array(x, y) {
+      return matrix(_kron(x.toArray(), y));
+    },
+    'Array, Matrix': function Array_Matrix(x, y) {
+      return matrix(_kron(x, y.toArray()));
+    },
+    'Array, Array': _kron
+  });
+
+  /**
+     * Calculate the Kronecker product of two matrices / vectors
+     * @param {Array} a  First vector
+     * @param {Array} b  Second vector
+     * @returns {Array} Returns the Kronecker product of x and y
+     * @private
+     */
+  function _kron(a, b) {
+    // Deal with the dimensions of the matricies.
+    if (size(a).length === 1) {
+      // Wrap it in a 2D Matrix
+      a = [a];
+    }
+    if (size(b).length === 1) {
+      // Wrap it in a 2D Matrix
+      b = [b];
+    }
+    if (size(a).length > 2 || size(b).length > 2) {
+      throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
+    }
+    var t = [];
+    var r = [];
+    return a.map(function (a) {
+      return b.map(function (b) {
+        r = [];
+        t.push(r);
+        return a.map(function (y) {
+          return b.map(function (x) {
+            return r.push(multiplyScalar(y, x));
+          });
+        });
+      });
+    }) && t;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/map.js b/node_modules/mathjs/lib/esm/function/matrix/map.js
new file mode 100644
index 0000000..fc61c67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/map.js
@@ -0,0 +1,226 @@
+import { optimizeCallback } from '../../utils/optimizeCallback.js';
+import { arraySize, broadcastSizes, broadcastTo, get, deepMap } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'map';
+var dependencies = ['typed'];
+export var createMap = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Create a new matrix or array with the results of a callback function executed on
+   * each entry of a given matrix/array.
+   *
+   * For each entry of the input,
+   *
+   * the callback is invoked with 2N + 1 arguments:
+   * the N values of the entry, the index at which that entry occurs, and the N full
+   * broadcasted matrix/array being traversed where N is the number of matrices being traversed.
+   * Note that because the matrix/array might be
+   * multidimensional, the "index" argument is always an array of numbers giving
+   * the index in each dimension. This is true even for vectors: the "index"
+   * argument is an array of length 1, rather than simply a number.
+   *
+   * Syntax:
+   *
+   *    math.map(x, callback)
+   *    math.map(x, y, ..., callback)
+   *
+   * Examples:
+   *
+   *    math.map([1, 2, 3], function(value) {
+   *      return value * value
+   *    })  // returns [1, 4, 9]
+   *    math.map([1, 2], [3, 4], function(a, b) {
+   *     return a + b
+   *    })  // returns [4, 6]
+   *
+   *    // The callback is normally called with three arguments:
+   *    //    callback(value, index, Array)
+   *    // If you want to call with only one argument, use:
+   *    math.map([1, 2, 3], x => math.format(x)) // returns ['1', '2', '3']
+   *    // It can also be called with 2N + 1 arguments: for N arrays
+   *    //    callback(value1, value2, index, BroadcastedArray1, BroadcastedArray2)
+   *
+   * See also:
+   *
+   *    filter, forEach, sort
+   *
+   * @param {Matrix | Array} x    The input to iterate on.
+   * @param {Function} callback
+   *     The function to call (as described above) on each entry of the input
+   * @return {Matrix | array}
+   *     Transformed map of x; always has the same type and shape as x
+   */
+  return typed(name, {
+    'Array, function': _mapArray,
+    'Matrix, function': function Matrix_function(x, callback) {
+      return x.map(callback);
+    },
+    'Array|Matrix, Array|Matrix, ...Array|Matrix|function': (A, B, rest) => _mapMultiple([A, B, ...rest.slice(0, rest.length - 1)], rest[rest.length - 1])
+  });
+
+  /**
+  * Maps over multiple arrays or matrices.
+  *
+  * @param {Array<Array|Matrix>} Arrays - An array of arrays or matrices to map over.
+  * @param {function} multiCallback - The callback function to apply to each element.
+  * @throws {Error} If the last argument is not a callback function.
+  * @returns {Array|Matrix} A new array or matrix with each element being the result of the callback function.
+  *
+  * @example
+  * _mapMultiple([[1, 2, 3], [4, 5, 6]], (a, b) => a + b); // Returns [5, 7, 9]
+  */
+  function _mapMultiple(Arrays, multiCallback) {
+    if (typeof multiCallback !== 'function') {
+      throw new Error('Last argument must be a callback function');
+    }
+    var firstArrayIsMatrix = Arrays[0].isMatrix;
+    var sizes = Arrays.map(M => M.isMatrix ? M.size() : arraySize(M));
+    var newSize = broadcastSizes(...sizes);
+    var numberOfArrays = Arrays.length;
+    var _get = firstArrayIsMatrix ? (matrix, idx) => matrix.get(idx) : get;
+    var firstValues = Arrays.map((collection, i) => {
+      var firstIndex = sizes[i].map(() => 0);
+      return collection.isMatrix ? collection.get(firstIndex) : get(collection, firstIndex);
+    });
+    var callbackArgCount = typed.isTypedFunction(multiCallback) ? _getTypedCallbackArgCount(multiCallback, firstValues, newSize.map(() => 0), Arrays) : _getCallbackArgCount(multiCallback, numberOfArrays);
+    if (callbackArgCount < 2) {
+      var _callback = _getLimitedCallback(callbackArgCount, multiCallback, null);
+      return mapMultiple(Arrays, _callback);
+    }
+    var broadcastedArrays = firstArrayIsMatrix ? Arrays.map(M => M.isMatrix ? M.create(broadcastTo(M.toArray(), newSize), M.datatype()) : Arrays[0].create(broadcastTo(M.valueOf(), newSize))) : Arrays.map(M => M.isMatrix ? broadcastTo(M.toArray(), newSize) : broadcastTo(M, newSize));
+    var callback = _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays);
+    var broadcastedArraysCallback = (x, idx) => callback([x, ...broadcastedArrays.slice(1).map(array => _get(array, idx))], idx);
+    if (firstArrayIsMatrix) {
+      return broadcastedArrays[0].map(broadcastedArraysCallback);
+    } else {
+      return _mapArray(broadcastedArrays[0], broadcastedArraysCallback);
+    }
+  }
+  function mapMultiple(collections, callback) {
+    // collections can be matrices or arrays
+    // callback must be a function of the form (collections, [index])
+    var firstCollection = collections[0];
+    var arrays = collections.map(collection => collection.isMatrix ? collection.valueOf() : collection);
+    var sizes = collections.map(collection => collection.isMatrix ? collection.size() : arraySize(collection));
+    var finalSize = broadcastSizes(...sizes);
+    // the offset means for each initial array, how much smaller is it than the final size
+    var offsets = sizes.map(size => finalSize.length - size.length);
+    var maxDepth = finalSize.length - 1;
+    var callbackUsesIndex = callback.length > 1;
+    var index = callbackUsesIndex ? [] : null;
+    var resultsArray = iterate(arrays, 0);
+    if (firstCollection.isMatrix) {
+      var resultsMatrix = firstCollection.create();
+      resultsMatrix._data = resultsArray;
+      resultsMatrix._size = finalSize;
+      return resultsMatrix;
+    } else {
+      return resultsArray;
+    }
+    function iterate(arrays) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      // each array can have different sizes
+      var currentDimensionSize = finalSize[depth];
+      var result = Array(currentDimensionSize);
+      if (depth < maxDepth) {
+        var _loop = function _loop(i) {
+          if (index) index[depth] = i;
+          // if there is an offset greater than the current dimension
+          // pass the array, if the size of the array is 1 pass the first
+          // element of the array
+          result[i] = iterate(arrays.map((array, arrayIndex) => offsets[arrayIndex] > depth ? array : array.length === 1 ? array[0] : array[i]), depth + 1);
+        };
+        for (var i = 0; i < currentDimensionSize; i++) {
+          _loop(i);
+        }
+      } else {
+        var _loop2 = function _loop2(_i) {
+          if (index) index[depth] = _i;
+          result[_i] = callback(arrays.map(a => a.length === 1 ? a[0] : a[_i]), index ? index.slice() : undefined);
+        };
+        for (var _i = 0; _i < currentDimensionSize; _i++) {
+          _loop2(_i);
+        }
+      }
+      return result;
+    }
+  }
+
+  /**
+    * Creates a limited callback based on the argument pattern.
+    * @param {number} callbackArgCount - The argument pattern (0, 1, or 2)
+    * @param {Function} multiCallback - The original callback function
+    * @param {Array} broadcastedArrays - The broadcasted arrays (for case 2)
+    * @returns {Function} The limited callback function
+    */
+  function _getLimitedCallback(callbackArgCount, multiCallback, broadcastedArrays) {
+    switch (callbackArgCount) {
+      case 0:
+        return x => multiCallback(...x);
+      case 1:
+        return (x, idx) => multiCallback(...x, idx);
+      case 2:
+        return (x, idx) => multiCallback(...x, idx, ...broadcastedArrays);
+    }
+  }
+
+  /**
+     * Determines the argument pattern of a regular callback function.
+     * @param {Function} callback - The callback function to analyze
+     * @param {number} numberOfArrays - Number of arrays being processed
+     * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays
+     */
+  function _getCallbackArgCount(callback, numberOfArrays) {
+    var callbackStr = callback.toString();
+    // Check if the callback function uses `arguments`
+    if (/arguments/.test(callbackStr)) return 2;
+
+    // Extract the parameters of the callback function
+    var paramsStr = callbackStr.match(/\(.*?\)/);
+    // Check if the callback function uses rest parameters
+    if (/\.\.\./.test(paramsStr)) return 2;
+    if (callback.length > numberOfArrays + 1) {
+      return 2;
+    }
+    if (callback.length === numberOfArrays + 1) {
+      return 1;
+    }
+    return 0;
+  }
+
+  /**
+  * Determines the argument pattern of a typed callback function.
+  * @param {Function} callback - The typed callback function to analyze
+  * @param {Array} values - Sample values for signature resolution
+  * @param {Array} idx - Sample index for signature resolution
+  * @param {Array} arrays - Sample arrays for signature resolution
+  * @returns {number} 0 = values only, 1 = values + index, 2 = values + index + arrays
+  */
+
+  function _getTypedCallbackArgCount(callback, values, idx, arrays) {
+    if (typed.resolve(callback, [...values, idx, ...arrays]) !== null) {
+      return 2;
+    }
+    if (typed.resolve(callback, [...values, idx]) !== null) {
+      return 1;
+    }
+    if (typed.resolve(callback, values) !== null) {
+      return 0;
+    }
+    // this should never happen
+    return 0;
+  }
+  /**
+  * Map for a multi dimensional array
+  * @param {Array} array
+  * @param {Function} callback
+  * @return {Array}
+  * @private
+  */
+  function _mapArray(array, callback) {
+    var fastCallback = optimizeCallback(callback, array, name);
+    return deepMap(array, fastCallback.fn, fastCallback.isUnary);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/mapSlices.js b/node_modules/mathjs/lib/esm/function/matrix/mapSlices.js
new file mode 100644
index 0000000..e3566de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/mapSlices.js
@@ -0,0 +1,118 @@
+import { factory } from '../../utils/factory.js';
+import { arraySize } from '../../utils/array.js';
+import { isMatrix } from '../../utils/is.js';
+import { IndexError } from '../../error/IndexError.js';
+var name = 'mapSlices';
+var dependencies = ['typed', 'isInteger'];
+export var createMapSlices = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+  /**
+   * Apply a function that maps an array to a scalar
+   * along a given axis of a matrix or array.
+   * Returns a new matrix or array with one less dimension than the input.
+   *
+   * Syntax:
+   *
+   *     math.mapSlices(A, dim, callback)
+   *
+   * Where:
+   *
+   * - `dim: number` is a zero-based dimension over which to concatenate the matrices.
+   *
+   * Examples:
+   *
+   *    const A = [[1, 2], [3, 4]]
+   *    const sum = math.sum
+   *
+   *    math.mapSlices(A, 0, sum)             // returns [4, 6]
+   *    math.mapSlices(A, 1, sum)             // returns [3, 7]
+   *
+   * See also:
+   *
+   *    map, filter, forEach
+   *
+   * Note:
+   *
+   *    `mapSlices()` is also currently available via its deprecated
+   *    synonym `apply()`.
+   *
+   * @param {Array | Matrix} array   The input Matrix
+   * @param {number} dim             The dimension along which the callback is applied
+   * @param {Function} callback      The callback function that is applied. This Function
+   *                                 should take an array or 1-d matrix as an input and
+   *                                 return a number.
+   * @return {Array | Matrix} res    The residual matrix with the function mapped on the slices over some dimension.
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber, function': function Array__Matrix_number__BigNumber_function(mat, dim, callback) {
+      if (!isInteger(dim)) {
+        throw new TypeError('Integer number expected for dimension');
+      }
+      var size = Array.isArray(mat) ? arraySize(mat) : mat.size();
+      if (dim < 0 || dim >= size.length) {
+        throw new IndexError(dim, size.length);
+      }
+      if (isMatrix(mat)) {
+        return mat.create(_mapSlices(mat.valueOf(), dim, callback), mat.datatype());
+      } else {
+        return _mapSlices(mat, dim, callback);
+      }
+    }
+  });
+}, {
+  formerly: 'apply'
+});
+
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+function _mapSlices(mat, dim, callback) {
+  var i, ret, tran;
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      return callback(mat);
+    } else {
+      tran = _switch(mat);
+      ret = [];
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _mapSlices(tran[i], dim - 1, callback);
+      }
+      return ret;
+    }
+  } else {
+    ret = [];
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _mapSlices(mat[i], dim - 1, callback);
+    }
+    return ret;
+  }
+}
+
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+    ret.push(tmp);
+  }
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js
new file mode 100644
index 0000000..8a0e9ea
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromColumns.js
@@ -0,0 +1,88 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromColumns';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+export var createMatrixFromColumns = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+  /**
+   * Create a dense matrix from vectors as individual columns.
+   * If you pass row vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromColumns(...arr)
+   *    math.matrixFromColumns(col1, col2)
+   *    math.matrixFromColumns(col1, col2, col3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromColumns([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromColumns(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromRows, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} cols Multiple columns
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    }
+
+    // TODO implement this properly for SparseMatrix
+  });
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]);
+
+    // create an array with empty rows
+    var result = [];
+    for (var i = 0; i < N; i++) {
+      result[i] = [];
+    }
+
+    // loop columns
+    for (var col of arr) {
+      var colLength = checkVectorTypeAndReturnLength(col);
+      if (colLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));
+      }
+      var f = flatten(col);
+
+      // push a value to each row
+      for (var _i = 0; _i < N; _i++) {
+        result[_i].push(f[_i]);
+      }
+    }
+    return result;
+  }
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js
new file mode 100644
index 0000000..f20ec59
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromFunction.js
@@ -0,0 +1,107 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromFunction';
+var dependencies = ['typed', 'matrix', 'isZero'];
+export var createMatrixFromFunction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    isZero
+  } = _ref;
+  /**
+   * Create a matrix by evaluating a generating function at each index.
+   * The simplest overload returns a multi-dimensional array as long as `size`
+   * is an array.
+   * Passing `size` as a Matrix or specifying a `format` will result in
+   * returning a Matrix.
+   *
+   * Syntax:
+   *
+   *    math.matrixFromFunction(size, fn)
+   *    math.matrixFromFunction(size, fn, format)
+   *    math.matrixFromFunction(size, fn, format, datatype)
+   *    math.matrixFromFunction(size, format, fn)
+   *    math.matrixFromFunction(size, format, datatype, fn)
+   *
+   * Where:
+   *
+   *    - `size: (number[] | Matrix)`
+   *      A vector giving the extent of the array to be created in each
+   *      dimension. If size has one entry, a vector is created; if it
+   *      has two, a rectangular array/Matrix is created; if three, a
+   *      three-dimensional array/Matrix is created; and so on.
+   *    - `fn: (index: number[]) => MathType`
+   *      The callback function that will generate the entries of the
+   *      matrix. It is called in turn with the index of each entry of
+   *      the matrix. The index is always an ordinary array of numbers
+   *      with the same length as _size_. So for vectors, you will get
+   *      indices like `[0]` or `[1]`, whereas for matrices, you will
+   *      get indices like `[2, 0]` or `[1,3]`. The return value may
+   *      be any type that can go in an array or Matrix entry, although
+   *      if you supply the _datatype_ argument, you must yourself ensure
+   *      the type of the return value matches. Note that currently,
+   *      your callback _fn_ will receive 0-based indices for the matrix
+   *      entries, regardless of whether matrixFromFunction is invoked
+   *      directly from JavaScript or via the mathjs expression language.
+   *    - `format: 'dense'|'sparse'`
+   *      Specifies the storage format for the resulting Matrix. Note that
+   *      if this argument is given, the return value will always be a
+   *      Matrix (rather than possibly an Array).
+   *    - `datatype: string`
+   *      Specifies the data type of entries of the new matrix. If given,
+   *      it should be the name of a data type that mathjs supports, as
+   *      returned by the math.typeOf function. It is up to the caller
+   *      to make certain that all values returned by _fn_ are consistent
+   *      with this datatype if specified.
+   *
+   * Examples:
+   *
+   *    math.matrixFromFunction([3,3], i => i[0] - i[1]) // an antisymmetric matrix
+   *    math.matrixFromFunction([100, 100], 'sparse', i => i[0] - i[1] === 1 ? 4 : 0) // a sparse subdiagonal matrix
+   *    math.matrixFromFunction([5], i => math.random()) // a random vector
+   *
+   * See also:
+   *
+   *    matrix, typeOf, zeros
+   *
+   * @param {Array | Matrix} size   The size of the matrix to be created
+   * @param {function} fn           Callback function invoked for every entry in the matrix
+   * @param {string} [format]       The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]     Type of the values
+   * @return {Array | Matrix} Returns the created matrix
+   */
+  return typed(name, {
+    'Array | Matrix, function, string, string': function Array__Matrix_function_string_string(size, fn, format, datatype) {
+      return _create(size, fn, format, datatype);
+    },
+    'Array | Matrix, function, string': function Array__Matrix_function_string(size, fn, format) {
+      return _create(size, fn, format);
+    },
+    'Matrix, function': function Matrix_function(size, fn) {
+      return _create(size, fn, 'dense');
+    },
+    'Array, function': function Array_function(size, fn) {
+      return _create(size, fn, 'dense').toArray();
+    },
+    'Array | Matrix, string, function': function Array__Matrix_string_function(size, format, fn) {
+      return _create(size, fn, format);
+    },
+    'Array | Matrix, string, string, function': function Array__Matrix_string_string_function(size, format, datatype, fn) {
+      return _create(size, fn, format, datatype);
+    }
+  });
+  function _create(size, fn, format, datatype) {
+    var m;
+    if (datatype !== undefined) {
+      m = matrix(format, datatype);
+    } else {
+      m = matrix(format);
+    }
+    m.resize(size);
+    m.forEach(function (_, index) {
+      var val = fn(index);
+      if (isZero(val)) return;
+      m.set(index, val);
+    });
+    return m;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js b/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js
new file mode 100644
index 0000000..33e9b97
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/matrixFromRows.js
@@ -0,0 +1,76 @@
+import { factory } from '../../utils/factory.js';
+var name = 'matrixFromRows';
+var dependencies = ['typed', 'matrix', 'flatten', 'size'];
+export var createMatrixFromRows = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    flatten,
+    size
+  } = _ref;
+  /**
+   * Create a dense matrix from vectors as individual rows.
+   * If you pass column vectors, they will be transposed (but not conjugated!)
+   *
+   * Syntax:
+   *
+   *    math.matrixFromRows(...arr)
+   *    math.matrixFromRows(row1, row2)
+   *    math.matrixFromRows(row1, row2, row3)
+   *
+   * Examples:
+   *
+   *    math.matrixFromRows([1, 2, 3], [[4],[5],[6]])
+   *    math.matrixFromRows(...vectors)
+   *
+   * See also:
+   *
+   *    matrix, matrixFromColumns, matrixFromFunction, zeros
+   *
+   * @param {... Array | Matrix} rows  Multiple rows
+   * @return { number[][] | Matrix } if at least one of the arguments is an array, an array will be returned
+   */
+  return typed(name, {
+    '...Array': function Array(arr) {
+      return _createArray(arr);
+    },
+    '...Matrix': function Matrix(arr) {
+      return matrix(_createArray(arr.map(m => m.toArray())));
+    }
+
+    // TODO implement this properly for SparseMatrix
+  });
+  function _createArray(arr) {
+    if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');
+    var N = checkVectorTypeAndReturnLength(arr[0]);
+    var result = [];
+    for (var row of arr) {
+      var rowLength = checkVectorTypeAndReturnLength(row);
+      if (rowLength !== N) {
+        throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));
+      }
+      result.push(flatten(row));
+    }
+    return result;
+  }
+  function checkVectorTypeAndReturnLength(vec) {
+    var s = size(vec);
+    if (s.length === 1) {
+      // 1D vector
+      return s[0];
+    } else if (s.length === 2) {
+      // 2D vector
+      if (s[0] === 1) {
+        // row vector
+        return s[1];
+      } else if (s[1] === 1) {
+        // col vector
+        return s[0];
+      } else {
+        throw new TypeError('At least one of the arguments is not a vector.');
+      }
+    } else {
+      throw new TypeError('Only one- or two-dimensional vectors are supported.');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/ones.js b/node_modules/mathjs/lib/esm/function/matrix/ones.js
new file mode 100644
index 0000000..c836440
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/ones.js
@@ -0,0 +1,123 @@
+import { isBigNumber } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { resize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ones';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createOnes = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.ones(m)
+   *    math.ones(m, format)
+   *    math.ones(m, n)
+   *    math.ones(m, n, format)
+   *    math.ones([m, n])
+   *    math.ones([m, n], format)
+   *    math.ones([m, n, p, ...])
+   *    math.ones([m, n, p, ...], format)
+   *
+   * Examples:
+   *
+   *    math.ones()                    // returns []
+   *    math.ones(3)                   // returns [1, 1, 1]
+   *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
+   *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.ones(math.size(A))       // returns [[1, 1, 1], [1, 1, 1]]
+   *
+   * See also:
+   *
+   *    zeros, identity, size, range
+   *
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix | number}  A matrix filled with ones
+   */
+  return typed('ones', {
+    '': function _() {
+      return config.matrix === 'Array' ? _ones([]) : _ones([], 'default');
+    },
+    // math.ones(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function number__BigNumber__string(size) {
+      var last = size[size.length - 1];
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _ones(size, format);
+      } else if (config.matrix === 'Array') {
+        return _ones(size);
+      } else {
+        return _ones(size, 'default');
+      }
+    },
+    Array: _ones,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _ones(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function Array__Matrix_string(size, format) {
+      return _ones(size.valueOf(), format);
+    }
+  });
+
+  /**
+   * Create an Array or Matrix with ones
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+  function _ones(size, format) {
+    var hasBigNumbers = _normalize(size);
+    var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
+    _validate(size);
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+      if (size.length > 0) {
+        return resize(arr, size, defaultValue);
+      }
+      return arr;
+    }
+  }
+
+  // replace BigNumbers with numbers, returns true if size contained BigNumbers
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if (isBigNumber(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  }
+
+  // validate arguments
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !isInteger(value) || value < 0) {
+        throw new Error('Parameters in function ones must be positive integers');
+      }
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js b/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js
new file mode 100644
index 0000000..17ae6ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/partitionSelect.js
@@ -0,0 +1,143 @@
+import { isMatrix } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'partitionSelect';
+var dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
+export var createPartitionSelect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNumeric,
+    isNaN: mathIsNaN,
+    compare
+  } = _ref;
+  var asc = compare;
+  var desc = (a, b) => -compare(a, b);
+
+  /**
+   * Partition-based selection of an array or 1D matrix.
+   * Will find the kth smallest value, and mutates the input array.
+   * Uses Quickselect.
+   *
+   * Syntax:
+   *
+   *    math.partitionSelect(x, k)
+   *    math.partitionSelect(x, k, compare)
+   *
+   * Examples:
+   *
+   *    math.partitionSelect([5, 10, 1], 2)                               // returns 10
+   *    math.partitionSelect(['C', 'B', 'A', 'D'], 1, math.compareText)   // returns 'B'
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.partitionSelect(['Langdon', 'Tom', 'Sara'], 2, sortByLength) // returns 'Langdon'
+   *
+   *    // the input array is mutated
+   *    arr = [5, 2, 1]
+   *    math.partitionSelect(arr, 0) // returns 1, arr is now: [1, 2, 5]
+   *    math.partitionSelect(arr, 1, 'desc') // returns 2, arr is now: [5, 2, 1]
+   *
+   * See also:
+   *
+   *    sort
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Number} k            The kth smallest value to be retrieved zero-based index
+   * @param {Function | 'asc' | 'desc'} [compare='asc']
+   *        An optional comparator function. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {*} Returns the kth lowest value.
+   */
+  return typed(name, {
+    'Array | Matrix, number': function Array__Matrix_number(x, k) {
+      return _partitionSelect(x, k, asc);
+    },
+    'Array | Matrix, number, string': function Array__Matrix_number_string(x, k, compare) {
+      if (compare === 'asc') {
+        return _partitionSelect(x, k, asc);
+      } else if (compare === 'desc') {
+        return _partitionSelect(x, k, desc);
+      } else {
+        throw new Error('Compare string must be "asc" or "desc"');
+      }
+    },
+    'Array | Matrix, number, function': _partitionSelect
+  });
+  function _partitionSelect(x, k, compare) {
+    if (!isInteger(k) || k < 0) {
+      throw new Error('k must be a non-negative integer');
+    }
+    if (isMatrix(x)) {
+      var size = x.size();
+      if (size.length > 1) {
+        throw new Error('Only one dimensional matrices supported');
+      }
+      return quickSelect(x.valueOf(), k, compare);
+    }
+    if (Array.isArray(x)) {
+      return quickSelect(x, k, compare);
+    }
+  }
+
+  /**
+   * Quickselect algorithm.
+   * Code adapted from:
+   * https://blog.teamleadnet.com/2012/07/quick-select-algorithm-find-kth-element.html
+   *
+   * @param {Array} arr
+   * @param {Number} k
+   * @param {Function} compare
+   * @private
+   */
+  function quickSelect(arr, k, compare) {
+    if (k >= arr.length) {
+      throw new Error('k out of bounds');
+    }
+
+    // check for NaN values since these can cause an infinite while loop
+    for (var i = 0; i < arr.length; i++) {
+      if (isNumeric(arr[i]) && mathIsNaN(arr[i])) {
+        return arr[i]; // return NaN
+      }
+    }
+    var from = 0;
+    var to = arr.length - 1;
+
+    // if from == to we reached the kth element
+    while (from < to) {
+      var r = from;
+      var w = to;
+      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from];
+
+      // stop if the reader and writer meets
+      while (r < w) {
+        // arr[r] >= pivot
+        if (compare(arr[r], pivot) >= 0) {
+          // put the large values at the end
+          var tmp = arr[w];
+          arr[w] = arr[r];
+          arr[r] = tmp;
+          --w;
+        } else {
+          // the value is smaller than the pivot, skip
+          ++r;
+        }
+      }
+
+      // if we stepped up (r++) we need to step one down (arr[r] > pivot)
+      if (compare(arr[r], pivot) > 0) {
+        --r;
+      }
+
+      // the r pointer is on the end of the first k elements
+      if (k <= r) {
+        to = r;
+      } else {
+        from = r + 1;
+      }
+    }
+    return arr[k];
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/pinv.js b/node_modules/mathjs/lib/esm/function/matrix/pinv.js
new file mode 100644
index 0000000..de4b3b1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/pinv.js
@@ -0,0 +1,179 @@
+import { isMatrix } from '../../utils/is.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { format } from '../../utils/string.js';
+import { clone } from '../../utils/object.js';
+var name = 'pinv';
+var dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];
+export var createPinv = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    inv,
+    deepEqual,
+    equal,
+    dotDivide,
+    dot,
+    ctranspose,
+    divideScalar,
+    multiply,
+    add,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix.
+   *
+   * Syntax:
+   *
+   *     math.pinv(x)
+   *
+   * Examples:
+   *
+   *     math.pinv([[1, 2], [3, 4]])          // returns [[-2, 1], [1.5, -0.5]]
+   *     math.pinv([[1, 0], [0, 1], [0, 1]])  // returns [[1, 0, 0], [0, 0.5, 0.5]]
+   *     math.pinv(4)                         // returns 0.25
+   *
+   * See also:
+   *
+   *     inv
+   *
+   * @param {number | Complex | Array | Matrix} x     Matrix to be inversed
+   * @return {number | Complex | Array | Matrix} The inverse of `x`.
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(x) {
+      var size = isMatrix(x) ? x.size() : arraySize(x);
+      switch (size.length) {
+        case 1:
+          // vector
+          if (_isZeros(x)) return ctranspose(x); // null vector
+          if (size[0] === 1) {
+            return inv(x); // invertible matrix
+          } else {
+            return dotDivide(ctranspose(x), dot(x, x));
+          }
+        case 2:
+          // two dimensional array
+          {
+            if (_isZeros(x)) return ctranspose(x); // zero matrixx
+            var rows = size[0];
+            var cols = size[1];
+            if (rows === cols) {
+              try {
+                return inv(x); // invertible matrix
+              } catch (err) {
+                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {
+                  // Expected
+                } else {
+                  throw err;
+                }
+              }
+            }
+            if (isMatrix(x)) {
+              return matrix(_pinv(x.valueOf(), rows, cols), x.storage());
+            } else {
+              // return an Array
+              return _pinv(x, rows, cols);
+            }
+          }
+        default:
+          // multi dimensional array
+          throw new RangeError('Matrix must be two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    },
+    any: function any(x) {
+      // scalar
+      if (equal(x, 0)) return clone(x); // zero
+      return divideScalar(1, x);
+    }
+  });
+
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]} pinv    Pseudoinverse matrix
+   * @private
+   */
+  function _pinv(mat, rows, cols) {
+    var {
+      C,
+      F
+    } = _rankFact(mat, rows, cols); // TODO: Use SVD instead (may improve precision)
+    var Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C));
+    var Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))));
+    return multiply(Fpinv, Cpinv);
+  }
+
+  /**
+   * Calculate the reduced row echelon form of a matrix
+   *
+   * Modified from https://rosettacode.org/wiki/Reduced_row_echelon_form
+   *
+   * @param {Array[]} mat     A matrix
+   * @param {number} rows     Number of rows
+   * @param {number} cols     Number of columns
+   * @return {Array[]}        Reduced row echelon form
+   * @private
+   */
+  function _rref(mat, rows, cols) {
+    var M = clone(mat);
+    var lead = 0;
+    for (var r = 0; r < rows; r++) {
+      if (cols <= lead) {
+        return M;
+      }
+      var i = r;
+      while (_isZero(M[i][lead])) {
+        i++;
+        if (rows === i) {
+          i = r;
+          lead++;
+          if (cols === lead) {
+            return M;
+          }
+        }
+      }
+      [M[i], M[r]] = [M[r], M[i]];
+      var val = M[r][lead];
+      for (var j = 0; j < cols; j++) {
+        M[r][j] = dotDivide(M[r][j], val);
+      }
+      for (var _i = 0; _i < rows; _i++) {
+        if (_i === r) continue;
+        val = M[_i][lead];
+        for (var _j = 0; _j < cols; _j++) {
+          M[_i][_j] = add(M[_i][_j], multiply(-1, multiply(val, M[r][_j])));
+        }
+      }
+      lead++;
+    }
+    return M;
+  }
+
+  /**
+   * Calculate the rank factorization of a matrix
+   *
+   * @param {Array[]} mat                  A matrix (M)
+   * @param {number} rows                  Number of rows
+   * @param {number} cols                  Number of columns
+   * @return {{C: Array, F: Array}}        rank factorization where M = C F
+   * @private
+   */
+  function _rankFact(mat, rows, cols) {
+    var rref = _rref(mat, rows, cols);
+    var C = mat.map((_, i) => _.filter((_, j) => j < rows && !_isZero(dot(rref[j], rref[j]))));
+    var F = rref.filter((_, i) => !_isZero(dot(rref[i], rref[i])));
+    return {
+      C,
+      F
+    };
+  }
+  function _isZero(x) {
+    return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)));
+  }
+  function _isZeros(arr) {
+    return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/range.js b/node_modules/mathjs/lib/esm/function/matrix/range.js
new file mode 100644
index 0000000..7d3de9f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/range.js
@@ -0,0 +1,235 @@
+import { factory } from '../../utils/factory.js';
+import { noBignumber, noMatrix } from '../../utils/noop.js';
+var name = 'range';
+var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'equal', 'smaller', 'smallerEq', 'larger', 'largerEq', 'add', 'isZero', 'isPositive'];
+export var createRange = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    bignumber,
+    smaller,
+    smallerEq,
+    larger,
+    largerEq,
+    add,
+    isZero,
+    isPositive
+  } = _ref;
+  /**
+   * Create a matrix or array containing a range of values.
+   * By default, the range end is excluded. This can be customized by providing
+   * an extra parameter `includeEnd`.
+   *
+   * Syntax:
+   *
+   *     math.range(str [, includeEnd])               // Create a range from a string,
+   *                                                  // where the string contains the
+   *                                                  // start, optional step, and end,
+   *                                                  // separated by a colon.
+   *     math.range(start, end [, includeEnd])        // Create a range with start and
+   *                                                  // end and a step size of 1.
+   *     math.range(start, end, step [, includeEnd])  // Create a range with start, step,
+   *                                                  // and end.
+   *
+   * Where:
+   *
+   * - `str: string`
+   *   A string 'start:end' or 'start:step:end'
+   * - `start: {number | bigint | BigNumber | Fraction | Unit}`
+   *   Start of the range
+   * - `end: number | bigint | BigNumber | Fraction | Unit`
+   *   End of the range, excluded by default, included when parameter includeEnd=true
+   * - `step: number | bigint | BigNumber | Fraction | Unit`
+   *   Step size. Default value is 1.
+   * - `includeEnd: boolean`
+   *   Option to specify whether to include the end or not. False by default.
+   *
+   * The function returns a `DenseMatrix` when the library is configured with
+   * `config = { matrix: 'Matrix' }, and returns an Array otherwise.
+   * Note that the type of the returned values is taken from the type of the
+   * provided start/end value. If only one of these is a built-in `number` type,
+   * it will be promoted to the type of the other endpoint. However, in the case
+   * of Unit values, both endpoints must have compatible units, and the return
+   * value will have compatible units as well.
+   *
+   * Examples:
+   *
+   *     math.range(2, 6)        // [2, 3, 4, 5]
+   *     math.range(2, -3, -1)   // [2, 1, 0, -1, -2]
+   *     math.range('2:1:6')     // [2, 3, 4, 5]
+   *     math.range(2, 6, true)  // [2, 3, 4, 5, 6]
+   *     math.range(2, math.fraction(8,3), math.fraction(1,3)) // [fraction(2), fraction(7,3)]
+   *     math.range(math.unit(2, 'm'), math.unit(-3, 'm'), math.unit(-1, 'm')) // [2 m, 1 m, 0 m , -1 m, -2 m]
+   *
+   * See also:
+   *
+   *     ones, zeros, size, subset
+   *
+   * @param {*} args   Parameters describing the range's `start`, `end`, and optional `step`.
+   * @return {Array | Matrix} range
+   */
+  return typed(name, {
+    // TODO: simplify signatures when typed-function supports default values and optional arguments
+
+    string: _strRange,
+    'string, boolean': _strRange,
+    number: function number(oops) {
+      throw new TypeError("Too few arguments to function range(): ".concat(oops));
+    },
+    boolean: function boolean(oops) {
+      throw new TypeError("Unexpected type of argument 1 to function range(): ".concat(oops, ", number|bigint|BigNumber|Fraction"));
+    },
+    'number, number': function number_number(start, end) {
+      return _out(_range(start, end, 1, false));
+    },
+    'number, number, number': function number_number_number(start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'number, number, boolean': function number_number_boolean(start, end, includeEnd) {
+      return _out(_range(start, end, 1, includeEnd));
+    },
+    'number, number, number, boolean': function number_number_number_boolean(start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    // Handle bigints; if either limit is bigint, range should be too
+    'bigint, bigint|number': function bigint_bigintNumber(start, end) {
+      return _out(_range(start, end, 1n, false));
+    },
+    'number, bigint': function number_bigint(start, end) {
+      return _out(_range(BigInt(start), end, 1n, false));
+    },
+    'bigint, bigint|number, bigint|number': function bigint_bigintNumber_bigintNumber(start, end, step) {
+      return _out(_range(start, end, BigInt(step), false));
+    },
+    'number, bigint, bigint|number': function number_bigint_bigintNumber(start, end, step) {
+      return _out(_range(BigInt(start), end, BigInt(step), false));
+    },
+    'bigint, bigint|number, boolean': function bigint_bigintNumber_boolean(start, end, includeEnd) {
+      return _out(_range(start, end, 1n, includeEnd));
+    },
+    'number, bigint, boolean': function number_bigint_boolean(start, end, includeEnd) {
+      return _out(_range(BigInt(start), end, 1n, includeEnd));
+    },
+    'bigint, bigint|number, bigint|number, boolean': function bigint_bigintNumber_bigintNumber_boolean(start, end, step, includeEnd) {
+      return _out(_range(start, end, BigInt(step), includeEnd));
+    },
+    'number, bigint, bigint|number, boolean': function number_bigint_bigintNumber_boolean(start, end, step, includeEnd) {
+      return _out(_range(BigInt(start), end, BigInt(step), includeEnd));
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(start, end) {
+      var BigNumber = start.constructor;
+      return _out(_range(start, end, new BigNumber(1), false));
+    },
+    'BigNumber, BigNumber, BigNumber': function BigNumber_BigNumber_BigNumber(start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'BigNumber, BigNumber, boolean': function BigNumber_BigNumber_boolean(start, end, includeEnd) {
+      var BigNumber = start.constructor;
+      return _out(_range(start, end, new BigNumber(1), includeEnd));
+    },
+    'BigNumber, BigNumber, BigNumber, boolean': function BigNumber_BigNumber_BigNumber_boolean(start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    'Fraction, Fraction': function Fraction_Fraction(start, end) {
+      return _out(_range(start, end, 1, false));
+    },
+    'Fraction, Fraction, Fraction': function Fraction_Fraction_Fraction(start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'Fraction, Fraction, boolean': function Fraction_Fraction_boolean(start, end, includeEnd) {
+      return _out(_range(start, end, 1, includeEnd));
+    },
+    'Fraction, Fraction, Fraction, boolean': function Fraction_Fraction_Fraction_boolean(start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    },
+    'Unit, Unit, Unit': function Unit_Unit_Unit(start, end, step) {
+      return _out(_range(start, end, step, false));
+    },
+    'Unit, Unit, Unit, boolean': function Unit_Unit_Unit_boolean(start, end, step, includeEnd) {
+      return _out(_range(start, end, step, includeEnd));
+    }
+  });
+  function _out(arr) {
+    if (config.matrix === 'Matrix') {
+      return matrix ? matrix(arr) : noMatrix();
+    }
+    return arr;
+  }
+  function _strRange(str, includeEnd) {
+    var r = _parse(str);
+    if (!r) {
+      throw new SyntaxError('String "' + str + '" is no valid range');
+    }
+    if (config.number === 'BigNumber') {
+      if (bignumber === undefined) {
+        noBignumber();
+      }
+      return _out(_range(bignumber(r.start), bignumber(r.end), bignumber(r.step)), includeEnd);
+    } else {
+      return _out(_range(r.start, r.end, r.step, includeEnd));
+    }
+  }
+
+  /**
+   * Create a range with numbers or BigNumbers
+   * @param {number | BigNumber | Unit} start
+   * @param {number | BigNumber | Unit} end
+   * @param {number | BigNumber | Unit} step
+   * @param {boolean} includeEnd
+   * @returns {Array} range
+   * @private
+   */
+  function _range(start, end, step, includeEnd) {
+    var array = [];
+    if (isZero(step)) throw new Error('Step must be non-zero');
+    var ongoing = isPositive(step) ? includeEnd ? smallerEq : smaller : includeEnd ? largerEq : larger;
+    var x = start;
+    while (ongoing(x, end)) {
+      array.push(x);
+      x = add(x, step);
+    }
+    return array;
+  }
+
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @param {string} str
+   * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
+   * @private
+   */
+  function _parse(str) {
+    var args = str.split(':');
+
+    // number
+    var nums = args.map(function (arg) {
+      // use Number and not parseFloat as Number returns NaN on invalid garbage in the string
+      return Number(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+    if (invalid) {
+      return null;
+    }
+    switch (nums.length) {
+      case 2:
+        return {
+          start: nums[0],
+          end: nums[1],
+          step: 1
+        };
+      case 3:
+        return {
+          start: nums[0],
+          end: nums[2],
+          step: nums[1]
+        };
+      default:
+        return null;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/reshape.js b/node_modules/mathjs/lib/esm/function/matrix/reshape.js
new file mode 100644
index 0000000..5ffb0fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/reshape.js
@@ -0,0 +1,63 @@
+import { reshape as arrayReshape } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'reshape';
+var dependencies = ['typed', 'isInteger', 'matrix'];
+export var createReshape = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isInteger
+  } = _ref;
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   *
+   * Syntax:
+   *
+   *     math.reshape(x, sizes)
+   *
+   * Examples:
+   *
+   *     math.reshape([1, 2, 3, 4, 5, 6], [2, 3])
+   *     // returns Array  [[1, 2, 3], [4, 5, 6]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [1, 4])
+   *     // returns Array  [[1, 2, 3, 4]]
+   *
+   *     math.reshape([[1, 2], [3, 4]], [4])
+   *     // returns Array [1, 2, 3, 4]
+   *
+   *     const x = math.matrix([1, 2, 3, 4, 5, 6, 7, 8])
+   *     math.reshape(x, [2, 2, 2])
+   *     // returns Matrix [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]
+   *
+   *    math.reshape([1, 2, 3, 4], [-1, 2])
+   *    // returns Matrix [[1, 2], [3, 4]]
+   *
+   * See also:
+   *
+   *     size, squeeze, resize
+   *
+   * @param {Array | Matrix | *} x  Matrix to be reshaped
+   * @param {number[]} sizes        One dimensional array with integral sizes for
+   *                                each dimension. One -1 is allowed as wildcard,
+   *                                which calculates this dimension automatically.
+   *
+   * @return {* | Array | Matrix}   A reshaped clone of matrix `x`
+   *
+   * @throws {TypeError}            If `sizes` does not contain solely integers
+   * @throws {DimensionError}       If the product of the new dimension sizes does
+   *                                not equal that of the old ones
+   */
+  return typed(name, {
+    'Matrix, Array': function Matrix_Array(x, sizes) {
+      return x.reshape(sizes, true);
+    },
+    'Array, Array': function Array_Array(x, sizes) {
+      sizes.forEach(function (size) {
+        if (!isInteger(size)) {
+          throw new TypeError('Invalid size for dimension: ' + size);
+        }
+      });
+      return arrayReshape(x, sizes);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/resize.js b/node_modules/mathjs/lib/esm/function/matrix/resize.js
new file mode 100644
index 0000000..754da28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/resize.js
@@ -0,0 +1,120 @@
+import { isBigNumber, isMatrix } from '../../utils/is.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { ArgumentsError } from '../../error/ArgumentsError.js';
+import { isInteger } from '../../utils/number.js';
+import { format } from '../../utils/string.js';
+import { clone } from '../../utils/object.js';
+import { resize as arrayResize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'resize';
+var dependencies = ['config', 'matrix'];
+export var createResize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    config,
+    matrix
+  } = _ref;
+  /**
+   * Resize a matrix
+   *
+   * Syntax:
+   *
+   *     math.resize(x, size)
+   *     math.resize(x, size, defaultValue)
+   *
+   * Examples:
+   *
+   *     math.resize([1, 2, 3, 4, 5], [3]) // returns Array  [1, 2, 3]
+   *     math.resize([1, 2, 3], [5], 0)    // returns Array  [1, 2, 3, 0, 0]
+   *     math.resize(2, [2, 3], 0)         // returns Matrix [[2, 0, 0], [0, 0, 0]]
+   *     math.resize("hello", [8], "!")    // returns string 'hello!!!'
+   *
+   * See also:
+   *
+   *     size, squeeze, subset, reshape
+   *
+   * @param {Array | Matrix | *} x             Matrix to be resized
+   * @param {Array | Matrix} size              One dimensional array with numbers
+   * @param {number | string} [defaultValue=0] Zero by default, except in
+   *                                           case of a string, in that case
+   *                                           defaultValue = ' '
+   * @return {* | Array | Matrix} A resized clone of matrix `x`
+   */
+  // TODO: rework resize to a typed-function
+  return function resize(x, size, defaultValue) {
+    if (arguments.length !== 2 && arguments.length !== 3) {
+      throw new ArgumentsError('resize', arguments.length, 2, 3);
+    }
+    if (isMatrix(size)) {
+      size = size.valueOf(); // get Array
+    }
+    if (isBigNumber(size[0])) {
+      // convert bignumbers to numbers
+      size = size.map(function (value) {
+        return !isBigNumber(value) ? value : value.toNumber();
+      });
+    }
+
+    // check x is a Matrix
+    if (isMatrix(x)) {
+      // use optimized matrix implementation, return copy
+      return x.resize(size, defaultValue, true);
+    }
+    if (typeof x === 'string') {
+      // resize string
+      return _resizeString(x, size, defaultValue);
+    }
+
+    // check result should be a matrix
+    var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
+    if (size.length === 0) {
+      // output a scalar
+      while (Array.isArray(x)) {
+        x = x[0];
+      }
+      return clone(x);
+    } else {
+      // output an array/matrix
+      if (!Array.isArray(x)) {
+        x = [x];
+      }
+      x = clone(x);
+      var res = arrayResize(x, size, defaultValue);
+      return asMatrix ? matrix(res) : res;
+    }
+  };
+
+  /**
+   * Resize a string
+   * @param {string} str
+   * @param {number[]} size
+   * @param {string} [defaultChar=' ']
+   * @private
+   */
+  function _resizeString(str, size, defaultChar) {
+    if (defaultChar !== undefined) {
+      if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
+        throw new TypeError('Single character expected as defaultValue');
+      }
+    } else {
+      defaultChar = ' ';
+    }
+    if (size.length !== 1) {
+      throw new DimensionError(size.length, 1);
+    }
+    var len = size[0];
+    if (typeof len !== 'number' || !isInteger(len)) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');
+    }
+    if (str.length > len) {
+      return str.substring(0, len);
+    } else if (str.length < len) {
+      var res = str;
+      for (var i = 0, ii = len - str.length; i < ii; i++) {
+        res += defaultChar;
+      }
+      return res;
+    } else {
+      return str;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/rotate.js b/node_modules/mathjs/lib/esm/function/matrix/rotate.js
new file mode 100644
index 0000000..72f0ef8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/rotate.js
@@ -0,0 +1,71 @@
+import { factory } from '../../utils/factory.js';
+import { arraySize } from '../../utils/array.js';
+var name = 'rotate';
+var dependencies = ['typed', 'multiply', 'rotationMatrix'];
+export var createRotate = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    multiply,
+    rotationMatrix
+  } = _ref;
+  /**
+     * Rotate a vector of size 1x2 counter-clockwise by a given angle
+     * Rotate a vector of size 1x3 counter-clockwise by a given angle around the given axis
+     *
+     * Syntax:
+     *
+     *    math.rotate(w, theta)
+     *    math.rotate(w, theta, v)
+     *
+     * Examples:
+     *
+     *    math.rotate([11, 12], math.pi / 2)                           // returns [-12, 11]
+     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns [-12, 11]
+     *
+     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns [0, 1, 0]
+     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns Matrix [0, 1, 0]
+     *
+     *    math.rotate([1, 0], math.complex(1 + i))                     // returns [cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)]
+     *
+     * See also:
+     *
+     *    matrix, rotationMatrix
+     *
+     * @param {Array | Matrix} w                             Vector to rotate
+     * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+     * @param {Array | Matrix} [v]                           Rotation axis
+     * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+     */
+  return typed(name, {
+    'Array , number | BigNumber | Complex | Unit': function Array__number__BigNumber__Complex__Unit(w, theta) {
+      _validateSize(w, 2);
+      var matrixRes = multiply(rotationMatrix(theta), w);
+      return matrixRes.toArray();
+    },
+    'Matrix , number | BigNumber | Complex | Unit': function Matrix__number__BigNumber__Complex__Unit(w, theta) {
+      _validateSize(w, 2);
+      return multiply(rotationMatrix(theta), w);
+    },
+    'Array, number | BigNumber | Complex | Unit, Array | Matrix': function Array_number__BigNumber__Complex__Unit_Array__Matrix(w, theta, v) {
+      _validateSize(w, 3);
+      var matrixRes = multiply(rotationMatrix(theta, v), w);
+      return matrixRes;
+    },
+    'Matrix, number | BigNumber | Complex | Unit, Array | Matrix': function Matrix_number__BigNumber__Complex__Unit_Array__Matrix(w, theta, v) {
+      _validateSize(w, 3);
+      return multiply(rotationMatrix(theta, v), w);
+    }
+  });
+  function _validateSize(v, expectedSize) {
+    var actualSize = Array.isArray(v) ? arraySize(v) : v.size();
+    if (actualSize.length > 2) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+    if (actualSize.length === 2 && actualSize[1] !== 1) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+    if (actualSize[0] !== expectedSize) {
+      throw new RangeError("Vector must be of dimensions 1x".concat(expectedSize));
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js b/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js
new file mode 100644
index 0000000..1d91610
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/rotationMatrix.js
@@ -0,0 +1,160 @@
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'rotationMatrix';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'addScalar', 'unaryMinus', 'norm', 'matrix', 'BigNumber', 'DenseMatrix', 'SparseMatrix', 'cos', 'sin'];
+export var createRotationMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    addScalar,
+    unaryMinus,
+    norm,
+    BigNumber,
+    matrix,
+    DenseMatrix,
+    SparseMatrix,
+    cos,
+    sin
+  } = _ref;
+  /**
+   * Create a 2-dimensional counter-clockwise rotation matrix (2x2) for a given angle (expressed in radians).
+   * Create a 2-dimensional counter-clockwise rotation matrix (3x3) by a given angle (expressed in radians) around a given axis (1x3).
+   *
+   * Syntax:
+   *
+   *    math.rotationMatrix(theta)
+   *    math.rotationMatrix(theta, format)
+   *    math.rotationMatrix(theta, [v])
+   *    math.rotationMatrix(theta, [v], format)
+   *
+   * Examples:
+   *
+   *    math.rotationMatrix(math.pi / 2)                      // returns [[0, -1], [1, 0]]
+   *    math.rotationMatrix(math.bignumber(1))                // returns [[bignumber(cos(1)), bignumber(-sin(1))], [bignumber(sin(1)), bignumber(cos(1))]]
+   *    math.rotationMatrix(math.complex(1 + i))              // returns [[cos(1 + i), -sin(1 + i)], [sin(1 + i), cos(1 + i)]]
+   *    math.rotationMatrix(math.unit('1rad'))                // returns [[cos(1), -sin(1)], [sin(1), cos(1)]]
+   *
+   *    math.rotationMatrix(math.pi / 2, [0, 1, 0])           // returns [[0, 0, 1], [0, 1, 0], [-1, 0, 0]]
+   *    math.rotationMatrix(math.pi / 2, matrix([0, 1, 0]))   // returns matrix([[0, 0, 1], [0, 1, 0], [-1, 0, 0]])
+   *
+   *
+   * See also:
+   *
+   *    matrix, cos, sin
+   *
+   *
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @param {string} [format]                              Result Matrix storage format
+   * @return {Array | Matrix}                              Rotation matrix
+   */
+
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Matrix' ? matrix([]) : [];
+    },
+    string: function string(format) {
+      return matrix(format);
+    },
+    'number | BigNumber | Complex | Unit': function number__BigNumber__Complex__Unit(theta) {
+      return _rotationMatrix2x2(theta, config.matrix === 'Matrix' ? 'dense' : undefined);
+    },
+    'number | BigNumber | Complex | Unit, string': function number__BigNumber__Complex__Unit_string(theta, format) {
+      return _rotationMatrix2x2(theta, format);
+    },
+    'number | BigNumber | Complex | Unit, Array': function number__BigNumber__Complex__Unit_Array(theta, v) {
+      var matrixV = matrix(v);
+      _validateVector(matrixV);
+      return _rotationMatrix3x3(theta, matrixV, undefined);
+    },
+    'number | BigNumber | Complex | Unit, Matrix': function number__BigNumber__Complex__Unit_Matrix(theta, v) {
+      _validateVector(v);
+      var storageType = v.storage() || (config.matrix === 'Matrix' ? 'dense' : undefined);
+      return _rotationMatrix3x3(theta, v, storageType);
+    },
+    'number | BigNumber | Complex | Unit, Array, string': function number__BigNumber__Complex__Unit_Array_string(theta, v, format) {
+      var matrixV = matrix(v);
+      _validateVector(matrixV);
+      return _rotationMatrix3x3(theta, matrixV, format);
+    },
+    'number | BigNumber | Complex | Unit, Matrix, string': function number__BigNumber__Complex__Unit_Matrix_string(theta, v, format) {
+      _validateVector(v);
+      return _rotationMatrix3x3(theta, v, format);
+    }
+  });
+
+  /**
+   * Returns 2x2 matrix of 2D rotation of angle theta
+   *
+   * @param {number | BigNumber | Complex | Unit} theta  The rotation angle
+   * @param {string} format                              The result Matrix storage format
+   * @returns {Matrix}
+   * @private
+   */
+  function _rotationMatrix2x2(theta, format) {
+    var Big = isBigNumber(theta);
+    var minusOne = Big ? new BigNumber(-1) : -1;
+    var cosTheta = cos(theta);
+    var sinTheta = sin(theta);
+    var data = [[cosTheta, multiplyScalar(minusOne, sinTheta)], [sinTheta, cosTheta]];
+    return _convertToFormat(data, format);
+  }
+  function _validateVector(v) {
+    var size = v.size();
+    if (size.length < 1 || size[0] !== 3) {
+      throw new RangeError('Vector must be of dimensions 1x3');
+    }
+  }
+  function _mul(array) {
+    return array.reduce((p, curr) => multiplyScalar(p, curr));
+  }
+  function _convertToFormat(data, format) {
+    if (format) {
+      if (format === 'sparse') {
+        return new SparseMatrix(data);
+      }
+      if (format === 'dense') {
+        return new DenseMatrix(data);
+      }
+      throw new TypeError("Unknown matrix type \"".concat(format, "\""));
+    }
+    return data;
+  }
+
+  /**
+   * Returns a 3x3 matrix of rotation of angle theta around vector v
+   *
+   * @param {number | BigNumber | Complex | Unit} theta The rotation angle
+   * @param {Matrix} v                                  The rotation axis vector
+   * @param {string} format                             The storage format of the resulting matrix
+   * @returns {Matrix}
+   * @private
+   */
+  function _rotationMatrix3x3(theta, v, format) {
+    var normV = norm(v);
+    if (normV === 0) {
+      throw new RangeError('Rotation around zero vector');
+    }
+    var Big = isBigNumber(theta) ? BigNumber : null;
+    var one = Big ? new Big(1) : 1;
+    var minusOne = Big ? new Big(-1) : -1;
+    var vx = Big ? new Big(v.get([0]) / normV) : v.get([0]) / normV;
+    var vy = Big ? new Big(v.get([1]) / normV) : v.get([1]) / normV;
+    var vz = Big ? new Big(v.get([2]) / normV) : v.get([2]) / normV;
+    var c = cos(theta);
+    var oneMinusC = addScalar(one, unaryMinus(c));
+    var s = sin(theta);
+    var r11 = addScalar(c, _mul([vx, vx, oneMinusC]));
+    var r12 = addScalar(_mul([vx, vy, oneMinusC]), _mul([minusOne, vz, s]));
+    var r13 = addScalar(_mul([vx, vz, oneMinusC]), _mul([vy, s]));
+    var r21 = addScalar(_mul([vx, vy, oneMinusC]), _mul([vz, s]));
+    var r22 = addScalar(c, _mul([vy, vy, oneMinusC]));
+    var r23 = addScalar(_mul([vy, vz, oneMinusC]), _mul([minusOne, vx, s]));
+    var r31 = addScalar(_mul([vx, vz, oneMinusC]), _mul([minusOne, vy, s]));
+    var r32 = addScalar(_mul([vy, vz, oneMinusC]), _mul([vx, s]));
+    var r33 = addScalar(c, _mul([vz, vz, oneMinusC]));
+    var data = [[r11, r12, r13], [r21, r22, r23], [r31, r32, r33]];
+    return _convertToFormat(data, format);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/row.js b/node_modules/mathjs/lib/esm/function/matrix/row.js
new file mode 100644
index 0000000..cdfed13
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/row.js
@@ -0,0 +1,59 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { validateIndex } from '../../utils/array.js';
+var name = 'row';
+var dependencies = ['typed', 'Index', 'matrix', 'range'];
+export var createRow = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index,
+    matrix,
+    range
+  } = _ref;
+  /**
+   * Return a row from a Matrix.
+   *
+   * Syntax:
+   *
+   *     math.row(value, index)
+   *
+   * Example:
+   *
+   *     // get a row
+   *     const d = [[1, 2], [3, 4]]
+   *     math.row(d, 1) // returns [[3, 4]]
+   *
+   * See also:
+   *
+   *     column
+   *
+   * @param {Array | Matrix } value   An array or matrix
+   * @param {number} row              The index of the row
+   * @return {Array | Matrix}         The retrieved row
+   */
+  return typed(name, {
+    'Matrix, number': _row,
+    'Array, number': function Array_number(value, row) {
+      return _row(matrix(clone(value)), row).valueOf();
+    }
+  });
+
+  /**
+   * Retrieve a row of a matrix
+   * @param {Matrix } value  A matrix
+   * @param {number} row     The index of the row
+   * @return {Matrix}        The retrieved row
+   */
+  function _row(value, row) {
+    // check dimensions
+    if (value.size().length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    validateIndex(row, value.size()[0]);
+    var columnRange = range(0, value.size()[1]);
+    var index = new Index(row, columnRange);
+    var result = value.subset(index);
+    return isMatrix(result) ? result : matrix([[result]]);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/size.js b/node_modules/mathjs/lib/esm/function/matrix/size.js
new file mode 100644
index 0000000..50355c5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/size.js
@@ -0,0 +1,48 @@
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { noMatrix } from '../../utils/noop.js';
+var name = 'size';
+var dependencies = ['typed', 'config', '?matrix'];
+export var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix
+  } = _ref;
+  /**
+   * Calculate the size of a matrix or scalar.
+   *
+   * Syntax:
+   *
+   *     math.size(x)
+   *
+   * Examples:
+   *
+   *     math.size(2.3)                       // returns []
+   *     math.size('hello world')             // returns [11]
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.size(A)                         // returns [2, 3]
+   *     math.size(math.range(1,6).toArray()) // returns [5]
+   *
+   * See also:
+   *
+   *     count, resize, squeeze, subset
+   *
+   * @param {boolean | number | Complex | Unit | string | Array | Matrix} x  A matrix
+   * @return {Array | Matrix} A vector with size of `x`.
+   */
+  return typed(name, {
+    Matrix: function Matrix(x) {
+      return x.create(x.size(), 'number');
+    },
+    Array: arraySize,
+    string: function string(x) {
+      return config.matrix === 'Array' ? [x.length] : matrix([x.length], 'dense', 'number');
+    },
+    'number | Complex | BigNumber | Unit | boolean | null': function number__Complex__BigNumber__Unit__boolean__null(x) {
+      // scalar
+      return config.matrix === 'Array' ? [] : matrix ? matrix([], 'dense', 'number') : noMatrix();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/sort.js b/node_modules/mathjs/lib/esm/function/matrix/sort.js
new file mode 100644
index 0000000..48c7f29
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/sort.js
@@ -0,0 +1,113 @@
+import { arraySize as size } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'sort';
+var dependencies = ['typed', 'matrix', 'compare', 'compareNatural'];
+export var createSort = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    compare,
+    compareNatural
+  } = _ref;
+  var compareAsc = compare;
+  var compareDesc = (a, b) => -compare(a, b);
+
+  /**
+   * Sort the items in a matrix.
+   *
+   * Syntax:
+   *
+   *    math.sort(x)
+   *    math.sort(x, compare)
+   *
+   * Examples:
+   *
+   *    math.sort([5, 10, 1]) // returns [1, 5, 10]
+   *    math.sort(['C', 'B', 'A', 'D'], math.compareNatural)
+   *    // returns ['A', 'B', 'C', 'D']
+   *
+   *    function sortByLength (a, b) {
+   *      return a.length - b.length
+   *    }
+   *    math.sort(['Langdon', 'Tom', 'Sara'], sortByLength)
+   *    // returns ['Tom', 'Sara', 'Langdon']
+   *
+   * See also:
+   *
+   *    filter, forEach, map, compare, compareNatural
+   *
+   * @param {Matrix | Array} x    A one dimensional matrix or array to sort
+   * @param {Function | 'asc' | 'desc' | 'natural'} [compare='asc']
+   *        An optional _comparator function or name. The function is called as
+   *        `compare(a, b)`, and must return 1 when a > b, -1 when a < b,
+   *        and 0 when a == b.
+   * @return {Matrix | Array} Returns the sorted matrix.
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      _arrayIsVector(x);
+      return x.sort(compareAsc);
+    },
+    Matrix: function Matrix(x) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(compareAsc), x.storage());
+    },
+    'Array, function': function Array_function(x, _comparator) {
+      _arrayIsVector(x);
+      return x.sort(_comparator);
+    },
+    'Matrix, function': function Matrix_function(x, _comparator) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(_comparator), x.storage());
+    },
+    'Array, string': function Array_string(x, order) {
+      _arrayIsVector(x);
+      return x.sort(_comparator(order));
+    },
+    'Matrix, string': function Matrix_string(x, order) {
+      _matrixIsVector(x);
+      return matrix(x.toArray().sort(_comparator(order)), x.storage());
+    }
+  });
+
+  /**
+   * Get the comparator for given order ('asc', 'desc', 'natural')
+   * @param {'asc' | 'desc' | 'natural'} order
+   * @return {Function} Returns a _comparator function
+   */
+  function _comparator(order) {
+    if (order === 'asc') {
+      return compareAsc;
+    } else if (order === 'desc') {
+      return compareDesc;
+    } else if (order === 'natural') {
+      return compareNatural;
+    } else {
+      throw new Error('String "asc", "desc", or "natural" expected');
+    }
+  }
+
+  /**
+   * Validate whether an array is one dimensional
+   * Throws an error when this is not the case
+   * @param {Array} array
+   * @private
+   */
+  function _arrayIsVector(array) {
+    if (size(array).length !== 1) {
+      throw new Error('One dimensional array expected');
+    }
+  }
+
+  /**
+   * Validate whether a matrix is one dimensional
+   * Throws an error when this is not the case
+   * @param {Matrix} matrix
+   * @private
+   */
+  function _matrixIsVector(matrix) {
+    if (matrix.size().length !== 1) {
+      throw new Error('One dimensional matrix expected');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js b/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js
new file mode 100644
index 0000000..8c5aa94
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/sqrtm.js
@@ -0,0 +1,99 @@
+import { isMatrix } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'sqrtm';
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
+export var createSqrtm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    add,
+    multiply,
+    map,
+    sqrt,
+    subtract,
+    inv,
+    size,
+    max,
+    identity
+  } = _ref;
+  var _maxIterations = 1e3;
+  var _tolerance = 1e-6;
+
+  /**
+   * Calculate the principal square root matrix using the Denman–Beavers iterative method
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix#By_Denman–Beavers_iteration
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   * @private
+   */
+  function _denmanBeavers(A) {
+    var error;
+    var iterations = 0;
+    var Y = A;
+    var Z = identity(size(A));
+    do {
+      var Yk = Y;
+      Y = multiply(0.5, add(Yk, inv(Z)));
+      Z = multiply(0.5, add(Z, inv(Yk)));
+      error = max(abs(subtract(Y, Yk)));
+      if (error > _tolerance && ++iterations > _maxIterations) {
+        throw new Error('computing square root of matrix: iterative method could not converge');
+      }
+    } while (error > _tolerance);
+    return Y;
+  }
+
+  /**
+   * Calculate the principal square root of a square matrix.
+   * The principal square root matrix `X` of another matrix `A` is such that `X * X = A`.
+   *
+   * https://en.wikipedia.org/wiki/Square_root_of_a_matrix
+   *
+   * Syntax:
+   *
+   *     math.sqrtm(A)
+   *
+   * Examples:
+   *
+   *     math.sqrtm([[33, 24], [48, 57]]) // returns [[5, 2], [4, 7]]
+   *
+   * See also:
+   *
+   *     sqrt, pow
+   *
+   * @param  {Array | Matrix} A   The square matrix `A`
+   * @return {Array | Matrix}     The principal square root of matrix `A`
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(A) {
+      var size = isMatrix(A) ? A.size() : arraySize(A);
+      switch (size.length) {
+        case 1:
+          // Single element Array | Matrix
+          if (size[0] === 1) {
+            return map(A, sqrt);
+          } else {
+            throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+          }
+        case 2:
+          {
+            // Two-dimensional Array | Matrix
+            var rows = size[0];
+            var cols = size[1];
+            if (rows === cols) {
+              return _denmanBeavers(A);
+            } else {
+              throw new RangeError('Matrix must be square ' + '(size: ' + format(size) + ')');
+            }
+          }
+        default:
+          // Multi dimensional array
+          throw new RangeError('Matrix must be at most two dimensional ' + '(size: ' + format(size) + ')');
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/squeeze.js b/node_modules/mathjs/lib/esm/function/matrix/squeeze.js
new file mode 100644
index 0000000..c40e713
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/squeeze.js
@@ -0,0 +1,53 @@
+import { clone } from '../../utils/object.js';
+import { squeeze as arraySqueeze } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'squeeze';
+var dependencies = ['typed'];
+export var createSqueeze = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a matrix.
+   *
+   * Syntax:
+   *
+   *     math.squeeze(x)
+   *
+   * Examples:
+   *
+   *     math.squeeze([3])           // returns 3
+   *     math.squeeze([[3]])         // returns 3
+   *
+   *     const A = math.zeros(3, 1)    // returns [[0], [0], [0]] (size 3x1)
+   *     math.squeeze(A)             // returns [0, 0, 0] (size 3)
+   *
+   *     const B = math.zeros(1, 3)    // returns [[0, 0, 0]] (size 1x3)
+   *     math.squeeze(B)             // returns [0, 0, 0] (size 3)
+   *
+   *     // only inner and outer dimensions are removed
+   *     const C = math.zeros(2, 1, 3) // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *     math.squeeze(C)             // returns [[[0, 0, 0]], [[0, 0, 0]]] (size 2x1x3)
+   *
+   * See also:
+   *
+   *     subset
+   *
+   * @param {Matrix | Array} x      Matrix to be squeezed
+   * @return {Matrix | Array} Squeezed matrix
+   */
+  return typed(name, {
+    Array: function Array(x) {
+      return arraySqueeze(clone(x));
+    },
+    Matrix: function Matrix(x) {
+      var res = arraySqueeze(x.toArray());
+      // FIXME: return the same type of matrix as the input
+      return Array.isArray(res) ? x.create(res, x.datatype()) : res;
+    },
+    any: function any(x) {
+      // scalar
+      return clone(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/subset.js b/node_modules/mathjs/lib/esm/function/matrix/subset.js
new file mode 100644
index 0000000..df44b6d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/subset.js
@@ -0,0 +1,273 @@
+import { isIndex } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { isEmptyIndex, validateIndex, validateIndexSourceSize } from '../../utils/array.js';
+import { getSafeProperty, setSafeProperty } from '../../utils/customs.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+var name = 'subset';
+var dependencies = ['typed', 'matrix', 'zeros', 'add'];
+export var createSubset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    zeros,
+    add
+  } = _ref;
+  /**
+   * Get or set a subset of a matrix or string.
+   *
+   * Syntax:
+   *     math.subset(value, index)                                // retrieve a subset
+   *     math.subset(value, index, replacement [, defaultValue])  // replace a subset
+   *
+   * Examples:
+   *
+   *     // get a subset
+   *     const d = [[1, 2], [3, 4]]
+   *     math.subset(d, math.index(1, 0))             // returns 3
+   *     math.subset(d, math.index([0, 1], 1))        // returns [[2], [4]]
+   *     math.subset(d, math.index([false, true], 0)) // returns [[3]]
+   *
+   *     // replace a subset
+   *     const e = []
+   *     const f = math.subset(e, math.index(0, [0, 2]), [5, 6])  // f = [[5, 0, 6]]
+   *     const g = math.subset(f, math.index(1, 1), 7, 0)         // g = [[5, 0, 6], [0, 7, 0]]
+   *     math.subset(g, math.index([false, true], 1), 8)          // returns [[5, 0, 6], [0, 8, 0]]
+   *
+   *     // get submatrix using ranges
+   *     const M = [
+   *       [1,2,3],
+   *       [4,5,6],
+   *       [7,8,9]
+   *     ]
+   *     math.subset(M, math.index(math.range(0,2), math.range(0,3))) // [[1, 2, 3], [4, 5, 6]]
+   *
+   * See also:
+   *
+   *     size, resize, squeeze, index
+   *
+   * @param {Array | Matrix | string} matrix  An array, matrix, or string
+   * @param {Index} index
+   *    For each dimension of the target, specifies an index or a list of
+   *    indices to fetch or set. `subset` uses the cartesian product of
+   *    the indices specified in each dimension.
+   * @param {*} [replacement]                 An array, matrix, or scalar.
+   *                                          If provided, the subset is replaced with replacement.
+   *                                          If not provided, the subset is returned
+   * @param {*} [defaultValue=undefined]      Default value, filled in on new entries when
+   *                                          the matrix is resized. If not provided,
+   *                                          math.matrix elements will be left undefined.
+   * @return {Array | Matrix | string} Either the retrieved subset or the updated matrix.
+   */
+
+  return typed(name, {
+    // get subset
+    'Matrix, Index': function Matrix_Index(value, index) {
+      if (isEmptyIndex(index)) {
+        return matrix();
+      }
+      validateIndexSourceSize(value, index);
+      return value.subset(index);
+    },
+    'Array, Index': typed.referTo('Matrix, Index', function (subsetRef) {
+      return function (value, index) {
+        var subsetResult = subsetRef(matrix(value), index);
+        return index.isScalar() ? subsetResult : subsetResult.valueOf();
+      };
+    }),
+    'Object, Index': _getObjectProperty,
+    'string, Index': _getSubstring,
+    // set subset
+    'Matrix, Index, any, any': function Matrix_Index_any_any(value, index, replacement, defaultValue) {
+      if (isEmptyIndex(index)) {
+        return value;
+      }
+      validateIndexSourceSize(value, index);
+      return value.clone().subset(index, _broadcastReplacement(replacement, index), defaultValue);
+    },
+    'Array, Index, any, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement, defaultValue) {
+        var subsetResult = subsetRef(matrix(value), index, replacement, defaultValue);
+        return subsetResult.isMatrix ? subsetResult.valueOf() : subsetResult;
+      };
+    }),
+    'Array, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement) {
+        return subsetRef(matrix(value), index, replacement, undefined).valueOf();
+      };
+    }),
+    'Matrix, Index, any': typed.referTo('Matrix, Index, any, any', function (subsetRef) {
+      return function (value, index, replacement) {
+        return subsetRef(value, index, replacement, undefined);
+      };
+    }),
+    'string, Index, string': _setSubstring,
+    'string, Index, string, string': _setSubstring,
+    'Object, Index, any': _setObjectProperty
+  });
+
+  /**
+   * Broadcasts a replacment value to be the same size as index
+   * @param {number | BigNumber | Array | Matrix} replacement Replacement value to try to broadcast
+   * @param {*} index Index value
+   * @returns broadcasted replacement that matches the size of index
+   */
+
+  function _broadcastReplacement(replacement, index) {
+    if (typeof replacement === 'string') {
+      throw new Error('can\'t boradcast a string');
+    }
+    if (index._isScalar) {
+      return replacement;
+    }
+    var indexSize = index.size();
+    if (indexSize.every(d => d > 0)) {
+      try {
+        return add(replacement, zeros(indexSize));
+      } catch (error) {
+        return replacement;
+      }
+    } else {
+      return replacement;
+    }
+  }
+});
+
+/**
+ * Retrieve a subset of a string
+ * @param {string} str            string from which to get a substring
+ * @param {Index} index           An index or list of indices (character positions)
+ * @returns {string} substring
+ * @private
+ */
+function _getSubstring(str, index) {
+  if (!isIndex(index)) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+  if (isEmptyIndex(index)) {
+    return '';
+  }
+  validateIndexSourceSize(Array.from(str), index);
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size().length, 1);
+  }
+
+  // validate whether the range is out of range
+  var strLen = str.length;
+  validateIndex(index.min()[0], strLen);
+  validateIndex(index.max()[0], strLen);
+  var range = index.dimension(0);
+  var substr = '';
+  range.forEach(function (v) {
+    substr += str.charAt(v);
+  });
+  return substr;
+}
+
+/**
+ * Replace a substring in a string
+ * @param {string} str            string to be replaced
+ * @param {Index} index           An index or list of indices (character positions)
+ * @param {string} replacement    Replacement string
+ * @param {string} [defaultValue] Default value to be used when resizing
+ *                                the string. is ' ' by default
+ * @returns {string} result
+ * @private
+ */
+function _setSubstring(str, index, replacement, defaultValue) {
+  if (!index || index.isIndex !== true) {
+    // TODO: better error message
+    throw new TypeError('Index expected');
+  }
+  if (isEmptyIndex(index)) {
+    return str;
+  }
+  validateIndexSourceSize(Array.from(str), index);
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size().length, 1);
+  }
+  if (defaultValue !== undefined) {
+    if (typeof defaultValue !== 'string' || defaultValue.length !== 1) {
+      throw new TypeError('Single character expected as defaultValue');
+    }
+  } else {
+    defaultValue = ' ';
+  }
+  var range = index.dimension(0);
+  var len = range.size()[0];
+  if (len !== replacement.length) {
+    throw new DimensionError(range.size()[0], replacement.length);
+  }
+
+  // validate whether the range is out of range
+  var strLen = str.length;
+  validateIndex(index.min()[0]);
+  validateIndex(index.max()[0]);
+
+  // copy the string into an array with characters
+  var chars = [];
+  for (var i = 0; i < strLen; i++) {
+    chars[i] = str.charAt(i);
+  }
+  range.forEach(function (v, i) {
+    chars[v] = replacement.charAt(i[0]);
+  });
+
+  // initialize undefined characters with a space
+  if (chars.length > strLen) {
+    for (var _i = strLen - 1, _len = chars.length; _i < _len; _i++) {
+      if (!chars[_i]) {
+        chars[_i] = defaultValue;
+      }
+    }
+  }
+  return chars.join('');
+}
+
+/**
+ * Retrieve a property from an object
+ * @param {Object} object
+ * @param {Index} index
+ * @return {*} Returns the value of the property
+ * @private
+ */
+function _getObjectProperty(object, index) {
+  if (isEmptyIndex(index)) {
+    return undefined;
+  }
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size(), 1);
+  }
+  var key = index.dimension(0);
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+  return getSafeProperty(object, key);
+}
+
+/**
+ * Set a property on an object
+ * @param {Object} object
+ * @param {Index} index
+ * @param {*} replacement
+ * @return {*} Returns the updated object
+ * @private
+ */
+function _setObjectProperty(object, index, replacement) {
+  if (isEmptyIndex(index)) {
+    return object;
+  }
+  if (index.size().length !== 1) {
+    throw new DimensionError(index.size(), 1);
+  }
+  var key = index.dimension(0);
+  if (typeof key !== 'string') {
+    throw new TypeError('String expected as index to retrieve an object property');
+  }
+
+  // clone the object, and apply the property to the clone
+  var updated = clone(object);
+  setSafeProperty(updated, key, replacement);
+  return updated;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/trace.js b/node_modules/mathjs/lib/esm/function/matrix/trace.js
new file mode 100644
index 0000000..1d94b48
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/trace.js
@@ -0,0 +1,128 @@
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'trace';
+var dependencies = ['typed', 'matrix', 'add'];
+export var createTrace = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    add
+  } = _ref;
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   *
+   * Syntax:
+   *
+   *    math.trace(x)
+   *
+   * Examples:
+   *
+   *    math.trace([[1, 2], [3, 4]]) // returns 5
+   *
+   *    const A = [
+   *      [1, 2, 3],
+   *      [-1, 2, 3],
+   *      [2, 0, 3]
+   *    ]
+   *    math.trace(A) // returns 6
+   *
+   * See also:
+   *
+   *    diag
+   *
+   * @param {Array | Matrix} x  A matrix
+   *
+   * @return {number} The trace of `x`
+   */
+  return typed('trace', {
+    Array: function _arrayTrace(x) {
+      // use dense matrix implementation
+      return _denseTrace(matrix(x));
+    },
+    SparseMatrix: _sparseTrace,
+    DenseMatrix: _denseTrace,
+    any: clone
+  });
+  function _denseTrace(m) {
+    // matrix size & data
+    var size = m._size;
+    var data = m._data;
+
+    // process dimensions
+    switch (size.length) {
+      case 1:
+        // vector
+        if (size[0] === 1) {
+          // return data[0]
+          return clone(data[0]);
+        }
+        throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+      case 2:
+        {
+          // two dimensional
+          var rows = size[0];
+          var cols = size[1];
+          if (rows === cols) {
+            // calulate sum
+            var sum = 0;
+            // loop diagonal
+            for (var i = 0; i < rows; i++) {
+              sum = add(sum, data[i][i]);
+            }
+            // return trace
+            return sum;
+          } else {
+            throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+          }
+        }
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be two dimensional (size: ' + format(size) + ')');
+    }
+  }
+  function _sparseTrace(m) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    var size = m._size;
+    // check dimensions
+    var rows = size[0];
+    var columns = size[1];
+    // matrix must be square
+    if (rows === columns) {
+      // calulate sum
+      var sum = 0;
+      // check we have data (avoid looping columns)
+      if (values.length > 0) {
+        // loop columns
+        for (var j = 0; j < columns; j++) {
+          // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+          var k0 = ptr[j];
+          var k1 = ptr[j + 1];
+          // loop k within [k0, k1[
+          for (var k = k0; k < k1; k++) {
+            // row index
+            var i = index[k];
+            // check row
+            if (i === j) {
+              // accumulate value
+              sum = add(sum, values[k]);
+              // exit loop
+              break;
+            }
+            if (i > j) {
+              // exit loop, no value on the diagonal for column j
+              break;
+            }
+          }
+        }
+      }
+      // return trace
+      return sum;
+    }
+    throw new RangeError('Matrix must be square (size: ' + format(size) + ')');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/transpose.js b/node_modules/mathjs/lib/esm/function/matrix/transpose.js
new file mode 100644
index 0000000..c786b67
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/transpose.js
@@ -0,0 +1,160 @@
+import { clone } from '../../utils/object.js';
+import { format } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'transpose';
+var dependencies = ['typed', 'matrix'];
+export var createTranspose = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only applicable to two dimensional matrices containing
+   * a vector (i.e. having size `[1,n]` or `[n,1]`). One dimensional
+   * vectors and scalars return the input unchanged.
+   *
+   * Syntax:
+   *
+   *     math.transpose(x)
+   *
+   * Examples:
+   *
+   *     const A = [[1, 2, 3], [4, 5, 6]]
+   *     math.transpose(A)               // returns [[1, 4], [2, 5], [3, 6]]
+   *
+   * See also:
+   *
+   *     diag, inv, subset, squeeze
+   *
+   * @param {Array | Matrix} x  Matrix to be transposed
+   * @return {Array | Matrix}   The transposed matrix
+   */
+  return typed(name, {
+    Array: x => transposeMatrix(matrix(x)).valueOf(),
+    Matrix: transposeMatrix,
+    any: clone // scalars
+  });
+  function transposeMatrix(x) {
+    // matrix size
+    var size = x.size();
+
+    // result
+    var c;
+
+    // process dimensions
+    switch (size.length) {
+      case 1:
+        // vector
+        c = x.clone();
+        break;
+      case 2:
+        {
+          // rows and columns
+          var rows = size[0];
+          var columns = size[1];
+
+          // check columns
+          if (columns === 0) {
+            // throw exception
+            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + format(size) + ')');
+          }
+
+          // process storage format
+          switch (x.storage()) {
+            case 'dense':
+              c = _denseTranspose(x, rows, columns);
+              break;
+            case 'sparse':
+              c = _sparseTranspose(x, rows, columns);
+              break;
+          }
+        }
+        break;
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + format(size) + ')');
+    }
+    return c;
+  }
+  function _denseTranspose(m, rows, columns) {
+    // matrix array
+    var data = m._data;
+    // transposed matrix data
+    var transposed = [];
+    var transposedRow;
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // initialize row
+      transposedRow = transposed[j] = [];
+      // loop rows
+      for (var i = 0; i < rows; i++) {
+        // set data
+        transposedRow[i] = clone(data[i][j]);
+      }
+    }
+    // return matrix
+    return m.createDenseMatrix({
+      data: transposed,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+  function _sparseTranspose(m, rows, columns) {
+    // matrix arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    // result matrices
+    var cvalues = values ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+    // row counts
+    var w = [];
+    for (var x = 0; x < rows; x++) {
+      w[x] = 0;
+    }
+    // vars
+    var p, l, j;
+    // loop values in matrix
+    for (p = 0, l = index.length; p < l; p++) {
+      // number of values in row
+      w[index[p]]++;
+    }
+    // cumulative sum
+    var sum = 0;
+    // initialize cptr with the cummulative sum of row counts
+    for (var i = 0; i < rows; i++) {
+      // update cptr
+      cptr.push(sum);
+      // update sum
+      sum += w[i];
+      // update w
+      w[i] = cptr[i];
+    }
+    // update cptr
+    cptr.push(sum);
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // values & index in column
+      for (var k0 = ptr[j], k1 = ptr[j + 1], k = k0; k < k1; k++) {
+        // C values & index
+        var q = w[index[k]]++;
+        // C[j, i] = A[i, j]
+        cindex[q] = j;
+        // check we need to process values (pattern matrix)
+        if (values) {
+          cvalues[q] = clone(values[k]);
+        }
+      }
+    }
+    // return matrix
+    return m.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [columns, rows],
+      datatype: m._datatype
+    });
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/matrix/zeros.js b/node_modules/mathjs/lib/esm/function/matrix/zeros.js
new file mode 100644
index 0000000..5c19506
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/matrix/zeros.js
@@ -0,0 +1,123 @@
+import { isBigNumber } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { resize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'zeros';
+var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
+export var createZeros = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   *
+   * Syntax:
+   *
+   *    math.zeros(m)
+   *    math.zeros(m, format)
+   *    math.zeros(m, n)
+   *    math.zeros(m, n, format)
+   *    math.zeros([m, n])
+   *    math.zeros([m, n], format)
+   *
+   * Examples:
+   *
+   *    math.zeros()                   // returns []
+   *    math.zeros(3)                  // returns [0, 0, 0]
+   *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
+   *    math.zeros(3, 'dense')         // returns [0, 0, 0]
+   *
+   *    const A = [[1, 2, 3], [4, 5, 6]]
+   *    math.zeros(math.size(A))       // returns [[0, 0, 0], [0, 0, 0]]
+   *
+   * See also:
+   *
+   *    ones, identity, size, range
+   *
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
+   * @param {string} [format]           The Matrix storage format
+   *
+   * @return {Array | Matrix}           A matrix filled with zeros
+   */
+  return typed(name, {
+    '': function _() {
+      return config.matrix === 'Array' ? _zeros([]) : _zeros([], 'default');
+    },
+    // math.zeros(m, n, p, ..., format)
+    // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
+    '...number | BigNumber | string': function number__BigNumber__string(size) {
+      var last = size[size.length - 1];
+      if (typeof last === 'string') {
+        var format = size.pop();
+        return _zeros(size, format);
+      } else if (config.matrix === 'Array') {
+        return _zeros(size);
+      } else {
+        return _zeros(size, 'default');
+      }
+    },
+    Array: _zeros,
+    Matrix: function Matrix(size) {
+      var format = size.storage();
+      return _zeros(size.valueOf(), format);
+    },
+    'Array | Matrix, string': function Array__Matrix_string(size, format) {
+      return _zeros(size.valueOf(), format);
+    }
+  });
+
+  /**
+   * Create an Array or Matrix with zeros
+   * @param {Array} size
+   * @param {string} [format='default']
+   * @return {Array | Matrix}
+   * @private
+   */
+  function _zeros(size, format) {
+    var hasBigNumbers = _normalize(size);
+    var defaultValue = hasBigNumbers ? new BigNumber(0) : 0;
+    _validate(size);
+    if (format) {
+      // return a matrix
+      var m = matrix(format);
+      if (size.length > 0) {
+        return m.resize(size, defaultValue);
+      }
+      return m;
+    } else {
+      // return an Array
+      var arr = [];
+      if (size.length > 0) {
+        return resize(arr, size, defaultValue);
+      }
+      return arr;
+    }
+  }
+
+  // replace BigNumbers with numbers, returns true if size contained BigNumbers
+  function _normalize(size) {
+    var hasBigNumbers = false;
+    size.forEach(function (value, index, arr) {
+      if (isBigNumber(value)) {
+        hasBigNumbers = true;
+        arr[index] = value.toNumber();
+      }
+    });
+    return hasBigNumbers;
+  }
+
+  // validate arguments
+  function _validate(size) {
+    size.forEach(function (value) {
+      if (typeof value !== 'number' || !isInteger(value) || value < 0) {
+        throw new Error('Parameters in function zeros must be positive integers');
+      }
+    });
+  }
+});
+
+// TODO: zeros contains almost the same code as ones. Reuse this?
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/numeric/solveODE.js b/node_modules/mathjs/lib/esm/function/numeric/solveODE.js
new file mode 100644
index 0000000..367c42e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/numeric/solveODE.js
@@ -0,0 +1,284 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+import { isUnit, isNumber, isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'solveODE';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'max', 'map', 'abs', 'isPositive', 'isNegative', 'larger', 'smaller', 'matrix', 'bignumber', 'unaryMinus'];
+export var createSolveODE = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    max,
+    map,
+    abs,
+    isPositive,
+    isNegative,
+    larger,
+    smaller,
+    matrix,
+    bignumber,
+    unaryMinus
+  } = _ref;
+  /**
+     * Numerical Integration of Ordinary Differential Equations
+     *
+     * Two variable step methods are provided:
+     * - "RK23": Bogacki–Shampine method
+     * - "RK45": Dormand-Prince method RK5(4)7M (default)
+     *
+     * The arguments are expected as follows.
+     *
+     * - `func` should be the forcing function `f(t, y)`
+     * - `tspan` should be a vector of two numbers or units `[tStart, tEnd]`
+     * - `y0` the initial state values, should be a scalar or a flat array
+     * - `options` should be an object with the following information:
+     *   - `method` ('RK45'): ['RK23', 'RK45']
+     *   - `tol` (1e-3): Numeric tolerance of the method, the solver keeps the error estimates less than this value
+     *   - `firstStep`: Initial step size
+     *   - `minStep`: minimum step size of the method
+     *   - `maxStep`: maximum step size of the method
+     *   - `minDelta` (0.2): minimum ratio of change for the step
+     *   - `maxDelta` (5): maximum ratio of change for the step
+     *   - `maxIter` (1e4): maximum number of iterations
+     *
+     * The returned value is an object with `{t, y}` please note that even though `t` means time, it can represent any other independant variable like `x`:
+     * - `t` an array of size `[n]`
+     * - `y` the states array can be in two ways
+     *   - **if `y0` is a scalar:** returns an array-like of size `[n]`
+     *   - **if `y0` is a flat array-like of size [m]:** returns an array like of size `[n, m]`
+     *
+     * Syntax:
+     *
+     *     math.solveODE(func, tspan, y0)
+     *     math.solveODE(func, tspan, y0, options)
+     *
+     * Examples:
+     *
+     *     function func(t, y) {return y}
+     *     const tspan = [0, 4]
+     *     const y0 = 1
+     *     math.solveODE(func, tspan, y0)
+     *     math.solveODE(func, tspan, [1, 2])
+     *     math.solveODE(func, tspan, y0, { method:"RK23", maxStep:0.1 })
+     *
+     * See also:
+     *
+     *     derivative, simplifyCore
+     *
+     * @param {function} func The forcing function f(t,y)
+     * @param {Array | Matrix} tspan The time span
+     * @param {number | BigNumber | Unit | Array | Matrix} y0 The initial value
+     * @param {Object} [options] Optional configuration options
+     * @return {Object} Return an object with t and y values as arrays
+     */
+
+  function _rk(butcherTableau) {
+    // generates an adaptive runge kutta method from it's butcher tableau
+
+    return function (f, tspan, y0, options) {
+      // adaptive runge kutta methods
+      var wrongTSpan = !(tspan.length === 2 && (tspan.every(isNumOrBig) || tspan.every(isUnit)));
+      if (wrongTSpan) {
+        throw new Error('"tspan" must be an Array of two numeric values or two units [tStart, tEnd]');
+      }
+      var t0 = tspan[0]; // initial time
+      var tf = tspan[1]; // final time
+      var isForwards = larger(tf, t0);
+      var firstStep = options.firstStep;
+      if (firstStep !== undefined && !isPositive(firstStep)) {
+        throw new Error('"firstStep" must be positive');
+      }
+      var maxStep = options.maxStep;
+      if (maxStep !== undefined && !isPositive(maxStep)) {
+        throw new Error('"maxStep" must be positive');
+      }
+      var minStep = options.minStep;
+      if (minStep && isNegative(minStep)) {
+        throw new Error('"minStep" must be positive or zero');
+      }
+      var timeVars = [t0, tf, firstStep, minStep, maxStep].filter(x => x !== undefined);
+      if (!(timeVars.every(isNumOrBig) || timeVars.every(isUnit))) {
+        throw new Error('Inconsistent type of "t" dependant variables');
+      }
+      var steps = 1; // divide time in this number of steps
+      var tol = options.tol ? options.tol : 1e-4; // define a tolerance (must be an option)
+      var minDelta = options.minDelta ? options.minDelta : 0.2;
+      var maxDelta = options.maxDelta ? options.maxDelta : 5;
+      var maxIter = options.maxIter ? options.maxIter : 10000; // stop inifite evaluation if something goes wrong
+      var hasBigNumbers = [t0, tf, ...y0, maxStep, minStep].some(isBigNumber);
+      var [a, c, b, bp] = hasBigNumbers ? [bignumber(butcherTableau.a), bignumber(butcherTableau.c), bignumber(butcherTableau.b), bignumber(butcherTableau.bp)] : [butcherTableau.a, butcherTableau.c, butcherTableau.b, butcherTableau.bp];
+      var h = firstStep ? isForwards ? firstStep : unaryMinus(firstStep) : divide(subtract(tf, t0), steps); // define the first step size
+      var t = [t0]; // start the time array
+      var y = [y0]; // start the solution array
+
+      var deltaB = subtract(b, bp); // b - bp
+
+      var n = 0;
+      var iter = 0;
+      var ongoing = _createOngoing(isForwards);
+      var trimStep = _createTrimStep(isForwards);
+      // iterate unitil it reaches either the final time or maximum iterations
+      while (ongoing(t[n], tf)) {
+        var k = [];
+
+        // trim the time step so that it doesn't overshoot
+        h = trimStep(t[n], tf, h);
+
+        // calculate the first value of k
+        k.push(f(t[n], y[n]));
+
+        // calculate the rest of the values of k
+        for (var i = 1; i < c.length; ++i) {
+          k.push(f(add(t[n], multiply(c[i], h)), add(y[n], multiply(h, a[i], k))));
+        }
+
+        // estimate the error by comparing solutions of different orders
+        var TE = max(abs(map(multiply(deltaB, k), X => isUnit(X) ? X.value : X)));
+        if (TE < tol && tol / TE > 1 / 4) {
+          // push solution if within tol
+          t.push(add(t[n], h));
+          y.push(add(y[n], multiply(h, b, k)));
+          n++;
+        }
+
+        // estimate the delta value that will affect the step size
+        var delta = 0.84 * (tol / TE) ** (1 / 5);
+        if (smaller(delta, minDelta)) {
+          delta = minDelta;
+        } else if (larger(delta, maxDelta)) {
+          delta = maxDelta;
+        }
+        delta = hasBigNumbers ? bignumber(delta) : delta;
+        h = multiply(h, delta);
+        if (maxStep && larger(abs(h), maxStep)) {
+          h = isForwards ? maxStep : unaryMinus(maxStep);
+        } else if (minStep && smaller(abs(h), minStep)) {
+          h = isForwards ? minStep : unaryMinus(minStep);
+        }
+        iter++;
+        if (iter > maxIter) {
+          throw new Error('Maximum number of iterations reached, try changing options');
+        }
+      }
+      return {
+        t,
+        y
+      };
+    };
+  }
+  function _rk23(f, tspan, y0, options) {
+    // Bogacki–Shampine method
+
+    // Define the butcher table
+    var a = [[], [1 / 2], [0, 3 / 4], [2 / 9, 1 / 3, 4 / 9]];
+    var c = [null, 1 / 2, 3 / 4, 1];
+    var b = [2 / 9, 1 / 3, 4 / 9, 0];
+    var bp = [7 / 24, 1 / 4, 1 / 3, 1 / 8];
+    var butcherTableau = {
+      a,
+      c,
+      b,
+      bp
+    };
+
+    // Solve an adaptive step size rk method
+    return _rk(butcherTableau)(f, tspan, y0, options);
+  }
+  function _rk45(f, tspan, y0, options) {
+    // Dormand Prince method
+
+    // Define the butcher tableau
+    var a = [[], [1 / 5], [3 / 40, 9 / 40], [44 / 45, -56 / 15, 32 / 9], [19372 / 6561, -25360 / 2187, 64448 / 6561, -212 / 729], [9017 / 3168, -355 / 33, 46732 / 5247, 49 / 176, -5103 / 18656], [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84]];
+    var c = [null, 1 / 5, 3 / 10, 4 / 5, 8 / 9, 1, 1];
+    var b = [35 / 384, 0, 500 / 1113, 125 / 192, -2187 / 6784, 11 / 84, 0];
+    var bp = [5179 / 57600, 0, 7571 / 16695, 393 / 640, -92097 / 339200, 187 / 2100, 1 / 40];
+    var butcherTableau = {
+      a,
+      c,
+      b,
+      bp
+    };
+
+    // Solve an adaptive step size rk method
+    return _rk(butcherTableau)(f, tspan, y0, options);
+  }
+  function _solveODE(f, tspan, y0, opt) {
+    var method = opt.method ? opt.method : 'RK45';
+    var methods = {
+      RK23: _rk23,
+      RK45: _rk45
+    };
+    if (method.toUpperCase() in methods) {
+      var methodOptions = _objectSpread({}, opt); // clone the options object
+      delete methodOptions.method; // delete the method as it won't be needed
+      return methods[method.toUpperCase()](f, tspan, y0, methodOptions);
+    } else {
+      // throw an error indicating there is no such method
+      var methodsWithQuotes = Object.keys(methods).map(x => "\"".concat(x, "\""));
+      // generates a string of methods like: "BDF", "RK23" and "RK45"
+      var availableMethodsString = "".concat(methodsWithQuotes.slice(0, -1).join(', '), " and ").concat(methodsWithQuotes.slice(-1));
+      throw new Error("Unavailable method \"".concat(method, "\". Available methods are ").concat(availableMethodsString));
+    }
+  }
+  function _createOngoing(isForwards) {
+    // returns the correct function to test if it's still iterating
+    return isForwards ? smaller : larger;
+  }
+  function _createTrimStep(isForwards) {
+    var outOfBounds = isForwards ? larger : smaller;
+    return function (t, tf, h) {
+      var next = add(t, h);
+      return outOfBounds(next, tf) ? subtract(tf, t) : h;
+    };
+  }
+  function isNumOrBig(x) {
+    // checks if it's a number or bignumber
+    return isBigNumber(x) || isNumber(x);
+  }
+  function _matrixSolveODE(f, T, y0, options) {
+    // receives matrices and returns matrices
+    var sol = _solveODE(f, T.toArray(), y0.toArray(), options);
+    return {
+      t: matrix(sol.t),
+      y: matrix(sol.y)
+    };
+  }
+  return typed('solveODE', {
+    'function, Array, Array, Object': _solveODE,
+    'function, Matrix, Matrix, Object': _matrixSolveODE,
+    'function, Array, Array': (f, T, y0) => _solveODE(f, T, y0, {}),
+    'function, Matrix, Matrix': (f, T, y0) => _matrixSolveODE(f, T, y0, {}),
+    'function, Array, number | BigNumber | Unit': (f, T, y0) => {
+      var sol = _solveODE(f, T, [y0], {});
+      return {
+        t: sol.t,
+        y: sol.y.map(Y => Y[0])
+      };
+    },
+    'function, Matrix, number | BigNumber | Unit': (f, T, y0) => {
+      var sol = _solveODE(f, T.toArray(), [y0], {});
+      return {
+        t: matrix(sol.t),
+        y: matrix(sol.y.map(Y => Y[0]))
+      };
+    },
+    'function, Array, number | BigNumber | Unit, Object': (f, T, y0, options) => {
+      var sol = _solveODE(f, T, [y0], options);
+      return {
+        t: sol.t,
+        y: sol.y.map(Y => Y[0])
+      };
+    },
+    'function, Matrix, number | BigNumber | Unit, Object': (f, T, y0, options) => {
+      var sol = _solveODE(f, T.toArray(), [y0], options);
+      return {
+        t: matrix(sol.t),
+        y: matrix(sol.y.map(Y => Y[0]))
+      };
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/combinations.js b/node_modules/mathjs/lib/esm/function/probability/combinations.js
new file mode 100644
index 0000000..cb3ac43
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/combinations.js
@@ -0,0 +1,69 @@
+import { factory } from '../../utils/factory.js';
+import { combinationsNumber } from '../../plain/number/combinations.js';
+var name = 'combinations';
+var dependencies = ['typed'];
+export var createCombinations = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities.
+   *
+   * Combinations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.combinations(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinations(7, 5) // returns 21
+   *
+   * See also:
+   *
+   *    combinationsWithRep, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations.
+   */
+  return typed(name, {
+    'number, number': combinationsNumber,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var nMinusk = n.minus(k);
+      var one = new BigNumber(1);
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinations');
+      }
+      if (k.gt(n)) {
+        throw new TypeError('k must be less than n in function combinations');
+      }
+      result = one;
+      if (k.lt(nMinusk)) {
+        for (i = one; i.lte(nMinusk); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusk.plus(i)).dividedBy(i);
+        }
+      }
+      return result;
+    }
+
+    // TODO: implement support for collection in combinations
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js b/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js
new file mode 100644
index 0000000..e6ab046
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/combinationsWithRep.js
@@ -0,0 +1,84 @@
+import { factory } from '../../utils/factory.js';
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+var name = 'combinationsWithRep';
+var dependencies = ['typed'];
+export var createCombinationsWithRep = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the number of ways of picking `k` unordered outcomes from `n`
+   * possibilities, allowing individual outcomes to be repeated more than once.
+   *
+   * CombinationsWithRep only takes integer arguments.
+   * The following condition must be enforced: k <= n + k -1.
+   *
+   * Syntax:
+   *
+   *     math.combinationsWithRep(n, k)
+   *
+   * Examples:
+   *
+   *    math.combinationsWithRep(7, 5) // returns 462
+   *
+   * See also:
+   *
+   *    combinations, permutations, factorial
+   *
+   * @param {number | BigNumber} n    Total number of objects in the set
+   * @param {number | BigNumber} k    Number of objects in the subset
+   * @return {number | BigNumber}     Number of possible combinations with replacement.
+   */
+  return typed(name, {
+    'number, number': function number_number(n, k) {
+      if (!isInteger(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (!isInteger(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (n < 1) {
+        throw new TypeError('k must be less than or equal to n + k - 1');
+      }
+      if (k < n - 1) {
+        var _prodrange = product(n, n + k - 1);
+        return _prodrange / product(1, k);
+      }
+      var prodrange = product(k + 1, n + k - 1);
+      return prodrange / product(1, n - 1);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(n, k) {
+      var BigNumber = n.constructor;
+      var result, i;
+      var one = new BigNumber(1);
+      var nMinusOne = n.minus(one);
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function combinationsWithRep');
+      }
+      if (n.lt(one)) {
+        throw new TypeError('k must be less than or equal to n + k - 1 in function combinationsWithRep');
+      }
+      result = one;
+      if (k.lt(nMinusOne)) {
+        for (i = one; i.lte(nMinusOne); i = i.plus(one)) {
+          result = result.times(k.plus(i)).dividedBy(i);
+        }
+      } else {
+        for (i = one; i.lte(k); i = i.plus(one)) {
+          result = result.times(nMinusOne.plus(i)).dividedBy(i);
+        }
+      }
+      return result;
+    }
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/factorial.js b/node_modules/mathjs/lib/esm/function/probability/factorial.js
new file mode 100644
index 0000000..3cfd21d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/factorial.js
@@ -0,0 +1,47 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'factorial';
+var dependencies = ['typed', 'gamma'];
+export var createFactorial = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    gamma
+  } = _ref;
+  /**
+   * Compute the factorial of a value
+   *
+   * Factorial only supports an integer value as argument.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.factorial(n)
+   *
+   * Examples:
+   *
+   *    math.factorial(5)    // returns 120
+   *    math.factorial(3)    // returns 6
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, gamma, permutations
+   *
+   * @param {number | BigNumber | Array | Matrix} n   An integer number
+   * @return {number | BigNumber | Array | Matrix}    The factorial of `n`
+   */
+  return typed(name, {
+    number: function number(n) {
+      if (n < 0) {
+        throw new Error('Value must be non-negative');
+      }
+      return gamma(n + 1);
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.isNegative()) {
+        throw new Error('Value must be non-negative');
+      }
+      return gamma(n.plus(1));
+    },
+    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/gamma.js b/node_modules/mathjs/lib/esm/function/probability/gamma.js
new file mode 100644
index 0000000..dce043b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/gamma.js
@@ -0,0 +1,120 @@
+import { factory } from '../../utils/factory.js';
+import { gammaG, gammaNumber, gammaP } from '../../plain/number/index.js';
+var name = 'gamma';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'pow', 'BigNumber', 'Complex'];
+export var createGamma = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    pow,
+    BigNumber: _BigNumber,
+    Complex
+  } = _ref;
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large values.
+   *
+   * To avoid confusion with the matrix Gamma function, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.gamma(n)
+   *
+   * Examples:
+   *
+   *    math.gamma(5)       // returns 24
+   *    math.gamma(-0.5)    // returns -3.5449077018110335
+   *    math.gamma(math.i)  // returns -0.15494982830180973 - 0.49801566811835596i
+   *
+   * See also:
+   *
+   *    combinations, factorial, permutations
+   *
+   * @param {number | BigNumber | Complex} n   A real or complex number
+   * @return {number | BigNumber | Complex}    The gamma of `n`
+   */
+
+  function gammaComplex(n) {
+    if (n.im === 0) {
+      return gammaNumber(n.re);
+    }
+
+    // Lanczos approximation doesn't work well with real part lower than 0.5
+    // So reflection formula is required
+    if (n.re < 0.5) {
+      // Euler's reflection formula
+      // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+      // thanks to imperfect sin implementation sin(PI * n) != 0
+      // we can safely use it anyway
+      var _t = new Complex(1 - n.re, -n.im);
+      var r = new Complex(Math.PI * n.re, Math.PI * n.im);
+      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(_t));
+    }
+
+    // Lanczos approximation
+    // z -= 1
+    n = new Complex(n.re - 1, n.im);
+
+    // x = gammaPval[0]
+    var x = new Complex(gammaP[0], 0);
+    // for (i, gammaPval) in enumerate(gammaP):
+    for (var i = 1; i < gammaP.length; ++i) {
+      // x += gammaPval / (z + i)
+      var gammaPval = new Complex(gammaP[i], 0);
+      x = x.add(gammaPval.div(n.add(i)));
+    }
+    // t = z + gammaG + 0.5
+    var t = new Complex(n.re + gammaG + 0.5, n.im);
+
+    // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+    var twoPiSqrt = Math.sqrt(2 * Math.PI);
+    var tpow = t.pow(n.add(0.5));
+    var expt = t.neg().exp();
+
+    // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+    return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+  }
+  return typed(name, {
+    number: gammaNumber,
+    Complex: gammaComplex,
+    BigNumber: function BigNumber(n) {
+      if (n.isInteger()) {
+        return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
+      }
+      if (!n.isFinite()) {
+        return new _BigNumber(n.isNegative() ? NaN : Infinity);
+      }
+      throw new Error('Integer BigNumber expected');
+    }
+  });
+
+  /**
+   * Calculate factorial for a BigNumber
+   * @param {BigNumber} n
+   * @returns {BigNumber} Returns the factorial of n
+   */
+  function bigFactorial(n) {
+    if (n < 8) {
+      return new _BigNumber([1, 1, 2, 6, 24, 120, 720, 5040][n]);
+    }
+    var precision = config.precision + (Math.log(n.toNumber()) | 0);
+    var Big = _BigNumber.clone({
+      precision
+    });
+    if (n % 2 === 1) {
+      return n.times(bigFactorial(new _BigNumber(n - 1)));
+    }
+    var p = n;
+    var prod = new Big(n);
+    var sum = n.toNumber();
+    while (p > 2) {
+      p -= 2;
+      sum += p;
+      prod = prod.times(sum);
+    }
+    return new _BigNumber(prod.toPrecision(_BigNumber.precision));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/kldivergence.js b/node_modules/mathjs/lib/esm/function/probability/kldivergence.js
new file mode 100644
index 0000000..ed4c4de
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/kldivergence.js
@@ -0,0 +1,77 @@
+import { factory } from '../../utils/factory.js';
+var name = 'kldivergence';
+var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];
+export var createKldivergence = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    divide,
+    sum,
+    multiply,
+    map,
+    dotDivide,
+    log,
+    isNumeric
+  } = _ref;
+  /**
+     * Calculate the Kullback-Leibler (KL) divergence  between two distributions
+     *
+     * Syntax:
+     *
+     *     math.kldivergence(x, y)
+     *
+     * Examples:
+     *
+     *     math.kldivergence([0.7,0.5,0.4], [0.2,0.9,0.5])   //returns 0.24376698773121153
+     *
+     *
+     * @param  {Array | Matrix} q    First vector
+     * @param  {Array | Matrix} p    Second vector
+     * @return {number}              Returns distance between q and p
+     */
+  return typed(name, {
+    'Array, Array': function Array_Array(q, p) {
+      return _kldiv(matrix(q), matrix(p));
+    },
+    'Matrix, Array': function Matrix_Array(q, p) {
+      return _kldiv(q, matrix(p));
+    },
+    'Array, Matrix': function Array_Matrix(q, p) {
+      return _kldiv(matrix(q), p);
+    },
+    'Matrix, Matrix': function Matrix_Matrix(q, p) {
+      return _kldiv(q, p);
+    }
+  });
+  function _kldiv(q, p) {
+    var plength = p.size().length;
+    var qlength = q.size().length;
+    if (plength > 1) {
+      throw new Error('first object must be one dimensional');
+    }
+    if (qlength > 1) {
+      throw new Error('second object must be one dimensional');
+    }
+    if (plength !== qlength) {
+      throw new Error('Length of two vectors must be equal');
+    }
+
+    // Before calculation, apply normalization
+    var sumq = sum(q);
+    if (sumq === 0) {
+      throw new Error('Sum of elements in first object must be non zero');
+    }
+    var sump = sum(p);
+    if (sump === 0) {
+      throw new Error('Sum of elements in second object must be non zero');
+    }
+    var qnorm = divide(q, sum(q));
+    var pnorm = divide(p, sum(p));
+    var result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), x => log(x))));
+    if (isNumeric(result)) {
+      return result;
+    } else {
+      return Number.NaN;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/lgamma.js b/node_modules/mathjs/lib/esm/function/probability/lgamma.js
new file mode 100644
index 0000000..4d45914
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/lgamma.js
@@ -0,0 +1,137 @@
+/* eslint-disable no-loss-of-precision */
+
+// References
+// ----------
+// [1] Hare, "Computing the Principal Branch of log-Gamma", Journal of Algorithms, 1997.
+// [2] https://math.stackexchange.com/questions/1338753/how-do-i-calculate-values-for-gamma-function-with-complex-arguments
+
+import { lgammaNumber, lnSqrt2PI } from '../../plain/number/index.js';
+import { factory } from '../../utils/factory.js';
+import { copysign } from '../../utils/number.js';
+var name = 'lgamma';
+var dependencies = ['Complex', 'typed'];
+export var createLgamma = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Complex,
+    typed
+  } = _ref;
+  // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get
+  // sufficient accuracy.
+  //
+  // These two values are copied from Scipy implementation:
+  // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L37
+  var SMALL_RE = 7;
+  var SMALL_IM = 7;
+
+  /**
+   * The coefficients are B[2*n]/(2*n*(2*n - 1)) where B[2*n] is the (2*n)th Bernoulli number. See (1.1) in [1].
+   *
+   * If you cannot access the paper, can also get these values from the formula in [2].
+   *
+   *    1 /     12 = 0.00833333333333333333333333333333
+   *    1 /    360 = 0.00277777777777777777777777777778
+   * ...
+   * 3617 / 133400 = 0.02955065359477124183006535947712
+   */
+  var coeffs = [-2.955065359477124183e-2, 6.4102564102564102564e-3, -1.9175269175269175269e-3, 8.4175084175084175084e-4, -5.952380952380952381e-4, 7.9365079365079365079e-4, -2.7777777777777777778e-3, 8.3333333333333333333e-2];
+
+  /**
+   * Logarithm of the gamma function for real, positive numbers and complex numbers,
+   * using Lanczos approximation for numbers and Stirling series for complex numbers.
+   *
+   * Syntax:
+   *
+   *    math.lgamma(n)
+   *
+   * Examples:
+   *
+   *    math.lgamma(5)       // returns 3.178053830347945
+   *    math.lgamma(0)       // returns Infinity
+   *    math.lgamma(-0.5)    // returns NaN
+   *    math.lgamma(math.i)  // returns -0.6509231993018536 - 1.8724366472624294i
+   *
+   * See also:
+   *
+   *    gamma
+   *
+   * @param {number | Complex} n   A real or complex number
+   * @return {number | Complex}    The log gamma of `n`
+   */
+  return typed(name, {
+    number: lgammaNumber,
+    Complex: lgammaComplex,
+    BigNumber: function BigNumber() {
+      throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber");
+    }
+  });
+  function lgammaComplex(n) {
+    var TWOPI = 6.2831853071795864769252842; // 2*pi
+    var LOGPI = 1.1447298858494001741434262; // log(pi)
+
+    var REFLECTION = 0.1;
+    if (n.isNaN()) {
+      return new Complex(NaN, NaN);
+    } else if (n.im === 0) {
+      return new Complex(lgammaNumber(n.re), 0);
+    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
+      return lgammaStirling(n);
+    } else if (n.re <= REFLECTION) {
+      // Reflection formula. see Proposition 3.1 in [1]
+      var tmp = copysign(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25);
+      var a = n.mul(Math.PI).sin().log();
+      var b = lgammaComplex(new Complex(1 - n.re, -n.im));
+      return new Complex(LOGPI, tmp).sub(a).sub(b);
+    } else if (n.im >= 0) {
+      return lgammaRecurrence(n);
+    } else {
+      return lgammaRecurrence(n.conjugate()).conjugate();
+    }
+  }
+  function lgammaStirling(z) {
+    // formula ref in [2]
+    // computation ref:
+    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L101
+
+    // left part
+
+    // x (log(x) - 1) + 1/2 (log(2PI) - log(x))
+    // => (x - 0.5) * log(x) - x + log(2PI) / 2
+    var leftPart = z.sub(0.5).mul(z.log()).sub(z).add(lnSqrt2PI);
+
+    // right part
+
+    var rz = new Complex(1, 0).div(z);
+    var rzz = rz.div(z);
+    var a = coeffs[0];
+    var b = coeffs[1];
+    var r = 2 * rzz.re;
+    var s = rzz.re * rzz.re + rzz.im * rzz.im;
+    for (var i = 2; i < 8; i++) {
+      var tmp = b;
+      b = -s * a + coeffs[i];
+      a = r * a + tmp;
+    }
+    var rightPart = rz.mul(rzz.mul(a).add(b));
+
+    // plus left and right
+
+    return leftPart.add(rightPart);
+  }
+  function lgammaRecurrence(z) {
+    // computation ref:
+    // https://github.com/scipy/scipy/blob/v1.8.0/scipy/special/_loggamma.pxd#L78
+
+    var signflips = 0;
+    var sb = 0;
+    var shiftprod = z;
+    z = z.add(1);
+    while (z.re <= SMALL_RE) {
+      shiftprod = shiftprod.mul(z);
+      var nsb = shiftprod.im < 0 ? 1 : 0;
+      if (nsb !== 0 && sb === 0) signflips++;
+      sb = nsb;
+      z = z.add(1);
+    }
+    return lgammaStirling(z).sub(shiftprod.log()).sub(new Complex(0, signflips * 2 * Math.PI * 1));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/multinomial.js b/node_modules/mathjs/lib/esm/function/probability/multinomial.js
new file mode 100644
index 0000000..76f2ae5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/multinomial.js
@@ -0,0 +1,50 @@
+import { deepForEach } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'multinomial';
+var dependencies = ['typed', 'add', 'divide', 'multiply', 'factorial', 'isInteger', 'isPositive'];
+export var createMultinomial = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide,
+    multiply,
+    factorial,
+    isInteger,
+    isPositive
+  } = _ref;
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1, a2, ..., ai unordered outcomes from `n` possibilities.
+   *
+   * multinomial takes one array of integers as an argument.
+   * The following condition must be enforced: every ai <= 0
+   *
+   * Syntax:
+   *
+   *     math.multinomial(a) // a is an array type
+   *
+   * Examples:
+   *
+   *    math.multinomial([1,2,1]) // returns 12
+   *
+   * See also:
+   *
+   *    combinations, factorial
+   *
+   * @param {number[] | BigNumber[]} a    Integer numbers of objects in the subset
+   * @return {Number | BigNumber}         Multinomial coefficient.
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(a) {
+      var sum = 0;
+      var denom = 1;
+      deepForEach(a, function (ai) {
+        if (!isInteger(ai) || !isPositive(ai)) {
+          throw new TypeError('Positive integer value expected in function multinomial');
+        }
+        sum = add(sum, ai);
+        denom = multiply(denom, factorial(ai));
+      });
+      return divide(factorial(sum), denom);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/permutations.js b/node_modules/mathjs/lib/esm/function/probability/permutations.js
new file mode 100644
index 0000000..8373396
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/permutations.js
@@ -0,0 +1,78 @@
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+import { factory } from '../../utils/factory.js';
+var name = 'permutations';
+var dependencies = ['typed', 'factorial'];
+export var createPermutations = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    factorial
+  } = _ref;
+  /**
+   * Compute the number of ways of obtaining an ordered subset of `k` elements
+   * from a set of `n` elements.
+   *
+   * Permutations only takes integer arguments.
+   * The following condition must be enforced: k <= n.
+   *
+   * Syntax:
+   *
+   *     math.permutations(n)
+   *     math.permutations(n, k)
+   *
+   * Examples:
+   *
+   *    math.permutations(5)     // 120
+   *    math.permutations(5, 3)  // 60
+   *
+   * See also:
+   *
+   *    combinations, combinationsWithRep, factorial
+   *
+   * @param {number | BigNumber} n   The number of objects in total
+   * @param {number | BigNumber} [k] The number of objects in the subset
+   * @return {number | BigNumber}    The number of permutations
+   */
+  return typed(name, {
+    'number | BigNumber': factorial,
+    'number, number': function number_number(n, k) {
+      if (!isInteger(n) || n < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (!isInteger(k) || k < 0) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (k > n) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+      // Permute n objects, k at a time
+      return product(n - k + 1, n);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(n, k) {
+      var result, i;
+      if (!isPositiveInteger(n) || !isPositiveInteger(k)) {
+        throw new TypeError('Positive integer value expected in function permutations');
+      }
+      if (k.gt(n)) {
+        throw new TypeError('second argument k must be less than or equal to first argument n');
+      }
+      var one = n.mul(0).add(1);
+      result = one;
+      for (i = n.minus(k).plus(1); i.lte(n); i = i.plus(1)) {
+        result = result.times(i);
+      }
+      return result;
+    }
+
+    // TODO: implement support for collection in permutations
+  });
+});
+
+/**
+ * Test whether BigNumber n is a positive integer
+ * @param {BigNumber} n
+ * @returns {boolean} isPositiveInteger
+ */
+function isPositiveInteger(n) {
+  return n.isInteger() && n.gte(0);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/pickRandom.js b/node_modules/mathjs/lib/esm/function/probability/pickRandom.js
new file mode 100644
index 0000000..b11c95c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/pickRandom.js
@@ -0,0 +1,150 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { isMatrix, isNumber } from '../../utils/is.js';
+import { createRng } from './util/seededRNG.js';
+var name = 'pickRandom';
+var dependencies = ['typed', 'config', '?on'];
+export var createPickRandom = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Random pick one or more values from a one dimensional array.
+   * Array elements are picked using a random function with uniform or weighted distribution.
+   *
+   * Syntax:
+   *
+   *     math.pickRandom(array)
+   *     math.pickRandom(array, number)
+   *     math.pickRandom(array, weights)
+   *     math.pickRandom(array, number, weights)
+   *     math.pickRandom(array, weights, number)
+   *     math.pickRandom(array, { weights, number, elementWise })
+   *
+   * Examples:
+   *
+   *     math.pickRandom([3, 6, 12, 2])                  // returns one of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], 2)               // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], { number: 2 })   // returns an array of two of the values in the array
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1])    // returns one of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], 2, [1, 3, 2, 1]) // returns an array of two of the values in the array with weighted distribution
+   *     math.pickRandom([3, 6, 12, 2], [1, 3, 2, 1], 2) // returns an array of two of the values in the array with weighted distribution
+   *
+   *     math.pickRandom([{x: 1.0, y: 2.0}, {x: 1.1, y: 2.0}], { elementWise: false })
+   *         // returns one of the items in the array
+   *
+   * See also:
+   *
+   *     random, randomInt
+   *
+   * @param {Array | Matrix} array     A one dimensional array
+   * @param {Int} number               An int or float
+   * @param {Array | Matrix} weights   An array of ints or floats
+   * @return {number | Array}          Returns a single random value from array when number is undefined.
+   *                                   Returns an array with the configured number of elements when number is defined.
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(possibles) {
+      return _pickRandom(possibles, {});
+    },
+    'Array | Matrix, Object': function Array__Matrix_Object(possibles, options) {
+      return _pickRandom(possibles, options);
+    },
+    'Array | Matrix, number': function Array__Matrix_number(possibles, number) {
+      return _pickRandom(possibles, {
+        number
+      });
+    },
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(possibles, weights) {
+      return _pickRandom(possibles, {
+        weights
+      });
+    },
+    'Array | Matrix, Array | Matrix, number': function Array__Matrix_Array__Matrix_number(possibles, weights, number) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    },
+    'Array | Matrix, number, Array | Matrix': function Array__Matrix_number_Array__Matrix(possibles, number, weights) {
+      return _pickRandom(possibles, {
+        number,
+        weights
+      });
+    }
+  });
+
+  /**
+   * @param {Array | Matrix} possibles
+   * @param {{
+   *   number?: number,
+   *   weights?: Array | Matrix,
+   *   elementWise: boolean
+   * }} options
+   * @returns {number | Array}
+   * @private
+   */
+  function _pickRandom(possibles, _ref2) {
+    var {
+      number,
+      weights,
+      elementWise = true
+    } = _ref2;
+    var single = typeof number === 'undefined';
+    if (single) {
+      number = 1;
+    }
+    var createMatrix = isMatrix(possibles) ? possibles.create : isMatrix(weights) ? weights.create : null;
+    possibles = possibles.valueOf(); // get Array
+    if (weights) {
+      weights = weights.valueOf(); // get Array
+    }
+    if (elementWise === true) {
+      possibles = flatten(possibles);
+      weights = flatten(weights);
+    }
+    var totalWeights = 0;
+    if (typeof weights !== 'undefined') {
+      if (weights.length !== possibles.length) {
+        throw new Error('Weights must have the same length as possibles');
+      }
+      for (var i = 0, len = weights.length; i < len; i++) {
+        if (!isNumber(weights[i]) || weights[i] < 0) {
+          throw new Error('Weights must be an array of positive numbers');
+        }
+        totalWeights += weights[i];
+      }
+    }
+    var length = possibles.length;
+    var result = [];
+    var pick;
+    while (result.length < number) {
+      if (typeof weights === 'undefined') {
+        pick = possibles[Math.floor(rng() * length)];
+      } else {
+        var randKey = rng() * totalWeights;
+        for (var _i = 0, _len = possibles.length; _i < _len; _i++) {
+          randKey -= weights[_i];
+          if (randKey < 0) {
+            pick = possibles[_i];
+            break;
+          }
+        }
+      }
+      result.push(pick);
+    }
+    return single ? result[0] : createMatrix ? createMatrix(result) : result;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/random.js b/node_modules/mathjs/lib/esm/function/probability/random.js
new file mode 100644
index 0000000..dc2b5ff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/random.js
@@ -0,0 +1,96 @@
+import { factory } from '../../utils/factory.js';
+import { isMatrix } from '../../utils/is.js';
+import { createRng } from './util/seededRNG.js';
+import { randomMatrix } from './util/randomMatrix.js';
+var name = 'random';
+var dependencies = ['typed', 'config', '?on'];
+export var createRandom = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Return a random number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.random()                // generate a random number between 0 and 1
+   *     math.random(max)             // generate a random number between 0 and max
+   *     math.random(min, max)        // generate a random number between min and max
+   *     math.random(size)            // generate a matrix with random numbers between 0 and 1
+   *     math.random(size, max)       // generate a matrix with random numbers between 0 and max
+   *     math.random(size, min, max)  // generate a matrix with random numbers between min and max
+   *
+   * Examples:
+   *
+   *     math.random()       // returns a random number between 0 and 1
+   *     math.random(100)    // returns a random number between 0 and 100
+   *     math.random(30, 40) // returns a random number between 30 and 40
+   *     math.random([2, 3]) // returns a 2x3 matrix with random numbers between 0 and 1
+   *
+   * See also:
+   *
+   *     randomInt, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random number
+   */
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max),
+    'Array | Matrix': size => _randomMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomMatrix(size, min, max)
+  });
+  function _randomMatrix(size, min, max) {
+    var res = randomMatrix(size.valueOf(), () => _random(min, max));
+    return isMatrix(size) ? size.create(res, 'number') : res;
+  }
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
+
+// number only implementation of random, no matrix support
+// TODO: there is quite some duplicate code in both createRandom and createRandomNumber, can we improve that?
+export var createRandomNumber = /* #__PURE__ */factory(name, ['typed', 'config', '?on'], _ref2 => {
+  var {
+    typed,
+    config,
+    on,
+    matrix
+  } = _ref2;
+  // seeded pseudo random number generator1
+  var rng = createRng(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+  return typed(name, {
+    '': () => _random(0, 1),
+    number: max => _random(0, max),
+    'number, number': (min, max) => _random(min, max)
+  });
+  function _random(min, max) {
+    return min + rng() * (max - min);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/randomInt.js b/node_modules/mathjs/lib/esm/function/probability/randomInt.js
new file mode 100644
index 0000000..f396b83
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/randomInt.js
@@ -0,0 +1,90 @@
+import { factory } from '../../utils/factory.js';
+import { randomMatrix } from './util/randomMatrix.js';
+import { createRng } from './util/seededRNG.js';
+import { isMatrix } from '../../utils/is.js';
+var name = 'randomInt';
+var dependencies = ['typed', 'config', 'log2', '?on'];
+export var createRandomInt = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    log2,
+    on
+  } = _ref;
+  // seeded pseudo random number generator
+  var rng = createRng(config.randomSeed);
+  if (on) {
+    on('config', function (curr, prev) {
+      if (curr.randomSeed !== prev.randomSeed) {
+        rng = createRng(curr.randomSeed);
+      }
+    });
+  }
+
+  /**
+   * Return a random integer number larger or equal to `min` and smaller than `max`
+   * using a uniform distribution.
+   *
+   * Syntax:
+   *
+   *     math.randomInt()                // generate either 0 or 1, randomly
+   *     math.randomInt(max)             // generate a random integer between 0 and max
+   *     math.randomInt(min, max)        // generate a random integer between min and max
+   *     math.randomInt(size)            // generate a matrix with random integer between 0 and 1
+   *     math.randomInt(size, max)       // generate a matrix with random integer between 0 and max
+   *     math.randomInt(size, min, max)  // generate a matrix with random integer between min and max
+   *
+   * Examples:
+   *
+   *     math.randomInt(100)    // returns a random integer between 0 and 100
+   *     math.randomInt(30, 40) // returns a random integer between 30 and 40
+   *     math.randomInt([2, 3]) // returns a 2x3 matrix with random integers between 0 and 1
+   *
+   * See also:
+   *
+   *     random, pickRandom
+   *
+   * @param {Array | Matrix} [size] If provided, an array or matrix with given
+   *                                size and filled with random values is returned
+   * @param {number} [min]  Minimum boundary for the random value, included
+   * @param {number} [max]  Maximum boundary for the random value, excluded
+   * @return {number | Array | Matrix} A random integer value
+   */
+  return typed(name, {
+    '': () => _randomInt(0, 2),
+    number: max => _randomInt(0, max),
+    'number, number': (min, max) => _randomInt(min, max),
+    bigint: max => _randomBigint(0n, max),
+    'bigint, bigint': _randomBigint,
+    'Array | Matrix': size => _randomIntMatrix(size, 0, 1),
+    'Array | Matrix, number': (size, max) => _randomIntMatrix(size, 0, max),
+    'Array | Matrix, number, number': (size, min, max) => _randomIntMatrix(size, min, max)
+  });
+  function _randomIntMatrix(size, min, max) {
+    var res = randomMatrix(size.valueOf(), () => _randomInt(min, max));
+    return isMatrix(size) ? size.create(res, 'number') : res;
+  }
+  function _randomInt(min, max) {
+    return Math.floor(min + rng() * (max - min));
+  }
+  function _randomBigint(min, max) {
+    var simpleCutoff = 2n ** 30n;
+    var width = max - min; // number of choices
+    if (width <= simpleCutoff) {
+      // do it with number type
+      return min + BigInt(_randomInt(0, Number(width)));
+    }
+    // Too big to choose accurately that way. Instead, choose the correct
+    // number of random bits to cover the width, and repeat until the
+    // resulting number falls within the width
+    var bits = log2(width);
+    var picked = width;
+    while (picked >= width) {
+      picked = 0n;
+      for (var i = 0; i < bits; ++i) {
+        picked = 2n * picked + (rng() < 0.5 ? 0n : 1n);
+      }
+    }
+    return min + picked;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js b/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js
new file mode 100644
index 0000000..385f991
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/util/randomMatrix.js
@@ -0,0 +1,20 @@
+/**
+ * This is a util function for generating a random matrix recursively.
+ * @param {number[]} size
+ * @param {function} random
+ * @returns {Array}
+ */
+export function randomMatrix(size, random) {
+  var data = [];
+  size = size.slice(0);
+  if (size.length > 1) {
+    for (var i = 0, length = size.shift(); i < length; i++) {
+      data.push(randomMatrix(size, random));
+    }
+  } else {
+    for (var _i = 0, _length = size.shift(); _i < _length; _i++) {
+      data.push(random());
+    }
+  }
+  return data;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js b/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js
new file mode 100644
index 0000000..9da3f78
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/probability/util/seededRNG.js
@@ -0,0 +1,19 @@
+import seedrandom from 'seedrandom';
+var singletonRandom = /* #__PURE__ */seedrandom(Date.now());
+export function createRng(randomSeed) {
+  var random;
+
+  // create a new random generator with given seed
+  function setSeed(seed) {
+    random = seed === null ? singletonRandom : seedrandom(String(seed));
+  }
+
+  // initialize a seeded pseudo random number generator with config's random seed
+  setSeed(randomSeed);
+
+  // wrapper function so the rng can be updated via generator
+  function rng() {
+    return random();
+  }
+  return rng;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compare.js b/node_modules/mathjs/lib/esm/function/relational/compare.js
new file mode 100644
index 0000000..f579a8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compare.js
@@ -0,0 +1,114 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatAlgo05xSfSf } from '../../type/matrix/utils/matAlgo05xSfSf.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'compare';
+var dependencies = ['typed', 'config', 'matrix', 'equalScalar', 'BigNumber', 'Fraction', 'DenseMatrix', 'concat'];
+export var createCompare = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    BigNumber,
+    Fraction,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo05xSfSf = createMatAlgo05xSfSf({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * x and y are considered equal when the relative difference between x and y
+   * is smaller than the configured absTol and relTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.compare(x, y)
+   *
+   * Examples:
+   *
+   *    math.compare(6, 1)           // returns 1
+   *    math.compare(2, 3)           // returns -1
+   *    math.compare(7, 7)           // returns 0
+   *    math.compare('10', '2')      // returns 1
+   *    math.compare('1000', '1e3')  // returns 0
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compare(a, b)           // returns 1
+   *
+   *    math.compare(2, [1, 2, 3])   // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, largerEq, compareNatural, compareText
+   *
+   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | Unit | string | Array | Matrix} y Second value to compare
+   * @return {number | BigNumber | bigint | Fraction | Array | Matrix} Returns the result of the comparison:
+   *                                                          1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, createCompareNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': function boolean_boolean(x, y) {
+      return x === y ? 0 : x > y ? 1 : -1;
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return bigNearlyEqual(x, y, config.relTol, config.absTol) ? new BigNumber(0) : new BigNumber(x.cmp(y));
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x === y ? 0n : x > y ? 1n : -1n;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return new Fraction(x.compare(y));
+    },
+    'Complex, Complex': function Complex_Complex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo05xSfSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createCompareNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return nearlyEqual(x, y, config.relTol, config.absTol) ? 0 : x > y ? 1 : -1;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compareNatural.js b/node_modules/mathjs/lib/esm/function/relational/compareNatural.js
new file mode 100644
index 0000000..04394fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compareNatural.js
@@ -0,0 +1,274 @@
+import naturalSort from 'javascript-natural-sort';
+import { isDenseMatrix, isSparseMatrix, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'compareNatural';
+var dependencies = ['typed', 'compare'];
+export var createCompareNatural = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compare
+  } = _ref;
+  var compareBooleans = compare.signatures['boolean,boolean'];
+
+  /**
+   * Compare two values of any type in a deterministic, natural way.
+   *
+   * For numeric values, the function works the same as `math.compare`.
+   * For types of values that can't be compared mathematically,
+   * the function compares in a natural way.
+   *
+   * For numeric values, x and y are considered equal when the relative
+   * difference between x and y is smaller than the configured relTol and absTol.
+   * The function cannot be used to compare values smaller than
+   * approximately 2.22e-16.
+   *
+   * For Complex numbers, first the real parts are compared. If equal,
+   * the imaginary parts are compared.
+   *
+   * Strings are compared with a natural sorting algorithm, which
+   * orders strings in a "logic" way following some heuristics.
+   * This differs from the function `compare`, which converts the string
+   * into a numeric value and compares that. The function `compareText`
+   * on the other hand compares text lexically.
+   *
+   * Arrays and Matrices are compared value by value until there is an
+   * unequal pair of values encountered. Objects are compared by sorted
+   * keys until the keys or their values are unequal.
+   *
+   * Syntax:
+   *
+   *    math.compareNatural(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareNatural(6, 1)              // returns 1
+   *    math.compareNatural(2, 3)              // returns -1
+   *    math.compareNatural(7, 7)              // returns 0
+   *
+   *    math.compareNatural('10', '2')         // returns 1
+   *    math.compareText('10', '2')            // returns -1
+   *    math.compare('10', '2')                // returns 1
+   *
+   *    math.compareNatural('Answer: 10', 'Answer: 2') // returns 1
+   *    math.compareText('Answer: 10', 'Answer: 2')    // returns -1
+   *    math.compare('Answer: 10', 'Answer: 2')
+   *        // Error: Cannot convert "Answer: 10" to a number
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('40 mm')
+   *    math.compareNatural(a, b)              // returns 1
+   *
+   *    const c = math.complex('2 + 3i')
+   *    const d = math.complex('2 + 4i')
+   *    math.compareNatural(c, d)              // returns -1
+   *
+   *    math.compareNatural([1, 2, 4], [1, 2, 3]) // returns 1
+   *    math.compareNatural([1, 2, 3], [1, 2])    // returns 1
+   *    math.compareNatural([1, 5], [1, 2, 3])    // returns 1
+   *    math.compareNatural([1, 2], [1, 2])       // returns 0
+   *
+   *    math.compareNatural({a: 2}, {a: 4})       // returns -1
+   *
+   * See also:
+   *
+   *    compare, compareText
+   *
+   * @param  {*} x First value to compare
+   * @param  {*} y Second value to compare
+   * @return {number} Returns the result of the comparison:
+   *                  1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, {
+    'any, any': _compareNatural
+  }); // just to check # args
+
+  function _compareNatural(x, y) {
+    var typeX = typeOf(x);
+    var typeY = typeOf(y);
+    var c;
+
+    // numeric types
+    if ((typeX === 'number' || typeX === 'BigNumber' || typeX === 'Fraction') && (typeY === 'number' || typeY === 'BigNumber' || typeY === 'Fraction')) {
+      c = compare(x, y);
+      if (c.toString() !== '0') {
+        // c can be number, BigNumber, or Fraction
+        return c > 0 ? 1 : -1; // return a number
+      } else {
+        return naturalSort(typeX, typeY);
+      }
+    }
+
+    // matrix types
+    var matTypes = ['Array', 'DenseMatrix', 'SparseMatrix'];
+    if (matTypes.includes(typeX) || matTypes.includes(typeY)) {
+      c = compareMatricesAndArrays(_compareNatural, x, y);
+      if (c !== 0) {
+        return c;
+      } else {
+        return naturalSort(typeX, typeY);
+      }
+    }
+
+    // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
+    if (typeX !== typeY) {
+      return naturalSort(typeX, typeY);
+    }
+    if (typeX === 'Complex') {
+      return compareComplexNumbers(x, y);
+    }
+    if (typeX === 'Unit') {
+      if (x.equalBase(y)) {
+        return _compareNatural(x.value, y.value);
+      }
+
+      // compare by units
+      return compareArrays(_compareNatural, x.formatUnits(), y.formatUnits());
+    }
+    if (typeX === 'boolean') {
+      return compareBooleans(x, y);
+    }
+    if (typeX === 'string') {
+      return naturalSort(x, y);
+    }
+    if (typeX === 'Object') {
+      return compareObjects(_compareNatural, x, y);
+    }
+    if (typeX === 'null') {
+      return 0;
+    }
+    if (typeX === 'undefined') {
+      return 0;
+    }
+
+    // this should not occur...
+    throw new TypeError('Unsupported type of value "' + typeX + '"');
+  }
+
+  /**
+   * Compare mixed matrix/array types, by converting to same-shaped array.
+   * This comparator is non-deterministic regarding input types.
+   * @param {Array | SparseMatrix | DenseMatrix | *} x
+   * @param {Array | SparseMatrix | DenseMatrix | *} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareMatricesAndArrays(compareNatural, x, y) {
+    if (isSparseMatrix(x) && isSparseMatrix(y)) {
+      return compareArrays(compareNatural, x.toJSON().values, y.toJSON().values);
+    }
+    if (isSparseMatrix(x)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x.toArray(), y);
+    }
+    if (isSparseMatrix(y)) {
+      // note: convert to array is expensive
+      return compareMatricesAndArrays(compareNatural, x, y.toArray());
+    }
+
+    // convert DenseArray into Array
+    if (isDenseMatrix(x)) {
+      return compareMatricesAndArrays(compareNatural, x.toJSON().data, y);
+    }
+    if (isDenseMatrix(y)) {
+      return compareMatricesAndArrays(compareNatural, x, y.toJSON().data);
+    }
+
+    // convert scalars to array
+    if (!Array.isArray(x)) {
+      return compareMatricesAndArrays(compareNatural, [x], y);
+    }
+    if (!Array.isArray(y)) {
+      return compareMatricesAndArrays(compareNatural, x, [y]);
+    }
+    return compareArrays(compareNatural, x, y);
+  }
+
+  /**
+   * Compare two Arrays
+   *
+   * - First, compares value by value
+   * - Next, if all corresponding values are equal,
+   *   look at the length: longest array will be considered largest
+   *
+   * @param {Array} x
+   * @param {Array} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareArrays(compareNatural, x, y) {
+    // compare each value
+    for (var i = 0, ii = Math.min(x.length, y.length); i < ii; i++) {
+      var v = compareNatural(x[i], y[i]);
+      if (v !== 0) {
+        return v;
+      }
+    }
+
+    // compare the size of the arrays
+    if (x.length > y.length) {
+      return 1;
+    }
+    if (x.length < y.length) {
+      return -1;
+    }
+
+    // both Arrays have equal size and content
+    return 0;
+  }
+
+  /**
+   * Compare two objects
+   *
+   * - First, compare sorted property names
+   * - Next, compare the property values
+   *
+   * @param {Object} x
+   * @param {Object} y
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  function compareObjects(compareNatural, x, y) {
+    var keysX = Object.keys(x);
+    var keysY = Object.keys(y);
+
+    // compare keys
+    keysX.sort(naturalSort);
+    keysY.sort(naturalSort);
+    var c = compareArrays(compareNatural, keysX, keysY);
+    if (c !== 0) {
+      return c;
+    }
+
+    // compare values
+    for (var i = 0; i < keysX.length; i++) {
+      var v = compareNatural(x[keysX[i]], y[keysY[i]]);
+      if (v !== 0) {
+        return v;
+      }
+    }
+    return 0;
+  }
+});
+
+/**
+ * Compare two complex numbers, `x` and `y`:
+ *
+ * - First, compare the real values of `x` and `y`
+ * - If equal, compare the imaginary values of `x` and `y`
+ *
+ * @params {Complex} x
+ * @params {Complex} y
+ * @returns {number} Returns the comparison result: -1, 0, or 1
+ */
+function compareComplexNumbers(x, y) {
+  if (x.re > y.re) {
+    return 1;
+  }
+  if (x.re < y.re) {
+    return -1;
+  }
+  if (x.im > y.im) {
+    return 1;
+  }
+  if (x.im < y.im) {
+    return -1;
+  }
+  return 0;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compareText.js b/node_modules/mathjs/lib/esm/function/relational/compareText.js
new file mode 100644
index 0000000..4f25378
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compareText.js
@@ -0,0 +1,57 @@
+import { compareText as _compareText } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'compareText';
+var dependencies = ['typed', 'matrix', 'concat'];
+_compareText.signature = 'any, any';
+export var createCompareText = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    concat
+  } = _ref;
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Compare two strings lexically. Comparison is case sensitive.
+   * Returns 1 when x > y, -1 when x < y, and 0 when x == y.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.compareText(x, y)
+   *
+   * Examples:
+   *
+   *    math.compareText('B', 'A')     // returns 1
+   *    math.compareText('2', '10')    // returns 1
+   *    math.compare('2', '10')        // returns -1
+   *    math.compareNatural('2', '10') // returns -1
+   *
+   *    math.compareText('B', ['A', 'B', 'C']) // returns [1, 0, -1]
+   *
+   * See also:
+   *
+   *    equal, equalText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns the result of the comparison:
+   *                                        1 when x > y, -1 when x < y, and 0 when x == y.
+   */
+  return typed(name, _compareText, matrixAlgorithmSuite({
+    elop: _compareText,
+    Ds: true
+  }));
+});
+export var createCompareTextNumber = /* #__PURE__ */factory(name, ['typed'], _ref2 => {
+  var {
+    typed
+  } = _ref2;
+  return typed(name, _compareText);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/compareUnits.js b/node_modules/mathjs/lib/esm/function/relational/compareUnits.js
new file mode 100644
index 0000000..b3f2dda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/compareUnits.js
@@ -0,0 +1,14 @@
+import { factory } from '../../utils/factory.js';
+export var createCompareUnits = /* #__PURE__ */factory('compareUnits', ['typed'], _ref => {
+  var {
+    typed
+  } = _ref;
+  return {
+    'Unit, Unit': typed.referToSelf(self => (x, y) => {
+      if (!x.equalBase(y)) {
+        throw new Error('Cannot compare units with different base');
+      }
+      return typed.find(self, [x.valueType(), y.valueType()])(x.value, y.value);
+    })
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/deepEqual.js b/node_modules/mathjs/lib/esm/function/relational/deepEqual.js
new file mode 100644
index 0000000..36f1db1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/deepEqual.js
@@ -0,0 +1,74 @@
+import { factory } from '../../utils/factory.js';
+var name = 'deepEqual';
+var dependencies = ['typed', 'equal'];
+export var createDeepEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equal
+  } = _ref;
+  /**
+   * Test element wise whether two matrices are equal.
+   * The function accepts both matrices and scalar values.
+   *
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.deepEqual(x, y)
+   *
+   * Examples:
+   *
+   *    math.deepEqual(2, 4)   // returns false
+   *
+   *    a = [2, 5, 1]
+   *    b = [2, 7, 1]
+   *
+   *    math.deepEqual(a, b)   // returns false
+   *    math.equal(a, b)       // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    equal, unequal
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First matrix to compare
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second matrix to compare
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix}
+   *            Returns true when the input matrices have the same size and each of their elements is equal.
+   */
+  return typed(name, {
+    'any, any': function any_any(x, y) {
+      return _deepEqual(x.valueOf(), y.valueOf());
+    }
+  });
+
+  /**
+   * Test whether two arrays have the same size and all elements are equal
+   * @param {Array | *} x
+   * @param {Array | *} y
+   * @return {boolean} Returns true if both arrays are deep equal
+   */
+  function _deepEqual(x, y) {
+    if (Array.isArray(x)) {
+      if (Array.isArray(y)) {
+        var len = x.length;
+        if (len !== y.length) {
+          return false;
+        }
+        for (var i = 0; i < len; i++) {
+          if (!_deepEqual(x[i], y[i])) {
+            return false;
+          }
+        }
+        return true;
+      } else {
+        return false;
+      }
+    } else {
+      if (Array.isArray(y)) {
+        return false;
+      } else {
+        return equal(x, y);
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equal.js b/node_modules/mathjs/lib/esm/function/relational/equal.js
new file mode 100644
index 0000000..9a62c00
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equal.js
@@ -0,0 +1,111 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'equal';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must equal y.re, and x.im must equal y.im.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is only
+   * equal to `null` and nothing else, and `undefined` is only equal to
+   * `undefined` and nothing else. Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.equal(x, y)
+   *
+   * Examples:
+   *
+   *    math.equal(2 + 2, 3)         // returns false
+   *    math.equal(2 + 2, 4)         // returns true
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.equal(a, b)             // returns true
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.equal(c, d)             // returns [true, false, true]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.equal("1000", "1e3")    // returns true
+   *    math.equal(0, null)          // returns false
+   *
+   * See also:
+   *
+   *    unequal, smaller, smallerEq, larger, largerEq, compare, deepEqual, equalText
+   *
+   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | boolean | Complex | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are equal, else returns false
+   */
+  return typed(name, createEqualNumber({
+    typed,
+    equalScalar
+  }), matrixAlgorithmSuite({
+    elop: equalScalar,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createEqualNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {
+  var {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function any_any(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y === null;
+      }
+      if (y === null) {
+        return x === null;
+      }
+      if (x === undefined) {
+        return y === undefined;
+      }
+      if (y === undefined) {
+        return x === undefined;
+      }
+      return equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equalScalar.js b/node_modules/mathjs/lib/esm/function/relational/equalScalar.js
new file mode 100644
index 0000000..4d545d3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equalScalar.js
@@ -0,0 +1,56 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { complexEquals } from '../../utils/complex.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'equalScalar';
+var dependencies = ['typed', 'config'];
+export var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config
+  } = _ref;
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Test whether two scalar values are nearly equal.
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex | Unit} x   First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Complex} y          Second value to compare
+   * @return {boolean}                                                  Returns true when the compared values are equal, else returns false
+   * @private
+   */
+  return typed(name, {
+    'boolean, boolean': function boolean_boolean(x, y) {
+      return x === y;
+    },
+    'number, number': function number_number(x, y) {
+      return nearlyEqual(x, y, config.relTol, config.absTol);
+    },
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.eq(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x === y;
+    },
+    'Fraction, Fraction': function Fraction_Fraction(x, y) {
+      return x.equals(y);
+    },
+    'Complex, Complex': function Complex_Complex(x, y) {
+      return complexEquals(x, y, config.relTol, config.absTol);
+    }
+  }, compareUnits);
+});
+export var createEqualScalarNumber = factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return nearlyEqual(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/equalText.js b/node_modules/mathjs/lib/esm/function/relational/equalText.js
new file mode 100644
index 0000000..56f8206
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/equalText.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+var name = 'equalText';
+var dependencies = ['typed', 'compareText', 'isZero'];
+export var createEqualText = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compareText,
+    isZero
+  } = _ref;
+  /**
+   * Check equality of two strings. Comparison is case sensitive.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.equalText(x, y)
+   *
+   * Examples:
+   *
+   *    math.equalText('Hello', 'Hello')     // returns true
+   *    math.equalText('a', 'A')             // returns false
+   *    math.equal('2e3', '2000')            // returns true
+   *    math.equalText('2e3', '2000')        // returns false
+   *
+   *    math.equalText('B', ['A', 'B', 'C']) // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    equal, compareText, compare, compareNatural
+   *
+   * @param  {string | Array | DenseMatrix} x First string to compare
+   * @param  {string | Array | DenseMatrix} y Second string to compare
+   * @return {number | Array | DenseMatrix} Returns true if the values are equal, and false if not.
+   */
+  return typed(name, {
+    'any, any': function any_any(x, y) {
+      return isZero(compareText(x, y));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/larger.js b/node_modules/mathjs/lib/esm/function/relational/larger.js
new file mode 100644
index 0000000..5137a94
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/larger.js
@@ -0,0 +1,108 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'larger';
+var dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    bignumber,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Test whether value x is larger than y.
+   *
+   * The function returns true when x is larger than y and the relative
+   * difference between x and y is larger than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.larger(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 3)             // returns false
+   *    math.larger(5, 2 + 2)         // returns true
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.larger(a, b)             // returns false
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, largerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
+   */
+  function bignumLarger(x, y) {
+    return x.gt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);
+  }
+  return typed(name, createLargerNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x > y,
+    'BigNumber, BigNumber': bignumLarger,
+    'bigint, bigint': (x, y) => x > y,
+    'Fraction, Fraction': (x, y) => x.compare(y) === 1,
+    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {
+      return bignumLarger(bignumber(x), y);
+    },
+    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {
+      return bignumLarger(x, bignumber(y));
+    },
+    'Complex, Complex': function Complex_Complex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createLargerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return x > y && !nearlyEqual(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/largerEq.js b/node_modules/mathjs/lib/esm/function/relational/largerEq.js
new file mode 100644
index 0000000..bcdb399
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/largerEq.js
@@ -0,0 +1,98 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'largerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Test whether value x is larger or equal to y.
+   *
+   * The function returns true when x is larger than y or the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.largerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.larger(2, 1 + 1)         // returns false
+   *    math.largerEq(2, 1 + 1)       // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, smallerEq, larger, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
+   */
+  return typed(name, createLargerEqNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x >= y,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.gte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': function bigint_bigint(x, y) {
+      return x >= y;
+    },
+    'Fraction, Fraction': (x, y) => x.compare(y) !== -1,
+    'Complex, Complex': function Complex_Complex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createLargerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return x >= y || nearlyEqual(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/smaller.js b/node_modules/mathjs/lib/esm/function/relational/smaller.js
new file mode 100644
index 0000000..cbf7701
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/smaller.js
@@ -0,0 +1,108 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'smaller';
+var dependencies = ['typed', 'config', 'bignumber', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    bignumber,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Test whether value x is smaller than y.
+   *
+   * The function returns true when x is smaller than y and the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smaller(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(2, 3)            // returns true
+   *    math.smaller(5, 2 * 2)        // returns false
+   *
+   *    const a = math.unit('5 cm')
+   *    const b = math.unit('2 inch')
+   *    math.smaller(a, b)            // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smallerEq, smaller, smallerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+  function bignumSmaller(x, y) {
+    return x.lt(y) && !bigNearlyEqual(x, y, config.relTol, config.absTol);
+  }
+  return typed(name, createSmallerNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x < y,
+    'BigNumber, BigNumber': bignumSmaller,
+    'bigint, bigint': (x, y) => x < y,
+    'Fraction, Fraction': (x, y) => x.compare(y) === -1,
+    'Fraction, BigNumber': function Fraction_BigNumber(x, y) {
+      return bignumSmaller(bignumber(x), y);
+    },
+    'BigNumber, Fraction': function BigNumber_Fraction(x, y) {
+      return bignumSmaller(x, bignumber(y));
+    },
+    'Complex, Complex': function Complex_Complex(x, y) {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createSmallerNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return x < y && !nearlyEqual(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/smallerEq.js b/node_modules/mathjs/lib/esm/function/relational/smallerEq.js
new file mode 100644
index 0000000..f92886f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/smallerEq.js
@@ -0,0 +1,96 @@
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+import { createCompareUnits } from './compareUnits.js';
+var name = 'smallerEq';
+var dependencies = ['typed', 'config', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+  var compareUnits = createCompareUnits({
+    typed
+  });
+
+  /**
+   * Test whether value x is smaller or equal to y.
+   *
+   * The function returns true when x is smaller than y or the relative
+   * difference between x and y is smaller than the configured relTol and absTol. The
+   * function cannot be used to compare values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * Strings are compared by their numerical value.
+   *
+   * Syntax:
+   *
+   *    math.smallerEq(x, y)
+   *
+   * Examples:
+   *
+   *    math.smaller(1 + 2, 3)        // returns false
+   *    math.smallerEq(1 + 2, 3)      // returns true
+   *
+   * See also:
+   *
+   *    equal, unequal, smaller, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} x First value to compare
+   * @param  {number | BigNumber | bigint | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
+   */
+  return typed(name, createSmallerEqNumber({
+    typed,
+    config
+  }), {
+    'boolean, boolean': (x, y) => x <= y,
+    'BigNumber, BigNumber': function BigNumber_BigNumber(x, y) {
+      return x.lte(y) || bigNearlyEqual(x, y, config.relTol, config.absTol);
+    },
+    'bigint, bigint': (x, y) => x <= y,
+    'Fraction, Fraction': (x, y) => x.compare(y) !== 1,
+    'Complex, Complex': function Complex_Complex() {
+      throw new TypeError('No ordering relation is defined for complex numbers');
+    }
+  }, compareUnits, matrixAlgorithmSuite({
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+});
+export var createSmallerEqNumber = /* #__PURE__ */factory(name, ['typed', 'config'], _ref2 => {
+  var {
+    typed,
+    config
+  } = _ref2;
+  return typed(name, {
+    'number, number': function number_number(x, y) {
+      return x <= y || nearlyEqual(x, y, config.relTol, config.absTol);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/relational/unequal.js b/node_modules/mathjs/lib/esm/function/relational/unequal.js
new file mode 100644
index 0000000..0585cda
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/relational/unequal.js
@@ -0,0 +1,114 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo07xSSf } from '../../type/matrix/utils/matAlgo07xSSf.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'unequal';
+var dependencies = ['typed', 'config', 'equalScalar', 'matrix', 'DenseMatrix', 'concat', 'SparseMatrix'];
+export var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    equalScalar,
+    matrix,
+    DenseMatrix,
+    concat,
+    SparseMatrix
+  } = _ref;
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo07xSSf = createMatAlgo07xSSf({
+    typed,
+    SparseMatrix
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Test whether two values are unequal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * larger than the configured relTol and absTol. The function cannot be used to compare
+   * values smaller than approximately 2.22e-16.
+   *
+   * For matrices, the function is evaluated element wise.
+   * In case of complex numbers, x.re must unequal y.re, or x.im must unequal y.im.
+   * Strings are compared by their numerical value.
+   *
+   * Values `null` and `undefined` are compared strictly, thus `null` is unequal
+   * with everything except `null`, and `undefined` is unequal with everything
+   * except `undefined`.
+   *
+   * Syntax:
+   *
+   *    math.unequal(x, y)
+   *
+   * Examples:
+   *
+   *    math.unequal(2 + 2, 3)       // returns true
+   *    math.unequal(2 + 2, 4)       // returns false
+   *
+   *    const a = math.unit('50 cm')
+   *    const b = math.unit('5 m')
+   *    math.unequal(a, b)           // returns false
+   *
+   *    const c = [2, 5, 1]
+   *    const d = [2, 7, 1]
+   *
+   *    math.unequal(c, d)           // returns [false, true, false]
+   *    math.deepEqual(c, d)         // returns false
+   *
+   *    math.unequal(0, null)        // returns true
+   * See also:
+   *
+   *    equal, deepEqual, smaller, smallerEq, larger, largerEq, compare
+   *
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} x First value to compare
+   * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
+   * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
+   */
+  return typed(name, createUnequalNumber({
+    typed,
+    equalScalar
+  }), matrixAlgorithmSuite({
+    elop: _unequal,
+    SS: matAlgo07xSSf,
+    DS: matAlgo03xDSf,
+    Ss: matAlgo12xSfs
+  }));
+  function _unequal(x, y) {
+    return !equalScalar(x, y);
+  }
+});
+export var createUnequalNumber = factory(name, ['typed', 'equalScalar'], _ref2 => {
+  var {
+    typed,
+    equalScalar
+  } = _ref2;
+  return typed(name, {
+    'any, any': function any_any(x, y) {
+      // strict equality for null and undefined?
+      if (x === null) {
+        return y !== null;
+      }
+      if (y === null) {
+        return x !== null;
+      }
+      if (x === undefined) {
+        return y !== undefined;
+      }
+      if (y === undefined) {
+        return x !== undefined;
+      }
+      return !equalScalar(x, y);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setCartesian.js b/node_modules/mathjs/lib/esm/function/set/setCartesian.js
new file mode 100644
index 0000000..275d0d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setCartesian.js
@@ -0,0 +1,58 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setCartesian';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetCartesian = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the cartesian product of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays
+   * and the values will be sorted in ascending order before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setCartesian(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setCartesian([1, 2], [3, 4])        // returns [[1, 3], [1, 4], [2, 3], [2, 4]]
+   *    math.setCartesian([4, 3], [2, 1])        // returns [[3, 1], [3, 2], [4, 1], [4, 2]]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference, setPowerset
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The cartesian product of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      var result = [];
+      if (subset(size(a1), new Index(0)) !== 0 && subset(size(a2), new Index(0)) !== 0) {
+        // if any of them is empty, return empty
+        var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
+        var b2 = flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural);
+        result = [];
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            result.push([b1[i], b2[j]]);
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return result;
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setDifference.js b/node_modules/mathjs/lib/esm/function/set/setDifference.js
new file mode 100644
index 0000000..94688d7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setDifference.js
@@ -0,0 +1,71 @@
+import { flatten, generalize, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setDifference';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2]
+   *    math.setDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setSymDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      var result;
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty-anything=empty
+        result = [];
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything-empty=anything
+        return flatten(a1.toArray());
+      } else {
+        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        var inb2;
+        for (var i = 0; i < b1.length; i++) {
+          inb2 = false;
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              inb2 = true;
+              break;
+            }
+          }
+          if (!inb2) {
+            result.push(b1[i]);
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return generalize(result);
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(generalize(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setDistinct.js b/node_modules/mathjs/lib/esm/function/set/setDistinct.js
new file mode 100644
index 0000000..a4f9abd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setDistinct.js
@@ -0,0 +1,57 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setDistinct';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Collect the distinct elements of a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setDistinct(set)
+   *
+   * Examples:
+   *
+   *    math.setDistinct([1, 1, 1, 2, 2, 3])        // returns [1, 2, 3]
+   *
+   * See also:
+   *
+   *    setMultiplicity
+   *
+   * @param {Array | Matrix}    a  A multiset
+   * @return {Array | Matrix}    A set containing the distinc elements of the multiset
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(a) {
+      var result;
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        result = [];
+      } else {
+        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        result = [];
+        result.push(b[0]);
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            result.push(b[i]);
+          }
+        }
+      }
+      // return an array, if the input was an array
+      if (Array.isArray(a)) {
+        return result;
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(result);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setIntersect.js b/node_modules/mathjs/lib/esm/function/set/setIntersect.js
new file mode 100644
index 0000000..f88e1a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setIntersect.js
@@ -0,0 +1,63 @@
+import { flatten, generalize, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setIntersect';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
+export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Create the intersection of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIntersect(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIntersect([1, 2, 3, 4], [3, 4, 5, 6])            // returns [3, 4]
+   *    math.setIntersect([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [3, 4]
+   *
+   * See also:
+   *
+   *    setUnion, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The intersection of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      var result;
+      if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
+        // of any of them is empty, return empty
+        result = [];
+      } else {
+        var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+        var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+        result = [];
+        for (var i = 0; i < b1.length; i++) {
+          for (var j = 0; j < b2.length; j++) {
+            if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+              // the identifier is always a decimal int
+              result.push(b1[i]);
+              break;
+            }
+          }
+        }
+      }
+      // return an array, if both inputs were arrays
+      if (Array.isArray(a1) && Array.isArray(a2)) {
+        return generalize(result);
+      }
+      // return a matrix otherwise
+      return new DenseMatrix(generalize(result));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setIsSubset.js b/node_modules/mathjs/lib/esm/function/set/setIsSubset.js
new file mode 100644
index 0000000..a1b353e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setIsSubset.js
@@ -0,0 +1,62 @@
+import { flatten, identify } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setIsSubset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setIsSubset(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setIsSubset([1, 2], [3, 4, 5, 6])        // returns false
+   *    math.setIsSubset([3, 4], [3, 4, 5, 6])        // returns true
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {boolean} Returns true when a1 is a subset of a2, returns false otherwise
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // empty is a subset of anything
+        return true;
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        // anything is not a subset of empty
+        return false;
+      }
+      var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
+      var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
+      var inb2;
+      for (var i = 0; i < b1.length; i++) {
+        inb2 = false;
+        for (var j = 0; j < b2.length; j++) {
+          if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
+            // the identifier is always a decimal int
+            inb2 = true;
+            break;
+          }
+        }
+        if (inb2 === false) {
+          return false;
+        }
+      }
+      return true;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js b/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js
new file mode 100644
index 0000000..57dc237
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setMultiplicity.js
@@ -0,0 +1,50 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setMultiplicity';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Count the multiplicity of an element in a multiset.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setMultiplicity(element, set)
+   *
+   * Examples:
+   *
+   *    math.setMultiplicity(1, [1, 2, 2, 4])    // returns 1
+   *    math.setMultiplicity(2, [1, 2, 2, 4])    // returns 2
+   *
+   * See also:
+   *
+   *    setDistinct, setSize
+   *
+   * @param {number | BigNumber | Fraction | Complex} e  An element in the multiset
+   * @param {Array | Matrix}     a  A multiset
+   * @return {number}            The number of how many times the multiset contains the element
+   */
+  return typed(name, {
+    'number | BigNumber | Fraction | Complex, Array | Matrix': function number__BigNumber__Fraction__Complex_Array__Matrix(e, a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return 0
+        return 0;
+      }
+      var b = flatten(Array.isArray(a) ? a : a.toArray());
+      var count = 0;
+      for (var i = 0; i < b.length; i++) {
+        if (compareNatural(b[i], e) === 0) {
+          count++;
+        }
+      }
+      return count;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setPowerset.js b/node_modules/mathjs/lib/esm/function/set/setPowerset.js
new file mode 100644
index 0000000..0cdfd83
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setPowerset.js
@@ -0,0 +1,75 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setPowerset';
+var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
+export var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    subset,
+    compareNatural,
+    Index
+  } = _ref;
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setPowerset(set)
+   *
+   * Examples:
+   *
+   *    math.setPowerset([1, 2, 3])        // returns [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
+   *
+   * See also:
+   *
+   *    setCartesian
+   *
+   * @param {Array | Matrix}    a  A (multi)set
+   * @return {Array}    The powerset of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(a) {
+      if (subset(size(a), new Index(0)) === 0) {
+        // if empty, return empty
+        return [];
+      }
+      var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+      var result = [];
+      var number = 0;
+      while (number.toString(2).length <= b.length) {
+        result.push(_subset(b, number.toString(2).split('').reverse()));
+        number++;
+      }
+      // can not return a matrix, because of the different size of the subarrays
+      return _sort(result);
+    }
+  });
+
+  // create subset
+  function _subset(array, bitarray) {
+    var result = [];
+    for (var i = 0; i < bitarray.length; i++) {
+      if (bitarray[i] === '1') {
+        result.push(array[i]);
+      }
+    }
+    return result;
+  }
+
+  // sort subsests by length
+  function _sort(array) {
+    var temp = [];
+    for (var i = array.length - 1; i > 0; i--) {
+      for (var j = 0; j < i; j++) {
+        if (array[j].length > array[j + 1].length) {
+          temp = array[j];
+          array[j] = array[j + 1];
+          array[j + 1] = temp;
+        }
+      }
+    }
+    return array;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setSize.js b/node_modules/mathjs/lib/esm/function/set/setSize.js
new file mode 100644
index 0000000..3d374eb
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setSize.js
@@ -0,0 +1,51 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setSize';
+var dependencies = ['typed', 'compareNatural'];
+export var createSetSize = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    compareNatural
+  } = _ref;
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
+   * A multi-dimension array will be converted to a single-dimension array before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSize(set)
+   *    math.setSize(set, unique)
+   *
+   * Examples:
+   *
+   *    math.setSize([1, 2, 2, 4])          // returns 4
+   *    math.setSize([1, 2, 2, 4], true)    // returns 3
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix} a  A multiset
+   * @param {boolean} [unique]  If true, only the unique values are counted. False by default
+   * @return {number}           The number of elements of the (multi)set
+   */
+  return typed(name, {
+    'Array | Matrix': function Array__Matrix(a) {
+      return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;
+    },
+    'Array | Matrix, boolean': function Array__Matrix_boolean(a, unique) {
+      if (unique === false || a.length === 0) {
+        return Array.isArray(a) ? flatten(a).length : flatten(a.toArray()).length;
+      } else {
+        var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
+        var count = 1;
+        for (var i = 1; i < b.length; i++) {
+          if (compareNatural(b[i], b[i - 1]) !== 0) {
+            count++;
+          }
+        }
+        return count;
+      }
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setSymDifference.js b/node_modules/mathjs/lib/esm/function/set/setSymDifference.js
new file mode 100644
index 0000000..4c8fa96
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setSymDifference.js
@@ -0,0 +1,48 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setSymDifference';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
+export var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    concat,
+    subset,
+    setDifference,
+    Index
+  } = _ref;
+  /**
+   * Create the symmetric difference of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setSymDifference(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setSymDifference([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 5, 6]
+   *    math.setSymDifference([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 5, 6]
+   *
+   * See also:
+   *
+   *    setUnion, setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The symmetric difference of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return flatten(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return flatten(a1);
+      }
+      var b1 = flatten(a1);
+      var b2 = flatten(a2);
+      return concat(setDifference(b1, b2), setDifference(b2, b1));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/set/setUnion.js b/node_modules/mathjs/lib/esm/function/set/setUnion.js
new file mode 100644
index 0000000..d069770
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/set/setUnion.js
@@ -0,0 +1,49 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'setUnion';
+var dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
+export var createSetUnion = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    size,
+    concat,
+    subset,
+    setIntersect,
+    setSymDifference,
+    Index
+  } = _ref;
+  /**
+   * Create the union of two (multi)sets.
+   * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
+   *
+   * Syntax:
+   *
+   *    math.setUnion(set1, set2)
+   *
+   * Examples:
+   *
+   *    math.setUnion([1, 2, 3, 4], [3, 4, 5, 6])            // returns [1, 2, 3, 4, 5, 6]
+   *    math.setUnion([[1, 2], [3, 4]], [[3, 4], [5, 6]])    // returns [1, 2, 3, 4, 5, 6]
+   *
+   * See also:
+   *
+   *    setIntersect, setDifference
+   *
+   * @param {Array | Matrix}    a1  A (multi)set
+   * @param {Array | Matrix}    a2  A (multi)set
+   * @return {Array | Matrix}    The union of two (multi)sets
+   */
+  return typed(name, {
+    'Array | Matrix, Array | Matrix': function Array__Matrix_Array__Matrix(a1, a2) {
+      if (subset(size(a1), new Index(0)) === 0) {
+        // if any of them is empty, return the other one
+        return flatten(a2);
+      } else if (subset(size(a2), new Index(0)) === 0) {
+        return flatten(a1);
+      }
+      var b1 = flatten(a1);
+      var b2 = flatten(a2);
+      return concat(setSymDifference(b1, b2), setIntersect(b1, b2));
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/signal/freqz.js b/node_modules/mathjs/lib/esm/function/signal/freqz.js
new file mode 100644
index 0000000..0e58161
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/signal/freqz.js
@@ -0,0 +1,115 @@
+import { factory } from '../../utils/factory.js';
+var name = 'freqz';
+var dependencies = ['typed', 'add', 'multiply', 'Complex', 'divide', 'matrix'];
+export var createFreqz = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    multiply,
+    Complex,
+    divide,
+    matrix
+  } = _ref;
+  /**
+     * Calculates the frequency response of a filter given its numerator and denominator coefficients.
+     *
+     * Syntax:
+     *    math.freqz(b, a)
+     *    math.freqz(b, a, w)
+     *
+     * Examples:
+     *   math.freqz([1, 2], [1, 2, 3], 4) // returns { h: [0.5 + 0i, 0.4768589245763655 + 0.2861153547458193i, 0.25000000000000006 + 0.75i, -0.770976571635189 + 0.4625859429811135i], w: [0, 0.7853981633974483, 1.5707963267948966, 2.356194490192345 ] }
+     *   math.freqz([1, 2], [1, 2, 3], [0, 1]) // returns { h: [0.5 + 0i, 0.45436781 + 0.38598051i], w: [0, 1] }
+     *
+     * See also:
+     *  zpk2tf
+     *
+     * @param {Array.<number>} b The numerator coefficients of the filter.
+     * @param {Array.<number>} a The denominator coefficients of the filter.
+     * @param {Array.<number>} [w] A vector of frequencies (in radians/sample) at which the frequency response is to be computed or the number of points to compute (if a number is not provided, the default is 512 points)
+     * @returns {Object} An object with two properties: h, a vector containing the complex frequency response, and w, a vector containing the normalized frequencies (in radians/sample) at which the response was computed.
+     *
+     *
+     */
+  return typed(name, {
+    'Array, Array': function Array_Array(b, a) {
+      var w = createBins(512);
+      return _freqz(b, a, w);
+    },
+    'Array, Array, Array': function Array_Array_Array(b, a, w) {
+      return _freqz(b, a, w);
+    },
+    'Array, Array, number': function Array_Array_number(b, a, w) {
+      if (w < 0) {
+        throw new Error('w must be a positive number');
+      }
+      var w2 = createBins(w);
+      return _freqz(b, a, w2);
+    },
+    'Matrix, Matrix': function Matrix_Matrix(b, a) {
+      // console.log('here')
+      var _w = createBins(512);
+      var {
+        w,
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), _w);
+      return {
+        w: matrix(w),
+        h: matrix(h)
+      };
+    },
+    'Matrix, Matrix, Matrix': function Matrix_Matrix_Matrix(b, a, w) {
+      var {
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), w.valueOf());
+      return {
+        h: matrix(h),
+        w: matrix(w)
+      };
+    },
+    'Matrix, Matrix, number': function Matrix_Matrix_number(b, a, w) {
+      if (w < 0) {
+        throw new Error('w must be a positive number');
+      }
+      var _w = createBins(w);
+      var {
+        h
+      } = _freqz(b.valueOf(), a.valueOf(), _w);
+      return {
+        h: matrix(h),
+        w: matrix(_w)
+      };
+    }
+  });
+  function _freqz(b, a, w) {
+    var num = [];
+    var den = [];
+    for (var i = 0; i < w.length; i++) {
+      var sumNum = Complex(0, 0);
+      var sumDen = Complex(0, 0);
+      for (var j = 0; j < b.length; j++) {
+        sumNum = add(sumNum, multiply(b[j], Complex(Math.cos(-j * w[i]), Math.sin(-j * w[i]))));
+      }
+      for (var _j = 0; _j < a.length; _j++) {
+        sumDen = add(sumDen, multiply(a[_j], Complex(Math.cos(-_j * w[i]), Math.sin(-_j * w[i]))));
+      }
+      num.push(sumNum);
+      den.push(sumDen);
+    }
+    var h = [];
+    for (var _i = 0; _i < num.length; _i++) {
+      h.push(divide(num[_i], den[_i]));
+    }
+    return {
+      h,
+      w
+    };
+  }
+  function createBins(n) {
+    var bins = [];
+    for (var i = 0; i < n; i++) {
+      bins.push(i / n * Math.PI);
+    }
+    return bins;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/signal/zpk2tf.js b/node_modules/mathjs/lib/esm/function/signal/zpk2tf.js
new file mode 100644
index 0000000..e378c83
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/signal/zpk2tf.js
@@ -0,0 +1,82 @@
+import { factory } from '../../utils/factory.js';
+var name = 'zpk2tf';
+var dependencies = ['typed', 'add', 'multiply', 'Complex', 'number'];
+export var createZpk2tf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    multiply,
+    Complex,
+    number
+  } = _ref;
+  /**
+     * Compute the transfer function of a zero-pole-gain model.
+     *
+     * Syntax:
+     *      math.zpk2tf(z, p, k)
+     *
+     * Examples:
+     *    math.zpk2tf([1, 2], [-1, -2], 1)    // returns [[1, -3, 2], [1, 3, 2]]
+     *
+     * See also:
+     *   freqz
+     *
+     * @param {Array} z Array of zeros values
+     * @param {Array} p Array of poles values
+     * @param {number} k Gain value
+     * @return {Array} Two dimensional array containing the numerator (first row) and denominator (second row) polynomials
+     *
+     */
+  return typed(name, {
+    'Array,Array,number': function ArrayArrayNumber(z, p, k) {
+      return _zpk2tf(z, p, k);
+    },
+    'Array,Array': function ArrayArray(z, p) {
+      return _zpk2tf(z, p, 1);
+    },
+    'Matrix,Matrix,number': function MatrixMatrixNumber(z, p, k) {
+      return _zpk2tf(z.valueOf(), p.valueOf(), k);
+    },
+    'Matrix,Matrix': function MatrixMatrix(z, p) {
+      return _zpk2tf(z.valueOf(), p.valueOf(), 1);
+    }
+  });
+  function _zpk2tf(z, p, k) {
+    // if z is bignumber, convert it to number
+    if (z.some(el => el.type === 'BigNumber')) {
+      z = z.map(el => number(el));
+    }
+    // if p is bignumber, convert it to number
+    if (p.some(el => el.type === 'BigNumber')) {
+      p = p.map(el => number(el));
+    }
+    var num = [Complex(1, 0)];
+    var den = [Complex(1, 0)];
+    for (var i = 0; i < z.length; i++) {
+      var zero = z[i];
+      if (typeof zero === 'number') zero = Complex(zero, 0);
+      num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)]);
+    }
+    for (var _i = 0; _i < p.length; _i++) {
+      var pole = p[_i];
+      if (typeof pole === 'number') pole = Complex(pole, 0);
+      den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)]);
+    }
+    for (var _i2 = 0; _i2 < num.length; _i2++) {
+      num[_i2] = multiply(num[_i2], k);
+    }
+    return [num, den];
+  }
+  function _multiply(a, b) {
+    var c = [];
+    for (var i = 0; i < a.length + b.length - 1; i++) {
+      c[i] = Complex(0, 0);
+      for (var j = 0; j < a.length; j++) {
+        if (i - j >= 0 && i - j < b.length) {
+          c[i] = add(c[i], multiply(a[j], b[i - j]));
+        }
+      }
+    }
+    return c;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/special/erf.js b/node_modules/mathjs/lib/esm/function/special/erf.js
new file mode 100644
index 0000000..194a879
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/special/erf.js
@@ -0,0 +1,155 @@
+/* eslint-disable no-loss-of-precision */
+
+import { deepMap } from '../../utils/collection.js';
+import { sign } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'erf';
+var dependencies = ['typed'];
+export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   *
+   * This is a translation of W. J. Cody's Fortran implementation from 1987
+   * ( https://www.netlib.org/specfun/erf ). See the AMS publication
+   * "Rational Chebyshev Approximations for the Error Function" by W. J. Cody
+   * for an explanation of this process.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.erf(x)
+   *
+   * Examples:
+   *
+   *    math.erf(0.2)    // returns 0.22270258921047847
+   *    math.erf(-0.5)   // returns -0.5204998778130465
+   *    math.erf(4)      // returns 0.9999999845827421
+   *
+   * See also:
+   *    zeta
+   *
+   * @param {number | Array | Matrix} x   A real number
+   * @return {number | Array | Matrix}    The erf of `x`
+   */
+  return typed('name', {
+    number: function number(x) {
+      var y = Math.abs(x);
+      if (y >= MAX_NUM) {
+        return sign(x);
+      }
+      if (y <= THRESH) {
+        return sign(x) * erf1(y);
+      }
+      if (y <= 4.0) {
+        return sign(x) * (1 - erfc2(y));
+      }
+      return sign(x) * (1 - erfc3(y));
+    },
+    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))
+
+    // TODO: For complex numbers, use the approximation for the Faddeeva function
+    //  from "More Efficient Computation of the Complex Error Function" (AMS)
+  });
+
+  /**
+   * Approximates the error function erf() for x <= 0.46875 using this function:
+   *               n
+   * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
+   *              j=0
+   */
+  function erf1(y) {
+    var ysq = y * y;
+    var xnum = P[0][4] * ysq;
+    var xden = ysq;
+    var i;
+    for (i = 0; i < 3; i += 1) {
+      xnum = (xnum + P[0][i]) * ysq;
+      xden = (xden + Q[0][i]) * ysq;
+    }
+    return y * (xnum + P[0][3]) / (xden + Q[0][3]);
+  }
+
+  /**
+   * Approximates the complement of the error function erfc() for
+   * 0.46875 <= x <= 4.0 using this function:
+   *                       n
+   * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
+   *                      j=0
+   */
+  function erfc2(y) {
+    var xnum = P[1][8] * y;
+    var xden = y;
+    var i;
+    for (i = 0; i < 7; i += 1) {
+      xnum = (xnum + P[1][i]) * y;
+      xden = (xden + Q[1][i]) * y;
+    }
+    var result = (xnum + P[1][7]) / (xden + Q[1][7]);
+    var ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+
+  /**
+   * Approximates the complement of the error function erfc() for x > 4.0 using
+   * this function:
+   *
+   * erfc(x) = (e^(-x^2) / x) * [ 1/sqrt(pi) +
+   *               n
+   *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
+   *              j=0
+   */
+  function erfc3(y) {
+    var ysq = 1 / (y * y);
+    var xnum = P[2][5] * ysq;
+    var xden = ysq;
+    var i;
+    for (i = 0; i < 4; i += 1) {
+      xnum = (xnum + P[2][i]) * ysq;
+      xden = (xden + Q[2][i]) * ysq;
+    }
+    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
+    result = (SQRPI - result) / y;
+    ysq = parseInt(y * 16) / 16;
+    var del = (y - ysq) * (y + ysq);
+    return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
+  }
+});
+
+/**
+ * Upper bound for the first approximation interval, 0 <= x <= THRESH
+ * @constant
+ */
+var THRESH = 0.46875;
+
+/**
+ * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
+ * @constant
+ */
+var SQRPI = 5.6418958354775628695e-1;
+
+/**
+ * Coefficients for each term of the numerator sum (p_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+var P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
+
+/**
+ * Coefficients for each term of the denominator sum (q_j) for each approximation
+ * interval (see W. J. Cody's paper for more details)
+ * @constant
+ */
+var Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
+
+/**
+ * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
+ * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
+ * return 1
+ */
+var MAX_NUM = Math.pow(2, 53);
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/special/zeta.js b/node_modules/mathjs/lib/esm/function/special/zeta.js
new file mode 100644
index 0000000..59562d3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/special/zeta.js
@@ -0,0 +1,148 @@
+import { factory } from '../../utils/factory.js';
+var name = 'zeta';
+var dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi'];
+export var createZeta = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiply,
+    pow,
+    divide,
+    factorial,
+    equal,
+    smallerEq,
+    isNegative,
+    gamma,
+    sin,
+    subtract,
+    add,
+    Complex,
+    BigNumber: _BigNumber,
+    pi
+  } = _ref;
+  /**
+   * Compute the Riemann Zeta function of a value using an infinite series for
+   * all of the complex plane using Riemann's Functional equation.
+   *
+   * Based off the paper by Xavier Gourdon and Pascal Sebah
+   * ( http://numbers.computation.free.fr/Constants/Miscellaneous/zetaevaluations.pdf )
+   *
+   * Implementation and slight modification by Anik Patel
+   *
+   * Note: the implementation is accurate up to about 6 digits.
+   *
+   * Syntax:
+   *
+   *    math.zeta(n)
+   *
+   * Examples:
+   *
+   *    math.zeta(5)       // returns 1.0369277551433895
+   *    math.zeta(-0.5)    // returns -0.2078862249773449
+   *    math.zeta(math.i)  // returns 0.0033002236853253153 - 0.4181554491413212i
+   *
+   * See also:
+   *    erf
+   *
+   * @param {number | Complex | BigNumber} s   A Real, Complex or BigNumber parameter to the Riemann Zeta Function
+   * @return {number | Complex | BigNumber}    The Riemann Zeta of `s`
+   */
+  return typed(name, {
+    number: s => zetaNumeric(s, value => value, () => 20),
+    BigNumber: s => zetaNumeric(s, value => new _BigNumber(value), () => {
+      // relTol is for example 1e-12. Extract the positive exponent 12 from that
+      return Math.abs(Math.log10(config.relTol));
+    }),
+    Complex: zetaComplex
+  });
+
+  /**
+   * @param {number | BigNumber} s
+   * @param {(value: number) => number | BigNumber} createValue
+   * @param {(value: number | BigNumber | Complex) => number} determineDigits
+   * @returns {number | BigNumber}
+   */
+  function zetaNumeric(s, createValue, determineDigits) {
+    if (equal(s, 0)) {
+      return createValue(-0.5);
+    }
+    if (equal(s, 1)) {
+      return createValue(NaN);
+    }
+    if (!isFinite(s)) {
+      return isNegative(s) ? createValue(NaN) : createValue(1);
+    }
+    return zeta(s, createValue, determineDigits, s => s);
+  }
+
+  /**
+   * @param {Complex} s
+   * @returns {Complex}
+   */
+  function zetaComplex(s) {
+    if (s.re === 0 && s.im === 0) {
+      return new Complex(-0.5);
+    }
+    if (s.re === 1) {
+      return new Complex(NaN, NaN);
+    }
+    if (s.re === Infinity && s.im === 0) {
+      return new Complex(1);
+    }
+    if (s.im === Infinity || s.re === -Infinity) {
+      return new Complex(NaN, NaN);
+    }
+    return zeta(s, value => value, s => Math.round(1.3 * 15 + 0.9 * Math.abs(s.im)), s => s.re);
+  }
+
+  /**
+   * @param {number | BigNumber | Complex} s
+   * @param {(value: number) => number | BigNumber | Complex} createValue
+   * @param {(value: number | BigNumber | Complex) => number} determineDigits
+   * @param {(value: number | BigNumber | Complex) => number} getRe
+   * @returns {*|number}
+   */
+  function zeta(s, createValue, determineDigits, getRe) {
+    var n = determineDigits(s);
+    if (getRe(s) > -(n - 1) / 2) {
+      return f(s, createValue(n), createValue);
+    } else {
+      // Function Equation for reflection to x < 1
+      var c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)));
+      c = multiply(c, sin(multiply(divide(createValue(pi), 2), s)));
+      c = multiply(c, gamma(subtract(1, s)));
+      return multiply(c, zeta(subtract(1, s), createValue, determineDigits, getRe));
+    }
+  }
+
+  /**
+   * Calculate a portion of the sum
+   * @param {number | BigNumber} k   a positive integer
+   * @param {number | BigNumber} n   a positive integer
+   * @return {number}    the portion of the sum
+   **/
+  function d(k, n) {
+    var S = k;
+    for (var j = k; smallerEq(j, n); j = add(j, 1)) {
+      var factor = divide(multiply(factorial(add(n, subtract(j, 1))), pow(4, j)), multiply(factorial(subtract(n, j)), factorial(multiply(2, j))));
+      S = add(S, factor);
+    }
+    return multiply(n, S);
+  }
+
+  /**
+   * Calculate the positive Riemann Zeta function
+   * @param {number} s   a real or complex number with s.re > 1
+   * @param {number} n   a positive integer
+   * @param {(number) => number | BigNumber | Complex} createValue
+   * @return {number}    Riemann Zeta of s
+   **/
+  function f(s, n, createValue) {
+    var c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))));
+    var S = createValue(0);
+    for (var k = createValue(1); smallerEq(k, n); k = add(k, 1)) {
+      S = add(S, divide(multiply((-1) ** (k - 1), d(k, n)), pow(k, s)));
+    }
+    return multiply(c, S);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/corr.js b/node_modules/mathjs/lib/esm/function/statistics/corr.js
new file mode 100644
index 0000000..0d03357
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/corr.js
@@ -0,0 +1,84 @@
+import { factory } from '../../utils/factory.js';
+var name = 'corr';
+var dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide'];
+export var createCorr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    sqrt,
+    sum,
+    add,
+    subtract,
+    multiply,
+    pow,
+    divide
+  } = _ref;
+  /**
+   * Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.
+   *
+   * Syntax:
+   *
+   *     math.corr(A, B)
+   *
+   * Examples:
+   *
+   *     math.corr([1, 2, 3, 4, 5], [4, 5, 6, 7, 8])     // returns 1
+   *     math.corr([1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8])     //returns 0.9569941688503644
+   *     math.corr([[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]],[[1, 2.2, 3, 4.8, 5], [4, 5.3, 6.6, 7, 8]])   // returns [1,1]
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array | Matrix} A The first array or matrix to compute correlation coefficient
+   * @param {Array | Matrix} B The second array or matrix to compute correlation coefficient
+   * @return {*} The correlation coefficient
+   */
+  return typed(name, {
+    'Array, Array': function Array_Array(A, B) {
+      return _corr(A, B);
+    },
+    'Matrix, Matrix': function Matrix_Matrix(A, B) {
+      var res = _corr(A.toArray(), B.toArray());
+      return Array.isArray(res) ? matrix(res) : res;
+    }
+  });
+  /**
+   * Calculate the correlation coefficient between two arrays or matrices.
+   * @param {Array | Matrix} A
+   * @param {Array | Matrix} B
+   * @return {*} correlation coefficient
+   * @private
+   */
+  function _corr(A, B) {
+    var correlations = [];
+    if (Array.isArray(A[0]) && Array.isArray(B[0])) {
+      if (A.length !== B.length) {
+        throw new SyntaxError('Dimension mismatch. Array A and B must have the same length.');
+      }
+      for (var i = 0; i < A.length; i++) {
+        if (A[i].length !== B[i].length) {
+          throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');
+        }
+        correlations.push(correlation(A[i], B[i]));
+      }
+      return correlations;
+    } else {
+      if (A.length !== B.length) {
+        throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');
+      }
+      return correlation(A, B);
+    }
+  }
+  function correlation(A, B) {
+    var n = A.length;
+    var sumX = sum(A);
+    var sumY = sum(B);
+    var sumXY = A.reduce((acc, x, index) => add(acc, multiply(x, B[index])), 0);
+    var sumXSquare = sum(A.map(x => pow(x, 2)));
+    var sumYSquare = sum(B.map(y => pow(y, 2)));
+    var numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY));
+    var denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))));
+    return divide(numerator, denominator);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/cumsum.js b/node_modules/mathjs/lib/esm/function/statistics/cumsum.js
new file mode 100644
index 0000000..1e7cc36
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/cumsum.js
@@ -0,0 +1,123 @@
+import { containsCollections } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { _switch } from '../../utils/switch.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+import { arraySize } from '../../utils/array.js';
+import { IndexError } from '../../error/IndexError.js';
+var name = 'cumsum';
+var dependencies = ['typed', 'add', 'unaryPlus'];
+export var createCumSum = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
+  /**
+   * Compute the cumulative sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the cumulative sums
+   * along a specified dimension (defaulting to the first) will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.cumsum(a, b, c, ...)
+   *     math.cumsum(A)
+   *
+   * Examples:
+   *
+   *     math.cumsum(2, 1, 4, 3)               // returns [2, 3, 7, 10]
+   *     math.cumsum([2, 1, 4, 3])             // returns [2, 3, 7, 10]
+   *     math.cumsum([[1, 2], [3, 4]])         // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 0)      // returns [[1, 2], [4, 6]]
+   *     math.cumsum([[1, 2], [3, 4]], 1)      // returns [[1, 3], [3, 7]]
+   *     math.cumsum([[2, 5], [4, 3], [1, 7]]) // returns [[2, 5], [6, 8], [7, 15]]
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, sum
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The cumulative sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    Array: _cumsum,
+    Matrix: function Matrix(matrix) {
+      return matrix.create(_cumsum(matrix.valueOf(), matrix.datatype()));
+    },
+    // sum([a, b, c, d, ...], dim)
+    'Array, number | BigNumber': _ncumSumDim,
+    'Matrix, number | BigNumber': function Matrix_number__BigNumber(matrix, dim) {
+      return matrix.create(_ncumSumDim(matrix.valueOf(), dim), matrix.datatype());
+    },
+    // cumsum(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('All values expected to be scalar in function cumsum');
+      }
+      return _cumsum(args);
+    }
+  });
+
+  /**
+     * Recursively calculate the cumulative sum of an n-dimensional array
+     * @param {Array} array
+     * @return {number} cumsum
+     * @private
+     */
+  function _cumsum(array) {
+    try {
+      return _cumsummap(array);
+    } catch (err) {
+      throw improveErrorMessage(err, name);
+    }
+  }
+  function _cumsummap(array) {
+    if (array.length === 0) {
+      return [];
+    }
+    var sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
+    for (var i = 1; i < array.length; ++i) {
+      // Must use add below and not addScalar for the case of summing a
+      // 2+-dimensional array along the 0th dimension (the row vectors,
+      // or higher-d analogues, are literally added to each other).
+      sums.push(add(sums[i - 1], array[i]));
+    }
+    return sums;
+  }
+  function _ncumSumDim(array, dim) {
+    var size = arraySize(array);
+    if (dim < 0 || dim >= size.length) {
+      // TODO: would be more clear when throwing a DimensionError here
+      throw new IndexError(dim, size.length);
+    }
+    try {
+      return _cumsumDimensional(array, dim);
+    } catch (err) {
+      throw improveErrorMessage(err, name);
+    }
+  }
+
+  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
+  function _cumsumDimensional(mat, dim) {
+    var i, ret, tran;
+    if (dim <= 0) {
+      var initialValue = mat[0][0];
+      if (!Array.isArray(initialValue)) {
+        return _cumsummap(mat);
+      } else {
+        tran = _switch(mat);
+        ret = [];
+        for (i = 0; i < tran.length; i++) {
+          ret[i] = _cumsumDimensional(tran[i], dim - 1);
+        }
+        return ret;
+      }
+    } else {
+      ret = [];
+      for (i = 0; i < mat.length; i++) {
+        ret[i] = _cumsumDimensional(mat[i], dim - 1);
+      }
+      return ret;
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mad.js b/node_modules/mathjs/lib/esm/function/statistics/mad.js
new file mode 100644
index 0000000..96e096a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mad.js
@@ -0,0 +1,64 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'mad';
+var dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
+export var createMad = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    abs,
+    map,
+    median,
+    subtract
+  } = _ref;
+  /**
+   * Compute the median absolute deviation of a matrix or a list with values.
+   * The median absolute deviation is defined as the median of the absolute
+   * deviations from the median.
+   *
+   * Syntax:
+   *
+   *     math.mad(a, b, c, ...)
+   *     math.mad(A)
+   *
+   * Examples:
+   *
+   *     math.mad(10, 20, 30)             // returns 10
+   *     math.mad([1, 2, 3])              // returns 1
+   *     math.mad([[1, 2, 3], [4, 5, 6]]) // returns 1.5
+   *
+   * See also:
+   *
+   *     median, mean, std, abs
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or multiple scalar values.
+   * @return {*} The median absolute deviation.
+   */
+  return typed(name, {
+    // mad([a, b, c, d, ...])
+    'Array | Matrix': _mad,
+    // mad(a, b, c, d, ...)
+    '...': function _(args) {
+      return _mad(args);
+    }
+  });
+  function _mad(array) {
+    array = flatten(array.valueOf());
+    if (array.length === 0) {
+      throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
+    }
+    try {
+      var med = median(array);
+      return median(map(array, function (value) {
+        return abs(subtract(value, med));
+      }));
+    } catch (err) {
+      if (err instanceof TypeError && err.message.includes('median')) {
+        throw new TypeError(err.message.replace('median', 'mad'));
+      } else {
+        throw improveErrorMessage(err, 'mad');
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/max.js b/node_modules/mathjs/lib/esm/function/statistics/max.js
new file mode 100644
index 0000000..26bf3e7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/max.js
@@ -0,0 +1,106 @@
+import { deepForEach, reduce, containsCollections } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'max';
+var dependencies = ['typed', 'config', 'numeric', 'larger', 'isNaN'];
+export var createMax = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    larger,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the maximum value of a matrix or a  list with values.
+   * In case of a multidimensional array, the maximum of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.max(a, b, c, ...)
+   *     math.max(A)
+   *     math.max(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.max(2, 1, 4, 3)                  // returns 4
+   *     math.max([2, 1, 4, 3])                // returns 4
+   *
+   *     // maximum over a specified dimension (zero-based)
+   *     math.max([[2, 5], [4, 3], [1, 7]], 0) // returns [4, 7]
+   *     math.max([[2, 5], [4, 3], [1, 7]], 1) // returns [5, 4, 7]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, min, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The maximum value
+   */
+  return typed(name, {
+    // max([a, b, c, d, ...])
+    'Array | Matrix': _max,
+    // max([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {
+      return reduce(array, dim.valueOf(), _largest);
+    },
+    // max(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function max');
+      }
+      return _max(args);
+    }
+  });
+
+  /**
+   * Return the largest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is largest, or y when y is largest
+   * @private
+   */
+  function _largest(x, y) {
+    try {
+      return larger(x, y) ? x : y;
+    } catch (err) {
+      throw improveErrorMessage(err, 'max', y);
+    }
+  }
+
+  /**
+   * Recursively calculate the maximum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} max
+   * @private
+   */
+  function _max(array) {
+    var res;
+    deepForEach(array, function (value) {
+      try {
+        if (mathIsNaN(value)) {
+          res = value;
+        } else if (res === undefined || larger(value, res)) {
+          res = value;
+        }
+      } catch (err) {
+        throw improveErrorMessage(err, 'max', value);
+      }
+    });
+    if (res === undefined) {
+      throw new Error('Cannot calculate max of an empty array');
+    }
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof res === 'string') {
+      res = numeric(res, safeNumberType(res, config));
+    }
+    return res;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mean.js b/node_modules/mathjs/lib/esm/function/statistics/mean.js
new file mode 100644
index 0000000..62d910f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mean.js
@@ -0,0 +1,94 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { arraySize } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'mean';
+var dependencies = ['typed', 'add', 'divide'];
+export var createMean = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide
+  } = _ref;
+  /**
+   * Compute the mean value of matrix or a list with values.
+   * In case of a multidimensional array, the mean of the flattened array
+   * will be calculated. When `dim` is provided, the maximum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.mean(a, b, c, ...)
+   *     math.mean(A)
+   *     math.mean(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.mean(2, 1, 4, 3)                     // returns 2.5
+   *     math.mean([1, 2.7, 3.2, 4])               // returns 2.725
+   *
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 0)    // returns [3, 5]
+   *     math.mean([[2, 5], [6, 3], [1, 7]], 1)    // returns [3.5, 4.5, 4]
+   *
+   * See also:
+   *
+   *     median, min, max, sum, prod, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The mean of all values
+   */
+  return typed(name, {
+    // mean([a, b, c, d, ...])
+    'Array | Matrix': _mean,
+    // mean([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nmeanDim,
+    // mean(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function mean');
+      }
+      return _mean(args);
+    }
+  });
+
+  /**
+   * Calculate the mean value in an n-dimensional array, returning a
+   * n-1 dimensional array
+   * @param {Array} array
+   * @param {number} dim
+   * @return {number} mean
+   * @private
+   */
+  function _nmeanDim(array, dim) {
+    try {
+      var sum = reduce(array, dim, add);
+      var s = Array.isArray(array) ? arraySize(array) : array.size();
+      return divide(sum, s[dim]);
+    } catch (err) {
+      throw improveErrorMessage(err, 'mean');
+    }
+  }
+
+  /**
+   * Recursively calculate the mean value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} mean
+   * @private
+   */
+  function _mean(array) {
+    var sum;
+    var num = 0;
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw improveErrorMessage(err, 'mean', value);
+      }
+    });
+    if (num === 0) {
+      throw new Error('Cannot calculate the mean of an empty array');
+    }
+    return divide(sum, num);
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/median.js b/node_modules/mathjs/lib/esm/function/statistics/median.js
new file mode 100644
index 0000000..12e65a5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/median.js
@@ -0,0 +1,108 @@
+import { containsCollections } from '../../utils/collection.js';
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'median';
+var dependencies = ['typed', 'add', 'divide', 'compare', 'partitionSelect'];
+export var createMedian = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    divide,
+    compare,
+    partitionSelect
+  } = _ref;
+  /**
+   * Recursively calculate the median of an n-dimensional array
+   * @param {Array} array
+   * @return {Number} median
+   * @private
+   */
+  function _median(array) {
+    try {
+      array = flatten(array.valueOf());
+      var num = array.length;
+      if (num === 0) {
+        throw new Error('Cannot calculate median of an empty array');
+      }
+      if (num % 2 === 0) {
+        // even: return the average of the two middle values
+        var mid = num / 2 - 1;
+        var right = partitionSelect(array, mid + 1);
+
+        // array now partitioned at mid + 1, take max of left part
+        var left = array[mid];
+        for (var i = 0; i < mid; ++i) {
+          if (compare(array[i], left) > 0) {
+            left = array[i];
+          }
+        }
+        return middle2(left, right);
+      } else {
+        // odd: return the middle value
+        var m = partitionSelect(array, (num - 1) / 2);
+        return middle(m);
+      }
+    } catch (err) {
+      throw improveErrorMessage(err, 'median');
+    }
+  }
+
+  // helper function to type check the middle value of the array
+  var middle = typed({
+    'number | BigNumber | Complex | Unit': function number__BigNumber__Complex__Unit(value) {
+      return value;
+    }
+  });
+
+  // helper function to type check the two middle value of the array
+  var middle2 = typed({
+    'number | BigNumber | Complex | Unit, number | BigNumber | Complex | Unit': function number__BigNumber__Complex__Unit_number__BigNumber__Complex__Unit(left, right) {
+      return divide(add(left, right), 2);
+    }
+  });
+
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned.
+   * Supported types of values are: Number, BigNumber, Unit
+   *
+   * In case of a (multi dimensional) array or matrix, the median of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.median(a, b, c, ...)
+   *     math.median(A)
+   *
+   * Examples:
+   *
+   *     math.median(5, 2, 7)        // returns 5
+   *     math.median([3, -1, 5, 7])  // returns 4
+   *
+   * See also:
+   *
+   *     mean, min, max, sum, prod, std, variance, quantileSeq
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The median
+   */
+  return typed(name, {
+    // median([a, b, c, d, ...])
+    'Array | Matrix': _median,
+    // median([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {
+      // TODO: implement median(A, dim)
+      throw new Error('median(A, dim) is not yet supported');
+      // return reduce(arguments[0], arguments[1], ...)
+    },
+    // median(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function median');
+      }
+      return _median(args);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/min.js b/node_modules/mathjs/lib/esm/function/statistics/min.js
new file mode 100644
index 0000000..8331f7d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/min.js
@@ -0,0 +1,106 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'min';
+var dependencies = ['typed', 'config', 'numeric', 'smaller', 'isNaN'];
+export var createMin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    numeric,
+    smaller,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the minimum value of a matrix or a  list of values.
+   * In case of a multidimensional array, the minimum of the flattened array
+   * will be calculated. When `dim` is provided, the minimum over the selected
+   * dimension will be calculated. Parameter `dim` is zero-based.
+   *
+   * Syntax:
+   *
+   *     math.min(a, b, c, ...)
+   *     math.min(A)
+   *     math.min(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.min(2, 1, 4, 3)                  // returns 1
+   *     math.min([2, 1, 4, 3])                // returns 1
+   *
+   *     // minimum over a specified dimension (zero-based)
+   *     math.min([[2, 5], [4, 3], [1, 7]], 0) // returns [1, 3]
+   *     math.min([[2, 5], [4, 3], [1, 7]], 1) // returns [2, 3, 1]
+   *
+   *     math.max(2.7, 7.1, -4.5, 2.0, 4.1)    // returns 7.1
+   *     math.min(2.7, 7.1, -4.5, 2.0, 4.1)    // returns -4.5
+   *
+   * See also:
+   *
+   *    mean, median, max, prod, std, sum, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The minimum value
+   */
+  return typed(name, {
+    // min([a, b, c, d, ...])
+    'Array | Matrix': _min,
+    // min([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {
+      return reduce(array, dim.valueOf(), _smallest);
+    },
+    // min(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function min');
+      }
+      return _min(args);
+    }
+  });
+
+  /**
+   * Return the smallest of two values
+   * @param {*} x
+   * @param {*} y
+   * @returns {*} Returns x when x is smallest, or y when y is smallest
+   * @private
+   */
+  function _smallest(x, y) {
+    try {
+      return smaller(x, y) ? x : y;
+    } catch (err) {
+      throw improveErrorMessage(err, 'min', y);
+    }
+  }
+
+  /**
+   * Recursively calculate the minimum value in an n-dimensional array
+   * @param {Array} array
+   * @return {number} min
+   * @private
+   */
+  function _min(array) {
+    var min;
+    deepForEach(array, function (value) {
+      try {
+        if (mathIsNaN(value)) {
+          min = value;
+        } else if (min === undefined || smaller(value, min)) {
+          min = value;
+        }
+      } catch (err) {
+        throw improveErrorMessage(err, 'min', value);
+      }
+    });
+    if (min === undefined) {
+      throw new Error('Cannot calculate min of an empty array');
+    }
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof min === 'string') {
+      min = numeric(min, safeNumberType(min, config));
+    }
+    return min;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/mode.js b/node_modules/mathjs/lib/esm/function/statistics/mode.js
new file mode 100644
index 0000000..267d112
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/mode.js
@@ -0,0 +1,76 @@
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'mode';
+var dependencies = ['typed', 'isNaN', 'isNumeric'];
+export var createMode = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNaN: mathIsNaN,
+    isNumeric
+  } = _ref;
+  /**
+  * Computes the mode of a set of numbers or a list with values(numbers or characters).
+  * If there are multiple modes, it returns a list of those values.
+  *
+  * Syntax:
+  *
+  *     math.mode(a, b, c, ...)
+  *     math.mode(A)
+  *
+  * Examples:
+  *
+  *     math.mode(2, 1, 4, 3, 1)                            // returns [1]
+  *     math.mode([1, 2.7, 3.2, 4, 2.7])                    // returns [2.7]
+  *     math.mode(1, 4, 6, 1, 6)                             // returns [1, 6]
+  *     math.mode('a','a','b','c')                           // returns ["a"]
+  *     math.mode(1, 1.5, 'abc')                             // returns [1, 1.5, "abc"]
+  *
+  * See also:
+  *
+  *     median,
+  *     mean
+  *
+  * @param {... *} args  A single matrix
+  * @return {*} The mode of all values
+  */
+  return typed(name, {
+    'Array | Matrix': _mode,
+    '...': function _(args) {
+      return _mode(args);
+    }
+  });
+
+  /**
+   * Calculates the mode in an 1-dimensional array
+   * @param {Array} values
+   * @return {Array} mode
+   * @private
+   */
+  function _mode(values) {
+    values = flatten(values.valueOf());
+    var num = values.length;
+    if (num === 0) {
+      throw new Error('Cannot calculate mode of an empty array');
+    }
+    var count = {};
+    var mode = [];
+    var max = 0;
+    for (var i = 0; i < values.length; i++) {
+      var value = values[i];
+      if (isNumeric(value) && mathIsNaN(value)) {
+        throw new Error('Cannot calculate mode of an array containing NaN values');
+      }
+      if (!(value in count)) {
+        count[value] = 0;
+      }
+      count[value]++;
+      if (count[value] === max) {
+        mode.push(value);
+      } else if (count[value] > max) {
+        max = count[value];
+        mode = [value];
+      }
+    }
+    return mode;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/prod.js b/node_modules/mathjs/lib/esm/function/statistics/prod.js
new file mode 100644
index 0000000..208357f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/prod.js
@@ -0,0 +1,79 @@
+import { deepForEach } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'prod';
+var dependencies = ['typed', 'config', 'multiplyScalar', 'numeric'];
+export var createProd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    multiplyScalar,
+    numeric
+  } = _ref;
+  /**
+   * Compute the product of a matrix or a list with values.
+   * In case of a multidimensional array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.prod(a, b, c, ...)
+   *     math.prod(A)
+   *
+   * Examples:
+   *
+   *     math.multiply(2, 3)           // returns 6
+   *     math.prod(2, 3)               // returns 6
+   *     math.prod(2, 3, 4)            // returns 24
+   *     math.prod([2, 3, 4])          // returns 24
+   *     math.prod([[2, 5], [4, 3]])   // returns 120
+   *
+   * See also:
+   *
+   *    mean, median, min, max, sum, std, variance
+   *
+   * @param {... *} args  A single matrix or or multiple scalar values
+   * @return {*} The product of all values
+   */
+  return typed(name, {
+    // prod([a, b, c, d, ...])
+    'Array | Matrix': _prod,
+    // prod([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {
+      // TODO: implement prod(A, dim)
+      throw new Error('prod(A, dim) is not yet supported');
+      // return reduce(arguments[0], arguments[1], math.prod)
+    },
+    // prod(a, b, c, d, ...)
+    '...': function _(args) {
+      return _prod(args);
+    }
+  });
+
+  /**
+   * Recursively calculate the product of an n-dimensional array
+   * @param {Array} array
+   * @return {number} prod
+   * @private
+   */
+  function _prod(array) {
+    var prod;
+    deepForEach(array, function (value) {
+      try {
+        prod = prod === undefined ? value : multiplyScalar(prod, value);
+      } catch (err) {
+        throw improveErrorMessage(err, 'prod', value);
+      }
+    });
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (typeof prod === 'string') {
+      prod = numeric(prod, safeNumberType(prod, config));
+    }
+    if (prod === undefined) {
+      throw new Error('Cannot calculate prod of an empty array');
+    }
+    return prod;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js b/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js
new file mode 100644
index 0000000..ca3299e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/quantileSeq.js
@@ -0,0 +1,161 @@
+import { isNumber } from '../../utils/is.js';
+import { flatten } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+var name = 'quantileSeq';
+var dependencies = ['typed', '?bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger', 'mapSlices'];
+export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    bignumber,
+    add,
+    subtract,
+    divide,
+    multiply,
+    partitionSelect,
+    compare,
+    isInteger,
+    smaller,
+    smallerEq,
+    larger,
+    mapSlices
+  } = _ref;
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned.
+   * Supported types of sequence values are: Number, BigNumber, Unit
+   * Supported types of probability are: Number, BigNumber
+   *
+   * In case of a multidimensional array or matrix, the prob order quantile
+   * of all elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.quantileSeq(A, prob[, sorted])
+   *     math.quantileSeq(A, [prob1, prob2, ...][, sorted])
+   *     math.quantileSeq(A, N[, sorted])
+   *
+   * Examples:
+   *
+   *     math.quantileSeq([3, -1, 5, 7], 0.5)         // returns 4
+   *     math.quantileSeq([3, -1, 5, 7], [1/3, 2/3])  // returns [3, 5]
+   *     math.quantileSeq([3, -1, 5, 7], 2)           // returns [3, 5]
+   *     math.quantileSeq([-1, 3, 5, 7], 0.5, true)   // returns 4
+   *
+   * See also:
+   *
+   *     median, mean, min, max, sum, prod, std, variance
+   *
+   * @param {Array, Matrix} data                A single matrix or Array
+   * @param {Number, BigNumber, Array} probOrN  prob is the order of the quantile, while N is
+   *                                            the amount of evenly distributed steps of
+   *                                            probabilities; only one of these options can
+   *                                            be provided
+   * @param {Boolean} sorted=false              is data sorted in ascending order
+   * @return {Number, BigNumber, Unit, Array}   Quantile(s)
+   */
+  return typed(name, {
+    'Array | Matrix, number | BigNumber': (data, p) => _quantileSeqProbNumber(data, p, false),
+    'Array | Matrix, number | BigNumber, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbNumber),
+    'Array | Matrix, number | BigNumber, boolean': _quantileSeqProbNumber,
+    'Array | Matrix, number | BigNumber, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbNumber),
+    'Array | Matrix, Array | Matrix': (data, p) => _quantileSeqProbCollection(data, p, false),
+    'Array | Matrix, Array | Matrix, number': (data, prob, dim) => _quantileSeqDim(data, prob, false, dim, _quantileSeqProbCollection),
+    'Array | Matrix, Array | Matrix, boolean': _quantileSeqProbCollection,
+    'Array | Matrix, Array | Matrix, boolean, number': (data, prob, sorted, dim) => _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbCollection)
+  });
+  function _quantileSeqDim(data, prob, sorted, dim, fn) {
+    return mapSlices(data, dim, x => fn(x, prob, sorted));
+  }
+  function _quantileSeqProbNumber(data, probOrN, sorted) {
+    var probArr;
+    var dataArr = data.valueOf();
+    if (smaller(probOrN, 0)) {
+      throw new Error('N/prob must be non-negative');
+    }
+    if (smallerEq(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], prob[,sorted])
+      return isNumber(probOrN) ? _quantileSeq(dataArr, probOrN, sorted) : bignumber(_quantileSeq(dataArr, probOrN, sorted));
+    }
+    if (larger(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], N[,sorted])
+      if (!isInteger(probOrN)) {
+        throw new Error('N must be a positive integer');
+      }
+
+      // largest possible Array length is 2^32-1
+      // 2^32 < 10^15, thus safe conversion guaranteed
+      if (larger(probOrN, 4294967295)) {
+        throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
+      }
+      var nPlusOne = add(probOrN, 1);
+      probArr = [];
+      for (var i = 0; smaller(i, probOrN); i++) {
+        var prob = divide(i + 1, nPlusOne);
+        probArr.push(_quantileSeq(dataArr, prob, sorted));
+      }
+      return isNumber(probOrN) ? probArr : bignumber(probArr);
+    }
+  }
+
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array, Matrix} array
+   * @param {Array, Matrix} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+
+  function _quantileSeqProbCollection(data, probOrN, sorted) {
+    var dataArr = data.valueOf();
+    // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
+    var probOrNArr = probOrN.valueOf();
+    var probArr = [];
+    for (var i = 0; i < probOrNArr.length; ++i) {
+      probArr.push(_quantileSeq(dataArr, probOrNArr[i], sorted));
+    }
+    return probArr;
+  }
+
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array} array
+   * @param {Number, BigNumber} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
+  function _quantileSeq(array, prob, sorted) {
+    var flat = flatten(array);
+    var len = flat.length;
+    if (len === 0) {
+      throw new Error('Cannot calculate quantile of an empty sequence');
+    }
+    var index = isNumber(prob) ? prob * (len - 1) : prob.times(len - 1);
+    var integerPart = isNumber(prob) ? Math.floor(index) : index.floor().toNumber();
+    var fracPart = isNumber(prob) ? index % 1 : index.minus(integerPart);
+    if (isInteger(index)) {
+      return sorted ? flat[index] : partitionSelect(flat, isNumber(prob) ? index : index.valueOf());
+    }
+    var left;
+    var right;
+    if (sorted) {
+      left = flat[integerPart];
+      right = flat[integerPart + 1];
+    } else {
+      right = partitionSelect(flat, integerPart + 1);
+
+      // max of partition is kth largest
+      left = flat[integerPart];
+      for (var i = 0; i < integerPart; ++i) {
+        if (compare(flat[i], left) > 0) {
+          left = flat[i];
+        }
+      }
+    }
+    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+    return add(multiply(left, subtract(1, fracPart)), multiply(right, fracPart));
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/std.js b/node_modules/mathjs/lib/esm/function/statistics/std.js
new file mode 100644
index 0000000..25c6536
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/std.js
@@ -0,0 +1,97 @@
+import { factory } from '../../utils/factory.js';
+import { isCollection } from '../../utils/is.js';
+var name = 'std';
+var dependencies = ['typed', 'map', 'sqrt', 'variance'];
+export var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    map,
+    sqrt,
+    variance
+  } = _ref;
+  /**
+   * Compute the standard deviation of a matrix or a  list with values.
+   * The standard deviations is defined as the square root of the variance:
+   * `std(A) = sqrt(variance(A))`.
+   * In case of a (multi dimensional) array or matrix, the standard deviation
+   * over all elements will be calculated by default, unless an axis is specified
+   * in which case the standard deviation will be computed along that axis.
+   *
+   * Additionally, it is possible to compute the standard deviation along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Syntax:
+   *
+   *     math.std(a, b, c, ...)
+   *     math.std(A)
+   *     math.std(A, normalization)
+   *     math.std(A, dimension)
+   *     math.std(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.std(2, 4, 6)                     // returns 2
+   *     math.std([2, 4, 6, 8])                // returns 2.581988897471611
+   *     math.std([2, 4, 6, 8], 'uncorrected') // returns 2.23606797749979
+   *     math.std([2, 4, 6, 8], 'biased')      // returns 2
+   *
+   *     math.std([[1, 2, 3], [4, 5, 6]])      // returns 1.8708286933869707
+   *     math.std([[1, 2, 3], [4, 6, 8]], 0)    // returns [2.1213203435596424, 2.8284271247461903, 3.5355339059327378]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1)    // returns [1, 2]
+   *     math.std([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.7071067811865476, 1.4142135623730951]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, sum, variance
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the standard deviation for a matrix
+   * @return {*} The standard deviation
+   */
+  return typed(name, {
+    // std([a, b, c, d, ...])
+    'Array | Matrix': _std,
+    // std([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _std,
+    // std([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': _std,
+    // std([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _std,
+    // std(a, b, c, d, ...)
+    '...': function _(args) {
+      return _std(args);
+    }
+  });
+  function _std(array, normalization) {
+    if (array.length === 0) {
+      throw new SyntaxError('Function std requires one or more parameters (0 provided)');
+    }
+    try {
+      var v = variance.apply(null, arguments);
+      if (isCollection(v)) {
+        return map(v, sqrt);
+      } else {
+        return sqrt(v);
+      }
+    } catch (err) {
+      if (err instanceof TypeError && err.message.includes(' variance')) {
+        throw new TypeError(err.message.replace(' variance', ' std'));
+      } else {
+        throw err;
+      }
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/sum.js b/node_modules/mathjs/lib/esm/function/statistics/sum.js
new file mode 100644
index 0000000..661e373
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/sum.js
@@ -0,0 +1,85 @@
+import { containsCollections, deepForEach, reduce } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { safeNumberType } from '../../utils/number.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var name = 'sum';
+var dependencies = ['typed', 'config', 'add', 'numeric'];
+export var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    add,
+    numeric
+  } = _ref;
+  /**
+   * Compute the sum of a matrix or a list with values.
+   * In case of a multidimensional array or matrix, the sum of all
+   * elements will be calculated.
+   *
+   * Syntax:
+   *
+   *     math.sum(a, b, c, ...)
+   *     math.sum(A)
+   *     math.sum(A, dimension)
+   *
+   * Examples:
+   *
+   *     math.sum(2, 1, 4, 3)               // returns 10
+   *     math.sum([2, 1, 4, 3])             // returns 10
+   *     math.sum([[2, 5], [4, 3], [1, 7]]) // returns 22
+   *
+   * See also:
+   *
+   *    mean, median, min, max, prod, std, variance, cumsum
+   *
+   * @param {... *} args  A single matrix or multiple scalar values
+   * @return {*} The sum of all values
+   */
+  return typed(name, {
+    // sum([a, b, c, d, ...])
+    'Array | Matrix': _sum,
+    // sum([a, b, c, d, ...], dim)
+    'Array | Matrix, number | BigNumber': _nsumDim,
+    // sum(a, b, c, d, ...)
+    '...': function _(args) {
+      if (containsCollections(args)) {
+        throw new TypeError('Scalar values expected in function sum');
+      }
+      return _sum(args);
+    }
+  });
+
+  /**
+   * Recursively calculate the sum of an n-dimensional array
+   * @param {Array | Matrix} array
+   * @return {number} sum
+   * @private
+   */
+  function _sum(array) {
+    var sum;
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+      } catch (err) {
+        throw improveErrorMessage(err, 'sum', value);
+      }
+    });
+
+    // make sure returning numeric value: parse a string into a numeric value
+    if (sum === undefined) {
+      sum = numeric(0, config.number);
+    }
+    if (typeof sum === 'string') {
+      sum = numeric(sum, safeNumberType(sum, config));
+    }
+    return sum;
+  }
+  function _nsumDim(array, dim) {
+    try {
+      var sum = reduce(array, dim, add);
+      return sum;
+    } catch (err) {
+      throw improveErrorMessage(err, 'sum');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js b/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js
new file mode 100644
index 0000000..9ef8737
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/utils/improveErrorMessage.js
@@ -0,0 +1,25 @@
+import { typeOf } from '../../../utils/is.js';
+
+/**
+ * Improve error messages for statistics functions. Errors are typically
+ * thrown in an internally used function like larger, causing the error
+ * not to mention the function (like max) which is actually used by the user.
+ *
+ * @param {Error} err
+ * @param {String} fnName
+ * @param {*} [value]
+ * @return {Error}
+ */
+export function improveErrorMessage(err, fnName, value) {
+  // TODO: add information with the index (also needs transform in expression parser)
+  var details;
+  if (String(err).includes('Unexpected type')) {
+    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
+    return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
+  }
+  if (String(err).includes('complex numbers')) {
+    details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';
+    return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
+  }
+  return err;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/statistics/variance.js b/node_modules/mathjs/lib/esm/function/statistics/variance.js
new file mode 100644
index 0000000..d639a17
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/statistics/variance.js
@@ -0,0 +1,153 @@
+import { deepForEach } from '../../utils/collection.js';
+import { isBigNumber } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { improveErrorMessage } from './utils/improveErrorMessage.js';
+var DEFAULT_NORMALIZATION = 'unbiased';
+var name = 'variance';
+var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'mapSlices', 'isNaN'];
+export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    add,
+    subtract,
+    multiply,
+    divide,
+    mapSlices,
+    isNaN: mathIsNaN
+  } = _ref;
+  /**
+   * Compute the variance of a matrix or a  list with values.
+   * In case of a multidimensional array or matrix, the variance over all
+   * elements will be calculated.
+   *
+   * Additionally, it is possible to compute the variance along the rows
+   * or columns of a matrix by specifying the dimension as the second argument.
+   *
+   * Optionally, the type of normalization can be specified as the final
+   * parameter. The parameter `normalization` can be one of the following values:
+   *
+   * - 'unbiased' (default) The sum of squared errors is divided by (n - 1)
+   * - 'uncorrected'        The sum of squared errors is divided by n
+   * - 'biased'             The sum of squared errors is divided by (n + 1)
+   *
+   *
+   * Note that older browser may not like the variable name `var`. In that
+   * case, the function can be called as `math['var'](...)` instead of
+   * `math.var(...)`.
+   *
+   * Syntax:
+   *
+   *     math.variance(a, b, c, ...)
+   *     math.variance(A)
+   *     math.variance(A, normalization)
+   *     math.variance(A, dimension)
+   *     math.variance(A, dimension, normalization)
+   *
+   * Examples:
+   *
+   *     math.variance(2, 4, 6)                     // returns 4
+   *     math.variance([2, 4, 6, 8])                // returns 6.666666666666667
+   *     math.variance([2, 4, 6, 8], 'uncorrected') // returns 5
+   *     math.variance([2, 4, 6, 8], 'biased')      // returns 4
+   *
+   *     math.variance([[1, 2, 3], [4, 5, 6]])      // returns 3.5
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 0)   // returns [4.5, 8, 12.5]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1)   // returns [1, 4]
+   *     math.variance([[1, 2, 3], [4, 6, 8]], 1, 'biased') // returns [0.5, 2]
+   *
+   * See also:
+   *
+   *    mean, median, max, min, prod, std, sum
+   *
+   * @param {Array | Matrix} array
+   *                        A single matrix or or multiple scalar values
+   * @param {string} [normalization='unbiased']
+   *                        Determines how to normalize the variance.
+   *                        Choose 'unbiased' (default), 'uncorrected', or 'biased'.
+   * @param dimension {number | BigNumber}
+   *                        Determines the axis to compute the variance for a matrix
+   * @return {*} The variance
+   */
+  return typed(name, {
+    // variance([a, b, c, d, ...])
+    'Array | Matrix': function Array__Matrix(array) {
+      return _var(array, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, d, ...], normalization)
+    'Array | Matrix, string': _var,
+    // variance([a, b, c, c, ...], dim)
+    'Array | Matrix, number | BigNumber': function Array__Matrix_number__BigNumber(array, dim) {
+      return _varDim(array, dim, DEFAULT_NORMALIZATION);
+    },
+    // variance([a, b, c, c, ...], dim, normalization)
+    'Array | Matrix, number | BigNumber, string': _varDim,
+    // variance(a, b, c, d, ...)
+    '...': function _(args) {
+      return _var(args, DEFAULT_NORMALIZATION);
+    }
+  });
+
+  /**
+   * Recursively calculate the variance of an n-dimensional array
+   * @param {Array} array
+   * @param {string} normalization
+   *                        Determines how to normalize the variance:
+   *                        - 'unbiased'    The sum of squared errors is divided by (n - 1)
+   *                        - 'uncorrected' The sum of squared errors is divided by n
+   *                        - 'biased'      The sum of squared errors is divided by (n + 1)
+   * @return {number | BigNumber} variance
+   * @private
+   */
+  function _var(array, normalization) {
+    var sum;
+    var num = 0;
+    if (array.length === 0) {
+      throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+    }
+
+    // calculate the mean and number of elements
+    deepForEach(array, function (value) {
+      try {
+        sum = sum === undefined ? value : add(sum, value);
+        num++;
+      } catch (err) {
+        throw improveErrorMessage(err, 'variance', value);
+      }
+    });
+    if (num === 0) throw new Error('Cannot calculate variance of an empty array');
+    var mean = divide(sum, num);
+
+    // calculate the variance
+    sum = undefined;
+    deepForEach(array, function (value) {
+      var diff = subtract(value, mean);
+      sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));
+    });
+    if (mathIsNaN(sum)) {
+      return sum;
+    }
+    switch (normalization) {
+      case 'uncorrected':
+        return divide(sum, num);
+      case 'biased':
+        return divide(sum, num + 1);
+      case 'unbiased':
+        {
+          var zero = isBigNumber(sum) ? sum.mul(0) : 0;
+          return num === 1 ? zero : divide(sum, num - 1);
+        }
+      default:
+        throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
+    }
+  }
+  function _varDim(array, dim, normalization) {
+    try {
+      if (array.length === 0) {
+        throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
+      }
+      return mapSlices(array, dim, x => _var(x, normalization));
+    } catch (err) {
+      throw improveErrorMessage(err, 'variance');
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/bin.js b/node_modules/mathjs/lib/esm/function/string/bin.js
new file mode 100644
index 0000000..3a7ced1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/bin.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+var name = 'bin';
+var dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as binary.
+ *
+ * Syntax:
+ *
+ *    math.bin(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0b10"
+ *    math.bin(2)
+ *
+ * See also:
+ *
+ *    oct
+ *    hex
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+export var createBin = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function number__BigNumber(n) {
+      return format(n, {
+        notation: 'bin'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {
+      return format(n, {
+        notation: 'bin',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/format.js b/node_modules/mathjs/lib/esm/function/string/format.js
new file mode 100644
index 0000000..8ee59cc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/format.js
@@ -0,0 +1,131 @@
+import { format as formatString } from '../../utils/string.js';
+import { factory } from '../../utils/factory.js';
+var name = 'format';
+var dependencies = ['typed'];
+export var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Format a value of any type into a string.
+   *
+   * Syntax:
+   *
+   *    math.format(value)
+   *    math.format(value, options)
+   *    math.format(value, precision)
+   *    math.format(value, callback)
+   *
+   * Where:
+   *
+   *  - `value: *`
+   *    The value to be formatted
+   *  - `options: Object`
+   *    An object with formatting options. Available options:
+   *    - `notation: string`
+   *      Number notation. Choose from:
+   *      - `'fixed'`
+   *        Always use regular number notation.
+   *        For example `'123.40'` and `'14000000'`
+   *      - `'exponential'`
+   *        Always use exponential notation.
+   *        For example `'1.234e+2'` and `'1.4e+7'`
+   *      - `'engineering'`
+   *        Always use engineering notation: always have exponential notation,
+   *        and select the exponent to be a multiple of `3`.
+   *        For example `'123.4e+0'` and `'14.0e+6'`
+   *      - `'auto'` (default)
+   *        Regular number notation for numbers having an absolute value between
+   *        `lower` and `upper` bounds, and uses exponential notation elsewhere.
+   *        Lower bound is included, upper bound is excluded.
+   *        For example `'123.4'` and `'1.4e7'`.
+   *      - `'bin'`, `'oct'`, or `'hex'`
+   *        Format the number using binary, octal, or hexadecimal notation.
+   *        For example `'0b1101'` and `'0x10fe'`.
+   *    - `wordSize: number | BigNumber`
+   *      The word size in bits to use for formatting in binary, octal, or
+   *      hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`
+   *      values for `notation` option. When this option is defined the value
+   *      is formatted as a signed twos complement integer of the given word
+   *      size and the size suffix is appended to the output.
+   *      For example `format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'`.
+   *      Default value is undefined.
+   *    - `precision: number | BigNumber`
+   *      Limit the number of digits of the formatted value.
+   *      For regular numbers, must be a number between `0` and `16`.
+   *      For bignumbers, the maximum depends on the configured precision,
+   *      see function `config()`.
+   *      In case of notations `'exponential'`, `'engineering'`, and `'auto'`,
+   *      `precision` defines the total number of significant digits returned.
+   *      In case of notation `'fixed'`, `precision` defines the number of
+   *      significant digits after the decimal point.
+   *      `precision` is undefined by default.
+   *    - `lowerExp: number`
+   *      Exponent determining the lower boundary for formatting a value with
+   *      an exponent when `notation='auto'`. Default value is `-3`.
+   *    - `upperExp: number`
+   *      Exponent determining the upper boundary for formatting a value with
+   *      an exponent when `notation='auto'`. Default value is `5`.
+   *    - `fraction: string`. Available values: `'ratio'` (default) or `'decimal'`.
+   *      For example `format(fraction(1, 3))` will output `'1/3'` when `'ratio'`
+   *      is configured, and will output `'0.(3)'` when `'decimal'` is configured.
+   *    - `truncate: number`. Specifies the maximum allowed length of the
+   *      returned string. If it had been longer, the excess characters
+   *      are deleted and replaced with `'...'`.
+   * - `callback: function`
+   *   A custom formatting function, invoked for all numeric elements in `value`,
+   *   for example all elements of a matrix, or the real and imaginary
+   *   parts of a complex number. This callback can be used to override the
+   *   built-in numeric notation with any type of formatting. Function `callback`
+   *   is called with `value` as parameter and must return a string.
+   *
+   * When `value` is an Object:
+   *
+   * - When the object contains a property `format` being a function, this function
+   *   is invoked as `value.format(options)` and the result is returned.
+   * - When the object has its own `toString` method, this method is invoked
+   *   and the result is returned.
+   * - In other cases the function will loop over all object properties and
+   *   return JSON object notation like '{"a": 2, "b": 3}'.
+   *
+   * When value is a function:
+   *
+   * - When the function has a property `syntax`, it returns this
+   *   syntax description.
+   * - In other cases, a string `'function'` is returned.
+   *
+   * Examples:
+   *
+   *    math.format(6.4)                                        // returns '6.4'
+   *    math.format(1240000)                                    // returns '1.24e+6'
+   *    math.format(1/3)                                        // returns '0.3333333333333333'
+   *    math.format(1/3, 3)                                     // returns '0.333'
+   *    math.format(21385, 2)                                   // returns '21000'
+   *    math.format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+   *    math.format(2.3,  {notation: 'fixed', precision: 4})    // returns '2.3000'
+   *    math.format(52.8, {notation: 'exponential'})            // returns '5.28e+1'
+   *    math.format(12400, {notation: 'engineering'})           // returns '12.4e+3'
+   *    math.format(2000, {lowerExp: -2, upperExp: 2})          // returns '2e+3'
+   *
+   *    function formatCurrency(value) {
+   *      // return currency notation with two digits:
+   *      return '$' + value.toFixed(2)
+   *
+   *      // you could also use math.format inside the callback:
+   *      // return '$' + math.format(value, {notation: 'fixed', precision: 2})
+   *    }
+   *    math.format([2.1, 3, 0.016], formatCurrency)            // returns '[$2.10, $3.00, $0.02]'
+   *
+   * See also:
+   *
+   *    print
+   *
+   * @param {*} value                               Value to be stringified
+   * @param {Object | Function | number} [options]  Formatting options
+   * @return {string} The formatted value
+   */
+  return typed(name, {
+    any: formatString,
+    'any, Object | function | number | BigNumber': formatString
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/hex.js b/node_modules/mathjs/lib/esm/function/string/hex.js
new file mode 100644
index 0000000..7004a5d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/hex.js
@@ -0,0 +1,43 @@
+import { factory } from '../../utils/factory.js';
+var name = 'hex';
+var dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as hexadecimal.
+ *
+ * Syntax:
+ *
+ *    math.hex(value)
+ *
+ * Examples:
+ *
+ *    math.hex(240) // returns "0xf0"
+ *
+ * See also:
+ *
+ *    oct
+ *    bin
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+export var createHex = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function number__BigNumber(n) {
+      return format(n, {
+        notation: 'hex'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {
+      return format(n, {
+        notation: 'hex',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/oct.js b/node_modules/mathjs/lib/esm/function/string/oct.js
new file mode 100644
index 0000000..673fd50
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/oct.js
@@ -0,0 +1,45 @@
+import { factory } from '../../utils/factory.js';
+var name = 'oct';
+var dependencies = ['typed', 'format'];
+
+/**
+ * Format a number as octal.
+ *
+ * Syntax:
+ *
+ *    math.oct(value)
+ *
+ * Examples:
+ *
+ *    //the following outputs "0o70"
+ *    math.oct(56)
+ *
+ * See also:
+ *
+ *    bin
+ *    hex
+ *
+ * @param {number | BigNumber} value    Value to be stringified
+ * @param {number | BigNumber} wordSize Optional word size (see `format`)
+ * @return {string}         The formatted value
+ */
+
+export var createOct = factory(name, dependencies, _ref => {
+  var {
+    typed,
+    format
+  } = _ref;
+  return typed(name, {
+    'number | BigNumber': function number__BigNumber(n) {
+      return format(n, {
+        notation: 'oct'
+      });
+    },
+    'number | BigNumber, number | BigNumber': function number__BigNumber_number__BigNumber(n, wordSize) {
+      return format(n, {
+        notation: 'oct',
+        wordSize
+      });
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/string/print.js b/node_modules/mathjs/lib/esm/function/string/print.js
new file mode 100644
index 0000000..3ee3761
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/string/print.js
@@ -0,0 +1,90 @@
+import { format } from '../../utils/string.js';
+import { isString } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { printTemplate } from '../../utils/print.js';
+var name = 'print';
+var dependencies = ['typed'];
+export var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Interpolate values into a string template.
+   *
+   * Syntax:
+   *
+   *     math.print(template, values)
+   *     math.print(template, values, precision)
+   *     math.print(template, values, options)
+   *
+   * Example usage:
+   *
+   *     // the following outputs: 'Lucy is 5 years old'
+   *     math.print('Lucy is $age years old', {age: 5})
+   *
+   *     // the following outputs: 'The value of pi is 3.141592654'
+   *     math.print('The value of pi is $pi', {pi: math.pi}, 10)
+   *
+   *     // the following outputs: 'Hello Mary! The date is 2013-03-23'
+   *     math.print('Hello $user.name! The date is $date', {
+   *       user: {
+   *         name: 'Mary',
+   *       },
+   *       date: '2013-03-23'
+   *     })
+   *
+   *     // the following outputs: 'My favorite fruits are apples and bananas !'
+   *     math.print('My favorite fruits are $0 and $1 !', [
+   *       'apples',
+   *       'bananas'
+   *     ])
+   *
+   * See also:
+   *
+   *     format
+   *
+   * @param {string} template           A string containing variable placeholders.
+   * @param {Object | Array | Matrix}   values An object or array containing variables
+   *                                    which will be filled in in the template.
+   * @param {number | Object} [options] Formatting options,
+   *                                    or the number of digits to format numbers.
+   *                                    See function math.format for a description
+   *                                    of all options.
+   * @return {string} Interpolated string
+   */
+  return typed(name, {
+    // note: Matrix will be converted automatically to an Array
+    'string, Object | Array': _print,
+    'string, Object | Array, number | Object': _print
+  });
+});
+
+/**
+ * Interpolate values into a string template.
+ * @param {string} template
+ * @param {Object} values
+ * @param {number | Object} [options]
+ * @returns {string} Interpolated string
+ * @private
+ */
+function _print(template, values, options) {
+  return template.replace(printTemplate, function (original, key) {
+    var keys = key.split('.');
+    var value = values[keys.shift()];
+    if (value !== undefined && value.isMatrix) {
+      value = value.toArray();
+    }
+    while (keys.length && value !== undefined) {
+      var k = keys.shift();
+      value = k ? value[k] : value + '.';
+    }
+    if (value !== undefined) {
+      if (!isString(value)) {
+        return format(value, options);
+      } else {
+        return value;
+      }
+    }
+    return original;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acos.js b/node_modules/mathjs/lib/esm/function/trigonometry/acos.js
new file mode 100644
index 0000000..e54c0ae
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acos.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+var name = 'acos';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAcos = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the inverse cosine of a value.
+   *
+   * To avoid confusion with the matrix arccosine, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acos(x)
+   *
+   * Examples:
+   *
+   *    math.acos(0.5)           // returns number 1.0471975511965979
+   *    math.acos(math.cos(1.5)) // returns number 1.5
+   *
+   *    math.acos(2)             // returns Complex 0 + 1.3169578969248166 i
+   *
+   * See also:
+   *
+   *    cos, atan, asin
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} The arc cosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.acos(x);
+      } else {
+        return new Complex(x, 0).acos();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.acos();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acos();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js b/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js
new file mode 100644
index 0000000..11887a0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acosh.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+import { acoshNumber } from '../../plain/number/index.js';
+var name = 'acosh';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAcosh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arccos of a value,
+   * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.acosh(x)
+   *
+   * Examples:
+   *
+   *    math.acosh(1.5)       // returns 0.9624236501192069
+   *
+   * See also:
+   *
+   *    cosh, asinh, atanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccosine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || config.predictable) {
+        return acoshNumber(x);
+      }
+      if (x <= -1) {
+        return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
+      }
+      return new Complex(x, 0).acosh();
+    },
+    Complex: function Complex(x) {
+      return x.acosh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.acosh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acot.js b/node_modules/mathjs/lib/esm/function/trigonometry/acot.js
new file mode 100644
index 0000000..7f1a03b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acot.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { acotNumber } from '../../plain/number/index.js';
+var name = 'acot';
+var dependencies = ['typed', 'BigNumber'];
+export var createAcot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
+   *
+   * To avoid confusion with the matrix arccotanget, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acot(x)
+   *
+   * Examples:
+   *
+   *    math.acot(0.5)           // returns number 1.1071487177940904
+   *    math.acot(2)             // returns number 0.4636476090008061
+   *    math.acot(math.cot(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    cot, atan
+   *
+   * @param {number | BigNumber| Complex} x   Function input
+   * @return {number | BigNumber| Complex} The arc cotangent of x
+   */
+  return typed(name, {
+    number: acotNumber,
+    Complex: function Complex(x) {
+      return x.acot();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atan();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js b/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js
new file mode 100644
index 0000000..0cad4b3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acoth.js
@@ -0,0 +1,48 @@
+import { factory } from '../../utils/factory.js';
+import { acothNumber } from '../../plain/number/index.js';
+var name = 'acoth';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAcoth = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse hyperbolic tangent of a value,
+   * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
+   *
+   * To avoid confusion with the matrix inverse hyperbolic tangent, this
+   * function does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acoth(x)
+   *
+   * Examples:
+   *
+   *    math.acoth(0.5)     // returns 0.5493061443340548 - 1.5707963267948966i
+   *
+   * See also:
+   *
+   *    acsch, asech
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccotangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= 1 || x <= -1 || config.predictable) {
+        return acothNumber(x);
+      }
+      return new Complex(x, 0).acoth();
+    },
+    Complex: function Complex(x) {
+      return x.acoth();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).atanh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js b/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js
new file mode 100644
index 0000000..50f47b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acsc.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+import { acscNumber } from '../../plain/number/index.js';
+var name = 'acsc';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAcsc = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
+   *
+   * To avoid confusion with the matrix arccosecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acsc(x)
+   *
+   * Examples:
+   *
+   *    math.acsc(2)             // returns 0.5235987755982989
+   *    math.acsc(0.5)           // returns Complex 1.5707963267948966 -1.3169578969248166i
+   *    math.acsc(math.csc(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    csc, asin, asec
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc cosecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return acscNumber(x);
+      }
+      return new Complex(x, 0).acsc();
+    },
+    Complex: function Complex(x) {
+      return x.acsc();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asin();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js b/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js
new file mode 100644
index 0000000..8e97e4a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/acsch.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { acschNumber } from '../../plain/number/index.js';
+var name = 'acsch';
+var dependencies = ['typed', 'BigNumber'];
+export var createAcsch = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse hyperbolic cosecant of a value,
+   * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.
+   *
+   * To avoid confusion with the matrix inverse hyperbolic cosecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.acsch(x)
+   *
+   * Examples:
+   *
+   *    math.acsch(0.5)       // returns 1.4436354751788103
+   *
+   * See also:
+   *
+   *    asech, acoth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arccosecant of x
+   */
+  return typed(name, {
+    number: acschNumber,
+    Complex: function Complex(x) {
+      return x.acsch();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).asinh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asec.js b/node_modules/mathjs/lib/esm/function/trigonometry/asec.js
new file mode 100644
index 0000000..09c0857
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asec.js
@@ -0,0 +1,50 @@
+import { factory } from '../../utils/factory.js';
+import { asecNumber } from '../../plain/number/index.js';
+var name = 'asec';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAsec = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
+   *
+   * To avoid confusion with the matrix arcsecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asec(x)
+   *
+   * Examples:
+   *
+   *    math.asec(2)             // returns 1.0471975511965979
+   *    math.asec(math.sec(1.5)) // returns 1.5
+   *
+   *    math.asec(0.5)           // returns Complex 0 + 1.3169578969248166i
+   *
+   * See also:
+   *
+   *    acos, acot, acsc
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} The arc secant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= -1 || x >= 1 || config.predictable) {
+        return asecNumber(x);
+      }
+      return new Complex(x, 0).asec();
+    },
+    Complex: function Complex(x) {
+      return x.asec();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acos();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asech.js b/node_modules/mathjs/lib/esm/function/trigonometry/asech.js
new file mode 100644
index 0000000..0141b7f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asech.js
@@ -0,0 +1,53 @@
+import { factory } from '../../utils/factory.js';
+import { asechNumber } from '../../plain/number/index.js';
+var name = 'asech';
+var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
+export var createAsech = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arcsecant of a value,
+   * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic arcsecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asech(x)
+   *
+   * Examples:
+   *
+   *    math.asech(0.5)       // returns 1.3169578969248166
+   *
+   * See also:
+   *
+   *    acsch, acoth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arcsecant of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        var xInv = 1 / x;
+        if (xInv > 0 || config.predictable) {
+          return asechNumber(x);
+        }
+        var ret = Math.sqrt(xInv * xInv - 1);
+        return new Complex(Math.log(ret - xInv), Math.PI);
+      }
+      return new Complex(x, 0).asech();
+    },
+    Complex: function Complex(x) {
+      return x.asech();
+    },
+    BigNumber: function BigNumber(x) {
+      return new _BigNumber(1).div(x).acosh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asin.js b/node_modules/mathjs/lib/esm/function/trigonometry/asin.js
new file mode 100644
index 0000000..d8d10f5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asin.js
@@ -0,0 +1,49 @@
+import { factory } from '../../utils/factory.js';
+var name = 'asin';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAsin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the inverse sine of a value.
+   *
+   * To avoid confusion with the matric arcsine, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asin(x)
+   *
+   * Examples:
+   *
+   *    math.asin(0.5)           // returns number 0.5235987755982989
+   *    math.asin(math.sin(1.5)) // returns number 1.5
+   *
+   *    math.asin(2)             // returns Complex 1.5707963267948966 -1.3169578969248166i
+   *
+   * See also:
+   *
+   *    sin, atan, acos
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc sine of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x >= -1 && x <= 1 || config.predictable) {
+        return Math.asin(x);
+      } else {
+        return new Complex(x, 0).asin();
+      }
+    },
+    Complex: function Complex(x) {
+      return x.asin();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asin();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js b/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js
new file mode 100644
index 0000000..0f88069
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/asinh.js
@@ -0,0 +1,40 @@
+import { factory } from '../../utils/factory.js';
+import { asinhNumber } from '../../plain/number/index.js';
+var name = 'asinh';
+var dependencies = ['typed'];
+export var createAsinh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arcsine of a value,
+   * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.
+   *
+   * To avoid confusion with the matrix hyperbolic arcsine, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.asinh(x)
+   *
+   * Examples:
+   *
+   *    math.asinh(0.5)       // returns 0.48121182505960347
+   *
+   * See also:
+   *
+   *    acosh, atanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arcsine of x
+   */
+  return typed('asinh', {
+    number: asinhNumber,
+    Complex: function Complex(x) {
+      return x.asinh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.asinh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atan.js b/node_modules/mathjs/lib/esm/function/trigonometry/atan.js
new file mode 100644
index 0000000..bf11823
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atan.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+var name = 'atan';
+var dependencies = ['typed'];
+export var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the inverse tangent of a value.
+   *
+   * To avoid confusion with matrix arctangent, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.atan(x)
+   *
+   * Examples:
+   *
+   *    math.atan(0.5)           // returns number 0.4636476090008061
+   *    math.atan(2)             // returns number 1.1071487177940904
+   *    math.atan(math.tan(1.5)) // returns number 1.5
+   *
+   * See also:
+   *
+   *    tan, asin, acos
+   *
+   * @param {number | BigNumber | Complex} x   Function input
+   * @return {number | BigNumber | Complex} The arc tangent of x
+   */
+  return typed('atan', {
+    number: function number(x) {
+      return Math.atan(x);
+    },
+    Complex: function Complex(x) {
+      return x.atan();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atan();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js b/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js
new file mode 100644
index 0000000..02286d4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atan2.js
@@ -0,0 +1,90 @@
+import { factory } from '../../utils/factory.js';
+import { createMatAlgo02xDS0 } from '../../type/matrix/utils/matAlgo02xDS0.js';
+import { createMatAlgo03xDSf } from '../../type/matrix/utils/matAlgo03xDSf.js';
+import { createMatAlgo09xS0Sf } from '../../type/matrix/utils/matAlgo09xS0Sf.js';
+import { createMatAlgo11xS0s } from '../../type/matrix/utils/matAlgo11xS0s.js';
+import { createMatAlgo12xSfs } from '../../type/matrix/utils/matAlgo12xSfs.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'atan2';
+var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];
+export var createAtan2 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    equalScalar,
+    BigNumber,
+    DenseMatrix,
+    concat
+  } = _ref;
+  var matAlgo02xDS0 = createMatAlgo02xDS0({
+    typed,
+    equalScalar
+  });
+  var matAlgo03xDSf = createMatAlgo03xDSf({
+    typed
+  });
+  var matAlgo09xS0Sf = createMatAlgo09xS0Sf({
+    typed,
+    equalScalar
+  });
+  var matAlgo11xS0s = createMatAlgo11xS0s({
+    typed,
+    equalScalar
+  });
+  var matAlgo12xSfs = createMatAlgo12xSfs({
+    typed,
+    DenseMatrix
+  });
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x.
+   * By providing two arguments, the right quadrant of the computed angle can be
+   * determined.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.atan2(y, x)
+   *
+   * Examples:
+   *
+   *    math.atan2(2, 2) / math.pi       // returns number 0.25
+   *
+   *    const angle = math.unit(60, 'deg')
+   *    const x = math.cos(angle)
+   *    const y = math.sin(angle)
+   *    math.atan2(y, x) * 180 / math.pi  // returns 60
+   *
+   *    math.atan(2)             // returns number 1.1071487177940904
+   *
+   * See also:
+   *
+   *    tan, atan, sin, cos
+   *
+   * @param {number | Array | Matrix} y  Second dimension
+   * @param {number | Array | Matrix} x  First dimension
+   * @return {number | Array | Matrix} Four-quadrant inverse tangent
+   */
+  return typed(name, {
+    'number, number': Math.atan2,
+    // Complex numbers doesn't seem to have a reasonable implementation of
+    // atan2(). Even Matlab removed the support, after they only calculated
+    // the atan only on base of the real part of the numbers and ignored
+    // the imaginary.
+
+    'BigNumber, BigNumber': (y, x) => BigNumber.atan2(y, x)
+  }, matrixAlgorithmSuite({
+    scalar: 'number | BigNumber',
+    SS: matAlgo09xS0Sf,
+    DS: matAlgo03xDSf,
+    SD: matAlgo02xDS0,
+    Ss: matAlgo11xS0s,
+    sS: matAlgo12xSfs
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js b/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js
new file mode 100644
index 0000000..ce7624a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/atanh.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+import { atanhNumber } from '../../plain/number/index.js';
+var name = 'atanh';
+var dependencies = ['typed', 'config', 'Complex'];
+export var createAtanh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config,
+    Complex
+  } = _ref;
+  /**
+   * Calculate the hyperbolic arctangent of a value,
+   * defined as `atanh(x) = ln((1 + x)/(1 - x)) / 2`.
+   *
+   * To avoid confusion with the matrix hyperbolic arctangent, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.atanh(x)
+   *
+   * Examples:
+   *
+   *    math.atanh(0.5)       // returns 0.5493061443340549
+   *
+   * See also:
+   *
+   *    acosh, asinh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic arctangent of x
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 1 && x >= -1 || config.predictable) {
+        return atanhNumber(x);
+      }
+      return new Complex(x, 0).atanh();
+    },
+    Complex: function Complex(x) {
+      return x.atanh();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.atanh();
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cos.js b/node_modules/mathjs/lib/esm/function/trigonometry/cos.js
new file mode 100644
index 0000000..1d80fa1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cos.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'cos';
+var dependencies = ['typed'];
+export var createCos = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the cosine of a value.
+   *
+   * To avoid confusion with the matrix cosine, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cos(x)
+   *
+   * Examples:
+   *
+   *    math.cos(2)                      // returns number -0.4161468365471422
+   *    math.cos(math.pi / 4)            // returns number  0.7071067811865475
+   *    math.cos(math.unit(180, 'deg'))  // returns number -1
+   *    math.cos(math.unit(60, 'deg'))   // returns number  0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Cosine of x
+   */
+  return typed(name, {
+    number: Math.cos,
+    'Complex | BigNumber': x => x.cos()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js b/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js
new file mode 100644
index 0000000..831409f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cosh.js
@@ -0,0 +1,35 @@
+import { factory } from '../../utils/factory.js';
+import { cosh as coshNumber } from '../../utils/number.js';
+var name = 'cosh';
+var dependencies = ['typed'];
+export var createCosh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cosine of a value,
+   * defined as `cosh(x) = 1/2 * (exp(x) + exp(-x))`.
+   *
+   * To avoid confusion with the matrix hyperbolic cosine, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cosh(x)
+   *
+   * Examples:
+   *
+   *    math.cosh(0.5)       // returns number 1.1276259652063807
+   *
+   * See also:
+   *
+   *    sinh, tanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cosine of x
+   */
+  return typed(name, {
+    number: coshNumber,
+    'Complex | BigNumber': x => x.cosh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/cot.js b/node_modules/mathjs/lib/esm/function/trigonometry/cot.js
new file mode 100644
index 0000000..c597776
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/cot.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { cotNumber } from '../../plain/number/index.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'cot';
+var dependencies = ['typed', 'BigNumber'];
+export var createCot = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the cotangent of a value. Defined as `cot(x) = 1 / tan(x)`.
+   *
+   * To avoid confusion with the matrix cotangent, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.cot(x)
+   *
+   * Examples:
+   *
+   *    math.cot(2)      // returns number -0.45765755436028577
+   *    1 / math.tan(2)  // returns number -0.45765755436028577
+   *
+   * See also:
+   *
+   *    tan, sec, csc
+   *
+   * @param {number | Complex | Unit | Array | Matrix} x  Function input
+   * @return {number | Complex | Array | Matrix} Cotangent of x
+   */
+  return typed(name, {
+    number: cotNumber,
+    Complex: x => x.cot(),
+    BigNumber: x => new _BigNumber(1).div(x.tan())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/coth.js b/node_modules/mathjs/lib/esm/function/trigonometry/coth.js
new file mode 100644
index 0000000..0ec6b42
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/coth.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+import { cothNumber } from '../../plain/number/index.js';
+var name = 'coth';
+var dependencies = ['typed', 'BigNumber'];
+export var createCoth = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cotangent of a value,
+   * defined as `coth(x) = 1 / tanh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic cotangent, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.coth(x)
+   *
+   * Examples:
+   *
+   *    // coth(x) = 1 / tanh(x)
+   *    math.coth(2)         // returns 1.0373147207275482
+   *    1 / math.tanh(2)     // returns 1.0373147207275482
+   *
+   * See also:
+   *
+   *    sinh, tanh, cosh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cotangent of x
+   */
+  return typed(name, {
+    number: cothNumber,
+    Complex: x => x.coth(),
+    BigNumber: x => new _BigNumber(1).div(x.tanh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/csc.js b/node_modules/mathjs/lib/esm/function/trigonometry/csc.js
new file mode 100644
index 0000000..295f377
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/csc.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { cscNumber } from '../../plain/number/index.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'csc';
+var dependencies = ['typed', 'BigNumber'];
+export var createCsc = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the cosecant of a value, defined as `csc(x) = 1/sin(x)`.
+   *
+   * To avoid confusion with the matrix cosecant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.csc(x)
+   *
+   * Examples:
+   *
+   *    math.csc(2)      // returns number 1.099750170294617
+   *    1 / math.sin(2)  // returns number 1.099750170294617
+   *
+   * See also:
+   *
+   *    sin, sec, cot
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Cosecant of x
+   */
+  return typed(name, {
+    number: cscNumber,
+    Complex: x => x.csc(),
+    BigNumber: x => new _BigNumber(1).div(x.sin())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/csch.js b/node_modules/mathjs/lib/esm/function/trigonometry/csch.js
new file mode 100644
index 0000000..869a32e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/csch.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+import { cschNumber } from '../../plain/number/index.js';
+var name = 'csch';
+var dependencies = ['typed', 'BigNumber'];
+export var createCsch = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic cosecant of a value,
+   * defined as `csch(x) = 1 / sinh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic cosecant, this function
+   * does not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.csch(x)
+   *
+   * Examples:
+   *
+   *    // csch(x) = 1/ sinh(x)
+   *    math.csch(0.5)       // returns 1.9190347513349437
+   *    1 / math.sinh(0.5)   // returns 1.9190347513349437
+   *
+   * See also:
+   *
+   *    sinh, sech, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic cosecant of x
+   */
+  return typed(name, {
+    number: cschNumber,
+    Complex: x => x.csch(),
+    BigNumber: x => new _BigNumber(1).div(x.sinh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sec.js b/node_modules/mathjs/lib/esm/function/trigonometry/sec.js
new file mode 100644
index 0000000..e8f5376
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sec.js
@@ -0,0 +1,42 @@
+import { factory } from '../../utils/factory.js';
+import { secNumber } from '../../plain/number/index.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'sec';
+var dependencies = ['typed', 'BigNumber'];
+export var createSec = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the secant of a value, defined as `sec(x) = 1/cos(x)`.
+   *
+   * To avoid confusion with the matrix secant, this function does not
+   * apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sec(x)
+   *
+   * Examples:
+   *
+   *    math.sec(2)      // returns number -2.4029979617223822
+   *    1 / math.cos(2)  // returns number -2.4029979617223822
+   *
+   * See also:
+   *
+   *    cos, csc, cot
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Secant of x
+   */
+  return typed(name, {
+    number: secNumber,
+    Complex: x => x.sec(),
+    BigNumber: x => new _BigNumber(1).div(x.cos())
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sech.js b/node_modules/mathjs/lib/esm/function/trigonometry/sech.js
new file mode 100644
index 0000000..8caa808
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sech.js
@@ -0,0 +1,39 @@
+import { factory } from '../../utils/factory.js';
+import { sechNumber } from '../../plain/number/index.js';
+var name = 'sech';
+var dependencies = ['typed', 'BigNumber'];
+export var createSech = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber: _BigNumber
+  } = _ref;
+  /**
+   * Calculate the hyperbolic secant of a value,
+   * defined as `sech(x) = 1 / cosh(x)`.
+   *
+   * To avoid confusion with the matrix hyperbolic secant, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sech(x)
+   *
+   * Examples:
+   *
+   *    // sech(x) = 1/ cosh(x)
+   *    math.sech(0.5)       // returns 0.886818883970074
+   *    1 / math.cosh(0.5)   // returns 0.886818883970074
+   *
+   * See also:
+   *
+   *    cosh, csch, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic secant of x
+   */
+  return typed(name, {
+    number: sechNumber,
+    Complex: x => x.sech(),
+    BigNumber: x => new _BigNumber(1).div(x.cosh())
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sin.js b/node_modules/mathjs/lib/esm/function/trigonometry/sin.js
new file mode 100644
index 0000000..a460fd5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sin.js
@@ -0,0 +1,44 @@
+import { factory } from '../../utils/factory.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'sin';
+var dependencies = ['typed'];
+export var createSin = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the sine of a value.
+   *
+   * To avoid confusion with the matrix sine, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sin(x)
+   *
+   * Examples:
+   *
+   *    math.sin(2)                      // returns number 0.9092974268256813
+   *    math.sin(math.pi / 4)            // returns number 0.7071067811865475
+   *    math.sin(math.unit(90, 'deg'))   // returns number 1
+   *    math.sin(math.unit(30, 'deg'))   // returns number 0.5
+   *
+   *    const angle = 0.2
+   *    math.pow(math.sin(angle), 2) + math.pow(math.cos(angle), 2) // returns number 1
+   *
+   * See also:
+   *
+   *    cos, tan
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Sine of x
+   */
+  return typed(name, {
+    number: Math.sin,
+    'Complex | BigNumber': x => x.sin()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js b/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js
new file mode 100644
index 0000000..8b2c08c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/sinh.js
@@ -0,0 +1,35 @@
+import { factory } from '../../utils/factory.js';
+import { sinhNumber } from '../../plain/number/index.js';
+var name = 'sinh';
+var dependencies = ['typed'];
+export var createSinh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic sine of a value,
+   * defined as `sinh(x) = 1/2 * (exp(x) - exp(-x))`.
+   *
+   * To avoid confusion with the matrix hyperbolic sine, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.sinh(x)
+   *
+   * Examples:
+   *
+   *    math.sinh(0.5)       // returns number 0.5210953054937474
+   *
+   * See also:
+   *
+   *    cosh, tanh
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic sine of x
+   */
+  return typed(name, {
+    number: sinhNumber,
+    'Complex | BigNumber': x => x.sinh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/tan.js b/node_modules/mathjs/lib/esm/function/trigonometry/tan.js
new file mode 100644
index 0000000..7419e95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/tan.js
@@ -0,0 +1,41 @@
+import { factory } from '../../utils/factory.js';
+import { createTrigUnit } from './trigUnit.js';
+var name = 'tan';
+var dependencies = ['typed'];
+export var createTan = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  var trigUnit = createTrigUnit({
+    typed
+  });
+
+  /**
+   * Calculate the tangent of a value. `tan(x)` is equal to `sin(x) / cos(x)`.
+   *
+   * To avoid confusion with the matrix tangent, this function does not apply
+   * to matrices.
+   *
+   * Syntax:
+   *
+   *    math.tan(x)
+   *
+   * Examples:
+   *
+   *    math.tan(0.5)                    // returns number 0.5463024898437905
+   *    math.sin(0.5) / math.cos(0.5)    // returns number 0.5463024898437905
+   *    math.tan(math.pi / 4)            // returns number 1
+   *    math.tan(math.unit(45, 'deg'))   // returns number 1
+   *
+   * See also:
+   *
+   *    atan, sin, cos
+   *
+   * @param {number | BigNumber | Complex | Unit} x  Function input
+   * @return {number | BigNumber | Complex} Tangent of x
+   */
+  return typed(name, {
+    number: Math.tan,
+    'Complex | BigNumber': x => x.tan()
+  }, trigUnit);
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js b/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js
new file mode 100644
index 0000000..d73aa80
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/tanh.js
@@ -0,0 +1,38 @@
+import { factory } from '../../utils/factory.js';
+import { tanh as _tanh } from '../../utils/number.js';
+var name = 'tanh';
+var dependencies = ['typed'];
+export var createTanh = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Calculate the hyperbolic tangent of a value,
+   * defined as `tanh(x) = (exp(2 * x) - 1) / (exp(2 * x) + 1)`.
+   *
+   * To avoid confusion with matrix hyperbolic tangent, this function does
+   * not apply to matrices.
+   *
+   * Syntax:
+   *
+   *    math.tanh(x)
+   *
+   * Examples:
+   *
+   *    // tanh(x) = sinh(x) / cosh(x) = 1 / coth(x)
+   *    math.tanh(0.5)                   // returns 0.46211715726000974
+   *    math.sinh(0.5) / math.cosh(0.5)  // returns 0.46211715726000974
+   *    1 / math.coth(0.5)               // returns 0.46211715726000974
+   *
+   * See also:
+   *
+   *    sinh, cosh, coth
+   *
+   * @param {number | BigNumber | Complex} x  Function input
+   * @return {number | BigNumber | Complex} Hyperbolic tangent of x
+   */
+  return typed('tanh', {
+    number: _tanh,
+    'Complex | BigNumber': x => x.tanh()
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js b/node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js
new file mode 100644
index 0000000..ebb5411
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/trigonometry/trigUnit.js
@@ -0,0 +1,14 @@
+import { factory } from '../../utils/factory.js';
+export var createTrigUnit = /* #__PURE__ */factory('trigUnit', ['typed'], _ref => {
+  var {
+    typed
+  } = _ref;
+  return {
+    Unit: typed.referToSelf(self => x => {
+      if (!x.hasBase(x.constructor.BASE_UNITS.ANGLE)) {
+        throw new TypeError('Unit in function cot is no angle');
+      }
+      return typed.find(self, x.valueType())(x.value);
+    })
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/unit/to.js b/node_modules/mathjs/lib/esm/function/unit/to.js
new file mode 100644
index 0000000..f11a865
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/unit/to.js
@@ -0,0 +1,46 @@
+import { factory } from '../../utils/factory.js';
+import { createMatrixAlgorithmSuite } from '../../type/matrix/utils/matrixAlgorithmSuite.js';
+var name = 'to';
+var dependencies = ['typed', 'matrix', 'concat'];
+export var createTo = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    concat
+  } = _ref;
+  var matrixAlgorithmSuite = createMatrixAlgorithmSuite({
+    typed,
+    matrix,
+    concat
+  });
+
+  /**
+   * Change the unit of a value.
+   *
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.to(x, unit)
+   *
+   * Examples:
+   *
+   *    math.to(math.unit('2 inch'), 'cm')             // returns Unit 5.08 cm
+   *    math.to(math.unit('2 inch'), math.unit('cm'))  // returns Unit 5.08 cm
+   *    math.to(math.unit(16, 'bytes'), 'bits')        // returns Unit 128 bits
+   *
+   * See also:
+   *
+   *    unit
+   *
+   * @param {Unit | Array | Matrix} x     The unit to be converted.
+   * @param {Unit | Array | Matrix} unit  New unit. Can be a string like "cm"
+   *                                      or a unit without value.
+   * @return {Unit | Array | Matrix} value with changed, fixed unit.
+   */
+  return typed(name, {
+    'Unit, Unit | string': (x, unit) => x.to(unit)
+  }, matrixAlgorithmSuite({
+    Ds: true
+  }));
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/unit/toBest.js b/node_modules/mathjs/lib/esm/function/unit/toBest.js
new file mode 100644
index 0000000..f29f423
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/unit/toBest.js
@@ -0,0 +1,47 @@
+import { factory } from '../../utils/factory.js';
+var name = 'toBest';
+var dependencies = ['typed'];
+export var createToBest = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Converts a unit to the most appropriate display unit.
+   * When no preferred units are provided, the function automatically find the best prefix.
+   * When preferred units are provided, it converts to
+   * the unit that gives a value closest to 1.
+   *
+   * Syntax:
+   *
+   *    math.toBest(unit)
+   *    math.toBest(unit, unitList)
+   *    math.toBest(unit, unitList, options)
+   *
+   * Where:
+   * - `unitList` is an optional array of preferred target units as string or Unit.
+   * - `options` is an optional object with options, formed as follows:
+   * - `offset`: number | BigNumber
+   *
+   * Examples:
+   *
+   *   math.unit(0.05, 'm').toBest(['cm', 'mm'])                 // returns Unit 5 cm
+   *   math.unit(2 / 3, 'cm').toBest()                           // returns Unit 0.6666666666666666 cm
+   *   math.unit(10, 'm').toBest(['mm', 'km'], { offset: 1.5 })  // returns Unit 10000 mm
+   *
+   * See also:
+   *
+   *    unit, to, format
+   *
+   * @param {Unit} x                          The unit to be converted
+   * @param {Array<string>} [unitList=[]]     Optional array of preferred target units
+   * @param {Object} [options]                Optional options object
+   * @return {Unit}                           Value converted to the best matching unit
+   */
+  return typed(name, {
+    Unit: x => x.toBest(),
+    'Unit, string': (x, unitList) => x.toBest(unitList.split(',')),
+    'Unit, string, Object': (x, unitList, options) => x.toBest(unitList.split(','), options),
+    'Unit, Array': (x, unitList) => x.toBest(unitList),
+    'Unit, Array, Object': (x, unitList, options) => x.toBest(unitList, options)
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/clone.js b/node_modules/mathjs/lib/esm/function/utils/clone.js
new file mode 100644
index 0000000..db81566
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/clone.js
@@ -0,0 +1,30 @@
+import { clone as objectClone } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'clone';
+var dependencies = ['typed'];
+export var createClone = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Clone an object. Will make a deep copy of the data.
+   *
+   * Syntax:
+   *
+   *     math.clone(x)
+   *
+   * Examples:
+   *
+   *    math.clone(3.5)                   // returns number 3.5
+   *    math.clone(math.complex('2-4i'))  // returns Complex 2 - 4i
+   *    math.clone(math.unit(45, 'deg'))  // returns Unit 45 deg
+   *    math.clone([[1, 2], [3, 4]])      // returns Array [[1, 2], [3, 4]]
+   *    math.clone("hello world")         // returns string "hello world"
+   *
+   * @param {*} x   Object to be cloned
+   * @return {*} A clone of object x
+   */
+  return typed(name, {
+    any: objectClone
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js b/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js
new file mode 100644
index 0000000..99d7fb7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/hasNumericValue.js
@@ -0,0 +1,50 @@
+import { factory } from '../../utils/factory.js';
+var name = 'hasNumericValue';
+var dependencies = ['typed', 'isNumeric'];
+export var createHasNumericValue = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    isNumeric
+  } = _ref;
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * In case of a string, true is returned if the string contains a numeric value.
+   *
+   * Syntax:
+   *
+   *     math.hasNumericValue(x)
+   *
+   * Examples:
+   *
+   *    math.hasNumericValue(2)                     // returns true
+   *    math.hasNumericValue('2')                   // returns true
+   *    math.isNumeric('2')                         // returns false
+   *    math.hasNumericValue(0)                     // returns true
+   *    math.hasNumericValue(math.bignumber('500')) // returns true
+   *    math.hasNumericValue(math.bigint('42'))     // returns true
+   *    math.hasNumericValue(42n)                   // returns true
+   *    math.hasNumericValue(math.fraction(4))      // returns true
+   *    math.hasNumericValue(math.complex('2-4i'))  // returns false
+   *    math.hasNumericValue(false)                 // returns true
+   *    math.hasNumericValue([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, isNumeric
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, `Boolean`, or a `String` containing number. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    boolean: () => true,
+    string: function string(x) {
+      return x.trim().length > 0 && !isNaN(Number(x));
+    },
+    any: function any(x) {
+      return isNumeric(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isInteger.js b/node_modules/mathjs/lib/esm/function/utils/isInteger.js
new file mode 100644
index 0000000..8ac1c35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isInteger.js
@@ -0,0 +1,54 @@
+import { deepMap } from '../../utils/collection.js';
+import { isInteger as isIntegerNumber } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isInteger';
+var dependencies = ['typed'];
+export var createIsInteger = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is an integer number.
+   * The function supports `number`, `BigNumber`, and `Fraction`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isInteger(x)
+   *
+   * Examples:
+   *
+   *    math.isInteger(2)                     // returns true
+   *    math.isInteger(0)                     // returns true
+   *    math.isInteger(0.5)                   // returns false
+   *    math.isInteger(math.bignumber(500))   // returns true
+   *    math.isInteger(math.fraction(4))      // returns true
+   *    math.isInteger('3')                   // returns true
+   *    math.isInteger([3, 0.5, -2])          // returns [true, false, true]
+   *    math.isInteger(math.complex('2-4i'))  // throws TypeError
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isZero
+   *
+   * @param {number | BigNumber | bigint | Fraction | Array | Matrix} x   Value to be tested
+   * @return {boolean}  Returns true when `x` contains a numeric, integer value.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isIntegerNumber,
+    // TODO: what to do with isInteger(add(0.1, 0.2))  ?
+
+    BigNumber: function BigNumber(x) {
+      return x.isInt();
+    },
+    bigint: function bigint(x) {
+      return true;
+    },
+    Fraction: function Fraction(x) {
+      return x.d === 1n;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNaN.js b/node_modules/mathjs/lib/esm/function/utils/isNaN.js
new file mode 100644
index 0000000..30935d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNaN.js
@@ -0,0 +1,58 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isNaNNumber } from '../../plain/number/index.js';
+var name = 'isNaN';
+var dependencies = ['typed'];
+export var createIsNaN = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is NaN (not a number).
+   * The function supports types `number`, `BigNumber`, `Fraction`, `Unit` and `Complex`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNaN(x)
+   *
+   * Examples:
+   *
+   *    math.isNaN(3)                     // returns false
+   *    math.isNaN(NaN)                   // returns true
+   *    math.isNaN(0)                     // returns false
+   *    math.isNaN(math.bignumber(NaN))   // returns true
+   *    math.isNaN(math.bignumber(0))     // returns false
+   *    math.isNaN(math.fraction(-2, 5))  // returns false
+   *    math.isNaN('-2')                  // returns false
+   *    math.isNaN([2, 0, -3, NaN])       // returns [false, false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isNegative, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is NaN.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: isNaNNumber,
+    BigNumber: function BigNumber(x) {
+      return x.isNaN();
+    },
+    bigint: function bigint(x) {
+      return false;
+    },
+    Fraction: function Fraction(x) {
+      return false;
+    },
+    Complex: function Complex(x) {
+      return x.isNaN();
+    },
+    Unit: function Unit(x) {
+      return Number.isNaN(x.value);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNegative.js b/node_modules/mathjs/lib/esm/function/utils/isNegative.js
new file mode 100644
index 0000000..8cbd460
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNegative.js
@@ -0,0 +1,52 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isNegativeNumber } from '../../plain/number/index.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+var name = 'isNegative';
+var dependencies = ['typed', 'config'];
+export var createIsNegative = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config
+  } = _ref;
+  /**
+   * Test whether a value is negative: smaller than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNegative(x)
+   *
+   * Examples:
+   *
+   *    math.isNegative(3)                     // returns false
+   *    math.isNegative(-2)                    // returns true
+   *    math.isNegative(0)                     // returns false
+   *    math.isNegative(-0)                    // returns false
+   *    math.isNegative(math.bignumber(2))     // returns false
+   *    math.isNegative(math.fraction(-2, 5))  // returns true
+   *    math.isNegative('-2')                  // returns true
+   *    math.isNegative([2, 0, -3])            // returns [false, false, true]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isZero, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isNegativeNumber(x),
+    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol) ? false : x.isNeg() && !x.isZero() && !x.isNaN(),
+    bigint: x => x < 0n,
+    Fraction: x => x.s < 0n,
+    // It's enough to decide on the sign
+
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isNumeric.js b/node_modules/mathjs/lib/esm/function/utils/isNumeric.js
new file mode 100644
index 0000000..8e99aff
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isNumeric.js
@@ -0,0 +1,44 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isNumeric';
+var dependencies = ['typed'];
+export var createIsNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is an numeric value.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isNumeric(x)
+   *
+   * Examples:
+   *
+   *    math.isNumeric(2)                     // returns true
+   *    math.isNumeric('2')                   // returns false
+   *    math.hasNumericValue('2')             // returns true
+   *    math.isNumeric(0)                     // returns true
+   *    math.isNumeric(math.bignumber('42'))  // returns true
+   *    math.isNumeric(math.bigint('42'))     // returns true
+   *    math.isNumeric(math.fraction(4))      // returns true
+   *    math.isNumeric(math.complex('2-4i'))  // returns false
+   *    math.isNumeric([2.3, 'foo', false])   // returns [true, false, true]
+   *
+   * See also:
+   *
+   *    isZero, isPositive, isNegative, isInteger, hasNumericValue
+   *
+   * @param {*} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is a `number`, `BigNumber`,
+   *                    `Fraction`, or `boolean`. Returns false for other types.
+   *                    Throws an error in case of unknown types.
+   */
+  return typed(name, {
+    'number | BigNumber | bigint | Fraction | boolean': () => true,
+    'Complex | Unit | string | null | undefined | Node': () => false,
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isPositive.js b/node_modules/mathjs/lib/esm/function/utils/isPositive.js
new file mode 100644
index 0000000..8b4ba3b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isPositive.js
@@ -0,0 +1,52 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+import { isPositiveNumber } from '../../plain/number/index.js';
+import { nearlyEqual as bigNearlyEqual } from '../../utils/bignumber/nearlyEqual.js';
+import { nearlyEqual } from '../../utils/number.js';
+var name = 'isPositive';
+var dependencies = ['typed', 'config'];
+export var createIsPositive = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    config
+  } = _ref;
+  /**
+   * Test whether a value is positive: larger than zero.
+   * The function supports types `number`, `BigNumber`, `Fraction`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPositive(x)
+   *
+   * Examples:
+   *
+   *    math.isPositive(3)                     // returns true
+   *    math.isPositive(-2)                    // returns false
+   *    math.isPositive(0)                     // returns false
+   *    math.isPositive(-0)                    // returns false
+   *    math.isPositive(0.5)                   // returns true
+   *    math.isPositive(math.bignumber(2))     // returns true
+   *    math.isPositive(math.fraction(-2, 5))  // returns false
+   *    math.isPositive(math.fraction(1, 3))   // returns true
+   *    math.isPositive('2')                   // returns true
+   *    math.isPositive([2, 0, -3])            // returns [true, false, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Fraction | Unit | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: x => nearlyEqual(x, 0, config.relTol, config.absTol) ? false : isPositiveNumber(x),
+    BigNumber: x => bigNearlyEqual(x, new x.constructor(0), config.relTol, config.absTol) ? false : !x.isNeg() && !x.isZero() && !x.isNaN(),
+    bigint: x => x > 0n,
+    Fraction: x => x.s > 0n && x.n > 0n,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isPrime.js b/node_modules/mathjs/lib/esm/function/utils/isPrime.js
new file mode 100644
index 0000000..04b92f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isPrime.js
@@ -0,0 +1,130 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isPrime';
+var dependencies = ['typed'];
+export var createIsPrime = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Test whether a value is prime: has no divisors other than itself and one.
+   * The function supports type `number`, `bignumber`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isPrime(x)
+   *
+   * Examples:
+   *
+   *    math.isPrime(3)                     // returns true
+   *    math.isPrime(-2)                    // returns false
+   *    math.isPrime(0)                     // returns false
+   *    math.isPrime(-0)                    // returns false
+   *    math.isPrime(0.5)                   // returns false
+   *    math.isPrime('2')                   // returns true
+   *    math.isPrime([2, 17, 100])           // returns [true, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isZero, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Array | Matrix} x  Value to be tested
+   * @return {boolean}  Returns true when `x` is larger than zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    number: function number(x) {
+      if (x <= 3) {
+        return x > 1;
+      }
+      if (x % 2 === 0 || x % 3 === 0) {
+        return false;
+      }
+      for (var i = 5; i * i <= x; i += 6) {
+        if (x % i === 0 || x % (i + 2) === 0) {
+          return false;
+        }
+      }
+      return true;
+    },
+    bigint: function bigint(x) {
+      if (x <= 3n) {
+        return x > 1n;
+      }
+      if (x % 2n === 0n || x % 3n === 0n) {
+        return false;
+      }
+      for (var i = 5n; i * i <= x; i += 6n) {
+        if (x % i === 0n || x % (i + 2n) === 0n) {
+          return false;
+        }
+      }
+      return true;
+    },
+    BigNumber: function BigNumber(n) {
+      if (n.lte(3)) return n.gt(1);
+      if (n.mod(2).eq(0) || n.mod(3).eq(0)) return false;
+      if (n.lt(Math.pow(2, 32))) {
+        var x = n.toNumber();
+        for (var i = 5; i * i <= x; i += 6) {
+          if (x % i === 0 || x % (i + 2) === 0) {
+            return false;
+          }
+        }
+        return true;
+      }
+      function modPow(base, exponent, modulus) {
+        // exponent can be huge, use non-recursive variant
+        var accumulator = 1;
+        while (!exponent.eq(0)) {
+          if (exponent.mod(2).eq(0)) {
+            exponent = exponent.div(2);
+            base = base.mul(base).mod(modulus);
+          } else {
+            exponent = exponent.sub(1);
+            accumulator = base.mul(accumulator).mod(modulus);
+          }
+        }
+        return accumulator;
+      }
+
+      // https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Deterministic_variants
+      var Decimal = n.constructor.clone({
+        precision: n.toFixed(0).length * 2
+      });
+      n = new Decimal(n);
+      var r = 0;
+      var d = n.sub(1);
+      while (d.mod(2).eq(0)) {
+        d = d.div(2);
+        r += 1;
+      }
+      var bases = null;
+      // https://en.wikipedia.org/wiki/Miller–Rabin_primality_test#Testing_against_small_sets_of_bases
+      if (n.lt('3317044064679887385961981')) {
+        bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41].filter(x => x < n);
+      } else {
+        var max = Math.min(n.toNumber() - 2, Math.floor(2 * Math.pow(n.toFixed(0).length * Math.log(10), 2)));
+        bases = [];
+        for (var _i = 2; _i <= max; _i += 1) {
+          bases.push(max);
+        }
+      }
+      for (var _i2 = 0; _i2 < bases.length; _i2 += 1) {
+        var a = bases[_i2];
+        var adn = modPow(n.sub(n).add(a), d, n);
+        if (!adn.eq(1)) {
+          for (var _i3 = 0, _x = adn; !_x.eq(n.sub(1)); _i3 += 1, _x = _x.mul(_x).mod(n)) {
+            if (_i3 === r - 1) {
+              return false;
+            }
+          }
+        }
+      }
+      return true;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/isZero.js b/node_modules/mathjs/lib/esm/function/utils/isZero.js
new file mode 100644
index 0000000..726ea7c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/isZero.js
@@ -0,0 +1,49 @@
+import { deepMap } from '../../utils/collection.js';
+import { factory } from '../../utils/factory.js';
+var name = 'isZero';
+var dependencies = ['typed', 'equalScalar'];
+export var createIsZero = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Test whether a value is zero.
+   * The function can check for zero for types `number`, `BigNumber`, `Fraction`,
+   * `Complex`, and `Unit`.
+   *
+   * The function is evaluated element-wise in case of Array or Matrix input.
+   *
+   * Syntax:
+   *
+   *     math.isZero(x)
+   *
+   * Examples:
+   *
+   *    math.isZero(0)                      // returns true
+   *    math.isZero(2)                      // returns false
+   *    math.isZero(0.5)                    // returns false
+   *    math.isZero(math.bignumber(0))      // returns true
+   *    math.isZero(math.fraction(0))       // returns true
+   *    math.isZero(math.fraction(1,3))     // returns false
+   *    math.isZero(math.complex('2 - 4i')) // returns false
+   *    math.isZero(math.complex('0i'))     // returns true
+   *    math.isZero('0')                    // returns true
+   *    math.isZero('2')                    // returns false
+   *    math.isZero([2, 0, -3])             // returns [false, true, false]
+   *
+   * See also:
+   *
+   *    isNumeric, isPositive, isNegative, isInteger
+   *
+   * @param {number | BigNumber | bigint | Complex | Fraction | Unit | Array | Matrix} x       Value to be tested
+   * @return {boolean}  Returns true when `x` is zero.
+   *                    Throws an error in case of an unknown data type.
+   */
+  return typed(name, {
+    'number | BigNumber | Complex | Fraction': x => equalScalar(x, 0),
+    bigint: x => x === 0n,
+    Unit: typed.referToSelf(self => x => typed.find(self, x.valueType())(x.value)),
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/numeric.js b/node_modules/mathjs/lib/esm/function/utils/numeric.js
new file mode 100644
index 0000000..54db3ce
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/numeric.js
@@ -0,0 +1,76 @@
+import { typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { noBignumber, noFraction } from '../../utils/noop.js';
+var name = 'numeric';
+var dependencies = ['number', '?bignumber', '?fraction'];
+export var createNumeric = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    number: _number,
+    bignumber,
+    fraction
+  } = _ref;
+  var validInputTypes = {
+    string: true,
+    number: true,
+    BigNumber: true,
+    Fraction: true
+  };
+
+  // Load the conversion functions for each output type
+  var validOutputTypes = {
+    number: x => _number(x),
+    BigNumber: bignumber ? x => bignumber(x) : noBignumber,
+    bigint: x => BigInt(x),
+    Fraction: fraction ? x => fraction(x) : noFraction
+  };
+
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.
+   *
+   * Syntax:
+   *
+   *    math.numeric(x)
+   *    math.numeric(value, outputType)
+   *
+   * Examples:
+   *
+   *    math.numeric('4')                           // returns 4
+   *    math.numeric('4', 'number')                 // returns 4
+   *    math.numeric('4', 'bigint')                 // returns 4n
+   *    math.numeric('4', 'BigNumber')              // returns BigNumber 4
+   *    math.numeric('4', 'Fraction')               // returns Fraction 4
+   *    math.numeric(4, 'Fraction')                 // returns Fraction 4
+   *    math.numeric(math.fraction(2, 5), 'number') // returns 0.4
+   *
+   * See also:
+   *
+   *    number, fraction, bignumber, bigint, string, format
+   *
+   * @param {string | number | BigNumber | bigint | Fraction } value
+   *              A numeric value or a string containing a numeric value
+   * @param {string} outputType
+   *              Desired numeric output type.
+   *              Available values: 'number', 'BigNumber', or 'Fraction'
+   * @return {number | BigNumber | bigint | Fraction}
+   *              Returns an instance of the numeric in the requested type
+   */
+  return function numeric(value) {
+    var outputType = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'number';
+    var check = arguments.length > 2 ? arguments[2] : undefined;
+    if (check !== undefined) {
+      throw new SyntaxError('numeric() takes one or two arguments');
+    }
+    var inputType = typeOf(value);
+    if (!(inputType in validInputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' of type "' + inputType + '"; valid input types are ' + Object.keys(validInputTypes).join(', '));
+    }
+    if (!(outputType in validOutputTypes)) {
+      throw new TypeError('Cannot convert ' + value + ' to type "' + outputType + '"; valid output types are ' + Object.keys(validOutputTypes).join(', '));
+    }
+    if (outputType === inputType) {
+      return value;
+    } else {
+      return validOutputTypes[outputType](value);
+    }
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/function/utils/typeOf.js b/node_modules/mathjs/lib/esm/function/utils/typeOf.js
new file mode 100644
index 0000000..c20d278
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/function/utils/typeOf.js
@@ -0,0 +1,65 @@
+import { factory } from '../../utils/factory.js';
+import { typeOf as _typeOf } from '../../utils/is.js';
+var name = 'typeOf';
+var dependencies = ['typed'];
+export var createTypeOf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Determine the type of an entity.
+   *
+   * Syntax:
+   *
+   *    math.typeOf(x)
+   *
+   * Examples:
+   *
+   *    // This list is intended to include all relevant types, for testing
+   *    // purposes:
+   *    math.typeOf(3.5)                      // returns 'number'
+   *    math.typeOf(42n)                      // returns 'bigint'
+   *    math.typeOf(math.complex('2-4i'))     // returns 'Complex'
+   *    math.typeOf(math.unit('45 deg'))      // returns 'Unit'
+   *    math.typeOf('hello world')            // returns 'string'
+   *    math.typeOf(null)                     // returns 'null'
+   *    math.typeOf(true)                     // returns 'boolean'
+   *    math.typeOf([1, 2, 3])                // returns 'Array'
+   *    math.typeOf(new Date())               // returns 'Date'
+   *    math.typeOf(function () {})           // returns 'function'
+   *    math.typeOf({a: 2, b: 3})             // returns 'Object'
+   *    math.typeOf(/a regexp/)               // returns 'RegExp'
+   *    math.typeOf(undefined)                // returns 'undefined'
+   *    math.typeOf(math.bignumber('23e99'))  // returns 'BigNumber'
+   *    math.typeOf(math.chain(2))            // returns 'Chain'
+   *    math.typeOf(math.fraction(1, 3))      // returns 'Fraction'
+   *    math.typeOf(math.help('sqrt'))        // returns 'Help'
+   *    math.typeOf(math.index(1, 3))         // returns 'Index'
+   *    math.typeOf(math.matrix([[1],[3]]))   // returns 'DenseMatrix'
+   *    math.typeOf(math.matrix([],'sparse')) // returns 'SparseMatrix'
+   *    math.typeOf(new math.Range(0, 10))    // returns 'Range'
+   *    math.typeOf(math.evaluate('a=2\na'))  // returns 'ResultSet'
+   *    math.typeOf(math.parse('A[2]'))       // returns 'AccessorNode'
+   *    math.typeOf(math.parse('[1,2,3]'))    // returns 'ArrayNode'
+   *    math.typeOf(math.parse('x=2'))        // returns 'AssignmentNode'
+   *    math.typeOf(math.parse('a=2; b=3'))   // returns 'BlockNode'
+   *    math.typeOf(math.parse('x<0?-1:1'))   // returns 'ConditionalNode'
+   *    math.typeOf(math.parse('2.3'))        // returns 'ConstantNode'
+   *    math.typeOf(math.parse('f(x)=x^2'))   // returns 'FunctionAssignmentNode'
+   *    math.typeOf(math.parse('sqrt(4)'))    // returns 'FunctionNode'
+   *    math.typeOf(math.parse('A[2]').index) // returns 'IndexNode'
+   *    math.typeOf(math.parse('{a:2}'))      // returns 'ObjectNode'
+   *    math.typeOf(math.parse('(2+3)'))      // returns 'ParenthesisNode'
+   *    math.typeOf(math.parse('1:10'))       // returns 'RangeNode'
+   *    math.typeOf(math.parse('a<b<c'))      // returns 'RelationalNode'
+   *    math.typeOf(math.parse('x'))          // returns 'SymbolNode'
+   *
+   * @param {*} x     The variable for which to test the type.
+   * @return {string} Returns the name of the type. Primitive types are lower case,
+   *                  non-primitive types are upper-camel-case.
+   *                  For example 'number', 'string', 'Array', 'Date'.
+   */
+  return typed(name, {
+    any: _typeOf
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/header.js b/node_modules/mathjs/lib/esm/header.js
new file mode 100644
index 0000000..1483046
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/header.js
@@ -0,0 +1,26 @@
+/**
+ * math.js
+ * https://github.com/josdejong/mathjs
+ *
+ * Math.js is an extensive math library for JavaScript and Node.js,
+ * It features real and complex numbers, units, matrices, a large set of
+ * mathematical functions, and a flexible expression parser.
+ *
+ * @version @@version
+ * @date    @@date
+ *
+ * @license
+ * Copyright (C) 2013-2025 Jos de Jong <wjosdejong@gmail.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
+ *
+ * https://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.
+ */
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/index.js b/node_modules/mathjs/lib/esm/index.js
new file mode 100644
index 0000000..7e74c6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/index.js
@@ -0,0 +1 @@
+export * from './entry/mainAny.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/json/replacer.js b/node_modules/mathjs/lib/esm/json/replacer.js
new file mode 100644
index 0000000..2bed9f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/json/replacer.js
@@ -0,0 +1,33 @@
+import { factory } from '../utils/factory.js';
+var name = 'replacer';
+var dependencies = [];
+export var createReplacer = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Stringify data types into their JSON representation.
+   * Most data types can be serialized using their `.toJSON` method,
+   * but not all, for example the number `Infinity`. For these cases you have
+   * to use the replacer. Example usage:
+   *
+   *     JSON.stringify([2, Infinity], math.replacer)
+   *
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the replaced object
+   */
+  return function replacer(key, value) {
+    // the numeric values Infinitiy, -Infinity, and NaN cannot be serialized to JSON
+    if (typeof value === 'number' && (!isFinite(value) || isNaN(value))) {
+      return {
+        mathjs: 'number',
+        value: String(value)
+      };
+    }
+    if (typeof value === 'bigint') {
+      return {
+        mathjs: 'bigint',
+        value: String(value)
+      };
+    }
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/json/reviver.js b/node_modules/mathjs/lib/esm/json/reviver.js
new file mode 100644
index 0000000..982218a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/json/reviver.js
@@ -0,0 +1,21 @@
+import { factory } from '../utils/factory.js';
+var name = 'reviver';
+var dependencies = ['classes'];
+export var createReviver = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    classes
+  } = _ref;
+  /**
+   * Instantiate mathjs data types from their JSON representation
+   * @param {string} key
+   * @param {*} value
+   * @returns {*} Returns the revived object
+   */
+  return function reviver(key, value) {
+    var constructor = classes[value && value.mathjs];
+    if (constructor && typeof constructor.fromJSON === 'function') {
+      return constructor.fromJSON(value);
+    }
+    return value;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/number.js b/node_modules/mathjs/lib/esm/number.js
new file mode 100644
index 0000000..5181f6c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/number.js
@@ -0,0 +1 @@
+export * from './entry/mainNumber.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js b/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js
new file mode 100644
index 0000000..2cf9080
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/bignumber/arithmetic.js
@@ -0,0 +1,22 @@
+var signature1 = 'BigNumber';
+var signature2 = 'BigNumber, BigNumber';
+export function absBigNumber(a) {
+  return a.abs();
+}
+absBigNumber.signature = signature1;
+export function addBigNumber(a, b) {
+  return a.add(b);
+}
+addBigNumber.signature = signature2;
+export function subtractBigNumber(a, b) {
+  return a.sub(b);
+}
+subtractBigNumber.signature = signature2;
+export function multiplyBigNumber(a, b) {
+  return a.mul(b);
+}
+multiplyBigNumber.signature = signature2;
+export function divideBigNumber(a, b) {
+  return a.div(b);
+}
+divideBigNumber.signature = signature2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/bignumber/index.js b/node_modules/mathjs/lib/esm/plain/bignumber/index.js
new file mode 100644
index 0000000..a60ccf4
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/bignumber/index.js
@@ -0,0 +1,9 @@
+import Decimal from 'decimal.js';
+export * from './arithmetic.js';
+
+// TODO: this is ugly. Instead, be able to pass your own isBigNumber function to typed?
+var BigNumber = Decimal.clone();
+BigNumber.prototype.isBigNumber = true;
+export function bignumber(x) {
+  return new BigNumber(x);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/arithmetic.js b/node_modules/mathjs/lib/esm/plain/number/arithmetic.js
new file mode 100644
index 0000000..d47fd95
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/arithmetic.js
@@ -0,0 +1,303 @@
+import { cbrt, expm1, isInteger, log10, log1p, log2, sign, toFixed } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function absNumber(a) {
+  return Math.abs(a);
+}
+absNumber.signature = n1;
+export function addNumber(a, b) {
+  return a + b;
+}
+addNumber.signature = n2;
+export function subtractNumber(a, b) {
+  return a - b;
+}
+subtractNumber.signature = n2;
+export function multiplyNumber(a, b) {
+  return a * b;
+}
+multiplyNumber.signature = n2;
+export function divideNumber(a, b) {
+  return a / b;
+}
+divideNumber.signature = n2;
+export function unaryMinusNumber(x) {
+  return -x;
+}
+unaryMinusNumber.signature = n1;
+export function unaryPlusNumber(x) {
+  return x;
+}
+unaryPlusNumber.signature = n1;
+export function cbrtNumber(x) {
+  return cbrt(x);
+}
+cbrtNumber.signature = n1;
+export function cubeNumber(x) {
+  return x * x * x;
+}
+cubeNumber.signature = n1;
+export function expNumber(x) {
+  return Math.exp(x);
+}
+expNumber.signature = n1;
+export function expm1Number(x) {
+  return expm1(x);
+}
+expm1Number.signature = n1;
+
+/**
+ * Calculate gcd for numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the greatest common denominator of a and b
+ */
+export function gcdNumber(a, b) {
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function gcd must be integer numbers');
+  }
+
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  var r;
+  while (b !== 0) {
+    r = a % b;
+    a = b;
+    b = r;
+  }
+  return a < 0 ? -a : a;
+}
+gcdNumber.signature = n2;
+
+/**
+ * Calculate lcm for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @returns {number} Returns the least common multiple of a and b
+ */
+export function lcmNumber(a, b) {
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function lcm must be integer numbers');
+  }
+  if (a === 0 || b === 0) {
+    return 0;
+  }
+
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  // evaluate lcm here inline to reduce overhead
+  var t;
+  var prod = a * b;
+  while (b !== 0) {
+    t = b;
+    b = a % t;
+    a = t;
+  }
+  return Math.abs(prod / a);
+}
+lcmNumber.signature = n2;
+
+/**
+ * Calculate the logarithm of a value, optionally to a given base.
+ * @param {number} x
+ * @param {number | null | undefined} base
+ * @return {number}
+ */
+export function logNumber(x, y) {
+  if (y) {
+    return Math.log(x) / Math.log(y);
+  }
+  return Math.log(x);
+}
+
+/**
+ * Calculate the 10-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+export function log10Number(x) {
+  return log10(x);
+}
+log10Number.signature = n1;
+
+/**
+ * Calculate the 2-base logarithm of a number
+ * @param {number} x
+ * @return {number}
+ */
+export function log2Number(x) {
+  return log2(x);
+}
+log2Number.signature = n1;
+
+/**
+ * Calculate the natural logarithm of a `number+1`
+ * @param {number} x
+ * @returns {number}
+ */
+export function log1pNumber(x) {
+  return log1p(x);
+}
+log1pNumber.signature = n1;
+
+/**
+ * Calculate the modulus of two numbers
+ * @param {number} x
+ * @param {number} y
+ * @returns {number} res
+ * @private
+ */
+export function modNumber(x, y) {
+  // We don't use JavaScript's % operator here as this doesn't work
+  // correctly for x < 0 and x === 0
+  // see https://en.wikipedia.org/wiki/Modulo_operation
+  return y === 0 ? x : x - y * Math.floor(x / y);
+}
+modNumber.signature = n2;
+
+/**
+ * Calculate the nth root of a, solve x^root == a
+ * http://rosettacode.org/wiki/Nth_root#JavaScript
+ * @param {number} a
+ * @param {number} [2] root
+ * @private
+ */
+export function nthRootNumber(a) {
+  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
+  var inv = root < 0;
+  if (inv) {
+    root = -root;
+  }
+  if (root === 0) {
+    throw new Error('Root must be non-zero');
+  }
+  if (a < 0 && Math.abs(root) % 2 !== 1) {
+    throw new Error('Root must be odd when a is negative.');
+  }
+
+  // edge cases zero and infinity
+  if (a === 0) {
+    return inv ? Infinity : 0;
+  }
+  if (!isFinite(a)) {
+    return inv ? 0 : a;
+  }
+  var x = Math.pow(Math.abs(a), 1 / root);
+  // If a < 0, we require that root is an odd integer,
+  // so (-1) ^ (1/root) = -1
+  x = a < 0 ? -x : x;
+  return inv ? 1 / x : x;
+
+  // Very nice algorithm, but fails with nthRoot(-2, 3).
+  // Newton's method has some well-known problems at times:
+  // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
+  /*
+  let x = 1 // Initial guess
+  let xPrev = 1
+  let i = 0
+  const iMax = 10000
+  do {
+    const delta = (a / Math.pow(x, root - 1) - x) / root
+    xPrev = x
+    x = x + delta
+    i++
+  }
+  while (xPrev !== x && i < iMax)
+   if (xPrev !== x) {
+    throw new Error('Function nthRoot failed to converge')
+  }
+   return inv ? 1 / x : x
+  */
+}
+export function signNumber(x) {
+  return sign(x);
+}
+signNumber.signature = n1;
+export function sqrtNumber(x) {
+  return Math.sqrt(x);
+}
+sqrtNumber.signature = n1;
+export function squareNumber(x) {
+  return x * x;
+}
+squareNumber.signature = n1;
+
+/**
+ * Calculate xgcd for two numbers
+ * @param {number} a
+ * @param {number} b
+ * @return {number} result
+ * @private
+ */
+export function xgcdNumber(a, b) {
+  // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
+  var t; // used to swap two variables
+  var q; // quotient
+  var r; // remainder
+  var x = 0;
+  var lastx = 1;
+  var y = 1;
+  var lasty = 0;
+  if (!isInteger(a) || !isInteger(b)) {
+    throw new Error('Parameters in function xgcd must be integer numbers');
+  }
+  while (b) {
+    q = Math.floor(a / b);
+    r = a - q * b;
+    t = x;
+    x = lastx - q * x;
+    lastx = t;
+    t = y;
+    y = lasty - q * y;
+    lasty = t;
+    a = b;
+    b = r;
+  }
+  var res;
+  if (a < 0) {
+    res = [-a, -lastx, -lasty];
+  } else {
+    res = [a, a ? lastx : 0, lasty];
+  }
+  return res;
+}
+xgcdNumber.signature = n2;
+
+/**
+ * Calculates the power of x to y, x^y, for two numbers.
+ * @param {number} x
+ * @param {number} y
+ * @return {number} res
+ */
+export function powNumber(x, y) {
+  // x^Infinity === 0 if -1 < x < 1
+  // A real number 0 is returned instead of complex(0)
+  if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
+    return 0;
+  }
+  return Math.pow(x, y);
+}
+powNumber.signature = n2;
+
+/**
+ * round a number to the given number of decimals, or to zero if decimals is
+ * not provided
+ * @param {number} value
+ * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)
+ * @return {number} roundedValue
+ */
+export function roundNumber(value) {
+  var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  if (!isInteger(decimals) || decimals < 0 || decimals > 15) {
+    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');
+  }
+  return parseFloat(toFixed(value, decimals));
+}
+
+/**
+ * Calculate the norm of a number, the absolute value.
+ * @param {number} x
+ * @return {number}
+ */
+export function normNumber(x) {
+  return Math.abs(x);
+}
+normNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/bitwise.js b/node_modules/mathjs/lib/esm/plain/number/bitwise.js
new file mode 100644
index 0000000..0d21693
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/bitwise.js
@@ -0,0 +1,52 @@
+import { isInteger } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function bitAndNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+  return x & y;
+}
+bitAndNumber.signature = n2;
+export function bitNotNumber(x) {
+  if (!isInteger(x)) {
+    throw new Error('Integer expected in function bitNot');
+  }
+  return ~x;
+}
+bitNotNumber.signature = n1;
+export function bitOrNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitOr');
+  }
+  return x | y;
+}
+bitOrNumber.signature = n2;
+export function bitXorNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function bitXor');
+  }
+  return x ^ y;
+}
+bitXorNumber.signature = n2;
+export function leftShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function leftShift');
+  }
+  return x << y;
+}
+leftShiftNumber.signature = n2;
+export function rightArithShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+  return x >> y;
+}
+rightArithShiftNumber.signature = n2;
+export function rightLogShiftNumber(x, y) {
+  if (!isInteger(x) || !isInteger(y)) {
+    throw new Error('Integers expected in function rightLogShift');
+  }
+  return x >>> y;
+}
+rightLogShiftNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/combinations.js b/node_modules/mathjs/lib/esm/plain/number/combinations.js
new file mode 100644
index 0000000..a102eed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/combinations.js
@@ -0,0 +1,33 @@
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+export function combinationsNumber(n, k) {
+  if (!isInteger(n) || n < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+  if (!isInteger(k) || k < 0) {
+    throw new TypeError('Positive integer value expected in function combinations');
+  }
+  if (k > n) {
+    throw new TypeError('k must be less than or equal to n');
+  }
+  var nMinusk = n - k;
+  var answer = 1;
+  var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;
+  var nextdivisor = 2;
+  var lastdivisor = k < nMinusk ? k : nMinusk;
+  // balance multiplications and divisions to try to keep intermediate values
+  // in exact-integer range as long as possible
+  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
+  }
+  // for big n, k, floating point may have caused weirdness in remainder
+  if (nextdivisor <= lastdivisor) {
+    answer /= product(nextdivisor, lastdivisor);
+  }
+  return answer;
+}
+combinationsNumber.signature = 'number, number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/constants.js b/node_modules/mathjs/lib/esm/plain/number/constants.js
new file mode 100644
index 0000000..a544965
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/constants.js
@@ -0,0 +1,4 @@
+export var pi = Math.PI;
+export var tau = 2 * Math.PI;
+export var e = Math.E;
+export var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/index.js b/node_modules/mathjs/lib/esm/plain/number/index.js
new file mode 100644
index 0000000..769d9fc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/index.js
@@ -0,0 +1,9 @@
+export * from './arithmetic.js';
+export * from './bitwise.js';
+export * from './combinations.js';
+export * from './constants.js';
+export * from './logical.js';
+export * from './relational.js';
+export * from './probability.js';
+export * from './trigonometry.js';
+export * from './utils.js';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/logical.js b/node_modules/mathjs/lib/esm/plain/number/logical.js
new file mode 100644
index 0000000..61f2d60
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/logical.js
@@ -0,0 +1,18 @@
+var n1 = 'number';
+var n2 = 'number, number';
+export function notNumber(x) {
+  return !x;
+}
+notNumber.signature = n1;
+export function orNumber(x, y) {
+  return !!(x || y);
+}
+orNumber.signature = n2;
+export function xorNumber(x, y) {
+  return !!x !== !!y;
+}
+xorNumber.signature = n2;
+export function andNumber(x, y) {
+  return !!(x && y);
+}
+andNumber.signature = n2;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/probability.js b/node_modules/mathjs/lib/esm/plain/number/probability.js
new file mode 100644
index 0000000..16a8be0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/probability.js
@@ -0,0 +1,75 @@
+/* eslint-disable no-loss-of-precision */
+
+import { isInteger } from '../../utils/number.js';
+import { product } from '../../utils/product.js';
+export function gammaNumber(n) {
+  var x;
+  if (isInteger(n)) {
+    if (n <= 0) {
+      return isFinite(n) ? Infinity : NaN;
+    }
+    if (n > 171) {
+      return Infinity; // Will overflow
+    }
+    return product(1, n - 1);
+  }
+  if (n < 0.5) {
+    return Math.PI / (Math.sin(Math.PI * n) * gammaNumber(1 - n));
+  }
+  if (n >= 171.35) {
+    return Infinity; // will overflow
+  }
+  if (n > 85.0) {
+    // Extended Stirling Approx
+    var twoN = n * n;
+    var threeN = twoN * n;
+    var fourN = threeN * n;
+    var fiveN = fourN * n;
+    return Math.sqrt(2 * Math.PI / n) * Math.pow(n / Math.E, n) * (1 + 1 / (12 * n) + 1 / (288 * twoN) - 139 / (51840 * threeN) - 571 / (2488320 * fourN) + 163879 / (209018880 * fiveN) + 5246819 / (75246796800 * fiveN * n));
+  }
+  --n;
+  x = gammaP[0];
+  for (var i = 1; i < gammaP.length; ++i) {
+    x += gammaP[i] / (n + i);
+  }
+  var t = n + gammaG + 0.5;
+  return Math.sqrt(2 * Math.PI) * Math.pow(t, n + 0.5) * Math.exp(-t) * x;
+}
+gammaNumber.signature = 'number';
+
+// TODO: comment on the variables g and p
+
+export var gammaG = 4.7421875;
+export var gammaP = [0.99999999999999709182, 57.156235665862923517, -59.597960355475491248, 14.136097974741747174, -0.49191381609762019978, 0.33994649984811888699e-4, 0.46523628927048575665e-4, -0.98374475304879564677e-4, 0.15808870322491248884e-3, -0.21026444172410488319e-3, 0.21743961811521264320e-3, -0.16431810653676389022e-3, 0.84418223983852743293e-4, -0.26190838401581408670e-4, 0.36899182659531622704e-5];
+
+// lgamma implementation ref: https://mrob.com/pub/ries/lanczos-gamma.html#code
+
+// log(2 * pi) / 2
+export var lnSqrt2PI = 0.91893853320467274178;
+export var lgammaG = 5; // Lanczos parameter "g"
+export var lgammaN = 7; // Range of coefficients "n"
+
+export var lgammaSeries = [1.000000000190015, 76.18009172947146, -86.50532032941677, 24.01409824083091, -1.231739572450155, 0.1208650973866179e-2, -0.5395239384953e-5];
+export function lgammaNumber(n) {
+  if (n < 0) return NaN;
+  if (n === 0) return Infinity;
+  if (!isFinite(n)) return n;
+  if (n < 0.5) {
+    // Use Euler's reflection formula:
+    // gamma(z) = PI / (sin(PI * z) * gamma(1 - z))
+    return Math.log(Math.PI / Math.sin(Math.PI * n)) - lgammaNumber(1 - n);
+  }
+
+  // Compute the logarithm of the Gamma function using the Lanczos method
+
+  n = n - 1;
+  var base = n + lgammaG + 0.5; // Base of the Lanczos exponential
+  var sum = lgammaSeries[0];
+
+  // We start with the terms that have the smallest coefficients and largest denominator
+  for (var i = lgammaN - 1; i >= 1; i--) {
+    sum += lgammaSeries[i] / (n + i);
+  }
+  return lnSqrt2PI + (n + 0.5) * Math.log(base) - base + Math.log(sum);
+}
+lgammaNumber.signature = 'number';
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/relational.js b/node_modules/mathjs/lib/esm/plain/number/relational.js
new file mode 100644
index 0000000..e69de29
diff --git a/node_modules/mathjs/lib/esm/plain/number/trigonometry.js b/node_modules/mathjs/lib/esm/plain/number/trigonometry.js
new file mode 100644
index 0000000..6a49a62
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/trigonometry.js
@@ -0,0 +1,112 @@
+import { acosh, asinh, atanh, cosh, sign, sinh, tanh } from '../../utils/number.js';
+var n1 = 'number';
+var n2 = 'number, number';
+export function acosNumber(x) {
+  return Math.acos(x);
+}
+acosNumber.signature = n1;
+export function acoshNumber(x) {
+  return acosh(x);
+}
+acoshNumber.signature = n1;
+export function acotNumber(x) {
+  return Math.atan(1 / x);
+}
+acotNumber.signature = n1;
+export function acothNumber(x) {
+  return isFinite(x) ? (Math.log((x + 1) / x) + Math.log(x / (x - 1))) / 2 : 0;
+}
+acothNumber.signature = n1;
+export function acscNumber(x) {
+  return Math.asin(1 / x);
+}
+acscNumber.signature = n1;
+export function acschNumber(x) {
+  var xInv = 1 / x;
+  return Math.log(xInv + Math.sqrt(xInv * xInv + 1));
+}
+acschNumber.signature = n1;
+export function asecNumber(x) {
+  return Math.acos(1 / x);
+}
+asecNumber.signature = n1;
+export function asechNumber(x) {
+  var xInv = 1 / x;
+  var ret = Math.sqrt(xInv * xInv - 1);
+  return Math.log(ret + xInv);
+}
+asechNumber.signature = n1;
+export function asinNumber(x) {
+  return Math.asin(x);
+}
+asinNumber.signature = n1;
+export function asinhNumber(x) {
+  return asinh(x);
+}
+asinhNumber.signature = n1;
+export function atanNumber(x) {
+  return Math.atan(x);
+}
+atanNumber.signature = n1;
+export function atan2Number(y, x) {
+  return Math.atan2(y, x);
+}
+atan2Number.signature = n2;
+export function atanhNumber(x) {
+  return atanh(x);
+}
+atanhNumber.signature = n1;
+export function cosNumber(x) {
+  return Math.cos(x);
+}
+cosNumber.signature = n1;
+export function coshNumber(x) {
+  return cosh(x);
+}
+coshNumber.signature = n1;
+export function cotNumber(x) {
+  return 1 / Math.tan(x);
+}
+cotNumber.signature = n1;
+export function cothNumber(x) {
+  var e = Math.exp(2 * x);
+  return (e + 1) / (e - 1);
+}
+cothNumber.signature = n1;
+export function cscNumber(x) {
+  return 1 / Math.sin(x);
+}
+cscNumber.signature = n1;
+export function cschNumber(x) {
+  // consider values close to zero (+/-)
+  if (x === 0) {
+    return Number.POSITIVE_INFINITY;
+  } else {
+    return Math.abs(2 / (Math.exp(x) - Math.exp(-x))) * sign(x);
+  }
+}
+cschNumber.signature = n1;
+export function secNumber(x) {
+  return 1 / Math.cos(x);
+}
+secNumber.signature = n1;
+export function sechNumber(x) {
+  return 2 / (Math.exp(x) + Math.exp(-x));
+}
+sechNumber.signature = n1;
+export function sinNumber(x) {
+  return Math.sin(x);
+}
+sinNumber.signature = n1;
+export function sinhNumber(x) {
+  return sinh(x);
+}
+sinhNumber.signature = n1;
+export function tanNumber(x) {
+  return Math.tan(x);
+}
+tanNumber.signature = n1;
+export function tanhNumber(x) {
+  return tanh(x);
+}
+tanhNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/plain/number/utils.js b/node_modules/mathjs/lib/esm/plain/number/utils.js
new file mode 100644
index 0000000..fec97d5
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/plain/number/utils.js
@@ -0,0 +1,22 @@
+import { isInteger } from '../../utils/number.js';
+var n1 = 'number';
+export function isIntegerNumber(x) {
+  return isInteger(x);
+}
+isIntegerNumber.signature = n1;
+export function isNegativeNumber(x) {
+  return x < 0;
+}
+isNegativeNumber.signature = n1;
+export function isPositiveNumber(x) {
+  return x > 0;
+}
+isPositiveNumber.signature = n1;
+export function isZeroNumber(x) {
+  return x === 0;
+}
+isZeroNumber.signature = n1;
+export function isNaNNumber(x) {
+  return Number.isNaN(x);
+}
+isNaNNumber.signature = n1;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/bigint.js b/node_modules/mathjs/lib/esm/type/bigint.js
new file mode 100644
index 0000000..1432a5a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/bigint.js
@@ -0,0 +1,65 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+var name = 'bigint';
+var dependencies = ['typed'];
+export var createBigint = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Create a bigint or convert a string, boolean, or unit to a bigint.
+   * When value is a matrix, all elements will be converted to bigint.
+   *
+   * Syntax:
+   *
+   *    math.bigint(value)
+   *
+   * Examples:
+   *
+   *    math.bigint(2)                         // returns 2n
+   *    math.bigint('123')                     // returns 123n
+   *    math.bigint(true)                      // returns 1n
+   *    math.bigint([true, false, true, true]) // returns [1n, 0n, 1n, 1n]
+   *
+   * See also:
+   *
+   *    number, bignumber, boolean, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | bigint | Fraction | boolean | Array | Matrix | null} [value]  Value to be converted
+   * @return {bigint | Array | Matrix} The created bigint
+   */
+  var bigint = typed('bigint', {
+    '': function _() {
+      return 0n;
+    },
+    bigint: function bigint(x) {
+      return x;
+    },
+    number: function number(x) {
+      return BigInt(x.toFixed());
+    },
+    BigNumber: function BigNumber(x) {
+      return BigInt(x.round().toString());
+    },
+    Fraction: function Fraction(x) {
+      return BigInt(x.valueOf().toFixed());
+    },
+    'string | boolean': function string__boolean(x) {
+      return BigInt(x);
+    },
+    null: function _null(x) {
+      return 0n;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+
+  // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"bigint","value":"123"}
+  //
+  // into a bigint 123n
+  bigint.fromJSON = function (json) {
+    return BigInt(json.value);
+  };
+  return bigint;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js b/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js
new file mode 100644
index 0000000..4465c8a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js
@@ -0,0 +1,57 @@
+import Decimal from 'decimal.js';
+import { factory } from '../../utils/factory.js';
+var name = 'BigNumber';
+var dependencies = ['?on', 'config'];
+export var createBigNumberClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    config
+  } = _ref;
+  var BigNumber = Decimal.clone({
+    precision: config.precision,
+    modulo: Decimal.EUCLID
+  });
+  BigNumber.prototype = Object.create(BigNumber.prototype);
+
+  /**
+   * Attach type information
+   */
+  BigNumber.prototype.type = 'BigNumber';
+  BigNumber.prototype.isBigNumber = true;
+
+  /**
+   * Get a JSON representation of a BigNumber containing
+   * type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "BigNumber", "value": "0.2"}`
+   */
+  BigNumber.prototype.toJSON = function () {
+    return {
+      mathjs: 'BigNumber',
+      value: this.toString()
+    };
+  };
+
+  /**
+   * Instantiate a BigNumber from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "BigNumber", "value": "0.2"}`
+   * @return {BigNumber}
+   */
+  BigNumber.fromJSON = function (json) {
+    return new BigNumber(json.value);
+  };
+  if (on) {
+    // listen for changed in the configuration, automatically apply changed precision
+    on('config', function (curr, prev) {
+      if (curr.precision !== prev.precision) {
+        BigNumber.config({
+          precision: curr.precision
+        });
+      }
+    });
+  }
+  return BigNumber;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js b/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js
new file mode 100644
index 0000000..d7b4f35
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js
@@ -0,0 +1,82 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'bignumber';
+var dependencies = ['typed', 'BigNumber'];
+export var createBignumber = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    BigNumber
+  } = _ref;
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to BigNumber.
+   *
+   * Syntax:
+   *
+   *    math.bignumber(x)
+   *
+   * Examples:
+   *
+   *    0.1 + 0.2                                  // returns number 0.30000000000000004
+   *    math.bignumber(0.1) + math.bignumber(0.2)  // returns BigNumber 0.3
+   *
+   *
+   *    7.2e500                                    // returns number Infinity
+   *    math.bignumber('7.2e500')                  // returns BigNumber 7.2e500
+   *
+   * See also:
+   *
+   *    number, bigint, boolean, complex, index, matrix, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | bigint | Array | Matrix | boolean | null} [value]  Value for the big number,
+   *                                                    0 by default.
+   * @returns {BigNumber} The created bignumber
+   */
+  return typed('bignumber', {
+    '': function _() {
+      return new BigNumber(0);
+    },
+    number: function number(x) {
+      // convert to string to prevent errors in case of >15 digits
+      return new BigNumber(x + '');
+    },
+    string: function string(x) {
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+      if (wordSizeSuffixMatch) {
+        // x has a word size suffix
+        var size = wordSizeSuffixMatch[2];
+        var n = BigNumber(wordSizeSuffixMatch[1]);
+        var twoPowSize = new BigNumber(2).pow(Number(size));
+        if (n.gt(twoPowSize.sub(1))) {
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        }
+        var twoPowSizeSubOne = new BigNumber(2).pow(Number(size) - 1);
+        if (n.gte(twoPowSizeSubOne)) {
+          return n.sub(twoPowSize);
+        } else {
+          return n;
+        }
+      }
+      return new BigNumber(x);
+    },
+    BigNumber: function BigNumber(x) {
+      // we assume a BigNumber is immutable
+      return x;
+    },
+    bigint: function bigint(x) {
+      return new BigNumber(x.toString());
+    },
+    Unit: typed.referToSelf(self => x => {
+      var clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    Fraction: function Fraction(x) {
+      return new BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));
+    },
+    null: function _null(_x) {
+      return new BigNumber(0);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/boolean.js b/node_modules/mathjs/lib/esm/type/boolean.js
new file mode 100644
index 0000000..7f18b21
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/boolean.js
@@ -0,0 +1,70 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+var name = 'boolean';
+var dependencies = ['typed'];
+export var createBoolean = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Create a boolean or convert a string or number to a boolean.
+   * In case of a number, `true` is returned for non-zero numbers, and `false` in
+   * case of zero.
+   * Strings can be `'true'` or `'false'`, or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   *
+   * Syntax:
+   *
+   *    math.boolean(x)
+   *
+   * Examples:
+   *
+   *    math.boolean(0)     // returns false
+   *    math.boolean(1)     // returns true
+   *    math.boolean(-3)     // returns true
+   *    math.boolean('true')     // returns true
+   *    math.boolean('false')     // returns false
+   *    math.boolean([1, 0, 1, 1])     // returns [true, false, true, true]
+   *
+   * See also:
+   *
+   *    bignumber, complex, index, matrix, string, unit
+   *
+   * @param {string | number | boolean | Array | Matrix | null} value  A value of any type
+   * @return {boolean | Array | Matrix} The boolean value
+   */
+  return typed(name, {
+    '': function _() {
+      return false;
+    },
+    boolean: function boolean(x) {
+      return x;
+    },
+    number: function number(x) {
+      return !!x;
+    },
+    null: function _null(x) {
+      return false;
+    },
+    BigNumber: function BigNumber(x) {
+      return !x.isZero();
+    },
+    string: function string(x) {
+      // try case insensitive
+      var lcase = x.toLowerCase();
+      if (lcase === 'true') {
+        return true;
+      } else if (lcase === 'false') {
+        return false;
+      }
+
+      // test whether value is a valid number
+      var num = Number(x);
+      if (x !== '' && !isNaN(num)) {
+        return !!num;
+      }
+      throw new Error('Cannot convert "' + x + '" to a boolean');
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/chain/Chain.js b/node_modules/mathjs/lib/esm/type/chain/Chain.js
new file mode 100644
index 0000000..1f27638
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/chain/Chain.js
@@ -0,0 +1,213 @@
+import { isChain } from '../../utils/is.js';
+import { format } from '../../utils/string.js';
+import { hasOwnProperty, lazy } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Chain';
+var dependencies = ['?on', 'math', 'typed'];
+export var createChainClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    math,
+    typed
+  } = _ref;
+  /**
+   * @constructor Chain
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing chain.done(), which will return
+   * the final value.
+   *
+   * The Chain has a number of special functions:
+   * - done()             Finalize the chained operation and return the
+   *                      chain's value.
+   * - valueOf()          The same as done()
+   * - toString()         Returns a string representation of the chain's value.
+   *
+   * @param {*} [value]
+   */
+  function Chain(value) {
+    if (!(this instanceof Chain)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (isChain(value)) {
+      this.value = value.value;
+    } else {
+      this.value = value;
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Chain.prototype.type = 'Chain';
+  Chain.prototype.isChain = true;
+
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method valueOf()
+   * @returns {*} value
+   */
+  Chain.prototype.done = function () {
+    return this.value;
+  };
+
+  /**
+   * Close the chain. Returns the final value.
+   * Does the same as method done()
+   * @returns {*} value
+   */
+  Chain.prototype.valueOf = function () {
+    return this.value;
+  };
+
+  /**
+   * Get a string representation of the value in the chain
+   * @returns {string}
+   */
+  Chain.prototype.toString = function () {
+    return format(this.value);
+  };
+
+  /**
+   * Get a JSON representation of the chain
+   * @returns {Object}
+   */
+  Chain.prototype.toJSON = function () {
+    return {
+      mathjs: 'Chain',
+      value: this.value
+    };
+  };
+
+  /**
+   * Instantiate a Chain from its JSON representation
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "Chain", value: ...}`,
+   *                       where mathjs is optional
+   * @returns {Chain}
+   */
+  Chain.fromJSON = function (json) {
+    return new Chain(json.value);
+  };
+
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {Function} fn      The function to be proxied
+   *                           If fn is no function, it is silently ignored.
+   * @private
+   */
+  function createProxy(name, fn) {
+    if (typeof fn === 'function') {
+      Chain.prototype[name] = chainify(fn);
+    }
+  }
+
+  /**
+   * Create a proxy method for the chain
+   * @param {string} name
+   * @param {function} resolver   The function resolving with the
+   *                              function to be proxied
+   * @private
+   */
+  function createLazyProxy(name, resolver) {
+    lazy(Chain.prototype, name, function outerResolver() {
+      var fn = resolver();
+      if (typeof fn === 'function') {
+        return chainify(fn);
+      }
+      return undefined; // if not a function, ignore
+    });
+  }
+
+  /**
+   * Make a function chainable
+   * @param {function} fn
+   * @return {Function} chain function
+   * @private
+   */
+  function chainify(fn) {
+    return function () {
+      // Here, `this` will be the context of a Chain instance
+      if (arguments.length === 0) {
+        return new Chain(fn(this.value));
+      }
+      var args = [this.value];
+      for (var i = 0; i < arguments.length; i++) {
+        args[i + 1] = arguments[i];
+      }
+      if (typed.isTypedFunction(fn)) {
+        var sigObject = typed.resolve(fn, args);
+        // We want to detect if a rest parameter has matched across the
+        // value in the chain and the current arguments of this call.
+        // That is the case if and only if the matching signature has
+        // exactly one parameter (which then must be a rest parameter
+        // as it is matching at least two actual arguments).
+        if (sigObject.params.length === 1) {
+          throw new Error('chain function ' + fn.name + ' cannot match rest parameter between chain value and additional arguments.');
+        }
+        return new Chain(sigObject.implementation.apply(fn, args));
+      }
+      return new Chain(fn.apply(fn, args));
+    };
+  }
+
+  /**
+   * Create a proxy for a single method, or an object with multiple methods.
+   * Example usage:
+   *
+   *   Chain.createProxy('add', function add (x, y) {...})
+   *   Chain.createProxy({
+   *     add:      function add (x, y) {...},
+   *     subtract: function subtract (x, y) {...}
+   *   }
+   *
+   * @param {string | Object} arg0   A name (string), or an object with
+   *                                 functions
+   * @param {*} [arg1]               A function, when arg0 is a name
+   */
+  Chain.createProxy = function (arg0, arg1) {
+    if (typeof arg0 === 'string') {
+      // createProxy(name, value)
+      createProxy(arg0, arg1);
+    } else {
+      var _loop = function _loop(_name) {
+        if (hasOwnProperty(arg0, _name) && excludedNames[_name] === undefined) {
+          createLazyProxy(_name, () => arg0[_name]);
+        }
+      };
+      // createProxy(values)
+      for (var _name in arg0) {
+        _loop(_name);
+      }
+    }
+  };
+  var excludedNames = {
+    expression: true,
+    docs: true,
+    type: true,
+    classes: true,
+    json: true,
+    error: true,
+    isChain: true // conflicts with the property isChain of a Chain instance
+  };
+
+  // create proxy for everything that is in math.js
+  Chain.createProxy(math);
+
+  // register on the import event, automatically add a proxy for every imported function.
+  if (on) {
+    on('import', function (name, resolver, path) {
+      if (!path) {
+        // an imported function (not a data type or something special)
+        createLazyProxy(name, resolver);
+      }
+    });
+  }
+  return Chain;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/chain/function/chain.js b/node_modules/mathjs/lib/esm/type/chain/function/chain.js
new file mode 100644
index 0000000..50e5e2f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/chain/function/chain.js
@@ -0,0 +1,52 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'chain';
+var dependencies = ['typed', 'Chain'];
+export var createChain = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Chain
+  } = _ref;
+  /**
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value.
+   *
+   * All methods available in the math.js library can be called upon the chain,
+   * and then will be evaluated with the value itself as first argument.
+   * The chain can be closed by executing `chain.done()`, which returns
+   * the final value.
+   *
+   * The chain has a number of special functions:
+   *
+   * - `done()`     Finalize the chain and return the chain's value.
+   * - `valueOf()`  The same as `done()`
+   * - `toString()` Executes `math.format()` onto the chain's value, returning
+   *                a string representation of the value.
+   *
+   * Syntax:
+   *
+   *    math.chain(value)
+   *
+   * Examples:
+   *
+   *     math.chain(3)
+   *         .add(4)
+   *         .subtract(2)
+   *         .done()     // 5
+   *
+   *     math.chain( [[1, 2], [3, 4]] )
+   *         .subset(math.index(0, 0), 8)
+   *         .multiply(3)
+   *         .done()     // [[24, 6], [9, 12]]
+   *
+   * @param {*} [value]   A value of any type on which to start a chained operation.
+   * @return {math.Chain} The created chain
+   */
+  return typed(name, {
+    '': function _() {
+      return new Chain();
+    },
+    any: function any(value) {
+      return new Chain(value);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/complex/Complex.js b/node_modules/mathjs/lib/esm/type/complex/Complex.js
new file mode 100644
index 0000000..4346872
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/complex/Complex.js
@@ -0,0 +1,194 @@
+import Complex from 'complex.js';
+import { format } from '../../utils/number.js';
+import { isNumber, isUnit } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Complex';
+var dependencies = [];
+export var createComplexClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(Complex, 'name', {
+    value: 'Complex'
+  });
+  Complex.prototype.constructor = Complex;
+  Complex.prototype.type = 'Complex';
+  Complex.prototype.isComplex = true;
+
+  /**
+   * Get a JSON representation of the complex number
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Complex", "re": 2, "im": 3}`
+   */
+  Complex.prototype.toJSON = function () {
+    return {
+      mathjs: 'Complex',
+      re: this.re,
+      im: this.im
+    };
+  };
+
+  /*
+   * Return the value of the complex number in polar notation
+   * The angle phi will be set in the interval of [-pi, pi].
+   * @return {{r: number, phi: number}} Returns and object with properties r and phi.
+   */
+  Complex.prototype.toPolar = function () {
+    return {
+      r: this.abs(),
+      phi: this.arg()
+    };
+  };
+
+  /**
+   * Get a string representation of the complex number,
+   * with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string} str
+   */
+  Complex.prototype.format = function (options) {
+    var str = '';
+    var im = this.im;
+    var re = this.re;
+    var strRe = format(this.re, options);
+    var strIm = format(this.im, options);
+
+    // round either re or im when smaller than the configured precision
+    var precision = isNumber(options) ? options : options ? options.precision : null;
+    if (precision !== null) {
+      var epsilon = Math.pow(10, -precision);
+      if (Math.abs(re / im) < epsilon) {
+        re = 0;
+      }
+      if (Math.abs(im / re) < epsilon) {
+        im = 0;
+      }
+    }
+    if (im === 0) {
+      // real value
+      str = strRe;
+    } else if (re === 0) {
+      // purely complex value
+      if (im === 1) {
+        str = 'i';
+      } else if (im === -1) {
+        str = '-i';
+      } else {
+        str = strIm + 'i';
+      }
+    } else {
+      // complex value
+      if (im < 0) {
+        if (im === -1) {
+          str = strRe + ' - i';
+        } else {
+          str = strRe + ' - ' + strIm.substring(1) + 'i';
+        }
+      } else {
+        if (im === 1) {
+          str = strRe + ' + i';
+        } else {
+          str = strRe + ' + ' + strIm + 'i';
+        }
+      }
+    }
+    return str;
+  };
+
+  /**
+   * Create a complex number from polar coordinates
+   *
+   * Usage:
+   *
+   *     Complex.fromPolar(r: number, phi: number) : Complex
+   *     Complex.fromPolar({r: number, phi: number}) : Complex
+   *
+   * @param {*} args...
+   * @return {Complex}
+   */
+  Complex.fromPolar = function (args) {
+    switch (arguments.length) {
+      case 1:
+        {
+          var arg = arguments[0];
+          if (typeof arg === 'object') {
+            return Complex(arg);
+          } else {
+            throw new TypeError('Input has to be an object with r and phi keys.');
+          }
+        }
+      case 2:
+        {
+          var r = arguments[0];
+          var phi = arguments[1];
+          if (isNumber(r)) {
+            if (isUnit(phi) && phi.hasBase('ANGLE')) {
+              // convert unit to a number in radians
+              phi = phi.toNumber('rad');
+            }
+            if (isNumber(phi)) {
+              return new Complex({
+                r,
+                phi
+              });
+            }
+            throw new TypeError('Phi is not a number nor an angle unit.');
+          } else {
+            throw new TypeError('Radius r is not a number.');
+          }
+        }
+      default:
+        throw new SyntaxError('Wrong number of arguments in function fromPolar');
+    }
+  };
+  Complex.prototype.valueOf = Complex.prototype.toString;
+
+  /**
+   * Create a Complex number from a JSON object
+   * @param {Object} json  A JSON Object structured as
+   *                       {"mathjs": "Complex", "re": 2, "im": 3}
+   *                       All properties are optional, default values
+   *                       for `re` and `im` are 0.
+   * @return {Complex} Returns a new Complex number
+   */
+  Complex.fromJSON = function (json) {
+    return new Complex(json);
+  };
+
+  /**
+   * Compare two complex numbers, `a` and `b`:
+   *
+   * - Returns 1 when the real part of `a` is larger than the real part of `b`
+   * - Returns -1 when the real part of `a` is smaller than the real part of `b`
+   * - Returns 1 when the real parts are equal
+   *   and the imaginary part of `a` is larger than the imaginary part of `b`
+   * - Returns -1 when the real parts are equal
+   *   and the imaginary part of `a` is smaller than the imaginary part of `b`
+   * - Returns 0 when both real and imaginary parts are equal.
+   *
+   * @params {Complex} a
+   * @params {Complex} b
+   * @returns {number} Returns the comparison result: -1, 0, or 1
+   */
+  Complex.compare = function (a, b) {
+    if (a.re > b.re) {
+      return 1;
+    }
+    if (a.re < b.re) {
+      return -1;
+    }
+    if (a.im > b.im) {
+      return 1;
+    }
+    if (a.im < b.im) {
+      return -1;
+    }
+    return 0;
+  };
+  return Complex;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/complex/function/complex.js b/node_modules/mathjs/lib/esm/type/complex/function/complex.js
new file mode 100644
index 0000000..feb10bd
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/complex/function/complex.js
@@ -0,0 +1,85 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'complex';
+var dependencies = ['typed', 'Complex'];
+export var createComplex = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Complex
+  } = _ref;
+  /**
+   * Create a complex value or convert a value to a complex value.
+   *
+   * Syntax:
+   *
+   *     math.complex()                           // creates a complex value with zero
+   *                                              // as real and imaginary part.
+   *     math.complex(re : number, im : string)   // creates a complex value with provided
+   *                                              // values for real and imaginary part.
+   *     math.complex(re : number)                // creates a complex value with provided
+   *                                              // real value and zero imaginary part.
+   *     math.complex(complex : Complex)          // clones the provided complex value.
+   *     math.complex(arg : string)               // parses a string into a complex value.
+   *     math.complex(array : Array)              // converts the elements of the array
+   *                                              // or matrix element wise into a
+   *                                              // complex value.
+   *     math.complex({re: number, im: number})   // creates a complex value with provided
+   *                                              // values for real an imaginary part.
+   *     math.complex({r: number, phi: number})   // creates a complex value with provided
+   *                                              // polar coordinates
+   *
+   * Examples:
+   *
+   *    const a = math.complex(3, -4)     // a = Complex 3 - 4i
+   *    a.re = 5                          // a = Complex 5 - 4i
+   *    const i = a.im                    // Number -4
+   *    const b = math.complex('2 + 6i')  // Complex 2 + 6i
+   *    const c = math.complex()          // Complex 0 + 0i
+   *    const d = math.add(a, b)          // Complex 5 + 2i
+   *
+   * See also:
+   *
+   *    bignumber, boolean, index, matrix, number, string, unit
+   *
+   * @param {* | Array | Matrix} [args]
+   *            Arguments specifying the real and imaginary part of the complex number
+   * @return {Complex | Array | Matrix} Returns a complex value
+   */
+  return typed('complex', {
+    '': function _() {
+      return Complex.ZERO;
+    },
+    number: function number(x) {
+      return new Complex(x, 0);
+    },
+    'number, number': function number_number(re, im) {
+      return new Complex(re, im);
+    },
+    // TODO: this signature should be redundant
+    'BigNumber, BigNumber': function BigNumber_BigNumber(re, im) {
+      return new Complex(re.toNumber(), im.toNumber());
+    },
+    Fraction: function Fraction(x) {
+      return new Complex(x.valueOf(), 0);
+    },
+    Complex: function Complex(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      return Complex(x); // for example '2 + 3i'
+    },
+    null: function _null(x) {
+      return Complex(0);
+    },
+    Object: function Object(x) {
+      if ('re' in x && 'im' in x) {
+        return new Complex(x.re, x.im);
+      }
+      if ('r' in x && 'phi' in x || 'abs' in x && 'arg' in x) {
+        return new Complex(x);
+      }
+      throw new Error('Expected object with properties (re and im) or (r and phi) or (abs and arg)');
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/fraction/Fraction.js b/node_modules/mathjs/lib/esm/type/fraction/Fraction.js
new file mode 100644
index 0000000..3ac4045
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/fraction/Fraction.js
@@ -0,0 +1,41 @@
+import Fraction from 'fraction.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Fraction';
+var dependencies = [];
+export var createFractionClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(Fraction, 'name', {
+    value: 'Fraction'
+  });
+  Fraction.prototype.constructor = Fraction;
+  Fraction.prototype.type = 'Fraction';
+  Fraction.prototype.isFraction = true;
+
+  /**
+   * Get a JSON representation of a Fraction containing type information
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Fraction", "n": "3", "d": "8"}`
+   */
+  Fraction.prototype.toJSON = function () {
+    return {
+      mathjs: 'Fraction',
+      n: String(this.s * this.n),
+      d: String(this.d)
+    };
+  };
+
+  /**
+   * Instantiate a Fraction from a JSON object
+   * @param {Object} json  a JSON object structured as:
+   *                       `{"mathjs": "Fraction", "n": "3", "d": "8"}`
+   * @return {BigNumber}
+   */
+  Fraction.fromJSON = function (json) {
+    return new Fraction(json);
+  };
+  return Fraction;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js b/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js
new file mode 100644
index 0000000..eaaa46d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js
@@ -0,0 +1,85 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'fraction';
+var dependencies = ['typed', 'Fraction'];
+export var createFraction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Fraction
+  } = _ref;
+  /**
+   * Create a fraction or convert a value to a fraction.
+   *
+   * With one numeric argument, produces the closest rational approximation to the
+   * input.
+   * With two arguments, the first is the numerator and the second is the denominator,
+   * and creates the corresponding fraction. Both numerator and denominator must be
+   * integers.
+   * With one object argument, looks for the integer numerator as the value of property
+   * 'n' and the integer denominator as the value of property 'd'.
+   * With a matrix argument, creates a matrix of the same shape with entries
+   * converted into fractions.
+   *
+   * Syntax:
+   *     math.fraction(value)
+   *     math.fraction(numerator, denominator)
+   *     math.fraction({n: numerator, d: denominator})
+   *     math.fraction(matrix: Array | Matrix)
+   *
+   * Examples:
+   *
+   *     math.fraction(6.283)             // returns Fraction 6283/1000
+   *     math.fraction(1, 3)              // returns Fraction 1/3
+   *     math.fraction('2/3')             // returns Fraction 2/3
+   *     math.fraction({n: 2, d: 3})      // returns Fraction 2/3
+   *     math.fraction([0.2, 0.25, 1.25]) // returns Array [1/5, 1/4, 5/4]
+   *     math.fraction(4, 5.1)            // throws Error: Parameters must be integer
+   *
+   * See also:
+   *
+   *    bignumber, number, string, unit
+   *
+   * @param {number | string | Fraction | BigNumber | bigint | Unit | Array | Matrix} [args]
+   *            Arguments specifying the value, or numerator and denominator of
+   *            the fraction
+   * @return {Fraction | Array | Matrix} Returns a fraction
+   */
+  return typed('fraction', {
+    number: function number(x) {
+      if (!isFinite(x) || isNaN(x)) {
+        throw new Error(x + ' cannot be represented as a fraction');
+      }
+      return new Fraction(x);
+    },
+    string: function string(x) {
+      return new Fraction(x);
+    },
+    'number, number': function number_number(numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    'bigint, bigint': function bigint_bigint(numerator, denominator) {
+      return new Fraction(numerator, denominator);
+    },
+    null: function _null(x) {
+      return new Fraction(0);
+    },
+    BigNumber: function BigNumber(x) {
+      return new Fraction(x.toString());
+    },
+    bigint: function bigint(x) {
+      return new Fraction(x.toString());
+    },
+    Fraction: function Fraction(x) {
+      return x; // fractions are immutable
+    },
+    Unit: typed.referToSelf(self => x => {
+      var clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    Object: function Object(x) {
+      return new Fraction(x);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js
new file mode 100644
index 0000000..33d66d8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js
@@ -0,0 +1,1035 @@
+// deno-lint-ignore-file no-this-alias
+import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';
+import { arraySize, getArrayDataType, processSizesWildcard, reshape, resize, unsqueeze, validate, validateIndex, broadcastTo, get } from '../../utils/array.js';
+import { format } from '../../utils/string.js';
+import { isInteger } from '../../utils/number.js';
+import { clone, deepStrictEqual } from '../../utils/object.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { factory } from '../../utils/factory.js';
+import { optimizeCallback } from '../../utils/optimizeCallback.js';
+var name = 'DenseMatrix';
+var dependencies = ['Matrix'];
+export var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    Matrix
+  } = _ref;
+  /**
+   * Dense Matrix implementation. A regular, dense matrix, supporting multi-dimensional matrices. This is the default matrix type.
+   * @class DenseMatrix
+   * @enum {{ value, index: number[] }}
+   */
+  function DenseMatrix(data, datatype) {
+    if (!(this instanceof DenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if (isMatrix(data)) {
+      // check data is a DenseMatrix
+      if (data.type === 'DenseMatrix') {
+        // clone data & size
+        this._data = clone(data._data);
+        this._size = clone(data._size);
+        this._datatype = datatype || data._datatype;
+      } else {
+        // build data from existing matrix
+        this._data = data.toArray();
+        this._size = data.size();
+        this._datatype = datatype || data._datatype;
+      }
+    } else if (data && isArray(data.data) && isArray(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      // verify the dimensions of the array
+      validate(this._data, this._size);
+      this._datatype = datatype || data.datatype;
+    } else if (isArray(data)) {
+      // replace nested Matrices with Arrays
+      this._data = preprocess(data);
+      // get the dimensions of the array
+      this._size = arraySize(this._data);
+      // verify the dimensions of the array, TODO: compute size while processing array
+      validate(this._data, this._size);
+      // data type unknown
+      this._datatype = datatype;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+    }
+  }
+  DenseMatrix.prototype = new Matrix();
+
+  /**
+   * Create a new DenseMatrix
+   */
+  DenseMatrix.prototype.createDenseMatrix = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(DenseMatrix, 'name', {
+    value: 'DenseMatrix'
+  });
+  DenseMatrix.prototype.constructor = DenseMatrix;
+  DenseMatrix.prototype.type = 'DenseMatrix';
+  DenseMatrix.prototype.isDenseMatrix = true;
+
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf DenseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+  DenseMatrix.prototype.getDataType = function () {
+    return getArrayDataType(this._data, typeOf);
+  };
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()  // retrieve storage format
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The storage format.
+   */
+  DenseMatrix.prototype.storage = function () {
+    return 'dense';
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()   // retrieve matrix datatype
+   *
+   * @memberof DenseMatrix
+   * @return {string}           The datatype.
+   */
+  DenseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+
+  /**
+   * Create a new DenseMatrix
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+  DenseMatrix.prototype.create = function (data, datatype) {
+    return new DenseMatrix(data, datatype);
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof DenseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  DenseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    switch (arguments.length) {
+      case 1:
+        return _get(this, index);
+
+      // intentional fall through
+      case 2:
+      case 3:
+        return _set(this, index, replacement, defaultValue);
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  /**
+   * Get a single element from the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  DenseMatrix.prototype.get = function (index) {
+    return get(this._data, index);
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @memberof DenseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {DenseMatrix} self
+   */
+  DenseMatrix.prototype.set = function (index, value, defaultValue) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length < this._size.length) {
+      throw new DimensionError(index.length, this._size.length, '<');
+    }
+    var i, ii, indexI;
+
+    // enlarge matrix when needed
+    var size = index.map(function (i) {
+      return i + 1;
+    });
+    _fit(this, size, defaultValue);
+
+    // traverse over the dimensions
+    var data = this._data;
+    for (i = 0, ii = index.length - 1; i < ii; i++) {
+      indexI = index[i];
+      validateIndex(indexI, data.length);
+      data = data[indexI];
+    }
+
+    // set new value
+    indexI = index[index.length - 1];
+    validateIndex(indexI, data.length);
+    data[indexI] = value;
+    return this;
+  };
+
+  /**
+   * Get a submatrix of this matrix
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index   Zero-based index
+   * @private
+   */
+  function _get(matrix, index) {
+    if (!isIndex(index)) {
+      throw new TypeError('Invalid index');
+    }
+    var isScalar = index.isScalar();
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(index.min());
+    } else {
+      // validate dimensions
+      var size = index.size();
+      if (size.length !== matrix._size.length) {
+        throw new DimensionError(size.length, matrix._size.length);
+      }
+
+      // validate if any of the ranges in the index is out of range
+      var min = index.min();
+      var max = index.max();
+      for (var i = 0, ii = matrix._size.length; i < ii; i++) {
+        validateIndex(min[i], matrix._size[i]);
+        validateIndex(max[i], matrix._size[i]);
+      }
+
+      // retrieve submatrix
+      var returnMatrix = new DenseMatrix([]);
+      var submatrix = _getSubmatrix(matrix._data, index);
+      returnMatrix._size = submatrix.size;
+      returnMatrix._datatype = matrix._datatype;
+      returnMatrix._data = submatrix.data;
+      return returnMatrix;
+    }
+  }
+
+  /**
+   * Get a submatrix of a multi dimensional matrix.
+   * Index is not checked for correct number or length of dimensions.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @return {Array} submatrix
+   * @private
+   */
+  function _getSubmatrix(data, index) {
+    var maxDepth = index.size().length - 1;
+    var size = Array(maxDepth);
+    return {
+      data: getSubmatrixRecursive(data),
+      size
+    };
+    function getSubmatrixRecursive(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var ranges = index.dimension(depth);
+      size[depth] = ranges.size()[0];
+      if (depth < maxDepth) {
+        return ranges.map(rangeIndex => {
+          validateIndex(rangeIndex, data.length);
+          return getSubmatrixRecursive(data[rangeIndex], depth + 1);
+        }).valueOf();
+      } else {
+        return ranges.map(rangeIndex => {
+          validateIndex(rangeIndex, data.length);
+          return data[rangeIndex];
+        }).valueOf();
+      }
+    }
+  }
+
+  /**
+   * Replace a submatrix in this matrix
+   * Indexes are zero-based.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix
+   * @param {Index} index
+   * @param {DenseMatrix | Array | *} submatrix
+   * @param {*} defaultValue          Default value, filled in on new entries when
+   *                                  the matrix is resized.
+   * @return {DenseMatrix} matrix
+   * @private
+   */
+  function _set(matrix, index, submatrix, defaultValue) {
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    }
+
+    // get index size and check whether the index contains a single value
+    var iSize = index.size();
+    var isScalar = index.isScalar();
+
+    // calculate the size of the submatrix, and convert it into an Array if needed
+    var sSize;
+    if (isMatrix(submatrix)) {
+      sSize = submatrix.size();
+      submatrix = submatrix.valueOf();
+    } else {
+      sSize = arraySize(submatrix);
+    }
+    if (isScalar) {
+      // set a scalar
+
+      // check whether submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // set a submatrix
+
+      // broadcast submatrix
+      if (!deepStrictEqual(sSize, iSize)) {
+        try {
+          if (sSize.length === 0) {
+            submatrix = broadcastTo([submatrix], iSize);
+          } else {
+            submatrix = broadcastTo(submatrix, iSize);
+          }
+          sSize = arraySize(submatrix);
+        } catch (_unused) {}
+      }
+
+      // validate dimensions
+      if (iSize.length < matrix._size.length) {
+        throw new DimensionError(iSize.length, matrix._size.length, '<');
+      }
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        }
+
+        // unsqueeze both outer and inner dimensions
+        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);
+      }
+
+      // check whether the size of the submatrix matches the index size
+      if (!deepStrictEqual(iSize, sSize)) {
+        throw new DimensionError(iSize, sSize, '>');
+      }
+
+      // enlarge matrix when needed
+      var size = index.max().map(function (i) {
+        return i + 1;
+      });
+      _fit(matrix, size, defaultValue);
+
+      // insert the sub matrix
+      _setSubmatrix(matrix._data, index, submatrix);
+    }
+    return matrix;
+  }
+
+  /**
+   * Replace a submatrix of a multi dimensional matrix.
+   * @memberof DenseMatrix
+   * @param {Array} data
+   * @param {Index} index
+   * @param {Array} submatrix
+   * @private
+   */
+  function _setSubmatrix(data, index, submatrix) {
+    var maxDepth = index.size().length - 1;
+    setSubmatrixRecursive(data, submatrix);
+    function setSubmatrixRecursive(data, submatrix) {
+      var depth = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+      var range = index.dimension(depth);
+      if (depth < maxDepth) {
+        range.forEach((rangeIndex, i) => {
+          validateIndex(rangeIndex, data.length);
+          setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);
+        });
+      } else {
+        range.forEach((rangeIndex, i) => {
+          validateIndex(rangeIndex, data.length);
+          data[rangeIndex] = submatrix[i[0]];
+        });
+      }
+    }
+  }
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof DenseMatrix
+   * @param {number[] || Matrix} size The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  DenseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!isCollection(size)) {
+      throw new TypeError('Array or Matrix expected');
+    }
+
+    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+    var sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+
+    // matrix to resize
+    var m = copy ? this.clone() : this;
+    // resize matrix
+    return _resize(m, sizeArray, defaultValue);
+  };
+  function _resize(matrix, size, defaultValue) {
+    // check size
+    if (size.length === 0) {
+      // first value in matrix
+      var v = matrix._data;
+      // go deep
+      while (isArray(v)) {
+        v = v[0];
+      }
+      return v;
+    }
+    // resize matrix
+    matrix._size = size.slice(0); // copy the array
+    matrix._data = resize(matrix._data, matrix._size, defaultValue);
+    // return matrix
+    return matrix;
+  }
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof DenseMatrix
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  DenseMatrix.prototype.reshape = function (size, copy) {
+    var m = copy ? this.clone() : this;
+    m._data = reshape(m._data, size);
+    var currentLength = m._size.reduce((length, size) => length * size);
+    m._size = processSizesWildcard(size, currentLength);
+    return m;
+  };
+
+  /**
+   * Enlarge the matrix when it is smaller than given size.
+   * If the matrix is larger or equal sized, nothing is done.
+   * @memberof DenseMatrix
+   * @param {DenseMatrix} matrix           The matrix to be resized
+   * @param {number[]} size
+   * @param {*} defaultValue          Default value, filled in on new entries.
+   * @private
+   */
+  function _fit(matrix, size, defaultValue) {
+    var
+    // copy the array
+    newSize = matrix._size.slice(0);
+    var changed = false;
+
+    // add dimensions when needed
+    while (newSize.length < size.length) {
+      newSize.push(0);
+      changed = true;
+    }
+
+    // enlarge size when needed
+    for (var i = 0, ii = size.length; i < ii; i++) {
+      if (size[i] > newSize[i]) {
+        newSize[i] = size[i];
+        changed = true;
+      }
+    }
+    if (changed) {
+      // resize only when size is changed
+      _resize(matrix, newSize, defaultValue);
+    }
+  }
+
+  /**
+   * Create a clone of the matrix
+   * @memberof DenseMatrix
+   * @return {DenseMatrix} clone
+   */
+  DenseMatrix.prototype.clone = function () {
+    var m = new DenseMatrix({
+      data: clone(this._data),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof DenseMatrix
+   * @returns {number[]} size
+   */
+  DenseMatrix.prototype.size = function () {
+    return this._size.slice(0); // return a clone of _size
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
+   *
+   * @return {DenseMatrix} matrix
+   */
+  DenseMatrix.prototype.map = function (callback) {
+    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    var me = this;
+    var maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return me.clone();
+    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);
+    var fastCallbackFn = fastCallback.fn;
+    var result = me.create(undefined, me._datatype);
+    result._size = me._size;
+    if (isUnary || fastCallback.isUnary) {
+      result._data = iterateUnary(me._data);
+      return result;
+    }
+    if (maxDepth === 0) {
+      var inputData = me.valueOf();
+      var data = Array(inputData.length);
+      for (var i = 0; i < inputData.length; i++) {
+        data[i] = fastCallbackFn(inputData[i], [i], me);
+      }
+      result._data = data;
+      return result;
+    }
+    var index = [];
+    result._data = iterate(me._data);
+    return result;
+    function iterate(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var result = Array(data.length);
+      if (depth < maxDepth) {
+        for (var _i = 0; _i < data.length; _i++) {
+          index[depth] = _i;
+          result[_i] = iterate(data[_i], depth + 1);
+        }
+      } else {
+        for (var _i2 = 0; _i2 < data.length; _i2++) {
+          index[depth] = _i2;
+          result[_i2] = fastCallbackFn(data[_i2], index.slice(), me);
+        }
+      }
+      return result;
+    }
+    function iterateUnary(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      var result = Array(data.length);
+      if (depth < maxDepth) {
+        for (var _i3 = 0; _i3 < data.length; _i3++) {
+          result[_i3] = iterateUnary(data[_i3], depth + 1);
+        }
+      } else {
+        for (var _i4 = 0; _i4 < data.length; _i4++) {
+          result[_i4] = fastCallbackFn(data[_i4]);
+        }
+      }
+      return result;
+    }
+  };
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof DenseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} skipZeros   If true, the callback function is invoked only for non-zero entries
+   * @param {boolean} isUnary     If true, the callback function is invoked with one parameter
+   */
+  DenseMatrix.prototype.forEach = function (callback) {
+    var skipZeros = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+    var isUnary = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+    var me = this;
+    var maxDepth = me._size.length - 1;
+    if (maxDepth < 0) return;
+    var fastCallback = optimizeCallback(callback, me, 'map', isUnary);
+    var fastCallbackFn = fastCallback.fn;
+    if (isUnary || fastCallback.isUnary) {
+      iterateUnary(me._data);
+      return;
+    }
+    if (maxDepth === 0) {
+      for (var i = 0; i < me._data.length; i++) {
+        fastCallbackFn(me._data[i], [i], me);
+      }
+      return;
+    }
+    var index = [];
+    iterate(me._data);
+    function iterate(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (var _i5 = 0; _i5 < data.length; _i5++) {
+          index[depth] = _i5;
+          iterate(data[_i5], depth + 1);
+        }
+      } else {
+        for (var _i6 = 0; _i6 < data.length; _i6++) {
+          index[depth] = _i6;
+          fastCallbackFn(data[_i6], index.slice(), me);
+        }
+      }
+    }
+    function iterateUnary(data) {
+      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+      if (depth < maxDepth) {
+        for (var _i7 = 0; _i7 < data.length; _i7++) {
+          iterateUnary(data[_i7], depth + 1);
+        }
+      } else {
+        for (var _i8 = 0; _i8 < data.length; _i8++) {
+          fastCallbackFn(data[_i8]);
+        }
+      }
+    }
+  };
+
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  DenseMatrix.prototype[Symbol.iterator] = function* () {
+    var maxDepth = this._size.length - 1;
+    if (maxDepth < 0) {
+      return;
+    }
+    if (maxDepth === 0) {
+      for (var i = 0; i < this._data.length; i++) {
+        yield {
+          value: this._data[i],
+          index: [i]
+        };
+      }
+      return;
+    }
+
+    // Multi-dimensional matrix: iterate over all elements
+    var index = Array(maxDepth + 1).fill(0);
+    var totalElements = this._size.reduce((a, b) => a * b, 1);
+    for (var count = 0; count < totalElements; count++) {
+      // Traverse to the current element using indices
+      var current = this._data;
+      for (var d = 0; d < maxDepth; d++) {
+        current = current[index[d]];
+      }
+      yield {
+        value: current[index[maxDepth]],
+        index: index.slice()
+      };
+
+      // Increment indices for next element
+      for (var _d = maxDepth; _d >= 0; _d--) {
+        index[_d]++;
+        if (index[_d] < this._size[_d]) break;
+        index[_d] = 0;
+      }
+    }
+  };
+
+  /**
+   * Returns an array containing the rows of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+  DenseMatrix.prototype.rows = function () {
+    var result = [];
+    var s = this.size();
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+    var data = this._data;
+    for (var row of data) {
+      result.push(new DenseMatrix([row], this._datatype));
+    }
+    return result;
+  };
+
+  /**
+   * Returns an array containing the columns of a 2D matrix
+   * @returns {Array<Matrix>}
+   */
+  DenseMatrix.prototype.columns = function () {
+    var _this = this;
+    var result = [];
+    var s = this.size();
+    if (s.length !== 2) {
+      throw new TypeError('Rows can only be returned for a 2D matrix.');
+    }
+    var data = this._data;
+    var _loop = function _loop(i) {
+      var col = data.map(row => [row[i]]);
+      result.push(new DenseMatrix(col, _this._datatype));
+    };
+    for (var i = 0; i < s[1]; i++) {
+      _loop(i);
+    }
+    return result;
+  };
+
+  /**
+   * Create an Array with a copy of the data of the DenseMatrix
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+  DenseMatrix.prototype.toArray = function () {
+    return clone(this._data);
+  };
+
+  /**
+   * Get the primitive value of the DenseMatrix: a multidimensional array
+   * @memberof DenseMatrix
+   * @returns {Array} array
+   */
+  DenseMatrix.prototype.valueOf = function () {
+    return this._data;
+  };
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof DenseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  DenseMatrix.prototype.format = function (options) {
+    return format(this._data, options);
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {string} str
+   */
+  DenseMatrix.prototype.toString = function () {
+    return format(this._data);
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof DenseMatrix
+   * @returns {Object}
+   */
+  DenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'DenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof DenseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix with the diagonal values.
+   */
+  DenseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0;
+
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+
+    // number diagonal values
+    var n = Math.min(rows - kSub, columns - kSuper);
+
+    // x is a matrix get diagonal from matrix
+    var data = [];
+
+    // loop rows
+    for (var i = 0; i < n; i++) {
+      data[i] = this._data[i + kSub][i + kSuper];
+    }
+
+    // create DenseMatrix
+    return new DenseMatrix({
+      data,
+      size: [n],
+      datatype: this._datatype
+    });
+  };
+
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {Array} size                     The matrix size.
+   * @param {number | Matrix | Array } value The values for the diagonal.
+   * @param {number | BigNumber} [k=0]       The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]          The default value for non-diagonal
+   * @param {string} [datatype]              The datatype for the diagonal
+   *
+   * @returns {DenseMatrix}
+   */
+  DenseMatrix.diagonal = function (size, value, k, defaultValue) {
+    if (!isArray(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // map size & validate
+    size = size.map(function (s) {
+      // check it is a big number
+      if (isBigNumber(s)) {
+        // convert it
+        s = s.toNumber();
+      }
+      // validate arguments
+      if (!isNumber(s) || !isInteger(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+      return s;
+    });
+
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0;
+
+    // rows and columns
+    var rows = size[0];
+    var columns = size[1];
+
+    // number of non-zero items
+    var n = Math.min(rows - kSub, columns - kSuper);
+
+    // value extraction function
+    var _value;
+
+    // check value
+    if (isArray(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      }
+      // define function
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if (isMatrix(value)) {
+      // matrix size
+      var ms = value.size();
+      // validate matrix
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      }
+      // define function
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    }
+
+    // discover default value if needed
+    if (!defaultValue) {
+      // check first value in array
+      defaultValue = isBigNumber(_value(0)) ? _value(0).mul(0) // trick to create a BigNumber with value zero
+      : 0;
+    }
+
+    // empty array
+    var data = [];
+
+    // check we need to resize array
+    if (size.length > 0) {
+      // resize array
+      data = resize(data, size, defaultValue);
+      // fill diagonal
+      for (var d = 0; d < n; d++) {
+        data[d + kSub][d + kSuper] = _value(d);
+      }
+    }
+
+    // create DenseMatrix
+    return new DenseMatrix({
+      data,
+      size: [rows, columns]
+    });
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof DenseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "DenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {DenseMatrix}
+   */
+  DenseMatrix.fromJSON = function (json) {
+    return new DenseMatrix(json);
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof DenseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  DenseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {
+      throw new Error('Row index must be positive integers');
+    }
+    // check dimensions
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    // validate index
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[0]);
+
+    // swap rows
+    DenseMatrix._swapRows(i, j, this._data);
+    // return current instance
+    return this;
+  };
+
+  /**
+   * Swap rows i and j in Dense Matrix data structure.
+   *
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   * @param {Array} data     Matrix data
+   */
+  DenseMatrix._swapRows = function (i, j, data) {
+    // swap values i <-> j
+    var vi = data[i];
+    data[i] = data[j];
+    data[j] = vi;
+  };
+
+  /**
+   * Preprocess data, which can be an Array or DenseMatrix with nested Arrays and
+   * Matrices. Clones all (nested) Arrays, and replaces all nested Matrices with Arrays
+   * @memberof DenseMatrix
+   * @param {Array | Matrix} data
+   * @return {Array} data
+   */
+  function preprocess(data) {
+    if (isMatrix(data)) {
+      return preprocess(data.valueOf());
+    }
+    if (isArray(data)) {
+      return data.map(preprocess);
+    }
+    return data;
+  }
+  return DenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js b/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js
new file mode 100644
index 0000000..b1c2f71
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/FibonacciHeap.js
@@ -0,0 +1,351 @@
+import { factory } from '../../utils/factory.js';
+var name = 'FibonacciHeap';
+var dependencies = ['smaller', 'larger'];
+export var createFibonacciHeapClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    smaller,
+    larger
+  } = _ref;
+  var oneOverLogPhi = 1.0 / Math.log((1.0 + Math.sqrt(5.0)) / 2.0);
+
+  /**
+   * Fibonacci Heap implementation, used interally for Matrix math.
+   * @class FibonacciHeap
+   * @constructor FibonacciHeap
+   */
+  function FibonacciHeap() {
+    if (!(this instanceof FibonacciHeap)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    // initialize fields
+    this._minimum = null;
+    this._size = 0;
+  }
+
+  /**
+   * Attach type information
+   */
+  FibonacciHeap.prototype.type = 'FibonacciHeap';
+  FibonacciHeap.prototype.isFibonacciHeap = true;
+
+  /**
+   * Inserts a new data element into the heap. No heap consolidation is
+   * performed at this time, the new node is simply inserted into the root
+   * list of this heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.insert = function (key, value) {
+    // create node
+    var node = {
+      key,
+      value,
+      degree: 0
+    };
+    // check we have a node in the minimum
+    if (this._minimum) {
+      // minimum node
+      var minimum = this._minimum;
+      // update left & right of node
+      node.left = minimum;
+      node.right = minimum.right;
+      minimum.right = node;
+      node.right.left = node;
+      // update minimum node in heap if needed
+      if (smaller(key, minimum.key)) {
+        // node has a smaller key, use it as minimum
+        this._minimum = node;
+      }
+    } else {
+      // set left & right
+      node.left = node;
+      node.right = node;
+      // this is the first node
+      this._minimum = node;
+    }
+    // increment number of nodes in heap
+    this._size++;
+    // return node
+    return node;
+  };
+
+  /**
+   * Returns the number of nodes in heap. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.size = function () {
+    return this._size;
+  };
+
+  /**
+   * Removes all elements from this heap.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.clear = function () {
+    this._minimum = null;
+    this._size = 0;
+  };
+
+  /**
+   * Returns true if the heap is empty, otherwise false.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.isEmpty = function () {
+    return this._size === 0;
+  };
+
+  /**
+   * Extracts the node with minimum key from heap. Amortized running
+   * time: O(log n).
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.extractMinimum = function () {
+    // node to remove
+    var node = this._minimum;
+    // check we have a minimum
+    if (node === null) {
+      return node;
+    }
+    // current minimum
+    var minimum = this._minimum;
+    // get number of children
+    var numberOfChildren = node.degree;
+    // pointer to the first child
+    var x = node.child;
+    // for each child of node do...
+    while (numberOfChildren > 0) {
+      // store node in right side
+      var tempRight = x.right;
+      // remove x from child list
+      x.left.right = x.right;
+      x.right.left = x.left;
+      // add x to root list of heap
+      x.left = minimum;
+      x.right = minimum.right;
+      minimum.right = x;
+      x.right.left = x;
+      // set Parent[x] to null
+      x.parent = null;
+      x = tempRight;
+      numberOfChildren--;
+    }
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left;
+    // update minimum
+    if (node === node.right) {
+      // empty
+      minimum = null;
+    } else {
+      // update minimum
+      minimum = node.right;
+      // we need to update the pointer to the root with minimum key
+      minimum = _findMinimumNode(minimum, this._size);
+    }
+    // decrement size of heap
+    this._size--;
+    // update minimum
+    this._minimum = minimum;
+    // return node
+    return node;
+  };
+
+  /**
+   * Removes a node from the heap given the reference to the node. The trees
+   * in the heap will be consolidated, if necessary. This operation may fail
+   * to remove the correct element if there are nodes with key value -Infinity.
+   * Running time: O(log n) amortized.
+   * @memberof FibonacciHeap
+   */
+  FibonacciHeap.prototype.remove = function (node) {
+    // decrease key value
+    this._minimum = _decreaseKey(this._minimum, node, -1);
+    // remove the smallest
+    this.extractMinimum();
+  };
+
+  /**
+   * Decreases the key value for a heap node, given the new value to take on.
+   * The structure of the heap may be changed and will not be consolidated.
+   * Running time: O(1) amortized.
+   * @memberof FibonacciHeap
+   */
+  function _decreaseKey(minimum, node, key) {
+    // set node key
+    node.key = key;
+    // get parent node
+    var parent = node.parent;
+    if (parent && smaller(node.key, parent.key)) {
+      // remove node from parent
+      _cut(minimum, node, parent);
+      // remove all nodes from parent to the root parent
+      _cascadingCut(minimum, parent);
+    }
+    // update minimum node if needed
+    if (smaller(node.key, minimum.key)) {
+      minimum = node;
+    }
+    // return minimum
+    return minimum;
+  }
+
+  /**
+   * The reverse of the link operation: removes node from the child list of parent.
+   * This method assumes that min is non-null. Running time: O(1).
+   * @memberof FibonacciHeap
+   */
+  function _cut(minimum, node, parent) {
+    // remove node from parent children and decrement Degree[parent]
+    node.left.right = node.right;
+    node.right.left = node.left;
+    parent.degree--;
+    // reset y.child if necessary
+    if (parent.child === node) {
+      parent.child = node.right;
+    }
+    // remove child if degree is 0
+    if (parent.degree === 0) {
+      parent.child = null;
+    }
+    // add node to root list of heap
+    node.left = minimum;
+    node.right = minimum.right;
+    minimum.right = node;
+    node.right.left = node;
+    // set parent[node] to null
+    node.parent = null;
+    // set mark[node] to false
+    node.mark = false;
+  }
+
+  /**
+   * Performs a cascading cut operation. This cuts node from its parent and then
+   * does the same for its parent, and so on up the tree.
+   * Running time: O(log n); O(1) excluding the recursion.
+   * @memberof FibonacciHeap
+   */
+  function _cascadingCut(minimum, node) {
+    // store parent node
+    var parent = node.parent;
+    // if there's a parent...
+    if (!parent) {
+      return;
+    }
+    // if node is unmarked, set it marked
+    if (!node.mark) {
+      node.mark = true;
+    } else {
+      // it's marked, cut it from parent
+      _cut(minimum, node, parent);
+      // cut its parent as well
+      _cascadingCut(parent);
+    }
+  }
+
+  /**
+   * Make the first node a child of the second one. Running time: O(1) actual.
+   * @memberof FibonacciHeap
+   */
+  var _linkNodes = function _linkNodes(node, parent) {
+    // remove node from root list of heap
+    node.left.right = node.right;
+    node.right.left = node.left;
+    // make node a Child of parent
+    node.parent = parent;
+    if (!parent.child) {
+      parent.child = node;
+      node.right = node;
+      node.left = node;
+    } else {
+      node.left = parent.child;
+      node.right = parent.child.right;
+      parent.child.right = node;
+      node.right.left = node;
+    }
+    // increase degree[parent]
+    parent.degree++;
+    // set mark[node] false
+    node.mark = false;
+  };
+  function _findMinimumNode(minimum, size) {
+    // to find trees of the same degree efficiently we use an array of length O(log n) in which we keep a pointer to one root of each degree
+    var arraySize = Math.floor(Math.log(size) * oneOverLogPhi) + 1;
+    // create list with initial capacity
+    var array = new Array(arraySize);
+    // find the number of root nodes.
+    var numRoots = 0;
+    var x = minimum;
+    if (x) {
+      numRoots++;
+      x = x.right;
+      while (x !== minimum) {
+        numRoots++;
+        x = x.right;
+      }
+    }
+    // vars
+    var y;
+    // For each node in root list do...
+    while (numRoots > 0) {
+      // access this node's degree..
+      var d = x.degree;
+      // get next node
+      var next = x.right;
+      // check if there is a node already in array with the same degree
+      while (true) {
+        // get node with the same degree is any
+        y = array[d];
+        if (!y) {
+          break;
+        }
+        // make one node with the same degree a child of the other, do this based on the key value.
+        if (larger(x.key, y.key)) {
+          var temp = y;
+          y = x;
+          x = temp;
+        }
+        // make y a child of x
+        _linkNodes(y, x);
+        // we have handled this degree, go to next one.
+        array[d] = null;
+        d++;
+      }
+      // save this node for later when we might encounter another of the same degree.
+      array[d] = x;
+      // move forward through list.
+      x = next;
+      numRoots--;
+    }
+    // Set min to null (effectively losing the root list) and reconstruct the root list from the array entries in array[].
+    minimum = null;
+    // loop nodes in array
+    for (var i = 0; i < arraySize; i++) {
+      // get current node
+      y = array[i];
+      if (!y) {
+        continue;
+      }
+      // check if we have a linked list
+      if (minimum) {
+        // First remove node from root list.
+        y.left.right = y.right;
+        y.right.left = y.left;
+        // now add to root list, again.
+        y.left = minimum;
+        y.right = minimum.right;
+        minimum.right = y;
+        y.right.left = y;
+        // check if this is a new min.
+        if (smaller(y.key, minimum.key)) {
+          minimum = y;
+        }
+      } else {
+        minimum = y;
+      }
+    }
+    return minimum;
+  }
+  return FibonacciHeap;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js
new file mode 100644
index 0000000..d12b9bf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/ImmutableDenseMatrix.js
@@ -0,0 +1,221 @@
+import { isArray, isMatrix, isString, typeOf } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { factory } from '../../utils/factory.js';
+var name = 'ImmutableDenseMatrix';
+var dependencies = ['smaller', 'DenseMatrix'];
+export var createImmutableDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    smaller,
+    DenseMatrix
+  } = _ref;
+  function ImmutableDenseMatrix(data, datatype) {
+    if (!(this instanceof ImmutableDenseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if (isMatrix(data) || isArray(data)) {
+      // use DenseMatrix implementation
+      var matrix = new DenseMatrix(data, datatype);
+      // internal structures
+      this._data = matrix._data;
+      this._size = matrix._size;
+      this._datatype = matrix._datatype;
+      this._min = null;
+      this._max = null;
+    } else if (data && isArray(data.data) && isArray(data.size)) {
+      // initialize fields from JSON representation
+      this._data = data.data;
+      this._size = data.size;
+      this._datatype = data.datatype;
+      this._min = typeof data.min !== 'undefined' ? data.min : null;
+      this._max = typeof data.max !== 'undefined' ? data.max : null;
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._data = [];
+      this._size = [0];
+      this._datatype = datatype;
+      this._min = null;
+      this._max = null;
+    }
+  }
+  ImmutableDenseMatrix.prototype = new DenseMatrix();
+
+  /**
+   * Attach type information
+   */
+  ImmutableDenseMatrix.prototype.type = 'ImmutableDenseMatrix';
+  ImmutableDenseMatrix.prototype.isImmutableDenseMatrix = true;
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | ImmutableDenseMatrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  ImmutableDenseMatrix.prototype.subset = function (index) {
+    switch (arguments.length) {
+      case 1:
+        {
+          // use base implementation
+          var m = DenseMatrix.prototype.subset.call(this, index);
+          // check result is a matrix
+          if (isMatrix(m)) {
+            // return immutable matrix
+            return new ImmutableDenseMatrix({
+              data: m._data,
+              size: m._size,
+              datatype: m._datatype
+            });
+          }
+          return m;
+        }
+      // intentional fall through
+      case 2:
+      case 3:
+        throw new Error('Cannot invoke set subset on an Immutable Matrix instance');
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @param {Number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {ImmutableDenseMatrix} self
+   */
+  ImmutableDenseMatrix.prototype.set = function () {
+    throw new Error('Cannot invoke set on an Immutable Matrix instance');
+  };
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {Number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  ImmutableDenseMatrix.prototype.resize = function () {
+    throw new Error('Cannot invoke resize on an Immutable Matrix instance');
+  };
+
+  /**
+   * Disallows reshaping in favor of immutability.
+   *
+   * @throws {Error} Operation not allowed
+   */
+  ImmutableDenseMatrix.prototype.reshape = function () {
+    throw new Error('Cannot invoke reshape on an Immutable Matrix instance');
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @return {ImmutableDenseMatrix} clone
+   */
+  ImmutableDenseMatrix.prototype.clone = function () {
+    return new ImmutableDenseMatrix({
+      data: clone(this._data),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @returns {Object}
+   */
+  ImmutableDenseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'ImmutableDenseMatrix',
+      data: this._data,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "ImmutableDenseMatrix", data: [], size: []}`,
+   *                       where mathjs is optional
+   * @returns {ImmutableDenseMatrix}
+   */
+  ImmutableDenseMatrix.fromJSON = function (json) {
+    return new ImmutableDenseMatrix(json);
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @param {Number} i       Matrix row index 1
+   * @param {Number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  ImmutableDenseMatrix.prototype.swapRows = function () {
+    throw new Error('Cannot invoke swapRows on an Immutable Matrix instance');
+  };
+
+  /**
+   * Calculate the minimum value in the set
+   * @return {Number | undefined} min
+   */
+  ImmutableDenseMatrix.prototype.min = function () {
+    // check min has been calculated before
+    if (this._min === null) {
+      // minimum
+      var m = null;
+      // compute min
+      this.forEach(function (v) {
+        if (m === null || smaller(v, m)) {
+          m = v;
+        }
+      });
+      this._min = m !== null ? m : undefined;
+    }
+    return this._min;
+  };
+
+  /**
+   * Calculate the maximum value in the set
+   * @return {Number | undefined} max
+   */
+  ImmutableDenseMatrix.prototype.max = function () {
+    // check max has been calculated before
+    if (this._max === null) {
+      // maximum
+      var m = null;
+      // compute max
+      this.forEach(function (v) {
+        if (m === null || smaller(m, v)) {
+          m = v;
+        }
+      });
+      this._max = m !== null ? m : undefined;
+    }
+    return this._max;
+  };
+  return ImmutableDenseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Matrix.js b/node_modules/mathjs/lib/esm/type/matrix/Matrix.js
new file mode 100644
index 0000000..055b4c9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Matrix.js
@@ -0,0 +1,242 @@
+import { factory } from '../../utils/factory.js';
+var name = 'Matrix';
+var dependencies = [];
+export var createMatrixClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * @constructor Matrix
+   *
+   * A Matrix is a wrapper around an Array. A matrix can hold a multi dimensional
+   * array. A matrix can be constructed as:
+   *
+   *     let matrix = math.matrix(data)
+   *
+   * Matrix contains the functions to resize, get and set values, get the size,
+   * clone the matrix and to convert the matrix to a vector, array, or scalar.
+   * Furthermore, one can iterate over the matrix using map and forEach.
+   * The internal Array of the Matrix can be accessed using the function valueOf.
+   *
+   * Example usage:
+   *
+   *     let matrix = math.matrix([[1, 2], [3, 4]])
+   *     matix.size()              // [2, 2]
+   *     matrix.resize([3, 2], 5)
+   *     matrix.valueOf()          // [[1, 2], [3, 4], [5, 5]]
+   *     matrix.subset([1,2])       // 3 (indexes are zero-based)
+   *
+   */
+  function Matrix() {
+    if (!(this instanceof Matrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Matrix.prototype.type = 'Matrix';
+  Matrix.prototype.isMatrix = true;
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @return {string}           The storage format.
+   */
+  Matrix.prototype.storage = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke storage on a Matrix interface');
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @return {string}           The datatype.
+   */
+  Matrix.prototype.datatype = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke datatype on a Matrix interface');
+  };
+
+  /**
+   * Create a new Matrix With the type of the current matrix instance
+   * @param {Array | Object} data
+   * @param {string} [datatype]
+   */
+  Matrix.prototype.create = function (data, datatype) {
+    throw new Error('Cannot invoke create on a Matrix interface');
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  Matrix.prototype.subset = function (index, replacement, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke subset on a Matrix interface');
+  };
+
+  /**
+   * Get a single element from the matrix.
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  Matrix.prototype.get = function (index) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke get on a Matrix interface');
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @param {number[]} index   Zero-based index
+   * @param {*} value
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be left undefined.
+   * @return {Matrix} self
+   */
+  Matrix.prototype.set = function (index, value, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke set on a Matrix interface');
+  };
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  Matrix.prototype.resize = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke resize on a Matrix interface');
+  };
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * @param {number[]} size           The new size the matrix should have.
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  Matrix.prototype.reshape = function (size, defaultValue) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke reshape on a Matrix interface');
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @return {Matrix} clone
+   */
+  Matrix.prototype.clone = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke clone on a Matrix interface');
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @returns {number[]} size
+   */
+  Matrix.prototype.size = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke size on a Matrix interface');
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {Matrix} matrix
+   */
+  Matrix.prototype.map = function (callback, skipZeros) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke map on a Matrix interface');
+  };
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   */
+  Matrix.prototype.forEach = function (callback) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke forEach on a Matrix interface');
+  };
+
+  /**
+   * Iterate over the matrix elements
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  Matrix.prototype[Symbol.iterator] = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot iterate a Matrix interface');
+  };
+
+  /**
+   * Create an Array with a copy of the data of the Matrix
+   * @returns {Array} array
+   */
+  Matrix.prototype.toArray = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toArray on a Matrix interface');
+  };
+
+  /**
+   * Get the primitive value of the Matrix: a multidimensional array
+   * @returns {Array} array
+   */
+  Matrix.prototype.valueOf = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke valueOf on a Matrix interface');
+  };
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  Matrix.prototype.format = function (options) {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke format on a Matrix interface');
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @returns {string} str
+   */
+  Matrix.prototype.toString = function () {
+    // must be implemented by each of the Matrix implementations
+    throw new Error('Cannot invoke toString on a Matrix interface');
+  };
+  return Matrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js b/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js
new file mode 100644
index 0000000..ee33423
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/MatrixIndex.js
@@ -0,0 +1,304 @@
+import { isArray, isMatrix, isRange } from '../../utils/is.js';
+import { clone } from '../../utils/object.js';
+import { isInteger } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Index';
+var dependencies = ['ImmutableDenseMatrix', 'getMatrixDataType'];
+export var createIndexClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    ImmutableDenseMatrix,
+    getMatrixDataType
+  } = _ref;
+  /**
+   * Create an index. An Index can store ranges and sets for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Usage:
+   *     const index = new Index(range1, range2, matrix1, array1, ...)
+   *
+   * Where each parameter can be any of:
+   *     A number
+   *     A string (containing a name of an object property)
+   *     An instance of Range
+   *     An Array with the Set values
+   *     An Array with Booleans
+   *     A Matrix with the Set values
+   *     A Matrix with Booleans
+   *
+   * The parameters start, end, and step must be integer numbers.
+   *
+   * @class Index
+   * @Constructor Index
+   * @param {...*} ranges
+   */
+  function Index(ranges) {
+    if (!(this instanceof Index)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    this._dimensions = [];
+    this._sourceSize = [];
+    this._isScalar = true;
+    for (var i = 0, ii = arguments.length; i < ii; i++) {
+      var arg = arguments[i];
+      var argIsArray = isArray(arg);
+      var argIsMatrix = isMatrix(arg);
+      var argType = typeof arg;
+      var sourceSize = null;
+      if (isRange(arg)) {
+        this._dimensions.push(arg);
+        this._isScalar = false;
+      } else if (argIsArray || argIsMatrix) {
+        // create matrix
+        var m = void 0;
+        if (getMatrixDataType(arg) === 'boolean') {
+          if (argIsArray) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg).valueOf());
+          if (argIsMatrix) m = _createImmutableMatrix(_booleansArrayToNumbersForIndex(arg._data).valueOf());
+          sourceSize = arg.valueOf().length;
+        } else {
+          m = _createImmutableMatrix(arg.valueOf());
+        }
+        this._dimensions.push(m);
+        // size
+        var size = m.size();
+        // scalar
+        if (size.length !== 1 || size[0] !== 1 || sourceSize !== null) {
+          this._isScalar = false;
+        }
+      } else if (argType === 'number') {
+        this._dimensions.push(_createImmutableMatrix([arg]));
+      } else if (argType === 'bigint') {
+        this._dimensions.push(_createImmutableMatrix([Number(arg)]));
+      } else if (argType === 'string') {
+        // object property (arguments.count should be 1)
+        this._dimensions.push(arg);
+      } else {
+        throw new TypeError('Dimension must be an Array, Matrix, number, bigint, string, or Range');
+      }
+      this._sourceSize.push(sourceSize);
+      // TODO: implement support for wildcard '*'
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Index.prototype.type = 'Index';
+  Index.prototype.isIndex = true;
+  function _createImmutableMatrix(arg) {
+    // loop array elements
+    for (var i = 0, l = arg.length; i < l; i++) {
+      if (typeof arg[i] !== 'number' || !isInteger(arg[i])) {
+        throw new TypeError('Index parameters must be positive integer numbers');
+      }
+    }
+    // create matrix
+    return new ImmutableDenseMatrix(arg);
+  }
+
+  /**
+   * Create a clone of the index
+   * @memberof Index
+   * @return {Index} clone
+   */
+  Index.prototype.clone = function () {
+    var index = new Index();
+    index._dimensions = clone(this._dimensions);
+    index._isScalar = this._isScalar;
+    index._sourceSize = this._sourceSize;
+    return index;
+  };
+
+  /**
+   * Create an index from an array with ranges/numbers
+   * @memberof Index
+   * @param {Array.<Array | number>} ranges
+   * @return {Index} index
+   * @private
+   */
+  Index.create = function (ranges) {
+    var index = new Index();
+    Index.apply(index, ranges);
+    return index;
+  };
+
+  /**
+   * Retrieve the size of the index, the number of elements for each dimension.
+   * @memberof Index
+   * @returns {number[]} size
+   */
+  Index.prototype.size = function () {
+    var size = [];
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var d = this._dimensions[i];
+      size[i] = typeof d === 'string' ? 1 : d.size()[0];
+    }
+    return size;
+  };
+
+  /**
+   * Get the maximum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} max
+   */
+  Index.prototype.max = function () {
+    var values = [];
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.max();
+    }
+    return values;
+  };
+
+  /**
+   * Get the minimum value for each of the indexes ranges.
+   * @memberof Index
+   * @returns {number[]} min
+   */
+  Index.prototype.min = function () {
+    var values = [];
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var range = this._dimensions[i];
+      values[i] = typeof range === 'string' ? range : range.min();
+    }
+    return values;
+  };
+
+  /**
+   * Loop over each of the ranges of the index
+   * @memberof Index
+   * @param {Function} callback   Called for each range with a Range as first
+   *                              argument, the dimension as second, and the
+   *                              index object as third.
+   */
+  Index.prototype.forEach = function (callback) {
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      callback(this._dimensions[i], i, this);
+    }
+  };
+
+  /**
+   * Retrieve the dimension for the given index
+   * @memberof Index
+   * @param {Number} dim                  Number of the dimension
+   * @returns {Range | null} range
+   */
+  Index.prototype.dimension = function (dim) {
+    if (typeof dim !== 'number') {
+      return null;
+    }
+    return this._dimensions[dim] || null;
+  };
+
+  /**
+   * Test whether this index contains an object property
+   * @returns {boolean} Returns true if the index is an object property
+   */
+  Index.prototype.isObjectProperty = function () {
+    return this._dimensions.length === 1 && typeof this._dimensions[0] === 'string';
+  };
+
+  /**
+   * Returns the object property name when the Index holds a single object property,
+   * else returns null
+   * @returns {string | null}
+   */
+  Index.prototype.getObjectProperty = function () {
+    return this.isObjectProperty() ? this._dimensions[0] : null;
+  };
+
+  /**
+   * Test whether this index contains only a single value.
+   *
+   * This is the case when the index is created with only scalar values as ranges,
+   * not for ranges resolving into a single value.
+   * @memberof Index
+   * @return {boolean} isScalar
+   */
+  Index.prototype.isScalar = function () {
+    return this._isScalar;
+  };
+
+  /**
+   * Expand the Index into an array.
+   * For example new Index([0,3], [2,7]) returns [[0,1,2], [2,3,4,5,6]]
+   * @memberof Index
+   * @returns {Array} array
+   */
+  Index.prototype.toArray = function () {
+    var array = [];
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+      array.push(typeof dimension === 'string' ? dimension : dimension.toArray());
+    }
+    return array;
+  };
+
+  /**
+   * Get the primitive value of the Index, a two dimensional array.
+   * Equivalent to Index.toArray().
+   * @memberof Index
+   * @returns {Array} array
+   */
+  Index.prototype.valueOf = Index.prototype.toArray;
+
+  /**
+   * Get the string representation of the index, for example '[2:6]' or '[0:2:10, 4:7, [1,2,3]]'
+   * @memberof Index
+   * @returns {String} str
+   */
+  Index.prototype.toString = function () {
+    var strings = [];
+    for (var i = 0, ii = this._dimensions.length; i < ii; i++) {
+      var dimension = this._dimensions[i];
+      if (typeof dimension === 'string') {
+        strings.push(JSON.stringify(dimension));
+      } else {
+        strings.push(dimension.toString());
+      }
+    }
+    return '[' + strings.join(', ') + ']';
+  };
+
+  /**
+   * Get a JSON representation of the Index
+   * @memberof Index
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Index", "ranges": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   */
+  Index.prototype.toJSON = function () {
+    return {
+      mathjs: 'Index',
+      dimensions: this._dimensions
+    };
+  };
+
+  /**
+   * Instantiate an Index from a JSON object
+   * @memberof Index
+   * @param {Object} json A JSON object structured as:
+   *                     `{"mathjs": "Index", "dimensions": [{"mathjs": "Range", start: 0, end: 10, step:1}, ...]}`
+   * @return {Index}
+   */
+  Index.fromJSON = function (json) {
+    return Index.create(json.dimensions);
+  };
+  return Index;
+}, {
+  isClass: true
+});
+
+/**
+ * Receives an array of booleans and returns an array of Numbers for Index
+ * @param {Array} booleanArrayIndex An array of booleans
+ * @return {Array} A set of numbers ready for index
+ */
+function _booleansArrayToNumbersForIndex(booleanArrayIndex) {
+  // gets an array of booleans and returns an array of numbers
+  var indexOfNumbers = [];
+  booleanArrayIndex.forEach((bool, idx) => {
+    if (bool) {
+      indexOfNumbers.push(idx);
+    }
+  });
+  return indexOfNumbers;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Range.js b/node_modules/mathjs/lib/esm/type/matrix/Range.js
new file mode 100644
index 0000000..1d12447
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Range.js
@@ -0,0 +1,314 @@
+import { isBigInt, isBigNumber } from '../../utils/is.js';
+import { format, sign, nearlyEqual } from '../../utils/number.js';
+import { factory } from '../../utils/factory.js';
+var name = 'Range';
+var dependencies = [];
+export var createRangeClass = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * Create a range of numbers. A range has a start, step, and end,
+   * and contains functions to iterate over the range.
+   *
+   * A range can be constructed as:
+   *
+   *     const range = new Range(start, end)
+   *     const range = new Range(start, end, step)
+   *
+   * Note that the endpoints and step may be specified with other numeric
+   * types such as bigint or BigNumber, but they will be demoted to the
+   * built-in `number` type and the Range will only contain numbers. The
+   * rationale for this demotion is that Range objects are primarily used
+   * for indexing Matrix objects, and Matrix objects may only be indexed
+   * with `number`s.
+   *
+   * To get the result of the range:
+   *     range.forEach(function (x) {
+   *         console.log(x)
+   *     })
+   *     range.map(function (x) {
+   *         return math.sin(x)
+   *     })
+   *     range.toArray()
+   *
+   * Example usage:
+   *
+   *     const c = new Range(2, 6)       // 2:1:5
+   *     c.toArray()                     // [2, 3, 4, 5]
+   *     const d = new Range(2, -3, -1)  // 2:-1:-2
+   *     d.toArray()                     // [2, 1, 0, -1, -2]
+   *
+   * @class Range
+   * @constructor Range
+   * @param {number} start  included lower bound
+   * @param {number} end    excluded upper bound
+   * @param {number} [step] step size, default value is 1
+   */
+  function Range(start, end, step) {
+    if (!(this instanceof Range)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    var hasStart = start !== null && start !== undefined;
+    var hasEnd = end !== null && end !== undefined;
+    var hasStep = step !== null && step !== undefined;
+    if (hasStart) {
+      if (isBigNumber(start)) {
+        start = start.toNumber();
+      } else if (typeof start !== 'number' && !isBigInt(start)) {
+        throw new TypeError('Parameter start must be a number or bigint');
+      }
+    }
+    if (hasEnd) {
+      if (isBigNumber(end)) {
+        end = end.toNumber();
+      } else if (typeof end !== 'number' && !isBigInt(end)) {
+        throw new TypeError('Parameter end must be a number or bigint');
+      }
+    }
+    if (hasStep) {
+      if (isBigNumber(step)) {
+        step = step.toNumber();
+      } else if (typeof step !== 'number' && !isBigInt(step)) {
+        throw new TypeError('Parameter step must be a number or bigint');
+      }
+    }
+    this.start = hasStart ? parseFloat(start) : 0;
+    this.end = hasEnd ? parseFloat(end) : 0;
+    this.step = hasStep ? parseFloat(step) : 1;
+    if (hasStep && nearlyEqual(this.step, 0)) {
+      throw new Error('Step must not be zero');
+    }
+  }
+
+  /**
+   * Attach type information
+   */
+  Range.prototype.type = 'Range';
+  Range.prototype.isRange = true;
+
+  /**
+   * Parse a string into a range,
+   * The string contains the start, optional step, and end, separated by a colon.
+   * If the string does not contain a valid range, null is returned.
+   * For example str='0:2:11'.
+   * @memberof Range
+   * @param {string} str
+   * @return {Range | null} range
+   */
+  Range.parse = function (str) {
+    if (typeof str !== 'string') {
+      return null;
+    }
+    var args = str.split(':');
+    var nums = args.map(function (arg) {
+      return parseFloat(arg);
+    });
+    var invalid = nums.some(function (num) {
+      return isNaN(num);
+    });
+    if (invalid) {
+      return null;
+    }
+    switch (nums.length) {
+      case 2:
+        return new Range(nums[0], nums[1]);
+      case 3:
+        return new Range(nums[0], nums[2], nums[1]);
+      default:
+        return null;
+    }
+  };
+
+  /**
+   * Create a clone of the range
+   * @return {Range} clone
+   */
+  Range.prototype.clone = function () {
+    return new Range(this.start, this.end, this.step);
+  };
+
+  /**
+   * Retrieve the size of the range.
+   * Returns an array containing one number, the number of elements in the range.
+   * @memberof Range
+   * @returns {number[]} size
+   */
+  Range.prototype.size = function () {
+    var len = 0;
+    var start = this.start;
+    var step = this.step;
+    var end = this.end;
+    var diff = end - start;
+    if (sign(step) === sign(diff)) {
+      len = Math.ceil(diff / step);
+    } else if (diff === 0) {
+      len = 0;
+    }
+    if (isNaN(len)) {
+      len = 0;
+    }
+    return [len];
+  };
+
+  /**
+   * Calculate the minimum value in the range
+   * @memberof Range
+   * @return {number | undefined} min
+   */
+  Range.prototype.min = function () {
+    var size = this.size()[0];
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start;
+      } else {
+        // negative step
+        return this.start + (size - 1) * this.step;
+      }
+    } else {
+      return undefined;
+    }
+  };
+
+  /**
+   * Calculate the maximum value in the range
+   * @memberof Range
+   * @return {number | undefined} max
+   */
+  Range.prototype.max = function () {
+    var size = this.size()[0];
+    if (size > 0) {
+      if (this.step > 0) {
+        // positive step
+        return this.start + (size - 1) * this.step;
+      } else {
+        // negative step
+        return this.start;
+      }
+    } else {
+      return undefined;
+    }
+  };
+
+  /**
+   * Execute a callback function for each value in the range.
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Range being traversed.
+   */
+  Range.prototype.forEach = function (callback) {
+    var x = this.start;
+    var step = this.step;
+    var end = this.end;
+    var i = 0;
+    if (step > 0) {
+      while (x < end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    } else if (step < 0) {
+      while (x > end) {
+        callback(x, [i], this);
+        x += step;
+        i++;
+      }
+    }
+  };
+
+  /**
+   * Execute a callback function for each value in the Range, and return the
+   * results as an array
+   * @memberof Range
+   * @param {function} callback   The callback method is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @returns {Array} array
+   */
+  Range.prototype.map = function (callback) {
+    var array = [];
+    this.forEach(function (value, index, obj) {
+      array[index[0]] = callback(value, index, obj);
+    });
+    return array;
+  };
+
+  /**
+   * Create an Array with a copy of the Ranges data
+   * @memberof Range
+   * @returns {Array} array
+   */
+  Range.prototype.toArray = function () {
+    var array = [];
+    this.forEach(function (value, index) {
+      array[index[0]] = value;
+    });
+    return array;
+  };
+
+  /**
+   * Get the primitive value of the Range, a one dimensional array
+   * @memberof Range
+   * @returns {Array} array
+   */
+  Range.prototype.valueOf = function () {
+    // TODO: implement a caching mechanism for range.valueOf()
+    return this.toArray();
+  };
+
+  /**
+   * Get a string representation of the range, with optional formatting options.
+   * Output is formatted as 'start:step:end', for example '2:6' or '0:0.2:11'
+   * @memberof Range
+   * @param {Object | number | function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  Range.prototype.format = function (options) {
+    var str = format(this.start, options);
+    if (this.step !== 1) {
+      str += ':' + format(this.step, options);
+    }
+    str += ':' + format(this.end, options);
+    return str;
+  };
+
+  /**
+   * Get a string representation of the range.
+   * @memberof Range
+   * @returns {string}
+   */
+  Range.prototype.toString = function () {
+    return this.format();
+  };
+
+  /**
+   * Get a JSON representation of the range
+   * @memberof Range
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   */
+  Range.prototype.toJSON = function () {
+    return {
+      mathjs: 'Range',
+      start: this.start,
+      end: this.end,
+      step: this.step
+    };
+  };
+
+  /**
+   * Instantiate a Range from a JSON object
+   * @memberof Range
+   * @param {Object} json A JSON object structured as:
+   *                      `{"mathjs": "Range", "start": 2, "end": 4, "step": 1}`
+   * @return {Range}
+   */
+  Range.fromJSON = function (json) {
+    return new Range(json.start, json.end, json.step);
+  };
+  return Range;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/Spa.js b/node_modules/mathjs/lib/esm/type/matrix/Spa.js
new file mode 100644
index 0000000..20f2750
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/Spa.js
@@ -0,0 +1,136 @@
+import { factory } from '../../utils/factory.js';
+var name = 'Spa';
+var dependencies = ['addScalar', 'equalScalar', 'FibonacciHeap'];
+export var createSpaClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    addScalar,
+    equalScalar,
+    FibonacciHeap
+  } = _ref;
+  /**
+   * An ordered Sparse Accumulator is a representation for a sparse vector that includes a dense array
+   * of the vector elements and an ordered list of non-zero elements.
+   */
+  function Spa() {
+    if (!(this instanceof Spa)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+
+    // allocate vector, TODO use typed arrays
+    this._values = [];
+    this._heap = new FibonacciHeap();
+  }
+
+  /**
+   * Attach type information
+   */
+  Spa.prototype.type = 'Spa';
+  Spa.prototype.isSpa = true;
+
+  /**
+   * Set the value for index i.
+   *
+   * @param {number} i                       The index
+   * @param {number | BigNumber | Complex}   The value at index i
+   */
+  Spa.prototype.set = function (i, v) {
+    // check we have a value @ i
+    if (!this._values[i]) {
+      // insert in heap
+      var node = this._heap.insert(i, v);
+      // set the value @ i
+      this._values[i] = node;
+    } else {
+      // update the value @ i
+      this._values[i].value = v;
+    }
+  };
+  Spa.prototype.get = function (i) {
+    var node = this._values[i];
+    if (node) {
+      return node.value;
+    }
+    return 0;
+  };
+  Spa.prototype.accumulate = function (i, v) {
+    // node @ i
+    var node = this._values[i];
+    if (!node) {
+      // insert in heap
+      node = this._heap.insert(i, v);
+      // initialize value
+      this._values[i] = node;
+    } else {
+      // accumulate value
+      node.value = addScalar(node.value, v);
+    }
+  };
+  Spa.prototype.forEach = function (from, to, callback) {
+    // references
+    var heap = this._heap;
+    var values = this._values;
+    // nodes
+    var nodes = [];
+    // node with minimum key, save it
+    var node = heap.extractMinimum();
+    if (node) {
+      nodes.push(node);
+    }
+    // extract nodes from heap (ordered)
+    while (node && node.key <= to) {
+      // check it is in range
+      if (node.key >= from) {
+        // check value is not zero
+        if (!equalScalar(node.value, 0)) {
+          // invoke callback
+          callback(node.key, node.value, this);
+        }
+      }
+      // extract next node, save it
+      node = heap.extractMinimum();
+      if (node) {
+        nodes.push(node);
+      }
+    }
+    // reinsert all nodes in heap
+    for (var i = 0; i < nodes.length; i++) {
+      // current node
+      var n = nodes[i];
+      // insert node in heap
+      node = heap.insert(n.key, n.value);
+      // update values
+      values[node.key] = node;
+    }
+  };
+  Spa.prototype.swap = function (i, j) {
+    // node @ i and j
+    var nodei = this._values[i];
+    var nodej = this._values[j];
+    // check we need to insert indeces
+    if (!nodei && nodej) {
+      // insert in heap
+      nodei = this._heap.insert(i, nodej.value);
+      // remove from heap
+      this._heap.remove(nodej);
+      // set values
+      this._values[i] = nodei;
+      this._values[j] = undefined;
+    } else if (nodei && !nodej) {
+      // insert in heap
+      nodej = this._heap.insert(j, nodei.value);
+      // remove from heap
+      this._heap.remove(nodei);
+      // set values
+      this._values[j] = nodej;
+      this._values[i] = undefined;
+    } else if (nodei && nodej) {
+      // swap values
+      var v = nodei.value;
+      nodei.value = nodej.value;
+      nodej.value = v;
+    }
+  };
+  return Spa;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js b/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js
new file mode 100644
index 0000000..6011996
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js
@@ -0,0 +1,1487 @@
+import { isArray, isBigNumber, isCollection, isIndex, isMatrix, isNumber, isString, typeOf } from '../../utils/is.js';
+import { isInteger } from '../../utils/number.js';
+import { format } from '../../utils/string.js';
+import { clone, deepStrictEqual } from '../../utils/object.js';
+import { arraySize, getArrayDataType, processSizesWildcard, unsqueeze, validateIndex } from '../../utils/array.js';
+import { factory } from '../../utils/factory.js';
+import { DimensionError } from '../../error/DimensionError.js';
+import { optimizeCallback } from '../../utils/optimizeCallback.js';
+var name = 'SparseMatrix';
+var dependencies = ['typed', 'equalScalar', 'Matrix'];
+export var createSparseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar,
+    Matrix
+  } = _ref;
+  /**
+   * Sparse Matrix implementation. This type implements
+   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))
+   * format for two-dimensional sparse matrices.
+   * @class SparseMatrix
+   */
+  function SparseMatrix(data, datatype) {
+    if (!(this instanceof SparseMatrix)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    if (datatype && !isString(datatype)) {
+      throw new Error('Invalid datatype: ' + datatype);
+    }
+    if (isMatrix(data)) {
+      // create from matrix
+      _createFromMatrix(this, data, datatype);
+    } else if (data && isArray(data.index) && isArray(data.ptr) && isArray(data.size)) {
+      // initialize fields
+      this._values = data.values;
+      this._index = data.index;
+      this._ptr = data.ptr;
+      this._size = data.size;
+      this._datatype = datatype || data.datatype;
+    } else if (isArray(data)) {
+      // create from array
+      _createFromArray(this, data, datatype);
+    } else if (data) {
+      // unsupported type
+      throw new TypeError('Unsupported type of data (' + typeOf(data) + ')');
+    } else {
+      // nothing provided
+      this._values = [];
+      this._index = [];
+      this._ptr = [0];
+      this._size = [0, 0];
+      this._datatype = datatype;
+    }
+  }
+  function _createFromMatrix(matrix, source, datatype) {
+    // check matrix type
+    if (source.type === 'SparseMatrix') {
+      // clone arrays
+      matrix._values = source._values ? clone(source._values) : undefined;
+      matrix._index = clone(source._index);
+      matrix._ptr = clone(source._ptr);
+      matrix._size = clone(source._size);
+      matrix._datatype = datatype || source._datatype;
+    } else {
+      // build from matrix data
+      _createFromArray(matrix, source.valueOf(), datatype || source._datatype);
+    }
+  }
+  function _createFromArray(matrix, data, datatype) {
+    // initialize fields
+    matrix._values = [];
+    matrix._index = [];
+    matrix._ptr = [];
+    matrix._datatype = datatype;
+    // discover rows & columns, do not use math.size() to avoid looping array twice
+    var rows = data.length;
+    var columns = 0;
+
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    if (isString(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, datatype);
+    }
+
+    // check we have rows (empty array)
+    if (rows > 0) {
+      // column index
+      var j = 0;
+      do {
+        // store pointer to values index
+        matrix._ptr.push(matrix._index.length);
+        // loop rows
+        for (var i = 0; i < rows; i++) {
+          // current row
+          var row = data[i];
+          // check row is an array
+          if (isArray(row)) {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < row.length) {
+              columns = row.length;
+            }
+            // check row has column
+            if (j < row.length) {
+              // value
+              var v = row[j];
+              // check value != 0
+              if (!eq(v, zero)) {
+                // store value
+                matrix._values.push(v);
+                // index
+                matrix._index.push(i);
+              }
+            }
+          } else {
+            // update columns if needed (only on first column)
+            if (j === 0 && columns < 1) {
+              columns = 1;
+            }
+            // check value != 0 (row is a scalar)
+            if (!eq(row, zero)) {
+              // store value
+              matrix._values.push(row);
+              // index
+              matrix._index.push(i);
+            }
+          }
+        }
+        // increment index
+        j++;
+      } while (j < columns);
+    }
+    // store number of values in ptr
+    matrix._ptr.push(matrix._index.length);
+    // size
+    matrix._size = [rows, columns];
+  }
+  SparseMatrix.prototype = new Matrix();
+
+  /**
+   * Create a new SparseMatrix
+   */
+  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(SparseMatrix, 'name', {
+    value: 'SparseMatrix'
+  });
+  SparseMatrix.prototype.constructor = SparseMatrix;
+  SparseMatrix.prototype.type = 'SparseMatrix';
+  SparseMatrix.prototype.isSparseMatrix = true;
+
+  /**
+   * Get the matrix type
+   *
+   * Usage:
+   *    const matrixType = matrix.getDataType()  // retrieves the matrix type
+   *
+   * @memberOf SparseMatrix
+   * @return {string}   type information; if multiple types are found from the Matrix, it will return "mixed"
+   */
+  SparseMatrix.prototype.getDataType = function () {
+    return getArrayDataType(this._values, typeOf);
+  };
+
+  /**
+   * Get the storage format used by the matrix.
+   *
+   * Usage:
+   *     const format = matrix.storage()   // retrieve storage format
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The storage format.
+   */
+  SparseMatrix.prototype.storage = function () {
+    return 'sparse';
+  };
+
+  /**
+   * Get the datatype of the data stored in the matrix.
+   *
+   * Usage:
+   *     const format = matrix.datatype()    // retrieve matrix datatype
+   *
+   * @memberof SparseMatrix
+   * @return {string}           The datatype.
+   */
+  SparseMatrix.prototype.datatype = function () {
+    return this._datatype;
+  };
+
+  /**
+   * Create a new SparseMatrix
+   * @memberof SparseMatrix
+   * @param {Array} data
+   * @param {string} [datatype]
+   */
+  SparseMatrix.prototype.create = function (data, datatype) {
+    return new SparseMatrix(data, datatype);
+  };
+
+  /**
+   * Get the matrix density.
+   *
+   * Usage:
+   *     const density = matrix.density()                   // retrieve matrix density
+   *
+   * @memberof SparseMatrix
+   * @return {number}           The matrix density.
+   */
+  SparseMatrix.prototype.density = function () {
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+    // calculate density
+    return rows !== 0 && columns !== 0 ? this._index.length / (rows * columns) : 0;
+  };
+
+  /**
+   * Get a subset of the matrix, or replace a subset of the matrix.
+   *
+   * Usage:
+   *     const subset = matrix.subset(index)               // retrieve subset
+   *     const value = matrix.subset(index, replacement)   // replace subset
+   *
+   * @memberof SparseMatrix
+   * @param {Index} index
+   * @param {Array | Matrix | *} [replacement]
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be filled with zeros.
+   */
+  SparseMatrix.prototype.subset = function (index, replacement, defaultValue) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke subset on a Pattern only matrix');
+    }
+
+    // check arguments
+    switch (arguments.length) {
+      case 1:
+        return _getsubset(this, index);
+
+      // intentional fall through
+      case 2:
+      case 3:
+        return _setsubset(this, index, replacement, defaultValue);
+      default:
+        throw new SyntaxError('Wrong number of arguments');
+    }
+  };
+  function _getsubset(matrix, idx) {
+    // check idx
+    if (!isIndex(idx)) {
+      throw new TypeError('Invalid index');
+    }
+    var isScalar = idx.isScalar();
+    if (isScalar) {
+      // return a scalar
+      return matrix.get(idx.min());
+    }
+    // validate dimensions
+    var size = idx.size();
+    if (size.length !== matrix._size.length) {
+      throw new DimensionError(size.length, matrix._size.length);
+    }
+
+    // vars
+    var i, ii, k, kk;
+
+    // validate if any of the ranges in the index is out of range
+    var min = idx.min();
+    var max = idx.max();
+    for (i = 0, ii = matrix._size.length; i < ii; i++) {
+      validateIndex(min[i], matrix._size[i]);
+      validateIndex(max[i], matrix._size[i]);
+    }
+
+    // matrix arrays
+    var mvalues = matrix._values;
+    var mindex = matrix._index;
+    var mptr = matrix._ptr;
+
+    // rows & columns dimensions for result matrix
+    var rows = idx.dimension(0);
+    var columns = idx.dimension(1);
+
+    // workspace & permutation vector
+    var w = [];
+    var pv = [];
+
+    // loop rows in resulting matrix
+    rows.forEach(function (i, r) {
+      // update permutation vector
+      pv[i] = r[0];
+      // mark i in workspace
+      w[i] = true;
+    });
+
+    // result matrix arrays
+    var values = mvalues ? [] : undefined;
+    var index = [];
+    var ptr = [];
+
+    // loop columns in result matrix
+    columns.forEach(function (j) {
+      // update ptr
+      ptr.push(index.length);
+      // loop values in column j
+      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {
+        // row
+        i = mindex[k];
+        // check row is in result matrix
+        if (w[i] === true) {
+          // push index
+          index.push(pv[i]);
+          // check we need to process values
+          if (values) {
+            values.push(mvalues[k]);
+          }
+        }
+      }
+    });
+    // update ptr
+    ptr.push(index.length);
+
+    // return matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size,
+      datatype: matrix._datatype
+    });
+  }
+  function _setsubset(matrix, index, submatrix, defaultValue) {
+    // check index
+    if (!index || index.isIndex !== true) {
+      throw new TypeError('Invalid index');
+    }
+
+    // get index size and check whether the index contains a single value
+    var iSize = index.size();
+    var isScalar = index.isScalar();
+
+    // calculate the size of the submatrix, and convert it into an Array if needed
+    var sSize;
+    if (isMatrix(submatrix)) {
+      // submatrix size
+      sSize = submatrix.size();
+      // use array representation
+      submatrix = submatrix.toArray();
+    } else {
+      // get submatrix size (array, scalar)
+      sSize = arraySize(submatrix);
+    }
+
+    // check index is a scalar
+    if (isScalar) {
+      // verify submatrix is a scalar
+      if (sSize.length !== 0) {
+        throw new TypeError('Scalar expected');
+      }
+      // set value
+      matrix.set(index.min(), submatrix, defaultValue);
+    } else {
+      // validate dimensions, index size must be one or two dimensions
+      if (iSize.length !== 1 && iSize.length !== 2) {
+        throw new DimensionError(iSize.length, matrix._size.length, '<');
+      }
+
+      // check submatrix and index have the same dimensions
+      if (sSize.length < iSize.length) {
+        // calculate number of missing outer dimensions
+        var i = 0;
+        var outer = 0;
+        while (iSize[i] === 1 && sSize[i] === 1) {
+          i++;
+        }
+        while (iSize[i] === 1) {
+          outer++;
+          i++;
+        }
+        // unsqueeze both outer and inner dimensions
+        submatrix = unsqueeze(submatrix, iSize.length, outer, sSize);
+      }
+
+      // check whether the size of the submatrix matches the index size
+      if (!deepStrictEqual(iSize, sSize)) {
+        throw new DimensionError(iSize, sSize, '>');
+      }
+
+      // insert the sub matrix
+      if (iSize.length === 1) {
+        // if the replacement index only has 1 dimension, go trough each one and set its value
+        var range = index.dimension(0);
+        range.forEach(function (dataIndex, subIndex) {
+          validateIndex(dataIndex);
+          matrix.set([dataIndex, 0], submatrix[subIndex[0]], defaultValue);
+        });
+      } else {
+        // if the replacement index has 2 dimensions, go through each one and set the value in the correct index
+        var firstDimensionRange = index.dimension(0);
+        var secondDimensionRange = index.dimension(1);
+        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {
+          validateIndex(firstDataIndex);
+          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {
+            validateIndex(secondDataIndex);
+            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);
+          });
+        });
+      }
+    }
+    return matrix;
+  }
+
+  /**
+   * Get a single element from the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @return {*} value
+   */
+  SparseMatrix.prototype.get = function (index) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length !== this._size.length) {
+      throw new DimensionError(index.length, this._size.length);
+    }
+
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke get on a Pattern only matrix');
+    }
+
+    // row and column
+    var i = index[0];
+    var j = index[1];
+
+    // check i, j are valid
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[1]);
+
+    // find value index
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);
+    // check k is prior to next column k and it is in the correct row
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      return this._values[k];
+    }
+    return 0;
+  };
+
+  /**
+   * Replace a single element in the matrix.
+   * @memberof SparseMatrix
+   * @param {number[]} index   Zero-based index
+   * @param {*} v
+   * @param {*} [defaultValue]        Default value, filled in on new entries when
+   *                                  the matrix is resized. If not provided,
+   *                                  new matrix elements will be set to zero.
+   * @return {SparseMatrix} self
+   */
+  SparseMatrix.prototype.set = function (index, v, defaultValue) {
+    if (!isArray(index)) {
+      throw new TypeError('Array expected');
+    }
+    if (index.length !== this._size.length) {
+      throw new DimensionError(index.length, this._size.length);
+    }
+
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke set on a Pattern only matrix');
+    }
+
+    // row and column
+    var i = index[0];
+    var j = index[1];
+
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    if (isString(this._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [this._datatype, this._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, this._datatype);
+    }
+
+    // check we need to resize matrix
+    if (i > rows - 1 || j > columns - 1) {
+      // resize matrix
+      _resize(this, Math.max(i + 1, rows), Math.max(j + 1, columns), defaultValue);
+      // update rows & columns
+      rows = this._size[0];
+      columns = this._size[1];
+    }
+
+    // check i, j are valid
+    validateIndex(i, rows);
+    validateIndex(j, columns);
+
+    // find value index
+    var k = _getValueIndex(i, this._ptr[j], this._ptr[j + 1], this._index);
+    // check k is prior to next column k and it is in the correct row
+    if (k < this._ptr[j + 1] && this._index[k] === i) {
+      // check value != 0
+      if (!eq(v, zero)) {
+        // update value
+        this._values[k] = v;
+      } else {
+        // remove value from matrix
+        _remove(k, j, this._values, this._index, this._ptr);
+      }
+    } else {
+      if (!eq(v, zero)) {
+        // insert value @ (i, j)
+        _insert(k, i, j, v, this._values, this._index, this._ptr);
+      }
+    }
+    return this;
+  };
+  function _getValueIndex(i, top, bottom, index) {
+    // check row is on the bottom side
+    if (bottom - top === 0) {
+      return bottom;
+    }
+    // loop rows [top, bottom[
+    for (var r = top; r < bottom; r++) {
+      // check we found value index
+      if (index[r] === i) {
+        return r;
+      }
+    }
+    // we did not find row
+    return top;
+  }
+  function _remove(k, j, values, index, ptr) {
+    // remove value @ k
+    values.splice(k, 1);
+    index.splice(k, 1);
+    // update pointers
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]--;
+    }
+  }
+  function _insert(k, i, j, v, values, index, ptr) {
+    // insert value
+    values.splice(k, 0, v);
+    // update row for k
+    index.splice(k, 0, i);
+    // update column pointers
+    for (var x = j + 1; x < ptr.length; x++) {
+      ptr[x]++;
+    }
+  }
+
+  /**
+   * Resize the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (resize in place).
+   *
+   * @memberof SparseMatrix
+   * @param {number[] | Matrix} size  The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {*} [defaultValue=0]      Default value, filled in on new entries.
+   *                                  If not provided, the matrix elements will
+   *                                  be filled with zeros.
+   * @param {boolean} [copy]          Return a resized copy of the matrix
+   *
+   * @return {Matrix}                 The resized matrix
+   */
+  SparseMatrix.prototype.resize = function (size, defaultValue, copy) {
+    // validate arguments
+    if (!isCollection(size)) {
+      throw new TypeError('Array or Matrix expected');
+    }
+
+    // SparseMatrix input is always 2d, flatten this into 1d if it's indeed a vector
+    var sizeArray = size.valueOf().map(value => {
+      return Array.isArray(value) && value.length === 1 ? value[0] : value;
+    });
+    if (sizeArray.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // check sizes
+    sizeArray.forEach(function (value) {
+      if (!isNumber(value) || !isInteger(value) || value < 0) {
+        throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(sizeArray) + ')');
+      }
+    });
+
+    // matrix to resize
+    var m = copy ? this.clone() : this;
+    // resize matrix
+    return _resize(m, sizeArray[0], sizeArray[1], defaultValue);
+  };
+  function _resize(matrix, rows, columns, defaultValue) {
+    // value to insert at the time of growing matrix
+    var value = defaultValue || 0;
+
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    if (isString(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, matrix._datatype);
+      // convert value to the same datatype
+      value = typed.convert(value, matrix._datatype);
+    }
+
+    // should we insert the value?
+    var ins = !eq(value, zero);
+
+    // old columns and rows
+    var r = matrix._size[0];
+    var c = matrix._size[1];
+    var i, j, k;
+
+    // check we need to increase columns
+    if (columns > c) {
+      // loop new columns
+      for (j = c; j < columns; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._values.length;
+        // check we need to insert matrix._values
+        if (ins) {
+          // loop rows
+          for (i = 0; i < r; i++) {
+            // add new matrix._values
+            matrix._values.push(value);
+            // update matrix._index
+            matrix._index.push(i);
+          }
+        }
+      }
+      // store number of matrix._values in matrix._ptr
+      matrix._ptr[columns] = matrix._values.length;
+    } else if (columns < c) {
+      // truncate matrix._ptr
+      matrix._ptr.splice(columns + 1, c - columns);
+      // truncate matrix._values and matrix._index
+      matrix._values.splice(matrix._ptr[columns], matrix._values.length);
+      matrix._index.splice(matrix._ptr[columns], matrix._index.length);
+    }
+    // update columns
+    c = columns;
+
+    // check we need to increase rows
+    if (rows > r) {
+      // check we have to insert values
+      if (ins) {
+        // inserts
+        var n = 0;
+        // loop columns
+        for (j = 0; j < c; j++) {
+          // update matrix._ptr for current column
+          matrix._ptr[j] = matrix._ptr[j] + n;
+          // where to insert matrix._values
+          k = matrix._ptr[j + 1] + n;
+          // pointer
+          var p = 0;
+          // loop new rows, initialize pointer
+          for (i = r; i < rows; i++, p++) {
+            // add value
+            matrix._values.splice(k + p, 0, value);
+            // update matrix._index
+            matrix._index.splice(k + p, 0, i);
+            // increment inserts
+            n++;
+          }
+        }
+        // store number of matrix._values in matrix._ptr
+        matrix._ptr[c] = matrix._values.length;
+      }
+    } else if (rows < r) {
+      // deletes
+      var d = 0;
+      // loop columns
+      for (j = 0; j < c; j++) {
+        // update matrix._ptr for current column
+        matrix._ptr[j] = matrix._ptr[j] - d;
+        // where matrix._values start for next column
+        var k0 = matrix._ptr[j];
+        var k1 = matrix._ptr[j + 1] - d;
+        // loop matrix._index
+        for (k = k0; k < k1; k++) {
+          // row
+          i = matrix._index[k];
+          // check we need to delete value and matrix._index
+          if (i > rows - 1) {
+            // remove value
+            matrix._values.splice(k, 1);
+            // remove item from matrix._index
+            matrix._index.splice(k, 1);
+            // increase deletes
+            d++;
+          }
+        }
+      }
+      // update matrix._ptr for current column
+      matrix._ptr[j] = matrix._values.length;
+    }
+    // update matrix._size
+    matrix._size[0] = rows;
+    matrix._size[1] = columns;
+    // return matrix
+    return matrix;
+  }
+
+  /**
+   * Reshape the matrix to the given size. Returns a copy of the matrix when
+   * `copy=true`, otherwise return the matrix itself (reshape in place).
+   *
+   * NOTE: This might be better suited to copy by default, instead of modifying
+   *       in place. For now, it operates in place to remain consistent with
+   *       resize().
+   *
+   * @memberof SparseMatrix
+   * @param {number[]} sizes          The new size the matrix should have.
+   *                                  Since sparse matrices are always two-dimensional,
+   *                                  size must be two numbers in either an array or a matrix
+   * @param {boolean} [copy]          Return a reshaped copy of the matrix
+   *
+   * @return {Matrix}                 The reshaped matrix
+   */
+  SparseMatrix.prototype.reshape = function (sizes, copy) {
+    // validate arguments
+    if (!isArray(sizes)) {
+      throw new TypeError('Array expected');
+    }
+    if (sizes.length !== 2) {
+      throw new Error('Sparse matrices can only be reshaped in two dimensions');
+    }
+
+    // check sizes
+    sizes.forEach(function (value) {
+      if (!isNumber(value) || !isInteger(value) || value <= -2 || value === 0) {
+        throw new TypeError('Invalid size, must contain positive integers or -1 ' + '(size: ' + format(sizes) + ')');
+      }
+    });
+    var currentLength = this._size[0] * this._size[1];
+    sizes = processSizesWildcard(sizes, currentLength);
+    var newLength = sizes[0] * sizes[1];
+
+    // m * n must not change
+    if (currentLength !== newLength) {
+      throw new Error('Reshaping sparse matrix will result in the wrong number of elements');
+    }
+
+    // matrix to reshape
+    var m = copy ? this.clone() : this;
+
+    // return unchanged if the same shape
+    if (this._size[0] === sizes[0] && this._size[1] === sizes[1]) {
+      return m;
+    }
+
+    // Convert to COO format (generate a column index)
+    var colIndex = [];
+    for (var i = 0; i < m._ptr.length; i++) {
+      for (var j = 0; j < m._ptr[i + 1] - m._ptr[i]; j++) {
+        colIndex.push(i);
+      }
+    }
+
+    // Clone the values array
+    var values = m._values.slice();
+
+    // Clone the row index array
+    var rowIndex = m._index.slice();
+
+    // Transform the (row, column) indices
+    for (var _i = 0; _i < m._index.length; _i++) {
+      var r1 = rowIndex[_i];
+      var c1 = colIndex[_i];
+      var flat = r1 * m._size[1] + c1;
+      colIndex[_i] = flat % sizes[1];
+      rowIndex[_i] = Math.floor(flat / sizes[1]);
+    }
+
+    // Now reshaping is supposed to preserve the row-major order, BUT these sparse matrices are stored
+    // in column-major order, so we have to reorder the value array now. One option is to use a multisort,
+    // sorting several arrays based on some other array.
+
+    // OR, we could easily just:
+
+    // 1. Remove all values from the matrix
+    m._values.length = 0;
+    m._index.length = 0;
+    m._ptr.length = sizes[1] + 1;
+    m._size = sizes.slice();
+    for (var _i2 = 0; _i2 < m._ptr.length; _i2++) {
+      m._ptr[_i2] = 0;
+    }
+
+    // 2. Re-insert all elements in the proper order (simplified code from SparseMatrix.prototype.set)
+    // This step is probably the most time-consuming
+    for (var h = 0; h < values.length; h++) {
+      var _i3 = rowIndex[h];
+      var _j = colIndex[h];
+      var v = values[h];
+      var k = _getValueIndex(_i3, m._ptr[_j], m._ptr[_j + 1], m._index);
+      _insert(k, _i3, _j, v, m._values, m._index, m._ptr);
+    }
+
+    // The value indices are inserted out of order, but apparently that's... still OK?
+
+    return m;
+  };
+
+  /**
+   * Create a clone of the matrix
+   * @memberof SparseMatrix
+   * @return {SparseMatrix} clone
+   */
+  SparseMatrix.prototype.clone = function () {
+    var m = new SparseMatrix({
+      values: this._values ? clone(this._values) : undefined,
+      index: clone(this._index),
+      ptr: clone(this._ptr),
+      size: clone(this._size),
+      datatype: this._datatype
+    });
+    return m;
+  };
+
+  /**
+   * Retrieve the size of the matrix.
+   * @memberof SparseMatrix
+   * @returns {number[]} size
+   */
+  SparseMatrix.prototype.size = function () {
+    return this._size.slice(0); // copy the Array
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on
+   * each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *
+   * @return {SparseMatrix} matrix
+   */
+  SparseMatrix.prototype.map = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke map on a Pattern only matrix');
+    }
+    // matrix instance
+    var me = this;
+    // rows and columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+    var fastCallback = optimizeCallback(callback, me, 'map');
+    // invoke callback
+    var invoke = function invoke(v, i, j) {
+      // invoke callback
+      return fastCallback.fn(v, [i, j], me);
+    };
+    // invoke _map
+    return _map(this, 0, rows - 1, 0, columns - 1, invoke, skipZeros);
+  };
+
+  /**
+   * Create a new matrix with the results of the callback function executed on the interval
+   * [minRow..maxRow, minColumn..maxColumn].
+   */
+  function _map(matrix, minRow, maxRow, minColumn, maxColumn, callback, skipZeros) {
+    // result arrays
+    var values = [];
+    var index = [];
+    var ptr = [];
+
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    if (isString(matrix._datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [matrix._datatype, matrix._datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, matrix._datatype);
+    }
+
+    // invoke callback
+    var invoke = function invoke(v, x, y) {
+      // invoke callback
+      var value = callback(v, x, y);
+      // check value != 0
+      if (!eq(value, zero)) {
+        // store value
+        values.push(value);
+        // index
+        index.push(x);
+      }
+    };
+    // loop columns
+    for (var j = minColumn; j <= maxColumn; j++) {
+      // store pointer to values index
+      ptr.push(values.length);
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = matrix._ptr[j];
+      var k1 = matrix._ptr[j + 1];
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = matrix._index[k];
+          // check i is in range
+          if (i >= minRow && i <= maxRow) {
+            // value @ k
+            invoke(matrix._values[k], i - minRow, j - minColumn);
+          }
+        }
+      } else {
+        // create a cache holding all defined values
+        var _values = {};
+        for (var _k = k0; _k < k1; _k++) {
+          var _i4 = matrix._index[_k];
+          _values[_i4] = matrix._values[_k];
+        }
+
+        // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+        for (var _i5 = minRow; _i5 <= maxRow; _i5++) {
+          var value = _i5 in _values ? _values[_i5] : 0;
+          invoke(value, _i5 - minRow, j - minColumn);
+        }
+      }
+    }
+
+    // store number of values in ptr
+    ptr.push(values.length);
+    // return sparse matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [maxRow - minRow + 1, maxColumn - minColumn + 1]
+    });
+  }
+
+  /**
+   * Execute a callback function on each entry of the matrix.
+   * @memberof SparseMatrix
+   * @param {Function} callback   The callback function is invoked with three
+   *                              parameters: the value of the element, the index
+   *                              of the element, and the Matrix being traversed.
+   * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+   *                              If false, the indices are guaranteed to be in order,
+   *                              if true, the indices can be unordered.
+   */
+  SparseMatrix.prototype.forEach = function (callback, skipZeros) {
+    // check it is a pattern matrix
+    if (!this._values) {
+      throw new Error('Cannot invoke forEach on a Pattern only matrix');
+    }
+    // matrix instance
+    var me = this;
+    // rows and columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+    var fastCallback = optimizeCallback(callback, me, 'forEach');
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+      if (skipZeros) {
+        // loop k within [k0, k1[
+        for (var k = k0; k < k1; k++) {
+          // row index
+          var i = this._index[k];
+
+          // value @ k
+          // TODO apply a non indexed version of algorithm in case fastCallback is not optimized
+          fastCallback.fn(this._values[k], [i, j], me);
+        }
+      } else {
+        // create a cache holding all defined values
+        var values = {};
+        for (var _k2 = k0; _k2 < k1; _k2++) {
+          var _i6 = this._index[_k2];
+          values[_i6] = this._values[_k2];
+        }
+
+        // loop over all rows (indexes can be unordered so we can't use that),
+        // and either read the value or zero
+        for (var _i7 = 0; _i7 < rows; _i7++) {
+          var value = _i7 in values ? values[_i7] : 0;
+          fastCallback.fn(value, [_i7, j], me);
+        }
+      }
+    }
+  };
+
+  /**
+   * Iterate over the matrix elements, skipping zeros
+   * @return {Iterable<{ value, index: number[] }>}
+   */
+  SparseMatrix.prototype[Symbol.iterator] = function* () {
+    if (!this._values) {
+      throw new Error('Cannot iterate a Pattern only matrix');
+    }
+    var columns = this._size[1];
+    for (var j = 0; j < columns; j++) {
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+      for (var k = k0; k < k1; k++) {
+        // row index
+        var i = this._index[k];
+        yield {
+          value: this._values[k],
+          index: [i, j]
+        };
+      }
+    }
+  };
+
+  /**
+   * Create an Array with a copy of the data of the SparseMatrix
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+  SparseMatrix.prototype.toArray = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, true);
+  };
+
+  /**
+   * Get the primitive value of the SparseMatrix: a two dimensions array
+   * @memberof SparseMatrix
+   * @returns {Array} array
+   */
+  SparseMatrix.prototype.valueOf = function () {
+    return _toArray(this._values, this._index, this._ptr, this._size, false);
+  };
+  function _toArray(values, index, ptr, size, copy) {
+    // rows and columns
+    var rows = size[0];
+    var columns = size[1];
+    // result
+    var a = [];
+    // vars
+    var i, j;
+    // initialize array
+    for (i = 0; i < rows; i++) {
+      a[i] = [];
+      for (j = 0; j < columns; j++) {
+        a[i][j] = 0;
+      }
+    }
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1];
+      // loop k within [k0, k1[
+      for (var k = k0; k < k1; k++) {
+        // row index
+        i = index[k];
+        // set value (use one for pattern matrix)
+        a[i][j] = values ? copy ? clone(values[k]) : values[k] : 1;
+      }
+    }
+    return a;
+  }
+
+  /**
+   * Get a string representation of the matrix, with optional formatting options.
+   * @memberof SparseMatrix
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @returns {string} str
+   */
+  SparseMatrix.prototype.format = function (options) {
+    // rows and columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+    // density
+    var density = this.density();
+    // rows & columns
+    var str = 'Sparse Matrix [' + format(rows, options) + ' x ' + format(columns, options) + '] density: ' + format(density, options) + '\n';
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+      // loop k within [k0, k1[
+      for (var k = k0; k < k1; k++) {
+        // row index
+        var i = this._index[k];
+        // append value
+        str += '\n    (' + format(i, options) + ', ' + format(j, options) + ') ==> ' + (this._values ? format(this._values[k], options) : 'X');
+      }
+    }
+    return str;
+  };
+
+  /**
+   * Get a string representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {string} str
+   */
+  SparseMatrix.prototype.toString = function () {
+    return format(this.toArray());
+  };
+
+  /**
+   * Get a JSON representation of the matrix
+   * @memberof SparseMatrix
+   * @returns {Object}
+   */
+  SparseMatrix.prototype.toJSON = function () {
+    return {
+      mathjs: 'SparseMatrix',
+      values: this._values,
+      index: this._index,
+      ptr: this._ptr,
+      size: this._size,
+      datatype: this._datatype
+    };
+  };
+
+  /**
+   * Get the kth Matrix diagonal.
+   *
+   * @memberof SparseMatrix
+   * @param {number | BigNumber} [k=0]     The kth diagonal where the vector will retrieved.
+   *
+   * @returns {Matrix}                     The matrix vector with the diagonal values.
+   */
+  SparseMatrix.prototype.diagonal = function (k) {
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0;
+
+    // rows & columns
+    var rows = this._size[0];
+    var columns = this._size[1];
+
+    // number diagonal values
+    var n = Math.min(rows - kSub, columns - kSuper);
+
+    // diagonal arrays
+    var values = [];
+    var index = [];
+    var ptr = [];
+    // initial ptr value
+    ptr[0] = 0;
+    // loop columns
+    for (var j = kSuper; j < columns && values.length < n; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = this._ptr[j];
+      var k1 = this._ptr[j + 1];
+      // loop x within [k0, k1[
+      for (var x = k0; x < k1; x++) {
+        // row index
+        var i = this._index[x];
+        // check row
+        if (i === j - kSuper + kSub) {
+          // value on this column
+          values.push(this._values[x]);
+          // store row
+          index[values.length - 1] = i - kSub;
+          // exit loop
+          break;
+        }
+      }
+    }
+    // close ptr
+    ptr.push(values.length);
+    // return matrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [n, 1]
+    });
+  };
+
+  /**
+   * Generate a matrix from a JSON object
+   * @memberof SparseMatrix
+   * @param {Object} json  An object structured like
+   *                       `{"mathjs": "SparseMatrix", "values": [], "index": [], "ptr": [], "size": []}`,
+   *                       where mathjs is optional
+   * @returns {SparseMatrix}
+   */
+  SparseMatrix.fromJSON = function (json) {
+    return new SparseMatrix(json);
+  };
+
+  /**
+   * Create a diagonal matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {Array} size                       The matrix size.
+   * @param {number | Array | Matrix } value   The values for the diagonal.
+   * @param {number | BigNumber} [k=0]         The kth diagonal where the vector will be filled in.
+   * @param {number} [defaultValue]            The default value for non-diagonal
+   * @param {string} [datatype]                The Matrix datatype, values must be of this datatype.
+   *
+   * @returns {SparseMatrix}
+   */
+  SparseMatrix.diagonal = function (size, value, k, defaultValue, datatype) {
+    if (!isArray(size)) {
+      throw new TypeError('Array expected, size parameter');
+    }
+    if (size.length !== 2) {
+      throw new Error('Only two dimensions matrix are supported');
+    }
+
+    // map size & validate
+    size = size.map(function (s) {
+      // check it is a big number
+      if (isBigNumber(s)) {
+        // convert it
+        s = s.toNumber();
+      }
+      // validate arguments
+      if (!isNumber(s) || !isInteger(s) || s < 1) {
+        throw new Error('Size values must be positive integers');
+      }
+      return s;
+    });
+
+    // validate k if any
+    if (k) {
+      // convert BigNumber to a number
+      if (isBigNumber(k)) {
+        k = k.toNumber();
+      }
+      // is must be an integer
+      if (!isNumber(k) || !isInteger(k)) {
+        throw new TypeError('The parameter k must be an integer number');
+      }
+    } else {
+      // default value
+      k = 0;
+    }
+
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    if (isString(datatype)) {
+      // find signature that matches (datatype, datatype)
+      eq = typed.find(equalScalar, [datatype, datatype]) || equalScalar;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, datatype);
+    }
+    var kSuper = k > 0 ? k : 0;
+    var kSub = k < 0 ? -k : 0;
+
+    // rows and columns
+    var rows = size[0];
+    var columns = size[1];
+
+    // number of non-zero items
+    var n = Math.min(rows - kSub, columns - kSuper);
+
+    // value extraction function
+    var _value;
+
+    // check value
+    if (isArray(value)) {
+      // validate array
+      if (value.length !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid value array length');
+      }
+      // define function
+      _value = function _value(i) {
+        // return value @ i
+        return value[i];
+      };
+    } else if (isMatrix(value)) {
+      // matrix size
+      var ms = value.size();
+      // validate matrix
+      if (ms.length !== 1 || ms[0] !== n) {
+        // number of values in array must be n
+        throw new Error('Invalid matrix length');
+      }
+      // define function
+      _value = function _value(i) {
+        // return value @ i
+        return value.get([i]);
+      };
+    } else {
+      // define function
+      _value = function _value() {
+        // return value
+        return value;
+      };
+    }
+
+    // create arrays
+    var values = [];
+    var index = [];
+    var ptr = [];
+
+    // loop items
+    for (var j = 0; j < columns; j++) {
+      // number of rows with value
+      ptr.push(values.length);
+      // diagonal index
+      var i = j - kSuper;
+      // check we need to set diagonal value
+      if (i >= 0 && i < n) {
+        // get value @ i
+        var v = _value(i);
+        // check for zero
+        if (!eq(v, zero)) {
+          // column
+          index.push(i + kSub);
+          // add value
+          values.push(v);
+        }
+      }
+    }
+    // last value should be number of values
+    ptr.push(values.length);
+    // create SparseMatrix
+    return new SparseMatrix({
+      values,
+      index,
+      ptr,
+      size: [rows, columns]
+    });
+  };
+
+  /**
+   * Swap rows i and j in Matrix.
+   *
+   * @memberof SparseMatrix
+   * @param {number} i       Matrix row index 1
+   * @param {number} j       Matrix row index 2
+   *
+   * @return {Matrix}        The matrix reference
+   */
+  SparseMatrix.prototype.swapRows = function (i, j) {
+    // check index
+    if (!isNumber(i) || !isInteger(i) || !isNumber(j) || !isInteger(j)) {
+      throw new Error('Row index must be positive integers');
+    }
+    // check dimensions
+    if (this._size.length !== 2) {
+      throw new Error('Only two dimensional matrix is supported');
+    }
+    // validate index
+    validateIndex(i, this._size[0]);
+    validateIndex(j, this._size[0]);
+
+    // swap rows
+    SparseMatrix._swapRows(i, j, this._size[1], this._values, this._index, this._ptr);
+    // return current instance
+    return this;
+  };
+
+  /**
+   * Loop rows with data in column j.
+   *
+   * @param {number} j            Column
+   * @param {Array} values        Matrix values
+   * @param {Array} index         Matrix row indeces
+   * @param {Array} ptr           Matrix column pointers
+   * @param {Function} callback   Callback function invoked for every row in column j
+   */
+  SparseMatrix._forEachRow = function (j, values, index, ptr, callback) {
+    // indeces for column j
+    var k0 = ptr[j];
+    var k1 = ptr[j + 1];
+
+    // loop
+    for (var k = k0; k < k1; k++) {
+      // invoke callback
+      callback(index[k], values[k]);
+    }
+  };
+
+  /**
+   * Swap rows x and y in Sparse Matrix data structures.
+   *
+   * @param {number} x         Matrix row index 1
+   * @param {number} y         Matrix row index 2
+   * @param {number} columns   Number of columns in matrix
+   * @param {Array} values     Matrix values
+   * @param {Array} index      Matrix row indeces
+   * @param {Array} ptr        Matrix column pointers
+   */
+  SparseMatrix._swapRows = function (x, y, columns, values, index, ptr) {
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // k0 <= k < k1 where k0 = _ptr[j] && k1 = _ptr[j+1]
+      var k0 = ptr[j];
+      var k1 = ptr[j + 1];
+      // find value index @ x
+      var kx = _getValueIndex(x, k0, k1, index);
+      // find value index @ x
+      var ky = _getValueIndex(y, k0, k1, index);
+      // check both rows exist in matrix
+      if (kx < k1 && ky < k1 && index[kx] === x && index[ky] === y) {
+        // swap values (check for pattern matrix)
+        if (values) {
+          var v = values[kx];
+          values[kx] = values[ky];
+          values[ky] = v;
+        }
+        // next column
+        continue;
+      }
+      // check x row exist & no y row
+      if (kx < k1 && index[kx] === x && (ky >= k1 || index[ky] !== y)) {
+        // value @ x (check for pattern matrix)
+        var vx = values ? values[kx] : undefined;
+        // insert value @ y
+        index.splice(ky, 0, y);
+        if (values) {
+          values.splice(ky, 0, vx);
+        }
+        // remove value @ x (adjust array index if needed)
+        index.splice(ky <= kx ? kx + 1 : kx, 1);
+        if (values) {
+          values.splice(ky <= kx ? kx + 1 : kx, 1);
+        }
+        // next column
+        continue;
+      }
+      // check y row exist & no x row
+      if (ky < k1 && index[ky] === y && (kx >= k1 || index[kx] !== x)) {
+        // value @ y (check for pattern matrix)
+        var vy = values ? values[ky] : undefined;
+        // insert value @ x
+        index.splice(kx, 0, x);
+        if (values) {
+          values.splice(kx, 0, vy);
+        }
+        // remove value @ y (adjust array index if needed)
+        index.splice(kx <= ky ? ky + 1 : ky, 1);
+        if (values) {
+          values.splice(kx <= ky ? ky + 1 : ky, 1);
+        }
+      }
+    }
+  };
+  return SparseMatrix;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/index.js b/node_modules/mathjs/lib/esm/type/matrix/function/index.js
new file mode 100644
index 0000000..3630756
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/index.js
@@ -0,0 +1,64 @@
+import { isBigNumber, isMatrix, isArray } from '../../../utils/is.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'index';
+var dependencies = ['typed', 'Index'];
+export var createIndex = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Index
+  } = _ref;
+  /**
+   * Create an index. An Index can store ranges having start, step, and end
+   * for multiple dimensions.
+   * Matrix.get, Matrix.set, and math.subset accept an Index as input.
+   *
+   * Syntax:
+   *
+   *     math.index(range1, range2, ...)
+   *
+   * Where each range can be any of:
+   *
+   * - A number
+   * - A string for getting/setting an object property
+   * - An instance of `Range`
+   * - A one-dimensional Array or a Matrix with numbers or booleans
+   *
+   * Indexes must be zero-based, integer numbers.
+   *
+   * Examples:
+   *
+   *    const b = [1, 2, 3, 4, 5]
+   *    math.subset(b, math.index([1, 2, 3]))                         // returns [2, 3, 4]
+   *    math.subset(b, math.index([false, true, true, true, false]))  // returns [2, 3, 4]
+   *
+   *    const a = math.matrix([[1, 2], [3, 4]])
+   *    a.subset(math.index(0, 1))             // returns 2
+   *    a.subset(math.index(0, [false, true])) // returns 2
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, matrix, number, string, unit
+   *
+   * @param {...*} ranges   Zero or more ranges or numbers.
+   * @return {Index}        Returns the created index
+   */
+  return typed(name, {
+    '...number | string | BigNumber | Range | Array | Matrix': function number__string__BigNumber__Range__Array__Matrix(args) {
+      var ranges = args.map(function (arg) {
+        if (isBigNumber(arg)) {
+          return arg.toNumber(); // convert BigNumber to Number
+        } else if (isArray(arg) || isMatrix(arg)) {
+          return arg.map(function (elem) {
+            // convert BigNumber to Number
+            return isBigNumber(elem) ? elem.toNumber() : elem;
+          });
+        } else {
+          return arg;
+        }
+      });
+      var res = new Index();
+      Index.apply(res, ranges);
+      return res;
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js b/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js
new file mode 100644
index 0000000..c234c7a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js
@@ -0,0 +1,82 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'matrix';
+var dependencies = ['typed', 'Matrix', 'DenseMatrix', 'SparseMatrix'];
+export var createMatrix = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Matrix,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Supported storage formats are 'dense' and 'sparse'.
+   *
+   * Syntax:
+   *
+   *    math.matrix()                         // creates an empty matrix using default storage format (dense).
+   *    math.matrix(data)                     // creates a matrix with initial data using default storage format (dense).
+   *    math.matrix('dense')                  // creates an empty matrix using the given storage format.
+   *    math.matrix(data, 'dense')            // creates a matrix with initial data using the given storage format.
+   *    math.matrix(data, 'sparse')           // creates a sparse matrix with initial data.
+   *    math.matrix(data, 'sparse', 'number') // creates a sparse matrix with initial data, number data type.
+   *
+   * Examples:
+   *
+   *    let m = math.matrix([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, sparse
+   *
+   * @param {Array | Matrix} [data]    A multi dimensional array
+   * @param {string} [format]          The Matrix storage format, either `'dense'` or `'sparse'`
+   * @param {string} [datatype]        Type of the values
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return _create([]);
+    },
+    string: function string(format) {
+      return _create([], format);
+    },
+    'string, string': function string_string(format, datatype) {
+      return _create([], format, datatype);
+    },
+    Array: function Array(data) {
+      return _create(data);
+    },
+    Matrix: function Matrix(data) {
+      return _create(data, data.storage());
+    },
+    'Array | Matrix, string': _create,
+    'Array | Matrix, string, string': _create
+  });
+
+  /**
+   * Create a new Matrix with given storage format
+   * @param {Array} data
+   * @param {string} [format]
+   * @param {string} [datatype]
+   * @returns {Matrix} Returns a new Matrix
+   * @private
+   */
+  function _create(data, format, datatype) {
+    // get storage format constructor
+    if (format === 'dense' || format === 'default' || format === undefined) {
+      return new DenseMatrix(data, datatype);
+    }
+    if (format === 'sparse') {
+      return new SparseMatrix(data, datatype);
+    }
+    throw new TypeError('Unknown matrix type ' + JSON.stringify(format) + '.');
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js b/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js
new file mode 100644
index 0000000..8fa3bc0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/function/sparse.js
@@ -0,0 +1,56 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'sparse';
+var dependencies = ['typed', 'SparseMatrix'];
+export var createSparse = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    SparseMatrix
+  } = _ref;
+  /**
+   * Create a Sparse Matrix. The function creates a new `math.Matrix` object from
+   * an `Array`. A Matrix has utility functions to manipulate the data in the
+   * matrix, like getting the size and getting or setting values in the matrix.
+   * Note that a Sparse Matrix is always 2-dimensional, so for example if
+   * you create one from a plain array of _n_ numbers, you get an _n_ by 1
+   * Sparse "column vector".
+   *
+   * Syntax:
+   *
+   *    math.sparse()               // creates an empty sparse matrix.
+   *    math.sparse(data)           // creates a sparse matrix with initial data.
+   *    math.sparse(data, 'number') // creates a sparse matrix with initial data, number datatype.
+   *
+   * Examples:
+   *
+   *    let m = math.sparse([[1, 2], [3, 4]])
+   *    m.size()                        // Array [2, 2]
+   *    m.resize([3, 2], 5)
+   *    m.valueOf()                     // Array [[1, 2], [3, 4], [5, 5]]
+   *    m.get([1, 0])                    // number 3
+   *    let v = math.sparse([0, 0, 1])
+   *    v.size()                        // Array [3, 1]
+   *    v.get([2, 0])                   // number 1
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, number, string, unit, matrix
+   *
+   * @param {Array | Matrix} [data]    A two dimensional array
+   *
+   * @return {Matrix} The created matrix
+   */
+  return typed(name, {
+    '': function _() {
+      return new SparseMatrix([]);
+    },
+    string: function string(datatype) {
+      return new SparseMatrix([], datatype);
+    },
+    'Array | Matrix': function Array__Matrix(data) {
+      return new SparseMatrix(data);
+    },
+    'Array | Matrix, string': function Array__Matrix_string(data, datatype) {
+      return new SparseMatrix(data, datatype);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js b/node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js
new file mode 100644
index 0000000..4afb20e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/broadcast.js
@@ -0,0 +1,40 @@
+import { broadcastSizes, broadcastTo } from '../../../utils/array.js';
+import { deepStrictEqual } from '../../../utils/object.js';
+
+/**
+* Broadcasts two matrices, and return both in an array
+* It checks if it's possible with broadcasting rules
+*
+* @param {Matrix}   A      First Matrix
+* @param {Matrix}   B      Second Matrix
+*
+* @return {Matrix[]}      [ broadcastedA, broadcastedB ]
+*/
+
+export function broadcast(A, B) {
+  if (deepStrictEqual(A.size(), B.size())) {
+    // If matrices have the same size return them
+    return [A, B];
+  }
+
+  // calculate the broadcasted sizes
+  var newSize = broadcastSizes(A.size(), B.size());
+
+  // return the array with the two broadcasted matrices
+  return [A, B].map(M => _broadcastTo(M, newSize));
+}
+
+/**
+ * Broadcasts a matrix to the given size.
+ *
+ * @param {Matrix} M - The matrix to be broadcasted.
+ * @param {number[]} size - The desired size of the broadcasted matrix.
+ * @returns {Matrix} The broadcasted matrix.
+ * @throws {Error} If the size parameter is not an array of numbers.
+ */
+function _broadcastTo(M, size) {
+  if (deepStrictEqual(M.size(), size)) {
+    return M;
+  }
+  return M.create(broadcastTo(M.valueOf(), size), M.datatype());
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js
new file mode 100644
index 0000000..327948c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo01xDSid.js
@@ -0,0 +1,112 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo01xDSid';
+var dependencies = ['typed'];
+export var createMatAlgo01xDSid = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  Dij          ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function algorithm1(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // process data types
+    var dt = typeof adt === 'string' && adt !== 'mixed' && adt === bdt ? adt : undefined;
+    // callback function
+    var cf = dt ? typed.find(callback, [dt, dt]) : callback;
+
+    // vars
+    var i, j;
+
+    // result (DenseMatrix)
+    var cdata = [];
+    // initialize c
+    for (i = 0; i < rows; i++) {
+      cdata[i] = [];
+    }
+
+    // workspace
+    var x = [];
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // loop columns in b
+    for (j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1;
+      // values in column j
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // update workspace
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        // mark i as updated
+        w[i] = mark;
+      }
+      // loop rows
+      for (i = 0; i < rows; i++) {
+        // check row is in workspace
+        if (w[i] === mark) {
+          // c[i][j] was already calculated
+          cdata[i][j] = x[i];
+        } else {
+          // item does not exist in S
+          cdata[i][j] = adata[i][j];
+        }
+      }
+    }
+
+    // return dense matrix
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo02xDS0.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo02xDS0.js
new file mode 100644
index 0000000..82e4042
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo02xDS0.js
@@ -0,0 +1,116 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo02xDS0';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo02xDS0 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix nonzero items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked NNZ times (number of nonzero items in SparseMatrix).
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (S)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function matAlgo02xDS0(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result (SparseMatrix)
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+
+    // loop columns in b
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // values in column j
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k];
+        // update C(i,j)
+        var cij = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        // check for nonzero
+        if (!eq(cij, zero)) {
+          // push i & v
+          cindex.push(i);
+          cvalues.push(cij);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return sparseMatrix.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js
new file mode 100644
index 0000000..b06d8b7
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo03xDSf.js
@@ -0,0 +1,122 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo03xDSf';
+var dependencies = ['typed'];
+export var createMatAlgo03xDSf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix items and invokes the callback function f(Dij, Sij).
+   * Callback function invoked M*N times.
+   *
+   *
+   *          ┌  f(Dij, Sij)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(Dij, 0)    ; otherwise
+   *
+   *
+   * @param {Matrix}   denseMatrix       The DenseMatrix instance (D)
+   * @param {Matrix}   sparseMatrix      The SparseMatrix instance (C)
+   * @param {Function} callback          The f(Dij,Sij) operation to invoke, where Dij = DenseMatrix(i,j) and Sij = SparseMatrix(i,j)
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(Sij,Dij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97477571
+   */
+  return function matAlgo03xDSf(denseMatrix, sparseMatrix, callback, inverse) {
+    // dense matrix arrays
+    var adata = denseMatrix._data;
+    var asize = denseMatrix._size;
+    var adt = denseMatrix._datatype || denseMatrix.getDataType();
+    // sparse matrix arrays
+    var bvalues = sparseMatrix._values;
+    var bindex = sparseMatrix._index;
+    var bptr = sparseMatrix._ptr;
+    var bsize = sparseMatrix._size;
+    var bdt = sparseMatrix._datatype || sparseMatrix._data === undefined ? sparseMatrix._datatype : sparseMatrix.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!bvalues) {
+      throw new Error('Cannot perform operation on Dense Matrix and Pattern Sparse Matrix');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result (DenseMatrix)
+    var cdata = [];
+
+    // initialize dense matrix
+    for (var z = 0; z < rows; z++) {
+      // initialize row
+      cdata[z] = [];
+    }
+
+    // workspace
+    var x = [];
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // loop columns in b
+    for (var j = 0; j < columns; j++) {
+      // column mark
+      var mark = j + 1;
+      // values in column j
+      for (var k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = bindex[k];
+        // update workspace
+        x[i] = inverse ? cf(bvalues[k], adata[i][j]) : cf(adata[i][j], bvalues[k]);
+        w[i] = mark;
+      }
+      // process workspace
+      for (var y = 0; y < rows; y++) {
+        // check we have a calculated value for current row
+        if (w[y] === mark) {
+          // use calculated value
+          cdata[y][j] = x[y];
+        } else {
+          // calculate value
+          cdata[y][j] = inverse ? cf(zero, adata[y][j]) : cf(adata[y][j], zero);
+        }
+      }
+    }
+
+    // return dense matrix
+    return denseMatrix.createDenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: adt === denseMatrix._datatype && bdt === sparseMatrix._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js
new file mode 100644
index 0000000..ee1ce13
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo04xSidSid.js
@@ -0,0 +1,179 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo04xSidSid';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo04xSidSid = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0
+   *          └  B(i,j)       ; A(i,j) === 0
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo04xSidSid(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+
+    // workspace
+    var xa = avalues && bvalues ? [] : undefined;
+    var xb = avalues && bvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    var wa = [];
+    var wb = [];
+
+    // vars
+    var i, j, k, k0, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      var mark = j + 1;
+      // loop A(:,j)
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // update c
+        cindex.push(i);
+        // update workspace
+        wa[i] = mark;
+        // check we need to process values
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      }
+      // loop B(:,j)
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check row exists in A
+        if (wa[i] === mark) {
+          // update record in xa @ i
+          if (xa) {
+            // invoke callback
+            var v = cf(xa[i], bvalues[k]);
+            // check for zero
+            if (!eq(v, zero)) {
+              // update workspace
+              xa[i] = v;
+            } else {
+              // remove mark (index will be removed later)
+              wa[i] = null;
+            }
+          }
+        } else {
+          // update c
+          cindex.push(i);
+          // update workspace
+          wb[i] = mark;
+          // check we need to process values
+          if (xb) {
+            xb[i] = bvalues[k];
+          }
+        }
+      }
+      // check we need to process values (non pattern matrix)
+      if (xa && xb) {
+        // initialize first index in j
+        k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          i = cindex[k];
+          // check workspace has value @ i
+          if (wa[i] === mark) {
+            // push value (Aij != 0 || (Aij != 0 && Bij != 0))
+            cvalues[k] = xa[i];
+            // increment pointer
+            k++;
+          } else if (wb[i] === mark) {
+            // push value (bij != 0)
+            cvalues[k] = xb[i];
+            // increment pointer
+            k++;
+          } else {
+            // remove index @ k
+            cindex.splice(k, 1);
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js
new file mode 100644
index 0000000..e28e182
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo05xSfSf.js
@@ -0,0 +1,171 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo05xSfSf';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo05xSfSf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 || B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo05xSfSf(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+
+    // workspaces
+    var xa = cvalues ? [] : undefined;
+    var xb = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    var wa = [];
+    var wb = [];
+
+    // vars
+    var i, j, k, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      var mark = j + 1;
+      // loop values A(:,j)
+      for (k = aptr[j], k1 = aptr[j + 1]; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // push index
+        cindex.push(i);
+        // update workspace
+        wa[i] = mark;
+        // check we need to process values
+        if (xa) {
+          xa[i] = avalues[k];
+        }
+      }
+      // loop values B(:,j)
+      for (k = bptr[j], k1 = bptr[j + 1]; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check row existed in A
+        if (wa[i] !== mark) {
+          // push index
+          cindex.push(i);
+        }
+        // update workspace
+        wb[i] = mark;
+        // check we need to process values
+        if (xb) {
+          xb[i] = bvalues[k];
+        }
+      }
+      // check we need to process values (non pattern matrix)
+      if (cvalues) {
+        // initialize first index in j
+        k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          i = cindex[k];
+          // marks
+          var wai = wa[i];
+          var wbi = wb[i];
+          // check Aij or Bij are nonzero
+          if (wai === mark || wbi === mark) {
+            // matrix values @ i,j
+            var va = wai === mark ? xa[i] : zero;
+            var vb = wbi === mark ? xb[i] : zero;
+            // Cij
+            var vc = cf(va, vb);
+            // check for zero
+            if (!eq(vc, zero)) {
+              // push value
+              cvalues.push(vc);
+              // increment pointer
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo06xS0S0.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo06xS0S0.js
new file mode 100644
index 0000000..974ec52
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo06xS0S0.js
@@ -0,0 +1,153 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+import { scatter } from '../../../utils/collection.js';
+var name = 'matAlgo06xS0S0';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo06xS0S0 = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked (Anz U Bnz) times, where Anz and Bnz are the nonzero elements in both matrices.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo06xS0S0(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    var bvalues = b._values;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+
+    // workspaces
+    var x = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    var w = [];
+    // marks indicating value in a given row has been updated
+    var u = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      var mark = j + 1;
+      // scatter the values of A(:,j) into workspace
+      scatter(a, j, w, x, u, mark, cindex, cf);
+      // scatter the values of B(:,j) into workspace
+      scatter(b, j, w, x, u, mark, cindex, cf);
+      // check we need to process values (non pattern matrix)
+      if (x) {
+        // initialize first index in j
+        var k = cptr[j];
+        // loop index in j
+        while (k < cindex.length) {
+          // row
+          var i = cindex[k];
+          // check function was invoked on current row (Aij !=0 && Bij != 0)
+          if (u[i] === mark) {
+            // value @ i
+            var v = x[i];
+            // check for zero value
+            if (!eq(v, zero)) {
+              // push value
+              cvalues.push(v);
+              // increment pointer
+              k++;
+            } else {
+              // remove value @ i, do not increment pointer
+              cindex.splice(k, 1);
+            }
+          } else {
+            // remove value @ i, do not increment pointer
+            cindex.splice(k, 1);
+          }
+        }
+      } else {
+        // initialize first index in j
+        var p = cptr[j];
+        // loop index in j
+        while (p < cindex.length) {
+          // row
+          var r = cindex[p];
+          // check function was invoked on current row (Aij !=0 && Bij != 0)
+          if (u[r] !== mark) {
+            // remove value @ i, do not increment pointer
+            cindex.splice(p, 1);
+          } else {
+            // increment pointer
+            p++;
+          }
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js
new file mode 100644
index 0000000..5399560
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo07xSSf.js
@@ -0,0 +1,115 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo07xSSf';
+var dependencies = ['typed', 'SparseMatrix'];
+export var createMatAlgo07xSSf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    SparseMatrix
+  } = _ref;
+  /**
+  * Iterates over SparseMatrix A and SparseMatrix B items (zero and nonzero) and invokes the callback function f(Aij, Bij).
+  * Callback function invoked MxN times.
+  *
+  * C(i,j) = f(Aij, Bij)
+  *
+  * @param {Matrix}   a                 The SparseMatrix instance (A)
+  * @param {Matrix}   b                 The SparseMatrix instance (B)
+  * @param {Function} callback          The f(Aij,Bij) operation to invoke
+  *
+  * @return {Matrix}                    SparseMatrix (C)
+  *
+  * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+  */
+  return function matAlgo07xSSf(a, b, callback) {
+    // sparse matrix arrays
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    var zero = 0;
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      dt = adt;
+      zero = typed.convert(0, dt);
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays for sparse format
+    var cvalues = [];
+    var cindex = [];
+    var cptr = new Array(columns + 1).fill(0); // Start with column pointer array
+
+    // workspaces
+    var xa = [];
+    var xb = [];
+    var wa = [];
+    var wb = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      var mark = j + 1;
+      var nonZeroCount = 0;
+      _scatter(a, j, wa, xa, mark);
+      _scatter(b, j, wb, xb, mark);
+
+      // loop rows
+      for (var i = 0; i < rows; i++) {
+        var va = wa[i] === mark ? xa[i] : zero;
+        var vb = wb[i] === mark ? xb[i] : zero;
+
+        // invoke callback
+        var cij = cf(va, vb);
+        // Store all non zero and true values
+        if (cij !== 0 && cij !== false) {
+          cindex.push(i); // row index
+          cvalues.push(cij); // computed value
+          nonZeroCount++;
+        }
+      }
+
+      // Update column pointer with cumulative count of non-zero values
+      cptr[j + 1] = cptr[j] + nonZeroCount;
+    }
+
+    // Return the result as a sparse matrix
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+  function _scatter(m, j, w, x, mark) {
+    // a arrays
+    var values = m._values;
+    var index = m._index;
+    var ptr = m._ptr;
+    // loop values in column j
+    for (var k = ptr[j], k1 = ptr[j + 1]; k < k1; k++) {
+      // row
+      var i = index[k];
+      // update workspace
+      w[i] = mark;
+      x[i] = values[k];
+    }
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo08xS0Sid.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo08xS0Sid.js
new file mode 100644
index 0000000..4fb4909
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo08xS0Sid.js
@@ -0,0 +1,154 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo08xS0Sid';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo08xS0Sid = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and SparseMatrix B nonzero items and invokes the callback function f(Aij, Bij).
+   * Callback function invoked MAX(NNZA, NNZB) times
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0 && B(i,j) !== 0
+   * C(i,j) = ┤  A(i,j)       ; A(i,j) !== 0 && B(i,j) === 0
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo08xS0Sid(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues || !bvalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrices');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+
+    // workspace
+    var x = [];
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // vars
+    var k, k0, k1, i;
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // columns mark
+      var mark = j + 1;
+      // loop values in a
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // mark workspace
+        w[i] = mark;
+        // set value
+        x[i] = avalues[k];
+        // add index
+        cindex.push(i);
+      }
+      // loop values in b
+      for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = bindex[k];
+        // check value exists in workspace
+        if (w[i] === mark) {
+          // evaluate callback
+          x[i] = cf(x[i], bvalues[k]);
+        }
+      }
+      // initialize first index in j
+      k = cptr[j];
+      // loop index in j
+      while (k < cindex.length) {
+        // row
+        i = cindex[k];
+        // value @ i
+        var v = x[i];
+        // check for zero value
+        if (!eq(v, zero)) {
+          // push value
+          cvalues.push(v);
+          // increment pointer
+          k++;
+        } else {
+          // remove value @ i, do not increment pointer
+          cindex.splice(k, 1);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo09xS0Sf.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo09xS0Sf.js
new file mode 100644
index 0000000..0677453
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo09xS0Sf.js
@@ -0,0 +1,142 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo09xS0Sf';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo09xS0Sf = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix A and invokes the callback function f(Aij, Bij).
+   * Callback function invoked NZA times, number of nonzero elements in A.
+   *
+   *
+   *          ┌  f(Aij, Bij)  ; A(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0            ; otherwise
+   *
+   *
+   * @param {Matrix}   a                 The SparseMatrix instance (A)
+   * @param {Matrix}   b                 The SparseMatrix instance (B)
+   * @param {Function} callback          The f(Aij,Bij) operation to invoke
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * see https://github.com/josdejong/mathjs/pull/346#issuecomment-97620294
+   */
+  return function matAlgo09xS0Sf(a, b, callback) {
+    // sparse matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size;
+    var adt = a._datatype || a._data === undefined ? a._datatype : a.getDataType();
+    // sparse matrix arrays
+    var bvalues = b._values;
+    var bindex = b._index;
+    var bptr = b._ptr;
+    var bsize = b._size;
+    var bdt = b._datatype || b._data === undefined ? b._datatype : b.getDataType();
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // check rows & columns
+    if (asize[0] !== bsize[0] || asize[1] !== bsize[1]) {
+      throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt && adt !== 'mixed') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = avalues && bvalues ? [] : undefined;
+    var cindex = [];
+    var cptr = [];
+
+    // workspaces
+    var x = cvalues ? [] : undefined;
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // vars
+    var i, j, k, k0, k1;
+
+    // loop columns
+    for (j = 0; j < columns; j++) {
+      // update cptr
+      cptr[j] = cindex.length;
+      // column mark
+      var mark = j + 1;
+      // check we need to process values
+      if (x) {
+        // loop B(:,j)
+        for (k0 = bptr[j], k1 = bptr[j + 1], k = k0; k < k1; k++) {
+          // row
+          i = bindex[k];
+          // update workspace
+          w[i] = mark;
+          x[i] = bvalues[k];
+        }
+      }
+      // loop A(:,j)
+      for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        i = aindex[k];
+        // check we need to process values
+        if (x) {
+          // b value @ i,j
+          var vb = w[i] === mark ? x[i] : zero;
+          // invoke f
+          var vc = cf(avalues[k], vb);
+          // check zero value
+          if (!eq(vc, zero)) {
+            // push index
+            cindex.push(i);
+            // push value
+            cvalues.push(vc);
+          }
+        } else {
+          // push index
+          cindex.push(i);
+        }
+      }
+    }
+    // update cptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return a.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: adt === a._datatype && bdt === b._datatype ? dt : undefined
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js
new file mode 100644
index 0000000..0c6a632
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo10xSids.js
@@ -0,0 +1,105 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'matAlgo10xSids';
+var dependencies = ['typed', 'DenseMatrix'];
+export var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  b          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo10xSids(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cdata = [];
+
+    // workspaces
+    var x = [];
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1;
+      // values in j
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k];
+        // update workspace
+        x[r] = avalues[k];
+        w[r] = mark;
+      }
+      // loop rows
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        }
+        // check sparse matrix has a value @ i,j
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = b;
+        }
+      }
+    }
+
+    // return dense matrix
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js
new file mode 100644
index 0000000..08b0997
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js
@@ -0,0 +1,103 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'matAlgo11xS0s';
+var dependencies = ['typed', 'equalScalar'];
+export var createMatAlgo11xS0s = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    equalScalar
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked NZ times (number of nonzero items in S).
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  0          ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    SparseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo11xS0s(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // equal signature to use
+    var eq = equalScalar;
+    // zero value
+    var zero = 0;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // find signature that matches (dt, dt)
+      eq = typed.find(equalScalar, [dt, dt]);
+      // convert 0 to the same datatype
+      zero = typed.convert(0, dt);
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cvalues = [];
+    var cindex = [];
+    var cptr = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // initialize ptr
+      cptr[j] = cindex.length;
+      // values in j
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var i = aindex[k];
+        // invoke callback
+        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);
+        // check value is zero
+        if (!eq(v, zero)) {
+          // push index & value
+          cindex.push(i);
+          cvalues.push(v);
+        }
+      }
+    }
+    // update ptr
+    cptr[columns] = cindex.length;
+
+    // return sparse matrix
+    return s.createSparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js
new file mode 100644
index 0000000..d702faa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo12xSfs.js
@@ -0,0 +1,105 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'matAlgo12xSfs';
+var dependencies = ['typed', 'DenseMatrix'];
+export var createMatAlgo12xSfs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    DenseMatrix
+  } = _ref;
+  /**
+   * Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
+   * Callback function invoked MxN times.
+   *
+   *
+   *          ┌  f(Sij, b)  ; S(i,j) !== 0
+   * C(i,j) = ┤
+   *          └  f(0, b)    ; otherwise
+   *
+   *
+   * @param {Matrix}   s                 The SparseMatrix instance (S)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
+   */
+  return function matAlgo12xSfs(s, b, callback, inverse) {
+    // sparse matrix arrays
+    var avalues = s._values;
+    var aindex = s._index;
+    var aptr = s._ptr;
+    var asize = s._size;
+    var adt = s._datatype;
+
+    // sparse matrix cannot be a Pattern matrix
+    if (!avalues) {
+      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
+    }
+
+    // rows & columns
+    var rows = asize[0];
+    var columns = asize[1];
+
+    // datatype
+    var dt;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // result arrays
+    var cdata = [];
+
+    // workspaces
+    var x = [];
+    // marks indicating we have a value in x for a given column
+    var w = [];
+
+    // loop columns
+    for (var j = 0; j < columns; j++) {
+      // columns mark
+      var mark = j + 1;
+      // values in j
+      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+        // row
+        var r = aindex[k];
+        // update workspace
+        x[r] = avalues[k];
+        w[r] = mark;
+      }
+      // loop rows
+      for (var i = 0; i < rows; i++) {
+        // initialize C on first column
+        if (j === 0) {
+          // create row array
+          cdata[i] = [];
+        }
+        // check sparse matrix has a value @ i,j
+        if (w[i] === mark) {
+          // invoke callback, update C
+          cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
+        } else {
+          // dense matrix value @ i, j
+          cdata[i][j] = inverse ? cf(b, 0) : cf(0, b);
+        }
+      }
+    }
+
+    // return dense matrix
+    return new DenseMatrix({
+      data: cdata,
+      size: [rows, columns],
+      datatype: dt
+    });
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js
new file mode 100644
index 0000000..afd55fa
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo13xDD.js
@@ -0,0 +1,94 @@
+import { factory } from '../../../utils/factory.js';
+import { DimensionError } from '../../../error/DimensionError.js';
+var name = 'matAlgo13xDD';
+var dependencies = ['typed'];
+export var createMatAlgo13xDD = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, Bij..z).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, Bij..z)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Matrix}   b                 The DenseMatrix instance (B)
+   * @param {Function} callback          The f(Aij..z,Bij..z) operation to invoke
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97658658
+   */
+  return function matAlgo13xDD(a, b, callback) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype;
+    // b arrays
+    var bdata = b._data;
+    var bsize = b._size;
+    var bdt = b._datatype;
+    // c arrays
+    var csize = [];
+
+    // validate dimensions
+    if (asize.length !== bsize.length) {
+      throw new DimensionError(asize.length, bsize.length);
+    }
+
+    // validate each one of the dimension sizes
+    for (var s = 0; s < asize.length; s++) {
+      // must match
+      if (asize[s] !== bsize[s]) {
+        throw new RangeError('Dimension mismatch. Matrix A (' + asize + ') must match Matrix B (' + bsize + ')');
+      }
+      // update dimension in c
+      csize[s] = asize[s];
+    }
+
+    // datatype
+    var dt;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string' && adt === bdt) {
+      // datatype
+      dt = adt;
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // populate cdata, iterate through dimensions
+    var cdata = csize.length > 0 ? _iterate(cf, 0, csize, csize[0], adata, bdata) : [];
+
+    // c matrix
+    return a.createDenseMatrix({
+      data: cdata,
+      size: csize,
+      datatype: dt
+    });
+  };
+
+  // recursive function
+  function _iterate(f, level, s, n, av, bv) {
+    // initialize array for this level
+    var cv = [];
+    // check we reach the last level
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = f(av[i], bv[i]);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv[j]);
+      }
+    }
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js
new file mode 100644
index 0000000..7c54e55
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js
@@ -0,0 +1,76 @@
+import { factory } from '../../../utils/factory.js';
+import { clone } from '../../../utils/object.js';
+var name = 'matAlgo14xDs';
+var dependencies = ['typed'];
+export var createMatAlgo14xDs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Iterates over DenseMatrix items and invokes the callback function f(Aij..z, b).
+   * Callback function invoked MxN times.
+   *
+   * C(i,j,...z) = f(Aij..z, b)
+   *
+   * @param {Matrix}   a                 The DenseMatrix instance (A)
+   * @param {Scalar}   b                 The Scalar value
+   * @param {Function} callback          The f(Aij..z,b) operation to invoke
+   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Aij..z)
+   *
+   * @return {Matrix}                    DenseMatrix (C)
+   *
+   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97659042
+   */
+  return function matAlgo14xDs(a, b, callback, inverse) {
+    // a arrays
+    var adata = a._data;
+    var asize = a._size;
+    var adt = a._datatype;
+
+    // datatype
+    var dt;
+    // callback signature to use
+    var cf = callback;
+
+    // process data types
+    if (typeof adt === 'string') {
+      // datatype
+      dt = adt;
+      // convert b to the same datatype
+      b = typed.convert(b, dt);
+      // callback
+      cf = typed.find(callback, [dt, dt]);
+    }
+
+    // populate cdata, iterate through dimensions
+    var cdata = asize.length > 0 ? _iterate(cf, 0, asize, asize[0], adata, b, inverse) : [];
+
+    // c matrix
+    return a.createDenseMatrix({
+      data: cdata,
+      size: clone(asize),
+      datatype: dt
+    });
+  };
+
+  // recursive function
+  function _iterate(f, level, s, n, av, bv, inverse) {
+    // initialize array for this level
+    var cv = [];
+    // check we reach the last level
+    if (level === s.length - 1) {
+      // loop arrays in last level
+      for (var i = 0; i < n; i++) {
+        // invoke callback and store value
+        cv[i] = inverse ? f(bv, av[i]) : f(av[i], bv);
+      }
+    } else {
+      // iterate current level
+      for (var j = 0; j < n; j++) {
+        // iterate next level
+        cv[j] = _iterate(f, level + 1, s, s[level + 1], av[j], bv, inverse);
+      }
+    }
+    return cv;
+  }
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js b/node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js
new file mode 100644
index 0000000..1814a79
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/matrix/utils/matrixAlgorithmSuite.js
@@ -0,0 +1,152 @@
+import { factory } from '../../../utils/factory.js';
+import { extend } from '../../../utils/object.js';
+import { createMatAlgo13xDD } from './matAlgo13xDD.js';
+import { createMatAlgo14xDs } from './matAlgo14xDs.js';
+import { broadcast } from './broadcast.js';
+var name = 'matrixAlgorithmSuite';
+var dependencies = ['typed', 'matrix'];
+export var createMatrixAlgorithmSuite = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix
+  } = _ref;
+  var matAlgo13xDD = createMatAlgo13xDD({
+    typed
+  });
+  var matAlgo14xDs = createMatAlgo14xDs({
+    typed
+  });
+
+  /**
+   * Return a signatures object with the usual boilerplate of
+   * matrix algorithms, based on a plain options object with the
+   * following properties:
+   *   elop: function -- the elementwise operation to use, defaults to self
+   *   SS: function -- the algorithm to apply for two sparse matrices
+   *   DS: function -- the algorithm to apply for a dense and a sparse matrix
+   *   SD: function -- algo for a sparse and a dense; defaults to SD flipped
+   *   Ss: function -- the algorithm to apply for a sparse matrix and scalar
+   *   sS: function -- algo for scalar and sparse; defaults to Ss flipped
+   *   scalar: string -- typed-function type for scalars, defaults to 'any'
+   *
+   * If Ss is not specified, no matrix-scalar signatures are generated.
+   *
+   * @param {object} options
+   * @return {Object<string, function>} signatures
+   */
+  return function matrixAlgorithmSuite(options) {
+    var elop = options.elop;
+    var SD = options.SD || options.DS;
+    var matrixSignatures;
+    if (elop) {
+      // First the dense ones
+      matrixSignatures = {
+        'DenseMatrix, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(x, y), elop),
+        'Array, Array': (x, y) => matAlgo13xDD(...broadcast(matrix(x), matrix(y)), elop).valueOf(),
+        'Array, DenseMatrix': (x, y) => matAlgo13xDD(...broadcast(matrix(x), y), elop),
+        'DenseMatrix, Array': (x, y) => matAlgo13xDD(...broadcast(x, matrix(y)), elop)
+      };
+      // Now incorporate sparse matrices
+      if (options.SS) {
+        matrixSignatures['SparseMatrix, SparseMatrix'] = (x, y) => options.SS(...broadcast(x, y), elop, false);
+      }
+      if (options.DS) {
+        matrixSignatures['DenseMatrix, SparseMatrix'] = (x, y) => options.DS(...broadcast(x, y), elop, false);
+        matrixSignatures['Array, SparseMatrix'] = (x, y) => options.DS(...broadcast(matrix(x), y), elop, false);
+      }
+      if (SD) {
+        matrixSignatures['SparseMatrix, DenseMatrix'] = (x, y) => SD(...broadcast(y, x), elop, true);
+        matrixSignatures['SparseMatrix, Array'] = (x, y) => SD(...broadcast(matrix(y), x), elop, true);
+      }
+    } else {
+      // No elop, use this
+      // First the dense ones
+      matrixSignatures = {
+        'DenseMatrix, DenseMatrix': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...broadcast(x, y), self);
+        }),
+        'Array, Array': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...broadcast(matrix(x), matrix(y)), self).valueOf();
+        }),
+        'Array, DenseMatrix': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...broadcast(matrix(x), y), self);
+        }),
+        'DenseMatrix, Array': typed.referToSelf(self => (x, y) => {
+          return matAlgo13xDD(...broadcast(x, matrix(y)), self);
+        })
+      };
+      // Now incorporate sparse matrices
+      if (options.SS) {
+        matrixSignatures['SparseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.SS(...broadcast(x, y), self, false);
+        });
+      }
+      if (options.DS) {
+        matrixSignatures['DenseMatrix, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.DS(...broadcast(x, y), self, false);
+        });
+        matrixSignatures['Array, SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return options.DS(...broadcast(matrix(x), y), self, false);
+        });
+      }
+      if (SD) {
+        matrixSignatures['SparseMatrix, DenseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return SD(...broadcast(y, x), self, true);
+        });
+        matrixSignatures['SparseMatrix, Array'] = typed.referToSelf(self => (x, y) => {
+          return SD(...broadcast(matrix(y), x), self, true);
+        });
+      }
+    }
+
+    // Now add the scalars
+    var scalar = options.scalar || 'any';
+    var Ds = options.Ds || options.Ss;
+    if (Ds) {
+      if (elop) {
+        matrixSignatures['DenseMatrix,' + scalar] = (x, y) => matAlgo14xDs(x, y, elop, false);
+        matrixSignatures[scalar + ', DenseMatrix'] = (x, y) => matAlgo14xDs(y, x, elop, true);
+        matrixSignatures['Array,' + scalar] = (x, y) => matAlgo14xDs(matrix(x), y, elop, false).valueOf();
+        matrixSignatures[scalar + ', Array'] = (x, y) => matAlgo14xDs(matrix(y), x, elop, true).valueOf();
+      } else {
+        matrixSignatures['DenseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(x, y, self, false);
+        });
+        matrixSignatures[scalar + ', DenseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(y, x, self, true);
+        });
+        matrixSignatures['Array,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(matrix(x), y, self, false).valueOf();
+        });
+        matrixSignatures[scalar + ', Array'] = typed.referToSelf(self => (x, y) => {
+          return matAlgo14xDs(matrix(y), x, self, true).valueOf();
+        });
+      }
+    }
+    var sS = options.sS !== undefined ? options.sS : options.Ss;
+    if (elop) {
+      if (options.Ss) {
+        matrixSignatures['SparseMatrix,' + scalar] = (x, y) => options.Ss(x, y, elop, false);
+      }
+      if (sS) {
+        matrixSignatures[scalar + ', SparseMatrix'] = (x, y) => sS(y, x, elop, true);
+      }
+    } else {
+      if (options.Ss) {
+        matrixSignatures['SparseMatrix,' + scalar] = typed.referToSelf(self => (x, y) => {
+          return options.Ss(x, y, self, false);
+        });
+      }
+      if (sS) {
+        matrixSignatures[scalar + ', SparseMatrix'] = typed.referToSelf(self => (x, y) => {
+          return sS(y, x, self, true);
+        });
+      }
+    }
+    // Also pull in the scalar signatures if the operator is a typed function
+    if (elop && elop.signatures) {
+      extend(matrixSignatures, elop.signatures);
+    }
+    return matrixSignatures;
+  };
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/number.js b/node_modules/mathjs/lib/esm/type/number.js
new file mode 100644
index 0000000..b45212f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/number.js
@@ -0,0 +1,150 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+var name = 'number';
+var dependencies = ['typed'];
+
+/**
+ * Separates the radix, integer part, and fractional part of a non decimal number string
+ * @param {string} input string to parse
+ * @returns {object} the parts of the string or null if not a valid input
+ */
+function getNonDecimalNumberParts(input) {
+  var nonDecimalWithRadixMatch = input.match(/(0[box])([0-9a-fA-F]*)\.([0-9a-fA-F]*)/);
+  if (nonDecimalWithRadixMatch) {
+    var radix = {
+      '0b': 2,
+      '0o': 8,
+      '0x': 16
+    }[nonDecimalWithRadixMatch[1]];
+    var integerPart = nonDecimalWithRadixMatch[2];
+    var fractionalPart = nonDecimalWithRadixMatch[3];
+    return {
+      input,
+      radix,
+      integerPart,
+      fractionalPart
+    };
+  } else {
+    return null;
+  }
+}
+
+/**
+ * Makes a number from a radix, and integer part, and a fractional part
+ * @param {parts} [x] parts of the number string (from getNonDecimalNumberParts)
+ * @returns {number} the number
+ */
+function makeNumberFromNonDecimalParts(parts) {
+  var n = parseInt(parts.integerPart, parts.radix);
+  var f = 0;
+  for (var i = 0; i < parts.fractionalPart.length; i++) {
+    var digitValue = parseInt(parts.fractionalPart[i], parts.radix);
+    f += digitValue / Math.pow(parts.radix, i + 1);
+  }
+  var result = n + f;
+  if (isNaN(result)) {
+    throw new SyntaxError('String "' + parts.input + '" is not a valid number');
+  }
+  return result;
+}
+export var createNumber = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   *
+   * Syntax:
+   *
+   *    math.number(value)
+   *    math.number(unit, valuelessUnit)
+   *
+   * Examples:
+   *
+   *    math.number(2)                         // returns number 2
+   *    math.number('7.2')                     // returns number 7.2
+   *    math.number(true)                      // returns number 1
+   *    math.number([true, false, true, true]) // returns [1, 0, 1, 1]
+   *    math.number(math.unit('52cm'), 'm')    // returns 0.52
+   *
+   * See also:
+   *
+   *    bignumber, bigint, boolean, numeric, complex, index, matrix, string, unit
+   *
+   * @param {string | number | BigNumber | Fraction | boolean | Array | Matrix | Unit | null} [value]  Value to be converted
+   * @param {Unit | string} [valuelessUnit] A valueless unit, used to convert a unit to a number
+   * @return {number | Array | Matrix} The created number
+   */
+  var number = typed('number', {
+    '': function _() {
+      return 0;
+    },
+    number: function number(x) {
+      return x;
+    },
+    string: function string(x) {
+      if (x === 'NaN') return NaN;
+      var nonDecimalNumberParts = getNonDecimalNumberParts(x);
+      if (nonDecimalNumberParts) {
+        return makeNumberFromNonDecimalParts(nonDecimalNumberParts);
+      }
+      var size = 0;
+      var wordSizeSuffixMatch = x.match(/(0[box][0-9a-fA-F]*)i([0-9]*)/);
+      if (wordSizeSuffixMatch) {
+        // x includes a size suffix like 0xffffi32, so we extract
+        // the suffix and remove it from x
+        size = Number(wordSizeSuffixMatch[2]);
+        x = wordSizeSuffixMatch[1];
+      }
+      var num = Number(x);
+      if (isNaN(num)) {
+        throw new SyntaxError('String "' + x + '" is not a valid number');
+      }
+      if (wordSizeSuffixMatch) {
+        // x is a signed bin, oct, or hex literal
+        // num is the value of string x if x is interpreted as unsigned
+        if (num > 2 ** size - 1) {
+          // literal is too large for size suffix
+          throw new SyntaxError("String \"".concat(x, "\" is out of range"));
+        }
+        // check if the bit at index size - 1 is set and if so do the twos complement
+        if (num >= 2 ** (size - 1)) {
+          num = num - 2 ** size;
+        }
+      }
+      return num;
+    },
+    BigNumber: function BigNumber(x) {
+      return x.toNumber();
+    },
+    bigint: function bigint(x) {
+      return Number(x);
+    },
+    Fraction: function Fraction(x) {
+      return x.valueOf();
+    },
+    Unit: typed.referToSelf(self => x => {
+      var clone = x.clone();
+      clone.value = self(x.value);
+      return clone;
+    }),
+    null: function _null(x) {
+      return 0;
+    },
+    'Unit, string | Unit': function Unit_string__Unit(unit, valuelessUnit) {
+      return unit.toNumber(valuelessUnit);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+
+  // reviver function to parse a JSON object like:
+  //
+  //     {"mathjs":"number","value":"2.3"}
+  //
+  // into a number 2.3
+  number.fromJSON = function (json) {
+    return parseFloat(json.value);
+  };
+  return number;
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js b/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js
new file mode 100644
index 0000000..60f2f69
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/resultset/ResultSet.js
@@ -0,0 +1,68 @@
+import { factory } from '../../utils/factory.js';
+var name = 'ResultSet';
+var dependencies = [];
+export var createResultSet = /* #__PURE__ */factory(name, dependencies, () => {
+  /**
+   * A ResultSet contains a list or results
+   * @class ResultSet
+   * @param {Array} entries
+   * @constructor ResultSet
+   */
+  function ResultSet(entries) {
+    if (!(this instanceof ResultSet)) {
+      throw new SyntaxError('Constructor must be called with the new operator');
+    }
+    this.entries = entries || [];
+  }
+
+  /**
+   * Attach type information
+   */
+  ResultSet.prototype.type = 'ResultSet';
+  ResultSet.prototype.isResultSet = true;
+
+  /**
+   * Returns the array with results hold by this ResultSet
+   * @memberof ResultSet
+   * @returns {Array} entries
+   */
+  ResultSet.prototype.valueOf = function () {
+    return this.entries;
+  };
+
+  /**
+   * Returns the stringified results of the ResultSet
+   * @memberof ResultSet
+   * @returns {string} string
+   */
+  ResultSet.prototype.toString = function () {
+    return '[' + this.entries.map(String).join(', ') + ']';
+  };
+
+  /**
+   * Get a JSON representation of the ResultSet
+   * @memberof ResultSet
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "ResultSet", "entries": [...]}`
+   */
+  ResultSet.prototype.toJSON = function () {
+    return {
+      mathjs: 'ResultSet',
+      entries: this.entries
+    };
+  };
+
+  /**
+   * Instantiate a ResultSet from a JSON object
+   * @memberof ResultSet
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "ResultSet", "entries": [...]}`
+   * @return {ResultSet}
+   */
+  ResultSet.fromJSON = function (json) {
+    return new ResultSet(json.entries);
+  };
+  return ResultSet;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/string.js b/node_modules/mathjs/lib/esm/type/string.js
new file mode 100644
index 0000000..b55c3dc
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/string.js
@@ -0,0 +1,54 @@
+import { factory } from '../utils/factory.js';
+import { deepMap } from '../utils/collection.js';
+import { format } from '../utils/number.js';
+var name = 'string';
+var dependencies = ['typed'];
+export var createString = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Create a string or convert any object into a string.
+   * Elements of Arrays and Matrices are processed element wise.
+   *
+   * Syntax:
+   *
+   *    math.string(value)
+   *
+   * Examples:
+   *
+   *    math.string(4.2)                // returns string '4.2'
+   *    math.string(math.complex(3, 2)) // returns string '3 + 2i'
+   *
+   *    const u = math.unit(5, 'km')
+   *    math.string(u.to('m'))          // returns string '5000 m'
+   *
+   *    math.string([true, false])      // returns ['true', 'false']
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, unit
+   *
+   * @param {* | Array | Matrix | null} [value]  A value to convert to a string
+   * @return {string | Array | Matrix} The created string
+   */
+  return typed(name, {
+    '': function _() {
+      return '';
+    },
+    number: format,
+    null: function _null(x) {
+      return 'null';
+    },
+    boolean: function boolean(x) {
+      return x + '';
+    },
+    string: function string(x) {
+      return x;
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self)),
+    any: function any(x) {
+      return String(x);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/Unit.js b/node_modules/mathjs/lib/esm/type/unit/Unit.js
new file mode 100644
index 0000000..af3d35f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/Unit.js
@@ -0,0 +1,3983 @@
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+import _extends from "@babel/runtime/helpers/extends";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+import { isComplex, isUnit, typeOf } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+import { memoize } from '../../utils/function.js';
+import { endsWith } from '../../utils/string.js';
+import { clone, hasOwnProperty } from '../../utils/object.js';
+import { createBigNumberPi as createPi } from '../../utils/bignumber/constants.js';
+var name = 'Unit';
+var dependencies = ['?on', 'config', 'addScalar', 'subtractScalar', 'multiplyScalar', 'divideScalar', 'pow', 'abs', 'fix', 'round', 'equal', 'isNumeric', 'format', 'toBest', 'number', 'Complex', 'BigNumber', 'Fraction'];
+export var createUnitClass = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    on,
+    config,
+    addScalar,
+    subtractScalar,
+    multiplyScalar,
+    divideScalar,
+    pow,
+    abs,
+    fix,
+    round,
+    equal,
+    isNumeric,
+    format,
+    toBest,
+    number: _number,
+    Complex,
+    BigNumber: _BigNumber,
+    Fraction: _Fraction
+  } = _ref;
+  var toNumber = _number;
+  /**
+   * A unit can be constructed in the following ways:
+   *
+   *     const a = new Unit(value, valuelessUnit)
+   *     const b = new Unit(null, valuelessUnit)
+   *     const c = Unit.parse(str)
+   *
+   * Example usage:
+   *
+   *     const a = new Unit(5, 'cm')               // 50 mm
+   *     const b = Unit.parse('23 kg')             // 23 kg
+   *     const c = math.in(a, new Unit(null, 'm')  // 0.05 m
+   *     const d = new Unit(9.81, "m/s^2")         // 9.81 m/s^2
+   *
+   * @class Unit
+   * @constructor Unit
+   * @param {number | BigNumber | Fraction | Complex | boolean} [value]  A value like 5.2
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   */
+  function Unit(value, valuelessUnit) {
+    if (!(this instanceof Unit)) {
+      throw new Error('Constructor must be called with the new operator');
+    }
+    if (!(value === null || value === undefined || isNumeric(value) || isComplex(value))) {
+      throw new TypeError('First parameter in Unit constructor must be number, BigNumber, Fraction, Complex, or undefined');
+    }
+    this.fixPrefix = false; // if true, function format will not search for the
+    // best prefix but leave it as initially provided.
+    // fixPrefix is set true by the method Unit.to
+
+    // The justification behind this is that if the constructor is explicitly called,
+    // the caller wishes the units to be returned exactly as supplied.
+    this.skipAutomaticSimplification = true;
+    if (valuelessUnit === undefined) {
+      this.units = [];
+      this.dimensions = BASE_DIMENSIONS.map(x => 0);
+    } else if (typeof valuelessUnit === 'string') {
+      var u = Unit.parse(valuelessUnit);
+      this.units = u.units;
+      this.dimensions = u.dimensions;
+    } else if (isUnit(valuelessUnit) && valuelessUnit.value === null) {
+      // clone from valuelessUnit
+      this.fixPrefix = valuelessUnit.fixPrefix;
+      this.skipAutomaticSimplification = valuelessUnit.skipAutomaticSimplification;
+      this.dimensions = valuelessUnit.dimensions.slice(0);
+      this.units = valuelessUnit.units.map(u => _extends({}, u));
+    } else {
+      throw new TypeError('Second parameter in Unit constructor must be a string or valueless Unit');
+    }
+    this.value = this._normalize(value);
+  }
+
+  /**
+   * Attach type information
+   */
+  Object.defineProperty(Unit, 'name', {
+    value: 'Unit'
+  });
+  Unit.prototype.constructor = Unit;
+  Unit.prototype.type = 'Unit';
+  Unit.prototype.isUnit = true;
+
+  // private variables and functions for the Unit parser
+  var text, index, c;
+  function skipWhitespace() {
+    while (c === ' ' || c === '\t') {
+      next();
+    }
+  }
+  function isDigitDot(c) {
+    return c >= '0' && c <= '9' || c === '.';
+  }
+  function isDigit(c) {
+    return c >= '0' && c <= '9';
+  }
+  function next() {
+    index++;
+    c = text.charAt(index);
+  }
+  function revert(oldIndex) {
+    index = oldIndex;
+    c = text.charAt(index);
+  }
+  function parseNumber() {
+    var number = '';
+    var oldIndex = index;
+    if (c === '+') {
+      next();
+    } else if (c === '-') {
+      number += c;
+      next();
+    }
+    if (!isDigitDot(c)) {
+      // a + or - must be followed by a digit
+      revert(oldIndex);
+      return null;
+    }
+
+    // get number, can have a single dot
+    if (c === '.') {
+      number += c;
+      next();
+      if (!isDigit(c)) {
+        // this is no legal number, it is just a dot
+        revert(oldIndex);
+        return null;
+      }
+    } else {
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+      if (c === '.') {
+        number += c;
+        next();
+      }
+    }
+    while (isDigit(c)) {
+      number += c;
+      next();
+    }
+
+    // check for exponential notation like "2.3e-4" or "1.23e50"
+    if (c === 'E' || c === 'e') {
+      // The grammar branches here. This could either be part of an exponent or the start of a unit that begins with the letter e, such as "4exabytes"
+
+      var tentativeNumber = '';
+      var tentativeIndex = index;
+      tentativeNumber += c;
+      next();
+      if (c === '+' || c === '-') {
+        tentativeNumber += c;
+        next();
+      }
+
+      // Scientific notation MUST be followed by an exponent (otherwise we assume it is not scientific notation)
+      if (!isDigit(c)) {
+        // The e or E must belong to something else, so return the number without the e or E.
+        revert(tentativeIndex);
+        return number;
+      }
+
+      // We can now safely say that this is scientific notation.
+      number = number + tentativeNumber;
+      while (isDigit(c)) {
+        number += c;
+        next();
+      }
+    }
+    return number;
+  }
+  function parseUnit() {
+    var unitName = '';
+
+    // Alphanumeric characters only; matches [a-zA-Z0-9]
+    while (isDigit(c) || Unit.isValidAlpha(c)) {
+      unitName += c;
+      next();
+    }
+
+    // Must begin with [a-zA-Z]
+    var firstC = unitName.charAt(0);
+    if (Unit.isValidAlpha(firstC)) {
+      return unitName;
+    } else {
+      return null;
+    }
+  }
+  function parseCharacter(toFind) {
+    if (c === toFind) {
+      next();
+      return toFind;
+    } else {
+      return null;
+    }
+  }
+
+  /**
+   * Parse a string into a unit. The value of the unit is parsed as number,
+   * BigNumber, or Fraction depending on the math.js config setting `number`.
+   *
+   * Throws an exception if the provided string does not contain a valid unit or
+   * cannot be parsed.
+   * @memberof Unit
+   * @param {string} str        A string like "5.2 inch", "4e2 cm/s^2"
+   * @return {Unit} unit
+   */
+  Unit.parse = function (str, options) {
+    options = options || {};
+    text = str;
+    index = -1;
+    c = '';
+    if (typeof text !== 'string') {
+      throw new TypeError('Invalid argument in Unit.parse, string expected');
+    }
+    var unit = new Unit();
+    unit.units = [];
+    var powerMultiplierCurrent = 1;
+    var expectingUnit = false;
+
+    // A unit should follow this pattern:
+    // [number] ...[ [*/] unit[^number] ]
+    // unit[^number] ... [ [*/] unit[^number] ]
+
+    // Rules:
+    // number is any floating point number.
+    // unit is any alphanumeric string beginning with an alpha. Units with names like e3 should be avoided because they look like the exponent of a floating point number!
+    // The string may optionally begin with a number.
+    // Each unit may optionally be followed by ^number.
+    // Whitespace or a forward slash is recommended between consecutive units, although the following technically is parseable:
+    //   2m^2kg/s^2
+    // it is not good form. If a unit starts with e, then it could be confused as a floating point number:
+    //   4erg
+
+    next();
+    skipWhitespace();
+
+    // Optional number at the start of the string
+    var valueStr = parseNumber();
+    var value = null;
+    if (valueStr) {
+      if (config.number === 'BigNumber') {
+        value = new _BigNumber(valueStr);
+      } else if (config.number === 'Fraction') {
+        try {
+          // not all numbers can be turned in Fractions, for example very small numbers not
+          value = new _Fraction(valueStr);
+        } catch (err) {
+          value = parseFloat(valueStr);
+        }
+      } else {
+        // number
+        value = parseFloat(valueStr);
+      }
+      skipWhitespace(); // Whitespace is not required here
+
+      // handle multiplication or division right after the value, like '1/s'
+      if (parseCharacter('*')) {
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      }
+    }
+
+    // Stack to keep track of powerMultipliers applied to each parentheses group
+    var powerMultiplierStack = [];
+
+    // Running product of all elements in powerMultiplierStack
+    var powerMultiplierStackProduct = 1;
+    while (true) {
+      skipWhitespace();
+
+      // Check for and consume opening parentheses, pushing powerMultiplierCurrent to the stack
+      // A '(' will always appear directly before a unit.
+      while (c === '(') {
+        powerMultiplierStack.push(powerMultiplierCurrent);
+        powerMultiplierStackProduct *= powerMultiplierCurrent;
+        powerMultiplierCurrent = 1;
+        next();
+        skipWhitespace();
+      }
+
+      // Is there something here?
+      var uStr = void 0;
+      if (c) {
+        var oldC = c;
+        uStr = parseUnit();
+        if (uStr === null) {
+          throw new SyntaxError('Unexpected "' + oldC + '" in "' + text + '" at index ' + index.toString());
+        }
+      } else {
+        // End of input.
+        break;
+      }
+
+      // Verify the unit exists and get the prefix (if any)
+      var res = _findUnit(uStr);
+      if (res === null) {
+        // Unit not found.
+        throw new SyntaxError('Unit "' + uStr + '" not found.');
+      }
+      var power = powerMultiplierCurrent * powerMultiplierStackProduct;
+      // Is there a "^ number"?
+      skipWhitespace();
+      if (parseCharacter('^')) {
+        skipWhitespace();
+        var p = parseNumber();
+        if (p === null) {
+          // No valid number found for the power!
+          throw new SyntaxError('In "' + str + '", "^" must be followed by a floating-point number');
+        }
+        power *= p;
+      }
+
+      // Add the unit to the list
+      unit.units.push({
+        unit: res.unit,
+        prefix: res.prefix,
+        power
+      });
+      for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+        unit.dimensions[i] += (res.unit.dimensions[i] || 0) * power;
+      }
+
+      // Check for and consume closing parentheses, popping from the stack.
+      // A ')' will always follow a unit.
+      skipWhitespace();
+      while (c === ')') {
+        if (powerMultiplierStack.length === 0) {
+          throw new SyntaxError('Unmatched ")" in "' + text + '" at index ' + index.toString());
+        }
+        powerMultiplierStackProduct /= powerMultiplierStack.pop();
+        next();
+        skipWhitespace();
+      }
+
+      // "*" and "/" should mean we are expecting something to come next.
+      // Is there a forward slash? If so, negate powerMultiplierCurrent. The next unit or paren group is in the denominator.
+      expectingUnit = false;
+      if (parseCharacter('*')) {
+        // explicit multiplication
+        powerMultiplierCurrent = 1;
+        expectingUnit = true;
+      } else if (parseCharacter('/')) {
+        // division
+        powerMultiplierCurrent = -1;
+        expectingUnit = true;
+      } else {
+        // implicit multiplication
+        powerMultiplierCurrent = 1;
+      }
+
+      // Replace the unit into the auto unit system
+      if (res.unit.base) {
+        var baseDim = res.unit.base.key;
+        UNIT_SYSTEMS.auto[baseDim] = {
+          unit: res.unit,
+          prefix: res.prefix
+        };
+      }
+    }
+
+    // Has the string been entirely consumed?
+    skipWhitespace();
+    if (c) {
+      throw new SyntaxError('Could not parse: "' + str + '"');
+    }
+
+    // Is there a trailing slash?
+    if (expectingUnit) {
+      throw new SyntaxError('Trailing characters: "' + str + '"');
+    }
+
+    // Is the parentheses stack empty?
+    if (powerMultiplierStack.length !== 0) {
+      throw new SyntaxError('Unmatched "(" in "' + text + '"');
+    }
+
+    // Are there any units at all?
+    if (unit.units.length === 0 && !options.allowNoUnits) {
+      throw new SyntaxError('"' + str + '" contains no units');
+    }
+    unit.value = value !== undefined ? unit._normalize(value) : null;
+    return unit;
+  };
+
+  /**
+   * create a copy of this unit
+   * @memberof Unit
+   * @return {Unit} Returns a cloned version of the unit
+   */
+  Unit.prototype.clone = function () {
+    var unit = new Unit();
+    unit.fixPrefix = this.fixPrefix;
+    unit.skipAutomaticSimplification = this.skipAutomaticSimplification;
+    unit.value = clone(this.value);
+    unit.dimensions = this.dimensions.slice(0);
+    unit.units = [];
+    for (var i = 0; i < this.units.length; i++) {
+      unit.units[i] = {};
+      for (var p in this.units[i]) {
+        if (hasOwnProperty(this.units[i], p)) {
+          unit.units[i][p] = this.units[i][p];
+        }
+      }
+    }
+    return unit;
+  };
+
+  /**
+   * Return the type of the value of this unit
+   *
+   * @memberof Unit
+   * @return {string} type of the value of the unit
+   */
+  Unit.prototype.valueType = function () {
+    return typeOf(this.value);
+  };
+
+  /**
+   * Return whether the unit is derived (such as m/s, or cm^2, but not N)
+   * @memberof Unit
+   * @return {boolean} True if the unit is derived
+   * @private
+   */
+  Unit.prototype._isDerived = function () {
+    if (this.units.length === 0) {
+      return false;
+    }
+    return this.units.length > 1 || Math.abs(this.units[0].power - 1.0) > 1e-15;
+  };
+
+  /**
+   * Normalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number | BigNumber | Fraction | boolean} value
+   * @return {number | BigNumber | Fraction | boolean} normalized value
+   * @private
+   */
+  Unit.prototype._normalize = function (value) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+    var res = value;
+    var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = multiplyScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+    return res;
+  };
+
+  /**
+   * Denormalize a value, based on its currently set unit(s)
+   * @memberof Unit
+   * @param {number} value
+   * @param {number} [prefixValue]    Optional prefix value to be used (ignored if this is a derived unit)
+   * @return {number} denormalized value
+   * @private
+   */
+  Unit.prototype._denormalize = function (value, prefixValue) {
+    if (value === null || value === undefined || this.units.length === 0) {
+      return value;
+    }
+    var res = value;
+    var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+    for (var i = 0; i < this.units.length; i++) {
+      var unitValue = convert(this.units[i].unit.value);
+      var unitPrefixValue = convert(this.units[i].prefix.value);
+      var unitPower = convert(this.units[i].power);
+      res = divideScalar(res, pow(multiplyScalar(unitValue, unitPrefixValue), unitPower));
+    }
+    return res;
+  };
+
+  /**
+   * Find a unit from a string
+   * @memberof Unit
+   * @param {string} str              A string like 'cm' or 'inch'
+   * @returns {Object | null} result  When found, an object with fields unit and
+   *                                  prefix is returned. Else, null is returned.
+   * @private
+   */
+  var _findUnit = memoize(str => {
+    // First, match units names exactly. For example, a user could define 'mm' as 10^-4 m, which is silly, but then we would want 'mm' to match the user-defined unit.
+    if (hasOwnProperty(UNITS, str)) {
+      var unit = UNITS[str];
+      var prefix = unit.prefixes[''];
+      return {
+        unit,
+        prefix
+      };
+    }
+    for (var _name in UNITS) {
+      if (hasOwnProperty(UNITS, _name)) {
+        if (endsWith(str, _name)) {
+          var _unit = UNITS[_name];
+          var prefixLen = str.length - _name.length;
+          var prefixName = str.substring(0, prefixLen);
+          var _prefix = hasOwnProperty(_unit.prefixes, prefixName) ? _unit.prefixes[prefixName] : undefined;
+          if (_prefix !== undefined) {
+            // store unit, prefix, and value
+            return {
+              unit: _unit,
+              prefix: _prefix
+            };
+          }
+        }
+      }
+    }
+    return null;
+  }, {
+    hasher: args => args[0],
+    limit: 100
+  });
+
+  /**
+   * Test if the given expression is a unit.
+   * The unit can have a prefix but cannot have a value.
+   * @memberof Unit
+   * @param {string} name   A string to be tested whether it is a value less unit.
+   *                        The unit can have prefix, like "cm"
+   * @return {boolean}      true if the given string is a unit
+   */
+  Unit.isValuelessUnit = function (name) {
+    return _findUnit(name) !== null;
+  };
+
+  /**
+   * check if this unit has given base unit
+   * If this unit is a derived unit, this will ALWAYS return false, since by definition base units are not derived.
+   * @memberof Unit
+   * @param {BASE_UNIT | string | undefined} base
+   */
+  Unit.prototype.hasBase = function (base) {
+    if (typeof base === 'string') {
+      base = BASE_UNITS[base];
+    }
+    if (!base) {
+      return false;
+    }
+
+    // All dimensions must be the same
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (base.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+    return true;
+  };
+
+  /**
+   * Check if this unit has a base or bases equal to another base or bases
+   * For derived units, the exponent on each base also must match
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if equal base
+   */
+  Unit.prototype.equalBase = function (other) {
+    // All dimensions must be the same
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      if (Math.abs((this.dimensions[i] || 0) - (other.dimensions[i] || 0)) > 1e-12) {
+        return false;
+      }
+    }
+    return true;
+  };
+
+  /**
+   * Check if this unit equals another unit
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {boolean} true if both units are equal
+   */
+  Unit.prototype.equals = function (other) {
+    return this.equalBase(other) && equal(this.value, other.value);
+  };
+
+  /**
+   * Multiply this unit with another one or with a scalar
+   * @memberof Unit
+   * @param {Unit} other
+   * @return {Unit} product of this unit and the other unit
+   */
+  Unit.prototype.multiply = function (_other) {
+    var res = this.clone();
+    var other = isUnit(_other) ? _other : new Unit(_other);
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) + (other.dimensions[i] || 0);
+    }
+
+    // Append other's units list onto res
+    for (var _i = 0; _i < other.units.length; _i++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread({}, other.units[_i]);
+      res.units.push(inverted);
+    }
+
+    // If at least one operand has a value, then the result should also have a value
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
+      res.value = multiplyScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+    if (isUnit(_other)) {
+      res.skipAutomaticSimplification = false;
+    }
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Divide a number by this unit
+   *
+   * @memberof Unit
+   * @param {numeric} numerator
+   * @param {unit} result of dividing numerator by this unit
+   */
+  Unit.prototype.divideInto = function (numerator) {
+    return new Unit(numerator).divide(this);
+  };
+
+  /**
+   * Divide this unit by another one
+   * @memberof Unit
+   * @param {Unit | numeric} other
+   * @return {Unit} result of dividing this unit by the other unit
+   */
+  Unit.prototype.divide = function (_other) {
+    var res = this.clone();
+    var other = isUnit(_other) ? _other : new Unit(_other);
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) - (other.dimensions[i] || 0);
+    }
+
+    // Invert and append other's units list onto res
+    for (var _i2 = 0; _i2 < other.units.length; _i2++) {
+      // Make a shallow copy of every unit
+      var inverted = _objectSpread(_objectSpread({}, other.units[_i2]), {}, {
+        power: -other.units[_i2].power
+      });
+      res.units.push(inverted);
+    }
+
+    // If at least one operand has a value, the result should have a value
+    if (this.value !== null || other.value !== null) {
+      var valThis = this.value === null ? this._normalize(one(other.value)) : this.value;
+      var valOther = other.value === null ? other._normalize(one(this.value)) : other.value;
+      res.value = divideScalar(valThis, valOther);
+    } else {
+      res.value = null;
+    }
+    if (isUnit(_other)) {
+      res.skipAutomaticSimplification = false;
+    }
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Calculate the power of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} p
+   * @returns {Unit}      The result: this^p
+   */
+  Unit.prototype.pow = function (p) {
+    var res = this.clone();
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      // Dimensions arrays may be of different lengths. Default to 0.
+      res.dimensions[i] = (this.dimensions[i] || 0) * p;
+    }
+
+    // Adjust the power of each unit in the list
+    for (var _i3 = 0; _i3 < res.units.length; _i3++) {
+      res.units[_i3].power *= p;
+    }
+    if (res.value !== null) {
+      res.value = pow(res.value, p);
+
+      // only allow numeric output, we don't want to return a Complex number
+      // if (!isNumeric(res.value)) {
+      //  res.value = NaN
+      // }
+      // Update: Complex supported now
+    } else {
+      res.value = null;
+    }
+    res.skipAutomaticSimplification = false;
+    return getNumericIfUnitless(res);
+  };
+
+  /**
+   * Return the numeric value of this unit if it is dimensionless, has a value, and config.predictable == false; or the original unit otherwise
+   * @param {Unit} unit
+   * @returns {number | Fraction | BigNumber | Unit}  The numeric value of the unit if conditions are met, or the original unit otherwise
+   */
+  function getNumericIfUnitless(unit) {
+    if (unit.equalBase(BASE_UNITS.NONE) && unit.value !== null && !config.predictable) {
+      return unit.value;
+    } else {
+      return unit;
+    }
+  }
+
+  /**
+   * Create a value one with the numeric type of `typeOfValue`.
+   * For example, `one(new BigNumber(3))` returns `BigNumber(1)`
+   * @param {number | Fraction | BigNumber} typeOfValue
+   * @returns {number | Fraction | BigNumber}
+   */
+  function one(typeOfValue) {
+    // TODO: this is a workaround to prevent the following BigNumber conversion error from throwing:
+    //  "TypeError: Cannot implicitly convert a number with >15 significant digits to BigNumber"
+    //  see https://github.com/josdejong/mathjs/issues/3450
+    //      https://github.com/josdejong/mathjs/pull/3375
+    var convert = Unit._getNumberConverter(typeOf(typeOfValue));
+    return convert(1);
+  }
+
+  /**
+   * Calculate the absolute value of a unit
+   * @memberof Unit
+   * @param {number | Fraction | BigNumber} x
+   * @returns {Unit}      The result: |x|, absolute value of x
+   */
+  Unit.prototype.abs = function () {
+    var ret = this.clone();
+    if (ret.value !== null) {
+      if (ret._isDerived() || ret.units.length === 0 || ret.units[0].unit.offset === 0) {
+        ret.value = abs(ret.value);
+      } else {
+        // To give the correct, but unexpected, results for units with an offset.
+        // For example, abs(-283.15 degC) = -263.15 degC !!!
+        // We must take the offset into consideration here
+        var convert = ret._numberConverter(); // convert to Fraction or BigNumber if needed
+        var unitValue = convert(ret.units[0].unit.value);
+        var nominalOffset = convert(ret.units[0].unit.offset);
+        var unitOffset = multiplyScalar(unitValue, nominalOffset);
+        ret.value = subtractScalar(abs(addScalar(ret.value, unitOffset)), unitOffset);
+      }
+    }
+    for (var i in ret.units) {
+      if (ret.units[i].unit.name === 'VA' || ret.units[i].unit.name === 'VAR') {
+        ret.units[i].unit = UNITS.W;
+      }
+    }
+    return ret;
+  };
+
+  /**
+   * Convert the unit to a specific unit name.
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit   A unit without value. Can have prefix, like "cm"
+   * @returns {Unit} Returns a clone of the unit with a fixed prefix and unit.
+   */
+  Unit.prototype.to = function (valuelessUnit) {
+    var value = this.value === null ? this._normalize(1) : this.value;
+    var other;
+    if (typeof valuelessUnit === 'string') {
+      other = Unit.parse(valuelessUnit);
+    } else if (isUnit(valuelessUnit)) {
+      other = valuelessUnit.clone();
+    } else {
+      throw new Error('String or Unit expected as parameter');
+    }
+    if (!this.equalBase(other)) {
+      throw new Error("Units do not match ('".concat(other.toString(), "' != '").concat(this.toString(), "')"));
+    }
+    if (other.value !== null) {
+      throw new Error('Cannot convert to a unit with a value');
+    }
+    if (this.value === null || this._isDerived() || this.units.length === 0 || other.units.length === 0 || this.units[0].unit.offset === other.units[0].unit.offset) {
+      other.value = clone(value);
+    } else {
+      /* Need to adjust value by difference in offset to convert */
+      var convert = Unit._getNumberConverter(typeOf(value)); // convert to Fraction or BigNumber if needed
+
+      var thisUnitValue = this.units[0].unit.value;
+      var thisNominalOffset = this.units[0].unit.offset;
+      var thisUnitOffset = multiplyScalar(thisUnitValue, thisNominalOffset);
+      var otherUnitValue = other.units[0].unit.value;
+      var otherNominalOffset = other.units[0].unit.offset;
+      var otherUnitOffset = multiplyScalar(otherUnitValue, otherNominalOffset);
+      other.value = addScalar(value, convert(subtractScalar(thisUnitOffset, otherUnitOffset)));
+    }
+    other.fixPrefix = true;
+    other.skipAutomaticSimplification = true;
+    return other;
+  };
+
+  /**
+   * Return the value of the unit when represented with given valueless unit
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number} Returns the unit value as number.
+   */
+  // TODO: deprecate Unit.toNumber? It's always better to use toNumeric
+  Unit.prototype.toNumber = function (valuelessUnit) {
+    return toNumber(this.toNumeric(valuelessUnit));
+  };
+
+  /**
+   * Return the value of the unit in the original numeric type
+   * @memberof Unit
+   * @param {string | Unit} valuelessUnit    For example 'cm' or 'inch'
+   * @return {number | BigNumber | Fraction} Returns the unit value
+   */
+  Unit.prototype.toNumeric = function (valuelessUnit) {
+    var other;
+    if (valuelessUnit) {
+      // Allow getting the numeric value without converting to a different unit
+      other = this.to(valuelessUnit);
+    } else {
+      other = this.clone();
+    }
+    if (other._isDerived() || other.units.length === 0) {
+      return other._denormalize(other.value);
+    } else {
+      return other._denormalize(other.value, other.units[0].prefix.value);
+    }
+  };
+
+  /**
+   * Get a string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.toString = function () {
+    return this.format();
+  };
+
+  /**
+   * Get a JSON representation of the unit
+   * @memberof Unit
+   * @returns {Object} Returns a JSON object structured as:
+   *                   `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   */
+  Unit.prototype.toJSON = function () {
+    return {
+      mathjs: 'Unit',
+      value: this._denormalize(this.value),
+      unit: this.units.length > 0 ? this.formatUnits() : null,
+      fixPrefix: this.fixPrefix
+    };
+  };
+
+  /**
+   * Instantiate a Unit from a JSON object
+   * @memberof Unit
+   * @param {Object} json  A JSON object structured as:
+   *                       `{"mathjs": "Unit", "value": 2, "unit": "cm", "fixPrefix": false}`
+   * @return {Unit}
+   */
+  Unit.fromJSON = function (json) {
+    var _json$unit;
+    var unit = new Unit(json.value, (_json$unit = json.unit) !== null && _json$unit !== void 0 ? _json$unit : undefined);
+    unit.fixPrefix = json.fixPrefix || false;
+    return unit;
+  };
+
+  /**
+   * Returns the string representation of the unit.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.valueOf = Unit.prototype.toString;
+
+  /**
+   * Simplify this Unit's unit list and return a new Unit with the simplified list.
+   * The returned Unit will contain a list of the "best" units for formatting.
+   */
+  Unit.prototype.simplify = function () {
+    var ret = this.clone();
+    var proposedUnitList = [];
+
+    // Search for a matching base
+    var matchingBase;
+    for (var key in currentUnitSystem) {
+      if (hasOwnProperty(currentUnitSystem, key)) {
+        if (ret.hasBase(BASE_UNITS[key])) {
+          matchingBase = key;
+          break;
+        }
+      }
+    }
+    if (matchingBase === 'NONE') {
+      ret.units = [];
+    } else {
+      var matchingUnit;
+      if (matchingBase) {
+        // Does the unit system have a matching unit?
+        if (hasOwnProperty(currentUnitSystem, matchingBase)) {
+          matchingUnit = currentUnitSystem[matchingBase];
+        }
+      }
+      if (matchingUnit) {
+        ret.units = [{
+          unit: matchingUnit.unit,
+          prefix: matchingUnit.prefix,
+          power: 1.0
+        }];
+      } else {
+        // Multiple units or units with powers are formatted like this:
+        // 5 (kg m^2) / (s^3 mol)
+        // Build an representation from the base units of the current unit system
+        var missingBaseDim = false;
+        for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+          var baseDim = BASE_DIMENSIONS[i];
+          if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+            if (hasOwnProperty(currentUnitSystem, baseDim)) {
+              proposedUnitList.push({
+                unit: currentUnitSystem[baseDim].unit,
+                prefix: currentUnitSystem[baseDim].prefix,
+                power: ret.dimensions[i] || 0
+              });
+            } else {
+              missingBaseDim = true;
+            }
+          }
+        }
+
+        // Is the proposed unit list "simpler" than the existing one?
+        if (proposedUnitList.length < ret.units.length && !missingBaseDim) {
+          // Replace this unit list with the proposed list
+          ret.units = proposedUnitList;
+        }
+      }
+    }
+    return ret;
+  };
+
+  /**
+   * Returns a new Unit in the SI system with the same value as this one
+   */
+  Unit.prototype.toSI = function () {
+    var ret = this.clone();
+    var proposedUnitList = [];
+
+    // Multiple units or units with powers are formatted like this:
+    // 5 (kg m^2) / (s^3 mol)
+    // Build an representation from the base units of the SI unit system
+    for (var i = 0; i < BASE_DIMENSIONS.length; i++) {
+      var baseDim = BASE_DIMENSIONS[i];
+      if (Math.abs(ret.dimensions[i] || 0) > 1e-12) {
+        if (hasOwnProperty(UNIT_SYSTEMS.si, baseDim)) {
+          proposedUnitList.push({
+            unit: UNIT_SYSTEMS.si[baseDim].unit,
+            prefix: UNIT_SYSTEMS.si[baseDim].prefix,
+            power: ret.dimensions[i] || 0
+          });
+        } else {
+          throw new Error('Cannot express custom unit ' + baseDim + ' in SI units');
+        }
+      }
+    }
+
+    // Replace this unit list with the proposed list
+    ret.units = proposedUnitList;
+    ret.fixPrefix = true;
+    ret.skipAutomaticSimplification = true;
+    if (this.value !== null) {
+      ret.value = null;
+      return this.to(ret);
+    }
+    return ret;
+  };
+
+  /**
+   * Get a string representation of the units of this Unit, without the value. The unit list is formatted as-is without first being simplified.
+   * @memberof Unit
+   * @return {string}
+   */
+  Unit.prototype.formatUnits = function () {
+    var strNum = '';
+    var strDen = '';
+    var nNum = 0;
+    var nDen = 0;
+    for (var i = 0; i < this.units.length; i++) {
+      if (this.units[i].power > 0) {
+        nNum++;
+        strNum += ' ' + this.units[i].prefix.name + this.units[i].unit.name;
+        if (Math.abs(this.units[i].power - 1.0) > 1e-15) {
+          strNum += '^' + this.units[i].power;
+        }
+      } else if (this.units[i].power < 0) {
+        nDen++;
+      }
+    }
+    if (nDen > 0) {
+      for (var _i4 = 0; _i4 < this.units.length; _i4++) {
+        if (this.units[_i4].power < 0) {
+          if (nNum > 0) {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+            if (Math.abs(this.units[_i4].power + 1.0) > 1e-15) {
+              strDen += '^' + -this.units[_i4].power;
+            }
+          } else {
+            strDen += ' ' + this.units[_i4].prefix.name + this.units[_i4].unit.name;
+            strDen += '^' + this.units[_i4].power;
+          }
+        }
+      }
+    }
+    // Remove leading " "
+    strNum = strNum.substr(1);
+    strDen = strDen.substr(1);
+
+    // Add parans for better copy/paste back into evaluate, for example, or for better pretty print formatting
+    if (nNum > 1 && nDen > 0) {
+      strNum = '(' + strNum + ')';
+    }
+    if (nDen > 1 && nNum > 0) {
+      strDen = '(' + strDen + ')';
+    }
+    var str = strNum;
+    if (nNum > 0 && nDen > 0) {
+      str += ' / ';
+    }
+    str += strDen;
+    return str;
+  };
+
+  /**
+   * Get a unit, with optional formatting options.
+   * @memberof Unit
+   * @param {string[] | Unit[]} [units]  Array of units strings or valueLess Unit objects in wich choose the best one
+   * @param {Object} [options]  Options for parsing the unit. See parseUnit for details.
+   *
+   * @return {Unit} Returns a new Unit with the given value and unit.
+   */
+  Unit.prototype.toBest = function () {
+    var unitList = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    if (unitList && !Array.isArray(unitList)) {
+      throw new Error('Invalid unit type. Expected string or Unit.');
+    }
+    var startPrefixes = this.units[0].unit.prefixes;
+    if (unitList && unitList.length > 0) {
+      var unitObjects = unitList.map(u => {
+        var unit = null;
+        if (typeof u === 'string') {
+          unit = Unit.parse(u);
+          if (!unit) {
+            throw new Error('Invalid unit type. Expected compatible string or Unit.');
+          }
+        } else if (!isUnit(u)) {
+          throw new Error('Invalid unit type. Expected compatible string or Unit.');
+        }
+        if (unit === null) {
+          unit = u.clone();
+        }
+        try {
+          this.to(unit.formatUnits());
+          return unit;
+        } catch (e) {
+          throw new Error('Invalid unit type. Expected compatible string or Unit.');
+        }
+      });
+      var prefixes = unitObjects.map(el => el.units[0].prefix);
+      this.units[0].unit.prefixes = prefixes.reduce((acc, prefix) => {
+        acc[prefix.name] = prefix;
+        return acc;
+      }, {});
+      this.units[0].prefix = prefixes[0];
+    }
+    var result = formatBest(this, options).simp;
+    this.units[0].unit.prefixes = startPrefixes;
+    result.fixPrefix = true;
+    return result;
+  };
+  /**
+   * Get a string representation of the Unit, with optional formatting options.
+   * @memberof Unit
+   * @param {Object | number | Function} [options]  Formatting options. See
+   *                                                lib/utils/number:format for a
+   *                                                description of the available
+   *                                                options.
+   * @return {string}
+   */
+  Unit.prototype.format = function (options) {
+    var {
+      simp,
+      valueStr,
+      unitStr
+    } = formatBest(this, options);
+    var str = valueStr;
+    if (simp.value && isComplex(simp.value)) {
+      str = '(' + str + ')'; // Surround complex values with ( ) to enable better parsing
+    }
+    if (unitStr.length > 0 && str.length > 0) {
+      str += ' ';
+    }
+    str += unitStr;
+    return str;
+  };
+
+  /**
+  * Helper function to normalize a unit for conversion and formatting
+  * @param {Unit} unit The unit to be normalized
+  * @return {Object} Object with normalized unit and value
+  * @private
+  */
+  function formatBest(unit) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+    // Simplfy the unit list, unless it is valueless or was created directly in the
+    // constructor or as the result of to or toSI
+    var simp = unit.skipAutomaticSimplification || unit.value === null ? unit.clone() : unit.simplify();
+
+    // Apply some custom logic for handling VA and VAR. The goal is to express the value of the unit as a real value, if possible. Otherwise, use a real-valued unit instead of a complex-valued one.
+    handleVAandVARUnits(simp);
+    // Now apply the best prefix
+    // Units must have only one unit and not have the fixPrefix flag set
+    applyBestPrefixIfNeeded(simp, options.offset);
+    var value = simp._denormalize(simp.value);
+    var valueStr = simp.value !== null ? format(value, options || {}) : '';
+    var unitStr = simp.formatUnits();
+    return {
+      simp,
+      valueStr,
+      unitStr
+    };
+  }
+
+  /**
+   * Helper to handle VA and VAR units
+   * @param {Unit} simp The unit to be normalized
+   */
+  function handleVAandVARUnits(simp) {
+    var isImaginary = false;
+    if (typeof simp.value !== 'undefined' && simp.value !== null && isComplex(simp.value)) {
+      // TODO: Make this better, for example, use relative magnitude of re and im rather than absolute
+      isImaginary = Math.abs(simp.value.re) < 1e-14;
+    }
+    for (var i in simp.units) {
+      if (hasOwnProperty(simp.units, i)) {
+        if (simp.units[i].unit) {
+          if (simp.units[i].unit.name === 'VA' && isImaginary) {
+            simp.units[i].unit = UNITS.VAR;
+          } else if (simp.units[i].unit.name === 'VAR' && !isImaginary) {
+            simp.units[i].unit = UNITS.VA;
+          }
+        }
+      }
+    }
+  }
+
+  /**
+   * Helper to apply the best prefix if needed
+   * @param {Unit} simp The unit to be normalized
+   */
+  function applyBestPrefixIfNeeded(simp, offset) {
+    if (simp.units.length === 1 && !simp.fixPrefix) {
+      // Units must have integer powers, otherwise the prefix will change the
+      // outputted value by not-an-integer-power-of-ten
+      if (Math.abs(simp.units[0].power - Math.round(simp.units[0].power)) < 1e-14) {
+        // Apply the best prefix
+        simp.units[0].prefix = simp._bestPrefix(offset);
+      }
+    }
+  }
+
+  /**
+   * Calculate the best prefix using current value.
+   * @memberof Unit
+   * @returns {Object} prefix
+   * @param {number} [offset]  Optional offset for the best prefix calculation (default 1.2)
+   * @private
+   */
+  Unit.prototype._bestPrefix = function () {
+    var offset = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 1.2;
+    if (this.units.length !== 1) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+    if (Math.abs(this.units[0].power - Math.round(this.units[0].power)) >= 1e-14) {
+      throw new Error('Can only compute the best prefix for single units with integer powers, like kg, s^2, N^-1, and so forth!');
+    }
+
+    // find the best prefix value (resulting in the value of which
+    // the absolute value of the log10 is closest to zero,
+    // though with a little offset of 1.2 for nicer values: you get a
+    // sequence 1mm 100mm 500mm 0.6m 1m 10m 100m 500m 0.6km 1km ...
+
+    // Note: the units value can be any numeric type, but to find the best
+    // prefix it's enough to work with limited precision of a regular number
+    // Update: using mathjs abs since we also allow complex numbers
+    var absValue = this.value !== null ? abs(this.value) : 0;
+    var absUnitValue = abs(this.units[0].unit.value);
+    var bestPrefix = this.units[0].prefix;
+    if (absValue === 0) {
+      return bestPrefix;
+    }
+    var power = this.units[0].power;
+    var bestDiff = Math.log(absValue / Math.pow(bestPrefix.value * absUnitValue, power)) / Math.LN10 - offset;
+    if (bestDiff > -2.200001 && bestDiff < 1.800001) return bestPrefix; // Allow the original prefix
+    bestDiff = Math.abs(bestDiff);
+    var prefixes = this.units[0].unit.prefixes;
+    for (var p in prefixes) {
+      if (hasOwnProperty(prefixes, p)) {
+        var prefix = prefixes[p];
+        if (prefix.scientific) {
+          var diff = Math.abs(Math.log(absValue / Math.pow(prefix.value * absUnitValue, power)) / Math.LN10 - offset);
+          if (diff < bestDiff || diff === bestDiff && prefix.name.length < bestPrefix.name.length) {
+            // choose the prefix with the smallest diff, or if equal, choose the one
+            // with the shortest name (can happen with SHORTLONG for example)
+            bestPrefix = prefix;
+            bestDiff = diff;
+          }
+        }
+      }
+    }
+    return bestPrefix;
+  };
+
+  /**
+   * Returns an array of units whose sum is equal to this unit
+   * @memberof Unit
+   * @param {Array} [parts] An array of strings or valueless units.
+   *
+   *   Example:
+   *
+   *   const u = new Unit(1, 'm')
+   *   u.splitUnit(['feet', 'inch'])
+   *     [ 3 feet, 3.3700787401575 inch ]
+   *
+   * @return {Array} An array of units.
+   */
+  Unit.prototype.splitUnit = function (parts) {
+    var x = this.clone();
+    var ret = [];
+    for (var i = 0; i < parts.length; i++) {
+      // Convert x to the requested unit
+      x = x.to(parts[i]);
+      if (i === parts.length - 1) break;
+
+      // Get the numeric value of this unit
+      var xNumeric = x.toNumeric();
+
+      // Check to see if xNumeric is nearly equal to an integer,
+      // since fix can incorrectly round down if there is round-off error
+      var xRounded = round(xNumeric);
+      var xFixed = void 0;
+      var isNearlyEqual = equal(xRounded, xNumeric);
+      if (isNearlyEqual) {
+        xFixed = xRounded;
+      } else {
+        xFixed = fix(x.toNumeric());
+      }
+      var y = new Unit(xFixed, parts[i].toString());
+      ret.push(y);
+      x = subtractScalar(x, y);
+    }
+
+    // This little bit fixes a bug where the remainder should be 0 but is a little bit off.
+    // But instead of comparing x, the remainder, with zero--we will compare the sum of
+    // all the parts so far with the original value. If they are nearly equal,
+    // we set the remainder to 0.
+    var testSum = 0;
+    for (var _i5 = 0; _i5 < ret.length; _i5++) {
+      testSum = addScalar(testSum, ret[_i5].value);
+    }
+    if (equal(testSum, this.value)) {
+      x.value = 0;
+    }
+    ret.push(x);
+    return ret;
+  };
+  var PREFIXES = {
+    NONE: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      }
+    },
+    SHORT: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e1,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e2,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e27,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e30,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-1,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-2,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-3,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-6,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-9,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-12,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-15,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-18,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-21,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-24,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-27,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-30,
+        scientific: true
+      }
+    },
+    LONG: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      deca: {
+        name: 'deca',
+        value: 1e1,
+        scientific: false
+      },
+      hecto: {
+        name: 'hecto',
+        value: 1e2,
+        scientific: false
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      },
+      ronna: {
+        name: 'ronna',
+        value: 1e27,
+        scientific: true
+      },
+      quetta: {
+        name: 'quetta',
+        value: 1e30,
+        scientific: true
+      },
+      deci: {
+        name: 'deci',
+        value: 1e-1,
+        scientific: false
+      },
+      centi: {
+        name: 'centi',
+        value: 1e-2,
+        scientific: false
+      },
+      milli: {
+        name: 'milli',
+        value: 1e-3,
+        scientific: true
+      },
+      micro: {
+        name: 'micro',
+        value: 1e-6,
+        scientific: true
+      },
+      nano: {
+        name: 'nano',
+        value: 1e-9,
+        scientific: true
+      },
+      pico: {
+        name: 'pico',
+        value: 1e-12,
+        scientific: true
+      },
+      femto: {
+        name: 'femto',
+        value: 1e-15,
+        scientific: true
+      },
+      atto: {
+        name: 'atto',
+        value: 1e-18,
+        scientific: true
+      },
+      zepto: {
+        name: 'zepto',
+        value: 1e-21,
+        scientific: true
+      },
+      yocto: {
+        name: 'yocto',
+        value: 1e-24,
+        scientific: true
+      },
+      ronto: {
+        name: 'ronto',
+        value: 1e-27,
+        scientific: true
+      },
+      quecto: {
+        name: 'quecto',
+        value: 1e-30,
+        scientific: true
+      }
+    },
+    SQUARED: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e2,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e4,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e6,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e12,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e18,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e24,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e30,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e36,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e42,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e48,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e54,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e60,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-2,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-4,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-6,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-12,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-18,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-24,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-30,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-36,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-42,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-48,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-54,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-60,
+        scientific: true
+      }
+    },
+    CUBIC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      da: {
+        name: 'da',
+        value: 1e3,
+        scientific: false
+      },
+      h: {
+        name: 'h',
+        value: 1e6,
+        scientific: false
+      },
+      k: {
+        name: 'k',
+        value: 1e9,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e18,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e27,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e36,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e45,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e54,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e63,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e72,
+        scientific: true
+      },
+      R: {
+        name: 'R',
+        value: 1e81,
+        scientific: true
+      },
+      Q: {
+        name: 'Q',
+        value: 1e90,
+        scientific: true
+      },
+      d: {
+        name: 'd',
+        value: 1e-3,
+        scientific: false
+      },
+      c: {
+        name: 'c',
+        value: 1e-6,
+        scientific: false
+      },
+      m: {
+        name: 'm',
+        value: 1e-9,
+        scientific: true
+      },
+      u: {
+        name: 'u',
+        value: 1e-18,
+        scientific: true
+      },
+      n: {
+        name: 'n',
+        value: 1e-27,
+        scientific: true
+      },
+      p: {
+        name: 'p',
+        value: 1e-36,
+        scientific: true
+      },
+      f: {
+        name: 'f',
+        value: 1e-45,
+        scientific: true
+      },
+      a: {
+        name: 'a',
+        value: 1e-54,
+        scientific: true
+      },
+      z: {
+        name: 'z',
+        value: 1e-63,
+        scientific: true
+      },
+      y: {
+        name: 'y',
+        value: 1e-72,
+        scientific: true
+      },
+      r: {
+        name: 'r',
+        value: 1e-81,
+        scientific: true
+      },
+      q: {
+        name: 'q',
+        value: 1e-90,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      k: {
+        name: 'k',
+        value: 1e3,
+        scientific: true
+      },
+      M: {
+        name: 'M',
+        value: 1e6,
+        scientific: true
+      },
+      G: {
+        name: 'G',
+        value: 1e9,
+        scientific: true
+      },
+      T: {
+        name: 'T',
+        value: 1e12,
+        scientific: true
+      },
+      P: {
+        name: 'P',
+        value: 1e15,
+        scientific: true
+      },
+      E: {
+        name: 'E',
+        value: 1e18,
+        scientific: true
+      },
+      Z: {
+        name: 'Z',
+        value: 1e21,
+        scientific: true
+      },
+      Y: {
+        name: 'Y',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_SHORT_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      Ki: {
+        name: 'Ki',
+        value: 1024,
+        scientific: true
+      },
+      Mi: {
+        name: 'Mi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      Gi: {
+        name: 'Gi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      Ti: {
+        name: 'Ti',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      Pi: {
+        name: 'Pi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      Ei: {
+        name: 'Ei',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      Zi: {
+        name: 'Zi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      Yi: {
+        name: 'Yi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BINARY_LONG_SI: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kilo: {
+        name: 'kilo',
+        value: 1e3,
+        scientific: true
+      },
+      mega: {
+        name: 'mega',
+        value: 1e6,
+        scientific: true
+      },
+      giga: {
+        name: 'giga',
+        value: 1e9,
+        scientific: true
+      },
+      tera: {
+        name: 'tera',
+        value: 1e12,
+        scientific: true
+      },
+      peta: {
+        name: 'peta',
+        value: 1e15,
+        scientific: true
+      },
+      exa: {
+        name: 'exa',
+        value: 1e18,
+        scientific: true
+      },
+      zetta: {
+        name: 'zetta',
+        value: 1e21,
+        scientific: true
+      },
+      yotta: {
+        name: 'yotta',
+        value: 1e24,
+        scientific: true
+      }
+    },
+    BINARY_LONG_IEC: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      kibi: {
+        name: 'kibi',
+        value: 1024,
+        scientific: true
+      },
+      mebi: {
+        name: 'mebi',
+        value: Math.pow(1024, 2),
+        scientific: true
+      },
+      gibi: {
+        name: 'gibi',
+        value: Math.pow(1024, 3),
+        scientific: true
+      },
+      tebi: {
+        name: 'tebi',
+        value: Math.pow(1024, 4),
+        scientific: true
+      },
+      pebi: {
+        name: 'pebi',
+        value: Math.pow(1024, 5),
+        scientific: true
+      },
+      exi: {
+        name: 'exi',
+        value: Math.pow(1024, 6),
+        scientific: true
+      },
+      zebi: {
+        name: 'zebi',
+        value: Math.pow(1024, 7),
+        scientific: true
+      },
+      yobi: {
+        name: 'yobi',
+        value: Math.pow(1024, 8),
+        scientific: true
+      }
+    },
+    BTU: {
+      '': {
+        name: '',
+        value: 1,
+        scientific: true
+      },
+      MM: {
+        name: 'MM',
+        value: 1e6,
+        scientific: true
+      }
+    }
+  };
+  PREFIXES.SHORTLONG = _extends({}, PREFIXES.SHORT, PREFIXES.LONG);
+  PREFIXES.BINARY_SHORT = _extends({}, PREFIXES.BINARY_SHORT_SI, PREFIXES.BINARY_SHORT_IEC);
+  PREFIXES.BINARY_LONG = _extends({}, PREFIXES.BINARY_LONG_SI, PREFIXES.BINARY_LONG_IEC);
+
+  /* Internally, each unit is represented by a value and a dimension array. The elements of the dimensions array have the following meaning:
+   * Index  Dimension
+   * -----  ---------
+   *   0    Length
+   *   1    Mass
+   *   2    Time
+   *   3    Current
+   *   4    Temperature
+   *   5    Luminous intensity
+   *   6    Amount of substance
+   *   7    Angle
+   *   8    Bit (digital)
+   * For example, the unit "298.15 K" is a pure temperature and would have a value of 298.15 and a dimension array of [0, 0, 0, 0, 1, 0, 0, 0, 0]. The unit "1 cal / (gm °C)" can be written in terms of the 9 fundamental dimensions as [length^2] / ([time^2] * [temperature]), and would a value of (after conversion to SI) 4184.0 and a dimensions array of [2, 0, -2, 0, -1, 0, 0, 0, 0].
+   *
+   */
+
+  var BASE_DIMENSIONS = ['MASS', 'LENGTH', 'TIME', 'CURRENT', 'TEMPERATURE', 'LUMINOUS_INTENSITY', 'AMOUNT_OF_SUBSTANCE', 'ANGLE', 'BIT'];
+  var BASE_UNITS = {
+    NONE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    MASS: {
+      dimensions: [1, 0, 0, 0, 0, 0, 0, 0, 0]
+    },
+    LENGTH: {
+      dimensions: [0, 1, 0, 0, 0, 0, 0, 0, 0]
+    },
+    TIME: {
+      dimensions: [0, 0, 1, 0, 0, 0, 0, 0, 0]
+    },
+    CURRENT: {
+      dimensions: [0, 0, 0, 1, 0, 0, 0, 0, 0]
+    },
+    TEMPERATURE: {
+      dimensions: [0, 0, 0, 0, 1, 0, 0, 0, 0]
+    },
+    LUMINOUS_INTENSITY: {
+      dimensions: [0, 0, 0, 0, 0, 1, 0, 0, 0]
+    },
+    AMOUNT_OF_SUBSTANCE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 1, 0, 0]
+    },
+    FORCE: {
+      dimensions: [1, 1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    SURFACE: {
+      dimensions: [0, 2, 0, 0, 0, 0, 0, 0, 0]
+    },
+    VOLUME: {
+      dimensions: [0, 3, 0, 0, 0, 0, 0, 0, 0]
+    },
+    ENERGY: {
+      dimensions: [1, 2, -2, 0, 0, 0, 0, 0, 0]
+    },
+    POWER: {
+      dimensions: [1, 2, -3, 0, 0, 0, 0, 0, 0]
+    },
+    PRESSURE: {
+      dimensions: [1, -1, -2, 0, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CHARGE: {
+      dimensions: [0, 0, 1, 1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CAPACITANCE: {
+      dimensions: [-1, -2, 4, 2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_POTENTIAL: {
+      dimensions: [1, 2, -3, -1, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_RESISTANCE: {
+      dimensions: [1, 2, -3, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_INDUCTANCE: {
+      dimensions: [1, 2, -2, -2, 0, 0, 0, 0, 0]
+    },
+    ELECTRIC_CONDUCTANCE: {
+      dimensions: [-1, -2, 3, 2, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX: {
+      dimensions: [1, 2, -2, -1, 0, 0, 0, 0, 0]
+    },
+    MAGNETIC_FLUX_DENSITY: {
+      dimensions: [1, 0, -2, -1, 0, 0, 0, 0, 0]
+    },
+    FREQUENCY: {
+      dimensions: [0, 0, -1, 0, 0, 0, 0, 0, 0]
+    },
+    ANGLE: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 1, 0]
+    },
+    BIT: {
+      dimensions: [0, 0, 0, 0, 0, 0, 0, 0, 1]
+    }
+  };
+  for (var key in BASE_UNITS) {
+    if (hasOwnProperty(BASE_UNITS, key)) {
+      BASE_UNITS[key].key = key;
+    }
+  }
+  var BASE_UNIT_NONE = {};
+  var UNIT_NONE = {
+    name: '',
+    base: BASE_UNIT_NONE,
+    value: 1,
+    offset: 0,
+    dimensions: BASE_DIMENSIONS.map(x => 0)
+  };
+  var UNITS = {
+    // length
+    meter: {
+      name: 'meter',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    inch: {
+      name: 'inch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    foot: {
+      name: 'foot',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yard: {
+      name: 'yard',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mile: {
+      name: 'mile',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    link: {
+      name: 'link',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rod: {
+      name: 'rod',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.0292,
+      offset: 0
+    },
+    chain: {
+      name: 'chain',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    angstrom: {
+      name: 'angstrom',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1e-10,
+      offset: 0
+    },
+    m: {
+      name: 'm',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    in: {
+      name: 'in',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0254,
+      offset: 0
+    },
+    ft: {
+      name: 'ft',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.3048,
+      offset: 0
+    },
+    yd: {
+      name: 'yd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.9144,
+      offset: 0
+    },
+    mi: {
+      name: 'mi',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 1609.344,
+      offset: 0
+    },
+    li: {
+      name: 'li',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.201168,
+      offset: 0
+    },
+    rd: {
+      name: 'rd',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 5.029210,
+      offset: 0
+    },
+    ch: {
+      name: 'ch',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 20.1168,
+      offset: 0
+    },
+    mil: {
+      name: 'mil',
+      base: BASE_UNITS.LENGTH,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000254,
+      offset: 0
+    },
+    // 1/1000 inch
+
+    // Surface
+    m2: {
+      name: 'm2',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.SQUARED,
+      value: 1,
+      offset: 0
+    },
+    sqin: {
+      name: 'sqin',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.00064516,
+      offset: 0
+    },
+    // 645.16 mm2
+    sqft: {
+      name: 'sqft',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.09290304,
+      offset: 0
+    },
+    // 0.09290304 m2
+    sqyd: {
+      name: 'sqyd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 0.83612736,
+      offset: 0
+    },
+    // 0.83612736 m2
+    sqmi: {
+      name: 'sqmi',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 2589988.110336,
+      offset: 0
+    },
+    // 2.589988110336 km2
+    sqrd: {
+      name: 'sqrd',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 25.29295,
+      offset: 0
+    },
+    // 25.29295 m2
+    sqch: {
+      name: 'sqch',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 404.6873,
+      offset: 0
+    },
+    // 404.6873 m2
+    sqmil: {
+      name: 'sqmil',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 6.4516e-10,
+      offset: 0
+    },
+    // 6.4516 * 10^-10 m2
+    acre: {
+      name: 'acre',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 4046.86,
+      offset: 0
+    },
+    // 4046.86 m2
+    hectare: {
+      name: 'hectare',
+      base: BASE_UNITS.SURFACE,
+      prefixes: PREFIXES.NONE,
+      value: 10000,
+      offset: 0
+    },
+    // 10000 m2
+
+    // Volume
+    m3: {
+      name: 'm3',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.CUBIC,
+      value: 1,
+      offset: 0
+    },
+    L: {
+      name: 'L',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    l: {
+      name: 'l',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    // litre
+    litre: {
+      name: 'litre',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    cuin: {
+      name: 'cuin',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1.6387064e-5,
+      offset: 0
+    },
+    // 1.6387064e-5 m3
+    cuft: {
+      name: 'cuft',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.028316846592,
+      offset: 0
+    },
+    // 28.316 846 592 L
+    cuyd: {
+      name: 'cuyd',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.764554857984,
+      offset: 0
+    },
+    // 764.554 857 984 L
+    teaspoon: {
+      name: 'teaspoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000005,
+      offset: 0
+    },
+    // 5 mL
+    tablespoon: {
+      name: 'tablespoon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000015,
+      offset: 0
+    },
+    // 15 mL
+    // {name: 'cup', base: BASE_UNITS.VOLUME, prefixes: PREFIXES.NONE, value: 0.000240, offset: 0}, // 240 mL  // not possible, we have already another cup
+    drop: {
+      name: 'drop',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+    gtt: {
+      name: 'gtt',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 5e-8,
+      offset: 0
+    },
+    // 0.05 mL = 5e-8 m3
+
+    // Liquid volume
+    minim: {
+      name: 'minim',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000000061611519921875,
+      offset: 0
+    },
+    // 1/61440 gallons
+    fluiddram: {
+      name: 'fluiddram',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000036966911953125,
+      offset: 0
+    },
+    // 1/1024 gallons
+    fluidounce: {
+      name: 'fluidounce',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0000295735295625,
+      offset: 0
+    },
+    // 1/128 gallons
+    gill: {
+      name: 'gill',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.00011829411825,
+      offset: 0
+    },
+    // 1/32 gallons
+    cc: {
+      name: 'cc',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 1e-6,
+      offset: 0
+    },
+    // 1e-6 L
+    cup: {
+      name: 'cup',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.0002365882365,
+      offset: 0
+    },
+    // 1/16 gallons
+    pint: {
+      name: 'pint',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000473176473,
+      offset: 0
+    },
+    // 1/8 gallons
+    quart: {
+      name: 'quart',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.000946352946,
+      offset: 0
+    },
+    // 1/4 gallons
+    gallon: {
+      name: 'gallon',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.003785411784,
+      offset: 0
+    },
+    // 3.785411784 L
+    beerbarrel: {
+      name: 'beerbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.117347765304,
+      offset: 0
+    },
+    // 31 gallons
+    oilbarrel: {
+      name: 'oilbarrel',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.158987294928,
+      offset: 0
+    },
+    // 42 gallons
+    hogshead: {
+      name: 'hogshead',
+      base: BASE_UNITS.VOLUME,
+      prefixes: PREFIXES.NONE,
+      value: 0.238480942392,
+      offset: 0
+    },
+    // 63 gallons
+
+    // Mass
+    g: {
+      name: 'g',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 0.001,
+      offset: 0
+    },
+    gram: {
+      name: 'gram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 0.001,
+      offset: 0
+    },
+    ton: {
+      name: 'ton',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 907.18474,
+      offset: 0
+    },
+    t: {
+      name: 't',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.SHORT,
+      value: 1000,
+      offset: 0
+    },
+    tonne: {
+      name: 'tonne',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.LONG,
+      value: 1000,
+      offset: 0
+    },
+    grain: {
+      name: 'grain',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dram: {
+      name: 'dram',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    ounce: {
+      name: 'ounce',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    poundmass: {
+      name: 'poundmass',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    hundredweight: {
+      name: 'hundredweight',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    stick: {
+      name: 'stick',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 115e-3,
+      offset: 0
+    },
+    stone: {
+      name: 'stone',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 6.35029318,
+      offset: 0
+    },
+    gr: {
+      name: 'gr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 64.79891e-6,
+      offset: 0
+    },
+    dr: {
+      name: 'dr',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 1.7718451953125e-3,
+      offset: 0
+    },
+    oz: {
+      name: 'oz',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 28.349523125e-3,
+      offset: 0
+    },
+    lbm: {
+      name: 'lbm',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 453.59237e-3,
+      offset: 0
+    },
+    cwt: {
+      name: 'cwt',
+      base: BASE_UNITS.MASS,
+      prefixes: PREFIXES.NONE,
+      value: 45.359237,
+      offset: 0
+    },
+    // Time
+    s: {
+      name: 's',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    min: {
+      name: 'min',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    h: {
+      name: 'h',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    second: {
+      name: 'second',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    sec: {
+      name: 'sec',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    minute: {
+      name: 'minute',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 60,
+      offset: 0
+    },
+    hour: {
+      name: 'hour',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3600,
+      offset: 0
+    },
+    day: {
+      name: 'day',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 86400,
+      offset: 0
+    },
+    week: {
+      name: 'week',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 7 * 86400,
+      offset: 0
+    },
+    month: {
+      name: 'month',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 2629800,
+      // 1/12th of Julian year
+      offset: 0
+    },
+    year: {
+      name: 'year',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600,
+      // Julian year
+      offset: 0
+    },
+    decade: {
+      name: 'decade',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 315576000,
+      // Julian decade
+      offset: 0
+    },
+    century: {
+      name: 'century',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 3155760000,
+      // Julian century
+      offset: 0
+    },
+    millennium: {
+      name: 'millennium',
+      base: BASE_UNITS.TIME,
+      prefixes: PREFIXES.NONE,
+      value: 31557600000,
+      // Julian millennium
+      offset: 0
+    },
+    // Frequency
+    hertz: {
+      name: 'Hertz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    Hz: {
+      name: 'Hz',
+      base: BASE_UNITS.FREQUENCY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0,
+      reciprocal: true
+    },
+    // Angle
+    rad: {
+      name: 'rad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    radian: {
+      name: 'radian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // deg = rad / (2*pi) * 360 = rad / 0.017453292519943295769236907684888
+    deg: {
+      name: 'deg',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    degree: {
+      name: 'degree',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // grad = rad / (2*pi) * 400  = rad / 0.015707963267948966192313216916399
+    grad: {
+      name: 'grad',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.SHORT,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    gradian: {
+      name: 'gradian',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.LONG,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // cycle = rad / (2*pi) = rad / 6.2831853071795864769252867665793
+    cycle: {
+      name: 'cycle',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcsec = rad / (3600 * (360 / 2 * pi)) = rad / 0.0000048481368110953599358991410235795
+    arcsec: {
+      name: 'arcsec',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // arcmin = rad / (60 * (360 / 2 * pi)) = rad / 0.00029088820866572159615394846141477
+    arcmin: {
+      name: 'arcmin',
+      base: BASE_UNITS.ANGLE,
+      prefixes: PREFIXES.NONE,
+      value: null,
+      // will be filled in by calculateAngleValues()
+      offset: 0
+    },
+    // Electric current
+    A: {
+      name: 'A',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    ampere: {
+      name: 'ampere',
+      base: BASE_UNITS.CURRENT,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // Temperature
+    // K(C) = °C + 273.15
+    // K(F) = (°F + 459.67) * (5 / 9)
+    // K(R) = °R * (5 / 9)
+    K: {
+      name: 'K',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    degC: {
+      name: 'degC',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 273.15
+    },
+    degF: {
+      name: 'degF',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: new _Fraction(5, 9),
+      offset: 459.67
+    },
+    degR: {
+      name: 'degR',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.SHORT,
+      value: new _Fraction(5, 9),
+      offset: 0
+    },
+    kelvin: {
+      name: 'kelvin',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    celsius: {
+      name: 'celsius',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 273.15
+    },
+    fahrenheit: {
+      name: 'fahrenheit',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: new _Fraction(5, 9),
+      offset: 459.67
+    },
+    rankine: {
+      name: 'rankine',
+      base: BASE_UNITS.TEMPERATURE,
+      prefixes: PREFIXES.LONG,
+      value: new _Fraction(5, 9),
+      offset: 0
+    },
+    // amount of substance
+    mol: {
+      name: 'mol',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    mole: {
+      name: 'mole',
+      base: BASE_UNITS.AMOUNT_OF_SUBSTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // luminous intensity
+    cd: {
+      name: 'cd',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    candela: {
+      name: 'candela',
+      base: BASE_UNITS.LUMINOUS_INTENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    // TODO: units STERADIAN
+    // {name: 'sr', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+    // {name: 'steradian', base: BASE_UNITS.STERADIAN, prefixes: PREFIXES.NONE, value: 1, offset: 0},
+
+    // Force
+    N: {
+      name: 'N',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    newton: {
+      name: 'newton',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    dyn: {
+      name: 'dyn',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.SHORT,
+      value: 0.00001,
+      offset: 0
+    },
+    dyne: {
+      name: 'dyne',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 0.00001,
+      offset: 0
+    },
+    lbf: {
+      name: 'lbf',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    poundforce: {
+      name: 'poundforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 4.4482216152605,
+      offset: 0
+    },
+    kip: {
+      name: 'kip',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.LONG,
+      value: 4448.2216,
+      offset: 0
+    },
+    kilogramforce: {
+      name: 'kilogramforce',
+      base: BASE_UNITS.FORCE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    // Energy
+    J: {
+      name: 'J',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    joule: {
+      name: 'joule',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    erg: {
+      name: 'erg',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both kiloerg and kerg are acceptable
+      value: 1e-7,
+      offset: 0
+    },
+    Wh: {
+      name: 'Wh',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 3600,
+      offset: 0
+    },
+    BTU: {
+      name: 'BTU',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.BTU,
+      value: 1055.05585262,
+      offset: 0
+    },
+    eV: {
+      name: 'eV',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.SHORT,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    electronvolt: {
+      name: 'electronvolt',
+      base: BASE_UNITS.ENERGY,
+      prefixes: PREFIXES.LONG,
+      value: 1.602176565e-19,
+      offset: 0
+    },
+    // Power
+    W: {
+      name: 'W',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    watt: {
+      name: 'watt',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    hp: {
+      name: 'hp',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.NONE,
+      value: 745.6998715386,
+      offset: 0
+    },
+    // Electrical power units
+    VAR: {
+      name: 'VAR',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: Complex.I,
+      offset: 0
+    },
+    VA: {
+      name: 'VA',
+      base: BASE_UNITS.POWER,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Pressure
+    Pa: {
+      name: 'Pa',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    psi: {
+      name: 'psi',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 6894.75729276459,
+      offset: 0
+    },
+    atm: {
+      name: 'atm',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 101325,
+      offset: 0
+    },
+    bar: {
+      name: 'bar',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.SHORTLONG,
+      value: 100000,
+      offset: 0
+    },
+    torr: {
+      name: 'torr',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmHg: {
+      name: 'mmHg',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 133.322,
+      offset: 0
+    },
+    mmH2O: {
+      name: 'mmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 9.80665,
+      offset: 0
+    },
+    cmH2O: {
+      name: 'cmH2O',
+      base: BASE_UNITS.PRESSURE,
+      prefixes: PREFIXES.NONE,
+      value: 98.0665,
+      offset: 0
+    },
+    // Electric charge
+    coulomb: {
+      name: 'coulomb',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    C: {
+      name: 'C',
+      base: BASE_UNITS.ELECTRIC_CHARGE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric capacitance
+    farad: {
+      name: 'farad',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    F: {
+      name: 'F',
+      base: BASE_UNITS.ELECTRIC_CAPACITANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric potential
+    volt: {
+      name: 'volt',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    V: {
+      name: 'V',
+      base: BASE_UNITS.ELECTRIC_POTENTIAL,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric resistance
+    ohm: {
+      name: 'ohm',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORTLONG,
+      // Both Mohm and megaohm are acceptable
+      value: 1,
+      offset: 0
+    },
+    /*
+     * Unicode breaks in browsers if charset is not specified
+    Ω: {
+      name: 'Ω',
+      base: BASE_UNITS.ELECTRIC_RESISTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    */
+    // Electric inductance
+    henry: {
+      name: 'henry',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    H: {
+      name: 'H',
+      base: BASE_UNITS.ELECTRIC_INDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Electric conductance
+    siemens: {
+      name: 'siemens',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    S: {
+      name: 'S',
+      base: BASE_UNITS.ELECTRIC_CONDUCTANCE,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux
+    weber: {
+      name: 'weber',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    Wb: {
+      name: 'Wb',
+      base: BASE_UNITS.MAGNETIC_FLUX,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Magnetic flux density
+    tesla: {
+      name: 'tesla',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.LONG,
+      value: 1,
+      offset: 0
+    },
+    T: {
+      name: 'T',
+      base: BASE_UNITS.MAGNETIC_FLUX_DENSITY,
+      prefixes: PREFIXES.SHORT,
+      value: 1,
+      offset: 0
+    },
+    // Binary
+    b: {
+      name: 'b',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 1,
+      offset: 0
+    },
+    bits: {
+      name: 'bits',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 1,
+      offset: 0
+    },
+    B: {
+      name: 'B',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_SHORT,
+      value: 8,
+      offset: 0
+    },
+    bytes: {
+      name: 'bytes',
+      base: BASE_UNITS.BIT,
+      prefixes: PREFIXES.BINARY_LONG,
+      value: 8,
+      offset: 0
+    }
+  };
+
+  // aliases (formerly plurals)
+  // note that ALIASES is only used at creation to create more entries in UNITS by copying the aliased units
+  var ALIASES = {
+    meters: 'meter',
+    inches: 'inch',
+    feet: 'foot',
+    yards: 'yard',
+    miles: 'mile',
+    links: 'link',
+    rods: 'rod',
+    chains: 'chain',
+    angstroms: 'angstrom',
+    lt: 'l',
+    litres: 'litre',
+    liter: 'litre',
+    liters: 'litre',
+    teaspoons: 'teaspoon',
+    tablespoons: 'tablespoon',
+    minims: 'minim',
+    fldr: 'fluiddram',
+    fluiddrams: 'fluiddram',
+    floz: 'fluidounce',
+    fluidounces: 'fluidounce',
+    gi: 'gill',
+    gills: 'gill',
+    cp: 'cup',
+    cups: 'cup',
+    pt: 'pint',
+    pints: 'pint',
+    qt: 'quart',
+    quarts: 'quart',
+    gal: 'gallon',
+    gallons: 'gallon',
+    bbl: 'beerbarrel',
+    beerbarrels: 'beerbarrel',
+    obl: 'oilbarrel',
+    oilbarrels: 'oilbarrel',
+    hogsheads: 'hogshead',
+    gtts: 'gtt',
+    grams: 'gram',
+    tons: 'ton',
+    tonnes: 'tonne',
+    grains: 'grain',
+    drams: 'dram',
+    ounces: 'ounce',
+    poundmasses: 'poundmass',
+    hundredweights: 'hundredweight',
+    sticks: 'stick',
+    lb: 'lbm',
+    lbs: 'lbm',
+    kips: 'kip',
+    kgf: 'kilogramforce',
+    acres: 'acre',
+    hectares: 'hectare',
+    sqfeet: 'sqft',
+    sqyard: 'sqyd',
+    sqmile: 'sqmi',
+    sqmiles: 'sqmi',
+    mmhg: 'mmHg',
+    mmh2o: 'mmH2O',
+    cmh2o: 'cmH2O',
+    seconds: 'second',
+    secs: 'second',
+    minutes: 'minute',
+    mins: 'minute',
+    hours: 'hour',
+    hr: 'hour',
+    hrs: 'hour',
+    days: 'day',
+    weeks: 'week',
+    months: 'month',
+    years: 'year',
+    decades: 'decade',
+    centuries: 'century',
+    millennia: 'millennium',
+    hertz: 'hertz',
+    radians: 'radian',
+    degrees: 'degree',
+    gradians: 'gradian',
+    cycles: 'cycle',
+    arcsecond: 'arcsec',
+    arcseconds: 'arcsec',
+    arcminute: 'arcmin',
+    arcminutes: 'arcmin',
+    BTUs: 'BTU',
+    watts: 'watt',
+    joules: 'joule',
+    amperes: 'ampere',
+    amps: 'ampere',
+    amp: 'ampere',
+    coulombs: 'coulomb',
+    volts: 'volt',
+    ohms: 'ohm',
+    farads: 'farad',
+    webers: 'weber',
+    teslas: 'tesla',
+    electronvolts: 'electronvolt',
+    moles: 'mole',
+    bit: 'bits',
+    byte: 'bytes'
+  };
+
+  /**
+   * Calculate the values for the angle units.
+   * Value is calculated as number or BigNumber depending on the configuration
+   * @param {{number: 'number' | 'BigNumber'}} config
+   */
+  function calculateAngleValues(config) {
+    if (config.number === 'BigNumber') {
+      var pi = createPi(_BigNumber);
+      UNITS.rad.value = new _BigNumber(1);
+      UNITS.deg.value = pi.div(180); // 2 * pi / 360
+      UNITS.grad.value = pi.div(200); // 2 * pi / 400
+      UNITS.cycle.value = pi.times(2); // 2 * pi
+      UNITS.arcsec.value = pi.div(648000); // 2 * pi / 360 / 3600
+      UNITS.arcmin.value = pi.div(10800); // 2 * pi / 360 / 60
+    } else {
+      // number
+      UNITS.rad.value = 1;
+      UNITS.deg.value = Math.PI / 180; // 2 * pi / 360
+      UNITS.grad.value = Math.PI / 200; // 2 * pi / 400
+      UNITS.cycle.value = Math.PI * 2; // 2 * pi
+      UNITS.arcsec.value = Math.PI / 648000; // 2 * pi / 360 / 3600
+      UNITS.arcmin.value = Math.PI / 10800; // 2 * pi / 360 / 60
+    }
+
+    // copy to the full names of the angles
+    UNITS.radian.value = UNITS.rad.value;
+    UNITS.degree.value = UNITS.deg.value;
+    UNITS.gradian.value = UNITS.grad.value;
+  }
+
+  // apply the angle values now
+  calculateAngleValues(config);
+  if (on) {
+    // recalculate the values on change of configuration
+    on('config', function (curr, prev) {
+      if (curr.number !== prev.number) {
+        calculateAngleValues(curr);
+      }
+    });
+  }
+
+  /**
+   * A unit system is a set of dimensionally independent base units plus a set of derived units, formed by multiplication and division of the base units, that are by convention used with the unit system.
+   * A user perhaps could issue a command to select a preferred unit system, or use the default (see below).
+   * Auto unit system: The default unit system is updated on the fly anytime a unit is parsed. The corresponding unit in the default unit system is updated, so that answers are given in the same units the user supplies.
+   */
+  var UNIT_SYSTEMS = {
+    si: {
+      // Base units
+      NONE: {
+        unit: UNIT_NONE,
+        prefix: PREFIXES.NONE['']
+      },
+      LENGTH: {
+        unit: UNITS.m,
+        prefix: PREFIXES.SHORT['']
+      },
+      MASS: {
+        unit: UNITS.g,
+        prefix: PREFIXES.SHORT.k
+      },
+      TIME: {
+        unit: UNITS.s,
+        prefix: PREFIXES.SHORT['']
+      },
+      CURRENT: {
+        unit: UNITS.A,
+        prefix: PREFIXES.SHORT['']
+      },
+      TEMPERATURE: {
+        unit: UNITS.K,
+        prefix: PREFIXES.SHORT['']
+      },
+      LUMINOUS_INTENSITY: {
+        unit: UNITS.cd,
+        prefix: PREFIXES.SHORT['']
+      },
+      AMOUNT_OF_SUBSTANCE: {
+        unit: UNITS.mol,
+        prefix: PREFIXES.SHORT['']
+      },
+      ANGLE: {
+        unit: UNITS.rad,
+        prefix: PREFIXES.SHORT['']
+      },
+      BIT: {
+        unit: UNITS.bits,
+        prefix: PREFIXES.SHORT['']
+      },
+      // Derived units
+      FORCE: {
+        unit: UNITS.N,
+        prefix: PREFIXES.SHORT['']
+      },
+      ENERGY: {
+        unit: UNITS.J,
+        prefix: PREFIXES.SHORT['']
+      },
+      POWER: {
+        unit: UNITS.W,
+        prefix: PREFIXES.SHORT['']
+      },
+      PRESSURE: {
+        unit: UNITS.Pa,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CHARGE: {
+        unit: UNITS.C,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CAPACITANCE: {
+        unit: UNITS.F,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_POTENTIAL: {
+        unit: UNITS.V,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_RESISTANCE: {
+        unit: UNITS.ohm,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_INDUCTANCE: {
+        unit: UNITS.H,
+        prefix: PREFIXES.SHORT['']
+      },
+      ELECTRIC_CONDUCTANCE: {
+        unit: UNITS.S,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX: {
+        unit: UNITS.Wb,
+        prefix: PREFIXES.SHORT['']
+      },
+      MAGNETIC_FLUX_DENSITY: {
+        unit: UNITS.T,
+        prefix: PREFIXES.SHORT['']
+      },
+      FREQUENCY: {
+        unit: UNITS.Hz,
+        prefix: PREFIXES.SHORT['']
+      }
+    }
+  };
+
+  // Clone to create the other unit systems
+  UNIT_SYSTEMS.cgs = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.cgs.LENGTH = {
+    unit: UNITS.m,
+    prefix: PREFIXES.SHORT.c
+  };
+  UNIT_SYSTEMS.cgs.MASS = {
+    unit: UNITS.g,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.FORCE = {
+    unit: UNITS.dyn,
+    prefix: PREFIXES.SHORT['']
+  };
+  UNIT_SYSTEMS.cgs.ENERGY = {
+    unit: UNITS.erg,
+    prefix: PREFIXES.NONE['']
+  };
+  // there are wholly 4 unique cgs systems for electricity and magnetism,
+  // so let's not worry about it unless somebody complains
+
+  UNIT_SYSTEMS.us = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+  UNIT_SYSTEMS.us.LENGTH = {
+    unit: UNITS.ft,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.MASS = {
+    unit: UNITS.lbm,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.TEMPERATURE = {
+    unit: UNITS.degF,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.FORCE = {
+    unit: UNITS.lbf,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.ENERGY = {
+    unit: UNITS.BTU,
+    prefix: PREFIXES.BTU['']
+  };
+  UNIT_SYSTEMS.us.POWER = {
+    unit: UNITS.hp,
+    prefix: PREFIXES.NONE['']
+  };
+  UNIT_SYSTEMS.us.PRESSURE = {
+    unit: UNITS.psi,
+    prefix: PREFIXES.NONE['']
+  };
+
+  // Add additional unit systems here.
+
+  // Choose a unit system to seed the auto unit system.
+  UNIT_SYSTEMS.auto = JSON.parse(JSON.stringify(UNIT_SYSTEMS.si));
+
+  // Set the current unit system
+  var currentUnitSystem = UNIT_SYSTEMS.auto;
+
+  /**
+   * Set a unit system for formatting derived units.
+   * @memberof Unit
+   * @param {string} [name] The name of the unit system.
+   */
+  Unit.setUnitSystem = function (name) {
+    if (hasOwnProperty(UNIT_SYSTEMS, name)) {
+      currentUnitSystem = UNIT_SYSTEMS[name];
+    } else {
+      throw new Error('Unit system ' + name + ' does not exist. Choices are: ' + Object.keys(UNIT_SYSTEMS).join(', '));
+    }
+  };
+
+  /**
+   * Return the current unit system.
+   * @memberof Unit
+   * @return {string} The current unit system.
+   */
+  Unit.getUnitSystem = function () {
+    for (var _key in UNIT_SYSTEMS) {
+      if (hasOwnProperty(UNIT_SYSTEMS, _key)) {
+        if (UNIT_SYSTEMS[_key] === currentUnitSystem) {
+          return _key;
+        }
+      }
+    }
+  };
+
+  /**
+   * Converters to convert from number to an other numeric type like BigNumber
+   * or Fraction
+   */
+  Unit.typeConverters = {
+    BigNumber: function BigNumber(x) {
+      if (x !== null && x !== void 0 && x.isFraction) return new _BigNumber(String(x.n)).div(String(x.d)).times(String(x.s));
+      return new _BigNumber(x + ''); // stringify to prevent constructor error
+    },
+    Fraction: function Fraction(x) {
+      return new _Fraction(x);
+    },
+    Complex: function Complex(x) {
+      return x;
+    },
+    number: function number(x) {
+      if (x !== null && x !== void 0 && x.isFraction) return _number(x);
+      return x;
+    }
+  };
+
+  /**
+   * Retrieve the right converter function corresponding with this unit's
+   * value
+   *
+   * @memberof Unit
+   * @return {Function}
+   */
+  Unit.prototype._numberConverter = function () {
+    var convert = Unit.typeConverters[this.valueType()];
+    if (convert) {
+      return convert;
+    }
+    throw new TypeError('Unsupported Unit value type "' + this.valueType() + '"');
+  };
+
+  /**
+   * Retrieve the right convertor function corresponding with the type
+   * of provided exampleValue.
+   *
+   * @param {string} type   A string 'number', 'BigNumber', or 'Fraction'
+   *                        In case of an unknown type,
+   * @return {Function}
+   */
+  Unit._getNumberConverter = function (type) {
+    if (!Unit.typeConverters[type]) {
+      throw new TypeError('Unsupported type "' + type + '"');
+    }
+    return Unit.typeConverters[type];
+  };
+
+  // Add dimensions to each built-in unit
+  for (var _key2 in UNITS) {
+    if (hasOwnProperty(UNITS, _key2)) {
+      var unit = UNITS[_key2];
+      unit.dimensions = unit.base.dimensions;
+    }
+  }
+
+  // Create aliases
+  for (var _name2 in ALIASES) {
+    if (hasOwnProperty(ALIASES, _name2)) {
+      var _unit2 = UNITS[ALIASES[_name2]];
+      var alias = {};
+      for (var _key3 in _unit2) {
+        if (hasOwnProperty(_unit2, _key3)) {
+          alias[_key3] = _unit2[_key3];
+        }
+      }
+      alias.name = _name2;
+      UNITS[_name2] = alias;
+    }
+  }
+
+  /**
+   * Checks if a character is a valid latin letter (upper or lower case).
+   * Note that this function can be overridden, for example to allow support of other alphabets.
+   * @memberof Unit
+   * @param {string} c Tested character
+   * @return {boolean} true if the character is a latin letter
+   */
+  Unit.isValidAlpha = function isValidAlpha(c) {
+    return /^[a-zA-Z]$/.test(c);
+  };
+  function assertUnitNameIsValid(name) {
+    for (var i = 0; i < name.length; i++) {
+      c = name.charAt(i);
+      if (i === 0 && !Unit.isValidAlpha(c)) {
+        throw new Error('Invalid unit name (must begin with alpha character): "' + name + '"');
+      }
+      if (i > 0 && !(Unit.isValidAlpha(c) || isDigit(c))) {
+        throw new Error('Invalid unit name (only alphanumeric characters are allowed): "' + name + '"');
+      }
+    }
+  }
+
+  /**
+   * Wrapper around createUnitSingle.
+   * Example:
+   *  createUnit( {
+   *     foo: {
+   *       prefixes: 'long',
+   *       baseName: 'essence-of-foo'
+   *     },
+   *     bar: '40 foo',
+   *     baz: {
+   *       definition: '1 bar/hour',
+   *       prefixes: 'long'
+   *     }
+   *   },
+   *   {
+   *     override: true
+   *   })
+   * @memberof Unit
+   * @param {object} obj      Object map. Each key becomes a unit which is defined by its value.
+   * @param {object} options
+   * @return {Unit} the last created unit
+   */
+  Unit.createUnit = function (obj, options) {
+    if (typeof obj !== 'object') {
+      throw new TypeError("createUnit expects first parameter to be of type 'Object'");
+    }
+
+    // Remove all units and aliases we are overriding
+    if (options && options.override) {
+      for (var _key4 in obj) {
+        if (hasOwnProperty(obj, _key4)) {
+          Unit.deleteUnit(_key4);
+        }
+        if (obj[_key4].aliases) {
+          for (var i = 0; i < obj[_key4].aliases.length; i++) {
+            Unit.deleteUnit(obj[_key4].aliases[i]);
+          }
+        }
+      }
+    }
+
+    // TODO: traverse multiple times until all units have been added
+    var lastUnit;
+    for (var _key5 in obj) {
+      if (hasOwnProperty(obj, _key5)) {
+        lastUnit = Unit.createUnitSingle(_key5, obj[_key5]);
+      }
+    }
+    return lastUnit;
+  };
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * Example:
+   *  createUnitSingle('knot', '0.514444444 m/s')
+   *
+   * @memberof Unit
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string | Unit | object} definition      Definition of the unit in terms
+   * of existing units. For example, '0.514444444 m / s'. Can be a Unit, a string,
+   * or an Object. If an Object, may have the following properties:
+   *   - definition {string | Unit} The definition of this unit.
+   *   - prefixes {string} "none", "short", "long", "binary_short", or "binary_long".
+   *     The default is "none".
+   *   - aliases {Array} Array of strings. Example: ['knots', 'kt', 'kts']
+   *   - offset {Numeric} An offset to apply when converting from the unit. For
+   *     example, the offset for celsius is 273.15 and the offset for farhenheit
+   *     is 459.67. Default is 0.
+   *   - baseName {string} If the unit's dimension does not match that of any other
+   *     base unit, the name of the newly create base unit. Otherwise, this property
+   *     has no effect.
+   *
+   * @return {Unit}
+   */
+  Unit.createUnitSingle = function (name, obj) {
+    if (typeof obj === 'undefined' || obj === null) {
+      obj = {};
+    }
+    if (typeof name !== 'string') {
+      throw new TypeError("createUnitSingle expects first parameter to be of type 'string'");
+    }
+
+    // Check collisions with existing units
+    if (hasOwnProperty(UNITS, name)) {
+      throw new Error('Cannot create unit "' + name + '": a unit with that name already exists');
+    }
+
+    // TODO: Validate name for collisions with other built-in functions (like abs or cos, for example), and for acceptable variable names. For example, '42' is probably not a valid unit. Nor is '%', since it is also an operator.
+
+    assertUnitNameIsValid(name);
+    var defUnit = null; // The Unit from which the new unit will be created.
+    var aliases = [];
+    var offset = 0;
+    var definition;
+    var prefixes;
+    var baseName;
+    if (obj && obj.type === 'Unit') {
+      defUnit = obj.clone();
+    } else if (typeof obj === 'string') {
+      if (obj !== '') {
+        definition = obj;
+      }
+    } else if (typeof obj === 'object') {
+      definition = obj.definition;
+      prefixes = obj.prefixes;
+      offset = obj.offset;
+      baseName = obj.baseName;
+      if (obj.aliases) {
+        aliases = obj.aliases.valueOf(); // aliases could be a Matrix, so convert to Array
+      }
+    } else {
+      throw new TypeError('Cannot create unit "' + name + '" from "' + obj.toString() + '": expecting "string" or "Unit" or "Object"');
+    }
+    if (aliases) {
+      for (var i = 0; i < aliases.length; i++) {
+        if (hasOwnProperty(UNITS, aliases[i])) {
+          throw new Error('Cannot create alias "' + aliases[i] + '": a unit with that name already exists');
+        }
+      }
+    }
+    if (definition && typeof definition === 'string' && !defUnit) {
+      try {
+        defUnit = Unit.parse(definition, {
+          allowNoUnits: true
+        });
+      } catch (ex) {
+        ex.message = 'Could not create unit "' + name + '" from "' + definition + '": ' + ex.message;
+        throw ex;
+      }
+    } else if (definition && definition.type === 'Unit') {
+      defUnit = definition.clone();
+    }
+    aliases = aliases || [];
+    offset = offset || 0;
+    if (prefixes && prefixes.toUpperCase) {
+      prefixes = PREFIXES[prefixes.toUpperCase()] || PREFIXES.NONE;
+    } else {
+      prefixes = PREFIXES.NONE;
+    }
+
+    // If defUnit is null, it is because the user did not
+    // specify a defintion. So create a new base dimension.
+    var newUnit = {};
+    if (!defUnit) {
+      // Add a new base dimension
+      baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+      if (BASE_DIMENSIONS.indexOf(baseName) >= 0) {
+        throw new Error('Cannot create new base unit "' + name + '": a base unit with that name already exists (and cannot be overridden)');
+      }
+      BASE_DIMENSIONS.push(baseName);
+
+      // Push 0 onto existing base units
+      for (var b in BASE_UNITS) {
+        if (hasOwnProperty(BASE_UNITS, b)) {
+          BASE_UNITS[b].dimensions[BASE_DIMENSIONS.length - 1] = 0;
+        }
+      }
+
+      // Add the new base unit
+      var newBaseUnit = {
+        dimensions: []
+      };
+      for (var _i6 = 0; _i6 < BASE_DIMENSIONS.length; _i6++) {
+        newBaseUnit.dimensions[_i6] = 0;
+      }
+      newBaseUnit.dimensions[BASE_DIMENSIONS.length - 1] = 1;
+      newBaseUnit.key = baseName;
+      BASE_UNITS[baseName] = newBaseUnit;
+      newUnit = {
+        name,
+        value: 1,
+        dimensions: BASE_UNITS[baseName].dimensions.slice(0),
+        prefixes,
+        offset,
+        base: BASE_UNITS[baseName]
+      };
+      currentUnitSystem[baseName] = {
+        unit: newUnit,
+        prefix: PREFIXES.NONE['']
+      };
+    } else {
+      newUnit = {
+        name,
+        value: defUnit.value,
+        dimensions: defUnit.dimensions.slice(0),
+        prefixes,
+        offset
+      };
+
+      // Create a new base if no matching base exists
+      var anyMatch = false;
+      for (var _i7 in BASE_UNITS) {
+        if (hasOwnProperty(BASE_UNITS, _i7)) {
+          var match = true;
+          for (var j = 0; j < BASE_DIMENSIONS.length; j++) {
+            if (Math.abs((newUnit.dimensions[j] || 0) - (BASE_UNITS[_i7].dimensions[j] || 0)) > 1e-12) {
+              match = false;
+              break;
+            }
+          }
+          if (match) {
+            anyMatch = true;
+            newUnit.base = BASE_UNITS[_i7];
+            break;
+          }
+        }
+      }
+      if (!anyMatch) {
+        baseName = baseName || name + '_STUFF'; // foo --> foo_STUFF, or the essence of foo
+        // Add the new base unit
+        var _newBaseUnit = {
+          dimensions: defUnit.dimensions.slice(0)
+        };
+        _newBaseUnit.key = baseName;
+        BASE_UNITS[baseName] = _newBaseUnit;
+        currentUnitSystem[baseName] = {
+          unit: newUnit,
+          prefix: PREFIXES.NONE['']
+        };
+        newUnit.base = BASE_UNITS[baseName];
+      }
+    }
+    Unit.UNITS[name] = newUnit;
+    for (var _i8 = 0; _i8 < aliases.length; _i8++) {
+      var aliasName = aliases[_i8];
+      var _alias = {};
+      for (var _key6 in newUnit) {
+        if (hasOwnProperty(newUnit, _key6)) {
+          _alias[_key6] = newUnit[_key6];
+        }
+      }
+      _alias.name = aliasName;
+      Unit.UNITS[aliasName] = _alias;
+    }
+
+    // delete the memoization cache because we created a new unit
+    delete _findUnit.cache;
+    return new Unit(null, name);
+  };
+  Unit.deleteUnit = function (name) {
+    delete Unit.UNITS[name];
+
+    // delete the memoization cache because we deleted a unit
+    delete _findUnit.cache;
+  };
+
+  // expose arrays with prefixes, dimensions, units, systems
+  Unit.PREFIXES = PREFIXES;
+  Unit.BASE_DIMENSIONS = BASE_DIMENSIONS;
+  Unit.BASE_UNITS = BASE_UNITS;
+  Unit.UNIT_SYSTEMS = UNIT_SYSTEMS;
+  Unit.UNITS = UNITS;
+  return Unit;
+}, {
+  isClass: true
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js b/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js
new file mode 100644
index 0000000..5c4624f
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/createUnit.js
@@ -0,0 +1,79 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'createUnit';
+var dependencies = ['typed', 'Unit'];
+export var createCreateUnit = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Unit
+  } = _ref;
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   *
+   * Syntax:
+   *
+   *     math.createUnit({
+   *       baseUnit1: {
+   *         aliases: [string, ...]
+   *         prefixes: object
+   *       },
+   *       unit2: {
+   *         definition: string,
+   *         aliases: [string, ...]
+   *         prefixes: object,
+   *         offset: number
+   *       },
+   *       unit3: string    // Shortcut
+   *     })
+   *
+   *     // Another shortcut:
+   *     math.createUnit(string, unit : string, [object])
+   *
+   * Examples:
+   *
+   *     math.createUnit('foo')
+   *     math.createUnit('knot', {definition: '0.514444444 m/s', aliases: ['knots', 'kt', 'kts']})
+   *     math.createUnit('mph', '1 mile/hour')
+   *     math.createUnit('km', math.unit(1000, 'm'))
+   *
+   * @param {string} name      The name of the new unit. Must be unique. Example: 'knot'
+   * @param {string, UnitDefinition, Unit} definition      Definition of the unit in terms of existing units. For example, '0.514444444 m / s'.
+   * @param {Object} options   (optional) An object containing any of the following properties:
+   *     - `prefixes {string}` "none", "short", "long", "binary_short", or "binary_long". The default is "none".
+   *     - `aliases {Array}` Array of strings. Example: ['knots', 'kt', 'kts']
+   *     - `offset {Numeric}` An offset to apply when converting from the unit. For example, the offset for celsius is 273.15. Default is 0.
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @return {Unit} The new unit
+   */
+  return typed(name, {
+    // General function signature. First parameter is an object where each property is the definition of a new unit. The object keys are the unit names and the values are the definitions. The values can be objects, strings, or Units. If a property is an empty object or an empty string, a new base unit is created. The second parameter is the options.
+    'Object, Object': function Object_Object(obj, options) {
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    Object: function Object(obj) {
+      return Unit.createUnit(obj, {});
+    },
+    // Shortcut method for creating one unit.
+    'string, Unit | string | Object, Object': function string_Unit__string__Object_Object(name, def, options) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, options);
+    },
+    // Same as above but without the options.
+    'string, Unit | string | Object': function string_Unit__string__Object(name, def) {
+      var obj = {};
+      obj[name] = def;
+      return Unit.createUnit(obj, {});
+    },
+    // Without a definition, creates a base unit.
+    string: function string(name) {
+      var obj = {};
+      obj[name] = {};
+      return Unit.createUnit(obj, {});
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js b/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js
new file mode 100644
index 0000000..f89e59e
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/splitUnit.js
@@ -0,0 +1,32 @@
+import { factory } from '../../../utils/factory.js';
+var name = 'splitUnit';
+var dependencies = ['typed'];
+export var createSplitUnit = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+  /**
+   * Split a unit in an array of units whose sum is equal to the original unit.
+   *
+   * Syntax:
+   *
+   *     math.splitUnit(unit: Unit, parts: Array.<Unit>)
+   *
+   * Example:
+   *
+   *     math.splitUnit(new Unit(1, 'm'), ['feet', 'inch'])
+   *     // [ 3 feet, 3.3700787401575 inch ]
+   *
+   * See also:
+   *
+   *     unit
+   *
+   * @param {Array} [parts] An array of strings or valueless units.
+   * @return {Array} An array of units.
+   */
+  return typed(name, {
+    'Unit, Array': function Unit_Array(unit, parts) {
+      return unit.splitUnit(parts);
+    }
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/function/unit.js b/node_modules/mathjs/lib/esm/type/unit/function/unit.js
new file mode 100644
index 0000000..612d68a
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/function/unit.js
@@ -0,0 +1,60 @@
+import { factory } from '../../../utils/factory.js';
+import { deepMap } from '../../../utils/collection.js';
+var name = 'unit';
+var dependencies = ['typed', 'Unit'];
+
+// This function is named createUnitFunction to prevent a naming conflict with createUnit
+export var createUnitFunction = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    Unit
+  } = _ref;
+  /**
+   * Create a unit. Depending on the passed arguments, the function
+   * will create and return a new math.Unit object.
+   * When a matrix is provided, all elements will be converted to units.
+   *
+   * Syntax:
+   *
+   *     math.unit(unit : string)
+   *     math.unit(value : number, valuelessUnit : Unit)
+   *     math.unit(value : number, valuelessUnit : string)
+   *
+   * Examples:
+   *
+   *    const kph = math.unit('km/h')   // returns Unit km/h (valueless)
+   *    const v = math.unit(25, kph)    // returns Unit 25 km/h
+   *    const a = math.unit(5, 'cm')    // returns Unit 50 mm
+   *    const b = math.unit('23 kg')    // returns Unit 23 kg
+   *    a.to('m')                       // returns Unit 0.05 m
+   *
+   * See also:
+   *
+   *    bignumber, boolean, complex, index, matrix, number, string, createUnit
+   *
+   * @param {* | Array | Matrix} args   A number and unit.
+   * @return {Unit | Array | Matrix}    The created unit
+   */
+
+  return typed(name, {
+    Unit: function Unit(x) {
+      return x.clone();
+    },
+    string: function string(x) {
+      if (Unit.isValuelessUnit(x)) {
+        return new Unit(null, x); // a pure unit
+      }
+      return Unit.parse(x, {
+        allowNoUnits: true
+      }); // a unit with value, like '5cm'
+    },
+    'number | BigNumber | Fraction | Complex, string | Unit': function number__BigNumber__Fraction__Complex_string__Unit(value, unit) {
+      return new Unit(value, unit);
+    },
+    'number | BigNumber | Fraction': function number__BigNumber__Fraction(value) {
+      // dimensionless
+      return new Unit(value);
+    },
+    'Array | Matrix': typed.referToSelf(self => x => deepMap(x, self))
+  });
+});
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js b/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js
new file mode 100644
index 0000000..4697de8
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/type/unit/physicalConstants.js
@@ -0,0 +1,102 @@
+import { factory } from '../../utils/factory.js';
+
+// Source: https://en.wikipedia.org/wiki/Physical_constant
+
+// Universal constants
+export var createSpeedOfLight = /* #__PURE__ */unitFactory('speedOfLight', '299792458', 'm s^-1');
+export var createGravitationConstant = /* #__PURE__ */unitFactory('gravitationConstant', '6.67430e-11', 'm^3 kg^-1 s^-2');
+export var createPlanckConstant = /* #__PURE__ */unitFactory('planckConstant', '6.62607015e-34', 'J s');
+export var createReducedPlanckConstant = /* #__PURE__ */unitFactory('reducedPlanckConstant', '1.0545718176461565e-34', 'J s');
+
+// Electromagnetic constants
+export var createMagneticConstant = /* #__PURE__ */unitFactory('magneticConstant', '1.25663706212e-6', 'N A^-2');
+export var createElectricConstant = /* #__PURE__ */unitFactory('electricConstant', '8.8541878128e-12', 'F m^-1');
+export var createVacuumImpedance = /* #__PURE__ */unitFactory('vacuumImpedance', '376.730313667', 'ohm');
+export var createCoulomb = /* #__PURE__ */unitFactory('coulomb', '8.987551792261171e9', 'N m^2 C^-2'); // Deprecated in favor of coulombConstant
+export var createCoulombConstant = /* #__PURE__ */unitFactory('coulombConstant', '8.987551792261171e9', 'N m^2 C^-2');
+export var createElementaryCharge = /* #__PURE__ */unitFactory('elementaryCharge', '1.602176634e-19', 'C');
+export var createBohrMagneton = /* #__PURE__ */unitFactory('bohrMagneton', '9.2740100783e-24', 'J T^-1');
+export var createConductanceQuantum = /* #__PURE__ */unitFactory('conductanceQuantum', '7.748091729863649e-5', 'S');
+export var createInverseConductanceQuantum = /* #__PURE__ */unitFactory('inverseConductanceQuantum', '12906.403729652257', 'ohm');
+export var createMagneticFluxQuantum = /* #__PURE__ */unitFactory('magneticFluxQuantum', '2.0678338484619295e-15', 'Wb');
+export var createNuclearMagneton = /* #__PURE__ */unitFactory('nuclearMagneton', '5.0507837461e-27', 'J T^-1');
+export var createKlitzing = /* #__PURE__ */unitFactory('klitzing', '25812.807459304513', 'ohm');
+export var createJosephson = /* #__PURE__ */unitFactory('josephson', '4.835978484169836e14 Hz V', 'Hz V^-1'); // TODO: support for Hz needed
+
+// Atomic and nuclear constants
+export var createBohrRadius = /* #__PURE__ */unitFactory('bohrRadius', '5.29177210903e-11', 'm');
+export var createClassicalElectronRadius = /* #__PURE__ */unitFactory('classicalElectronRadius', '2.8179403262e-15', 'm');
+export var createElectronMass = /* #__PURE__ */unitFactory('electronMass', '9.1093837015e-31', 'kg');
+export var createFermiCoupling = /* #__PURE__ */unitFactory('fermiCoupling', '1.1663787e-5', 'GeV^-2');
+export var createFineStructure = numberFactory('fineStructure', 7.2973525693e-3);
+export var createHartreeEnergy = /* #__PURE__ */unitFactory('hartreeEnergy', '4.3597447222071e-18', 'J');
+export var createProtonMass = /* #__PURE__ */unitFactory('protonMass', '1.67262192369e-27', 'kg');
+export var createDeuteronMass = /* #__PURE__ */unitFactory('deuteronMass', '3.3435830926e-27', 'kg');
+export var createNeutronMass = /* #__PURE__ */unitFactory('neutronMass', '1.6749271613e-27', 'kg');
+export var createQuantumOfCirculation = /* #__PURE__ */unitFactory('quantumOfCirculation', '3.6369475516e-4', 'm^2 s^-1');
+export var createRydberg = /* #__PURE__ */unitFactory('rydberg', '10973731.568160', 'm^-1');
+export var createThomsonCrossSection = /* #__PURE__ */unitFactory('thomsonCrossSection', '6.6524587321e-29', 'm^2');
+export var createWeakMixingAngle = numberFactory('weakMixingAngle', 0.22290);
+export var createEfimovFactor = numberFactory('efimovFactor', 22.7);
+
+// Physico-chemical constants
+export var createAtomicMass = /* #__PURE__ */unitFactory('atomicMass', '1.66053906660e-27', 'kg');
+export var createAvogadro = /* #__PURE__ */unitFactory('avogadro', '6.02214076e23', 'mol^-1');
+export var createBoltzmann = /* #__PURE__ */unitFactory('boltzmann', '1.380649e-23', 'J K^-1');
+export var createFaraday = /* #__PURE__ */unitFactory('faraday', '96485.33212331001', 'C mol^-1');
+export var createFirstRadiation = /* #__PURE__ */unitFactory('firstRadiation', '3.7417718521927573e-16', 'W m^2');
+// TODO spectralRadiance = 1.1910429723971881e-16 W m^2 sr^-1
+export var createLoschmidt = /* #__PURE__ */unitFactory('loschmidt', '2.686780111798444e25', 'm^-3');
+export var createGasConstant = /* #__PURE__ */unitFactory('gasConstant', '8.31446261815324', 'J K^-1 mol^-1');
+export var createMolarPlanckConstant = /* #__PURE__ */unitFactory('molarPlanckConstant', '3.990312712893431e-10', 'J s mol^-1');
+export var createMolarVolume = /* #__PURE__ */unitFactory('molarVolume', '0.022413969545014137', 'm^3 mol^-1');
+export var createSackurTetrode = numberFactory('sackurTetrode', -1.16487052358);
+export var createSecondRadiation = /* #__PURE__ */unitFactory('secondRadiation', '0.014387768775039337', 'm K');
+export var createStefanBoltzmann = /* #__PURE__ */unitFactory('stefanBoltzmann', '5.67037441918443e-8', 'W m^-2 K^-4');
+export var createWienDisplacement = /* #__PURE__ */unitFactory('wienDisplacement', '2.897771955e-3', 'm K');
+
+// Adopted values
+export var createMolarMass = /* #__PURE__ */unitFactory('molarMass', '0.99999999965e-3', 'kg mol^-1');
+export var createMolarMassC12 = /* #__PURE__ */unitFactory('molarMassC12', '11.9999999958e-3', 'kg mol^-1');
+export var createGravity = /* #__PURE__ */unitFactory('gravity', '9.80665', 'm s^-2');
+// atm is defined in Unit.js
+
+// Natural units
+export var createPlanckLength = /* #__PURE__ */unitFactory('planckLength', '1.616255e-35', 'm');
+export var createPlanckMass = /* #__PURE__ */unitFactory('planckMass', '2.176435e-8', 'kg');
+export var createPlanckTime = /* #__PURE__ */unitFactory('planckTime', '5.391245e-44', 's');
+export var createPlanckCharge = /* #__PURE__ */unitFactory('planckCharge', '1.87554603778e-18', 'C');
+export var createPlanckTemperature = /* #__PURE__ */unitFactory('planckTemperature', '1.416785e+32', 'K');
+
+// helper function to create a factory function which creates a physical constant,
+// a Unit with either a number value or a BigNumber value depending on the configuration
+function unitFactory(name, valueStr, unitStr) {
+  var dependencies = ['config', 'Unit', 'BigNumber'];
+  return factory(name, dependencies, _ref => {
+    var {
+      config,
+      Unit,
+      BigNumber
+    } = _ref;
+    // Note that we can parse into number or BigNumber.
+    // We do not parse into Fractions as that doesn't make sense: we would lose precision of the values
+    // Therefore we dont use Unit.parse()
+    var value = config.number === 'BigNumber' ? new BigNumber(valueStr) : parseFloat(valueStr);
+    var unit = new Unit(value, unitStr);
+    unit.fixPrefix = true;
+    return unit;
+  });
+}
+
+// helper function to create a factory function which creates a numeric constant,
+// either a number or BigNumber depending on the configuration
+function numberFactory(name, value) {
+  var dependencies = ['config', 'BigNumber'];
+  return factory(name, dependencies, _ref2 => {
+    var {
+      config,
+      BigNumber
+    } = _ref2;
+    return config.number === 'BigNumber' ? new BigNumber(value) : value;
+  });
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/array.js b/node_modules/mathjs/lib/esm/utils/array.js
new file mode 100644
index 0000000..2d759ed
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/array.js
@@ -0,0 +1,932 @@
+import _extends from "@babel/runtime/helpers/extends";
+import { isInteger } from './number.js';
+import { isNumber, isBigNumber, isArray, isString } from './is.js';
+import { format } from './string.js';
+import { DimensionError } from '../error/DimensionError.js';
+import { IndexError } from '../error/IndexError.js';
+import { deepStrictEqual } from './object.js';
+
+/**
+ * Calculate the size of a multi dimensional array.
+ * This function checks the size of the first entry, it does not validate
+ * whether all dimensions match. (use function `validate` for that)
+ * @param {Array} x
+ * @return {number[]} size
+ */
+export function arraySize(x) {
+  var s = [];
+  while (Array.isArray(x)) {
+    s.push(x.length);
+    x = x[0];
+  }
+  return s;
+}
+
+/**
+ * Recursively validate whether each element in a multi dimensional array
+ * has a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @param {number} dim     Current dimension
+ * @throws DimensionError
+ * @private
+ */
+function _validate(array, size, dim) {
+  var i;
+  var len = array.length;
+  if (len !== size[dim]) {
+    throw new DimensionError(len, size[dim]);
+  }
+  if (dim < size.length - 1) {
+    // recursively validate each child array
+    var dimNext = dim + 1;
+    for (i = 0; i < len; i++) {
+      var child = array[i];
+      if (!Array.isArray(child)) {
+        throw new DimensionError(size.length - 1, size.length, '<');
+      }
+      _validate(array[i], size, dimNext);
+    }
+  } else {
+    // last dimension. none of the children may be an array
+    for (i = 0; i < len; i++) {
+      if (Array.isArray(array[i])) {
+        throw new DimensionError(size.length + 1, size.length, '>');
+      }
+    }
+  }
+}
+
+/**
+ * Validate whether each element in a multi dimensional array has
+ * a size corresponding to the provided size array.
+ * @param {Array} array    Array to be validated
+ * @param {number[]} size  Array with the size of each dimension
+ * @throws DimensionError
+ */
+export function validate(array, size) {
+  var isScalar = size.length === 0;
+  if (isScalar) {
+    // scalar
+    if (Array.isArray(array)) {
+      throw new DimensionError(array.length, 0);
+    }
+  } else {
+    // array
+    _validate(array, size, 0);
+  }
+}
+
+/**
+ * Validate whether the source of the index matches the size of the Array
+ * @param {Array | Matrix} value    Array to be validated
+ * @param {Index} index  Index with the source information to validate
+ * @throws DimensionError
+ */
+export function validateIndexSourceSize(value, index) {
+  var valueSize = value.isMatrix ? value._size : arraySize(value);
+  var sourceSize = index._sourceSize;
+  // checks if the source size is not null and matches the valueSize
+  sourceSize.forEach((sourceDim, i) => {
+    if (sourceDim !== null && sourceDim !== valueSize[i]) {
+      throw new DimensionError(sourceDim, valueSize[i]);
+    }
+  });
+}
+
+/**
+ * Test whether index is an integer number with index >= 0 and index < length
+ * when length is provided
+ * @param {number} index    Zero-based index
+ * @param {number} [length] Length of the array
+ */
+export function validateIndex(index, length) {
+  if (index !== undefined) {
+    if (!isNumber(index) || !isInteger(index)) {
+      throw new TypeError('Index must be an integer (value: ' + index + ')');
+    }
+    if (index < 0 || typeof length === 'number' && index >= length) {
+      throw new IndexError(index, length);
+    }
+  }
+}
+
+/**
+ * Test if an index has empty values
+ * @param {Index} index    Zero-based index
+ */
+export function isEmptyIndex(index) {
+  for (var i = 0; i < index._dimensions.length; ++i) {
+    var dimension = index._dimensions[i];
+    if (dimension._data && isArray(dimension._data)) {
+      if (dimension._size[0] === 0) {
+        return true;
+      }
+    } else if (dimension.isRange) {
+      if (dimension.start === dimension.end) {
+        return true;
+      }
+    } else if (isString(dimension)) {
+      if (dimension.length === 0) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+
+/**
+ * Resize a multi dimensional array. The resized array is returned.
+ * @param {Array | number} array         Array to be resized
+ * @param {number[]} size Array with the size of each dimension
+ * @param {*} [defaultValue=0]  Value to be filled in new entries,
+ *                              zero by default. Specify for example `null`,
+ *                              to clearly see entries that are not explicitly
+ *                              set.
+ * @return {Array} array         The resized array
+ */
+export function resize(array, size, defaultValue) {
+  // check the type of the arguments
+  if (!Array.isArray(size)) {
+    throw new TypeError('Array expected');
+  }
+  if (size.length === 0) {
+    throw new Error('Resizing to scalar is not supported');
+  }
+
+  // check whether size contains positive integers
+  size.forEach(function (value) {
+    if (!isNumber(value) || !isInteger(value) || value < 0) {
+      throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + format(size) + ')');
+    }
+  });
+
+  // convert number to an array
+  if (isNumber(array) || isBigNumber(array)) {
+    array = [array];
+  }
+
+  // recursively resize the array
+  var _defaultValue = defaultValue !== undefined ? defaultValue : 0;
+  _resize(array, size, 0, _defaultValue);
+  return array;
+}
+
+/**
+ * Recursively resize a multi dimensional array
+ * @param {Array} array         Array to be resized
+ * @param {number[]} size       Array with the size of each dimension
+ * @param {number} dim          Current dimension
+ * @param {*} [defaultValue]    Value to be filled in new entries,
+ *                              undefined by default.
+ * @private
+ */
+function _resize(array, size, dim, defaultValue) {
+  var i;
+  var elem;
+  var oldLen = array.length;
+  var newLen = size[dim];
+  var minLen = Math.min(oldLen, newLen);
+
+  // apply new length
+  array.length = newLen;
+  if (dim < size.length - 1) {
+    // non-last dimension
+    var dimNext = dim + 1;
+
+    // resize existing child arrays
+    for (i = 0; i < minLen; i++) {
+      // resize child array
+      elem = array[i];
+      if (!Array.isArray(elem)) {
+        elem = [elem]; // add a dimension
+        array[i] = elem;
+      }
+      _resize(elem, size, dimNext, defaultValue);
+    }
+
+    // create new child arrays
+    for (i = minLen; i < newLen; i++) {
+      // get child array
+      elem = [];
+      array[i] = elem;
+
+      // resize new child array
+      _resize(elem, size, dimNext, defaultValue);
+    }
+  } else {
+    // last dimension
+
+    // remove dimensions of existing values
+    for (i = 0; i < minLen; i++) {
+      while (Array.isArray(array[i])) {
+        array[i] = array[i][0];
+      }
+    }
+
+    // fill new elements with the default value
+    for (i = minLen; i < newLen; i++) {
+      array[i] = defaultValue;
+    }
+  }
+}
+
+/**
+ * Re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {number[]} sizes        List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ *
+ * @throws {DimensionError}       If the product of the new dimension sizes does
+ *                                not equal that of the old ones
+ */
+export function reshape(array, sizes) {
+  var flatArray = flatten(array, true); // since it has rectangular
+  var currentLength = flatArray.length;
+  if (!Array.isArray(array) || !Array.isArray(sizes)) {
+    throw new TypeError('Array expected');
+  }
+  if (sizes.length === 0) {
+    throw new DimensionError(0, currentLength, '!=');
+  }
+  sizes = processSizesWildcard(sizes, currentLength);
+  var newLength = product(sizes);
+  if (currentLength !== newLength) {
+    throw new DimensionError(newLength, currentLength, '!=');
+  }
+  try {
+    return _reshape(flatArray, sizes);
+  } catch (e) {
+    if (e instanceof DimensionError) {
+      throw new DimensionError(newLength, currentLength, '!=');
+    }
+    throw e;
+  }
+}
+
+/**
+ * Replaces the wildcard -1 in the sizes array.
+ * @param {number[]} sizes  List of sizes for each dimension. At most one wildcard.
+ * @param {number} currentLength  Number of elements in the array.
+ * @throws {Error}                If more than one wildcard or unable to replace it.
+ * @returns {number[]}      The sizes array with wildcard replaced.
+ */
+export function processSizesWildcard(sizes, currentLength) {
+  var newLength = product(sizes);
+  var processedSizes = sizes.slice();
+  var WILDCARD = -1;
+  var wildCardIndex = sizes.indexOf(WILDCARD);
+  var isMoreThanOneWildcard = sizes.indexOf(WILDCARD, wildCardIndex + 1) >= 0;
+  if (isMoreThanOneWildcard) {
+    throw new Error('More than one wildcard in sizes');
+  }
+  var hasWildcard = wildCardIndex >= 0;
+  var canReplaceWildcard = currentLength % newLength === 0;
+  if (hasWildcard) {
+    if (canReplaceWildcard) {
+      processedSizes[wildCardIndex] = -currentLength / newLength;
+    } else {
+      throw new Error('Could not replace wildcard, since ' + currentLength + ' is no multiple of ' + -newLength);
+    }
+  }
+  return processedSizes;
+}
+
+/**
+ * Computes the product of all array elements.
+ * @param {number[]} array Array of factors
+ * @returns {number}            Product of all elements
+ */
+function product(array) {
+  return array.reduce((prev, curr) => prev * curr, 1);
+}
+
+/**
+ * Iteratively re-shape a multi dimensional array to fit the specified dimensions
+ * @param {Array} array           Array to be reshaped
+ * @param {number[]} sizes  List of sizes for each dimension
+ * @returns {Array}               Array whose data has been formatted to fit the
+ *                                specified dimensions
+ */
+
+function _reshape(array, sizes) {
+  // testing if there are enough elements for the requested shape
+  var tmpArray = array;
+  var tmpArray2;
+  // for each dimension starting by the last one and ignoring the first one
+  for (var sizeIndex = sizes.length - 1; sizeIndex > 0; sizeIndex--) {
+    var size = sizes[sizeIndex];
+    tmpArray2 = [];
+
+    // aggregate the elements of the current tmpArray in elements of the requested size
+    var length = tmpArray.length / size;
+    for (var i = 0; i < length; i++) {
+      tmpArray2.push(tmpArray.slice(i * size, (i + 1) * size));
+    }
+    // set it as the new tmpArray for the next loop turn or for return
+    tmpArray = tmpArray2;
+  }
+  return tmpArray;
+}
+
+/**
+ * Squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {Array} [size]
+ * @returns {Array} returns the array itself
+ */
+export function squeeze(array, size) {
+  var s = size || arraySize(array);
+
+  // squeeze outer dimensions
+  while (Array.isArray(array) && array.length === 1) {
+    array = array[0];
+    s.shift();
+  }
+
+  // find the first dimension to be squeezed
+  var dims = s.length;
+  while (s[dims - 1] === 1) {
+    dims--;
+  }
+
+  // squeeze inner dimensions
+  if (dims < s.length) {
+    array = _squeeze(array, dims, 0);
+    s.length = dims;
+  }
+  return array;
+}
+
+/**
+ * Recursively squeeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the squeezed array
+ * @private
+ */
+function _squeeze(array, dims, dim) {
+  var i, ii;
+  if (dim < dims) {
+    var next = dim + 1;
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _squeeze(array[i], dims, next);
+    }
+  } else {
+    while (Array.isArray(array)) {
+      array = array[0];
+    }
+  }
+  return array;
+}
+
+/**
+ * Unsqueeze a multi dimensional array: add dimensions when missing
+ *
+ * Parameter `size` will be mutated to match the new, unsqueezed matrix size.
+ *
+ * @param {Array} array
+ * @param {number} dims       Desired number of dimensions of the array
+ * @param {number} [outer]    Number of outer dimensions to be added
+ * @param {Array} [size] Current size of array.
+ * @returns {Array} returns the array itself
+ * @private
+ */
+export function unsqueeze(array, dims, outer, size) {
+  var s = size || arraySize(array);
+
+  // unsqueeze outer dimensions
+  if (outer) {
+    for (var i = 0; i < outer; i++) {
+      array = [array];
+      s.unshift(1);
+    }
+  }
+
+  // unsqueeze inner dimensions
+  array = _unsqueeze(array, dims, 0);
+  while (s.length < dims) {
+    s.push(1);
+  }
+  return array;
+}
+
+/**
+ * Recursively unsqueeze a multi dimensional array
+ * @param {Array} array
+ * @param {number} dims Required number of dimensions
+ * @param {number} dim  Current dimension
+ * @returns {Array | *} Returns the unsqueezed array
+ * @private
+ */
+function _unsqueeze(array, dims, dim) {
+  var i, ii;
+  if (Array.isArray(array)) {
+    var next = dim + 1;
+    for (i = 0, ii = array.length; i < ii; i++) {
+      array[i] = _unsqueeze(array[i], dims, next);
+    }
+  } else {
+    for (var d = dim; d < dims; d++) {
+      array = [array];
+    }
+  }
+  return array;
+}
+/**
+ * Flatten a multi dimensional array, put all elements in a one dimensional
+ * array
+ * @param {Array} array   A multi dimensional array
+ * @param {boolean} isRectangular Optional. If the array is rectangular (not jagged)
+ * @return {Array}        The flattened array (1 dimensional)
+ */
+export function flatten(array) {
+  var isRectangular = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+  if (!Array.isArray(array)) {
+    // if not an array, return as is
+    return array;
+  }
+  if (typeof isRectangular !== 'boolean') {
+    throw new TypeError('Boolean expected for second argument of flatten');
+  }
+  var flat = [];
+  if (isRectangular) {
+    _flattenRectangular(array);
+  } else {
+    _flatten(array);
+  }
+  return flat;
+  function _flatten(array) {
+    for (var i = 0; i < array.length; i++) {
+      var item = array[i];
+      if (Array.isArray(item)) {
+        _flatten(item);
+      } else {
+        flat.push(item);
+      }
+    }
+  }
+  function _flattenRectangular(array) {
+    if (Array.isArray(array[0])) {
+      for (var i = 0; i < array.length; i++) {
+        _flattenRectangular(array[i]);
+      }
+    } else {
+      for (var _i = 0; _i < array.length; _i++) {
+        flat.push(array[_i]);
+      }
+    }
+  }
+}
+
+/**
+ * A safe map
+ * @param {Array} array
+ * @param {function} callback
+ */
+export function map(array, callback) {
+  return Array.prototype.map.call(array, callback);
+}
+
+/**
+ * A safe forEach
+ * @param {Array} array
+ * @param {function} callback
+ */
+export function forEach(array, callback) {
+  Array.prototype.forEach.call(array, callback);
+}
+
+/**
+ * A safe filter
+ * @param {Array} array
+ * @param {function} callback
+ */
+export function filter(array, callback) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+  return Array.prototype.filter.call(array, callback);
+}
+
+/**
+ * Filter values in an array given a regular expression
+ * @param {Array} array
+ * @param {RegExp} regexp
+ * @return {Array} Returns the filtered array
+ * @private
+ */
+export function filterRegExp(array, regexp) {
+  if (arraySize(array).length !== 1) {
+    throw new Error('Only one dimensional matrices supported');
+  }
+  return Array.prototype.filter.call(array, entry => regexp.test(entry));
+}
+
+/**
+ * A safe join
+ * @param {Array} array
+ * @param {string} separator
+ */
+export function join(array, separator) {
+  return Array.prototype.join.call(array, separator);
+}
+
+/**
+ * Assign a numeric identifier to every element of a sorted array
+ * @param {Array} a  An array
+ * @return {Array} An array of objects containing the original value and its identifier
+ */
+export function identify(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+  if (a.length === 0) {
+    return a;
+  }
+  var b = [];
+  var count = 0;
+  b[0] = {
+    value: a[0],
+    identifier: 0
+  };
+  for (var i = 1; i < a.length; i++) {
+    if (a[i] === a[i - 1]) {
+      count++;
+    } else {
+      count = 0;
+    }
+    b.push({
+      value: a[i],
+      identifier: count
+    });
+  }
+  return b;
+}
+
+/**
+ * Remove the numeric identifier from the elements
+ * @param {array} a  An array
+ * @return {array} An array of values without identifiers
+ */
+export function generalize(a) {
+  if (!Array.isArray(a)) {
+    throw new TypeError('Array input expected');
+  }
+  if (a.length === 0) {
+    return a;
+  }
+  var b = [];
+  for (var i = 0; i < a.length; i++) {
+    b.push(a[i].value);
+  }
+  return b;
+}
+
+/**
+ * Check the datatype of a given object
+ * This is a low level implementation that should only be used by
+ * parent Matrix classes such as SparseMatrix or DenseMatrix
+ * This method does not validate Array Matrix shape
+ * @param {Array} array
+ * @param {function} typeOf   Callback function to use to determine the type of a value
+ * @return {string}
+ */
+export function getArrayDataType(array, typeOf) {
+  var type; // to hold type info
+  var length = 0; // to hold length value to ensure it has consistent sizes
+
+  for (var i = 0; i < array.length; i++) {
+    var item = array[i];
+    var _isArray = Array.isArray(item);
+
+    // Saving the target matrix row size
+    if (i === 0 && _isArray) {
+      length = item.length;
+    }
+
+    // If the current item is an array but the length does not equal the targetVectorSize
+    if (_isArray && item.length !== length) {
+      return undefined;
+    }
+    var itemType = _isArray ? getArrayDataType(item, typeOf) // recurse into a nested array
+    : typeOf(item);
+    if (type === undefined) {
+      type = itemType; // first item
+    } else if (type !== itemType) {
+      return 'mixed';
+    } else {
+      // we're good, everything has the same type so far
+    }
+  }
+  return type;
+}
+
+/**
+ * Return the last item from an array
+ * @param {Array} array
+ * @returns {*}
+ */
+export function last(array) {
+  return array[array.length - 1];
+}
+
+/**
+ * Get all but the last element of array.
+ * @param {Array} array
+ * @returns {Array}
+ */
+export function initial(array) {
+  return array.slice(0, array.length - 1);
+}
+
+/**
+ * Recursively concatenate two matrices.
+ * The contents of the matrices are not cloned.
+ * @param {Array} a             Multi dimensional array
+ * @param {Array} b             Multi dimensional array
+ * @param {number} concatDim    The dimension on which to concatenate (zero-based)
+ * @param {number} dim          The current dim (zero-based)
+ * @return {Array} c            The concatenated matrix
+ * @private
+ */
+function concatRecursive(a, b, concatDim, dim) {
+  if (dim < concatDim) {
+    // recurse into next dimension
+    if (a.length !== b.length) {
+      throw new DimensionError(a.length, b.length);
+    }
+    var c = [];
+    for (var i = 0; i < a.length; i++) {
+      c[i] = concatRecursive(a[i], b[i], concatDim, dim + 1);
+    }
+    return c;
+  } else {
+    // concatenate this dimension
+    return a.concat(b);
+  }
+}
+
+/**
+ * Concatenates many arrays in the specified direction
+ * @param {...Array} arrays All the arrays to concatenate
+ * @param {number} concatDim The dimension on which to concatenate (zero-based)
+ * @returns {Array}
+ */
+export function concat() {
+  var arrays = Array.prototype.slice.call(arguments, 0, -1);
+  var concatDim = Array.prototype.slice.call(arguments, -1);
+  if (arrays.length === 1) {
+    return arrays[0];
+  }
+  if (arrays.length > 1) {
+    return arrays.slice(1).reduce(function (A, B) {
+      return concatRecursive(A, B, concatDim, 0);
+    }, arrays[0]);
+  } else {
+    throw new Error('Wrong number of arguments in function concat');
+  }
+}
+
+/**
+ * Receives two or more sizes and gets the broadcasted size for both.
+ * @param  {...number[]} sizes Sizes to broadcast together
+ * @returns {number[]} The broadcasted size
+ */
+export function broadcastSizes() {
+  for (var _len = arguments.length, sizes = new Array(_len), _key = 0; _key < _len; _key++) {
+    sizes[_key] = arguments[_key];
+  }
+  var dimensions = sizes.map(s => s.length);
+  var N = Math.max(...dimensions);
+  var sizeMax = new Array(N).fill(null);
+  // check for every size
+  for (var i = 0; i < sizes.length; i++) {
+    var size = sizes[i];
+    var dim = dimensions[i];
+    for (var j = 0; j < dim; j++) {
+      var n = N - dim + j;
+      if (size[j] > sizeMax[n]) {
+        sizeMax[n] = size[j];
+      }
+    }
+  }
+  for (var _i2 = 0; _i2 < sizes.length; _i2++) {
+    checkBroadcastingRules(sizes[_i2], sizeMax);
+  }
+  return sizeMax;
+}
+
+/**
+ * Checks if it's possible to broadcast a size to another size
+ * @param {number[]} size The size of the array to check
+ * @param {number[]} toSize The size of the array to validate if it can be broadcasted to
+ */
+export function checkBroadcastingRules(size, toSize) {
+  var N = toSize.length;
+  var dim = size.length;
+  for (var j = 0; j < dim; j++) {
+    var n = N - dim + j;
+    if (size[j] < toSize[n] && size[j] > 1 || size[j] > toSize[n]) {
+      throw new Error("shape mismatch: mismatch is found in arg with shape (".concat(size, ") not possible to broadcast dimension ").concat(dim, " with size ").concat(size[j], " to size ").concat(toSize[n]));
+    }
+  }
+}
+
+/**
+ * Broadcasts a single array to a certain size
+ * @param {Array} array Array to be broadcasted
+ * @param {number[]} toSize Size to broadcast the array
+ * @returns {Array} The broadcasted array
+ */
+export function broadcastTo(array, toSize) {
+  var Asize = arraySize(array);
+  if (deepStrictEqual(Asize, toSize)) {
+    return array;
+  }
+  checkBroadcastingRules(Asize, toSize);
+  var broadcastedSize = broadcastSizes(Asize, toSize);
+  var N = broadcastedSize.length;
+  var paddedSize = [...Array(N - Asize.length).fill(1), ...Asize];
+  var A = clone(array);
+  // reshape A if needed to make it ready for concat
+  if (Asize.length < N) {
+    A = reshape(A, paddedSize);
+    Asize = arraySize(A);
+  }
+
+  // stretches the array on each dimension to make it the same size as index
+  for (var dim = 0; dim < N; dim++) {
+    if (Asize[dim] < broadcastedSize[dim]) {
+      A = stretch(A, broadcastedSize[dim], dim);
+      Asize = arraySize(A);
+    }
+  }
+  return A;
+}
+
+/**
+ * Broadcasts arrays and returns the broadcasted arrays in an array
+ * @param  {...Array | any} arrays
+ * @returns {Array[]} The broadcasted arrays
+ */
+export function broadcastArrays() {
+  for (var _len2 = arguments.length, arrays = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+    arrays[_key2] = arguments[_key2];
+  }
+  if (arrays.length === 0) {
+    throw new Error('Insufficient number of arguments in function broadcastArrays');
+  }
+  if (arrays.length === 1) {
+    return arrays[0];
+  }
+  var sizes = arrays.map(function (array) {
+    return arraySize(array);
+  });
+  var broadcastedSize = broadcastSizes(...sizes);
+  var broadcastedArrays = [];
+  arrays.forEach(function (array) {
+    broadcastedArrays.push(broadcastTo(array, broadcastedSize));
+  });
+  return broadcastedArrays;
+}
+
+/**
+ * Stretches a matrix up to a certain size in a certain dimension
+ * @param {Array} arrayToStretch
+ * @param {number[]} sizeToStretch
+ * @param {number} dimToStretch
+ * @returns {Array} The stretched array
+ */
+export function stretch(arrayToStretch, sizeToStretch, dimToStretch) {
+  return concat(...Array(sizeToStretch).fill(arrayToStretch), dimToStretch);
+}
+
+/**
+* Retrieves a single element from an array given an index.
+*
+* @param {Array} array - The array from which to retrieve the value.
+* @param {Array<number>} index - An array of indices specifying the position of the desired element in each dimension.
+* @returns {*} - The value at the specified position in the array.
+*
+* @example
+* const arr = [[[1, 2], [3, 4]], [[5, 6], [7, 8]]];
+* const index = [1, 0, 1];
+* console.log(get(arr, index)); // 6
+*/
+export function get(array, index) {
+  if (!Array.isArray(array)) {
+    throw new Error('Array expected');
+  }
+  var size = arraySize(array);
+  if (index.length !== size.length) {
+    throw new DimensionError(index.length, size.length);
+  }
+  for (var x = 0; x < index.length; x++) {
+    validateIndex(index[x], size[x]);
+  }
+  return index.reduce((acc, curr) => acc[curr], array);
+}
+
+/**
+ * Recursively maps over each element of nested array using a provided callback function.
+ *
+ * @param {Array} array - The array to be mapped.
+ * @param {Function} callback - The function to execute on each element, taking three arguments:
+ *   - `value` (any): The current element being processed in the array.
+ *   - `index` (Array<number>): The index of the current element being processed in the array.
+ *   - `array` (Array): The array `deepMap` was called upon.
+ * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
+ * @returns {Array} A new array with each element being the result of the callback function.
+ */
+export function deepMap(array, callback) {
+  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+  if (array.length === 0) {
+    return [];
+  }
+  if (skipIndex) {
+    return recursiveMap(array);
+  }
+  var index = [];
+  return recursiveMapWithIndex(array, 0);
+  function recursiveMapWithIndex(value, depth) {
+    if (Array.isArray(value)) {
+      var N = value.length;
+      var result = Array(N);
+      for (var i = 0; i < N; i++) {
+        index[depth] = i;
+        result[i] = recursiveMapWithIndex(value[i], depth + 1);
+      }
+      return result;
+    } else {
+      return callback(value, index.slice(0, depth), array);
+    }
+  }
+  function recursiveMap(value) {
+    if (Array.isArray(value)) {
+      var N = value.length;
+      var result = Array(N);
+      for (var i = 0; i < N; i++) {
+        result[i] = recursiveMap(value[i]);
+      }
+      return result;
+    } else {
+      return callback(value);
+    }
+  }
+}
+
+/**
+ * Recursively iterates over each element in a multi-dimensional array and applies a callback function.
+ *
+ * @param {Array} array - The multi-dimensional array to iterate over.
+ * @param {Function} callback - The function to execute for each element. It receives three arguments:
+ *   - {any} value: The current element being processed in the array.
+ *   - {Array<number>} index: The index of the current element in each dimension.
+ *   - {Array} array: The original array being processed.
+ * @param {boolean} [skipIndex=false] - If true, the callback function is called with only the value.
+ */
+export function deepForEach(array, callback) {
+  var skipIndex = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
+  if (array.length === 0) {
+    return;
+  }
+  if (skipIndex) {
+    recursiveForEach(array);
+    return;
+  }
+  var index = [];
+  recursiveForEachWithIndex(array, 0);
+  function recursiveForEachWithIndex(value, depth) {
+    if (Array.isArray(value)) {
+      var N = value.length;
+      for (var i = 0; i < N; i++) {
+        index[depth] = i;
+        recursiveForEachWithIndex(value[i], depth + 1);
+      }
+    } else {
+      callback(value, index.slice(0, depth), array);
+    }
+  }
+  function recursiveForEach(value) {
+    if (Array.isArray(value)) {
+      var N = value.length;
+      for (var i = 0; i < N; i++) {
+        recursiveForEach(value[i]);
+      }
+    } else {
+      callback(value);
+    }
+  }
+}
+
+/**
+ * Deep clones a multidimensional array
+ * @param {Array} array
+ * @returns {Array} cloned array
+ */
+export function clone(array) {
+  return _extends([], array);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bigint.js b/node_modules/mathjs/lib/esm/utils/bigint.js
new file mode 100644
index 0000000..9e7f844
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bigint.js
@@ -0,0 +1,27 @@
+/**
+ * Build a bigint logarithm function from a number logarithm,
+ * still returning a number. The idea is that 15 hexadecimal digits
+ * (60 bits) saturates the mantissa of the log, and each additional hex
+ * digit effectively just adds the log of 16 to the resulting value. So
+ * convert the most significant 15 hex digits to a number and take its
+ * log, and then add the log of 16 for each additional hex digit that
+ * was in the bigint.
+ * For negative numbers (complex logarithms), following the bignum
+ * implementation, it just downgrades to number and uses the complex result.
+ * @param {number} log16  the log of 16
+ * @param {(number) -> number} numberLog  the logarithm function for numbers
+ * @param {ConfigurationObject} config  the mathjs configuration
+ * @param {(number) -> Complex} cplx  the associated Complex log
+ * @returns {(bigint) -> number}   the corresponding logarithm for bigints
+ */
+export function promoteLogarithm(log16, numberLog, config, cplx) {
+  return function (b) {
+    if (b > 0 || config.predictable) {
+      if (b <= 0) return NaN;
+      var s = b.toString(16);
+      var s15 = s.substring(0, 15);
+      return log16 * (s.length - s15.length) + numberLog(Number('0x' + s15));
+    }
+    return cplx(b.toNumber());
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js b/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js
new file mode 100644
index 0000000..dbcc60c
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/bitwise.js
@@ -0,0 +1,399 @@
+/**
+ * Bitwise and for Bignumbers
+ *
+ * Special Cases:
+ *   N &  n =  N
+ *   n &  0 =  0
+ *   n & -1 =  n
+ *   n &  n =  n
+ *   I &  I =  I
+ *  -I & -I = -I
+ *   I & -I =  0
+ *   I &  n =  n
+ *   I & -n =  I
+ *  -I &  n =  0
+ *  -I & -n = -I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` & `y`, is fully precise
+ * @private
+ */
+export function bitAndBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitAnd');
+  }
+  var BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.eq(-1) || x.eq(y)) {
+    return x;
+  }
+  if (y.isZero() || x.eq(-1)) {
+    return y;
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      if (x.isNegative() === y.isNegative()) {
+        return x;
+      }
+      return new BigNumber(0);
+    }
+    if (!x.isFinite()) {
+      if (y.isNegative()) {
+        return x;
+      }
+      if (x.isNegative()) {
+        return new BigNumber(0);
+      }
+      return y;
+    }
+    if (!y.isFinite()) {
+      if (x.isNegative()) {
+        return y;
+      }
+      if (y.isNegative()) {
+        return new BigNumber(0);
+      }
+      return x;
+    }
+  }
+  return bitwise(x, y, function (a, b) {
+    return a & b;
+  });
+}
+
+/**
+ * Bitwise not
+ * @param {BigNumber} x
+ * @return {BigNumber} Result of ~`x`, fully precise
+ *
+ */
+export function bitNotBigNumber(x) {
+  if (x.isFinite() && !x.isInteger()) {
+    throw new Error('Integer expected in function bitNot');
+  }
+  var BigNumber = x.constructor;
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  var result = x.plus(new BigNumber(1));
+  result.s = -result.s || null;
+  BigNumber.config({
+    precision: prevPrec
+  });
+  return result;
+}
+
+/**
+ * Bitwise OR for BigNumbers
+ *
+ * Special Cases:
+ *   N |  n =  N
+ *   n |  0 =  n
+ *   n | -1 = -1
+ *   n |  n =  n
+ *   I |  I =  I
+ *  -I | -I = -I
+ *   I | -n = -1
+ *   I | -I = -1
+ *   I |  n =  I
+ *  -I |  n = -I
+ *  -I | -n = -n
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` | `y`, fully precise
+ */
+export function bitOrBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitOr');
+  }
+  var BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  var negOne = new BigNumber(-1);
+  if (x.isZero() || y.eq(negOne) || x.eq(y)) {
+    return y;
+  }
+  if (y.isZero() || x.eq(negOne)) {
+    return x;
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !x.isNegative() && y.isNegative() || x.isNegative() && !y.isNegative() && !y.isFinite()) {
+      return negOne;
+    }
+    if (x.isNegative() && y.isNegative()) {
+      return x.isFinite() ? x : y;
+    }
+    return x.isFinite() ? y : x;
+  }
+  return bitwise(x, y, function (a, b) {
+    return a | b;
+  });
+}
+
+/**
+ * Applies bitwise function to numbers
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @param {function (a, b)} func
+ * @return {BigNumber}
+ */
+export function bitwise(x, y, func) {
+  var BigNumber = x.constructor;
+  var xBits, yBits;
+  var xSign = +(x.s < 0);
+  var ySign = +(y.s < 0);
+  if (xSign) {
+    xBits = decCoefficientToBinaryString(bitNotBigNumber(x));
+    for (var i = 0; i < xBits.length; ++i) {
+      xBits[i] ^= 1;
+    }
+  } else {
+    xBits = decCoefficientToBinaryString(x);
+  }
+  if (ySign) {
+    yBits = decCoefficientToBinaryString(bitNotBigNumber(y));
+    for (var _i = 0; _i < yBits.length; ++_i) {
+      yBits[_i] ^= 1;
+    }
+  } else {
+    yBits = decCoefficientToBinaryString(y);
+  }
+  var minBits, maxBits, minSign;
+  if (xBits.length <= yBits.length) {
+    minBits = xBits;
+    maxBits = yBits;
+    minSign = xSign;
+  } else {
+    minBits = yBits;
+    maxBits = xBits;
+    minSign = ySign;
+  }
+  var shortLen = minBits.length;
+  var longLen = maxBits.length;
+  var expFuncVal = func(xSign, ySign) ^ 1;
+  var outVal = new BigNumber(expFuncVal ^ 1);
+  var twoPower = new BigNumber(1);
+  var two = new BigNumber(2);
+  var prevPrec = BigNumber.precision;
+  BigNumber.config({
+    precision: 1E9
+  });
+  while (shortLen > 0) {
+    if (func(minBits[--shortLen], maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+    twoPower = twoPower.times(two);
+  }
+  while (longLen > 0) {
+    if (func(minSign, maxBits[--longLen]) === expFuncVal) {
+      outVal = outVal.plus(twoPower);
+    }
+    twoPower = twoPower.times(two);
+  }
+  BigNumber.config({
+    precision: prevPrec
+  });
+  if (expFuncVal === 0) {
+    outVal.s = -outVal.s;
+  }
+  return outVal;
+}
+
+/* Extracted from decimal.js, and edited to specialize. */
+function decCoefficientToBinaryString(x) {
+  // Convert to string
+  var a = x.d; // array with digits
+  var r = a[0] + '';
+  for (var i = 1; i < a.length; ++i) {
+    var s = a[i] + '';
+    for (var z = 7 - s.length; z--;) {
+      s = '0' + s;
+    }
+    r += s;
+  }
+  var j = r.length;
+  while (r.charAt(j) === '0') {
+    j--;
+  }
+  var xe = x.e;
+  var str = r.slice(0, j + 1 || 1);
+  var strL = str.length;
+  if (xe > 0) {
+    if (++xe > strL) {
+      // Append zeros.
+      xe -= strL;
+      while (xe--) {
+        str += '0';
+      }
+    } else if (xe < strL) {
+      str = str.slice(0, xe) + '.' + str.slice(xe);
+    }
+  }
+
+  // Convert from base 10 (decimal) to base 2
+  var arr = [0];
+  for (var _i2 = 0; _i2 < str.length;) {
+    var arrL = arr.length;
+    while (arrL--) {
+      arr[arrL] *= 10;
+    }
+    arr[0] += parseInt(str.charAt(_i2++)); // convert to int
+    for (var _j = 0; _j < arr.length; ++_j) {
+      if (arr[_j] > 1) {
+        if (arr[_j + 1] === null || arr[_j + 1] === undefined) {
+          arr[_j + 1] = 0;
+        }
+        arr[_j + 1] += arr[_j] >> 1;
+        arr[_j] &= 1;
+      }
+    }
+  }
+  return arr.reverse();
+}
+
+/**
+ * Bitwise XOR for BigNumbers
+ *
+ * Special Cases:
+ *   N ^  n =  N
+ *   n ^  0 =  n
+ *   n ^  n =  0
+ *   n ^ -1 = ~n
+ *   I ^  n =  I
+ *   I ^ -n = -I
+ *   I ^ -I = -1
+ *  -I ^  n = -I
+ *  -I ^ -n =  I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` ^ `y`, fully precise
+ *
+ */
+export function bitXor(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function bitXor');
+  }
+  var BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero()) {
+    return y;
+  }
+  if (y.isZero()) {
+    return x;
+  }
+  if (x.eq(y)) {
+    return new BigNumber(0);
+  }
+  var negOne = new BigNumber(-1);
+  if (x.eq(negOne)) {
+    return bitNotBigNumber(y);
+  }
+  if (y.eq(negOne)) {
+    return bitNotBigNumber(x);
+  }
+  if (!x.isFinite() || !y.isFinite()) {
+    if (!x.isFinite() && !y.isFinite()) {
+      return negOne;
+    }
+    return new BigNumber(x.isNegative() === y.isNegative() ? Infinity : -Infinity);
+  }
+  return bitwise(x, y, function (a, b) {
+    return a ^ b;
+  });
+}
+
+/**
+ * Bitwise left shift
+ *
+ * Special Cases:
+ *  n << -n = N
+ *  n <<  N = N
+ *  N <<  n = N
+ *  n <<  0 = n
+ *  0 <<  n = 0
+ *  I <<  I = N
+ *  I <<  n = I
+ *  n <<  I = I
+ *
+ * @param {BigNumber} x
+ * @param {BigNumber} y
+ * @return {BigNumber} Result of `x` << `y`
+ *
+ */
+export function leftShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function leftShift');
+  }
+  var BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+  if (!x.isFinite() && !y.isFinite()) {
+    return new BigNumber(NaN);
+  }
+
+  // Math.pow(2, y) is fully precise for y < 55, and fast
+  if (y.lt(55)) {
+    return x.times(Math.pow(2, y.toNumber()) + '');
+  }
+  return x.times(new BigNumber(2).pow(y));
+}
+
+/*
+ * Special Cases:
+ *   n >> -n =  N
+ *   n >>  N =  N
+ *   N >>  n =  N
+ *   I >>  I =  N
+ *   n >>  0 =  n
+ *   I >>  n =  I
+ *  -I >>  n = -I
+ *  -I >>  I = -I
+ *   n >>  I =  I
+ *  -n >>  I = -1
+ *   0 >>  n =  0
+ *
+ * @param {BigNumber} value
+ * @param {BigNumber} value
+ * @return {BigNumber} Result of `x` >> `y`
+ *
+ */
+export function rightArithShiftBigNumber(x, y) {
+  if (x.isFinite() && !x.isInteger() || y.isFinite() && !y.isInteger()) {
+    throw new Error('Integers expected in function rightArithShift');
+  }
+  var BigNumber = x.constructor;
+  if (x.isNaN() || y.isNaN() || y.isNegative() && !y.isZero()) {
+    return new BigNumber(NaN);
+  }
+  if (x.isZero() || y.isZero()) {
+    return x;
+  }
+  if (!y.isFinite()) {
+    if (x.isNegative()) {
+      return new BigNumber(-1);
+    }
+    if (!x.isFinite()) {
+      return new BigNumber(NaN);
+    }
+    return new BigNumber(0);
+  }
+
+  // Math.pow(2, y) is fully precise for y < 55, and fast
+  if (y.lt(55)) {
+    return x.div(Math.pow(2, y.toNumber()) + '').floor();
+  }
+  return x.div(new BigNumber(2).pow(y)).floor();
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/constants.js b/node_modules/mathjs/lib/esm/utils/bignumber/constants.js
new file mode 100644
index 0000000..aa69b29
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/constants.js
@@ -0,0 +1,57 @@
+import { memoize } from '../function.js';
+
+/**
+ * Calculate BigNumber e
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns e
+ */
+export var createBigNumberE = memoize(function (BigNumber) {
+  return new BigNumber(1).exp();
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber golden ratio, phi = (1+sqrt(5))/2
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns phi
+ */
+export var createBigNumberPhi = memoize(function (BigNumber) {
+  return new BigNumber(1).plus(new BigNumber(5).sqrt()).div(2);
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber pi.
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns pi
+ */
+export var createBigNumberPi = memoize(function (BigNumber) {
+  return BigNumber.acos(-1);
+}, {
+  hasher
+});
+
+/**
+ * Calculate BigNumber tau, tau = 2 * pi
+ * @param {function} BigNumber   BigNumber constructor
+ * @returns {BigNumber} Returns tau
+ */
+export var createBigNumberTau = memoize(function (BigNumber) {
+  return createBigNumberPi(BigNumber).times(2);
+}, {
+  hasher
+});
+
+/**
+ * Create a hash for a BigNumber constructor function. The created has is
+ * the configured precision
+ * @param {Array} args         Supposed to contain a single entry with
+ *                             a BigNumber constructor
+ * @return {number} precision
+ * @private
+ */
+function hasher(args) {
+  return args[0].precision;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js b/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js
new file mode 100644
index 0000000..d7d3adf
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js
@@ -0,0 +1,243 @@
+import { isBigNumber, isNumber } from '../is.js';
+import { isInteger, normalizeFormatOptions } from '../number.js';
+
+/**
+ * Formats a BigNumber in a given base
+ * @param {BigNumber} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+function formatBigNumberToBase(n, base, size) {
+  var BigNumberCtor = n.constructor;
+  var big2 = new BigNumberCtor(2);
+  var suffix = '';
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+    if (n.greaterThan(big2.pow(size - 1).sub(1)) || n.lessThan(big2.pow(size - 1).mul(-1))) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+    if (!n.isInteger()) {
+      throw new Error('Value must be an integer');
+    }
+    if (n.lessThan(0)) {
+      n = n.add(big2.pow(size));
+    }
+    suffix = "i".concat(size);
+  }
+  switch (base) {
+    case 2:
+      return "".concat(n.toBinary()).concat(suffix);
+    case 8:
+      return "".concat(n.toOctal()).concat(suffix);
+    case 16:
+      return "".concat(n.toHexadecimal()).concat(suffix);
+    default:
+      throw new Error("Base ".concat(base, " not supported "));
+  }
+}
+
+/**
+ * Convert a BigNumber to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lower` and `upper` bounds, and uses
+ *                                          exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12e8, {notation: 'fixed'})                  // returns '1200000000'
+ *    format(2.3,    {notation: 'fixed', precision: 4})  // returns '2.3000'
+ *    format(52.8,   {notation: 'exponential'})          // returns '5.28e+1'
+ *    format(12400,  {notation: 'engineering'})          // returns '12.400e+3'
+ *
+ * @param {BigNumber} value
+ * @param {Object | Function | number | BigNumber} [options]
+ * @return {string} str The formatted value
+ */
+export function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  }
+
+  // handle special cases
+  if (!value.isFinite()) {
+    return value.isNaN() ? 'NaN' : value.gt(0) ? 'Infinity' : '-Infinity';
+  }
+  var {
+    notation,
+    precision,
+    wordSize
+  } = normalizeFormatOptions(options);
+
+  // handle the various notations
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+    case 'exponential':
+      return toExponential(value, precision);
+    case 'engineering':
+      return toEngineering(value, precision);
+    case 'bin':
+      return formatBigNumberToBase(value, 2, wordSize);
+    case 'oct':
+      return formatBigNumberToBase(value, 8, wordSize);
+    case 'hex':
+      return formatBigNumberToBase(value, 16, wordSize);
+    case 'auto':
+      {
+        // determine lower and upper bound for exponential notation.
+        // TODO: implement support for upper and lower to be BigNumbers themselves
+        var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);
+        var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);
+
+        // handle special case zero
+        if (value.isZero()) return '0';
+
+        // determine whether or not to output exponential notation
+        var str;
+        var rounded = value.toSignificantDigits(precision);
+        var exp = rounded.e;
+        if (exp >= lowerExp && exp < upperExp) {
+          // normal number notation
+          str = rounded.toFixed();
+        } else {
+          // exponential notation
+          str = toExponential(value, precision);
+        }
+
+        // remove trailing zeros after the decimal point
+        return str.replace(/((\.\d*?)(0+))($|e)/, function () {
+          var digits = arguments[2];
+          var e = arguments[4];
+          return digits !== '.' ? digits + e : e;
+        });
+      }
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+
+/**
+ * Format a BigNumber in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+export function toEngineering(value, precision) {
+  // find nearest lower multiple of 3 for exponent
+  var e = value.e;
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+
+  // find difference in exponents, and calculate the value without exponent
+  var valueWithoutExp = value.mul(Math.pow(10, -newExp));
+  var valueStr = valueWithoutExp.toPrecision(precision);
+  if (valueStr.includes('e')) {
+    var BigNumber = value.constructor;
+    valueStr = new BigNumber(valueStr).toFixed();
+  }
+  return valueStr + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+}
+
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {BigNumber} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ * @returns {string} str
+ */
+export function toExponential(value, precision) {
+  if (precision !== undefined) {
+    return value.toExponential(precision - 1); // Note the offset of one
+  } else {
+    return value.toExponential();
+  }
+}
+
+/**
+ * Format a number with fixed notation.
+ * @param {BigNumber} value
+ * @param {number} [precision=undefined] Optional number of decimals after the
+ *                                       decimal point. Undefined by default.
+ */
+export function toFixed(value, precision) {
+  return value.toFixed(precision);
+}
+function _toNumberOrDefault(value, defaultValue) {
+  if (isNumber(value)) {
+    return value;
+  } else if (isBigNumber(value)) {
+    return value.toNumber();
+  } else {
+    return defaultValue;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js b/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js
new file mode 100644
index 0000000..8e4a455
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js
@@ -0,0 +1,39 @@
+/**
+ * Compares two BigNumbers.
+ * @param {BigNumber} a - First value to compare
+ * @param {BigNumber} b - Second value to compare
+ * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.
+ * @param {number} [absTol=0] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.
+ * @returns {boolean} whether the two numbers are nearly equal
+ * @throws {Error} If `relTol` is less than or equal to 0.
+ * @throws {Error} If `absTol` is less than 0.
+ *
+ * @example
+ * nearlyEqual(1.000000001, 1.0, 1e-9);            // true
+ * nearlyEqual(1.000000002, 1.0, 0);            // false
+ * nearlyEqual(1.0, 1.009, undefined, 0.02);       // true
+ * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true
+ */
+export function nearlyEqual(a, b) {
+  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-9;
+  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+  if (relTol <= 0) {
+    throw new Error('Relative tolerance must be greater than 0');
+  }
+  if (absTol < 0) {
+    throw new Error('Absolute tolerance must be at least 0');
+  }
+  // NaN
+  if (a.isNaN() || b.isNaN()) {
+    return false;
+  }
+  if (!a.isFinite() || !b.isFinite()) {
+    return a.eq(b);
+  }
+  // use "==" operator, handles infinities
+  if (a.eq(b)) {
+    return true;
+  }
+  // abs(a-b) <= max(relTol * max(abs(a), abs(b)), absTol)
+  return a.minus(b).abs().lte(a.constructor.max(a.constructor.max(a.abs(), b.abs()).mul(relTol), absTol));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/collection.js b/node_modules/mathjs/lib/esm/utils/collection.js
new file mode 100644
index 0000000..fab1d28
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/collection.js
@@ -0,0 +1,176 @@
+import { isCollection, isMatrix } from './is.js';
+import { IndexError } from '../error/IndexError.js';
+import { arraySize, deepMap as arrayDeepMap, deepForEach as arrayDeepForEach } from './array.js';
+import { _switch } from './switch.js';
+
+/**
+ * Test whether an array contains collections
+ * @param {Array} array
+ * @returns {boolean} Returns true when the array contains one or multiple
+ *                    collections (Arrays or Matrices). Returns false otherwise.
+ */
+export function containsCollections(array) {
+  for (var i = 0; i < array.length; i++) {
+    if (isCollection(array[i])) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/**
+ * Recursively loop over all elements in a given multi dimensional array
+ * and invoke the callback on each of the elements.
+ * @param {Array | Matrix} array
+ * @param {Function} callback     The callback method is invoked with one
+ *                                parameter: the current element in the array
+ */
+export function deepForEach(array, callback) {
+  if (isMatrix(array)) {
+    array.forEach(x => callback(x), false, true);
+  } else {
+    arrayDeepForEach(array, callback, true);
+  }
+}
+
+/**
+ * Execute the callback function element wise for each element in array and any
+ * nested array
+ * Returns an array with the results
+ * @param {Array | Matrix} array
+ * @param {Function} callback   The callback is called with two parameters:
+ *                              value1 and value2, which contain the current
+ *                              element of both arrays.
+ * @param {boolean} [skipZeros] Invoke callback function for non-zero values only.
+ *
+ * @return {Array | Matrix} res
+ */
+export function deepMap(array, callback, skipZeros) {
+  if (!skipZeros) {
+    if (isMatrix(array)) {
+      return array.map(x => callback(x), false, true);
+    } else {
+      return arrayDeepMap(array, callback, true);
+    }
+  }
+  var skipZerosCallback = x => x === 0 ? x : callback(x);
+  if (isMatrix(array)) {
+    return array.map(x => skipZerosCallback(x), false, true);
+  } else {
+    return arrayDeepMap(array, skipZerosCallback, true);
+  }
+}
+
+/**
+ * Reduce a given matrix or array to a new matrix or
+ * array with one less dimension, applying the given
+ * callback in the selected dimension.
+ * @param {Array | Matrix} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @return {Array | Matrix} res
+ */
+export function reduce(mat, dim, callback) {
+  var size = Array.isArray(mat) ? arraySize(mat) : mat.size();
+  if (dim < 0 || dim >= size.length) {
+    // TODO: would be more clear when throwing a DimensionError here
+    throw new IndexError(dim, size.length);
+  }
+  if (isMatrix(mat)) {
+    return mat.create(_reduce(mat.valueOf(), dim, callback), mat.datatype());
+  } else {
+    return _reduce(mat, dim, callback);
+  }
+}
+
+/**
+ * Recursively reduce a matrix
+ * @param {Array} mat
+ * @param {number} dim
+ * @param {Function} callback
+ * @returns {Array} ret
+ * @private
+ */
+function _reduce(mat, dim, callback) {
+  var i, ret, val, tran;
+  if (dim <= 0) {
+    if (!Array.isArray(mat[0])) {
+      val = mat[0];
+      for (i = 1; i < mat.length; i++) {
+        val = callback(val, mat[i]);
+      }
+      return val;
+    } else {
+      tran = _switch(mat);
+      ret = [];
+      for (i = 0; i < tran.length; i++) {
+        ret[i] = _reduce(tran[i], dim - 1, callback);
+      }
+      return ret;
+    }
+  } else {
+    ret = [];
+    for (i = 0; i < mat.length; i++) {
+      ret[i] = _reduce(mat[i], dim - 1, callback);
+    }
+    return ret;
+  }
+}
+
+// TODO: document function scatter
+export function scatter(a, j, w, x, u, mark, cindex, f, inverse, update, value) {
+  // a arrays
+  var avalues = a._values;
+  var aindex = a._index;
+  var aptr = a._ptr;
+
+  // vars
+  var k, k0, k1, i;
+
+  // check we need to process values (pattern matrix)
+  if (x) {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k];
+      // check value exists in current j
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark;
+        // add i to pattern of C
+        cindex.push(i);
+        // x(i) = A, check we need to call function this time
+        if (update) {
+          // copy value to workspace calling callback function
+          x[i] = inverse ? f(avalues[k], value) : f(value, avalues[k]);
+          // function was called on current row
+          u[i] = mark;
+        } else {
+          // copy value to workspace
+          x[i] = avalues[k];
+        }
+      } else {
+        // i exists in C already
+        x[i] = inverse ? f(avalues[k], x[i]) : f(x[i], avalues[k]);
+        // function was called on current row
+        u[i] = mark;
+      }
+    }
+  } else {
+    // values in j
+    for (k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
+      // row
+      i = aindex[k];
+      // check value exists in current j
+      if (w[i] !== mark) {
+        // i is new entry in j
+        w[i] = mark;
+        // add i to pattern of C
+        cindex.push(i);
+      } else {
+        // indicate function was called on current row
+        u[i] = mark;
+      }
+    }
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/complex.js b/node_modules/mathjs/lib/esm/utils/complex.js
new file mode 100644
index 0000000..301c521
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/complex.js
@@ -0,0 +1,14 @@
+import { nearlyEqual } from './number.js';
+
+/**
+ * Test whether two complex values are equal provided a given relTol and absTol.
+ * Does not use or change the global Complex.EPSILON setting
+ * @param {Complex} x - The first complex number for comparison.
+ * @param {Complex} y - The second complex number for comparison.
+ * @param {number} relTol - The relative tolerance for comparison.
+ * @param {number} absTol - The absolute tolerance for comparison.
+ * @returns {boolean} - Returns true if the two complex numbers are equal within the given tolerances, otherwise returns false.
+ */
+export function complexEquals(x, y, relTol, absTol) {
+  return nearlyEqual(x.re, y.re, relTol, absTol) && nearlyEqual(x.im, y.im, relTol, absTol);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/customs.js b/node_modules/mathjs/lib/esm/utils/customs.js
new file mode 100644
index 0000000..40d18c6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/customs.js
@@ -0,0 +1,147 @@
+import { hasOwnProperty } from './object.js';
+
+/**
+ * Get a property of a plain object
+ * Throws an error in case the object is not a plain object or the
+ * property is not defined on the object itself
+ * @param {Object} object
+ * @param {string} prop
+ * @return {*} Returns the property value when safe
+ */
+function getSafeProperty(object, prop) {
+  // only allow getting safe properties of a plain object
+  if (isSafeProperty(object, prop)) {
+    return object[prop];
+  }
+  if (typeof object[prop] === 'function' && isSafeMethod(object, prop)) {
+    throw new Error('Cannot access method "' + prop + '" as a property');
+  }
+  throw new Error('No access to property "' + prop + '"');
+}
+
+/**
+ * Set a property on a plain object.
+ * Throws an error in case the object is not a plain object or the
+ * property would override an inherited property like .constructor or .toString
+ * @param {Object} object
+ * @param {string} prop
+ * @param {*} value
+ * @return {*} Returns the value
+ */
+// TODO: merge this function into access.js?
+function setSafeProperty(object, prop, value) {
+  // only allow setting safe properties of a plain object
+  if (isSafeProperty(object, prop)) {
+    object[prop] = value;
+    return value;
+  }
+  throw new Error('No access to property "' + prop + '"');
+}
+
+/**
+ * Test whether a property is safe to use on an object or Array.
+ * For example .toString and .constructor are not safe
+ * @param {Object | Array} object
+ * @param {string} prop
+ * @return {boolean} Returns true when safe
+ */
+function isSafeProperty(object, prop) {
+  if (!isPlainObject(object) && !Array.isArray(object)) {
+    return false;
+  }
+  // SAFE: whitelisted
+  // e.g length
+  if (hasOwnProperty(safeNativeProperties, prop)) {
+    return true;
+  }
+  // UNSAFE: inherited from Object prototype
+  // e.g constructor
+  if (prop in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  }
+  // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+  if (prop in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+  return true;
+}
+
+/**
+ * Validate whether a method is safe.
+ * Throws an error when that's not the case.
+ * @param {Object} object
+ * @param {string} method
+ * @return {function} Returns the method when valid
+ */
+function getSafeMethod(object, method) {
+  if (!isSafeMethod(object, method)) {
+    throw new Error('No access to method "' + method + '"');
+  }
+  return object[method];
+}
+
+/**
+ * Check whether a method is safe.
+ * Throws an error when that's not the case (for example for `constructor`).
+ * @param {Object} object
+ * @param {string} method
+ * @return {boolean} Returns true when safe, false otherwise
+ */
+function isSafeMethod(object, method) {
+  if (object === null || object === undefined || typeof object[method] !== 'function') {
+    return false;
+  }
+  // UNSAFE: ghosted
+  // e.g overridden toString
+  // Note that IE10 doesn't support __proto__ and we can't do this check there.
+  if (hasOwnProperty(object, method) && Object.getPrototypeOf && method in Object.getPrototypeOf(object)) {
+    return false;
+  }
+  // SAFE: whitelisted
+  // e.g toString
+  if (hasOwnProperty(safeNativeMethods, method)) {
+    return true;
+  }
+  // UNSAFE: inherited from Object prototype
+  // e.g constructor
+  if (method in Object.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Object.prototype is a root object
+    return false;
+  }
+  // UNSAFE: inherited from Function prototype
+  // e.g call, apply
+  if (method in Function.prototype) {
+    // 'in' is used instead of hasOwnProperty for nodejs v0.10
+    // which is inconsistent on root prototypes. It is safe
+    // here because Function.prototype is a root object
+    return false;
+  }
+  return true;
+}
+function isPlainObject(object) {
+  return typeof object === 'object' && object && object.constructor === Object;
+}
+var safeNativeProperties = {
+  length: true,
+  name: true
+};
+var safeNativeMethods = {
+  toString: true,
+  valueOf: true,
+  toLocaleString: true
+};
+export { getSafeProperty };
+export { setSafeProperty };
+export { isSafeProperty };
+export { getSafeMethod };
+export { isSafeMethod };
+export { isPlainObject };
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/emitter.js b/node_modules/mathjs/lib/esm/utils/emitter.js
new file mode 100644
index 0000000..d9c1fca
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/emitter.js
@@ -0,0 +1,18 @@
+import Emitter from 'tiny-emitter';
+
+/**
+ * Extend given object with emitter functions `on`, `off`, `once`, `emit`
+ * @param {Object} obj
+ * @return {Object} obj
+ */
+export function mixin(obj) {
+  // create event emitter
+  var emitter = new Emitter();
+
+  // bind methods to obj (we don't want to expose the emitter.e Array...)
+  obj.on = emitter.on.bind(emitter);
+  obj.off = emitter.off.bind(emitter);
+  obj.once = emitter.once.bind(emitter);
+  obj.emit = emitter.emit.bind(emitter);
+  return obj;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/factory.js b/node_modules/mathjs/lib/esm/utils/factory.js
new file mode 100644
index 0000000..e8babd1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/factory.js
@@ -0,0 +1,129 @@
+import { pickShallow } from './object.js';
+
+/**
+ * Create a factory function, which can be used to inject dependencies.
+ *
+ * The created functions are memoized, a consecutive call of the factory
+ * with the exact same inputs will return the same function instance.
+ * The memoized cache is exposed on `factory.cache` and can be cleared
+ * if needed.
+ *
+ * Example:
+ *
+ *     const name = 'log'
+ *     const dependencies = ['config', 'typed', 'divideScalar', 'Complex']
+ *
+ *     export const createLog = factory(name, dependencies, ({ typed, config, divideScalar, Complex }) => {
+ *       // ... create the function log here and return it
+ *     }
+ *
+ * @param {string} name           Name of the function to be created
+ * @param {string[]} dependencies The names of all required dependencies
+ * @param {function} create       Callback function called with an object with all dependencies
+ * @param {Object} [meta]
+ *     Optional object with meta information that will be attached
+ *     to the created factory function as property `meta`. For explanation
+ *     of what meta properties can be specified and what they mean, see
+ *     docs/core/extension.md.
+ * @returns {function}
+ */
+export function factory(name, dependencies, create, meta) {
+  function assertAndCreate(scope) {
+    // we only pass the requested dependencies to the factory function
+    // to prevent functions to rely on dependencies that are not explicitly
+    // requested.
+    var deps = pickShallow(scope, dependencies.map(stripOptionalNotation));
+    assertDependencies(name, dependencies, scope);
+    return create(deps);
+  }
+  assertAndCreate.isFactory = true;
+  assertAndCreate.fn = name;
+  assertAndCreate.dependencies = dependencies.slice().sort();
+  if (meta) {
+    assertAndCreate.meta = meta;
+  }
+  return assertAndCreate;
+}
+
+/**
+ * Sort all factories such that when loading in order, the dependencies are resolved.
+ *
+ * @param {Array} factories
+ * @returns {Array} Returns a new array with the sorted factories.
+ */
+export function sortFactories(factories) {
+  var factoriesByName = {};
+  factories.forEach(factory => {
+    factoriesByName[factory.fn] = factory;
+  });
+  function containsDependency(factory, dependency) {
+    // TODO: detect circular references
+    if (isFactory(factory)) {
+      if (factory.dependencies.includes(dependency.fn || dependency.name)) {
+        return true;
+      }
+      if (factory.dependencies.some(d => containsDependency(factoriesByName[d], dependency))) {
+        return true;
+      }
+    }
+    return false;
+  }
+  var sorted = [];
+  function addFactory(factory) {
+    var index = 0;
+    while (index < sorted.length && !containsDependency(sorted[index], factory)) {
+      index++;
+    }
+    sorted.splice(index, 0, factory);
+  }
+
+  // sort regular factory functions
+  factories.filter(isFactory).forEach(addFactory);
+
+  // sort legacy factory functions AFTER the regular factory functions
+  factories.filter(factory => !isFactory(factory)).forEach(addFactory);
+  return sorted;
+}
+
+// TODO: comment or cleanup if unused in the end
+export function create(factories) {
+  var scope = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  sortFactories(factories).forEach(factory => factory(scope));
+  return scope;
+}
+
+/**
+ * Test whether an object is a factory. This is the case when it has
+ * properties name, dependencies, and a function create.
+ * @param {*} obj
+ * @returns {boolean}
+ */
+export function isFactory(obj) {
+  return typeof obj === 'function' && typeof obj.fn === 'string' && Array.isArray(obj.dependencies);
+}
+
+/**
+ * Assert that all dependencies of a list with dependencies are available in the provided scope.
+ *
+ * Will throw an exception when there are dependencies missing.
+ *
+ * @param {string} name   Name for the function to be created. Used to generate a useful error message
+ * @param {string[]} dependencies
+ * @param {Object} scope
+ */
+export function assertDependencies(name, dependencies, scope) {
+  var allDefined = dependencies.filter(dependency => !isOptionalDependency(dependency)) // filter optionals
+  .every(dependency => scope[dependency] !== undefined);
+  if (!allDefined) {
+    var missingDependencies = dependencies.filter(dependency => scope[dependency] === undefined);
+
+    // TODO: create a custom error class for this, a MathjsError or something like that
+    throw new Error("Cannot create function \"".concat(name, "\", ") + "some dependencies are missing: ".concat(missingDependencies.map(d => "\"".concat(d, "\"")).join(', '), "."));
+  }
+}
+export function isOptionalDependency(dependency) {
+  return dependency && dependency[0] === '?';
+}
+export function stripOptionalNotation(dependency) {
+  return dependency && dependency[0] === '?' ? dependency.slice(1) : dependency;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/function.js b/node_modules/mathjs/lib/esm/utils/function.js
new file mode 100644
index 0000000..c217b49
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/function.js
@@ -0,0 +1,86 @@
+// function utils
+
+import { lruQueue } from './lruQueue.js';
+
+/**
+ * Memoize a given function by caching the computed result.
+ * The cache of a memoized function can be cleared by deleting the `cache`
+ * property of the function.
+ *
+ * @param {function} fn                     The function to be memoized.
+ *                                          Must be a pure function.
+ * @param {Object} [options]
+ * @param {function(args: Array): string} [options.hasher]
+ *    A custom hash builder. Is JSON.stringify by default.
+ * @param {number | undefined} [options.limit]
+ *    Maximum number of values that may be cached. Undefined indicates
+ *    unlimited (default)
+ * @return {function}                       Returns the memoized function
+ */
+export function memoize(fn) {
+  var {
+    hasher,
+    limit
+  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+  limit = limit == null ? Number.POSITIVE_INFINITY : limit;
+  hasher = hasher == null ? JSON.stringify : hasher;
+  return function memoize() {
+    if (typeof memoize.cache !== 'object') {
+      memoize.cache = {
+        values: new Map(),
+        lru: lruQueue(limit || Number.POSITIVE_INFINITY)
+      };
+    }
+    var args = [];
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+    var hash = hasher(args);
+    if (memoize.cache.values.has(hash)) {
+      memoize.cache.lru.hit(hash);
+      return memoize.cache.values.get(hash);
+    }
+    var newVal = fn.apply(fn, args);
+    memoize.cache.values.set(hash, newVal);
+    memoize.cache.values.delete(memoize.cache.lru.hit(hash));
+    return newVal;
+  };
+}
+
+/**
+ * Memoize a given function by caching all results and the arguments,
+ * and comparing against the arguments of previous results before
+ * executing again.
+ * This is less performant than `memoize` which calculates a hash,
+ * which is very fast to compare. Use `memoizeCompare` only when it is
+ * not possible to create a unique serializable hash from the function
+ * arguments.
+ * The isEqual function must compare two sets of arguments
+ * and return true when equal (can be a deep equality check for example).
+ * @param {function} fn
+ * @param {function(a: *, b: *) : boolean} isEqual
+ * @returns {function}
+ */
+export function memoizeCompare(fn, isEqual) {
+  var memoize = function memoize() {
+    var args = [];
+    for (var i = 0; i < arguments.length; i++) {
+      args[i] = arguments[i];
+    }
+    for (var c = 0; c < memoize.cache.length; c++) {
+      var cached = memoize.cache[c];
+      if (isEqual(args, cached.args)) {
+        // TODO: move this cache entry to the top so recently used entries move up?
+        return cached.res;
+      }
+    }
+    var res = fn.apply(fn, args);
+    memoize.cache.unshift({
+      args,
+      res
+    });
+    return res;
+  };
+  memoize.cache = [];
+  return memoize;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/is.js b/node_modules/mathjs/lib/esm/utils/is.js
new file mode 100644
index 0000000..b0ac39b
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/is.js
@@ -0,0 +1,195 @@
+// type checks for all known types
+//
+// note that:
+//
+// - check by duck-typing on a property like `isUnit`, instead of checking instanceof.
+//   instanceof cannot be used because that would not allow to pass data from
+//   one instance of math.js to another since each has it's own instance of Unit.
+// - check the `isUnit` property via the constructor, so there will be no
+//   matches for "fake" instances like plain objects with a property `isUnit`.
+//   That is important for security reasons.
+// - It must not be possible to override the type checks used internally,
+//   for security reasons, so these functions are not exposed in the expression
+//   parser.
+
+import { ObjectWrappingMap } from './map.js';
+export function isNumber(x) {
+  return typeof x === 'number';
+}
+export function isBigNumber(x) {
+  if (!x || typeof x !== 'object' || typeof x.constructor !== 'function') {
+    return false;
+  }
+  if (x.isBigNumber === true && typeof x.constructor.prototype === 'object' && x.constructor.prototype.isBigNumber === true) {
+    return true;
+  }
+  if (typeof x.constructor.isDecimal === 'function' && x.constructor.isDecimal(x) === true) {
+    return true;
+  }
+  return false;
+}
+export function isBigInt(x) {
+  return typeof x === 'bigint';
+}
+export function isComplex(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isComplex === true || false;
+}
+export function isFraction(x) {
+  return x && typeof x === 'object' && Object.getPrototypeOf(x).isFraction === true || false;
+}
+export function isUnit(x) {
+  return x && x.constructor.prototype.isUnit === true || false;
+}
+export function isString(x) {
+  return typeof x === 'string';
+}
+export var isArray = Array.isArray;
+export function isMatrix(x) {
+  return x && x.constructor.prototype.isMatrix === true || false;
+}
+
+/**
+ * Test whether a value is a collection: an Array or Matrix
+ * @param {*} x
+ * @returns {boolean} isCollection
+ */
+export function isCollection(x) {
+  return Array.isArray(x) || isMatrix(x);
+}
+export function isDenseMatrix(x) {
+  return x && x.isDenseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+export function isSparseMatrix(x) {
+  return x && x.isSparseMatrix && x.constructor.prototype.isMatrix === true || false;
+}
+export function isRange(x) {
+  return x && x.constructor.prototype.isRange === true || false;
+}
+export function isIndex(x) {
+  return x && x.constructor.prototype.isIndex === true || false;
+}
+export function isBoolean(x) {
+  return typeof x === 'boolean';
+}
+export function isResultSet(x) {
+  return x && x.constructor.prototype.isResultSet === true || false;
+}
+export function isHelp(x) {
+  return x && x.constructor.prototype.isHelp === true || false;
+}
+export function isFunction(x) {
+  return typeof x === 'function';
+}
+export function isDate(x) {
+  return x instanceof Date;
+}
+export function isRegExp(x) {
+  return x instanceof RegExp;
+}
+export function isObject(x) {
+  return !!(x && typeof x === 'object' && x.constructor === Object && !isComplex(x) && !isFraction(x));
+}
+
+/**
+ * Returns `true` if the passed object appears to be a Map (i.e. duck typing).
+ *
+ * Methods looked for are `get`, `set`, `keys` and `has`.
+ *
+ * @param {Map | object} object
+ * @returns
+ */
+export function isMap(object) {
+  // We can use the fast instanceof, or a slower duck typing check.
+  // The duck typing method needs to cover enough methods to not be confused with DenseMatrix.
+  if (!object) {
+    return false;
+  }
+  return object instanceof Map || object instanceof ObjectWrappingMap || typeof object.set === 'function' && typeof object.get === 'function' && typeof object.keys === 'function' && typeof object.has === 'function';
+}
+export function isPartitionedMap(object) {
+  return isMap(object) && isMap(object.a) && isMap(object.b);
+}
+export function isObjectWrappingMap(object) {
+  return isMap(object) && isObject(object.wrappedObject);
+}
+export function isNull(x) {
+  return x === null;
+}
+export function isUndefined(x) {
+  return x === undefined;
+}
+export function isAccessorNode(x) {
+  return x && x.isAccessorNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isArrayNode(x) {
+  return x && x.isArrayNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isAssignmentNode(x) {
+  return x && x.isAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isBlockNode(x) {
+  return x && x.isBlockNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isConditionalNode(x) {
+  return x && x.isConditionalNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isConstantNode(x) {
+  return x && x.isConstantNode === true && x.constructor.prototype.isNode === true || false;
+}
+
+/* Very specialized: returns true for those nodes which in the numerator of
+   a fraction means that the division in that fraction has precedence over implicit
+   multiplication, e.g. -2/3 x parses as (-2/3) x and 3/4 x parses as (3/4) x but
+   6!/8 x parses as 6! / (8x). It is located here because it is shared between
+   parse.js and OperatorNode.js (for parsing and printing, respectively).
+
+   This should *not* be exported from mathjs, unlike most of the tests here.
+   Its name does not start with 'is' to prevent utils/snapshot.js from thinking
+   it should be exported.
+*/
+export function rule2Node(node) {
+  return isConstantNode(node) || isOperatorNode(node) && node.args.length === 1 && isConstantNode(node.args[0]) && '-+~'.includes(node.op);
+}
+export function isFunctionAssignmentNode(x) {
+  return x && x.isFunctionAssignmentNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isFunctionNode(x) {
+  return x && x.isFunctionNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isIndexNode(x) {
+  return x && x.isIndexNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isNode(x) {
+  return x && x.isNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isObjectNode(x) {
+  return x && x.isObjectNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isOperatorNode(x) {
+  return x && x.isOperatorNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isParenthesisNode(x) {
+  return x && x.isParenthesisNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isRangeNode(x) {
+  return x && x.isRangeNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isRelationalNode(x) {
+  return x && x.isRelationalNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isSymbolNode(x) {
+  return x && x.isSymbolNode === true && x.constructor.prototype.isNode === true || false;
+}
+export function isChain(x) {
+  return x && x.constructor.prototype.isChain === true || false;
+}
+export function typeOf(x) {
+  var t = typeof x;
+  if (t === 'object') {
+    if (x === null) return 'null';
+    if (isBigNumber(x)) return 'BigNumber'; // Special: weird mashup with Decimal
+    if (x.constructor && x.constructor.name) return x.constructor.name;
+    return 'Object'; // just in case
+  }
+  return t; // can be 'string', 'number', 'boolean', 'function', 'bigint', ...
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/latex.js b/node_modules/mathjs/lib/esm/utils/latex.js
new file mode 100644
index 0000000..d526078
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/latex.js
@@ -0,0 +1,490 @@
+/* eslint no-template-curly-in-string: "off" */
+
+import escapeLatexLib from 'escape-latex';
+import { hasOwnProperty } from './object.js';
+export var latexSymbols = {
+  // GREEK LETTERS
+  Alpha: 'A',
+  alpha: '\\alpha',
+  Beta: 'B',
+  beta: '\\beta',
+  Gamma: '\\Gamma',
+  gamma: '\\gamma',
+  Delta: '\\Delta',
+  delta: '\\delta',
+  Epsilon: 'E',
+  epsilon: '\\epsilon',
+  varepsilon: '\\varepsilon',
+  Zeta: 'Z',
+  zeta: '\\zeta',
+  Eta: 'H',
+  eta: '\\eta',
+  Theta: '\\Theta',
+  theta: '\\theta',
+  vartheta: '\\vartheta',
+  Iota: 'I',
+  iota: '\\iota',
+  Kappa: 'K',
+  kappa: '\\kappa',
+  varkappa: '\\varkappa',
+  Lambda: '\\Lambda',
+  lambda: '\\lambda',
+  Mu: 'M',
+  mu: '\\mu',
+  Nu: 'N',
+  nu: '\\nu',
+  Xi: '\\Xi',
+  xi: '\\xi',
+  Omicron: 'O',
+  omicron: 'o',
+  Pi: '\\Pi',
+  pi: '\\pi',
+  varpi: '\\varpi',
+  Rho: 'P',
+  rho: '\\rho',
+  varrho: '\\varrho',
+  Sigma: '\\Sigma',
+  sigma: '\\sigma',
+  varsigma: '\\varsigma',
+  Tau: 'T',
+  tau: '\\tau',
+  Upsilon: '\\Upsilon',
+  upsilon: '\\upsilon',
+  Phi: '\\Phi',
+  phi: '\\phi',
+  varphi: '\\varphi',
+  Chi: 'X',
+  chi: '\\chi',
+  Psi: '\\Psi',
+  psi: '\\psi',
+  Omega: '\\Omega',
+  omega: '\\omega',
+  // logic
+  true: '\\mathrm{True}',
+  false: '\\mathrm{False}',
+  // other
+  i: 'i',
+  // TODO use \i ??
+  inf: '\\infty',
+  Inf: '\\infty',
+  infinity: '\\infty',
+  Infinity: '\\infty',
+  oo: '\\infty',
+  lim: '\\lim',
+  undefined: '\\mathbf{?}'
+};
+export var latexOperators = {
+  transpose: '^\\top',
+  ctranspose: '^H',
+  factorial: '!',
+  pow: '^',
+  dotPow: '.^\\wedge',
+  // TODO find ideal solution
+  unaryPlus: '+',
+  unaryMinus: '-',
+  bitNot: '\\~',
+  // TODO find ideal solution
+  not: '\\neg',
+  multiply: '\\cdot',
+  divide: '\\frac',
+  // TODO how to handle that properly?
+  dotMultiply: '.\\cdot',
+  // TODO find ideal solution
+  dotDivide: '.:',
+  // TODO find ideal solution
+  mod: '\\mod',
+  add: '+',
+  subtract: '-',
+  to: '\\rightarrow',
+  leftShift: '<<',
+  rightArithShift: '>>',
+  rightLogShift: '>>>',
+  equal: '=',
+  unequal: '\\neq',
+  smaller: '<',
+  larger: '>',
+  smallerEq: '\\leq',
+  largerEq: '\\geq',
+  bitAnd: '\\&',
+  bitXor: '\\underline{|}',
+  bitOr: '|',
+  and: '\\wedge',
+  xor: '\\veebar',
+  or: '\\vee'
+};
+export var latexFunctions = {
+  // arithmetic
+  abs: {
+    1: '\\left|${args[0]}\\right|'
+  },
+  add: {
+    2: "\\left(${args[0]}".concat(latexOperators.add, "${args[1]}\\right)")
+  },
+  cbrt: {
+    1: '\\sqrt[3]{${args[0]}}'
+  },
+  ceil: {
+    1: '\\left\\lceil${args[0]}\\right\\rceil'
+  },
+  cube: {
+    1: '\\left(${args[0]}\\right)^3'
+  },
+  divide: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  dotDivide: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotDivide, "${args[1]}\\right)")
+  },
+  dotMultiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotMultiply, "${args[1]}\\right)")
+  },
+  dotPow: {
+    2: "\\left(${args[0]}".concat(latexOperators.dotPow, "${args[1]}\\right)")
+  },
+  exp: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  expm1: "\\left(e".concat(latexOperators.pow, "{${args[0]}}-1\\right)"),
+  fix: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  floor: {
+    1: '\\left\\lfloor${args[0]}\\right\\rfloor'
+  },
+  fraction: {
+    2: '\\frac{${args[0]}}{${args[1]}}'
+  },
+  gcd: '\\gcd\\left(${args}\\right)',
+  hypot: '\\hypot\\left(${args}\\right)',
+  log: {
+    1: '\\ln\\left(${args[0]}\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}\\right)'
+  },
+  log10: {
+    1: '\\log_{10}\\left(${args[0]}\\right)'
+  },
+  log1p: {
+    1: '\\ln\\left(${args[0]}+1\\right)',
+    2: '\\log_{${args[1]}}\\left(${args[0]}+1\\right)'
+  },
+  log2: '\\log_{2}\\left(${args[0]}\\right)',
+  mod: {
+    2: "\\left(${args[0]}".concat(latexOperators.mod, "${args[1]}\\right)")
+  },
+  multiply: {
+    2: "\\left(${args[0]}".concat(latexOperators.multiply, "${args[1]}\\right)")
+  },
+  norm: {
+    1: '\\left\\|${args[0]}\\right\\|',
+    2: undefined // use default template
+  },
+  nthRoot: {
+    2: '\\sqrt[${args[1]}]{${args[0]}}'
+  },
+  nthRoots: {
+    2: '\\{y : y^${args[1]} = {${args[0]}}\\}'
+  },
+  pow: {
+    2: "\\left(${args[0]}\\right)".concat(latexOperators.pow, "{${args[1]}}")
+  },
+  round: {
+    1: '\\left\\lfloor${args[0]}\\right\\rceil',
+    2: undefined // use default template
+  },
+  sign: {
+    1: '\\mathrm{${name}}\\left(${args[0]}\\right)'
+  },
+  sqrt: {
+    1: '\\sqrt{${args[0]}}'
+  },
+  square: {
+    1: '\\left(${args[0]}\\right)^2'
+  },
+  subtract: {
+    2: "\\left(${args[0]}".concat(latexOperators.subtract, "${args[1]}\\right)")
+  },
+  unaryMinus: {
+    1: "".concat(latexOperators.unaryMinus, "\\left(${args[0]}\\right)")
+  },
+  unaryPlus: {
+    1: "".concat(latexOperators.unaryPlus, "\\left(${args[0]}\\right)")
+  },
+  // bitwise
+  bitAnd: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitAnd, "${args[1]}\\right)")
+  },
+  bitNot: {
+    1: latexOperators.bitNot + '\\left(${args[0]}\\right)'
+  },
+  bitOr: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitOr, "${args[1]}\\right)")
+  },
+  bitXor: {
+    2: "\\left(${args[0]}".concat(latexOperators.bitXor, "${args[1]}\\right)")
+  },
+  leftShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.leftShift, "${args[1]}\\right)")
+  },
+  rightArithShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightArithShift, "${args[1]}\\right)")
+  },
+  rightLogShift: {
+    2: "\\left(${args[0]}".concat(latexOperators.rightLogShift, "${args[1]}\\right)")
+  },
+  // combinatorics
+  bellNumbers: {
+    1: '\\mathrm{B}_{${args[0]}}'
+  },
+  catalan: {
+    1: '\\mathrm{C}_{${args[0]}}'
+  },
+  stirlingS2: {
+    2: '\\mathrm{S}\\left(${args}\\right)'
+  },
+  // complex
+  arg: {
+    1: '\\arg\\left(${args[0]}\\right)'
+  },
+  conj: {
+    1: '\\left(${args[0]}\\right)^*'
+  },
+  im: {
+    1: '\\Im\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  re: {
+    1: '\\Re\\left\\lbrace${args[0]}\\right\\rbrace'
+  },
+  // logical
+  and: {
+    2: "\\left(${args[0]}".concat(latexOperators.and, "${args[1]}\\right)")
+  },
+  not: {
+    1: latexOperators.not + '\\left(${args[0]}\\right)'
+  },
+  or: {
+    2: "\\left(${args[0]}".concat(latexOperators.or, "${args[1]}\\right)")
+  },
+  xor: {
+    2: "\\left(${args[0]}".concat(latexOperators.xor, "${args[1]}\\right)")
+  },
+  // matrix
+  cross: {
+    2: '\\left(${args[0]}\\right)\\times\\left(${args[1]}\\right)'
+  },
+  ctranspose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.ctranspose)
+  },
+  det: {
+    1: '\\det\\left(${args[0]}\\right)'
+  },
+  dot: {
+    2: '\\left(${args[0]}\\cdot${args[1]}\\right)'
+  },
+  expm: {
+    1: '\\exp\\left(${args[0]}\\right)'
+  },
+  inv: {
+    1: '\\left(${args[0]}\\right)^{-1}'
+  },
+  pinv: {
+    1: '\\left(${args[0]}\\right)^{+}'
+  },
+  sqrtm: {
+    1: "{${args[0]}}".concat(latexOperators.pow, "{\\frac{1}{2}}")
+  },
+  trace: {
+    1: '\\mathrm{tr}\\left(${args[0]}\\right)'
+  },
+  transpose: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.transpose)
+  },
+  // probability
+  combinations: {
+    2: '\\binom{${args[0]}}{${args[1]}}'
+  },
+  combinationsWithRep: {
+    2: '\\left(\\!\\!{\\binom{${args[0]}}{${args[1]}}}\\!\\!\\right)'
+  },
+  factorial: {
+    1: "\\left(${args[0]}\\right)".concat(latexOperators.factorial)
+  },
+  gamma: {
+    1: '\\Gamma\\left(${args[0]}\\right)'
+  },
+  lgamma: {
+    1: '\\ln\\Gamma\\left(${args[0]}\\right)'
+  },
+  // relational
+  equal: {
+    2: "\\left(${args[0]}".concat(latexOperators.equal, "${args[1]}\\right)")
+  },
+  larger: {
+    2: "\\left(${args[0]}".concat(latexOperators.larger, "${args[1]}\\right)")
+  },
+  largerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.largerEq, "${args[1]}\\right)")
+  },
+  smaller: {
+    2: "\\left(${args[0]}".concat(latexOperators.smaller, "${args[1]}\\right)")
+  },
+  smallerEq: {
+    2: "\\left(${args[0]}".concat(latexOperators.smallerEq, "${args[1]}\\right)")
+  },
+  unequal: {
+    2: "\\left(${args[0]}".concat(latexOperators.unequal, "${args[1]}\\right)")
+  },
+  // special
+  erf: {
+    1: 'erf\\left(${args[0]}\\right)'
+  },
+  // statistics
+  max: '\\max\\left(${args}\\right)',
+  min: '\\min\\left(${args}\\right)',
+  variance: '\\mathrm{Var}\\left(${args}\\right)',
+  // trigonometry
+  acos: {
+    1: '\\cos^{-1}\\left(${args[0]}\\right)'
+  },
+  acosh: {
+    1: '\\cosh^{-1}\\left(${args[0]}\\right)'
+  },
+  acot: {
+    1: '\\cot^{-1}\\left(${args[0]}\\right)'
+  },
+  acoth: {
+    1: '\\coth^{-1}\\left(${args[0]}\\right)'
+  },
+  acsc: {
+    1: '\\csc^{-1}\\left(${args[0]}\\right)'
+  },
+  acsch: {
+    1: '\\mathrm{csch}^{-1}\\left(${args[0]}\\right)'
+  },
+  asec: {
+    1: '\\sec^{-1}\\left(${args[0]}\\right)'
+  },
+  asech: {
+    1: '\\mathrm{sech}^{-1}\\left(${args[0]}\\right)'
+  },
+  asin: {
+    1: '\\sin^{-1}\\left(${args[0]}\\right)'
+  },
+  asinh: {
+    1: '\\sinh^{-1}\\left(${args[0]}\\right)'
+  },
+  atan: {
+    1: '\\tan^{-1}\\left(${args[0]}\\right)'
+  },
+  atan2: {
+    2: '\\mathrm{atan2}\\left(${args}\\right)'
+  },
+  atanh: {
+    1: '\\tanh^{-1}\\left(${args[0]}\\right)'
+  },
+  cos: {
+    1: '\\cos\\left(${args[0]}\\right)'
+  },
+  cosh: {
+    1: '\\cosh\\left(${args[0]}\\right)'
+  },
+  cot: {
+    1: '\\cot\\left(${args[0]}\\right)'
+  },
+  coth: {
+    1: '\\coth\\left(${args[0]}\\right)'
+  },
+  csc: {
+    1: '\\csc\\left(${args[0]}\\right)'
+  },
+  csch: {
+    1: '\\mathrm{csch}\\left(${args[0]}\\right)'
+  },
+  sec: {
+    1: '\\sec\\left(${args[0]}\\right)'
+  },
+  sech: {
+    1: '\\mathrm{sech}\\left(${args[0]}\\right)'
+  },
+  sin: {
+    1: '\\sin\\left(${args[0]}\\right)'
+  },
+  sinh: {
+    1: '\\sinh\\left(${args[0]}\\right)'
+  },
+  tan: {
+    1: '\\tan\\left(${args[0]}\\right)'
+  },
+  tanh: {
+    1: '\\tanh\\left(${args[0]}\\right)'
+  },
+  // unit
+  to: {
+    2: "\\left(${args[0]}".concat(latexOperators.to, "${args[1]}\\right)")
+  },
+  // utils
+  numeric: function numeric(node, options) {
+    // Not sure if this is strictly right but should work correctly for the vast majority of use cases.
+    return node.args[0].toTex();
+  },
+  // type
+  number: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  },
+  string: {
+    0: '\\mathtt{""}',
+    1: '\\mathrm{string}\\left(${args[0]}\\right)'
+  },
+  bignumber: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  bigint: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)'
+  },
+  complex: {
+    0: '0',
+    1: '\\left(${args[0]}\\right)',
+    2: "\\left(\\left(${args[0]}\\right)+".concat(latexSymbols.i, "\\cdot\\left(${args[1]}\\right)\\right)")
+  },
+  matrix: {
+    0: '\\begin{bmatrix}\\end{bmatrix}',
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(${args[0]}\\right)'
+  },
+  sparse: {
+    0: '\\begin{bsparse}\\end{bsparse}',
+    1: '\\left(${args[0]}\\right)'
+  },
+  unit: {
+    1: '\\left(${args[0]}\\right)',
+    2: '\\left(\\left(${args[0]}\\right)${args[1]}\\right)'
+  }
+};
+export var defaultTemplate = '\\mathrm{${name}}\\left(${args}\\right)';
+var latexUnits = {
+  deg: '^\\circ'
+};
+export function escapeLatex(string) {
+  return escapeLatexLib(string, {
+    preserveFormatting: true
+  });
+}
+
+// @param {string} name
+// @param {boolean} isUnit
+export function toSymbol(name, isUnit) {
+  isUnit = typeof isUnit === 'undefined' ? false : isUnit;
+  if (isUnit) {
+    if (hasOwnProperty(latexUnits, name)) {
+      return latexUnits[name];
+    }
+    return '\\mathrm{' + escapeLatex(name) + '}';
+  }
+  if (hasOwnProperty(latexSymbols, name)) {
+    return latexSymbols[name];
+  }
+  return escapeLatex(name);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/log.js b/node_modules/mathjs/lib/esm/utils/log.js
new file mode 100644
index 0000000..4d265f1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/log.js
@@ -0,0 +1,16 @@
+/**
+ * Log a console.warn message only once
+ */
+export var warnOnce = (() => {
+  var messages = {};
+  return function warnOnce() {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    var message = args.join(', ');
+    if (!messages[message]) {
+      messages[message] = true;
+      console.warn('Warning:', ...args);
+    }
+  };
+})();
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/lruQueue.js b/node_modules/mathjs/lib/esm/utils/lruQueue.js
new file mode 100644
index 0000000..9498439
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/lruQueue.js
@@ -0,0 +1,51 @@
+// (c) 2018, Mariusz Nowak
+// SPDX-License-Identifier: ISC
+// Derived from https://github.com/medikoo/lru-queue
+export function lruQueue(limit) {
+  var size = 0;
+  var base = 1;
+  var queue = Object.create(null);
+  var map = Object.create(null);
+  var index = 0;
+  var del = function del(id) {
+    var oldIndex = map[id];
+    if (!oldIndex) return;
+    delete queue[oldIndex];
+    delete map[id];
+    --size;
+    if (base !== oldIndex) return;
+    if (!size) {
+      index = 0;
+      base = 1;
+      return;
+    }
+    while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}
+  };
+  limit = Math.abs(limit);
+  return {
+    hit: function hit(id) {
+      var oldIndex = map[id];
+      var nuIndex = ++index;
+      queue[nuIndex] = id;
+      map[id] = nuIndex;
+      if (!oldIndex) {
+        ++size;
+        if (size <= limit) return undefined;
+        id = queue[base];
+        del(id);
+        return id;
+      }
+      delete queue[oldIndex];
+      if (base !== oldIndex) return undefined;
+      while (!Object.prototype.hasOwnProperty.call(queue, ++base)) {/* empty */}
+      return undefined;
+    },
+    delete: del,
+    clear: function clear() {
+      size = index = 0;
+      base = 1;
+      queue = Object.create(null);
+      map = Object.create(null);
+    }
+  };
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/map.js b/node_modules/mathjs/lib/esm/utils/map.js
new file mode 100644
index 0000000..f44fbba
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/map.js
@@ -0,0 +1,203 @@
+import { getSafeProperty, isSafeProperty, setSafeProperty } from './customs.js';
+import { isMap, isObject } from './is.js';
+
+/**
+ * A map facade on a bare object.
+ *
+ * The small number of methods needed to implement a scope,
+ * forwarding on to the SafeProperty functions. Over time, the codebase
+ * will stop using this method, as all objects will be Maps, rather than
+ * more security prone objects.
+ */
+export class ObjectWrappingMap {
+  constructor(object) {
+    this.wrappedObject = object;
+    this[Symbol.iterator] = this.entries;
+  }
+  keys() {
+    return Object.keys(this.wrappedObject).filter(key => this.has(key)).values();
+  }
+  get(key) {
+    return getSafeProperty(this.wrappedObject, key);
+  }
+  set(key, value) {
+    setSafeProperty(this.wrappedObject, key, value);
+    return this;
+  }
+  has(key) {
+    return isSafeProperty(this.wrappedObject, key) && key in this.wrappedObject;
+  }
+  entries() {
+    return mapIterator(this.keys(), key => [key, this.get(key)]);
+  }
+  forEach(callback) {
+    for (var key of this.keys()) {
+      callback(this.get(key), key, this);
+    }
+  }
+  delete(key) {
+    if (isSafeProperty(this.wrappedObject, key)) {
+      delete this.wrappedObject[key];
+    }
+  }
+  clear() {
+    for (var key of this.keys()) {
+      this.delete(key);
+    }
+  }
+  get size() {
+    return Object.keys(this.wrappedObject).length;
+  }
+}
+
+/**
+ * Create a map with two partitions: a and b.
+ * The set with bKeys determines which keys/values are read/written to map b,
+ * all other values are read/written to map a
+ *
+ * For example:
+ *
+ *   const a = new Map()
+ *   const b = new Map()
+ *   const p = new PartitionedMap(a, b, new Set(['x', 'y']))
+ *
+ * In this case, values `x` and `y` are read/written to map `b`,
+ * all other values are read/written to map `a`.
+ */
+export class PartitionedMap {
+  /**
+   * @param {Map} a
+   * @param {Map} b
+   * @param {Set} bKeys
+   */
+  constructor(a, b, bKeys) {
+    this.a = a;
+    this.b = b;
+    this.bKeys = bKeys;
+    this[Symbol.iterator] = this.entries;
+  }
+  get(key) {
+    return this.bKeys.has(key) ? this.b.get(key) : this.a.get(key);
+  }
+  set(key, value) {
+    if (this.bKeys.has(key)) {
+      this.b.set(key, value);
+    } else {
+      this.a.set(key, value);
+    }
+    return this;
+  }
+  has(key) {
+    return this.b.has(key) || this.a.has(key);
+  }
+  keys() {
+    return new Set([...this.a.keys(), ...this.b.keys()])[Symbol.iterator]();
+  }
+  entries() {
+    return mapIterator(this.keys(), key => [key, this.get(key)]);
+  }
+  forEach(callback) {
+    for (var key of this.keys()) {
+      callback(this.get(key), key, this);
+    }
+  }
+  delete(key) {
+    return this.bKeys.has(key) ? this.b.delete(key) : this.a.delete(key);
+  }
+  clear() {
+    this.a.clear();
+    this.b.clear();
+  }
+  get size() {
+    return [...this.keys()].length;
+  }
+}
+
+/**
+ * Create a new iterator that maps over the provided iterator, applying a mapping function to each item
+ */
+function mapIterator(it, callback) {
+  return {
+    next: () => {
+      var n = it.next();
+      return n.done ? n : {
+        value: callback(n.value),
+        done: false
+      };
+    }
+  };
+}
+
+/**
+ * Creates an empty map, or whatever your platform's polyfill is.
+ *
+ * @returns an empty Map or Map like object.
+ */
+export function createEmptyMap() {
+  return new Map();
+}
+
+/**
+ * Creates a Map from the given object.
+ *
+ * @param { Map | { [key: string]: unknown } | undefined } mapOrObject
+ * @returns
+ */
+export function createMap(mapOrObject) {
+  if (!mapOrObject) {
+    return createEmptyMap();
+  }
+  if (isMap(mapOrObject)) {
+    return mapOrObject;
+  }
+  if (isObject(mapOrObject)) {
+    return new ObjectWrappingMap(mapOrObject);
+  }
+  throw new Error('createMap can create maps from objects or Maps');
+}
+
+/**
+ * Unwraps a map into an object.
+ *
+ * @param {Map} map
+ * @returns { [key: string]: unknown }
+ */
+export function toObject(map) {
+  if (map instanceof ObjectWrappingMap) {
+    return map.wrappedObject;
+  }
+  var object = {};
+  for (var key of map.keys()) {
+    var value = map.get(key);
+    setSafeProperty(object, key, value);
+  }
+  return object;
+}
+
+/**
+ * Copies the contents of key-value pairs from each `objects` in to `map`.
+ *
+ * Object is `objects` can be a `Map` or object.
+ *
+ * This is the `Map` analog to `Object.assign`.
+ */
+export function assign(map) {
+  for (var _len = arguments.length, objects = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    objects[_key - 1] = arguments[_key];
+  }
+  for (var args of objects) {
+    if (!args) {
+      continue;
+    }
+    if (isMap(args)) {
+      for (var key of args.keys()) {
+        map.set(key, args.get(key));
+      }
+    } else if (isObject(args)) {
+      for (var _key2 of Object.keys(args)) {
+        map.set(_key2, args[_key2]);
+      }
+    }
+  }
+  return map;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/noop.js b/node_modules/mathjs/lib/esm/utils/noop.js
new file mode 100644
index 0000000..dd6e5d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/noop.js
@@ -0,0 +1,15 @@
+export function noBignumber() {
+  throw new Error('No "bignumber" implementation available');
+}
+export function noFraction() {
+  throw new Error('No "fraction" implementation available');
+}
+export function noMatrix() {
+  throw new Error('No "matrix" implementation available');
+}
+export function noIndex() {
+  throw new Error('No "index" implementation available');
+}
+export function noSubset() {
+  throw new Error('No "matrix" implementation available');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/number.js b/node_modules/mathjs/lib/esm/utils/number.js
new file mode 100644
index 0000000..7ca69c1
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/number.js
@@ -0,0 +1,726 @@
+import { isBigNumber, isNumber, isObject } from './is.js';
+
+/**
+ * @typedef {{sign: '+' | '-' | '', coefficients: number[], exponent: number}} SplitValue
+ */
+
+/**
+ * Check if a number is integer
+ * @param {number | boolean} value
+ * @return {boolean} isInteger
+ */
+export function isInteger(value) {
+  if (typeof value === 'boolean') {
+    return true;
+  }
+  return isFinite(value) ? value === Math.round(value) : false;
+}
+
+/**
+ * Ensure the number type is compatible with the provided value.
+ * If not, return 'number' instead.
+ *
+ * For example:
+ *
+ *     safeNumberType('2.3', { number: 'bigint', numberFallback: 'number' })
+ *
+ * will return 'number' and not 'bigint' because trying to create a bigint with
+ * value 2.3 would throw an exception.
+ *
+ * @param {string} numberStr
+ * @param {{
+ *   number: 'number' | 'BigNumber' | 'bigint' | 'Fraction'
+ *   numberFallback: 'number' | 'BigNumber'
+ * }} config
+ * @returns {'number' | 'BigNumber' | 'bigint' | 'Fraction'}
+ */
+export function safeNumberType(numberStr, config) {
+  if (config.number === 'bigint') {
+    try {
+      BigInt(numberStr);
+    } catch (_unused) {
+      return config.numberFallback;
+    }
+  }
+  return config.number;
+}
+
+/**
+ * Calculate the sign of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var sign = Math.sign || function (x) {
+  if (x > 0) {
+    return 1;
+  } else if (x < 0) {
+    return -1;
+  } else {
+    return 0;
+  }
+};
+
+/**
+ * Calculate the base-2 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var log2 = Math.log2 || function log2(x) {
+  return Math.log(x) / Math.LN2;
+};
+
+/**
+ * Calculate the base-10 logarithm of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var log10 = Math.log10 || function log10(x) {
+  return Math.log(x) / Math.LN10;
+};
+
+/**
+ * Calculate the natural logarithm of a number + 1
+ * @param {number} x
+ * @returns {number}
+ */
+export var log1p = Math.log1p || function (x) {
+  return Math.log(x + 1);
+};
+
+/**
+ * Calculate cubic root for a number
+ *
+ * Code from es6-shim.js:
+ *   https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1564-L1577
+ *
+ * @param {number} x
+ * @returns {number} Returns the cubic root of x
+ */
+export var cbrt = Math.cbrt || function cbrt(x) {
+  if (x === 0) {
+    return x;
+  }
+  var negate = x < 0;
+  var result;
+  if (negate) {
+    x = -x;
+  }
+  if (isFinite(x)) {
+    result = Math.exp(Math.log(x) / 3);
+    // from https://en.wikipedia.org/wiki/Cube_root#Numerical_methods
+    result = (x / (result * result) + 2 * result) / 3;
+  } else {
+    result = x;
+  }
+  return negate ? -result : result;
+};
+
+/**
+ * Calculates exponentiation minus 1
+ * @param {number} x
+ * @return {number} res
+ */
+export var expm1 = Math.expm1 || function expm1(x) {
+  return x >= 2e-4 || x <= -2e-4 ? Math.exp(x) - 1 : x + x * x / 2 + x * x * x / 6;
+};
+
+/**
+ * Formats a number in a given base
+ * @param {number} n
+ * @param {number} base
+ * @param {number} size
+ * @returns {string}
+ */
+function formatNumberToBase(n, base, size) {
+  var prefixes = {
+    2: '0b',
+    8: '0o',
+    16: '0x'
+  };
+  var prefix = prefixes[base];
+  var suffix = '';
+  if (size) {
+    if (size < 1) {
+      throw new Error('size must be in greater than 0');
+    }
+    if (!isInteger(size)) {
+      throw new Error('size must be an integer');
+    }
+    if (n > 2 ** (size - 1) - 1 || n < -(2 ** (size - 1))) {
+      throw new Error("Value must be in range [-2^".concat(size - 1, ", 2^").concat(size - 1, "-1]"));
+    }
+    if (!isInteger(n)) {
+      throw new Error('Value must be an integer');
+    }
+    if (n < 0) {
+      n = n + 2 ** size;
+    }
+    suffix = "i".concat(size);
+  }
+  var sign = '';
+  if (n < 0) {
+    n = -n;
+    sign = '-';
+  }
+  return "".concat(sign).concat(prefix).concat(n.toString(base)).concat(suffix);
+}
+
+/**
+ * Convert a number to a formatted string representation.
+ *
+ * Syntax:
+ *
+ *    format(value)
+ *    format(value, options)
+ *    format(value, precision)
+ *    format(value, fn)
+ *
+ * Where:
+ *
+ *    {number} value   The value to be formatted
+ *    {Object} options An object with formatting options. Available options:
+ *                     {string} notation
+ *                         Number notation. Choose from:
+ *                         'fixed'          Always use regular number notation.
+ *                                          For example '123.40' and '14000000'
+ *                         'exponential'    Always use exponential notation.
+ *                                          For example '1.234e+2' and '1.4e+7'
+ *                         'engineering'    Always use engineering notation.
+ *                                          For example '123.4e+0' and '14.0e+6'
+ *                         'auto' (default) Regular number notation for numbers
+ *                                          having an absolute value between
+ *                                          `lowerExp` and `upperExp` bounds, and
+ *                                          uses exponential notation elsewhere.
+ *                                          Lower bound is included, upper bound
+ *                                          is excluded.
+ *                                          For example '123.4' and '1.4e7'.
+ *                         'bin', 'oct, or
+ *                         'hex'            Format the number using binary, octal,
+ *                                          or hexadecimal notation.
+ *                                          For example '0b1101' and '0x10fe'.
+ *                     {number} wordSize    The word size in bits to use for formatting
+ *                                          in binary, octal, or hexadecimal notation.
+ *                                          To be used only with 'bin', 'oct', or 'hex'
+ *                                          values for 'notation' option. When this option
+ *                                          is defined the value is formatted as a signed
+ *                                          twos complement integer of the given word size
+ *                                          and the size suffix is appended to the output.
+ *                                          For example
+ *                                          format(-1, {notation: 'hex', wordSize: 8}) === '0xffi8'.
+ *                                          Default value is undefined.
+ *                     {number} precision   A number between 0 and 16 to round
+ *                                          the digits of the number.
+ *                                          In case of notations 'exponential',
+ *                                          'engineering', and 'auto',
+ *                                          `precision` defines the total
+ *                                          number of significant digits returned.
+ *                                          In case of notation 'fixed',
+ *                                          `precision` defines the number of
+ *                                          significant digits after the decimal
+ *                                          point.
+ *                                          `precision` is undefined by default,
+ *                                          not rounding any digits.
+ *                     {number} lowerExp    Exponent determining the lower boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `-3`.
+ *                     {number} upperExp    Exponent determining the upper boundary
+ *                                          for formatting a value with an exponent
+ *                                          when `notation='auto`.
+ *                                          Default value is `5`.
+ *    {Function} fn    A custom formatting function. Can be used to override the
+ *                     built-in notations. Function `fn` is called with `value` as
+ *                     parameter and must return a string. Is useful for example to
+ *                     format all values inside a matrix in a particular way.
+ *
+ * Examples:
+ *
+ *    format(6.4)                                        // '6.4'
+ *    format(1240000)                                    // '1.24e6'
+ *    format(1/3)                                        // '0.3333333333333333'
+ *    format(1/3, 3)                                     // '0.333'
+ *    format(21385, 2)                                   // '21000'
+ *    format(12.071, {notation: 'fixed'})                // '12'
+ *    format(2.3,    {notation: 'fixed', precision: 2})  // '2.30'
+ *    format(52.8,   {notation: 'exponential'})          // '5.28e+1'
+ *    format(12345678, {notation: 'engineering'})        // '12.345678e+6'
+ *
+ * @param {number} value
+ * @param {Object | Function | number} [options]
+ * @return {string} str The formatted value
+ */
+export function format(value, options) {
+  if (typeof options === 'function') {
+    // handle format(value, fn)
+    return options(value);
+  }
+
+  // handle special cases
+  if (value === Infinity) {
+    return 'Infinity';
+  } else if (value === -Infinity) {
+    return '-Infinity';
+  } else if (isNaN(value)) {
+    return 'NaN';
+  }
+  var {
+    notation,
+    precision,
+    wordSize
+  } = normalizeFormatOptions(options);
+
+  // handle the various notations
+  switch (notation) {
+    case 'fixed':
+      return toFixed(value, precision);
+    case 'exponential':
+      return toExponential(value, precision);
+    case 'engineering':
+      return toEngineering(value, precision);
+    case 'bin':
+      return formatNumberToBase(value, 2, wordSize);
+    case 'oct':
+      return formatNumberToBase(value, 8, wordSize);
+    case 'hex':
+      return formatNumberToBase(value, 16, wordSize);
+    case 'auto':
+      // remove trailing zeros after the decimal point
+      return toPrecision(value, precision, options).replace(/((\.\d*?)(0+))($|e)/, function () {
+        var digits = arguments[2];
+        var e = arguments[4];
+        return digits !== '.' ? digits + e : e;
+      });
+    default:
+      throw new Error('Unknown notation "' + notation + '". ' + 'Choose "auto", "exponential", "fixed", "bin", "oct", or "hex.');
+  }
+}
+
+/**
+ * Normalize format options into an object:
+ *   {
+ *     notation: string,
+ *     precision: number | undefined,
+ *     wordSize: number | undefined
+ *   }
+ */
+export function normalizeFormatOptions(options) {
+  // default values for options
+  var notation = 'auto';
+  var precision;
+  var wordSize;
+  if (options !== undefined) {
+    if (isNumber(options)) {
+      precision = options;
+    } else if (isBigNumber(options)) {
+      precision = options.toNumber();
+    } else if (isObject(options)) {
+      if (options.precision !== undefined) {
+        precision = _toNumberOrThrow(options.precision, () => {
+          throw new Error('Option "precision" must be a number or BigNumber');
+        });
+      }
+      if (options.wordSize !== undefined) {
+        wordSize = _toNumberOrThrow(options.wordSize, () => {
+          throw new Error('Option "wordSize" must be a number or BigNumber');
+        });
+      }
+      if (options.notation) {
+        notation = options.notation;
+      }
+    } else {
+      throw new Error('Unsupported type of options, number, BigNumber, or object expected');
+    }
+  }
+  return {
+    notation,
+    precision,
+    wordSize
+  };
+}
+
+/**
+ * Split a number into sign, coefficients, and exponent
+ * @param {number | string} value
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ */
+export function splitNumber(value) {
+  // parse the input value
+  var match = String(value).toLowerCase().match(/^(-?)(\d+\.?\d*)(e([+-]?\d+))?$/);
+  if (!match) {
+    throw new SyntaxError('Invalid number ' + value);
+  }
+  var sign = match[1];
+  var digits = match[2];
+  var exponent = parseFloat(match[4] || '0');
+  var dot = digits.indexOf('.');
+  exponent += dot !== -1 ? dot - 1 : digits.length - 1;
+  var coefficients = digits.replace('.', '') // remove the dot (must be removed before removing leading zeros)
+  .replace(/^0*/, function (zeros) {
+    // remove leading zeros, add their count to the exponent
+    exponent -= zeros.length;
+    return '';
+  }).replace(/0*$/, '') // remove trailing zeros
+  .split('').map(function (d) {
+    return parseInt(d);
+  });
+  if (coefficients.length === 0) {
+    coefficients.push(0);
+    exponent++;
+  }
+  return {
+    sign,
+    coefficients,
+    exponent
+  };
+}
+
+/**
+ * Format a number in engineering notation. Like '1.23e+6', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]        Optional number of significant figures to return.
+ */
+export function toEngineering(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+  var split = splitNumber(value);
+  var rounded = roundDigits(split, precision);
+  var e = rounded.exponent;
+  var c = rounded.coefficients;
+
+  // find nearest lower multiple of 3 for exponent
+  var newExp = e % 3 === 0 ? e : e < 0 ? e - 3 - e % 3 : e - e % 3;
+  if (isNumber(precision)) {
+    // add zeroes to give correct sig figs
+    while (precision > c.length || e - newExp + 1 > c.length) {
+      c.push(0);
+    }
+  } else {
+    // concatenate coefficients with necessary zeros
+    // add zeros if necessary (for example: 1e+8 -> 100e+6)
+    var missingZeros = Math.abs(e - newExp) - (c.length - 1);
+    for (var i = 0; i < missingZeros; i++) {
+      c.push(0);
+    }
+  }
+
+  // find difference in exponents
+  var expDiff = Math.abs(e - newExp);
+  var decimalIdx = 1;
+
+  // push decimal index over by expDiff times
+  while (expDiff > 0) {
+    decimalIdx++;
+    expDiff--;
+  }
+
+  // if all coefficient values are zero after the decimal point and precision is unset, don't add a decimal value.
+  // otherwise concat with the rest of the coefficients
+  var decimals = c.slice(decimalIdx).join('');
+  var decimalVal = isNumber(precision) && decimals.length || decimals.match(/[1-9]/) ? '.' + decimals : '';
+  var str = c.slice(0, decimalIdx).join('') + decimalVal + 'e' + (e >= 0 ? '+' : '') + newExp.toString();
+  return rounded.sign + str;
+}
+
+/**
+ * Format a number with fixed notation.
+ * @param {number | string} value
+ * @param {number} [precision=undefined]  Optional number of decimals after the
+ *                                        decimal point. null by default.
+ */
+export function toFixed(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+  var splitValue = splitNumber(value);
+  var rounded = typeof precision === 'number' ? roundDigits(splitValue, splitValue.exponent + 1 + precision) : splitValue;
+  var c = rounded.coefficients;
+  var p = rounded.exponent + 1; // exponent may have changed
+
+  // append zeros if needed
+  var pp = p + (precision || 0);
+  if (c.length < pp) {
+    c = c.concat(zeros(pp - c.length));
+  }
+
+  // prepend zeros if needed
+  if (p < 0) {
+    c = zeros(-p + 1).concat(c);
+    p = 1;
+  }
+
+  // insert a dot if needed
+  if (p < c.length) {
+    c.splice(p, 0, p === 0 ? '0.' : '.');
+  }
+  return rounded.sign + c.join('');
+}
+
+/**
+ * Format a number in exponential notation. Like '1.23e+5', '2.3e+0', '3.500e-3'
+ * @param {number | string} value
+ * @param {number} [precision]  Number of digits in formatted output.
+ *                              If not provided, the maximum available digits
+ *                              is used.
+ */
+export function toExponential(value, precision) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  // round if needed, else create a clone
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+  var c = rounded.coefficients;
+  var e = rounded.exponent;
+
+  // append zeros if needed
+  if (c.length < precision) {
+    c = c.concat(zeros(precision - c.length));
+  }
+
+  // format as `C.CCCe+EEE` or `C.CCCe-EEE`
+  var first = c.shift();
+  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;
+}
+
+/**
+ * Format a number with a certain precision
+ * @param {number | string} value
+ * @param {number} [precision=undefined] Optional number of digits.
+ * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]
+ *                                       By default:
+ *                                         lowerExp = -3 (incl)
+ *                                         upper = +5 (excl)
+ * @return {string}
+ */
+export function toPrecision(value, precision, options) {
+  if (isNaN(value) || !isFinite(value)) {
+    return String(value);
+  }
+
+  // determine lower and upper bound for exponential notation.
+  var lowerExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.lowerExp, -3);
+  var upperExp = _toNumberOrDefault(options === null || options === void 0 ? void 0 : options.upperExp, 5);
+  var split = splitNumber(value);
+  var rounded = precision ? roundDigits(split, precision) : split;
+  if (rounded.exponent < lowerExp || rounded.exponent >= upperExp) {
+    // exponential notation
+    return toExponential(value, precision);
+  } else {
+    var c = rounded.coefficients;
+    var e = rounded.exponent;
+
+    // append trailing zeros
+    if (c.length < precision) {
+      c = c.concat(zeros(precision - c.length));
+    }
+
+    // append trailing zeros
+    // TODO: simplify the next statement
+    c = c.concat(zeros(e - c.length + 1 + (c.length < precision ? precision - c.length : 0)));
+
+    // prepend zeros
+    c = zeros(-e).concat(c);
+    var dot = e > 0 ? e : 0;
+    if (dot < c.length - 1) {
+      c.splice(dot + 1, 0, '.');
+    }
+    return rounded.sign + c.join('');
+  }
+}
+
+/**
+ * Round the number of digits of a number *
+ * @param {SplitValue} split       A value split with .splitNumber(value)
+ * @param {number} precision  A positive integer
+ * @return {SplitValue}
+ *              Returns an object containing sign, coefficients, and exponent
+ *              with rounded digits
+ */
+export function roundDigits(split, precision) {
+  // create a clone
+  var rounded = {
+    sign: split.sign,
+    coefficients: split.coefficients,
+    exponent: split.exponent
+  };
+  var c = rounded.coefficients;
+
+  // prepend zeros if needed
+  while (precision <= 0) {
+    c.unshift(0);
+    rounded.exponent++;
+    precision++;
+  }
+  if (c.length > precision) {
+    var removed = c.splice(precision, c.length - precision);
+    if (removed[0] >= 5) {
+      var i = precision - 1;
+      c[i]++;
+      while (c[i] === 10) {
+        c.pop();
+        if (i === 0) {
+          c.unshift(0);
+          rounded.exponent++;
+          i++;
+        }
+        i--;
+        c[i]++;
+      }
+    }
+  }
+  return rounded;
+}
+
+/**
+ * Create an array filled with zeros.
+ * @param {number} length
+ * @return {Array}
+ */
+function zeros(length) {
+  var arr = [];
+  for (var i = 0; i < length; i++) {
+    arr.push(0);
+  }
+  return arr;
+}
+
+/**
+ * Count the number of significant digits of a number.
+ *
+ * For example:
+ *   2.34 returns 3
+ *   0.0034 returns 2
+ *   120.5e+30 returns 4
+ *
+ * @param {number} value
+ * @return {number} digits   Number of significant digits
+ */
+export function digits(value) {
+  return value.toExponential().replace(/e.*$/, '') // remove exponential notation
+  .replace(/^0\.?0*|\./, '') // remove decimal point and leading zeros
+  .length;
+}
+
+/**
+ * Compares two floating point numbers.
+ * @param {number} a - First value to compare
+ * @param {number} b - Second value to compare
+ * @param {number} [relTol=1e-09] - The relative tolerance, indicating the maximum allowed difference relative to the larger absolute value. Must be greater than 0.
+ * @param {number} [absTol=1e-12] - The minimum absolute tolerance, useful for comparisons near zero. Must be at least 0.
+ * @return {boolean} whether the two numbers are nearly equal
+ *
+ * @throws {Error} If `relTol` is less than or equal to 0.
+ * @throws {Error} If `absTol` is less than 0.
+ *
+ * @example
+ * nearlyEqual(1.000000001, 1.0, 1e-8);            // true
+ * nearlyEqual(1.000000002, 1.0, 0);            // false
+ * nearlyEqual(1.0, 1.009, undefined, 0.01);       // true
+ * nearlyEqual(0.000000001, 0.0, undefined, 1e-8); // true
+ */
+export function nearlyEqual(a, b) {
+  var relTol = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1e-8;
+  var absTol = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+  if (relTol <= 0) {
+    throw new Error('Relative tolerance must be greater than 0');
+  }
+  if (absTol < 0) {
+    throw new Error('Absolute tolerance must be at least 0');
+  }
+
+  // NaN
+  if (isNaN(a) || isNaN(b)) {
+    return false;
+  }
+  if (!isFinite(a) || !isFinite(b)) {
+    return a === b;
+  }
+  if (a === b) {
+    return true;
+  }
+
+  // abs(a-b) <= max(rel_tol * max(abs(a), abs(b)), abs_tol)
+  return Math.abs(a - b) <= Math.max(relTol * Math.max(Math.abs(a), Math.abs(b)), absTol);
+}
+
+/**
+ * Calculate the hyperbolic arccos of a number
+ * @param {number} x
+ * @return {number}
+ */
+export var acosh = Math.acosh || function (x) {
+  return Math.log(Math.sqrt(x * x - 1) + x);
+};
+export var asinh = Math.asinh || function (x) {
+  return Math.log(Math.sqrt(x * x + 1) + x);
+};
+
+/**
+ * Calculate the hyperbolic arctangent of a number
+ * @param {number} x
+ * @return {number}
+ */
+export var atanh = Math.atanh || function (x) {
+  return Math.log((1 + x) / (1 - x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic cosine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var cosh = Math.cosh || function (x) {
+  return (Math.exp(x) + Math.exp(-x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic sine of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var sinh = Math.sinh || function (x) {
+  return (Math.exp(x) - Math.exp(-x)) / 2;
+};
+
+/**
+ * Calculate the hyperbolic tangent of a number
+ * @param {number} x
+ * @returns {number}
+ */
+export var tanh = Math.tanh || function (x) {
+  var e = Math.exp(2 * x);
+  return (e - 1) / (e + 1);
+};
+
+/**
+ * Returns a value with the magnitude of x and the sign of y.
+ * @param {number} x
+ * @param {number} y
+ * @returns {number}
+ */
+export function copysign(x, y) {
+  var signx = x > 0 ? true : x < 0 ? false : 1 / x === Infinity;
+  var signy = y > 0 ? true : y < 0 ? false : 1 / y === Infinity;
+  return signx ^ signy ? -x : x;
+}
+function _toNumberOrThrow(value, onError) {
+  if (isNumber(value)) {
+    return value;
+  } else if (isBigNumber(value)) {
+    return value.toNumber();
+  } else {
+    onError();
+  }
+}
+function _toNumberOrDefault(value, defaultValue) {
+  if (isNumber(value)) {
+    return value;
+  } else if (isBigNumber(value)) {
+    return value.toNumber();
+  } else {
+    return defaultValue;
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/object.js b/node_modules/mathjs/lib/esm/utils/object.js
new file mode 100644
index 0000000..8ead1b6
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/object.js
@@ -0,0 +1,376 @@
+import { isBigNumber, isObject } from './is.js';
+
+/**
+ * Clone an object
+ *
+ *     clone(x)
+ *
+ * Can clone any primitive type, array, and object.
+ * If x has a function clone, this function will be invoked to clone the object.
+ *
+ * @param {*} x
+ * @return {*} clone
+ */
+export function clone(x) {
+  var type = typeof x;
+
+  // immutable primitive types
+  if (type === 'number' || type === 'bigint' || type === 'string' || type === 'boolean' || x === null || x === undefined) {
+    return x;
+  }
+
+  // use clone function of the object when available
+  if (typeof x.clone === 'function') {
+    return x.clone();
+  }
+
+  // array
+  if (Array.isArray(x)) {
+    return x.map(function (value) {
+      return clone(value);
+    });
+  }
+  if (x instanceof Date) return new Date(x.valueOf());
+  if (isBigNumber(x)) return x; // bignumbers are immutable
+
+  // object
+  if (isObject(x)) {
+    return mapObject(x, clone);
+  }
+  if (type === 'function') {
+    // we assume that the function is immutable
+    return x;
+  }
+  throw new TypeError("Cannot clone: unknown type of value (value: ".concat(x, ")"));
+}
+
+/**
+ * Apply map to all properties of an object
+ * @param {Object} object
+ * @param {function} callback
+ * @return {Object} Returns a copy of the object with mapped properties
+ */
+export function mapObject(object, callback) {
+  var clone = {};
+  for (var key in object) {
+    if (hasOwnProperty(object, key)) {
+      clone[key] = callback(object[key]);
+    }
+  }
+  return clone;
+}
+
+/**
+ * Extend object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @return {Object} a
+ */
+export function extend(a, b) {
+  for (var prop in b) {
+    if (hasOwnProperty(b, prop)) {
+      a[prop] = b[prop];
+    }
+  }
+  return a;
+}
+
+/**
+ * Deep extend an object a with the properties of object b
+ * @param {Object} a
+ * @param {Object} b
+ * @returns {Object}
+ */
+export function deepExtend(a, b) {
+  // TODO: add support for Arrays to deepExtend
+  if (Array.isArray(b)) {
+    throw new TypeError('Arrays are not supported by deepExtend');
+  }
+  for (var prop in b) {
+    // We check against prop not being in Object.prototype or Function.prototype
+    // to prevent polluting for example Object.__proto__.
+    if (hasOwnProperty(b, prop) && !(prop in Object.prototype) && !(prop in Function.prototype)) {
+      if (b[prop] && b[prop].constructor === Object) {
+        if (a[prop] === undefined) {
+          a[prop] = {};
+        }
+        if (a[prop] && a[prop].constructor === Object) {
+          deepExtend(a[prop], b[prop]);
+        } else {
+          a[prop] = b[prop];
+        }
+      } else if (Array.isArray(b[prop])) {
+        throw new TypeError('Arrays are not supported by deepExtend');
+      } else {
+        a[prop] = b[prop];
+      }
+    }
+  }
+  return a;
+}
+
+/**
+ * Deep test equality of all fields in two pairs of arrays or objects.
+ * Compares values and functions strictly (ie. 2 is not the same as '2').
+ * @param {Array | Object} a
+ * @param {Array | Object} b
+ * @returns {boolean}
+ */
+export function deepStrictEqual(a, b) {
+  var prop, i, len;
+  if (Array.isArray(a)) {
+    if (!Array.isArray(b)) {
+      return false;
+    }
+    if (a.length !== b.length) {
+      return false;
+    }
+    for (i = 0, len = a.length; i < len; i++) {
+      if (!deepStrictEqual(a[i], b[i])) {
+        return false;
+      }
+    }
+    return true;
+  } else if (typeof a === 'function') {
+    return a === b;
+  } else if (a instanceof Object) {
+    if (Array.isArray(b) || !(b instanceof Object)) {
+      return false;
+    }
+    for (prop in a) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in b) || !deepStrictEqual(a[prop], b[prop])) {
+        return false;
+      }
+    }
+    for (prop in b) {
+      // noinspection JSUnfilteredForInLoop
+      if (!(prop in a)) {
+        return false;
+      }
+    }
+    return true;
+  } else {
+    return a === b;
+  }
+}
+
+/**
+ * Recursively flatten a nested object.
+ * @param {Object} nestedObject
+ * @return {Object} Returns the flattened object
+ */
+export function deepFlatten(nestedObject) {
+  var flattenedObject = {};
+  _deepFlatten(nestedObject, flattenedObject);
+  return flattenedObject;
+}
+
+// helper function used by deepFlatten
+function _deepFlatten(nestedObject, flattenedObject) {
+  for (var prop in nestedObject) {
+    if (hasOwnProperty(nestedObject, prop)) {
+      var value = nestedObject[prop];
+      if (typeof value === 'object' && value !== null) {
+        _deepFlatten(value, flattenedObject);
+      } else {
+        flattenedObject[prop] = value;
+      }
+    }
+  }
+}
+
+/**
+ * Test whether the current JavaScript engine supports Object.defineProperty
+ * @returns {boolean} returns true if supported
+ */
+export function canDefineProperty() {
+  // test needed for broken IE8 implementation
+  try {
+    if (Object.defineProperty) {
+      Object.defineProperty({}, 'x', {
+        get: function get() {
+          return null;
+        }
+      });
+      return true;
+    }
+  } catch (e) {}
+  return false;
+}
+
+/**
+ * Attach a lazy loading property to a constant.
+ * The given function `fn` is called once when the property is first requested.
+ *
+ * @param {Object} object         Object where to add the property
+ * @param {string} prop           Property name
+ * @param {Function} valueResolver Function returning the property value. Called
+ *                                without arguments.
+ */
+export function lazy(object, prop, valueResolver) {
+  var _uninitialized = true;
+  var _value;
+  Object.defineProperty(object, prop, {
+    get: function get() {
+      if (_uninitialized) {
+        _value = valueResolver();
+        _uninitialized = false;
+      }
+      return _value;
+    },
+    set: function set(value) {
+      _value = value;
+      _uninitialized = false;
+    },
+    configurable: true,
+    enumerable: true
+  });
+}
+
+/**
+ * Traverse a path into an object.
+ * When a namespace is missing, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path   A dot separated string like 'name.space'
+ * @return {Object} Returns the object at the end of the path
+ */
+export function traverse(object, path) {
+  if (path && typeof path === 'string') {
+    return traverse(object, path.split('.'));
+  }
+  var obj = object;
+  if (path) {
+    for (var i = 0; i < path.length; i++) {
+      var key = path[i];
+      if (!(key in obj)) {
+        obj[key] = {};
+      }
+      obj = obj[key];
+    }
+  }
+  return obj;
+}
+
+/**
+ * A safe hasOwnProperty
+ * @param {Object} object
+ * @param {string} property
+ */
+export function hasOwnProperty(object, property) {
+  return object && Object.hasOwnProperty.call(object, property);
+}
+
+/**
+ * Test whether an object is a factory. a factory has fields:
+ *
+ * - factory: function (type: Object, config: Object, load: function, typed: function [, math: Object])   (required)
+ * - name: string (optional)
+ * - path: string    A dot separated path (optional)
+ * - math: boolean   If true (false by default), the math namespace is passed
+ *                   as fifth argument of the factory function
+ *
+ * @param {*} object
+ * @returns {boolean}
+ */
+export function isLegacyFactory(object) {
+  return object && typeof object.factory === 'function';
+}
+
+/**
+ * Get a nested property from an object
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @returns {Object}
+ */
+export function get(object, path) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return get(object, path.split('.'));
+    } else {
+      return object[path];
+    }
+  }
+  var child = object;
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+  return child;
+}
+
+/**
+ * Set a nested property in an object
+ * Mutates the object itself
+ * If the path doesn't exist, it will be created
+ * @param {Object} object
+ * @param {string | string[]} path
+ * @param {*} value
+ * @returns {Object}
+ */
+export function set(object, path, value) {
+  if (typeof path === 'string') {
+    if (isPath(path)) {
+      return set(object, path.split('.'), value);
+    } else {
+      object[path] = value;
+      return object;
+    }
+  }
+  var child = object;
+  for (var i = 0; i < path.length - 1; i++) {
+    var key = path[i];
+    if (child[key] === undefined) {
+      child[key] = {};
+    }
+    child = child[key];
+  }
+  if (path.length > 0) {
+    var lastKey = path[path.length - 1];
+    child[lastKey] = value;
+  }
+  return object;
+}
+
+/**
+ * Create an object composed of the picked object properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @param {function} [transform] Optional value to transform a value when picking it
+ * @return {Object}
+ */
+export function pick(object, properties, transform) {
+  var copy = {};
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = get(object, key);
+    if (value !== undefined) {
+      set(copy, key, transform ? transform(value, key) : value);
+    }
+  }
+  return copy;
+}
+
+/**
+ * Shallow version of pick, creating an object composed of the picked object properties
+ * but not for nested properties
+ * @param {Object} object
+ * @param {string[]} properties
+ * @return {Object}
+ */
+export function pickShallow(object, properties) {
+  var copy = {};
+  for (var i = 0; i < properties.length; i++) {
+    var key = properties[i];
+    var value = object[key];
+    if (value !== undefined) {
+      copy[key] = value;
+    }
+  }
+  return copy;
+}
+
+// helper function to test whether a string contains a path like 'user.name'
+function isPath(str) {
+  return str.includes('.');
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/optimizeCallback.js b/node_modules/mathjs/lib/esm/utils/optimizeCallback.js
new file mode 100644
index 0000000..2376108
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/optimizeCallback.js
@@ -0,0 +1,152 @@
+import typed from 'typed-function';
+import { get, arraySize } from './array.js';
+import { typeOf as _typeOf } from './is.js';
+
+/**
+ * Simplifies a callback function by reducing its complexity and potentially improving its performance.
+ *
+ * @param {Function} callback The original callback function to simplify.
+ * @param {Array|Matrix} array The array that will be used with the callback function.
+ * @param {string} name The name of the function that is using the callback.
+ * @param {boolean} isUnary If true, the callback function is unary and will be optimized as such.
+ * @returns {Function} Returns a simplified version of the callback function.
+ */
+export function optimizeCallback(callback, array, name, isUnary) {
+  if (typed.isTypedFunction(callback)) {
+    var numberOfArguments;
+    if (isUnary) {
+      numberOfArguments = 1;
+    } else {
+      var firstIndex = (array.isMatrix ? array.size() : arraySize(array)).map(() => 0);
+      var firstValue = array.isMatrix ? array.get(firstIndex) : get(array, firstIndex);
+      numberOfArguments = _findNumberOfArgumentsTyped(callback, firstValue, firstIndex, array);
+    }
+    var fastCallback;
+    if (array.isMatrix && array.dataType !== 'mixed' && array.dataType !== undefined) {
+      var singleSignature = _findSingleSignatureWithArity(callback, numberOfArguments);
+      fastCallback = singleSignature !== undefined ? singleSignature : callback;
+    } else {
+      fastCallback = callback;
+    }
+    if (numberOfArguments >= 1 && numberOfArguments <= 3) {
+      return {
+        isUnary: numberOfArguments === 1,
+        fn: function fn() {
+          for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+            args[_key] = arguments[_key];
+          }
+          return _tryFunctionWithArgs(fastCallback, args.slice(0, numberOfArguments), name, callback.name);
+        }
+      };
+    }
+    return {
+      isUnary: false,
+      fn: function fn() {
+        for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+          args[_key2] = arguments[_key2];
+        }
+        return _tryFunctionWithArgs(fastCallback, args, name, callback.name);
+      }
+    };
+  }
+  if (isUnary === undefined) {
+    return {
+      isUnary: _findIfCallbackIsUnary(callback),
+      fn: callback
+    };
+  } else {
+    return {
+      isUnary,
+      fn: callback
+    };
+  }
+}
+function _findSingleSignatureWithArity(callback, arity) {
+  var matchingFunctions = [];
+  Object.entries(callback.signatures).forEach(_ref => {
+    var [signature, func] = _ref;
+    if (signature.split(',').length === arity) {
+      matchingFunctions.push(func);
+    }
+  });
+  if (matchingFunctions.length === 1) {
+    return matchingFunctions[0];
+  }
+}
+
+/**
+ * Determines if a given callback function is unary (i.e., takes exactly one argument).
+ *
+ * This function checks the following conditions to determine if the callback is unary:
+ * 1. The callback function should have exactly one parameter.
+ * 2. The callback function should not use the `arguments` object.
+ * 3. The callback function should not use rest parameters (`...`).
+ * If in doubt, this function shall return `false` to be safe
+ *
+ * @param {Function} callback - The callback function to be checked.
+ * @returns {boolean} - Returns `true` if the callback is unary, otherwise `false`.
+ */
+function _findIfCallbackIsUnary(callback) {
+  if (callback.length !== 1) return false;
+  var callbackStr = callback.toString();
+  // Check if the callback function uses `arguments`
+  if (/arguments/.test(callbackStr)) return false;
+
+  // Extract the parameters of the callback function
+  var paramsStr = callbackStr.match(/\(.*?\)/);
+  // Check if the callback function uses rest parameters
+  if (/\.\.\./.test(paramsStr)) return false;
+  return true;
+}
+function _findNumberOfArgumentsTyped(callback, value, index, array) {
+  var testArgs = [value, index, array];
+  for (var i = 3; i > 0; i--) {
+    var args = testArgs.slice(0, i);
+    if (typed.resolve(callback, args) !== null) {
+      return i;
+    }
+  }
+}
+
+/**
+   * @param {function} func The selected function taken from one of the signatures of the callback function
+   * @param {Array} args List with arguments to apply to the selected signature
+   * @param {string} mappingFnName the name of the function that is using the callback
+   * @param {string} callbackName the name of the callback function
+   * @returns {*} Returns the return value of the invoked signature
+   * @throws {TypeError} Throws an error when no matching signature was found
+   */
+function _tryFunctionWithArgs(func, args, mappingFnName, callbackName) {
+  try {
+    return func(...args);
+  } catch (err) {
+    _createCallbackError(err, args, mappingFnName, callbackName);
+  }
+}
+
+/**
+ * Creates and throws a detailed TypeError when a callback function fails.
+ *
+ * @param {Error} err The original error thrown by the callback function.
+ * @param {Array} args The arguments that were passed to the callback function.
+ * @param {string} mappingFnName The name of the function that is using the callback.
+ * @param {string} callbackName The name of the callback function.
+ * @throws {TypeError} Throws a detailed TypeError with enriched error message.
+ */
+function _createCallbackError(err, args, mappingFnName, callbackName) {
+  var _err$data;
+  // Enrich the error message so the user understands that it took place inside the callback function
+  if (err instanceof TypeError && ((_err$data = err.data) === null || _err$data === void 0 ? void 0 : _err$data.category) === 'wrongType') {
+    var argsDesc = [];
+    argsDesc.push("value: ".concat(_typeOf(args[0])));
+    if (args.length >= 2) {
+      argsDesc.push("index: ".concat(_typeOf(args[1])));
+    }
+    if (args.length >= 3) {
+      argsDesc.push("array: ".concat(_typeOf(args[2])));
+    }
+    throw new TypeError("Function ".concat(mappingFnName, " cannot apply callback arguments ") + "".concat(callbackName, "(").concat(argsDesc.join(', '), ") at index ").concat(JSON.stringify(args[1])));
+  } else {
+    throw new TypeError("Function ".concat(mappingFnName, " cannot apply callback arguments ") + "to function ".concat(callbackName, ": ").concat(err.message));
+  }
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/print.js b/node_modules/mathjs/lib/esm/utils/print.js
new file mode 100644
index 0000000..05e9b8d
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/print.js
@@ -0,0 +1 @@
+export var printTemplate = /\$([\w.]+)/g;
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/product.js b/node_modules/mathjs/lib/esm/utils/product.js
new file mode 100644
index 0000000..6986783
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/product.js
@@ -0,0 +1,14 @@
+/** @param {number} i
+ *  @param {number} n
+ *  @returns {number} product of i to n
+ */
+export function product(i, n) {
+  if (n < i) {
+    return 1;
+  }
+  if (n === i) {
+    return n;
+  }
+  var half = n + i >> 1; // divide (n + i) by 2 and truncate to integer
+  return product(i, half) * product(half + 1, n);
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/scope.js b/node_modules/mathjs/lib/esm/utils/scope.js
new file mode 100644
index 0000000..5b306d9
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/scope.js
@@ -0,0 +1,18 @@
+import { ObjectWrappingMap, PartitionedMap } from './map.js';
+
+/**
+ * Create a new scope which can access the parent scope,
+ * but does not affect it when written. This is suitable for variable definitions
+ * within a block node, or function definition.
+ *
+ * If parent scope has a createSubScope method, it delegates to that. Otherwise,
+ * creates an empty map, and copies the parent scope to it, adding in
+ * the remaining `args`.
+ *
+ * @param {Map} parentScope
+ * @param  {Object} args
+ * @returns {PartitionedMap}
+ */
+export function createSubScope(parentScope, args) {
+  return new PartitionedMap(parentScope, new ObjectWrappingMap(args), new Set(Object.keys(args)));
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/snapshot.js b/node_modules/mathjs/lib/esm/utils/snapshot.js
new file mode 100644
index 0000000..48c09b2
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/snapshot.js
@@ -0,0 +1,234 @@
+import _extends from "@babel/runtime/helpers/extends";
+import _defineProperty from "@babel/runtime/helpers/defineProperty";
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+/**
+ * This file contains helper methods to create expected snapshot structures
+ * of both instance and ES6 exports.
+ *
+ * The files are located here and not under /test or /tools so it's transpiled
+ * into ES5 code under /lib and can be used straight by node.js
+ */
+import assert from 'assert';
+import * as allIsFunctions from './is.js';
+import { create } from '../core/create.js';
+import { endsWith } from './string.js';
+export var validateTypeOf = allIsFunctions.typeOf;
+export function validateBundle(expectedBundleStructure, bundle) {
+  var originalWarn = console.warn;
+  console.warn = function () {
+    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
+      args[_key] = arguments[_key];
+    }
+    if (args.join(' ').includes('is moved to') && args.join(' ').includes('Please use the new location instead')) {
+      // Ignore warnings like:
+      // Warning: math.type.isNumber is moved to math.isNumber in v6.0.0. Please use the new location instead.
+      return;
+    }
+    originalWarn.apply(console, args);
+  };
+  try {
+    var issues = [];
+
+    // see whether all expected functions and objects are there
+    traverse(expectedBundleStructure, (expectedType, path) => {
+      var actualValue = get(bundle, path);
+      var actualType = validateTypeOf(actualValue);
+      var message = actualType === 'undefined' ? 'Missing entry in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    });
+
+    // see whether there are any functions or objects that shouldn't be there
+    traverse(bundle, (actualValue, path) => {
+      var actualType = validateTypeOf(actualValue);
+      var expectedType = get(expectedBundleStructure, path) || 'undefined';
+
+      // FIXME: ugly to have these special cases
+      if (path.join('.').includes('docs.')) {
+        // ignore the contents of docs
+        return;
+      }
+      if (path.join('.').includes('all.')) {
+        // ignore the contents of all dependencies
+        return;
+      }
+      var message = expectedType === 'undefined' ? 'Unknown entry in bundle. ' + 'Is there a new function added which is missing in this snapshot test? ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType) : 'Unexpected entry type in bundle. ' + "Path: ".concat(JSON.stringify(path), ", expected type: ").concat(expectedType, ", actual type: ").concat(actualType);
+      if (actualType !== expectedType) {
+        issues.push({
+          actualType,
+          expectedType,
+          message
+        });
+        console.warn(message);
+      }
+    });
+
+    // assert on the first issue (if any)
+    if (issues.length > 0) {
+      var {
+        actualType,
+        expectedType,
+        message
+      } = issues[0];
+      console.warn("".concat(issues.length, " bundle issues found"));
+      assert.strictEqual(actualType, expectedType, message);
+    }
+  } finally {
+    console.warn = originalWarn;
+  }
+}
+
+/**
+ * Based on an object with factory functions, create the expected
+ * structures for ES6 export and a mathjs instance.
+ * @param {Object} factories
+ * @return {{expectedInstanceStructure: Object, expectedES6Structure: Object}}
+ */
+export function createSnapshotFromFactories(factories) {
+  var math = create(factories);
+  var allFactoryFunctions = {};
+  var allFunctionsConstantsClasses = {};
+  var allFunctionsConstants = {};
+  var allTransformFunctions = {};
+  var allDependencyCollections = {};
+  var allClasses = {};
+  var allNodeClasses = {};
+  Object.keys(factories).forEach(factoryName => {
+    var _factory$meta$formerl, _factory$meta;
+    var factory = factories[factoryName];
+    var name = factory.fn;
+    var isTransformFunction = factory.meta && factory.meta.isTransformFunction;
+    var isClass = !isLowerCase(name[0]) && validateTypeOf(math[name]) === 'function';
+    var dependenciesName = factory.fn + (isTransformFunction ? 'Transform' : '') + 'Dependencies';
+    var former = (_factory$meta$formerl = (_factory$meta = factory.meta) === null || _factory$meta === void 0 ? void 0 : _factory$meta.formerly) !== null && _factory$meta$formerl !== void 0 ? _factory$meta$formerl : '';
+    allFactoryFunctions[factoryName] = 'function';
+    allFunctionsConstantsClasses[name] = validateTypeOf(math[name]);
+    if (former) {
+      allFunctionsConstantsClasses[former] = allFunctionsConstantsClasses[name];
+    }
+    allDependencyCollections[dependenciesName] = 'Object';
+    if (isTransformFunction) {
+      allTransformFunctions[name] = 'function';
+      if (former) allTransformFunctions[former] = 'function';
+    }
+    if (isClass) {
+      if (endsWith(name, 'Node')) {
+        allNodeClasses[name] = 'function';
+      } else {
+        allClasses[name] = 'function';
+      }
+    } else {
+      allFunctionsConstants[name] = validateTypeOf(math[name]);
+      if (former) allFunctionsConstants[former] = allFunctionsConstants[name];
+    }
+  });
+  var embeddedDocs = {};
+  Object.keys(factories).forEach(factoryName => {
+    var factory = factories[factoryName];
+    var name = factory.fn;
+    if (isLowerCase(factory.fn[0])) {
+      // ignore class names starting with upper case
+      embeddedDocs[name] = 'Object';
+    }
+  });
+  embeddedDocs = exclude(embeddedDocs, ['equalScalar', 'addScalar', 'subtractScalar', 'multiplyScalar', 'print', 'divideScalar', 'parse', 'compile', 'parser', 'chain', 'coulomb', 'reviver', 'replacer']);
+  var allTypeChecks = {};
+  Object.keys(allIsFunctions).forEach(name => {
+    if (name.indexOf('is') === 0) {
+      allTypeChecks[name] = 'function';
+    }
+  });
+  var allErrorClasses = {
+    ArgumentsError: 'function',
+    DimensionError: 'function',
+    IndexError: 'function'
+  };
+  var expectedInstanceStructure = _objectSpread(_objectSpread(_objectSpread(_objectSpread({}, allFunctionsConstantsClasses), {}, {
+    on: 'function',
+    off: 'function',
+    once: 'function',
+    emit: 'function',
+    import: 'function',
+    config: 'function',
+    create: 'function',
+    factory: 'function'
+  }, allTypeChecks), allErrorClasses), {}, {
+    expression: {
+      transform: _objectSpread({}, allTransformFunctions),
+      mathWithTransform: _objectSpread(_objectSpread({}, exclude(allFunctionsConstants, ['chain'])), {}, {
+        config: 'function'
+      })
+    }
+  });
+  var expectedES6Structure = _objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread(_objectSpread({}, exclude(allFunctionsConstantsClasses, ['E', 'false', 'Infinity', 'NaN', 'null', 'PI', 'true'])), {}, {
+    create: 'function',
+    config: 'function',
+    factory: 'function',
+    _true: 'boolean',
+    _false: 'boolean',
+    _null: 'null',
+    _Infinity: 'number',
+    _NaN: 'number'
+  }, allTypeChecks), allErrorClasses), allDependencyCollections), allFactoryFunctions), {}, {
+    docs: embeddedDocs
+  });
+  return {
+    expectedInstanceStructure,
+    expectedES6Structure
+  };
+}
+function traverse(obj) {
+  var callback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : (value, path) => {};
+  var path = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : [];
+  // FIXME: ugly to have these special cases
+  if (path.length > 0 && path[0].includes('Dependencies')) {
+    // special case for objects holding a collection of dependencies
+    callback(obj, path);
+  } else if (validateTypeOf(obj) === 'Array') {
+    obj.map((item, index) => traverse(item, callback, path.concat(index)));
+  } else if (validateTypeOf(obj) === 'Object') {
+    Object.keys(obj).forEach(key => {
+      // FIXME: ugly to have these special cases
+      // ignore special case of deprecated docs
+      if (key === 'docs' && path.join('.') === 'expression') {
+        return;
+      }
+      traverse(obj[key], callback, path.concat(key));
+    });
+  } else {
+    callback(obj, path);
+  }
+}
+function get(object, path) {
+  var child = object;
+  for (var i = 0; i < path.length; i++) {
+    var key = path[i];
+    child = child ? child[key] : undefined;
+  }
+  return child;
+}
+
+/**
+ * Create a copy of the provided `object` and delete
+ * all properties listed in `excludedProperties`
+ * @param {Object} object
+ * @param {string[]} excludedProperties
+ * @return {Object}
+ */
+function exclude(object, excludedProperties) {
+  var strippedObject = _extends({}, object);
+  excludedProperties.forEach(excludedProperty => {
+    delete strippedObject[excludedProperty];
+  });
+  return strippedObject;
+}
+function isLowerCase(text) {
+  return typeof text === 'string' && text.toLowerCase() === text;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/string.js b/node_modules/mathjs/lib/esm/utils/string.js
new file mode 100644
index 0000000..19c68f3
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/string.js
@@ -0,0 +1,194 @@
+import { isBigNumber, isString, typeOf } from './is.js';
+import { format as formatNumber } from './number.js';
+import { format as formatBigNumber } from './bignumber/formatter.js';
+
+/**
+ * Check if a text ends with a certain string.
+ * @param {string} text
+ * @param {string} search
+ */
+export function endsWith(text, search) {
+  var start = text.length - search.length;
+  var end = text.length;
+  return text.substring(start, end) === search;
+}
+
+/**
+ * Format a value of any type into a string.
+ *
+ * Usage:
+ *     math.format(value)
+ *     math.format(value, precision)
+ *     math.format(value, options)
+ *
+ * When value is a function:
+ *
+ * - When the function has a property `syntax`, it returns this
+ *   syntax description.
+ * - In other cases, a string `'function'` is returned.
+ *
+ * When `value` is an Object:
+ *
+ * - When the object contains a property `format` being a function, this
+ *   function is invoked as `value.format(options)` and the result is returned.
+ * - When the object has its own `toString` method, this method is invoked
+ *   and the result is returned.
+ * - In other cases the function will loop over all object properties and
+ *   return JSON object notation like '{"a": 2, "b": 3}'.
+ *
+ * Example usage:
+ *     math.format(2/7)                // '0.2857142857142857'
+ *     math.format(math.pi, 3)         // '3.14'
+ *     math.format(new Complex(2, 3))  // '2 + 3i'
+ *     math.format('hello')            // '"hello"'
+ *
+ * @param {*} value             Value to be stringified
+ * @param {Object | number | Function} [options]
+ *     Formatting options. See src/utils/number.js:format for a
+ *     description of the available options controlling number output.
+ *     This generic "format" also supports the option property `truncate: NN`
+ *     giving the maximum number NN of characters to return (if there would
+ *     have been more, they are deleted and replaced by an ellipsis).
+ * @return {string} str
+ */
+export function format(value, options) {
+  var result = _format(value, options);
+  if (options && typeof options === 'object' && 'truncate' in options && result.length > options.truncate) {
+    return result.substring(0, options.truncate - 3) + '...';
+  }
+  return result;
+}
+function _format(value, options) {
+  if (typeof value === 'number') {
+    return formatNumber(value, options);
+  }
+  if (isBigNumber(value)) {
+    return formatBigNumber(value, options);
+  }
+
+  // note: we use unsafe duck-typing here to check for Fractions, this is
+  // ok here since we're only invoking toString or concatenating its values
+  if (looksLikeFraction(value)) {
+    if (!options || options.fraction !== 'decimal') {
+      // output as ratio, like '1/3'
+      return "".concat(value.s * value.n, "/").concat(value.d);
+    } else {
+      // output as decimal, like '0.(3)'
+      return value.toString();
+    }
+  }
+  if (Array.isArray(value)) {
+    return formatArray(value, options);
+  }
+  if (isString(value)) {
+    return stringify(value);
+  }
+  if (typeof value === 'function') {
+    return value.syntax ? String(value.syntax) : 'function';
+  }
+  if (value && typeof value === 'object') {
+    if (typeof value.format === 'function') {
+      return value.format(options);
+    } else if (value && value.toString(options) !== {}.toString()) {
+      // this object has a non-native toString method, use that one
+      return value.toString(options);
+    } else {
+      var entries = Object.keys(value).map(key => {
+        return stringify(key) + ': ' + format(value[key], options);
+      });
+      return '{' + entries.join(', ') + '}';
+    }
+  }
+  return String(value);
+}
+
+/**
+ * Stringify a value into a string enclosed in double quotes.
+ * Unescaped double quotes and backslashes inside the value are escaped.
+ * @param {*} value
+ * @return {string}
+ */
+export function stringify(value) {
+  var text = String(value);
+  var escaped = '';
+  var i = 0;
+  while (i < text.length) {
+    var c = text.charAt(i);
+    escaped += c in controlCharacters ? controlCharacters[c] : c;
+    i++;
+  }
+  return '"' + escaped + '"';
+}
+var controlCharacters = {
+  '"': '\\"',
+  '\\': '\\\\',
+  '\b': '\\b',
+  '\f': '\\f',
+  '\n': '\\n',
+  '\r': '\\r',
+  '\t': '\\t'
+};
+
+/**
+ * Escape special HTML characters
+ * @param {*} value
+ * @return {string}
+ */
+export function escape(value) {
+  var text = String(value);
+  text = text.replace(/&/g, '&amp;').replace(/"/g, '&quot;').replace(/'/g, '&#39;').replace(/</g, '&lt;').replace(/>/g, '&gt;');
+  return text;
+}
+
+/**
+ * Recursively format an n-dimensional matrix
+ * Example output: "[[1, 2], [3, 4]]"
+ * @param {Array} array
+ * @param {Object | number | Function} [options]  Formatting options. See
+ *                                                lib/utils/number:format for a
+ *                                                description of the available
+ *                                                options.
+ * @returns {string} str
+ */
+function formatArray(array, options) {
+  if (Array.isArray(array)) {
+    var str = '[';
+    var len = array.length;
+    for (var i = 0; i < len; i++) {
+      if (i !== 0) {
+        str += ', ';
+      }
+      str += formatArray(array[i], options);
+    }
+    str += ']';
+    return str;
+  } else {
+    return format(array, options);
+  }
+}
+
+/**
+ * Check whether a value looks like a Fraction (unsafe duck-type check)
+ * @param {*} value
+ * @return {boolean}
+ */
+function looksLikeFraction(value) {
+  return value && typeof value === 'object' && typeof value.s === 'bigint' && typeof value.n === 'bigint' && typeof value.d === 'bigint' || false;
+}
+
+/**
+ * Compare two strings
+ * @param {string} x
+ * @param {string} y
+ * @returns {number}
+ */
+export function compareText(x, y) {
+  // we don't want to convert numbers to string, only accept string input
+  if (!isString(x)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(x) + ', index: 0)');
+  }
+  if (!isString(y)) {
+    throw new TypeError('Unexpected type of argument in function compareText ' + '(expected: string or Array or Matrix, actual: ' + typeOf(y) + ', index: 1)');
+  }
+  return x === y ? 0 : x > y ? 1 : -1;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/utils/switch.js b/node_modules/mathjs/lib/esm/utils/switch.js
new file mode 100644
index 0000000..3d70271
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/utils/switch.js
@@ -0,0 +1,20 @@
+/**
+ * Transpose a matrix
+ * @param {Array} mat
+ * @returns {Array} ret
+ * @private
+ */
+export function _switch(mat) {
+  var I = mat.length;
+  var J = mat[0].length;
+  var i, j;
+  var ret = [];
+  for (j = 0; j < J; j++) {
+    var tmp = [];
+    for (i = 0; i < I; i++) {
+      tmp.push(mat[i][j]);
+    }
+    ret.push(tmp);
+  }
+  return ret;
+}
\ No newline at end of file
diff --git a/node_modules/mathjs/lib/esm/version.js b/node_modules/mathjs/lib/esm/version.js
new file mode 100644
index 0000000..62a89c0
--- /dev/null
+++ b/node_modules/mathjs/lib/esm/version.js
@@ -0,0 +1,3 @@
+export var version = '14.9.1';
+// Note: This file is automatically generated when building math.js.
+// Changes made in this file will be overwritten.
\ No newline at end of file
diff --git a/node_modules/mathjs/package.json b/node_modules/mathjs/package.json
new file mode 100644
index 0000000..4720faa
--- /dev/null
+++ b/node_modules/mathjs/package.json
@@ -0,0 +1,170 @@
+{
+  "name": "mathjs",
+  "version": "14.9.1",
+  "description": "Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.",
+  "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
+  "homepage": "https://mathjs.org",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/josdejong/mathjs.git"
+  },
+  "license": "Apache-2.0",
+  "keywords": [
+    "math",
+    "mathematics",
+    "functions",
+    "numeric",
+    "algebra",
+    "parser",
+    "expression",
+    "number",
+    "bignumber",
+    "complex",
+    "fraction",
+    "matrix",
+    "unit"
+  ],
+  "dependencies": {
+    "@babel/runtime": "^7.26.10",
+    "complex.js": "^2.2.5",
+    "decimal.js": "^10.4.3",
+    "escape-latex": "^1.2.0",
+    "fraction.js": "^5.2.1",
+    "javascript-natural-sort": "^0.7.1",
+    "seedrandom": "^3.0.5",
+    "tiny-emitter": "^2.1.0",
+    "typed-function": "^4.2.1"
+  },
+  "devDependencies": {
+    "@babel/core": "7.28.4",
+    "@babel/plugin-transform-object-assign": "7.27.1",
+    "@babel/plugin-transform-optional-catch-binding": "7.27.1",
+    "@babel/plugin-transform-runtime": "7.28.3",
+    "@babel/preset-env": "7.28.3",
+    "@babel/register": "7.28.3",
+    "@types/assert": "1.5.11",
+    "@types/mocha": "10.0.10",
+    "@typescript-eslint/eslint-plugin": "8.46.0",
+    "@typescript-eslint/parser": "8.46.0",
+    "assert": "2.1.0",
+    "babel-loader": "10.0.0",
+    "c8": "10.1.3",
+    "codecov": "3.8.3",
+    "del": "8.0.1",
+    "eigen": "0.2.2",
+    "es-check": "9.4.4",
+    "eslint": "8.57.1",
+    "eslint-config-prettier": "9.1.0",
+    "eslint-config-standard": "17.1.0",
+    "eslint-plugin-import": "2.32.0",
+    "eslint-plugin-mocha": "10.5.0",
+    "eslint-plugin-n": "16.6.2",
+    "eslint-plugin-prettier": "5.5.4",
+    "eslint-plugin-promise": "6.6.0",
+    "expect-type": "1.2.2",
+    "expr-eval": "2.0.2",
+    "fancy-log": "2.0.0",
+    "glob": "11.0.3",
+    "gulp": "5.0.1",
+    "gulp-babel": "8.0.0",
+    "handlebars": "4.7.8",
+    "jsep": "1.4.0",
+    "karma": "6.4.4",
+    "karma-firefox-launcher": "2.1.3",
+    "karma-mocha": "2.0.1",
+    "karma-mocha-reporter": "2.2.5",
+    "karma-spec-reporter": "0.0.36",
+    "karma-webdriver-launcher": "1.0.8",
+    "karma-webpack": "5.0.1",
+    "mkdirp": "3.0.1",
+    "mocha": "11.7.4",
+    "mocha-junit-reporter": "2.2.1",
+    "ndarray": "1.0.19",
+    "ndarray-determinant": "1.0.0",
+    "ndarray-gemm": "1.0.0",
+    "ndarray-ops": "1.2.2",
+    "ndarray-pack": "1.2.1",
+    "numericjs": "1.2.6",
+    "prettier": "3.6.2",
+    "process": "0.11.10",
+    "sinon": "21.0.0",
+    "sylvester": "0.0.21",
+    "tinybench": "5.0.1",
+    "ts-node": "10.9.2",
+    "typescript": "5.9.3",
+    "webpack": "5.102.1",
+    "zeros": "1.0.0"
+  },
+  "type": "module",
+  "main": "./lib/cjs",
+  "types": "./types/index.d.ts",
+  "module": "./lib/esm",
+  "unpkg": "./lib/browser/math.js",
+  "jsdelivr": "./lib/browser/math.js",
+  "exports": {
+    ".": {
+      "types": "./types/index.d.ts",
+      "import": "./lib/esm/index.js",
+      "require": "./lib/cjs/index.js"
+    },
+    "./number": {
+      "types": "./types/index.d.ts",
+      "import": "./lib/esm/number.js",
+      "require": "./lib/cjs/number.js"
+    },
+    "./lib/esm/number": {
+      "types": "./types/index.d.ts",
+      "import": "./lib/esm/number.js",
+      "require": "./lib/cjs/number.js"
+    },
+    "./package.json": "./package.json",
+    "./lib/browser/math.js": "./lib/browser/math.js",
+    "./lib/browser/math.js.map": "./lib/browser/math.js.map"
+  },
+  "files": [
+    "bin",
+    "lib",
+    "types",
+    "LICENSE",
+    "NOTICE",
+    "README.md",
+    "HISTORY.md",
+    "CONTRIBUTING.md"
+  ],
+  "directories": {
+    "bin": "./bin",
+    "lib": "./lib"
+  },
+  "scripts": {
+    "build": "gulp && npm run update-authors",
+    "build-and-test": "npm run build && npm run test:all && npm run lint",
+    "build:clean": "gulp clean",
+    "build:docs": "gulp docs",
+    "compile": "gulp compile",
+    "watch": "gulp watch",
+    "lint": "eslint --cache --max-warnings 0 src/ test/ types/",
+    "format": "npm run lint -- --fix",
+    "validate:ascii": "gulp validate:ascii",
+    "test": "npm run test:src && npm run lint",
+    "test:src": "mocha test/unit-tests",
+    "test:generated": "mocha test/generated-code-tests",
+    "test:node": "mocha test/node-tests/*.test.{js,cjs,mjs} test/node-tests/**/*.test.{js,cjs,mjs}",
+    "test:all": "npm run test:src && npm run test:generated && npm run test:node && npm run test:types",
+    "test:browser": "karma start test/browser-test-config/local-karma.js",
+    "test:lambdatest": "karma start test/browser-test-config/lambdatest-karma.js",
+    "test:types": " tsc -p ./tsconfig.json && node --loader ts-node/esm ./test/typescript-tests/testTypes.ts",
+    "coverage": "c8 --reporter=lcov --reporter=text-summary mocha test/unit-tests && echo \"\nDetailed coverage report is available at ./coverage/lcov-report/index.html\"",
+    "prepublishOnly": "npm run test:all && npm run lint",
+    "update-authors": "node ./tools/update-authors.js"
+  },
+  "bin": {
+    "mathjs": "./bin/cli.js"
+  },
+  "engines": {
+    "node": ">= 18"
+  },
+  "bugs": {
+    "url": "https://github.com/josdejong/mathjs/issues"
+  },
+  "sideEffects": false
+}
diff --git a/node_modules/mathjs/types/EXPLANATION.md b/node_modules/mathjs/types/EXPLANATION.md
new file mode 100644
index 0000000..c58edb2
--- /dev/null
+++ b/node_modules/mathjs/types/EXPLANATION.md
@@ -0,0 +1,66 @@
+# Mathjs TypeScript types
+
+The code base of Mathjs is written in JavaScript. The TypeScript definitions are maintained separately. 
+
+## Library structure
+
+The over all structure is:
+
+- The library exports the core function `create` which creates a MathJS instance and returns `MathJsInstance`.
+- Mathjs has a special function `chain`, which allows you to use the functions in a chained way, like `chain(2).add(3).done()`. The function `chain` returns an interface `MathJsChain`, which contains all mathjs functions and constants as a method. Unlike the static functions, these methods are defined with the chain instance `this` as first argument.
+- The library exports collections with factory functions of all functions and their dependencies. To create an instance of the function `add`, one can do `create(addDependencies)` for example. To import all functions, one can do `create(all)`.
+- The library also returns a static instance, which can directly be used like `import { add } from 'mathjs'`.
+
+## Defining the types of a new function
+
+Maintaining the TypeScript types is done manually. When adding a function, one has to create the following TypeScript definitions:
+
+1. Add a normal definition inside `interface MathJsInstance {...}`
+2. Add a chained definition inside `interface MathJsChain {...}`
+3. Add a static definition inside `export const {...} : MathJsInstance`
+4. Add a dependencies definition inside `export const {...} : Record<string, FactoryFunctionMap>`
+
+For example for the function `add`, we can have the following definitions:
+
+```ts 
+// instance
+export interface MathJsInstance extends MathJsFactory {
+  //...
+  add<T extends MathType>(x: T, y: T): T
+  //...
+}
+
+// chain
+export interface MathJsChain<TValue> {
+  //...  
+  add<T extends MathType>(this: MathJsChain<T>, y: T): MathJsChain<T>
+  //...
+}
+
+// static
+export const {
+  // ...
+  add,
+  // ...
+} : MathJsInstance
+
+
+// dependencies
+export const {
+  // ...
+  addDependencies,
+  // ...
+} : Record<string, FactoryFunctionMap>
+```
+
+## Testing the type definitions
+
+The types are defined in `types/index.d.ts`.
+
+The tests for the type definitions are located in `test/typescript-types/testTypes.ts`.
+
+To run the tests for the type definitions:
+
+```
+npm run test:types
+```
diff --git a/node_modules/mathjs/types/index.d.ts b/node_modules/mathjs/types/index.d.ts
new file mode 100644
index 0000000..2049487
--- /dev/null
+++ b/node_modules/mathjs/types/index.d.ts
@@ -0,0 +1,7501 @@
+import { Decimal } from 'decimal.js'
+import { Fraction } from 'fraction.js'
+
+export { Fraction }
+
+export as namespace math
+
+export type NoLiteralType<T> = T extends number
+  ? number
+  : T extends string
+    ? string
+    : T extends boolean
+      ? boolean
+      : T
+
+export type MathNumericType = number | BigNumber | bigint | Fraction | Complex
+export type MathScalarType = MathNumericType | Unit
+export type MathGeneric<T extends MathScalarType = MathNumericType> = T
+export type MathArray<T = MathGeneric> = T[] | Array<MathArray<T>>
+export type MathCollection<T = MathGeneric> = MathArray<T> | Matrix<T>
+export type MathType = MathScalarType | MathCollection
+export type MathExpression = string | string[] | MathCollection
+
+// add type for Matrix Callback Function and Matrix Storage Format
+export type MatrixStorageFormat = 'dense' | 'sparse'
+export type MatrixFromFunctionCallback<T extends MathScalarType> = (
+  index: number[]
+) => T
+
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+export type FactoryFunction<T> = (scope: MathScope) => T
+
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+export type MathScope<TValue = any> =
+  | Record<string, TValue>
+  | MapLike<string, TValue>
+
+// FactoryFunctionMap can be nested; all nested objects will be flattened
+export interface FactoryFunctionMap {
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  [key: string]: FactoryFunction<any> | FactoryFunctionMap
+}
+
+/** Available options for parse */
+export interface ParseOptions {
+  /** a set of custom nodes */
+  nodes?: Record<string, MathNode>
+}
+/**
+ * Parse an expression. Returns a node tree, which can be evaluated by
+ * invoking node.evaluate().
+ *
+ * Note the evaluating arbitrary expressions may involve security risks,
+ * see [https://mathjs.org/docs/expressions/security.html](https://mathjs.org/docs/expressions/security.html) for more information.
+ *
+ * Syntax:
+ *
+ *     math.parse(expr)
+ *     math.parse(expr, options)
+ *     math.parse([expr1, expr2, expr3, ...])
+ *     math.parse([expr1, expr2, expr3, ...], options)
+ *
+ * Example:
+ *
+ *     const node1 = math.parse('sqrt(3^2 + 4^2)')
+ *     node1.compile().evaluate() // 5
+ *
+ *     let scope = {a:3, b:4}
+ *     const node2 = math.parse('a * b') // 12
+ *     const code2 = node2.compile()
+ *     code2.evaluate(scope) // 12
+ *     scope.a = 5
+ *     code2.evaluate(scope) // 20
+ *
+ *     const nodes = math.parse(['a = 3', 'b = 4', 'a * b'])
+ *     nodes[2].compile().evaluate() // 12
+ *
+ * See also:
+ *
+ *     evaluate, compile
+ */
+export interface ParseFunction {
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate();
+   *
+   * @param expr Expression to be parsed
+   * @param options Available options
+   * @returns A node
+   */
+  (expr: MathExpression, options?: ParseOptions): MathNode
+
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate();
+   *
+   * @param exprs Expressions to be parsed
+   * @param options Available options
+   * @returns An array of nodes
+   */
+  (exprs: MathExpression[], options?: ParseOptions): MathNode[]
+
+  /**
+   * Checks whether the current character `c` is a valid alpha character:
+   *
+   * - A latin letter (upper or lower case) Ascii: a-z, A-Z
+   * - An underscore                        Ascii: _
+   * - A dollar sign                        Ascii: $
+   * - A latin letter with accents          Unicode: \u00C0 - \u02AF
+   * - A greek letter                       Unicode: \u0370 - \u03FF
+   * - A mathematical alphanumeric symbol   Unicode: \u{1D400} - \u{1D7FF} excluding invalid code points
+   *
+   * The previous and next characters are needed to determine whether
+   * this character is part of a unicode surrogate pair.
+   *
+   * @param c      Current character in the expression
+   * @param cPrev  Previous character
+   * @param cNext  Next character
+   */
+  isAlpha(c: string, cPrev: string, cNext: string): boolean
+  /**
+   * Test whether a character is a valid latin, greek, or letter-like character
+   *
+   * @param c
+   */
+  isValidLatinOrGreek(c: string): boolean
+  /**
+   * Test whether two given 16 bit characters form a surrogate pair of a
+   * unicode math symbol.
+   *
+   * https://unicode-table.com/en/
+   * https://www.wikiwand.com/en/Mathematical_operators_and_symbols_in_Unicode
+   *
+   * Note: In ES6 will be unicode aware:
+   * https://stackoverflow.com/questions/280712/javascript-unicode-regexes
+   * https://mathiasbynens.be/notes/es6-unicode-regex
+   *
+   * @param high
+   * @param low
+   */
+  isValidMathSymbol(high: string, low: string): boolean
+  /**
+   * Check whether given character c is a white space character: space, tab, or enter
+   *
+   * @param c
+   * @param nestingLevel
+   */
+  isWhitespace(c: string, nestingLevel: number): boolean
+  /**
+   * Test whether the character c is a decimal mark (dot).
+   * This is the case when it's not the start of a delimiter '.*', './', or '.^'
+   *
+   * @param  c
+   * @param  cNext
+   */
+  isDecimalMark(c: string, cNext: string): boolean
+  /**
+   * checks if the given char c is a digit or dot
+   *
+   * @param  c   a string with one character
+   */
+  isDigitDot(c: string): boolean
+  /**
+   * checks if the given char c is a digit
+   *
+   * @param  c   a string with one character
+   */
+  isDigit(c: string): boolean
+  /**
+   * checks if the given char c is a hex digit
+   *
+   * @param c   a string with one character
+   */
+  isHexDigit(c: string): boolean
+}
+
+export interface NodeCtor {
+  new (): MathNode
+}
+
+export interface AccessorNode<TObject extends MathNode = MathNode>
+  extends MathNode {
+  type: 'AccessorNode'
+  isAccessorNode: true
+  object: TObject
+  index: IndexNode
+  name: string
+}
+export interface AccessorNodeCtor {
+  new <TObject extends MathNode = MathNode>(
+    object: TObject,
+    index: IndexNode
+  ): AccessorNode<TObject>
+}
+
+export interface ArrayNode<TItems extends MathNode[] = MathNode[]>
+  extends MathNode {
+  type: 'ArrayNode'
+  isArrayNode: true
+  items: [...TItems]
+}
+export interface ArrayNodeCtor {
+  new <TItems extends MathNode[] = MathNode[]>(
+    items: [...TItems]
+  ): ArrayNode<TItems>
+}
+
+export interface AssignmentNode<TValue extends MathNode = MathNode>
+  extends MathNode {
+  type: 'AssignmentNode'
+  isAssignmentNode: true
+  object: SymbolNode | AccessorNode
+  index: IndexNode | null
+  value: TValue
+  name: string
+}
+export interface AssignmentNodeCtor {
+  new <TValue extends MathNode = MathNode>(
+    object: SymbolNode,
+    value: TValue
+  ): AssignmentNode<TValue>
+  new <TValue extends MathNode = MathNode>(
+    object: SymbolNode | AccessorNode,
+    index: IndexNode,
+    value: TValue
+  ): AssignmentNode<TValue>
+}
+
+export interface BlockNode<TNode extends MathNode = MathNode> extends MathNode {
+  type: 'BlockNode'
+  isBlockNode: true
+  blocks: Array<{ node: TNode; visible: boolean }>
+}
+export interface BlockNodeCtor {
+  new <TNode extends MathNode = MathNode>(
+    arr: Array<{ node: TNode } | { node: TNode; visible: boolean }>
+  ): BlockNode
+}
+
+export interface ConditionalNode<
+  TCond extends MathNode = MathNode,
+  TTrueNode extends MathNode = MathNode,
+  TFalseNode extends MathNode = MathNode
+> extends MathNode {
+  type: 'ConditionalNode'
+  isConditionalNode: boolean
+  condition: TCond
+  trueExpr: TTrueNode
+  falseExpr: TFalseNode
+}
+export interface ConditionalNodeCtor {
+  new <
+    TCond extends MathNode = MathNode,
+    TTrueNode extends MathNode = MathNode,
+    TFalseNode extends MathNode = MathNode
+  >(
+    condition: TCond,
+    trueExpr: TTrueNode,
+    falseExpr: TFalseNode
+  ): ConditionalNode
+}
+
+export interface ConstantNode<
+  TValue extends
+    | string
+    | number
+    | boolean
+    | null
+    | undefined
+    | bigint
+    | BigNumber
+    | Fraction = number
+> extends MathNode {
+  type: 'ConstantNode'
+  isConstantNode: true
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  value: TValue
+}
+
+export interface ConstantNodeCtor {
+  new <
+    TValue extends
+      | string
+      | number
+      | boolean
+      | null
+      | undefined
+      | bigint
+      | BigNumber
+      | Fraction = string
+  >(
+    value: TValue
+  ): ConstantNode<TValue>
+}
+
+export interface FunctionAssignmentNode<TExpr extends MathNode = MathNode>
+  extends MathNode {
+  type: 'FunctionAssignmentNode'
+  isFunctionAssignmentNode: true
+  name: string
+  params: string[]
+  expr: TExpr
+}
+export interface FunctionAssignmentNodeCtor {
+  new <TExpr extends MathNode = MathNode>(
+    name: string,
+    params: string[],
+    expr: TExpr
+  ): FunctionAssignmentNode<TExpr>
+}
+
+export interface FunctionNode<
+  TFn = SymbolNode,
+  TArgs extends MathNode[] = MathNode[]
+> extends MathNode {
+  type: 'FunctionNode'
+  isFunctionNode: true
+  fn: TFn
+  args: [...TArgs]
+}
+export interface FunctionNodeCtor {
+  new <TFn = SymbolNode, TArgs extends MathNode[] = MathNode[]>(
+    fn: TFn,
+    args: [...TArgs]
+  ): FunctionNode<TFn, TArgs>
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  onUndefinedFunction: (name: string) => any
+}
+
+export interface IndexNode<TDims extends MathNode[] = MathNode[]>
+  extends MathNode {
+  type: 'IndexNode'
+  isIndexNode: true
+  dimensions: [...TDims]
+  dotNotation: boolean
+}
+export interface IndexNodeCtor {
+  new <TDims extends MathNode[] = MathNode[]>(dimensions: [...TDims]): IndexNode
+  new <TDims extends MathNode[] = MathNode[]>(
+    dimensions: [...TDims],
+    dotNotation: boolean
+  ): IndexNode<TDims>
+}
+
+export interface ObjectNode<
+  TProps extends Record<string, MathNode> = Record<string, MathNode>
+> extends MathNode {
+  type: 'ObjectNode'
+  isObjectNode: true
+  properties: TProps
+}
+export interface ObjectNodeCtor {
+  new <TProps extends Record<string, MathNode> = Record<string, MathNode>>(
+    properties: TProps
+  ): ObjectNode<TProps>
+}
+
+export type OperatorNodeMap = {
+  xor: 'xor'
+  and: 'and'
+  or: 'or'
+  bitOr: '|'
+  bitXor: '^|'
+  bitAnd: '&'
+  equal: '=='
+  unequal: '!='
+  smaller: '<'
+  larger: '>'
+  smallerEq: '<='
+  largerEq: '>='
+  leftShift: '<<'
+  rightArithShift: '>>'
+  rightLogShift: '>>>'
+  to: 'to'
+  add: '+'
+  subtract: '-'
+  multiply: '*'
+  divide: '/'
+  dotMultiply: '.*'
+  dotDivide: './'
+  mod: 'mod'
+  unaryPlus: '+'
+  unaryMinus: '-'
+  bitNot: '~'
+  not: 'not'
+  pow: '^'
+  dotPow: '.^'
+  factorial: '!'
+}
+
+export type OperatorNodeOp = OperatorNodeMap[keyof OperatorNodeMap]
+export type OperatorNodeFn = keyof OperatorNodeMap
+
+export interface OperatorNode<
+  TOp extends OperatorNodeMap[TFn] = never,
+  TFn extends OperatorNodeFn = never,
+  TArgs extends MathNode[] = MathNode[]
+> extends MathNode {
+  type: 'OperatorNode'
+  isOperatorNode: true
+  op: TOp
+  fn: TFn
+  args: [...TArgs]
+  implicit: boolean
+  isUnary(): boolean
+  isBinary(): boolean
+}
+
+export interface OperatorNodeCtor extends MathNode {
+  new <
+    TOp extends OperatorNodeMap[TFn],
+    TFn extends OperatorNodeFn,
+    TArgs extends MathNode[]
+  >(
+    op: TOp,
+    fn: TFn,
+    args: [...TArgs],
+    implicit?: boolean
+  ): OperatorNode<TOp, TFn, TArgs>
+}
+export interface ParenthesisNode<TContent extends MathNode = MathNode>
+  extends MathNode {
+  type: 'ParenthesisNode'
+  isParenthesisNode: true
+  content: TContent
+}
+export interface ParenthesisNodeCtor {
+  new <TContent extends MathNode>(content: TContent): ParenthesisNode<TContent>
+}
+
+export interface RangeNode<
+  TStart extends MathNode = MathNode,
+  TEnd extends MathNode = MathNode,
+  TStep extends MathNode = MathNode
+> extends MathNode {
+  type: 'RangeNode'
+  isRangeNode: true
+  start: TStart
+  end: TEnd
+  step: TStep | null
+}
+export interface RangeNodeCtor {
+  new <
+    TStart extends MathNode = MathNode,
+    TEnd extends MathNode = MathNode,
+    TStep extends MathNode = MathNode
+  >(
+    start: TStart,
+    end: TEnd,
+    step?: TStep
+  ): RangeNode<TStart, TEnd, TStep>
+}
+
+export interface RelationalNode<TParams extends MathNode[] = MathNode[]>
+  extends MathNode {
+  type: 'RelationalNode'
+  isRelationalNode: true
+  conditionals: string[]
+  params: [...TParams]
+}
+export interface RelationalNodeCtor {
+  new <TParams extends MathNode[] = MathNode[]>(
+    conditionals: string[],
+    params: [...TParams]
+  ): RelationalNode<TParams>
+}
+
+export interface SymbolNode extends MathNode {
+  type: 'SymbolNode'
+  isSymbolNode: true
+  name: string
+}
+export interface SymbolNodeCtor {
+  new (name: string): SymbolNode
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  onUndefinedSymbol: (name: string) => any
+}
+
+/**
+ * @deprecated since version 11.3. Prefer `MathNode` instead
+ */
+export type MathNodeCommon = MathNode
+
+export type MathJsFunctionName = keyof MathJsInstance
+
+export interface LUDecomposition {
+  L: MathCollection
+  U: MathCollection
+  p: number[]
+}
+
+export interface SLUDecomposition extends LUDecomposition {
+  q: number[]
+}
+
+export interface QRDecomposition {
+  Q: MathCollection
+  R: MathCollection
+}
+
+export interface SchurDecomposition {
+  U: MathCollection
+  T: MathCollection
+}
+
+export interface FractionDefinition {
+  a: number
+  b: number
+}
+
+export interface MathJsInstance extends MathJsFactory {
+  e: number
+  pi: number
+  i: number
+  Infinity: number
+  LN2: number
+  LN10: number
+  LOG2E: number
+  LOG10E: number
+  NaN: number
+  phi: number
+  SQRT1_2: number
+  SQRT2: number
+  tau: number
+
+  // Class-like constructors
+  Node: NodeCtor
+  AccessorNode: AccessorNodeCtor
+  ArrayNode: ArrayNodeCtor
+  AssignmentNode: AssignmentNodeCtor
+  BlockNode: BlockNodeCtor
+  ConditionalNode: ConditionalNodeCtor
+  ConstantNode: ConstantNodeCtor
+  FunctionAssignmentNode: FunctionAssignmentNodeCtor
+  FunctionNode: FunctionNodeCtor
+  IndexNode: IndexNodeCtor
+  ObjectNode: ObjectNodeCtor
+  OperatorNode: OperatorNodeCtor
+  ParenthesisNode: ParenthesisNodeCtor
+  RangeNode: RangeNodeCtor
+  RelationalNode: RelationalNodeCtor
+  SymbolNode: SymbolNodeCtor
+
+  Unit: UnitCtor
+  Matrix: MatrixCtor
+
+  /**
+   * If null were to be included in this interface, it would be
+   * auto-suggested as an import in VSCode. This causes issues because
+   * `null` is not a valid label.
+   *
+   * @see https://github.com/josdejong/mathjs/issues/2019
+   */
+  // null: number;
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  uninitialized: any
+  version: string
+
+  expression: MathNode
+
+  /**
+   * Returns reviver function that can be used as reviver in JSON.parse function.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  reviver(): (key: any, value: any) => any
+
+  /**
+   * Returns replacer function that can be used as replacer in JSON.stringify function.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  replacer(): (key: any, value: any) => any
+
+  /*************************************************************************
+   * Core functions
+   ************************************************************************/
+
+  /**
+   * Set configuration options for math.js, and get current options. Will
+   * emit a ‘config’ event, with arguments (curr, prev, changes).
+   * @param options Available options: {number} relTol Minimum relative
+   * difference between two compared values, used by all comparison
+   * functions. {number} absTol Minimum absolute
+   * difference between two compared values, used by all comparison
+   * functions. {string} matrix A string ‘Matrix’ (default) or ‘Array’.
+   * {string} number A string ‘number’ (default), ‘BigNumber’, or
+   * ‘Fraction’ {number} precision The number of significant digits for
+   * BigNumbers. Not applicable for Numbers. {string} parenthesis How to
+   * display parentheses in LaTeX and string output. {string} randomSeed
+   * Random seed for seeded pseudo random number generator. Set to null to
+   * randomly seed.
+   * @returns Returns the current configuration
+   */
+  config: (options: ConfigOptions) => ConfigOptions
+  /**
+   * Create a typed-function which checks the types of the arguments and
+   * can match them against multiple provided signatures. The
+   * typed-function automatically converts inputs in order to find a
+   * matching signature. Typed functions throw informative errors in case
+   * of wrong input arguments.
+   * @param name Optional name for the typed-function
+   * @param signatures Object with one or multiple function signatures
+   * @returns The created typed-function.
+   */
+  typed: (
+    name: string,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    signatures: Record<string, (...args: any[]) => any>
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ) => (...args: any[]) => any
+
+  /*************************************************************************
+   * Construction functions
+   ************************************************************************/
+
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to
+   * BigNumber.
+   * @param x Value for the big number, 0 by default.
+   * @returns The created bignumber
+   */
+  bignumber(
+    x?: number | string | Fraction | BigNumber | bigint | Unit | boolean | null
+  ): BigNumber
+  bignumber<T extends MathCollection>(x: T): T
+
+  /**
+   * Create a bigint, which can store integers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to
+   * bigint.
+   * @param x Value for the integer, 0 by default.
+   * @returns The created bigint
+   */
+  bigint(
+    x?: number | string | Fraction | BigNumber | bigint | boolean | null
+  ): bigint
+  bigint<T extends MathCollection>(x: T): T
+
+  /**
+   * Create a boolean or convert a string or number to a boolean. In case
+   * of a number, true is returned for non-zero numbers, and false in case
+   * of zero. Strings can be 'true' or 'false', or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   * @param x A value of any type
+   * @returns The boolean value
+   */
+  boolean(x: string | number | boolean | null): boolean
+  boolean(x: MathCollection): MathCollection
+
+  /**
+   * Wrap any value in a chain, allowing to perform chained operations on
+   * the value. All methods available in the math.js library can be called
+   * upon the chain, and then will be evaluated with the value itself as
+   * first argument. The chain can be closed by executing chain.done(),
+   * which returns the final value. The chain has a number of special
+   * functions: done() Finalize the chain and return the chain's value.
+   * valueOf() The same as done() toString() Executes math.format() onto
+   * the chain's value, returning a string representation of the value.
+   * @param value A value of any type on which to start a chained
+   * operation.
+   * @returns The created chain
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  chain<TValue>(value?: TValue): MathJsChain<TValue>
+
+  /**
+   * Create a complex value or convert a value to a complex value.
+   * @param args Arguments specifying the real and imaginary part of the
+   * complex number
+   * @returns Returns a complex value
+   */
+  complex(arg?: MathNumericType | string | PolarCoordinates): Complex
+  complex(arg?: MathCollection): MathCollection
+  /**
+   * @param re Argument specifying the real part of the complex number
+   * @param im Argument specifying the imaginary part of the complex
+   * number
+   * @returns Returns a complex value
+   */
+  complex(re: number, im: number): Complex
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * @param name The name of the new unit. Must be unique. Example: ‘knot’
+   * @param definition Definition of the unit in terms of existing units.
+   * For example, ‘0.514444444 m / s’.
+   * @param options (optional) An object containing any of the following
+   * properties:</br>- prefixes {string} “none”, “short”, “long”,
+   * “binary_short”, or “binary_long”. The default is “none”.</br>-
+   * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+   * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+   * the unit. For example, the offset for celsius is 273.15. Default is
+   * 0.
+   * @returns The new unit
+   */
+  createUnit(
+    name: string,
+    definition?: string | UnitDefinition | Unit,
+    options?: CreateUnitOptions
+  ): Unit
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * @param units Definition of the unit
+   * @param options
+   * @returns The new unit
+   */
+  createUnit(
+    units: Record<string, string | UnitDefinition | Unit>,
+    options?: CreateUnitOptions
+  ): Unit
+
+  /**
+   * Create a fraction convert a value to a fraction.
+   * @param value Arguments specifying the numerator and denominator of the
+   * fraction
+   * @returns Returns a fraction
+   */
+  fraction(
+    value:
+      | number
+      | string
+      | BigNumber
+      | bigint
+      | Unit
+      | Fraction
+      | FractionDefinition
+  ): Fraction
+  fraction(values: MathCollection): MathCollection
+  /**
+   * @param numerator Argument specifying the numerator of the fraction
+   * @param denominator Argument specifying the denominator of the
+   * fraction
+   * @returns Returns a fraction
+   */
+  fraction(numerator: bigint, denominator: bigint): Fraction
+  fraction(numerator: number, denominator: number): Fraction
+
+  /**
+   * Create an index. An Index can store ranges having start, step, and
+   * end for multiple dimensions. Matrix.get, Matrix.set, and math.subset
+   * accept an Index as input.
+   * @param ranges Zero or more ranges or numbers.
+   * @returns Returns the created index
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  index(...ranges: any[]): Index
+
+  /**
+   * Create a Matrix. The function creates a new math.type.Matrix object
+   * from an Array. A Matrix has utility functions to manipulate the data
+   * in the matrix, like getting the size and getting or setting values in
+   * the matrix. Supported storage formats are 'dense' and 'sparse'.
+   * @param format The Matrix storage format
+   * @returns The created Matrix
+   */
+  matrix(format?: MatrixStorageFormat): Matrix
+  /**
+   * @param data A multi dimensional array
+   * @param format The Matrix storage format
+   * @param dataType The Matrix data type
+   * @returns The created Matrix
+   */
+  matrix(
+    data: MathCollection | string[],
+    format?: MatrixStorageFormat,
+    dataType?: string
+  ): Matrix
+  matrix<T extends MathScalarType>(
+    data: MathCollection<T>,
+    format?: MatrixStorageFormat,
+    dataType?: string
+  ): Matrix<T>
+
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   * @param value Value to be converted
+   * @returns The created number
+   */
+  number(
+    value?:
+      | string
+      | number
+      | BigNumber
+      | bigint
+      | Fraction
+      | boolean
+      | Unit
+      | null
+  ): number
+  number(value?: MathCollection): number | MathCollection
+  /**
+   * @param value Value to be converted
+   * @param valuelessUnit A valueless unit, used to convert a unit to a
+   * number
+   * @returns The created number
+   */
+  number(unit: Unit, valuelessUnit: Unit | string): number
+
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.
+   * @param value The value to be converted
+   * @param outputType The desired numeric output type
+   */
+  numeric(
+    value: string | number | BigNumber | bigint | Fraction,
+    outputType: 'number'
+  ): number
+  numeric(
+    value: string | number | BigNumber | bigint | Fraction,
+    outputType: 'BigNumber'
+  ): BigNumber
+  numeric(
+    value: string | number | BigNumber | bigint | Fraction,
+    outputType: 'bigint'
+  ): bigint
+  numeric(
+    value: string | number | BigNumber | bigint | Fraction,
+    outputType: 'Fraction'
+  ): Fraction
+
+  /**
+   * Create a Sparse Matrix. The function creates a new math.type.Matrix
+   * object from an Array. A Matrix has utility functions to manipulate
+   * the data in the matrix, like getting the size and getting or setting
+   * values in the matrix.
+   * @param data A two dimensional array
+   * @param dataType Sparse Matrix data type
+   * @returns The created matrix
+   */
+  sparse(data?: MathCollection, dataType?: string): Matrix
+
+  /**
+   * Split a unit in an array of units whose sum is equal to the original
+   * unit.
+   * @param unit A unit to be split
+   * @param parts An array of strings or valueless units
+   * @returns An array of units
+   */
+  splitUnit(unit: Unit, parts: Unit[]): Unit[]
+
+  /**
+   * Create a string or convert any object into a string. Elements of
+   * Arrays and Matrices are processed element wise.
+   * @param value A value to convert to a string
+   * @returns The created string
+   */
+  string(value: MathNumericType | string | Unit | null): string
+  string(value: MathCollection): MathCollection
+
+  /**
+   * Create a unit. Depending on the passed arguments, the function will
+   * create and return a new math.type.Unit object. When a matrix is
+   * provided, all elements will be converted to units.
+   * @param unit The unit to be created
+   * @returns The created unit
+   */
+  unit(unit: string): Unit
+  /**
+   * @param unit The unit to be created
+   * @returns The created unit
+   */
+  unit(unit: Unit): Unit
+  /**
+   * @param value The value of the unit to be created
+   * @param unit The unit to be created
+   * @returns The created unit
+   */
+  unit(value: MathNumericType, unit?: string): Unit
+  unit(value: MathCollection): Unit[]
+
+  /*************************************************************************
+   * Expression functions
+   ************************************************************************/
+
+  /**
+   * Parse and compile an expression. Returns a an object with a function
+   * evaluate([scope]) to evaluate the compiled expression.
+   * @param expr The expression to be compiled
+   * @returns An object with the compiled expression
+   */
+  compile(expr: MathExpression): EvalFunction
+  /**
+   * @param exprs The expressions to be compiled
+   * @returns An array of objects with the compiled expressions
+   */
+  compile(exprs: MathExpression[]): EvalFunction[]
+
+  // TODO properly type this
+  /**
+   * Evaluate an expression.
+   * @param expr The expression to be evaluated
+   * @param scope Scope to read/write variables
+   * @returns The result of the expression
+   */
+  evaluate(
+    expr: MathExpression | Matrix,
+    scope?: MathScope
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ): any
+  evaluate(
+    expr: MathExpression[],
+    scope?: MathScope
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ): any[]
+
+  /**
+   * Retrieve help on a function or data type. Help files are retrieved
+   * from the documentation in math.expression.docs.
+   * @param search A function or function name for which to get help
+   * @returns A help object
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  help(search: () => any): Help
+
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate();
+   */
+  parse: ParseFunction
+
+  /**
+   * Create a parser. The function creates a new math.expression.Parser
+   * object.
+   * @returns A Parser object
+   */
+  parser(): Parser
+
+  /*************************************************************************
+   * Algebra functions
+   ************************************************************************/
+  /**
+   * @param expr The expression to differentiate
+   * @param variable The variable over which to differentiate
+   * @param options There is one option available, simplify, which is true
+   * by default. When false, output will not be simplified.
+   * @returns The derivative of expr
+   */
+  derivative(
+    expr: MathNode | string,
+    variable: MathNode | string,
+    options?: { simplify: boolean }
+  ): MathNode
+
+  /**
+   * Solves the linear equation system by forwards substitution. Matrix
+   * must be a lower triangular matrix.
+   * @param L A N x N matrix or array (L)
+   * @param b A column vector with the b values
+   * @returns A column vector with the linear system solution (x)
+   */
+  lsolve(L: Matrix, b: MathCollection): Matrix
+  lsolve(L: MathArray, b: MathCollection): MathArray
+
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix A
+   * is decomposed in two matrices (L, U) and a row permutation vector p
+   * where A[p,:] = L * U
+   * @param A A two dimensional matrix or array for which to get the LUP
+   * decomposition.
+   * @returns The lower triangular matrix, the upper triangular matrix and
+   * the permutation matrix.
+   */
+  lup(A?: MathCollection): LUDecomposition
+
+  /**
+   * Solves the linear system A * x = b where A is an [n x n] matrix and b
+   * is a [n] column vector.
+   * @param A Invertible Matrix or the Matrix LU decomposition
+   * @param b Column Vector
+   * @param order The Symbolic Ordering and Analysis order, see slu for
+   * details. Matrix must be a SparseMatrix
+   * @param threshold Partial pivoting threshold (1 for partial pivoting),
+   * see slu for details. Matrix must be a SparseMatrix.
+   * @returns Column vector with the solution to the linear system A * x =
+   * b
+   */
+  lusolve(
+    A: Matrix,
+    b: MathCollection,
+    order?: number,
+    threshold?: number
+  ): Matrix
+
+  lusolve(
+    A: MathArray,
+    b: MathCollection,
+    order?: number,
+    threshold?: number
+  ): MathArray
+
+  lusolve(A: LUDecomposition, b: MathCollection): Matrix
+
+  /* Finds the roots of a polynomial of degree three or less. Coefficients are given constant first
+   * followed by linear and higher powers in order; coefficients beyond the degree of the polynomial
+   * need not be specified.
+   * @param {number|Complex} constantCoeff
+   * @param {number|Complex} linearCoeff
+   * @param {number|Complex} quadraticCoeff
+   * @param {number|Complex} cubicCoeff
+   * @returns {Array<number|Complex>} array of roots of specified polynomial
+   */
+  polynomialRoot(
+    constantCoeff: number | Complex,
+    linearCoeff: number | Complex,
+    quadraticCoeff?: number | Complex,
+    cubicCoeff?: number | Complex
+  ): (number | Complex)[]
+
+  /**
+   * Calculate the Matrix QR decomposition. Matrix A is decomposed in two
+   * matrices (Q, R) where Q is an orthogonal matrix and R is an upper
+   * triangular matrix.
+   * @param A A two dimensional matrix or array for which to get the QR
+   * decomposition.
+   * @returns Q: the orthogonal matrix and R: the upper triangular matrix
+   */
+  qr(A: MathCollection): QRDecomposition
+
+  rationalize(
+    expr: MathNode | string,
+    optional?: object | boolean,
+    detailed?: false
+  ): MathNode
+  /**
+   * Transform a rationalizable expression in a rational fraction. If
+   * rational fraction is one variable polynomial then converts the
+   * numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   * @param expr The expression to check if is a polynomial expression
+   * @param optional scope of expression or true for already evaluated
+   * rational expression at input
+   * @param detailed  optional True if return an object, false if return
+   * expression node (default)
+   * @returns The rational polynomial of expr
+   */
+  rationalize(
+    expr: MathNode | string,
+    optional?: object | boolean,
+    detailed?: true
+  ): {
+    expression: MathNode | string
+    variables: string[]
+    coefficients: MathType[]
+  }
+
+  /**
+   * Simplify an expression tree.
+   * @param expr The expression to be simplified
+   * @param [rules] (optional) A list of rules are applied to an expression, repeating
+   * over the list until no further changes are made. It’s possible to
+   * pass a custom set of rules to the function as second argument. A rule
+   * can be specified as an object, string, or function.
+   * @param [scope] (optional) Scope to variables
+   * @param [options] (optional) An object with simplify options
+   * @returns Returns the simplified form of expr
+   */
+  simplify: Simplify
+
+  simplifyConstant(expr: MathNode | string, options?: SimplifyOptions): MathNode
+  simplifyCore(expr: MathNode | string, options?: SimplifyOptions): MathNode
+
+  /**
+   * Gives the number of “leaf nodes” in the parse tree of the given
+   * expression. A leaf node is one that has no subexpressions, essentially
+   * either a symbol or a constant. Note that `5!` has just one leaf, the `5`;
+   * the unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   */
+  leafCount(expr: MathNode): number
+
+  /**
+   *  Replaces variable nodes with their scoped values
+   * @param node Tree to replace variable nodes in
+   * @param scope Scope to read/write variables
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  resolve(node: MathNode | string, scope?: MathScope): MathNode
+  resolve(
+    node: (MathNode | string)[],
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    scope?: MathScope
+  ): MathNode[]
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  resolve(node: Matrix, scope?: MathScope): Matrix
+
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting.
+   * Sparse Matrix A is decomposed in two matrices (L, U) and two
+   * permutation vectors (pinv, q) where P * A * Q = L * U
+   * @param A A two dimensional sparse matrix for which to get the LU
+   * decomposition.
+   * @param order The Symbolic Ordering and Analysis order: 0 - Natural
+   * ordering, no permutation vector q is returned 1 - Matrix must be
+   * square, symbolic ordering and analysis is performed on M = A + A' 2 -
+   * Symbolic ordering and analysis is performed on M = A' * A. Dense
+   * columns from A' are dropped, A recreated from A'. This is appropriate
+   * for LU factorization of non-symmetric matrices. 3 - Symbolic ordering
+   * and analysis is performed on M = A' * A. This is best used for LU
+   * factorization is matrix M has no dense rows. A dense row is a row
+   * with more than 10*sqr(columns) entries.
+   * @param threshold Partial pivoting threshold (1 for partial pivoting)
+   * @returns The lower triangular matrix, the upper triangular matrix and
+   * the permutation vectors.
+   */
+  slu(A: Matrix, order: number, threshold: number): SLUDecomposition
+
+  /**
+   * Solves the linear equation system by backward substitution. Matrix
+   * must be an upper triangular matrix. U * x = b
+   * @param U A N x N matrix or array (U)
+   * @param b A column vector with the b values
+   * @returns A column vector with the linear system solution (x)
+   */
+  usolve(U: Matrix, b: MathCollection): Matrix
+  usolve(U: MathArray, b: MathCollection): MathArray
+
+  /*************************************************************************
+   * Arithmetic functions
+   ************************************************************************/
+
+  /**
+   * Calculate the absolute value of a number. For matrices, the function
+   * is evaluated element wise.
+   * @param x A number or matrix for which to get the absolute value
+   * @returns Absolute value of x
+   */
+  abs(x: Complex): number
+  abs<T extends MathType>(x: T): T
+
+  /**
+   * Add two values, x + y. For matrices, the function is evaluated
+   * element wise.
+   * @param x First value to add
+   * @param y Second value to add
+   * @returns Sum of x and y
+   */
+  add<T extends MathType>(x: T, y: T): T
+  add<T extends MathType>(x: T, y: T, ...values: T[]): T
+  add(x: MathType, y: MathType): MathType
+  add(x: MathType, y: MathType, ...values: MathType[]): MathType
+
+  /**
+   * Calculate the cubic root of a value.
+   * @param x Value for which to calculate the cubic root.
+   * @param allRoots Optional, false by default. Only applicable when x is
+   * a number or complex number. If true, all complex roots are returned,
+   * if false (default) the principal root is returned.
+   * @returns Returns the cubic root of x
+   */
+  cbrt(x: Complex, allRoots?: boolean): Complex
+  cbrt<T extends number | BigNumber | Unit>(x: T): T
+
+  // Rounding functions, grouped for similarity, even though it breaks
+  // the alphabetic order among arithmetic functions.
+
+  /**
+   * Round a value towards plus infinity If x is complex, both real and
+   * imaginary part are rounded towards plus infinity. For matrices, the
+   * function is evaluated element wise.
+   * @param x Number to be rounded
+   * @param n Number of decimals Default value: 0.
+   * @returns Rounded value
+   */
+  ceil<T extends MathNumericType | MathCollection>(
+    x: T,
+    n?: number | BigNumber
+  ): NoLiteralType<T>
+  ceil<U extends MathCollection>(x: MathNumericType, n: U): U
+  ceil<U extends MathCollection<Unit>>(x: U, unit: Unit): U
+  ceil(x: Unit, unit: Unit): Unit
+  ceil(x: Unit, n: number | BigNumber, unit: Unit): Unit
+  ceil<U extends MathCollection<Unit>>(
+    x: U,
+    n: number | BigNumber,
+    unit: Unit
+  ): U
+
+  /**
+   * Round a value towards zero. For matrices, the function is evaluated
+   * element wise.
+   * @param x Number to be rounded
+   * @param n Number of decimals Default value: 0.
+   * @returns Rounded value
+   */
+  fix<T extends MathNumericType | MathCollection>(
+    x: T,
+    n?: number | BigNumber
+  ): NoLiteralType<T>
+  fix<U extends MathCollection>(x: MathNumericType, n: U): U
+  fix<U extends MathCollection<Unit>>(x: U, unit: Unit): U
+  fix(x: Unit, unit: Unit): Unit
+  fix(x: Unit, n: number | BigNumber, unit: Unit): Unit
+  fix<U extends MathCollection<Unit>>(
+    x: U,
+    n: number | BigNumber,
+    unit: Unit
+  ): U
+
+  /**
+   * Round a value towards minus infinity. For matrices, the function is
+   * evaluated element wise.
+   * @param x Number to be rounded
+   * @param n Number of decimals Default value: 0.
+   * @returns Rounded value
+   */
+  floor<T extends MathNumericType | MathCollection>(
+    x: T,
+    n?: number | BigNumber
+  ): NoLiteralType<T>
+  floor<U extends MathCollection>(x: MathNumericType, n: U): U
+  floor<U extends MathCollection<Unit>>(x: U, unit: Unit): U
+  floor(x: Unit, unit: Unit): Unit
+  floor(x: Unit, n: number | BigNumber, unit: Unit): Unit
+  floor<U extends MathCollection<Unit>>(
+    x: U,
+    n: number | BigNumber,
+    unit: Unit
+  ): U
+
+  /**
+   * Round a value towards the nearest integer. For matrices, the function
+   * is evaluated element wise.
+   * @param x Number to be rounded
+   * @param n Number of decimals Default value: 0.
+   * @returns Rounded value of x
+   */
+  round<T extends MathNumericType | MathCollection>(
+    x: T,
+    n?: number | BigNumber
+  ): NoLiteralType<T>
+  round<U extends MathCollection>(x: MathNumericType, n: U): U
+  round<U extends MathCollection<Unit>>(x: U, unit: Unit): U
+  round(x: Unit, unit: Unit): Unit
+  round(x: Unit, n: number | BigNumber, unit: Unit): Unit
+  round<U extends MathCollection<Unit>>(
+    x: U,
+    n: number | BigNumber,
+    unit: Unit
+  ): U
+
+  // End of group of rounding functions
+
+  /**
+   * Compute the cube of a value, x * x * x. For matrices, the function is
+   * evaluated element wise.
+   * @param x Number for which to calculate the cube
+   * @returns Cube of x
+   */
+  cube<T extends MathNumericType | Unit>(x: T): T
+
+  /**
+   * Divide two values, x / y. To divide matrices, x is multiplied with
+   * the inverse of y: x * inv(y).
+   * @param x Numerator
+   * @param y Denominator
+   * @returns Quotient, x / y
+   */
+  divide(x: Unit, y: Unit): Unit | number
+  divide(x: Unit, y: number): Unit
+  divide(x: number, y: number): number
+  divide(x: MathType, y: MathType): MathType
+
+  /**
+   * Divide two matrices element wise. The function accepts both matrices
+   * and scalar values.
+   * @param x Numerator
+   * @param y Denominator
+   * @returns Quotient, x ./ y
+   */
+  dotDivide<T extends MathCollection>(x: T, y: MathType): T
+  dotDivide<T extends MathCollection>(x: MathType, y: T): T
+  dotDivide(x: Unit, y: MathType): Unit
+  dotDivide(x: MathType, y: Unit): Unit
+  dotDivide(x: MathNumericType, y: MathNumericType): MathNumericType
+
+  /**
+   * Multiply two matrices element wise. The function accepts both
+   * matrices and scalar values.
+   * @param x Left hand value
+   * @param y Right hand value
+   * @returns Multiplication of x and y
+   */
+  dotMultiply<T extends MathCollection>(x: T, y: MathType): T
+  dotMultiply<T extends MathCollection>(x: MathType, y: T): T
+  dotMultiply(x: Unit, y: MathType): Unit
+  dotMultiply(x: MathType, y: Unit): Unit
+  dotMultiply(x: MathNumericType, y: MathNumericType): MathNumericType
+
+  /**
+   * Calculates the power of x to y element wise.
+   * @param x The base
+   * @param y The exponent
+   * @returns The value of x to the power y
+   */
+  dotPow<T extends MathType>(x: T, y: MathType): T
+
+  /**
+   * Calculate the exponent of a value. For matrices, the function is
+   * evaluated element wise.
+   * @param x A number or matrix to exponentiate
+   * @returns Exponent of x
+   */
+  exp<T extends number | BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the value of subtracting 1 from the exponential value. For
+   * matrices, the function is evaluated element wise.
+   * @param x A number or matrix to apply expm1
+   * @returns Exponent of x
+   */
+  expm1<T extends number | BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the greatest common divisor for two or more values or
+   * arrays. For matrices, the function is evaluated element wise.
+   * @param args Two or more integer numbers
+   * @returns The greatest common divisor
+   */
+  gcd<T extends number | BigNumber | Fraction | MathCollection>(...args: T[]): T
+  gcd<T extends number | BigNumber | Fraction | Matrix>(args: T[]): T
+
+  /**
+   * Calculate the hypotenuse of a list with values. The hypotenuse is
+   * defined as: hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...) For
+   * matrix input, the hypotenuse is calculated for all values in the
+   * matrix.
+   * @param args A list with numeric values or an Array or Matrix. Matrix
+   * and Array input is flattened and returns a single number for the
+   * whole matrix.
+   * @returns Returns the hypotenuse of the input values.
+   */
+  hypot<T extends number | BigNumber>(...args: T[]): T
+  hypot<T extends number | BigNumber>(args: T[]): T
+
+  /**
+   * Create a dense matrix from vectors as individual rows. If you pass column vectors, they will be transposed (but not conjugated!)
+   * @param rows - a multi-dimensional number array or matrix
+   */
+  matrixFromRows(...rows: Matrix[]): Matrix
+  matrixFromRows<T extends MathScalarType>(
+    ...rows: (T[] | [T][] | Matrix)[]
+  ): T[][]
+
+  /**
+   * Create a dense matrix from vectors as individual columns. If you pass row vectors, they will be transposed (but not conjugated!)
+   * @param cols - a multi-dimensional number array or matrix
+   */
+  matrixFromColumns(...cols: Matrix[]): Matrix
+  matrixFromColumns<T extends MathScalarType>(
+    ...cols: (T[] | [T][] | Matrix)[]
+  ): T[][]
+  /**
+   * Create a matrix by evaluating a generating function at each index. The simplest overload returns a multi-dimensional array as long as size is an array. Passing size as a Matrix or specifying a format will result in returning a Matrix.
+   * @param size - the size of the matrix to be created
+   * @param fn - Callback function invoked for every entry in the matrix
+   * @param format - The Matrix storage format, either 'dense' or 'sparse'
+   * @param datatype - Type of the values
+   */
+  matrixFromFunction<T extends MathScalarType>(
+    size: [number],
+    fn: MatrixFromFunctionCallback<T>
+  ): T[]
+  matrixFromFunction<T extends MathScalarType>(
+    size: [number, number],
+    fn: MatrixFromFunctionCallback<T>
+  ): T[][]
+  matrixFromFunction<T extends MathScalarType>(
+    size: number[],
+    fn: MatrixFromFunctionCallback<T>
+  ): MathArray<T>
+  matrixFromFunction(
+    size: Matrix<number>,
+    fn: MatrixFromFunctionCallback<MathScalarType>
+  ): Matrix
+  matrixFromFunction(
+    size: number[] | Matrix<number>,
+    fn: MatrixFromFunctionCallback<MathScalarType>,
+    format: MatrixStorageFormat,
+    datatype?: string
+  ): Matrix
+  matrixFromFunction(
+    size: number[] | Matrix<number>,
+    format: MatrixStorageFormat,
+    fn: MatrixFromFunctionCallback<MathScalarType>,
+    datatype?: string
+  ): Matrix
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   * lcm is defined as: lcm(a, b) = abs(a * b) / gcd(a, b) For matrices,
+   * the function is evaluated element wise.
+   * @param a An integer number
+   * @param b An integer number
+   * @returns The least common multiple
+   */
+  lcm<T extends number | BigNumber | MathCollection>(a: T, b: T): T
+
+  /**
+   * Calculate the logarithm of a value.
+   * @param x Value for which to calculate the logarithm.
+   * @param base Optional base for the logarithm. If not provided, the
+   * natural logarithm of x is calculated. Default value: e.
+   * @returns Returns the logarithm of x
+   */
+  log<T extends number | BigNumber | Complex>(
+    x: T,
+    base?: number | BigNumber | Complex
+  ): NoLiteralType<T>
+
+  /**
+   * Calculate the 10-base of a value. This is the same as calculating
+   * log(x, 10). For matrices, the function is evaluated element wise.
+   * @param x Value for which to calculate the logarithm.
+   * @returns Returns the 10-base logarithm of x
+   */
+  log10<T extends number | BigNumber | Complex | MathCollection>(x: T): T
+
+  /**
+   * Calculate the logarithm of a value+1. For matrices, the function is
+   * evaluated element wise.
+   * @param x Value for which to calculate the logarithm.
+   * @returns Returns the logarithm of x+1
+   */
+  log1p<T extends number | BigNumber | Complex | MathCollection>(
+    x: T,
+    base?: number | BigNumber | Complex
+  ): T
+
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating
+   * log(x, 2). For matrices, the function is evaluated element wise.
+   * @param x Value for which to calculate the logarithm.
+   * @returns Returns the 2-base logarithm of x
+   */
+  log2<T extends number | BigNumber | Complex | MathCollection>(x: T): T
+
+  /**
+   * Calculates the modulus, the remainder of an integer division. For
+   * matrices, the function is evaluated element wise. The modulus is
+   * defined as: x - y * floor(x / y)
+   * @see http://en.wikipedia.org/wiki/Modulo_operation.
+   * @param x Dividend
+   * @param y Divisor
+   * @returns Returns the remainder of x divided by y
+   */
+  mod<T extends number | BigNumber | bigint | Fraction | MathCollection>(
+    x: T,
+    y: number | BigNumber | bigint | Fraction | MathCollection
+  ): NoLiteralType<T>
+
+  /**
+   * Multiply two values, x * y. The result is squeezed. For matrices, the
+   * matrix product is calculated.
+   * @param x The first value to multiply
+   * @param y The second value to multiply
+   * @returns Multiplication of x and y
+   */
+
+  multiply<T extends Matrix>(x: T, y: MathType): Matrix
+  multiply<T extends Matrix>(x: MathType, y: T): Matrix
+
+  multiply<T extends MathArray>(x: T, y: T[]): T
+  multiply<T extends MathArray>(x: T[], y: T): T
+  multiply<T extends MathArray>(x: T[], y: T[]): T[]
+  multiply<T extends MathArray>(x: T, y: T): MathScalarType
+  multiply(x: Unit, y: Unit): Unit
+  multiply(x: number, y: number): number
+  multiply(x: MathType, y: MathType, ...values: MathType[]): MathType
+  multiply<T extends MathType>(x: T, y: T, ...values: T[]): T
+
+  /**
+   * Calculate the norm of a number, vector or matrix. The second
+   * parameter p is optional. If not provided, it defaults to 2.
+   * @param x Value for which to calculate the norm
+   * @param p Vector space. Supported numbers include Infinity and
+   * -Infinity. Supported strings are: 'inf', '-inf', and 'fro' (The
+   * Frobenius norm) Default value: 2.
+   * @returns the p-norm
+   */
+  norm(
+    x: number | BigNumber | Complex | MathCollection,
+    p?: number | BigNumber | string
+  ): number | BigNumber
+
+  /**
+   * Calculate the nth root of a value. The principal nth root of a
+   * positive real number A, is the positive real solution of the equation
+   * x^root = A For matrices, the function is evaluated element wise.
+   * @param a Value for which to calculate the nth root
+   * @param root The root. Default value: 2.
+   * @return The nth root of a
+   */
+  nthRoot(
+    a: number | BigNumber | MathCollection | Complex,
+    root?: number | BigNumber
+  ): number | Complex | MathCollection
+
+  /**
+   * Calculates the power of x to y, x ^ y. Matrix exponentiation is
+   * supported for square matrices x, and positive integer exponents y.
+   * @param x The base
+   * @param y The exponent
+   * @returns x to the power y
+   */
+  pow(x: MathType, y: number | BigNumber | bigint | Complex): MathType
+
+  /**
+   * Compute the sign of a value. The sign of a value x is: 1 when x > 1
+   * -1 when x < 0 0 when x == 0 For matrices, the function is evaluated
+   * element wise.
+   * @param x The number for which to determine the sign
+   * @returns The sign of x
+   */
+  sign<T extends MathType>(x: T): T
+
+  /**
+   * Calculate the square root of a value. For matrices, use either
+   * sqrtm for the matrix square root, or map(M, sqrt) to take the
+   * square root element wise.
+   * @param x Value for which to calculate the square root
+   * @returns Returns the square root of x
+   */
+  sqrt(x: number): number | Complex
+  sqrt<T extends BigNumber | Complex | Unit>(x: T): T
+
+  /**
+   * Compute the square of a value, x * x.
+   * @param x Number for which to calculate the square
+   * @returns Squared value
+   */
+  square<T extends MathNumericType | Unit>(x: T): T
+
+  /**
+   * Subtract two values, x - y. For matrices, the function is evaluated
+   * element wise.
+   * @param x Initial value
+   * @param y Value to subtract from x
+   * @returns Subtraction of x and y
+   */
+  subtract<T extends MathType>(x: T, y: T): T
+  subtract(x: MathType, y: MathType): MathType
+
+  /**
+   * Inverse the sign of a value, apply a unary minus operation. For
+   * matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real
+   * and complex value are inverted.
+   * @param x Number to be inverted
+   * @returns Returns the value with inverted sign
+   */
+  unaryMinus<T extends MathType>(x: T): T
+
+  /**
+   * Unary plus operation. Boolean values and strings will be converted to
+   * a number, numeric values will be returned as is. For matrices, the
+   * function is evaluated element wise.
+   * @param x Input value
+   * @returns Returns the input value when numeric, converts to a number
+   * when input is non-numeric.
+   */
+  unaryPlus<T extends string | MathType>(x: T): T
+
+  /**
+   * Calculate the extended greatest common divisor for two values. See
+   * http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   * @param a An integer number
+   * @param b An integer number
+   * @returns Returns an array containing 3 integers [div, m, n] where div
+   * = gcd(a, b) and a*m + b*n = div
+   */
+  xgcd(a: number | BigNumber, b: number | BigNumber): MathArray
+
+  /*************************************************************************
+   * Bitwise functions
+   ************************************************************************/
+
+  /**
+   * Bitwise AND two values, x & y. For matrices, the function is
+   * evaluated element wise.
+   * @param x First value to and
+   * @param y Second value to and
+   * @returns AND of x and y
+   */
+  bitAnd<T extends number | BigNumber | bigint | MathCollection>(
+    x: T,
+    y: number | BigNumber | bigint | MathCollection
+  ): NoLiteralType<T>
+
+  /**
+   * Bitwise NOT value, ~x. For matrices, the function is evaluated
+   * element wise. For units, the function is evaluated on the best prefix
+   * base.
+   * @param x Value to not
+   * @returns NOT of x
+   */
+  bitNot<T extends number | BigNumber | bigint | MathCollection>(x: T): T
+
+  /**
+   * Bitwise OR two values, x | y. For matrices, the function is evaluated
+   * element wise. For units, the function is evaluated on the lowest
+   * print base.
+   * @param x First value to or
+   * @param y Second value to or
+   * @returns OR of x and y
+   */
+  bitOr<T extends number | BigNumber | bigint | MathCollection>(x: T, y: T): T
+
+  /**
+   * Bitwise XOR two values, x ^ y. For matrices, the function is
+   * evaluated element wise.
+   * @param x First value to xor
+   * @param y Second value to xor
+   * @returns XOR of x and y
+   */
+  bitXor<T extends number | BigNumber | bigint | MathCollection>(
+    x: T,
+    y: number | BigNumber | bigint | MathCollection
+  ): NoLiteralType<T>
+
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, x << y.
+   * For matrices, the function is evaluated element wise. For units, the
+   * function is evaluated on the best prefix base.
+   * @param x Value to be shifted
+   * @param y Amount of shifts
+   * @returns x shifted left y times
+   */
+  leftShift<T extends number | BigNumber | bigint | MathCollection>(
+    x: T,
+    y: number | BigNumber | bigint
+  ): NoLiteralType<T>
+
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, x >>
+   * y. For matrices, the function is evaluated element wise. For units,
+   * the function is evaluated on the best prefix base.
+   * @param x Value to be shifted
+   * @param y Amount of shifts
+   * @returns x sign-filled shifted right y times
+   */
+  rightArithShift<T extends number | BigNumber | bigint | MathCollection>(
+    x: T,
+    y: number | BigNumber | bigint
+  ): NoLiteralType<T>
+
+  /**
+   * Bitwise right logical shift of value x by y number of bits, x >>> y.
+   * For matrices, the function is evaluated element wise. For units, the
+   * function is evaluated on the best prefix base.
+   * @param x Value to be shifted
+   * @param y Amount of shifts
+   * @returns x zero-filled shifted right y times
+   */
+  rightLogShift<T extends number | MathCollection>(
+    x: T,
+    y: number
+  ): NoLiteralType<T>
+
+  /*************************************************************************
+   * Combinatorics functions
+   ************************************************************************/
+
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition
+   * is a pairwise disjoint subset of S whose union is S. bellNumbers only
+   * takes integer arguments. The following condition must be enforced: n
+   * >= 0
+   * @param n Total number of objects in the set
+   * @returns B(n)
+   */
+  bellNumbers<T extends number | BigNumber>(n: T): T
+
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many
+   * different types. catalan only takes integer arguments. The following
+   * condition must be enforced: n >= 0
+   * @param n nth Catalan number
+   * @returns Cn(n)
+   */
+  catalan<T extends number | BigNumber>(n: T): T
+
+  /**
+   * The composition counts of n into k parts. Composition only takes
+   * integer arguments. The following condition must be enforced: k <= n.
+   * @param n Total number of objects in the set
+   * @param k Number of objects in the subset
+   * @returns Returns the composition counts of n into k parts.
+   */
+  composition<T extends number | BigNumber>(
+    n: T,
+    k: number | BigNumber
+  ): NoLiteralType<T>
+
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to
+   * partition a set of n labelled objects into k nonempty unlabelled
+   * subsets. stirlingS2 only takes integer arguments. The following
+   * condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) =
+   * 1
+   * @param n Total number of objects in the set
+   * @param k Number of objects in the subset
+   * @returns S(n,k)
+   */
+  stirlingS2<T extends number | BigNumber>(
+    n: T,
+    k: number | BigNumber
+  ): NoLiteralType<T>
+
+  /*************************************************************************
+   * Complex functions
+   ************************************************************************/
+
+  /**
+   * Compute the argument of a complex value. For a complex number a + bi,
+   * the argument is computed as atan2(b, a). For matrices, the function
+   * is evaluated element wise.
+   * @param x A complex number or array with complex numbers
+   * @returns The argument of x
+   */
+  arg(x: number | Complex): number
+  arg(x: BigNumber | Complex): BigNumber
+  arg<T extends MathCollection>(x: T): T
+
+  /**
+   * Compute the complex conjugate of a complex value. If x = a+bi, the
+   * complex conjugate of x is a - bi. For matrices, the function is
+   * evaluated element wise.
+   * @param x A complex number or array with complex numbers
+   * @returns The complex conjugate of x
+   */
+  conj<T extends number | BigNumber | Complex | MathCollection>(
+    x: T
+  ): NoLiteralType<T>
+
+  /**
+   * Get the imaginary part of a complex number. For a complex number a +
+   * bi, the function returns b. For matrices, the function is evaluated
+   * element wise.
+   * @param x A complex number or array with complex numbers
+   * @returns The imaginary part of x
+   */
+  im(x: MathJsChain<number | Complex>): MathJsChain<number>
+  im<T extends BigNumber | MathCollection>(x: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Get the real part of a complex number. For a complex number a + bi,
+   * the function returns a. For matrices, the function is evaluated
+   * element wise.
+   * @param x A complex number or array of complex numbers
+   * @returns The real part of x
+   */
+  re(x: MathJsChain<number | Complex>): MathJsChain<number>
+  re<T extends BigNumber | MathCollection>(x: MathJsChain<T>): MathJsChain<T>
+
+  /*************************************************************************
+   * Geometry functions
+   ************************************************************************/
+
+  /**
+   * Calculates: The Euclidean distance between two points in 2 and 3
+   * dimensional spaces. Distance between point and a line in 2 and 3
+   * dimensional spaces. Pairwise distance between a set of 2D or 3D
+   * points NOTE: When substituting coefficients of a line(a, b and c),
+   * use ax + by + c = 0 instead of ax + by = c For parametric equation of
+   * a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b,
+   * c)
+   * @param x Coordinates of the first point
+   * @param y Coordinates of the second point OR coefficients of a line in 3D OR first end-point of a line if the calculation is for distance between point and a line in 2D
+   * @param z Coordinates of second end-point of a line if the calculation is for distance between point and a line in 2D
+   * @returns Returns the distance from two/three points
+   */
+  distance(
+    x: MathCollection | object,
+    y: MathCollection | object,
+    z?: MathCollection | object
+  ): number | BigNumber
+
+  /**
+   * Calculates the point of intersection of two lines in two or three
+   * dimensions and of a line and a plane in three dimensions. The inputs
+   * are in the form of arrays or 1 dimensional matrices. The line
+   * intersection functions return null if the lines do not meet. Note:
+   * Fill the plane coefficients as x + y + z = c and not as x + y + z + c
+   * = 0.
+   * @param w Co-ordinates of first end-point of first line
+   * @param x Co-ordinates of second end-point of first line
+   * @param y Co-ordinates of first end-point of second line OR
+   * Coefficients of the plane's equation
+   * @param z Co-ordinates of second end-point of second line OR null if
+   * the calculation is for line and plane
+   * @returns Returns the point of intersection of lines/lines-planes
+   */
+  intersect(
+    w: MathCollection,
+    x: MathCollection,
+    y: MathCollection,
+    z?: MathCollection
+  ): MathArray
+
+  /*************************************************************************
+   * Logical functions
+   ************************************************************************/
+
+  /**
+   * Logical and. Test whether two values are both defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param x First value to and
+   * @param y Second value to and
+   * @returns Returns true when both inputs are defined with a
+   * nonzero/nonempty value.
+   */
+  and(
+    x: number | BigNumber | bigint | Complex | Unit | MathCollection,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): boolean | MathCollection
+
+  /**
+   * Logical not. Flips boolean value of a given parameter. For matrices,
+   * the function is evaluated element wise.
+   * @param x First value to not
+   * @returns Returns true when input is a zero or empty value.
+   */
+  not(
+    x: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): boolean | MathCollection
+
+  /**
+   * Logical or. Test if at least one value is defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param x First value to or
+   * @param y Second value to or
+   * @returns Returns true when one of the inputs is defined with a
+   * nonzero/nonempty value.
+   */
+  or(
+    x: number | BigNumber | bigint | Complex | Unit | MathCollection,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): boolean | MathCollection
+
+  /**
+   * Logical xor. Test whether one and only one value is defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param x First value to xor
+   * @param y Second value to xor
+   * @returns Returns true when one and only one input is defined with a
+   * nonzero/nonempty value.
+   */
+  xor(
+    x: number | BigNumber | bigint | Complex | Unit | MathCollection,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): boolean | MathCollection
+
+  /*************************************************************************
+   * Matrix functions
+   ************************************************************************/
+
+  /**
+   * Apply a function that maps an array to a scalar along a given axis of a
+   * matrix or array. Returns a new matrix or array with one less dimension
+   * than the input.
+   * @param array The input Matrix
+   * @param dim The dimension along which the callback is applied
+   * @param callback The callback function that is applied. This Function should take an
+   * array or 1-d matrix as an input and return a number.
+   * @returns The residual matrix with the function applied over some dimension.
+   */
+  mapSlices<T extends MathCollection>(
+    array: T,
+    dim: number,
+    callback: (array: MathCollection) => number
+  ): T
+  /**
+   * @deprecated backwards-compatibility old name of mapSlices
+   */
+  apply: MathJsInstance['mapSlices']
+
+  /**
+   * Concatenate two or more matrices. dim: number is a zero-based
+   * dimension over which to concatenate the matrices. By default the last
+   * dimension of the matrices.
+   * @param args Two or more matrices
+   * @returns Concatenated matrix
+   */
+  concat(...args: Array<MathCollection | number | BigNumber>): MathCollection
+
+  /**
+   * Calculate the cross product for two vectors in three dimensional
+   * space. The cross product of A = [a1, a2, a3] and B =[b1, b2, b3] is
+   * defined as: cross(A, B) = [ a2 * b3 - a3 * b2, a3 * b1 - a1 * b3, a1
+   * * b2 - a2 * b1 ]
+   * @param x First vector
+   * @param y Second vector
+   * @returns Returns the cross product of x and y
+   */
+  cross(x: MathCollection, y: MathCollection): MathCollection
+
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is taken.
+   * This is equivalent to complex conjugation for scalars and vectors.
+   * @param x Matrix to be ctransposed
+   */
+  ctranspose(x: MathCollection): MathCollection
+
+  /**
+   * Calculate the determinant of a matrix.
+   * @param x A Matrix
+   * @returns the determinant of x
+   */
+  det(x: MathCollection): number
+
+  /**
+   * Calculate the difference between adjacent elements of a matrix or array.
+   * @param x A matrix or array
+   * @param dim The dimension to apply the difference on.
+   * @returns A matrix or array containing the differences
+   */
+  diff<T extends MathCollection>(x: T, dim?: number | BigNumber): T
+
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix. When x
+   * is a vector, a matrix with vector x on the diagonal will be returned.
+   * When x is a two dimensional matrix, the matrixes kth diagonal will be
+   * returned as vector. When k is positive, the values are placed on the
+   * super diagonal. When k is negative, the values are placed on the sub
+   * diagonal.
+   * @param X A two dimensional matrix or a vector
+   * @param k The diagonal where the vector will be filled in or
+   * retrieved. Default value: 0.
+   * @param format The matrix storage format. Default value: 'dense'.
+   * @returns Diagonal matrix from input vector, or diagonal from input
+   * matrix
+   */
+  diag(X: MathCollection, format?: string): Matrix
+  diag(
+    X: MathCollection,
+    k: number | BigNumber,
+    format?: string
+  ): MathCollection
+
+  /**
+   * Calculate the dot product of two vectors. The dot product of A = [a1,
+   * a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as: dot(A,
+   * B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn
+   * @param x First vector
+   * @param y Second vector
+   * @returns Returns the dot product of x and y
+   */
+  dot(x: MathCollection, y: MathCollection): number
+
+  /**
+   * Compute eigenvalues and eigenvectors of a matrix.
+   * The eigenvalues are sorted by their absolute value, ascending.
+   * An eigenvalue with multiplicity k will be listed k times.
+   * The eigenvectors are returned as an array of objects, each with a
+   * `value` and a `vector`. If the algorithm fails to converge,
+   * it will throw an error – in that case, however, you may still find useful
+   * information in err.values and err.vectors
+   * @param x Matrix to be diagonalized
+   * @param prec Precision, default value: 1e-15
+   * @returns Object containing an array of eigenvalues and a matrix with eigenvectors as columns.
+   */
+  eigs(
+    x: MathCollection,
+    opts?:
+      | number
+      | BigNumber
+      | { precision?: number | BigNumber; eigenvectors?: true }
+  ): {
+    values: MathCollection
+    eigenvectors: {
+      value: number | BigNumber
+      vector: MathCollection
+    }[]
+  }
+  eigs(
+    x: MathCollection,
+    opts: { eigenvectors: false; precision?: number | BigNumber }
+  ): { values: MathCollection }
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be
+   * square. Not to be confused with exp(a), which performs element-wise
+   * exponentiation. The exponential is calculated using the Padé
+   * approximant with scaling and squaring; see “Nineteen Dubious Ways to
+   * Compute the Exponential of a Matrix,” by Moler and Van Loan.
+   * @param x A square matrix
+   * @returns The exponential of x
+   */
+  expm(x: Matrix): Matrix
+
+  /**
+   * Solves the real-valued Sylvester equation AX-XB=C for X, where A, B and C are
+   * matrices of appropriate dimensions, being A and B squared. The method used is
+   * the Bartels-Stewart algorithm.
+   * https://en.wikipedia.org/wiki/Sylvester_equation
+   * @param A  Matrix A
+   * @param B  Matrix B
+   * @param C  Matrix C
+   * @returns  Matrix X, solving the Sylvester equation
+   */
+  sylvester(
+    A: MathCollection,
+    B: MathCollection,
+    C: MathCollection
+  ): MathCollection
+
+  /**
+   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal
+   * and T is upper quasi-triangular.
+   * https://en.wikipedia.org/wiki/Schur_decomposition
+   * @param A  Matrix A
+   * @returns Object containing both matrix U and T of the Schur Decomposition A=UTU'
+   */
+  schur(A: MathCollection): SchurDecomposition
+
+  /**
+   * Solves the Continuous-time Lyapunov equation AP+PA'=Q for P, where Q is a positive semidefinite
+   * matrix.
+   * https://en.wikipedia.org/wiki/Lyapunov_equation
+   * @param A  Matrix A
+   * @param Q  Matrix Q
+   * @returns  Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q
+   */
+  lyap(A: MathCollection, Q: MathCollection): MathCollection
+
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n. The
+   * matrix has ones on the diagonal and zeros elsewhere.
+   * @param size The size for the matrix
+   * @param format The Matrix storage format
+   * @returns A matrix with ones on the diagonal
+   */
+  identity(
+    size: number | number[] | MathCollection,
+    format?: string
+  ): MathCollection | number
+  /**
+   * @param m The x dimension for the matrix
+   * @param n The y dimension for the matrix
+   * @param format The Matrix storage format
+   * @returns A matrix with ones on the diagonal
+   */
+  identity(m: number, n: number, format?: string): MathCollection | number
+
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   * @param x A one dimensional matrix or array to filter
+   * @param test A function or regular expression to test items. All
+   * entries for which test returns true are returned. When test is a
+   * function, it is invoked with three parameters: the value of the
+   * element, the index of the element, and the matrix/array being
+   * traversed. The function must return a boolean.
+   */
+  filter(
+    x: MathCollection | string[],
+    test:
+      | ((
+          // eslint-disable-next-line @typescript-eslint/no-explicit-any
+          value: any,
+          index: number[],
+          matrix: MathCollection | string[]
+        ) => boolean)
+      | RegExp
+  ): MathCollection
+
+  /**
+   * Flatten a multi dimensional matrix into a single dimensional matrix.
+   * @param x Matrix to be flattened
+   * @returns Returns the flattened matrix
+   */
+  flatten<T extends MathCollection>(x: T): T
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given
+   * callback function.
+   * @param x The matrix to iterate on.
+   * @param callback The callback function is invoked with three
+   * parameters: the value of the element, the index of the element, and
+   * the Matrix/array being traversed.
+   */
+  forEach<T extends MathCollection>(
+    x: T,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (value: any, index: number[], matrix: T) => void
+  ): void
+
+  /**
+   * Calculate the inverse of a square matrix.
+   * @param x Matrix to be inverted
+   * @returns The inverse of x
+   */
+  inv<T extends number | Complex | MathCollection>(x: T): NoLiteralType<T>
+
+  /**
+   * Calculate the Kronecker product of two matrices or vectors
+   * @param x First vector
+   * @param y Second vector
+   * @returns Returns the Kronecker product of x and y
+   */
+  kron(x: MathCollection, y: MathCollection): Matrix
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given
+   * callback function.
+   * @param x The matrix to iterate on.
+   * @param callback The callback function is invoked with three
+   * parameters: the value of the element, the index of the element, and
+   * the Matrix/array being traversed.
+   * @returns Transformed map of x
+   */
+  map<T extends MathCollection>(
+    x: T,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (value: any, index: number[], matrix: T) => MathType | string
+  ): T
+
+  /**
+   * Iterate over all elements of multiple matrices/arrays, and executes the given
+   * callback function.
+   * @param x The first matrix to iterate on.
+   * @param args The rest of the matrices and at the end the callback function is invoked with multiple
+   * parameters: the values of the elements, the indices of the elements, and
+   * the matrices/arrays being traversed.
+   * @returns Transformed map of matrices
+   */
+  map<T extends MathCollection>(
+    x: T,
+    ...args: Array<
+      | T
+      | ((
+          // eslint-disable-next-line @typescript-eslint/no-explicit-any
+          value: any,
+          // eslint-disable-next-line @typescript-eslint/no-explicit-any
+          ...args: Array<any | number[] | T>
+        ) => MathType | string)
+    >
+  ): T
+
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   * @param size The size of each dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with ones
+   */
+  ones(
+    size?: number | number[] | BigNumber | BigNumber[],
+    format?: string
+  ): MathCollection
+  /**
+   * @param m The x dimension of the matrix
+   * @param n The y dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with ones
+   */
+  ones(
+    m: number | BigNumber,
+    n: number | BigNumber,
+    format?: string
+  ): MathCollection
+  /**
+   * @param m The x dimension of the matrix
+   * @param n The y dimension of the matrix
+   * @param p The z dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with ones
+   */
+  ones(
+    m: number | BigNumber,
+    n: number | BigNumber,
+    p: number | BigNumber,
+    format?: string
+  ): MathCollection
+  /** Actually ones can take an arbitrary number of dimensions before the
+   ** optional format, not sure how to write that in TypeScript
+   **/
+
+  /**
+   * Partition-based selection of an array or 1D matrix. Will find the kth
+   * smallest value, and mutates the input array. Uses Quickselect.
+   * @param x A one dimensional matrix or array to sort
+   * @param k The kth smallest value to be retrieved; zero-based index
+   * @param compare  An optional comparator function. The function is
+   * called as compare(a, b), and must return 1 when a > b, -1 when a < b,
+   * and 0 when a == b. Default value: 'asc'.
+   * @returns Returns the kth lowest value.
+   */
+  partitionSelect(
+    x: MathCollection,
+    k: number,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    compare?: 'asc' | 'desc' | ((a: any, b: any) => number)
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ): any
+
+  /**
+   * Calculate the Moore–Penrose inverse of a matrix.
+   * @param x Matrix to be inverted
+   * @return The inverse of `x`.
+   */
+  pinv<T extends MathType>(x: T): T
+
+  /**
+   * Create an array from a range. By default, the range end is excluded.
+   * This can be customized by providing an extra parameter includeEnd.
+   * @param str A string 'start:end' or 'start:step:end'
+   * @param start Start of the range
+   * @param end End of the range, excluded by default, included when
+   * parameter includeEnd=true
+   * @param step Step size. Default value is 1.
+   * @param includeEnd: Option to specify whether to include the end or
+   * not. False by default
+   * @returns Parameters describing the ranges start, end, and optional
+   * step.
+   */
+  range(str: string, includeEnd?: boolean): Matrix
+  range(
+    start: number | BigNumber,
+    end: number | BigNumber,
+    includeEnd?: boolean
+  ): Matrix
+  range(
+    start: number | BigNumber | Unit,
+    end: number | BigNumber | Unit,
+    step: number | BigNumber | Unit,
+    includeEnd?: boolean
+  ): Matrix
+
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   * @param x Matrix to be reshaped
+   * @param sizes One dimensional array with integral sizes for each
+   * dimension
+   * @returns A reshaped clone of matrix x
+   */
+  reshape<T extends MathCollection>(x: T, sizes: number[]): T
+
+  /**
+   * Resize a matrix
+   * @param x Matrix to be resized
+   * @param size One dimensional array with numbers
+   * @param defaultValue Zero by default, except in case of a string, in
+   * that case defaultValue = ' ' Default value: 0.
+   * @returns A resized clone of matrix x
+   */
+  resize<T extends MathCollection>(
+    x: T,
+    size: MathCollection,
+    defaultValue?: number | string
+  ): T
+
+  /**
+   * Return a Rotation Matrix for a given angle in radians
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @param {string} [format]                              Result Matrix storage format. Default value: 'dense'.
+   * @return {Matrix}                                      Rotation Matrix
+   */
+  rotationMatrix<T extends MathCollection>(
+    theta?: number | BigNumber | Complex | Unit,
+    axis?: T,
+    format?: 'sparse' | 'dense'
+  ): T
+
+  /**
+   * Return a row from a Matrix.
+   * @param value An array or matrix
+   * @param row The index of the row
+   * @returns The retrieved row
+   */
+  row<T extends MathCollection>(value: T, row: number): T
+
+  /**
+   * Return a column from a Matrix.
+   * @param value An array or matrix
+   * @param column The index of the column
+   * @returns The retrieved column
+   */
+  column<T extends MathCollection>(value: T, column: number): T
+
+  /**
+   * Return a rotated matrix.
+   * @param {Array | Matrix} w                             Vector to rotate
+   * @param {number | BigNumber | Complex | Unit} theta    Rotation angle
+   * @param {Array | Matrix} [v]                           Rotation axis
+   * @return {Array | Matrix}                              Multiplication of the rotation matrix and w
+   */
+  rotate<T extends MathCollection>(
+    w: T,
+    theta: number | BigNumber | Complex | Unit,
+    v?: T
+  ): T
+
+  /**
+   * Calculate the size of a matrix or scalar.
+   * @param A matrix
+   * @returns A vector with the size of x
+   */
+  size(
+    x: boolean | number | Complex | Unit | string | MathCollection
+  ): MathCollection
+
+  /**
+   * Sort the items in a matrix
+   * @param x A one dimensional matrix or array to sort
+   * @param compare An optional _comparator function or name. The function
+   * is called as compare(a, b), and must return 1 when a > b, -1 when a <
+   * b, and 0 when a == b. Default value: ‘asc’
+   * @returns Returns the sorted matrix
+   */
+  sort<T extends MathCollection>(
+    x: T,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    compare: ((a: any, b: any) => number) | 'asc' | 'desc' | 'natural'
+  ): T
+
+  /**
+   * Calculate the principal square root of a square matrix. The principal
+   * square root matrix X of another matrix A is such that X * X = A.
+   * @param A The square matrix A
+   * @returns The principal square root of matrix A
+   */
+  sqrtm<T extends MathCollection>(A: T): T
+
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a
+   * matrix.
+   * @param x Matrix to be squeezed
+   * @returns Squeezed matrix
+   */
+  squeeze<T extends MathCollection>(x: T): T
+
+  /**
+   * Get or set a subset of a matrix or string.
+   * @param value An array, matrix, or string
+   * @param index For each dimension, an index or list of indices to get or set.
+   * @param replacement An array, matrix, or scalar. If provided, the
+   * subset is replaced with replacement. If not provided, the subset is
+   * returned
+   * @param defaultValue Default value, filled in on new entries when the
+   * matrix is resized. If not provided, math.matrix elements will be left
+   * undefined. Default value: undefined.
+   * @returns Either the retrieved subset or the updated matrix
+   */
+  subset<T extends MathCollection | string>(
+    value: T,
+    index: Index,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    replacement?: any,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    defaultValue?: any
+  ): T
+
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   * @param x A matrix
+   * @returns The trace of x
+   */
+  trace(x: MathCollection): number
+
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only two dimensional matrices are supported.
+   * @param x Matrix to be transposed
+   * @returns The transposed matrix
+   */
+  transpose<T extends MathCollection>(x: T): T
+
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   * @param size The size of each dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with zeros
+   */
+  zeros(
+    size?: number | number[] | BigNumber | BigNumber[],
+    format?: string
+  ): MathCollection
+  /**
+   * @param m The x dimension of the matrix
+   * @param n The y dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with zeros
+   */
+  zeros(
+    m: number | BigNumber,
+    n: number | BigNumber,
+    format?: string
+  ): MathCollection
+  /**
+   * @param m The x dimension of the matrix
+   * @param n The y dimension of the matrix
+   * @param p The z dimension of the matrix
+   * @param format The matrix storage format
+   * @returns A matrix filled with zeros
+   */
+  zeros(
+    m: number | BigNumber,
+    n: number | BigNumber,
+    p: number | BigNumber,
+    format?: string
+  ): MathCollection
+  /** Actually zeros can take any number of dimensions before the
+   ** optional format, not sure how to write that in TypeScript
+   **/
+
+  /**
+   * Calculate N-dimensional Fourier transform
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  fft<T extends MathCollection>(arr: T): T
+
+  /**
+   * Calculate N-dimensional inverse Fourier transform
+   * @param {Array | Matrix} arr    An array or matrix
+   * @return {Array | Matrix}       N-dimensional Fourier transformation of the array
+   */
+  ifft<T extends MathCollection>(arr: T): T
+
+  /*************************************************************************
+   * Probability functions
+   ************************************************************************/
+
+  /**
+   * Compute the number of ways of picking k unordered outcomes from n
+   * possibilities. Combinations only takes integer arguments. The
+   * following condition must be enforced: k <= n.
+   * @param n Total number of objects in the set
+   * @param k Number of objects in the subset
+   * @returns Number of possible combinations
+   */
+  combinations<T extends number | BigNumber>(
+    n: T,
+    k: number | BigNumber
+  ): NoLiteralType<T>
+
+  /**
+   * Compute the factorial of a value Factorial only supports an integer
+   * value as argument. For matrices, the function is evaluated element
+   * wise.
+   * @param n An integer number
+   * @returns The factorial of n
+   */
+  factorial<T extends number | BigNumber | MathCollection>(
+    n: T
+  ): NoLiteralType<T>
+
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large
+   * values.
+   * @param n A real or complex number
+   * @returns The gamma of n
+   */
+  gamma<T extends number | BigNumber | Complex>(n: T): NoLiteralType<T>
+
+  /**
+   * Calculate the Kullback-Leibler (KL) divergence between two
+   * distributions
+   * @param q First vector
+   * @param p Second vector
+   * @returns Returns distance between q and p
+   */
+  kldivergence(q: MathCollection, p: MathCollection): number
+
+  /**
+   * Compute the log gamma function of a value, using Lanczos approximation for numbers and Stirling series for complex numbers.
+   * @param n A real or complex number
+   * @returns The log gamma of `n`
+   */
+  lgamma<T extends number | Complex>(n: T): NoLiteralType<T>
+
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1,
+   * a2, ..., ai unordered outcomes from n possibilities. multinomial
+   * takes one array of integers as an argument. The following condition
+   * must be enforced: every ai <= 0
+   * @param a Integer number of objects in the subset
+   * @returns multinomial coefficient
+   */
+  multinomial<T extends number | BigNumber>(a: T[]): NoLiteralType<T>
+
+  /**
+   * Compute the number of ways of obtaining an ordered subset of k
+   * elements from a set of n elements. Permutations only takes integer
+   * arguments. The following condition must be enforced: k <= n.
+   * @param n The number of objects in total
+   * @param k The number of objects in the subset
+   * @returns The number of permutations
+   */
+  permutations<T extends number | BigNumber>(
+    n: T,
+    k?: number | BigNumber
+  ): NoLiteralType<T>
+
+  /**
+   * Random pick a value from a one dimensional array. Array element is
+   * picked using a random function with uniform distribution.
+   * @param array A one dimensional array
+   * @param number An int or float
+   * @param weights An array of ints or floats
+   * @returns Returns a single random value from array when number is undefined.
+   * Returns an array with the configured number of elements when number is defined.
+   */
+  pickRandom<T>(array: T[]): T
+  pickRandom<T>(array: T[], number: number): T[]
+  pickRandom<T>(array: T[], number: number, weights: number[]): T[]
+
+  /**
+   * Return a random number larger or equal to min and smaller than max
+   * using a uniform distribution.
+   * @param size If provided, an array or matrix with given size and
+   * filled with random values is returned
+   * @param min Minimum boundary for the random value, included
+   * @param max Maximum boundary for the random value, excluded
+   * @returns A random number
+   */
+  random(min?: number, max?: number): number
+  random<T extends MathCollection>(size: T, min?: number, max?: number): T
+
+  /**
+   * Return a random integer number larger or equal to min and smaller
+   * than max using a uniform distribution.
+   * @param size If provided, an array or matrix with given size and
+   * filled with random values is returned
+   * @param min Minimum boundary for the random value, included
+   * @param max Maximum boundary for the random value, excluded
+   * @returns A random number
+   */
+  randomInt(min: number, max?: number): number
+  randomInt<T extends MathCollection>(size: T, min?: number, max?: number): T
+
+  /*************************************************************************
+   * Relational functions
+   ************************************************************************/
+
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x
+   * == y. x and y are considered equal when the relative difference
+   * between x and y is smaller than the configured relTol and absTol. The function
+   * cannot be used to compare values smaller than approximately 2.22e-16.
+   * For matrices, the function is evaluated element wise.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns the result of the comparison: 1 when x > y, -1 when
+   * x < y, and 0 when x == y.
+   */
+  compare(
+    x: MathType | string,
+    y: MathType | string
+  ): number | BigNumber | Fraction | MathCollection
+
+  /**
+   * Compare two values of any type in a deterministic, natural way. For
+   * numeric values, the function works the same as math.compare. For
+   * types of values that can’t be compared mathematically, the function
+   * compares in a natural way.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns the result of the comparison: 1 when x > y, -1 when
+   * x < y, and 0 when x == y.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  compareNatural(x: any, y: any): number
+
+  /**
+   * Compare two strings lexically. Comparison is case sensitive. Returns
+   * 1 when x > y, -1 when x < y, and 0 when x == y. For matrices, the
+   * function is evaluated element wise.
+   * @param x First string to compare
+   * @param y Second string to compare
+   * @returns Returns the result of the comparison: 1 when x > y, -1 when
+   * x < y, and 0 when x == y.
+   */
+  compareText(
+    x: string | MathCollection,
+    y: string | MathCollection
+  ): number | MathCollection
+
+  /**
+   * Test element wise whether two matrices are equal. The function
+   * accepts both matrices and scalar values.
+   * @param x First matrix to compare
+   * @param y Second matrix to compare
+   * @returns Returns true when the input matrices have the same size and
+   * each of their elements is equal.
+   */
+  deepEqual(x: MathType, y: MathType): MathType
+
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16. For matrices, the
+   * function is evaluated element wise. In case of complex numbers, x.re
+   * must equal y.re, and x.im must equal y.im. Values null and undefined
+   * are compared strictly, thus null is only equal to null and nothing
+   * else, and undefined is only equal to undefined and nothing else.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when the compared values are equal, else
+   * returns false
+   */
+  equal(x: MathType | string, y: MathType | string): boolean | MathCollection
+
+  /**
+   * Check equality of two strings. Comparison is case sensitive. For
+   * matrices, the function is evaluated element wise.
+   * @param x First string to compare
+   * @param y Second string to compare
+   * @returns Returns true if the values are equal, and false if not.
+   */
+  equalText(
+    x: string | MathCollection,
+    y: string | MathCollection
+  ): number | MathCollection
+
+  /**
+   * Test whether value x is larger than y. The function returns true when
+   * x is larger than y and the relative difference between x and y is
+   * larger than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16. For matrices, the
+   * function is evaluated element wise.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when x is larger than y, else returns false
+   */
+  larger(x: MathType | string, y: MathType | string): boolean | MathCollection
+
+  /**
+   * Test whether value x is larger or equal to y. The function returns
+   * true when x is larger than y or the relative difference between x and
+   * y is smaller than the configured relTol and absTol. The function cannot be used
+   * to compare values smaller than approximately 2.22e-16. For matrices,
+   * the function is evaluated element wise.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when x is larger than or equal to y, else
+   * returns false
+   */
+  largerEq(x: MathType | string, y: MathType | string): boolean | MathCollection
+
+  /**
+   * Test whether value x is smaller than y. The function returns true
+   * when x is smaller than y and the relative difference between x and y
+   * is smaller than the configured relTol and absTol. The function cannot be used
+   * to compare values smaller than approximately 2.22e-16. For matrices,
+   * the function is evaluated element wise.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when x is smaller than y, else returns false
+   */
+  smaller(x: MathType | string, y: MathType | string): boolean | MathCollection
+
+  /**
+   * Test whether value x is smaller or equal to y. The function returns
+   * true when x is smaller than y or the relative difference between x
+   * and y is smaller than the configured relTol and absTol. The function cannot be
+   * used to compare values smaller than approximately 2.22e-16. For
+   * matrices, the function is evaluated element wise.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when x is smaller than or equal to y, else
+   * returns false
+   */
+  smallerEq(
+    x: MathType | string,
+    y: MathType | string
+  ): boolean | MathCollection
+
+  /**
+   * Determines if two expressions are symbolically equal, i.e. one is the
+   * result of valid algebraic manipulations on the other.
+   * @param {Node} expr1 The first expression to compare
+   * @param {Node} expr2 The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean} Returns true if a valid manipulation making the
+   * expressions equal is found.
+   */
+  symbolicEqual(
+    expr1: MathNode,
+    expr2: MathNode,
+    options?: SimplifyOptions
+  ): boolean
+
+  /**
+   * Test whether two values are unequal. The function tests whether the
+   * relative difference between x and y is larger than the configured
+   * relTol and absTol. The function cannot be used to compare values smaller than
+   * approximately 2.22e-16. For matrices, the function is evaluated
+   * element wise. In case of complex numbers, x.re must unequal y.re, or
+   * x.im must unequal y.im. Values null and undefined are compared
+   * strictly, thus null is unequal with everything except null, and
+   * undefined is unequal with everything except undefined.
+   * @param x First value to compare
+   * @param y Second value to compare
+   * @returns Returns true when the compared values are unequal, else
+   * returns false
+   */
+  unequal(x: MathType | string, y: MathType | string): boolean | MathCollection
+
+  /*************************************************************************
+   * Set functions
+   ************************************************************************/
+
+  /**
+   * Create the cartesian product of two (multi)sets. Multi-dimension
+   * arrays will be converted to single-dimension arrays and the values
+   * will be sorted in ascending order before the operation.
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns The cartesian product of two (multi)sets
+   */
+  setCartesian<T extends MathCollection>(a1: T, a2: MathCollection): T
+
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that
+   * is not the element of set2. Multi-dimension arrays will be converted
+   * to single-dimension arrays before the operation
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns The difference of two (multi)sets
+   */
+  setDifference<T extends MathCollection>(a1: T, a2: MathCollection): T
+
+  /**
+   * Collect the distinct elements of a multiset. A multi-dimension array
+   * will be converted to a single-dimension array before the operation.
+   * @param a A multiset
+   * @returns A set containing the distinct elements of the multiset
+   */
+  setDistinct<T extends MathCollection>(a: T): T
+
+  /**
+   * Create the intersection of two (multi)sets. Multi-dimension arrays
+   * will be converted to single-dimension arrays before the operation.
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns The intersection of two (multi)sets
+   */
+  setIntersect<T extends MathCollection>(a1: T, a2: MathCollection): T
+
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every
+   * element of set1 is the element of set2.) Multi-dimension arrays will
+   * be converted to single-dimension arrays before the operation.
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns True if a1 is subset of a2, else false
+   */
+  setIsSubset(a1: MathCollection, a2: MathCollection): boolean
+
+  /**
+   * Count the multiplicity of an element in a multiset. A multi-dimension
+   * array will be converted to a single-dimension array before the
+   * operation.
+   * @param e An element in the multiset
+   * @param a A multiset
+   * @returns The number of how many times the multiset contains the
+   * element
+   */
+  setMultiplicity(e: MathNumericType, a: MathCollection): number
+
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very
+   * possible subsets of a (multi)set.) A multi-dimension array will be
+   * converted to a single-dimension array before the operation.
+   * @param a A multiset
+   * @returns The powerset of the (multi)set
+   */
+  setPowerset<T extends MathCollection>(a: T): T
+
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter
+   * is ‘true’, count only the unique values. A multi-dimension array will
+   * be converted to a single-dimension array before the operation.
+   * @param a A multiset
+   * @returns The number of elements of the (multi)set
+   */
+  setSize(a: MathCollection): number
+
+  /**
+   * Create the symmetric difference of two (multi)sets. Multi-dimension
+   * arrays will be converted to single-dimension arrays before the
+   * operation.
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns The symmetric difference of two (multi)sets
+   */
+  setSymDifference<T extends MathCollection>(a1: T, a2: MathCollection): T
+
+  /**
+   * Create the union of two (multi)sets. Multi-dimension arrays will be
+   * converted to single-dimension arrays before the operation.
+   * @param a1 A (multi)set
+   * @param a2 A (multi)set
+   * @returns The union of two (multi)sets
+   */
+  setUnion<T extends MathCollection>(a1: T, a2: MathCollection): T
+
+  /*************************************************************************
+   * Signal functions
+   ************************************************************************/
+  /**
+   * Compute the transfer function of a zero-pole-gain model.
+   * @param z Zeroes of the model
+   * @param p Poles of the model
+   * @param k Gain of the model
+   * @returns The transfer function as array of numerator and denominator
+   */
+  zpk2tf<T extends MathCollection>(z: T, p: T, k?: number): T
+
+  /**
+   * Calculates the frequency response of a filter given its numerator and denominator coefficients.
+   * @param b The numerator polynomial of the filter
+   * @param a The denominator polynomial of the filter
+   * @param w The range of frequencies in which the response is to be calculated
+   * @returns The frequency response
+   *
+   */
+  freqz<T extends MathCollection>(b: T, a: T, w?: number | T): { w: T; h: T }
+
+  /*************************************************************************
+   * Special functions
+   ************************************************************************/
+
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   * @param x A real number
+   * @returns The erf of x
+   */
+  erf<T extends number | MathCollection>(x: T): NoLiteralType<T>
+
+  /**
+   * Compute the Riemann Zeta function of a value using an infinite series
+   * and Riemann's Functional equation.
+   * @param s A real, complex or BigNumber
+   * @returns The Riemann Zeta of s
+   */
+  zeta<T extends number | Complex | BigNumber>(s: T): T
+
+  /*************************************************************************
+   * Statistics functions
+   ************************************************************************/
+
+  /**
+   * Compute the median absolute deviation of a matrix or a list with
+   * values. The median absolute deviation is defined as the median of the
+   * absolute deviations from the median.
+   * @param array A single matrix or multiple scalar values.
+   * @returns The median absolute deviation
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  mad(array: MathCollection): any
+
+  /**
+   * Compute the maximum value of a matrix or a list with values. In case
+   * of a multi dimensional array, the maximum of the flattened array will
+   * be calculated. When dim is provided, the maximum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param args Multiple scalar values
+   * @returns The maximum value
+   */
+  max<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The maximum value
+   */
+  max(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @param dimension The maximum over the selected dimension
+   * @returns The maximum value
+   */
+  max<T extends MathScalarType>(
+    A: T[] | T[][],
+    dimension?: number | BigNumber
+  ): T
+  /**
+   * @param A A single matrix
+   * @param dimension The maximum over the selected dimension
+   * @returns The maximum value
+   */
+  max(A: MathCollection, dimension?: number | BigNumber): MathScalarType
+
+  /**
+   * Compute the mean value of matrix or a list with values. In case of a
+   * multi dimensional array, the mean of the flattened array will be
+   * calculated. When dim is provided, the maximum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param args Multiple scalar values
+   * @returns The mean of all values
+   */
+  mean<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The mean value
+   */
+  mean(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @param dimension The mean over the selected dimension
+   * @returns The mean value
+   */
+  mean<T extends MathScalarType>(
+    A: T[] | T[][],
+    dimension?: number | BigNumber
+  ): T
+  /**
+   * @param A A single matrix
+   * @param dimension The mean over the selected dimension
+   * @returns The mean value
+   */
+  mean(A: MathCollection, dimension?: number | BigNumber): MathScalarType
+
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned. Supported
+   * types of values are: Number, BigNumber, Unit In case of a (multi
+   * dimensional) array or matrix, the median of all elements will be
+   * calculated.
+   * @param args Multiple scalar values
+   * @returns The median value
+   */
+  median<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The median value
+   */
+  median(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @returns The median value
+   */
+  median<T extends MathScalarType>(A: T[] | T[][]): T
+  /**
+   * @param A A single matrix
+   * @returns The median value
+   */
+  median(A: MathCollection): MathScalarType
+
+  /**
+   * Compute the minimum value of a matrix or a list of values. In case of
+   * a multi dimensional array, the minimum of the flattened array will be
+   * calculated. When dim is provided, the minimum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param args multiple scalar values
+   * @returns The minimum value
+   */
+  min<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The minimum value
+   */
+  min(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @param dimension The minimum over the selected dimension
+   * @returns The minimum value
+   */
+  min<T extends MathScalarType>(
+    A: T[] | T[][],
+    dimension?: number | BigNumber
+  ): T
+  /**
+   * @param A A single matrix
+   * @param dimension The minimum over the selected dimension
+   * @returns The minimum value
+   */
+  min(A: MathCollection, dimension?: number | BigNumber): MathScalarType
+
+  /**
+   * Computes the mode of a set of numbers or a list with values(numbers
+   * or characters). If there are more than one modes, it returns a list
+   * of those values.
+   * @param args Multiple scalar values
+   * @returns The mode of all values
+   */
+  mode<T extends MathScalarType>(...args: T[]): T[]
+  /**
+   * @param args Multiple scalar values
+   * @returns The mode of all values
+   */
+  mode(...args: MathScalarType[]): MathScalarType[]
+  /**
+   * @param A A single matrix
+   * @returns The mode value
+   */
+  mode<T extends MathScalarType>(A: T[] | T[][]): T[]
+  /**
+   * @param A A single matrix
+   * @returns The mode of all values
+   */
+  mode(A: MathCollection): MathScalarType[]
+
+  /**
+   * Compute the product of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the sum of all elements will be
+   * calculated.
+   * @param args Multiple scalar values
+   * @returns The product of all values
+   */
+  prod<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The product of all values
+   */
+  prod(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @returns The product of all values
+   */
+  prod<T extends MathScalarType>(A: T[] | T[][]): T
+  /**
+   * @param A A single matrix
+   * @returns The product of all values
+   */
+  prod(A: MathCollection): MathScalarType
+
+  /**
+   * @param A A single matrix
+   * @param probOrN prob is the order of the quantile, while N is the
+   * amount of evenly distributed steps of probabilities; only one of
+   * these options can be provided
+   * @param sorted =false is data sorted in ascending order
+   * @returns Quantile(s)
+   */
+  quantileSeq<T extends MathScalarType>(
+    A: T[] | T[][],
+    prob: number | BigNumber,
+    sorted?: boolean
+  ): T
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned. Supported
+   * types of sequence values are: Number, BigNumber, Unit Supported types
+   * of probability are: Number, BigNumber In case of a (multi
+   * dimensional) array or matrix, the prob order quantile of all elements
+   * will be calculated.
+   * @param A A single matrix or array
+   * @param probOrN prob is the order of the quantile, while N is the
+   * amount of evenly distributed steps of probabilities; only one of
+   * these options can be provided
+   * @param sorted =false is data sorted in ascending order
+   * @returns Quantile(s)
+   */
+  quantileSeq(
+    A: MathCollection,
+    prob: number | BigNumber | MathArray,
+    sorted?: boolean
+  ): MathScalarType | MathArray
+
+  /**
+   * Compute the standard deviation of a matrix or a list with values. The
+   * standard deviations is defined as the square root of the variance:
+   * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+   * matrix, the standard deviation over all elements will be calculated.
+   * Optionally, the type of normalization can be specified as second
+   * parameter. The parameter normalization can be one of the following
+   * values: 'unbiased' (default) The sum of squared errors is divided by
+   * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+   * 'biased' The sum of squared errors is divided by (n + 1)
+   * @param args variadic argument of number to calculate standard deviation
+   * @returns The standard deviation
+   */
+  std<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The standard deviation
+   */
+  std(...args: MathScalarType[]): MathScalarType
+  /**
+   * Compute the standard deviation of a matrix or a list with values. The
+   * standard deviations is defined as the square root of the variance:
+   * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+   * matrix, the standard deviation over all elements will be calculated.
+   * Optionally, the type of normalization can be specified as second
+   * parameter. The parameter normalization can be one of the following
+   * values: 'unbiased' (default) The sum of squared errors is divided by
+   * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+   * 'biased' The sum of squared errors is divided by (n + 1)
+   * @param array A single matrix to compute standard deviation.
+   * @param dimension A dimension to calculate standard deviation
+   * @param normalization Determines how to normalize the variance. Choose
+   * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+   * ‘unbiased’.
+   * @returns The standard deviation array
+   */
+  std(
+    array: MathCollection,
+    dimension?: number,
+    normalization?: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathNumericType[]
+  /**
+   * Compute the standard deviation of a matrix or a list with values. The
+   * standard deviations is defined as the square root of the variance:
+   * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+   * matrix, the standard deviation over all elements will be calculated.
+   * Optionally, the type of normalization can be specified as second
+   * parameter. The parameter normalization can be one of the following
+   * values: 'unbiased' (default) The sum of squared errors is divided by
+   * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+   * 'biased' The sum of squared errors is divided by (n + 1)
+   * @param array A single matrix or multiple scalar values
+   * @param normalization Determines how to normalize the variance. Choose
+   * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+   * ‘unbiased’.
+   * @returns The standard deviation
+   */
+  std(
+    array: MathCollection,
+    normalization: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathNumericType
+
+  /**
+   * Compute the sum of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the sum of all elements will be
+   * calculated.
+   * @param args A single matrix or multiple scalar values
+   * @returns The sum of all values
+   */
+  sum<T extends MathScalarType>(...args: T[]): T
+  /**
+   * @param args Multiple scalar values
+   * @returns The sum of all values
+   */
+  sum(...args: MathScalarType[]): MathScalarType
+  /**
+   * @param A A single matrix
+   * @param dimension The sum over the selected dimension
+   * @returns The sum of all values
+   */
+  sum<T extends MathScalarType>(
+    A: T[] | T[][],
+    dimension?: number | BigNumber
+  ): T
+  /**
+   * @param A A single matrix
+   * @param dimension The sum over the selected dimension
+   * @returns The sum of all values
+   */
+  sum(A: MathCollection, dimension?: number | BigNumber): MathScalarType
+
+  /**
+   * Count the number of elements of a matrix, array or string.
+   * @param x A matrix, array or string.
+   * @returns The number of members passed in parameters
+   */
+  count(x: MathCollection | string): number
+
+  /**
+   * Compute the cumulative sum of a matrix or a list with values.
+   * In case of a (multi dimensional) array or matrix, the cumulative sums
+   * along a specified dimension (defaulting to the first) will be calculated.
+   * @param args A single matrix or multiple scalar values
+   * @returns The cumulative sums of the the values.
+   */
+  cumsum(...args: MathType[]): MathType[]
+  /**
+   * @param array A single matrix
+   * @param dim The dimension along which to sum (defaults to 0)
+   * @returns The cumulative sums along the given dimension
+   */
+  cumsum(array: MathCollection, dim?: number): MathCollection
+
+  /**
+   * Compute the variance of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the variance over all elements
+   * will be calculated. Optionally, the type of normalization can be
+   * specified as second parameter. The parameter normalization can be one
+   * of the following values: 'unbiased' (default) The sum of squared
+   * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+   * is divided by n 'biased' The sum of squared errors is divided by (n +
+   * 1) Note that older browser may not like the variable name var. In
+   * that case, the function can be called as math['var'](...) instead of
+   * math.variance(...).
+   * @param args A single matrix or multiple scalar values
+   * @returns The variance
+   */
+  variance(...args: MathNumericType[]): MathNumericType
+  /**
+   * Compute the variance of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the variance over all elements
+   * will be calculated. Optionally, the type of normalization can be
+   * specified as second parameter. The parameter normalization can be one
+   * of the following values: 'unbiased' (default) The sum of squared
+   * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+   * is divided by n 'biased' The sum of squared errors is divided by (n +
+   * 1) Note that older browser may not like the variable name var. In
+   * that case, the function can be called as math['var'](...) instead of
+   * math.variance(...).
+   * @param array A matrix to compute variance.
+   * @param dimension A dimension to compute variance on
+   * @param normalization normalization Determines how to normalize the
+   * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+   * Default value: ‘unbiased’.
+   * @returns variance matrix.
+   */
+  variance(
+    array: MathCollection,
+    dimension?: number,
+    normalization?: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathNumericType[]
+  /**
+   * @param array A single matrix
+   * @param normalization normalization Determines how to normalize the
+   * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+   * Default value: ‘unbiased’.
+   * @returns The variance
+   */
+  variance(
+    array: MathCollection,
+    normalization: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathNumericType
+
+  /**
+   * Calculate the correlation coefficient between two matrix.
+   * @param {Array | Matrix} x The first array or matrix to compute correlation coefficient
+   * @param {Array | Matrix} y The second array or matrix to compute correlation coefficient
+   * @returns correlation coefficient
+   */
+  corr(x: MathCollection, y: MathCollection): MathType
+
+  /*************************************************************************
+   * String functions
+   ************************************************************************/
+
+  /**
+   * Format a value of any type into a string.
+   * @param value The value to be formatted
+   * @param options An object with formatting options.
+   * @param callback A custom formatting function, invoked for all numeric
+   * elements in value, for example all elements of a matrix, or the real
+   * and imaginary parts of a complex number. This callback can be used to
+   * override the built-in numeric notation with any type of formatting.
+   * Function callback is called with value as parameter and must return a
+   * string.
+   * @see http://mathjs.org/docs/reference/functions/format.html
+   * @returns The formatted value
+   */
+  format(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    value: any,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    options?: FormatOptions | number | BigNumber | ((item: any) => string),
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback?: (value: any) => string
+  ): string
+
+  /**
+   * Interpolate values into a string template.
+   * @param template A string containing variable placeholders.
+   * @param values An object containing variables which will be filled in
+   * in the template.
+   * @param precision Number of digits to format numbers. If not provided,
+   * the value will not be rounded.
+   * @param options Formatting options, or the number of digits to format
+   * numbers. See function math.format for a description of all options.
+   * @returns Interpolated string
+   */
+  print(
+    template: string,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    values: any,
+    precision?: number,
+    options?: number | object
+  ): void
+
+  /*************************************************************************
+   * Trigonometry functions
+   ************************************************************************/
+
+  /**
+   * Calculate the inverse cosine of a value.
+   * @param x Function input
+   * @returns The arc cosine of x
+   */
+  acos(x: number): number | Complex
+  acos<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic arccos of a value, defined as acosh(x) =
+   * ln(sqrt(x^2 - 1) + x).
+   * @param x Function input
+   * @returns The hyperbolic arccosine of x
+   */
+  acosh(x: number): number | Complex
+  acosh<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse cotangent of a value.
+   * @param x Function input
+   * @returns The arc cotangent of x
+   */
+  acot(x: number): number
+  acot<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse hyperbolic tangent of a value, defined as acoth(x)
+   * = (ln((x+1)/x) + ln(x/(x-1))) / 2.
+   * @param x Function input
+   * @returns The inverse hyperbolic tangent of x
+   */
+  acoth(x: number): number
+  acoth<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse cosecant of a value.
+   * @param x Function input
+   * @returns The arc cosecant of x
+   */
+  acsc(x: number): number | Complex
+  acsc<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse hyperbolic cosecant of a value, defined as acsch(x)
+   * = ln(1/x + sqrt(1/x^2 + 1)).
+   * @param x Function input
+   * @returns The inverse hyperbolic cosecant of x
+   */
+  acsch(x: number): number
+  acsch<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse secant of a value.
+   * @param x Function input
+   * @returns The arc secant of x
+   */
+  asec(x: number): number | Complex
+  asec<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic arcsecant of a value, defined as asech(x) =
+   * ln(sqrt(1/x^2 - 1) + 1/x).
+   * @param x Function input
+   * @returns The hyperbolic arcsecant of x
+   */
+  asech(x: number): number | Complex
+  asech<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse sine of a value.
+   * @param x Function input
+   * @returns The arc sine of x
+   */
+  asin(x: number): number | Complex
+  asin<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic arcsine of a value, defined as asinh(x) =
+   * ln(x + sqrt(x^2 + 1)).
+   * @param x Function input
+   * @returns The hyperbolic arcsine of x
+   */
+  asinh<T extends number | BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse tangent of a value.
+   * @param x Function input
+   * @returns The arc tangent of x
+   */
+  atan<T extends number | BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x. By
+   * providing two arguments, the right quadrant of the computed angle can
+   * be determined. For matrices, the function is evaluated element wise.
+   * @param x Function input
+   * @returns Four quadrant inverse tangent
+   */
+  atan2<T extends number | MathCollection>(y: T, x: T): T
+
+  /**
+   * Calculate the hyperbolic arctangent of a value, defined as atanh(x) =
+   * ln((1 + x)/(1 - x)) / 2.
+   * @param x Function input
+   * @returns The hyperbolic arctangent of x
+   */
+  atanh(x: number): number | Complex
+  atanh<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the cosine of a value.
+   * @param x Function input
+   * @returns The cosine of x
+   */
+  cos(x: number | Unit): number
+  cos<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic cosine of a value, defined as cosh(x) = 1/2
+   * * (exp(x) + exp(-x)).
+   * @param x Function input
+   * @returns The hyperbolic cosine of x
+   */
+  cosh(x: number | Unit): number
+  cosh<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the cotangent of a value. cot(x) is defined as 1 / tan(x).
+   * @param x Function input
+   * @returns The cotangent of x
+   */
+  cot(x: number | Unit): number
+  cot<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic cotangent of a value, defined as coth(x) = 1
+   * / tanh(x).
+   * @param x Function input
+   * @returns The hyperbolic cotangent of x
+   */
+  coth(x: number | Unit): number
+  coth<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the cosecant of a value, defined as csc(x) = 1/sin(x).
+   * @param x Function input
+   * @returns The cosecant hof x
+   */
+  csc(x: number | Unit): number
+  csc<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic cosecant of a value, defined as csch(x) = 1
+   * / sinh(x).
+   * @param x Function input
+   * @returns The hyperbolic cosecant of x
+   */
+  csch(x: number | Unit): number
+  csch<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the secant of a value, defined as sec(x) = 1/cos(x).
+   * @param x Function input
+   * @returns The secant of x
+   */
+  sec(x: number | Unit): number
+  sec<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic secant of a value, defined as sech(x) = 1 /
+   * cosh(x).
+   * @param x Function input
+   * @returns The hyperbolic secant of x
+   */
+  sech(x: number | Unit): number
+  sech<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the sine of a value.
+   * @param x Function input
+   * @returns The sine of x
+   */
+  sin(x: number | Unit): number
+  sin<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic sine of a value, defined as sinh(x) = 1/2 *
+   * (exp(x) - exp(-x)).
+   * @param x Function input
+   * @returns The hyperbolic sine of x
+   */
+  sinh(x: number | Unit): number
+  sinh<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the tangent of a value. tan(x) is equal to sin(x) / cos(x).
+   * @param x Function input
+   * @returns The tangent of x
+   */
+  tan(x: number | Unit): number
+  tan<T extends BigNumber | Complex>(x: T): T
+
+  /**
+   * Calculate the hyperbolic tangent of a value, defined as tanh(x) =
+   * (exp(2 * x) - 1) / (exp(2 * x) + 1).
+   * @param x Function input
+   * @returns The hyperbolic tangent of x
+   */
+  tanh(x: number | Unit): number
+  tanh<T extends BigNumber | Complex>(x: T): T
+
+  /*************************************************************************
+   * Unit functions
+   ************************************************************************/
+
+  /**
+   * Change the unit of a value. For matrices, the function is evaluated
+   * element wise.
+   * @param x The unit to be converted.
+   * @param unit New unit. Can be a string like "cm" or a unit without
+   * value.
+   * @returns Value with changed, fixed unit
+   */
+  to(x: Unit | MathCollection, unit: Unit | string): Unit | MathCollection
+
+  /**
+   * Converts a unit to the most appropriate display unit.
+   * When no preferred units are provided, the function automatically find the best prefix.
+   * When preferred units are provided, it converts to
+   * the unit that gives a value closest to 1.
+   * @param preferredUnits - Optional preferred target units
+   * @param options - Optional options object
+   * @returns Unit with optimized prefix/unit
+   */
+  toBest(): Unit
+  toBest(units: string[] | Unit[], options: object): Unit
+
+  /*************************************************************************
+   * Utils
+   ************************************************************************/
+  isNumber(x: unknown): x is number
+
+  isBigNumber(x: unknown): x is BigNumber
+
+  isBigInt(x: unknown): x is bigint
+
+  isComplex(x: unknown): x is Complex
+
+  isFraction(x: unknown): x is Fraction
+
+  isUnit(x: unknown): x is Unit
+
+  isString(x: unknown): x is string
+
+  isArray: ArrayConstructor['isArray']
+
+  isMatrix(x: unknown): x is Matrix
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  isCollection(x: unknown): x is Matrix | any[]
+
+  isDenseMatrix(x: unknown): x is Matrix
+
+  isSparseMatrix(x: unknown): x is Matrix
+
+  isRange(x: unknown): boolean
+
+  isIndex(x: unknown): x is Index
+
+  isBoolean(x: unknown): x is boolean
+
+  isResultSet(x: unknown): x is ResultSet
+
+  isHelp(x: unknown): x is Help
+
+  isFunction(x: unknown): boolean
+
+  isDate(x: unknown): x is Date
+
+  isRegExp(x: unknown): x is RegExp
+
+  isObject(x: unknown): boolean
+
+  isMap<T, U>(x: unknown): x is Map<T, U>
+
+  isPartitionedMap<T, U>(x: unknown): x is PartitionedMap<T, U>
+
+  isObjectWrappingMap<T extends string | number | symbol, U>(
+    x: unknown
+  ): x is ObjectWrappingMap<T, U>
+
+  isNull(x: unknown): x is null
+
+  isUndefined(x: unknown): x is undefined
+
+  isAccessorNode(x: unknown): x is AccessorNode
+
+  isArrayNode(x: unknown): x is ArrayNode
+
+  isAssignmentNode(x: unknown): x is AssignmentNode
+
+  isBlockNode(x: unknown): x is BlockNode
+
+  isConditionalNode(x: unknown): x is ConditionalNode
+
+  isConstantNode(x: unknown): x is ConstantNode
+
+  isFunctionAssignmentNode(x: unknown): x is FunctionAssignmentNode
+
+  isFunctionNode(x: unknown): x is FunctionNode
+
+  isIndexNode(x: unknown): x is IndexNode
+
+  isNode(x: unknown): x is MathNode
+
+  isObjectNode(x: unknown): x is ObjectNode
+
+  isOperatorNode(x: unknown): x is OperatorNode<OperatorNodeOp, OperatorNodeFn>
+
+  isParenthesisNode(x: unknown): x is ParenthesisNode
+
+  isRangeNode(x: unknown): x is RangeNode
+
+  isRelationalNode(x: unknown): x is RelationalNode
+
+  isSymbolNode(x: unknown): x is SymbolNode
+
+  isChain(x: unknown): x is MathJsChain<unknown>
+
+  /*************************************************************************
+   * Functions -> Utils
+   ************************************************************************/
+
+  /**
+   * Clone an object.
+   * @param x Object to be cloned
+   * @returns A clone of object x
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  clone<TType>(x: TType): TType
+
+  /**
+   * Test whether a value is an numeric value. In case of a string,
+   *  true is returned if the string contains a numeric value.
+   * @param x Value to be tested
+   * @returns Returns true when x is a number, BigNumber, bigint, Fraction, Boolean, or a String containing number.
+   * Returns false for other types.
+   * Throws an error in case of unknown types.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  hasNumericValue(x: any): boolean | boolean[]
+
+  /**
+   * Test whether a value is an integer number. The function supports
+   * number, BigNumber, and Fraction. The function is evaluated
+   * element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x contains a numeric, integer value.
+   * Throws an error in case of an unknown data type.
+   */
+  isInteger(x: number | BigNumber | Fraction | MathCollection): boolean
+
+  /**
+   * Test whether a value is NaN (not a number). The function supports
+   * types number, BigNumber, Fraction, Unit and Complex. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is NaN. Throws an error in case of an
+   * unknown data type.
+   */
+  isNaN(
+    x: number | BigNumber | bigint | Fraction | MathCollection | Unit
+  ): boolean
+
+  /**
+   * Test whether a value is negative: smaller than zero. The function
+   * supports types number, BigNumber, Fraction, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is larger than zero. Throws an error in
+   * case of an unknown data type.
+   */
+  isNegative(
+    x: number | BigNumber | bigint | Fraction | MathCollection | Unit
+  ): boolean
+
+  /**
+   * Test whether a value is an numeric value. The function is evaluated
+   * element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is a number, BigNumber, bigint, Fraction, or
+   * boolean. Returns false for other types. Throws an error in case of
+   * unknown types.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  isNumeric(x: any): x is number | BigNumber | bigint | Fraction | boolean
+
+  /**
+   * Test whether a value is positive: larger than zero. The function
+   * supports types number, BigNumber, Fraction, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is larger than zero. Throws an error in
+   * case of an unknown data type.
+   */
+  isPositive(
+    x: number | BigNumber | bigint | Fraction | MathCollection | Unit
+  ): boolean
+
+  /**
+   * Test whether a value is prime: has no divisors other than itself and
+   * one. The function supports type number, bignumber. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is larger than zero. Throws an error in
+   * case of an unknown data type.
+   */
+  isPrime(x: number | BigNumber | MathCollection): boolean
+
+  /**
+   * Test whether a value is zero. The function can check for zero for
+   * types number, BigNumber, Fraction, Complex, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   * @param x Value to be tested
+   * @returns Returns true when x is zero. Throws an error in case of an
+   * unknown data type.
+   */
+  isZero(x: MathType): boolean
+
+  /**
+   * Determine the type of a variable.
+   * @param x The variable for which to test the type
+   * @returns Returns the name of the type. Primitive types are lower
+   * case, non-primitive types are upper-camel-case. For example ‘number’,
+   * ‘string’, ‘Array’, ‘Date’.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  typeOf(x: any): string
+
+  /**
+   * Import functions from an object or a module
+   * To avoid errors when using one of the imported functions extend module like this:
+   *
+   * @example
+   * // imported_math_functions.ts
+   * declare module 'mathjs' {
+   *      interface MathJsInterface {
+   *          hello(a: number): number;
+   *      }
+   * }
+   *
+   * @param object An object with functions to be imported.
+   * @param options An object with import options.
+   */
+  import(object: ImportObject | ImportObject[], options?: ImportOptions): void
+}
+
+/**
+ * @deprecated since v12.0.0. The interface MathJsStatic has been renamed to MathJsInstance
+ */
+export type MathJsStatic = MathJsInstance
+
+/**
+ * @deprecated since v12.0.0. Use MathJsFactory instead and import dependency maps directly from the library
+ */
+export type FactoryDependencies = void
+
+/*************************************************************************
+ * Factory and Dependencies
+ ************************************************************************/
+export interface MathJsFactory {
+  create: (
+    factories: FactoryFunctionMap,
+    config?: ConfigOptions
+  ) => MathJsInstance
+
+  factory: <T, TDeps extends readonly MathJsFunctionName[]>(
+    name: string,
+    dependencies: TDeps,
+    create: (
+      injected: Pick<MathJsInstance, Extract<MathJsFunctionName, TDeps[number]>>
+    ) => T,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    meta?: any
+  ) => FactoryFunction<T>
+}
+
+export const {
+  all,
+  typedDependencies,
+  ResultSetDependencies,
+  BigNumberDependencies,
+  ComplexDependencies,
+  FractionDependencies,
+  RangeDependencies,
+  MatrixDependencies,
+  DenseMatrixDependencies,
+  cloneDependencies,
+  isIntegerDependencies,
+  isNegativeDependencies,
+  isNumericDependencies,
+  hasNumericValueDependencies,
+  isPositiveDependencies,
+  isZeroDependencies,
+  isNaNDependencies,
+  typeOfDependencies,
+  typeofDependencies,
+  equalScalarDependencies,
+  SparseMatrixDependencies,
+  numberDependencies,
+  stringDependencies,
+  booleanDependencies,
+  bignumberDependencies,
+  complexDependencies,
+  fractionDependencies,
+  matrixDependencies,
+  splitUnitDependencies,
+  unaryMinusDependencies,
+  unaryPlusDependencies,
+  absDependencies,
+  mapSlicesDependencies,
+  addScalarDependencies,
+  cbrtDependencies,
+  ceilDependencies,
+  cubeDependencies,
+  expDependencies,
+  expm1Dependencies,
+  fixDependencies,
+  floorDependencies,
+  gcdDependencies,
+  lcmDependencies,
+  log10Dependencies,
+  log2Dependencies,
+  modDependencies,
+  multiplyScalarDependencies,
+  multiplyDependencies,
+  nthRootDependencies,
+  signDependencies,
+  sqrtDependencies,
+  squareDependencies,
+  subtractDependencies,
+  xgcdDependencies,
+  dotMultiplyDependencies,
+  bitAndDependencies,
+  bitNotDependencies,
+  bitOrDependencies,
+  bitXorDependencies,
+  argDependencies,
+  conjDependencies,
+  imDependencies,
+  reDependencies,
+  notDependencies,
+  orDependencies,
+  xorDependencies,
+  concatDependencies,
+  columnDependencies,
+  crossDependencies,
+  diagDependencies,
+  eyeDependencies,
+  filterDependencies,
+  flattenDependencies,
+  forEachDependencies,
+  getMatrixDataTypeDependencies,
+  identityDependencies,
+  kronDependencies,
+  mapDependencies,
+  onesDependencies,
+  rangeDependencies,
+  reshapeDependencies,
+  resizeDependencies,
+  rowDependencies,
+  sizeDependencies,
+  squeezeDependencies,
+  subsetDependencies,
+  transposeDependencies,
+  ctransposeDependencies,
+  zerosDependencies,
+  erfDependencies,
+  modeDependencies,
+  prodDependencies,
+  formatDependencies,
+  printDependencies,
+  toDependencies,
+  toBestDependencies,
+  isPrimeDependencies,
+  numericDependencies,
+  divideScalarDependencies,
+  powDependencies,
+  roundDependencies,
+  logDependencies,
+  log1pDependencies,
+  nthRootsDependencies,
+  dotPowDependencies,
+  dotDivideDependencies,
+  lsolveDependencies,
+  usolveDependencies,
+  leftShiftDependencies,
+  rightArithShiftDependencies,
+  rightLogShiftDependencies,
+  andDependencies,
+  compareDependencies,
+  compareNaturalDependencies,
+  compareTextDependencies,
+  equalDependencies,
+  equalTextDependencies,
+  smallerDependencies,
+  smallerEqDependencies,
+  largerDependencies,
+  largerEqDependencies,
+  deepEqualDependencies,
+  unequalDependencies,
+  partitionSelectDependencies,
+  sortDependencies,
+  maxDependencies,
+  minDependencies,
+  ImmutableDenseMatrixDependencies,
+  IndexDependencies,
+  FibonacciHeapDependencies,
+  SpaDependencies,
+  UnitDependencies,
+  unitDependencies,
+  sparseDependencies,
+  createUnitDependencies,
+  acosDependencies,
+  acoshDependencies,
+  acotDependencies,
+  acothDependencies,
+  acscDependencies,
+  acschDependencies,
+  asecDependencies,
+  asechDependencies,
+  asinDependencies,
+  asinhDependencies,
+  atanDependencies,
+  atan2Dependencies,
+  atanhDependencies,
+  cosDependencies,
+  coshDependencies,
+  cotDependencies,
+  cothDependencies,
+  cscDependencies,
+  cschDependencies,
+  secDependencies,
+  sechDependencies,
+  sinDependencies,
+  sinhDependencies,
+  tanDependencies,
+  tanhDependencies,
+  setCartesianDependencies,
+  setDifferenceDependencies,
+  setDistinctDependencies,
+  setIntersectDependencies,
+  setIsSubsetDependencies,
+  setMultiplicityDependencies,
+  setPowersetDependencies,
+  setSizeDependencies,
+  setSymDifferenceDependencies,
+  setUnionDependencies,
+  zpk2tfDependencies,
+  freqzDependencies,
+  addDependencies,
+  hypotDependencies,
+  normDependencies,
+  dotDependencies,
+  traceDependencies,
+  indexDependencies,
+  NodeDependencies,
+  AccessorNodeDependencies,
+  ArrayNodeDependencies,
+  AssignmentNodeDependencies,
+  BlockNodeDependencies,
+  ConditionalNodeDependencies,
+  ConstantNodeDependencies,
+  FunctionAssignmentNodeDependencies,
+  IndexNodeDependencies,
+  ObjectNodeDependencies,
+  OperatorNodeDependencies,
+  ParenthesisNodeDependencies,
+  RangeNodeDependencies,
+  RelationalNodeDependencies,
+  SymbolNodeDependencies,
+  FunctionNodeDependencies,
+  parseDependencies,
+  compileDependencies,
+  evaluateDependencies,
+  evalDependencies,
+  ParserDependencies,
+  parserDependencies,
+  lupDependencies,
+  qrDependencies,
+  sluDependencies,
+  lusolveDependencies,
+  HelpDependencies,
+  ChainDependencies,
+  helpDependencies,
+  chainDependencies,
+  detDependencies,
+  invDependencies,
+  expmDependencies,
+  sqrtmDependencies,
+  sylvesterDependencies,
+  schurDependencies,
+  lyapDependencies,
+  divideDependencies,
+  distanceDependencies,
+  intersectDependencies,
+  sumDependencies,
+  meanDependencies,
+  medianDependencies,
+  madDependencies,
+  varianceDependencies,
+  varDependencies,
+  quantileSeqDependencies,
+  stdDependencies,
+  combinationsDependencies,
+  gammaDependencies,
+  factorialDependencies,
+  kldivergenceDependencies,
+  multinomialDependencies,
+  permutationsDependencies,
+  pickRandomDependencies,
+  randomDependencies,
+  randomIntDependencies,
+  stirlingS2Dependencies,
+  bellNumbersDependencies,
+  catalanDependencies,
+  compositionDependencies,
+  simplifyDependencies,
+  derivativeDependencies,
+  rationalizeDependencies,
+  reviverDependencies,
+  eDependencies,
+  EDependencies,
+  falseDependencies,
+  iDependencies,
+  InfinityDependencies,
+  LN10Dependencies,
+  LN2Dependencies,
+  LOG10EDependencies,
+  LOG2EDependencies,
+  NaNDependencies,
+  nullDependencies,
+  phiDependencies,
+  piDependencies,
+  PIDependencies,
+  SQRT1_2Dependencies,
+  SQRT2Dependencies,
+  tauDependencies,
+  trueDependencies,
+  versionDependencies,
+  atomicMassDependencies,
+  avogadroDependencies,
+  bohrMagnetonDependencies,
+  bohrRadiusDependencies,
+  boltzmannDependencies,
+  classicalElectronRadiusDependencies,
+  conductanceQuantumDependencies,
+  coulombDependencies,
+  deuteronMassDependencies,
+  efimovFactorDependencies,
+  eigsDependencies,
+  electricConstantDependencies,
+  electronMassDependencies,
+  elementaryChargeDependencies,
+  faradayDependencies,
+  fermiCouplingDependencies,
+  fineStructureDependencies,
+  firstRadiationDependencies,
+  gasConstantDependencies,
+  gravitationConstantDependencies,
+  gravityDependencies,
+  hartreeEnergyDependencies,
+  inverseConductanceQuantumDependencies,
+  klitzingDependencies,
+  loschmidtDependencies,
+  magneticConstantDependencies,
+  magneticFluxQuantumDependencies,
+  molarMassDependencies,
+  molarMassC12Dependencies,
+  molarPlanckConstantDependencies,
+  molarVolumeDependencies,
+  neutronMassDependencies,
+  nuclearMagnetonDependencies,
+  planckChargeDependencies,
+  planckConstantDependencies,
+  planckLengthDependencies,
+  planckMassDependencies,
+  planckTemperatureDependencies,
+  planckTimeDependencies,
+  protonMassDependencies,
+  quantumOfCirculationDependencies,
+  reducedPlanckConstantDependencies,
+  rydbergDependencies,
+  sackurTetrodeDependencies,
+  secondRadiationDependencies,
+  speedOfLightDependencies,
+  stefanBoltzmannDependencies,
+  thomsonCrossSectionDependencies,
+  vacuumImpedanceDependencies,
+  weakMixingAngleDependencies,
+  wienDisplacementDependencies,
+  mapSlicesTransformDependencies,
+  columnTransformDependencies,
+  filterTransformDependencies,
+  forEachTransformDependencies,
+  indexTransformDependencies,
+  mapTransformDependencies,
+  maxTransformDependencies,
+  meanTransformDependencies,
+  minTransformDependencies,
+  rangeTransformDependencies,
+  rowTransformDependencies,
+  subsetTransformDependencies,
+  concatTransformDependencies,
+  stdTransformDependencies,
+  sumTransformDependencies,
+  varianceTransformDependencies,
+  printTransformDependencies
+}: Record<string, FactoryFunctionMap>
+
+export interface Matrix<T = MathGeneric> {
+  type: string
+  storage(): string
+  datatype(): string
+  create(data: MathArray, datatype?: string): void
+  density(): number
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  subset(index: Index, replacement?: any, defaultValue?: any): Matrix
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  get(index: number[]): any
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  set(index: number[], value: any, defaultValue?: number | string): Matrix
+  resize(size: MathCollection, defaultValue?: number | string): Matrix
+  clone(): Matrix<T>
+  size(): number[]
+  map(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (a: any, b: number[], c: Matrix) => any,
+    skipZeros?: boolean
+  ): Matrix
+  forEach(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (a: any, b: number[], c: Matrix) => void,
+    skipZeros?: boolean
+  ): void
+  toArray(): MathArray<T>
+  valueOf(): MathArray<T>
+  format(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    options?: FormatOptions | number | BigNumber | ((value: any) => string)
+  ): string
+  toString(): string
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  toJSON(): any
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  diagonal(k?: number | BigNumber): any[]
+  swapRows(i: number, j: number): Matrix<T>
+}
+
+export interface MatrixCtor {
+  new (): Matrix
+}
+
+// eslint-disable-next-line @typescript-eslint/no-empty-object-type
+export interface BigNumber extends Decimal {}
+
+export interface Complex {
+  re: number
+  im: number
+  clone(): Complex
+  equals(other: Complex): boolean
+  format(precision?: number): string
+  fromJSON(json: object): Complex
+  fromPolar(polar: object): Complex
+  fromPolar(r: number, phi: number): Complex
+  toJSON(): object
+  toPolar(): PolarCoordinates
+  toString(): string
+  compare(a: Complex, b: Complex): number
+}
+
+export interface PolarCoordinates {
+  r: number
+  phi: number
+}
+
+export interface MathJSON {
+  mathjs?: string
+  value: number
+  unit: string
+  fixPrefix?: boolean
+}
+
+export interface BaseUnit {
+  dimensions: number[]
+  key: string
+}
+
+export interface UnitComponent {
+  power: number
+  prefix: string
+  unit: {
+    name: string
+    base: BaseUnit
+    prefixes: Record<string, UnitPrefix>
+    value: number
+    offset: number
+    dimensions: number[]
+  }
+}
+
+export interface UnitPrefix {
+  name: string
+  value: number
+  scientific: boolean
+}
+
+export interface Unit {
+  valueOf(): string
+  clone(): Unit
+  hasBase(base: BaseUnit | string | undefined): boolean
+  equalBase(unit: Unit): boolean
+  equals(unit: Unit): boolean
+  multiply(unit: Unit): Unit
+  divide(unit: Unit): Unit | number
+  pow(unit: Unit): Unit
+  abs(unit: Unit): Unit
+  to(unit: string | Unit): Unit
+  toBest(): Unit
+  toBest(units?: string[] | Unit[], options?: object): Unit
+  toNumber(unit?: string): number
+  toNumeric(unit?: string): number | Fraction | BigNumber
+  toSI(): Unit
+  toString(): string
+  toJSON(): MathJSON
+  formatUnits(): string
+  format(options: FormatOptions): string
+  simplify(): Unit
+  splitUnit(parts: ReadonlyArray<string | Unit>): Unit[]
+
+  units: UnitComponent[]
+  dimensions: number[]
+  value: number
+  fixPrefix: boolean
+  skipAutomaticSimplification: true
+}
+
+export type UnitSystemName = 'si' | 'cgs' | 'us' | 'auto'
+
+export interface UnitStatic {
+  PREFIXES: Record<string, UnitPrefix>
+  BASE_DIMENSIONS: string[]
+  BASE_UNITS: Record<string, BaseUnit>
+  UNIT_SYSTEMS: Record<
+    UnitSystemName,
+    Record<string, { unit: Unit; prefix: UnitPrefix }>
+  >
+  UNITS: Record<string, Unit>
+  parse(str: string): Unit
+  isValuelessUnit(name: string): boolean
+  fromJSON(json: MathJSON): Unit
+  isValidAlpha(c: string): boolean
+  createUnit(
+    obj: Record<string, string | Unit | UnitDefinition>,
+    options?: { override: boolean }
+  ): Unit
+  createUnitSingle(
+    name: string,
+    definition: string | Unit | UnitDefinition
+  ): Unit
+  getUnitSystem(): UnitSystemName
+  setUnitSystem(name: UnitSystemName): void
+}
+
+export interface UnitCtor extends UnitStatic {
+  new (
+    value: number | BigNumber | Fraction | Complex | boolean,
+    name: string
+  ): Unit
+}
+
+export interface CreateUnitOptions {
+  prefixes?: 'none' | 'short' | 'long' | 'binary_short' | 'binary_long'
+  aliases?: string[]
+  offset?: number
+  override?: boolean
+}
+
+export type SimplifyContext = Partial<
+  Record<
+    OperatorNodeFn,
+    {
+      trivial: boolean
+      total: boolean
+      commutative: boolean
+      associative: boolean
+    }
+  >
+>
+
+export interface SimplifyOptions {
+  /** A boolean which is `true` by default. */
+  exactFractions?: boolean
+  /**
+   * When `exactFractions` is true, a fraction will be returned only
+   * when both numerator and denominator are smaller than `fractionsLimit`.
+   * Default value is 10000.
+   */
+  fractionsLimit?: number
+  /** A boolean which is `false` by default. */
+  consoleDebug?: boolean
+  /**
+   * gives properties of each operator, which determine what simplifications
+   * are allowed. Properties are commutative, associative, total (whether
+   * the operation is defined for all arguments), and trivial (whether
+   * the operation applied to a single argument leaves that argument
+   * unchanged).
+   */
+  context?: SimplifyContext
+}
+
+export type SimplifyRule =
+  | {
+      l: string
+      r: string
+      repeat?: boolean
+      assuming?: SimplifyContext
+      imposeContext?: SimplifyContext
+    }
+  | {
+      s: string
+      repeat?: boolean
+      assuming?: SimplifyContext
+      imposeContext?: SimplifyContext
+    }
+  | string
+  | ((node: MathNode) => MathNode)
+
+export interface Simplify {
+  (expr: MathNode | string): MathNode
+  (
+    expr: MathNode | string,
+    rules: SimplifyRule[],
+    scope?: MathScope,
+    options?: SimplifyOptions
+  ): MathNode
+  (
+    expr: MathNode | string,
+    scope: MathScope,
+    options?: SimplifyOptions
+  ): MathNode
+
+  rules: SimplifyRule[]
+}
+
+export interface UnitDefinition {
+  definition?: string | Unit
+  prefixes?: string
+  offset?: number
+  aliases?: string[]
+  baseName?: string
+}
+
+// eslint-disable-next-line @typescript-eslint/no-empty-object-type
+export interface Index {}
+
+export interface PartitionedMap<T, U> {
+  a: Map<T, U>
+  b: Map<T, U>
+}
+
+export interface ObjectWrappingMap<T extends string | number | symbol, U> {
+  wrappedObject: Record<T, U>
+}
+
+export interface EvalFunction {
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  evaluate(scope?: MathScope): any
+}
+
+// ResultSet type and helper
+export interface ResultSet {
+  entries: unknown[]
+  valueOf(): unknown[]
+  toString(): string
+  toJSON(): MathJSON
+}
+
+export interface MathNode {
+  isNode: true
+  comment: string
+  type: string
+
+  isUpdateNode?: boolean
+
+  /**
+   * Create a shallow clone of the node. The node itself is cloned, its
+   * childs are not cloned.
+   */
+  clone(): this
+  /**
+   * Create a deep clone of the node. Both the node as well as all its
+   * childs are cloned recursively.
+   */
+  cloneDeep(): this
+  /**
+   * Compile an expression into optimized JavaScript code. compile returns
+   * an object with a function evaluate([scope]) to evaluate. Example:
+   */
+  compile(): EvalFunction
+  /**
+   * Compile and eval an expression, this is the equivalent of doing
+   * node.compile().evaluate(scope). Example:
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  evaluate(scope?: MathScope): any
+  /**
+   * Test whether this node equals an other node. Does a deep comparison
+   * of the values of both nodes.
+   */
+  equals(other: MathNode): boolean
+  /**
+   *
+   * Filter nodes in an expression tree. The callback function is called
+   * as callback(node: MathNode, path: string, parent: MathNode) : boolean
+   * for every node in the tree, and must return a boolean. The function
+   * filter returns an array with nodes for which the test returned true.
+   * Parameter path is a string containing a relative JSON Path.
+   *
+   * Example:
+   *
+   * ```
+   * var node = math.parse('x^2 + x/4 + 3*y');
+   * var filtered = node.filter(function (node) {
+   * return node.isSymbolMathNode && node.name == 'x';
+   * });
+   * // returns an array with two entries: two SymbolMathNodes 'x'
+   * ```
+   *
+   * The callback function is called as callback(node: MathNode, path:
+   * string, parent: MathNode) : boolean for every node in the tree, and
+   * must return a boolean. The function filter returns an array with
+   * nodes for which the test returned true. Parameter path is a string
+   * containing a relative JSON Path.
+   * @return Returns an array with nodes for which test returned true
+   */
+  filter(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (node: MathNode, path: string, parent: MathNode) => any
+  ): MathNode[]
+
+  /**
+   * [forEach description]
+   */
+  forEach(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (node: MathNode, path: string, parent: MathNode) => void
+  ): void
+
+  /**
+   * Transform a node. Creates a new MathNode having it’s child's be the
+   * results of calling the provided callback function for each of the
+   * child's of the original node. The callback function is called as
+   * `callback(child: MathNode, path: string, parent: MathNode)` and must
+   * return a MathNode. Parameter path is a string containing a relative
+   * JSON Path.
+   *
+   *
+   * See also transform, which is a recursive version of map.
+   */
+  map(
+    callback: (node: MathNode, path: string, parent: MathNode) => MathNode
+  ): MathNode
+
+  /**
+   * Get a HTML representation of the parsed expression.
+   */
+  toHTML(options?: object): string
+
+  /**
+   * Get a string representation of the parsed expression. This is not
+   * exactly the same as the original input.
+   */
+  toString(options?: object): string
+
+  /**
+   * Get a LaTeX representation of the expression.
+   */
+  toTex(options?: object): string
+
+  /**
+   * Recursively transform an expression tree via a transform function.
+   * Similar to Array.map, but recursively executed on all nodes in the
+   * expression tree. The callback function is a mapping function
+   * accepting a node, and returning a replacement for the node or the
+   * original node. Function callback is called as callback(node:
+   * MathNode, path: string, parent: MathNode) for every node in the tree,
+   * and must return a MathNode. Parameter path is a string containing a
+   * relative JSON Path.
+   *
+   * For example, to replace all nodes of type SymbolMathNode having name
+   * ‘x’ with a ConstantMathNode with value 3:
+   * ```js
+   * var node = math.parse('x^2 + 5*x');
+   * var transformed = node.transform(function (node, path, parent) {
+   *   if (node.SymbolMathNode && node.name == 'x') {
+   *     return new math.expression.node.ConstantMathNode(3);
+   *   }
+   *   else {
+   *     return node;
+   *   }
+   * });
+   * transformed.toString(); // returns '(3 ^ 2) + (5 * 3)'
+   * ```
+   */
+  transform<TResult>(
+    callback: (node: this, path: string, parent: MathNode) => TResult
+  ): TResult
+
+  /**
+   * `traverse(callback)`
+   *
+   * Recursively traverse all nodes in a node tree. Executes given
+   * callback for this node and each of its child nodes. Similar to
+   * Array.forEach, except recursive. The callback function is a mapping
+   * function accepting a node, and returning a replacement for the node
+   * or the original node. Function callback is called as callback(node:
+   * MathNode, path: string, parent: MathNode) for every node in the tree.
+   * Parameter path is a string containing a relative JSON Path. Example:
+   *
+   * ```
+   * var node = math.parse('3 * x + 2');
+   * node.traverse(function (node, path, parent) {
+   * switch (node.type) {
+   * case 'OperatorMathNode': console.log(node.type, node.op);    break;
+   * case 'ConstantMathNode': console.log(node.type, node.value); break;
+   * case 'SymbolMathNode':   console.log(node.type, node.name);  break;
+   * default:             console.log(node.type);
+   * }
+   * });
+   * // outputs:
+   * //   OperatorMathNode +
+   * //   OperatorMathNode *
+   * //   ConstantMathNode 3
+   * //   SymbolMathNode x
+   * //   ConstantMathNode 2
+   * ```
+   */
+  traverse(
+    callback: (node: MathNode, path: string, parent: MathNode) => void
+  ): void
+}
+
+export interface Parser {
+  /**
+   * Evaluate an expression. Returns the result of the expression.
+   * @param expr The expression to evaluate
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  evaluate(expr: string | string[]): any
+  /**
+   * Retrieve a variable or function from the parser’s scope.
+   * @param name The name of the variable or function to be retrieved
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  get(name: string): any
+  /**
+   * Retrieve an object with all defined variables in the parser’s scope.
+   * @returns An object with all defined variables
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  getAll(): { [key: string]: any }
+  /**
+   * Retrieve a map with all defined variables in the parser’s scope.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  getAllAsMap(): Map<string, any>
+  /**
+   * Set a variable or function in the parser’s scope.
+   * @param name The name of the variable or function to be set
+   * @param value The value of the variable or function to be set
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  set: (name: string, value: any) => void
+  /**
+   * Remove a variable or function from the parser’s scope.
+   * @param name The name of the variable or function to be removed
+   */
+  remove: (name: string) => void
+  /**
+   * Completely clear the parser’s scope.
+   */
+  clear: () => void
+}
+
+export interface Distribution {
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  random(size: any, min?: any, max?: any): any
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  randomInt(min: any, max?: any): any
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  pickRandom(array: any): any
+}
+
+export interface FormatOptions {
+  /**
+   * Number notation. Choose from: 'fixed' Always use regular number
+   * notation. For example '123.40' and '14000000' 'exponential' Always
+   * use exponential notation. For example '1.234e+2' and '1.4e+7' 'auto'
+   * (default) Regular number notation for numbers having an absolute
+   * value between lower and upper bounds, and uses exponential notation
+   * elsewhere. Lower bound is included, upper bound is excluded. For
+   * example '123.4' and '1.4e7'.
+   */
+  notation?:
+    | 'fixed'
+    | 'exponential'
+    | 'engineering'
+    | 'auto'
+    | 'hex'
+    | 'bin'
+    | 'oct'
+
+  /**
+   * A number between 0 and 16 to round the digits of the number. In case
+   * of notations 'exponential' and 'auto', precision defines the total
+   * number of significant digits returned and is undefined by default. In
+   * case of notation 'fixed', precision defines the number of significant
+   * digits after the decimal point, and is 0 by default.
+   */
+  precision?: number | BigNumber
+
+  /**
+   * Exponent determining the lower boundary for formatting a value with
+   * an exponent when notation='auto. Default value is -3.
+   */
+  lowerExp?: number | BigNumber
+
+  /**
+   * Exponent determining the upper boundary for formatting a value with
+   * an exponent when notation='auto. Default value is 5.
+   */
+  upperExp?: number | BigNumber
+
+  /**
+   * Available values: 'ratio' (default) or 'decimal'. For example
+   * format(fraction(1, 3)) will output '1/3' when 'ratio' is configured,
+   * and will output 0.(3) when 'decimal' is configured.
+   */
+  fraction?: string
+
+  /**
+   * The word size in bits to use for formatting in binary, octal, or
+   * hexadecimal notation. To be used only with `'bin'`, `'oct'`, or `'hex'`
+   * values for `notation` option. When this option is defined the value
+   * is formatted as a signed twos complement integer of the given word
+   * size and the size suffix is appended to the output.
+   */
+  wordSize?: number | BigNumber
+}
+
+export interface Help {
+  toString(): string
+  toJSON(): string
+}
+
+export interface ConfigOptions {
+  relTol?: number
+  absTol?: number
+  /**
+   * @deprecated Use `relTol` and `absTol` instead
+   */
+  epsilon?: number
+  matrix?: 'Matrix' | 'Array'
+  number?: 'number' | 'BigNumber' | 'bigint' | 'Fraction'
+  numberFallback?: 'number' | 'BigNumber'
+  precision?: number
+  predictable?: boolean
+  randomSeed?: string | null
+}
+
+export interface MathJsChain<TValue> {
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  done(): TValue
+
+  /*************************************************************************
+   * Construction functions
+   ************************************************************************/
+
+  /**
+   * Create a BigNumber, which can store numbers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to
+   * BigNumber.
+   */
+  bignumber(
+    this: MathJsChain<
+      number | string | Fraction | BigNumber | bigint | Unit | boolean | null
+    >
+  ): MathJsChain<BigNumber>
+  bignumber<T extends MathCollection>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Create a bigint, which can store integers with arbitrary precision.
+   * When a matrix is provided, all elements will be converted to bigint.
+   */
+  bigint(
+    this: MathJsChain<
+      number | string | Fraction | BigNumber | bigint | boolean | null
+    >
+  ): MathJsChain<bigint>
+  bigint<T extends MathCollection>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Create a boolean or convert a string or number to a boolean. In case
+   * of a number, true is returned for non-zero numbers, and false in case
+   * of zero. Strings can be 'true' or 'false', or can contain a number.
+   * When value is a matrix, all elements will be converted to boolean.
+   */
+  boolean(
+    this: MathJsChain<string | number | boolean | null>
+  ): MathJsChain<boolean>
+  boolean(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Create a complex value or convert a value to a complex value.
+   * @param im Argument specifying the imaginary part of the complex
+   * number
+   */
+  complex(
+    this: MathJsChain<Complex | string | PolarCoordinates>,
+    im?: number
+  ): MathJsChain<Complex>
+  complex(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * @param definition Definition of the unit in terms of existing units.
+   * For example, ‘0.514444444 m / s’.
+   * @param options (optional) An object containing any of the following
+   * properties:</br>- prefixes {string} “none”, “short”, “long”,
+   * “binary_short”, or “binary_long”. The default is “none”.</br>-
+   * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+   * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+   * the unit. For example, the offset for celsius is 273.15. Default is
+   * 0.
+   */
+  createUnit(
+    this: MathJsChain<string>,
+    definition?: string | UnitDefinition | Unit,
+    options?: CreateUnitOptions
+  ): MathJsChain<Unit>
+  /**
+   * Create a user-defined unit and register it with the Unit type.
+   * @param options (optional) An object containing any of the following
+   * properties:</br>- prefixes {string} “none”, “short”, “long”,
+   * “binary_short”, or “binary_long”. The default is “none”.</br>-
+   * aliases {Array} Array of strings. Example: [‘knots’, ‘kt’,
+   * ‘kts’]</br>- offset {Numeric} An offset to apply when converting from
+   * the unit. For example, the offset for celsius is 273.15. Default is
+   * 0.
+   */
+  createUnit(
+    this: MathJsChain<Record<string, string | UnitDefinition | Unit>>,
+    options?: CreateUnitOptions
+  ): MathJsChain<Unit>
+
+  /**
+   * Create a fraction convert a value to a fraction.
+   * @param denominator Argument specifying the denominator of the
+   * fraction
+   */
+  fraction(
+    this: MathJsChain<
+      | number
+      | string
+      | BigNumber
+      | bigint
+      | Unit
+      | Fraction
+      | FractionDefinition
+    >,
+    denominator?: number
+  ): MathJsChain<Fraction>
+  fraction(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Create an index. An Index can store ranges having start, step, and
+   * end for multiple dimensions. Matrix.get, Matrix.set, and math.subset
+   * accept an Index as input.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  index(this: MathJsChain<any[]>): MathJsChain<Index>
+
+  /**
+   * Create a Matrix. The function creates a new math.type.Matrix object
+   * from an Array. A Matrix has utility functions to manipulate the data
+   * in the matrix, like getting the size and getting or setting values in
+   * the matrix. Supported storage formats are 'dense' and 'sparse'.
+   */
+  matrix(
+    this: MathJsChain<MathCollection>,
+    format?: 'sparse' | 'dense',
+    dataType?: string
+  ): MathJsChain<Matrix>
+
+  /**
+   * Create a number or convert a string, boolean, or unit to a number.
+   * When value is a matrix, all elements will be converted to number.
+   * @param valuelessUnit A valueless unit, used to convert a unit to a
+   * number
+   */
+  number(
+    this: MathJsChain<
+      string | number | BigNumber | bigint | Fraction | boolean | Unit | null
+    >,
+    valuelessUnit?: Unit | string
+  ): MathJsChain<number>
+  number(
+    this: MathJsChain<MathCollection>,
+    valuelessUnit?: Unit | string
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Convert a numeric input to a specific numeric type: number, BigNumber, bigint, or Fraction.
+   * @param outputType The desired numeric output type
+   */
+  numeric(
+    this: MathJsChain<string | number | BigNumber | bigint | Fraction>,
+    outputType: 'number'
+  ): MathJsChain<number>
+  numeric(
+    this: MathJsChain<string | number | BigNumber | bigint | Fraction>,
+    outputType: 'BigNumber'
+  ): MathJsChain<BigNumber>
+  numeric(
+    this: MathJsChain<string | number | BigNumber | bigint | Fraction>,
+    outputType: 'bigint'
+  ): MathJsChain<bigint>
+  numeric(
+    this: MathJsChain<string | number | BigNumber | bigint | Fraction>,
+    outputType: 'Fraction'
+  ): MathJsChain<Fraction>
+
+  /**
+   * Create a Sparse Matrix. The function creates a new math.type.Matrix
+   * object from an Array. A Matrix has utility functions to manipulate
+   * the data in the matrix, like getting the size and getting or setting
+   * values in the matrix.
+   * @param dataType Sparse Matrix data type
+   */
+  sparse(
+    this: MathJsChain<MathCollection>,
+    dataType?: string
+  ): MathJsChain<Matrix>
+
+  /**
+   * Split a unit in an array of units whose sum is equal to the original
+   * unit.
+   * @param parts An array of strings or valueless units
+   */
+  splitUnit(this: MathJsChain<Unit>, parts: Unit[]): MathJsChain<Unit[]>
+
+  /**
+   * Create a string or convert any object into a string. Elements of
+   * Arrays and Matrices are processed element wise.
+   */
+  string(
+    this: MathJsChain<MathNumericType | string | Unit | null>
+  ): MathJsChain<string>
+  string(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Create a unit. Depending on the passed arguments, the function will
+   * create and return a new math.type.Unit object. When a matrix is
+   * provided, all elements will be converted to units.
+   * @param unit The unit to be created
+   */
+  unit(this: MathJsChain<string>, unit?: string): MathJsChain<Unit>
+  unit(this: MathJsChain<MathNumericType>, unit?: string): MathJsChain<Unit>
+  unit(this: MathJsChain<MathCollection>): MathJsChain<Unit[]>
+
+  /*************************************************************************
+   * Expression functions
+   ************************************************************************/
+
+  /**
+   * Parse and compile an expression. Returns a an object with a function
+   * evaluate([scope]) to evaluate the compiled expression.
+   */
+  compile(this: MathJsChain<MathExpression>): MathJsChain<EvalFunction>
+
+  // TODO properly type this
+  /**
+   * Evaluate an expression.
+   * @param scope Scope to read/write variables
+   */
+  evaluate(
+    this: MathJsChain<MathExpression | Matrix>,
+    scope?: MathScope
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ): MathJsChain<any>
+  evaluate(
+    this: MathJsChain<MathExpression[]>,
+    scope?: MathScope
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  ): MathJsChain<any[]>
+
+  /**
+   * Retrieve help on a function or data type. Help files are retrieved
+   * from the documentation in math.expression.docs.
+   */
+  help(this: MathJsChain<unknown>): MathJsChain<unknown>
+
+  /**
+   * @param options Available options: nodes - a set of custome nodes
+   */
+  parse(
+    this: MathJsChain<MathExpression[]>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    options?: any
+  ): MathJsChain<MathNode[]>
+
+  /**
+   * Parse an expression. Returns a node tree, which can be evaluated by
+   * invoking node.evaluate();
+   * @param options Available options: nodes - a set of custome nodes
+   */
+  parse(
+    this: MathJsChain<MathExpression>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    options?: any
+  ): MathJsChain<MathNode>
+
+  /**
+   *  Replaces variable nodes with their scoped values
+   * @param scope Scope to read/write variables
+   */
+  resolve(
+    this: MathJsChain<MathNode>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    scope?: MathScope
+  ): MathJsChain<MathNode>
+  resolve(
+    this: MathJsChain<MathNode[]>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    scope?: MathScope
+  ): MathJsChain<MathNode[]>
+
+  /*************************************************************************
+   * Algebra functions
+   ************************************************************************/
+  /**
+   * @param variable The variable over which to differentiate
+   * @param options There is one option available, simplify, which is true
+   * by default. When false, output will not be simplified.
+   */
+  derivative(
+    this: MathJsChain<MathNode | string>,
+    variable: MathNode | string,
+    options?: { simplify: boolean }
+  ): MathJsChain<MathNode>
+
+  /**
+   * Solves the linear equation system by forwards substitution. Matrix
+   * must be a lower triangular matrix.
+   * @param b A column vector with the b values
+   */
+  lsolve(this: MathJsChain<Matrix>, b: MathCollection): MathJsChain<Matrix>
+  lsolve(
+    this: MathJsChain<MathArray>,
+    b: MathCollection
+  ): MathJsChain<MathArray>
+
+  /**
+   * Calculate the Matrix LU decomposition with partial pivoting. Matrix A
+   * is decomposed in two matrices (L, U) and a row permutation vector p
+   * where A[p,:] = L * U
+   */
+  lup(this: MathJsChain<MathCollection>): MathJsChain<LUDecomposition>
+
+  /**
+   * Solves the linear system A * x = b where A is an [n x n] matrix and b
+   * is a [n] column vector.
+   * @param b Column Vector
+   * @param order The Symbolic Ordering and Analysis order, see slu for
+   * details. Matrix must be a SparseMatrix
+   * @param threshold Partial pivoting threshold (1 for partial pivoting),
+   * see slu for details. Matrix must be a SparseMatrix.
+   */
+  lusolve(
+    this: MathJsChain<Matrix>,
+    b: MathCollection,
+    order?: number,
+    threshold?: number
+  ): MathJsChain<Matrix>
+
+  lusolve(
+    this: MathJsChain<MathArray>,
+    b: MathCollection,
+    order?: number,
+    threshold?: number
+  ): MathJsChain<MathArray>
+
+  lusolve(
+    this: MathJsChain<LUDecomposition>,
+    b: MathCollection
+  ): MathJsChain<Matrix>
+
+  /**
+   * Calculate the Matrix QR decomposition. Matrix A is decomposed in two
+   * matrices (Q, R) where Q is an orthogonal matrix and R is an upper
+   * triangular matrix.
+   */
+  qr(this: MathJsChain<MathCollection>): MathJsChain<QRDecomposition>
+
+  /**
+   * Transform a rationalizable expression in a rational fraction. If
+   * rational fraction is one variable polynomial then converts the
+   * numerator and denominator in canonical form, with decreasing
+   * exponents, returning the coefficients of numerator.
+   * @param optional scope of expression or true for already evaluated
+   * rational expression at input
+   * @param detailed  optional True if return an object, false if return
+   * expression node (default)
+   */
+  rationalize(
+    this: MathJsChain<MathNode | string>,
+    optional?: object | boolean,
+    detailed?: boolean
+  ): MathJsChain<MathNode>
+
+  /**
+   * Simplify an expression tree.
+   * @param rules A list of rules are applied to an expression, repeating
+   * over the list until no further changes are made. It’s possible to
+   * pass a custom set of rules to the function as second argument. A rule
+   * can be specified as an object, string, or function.
+   * @param scope Scope to variables
+   * @param options Options to configure the behavior of simplify
+   */
+  simplify(
+    this: MathJsChain<MathNode | string>,
+    rules?: SimplifyRule[],
+    scope?: Map<string, MathType> | object,
+    options?: SimplifyOptions
+  ): MathJsChain<MathNode>
+
+  simplifyConstant(
+    this: MathJsChain<MathNode | string>,
+    options?: SimplifyOptions
+  ): MathJsChain<MathNode>
+  simplifyCore(
+    this: MathJsChain<MathNode | string>,
+    options?: SimplifyOptions
+  ): MathJsChain<MathNode>
+
+  /**
+   * Gives the number of “leaf nodes” in the parse tree of the given
+   * expression. A leaf node is one that has no subexpressions, essentially
+   * either a symbol or a constant. Note that `5!` has just one leaf, the `5`;
+   * the unary factorial operator does not add a leaf. On the other hand,
+   * function symbols do add leaves, so `sin(x)/cos(x)` has four leaves.
+   */
+  leafCount(this: MathJsChain<MathNode>): MathJsChain<number>
+
+  /**
+   * Calculate the Sparse Matrix LU decomposition with full pivoting.
+   * Sparse Matrix A is decomposed in two matrices (L, U) and two
+   * permutation vectors (pinv, q) where P * A * Q = L * U
+   * @param order The Symbolic Ordering and Analysis order: 0 - Natural
+   * ordering, no permutation vector q is returned 1 - Matrix must be
+   * square, symbolic ordering and analisis is performed on M = A + A' 2 -
+   * Symbolic ordering and analysis is performed on M = A' * A. Dense
+   * columns from A' are dropped, A recreated from A'. This is appropriate
+   * for LU factorization of non-symmetric matrices. 3 - Symbolic ordering
+   * and analysis is performed on M = A' * A. This is best used for LU
+   * factorization is matrix M has no dense rows. A dense row is a row
+   * with more than 10*sqr(columns) entries.
+   * @param threshold Partial pivoting threshold (1 for partial pivoting)
+   */
+  slu(
+    this: MathJsChain<Matrix>,
+    order: number,
+    threshold: number
+  ): MathJsChain<SLUDecomposition>
+
+  /**
+   * Solves the linear equation system by backward substitution. Matrix
+   * must be an upper triangular matrix. U * x = b
+   * @param b A column vector with the b values
+   */
+  usolve(this: MathJsChain<Matrix>, b: MathCollection): MathJsChain<Matrix>
+  usolve(
+    this: MathJsChain<MathArray>,
+    b: MathCollection
+  ): MathJsChain<MathArray>
+
+  /*************************************************************************
+   * Arithmetic functions
+   ************************************************************************/
+
+  /**
+   * Calculate the absolute value of a number. For matrices, the function
+   * is evaluated element wise.
+   */
+  abs(this: MathJsChain<Complex>): MathJsChain<number>
+  abs<T extends MathType>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Add two values, x + y. For matrices, the function is evaluated
+   * element wise.
+   * @param y Second value to add
+   */
+  add<T extends MathType>(this: MathJsChain<T>, y: T): MathJsChain<T>
+  add(this: MathJsChain<MathType>, y: MathType): MathJsChain<MathType>
+
+  /**
+   * Apply a function that maps an array to a scalar along a given axis of the
+   * matrix or array. Returns a new matrix or array with one less dimension
+   * than the input.
+   * @param dim The dimension along which the callback is applied
+   * @param callback The callback function that is applied. This Function should take an
+   * array or 1-d matrix as an input and return a number.
+   * @returns The residual matrix with the function applied over some dimension.
+   */
+  mapSlices<T extends MathCollection>(
+    this: MathJsChain<T>,
+    dim: number,
+    callback: (array: Array<MathType> | Matrix) => number
+  ): MathJsChain<T>
+  /**
+   * @deprecated backwards-compatibility old name of mapSlices
+   **/
+  apply: MathJsChain<TValue>['mapSlices']
+
+  /**
+   * Calculate the cubic root of a value. For matrices, the function is
+   * evaluated element wise.
+   * @param allRoots Optional, false by default. Only applicable when x is
+   * a number or complex number. If true, all complex roots are returned,
+   * if false (default) the principal root is returned.
+   */
+  cbrt<T extends number | BigNumber | Complex | Unit>(
+    this: MathJsChain<T>,
+    allRoots?: boolean
+  ): MathJsChain<T>
+
+  // Rounding functions grouped for similarity
+
+  /**
+   * Round a value towards plus infinity If x is complex, both real and
+   * imaginary part are rounded towards plus infinity. For matrices, the
+   * function is evaluated element wise.
+   * @param n Number of decimals Default value: 0.
+   */
+  ceil<T extends MathNumericType | MathCollection>(
+    this: MathJsChain<T>,
+    n?: number | BigNumber | MathCollection
+  ): MathJsChain<T>
+  ceil<U extends MathCollection>(
+    this: MathJsChain<MathNumericType | U>,
+    n: U
+  ): MathJsChain<U>
+  ceil(this: MathJsChain<Unit>, unit: Unit): MathJsChain<Unit>
+  ceil<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    unit: Unit
+  ): MathJsChain<U>
+  ceil(
+    this: MathJsChain<Unit>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<Unit>
+  ceil<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<U>
+
+  /**
+   * Round a value towards zero. For matrices, the function is evaluated
+   * element wise.
+   * @param n Number of decimals Default value: 0.
+   */
+  fix<T extends MathNumericType | MathCollection>(
+    this: MathJsChain<T>,
+    n?: number | BigNumber | MathCollection
+  ): MathJsChain<T>
+  fix<U extends MathCollection>(
+    this: MathJsChain<MathNumericType | U>,
+    n: U
+  ): MathJsChain<U>
+  fix(this: MathJsChain<Unit>, unit: Unit): MathJsChain<Unit>
+  fix<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    unit: Unit
+  ): MathJsChain<U>
+  fix(
+    this: MathJsChain<Unit>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<Unit>
+  fix<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<U>
+
+  /**
+   * Round a value towards minus infinity. For matrices, the function is
+   * evaluated element wise.
+   * @param n Number of decimals Default value: 0.
+   */
+  floor<T extends MathNumericType | MathCollection>(
+    this: MathJsChain<T>,
+    n?: number | BigNumber | MathCollection
+  ): MathJsChain<T>
+  floor<U extends MathCollection>(
+    this: MathJsChain<MathNumericType | U>,
+    n: U
+  ): MathJsChain<U>
+  floor(this: MathJsChain<Unit>, unit: Unit): MathJsChain<Unit>
+  floor<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    unit: Unit
+  ): MathJsChain<U>
+  floor(
+    this: MathJsChain<Unit>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<Unit>
+  floor<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<U>
+
+  /**
+   * Round a value towards the nearest integer. For matrices, the function
+   * is evaluated element wise.
+   * @param n Number of decimals Default value: 0.
+   */
+  round<T extends MathNumericType | MathCollection>(
+    this: MathJsChain<T>,
+    n?: number | BigNumber | MathCollection
+  ): MathJsChain<T>
+  round<U extends MathCollection>(
+    this: MathJsChain<MathNumericType | U>,
+    n: U
+  ): MathJsChain<U>
+  round(this: MathJsChain<Unit>, unit: Unit): MathJsChain<Unit>
+  round<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    unit: Unit
+  ): MathJsChain<U>
+  round(
+    this: MathJsChain<Unit>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<Unit>
+  round<U extends MathCollection<Unit>>(
+    this: MathJsChain<U>,
+    n: number | BigNumber,
+    unit: Unit
+  ): MathJsChain<U>
+
+  // End of rounding group
+
+  /**
+   * Compute the cube of a value, x * x * x. For matrices, the function is
+   * evaluated element wise.
+   */
+  cube<T extends MathNumericType | Unit>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Divide two values, x / y. To divide matrices, x is multiplied with
+   * the inverse of y: x * inv(y).
+   * @param y Denominator
+   */
+  divide(this: MathJsChain<Unit>, y: Unit): MathJsChain<Unit | number>
+  divide(this: MathJsChain<Unit>, y: number): MathJsChain<Unit>
+  divide(this: MathJsChain<number>, y: number): MathJsChain<number>
+  divide(this: MathJsChain<MathType>, y: MathType): MathJsChain<MathType>
+
+  /**
+   * Divide two matrices element wise. The function accepts both matrices
+   * and scalar values.
+   * @param y Denominator
+   */
+  dotDivide<T extends MathCollection>(
+    this: MathJsChain<T>,
+    y: MathType
+  ): MathJsChain<T>
+  dotDivide<T extends MathCollection>(
+    this: MathJsChain<MathType>,
+    y: T
+  ): MathJsChain<T>
+  dotDivide(this: MathJsChain<Unit>, y: MathType): MathJsChain<Unit>
+  dotDivide(this: MathJsChain<MathType>, y: Unit): MathJsChain<Unit>
+  dotDivide(
+    this: MathJsChain<MathNumericType>,
+    y: MathNumericType
+  ): MathJsChain<MathNumericType>
+
+  /**
+   * Multiply two matrices element wise. The function accepts both
+   * matrices and scalar values.
+   * @param y Right hand value
+   */
+  dotMultiply<T extends MathCollection>(
+    this: MathJsChain<T>,
+    y: MathType
+  ): MathJsChain<T>
+  dotMultiply<T extends MathCollection>(
+    this: MathJsChain<MathType>,
+    y: T
+  ): MathJsChain<T>
+  dotMultiply(this: MathJsChain<Unit>, y: MathType): MathJsChain<Unit>
+  dotMultiply(this: MathJsChain<MathType>, y: Unit): MathJsChain<Unit>
+  dotMultiply(
+    this: MathJsChain<MathNumericType>,
+    y: MathNumericType
+  ): MathJsChain<MathNumericType>
+
+  /**
+   * Calculates the power of x to y element wise.
+   * @param y The exponent
+   */
+  dotPow<T extends MathType>(this: MathJsChain<T>, y: MathType): MathJsChain<T>
+
+  /**
+   * Calculate the exponent of a value. For matrices, the function is
+   * evaluated element wise.
+   */
+  exp<T extends number | BigNumber | Complex>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the value of subtracting 1 from the exponential value. For
+   * matrices, the function is evaluated element wise.
+   */
+  expm1<T extends number | BigNumber | Complex>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the greatest common divisor for two or more values or
+   * arrays. For matrices, the function is evaluated element wise.
+   */
+  gcd<T extends number | BigNumber | Fraction | Matrix>(
+    this: MathJsChain<T[]>,
+    ...args: T[]
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hypotenuse of a list with values. The hypotenuse is
+   * defined as: hypot(a, b, c, ...) = sqrt(a^2 + b^2 + c^2 + ...) For
+   * matrix input, the hypotenuse is calculated for all values in the
+   * matrix.
+   */
+  hypot<T extends number | BigNumber>(this: MathJsChain<T[]>): MathJsChain<T>
+
+  /**
+   * Calculate the least common multiple for two or more values or arrays.
+   * lcm is defined as: lcm(a, b) = abs(a * b) / gcd(a, b) For matrices,
+   * the function is evaluated element wise.
+   * @param b An integer number
+   */
+  lcm<T extends number | BigNumber | MathCollection>(
+    this: MathJsChain<T>,
+    b: T
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the logarithm of a value. For matrices, the function is
+   * evaluated element wise.
+   * @param base Optional base for the logarithm. If not provided, the
+   * natural logarithm of x is calculated. Default value: e.
+   */
+  log<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Calculate the 10-base of a value. This is the same as calculating
+   * log(x, 10). For matrices, the function is evaluated element wise.
+   */
+
+  log10<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the logarithm of a value+1. For matrices, the function is
+   * evaluated element wise.
+   */
+  log1p(
+    this: MathJsChain<number>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<number>
+  log1p(
+    this: MathJsChain<BigNumber>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<BigNumber>
+  log1p(
+    this: MathJsChain<Complex>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<Complex>
+  log1p(
+    this: MathJsChain<MathArray>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<MathArray>
+  log1p(
+    this: MathJsChain<Matrix>,
+    base?: number | BigNumber | Complex
+  ): MathJsChain<Matrix>
+
+  /**
+   * Calculate the 2-base of a value. This is the same as calculating
+   * log(x, 2). For matrices, the function is evaluated element wise.
+   */
+
+  log2<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculates the modulus, the remainder of an integer division. For
+   * matrices, the function is evaluated element wise. The modulus is
+   * defined as: x - y * floor(x / y)
+   * @see http://en.wikipedia.org/wiki/Modulo_operation.
+   * @param y Divisor
+   */
+  mod<T extends number | BigNumber | bigint | Fraction | MathCollection>(
+    this: MathJsChain<T>,
+    y: number | BigNumber | bigint | Fraction | MathCollection
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Multiply two values, x * y. The result is squeezed. For matrices, the
+   * matrix product is calculated.
+   * @param y The second value to multiply
+   */
+  multiply<T extends MathCollection>(
+    this: MathJsChain<T>,
+    y: MathType
+  ): MathJsChain<T>
+  multiply(this: MathJsChain<Unit>, y: Unit): MathJsChain<Unit>
+  multiply(this: MathJsChain<number>, y: number): MathJsChain<number>
+  multiply(this: MathJsChain<MathType>, y: MathType): MathJsChain<MathType>
+
+  /**
+   * Calculate the norm of a number, vector or matrix. The second
+   * parameter p is optional. If not provided, it defaults to 2.
+   * @param p Vector space. Supported numbers include Infinity and
+   * -Infinity. Supported strings are: 'inf', '-inf', and 'fro' (The
+   * Frobenius norm) Default value: 2.
+   */
+  norm(
+    this: MathJsChain<number | BigNumber | Complex | MathCollection>,
+    p?: number | BigNumber | string
+  ): MathJsChain<number | BigNumber>
+
+  /**
+   * Calculate the nth root of a value. The principal nth root of a
+   * positive real number A, is the positive real solution of the equation
+   * x^root = A For matrices, the function is evaluated element wise.
+   * @param root The root. Default value: 2.
+   */
+  nthRoot(
+    this: MathJsChain<number | BigNumber | MathCollection | Complex>,
+    root?: number | BigNumber
+  ): MathJsChain<number | Complex | MathCollection>
+
+  /**
+   * Calculates the power of x to y, x ^ y. Matrix exponentiation is
+   * supported for square matrices x, and positive integer exponents y.
+   * @param y The exponent
+   */
+  pow(
+    this: MathJsChain<MathType>,
+    y: number | BigNumber | bigint | Complex
+  ): MathJsChain<MathType>
+
+  /**
+   * Compute the sign of a value. The sign of a value x is: 1 when x > 1
+   * -1 when x < 0 0 when x == 0 For matrices, the function is evaluated
+   * element wise.
+   * @param x The number for which to determine the sign
+   * @returns The sign of x
+   */
+  sign<T extends MathType>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Calculate the square root of a value. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  sqrt<T extends number | BigNumber | Complex | MathCollection | Unit>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Compute the square of a value, x * x. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  square<T extends MathType>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Subtract two values, x - y. For matrices, the function is evaluated
+   * element wise.
+   * @param y Value to subtract from x
+   */
+  subtract<T extends MathType>(this: MathJsChain<T>, y: T): MathJsChain<T>
+
+  /**
+   * Inverse the sign of a value, apply a unary minus operation. For
+   * matrices, the function is evaluated element wise. Boolean values and
+   * strings will be converted to a number. For complex numbers, both real
+   * and complex value are inverted.
+   */
+
+  unaryMinus<T extends MathType>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Unary plus operation. Boolean values and strings will be converted to
+   * a number, numeric values will be returned as is. For matrices, the
+   * function is evaluated element wise.
+   */
+
+  unaryPlus<T extends string | MathType>(this: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Calculate the extended greatest common divisor for two values. See
+   * http://en.wikipedia.org/wiki/Extended_Euclidean_algorithm.
+   * @param b An integer number
+   */
+  xgcd(
+    this: MathJsChain<number | BigNumber>,
+    b: number | BigNumber
+  ): MathJsChain<MathArray>
+
+  /**
+   * Count the number of elements of a matrix, array or string.
+   */
+  count(this: MathJsChain<MathCollection>): MathJsChain<number>
+  count(this: MathJsChain<string>): MathJsChain<number>
+
+  /**
+   * Compute the sum of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the sum of all elements will be
+   * calculated.
+   */
+  sum(
+    this: MathJsChain<Array<number | BigNumber | Fraction>>
+  ): MathJsChain<number>
+  sum(this: MathJsChain<MathCollection>): MathJsChain<number>
+  /*************************************************************************
+   * Bitwise functions
+   ************************************************************************/
+
+  /**
+   * Bitwise AND two values, x & y. For matrices, the function is
+   * evaluated element wise.
+   * @param y Second value to and
+   */
+  bitAnd<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>,
+    y: number | BigNumber | bigint | MathCollection
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Bitwise NOT value, ~x. For matrices, the function is evaluated
+   * element wise. For units, the function is evaluated on the best prefix
+   * base.
+   */
+
+  bitNot<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Bitwise OR two values, x | y. For matrices, the function is evaluated
+   * element wise. For units, the function is evaluated on the lowest
+   * print base.
+   * @param y Second value to or
+   */
+  bitOr<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>,
+    y: T
+  ): MathJsChain<T>
+
+  /**
+   * Bitwise XOR two values, x ^ y. For matrices, the function is
+   * evaluated element wise.
+   * @param y Second value to xor
+   */
+  bitXor<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>,
+    y: number | BigNumber | bigint | MathCollection
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Bitwise left logical shift of a value x by y number of bits, x << y.
+   * For matrices, the function is evaluated element wise. For units, the
+   * function is evaluated on the best prefix base.
+   * @param y Amount of shifts
+   */
+  leftShift<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>,
+    y: number | BigNumber | bigint
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Bitwise right arithmetic shift of a value x by y number of bits, x >>
+   * y. For matrices, the function is evaluated element wise. For units,
+   * the function is evaluated on the best prefix base.
+   * @param y Amount of shifts
+   */
+  rightArithShift<T extends number | BigNumber | bigint | MathCollection>(
+    this: MathJsChain<T>,
+    y: number | BigNumber | bigint
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Bitwise right logical shift of value x by y number of bits, x >>> y.
+   * For matrices, the function is evaluated element wise. For units, the
+   * function is evaluated on the best prefix base.
+   * @param y Amount of shifts
+   */
+  rightLogShift<T extends number | MathCollection>(
+    this: MathJsChain<T>,
+    y: number
+  ): MathJsChain<NoLiteralType<T>>
+
+  /*************************************************************************
+   * Combinatorics functions
+   ************************************************************************/
+
+  /**
+   * The Bell Numbers count the number of partitions of a set. A partition
+   * is a pairwise disjoint subset of S whose union is S. bellNumbers only
+   * takes integer arguments. The following condition must be enforced: n
+   * >= 0
+   */
+
+  bellNumbers(this: MathJsChain<number>): MathJsChain<number>
+  bellNumbers(this: MathJsChain<BigNumber>): MathJsChain<BigNumber>
+
+  /**
+   * The Catalan Numbers enumerate combinatorial structures of many
+   * different types. catalan only takes integer arguments. The following
+   * condition must be enforced: n >= 0
+   */
+
+  catalan(this: MathJsChain<number>): MathJsChain<number>
+  catalan(this: MathJsChain<BigNumber>): MathJsChain<BigNumber>
+
+  /**
+   * The composition counts of n into k parts. Composition only takes
+   * integer arguments. The following condition must be enforced: k <= n.
+   * @param k Number of objects in the subset
+   */
+  composition<T extends number | BigNumber>(
+    this: MathJsChain<T>,
+    k: number | BigNumber
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * The Stirling numbers of the second kind, counts the number of ways to
+   * partition a set of n labelled objects into k nonempty unlabelled
+   * subsets. stirlingS2 only takes integer arguments. The following
+   * condition must be enforced: k <= n. If n = k or k = 1, then s(n,k) =
+   * 1
+   * @param k Number of objects in the subset
+   */
+  stirlingS2<T extends number | BigNumber>(
+    this: MathJsChain<T>,
+    k: number | BigNumber
+  ): MathJsChain<NoLiteralType<T>>
+
+  /*************************************************************************
+   * Complex functions
+   ************************************************************************/
+
+  /**
+   * Compute the argument of a complex value. For a complex number a + bi,
+   * the argument is computed as atan2(b, a). For matrices, the function
+   * is evaluated element wise.
+   */
+
+  arg(this: MathJsChain<number | Complex>): MathJsChain<number>
+  arg(this: MathJsChain<BigNumber | Complex>): MathJsChain<BigNumber>
+  arg(this: MathJsChain<MathArray>): MathJsChain<MathArray>
+  arg(this: MathJsChain<Matrix>): MathJsChain<Matrix>
+
+  /**
+   * Compute the complex conjugate of a complex value. If x = a+bi, the
+   * complex conjugate of x is a - bi. For matrices, the function is
+   * evaluated element wise.
+   */
+  conj<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Get the imaginary part of a complex number. For a complex number a +
+   * bi, the function returns b. For matrices, the function is evaluated
+   * element wise.
+   */
+  im(this: MathJsChain<number | Complex>): MathJsChain<number>
+  im(this: MathJsChain<BigNumber>): MathJsChain<BigNumber>
+  im(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Get the real part of a complex number. For a complex number a + bi,
+   * the function returns a. For matrices, the function is evaluated
+   * element wise.
+   */
+  re(this: MathJsChain<number | Complex>): MathJsChain<number>
+  re(this: MathJsChain<BigNumber>): MathJsChain<BigNumber>
+  re(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /*************************************************************************
+   * Geometry functions
+   ************************************************************************/
+
+  /**
+   * Calculates: The eucledian distance between two points in 2 and 3
+   * dimensional spaces. Distance between point and a line in 2 and 3
+   * dimensional spaces. Pairwise distance between a set of 2D or 3D
+   * points NOTE: When substituting coefficients of a line(a, b and c),
+   * use ax + by + c = 0 instead of ax + by = c For parametric equation of
+   * a 3D line, x0, y0, z0, a, b, c are from: (x−x0, y−y0, z−z0) = t(a, b,
+   * c)
+   * @param y Coordinates of the second point
+   */
+  distance(
+    this: MathJsChain<MathCollection | object>,
+    y: MathCollection | object
+  ): MathJsChain<number | BigNumber>
+
+  /**
+   * Calculates the point of intersection of two lines in two or three
+   * dimensions and of a line and a plane in three dimensions. The inputs
+   * are in the form of arrays or 1 dimensional matrices. The line
+   * intersection functions return null if the lines do not meet. Note:
+   * Fill the plane coefficients as x + y + z = c and not as x + y + z + c
+   * = 0.
+   * @param x Co-ordinates of second end-point of first line
+   * @param y Co-ordinates of first end-point of second line OR
+   * Coefficients of the plane's equation
+   * @param z Co-ordinates of second end-point of second line OR null if
+   * the calculation is for line and plane
+   */
+  intersect(
+    this: MathJsChain<MathCollection>,
+    x: MathCollection,
+    y: MathCollection,
+    z?: MathCollection
+  ): MathJsChain<MathArray>
+
+  /*************************************************************************
+   * Logical functions
+   ************************************************************************/
+
+  /**
+   * Logical and. Test whether two values are both defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param y Second value to and
+   */
+  and(
+    this: MathJsChain<
+      number | BigNumber | bigint | Complex | Unit | MathCollection
+    >,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Logical not. Flips boolean value of a given parameter. For matrices,
+   * the function is evaluated element wise.
+   */
+  not(
+    this: MathJsChain<
+      number | BigNumber | bigint | Complex | Unit | MathCollection
+    >
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Logical or. Test if at least one value is defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param y Second value to or
+   */
+  or(
+    this: MathJsChain<
+      number | BigNumber | bigint | Complex | Unit | MathCollection
+    >,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Logical xor. Test whether one and only one value is defined with a
+   * nonzero/nonempty value. For matrices, the function is evaluated
+   * element wise.
+   * @param y Second value to xor
+   */
+  xor(
+    this: MathJsChain<
+      number | BigNumber | bigint | Complex | Unit | MathCollection
+    >,
+    y: number | BigNumber | bigint | Complex | Unit | MathCollection
+  ): MathJsChain<boolean | MathCollection>
+
+  /*************************************************************************
+   * Matrix functions
+   ************************************************************************/
+
+  /**
+   * Concatenate two or more matrices. dim: number is a zero-based
+   * dimension over which to concatenate the matrices. By default the last
+   * dimension of the matrices.
+   */
+
+  concat(
+    this: MathJsChain<Array<MathCollection | number | BigNumber>>
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Calculate the cross product for two vectors in three dimensional
+   * space. The cross product of A = [a1, a2, a3] and B =[b1, b2, b3] is
+   * defined as: cross(A, B) = [ a2 * b3 - a3 * b2, a3 * b1 - a1 * b3, a1
+   * * b2 - a2 * b1 ]
+   * @param y Second vector
+   */
+  cross(
+    this: MathJsChain<MathCollection>,
+    y: MathCollection
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Transpose and complex conjugate a matrix. All values of the matrix are
+   * reflected over its main diagonal and then the complex conjugate is taken.
+   * This is equivalent to complex conjugation for scalars and vectors.
+   */
+  ctranspose(this: MathJsChain<MathCollection>): MathJsChain<MathCollection>
+
+  /**
+   * Calculate the difference between adjacent elements of the chained matrix or array.
+   * @param dim The dimension to apply the difference on.
+   */
+  diff<T extends MathCollection>(
+    this: MathJsChain<T>,
+    dim?: number | BigNumber
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the determinant of a matrix.
+   */
+
+  det(this: MathJsChain<MathCollection>): MathJsChain<number>
+
+  /**
+   * Create a diagonal matrix or retrieve the diagonal of a matrix. When x
+   * is a vector, a matrix with vector x on the diagonal will be returned.
+   * When x is a two dimensional matrix, the matrixes kth diagonal will be
+   * returned as vector. When k is positive, the values are placed on the
+   * super diagonal. When k is negative, the values are placed on the sub
+   * diagonal.
+   * @param k The diagonal where the vector will be filled in or
+   * retrieved. Default value: 0.
+   * @param format The matrix storage format. Default value: 'dense'.
+   */
+  diag(this: MathJsChain<MathCollection>, format?: string): MathJsChain<Matrix>
+  diag(
+    this: MathJsChain<MathCollection>,
+    k: number | BigNumber,
+    format?: string
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Calculate the dot product of two vectors. The dot product of A = [a1,
+   * a2, a3, ..., an] and B = [b1, b2, b3, ..., bn] is defined as: dot(A,
+   * B) = a1 * b1 + a2 * b2 + a3 * b3 + ... + an * bn
+   * @param y Second vector
+   */
+  dot(this: MathJsChain<MathCollection>, y: MathCollection): MathJsChain<number>
+
+  /**
+   * Compute the matrix exponential, expm(A) = e^A. The matrix must be
+   * square. Not to be confused with exp(a), which performs element-wise
+   * exponentiation. The exponential is calculated using the Padé
+   * approximant with scaling and squaring; see “Nineteen Dubious Ways to
+   * Compute the Exponential of a Matrix,” by Moler and Van Loan.
+   */
+
+  expm(this: MathJsChain<Matrix>): MathJsChain<Matrix>
+
+  /**
+   * Performs a real Schur decomposition of the real matrix A = UTU' where U is orthogonal
+   * and T is upper quasi-triangular.
+   * https://en.wikipedia.org/wiki/Schur_decomposition
+   * @returns Object containing both matrix U and T of the Schur Decomposition A=UTU'
+   */
+  schur(this: MathJsChain<MathCollection>): SchurDecomposition
+
+  /**
+   * Solves the Continuous-time Lyapunov equation AP+PA'=Q for P, where Q is a positive semidefinite
+   * matrix.
+   * https://en.wikipedia.org/wiki/Lyapunov_equation
+   * @param Q  Matrix Q
+   * @returns  Matrix P solution to the Continuous-time Lyapunov equation AP+PA'=Q
+   */
+  lyap(
+    this: MathJsChain<MathCollection>,
+    Q: MathCollection
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Create a 2-dimensional identity matrix with size m x n or n x n. The
+   * matrix has ones on the diagonal and zeros elsewhere.
+   * @param format The Matrix storage format
+   */
+  identity(
+    this: MathJsChain<number | number[] | MathCollection>,
+    format?: string
+  ): MathJsChain<MathCollection | number>
+
+  /**
+   * @param n The y dimension for the matrix
+   * @param format The Matrix storage format
+   */
+  identity(
+    this: MathJsChain<number>,
+    n: number,
+    format?: string
+  ): MathJsChain<MathCollection | number>
+
+  /**
+   * Filter the items in an array or one dimensional matrix.
+   */
+  filter(
+    this: MathJsChain<MathCollection | string[]>,
+    test:
+      | ((
+          // eslint-disable-next-line @typescript-eslint/no-explicit-any
+          value: any,
+          index: number[],
+          matrix: MathCollection | string[]
+        ) => boolean)
+      | RegExp
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Flatten a multi dimensional matrix into a single dimensional matrix.
+   */
+
+  flatten<T extends MathCollection>(x: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given
+   * callback function.
+   */
+  forEach<T extends MathCollection>(
+    this: MathJsChain<T>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (value: any, index: number[], matrix: T) => void
+  ): void
+
+  /**
+   * Calculate the inverse of a square matrix.
+   */
+
+  inv<T extends number | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Calculate the Kronecker product of two matrices or vectors
+   * @param y Second vector
+   */
+  kron(
+    this: MathJsChain<MathCollection>,
+    y: MathCollection
+  ): MathJsChain<Matrix>
+
+  /**
+   * Iterate over all elements of a matrix/array, and executes the given
+   * callback function.
+   * @param callback The callback function is invoked with three
+   * parameters: the value of the element, the index of the element, and
+   * the Matrix/array being traversed.
+   */
+  map<T extends MathCollection>(
+    this: MathJsChain<T>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback: (value: any, index: number[], matrix: T) => MathType | string
+  ): MathJsChain<T>
+
+  /**
+   * Create a matrix filled with ones. The created matrix can have one or
+   * multiple dimensions.
+   * @param format The matrix storage format
+   */
+  ones(
+    this: MathJsChain<number | number[] | BigNumber | BigNumber[]>,
+    format?: string
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Partition-based selection of an array or 1D matrix. Will find the kth
+   * smallest value, and mutates the input array. Uses Quickselect.
+   * @param k The kth smallest value to be retrieved; zero-based index
+   * @param compare  An optional comparator function. The function is
+   * called as compare(a, b), and must return 1 when a > b, -1 when a < b,
+   * and 0 when a == b. Default value: 'asc'.
+   */
+  partitionSelect(
+    this: MathJsChain<MathCollection>,
+    k: number,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    compare?: 'asc' | 'desc' | ((a: any, b: any) => number)
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Create an array from a range. By default, the range end is excluded.
+   * This can be customized by providing an extra parameter includeEnd.
+   * @param end End of the range, excluded by default, included when
+   * parameter includeEnd=true
+   * @param step Step size. Default value is 1.
+   * @param includeEnd: Option to specify whether to include the end or
+   * not. False by default
+   */
+  range(this: MathJsChain<string>, includeEnd?: boolean): MathJsChain<Matrix>
+  range(
+    this: MathJsChain<number | BigNumber>,
+    end: number | BigNumber,
+    includeEnd?: boolean
+  ): MathJsChain<Matrix>
+  range(
+    this: MathJsChain<number | BigNumber | Unit>,
+    end: number | BigNumber | Unit,
+    step: number | BigNumber | Unit,
+    includeEnd?: boolean
+  ): MathJsChain<Matrix>
+
+  /**
+   * Reshape a multi dimensional array to fit the specified dimensions
+   * @param sizes One dimensional array with integral sizes for each
+   * dimension
+   */
+  reshape<T extends MathCollection>(
+    this: MathJsChain<T>,
+    sizes: number[]
+  ): MathJsChain<T>
+
+  /**
+   * Resize a matrix
+   * @param size One dimensional array with numbers
+   * @param defaultValue Zero by default, except in case of a string, in
+   * that case defaultValue = ' ' Default value: 0.
+   */
+  resize<T extends MathCollection>(
+    this: MathJsChain<T>,
+    size: MathCollection,
+    defaultValue?: number | string
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the size of a matrix or scalar.
+   */
+  size(
+    this: MathJsChain<
+      boolean | number | Complex | Unit | string | MathCollection
+    >
+  ): MathJsChain<MathCollection>
+
+  /**
+   * Sort the items in a matrix
+   * @param compare An optional _comparator function or name. The function
+   * is called as compare(a, b), and must return 1 when a > b, -1 when a <
+   * b, and 0 when a == b. Default value: ‘asc’
+   */
+  sort<T extends MathCollection>(
+    this: MathJsChain<T>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    compare: ((a: any, b: any) => number) | 'asc' | 'desc' | 'natural'
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the principal square root of a square matrix. The principal
+   * square root matrix X of another matrix A is such that X * X = A.
+   */
+
+  sqrtm<T extends MathCollection>(A: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Squeeze a matrix, remove inner and outer singleton dimensions from a
+   * matrix.
+   */
+
+  squeeze<T extends MathCollection>(x: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Get or set a subset of a matrix or string.
+   * @param index For each dimension, an index or list of indices to get or set
+   * @param replacement An array, matrix, or scalar. If provided, the
+   * subset is replaced with replacement. If not provided, the subset is
+   * returned
+   * @param defaultValue Default value, filled in on new entries when the
+   * matrix is resized. If not provided, math.matrix elements will be left
+   * undefined. Default value: undefined.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  subset<T extends MathCollection | string>(
+    this: MathJsChain<T>,
+    index: Index,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    replacement?: any,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    defaultValue?: any
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the trace of a matrix: the sum of the elements on the main
+   * diagonal of a square matrix.
+   */
+
+  trace(this: MathJsChain<MathCollection>): MathJsChain<number>
+
+  /**
+   * Transpose a matrix. All values of the matrix are reflected over its
+   * main diagonal. Only two dimensional matrices are supported.
+   */
+
+  transpose<T extends MathCollection>(x: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Create a matrix filled with zeros. The created matrix can have one or
+   * multiple dimensions.
+   * @param format The matrix storage format
+   * @returns A matrix filled with zeros
+   */
+  zeros(
+    this: MathJsChain<number | number[] | BigNumber | BigNumber[]>,
+    format?: string
+  ): MathJsChain<MathCollection>
+
+  /*************************************************************************
+   * Probability functions
+   ************************************************************************/
+
+  /**
+   * Compute the number of ways of picking k unordered outcomes from n
+   * possibilities. Combinations only takes integer arguments. The
+   * following condition must be enforced: k <= n.
+   * @param k Number of objects in the subset
+   */
+  combinations<T extends number | BigNumber>(
+    n: MathJsChain<T>,
+    k: number | BigNumber
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Compute the factorial of a value Factorial only supports an integer
+   * value as argument. For matrices, the function is evaluated element
+   * wise.
+   */
+
+  factorial<T extends number | BigNumber | MathCollection>(
+    n: MathJsChain<T>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Compute the gamma function of a value using Lanczos approximation for
+   * small values, and an extended Stirling approximation for large
+   * values. For matrices, the function is evaluated element wise.
+   */
+
+  gamma<T extends number | BigNumber | Complex | MathCollection>(
+    n: MathJsChain<T>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Calculate the Kullback-Leibler (KL) divergence between two
+   * distributions
+   * @param p Second vector
+   */
+  kldivergence(
+    this: MathJsChain<MathCollection>,
+    p: MathCollection
+  ): MathJsChain<number>
+
+  /**
+   * Multinomial Coefficients compute the number of ways of picking a1,
+   * a2, ..., ai unordered outcomes from n possibilities. multinomial
+   * takes one array of integers as an argument. The following condition
+   * must be enforced: every ai <= 0
+   */
+
+  multinomial<T extends number | BigNumber>(
+    a: MathJsChain<T[]>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Compute the number of ways of obtaining an ordered subset of k
+   * elements from a set of n elements. Permutations only takes integer
+   * arguments. The following condition must be enforced: k <= n.
+   * @param k The number of objects in the subset
+   */
+  permutations<T extends number | BigNumber>(
+    n: MathJsChain<T>,
+    k?: number | BigNumber
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Random pick a value from a one dimensional array. Array element is
+   * picked using a random function with uniform distribution.
+   * @param number An int or float
+   * @param weights An array of ints or floats
+   */
+  pickRandom<T>(this: MathJsChain<T[]>): MathJsChain<T>
+  pickRandom<T>(this: MathJsChain<T[]>, number: number): MathJsChain<T[]>
+  pickRandom<T>(
+    this: MathJsChain<T[]>,
+    number: number,
+    weights: number[]
+  ): MathJsChain<T[]>
+
+  /**
+   * Return a random number larger or equal to min and smaller than max
+   * using a uniform distribution.
+   * @param min Minimum boundary for the random value, included
+   * @param max Maximum boundary for the random value, excluded
+   */
+  random(this: MathJsChain<number>, max?: number): MathJsChain<number>
+
+  // tslint:disable-next-line unified-signatures
+  random<T extends MathCollection>(
+    this: MathJsChain<T>,
+    min?: number,
+    max?: number
+  ): MathJsChain<T>
+
+  /**
+   * Return a random integer number larger or equal to min and smaller
+   * than max using a uniform distribution.
+   * @param min Minimum boundary for the random value, included
+   * @param max Maximum boundary for the random value, excluded
+   */
+  randomInt<T extends MathCollection>(
+    this: MathJsChain<T>,
+    max?: number
+  ): MathJsChain<T>
+  randomInt<T extends MathCollection>(
+    this: MathJsChain<T>,
+    max?: number
+  ): MathJsChain<T>
+  // tslint:disable-next-line unified-signatures
+  randomInt<T extends MathCollection>(
+    this: MathJsChain<T>,
+    min: number,
+    max: number
+  ): MathJsChain<T>
+
+  /*************************************************************************
+   * Relational functions
+   ************************************************************************/
+
+  /**
+   * Compare two values. Returns 1 when x > y, -1 when x < y, and 0 when x
+   * == y. x and y are considered equal when the relative difference
+   * between x and y is smaller than the configured relTol and absTol. The function
+   * cannot be used to compare values smaller than approximately 2.22e-16.
+   * For matrices, the function is evaluated element wise.
+   * @param y Second value to compare
+   */
+  compare(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<number | BigNumber | Fraction | MathCollection>
+
+  /**
+   * Compare two values of any type in a deterministic, natural way. For
+   * numeric values, the function works the same as math.compare. For
+   * types of values that can’t be compared mathematically, the function
+   * compares in a natural way.
+   * @param y Second value to compare
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  compareNatural(this: MathJsChain<any>, y: any): MathJsChain<number>
+
+  /**
+   * Compare two strings lexically. Comparison is case sensitive. Returns
+   * 1 when x > y, -1 when x < y, and 0 when x == y. For matrices, the
+   * function is evaluated element wise.
+   * @param y Second string to compare
+   */
+  compareText(
+    this: MathJsChain<string | MathCollection>,
+    y: string | MathCollection
+  ): MathJsChain<number | MathCollection>
+
+  /**
+   * Test element wise whether two matrices are equal. The function
+   * accepts both matrices and scalar values.
+   * @param y Second amtrix to compare
+   */
+  deepEqual(this: MathJsChain<MathType>, y: MathType): MathJsChain<MathType>
+
+  /**
+   * Test whether two values are equal.
+   *
+   * The function tests whether the relative difference between x and y is
+   * smaller than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16. For matrices, the
+   * function is evaluated element wise. In case of complex numbers, x.re
+   * must equal y.re, and x.im must equal y.im. Values null and undefined
+   * are compared strictly, thus null is only equal to null and nothing
+   * else, and undefined is only equal to undefined and nothing else.
+   * @param y Second value to compare
+   */
+  equal(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Check equality of two strings. Comparison is case sensitive. For
+   * matrices, the function is evaluated element wise.
+   * @param y Second string to compare
+   */
+  equalText(
+    this: MathJsChain<string | MathCollection>,
+    y: string | MathCollection
+  ): MathJsChain<number | MathCollection>
+
+  /**
+   * Test whether value x is larger than y. The function returns true when
+   * x is larger than y and the relative difference between x and y is
+   * larger than the configured relTol and absTol. The function cannot be used to
+   * compare values smaller than approximately 2.22e-16. For matrices, the
+   * function is evaluated element wise.
+   * @param y Second value to compare
+   */
+  larger(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Test whether value x is larger or equal to y. The function returns
+   * true when x is larger than y or the relative difference between x and
+   * y is smaller than the configured relTol and absTol. The function cannot be used
+   * to compare values smaller than approximately 2.22e-16. For matrices,
+   * the function is evaluated element wise.
+   * @param y Second value to vcompare
+   */
+  largerEq(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Test whether value x is smaller than y. The function returns true
+   * when x is smaller than y and the relative difference between x and y
+   * is smaller than the configured relTol and absTol. The function cannot be used
+   * to compare values smaller than approximately 2.22e-16. For matrices,
+   * the function is evaluated element wise.
+   * @param y Second value to vcompare
+   */
+  smaller(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Test whether value x is smaller or equal to y. The function returns
+   * true when x is smaller than y or the relative difference between x
+   * and y is smaller than the configured relTol and absTol. The function cannot be
+   * used to compare values smaller than approximately 2.22e-16. For
+   * matrices, the function is evaluated element wise.
+   * @param y Second value to compare
+   */
+  smallerEq(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /**
+   * Determines if two expressions are symbolically equal, i.e. one is the
+   * result of valid algebraic manipulations on the other.
+   * @param {Node} expr2 The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean} Returns true if a valid manipulation making the
+   * expressions equal is found.
+   */
+  symbolicEqual(
+    this: MathJsChain<MathNode>,
+    expr2: MathNode,
+    options?: SimplifyOptions
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether two values are unequal. The function tests whether the
+   * relative difference between x and y is larger than the configured
+   * relTol and absTol. The function cannot be used to compare values smaller than
+   * approximately 2.22e-16. For matrices, the function is evaluated
+   * element wise. In case of complex numbers, x.re must unequal y.re, or
+   * x.im must unequal y.im. Values null and undefined are compared
+   * strictly, thus null is unequal with everything except null, and
+   * undefined is unequal with everything except undefined.
+   * @param y Second value to vcompare
+   */
+  unequal(
+    this: MathJsChain<MathType | string>,
+    y: MathType | string
+  ): MathJsChain<boolean | MathCollection>
+
+  /*************************************************************************
+   * Set functions
+   ************************************************************************/
+
+  /**
+   * Create the cartesian product of two (multi)sets. Multi-dimension
+   * arrays will be converted to single-dimension arrays and the values
+   * will be sorted in ascending order before the operation.
+   * @param a2 A (multi)set
+   */
+  setCartesian<T extends MathCollection>(
+    this: MathJsChain<T>,
+    a2: MathCollection
+  ): MathJsChain<T>
+
+  /**
+   * Create the difference of two (multi)sets: every element of set1, that
+   * is not the element of set2. Multi-dimension arrays will be converted
+   * to single-dimension arrays before the operation
+   * @param a2 A (multi)set
+   */
+  setDifference<T extends MathCollection>(
+    this: MathJsChain<T>,
+    a2: MathCollection
+  ): MathJsChain<T>
+
+  /**
+   * Collect the distinct elements of a multiset. A multi-dimension array
+   * will be converted to a single-dimension array before the operation.
+   */
+
+  setDistinct<T extends MathCollection>(a: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Create the intersection of two (multi)sets. Multi-dimension arrays
+   * will be converted to single-dimension arrays before the operation.
+   * @param a2 A (multi)set
+   */
+  setIntersect<T extends MathCollection>(
+    this: MathJsChain<T>,
+    a2: MathCollection
+  ): MathJsChain<T>
+
+  /**
+   * Check whether a (multi)set is a subset of another (multi)set. (Every
+   * element of set1 is the element of set2.) Multi-dimension arrays will
+   * be converted to single-dimension arrays before the operation.
+   * @param a2 A (multi)set
+   */
+  setIsSubset(
+    this: MathJsChain<MathCollection>,
+    a2: MathCollection
+  ): MathJsChain<boolean>
+
+  /**
+   * Count the multiplicity of an element in a multiset. A multi-dimension
+   * array will be converted to a single-dimension array before the
+   * operation.
+   * @param a A multiset
+   */
+  setMultiplicity(
+    e: MathJsChain<MathNumericType>,
+    a: MathCollection
+  ): MathJsChain<number>
+
+  /**
+   * Create the powerset of a (multi)set. (The powerset contains very
+   * possible subsets of a (multi)set.) A multi-dimension array will be
+   * converted to a single-dimension array before the operation.
+   */
+
+  setPowerset<T extends MathCollection>(a: MathJsChain<T>): MathJsChain<T>
+
+  /**
+   * Count the number of elements of a (multi)set. When a second parameter
+   * is ‘true’, count only the unique values. A multi-dimension array will
+   * be converted to a single-dimension array before the operation.
+   */
+
+  setSize(this: MathJsChain<MathCollection>): MathJsChain<number>
+
+  /**
+   * Create the symmetric difference of two (multi)sets. Multi-dimension
+   * arrays will be converted to single-dimension arrays before the
+   * operation.
+   * @param a2 A (multi)set
+   */
+  setSymDifference<T extends MathCollection>(
+    this: MathJsChain<T>,
+    a2: MathCollection
+  ): MathJsChain<T>
+
+  /**
+   * Create the union of two (multi)sets. Multi-dimension arrays will be
+   * converted to single-dimension arrays before the operation.
+   * @param a2 A (multi)set
+   */
+  setUnion<T extends MathCollection>(
+    this: MathJsChain<T>,
+    a2: MathCollection
+  ): MathJsChain<T>
+
+  /*************************************************************************
+   * Signal functions
+   ************************************************************************/
+  /**
+   * Compute the transfer function of a zero-pole-gain model.
+   */
+  zpk2tf<T extends MathCollection>(
+    this: MathJsChain<T>, // chained variable will be used as z
+    p: T,
+    k?: number
+  ): MathJsChain<T>
+
+  /**
+   * Calculates the frequency response of a filter given its numerator and denominator coefficients.
+   */
+  freqz<T extends number | MathArray | MathArray[]>(
+    this: MathJsChain<T>,
+    a: T,
+    w?: T | number
+  ): MathJsChain<{ w: T; h: T }>
+
+  /*************************************************************************
+   * Special functions
+   ************************************************************************/
+
+  /**
+   * Compute the erf function of a value using a rational Chebyshev
+   * approximations for different intervals of x.
+   */
+  erf<T extends number | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<NoLiteralType<T>>
+
+  /**
+   * Compute the Riemann Zeta function of a value using an infinite series
+   * and Riemann's Functional equation.
+   */
+  zeta<T extends number | Complex | BigNumber>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /*************************************************************************
+   * Statistics functions
+   ************************************************************************/
+
+  /**
+   * Compute the median absolute deviation of a matrix or a list with
+   * values. The median absolute deviation is defined as the median of the
+   * absolute deviations from the median.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  mad(this: MathJsChain<MathCollection>): MathJsChain<any>
+
+  /**
+   * Compute the maximum value of a matrix or a list with values. In case
+   * of a multi dimensional array, the maximum of the flattened array will
+   * be calculated. When dim is provided, the maximum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param dim The maximum over the selected dimension
+   */
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  max(this: MathJsChain<MathType[]>, dim?: number): MathJsChain<any>
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  max(this: MathJsChain<MathCollection>, dim?: number): MathJsChain<any>
+
+  /**
+   * Compute the mean value of matrix or a list with values. In case of a
+   * multi dimensional array, the mean of the flattened array will be
+   * calculated. When dim is provided, the maximum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param dim The mean over the selected dimension
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  mean(this: MathJsChain<MathType[]>, dim?: number): MathJsChain<any>
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  mean(this: MathJsChain<MathCollection>, dim?: number): MathJsChain<any>
+
+  /**
+   * Compute the median of a matrix or a list with values. The values are
+   * sorted and the middle value is returned. In case of an even number of
+   * values, the average of the two middle values is returned. Supported
+   * types of values are: Number, BigNumber, Unit In case of a (multi
+   * dimensional) array or matrix, the median of all elements will be
+   * calculated.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  median(this: MathJsChain<MathType[]>, dim?: number): MathJsChain<any>
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  median(this: MathJsChain<MathCollection>, dim?: number): MathJsChain<any>
+
+  /**
+   * Compute the minimum value of a matrix or a list of values. In case of
+   * a multi dimensional array, the minimum of the flattened array will be
+   * calculated. When dim is provided, the minimum over the selected
+   * dimension will be calculated. Parameter dim is zero-based.
+   * @param dim The minimum over the selected dimension
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  min(this: MathJsChain<MathType[]>): MathJsChain<MathType[]>
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  min(this: MathJsChain<MathCollection>, dim?: number): MathJsChain<any>
+
+  /**
+   * Computes the mode of a set of numbers or a list with values(numbers
+   * or characters). If there are more than one modes, it returns a list
+   * of those values.
+   */
+
+  mode(this: MathJsChain<MathType[]>): MathJsChain<MathType[]>
+
+  /**
+   * Compute the product of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the sum of all elements will be
+   * calculated.
+   */
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  prod(this: MathJsChain<MathType[]>): MathJsChain<any>
+
+  /**
+   * Compute the prob order quantile of a matrix or a list with values.
+   * The sequence is sorted and the middle value is returned. Supported
+   * types of sequence values are: Number, BigNumber, Unit Supported types
+   * of probability are: Number, BigNumber In case of a (multi
+   * dimensional) array or matrix, the prob order quantile of all elements
+   * will be calculated.
+   * @param probOrN prob is the order of the quantile, while N is the
+   * amount of evenly distributed steps of probabilities; only one of
+   * these options can be provided
+   * @param sorted =false is data sorted in ascending order
+   */
+  quantileSeq(
+    A: MathJsChain<MathCollection>,
+    prob: number | BigNumber | MathArray,
+    sorted?: boolean
+  ): MathJsChain<number | BigNumber | Unit | MathArray>
+
+  /**
+   * Compute the standard deviation of a matrix or a list with values. The
+   * standard deviations is defined as the square root of the variance:
+   * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+   * matrix, the standard deviation over all elements will be calculated.
+   * Optionally, the type of normalization can be specified as second
+   * parameter. The parameter normalization can be one of the following
+   * values: 'unbiased' (default) The sum of squared errors is divided by
+   * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+   * 'biased' The sum of squared errors is divided by (n + 1)
+   * @param dim A dimension to compute standard deviation.
+   * @param normalization Determines how to normalize the variance. Choose
+   * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+   * ‘unbiased’.
+   * @returns The standard deviation
+   */
+  std(
+    this: MathJsChain<number[]>,
+    dim?: number,
+    normalization?: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathJsChain<number>
+
+  /**
+   * Compute the standard deviation of a matrix or a list with values. The
+   * standard deviations is defined as the square root of the variance:
+   * std(A) = sqrt(variance(A)). In case of a (multi dimensional) array or
+   * matrix, the standard deviation over all elements will be calculated.
+   * Optionally, the type of normalization can be specified as second
+   * parameter. The parameter normalization can be one of the following
+   * values: 'unbiased' (default) The sum of squared errors is divided by
+   * (n - 1) 'uncorrected' The sum of squared errors is divided by n
+   * 'biased' The sum of squared errors is divided by (n + 1)
+   * @param normalization Determines how to normalize the variance. Choose
+   * ‘unbiased’ (default), ‘uncorrected’, or ‘biased’. Default value:
+   * ‘unbiased’.
+   * @returns The standard deviation
+   */
+  std(
+    this: MathJsChain<MathCollection>,
+    dimension?: number,
+    normalization?: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathJsChain<number[]>
+
+  /**
+   * Compute the sum of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the sum of all elements will be
+   * calculated.
+   */
+  std(
+    this: MathJsChain<MathCollection>,
+    normalization: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathJsChain<number>
+
+  /**
+   * Compute the variance of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the variance over all elements
+   * will be calculated. Optionally, the type of normalization can be
+   * specified as second parameter. The parameter normalization can be one
+   * of the following values: 'unbiased' (default) The sum of squared
+   * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+   * is divided by n 'biased' The sum of squared errors is divided by (n +
+   * 1) Note that older browser may not like the variable name var. In
+   * that case, the function can be called as math['var'](...) instead of
+   * math.variance(...).
+   * @param dim a dimension to compute variance.
+   * @param normalization normalization Determines how to normalize the
+   * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+   * Default value: ‘unbiased’.
+   * @returns The variance
+   */
+  variance(
+    this: MathJsChain<Array<Array<number | BigNumber | Fraction>>>
+  ): MathJsChain<number>
+
+  /**
+   * Compute the variance of a matrix or a list with values. In case of a
+   * (multi dimensional) array or matrix, the variance over all elements
+   * will be calculated. Optionally, the type of normalization can be
+   * specified as second parameter. The parameter normalization can be one
+   * of the following values: 'unbiased' (default) The sum of squared
+   * errors is divided by (n - 1) 'uncorrected' The sum of squared errors
+   * is divided by n 'biased' The sum of squared errors is divided by (n +
+   * 1) Note that older browser may not like the variable name var. In
+   * that case, the function can be called as math['var'](...) instead of
+   * math.variance(...).
+   * @param normalization normalization Determines how to normalize the
+   * variance. Choose ‘unbiased’ (default), ‘uncorrected’, or ‘biased’.
+   * Default value: ‘unbiased’.
+   * @returns The variance
+   */
+  variance(
+    this: MathJsChain<MathCollection>,
+    dimension?: number,
+    normalization?: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathJsChain<number[]>
+
+  variance(
+    this: MathJsChain<MathCollection>,
+    normalization: 'unbiased' | 'uncorrected' | 'biased'
+  ): MathJsChain<number>
+
+  /*************************************************************************
+   * String functions
+   ************************************************************************/
+
+  /**
+   * Format a value of any type into a string.
+   * @param options An object with formatting options.
+   * @param callback A custom formatting function, invoked for all numeric
+   * elements in value, for example all elements of a matrix, or the real
+   * and imaginary parts of a complex number. This callback can be used to
+   * override the built-in numeric notation with any type of formatting.
+   * Function callback is called with value as parameter and must return a
+   * string.
+   * @see http://mathjs.org/docs/reference/functions/format.html
+   */
+  format(
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    this: MathJsChain<any>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    value: any,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    options?: FormatOptions | number | ((item: any) => string),
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    callback?: (value: any) => string
+  ): MathJsChain<string>
+
+  /**
+   * Interpolate values into a string template.
+   * @param values An object containing variables which will be filled in
+   * in the template.
+   * @param precision Number of digits to format numbers. If not provided,
+   * the value will not be rounded.
+   * @param options Formatting options, or the number of digits to format
+   * numbers. See function math.format for a description of all options.
+   */
+  print(
+    this: MathJsChain<string>,
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    values: any,
+    precision?: number,
+    options?: number | object
+  ): MathJsChain<string>
+
+  /*************************************************************************
+   * Trigonometry functions
+   ************************************************************************/
+
+  /**
+   * Calculate the inverse cosine of a value. For matrices, the function
+   * is evaluated element wise.
+   */
+
+  acos<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic arccos of a value, defined as acosh(x) =
+   * ln(sqrt(x^2 - 1) + x). For matrices, the function is evaluated
+   * element wise.
+   */
+
+  acosh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse cotangent of a value. For matrices, the
+   * function is evaluated element wise.
+   */
+
+  acot<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse hyperbolic tangent of a value, defined as acoth(x)
+   * = (ln((x+1)/x) + ln(x/(x-1))) / 2. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  acoth<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse cosecant of a value. For matrices, the function
+   * is evaluated element wise.
+   */
+
+  acsc<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse hyperbolic cosecant of a value, defined as acsch(x)
+   * = ln(1/x + sqrt(1/x^2 + 1)). For matrices, the function is evaluated
+   * element wise.
+   */
+
+  acsch<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse secant of a value. For matrices, the function
+   * is evaluated element wise.
+   */
+
+  asec<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic arcsecant of a value, defined as asech(x) =
+   * ln(sqrt(1/x^2 - 1) + 1/x). For matrices, the function is evaluated
+   * element wise.
+   */
+
+  asech<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse sine of a value. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  asin<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic arcsine of a value, defined as asinh(x) =
+   * ln(x + sqrt(x^2 + 1)). For matrices, the function is evaluated
+   * element wise.
+   */
+
+  asinh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse tangent of a value. For matrices, the function
+   * is evaluated element wise.
+   */
+
+  atan<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the inverse tangent function with two arguments, y/x. By
+   * providing two arguments, the right quadrant of the computed angle can
+   * be determined. For matrices, the function is evaluated element wise.
+   */
+
+  atan2<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>,
+    x: number
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic arctangent of a value, defined as atanh(x) =
+   * ln((1 + x)/(1 - x)) / 2. For matrices, the function is evaluated
+   * element wise.
+   */
+
+  atanh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the cosine of a value. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  cos<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic cosine of a value, defined as cosh(x) = 1/2
+   * * (exp(x) + exp(-x)). For matrices, the function is evaluated element
+   * wise.
+   */
+
+  cosh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the cotangent of a value. cot(x) is defined as 1 / tan(x).
+   * For matrices, the function is evaluated element wise.
+   */
+
+  cot<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic cotangent of a value, defined as coth(x) = 1
+   * / tanh(x). For matrices, the function is evaluated element wise.
+   */
+
+  coth<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the cosecant of a value, defined as csc(x) = 1/sin(x). For
+   * matrices, the function is evaluated element wise.
+   */
+
+  csc<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic cosecant of a value, defined as csch(x) = 1
+   * / sinh(x). For matrices, the function is evaluated element wise.
+   */
+
+  csch<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the secant of a value, defined as sec(x) = 1/cos(x). For
+   * matrices, the function is evaluated element wise.
+   */
+
+  sec<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic secant of a value, defined as sech(x) = 1 /
+   * cosh(x). For matrices, the function is evaluated element wise.
+   */
+
+  sech<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the sine of a value. For matrices, the function is
+   * evaluated element wise.
+   */
+
+  sin<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic sine of a value, defined as sinh(x) = 1/2 *
+   * (exp(x) - exp(-x)). For matrices, the function is evaluated element
+   * wise.
+   */
+
+  sinh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the tangent of a value. tan(x) is equal to sin(x) / cos(x).
+   * For matrices, the function is evaluated element wise.
+   */
+
+  tan<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /**
+   * Calculate the hyperbolic tangent of a value, defined as tanh(x) =
+   * (exp(2 * x) - 1) / (exp(2 * x) + 1). For matrices, the function is
+   * evaluated element wise.
+   */
+
+  tanh<T extends number | BigNumber | Complex | MathCollection>(
+    this: MathJsChain<T>
+  ): MathJsChain<T>
+
+  /*************************************************************************
+   * Unit functions
+   ************************************************************************/
+
+  /**
+   * Change the unit of a value. For matrices, the function is evaluated
+   * element wise.
+   * @param unit New unit. Can be a string like "cm" or a unit without
+   * value.
+   */
+  to(
+    this: MathJsChain<Unit | MathCollection>,
+    unit: Unit | string
+  ): MathJsChain<Unit | MathCollection>
+
+  /**
+   * Converts a unit to the most appropriate display unit.
+   * When no preferred units are provided, the function automatically find the best prefix.
+   * When preferred units are provided, it converts to
+   * the unit that gives a value closest to 1.
+   * @param preferredUnits - Optional preferred target units
+   * @param options - Optional options object
+   */
+  toBest(this: MathJsChain<Unit>): MathJsChain<Unit>
+  toBest(
+    this: MathJsChain<Unit>,
+    units: string[] | Unit[],
+    options: object
+  ): MathJsChain<Unit>
+
+  /*************************************************************************
+   * Utils functions
+   ************************************************************************/
+
+  /**
+   * Clone an object.
+   */
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  clone<TValue>(this: MathJsChain<TValue>): MathJsChain<TValue>
+
+  /**
+   * Test whether a value is an integer number. The function supports
+   * number, BigNumber, and Fraction. The function is evaluated
+   * element-wise in case of Array or Matrix input.
+   */
+
+  isInteger(
+    this: MathJsChain<number | BigNumber | bigint | Fraction | MathCollection>
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is NaN (not a number). The function supports
+   * types number, BigNumber, Fraction, Unit and Complex. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   */
+
+  isNaN(
+    this: MathJsChain<number | BigNumber | Fraction | MathCollection | Unit>
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is negative: smaller than zero. The function
+   * supports types number, BigNumber, Fraction, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   */
+
+  isNegative(
+    this: MathJsChain<number | BigNumber | Fraction | MathCollection | Unit>
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is a numeric value. The function is evaluated
+   * element-wise in case of Array or Matrix input.
+   */
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  isNumeric(this: MathJsChain<any>): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is positive: larger than zero. The function
+   * supports types number, BigNumber, Fraction, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   */
+
+  isPositive(
+    this: MathJsChain<
+      number | BigNumber | bigint | Fraction | MathCollection | Unit
+    >
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is prime: has no divisors other than itself and
+   * one. The function supports type number, bignumber. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   */
+
+  isPrime(
+    this: MathJsChain<number | BigNumber | bigint | MathCollection>
+  ): MathJsChain<boolean>
+
+  /**
+   * Test whether a value is zero. The function can check for zero for
+   * types number, BigNumber, Fraction, Complex, and Unit. The function is
+   * evaluated element-wise in case of Array or Matrix input.
+   */
+
+  isZero(this: MathJsChain<MathType>): MathJsChain<boolean>
+
+  /**
+   * Determine the type of a variable.
+   */
+
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  typeOf(this: MathJsChain<any>): MathJsChain<string>
+}
+
+export interface ImportOptions {
+  override?: boolean
+  silent?: boolean
+  wrap?: boolean
+}
+
+export interface ImportObject {
+  // eslint-disable-next-line @typescript-eslint/no-explicit-any
+  [key: string]: any
+}
+
+export interface MapLike<TKey = string, TValue = unknown> {
+  get(key: TKey): TValue
+  set(key: TKey, value: TValue): MapLike<TKey, TValue>
+  has(key: TKey): boolean
+  keys(): IterableIterator<TKey> | TKey[]
+}
+
+export const {
+  // config // Don't export config: no config available in the static instance
+
+  // core functions
+  create,
+  factory,
+  typed,
+
+  // constants
+  e,
+  pi,
+  i,
+  // Infinity // not needed: is available as global variable too
+  LN2,
+  LN10,
+  LOG2E,
+  LOG10E,
+  // NaN, // not needed: is available as global variable too
+  phi,
+  SQRT1_2,
+  SQRT2,
+  tau,
+
+  // Class-like constructors
+  Node,
+  AccessorNode,
+  ArrayNode,
+  AssignmentNode,
+  BlockNode,
+  ConditionalNode,
+  ConstantNode,
+  FunctionAssignmentNode,
+  FunctionNode,
+  IndexNode,
+  ObjectNode,
+  OperatorNode,
+  ParenthesisNode,
+  RangeNode,
+  RelationalNode,
+  SymbolNode,
+  Matrix,
+  Unit,
+
+  uninitialized,
+  version,
+  expression,
+  reviver,
+  replacer,
+
+  bignumber,
+  boolean,
+  chain,
+  complex,
+  createUnit,
+  fraction,
+  index,
+  matrix,
+  number,
+  sparse,
+  splitUnit,
+  string,
+  unit,
+  compile,
+  evaluate,
+  help,
+  parse,
+  parser,
+
+  // algebra
+  derivative,
+  lsolve,
+  lup,
+  lusolve,
+  polynomialRoot,
+  qr,
+  rationalize,
+  simplify,
+  simplifyConstant,
+  simplifyCore,
+  symbolicEqual,
+  leafCount,
+  resolve,
+  slu,
+  usolve,
+
+  // arithmetic functions
+  abs,
+  add,
+  cbrt,
+  ceil,
+  fix,
+  floor,
+  round,
+  cube,
+  divide,
+  dotDivide,
+  dotMultiply,
+  dotPow,
+  exp,
+  expm1,
+  gcd,
+  hypot,
+  lcm,
+  log,
+  log10,
+  log1p,
+  log2,
+  mod,
+  multiply,
+  norm,
+  nthRoot,
+  pow,
+  sign,
+  sqrt,
+  square,
+  subtract,
+  unaryMinus,
+  unaryPlus,
+  xgcd,
+
+  // bitwise
+  bitAnd,
+  bitNot,
+  bitOr,
+  bitXor,
+  leftShift,
+  rightArithShift,
+  rightLogShift,
+
+  // combinatorics
+  bellNumbers,
+  catalan,
+  composition,
+  stirlingS2,
+
+  // complex
+  arg,
+  conj,
+  im,
+  re,
+
+  // geometry
+  distance,
+  intersect,
+
+  // logical
+  and,
+  not,
+  or,
+  xor,
+
+  // matrix functions
+  mapSlices,
+  apply, // @deprecated prior name of mapSlices
+  concat,
+  cross,
+  ctranspose,
+  det,
+  diag,
+  dot,
+  eigs,
+  expm,
+  sylvester,
+  schur,
+  lyap,
+  identity,
+  filter,
+  flatten,
+  forEach,
+  inv,
+  kron,
+  map,
+  ones,
+  partitionSelect,
+  pinv,
+  range,
+  reshape,
+  resize,
+  rotationMatrix,
+  row,
+  column,
+  rotate,
+  size,
+  sort,
+  sqrtm,
+  squeeze,
+  subset,
+  trace,
+  transpose,
+  zeros,
+  fft,
+  ifft,
+
+  // probability
+  combinations,
+  factorial,
+  gamma,
+  kldivergence,
+  lgamma,
+  multinomial,
+  permutations,
+  pickRandom,
+  random,
+  randomInt,
+
+  // relational functions
+  compare,
+  compareNatural,
+  compareText,
+  deepEqual,
+  equal,
+  equalText,
+  larger,
+  largerEq,
+  smaller,
+  smallerEq,
+  unequal,
+
+  // set functions
+  setCartesian,
+  setDifference,
+  setDistinct,
+  setIntersect,
+  setIsSubset,
+  setMultiplicity,
+  setPowerset,
+  setSize,
+  setSymDifference,
+  setUnion,
+
+  // special functions
+  zpk2tf,
+  freqz,
+  erf,
+  zeta,
+
+  // Statistics functions
+  mad,
+  max,
+  mean,
+  median,
+  min,
+  mode,
+  prod,
+  quantileSeq,
+  std,
+  sum,
+  count,
+  cumsum,
+  variance,
+  corr,
+
+  // String functions
+  format,
+  print,
+
+  // Trigonometry functions
+  acos,
+  acosh,
+  acot,
+  acoth,
+  acsc,
+  acsch,
+  asec,
+  asech,
+  asin,
+  asinh,
+  atan,
+  atan2,
+  atanh,
+  cos,
+  cosh,
+  cot,
+  coth,
+  csc,
+  csch,
+  sec,
+  sech,
+  sin,
+  sinh,
+  tan,
+  tanh,
+
+  // unit functions
+  to,
+  toBest,
+
+  // util functions
+  isNumber,
+  isBigNumber,
+  isComplex,
+  isFraction,
+  isUnit,
+  isString,
+  isArray,
+  isMatrix,
+  isCollection,
+  isDenseMatrix,
+  isSparseMatrix,
+  isRange,
+  isIndex,
+  isBoolean,
+  isResultSet,
+  isHelp,
+  isFunction,
+  isDate,
+  isRegExp,
+  isObject,
+  isNull,
+  isUndefined,
+  isAccessorNode,
+  isArrayNode,
+  isAssignmentNode,
+  isBlockNode,
+  isConditionalNode,
+  isConstantNode,
+  isFunctionAssignmentNode,
+  isFunctionNode,
+  isIndexNode,
+  isNode,
+  isObjectNode,
+  isOperatorNode,
+  isParenthesisNode,
+  isRangeNode,
+  isRelationalNode,
+  isSymbolNode,
+  isChain,
+  clone,
+  hasNumericValue,
+  isInteger,
+  isNaN,
+  isNegative,
+  isNumeric,
+  isPositive,
+  isPrime,
+  isZero,
+  typeOf
+}: MathJsInstance
diff --git a/node_modules/mime-db/HISTORY.md b/node_modules/mime-db/HISTORY.md
new file mode 100644
index 0000000..fb35bec
--- /dev/null
+++ b/node_modules/mime-db/HISTORY.md
@@ -0,0 +1,541 @@
+1.54.0 / 2025-03-17
+===================
+
+  * Update mime type for DCM format (#362)
+  * mark application/octet-stream as compressible (#163)
+  * Fix typo in application/x-zip-compressed mimetype (#359)
+  * Add mime-type for Jupyter notebooks (#282)
+  * Add Google Drive MIME types (#311)
+  * Add .blend file type (#338)
+  * Add support for the FBX file extension (#342)
+  * Add Adobe DNG file (#340)
+  * Add Procreate Brush and Brush Set file Types (#339)
+  * Add support for Procreate Dreams  (#341)
+  * replace got with undici (#352)
+  * Added extensions list for model/step (#293)
+  * Add m4b as a type of audio/mp4 (#357)
+  * windows 11 application/x-zip-compressed (#346)
+  * add dotLottie mime type (#351)
+  * Add some MS-related extensions and types (#336)
+
+1.53.0 / 2024-07-12
+===================
+
+  * Add extension `.sql` to `application/sql`
+  * Add extensions `.aac` and `.adts` to `audio/aac`
+  * Add extensions `.js` and `.mjs` to `text/javascript`
+  * Add extensions for `application/mp4` from IANA
+  * Add extensions from IANA for more MIME types
+  * Add Microsoft app installer types and extensions
+  * Add new upstream MIME types
+  * Fix extensions for `text/markdown` to match IANA
+  * Remove extension `.mjs` from `application/javascript`
+  * Remove obsolete MIME types from IANA data
+
+1.52.0 / 2022-02-21
+===================
+
+  * Add extensions from IANA for more `image/*` types
+  * Add extension `.asc` to `application/pgp-keys`
+  * Add extensions to various XML types
+  * Add new upstream MIME types
+
+1.51.0 / 2021-11-08
+===================
+
+  * Add new upstream MIME types
+  * Mark `image/vnd.microsoft.icon` as compressible
+  * Mark `image/vnd.ms-dds` as compressible
+
+1.50.0 / 2021-09-15
+===================
+
+  * Add deprecated iWorks mime types and extensions
+  * Add new upstream MIME types
+
+1.49.0 / 2021-07-26
+===================
+
+  * Add extension `.trig` to `application/trig`
+  * Add new upstream MIME types
+
+1.48.0 / 2021-05-30
+===================
+
+  * Add extension `.mvt` to `application/vnd.mapbox-vector-tile`
+  * Add new upstream MIME types
+  * Mark `text/yaml` as compressible
+
+1.47.0 / 2021-04-01
+===================
+
+  * Add new upstream MIME types
+  * Remove ambiguous extensions from IANA for `application/*+xml` types
+  * Update primary extension to `.es` for `application/ecmascript`
+
+1.46.0 / 2021-02-13
+===================
+
+  * Add extension `.amr` to `audio/amr`
+  * Add extension `.m4s` to `video/iso.segment`
+  * Add extension `.opus` to `audio/ogg`
+  * Add new upstream MIME types
+
+1.45.0 / 2020-09-22
+===================
+
+  * Add `application/ubjson` with extension `.ubj`
+  * Add `image/avif` with extension `.avif`
+  * Add `image/ktx2` with extension `.ktx2`
+  * Add extension `.dbf` to `application/vnd.dbf`
+  * Add extension `.rar` to `application/vnd.rar`
+  * Add extension `.td` to `application/urc-targetdesc+xml`
+  * Add new upstream MIME types
+  * Fix extension of `application/vnd.apple.keynote` to be `.key`
+
+1.44.0 / 2020-04-22
+===================
+
+  * Add charsets from IANA
+  * Add extension `.cjs` to `application/node`
+  * Add new upstream MIME types
+
+1.43.0 / 2020-01-05
+===================
+
+  * Add `application/x-keepass2` with extension `.kdbx`
+  * Add extension `.mxmf` to `audio/mobile-xmf`
+  * Add extensions from IANA for `application/*+xml` types
+  * Add new upstream MIME types
+
+1.42.0 / 2019-09-25
+===================
+
+  * Add `image/vnd.ms-dds` with extension `.dds`
+  * Add new upstream MIME types
+  * Remove compressible from `multipart/mixed`
+
+1.41.0 / 2019-08-30
+===================
+
+  * Add new upstream MIME types
+  * Add `application/toml` with extension `.toml`
+  * Mark `font/ttf` as compressible
+
+1.40.0 / 2019-04-20
+===================
+
+  * Add extensions from IANA for `model/*` types
+  * Add `text/mdx` with extension `.mdx`
+
+1.39.0 / 2019-04-04
+===================
+
+  * Add extensions `.siv` and `.sieve` to `application/sieve`
+  * Add new upstream MIME types
+
+1.38.0 / 2019-02-04
+===================
+
+  * Add extension `.nq` to `application/n-quads`
+  * Add extension `.nt` to `application/n-triples`
+  * Add new upstream MIME types
+  * Mark `text/less` as compressible
+
+1.37.0 / 2018-10-19
+===================
+
+  * Add extensions to HEIC image types
+  * Add new upstream MIME types
+
+1.36.0 / 2018-08-20
+===================
+
+  * Add Apple file extensions from IANA
+  * Add extensions from IANA for `image/*` types
+  * Add new upstream MIME types
+
+1.35.0 / 2018-07-15
+===================
+
+  * Add extension `.owl` to `application/rdf+xml`
+  * Add new upstream MIME types
+    - Removes extension `.woff` from `application/font-woff`
+
+1.34.0 / 2018-06-03
+===================
+
+  * Add extension `.csl` to `application/vnd.citationstyles.style+xml`
+  * Add extension `.es` to `application/ecmascript`
+  * Add new upstream MIME types
+  * Add `UTF-8` as default charset for `text/turtle`
+  * Mark all XML-derived types as compressible
+
+1.33.0 / 2018-02-15
+===================
+
+  * Add extensions from IANA for `message/*` types
+  * Add new upstream MIME types
+  * Fix some incorrect OOXML types
+  * Remove `application/font-woff2`
+
+1.32.0 / 2017-11-29
+===================
+
+  * Add new upstream MIME types
+  * Update `text/hjson` to registered `application/hjson`
+  * Add `text/shex` with extension `.shex`
+
+1.31.0 / 2017-10-25
+===================
+
+  * Add `application/raml+yaml` with extension `.raml`
+  * Add `application/wasm` with extension `.wasm`
+  * Add new `font` type from IANA
+  * Add new upstream font extensions
+  * Add new upstream MIME types
+  * Add extensions for JPEG-2000 images
+
+1.30.0 / 2017-08-27
+===================
+
+  * Add `application/vnd.ms-outlook`
+  * Add `application/x-arj`
+  * Add extension `.mjs` to `application/javascript`
+  * Add glTF types and extensions
+  * Add new upstream MIME types
+  * Add `text/x-org`
+  * Add VirtualBox MIME types
+  * Fix `source` records for `video/*` types that are IANA
+  * Update `font/opentype` to registered `font/otf`
+
+1.29.0 / 2017-07-10
+===================
+
+  * Add `application/fido.trusted-apps+json`
+  * Add extension `.wadl` to `application/vnd.sun.wadl+xml`
+  * Add new upstream MIME types
+  * Add `UTF-8` as default charset for `text/css`
+
+1.28.0 / 2017-05-14
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.gz` to `application/gzip`
+  * Update extensions `.md` and `.markdown` to be `text/markdown`
+
+1.27.0 / 2017-03-16
+===================
+
+  * Add new upstream MIME types
+  * Add `image/apng` with extension `.apng`
+
+1.26.0 / 2017-01-14
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.geojson` to `application/geo+json`
+
+1.25.0 / 2016-11-11
+===================
+
+  * Add new upstream MIME types
+
+1.24.0 / 2016-09-18
+===================
+
+  * Add `audio/mp3`
+  * Add new upstream MIME types
+
+1.23.0 / 2016-05-01
+===================
+
+  * Add new upstream MIME types
+  * Add extension `.3gpp` to `audio/3gpp`
+
+1.22.0 / 2016-02-15
+===================
+
+  * Add `text/slim`
+  * Add extension `.rng` to `application/xml`
+  * Add new upstream MIME types
+  * Fix extension of `application/dash+xml` to be `.mpd`
+  * Update primary extension to `.m4a` for `audio/mp4`
+
+1.21.0 / 2016-01-06
+===================
+
+  * Add Google document types
+  * Add new upstream MIME types
+
+1.20.0 / 2015-11-10
+===================
+
+  * Add `text/x-suse-ymp`
+  * Add new upstream MIME types
+
+1.19.0 / 2015-09-17
+===================
+
+  * Add `application/vnd.apple.pkpass`
+  * Add new upstream MIME types
+
+1.18.0 / 2015-09-03
+===================
+
+  * Add new upstream MIME types
+
+1.17.0 / 2015-08-13
+===================
+
+  * Add `application/x-msdos-program`
+  * Add `audio/g711-0`
+  * Add `image/vnd.mozilla.apng`
+  * Add extension `.exe` to `application/x-msdos-program`
+
+1.16.0 / 2015-07-29
+===================
+
+  * Add `application/vnd.uri-map`
+
+1.15.0 / 2015-07-13
+===================
+
+  * Add `application/x-httpd-php`
+
+1.14.0 / 2015-06-25
+===================
+
+  * Add `application/scim+json`
+  * Add `application/vnd.3gpp.ussd+xml`
+  * Add `application/vnd.biopax.rdf+xml`
+  * Add `text/x-processing`
+
+1.13.0 / 2015-06-07
+===================
+
+  * Add nginx as a source
+  * Add `application/x-cocoa`
+  * Add `application/x-java-archive-diff`
+  * Add `application/x-makeself`
+  * Add `application/x-perl`
+  * Add `application/x-pilot`
+  * Add `application/x-redhat-package-manager`
+  * Add `application/x-sea`
+  * Add `audio/x-m4a`
+  * Add `audio/x-realaudio`
+  * Add `image/x-jng`
+  * Add `text/mathml`
+
+1.12.0 / 2015-06-05
+===================
+
+  * Add `application/bdoc`
+  * Add `application/vnd.hyperdrive+json`
+  * Add `application/x-bdoc`
+  * Add extension `.rtf` to `text/rtf`
+
+1.11.0 / 2015-05-31
+===================
+
+  * Add `audio/wav`
+  * Add `audio/wave`
+  * Add extension `.litcoffee` to `text/coffeescript`
+  * Add extension `.sfd-hdstx` to `application/vnd.hydrostatix.sof-data`
+  * Add extension `.n-gage` to `application/vnd.nokia.n-gage.symbian.install`
+
+1.10.0 / 2015-05-19
+===================
+
+  * Add `application/vnd.balsamiq.bmpr`
+  * Add `application/vnd.microsoft.portable-executable`
+  * Add `application/x-ns-proxy-autoconfig`
+
+1.9.1 / 2015-04-19
+==================
+
+  * Remove `.json` extension from `application/manifest+json`
+    - This is causing bugs downstream
+
+1.9.0 / 2015-04-19
+==================
+
+  * Add `application/manifest+json`
+  * Add `application/vnd.micro+json`
+  * Add `image/vnd.zbrush.pcx`
+  * Add `image/x-ms-bmp`
+
+1.8.0 / 2015-03-13
+==================
+
+  * Add `application/vnd.citationstyles.style+xml`
+  * Add `application/vnd.fastcopy-disk-image`
+  * Add `application/vnd.gov.sk.xmldatacontainer+xml`
+  * Add extension `.jsonld` to `application/ld+json`
+
+1.7.0 / 2015-02-08
+==================
+
+  * Add `application/vnd.gerber`
+  * Add `application/vnd.msa-disk-image`
+
+1.6.1 / 2015-02-05
+==================
+
+  * Community extensions ownership transferred from `node-mime`
+
+1.6.0 / 2015-01-29
+==================
+
+  * Add `application/jose`
+  * Add `application/jose+json`
+  * Add `application/json-seq`
+  * Add `application/jwk+json`
+  * Add `application/jwk-set+json`
+  * Add `application/jwt`
+  * Add `application/rdap+json`
+  * Add `application/vnd.gov.sk.e-form+xml`
+  * Add `application/vnd.ims.imsccv1p3`
+
+1.5.0 / 2014-12-30
+==================
+
+  * Add `application/vnd.oracle.resource+json`
+  * Fix various invalid MIME type entries
+    - `application/mbox+xml`
+    - `application/oscp-response`
+    - `application/vwg-multiplexed`
+    - `audio/g721`
+
+1.4.0 / 2014-12-21
+==================
+
+  * Add `application/vnd.ims.imsccv1p2`
+  * Fix various invalid MIME type entries
+    - `application/vnd-acucobol`
+    - `application/vnd-curl`
+    - `application/vnd-dart`
+    - `application/vnd-dxr`
+    - `application/vnd-fdf`
+    - `application/vnd-mif`
+    - `application/vnd-sema`
+    - `application/vnd-wap-wmlc`
+    - `application/vnd.adobe.flash-movie`
+    - `application/vnd.dece-zip`
+    - `application/vnd.dvb_service`
+    - `application/vnd.micrografx-igx`
+    - `application/vnd.sealed-doc`
+    - `application/vnd.sealed-eml`
+    - `application/vnd.sealed-mht`
+    - `application/vnd.sealed-ppt`
+    - `application/vnd.sealed-tiff`
+    - `application/vnd.sealed-xls`
+    - `application/vnd.sealedmedia.softseal-html`
+    - `application/vnd.sealedmedia.softseal-pdf`
+    - `application/vnd.wap-slc`
+    - `application/vnd.wap-wbxml`
+    - `audio/vnd.sealedmedia.softseal-mpeg`
+    - `image/vnd-djvu`
+    - `image/vnd-svf`
+    - `image/vnd-wap-wbmp`
+    - `image/vnd.sealed-png`
+    - `image/vnd.sealedmedia.softseal-gif`
+    - `image/vnd.sealedmedia.softseal-jpg`
+    - `model/vnd-dwf`
+    - `model/vnd.parasolid.transmit-binary`
+    - `model/vnd.parasolid.transmit-text`
+    - `text/vnd-a`
+    - `text/vnd-curl`
+    - `text/vnd.wap-wml`
+  * Remove example template MIME types
+    - `application/example`
+    - `audio/example`
+    - `image/example`
+    - `message/example`
+    - `model/example`
+    - `multipart/example`
+    - `text/example`
+    - `video/example`
+
+1.3.1 / 2014-12-16
+==================
+
+  * Fix missing extensions
+    - `application/json5`
+    - `text/hjson`
+
+1.3.0 / 2014-12-07
+==================
+
+  * Add `application/a2l`
+  * Add `application/aml`
+  * Add `application/atfx`
+  * Add `application/atxml`
+  * Add `application/cdfx+xml`
+  * Add `application/dii`
+  * Add `application/json5`
+  * Add `application/lxf`
+  * Add `application/mf4`
+  * Add `application/vnd.apache.thrift.compact`
+  * Add `application/vnd.apache.thrift.json`
+  * Add `application/vnd.coffeescript`
+  * Add `application/vnd.enphase.envoy`
+  * Add `application/vnd.ims.imsccv1p1`
+  * Add `text/csv-schema`
+  * Add `text/hjson`
+  * Add `text/markdown`
+  * Add `text/yaml`
+
+1.2.0 / 2014-11-09
+==================
+
+  * Add `application/cea`
+  * Add `application/dit`
+  * Add `application/vnd.gov.sk.e-form+zip`
+  * Add `application/vnd.tmd.mediaflex.api+xml`
+  * Type `application/epub+zip` is now IANA-registered
+
+1.1.2 / 2014-10-23
+==================
+
+  * Rebuild database for `application/x-www-form-urlencoded` change
+
+1.1.1 / 2014-10-20
+==================
+
+  * Mark `application/x-www-form-urlencoded` as compressible.
+
+1.1.0 / 2014-09-28
+==================
+
+  * Add `application/font-woff2`
+
+1.0.3 / 2014-09-25
+==================
+
+  * Fix engine requirement in package
+
+1.0.2 / 2014-09-25
+==================
+
+  * Add `application/coap-group+json`
+  * Add `application/dcd`
+  * Add `application/vnd.apache.thrift.binary`
+  * Add `image/vnd.tencent.tap`
+  * Mark all JSON-derived types as compressible
+  * Update `text/vtt` data
+
+1.0.1 / 2014-08-30
+==================
+
+  * Fix extension ordering
+
+1.0.0 / 2014-08-30
+==================
+
+  * Add `application/atf`
+  * Add `application/merge-patch+json`
+  * Add `multipart/x-mixed-replace`
+  * Add `source: 'apache'` metadata
+  * Add `source: 'iana'` metadata
+  * Remove badly-assumed charset data
diff --git a/node_modules/mime-db/LICENSE b/node_modules/mime-db/LICENSE
new file mode 100644
index 0000000..0751cb1
--- /dev/null
+++ b/node_modules/mime-db/LICENSE
@@ -0,0 +1,23 @@
+(The MIT License)
+
+Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
+Copyright (c) 2015-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/node_modules/mime-db/README.md b/node_modules/mime-db/README.md
new file mode 100644
index 0000000..ee93fa0
--- /dev/null
+++ b/node_modules/mime-db/README.md
@@ -0,0 +1,109 @@
+# mime-db
+
+[![NPM Version][npm-version-image]][npm-url]
+[![NPM Downloads][npm-downloads-image]][npm-url]
+[![Node.js Version][node-image]][node-url]
+[![Build Status][ci-image]][ci-url]
+[![Coverage Status][coveralls-image]][coveralls-url]
+
+This is a large database of mime types and information about them.
+It consists of a single, public JSON file and does not include any logic,
+allowing it to remain as un-opinionated as possible with an API.
+It aggregates data from the following sources:
+
+- https://www.iana.org/assignments/media-types/media-types.xhtml
+- https://svn.apache.org/repos/asf/httpd/httpd/trunk/docs/conf/mime.types
+- https://hg.nginx.org/nginx/raw-file/default/conf/mime.types
+
+## Installation
+
+```bash
+npm install mime-db
+```
+
+### Database Download
+
+If you intend to use this in a web browser, you can conveniently access the JSON file via [jsDelivr](https://www.jsdelivr.com/), a popular CDN (Content Delivery Network). To ensure stability and compatibility, it is advisable to specify [a release tag](https://github.com/jshttp/mime-db/tags) instead of using the 'master' branch. This is because the JSON file's format might change in future updates, and relying on a specific release tag will prevent potential issues arising from these changes.
+
+```
+https://cdn.jsdelivr.net/gh/jshttp/mime-db@master/db.json
+```
+
+## Usage
+
+```js
+var db = require('mime-db')
+
+// grab data on .js files
+var data = db['application/javascript']
+```
+
+## Data Structure
+
+The JSON file is a map lookup for lowercased mime types.
+Each mime type has the following properties:
+
+- `.source` - where the mime type is defined.
+    If not set, it's probably a custom media type.
+    - `apache` - [Apache common media types](https://svn.apache.org/repos/asf/httpd/httpd/trunk/docs/conf/mime.types)
+    - `iana` - [IANA-defined media types](https://www.iana.org/assignments/media-types/media-types.xhtml)
+    - `nginx` - [nginx media types](https://hg.nginx.org/nginx/raw-file/default/conf/mime.types)
+- `.extensions[]` - known extensions associated with this mime type.
+- `.compressible` - whether a file of this type can be gzipped.
+- `.charset` - the default charset associated with this type, if any.
+
+If unknown, every property could be `undefined`.
+
+## Note on MIME Type Data and Semver
+
+This package considers the programmatic api as the semver compatibility. This means the MIME type resolution is *not* considered
+in the semver bumps. This means that if you want to pin your `mime-db` data you will need to do it in your application. While
+this expectation was not set in docs until now, it is how the pacakge operated, so we do not feel this is a breaking change.
+
+## Contributing
+
+The primary way to contribute to this database is by updating the data in
+one of the upstream sources. The database is updated from the upstreams
+periodically and will pull in any changes.
+
+### Registering Media Types
+
+The best way to get new media types included in this library is to register
+them with the IANA. The community registration procedure is outlined in
+[RFC 6838 section 5](https://tools.ietf.org/html/rfc6838#section-5). Types
+registered with the IANA are automatically pulled into this library.
+
+### Direct Inclusion
+
+If that is not possible / feasible, they can be added directly here as a
+"custom" type. To do this, it is required to have a primary source that
+definitively lists the media type. If an extension is going to be listed as
+associated with this media type, the source must definitively link the
+media type and extension as well.
+
+To edit the database, only make PRs against `src/custom-types.json` or
+`src/custom-suffix.json`.
+
+The `src/custom-types.json` file is a JSON object with the MIME type as the
+keys and the values being an object with the following keys:
+
+- `compressible` - leave out if you don't know, otherwise `true`/`false` to
+  indicate whether the data represented by the type is typically compressible.
+- `extensions` - include an array of file extensions that are associated with
+  the type.
+- `notes` - human-readable notes about the type, typically what the type is.
+- `sources` - include an array of URLs of where the MIME type and the associated
+  extensions are sourced from. This needs to be a [primary source](https://en.wikipedia.org/wiki/Primary_source);
+  links to type aggregating sites and Wikipedia are _not acceptable_.
+
+To update the build, run `npm run build`.
+
+[ci-image]: https://badgen.net/github/checks/jshttp/mime-db/master?label=ci
+[ci-url]: https://github.com/jshttp/mime-db/actions/workflows/ci.yml
+[coveralls-image]: https://badgen.net/coveralls/c/github/jshttp/mime-db/master
+[coveralls-url]: https://coveralls.io/r/jshttp/mime-db?branch=master
+[node-image]: https://badgen.net/npm/node/mime-db
+[node-url]: https://nodejs.org/en/download
+[npm-downloads-image]: https://badgen.net/npm/dm/mime-db
+[npm-url]: https://npmjs.org/package/mime-db
+[npm-version-image]: https://badgen.net/npm/v/mime-db
diff --git a/node_modules/mime-db/db.json b/node_modules/mime-db/db.json
new file mode 100644
index 0000000..7e74733
--- /dev/null
+++ b/node_modules/mime-db/db.json
@@ -0,0 +1,9342 @@
+{
+  "application/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "application/3gpdash-qoe-report+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/3gpp-ims+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/3gpphal+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/3gpphalforms+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/a2l": {
+    "source": "iana"
+  },
+  "application/ace+cbor": {
+    "source": "iana"
+  },
+  "application/ace+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ace-groupcomm+cbor": {
+    "source": "iana"
+  },
+  "application/ace-trl+cbor": {
+    "source": "iana"
+  },
+  "application/activemessage": {
+    "source": "iana"
+  },
+  "application/activity+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/aif+cbor": {
+    "source": "iana"
+  },
+  "application/aif+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-cdni+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-cdnifilter+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-costmap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-costmapfilter+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-directory+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointcost+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointcostparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointprop+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-endpointpropparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-error+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-networkmap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-networkmapfilter+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-propmap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-propmapparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-tips+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-tipsparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-updatestreamcontrol+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/alto-updatestreamparams+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/aml": {
+    "source": "iana"
+  },
+  "application/andrew-inset": {
+    "source": "iana",
+    "extensions": ["ez"]
+  },
+  "application/appinstaller": {
+    "compressible": false,
+    "extensions": ["appinstaller"]
+  },
+  "application/applefile": {
+    "source": "iana"
+  },
+  "application/applixware": {
+    "source": "apache",
+    "extensions": ["aw"]
+  },
+  "application/appx": {
+    "compressible": false,
+    "extensions": ["appx"]
+  },
+  "application/appxbundle": {
+    "compressible": false,
+    "extensions": ["appxbundle"]
+  },
+  "application/at+jwt": {
+    "source": "iana"
+  },
+  "application/atf": {
+    "source": "iana"
+  },
+  "application/atfx": {
+    "source": "iana"
+  },
+  "application/atom+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atom"]
+  },
+  "application/atomcat+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomcat"]
+  },
+  "application/atomdeleted+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomdeleted"]
+  },
+  "application/atomicmail": {
+    "source": "iana"
+  },
+  "application/atomsvc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["atomsvc"]
+  },
+  "application/atsc-dwd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dwd"]
+  },
+  "application/atsc-dynamic-event-message": {
+    "source": "iana"
+  },
+  "application/atsc-held+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["held"]
+  },
+  "application/atsc-rdt+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/atsc-rsat+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rsat"]
+  },
+  "application/atxml": {
+    "source": "iana"
+  },
+  "application/auth-policy+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/automationml-aml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["aml"]
+  },
+  "application/automationml-amlx+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["amlx"]
+  },
+  "application/bacnet-xdd+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/batch-smtp": {
+    "source": "iana"
+  },
+  "application/bdoc": {
+    "compressible": false,
+    "extensions": ["bdoc"]
+  },
+  "application/beep+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/bufr": {
+    "source": "iana"
+  },
+  "application/c2pa": {
+    "source": "iana"
+  },
+  "application/calendar+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/calendar+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xcs"]
+  },
+  "application/call-completion": {
+    "source": "iana"
+  },
+  "application/cals-1840": {
+    "source": "iana"
+  },
+  "application/captive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cbor": {
+    "source": "iana"
+  },
+  "application/cbor-seq": {
+    "source": "iana"
+  },
+  "application/cccex": {
+    "source": "iana"
+  },
+  "application/ccmp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ccxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ccxml"]
+  },
+  "application/cda+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/cdfx+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cdfx"]
+  },
+  "application/cdmi-capability": {
+    "source": "iana",
+    "extensions": ["cdmia"]
+  },
+  "application/cdmi-container": {
+    "source": "iana",
+    "extensions": ["cdmic"]
+  },
+  "application/cdmi-domain": {
+    "source": "iana",
+    "extensions": ["cdmid"]
+  },
+  "application/cdmi-object": {
+    "source": "iana",
+    "extensions": ["cdmio"]
+  },
+  "application/cdmi-queue": {
+    "source": "iana",
+    "extensions": ["cdmiq"]
+  },
+  "application/cdni": {
+    "source": "iana"
+  },
+  "application/ce+cbor": {
+    "source": "iana"
+  },
+  "application/cea": {
+    "source": "iana"
+  },
+  "application/cea-2018+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cellml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cfw": {
+    "source": "iana"
+  },
+  "application/cid-edhoc+cbor-seq": {
+    "source": "iana"
+  },
+  "application/city+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/city+json-seq": {
+    "source": "iana"
+  },
+  "application/clr": {
+    "source": "iana"
+  },
+  "application/clue+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/clue_info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cms": {
+    "source": "iana"
+  },
+  "application/cnrp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/coap-eap": {
+    "source": "iana"
+  },
+  "application/coap-group+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/coap-payload": {
+    "source": "iana"
+  },
+  "application/commonground": {
+    "source": "iana"
+  },
+  "application/concise-problem-details+cbor": {
+    "source": "iana"
+  },
+  "application/conference-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cose": {
+    "source": "iana"
+  },
+  "application/cose-key": {
+    "source": "iana"
+  },
+  "application/cose-key-set": {
+    "source": "iana"
+  },
+  "application/cose-x509": {
+    "source": "iana"
+  },
+  "application/cpl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cpl"]
+  },
+  "application/csrattrs": {
+    "source": "iana"
+  },
+  "application/csta+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cstadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/csvm+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cu-seeme": {
+    "source": "apache",
+    "extensions": ["cu"]
+  },
+  "application/cwl": {
+    "source": "iana",
+    "extensions": ["cwl"]
+  },
+  "application/cwl+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/cwl+yaml": {
+    "source": "iana"
+  },
+  "application/cwt": {
+    "source": "iana"
+  },
+  "application/cybercash": {
+    "source": "iana"
+  },
+  "application/dart": {
+    "compressible": true
+  },
+  "application/dash+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpd"]
+  },
+  "application/dash-patch+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpp"]
+  },
+  "application/dashdelta": {
+    "source": "iana"
+  },
+  "application/davmount+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["davmount"]
+  },
+  "application/dca-rft": {
+    "source": "iana"
+  },
+  "application/dcd": {
+    "source": "iana"
+  },
+  "application/dec-dx": {
+    "source": "iana"
+  },
+  "application/dialog-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dicom": {
+    "source": "iana",
+    "extensions": ["dcm"]
+  },
+  "application/dicom+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dicom+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dii": {
+    "source": "iana"
+  },
+  "application/dit": {
+    "source": "iana"
+  },
+  "application/dns": {
+    "source": "iana"
+  },
+  "application/dns+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dns-message": {
+    "source": "iana"
+  },
+  "application/docbook+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["dbk"]
+  },
+  "application/dots+cbor": {
+    "source": "iana"
+  },
+  "application/dpop+jwt": {
+    "source": "iana"
+  },
+  "application/dskpp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/dssc+der": {
+    "source": "iana",
+    "extensions": ["dssc"]
+  },
+  "application/dssc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdssc"]
+  },
+  "application/dvcs": {
+    "source": "iana"
+  },
+  "application/eat+cwt": {
+    "source": "iana"
+  },
+  "application/eat+jwt": {
+    "source": "iana"
+  },
+  "application/eat-bun+cbor": {
+    "source": "iana"
+  },
+  "application/eat-bun+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/eat-ucs+cbor": {
+    "source": "iana"
+  },
+  "application/eat-ucs+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ecmascript": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ecma"]
+  },
+  "application/edhoc+cbor-seq": {
+    "source": "iana"
+  },
+  "application/edi-consent": {
+    "source": "iana"
+  },
+  "application/edi-x12": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/edifact": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/efi": {
+    "source": "iana"
+  },
+  "application/elm+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/elm+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.cap+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/emergencycalldata.comment+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.deviceinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.ecall.msd": {
+    "source": "iana"
+  },
+  "application/emergencycalldata.legacyesn+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.providerinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.serviceinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.subscriberinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emergencycalldata.veds+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/emma+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["emma"]
+  },
+  "application/emotionml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["emotionml"]
+  },
+  "application/encaprtp": {
+    "source": "iana"
+  },
+  "application/entity-statement+jwt": {
+    "source": "iana"
+  },
+  "application/epp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/epub+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["epub"]
+  },
+  "application/eshop": {
+    "source": "iana"
+  },
+  "application/exi": {
+    "source": "iana",
+    "extensions": ["exi"]
+  },
+  "application/expect-ct-report+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/express": {
+    "source": "iana",
+    "extensions": ["exp"]
+  },
+  "application/fastinfoset": {
+    "source": "iana"
+  },
+  "application/fastsoap": {
+    "source": "iana"
+  },
+  "application/fdf": {
+    "source": "iana",
+    "extensions": ["fdf"]
+  },
+  "application/fdt+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["fdt"]
+  },
+  "application/fhir+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/fhir+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/fido.trusted-apps+json": {
+    "compressible": true
+  },
+  "application/fits": {
+    "source": "iana"
+  },
+  "application/flexfec": {
+    "source": "iana"
+  },
+  "application/font-sfnt": {
+    "source": "iana"
+  },
+  "application/font-tdpfr": {
+    "source": "iana",
+    "extensions": ["pfr"]
+  },
+  "application/font-woff": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/framework-attributes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/geo+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["geojson"]
+  },
+  "application/geo+json-seq": {
+    "source": "iana"
+  },
+  "application/geopackage+sqlite3": {
+    "source": "iana"
+  },
+  "application/geopose+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/geoxacml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/geoxacml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/gltf-buffer": {
+    "source": "iana"
+  },
+  "application/gml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["gml"]
+  },
+  "application/gnap-binding-jws": {
+    "source": "iana"
+  },
+  "application/gnap-binding-jwsd": {
+    "source": "iana"
+  },
+  "application/gnap-binding-rotation-jws": {
+    "source": "iana"
+  },
+  "application/gnap-binding-rotation-jwsd": {
+    "source": "iana"
+  },
+  "application/gpx+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["gpx"]
+  },
+  "application/grib": {
+    "source": "iana"
+  },
+  "application/gxf": {
+    "source": "apache",
+    "extensions": ["gxf"]
+  },
+  "application/gzip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["gz"]
+  },
+  "application/h224": {
+    "source": "iana"
+  },
+  "application/held+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/hjson": {
+    "extensions": ["hjson"]
+  },
+  "application/hl7v2+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/http": {
+    "source": "iana"
+  },
+  "application/hyperstudio": {
+    "source": "iana",
+    "extensions": ["stk"]
+  },
+  "application/ibe-key-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ibe-pkg-reply+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ibe-pp-data": {
+    "source": "iana"
+  },
+  "application/iges": {
+    "source": "iana"
+  },
+  "application/im-iscomposing+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/index": {
+    "source": "iana"
+  },
+  "application/index.cmd": {
+    "source": "iana"
+  },
+  "application/index.obj": {
+    "source": "iana"
+  },
+  "application/index.response": {
+    "source": "iana"
+  },
+  "application/index.vnd": {
+    "source": "iana"
+  },
+  "application/inkml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ink","inkml"]
+  },
+  "application/iotp": {
+    "source": "iana"
+  },
+  "application/ipfix": {
+    "source": "iana",
+    "extensions": ["ipfix"]
+  },
+  "application/ipp": {
+    "source": "iana"
+  },
+  "application/isup": {
+    "source": "iana"
+  },
+  "application/its+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["its"]
+  },
+  "application/java-archive": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jar","war","ear"]
+  },
+  "application/java-serialized-object": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["ser"]
+  },
+  "application/java-vm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["class"]
+  },
+  "application/javascript": {
+    "source": "apache",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["js"]
+  },
+  "application/jf2feed+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jose": {
+    "source": "iana"
+  },
+  "application/jose+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jrd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jscalendar+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jscontact+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["json","map"]
+  },
+  "application/json-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/json-seq": {
+    "source": "iana"
+  },
+  "application/json5": {
+    "extensions": ["json5"]
+  },
+  "application/jsonml+json": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["jsonml"]
+  },
+  "application/jsonpath": {
+    "source": "iana"
+  },
+  "application/jwk+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jwk-set+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/jwk-set+jwt": {
+    "source": "iana"
+  },
+  "application/jwt": {
+    "source": "iana"
+  },
+  "application/kpml-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/kpml-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ld+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["jsonld"]
+  },
+  "application/lgr+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lgr"]
+  },
+  "application/link-format": {
+    "source": "iana"
+  },
+  "application/linkset": {
+    "source": "iana"
+  },
+  "application/linkset+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/load-control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/logout+jwt": {
+    "source": "iana"
+  },
+  "application/lost+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lostxml"]
+  },
+  "application/lostsync+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/lpf+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/lxf": {
+    "source": "iana"
+  },
+  "application/mac-binhex40": {
+    "source": "iana",
+    "extensions": ["hqx"]
+  },
+  "application/mac-compactpro": {
+    "source": "apache",
+    "extensions": ["cpt"]
+  },
+  "application/macwriteii": {
+    "source": "iana"
+  },
+  "application/mads+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mads"]
+  },
+  "application/manifest+json": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["webmanifest"]
+  },
+  "application/marc": {
+    "source": "iana",
+    "extensions": ["mrc"]
+  },
+  "application/marcxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mrcx"]
+  },
+  "application/mathematica": {
+    "source": "iana",
+    "extensions": ["ma","nb","mb"]
+  },
+  "application/mathml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mathml"]
+  },
+  "application/mathml-content+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mathml-presentation+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-associated-procedure-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-deregister+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-envelope+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-msk+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-msk-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-protection-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-reception-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-register+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-register-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-schedule+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbms-user-service-description+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mbox": {
+    "source": "iana",
+    "extensions": ["mbox"]
+  },
+  "application/media-policy-dataset+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpf"]
+  },
+  "application/media_control+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mediaservercontrol+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mscml"]
+  },
+  "application/merge-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/metalink+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["metalink"]
+  },
+  "application/metalink4+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["meta4"]
+  },
+  "application/mets+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mets"]
+  },
+  "application/mf4": {
+    "source": "iana"
+  },
+  "application/mikey": {
+    "source": "iana"
+  },
+  "application/mipc": {
+    "source": "iana"
+  },
+  "application/missing-blocks+cbor-seq": {
+    "source": "iana"
+  },
+  "application/mmt-aei+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["maei"]
+  },
+  "application/mmt-usd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["musd"]
+  },
+  "application/mods+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mods"]
+  },
+  "application/moss-keys": {
+    "source": "iana"
+  },
+  "application/moss-signature": {
+    "source": "iana"
+  },
+  "application/mosskey-data": {
+    "source": "iana"
+  },
+  "application/mosskey-request": {
+    "source": "iana"
+  },
+  "application/mp21": {
+    "source": "iana",
+    "extensions": ["m21","mp21"]
+  },
+  "application/mp4": {
+    "source": "iana",
+    "extensions": ["mp4","mpg4","mp4s","m4p"]
+  },
+  "application/mpeg4-generic": {
+    "source": "iana"
+  },
+  "application/mpeg4-iod": {
+    "source": "iana"
+  },
+  "application/mpeg4-iod-xmt": {
+    "source": "iana"
+  },
+  "application/mrb-consumer+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/mrb-publish+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/msc-ivr+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/msc-mixer+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/msix": {
+    "compressible": false,
+    "extensions": ["msix"]
+  },
+  "application/msixbundle": {
+    "compressible": false,
+    "extensions": ["msixbundle"]
+  },
+  "application/msword": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["doc","dot"]
+  },
+  "application/mud+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/multipart-core": {
+    "source": "iana"
+  },
+  "application/mxf": {
+    "source": "iana",
+    "extensions": ["mxf"]
+  },
+  "application/n-quads": {
+    "source": "iana",
+    "extensions": ["nq"]
+  },
+  "application/n-triples": {
+    "source": "iana",
+    "extensions": ["nt"]
+  },
+  "application/nasdata": {
+    "source": "iana"
+  },
+  "application/news-checkgroups": {
+    "source": "iana",
+    "charset": "US-ASCII"
+  },
+  "application/news-groupinfo": {
+    "source": "iana",
+    "charset": "US-ASCII"
+  },
+  "application/news-transmission": {
+    "source": "iana"
+  },
+  "application/nlsml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/node": {
+    "source": "iana",
+    "extensions": ["cjs"]
+  },
+  "application/nss": {
+    "source": "iana"
+  },
+  "application/oauth-authz-req+jwt": {
+    "source": "iana"
+  },
+  "application/oblivious-dns-message": {
+    "source": "iana"
+  },
+  "application/ocsp-request": {
+    "source": "iana"
+  },
+  "application/ocsp-response": {
+    "source": "iana"
+  },
+  "application/octet-stream": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bin","dms","lrf","mar","so","dist","distz","pkg","bpk","dump","elc","deploy","exe","dll","deb","dmg","iso","img","msi","msp","msm","buffer"]
+  },
+  "application/oda": {
+    "source": "iana",
+    "extensions": ["oda"]
+  },
+  "application/odm+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/odx": {
+    "source": "iana"
+  },
+  "application/oebps-package+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["opf"]
+  },
+  "application/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ogx"]
+  },
+  "application/ohttp-keys": {
+    "source": "iana"
+  },
+  "application/omdoc+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["omdoc"]
+  },
+  "application/onenote": {
+    "source": "apache",
+    "extensions": ["onetoc","onetoc2","onetmp","onepkg","one","onea"]
+  },
+  "application/opc-nodeset+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/oscore": {
+    "source": "iana"
+  },
+  "application/oxps": {
+    "source": "iana",
+    "extensions": ["oxps"]
+  },
+  "application/p21": {
+    "source": "iana"
+  },
+  "application/p21+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/p2p-overlay+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["relo"]
+  },
+  "application/parityfec": {
+    "source": "iana"
+  },
+  "application/passport": {
+    "source": "iana"
+  },
+  "application/patch-ops-error+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xer"]
+  },
+  "application/pdf": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pdf"]
+  },
+  "application/pdx": {
+    "source": "iana"
+  },
+  "application/pem-certificate-chain": {
+    "source": "iana"
+  },
+  "application/pgp-encrypted": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pgp"]
+  },
+  "application/pgp-keys": {
+    "source": "iana",
+    "extensions": ["asc"]
+  },
+  "application/pgp-signature": {
+    "source": "iana",
+    "extensions": ["sig","asc"]
+  },
+  "application/pics-rules": {
+    "source": "apache",
+    "extensions": ["prf"]
+  },
+  "application/pidf+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/pidf-diff+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/pkcs10": {
+    "source": "iana",
+    "extensions": ["p10"]
+  },
+  "application/pkcs12": {
+    "source": "iana"
+  },
+  "application/pkcs7-mime": {
+    "source": "iana",
+    "extensions": ["p7m","p7c"]
+  },
+  "application/pkcs7-signature": {
+    "source": "iana",
+    "extensions": ["p7s"]
+  },
+  "application/pkcs8": {
+    "source": "iana",
+    "extensions": ["p8"]
+  },
+  "application/pkcs8-encrypted": {
+    "source": "iana"
+  },
+  "application/pkix-attr-cert": {
+    "source": "iana",
+    "extensions": ["ac"]
+  },
+  "application/pkix-cert": {
+    "source": "iana",
+    "extensions": ["cer"]
+  },
+  "application/pkix-crl": {
+    "source": "iana",
+    "extensions": ["crl"]
+  },
+  "application/pkix-pkipath": {
+    "source": "iana",
+    "extensions": ["pkipath"]
+  },
+  "application/pkixcmp": {
+    "source": "iana",
+    "extensions": ["pki"]
+  },
+  "application/pls+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["pls"]
+  },
+  "application/poc-settings+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/postscript": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ai","eps","ps"]
+  },
+  "application/ppsp-tracker+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/private-token-issuer-directory": {
+    "source": "iana"
+  },
+  "application/private-token-request": {
+    "source": "iana"
+  },
+  "application/private-token-response": {
+    "source": "iana"
+  },
+  "application/problem+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/problem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/provenance+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["provx"]
+  },
+  "application/provided-claims+jwt": {
+    "source": "iana"
+  },
+  "application/prs.alvestrand.titrax-sheet": {
+    "source": "iana"
+  },
+  "application/prs.cww": {
+    "source": "iana",
+    "extensions": ["cww"]
+  },
+  "application/prs.cyn": {
+    "source": "iana",
+    "charset": "7-BIT"
+  },
+  "application/prs.hpub+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/prs.implied-document+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/prs.implied-executable": {
+    "source": "iana"
+  },
+  "application/prs.implied-object+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/prs.implied-object+json-seq": {
+    "source": "iana"
+  },
+  "application/prs.implied-object+yaml": {
+    "source": "iana"
+  },
+  "application/prs.implied-structure": {
+    "source": "iana"
+  },
+  "application/prs.mayfile": {
+    "source": "iana"
+  },
+  "application/prs.nprend": {
+    "source": "iana"
+  },
+  "application/prs.plucker": {
+    "source": "iana"
+  },
+  "application/prs.rdf-xml-crypt": {
+    "source": "iana"
+  },
+  "application/prs.vcfbzip2": {
+    "source": "iana"
+  },
+  "application/prs.xsf+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xsf"]
+  },
+  "application/pskc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["pskcxml"]
+  },
+  "application/pvd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/qsig": {
+    "source": "iana"
+  },
+  "application/raml+yaml": {
+    "compressible": true,
+    "extensions": ["raml"]
+  },
+  "application/raptorfec": {
+    "source": "iana"
+  },
+  "application/rdap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/rdf+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rdf","owl"]
+  },
+  "application/reginfo+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rif"]
+  },
+  "application/relax-ng-compact-syntax": {
+    "source": "iana",
+    "extensions": ["rnc"]
+  },
+  "application/remote-printing": {
+    "source": "apache"
+  },
+  "application/reputon+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/resolve-response+jwt": {
+    "source": "iana"
+  },
+  "application/resource-lists+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rl"]
+  },
+  "application/resource-lists-diff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rld"]
+  },
+  "application/rfc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/riscos": {
+    "source": "iana"
+  },
+  "application/rlmi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/rls-services+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rs"]
+  },
+  "application/route-apd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rapd"]
+  },
+  "application/route-s-tsid+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sls"]
+  },
+  "application/route-usd+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rusd"]
+  },
+  "application/rpki-checklist": {
+    "source": "iana"
+  },
+  "application/rpki-ghostbusters": {
+    "source": "iana",
+    "extensions": ["gbr"]
+  },
+  "application/rpki-manifest": {
+    "source": "iana",
+    "extensions": ["mft"]
+  },
+  "application/rpki-publication": {
+    "source": "iana"
+  },
+  "application/rpki-roa": {
+    "source": "iana",
+    "extensions": ["roa"]
+  },
+  "application/rpki-signed-tal": {
+    "source": "iana"
+  },
+  "application/rpki-updown": {
+    "source": "iana"
+  },
+  "application/rsd+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["rsd"]
+  },
+  "application/rss+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["rss"]
+  },
+  "application/rtf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtf"]
+  },
+  "application/rtploopback": {
+    "source": "iana"
+  },
+  "application/rtx": {
+    "source": "iana"
+  },
+  "application/samlassertion+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/samlmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sarif+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sarif-external-properties+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sbe": {
+    "source": "iana"
+  },
+  "application/sbml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sbml"]
+  },
+  "application/scaip+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/scim+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/scvp-cv-request": {
+    "source": "iana",
+    "extensions": ["scq"]
+  },
+  "application/scvp-cv-response": {
+    "source": "iana",
+    "extensions": ["scs"]
+  },
+  "application/scvp-vp-request": {
+    "source": "iana",
+    "extensions": ["spq"]
+  },
+  "application/scvp-vp-response": {
+    "source": "iana",
+    "extensions": ["spp"]
+  },
+  "application/sdp": {
+    "source": "iana",
+    "extensions": ["sdp"]
+  },
+  "application/secevent+jwt": {
+    "source": "iana"
+  },
+  "application/senml+cbor": {
+    "source": "iana"
+  },
+  "application/senml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/senml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["senmlx"]
+  },
+  "application/senml-etch+cbor": {
+    "source": "iana"
+  },
+  "application/senml-etch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/senml-exi": {
+    "source": "iana"
+  },
+  "application/sensml+cbor": {
+    "source": "iana"
+  },
+  "application/sensml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sensml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sensmlx"]
+  },
+  "application/sensml-exi": {
+    "source": "iana"
+  },
+  "application/sep+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sep-exi": {
+    "source": "iana"
+  },
+  "application/session-info": {
+    "source": "iana"
+  },
+  "application/set-payment": {
+    "source": "iana"
+  },
+  "application/set-payment-initiation": {
+    "source": "iana",
+    "extensions": ["setpay"]
+  },
+  "application/set-registration": {
+    "source": "iana"
+  },
+  "application/set-registration-initiation": {
+    "source": "iana",
+    "extensions": ["setreg"]
+  },
+  "application/sgml": {
+    "source": "iana"
+  },
+  "application/sgml-open-catalog": {
+    "source": "iana"
+  },
+  "application/shf+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["shf"]
+  },
+  "application/sieve": {
+    "source": "iana",
+    "extensions": ["siv","sieve"]
+  },
+  "application/simple-filter+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/simple-message-summary": {
+    "source": "iana"
+  },
+  "application/simplesymbolcontainer": {
+    "source": "iana"
+  },
+  "application/sipc": {
+    "source": "iana"
+  },
+  "application/slate": {
+    "source": "iana"
+  },
+  "application/smil": {
+    "source": "apache"
+  },
+  "application/smil+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["smi","smil"]
+  },
+  "application/smpte336m": {
+    "source": "iana"
+  },
+  "application/soap+fastinfoset": {
+    "source": "iana"
+  },
+  "application/soap+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sparql-query": {
+    "source": "iana",
+    "extensions": ["rq"]
+  },
+  "application/sparql-results+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["srx"]
+  },
+  "application/spdx+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/spirits-event+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/sql": {
+    "source": "iana",
+    "extensions": ["sql"]
+  },
+  "application/srgs": {
+    "source": "iana",
+    "extensions": ["gram"]
+  },
+  "application/srgs+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["grxml"]
+  },
+  "application/sru+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sru"]
+  },
+  "application/ssdl+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ssdl"]
+  },
+  "application/sslkeylogfile": {
+    "source": "iana"
+  },
+  "application/ssml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ssml"]
+  },
+  "application/st2110-41": {
+    "source": "iana"
+  },
+  "application/stix+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/stratum": {
+    "source": "iana"
+  },
+  "application/swid+cbor": {
+    "source": "iana"
+  },
+  "application/swid+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["swidtag"]
+  },
+  "application/tamp-apex-update": {
+    "source": "iana"
+  },
+  "application/tamp-apex-update-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-community-update": {
+    "source": "iana"
+  },
+  "application/tamp-community-update-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-error": {
+    "source": "iana"
+  },
+  "application/tamp-sequence-adjust": {
+    "source": "iana"
+  },
+  "application/tamp-sequence-adjust-confirm": {
+    "source": "iana"
+  },
+  "application/tamp-status-query": {
+    "source": "iana"
+  },
+  "application/tamp-status-response": {
+    "source": "iana"
+  },
+  "application/tamp-update": {
+    "source": "iana"
+  },
+  "application/tamp-update-confirm": {
+    "source": "iana"
+  },
+  "application/tar": {
+    "compressible": true
+  },
+  "application/taxii+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/td+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/tei+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tei","teicorpus"]
+  },
+  "application/tetra_isi": {
+    "source": "iana"
+  },
+  "application/thraud+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tfi"]
+  },
+  "application/timestamp-query": {
+    "source": "iana"
+  },
+  "application/timestamp-reply": {
+    "source": "iana"
+  },
+  "application/timestamped-data": {
+    "source": "iana",
+    "extensions": ["tsd"]
+  },
+  "application/tlsrpt+gzip": {
+    "source": "iana"
+  },
+  "application/tlsrpt+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/tm+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/tnauthlist": {
+    "source": "iana"
+  },
+  "application/toc+cbor": {
+    "source": "iana"
+  },
+  "application/token-introspection+jwt": {
+    "source": "iana"
+  },
+  "application/toml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["toml"]
+  },
+  "application/trickle-ice-sdpfrag": {
+    "source": "iana"
+  },
+  "application/trig": {
+    "source": "iana",
+    "extensions": ["trig"]
+  },
+  "application/trust-chain+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/trust-mark+jwt": {
+    "source": "iana"
+  },
+  "application/trust-mark-delegation+jwt": {
+    "source": "iana"
+  },
+  "application/ttml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ttml"]
+  },
+  "application/tve-trigger": {
+    "source": "iana"
+  },
+  "application/tzif": {
+    "source": "iana"
+  },
+  "application/tzif-leap": {
+    "source": "iana"
+  },
+  "application/ubjson": {
+    "compressible": false,
+    "extensions": ["ubj"]
+  },
+  "application/uccs+cbor": {
+    "source": "iana"
+  },
+  "application/ujcs+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/ulpfec": {
+    "source": "iana"
+  },
+  "application/urc-grpsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/urc-ressheet+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rsheet"]
+  },
+  "application/urc-targetdesc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["td"]
+  },
+  "application/urc-uisocketdesc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vc": {
+    "source": "iana"
+  },
+  "application/vc+cose": {
+    "source": "iana"
+  },
+  "application/vc+jwt": {
+    "source": "iana"
+  },
+  "application/vcard+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vcard+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vemmi": {
+    "source": "iana"
+  },
+  "application/vividence.scriptfile": {
+    "source": "apache"
+  },
+  "application/vnd.1000minds.decision-model+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["1km"]
+  },
+  "application/vnd.1ob": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp-prose+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-prose-pc3a+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-prose-pc3ach+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-prose-pc3ch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-prose-pc8+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp-v2x-local-service-information": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gnas": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gsa2x": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gsa2x-local-service-information": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gsv2x": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.5gsv2x-local-service-information": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.access-transfer-events+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.bsf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.crs+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.current-location-discovery+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.gmop+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.gtpc": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.interworking-data": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.lpp": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mc-signalling-ear": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-msgstore-ctrl-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-payload": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-regroup+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-signalling": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.mcdata-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcdata-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-floor-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-location-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-mbms-usage-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-regroup+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-signed+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-ue-init-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcptt-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-affiliation-command+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-location-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-mbms-usage-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-regroup+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-service-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-transmission-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-ue-config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mcvideo-user-profile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.mid-call+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.ngap": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.pfcp": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.pic-bw-large": {
+    "source": "iana",
+    "extensions": ["plb"]
+  },
+  "application/vnd.3gpp.pic-bw-small": {
+    "source": "iana",
+    "extensions": ["psb"]
+  },
+  "application/vnd.3gpp.pic-bw-var": {
+    "source": "iana",
+    "extensions": ["pvb"]
+  },
+  "application/vnd.3gpp.pinapp-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.s1ap": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.seal-group-doc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-location-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-mbms-usage-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-network-qos-management-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-ue-config-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-unicast-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.seal-user-profile-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.sms": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.sms+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.srvcc-ext+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.srvcc-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.state-and-event-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.ussd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp.v2x": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp.vae-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp2.bcmcsinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.3gpp2.sms": {
+    "source": "iana"
+  },
+  "application/vnd.3gpp2.tcap": {
+    "source": "iana",
+    "extensions": ["tcap"]
+  },
+  "application/vnd.3lightssoftware.imagescal": {
+    "source": "iana"
+  },
+  "application/vnd.3m.post-it-notes": {
+    "source": "iana",
+    "extensions": ["pwn"]
+  },
+  "application/vnd.accpac.simply.aso": {
+    "source": "iana",
+    "extensions": ["aso"]
+  },
+  "application/vnd.accpac.simply.imp": {
+    "source": "iana",
+    "extensions": ["imp"]
+  },
+  "application/vnd.acm.addressxfer+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.acm.chatbot+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.acucobol": {
+    "source": "iana",
+    "extensions": ["acu"]
+  },
+  "application/vnd.acucorp": {
+    "source": "iana",
+    "extensions": ["atc","acutc"]
+  },
+  "application/vnd.adobe.air-application-installer-package+zip": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["air"]
+  },
+  "application/vnd.adobe.flash.movie": {
+    "source": "iana"
+  },
+  "application/vnd.adobe.formscentral.fcdt": {
+    "source": "iana",
+    "extensions": ["fcdt"]
+  },
+  "application/vnd.adobe.fxp": {
+    "source": "iana",
+    "extensions": ["fxp","fxpl"]
+  },
+  "application/vnd.adobe.partial-upload": {
+    "source": "iana"
+  },
+  "application/vnd.adobe.xdp+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdp"]
+  },
+  "application/vnd.adobe.xfdf": {
+    "source": "apache",
+    "extensions": ["xfdf"]
+  },
+  "application/vnd.aether.imp": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.afplinedata": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.afplinedata-pagedef": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.cmoca-cmresource": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-charset": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-codedfont": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.foca-codepage": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-cmtable": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-formdef": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-mediummap": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-objectcontainer": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-overlay": {
+    "source": "iana"
+  },
+  "application/vnd.afpc.modca-pagesegment": {
+    "source": "iana"
+  },
+  "application/vnd.age": {
+    "source": "iana",
+    "extensions": ["age"]
+  },
+  "application/vnd.ah-barcode": {
+    "source": "apache"
+  },
+  "application/vnd.ahead.space": {
+    "source": "iana",
+    "extensions": ["ahead"]
+  },
+  "application/vnd.airzip.filesecure.azf": {
+    "source": "iana",
+    "extensions": ["azf"]
+  },
+  "application/vnd.airzip.filesecure.azs": {
+    "source": "iana",
+    "extensions": ["azs"]
+  },
+  "application/vnd.amadeus+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.amazon.ebook": {
+    "source": "apache",
+    "extensions": ["azw"]
+  },
+  "application/vnd.amazon.mobi8-ebook": {
+    "source": "iana"
+  },
+  "application/vnd.americandynamics.acc": {
+    "source": "iana",
+    "extensions": ["acc"]
+  },
+  "application/vnd.amiga.ami": {
+    "source": "iana",
+    "extensions": ["ami"]
+  },
+  "application/vnd.amundsen.maze+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.android.ota": {
+    "source": "iana"
+  },
+  "application/vnd.android.package-archive": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["apk"]
+  },
+  "application/vnd.anki": {
+    "source": "iana"
+  },
+  "application/vnd.anser-web-certificate-issue-initiation": {
+    "source": "iana",
+    "extensions": ["cii"]
+  },
+  "application/vnd.anser-web-funds-transfer-initiation": {
+    "source": "apache",
+    "extensions": ["fti"]
+  },
+  "application/vnd.antix.game-component": {
+    "source": "iana",
+    "extensions": ["atx"]
+  },
+  "application/vnd.apache.arrow.file": {
+    "source": "iana"
+  },
+  "application/vnd.apache.arrow.stream": {
+    "source": "iana"
+  },
+  "application/vnd.apache.parquet": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.binary": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.compact": {
+    "source": "iana"
+  },
+  "application/vnd.apache.thrift.json": {
+    "source": "iana"
+  },
+  "application/vnd.apexlang": {
+    "source": "iana"
+  },
+  "application/vnd.api+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.aplextor.warrp+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.apothekende.reservation+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.apple.installer+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mpkg"]
+  },
+  "application/vnd.apple.keynote": {
+    "source": "iana",
+    "extensions": ["key"]
+  },
+  "application/vnd.apple.mpegurl": {
+    "source": "iana",
+    "extensions": ["m3u8"]
+  },
+  "application/vnd.apple.numbers": {
+    "source": "iana",
+    "extensions": ["numbers"]
+  },
+  "application/vnd.apple.pages": {
+    "source": "iana",
+    "extensions": ["pages"]
+  },
+  "application/vnd.apple.pkpass": {
+    "compressible": false,
+    "extensions": ["pkpass"]
+  },
+  "application/vnd.arastra.swi": {
+    "source": "apache"
+  },
+  "application/vnd.aristanetworks.swi": {
+    "source": "iana",
+    "extensions": ["swi"]
+  },
+  "application/vnd.artisan+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.artsquare": {
+    "source": "iana"
+  },
+  "application/vnd.astraea-software.iota": {
+    "source": "iana",
+    "extensions": ["iota"]
+  },
+  "application/vnd.audiograph": {
+    "source": "iana",
+    "extensions": ["aep"]
+  },
+  "application/vnd.autodesk.fbx": {
+    "extensions": ["fbx"]
+  },
+  "application/vnd.autopackage": {
+    "source": "iana"
+  },
+  "application/vnd.avalon+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.avistar+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.balsamiq.bmml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bmml"]
+  },
+  "application/vnd.balsamiq.bmpr": {
+    "source": "iana"
+  },
+  "application/vnd.banana-accounting": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.error": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.msg": {
+    "source": "iana"
+  },
+  "application/vnd.bbf.usp.msg+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.bekitzur-stech+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.belightsoft.lhzd+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.belightsoft.lhzl+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.bint.med-content": {
+    "source": "iana"
+  },
+  "application/vnd.biopax.rdf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.blink-idb-value-wrapper": {
+    "source": "iana"
+  },
+  "application/vnd.blueice.multipass": {
+    "source": "iana",
+    "extensions": ["mpm"]
+  },
+  "application/vnd.bluetooth.ep.oob": {
+    "source": "iana"
+  },
+  "application/vnd.bluetooth.le.oob": {
+    "source": "iana"
+  },
+  "application/vnd.bmi": {
+    "source": "iana",
+    "extensions": ["bmi"]
+  },
+  "application/vnd.bpf": {
+    "source": "iana"
+  },
+  "application/vnd.bpf3": {
+    "source": "iana"
+  },
+  "application/vnd.businessobjects": {
+    "source": "iana",
+    "extensions": ["rep"]
+  },
+  "application/vnd.byu.uapi+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.bzip3": {
+    "source": "iana"
+  },
+  "application/vnd.c3voc.schedule+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cab-jscript": {
+    "source": "iana"
+  },
+  "application/vnd.canon-cpdl": {
+    "source": "iana"
+  },
+  "application/vnd.canon-lips": {
+    "source": "iana"
+  },
+  "application/vnd.capasystems-pg+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cendio.thinlinc.clientconf": {
+    "source": "iana"
+  },
+  "application/vnd.century-systems.tcp_stream": {
+    "source": "iana"
+  },
+  "application/vnd.chemdraw+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["cdxml"]
+  },
+  "application/vnd.chess-pgn": {
+    "source": "iana"
+  },
+  "application/vnd.chipnuts.karaoke-mmd": {
+    "source": "iana",
+    "extensions": ["mmd"]
+  },
+  "application/vnd.ciedi": {
+    "source": "iana"
+  },
+  "application/vnd.cinderella": {
+    "source": "iana",
+    "extensions": ["cdy"]
+  },
+  "application/vnd.cirpack.isdn-ext": {
+    "source": "iana"
+  },
+  "application/vnd.citationstyles.style+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["csl"]
+  },
+  "application/vnd.claymore": {
+    "source": "iana",
+    "extensions": ["cla"]
+  },
+  "application/vnd.cloanto.rp9": {
+    "source": "iana",
+    "extensions": ["rp9"]
+  },
+  "application/vnd.clonk.c4group": {
+    "source": "iana",
+    "extensions": ["c4g","c4d","c4f","c4p","c4u"]
+  },
+  "application/vnd.cluetrust.cartomobile-config": {
+    "source": "iana",
+    "extensions": ["c11amc"]
+  },
+  "application/vnd.cluetrust.cartomobile-config-pkg": {
+    "source": "iana",
+    "extensions": ["c11amz"]
+  },
+  "application/vnd.cncf.helm.chart.content.v1.tar+gzip": {
+    "source": "iana"
+  },
+  "application/vnd.cncf.helm.chart.provenance.v1.prov": {
+    "source": "iana"
+  },
+  "application/vnd.cncf.helm.config.v1+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.coffeescript": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.document": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.document-template": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.presentation": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.presentation-template": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.spreadsheet": {
+    "source": "iana"
+  },
+  "application/vnd.collabio.xodocuments.spreadsheet-template": {
+    "source": "iana"
+  },
+  "application/vnd.collection+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.collection.doc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.collection.next+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.comicbook+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.comicbook-rar": {
+    "source": "iana"
+  },
+  "application/vnd.commerce-battelle": {
+    "source": "iana"
+  },
+  "application/vnd.commonspace": {
+    "source": "iana",
+    "extensions": ["csp"]
+  },
+  "application/vnd.contact.cmsg": {
+    "source": "iana",
+    "extensions": ["cdbcmsg"]
+  },
+  "application/vnd.coreos.ignition+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cosmocaller": {
+    "source": "iana",
+    "extensions": ["cmc"]
+  },
+  "application/vnd.crick.clicker": {
+    "source": "iana",
+    "extensions": ["clkx"]
+  },
+  "application/vnd.crick.clicker.keyboard": {
+    "source": "iana",
+    "extensions": ["clkk"]
+  },
+  "application/vnd.crick.clicker.palette": {
+    "source": "iana",
+    "extensions": ["clkp"]
+  },
+  "application/vnd.crick.clicker.template": {
+    "source": "iana",
+    "extensions": ["clkt"]
+  },
+  "application/vnd.crick.clicker.wordbank": {
+    "source": "iana",
+    "extensions": ["clkw"]
+  },
+  "application/vnd.criticaltools.wbs+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wbs"]
+  },
+  "application/vnd.cryptii.pipe+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.crypto-shade-file": {
+    "source": "iana"
+  },
+  "application/vnd.cryptomator.encrypted": {
+    "source": "iana"
+  },
+  "application/vnd.cryptomator.vault": {
+    "source": "iana"
+  },
+  "application/vnd.ctc-posml": {
+    "source": "iana",
+    "extensions": ["pml"]
+  },
+  "application/vnd.ctct.ws+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cups-pdf": {
+    "source": "iana"
+  },
+  "application/vnd.cups-postscript": {
+    "source": "iana"
+  },
+  "application/vnd.cups-ppd": {
+    "source": "iana",
+    "extensions": ["ppd"]
+  },
+  "application/vnd.cups-raster": {
+    "source": "iana"
+  },
+  "application/vnd.cups-raw": {
+    "source": "iana"
+  },
+  "application/vnd.curl": {
+    "source": "iana"
+  },
+  "application/vnd.curl.car": {
+    "source": "apache",
+    "extensions": ["car"]
+  },
+  "application/vnd.curl.pcurl": {
+    "source": "apache",
+    "extensions": ["pcurl"]
+  },
+  "application/vnd.cyan.dean.root+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cybank": {
+    "source": "iana"
+  },
+  "application/vnd.cyclonedx+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.cyclonedx+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.d2l.coursepackage1p0+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.d3m-dataset": {
+    "source": "iana"
+  },
+  "application/vnd.d3m-problem": {
+    "source": "iana"
+  },
+  "application/vnd.dart": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dart"]
+  },
+  "application/vnd.data-vision.rdz": {
+    "source": "iana",
+    "extensions": ["rdz"]
+  },
+  "application/vnd.datalog": {
+    "source": "iana"
+  },
+  "application/vnd.datapackage+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dataresource+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dbf": {
+    "source": "iana",
+    "extensions": ["dbf"]
+  },
+  "application/vnd.dcmp+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dcmp"]
+  },
+  "application/vnd.debian.binary-package": {
+    "source": "iana"
+  },
+  "application/vnd.dece.data": {
+    "source": "iana",
+    "extensions": ["uvf","uvvf","uvd","uvvd"]
+  },
+  "application/vnd.dece.ttml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uvt","uvvt"]
+  },
+  "application/vnd.dece.unspecified": {
+    "source": "iana",
+    "extensions": ["uvx","uvvx"]
+  },
+  "application/vnd.dece.zip": {
+    "source": "iana",
+    "extensions": ["uvz","uvvz"]
+  },
+  "application/vnd.denovo.fcselayout-link": {
+    "source": "iana",
+    "extensions": ["fe_launch"]
+  },
+  "application/vnd.desmume.movie": {
+    "source": "iana"
+  },
+  "application/vnd.dir-bi.plate-dl-nosuffix": {
+    "source": "iana"
+  },
+  "application/vnd.dm.delegation+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dna": {
+    "source": "iana",
+    "extensions": ["dna"]
+  },
+  "application/vnd.document+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dolby.mlp": {
+    "source": "apache",
+    "extensions": ["mlp"]
+  },
+  "application/vnd.dolby.mobile.1": {
+    "source": "iana"
+  },
+  "application/vnd.dolby.mobile.2": {
+    "source": "iana"
+  },
+  "application/vnd.doremir.scorecloud-binary-document": {
+    "source": "iana"
+  },
+  "application/vnd.dpgraph": {
+    "source": "iana",
+    "extensions": ["dpg"]
+  },
+  "application/vnd.dreamfactory": {
+    "source": "iana",
+    "extensions": ["dfac"]
+  },
+  "application/vnd.drive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ds-keypoint": {
+    "source": "apache",
+    "extensions": ["kpxx"]
+  },
+  "application/vnd.dtg.local": {
+    "source": "iana"
+  },
+  "application/vnd.dtg.local.flash": {
+    "source": "iana"
+  },
+  "application/vnd.dtg.local.html": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ait": {
+    "source": "iana",
+    "extensions": ["ait"]
+  },
+  "application/vnd.dvb.dvbisl+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.dvbj": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.esgcontainer": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcdftnotifaccess": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgaccess": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgaccess2": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcesgpdd": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.ipdcroaming": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.iptv.alfec-base": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.iptv.alfec-enhancement": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.notif-aggregate-root+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-container+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-generic+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-msglist+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-registration-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-ia-registration-response+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.notif-init+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.dvb.pfr": {
+    "source": "iana"
+  },
+  "application/vnd.dvb.service": {
+    "source": "iana",
+    "extensions": ["svc"]
+  },
+  "application/vnd.dxr": {
+    "source": "iana"
+  },
+  "application/vnd.dynageo": {
+    "source": "iana",
+    "extensions": ["geo"]
+  },
+  "application/vnd.dzr": {
+    "source": "iana"
+  },
+  "application/vnd.easykaraoke.cdgdownload": {
+    "source": "iana"
+  },
+  "application/vnd.ecdis-update": {
+    "source": "iana"
+  },
+  "application/vnd.ecip.rlp": {
+    "source": "iana"
+  },
+  "application/vnd.eclipse.ditto+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ecowin.chart": {
+    "source": "iana",
+    "extensions": ["mag"]
+  },
+  "application/vnd.ecowin.filerequest": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.fileupdate": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.series": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.seriesrequest": {
+    "source": "iana"
+  },
+  "application/vnd.ecowin.seriesupdate": {
+    "source": "iana"
+  },
+  "application/vnd.efi.img": {
+    "source": "iana"
+  },
+  "application/vnd.efi.iso": {
+    "source": "iana"
+  },
+  "application/vnd.eln+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.emclient.accessrequest+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.enliven": {
+    "source": "iana",
+    "extensions": ["nml"]
+  },
+  "application/vnd.enphase.envoy": {
+    "source": "iana"
+  },
+  "application/vnd.eprints.data+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.epson.esf": {
+    "source": "iana",
+    "extensions": ["esf"]
+  },
+  "application/vnd.epson.msf": {
+    "source": "iana",
+    "extensions": ["msf"]
+  },
+  "application/vnd.epson.quickanime": {
+    "source": "iana",
+    "extensions": ["qam"]
+  },
+  "application/vnd.epson.salt": {
+    "source": "iana",
+    "extensions": ["slt"]
+  },
+  "application/vnd.epson.ssf": {
+    "source": "iana",
+    "extensions": ["ssf"]
+  },
+  "application/vnd.ericsson.quickcall": {
+    "source": "iana"
+  },
+  "application/vnd.erofs": {
+    "source": "iana"
+  },
+  "application/vnd.espass-espass+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.eszigno3+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["es3","et3"]
+  },
+  "application/vnd.etsi.aoc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.asic-e+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.etsi.asic-s+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.etsi.cug+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvcommand+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvdiscovery+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-bc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-cod+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsad-npvr+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvservice+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvsync+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.iptvueprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.mcid+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.mheg5": {
+    "source": "iana"
+  },
+  "application/vnd.etsi.overload-control-policy-dataset+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.pstn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.sci+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.simservs+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.timestamp-token": {
+    "source": "iana"
+  },
+  "application/vnd.etsi.tsl+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.etsi.tsl.der": {
+    "source": "iana"
+  },
+  "application/vnd.eu.kasparian.car+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.eudora.data": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.profile": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.settings": {
+    "source": "iana"
+  },
+  "application/vnd.evolv.ecig.theme": {
+    "source": "iana"
+  },
+  "application/vnd.exstream-empower+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.exstream-package": {
+    "source": "iana"
+  },
+  "application/vnd.ezpix-album": {
+    "source": "iana",
+    "extensions": ["ez2"]
+  },
+  "application/vnd.ezpix-package": {
+    "source": "iana",
+    "extensions": ["ez3"]
+  },
+  "application/vnd.f-secure.mobile": {
+    "source": "iana"
+  },
+  "application/vnd.familysearch.gedcom+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.fastcopy-disk-image": {
+    "source": "iana"
+  },
+  "application/vnd.fdf": {
+    "source": "apache",
+    "extensions": ["fdf"]
+  },
+  "application/vnd.fdsn.mseed": {
+    "source": "iana",
+    "extensions": ["mseed"]
+  },
+  "application/vnd.fdsn.seed": {
+    "source": "iana",
+    "extensions": ["seed","dataless"]
+  },
+  "application/vnd.fdsn.stationxml+xml": {
+    "source": "iana",
+    "charset": "XML-BASED",
+    "compressible": true
+  },
+  "application/vnd.ffsns": {
+    "source": "iana"
+  },
+  "application/vnd.ficlab.flb+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.filmit.zfc": {
+    "source": "iana"
+  },
+  "application/vnd.fints": {
+    "source": "iana"
+  },
+  "application/vnd.firemonkeys.cloudcell": {
+    "source": "iana"
+  },
+  "application/vnd.flographit": {
+    "source": "iana",
+    "extensions": ["gph"]
+  },
+  "application/vnd.fluxtime.clip": {
+    "source": "iana",
+    "extensions": ["ftc"]
+  },
+  "application/vnd.font-fontforge-sfd": {
+    "source": "iana"
+  },
+  "application/vnd.framemaker": {
+    "source": "iana",
+    "extensions": ["fm","frame","maker","book"]
+  },
+  "application/vnd.freelog.comic": {
+    "source": "iana"
+  },
+  "application/vnd.frogans.fnc": {
+    "source": "apache",
+    "extensions": ["fnc"]
+  },
+  "application/vnd.frogans.ltf": {
+    "source": "apache",
+    "extensions": ["ltf"]
+  },
+  "application/vnd.fsc.weblaunch": {
+    "source": "iana",
+    "extensions": ["fsc"]
+  },
+  "application/vnd.fujifilm.fb.docuworks": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.docuworks.binder": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.docuworks.container": {
+    "source": "iana"
+  },
+  "application/vnd.fujifilm.fb.jfi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.fujitsu.oasys": {
+    "source": "iana",
+    "extensions": ["oas"]
+  },
+  "application/vnd.fujitsu.oasys2": {
+    "source": "iana",
+    "extensions": ["oa2"]
+  },
+  "application/vnd.fujitsu.oasys3": {
+    "source": "iana",
+    "extensions": ["oa3"]
+  },
+  "application/vnd.fujitsu.oasysgp": {
+    "source": "iana",
+    "extensions": ["fg5"]
+  },
+  "application/vnd.fujitsu.oasysprs": {
+    "source": "iana",
+    "extensions": ["bh2"]
+  },
+  "application/vnd.fujixerox.art-ex": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.art4": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.ddd": {
+    "source": "iana",
+    "extensions": ["ddd"]
+  },
+  "application/vnd.fujixerox.docuworks": {
+    "source": "iana",
+    "extensions": ["xdw"]
+  },
+  "application/vnd.fujixerox.docuworks.binder": {
+    "source": "iana",
+    "extensions": ["xbd"]
+  },
+  "application/vnd.fujixerox.docuworks.container": {
+    "source": "iana"
+  },
+  "application/vnd.fujixerox.hbpl": {
+    "source": "iana"
+  },
+  "application/vnd.fut-misnet": {
+    "source": "iana"
+  },
+  "application/vnd.futoin+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.futoin+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.fuzzysheet": {
+    "source": "iana",
+    "extensions": ["fzs"]
+  },
+  "application/vnd.ga4gh.passport+jwt": {
+    "source": "iana"
+  },
+  "application/vnd.genomatix.tuxedo": {
+    "source": "iana",
+    "extensions": ["txd"]
+  },
+  "application/vnd.genozip": {
+    "source": "iana"
+  },
+  "application/vnd.gentics.grd+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.gentoo.catmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.gentoo.ebuild": {
+    "source": "iana"
+  },
+  "application/vnd.gentoo.eclass": {
+    "source": "iana"
+  },
+  "application/vnd.gentoo.gpkg": {
+    "source": "iana"
+  },
+  "application/vnd.gentoo.manifest": {
+    "source": "iana"
+  },
+  "application/vnd.gentoo.pkgmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.gentoo.xpak": {
+    "source": "iana"
+  },
+  "application/vnd.geo+json": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.geocube+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.geogebra.file": {
+    "source": "iana",
+    "extensions": ["ggb"]
+  },
+  "application/vnd.geogebra.pinboard": {
+    "source": "iana"
+  },
+  "application/vnd.geogebra.slides": {
+    "source": "iana",
+    "extensions": ["ggs"]
+  },
+  "application/vnd.geogebra.tool": {
+    "source": "iana",
+    "extensions": ["ggt"]
+  },
+  "application/vnd.geometry-explorer": {
+    "source": "iana",
+    "extensions": ["gex","gre"]
+  },
+  "application/vnd.geonext": {
+    "source": "iana",
+    "extensions": ["gxt"]
+  },
+  "application/vnd.geoplan": {
+    "source": "iana",
+    "extensions": ["g2w"]
+  },
+  "application/vnd.geospace": {
+    "source": "iana",
+    "extensions": ["g3w"]
+  },
+  "application/vnd.gerber": {
+    "source": "iana"
+  },
+  "application/vnd.globalplatform.card-content-mgt": {
+    "source": "iana"
+  },
+  "application/vnd.globalplatform.card-content-mgt-response": {
+    "source": "iana"
+  },
+  "application/vnd.gmx": {
+    "source": "iana",
+    "extensions": ["gmx"]
+  },
+  "application/vnd.gnu.taler.exchange+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.gnu.taler.merchant+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.google-apps.audio": {},
+  "application/vnd.google-apps.document": {
+    "compressible": false,
+    "extensions": ["gdoc"]
+  },
+  "application/vnd.google-apps.drawing": {
+    "compressible": false,
+    "extensions": ["gdraw"]
+  },
+  "application/vnd.google-apps.drive-sdk": {
+    "compressible": false
+  },
+  "application/vnd.google-apps.file": {},
+  "application/vnd.google-apps.folder": {
+    "compressible": false
+  },
+  "application/vnd.google-apps.form": {
+    "compressible": false,
+    "extensions": ["gform"]
+  },
+  "application/vnd.google-apps.fusiontable": {},
+  "application/vnd.google-apps.jam": {
+    "compressible": false,
+    "extensions": ["gjam"]
+  },
+  "application/vnd.google-apps.mail-layout": {},
+  "application/vnd.google-apps.map": {
+    "compressible": false,
+    "extensions": ["gmap"]
+  },
+  "application/vnd.google-apps.photo": {},
+  "application/vnd.google-apps.presentation": {
+    "compressible": false,
+    "extensions": ["gslides"]
+  },
+  "application/vnd.google-apps.script": {
+    "compressible": false,
+    "extensions": ["gscript"]
+  },
+  "application/vnd.google-apps.shortcut": {},
+  "application/vnd.google-apps.site": {
+    "compressible": false,
+    "extensions": ["gsite"]
+  },
+  "application/vnd.google-apps.spreadsheet": {
+    "compressible": false,
+    "extensions": ["gsheet"]
+  },
+  "application/vnd.google-apps.unknown": {},
+  "application/vnd.google-apps.video": {},
+  "application/vnd.google-earth.kml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["kml"]
+  },
+  "application/vnd.google-earth.kmz": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["kmz"]
+  },
+  "application/vnd.gov.sk.e-form+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.gov.sk.e-form+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.gov.sk.xmldatacontainer+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdcf"]
+  },
+  "application/vnd.gpxsee.map+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.grafeq": {
+    "source": "iana",
+    "extensions": ["gqf","gqs"]
+  },
+  "application/vnd.gridmp": {
+    "source": "iana"
+  },
+  "application/vnd.groove-account": {
+    "source": "iana",
+    "extensions": ["gac"]
+  },
+  "application/vnd.groove-help": {
+    "source": "iana",
+    "extensions": ["ghf"]
+  },
+  "application/vnd.groove-identity-message": {
+    "source": "iana",
+    "extensions": ["gim"]
+  },
+  "application/vnd.groove-injector": {
+    "source": "iana",
+    "extensions": ["grv"]
+  },
+  "application/vnd.groove-tool-message": {
+    "source": "iana",
+    "extensions": ["gtm"]
+  },
+  "application/vnd.groove-tool-template": {
+    "source": "iana",
+    "extensions": ["tpl"]
+  },
+  "application/vnd.groove-vcard": {
+    "source": "iana",
+    "extensions": ["vcg"]
+  },
+  "application/vnd.hal+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hal+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["hal"]
+  },
+  "application/vnd.handheld-entertainment+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["zmm"]
+  },
+  "application/vnd.hbci": {
+    "source": "iana",
+    "extensions": ["hbci"]
+  },
+  "application/vnd.hc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hcl-bireports": {
+    "source": "iana"
+  },
+  "application/vnd.hdt": {
+    "source": "iana"
+  },
+  "application/vnd.heroku+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hhe.lesson-player": {
+    "source": "iana",
+    "extensions": ["les"]
+  },
+  "application/vnd.hp-hpgl": {
+    "source": "iana",
+    "extensions": ["hpgl"]
+  },
+  "application/vnd.hp-hpid": {
+    "source": "iana",
+    "extensions": ["hpid"]
+  },
+  "application/vnd.hp-hps": {
+    "source": "iana",
+    "extensions": ["hps"]
+  },
+  "application/vnd.hp-jlyt": {
+    "source": "iana",
+    "extensions": ["jlt"]
+  },
+  "application/vnd.hp-pcl": {
+    "source": "iana",
+    "extensions": ["pcl"]
+  },
+  "application/vnd.hp-pclxl": {
+    "source": "iana",
+    "extensions": ["pclxl"]
+  },
+  "application/vnd.hsl": {
+    "source": "iana"
+  },
+  "application/vnd.httphone": {
+    "source": "iana"
+  },
+  "application/vnd.hydrostatix.sof-data": {
+    "source": "iana",
+    "extensions": ["sfd-hdstx"]
+  },
+  "application/vnd.hyper+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hyper-item+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hyperdrive+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.hzn-3d-crossword": {
+    "source": "iana"
+  },
+  "application/vnd.ibm.afplinedata": {
+    "source": "apache"
+  },
+  "application/vnd.ibm.electronic-media": {
+    "source": "iana"
+  },
+  "application/vnd.ibm.minipay": {
+    "source": "iana",
+    "extensions": ["mpy"]
+  },
+  "application/vnd.ibm.modcap": {
+    "source": "apache",
+    "extensions": ["afp","listafp","list3820"]
+  },
+  "application/vnd.ibm.rights-management": {
+    "source": "iana",
+    "extensions": ["irm"]
+  },
+  "application/vnd.ibm.secure-container": {
+    "source": "iana",
+    "extensions": ["sc"]
+  },
+  "application/vnd.iccprofile": {
+    "source": "iana",
+    "extensions": ["icc","icm"]
+  },
+  "application/vnd.ieee.1905": {
+    "source": "iana"
+  },
+  "application/vnd.igloader": {
+    "source": "iana",
+    "extensions": ["igl"]
+  },
+  "application/vnd.imagemeter.folder+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.imagemeter.image+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.immervision-ivp": {
+    "source": "iana",
+    "extensions": ["ivp"]
+  },
+  "application/vnd.immervision-ivu": {
+    "source": "iana",
+    "extensions": ["ivu"]
+  },
+  "application/vnd.ims.imsccv1p1": {
+    "source": "iana"
+  },
+  "application/vnd.ims.imsccv1p2": {
+    "source": "iana"
+  },
+  "application/vnd.ims.imsccv1p3": {
+    "source": "iana"
+  },
+  "application/vnd.ims.lis.v2.result+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolconsumerprofile+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolproxy+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolproxy.id+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolsettings+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ims.lti.v2.toolsettings.simple+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.informedcontrol.rms+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.informix-visionary": {
+    "source": "apache"
+  },
+  "application/vnd.infotech.project": {
+    "source": "iana"
+  },
+  "application/vnd.infotech.project+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.innopath.wamp.notification": {
+    "source": "iana"
+  },
+  "application/vnd.insors.igm": {
+    "source": "iana",
+    "extensions": ["igm"]
+  },
+  "application/vnd.intercon.formnet": {
+    "source": "iana",
+    "extensions": ["xpw","xpx"]
+  },
+  "application/vnd.intergeo": {
+    "source": "iana",
+    "extensions": ["i2g"]
+  },
+  "application/vnd.intertrust.digibox": {
+    "source": "iana"
+  },
+  "application/vnd.intertrust.nncp": {
+    "source": "iana"
+  },
+  "application/vnd.intu.qbo": {
+    "source": "iana",
+    "extensions": ["qbo"]
+  },
+  "application/vnd.intu.qfx": {
+    "source": "iana",
+    "extensions": ["qfx"]
+  },
+  "application/vnd.ipfs.ipns-record": {
+    "source": "iana"
+  },
+  "application/vnd.ipld.car": {
+    "source": "iana"
+  },
+  "application/vnd.ipld.dag-cbor": {
+    "source": "iana"
+  },
+  "application/vnd.ipld.dag-json": {
+    "source": "iana"
+  },
+  "application/vnd.ipld.raw": {
+    "source": "iana"
+  },
+  "application/vnd.iptc.g2.catalogitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.conceptitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.knowledgeitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.newsitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.newsmessage+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.packageitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.iptc.g2.planningitem+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ipunplugged.rcprofile": {
+    "source": "iana",
+    "extensions": ["rcprofile"]
+  },
+  "application/vnd.irepository.package+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["irp"]
+  },
+  "application/vnd.is-xpr": {
+    "source": "iana",
+    "extensions": ["xpr"]
+  },
+  "application/vnd.isac.fcs": {
+    "source": "iana",
+    "extensions": ["fcs"]
+  },
+  "application/vnd.iso11783-10+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.jam": {
+    "source": "iana",
+    "extensions": ["jam"]
+  },
+  "application/vnd.japannet-directory-service": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-jpnstore-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-payment-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-registration": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-registration-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-setstore-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-verification": {
+    "source": "iana"
+  },
+  "application/vnd.japannet-verification-wakeup": {
+    "source": "iana"
+  },
+  "application/vnd.jcp.javame.midlet-rms": {
+    "source": "iana",
+    "extensions": ["rms"]
+  },
+  "application/vnd.jisp": {
+    "source": "iana",
+    "extensions": ["jisp"]
+  },
+  "application/vnd.joost.joda-archive": {
+    "source": "iana",
+    "extensions": ["joda"]
+  },
+  "application/vnd.jsk.isdn-ngn": {
+    "source": "iana"
+  },
+  "application/vnd.kahootz": {
+    "source": "iana",
+    "extensions": ["ktz","ktr"]
+  },
+  "application/vnd.kde.karbon": {
+    "source": "iana",
+    "extensions": ["karbon"]
+  },
+  "application/vnd.kde.kchart": {
+    "source": "iana",
+    "extensions": ["chrt"]
+  },
+  "application/vnd.kde.kformula": {
+    "source": "iana",
+    "extensions": ["kfo"]
+  },
+  "application/vnd.kde.kivio": {
+    "source": "iana",
+    "extensions": ["flw"]
+  },
+  "application/vnd.kde.kontour": {
+    "source": "iana",
+    "extensions": ["kon"]
+  },
+  "application/vnd.kde.kpresenter": {
+    "source": "iana",
+    "extensions": ["kpr","kpt"]
+  },
+  "application/vnd.kde.kspread": {
+    "source": "iana",
+    "extensions": ["ksp"]
+  },
+  "application/vnd.kde.kword": {
+    "source": "iana",
+    "extensions": ["kwd","kwt"]
+  },
+  "application/vnd.kdl": {
+    "source": "iana"
+  },
+  "application/vnd.kenameaapp": {
+    "source": "iana",
+    "extensions": ["htke"]
+  },
+  "application/vnd.keyman.kmp+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.keyman.kmx": {
+    "source": "iana"
+  },
+  "application/vnd.kidspiration": {
+    "source": "iana",
+    "extensions": ["kia"]
+  },
+  "application/vnd.kinar": {
+    "source": "iana",
+    "extensions": ["kne","knp"]
+  },
+  "application/vnd.koan": {
+    "source": "iana",
+    "extensions": ["skp","skd","skt","skm"]
+  },
+  "application/vnd.kodak-descriptor": {
+    "source": "iana",
+    "extensions": ["sse"]
+  },
+  "application/vnd.las": {
+    "source": "iana"
+  },
+  "application/vnd.las.las+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.las.las+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lasxml"]
+  },
+  "application/vnd.laszip": {
+    "source": "iana"
+  },
+  "application/vnd.ldev.productlicensing": {
+    "source": "iana"
+  },
+  "application/vnd.leap+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.liberty-request+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.llamagraphics.life-balance.desktop": {
+    "source": "iana",
+    "extensions": ["lbd"]
+  },
+  "application/vnd.llamagraphics.life-balance.exchange+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["lbe"]
+  },
+  "application/vnd.logipipe.circuit+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.loom": {
+    "source": "iana"
+  },
+  "application/vnd.lotus-1-2-3": {
+    "source": "iana",
+    "extensions": ["123"]
+  },
+  "application/vnd.lotus-approach": {
+    "source": "iana",
+    "extensions": ["apr"]
+  },
+  "application/vnd.lotus-freelance": {
+    "source": "iana",
+    "extensions": ["pre"]
+  },
+  "application/vnd.lotus-notes": {
+    "source": "iana",
+    "extensions": ["nsf"]
+  },
+  "application/vnd.lotus-organizer": {
+    "source": "iana",
+    "extensions": ["org"]
+  },
+  "application/vnd.lotus-screencam": {
+    "source": "iana",
+    "extensions": ["scm"]
+  },
+  "application/vnd.lotus-wordpro": {
+    "source": "iana",
+    "extensions": ["lwp"]
+  },
+  "application/vnd.macports.portpkg": {
+    "source": "iana",
+    "extensions": ["portpkg"]
+  },
+  "application/vnd.mapbox-vector-tile": {
+    "source": "iana",
+    "extensions": ["mvt"]
+  },
+  "application/vnd.marlin.drm.actiontoken+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.conftoken+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.license+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.marlin.drm.mdcf": {
+    "source": "iana"
+  },
+  "application/vnd.mason+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.maxar.archive.3tz+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.maxmind.maxmind-db": {
+    "source": "iana"
+  },
+  "application/vnd.mcd": {
+    "source": "iana",
+    "extensions": ["mcd"]
+  },
+  "application/vnd.mdl": {
+    "source": "iana"
+  },
+  "application/vnd.mdl-mbsdf": {
+    "source": "iana"
+  },
+  "application/vnd.medcalcdata": {
+    "source": "iana",
+    "extensions": ["mc1"]
+  },
+  "application/vnd.mediastation.cdkey": {
+    "source": "iana",
+    "extensions": ["cdkey"]
+  },
+  "application/vnd.medicalholodeck.recordxr": {
+    "source": "iana"
+  },
+  "application/vnd.meridian-slingshot": {
+    "source": "iana"
+  },
+  "application/vnd.mermaid": {
+    "source": "iana"
+  },
+  "application/vnd.mfer": {
+    "source": "iana",
+    "extensions": ["mwf"]
+  },
+  "application/vnd.mfmp": {
+    "source": "iana",
+    "extensions": ["mfm"]
+  },
+  "application/vnd.micro+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.micrografx.flo": {
+    "source": "iana",
+    "extensions": ["flo"]
+  },
+  "application/vnd.micrografx.igx": {
+    "source": "iana",
+    "extensions": ["igx"]
+  },
+  "application/vnd.microsoft.portable-executable": {
+    "source": "iana"
+  },
+  "application/vnd.microsoft.windows.thumbnail-cache": {
+    "source": "iana"
+  },
+  "application/vnd.miele+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.mif": {
+    "source": "iana",
+    "extensions": ["mif"]
+  },
+  "application/vnd.minisoft-hp3000-save": {
+    "source": "iana"
+  },
+  "application/vnd.mitsubishi.misty-guard.trustweb": {
+    "source": "iana"
+  },
+  "application/vnd.mobius.daf": {
+    "source": "iana",
+    "extensions": ["daf"]
+  },
+  "application/vnd.mobius.dis": {
+    "source": "iana",
+    "extensions": ["dis"]
+  },
+  "application/vnd.mobius.mbk": {
+    "source": "iana",
+    "extensions": ["mbk"]
+  },
+  "application/vnd.mobius.mqy": {
+    "source": "iana",
+    "extensions": ["mqy"]
+  },
+  "application/vnd.mobius.msl": {
+    "source": "iana",
+    "extensions": ["msl"]
+  },
+  "application/vnd.mobius.plc": {
+    "source": "iana",
+    "extensions": ["plc"]
+  },
+  "application/vnd.mobius.txf": {
+    "source": "iana",
+    "extensions": ["txf"]
+  },
+  "application/vnd.modl": {
+    "source": "iana"
+  },
+  "application/vnd.mophun.application": {
+    "source": "iana",
+    "extensions": ["mpn"]
+  },
+  "application/vnd.mophun.certificate": {
+    "source": "iana",
+    "extensions": ["mpc"]
+  },
+  "application/vnd.motorola.flexsuite": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.adsi": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.fis": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.gotap": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.kmr": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.ttc": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.flexsuite.wem": {
+    "source": "iana"
+  },
+  "application/vnd.motorola.iprm": {
+    "source": "iana"
+  },
+  "application/vnd.mozilla.xul+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xul"]
+  },
+  "application/vnd.ms-3mfdocument": {
+    "source": "iana"
+  },
+  "application/vnd.ms-artgalry": {
+    "source": "iana",
+    "extensions": ["cil"]
+  },
+  "application/vnd.ms-asf": {
+    "source": "iana"
+  },
+  "application/vnd.ms-cab-compressed": {
+    "source": "iana",
+    "extensions": ["cab"]
+  },
+  "application/vnd.ms-color.iccprofile": {
+    "source": "apache"
+  },
+  "application/vnd.ms-excel": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xls","xlm","xla","xlc","xlt","xlw"]
+  },
+  "application/vnd.ms-excel.addin.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlam"]
+  },
+  "application/vnd.ms-excel.sheet.binary.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlsb"]
+  },
+  "application/vnd.ms-excel.sheet.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xlsm"]
+  },
+  "application/vnd.ms-excel.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["xltm"]
+  },
+  "application/vnd.ms-fontobject": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["eot"]
+  },
+  "application/vnd.ms-htmlhelp": {
+    "source": "iana",
+    "extensions": ["chm"]
+  },
+  "application/vnd.ms-ims": {
+    "source": "iana",
+    "extensions": ["ims"]
+  },
+  "application/vnd.ms-lrm": {
+    "source": "iana",
+    "extensions": ["lrm"]
+  },
+  "application/vnd.ms-office.activex+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-officetheme": {
+    "source": "iana",
+    "extensions": ["thmx"]
+  },
+  "application/vnd.ms-opentype": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.ms-outlook": {
+    "compressible": false,
+    "extensions": ["msg"]
+  },
+  "application/vnd.ms-package.obfuscated-opentype": {
+    "source": "apache"
+  },
+  "application/vnd.ms-pki.seccat": {
+    "source": "apache",
+    "extensions": ["cat"]
+  },
+  "application/vnd.ms-pki.stl": {
+    "source": "apache",
+    "extensions": ["stl"]
+  },
+  "application/vnd.ms-playready.initiator+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-powerpoint": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ppt","pps","pot"]
+  },
+  "application/vnd.ms-powerpoint.addin.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["ppam"]
+  },
+  "application/vnd.ms-powerpoint.presentation.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["pptm"]
+  },
+  "application/vnd.ms-powerpoint.slide.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["sldm"]
+  },
+  "application/vnd.ms-powerpoint.slideshow.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["ppsm"]
+  },
+  "application/vnd.ms-powerpoint.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["potm"]
+  },
+  "application/vnd.ms-printdevicecapabilities+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-printing.printticket+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.ms-printschematicket+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.ms-project": {
+    "source": "iana",
+    "extensions": ["mpp","mpt"]
+  },
+  "application/vnd.ms-tnef": {
+    "source": "iana"
+  },
+  "application/vnd.ms-visio.viewer": {
+    "extensions": ["vdx"]
+  },
+  "application/vnd.ms-windows.devicepairing": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.nwprinting.oob": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.printerpairing": {
+    "source": "iana"
+  },
+  "application/vnd.ms-windows.wsd.oob": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.lic-chlg-req": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.lic-resp": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.meter-chlg-req": {
+    "source": "iana"
+  },
+  "application/vnd.ms-wmdrm.meter-resp": {
+    "source": "iana"
+  },
+  "application/vnd.ms-word.document.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["docm"]
+  },
+  "application/vnd.ms-word.template.macroenabled.12": {
+    "source": "iana",
+    "extensions": ["dotm"]
+  },
+  "application/vnd.ms-works": {
+    "source": "iana",
+    "extensions": ["wps","wks","wcm","wdb"]
+  },
+  "application/vnd.ms-wpl": {
+    "source": "iana",
+    "extensions": ["wpl"]
+  },
+  "application/vnd.ms-xpsdocument": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xps"]
+  },
+  "application/vnd.msa-disk-image": {
+    "source": "iana"
+  },
+  "application/vnd.mseq": {
+    "source": "iana",
+    "extensions": ["mseq"]
+  },
+  "application/vnd.msgpack": {
+    "source": "iana"
+  },
+  "application/vnd.msign": {
+    "source": "iana"
+  },
+  "application/vnd.multiad.creator": {
+    "source": "iana"
+  },
+  "application/vnd.multiad.creator.cif": {
+    "source": "iana"
+  },
+  "application/vnd.music-niff": {
+    "source": "iana"
+  },
+  "application/vnd.musician": {
+    "source": "iana",
+    "extensions": ["mus"]
+  },
+  "application/vnd.muvee.style": {
+    "source": "iana",
+    "extensions": ["msty"]
+  },
+  "application/vnd.mynfc": {
+    "source": "iana",
+    "extensions": ["taglet"]
+  },
+  "application/vnd.nacamar.ybrid+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nato.bindingdataobject+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.nato.bindingdataobject+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nato.bindingdataobject+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bdo"]
+  },
+  "application/vnd.nato.openxmlformats-package.iepd+zip": {
+    "source": "iana",
+    "compressible": false
+  },
+  "application/vnd.ncd.control": {
+    "source": "iana"
+  },
+  "application/vnd.ncd.reference": {
+    "source": "iana"
+  },
+  "application/vnd.nearst.inv+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nebumind.line": {
+    "source": "iana"
+  },
+  "application/vnd.nervana": {
+    "source": "iana"
+  },
+  "application/vnd.netfpx": {
+    "source": "iana"
+  },
+  "application/vnd.neurolanguage.nlu": {
+    "source": "iana",
+    "extensions": ["nlu"]
+  },
+  "application/vnd.nimn": {
+    "source": "iana"
+  },
+  "application/vnd.nintendo.nitro.rom": {
+    "source": "iana"
+  },
+  "application/vnd.nintendo.snes.rom": {
+    "source": "iana"
+  },
+  "application/vnd.nitf": {
+    "source": "iana",
+    "extensions": ["ntf","nitf"]
+  },
+  "application/vnd.noblenet-directory": {
+    "source": "iana",
+    "extensions": ["nnd"]
+  },
+  "application/vnd.noblenet-sealer": {
+    "source": "iana",
+    "extensions": ["nns"]
+  },
+  "application/vnd.noblenet-web": {
+    "source": "iana",
+    "extensions": ["nnw"]
+  },
+  "application/vnd.nokia.catalogs": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.conml+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.conml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.iptv.config+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.isds-radio-presets": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.landmark+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.landmark+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.landmarkcollection+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.n-gage.ac+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ac"]
+  },
+  "application/vnd.nokia.n-gage.data": {
+    "source": "iana",
+    "extensions": ["ngdat"]
+  },
+  "application/vnd.nokia.n-gage.symbian.install": {
+    "source": "apache",
+    "extensions": ["n-gage"]
+  },
+  "application/vnd.nokia.ncd": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.pcd+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.nokia.pcd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.nokia.radio-preset": {
+    "source": "iana",
+    "extensions": ["rpst"]
+  },
+  "application/vnd.nokia.radio-presets": {
+    "source": "iana",
+    "extensions": ["rpss"]
+  },
+  "application/vnd.novadigm.edm": {
+    "source": "iana",
+    "extensions": ["edm"]
+  },
+  "application/vnd.novadigm.edx": {
+    "source": "iana",
+    "extensions": ["edx"]
+  },
+  "application/vnd.novadigm.ext": {
+    "source": "iana",
+    "extensions": ["ext"]
+  },
+  "application/vnd.ntt-local.content-share": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.file-transfer": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.ogw_remote-access": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.sip-ta_remote": {
+    "source": "iana"
+  },
+  "application/vnd.ntt-local.sip-ta_tcp_stream": {
+    "source": "iana"
+  },
+  "application/vnd.oai.workflows": {
+    "source": "iana"
+  },
+  "application/vnd.oai.workflows+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oai.workflows+yaml": {
+    "source": "iana"
+  },
+  "application/vnd.oasis.opendocument.base": {
+    "source": "iana"
+  },
+  "application/vnd.oasis.opendocument.chart": {
+    "source": "iana",
+    "extensions": ["odc"]
+  },
+  "application/vnd.oasis.opendocument.chart-template": {
+    "source": "iana",
+    "extensions": ["otc"]
+  },
+  "application/vnd.oasis.opendocument.database": {
+    "source": "apache",
+    "extensions": ["odb"]
+  },
+  "application/vnd.oasis.opendocument.formula": {
+    "source": "iana",
+    "extensions": ["odf"]
+  },
+  "application/vnd.oasis.opendocument.formula-template": {
+    "source": "iana",
+    "extensions": ["odft"]
+  },
+  "application/vnd.oasis.opendocument.graphics": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odg"]
+  },
+  "application/vnd.oasis.opendocument.graphics-template": {
+    "source": "iana",
+    "extensions": ["otg"]
+  },
+  "application/vnd.oasis.opendocument.image": {
+    "source": "iana",
+    "extensions": ["odi"]
+  },
+  "application/vnd.oasis.opendocument.image-template": {
+    "source": "iana",
+    "extensions": ["oti"]
+  },
+  "application/vnd.oasis.opendocument.presentation": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odp"]
+  },
+  "application/vnd.oasis.opendocument.presentation-template": {
+    "source": "iana",
+    "extensions": ["otp"]
+  },
+  "application/vnd.oasis.opendocument.spreadsheet": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ods"]
+  },
+  "application/vnd.oasis.opendocument.spreadsheet-template": {
+    "source": "iana",
+    "extensions": ["ots"]
+  },
+  "application/vnd.oasis.opendocument.text": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["odt"]
+  },
+  "application/vnd.oasis.opendocument.text-master": {
+    "source": "iana",
+    "extensions": ["odm"]
+  },
+  "application/vnd.oasis.opendocument.text-master-template": {
+    "source": "iana"
+  },
+  "application/vnd.oasis.opendocument.text-template": {
+    "source": "iana",
+    "extensions": ["ott"]
+  },
+  "application/vnd.oasis.opendocument.text-web": {
+    "source": "iana",
+    "extensions": ["oth"]
+  },
+  "application/vnd.obn": {
+    "source": "iana"
+  },
+  "application/vnd.ocf+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.oci.image.manifest.v1+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oftn.l10n+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.contentaccessdownload+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.contentaccessstreaming+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.cspg-hexbinary": {
+    "source": "iana"
+  },
+  "application/vnd.oipf.dae.svg+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.dae.xhtml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.mippvcontrolmessage+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.pae.gem": {
+    "source": "iana"
+  },
+  "application/vnd.oipf.spdiscovery+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.spdlist+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.ueprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oipf.userprofile+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.olpc-sugar": {
+    "source": "iana",
+    "extensions": ["xo"]
+  },
+  "application/vnd.oma-scws-config": {
+    "source": "iana"
+  },
+  "application/vnd.oma-scws-http-request": {
+    "source": "iana"
+  },
+  "application/vnd.oma-scws-http-response": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.associated-procedure-parameter+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.drm-trigger+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.imd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.ltkm": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.notification+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.provisioningtrigger": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.sgboot": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.sgdd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.sgdu": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.simple-symbol-container": {
+    "source": "iana"
+  },
+  "application/vnd.oma.bcast.smartcard-trigger+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.sprov+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.bcast.stkm": {
+    "source": "iana"
+  },
+  "application/vnd.oma.cab-address-book+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-feature-handler+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-pcc+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-subs-invite+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.cab-user-prefs+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.dcd": {
+    "source": "iana"
+  },
+  "application/vnd.oma.dcdc": {
+    "source": "iana"
+  },
+  "application/vnd.oma.dd2+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dd2"]
+  },
+  "application/vnd.oma.drm.risd+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.group-usage-list+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.lwm2m+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.oma.lwm2m+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.lwm2m+tlv": {
+    "source": "iana"
+  },
+  "application/vnd.oma.pal+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.detailed-progress-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.final-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.groups+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.invocation-descriptor+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.poc.optimized-progress-report+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.push": {
+    "source": "iana"
+  },
+  "application/vnd.oma.scidm.messages+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oma.xcap-directory+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.omads-email+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omads-file+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omads-folder+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.omaloc-supl-init": {
+    "source": "iana"
+  },
+  "application/vnd.onepager": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertamp": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertamx": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertat": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertatp": {
+    "source": "iana"
+  },
+  "application/vnd.onepagertatx": {
+    "source": "iana"
+  },
+  "application/vnd.onvif.metadata": {
+    "source": "iana"
+  },
+  "application/vnd.openblox.game+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["obgx"]
+  },
+  "application/vnd.openblox.game-binary": {
+    "source": "iana"
+  },
+  "application/vnd.openeye.oeb": {
+    "source": "iana"
+  },
+  "application/vnd.openofficeorg.extension": {
+    "source": "apache",
+    "extensions": ["oxt"]
+  },
+  "application/vnd.openstreetmap.data+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["osm"]
+  },
+  "application/vnd.opentimestamps.ots": {
+    "source": "iana"
+  },
+  "application/vnd.openvpi.dspx+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.custom-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.customxmlproperties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawing+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.chart+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.chartshapes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramcolors+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramdata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramlayout+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.drawingml.diagramstyle+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.extended-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.commentauthors+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.handoutmaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.notesmaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.notesslide+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presentation": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["pptx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presentation.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.presprops+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slide": {
+    "source": "iana",
+    "extensions": ["sldx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slide+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slidelayout+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slidemaster+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideshow": {
+    "source": "iana",
+    "extensions": ["ppsx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideshow.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.slideupdateinfo+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.tablestyles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.tags+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.template": {
+    "source": "iana",
+    "extensions": ["potx"]
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.presentationml.viewprops+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.calcchain+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.chartsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.connections+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.dialogsheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.externallink+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcachedefinition+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivotcacherecords+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.pivottable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.querytable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.revisionheaders+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.revisionlog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sharedstrings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["xlsx"]
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheetmetadata+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.styles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.table+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.tablesinglecells+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.template": {
+    "source": "iana",
+    "extensions": ["xltx"]
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.usernames+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.volatiledependencies+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.worksheet+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.theme+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.themeoverride+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.vmldrawing": {
+    "source": "iana"
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.comments+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["docx"]
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document.glossary+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.endnotes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.fonttable+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.footer+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.footnotes+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.numbering+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.settings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.styles+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.template": {
+    "source": "iana",
+    "extensions": ["dotx"]
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.template.main+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.websettings+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.core-properties+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.digital-signature-xmlsignature+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.openxmlformats-package.relationships+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oracle.resource+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.orange.indata": {
+    "source": "iana"
+  },
+  "application/vnd.osa.netdeploy": {
+    "source": "iana"
+  },
+  "application/vnd.osgeo.mapguide.package": {
+    "source": "iana",
+    "extensions": ["mgp"]
+  },
+  "application/vnd.osgi.bundle": {
+    "source": "iana"
+  },
+  "application/vnd.osgi.dp": {
+    "source": "iana",
+    "extensions": ["dp"]
+  },
+  "application/vnd.osgi.subsystem": {
+    "source": "iana",
+    "extensions": ["esa"]
+  },
+  "application/vnd.otps.ct-kip+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.oxli.countgraph": {
+    "source": "iana"
+  },
+  "application/vnd.pagerduty+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.palm": {
+    "source": "iana",
+    "extensions": ["pdb","pqa","oprc"]
+  },
+  "application/vnd.panoply": {
+    "source": "iana"
+  },
+  "application/vnd.paos.xml": {
+    "source": "iana"
+  },
+  "application/vnd.patentdive": {
+    "source": "iana"
+  },
+  "application/vnd.patientecommsdoc": {
+    "source": "iana"
+  },
+  "application/vnd.pawaafile": {
+    "source": "iana",
+    "extensions": ["paw"]
+  },
+  "application/vnd.pcos": {
+    "source": "iana"
+  },
+  "application/vnd.pg.format": {
+    "source": "iana",
+    "extensions": ["str"]
+  },
+  "application/vnd.pg.osasli": {
+    "source": "iana",
+    "extensions": ["ei6"]
+  },
+  "application/vnd.piaccess.application-licence": {
+    "source": "iana"
+  },
+  "application/vnd.picsel": {
+    "source": "iana",
+    "extensions": ["efif"]
+  },
+  "application/vnd.pmi.widget": {
+    "source": "iana",
+    "extensions": ["wg"]
+  },
+  "application/vnd.poc.group-advertisement+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.pocketlearn": {
+    "source": "iana",
+    "extensions": ["plf"]
+  },
+  "application/vnd.powerbuilder6": {
+    "source": "iana",
+    "extensions": ["pbd"]
+  },
+  "application/vnd.powerbuilder6-s": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder7": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder7-s": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder75": {
+    "source": "iana"
+  },
+  "application/vnd.powerbuilder75-s": {
+    "source": "iana"
+  },
+  "application/vnd.preminet": {
+    "source": "iana"
+  },
+  "application/vnd.previewsystems.box": {
+    "source": "iana",
+    "extensions": ["box"]
+  },
+  "application/vnd.procrate.brushset": {
+    "extensions": ["brushset"]
+  },
+  "application/vnd.procreate.brush": {
+    "extensions": ["brush"]
+  },
+  "application/vnd.procreate.dream": {
+    "extensions": ["drm"]
+  },
+  "application/vnd.proteus.magazine": {
+    "source": "iana",
+    "extensions": ["mgz"]
+  },
+  "application/vnd.psfs": {
+    "source": "iana"
+  },
+  "application/vnd.pt.mundusmundi": {
+    "source": "iana"
+  },
+  "application/vnd.publishare-delta-tree": {
+    "source": "iana",
+    "extensions": ["qps"]
+  },
+  "application/vnd.pvi.ptid1": {
+    "source": "iana",
+    "extensions": ["ptid"]
+  },
+  "application/vnd.pwg-multiplexed": {
+    "source": "iana"
+  },
+  "application/vnd.pwg-xhtml-print+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xhtm"]
+  },
+  "application/vnd.qualcomm.brew-app-res": {
+    "source": "iana"
+  },
+  "application/vnd.quarantainenet": {
+    "source": "iana"
+  },
+  "application/vnd.quark.quarkxpress": {
+    "source": "iana",
+    "extensions": ["qxd","qxt","qwd","qwt","qxl","qxb"]
+  },
+  "application/vnd.quobject-quoxdocument": {
+    "source": "iana"
+  },
+  "application/vnd.radisys.moml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-conf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-conn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-dialog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-audit-stream+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-conf+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-base+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-fax-detect+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-fax-sendrecv+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-group+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-speech+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.radisys.msml-dialog-transform+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.rainstor.data": {
+    "source": "iana"
+  },
+  "application/vnd.rapid": {
+    "source": "iana"
+  },
+  "application/vnd.rar": {
+    "source": "iana",
+    "extensions": ["rar"]
+  },
+  "application/vnd.realvnc.bed": {
+    "source": "iana",
+    "extensions": ["bed"]
+  },
+  "application/vnd.recordare.musicxml": {
+    "source": "iana",
+    "extensions": ["mxl"]
+  },
+  "application/vnd.recordare.musicxml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["musicxml"]
+  },
+  "application/vnd.relpipe": {
+    "source": "iana"
+  },
+  "application/vnd.renlearn.rlprint": {
+    "source": "iana"
+  },
+  "application/vnd.resilient.logic": {
+    "source": "iana"
+  },
+  "application/vnd.restful+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.rig.cryptonote": {
+    "source": "iana",
+    "extensions": ["cryptonote"]
+  },
+  "application/vnd.rim.cod": {
+    "source": "apache",
+    "extensions": ["cod"]
+  },
+  "application/vnd.rn-realmedia": {
+    "source": "apache",
+    "extensions": ["rm"]
+  },
+  "application/vnd.rn-realmedia-vbr": {
+    "source": "apache",
+    "extensions": ["rmvb"]
+  },
+  "application/vnd.route66.link66+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["link66"]
+  },
+  "application/vnd.rs-274x": {
+    "source": "iana"
+  },
+  "application/vnd.ruckus.download": {
+    "source": "iana"
+  },
+  "application/vnd.s3sms": {
+    "source": "iana"
+  },
+  "application/vnd.sailingtracker.track": {
+    "source": "iana",
+    "extensions": ["st"]
+  },
+  "application/vnd.sar": {
+    "source": "iana"
+  },
+  "application/vnd.sbm.cid": {
+    "source": "iana"
+  },
+  "application/vnd.sbm.mid2": {
+    "source": "iana"
+  },
+  "application/vnd.scribus": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.3df": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.csf": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.doc": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.eml": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.mht": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.net": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.ppt": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.tiff": {
+    "source": "iana"
+  },
+  "application/vnd.sealed.xls": {
+    "source": "iana"
+  },
+  "application/vnd.sealedmedia.softseal.html": {
+    "source": "iana"
+  },
+  "application/vnd.sealedmedia.softseal.pdf": {
+    "source": "iana"
+  },
+  "application/vnd.seemail": {
+    "source": "iana",
+    "extensions": ["see"]
+  },
+  "application/vnd.seis+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.sema": {
+    "source": "iana",
+    "extensions": ["sema"]
+  },
+  "application/vnd.semd": {
+    "source": "iana",
+    "extensions": ["semd"]
+  },
+  "application/vnd.semf": {
+    "source": "iana",
+    "extensions": ["semf"]
+  },
+  "application/vnd.shade-save-file": {
+    "source": "iana"
+  },
+  "application/vnd.shana.informed.formdata": {
+    "source": "iana",
+    "extensions": ["ifm"]
+  },
+  "application/vnd.shana.informed.formtemplate": {
+    "source": "iana",
+    "extensions": ["itp"]
+  },
+  "application/vnd.shana.informed.interchange": {
+    "source": "iana",
+    "extensions": ["iif"]
+  },
+  "application/vnd.shana.informed.package": {
+    "source": "iana",
+    "extensions": ["ipk"]
+  },
+  "application/vnd.shootproof+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.shopkick+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.shp": {
+    "source": "iana"
+  },
+  "application/vnd.shx": {
+    "source": "iana"
+  },
+  "application/vnd.sigrok.session": {
+    "source": "iana"
+  },
+  "application/vnd.simtech-mindmapper": {
+    "source": "iana",
+    "extensions": ["twd","twds"]
+  },
+  "application/vnd.siren+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.sketchometry": {
+    "source": "iana"
+  },
+  "application/vnd.smaf": {
+    "source": "iana",
+    "extensions": ["mmf"]
+  },
+  "application/vnd.smart.notebook": {
+    "source": "iana"
+  },
+  "application/vnd.smart.teacher": {
+    "source": "iana",
+    "extensions": ["teacher"]
+  },
+  "application/vnd.smintio.portals.archive": {
+    "source": "iana"
+  },
+  "application/vnd.snesdev-page-table": {
+    "source": "iana"
+  },
+  "application/vnd.software602.filler.form+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["fo"]
+  },
+  "application/vnd.software602.filler.form-xml-zip": {
+    "source": "iana"
+  },
+  "application/vnd.solent.sdkm+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["sdkm","sdkd"]
+  },
+  "application/vnd.spotfire.dxp": {
+    "source": "iana",
+    "extensions": ["dxp"]
+  },
+  "application/vnd.spotfire.sfs": {
+    "source": "iana",
+    "extensions": ["sfs"]
+  },
+  "application/vnd.sqlite3": {
+    "source": "iana"
+  },
+  "application/vnd.sss-cod": {
+    "source": "iana"
+  },
+  "application/vnd.sss-dtf": {
+    "source": "iana"
+  },
+  "application/vnd.sss-ntf": {
+    "source": "iana"
+  },
+  "application/vnd.stardivision.calc": {
+    "source": "apache",
+    "extensions": ["sdc"]
+  },
+  "application/vnd.stardivision.draw": {
+    "source": "apache",
+    "extensions": ["sda"]
+  },
+  "application/vnd.stardivision.impress": {
+    "source": "apache",
+    "extensions": ["sdd"]
+  },
+  "application/vnd.stardivision.math": {
+    "source": "apache",
+    "extensions": ["smf"]
+  },
+  "application/vnd.stardivision.writer": {
+    "source": "apache",
+    "extensions": ["sdw","vor"]
+  },
+  "application/vnd.stardivision.writer-global": {
+    "source": "apache",
+    "extensions": ["sgl"]
+  },
+  "application/vnd.stepmania.package": {
+    "source": "iana",
+    "extensions": ["smzip"]
+  },
+  "application/vnd.stepmania.stepchart": {
+    "source": "iana",
+    "extensions": ["sm"]
+  },
+  "application/vnd.street-stream": {
+    "source": "iana"
+  },
+  "application/vnd.sun.wadl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wadl"]
+  },
+  "application/vnd.sun.xml.calc": {
+    "source": "apache",
+    "extensions": ["sxc"]
+  },
+  "application/vnd.sun.xml.calc.template": {
+    "source": "apache",
+    "extensions": ["stc"]
+  },
+  "application/vnd.sun.xml.draw": {
+    "source": "apache",
+    "extensions": ["sxd"]
+  },
+  "application/vnd.sun.xml.draw.template": {
+    "source": "apache",
+    "extensions": ["std"]
+  },
+  "application/vnd.sun.xml.impress": {
+    "source": "apache",
+    "extensions": ["sxi"]
+  },
+  "application/vnd.sun.xml.impress.template": {
+    "source": "apache",
+    "extensions": ["sti"]
+  },
+  "application/vnd.sun.xml.math": {
+    "source": "apache",
+    "extensions": ["sxm"]
+  },
+  "application/vnd.sun.xml.writer": {
+    "source": "apache",
+    "extensions": ["sxw"]
+  },
+  "application/vnd.sun.xml.writer.global": {
+    "source": "apache",
+    "extensions": ["sxg"]
+  },
+  "application/vnd.sun.xml.writer.template": {
+    "source": "apache",
+    "extensions": ["stw"]
+  },
+  "application/vnd.sus-calendar": {
+    "source": "iana",
+    "extensions": ["sus","susp"]
+  },
+  "application/vnd.svd": {
+    "source": "iana",
+    "extensions": ["svd"]
+  },
+  "application/vnd.swiftview-ics": {
+    "source": "iana"
+  },
+  "application/vnd.sybyl.mol2": {
+    "source": "iana"
+  },
+  "application/vnd.sycle+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.syft+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.symbian.install": {
+    "source": "apache",
+    "extensions": ["sis","sisx"]
+  },
+  "application/vnd.syncml+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["xsm"]
+  },
+  "application/vnd.syncml.dm+wbxml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["bdm"]
+  },
+  "application/vnd.syncml.dm+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["xdm"]
+  },
+  "application/vnd.syncml.dm.notification": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmddf+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmddf+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["ddf"]
+  },
+  "application/vnd.syncml.dmtnds+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.syncml.dmtnds+xml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true
+  },
+  "application/vnd.syncml.ds.notification": {
+    "source": "iana"
+  },
+  "application/vnd.tableschema+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tao.intent-module-archive": {
+    "source": "iana",
+    "extensions": ["tao"]
+  },
+  "application/vnd.tcpdump.pcap": {
+    "source": "iana",
+    "extensions": ["pcap","cap","dmp"]
+  },
+  "application/vnd.think-cell.ppttc+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tmd.mediaflex.api+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.tml": {
+    "source": "iana"
+  },
+  "application/vnd.tmobile-livetv": {
+    "source": "iana",
+    "extensions": ["tmo"]
+  },
+  "application/vnd.tri.onesource": {
+    "source": "iana"
+  },
+  "application/vnd.trid.tpt": {
+    "source": "iana",
+    "extensions": ["tpt"]
+  },
+  "application/vnd.triscape.mxs": {
+    "source": "iana",
+    "extensions": ["mxs"]
+  },
+  "application/vnd.trueapp": {
+    "source": "iana",
+    "extensions": ["tra"]
+  },
+  "application/vnd.truedoc": {
+    "source": "iana"
+  },
+  "application/vnd.ubisoft.webplayer": {
+    "source": "iana"
+  },
+  "application/vnd.ufdl": {
+    "source": "iana",
+    "extensions": ["ufd","ufdl"]
+  },
+  "application/vnd.uic.osdm+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.uiq.theme": {
+    "source": "iana",
+    "extensions": ["utz"]
+  },
+  "application/vnd.umajin": {
+    "source": "iana",
+    "extensions": ["umj"]
+  },
+  "application/vnd.unity": {
+    "source": "iana",
+    "extensions": ["unityweb"]
+  },
+  "application/vnd.uoml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uoml","uo"]
+  },
+  "application/vnd.uplanet.alert": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.alert-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.bearer-choice": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.bearer-choice-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.cacheop": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.cacheop-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.channel": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.channel-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.list": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.list-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.listcmd": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.listcmd-wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.uplanet.signal": {
+    "source": "iana"
+  },
+  "application/vnd.uri-map": {
+    "source": "iana"
+  },
+  "application/vnd.valve.source.material": {
+    "source": "iana"
+  },
+  "application/vnd.vcx": {
+    "source": "iana",
+    "extensions": ["vcx"]
+  },
+  "application/vnd.vd-study": {
+    "source": "iana"
+  },
+  "application/vnd.vectorworks": {
+    "source": "iana"
+  },
+  "application/vnd.vel+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.veraison.tsm-report+cbor": {
+    "source": "iana"
+  },
+  "application/vnd.veraison.tsm-report+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.verimatrix.vcas": {
+    "source": "iana"
+  },
+  "application/vnd.veritone.aion+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.veryant.thin": {
+    "source": "iana"
+  },
+  "application/vnd.ves.encrypted": {
+    "source": "iana"
+  },
+  "application/vnd.vidsoft.vidconference": {
+    "source": "iana"
+  },
+  "application/vnd.visio": {
+    "source": "iana",
+    "extensions": ["vsd","vst","vss","vsw","vsdx","vtx"]
+  },
+  "application/vnd.visionary": {
+    "source": "iana",
+    "extensions": ["vis"]
+  },
+  "application/vnd.vividence.scriptfile": {
+    "source": "iana"
+  },
+  "application/vnd.vocalshaper.vsp4": {
+    "source": "iana"
+  },
+  "application/vnd.vsf": {
+    "source": "iana",
+    "extensions": ["vsf"]
+  },
+  "application/vnd.wap.sic": {
+    "source": "iana"
+  },
+  "application/vnd.wap.slc": {
+    "source": "iana"
+  },
+  "application/vnd.wap.wbxml": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["wbxml"]
+  },
+  "application/vnd.wap.wmlc": {
+    "source": "iana",
+    "extensions": ["wmlc"]
+  },
+  "application/vnd.wap.wmlscriptc": {
+    "source": "iana",
+    "extensions": ["wmlsc"]
+  },
+  "application/vnd.wasmflow.wafl": {
+    "source": "iana"
+  },
+  "application/vnd.webturbo": {
+    "source": "iana",
+    "extensions": ["wtb"]
+  },
+  "application/vnd.wfa.dpp": {
+    "source": "iana"
+  },
+  "application/vnd.wfa.p2p": {
+    "source": "iana"
+  },
+  "application/vnd.wfa.wsc": {
+    "source": "iana"
+  },
+  "application/vnd.windows.devicepairing": {
+    "source": "iana"
+  },
+  "application/vnd.wmc": {
+    "source": "iana"
+  },
+  "application/vnd.wmf.bootstrap": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.mathematica": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.mathematica.package": {
+    "source": "iana"
+  },
+  "application/vnd.wolfram.player": {
+    "source": "iana",
+    "extensions": ["nbp"]
+  },
+  "application/vnd.wordlift": {
+    "source": "iana"
+  },
+  "application/vnd.wordperfect": {
+    "source": "iana",
+    "extensions": ["wpd"]
+  },
+  "application/vnd.wqd": {
+    "source": "iana",
+    "extensions": ["wqd"]
+  },
+  "application/vnd.wrq-hp3000-labelled": {
+    "source": "iana"
+  },
+  "application/vnd.wt.stf": {
+    "source": "iana",
+    "extensions": ["stf"]
+  },
+  "application/vnd.wv.csp+wbxml": {
+    "source": "iana"
+  },
+  "application/vnd.wv.csp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.wv.ssp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xacml+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xara": {
+    "source": "iana",
+    "extensions": ["xar"]
+  },
+  "application/vnd.xarin.cpj": {
+    "source": "iana"
+  },
+  "application/vnd.xecrets-encrypted": {
+    "source": "iana"
+  },
+  "application/vnd.xfdl": {
+    "source": "iana",
+    "extensions": ["xfdl"]
+  },
+  "application/vnd.xfdl.webform": {
+    "source": "iana"
+  },
+  "application/vnd.xmi+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vnd.xmpie.cpkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.dpkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.plan": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.ppkg": {
+    "source": "iana"
+  },
+  "application/vnd.xmpie.xlim": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.hv-dic": {
+    "source": "iana",
+    "extensions": ["hvd"]
+  },
+  "application/vnd.yamaha.hv-script": {
+    "source": "iana",
+    "extensions": ["hvs"]
+  },
+  "application/vnd.yamaha.hv-voice": {
+    "source": "iana",
+    "extensions": ["hvp"]
+  },
+  "application/vnd.yamaha.openscoreformat": {
+    "source": "iana",
+    "extensions": ["osf"]
+  },
+  "application/vnd.yamaha.openscoreformat.osfpvg+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["osfpvg"]
+  },
+  "application/vnd.yamaha.remote-setup": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.smaf-audio": {
+    "source": "iana",
+    "extensions": ["saf"]
+  },
+  "application/vnd.yamaha.smaf-phrase": {
+    "source": "iana",
+    "extensions": ["spf"]
+  },
+  "application/vnd.yamaha.through-ngn": {
+    "source": "iana"
+  },
+  "application/vnd.yamaha.tunnel-udpencap": {
+    "source": "iana"
+  },
+  "application/vnd.yaoweme": {
+    "source": "iana"
+  },
+  "application/vnd.yellowriver-custom-menu": {
+    "source": "iana",
+    "extensions": ["cmp"]
+  },
+  "application/vnd.zul": {
+    "source": "iana",
+    "extensions": ["zir","zirz"]
+  },
+  "application/vnd.zzazz.deck+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["zaz"]
+  },
+  "application/voicexml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["vxml"]
+  },
+  "application/voucher-cms+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/voucher-jws+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/vp": {
+    "source": "iana"
+  },
+  "application/vp+cose": {
+    "source": "iana"
+  },
+  "application/vp+jwt": {
+    "source": "iana"
+  },
+  "application/vq-rtcpxr": {
+    "source": "iana"
+  },
+  "application/wasm": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wasm"]
+  },
+  "application/watcherinfo+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wif"]
+  },
+  "application/webpush-options+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/whoispp-query": {
+    "source": "iana"
+  },
+  "application/whoispp-response": {
+    "source": "iana"
+  },
+  "application/widget": {
+    "source": "iana",
+    "extensions": ["wgt"]
+  },
+  "application/winhlp": {
+    "source": "apache",
+    "extensions": ["hlp"]
+  },
+  "application/wita": {
+    "source": "iana"
+  },
+  "application/wordperfect5.1": {
+    "source": "iana"
+  },
+  "application/wsdl+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wsdl"]
+  },
+  "application/wspolicy+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["wspolicy"]
+  },
+  "application/x-7z-compressed": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["7z"]
+  },
+  "application/x-abiword": {
+    "source": "apache",
+    "extensions": ["abw"]
+  },
+  "application/x-ace-compressed": {
+    "source": "apache",
+    "extensions": ["ace"]
+  },
+  "application/x-amf": {
+    "source": "apache"
+  },
+  "application/x-apple-diskimage": {
+    "source": "apache",
+    "extensions": ["dmg"]
+  },
+  "application/x-arj": {
+    "compressible": false,
+    "extensions": ["arj"]
+  },
+  "application/x-authorware-bin": {
+    "source": "apache",
+    "extensions": ["aab","x32","u32","vox"]
+  },
+  "application/x-authorware-map": {
+    "source": "apache",
+    "extensions": ["aam"]
+  },
+  "application/x-authorware-seg": {
+    "source": "apache",
+    "extensions": ["aas"]
+  },
+  "application/x-bcpio": {
+    "source": "apache",
+    "extensions": ["bcpio"]
+  },
+  "application/x-bdoc": {
+    "compressible": false,
+    "extensions": ["bdoc"]
+  },
+  "application/x-bittorrent": {
+    "source": "apache",
+    "extensions": ["torrent"]
+  },
+  "application/x-blender": {
+    "extensions": ["blend"]
+  },
+  "application/x-blorb": {
+    "source": "apache",
+    "extensions": ["blb","blorb"]
+  },
+  "application/x-bzip": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["bz"]
+  },
+  "application/x-bzip2": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["bz2","boz"]
+  },
+  "application/x-cbr": {
+    "source": "apache",
+    "extensions": ["cbr","cba","cbt","cbz","cb7"]
+  },
+  "application/x-cdlink": {
+    "source": "apache",
+    "extensions": ["vcd"]
+  },
+  "application/x-cfs-compressed": {
+    "source": "apache",
+    "extensions": ["cfs"]
+  },
+  "application/x-chat": {
+    "source": "apache",
+    "extensions": ["chat"]
+  },
+  "application/x-chess-pgn": {
+    "source": "apache",
+    "extensions": ["pgn"]
+  },
+  "application/x-chrome-extension": {
+    "extensions": ["crx"]
+  },
+  "application/x-cocoa": {
+    "source": "nginx",
+    "extensions": ["cco"]
+  },
+  "application/x-compress": {
+    "source": "apache"
+  },
+  "application/x-compressed": {
+    "extensions": ["rar"]
+  },
+  "application/x-conference": {
+    "source": "apache",
+    "extensions": ["nsc"]
+  },
+  "application/x-cpio": {
+    "source": "apache",
+    "extensions": ["cpio"]
+  },
+  "application/x-csh": {
+    "source": "apache",
+    "extensions": ["csh"]
+  },
+  "application/x-deb": {
+    "compressible": false
+  },
+  "application/x-debian-package": {
+    "source": "apache",
+    "extensions": ["deb","udeb"]
+  },
+  "application/x-dgc-compressed": {
+    "source": "apache",
+    "extensions": ["dgc"]
+  },
+  "application/x-director": {
+    "source": "apache",
+    "extensions": ["dir","dcr","dxr","cst","cct","cxt","w3d","fgd","swa"]
+  },
+  "application/x-doom": {
+    "source": "apache",
+    "extensions": ["wad"]
+  },
+  "application/x-dtbncx+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ncx"]
+  },
+  "application/x-dtbook+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["dtb"]
+  },
+  "application/x-dtbresource+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["res"]
+  },
+  "application/x-dvi": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["dvi"]
+  },
+  "application/x-envoy": {
+    "source": "apache",
+    "extensions": ["evy"]
+  },
+  "application/x-eva": {
+    "source": "apache",
+    "extensions": ["eva"]
+  },
+  "application/x-font-bdf": {
+    "source": "apache",
+    "extensions": ["bdf"]
+  },
+  "application/x-font-dos": {
+    "source": "apache"
+  },
+  "application/x-font-framemaker": {
+    "source": "apache"
+  },
+  "application/x-font-ghostscript": {
+    "source": "apache",
+    "extensions": ["gsf"]
+  },
+  "application/x-font-libgrx": {
+    "source": "apache"
+  },
+  "application/x-font-linux-psf": {
+    "source": "apache",
+    "extensions": ["psf"]
+  },
+  "application/x-font-pcf": {
+    "source": "apache",
+    "extensions": ["pcf"]
+  },
+  "application/x-font-snf": {
+    "source": "apache",
+    "extensions": ["snf"]
+  },
+  "application/x-font-speedo": {
+    "source": "apache"
+  },
+  "application/x-font-sunos-news": {
+    "source": "apache"
+  },
+  "application/x-font-type1": {
+    "source": "apache",
+    "extensions": ["pfa","pfb","pfm","afm"]
+  },
+  "application/x-font-vfont": {
+    "source": "apache"
+  },
+  "application/x-freearc": {
+    "source": "apache",
+    "extensions": ["arc"]
+  },
+  "application/x-futuresplash": {
+    "source": "apache",
+    "extensions": ["spl"]
+  },
+  "application/x-gca-compressed": {
+    "source": "apache",
+    "extensions": ["gca"]
+  },
+  "application/x-glulx": {
+    "source": "apache",
+    "extensions": ["ulx"]
+  },
+  "application/x-gnumeric": {
+    "source": "apache",
+    "extensions": ["gnumeric"]
+  },
+  "application/x-gramps-xml": {
+    "source": "apache",
+    "extensions": ["gramps"]
+  },
+  "application/x-gtar": {
+    "source": "apache",
+    "extensions": ["gtar"]
+  },
+  "application/x-gzip": {
+    "source": "apache"
+  },
+  "application/x-hdf": {
+    "source": "apache",
+    "extensions": ["hdf"]
+  },
+  "application/x-httpd-php": {
+    "compressible": true,
+    "extensions": ["php"]
+  },
+  "application/x-install-instructions": {
+    "source": "apache",
+    "extensions": ["install"]
+  },
+  "application/x-ipynb+json": {
+    "compressible": true,
+    "extensions": ["ipynb"]
+  },
+  "application/x-iso9660-image": {
+    "source": "apache",
+    "extensions": ["iso"]
+  },
+  "application/x-iwork-keynote-sffkey": {
+    "extensions": ["key"]
+  },
+  "application/x-iwork-numbers-sffnumbers": {
+    "extensions": ["numbers"]
+  },
+  "application/x-iwork-pages-sffpages": {
+    "extensions": ["pages"]
+  },
+  "application/x-java-archive-diff": {
+    "source": "nginx",
+    "extensions": ["jardiff"]
+  },
+  "application/x-java-jnlp-file": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["jnlp"]
+  },
+  "application/x-javascript": {
+    "compressible": true
+  },
+  "application/x-keepass2": {
+    "extensions": ["kdbx"]
+  },
+  "application/x-latex": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["latex"]
+  },
+  "application/x-lua-bytecode": {
+    "extensions": ["luac"]
+  },
+  "application/x-lzh-compressed": {
+    "source": "apache",
+    "extensions": ["lzh","lha"]
+  },
+  "application/x-makeself": {
+    "source": "nginx",
+    "extensions": ["run"]
+  },
+  "application/x-mie": {
+    "source": "apache",
+    "extensions": ["mie"]
+  },
+  "application/x-mobipocket-ebook": {
+    "source": "apache",
+    "extensions": ["prc","mobi"]
+  },
+  "application/x-mpegurl": {
+    "compressible": false
+  },
+  "application/x-ms-application": {
+    "source": "apache",
+    "extensions": ["application"]
+  },
+  "application/x-ms-shortcut": {
+    "source": "apache",
+    "extensions": ["lnk"]
+  },
+  "application/x-ms-wmd": {
+    "source": "apache",
+    "extensions": ["wmd"]
+  },
+  "application/x-ms-wmz": {
+    "source": "apache",
+    "extensions": ["wmz"]
+  },
+  "application/x-ms-xbap": {
+    "source": "apache",
+    "extensions": ["xbap"]
+  },
+  "application/x-msaccess": {
+    "source": "apache",
+    "extensions": ["mdb"]
+  },
+  "application/x-msbinder": {
+    "source": "apache",
+    "extensions": ["obd"]
+  },
+  "application/x-mscardfile": {
+    "source": "apache",
+    "extensions": ["crd"]
+  },
+  "application/x-msclip": {
+    "source": "apache",
+    "extensions": ["clp"]
+  },
+  "application/x-msdos-program": {
+    "extensions": ["exe"]
+  },
+  "application/x-msdownload": {
+    "source": "apache",
+    "extensions": ["exe","dll","com","bat","msi"]
+  },
+  "application/x-msmediaview": {
+    "source": "apache",
+    "extensions": ["mvb","m13","m14"]
+  },
+  "application/x-msmetafile": {
+    "source": "apache",
+    "extensions": ["wmf","wmz","emf","emz"]
+  },
+  "application/x-msmoney": {
+    "source": "apache",
+    "extensions": ["mny"]
+  },
+  "application/x-mspublisher": {
+    "source": "apache",
+    "extensions": ["pub"]
+  },
+  "application/x-msschedule": {
+    "source": "apache",
+    "extensions": ["scd"]
+  },
+  "application/x-msterminal": {
+    "source": "apache",
+    "extensions": ["trm"]
+  },
+  "application/x-mswrite": {
+    "source": "apache",
+    "extensions": ["wri"]
+  },
+  "application/x-netcdf": {
+    "source": "apache",
+    "extensions": ["nc","cdf"]
+  },
+  "application/x-ns-proxy-autoconfig": {
+    "compressible": true,
+    "extensions": ["pac"]
+  },
+  "application/x-nzb": {
+    "source": "apache",
+    "extensions": ["nzb"]
+  },
+  "application/x-perl": {
+    "source": "nginx",
+    "extensions": ["pl","pm"]
+  },
+  "application/x-pilot": {
+    "source": "nginx",
+    "extensions": ["prc","pdb"]
+  },
+  "application/x-pkcs12": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["p12","pfx"]
+  },
+  "application/x-pkcs7-certificates": {
+    "source": "apache",
+    "extensions": ["p7b","spc"]
+  },
+  "application/x-pkcs7-certreqresp": {
+    "source": "apache",
+    "extensions": ["p7r"]
+  },
+  "application/x-pki-message": {
+    "source": "iana"
+  },
+  "application/x-rar-compressed": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["rar"]
+  },
+  "application/x-redhat-package-manager": {
+    "source": "nginx",
+    "extensions": ["rpm"]
+  },
+  "application/x-research-info-systems": {
+    "source": "apache",
+    "extensions": ["ris"]
+  },
+  "application/x-sea": {
+    "source": "nginx",
+    "extensions": ["sea"]
+  },
+  "application/x-sh": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["sh"]
+  },
+  "application/x-shar": {
+    "source": "apache",
+    "extensions": ["shar"]
+  },
+  "application/x-shockwave-flash": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["swf"]
+  },
+  "application/x-silverlight-app": {
+    "source": "apache",
+    "extensions": ["xap"]
+  },
+  "application/x-sql": {
+    "source": "apache",
+    "extensions": ["sql"]
+  },
+  "application/x-stuffit": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["sit"]
+  },
+  "application/x-stuffitx": {
+    "source": "apache",
+    "extensions": ["sitx"]
+  },
+  "application/x-subrip": {
+    "source": "apache",
+    "extensions": ["srt"]
+  },
+  "application/x-sv4cpio": {
+    "source": "apache",
+    "extensions": ["sv4cpio"]
+  },
+  "application/x-sv4crc": {
+    "source": "apache",
+    "extensions": ["sv4crc"]
+  },
+  "application/x-t3vm-image": {
+    "source": "apache",
+    "extensions": ["t3"]
+  },
+  "application/x-tads": {
+    "source": "apache",
+    "extensions": ["gam"]
+  },
+  "application/x-tar": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["tar"]
+  },
+  "application/x-tcl": {
+    "source": "apache",
+    "extensions": ["tcl","tk"]
+  },
+  "application/x-tex": {
+    "source": "apache",
+    "extensions": ["tex"]
+  },
+  "application/x-tex-tfm": {
+    "source": "apache",
+    "extensions": ["tfm"]
+  },
+  "application/x-texinfo": {
+    "source": "apache",
+    "extensions": ["texinfo","texi"]
+  },
+  "application/x-tgif": {
+    "source": "apache",
+    "extensions": ["obj"]
+  },
+  "application/x-ustar": {
+    "source": "apache",
+    "extensions": ["ustar"]
+  },
+  "application/x-virtualbox-hdd": {
+    "compressible": true,
+    "extensions": ["hdd"]
+  },
+  "application/x-virtualbox-ova": {
+    "compressible": true,
+    "extensions": ["ova"]
+  },
+  "application/x-virtualbox-ovf": {
+    "compressible": true,
+    "extensions": ["ovf"]
+  },
+  "application/x-virtualbox-vbox": {
+    "compressible": true,
+    "extensions": ["vbox"]
+  },
+  "application/x-virtualbox-vbox-extpack": {
+    "compressible": false,
+    "extensions": ["vbox-extpack"]
+  },
+  "application/x-virtualbox-vdi": {
+    "compressible": true,
+    "extensions": ["vdi"]
+  },
+  "application/x-virtualbox-vhd": {
+    "compressible": true,
+    "extensions": ["vhd"]
+  },
+  "application/x-virtualbox-vmdk": {
+    "compressible": true,
+    "extensions": ["vmdk"]
+  },
+  "application/x-wais-source": {
+    "source": "apache",
+    "extensions": ["src"]
+  },
+  "application/x-web-app-manifest+json": {
+    "compressible": true,
+    "extensions": ["webapp"]
+  },
+  "application/x-www-form-urlencoded": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/x-x509-ca-cert": {
+    "source": "iana",
+    "extensions": ["der","crt","pem"]
+  },
+  "application/x-x509-ca-ra-cert": {
+    "source": "iana"
+  },
+  "application/x-x509-next-ca-cert": {
+    "source": "iana"
+  },
+  "application/x-xfig": {
+    "source": "apache",
+    "extensions": ["fig"]
+  },
+  "application/x-xliff+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xlf"]
+  },
+  "application/x-xpinstall": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["xpi"]
+  },
+  "application/x-xz": {
+    "source": "apache",
+    "extensions": ["xz"]
+  },
+  "application/x-zip-compressed": {
+    "extensions": ["zip"]
+  },
+  "application/x-zmachine": {
+    "source": "apache",
+    "extensions": ["z1","z2","z3","z4","z5","z6","z7","z8"]
+  },
+  "application/x400-bp": {
+    "source": "iana"
+  },
+  "application/xacml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xaml+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xaml"]
+  },
+  "application/xcap-att+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xav"]
+  },
+  "application/xcap-caps+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xca"]
+  },
+  "application/xcap-diff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xdf"]
+  },
+  "application/xcap-el+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xel"]
+  },
+  "application/xcap-error+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xcap-ns+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xns"]
+  },
+  "application/xcon-conference-info+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xcon-conference-info-diff+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xenc+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xenc"]
+  },
+  "application/xfdf": {
+    "source": "iana",
+    "extensions": ["xfdf"]
+  },
+  "application/xhtml+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xhtml","xht"]
+  },
+  "application/xhtml-voice+xml": {
+    "source": "apache",
+    "compressible": true
+  },
+  "application/xliff+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xlf"]
+  },
+  "application/xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xml","xsl","xsd","rng"]
+  },
+  "application/xml-dtd": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dtd"]
+  },
+  "application/xml-external-parsed-entity": {
+    "source": "iana"
+  },
+  "application/xml-patch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xmpp+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/xop+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xop"]
+  },
+  "application/xproc+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xpl"]
+  },
+  "application/xslt+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xsl","xslt"]
+  },
+  "application/xspf+xml": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["xspf"]
+  },
+  "application/xv+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["mxml","xhvml","xvml","xvm"]
+  },
+  "application/yaml": {
+    "source": "iana"
+  },
+  "application/yang": {
+    "source": "iana",
+    "extensions": ["yang"]
+  },
+  "application/yang-data+cbor": {
+    "source": "iana"
+  },
+  "application/yang-data+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-data+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-patch+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-patch+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yang-sid+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "application/yin+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["yin"]
+  },
+  "application/zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["zip"]
+  },
+  "application/zip+dotlottie": {
+    "extensions": ["lottie"]
+  },
+  "application/zlib": {
+    "source": "iana"
+  },
+  "application/zstd": {
+    "source": "iana"
+  },
+  "audio/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "audio/32kadpcm": {
+    "source": "iana"
+  },
+  "audio/3gpp": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["3gpp"]
+  },
+  "audio/3gpp2": {
+    "source": "iana"
+  },
+  "audio/aac": {
+    "source": "iana",
+    "extensions": ["adts","aac"]
+  },
+  "audio/ac3": {
+    "source": "iana"
+  },
+  "audio/adpcm": {
+    "source": "apache",
+    "extensions": ["adp"]
+  },
+  "audio/amr": {
+    "source": "iana",
+    "extensions": ["amr"]
+  },
+  "audio/amr-wb": {
+    "source": "iana"
+  },
+  "audio/amr-wb+": {
+    "source": "iana"
+  },
+  "audio/aptx": {
+    "source": "iana"
+  },
+  "audio/asc": {
+    "source": "iana"
+  },
+  "audio/atrac-advanced-lossless": {
+    "source": "iana"
+  },
+  "audio/atrac-x": {
+    "source": "iana"
+  },
+  "audio/atrac3": {
+    "source": "iana"
+  },
+  "audio/basic": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["au","snd"]
+  },
+  "audio/bv16": {
+    "source": "iana"
+  },
+  "audio/bv32": {
+    "source": "iana"
+  },
+  "audio/clearmode": {
+    "source": "iana"
+  },
+  "audio/cn": {
+    "source": "iana"
+  },
+  "audio/dat12": {
+    "source": "iana"
+  },
+  "audio/dls": {
+    "source": "iana"
+  },
+  "audio/dsr-es201108": {
+    "source": "iana"
+  },
+  "audio/dsr-es202050": {
+    "source": "iana"
+  },
+  "audio/dsr-es202211": {
+    "source": "iana"
+  },
+  "audio/dsr-es202212": {
+    "source": "iana"
+  },
+  "audio/dv": {
+    "source": "iana"
+  },
+  "audio/dvi4": {
+    "source": "iana"
+  },
+  "audio/eac3": {
+    "source": "iana"
+  },
+  "audio/encaprtp": {
+    "source": "iana"
+  },
+  "audio/evrc": {
+    "source": "iana"
+  },
+  "audio/evrc-qcp": {
+    "source": "iana"
+  },
+  "audio/evrc0": {
+    "source": "iana"
+  },
+  "audio/evrc1": {
+    "source": "iana"
+  },
+  "audio/evrcb": {
+    "source": "iana"
+  },
+  "audio/evrcb0": {
+    "source": "iana"
+  },
+  "audio/evrcb1": {
+    "source": "iana"
+  },
+  "audio/evrcnw": {
+    "source": "iana"
+  },
+  "audio/evrcnw0": {
+    "source": "iana"
+  },
+  "audio/evrcnw1": {
+    "source": "iana"
+  },
+  "audio/evrcwb": {
+    "source": "iana"
+  },
+  "audio/evrcwb0": {
+    "source": "iana"
+  },
+  "audio/evrcwb1": {
+    "source": "iana"
+  },
+  "audio/evs": {
+    "source": "iana"
+  },
+  "audio/flac": {
+    "source": "iana"
+  },
+  "audio/flexfec": {
+    "source": "iana"
+  },
+  "audio/fwdred": {
+    "source": "iana"
+  },
+  "audio/g711-0": {
+    "source": "iana"
+  },
+  "audio/g719": {
+    "source": "iana"
+  },
+  "audio/g722": {
+    "source": "iana"
+  },
+  "audio/g7221": {
+    "source": "iana"
+  },
+  "audio/g723": {
+    "source": "iana"
+  },
+  "audio/g726-16": {
+    "source": "iana"
+  },
+  "audio/g726-24": {
+    "source": "iana"
+  },
+  "audio/g726-32": {
+    "source": "iana"
+  },
+  "audio/g726-40": {
+    "source": "iana"
+  },
+  "audio/g728": {
+    "source": "iana"
+  },
+  "audio/g729": {
+    "source": "iana"
+  },
+  "audio/g7291": {
+    "source": "iana"
+  },
+  "audio/g729d": {
+    "source": "iana"
+  },
+  "audio/g729e": {
+    "source": "iana"
+  },
+  "audio/gsm": {
+    "source": "iana"
+  },
+  "audio/gsm-efr": {
+    "source": "iana"
+  },
+  "audio/gsm-hr-08": {
+    "source": "iana"
+  },
+  "audio/ilbc": {
+    "source": "iana"
+  },
+  "audio/ip-mr_v2.5": {
+    "source": "iana"
+  },
+  "audio/isac": {
+    "source": "apache"
+  },
+  "audio/l16": {
+    "source": "iana"
+  },
+  "audio/l20": {
+    "source": "iana"
+  },
+  "audio/l24": {
+    "source": "iana",
+    "compressible": false
+  },
+  "audio/l8": {
+    "source": "iana"
+  },
+  "audio/lpc": {
+    "source": "iana"
+  },
+  "audio/matroska": {
+    "source": "iana"
+  },
+  "audio/melp": {
+    "source": "iana"
+  },
+  "audio/melp1200": {
+    "source": "iana"
+  },
+  "audio/melp2400": {
+    "source": "iana"
+  },
+  "audio/melp600": {
+    "source": "iana"
+  },
+  "audio/mhas": {
+    "source": "iana"
+  },
+  "audio/midi": {
+    "source": "apache",
+    "extensions": ["mid","midi","kar","rmi"]
+  },
+  "audio/midi-clip": {
+    "source": "iana"
+  },
+  "audio/mobile-xmf": {
+    "source": "iana",
+    "extensions": ["mxmf"]
+  },
+  "audio/mp3": {
+    "compressible": false,
+    "extensions": ["mp3"]
+  },
+  "audio/mp4": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["m4a","mp4a","m4b"]
+  },
+  "audio/mp4a-latm": {
+    "source": "iana"
+  },
+  "audio/mpa": {
+    "source": "iana"
+  },
+  "audio/mpa-robust": {
+    "source": "iana"
+  },
+  "audio/mpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mpga","mp2","mp2a","mp3","m2a","m3a"]
+  },
+  "audio/mpeg4-generic": {
+    "source": "iana"
+  },
+  "audio/musepack": {
+    "source": "apache"
+  },
+  "audio/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["oga","ogg","spx","opus"]
+  },
+  "audio/opus": {
+    "source": "iana"
+  },
+  "audio/parityfec": {
+    "source": "iana"
+  },
+  "audio/pcma": {
+    "source": "iana"
+  },
+  "audio/pcma-wb": {
+    "source": "iana"
+  },
+  "audio/pcmu": {
+    "source": "iana"
+  },
+  "audio/pcmu-wb": {
+    "source": "iana"
+  },
+  "audio/prs.sid": {
+    "source": "iana"
+  },
+  "audio/qcelp": {
+    "source": "iana"
+  },
+  "audio/raptorfec": {
+    "source": "iana"
+  },
+  "audio/red": {
+    "source": "iana"
+  },
+  "audio/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "audio/rtp-midi": {
+    "source": "iana"
+  },
+  "audio/rtploopback": {
+    "source": "iana"
+  },
+  "audio/rtx": {
+    "source": "iana"
+  },
+  "audio/s3m": {
+    "source": "apache",
+    "extensions": ["s3m"]
+  },
+  "audio/scip": {
+    "source": "iana"
+  },
+  "audio/silk": {
+    "source": "apache",
+    "extensions": ["sil"]
+  },
+  "audio/smv": {
+    "source": "iana"
+  },
+  "audio/smv-qcp": {
+    "source": "iana"
+  },
+  "audio/smv0": {
+    "source": "iana"
+  },
+  "audio/sofa": {
+    "source": "iana"
+  },
+  "audio/sp-midi": {
+    "source": "iana"
+  },
+  "audio/speex": {
+    "source": "iana"
+  },
+  "audio/t140c": {
+    "source": "iana"
+  },
+  "audio/t38": {
+    "source": "iana"
+  },
+  "audio/telephone-event": {
+    "source": "iana"
+  },
+  "audio/tetra_acelp": {
+    "source": "iana"
+  },
+  "audio/tetra_acelp_bb": {
+    "source": "iana"
+  },
+  "audio/tone": {
+    "source": "iana"
+  },
+  "audio/tsvcis": {
+    "source": "iana"
+  },
+  "audio/uemclip": {
+    "source": "iana"
+  },
+  "audio/ulpfec": {
+    "source": "iana"
+  },
+  "audio/usac": {
+    "source": "iana"
+  },
+  "audio/vdvi": {
+    "source": "iana"
+  },
+  "audio/vmr-wb": {
+    "source": "iana"
+  },
+  "audio/vnd.3gpp.iufp": {
+    "source": "iana"
+  },
+  "audio/vnd.4sb": {
+    "source": "iana"
+  },
+  "audio/vnd.audiokoz": {
+    "source": "iana"
+  },
+  "audio/vnd.celp": {
+    "source": "iana"
+  },
+  "audio/vnd.cisco.nse": {
+    "source": "iana"
+  },
+  "audio/vnd.cmles.radio-events": {
+    "source": "iana"
+  },
+  "audio/vnd.cns.anp1": {
+    "source": "iana"
+  },
+  "audio/vnd.cns.inf1": {
+    "source": "iana"
+  },
+  "audio/vnd.dece.audio": {
+    "source": "iana",
+    "extensions": ["uva","uvva"]
+  },
+  "audio/vnd.digital-winds": {
+    "source": "iana",
+    "extensions": ["eol"]
+  },
+  "audio/vnd.dlna.adts": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.heaac.1": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.heaac.2": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.mlp": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.mps": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2x": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pl2z": {
+    "source": "iana"
+  },
+  "audio/vnd.dolby.pulse.1": {
+    "source": "iana"
+  },
+  "audio/vnd.dra": {
+    "source": "iana",
+    "extensions": ["dra"]
+  },
+  "audio/vnd.dts": {
+    "source": "iana",
+    "extensions": ["dts"]
+  },
+  "audio/vnd.dts.hd": {
+    "source": "iana",
+    "extensions": ["dtshd"]
+  },
+  "audio/vnd.dts.uhd": {
+    "source": "iana"
+  },
+  "audio/vnd.dvb.file": {
+    "source": "iana"
+  },
+  "audio/vnd.everad.plj": {
+    "source": "iana"
+  },
+  "audio/vnd.hns.audio": {
+    "source": "iana"
+  },
+  "audio/vnd.lucent.voice": {
+    "source": "iana",
+    "extensions": ["lvp"]
+  },
+  "audio/vnd.ms-playready.media.pya": {
+    "source": "iana",
+    "extensions": ["pya"]
+  },
+  "audio/vnd.nokia.mobile-xmf": {
+    "source": "iana"
+  },
+  "audio/vnd.nortel.vbk": {
+    "source": "iana"
+  },
+  "audio/vnd.nuera.ecelp4800": {
+    "source": "iana",
+    "extensions": ["ecelp4800"]
+  },
+  "audio/vnd.nuera.ecelp7470": {
+    "source": "iana",
+    "extensions": ["ecelp7470"]
+  },
+  "audio/vnd.nuera.ecelp9600": {
+    "source": "iana",
+    "extensions": ["ecelp9600"]
+  },
+  "audio/vnd.octel.sbc": {
+    "source": "iana"
+  },
+  "audio/vnd.presonus.multitrack": {
+    "source": "iana"
+  },
+  "audio/vnd.qcelp": {
+    "source": "apache"
+  },
+  "audio/vnd.rhetorex.32kadpcm": {
+    "source": "iana"
+  },
+  "audio/vnd.rip": {
+    "source": "iana",
+    "extensions": ["rip"]
+  },
+  "audio/vnd.rn-realaudio": {
+    "compressible": false
+  },
+  "audio/vnd.sealedmedia.softseal.mpeg": {
+    "source": "iana"
+  },
+  "audio/vnd.vmx.cvsd": {
+    "source": "iana"
+  },
+  "audio/vnd.wave": {
+    "compressible": false
+  },
+  "audio/vorbis": {
+    "source": "iana",
+    "compressible": false
+  },
+  "audio/vorbis-config": {
+    "source": "iana"
+  },
+  "audio/wav": {
+    "compressible": false,
+    "extensions": ["wav"]
+  },
+  "audio/wave": {
+    "compressible": false,
+    "extensions": ["wav"]
+  },
+  "audio/webm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["weba"]
+  },
+  "audio/x-aac": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["aac"]
+  },
+  "audio/x-aiff": {
+    "source": "apache",
+    "extensions": ["aif","aiff","aifc"]
+  },
+  "audio/x-caf": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["caf"]
+  },
+  "audio/x-flac": {
+    "source": "apache",
+    "extensions": ["flac"]
+  },
+  "audio/x-m4a": {
+    "source": "nginx",
+    "extensions": ["m4a"]
+  },
+  "audio/x-matroska": {
+    "source": "apache",
+    "extensions": ["mka"]
+  },
+  "audio/x-mpegurl": {
+    "source": "apache",
+    "extensions": ["m3u"]
+  },
+  "audio/x-ms-wax": {
+    "source": "apache",
+    "extensions": ["wax"]
+  },
+  "audio/x-ms-wma": {
+    "source": "apache",
+    "extensions": ["wma"]
+  },
+  "audio/x-pn-realaudio": {
+    "source": "apache",
+    "extensions": ["ram","ra"]
+  },
+  "audio/x-pn-realaudio-plugin": {
+    "source": "apache",
+    "extensions": ["rmp"]
+  },
+  "audio/x-realaudio": {
+    "source": "nginx",
+    "extensions": ["ra"]
+  },
+  "audio/x-tta": {
+    "source": "apache"
+  },
+  "audio/x-wav": {
+    "source": "apache",
+    "extensions": ["wav"]
+  },
+  "audio/xm": {
+    "source": "apache",
+    "extensions": ["xm"]
+  },
+  "chemical/x-cdx": {
+    "source": "apache",
+    "extensions": ["cdx"]
+  },
+  "chemical/x-cif": {
+    "source": "apache",
+    "extensions": ["cif"]
+  },
+  "chemical/x-cmdf": {
+    "source": "apache",
+    "extensions": ["cmdf"]
+  },
+  "chemical/x-cml": {
+    "source": "apache",
+    "extensions": ["cml"]
+  },
+  "chemical/x-csml": {
+    "source": "apache",
+    "extensions": ["csml"]
+  },
+  "chemical/x-pdb": {
+    "source": "apache"
+  },
+  "chemical/x-xyz": {
+    "source": "apache",
+    "extensions": ["xyz"]
+  },
+  "font/collection": {
+    "source": "iana",
+    "extensions": ["ttc"]
+  },
+  "font/otf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["otf"]
+  },
+  "font/sfnt": {
+    "source": "iana"
+  },
+  "font/ttf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ttf"]
+  },
+  "font/woff": {
+    "source": "iana",
+    "extensions": ["woff"]
+  },
+  "font/woff2": {
+    "source": "iana",
+    "extensions": ["woff2"]
+  },
+  "image/aces": {
+    "source": "iana",
+    "extensions": ["exr"]
+  },
+  "image/apng": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["apng"]
+  },
+  "image/avci": {
+    "source": "iana",
+    "extensions": ["avci"]
+  },
+  "image/avcs": {
+    "source": "iana",
+    "extensions": ["avcs"]
+  },
+  "image/avif": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["avif"]
+  },
+  "image/bmp": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["bmp","dib"]
+  },
+  "image/cgm": {
+    "source": "iana",
+    "extensions": ["cgm"]
+  },
+  "image/dicom-rle": {
+    "source": "iana",
+    "extensions": ["drle"]
+  },
+  "image/dpx": {
+    "source": "iana",
+    "extensions": ["dpx"]
+  },
+  "image/emf": {
+    "source": "iana",
+    "extensions": ["emf"]
+  },
+  "image/fits": {
+    "source": "iana",
+    "extensions": ["fits"]
+  },
+  "image/g3fax": {
+    "source": "iana",
+    "extensions": ["g3"]
+  },
+  "image/gif": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["gif"]
+  },
+  "image/heic": {
+    "source": "iana",
+    "extensions": ["heic"]
+  },
+  "image/heic-sequence": {
+    "source": "iana",
+    "extensions": ["heics"]
+  },
+  "image/heif": {
+    "source": "iana",
+    "extensions": ["heif"]
+  },
+  "image/heif-sequence": {
+    "source": "iana",
+    "extensions": ["heifs"]
+  },
+  "image/hej2k": {
+    "source": "iana",
+    "extensions": ["hej2"]
+  },
+  "image/ief": {
+    "source": "iana",
+    "extensions": ["ief"]
+  },
+  "image/j2c": {
+    "source": "iana"
+  },
+  "image/jaii": {
+    "source": "iana",
+    "extensions": ["jaii"]
+  },
+  "image/jais": {
+    "source": "iana",
+    "extensions": ["jais"]
+  },
+  "image/jls": {
+    "source": "iana",
+    "extensions": ["jls"]
+  },
+  "image/jp2": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jp2","jpg2"]
+  },
+  "image/jpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpg","jpeg","jpe"]
+  },
+  "image/jph": {
+    "source": "iana",
+    "extensions": ["jph"]
+  },
+  "image/jphc": {
+    "source": "iana",
+    "extensions": ["jhc"]
+  },
+  "image/jpm": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpm","jpgm"]
+  },
+  "image/jpx": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["jpx","jpf"]
+  },
+  "image/jxl": {
+    "source": "iana",
+    "extensions": ["jxl"]
+  },
+  "image/jxr": {
+    "source": "iana",
+    "extensions": ["jxr"]
+  },
+  "image/jxra": {
+    "source": "iana",
+    "extensions": ["jxra"]
+  },
+  "image/jxrs": {
+    "source": "iana",
+    "extensions": ["jxrs"]
+  },
+  "image/jxs": {
+    "source": "iana",
+    "extensions": ["jxs"]
+  },
+  "image/jxsc": {
+    "source": "iana",
+    "extensions": ["jxsc"]
+  },
+  "image/jxsi": {
+    "source": "iana",
+    "extensions": ["jxsi"]
+  },
+  "image/jxss": {
+    "source": "iana",
+    "extensions": ["jxss"]
+  },
+  "image/ktx": {
+    "source": "iana",
+    "extensions": ["ktx"]
+  },
+  "image/ktx2": {
+    "source": "iana",
+    "extensions": ["ktx2"]
+  },
+  "image/naplps": {
+    "source": "iana"
+  },
+  "image/pjpeg": {
+    "compressible": false,
+    "extensions": ["jfif"]
+  },
+  "image/png": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["png"]
+  },
+  "image/prs.btif": {
+    "source": "iana",
+    "extensions": ["btif","btf"]
+  },
+  "image/prs.pti": {
+    "source": "iana",
+    "extensions": ["pti"]
+  },
+  "image/pwg-raster": {
+    "source": "iana"
+  },
+  "image/sgi": {
+    "source": "apache",
+    "extensions": ["sgi"]
+  },
+  "image/svg+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["svg","svgz"]
+  },
+  "image/t38": {
+    "source": "iana",
+    "extensions": ["t38"]
+  },
+  "image/tiff": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["tif","tiff"]
+  },
+  "image/tiff-fx": {
+    "source": "iana",
+    "extensions": ["tfx"]
+  },
+  "image/vnd.adobe.photoshop": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["psd"]
+  },
+  "image/vnd.airzip.accelerator.azv": {
+    "source": "iana",
+    "extensions": ["azv"]
+  },
+  "image/vnd.clip": {
+    "source": "iana"
+  },
+  "image/vnd.cns.inf2": {
+    "source": "iana"
+  },
+  "image/vnd.dece.graphic": {
+    "source": "iana",
+    "extensions": ["uvi","uvvi","uvg","uvvg"]
+  },
+  "image/vnd.djvu": {
+    "source": "iana",
+    "extensions": ["djvu","djv"]
+  },
+  "image/vnd.dvb.subtitle": {
+    "source": "iana",
+    "extensions": ["sub"]
+  },
+  "image/vnd.dwg": {
+    "source": "iana",
+    "extensions": ["dwg"]
+  },
+  "image/vnd.dxf": {
+    "source": "iana",
+    "extensions": ["dxf"]
+  },
+  "image/vnd.fastbidsheet": {
+    "source": "iana",
+    "extensions": ["fbs"]
+  },
+  "image/vnd.fpx": {
+    "source": "iana",
+    "extensions": ["fpx"]
+  },
+  "image/vnd.fst": {
+    "source": "iana",
+    "extensions": ["fst"]
+  },
+  "image/vnd.fujixerox.edmics-mmr": {
+    "source": "iana",
+    "extensions": ["mmr"]
+  },
+  "image/vnd.fujixerox.edmics-rlc": {
+    "source": "iana",
+    "extensions": ["rlc"]
+  },
+  "image/vnd.globalgraphics.pgb": {
+    "source": "iana"
+  },
+  "image/vnd.microsoft.icon": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["ico"]
+  },
+  "image/vnd.mix": {
+    "source": "iana"
+  },
+  "image/vnd.mozilla.apng": {
+    "source": "iana"
+  },
+  "image/vnd.ms-dds": {
+    "compressible": true,
+    "extensions": ["dds"]
+  },
+  "image/vnd.ms-modi": {
+    "source": "iana",
+    "extensions": ["mdi"]
+  },
+  "image/vnd.ms-photo": {
+    "source": "apache",
+    "extensions": ["wdp"]
+  },
+  "image/vnd.net-fpx": {
+    "source": "iana",
+    "extensions": ["npx"]
+  },
+  "image/vnd.pco.b16": {
+    "source": "iana",
+    "extensions": ["b16"]
+  },
+  "image/vnd.radiance": {
+    "source": "iana"
+  },
+  "image/vnd.sealed.png": {
+    "source": "iana"
+  },
+  "image/vnd.sealedmedia.softseal.gif": {
+    "source": "iana"
+  },
+  "image/vnd.sealedmedia.softseal.jpg": {
+    "source": "iana"
+  },
+  "image/vnd.svf": {
+    "source": "iana"
+  },
+  "image/vnd.tencent.tap": {
+    "source": "iana",
+    "extensions": ["tap"]
+  },
+  "image/vnd.valve.source.texture": {
+    "source": "iana",
+    "extensions": ["vtf"]
+  },
+  "image/vnd.wap.wbmp": {
+    "source": "iana",
+    "extensions": ["wbmp"]
+  },
+  "image/vnd.xiff": {
+    "source": "iana",
+    "extensions": ["xif"]
+  },
+  "image/vnd.zbrush.pcx": {
+    "source": "iana",
+    "extensions": ["pcx"]
+  },
+  "image/webp": {
+    "source": "iana",
+    "extensions": ["webp"]
+  },
+  "image/wmf": {
+    "source": "iana",
+    "extensions": ["wmf"]
+  },
+  "image/x-3ds": {
+    "source": "apache",
+    "extensions": ["3ds"]
+  },
+  "image/x-adobe-dng": {
+    "extensions": ["dng"]
+  },
+  "image/x-cmu-raster": {
+    "source": "apache",
+    "extensions": ["ras"]
+  },
+  "image/x-cmx": {
+    "source": "apache",
+    "extensions": ["cmx"]
+  },
+  "image/x-emf": {
+    "source": "iana"
+  },
+  "image/x-freehand": {
+    "source": "apache",
+    "extensions": ["fh","fhc","fh4","fh5","fh7"]
+  },
+  "image/x-icon": {
+    "source": "apache",
+    "compressible": true,
+    "extensions": ["ico"]
+  },
+  "image/x-jng": {
+    "source": "nginx",
+    "extensions": ["jng"]
+  },
+  "image/x-mrsid-image": {
+    "source": "apache",
+    "extensions": ["sid"]
+  },
+  "image/x-ms-bmp": {
+    "source": "nginx",
+    "compressible": true,
+    "extensions": ["bmp"]
+  },
+  "image/x-pcx": {
+    "source": "apache",
+    "extensions": ["pcx"]
+  },
+  "image/x-pict": {
+    "source": "apache",
+    "extensions": ["pic","pct"]
+  },
+  "image/x-portable-anymap": {
+    "source": "apache",
+    "extensions": ["pnm"]
+  },
+  "image/x-portable-bitmap": {
+    "source": "apache",
+    "extensions": ["pbm"]
+  },
+  "image/x-portable-graymap": {
+    "source": "apache",
+    "extensions": ["pgm"]
+  },
+  "image/x-portable-pixmap": {
+    "source": "apache",
+    "extensions": ["ppm"]
+  },
+  "image/x-rgb": {
+    "source": "apache",
+    "extensions": ["rgb"]
+  },
+  "image/x-tga": {
+    "source": "apache",
+    "extensions": ["tga"]
+  },
+  "image/x-wmf": {
+    "source": "iana"
+  },
+  "image/x-xbitmap": {
+    "source": "apache",
+    "extensions": ["xbm"]
+  },
+  "image/x-xcf": {
+    "compressible": false
+  },
+  "image/x-xpixmap": {
+    "source": "apache",
+    "extensions": ["xpm"]
+  },
+  "image/x-xwindowdump": {
+    "source": "apache",
+    "extensions": ["xwd"]
+  },
+  "message/bhttp": {
+    "source": "iana"
+  },
+  "message/cpim": {
+    "source": "iana"
+  },
+  "message/delivery-status": {
+    "source": "iana"
+  },
+  "message/disposition-notification": {
+    "source": "iana",
+    "extensions": [
+      "disposition-notification"
+    ]
+  },
+  "message/external-body": {
+    "source": "iana"
+  },
+  "message/feedback-report": {
+    "source": "iana"
+  },
+  "message/global": {
+    "source": "iana",
+    "extensions": ["u8msg"]
+  },
+  "message/global-delivery-status": {
+    "source": "iana",
+    "extensions": ["u8dsn"]
+  },
+  "message/global-disposition-notification": {
+    "source": "iana",
+    "extensions": ["u8mdn"]
+  },
+  "message/global-headers": {
+    "source": "iana",
+    "extensions": ["u8hdr"]
+  },
+  "message/http": {
+    "source": "iana",
+    "compressible": false
+  },
+  "message/imdn+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "message/mls": {
+    "source": "iana"
+  },
+  "message/news": {
+    "source": "apache"
+  },
+  "message/ohttp-req": {
+    "source": "iana"
+  },
+  "message/ohttp-res": {
+    "source": "iana"
+  },
+  "message/partial": {
+    "source": "iana",
+    "compressible": false
+  },
+  "message/rfc822": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["eml","mime","mht","mhtml"]
+  },
+  "message/s-http": {
+    "source": "apache"
+  },
+  "message/sip": {
+    "source": "iana"
+  },
+  "message/sipfrag": {
+    "source": "iana"
+  },
+  "message/tracking-status": {
+    "source": "iana"
+  },
+  "message/vnd.si.simp": {
+    "source": "apache"
+  },
+  "message/vnd.wfa.wsc": {
+    "source": "iana",
+    "extensions": ["wsc"]
+  },
+  "model/3mf": {
+    "source": "iana",
+    "extensions": ["3mf"]
+  },
+  "model/e57": {
+    "source": "iana"
+  },
+  "model/gltf+json": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["gltf"]
+  },
+  "model/gltf-binary": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["glb"]
+  },
+  "model/iges": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["igs","iges"]
+  },
+  "model/jt": {
+    "source": "iana",
+    "extensions": ["jt"]
+  },
+  "model/mesh": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["msh","mesh","silo"]
+  },
+  "model/mtl": {
+    "source": "iana",
+    "extensions": ["mtl"]
+  },
+  "model/obj": {
+    "source": "iana",
+    "extensions": ["obj"]
+  },
+  "model/prc": {
+    "source": "iana",
+    "extensions": ["prc"]
+  },
+  "model/step": {
+    "source": "iana",
+    "extensions": ["step","stp","stpnc","p21","210"]
+  },
+  "model/step+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["stpx"]
+  },
+  "model/step+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["stpz"]
+  },
+  "model/step-xml+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["stpxz"]
+  },
+  "model/stl": {
+    "source": "iana",
+    "extensions": ["stl"]
+  },
+  "model/u3d": {
+    "source": "iana",
+    "extensions": ["u3d"]
+  },
+  "model/vnd.bary": {
+    "source": "iana",
+    "extensions": ["bary"]
+  },
+  "model/vnd.cld": {
+    "source": "iana",
+    "extensions": ["cld"]
+  },
+  "model/vnd.collada+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["dae"]
+  },
+  "model/vnd.dwf": {
+    "source": "iana",
+    "extensions": ["dwf"]
+  },
+  "model/vnd.flatland.3dml": {
+    "source": "iana"
+  },
+  "model/vnd.gdl": {
+    "source": "iana",
+    "extensions": ["gdl"]
+  },
+  "model/vnd.gs-gdl": {
+    "source": "apache"
+  },
+  "model/vnd.gs.gdl": {
+    "source": "iana"
+  },
+  "model/vnd.gtw": {
+    "source": "iana",
+    "extensions": ["gtw"]
+  },
+  "model/vnd.moml+xml": {
+    "source": "iana",
+    "compressible": true
+  },
+  "model/vnd.mts": {
+    "source": "iana",
+    "extensions": ["mts"]
+  },
+  "model/vnd.opengex": {
+    "source": "iana",
+    "extensions": ["ogex"]
+  },
+  "model/vnd.parasolid.transmit.binary": {
+    "source": "iana",
+    "extensions": ["x_b"]
+  },
+  "model/vnd.parasolid.transmit.text": {
+    "source": "iana",
+    "extensions": ["x_t"]
+  },
+  "model/vnd.pytha.pyox": {
+    "source": "iana",
+    "extensions": ["pyo","pyox"]
+  },
+  "model/vnd.rosette.annotated-data-model": {
+    "source": "iana"
+  },
+  "model/vnd.sap.vds": {
+    "source": "iana",
+    "extensions": ["vds"]
+  },
+  "model/vnd.usda": {
+    "source": "iana",
+    "extensions": ["usda"]
+  },
+  "model/vnd.usdz+zip": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["usdz"]
+  },
+  "model/vnd.valve.source.compiled-map": {
+    "source": "iana",
+    "extensions": ["bsp"]
+  },
+  "model/vnd.vtu": {
+    "source": "iana",
+    "extensions": ["vtu"]
+  },
+  "model/vrml": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["wrl","vrml"]
+  },
+  "model/x3d+binary": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["x3db","x3dbz"]
+  },
+  "model/x3d+fastinfoset": {
+    "source": "iana",
+    "extensions": ["x3db"]
+  },
+  "model/x3d+vrml": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["x3dv","x3dvz"]
+  },
+  "model/x3d+xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["x3d","x3dz"]
+  },
+  "model/x3d-vrml": {
+    "source": "iana",
+    "extensions": ["x3dv"]
+  },
+  "multipart/alternative": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/appledouble": {
+    "source": "iana"
+  },
+  "multipart/byteranges": {
+    "source": "iana"
+  },
+  "multipart/digest": {
+    "source": "iana"
+  },
+  "multipart/encrypted": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/form-data": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/header-set": {
+    "source": "iana"
+  },
+  "multipart/mixed": {
+    "source": "iana"
+  },
+  "multipart/multilingual": {
+    "source": "iana"
+  },
+  "multipart/parallel": {
+    "source": "iana"
+  },
+  "multipart/related": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/report": {
+    "source": "iana"
+  },
+  "multipart/signed": {
+    "source": "iana",
+    "compressible": false
+  },
+  "multipart/vnd.bint.med-plus": {
+    "source": "iana"
+  },
+  "multipart/voice-message": {
+    "source": "iana"
+  },
+  "multipart/x-mixed-replace": {
+    "source": "iana"
+  },
+  "text/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "text/cache-manifest": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["appcache","manifest"]
+  },
+  "text/calendar": {
+    "source": "iana",
+    "extensions": ["ics","ifb"]
+  },
+  "text/calender": {
+    "compressible": true
+  },
+  "text/cmd": {
+    "compressible": true
+  },
+  "text/coffeescript": {
+    "extensions": ["coffee","litcoffee"]
+  },
+  "text/cql": {
+    "source": "iana"
+  },
+  "text/cql-expression": {
+    "source": "iana"
+  },
+  "text/cql-identifier": {
+    "source": "iana"
+  },
+  "text/css": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["css"]
+  },
+  "text/csv": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["csv"]
+  },
+  "text/csv-schema": {
+    "source": "iana"
+  },
+  "text/directory": {
+    "source": "iana"
+  },
+  "text/dns": {
+    "source": "iana"
+  },
+  "text/ecmascript": {
+    "source": "apache"
+  },
+  "text/encaprtp": {
+    "source": "iana"
+  },
+  "text/enriched": {
+    "source": "iana"
+  },
+  "text/fhirpath": {
+    "source": "iana"
+  },
+  "text/flexfec": {
+    "source": "iana"
+  },
+  "text/fwdred": {
+    "source": "iana"
+  },
+  "text/gff3": {
+    "source": "iana"
+  },
+  "text/grammar-ref-list": {
+    "source": "iana"
+  },
+  "text/hl7v2": {
+    "source": "iana"
+  },
+  "text/html": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["html","htm","shtml"]
+  },
+  "text/jade": {
+    "extensions": ["jade"]
+  },
+  "text/javascript": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["js","mjs"]
+  },
+  "text/jcr-cnd": {
+    "source": "iana"
+  },
+  "text/jsx": {
+    "compressible": true,
+    "extensions": ["jsx"]
+  },
+  "text/less": {
+    "compressible": true,
+    "extensions": ["less"]
+  },
+  "text/markdown": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["md","markdown"]
+  },
+  "text/mathml": {
+    "source": "nginx",
+    "extensions": ["mml"]
+  },
+  "text/mdx": {
+    "compressible": true,
+    "extensions": ["mdx"]
+  },
+  "text/mizar": {
+    "source": "iana"
+  },
+  "text/n3": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["n3"]
+  },
+  "text/parameters": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/parityfec": {
+    "source": "iana"
+  },
+  "text/plain": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["txt","text","conf","def","list","log","in","ini"]
+  },
+  "text/provenance-notation": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/prs.fallenstein.rst": {
+    "source": "iana"
+  },
+  "text/prs.lines.tag": {
+    "source": "iana",
+    "extensions": ["dsc"]
+  },
+  "text/prs.prop.logic": {
+    "source": "iana"
+  },
+  "text/prs.texi": {
+    "source": "iana"
+  },
+  "text/raptorfec": {
+    "source": "iana"
+  },
+  "text/red": {
+    "source": "iana"
+  },
+  "text/rfc822-headers": {
+    "source": "iana"
+  },
+  "text/richtext": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtx"]
+  },
+  "text/rtf": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["rtf"]
+  },
+  "text/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "text/rtploopback": {
+    "source": "iana"
+  },
+  "text/rtx": {
+    "source": "iana"
+  },
+  "text/sgml": {
+    "source": "iana",
+    "extensions": ["sgml","sgm"]
+  },
+  "text/shaclc": {
+    "source": "iana"
+  },
+  "text/shex": {
+    "source": "iana",
+    "extensions": ["shex"]
+  },
+  "text/slim": {
+    "extensions": ["slim","slm"]
+  },
+  "text/spdx": {
+    "source": "iana",
+    "extensions": ["spdx"]
+  },
+  "text/strings": {
+    "source": "iana"
+  },
+  "text/stylus": {
+    "extensions": ["stylus","styl"]
+  },
+  "text/t140": {
+    "source": "iana"
+  },
+  "text/tab-separated-values": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["tsv"]
+  },
+  "text/troff": {
+    "source": "iana",
+    "extensions": ["t","tr","roff","man","me","ms"]
+  },
+  "text/turtle": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["ttl"]
+  },
+  "text/ulpfec": {
+    "source": "iana"
+  },
+  "text/uri-list": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["uri","uris","urls"]
+  },
+  "text/vcard": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["vcard"]
+  },
+  "text/vnd.a": {
+    "source": "iana"
+  },
+  "text/vnd.abc": {
+    "source": "iana"
+  },
+  "text/vnd.ascii-art": {
+    "source": "iana"
+  },
+  "text/vnd.curl": {
+    "source": "iana",
+    "extensions": ["curl"]
+  },
+  "text/vnd.curl.dcurl": {
+    "source": "apache",
+    "extensions": ["dcurl"]
+  },
+  "text/vnd.curl.mcurl": {
+    "source": "apache",
+    "extensions": ["mcurl"]
+  },
+  "text/vnd.curl.scurl": {
+    "source": "apache",
+    "extensions": ["scurl"]
+  },
+  "text/vnd.debian.copyright": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.dmclientscript": {
+    "source": "iana"
+  },
+  "text/vnd.dvb.subtitle": {
+    "source": "iana",
+    "extensions": ["sub"]
+  },
+  "text/vnd.esmertec.theme-descriptor": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.exchangeable": {
+    "source": "iana"
+  },
+  "text/vnd.familysearch.gedcom": {
+    "source": "iana",
+    "extensions": ["ged"]
+  },
+  "text/vnd.ficlab.flt": {
+    "source": "iana"
+  },
+  "text/vnd.fly": {
+    "source": "iana",
+    "extensions": ["fly"]
+  },
+  "text/vnd.fmi.flexstor": {
+    "source": "iana",
+    "extensions": ["flx"]
+  },
+  "text/vnd.gml": {
+    "source": "iana"
+  },
+  "text/vnd.graphviz": {
+    "source": "iana",
+    "extensions": ["gv"]
+  },
+  "text/vnd.hans": {
+    "source": "iana"
+  },
+  "text/vnd.hgl": {
+    "source": "iana"
+  },
+  "text/vnd.in3d.3dml": {
+    "source": "iana",
+    "extensions": ["3dml"]
+  },
+  "text/vnd.in3d.spot": {
+    "source": "iana",
+    "extensions": ["spot"]
+  },
+  "text/vnd.iptc.newsml": {
+    "source": "iana"
+  },
+  "text/vnd.iptc.nitf": {
+    "source": "iana"
+  },
+  "text/vnd.latex-z": {
+    "source": "iana"
+  },
+  "text/vnd.motorola.reflex": {
+    "source": "iana"
+  },
+  "text/vnd.ms-mediapackage": {
+    "source": "iana"
+  },
+  "text/vnd.net2phone.commcenter.command": {
+    "source": "iana"
+  },
+  "text/vnd.radisys.msml-basic-layout": {
+    "source": "iana"
+  },
+  "text/vnd.senx.warpscript": {
+    "source": "iana"
+  },
+  "text/vnd.si.uricatalogue": {
+    "source": "apache"
+  },
+  "text/vnd.sosi": {
+    "source": "iana"
+  },
+  "text/vnd.sun.j2me.app-descriptor": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "extensions": ["jad"]
+  },
+  "text/vnd.trolltech.linguist": {
+    "source": "iana",
+    "charset": "UTF-8"
+  },
+  "text/vnd.vcf": {
+    "source": "iana"
+  },
+  "text/vnd.wap.si": {
+    "source": "iana"
+  },
+  "text/vnd.wap.sl": {
+    "source": "iana"
+  },
+  "text/vnd.wap.wml": {
+    "source": "iana",
+    "extensions": ["wml"]
+  },
+  "text/vnd.wap.wmlscript": {
+    "source": "iana",
+    "extensions": ["wmls"]
+  },
+  "text/vnd.zoo.kcl": {
+    "source": "iana"
+  },
+  "text/vtt": {
+    "source": "iana",
+    "charset": "UTF-8",
+    "compressible": true,
+    "extensions": ["vtt"]
+  },
+  "text/wgsl": {
+    "source": "iana",
+    "extensions": ["wgsl"]
+  },
+  "text/x-asm": {
+    "source": "apache",
+    "extensions": ["s","asm"]
+  },
+  "text/x-c": {
+    "source": "apache",
+    "extensions": ["c","cc","cxx","cpp","h","hh","dic"]
+  },
+  "text/x-component": {
+    "source": "nginx",
+    "extensions": ["htc"]
+  },
+  "text/x-fortran": {
+    "source": "apache",
+    "extensions": ["f","for","f77","f90"]
+  },
+  "text/x-gwt-rpc": {
+    "compressible": true
+  },
+  "text/x-handlebars-template": {
+    "extensions": ["hbs"]
+  },
+  "text/x-java-source": {
+    "source": "apache",
+    "extensions": ["java"]
+  },
+  "text/x-jquery-tmpl": {
+    "compressible": true
+  },
+  "text/x-lua": {
+    "extensions": ["lua"]
+  },
+  "text/x-markdown": {
+    "compressible": true,
+    "extensions": ["mkd"]
+  },
+  "text/x-nfo": {
+    "source": "apache",
+    "extensions": ["nfo"]
+  },
+  "text/x-opml": {
+    "source": "apache",
+    "extensions": ["opml"]
+  },
+  "text/x-org": {
+    "compressible": true,
+    "extensions": ["org"]
+  },
+  "text/x-pascal": {
+    "source": "apache",
+    "extensions": ["p","pas"]
+  },
+  "text/x-processing": {
+    "compressible": true,
+    "extensions": ["pde"]
+  },
+  "text/x-sass": {
+    "extensions": ["sass"]
+  },
+  "text/x-scss": {
+    "extensions": ["scss"]
+  },
+  "text/x-setext": {
+    "source": "apache",
+    "extensions": ["etx"]
+  },
+  "text/x-sfv": {
+    "source": "apache",
+    "extensions": ["sfv"]
+  },
+  "text/x-suse-ymp": {
+    "compressible": true,
+    "extensions": ["ymp"]
+  },
+  "text/x-uuencode": {
+    "source": "apache",
+    "extensions": ["uu"]
+  },
+  "text/x-vcalendar": {
+    "source": "apache",
+    "extensions": ["vcs"]
+  },
+  "text/x-vcard": {
+    "source": "apache",
+    "extensions": ["vcf"]
+  },
+  "text/xml": {
+    "source": "iana",
+    "compressible": true,
+    "extensions": ["xml"]
+  },
+  "text/xml-external-parsed-entity": {
+    "source": "iana"
+  },
+  "text/yaml": {
+    "compressible": true,
+    "extensions": ["yaml","yml"]
+  },
+  "video/1d-interleaved-parityfec": {
+    "source": "iana"
+  },
+  "video/3gpp": {
+    "source": "iana",
+    "extensions": ["3gp","3gpp"]
+  },
+  "video/3gpp-tt": {
+    "source": "iana"
+  },
+  "video/3gpp2": {
+    "source": "iana",
+    "extensions": ["3g2"]
+  },
+  "video/av1": {
+    "source": "iana"
+  },
+  "video/bmpeg": {
+    "source": "iana"
+  },
+  "video/bt656": {
+    "source": "iana"
+  },
+  "video/celb": {
+    "source": "iana"
+  },
+  "video/dv": {
+    "source": "iana"
+  },
+  "video/encaprtp": {
+    "source": "iana"
+  },
+  "video/evc": {
+    "source": "iana"
+  },
+  "video/ffv1": {
+    "source": "iana"
+  },
+  "video/flexfec": {
+    "source": "iana"
+  },
+  "video/h261": {
+    "source": "iana",
+    "extensions": ["h261"]
+  },
+  "video/h263": {
+    "source": "iana",
+    "extensions": ["h263"]
+  },
+  "video/h263-1998": {
+    "source": "iana"
+  },
+  "video/h263-2000": {
+    "source": "iana"
+  },
+  "video/h264": {
+    "source": "iana",
+    "extensions": ["h264"]
+  },
+  "video/h264-rcdo": {
+    "source": "iana"
+  },
+  "video/h264-svc": {
+    "source": "iana"
+  },
+  "video/h265": {
+    "source": "iana"
+  },
+  "video/h266": {
+    "source": "iana"
+  },
+  "video/iso.segment": {
+    "source": "iana",
+    "extensions": ["m4s"]
+  },
+  "video/jpeg": {
+    "source": "iana",
+    "extensions": ["jpgv"]
+  },
+  "video/jpeg2000": {
+    "source": "iana"
+  },
+  "video/jpm": {
+    "source": "apache",
+    "extensions": ["jpm","jpgm"]
+  },
+  "video/jxsv": {
+    "source": "iana"
+  },
+  "video/lottie+json": {
+    "source": "iana",
+    "compressible": true
+  },
+  "video/matroska": {
+    "source": "iana"
+  },
+  "video/matroska-3d": {
+    "source": "iana"
+  },
+  "video/mj2": {
+    "source": "iana",
+    "extensions": ["mj2","mjp2"]
+  },
+  "video/mp1s": {
+    "source": "iana"
+  },
+  "video/mp2p": {
+    "source": "iana"
+  },
+  "video/mp2t": {
+    "source": "iana",
+    "extensions": ["ts","m2t","m2ts","mts"]
+  },
+  "video/mp4": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mp4","mp4v","mpg4"]
+  },
+  "video/mp4v-es": {
+    "source": "iana"
+  },
+  "video/mpeg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["mpeg","mpg","mpe","m1v","m2v"]
+  },
+  "video/mpeg4-generic": {
+    "source": "iana"
+  },
+  "video/mpv": {
+    "source": "iana"
+  },
+  "video/nv": {
+    "source": "iana"
+  },
+  "video/ogg": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["ogv"]
+  },
+  "video/parityfec": {
+    "source": "iana"
+  },
+  "video/pointer": {
+    "source": "iana"
+  },
+  "video/quicktime": {
+    "source": "iana",
+    "compressible": false,
+    "extensions": ["qt","mov"]
+  },
+  "video/raptorfec": {
+    "source": "iana"
+  },
+  "video/raw": {
+    "source": "iana"
+  },
+  "video/rtp-enc-aescm128": {
+    "source": "iana"
+  },
+  "video/rtploopback": {
+    "source": "iana"
+  },
+  "video/rtx": {
+    "source": "iana"
+  },
+  "video/scip": {
+    "source": "iana"
+  },
+  "video/smpte291": {
+    "source": "iana"
+  },
+  "video/smpte292m": {
+    "source": "iana"
+  },
+  "video/ulpfec": {
+    "source": "iana"
+  },
+  "video/vc1": {
+    "source": "iana"
+  },
+  "video/vc2": {
+    "source": "iana"
+  },
+  "video/vnd.cctv": {
+    "source": "iana"
+  },
+  "video/vnd.dece.hd": {
+    "source": "iana",
+    "extensions": ["uvh","uvvh"]
+  },
+  "video/vnd.dece.mobile": {
+    "source": "iana",
+    "extensions": ["uvm","uvvm"]
+  },
+  "video/vnd.dece.mp4": {
+    "source": "iana"
+  },
+  "video/vnd.dece.pd": {
+    "source": "iana",
+    "extensions": ["uvp","uvvp"]
+  },
+  "video/vnd.dece.sd": {
+    "source": "iana",
+    "extensions": ["uvs","uvvs"]
+  },
+  "video/vnd.dece.video": {
+    "source": "iana",
+    "extensions": ["uvv","uvvv"]
+  },
+  "video/vnd.directv.mpeg": {
+    "source": "iana"
+  },
+  "video/vnd.directv.mpeg-tts": {
+    "source": "iana"
+  },
+  "video/vnd.dlna.mpeg-tts": {
+    "source": "iana"
+  },
+  "video/vnd.dvb.file": {
+    "source": "iana",
+    "extensions": ["dvb"]
+  },
+  "video/vnd.fvt": {
+    "source": "iana",
+    "extensions": ["fvt"]
+  },
+  "video/vnd.hns.video": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.1dparityfec-1010": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.1dparityfec-2005": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.2dparityfec-1010": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.2dparityfec-2005": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.ttsavc": {
+    "source": "iana"
+  },
+  "video/vnd.iptvforum.ttsmpeg2": {
+    "source": "iana"
+  },
+  "video/vnd.motorola.video": {
+    "source": "iana"
+  },
+  "video/vnd.motorola.videop": {
+    "source": "iana"
+  },
+  "video/vnd.mpegurl": {
+    "source": "iana",
+    "extensions": ["mxu","m4u"]
+  },
+  "video/vnd.ms-playready.media.pyv": {
+    "source": "iana",
+    "extensions": ["pyv"]
+  },
+  "video/vnd.nokia.interleaved-multimedia": {
+    "source": "iana"
+  },
+  "video/vnd.nokia.mp4vr": {
+    "source": "iana"
+  },
+  "video/vnd.nokia.videovoip": {
+    "source": "iana"
+  },
+  "video/vnd.objectvideo": {
+    "source": "iana"
+  },
+  "video/vnd.planar": {
+    "source": "iana"
+  },
+  "video/vnd.radgamettools.bink": {
+    "source": "iana"
+  },
+  "video/vnd.radgamettools.smacker": {
+    "source": "apache"
+  },
+  "video/vnd.sealed.mpeg1": {
+    "source": "iana"
+  },
+  "video/vnd.sealed.mpeg4": {
+    "source": "iana"
+  },
+  "video/vnd.sealed.swf": {
+    "source": "iana"
+  },
+  "video/vnd.sealedmedia.softseal.mov": {
+    "source": "iana"
+  },
+  "video/vnd.uvvu.mp4": {
+    "source": "iana",
+    "extensions": ["uvu","uvvu"]
+  },
+  "video/vnd.vivo": {
+    "source": "iana",
+    "extensions": ["viv"]
+  },
+  "video/vnd.youtube.yt": {
+    "source": "iana"
+  },
+  "video/vp8": {
+    "source": "iana"
+  },
+  "video/vp9": {
+    "source": "iana"
+  },
+  "video/webm": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["webm"]
+  },
+  "video/x-f4v": {
+    "source": "apache",
+    "extensions": ["f4v"]
+  },
+  "video/x-fli": {
+    "source": "apache",
+    "extensions": ["fli"]
+  },
+  "video/x-flv": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["flv"]
+  },
+  "video/x-m4v": {
+    "source": "apache",
+    "extensions": ["m4v"]
+  },
+  "video/x-matroska": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["mkv","mk3d","mks"]
+  },
+  "video/x-mng": {
+    "source": "apache",
+    "extensions": ["mng"]
+  },
+  "video/x-ms-asf": {
+    "source": "apache",
+    "extensions": ["asf","asx"]
+  },
+  "video/x-ms-vob": {
+    "source": "apache",
+    "extensions": ["vob"]
+  },
+  "video/x-ms-wm": {
+    "source": "apache",
+    "extensions": ["wm"]
+  },
+  "video/x-ms-wmv": {
+    "source": "apache",
+    "compressible": false,
+    "extensions": ["wmv"]
+  },
+  "video/x-ms-wmx": {
+    "source": "apache",
+    "extensions": ["wmx"]
+  },
+  "video/x-ms-wvx": {
+    "source": "apache",
+    "extensions": ["wvx"]
+  },
+  "video/x-msvideo": {
+    "source": "apache",
+    "extensions": ["avi"]
+  },
+  "video/x-sgi-movie": {
+    "source": "apache",
+    "extensions": ["movie"]
+  },
+  "video/x-smv": {
+    "source": "apache",
+    "extensions": ["smv"]
+  },
+  "x-conference/x-cooltalk": {
+    "source": "apache",
+    "extensions": ["ice"]
+  },
+  "x-shader/x-fragment": {
+    "compressible": true
+  },
+  "x-shader/x-vertex": {
+    "compressible": true
+  }
+}
diff --git a/node_modules/mime-db/index.js b/node_modules/mime-db/index.js
new file mode 100644
index 0000000..ec2be30
--- /dev/null
+++ b/node_modules/mime-db/index.js
@@ -0,0 +1,12 @@
+/*!
+ * mime-db
+ * Copyright(c) 2014 Jonathan Ong
+ * Copyright(c) 2015-2022 Douglas Christopher Wilson
+ * MIT Licensed
+ */
+
+/**
+ * Module exports.
+ */
+
+module.exports = require('./db.json')
diff --git a/node_modules/mime-db/package.json b/node_modules/mime-db/package.json
new file mode 100644
index 0000000..289a370
--- /dev/null
+++ b/node_modules/mime-db/package.json
@@ -0,0 +1,56 @@
+{
+  "name": "mime-db",
+  "description": "Media Type Database",
+  "version": "1.54.0",
+  "contributors": [
+    "Douglas Christopher Wilson <doug@somethingdoug.com>",
+    "Jonathan Ong <me@jongleberry.com> (http://jongleberry.com)",
+    "Robert Kieffer <robert@broofa.com> (http://github.com/broofa)"
+  ],
+  "license": "MIT",
+  "keywords": [
+    "mime",
+    "db",
+    "type",
+    "types",
+    "database",
+    "charset",
+    "charsets"
+  ],
+  "repository": "jshttp/mime-db",
+  "devDependencies": {
+    "csv-parse": "4.16.3",
+    "eslint": "8.32.0",
+    "eslint-config-standard": "15.0.1",
+    "eslint-plugin-import": "2.27.5",
+    "eslint-plugin-markdown": "3.0.0",
+    "eslint-plugin-node": "11.1.0",
+    "eslint-plugin-promise": "6.1.1",
+    "eslint-plugin-standard": "4.1.0",
+    "media-typer": "1.1.0",
+    "mocha": "10.2.0",
+    "nyc": "15.1.0",
+    "stream-to-array": "2.3.0",
+    "undici": "7.1.0"
+  },
+  "files": [
+    "HISTORY.md",
+    "LICENSE",
+    "README.md",
+    "db.json",
+    "index.js"
+  ],
+  "engines": {
+    "node": ">= 0.6"
+  },
+  "scripts": {
+    "build": "node scripts/build",
+    "fetch": "node scripts/fetch-apache && node scripts/fetch-iana && node scripts/fetch-nginx",
+    "lint": "eslint .",
+    "test": "mocha --reporter spec --check-leaks test/",
+    "test-ci": "nyc --reporter=lcovonly --reporter=text npm test",
+    "test-cov": "nyc --reporter=html --reporter=text npm test",
+    "update": "npm run fetch && npm run build",
+    "version": "node scripts/version-history.js && git add HISTORY.md"
+  }
+}
diff --git a/node_modules/ms/index.js b/node_modules/ms/index.js
new file mode 100644
index 0000000..ea734fb
--- /dev/null
+++ b/node_modules/ms/index.js
@@ -0,0 +1,162 @@
+/**
+ * Helpers.
+ */
+
+var s = 1000;
+var m = s * 60;
+var h = m * 60;
+var d = h * 24;
+var w = d * 7;
+var y = d * 365.25;
+
+/**
+ * Parse or format the given `val`.
+ *
+ * Options:
+ *
+ *  - `long` verbose formatting [false]
+ *
+ * @param {String|Number} val
+ * @param {Object} [options]
+ * @throws {Error} throw an error if val is not a non-empty string or a number
+ * @return {String|Number}
+ * @api public
+ */
+
+module.exports = function (val, options) {
+  options = options || {};
+  var type = typeof val;
+  if (type === 'string' && val.length > 0) {
+    return parse(val);
+  } else if (type === 'number' && isFinite(val)) {
+    return options.long ? fmtLong(val) : fmtShort(val);
+  }
+  throw new Error(
+    'val is not a non-empty string or a valid number. val=' +
+      JSON.stringify(val)
+  );
+};
+
+/**
+ * Parse the given `str` and return milliseconds.
+ *
+ * @param {String} str
+ * @return {Number}
+ * @api private
+ */
+
+function parse(str) {
+  str = String(str);
+  if (str.length > 100) {
+    return;
+  }
+  var match = /^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(
+    str
+  );
+  if (!match) {
+    return;
+  }
+  var n = parseFloat(match[1]);
+  var type = (match[2] || 'ms').toLowerCase();
+  switch (type) {
+    case 'years':
+    case 'year':
+    case 'yrs':
+    case 'yr':
+    case 'y':
+      return n * y;
+    case 'weeks':
+    case 'week':
+    case 'w':
+      return n * w;
+    case 'days':
+    case 'day':
+    case 'd':
+      return n * d;
+    case 'hours':
+    case 'hour':
+    case 'hrs':
+    case 'hr':
+    case 'h':
+      return n * h;
+    case 'minutes':
+    case 'minute':
+    case 'mins':
+    case 'min':
+    case 'm':
+      return n * m;
+    case 'seconds':
+    case 'second':
+    case 'secs':
+    case 'sec':
+    case 's':
+      return n * s;
+    case 'milliseconds':
+    case 'millisecond':
+    case 'msecs':
+    case 'msec':
+    case 'ms':
+      return n;
+    default:
+      return undefined;
+  }
+}
+
+/**
+ * Short format for `ms`.
+ *
+ * @param {Number} ms
+ * @return {String}
+ * @api private
+ */
+
+function fmtShort(ms) {
+  var msAbs = Math.abs(ms);
+  if (msAbs >= d) {
+    return Math.round(ms / d) + 'd';
+  }
+  if (msAbs >= h) {
+    return Math.round(ms / h) + 'h';
+  }
+  if (msAbs >= m) {
+    return Math.round(ms / m) + 'm';
+  }
+  if (msAbs >= s) {
+    return Math.round(ms / s) + 's';
+  }
+  return ms + 'ms';
+}
+
+/**
+ * Long format for `ms`.
+ *
+ * @param {Number} ms
+ * @return {String}
+ * @api private
+ */
+
+function fmtLong(ms) {
+  var msAbs = Math.abs(ms);
+  if (msAbs >= d) {
+    return plural(ms, msAbs, d, 'day');
+  }
+  if (msAbs >= h) {
+    return plural(ms, msAbs, h, 'hour');
+  }
+  if (msAbs >= m) {
+    return plural(ms, msAbs, m, 'minute');
+  }
+  if (msAbs >= s) {
+    return plural(ms, msAbs, s, 'second');
+  }
+  return ms + ' ms';
+}
+
+/**
+ * Pluralization helper.
+ */
+
+function plural(ms, msAbs, n, name) {
+  var isPlural = msAbs >= n * 1.5;
+  return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');
+}
diff --git a/node_modules/ms/license.md b/node_modules/ms/license.md
new file mode 100644
index 0000000..fa5d39b
--- /dev/null
+++ b/node_modules/ms/license.md
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2020 Vercel, Inc.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/ms/package.json b/node_modules/ms/package.json
new file mode 100644
index 0000000..4997189
--- /dev/null
+++ b/node_modules/ms/package.json
@@ -0,0 +1,38 @@
+{
+  "name": "ms",
+  "version": "2.1.3",
+  "description": "Tiny millisecond conversion utility",
+  "repository": "vercel/ms",
+  "main": "./index",
+  "files": [
+    "index.js"
+  ],
+  "scripts": {
+    "precommit": "lint-staged",
+    "lint": "eslint lib/* bin/*",
+    "test": "mocha tests.js"
+  },
+  "eslintConfig": {
+    "extends": "eslint:recommended",
+    "env": {
+      "node": true,
+      "es6": true
+    }
+  },
+  "lint-staged": {
+    "*.js": [
+      "npm run lint",
+      "prettier --single-quote --write",
+      "git add"
+    ]
+  },
+  "license": "MIT",
+  "devDependencies": {
+    "eslint": "4.18.2",
+    "expect.js": "0.3.1",
+    "husky": "0.14.3",
+    "lint-staged": "5.0.0",
+    "mocha": "4.0.1",
+    "prettier": "2.0.5"
+  }
+}
diff --git a/node_modules/ms/readme.md b/node_modules/ms/readme.md
new file mode 100644
index 0000000..0fc1abb
--- /dev/null
+++ b/node_modules/ms/readme.md
@@ -0,0 +1,59 @@
+# ms
+
+![CI](https://github.com/vercel/ms/workflows/CI/badge.svg)
+
+Use this package to easily convert various time formats to milliseconds.
+
+## Examples
+
+```js
+ms('2 days')  // 172800000
+ms('1d')      // 86400000
+ms('10h')     // 36000000
+ms('2.5 hrs') // 9000000
+ms('2h')      // 7200000
+ms('1m')      // 60000
+ms('5s')      // 5000
+ms('1y')      // 31557600000
+ms('100')     // 100
+ms('-3 days') // -259200000
+ms('-1h')     // -3600000
+ms('-200')    // -200
+```
+
+### Convert from Milliseconds
+
+```js
+ms(60000)             // "1m"
+ms(2 * 60000)         // "2m"
+ms(-3 * 60000)        // "-3m"
+ms(ms('10 hours'))    // "10h"
+```
+
+### Time Format Written-Out
+
+```js
+ms(60000, { long: true })             // "1 minute"
+ms(2 * 60000, { long: true })         // "2 minutes"
+ms(-3 * 60000, { long: true })        // "-3 minutes"
+ms(ms('10 hours'), { long: true })    // "10 hours"
+```
+
+## Features
+
+- Works both in [Node.js](https://nodejs.org) and in the browser
+- If a number is supplied to `ms`, a string with a unit is returned
+- If a string that contains the number is supplied, it returns it as a number (e.g.: it returns `100` for `'100'`)
+- If you pass a string with a number and a valid unit, the number of equivalent milliseconds is returned
+
+## Related Packages
+
+- [ms.macro](https://github.com/knpwrs/ms.macro) - Run `ms` as a macro at build-time.
+
+## Caught a Bug?
+
+1. [Fork](https://help.github.com/articles/fork-a-repo/) this repository to your own GitHub account and then [clone](https://help.github.com/articles/cloning-a-repository/) it to your local device
+2. Link the package to the global module directory: `npm link`
+3. Within the module you want to test your local development instance of ms, just link it to the dependencies: `npm link ms`. Instead of the default one from npm, Node.js will now use your clone of ms!
+
+As always, you can run the tests using: `npm test`
diff --git a/node_modules/msgpackr-extract/LICENSE b/node_modules/msgpackr-extract/LICENSE
new file mode 100644
index 0000000..97f48aa
--- /dev/null
+++ b/node_modules/msgpackr-extract/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Kris Zyp
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/msgpackr-extract/README.md b/node_modules/msgpackr-extract/README.md
new file mode 100644
index 0000000..7431f9a
--- /dev/null
+++ b/node_modules/msgpackr-extract/README.md
@@ -0,0 +1,5 @@
+## Summary
+This module is designed to do fast and efficient native/C-level extraction of strings from MessagePack binary data. This works by calling `extractStrings(buffer, start, end)`, and it will extract strings by doing partial MessagePack parsing, and scanning to find the string data in the range specified in the buffer. It will return an array of strings that it finds. When it finds strings that can be represented with latin-1/one-byte strings (and important V8 optimization), it will attempt return a continuous string of MessagePack data that contains multiple sub-strings, so the decoder can slice off strings by offset. When a string contains non-latin characters, and must be represented as a two-byte string, this will always be returned as the string alone without combination with any other strings. The extractor will return an array of a maximum of 256 strings. The decoder can call the extractStrings again, with a new offset to continue extracting more strings as necessary.
+
+## License
+MIT
\ No newline at end of file
diff --git a/node_modules/msgpackr-extract/bin/download-prebuilds.js b/node_modules/msgpackr-extract/bin/download-prebuilds.js
new file mode 100755
index 0000000..06948e9
--- /dev/null
+++ b/node_modules/msgpackr-extract/bin/download-prebuilds.js
@@ -0,0 +1,13 @@
+#!/usr/bin/env node
+
+const { dirname } = require('path');
+const { fileURLToPath } = require('url');
+const { exec } = require('child_process');
+
+process.chdir(dirname(__dirname));
+exec('prebuildify-ci download', (error, stdout, stderr) => {
+	console.error(stderr);
+	console.log(stdout);
+	if (error?.code)
+		process.exit(error.code);
+});
diff --git a/node_modules/msgpackr-extract/binding.gyp b/node_modules/msgpackr-extract/binding.gyp
new file mode 100644
index 0000000..7ff7a52
--- /dev/null
+++ b/node_modules/msgpackr-extract/binding.gyp
@@ -0,0 +1,63 @@
+{
+  "variables": {
+      "os_linux_compiler%": "gcc",
+      "enable_v8%": "true",
+      "enable_pointer_compression%": "false",
+      "build_v8_with_gn": "false"
+  },
+  "conditions": [
+    ['OS=="win"', {
+      "variables": {
+        "enable_v8%": "<!(echo %ENABLE_V8_FUNCTIONS%)",
+      }
+    }],
+    ['OS!="win"', {
+      "variables": {
+        "enable_v8%": "<!(echo $ENABLE_V8_FUNCTIONS)",
+      }
+    }]
+  ],
+  "targets": [
+    {
+      "target_name": "extract",
+      "sources": [
+        "src/extract.cpp",
+      ],
+      "defines": [ "NAPI_DISABLE_CPP_EXCEPTIONS" ],
+      "conditions": [
+        ["OS=='linux'", {
+          "variables": {
+            "gcc_version" : "<!(<(os_linux_compiler) -dumpversion | cut -d '.' -f 1)",
+          },
+          "cflags_cc": [
+            "-fPIC",
+            "-fvisibility=hidden",
+            "-fvisibility-inlines-hidden",
+          ],
+          "conditions": [
+            ["gcc_version>=7", {
+              "cflags": [
+                "-Wimplicit-fallthrough=2",
+              ],
+            }],
+          ],
+          "ldflags": [
+            "-fPIC",
+            "-fvisibility=hidden"
+          ],
+          "cflags": [
+            "-fPIC",
+            "-fvisibility=hidden",
+            "-O3"
+          ],
+        }],
+        ["enable_v8!='false'", {
+          "defines": ["ENABLE_V8_API=1"]
+        }],
+        ["enable_pointer_compression=='true'", {
+          "defines": ["V8_COMPRESS_POINTERS", "V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE"],
+        }],
+      ],
+    }
+  ]
+}
diff --git a/node_modules/msgpackr-extract/index.js b/node_modules/msgpackr-extract/index.js
new file mode 100644
index 0000000..967188a
--- /dev/null
+++ b/node_modules/msgpackr-extract/index.js
@@ -0,0 +1 @@
+module.exports = require('node-gyp-build-optional-packages')(__dirname);
\ No newline at end of file
diff --git a/node_modules/msgpackr-extract/package.json b/node_modules/msgpackr-extract/package.json
new file mode 100644
index 0000000..05a6a09
--- /dev/null
+++ b/node_modules/msgpackr-extract/package.json
@@ -0,0 +1,50 @@
+{
+  "name": "msgpackr-extract",
+  "author": "Kris Zyp",
+  "version": "3.0.4",
+  "description": "Node addon for string extraction for msgpackr",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/kriszyp/msgpackr-extract"
+  },
+  "scripts": {
+    "install": "node-gyp-build-optional-packages",
+    "recompile": "node-gyp rebuild",
+    "before-publish": "prebuildify-ci download && node set-optional-deps.cjs",
+    "prebuild": "prebuildify-platform-packages --target 20.14.0",
+    "prebuild-win32": "prebuildify-platform-packages --target 20.14.0 && set ENABLE_V8_FUNCTIONS=false&& prebuildify-platform-packages --platform-packages --napi --target 20.14.0",
+    "prebuild-libc": "prebuildify-platform-packages --tag-libc --target 20.14.0 && prebuildify-platform-packages --platform-packages --napi --tag-libc --target 22.2.0 && ENABLE_V8_FUNCTIONS=false prebuildify-platform-packages --platform-packages --napi --tag-libc --target 20.14.0",
+    "prebuild-libc-napi": "ENABLE_V8_FUNCTIONS=false prebuildify-platform-packages --platform-packages --napi --tag-libc --target 20.14.0",
+    "prebuild-libc-alpine": "prebuildify-cross --image alpine --tag-libc --target 20.14.0",
+    "publish-all": "cd prebuilds/win32-x64 && (npm publish --access public || true) && cd ../darwin-x64 && (npm publish --access public || true) && cd ../darwin-arm64 && (npm publish --access public || true) && cd ../linux-x64 && (npm publish --access public || true) && cd ../linux-arm64 && (npm publish --access public || true) && cd ../linux-arm && (npm publish --access public || true) && cd ../.. && npm publish --access public",
+    "test": "node ./index.js"
+  },
+  "main": "./index.js",
+  "gypfile": true,
+  "dependencies": {
+    "node-gyp-build-optional-packages": "5.2.2"
+  },
+  "files": [
+    "index.js",
+    "/src",
+    "/*.gyp",
+    "/bin"
+  ],
+  "bin": {
+    "download-msgpackr-prebuilds": "./bin/download-prebuilds.js"
+  },
+  "optionalDependencies": {
+    "@msgpackr-extract/msgpackr-extract-darwin-arm64": "3.0.4",
+    "@msgpackr-extract/msgpackr-extract-darwin-x64": "3.0.4",
+    "@msgpackr-extract/msgpackr-extract-linux-arm": "3.0.4",
+    "@msgpackr-extract/msgpackr-extract-linux-arm64": "3.0.4",
+    "@msgpackr-extract/msgpackr-extract-linux-x64": "3.0.4",
+    "@msgpackr-extract/msgpackr-extract-win32-x64": "3.0.4"
+  },
+  "devDependencies": {
+    "prebuildify-platform-packages": "5.0.4",
+    "prebuildify-ci": "^1.0.5",
+    "prebuildify-cross": "5.0.0"
+  }
+}
\ No newline at end of file
diff --git a/node_modules/msgpackr-extract/src/extract.cpp b/node_modules/msgpackr-extract/src/extract.cpp
new file mode 100644
index 0000000..1ee5b78
--- /dev/null
+++ b/node_modules/msgpackr-extract/src/extract.cpp
@@ -0,0 +1,278 @@
+/*
+This is responsible for extracting the strings, in bulk, from a MessagePack buffer. Creating strings from buffers can
+be one of the biggest performance bottlenecks of parsing, but creating an array of extracting strings all at once
+provides much better performance. This will parse and produce up to 256 strings at once .The JS parser can call this multiple
+times as necessary to get more strings. This must be partially capable of parsing MessagePack so it can know where to
+find the string tokens and determine their position and length. All strings are decoded as UTF-8.
+*/
+#include <node_api.h>
+#if ENABLE_V8_API
+#include <v8.h>
+#endif
+
+#ifndef thread_local
+#ifdef __GNUC__
+# define thread_local __thread
+#elif __STDC_VERSION__ >= 201112L
+# define thread_local _Thread_local
+#elif defined(_MSC_VER)
+# define thread_local __declspec(thread)
+#else
+# define thread_local
+#endif
+#endif
+
+const int MAX_TARGET_SIZE = 255;
+const uint32_t UNEXPECTED_END = 0xffffffff;
+typedef uint32_t (*token_handler)(uint8_t* source, uint32_t position, uint32_t size);
+token_handler tokenTable[256] = {};
+napi_value unexpectedEnd(napi_env env) {
+	napi_value returnValue;
+	napi_get_undefined(env, &returnValue);
+	napi_throw_type_error(env, NULL, "Unexpected end of buffer reading string");
+	return returnValue;
+}
+
+class Extractor {
+public:
+	// napi_ref targetArray; // could consider reenabling this optimization for napi
+	bool hasTargetArray = false;
+	uint8_t* source;
+	uint32_t position = 0;
+	uint32_t writePosition = 0;
+	uint32_t stringStart = 0;
+	uint32_t lastStringEnd = 0;
+
+	void readString(napi_env env, uint32_t length, bool allowStringBlocks, napi_value* target) {
+		uint32_t start = position;
+		uint32_t end = position + length;
+		if (allowStringBlocks) { // for larger strings, we don't bother to check every character for being latin, and just go right to creating a new string
+			while(position < end) {
+				if (source[position] < 0x80) // ensure we character is latin and can be decoded as one byte
+					position++;
+				else {
+					break;
+				}
+			}
+		}
+		if (position < end) {
+			// non-latin character
+			if (lastStringEnd) {
+				napi_value value;
+				napi_create_string_latin1(env, (const char*) source + stringStart, lastStringEnd - stringStart, &value);
+				target[writePosition++] = value;
+				lastStringEnd = 0;
+			}
+			// use standard utf-8 conversion
+			napi_value value;
+			napi_create_string_utf8(env, (const char*) source + start, (int) length, &value);
+			target[writePosition++] = value;
+			position = end;
+			return;
+		}
+
+		if (lastStringEnd) {
+			if (start - lastStringEnd > 40 || end - stringStart > 6000) {
+				napi_value value;
+				napi_create_string_latin1(env, (const char*) source + stringStart, lastStringEnd - stringStart, &value);
+				target[writePosition++] = value;
+				stringStart = start;
+			}
+		} else {
+			stringStart = start;
+		}
+		lastStringEnd = end;
+	}
+
+	napi_value extractStrings(napi_env env, uint32_t startingPosition, uint32_t size, uint8_t* inputSource) {
+		napi_value target[MAX_TARGET_SIZE + 1]; // leave one for the queued string
+		writePosition = 0;
+		lastStringEnd = 0;
+		position = startingPosition;
+		source = inputSource;
+		while (position < size) {
+			uint8_t token = source[position++];
+			if (token < 0xa0) {
+				// all one byte tokens
+			} else if (token < 0xc0) {
+				// fixstr, we want to convert this
+				token -= 0xa0;
+				if (token + position > size) {
+					return unexpectedEnd(env);
+				}
+				readString(env, token, true, target);
+				if (writePosition >= MAX_TARGET_SIZE)
+					break;
+			} else if (token <= 0xdb && token >= 0xd9) {
+				if (token == 0xd9) { //str 8
+					if (position >= size) {
+						return unexpectedEnd(env);
+					}
+					uint32_t length = source[position++];
+					if (length + position > size) {
+						return unexpectedEnd(env);
+					}
+					readString(env,length, true, target);
+				} else if (token == 0xda) { //str 16
+					if (2 + position > size) {
+						return unexpectedEnd(env);
+					}
+					uint32_t length = source[position++] << 8;
+					length += source[position++];
+					if (length + position > size) {
+						return unexpectedEnd(env);
+					}
+					readString(env,length, false, target);
+				} else { //str 32
+					if (4 + position > size) {
+						return unexpectedEnd(env);
+					}
+					uint32_t length = source[position++] << 24;
+					length += source[position++] << 16;
+					length += source[position++] << 8;
+					length += source[position++];
+					if (length > size - position) {
+						return unexpectedEnd(env);
+					}
+					readString(env, length, false, target);
+				}
+				if (writePosition >= MAX_TARGET_SIZE)
+					break;
+			} else {
+				auto handle = tokenTable[token];
+				if ((size_t ) handle < 20) {
+					position += (size_t ) handle;
+				} else {
+					position = tokenTable[token](source, position, size);
+					if (position == UNEXPECTED_END) {
+						return unexpectedEnd(env);
+					}
+				}
+			}
+		}
+
+		if (lastStringEnd) {
+			napi_value value;
+			napi_create_string_latin1(env, (const char*) source + stringStart, lastStringEnd - stringStart, &value);
+			if (writePosition == 0) {
+				return value;
+			}
+			target[writePosition++] = value;
+		} else if (writePosition == 1) {
+			return target[0];
+		}
+		napi_value array;
+		#if ENABLE_V8_API
+		v8::Local<v8::Array> v8Array = v8::Array::New(v8::Isolate::GetCurrent(), (v8::Local<v8::Value>*) target, writePosition);
+		memcpy(&array, &v8Array, sizeof(array));
+		#else
+		napi_create_array_with_length(env, writePosition, &array);
+		for (uint32_t i = 0; i < writePosition; i++) {
+			napi_set_element(env, array, i, target[i]);
+		}
+		#endif
+		return array;
+	}
+};
+
+void setupTokenTable() {
+	for (int i = 0; i < 256; i++) {
+		tokenTable[i] = nullptr;
+	}
+	// uint8, int8
+	tokenTable[0xcc] = tokenTable[0xd0] = (token_handler) 1;
+	// uint16, int16, array 16, map 16, fixext 1
+	tokenTable[0xcd] = tokenTable[0xd1] = tokenTable[0xdc] = tokenTable[0xde] = tokenTable[0xd4] = (token_handler) 2;
+	// fixext 16
+	tokenTable[0xd5] = (token_handler) 3;
+	// uint32, int32, float32, array 32, map 32
+	tokenTable[0xce] = tokenTable[0xd2] = tokenTable[0xca] = tokenTable[0xdd] = tokenTable[0xdf] = (token_handler) 4;
+	// fixext 4
+	tokenTable[0xd6] = (token_handler) 5;
+	// uint64, int64, float64, fixext 8
+	tokenTable[0xcf] = tokenTable[0xd3] = tokenTable[0xcb] = (token_handler) 8;
+	// fixext 8
+	tokenTable[0xd7] = (token_handler) 9;
+	// fixext 16
+	tokenTable[0xd8] = (token_handler) 17;
+	// bin 8
+	tokenTable[0xc4] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position >= size) {
+			return UNEXPECTED_END;
+		}
+		uint32_t length = source[position++];
+		return position + length;
+	});
+	// bin 16
+	tokenTable[0xc5] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position + 2 > size) {
+			return UNEXPECTED_END;
+		}
+		uint32_t length = source[position++] << 8;
+		length += source[position++];
+		return position + length;
+	});
+	// bin 32
+	tokenTable[0xc6] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position + 4 > size)
+			return UNEXPECTED_END;
+		uint32_t length = source[position++] << 24;
+		length += source[position++] << 16;
+		length += source[position++] << 8;
+		length += source[position++];
+		if (length > size - position)
+			return UNEXPECTED_END;
+		return position + length;
+	});
+	// ext 8
+	tokenTable[0xc7] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position >= size)
+			return UNEXPECTED_END;
+		uint32_t length = source[position++];
+		position++;
+		return position + length;
+	});
+	// ext 16
+	tokenTable[0xc8] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position + 2 > size)
+			return UNEXPECTED_END;
+		uint32_t length = source[position++] << 8;
+		length += source[position++];
+		position++;
+		return position + length;
+	});
+	// ext 32
+	tokenTable[0xc9] = ([](uint8_t* source, uint32_t position, uint32_t size) -> uint32_t {
+		if (position + 4 > size)
+			return UNEXPECTED_END;
+		uint32_t length = source[position++] << 24;
+		length += source[position++] << 16;
+		length += source[position++] << 8;
+		length += source[position++];
+		if (length >= size - position)
+			return UNEXPECTED_END;
+		position++;
+		return position + length;
+	});
+}
+static thread_local Extractor* extractor;
+napi_value extractStrings(napi_env env, napi_callback_info info) {
+	size_t argc = 3;
+	napi_value args[3];
+	napi_get_cb_info(env, info, &argc, args, NULL, NULL);
+	uint32_t position;
+	uint32_t size;
+	napi_get_value_uint32(env, args[0], &position);
+	napi_get_value_uint32(env, args[1], &size);
+	uint8_t* source;
+	size_t buffer_size;
+	napi_get_arraybuffer_info(env, args[2], (void**) &source, &buffer_size);
+	return extractor->extractStrings(env, position, size, source);
+}
+#define EXPORT_NAPI_FUNCTION(name, func) { napi_property_descriptor desc = { name, 0, func, 0, 0, 0, (napi_property_attributes) (napi_writable | napi_configurable), 0 }; napi_define_properties(env, exports, 1, &desc); }
+NAPI_MODULE_INIT() {
+	extractor = new Extractor(); // create our thread-local extractor
+	setupTokenTable();
+	EXPORT_NAPI_FUNCTION("extractStrings", extractStrings);
+	return exports;
+}
diff --git a/node_modules/msgpackr/LICENSE b/node_modules/msgpackr/LICENSE
new file mode 100644
index 0000000..97f48aa
--- /dev/null
+++ b/node_modules/msgpackr/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2020 Kris Zyp
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/msgpackr/README.md b/node_modules/msgpackr/README.md
new file mode 100644
index 0000000..ddf302c
--- /dev/null
+++ b/node_modules/msgpackr/README.md
@@ -0,0 +1,386 @@
+# msgpackr
+[![npm version](https://img.shields.io/npm/v/msgpackr.svg?style=flat-square)](https://www.npmjs.org/package/msgpackr)
+[![npm version](https://img.shields.io/npm/dw/msgpackr)](https://www.npmjs.org/package/msgpackr)
+[![encode](https://img.shields.io/badge/encode-1.5GB%2Fs-yellow)](benchmark.md)
+[![decode](https://img.shields.io/badge/decode-2GB%2Fs-yellow)](benchmark.md)
+[![types](https://img.shields.io/npm/types/msgpackr)](README.md)
+[![module](https://img.shields.io/badge/module-ESM%2FCJS-blue)](README.md)
+[![license](https://img.shields.io/badge/license-MIT-brightgreen)](LICENSE)
+
+The msgpackr package is an extremely fast MessagePack NodeJS/JavaScript implementation. Currently, it is significantly faster than any other known implementations, faster than Avro (for JS), and generally faster than native V8 JSON.stringify/parse, on NodeJS. It also includes an optional record extension (the `r` in msgpackr), for defining record structures that makes MessagePack even faster and more compact, often over twice as fast as even native JSON functions, several times faster than other JS implementations, and 15-50% more compact. See the performance section for more details. Structured cloning (with support for cyclical references) is also supported through optional extensions.
+
+## Basic Usage
+
+Install with:
+
+```
+npm i msgpackr
+```
+And `import` or `require` it for basic standard serialization/encoding (`pack`) and deserialization/decoding (`unpack`) functions:
+```js
+import { unpack, pack } from 'msgpackr';
+let serializedAsBuffer = pack(value);
+let data = unpack(serializedAsBuffer);
+```
+This `pack` function will generate standard MessagePack without any extensions that should be compatible with any standard MessagePack parser/decoder. It will serialize JavaScript objects as MessagePack `map`s by default. The `unpack` function will deserialize MessagePack `map`s as an `Object` with the properties from the map.
+
+## Node Usage
+The msgpackr package runs on any modern JS platform, but is optimized for NodeJS usage (and will use a node addon for performance boost as an optional dependency).
+
+### Streams
+We can use the including streaming functionality (which further improves performance). The `PackrStream` is a NodeJS transform stream that can be used to serialize objects to a binary stream (writing to network/socket, IPC, etc.), and the `UnpackrStream` can be used to deserialize objects from a binary sream (reading from network/socket, etc.):
+
+```js
+import { PackrStream } from 'msgpackr';
+let stream = new PackrStream();
+stream.write(myData);
+
+```
+Or for a full example of sending and receiving data on a stream:
+```js
+import { PackrStream, UnpackrStream } from 'msgpackr';
+let sendingStream = new PackrStream();
+let receivingStream = new UnpackrStream();
+// we are just piping to our own stream, but normally you would send and
+// receive over some type of inter-process or network connection.
+sendingStream.pipe(receivingStream);
+sendingStream.write(myData);
+receivingStream.on('data', (data) => {
+	// received data
+});
+```
+The `PackrStream` and `UnpackrStream` instances  will have also the record structure extension enabled by default (see below).
+
+## Deno and Bun Usage
+Msgpackr modules are standard ESM modules and can be loaded directly from the [deno.land registry for msgpackr](https://deno.land/x/msgpackr) for use in Deno or using the NPM module loader with `import { unpack } from 'npm:msgpackr'`. The standard pack/encode and unpack/decode functionality is available on Deno, like other platforms. msgpackr can be used like any other package on Bun.
+
+## Browser Usage
+Msgpackr works as standalone JavaScript as well, and runs on modern browsers. It includes a bundled script, at `dist/index.js` for ease of direct loading:
+```html
+<script src="node_modules/msgpackr/dist/index.js"></script>
+```
+
+This is UMD based, and will register as a module if possible, or create a `msgpackr` global with all the exported functions.
+
+For module-based development, it is recommended that you directly import the module of interest, to minimize dependencies that get pulled into your application:
+```js
+import { unpack } from 'msgpackr/unpack' // if you only need to unpack
+```
+
+The package also includes a minified bundle in index.min.js. 
+Additionally, the package includes a version that excludes dynamic code evaluation called index-no-eval.js, for situations where Content Security Policy (CSP) forbids eval/Function in code. The dynamic evaluation provides important performance optimizations (for records), so is not recommended unless required by CSP policy.
+
+## Structured Cloning
+You can also use msgpackr for [structured cloning](https://html.spec.whatwg.org/multipage/structured-data.html). By enabling the `structuredClone` option, you can include references to other objects or cyclic references, and object identity will be preserved. Structured cloning also enables preserving certain typed objects like `Error`, `Set`, `RegExp` and TypedArray instances. For example:
+```js
+let obj = {
+	set: new Set(['a', 'b']),
+	regular: /a\spattern/
+};
+obj.self = obj;
+let packr = new Packr({ structuredClone: true });
+let serialized = packr.pack(obj);
+let copy = packr.unpack(serialized);
+copy.self === copy // true
+copy.set.has('a') // true
+
+```
+
+This option is disabled by default because it uses extensions and reference checking degrades performance (by about 25-30%). (Note this implementation doesn't serialize every class/type specified in the HTML specification since not all of them make sense for storing across platforms.)
+
+### Alternate Terminology
+If you prefer to use encoder/decode terminology, msgpackr exports aliases, so `decode` is equivalent to `unpack`, `encode` is `pack`, `Encoder` is `Packr`, `Decoder` is `Unpackr`, and `EncoderStream` and `DecoderStream` can be used as well.
+
+## Record / Object Structures
+There is a critical difference between maps (or dictionaries) that hold an arbitrary set of keys and values (JavaScript `Map` is designed for these), and records or object structures that have a well-defined set of fields. Typical JS objects/records may have many instances re(use) the same structure. By using the record extension, this distinction is preserved in MessagePack and the encoding can reuse structures and not only provides better type preservation, but yield much more compact encodings and increase decoding performance by 2-3x. Msgpackr automatically generates record definitions that are reused and referenced by objects with the same structure. There are a number of ways to use this to our advantage. For large object structures with repeating nested objects with similar structures, simply serializing with the record extension can yield significant benefits. To use the record structures extension, we create a new `Packr` instance. By default a new `Packr` instance will have the record extension enabled:
+```js
+import { Packr } from 'msgpackr';
+let packr = new Packr();
+packr.pack(bigDataWithLotsOfObjects);
+
+```
+
+Another way to further leverage the benefits of the msgpackr record structures is to use streams that naturally allow for data to reuse based on previous record structures. The stream classes have the record structure extension enabled by default and provide excellent out-of-the-box performance.
+
+When creating a new `Packr`, `Unpackr`, `PackrStream`, or `UnpackrStream` instance, we can enable or disable the record structure extension with the `useRecords` property. When this is `false`, the record structure extension will be disabled (standard/compatibility mode), and all objects will revert to being serialized using MessagePack `map`s, and all `map`s will be deserialized to JS `Object`s as properties (like the standalone `pack` and `unpack` functions).
+
+Streaming with record structures works by encoding a structure the first time it is seen in a stream and referencing the structure in later messages that are sent across that stream. When an encoder can expect a decoder to understand previous structure references, this can be configured using the `sequential: true` flag, which is auto-enabled by streams, but can also be used with Packr instances.
+
+### Shared Record Structures
+Another useful way of using msgpackr, and the record extension, is for storing data in a databases, files, or other storage systems. If a number of objects with common data structures are being stored, a shared structure can be used to greatly improve data storage and deserialization efficiency. In the simplest form, provide a `structures` array, which is updated if any new object structure is encountered:
+```js
+import { Packr } from 'msgpackr';
+let packr = new Packr({
+	structures: [... structures that were last generated ...]
+});
+```
+If you are working with persisted data, you will need to persist the `structures` data when it is updated. Msgpackr provides an API for loading and saving the `structures` on demand (which is robust and can be used in multiple-process situations where other processes may be updating this same `structures` array), we just need to provide a way to store the generated shared structure so it is available to deserialize stored data in the future:
+```js
+import { Packr } from 'msgpackr';
+let packr = new Packr({
+	getStructures() {
+		// storing our data in file (but we could also store in a db or key-value store)
+		return unpack(readFileSync('my-shared-structures.mp')) || [];
+	},
+	saveStructures(structures) {
+		writeFileSync('my-shared-structures.mp', pack(structures));
+	}
+});
+```
+Msgpackr will automatically add and saves structures as it encounters any new object structures (up to a limit of 32, by default). It will always add structures in an incremental/compatible way: Any object encoded with an earlier structure can be decoded with a later version (as long as it is persisted).
+
+#### Shared Structures Options
+By default there is a limit of 32 shared structures. This default is designed to record common shared structures, but also be resilient against sharing too many structures if there are many objects with dynamic properties that are likely to be repeated. This also allows for slightly more efficient one byte encoding. However, if your application has more structures that are commonly repeated, you can increase this limit by setting `maxSharedStructures` to a higher value. The maximum supported shared structures is 8160.
+
+You can also provide a `shouldShareStructure` function in the options if you want to specifically indicate which structures should be shared. This is called during the encoding process with the array of keys for a structure that is being considered for addition to the shared structure. For example, you might want:
+```
+	maxSharedStructures: 100,
+	shouldShareStructure(keys) {
+		return !(keys[0] > 1) // don't share structures that consist of numbers as keys
+	}
+```
+
+### Reading Multiple Values
+If you have a buffer with multiple values sequentially encoded, you can choose to parse and read multiple values. This can be done using the `unpackMultiple` function/method, which can return an array of all the values it can sequentially parse within the provided buffer. For example:
+```js
+let data = new Uint8Array([1, 2, 3]) // encodings of values 1, 2, and 3
+let values = unpackMultiple(data) // [1, 2, 3]
+```
+Alternately, you can provide a callback function that is called as the parsing occurs with each value, and can optionally terminate the parsing by returning `false`:
+```js
+let data = new Uint8Array([1, 2, 3]) // encodings of values 1, 2, and 3
+unpackMultiple(data, (value) => {
+	// called for each value
+	// return false if you wish to end the parsing
+})
+```
+
+If you need to know the start and end offsets of the unpacked values, these are
+provided as optional parameters in the callback:
+```js
+let data = new Uint8Array([1, 2, 3]) // encodings of values 1, 2, and 3
+unpackMultiple(data, (value,start,end) => {
+	// called for each value
+	// `start` is the data buffer offset where the value was read from
+	// `end` is `start` plus the byte length of the encoded value
+	// return false if you wish to end the parsing
+})
+```
+
+## Options
+The following options properties can be provided to the Packr or Unpackr constructor:
+
+* `useRecords` - Setting this to `false` disables the record extension and stores JavaScript objects as MessagePack maps, and unpacks maps as JavaScript `Object`s, which ensures compatibilty with other decoders. Setting this to a function will use records for objects where `useRecords(object)` returns `true`.
+* `structures` - Provides the array of structures that is to be used for record extension, if you want the structures saved and used again. This array will be modified in place with new record structures that are serialized (if less than 32 structures are in the array).
+* `moreTypes` - Enable serialization of additional built-in types/classes including typed arrays, `Set`s, `Map`s, and `Error`s.
+* `structuredClone` - This enables the structured cloning extensions that will encode object/cyclic references. `moreTypes` is enabled by default when this is enabled.
+* `mapsAsObjects` - If `true`, this will decode MessagePack maps and JS `Object`s with the map entries decoded to object properties. If `false`, maps are decoded as JavaScript `Map`s. This is disabled by default if `useRecords` is enabled (which allows `Map`s to be preserved), and is enabled by default if `useRecords` is disabled.
+* `useFloat32` - This will enable msgpackr to encode non-integer numbers as `float32`. See next section for possible values.
+* `variableMapSize` - This will use varying map size definition (fixmap, map16, map32) based on the number of keys when encoding objects, which yields slightly more compact encodings (for small objects), but is typically 5-10% slower during encoding. This is necessary if you need to use objects with more than 65535 keys. This is only relevant when record extension is disabled.
+* `bundleStrings` - If `true` this uses a custom extension that bundles strings together, so that they can be decoded more quickly on browsers and Deno that do not have access to the NodeJS addon. This a custom extension, so both encoder and decoder need to support this. This can yield significant decoding performance increases on browsers (30%-50%).
+* `copyBuffers` - When decoding a MessagePack with binary data (Buffers are encoded as binary data), copy the buffer rather than providing a slice/view of the buffer. If you want your input data to be collected or modified while the decoded embedded buffer continues to live on, you can use this option (there is extra overhead to copying).
+* `useTimestamp32` - Encode JS `Date`s in 32-bit format when possible by dropping the milliseconds. This is a more efficient encoding of dates. You can also cause dates to use 32-bit format by manually setting the milliseconds to zero (`date.setMilliseconds(0)`).
+* `sequential` - Encode structures in serialized data, and reference previously encoded structures with expectation that decoder will read the encoded structures in the same order as encoded, with `unpackMultiple`.
+* `largeBigIntToFloat` - If a bigint needs to be encoded that is larger than will fit in 64-bit integers, it will be encoded as a float-64 (otherwise will throw a RangeError).
+* `largeBigIntToString` - If a bigint needs to be encoded that is larger than will fit in 64-bit integers, it will be encoded as a string (otherwise will throw a RangeError).
+* `useBigIntExtension` - If a bigint needs to be encoded that is larger than will fit in 64-bit integers, it will be encoded using a custom extension that supports up to about 1000-bits of integer precision.
+* `encodeUndefinedAsNil` - Encodes a value of `undefined` as a MessagePack `nil`, the same as a `null`.
+* `int64AsType` - This will decode uint64 and int64 numbers as the specified type. The type can be `bigint` (default), `number`,  `string`, or `auto` (where range [-2^53...2^53] is represented by number and everything else by a bigint).
+* `skipValues` - This can be an array of property values that will indicate properties that should be skipped when serializing objects. For example, to mimic `JSON.stringify`'s behavior of skipping properties with a value of `undefined`, you can provide `skipValues: [undefined]`. Note, that this will only apply to serializing objects as standard MessagePack maps, not to records. Also, the array is checked by calling the `include` method, so you can provide an object with an `includes` if you want a custom function to skip values. 
+* `onInvalidDate` - This can be provided as function that will be called when an invalid date is provided. The function can throw an error, or return a value that will be encoded in place of the invalid date. If not provided, an invalid date will be encoded as an invalid timestamp (which decodes with msgpackr back to an invalid date).
+* `writeFunction` - This can be provided as function that will be called when a function is encountered. The function can throw an error, or return a value that will be encoded in place of the function. If not provided, a function will be encoded as undefined (similar to `JSON.stringify`).
+* `mapAsEmptyObject` - Encodes JS `Map`s as empty objects (for back-compat with older libraries).
+* `setAsEmptyObject` - Encodes JS `Set`s as empty objects (for back-compat with older libraries).
+* `allowArraysInMapKeys` - Allows arrays to be used as keys in Maps, as long as all elements are strings, numbers, booleans, or bigints. When enabled, such arrays are flattened and converted to a string representation.
+
+### 32-bit Float Options
+By default all non-integer numbers are serialized as 64-bit float (double). This is fast, and ensures maximum precision. However, often real-world data doesn't not need 64-bits of precision, and using 32-bit encoding can be much more space efficient. There are several options that provide more efficient encodings. Using the decimal rounding options for encoding and decoding provides lossless storage of common decimal representations like 7.99, in more efficient 32-bit format (rather than 64-bit). The `useFloat32` property has several possible options, available from the module as constants:
+```js
+import { FLOAT32_OPTIONS } from 'msgpackr';
+const { ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;
+```
+
+* `ALWAYS` (1) - Always will encode non-integers (absolute less than 2147483648) as 32-bit float.
+* `DECIMAL_ROUND` (3) - Always will encode non-integers as 32-bit float, and when decoding 32-bit float, round to the significant decimal digits (usually 7, but 6 or 8 digits for some ranges).
+* `DECIMAL_FIT` (4) - Only encode non-integers as 32-bit float if all significant digits (usually up to 7) can be unambiguously encoded as a 32-bit float, and decode/unpack with decimal rounding (same as above). This will ensure round-trip encoding/decoding without loss in precision and uses 32-bit when possible.
+
+Note, that the performance is decreased with decimal rounding by about 20-25%, although if only 5% of your values are floating point, that will only have about a 1% impact overall.
+
+In addition, msgpackr exports a `roundFloat32(number)` function that can be used to round floating point numbers to the maximum significant decimal digits that can be stored in 32-bit float, just as DECIMAL_ROUND does when decoding. This can be useful for determining how a number will be decoded prior to encoding it.
+
+## Performance
+### Native Acceleration
+Msgpackr employs an optional native node-addon to accelerate the parsing of strings. This should be automatically installed and utilized on NodeJS. However, you can verify this by checking the `isNativeAccelerationEnabled` property that is exported from msgpackr. If this is `false`, the `msgpackr-extract` package may not have been properly installed, and you may want to verify that it is installed correctly:
+```js
+import { isNativeAccelerationEnabled } from 'msgpackr'
+if (!isNativeAccelerationEnabled)
+	console.warn('Native acceleration not enabled, verify that install finished properly')
+```
+
+### Benchmarks
+Msgpackr is fast. Really fast. Here is comparison with the next fastest JS projects using the benchmark tool from `msgpack-lite` (and the sample data is from some clinical research data we use that has a good mix of different value types and structures). It also includes comparison to V8 native JSON functionality, and JavaScript Avro (`avsc`, a very optimized Avro implementation):
+
+operation                                                  |   op   |   ms  |  op/s
+---------------------------------------------------------- | ------: | ----: | -----:
+buf = Buffer(JSON.stringify(obj));                         |   81600 |  5002 |  16313
+obj = JSON.parse(buf);                                     |   90700 |  5004 |  18125
+require("msgpackr").pack(obj);                             |  169700 |  5000 |  33940
+require("msgpackr").unpack(buf);                           |  109700 |  5003 |  21926
+msgpackr w/ shared structures: packr.pack(obj);            |  190400 |  5001 |  38072
+msgpackr w/ shared structures: packr.unpack(buf);          |  422900 |  5000 |  84580
+buf = require("msgpack-lite").encode(obj);                 |   31300 |  5005 |   6253
+obj = require("msgpack-lite").decode(buf);                 |   15700 |  5007 |   3135
+buf = require("@msgpack/msgpack").encode(obj);             |  103100 |  5003 |  20607
+obj = require("@msgpack/msgpack").decode(buf);             |   59100 |  5004 |  11810
+buf = require("notepack").encode(obj);                     |   65500 |  5007 |  13081
+obj = require("notepack").decode(buf);                     |   33400 |  5009 |   6667
+obj = require("msgpack-unpack").decode(buf);               |    6900 |  5036 |   1370
+require("avsc")...make schema/type...type.toBuffer(obj);   |   89300 |  5005 |  17842
+require("avsc")...make schema/type...type.fromBuffer(obj); |  108400 |  5001 |  21675
+
+All benchmarks were performed on Node 15 / V8 8.6 (Windows i7-4770 3.4Ghz).
+(`avsc` is schema-based and more comparable in style to msgpackr with shared structures).
+
+Here is a benchmark of streaming data (again borrowed from `msgpack-lite`'s benchmarking), where msgpackr is able to take advantage of the structured record extension and really demonstrate its performance capabilities:
+
+operation (1000000 x 2)                          |   op    |  ms   |  op/s
+------------------------------------------------ | ------: | ----: | -----:
+new PackrStream().write(obj);                    | 1000000 |   372 | 2688172
+new UnpackrStream().write(buf);                  | 1000000 |   247 | 4048582
+stream.write(msgpack.encode(obj));               | 1000000 |  2898 | 345065
+stream.write(msgpack.decode(buf));               | 1000000 |  1969 | 507872
+stream.write(notepack.encode(obj));              | 1000000 |   901 | 1109877
+stream.write(notepack.decode(buf));              | 1000000 |  1012 | 988142
+msgpack.Encoder().on("data",ondata).encode(obj); | 1000000 |  1763 | 567214
+msgpack.createDecodeStream().write(buf);         | 1000000 |  2222 | 450045
+msgpack.createEncodeStream().write(obj);         | 1000000 |  1577 | 634115
+msgpack.Decoder().on("data",ondata).decode(buf); | 1000000 |  2246 | 445235
+
+See the [benchmark.md](benchmark.md) for more benchmarks and information about benchmarking.
+
+## Custom Extensions
+You can add your own custom extensions, which can be used to encode specific types/classes in certain ways. This is done by using the `addExtension` function, and specifying the class, extension `type` code (should be a number from 1-100, reserving negatives for MessagePack, 101-127 for msgpackr), and your `pack` and `unpack` functions (or just the one you need).
+```js
+import { addExtension, Packr } from 'msgpackr';
+
+class MyCustomClass {...}
+
+let extPackr = new Packr();
+addExtension({
+	Class: MyCustomClass,
+	type: 11, // register your own extension code (a type code from 1-100)
+	pack(instance) {
+		// define how your custom class should be encoded
+		return Buffer.from([instance.myData]); // return a buffer
+	},
+	unpack(buffer) {
+		// define how your custom class should be decoded
+		let instance = new MyCustomClass();
+		instance.myData = buffer[0];
+		return instance; // decoded value from buffer
+	}
+});
+```
+If you want to use msgpackr to encode and decode the data within your extensions, you can use the `read` and `write` functions and read and write data/objects that will be encoded and decoded by msgpackr, which can be easier and faster than creating and receiving separate buffers:
+
+```js
+import { addExtension, Packr } from 'msgpackr';
+
+class MyCustomClass {...}
+
+let extPackr = new Packr();
+addExtension({
+	Class: MyCustomClass,
+	type: 11, // register your own extension code (a type code from 1-100)
+	write(instance) {
+		// define how your custom class should be encoded
+		return instance.myData; // return some data to be encoded
+	}
+	read(data) {
+		// define how your custom class should be decoded,
+		// data will already be unpacked/decoded
+		let instance = new MyCustomClass();
+		instance.myData = data;
+		return instance; // return decoded value
+	}
+});
+```
+Note that you can just return the same object from `write`, and in this case msgpackr will encode it using the default object/array encoding:
+```js
+addExtension({
+	Class: MyCustomClass,
+	type: 12,
+	read: function(data) {
+		Object.setPrototypeOf(data, MyCustomClass.prototype)
+		return data
+	},
+	write: function(data) {
+		return data
+	}
+})
+```
+You can also create an extension with `Class` and `write` methods, but no `type` (or `read`), if you just want to customize how a class is serialized without using MessagePack extension encoding.
+
+### Additional Performance Optimizations
+Msgpackr is already fast, but here are some tips for making it faster:
+
+#### Buffer Reuse
+Msgpackr is designed to work well with reusable buffers. Allocating new buffers can be relatively expensive, so if you have Node addons, it can be much faster to reuse buffers and use memcpy to copy data into existing buffers. Then msgpackr `unpack` can be executed on the same buffer, with new data, and optionally take a second paramter indicating the effective size of the available data in the buffer.
+
+#### Arena Allocation (`useBuffer()`)
+During the serialization process, data is written to buffers. Again, allocating new buffers is a relatively expensive process, and the `useBuffer` method can help allow reuse of buffers that will further improve performance. With `useBuffer` method, you can provide a buffer, serialize data into it, and when it is known that you are done using that buffer, you can call `useBuffer` again to reuse it. The use of `useBuffer` is never required, buffers will still be handled and cleaned up through GC if not used, it just provides a small performance boost.
+
+## Record Structure Extension Definition
+The record struction extension uses extension id 0x72 ("r") to declare the use of this functionality. The extension "data" byte (or bytes) identifies the byte or bytes used to identify the start of a record in the subsequent MessagePack block or stream. The identifier byte (or the first byte in a sequence) must be from 0x40 - 0x7f (and therefore replaces one byte representations of positive integers 64 - 127, which can alternately be represented with int or uint types). The extension declaration must be immediately follow by an MessagePack array that defines the field names of the record structure.
+
+Once a record identifier and record field names have been defined, the parser/decoder should proceed to read the next value. Any subsequent use of the record identifier as a value in the block or stream should parsed as a record instance, and the next n values, where is n is the number of fields (as defined in the array of field names), should be read as the values of the fields. For example, here we have defined a structure with fields "foo" and "bar", with the record identifier 0x40, and then read a record instance that defines the field values of 4 and 2, respectively:
+```
++--------+--------+--------+~~~~~~~~~~~~~~~~~~~~~~~~~+--------+--------+
+|  0xd4  |  0x72  |  0x40  | array: [ "foo", "bar" ] |  0x04  |  0x02  |
++--------+--------+--------+~~~~~~~~~~~~~~~~~~~~~~~~~+--------+--------+
+```
+Which should generate an object that would correspond to JSON:
+```js
+{ "foo": 4, "bar": 2}
+```
+
+## Additional value types
+msgpackr supports `undefined` (using fixext1 + type: 0 + data: 0 to match other JS implementations), `NaN`, `Infinity`, and `-Infinity` (using standard IEEE 754 representations with doubles/floats).
+
+### Dates
+msgpackr saves all JavaScript `Date`s using the standard MessagePack date extension (type -1), using the smallest of 32-bit, 64-bit or 96-bit format needed to store the date without data loss (or using 32-bit if useTimestamp32 options is specified).
+
+### Structured Cloning
+With structured cloning enabled, msgpackr will also use extensions to store Set, Map, Error, RegExp, ArrayBufferView objects and preserve their types.
+
+## Upgrading to 2.0
+
+msgpackr 2.0 removes the `randomAccessStructure` option and the internal `struct.js` module that implemented random-access struct encoding. This feature was previously undocumented and intended for internal use.
+
+If you were using `randomAccessStructure: true`, the functionality is now available as the standalone [`structon`](https://github.com/HarperFast/structon) package. Structon provides the same random-access encoding with a more explicit API:
+
+```js
+import { Packr } from 'msgpackr';
+import { createStructon } from 'structon';
+
+const Structon = createStructon(Packr);
+const codec = new Structon({ structures: [] });
+```
+
+Data encoded with `randomAccessStructure: true` in earlier msgpackr versions is fully readable by structon, and vice versa—the binary format is identical.
+
+## Alternate Encoding/Package
+The high-performance serialization and deserialization algorithms in the msgpackr package are also available in the [cbor-x](https://github.com/kriszyp/cbor-x) for the CBOR format, with the same API and design. A quick summary of the pros and cons of using MessagePack vs CBOR are:
+* MessagePack has wider adoption, and, at least with this implementation is slightly more efficient (by roughly 1%).
+* CBOR has an [official IETF standardization track](https://tools.ietf.org/html/rfc7049), and the record extensions is conceptually/philosophically a better fit for CBOR tags.
+
+## License
+
+MIT
+
+### Browser Consideration
+MessagePack can be a great choice for high-performance data delivery to browsers, as reasonable data size is possible without compression. And msgpackr works very well in modern browsers. However, it is worth noting that if you want highly compact data, brotli or gzip are most effective in compressing, and MessagePack's character frequency tends to defeat Huffman encoding used by these standard compression algorithms, resulting in less compact data than compressed JSON.
+
+### Credits
+
+Various projects have been inspirations for this, and code has been borrowed from https://github.com/msgpack/msgpack-javascript and https://github.com/mtth/avsc.
diff --git a/node_modules/msgpackr/SECURITY.md b/node_modules/msgpackr/SECURITY.md
new file mode 100644
index 0000000..92b7afa
--- /dev/null
+++ b/node_modules/msgpackr/SECURITY.md
@@ -0,0 +1,11 @@
+# Security Policy
+
+## Supported Versions
+
+| Version | Supported          |
+| ------- | ------------------ |
+| 1.4.x   | :white_check_mark: |
+
+## Reporting a Vulnerability
+
+Please report security vulnerabilities to kriszyp@gmail.com.
diff --git a/node_modules/msgpackr/benchmark.md b/node_modules/msgpackr/benchmark.md
new file mode 100644
index 0000000..901f7a0
--- /dev/null
+++ b/node_modules/msgpackr/benchmark.md
@@ -0,0 +1,77 @@
+Here are more comprehensive benchmarks. This is comparison with the next fastest JS projects using the benchmark tool from `msgpack-lite` (and data is from some clinical research data we use that has a good mix of different value types and structures). It also includes comparison to V8 native JSON functionality, and JavaScript Avro (`avsc`, a very optimized Avro implementation):
+
+---------------------------------------------------------- | ------: | ----: | -----: | -----:
+msgpackr w/ shared structures: packr.pack(obj);            |  254700 |  5001 |  50929
+msgpackr w/ shared structures: packr.unpack(buf);          |  711700 |  5000 | 142340
+require("msgpackr").pack(obj);                             |  234000 |  5000 |  46800
+require("msgpackr").unpack(buf);                           |  186500 |  5000 |  37300
+buf = Buffer(JSON.stringify(obj));                         |  297900 |  5000 |  59580
+obj = JSON.parse(buf);                                     |  216600 |  5001 |  43311
+buf = require("msgpack-lite").encode(obj);                 |  114000 |  5001 |  22795
+obj = require("msgpack-lite").decode(buf);                 |   40700 |  5006 |   8130
+buf = require("@msgpack/msgpack").encode(obj);             |  166100 |  5000 |  33220
+obj = require("@msgpack/msgpack").decode(buf);             |  136500 |  5002 |  27289
+buf = require("msgpack-js-v5").encode(obj);                |   41600 |  5000 |   8320
+obj = require("msgpack-js-v5").decode(buf);                |   70200 |  5004 |  14028
+buf = require("msgpack-js").encode(obj);                   |   40400 |  5012 |   8060
+obj = require("msgpack-js").decode(buf);                   |   67100 |  5002 |  13414
+buf = require("msgpack5")().encode(obj);                   |   15800 |  5024 |   3144
+obj = require("msgpack5")().decode(buf);                   |   30600 |  5004 |   6115
+buf = require("notepack").encode(obj);                     |  125100 |  5002 |  25009
+obj = require("notepack").decode(buf);                     |   98600 |  5004 |  19704
+require("what-the-pack")... encoder.encode(obj);           |  150300 |  5001 |  30053
+require("what-the-pack")... encoder.decode(buf);           |  100100 |  5000 |  20020
+obj = require("msgpack-unpack").decode(buf);               |   14900 |  5031 |   2961
+require("avsc")...make schema/type...type.toBuffer(obj);   |  266600 |  5000 |  53320
+require("avsc")...make schema/type...type.fromBuffer(obj); |  370200 |  5000 |  74040
+
+(`avsc` is schema-based and more comparable in style to msgpackr with shared structures).
+
+(note that benchmarks below are several years old)
+
+Here is a benchmark of streaming data (again borrowed from `msgpack-lite`'s benchmarking), where msgpackr is able to take advantage of the structured record extension and really pull away from other tools:
+
+operation (1000000 x 2)                          |   op    |  ms   |  op/s
+------------------------------------------------ | ------: | ----: | -----:
+new PackrStream().write(obj);                    | 1000000 |   372 | 2688172
+new UnpackrStream().write(buf);                  | 1000000 |   247 | 4048582
+stream.write(msgpack.encode(obj));               | 1000000 |  2898 | 345065
+stream.write(msgpack.decode(buf));               | 1000000 |  1969 | 507872
+stream.write(notepack.encode(obj));              | 1000000 |   901 | 1109877
+stream.write(notepack.decode(buf));              | 1000000 |  1012 | 988142
+msgpack.Encoder().on("data",ondata).encode(obj); | 1000000 |  1763 | 567214
+msgpack.createDecodeStream().write(buf);         | 1000000 |  2222 | 450045
+msgpack.createEncodeStream().write(obj);         | 1000000 |  1577 | 634115
+msgpack.Decoder().on("data",ondata).decode(buf); | 1000000 |  2246 | 445235
+
+
+
+These are the benchmarks from notepack package. The larger test data for these benchmarks is very heavily weighted with large binary/buffer data and objects with extreme numbers of keys (much more than I typically see with real-world data, but YMMV):
+
+node ./benchmarks/encode
+
+library          |   tiny            |  small          | medium         | large
+---------------- | ----------------: | --------------: | ---------------| -------:
+notepack         | 2,171,621 ops/sec | 546,905 ops/sec | 29,578 ops/sec | 265 ops/sec   
+msgpack-js       | 967,682 ops/sec   | 184,455 ops/sec | 20,556 ops/sec | 259 ops/sec   
+msgpackr         | 2,392,826 ops/sec | 556,915 ops/sec | 70,573 ops/sec | 313 ops/sec   
+msgpack-lite     | 553,143 ops/sec   | 132,318 ops/sec | 11,816 ops/sec | 186 ops/sec   
+@msgpack/msgpack | 2,157,655 ops/sec | 573,236 ops/sec | 25,864 ops/sec | 90.26 ops/sec 
+
+
+node ./benchmarks/decode
+
+library          |   tiny            |  small          | medium          | large
+---------------- | ----------------: | --------------: | --------------- | -------:
+notepack         | 2,220,904 ops/sec | 560,630 ops/sec | 28,177 ops/sec  | 275 ops/sec   
+msgpack-js       | 965,719 ops/sec   | 222,047 ops/sec | 21,431 ops/sec  | 257 ops/sec   
+msgpackr         | 2,320,046 ops/sec | 589,167 ops/sec | 70,299 ops/sec  | 329 ops/sec   
+msgpackr records | 3,750,547 ops/sec | 912,419 ops/sec | 136,853 ops/sec | 733 ops/sec   
+msgpack-lite     | 569,222 ops/sec   | 129,008 ops/sec | 12,424 ops/sec  | 180 ops/sec   
+@msgpack/msgpack | 2,089,697 ops/sec | 557,507 ops/sec | 20,256 ops/sec  | 85.03 ops/sec 
+
+This was run by adding the msgpackr to the benchmarks for notepack.
+
+All benchmarks were performed on Node 14.8.0 (Windows i7-4770 3.4Ghz). They can be run with:
+npm install --no-save msgpack msgpack-js @msgpack/msgpack msgpack-lite notepack avsc
+node tests/benchmark
diff --git a/node_modules/msgpackr/dist/index-no-eval.cjs b/node_modules/msgpackr/dist/index-no-eval.cjs
new file mode 100644
index 0000000..5a14677
--- /dev/null
+++ b/node_modules/msgpackr/dist/index-no-eval.cjs
@@ -0,0 +1,2438 @@
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+	typeof define === 'function' && define.amd ? define(['exports'], factory) :
+	(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.msgpackr = {}));
+})(this, (function (exports) { 'use strict';
+
+	var decoder;
+	try {
+		decoder = new TextDecoder();
+	} catch(error) {}
+	var src;
+	var srcEnd;
+	var position$1 = 0;
+	var currentUnpackr = {};
+	var currentStructures;
+	var srcString;
+	var srcStringStart = 0;
+	var srcStringEnd = 0;
+	var bundledStrings$1;
+	var referenceMap;
+	var currentExtensions = [];
+	var dataView;
+	var defaultOptions = {
+		useRecords: false,
+		mapsAsObjects: true
+	};
+	class C1Type {}
+	const C1 = new C1Type();
+	C1.name = 'MessagePack 0xC1';
+	var sequentialMode = false;
+	var inlineObjectReadThreshold = 2;
+	var BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for
+
+	class Unpackr {
+		constructor(options) {
+			if (options) {
+				if (options.useRecords === false && options.mapsAsObjects === undefined)
+					options.mapsAsObjects = true;
+				if (options.sequential && options.trusted !== false) {
+					options.trusted = true;
+					if (!options.structures && options.useRecords != false) {
+						options.structures = [];
+						if (!options.maxSharedStructures)
+							options.maxSharedStructures = 0;
+					}
+				}
+				if (options.structures)
+					options.structures.sharedLength = options.structures.length;
+				else if (options.getStructures) {
+					(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+					options.structures.sharedLength = 0;
+				}
+				if (options.int64AsNumber) {
+					options.int64AsType = 'number';
+				}
+			}
+			Object.assign(this, options);
+		}
+		unpack(source, options) {
+			if (src) {
+				// re-entrant execution, save the state and restore it after we do this unpack
+				return saveState(() => {
+					clearSource();
+					return this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);
+				});
+			}
+			if (!source.buffer && source.constructor === ArrayBuffer)
+				source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+			if (typeof options === 'object') {
+				srcEnd = options.end || source.length;
+				position$1 = options.start || 0;
+			} else {
+				position$1 = 0;
+				srcEnd = options > -1 ? options : source.length;
+			}
+			srcStringEnd = 0;
+			srcString = null;
+			bundledStrings$1 = null;
+			src = source;
+			// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+			// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+			// new ones
+			try {
+				dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+			} catch(error) {
+				// if it doesn't have a buffer, maybe it is the wrong type of object
+				src = null;
+				if (source instanceof Uint8Array)
+					throw error;
+				throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+			}
+			if (this instanceof Unpackr) {
+				currentUnpackr = this;
+				if (this.structures) {
+					currentStructures = this.structures;
+					return checkedRead(options);
+				} else if (!currentStructures || currentStructures.length > 0) {
+					currentStructures = [];
+				}
+			} else {
+				currentUnpackr = defaultOptions;
+				if (!currentStructures || currentStructures.length > 0)
+					currentStructures = [];
+			}
+			return checkedRead(options);
+		}
+		unpackMultiple(source, forEach) {
+			let values, lastPosition = 0;
+			try {
+				sequentialMode = true;
+				let size = source.length;
+				let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+				if (forEach) {
+					if (forEach(value, lastPosition, position$1) === false) return;
+					while(position$1 < size) {
+						lastPosition = position$1;
+						if (forEach(checkedRead(), lastPosition, position$1) === false) {
+							return;
+						}
+					}
+				}
+				else {
+					values = [ value ];
+					while(position$1 < size) {
+						lastPosition = position$1;
+						values.push(checkedRead());
+					}
+					return values;
+				}
+			} catch(error) {
+				error.lastPosition = lastPosition;
+				error.values = values;
+				throw error;
+			} finally {
+				sequentialMode = false;
+				clearSource();
+			}
+		}
+		_mergeStructures(loadedStructures, existingStructures) {
+			if (this._onLoadedStructures)
+				loadedStructures = this._onLoadedStructures(loadedStructures);
+			loadedStructures = loadedStructures || [];
+			if (Object.isFrozen(loadedStructures))
+				loadedStructures = loadedStructures.map(structure => structure.slice(0));
+			for (let i = 0, l = loadedStructures.length; i < l; i++) {
+				let structure = loadedStructures[i];
+				if (structure) {
+					structure.isShared = true;
+					if (i >= 32)
+						structure.highByte = (i - 32) >> 5;
+				}
+			}
+			loadedStructures.sharedLength = loadedStructures.length;
+			for (let id in existingStructures || []) {
+				if (id >= 0) {
+					let structure = loadedStructures[id];
+					let existing = existingStructures[id];
+					if (existing) {
+						if (structure)
+							(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+						loadedStructures[id] = existing;
+					}
+				}
+			}
+			return this.structures = loadedStructures;
+		}
+		decode(source, options) {
+			return this.unpack(source, options);
+		}
+	}
+	function checkedRead(options) {
+		try {
+			if (!currentUnpackr.trusted && !sequentialMode) {
+				let sharedLength = currentStructures.sharedLength || 0;
+				if (sharedLength < currentStructures.length)
+					currentStructures.length = sharedLength;
+			}
+			let result;
+			if (currentUnpackr._readStruct && src[position$1] < 0x40 && src[position$1] >= 0x20) {
+				result = currentUnpackr._readStruct(src, position$1, srcEnd);
+				src = null; // dispose of this so that recursive unpack calls don't save state
+				if (!(options && options.lazy) && result)
+					result = result.toJSON();
+				position$1 = srcEnd;
+			} else
+				result = read();
+			if (bundledStrings$1) { // bundled strings to skip past
+				position$1 = bundledStrings$1.postBundlePosition;
+				bundledStrings$1 = null;
+			}
+			if (sequentialMode)
+				// we only need to restore the structures if there was an error, but if we completed a read,
+				// we can clear this out and keep the structures we read
+				currentStructures.restoreStructures = null;
+
+			if (position$1 == srcEnd) {
+				// finished reading this source, cleanup references
+				if (currentStructures && currentStructures.restoreStructures)
+					restoreStructures();
+				currentStructures = null;
+				src = null;
+				if (referenceMap)
+					referenceMap = null;
+			} else if (position$1 > srcEnd) {
+				// over read
+				throw new Error('Unexpected end of MessagePack data');
+			} else if (!sequentialMode) {
+				let jsonView;
+				try {
+					jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+				} catch(error) {
+					jsonView = '(JSON view not available ' + error + ')';
+				}
+				throw new Error('Data read, but end of buffer not reached ' + jsonView);
+			}
+			// else more to read, but we are reading sequentially, so don't clear source yet
+			return result;
+		} catch(error) {
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			clearSource();
+			if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position$1 > srcEnd) {
+				error.incomplete = true;
+			}
+			throw error;
+		}
+	}
+
+	function restoreStructures() {
+		for (let id in currentStructures.restoreStructures) {
+			currentStructures[id] = currentStructures.restoreStructures[id];
+		}
+		currentStructures.restoreStructures = null;
+	}
+
+	function read() {
+		let token = src[position$1++];
+		if (token < 0xa0) {
+			if (token < 0x80) {
+				if (token < 0x40)
+					return token;
+				else {
+					let structure = currentStructures[token & 0x3f] ||
+						currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+					if (structure) {
+						if (!structure.read) {
+							structure.read = createStructureReader(structure, token & 0x3f);
+						}
+						return structure.read();
+					} else
+						return token;
+				}
+			} else if (token < 0x90) {
+				// map
+				token -= 0x80;
+				if (currentUnpackr.mapsAsObjects) {
+					let object = {};
+					for (let i = 0; i < token; i++) {
+						let key = readKey();
+						if (key === '__proto__')
+							key = '__proto_';
+						object[key] = read();
+					}
+					return object;
+				} else {
+					let map = new Map();
+					for (let i = 0; i < token; i++) {
+						map.set(read(), read());
+					}
+					return map;
+				}
+			} else {
+				token -= 0x90;
+				let array = new Array(token);
+				for (let i = 0; i < token; i++) {
+					array[i] = read();
+				}
+				if (currentUnpackr.freezeData)
+					return Object.freeze(array);
+				return array;
+			}
+		} else if (token < 0xc0) {
+			// fixstr
+			let length = token - 0xa0;
+			if (srcStringEnd >= position$1) {
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			}
+			if (srcStringEnd == 0 && srcEnd < 140) {
+				// for small blocks, avoiding the overhead of the extract call is helpful
+				let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+				if (string != null)
+					return string;
+			}
+			return readFixedString(length);
+		} else {
+			let value;
+			switch (token) {
+				case 0xc0: return null;
+				case 0xc1:
+					if (bundledStrings$1) {
+						value = read(); // followed by the length of the string in characters (not bytes!)
+						if (value > 0)
+							return bundledStrings$1[1].slice(bundledStrings$1.position1, bundledStrings$1.position1 += value);
+						else
+							return bundledStrings$1[0].slice(bundledStrings$1.position0, bundledStrings$1.position0 -= value);
+					}
+					return C1; // "never-used", return special object to denote that
+				case 0xc2: return false;
+				case 0xc3: return true;
+				case 0xc4:
+					// bin 8
+					value = src[position$1++];
+					if (value === undefined)
+						throw new Error('Unexpected end of buffer');
+					return readBin(value);
+				case 0xc5:
+					// bin 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readBin(value);
+				case 0xc6:
+					// bin 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readBin(value);
+				case 0xc7:
+					// ext 8
+					return readExt(src[position$1++]);
+				case 0xc8:
+					// ext 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readExt(value);
+				case 0xc9:
+					// ext 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readExt(value);
+				case 0xca:
+					value = dataView.getFloat32(position$1);
+					if (currentUnpackr.useFloat32 > 2) {
+						// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+						let multiplier = mult10[((src[position$1] & 0x7f) << 1) | (src[position$1 + 1] >> 7)];
+						position$1 += 4;
+						return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+					}
+					position$1 += 4;
+					return value;
+				case 0xcb:
+					value = dataView.getFloat64(position$1);
+					position$1 += 8;
+					return value;
+				// uint handlers
+				case 0xcc:
+					return src[position$1++];
+				case 0xcd:
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xce:
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xcf:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getUint32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigUint64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigUint64(position$1);
+						if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigUint64(position$1);
+					position$1 += 8;
+					return value;
+
+				// int handlers
+				case 0xd0:
+					return dataView.getInt8(position$1++);
+				case 0xd1:
+					value = dataView.getInt16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xd2:
+					value = dataView.getInt32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xd3:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getInt32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigInt64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigInt64(position$1);
+						if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigInt64(position$1);
+					position$1 += 8;
+					return value;
+
+				case 0xd4:
+					// fixext 1
+					value = src[position$1++];
+					if (value == 0x72) {
+						return recordDefinition(src[position$1++] & 0x3f);
+					} else {
+						let extension = currentExtensions[value];
+						if (extension) {
+							if (extension.read) {
+								position$1++; // skip filler byte
+								return extension.read(read());
+							} else if (extension.noBuffer) {
+								position$1++; // skip filler byte
+								return extension();
+							} else
+								return extension(src.subarray(position$1, ++position$1));
+						} else
+							throw new Error('Unknown extension ' + value);
+					}
+				case 0xd5:
+					// fixext 2
+					value = src[position$1];
+					if (value == 0x72) {
+						position$1++;
+						return recordDefinition(src[position$1++] & 0x3f, src[position$1++]);
+					} else
+						return readExt(2);
+				case 0xd6:
+					// fixext 4
+					return readExt(4);
+				case 0xd7:
+					// fixext 8
+					return readExt(8);
+				case 0xd8:
+					// fixext 16
+					return readExt(16);
+				case 0xd9:
+				// str 8
+					value = src[position$1++];
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString8(value);
+				case 0xda:
+				// str 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString16(value);
+				case 0xdb:
+				// str 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString32(value);
+				case 0xdc:
+				// array 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readArray(value);
+				case 0xdd:
+				// array 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readArray(value);
+				case 0xde:
+				// map 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readMap(value);
+				case 0xdf:
+				// map 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readMap(value);
+				default: // negative int
+					if (token >= 0xe0)
+						return token - 0x100;
+					if (token === undefined) {
+						let error = new Error('Unexpected end of MessagePack data');
+						error.incomplete = true;
+						throw error;
+					}
+					throw new Error('Unknown MessagePack token ' + token);
+
+			}
+		}
+	}
+	const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+	function createStructureReader(structure, firstId) {
+		function readObject() {
+			// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+			if (readObject.count++ > inlineObjectReadThreshold) {
+				let optimizedReadObject;
+				try {
+					optimizedReadObject = structure.read = (new BlockedFunction ('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+						'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+				} catch(error) {
+					// in CF workers, the new BlockedFunction  call could begin to fail at any point in time
+					inlineObjectReadThreshold = Infinity; // disable going forward
+					return readObject(); // recursively try again
+				}
+				if (structure.highByte === 0)
+					structure.read = createSecondByteReader(firstId, structure.read);
+				return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+			}
+			let object = {};
+			for (let i = 0, l = structure.length; i < l; i++) {
+				let key = structure[i];
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(object);
+			return object;
+		}
+		readObject.count = 0;
+		if (structure.highByte === 0) {
+			return createSecondByteReader(firstId, readObject);
+		}
+		return readObject;
+	}
+
+	const createSecondByteReader = (firstId, read0) => {
+		return function() {
+			let highByte = src[position$1++];
+			if (highByte === 0)
+				return read0();
+			let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+			let structure = currentStructures[id] || loadStructures()[id];
+			if (!structure) {
+				throw new Error('Record id is not defined for ' + id);
+			}
+			if (!structure.read)
+				structure.read = createStructureReader(structure, firstId);
+			return structure.read();
+		};
+	};
+
+	function loadStructures() {
+		let loadedStructures = saveState(() => {
+			// save the state in case getStructures modifies our buffer
+			src = null;
+			return currentUnpackr.getStructures();
+		});
+		return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+	}
+
+	var readFixedString = readStringJS;
+	var readString8 = readStringJS;
+	var readString16 = readStringJS;
+	var readString32 = readStringJS;
+	let isNativeAccelerationEnabled = false;
+	function readStringJS(length) {
+		let result;
+		if (length < 16) {
+			if (result = shortStringInJS(length))
+				return result;
+		}
+		if (length > 64 && decoder)
+			return decoder.decode(src.subarray(position$1, position$1 += length));
+		const end = position$1 + length;
+		const units = [];
+		result = '';
+		while (position$1 < end) {
+			const byte1 = src[position$1++];
+			if ((byte1 & 0x80) === 0) {
+				// 1 byte
+				units.push(byte1);
+			} else if ((byte1 & 0xe0) === 0xc0) {
+				// 2 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+				// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+				if (codePoint < 0x80) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf0) === 0xe0) {
+				// 3 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+				// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+				// Also reject surrogates (0xD800-0xDFFF)
+				if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf8) === 0xf0) {
+				// 4 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const byte4 = src[position$1++] & 0x3f;
+				let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+				// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+				// Also reject values > 0x10FFFF (maximum valid Unicode)
+				if (unit < 0x10000 || unit > 0x10FFFF) {
+					units.push(0xFFFD); // replacement character
+				} else if (unit > 0xffff) {
+					unit -= 0x10000;
+					units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+					unit = 0xdc00 | (unit & 0x3ff);
+					units.push(unit);
+				} else {
+					units.push(unit);
+				}
+			} else {
+				units.push(0xFFFD); // replacement character for invalid lead byte
+			}
+
+			if (units.length >= 0x1000) {
+				result += fromCharCode.apply(String, units);
+				units.length = 0;
+			}
+		}
+
+		if (units.length > 0) {
+			result += fromCharCode.apply(String, units);
+		}
+
+		return result;
+	}
+
+	function readArray(length) {
+		let array = new Array(length);
+		for (let i = 0; i < length; i++) {
+			array[i] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(array);
+		return array;
+	}
+
+	function readMap(length) {
+		if (currentUnpackr.mapsAsObjects) {
+			let object = {};
+			for (let i = 0; i < length; i++) {
+				let key = readKey();
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			return object;
+		} else {
+			let map = new Map();
+			for (let i = 0; i < length; i++) {
+				map.set(read(), read());
+			}
+			return map;
+		}
+	}
+
+	var fromCharCode = String.fromCharCode;
+	function longStringInJS(length) {
+		let start = position$1;
+		let bytes = new Array(length);
+		for (let i = 0; i < length; i++) {
+			const byte = src[position$1++];
+			if ((byte & 0x80) > 0) {
+					position$1 = start;
+					return;
+				}
+				bytes[i] = byte;
+			}
+			return fromCharCode.apply(String, bytes);
+	}
+	function shortStringInJS(length) {
+		if (length < 4) {
+			if (length < 2) {
+				if (length === 0)
+					return '';
+				else {
+					let a = src[position$1++];
+					if ((a & 0x80) > 1) {
+						position$1 -= 1;
+						return;
+					}
+					return fromCharCode(a);
+				}
+			} else {
+				let a = src[position$1++];
+				let b = src[position$1++];
+				if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+					position$1 -= 2;
+					return;
+				}
+				if (length < 3)
+					return fromCharCode(a, b);
+				let c = src[position$1++];
+				if ((c & 0x80) > 0) {
+					position$1 -= 3;
+					return;
+				}
+				return fromCharCode(a, b, c);
+			}
+		} else {
+			let a = src[position$1++];
+			let b = src[position$1++];
+			let c = src[position$1++];
+			let d = src[position$1++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+				position$1 -= 4;
+				return;
+			}
+			if (length < 6) {
+				if (length === 4)
+					return fromCharCode(a, b, c, d);
+				else {
+					let e = src[position$1++];
+					if ((e & 0x80) > 0) {
+						position$1 -= 5;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e);
+				}
+			} else if (length < 8) {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+					position$1 -= 6;
+					return;
+				}
+				if (length < 7)
+					return fromCharCode(a, b, c, d, e, f);
+				let g = src[position$1++];
+				if ((g & 0x80) > 0) {
+					position$1 -= 7;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g);
+			} else {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				let g = src[position$1++];
+				let h = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+					position$1 -= 8;
+					return;
+				}
+				if (length < 10) {
+					if (length === 8)
+						return fromCharCode(a, b, c, d, e, f, g, h);
+					else {
+						let i = src[position$1++];
+						if ((i & 0x80) > 0) {
+							position$1 -= 9;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i);
+					}
+				} else if (length < 12) {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+						position$1 -= 10;
+						return;
+					}
+					if (length < 11)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+					let k = src[position$1++];
+					if ((k & 0x80) > 0) {
+						position$1 -= 11;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+				} else {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					let k = src[position$1++];
+					let l = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+						position$1 -= 12;
+						return;
+					}
+					if (length < 14) {
+						if (length === 12)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+						else {
+							let m = src[position$1++];
+							if ((m & 0x80) > 0) {
+								position$1 -= 13;
+								return;
+							}
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+						}
+					} else {
+						let m = src[position$1++];
+						let n = src[position$1++];
+						if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+							position$1 -= 14;
+							return;
+						}
+						if (length < 15)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+						let o = src[position$1++];
+						if ((o & 0x80) > 0) {
+							position$1 -= 15;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+					}
+				}
+			}
+		}
+	}
+
+	function readOnlyJSString() {
+		let token = src[position$1++];
+		let length;
+		if (token < 0xc0) {
+			// fixstr
+			length = token - 0xa0;
+		} else {
+			switch(token) {
+				case 0xd9:
+				// str 8
+					length = src[position$1++];
+					break;
+				case 0xda:
+				// str 16
+					length = dataView.getUint16(position$1);
+					position$1 += 2;
+					break;
+				case 0xdb:
+				// str 32
+					length = dataView.getUint32(position$1);
+					position$1 += 4;
+					break;
+				default:
+					throw new Error('Expected string');
+			}
+		}
+		return readStringJS(length);
+	}
+
+
+	function readBin(length) {
+		return currentUnpackr.copyBuffers ?
+			// specifically use the copying slice (not the node one)
+			Uint8Array.prototype.slice.call(src, position$1, position$1 += length) :
+			src.subarray(position$1, position$1 += length);
+	}
+	function readExt(length) {
+		let type = src[position$1++];
+		if (currentExtensions[type]) {
+			let end;
+			return currentExtensions[type](src.subarray(position$1, end = (position$1 += length)), (readPosition) => {
+				position$1 = readPosition;
+				try {
+					return read();
+				} finally {
+					position$1 = end;
+				}
+			});
+		}
+		else
+			throw new Error('Unknown extension type ' + type);
+	}
+
+	var keyCache = new Array(4096);
+	function readKey() {
+		let length = src[position$1++];
+		if (length >= 0xa0 && length < 0xc0) {
+			// fixstr, potentially use key cache
+			length = length - 0xa0;
+			if (srcStringEnd >= position$1) // if it has been extracted, must use it (and faster anyway)
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			else if (!(srcStringEnd == 0 && srcEnd < 180))
+				return readFixedString(length);
+		} else { // not cacheable, go back and do a standard read
+			position$1--;
+			return asSafeString(read());
+		}
+		let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position$1) : length > 0 ? src[position$1] : 0)) & 0xfff;
+		let entry = keyCache[key];
+		let checkPosition = position$1;
+		let end = position$1 + length - 3;
+		let chunk;
+		let i = 0;
+		if (entry && entry.bytes == length) {
+			while (checkPosition < end) {
+				chunk = dataView.getUint32(checkPosition);
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+				checkPosition += 4;
+			}
+			end += 3;
+			while (checkPosition < end) {
+				chunk = src[checkPosition++];
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+			}
+			if (checkPosition === end) {
+				position$1 = checkPosition;
+				return entry.string;
+			}
+			end -= 3;
+			checkPosition = position$1;
+		}
+		entry = [];
+		keyCache[key] = entry;
+		entry.bytes = length;
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			entry.push(chunk);
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			entry.push(chunk);
+		}
+		// for small blocks, avoiding the overhead of the extract call is helpful
+		let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+		if (string != null)
+			return entry.string = string;
+		return entry.string = readFixedString(length);
+	}
+
+	function asSafeString(property) {
+		// protect against expensive (DoS) string conversions
+		if (typeof property === 'string') return property;
+		if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+		if (property == null) return property + '';
+		if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+			return property.flat().toString();
+		}
+		throw new Error(`Invalid property type for record: ${typeof property}`);
+	}
+	// the registration of the record definition extension (as "r")
+	const recordDefinition = (id, highByte) => {
+		let structure = read().map(asSafeString); // ensure that all keys are strings and
+		// that the array is mutable
+		let firstByte = id;
+		if (highByte !== undefined) {
+			id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+			structure.highByte = highByte;
+		}
+		let existingStructure = currentStructures[id];
+		// If it is a shared structure, we need to restore any changes after reading.
+		// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+		// to the state prior to an incomplete read in order to properly resume.
+		if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+			(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+		}
+		currentStructures[id] = structure;
+		structure.read = createStructureReader(structure, firstByte);
+		return structure.read();
+	};
+	currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+	currentExtensions[0].noBuffer = true;
+
+	currentExtensions[0x42] = data => {
+		let headLength = (data.byteLength % 8) || 8;
+		let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+		for (let i = 1; i < headLength; i++) {
+			head <<= BigInt(8);
+			head += BigInt(data[i]);
+		}
+		if (data.byteLength !== headLength) {
+			let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+			let decode = (start, end) => {
+				let length = end - start;
+				if (length <= 40) {
+					let out = view.getBigUint64(start);
+					for (let i = start + 8; i < end; i += 8) {
+						out <<= BigInt(64);
+						out |= view.getBigUint64(i);
+					}
+					return out;
+				}
+				// if (length === 8) return view.getBigUint64(start)
+				let middle = start + (length >> 4 << 3);
+				let left = decode(start, middle);
+				let right = decode(middle, end);
+				return (left << BigInt((end - middle) * 8)) | right;
+			};
+			head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+		}
+		return head;
+	};
+
+	let errors = {
+		Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+	};
+	currentExtensions[0x65] = () => {
+		let data = read();
+		if (!errors[data[0]]) {
+			let error = Error(data[1], { cause: data[2] });
+			error.name = data[0];
+			return error;
+		}
+		return errors[data[0]](data[1], { cause: data[2] });
+	};
+
+	currentExtensions[0x69] = (data) => {
+		// id extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		if (!referenceMap)
+			referenceMap = new Map();
+		let token = src[position$1];
+		let target;
+		// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+		if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+			target = [];
+		else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+			target = new Map();
+		else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position$1 + 1] === 0x73)
+			target = new Set();
+		else
+			target = {};
+
+		let refEntry = { target }; // a placeholder object
+		referenceMap.set(id, refEntry);
+		let targetProperties = read(); // read the next value as the target object to id
+		if (!refEntry.used) {
+			// no cycle, can just use the returned read object
+			return refEntry.target = targetProperties; // replace the placeholder with the real one
+		} else {
+			// there is a cycle, so we have to assign properties to original target
+			Object.assign(target, targetProperties);
+		}
+
+		// copy over map/set entries if we're able to
+		if (target instanceof Map)
+			for (let [k, v] of targetProperties.entries()) target.set(k, v);
+		if (target instanceof Set)
+			for (let i of Array.from(targetProperties)) target.add(i);
+		return target;
+	};
+
+	currentExtensions[0x70] = (data) => {
+		// pointer extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		let refEntry = referenceMap.get(id);
+		refEntry.used = true;
+		return refEntry.target;
+	};
+
+	currentExtensions[0x73] = () => new Set(read());
+
+	const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+	let glbl = typeof globalThis === 'object' ? globalThis : window;
+	currentExtensions[0x74] = (data) => {
+		let typeCode = data[0];
+		// we always have to slice to get a new ArrayBuffer that is aligned
+		let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+		let typedArrayName = typedArrays[typeCode];
+		if (!typedArrayName) {
+			if (typeCode === 16) return buffer;
+			if (typeCode === 17) return new DataView(buffer);
+			throw new Error('Could not find typed array for code ' + typeCode);
+		}
+		return new glbl[typedArrayName](buffer);
+	};
+	currentExtensions[0x78] = () => {
+		let data = read();
+		return new RegExp(data[0], data[1]);
+	};
+	const TEMP_BUNDLE = [];
+	currentExtensions[0x62] = (data) => {
+		let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+		let dataPosition = position$1;
+		position$1 += dataSize - data.length;
+		bundledStrings$1 = TEMP_BUNDLE;
+		bundledStrings$1 = [readOnlyJSString(), readOnlyJSString()];
+		bundledStrings$1.position0 = 0;
+		bundledStrings$1.position1 = 0;
+		bundledStrings$1.postBundlePosition = position$1;
+		position$1 = dataPosition;
+		return read();
+	};
+
+	currentExtensions[0xff] = (data) => {
+		// 32-bit date extension
+		if (data.length == 4)
+			return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+		else if (data.length == 8)
+			return new Date(
+				((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+				((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+		else if (data.length == 12)
+			return new Date(
+				((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+				(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+		else
+			return new Date('invalid');
+	};
+	// registration of bulk record definition?
+	// currentExtensions[0x52] = () =>
+
+	function saveState(callback) {
+		if (currentUnpackr && currentUnpackr._onSaveState)
+			currentUnpackr._onSaveState();
+		let savedSrcEnd = srcEnd;
+		let savedPosition = position$1;
+		let savedSrcStringStart = srcStringStart;
+		let savedSrcStringEnd = srcStringEnd;
+		let savedSrcString = srcString;
+		let savedReferenceMap = referenceMap;
+		let savedBundledStrings = bundledStrings$1;
+
+		// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+		let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+		let savedStructures = currentStructures;
+		let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+		let savedPackr = currentUnpackr;
+		let savedSequentialMode = sequentialMode;
+		let value = callback();
+		srcEnd = savedSrcEnd;
+		position$1 = savedPosition;
+		srcStringStart = savedSrcStringStart;
+		srcStringEnd = savedSrcStringEnd;
+		srcString = savedSrcString;
+		referenceMap = savedReferenceMap;
+		bundledStrings$1 = savedBundledStrings;
+		src = savedSrc;
+		sequentialMode = savedSequentialMode;
+		currentStructures = savedStructures;
+		currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+		currentUnpackr = savedPackr;
+		dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+		return value;
+	}
+	function clearSource() {
+		src = null;
+		referenceMap = null;
+		currentStructures = null;
+	}
+
+	function addExtension$1(extension) {
+		if (extension.unpack)
+			currentExtensions[extension.type] = extension.unpack;
+		else
+			currentExtensions[extension.type] = extension;
+	}
+
+	const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+	for (let i = 0; i < 256; i++) {
+		mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+	}
+	const Decoder = Unpackr;
+	var defaultUnpackr = new Unpackr({ useRecords: false });
+	const unpack = defaultUnpackr.unpack;
+	const unpackMultiple = defaultUnpackr.unpackMultiple;
+	const decode = defaultUnpackr.unpack;
+	const FLOAT32_OPTIONS = {
+		NEVER: 0,
+		ALWAYS: 1,
+		DECIMAL_ROUND: 3,
+		DECIMAL_FIT: 4
+	};
+	let f32Array = new Float32Array(1);
+	let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+	function roundFloat32(float32Number) {
+		f32Array[0] = float32Number;
+		let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+		return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+	}
+	// Marker for downstream libraries (e.g. structon) to detect per-instance
+	// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+	// this._onSaveState).  See `checkedRead` for the dispatch.
+	Unpackr.SUPPORTS_STRUCT_HOOKS = true;
+
+	let textEncoder;
+	try {
+		textEncoder = new TextEncoder();
+	} catch (error) {}
+	let extensions, extensionClasses;
+	const hasNodeBuffer = typeof Buffer !== 'undefined';
+	const ByteArrayAllocate = hasNodeBuffer ?
+		function(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;
+	const ByteArray = hasNodeBuffer ? Buffer : Uint8Array;
+	const MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;
+	let target, keysTarget;
+	let targetView;
+	let position = 0;
+	let safeEnd;
+	let bundledStrings = null;
+	const MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.
+	const hasNonLatin = /[\u0080-\uFFFF]/;
+	const RECORD_SYMBOL = Symbol('record-id');
+	class Packr extends Unpackr {
+		constructor(options) {
+			super(options);
+			this.offset = 0;
+			let start;
+			let hasSharedUpdate;
+			let structures;
+			let referenceMap;
+			let encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {
+				return target.utf8Write(string, position, target.byteLength - position);
+			} : (textEncoder && textEncoder.encodeInto) ?
+				function(string, position) {
+					return textEncoder.encodeInto(string, target.subarray(position)).written;
+				} : false;
+
+			let packr = this;
+			if (!options)
+				options = {};
+			let isSequential = options && options.sequential;
+			let hasSharedStructures = options.structures || options.saveStructures;
+			let maxSharedStructures = options.maxSharedStructures;
+			if (maxSharedStructures == null)
+				maxSharedStructures = hasSharedStructures ? 32 : 0;
+			if (maxSharedStructures > 8160)
+				throw new Error('Maximum maxSharedStructure is 8160');
+			if (options.structuredClone && options.moreTypes == undefined) {
+				this.moreTypes = true;
+			}
+			let maxOwnStructures = options.maxOwnStructures;
+			if (maxOwnStructures == null)
+				maxOwnStructures = hasSharedStructures ? 32 : 64;
+			if (!this.structures && options.useRecords != false)
+				this.structures = [];
+			// two byte record ids for shared structures
+			let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
+			let sharedLimitId = maxSharedStructures + 0x40;
+			let maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;
+			if (maxStructureId > 8256) {
+				throw new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');
+			}
+			let recordIdsToRemove = [];
+			let transitionsCount = 0;
+			let serializationsSinceTransitionRebuild = 0;
+
+			this.pack = this.encode = function(value, encodeOptions) {
+				if (!target) {
+					target = new ByteArrayAllocate(8192);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));
+					position = 0;
+				}
+				safeEnd = target.length - 10;
+				if (safeEnd - position < 0x800) {
+					// don't start too close to the end,
+					target = new ByteArrayAllocate(target.length);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));
+					safeEnd = target.length - 10;
+					position = 0;
+				} else
+					position = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster
+				start = position;
+				if (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);
+				referenceMap = packr.structuredClone ? new Map() : null;
+				if (packr.bundleStrings && typeof value !== 'string') {
+					bundledStrings = [];
+					bundledStrings.size = Infinity; // force a new bundle start on first string
+				} else
+					bundledStrings = null;
+				structures = packr.structures;
+				if (structures) {
+					if (structures.uninitialized)
+						structures = packr._mergeStructures(packr.getStructures());
+					let sharedLength = structures.sharedLength || 0;
+					if (sharedLength > maxSharedStructures) {
+						//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
+						throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);
+					}
+					if (!structures.transitions) {
+						// rebuild our structure transitions
+						structures.transitions = Object.create(null);
+						for (let i = 0; i < sharedLength; i++) {
+							let keys = structures[i];
+							if (!keys)
+								continue;
+							let nextTransition, transition = structures.transitions;
+							for (let j = 0, l = keys.length; j < l; j++) {
+								let key = keys[j];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+								}
+								transition = nextTransition;
+							}
+							transition[RECORD_SYMBOL] = i + 0x40;
+						}
+						this.lastNamedStructuresLength = sharedLength;
+					}
+					if (!isSequential) {
+						structures.nextId = sharedLength + 0x40;
+					}
+				}
+				if (hasSharedUpdate)
+					hasSharedUpdate = false;
+				let encodingError;
+				try {
+					if (packr._writeStruct && value && typeof value === 'object') {
+						if (value.constructor === Object) writeStruct(value); // simple object
+						else if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {
+							// allow user classes, if they don't need special handling (but do use toJSON if available)
+							writeStruct(value.toJSON ? value.toJSON() : value);
+						} else pack(value);
+					} else
+						pack(value);
+					let lastBundle = bundledStrings;
+					if (bundledStrings)
+						writeBundles(start, pack, 0);
+					if (referenceMap && referenceMap.idsToInsert) {
+						let idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);
+						let i = idsToInsert.length;
+						let incrementPosition = -1;
+						while (lastBundle && i > 0) {
+							let insertionPoint = idsToInsert[--i].offset + start;
+							if (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)
+								incrementPosition = 0;
+							if (insertionPoint > (lastBundle.position + start)) {
+								if (incrementPosition >= 0)
+									incrementPosition += 6;
+							} else {
+								if (incrementPosition >= 0) {
+									// update the bundle reference now
+									targetView.setUint32(lastBundle.position + start,
+										targetView.getUint32(lastBundle.position + start) + incrementPosition);
+									incrementPosition = -1; // reset
+								}
+								lastBundle = lastBundle.previous;
+								i++;
+							}
+						}
+						if (incrementPosition >= 0 && lastBundle) {
+							// update the bundle reference now
+							targetView.setUint32(lastBundle.position + start,
+								targetView.getUint32(lastBundle.position + start) + incrementPosition);
+						}
+						position += idsToInsert.length * 6;
+						if (position > safeEnd)
+							makeRoom(position);
+						packr.offset = position;
+						let serialized = insertIds(target.subarray(start, position), idsToInsert);
+						referenceMap = null;
+						return serialized;
+					}
+					packr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
+					if (encodeOptions & REUSE_BUFFER_MODE) {
+						target.start = start;
+						target.end = position;
+						return target;
+					}
+					return target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now
+				} catch(error) {
+					encodingError = error;
+					throw error;
+				} finally {
+					if (structures) {
+						resetStructures();
+						if (hasSharedUpdate && packr.saveStructures) {
+							let sharedLength = structures.sharedLength || 0;
+							// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
+							let returnBuffer = target.subarray(start, position);
+							let newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);
+							if (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time
+								if (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {
+									// get updated structures and try again if the update failed
+									return packr.pack(value, encodeOptions);
+								}
+								packr.lastNamedStructuresLength = sharedLength;
+								// don't keep large buffers around
+								if (target.length > 0x40000000) target = null;
+								return returnBuffer;
+							}
+						}
+					}
+					// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)
+					if (target.length > 0x40000000) target = null;
+					if (encodeOptions & RESET_BUFFER_MODE)
+						position = start;
+				}
+			};
+			const resetStructures = () => {
+				if (serializationsSinceTransitionRebuild < 10)
+					serializationsSinceTransitionRebuild++;
+				let sharedLength = structures.sharedLength || 0;
+				if (structures.length > sharedLength && !isSequential)
+					structures.length = sharedLength;
+				if (transitionsCount > 10000) {
+					// force a rebuild occasionally after a lot of transitions so it can get cleaned up
+					structures.transitions = null;
+					serializationsSinceTransitionRebuild = 0;
+					transitionsCount = 0;
+					if (recordIdsToRemove.length > 0)
+						recordIdsToRemove = [];
+				} else if (recordIdsToRemove.length > 0 && !isSequential) {
+					for (let i = 0, l = recordIdsToRemove.length; i < l; i++) {
+						recordIdsToRemove[i][RECORD_SYMBOL] = 0;
+					}
+					recordIdsToRemove = [];
+				}
+			};
+			const packArray = (value) => {
+				var length = value.length;
+				if (length < 0x10) {
+					target[position++] = 0x90 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xdc;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdd;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				for (let i = 0; i < length; i++) {
+					pack(value[i]);
+				}
+			};
+			const pack = (value) => {
+				if (position > safeEnd)
+					target = makeRoom(position);
+
+				var type = typeof value;
+				var length;
+				if (type === 'string') {
+					let strLength = value.length;
+					if (bundledStrings && strLength >= 4 && strLength < 0x1000) {
+						if ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {
+							let extStart;
+							let maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;
+							if (position + maxBytes > safeEnd)
+								target = makeRoom(position + maxBytes);
+							let lastBundle;
+							if (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle
+								lastBundle = bundledStrings;
+								target[position] = 0xc8; // ext 16
+								position += 3; // reserve for the writing bundle size
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+								writeBundles(start, pack, 0); // write the last bundles
+								targetView.setUint16(extStart + start - 3, position - start - extStart);
+							} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+							}
+							bundledStrings = ['', '']; // create new ones
+							bundledStrings.previous = lastBundle;
+							bundledStrings.size = 0;
+							bundledStrings.position = extStart;
+						}
+						let twoByte = hasNonLatin.test(value);
+						bundledStrings[twoByte ? 0 : 1] += value;
+						target[position++] = 0xc1;
+						pack(twoByte ? -strLength : strLength);
+						return;
+					}
+					let headerSize;
+					// first we estimate the header size, so we can write to the correct location
+					if (strLength < 0x20) {
+						headerSize = 1;
+					} else if (strLength < 0x100) {
+						headerSize = 2;
+					} else if (strLength < 0x10000) {
+						headerSize = 3;
+					} else {
+						headerSize = 5;
+					}
+					let maxBytes = strLength * 3;
+					if (position + maxBytes > safeEnd)
+						target = makeRoom(position + maxBytes);
+
+					if (strLength < 0x40 || !encodeUtf8) {
+						let i, c1, c2, strPosition = position + headerSize;
+						for (i = 0; i < strLength; i++) {
+							c1 = value.charCodeAt(i);
+							if (c1 < 0x80) {
+								target[strPosition++] = c1;
+							} else if (c1 < 0x800) {
+								target[strPosition++] = c1 >> 6 | 0xc0;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else if (
+								(c1 & 0xfc00) === 0xd800 &&
+								((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00
+							) {
+								c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+								i++;
+								target[strPosition++] = c1 >> 18 | 0xf0;
+								target[strPosition++] = c1 >> 12 & 0x3f | 0x80;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else {
+								target[strPosition++] = c1 >> 12 | 0xe0;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							}
+						}
+						length = strPosition - position - headerSize;
+					} else {
+						length = encodeUtf8(value, position + headerSize);
+					}
+
+					if (length < 0x20) {
+						target[position++] = 0xa0 | length;
+					} else if (length < 0x100) {
+						if (headerSize < 2) {
+							target.copyWithin(position + 2, position + 1, position + 1 + length);
+						}
+						target[position++] = 0xd9;
+						target[position++] = length;
+					} else if (length < 0x10000) {
+						if (headerSize < 3) {
+							target.copyWithin(position + 3, position + 2, position + 2 + length);
+						}
+						target[position++] = 0xda;
+						target[position++] = length >> 8;
+						target[position++] = length & 0xff;
+					} else {
+						if (headerSize < 5) {
+							target.copyWithin(position + 5, position + 3, position + 3 + length);
+						}
+						target[position++] = 0xdb;
+						targetView.setUint32(position, length);
+						position += 4;
+					}
+					position += length;
+				} else if (type === 'number') {
+					if (value >>> 0 === value) {// positive integer, 32-bit or less
+						// positive uint
+						if (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {
+							target[position++] = value;
+						} else if (value < 0x100) {
+							target[position++] = 0xcc;
+							target[position++] = value;
+						} else if (value < 0x10000) {
+							target[position++] = 0xcd;
+							target[position++] = value >> 8;
+							target[position++] = value & 0xff;
+						} else {
+							target[position++] = 0xce;
+							targetView.setUint32(position, value);
+							position += 4;
+						}
+					} else if (value >> 0 === value) { // negative integer
+						if (value >= -0x20) {
+							target[position++] = 0x100 + value;
+						} else if (value >= -0x80) {
+							target[position++] = 0xd0;
+							target[position++] = value + 0x100;
+						} else if (value >= -0x8000) {
+							target[position++] = 0xd1;
+							targetView.setInt16(position, value);
+							position += 2;
+						} else {
+							target[position++] = 0xd2;
+							targetView.setInt32(position, value);
+							position += 4;
+						}
+					} else {
+						let useFloat32;
+						if ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {
+							target[position++] = 0xca;
+							targetView.setFloat32(position, value);
+							let xShifted;
+							if (useFloat32 < 4 ||
+									// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+									((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {
+								position += 4;
+								return;
+							} else
+								position--; // move back into position for writing a double
+						}
+						target[position++] = 0xcb;
+						targetView.setFloat64(position, value);
+						position += 8;
+					}
+				} else if (type === 'object' || type === 'function') {
+					if (!value)
+						target[position++] = 0xc0;
+					else {
+						if (referenceMap) {
+							let referee = referenceMap.get(value);
+							if (referee) {
+								if (!referee.id) {
+									let idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);
+									referee.id = idsToInsert.push(referee);
+								}
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x70; // "p" for pointer
+								targetView.setUint32(position, referee.id);
+								position += 4;
+								return;
+							} else
+								referenceMap.set(value, { offset: position - start });
+						}
+						let constructor = value.constructor;
+						if (constructor === Object) {
+							writeObject(value);
+						} else if (constructor === Array) {
+							packArray(value);
+						} else if (constructor === Map) {
+							if (this.mapAsEmptyObject) target[position++] = 0x80;
+							else {
+								length = value.size;
+								if (length < 0x10) {
+									target[position++] = 0x80 | length;
+								} else if (length < 0x10000) {
+									target[position++] = 0xde;
+									target[position++] = length >> 8;
+									target[position++] = length & 0xff;
+								} else {
+									target[position++] = 0xdf;
+									targetView.setUint32(position, length);
+									position += 4;
+								}
+								for (let [key, entryValue] of value) {
+									pack(key);
+									pack(entryValue);
+								}
+							}
+						} else {
+							for (let i = 0, l = extensions.length; i < l; i++) {
+								let extensionClass = extensionClasses[i];
+								if (value instanceof extensionClass) {
+									let extension = extensions[i];
+									if (extension.write) {
+										if (extension.type) {
+											target[position++] = 0xd4; // one byte "tag" extension
+											target[position++] = extension.type;
+											target[position++] = 0;
+										}
+										let writeResult = extension.write.call(this, value);
+										if (writeResult === value) { // avoid infinite recursion
+											if (Array.isArray(value)) {
+												packArray(value);
+											} else {
+												writeObject(value);
+											}
+										} else {
+											pack(writeResult);
+										}
+										return;
+									}
+									let currentTarget = target;
+									let currentTargetView = targetView;
+									let currentPosition = position;
+									target = null;
+									let result;
+									try {
+										result = extension.pack.call(this, value, (size) => {
+											// restore target and use it
+											target = currentTarget;
+											currentTarget = null;
+											position += size;
+											if (position > safeEnd)
+												makeRoom(position);
+											return {
+												target, targetView, position: position - size
+											};
+										}, pack);
+									} finally {
+										// restore current target information (unless already restored)
+										if (currentTarget) {
+											target = currentTarget;
+											targetView = currentTargetView;
+											position = currentPosition;
+											safeEnd = target.length - 10;
+										}
+									}
+									if (result) {
+										if (result.length + position > safeEnd)
+											makeRoom(result.length + position);
+										position = writeExtensionData(result, target, position, extension.type);
+									}
+									return;
+								}
+							}
+							// check isArray after extensions, because extensions can extend Array
+							if (Array.isArray(value)) {
+								packArray(value);
+							} else {
+								// use this as an alternate mechanism for expressing how to serialize
+								if (value.toJSON) {
+									const json = value.toJSON();
+									// if for some reason value.toJSON returns itself it'll loop forever
+									if (json !== value)
+										return pack(json);
+								}
+
+								// if there is a writeFunction, use it, otherwise just encode as undefined
+								if (type === 'function')
+									return pack(this.writeFunction && this.writeFunction(value));
+
+								// no extension found, write as plain object
+								writeObject(value);
+							}
+						}
+					}
+				} else if (type === 'boolean') {
+					target[position++] = value ? 0xc3 : 0xc2;
+				} else if (type === 'bigint') {
+					if (value < 0x8000000000000000 && value >= -0x8000000000000000) {
+						// use a signed int as long as it fits
+						target[position++] = 0xd3;
+						targetView.setBigInt64(position, value);
+					} else if (value < 0x10000000000000000 && value > 0) {
+						// if we can fit an unsigned int, use that
+						target[position++] = 0xcf;
+						targetView.setBigUint64(position, value);
+					} else {
+						// overflow
+						if (this.largeBigIntToFloat) {
+							target[position++] = 0xcb;
+							targetView.setFloat64(position, Number(value));
+						} else if (this.largeBigIntToString) {
+							return pack(value.toString());
+						} else if (this.useBigIntExtension || this.moreTypes) {
+							let empty = value < 0 ? BigInt(-1) : BigInt(0);
+
+							let array;
+							if (value >> BigInt(0x10000) === empty) {
+								let mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow
+								let chunks = [];
+								while (true) {
+									chunks.push(value & mask);
+									if ((value >> BigInt(63)) === empty) break;
+									value >>= BigInt(64);
+								}
+
+								array = new Uint8Array(new BigUint64Array(chunks).buffer);
+								array.reverse();
+							} else {
+								let invert = value < 0;
+								let string = (invert ? ~value : value).toString(16);
+								if (string.length % 2) {
+									string = '0' + string;
+								} else if (parseInt(string.charAt(0), 16) >= 8) {
+									string = '00' + string;
+								}
+
+								if (hasNodeBuffer) {
+									array = Buffer.from(string, 'hex');
+								} else {
+									array = new Uint8Array(string.length / 2);
+									for (let i = 0; i < array.length; i++) {
+										array[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);
+									}
+								}
+
+								if (invert) {
+									for (let i = 0; i < array.length; i++) array[i] = ~array[i];
+								}
+							}
+
+							if (array.length + position > safeEnd)
+								makeRoom(array.length + position);
+							position = writeExtensionData(array, target, position, 0x42);
+							return;
+						} else {
+							throw new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +
+								' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +
+								' largeBigIntToString to convert to string');
+						}
+					}
+					position += 8;
+				} else if (type === 'undefined') {
+					if (this.encodeUndefinedAsNil)
+						target[position++] = 0xc0;
+					else {
+						target[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite
+						target[position++] = 0;
+						target[position++] = 0;
+					}
+				} else {
+					throw new Error('Unknown type: ' + type);
+				}
+			};
+
+			const writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {
+				// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
+				let keys;
+				if (this.skipValues) {
+					keys = [];
+					for (let key in object) {
+						if ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&
+							!this.skipValues.includes(object[key]))
+							keys.push(key);
+					}
+				} else {
+					keys = Object.keys(object);
+				}
+				let length = keys.length;
+				if (length < 0x10) {
+					target[position++] = 0x80 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xde;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdf;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				let key;
+				if (this.coercibleKeyAsNumber) {
+					for (let i = 0; i < length; i++) {
+						key = keys[i];
+						let num = Number(key);
+						pack(isNaN(num) ? key : num);
+						pack(object[key]);
+					}
+
+				} else {
+					for (let i = 0; i < length; i++) {
+						pack(key = keys[i]);
+						pack(object[key]);
+					}
+				}
+			} :
+			(object) => {
+				target[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards
+				let objectOffset = position - start;
+				position += 2;
+				let size = 0;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(key);
+						pack(object[key]);
+						size++;
+					}
+				}
+				if (size > 0xffff) {
+					throw new Error('Object is too large to serialize with fast 16-bit map size,' +
+					' use the "variableMapSize" option to serialize this object');
+				}
+				target[objectOffset++ + start] = size >> 8;
+				target[objectOffset + start] = size & 0xff;
+			};
+
+			const writeRecord = this.useRecords === false ? writePlainObject :
+			(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let objectOffset = position++ - start;
+				let wroteKeys;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						nextTransition = transition[key];
+						if (nextTransition)
+							transition = nextTransition;
+						else {
+							// record doesn't exist, create full new record and insert it
+							let keys = Object.keys(object);
+							let lastTransition = transition;
+							transition = structures.transitions;
+							let newTransitions = 0;
+							for (let i = 0, l = keys.length; i < l; i++) {
+								let key = keys[i];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+									newTransitions++;
+								}
+								transition = nextTransition;
+							}
+							if (objectOffset + start + 1 == position) {
+								// first key, so we don't need to insert, we can just write record directly
+								position--;
+								newRecord(transition, keys, newTransitions);
+							} else // otherwise we need to insert the record, moving existing data after the record
+								insertNewRecord(transition, keys, objectOffset, newTransitions);
+							wroteKeys = true;
+							transition = lastTransition[key];
+						}
+						pack(object[key]);
+					}
+				}
+				if (!wroteKeys) {
+					let recordId = transition[RECORD_SYMBOL];
+					if (recordId)
+						target[objectOffset + start] = recordId;
+					else
+						insertNewRecord(transition, Object.keys(object), objectOffset, 0);
+				}
+			} :
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let newTransitions = 0;
+				for (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					nextTransition = transition[key];
+					if (!nextTransition) {
+						nextTransition = transition[key] = Object.create(null);
+						newTransitions++;
+					}
+					transition = nextTransition;
+				}
+				let recordId = transition[RECORD_SYMBOL];
+				if (recordId) {
+					if (recordId >= 0x60 && useTwoByteRecords) {
+						target[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;
+						target[position++] = recordId >> 5;
+					} else
+						target[position++] = recordId;
+				} else {
+					newRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);
+				}
+				// now write the values
+				for (let key in object)
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(object[key]);
+					}
+			};
+
+			// create reference to useRecords if useRecords is a function
+			const checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;
+
+			const writeObject = checkUseRecords ? (object) => {
+				checkUseRecords(object) ? writeRecord(object) : writePlainObject(object);
+			} : writeRecord;
+
+			const writeStruct = (object) => {
+				let newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {
+					if (notifySharedUpdate)
+						return hasSharedUpdate = true;
+					position = newPosition;
+					let startTarget = target;
+					pack(value);
+					resetStructures();
+					if (startTarget !== target) {
+						return { position, targetView, target }; // indicate the buffer was re-allocated
+					}
+					return position;
+				});
+				if (newPosition === 0) // bail and go to a msgpack object
+					return writeObject(object);
+				position = newPosition;
+			};
+
+			const makeRoom = (end) => {
+				let newSize;
+				if (end > 0x1000000) {
+					// special handling for really large buffers
+					if ((end - start) > MAX_BUFFER_SIZE)
+						throw new Error('Packed buffer would be larger than maximum buffer size');
+					newSize = Math.min(MAX_BUFFER_SIZE,
+						Math.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);
+				} else // faster handling for smaller buffers
+					newSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;
+				let newBuffer = new ByteArrayAllocate(newSize);
+				targetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));
+				end = Math.min(end, target.length);
+				if (target.copy)
+					target.copy(newBuffer, 0, start, end);
+				else
+					newBuffer.set(target.slice(start, end));
+				position -= start;
+				start = 0;
+				safeEnd = newBuffer.length - 10;
+				return target = newBuffer;
+			};
+			const newRecord = (transition, keys, newTransitions) => {
+				let recordId = structures.nextId;
+				if (!recordId)
+					recordId = 0x40;
+				if (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {
+					recordId = structures.nextOwnId;
+					if (!(recordId < maxStructureId))
+						recordId = sharedLimitId;
+					structures.nextOwnId = recordId + 1;
+				} else {
+					if (recordId >= maxStructureId)// cycle back around
+						recordId = sharedLimitId;
+					structures.nextId = recordId + 1;
+				}
+				let highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;
+				transition[RECORD_SYMBOL] = recordId;
+				transition.__keys__ = keys;
+				structures[recordId - 0x40] = keys;
+
+				if (recordId < sharedLimitId) {
+					keys.isShared = true;
+					structures.sharedLength = recordId - 0x3f;
+					hasSharedUpdate = true;
+					if (highByte >= 0) {
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = recordId;
+					}
+				} else {
+					if (highByte >= 0) {
+						target[position++] = 0xd5; // fixext 2
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = 0xd4; // fixext 1
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = recordId;
+					}
+
+					if (newTransitions)
+						transitionsCount += serializationsSinceTransitionRebuild * newTransitions;
+					// record the removal of the id, we can maintain our shared structure
+					if (recordIdsToRemove.length >= maxOwnStructures)
+						recordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones
+					recordIdsToRemove.push(transition);
+					pack(keys);
+				}
+			};
+			const insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {
+				let mainTarget = target;
+				let mainPosition = position;
+				let mainSafeEnd = safeEnd;
+				let mainStart = start;
+				target = keysTarget;
+				position = 0;
+				start = 0;
+				if (!target)
+					keysTarget = target = new ByteArrayAllocate(8192);
+				safeEnd = target.length - 10;
+				newRecord(transition, keys, newTransitions);
+				keysTarget = target;
+				let keysPosition = position;
+				target = mainTarget;
+				position = mainPosition;
+				safeEnd = mainSafeEnd;
+				start = mainStart;
+				if (keysPosition > 1) {
+					let newEnd = position + keysPosition - 1;
+					if (newEnd > safeEnd)
+						makeRoom(newEnd);
+					let insertionPosition = insertionOffset + start;
+					target.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);
+					target.set(keysTarget.slice(0, keysPosition), insertionPosition);
+					position = newEnd;
+				} else {
+					target[insertionOffset + start] = keysTarget[0];
+				}
+			};
+		}
+		useBuffer(buffer) {
+			// this means we are finished using our own buffer and we can write over it safely
+			target = buffer;
+			target.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));
+			targetView = target.dataView;
+			position = 0;
+		}
+		set position (value) {
+			position = value;
+		}
+		get position() {
+			return position;
+		}
+		clearSharedData() {
+			if (this.structures)
+				this.structures = [];
+			if (this.typedStructs)
+				this.typedStructs = [];
+		}
+	}
+
+	extensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];
+	extensions = [{
+		pack(date, allocateForWrite, pack) {
+			let seconds = date.getTime() / 1000;
+			if ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {
+				// Timestamp 32
+				let { target, targetView, position} = allocateForWrite(6);
+				target[position++] = 0xd6;
+				target[position++] = 0xff;
+				targetView.setUint32(position, seconds);
+			} else if (seconds > 0 && seconds < 0x100000000) {
+				// Timestamp 64
+				let { target, targetView, position} = allocateForWrite(10);
+				target[position++] = 0xd7;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));
+				targetView.setUint32(position + 4, seconds);
+			} else if (isNaN(seconds)) {
+				if (this.onInvalidDate) {
+					allocateForWrite(0);
+					return pack(this.onInvalidDate());
+				}
+				// Intentionally invalid timestamp
+				let { target, targetView, position} = allocateForWrite(3);
+				target[position++] = 0xd4;
+				target[position++] = 0xff;
+				target[position++] = 0xff;
+			} else {
+				// Timestamp 96
+				let { target, targetView, position} = allocateForWrite(15);
+				target[position++] = 0xc7;
+				target[position++] = 12;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 1000000);
+				targetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));
+			}
+		}
+	}, {
+		pack(set, allocateForWrite, pack) {
+			if (this.setAsEmptyObject) {
+				allocateForWrite(0);
+				return pack({});
+			}
+			let array = Array.from(set);
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x73; // 's' for Set
+				target[position++] = 0;
+			}
+			pack(array);
+		}
+	}, {
+		pack(error, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x65; // 'e' for error
+				target[position++] = 0;
+			}
+			pack([ error.name, error.message, error.cause ]);
+		}
+	}, {
+		pack(regex, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x78; // 'x' for regeXp
+				target[position++] = 0;
+			}
+			pack([ regex.source, regex.flags ]);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x10, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(typedArray, allocateForWrite) {
+			let constructor = typedArray.constructor;
+			if (constructor !== ByteArray && this.moreTypes)
+				writeExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);
+			else
+				writeBuffer(typedArray, allocateForWrite);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x11, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(c1, allocateForWrite) { // specific 0xC1 object
+			let { target, position} = allocateForWrite(1);
+			target[position] = 0xc1;
+		}
+	}];
+
+	function writeExtBuffer(typedArray, type, allocateForWrite, encode) {
+		let length = typedArray.byteLength;
+		if (length + 1 < 0x100) {
+			var { target, position } = allocateForWrite(4 + length);
+			target[position++] = 0xc7;
+			target[position++] = length + 1;
+		} else if (length + 1 < 0x10000) {
+			var { target, position } = allocateForWrite(5 + length);
+			target[position++] = 0xc8;
+			target[position++] = (length + 1) >> 8;
+			target[position++] = (length + 1) & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(7 + length);
+			target[position++] = 0xc9;
+			targetView.setUint32(position, length + 1); // plus one for the type byte
+			position += 4;
+		}
+		target[position++] = 0x74; // "t" for typed array
+		target[position++] = type;
+		if (!typedArray.buffer) typedArray = new Uint8Array(typedArray);
+		target.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);
+	}
+	function writeBuffer(buffer, allocateForWrite) {
+		let length = buffer.byteLength;
+		var target, position;
+		if (length < 0x100) {
+			var { target, position } = allocateForWrite(length + 2);
+			target[position++] = 0xc4;
+			target[position++] = length;
+		} else if (length < 0x10000) {
+			var { target, position } = allocateForWrite(length + 3);
+			target[position++] = 0xc5;
+			target[position++] = length >> 8;
+			target[position++] = length & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(length + 5);
+			target[position++] = 0xc6;
+			targetView.setUint32(position, length);
+			position += 4;
+		}
+		target.set(buffer, position);
+	}
+
+	function writeExtensionData(result, target, position, type) {
+		let length = result.length;
+		switch (length) {
+			case 1:
+				target[position++] = 0xd4;
+				break;
+			case 2:
+				target[position++] = 0xd5;
+				break;
+			case 4:
+				target[position++] = 0xd6;
+				break;
+			case 8:
+				target[position++] = 0xd7;
+				break;
+			case 16:
+				target[position++] = 0xd8;
+				break;
+			default:
+				if (length < 0x100) {
+					target[position++] = 0xc7;
+					target[position++] = length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xc8;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xc9;
+					target[position++] = length >> 24;
+					target[position++] = (length >> 16) & 0xff;
+					target[position++] = (length >> 8) & 0xff;
+					target[position++] = length & 0xff;
+				}
+		}
+		target[position++] = type;
+		target.set(result, position);
+		position += length;
+		return position;
+	}
+
+	function insertIds(serialized, idsToInsert) {
+		// insert the ids that need to be referenced for structured clones
+		let nextId;
+		let distanceToMove = idsToInsert.length * 6;
+		let lastEnd = serialized.length - distanceToMove;
+		while (nextId = idsToInsert.pop()) {
+			let offset = nextId.offset;
+			let id = nextId.id;
+			serialized.copyWithin(offset + distanceToMove, offset, lastEnd);
+			distanceToMove -= 6;
+			let position = offset + distanceToMove;
+			serialized[position++] = 0xd6;
+			serialized[position++] = 0x69; // 'i'
+			serialized[position++] = id >> 24;
+			serialized[position++] = (id >> 16) & 0xff;
+			serialized[position++] = (id >> 8) & 0xff;
+			serialized[position++] = id & 0xff;
+			lastEnd = offset;
+		}
+		return serialized;
+	}
+
+	function writeBundles(start, pack, incrementPosition) {
+		if (bundledStrings.length > 0) {
+			targetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);
+			bundledStrings.stringsPosition = position - start;
+			let writeStrings = bundledStrings;
+			bundledStrings = null;
+			pack(writeStrings[0]);
+			pack(writeStrings[1]);
+		}
+	}
+
+	function addExtension(extension) {
+		if (extension.Class) {
+			if (!extension.pack && !extension.write)
+				throw new Error('Extension has no pack or write function');
+			if (extension.pack && !extension.type)
+				throw new Error('Extension has no type (numeric code to identify the extension)');
+			extensionClasses.unshift(extension.Class);
+			extensions.unshift(extension);
+		}
+		addExtension$1(extension);
+	}
+	function prepareStructures(structures, packr) {
+		structures.isCompatible = (existingStructures) => {
+			let compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);
+			if (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction
+				packr._mergeStructures(existingStructures);
+			return compatible;
+		};
+		return structures;
+	}
+
+	// Marker for downstream libraries (e.g. structon) to detect that this Packr
+	// supports per-instance struct-encoding hooks (this._writeStruct,
+	// this._prepareStructures).  See `pack` for the dispatch.
+	Packr.SUPPORTS_STRUCT_HOOKS = true;
+
+	let defaultPackr = new Packr({ useRecords: false });
+	const pack = defaultPackr.pack;
+	const encode = defaultPackr.pack;
+	const Encoder = Packr;
+	const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;
+	const REUSE_BUFFER_MODE = 512;
+	const RESET_BUFFER_MODE = 1024;
+	const RESERVE_START_SPACE = 2048;
+
+	/**
+	 * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
+	 * If the argument is only Async Iterable, the return value will be an Async Iterable.
+	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object
+	 * @param {options} [options] - msgpackr pack options
+	 * @returns {IterableIterator|Promise.<AsyncIterableIterator>}
+	 */
+	function packIter (objectIterator, options = {}) {
+	  if (!objectIterator || typeof objectIterator !== 'object') {
+	    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');
+	  } else if (typeof objectIterator[Symbol.iterator] === 'function') {
+	    return packIterSync(objectIterator, options);
+	  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {
+	    return packIterAsync(objectIterator, options);
+	  } else {
+	    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');
+	  }
+	}
+
+	function * packIterSync (objectIterator, options) {
+	  const packr = new Packr(options);
+	  for (const value of objectIterator) {
+	    yield packr.pack(value);
+	  }
+	}
+
+	async function * packIterAsync (objectIterator, options) {
+	  const packr = new Packr(options);
+	  for await (const value of objectIterator) {
+	    yield packr.pack(value);
+	  }
+	}
+
+	/**
+	 * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
+	 * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
+	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
+	 * @param {object} [options] - unpackr options
+	 * @returns {IterableIterator|Promise.<AsyncIterableIterator}
+	 */
+	function unpackIter (bufferIterator, options = {}) {
+	  if (!bufferIterator || typeof bufferIterator !== 'object') {
+	    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');
+	  }
+
+	  const unpackr = new Unpackr(options);
+	  let incomplete;
+	  const parser = (chunk) => {
+	    let yields;
+	    // if there's incomplete data from previous chunk, concatinate and try again
+	    if (incomplete) {
+	      chunk = Buffer.concat([incomplete, chunk]);
+	      incomplete = undefined;
+	    }
+
+	    try {
+	      yields = unpackr.unpackMultiple(chunk);
+	    } catch (err) {
+	      if (err.incomplete) {
+	        incomplete = chunk.slice(err.lastPosition);
+	        yields = err.values;
+	      } else {
+	        throw err;
+	      }
+	    }
+	    return yields;
+	  };
+
+	  if (typeof bufferIterator[Symbol.iterator] === 'function') {
+	    return (function * iter () {
+	      for (const value of bufferIterator) {
+	        yield * parser(value);
+	      }
+	    })();
+	  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {
+	    return (async function * iter () {
+	      for await (const value of bufferIterator) {
+	        yield * parser(value);
+	      }
+	    })();
+	  }
+	}
+	const decodeIter = unpackIter;
+	const encodeIter = packIter;
+
+	const useRecords = false;
+	const mapsAsObjects = true;
+
+	exports.ALWAYS = ALWAYS;
+	exports.C1 = C1;
+	exports.DECIMAL_FIT = DECIMAL_FIT;
+	exports.DECIMAL_ROUND = DECIMAL_ROUND;
+	exports.Decoder = Decoder;
+	exports.Encoder = Encoder;
+	exports.FLOAT32_OPTIONS = FLOAT32_OPTIONS;
+	exports.NEVER = NEVER;
+	exports.Packr = Packr;
+	exports.RESERVE_START_SPACE = RESERVE_START_SPACE;
+	exports.RESET_BUFFER_MODE = RESET_BUFFER_MODE;
+	exports.REUSE_BUFFER_MODE = REUSE_BUFFER_MODE;
+	exports.Unpackr = Unpackr;
+	exports.addExtension = addExtension;
+	exports.clearSource = clearSource;
+	exports.decode = decode;
+	exports.decodeIter = decodeIter;
+	exports.encode = encode;
+	exports.encodeIter = encodeIter;
+	exports.isNativeAccelerationEnabled = isNativeAccelerationEnabled;
+	exports.mapsAsObjects = mapsAsObjects;
+	exports.pack = pack;
+	exports.roundFloat32 = roundFloat32;
+	exports.unpack = unpack;
+	exports.unpackMultiple = unpackMultiple;
+	exports.useRecords = useRecords;
+
+}));
+//# sourceMappingURL=index-no-eval.cjs.map
diff --git a/node_modules/msgpackr/dist/index-no-eval.cjs.map b/node_modules/msgpackr/dist/index-no-eval.cjs.map
new file mode 100644
index 0000000..2522140
--- /dev/null
+++ b/node_modules/msgpackr/dist/index-no-eval.cjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"index-no-eval.cjs","sources":["../unpack.js","../pack.js","../iterators.js","../index.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","import { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\n\n/**\n * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer\n * If the argument is only Async Iterable, the return value will be an Async Iterable.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object\n * @param {options} [options] - msgpackr pack options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator>}\n */\nexport function packIter (objectIterator, options = {}) {\n  if (!objectIterator || typeof objectIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');\n  } else if (typeof objectIterator[Symbol.iterator] === 'function') {\n    return packIterSync(objectIterator, options);\n  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {\n    return packIterAsync(objectIterator, options);\n  } else {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');\n  }\n}\n\nfunction * packIterSync (objectIterator, options) {\n  const packr = new Packr(options);\n  for (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\nasync function * packIterAsync (objectIterator, options) {\n  const packr = new Packr(options);\n  for await (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\n/**\n * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects\n * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator\n * @param {object} [options] - unpackr options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator}\n */\nexport function unpackIter (bufferIterator, options = {}) {\n  if (!bufferIterator || typeof bufferIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');\n  }\n\n  const unpackr = new Unpackr(options);\n  let incomplete;\n  const parser = (chunk) => {\n    let yields;\n    // if there's incomplete data from previous chunk, concatinate and try again\n    if (incomplete) {\n      chunk = Buffer.concat([incomplete, chunk]);\n      incomplete = undefined;\n    }\n\n    try {\n      yields = unpackr.unpackMultiple(chunk);\n    } catch (err) {\n      if (err.incomplete) {\n        incomplete = chunk.slice(err.lastPosition);\n        yields = err.values;\n      } else {\n        throw err;\n      }\n    }\n    return yields;\n  };\n\n  if (typeof bufferIterator[Symbol.iterator] === 'function') {\n    return (function * iter () {\n      for (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {\n    return (async function * iter () {\n      for await (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  }\n}\nexport const decodeIter = unpackIter;\nexport const encodeIter = packIter;","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\n"],"names":["position","bundledStrings","addExtension","unpackAddExtension"],"mappings":";;;;;;CAAA,IAAI,OAAO,CAAC;CACZ,IAAI;CACJ,CAAC,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;CAC7B,CAAC,CAAC,MAAM,KAAK,EAAE,EAAE;CACjB,IAAI,GAAG,CAAC;CACR,IAAI,MAAM,CAAC;CACX,IAAIA,UAAQ,GAAG,CAAC,CAAC;CAKjB,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,iBAAiB,CAAC;CACtB,IAAI,SAAS,CAAC;CACd,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,YAAY,GAAG,CAAC,CAAC;CACrB,IAAIC,gBAAc,CAAC;CACnB,IAAI,YAAY,CAAC;CACjB,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI,QAAQ,CAAC;CACb,IAAI,cAAc,GAAG;CACrB,CAAC,UAAU,EAAE,KAAK;CAClB,CAAC,aAAa,EAAE,IAAI;CACpB,CAAC,CAAC;CACK,MAAM,MAAM,CAAC,EAAE;AACV,OAAC,EAAE,GAAG,IAAI,MAAM,GAAG;CAC/B,EAAE,CAAC,IAAI,GAAG,kBAAkB,CAAC;CAC7B,IAAI,cAAc,GAAG,KAAK,CAAC;CAC3B,IAAI,yBAAyB,GAAG,CAAC,CAAC;CAClC,IAAI,eAAe,CAAC;AACpB;CACO,MAAM,OAAO,CAAC;CACrB,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,IAAI,OAAO,EAAE;CACf,GAAG,IAAI,OAAO,CAAC,UAAU,KAAK,KAAK,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;CAC1E,IAAI,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;CACjC,GAAG,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE;CACxD,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK,EAAE;CAC5D,KAAK,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;CAC7B,KAAK,IAAI,CAAC,OAAO,CAAC,mBAAmB;CACrC,MAAM,OAAO,CAAC,mBAAmB,GAAG,CAAC,CAAC;CACtC,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,UAAU;CACzB,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;CAChE,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE;CACnC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,CAAC;CACnD,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,aAAa,EAAE;CAC9B,IAAI,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,GAAG;CACH,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CAC/B,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,IAAI,GAAG,EAAE;CACX;CACA,GAAG,OAAO,SAAS,CAAC,MAAM;CAC1B,IAAI,WAAW,EAAE,CAAC;CAClB,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAChH,IAAI,CAAC,CAAC;CACN,GAAG;CACH,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;CAC1D,GAAG,MAAM,GAAG,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;CACzF,EAAE,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;CACnC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC;CACzC,GAAGD,UAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;CACjC,GAAG,MAAM;CACT,GAAGA,UAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;CACnD,GAAG;CAEH,EAAE,YAAY,GAAG,CAAC,CAAC;CACnB,EAAE,SAAS,GAAG,IAAI,CAAC;CAEnB,EAAEC,gBAAc,GAAG,IAAI,CAAC;CACxB,EAAE,GAAG,GAAG,MAAM,CAAC;CACf;CACA;CACA;CACA,EAAE,IAAI;CACN,GAAG,QAAQ,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CACvH,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB;CACA,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,MAAM,YAAY,UAAU;CACnC,IAAI,MAAM,KAAK,CAAC;CAChB,GAAG,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC;CAC3J,GAAG;CACH,EAAE,IAAI,IAAI,YAAY,OAAO,EAAE;CAC/B,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC;CACxC,IAAI,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAChC,IAAI,MAAM,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;CAClE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,cAAc,GAAG,cAAc,CAAC;CACnC,GAAG,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACzD,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;CACjC,EAAE,IAAI,MAAM,EAAE,YAAY,GAAG,CAAC,CAAC;CAC/B,EAAE,IAAI;CACN,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;CACtF,GAAG,IAAI,OAAO,EAAE;CAChB,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,YAAY,EAAED,UAAQ,CAAC,KAAK,KAAK,EAAE,OAAO;CACjE,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,YAAY,EAAEA,UAAQ,CAAC,KAAK,KAAK,EAAE;CACnE,MAAM,OAAO;CACb,MAAM;CACN,KAAK;CACL,IAAI;CACJ,QAAQ;CACR,IAAI,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC;CACvB,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CAChC,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB,GAAG,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC;CACrC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CACzB,GAAG,MAAM,KAAK,CAAC;CACf,GAAG,SAAS;CACZ,GAAG,cAAc,GAAG,KAAK,CAAC;CAC1B,GAAG,WAAW,EAAE,CAAC;CACjB,GAAG;CACH,EAAE;CACF,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE;CACxD,EAAE,IAAI,IAAI,CAAC,mBAAmB;CAC9B,GAAG,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;CACjE,EAAE,gBAAgB,GAAG,gBAAgB,IAAI,EAAE,CAAC;CAC5C,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;CACvC,GAAG,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC3D,GAAG,IAAI,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvC,GAAG,IAAI,SAAS,EAAE;CAClB,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,IAAI,IAAI,CAAC,IAAI,EAAE;CACf,KAAK,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG;CACH,EAAE,gBAAgB,CAAC,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC;CAC1D,EAAE,KAAK,IAAI,EAAE,IAAI,kBAAkB,IAAI,EAAE,EAAE;CAC3C,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE;CAChB,IAAI,IAAI,SAAS,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CACzC,IAAI,IAAI,QAAQ,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;CAC1C,IAAI,IAAI,QAAQ,EAAE;CAClB,KAAK,IAAI,SAAS;CAClB,MAAM,CAAC,gBAAgB,CAAC,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC;CACxG,KAAK,gBAAgB,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;CACrC,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,OAAO,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;CAC5C,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC,EAAE;CACF,CAAC;CAIM,SAAS,WAAW,CAAC,OAAO,EAAE;CACrC,CAAC,IAAI;CACL,EAAE,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE;CAClD,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,YAAY,IAAI,CAAC,CAAC;CAC1D,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,MAAM;CAC9C,IAAI,iBAAiB,CAAC,MAAM,GAAG,YAAY,CAAC;CAC5C,GAAG;CACH,EAAE,IAAI,MAAM,CAAC;CACb,EAAE,IAAI,cAAc,CAAC,WAAW,IAAI,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,CAACA,UAAQ,CAAC,IAAI,IAAI,EAAE;CACnF,GAAG,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAEA,UAAQ,EAAE,MAAM,CAAC,CAAC;CAC9D,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM;CAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;CAC7B,GAAGA,UAAQ,GAAG,MAAM,CAAC;CACrB,GAAG;CACH,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;CACnB,EAAE,IAAIC,gBAAc,EAAE;CACtB,GAAGD,UAAQ,GAAGC,gBAAc,CAAC,kBAAkB,CAAC;CAChD,GAAGA,gBAAc,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,cAAc;CACpB;CACA;CACA,GAAG,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC9C;CACA,EAAE,IAAID,UAAQ,IAAI,MAAM,EAAE;CAC1B;CACA,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC/D,IAAI,iBAAiB,EAAE,CAAC;CACxB,GAAG,iBAAiB,GAAG,IAAI,CAAC;CAC5B,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,YAAY;CACnB,IAAI,YAAY,GAAG,IAAI,CAAC;CACxB,GAAG,MAAM,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChC;CACA,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE;CAC9B,GAAG,IAAI,QAAQ,CAAC;CAChB,GAAG,IAAI;CACP,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;CACnH,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,QAAQ,GAAG,2BAA2B,GAAG,KAAK,GAAG,GAAG,CAAC;CACzD,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG;CACH;CACA,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,CAAC,MAAM,KAAK,EAAE;CAChB,EAAE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC9D,GAAG,iBAAiB,EAAE,CAAC;CACvB,EAAE,WAAW,EAAE,CAAC;CAChB,EAAE,IAAI,KAAK,YAAY,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChH,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC3B,GAAG;CACH,EAAE,MAAM,KAAK,CAAC;CACd,EAAE;CACF,CAAC;AACD;CACA,SAAS,iBAAiB,GAAG;CAC7B,CAAC,KAAK,IAAI,EAAE,IAAI,iBAAiB,CAAC,iBAAiB,EAAE;CACrD,EAAE,iBAAiB,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAClE,EAAE;CACF,CAAC,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC5C,CAAC;AACD;CACO,SAAS,IAAI,GAAG;CACvB,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE;CACpB,GAAG,IAAI,KAAK,GAAG,IAAI;CACnB,IAAI,OAAO,KAAK,CAAC;CACjB,QAAQ;CACR,IAAI,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC;CACnD,KAAK,cAAc,CAAC,aAAa,IAAI,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CACpE,IAAI,IAAI,SAAS,EAAE;CACnB,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;CAC1B,MAAM,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;CACtE,MAAM;CACN,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC7B,KAAK;CACL,KAAK,OAAO,KAAK,CAAC;CAClB,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC3B;CACA,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,cAAc,CAAC,aAAa,EAAE;CACrC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC;CACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACzB,KAAK,IAAI,GAAG,KAAK,WAAW;CAC5B,MAAM,GAAG,GAAG,UAAU,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CAC1B,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC7B,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACnC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACtB,IAAI;CACJ,GAAG,IAAI,cAAc,CAAC,UAAU;CAChC,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,OAAO,KAAK,CAAC;CAChB,GAAG;CACH,EAAE,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC1B;CACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CAC5B,EAAE,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAChC,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,GAAG;CACH,EAAE,IAAI,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;CACzC;CACA,GAAG,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC/E,GAAG,IAAI,MAAM,IAAI,IAAI;CACrB,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG;CACH,EAAE,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CACjC,EAAE,MAAM;CACR,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,QAAQ,KAAK;CACf,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,IAAIC,gBAAc,EAAE;CACxB,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;CACpB,KAAK,IAAI,KAAK,GAAG,CAAC;CAClB,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG;CACA,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG,KAAK;CACL,IAAI,OAAO,EAAE,CAAC;CACd,GAAG,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC;CAC3B,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACD,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,KAAK,SAAS;CAC3B,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CACjD,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACpC,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAI,IAAI,cAAc,CAAC,UAAU,GAAG,CAAC,EAAE;CACvC;CACA,KAAK,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACvF,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAChF,KAAK;CACL,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACxD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACxD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC3D,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,QAAQ,CAAC,OAAO,CAACA,UAAQ,EAAE,CAAC,CAAC;CACxC,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACvD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACvD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC1F,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;CACrD,KAAK,MAAM;CACX,KAAK,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;CAC9C,KAAK,IAAI,SAAS,EAAE;CACpB,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE;CAC1B,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACrC,OAAO,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;CACrC,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,EAAE,CAAC;CAC1B,OAAO;CACP,OAAO,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,EAAEA,UAAQ,CAAC,CAAC,CAAC;CAC5D,MAAM;CACN,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC;CACpD,KAAK;CACL,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAKA,UAAQ,EAAE,CAAC;CAChB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG;CACH,IAAI,IAAI,KAAK,IAAI,IAAI;CACrB,KAAK,OAAO,KAAK,GAAG,KAAK,CAAC;CAC1B,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;CAC7B,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACjE,KAAK,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC7B,KAAK,MAAM,KAAK,CAAC;CACjB,KAAK;CACL,IAAI,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,CAAC;AAC1D;CACA,GAAG;CACH,EAAE;CACF,CAAC;CACD,MAAM,SAAS,GAAG,2BAA2B,CAAC;CAC9C,SAAS,qBAAqB,CAAC,SAAS,EAAE,OAAO,EAAE;CACnD,CAAC,SAAS,UAAU,GAAG;CACvB;CACA,EAAE,IAAI,UAAU,CAAC,KAAK,EAAE,GAAG,yBAAyB,EAAE;CACtD,GAAG,IAAI,mBAAmB,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,mBAAmB,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,eAAQ,EAAC,GAAG,EAAE,2BAA2B,IAAI,cAAc,CAAC,UAAU,GAAG,eAAe,GAAG,EAAE,CAAC;CAC9I,KAAK,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,WAAW,GAAG,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;CAC9K,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB;CACA,IAAI,yBAAyB,GAAG,QAAQ,CAAC;CACzC,IAAI,OAAO,UAAU,EAAE,CAAC;CACxB,IAAI;CACJ,GAAG,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC;CAC/B,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACrE,GAAG,OAAO,mBAAmB,EAAE,CAAC;CAChC,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACpD,GAAG,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;CAC1B,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,IAAI,cAAc,CAAC,UAAU;CAC/B,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAChC,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE;CACF,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;CACtB,CAAC,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC,EAAE;CAC/B,EAAE,OAAO,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;CACrD,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,MAAM,sBAAsB,GAAG,CAAC,OAAO,EAAE,KAAK,KAAK;CACnD,CAAC,OAAO,WAAW;CACnB,EAAE,IAAI,QAAQ,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CACjC,EAAE,IAAI,QAAQ,KAAK,CAAC;CACpB,GAAG,OAAO,KAAK,EAAE,CAAC;CAClB,EAAE,IAAI,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC;CACnF,EAAE,IAAI,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;CAChE,EAAE,IAAI,CAAC,SAAS,EAAE;CAClB,GAAG,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;CACzD,GAAG;CACH,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;CACrB,GAAG,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;CAC9D,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC1B,EAAE,CAAC;CACH,CAAC,CAAC;AACF;CACO,SAAS,cAAc,GAAG;CACjC,CAAC,IAAI,gBAAgB,GAAG,SAAS,CAAC,MAAM;CACxC;CACA,EAAE,GAAG,GAAG,IAAI,CAAC;CACb,EAAE,OAAO,cAAc,CAAC,aAAa,EAAE,CAAC;CACxC,EAAE,CAAC,CAAC;CACJ,CAAC,OAAO,iBAAiB,GAAG,cAAc,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;CACjG,CAAC;AACD;CACA,IAAI,eAAe,GAAG,YAAY,CAAC;CACnC,IAAI,WAAW,GAAG,YAAY,CAAC;CAC/B,IAAI,YAAY,GAAG,YAAY,CAAC;CAChC,IAAI,YAAY,GAAG,YAAY,CAAC;AACtB,KAAC,2BAA2B,GAAG,MAAM;CAyC/C,SAAS,YAAY,CAAC,MAAM,EAAE;CAC9B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE;CAClB,EAAE,IAAI,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;CACtC,GAAG,OAAO,MAAM,CAAC;CACjB,EAAE;CACF,CAAC,IAAI,MAAM,GAAG,EAAE,IAAI,OAAO;CAC3B,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC,CAAC;CACpE,CAAC,MAAM,GAAG,GAAGA,UAAQ,GAAG,MAAM,CAAC;CAC/B,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;CAClB,CAAC,MAAM,GAAG,EAAE,CAAC;CACb,CAAC,OAAOA,UAAQ,GAAG,GAAG,EAAE;CACxB,EAAE,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAChC,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE;CAC5B;CACA,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrB,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;CACnD;CACA,GAAG,IAAI,SAAS,GAAG,IAAI,EAAE;CACzB,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;CACnE;CACA;CACA,GAAG,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;CAC1E,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;CACnF;CACA;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,QAAQ,EAAE;CAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,EAAE;CAC7B,IAAI,IAAI,IAAI,OAAO,CAAC;CACpB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC;CACjD,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;CACnC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtB,GAAG;AACH;CACA,EAAE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE;CAC9B,GAAG,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC/C,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;CACpB,GAAG;CACH,EAAE;AACF;CACA,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;CACvB,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC9C,EAAE;AACF;CACA,CAAC,OAAO,MAAM,CAAC;CACf,CAAC;AAWD;CACA,SAAS,SAAS,CAAC,MAAM,EAAE;CAC3B,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACpB,EAAE;CACF,CAAC,IAAI,cAAc,CAAC,UAAU;CAC9B,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;AACD;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,cAAc,CAAC,aAAa,EAAE;CACnC,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACvB,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,MAAM;CACR,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,GAAG,CAAC;CACb,EAAE;CACF,CAAC;AACD;CACA,IAAI,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;CACvC,SAAS,cAAc,CAAC,MAAM,EAAE;CAChC,CAAC,IAAI,KAAK,GAAGA,UAAQ,CAAC;CACtB,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,MAAM,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC/B,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,IAAIA,UAAQ,GAAG,KAAK,CAAC;CACrB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;CACnB,GAAG;CACH,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,CAAC;CACD,SAAS,eAAe,CAAC,MAAM,EAAE;CACjC,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;CACjB,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,EAAE,CAAC;CACd,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAChC,GAAG;CACH,EAAE,MAAM;CACR,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC5E,GAAGA,UAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,OAAO;CACV,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpC,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,IAAI;CACJ,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;CACzB,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC1C,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC7E,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,EAAE,EAAE;CACpB,IAAI,IAAI,MAAM,KAAK,CAAC;CACpB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjD,SAAS;CACT,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpD,KAAK;CACL,IAAI,MAAM,IAAI,MAAM,GAAG,EAAE,EAAE;CAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1C,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE;CACnB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvD,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzD,IAAI,MAAM;CACV,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC9E,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE;CACrB,KAAK,IAAI,MAAM,KAAK,EAAE;CACtB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9D,UAAU;CACV,MAAM,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1B,OAAOA,UAAQ,IAAI,EAAE,CAAC;CACtB,OAAO,OAAO;CACd,OAAO;CACP,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjE,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC3C,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,IAAI,MAAM,GAAG,EAAE;CACpB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpE,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE;CACF,CAAC;AACD;CACA,SAAS,gBAAgB,GAAG;CAC5B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CACxB,EAAE,MAAM;CACR,EAAE,OAAO,KAAK;CACd,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG;CACH,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;CACvC,GAAG;CACH,EAAE;CACF,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CAC7B,CAAC;AACD;AACA;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,OAAO,cAAc,CAAC,WAAW;CAClC;CACA,EAAE,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAEA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC;CACpE,EAAE,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC;CAC7C,CAAC;CACD,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE;CAC9B,EAAE,IAAI,GAAG,CAAC;CACV,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,GAAG,IAAIA,UAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK;CACvG,GAAGA,UAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,OAAO,IAAI,EAAE,CAAC;CAClB,IAAI,SAAS;CACb,IAAIA,UAAQ,GAAG,GAAG,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE;CACF;CACA,EAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,IAAI,CAAC,CAAC;CACpD,CAAC;AACD;CACA,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;CAC/B,SAAS,OAAO,GAAG;CACnB,CAAC,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACtC;CACA,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACzB,EAAE,IAAI,YAAY,IAAIA,UAAQ;CAC9B,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,OAAO,IAAI,EAAE,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC;CAC/C,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CAClC,EAAE,MAAM;CACR,EAAEA,UAAQ,EAAE,CAAC;CACb,EAAE,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,CAACA,UAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAClH,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;CAC3B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAC9B,CAAC,IAAI,GAAG,GAAGA,UAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;CACjC,CAAC,IAAI,KAAK,CAAC;CACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACX,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,EAAE;CACrC,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC7C,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG,aAAa,IAAI,CAAC,CAAC;CACtB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAChC,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG;CACH,EAAE,IAAI,aAAa,KAAK,GAAG,EAAE;CAC7B,GAAGA,UAAQ,GAAG,aAAa,CAAC;CAC5B,GAAG,OAAO,KAAK,CAAC,MAAM,CAAC;CACvB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,aAAa,GAAGA,UAAQ,CAAC;CAC3B,EAAE;CACF,CAAC,KAAK,GAAG,EAAE,CAAC;CACZ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;CACvB,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;CACtB,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC5C,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE,aAAa,IAAI,CAAC,CAAC;CACrB,EAAE;CACF,CAAC,GAAG,IAAI,CAAC,CAAC;CACV,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAC/B,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE;CACF;CACA,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC7E,CAAC,IAAI,MAAM,IAAI,IAAI;CACnB,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CAC/B,CAAC,OAAO,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;CAC/C,CAAC;AACD;CACA,SAAS,YAAY,CAAC,QAAQ,EAAE;CAChC;CACA,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC;CACnD,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,SAAS,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAC;CAC/H,CAAC,IAAI,QAAQ,IAAI,IAAI,EAAE,OAAO,QAAQ,GAAG,EAAE,CAAC;CAC5C,CAAC,IAAI,cAAc,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE;CACvK,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;CACpC,EAAE;CACF,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,kCAAkC,EAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC;CACD;CACA,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK;CAC3C,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CAC1C;CACA,CAAC,IAAI,SAAS,GAAG,EAAE,CAAC;CACpB,CAAC,IAAI,QAAQ,KAAK,SAAS,EAAE;CAC7B,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CAClE,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;CAChC,EAAE;CACF,CAAC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAC/C;CACA;CACA;CACA,CAAC,IAAI,iBAAiB,KAAK,iBAAiB,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE;CAC1E,EAAE,CAAC,iBAAiB,CAAC,iBAAiB,KAAK,iBAAiB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAC;CAC9G,EAAE;CACF,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;CACnC,CAAC,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;CAC9D,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CACzB,CAAC,CAAC;CACF,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;CAChC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;AACrC;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;CAClC,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;CAC7C,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC/D,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACtC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;CACrB,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1B,EAAE;CACF,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;CACrC,EAAE,IAAI,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACzE,EAAE,IAAI,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,MAAM,IAAI,EAAE,EAAE;CACrB,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;CACvC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;CAC7C,KAAK,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CACxB,KAAK,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CACjC,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ;CACA,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;CAC3C,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACnC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;CACvD,GAAG,CAAC;CACJ,EAAE,IAAI,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACpG,EAAE;CACF,CAAC,OAAO,IAAI,CAAC;CACb,CAAC,CAAC;AACF;CACA,IAAI,MAAM,GAAG;CACb,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,cAAc,KAAK,UAAU,GAAG,cAAc,GAAG,IAAI;CAC7J,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;CACvB,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACjD,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,EAAE,OAAO,KAAK,CAAC;CACf,EAAE;CACF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACrD,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,CAAC,YAAY;CAClB,EAAE,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;CAC3B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC3B,CAAC,IAAI,MAAM,CAAC;CACZ;CACA,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACpE,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACzE,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,KAAK,IAAI;CAC1G,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB;CACA,EAAE,MAAM,GAAG,EAAE,CAAC;AACd;CACA,CAAC,IAAI,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;CAChC,CAAC,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;CAC/B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;CACrB;CACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CAC5C,EAAE,MAAM;CACR;CACA,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CAC1C,EAAE;AACF;CACA;CACA,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAClE,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC5D,CAAC,OAAO,MAAM,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CACrC,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;CACtB,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC;CACxB,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AAChD;CACO,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC;AACpK;CACA,IAAI,IAAI,GAAG,OAAO,UAAU,KAAK,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAC;CAChE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACxB;CACA,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D;CACA,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,CAAC,IAAI,CAAC,cAAc,EAAE;CACtB,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC;CACrC,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;CACnD,EAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,QAAQ,CAAC,CAAC;CACrE,EAAE;CACF,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;CACzC,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;CACF,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CAC7E,CAAC,IAAI,YAAY,GAAGA,UAAQ,CAAC;CAC7B,CAACA,UAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;CACpC,CAACC,gBAAc,GAAG,WAAW,CAAC;CAC9B,CAACA,gBAAc,GAAG,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;CAC3D,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,kBAAkB,GAAGD,UAAQ,CAAC;CAC9C,CAACA,UAAQ,GAAG,YAAY,CAAC;CACzB,CAAC,OAAO,IAAI,EAAE,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CACrB,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC7F,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CAC1B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO;CAClF,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9G,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;CAC3B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO;CAC3E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9K;CACA,EAAE,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;CAC7B,CAAC,CAAC;CACF;CACA;AACA;CACA,SAAS,SAAS,CAAC,QAAQ,EAAE;CAC7B,CAAC,IAAI,cAAc,IAAI,cAAc,CAAC,YAAY;CAClD,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC;CAChC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC;CAC1B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAE9B,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,cAAc,GAAG,SAAS,CAAC;CAEhC,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,mBAAmB,GAAGC,gBAAc,CAAC;AAC1C;CACA;CACA,CAAC,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACrD,CAAC,IAAI,eAAe,GAAG,iBAAiB,CAAC;CACzC,CAAC,IAAI,uBAAuB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;CACpF,CAAC,IAAI,UAAU,GAAG,cAAc,CAAC;CACjC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;CACxB,CAAC,MAAM,GAAG,WAAW,CAAC;CACtB,CAACD,UAAQ,GAAG,aAAa,CAAC;CAE1B,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAAC,SAAS,GAAG,cAAc,CAAC;CAE5B,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAACC,gBAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,GAAG,GAAG,QAAQ,CAAC;CAChB,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,iBAAiB,GAAG,eAAe,CAAC;CACrC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,EAAE,GAAG,uBAAuB,CAAC,CAAC;CACnF,CAAC,cAAc,GAAG,UAAU,CAAC;CAC7B,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;CACrE,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;CACM,SAAS,WAAW,GAAG;CAC9B,CAAC,GAAG,GAAG,IAAI,CAAC;CACZ,CAAC,YAAY,GAAG,IAAI,CAAC;CACrB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC1B,CAAC;AACD;CACO,SAASC,cAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,MAAM;CACrB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;CACvD;CACA,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;CAChD,CAAC;AACD;CACO,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;CACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CAC9B,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;CACvD,CAAC;AACW,OAAC,OAAO,GAAG,QAAQ;CAC/B,IAAI,cAAc,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC5C,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,cAAc,GAAG,cAAc,CAAC,eAAe;AAChD,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,eAAe,GAAG;CAC/B,CAAC,KAAK,EAAE,CAAC;CACT,CAAC,MAAM,EAAE,CAAC;CACV,CAAC,aAAa,EAAE,CAAC;CACjB,CAAC,WAAW,EAAE,CAAC;CACf,EAAE;CACF,IAAI,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;CACnC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7C,SAAS,YAAY,CAAC,aAAa,EAAE;CAC5C,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;CAC7B,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC,OAAO,CAAC,CAAC,UAAU,GAAG,aAAa,IAAI,aAAa,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAC5F,CAAC;CACD;CACA;CACA;CACA,OAAO,CAAC,qBAAqB,GAAG,IAAI;;CCptCpC,IAAI,WAAW,CAAC;CAChB,IAAI;CACJ,CAAC,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;CACjC,CAAC,CAAC,OAAO,KAAK,EAAE,EAAE;CAClB,IAAI,UAAU,EAAE,gBAAgB,CAAC;CACjC,MAAM,aAAa,GAAG,OAAO,MAAM,KAAK,WAAW,CAAC;CACpD,MAAM,iBAAiB,GAAG,aAAa;CACvC,CAAC,SAAS,MAAM,EAAE,EAAE,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;CAC1E,MAAM,SAAS,GAAG,aAAa,GAAG,MAAM,GAAG,UAAU,CAAC;CACtD,MAAM,eAAe,GAAG,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;CACjE,IAAI,MAAM,EAAE,UAAU,CAAC;CACvB,IAAI,UAAU,CAAC;CACf,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI,OAAO,CAAC;CACZ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,MAAM,eAAe,GAAG,MAAM,CAAC;CAC/B,MAAM,WAAW,GAAG,iBAAiB,CAAC;CAC/B,MAAM,aAAa,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;CAC1C,MAAM,KAAK,SAAS,OAAO,CAAC;CACnC,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;CACjB,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;CAElB,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,IAAI,eAAe,CAAC;CACtB,EAAE,IAAI,UAAU,CAAC;CACjB,EAAE,IAAI,YAAY,CAAC;CACnB,EAAE,IAAI,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9E,GAAG,OAAO,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG,GAAG,CAAC,WAAW,IAAI,WAAW,CAAC,UAAU;CAC5C,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9B,IAAI,OAAO,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;CAC7E,IAAI,GAAG,KAAK,CAAC;AACb;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,CAAC;CACnB,EAAE,IAAI,CAAC,OAAO;CACd,GAAG,OAAO,GAAG,EAAE,CAAC;CAChB,EAAE,IAAI,YAAY,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC;CACnD,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,cAAc,CAAC;CACzE,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC;CACxD,EAAE,IAAI,mBAAmB,IAAI,IAAI;CACjC,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,EAAE,GAAG,CAAC,CAAC;CACtD,EAAE,IAAI,mBAAmB,GAAG,IAAI;CAChC,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,EAAE,IAAI,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,EAAE;CACjE,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;CAClD,EAAE,IAAI,gBAAgB,IAAI,IAAI;CAC9B,GAAG,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,GAAG,EAAE,CAAC;CACpD,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK;CACrD,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB;CACA,EAAE,IAAI,iBAAiB,GAAG,mBAAmB,GAAG,EAAE,KAAK,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,CAAC,CAAC;CACpG,EAAE,IAAI,aAAa,GAAG,mBAAmB,GAAG,IAAI,CAAC;CACjD,EAAE,IAAI,cAAc,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,IAAI,CAAC;CACrE,EAAE,IAAI,cAAc,GAAG,IAAI,EAAE;CAC7B,GAAG,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;CAC3E,GAAG;CACH,EAAE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC7B,EAAE,IAAI,gBAAgB,GAAG,CAAC,CAAC;CAC3B,EAAE,IAAI,oCAAoC,GAAG,CAAC,CAAC;AAC/C;CACA,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,KAAK,EAAE,aAAa,EAAE;CAC3D,GAAG,IAAI,CAAC,MAAM,EAAE;CAChB,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACzC,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAC7F,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,IAAI,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE;CACnC;CACA,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAClD,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;CACtG,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,IAAI,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC;CAC3C,GAAG,KAAK,GAAG,QAAQ,CAAC;CACpB,GAAG,IAAI,aAAa,GAAG,mBAAmB,EAAE,QAAQ,KAAK,aAAa,GAAG,IAAI,CAAC,CAAC;CAC/E,GAAG,YAAY,GAAG,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;CAC3D,GAAG,IAAI,KAAK,CAAC,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CACzD,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,GAAG,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;CACjC,GAAG,IAAI,UAAU,EAAE;CACnB,IAAI,IAAI,UAAU,CAAC,aAAa;CAChC,KAAK,UAAU,GAAG,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;CAChE,IAAI,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACpD,IAAI,IAAI,YAAY,GAAG,mBAAmB,EAAE;CAC5C;CACA,KAAK,MAAM,IAAI,KAAK,CAAC,oGAAoG,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;CACrJ,KAAK;CACL,IAAI,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE;CACjC;CACA,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAClD,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;CAC5C,MAAM,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,CAAC,IAAI;CACf,OAAO,SAAS;CAChB,MAAM,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC9D,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;CAC3C,MAAM;CACN,KAAK,IAAI,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACnD,KAAK;CACL,IAAI,IAAI,CAAC,YAAY,EAAE;CACvB,KAAK,UAAU,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,CAAC;CAC7C,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,eAAe;CACtB,IAAI,eAAe,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,aAAa,CAAC;CACrB,GAAG,IAAI;CACP,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CAClE,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1D,UAAU,IAAI,KAAK,CAAC,WAAW,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,YAAY,QAAQ,CAAC,EAAE;CACnI;CACA,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;CACzD,MAAM,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;CACxB,KAAK;CACL,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;CACjB,IAAI,IAAI,UAAU,GAAG,cAAc,CAAC;CACpC,IAAI,IAAI,cAAc;CACtB,KAAK,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CAClC,IAAI,IAAI,YAAY,IAAI,YAAY,CAAC,WAAW,EAAE;CAClD,KAAK,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7F,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;CAChC,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAChC,KAAK,OAAO,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;CACjC,MAAM,IAAI,cAAc,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;CAC3D,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,eAAe,GAAG,KAAK,CAAC,IAAI,iBAAiB,KAAK,CAAC,CAAC;CAC3F,OAAO,iBAAiB,GAAG,CAAC,CAAC;CAC7B,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,EAAE;CAC1D,OAAO,IAAI,iBAAiB,IAAI,CAAC;CACjC,QAAQ,iBAAiB,IAAI,CAAC,CAAC;CAC/B,OAAO,MAAM;CACb,OAAO,IAAI,iBAAiB,IAAI,CAAC,EAAE;CACnC;CACA,QAAQ,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACxD,SAAS,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAChF,QAAQ,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAC/B,QAAQ;CACR,OAAO,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC;CACxC,OAAO,CAAC,EAAE,CAAC;CACX,OAAO;CACP,MAAM;CACN,KAAK,IAAI,iBAAiB,IAAI,CAAC,IAAI,UAAU,EAAE;CAC/C;CACA,MAAM,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACtD,OAAO,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAC9E,MAAM;CACN,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CACxC,KAAK,IAAI,QAAQ,GAAG,OAAO;CAC3B,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;CACzB,KAAK,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC7B,KAAK,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;CAC/E,KAAK,YAAY,GAAG,IAAI,CAAC;CACzB,KAAK,OAAO,UAAU,CAAC;CACvB,KAAK;CACL,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC5B,IAAI,IAAI,aAAa,GAAG,iBAAiB,EAAE;CAC3C,KAAK,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;CAC1B,KAAK,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC;CAC3B,KAAK,OAAO,MAAM,CAAC;CACnB,KAAK;CACL,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC5C,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,aAAa,GAAG,KAAK,CAAC;CAC1B,IAAI,MAAM,KAAK,CAAC;CAChB,IAAI,SAAS;CACb,IAAI,IAAI,UAAU,EAAE;CACpB,KAAK,eAAe,EAAE,CAAC;CACvB,KAAK,IAAI,eAAe,IAAI,KAAK,CAAC,cAAc,EAAE;CAClD,MAAM,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACtD;CACA,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC1D,MAAM,IAAI,aAAa,GAAG,CAAC,KAAK,CAAC,kBAAkB,IAAI,iBAAiB,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;CAC7F,MAAM,IAAI,CAAC,aAAa,EAAE;CAC1B,OAAO,IAAI,KAAK,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,CAAC,YAAY,CAAC,KAAK,KAAK,EAAE;CACtF;CACA,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;CAChD,QAAQ;CACR,OAAO,KAAK,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACtD;CACA,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACrD,OAAO,OAAO,YAAY,CAAC;CAC3B,OAAO;CACP,MAAM;CACN,KAAK;CACL;CACA,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAClD,IAAI,IAAI,aAAa,GAAG,iBAAiB;CACzC,KAAK,QAAQ,GAAG,KAAK,CAAC;CACtB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,MAAM;CAChC,GAAG,IAAI,oCAAoC,GAAG,EAAE;CAChD,IAAI,oCAAoC,EAAE,CAAC;CAC3C,GAAG,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACnD,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,IAAI,CAAC,YAAY;CACxD,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,CAAC;CACrC,GAAG,IAAI,gBAAgB,GAAG,KAAK,EAAE;CACjC;CACA,IAAI,UAAU,CAAC,WAAW,GAAG,IAAI,CAAC;CAClC,IAAI,oCAAoC,GAAG,CAAC,CAAC;CAC7C,IAAI,gBAAgB,GAAG,CAAC,CAAC;CACzB,IAAI,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACpC,KAAK,iBAAiB,GAAG,EAAE,CAAC;CAC5B,IAAI,MAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE;CAC7D,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC9D,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAC7C,KAAK;CACL,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,KAAK,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;CAC7B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACpC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;CAC1B,GAAG,IAAI,QAAQ,GAAG,OAAO;CACzB,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAChC;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;CAC3B,GAAG,IAAI,MAAM,CAAC;CACd,GAAG,IAAI,IAAI,KAAK,QAAQ,EAAE;CAC1B,IAAI,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;CACjC,IAAI,IAAI,cAAc,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,MAAM,EAAE;CAChE,KAAK,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,SAAS,IAAI,eAAe,EAAE;CAC/D,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,QAAQ,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;CAC5G,MAAM,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACvC,OAAO,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;CAC9C,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;CACnC,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC/B,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CACpC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC,CAAC;CAC/E,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO;CACP,MAAM,cAAc,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;CAChC,MAAM,cAAc,CAAC,QAAQ,GAAG,UAAU,CAAC;CAC3C,MAAM,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;CAC9B,MAAM,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;CACzC,MAAM;CACN,KAAK,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC3C,KAAK,cAAc,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,IAAI,CAAC,OAAO,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;CAC5C,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,UAAU,CAAC;CACnB;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,EAAE;CAC1B,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,KAAK,EAAE;CAClC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE;CACpC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM;CACX,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK;CACL,IAAI,IAAI,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACrC,KAAK,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC5C;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACzC,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CACxD,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;CACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,EAAE,GAAG,IAAI,EAAE;CACrB,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,CAAC;CAClC,OAAO,MAAM,IAAI,EAAE,GAAG,KAAK,EAAE;CAC7B,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;CAC9C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,CAAC,EAAE,GAAG,MAAM,MAAM,MAAM;CAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,MAAM;CAC3D,QAAQ;CACR,OAAO,EAAE,GAAG,OAAO,IAAI,CAAC,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC;CAC5D,OAAO,CAAC,EAAE,CAAC;CACX,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CACtD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO;CACP,MAAM;CACN,KAAK,MAAM,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CAClD,KAAK,MAAM;CACX,KAAK,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;CACvD,KAAK;AACL;CACA,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACxC,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,EAAE;CAC/B,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CACjC,KAAK,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACjC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACtC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACxC,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,QAAQ,IAAI,MAAM,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,KAAK,EAAE;CAC/B;CACA,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;CAC9G,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,KAAK,EAAE;CAC/B,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,OAAO,EAAE;CACjC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;CACtC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;CACxC,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,EAAE;CACrC,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CACzB,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,CAAC;CACpB,KAAK,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,GAAG,WAAW,IAAI,KAAK,IAAI,CAAC,UAAU,EAAE;CAC5F,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,UAAU,GAAG,CAAC;CACxB;CACA,QAAQ,CAAC,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;CACzH,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,QAAQ,EAAE,CAAC;CAClB,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,UAAU,EAAE;CACxD,IAAI,IAAI,CAAC,KAAK;CACd,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,IAAI,YAAY,EAAE;CACvB,MAAM,IAAI,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;CAC5C,MAAM,IAAI,OAAO,EAAE;CACnB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;CACxB,QAAQ,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,KAAK,YAAY,CAAC,WAAW,GAAG,EAAE,CAAC,CAAC;CACtF,QAAQ,OAAO,CAAC,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;CAC/C,QAAQ;CACR,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;CAClD,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;CAC7D,MAAM;CACN,KAAK,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;CACzC,KAAK,IAAI,WAAW,KAAK,MAAM,EAAE;CACjC,MAAM,WAAW,CAAC,KAAK,CAAC,CAAC;CACzB,MAAM,MAAM,IAAI,WAAW,KAAK,KAAK,EAAE;CACvC,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;CACvB,MAAM,MAAM,IAAI,WAAW,KAAK,GAAG,EAAE;CACrC,MAAM,IAAI,IAAI,CAAC,gBAAgB,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3D,WAAW;CACX,OAAO,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;CAC3B,OAAO,IAAI,MAAM,GAAG,IAAI,EAAE;CAC1B,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CAC3C,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACpC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACzC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC/C,QAAQ,QAAQ,IAAI,CAAC,CAAC;CACtB,QAAQ;CACR,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE;CAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC;CAClB,QAAQ,IAAI,CAAC,UAAU,CAAC,CAAC;CACzB,QAAQ;CACR,OAAO;CACP,MAAM,MAAM;CACZ,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACzD,OAAO,IAAI,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,OAAO,IAAI,KAAK,YAAY,cAAc,EAAE;CAC5C,QAAQ,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACtC,QAAQ,IAAI,SAAS,CAAC,KAAK,EAAE;CAC7B,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE;CAC7B,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACpC,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;CAC9C,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CACjC,UAAU;CACV,SAAS,IAAI,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;CAC7D,SAAS,IAAI,WAAW,KAAK,KAAK,EAAE;CACpC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CACpC,WAAW,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,WAAW,MAAM;CACjB,WAAW,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,WAAW;CACX,UAAU,MAAM;CAChB,UAAU,IAAI,CAAC,WAAW,CAAC,CAAC;CAC5B,UAAU;CACV,SAAS,OAAO;CAChB,SAAS;CACT,QAAQ,IAAI,aAAa,GAAG,MAAM,CAAC;CACnC,QAAQ,IAAI,iBAAiB,GAAG,UAAU,CAAC;CAC3C,QAAQ,IAAI,eAAe,GAAG,QAAQ,CAAC;CACvC,QAAQ,MAAM,GAAG,IAAI,CAAC;CACtB,QAAQ,IAAI,MAAM,CAAC;CACnB,QAAQ,IAAI;CACZ,SAAS,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,KAAK;CAC7D;CACA,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,aAAa,GAAG,IAAI,CAAC;CAC/B,UAAU,QAAQ,IAAI,IAAI,CAAC;CAC3B,UAAU,IAAI,QAAQ,GAAG,OAAO;CAChC,WAAW,QAAQ,CAAC,QAAQ,CAAC,CAAC;CAC9B,UAAU,OAAO;CACjB,WAAW,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;CACxD,WAAW,CAAC;CACZ,UAAU,EAAE,IAAI,CAAC,CAAC;CAClB,SAAS,SAAS;CAClB;CACA,SAAS,IAAI,aAAa,EAAE;CAC5B,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,UAAU,GAAG,iBAAiB,CAAC;CACzC,UAAU,QAAQ,GAAG,eAAe,CAAC;CACrC,UAAU,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACvC,UAAU;CACV,SAAS;CACT,QAAQ,IAAI,MAAM,EAAE;CACpB,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC/C,UAAU,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CAC7C,SAAS,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACjF,SAAS;CACT,QAAQ,OAAO;CACf,QAAQ;CACR,OAAO;CACP;CACA,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CAChC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CACxB,OAAO,MAAM;CACb;CACA,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;CACzB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;CACpC;CACA,QAAQ,IAAI,IAAI,KAAK,KAAK;CAC1B,SAAS,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;CAC3B,QAAQ;AACR;CACA;CACA,OAAO,IAAI,IAAI,KAAK,UAAU;CAC9B,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE;CACA;CACA,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1B,OAAO;CACP,MAAM;CACN,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE;CAClC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;CAC7C,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,GAAG,kBAAkB,IAAI,KAAK,IAAI,CAAC,kBAAkB,EAAE;CACpE;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,KAAK,MAAM,IAAI,KAAK,GAAG,mBAAmB,IAAI,KAAK,GAAG,CAAC,EAAE;CACzD;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC9C,KAAK,MAAM;CACX;CACA,KAAK,IAAI,IAAI,CAAC,kBAAkB,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;CACrD,MAAM,MAAM,IAAI,IAAI,CAAC,mBAAmB,EAAE;CAC1C,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;CACpC,MAAM,MAAM,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,SAAS,EAAE;CAC3D,MAAM,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD;CACA,MAAM,IAAI,KAAK,CAAC;CAChB,MAAM,IAAI,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE;CAC9C,OAAO,IAAI,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;CAC1D,OAAO,IAAI,MAAM,GAAG,EAAE,CAAC;CACvB,OAAO,OAAO,IAAI,EAAE;CACpB,QAAQ,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CAClC,QAAQ,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,EAAE,MAAM;CACnD,QAAQ,KAAK,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CAC7B,QAAQ;AACR;CACA,OAAO,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;CACjE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;CACvB,OAAO,MAAM;CACb,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;CAC9B,OAAO,IAAI,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;CAC3D,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;CAC9B,QAAQ,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;CAC9B,QAAQ,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;CACvD,QAAQ,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;CAC/B,QAAQ;AACR;CACA,OAAO,IAAI,aAAa,EAAE;CAC1B,QAAQ,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAClD,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;CAC/C,SAAS,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CACjE,SAAS;CACT,QAAQ;AACR;CACA,OAAO,IAAI,MAAM,EAAE;CACnB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CACpE,QAAQ;CACR,OAAO;AACP;CACA,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC3C,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CACzC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;CACnE,MAAM,OAAO;CACb,MAAM,MAAM;CACZ,MAAM,MAAM,IAAI,UAAU,CAAC,KAAK,GAAG,iEAAiE;CACpG,OAAO,+EAA+E;CACtF,OAAO,2CAA2C,CAAC,CAAC;CACpD,MAAM;CACN,KAAK;CACL,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE;CACpC,IAAI,IAAI,IAAI,CAAC,oBAAoB;CACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK;CACL,IAAI,MAAM;CACV,IAAI,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;CAC7C,IAAI;CACJ,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,gBAAgB,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,KAAK;CAChH;CACA,GAAG,IAAI,IAAI,CAAC;CACZ,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,IAAI,GAAG,EAAE,CAAC;CACd,IAAI,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC5B,KAAK,IAAI,CAAC,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC;CACnF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;CAC5C,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACrB,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CAC/B,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,IAAI,GAAG,CAAC;CACX,GAAG,IAAI,IAAI,CAAC,oBAAoB,EAAE;CAClC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;CAC3B,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;CAClC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;AACL;CACA,IAAI,MAAM;CACV,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACzB,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,IAAI,YAAY,GAAG,QAAQ,GAAG,KAAK,CAAC;CACvC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;CACf,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK,IAAI,EAAE,CAAC;CACZ,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,IAAI,GAAG,MAAM,EAAE;CACtB,IAAI,MAAM,IAAI,KAAK,CAAC,6DAA6D;CACjF,IAAI,4DAA4D,CAAC,CAAC;CAClE,IAAI;CACJ,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;CAC9C,GAAG,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CAC9C,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,KAAK,KAAK,GAAG,gBAAgB;CAClE,EAAE,CAAC,OAAO,CAAC,kBAAkB,IAAI,CAAC,iBAAiB;CACnD,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,YAAY,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC;CACzC,GAAG,IAAI,SAAS,CAAC;CACjB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACtC,KAAK,IAAI,cAAc;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC;CAClC,UAAU;CACV;CACA,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACrC,MAAM,IAAI,cAAc,GAAG,UAAU,CAAC;CACtC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC1C,MAAM,IAAI,cAAc,GAAG,CAAC,CAAC;CAC7B,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ,cAAc,EAAE,CAAC;CACzB,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,IAAI,QAAQ,EAAE;CAChD;CACA,OAAO,QAAQ,EAAE,CAAC;CAClB,OAAO,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CACnD,OAAO;CACP,OAAO,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;CACvE,MAAM,SAAS,GAAG,IAAI,CAAC;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;CACvC,MAAM;CACN,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,CAAC,SAAS,EAAE;CACnB,IAAI,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC7C,IAAI,IAAI,QAAQ;CAChB,KAAK,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,QAAQ,CAAC;CAC7C;CACA,KAAK,eAAe,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;CACvE,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,cAAc,GAAG,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CAC1G,IAAI,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACrC,IAAI,IAAI,CAAC,cAAc,EAAE;CACzB,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC5D,KAAK,cAAc,EAAE,CAAC;CACtB,KAAK;CACL,IAAI,UAAU,GAAG,cAAc,CAAC;CAChC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC5C,GAAG,IAAI,QAAQ,EAAE;CACjB,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,iBAAiB,EAAE;CAC/C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;CAC7D,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACxC,KAAK;CACL,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,IAAI,MAAM;CACV,IAAI,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC;CACtF,IAAI;CACJ;CACA,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM;CACzB,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,GAAG,CAAC;AACJ;CACA;CACA,EAAE,MAAM,eAAe,GAAG,OAAO,IAAI,CAAC,UAAU,IAAI,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;AAClF;CACA,EAAE,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,MAAM,KAAK;CACpD,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;CAC5E,GAAG,GAAG,WAAW,CAAC;AAClB;CACA,EAAE,MAAM,WAAW,GAAG,CAAC,MAAM,KAAK;CAClC,GAAG,IAAI,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,kBAAkB,KAAK;CAC3I,IAAI,IAAI,kBAAkB;CAC1B,KAAK,OAAO,eAAe,GAAG,IAAI,CAAC;CACnC,IAAI,QAAQ,GAAG,WAAW,CAAC;CAC3B,IAAI,IAAI,WAAW,GAAG,MAAM,CAAC;CAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;CAChB,IAAI,eAAe,EAAE,CAAC;CACtB,IAAI,IAAI,WAAW,KAAK,MAAM,EAAE;CAChC,KAAK,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;CAC7C,KAAK;CACL,IAAI,OAAO,QAAQ,CAAC;CACpB,IAAI,CAAC,CAAC;CACN,GAAG,IAAI,WAAW,KAAK,CAAC;CACxB,IAAI,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;CAC/B,GAAG,QAAQ,GAAG,WAAW,CAAC;CAC1B,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK;CAC5B,GAAG,IAAI,OAAO,CAAC;CACf,GAAG,IAAI,GAAG,GAAG,SAAS,EAAE;CACxB;CACA,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,eAAe;CACvC,KAAK,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;CAC/E,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe;CACtC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,GAAG,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;CACrG,IAAI;CACJ,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;CAClF,GAAG,IAAI,SAAS,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;CAClD,GAAG,UAAU,GAAG,SAAS,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;CACxG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;CACtC,GAAG,IAAI,MAAM,CAAC,IAAI;CAClB,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;CAC1C;CACA,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;CAC5C,GAAG,QAAQ,IAAI,KAAK,CAAC;CACrB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;CACnC,GAAG,OAAO,MAAM,GAAG,SAAS,CAAC;CAC7B,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,KAAK;CAC1D,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC;CACpC,GAAG,IAAI,CAAC,QAAQ;CAChB,IAAI,QAAQ,GAAG,IAAI,CAAC;CACpB,GAAG,IAAI,QAAQ,GAAG,aAAa,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE;CAClG,IAAI,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC;CACpC,IAAI,IAAI,EAAE,QAAQ,GAAG,cAAc,CAAC;CACpC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;CACxC,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,cAAc;CAClC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC;CACrC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,IAAI,iBAAiB,GAAG,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;CACtG,GAAG,UAAU,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;CACxC,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACtC;CACA,GAAG,IAAI,QAAQ,GAAG,aAAa,EAAE;CACjC,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;CACzB,IAAI,UAAU,CAAC,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC;CAC9C,IAAI,eAAe,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;AACL;CACA,IAAI,IAAI,cAAc;CACtB,KAAK,gBAAgB,IAAI,oCAAoC,GAAG,cAAc,CAAC;CAC/E;CACA,IAAI,IAAI,iBAAiB,CAAC,MAAM,IAAI,gBAAgB;CACpD,KAAK,iBAAiB,CAAC,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAClD,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;CACvC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;CACf,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,eAAe,EAAE,cAAc,KAAK;CACjF,GAAG,IAAI,UAAU,GAAG,MAAM,CAAC;CAC3B,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,IAAI,WAAW,GAAG,OAAO,CAAC;CAC7B,GAAG,IAAI,SAAS,GAAG,KAAK,CAAC;CACzB,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,IAAI,CAAC,MAAM;CACd,IAAI,UAAU,GAAG,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACtD,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CAC/C,GAAG,UAAU,GAAG,MAAM,CAAC;CACvB,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,OAAO,GAAG,WAAW,CAAC;CACzB,GAAG,KAAK,GAAG,SAAS,CAAC;CACrB,GAAG,IAAI,YAAY,GAAG,CAAC,EAAE;CACzB,IAAI,IAAI,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,CAAC,CAAC;CAC7C,IAAI,IAAI,MAAM,GAAG,OAAO;CACxB,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;CACtB,IAAI,IAAI,iBAAiB,GAAG,eAAe,GAAG,KAAK,CAAC;CACpD,IAAI,MAAM,CAAC,UAAU,CAAC,iBAAiB,GAAG,YAAY,EAAE,iBAAiB,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;CACzF,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,iBAAiB,CAAC,CAAC;CACrE,IAAI,QAAQ,GAAG,MAAM,CAAC;CACtB,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,eAAe,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACpD,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE;CACF,CAAC,SAAS,CAAC,MAAM,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,MAAM,CAAC;CAClB,EAAE,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CAC3G,EAAE,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC;CAC/B,EAAE,QAAQ,GAAG,CAAC,CAAC;CACf,EAAE;CACF,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,EAAE;CACtB,EAAE,QAAQ,GAAG,KAAK,CAAC;CACnB,EAAE;CACF,CAAC,IAAI,QAAQ,GAAG;CAChB,EAAE,OAAO,QAAQ,CAAC;CAClB,EAAE;CACF,CAAC,eAAe,GAAG;CACnB,EAAE,IAAI,IAAI,CAAC,UAAU;CACrB,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB,EAAE,IAAI,IAAI,CAAC,YAAY;CACvB,GAAG,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;CAC1B,EAAE;CACF,CAAC;AACD;CACA,gBAAgB,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,iBAAiB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACvJ,UAAU,GAAG,CAAC;CACd,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACpC,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;CACtC,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACtG;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;CAC3C,GAAG,MAAM,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACnD;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;CAC5G,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;CAC/C,GAAG,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE;CAC7B,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE;CAC3B,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACxB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;CACtC,IAAI;CACJ;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC;CAC3B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,CAAC,CAAC;CACpE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CACrE,GAAG;CACH,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACnC,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE;CAC7B,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;CACnB,GAAG;CACH,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;CACd,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACnD,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACtC,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,UAAU,EAAE,gBAAgB,EAAE;CACpC,EAAE,IAAI,WAAW,GAAG,UAAU,CAAC,WAAW,CAAC;CAC3C,EAAE,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS;CACjD,GAAG,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACvF;CACA,GAAG,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;CAC7C,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE;CAC5B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC1B,EAAE;CACF,CAAC,CAAC,CAAC;AACH;CACA,SAAS,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE;CACpE,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC;CACpC,CAAC,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,EAAE;CACzB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;CAClC,EAAE,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE;CAClC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;CACzC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC;CAC3C,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;CAC7C,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;CACjE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;CACvG,CAAC;CACD,SAAS,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE;CAC/C,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC;CAChC,CAAC,IAAI,MAAM,EAAE,QAAQ,CAAC;CACtB,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;CACrB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAC9B,EAAE,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACnC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACrC,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CACzC,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC;AACD;CACA,SAAS,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;CAC5D,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,CAAC,QAAQ,MAAM;CACf,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,EAAE;CACT,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE;CACF,GAAG,IAAI,MAAM,GAAG,KAAK,EAAE;CACvB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAChC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC;CACtC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC;CAC/C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC;CAC9C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI;CACJ,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC,QAAQ,IAAI,MAAM,CAAC;CACpB,CAAC,OAAO,QAAQ,CAAC;CACjB,CAAC;AACD;CACA,SAAS,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE;CAC5C;CACA,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CAC7C,CAAC,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC;CAClD,CAAC,OAAO,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,EAAE;CACpC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC7B,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;CACrB,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAClE,EAAE,cAAc,IAAI,CAAC,CAAC;CACtB,EAAE,IAAI,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC;CACzC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;CACpC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC;CAC7C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;CAC5C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;CACrC,EAAE,OAAO,GAAG,MAAM,CAAC;CACnB,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,SAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE;CACtD,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;CAChC,EAAE,UAAU,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,iBAAiB,GAAG,cAAc,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;CACxH,EAAE,cAAc,CAAC,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;CACpD,EAAE,IAAI,YAAY,GAAG,cAAc,CAAC;CACpC,EAAE,cAAc,GAAG,IAAI,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE;CACF,CAAC;AACD;CACO,SAAS,YAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE;CACtB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK;CACzC,GAAG,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;CAC9D,EAAE,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI;CACvC,GAAG,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;CACrF,EAAE,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5C,EAAE,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;CAChC,EAAE;CACF,CAACC,cAAkB,CAAC,SAAS,CAAC,CAAC;CAC/B,CAAC;CACD,SAAS,iBAAiB,CAAC,UAAU,EAAE,KAAK,EAAE;CAC9C,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,kBAAkB,KAAK;CACnD,EAAE,IAAI,UAAU,GAAG,CAAC,kBAAkB,KAAK,CAAC,KAAK,CAAC,yBAAyB,IAAI,CAAC,MAAM,kBAAkB,CAAC,MAAM,CAAC,CAAC;CACjH,EAAE,IAAI,CAAC,UAAU;CACjB,GAAG,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;CAC9C,EAAE,OAAO,UAAU,CAAC;CACpB,EAAE,CAAC;CACH,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA;CACA;CACA;CACA,KAAK,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACnC;CACA,IAAI,YAAY,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AACxC,OAAC,IAAI,GAAG,YAAY,CAAC,KAAK;AAC1B,OAAC,MAAM,GAAG,YAAY,CAAC,KAAK;AAC5B,OAAC,OAAO,GAAG,MAAM;AAGjB,OAAC,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,gBAAgB;AACjE,OAAC,iBAAiB,GAAG,IAAI;AACzB,OAAC,iBAAiB,GAAG,KAAK;AAC1B,OAAC,mBAAmB,GAAG;;CClnCnC;CACA;CACA;CACA;CACA;CACA;CACA;CACO,SAAS,QAAQ,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;CACxD,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;CAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,wFAAwF,CAAC,CAAC;CAC9G,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;CACpE,IAAI,OAAO,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;CACjD,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;CACtH,IAAI,OAAO,aAAa,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;CAClD,GAAG,MAAM;CACT,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;CAClH,GAAG;CACH,CAAC;AACD;CACA,WAAW,YAAY,EAAE,cAAc,EAAE,OAAO,EAAE;CAClD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;CACnC,EAAE,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;CACtC,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG;CACH,CAAC;AACD;CACA,iBAAiB,aAAa,EAAE,cAAc,EAAE,OAAO,EAAE;CACzD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;CACnC,EAAE,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;CAC5C,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG;CACH,CAAC;AACD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACO,SAAS,UAAU,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;CAC1D,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;CAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;CAClH,GAAG;AACH;CACA,EAAE,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;CACvC,EAAE,IAAI,UAAU,CAAC;CACjB,EAAE,MAAM,MAAM,GAAG,CAAC,KAAK,KAAK;CAC5B,IAAI,IAAI,MAAM,CAAC;CACf;CACA,IAAI,IAAI,UAAU,EAAE;CACpB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;CACjD,MAAM,UAAU,GAAG,SAAS,CAAC;CAC7B,KAAK;AACL;CACA,IAAI,IAAI;CACR,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;CAC7C,KAAK,CAAC,OAAO,GAAG,EAAE;CAClB,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE;CAC1B,QAAQ,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CACnD,QAAQ,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;CAC5B,OAAO,MAAM;CACb,QAAQ,MAAM,GAAG,CAAC;CAClB,OAAO;CACP,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;CAC7D,IAAI,OAAO,CAAC,WAAW,IAAI,IAAI;CAC/B,MAAM,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;CAC1C,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,OAAO;CACP,KAAK,GAAG,CAAC;CACT,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;CACzE,IAAI,OAAO,CAAC,iBAAiB,IAAI,IAAI;CACrC,MAAM,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;CAChD,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,OAAO;CACP,KAAK,GAAG,CAAC;CACT,GAAG;CACH,CAAC;AACW,OAAC,UAAU,GAAG,WAAW;AACzB,OAAC,UAAU,GAAG;;ACnFd,OAAC,UAAU,GAAG,MAAM;AACpB,OAAC,aAAa,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/index-no-eval.min.js b/node_modules/msgpackr/dist/index-no-eval.min.js
new file mode 100644
index 0000000..1d8ec93
--- /dev/null
+++ b/node_modules/msgpackr/dist/index-no-eval.min.js
@@ -0,0 +1,2 @@
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).msgpackr={})}(this,(function(e){"use strict";var t,r,n;try{t=new TextDecoder}catch(e){}var i,s,o,a,u,l=0,f={},c=0,h=0,g=[],p={useRecords:!1,mapsAsObjects:!0};class d{}const y=new d;y.name="MessagePack 0xC1";var w=!1,b=2;class S{constructor(e){e&&(!1===e.useRecords&&void 0===e.mapsAsObjects&&(e.mapsAsObjects=!0),e.sequential&&!1!==e.trusted&&(e.trusted=!0,e.structures||0==e.useRecords||(e.structures=[],e.maxSharedStructures||(e.maxSharedStructures=0))),e.structures?e.structures.sharedLength=e.structures.length:e.getStructures&&((e.structures=[]).uninitialized=!0,e.structures.sharedLength=0),e.int64AsNumber&&(e.int64AsType="number")),Object.assign(this,e)}unpack(e,t){if(r)return q((()=>(H(),this?this.unpack(e,t):S.prototype.unpack.call(p,e,t))));e.buffer||e.constructor!==ArrayBuffer||(e="undefined"!=typeof Buffer?Buffer.from(e):new Uint8Array(e)),"object"==typeof t?(n=t.end||e.length,l=t.start||0):(l=0,n=t>-1?t:e.length),h=0,s=null,o=null,r=e;try{u=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(r=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof S){if(f=this,this.structures)return i=this.structures,m(t);(!i||i.length>0)&&(i=[])}else f=p,(!i||i.length>0)&&(i=[]);return m(t)}unpackMultiple(e,t){let r,n=0;try{w=!0;let i=e.length,s=this?this.unpack(e,i):Q.unpack(e,i);if(!t){for(r=[s];l<i;)n=l,r.push(m());return r}if(!1===t(s,n,l))return;for(;l<i;)if(n=l,!1===t(m(),n,l))return}catch(e){throw e.lastPosition=n,e.values=r,e}finally{w=!1,H()}}_mergeStructures(e,t){this._onLoadedStructures&&(e=this._onLoadedStructures(e)),e=e||[],Object.isFrozen(e)&&(e=e.map((e=>e.slice(0))));for(let t=0,r=e.length;t<r;t++){let r=e[t];r&&(r.isShared=!0,t>=32&&(r.highByte=t-32>>5))}e.sharedLength=e.length;for(let r in t||[])if(r>=0){let n=e[r],i=t[r];i&&(n&&((e.restoreStructures||(e.restoreStructures=[]))[r]=n),e[r]=i)}return this.structures=e}decode(e,t){return this.unpack(e,t)}}function m(e){try{if(!f.trusted&&!w){let e=i.sharedLength||0;e<i.length&&(i.length=e)}let t;if(f._readStruct&&r[l]<64&&r[l]>=32?(t=f._readStruct(r,l,n),r=null,e&&e.lazy||!t||(t=t.toJSON()),l=n):t=A(),o&&(l=o.postBundlePosition,o=null),w&&(i.restoreStructures=null),l==n)i&&i.restoreStructures&&U(),i=null,r=null,a&&(a=null);else{if(l>n)throw new Error("Unexpected end of MessagePack data");if(!w){let e;try{e=JSON.stringify(t,((e,t)=>"bigint"==typeof t?`${t}n`:t)).slice(0,100)}catch(t){e="(JSON view not available "+t+")"}throw new Error("Data read, but end of buffer not reached "+e)}}return t}catch(e){throw i&&i.restoreStructures&&U(),H(),(e instanceof RangeError||e.message.startsWith("Unexpected end of buffer")||l>n)&&(e.incomplete=!0),e}}function U(){for(let e in i.restoreStructures)i[e]=i.restoreStructures[e];i.restoreStructures=null}function A(){let e=r[l++];if(e<160){if(e<128){if(e<64)return e;{let t=i[63&e]||f.getStructures&&v()[63&e];return t?(t.read||(t.read=I(t,63&e)),t.read()):e}}if(e<144){if(e-=128,f.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=C();"__proto__"===e&&(e="__proto_"),t[e]=A()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(A(),A());return t}}{e-=144;let t=new Array(e);for(let r=0;r<e;r++)t[r]=A();return f.freezeData?Object.freeze(t):t}}if(e<192){let t=e-160;if(h>=l)return s.slice(l-c,(l+=t)-c);if(0==h&&n<140){let e=t<16?D(t):L(t);if(null!=e)return e}return _(t)}{let t;switch(e){case 192:return null;case 193:return o?(t=A(),t>0?o[1].slice(o.position1,o.position1+=t):o[0].slice(o.position0,o.position0-=t)):y;case 194:return!1;case 195:return!0;case 196:if(t=r[l++],void 0===t)throw new Error("Unexpected end of buffer");return P(t);case 197:return t=u.getUint16(l),l+=2,P(t);case 198:return t=u.getUint32(l),l+=4,P(t);case 199:return N(r[l++]);case 200:return t=u.getUint16(l),l+=2,N(t);case 201:return t=u.getUint32(l),l+=4,N(t);case 202:if(t=u.getFloat32(l),f.useFloat32>2){let e=Z[(127&r[l])<<1|r[l+1]>>7];return l+=4,(e*t+(t>0?.5:-.5)>>0)/e}return l+=4,t;case 203:return t=u.getFloat64(l),l+=8,t;case 204:return r[l++];case 205:return t=u.getUint16(l),l+=2,t;case 206:return t=u.getUint32(l),l+=4,t;case 207:return"number"===f.int64AsType?(t=4294967296*u.getUint32(l),t+=u.getUint32(l+4)):"string"===f.int64AsType?t=u.getBigUint64(l).toString():"auto"===f.int64AsType?(t=u.getBigUint64(l),t<=BigInt(2)<<BigInt(52)&&(t=Number(t))):t=u.getBigUint64(l),l+=8,t;case 208:return u.getInt8(l++);case 209:return t=u.getInt16(l),l+=2,t;case 210:return t=u.getInt32(l),l+=4,t;case 211:return"number"===f.int64AsType?(t=4294967296*u.getInt32(l),t+=u.getUint32(l+4)):"string"===f.int64AsType?t=u.getBigInt64(l).toString():"auto"===f.int64AsType?(t=u.getBigInt64(l),t>=BigInt(-2)<<BigInt(52)&&t<=BigInt(2)<<BigInt(52)&&(t=Number(t))):t=u.getBigInt64(l),l+=8,t;case 212:if(t=r[l++],114==t)return W(63&r[l++]);{let e=g[t];if(e)return e.read?(l++,e.read(A())):e.noBuffer?(l++,e()):e(r.subarray(l,++l));throw new Error("Unknown extension "+t)}case 213:return t=r[l],114==t?(l++,W(63&r[l++],r[l++])):N(2);case 214:return N(4);case 215:return N(8);case 216:return N(16);case 217:return t=r[l++],h>=l?s.slice(l-c,(l+=t)-c):k(t);case 218:return t=u.getUint16(l),h>=(l+=2)?s.slice(l-c,(l+=t)-c):B(t);case 219:return t=u.getUint32(l),h>=(l+=4)?s.slice(l-c,(l+=t)-c):x(t);case 220:return t=u.getUint16(l),l+=2,M(t);case 221:return t=u.getUint32(l),l+=4,M(t);case 222:return t=u.getUint16(l),l+=2,R(t);case 223:return t=u.getUint32(l),l+=4,R(t);default:if(e>=224)return e-256;if(void 0===e){let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}throw new Error("Unknown MessagePack token "+e)}}}const E=/^[a-zA-Z_$][a-zA-Z\d_$]*$/;function I(e,t){function r(){if(r.count++>b){let n;try{n=e.read=new undefined("r","return function(){return "+(f.freezeData?"Object.freeze":"")+"({"+e.map((e=>"__proto__"===e?"__proto_:r()":E.test(e)?e+":r()":"["+JSON.stringify(e)+"]:r()")).join(",")+"})}")(A)}catch(e){return b=1/0,r()}return 0===e.highByte&&(e.read=O(t,e.read)),n()}let n={};for(let t=0,r=e.length;t<r;t++){let r=e[t];"__proto__"===r&&(r="__proto_"),n[r]=A()}return f.freezeData?Object.freeze(n):n}return r.count=0,0===e.highByte?O(t,r):r}const O=(e,t)=>function(){let n=r[l++];if(0===n)return t();let s=e<32?-(e+(n<<5)):e+(n<<5),o=i[s]||v()[s];if(!o)throw new Error("Record id is not defined for "+s);return o.read||(o.read=I(o,e)),o.read()};function v(){let e=q((()=>(r=null,f.getStructures())));return i=f._mergeStructures(e,i)}var _=T,k=T,B=T,x=T;function T(e){let n;if(e<16&&(n=D(e)))return n;if(e>64&&t)return t.decode(r.subarray(l,l+=e));const i=l+e,s=[];for(n="";l<i;){const e=r[l++];if(0==(128&e))s.push(e);else if(192==(224&e)){const t=(31&e)<<6|63&r[l++];t<128?s.push(65533):s.push(t)}else if(224==(240&e)){const t=(31&e)<<12|(63&r[l++])<<6|63&r[l++];t<2048||t>=55296&&t<=57343?s.push(65533):s.push(t)}else if(240==(248&e)){let t=(7&e)<<18|(63&r[l++])<<12|(63&r[l++])<<6|63&r[l++];t<65536||t>1114111?s.push(65533):t>65535?(t-=65536,s.push(t>>>10&1023|55296),t=56320|1023&t,s.push(t)):s.push(t)}else s.push(65533);s.length>=4096&&(n+=j.apply(String,s),s.length=0)}return s.length>0&&(n+=j.apply(String,s)),n}function M(e){let t=new Array(e);for(let r=0;r<e;r++)t[r]=A();return f.freezeData?Object.freeze(t):t}function R(e){if(f.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=C();"__proto__"===e&&(e="__proto_"),t[e]=A()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(A(),A());return t}}var j=String.fromCharCode;function L(e){let t=l,n=new Array(e);for(let i=0;i<e;i++){const e=r[l++];if((128&e)>0)return void(l=t);n[i]=e}return j.apply(String,n)}function D(e){if(e<4){if(e<2){if(0===e)return"";{let e=r[l++];return(128&e)>1?void(l-=1):j(e)}}{let t=r[l++],n=r[l++];if((128&t)>0||(128&n)>0)return void(l-=2);if(e<3)return j(t,n);let i=r[l++];return(128&i)>0?void(l-=3):j(t,n,i)}}{let t=r[l++],n=r[l++],i=r[l++],s=r[l++];if((128&t)>0||(128&n)>0||(128&i)>0||(128&s)>0)return void(l-=4);if(e<6){if(4===e)return j(t,n,i,s);{let e=r[l++];return(128&e)>0?void(l-=5):j(t,n,i,s,e)}}if(e<8){let o=r[l++],a=r[l++];if((128&o)>0||(128&a)>0)return void(l-=6);if(e<7)return j(t,n,i,s,o,a);let u=r[l++];return(128&u)>0?void(l-=7):j(t,n,i,s,o,a,u)}{let o=r[l++],a=r[l++],u=r[l++],f=r[l++];if((128&o)>0||(128&a)>0||(128&u)>0||(128&f)>0)return void(l-=8);if(e<10){if(8===e)return j(t,n,i,s,o,a,u,f);{let e=r[l++];return(128&e)>0?void(l-=9):j(t,n,i,s,o,a,u,f,e)}}if(e<12){let c=r[l++],h=r[l++];if((128&c)>0||(128&h)>0)return void(l-=10);if(e<11)return j(t,n,i,s,o,a,u,f,c,h);let g=r[l++];return(128&g)>0?void(l-=11):j(t,n,i,s,o,a,u,f,c,h,g)}{let c=r[l++],h=r[l++],g=r[l++],p=r[l++];if((128&c)>0||(128&h)>0||(128&g)>0||(128&p)>0)return void(l-=12);if(e<14){if(12===e)return j(t,n,i,s,o,a,u,f,c,h,g,p);{let e=r[l++];return(128&e)>0?void(l-=13):j(t,n,i,s,o,a,u,f,c,h,g,p,e)}}{let d=r[l++],y=r[l++];if((128&d)>0||(128&y)>0)return void(l-=14);if(e<15)return j(t,n,i,s,o,a,u,f,c,h,g,p,d,y);let w=r[l++];return(128&w)>0?void(l-=15):j(t,n,i,s,o,a,u,f,c,h,g,p,d,y,w)}}}}}function V(){let e,t=r[l++];if(t<192)e=t-160;else switch(t){case 217:e=r[l++];break;case 218:e=u.getUint16(l),l+=2;break;case 219:e=u.getUint32(l),l+=4;break;default:throw new Error("Expected string")}return T(e)}function P(e){return f.copyBuffers?Uint8Array.prototype.slice.call(r,l,l+=e):r.subarray(l,l+=e)}function N(e){let t=r[l++];if(g[t]){let n;return g[t](r.subarray(l,n=l+=e),(e=>{l=e;try{return A()}finally{l=n}}))}throw new Error("Unknown extension type "+t)}var F=new Array(4096);function C(){let e=r[l++];if(!(e>=160&&e<192))return l--,z(A());if(e-=160,h>=l)return s.slice(l-c,(l+=e)-c);if(!(0==h&&n<180))return _(e);let t,i=4095&(e<<5^(e>1?u.getUint16(l):e>0?r[l]:0)),o=F[i],a=l,f=l+e-3,g=0;if(o&&o.bytes==e){for(;a<f;){if(t=u.getUint32(a),t!=o[g++]){a=1879048192;break}a+=4}for(f+=3;a<f;)if(t=r[a++],t!=o[g++]){a=1879048192;break}if(a===f)return l=a,o.string;f-=3,a=l}for(o=[],F[i]=o,o.bytes=e;a<f;)t=u.getUint32(a),o.push(t),a+=4;for(f+=3;a<f;)t=r[a++],o.push(t);let p=e<16?D(e):L(e);return o.string=null!=p?p:_(e)}function z(e){if("string"==typeof e)return e;if("number"==typeof e||"boolean"==typeof e||"bigint"==typeof e)return e.toString();if(null==e)return e+"";if(f.allowArraysInMapKeys&&Array.isArray(e)&&e.flat().every((e=>["string","number","boolean","bigint"].includes(typeof e))))return e.flat().toString();throw new Error("Invalid property type for record: "+typeof e)}const W=(e,t)=>{let r=A().map(z),n=e;void 0!==t&&(e=e<32?-((t<<5)+e):(t<<5)+e,r.highByte=t);let s=i[e];return s&&(s.isShared||w)&&((i.restoreStructures||(i.restoreStructures=[]))[e]=s),i[e]=r,r.read=I(r,n),r.read()};g[0]=()=>{},g[0].noBuffer=!0,g[66]=e=>{let t=e.byteLength%8||8,r=BigInt(128&e[0]?e[0]-256:e[0]);for(let n=1;n<t;n++)r<<=BigInt(8),r+=BigInt(e[n]);if(e.byteLength!==t){let n=new DataView(e.buffer,e.byteOffset,e.byteLength),i=(e,t)=>{let r=t-e;if(r<=40){let r=n.getBigUint64(e);for(let i=e+8;i<t;i+=8)r<<=BigInt(64),r|=n.getBigUint64(i);return r}let s=e+(r>>4<<3),o=i(e,s),a=i(s,t);return o<<BigInt(8*(t-s))|a};r=r<<BigInt(8*(n.byteLength-t))|i(t,n.byteLength)}return r};let J={Error:Error,EvalError:EvalError,RangeError:RangeError,ReferenceError:ReferenceError,SyntaxError:SyntaxError,TypeError:TypeError,URIError:URIError,AggregateError:"function"==typeof AggregateError?AggregateError:null};g[101]=()=>{let e=A();if(!J[e[0]]){let t=Error(e[1],{cause:e[2]});return t.name=e[0],t}return J[e[0]](e[1],{cause:e[2]})},g[105]=e=>{if(!1===f.structuredClone)throw new Error("Structured clone extension is disabled");let t=u.getUint32(l-4);a||(a=new Map);let n,i=r[l];n=i>=144&&i<160||220==i||221==i?[]:i>=128&&i<144||222==i||223==i?new Map:(i>=199&&i<=201||i>=212&&i<=216)&&115===r[l+1]?new Set:{};let s={target:n};a.set(t,s);let o=A();if(!s.used)return s.target=o;if(Object.assign(n,o),n instanceof Map)for(let[e,t]of o.entries())n.set(e,t);if(n instanceof Set)for(let e of Array.from(o))n.add(e);return n},g[112]=e=>{if(!1===f.structuredClone)throw new Error("Structured clone extension is disabled");let t=u.getUint32(l-4),r=a.get(t);return r.used=!0,r.target},g[115]=()=>new Set(A());const K=["Int8","Uint8","Uint8Clamped","Int16","Uint16","Int32","Uint32","Float32","Float64","BigInt64","BigUint64"].map((e=>e+"Array"));let $="object"==typeof globalThis?globalThis:window;g[116]=e=>{let t=e[0],r=Uint8Array.prototype.slice.call(e,1).buffer,n=K[t];if(!n){if(16===t)return r;if(17===t)return new DataView(r);throw new Error("Could not find typed array for code "+t)}return new $[n](r)},g[120]=()=>{let e=A();return new RegExp(e[0],e[1])};const Y=[];function q(e){f&&f._onSaveState&&f._onSaveState();let t=n,g=l,p=c,d=h,y=s,b=a,S=o,m=new Uint8Array(r.slice(0,n)),U=i,A=i.slice(0,i.length),E=f,I=w,O=e();return n=t,l=g,c=p,h=d,s=y,a=b,o=S,r=m,w=I,(i=U).splice(0,i.length,...A),f=E,u=new DataView(r.buffer,r.byteOffset,r.byteLength),O}function H(){r=null,a=null,i=null}g[98]=e=>{let t=(e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3],r=l;return l+=t-e.length,o=Y,(o=[V(),V()]).position0=0,o.position1=0,o.postBundlePosition=l,l=r,A()},g[255]=e=>4==e.length?new Date(1e3*(16777216*e[0]+(e[1]<<16)+(e[2]<<8)+e[3])):8==e.length?new Date(((e[0]<<22)+(e[1]<<14)+(e[2]<<6)+(e[3]>>2))/1e6+1e3*(4294967296*(3&e[3])+16777216*e[4]+(e[5]<<16)+(e[6]<<8)+e[7])):12==e.length?new Date(((e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3])/1e6+1e3*((128&e[4]?-281474976710656:0)+1099511627776*e[6]+4294967296*e[7]+16777216*e[8]+(e[9]<<16)+(e[10]<<8)+e[11])):new Date("invalid");const Z=new Array(147);for(let e=0;e<256;e++)Z[e]=+("1e"+Math.floor(45.15-.30103*e));const G=S;var Q=new S({useRecords:!1});const X=Q.unpack,ee=Q.unpackMultiple,te=Q.unpack,re={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let ne,ie,se,oe=new Float32Array(1),ae=new Uint8Array(oe.buffer,0,4);S.SUPPORTS_STRUCT_HOOKS=!0;try{ne=new TextEncoder}catch(e){}const ue="undefined"!=typeof Buffer,le=ue?function(e){return Buffer.allocUnsafeSlow(e)}:Uint8Array,fe=ue?Buffer:Uint8Array,ce=ue?4294967296:2144337920;let he,ge,pe,de,ye=0,we=null;const be=/[\u0080-\uFFFF]/,Se=Symbol("record-id");class me extends S{constructor(e){let t,r,n,i;super(e),this.offset=0;let s=fe.prototype.utf8Write?function(e,t){return he.utf8Write(e,t,he.byteLength-t)}:!(!ne||!ne.encodeInto)&&function(e,t){return ne.encodeInto(e,he.subarray(t)).written},o=this;e||(e={});let a=e&&e.sequential,u=e.structures||e.saveStructures,l=e.maxSharedStructures;if(null==l&&(l=u?32:0),l>8160)throw new Error("Maximum maxSharedStructure is 8160");e.structuredClone&&null==e.moreTypes&&(this.moreTypes=!0);let f=e.maxOwnStructures;null==f&&(f=u?32:64),this.structures||0==e.useRecords||(this.structures=[]);let c=l>32||f+l>64,h=l+64,g=l+f+64;if(g>8256)throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");let p=[],d=0,y=0;this.pack=this.encode=function(e,s){if(he||(he=new le(8192),pe=he.dataView||(he.dataView=new DataView(he.buffer,0,8192)),ye=0),de=he.length-10,de-ye<2048?(he=new le(he.length),pe=he.dataView||(he.dataView=new DataView(he.buffer,0,he.length)),de=he.length-10,ye=0):ye=ye+7&2147483640,t=ye,s&De&&(ye+=255&s),i=o.structuredClone?new Map:null,o.bundleStrings&&"string"!=typeof e?(we=[],we.size=1/0):we=null,n=o.structures,n){n.uninitialized&&(n=o._mergeStructures(o.getStructures()));let e=n.sharedLength||0;if(e>l)throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+n.sharedLength);if(!n.transitions){n.transitions=Object.create(null);for(let t=0;t<e;t++){let e=n[t];if(!e)continue;let r,i=n.transitions;for(let t=0,n=e.length;t<n;t++){let n=e[t];r=i[n],r||(r=i[n]=Object.create(null)),i=r}i[Se]=t+64}this.lastNamedStructuresLength=e}a||(n.nextId=e+64)}let u;r&&(r=!1);try{o._writeStruct&&e&&"object"==typeof e?e.constructor===Object?I(e):e.constructor===Map||Array.isArray(e)||se.some((t=>e instanceof t))?S(e):I(e.toJSON?e.toJSON():e):S(e);let a=we;if(we&&Ie(t,S,0),i&&i.idsToInsert){let e=i.idsToInsert.sort(((e,t)=>e.offset>t.offset?1:-1)),r=e.length,n=-1;for(;a&&r>0;){let i=e[--r].offset+t;i<a.stringsPosition+t&&-1===n&&(n=0),i>a.position+t?n>=0&&(n+=6):(n>=0&&(pe.setUint32(a.position+t,pe.getUint32(a.position+t)+n),n=-1),a=a.previous,r++)}n>=0&&a&&pe.setUint32(a.position+t,pe.getUint32(a.position+t)+n),ye+=6*e.length,ye>de&&O(ye),o.offset=ye;let s=function(e,t){let r,n=6*t.length,i=e.length-n;for(;r=t.pop();){let t=r.offset,s=r.id;e.copyWithin(t+n,t,i),n-=6;let o=t+n;e[o++]=214,e[o++]=105,e[o++]=s>>24,e[o++]=s>>16&255,e[o++]=s>>8&255,e[o++]=255&s,i=t}return e}(he.subarray(t,ye),e);return i=null,s}return o.offset=ye,s&je?(he.start=t,he.end=ye,he):he.subarray(t,ye)}catch(e){throw u=e,e}finally{if(n&&(w(),r&&o.saveStructures)){let r=n.sharedLength||0,i=he.subarray(t,ye),a=(o._prepareStructures||Oe)(n,o);if(!u)return!1===o.saveStructures(a,a.isCompatible)?o.pack(e,s):(o.lastNamedStructuresLength=r,he.length>1073741824&&(he=null),i)}he.length>1073741824&&(he=null),s&Le&&(ye=t)}};const w=()=>{y<10&&y++;let e=n.sharedLength||0;if(n.length>e&&!a&&(n.length=e),d>1e4)n.transitions=null,y=0,d=0,p.length>0&&(p=[]);else if(p.length>0&&!a){for(let e=0,t=p.length;e<t;e++)p[e][Se]=0;p=[]}},b=e=>{var t=e.length;t<16?he[ye++]=144|t:t<65536?(he[ye++]=220,he[ye++]=t>>8,he[ye++]=255&t):(he[ye++]=221,pe.setUint32(ye,t),ye+=4);for(let r=0;r<t;r++)S(e[r])},S=e=>{ye>de&&(he=O(ye));var r,n=typeof e;if("string"===n){let n,i=e.length;if(we&&i>=4&&i<4096){if((we.size+=i)>21760){let e,r,n=(we[0]?3*we[0].length+we[1].length:0)+10;ye+n>de&&(he=O(ye+n)),we.position?(r=we,he[ye]=200,ye+=3,he[ye++]=98,e=ye-t,ye+=4,Ie(t,S,0),pe.setUint16(e+t-3,ye-t-e)):(he[ye++]=214,he[ye++]=98,e=ye-t,ye+=4),we=["",""],we.previous=r,we.size=0,we.position=e}let r=be.test(e);return we[r?0:1]+=e,he[ye++]=193,void S(r?-i:i)}n=i<32?1:i<256?2:i<65536?3:5;let o=3*i;if(ye+o>de&&(he=O(ye+o)),i<64||!s){let t,s,o,a=ye+n;for(t=0;t<i;t++)s=e.charCodeAt(t),s<128?he[a++]=s:s<2048?(he[a++]=s>>6|192,he[a++]=63&s|128):55296==(64512&s)&&56320==(64512&(o=e.charCodeAt(t+1)))?(s=65536+((1023&s)<<10)+(1023&o),t++,he[a++]=s>>18|240,he[a++]=s>>12&63|128,he[a++]=s>>6&63|128,he[a++]=63&s|128):(he[a++]=s>>12|224,he[a++]=s>>6&63|128,he[a++]=63&s|128);r=a-ye-n}else r=s(e,ye+n);r<32?he[ye++]=160|r:r<256?(n<2&&he.copyWithin(ye+2,ye+1,ye+1+r),he[ye++]=217,he[ye++]=r):r<65536?(n<3&&he.copyWithin(ye+3,ye+2,ye+2+r),he[ye++]=218,he[ye++]=r>>8,he[ye++]=255&r):(n<5&&he.copyWithin(ye+5,ye+3,ye+3+r),he[ye++]=219,pe.setUint32(ye,r),ye+=4),ye+=r}else if("number"===n)if(e>>>0===e)e<32||e<128&&!1===this.useRecords||e<64&&!this._writeStruct?he[ye++]=e:e<256?(he[ye++]=204,he[ye++]=e):e<65536?(he[ye++]=205,he[ye++]=e>>8,he[ye++]=255&e):(he[ye++]=206,pe.setUint32(ye,e),ye+=4);else if(e>>0===e)e>=-32?he[ye++]=256+e:e>=-128?(he[ye++]=208,he[ye++]=e+256):e>=-32768?(he[ye++]=209,pe.setInt16(ye,e),ye+=2):(he[ye++]=210,pe.setInt32(ye,e),ye+=4);else{let t;if((t=this.useFloat32)>0&&e<4294967296&&e>=-2147483648){let r;if(he[ye++]=202,pe.setFloat32(ye,e),t<4||(r=e*Z[(127&he[ye])<<1|he[ye+1]>>7])>>0===r)return void(ye+=4);ye--}he[ye++]=203,pe.setFloat64(ye,e),ye+=8}else if("object"===n||"function"===n)if(e){if(i){let r=i.get(e);if(r){if(!r.id){let e=i.idsToInsert||(i.idsToInsert=[]);r.id=e.push(r)}return he[ye++]=214,he[ye++]=112,pe.setUint32(ye,r.id),void(ye+=4)}i.set(e,{offset:ye-t})}let s=e.constructor;if(s===Object)E(e);else if(s===Array)b(e);else if(s===Map)if(this.mapAsEmptyObject)he[ye++]=128;else{(r=e.size)<16?he[ye++]=128|r:r<65536?(he[ye++]=222,he[ye++]=r>>8,he[ye++]=255&r):(he[ye++]=223,pe.setUint32(ye,r),ye+=4);for(let[t,r]of e)S(t),S(r)}else{for(let t=0,r=ie.length;t<r;t++){if(e instanceof se[t]){let r=ie[t];if(r.write){r.type&&(he[ye++]=212,he[ye++]=r.type,he[ye++]=0);let t=r.write.call(this,e);return void(t===e?Array.isArray(e)?b(e):E(e):S(t))}let n,i=he,s=pe,o=ye;he=null;try{n=r.pack.call(this,e,(e=>(he=i,i=null,ye+=e,ye>de&&O(ye),{target:he,targetView:pe,position:ye-e})),S)}finally{i&&(he=i,pe=s,ye=o,de=he.length-10)}return void(n&&(n.length+ye>de&&O(n.length+ye),ye=Ee(n,he,ye,r.type)))}}if(Array.isArray(e))b(e);else{if(e.toJSON){const t=e.toJSON();if(t!==e)return S(t)}if("function"===n)return S(this.writeFunction&&this.writeFunction(e));E(e)}}}else he[ye++]=192;else if("boolean"===n)he[ye++]=e?195:194;else if("bigint"===n){if(e<0x8000000000000000&&e>=-0x8000000000000000)he[ye++]=211,pe.setBigInt64(ye,e);else if(e<0x10000000000000000&&e>0)he[ye++]=207,pe.setBigUint64(ye,e);else{if(!this.largeBigIntToFloat){if(this.largeBigIntToString)return S(e.toString());if(this.useBigIntExtension||this.moreTypes){let t,r=e<0?BigInt(-1):BigInt(0);if(e>>BigInt(65536)===r){let n=BigInt(0x10000000000000000)-BigInt(1),i=[];for(;i.push(e&n),e>>BigInt(63)!==r;)e>>=BigInt(64);t=new Uint8Array(new BigUint64Array(i).buffer),t.reverse()}else{let r=e<0,n=(r?~e:e).toString(16);if(n.length%2?n="0"+n:parseInt(n.charAt(0),16)>=8&&(n="00"+n),ue)t=Buffer.from(n,"hex");else{t=new Uint8Array(n.length/2);for(let e=0;e<t.length;e++)t[e]=parseInt(n.slice(2*e,2*e+2),16)}if(r)for(let e=0;e<t.length;e++)t[e]=~t[e]}return t.length+ye>de&&O(t.length+ye),void(ye=Ee(t,he,ye,66))}throw new RangeError(e+" was too large to fit in MessagePack 64-bit integer format, use useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set largeBigIntToString to convert to string")}he[ye++]=203,pe.setFloat64(ye,Number(e))}ye+=8}else{if("undefined"!==n)throw new Error("Unknown type: "+n);this.encodeUndefinedAsNil?he[ye++]=192:(he[ye++]=212,he[ye++]=0,he[ye++]=0)}},m=this.variableMapSize||this.coercibleKeyAsNumber||this.skipValues?e=>{let t;if(this.skipValues){t=[];for(let r in e)"function"==typeof e.hasOwnProperty&&!e.hasOwnProperty(r)||this.skipValues.includes(e[r])||t.push(r)}else t=Object.keys(e);let r,n=t.length;if(n<16?he[ye++]=128|n:n<65536?(he[ye++]=222,he[ye++]=n>>8,he[ye++]=255&n):(he[ye++]=223,pe.setUint32(ye,n),ye+=4),this.coercibleKeyAsNumber)for(let i=0;i<n;i++){r=t[i];let n=Number(r);S(isNaN(n)?r:n),S(e[r])}else for(let i=0;i<n;i++)S(r=t[i]),S(e[r])}:e=>{he[ye++]=222;let r=ye-t;ye+=2;let n=0;for(let t in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(t))&&(S(t),S(e[t]),n++);if(n>65535)throw new Error('Object is too large to serialize with fast 16-bit map size, use the "variableMapSize" option to serialize this object');he[r+++t]=n>>8,he[r+t]=255&n},U=!1===this.useRecords?m:e.progressiveRecords&&!c?e=>{let r,i,s=n.transitions||(n.transitions=Object.create(null)),o=ye++-t;for(let a in e)if("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(a)){if(r=s[a],r)s=r;else{let u=Object.keys(e),l=s;s=n.transitions;let f=0;for(let e=0,t=u.length;e<t;e++){let t=u[e];r=s[t],r||(r=s[t]=Object.create(null),f++),s=r}o+t+1==ye?(ye--,v(s,u,f)):_(s,u,o,f),i=!0,s=l[a]}S(e[a])}if(!i){let r=s[Se];r?he[o+t]=r:_(s,Object.keys(e),o,0)}}:e=>{let t,r=n.transitions||(n.transitions=Object.create(null)),i=0;for(let n in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(n))&&(t=r[n],t||(t=r[n]=Object.create(null),i++),r=t);let s=r[Se];s?s>=96&&c?(he[ye++]=96+(31&(s-=96)),he[ye++]=s>>5):he[ye++]=s:v(r,r.__keys__||Object.keys(e),i);for(let t in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(t))&&S(e[t])},A="function"==typeof this.useRecords&&this.useRecords,E=A?e=>{A(e)?U(e):m(e)}:U,I=e=>{let i=o._writeStruct(e,he,t,ye,n,O,((e,t,n)=>{if(n)return r=!0;ye=t;let i=he;return S(e),w(),i!==he?{position:ye,targetView:pe,target:he}:ye}));if(0===i)return E(e);ye=i},O=e=>{let r;if(e>16777216){if(e-t>ce)throw new Error("Packed buffer would be larger than maximum buffer size");r=Math.min(ce,4096*Math.round(Math.max((e-t)*(e>67108864?1.25:2),4194304)/4096))}else r=1+(Math.max(e-t<<2,he.length-1)>>12)<<12;let n=new le(r);return pe=n.dataView||(n.dataView=new DataView(n.buffer,0,r)),e=Math.min(e,he.length),he.copy?he.copy(n,0,t,e):n.set(he.slice(t,e)),ye-=t,t=0,de=n.length-10,he=n},v=(e,t,i)=>{let s=n.nextId;s||(s=64),s<h&&this.shouldShareStructure&&!this.shouldShareStructure(t)?(s=n.nextOwnId,s<g||(s=h),n.nextOwnId=s+1):(s>=g&&(s=h),n.nextId=s+1);let o=t.highByte=s>=96&&c?s-96>>5:-1;e[Se]=s,e.__keys__=t,n[s-64]=t,s<h?(t.isShared=!0,n.sharedLength=s-63,r=!0,o>=0?(he[ye++]=96+(31&s),he[ye++]=o):he[ye++]=s):(o>=0?(he[ye++]=213,he[ye++]=114,he[ye++]=96+(31&s),he[ye++]=o):(he[ye++]=212,he[ye++]=114,he[ye++]=s),i&&(d+=y*i),p.length>=f&&(p.shift()[Se]=0),p.push(e),S(t))},_=(e,r,n,i)=>{let s=he,o=ye,a=de,u=t;he=ge,ye=0,t=0,he||(ge=he=new le(8192)),de=he.length-10,v(e,r,i),ge=he;let l=ye;if(he=s,ye=o,de=a,t=u,l>1){let e=ye+l-1;e>de&&O(e);let r=n+t;he.copyWithin(r+l,r+1,ye),he.set(ge.slice(0,l),r),ye=e}else he[n+t]=ge[0]}}useBuffer(e){he=e,he.dataView||(he.dataView=new DataView(he.buffer,he.byteOffset,he.byteLength)),pe=he.dataView,ye=0}set position(e){ye=e}get position(){return ye}clearSharedData(){this.structures&&(this.structures=[]),this.typedStructs&&(this.typedStructs=[])}}function Ue(e,t,r,n){let i=e.byteLength;if(i+1<256){var{target:s,position:o}=r(4+i);s[o++]=199,s[o++]=i+1}else if(i+1<65536){var{target:s,position:o}=r(5+i);s[o++]=200,s[o++]=i+1>>8,s[o++]=i+1&255}else{var{target:s,position:o,targetView:a}=r(7+i);s[o++]=201,a.setUint32(o,i+1),o+=4}s[o++]=116,s[o++]=t,e.buffer||(e=new Uint8Array(e)),s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),o)}function Ae(e,t){let r=e.byteLength;var n,i;if(r<256){var{target:n,position:i}=t(r+2);n[i++]=196,n[i++]=r}else if(r<65536){var{target:n,position:i}=t(r+3);n[i++]=197,n[i++]=r>>8,n[i++]=255&r}else{var{target:n,position:i,targetView:s}=t(r+5);n[i++]=198,s.setUint32(i,r),i+=4}n.set(e,i)}function Ee(e,t,r,n){let i=e.length;switch(i){case 1:t[r++]=212;break;case 2:t[r++]=213;break;case 4:t[r++]=214;break;case 8:t[r++]=215;break;case 16:t[r++]=216;break;default:i<256?(t[r++]=199,t[r++]=i):i<65536?(t[r++]=200,t[r++]=i>>8,t[r++]=255&i):(t[r++]=201,t[r++]=i>>24,t[r++]=i>>16&255,t[r++]=i>>8&255,t[r++]=255&i)}return t[r++]=n,t.set(e,r),r+=i}function Ie(e,t,r){if(we.length>0){pe.setUint32(we.position+e,ye+r-we.position-e),we.stringsPosition=ye-e;let n=we;we=null,t(n[0]),t(n[1])}}function Oe(e,t){return e.isCompatible=e=>{let r=!e||(t.lastNamedStructuresLength||0)===e.length;return r||t._mergeStructures(e),r},e}se=[Date,Set,Error,RegExp,ArrayBuffer,Object.getPrototypeOf(Uint8Array.prototype).constructor,DataView,d],ie=[{pack(e,t,r){let n=e.getTime()/1e3;if((this.useTimestamp32||0===e.getMilliseconds())&&n>=0&&n<4294967296){let{target:e,targetView:r,position:i}=t(6);e[i++]=214,e[i++]=255,r.setUint32(i,n)}else if(n>0&&n<4294967296){let{target:r,targetView:i,position:s}=t(10);r[s++]=215,r[s++]=255,i.setUint32(s,4e6*e.getMilliseconds()+(n/1e3/4294967296>>0)),i.setUint32(s+4,n)}else if(isNaN(n)){if(this.onInvalidDate)return t(0),r(this.onInvalidDate());let{target:e,targetView:n,position:i}=t(3);e[i++]=212,e[i++]=255,e[i++]=255}else{let{target:r,targetView:i,position:s}=t(15);r[s++]=199,r[s++]=12,r[s++]=255,i.setUint32(s,1e6*e.getMilliseconds()),i.setBigInt64(s+4,BigInt(Math.floor(n)))}}},{pack(e,t,r){if(this.setAsEmptyObject)return t(0),r({});let n=Array.from(e),{target:i,position:s}=t(this.moreTypes?3:0);this.moreTypes&&(i[s++]=212,i[s++]=115,i[s++]=0),r(n)}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=101,n[i++]=0),r([e.name,e.message,e.cause])}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=120,n[i++]=0),r([e.source,e.flags])}},{pack(e,t){this.moreTypes?Ue(e,16,t):Ae(ue?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let r=e.constructor;r!==fe&&this.moreTypes?Ue(e,K.indexOf(r.name),t):Ae(e,t)}},{pack(e,t){this.moreTypes?Ue(e,17,t):Ae(ue?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let{target:r,position:n}=t(1);r[n]=193}}],me.SUPPORTS_STRUCT_HOOKS=!0;let ve=new me({useRecords:!1});const _e=ve.pack,ke=ve.pack,Be=me,{NEVER:xe,ALWAYS:Te,DECIMAL_ROUND:Me,DECIMAL_FIT:Re}=re,je=512,Le=1024,De=2048;const Ve=function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise");const r=new S(t);let n;const i=e=>{let t;n&&(e=Buffer.concat([n,e]),n=void 0);try{t=r.unpackMultiple(e)}catch(r){if(!r.incomplete)throw r;n=e.slice(r.lastPosition),t=r.values}return t};return"function"==typeof e[Symbol.iterator]?function*(){for(const t of e)yield*i(t)}():"function"==typeof e[Symbol.asyncIterator]?async function*(){for await(const t of e)yield*i(t)}():void 0},Pe=function(e,t={}){if(e&&"object"==typeof e){if("function"==typeof e[Symbol.iterator])return function*(e,t){const r=new me(t);for(const t of e)yield r.pack(t)}(e,t);if("function"==typeof e.then||"function"==typeof e[Symbol.asyncIterator])return async function*(e,t){const r=new me(t);for await(const t of e)yield r.pack(t)}(e,t);throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise")}throw new Error("first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable")};e.ALWAYS=Te,e.C1=y,e.DECIMAL_FIT=Re,e.DECIMAL_ROUND=Me,e.Decoder=G,e.Encoder=Be,e.FLOAT32_OPTIONS=re,e.NEVER=xe,e.Packr=me,e.RESERVE_START_SPACE=De,e.RESET_BUFFER_MODE=Le,e.REUSE_BUFFER_MODE=je,e.Unpackr=S,e.addExtension=function(e){if(e.Class){if(!e.pack&&!e.write)throw new Error("Extension has no pack or write function");if(e.pack&&!e.type)throw new Error("Extension has no type (numeric code to identify the extension)");se.unshift(e.Class),ie.unshift(e)}!function(e){e.unpack?g[e.type]=e.unpack:g[e.type]=e}(e)},e.clearSource=H,e.decode=te,e.decodeIter=Ve,e.encode=ke,e.encodeIter=Pe,e.isNativeAccelerationEnabled=!1,e.mapsAsObjects=!0,e.pack=_e,e.roundFloat32=function(e){oe[0]=e;let t=Z[(127&ae[3])<<1|ae[2]>>7];return(t*e+(e>0?.5:-.5)>>0)/t},e.unpack=X,e.unpackMultiple=ee,e.useRecords=!1}));
+//# sourceMappingURL=index-no-eval.min.js.map
diff --git a/node_modules/msgpackr/dist/index-no-eval.min.js.map b/node_modules/msgpackr/dist/index-no-eval.min.js.map
new file mode 100644
index 0000000..bdf2547
--- /dev/null
+++ b/node_modules/msgpackr/dist/index-no-eval.min.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index-no-eval.min.js","sources":["../unpack.js","../pack.js","../iterators.js","../index.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","import { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\n\n/**\n * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer\n * If the argument is only Async Iterable, the return value will be an Async Iterable.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object\n * @param {options} [options] - msgpackr pack options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator>}\n */\nexport function packIter (objectIterator, options = {}) {\n  if (!objectIterator || typeof objectIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');\n  } else if (typeof objectIterator[Symbol.iterator] === 'function') {\n    return packIterSync(objectIterator, options);\n  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {\n    return packIterAsync(objectIterator, options);\n  } else {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');\n  }\n}\n\nfunction * packIterSync (objectIterator, options) {\n  const packr = new Packr(options);\n  for (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\nasync function * packIterAsync (objectIterator, options) {\n  const packr = new Packr(options);\n  for await (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\n/**\n * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects\n * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator\n * @param {object} [options] - unpackr options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator}\n */\nexport function unpackIter (bufferIterator, options = {}) {\n  if (!bufferIterator || typeof bufferIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');\n  }\n\n  const unpackr = new Unpackr(options);\n  let incomplete;\n  const parser = (chunk) => {\n    let yields;\n    // if there's incomplete data from previous chunk, concatinate and try again\n    if (incomplete) {\n      chunk = Buffer.concat([incomplete, chunk]);\n      incomplete = undefined;\n    }\n\n    try {\n      yields = unpackr.unpackMultiple(chunk);\n    } catch (err) {\n      if (err.incomplete) {\n        incomplete = chunk.slice(err.lastPosition);\n        yields = err.values;\n      } else {\n        throw err;\n      }\n    }\n    return yields;\n  };\n\n  if (typeof bufferIterator[Symbol.iterator] === 'function') {\n    return (function * iter () {\n      for (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {\n    return (async function * iter () {\n      for await (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  }\n}\nexport const decodeIter = unpackIter;\nexport const encodeIter = packIter;","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\n"],"names":["decoder","src","srcEnd","TextDecoder","error","currentStructures","srcString","bundledStrings","referenceMap","dataView","position","currentUnpackr","srcStringStart","srcStringEnd","currentExtensions","defaultOptions","useRecords","mapsAsObjects","C1Type","C1","name","sequentialMode","inlineObjectReadThreshold","Unpackr","constructor","options","undefined","sequential","trusted","structures","maxSharedStructures","sharedLength","length","getStructures","uninitialized","int64AsNumber","int64AsType","Object","assign","this","unpack","source","saveState","clearSource","prototype","call","buffer","ArrayBuffer","Buffer","from","Uint8Array","end","start","DataView","byteOffset","byteLength","Error","checkedRead","unpackMultiple","forEach","values","lastPosition","size","value","defaultUnpackr","push","_mergeStructures","loadedStructures","existingStructures","_onLoadedStructures","isFrozen","map","structure","slice","i","l","isShared","highByte","id","existing","restoreStructures","decode","result","_readStruct","lazy","toJSON","read","postBundlePosition","jsonView","JSON","stringify","_","RangeError","message","startsWith","incomplete","token","loadStructures","createStructureReader","object","key","readKey","Map","set","array","Array","freezeData","freeze","string","shortStringInJS","longStringInJS","readFixedString","position1","position0","readBin","getUint16","getUint32","readExt","getFloat32","useFloat32","multiplier","mult10","getFloat64","getBigUint64","toString","BigInt","Number","getInt8","getInt16","getInt32","getBigInt64","recordDefinition","extension","noBuffer","subarray","readString8","readString16","readString32","readArray","readMap","validName","firstId","readObject","count","optimizedReadObject","BlockedFunction","test","join","Infinity","createSecondByteReader","read0","readStringJS","units","byte1","codePoint","unit","fromCharCode","apply","String","bytes","byte","a","b","c","d","e","f","g","h","j","k","m","n","o","readOnlyJSString","copyBuffers","type","readPosition","keyCache","asSafeString","chunk","entry","checkPosition","property","allowArraysInMapKeys","isArray","flat","every","item","includes","firstByte","existingStructure","data","headLength","head","view","out","middle","left","right","errors","EvalError","ReferenceError","SyntaxError","TypeError","URIError","AggregateError","cause","structuredClone","target","Set","refEntry","targetProperties","used","v","entries","add","get","typedArrays","glbl","globalThis","window","typeCode","typedArrayName","RegExp","TEMP_BUNDLE","callback","_onSaveState","savedSrcEnd","savedPosition","savedSrcStringStart","savedSrcStringEnd","savedSrcString","savedReferenceMap","savedBundledStrings","savedSrc","savedStructures","savedStructuresContents","savedPackr","savedSequentialMode","splice","dataSize","dataPosition","Date","Math","floor","Decoder","FLOAT32_OPTIONS","NEVER","ALWAYS","DECIMAL_ROUND","DECIMAL_FIT","textEncoder","extensions","extensionClasses","f32Array","Float32Array","u8Array","SUPPORTS_STRUCT_HOOKS","TextEncoder","hasNodeBuffer","ByteArrayAllocate","allocUnsafeSlow","ByteArray","MAX_BUFFER_SIZE","keysTarget","targetView","safeEnd","hasNonLatin","RECORD_SYMBOL","Symbol","Packr","hasSharedUpdate","super","offset","encodeUtf8","utf8Write","encodeInto","written","packr","isSequential","hasSharedStructures","saveStructures","moreTypes","maxOwnStructures","useTwoByteRecords","sharedLimitId","maxStructureId","recordIdsToRemove","transitionsCount","serializationsSinceTransitionRebuild","pack","encode","encodeOptions","RESERVE_START_SPACE","bundleStrings","transitions","create","keys","nextTransition","transition","lastNamedStructuresLength","nextId","encodingError","_writeStruct","writeStruct","some","extClass","lastBundle","writeBundles","idsToInsert","sort","incrementPosition","insertionPoint","stringsPosition","setUint32","previous","makeRoom","serialized","distanceToMove","lastEnd","pop","copyWithin","insertIds","REUSE_BUFFER_MODE","resetStructures","returnBuffer","newSharedData","_prepareStructures","prepareStructures","isCompatible","RESET_BUFFER_MODE","packArray","headerSize","strLength","extStart","maxBytes","setUint16","twoByte","c1","c2","strPosition","charCodeAt","setInt16","setInt32","xShifted","setFloat32","setFloat64","referee","writeObject","mapAsEmptyObject","entryValue","write","writeResult","currentTarget","currentTargetView","currentPosition","writeExtensionData","json","writeFunction","setBigInt64","setBigUint64","largeBigIntToFloat","largeBigIntToString","useBigIntExtension","empty","mask","chunks","BigUint64Array","reverse","invert","parseInt","charAt","encodeUndefinedAsNil","writePlainObject","variableMapSize","coercibleKeyAsNumber","skipValues","hasOwnProperty","num","isNaN","objectOffset","writeRecord","progressiveRecords","wroteKeys","lastTransition","newTransitions","newRecord","insertNewRecord","recordId","__keys__","checkUseRecords","newPosition","notifySharedUpdate","startTarget","newSize","min","round","max","newBuffer","copy","shouldShareStructure","nextOwnId","shift","insertionOffset","mainTarget","mainPosition","mainSafeEnd","mainStart","keysPosition","newEnd","insertionPosition","useBuffer","clearSharedData","typedStructs","writeExtBuffer","typedArray","allocateForWrite","writeBuffer","writeStrings","compatible","getPrototypeOf","date","seconds","getTime","useTimestamp32","getMilliseconds","onInvalidDate","setAsEmptyObject","regex","flags","arrayBuffer","indexOf","defaultPackr","Encoder","decodeIter","bufferIterator","unpackr","parser","yields","concat","err","iterator","asyncIterator","encodeIter","objectIterator","packIterSync","then","async","packIterAsync","Class","unshift","unpackAddExtension","float32Number"],"mappings":"gPAAA,IAAIA,EAIAC,EACAC,EAJJ,IACCF,EAAU,IAAIG,WACE,CAAf,MAAMC,GAAS,CAGjB,IAMIC,EACAC,EAGAC,EACAC,EAEAC,EAbAC,EAAW,EAKXC,EAAiB,CAAA,EAGjBC,EAAiB,EACjBC,EAAe,EAGfC,EAAoB,GAEpBC,EAAiB,CACpBC,YAAY,EACZC,eAAe,GAET,MAAMC,GACD,MAACC,EAAK,IAAID,EACtBC,EAAGC,KAAO,mBACV,IAAIC,GAAiB,EACjBC,EAA4B,EAGzB,MAAMC,EACZC,YAAYC,GACPA,KACwB,IAAvBA,EAAQT,iBAAkDU,IAA1BD,EAAQR,gBAC3CQ,EAAQR,eAAgB,GACrBQ,EAAQE,aAAkC,IAApBF,EAAQG,UACjCH,EAAQG,SAAU,EACbH,EAAQI,YAAoC,GAAtBJ,EAAQT,aAClCS,EAAQI,WAAa,GAChBJ,EAAQK,sBACZL,EAAQK,oBAAsB,KAG7BL,EAAQI,WACXJ,EAAQI,WAAWE,aAAeN,EAAQI,WAAWG,OAC7CP,EAAQQ,iBACfR,EAAQI,WAAa,IAAIK,eAAgB,EAC1CT,EAAQI,WAAWE,aAAe,GAE/BN,EAAQU,gBACXV,EAAQW,YAAc,WAGxBC,OAAOC,OAAOC,KAAMd,EACpB,CACDe,OAAOC,EAAQhB,GACd,GAAIxB,EAEH,OAAOyC,GAAU,KAChBC,IACOJ,KAAOA,KAAKC,OAAOC,EAAQhB,GAAWF,EAAQqB,UAAUJ,OAAOK,KAAK9B,EAAgB0B,EAAQhB,MAGhGgB,EAAOK,QAAUL,EAAOjB,cAAgBuB,cAC5CN,EAA2B,oBAAXO,OAAyBA,OAAOC,KAAKR,GAAU,IAAIS,WAAWT,IACxD,iBAAZhB,GACVvB,EAASuB,EAAQ0B,KAAOV,EAAOT,OAC/BtB,EAAWe,EAAQ2B,OAAS,IAE5B1C,EAAW,EACXR,EAASuB,GAAW,EAAIA,EAAUgB,EAAOT,QAG1CnB,EAAe,EACfP,EAAY,KAEZC,EAAiB,KACjBN,EAAMwC,EAIN,IACChC,EAAWgC,EAAOhC,WAAagC,EAAOhC,SAAW,IAAI4C,SAASZ,EAAOK,OAAQL,EAAOa,WAAYb,EAAOc,YAOvG,CANC,MAAMnD,GAGP,GADAH,EAAM,KACFwC,aAAkBS,WACrB,MAAM9C,EACP,MAAM,IAAIoD,MAAM,oDAAuDf,GAA2B,iBAAVA,EAAsBA,EAAOjB,YAAYJ,YAAcqB,GAC/I,CACD,GAAIF,gBAAgBhB,EAAS,CAE5B,GADAZ,EAAiB4B,KACbA,KAAKV,WAER,OADAxB,EAAoBkC,KAAKV,WAClB4B,EAAYhC,KACRpB,GAAqBA,EAAkB2B,OAAS,KAC3D3B,EAAoB,GAExB,MACGM,EAAiBI,IACZV,GAAqBA,EAAkB2B,OAAS,KACpD3B,EAAoB,IAEtB,OAAOoD,EAAYhC,EACnB,CACDiC,eAAejB,EAAQkB,GACtB,IAAIC,EAAQC,EAAe,EAC3B,IACCxC,GAAiB,EACjB,IAAIyC,EAAOrB,EAAOT,OACd+B,EAAQxB,KAAOA,KAAKC,OAAOC,EAAQqB,GAAQE,EAAexB,OAAOC,EAAQqB,GAC7E,IAAIH,EASC,CAEJ,IADAC,EAAS,CAAEG,GACLrD,EAAWoD,GAChBD,EAAenD,EACfkD,EAAOK,KAAKR,KAEb,OAAOG,CACP,CAfA,IAA+C,IAA3CD,EAAQI,EAAOF,EAAcnD,GAAqB,OACtD,KAAMA,EAAWoD,GAEhB,GADAD,EAAenD,GACwC,IAAnDiD,EAAQF,IAAeI,EAAcnD,GACxC,MAmBH,CAPC,MAAMN,GAGP,MAFAA,EAAMyD,aAAeA,EACrBzD,EAAMwD,OAASA,EACTxD,CACT,CAAY,QACTiB,GAAiB,EACjBsB,GACA,CACD,CACDuB,iBAAiBC,EAAkBC,GAC9B7B,KAAK8B,sBACRF,EAAmB5B,KAAK8B,oBAAoBF,IAC7CA,EAAmBA,GAAoB,GACnC9B,OAAOiC,SAASH,KACnBA,EAAmBA,EAAiBI,KAAIC,GAAaA,EAAUC,MAAM,MACtE,IAAK,IAAIC,EAAI,EAAGC,EAAIR,EAAiBnC,OAAQ0C,EAAIC,EAAGD,IAAK,CACxD,IAAIF,EAAYL,EAAiBO,GAC7BF,IACHA,EAAUI,UAAW,EACjBF,GAAK,KACRF,EAAUK,SAAYH,EAAI,IAAO,GAEnC,CACDP,EAAiBpC,aAAeoC,EAAiBnC,OACjD,IAAK,IAAI8C,KAAMV,GAAsB,GACpC,GAAIU,GAAM,EAAG,CACZ,IAAIN,EAAYL,EAAiBW,GAC7BC,EAAWX,EAAmBU,GAC9BC,IACCP,KACFL,EAAiBa,oBAAsBb,EAAiBa,kBAAoB,KAAKF,GAAMN,GACzFL,EAAiBW,GAAMC,EAExB,CAEF,OAAOxC,KAAKV,WAAasC,CACzB,CACDc,OAAOxC,EAAQhB,GACd,OAAOc,KAAKC,OAAOC,EAAQhB,EAC3B,EAKK,SAASgC,EAAYhC,GAC3B,IACC,IAAKd,EAAeiB,UAAYP,EAAgB,CAC/C,IAAIU,EAAe1B,EAAkB0B,cAAgB,EACjDA,EAAe1B,EAAkB2B,SACpC3B,EAAkB2B,OAASD,EAC5B,CACD,IAAImD,EAkBJ,GAjBIvE,EAAewE,aAAelF,EAAIS,GAAY,IAAQT,EAAIS,IAAa,IAC1EwE,EAASvE,EAAewE,YAAYlF,EAAKS,EAAUR,GACnDD,EAAM,KACAwB,GAAWA,EAAQ2D,OAASF,IACjCA,EAASA,EAAOG,UACjB3E,EAAWR,GAEXgF,EAASI,IACN/E,IACHG,EAAWH,EAAegF,mBAC1BhF,EAAiB,MAEdc,IAGHhB,EAAkB2E,kBAAoB,MAEnCtE,GAAYR,EAEXG,GAAqBA,EAAkB2E,mBAC1CA,IACD3E,EAAoB,KACpBJ,EAAM,KACFO,IACHA,EAAe,UACV,IAAIE,EAAWR,EAErB,MAAM,IAAIsD,MAAM,sCACV,IAAKnC,EAAgB,CAC3B,IAAImE,EACJ,IACCA,EAAWC,KAAKC,UAAUR,GAAQ,CAACS,EAAG5B,IAA2B,iBAAVA,EAAqB,GAAGA,KAAWA,IAAOU,MAAM,EAAG,IAG1G,CAFC,MAAMrE,GACPoF,EAAW,4BAA8BpF,EAAQ,GACjD,CACD,MAAM,IAAIoD,MAAM,4CAA8CgC,EAC9D,EAED,OAAON,CASP,CARC,MAAM9E,GAOP,MANIC,GAAqBA,EAAkB2E,mBAC1CA,IACDrC,KACIvC,aAAiBwF,YAAcxF,EAAMyF,QAAQC,WAAW,6BAA+BpF,EAAWR,KACrGE,EAAM2F,YAAa,GAEd3F,CACN,CACF,CAEA,SAAS4E,IACR,IAAK,IAAIF,KAAMzE,EAAkB2E,kBAChC3E,EAAkByE,GAAMzE,EAAkB2E,kBAAkBF,GAE7DzE,EAAkB2E,kBAAoB,IACvC,CAEO,SAASM,IACf,IAAIU,EAAQ/F,EAAIS,KAChB,GAAIsF,EAAQ,IAAM,CACjB,GAAIA,EAAQ,IAAM,CACjB,GAAIA,EAAQ,GACX,OAAOA,EACH,CACJ,IAAIxB,EAAYnE,EAA0B,GAAR2F,IACjCrF,EAAesB,eAAiBgE,IAAyB,GAARD,GAClD,OAAIxB,GACEA,EAAUc,OACdd,EAAUc,KAAOY,EAAsB1B,EAAmB,GAARwB,IAE5CxB,EAAUc,QAEVU,CACR,CACJ,CAAS,GAAIA,EAAQ,IAAM,CAGxB,GADAA,GAAS,IACLrF,EAAeM,cAAe,CACjC,IAAIkF,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGA,EAAIsB,EAAOtB,IAAK,CAC/B,IAAI0B,EAAMC,IACE,cAARD,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAOa,CACX,CAAU,CACN,IAAI5B,EAAM,IAAI+B,IACd,IAAK,IAAI5B,EAAI,EAAGA,EAAIsB,EAAOtB,IAC1BH,EAAIgC,IAAIjB,IAAQA,KAEjB,OAAOf,CACP,CACJ,CAAS,CACNyB,GAAS,IACT,IAAIQ,EAAQ,IAAIC,MAAMT,GACtB,IAAK,IAAItB,EAAI,EAAGA,EAAIsB,EAAOtB,IAC1B8B,EAAM9B,GAAKY,IAEZ,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOH,GACfA,CACP,CACH,CAAQ,GAAIR,EAAQ,IAAM,CAExB,IAAIhE,EAASgE,EAAQ,IACrB,GAAInF,GAAgBH,EACnB,OAAOJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYsB,GAAUpB,GAE1E,GAAoB,GAAhBC,GAAqBX,EAAS,IAAK,CAEtC,IAAI0G,EAAS5E,EAAS,GAAK6E,EAAgB7E,GAAU8E,EAAe9E,GACpE,GAAc,MAAV4E,EACH,OAAOA,CACR,CACD,OAAOG,EAAgB/E,EACzB,CAAQ,CACN,IAAI+B,EACJ,OAAQiC,GACP,KAAK,IAAM,OAAO,KAClB,KAAK,IACJ,OAAIzF,GACHwD,EAAQuB,IACJvB,EAAQ,EACJxD,EAAe,GAAGkE,MAAMlE,EAAeyG,UAAWzG,EAAeyG,WAAajD,GAE9ExD,EAAe,GAAGkE,MAAMlE,EAAe0G,UAAW1G,EAAe0G,WAAalD,IAEhF5C,EACR,KAAK,IAAM,OAAO,EAClB,KAAK,IAAM,OAAO,EAClB,KAAK,IAGJ,GADA4C,EAAQ9D,EAAIS,UACEgB,IAAVqC,EACH,MAAM,IAAIP,MAAM,4BACjB,OAAO0D,EAAQnD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLwG,EAAQnD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLwG,EAAQnD,GAChB,KAAK,IAEJ,OAAOsD,EAAQpH,EAAIS,MACpB,KAAK,IAIJ,OAFAqD,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACL2G,EAAQtD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACL2G,EAAQtD,GAChB,KAAK,IAEJ,GADAA,EAAQtD,EAAS6G,WAAW5G,GACxBC,EAAe4G,WAAa,EAAG,CAElC,IAAIC,EAAaC,GAAyB,IAAhBxH,EAAIS,KAAqB,EAAMT,EAAIS,EAAW,IAAM,GAE9E,OADAA,GAAY,GACH8G,EAAazD,GAASA,EAAQ,EAAI,IAAO,KAAS,GAAKyD,CAChE,CAED,OADA9G,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAASiH,WAAWhH,GAC5BA,GAAY,EACLqD,EAER,KAAK,IACJ,OAAO9D,EAAIS,KACZ,KAAK,IAGJ,OAFAqD,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLqD,EACR,KAAK,IAYJ,MAXmC,WAA/BpD,EAAeyB,aAClB2B,EAAuC,WAA/BtD,EAAS2G,UAAU1G,GAC3BqD,GAAStD,EAAS2G,UAAU1G,EAAW,IACE,WAA/BC,EAAeyB,YACzB2B,EAAQtD,EAASkH,aAAajH,GAAUkH,WACC,SAA/BjH,EAAeyB,aACzB2B,EAAQtD,EAASkH,aAAajH,GAC1BqD,GAAO8D,OAAO,IAAIA,OAAO,MAAK9D,EAAM+D,OAAO/D,KAE/CA,EAAQtD,EAASkH,aAAajH,GAC/BA,GAAY,EACLqD,EAGR,KAAK,IACJ,OAAOtD,EAASsH,QAAQrH,KACzB,KAAK,IAGJ,OAFAqD,EAAQtD,EAASuH,SAAStH,GAC1BA,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAASwH,SAASvH,GAC1BA,GAAY,EACLqD,EACR,KAAK,IAYJ,MAXmC,WAA/BpD,EAAeyB,aAClB2B,EAAsC,WAA9BtD,EAASwH,SAASvH,GAC1BqD,GAAStD,EAAS2G,UAAU1G,EAAW,IACE,WAA/BC,EAAeyB,YACzB2B,EAAQtD,EAASyH,YAAYxH,GAAUkH,WACE,SAA/BjH,EAAeyB,aACzB2B,EAAQtD,EAASyH,YAAYxH,GACzBqD,GAAO8D,QAAQ,IAAIA,OAAO,KAAK9D,GAAO8D,OAAO,IAAIA,OAAO,MAAK9D,EAAM+D,OAAO/D,KAE9EA,EAAQtD,EAASyH,YAAYxH,GAC9BA,GAAY,EACLqD,EAER,KAAK,IAGJ,GADAA,EAAQ9D,EAAIS,KACC,KAATqD,EACH,OAAOoE,EAAmC,GAAlBlI,EAAIS,MACtB,CACN,IAAI0H,EAAYtH,EAAkBiD,GAClC,GAAIqE,EACH,OAAIA,EAAU9C,MACb5E,IACO0H,EAAU9C,KAAKA,MACZ8C,EAAUC,UACpB3H,IACO0H,KAEAA,EAAUnI,EAAIqI,SAAS5H,IAAYA,IAE3C,MAAM,IAAI8C,MAAM,qBAAuBO,EACxC,CACF,KAAK,IAGJ,OADAA,EAAQ9D,EAAIS,GACC,KAATqD,GACHrD,IACOyH,EAAmC,GAAlBlI,EAAIS,KAAoBT,EAAIS,OAE7C2G,EAAQ,GACjB,KAAK,IAEJ,OAAOA,EAAQ,GAChB,KAAK,IAEJ,OAAOA,EAAQ,GAChB,KAAK,IAEJ,OAAOA,EAAQ,IAChB,KAAK,IAGJ,OADAtD,EAAQ9D,EAAIS,KACRG,GAAgBH,EACZJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE2H,EAAYxE,GACpB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAEvBG,IADJH,GAAY,GAEJJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE4H,EAAazE,GACrB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAEvBG,IADJH,GAAY,GAEJJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE6H,EAAa1E,GACrB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLgI,EAAU3E,GAClB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLgI,EAAU3E,GAClB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLiI,EAAQ5E,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLiI,EAAQ5E,GAChB,QACC,GAAIiC,GAAS,IACZ,OAAOA,EAAQ,IAChB,QAActE,IAAVsE,EAAqB,CACxB,IAAI5F,EAAQ,IAAIoD,MAAM,sCAEtB,MADApD,EAAM2F,YAAa,EACb3F,CACN,CACD,MAAM,IAAIoD,MAAM,6BAA+BwC,GAGjD,CACF,CACA,MAAM4C,EAAY,4BAClB,SAAS1C,EAAsB1B,EAAWqE,GACzC,SAASC,IAER,GAAIA,EAAWC,QAAUzH,EAA2B,CACnD,IAAI0H,EACJ,IACCA,EAAsBxE,EAAUc,KAAO,IA3dvC2D,UA2dqD,IAAK,6BAA+BtI,EAAe+F,WAAa,gBAAkB,IACtI,KAAOlC,EAAUD,KAAI6B,GAAe,cAARA,EAAsB,eAAiBwC,EAAUM,KAAK9C,GAAOA,EAAM,OAAU,IAAMX,KAAKC,UAAUU,GAAO,UAAU+C,KAAK,KAAO,MADrH,CAC6H7D,EAKpK,CAJC,MAAMlF,GAGP,OADAkB,EAA4B8H,IACrBN,GACP,CAGD,OAF2B,IAAvBtE,EAAUK,WACbL,EAAUc,KAAO+D,EAAuBR,EAASrE,EAAUc,OACrD0D,GACP,CACD,IAAI7C,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGC,EAAIH,EAAUxC,OAAQ0C,EAAIC,EAAGD,IAAK,CACjD,IAAI0B,EAAM5B,EAAUE,GACR,cAAR0B,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOR,GACfA,CACP,CAED,OADA2C,EAAWC,MAAQ,EACQ,IAAvBvE,EAAUK,SACNwE,EAAuBR,EAASC,GAEjCA,CACR,CAEA,MAAMO,EAAyB,CAACR,EAASS,IACjC,WACN,IAAIzE,EAAW5E,EAAIS,KACnB,GAAiB,IAAbmE,EACH,OAAOyE,IACR,IAAIxE,EAAK+D,EAAU,KAAOA,GAAWhE,GAAY,IAAMgE,GAAWhE,GAAY,GAC1EL,EAAYnE,EAAkByE,IAAOmB,IAAiBnB,GAC1D,IAAKN,EACJ,MAAM,IAAIhB,MAAM,gCAAkCsB,GAInD,OAFKN,EAAUc,OACdd,EAAUc,KAAOY,EAAsB1B,EAAWqE,IAC5CrE,EAAUc,MACnB,EAGO,SAASW,IACf,IAAI9B,EAAmBzB,GAAU,KAEhCzC,EAAM,KACCU,EAAesB,mBAEvB,OAAO5B,EAAoBM,EAAeuD,iBAAiBC,EAAkB9D,EAC9E,CAEA,IAAI0G,EAAkBwC,EAClBhB,EAAcgB,EACdf,EAAee,EACfd,EAAec,EA0CnB,SAASA,EAAavH,GACrB,IAAIkD,EACJ,GAAIlD,EAAS,KACRkD,EAAS2B,EAAgB7E,IAC5B,OAAOkD,EAET,GAAIlD,EAAS,IAAMhC,EAClB,OAAOA,EAAQiF,OAAOhF,EAAIqI,SAAS5H,EAAUA,GAAYsB,IAC1D,MAAMmB,EAAMzC,EAAWsB,EACjBwH,EAAQ,GAEd,IADAtE,EAAS,GACFxE,EAAWyC,GAAK,CACtB,MAAMsG,EAAQxJ,EAAIS,KAClB,GAAuB,IAAV,IAAR+I,GAEJD,EAAMvF,KAAKwF,QACL,GAAuB,MAAV,IAARA,GAAwB,CAEnC,MACMC,GAAsB,GAARD,IAAiB,EADL,GAAlBxJ,EAAIS,KAGdgJ,EAAY,IACfF,EAAMvF,KAAK,OAEXuF,EAAMvF,KAAKyF,EAEZ,MAAM,GAAuB,MAAV,IAARD,GAAwB,CAEnC,MAEMC,GAAsB,GAARD,IAAiB,IAFL,GAAlBxJ,EAAIS,OAEmC,EADrB,GAAlBT,EAAIS,KAIdgJ,EAAY,MAAUA,GAAa,OAAUA,GAAa,MAC7DF,EAAMvF,KAAK,OAEXuF,EAAMvF,KAAKyF,EAEZ,MAAM,GAAuB,MAAV,IAARD,GAAwB,CAKnC,IAAIE,GAAiB,EAARF,IAAiB,IAHE,GAAlBxJ,EAAIS,OAG8B,IAFhB,GAAlBT,EAAIS,OAEgD,EADlC,GAAlBT,EAAIS,KAIdiJ,EAAO,OAAWA,EAAO,QAC5BH,EAAMvF,KAAK,OACD0F,EAAO,OACjBA,GAAQ,MACRH,EAAMvF,KAAO0F,IAAS,GAAM,KAAS,OACrCA,EAAO,MAAiB,KAAPA,EACjBH,EAAMvF,KAAK0F,IAEXH,EAAMvF,KAAK0F,EAEf,MACGH,EAAMvF,KAAK,OAGRuF,EAAMxH,QAAU,OACnBkD,GAAU0E,EAAaC,MAAMC,OAAQN,GACrCA,EAAMxH,OAAS,EAEhB,CAMD,OAJIwH,EAAMxH,OAAS,IAClBkD,GAAU0E,EAAaC,MAAMC,OAAQN,IAG/BtE,CACR,CAYA,SAASwD,EAAU1G,GAClB,IAAIwE,EAAQ,IAAIC,MAAMzE,GACtB,IAAK,IAAI0C,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3B8B,EAAM9B,GAAKY,IAEZ,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOH,GACfA,CACR,CAEA,SAASmC,EAAQ3G,GAChB,GAAIrB,EAAeM,cAAe,CACjC,IAAIkF,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC,IAAI0B,EAAMC,IACE,cAARD,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAOa,CACT,CAAQ,CACN,IAAI5B,EAAM,IAAI+B,IACd,IAAK,IAAI5B,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3BH,EAAIgC,IAAIjB,IAAQA,KAEjB,OAAOf,CACP,CACF,CAEA,IAAIqF,EAAeE,OAAOF,aAC1B,SAAS9C,EAAe9E,GACvB,IAAIoB,EAAQ1C,EACRqJ,EAAQ,IAAItD,MAAMzE,GACtB,IAAK,IAAI0C,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC,MAAMsF,EAAO/J,EAAIS,KACjB,IAAY,IAAPsJ,GAAe,EAElB,YADAtJ,EAAW0C,GAGZ2G,EAAMrF,GAAKsF,CACX,CACD,OAAOJ,EAAaC,MAAMC,OAAQC,EACpC,CACA,SAASlD,EAAgB7E,GACxB,GAAIA,EAAS,EAAG,CACf,GAAIA,EAAS,EAAG,CACf,GAAe,IAAXA,EACH,MAAO,GACH,CACJ,IAAIiI,EAAIhK,EAAIS,KACZ,OAAS,IAAJuJ,GAAY,OAChBvJ,GAAY,GAGNkJ,EAAaK,EACpB,CACJ,CAAS,CACN,IAAIA,EAAIhK,EAAIS,KACRwJ,EAAIjK,EAAIS,KACZ,IAAS,IAAJuJ,GAAY,IAAU,IAAJC,GAAY,EAElC,YADAxJ,GAAY,GAGb,GAAIsB,EAAS,EACZ,OAAO4H,EAAaK,EAAGC,GACxB,IAAIC,EAAIlK,EAAIS,KACZ,OAAS,IAAJyJ,GAAY,OAChBzJ,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAC1B,CACH,CAAQ,CACN,IAAIF,EAAIhK,EAAIS,KACRwJ,EAAIjK,EAAIS,KACRyJ,EAAIlK,EAAIS,KACR0J,EAAInK,EAAIS,KACZ,IAAS,IAAJuJ,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,EAEtE,YADA1J,GAAY,GAGb,GAAIsB,EAAS,EAAG,CACf,GAAe,IAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,GACzB,CACJ,IAAIC,EAAIpK,EAAIS,KACZ,OAAS,IAAJ2J,GAAY,OAChB3J,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAChC,CACJ,CAAS,GAAIrI,EAAS,EAAG,CACtB,IAAIqI,EAAIpK,EAAIS,KACR4J,EAAIrK,EAAIS,KACZ,IAAS,IAAJ2J,GAAY,IAAU,IAAJC,GAAY,EAElC,YADA5J,GAAY,GAGb,GAAIsB,EAAS,EACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACpC,IAAIC,EAAItK,EAAIS,KACZ,OAAS,IAAJ6J,GAAY,OAChB7J,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACzC,CAAS,CACN,IAAIF,EAAIpK,EAAIS,KACR4J,EAAIrK,EAAIS,KACR6J,EAAItK,EAAIS,KACR8J,EAAIvK,EAAIS,KACZ,IAAS,IAAJ2J,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,EAEtE,YADA9J,GAAY,GAGb,GAAIsB,EAAS,GAAI,CAChB,GAAe,IAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrC,CACJ,IAAI9F,EAAIzE,EAAIS,KACZ,OAAS,IAAJgE,GAAY,OAChBhE,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAC5C,CACL,CAAU,GAAI1C,EAAS,GAAI,CACvB,IAAI0C,EAAIzE,EAAIS,KACR+J,EAAIxK,EAAIS,KACZ,IAAS,IAAJgE,GAAY,IAAU,IAAJ+F,GAAY,EAElC,YADA/J,GAAY,IAGb,GAAIsB,EAAS,GACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,GAChD,IAAIC,EAAIzK,EAAIS,KACZ,OAAS,IAAJgK,GAAY,OAChBhK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EACtD,CAAU,CACN,IAAIhG,EAAIzE,EAAIS,KACR+J,EAAIxK,EAAIS,KACRgK,EAAIzK,EAAIS,KACRiE,EAAI1E,EAAIS,KACZ,IAAS,IAAJgE,GAAY,IAAU,IAAJ+F,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJ/F,GAAY,EAEtE,YADAjE,GAAY,IAGb,GAAIsB,EAAS,GAAI,CAChB,GAAe,KAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,GACjD,CACJ,IAAIgG,EAAI1K,EAAIS,KACZ,OAAS,IAAJiK,GAAY,OAChBjK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EACxD,CACN,CAAW,CACN,IAAIA,EAAI1K,EAAIS,KACRkK,EAAI3K,EAAIS,KACZ,IAAS,IAAJiK,GAAY,IAAU,IAAJC,GAAY,EAElC,YADAlK,GAAY,IAGb,GAAIsB,EAAS,GACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EAAGC,GAC5D,IAAIC,EAAI5K,EAAIS,KACZ,OAAS,IAAJmK,GAAY,OAChBnK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EAAGC,EAAGC,EAC9D,CACD,CACD,CACD,CACF,CAEA,SAASC,IACR,IACI9I,EADAgE,EAAQ/F,EAAIS,KAEhB,GAAIsF,EAAQ,IAEXhE,EAASgE,EAAQ,SAEjB,OAAOA,GACN,KAAK,IAEJhE,EAAS/B,EAAIS,KACb,MACD,KAAK,IAEJsB,EAASvB,EAAS0G,UAAUzG,GAC5BA,GAAY,EACZ,MACD,KAAK,IAEJsB,EAASvB,EAAS2G,UAAU1G,GAC5BA,GAAY,EACZ,MACD,QACC,MAAM,IAAI8C,MAAM,mBAGnB,OAAO+F,EAAavH,EACrB,CAGA,SAASkF,EAAQlF,GAChB,OAAOrB,EAAeoK,YAErB7H,WAAWN,UAAU6B,MAAM5B,KAAK5C,EAAKS,EAAUA,GAAYsB,GAC3D/B,EAAIqI,SAAS5H,EAAUA,GAAYsB,EACrC,CACA,SAASqF,EAAQrF,GAChB,IAAIgJ,EAAO/K,EAAIS,KACf,GAAII,EAAkBkK,GAAO,CAC5B,IAAI7H,EACJ,OAAOrC,EAAkBkK,GAAM/K,EAAIqI,SAAS5H,EAAUyC,EAAOzC,GAAYsB,IAAWiJ,IACnFvK,EAAWuK,EACX,IACC,OAAO3F,GAGP,CAFS,QACT5E,EAAWyC,CACX,IAEF,CAEA,MAAM,IAAIK,MAAM,0BAA4BwH,EAC9C,CAEA,IAAIE,EAAW,IAAIzE,MAAM,MACzB,SAASJ,IACR,IAAIrE,EAAS/B,EAAIS,KACjB,KAAIsB,GAAU,KAAQA,EAAS,KAS9B,OADAtB,IACOyK,EAAa7F,KANpB,GADAtD,GAAkB,IACdnB,GAAgBH,EACnB,OAAOJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYsB,GAAUpB,GACrE,KAAsB,GAAhBC,GAAqBX,EAAS,KACxC,OAAO6G,EAAgB/E,GAKzB,IAIIoJ,EAJAhF,EAAuG,MAA/FpE,GAAU,GAAMA,EAAS,EAAIvB,EAAS0G,UAAUzG,GAAYsB,EAAS,EAAI/B,EAAIS,GAAY,IACjG2K,EAAQH,EAAS9E,GACjBkF,EAAgB5K,EAChByC,EAAMzC,EAAWsB,EAAS,EAE1B0C,EAAI,EACR,GAAI2G,GAASA,EAAMtB,OAAS/H,EAAQ,CACnC,KAAOsJ,EAAgBnI,GAAK,CAE3B,GADAiI,EAAQ3K,EAAS2G,UAAUkE,GACvBF,GAASC,EAAM3G,KAAM,CACxB4G,EAAgB,WAChB,KACA,CACDA,GAAiB,CACjB,CAED,IADAnI,GAAO,EACAmI,EAAgBnI,GAEtB,GADAiI,EAAQnL,EAAIqL,KACRF,GAASC,EAAM3G,KAAM,CACxB4G,EAAgB,WAChB,KACA,CAEF,GAAIA,IAAkBnI,EAErB,OADAzC,EAAW4K,EACJD,EAAMzE,OAEdzD,GAAO,EACPmI,EAAgB5K,CAChB,CAID,IAHA2K,EAAQ,GACRH,EAAS9E,GAAOiF,EAChBA,EAAMtB,MAAQ/H,EACPsJ,EAAgBnI,GACtBiI,EAAQ3K,EAAS2G,UAAUkE,GAC3BD,EAAMpH,KAAKmH,GACXE,GAAiB,EAGlB,IADAnI,GAAO,EACAmI,EAAgBnI,GACtBiI,EAAQnL,EAAIqL,KACZD,EAAMpH,KAAKmH,GAGZ,IAAIxE,EAAS5E,EAAS,GAAK6E,EAAgB7E,GAAU8E,EAAe9E,GACpE,OACQqJ,EAAMzE,OADA,MAAVA,EACmBA,EACDG,EAAgB/E,EACvC,CAEA,SAASmJ,EAAaI,GAErB,GAAwB,iBAAbA,EAAuB,OAAOA,EACzC,GAAwB,iBAAbA,GAA6C,kBAAbA,GAA8C,iBAAbA,EAAuB,OAAOA,EAAS3D,WACnH,GAAgB,MAAZ2D,EAAkB,OAAOA,EAAW,GACxC,GAAI5K,EAAe6K,sBAAwB/E,MAAMgF,QAAQF,IAAaA,EAASG,OAAOC,OAAMC,GAAQ,CAAC,SAAU,SAAU,UAAW,UAAUC,gBAAgBD,KAC7J,OAAOL,EAASG,OAAO9D,WAExB,MAAM,IAAIpE,MAAM,4CAA4C+H,EAC7D,CAEA,MAAMpD,EAAmB,CAACrD,EAAID,KAC7B,IAAIL,EAAYc,IAAOf,IAAI4G,GAEvBW,EAAYhH,OACCpD,IAAbmD,IACHC,EAAKA,EAAK,MAAQD,GAAY,GAAKC,IAAQD,GAAY,GAAKC,EAC5DN,EAAUK,SAAWA,GAEtB,IAAIkH,EAAoB1L,EAAkByE,GAS1C,OALIiH,IAAsBA,EAAkBnH,UAAYvD,MACtDhB,EAAkB2E,oBAAsB3E,EAAkB2E,kBAAoB,KAAKF,GAAMiH,GAE3F1L,EAAkByE,GAAMN,EACxBA,EAAUc,KAAOY,EAAsB1B,EAAWsH,GAC3CtH,EAAUc,MAAM,EAExBxE,EAAkB,GAAK,OACvBA,EAAkB,GAAGuH,UAAW,EAEhCvH,EAAkB,IAAQkL,IACzB,IAAIC,EAAcD,EAAKzI,WAAa,GAAM,EACtC2I,EAAOrE,OAAiB,IAAVmE,EAAK,GAAYA,EAAK,GAAK,IAAQA,EAAK,IAC1D,IAAK,IAAItH,EAAI,EAAGA,EAAIuH,EAAYvH,IAC/BwH,IAASrE,OAAO,GAChBqE,GAAQrE,OAAOmE,EAAKtH,IAErB,GAAIsH,EAAKzI,aAAe0I,EAAY,CACnC,IAAIE,EAAO,IAAI9I,SAAS2I,EAAKlJ,OAAQkJ,EAAK1I,WAAY0I,EAAKzI,YACvD0B,EAAS,CAAC7B,EAAOD,KACpB,IAAInB,EAASmB,EAAMC,EACnB,GAAIpB,GAAU,GAAI,CACjB,IAAIoK,EAAMD,EAAKxE,aAAavE,GAC5B,IAAK,IAAIsB,EAAItB,EAAQ,EAAGsB,EAAIvB,EAAKuB,GAAK,EACrC0H,IAAQvE,OAAO,IACfuE,GAAOD,EAAKxE,aAAajD,GAE1B,OAAO0H,CACP,CAED,IAAIC,EAASjJ,GAASpB,GAAU,GAAK,GACjCsK,EAAOrH,EAAO7B,EAAOiJ,GACrBE,EAAQtH,EAAOoH,EAAQlJ,GAC3B,OAAQmJ,GAAQzE,OAAwB,GAAhB1E,EAAMkJ,IAAgBE,CAAK,EAEpDL,EAAQA,GAAQrE,OAAwC,GAAhCsE,EAAK5I,WAAa0I,IAAoBhH,EAAOgH,EAAYE,EAAK5I,WACtF,CACD,OAAO2I,CAAI,EAGZ,IAAIM,EAAS,CACZhJ,YAAOiJ,oBAAW7G,sBAAY8G,8BAAgBC,wBAAaC,oBAAWC,kBAAUC,eAA0C,mBAAnBA,eAAgCA,eAAiB,MAEzJhM,EAAkB,KAAQ,KACzB,IAAIkL,EAAO1G,IACX,IAAKkH,EAAOR,EAAK,IAAK,CACrB,IAAI5L,EAAQoD,MAAMwI,EAAK,GAAI,CAAEe,MAAOf,EAAK,KAEzC,OADA5L,EAAMgB,KAAO4K,EAAK,GACX5L,CACP,CACD,OAAOoM,EAAOR,EAAK,IAAIA,EAAK,GAAI,CAAEe,MAAOf,EAAK,IAAK,EAGpDlL,EAAkB,KAASkL,IAE1B,IAAuC,IAAnCrL,EAAeqM,gBAA2B,MAAM,IAAIxJ,MAAM,0CAC9D,IAAIsB,EAAKrE,EAAS2G,UAAU1G,EAAW,GAClCF,IACJA,EAAe,IAAI8F,KACpB,IACI2G,EADAjH,EAAQ/F,EAAIS,GAIfuM,EADGjH,GAAS,KAAQA,EAAQ,KAAiB,KAATA,GAA0B,KAATA,EAC5C,GACDA,GAAS,KAAQA,EAAQ,KAAiB,KAATA,GAA0B,KAATA,EACjD,IAAIM,KACJN,GAAS,KAAQA,GAAS,KAAQA,GAAS,KAAQA,GAAS,MAA+B,MAAtB/F,EAAIS,EAAW,GACpF,IAAIwM,IAEJ,CAAA,EAEV,IAAIC,EAAW,CAAEF,UACjBzM,EAAa+F,IAAIzB,EAAIqI,GACrB,IAAIC,EAAmB9H,IACvB,IAAK6H,EAASE,KAEb,OAAOF,EAASF,OAASG,EAO1B,GAJC/K,OAAOC,OAAO2K,EAAQG,GAInBH,aAAkB3G,IACrB,IAAK,IAAKoE,EAAG4C,KAAMF,EAAiBG,UAAWN,EAAO1G,IAAImE,EAAG4C,GAC9D,GAAIL,aAAkBC,IACrB,IAAK,IAAIxI,KAAK+B,MAAMxD,KAAKmK,GAAmBH,EAAOO,IAAI9I,GACxD,OAAOuI,CAAM,EAGdnM,EAAkB,KAASkL,IAE1B,IAAuC,IAAnCrL,EAAeqM,gBAA2B,MAAM,IAAIxJ,MAAM,0CAC9D,IAAIsB,EAAKrE,EAAS2G,UAAU1G,EAAW,GACnCyM,EAAW3M,EAAaiN,IAAI3I,GAEhC,OADAqI,EAASE,MAAO,EACTF,EAASF,MAAM,EAGvBnM,EAAkB,KAAQ,IAAM,IAAIoM,IAAI5H,KAEjC,MAAMoI,EAAc,CAAC,OAAO,QAAQ,eAAe,QAAQ,SAAS,QAAQ,SAAS,UAAU,UAAU,WAAW,aAAanJ,KAAIyG,GAAQA,EAAO,UAE3J,IAAI2C,EAA6B,iBAAfC,WAA0BA,WAAaC,OACzD/M,EAAkB,KAASkL,IAC1B,IAAI8B,EAAW9B,EAAK,GAEhBlJ,EAASI,WAAWN,UAAU6B,MAAM5B,KAAKmJ,EAAM,GAAGlJ,OAElDiL,EAAiBL,EAAYI,GACjC,IAAKC,EAAgB,CACpB,GAAiB,KAAbD,EAAiB,OAAOhL,EAC5B,GAAiB,KAAbgL,EAAiB,OAAO,IAAIzK,SAASP,GACzC,MAAM,IAAIU,MAAM,uCAAyCsK,EACzD,CACD,OAAO,IAAIH,EAAKI,GAAgBjL,EAAO,EAExChC,EAAkB,KAAQ,KACzB,IAAIkL,EAAO1G,IACX,OAAO,IAAI0I,OAAOhC,EAAK,GAAIA,EAAK,GAAG,EAEpC,MAAMiC,EAAc,GAgCpB,SAASvL,EAAUwL,GACdvN,GAAkBA,EAAewN,cACpCxN,EAAewN,eAChB,IAAIC,EAAclO,EACdmO,EAAgB3N,EAEhB4N,EAAsB1N,EACtB2N,EAAoB1N,EACpB2N,EAAiBlO,EAEjBmO,EAAoBjO,EACpBkO,EAAsBnO,EAGtBoO,EAAW,IAAIzL,WAAWjD,EAAIwE,MAAM,EAAGvE,IACvC0O,EAAkBvO,EAClBwO,EAA0BxO,EAAkBoE,MAAM,EAAGpE,EAAkB2B,QACvE8M,EAAanO,EACboO,EAAsB1N,EACtB0C,EAAQmK,IAgBZ,OAfAhO,EAASkO,EACT1N,EAAW2N,EAEXzN,EAAiB0N,EACjBzN,EAAe0N,EACfjO,EAAYkO,EAEZhO,EAAeiO,EACflO,EAAiBmO,EACjBzO,EAAM0O,EACNtN,EAAiB0N,GACjB1O,EAAoBuO,GACFI,OAAO,EAAG3O,EAAkB2B,UAAW6M,GACzDlO,EAAiBmO,EACjBrO,EAAW,IAAI4C,SAASpD,EAAI6C,OAAQ7C,EAAIqD,WAAYrD,EAAIsD,YACjDQ,CACR,CACO,SAASpB,IACf1C,EAAM,KACNO,EAAe,KACfH,EAAoB,IACrB,CAxEAS,EAAkB,IAASkL,IAC1B,IAAIiD,GAAYjD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,GACrEkD,EAAexO,EAQnB,OAPAA,GAAYuO,EAAWjD,EAAKhK,OAC5BzB,EAAiB0N,GACjB1N,EAAiB,CAACuK,IAAoBA,MACvB7D,UAAY,EAC3B1G,EAAeyG,UAAY,EAC3BzG,EAAegF,mBAAqB7E,EACpCA,EAAWwO,EACJ5J,GAAM,EAGdxE,EAAkB,KAASkL,GAEP,GAAfA,EAAKhK,OACD,IAAImN,KAA0E,KAA1D,SAAVnD,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,KACxD,GAAfA,EAAKhK,OACN,IAAImN,OACRnD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,IAAMA,EAAK,IAAM,IAAM,IAC6B,KAAlF,YAAP,EAAVA,EAAK,IAAoC,SAAVA,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,KACzE,IAAfA,EAAKhK,OACN,IAAImN,OACRnD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,IAAM,IACoG,MAAxJ,IAAVA,EAAK,IAAc,gBAAkB,GAAe,cAAVA,EAAK,GAA+B,WAAVA,EAAK,GAA6B,SAAVA,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,KAAO,GAAKA,EAAK,MAExJ,IAAImD,KAAK,WAuDX,MAAM1H,EAAS,IAAIhB,MAAM,KAChC,IAAK,IAAI/B,EAAI,EAAGA,EAAI,IAAKA,IACxB+C,EAAO/C,KAAO,KAAO0K,KAAKC,MAAM,MAAY,OAAJ3K,IAE5B,MAAA4K,EAAU/N,EACvB,IAAIyC,EAAiB,IAAIzC,EAAQ,CAAEP,YAAY,IACnC,MAACwB,EAASwB,EAAexB,OACxBkB,GAAiBM,EAAeN,eAChCuB,GAASjB,EAAexB,OACxB+M,GAAkB,CAC9BC,MAAO,EACPC,OAAQ,EACRC,cAAe,EACfC,YAAa,GAEd,IC1sCIC,GAIAC,GAAYC,GDssCZC,GAAW,IAAIC,aAAa,GAC5BC,GAAU,IAAI/M,WAAW6M,GAASjN,OAAQ,EAAG,GASjDvB,EAAQ2O,uBAAwB,ECntChC,IACCN,GAAc,IAAIO,WACD,CAAhB,MAAO/P,GAAS,CAElB,MAAMgQ,GAAkC,oBAAXpN,OACvBqN,GAAoBD,GACzB,SAASpO,GAAU,OAAOgB,OAAOsN,gBAAgBtO,EAAU,EAAGkB,WACzDqN,GAAYH,GAAgBpN,OAASE,WACrCsN,GAAkBJ,GAAgB,WAAc,WACtD,IAAInD,GAAQwD,GACRC,GAEAC,GADAjQ,GAAW,EAEXH,GAAiB,KACrB,MACMqQ,GAAc,kBACPC,GAAgBC,OAAO,aAC7B,MAAMC,WAAcxP,EAC1BC,YAAYC,GAIX,IAAI2B,EACA4N,EACAnP,EACArB,EANJyQ,MAAMxP,GACNc,KAAK2O,OAAS,EAMd,IAAIC,EAAaZ,GAAU3N,UAAUwO,UAAY,SAASxK,EAAQlG,GACjE,OAAOuM,GAAOmE,UAAUxK,EAAQlG,EAAUuM,GAAO1J,WAAa7C,EACjE,KAAOkP,KAAeA,GAAYyB,aAC/B,SAASzK,EAAQlG,GAChB,OAAOkP,GAAYyB,WAAWzK,EAAQqG,GAAO3E,SAAS5H,IAAW4Q,OACjE,EAEEC,EAAQhP,KACPd,IACJA,EAAU,CAAA,GACX,IAAI+P,EAAe/P,GAAWA,EAAQE,WAClC8P,EAAsBhQ,EAAQI,YAAcJ,EAAQiQ,eACpD5P,EAAsBL,EAAQK,oBAGlC,GAF2B,MAAvBA,IACHA,EAAsB2P,EAAsB,GAAK,GAC9C3P,EAAsB,KACzB,MAAM,IAAI0B,MAAM,sCACb/B,EAAQuL,iBAAwCtL,MAArBD,EAAQkQ,YACtCpP,KAAKoP,WAAY,GAElB,IAAIC,EAAmBnQ,EAAQmQ,iBACP,MAApBA,IACHA,EAAmBH,EAAsB,GAAK,IAC1ClP,KAAKV,YAAoC,GAAtBJ,EAAQT,aAC/BuB,KAAKV,WAAa,IAEnB,IAAIgQ,EAAoB/P,EAAsB,IAAO8P,EAAmB9P,EAAsB,GAC1FgQ,EAAgBhQ,EAAsB,GACtCiQ,EAAiBjQ,EAAsB8P,EAAmB,GAC9D,GAAIG,EAAiB,KACpB,MAAM,IAAIvO,MAAM,wDAEjB,IAAIwO,EAAoB,GACpBC,EAAmB,EACnBC,EAAuC,EAE3C3P,KAAK4P,KAAO5P,KAAK6P,OAAS,SAASrO,EAAOsO,GAwBzC,GAvBKpF,KACJA,GAAS,IAAIoD,GAAkB,MAC/BK,GAAazD,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQ,EAAG,OAClFpC,GAAW,GAEZiQ,GAAU1D,GAAOjL,OAAS,GACtB2O,GAAUjQ,GAAW,MAExBuM,GAAS,IAAIoD,GAAkBpD,GAAOjL,QACtC0O,GAAazD,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQ,EAAGmK,GAAOjL,SACzF2O,GAAU1D,GAAOjL,OAAS,GAC1BtB,GAAW,GAEXA,GAAYA,GAAW,EAAK,WAC7B0C,EAAQ1C,GACJ2R,EAAgBC,KAAqB5R,IAA6B,IAAhB2R,GACtD7R,EAAe+Q,EAAMvE,gBAAkB,IAAI1G,IAAQ,KAC/CiL,EAAMgB,eAAkC,iBAAVxO,GACjCxD,GAAiB,GACjBA,GAAeuD,KAAOsF,KAEtB7I,GAAiB,KAClBsB,EAAa0P,EAAM1P,WACfA,EAAY,CACXA,EAAWK,gBACdL,EAAa0P,EAAMrN,iBAAiBqN,EAAMtP,kBAC3C,IAAIF,EAAeF,EAAWE,cAAgB,EAC9C,GAAIA,EAAeD,EAElB,MAAM,IAAI0B,MAAM,qGAAuG3B,EAAWE,cAEnI,IAAKF,EAAW2Q,YAAa,CAE5B3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,MACvC,IAAK,IAAI/N,EAAI,EAAGA,EAAI3C,EAAc2C,IAAK,CACtC,IAAIgO,EAAO7Q,EAAW6C,GACtB,IAAKgO,EACJ,SACD,IAAIC,EAAgBC,EAAa/Q,EAAW2Q,YAC5C,IAAK,IAAI/H,EAAI,EAAG9F,EAAI+N,EAAK1Q,OAAQyI,EAAI9F,EAAG8F,IAAK,CAC5C,IAAIrE,EAAMsM,EAAKjI,GACfkI,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,OAElDG,EAAaD,CACb,CACDC,EAAW/B,IAAiBnM,EAAI,EAChC,CACDnC,KAAKsQ,0BAA4B9Q,CACjC,CACIyP,IACJ3P,EAAWiR,OAAS/Q,EAAe,GAEpC,CAGD,IAAIgR,EAFA/B,IACHA,GAAkB,GAEnB,IACKO,EAAMyB,cAAgBjP,GAA0B,iBAAVA,EACrCA,EAAMvC,cAAgBa,OAAQ4Q,EAAYlP,GACrCA,EAAMvC,cAAgB8E,KAAQG,MAAMgF,QAAQ1H,IAAW+L,GAAiBoD,MAAKC,GAAYpP,aAAiBoP,IAG5GhB,EAAKpO,GADXkP,EAAYlP,EAAMsB,OAAStB,EAAMsB,SAAWtB,GAG7CoO,EAAKpO,GACN,IAAIqP,EAAa7S,GAGjB,GAFIA,IACH8S,GAAajQ,EAAO+O,EAAM,GACvB3R,GAAgBA,EAAa8S,YAAa,CAC7C,IAAIA,EAAc9S,EAAa8S,YAAYC,MAAK,CAACtJ,EAAGC,IAAMD,EAAEiH,OAAShH,EAAEgH,OAAS,GAAK,IACjFxM,EAAI4O,EAAYtR,OAChBwR,GAAqB,EACzB,KAAOJ,GAAc1O,EAAI,GAAG,CAC3B,IAAI+O,EAAiBH,IAAc5O,GAAGwM,OAAS9N,EAC3CqQ,EAAkBL,EAAWM,gBAAkBtQ,IAAiC,IAAvBoQ,IAC5DA,EAAoB,GACjBC,EAAkBL,EAAW1S,SAAW0C,EACvCoQ,GAAqB,IACxBA,GAAqB,IAElBA,GAAqB,IAExB9C,GAAWiD,UAAUP,EAAW1S,SAAW0C,EAC1CsN,GAAWtJ,UAAUgM,EAAW1S,SAAW0C,GAASoQ,GACrDA,GAAqB,GAEtBJ,EAAaA,EAAWQ,SACxBlP,IAED,CACG8O,GAAqB,GAAKJ,GAE7B1C,GAAWiD,UAAUP,EAAW1S,SAAW0C,EAC1CsN,GAAWtJ,UAAUgM,EAAW1S,SAAW0C,GAASoQ,GAEtD9S,IAAiC,EAArB4S,EAAYtR,OACpBtB,GAAWiQ,IACdkD,EAASnT,IACV6Q,EAAML,OAASxQ,GACf,IAAIoT,EA24BT,SAAmBA,EAAYR,GAE9B,IAAIR,EACAiB,EAAsC,EAArBT,EAAYtR,OAC7BgS,EAAUF,EAAW9R,OAAS+R,EAClC,KAAOjB,EAASQ,EAAYW,OAAO,CAClC,IAAI/C,EAAS4B,EAAO5B,OAChBpM,EAAKgO,EAAOhO,GAChBgP,EAAWI,WAAWhD,EAAS6C,EAAgB7C,EAAQ8C,GACvDD,GAAkB,EAClB,IAAIrT,EAAWwQ,EAAS6C,EACxBD,EAAWpT,KAAc,IACzBoT,EAAWpT,KAAc,IACzBoT,EAAWpT,KAAcoE,GAAM,GAC/BgP,EAAWpT,KAAeoE,GAAM,GAAM,IACtCgP,EAAWpT,KAAeoE,GAAM,EAAK,IACrCgP,EAAWpT,KAAmB,IAALoE,EACzBkP,EAAU9C,CACV,CACD,OAAO4C,CACR,CA/5BsBK,CAAUlH,GAAO3E,SAASlF,EAAO1C,IAAW4S,GAE7D,OADA9S,EAAe,KACRsT,CACP,CAED,OADAvC,EAAML,OAASxQ,GACX2R,EAAgB+B,IACnBnH,GAAO7J,MAAQA,EACf6J,GAAO9J,IAAMzC,GACNuM,IAEDA,GAAO3E,SAASlF,EAAO1C,GA4B9B,CA3BC,MAAMN,GAEP,MADA2S,EAAgB3S,EACVA,CACV,CAAa,QACT,GAAIyB,IACHwS,IACIrD,GAAmBO,EAAMG,gBAAgB,CAC5C,IAAI3P,EAAeF,EAAWE,cAAgB,EAE1CuS,EAAerH,GAAO3E,SAASlF,EAAO1C,IACtC6T,GAAiBhD,EAAMiD,oBAAsBC,IAAmB5S,EAAY0P,GAChF,IAAKwB,EACJ,OAAwE,IAApExB,EAAMG,eAAe6C,EAAeA,EAAcG,cAE9CnD,EAAMY,KAAKpO,EAAOsO,IAE1Bd,EAAMsB,0BAA4B9Q,EAE9BkL,GAAOjL,OAAS,aAAYiL,GAAS,MAClCqH,EAER,CAGErH,GAAOjL,OAAS,aAAYiL,GAAS,MACrCoF,EAAgBsC,KACnBjU,GAAW0C,EACZ,CACJ,EACE,MAAMiR,EAAkB,KACnBnC,EAAuC,IAC1CA,IACD,IAAInQ,EAAeF,EAAWE,cAAgB,EAG9C,GAFIF,EAAWG,OAASD,IAAiByP,IACxC3P,EAAWG,OAASD,GACjBkQ,EAAmB,IAEtBpQ,EAAW2Q,YAAc,KACzBN,EAAuC,EACvCD,EAAmB,EACfD,EAAkBhQ,OAAS,IAC9BgQ,EAAoB,SACf,GAAIA,EAAkBhQ,OAAS,IAAMwP,EAAc,CACzD,IAAK,IAAI9M,EAAI,EAAGC,EAAIqN,EAAkBhQ,OAAQ0C,EAAIC,EAAGD,IACpDsN,EAAkBtN,GAAGmM,IAAiB,EAEvCmB,EAAoB,EACpB,GAEI4C,EAAa7Q,IAClB,IAAI/B,EAAS+B,EAAM/B,OACfA,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEb,IAAK,IAAIgE,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3ByN,EAAKpO,EAAMW,GACX,EAEIyN,EAAQpO,IACTrD,GAAWiQ,KACd1D,GAAS4G,EAASnT,KAEnB,IACIsB,EADAgJ,SAAcjH,EAElB,GAAa,WAATiH,EAAmB,CACtB,IAkCI6J,EAlCAC,EAAY/Q,EAAM/B,OACtB,GAAIzB,IAAkBuU,GAAa,GAAKA,EAAY,KAAQ,CAC3D,IAAKvU,GAAeuD,MAAQgR,GA5OT,MA4OuC,CACzD,IAAIC,EAIA3B,EAHA4B,GAAYzU,GAAe,GAAgC,EAA3BA,GAAe,GAAGyB,OAAazB,GAAe,GAAGyB,OAAS,GAAK,GAC/FtB,GAAWsU,EAAWrE,KACzB1D,GAAS4G,EAASnT,GAAWsU,IAE1BzU,GAAeG,UAClB0S,EAAa7S,GACb0M,GAAOvM,IAAY,IACnBA,IAAY,EACZuM,GAAOvM,MAAc,GACrBqU,EAAWrU,GAAW0C,EACtB1C,IAAY,EACZ2S,GAAajQ,EAAO+O,EAAM,GAC1BzB,GAAWuE,UAAUF,EAAW3R,EAAQ,EAAG1C,GAAW0C,EAAQ2R,KAE9D9H,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,GACrBqU,EAAWrU,GAAW0C,EACtB1C,IAAY,GAEbH,GAAiB,CAAC,GAAI,IACtBA,GAAeqT,SAAWR,EAC1B7S,GAAeuD,KAAO,EACtBvD,GAAeG,SAAWqU,CAC1B,CACD,IAAIG,EAAUtE,GAAY1H,KAAKnF,GAI/B,OAHAxD,GAAe2U,EAAU,EAAI,IAAMnR,EACnCkJ,GAAOvM,MAAc,SACrByR,EAAK+C,GAAWJ,EAAYA,EAE5B,CAIAD,EADGC,EAAY,GACF,EACHA,EAAY,IACT,EACHA,EAAY,MACT,EAEA,EAEd,IAAIE,EAAuB,EAAZF,EAIf,GAHIpU,GAAWsU,EAAWrE,KACzB1D,GAAS4G,EAASnT,GAAWsU,IAE1BF,EAAY,KAAS3D,EAAY,CACpC,IAAIzM,EAAGyQ,EAAIC,EAAIC,EAAc3U,GAAWmU,EACxC,IAAKnQ,EAAI,EAAGA,EAAIoQ,EAAWpQ,IAC1ByQ,EAAKpR,EAAMuR,WAAW5Q,GAClByQ,EAAK,IACRlI,GAAOoI,KAAiBF,EACdA,EAAK,MACflI,GAAOoI,KAAiBF,GAAM,EAAI,IAClClI,GAAOoI,KAAsB,GAALF,EAAY,KAElB,QAAZ,MAALA,IAC6C,QAAZ,OAAhCC,EAAKrR,EAAMuR,WAAW5Q,EAAI,MAE5ByQ,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,GACxC1Q,IACAuI,GAAOoI,KAAiBF,GAAM,GAAK,IACnClI,GAAOoI,KAAiBF,GAAM,GAAK,GAAO,IAC1ClI,GAAOoI,KAAiBF,GAAM,EAAI,GAAO,IACzClI,GAAOoI,KAAsB,GAALF,EAAY,MAEpClI,GAAOoI,KAAiBF,GAAM,GAAK,IACnClI,GAAOoI,KAAiBF,GAAM,EAAI,GAAO,IACzClI,GAAOoI,KAAsB,GAALF,EAAY,KAGtCnT,EAASqT,EAAc3U,GAAWmU,CACvC,MACK7S,EAASmP,EAAWpN,EAAOrD,GAAWmU,GAGnC7S,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,KACf6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GACXA,EAAS,OACf6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAEjB6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEbA,IAAYsB,CAChB,MAAU,GAAa,WAATgJ,EACV,GAAIjH,IAAU,IAAMA,EAEfA,EAAQ,IAASA,EAAQ,MAA4B,IAApBxB,KAAKvB,YAA0B+C,EAAQ,KAASxB,KAAKyQ,aACzF/F,GAAOvM,MAAcqD,EACXA,EAAQ,KAClBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,GACXA,EAAQ,OAClBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,GAAS,EAC9BkJ,GAAOvM,MAAsB,IAARqD,IAErBkJ,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUqD,GAC/BrD,IAAY,QAEP,GAAIqD,GAAS,IAAMA,EACrBA,IAAU,GACbkJ,GAAOvM,MAAc,IAAQqD,EACnBA,IAAU,KACpBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,EAAQ,KACnBA,IAAU,OACpBkJ,GAAOvM,MAAc,IACrBgQ,GAAW6E,SAAS7U,GAAUqD,GAC9BrD,IAAY,IAEZuM,GAAOvM,MAAc,IACrBgQ,GAAW8E,SAAS9U,GAAUqD,GAC9BrD,IAAY,OAEP,CACN,IAAI6G,EACJ,IAAKA,EAAahF,KAAKgF,YAAc,GAAKxD,EAAQ,YAAeA,IAAU,WAAY,CAGtF,IAAI0R,EACJ,GAHAxI,GAAOvM,MAAc,IACrBgQ,GAAWgF,WAAWhV,GAAUqD,GAE5BwD,EAAa,IAEbkO,EAAW1R,EAAQ0D,GAA4B,IAAnBwF,GAAOvM,MAAqB,EAAMuM,GAAOvM,GAAW,IAAM,KAAQ,IAAO+U,EAExG,YADA/U,IAAY,GAGZA,IACD,CACDuM,GAAOvM,MAAc,IACrBgQ,GAAWiF,WAAWjV,GAAUqD,GAChCrD,IAAY,CACZ,MACK,GAAa,WAATsK,GAA8B,aAATA,EAC/B,GAAKjH,EAEA,CACJ,GAAIvD,EAAc,CACjB,IAAIoV,EAAUpV,EAAaiN,IAAI1J,GAC/B,GAAI6R,EAAS,CACZ,IAAKA,EAAQ9Q,GAAI,CAChB,IAAIwO,EAAc9S,EAAa8S,cAAgB9S,EAAa8S,YAAc,IAC1EsC,EAAQ9Q,GAAKwO,EAAYrP,KAAK2R,EAC9B,CAKD,OAJA3I,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUkV,EAAQ9Q,SACvCpE,IAAY,EAEZ,CACAF,EAAa+F,IAAIxC,EAAO,CAAEmN,OAAQxQ,GAAW0C,GAC9C,CACD,IAAI5B,EAAcuC,EAAMvC,YACxB,GAAIA,IAAgBa,OACnBwT,EAAY9R,QACN,GAAIvC,IAAgBiF,MAC1BmO,EAAU7Q,QACJ,GAAIvC,IAAgB8E,IAC1B,GAAI/D,KAAKuT,iBAAkB7I,GAAOvM,MAAc,QAC3C,EACJsB,EAAS+B,EAAMD,MACF,GACZmJ,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEb,IAAK,IAAK0F,EAAK2P,KAAehS,EAC7BoO,EAAK/L,GACL+L,EAAK4D,EAEN,KACK,CACN,IAAK,IAAIrR,EAAI,EAAGC,EAAIkL,GAAW7N,OAAQ0C,EAAIC,EAAGD,IAAK,CAElD,GAAIX,aADiB+L,GAAiBpL,GACD,CACpC,IAAI0D,EAAYyH,GAAWnL,GAC3B,GAAI0D,EAAU4N,MAAO,CAChB5N,EAAU4C,OACbiC,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc0H,EAAU4C,KAC/BiC,GAAOvM,MAAc,GAEtB,IAAIuV,EAAc7N,EAAU4N,MAAMnT,KAAKN,KAAMwB,GAU7C,YATIkS,IAAgBlS,EACf0C,MAAMgF,QAAQ1H,GACjB6Q,EAAU7Q,GAEV8R,EAAY9R,GAGboO,EAAK8D,GAGN,CACD,IAII/Q,EAJAgR,EAAgBjJ,GAChBkJ,EAAoBzF,GACpB0F,EAAkB1V,GACtBuM,GAAS,KAET,IACC/H,EAASkD,EAAU+J,KAAKtP,KAAKN,KAAMwB,GAAQD,IAE1CmJ,GAASiJ,EACTA,EAAgB,KAChBxV,IAAYoD,EACRpD,GAAWiQ,IACdkD,EAASnT,IACH,CACNuM,UAAQyD,cAAYhQ,SAAUA,GAAWoD,KAExCqO,EASH,CARS,QAEL+D,IACHjJ,GAASiJ,EACTxF,GAAayF,EACbzV,GAAW0V,EACXzF,GAAU1D,GAAOjL,OAAS,GAE3B,CAMD,YALIkD,IACCA,EAAOlD,OAAStB,GAAWiQ,IAC9BkD,EAAS3O,EAAOlD,OAAStB,IAC1BA,GAAW2V,GAAmBnR,EAAQ+H,GAAQvM,GAAU0H,EAAU4C,OAGnE,CACD,CAED,GAAIvE,MAAMgF,QAAQ1H,GACjB6Q,EAAU7Q,OACJ,CAEN,GAAIA,EAAMsB,OAAQ,CACjB,MAAMiR,EAAOvS,EAAMsB,SAEnB,GAAIiR,IAASvS,EACZ,OAAOoO,EAAKmE,EACb,CAGD,GAAa,aAATtL,EACH,OAAOmH,EAAK5P,KAAKgU,eAAiBhU,KAAKgU,cAAcxS,IAGtD8R,EAAY9R,EACZ,CACD,CACD,MAvHAkJ,GAAOvM,MAAc,SAwHhB,GAAa,YAATsK,EACViC,GAAOvM,MAAcqD,EAAQ,IAAO,SAC9B,GAAa,WAATiH,EAAmB,CAC7B,GAAIjH,EAAQ,oBAAsBA,IAAU,mBAE3CkJ,GAAOvM,MAAc,IACrBgQ,GAAW8F,YAAY9V,GAAUqD,QAC3B,GAAIA,EAAQ,qBAAuBA,EAAQ,EAEjDkJ,GAAOvM,MAAc,IACrBgQ,GAAW+F,aAAa/V,GAAUqD,OAC5B,CAEN,IAAIxB,KAAKmU,mBAGF,IAAInU,KAAKoU,oBACf,OAAOxE,EAAKpO,EAAM6D,YACZ,GAAIrF,KAAKqU,oBAAsBrU,KAAKoP,UAAW,CACrD,IAEInL,EAFAqQ,EAAQ9S,EAAQ,EAAI8D,QAAQ,GAAKA,OAAO,GAG5C,GAAI9D,GAAS8D,OAAO,SAAagP,EAAO,CACvC,IAAIC,EAAOjP,OAAO,qBAAuBA,OAAO,GAC5CkP,EAAS,GACb,KACCA,EAAO9S,KAAKF,EAAQ+S,GACf/S,GAAS8D,OAAO,MAASgP,GAC9B9S,IAAU8D,OAAO,IAGlBrB,EAAQ,IAAItD,WAAW,IAAI8T,eAAeD,GAAQjU,QAClD0D,EAAMyQ,SACb,KAAa,CACN,IAAIC,EAASnT,EAAQ,EACjB6C,GAAUsQ,GAAUnT,EAAQA,GAAO6D,SAAS,IAOhD,GANIhB,EAAO5E,OAAS,EACnB4E,EAAS,IAAMA,EACLuQ,SAASvQ,EAAOwQ,OAAO,GAAI,KAAO,IAC5CxQ,EAAS,KAAOA,GAGbwJ,GACH5J,EAAQxD,OAAOC,KAAK2D,EAAQ,WACtB,CACNJ,EAAQ,IAAItD,WAAW0D,EAAO5E,OAAS,GACvC,IAAK,IAAI0C,EAAI,EAAGA,EAAI8B,EAAMxE,OAAQ0C,IACjC8B,EAAM9B,GAAKyS,SAASvQ,EAAOnC,MAAU,EAAJC,EAAW,EAAJA,EAAQ,GAAI,GAErD,CAED,GAAIwS,EACH,IAAK,IAAIxS,EAAI,EAAGA,EAAI8B,EAAMxE,OAAQ0C,IAAK8B,EAAM9B,IAAM8B,EAAM9B,EAE1D,CAKD,OAHI8B,EAAMxE,OAAStB,GAAWiQ,IAC7BkD,EAASrN,EAAMxE,OAAStB,SACzBA,GAAW2V,GAAmB7P,EAAOyG,GAAQvM,GAAU,IAE7D,CACM,MAAM,IAAIkF,WAAW7B,0LAGrB,CAlDAkJ,GAAOvM,MAAc,IACrBgQ,GAAWiF,WAAWjV,GAAUoH,OAAO/D,GAkDxC,CACDrD,IAAY,CAChB,KAAU,IAAa,cAATsK,EASV,MAAM,IAAIxH,MAAM,iBAAmBwH,GAR/BzI,KAAK8U,qBACRpK,GAAOvM,MAAc,KAErBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,EACrBuM,GAAOvM,MAAc,EAItB,GAGI4W,EAAoB/U,KAAKgV,iBAAmBhV,KAAKiV,sBAAwBjV,KAAKkV,WAAetR,IAElG,IAAIuM,EACJ,GAAInQ,KAAKkV,WAAY,CACpB/E,EAAO,GACP,IAAK,IAAItM,KAAOD,EACuB,mBAA1BA,EAAOuR,iBAAiCvR,EAAOuR,eAAetR,IACxE7D,KAAKkV,WAAW5L,SAAS1F,EAAOC,KACjCsM,EAAKzO,KAAKmC,EAEhB,MACIsM,EAAOrQ,OAAOqQ,KAAKvM,GAEpB,IAYIC,EAZApE,EAAS0Q,EAAK1Q,OAalB,GAZIA,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAGT6B,KAAKiV,qBACR,IAAK,IAAI9S,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC0B,EAAMsM,EAAKhO,GACX,IAAIiT,EAAM7P,OAAO1B,GACjB+L,EAAKyF,MAAMD,GAAOvR,EAAMuR,GACxBxF,EAAKhM,EAAOC,GACZ,MAGD,IAAK,IAAI1B,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3ByN,EAAK/L,EAAMsM,EAAKhO,IAChByN,EAAKhM,EAAOC,GAEb,EAEDD,IACA8G,GAAOvM,MAAc,IACrB,IAAImX,EAAenX,GAAW0C,EAC9B1C,IAAY,EACZ,IAAIoD,EAAO,EACX,IAAK,IAAIsC,KAAOD,GACsB,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,MACxE+L,EAAK/L,GACL+L,EAAKhM,EAAOC,IACZtC,KAGF,GAAIA,EAAO,MACV,MAAM,IAAIN,MAAM,yHAGjByJ,GAAO4K,IAAiBzU,GAASU,GAAQ,EACzCmJ,GAAO4K,EAAezU,GAAgB,IAAPU,CAAW,EAGrCgU,GAAkC,IAApBvV,KAAKvB,WAAuBsW,EAC/C7V,EAAQsW,qBAAuBlG,EAC/B1L,IACA,IAAIwM,EAEAqF,EAFgBpF,EAAa/Q,EAAW2Q,cAAgB3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,OAC/FoF,EAAenX,KAAa0C,EAEhC,IAAK,IAAIgD,KAAOD,EACf,GAAqC,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,GAAM,CAE9E,GADAuM,EAAiBC,EAAWxM,GACxBuM,EACHC,EAAaD,MACT,CAEJ,IAAID,EAAOrQ,OAAOqQ,KAAKvM,GACnB8R,EAAiBrF,EACrBA,EAAa/Q,EAAW2Q,YACxB,IAAI0F,EAAiB,EACrB,IAAK,IAAIxT,EAAI,EAAGC,EAAI+N,EAAK1Q,OAAQ0C,EAAIC,EAAGD,IAAK,CAC5C,IAAI0B,EAAMsM,EAAKhO,GACfiO,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,MACjDyF,KAEDtF,EAAaD,CACb,CACGkF,EAAezU,EAAQ,GAAK1C,IAE/BA,KACAyX,EAAUvF,EAAYF,EAAMwF,IAE5BE,EAAgBxF,EAAYF,EAAMmF,EAAcK,GACjDF,GAAY,EACZpF,EAAaqF,EAAe7R,EAC5B,CACD+L,EAAKhM,EAAOC,GACZ,CAEF,IAAK4R,EAAW,CACf,IAAIK,EAAWzF,EAAW/B,IACtBwH,EACHpL,GAAO4K,EAAezU,GAASiV,EAE/BD,EAAgBxF,EAAYvQ,OAAOqQ,KAAKvM,GAAS0R,EAAc,EAChE,GAED1R,IACA,IAAIwM,EAAgBC,EAAa/Q,EAAW2Q,cAAgB3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,OAC/FyF,EAAiB,EACrB,IAAK,IAAI9R,KAAOD,GAA6C,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,MAChGuM,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,MACjDyF,KAEDtF,EAAaD,GAEd,IAAI0F,EAAWzF,EAAW/B,IACtBwH,EACCA,GAAY,IAAQxG,GACvB5E,GAAOvM,MAA4C,IAAR,IAApB2X,GAAY,KACnCpL,GAAOvM,MAAc2X,GAAY,GAEjCpL,GAAOvM,MAAc2X,EAEtBF,EAAUvF,EAAYA,EAAW0F,UAAYjW,OAAOqQ,KAAKvM,GAAS+R,GAGnE,IAAK,IAAI9R,KAAOD,GACsB,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,KACxE+L,EAAKhM,EAAOC,GACZ,EAIGmS,EAA4C,mBAAnBhW,KAAKvB,YAA4BuB,KAAKvB,WAE/D6U,EAAc0C,EAAmBpS,IACtCoS,EAAgBpS,GAAU2R,EAAY3R,GAAUmR,EAAiBnR,EAAO,EACrE2R,EAEE7E,EAAe9M,IACpB,IAAIqS,EAAcjH,EAAMyB,aAAa7M,EAAQ8G,GAAQ7J,EAAO1C,GAAUmB,EAAYgS,GAAU,CAAC9P,EAAOyU,EAAaC,KAChH,GAAIA,EACH,OAAOzH,GAAkB,EAC1BtQ,GAAW8X,EACX,IAAIE,EAAczL,GAGlB,OAFAkF,EAAKpO,GACLsQ,IACIqE,IAAgBzL,GACZ,CAAEvM,YAAUgQ,cAAYzD,WAEzBvM,EAAQ,IAEhB,GAAoB,IAAhB8X,EACH,OAAO3C,EAAY1P,GACpBzF,GAAW8X,CAAW,EAGjB3E,EAAY1Q,IACjB,IAAIwV,EACJ,GAAIxV,EAAM,SAAW,CAEpB,GAAKA,EAAMC,EAASoN,GACnB,MAAM,IAAIhN,MAAM,0DACjBmV,EAAUvJ,KAAKwJ,IAAIpI,GACsE,KAAxFpB,KAAKyJ,MAAMzJ,KAAK0J,KAAK3V,EAAMC,IAAUD,EAAM,SAAY,KAAO,GAAI,SAAY,MAC/E,MACAwV,EAAqE,GAAzDvJ,KAAK0J,IAAK3V,EAAMC,GAAU,EAAG6J,GAAOjL,OAAS,IAAM,KAAY,GAC5E,IAAI+W,EAAY,IAAI1I,GAAkBsI,GAUtC,OATAjI,GAAaqI,EAAUtY,WAAasY,EAAUtY,SAAW,IAAI4C,SAAS0V,EAAUjW,OAAQ,EAAG6V,IAC3FxV,EAAMiM,KAAKwJ,IAAIzV,EAAK8J,GAAOjL,QACvBiL,GAAO+L,KACV/L,GAAO+L,KAAKD,EAAW,EAAG3V,EAAOD,GAEjC4V,EAAUxS,IAAI0G,GAAOxI,MAAMrB,EAAOD,IACnCzC,IAAY0C,EACZA,EAAQ,EACRuN,GAAUoI,EAAU/W,OAAS,GACtBiL,GAAS8L,CAAS,EAEpBZ,EAAY,CAACvF,EAAYF,EAAMwF,KACpC,IAAIG,EAAWxW,EAAWiR,OACrBuF,IACJA,EAAW,IACRA,EAAWvG,GAAiBvP,KAAK0W,uBAAyB1W,KAAK0W,qBAAqBvG,IACvF2F,EAAWxW,EAAWqX,UAChBb,EAAWtG,IAChBsG,EAAWvG,GACZjQ,EAAWqX,UAAYb,EAAW,IAE9BA,GAAYtG,IACfsG,EAAWvG,GACZjQ,EAAWiR,OAASuF,EAAW,GAEhC,IAAIxT,EAAW6N,EAAK7N,SAAWwT,GAAY,IAAQxG,EAAqBwG,EAAW,IAAS,GAAK,EACjGzF,EAAW/B,IAAiBwH,EAC5BzF,EAAW0F,SAAW5F,EACtB7Q,EAAWwW,EAAW,IAAQ3F,EAE1B2F,EAAWvG,GACdY,EAAK9N,UAAW,EAChB/C,EAAWE,aAAesW,EAAW,GACrCrH,GAAkB,EACdnM,GAAY,GACfoI,GAAOvM,MAAkC,IAAR,GAAX2X,GACtBpL,GAAOvM,MAAcmE,GAErBoI,GAAOvM,MAAc2X,IAGlBxT,GAAY,GACfoI,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAkC,IAAR,GAAX2X,GACtBpL,GAAOvM,MAAcmE,IAErBoI,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc2X,GAGlBH,IACHjG,GAAoBC,EAAuCgG,GAExDlG,EAAkBhQ,QAAU4P,IAC/BI,EAAkBmH,QAAQtI,IAAiB,GAC5CmB,EAAkB/N,KAAK2O,GACvBT,EAAKO,GACL,EAEI0F,EAAkB,CAACxF,EAAYF,EAAM0G,EAAiBlB,KAC3D,IAAImB,EAAapM,GACbqM,EAAe5Y,GACf6Y,EAAc5I,GACd6I,EAAYpW,EAChB6J,GAASwD,GACT/P,GAAW,EACX0C,EAAQ,EACH6J,KACJwD,GAAaxD,GAAS,IAAIoD,GAAkB,OAC7CM,GAAU1D,GAAOjL,OAAS,GAC1BmW,EAAUvF,EAAYF,EAAMwF,GAC5BzH,GAAaxD,GACb,IAAIwM,EAAe/Y,GAKnB,GAJAuM,GAASoM,EACT3Y,GAAW4Y,EACX3I,GAAU4I,EACVnW,EAAQoW,EACJC,EAAe,EAAG,CACrB,IAAIC,EAAShZ,GAAW+Y,EAAe,EACnCC,EAAS/I,IACZkD,EAAS6F,GACV,IAAIC,EAAoBP,EAAkBhW,EAC1C6J,GAAOiH,WAAWyF,EAAoBF,EAAcE,EAAoB,EAAGjZ,IAC3EuM,GAAO1G,IAAIkK,GAAWhM,MAAM,EAAGgV,GAAeE,GAC9CjZ,GAAWgZ,CACf,MACIzM,GAAOmM,EAAkBhW,GAASqN,GAAW,EAC7C,CAEF,CACDmJ,UAAU9W,GAETmK,GAASnK,EACTmK,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQmK,GAAO3J,WAAY2J,GAAO1J,aAC5FmN,GAAazD,GAAOxM,SACpBC,GAAW,CACX,CACGA,aAAUqD,GACbrD,GAAWqD,CACX,CACGrD,eACH,OAAOA,EACP,CACDmZ,kBACKtX,KAAKV,aACRU,KAAKV,WAAa,IACfU,KAAKuX,eACRvX,KAAKuX,aAAe,GACrB,EAwGF,SAASC,GAAeC,EAAYhP,EAAMiP,EAAkB7H,GAC3D,IAAIpQ,EAASgY,EAAWzW,WACxB,GAAIvB,EAAS,EAAI,IAAO,CACvB,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiB,EAAIjY,GAChDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,EAAS,CAChC,MAAQ,GAAIA,EAAS,EAAI,MAAS,CAChC,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiB,EAAIjY,GAChDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAesB,EAAS,GAAM,EACrCiL,EAAOvM,KAAesB,EAAS,EAAK,GACtC,KAAQ,CACN,IAAIiL,OAAEA,EAAMvM,SAAEA,EAAQgQ,WAAEA,GAAeuJ,EAAiB,EAAIjY,GAC5DiL,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAUsB,EAAS,GACxCtB,GAAY,CACZ,CACDuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsK,EAChBgP,EAAWlX,SAAQkX,EAAa,IAAI9W,WAAW8W,IACpD/M,EAAO1G,IAAI,IAAIrD,WAAW8W,EAAWlX,OAAQkX,EAAW1W,WAAY0W,EAAWzW,YAAa7C,EAC7F,CACA,SAASwZ,GAAYpX,EAAQmX,GAC5B,IAAIjY,EAASc,EAAOS,WACpB,IAAI0J,EAAQvM,EACZ,GAAIsB,EAAS,IAAO,CACnB,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiBjY,EAAS,GACrDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,CACvB,MAAQ,GAAIA,EAAS,MAAS,CAC5B,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiBjY,EAAS,GACrDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,EAC/BiL,EAAOvM,KAAuB,IAATsB,CACvB,KAAQ,CACN,IAAIiL,OAAEA,EAAMvM,SAAEA,EAAQgQ,WAAEA,GAAeuJ,EAAiBjY,EAAS,GACjEiL,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAUsB,GAC/BtB,GAAY,CACZ,CACDuM,EAAO1G,IAAIzD,EAAQpC,EACpB,CAEA,SAAS2V,GAAmBnR,EAAQ+H,EAAQvM,EAAUsK,GACrD,IAAIhJ,EAASkD,EAAOlD,OACpB,OAAQA,GACP,KAAK,EACJiL,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,GACJuM,EAAOvM,KAAc,IACrB,MACD,QACKsB,EAAS,KACZiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GACXA,EAAS,OACnBiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,EAC/BiL,EAAOvM,KAAuB,IAATsB,IAErBiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,GAC/BiL,EAAOvM,KAAesB,GAAU,GAAM,IACtCiL,EAAOvM,KAAesB,GAAU,EAAK,IACrCiL,EAAOvM,KAAuB,IAATsB,GAMxB,OAHAiL,EAAOvM,KAAcsK,EACrBiC,EAAO1G,IAAIrB,EAAQxE,GACnBA,GAAYsB,CAEb,CAwBA,SAASqR,GAAajQ,EAAO+O,EAAMqB,GAClC,GAAIjT,GAAeyB,OAAS,EAAG,CAC9B0O,GAAWiD,UAAUpT,GAAeG,SAAW0C,EAAO1C,GAAW8S,EAAoBjT,GAAeG,SAAW0C,GAC/G7C,GAAemT,gBAAkBhT,GAAW0C,EAC5C,IAAI+W,EAAe5Z,GACnBA,GAAiB,KACjB4R,EAAKgI,EAAa,IAClBhI,EAAKgI,EAAa,GAClB,CACF,CAaA,SAAS1F,GAAkB5S,EAAY0P,GAOtC,OANA1P,EAAW6S,aAAgBtQ,IAC1B,IAAIgW,GAAchW,IAAwBmN,EAAMsB,2BAA6B,KAAOzO,EAAmBpC,OAGvG,OAFKoY,GACJ7I,EAAMrN,iBAAiBE,GACjBgW,CAAU,EAEXvY,CACR,CA5OAiO,GAAmB,CAAEX,KAAMjC,IAAK1J,MAAOwK,OAAQjL,YAAaV,OAAOgY,eAAenX,WAAWN,WAAWpB,YAA4B6B,SAAUnC,GAC9I2O,GAAa,CAAC,CACbsC,KAAKmI,EAAML,EAAkB9H,GAC5B,IAAIoI,EAAUD,EAAKE,UAAY,IAC/B,IAAKjY,KAAKkY,gBAA6C,IAA3BH,EAAKI,oBAA4BH,GAAW,GAAKA,EAAU,WAAa,CAEnG,IAAItN,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,GACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAU6Z,EAC/B,MAAM,GAAIA,EAAU,GAAKA,EAAU,WAAa,CAEhD,IAAItN,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,IACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAmC,IAAzB4Z,EAAKI,mBAAgCH,EAAU,IAAO,YAAgB,IACrG7J,EAAWiD,UAAUjT,EAAW,EAAG6Z,EACtC,MAAS,GAAI3C,MAAM2C,GAAU,CAC1B,GAAIhY,KAAKoY,cAER,OADAV,EAAiB,GACV9H,EAAK5P,KAAKoY,iBAGlB,IAAI1N,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,GACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GACxB,KAAS,CAEN,IAAIuM,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,IACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAmC,IAAzB4Z,EAAKI,mBACpChK,EAAW8F,YAAY9V,EAAW,EAAGmH,OAAOuH,KAAKC,MAAMkL,IACvD,CACD,GACC,CACFpI,KAAK5L,EAAK0T,EAAkB9H,GAC3B,GAAI5P,KAAKqY,iBAER,OADAX,EAAiB,GACV9H,EAAK,CAAA,GAEb,IAAI3L,EAAQC,MAAMxD,KAAKsD,IACnB0G,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK3L,EACL,GACC,CACF2L,KAAK/R,EAAO6Z,EAAkB9H,GAC7B,IAAIlF,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK,CAAE/R,EAAMgB,KAAMhB,EAAMyF,QAASzF,EAAM2M,OACxC,GACC,CACFoF,KAAK0I,EAAOZ,EAAkB9H,GAC7B,IAAIlF,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK,CAAE0I,EAAMpY,OAAQoY,EAAMC,OAC3B,GACC,CACF3I,KAAK4I,EAAad,GACb1X,KAAKoP,UACRoI,GAAegB,EAAa,GAAMd,GAElCC,GAAY9J,GAAgBpN,OAAOC,KAAK8X,GAAe,IAAI7X,WAAW6X,GAAcd,EACrF,GACC,CACF9H,KAAK6H,EAAYC,GAChB,IAAIzY,EAAcwY,EAAWxY,YACzBA,IAAgB+O,IAAahO,KAAKoP,UACrCoI,GAAeC,EAAYtM,EAAYsN,QAAQxZ,EAAYJ,MAAO6Y,GAElEC,GAAYF,EAAYC,EACzB,GACC,CACF9H,KAAK4I,EAAad,GACb1X,KAAKoP,UACRoI,GAAegB,EAAa,GAAMd,GAElCC,GAAY9J,GAAgBpN,OAAOC,KAAK8X,GAAe,IAAI7X,WAAW6X,GAAcd,EACrF,GACC,CACF9H,KAAKgD,EAAI8E,GACR,IAAIhN,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB,GAC3ChN,EAAOvM,GAAY,GACnB,IA+IFqQ,GAAMb,uBAAwB,EAE9B,IAAI+K,GAAe,IAAIlK,GAAM,CAAE/P,YAAY,IAC/B,MAACmR,GAAO8I,GAAa9I,KACpBC,GAAS6I,GAAa9I,KACtB+I,GAAUnK,IAGVvB,MAAEA,GAAKC,OAAEA,GAAMC,cAAEA,GAAaC,YAAEA,IAAgBJ,GAChD6E,GAAoB,IACpBO,GAAoB,KACpBrC,GAAsB,KChiCtB,MAAA6I,GA1CN,SAAqBC,EAAgB3Z,EAAU,IACpD,IAAK2Z,GAA4C,iBAAnBA,EAC5B,MAAM,IAAI5X,MAAM,8FAGlB,MAAM6X,EAAU,IAAI9Z,EAAQE,GAC5B,IAAIsE,EACJ,MAAMuV,EAAUlQ,IACd,IAAImQ,EAEAxV,IACFqF,EAAQpI,OAAOwY,OAAO,CAACzV,EAAYqF,IACnCrF,OAAarE,GAGf,IACE6Z,EAASF,EAAQ3X,eAAe0H,EAQjC,CAPC,MAAOqQ,GACP,IAAIA,EAAI1V,WAIN,MAAM0V,EAHN1V,EAAaqF,EAAM3G,MAAMgX,EAAI5X,cAC7B0X,EAASE,EAAI7X,MAIhB,CACD,OAAO2X,CAAM,EAGf,MAA+C,mBAApCH,EAAetK,OAAO4K,UACxB,YACL,IAAK,MAAM3X,KAASqX,QACVE,EAAOvX,EAElB,CAJM,GAKkD,mBAAzCqX,EAAetK,OAAO6K,eAC/B,kBACL,UAAW,MAAM5X,KAASqX,QAChBE,EAAOvX,EAElB,CAJM,QADF,CAOT,EAEa6X,GA5EN,SAAmBC,EAAgBpa,EAAU,IAClD,GAAKoa,GAA4C,iBAAnBA,EAEvB,IAA+C,mBAApCA,EAAe/K,OAAO4K,UACtC,OAQJ,UAAyBG,EAAgBpa,GACvC,MAAM8P,EAAQ,IAAIR,GAAMtP,GACxB,IAAK,MAAMsC,KAAS8X,QACZtK,EAAMY,KAAKpO,EAErB,CAbW+X,CAAaD,EAAgBpa,GAC/B,GAAmC,mBAAxBoa,EAAeE,MAAuE,mBAAzCF,EAAe/K,OAAO6K,eACnF,OAaJK,gBAAgCH,EAAgBpa,GAC9C,MAAM8P,EAAQ,IAAIR,GAAMtP,GACxB,UAAW,MAAMsC,KAAS8X,QAClBtK,EAAMY,KAAKpO,EAErB,CAlBWkY,CAAcJ,EAAgBpa,GAErC,MAAM,IAAI+B,MAAM,6FACjB,CAPC,MAAM,IAAIA,MAAM,yFAQpB,+ND8jCO,SAAsB4E,GAC5B,GAAIA,EAAU8T,MAAO,CACpB,IAAK9T,EAAU+J,OAAS/J,EAAU4N,MACjC,MAAM,IAAIxS,MAAM,2CACjB,GAAI4E,EAAU+J,OAAS/J,EAAU4C,KAChC,MAAM,IAAIxH,MAAM,kEACjBsM,GAAiBqM,QAAQ/T,EAAU8T,OACnCrM,GAAWsM,QAAQ/T,EACnB,ED2FK,SAAsBA,GACxBA,EAAU5F,OACb1B,EAAkBsH,EAAU4C,MAAQ5C,EAAU5F,OAE9C1B,EAAkBsH,EAAU4C,MAAQ5C,CACtC,CC/FCgU,CAAmBhU,EACpB,yGD1iByC,mBG9iBZ,2BHysCtB,SAAsBiU,GAC5BtM,GAAS,GAAKsM,EACd,IAAI7U,EAAaC,GAAsB,IAAbwI,GAAQ,KAAc,EAAMA,GAAQ,IAAM,GACpE,OAASzI,EAAa6U,GAAiBA,EAAgB,EAAI,IAAO,KAAS,GAAK7U,CACjF,+CG9sC0B"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/index.js b/node_modules/msgpackr/dist/index.js
new file mode 100644
index 0000000..5054825
--- /dev/null
+++ b/node_modules/msgpackr/dist/index.js
@@ -0,0 +1,2437 @@
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+	typeof define === 'function' && define.amd ? define(['exports'], factory) :
+	(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.msgpackr = {}));
+})(this, (function (exports) { 'use strict';
+
+	var decoder;
+	try {
+		decoder = new TextDecoder();
+	} catch(error) {}
+	var src;
+	var srcEnd;
+	var position$1 = 0;
+	var currentUnpackr = {};
+	var currentStructures;
+	var srcString;
+	var srcStringStart = 0;
+	var srcStringEnd = 0;
+	var bundledStrings$1;
+	var referenceMap;
+	var currentExtensions = [];
+	var dataView;
+	var defaultOptions = {
+		useRecords: false,
+		mapsAsObjects: true
+	};
+	class C1Type {}
+	const C1 = new C1Type();
+	C1.name = 'MessagePack 0xC1';
+	var sequentialMode = false;
+	var inlineObjectReadThreshold = 2;
+
+	class Unpackr {
+		constructor(options) {
+			if (options) {
+				if (options.useRecords === false && options.mapsAsObjects === undefined)
+					options.mapsAsObjects = true;
+				if (options.sequential && options.trusted !== false) {
+					options.trusted = true;
+					if (!options.structures && options.useRecords != false) {
+						options.structures = [];
+						if (!options.maxSharedStructures)
+							options.maxSharedStructures = 0;
+					}
+				}
+				if (options.structures)
+					options.structures.sharedLength = options.structures.length;
+				else if (options.getStructures) {
+					(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+					options.structures.sharedLength = 0;
+				}
+				if (options.int64AsNumber) {
+					options.int64AsType = 'number';
+				}
+			}
+			Object.assign(this, options);
+		}
+		unpack(source, options) {
+			if (src) {
+				// re-entrant execution, save the state and restore it after we do this unpack
+				return saveState(() => {
+					clearSource();
+					return this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);
+				});
+			}
+			if (!source.buffer && source.constructor === ArrayBuffer)
+				source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+			if (typeof options === 'object') {
+				srcEnd = options.end || source.length;
+				position$1 = options.start || 0;
+			} else {
+				position$1 = 0;
+				srcEnd = options > -1 ? options : source.length;
+			}
+			srcStringEnd = 0;
+			srcString = null;
+			bundledStrings$1 = null;
+			src = source;
+			// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+			// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+			// new ones
+			try {
+				dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+			} catch(error) {
+				// if it doesn't have a buffer, maybe it is the wrong type of object
+				src = null;
+				if (source instanceof Uint8Array)
+					throw error;
+				throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+			}
+			if (this instanceof Unpackr) {
+				currentUnpackr = this;
+				if (this.structures) {
+					currentStructures = this.structures;
+					return checkedRead(options);
+				} else if (!currentStructures || currentStructures.length > 0) {
+					currentStructures = [];
+				}
+			} else {
+				currentUnpackr = defaultOptions;
+				if (!currentStructures || currentStructures.length > 0)
+					currentStructures = [];
+			}
+			return checkedRead(options);
+		}
+		unpackMultiple(source, forEach) {
+			let values, lastPosition = 0;
+			try {
+				sequentialMode = true;
+				let size = source.length;
+				let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+				if (forEach) {
+					if (forEach(value, lastPosition, position$1) === false) return;
+					while(position$1 < size) {
+						lastPosition = position$1;
+						if (forEach(checkedRead(), lastPosition, position$1) === false) {
+							return;
+						}
+					}
+				}
+				else {
+					values = [ value ];
+					while(position$1 < size) {
+						lastPosition = position$1;
+						values.push(checkedRead());
+					}
+					return values;
+				}
+			} catch(error) {
+				error.lastPosition = lastPosition;
+				error.values = values;
+				throw error;
+			} finally {
+				sequentialMode = false;
+				clearSource();
+			}
+		}
+		_mergeStructures(loadedStructures, existingStructures) {
+			if (this._onLoadedStructures)
+				loadedStructures = this._onLoadedStructures(loadedStructures);
+			loadedStructures = loadedStructures || [];
+			if (Object.isFrozen(loadedStructures))
+				loadedStructures = loadedStructures.map(structure => structure.slice(0));
+			for (let i = 0, l = loadedStructures.length; i < l; i++) {
+				let structure = loadedStructures[i];
+				if (structure) {
+					structure.isShared = true;
+					if (i >= 32)
+						structure.highByte = (i - 32) >> 5;
+				}
+			}
+			loadedStructures.sharedLength = loadedStructures.length;
+			for (let id in existingStructures || []) {
+				if (id >= 0) {
+					let structure = loadedStructures[id];
+					let existing = existingStructures[id];
+					if (existing) {
+						if (structure)
+							(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+						loadedStructures[id] = existing;
+					}
+				}
+			}
+			return this.structures = loadedStructures;
+		}
+		decode(source, options) {
+			return this.unpack(source, options);
+		}
+	}
+	function checkedRead(options) {
+		try {
+			if (!currentUnpackr.trusted && !sequentialMode) {
+				let sharedLength = currentStructures.sharedLength || 0;
+				if (sharedLength < currentStructures.length)
+					currentStructures.length = sharedLength;
+			}
+			let result;
+			if (currentUnpackr._readStruct && src[position$1] < 0x40 && src[position$1] >= 0x20) {
+				result = currentUnpackr._readStruct(src, position$1, srcEnd);
+				src = null; // dispose of this so that recursive unpack calls don't save state
+				if (!(options && options.lazy) && result)
+					result = result.toJSON();
+				position$1 = srcEnd;
+			} else
+				result = read();
+			if (bundledStrings$1) { // bundled strings to skip past
+				position$1 = bundledStrings$1.postBundlePosition;
+				bundledStrings$1 = null;
+			}
+			if (sequentialMode)
+				// we only need to restore the structures if there was an error, but if we completed a read,
+				// we can clear this out and keep the structures we read
+				currentStructures.restoreStructures = null;
+
+			if (position$1 == srcEnd) {
+				// finished reading this source, cleanup references
+				if (currentStructures && currentStructures.restoreStructures)
+					restoreStructures();
+				currentStructures = null;
+				src = null;
+				if (referenceMap)
+					referenceMap = null;
+			} else if (position$1 > srcEnd) {
+				// over read
+				throw new Error('Unexpected end of MessagePack data');
+			} else if (!sequentialMode) {
+				let jsonView;
+				try {
+					jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+				} catch(error) {
+					jsonView = '(JSON view not available ' + error + ')';
+				}
+				throw new Error('Data read, but end of buffer not reached ' + jsonView);
+			}
+			// else more to read, but we are reading sequentially, so don't clear source yet
+			return result;
+		} catch(error) {
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			clearSource();
+			if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position$1 > srcEnd) {
+				error.incomplete = true;
+			}
+			throw error;
+		}
+	}
+
+	function restoreStructures() {
+		for (let id in currentStructures.restoreStructures) {
+			currentStructures[id] = currentStructures.restoreStructures[id];
+		}
+		currentStructures.restoreStructures = null;
+	}
+
+	function read() {
+		let token = src[position$1++];
+		if (token < 0xa0) {
+			if (token < 0x80) {
+				if (token < 0x40)
+					return token;
+				else {
+					let structure = currentStructures[token & 0x3f] ||
+						currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+					if (structure) {
+						if (!structure.read) {
+							structure.read = createStructureReader(structure, token & 0x3f);
+						}
+						return structure.read();
+					} else
+						return token;
+				}
+			} else if (token < 0x90) {
+				// map
+				token -= 0x80;
+				if (currentUnpackr.mapsAsObjects) {
+					let object = {};
+					for (let i = 0; i < token; i++) {
+						let key = readKey();
+						if (key === '__proto__')
+							key = '__proto_';
+						object[key] = read();
+					}
+					return object;
+				} else {
+					let map = new Map();
+					for (let i = 0; i < token; i++) {
+						map.set(read(), read());
+					}
+					return map;
+				}
+			} else {
+				token -= 0x90;
+				let array = new Array(token);
+				for (let i = 0; i < token; i++) {
+					array[i] = read();
+				}
+				if (currentUnpackr.freezeData)
+					return Object.freeze(array);
+				return array;
+			}
+		} else if (token < 0xc0) {
+			// fixstr
+			let length = token - 0xa0;
+			if (srcStringEnd >= position$1) {
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			}
+			if (srcStringEnd == 0 && srcEnd < 140) {
+				// for small blocks, avoiding the overhead of the extract call is helpful
+				let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+				if (string != null)
+					return string;
+			}
+			return readFixedString(length);
+		} else {
+			let value;
+			switch (token) {
+				case 0xc0: return null;
+				case 0xc1:
+					if (bundledStrings$1) {
+						value = read(); // followed by the length of the string in characters (not bytes!)
+						if (value > 0)
+							return bundledStrings$1[1].slice(bundledStrings$1.position1, bundledStrings$1.position1 += value);
+						else
+							return bundledStrings$1[0].slice(bundledStrings$1.position0, bundledStrings$1.position0 -= value);
+					}
+					return C1; // "never-used", return special object to denote that
+				case 0xc2: return false;
+				case 0xc3: return true;
+				case 0xc4:
+					// bin 8
+					value = src[position$1++];
+					if (value === undefined)
+						throw new Error('Unexpected end of buffer');
+					return readBin(value);
+				case 0xc5:
+					// bin 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readBin(value);
+				case 0xc6:
+					// bin 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readBin(value);
+				case 0xc7:
+					// ext 8
+					return readExt(src[position$1++]);
+				case 0xc8:
+					// ext 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readExt(value);
+				case 0xc9:
+					// ext 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readExt(value);
+				case 0xca:
+					value = dataView.getFloat32(position$1);
+					if (currentUnpackr.useFloat32 > 2) {
+						// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+						let multiplier = mult10[((src[position$1] & 0x7f) << 1) | (src[position$1 + 1] >> 7)];
+						position$1 += 4;
+						return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+					}
+					position$1 += 4;
+					return value;
+				case 0xcb:
+					value = dataView.getFloat64(position$1);
+					position$1 += 8;
+					return value;
+				// uint handlers
+				case 0xcc:
+					return src[position$1++];
+				case 0xcd:
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xce:
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xcf:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getUint32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigUint64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigUint64(position$1);
+						if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigUint64(position$1);
+					position$1 += 8;
+					return value;
+
+				// int handlers
+				case 0xd0:
+					return dataView.getInt8(position$1++);
+				case 0xd1:
+					value = dataView.getInt16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xd2:
+					value = dataView.getInt32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xd3:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getInt32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigInt64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigInt64(position$1);
+						if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigInt64(position$1);
+					position$1 += 8;
+					return value;
+
+				case 0xd4:
+					// fixext 1
+					value = src[position$1++];
+					if (value == 0x72) {
+						return recordDefinition(src[position$1++] & 0x3f);
+					} else {
+						let extension = currentExtensions[value];
+						if (extension) {
+							if (extension.read) {
+								position$1++; // skip filler byte
+								return extension.read(read());
+							} else if (extension.noBuffer) {
+								position$1++; // skip filler byte
+								return extension();
+							} else
+								return extension(src.subarray(position$1, ++position$1));
+						} else
+							throw new Error('Unknown extension ' + value);
+					}
+				case 0xd5:
+					// fixext 2
+					value = src[position$1];
+					if (value == 0x72) {
+						position$1++;
+						return recordDefinition(src[position$1++] & 0x3f, src[position$1++]);
+					} else
+						return readExt(2);
+				case 0xd6:
+					// fixext 4
+					return readExt(4);
+				case 0xd7:
+					// fixext 8
+					return readExt(8);
+				case 0xd8:
+					// fixext 16
+					return readExt(16);
+				case 0xd9:
+				// str 8
+					value = src[position$1++];
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString8(value);
+				case 0xda:
+				// str 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString16(value);
+				case 0xdb:
+				// str 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString32(value);
+				case 0xdc:
+				// array 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readArray(value);
+				case 0xdd:
+				// array 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readArray(value);
+				case 0xde:
+				// map 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readMap(value);
+				case 0xdf:
+				// map 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readMap(value);
+				default: // negative int
+					if (token >= 0xe0)
+						return token - 0x100;
+					if (token === undefined) {
+						let error = new Error('Unexpected end of MessagePack data');
+						error.incomplete = true;
+						throw error;
+					}
+					throw new Error('Unknown MessagePack token ' + token);
+
+			}
+		}
+	}
+	const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+	function createStructureReader(structure, firstId) {
+		function readObject() {
+			// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+			if (readObject.count++ > inlineObjectReadThreshold) {
+				let optimizedReadObject;
+				try {
+					optimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+						'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+				} catch(error) {
+					// in CF workers, the new Function call could begin to fail at any point in time
+					inlineObjectReadThreshold = Infinity; // disable going forward
+					return readObject(); // recursively try again
+				}
+				if (structure.highByte === 0)
+					structure.read = createSecondByteReader(firstId, structure.read);
+				return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+			}
+			let object = {};
+			for (let i = 0, l = structure.length; i < l; i++) {
+				let key = structure[i];
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(object);
+			return object;
+		}
+		readObject.count = 0;
+		if (structure.highByte === 0) {
+			return createSecondByteReader(firstId, readObject);
+		}
+		return readObject;
+	}
+
+	const createSecondByteReader = (firstId, read0) => {
+		return function() {
+			let highByte = src[position$1++];
+			if (highByte === 0)
+				return read0();
+			let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+			let structure = currentStructures[id] || loadStructures()[id];
+			if (!structure) {
+				throw new Error('Record id is not defined for ' + id);
+			}
+			if (!structure.read)
+				structure.read = createStructureReader(structure, firstId);
+			return structure.read();
+		};
+	};
+
+	function loadStructures() {
+		let loadedStructures = saveState(() => {
+			// save the state in case getStructures modifies our buffer
+			src = null;
+			return currentUnpackr.getStructures();
+		});
+		return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+	}
+
+	var readFixedString = readStringJS;
+	var readString8 = readStringJS;
+	var readString16 = readStringJS;
+	var readString32 = readStringJS;
+	let isNativeAccelerationEnabled = false;
+	function readStringJS(length) {
+		let result;
+		if (length < 16) {
+			if (result = shortStringInJS(length))
+				return result;
+		}
+		if (length > 64 && decoder)
+			return decoder.decode(src.subarray(position$1, position$1 += length));
+		const end = position$1 + length;
+		const units = [];
+		result = '';
+		while (position$1 < end) {
+			const byte1 = src[position$1++];
+			if ((byte1 & 0x80) === 0) {
+				// 1 byte
+				units.push(byte1);
+			} else if ((byte1 & 0xe0) === 0xc0) {
+				// 2 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+				// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+				if (codePoint < 0x80) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf0) === 0xe0) {
+				// 3 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+				// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+				// Also reject surrogates (0xD800-0xDFFF)
+				if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf8) === 0xf0) {
+				// 4 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const byte4 = src[position$1++] & 0x3f;
+				let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+				// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+				// Also reject values > 0x10FFFF (maximum valid Unicode)
+				if (unit < 0x10000 || unit > 0x10FFFF) {
+					units.push(0xFFFD); // replacement character
+				} else if (unit > 0xffff) {
+					unit -= 0x10000;
+					units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+					unit = 0xdc00 | (unit & 0x3ff);
+					units.push(unit);
+				} else {
+					units.push(unit);
+				}
+			} else {
+				units.push(0xFFFD); // replacement character for invalid lead byte
+			}
+
+			if (units.length >= 0x1000) {
+				result += fromCharCode.apply(String, units);
+				units.length = 0;
+			}
+		}
+
+		if (units.length > 0) {
+			result += fromCharCode.apply(String, units);
+		}
+
+		return result;
+	}
+
+	function readArray(length) {
+		let array = new Array(length);
+		for (let i = 0; i < length; i++) {
+			array[i] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(array);
+		return array;
+	}
+
+	function readMap(length) {
+		if (currentUnpackr.mapsAsObjects) {
+			let object = {};
+			for (let i = 0; i < length; i++) {
+				let key = readKey();
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			return object;
+		} else {
+			let map = new Map();
+			for (let i = 0; i < length; i++) {
+				map.set(read(), read());
+			}
+			return map;
+		}
+	}
+
+	var fromCharCode = String.fromCharCode;
+	function longStringInJS(length) {
+		let start = position$1;
+		let bytes = new Array(length);
+		for (let i = 0; i < length; i++) {
+			const byte = src[position$1++];
+			if ((byte & 0x80) > 0) {
+					position$1 = start;
+					return;
+				}
+				bytes[i] = byte;
+			}
+			return fromCharCode.apply(String, bytes);
+	}
+	function shortStringInJS(length) {
+		if (length < 4) {
+			if (length < 2) {
+				if (length === 0)
+					return '';
+				else {
+					let a = src[position$1++];
+					if ((a & 0x80) > 1) {
+						position$1 -= 1;
+						return;
+					}
+					return fromCharCode(a);
+				}
+			} else {
+				let a = src[position$1++];
+				let b = src[position$1++];
+				if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+					position$1 -= 2;
+					return;
+				}
+				if (length < 3)
+					return fromCharCode(a, b);
+				let c = src[position$1++];
+				if ((c & 0x80) > 0) {
+					position$1 -= 3;
+					return;
+				}
+				return fromCharCode(a, b, c);
+			}
+		} else {
+			let a = src[position$1++];
+			let b = src[position$1++];
+			let c = src[position$1++];
+			let d = src[position$1++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+				position$1 -= 4;
+				return;
+			}
+			if (length < 6) {
+				if (length === 4)
+					return fromCharCode(a, b, c, d);
+				else {
+					let e = src[position$1++];
+					if ((e & 0x80) > 0) {
+						position$1 -= 5;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e);
+				}
+			} else if (length < 8) {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+					position$1 -= 6;
+					return;
+				}
+				if (length < 7)
+					return fromCharCode(a, b, c, d, e, f);
+				let g = src[position$1++];
+				if ((g & 0x80) > 0) {
+					position$1 -= 7;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g);
+			} else {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				let g = src[position$1++];
+				let h = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+					position$1 -= 8;
+					return;
+				}
+				if (length < 10) {
+					if (length === 8)
+						return fromCharCode(a, b, c, d, e, f, g, h);
+					else {
+						let i = src[position$1++];
+						if ((i & 0x80) > 0) {
+							position$1 -= 9;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i);
+					}
+				} else if (length < 12) {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+						position$1 -= 10;
+						return;
+					}
+					if (length < 11)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+					let k = src[position$1++];
+					if ((k & 0x80) > 0) {
+						position$1 -= 11;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+				} else {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					let k = src[position$1++];
+					let l = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+						position$1 -= 12;
+						return;
+					}
+					if (length < 14) {
+						if (length === 12)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+						else {
+							let m = src[position$1++];
+							if ((m & 0x80) > 0) {
+								position$1 -= 13;
+								return;
+							}
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+						}
+					} else {
+						let m = src[position$1++];
+						let n = src[position$1++];
+						if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+							position$1 -= 14;
+							return;
+						}
+						if (length < 15)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+						let o = src[position$1++];
+						if ((o & 0x80) > 0) {
+							position$1 -= 15;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+					}
+				}
+			}
+		}
+	}
+
+	function readOnlyJSString() {
+		let token = src[position$1++];
+		let length;
+		if (token < 0xc0) {
+			// fixstr
+			length = token - 0xa0;
+		} else {
+			switch(token) {
+				case 0xd9:
+				// str 8
+					length = src[position$1++];
+					break;
+				case 0xda:
+				// str 16
+					length = dataView.getUint16(position$1);
+					position$1 += 2;
+					break;
+				case 0xdb:
+				// str 32
+					length = dataView.getUint32(position$1);
+					position$1 += 4;
+					break;
+				default:
+					throw new Error('Expected string');
+			}
+		}
+		return readStringJS(length);
+	}
+
+
+	function readBin(length) {
+		return currentUnpackr.copyBuffers ?
+			// specifically use the copying slice (not the node one)
+			Uint8Array.prototype.slice.call(src, position$1, position$1 += length) :
+			src.subarray(position$1, position$1 += length);
+	}
+	function readExt(length) {
+		let type = src[position$1++];
+		if (currentExtensions[type]) {
+			let end;
+			return currentExtensions[type](src.subarray(position$1, end = (position$1 += length)), (readPosition) => {
+				position$1 = readPosition;
+				try {
+					return read();
+				} finally {
+					position$1 = end;
+				}
+			});
+		}
+		else
+			throw new Error('Unknown extension type ' + type);
+	}
+
+	var keyCache = new Array(4096);
+	function readKey() {
+		let length = src[position$1++];
+		if (length >= 0xa0 && length < 0xc0) {
+			// fixstr, potentially use key cache
+			length = length - 0xa0;
+			if (srcStringEnd >= position$1) // if it has been extracted, must use it (and faster anyway)
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			else if (!(srcStringEnd == 0 && srcEnd < 180))
+				return readFixedString(length);
+		} else { // not cacheable, go back and do a standard read
+			position$1--;
+			return asSafeString(read());
+		}
+		let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position$1) : length > 0 ? src[position$1] : 0)) & 0xfff;
+		let entry = keyCache[key];
+		let checkPosition = position$1;
+		let end = position$1 + length - 3;
+		let chunk;
+		let i = 0;
+		if (entry && entry.bytes == length) {
+			while (checkPosition < end) {
+				chunk = dataView.getUint32(checkPosition);
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+				checkPosition += 4;
+			}
+			end += 3;
+			while (checkPosition < end) {
+				chunk = src[checkPosition++];
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+			}
+			if (checkPosition === end) {
+				position$1 = checkPosition;
+				return entry.string;
+			}
+			end -= 3;
+			checkPosition = position$1;
+		}
+		entry = [];
+		keyCache[key] = entry;
+		entry.bytes = length;
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			entry.push(chunk);
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			entry.push(chunk);
+		}
+		// for small blocks, avoiding the overhead of the extract call is helpful
+		let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+		if (string != null)
+			return entry.string = string;
+		return entry.string = readFixedString(length);
+	}
+
+	function asSafeString(property) {
+		// protect against expensive (DoS) string conversions
+		if (typeof property === 'string') return property;
+		if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+		if (property == null) return property + '';
+		if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+			return property.flat().toString();
+		}
+		throw new Error(`Invalid property type for record: ${typeof property}`);
+	}
+	// the registration of the record definition extension (as "r")
+	const recordDefinition = (id, highByte) => {
+		let structure = read().map(asSafeString); // ensure that all keys are strings and
+		// that the array is mutable
+		let firstByte = id;
+		if (highByte !== undefined) {
+			id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+			structure.highByte = highByte;
+		}
+		let existingStructure = currentStructures[id];
+		// If it is a shared structure, we need to restore any changes after reading.
+		// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+		// to the state prior to an incomplete read in order to properly resume.
+		if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+			(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+		}
+		currentStructures[id] = structure;
+		structure.read = createStructureReader(structure, firstByte);
+		return structure.read();
+	};
+	currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+	currentExtensions[0].noBuffer = true;
+
+	currentExtensions[0x42] = data => {
+		let headLength = (data.byteLength % 8) || 8;
+		let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+		for (let i = 1; i < headLength; i++) {
+			head <<= BigInt(8);
+			head += BigInt(data[i]);
+		}
+		if (data.byteLength !== headLength) {
+			let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+			let decode = (start, end) => {
+				let length = end - start;
+				if (length <= 40) {
+					let out = view.getBigUint64(start);
+					for (let i = start + 8; i < end; i += 8) {
+						out <<= BigInt(64);
+						out |= view.getBigUint64(i);
+					}
+					return out;
+				}
+				// if (length === 8) return view.getBigUint64(start)
+				let middle = start + (length >> 4 << 3);
+				let left = decode(start, middle);
+				let right = decode(middle, end);
+				return (left << BigInt((end - middle) * 8)) | right;
+			};
+			head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+		}
+		return head;
+	};
+
+	let errors = {
+		Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+	};
+	currentExtensions[0x65] = () => {
+		let data = read();
+		if (!errors[data[0]]) {
+			let error = Error(data[1], { cause: data[2] });
+			error.name = data[0];
+			return error;
+		}
+		return errors[data[0]](data[1], { cause: data[2] });
+	};
+
+	currentExtensions[0x69] = (data) => {
+		// id extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		if (!referenceMap)
+			referenceMap = new Map();
+		let token = src[position$1];
+		let target;
+		// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+		if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+			target = [];
+		else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+			target = new Map();
+		else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position$1 + 1] === 0x73)
+			target = new Set();
+		else
+			target = {};
+
+		let refEntry = { target }; // a placeholder object
+		referenceMap.set(id, refEntry);
+		let targetProperties = read(); // read the next value as the target object to id
+		if (!refEntry.used) {
+			// no cycle, can just use the returned read object
+			return refEntry.target = targetProperties; // replace the placeholder with the real one
+		} else {
+			// there is a cycle, so we have to assign properties to original target
+			Object.assign(target, targetProperties);
+		}
+
+		// copy over map/set entries if we're able to
+		if (target instanceof Map)
+			for (let [k, v] of targetProperties.entries()) target.set(k, v);
+		if (target instanceof Set)
+			for (let i of Array.from(targetProperties)) target.add(i);
+		return target;
+	};
+
+	currentExtensions[0x70] = (data) => {
+		// pointer extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		let refEntry = referenceMap.get(id);
+		refEntry.used = true;
+		return refEntry.target;
+	};
+
+	currentExtensions[0x73] = () => new Set(read());
+
+	const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+	let glbl = typeof globalThis === 'object' ? globalThis : window;
+	currentExtensions[0x74] = (data) => {
+		let typeCode = data[0];
+		// we always have to slice to get a new ArrayBuffer that is aligned
+		let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+		let typedArrayName = typedArrays[typeCode];
+		if (!typedArrayName) {
+			if (typeCode === 16) return buffer;
+			if (typeCode === 17) return new DataView(buffer);
+			throw new Error('Could not find typed array for code ' + typeCode);
+		}
+		return new glbl[typedArrayName](buffer);
+	};
+	currentExtensions[0x78] = () => {
+		let data = read();
+		return new RegExp(data[0], data[1]);
+	};
+	const TEMP_BUNDLE = [];
+	currentExtensions[0x62] = (data) => {
+		let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+		let dataPosition = position$1;
+		position$1 += dataSize - data.length;
+		bundledStrings$1 = TEMP_BUNDLE;
+		bundledStrings$1 = [readOnlyJSString(), readOnlyJSString()];
+		bundledStrings$1.position0 = 0;
+		bundledStrings$1.position1 = 0;
+		bundledStrings$1.postBundlePosition = position$1;
+		position$1 = dataPosition;
+		return read();
+	};
+
+	currentExtensions[0xff] = (data) => {
+		// 32-bit date extension
+		if (data.length == 4)
+			return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+		else if (data.length == 8)
+			return new Date(
+				((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+				((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+		else if (data.length == 12)
+			return new Date(
+				((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+				(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+		else
+			return new Date('invalid');
+	};
+	// registration of bulk record definition?
+	// currentExtensions[0x52] = () =>
+
+	function saveState(callback) {
+		if (currentUnpackr && currentUnpackr._onSaveState)
+			currentUnpackr._onSaveState();
+		let savedSrcEnd = srcEnd;
+		let savedPosition = position$1;
+		let savedSrcStringStart = srcStringStart;
+		let savedSrcStringEnd = srcStringEnd;
+		let savedSrcString = srcString;
+		let savedReferenceMap = referenceMap;
+		let savedBundledStrings = bundledStrings$1;
+
+		// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+		let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+		let savedStructures = currentStructures;
+		let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+		let savedPackr = currentUnpackr;
+		let savedSequentialMode = sequentialMode;
+		let value = callback();
+		srcEnd = savedSrcEnd;
+		position$1 = savedPosition;
+		srcStringStart = savedSrcStringStart;
+		srcStringEnd = savedSrcStringEnd;
+		srcString = savedSrcString;
+		referenceMap = savedReferenceMap;
+		bundledStrings$1 = savedBundledStrings;
+		src = savedSrc;
+		sequentialMode = savedSequentialMode;
+		currentStructures = savedStructures;
+		currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+		currentUnpackr = savedPackr;
+		dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+		return value;
+	}
+	function clearSource() {
+		src = null;
+		referenceMap = null;
+		currentStructures = null;
+	}
+
+	function addExtension$1(extension) {
+		if (extension.unpack)
+			currentExtensions[extension.type] = extension.unpack;
+		else
+			currentExtensions[extension.type] = extension;
+	}
+
+	const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+	for (let i = 0; i < 256; i++) {
+		mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+	}
+	const Decoder = Unpackr;
+	var defaultUnpackr = new Unpackr({ useRecords: false });
+	const unpack = defaultUnpackr.unpack;
+	const unpackMultiple = defaultUnpackr.unpackMultiple;
+	const decode = defaultUnpackr.unpack;
+	const FLOAT32_OPTIONS = {
+		NEVER: 0,
+		ALWAYS: 1,
+		DECIMAL_ROUND: 3,
+		DECIMAL_FIT: 4
+	};
+	let f32Array = new Float32Array(1);
+	let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+	function roundFloat32(float32Number) {
+		f32Array[0] = float32Number;
+		let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+		return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+	}
+	// Marker for downstream libraries (e.g. structon) to detect per-instance
+	// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+	// this._onSaveState).  See `checkedRead` for the dispatch.
+	Unpackr.SUPPORTS_STRUCT_HOOKS = true;
+
+	let textEncoder;
+	try {
+		textEncoder = new TextEncoder();
+	} catch (error) {}
+	let extensions, extensionClasses;
+	const hasNodeBuffer = typeof Buffer !== 'undefined';
+	const ByteArrayAllocate = hasNodeBuffer ?
+		function(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;
+	const ByteArray = hasNodeBuffer ? Buffer : Uint8Array;
+	const MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;
+	let target, keysTarget;
+	let targetView;
+	let position = 0;
+	let safeEnd;
+	let bundledStrings = null;
+	const MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.
+	const hasNonLatin = /[\u0080-\uFFFF]/;
+	const RECORD_SYMBOL = Symbol('record-id');
+	class Packr extends Unpackr {
+		constructor(options) {
+			super(options);
+			this.offset = 0;
+			let start;
+			let hasSharedUpdate;
+			let structures;
+			let referenceMap;
+			let encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {
+				return target.utf8Write(string, position, target.byteLength - position);
+			} : (textEncoder && textEncoder.encodeInto) ?
+				function(string, position) {
+					return textEncoder.encodeInto(string, target.subarray(position)).written;
+				} : false;
+
+			let packr = this;
+			if (!options)
+				options = {};
+			let isSequential = options && options.sequential;
+			let hasSharedStructures = options.structures || options.saveStructures;
+			let maxSharedStructures = options.maxSharedStructures;
+			if (maxSharedStructures == null)
+				maxSharedStructures = hasSharedStructures ? 32 : 0;
+			if (maxSharedStructures > 8160)
+				throw new Error('Maximum maxSharedStructure is 8160');
+			if (options.structuredClone && options.moreTypes == undefined) {
+				this.moreTypes = true;
+			}
+			let maxOwnStructures = options.maxOwnStructures;
+			if (maxOwnStructures == null)
+				maxOwnStructures = hasSharedStructures ? 32 : 64;
+			if (!this.structures && options.useRecords != false)
+				this.structures = [];
+			// two byte record ids for shared structures
+			let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
+			let sharedLimitId = maxSharedStructures + 0x40;
+			let maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;
+			if (maxStructureId > 8256) {
+				throw new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');
+			}
+			let recordIdsToRemove = [];
+			let transitionsCount = 0;
+			let serializationsSinceTransitionRebuild = 0;
+
+			this.pack = this.encode = function(value, encodeOptions) {
+				if (!target) {
+					target = new ByteArrayAllocate(8192);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));
+					position = 0;
+				}
+				safeEnd = target.length - 10;
+				if (safeEnd - position < 0x800) {
+					// don't start too close to the end,
+					target = new ByteArrayAllocate(target.length);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));
+					safeEnd = target.length - 10;
+					position = 0;
+				} else
+					position = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster
+				start = position;
+				if (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);
+				referenceMap = packr.structuredClone ? new Map() : null;
+				if (packr.bundleStrings && typeof value !== 'string') {
+					bundledStrings = [];
+					bundledStrings.size = Infinity; // force a new bundle start on first string
+				} else
+					bundledStrings = null;
+				structures = packr.structures;
+				if (structures) {
+					if (structures.uninitialized)
+						structures = packr._mergeStructures(packr.getStructures());
+					let sharedLength = structures.sharedLength || 0;
+					if (sharedLength > maxSharedStructures) {
+						//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
+						throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);
+					}
+					if (!structures.transitions) {
+						// rebuild our structure transitions
+						structures.transitions = Object.create(null);
+						for (let i = 0; i < sharedLength; i++) {
+							let keys = structures[i];
+							if (!keys)
+								continue;
+							let nextTransition, transition = structures.transitions;
+							for (let j = 0, l = keys.length; j < l; j++) {
+								let key = keys[j];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+								}
+								transition = nextTransition;
+							}
+							transition[RECORD_SYMBOL] = i + 0x40;
+						}
+						this.lastNamedStructuresLength = sharedLength;
+					}
+					if (!isSequential) {
+						structures.nextId = sharedLength + 0x40;
+					}
+				}
+				if (hasSharedUpdate)
+					hasSharedUpdate = false;
+				let encodingError;
+				try {
+					if (packr._writeStruct && value && typeof value === 'object') {
+						if (value.constructor === Object) writeStruct(value); // simple object
+						else if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {
+							// allow user classes, if they don't need special handling (but do use toJSON if available)
+							writeStruct(value.toJSON ? value.toJSON() : value);
+						} else pack(value);
+					} else
+						pack(value);
+					let lastBundle = bundledStrings;
+					if (bundledStrings)
+						writeBundles(start, pack, 0);
+					if (referenceMap && referenceMap.idsToInsert) {
+						let idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);
+						let i = idsToInsert.length;
+						let incrementPosition = -1;
+						while (lastBundle && i > 0) {
+							let insertionPoint = idsToInsert[--i].offset + start;
+							if (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)
+								incrementPosition = 0;
+							if (insertionPoint > (lastBundle.position + start)) {
+								if (incrementPosition >= 0)
+									incrementPosition += 6;
+							} else {
+								if (incrementPosition >= 0) {
+									// update the bundle reference now
+									targetView.setUint32(lastBundle.position + start,
+										targetView.getUint32(lastBundle.position + start) + incrementPosition);
+									incrementPosition = -1; // reset
+								}
+								lastBundle = lastBundle.previous;
+								i++;
+							}
+						}
+						if (incrementPosition >= 0 && lastBundle) {
+							// update the bundle reference now
+							targetView.setUint32(lastBundle.position + start,
+								targetView.getUint32(lastBundle.position + start) + incrementPosition);
+						}
+						position += idsToInsert.length * 6;
+						if (position > safeEnd)
+							makeRoom(position);
+						packr.offset = position;
+						let serialized = insertIds(target.subarray(start, position), idsToInsert);
+						referenceMap = null;
+						return serialized;
+					}
+					packr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
+					if (encodeOptions & REUSE_BUFFER_MODE) {
+						target.start = start;
+						target.end = position;
+						return target;
+					}
+					return target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now
+				} catch(error) {
+					encodingError = error;
+					throw error;
+				} finally {
+					if (structures) {
+						resetStructures();
+						if (hasSharedUpdate && packr.saveStructures) {
+							let sharedLength = structures.sharedLength || 0;
+							// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
+							let returnBuffer = target.subarray(start, position);
+							let newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);
+							if (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time
+								if (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {
+									// get updated structures and try again if the update failed
+									return packr.pack(value, encodeOptions);
+								}
+								packr.lastNamedStructuresLength = sharedLength;
+								// don't keep large buffers around
+								if (target.length > 0x40000000) target = null;
+								return returnBuffer;
+							}
+						}
+					}
+					// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)
+					if (target.length > 0x40000000) target = null;
+					if (encodeOptions & RESET_BUFFER_MODE)
+						position = start;
+				}
+			};
+			const resetStructures = () => {
+				if (serializationsSinceTransitionRebuild < 10)
+					serializationsSinceTransitionRebuild++;
+				let sharedLength = structures.sharedLength || 0;
+				if (structures.length > sharedLength && !isSequential)
+					structures.length = sharedLength;
+				if (transitionsCount > 10000) {
+					// force a rebuild occasionally after a lot of transitions so it can get cleaned up
+					structures.transitions = null;
+					serializationsSinceTransitionRebuild = 0;
+					transitionsCount = 0;
+					if (recordIdsToRemove.length > 0)
+						recordIdsToRemove = [];
+				} else if (recordIdsToRemove.length > 0 && !isSequential) {
+					for (let i = 0, l = recordIdsToRemove.length; i < l; i++) {
+						recordIdsToRemove[i][RECORD_SYMBOL] = 0;
+					}
+					recordIdsToRemove = [];
+				}
+			};
+			const packArray = (value) => {
+				var length = value.length;
+				if (length < 0x10) {
+					target[position++] = 0x90 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xdc;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdd;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				for (let i = 0; i < length; i++) {
+					pack(value[i]);
+				}
+			};
+			const pack = (value) => {
+				if (position > safeEnd)
+					target = makeRoom(position);
+
+				var type = typeof value;
+				var length;
+				if (type === 'string') {
+					let strLength = value.length;
+					if (bundledStrings && strLength >= 4 && strLength < 0x1000) {
+						if ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {
+							let extStart;
+							let maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;
+							if (position + maxBytes > safeEnd)
+								target = makeRoom(position + maxBytes);
+							let lastBundle;
+							if (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle
+								lastBundle = bundledStrings;
+								target[position] = 0xc8; // ext 16
+								position += 3; // reserve for the writing bundle size
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+								writeBundles(start, pack, 0); // write the last bundles
+								targetView.setUint16(extStart + start - 3, position - start - extStart);
+							} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+							}
+							bundledStrings = ['', '']; // create new ones
+							bundledStrings.previous = lastBundle;
+							bundledStrings.size = 0;
+							bundledStrings.position = extStart;
+						}
+						let twoByte = hasNonLatin.test(value);
+						bundledStrings[twoByte ? 0 : 1] += value;
+						target[position++] = 0xc1;
+						pack(twoByte ? -strLength : strLength);
+						return;
+					}
+					let headerSize;
+					// first we estimate the header size, so we can write to the correct location
+					if (strLength < 0x20) {
+						headerSize = 1;
+					} else if (strLength < 0x100) {
+						headerSize = 2;
+					} else if (strLength < 0x10000) {
+						headerSize = 3;
+					} else {
+						headerSize = 5;
+					}
+					let maxBytes = strLength * 3;
+					if (position + maxBytes > safeEnd)
+						target = makeRoom(position + maxBytes);
+
+					if (strLength < 0x40 || !encodeUtf8) {
+						let i, c1, c2, strPosition = position + headerSize;
+						for (i = 0; i < strLength; i++) {
+							c1 = value.charCodeAt(i);
+							if (c1 < 0x80) {
+								target[strPosition++] = c1;
+							} else if (c1 < 0x800) {
+								target[strPosition++] = c1 >> 6 | 0xc0;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else if (
+								(c1 & 0xfc00) === 0xd800 &&
+								((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00
+							) {
+								c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+								i++;
+								target[strPosition++] = c1 >> 18 | 0xf0;
+								target[strPosition++] = c1 >> 12 & 0x3f | 0x80;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else {
+								target[strPosition++] = c1 >> 12 | 0xe0;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							}
+						}
+						length = strPosition - position - headerSize;
+					} else {
+						length = encodeUtf8(value, position + headerSize);
+					}
+
+					if (length < 0x20) {
+						target[position++] = 0xa0 | length;
+					} else if (length < 0x100) {
+						if (headerSize < 2) {
+							target.copyWithin(position + 2, position + 1, position + 1 + length);
+						}
+						target[position++] = 0xd9;
+						target[position++] = length;
+					} else if (length < 0x10000) {
+						if (headerSize < 3) {
+							target.copyWithin(position + 3, position + 2, position + 2 + length);
+						}
+						target[position++] = 0xda;
+						target[position++] = length >> 8;
+						target[position++] = length & 0xff;
+					} else {
+						if (headerSize < 5) {
+							target.copyWithin(position + 5, position + 3, position + 3 + length);
+						}
+						target[position++] = 0xdb;
+						targetView.setUint32(position, length);
+						position += 4;
+					}
+					position += length;
+				} else if (type === 'number') {
+					if (value >>> 0 === value) {// positive integer, 32-bit or less
+						// positive uint
+						if (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {
+							target[position++] = value;
+						} else if (value < 0x100) {
+							target[position++] = 0xcc;
+							target[position++] = value;
+						} else if (value < 0x10000) {
+							target[position++] = 0xcd;
+							target[position++] = value >> 8;
+							target[position++] = value & 0xff;
+						} else {
+							target[position++] = 0xce;
+							targetView.setUint32(position, value);
+							position += 4;
+						}
+					} else if (value >> 0 === value) { // negative integer
+						if (value >= -0x20) {
+							target[position++] = 0x100 + value;
+						} else if (value >= -0x80) {
+							target[position++] = 0xd0;
+							target[position++] = value + 0x100;
+						} else if (value >= -0x8000) {
+							target[position++] = 0xd1;
+							targetView.setInt16(position, value);
+							position += 2;
+						} else {
+							target[position++] = 0xd2;
+							targetView.setInt32(position, value);
+							position += 4;
+						}
+					} else {
+						let useFloat32;
+						if ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {
+							target[position++] = 0xca;
+							targetView.setFloat32(position, value);
+							let xShifted;
+							if (useFloat32 < 4 ||
+									// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+									((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {
+								position += 4;
+								return;
+							} else
+								position--; // move back into position for writing a double
+						}
+						target[position++] = 0xcb;
+						targetView.setFloat64(position, value);
+						position += 8;
+					}
+				} else if (type === 'object' || type === 'function') {
+					if (!value)
+						target[position++] = 0xc0;
+					else {
+						if (referenceMap) {
+							let referee = referenceMap.get(value);
+							if (referee) {
+								if (!referee.id) {
+									let idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);
+									referee.id = idsToInsert.push(referee);
+								}
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x70; // "p" for pointer
+								targetView.setUint32(position, referee.id);
+								position += 4;
+								return;
+							} else
+								referenceMap.set(value, { offset: position - start });
+						}
+						let constructor = value.constructor;
+						if (constructor === Object) {
+							writeObject(value);
+						} else if (constructor === Array) {
+							packArray(value);
+						} else if (constructor === Map) {
+							if (this.mapAsEmptyObject) target[position++] = 0x80;
+							else {
+								length = value.size;
+								if (length < 0x10) {
+									target[position++] = 0x80 | length;
+								} else if (length < 0x10000) {
+									target[position++] = 0xde;
+									target[position++] = length >> 8;
+									target[position++] = length & 0xff;
+								} else {
+									target[position++] = 0xdf;
+									targetView.setUint32(position, length);
+									position += 4;
+								}
+								for (let [key, entryValue] of value) {
+									pack(key);
+									pack(entryValue);
+								}
+							}
+						} else {
+							for (let i = 0, l = extensions.length; i < l; i++) {
+								let extensionClass = extensionClasses[i];
+								if (value instanceof extensionClass) {
+									let extension = extensions[i];
+									if (extension.write) {
+										if (extension.type) {
+											target[position++] = 0xd4; // one byte "tag" extension
+											target[position++] = extension.type;
+											target[position++] = 0;
+										}
+										let writeResult = extension.write.call(this, value);
+										if (writeResult === value) { // avoid infinite recursion
+											if (Array.isArray(value)) {
+												packArray(value);
+											} else {
+												writeObject(value);
+											}
+										} else {
+											pack(writeResult);
+										}
+										return;
+									}
+									let currentTarget = target;
+									let currentTargetView = targetView;
+									let currentPosition = position;
+									target = null;
+									let result;
+									try {
+										result = extension.pack.call(this, value, (size) => {
+											// restore target and use it
+											target = currentTarget;
+											currentTarget = null;
+											position += size;
+											if (position > safeEnd)
+												makeRoom(position);
+											return {
+												target, targetView, position: position - size
+											};
+										}, pack);
+									} finally {
+										// restore current target information (unless already restored)
+										if (currentTarget) {
+											target = currentTarget;
+											targetView = currentTargetView;
+											position = currentPosition;
+											safeEnd = target.length - 10;
+										}
+									}
+									if (result) {
+										if (result.length + position > safeEnd)
+											makeRoom(result.length + position);
+										position = writeExtensionData(result, target, position, extension.type);
+									}
+									return;
+								}
+							}
+							// check isArray after extensions, because extensions can extend Array
+							if (Array.isArray(value)) {
+								packArray(value);
+							} else {
+								// use this as an alternate mechanism for expressing how to serialize
+								if (value.toJSON) {
+									const json = value.toJSON();
+									// if for some reason value.toJSON returns itself it'll loop forever
+									if (json !== value)
+										return pack(json);
+								}
+
+								// if there is a writeFunction, use it, otherwise just encode as undefined
+								if (type === 'function')
+									return pack(this.writeFunction && this.writeFunction(value));
+
+								// no extension found, write as plain object
+								writeObject(value);
+							}
+						}
+					}
+				} else if (type === 'boolean') {
+					target[position++] = value ? 0xc3 : 0xc2;
+				} else if (type === 'bigint') {
+					if (value < 0x8000000000000000 && value >= -0x8000000000000000) {
+						// use a signed int as long as it fits
+						target[position++] = 0xd3;
+						targetView.setBigInt64(position, value);
+					} else if (value < 0x10000000000000000 && value > 0) {
+						// if we can fit an unsigned int, use that
+						target[position++] = 0xcf;
+						targetView.setBigUint64(position, value);
+					} else {
+						// overflow
+						if (this.largeBigIntToFloat) {
+							target[position++] = 0xcb;
+							targetView.setFloat64(position, Number(value));
+						} else if (this.largeBigIntToString) {
+							return pack(value.toString());
+						} else if (this.useBigIntExtension || this.moreTypes) {
+							let empty = value < 0 ? BigInt(-1) : BigInt(0);
+
+							let array;
+							if (value >> BigInt(0x10000) === empty) {
+								let mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow
+								let chunks = [];
+								while (true) {
+									chunks.push(value & mask);
+									if ((value >> BigInt(63)) === empty) break;
+									value >>= BigInt(64);
+								}
+
+								array = new Uint8Array(new BigUint64Array(chunks).buffer);
+								array.reverse();
+							} else {
+								let invert = value < 0;
+								let string = (invert ? ~value : value).toString(16);
+								if (string.length % 2) {
+									string = '0' + string;
+								} else if (parseInt(string.charAt(0), 16) >= 8) {
+									string = '00' + string;
+								}
+
+								if (hasNodeBuffer) {
+									array = Buffer.from(string, 'hex');
+								} else {
+									array = new Uint8Array(string.length / 2);
+									for (let i = 0; i < array.length; i++) {
+										array[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);
+									}
+								}
+
+								if (invert) {
+									for (let i = 0; i < array.length; i++) array[i] = ~array[i];
+								}
+							}
+
+							if (array.length + position > safeEnd)
+								makeRoom(array.length + position);
+							position = writeExtensionData(array, target, position, 0x42);
+							return;
+						} else {
+							throw new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +
+								' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +
+								' largeBigIntToString to convert to string');
+						}
+					}
+					position += 8;
+				} else if (type === 'undefined') {
+					if (this.encodeUndefinedAsNil)
+						target[position++] = 0xc0;
+					else {
+						target[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite
+						target[position++] = 0;
+						target[position++] = 0;
+					}
+				} else {
+					throw new Error('Unknown type: ' + type);
+				}
+			};
+
+			const writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {
+				// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
+				let keys;
+				if (this.skipValues) {
+					keys = [];
+					for (let key in object) {
+						if ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&
+							!this.skipValues.includes(object[key]))
+							keys.push(key);
+					}
+				} else {
+					keys = Object.keys(object);
+				}
+				let length = keys.length;
+				if (length < 0x10) {
+					target[position++] = 0x80 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xde;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdf;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				let key;
+				if (this.coercibleKeyAsNumber) {
+					for (let i = 0; i < length; i++) {
+						key = keys[i];
+						let num = Number(key);
+						pack(isNaN(num) ? key : num);
+						pack(object[key]);
+					}
+
+				} else {
+					for (let i = 0; i < length; i++) {
+						pack(key = keys[i]);
+						pack(object[key]);
+					}
+				}
+			} :
+			(object) => {
+				target[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards
+				let objectOffset = position - start;
+				position += 2;
+				let size = 0;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(key);
+						pack(object[key]);
+						size++;
+					}
+				}
+				if (size > 0xffff) {
+					throw new Error('Object is too large to serialize with fast 16-bit map size,' +
+					' use the "variableMapSize" option to serialize this object');
+				}
+				target[objectOffset++ + start] = size >> 8;
+				target[objectOffset + start] = size & 0xff;
+			};
+
+			const writeRecord = this.useRecords === false ? writePlainObject :
+			(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let objectOffset = position++ - start;
+				let wroteKeys;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						nextTransition = transition[key];
+						if (nextTransition)
+							transition = nextTransition;
+						else {
+							// record doesn't exist, create full new record and insert it
+							let keys = Object.keys(object);
+							let lastTransition = transition;
+							transition = structures.transitions;
+							let newTransitions = 0;
+							for (let i = 0, l = keys.length; i < l; i++) {
+								let key = keys[i];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+									newTransitions++;
+								}
+								transition = nextTransition;
+							}
+							if (objectOffset + start + 1 == position) {
+								// first key, so we don't need to insert, we can just write record directly
+								position--;
+								newRecord(transition, keys, newTransitions);
+							} else // otherwise we need to insert the record, moving existing data after the record
+								insertNewRecord(transition, keys, objectOffset, newTransitions);
+							wroteKeys = true;
+							transition = lastTransition[key];
+						}
+						pack(object[key]);
+					}
+				}
+				if (!wroteKeys) {
+					let recordId = transition[RECORD_SYMBOL];
+					if (recordId)
+						target[objectOffset + start] = recordId;
+					else
+						insertNewRecord(transition, Object.keys(object), objectOffset, 0);
+				}
+			} :
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let newTransitions = 0;
+				for (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					nextTransition = transition[key];
+					if (!nextTransition) {
+						nextTransition = transition[key] = Object.create(null);
+						newTransitions++;
+					}
+					transition = nextTransition;
+				}
+				let recordId = transition[RECORD_SYMBOL];
+				if (recordId) {
+					if (recordId >= 0x60 && useTwoByteRecords) {
+						target[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;
+						target[position++] = recordId >> 5;
+					} else
+						target[position++] = recordId;
+				} else {
+					newRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);
+				}
+				// now write the values
+				for (let key in object)
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(object[key]);
+					}
+			};
+
+			// create reference to useRecords if useRecords is a function
+			const checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;
+
+			const writeObject = checkUseRecords ? (object) => {
+				checkUseRecords(object) ? writeRecord(object) : writePlainObject(object);
+			} : writeRecord;
+
+			const writeStruct = (object) => {
+				let newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {
+					if (notifySharedUpdate)
+						return hasSharedUpdate = true;
+					position = newPosition;
+					let startTarget = target;
+					pack(value);
+					resetStructures();
+					if (startTarget !== target) {
+						return { position, targetView, target }; // indicate the buffer was re-allocated
+					}
+					return position;
+				});
+				if (newPosition === 0) // bail and go to a msgpack object
+					return writeObject(object);
+				position = newPosition;
+			};
+
+			const makeRoom = (end) => {
+				let newSize;
+				if (end > 0x1000000) {
+					// special handling for really large buffers
+					if ((end - start) > MAX_BUFFER_SIZE)
+						throw new Error('Packed buffer would be larger than maximum buffer size');
+					newSize = Math.min(MAX_BUFFER_SIZE,
+						Math.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);
+				} else // faster handling for smaller buffers
+					newSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;
+				let newBuffer = new ByteArrayAllocate(newSize);
+				targetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));
+				end = Math.min(end, target.length);
+				if (target.copy)
+					target.copy(newBuffer, 0, start, end);
+				else
+					newBuffer.set(target.slice(start, end));
+				position -= start;
+				start = 0;
+				safeEnd = newBuffer.length - 10;
+				return target = newBuffer;
+			};
+			const newRecord = (transition, keys, newTransitions) => {
+				let recordId = structures.nextId;
+				if (!recordId)
+					recordId = 0x40;
+				if (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {
+					recordId = structures.nextOwnId;
+					if (!(recordId < maxStructureId))
+						recordId = sharedLimitId;
+					structures.nextOwnId = recordId + 1;
+				} else {
+					if (recordId >= maxStructureId)// cycle back around
+						recordId = sharedLimitId;
+					structures.nextId = recordId + 1;
+				}
+				let highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;
+				transition[RECORD_SYMBOL] = recordId;
+				transition.__keys__ = keys;
+				structures[recordId - 0x40] = keys;
+
+				if (recordId < sharedLimitId) {
+					keys.isShared = true;
+					structures.sharedLength = recordId - 0x3f;
+					hasSharedUpdate = true;
+					if (highByte >= 0) {
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = recordId;
+					}
+				} else {
+					if (highByte >= 0) {
+						target[position++] = 0xd5; // fixext 2
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = 0xd4; // fixext 1
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = recordId;
+					}
+
+					if (newTransitions)
+						transitionsCount += serializationsSinceTransitionRebuild * newTransitions;
+					// record the removal of the id, we can maintain our shared structure
+					if (recordIdsToRemove.length >= maxOwnStructures)
+						recordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones
+					recordIdsToRemove.push(transition);
+					pack(keys);
+				}
+			};
+			const insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {
+				let mainTarget = target;
+				let mainPosition = position;
+				let mainSafeEnd = safeEnd;
+				let mainStart = start;
+				target = keysTarget;
+				position = 0;
+				start = 0;
+				if (!target)
+					keysTarget = target = new ByteArrayAllocate(8192);
+				safeEnd = target.length - 10;
+				newRecord(transition, keys, newTransitions);
+				keysTarget = target;
+				let keysPosition = position;
+				target = mainTarget;
+				position = mainPosition;
+				safeEnd = mainSafeEnd;
+				start = mainStart;
+				if (keysPosition > 1) {
+					let newEnd = position + keysPosition - 1;
+					if (newEnd > safeEnd)
+						makeRoom(newEnd);
+					let insertionPosition = insertionOffset + start;
+					target.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);
+					target.set(keysTarget.slice(0, keysPosition), insertionPosition);
+					position = newEnd;
+				} else {
+					target[insertionOffset + start] = keysTarget[0];
+				}
+			};
+		}
+		useBuffer(buffer) {
+			// this means we are finished using our own buffer and we can write over it safely
+			target = buffer;
+			target.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));
+			targetView = target.dataView;
+			position = 0;
+		}
+		set position (value) {
+			position = value;
+		}
+		get position() {
+			return position;
+		}
+		clearSharedData() {
+			if (this.structures)
+				this.structures = [];
+			if (this.typedStructs)
+				this.typedStructs = [];
+		}
+	}
+
+	extensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];
+	extensions = [{
+		pack(date, allocateForWrite, pack) {
+			let seconds = date.getTime() / 1000;
+			if ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {
+				// Timestamp 32
+				let { target, targetView, position} = allocateForWrite(6);
+				target[position++] = 0xd6;
+				target[position++] = 0xff;
+				targetView.setUint32(position, seconds);
+			} else if (seconds > 0 && seconds < 0x100000000) {
+				// Timestamp 64
+				let { target, targetView, position} = allocateForWrite(10);
+				target[position++] = 0xd7;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));
+				targetView.setUint32(position + 4, seconds);
+			} else if (isNaN(seconds)) {
+				if (this.onInvalidDate) {
+					allocateForWrite(0);
+					return pack(this.onInvalidDate());
+				}
+				// Intentionally invalid timestamp
+				let { target, targetView, position} = allocateForWrite(3);
+				target[position++] = 0xd4;
+				target[position++] = 0xff;
+				target[position++] = 0xff;
+			} else {
+				// Timestamp 96
+				let { target, targetView, position} = allocateForWrite(15);
+				target[position++] = 0xc7;
+				target[position++] = 12;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 1000000);
+				targetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));
+			}
+		}
+	}, {
+		pack(set, allocateForWrite, pack) {
+			if (this.setAsEmptyObject) {
+				allocateForWrite(0);
+				return pack({});
+			}
+			let array = Array.from(set);
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x73; // 's' for Set
+				target[position++] = 0;
+			}
+			pack(array);
+		}
+	}, {
+		pack(error, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x65; // 'e' for error
+				target[position++] = 0;
+			}
+			pack([ error.name, error.message, error.cause ]);
+		}
+	}, {
+		pack(regex, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x78; // 'x' for regeXp
+				target[position++] = 0;
+			}
+			pack([ regex.source, regex.flags ]);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x10, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(typedArray, allocateForWrite) {
+			let constructor = typedArray.constructor;
+			if (constructor !== ByteArray && this.moreTypes)
+				writeExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);
+			else
+				writeBuffer(typedArray, allocateForWrite);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x11, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(c1, allocateForWrite) { // specific 0xC1 object
+			let { target, position} = allocateForWrite(1);
+			target[position] = 0xc1;
+		}
+	}];
+
+	function writeExtBuffer(typedArray, type, allocateForWrite, encode) {
+		let length = typedArray.byteLength;
+		if (length + 1 < 0x100) {
+			var { target, position } = allocateForWrite(4 + length);
+			target[position++] = 0xc7;
+			target[position++] = length + 1;
+		} else if (length + 1 < 0x10000) {
+			var { target, position } = allocateForWrite(5 + length);
+			target[position++] = 0xc8;
+			target[position++] = (length + 1) >> 8;
+			target[position++] = (length + 1) & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(7 + length);
+			target[position++] = 0xc9;
+			targetView.setUint32(position, length + 1); // plus one for the type byte
+			position += 4;
+		}
+		target[position++] = 0x74; // "t" for typed array
+		target[position++] = type;
+		if (!typedArray.buffer) typedArray = new Uint8Array(typedArray);
+		target.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);
+	}
+	function writeBuffer(buffer, allocateForWrite) {
+		let length = buffer.byteLength;
+		var target, position;
+		if (length < 0x100) {
+			var { target, position } = allocateForWrite(length + 2);
+			target[position++] = 0xc4;
+			target[position++] = length;
+		} else if (length < 0x10000) {
+			var { target, position } = allocateForWrite(length + 3);
+			target[position++] = 0xc5;
+			target[position++] = length >> 8;
+			target[position++] = length & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(length + 5);
+			target[position++] = 0xc6;
+			targetView.setUint32(position, length);
+			position += 4;
+		}
+		target.set(buffer, position);
+	}
+
+	function writeExtensionData(result, target, position, type) {
+		let length = result.length;
+		switch (length) {
+			case 1:
+				target[position++] = 0xd4;
+				break;
+			case 2:
+				target[position++] = 0xd5;
+				break;
+			case 4:
+				target[position++] = 0xd6;
+				break;
+			case 8:
+				target[position++] = 0xd7;
+				break;
+			case 16:
+				target[position++] = 0xd8;
+				break;
+			default:
+				if (length < 0x100) {
+					target[position++] = 0xc7;
+					target[position++] = length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xc8;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xc9;
+					target[position++] = length >> 24;
+					target[position++] = (length >> 16) & 0xff;
+					target[position++] = (length >> 8) & 0xff;
+					target[position++] = length & 0xff;
+				}
+		}
+		target[position++] = type;
+		target.set(result, position);
+		position += length;
+		return position;
+	}
+
+	function insertIds(serialized, idsToInsert) {
+		// insert the ids that need to be referenced for structured clones
+		let nextId;
+		let distanceToMove = idsToInsert.length * 6;
+		let lastEnd = serialized.length - distanceToMove;
+		while (nextId = idsToInsert.pop()) {
+			let offset = nextId.offset;
+			let id = nextId.id;
+			serialized.copyWithin(offset + distanceToMove, offset, lastEnd);
+			distanceToMove -= 6;
+			let position = offset + distanceToMove;
+			serialized[position++] = 0xd6;
+			serialized[position++] = 0x69; // 'i'
+			serialized[position++] = id >> 24;
+			serialized[position++] = (id >> 16) & 0xff;
+			serialized[position++] = (id >> 8) & 0xff;
+			serialized[position++] = id & 0xff;
+			lastEnd = offset;
+		}
+		return serialized;
+	}
+
+	function writeBundles(start, pack, incrementPosition) {
+		if (bundledStrings.length > 0) {
+			targetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);
+			bundledStrings.stringsPosition = position - start;
+			let writeStrings = bundledStrings;
+			bundledStrings = null;
+			pack(writeStrings[0]);
+			pack(writeStrings[1]);
+		}
+	}
+
+	function addExtension(extension) {
+		if (extension.Class) {
+			if (!extension.pack && !extension.write)
+				throw new Error('Extension has no pack or write function');
+			if (extension.pack && !extension.type)
+				throw new Error('Extension has no type (numeric code to identify the extension)');
+			extensionClasses.unshift(extension.Class);
+			extensions.unshift(extension);
+		}
+		addExtension$1(extension);
+	}
+	function prepareStructures(structures, packr) {
+		structures.isCompatible = (existingStructures) => {
+			let compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);
+			if (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction
+				packr._mergeStructures(existingStructures);
+			return compatible;
+		};
+		return structures;
+	}
+
+	// Marker for downstream libraries (e.g. structon) to detect that this Packr
+	// supports per-instance struct-encoding hooks (this._writeStruct,
+	// this._prepareStructures).  See `pack` for the dispatch.
+	Packr.SUPPORTS_STRUCT_HOOKS = true;
+
+	let defaultPackr = new Packr({ useRecords: false });
+	const pack = defaultPackr.pack;
+	const encode = defaultPackr.pack;
+	const Encoder = Packr;
+	const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;
+	const REUSE_BUFFER_MODE = 512;
+	const RESET_BUFFER_MODE = 1024;
+	const RESERVE_START_SPACE = 2048;
+
+	/**
+	 * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
+	 * If the argument is only Async Iterable, the return value will be an Async Iterable.
+	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object
+	 * @param {options} [options] - msgpackr pack options
+	 * @returns {IterableIterator|Promise.<AsyncIterableIterator>}
+	 */
+	function packIter (objectIterator, options = {}) {
+	  if (!objectIterator || typeof objectIterator !== 'object') {
+	    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');
+	  } else if (typeof objectIterator[Symbol.iterator] === 'function') {
+	    return packIterSync(objectIterator, options);
+	  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {
+	    return packIterAsync(objectIterator, options);
+	  } else {
+	    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');
+	  }
+	}
+
+	function * packIterSync (objectIterator, options) {
+	  const packr = new Packr(options);
+	  for (const value of objectIterator) {
+	    yield packr.pack(value);
+	  }
+	}
+
+	async function * packIterAsync (objectIterator, options) {
+	  const packr = new Packr(options);
+	  for await (const value of objectIterator) {
+	    yield packr.pack(value);
+	  }
+	}
+
+	/**
+	 * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
+	 * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
+	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
+	 * @param {object} [options] - unpackr options
+	 * @returns {IterableIterator|Promise.<AsyncIterableIterator}
+	 */
+	function unpackIter (bufferIterator, options = {}) {
+	  if (!bufferIterator || typeof bufferIterator !== 'object') {
+	    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');
+	  }
+
+	  const unpackr = new Unpackr(options);
+	  let incomplete;
+	  const parser = (chunk) => {
+	    let yields;
+	    // if there's incomplete data from previous chunk, concatinate and try again
+	    if (incomplete) {
+	      chunk = Buffer.concat([incomplete, chunk]);
+	      incomplete = undefined;
+	    }
+
+	    try {
+	      yields = unpackr.unpackMultiple(chunk);
+	    } catch (err) {
+	      if (err.incomplete) {
+	        incomplete = chunk.slice(err.lastPosition);
+	        yields = err.values;
+	      } else {
+	        throw err;
+	      }
+	    }
+	    return yields;
+	  };
+
+	  if (typeof bufferIterator[Symbol.iterator] === 'function') {
+	    return (function * iter () {
+	      for (const value of bufferIterator) {
+	        yield * parser(value);
+	      }
+	    })();
+	  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {
+	    return (async function * iter () {
+	      for await (const value of bufferIterator) {
+	        yield * parser(value);
+	      }
+	    })();
+	  }
+	}
+	const decodeIter = unpackIter;
+	const encodeIter = packIter;
+
+	const useRecords = false;
+	const mapsAsObjects = true;
+
+	exports.ALWAYS = ALWAYS;
+	exports.C1 = C1;
+	exports.DECIMAL_FIT = DECIMAL_FIT;
+	exports.DECIMAL_ROUND = DECIMAL_ROUND;
+	exports.Decoder = Decoder;
+	exports.Encoder = Encoder;
+	exports.FLOAT32_OPTIONS = FLOAT32_OPTIONS;
+	exports.NEVER = NEVER;
+	exports.Packr = Packr;
+	exports.RESERVE_START_SPACE = RESERVE_START_SPACE;
+	exports.RESET_BUFFER_MODE = RESET_BUFFER_MODE;
+	exports.REUSE_BUFFER_MODE = REUSE_BUFFER_MODE;
+	exports.Unpackr = Unpackr;
+	exports.addExtension = addExtension;
+	exports.clearSource = clearSource;
+	exports.decode = decode;
+	exports.decodeIter = decodeIter;
+	exports.encode = encode;
+	exports.encodeIter = encodeIter;
+	exports.isNativeAccelerationEnabled = isNativeAccelerationEnabled;
+	exports.mapsAsObjects = mapsAsObjects;
+	exports.pack = pack;
+	exports.roundFloat32 = roundFloat32;
+	exports.unpack = unpack;
+	exports.unpackMultiple = unpackMultiple;
+	exports.useRecords = useRecords;
+
+}));
+//# sourceMappingURL=index.js.map
diff --git a/node_modules/msgpackr/dist/index.js.map b/node_modules/msgpackr/dist/index.js.map
new file mode 100644
index 0000000..3ed2d18
--- /dev/null
+++ b/node_modules/msgpackr/dist/index.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../unpack.js","../pack.js","../iterators.js","../index.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","import { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\n\n/**\n * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer\n * If the argument is only Async Iterable, the return value will be an Async Iterable.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object\n * @param {options} [options] - msgpackr pack options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator>}\n */\nexport function packIter (objectIterator, options = {}) {\n  if (!objectIterator || typeof objectIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');\n  } else if (typeof objectIterator[Symbol.iterator] === 'function') {\n    return packIterSync(objectIterator, options);\n  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {\n    return packIterAsync(objectIterator, options);\n  } else {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');\n  }\n}\n\nfunction * packIterSync (objectIterator, options) {\n  const packr = new Packr(options);\n  for (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\nasync function * packIterAsync (objectIterator, options) {\n  const packr = new Packr(options);\n  for await (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\n/**\n * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects\n * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator\n * @param {object} [options] - unpackr options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator}\n */\nexport function unpackIter (bufferIterator, options = {}) {\n  if (!bufferIterator || typeof bufferIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');\n  }\n\n  const unpackr = new Unpackr(options);\n  let incomplete;\n  const parser = (chunk) => {\n    let yields;\n    // if there's incomplete data from previous chunk, concatinate and try again\n    if (incomplete) {\n      chunk = Buffer.concat([incomplete, chunk]);\n      incomplete = undefined;\n    }\n\n    try {\n      yields = unpackr.unpackMultiple(chunk);\n    } catch (err) {\n      if (err.incomplete) {\n        incomplete = chunk.slice(err.lastPosition);\n        yields = err.values;\n      } else {\n        throw err;\n      }\n    }\n    return yields;\n  };\n\n  if (typeof bufferIterator[Symbol.iterator] === 'function') {\n    return (function * iter () {\n      for (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {\n    return (async function * iter () {\n      for await (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  }\n}\nexport const decodeIter = unpackIter;\nexport const encodeIter = packIter;","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\n"],"names":["position","bundledStrings","addExtension","unpackAddExtension"],"mappings":";;;;;;CAAA,IAAI,OAAO,CAAC;CACZ,IAAI;CACJ,CAAC,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;CAC7B,CAAC,CAAC,MAAM,KAAK,EAAE,EAAE;CACjB,IAAI,GAAG,CAAC;CACR,IAAI,MAAM,CAAC;CACX,IAAIA,UAAQ,GAAG,CAAC,CAAC;CAKjB,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,iBAAiB,CAAC;CACtB,IAAI,SAAS,CAAC;CACd,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,YAAY,GAAG,CAAC,CAAC;CACrB,IAAIC,gBAAc,CAAC;CACnB,IAAI,YAAY,CAAC;CACjB,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI,QAAQ,CAAC;CACb,IAAI,cAAc,GAAG;CACrB,CAAC,UAAU,EAAE,KAAK;CAClB,CAAC,aAAa,EAAE,IAAI;CACpB,CAAC,CAAC;CACK,MAAM,MAAM,CAAC,EAAE;AACV,OAAC,EAAE,GAAG,IAAI,MAAM,GAAG;CAC/B,EAAE,CAAC,IAAI,GAAG,kBAAkB,CAAC;CAC7B,IAAI,cAAc,GAAG,KAAK,CAAC;CAC3B,IAAI,yBAAyB,GAAG,CAAC,CAAC;AAElC;CACO,MAAM,OAAO,CAAC;CACrB,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,IAAI,OAAO,EAAE;CACf,GAAG,IAAI,OAAO,CAAC,UAAU,KAAK,KAAK,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;CAC1E,IAAI,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;CACjC,GAAG,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE;CACxD,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK,EAAE;CAC5D,KAAK,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;CAC7B,KAAK,IAAI,CAAC,OAAO,CAAC,mBAAmB;CACrC,MAAM,OAAO,CAAC,mBAAmB,GAAG,CAAC,CAAC;CACtC,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,UAAU;CACzB,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;CAChE,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE;CACnC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,CAAC;CACnD,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,aAAa,EAAE;CAC9B,IAAI,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,GAAG;CACH,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CAC/B,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,IAAI,GAAG,EAAE;CACX;CACA,GAAG,OAAO,SAAS,CAAC,MAAM;CAC1B,IAAI,WAAW,EAAE,CAAC;CAClB,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAChH,IAAI,CAAC,CAAC;CACN,GAAG;CACH,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;CAC1D,GAAG,MAAM,GAAG,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;CACzF,EAAE,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;CACnC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC;CACzC,GAAGD,UAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;CACjC,GAAG,MAAM;CACT,GAAGA,UAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;CACnD,GAAG;CAEH,EAAE,YAAY,GAAG,CAAC,CAAC;CACnB,EAAE,SAAS,GAAG,IAAI,CAAC;CAEnB,EAAEC,gBAAc,GAAG,IAAI,CAAC;CACxB,EAAE,GAAG,GAAG,MAAM,CAAC;CACf;CACA;CACA;CACA,EAAE,IAAI;CACN,GAAG,QAAQ,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CACvH,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB;CACA,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,MAAM,YAAY,UAAU;CACnC,IAAI,MAAM,KAAK,CAAC;CAChB,GAAG,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC;CAC3J,GAAG;CACH,EAAE,IAAI,IAAI,YAAY,OAAO,EAAE;CAC/B,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC;CACxC,IAAI,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAChC,IAAI,MAAM,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;CAClE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,cAAc,GAAG,cAAc,CAAC;CACnC,GAAG,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACzD,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;CACjC,EAAE,IAAI,MAAM,EAAE,YAAY,GAAG,CAAC,CAAC;CAC/B,EAAE,IAAI;CACN,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;CACtF,GAAG,IAAI,OAAO,EAAE;CAChB,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,YAAY,EAAED,UAAQ,CAAC,KAAK,KAAK,EAAE,OAAO;CACjE,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,YAAY,EAAEA,UAAQ,CAAC,KAAK,KAAK,EAAE;CACnE,MAAM,OAAO;CACb,MAAM;CACN,KAAK;CACL,IAAI;CACJ,QAAQ;CACR,IAAI,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC;CACvB,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CAChC,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB,GAAG,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC;CACrC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CACzB,GAAG,MAAM,KAAK,CAAC;CACf,GAAG,SAAS;CACZ,GAAG,cAAc,GAAG,KAAK,CAAC;CAC1B,GAAG,WAAW,EAAE,CAAC;CACjB,GAAG;CACH,EAAE;CACF,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE;CACxD,EAAE,IAAI,IAAI,CAAC,mBAAmB;CAC9B,GAAG,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;CACjE,EAAE,gBAAgB,GAAG,gBAAgB,IAAI,EAAE,CAAC;CAC5C,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;CACvC,GAAG,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC3D,GAAG,IAAI,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvC,GAAG,IAAI,SAAS,EAAE;CAClB,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,IAAI,IAAI,CAAC,IAAI,EAAE;CACf,KAAK,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG;CACH,EAAE,gBAAgB,CAAC,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC;CAC1D,EAAE,KAAK,IAAI,EAAE,IAAI,kBAAkB,IAAI,EAAE,EAAE;CAC3C,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE;CAChB,IAAI,IAAI,SAAS,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CACzC,IAAI,IAAI,QAAQ,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;CAC1C,IAAI,IAAI,QAAQ,EAAE;CAClB,KAAK,IAAI,SAAS;CAClB,MAAM,CAAC,gBAAgB,CAAC,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC;CACxG,KAAK,gBAAgB,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;CACrC,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,OAAO,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;CAC5C,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC,EAAE;CACF,CAAC;CAIM,SAAS,WAAW,CAAC,OAAO,EAAE;CACrC,CAAC,IAAI;CACL,EAAE,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE;CAClD,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,YAAY,IAAI,CAAC,CAAC;CAC1D,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,MAAM;CAC9C,IAAI,iBAAiB,CAAC,MAAM,GAAG,YAAY,CAAC;CAC5C,GAAG;CACH,EAAE,IAAI,MAAM,CAAC;CACb,EAAE,IAAI,cAAc,CAAC,WAAW,IAAI,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,CAACA,UAAQ,CAAC,IAAI,IAAI,EAAE;CACnF,GAAG,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAEA,UAAQ,EAAE,MAAM,CAAC,CAAC;CAC9D,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM;CAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;CAC7B,GAAGA,UAAQ,GAAG,MAAM,CAAC;CACrB,GAAG;CACH,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;CACnB,EAAE,IAAIC,gBAAc,EAAE;CACtB,GAAGD,UAAQ,GAAGC,gBAAc,CAAC,kBAAkB,CAAC;CAChD,GAAGA,gBAAc,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,cAAc;CACpB;CACA;CACA,GAAG,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC9C;CACA,EAAE,IAAID,UAAQ,IAAI,MAAM,EAAE;CAC1B;CACA,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC/D,IAAI,iBAAiB,EAAE,CAAC;CACxB,GAAG,iBAAiB,GAAG,IAAI,CAAC;CAC5B,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,YAAY;CACnB,IAAI,YAAY,GAAG,IAAI,CAAC;CACxB,GAAG,MAAM,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChC;CACA,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE;CAC9B,GAAG,IAAI,QAAQ,CAAC;CAChB,GAAG,IAAI;CACP,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;CACnH,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,QAAQ,GAAG,2BAA2B,GAAG,KAAK,GAAG,GAAG,CAAC;CACzD,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG;CACH;CACA,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,CAAC,MAAM,KAAK,EAAE;CAChB,EAAE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC9D,GAAG,iBAAiB,EAAE,CAAC;CACvB,EAAE,WAAW,EAAE,CAAC;CAChB,EAAE,IAAI,KAAK,YAAY,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChH,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC3B,GAAG;CACH,EAAE,MAAM,KAAK,CAAC;CACd,EAAE;CACF,CAAC;AACD;CACA,SAAS,iBAAiB,GAAG;CAC7B,CAAC,KAAK,IAAI,EAAE,IAAI,iBAAiB,CAAC,iBAAiB,EAAE;CACrD,EAAE,iBAAiB,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAClE,EAAE;CACF,CAAC,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC5C,CAAC;AACD;CACO,SAAS,IAAI,GAAG;CACvB,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE;CACpB,GAAG,IAAI,KAAK,GAAG,IAAI;CACnB,IAAI,OAAO,KAAK,CAAC;CACjB,QAAQ;CACR,IAAI,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC;CACnD,KAAK,cAAc,CAAC,aAAa,IAAI,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CACpE,IAAI,IAAI,SAAS,EAAE;CACnB,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;CAC1B,MAAM,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;CACtE,MAAM;CACN,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC7B,KAAK;CACL,KAAK,OAAO,KAAK,CAAC;CAClB,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC3B;CACA,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,cAAc,CAAC,aAAa,EAAE;CACrC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC;CACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACzB,KAAK,IAAI,GAAG,KAAK,WAAW;CAC5B,MAAM,GAAG,GAAG,UAAU,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CAC1B,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC7B,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACnC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACtB,IAAI;CACJ,GAAG,IAAI,cAAc,CAAC,UAAU;CAChC,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,OAAO,KAAK,CAAC;CAChB,GAAG;CACH,EAAE,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC1B;CACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CAC5B,EAAE,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAChC,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,GAAG;CACH,EAAE,IAAI,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;CACzC;CACA,GAAG,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC/E,GAAG,IAAI,MAAM,IAAI,IAAI;CACrB,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG;CACH,EAAE,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CACjC,EAAE,MAAM;CACR,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,QAAQ,KAAK;CACf,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,IAAIC,gBAAc,EAAE;CACxB,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;CACpB,KAAK,IAAI,KAAK,GAAG,CAAC;CAClB,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG;CACA,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG,KAAK;CACL,IAAI,OAAO,EAAE,CAAC;CACd,GAAG,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC;CAC3B,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACD,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,KAAK,SAAS;CAC3B,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CACjD,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACpC,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAI,IAAI,cAAc,CAAC,UAAU,GAAG,CAAC,EAAE;CACvC;CACA,KAAK,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACvF,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAChF,KAAK;CACL,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACxD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACxD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC3D,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,QAAQ,CAAC,OAAO,CAACA,UAAQ,EAAE,CAAC,CAAC;CACxC,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACvD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACvD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC1F,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;CACrD,KAAK,MAAM;CACX,KAAK,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;CAC9C,KAAK,IAAI,SAAS,EAAE;CACpB,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE;CAC1B,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACrC,OAAO,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;CACrC,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,EAAE,CAAC;CAC1B,OAAO;CACP,OAAO,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,EAAEA,UAAQ,CAAC,CAAC,CAAC;CAC5D,MAAM;CACN,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC;CACpD,KAAK;CACL,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAKA,UAAQ,EAAE,CAAC;CAChB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG;CACH,IAAI,IAAI,KAAK,IAAI,IAAI;CACrB,KAAK,OAAO,KAAK,GAAG,KAAK,CAAC;CAC1B,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;CAC7B,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACjE,KAAK,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC7B,KAAK,MAAM,KAAK,CAAC;CACjB,KAAK;CACL,IAAI,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,CAAC;AAC1D;CACA,GAAG;CACH,EAAE;CACF,CAAC;CACD,MAAM,SAAS,GAAG,2BAA2B,CAAC;CAC9C,SAAS,qBAAqB,CAAC,SAAS,EAAE,OAAO,EAAE;CACnD,CAAC,SAAS,UAAU,GAAG;CACvB;CACA,EAAE,IAAI,UAAU,CAAC,KAAK,EAAE,GAAG,yBAAyB,EAAE;CACtD,GAAG,IAAI,mBAAmB,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,mBAAmB,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,GAAG,EAAE,2BAA2B,IAAI,cAAc,CAAC,UAAU,GAAG,eAAe,GAAG,EAAE,CAAC;CAC9I,KAAK,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,WAAW,GAAG,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;CAC9K,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB;CACA,IAAI,yBAAyB,GAAG,QAAQ,CAAC;CACzC,IAAI,OAAO,UAAU,EAAE,CAAC;CACxB,IAAI;CACJ,GAAG,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC;CAC/B,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACrE,GAAG,OAAO,mBAAmB,EAAE,CAAC;CAChC,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACpD,GAAG,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;CAC1B,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,IAAI,cAAc,CAAC,UAAU;CAC/B,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAChC,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE;CACF,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;CACtB,CAAC,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC,EAAE;CAC/B,EAAE,OAAO,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;CACrD,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,MAAM,sBAAsB,GAAG,CAAC,OAAO,EAAE,KAAK,KAAK;CACnD,CAAC,OAAO,WAAW;CACnB,EAAE,IAAI,QAAQ,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CACjC,EAAE,IAAI,QAAQ,KAAK,CAAC;CACpB,GAAG,OAAO,KAAK,EAAE,CAAC;CAClB,EAAE,IAAI,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC;CACnF,EAAE,IAAI,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;CAChE,EAAE,IAAI,CAAC,SAAS,EAAE;CAClB,GAAG,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;CACzD,GAAG;CACH,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;CACrB,GAAG,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;CAC9D,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC1B,EAAE,CAAC;CACH,CAAC,CAAC;AACF;CACO,SAAS,cAAc,GAAG;CACjC,CAAC,IAAI,gBAAgB,GAAG,SAAS,CAAC,MAAM;CACxC;CACA,EAAE,GAAG,GAAG,IAAI,CAAC;CACb,EAAE,OAAO,cAAc,CAAC,aAAa,EAAE,CAAC;CACxC,EAAE,CAAC,CAAC;CACJ,CAAC,OAAO,iBAAiB,GAAG,cAAc,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;CACjG,CAAC;AACD;CACA,IAAI,eAAe,GAAG,YAAY,CAAC;CACnC,IAAI,WAAW,GAAG,YAAY,CAAC;CAC/B,IAAI,YAAY,GAAG,YAAY,CAAC;CAChC,IAAI,YAAY,GAAG,YAAY,CAAC;AACtB,KAAC,2BAA2B,GAAG,MAAM;CAyC/C,SAAS,YAAY,CAAC,MAAM,EAAE;CAC9B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE;CAClB,EAAE,IAAI,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;CACtC,GAAG,OAAO,MAAM,CAAC;CACjB,EAAE;CACF,CAAC,IAAI,MAAM,GAAG,EAAE,IAAI,OAAO;CAC3B,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC,CAAC;CACpE,CAAC,MAAM,GAAG,GAAGA,UAAQ,GAAG,MAAM,CAAC;CAC/B,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;CAClB,CAAC,MAAM,GAAG,EAAE,CAAC;CACb,CAAC,OAAOA,UAAQ,GAAG,GAAG,EAAE;CACxB,EAAE,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAChC,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE;CAC5B;CACA,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrB,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;CACnD;CACA,GAAG,IAAI,SAAS,GAAG,IAAI,EAAE;CACzB,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;CACnE;CACA;CACA,GAAG,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;CAC1E,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;CACnF;CACA;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,QAAQ,EAAE;CAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,EAAE;CAC7B,IAAI,IAAI,IAAI,OAAO,CAAC;CACpB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC;CACjD,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;CACnC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtB,GAAG;AACH;CACA,EAAE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE;CAC9B,GAAG,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC/C,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;CACpB,GAAG;CACH,EAAE;AACF;CACA,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;CACvB,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC9C,EAAE;AACF;CACA,CAAC,OAAO,MAAM,CAAC;CACf,CAAC;AAWD;CACA,SAAS,SAAS,CAAC,MAAM,EAAE;CAC3B,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACpB,EAAE;CACF,CAAC,IAAI,cAAc,CAAC,UAAU;CAC9B,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;AACD;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,cAAc,CAAC,aAAa,EAAE;CACnC,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACvB,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,MAAM;CACR,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,GAAG,CAAC;CACb,EAAE;CACF,CAAC;AACD;CACA,IAAI,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;CACvC,SAAS,cAAc,CAAC,MAAM,EAAE;CAChC,CAAC,IAAI,KAAK,GAAGA,UAAQ,CAAC;CACtB,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,MAAM,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC/B,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,IAAIA,UAAQ,GAAG,KAAK,CAAC;CACrB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;CACnB,GAAG;CACH,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,CAAC;CACD,SAAS,eAAe,CAAC,MAAM,EAAE;CACjC,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;CACjB,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,EAAE,CAAC;CACd,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAChC,GAAG;CACH,EAAE,MAAM;CACR,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC5E,GAAGA,UAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,OAAO;CACV,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpC,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,IAAI;CACJ,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;CACzB,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC1C,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC7E,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,EAAE,EAAE;CACpB,IAAI,IAAI,MAAM,KAAK,CAAC;CACpB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjD,SAAS;CACT,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpD,KAAK;CACL,IAAI,MAAM,IAAI,MAAM,GAAG,EAAE,EAAE;CAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1C,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE;CACnB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvD,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzD,IAAI,MAAM;CACV,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC9E,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE;CACrB,KAAK,IAAI,MAAM,KAAK,EAAE;CACtB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9D,UAAU;CACV,MAAM,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1B,OAAOA,UAAQ,IAAI,EAAE,CAAC;CACtB,OAAO,OAAO;CACd,OAAO;CACP,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjE,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC3C,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,IAAI,MAAM,GAAG,EAAE;CACpB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpE,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE;CACF,CAAC;AACD;CACA,SAAS,gBAAgB,GAAG;CAC5B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CACxB,EAAE,MAAM;CACR,EAAE,OAAO,KAAK;CACd,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG;CACH,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;CACvC,GAAG;CACH,EAAE;CACF,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CAC7B,CAAC;AACD;AACA;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,OAAO,cAAc,CAAC,WAAW;CAClC;CACA,EAAE,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAEA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC;CACpE,EAAE,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC;CAC7C,CAAC;CACD,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE;CAC9B,EAAE,IAAI,GAAG,CAAC;CACV,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,GAAG,IAAIA,UAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK;CACvG,GAAGA,UAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,OAAO,IAAI,EAAE,CAAC;CAClB,IAAI,SAAS;CACb,IAAIA,UAAQ,GAAG,GAAG,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE;CACF;CACA,EAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,IAAI,CAAC,CAAC;CACpD,CAAC;AACD;CACA,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;CAC/B,SAAS,OAAO,GAAG;CACnB,CAAC,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACtC;CACA,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACzB,EAAE,IAAI,YAAY,IAAIA,UAAQ;CAC9B,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,OAAO,IAAI,EAAE,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC;CAC/C,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CAClC,EAAE,MAAM;CACR,EAAEA,UAAQ,EAAE,CAAC;CACb,EAAE,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,CAACA,UAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAClH,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;CAC3B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAC9B,CAAC,IAAI,GAAG,GAAGA,UAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;CACjC,CAAC,IAAI,KAAK,CAAC;CACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACX,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,EAAE;CACrC,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC7C,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG,aAAa,IAAI,CAAC,CAAC;CACtB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAChC,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG;CACH,EAAE,IAAI,aAAa,KAAK,GAAG,EAAE;CAC7B,GAAGA,UAAQ,GAAG,aAAa,CAAC;CAC5B,GAAG,OAAO,KAAK,CAAC,MAAM,CAAC;CACvB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,aAAa,GAAGA,UAAQ,CAAC;CAC3B,EAAE;CACF,CAAC,KAAK,GAAG,EAAE,CAAC;CACZ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;CACvB,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;CACtB,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC5C,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE,aAAa,IAAI,CAAC,CAAC;CACrB,EAAE;CACF,CAAC,GAAG,IAAI,CAAC,CAAC;CACV,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAC/B,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE;CACF;CACA,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC7E,CAAC,IAAI,MAAM,IAAI,IAAI;CACnB,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CAC/B,CAAC,OAAO,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;CAC/C,CAAC;AACD;CACA,SAAS,YAAY,CAAC,QAAQ,EAAE;CAChC;CACA,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC;CACnD,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,SAAS,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAC;CAC/H,CAAC,IAAI,QAAQ,IAAI,IAAI,EAAE,OAAO,QAAQ,GAAG,EAAE,CAAC;CAC5C,CAAC,IAAI,cAAc,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE;CACvK,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;CACpC,EAAE;CACF,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,kCAAkC,EAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC;CACD;CACA,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK;CAC3C,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CAC1C;CACA,CAAC,IAAI,SAAS,GAAG,EAAE,CAAC;CACpB,CAAC,IAAI,QAAQ,KAAK,SAAS,EAAE;CAC7B,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CAClE,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;CAChC,EAAE;CACF,CAAC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAC/C;CACA;CACA;CACA,CAAC,IAAI,iBAAiB,KAAK,iBAAiB,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE;CAC1E,EAAE,CAAC,iBAAiB,CAAC,iBAAiB,KAAK,iBAAiB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAC;CAC9G,EAAE;CACF,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;CACnC,CAAC,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;CAC9D,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CACzB,CAAC,CAAC;CACF,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;CAChC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;AACrC;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;CAClC,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;CAC7C,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC/D,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACtC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;CACrB,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1B,EAAE;CACF,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;CACrC,EAAE,IAAI,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACzE,EAAE,IAAI,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,MAAM,IAAI,EAAE,EAAE;CACrB,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;CACvC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;CAC7C,KAAK,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CACxB,KAAK,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CACjC,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ;CACA,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;CAC3C,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACnC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;CACvD,GAAG,CAAC;CACJ,EAAE,IAAI,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACpG,EAAE;CACF,CAAC,OAAO,IAAI,CAAC;CACb,CAAC,CAAC;AACF;CACA,IAAI,MAAM,GAAG;CACb,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,cAAc,KAAK,UAAU,GAAG,cAAc,GAAG,IAAI;CAC7J,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;CACvB,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACjD,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,EAAE,OAAO,KAAK,CAAC;CACf,EAAE;CACF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACrD,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,CAAC,YAAY;CAClB,EAAE,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;CAC3B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC3B,CAAC,IAAI,MAAM,CAAC;CACZ;CACA,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACpE,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACzE,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,KAAK,IAAI;CAC1G,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB;CACA,EAAE,MAAM,GAAG,EAAE,CAAC;AACd;CACA,CAAC,IAAI,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;CAChC,CAAC,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;CAC/B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;CACrB;CACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CAC5C,EAAE,MAAM;CACR;CACA,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CAC1C,EAAE;AACF;CACA;CACA,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAClE,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC5D,CAAC,OAAO,MAAM,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CACrC,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;CACtB,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC;CACxB,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AAChD;CACO,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC;AACpK;CACA,IAAI,IAAI,GAAG,OAAO,UAAU,KAAK,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAC;CAChE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACxB;CACA,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D;CACA,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,CAAC,IAAI,CAAC,cAAc,EAAE;CACtB,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC;CACrC,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;CACnD,EAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,QAAQ,CAAC,CAAC;CACrE,EAAE;CACF,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;CACzC,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;CACF,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CAC7E,CAAC,IAAI,YAAY,GAAGA,UAAQ,CAAC;CAC7B,CAACA,UAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;CACpC,CAACC,gBAAc,GAAG,WAAW,CAAC;CAC9B,CAACA,gBAAc,GAAG,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;CAC3D,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,kBAAkB,GAAGD,UAAQ,CAAC;CAC9C,CAACA,UAAQ,GAAG,YAAY,CAAC;CACzB,CAAC,OAAO,IAAI,EAAE,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CACrB,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC7F,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CAC1B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO;CAClF,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9G,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;CAC3B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO;CAC3E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9K;CACA,EAAE,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;CAC7B,CAAC,CAAC;CACF;CACA;AACA;CACA,SAAS,SAAS,CAAC,QAAQ,EAAE;CAC7B,CAAC,IAAI,cAAc,IAAI,cAAc,CAAC,YAAY;CAClD,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC;CAChC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC;CAC1B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAE9B,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,cAAc,GAAG,SAAS,CAAC;CAEhC,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,mBAAmB,GAAGC,gBAAc,CAAC;AAC1C;CACA;CACA,CAAC,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACrD,CAAC,IAAI,eAAe,GAAG,iBAAiB,CAAC;CACzC,CAAC,IAAI,uBAAuB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;CACpF,CAAC,IAAI,UAAU,GAAG,cAAc,CAAC;CACjC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;CACxB,CAAC,MAAM,GAAG,WAAW,CAAC;CACtB,CAACD,UAAQ,GAAG,aAAa,CAAC;CAE1B,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAAC,SAAS,GAAG,cAAc,CAAC;CAE5B,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAACC,gBAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,GAAG,GAAG,QAAQ,CAAC;CAChB,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,iBAAiB,GAAG,eAAe,CAAC;CACrC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,EAAE,GAAG,uBAAuB,CAAC,CAAC;CACnF,CAAC,cAAc,GAAG,UAAU,CAAC;CAC7B,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;CACrE,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;CACM,SAAS,WAAW,GAAG;CAC9B,CAAC,GAAG,GAAG,IAAI,CAAC;CACZ,CAAC,YAAY,GAAG,IAAI,CAAC;CACrB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC1B,CAAC;AACD;CACO,SAASC,cAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,MAAM;CACrB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;CACvD;CACA,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;CAChD,CAAC;AACD;CACO,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;CACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CAC9B,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;CACvD,CAAC;AACW,OAAC,OAAO,GAAG,QAAQ;CAC/B,IAAI,cAAc,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC5C,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,cAAc,GAAG,cAAc,CAAC,eAAe;AAChD,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,eAAe,GAAG;CAC/B,CAAC,KAAK,EAAE,CAAC;CACT,CAAC,MAAM,EAAE,CAAC;CACV,CAAC,aAAa,EAAE,CAAC;CACjB,CAAC,WAAW,EAAE,CAAC;CACf,EAAE;CACF,IAAI,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;CACnC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7C,SAAS,YAAY,CAAC,aAAa,EAAE;CAC5C,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;CAC7B,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC,OAAO,CAAC,CAAC,UAAU,GAAG,aAAa,IAAI,aAAa,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAC5F,CAAC;CACD;CACA;CACA;CACA,OAAO,CAAC,qBAAqB,GAAG,IAAI;;CCptCpC,IAAI,WAAW,CAAC;CAChB,IAAI;CACJ,CAAC,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;CACjC,CAAC,CAAC,OAAO,KAAK,EAAE,EAAE;CAClB,IAAI,UAAU,EAAE,gBAAgB,CAAC;CACjC,MAAM,aAAa,GAAG,OAAO,MAAM,KAAK,WAAW,CAAC;CACpD,MAAM,iBAAiB,GAAG,aAAa;CACvC,CAAC,SAAS,MAAM,EAAE,EAAE,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;CAC1E,MAAM,SAAS,GAAG,aAAa,GAAG,MAAM,GAAG,UAAU,CAAC;CACtD,MAAM,eAAe,GAAG,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;CACjE,IAAI,MAAM,EAAE,UAAU,CAAC;CACvB,IAAI,UAAU,CAAC;CACf,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI,OAAO,CAAC;CACZ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,MAAM,eAAe,GAAG,MAAM,CAAC;CAC/B,MAAM,WAAW,GAAG,iBAAiB,CAAC;CAC/B,MAAM,aAAa,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;CAC1C,MAAM,KAAK,SAAS,OAAO,CAAC;CACnC,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;CACjB,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;CAElB,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,IAAI,eAAe,CAAC;CACtB,EAAE,IAAI,UAAU,CAAC;CACjB,EAAE,IAAI,YAAY,CAAC;CACnB,EAAE,IAAI,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9E,GAAG,OAAO,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG,GAAG,CAAC,WAAW,IAAI,WAAW,CAAC,UAAU;CAC5C,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9B,IAAI,OAAO,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;CAC7E,IAAI,GAAG,KAAK,CAAC;AACb;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,CAAC;CACnB,EAAE,IAAI,CAAC,OAAO;CACd,GAAG,OAAO,GAAG,EAAE,CAAC;CAChB,EAAE,IAAI,YAAY,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC;CACnD,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,cAAc,CAAC;CACzE,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC;CACxD,EAAE,IAAI,mBAAmB,IAAI,IAAI;CACjC,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,EAAE,GAAG,CAAC,CAAC;CACtD,EAAE,IAAI,mBAAmB,GAAG,IAAI;CAChC,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,EAAE,IAAI,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,EAAE;CACjE,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;CAClD,EAAE,IAAI,gBAAgB,IAAI,IAAI;CAC9B,GAAG,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,GAAG,EAAE,CAAC;CACpD,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK;CACrD,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB;CACA,EAAE,IAAI,iBAAiB,GAAG,mBAAmB,GAAG,EAAE,KAAK,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,CAAC,CAAC;CACpG,EAAE,IAAI,aAAa,GAAG,mBAAmB,GAAG,IAAI,CAAC;CACjD,EAAE,IAAI,cAAc,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,IAAI,CAAC;CACrE,EAAE,IAAI,cAAc,GAAG,IAAI,EAAE;CAC7B,GAAG,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;CAC3E,GAAG;CACH,EAAE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC7B,EAAE,IAAI,gBAAgB,GAAG,CAAC,CAAC;CAC3B,EAAE,IAAI,oCAAoC,GAAG,CAAC,CAAC;AAC/C;CACA,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,KAAK,EAAE,aAAa,EAAE;CAC3D,GAAG,IAAI,CAAC,MAAM,EAAE;CAChB,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACzC,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAC7F,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,IAAI,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE;CACnC;CACA,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAClD,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;CACtG,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,IAAI,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC;CAC3C,GAAG,KAAK,GAAG,QAAQ,CAAC;CACpB,GAAG,IAAI,aAAa,GAAG,mBAAmB,EAAE,QAAQ,KAAK,aAAa,GAAG,IAAI,CAAC,CAAC;CAC/E,GAAG,YAAY,GAAG,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;CAC3D,GAAG,IAAI,KAAK,CAAC,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CACzD,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,GAAG,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;CACjC,GAAG,IAAI,UAAU,EAAE;CACnB,IAAI,IAAI,UAAU,CAAC,aAAa;CAChC,KAAK,UAAU,GAAG,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;CAChE,IAAI,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACpD,IAAI,IAAI,YAAY,GAAG,mBAAmB,EAAE;CAC5C;CACA,KAAK,MAAM,IAAI,KAAK,CAAC,oGAAoG,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;CACrJ,KAAK;CACL,IAAI,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE;CACjC;CACA,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAClD,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;CAC5C,MAAM,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,CAAC,IAAI;CACf,OAAO,SAAS;CAChB,MAAM,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC9D,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;CAC3C,MAAM;CACN,KAAK,IAAI,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACnD,KAAK;CACL,IAAI,IAAI,CAAC,YAAY,EAAE;CACvB,KAAK,UAAU,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,CAAC;CAC7C,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,eAAe;CACtB,IAAI,eAAe,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,aAAa,CAAC;CACrB,GAAG,IAAI;CACP,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CAClE,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1D,UAAU,IAAI,KAAK,CAAC,WAAW,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,YAAY,QAAQ,CAAC,EAAE;CACnI;CACA,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;CACzD,MAAM,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;CACxB,KAAK;CACL,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;CACjB,IAAI,IAAI,UAAU,GAAG,cAAc,CAAC;CACpC,IAAI,IAAI,cAAc;CACtB,KAAK,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CAClC,IAAI,IAAI,YAAY,IAAI,YAAY,CAAC,WAAW,EAAE;CAClD,KAAK,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7F,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;CAChC,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAChC,KAAK,OAAO,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;CACjC,MAAM,IAAI,cAAc,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;CAC3D,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,eAAe,GAAG,KAAK,CAAC,IAAI,iBAAiB,KAAK,CAAC,CAAC;CAC3F,OAAO,iBAAiB,GAAG,CAAC,CAAC;CAC7B,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,EAAE;CAC1D,OAAO,IAAI,iBAAiB,IAAI,CAAC;CACjC,QAAQ,iBAAiB,IAAI,CAAC,CAAC;CAC/B,OAAO,MAAM;CACb,OAAO,IAAI,iBAAiB,IAAI,CAAC,EAAE;CACnC;CACA,QAAQ,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACxD,SAAS,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAChF,QAAQ,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAC/B,QAAQ;CACR,OAAO,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC;CACxC,OAAO,CAAC,EAAE,CAAC;CACX,OAAO;CACP,MAAM;CACN,KAAK,IAAI,iBAAiB,IAAI,CAAC,IAAI,UAAU,EAAE;CAC/C;CACA,MAAM,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACtD,OAAO,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAC9E,MAAM;CACN,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CACxC,KAAK,IAAI,QAAQ,GAAG,OAAO;CAC3B,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;CACzB,KAAK,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC7B,KAAK,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;CAC/E,KAAK,YAAY,GAAG,IAAI,CAAC;CACzB,KAAK,OAAO,UAAU,CAAC;CACvB,KAAK;CACL,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC5B,IAAI,IAAI,aAAa,GAAG,iBAAiB,EAAE;CAC3C,KAAK,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;CAC1B,KAAK,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC;CAC3B,KAAK,OAAO,MAAM,CAAC;CACnB,KAAK;CACL,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC5C,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,aAAa,GAAG,KAAK,CAAC;CAC1B,IAAI,MAAM,KAAK,CAAC;CAChB,IAAI,SAAS;CACb,IAAI,IAAI,UAAU,EAAE;CACpB,KAAK,eAAe,EAAE,CAAC;CACvB,KAAK,IAAI,eAAe,IAAI,KAAK,CAAC,cAAc,EAAE;CAClD,MAAM,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACtD;CACA,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC1D,MAAM,IAAI,aAAa,GAAG,CAAC,KAAK,CAAC,kBAAkB,IAAI,iBAAiB,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;CAC7F,MAAM,IAAI,CAAC,aAAa,EAAE;CAC1B,OAAO,IAAI,KAAK,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,CAAC,YAAY,CAAC,KAAK,KAAK,EAAE;CACtF;CACA,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;CAChD,QAAQ;CACR,OAAO,KAAK,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACtD;CACA,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACrD,OAAO,OAAO,YAAY,CAAC;CAC3B,OAAO;CACP,MAAM;CACN,KAAK;CACL;CACA,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAClD,IAAI,IAAI,aAAa,GAAG,iBAAiB;CACzC,KAAK,QAAQ,GAAG,KAAK,CAAC;CACtB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,MAAM;CAChC,GAAG,IAAI,oCAAoC,GAAG,EAAE;CAChD,IAAI,oCAAoC,EAAE,CAAC;CAC3C,GAAG,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACnD,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,IAAI,CAAC,YAAY;CACxD,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,CAAC;CACrC,GAAG,IAAI,gBAAgB,GAAG,KAAK,EAAE;CACjC;CACA,IAAI,UAAU,CAAC,WAAW,GAAG,IAAI,CAAC;CAClC,IAAI,oCAAoC,GAAG,CAAC,CAAC;CAC7C,IAAI,gBAAgB,GAAG,CAAC,CAAC;CACzB,IAAI,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACpC,KAAK,iBAAiB,GAAG,EAAE,CAAC;CAC5B,IAAI,MAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE;CAC7D,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC9D,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAC7C,KAAK;CACL,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,KAAK,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;CAC7B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACpC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;CAC1B,GAAG,IAAI,QAAQ,GAAG,OAAO;CACzB,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAChC;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;CAC3B,GAAG,IAAI,MAAM,CAAC;CACd,GAAG,IAAI,IAAI,KAAK,QAAQ,EAAE;CAC1B,IAAI,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;CACjC,IAAI,IAAI,cAAc,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,MAAM,EAAE;CAChE,KAAK,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,SAAS,IAAI,eAAe,EAAE;CAC/D,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,QAAQ,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;CAC5G,MAAM,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACvC,OAAO,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;CAC9C,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;CACnC,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC/B,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CACpC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC,CAAC;CAC/E,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO;CACP,MAAM,cAAc,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;CAChC,MAAM,cAAc,CAAC,QAAQ,GAAG,UAAU,CAAC;CAC3C,MAAM,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;CAC9B,MAAM,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;CACzC,MAAM;CACN,KAAK,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC3C,KAAK,cAAc,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,IAAI,CAAC,OAAO,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;CAC5C,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,UAAU,CAAC;CACnB;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,EAAE;CAC1B,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,KAAK,EAAE;CAClC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE;CACpC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM;CACX,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK;CACL,IAAI,IAAI,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACrC,KAAK,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC5C;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACzC,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CACxD,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;CACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,EAAE,GAAG,IAAI,EAAE;CACrB,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,CAAC;CAClC,OAAO,MAAM,IAAI,EAAE,GAAG,KAAK,EAAE;CAC7B,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;CAC9C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,CAAC,EAAE,GAAG,MAAM,MAAM,MAAM;CAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,MAAM;CAC3D,QAAQ;CACR,OAAO,EAAE,GAAG,OAAO,IAAI,CAAC,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC;CAC5D,OAAO,CAAC,EAAE,CAAC;CACX,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CACtD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO;CACP,MAAM;CACN,KAAK,MAAM,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CAClD,KAAK,MAAM;CACX,KAAK,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;CACvD,KAAK;AACL;CACA,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACxC,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,EAAE;CAC/B,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CACjC,KAAK,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACjC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACtC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACxC,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,QAAQ,IAAI,MAAM,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,KAAK,EAAE;CAC/B;CACA,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;CAC9G,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,KAAK,EAAE;CAC/B,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,OAAO,EAAE;CACjC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;CACtC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;CACxC,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,EAAE;CACrC,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CACzB,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,CAAC;CACpB,KAAK,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,GAAG,WAAW,IAAI,KAAK,IAAI,CAAC,UAAU,EAAE;CAC5F,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,UAAU,GAAG,CAAC;CACxB;CACA,QAAQ,CAAC,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;CACzH,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,QAAQ,EAAE,CAAC;CAClB,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,UAAU,EAAE;CACxD,IAAI,IAAI,CAAC,KAAK;CACd,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,IAAI,YAAY,EAAE;CACvB,MAAM,IAAI,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;CAC5C,MAAM,IAAI,OAAO,EAAE;CACnB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;CACxB,QAAQ,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,KAAK,YAAY,CAAC,WAAW,GAAG,EAAE,CAAC,CAAC;CACtF,QAAQ,OAAO,CAAC,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;CAC/C,QAAQ;CACR,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;CAClD,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;CAC7D,MAAM;CACN,KAAK,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;CACzC,KAAK,IAAI,WAAW,KAAK,MAAM,EAAE;CACjC,MAAM,WAAW,CAAC,KAAK,CAAC,CAAC;CACzB,MAAM,MAAM,IAAI,WAAW,KAAK,KAAK,EAAE;CACvC,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;CACvB,MAAM,MAAM,IAAI,WAAW,KAAK,GAAG,EAAE;CACrC,MAAM,IAAI,IAAI,CAAC,gBAAgB,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3D,WAAW;CACX,OAAO,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;CAC3B,OAAO,IAAI,MAAM,GAAG,IAAI,EAAE;CAC1B,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CAC3C,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACpC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACzC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC/C,QAAQ,QAAQ,IAAI,CAAC,CAAC;CACtB,QAAQ;CACR,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE;CAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC;CAClB,QAAQ,IAAI,CAAC,UAAU,CAAC,CAAC;CACzB,QAAQ;CACR,OAAO;CACP,MAAM,MAAM;CACZ,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACzD,OAAO,IAAI,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,OAAO,IAAI,KAAK,YAAY,cAAc,EAAE;CAC5C,QAAQ,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACtC,QAAQ,IAAI,SAAS,CAAC,KAAK,EAAE;CAC7B,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE;CAC7B,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACpC,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;CAC9C,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CACjC,UAAU;CACV,SAAS,IAAI,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;CAC7D,SAAS,IAAI,WAAW,KAAK,KAAK,EAAE;CACpC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CACpC,WAAW,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,WAAW,MAAM;CACjB,WAAW,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,WAAW;CACX,UAAU,MAAM;CAChB,UAAU,IAAI,CAAC,WAAW,CAAC,CAAC;CAC5B,UAAU;CACV,SAAS,OAAO;CAChB,SAAS;CACT,QAAQ,IAAI,aAAa,GAAG,MAAM,CAAC;CACnC,QAAQ,IAAI,iBAAiB,GAAG,UAAU,CAAC;CAC3C,QAAQ,IAAI,eAAe,GAAG,QAAQ,CAAC;CACvC,QAAQ,MAAM,GAAG,IAAI,CAAC;CACtB,QAAQ,IAAI,MAAM,CAAC;CACnB,QAAQ,IAAI;CACZ,SAAS,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,KAAK;CAC7D;CACA,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,aAAa,GAAG,IAAI,CAAC;CAC/B,UAAU,QAAQ,IAAI,IAAI,CAAC;CAC3B,UAAU,IAAI,QAAQ,GAAG,OAAO;CAChC,WAAW,QAAQ,CAAC,QAAQ,CAAC,CAAC;CAC9B,UAAU,OAAO;CACjB,WAAW,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;CACxD,WAAW,CAAC;CACZ,UAAU,EAAE,IAAI,CAAC,CAAC;CAClB,SAAS,SAAS;CAClB;CACA,SAAS,IAAI,aAAa,EAAE;CAC5B,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,UAAU,GAAG,iBAAiB,CAAC;CACzC,UAAU,QAAQ,GAAG,eAAe,CAAC;CACrC,UAAU,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACvC,UAAU;CACV,SAAS;CACT,QAAQ,IAAI,MAAM,EAAE;CACpB,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC/C,UAAU,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CAC7C,SAAS,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACjF,SAAS;CACT,QAAQ,OAAO;CACf,QAAQ;CACR,OAAO;CACP;CACA,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CAChC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CACxB,OAAO,MAAM;CACb;CACA,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;CACzB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;CACpC;CACA,QAAQ,IAAI,IAAI,KAAK,KAAK;CAC1B,SAAS,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;CAC3B,QAAQ;AACR;CACA;CACA,OAAO,IAAI,IAAI,KAAK,UAAU;CAC9B,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE;CACA;CACA,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1B,OAAO;CACP,MAAM;CACN,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE;CAClC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;CAC7C,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,GAAG,kBAAkB,IAAI,KAAK,IAAI,CAAC,kBAAkB,EAAE;CACpE;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,KAAK,MAAM,IAAI,KAAK,GAAG,mBAAmB,IAAI,KAAK,GAAG,CAAC,EAAE;CACzD;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC9C,KAAK,MAAM;CACX;CACA,KAAK,IAAI,IAAI,CAAC,kBAAkB,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;CACrD,MAAM,MAAM,IAAI,IAAI,CAAC,mBAAmB,EAAE;CAC1C,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;CACpC,MAAM,MAAM,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,SAAS,EAAE;CAC3D,MAAM,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD;CACA,MAAM,IAAI,KAAK,CAAC;CAChB,MAAM,IAAI,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE;CAC9C,OAAO,IAAI,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;CAC1D,OAAO,IAAI,MAAM,GAAG,EAAE,CAAC;CACvB,OAAO,OAAO,IAAI,EAAE;CACpB,QAAQ,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CAClC,QAAQ,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,EAAE,MAAM;CACnD,QAAQ,KAAK,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CAC7B,QAAQ;AACR;CACA,OAAO,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;CACjE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;CACvB,OAAO,MAAM;CACb,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;CAC9B,OAAO,IAAI,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;CAC3D,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;CAC9B,QAAQ,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;CAC9B,QAAQ,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;CACvD,QAAQ,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;CAC/B,QAAQ;AACR;CACA,OAAO,IAAI,aAAa,EAAE;CAC1B,QAAQ,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAClD,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;CAC/C,SAAS,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CACjE,SAAS;CACT,QAAQ;AACR;CACA,OAAO,IAAI,MAAM,EAAE;CACnB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CACpE,QAAQ;CACR,OAAO;AACP;CACA,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC3C,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CACzC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;CACnE,MAAM,OAAO;CACb,MAAM,MAAM;CACZ,MAAM,MAAM,IAAI,UAAU,CAAC,KAAK,GAAG,iEAAiE;CACpG,OAAO,+EAA+E;CACtF,OAAO,2CAA2C,CAAC,CAAC;CACpD,MAAM;CACN,KAAK;CACL,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE;CACpC,IAAI,IAAI,IAAI,CAAC,oBAAoB;CACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK;CACL,IAAI,MAAM;CACV,IAAI,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;CAC7C,IAAI;CACJ,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,gBAAgB,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,KAAK;CAChH;CACA,GAAG,IAAI,IAAI,CAAC;CACZ,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,IAAI,GAAG,EAAE,CAAC;CACd,IAAI,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC5B,KAAK,IAAI,CAAC,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC;CACnF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;CAC5C,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACrB,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CAC/B,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,IAAI,GAAG,CAAC;CACX,GAAG,IAAI,IAAI,CAAC,oBAAoB,EAAE;CAClC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;CAC3B,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;CAClC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;AACL;CACA,IAAI,MAAM;CACV,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACzB,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,IAAI,YAAY,GAAG,QAAQ,GAAG,KAAK,CAAC;CACvC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;CACf,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK,IAAI,EAAE,CAAC;CACZ,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,IAAI,GAAG,MAAM,EAAE;CACtB,IAAI,MAAM,IAAI,KAAK,CAAC,6DAA6D;CACjF,IAAI,4DAA4D,CAAC,CAAC;CAClE,IAAI;CACJ,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;CAC9C,GAAG,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CAC9C,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,KAAK,KAAK,GAAG,gBAAgB;CAClE,EAAE,CAAC,OAAO,CAAC,kBAAkB,IAAI,CAAC,iBAAiB;CACnD,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,YAAY,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC;CACzC,GAAG,IAAI,SAAS,CAAC;CACjB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACtC,KAAK,IAAI,cAAc;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC;CAClC,UAAU;CACV;CACA,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACrC,MAAM,IAAI,cAAc,GAAG,UAAU,CAAC;CACtC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC1C,MAAM,IAAI,cAAc,GAAG,CAAC,CAAC;CAC7B,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ,cAAc,EAAE,CAAC;CACzB,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,IAAI,QAAQ,EAAE;CAChD;CACA,OAAO,QAAQ,EAAE,CAAC;CAClB,OAAO,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CACnD,OAAO;CACP,OAAO,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;CACvE,MAAM,SAAS,GAAG,IAAI,CAAC;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;CACvC,MAAM;CACN,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,CAAC,SAAS,EAAE;CACnB,IAAI,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC7C,IAAI,IAAI,QAAQ;CAChB,KAAK,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,QAAQ,CAAC;CAC7C;CACA,KAAK,eAAe,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;CACvE,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,cAAc,GAAG,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CAC1G,IAAI,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACrC,IAAI,IAAI,CAAC,cAAc,EAAE;CACzB,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC5D,KAAK,cAAc,EAAE,CAAC;CACtB,KAAK;CACL,IAAI,UAAU,GAAG,cAAc,CAAC;CAChC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC5C,GAAG,IAAI,QAAQ,EAAE;CACjB,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,iBAAiB,EAAE;CAC/C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;CAC7D,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACxC,KAAK;CACL,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,IAAI,MAAM;CACV,IAAI,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC;CACtF,IAAI;CACJ;CACA,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM;CACzB,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,GAAG,CAAC;AACJ;CACA;CACA,EAAE,MAAM,eAAe,GAAG,OAAO,IAAI,CAAC,UAAU,IAAI,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;AAClF;CACA,EAAE,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,MAAM,KAAK;CACpD,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;CAC5E,GAAG,GAAG,WAAW,CAAC;AAClB;CACA,EAAE,MAAM,WAAW,GAAG,CAAC,MAAM,KAAK;CAClC,GAAG,IAAI,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,kBAAkB,KAAK;CAC3I,IAAI,IAAI,kBAAkB;CAC1B,KAAK,OAAO,eAAe,GAAG,IAAI,CAAC;CACnC,IAAI,QAAQ,GAAG,WAAW,CAAC;CAC3B,IAAI,IAAI,WAAW,GAAG,MAAM,CAAC;CAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;CAChB,IAAI,eAAe,EAAE,CAAC;CACtB,IAAI,IAAI,WAAW,KAAK,MAAM,EAAE;CAChC,KAAK,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;CAC7C,KAAK;CACL,IAAI,OAAO,QAAQ,CAAC;CACpB,IAAI,CAAC,CAAC;CACN,GAAG,IAAI,WAAW,KAAK,CAAC;CACxB,IAAI,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;CAC/B,GAAG,QAAQ,GAAG,WAAW,CAAC;CAC1B,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK;CAC5B,GAAG,IAAI,OAAO,CAAC;CACf,GAAG,IAAI,GAAG,GAAG,SAAS,EAAE;CACxB;CACA,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,eAAe;CACvC,KAAK,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;CAC/E,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe;CACtC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,GAAG,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;CACrG,IAAI;CACJ,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;CAClF,GAAG,IAAI,SAAS,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;CAClD,GAAG,UAAU,GAAG,SAAS,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;CACxG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;CACtC,GAAG,IAAI,MAAM,CAAC,IAAI;CAClB,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;CAC1C;CACA,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;CAC5C,GAAG,QAAQ,IAAI,KAAK,CAAC;CACrB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;CACnC,GAAG,OAAO,MAAM,GAAG,SAAS,CAAC;CAC7B,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,KAAK;CAC1D,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC;CACpC,GAAG,IAAI,CAAC,QAAQ;CAChB,IAAI,QAAQ,GAAG,IAAI,CAAC;CACpB,GAAG,IAAI,QAAQ,GAAG,aAAa,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE;CAClG,IAAI,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC;CACpC,IAAI,IAAI,EAAE,QAAQ,GAAG,cAAc,CAAC;CACpC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;CACxC,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,cAAc;CAClC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC;CACrC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,IAAI,iBAAiB,GAAG,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;CACtG,GAAG,UAAU,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;CACxC,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACtC;CACA,GAAG,IAAI,QAAQ,GAAG,aAAa,EAAE;CACjC,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;CACzB,IAAI,UAAU,CAAC,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC;CAC9C,IAAI,eAAe,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;AACL;CACA,IAAI,IAAI,cAAc;CACtB,KAAK,gBAAgB,IAAI,oCAAoC,GAAG,cAAc,CAAC;CAC/E;CACA,IAAI,IAAI,iBAAiB,CAAC,MAAM,IAAI,gBAAgB;CACpD,KAAK,iBAAiB,CAAC,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAClD,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;CACvC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;CACf,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,eAAe,EAAE,cAAc,KAAK;CACjF,GAAG,IAAI,UAAU,GAAG,MAAM,CAAC;CAC3B,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,IAAI,WAAW,GAAG,OAAO,CAAC;CAC7B,GAAG,IAAI,SAAS,GAAG,KAAK,CAAC;CACzB,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,IAAI,CAAC,MAAM;CACd,IAAI,UAAU,GAAG,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACtD,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CAC/C,GAAG,UAAU,GAAG,MAAM,CAAC;CACvB,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,OAAO,GAAG,WAAW,CAAC;CACzB,GAAG,KAAK,GAAG,SAAS,CAAC;CACrB,GAAG,IAAI,YAAY,GAAG,CAAC,EAAE;CACzB,IAAI,IAAI,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,CAAC,CAAC;CAC7C,IAAI,IAAI,MAAM,GAAG,OAAO;CACxB,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;CACtB,IAAI,IAAI,iBAAiB,GAAG,eAAe,GAAG,KAAK,CAAC;CACpD,IAAI,MAAM,CAAC,UAAU,CAAC,iBAAiB,GAAG,YAAY,EAAE,iBAAiB,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;CACzF,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,iBAAiB,CAAC,CAAC;CACrE,IAAI,QAAQ,GAAG,MAAM,CAAC;CACtB,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,eAAe,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACpD,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE;CACF,CAAC,SAAS,CAAC,MAAM,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,MAAM,CAAC;CAClB,EAAE,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CAC3G,EAAE,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC;CAC/B,EAAE,QAAQ,GAAG,CAAC,CAAC;CACf,EAAE;CACF,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,EAAE;CACtB,EAAE,QAAQ,GAAG,KAAK,CAAC;CACnB,EAAE;CACF,CAAC,IAAI,QAAQ,GAAG;CAChB,EAAE,OAAO,QAAQ,CAAC;CAClB,EAAE;CACF,CAAC,eAAe,GAAG;CACnB,EAAE,IAAI,IAAI,CAAC,UAAU;CACrB,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB,EAAE,IAAI,IAAI,CAAC,YAAY;CACvB,GAAG,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;CAC1B,EAAE;CACF,CAAC;AACD;CACA,gBAAgB,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,iBAAiB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACvJ,UAAU,GAAG,CAAC;CACd,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACpC,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;CACtC,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACtG;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;CAC3C,GAAG,MAAM,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACnD;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;CAC5G,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;CAC/C,GAAG,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE;CAC7B,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE;CAC3B,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACxB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;CACtC,IAAI;CACJ;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC;CAC3B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,CAAC,CAAC;CACpE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CACrE,GAAG;CACH,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACnC,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE;CAC7B,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;CACnB,GAAG;CACH,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;CACd,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACnD,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACtC,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,UAAU,EAAE,gBAAgB,EAAE;CACpC,EAAE,IAAI,WAAW,GAAG,UAAU,CAAC,WAAW,CAAC;CAC3C,EAAE,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS;CACjD,GAAG,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACvF;CACA,GAAG,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;CAC7C,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE;CAC5B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC1B,EAAE;CACF,CAAC,CAAC,CAAC;AACH;CACA,SAAS,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE;CACpE,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC;CACpC,CAAC,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,EAAE;CACzB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;CAClC,EAAE,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE;CAClC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;CACzC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC;CAC3C,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;CAC7C,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;CACjE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;CACvG,CAAC;CACD,SAAS,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE;CAC/C,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC;CAChC,CAAC,IAAI,MAAM,EAAE,QAAQ,CAAC;CACtB,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;CACrB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAC9B,EAAE,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACnC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACrC,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CACzC,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC;AACD;CACA,SAAS,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;CAC5D,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,CAAC,QAAQ,MAAM;CACf,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,EAAE;CACT,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE;CACF,GAAG,IAAI,MAAM,GAAG,KAAK,EAAE;CACvB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAChC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC;CACtC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC;CAC/C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC;CAC9C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI;CACJ,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC,QAAQ,IAAI,MAAM,CAAC;CACpB,CAAC,OAAO,QAAQ,CAAC;CACjB,CAAC;AACD;CACA,SAAS,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE;CAC5C;CACA,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CAC7C,CAAC,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC;CAClD,CAAC,OAAO,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,EAAE;CACpC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC7B,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;CACrB,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAClE,EAAE,cAAc,IAAI,CAAC,CAAC;CACtB,EAAE,IAAI,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC;CACzC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;CACpC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC;CAC7C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;CAC5C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;CACrC,EAAE,OAAO,GAAG,MAAM,CAAC;CACnB,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,SAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE;CACtD,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;CAChC,EAAE,UAAU,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,iBAAiB,GAAG,cAAc,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;CACxH,EAAE,cAAc,CAAC,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;CACpD,EAAE,IAAI,YAAY,GAAG,cAAc,CAAC;CACpC,EAAE,cAAc,GAAG,IAAI,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE;CACF,CAAC;AACD;CACO,SAAS,YAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE;CACtB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK;CACzC,GAAG,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;CAC9D,EAAE,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI;CACvC,GAAG,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;CACrF,EAAE,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5C,EAAE,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;CAChC,EAAE;CACF,CAACC,cAAkB,CAAC,SAAS,CAAC,CAAC;CAC/B,CAAC;CACD,SAAS,iBAAiB,CAAC,UAAU,EAAE,KAAK,EAAE;CAC9C,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,kBAAkB,KAAK;CACnD,EAAE,IAAI,UAAU,GAAG,CAAC,kBAAkB,KAAK,CAAC,KAAK,CAAC,yBAAyB,IAAI,CAAC,MAAM,kBAAkB,CAAC,MAAM,CAAC,CAAC;CACjH,EAAE,IAAI,CAAC,UAAU;CACjB,GAAG,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;CAC9C,EAAE,OAAO,UAAU,CAAC;CACpB,EAAE,CAAC;CACH,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA;CACA;CACA;CACA,KAAK,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACnC;CACA,IAAI,YAAY,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AACxC,OAAC,IAAI,GAAG,YAAY,CAAC,KAAK;AAC1B,OAAC,MAAM,GAAG,YAAY,CAAC,KAAK;AAC5B,OAAC,OAAO,GAAG,MAAM;AAGjB,OAAC,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,gBAAgB;AACjE,OAAC,iBAAiB,GAAG,IAAI;AACzB,OAAC,iBAAiB,GAAG,KAAK;AAC1B,OAAC,mBAAmB,GAAG;;CClnCnC;CACA;CACA;CACA;CACA;CACA;CACA;CACO,SAAS,QAAQ,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;CACxD,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;CAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,wFAAwF,CAAC,CAAC;CAC9G,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;CACpE,IAAI,OAAO,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;CACjD,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;CACtH,IAAI,OAAO,aAAa,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;CAClD,GAAG,MAAM;CACT,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;CAClH,GAAG;CACH,CAAC;AACD;CACA,WAAW,YAAY,EAAE,cAAc,EAAE,OAAO,EAAE;CAClD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;CACnC,EAAE,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;CACtC,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG;CACH,CAAC;AACD;CACA,iBAAiB,aAAa,EAAE,cAAc,EAAE,OAAO,EAAE;CACzD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;CACnC,EAAE,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;CAC5C,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG;CACH,CAAC;AACD;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACO,SAAS,UAAU,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;CAC1D,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;CAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;CAClH,GAAG;AACH;CACA,EAAE,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;CACvC,EAAE,IAAI,UAAU,CAAC;CACjB,EAAE,MAAM,MAAM,GAAG,CAAC,KAAK,KAAK;CAC5B,IAAI,IAAI,MAAM,CAAC;CACf;CACA,IAAI,IAAI,UAAU,EAAE;CACpB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;CACjD,MAAM,UAAU,GAAG,SAAS,CAAC;CAC7B,KAAK;AACL;CACA,IAAI,IAAI;CACR,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;CAC7C,KAAK,CAAC,OAAO,GAAG,EAAE;CAClB,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE;CAC1B,QAAQ,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CACnD,QAAQ,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;CAC5B,OAAO,MAAM;CACb,QAAQ,MAAM,GAAG,CAAC;CAClB,OAAO;CACP,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;CAC7D,IAAI,OAAO,CAAC,WAAW,IAAI,IAAI;CAC/B,MAAM,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;CAC1C,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,OAAO;CACP,KAAK,GAAG,CAAC;CACT,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;CACzE,IAAI,OAAO,CAAC,iBAAiB,IAAI,IAAI;CACrC,MAAM,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;CAChD,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,OAAO;CACP,KAAK,GAAG,CAAC;CACT,GAAG;CACH,CAAC;AACW,OAAC,UAAU,GAAG,WAAW;AACzB,OAAC,UAAU,GAAG;;ACnFd,OAAC,UAAU,GAAG,MAAM;AACpB,OAAC,aAAa,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/index.min.js b/node_modules/msgpackr/dist/index.min.js
new file mode 100644
index 0000000..595108f
--- /dev/null
+++ b/node_modules/msgpackr/dist/index.min.js
@@ -0,0 +1,2 @@
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).msgpackr={})}(this,(function(e){"use strict";var t,r,n;try{t=new TextDecoder}catch(e){}var i,s,o,a,u,l=0,f={},c=0,h=0,g=[],p={useRecords:!1,mapsAsObjects:!0};class d{}const y=new d;y.name="MessagePack 0xC1";var w=!1,b=2;class S{constructor(e){e&&(!1===e.useRecords&&void 0===e.mapsAsObjects&&(e.mapsAsObjects=!0),e.sequential&&!1!==e.trusted&&(e.trusted=!0,e.structures||0==e.useRecords||(e.structures=[],e.maxSharedStructures||(e.maxSharedStructures=0))),e.structures?e.structures.sharedLength=e.structures.length:e.getStructures&&((e.structures=[]).uninitialized=!0,e.structures.sharedLength=0),e.int64AsNumber&&(e.int64AsType="number")),Object.assign(this,e)}unpack(e,t){if(r)return q((()=>(H(),this?this.unpack(e,t):S.prototype.unpack.call(p,e,t))));e.buffer||e.constructor!==ArrayBuffer||(e="undefined"!=typeof Buffer?Buffer.from(e):new Uint8Array(e)),"object"==typeof t?(n=t.end||e.length,l=t.start||0):(l=0,n=t>-1?t:e.length),h=0,s=null,o=null,r=e;try{u=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(r=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof S){if(f=this,this.structures)return i=this.structures,m(t);(!i||i.length>0)&&(i=[])}else f=p,(!i||i.length>0)&&(i=[]);return m(t)}unpackMultiple(e,t){let r,n=0;try{w=!0;let i=e.length,s=this?this.unpack(e,i):Q.unpack(e,i);if(!t){for(r=[s];l<i;)n=l,r.push(m());return r}if(!1===t(s,n,l))return;for(;l<i;)if(n=l,!1===t(m(),n,l))return}catch(e){throw e.lastPosition=n,e.values=r,e}finally{w=!1,H()}}_mergeStructures(e,t){this._onLoadedStructures&&(e=this._onLoadedStructures(e)),e=e||[],Object.isFrozen(e)&&(e=e.map((e=>e.slice(0))));for(let t=0,r=e.length;t<r;t++){let r=e[t];r&&(r.isShared=!0,t>=32&&(r.highByte=t-32>>5))}e.sharedLength=e.length;for(let r in t||[])if(r>=0){let n=e[r],i=t[r];i&&(n&&((e.restoreStructures||(e.restoreStructures=[]))[r]=n),e[r]=i)}return this.structures=e}decode(e,t){return this.unpack(e,t)}}function m(e){try{if(!f.trusted&&!w){let e=i.sharedLength||0;e<i.length&&(i.length=e)}let t;if(f._readStruct&&r[l]<64&&r[l]>=32?(t=f._readStruct(r,l,n),r=null,e&&e.lazy||!t||(t=t.toJSON()),l=n):t=A(),o&&(l=o.postBundlePosition,o=null),w&&(i.restoreStructures=null),l==n)i&&i.restoreStructures&&U(),i=null,r=null,a&&(a=null);else{if(l>n)throw new Error("Unexpected end of MessagePack data");if(!w){let e;try{e=JSON.stringify(t,((e,t)=>"bigint"==typeof t?`${t}n`:t)).slice(0,100)}catch(t){e="(JSON view not available "+t+")"}throw new Error("Data read, but end of buffer not reached "+e)}}return t}catch(e){throw i&&i.restoreStructures&&U(),H(),(e instanceof RangeError||e.message.startsWith("Unexpected end of buffer")||l>n)&&(e.incomplete=!0),e}}function U(){for(let e in i.restoreStructures)i[e]=i.restoreStructures[e];i.restoreStructures=null}function A(){let e=r[l++];if(e<160){if(e<128){if(e<64)return e;{let t=i[63&e]||f.getStructures&&v()[63&e];return t?(t.read||(t.read=I(t,63&e)),t.read()):e}}if(e<144){if(e-=128,f.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=C();"__proto__"===e&&(e="__proto_"),t[e]=A()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(A(),A());return t}}{e-=144;let t=new Array(e);for(let r=0;r<e;r++)t[r]=A();return f.freezeData?Object.freeze(t):t}}if(e<192){let t=e-160;if(h>=l)return s.slice(l-c,(l+=t)-c);if(0==h&&n<140){let e=t<16?D(t):L(t);if(null!=e)return e}return _(t)}{let t;switch(e){case 192:return null;case 193:return o?(t=A(),t>0?o[1].slice(o.position1,o.position1+=t):o[0].slice(o.position0,o.position0-=t)):y;case 194:return!1;case 195:return!0;case 196:if(t=r[l++],void 0===t)throw new Error("Unexpected end of buffer");return P(t);case 197:return t=u.getUint16(l),l+=2,P(t);case 198:return t=u.getUint32(l),l+=4,P(t);case 199:return N(r[l++]);case 200:return t=u.getUint16(l),l+=2,N(t);case 201:return t=u.getUint32(l),l+=4,N(t);case 202:if(t=u.getFloat32(l),f.useFloat32>2){let e=Z[(127&r[l])<<1|r[l+1]>>7];return l+=4,(e*t+(t>0?.5:-.5)>>0)/e}return l+=4,t;case 203:return t=u.getFloat64(l),l+=8,t;case 204:return r[l++];case 205:return t=u.getUint16(l),l+=2,t;case 206:return t=u.getUint32(l),l+=4,t;case 207:return"number"===f.int64AsType?(t=4294967296*u.getUint32(l),t+=u.getUint32(l+4)):"string"===f.int64AsType?t=u.getBigUint64(l).toString():"auto"===f.int64AsType?(t=u.getBigUint64(l),t<=BigInt(2)<<BigInt(52)&&(t=Number(t))):t=u.getBigUint64(l),l+=8,t;case 208:return u.getInt8(l++);case 209:return t=u.getInt16(l),l+=2,t;case 210:return t=u.getInt32(l),l+=4,t;case 211:return"number"===f.int64AsType?(t=4294967296*u.getInt32(l),t+=u.getUint32(l+4)):"string"===f.int64AsType?t=u.getBigInt64(l).toString():"auto"===f.int64AsType?(t=u.getBigInt64(l),t>=BigInt(-2)<<BigInt(52)&&t<=BigInt(2)<<BigInt(52)&&(t=Number(t))):t=u.getBigInt64(l),l+=8,t;case 212:if(t=r[l++],114==t)return W(63&r[l++]);{let e=g[t];if(e)return e.read?(l++,e.read(A())):e.noBuffer?(l++,e()):e(r.subarray(l,++l));throw new Error("Unknown extension "+t)}case 213:return t=r[l],114==t?(l++,W(63&r[l++],r[l++])):N(2);case 214:return N(4);case 215:return N(8);case 216:return N(16);case 217:return t=r[l++],h>=l?s.slice(l-c,(l+=t)-c):k(t);case 218:return t=u.getUint16(l),h>=(l+=2)?s.slice(l-c,(l+=t)-c):B(t);case 219:return t=u.getUint32(l),h>=(l+=4)?s.slice(l-c,(l+=t)-c):x(t);case 220:return t=u.getUint16(l),l+=2,M(t);case 221:return t=u.getUint32(l),l+=4,M(t);case 222:return t=u.getUint16(l),l+=2,R(t);case 223:return t=u.getUint32(l),l+=4,R(t);default:if(e>=224)return e-256;if(void 0===e){let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}throw new Error("Unknown MessagePack token "+e)}}}const E=/^[a-zA-Z_$][a-zA-Z\d_$]*$/;function I(e,t){function r(){if(r.count++>b){let n;try{n=e.read=new Function("r","return function(){return "+(f.freezeData?"Object.freeze":"")+"({"+e.map((e=>"__proto__"===e?"__proto_:r()":E.test(e)?e+":r()":"["+JSON.stringify(e)+"]:r()")).join(",")+"})}")(A)}catch(e){return b=1/0,r()}return 0===e.highByte&&(e.read=O(t,e.read)),n()}let n={};for(let t=0,r=e.length;t<r;t++){let r=e[t];"__proto__"===r&&(r="__proto_"),n[r]=A()}return f.freezeData?Object.freeze(n):n}return r.count=0,0===e.highByte?O(t,r):r}const O=(e,t)=>function(){let n=r[l++];if(0===n)return t();let s=e<32?-(e+(n<<5)):e+(n<<5),o=i[s]||v()[s];if(!o)throw new Error("Record id is not defined for "+s);return o.read||(o.read=I(o,e)),o.read()};function v(){let e=q((()=>(r=null,f.getStructures())));return i=f._mergeStructures(e,i)}var _=T,k=T,B=T,x=T;function T(e){let n;if(e<16&&(n=D(e)))return n;if(e>64&&t)return t.decode(r.subarray(l,l+=e));const i=l+e,s=[];for(n="";l<i;){const e=r[l++];if(0==(128&e))s.push(e);else if(192==(224&e)){const t=(31&e)<<6|63&r[l++];t<128?s.push(65533):s.push(t)}else if(224==(240&e)){const t=(31&e)<<12|(63&r[l++])<<6|63&r[l++];t<2048||t>=55296&&t<=57343?s.push(65533):s.push(t)}else if(240==(248&e)){let t=(7&e)<<18|(63&r[l++])<<12|(63&r[l++])<<6|63&r[l++];t<65536||t>1114111?s.push(65533):t>65535?(t-=65536,s.push(t>>>10&1023|55296),t=56320|1023&t,s.push(t)):s.push(t)}else s.push(65533);s.length>=4096&&(n+=j.apply(String,s),s.length=0)}return s.length>0&&(n+=j.apply(String,s)),n}function M(e){let t=new Array(e);for(let r=0;r<e;r++)t[r]=A();return f.freezeData?Object.freeze(t):t}function R(e){if(f.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=C();"__proto__"===e&&(e="__proto_"),t[e]=A()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(A(),A());return t}}var j=String.fromCharCode;function L(e){let t=l,n=new Array(e);for(let i=0;i<e;i++){const e=r[l++];if((128&e)>0)return void(l=t);n[i]=e}return j.apply(String,n)}function D(e){if(e<4){if(e<2){if(0===e)return"";{let e=r[l++];return(128&e)>1?void(l-=1):j(e)}}{let t=r[l++],n=r[l++];if((128&t)>0||(128&n)>0)return void(l-=2);if(e<3)return j(t,n);let i=r[l++];return(128&i)>0?void(l-=3):j(t,n,i)}}{let t=r[l++],n=r[l++],i=r[l++],s=r[l++];if((128&t)>0||(128&n)>0||(128&i)>0||(128&s)>0)return void(l-=4);if(e<6){if(4===e)return j(t,n,i,s);{let e=r[l++];return(128&e)>0?void(l-=5):j(t,n,i,s,e)}}if(e<8){let o=r[l++],a=r[l++];if((128&o)>0||(128&a)>0)return void(l-=6);if(e<7)return j(t,n,i,s,o,a);let u=r[l++];return(128&u)>0?void(l-=7):j(t,n,i,s,o,a,u)}{let o=r[l++],a=r[l++],u=r[l++],f=r[l++];if((128&o)>0||(128&a)>0||(128&u)>0||(128&f)>0)return void(l-=8);if(e<10){if(8===e)return j(t,n,i,s,o,a,u,f);{let e=r[l++];return(128&e)>0?void(l-=9):j(t,n,i,s,o,a,u,f,e)}}if(e<12){let c=r[l++],h=r[l++];if((128&c)>0||(128&h)>0)return void(l-=10);if(e<11)return j(t,n,i,s,o,a,u,f,c,h);let g=r[l++];return(128&g)>0?void(l-=11):j(t,n,i,s,o,a,u,f,c,h,g)}{let c=r[l++],h=r[l++],g=r[l++],p=r[l++];if((128&c)>0||(128&h)>0||(128&g)>0||(128&p)>0)return void(l-=12);if(e<14){if(12===e)return j(t,n,i,s,o,a,u,f,c,h,g,p);{let e=r[l++];return(128&e)>0?void(l-=13):j(t,n,i,s,o,a,u,f,c,h,g,p,e)}}{let d=r[l++],y=r[l++];if((128&d)>0||(128&y)>0)return void(l-=14);if(e<15)return j(t,n,i,s,o,a,u,f,c,h,g,p,d,y);let w=r[l++];return(128&w)>0?void(l-=15):j(t,n,i,s,o,a,u,f,c,h,g,p,d,y,w)}}}}}function V(){let e,t=r[l++];if(t<192)e=t-160;else switch(t){case 217:e=r[l++];break;case 218:e=u.getUint16(l),l+=2;break;case 219:e=u.getUint32(l),l+=4;break;default:throw new Error("Expected string")}return T(e)}function P(e){return f.copyBuffers?Uint8Array.prototype.slice.call(r,l,l+=e):r.subarray(l,l+=e)}function N(e){let t=r[l++];if(g[t]){let n;return g[t](r.subarray(l,n=l+=e),(e=>{l=e;try{return A()}finally{l=n}}))}throw new Error("Unknown extension type "+t)}var F=new Array(4096);function C(){let e=r[l++];if(!(e>=160&&e<192))return l--,z(A());if(e-=160,h>=l)return s.slice(l-c,(l+=e)-c);if(!(0==h&&n<180))return _(e);let t,i=4095&(e<<5^(e>1?u.getUint16(l):e>0?r[l]:0)),o=F[i],a=l,f=l+e-3,g=0;if(o&&o.bytes==e){for(;a<f;){if(t=u.getUint32(a),t!=o[g++]){a=1879048192;break}a+=4}for(f+=3;a<f;)if(t=r[a++],t!=o[g++]){a=1879048192;break}if(a===f)return l=a,o.string;f-=3,a=l}for(o=[],F[i]=o,o.bytes=e;a<f;)t=u.getUint32(a),o.push(t),a+=4;for(f+=3;a<f;)t=r[a++],o.push(t);let p=e<16?D(e):L(e);return o.string=null!=p?p:_(e)}function z(e){if("string"==typeof e)return e;if("number"==typeof e||"boolean"==typeof e||"bigint"==typeof e)return e.toString();if(null==e)return e+"";if(f.allowArraysInMapKeys&&Array.isArray(e)&&e.flat().every((e=>["string","number","boolean","bigint"].includes(typeof e))))return e.flat().toString();throw new Error("Invalid property type for record: "+typeof e)}const W=(e,t)=>{let r=A().map(z),n=e;void 0!==t&&(e=e<32?-((t<<5)+e):(t<<5)+e,r.highByte=t);let s=i[e];return s&&(s.isShared||w)&&((i.restoreStructures||(i.restoreStructures=[]))[e]=s),i[e]=r,r.read=I(r,n),r.read()};g[0]=()=>{},g[0].noBuffer=!0,g[66]=e=>{let t=e.byteLength%8||8,r=BigInt(128&e[0]?e[0]-256:e[0]);for(let n=1;n<t;n++)r<<=BigInt(8),r+=BigInt(e[n]);if(e.byteLength!==t){let n=new DataView(e.buffer,e.byteOffset,e.byteLength),i=(e,t)=>{let r=t-e;if(r<=40){let r=n.getBigUint64(e);for(let i=e+8;i<t;i+=8)r<<=BigInt(64),r|=n.getBigUint64(i);return r}let s=e+(r>>4<<3),o=i(e,s),a=i(s,t);return o<<BigInt(8*(t-s))|a};r=r<<BigInt(8*(n.byteLength-t))|i(t,n.byteLength)}return r};let J={Error:Error,EvalError:EvalError,RangeError:RangeError,ReferenceError:ReferenceError,SyntaxError:SyntaxError,TypeError:TypeError,URIError:URIError,AggregateError:"function"==typeof AggregateError?AggregateError:null};g[101]=()=>{let e=A();if(!J[e[0]]){let t=Error(e[1],{cause:e[2]});return t.name=e[0],t}return J[e[0]](e[1],{cause:e[2]})},g[105]=e=>{if(!1===f.structuredClone)throw new Error("Structured clone extension is disabled");let t=u.getUint32(l-4);a||(a=new Map);let n,i=r[l];n=i>=144&&i<160||220==i||221==i?[]:i>=128&&i<144||222==i||223==i?new Map:(i>=199&&i<=201||i>=212&&i<=216)&&115===r[l+1]?new Set:{};let s={target:n};a.set(t,s);let o=A();if(!s.used)return s.target=o;if(Object.assign(n,o),n instanceof Map)for(let[e,t]of o.entries())n.set(e,t);if(n instanceof Set)for(let e of Array.from(o))n.add(e);return n},g[112]=e=>{if(!1===f.structuredClone)throw new Error("Structured clone extension is disabled");let t=u.getUint32(l-4),r=a.get(t);return r.used=!0,r.target},g[115]=()=>new Set(A());const K=["Int8","Uint8","Uint8Clamped","Int16","Uint16","Int32","Uint32","Float32","Float64","BigInt64","BigUint64"].map((e=>e+"Array"));let $="object"==typeof globalThis?globalThis:window;g[116]=e=>{let t=e[0],r=Uint8Array.prototype.slice.call(e,1).buffer,n=K[t];if(!n){if(16===t)return r;if(17===t)return new DataView(r);throw new Error("Could not find typed array for code "+t)}return new $[n](r)},g[120]=()=>{let e=A();return new RegExp(e[0],e[1])};const Y=[];function q(e){f&&f._onSaveState&&f._onSaveState();let t=n,g=l,p=c,d=h,y=s,b=a,S=o,m=new Uint8Array(r.slice(0,n)),U=i,A=i.slice(0,i.length),E=f,I=w,O=e();return n=t,l=g,c=p,h=d,s=y,a=b,o=S,r=m,w=I,(i=U).splice(0,i.length,...A),f=E,u=new DataView(r.buffer,r.byteOffset,r.byteLength),O}function H(){r=null,a=null,i=null}g[98]=e=>{let t=(e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3],r=l;return l+=t-e.length,o=Y,(o=[V(),V()]).position0=0,o.position1=0,o.postBundlePosition=l,l=r,A()},g[255]=e=>4==e.length?new Date(1e3*(16777216*e[0]+(e[1]<<16)+(e[2]<<8)+e[3])):8==e.length?new Date(((e[0]<<22)+(e[1]<<14)+(e[2]<<6)+(e[3]>>2))/1e6+1e3*(4294967296*(3&e[3])+16777216*e[4]+(e[5]<<16)+(e[6]<<8)+e[7])):12==e.length?new Date(((e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3])/1e6+1e3*((128&e[4]?-281474976710656:0)+1099511627776*e[6]+4294967296*e[7]+16777216*e[8]+(e[9]<<16)+(e[10]<<8)+e[11])):new Date("invalid");const Z=new Array(147);for(let e=0;e<256;e++)Z[e]=+("1e"+Math.floor(45.15-.30103*e));const G=S;var Q=new S({useRecords:!1});const X=Q.unpack,ee=Q.unpackMultiple,te=Q.unpack,re={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let ne,ie,se,oe=new Float32Array(1),ae=new Uint8Array(oe.buffer,0,4);S.SUPPORTS_STRUCT_HOOKS=!0;try{ne=new TextEncoder}catch(e){}const ue="undefined"!=typeof Buffer,le=ue?function(e){return Buffer.allocUnsafeSlow(e)}:Uint8Array,fe=ue?Buffer:Uint8Array,ce=ue?4294967296:2144337920;let he,ge,pe,de,ye=0,we=null;const be=/[\u0080-\uFFFF]/,Se=Symbol("record-id");class me extends S{constructor(e){let t,r,n,i;super(e),this.offset=0;let s=fe.prototype.utf8Write?function(e,t){return he.utf8Write(e,t,he.byteLength-t)}:!(!ne||!ne.encodeInto)&&function(e,t){return ne.encodeInto(e,he.subarray(t)).written},o=this;e||(e={});let a=e&&e.sequential,u=e.structures||e.saveStructures,l=e.maxSharedStructures;if(null==l&&(l=u?32:0),l>8160)throw new Error("Maximum maxSharedStructure is 8160");e.structuredClone&&null==e.moreTypes&&(this.moreTypes=!0);let f=e.maxOwnStructures;null==f&&(f=u?32:64),this.structures||0==e.useRecords||(this.structures=[]);let c=l>32||f+l>64,h=l+64,g=l+f+64;if(g>8256)throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");let p=[],d=0,y=0;this.pack=this.encode=function(e,s){if(he||(he=new le(8192),pe=he.dataView||(he.dataView=new DataView(he.buffer,0,8192)),ye=0),de=he.length-10,de-ye<2048?(he=new le(he.length),pe=he.dataView||(he.dataView=new DataView(he.buffer,0,he.length)),de=he.length-10,ye=0):ye=ye+7&2147483640,t=ye,s&De&&(ye+=255&s),i=o.structuredClone?new Map:null,o.bundleStrings&&"string"!=typeof e?(we=[],we.size=1/0):we=null,n=o.structures,n){n.uninitialized&&(n=o._mergeStructures(o.getStructures()));let e=n.sharedLength||0;if(e>l)throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+n.sharedLength);if(!n.transitions){n.transitions=Object.create(null);for(let t=0;t<e;t++){let e=n[t];if(!e)continue;let r,i=n.transitions;for(let t=0,n=e.length;t<n;t++){let n=e[t];r=i[n],r||(r=i[n]=Object.create(null)),i=r}i[Se]=t+64}this.lastNamedStructuresLength=e}a||(n.nextId=e+64)}let u;r&&(r=!1);try{o._writeStruct&&e&&"object"==typeof e?e.constructor===Object?I(e):e.constructor===Map||Array.isArray(e)||se.some((t=>e instanceof t))?S(e):I(e.toJSON?e.toJSON():e):S(e);let a=we;if(we&&Ie(t,S,0),i&&i.idsToInsert){let e=i.idsToInsert.sort(((e,t)=>e.offset>t.offset?1:-1)),r=e.length,n=-1;for(;a&&r>0;){let i=e[--r].offset+t;i<a.stringsPosition+t&&-1===n&&(n=0),i>a.position+t?n>=0&&(n+=6):(n>=0&&(pe.setUint32(a.position+t,pe.getUint32(a.position+t)+n),n=-1),a=a.previous,r++)}n>=0&&a&&pe.setUint32(a.position+t,pe.getUint32(a.position+t)+n),ye+=6*e.length,ye>de&&O(ye),o.offset=ye;let s=function(e,t){let r,n=6*t.length,i=e.length-n;for(;r=t.pop();){let t=r.offset,s=r.id;e.copyWithin(t+n,t,i),n-=6;let o=t+n;e[o++]=214,e[o++]=105,e[o++]=s>>24,e[o++]=s>>16&255,e[o++]=s>>8&255,e[o++]=255&s,i=t}return e}(he.subarray(t,ye),e);return i=null,s}return o.offset=ye,s&je?(he.start=t,he.end=ye,he):he.subarray(t,ye)}catch(e){throw u=e,e}finally{if(n&&(w(),r&&o.saveStructures)){let r=n.sharedLength||0,i=he.subarray(t,ye),a=(o._prepareStructures||Oe)(n,o);if(!u)return!1===o.saveStructures(a,a.isCompatible)?o.pack(e,s):(o.lastNamedStructuresLength=r,he.length>1073741824&&(he=null),i)}he.length>1073741824&&(he=null),s&Le&&(ye=t)}};const w=()=>{y<10&&y++;let e=n.sharedLength||0;if(n.length>e&&!a&&(n.length=e),d>1e4)n.transitions=null,y=0,d=0,p.length>0&&(p=[]);else if(p.length>0&&!a){for(let e=0,t=p.length;e<t;e++)p[e][Se]=0;p=[]}},b=e=>{var t=e.length;t<16?he[ye++]=144|t:t<65536?(he[ye++]=220,he[ye++]=t>>8,he[ye++]=255&t):(he[ye++]=221,pe.setUint32(ye,t),ye+=4);for(let r=0;r<t;r++)S(e[r])},S=e=>{ye>de&&(he=O(ye));var r,n=typeof e;if("string"===n){let n,i=e.length;if(we&&i>=4&&i<4096){if((we.size+=i)>21760){let e,r,n=(we[0]?3*we[0].length+we[1].length:0)+10;ye+n>de&&(he=O(ye+n)),we.position?(r=we,he[ye]=200,ye+=3,he[ye++]=98,e=ye-t,ye+=4,Ie(t,S,0),pe.setUint16(e+t-3,ye-t-e)):(he[ye++]=214,he[ye++]=98,e=ye-t,ye+=4),we=["",""],we.previous=r,we.size=0,we.position=e}let r=be.test(e);return we[r?0:1]+=e,he[ye++]=193,void S(r?-i:i)}n=i<32?1:i<256?2:i<65536?3:5;let o=3*i;if(ye+o>de&&(he=O(ye+o)),i<64||!s){let t,s,o,a=ye+n;for(t=0;t<i;t++)s=e.charCodeAt(t),s<128?he[a++]=s:s<2048?(he[a++]=s>>6|192,he[a++]=63&s|128):55296==(64512&s)&&56320==(64512&(o=e.charCodeAt(t+1)))?(s=65536+((1023&s)<<10)+(1023&o),t++,he[a++]=s>>18|240,he[a++]=s>>12&63|128,he[a++]=s>>6&63|128,he[a++]=63&s|128):(he[a++]=s>>12|224,he[a++]=s>>6&63|128,he[a++]=63&s|128);r=a-ye-n}else r=s(e,ye+n);r<32?he[ye++]=160|r:r<256?(n<2&&he.copyWithin(ye+2,ye+1,ye+1+r),he[ye++]=217,he[ye++]=r):r<65536?(n<3&&he.copyWithin(ye+3,ye+2,ye+2+r),he[ye++]=218,he[ye++]=r>>8,he[ye++]=255&r):(n<5&&he.copyWithin(ye+5,ye+3,ye+3+r),he[ye++]=219,pe.setUint32(ye,r),ye+=4),ye+=r}else if("number"===n)if(e>>>0===e)e<32||e<128&&!1===this.useRecords||e<64&&!this._writeStruct?he[ye++]=e:e<256?(he[ye++]=204,he[ye++]=e):e<65536?(he[ye++]=205,he[ye++]=e>>8,he[ye++]=255&e):(he[ye++]=206,pe.setUint32(ye,e),ye+=4);else if(e>>0===e)e>=-32?he[ye++]=256+e:e>=-128?(he[ye++]=208,he[ye++]=e+256):e>=-32768?(he[ye++]=209,pe.setInt16(ye,e),ye+=2):(he[ye++]=210,pe.setInt32(ye,e),ye+=4);else{let t;if((t=this.useFloat32)>0&&e<4294967296&&e>=-2147483648){let r;if(he[ye++]=202,pe.setFloat32(ye,e),t<4||(r=e*Z[(127&he[ye])<<1|he[ye+1]>>7])>>0===r)return void(ye+=4);ye--}he[ye++]=203,pe.setFloat64(ye,e),ye+=8}else if("object"===n||"function"===n)if(e){if(i){let r=i.get(e);if(r){if(!r.id){let e=i.idsToInsert||(i.idsToInsert=[]);r.id=e.push(r)}return he[ye++]=214,he[ye++]=112,pe.setUint32(ye,r.id),void(ye+=4)}i.set(e,{offset:ye-t})}let s=e.constructor;if(s===Object)E(e);else if(s===Array)b(e);else if(s===Map)if(this.mapAsEmptyObject)he[ye++]=128;else{(r=e.size)<16?he[ye++]=128|r:r<65536?(he[ye++]=222,he[ye++]=r>>8,he[ye++]=255&r):(he[ye++]=223,pe.setUint32(ye,r),ye+=4);for(let[t,r]of e)S(t),S(r)}else{for(let t=0,r=ie.length;t<r;t++){if(e instanceof se[t]){let r=ie[t];if(r.write){r.type&&(he[ye++]=212,he[ye++]=r.type,he[ye++]=0);let t=r.write.call(this,e);return void(t===e?Array.isArray(e)?b(e):E(e):S(t))}let n,i=he,s=pe,o=ye;he=null;try{n=r.pack.call(this,e,(e=>(he=i,i=null,ye+=e,ye>de&&O(ye),{target:he,targetView:pe,position:ye-e})),S)}finally{i&&(he=i,pe=s,ye=o,de=he.length-10)}return void(n&&(n.length+ye>de&&O(n.length+ye),ye=Ee(n,he,ye,r.type)))}}if(Array.isArray(e))b(e);else{if(e.toJSON){const t=e.toJSON();if(t!==e)return S(t)}if("function"===n)return S(this.writeFunction&&this.writeFunction(e));E(e)}}}else he[ye++]=192;else if("boolean"===n)he[ye++]=e?195:194;else if("bigint"===n){if(e<0x8000000000000000&&e>=-0x8000000000000000)he[ye++]=211,pe.setBigInt64(ye,e);else if(e<0x10000000000000000&&e>0)he[ye++]=207,pe.setBigUint64(ye,e);else{if(!this.largeBigIntToFloat){if(this.largeBigIntToString)return S(e.toString());if(this.useBigIntExtension||this.moreTypes){let t,r=e<0?BigInt(-1):BigInt(0);if(e>>BigInt(65536)===r){let n=BigInt(0x10000000000000000)-BigInt(1),i=[];for(;i.push(e&n),e>>BigInt(63)!==r;)e>>=BigInt(64);t=new Uint8Array(new BigUint64Array(i).buffer),t.reverse()}else{let r=e<0,n=(r?~e:e).toString(16);if(n.length%2?n="0"+n:parseInt(n.charAt(0),16)>=8&&(n="00"+n),ue)t=Buffer.from(n,"hex");else{t=new Uint8Array(n.length/2);for(let e=0;e<t.length;e++)t[e]=parseInt(n.slice(2*e,2*e+2),16)}if(r)for(let e=0;e<t.length;e++)t[e]=~t[e]}return t.length+ye>de&&O(t.length+ye),void(ye=Ee(t,he,ye,66))}throw new RangeError(e+" was too large to fit in MessagePack 64-bit integer format, use useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set largeBigIntToString to convert to string")}he[ye++]=203,pe.setFloat64(ye,Number(e))}ye+=8}else{if("undefined"!==n)throw new Error("Unknown type: "+n);this.encodeUndefinedAsNil?he[ye++]=192:(he[ye++]=212,he[ye++]=0,he[ye++]=0)}},m=this.variableMapSize||this.coercibleKeyAsNumber||this.skipValues?e=>{let t;if(this.skipValues){t=[];for(let r in e)"function"==typeof e.hasOwnProperty&&!e.hasOwnProperty(r)||this.skipValues.includes(e[r])||t.push(r)}else t=Object.keys(e);let r,n=t.length;if(n<16?he[ye++]=128|n:n<65536?(he[ye++]=222,he[ye++]=n>>8,he[ye++]=255&n):(he[ye++]=223,pe.setUint32(ye,n),ye+=4),this.coercibleKeyAsNumber)for(let i=0;i<n;i++){r=t[i];let n=Number(r);S(isNaN(n)?r:n),S(e[r])}else for(let i=0;i<n;i++)S(r=t[i]),S(e[r])}:e=>{he[ye++]=222;let r=ye-t;ye+=2;let n=0;for(let t in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(t))&&(S(t),S(e[t]),n++);if(n>65535)throw new Error('Object is too large to serialize with fast 16-bit map size, use the "variableMapSize" option to serialize this object');he[r+++t]=n>>8,he[r+t]=255&n},U=!1===this.useRecords?m:e.progressiveRecords&&!c?e=>{let r,i,s=n.transitions||(n.transitions=Object.create(null)),o=ye++-t;for(let a in e)if("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(a)){if(r=s[a],r)s=r;else{let u=Object.keys(e),l=s;s=n.transitions;let f=0;for(let e=0,t=u.length;e<t;e++){let t=u[e];r=s[t],r||(r=s[t]=Object.create(null),f++),s=r}o+t+1==ye?(ye--,v(s,u,f)):_(s,u,o,f),i=!0,s=l[a]}S(e[a])}if(!i){let r=s[Se];r?he[o+t]=r:_(s,Object.keys(e),o,0)}}:e=>{let t,r=n.transitions||(n.transitions=Object.create(null)),i=0;for(let n in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(n))&&(t=r[n],t||(t=r[n]=Object.create(null),i++),r=t);let s=r[Se];s?s>=96&&c?(he[ye++]=96+(31&(s-=96)),he[ye++]=s>>5):he[ye++]=s:v(r,r.__keys__||Object.keys(e),i);for(let t in e)("function"!=typeof e.hasOwnProperty||e.hasOwnProperty(t))&&S(e[t])},A="function"==typeof this.useRecords&&this.useRecords,E=A?e=>{A(e)?U(e):m(e)}:U,I=e=>{let i=o._writeStruct(e,he,t,ye,n,O,((e,t,n)=>{if(n)return r=!0;ye=t;let i=he;return S(e),w(),i!==he?{position:ye,targetView:pe,target:he}:ye}));if(0===i)return E(e);ye=i},O=e=>{let r;if(e>16777216){if(e-t>ce)throw new Error("Packed buffer would be larger than maximum buffer size");r=Math.min(ce,4096*Math.round(Math.max((e-t)*(e>67108864?1.25:2),4194304)/4096))}else r=1+(Math.max(e-t<<2,he.length-1)>>12)<<12;let n=new le(r);return pe=n.dataView||(n.dataView=new DataView(n.buffer,0,r)),e=Math.min(e,he.length),he.copy?he.copy(n,0,t,e):n.set(he.slice(t,e)),ye-=t,t=0,de=n.length-10,he=n},v=(e,t,i)=>{let s=n.nextId;s||(s=64),s<h&&this.shouldShareStructure&&!this.shouldShareStructure(t)?(s=n.nextOwnId,s<g||(s=h),n.nextOwnId=s+1):(s>=g&&(s=h),n.nextId=s+1);let o=t.highByte=s>=96&&c?s-96>>5:-1;e[Se]=s,e.__keys__=t,n[s-64]=t,s<h?(t.isShared=!0,n.sharedLength=s-63,r=!0,o>=0?(he[ye++]=96+(31&s),he[ye++]=o):he[ye++]=s):(o>=0?(he[ye++]=213,he[ye++]=114,he[ye++]=96+(31&s),he[ye++]=o):(he[ye++]=212,he[ye++]=114,he[ye++]=s),i&&(d+=y*i),p.length>=f&&(p.shift()[Se]=0),p.push(e),S(t))},_=(e,r,n,i)=>{let s=he,o=ye,a=de,u=t;he=ge,ye=0,t=0,he||(ge=he=new le(8192)),de=he.length-10,v(e,r,i),ge=he;let l=ye;if(he=s,ye=o,de=a,t=u,l>1){let e=ye+l-1;e>de&&O(e);let r=n+t;he.copyWithin(r+l,r+1,ye),he.set(ge.slice(0,l),r),ye=e}else he[n+t]=ge[0]}}useBuffer(e){he=e,he.dataView||(he.dataView=new DataView(he.buffer,he.byteOffset,he.byteLength)),pe=he.dataView,ye=0}set position(e){ye=e}get position(){return ye}clearSharedData(){this.structures&&(this.structures=[]),this.typedStructs&&(this.typedStructs=[])}}function Ue(e,t,r,n){let i=e.byteLength;if(i+1<256){var{target:s,position:o}=r(4+i);s[o++]=199,s[o++]=i+1}else if(i+1<65536){var{target:s,position:o}=r(5+i);s[o++]=200,s[o++]=i+1>>8,s[o++]=i+1&255}else{var{target:s,position:o,targetView:a}=r(7+i);s[o++]=201,a.setUint32(o,i+1),o+=4}s[o++]=116,s[o++]=t,e.buffer||(e=new Uint8Array(e)),s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),o)}function Ae(e,t){let r=e.byteLength;var n,i;if(r<256){var{target:n,position:i}=t(r+2);n[i++]=196,n[i++]=r}else if(r<65536){var{target:n,position:i}=t(r+3);n[i++]=197,n[i++]=r>>8,n[i++]=255&r}else{var{target:n,position:i,targetView:s}=t(r+5);n[i++]=198,s.setUint32(i,r),i+=4}n.set(e,i)}function Ee(e,t,r,n){let i=e.length;switch(i){case 1:t[r++]=212;break;case 2:t[r++]=213;break;case 4:t[r++]=214;break;case 8:t[r++]=215;break;case 16:t[r++]=216;break;default:i<256?(t[r++]=199,t[r++]=i):i<65536?(t[r++]=200,t[r++]=i>>8,t[r++]=255&i):(t[r++]=201,t[r++]=i>>24,t[r++]=i>>16&255,t[r++]=i>>8&255,t[r++]=255&i)}return t[r++]=n,t.set(e,r),r+=i}function Ie(e,t,r){if(we.length>0){pe.setUint32(we.position+e,ye+r-we.position-e),we.stringsPosition=ye-e;let n=we;we=null,t(n[0]),t(n[1])}}function Oe(e,t){return e.isCompatible=e=>{let r=!e||(t.lastNamedStructuresLength||0)===e.length;return r||t._mergeStructures(e),r},e}se=[Date,Set,Error,RegExp,ArrayBuffer,Object.getPrototypeOf(Uint8Array.prototype).constructor,DataView,d],ie=[{pack(e,t,r){let n=e.getTime()/1e3;if((this.useTimestamp32||0===e.getMilliseconds())&&n>=0&&n<4294967296){let{target:e,targetView:r,position:i}=t(6);e[i++]=214,e[i++]=255,r.setUint32(i,n)}else if(n>0&&n<4294967296){let{target:r,targetView:i,position:s}=t(10);r[s++]=215,r[s++]=255,i.setUint32(s,4e6*e.getMilliseconds()+(n/1e3/4294967296>>0)),i.setUint32(s+4,n)}else if(isNaN(n)){if(this.onInvalidDate)return t(0),r(this.onInvalidDate());let{target:e,targetView:n,position:i}=t(3);e[i++]=212,e[i++]=255,e[i++]=255}else{let{target:r,targetView:i,position:s}=t(15);r[s++]=199,r[s++]=12,r[s++]=255,i.setUint32(s,1e6*e.getMilliseconds()),i.setBigInt64(s+4,BigInt(Math.floor(n)))}}},{pack(e,t,r){if(this.setAsEmptyObject)return t(0),r({});let n=Array.from(e),{target:i,position:s}=t(this.moreTypes?3:0);this.moreTypes&&(i[s++]=212,i[s++]=115,i[s++]=0),r(n)}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=101,n[i++]=0),r([e.name,e.message,e.cause])}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=120,n[i++]=0),r([e.source,e.flags])}},{pack(e,t){this.moreTypes?Ue(e,16,t):Ae(ue?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let r=e.constructor;r!==fe&&this.moreTypes?Ue(e,K.indexOf(r.name),t):Ae(e,t)}},{pack(e,t){this.moreTypes?Ue(e,17,t):Ae(ue?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let{target:r,position:n}=t(1);r[n]=193}}],me.SUPPORTS_STRUCT_HOOKS=!0;let ve=new me({useRecords:!1});const _e=ve.pack,ke=ve.pack,Be=me,{NEVER:xe,ALWAYS:Te,DECIMAL_ROUND:Me,DECIMAL_FIT:Re}=re,je=512,Le=1024,De=2048;const Ve=function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise");const r=new S(t);let n;const i=e=>{let t;n&&(e=Buffer.concat([n,e]),n=void 0);try{t=r.unpackMultiple(e)}catch(r){if(!r.incomplete)throw r;n=e.slice(r.lastPosition),t=r.values}return t};return"function"==typeof e[Symbol.iterator]?function*(){for(const t of e)yield*i(t)}():"function"==typeof e[Symbol.asyncIterator]?async function*(){for await(const t of e)yield*i(t)}():void 0},Pe=function(e,t={}){if(e&&"object"==typeof e){if("function"==typeof e[Symbol.iterator])return function*(e,t){const r=new me(t);for(const t of e)yield r.pack(t)}(e,t);if("function"==typeof e.then||"function"==typeof e[Symbol.asyncIterator])return async function*(e,t){const r=new me(t);for await(const t of e)yield r.pack(t)}(e,t);throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise")}throw new Error("first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable")};e.ALWAYS=Te,e.C1=y,e.DECIMAL_FIT=Re,e.DECIMAL_ROUND=Me,e.Decoder=G,e.Encoder=Be,e.FLOAT32_OPTIONS=re,e.NEVER=xe,e.Packr=me,e.RESERVE_START_SPACE=De,e.RESET_BUFFER_MODE=Le,e.REUSE_BUFFER_MODE=je,e.Unpackr=S,e.addExtension=function(e){if(e.Class){if(!e.pack&&!e.write)throw new Error("Extension has no pack or write function");if(e.pack&&!e.type)throw new Error("Extension has no type (numeric code to identify the extension)");se.unshift(e.Class),ie.unshift(e)}!function(e){e.unpack?g[e.type]=e.unpack:g[e.type]=e}(e)},e.clearSource=H,e.decode=te,e.decodeIter=Ve,e.encode=ke,e.encodeIter=Pe,e.isNativeAccelerationEnabled=!1,e.mapsAsObjects=!0,e.pack=_e,e.roundFloat32=function(e){oe[0]=e;let t=Z[(127&ae[3])<<1|ae[2]>>7];return(t*e+(e>0?.5:-.5)>>0)/t},e.unpack=X,e.unpackMultiple=ee,e.useRecords=!1}));
+//# sourceMappingURL=index.min.js.map
diff --git a/node_modules/msgpackr/dist/index.min.js.map b/node_modules/msgpackr/dist/index.min.js.map
new file mode 100644
index 0000000..f682580
--- /dev/null
+++ b/node_modules/msgpackr/dist/index.min.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.min.js","sources":["../unpack.js","../pack.js","../iterators.js","../index.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","import { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\n\n/**\n * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer\n * If the argument is only Async Iterable, the return value will be an Async Iterable.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object\n * @param {options} [options] - msgpackr pack options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator>}\n */\nexport function packIter (objectIterator, options = {}) {\n  if (!objectIterator || typeof objectIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');\n  } else if (typeof objectIterator[Symbol.iterator] === 'function') {\n    return packIterSync(objectIterator, options);\n  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {\n    return packIterAsync(objectIterator, options);\n  } else {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');\n  }\n}\n\nfunction * packIterSync (objectIterator, options) {\n  const packr = new Packr(options);\n  for (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\nasync function * packIterAsync (objectIterator, options) {\n  const packr = new Packr(options);\n  for await (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\n/**\n * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects\n * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator\n * @param {object} [options] - unpackr options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator}\n */\nexport function unpackIter (bufferIterator, options = {}) {\n  if (!bufferIterator || typeof bufferIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');\n  }\n\n  const unpackr = new Unpackr(options);\n  let incomplete;\n  const parser = (chunk) => {\n    let yields;\n    // if there's incomplete data from previous chunk, concatinate and try again\n    if (incomplete) {\n      chunk = Buffer.concat([incomplete, chunk]);\n      incomplete = undefined;\n    }\n\n    try {\n      yields = unpackr.unpackMultiple(chunk);\n    } catch (err) {\n      if (err.incomplete) {\n        incomplete = chunk.slice(err.lastPosition);\n        yields = err.values;\n      } else {\n        throw err;\n      }\n    }\n    return yields;\n  };\n\n  if (typeof bufferIterator[Symbol.iterator] === 'function') {\n    return (function * iter () {\n      for (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {\n    return (async function * iter () {\n      for await (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  }\n}\nexport const decodeIter = unpackIter;\nexport const encodeIter = packIter;","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\n"],"names":["decoder","src","srcEnd","TextDecoder","error","currentStructures","srcString","bundledStrings","referenceMap","dataView","position","currentUnpackr","srcStringStart","srcStringEnd","currentExtensions","defaultOptions","useRecords","mapsAsObjects","C1Type","C1","name","sequentialMode","inlineObjectReadThreshold","Unpackr","constructor","options","undefined","sequential","trusted","structures","maxSharedStructures","sharedLength","length","getStructures","uninitialized","int64AsNumber","int64AsType","Object","assign","this","unpack","source","saveState","clearSource","prototype","call","buffer","ArrayBuffer","Buffer","from","Uint8Array","end","start","DataView","byteOffset","byteLength","Error","checkedRead","unpackMultiple","forEach","values","lastPosition","size","value","defaultUnpackr","push","_mergeStructures","loadedStructures","existingStructures","_onLoadedStructures","isFrozen","map","structure","slice","i","l","isShared","highByte","id","existing","restoreStructures","decode","result","_readStruct","lazy","toJSON","read","postBundlePosition","jsonView","JSON","stringify","_","RangeError","message","startsWith","incomplete","token","loadStructures","createStructureReader","object","key","readKey","Map","set","array","Array","freezeData","freeze","string","shortStringInJS","longStringInJS","readFixedString","position1","position0","readBin","getUint16","getUint32","readExt","getFloat32","useFloat32","multiplier","mult10","getFloat64","getBigUint64","toString","BigInt","Number","getInt8","getInt16","getInt32","getBigInt64","recordDefinition","extension","noBuffer","subarray","readString8","readString16","readString32","readArray","readMap","validName","firstId","readObject","count","optimizedReadObject","Function","test","join","Infinity","createSecondByteReader","read0","readStringJS","units","byte1","codePoint","unit","fromCharCode","apply","String","bytes","byte","a","b","c","d","e","f","g","h","j","k","m","n","o","readOnlyJSString","copyBuffers","type","readPosition","keyCache","asSafeString","chunk","entry","checkPosition","property","allowArraysInMapKeys","isArray","flat","every","item","includes","firstByte","existingStructure","data","headLength","head","view","out","middle","left","right","errors","EvalError","ReferenceError","SyntaxError","TypeError","URIError","AggregateError","cause","structuredClone","target","Set","refEntry","targetProperties","used","v","entries","add","get","typedArrays","glbl","globalThis","window","typeCode","typedArrayName","RegExp","TEMP_BUNDLE","callback","_onSaveState","savedSrcEnd","savedPosition","savedSrcStringStart","savedSrcStringEnd","savedSrcString","savedReferenceMap","savedBundledStrings","savedSrc","savedStructures","savedStructuresContents","savedPackr","savedSequentialMode","splice","dataSize","dataPosition","Date","Math","floor","Decoder","FLOAT32_OPTIONS","NEVER","ALWAYS","DECIMAL_ROUND","DECIMAL_FIT","textEncoder","extensions","extensionClasses","f32Array","Float32Array","u8Array","SUPPORTS_STRUCT_HOOKS","TextEncoder","hasNodeBuffer","ByteArrayAllocate","allocUnsafeSlow","ByteArray","MAX_BUFFER_SIZE","keysTarget","targetView","safeEnd","hasNonLatin","RECORD_SYMBOL","Symbol","Packr","hasSharedUpdate","super","offset","encodeUtf8","utf8Write","encodeInto","written","packr","isSequential","hasSharedStructures","saveStructures","moreTypes","maxOwnStructures","useTwoByteRecords","sharedLimitId","maxStructureId","recordIdsToRemove","transitionsCount","serializationsSinceTransitionRebuild","pack","encode","encodeOptions","RESERVE_START_SPACE","bundleStrings","transitions","create","keys","nextTransition","transition","lastNamedStructuresLength","nextId","encodingError","_writeStruct","writeStruct","some","extClass","lastBundle","writeBundles","idsToInsert","sort","incrementPosition","insertionPoint","stringsPosition","setUint32","previous","makeRoom","serialized","distanceToMove","lastEnd","pop","copyWithin","insertIds","REUSE_BUFFER_MODE","resetStructures","returnBuffer","newSharedData","_prepareStructures","prepareStructures","isCompatible","RESET_BUFFER_MODE","packArray","headerSize","strLength","extStart","maxBytes","setUint16","twoByte","c1","c2","strPosition","charCodeAt","setInt16","setInt32","xShifted","setFloat32","setFloat64","referee","writeObject","mapAsEmptyObject","entryValue","write","writeResult","currentTarget","currentTargetView","currentPosition","writeExtensionData","json","writeFunction","setBigInt64","setBigUint64","largeBigIntToFloat","largeBigIntToString","useBigIntExtension","empty","mask","chunks","BigUint64Array","reverse","invert","parseInt","charAt","encodeUndefinedAsNil","writePlainObject","variableMapSize","coercibleKeyAsNumber","skipValues","hasOwnProperty","num","isNaN","objectOffset","writeRecord","progressiveRecords","wroteKeys","lastTransition","newTransitions","newRecord","insertNewRecord","recordId","__keys__","checkUseRecords","newPosition","notifySharedUpdate","startTarget","newSize","min","round","max","newBuffer","copy","shouldShareStructure","nextOwnId","shift","insertionOffset","mainTarget","mainPosition","mainSafeEnd","mainStart","keysPosition","newEnd","insertionPosition","useBuffer","clearSharedData","typedStructs","writeExtBuffer","typedArray","allocateForWrite","writeBuffer","writeStrings","compatible","getPrototypeOf","date","seconds","getTime","useTimestamp32","getMilliseconds","onInvalidDate","setAsEmptyObject","regex","flags","arrayBuffer","indexOf","defaultPackr","Encoder","decodeIter","bufferIterator","unpackr","parser","yields","concat","err","iterator","asyncIterator","encodeIter","objectIterator","packIterSync","then","async","packIterAsync","Class","unshift","unpackAddExtension","float32Number"],"mappings":"gPAAA,IAAIA,EAIAC,EACAC,EAJJ,IACCF,EAAU,IAAIG,WACE,CAAf,MAAMC,GAAS,CAGjB,IAMIC,EACAC,EAGAC,EACAC,EAEAC,EAbAC,EAAW,EAKXC,EAAiB,CAAA,EAGjBC,EAAiB,EACjBC,EAAe,EAGfC,EAAoB,GAEpBC,EAAiB,CACpBC,YAAY,EACZC,eAAe,GAET,MAAMC,GACD,MAACC,EAAK,IAAID,EACtBC,EAAGC,KAAO,mBACV,IAAIC,GAAiB,EACjBC,EAA4B,EAGzB,MAAMC,EACZC,YAAYC,GACPA,KACwB,IAAvBA,EAAQT,iBAAkDU,IAA1BD,EAAQR,gBAC3CQ,EAAQR,eAAgB,GACrBQ,EAAQE,aAAkC,IAApBF,EAAQG,UACjCH,EAAQG,SAAU,EACbH,EAAQI,YAAoC,GAAtBJ,EAAQT,aAClCS,EAAQI,WAAa,GAChBJ,EAAQK,sBACZL,EAAQK,oBAAsB,KAG7BL,EAAQI,WACXJ,EAAQI,WAAWE,aAAeN,EAAQI,WAAWG,OAC7CP,EAAQQ,iBACfR,EAAQI,WAAa,IAAIK,eAAgB,EAC1CT,EAAQI,WAAWE,aAAe,GAE/BN,EAAQU,gBACXV,EAAQW,YAAc,WAGxBC,OAAOC,OAAOC,KAAMd,EACpB,CACDe,OAAOC,EAAQhB,GACd,GAAIxB,EAEH,OAAOyC,GAAU,KAChBC,IACOJ,KAAOA,KAAKC,OAAOC,EAAQhB,GAAWF,EAAQqB,UAAUJ,OAAOK,KAAK9B,EAAgB0B,EAAQhB,MAGhGgB,EAAOK,QAAUL,EAAOjB,cAAgBuB,cAC5CN,EAA2B,oBAAXO,OAAyBA,OAAOC,KAAKR,GAAU,IAAIS,WAAWT,IACxD,iBAAZhB,GACVvB,EAASuB,EAAQ0B,KAAOV,EAAOT,OAC/BtB,EAAWe,EAAQ2B,OAAS,IAE5B1C,EAAW,EACXR,EAASuB,GAAW,EAAIA,EAAUgB,EAAOT,QAG1CnB,EAAe,EACfP,EAAY,KAEZC,EAAiB,KACjBN,EAAMwC,EAIN,IACChC,EAAWgC,EAAOhC,WAAagC,EAAOhC,SAAW,IAAI4C,SAASZ,EAAOK,OAAQL,EAAOa,WAAYb,EAAOc,YAOvG,CANC,MAAMnD,GAGP,GADAH,EAAM,KACFwC,aAAkBS,WACrB,MAAM9C,EACP,MAAM,IAAIoD,MAAM,oDAAuDf,GAA2B,iBAAVA,EAAsBA,EAAOjB,YAAYJ,YAAcqB,GAC/I,CACD,GAAIF,gBAAgBhB,EAAS,CAE5B,GADAZ,EAAiB4B,KACbA,KAAKV,WAER,OADAxB,EAAoBkC,KAAKV,WAClB4B,EAAYhC,KACRpB,GAAqBA,EAAkB2B,OAAS,KAC3D3B,EAAoB,GAExB,MACGM,EAAiBI,IACZV,GAAqBA,EAAkB2B,OAAS,KACpD3B,EAAoB,IAEtB,OAAOoD,EAAYhC,EACnB,CACDiC,eAAejB,EAAQkB,GACtB,IAAIC,EAAQC,EAAe,EAC3B,IACCxC,GAAiB,EACjB,IAAIyC,EAAOrB,EAAOT,OACd+B,EAAQxB,KAAOA,KAAKC,OAAOC,EAAQqB,GAAQE,EAAexB,OAAOC,EAAQqB,GAC7E,IAAIH,EASC,CAEJ,IADAC,EAAS,CAAEG,GACLrD,EAAWoD,GAChBD,EAAenD,EACfkD,EAAOK,KAAKR,KAEb,OAAOG,CACP,CAfA,IAA+C,IAA3CD,EAAQI,EAAOF,EAAcnD,GAAqB,OACtD,KAAMA,EAAWoD,GAEhB,GADAD,EAAenD,GACwC,IAAnDiD,EAAQF,IAAeI,EAAcnD,GACxC,MAmBH,CAPC,MAAMN,GAGP,MAFAA,EAAMyD,aAAeA,EACrBzD,EAAMwD,OAASA,EACTxD,CACT,CAAY,QACTiB,GAAiB,EACjBsB,GACA,CACD,CACDuB,iBAAiBC,EAAkBC,GAC9B7B,KAAK8B,sBACRF,EAAmB5B,KAAK8B,oBAAoBF,IAC7CA,EAAmBA,GAAoB,GACnC9B,OAAOiC,SAASH,KACnBA,EAAmBA,EAAiBI,KAAIC,GAAaA,EAAUC,MAAM,MACtE,IAAK,IAAIC,EAAI,EAAGC,EAAIR,EAAiBnC,OAAQ0C,EAAIC,EAAGD,IAAK,CACxD,IAAIF,EAAYL,EAAiBO,GAC7BF,IACHA,EAAUI,UAAW,EACjBF,GAAK,KACRF,EAAUK,SAAYH,EAAI,IAAO,GAEnC,CACDP,EAAiBpC,aAAeoC,EAAiBnC,OACjD,IAAK,IAAI8C,KAAMV,GAAsB,GACpC,GAAIU,GAAM,EAAG,CACZ,IAAIN,EAAYL,EAAiBW,GAC7BC,EAAWX,EAAmBU,GAC9BC,IACCP,KACFL,EAAiBa,oBAAsBb,EAAiBa,kBAAoB,KAAKF,GAAMN,GACzFL,EAAiBW,GAAMC,EAExB,CAEF,OAAOxC,KAAKV,WAAasC,CACzB,CACDc,OAAOxC,EAAQhB,GACd,OAAOc,KAAKC,OAAOC,EAAQhB,EAC3B,EAKK,SAASgC,EAAYhC,GAC3B,IACC,IAAKd,EAAeiB,UAAYP,EAAgB,CAC/C,IAAIU,EAAe1B,EAAkB0B,cAAgB,EACjDA,EAAe1B,EAAkB2B,SACpC3B,EAAkB2B,OAASD,EAC5B,CACD,IAAImD,EAkBJ,GAjBIvE,EAAewE,aAAelF,EAAIS,GAAY,IAAQT,EAAIS,IAAa,IAC1EwE,EAASvE,EAAewE,YAAYlF,EAAKS,EAAUR,GACnDD,EAAM,KACAwB,GAAWA,EAAQ2D,OAASF,IACjCA,EAASA,EAAOG,UACjB3E,EAAWR,GAEXgF,EAASI,IACN/E,IACHG,EAAWH,EAAegF,mBAC1BhF,EAAiB,MAEdc,IAGHhB,EAAkB2E,kBAAoB,MAEnCtE,GAAYR,EAEXG,GAAqBA,EAAkB2E,mBAC1CA,IACD3E,EAAoB,KACpBJ,EAAM,KACFO,IACHA,EAAe,UACV,IAAIE,EAAWR,EAErB,MAAM,IAAIsD,MAAM,sCACV,IAAKnC,EAAgB,CAC3B,IAAImE,EACJ,IACCA,EAAWC,KAAKC,UAAUR,GAAQ,CAACS,EAAG5B,IAA2B,iBAAVA,EAAqB,GAAGA,KAAWA,IAAOU,MAAM,EAAG,IAG1G,CAFC,MAAMrE,GACPoF,EAAW,4BAA8BpF,EAAQ,GACjD,CACD,MAAM,IAAIoD,MAAM,4CAA8CgC,EAC9D,EAED,OAAON,CASP,CARC,MAAM9E,GAOP,MANIC,GAAqBA,EAAkB2E,mBAC1CA,IACDrC,KACIvC,aAAiBwF,YAAcxF,EAAMyF,QAAQC,WAAW,6BAA+BpF,EAAWR,KACrGE,EAAM2F,YAAa,GAEd3F,CACN,CACF,CAEA,SAAS4E,IACR,IAAK,IAAIF,KAAMzE,EAAkB2E,kBAChC3E,EAAkByE,GAAMzE,EAAkB2E,kBAAkBF,GAE7DzE,EAAkB2E,kBAAoB,IACvC,CAEO,SAASM,IACf,IAAIU,EAAQ/F,EAAIS,KAChB,GAAIsF,EAAQ,IAAM,CACjB,GAAIA,EAAQ,IAAM,CACjB,GAAIA,EAAQ,GACX,OAAOA,EACH,CACJ,IAAIxB,EAAYnE,EAA0B,GAAR2F,IACjCrF,EAAesB,eAAiBgE,IAAyB,GAARD,GAClD,OAAIxB,GACEA,EAAUc,OACdd,EAAUc,KAAOY,EAAsB1B,EAAmB,GAARwB,IAE5CxB,EAAUc,QAEVU,CACR,CACJ,CAAS,GAAIA,EAAQ,IAAM,CAGxB,GADAA,GAAS,IACLrF,EAAeM,cAAe,CACjC,IAAIkF,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGA,EAAIsB,EAAOtB,IAAK,CAC/B,IAAI0B,EAAMC,IACE,cAARD,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAOa,CACX,CAAU,CACN,IAAI5B,EAAM,IAAI+B,IACd,IAAK,IAAI5B,EAAI,EAAGA,EAAIsB,EAAOtB,IAC1BH,EAAIgC,IAAIjB,IAAQA,KAEjB,OAAOf,CACP,CACJ,CAAS,CACNyB,GAAS,IACT,IAAIQ,EAAQ,IAAIC,MAAMT,GACtB,IAAK,IAAItB,EAAI,EAAGA,EAAIsB,EAAOtB,IAC1B8B,EAAM9B,GAAKY,IAEZ,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOH,GACfA,CACP,CACH,CAAQ,GAAIR,EAAQ,IAAM,CAExB,IAAIhE,EAASgE,EAAQ,IACrB,GAAInF,GAAgBH,EACnB,OAAOJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYsB,GAAUpB,GAE1E,GAAoB,GAAhBC,GAAqBX,EAAS,IAAK,CAEtC,IAAI0G,EAAS5E,EAAS,GAAK6E,EAAgB7E,GAAU8E,EAAe9E,GACpE,GAAc,MAAV4E,EACH,OAAOA,CACR,CACD,OAAOG,EAAgB/E,EACzB,CAAQ,CACN,IAAI+B,EACJ,OAAQiC,GACP,KAAK,IAAM,OAAO,KAClB,KAAK,IACJ,OAAIzF,GACHwD,EAAQuB,IACJvB,EAAQ,EACJxD,EAAe,GAAGkE,MAAMlE,EAAeyG,UAAWzG,EAAeyG,WAAajD,GAE9ExD,EAAe,GAAGkE,MAAMlE,EAAe0G,UAAW1G,EAAe0G,WAAalD,IAEhF5C,EACR,KAAK,IAAM,OAAO,EAClB,KAAK,IAAM,OAAO,EAClB,KAAK,IAGJ,GADA4C,EAAQ9D,EAAIS,UACEgB,IAAVqC,EACH,MAAM,IAAIP,MAAM,4BACjB,OAAO0D,EAAQnD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLwG,EAAQnD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLwG,EAAQnD,GAChB,KAAK,IAEJ,OAAOsD,EAAQpH,EAAIS,MACpB,KAAK,IAIJ,OAFAqD,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACL2G,EAAQtD,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACL2G,EAAQtD,GAChB,KAAK,IAEJ,GADAA,EAAQtD,EAAS6G,WAAW5G,GACxBC,EAAe4G,WAAa,EAAG,CAElC,IAAIC,EAAaC,GAAyB,IAAhBxH,EAAIS,KAAqB,EAAMT,EAAIS,EAAW,IAAM,GAE9E,OADAA,GAAY,GACH8G,EAAazD,GAASA,EAAQ,EAAI,IAAO,KAAS,GAAKyD,CAChE,CAED,OADA9G,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAASiH,WAAWhH,GAC5BA,GAAY,EACLqD,EAER,KAAK,IACJ,OAAO9D,EAAIS,KACZ,KAAK,IAGJ,OAFAqD,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLqD,EACR,KAAK,IAYJ,MAXmC,WAA/BpD,EAAeyB,aAClB2B,EAAuC,WAA/BtD,EAAS2G,UAAU1G,GAC3BqD,GAAStD,EAAS2G,UAAU1G,EAAW,IACE,WAA/BC,EAAeyB,YACzB2B,EAAQtD,EAASkH,aAAajH,GAAUkH,WACC,SAA/BjH,EAAeyB,aACzB2B,EAAQtD,EAASkH,aAAajH,GAC1BqD,GAAO8D,OAAO,IAAIA,OAAO,MAAK9D,EAAM+D,OAAO/D,KAE/CA,EAAQtD,EAASkH,aAAajH,GAC/BA,GAAY,EACLqD,EAGR,KAAK,IACJ,OAAOtD,EAASsH,QAAQrH,KACzB,KAAK,IAGJ,OAFAqD,EAAQtD,EAASuH,SAAStH,GAC1BA,GAAY,EACLqD,EACR,KAAK,IAGJ,OAFAA,EAAQtD,EAASwH,SAASvH,GAC1BA,GAAY,EACLqD,EACR,KAAK,IAYJ,MAXmC,WAA/BpD,EAAeyB,aAClB2B,EAAsC,WAA9BtD,EAASwH,SAASvH,GAC1BqD,GAAStD,EAAS2G,UAAU1G,EAAW,IACE,WAA/BC,EAAeyB,YACzB2B,EAAQtD,EAASyH,YAAYxH,GAAUkH,WACE,SAA/BjH,EAAeyB,aACzB2B,EAAQtD,EAASyH,YAAYxH,GACzBqD,GAAO8D,QAAQ,IAAIA,OAAO,KAAK9D,GAAO8D,OAAO,IAAIA,OAAO,MAAK9D,EAAM+D,OAAO/D,KAE9EA,EAAQtD,EAASyH,YAAYxH,GAC9BA,GAAY,EACLqD,EAER,KAAK,IAGJ,GADAA,EAAQ9D,EAAIS,KACC,KAATqD,EACH,OAAOoE,EAAmC,GAAlBlI,EAAIS,MACtB,CACN,IAAI0H,EAAYtH,EAAkBiD,GAClC,GAAIqE,EACH,OAAIA,EAAU9C,MACb5E,IACO0H,EAAU9C,KAAKA,MACZ8C,EAAUC,UACpB3H,IACO0H,KAEAA,EAAUnI,EAAIqI,SAAS5H,IAAYA,IAE3C,MAAM,IAAI8C,MAAM,qBAAuBO,EACxC,CACF,KAAK,IAGJ,OADAA,EAAQ9D,EAAIS,GACC,KAATqD,GACHrD,IACOyH,EAAmC,GAAlBlI,EAAIS,KAAoBT,EAAIS,OAE7C2G,EAAQ,GACjB,KAAK,IAEJ,OAAOA,EAAQ,GAChB,KAAK,IAEJ,OAAOA,EAAQ,GAChB,KAAK,IAEJ,OAAOA,EAAQ,IAChB,KAAK,IAGJ,OADAtD,EAAQ9D,EAAIS,KACRG,GAAgBH,EACZJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE2H,EAAYxE,GACpB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAEvBG,IADJH,GAAY,GAEJJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE4H,EAAazE,GACrB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAEvBG,IADJH,GAAY,GAEJJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYqD,GAASnD,GAElE6H,EAAa1E,GACrB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLgI,EAAU3E,GAClB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLgI,EAAU3E,GAClB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS0G,UAAUzG,GAC3BA,GAAY,EACLiI,EAAQ5E,GAChB,KAAK,IAIJ,OAFAA,EAAQtD,EAAS2G,UAAU1G,GAC3BA,GAAY,EACLiI,EAAQ5E,GAChB,QACC,GAAIiC,GAAS,IACZ,OAAOA,EAAQ,IAChB,QAActE,IAAVsE,EAAqB,CACxB,IAAI5F,EAAQ,IAAIoD,MAAM,sCAEtB,MADApD,EAAM2F,YAAa,EACb3F,CACN,CACD,MAAM,IAAIoD,MAAM,6BAA+BwC,GAGjD,CACF,CACA,MAAM4C,EAAY,4BAClB,SAAS1C,EAAsB1B,EAAWqE,GACzC,SAASC,IAER,GAAIA,EAAWC,QAAUzH,EAA2B,CACnD,IAAI0H,EACJ,IACCA,EAAsBxE,EAAUc,KAAO,IAAK2D,SAAS,IAAK,6BAA+BtI,EAAe+F,WAAa,gBAAkB,IACtI,KAAOlC,EAAUD,KAAI6B,GAAe,cAARA,EAAsB,eAAiBwC,EAAUM,KAAK9C,GAAOA,EAAM,OAAU,IAAMX,KAAKC,UAAUU,GAAO,UAAU+C,KAAK,KAAO,MADrH,CAC6H7D,EAKpK,CAJC,MAAMlF,GAGP,OADAkB,EAA4B8H,IACrBN,GACP,CAGD,OAF2B,IAAvBtE,EAAUK,WACbL,EAAUc,KAAO+D,EAAuBR,EAASrE,EAAUc,OACrD0D,GACP,CACD,IAAI7C,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGC,EAAIH,EAAUxC,OAAQ0C,EAAIC,EAAGD,IAAK,CACjD,IAAI0B,EAAM5B,EAAUE,GACR,cAAR0B,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOR,GACfA,CACP,CAED,OADA2C,EAAWC,MAAQ,EACQ,IAAvBvE,EAAUK,SACNwE,EAAuBR,EAASC,GAEjCA,CACR,CAEA,MAAMO,EAAyB,CAACR,EAASS,IACjC,WACN,IAAIzE,EAAW5E,EAAIS,KACnB,GAAiB,IAAbmE,EACH,OAAOyE,IACR,IAAIxE,EAAK+D,EAAU,KAAOA,GAAWhE,GAAY,IAAMgE,GAAWhE,GAAY,GAC1EL,EAAYnE,EAAkByE,IAAOmB,IAAiBnB,GAC1D,IAAKN,EACJ,MAAM,IAAIhB,MAAM,gCAAkCsB,GAInD,OAFKN,EAAUc,OACdd,EAAUc,KAAOY,EAAsB1B,EAAWqE,IAC5CrE,EAAUc,MACnB,EAGO,SAASW,IACf,IAAI9B,EAAmBzB,GAAU,KAEhCzC,EAAM,KACCU,EAAesB,mBAEvB,OAAO5B,EAAoBM,EAAeuD,iBAAiBC,EAAkB9D,EAC9E,CAEA,IAAI0G,EAAkBwC,EAClBhB,EAAcgB,EACdf,EAAee,EACfd,EAAec,EA0CnB,SAASA,EAAavH,GACrB,IAAIkD,EACJ,GAAIlD,EAAS,KACRkD,EAAS2B,EAAgB7E,IAC5B,OAAOkD,EAET,GAAIlD,EAAS,IAAMhC,EAClB,OAAOA,EAAQiF,OAAOhF,EAAIqI,SAAS5H,EAAUA,GAAYsB,IAC1D,MAAMmB,EAAMzC,EAAWsB,EACjBwH,EAAQ,GAEd,IADAtE,EAAS,GACFxE,EAAWyC,GAAK,CACtB,MAAMsG,EAAQxJ,EAAIS,KAClB,GAAuB,IAAV,IAAR+I,GAEJD,EAAMvF,KAAKwF,QACL,GAAuB,MAAV,IAARA,GAAwB,CAEnC,MACMC,GAAsB,GAARD,IAAiB,EADL,GAAlBxJ,EAAIS,KAGdgJ,EAAY,IACfF,EAAMvF,KAAK,OAEXuF,EAAMvF,KAAKyF,EAEZ,MAAM,GAAuB,MAAV,IAARD,GAAwB,CAEnC,MAEMC,GAAsB,GAARD,IAAiB,IAFL,GAAlBxJ,EAAIS,OAEmC,EADrB,GAAlBT,EAAIS,KAIdgJ,EAAY,MAAUA,GAAa,OAAUA,GAAa,MAC7DF,EAAMvF,KAAK,OAEXuF,EAAMvF,KAAKyF,EAEZ,MAAM,GAAuB,MAAV,IAARD,GAAwB,CAKnC,IAAIE,GAAiB,EAARF,IAAiB,IAHE,GAAlBxJ,EAAIS,OAG8B,IAFhB,GAAlBT,EAAIS,OAEgD,EADlC,GAAlBT,EAAIS,KAIdiJ,EAAO,OAAWA,EAAO,QAC5BH,EAAMvF,KAAK,OACD0F,EAAO,OACjBA,GAAQ,MACRH,EAAMvF,KAAO0F,IAAS,GAAM,KAAS,OACrCA,EAAO,MAAiB,KAAPA,EACjBH,EAAMvF,KAAK0F,IAEXH,EAAMvF,KAAK0F,EAEf,MACGH,EAAMvF,KAAK,OAGRuF,EAAMxH,QAAU,OACnBkD,GAAU0E,EAAaC,MAAMC,OAAQN,GACrCA,EAAMxH,OAAS,EAEhB,CAMD,OAJIwH,EAAMxH,OAAS,IAClBkD,GAAU0E,EAAaC,MAAMC,OAAQN,IAG/BtE,CACR,CAYA,SAASwD,EAAU1G,GAClB,IAAIwE,EAAQ,IAAIC,MAAMzE,GACtB,IAAK,IAAI0C,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3B8B,EAAM9B,GAAKY,IAEZ,OAAI3E,EAAe+F,WACXrE,OAAOsE,OAAOH,GACfA,CACR,CAEA,SAASmC,EAAQ3G,GAChB,GAAIrB,EAAeM,cAAe,CACjC,IAAIkF,EAAS,CAAA,EACb,IAAK,IAAIzB,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC,IAAI0B,EAAMC,IACE,cAARD,IACHA,EAAM,YACPD,EAAOC,GAAOd,GACd,CACD,OAAOa,CACT,CAAQ,CACN,IAAI5B,EAAM,IAAI+B,IACd,IAAK,IAAI5B,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3BH,EAAIgC,IAAIjB,IAAQA,KAEjB,OAAOf,CACP,CACF,CAEA,IAAIqF,EAAeE,OAAOF,aAC1B,SAAS9C,EAAe9E,GACvB,IAAIoB,EAAQ1C,EACRqJ,EAAQ,IAAItD,MAAMzE,GACtB,IAAK,IAAI0C,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC,MAAMsF,EAAO/J,EAAIS,KACjB,IAAY,IAAPsJ,GAAe,EAElB,YADAtJ,EAAW0C,GAGZ2G,EAAMrF,GAAKsF,CACX,CACD,OAAOJ,EAAaC,MAAMC,OAAQC,EACpC,CACA,SAASlD,EAAgB7E,GACxB,GAAIA,EAAS,EAAG,CACf,GAAIA,EAAS,EAAG,CACf,GAAe,IAAXA,EACH,MAAO,GACH,CACJ,IAAIiI,EAAIhK,EAAIS,KACZ,OAAS,IAAJuJ,GAAY,OAChBvJ,GAAY,GAGNkJ,EAAaK,EACpB,CACJ,CAAS,CACN,IAAIA,EAAIhK,EAAIS,KACRwJ,EAAIjK,EAAIS,KACZ,IAAS,IAAJuJ,GAAY,IAAU,IAAJC,GAAY,EAElC,YADAxJ,GAAY,GAGb,GAAIsB,EAAS,EACZ,OAAO4H,EAAaK,EAAGC,GACxB,IAAIC,EAAIlK,EAAIS,KACZ,OAAS,IAAJyJ,GAAY,OAChBzJ,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAC1B,CACH,CAAQ,CACN,IAAIF,EAAIhK,EAAIS,KACRwJ,EAAIjK,EAAIS,KACRyJ,EAAIlK,EAAIS,KACR0J,EAAInK,EAAIS,KACZ,IAAS,IAAJuJ,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,EAEtE,YADA1J,GAAY,GAGb,GAAIsB,EAAS,EAAG,CACf,GAAe,IAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,GACzB,CACJ,IAAIC,EAAIpK,EAAIS,KACZ,OAAS,IAAJ2J,GAAY,OAChB3J,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAChC,CACJ,CAAS,GAAIrI,EAAS,EAAG,CACtB,IAAIqI,EAAIpK,EAAIS,KACR4J,EAAIrK,EAAIS,KACZ,IAAS,IAAJ2J,GAAY,IAAU,IAAJC,GAAY,EAElC,YADA5J,GAAY,GAGb,GAAIsB,EAAS,EACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACpC,IAAIC,EAAItK,EAAIS,KACZ,OAAS,IAAJ6J,GAAY,OAChB7J,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACzC,CAAS,CACN,IAAIF,EAAIpK,EAAIS,KACR4J,EAAIrK,EAAIS,KACR6J,EAAItK,EAAIS,KACR8J,EAAIvK,EAAIS,KACZ,IAAS,IAAJ2J,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJC,GAAY,EAEtE,YADA9J,GAAY,GAGb,GAAIsB,EAAS,GAAI,CAChB,GAAe,IAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrC,CACJ,IAAI9F,EAAIzE,EAAIS,KACZ,OAAS,IAAJgE,GAAY,OAChBhE,GAAY,GAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAC5C,CACL,CAAU,GAAI1C,EAAS,GAAI,CACvB,IAAI0C,EAAIzE,EAAIS,KACR+J,EAAIxK,EAAIS,KACZ,IAAS,IAAJgE,GAAY,IAAU,IAAJ+F,GAAY,EAElC,YADA/J,GAAY,IAGb,GAAIsB,EAAS,GACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,GAChD,IAAIC,EAAIzK,EAAIS,KACZ,OAAS,IAAJgK,GAAY,OAChBhK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EACtD,CAAU,CACN,IAAIhG,EAAIzE,EAAIS,KACR+J,EAAIxK,EAAIS,KACRgK,EAAIzK,EAAIS,KACRiE,EAAI1E,EAAIS,KACZ,IAAS,IAAJgE,GAAY,IAAU,IAAJ+F,GAAY,IAAU,IAAJC,GAAY,IAAU,IAAJ/F,GAAY,EAEtE,YADAjE,GAAY,IAGb,GAAIsB,EAAS,GAAI,CAChB,GAAe,KAAXA,EACH,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,GACjD,CACJ,IAAIgG,EAAI1K,EAAIS,KACZ,OAAS,IAAJiK,GAAY,OAChBjK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EACxD,CACN,CAAW,CACN,IAAIA,EAAI1K,EAAIS,KACRkK,EAAI3K,EAAIS,KACZ,IAAS,IAAJiK,GAAY,IAAU,IAAJC,GAAY,EAElC,YADAlK,GAAY,IAGb,GAAIsB,EAAS,GACZ,OAAO4H,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EAAGC,GAC5D,IAAIC,EAAI5K,EAAIS,KACZ,OAAS,IAAJmK,GAAY,OAChBnK,GAAY,IAGNkJ,EAAaK,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAG9F,EAAG+F,EAAGC,EAAG/F,EAAGgG,EAAGC,EAAGC,EAC9D,CACD,CACD,CACD,CACF,CAEA,SAASC,IACR,IACI9I,EADAgE,EAAQ/F,EAAIS,KAEhB,GAAIsF,EAAQ,IAEXhE,EAASgE,EAAQ,SAEjB,OAAOA,GACN,KAAK,IAEJhE,EAAS/B,EAAIS,KACb,MACD,KAAK,IAEJsB,EAASvB,EAAS0G,UAAUzG,GAC5BA,GAAY,EACZ,MACD,KAAK,IAEJsB,EAASvB,EAAS2G,UAAU1G,GAC5BA,GAAY,EACZ,MACD,QACC,MAAM,IAAI8C,MAAM,mBAGnB,OAAO+F,EAAavH,EACrB,CAGA,SAASkF,EAAQlF,GAChB,OAAOrB,EAAeoK,YAErB7H,WAAWN,UAAU6B,MAAM5B,KAAK5C,EAAKS,EAAUA,GAAYsB,GAC3D/B,EAAIqI,SAAS5H,EAAUA,GAAYsB,EACrC,CACA,SAASqF,EAAQrF,GAChB,IAAIgJ,EAAO/K,EAAIS,KACf,GAAII,EAAkBkK,GAAO,CAC5B,IAAI7H,EACJ,OAAOrC,EAAkBkK,GAAM/K,EAAIqI,SAAS5H,EAAUyC,EAAOzC,GAAYsB,IAAWiJ,IACnFvK,EAAWuK,EACX,IACC,OAAO3F,GAGP,CAFS,QACT5E,EAAWyC,CACX,IAEF,CAEA,MAAM,IAAIK,MAAM,0BAA4BwH,EAC9C,CAEA,IAAIE,EAAW,IAAIzE,MAAM,MACzB,SAASJ,IACR,IAAIrE,EAAS/B,EAAIS,KACjB,KAAIsB,GAAU,KAAQA,EAAS,KAS9B,OADAtB,IACOyK,EAAa7F,KANpB,GADAtD,GAAkB,IACdnB,GAAgBH,EACnB,OAAOJ,EAAUmE,MAAM/D,EAAWE,GAAiBF,GAAYsB,GAAUpB,GACrE,KAAsB,GAAhBC,GAAqBX,EAAS,KACxC,OAAO6G,EAAgB/E,GAKzB,IAIIoJ,EAJAhF,EAAuG,MAA/FpE,GAAU,GAAMA,EAAS,EAAIvB,EAAS0G,UAAUzG,GAAYsB,EAAS,EAAI/B,EAAIS,GAAY,IACjG2K,EAAQH,EAAS9E,GACjBkF,EAAgB5K,EAChByC,EAAMzC,EAAWsB,EAAS,EAE1B0C,EAAI,EACR,GAAI2G,GAASA,EAAMtB,OAAS/H,EAAQ,CACnC,KAAOsJ,EAAgBnI,GAAK,CAE3B,GADAiI,EAAQ3K,EAAS2G,UAAUkE,GACvBF,GAASC,EAAM3G,KAAM,CACxB4G,EAAgB,WAChB,KACA,CACDA,GAAiB,CACjB,CAED,IADAnI,GAAO,EACAmI,EAAgBnI,GAEtB,GADAiI,EAAQnL,EAAIqL,KACRF,GAASC,EAAM3G,KAAM,CACxB4G,EAAgB,WAChB,KACA,CAEF,GAAIA,IAAkBnI,EAErB,OADAzC,EAAW4K,EACJD,EAAMzE,OAEdzD,GAAO,EACPmI,EAAgB5K,CAChB,CAID,IAHA2K,EAAQ,GACRH,EAAS9E,GAAOiF,EAChBA,EAAMtB,MAAQ/H,EACPsJ,EAAgBnI,GACtBiI,EAAQ3K,EAAS2G,UAAUkE,GAC3BD,EAAMpH,KAAKmH,GACXE,GAAiB,EAGlB,IADAnI,GAAO,EACAmI,EAAgBnI,GACtBiI,EAAQnL,EAAIqL,KACZD,EAAMpH,KAAKmH,GAGZ,IAAIxE,EAAS5E,EAAS,GAAK6E,EAAgB7E,GAAU8E,EAAe9E,GACpE,OACQqJ,EAAMzE,OADA,MAAVA,EACmBA,EACDG,EAAgB/E,EACvC,CAEA,SAASmJ,EAAaI,GAErB,GAAwB,iBAAbA,EAAuB,OAAOA,EACzC,GAAwB,iBAAbA,GAA6C,kBAAbA,GAA8C,iBAAbA,EAAuB,OAAOA,EAAS3D,WACnH,GAAgB,MAAZ2D,EAAkB,OAAOA,EAAW,GACxC,GAAI5K,EAAe6K,sBAAwB/E,MAAMgF,QAAQF,IAAaA,EAASG,OAAOC,OAAMC,GAAQ,CAAC,SAAU,SAAU,UAAW,UAAUC,gBAAgBD,KAC7J,OAAOL,EAASG,OAAO9D,WAExB,MAAM,IAAIpE,MAAM,4CAA4C+H,EAC7D,CAEA,MAAMpD,EAAmB,CAACrD,EAAID,KAC7B,IAAIL,EAAYc,IAAOf,IAAI4G,GAEvBW,EAAYhH,OACCpD,IAAbmD,IACHC,EAAKA,EAAK,MAAQD,GAAY,GAAKC,IAAQD,GAAY,GAAKC,EAC5DN,EAAUK,SAAWA,GAEtB,IAAIkH,EAAoB1L,EAAkByE,GAS1C,OALIiH,IAAsBA,EAAkBnH,UAAYvD,MACtDhB,EAAkB2E,oBAAsB3E,EAAkB2E,kBAAoB,KAAKF,GAAMiH,GAE3F1L,EAAkByE,GAAMN,EACxBA,EAAUc,KAAOY,EAAsB1B,EAAWsH,GAC3CtH,EAAUc,MAAM,EAExBxE,EAAkB,GAAK,OACvBA,EAAkB,GAAGuH,UAAW,EAEhCvH,EAAkB,IAAQkL,IACzB,IAAIC,EAAcD,EAAKzI,WAAa,GAAM,EACtC2I,EAAOrE,OAAiB,IAAVmE,EAAK,GAAYA,EAAK,GAAK,IAAQA,EAAK,IAC1D,IAAK,IAAItH,EAAI,EAAGA,EAAIuH,EAAYvH,IAC/BwH,IAASrE,OAAO,GAChBqE,GAAQrE,OAAOmE,EAAKtH,IAErB,GAAIsH,EAAKzI,aAAe0I,EAAY,CACnC,IAAIE,EAAO,IAAI9I,SAAS2I,EAAKlJ,OAAQkJ,EAAK1I,WAAY0I,EAAKzI,YACvD0B,EAAS,CAAC7B,EAAOD,KACpB,IAAInB,EAASmB,EAAMC,EACnB,GAAIpB,GAAU,GAAI,CACjB,IAAIoK,EAAMD,EAAKxE,aAAavE,GAC5B,IAAK,IAAIsB,EAAItB,EAAQ,EAAGsB,EAAIvB,EAAKuB,GAAK,EACrC0H,IAAQvE,OAAO,IACfuE,GAAOD,EAAKxE,aAAajD,GAE1B,OAAO0H,CACP,CAED,IAAIC,EAASjJ,GAASpB,GAAU,GAAK,GACjCsK,EAAOrH,EAAO7B,EAAOiJ,GACrBE,EAAQtH,EAAOoH,EAAQlJ,GAC3B,OAAQmJ,GAAQzE,OAAwB,GAAhB1E,EAAMkJ,IAAgBE,CAAK,EAEpDL,EAAQA,GAAQrE,OAAwC,GAAhCsE,EAAK5I,WAAa0I,IAAoBhH,EAAOgH,EAAYE,EAAK5I,WACtF,CACD,OAAO2I,CAAI,EAGZ,IAAIM,EAAS,CACZhJ,YAAOiJ,oBAAW7G,sBAAY8G,8BAAgBC,wBAAaC,oBAAWC,kBAAUC,eAA0C,mBAAnBA,eAAgCA,eAAiB,MAEzJhM,EAAkB,KAAQ,KACzB,IAAIkL,EAAO1G,IACX,IAAKkH,EAAOR,EAAK,IAAK,CACrB,IAAI5L,EAAQoD,MAAMwI,EAAK,GAAI,CAAEe,MAAOf,EAAK,KAEzC,OADA5L,EAAMgB,KAAO4K,EAAK,GACX5L,CACP,CACD,OAAOoM,EAAOR,EAAK,IAAIA,EAAK,GAAI,CAAEe,MAAOf,EAAK,IAAK,EAGpDlL,EAAkB,KAASkL,IAE1B,IAAuC,IAAnCrL,EAAeqM,gBAA2B,MAAM,IAAIxJ,MAAM,0CAC9D,IAAIsB,EAAKrE,EAAS2G,UAAU1G,EAAW,GAClCF,IACJA,EAAe,IAAI8F,KACpB,IACI2G,EADAjH,EAAQ/F,EAAIS,GAIfuM,EADGjH,GAAS,KAAQA,EAAQ,KAAiB,KAATA,GAA0B,KAATA,EAC5C,GACDA,GAAS,KAAQA,EAAQ,KAAiB,KAATA,GAA0B,KAATA,EACjD,IAAIM,KACJN,GAAS,KAAQA,GAAS,KAAQA,GAAS,KAAQA,GAAS,MAA+B,MAAtB/F,EAAIS,EAAW,GACpF,IAAIwM,IAEJ,CAAA,EAEV,IAAIC,EAAW,CAAEF,UACjBzM,EAAa+F,IAAIzB,EAAIqI,GACrB,IAAIC,EAAmB9H,IACvB,IAAK6H,EAASE,KAEb,OAAOF,EAASF,OAASG,EAO1B,GAJC/K,OAAOC,OAAO2K,EAAQG,GAInBH,aAAkB3G,IACrB,IAAK,IAAKoE,EAAG4C,KAAMF,EAAiBG,UAAWN,EAAO1G,IAAImE,EAAG4C,GAC9D,GAAIL,aAAkBC,IACrB,IAAK,IAAIxI,KAAK+B,MAAMxD,KAAKmK,GAAmBH,EAAOO,IAAI9I,GACxD,OAAOuI,CAAM,EAGdnM,EAAkB,KAASkL,IAE1B,IAAuC,IAAnCrL,EAAeqM,gBAA2B,MAAM,IAAIxJ,MAAM,0CAC9D,IAAIsB,EAAKrE,EAAS2G,UAAU1G,EAAW,GACnCyM,EAAW3M,EAAaiN,IAAI3I,GAEhC,OADAqI,EAASE,MAAO,EACTF,EAASF,MAAM,EAGvBnM,EAAkB,KAAQ,IAAM,IAAIoM,IAAI5H,KAEjC,MAAMoI,EAAc,CAAC,OAAO,QAAQ,eAAe,QAAQ,SAAS,QAAQ,SAAS,UAAU,UAAU,WAAW,aAAanJ,KAAIyG,GAAQA,EAAO,UAE3J,IAAI2C,EAA6B,iBAAfC,WAA0BA,WAAaC,OACzD/M,EAAkB,KAASkL,IAC1B,IAAI8B,EAAW9B,EAAK,GAEhBlJ,EAASI,WAAWN,UAAU6B,MAAM5B,KAAKmJ,EAAM,GAAGlJ,OAElDiL,EAAiBL,EAAYI,GACjC,IAAKC,EAAgB,CACpB,GAAiB,KAAbD,EAAiB,OAAOhL,EAC5B,GAAiB,KAAbgL,EAAiB,OAAO,IAAIzK,SAASP,GACzC,MAAM,IAAIU,MAAM,uCAAyCsK,EACzD,CACD,OAAO,IAAIH,EAAKI,GAAgBjL,EAAO,EAExChC,EAAkB,KAAQ,KACzB,IAAIkL,EAAO1G,IACX,OAAO,IAAI0I,OAAOhC,EAAK,GAAIA,EAAK,GAAG,EAEpC,MAAMiC,EAAc,GAgCpB,SAASvL,EAAUwL,GACdvN,GAAkBA,EAAewN,cACpCxN,EAAewN,eAChB,IAAIC,EAAclO,EACdmO,EAAgB3N,EAEhB4N,EAAsB1N,EACtB2N,EAAoB1N,EACpB2N,EAAiBlO,EAEjBmO,EAAoBjO,EACpBkO,EAAsBnO,EAGtBoO,EAAW,IAAIzL,WAAWjD,EAAIwE,MAAM,EAAGvE,IACvC0O,EAAkBvO,EAClBwO,EAA0BxO,EAAkBoE,MAAM,EAAGpE,EAAkB2B,QACvE8M,EAAanO,EACboO,EAAsB1N,EACtB0C,EAAQmK,IAgBZ,OAfAhO,EAASkO,EACT1N,EAAW2N,EAEXzN,EAAiB0N,EACjBzN,EAAe0N,EACfjO,EAAYkO,EAEZhO,EAAeiO,EACflO,EAAiBmO,EACjBzO,EAAM0O,EACNtN,EAAiB0N,GACjB1O,EAAoBuO,GACFI,OAAO,EAAG3O,EAAkB2B,UAAW6M,GACzDlO,EAAiBmO,EACjBrO,EAAW,IAAI4C,SAASpD,EAAI6C,OAAQ7C,EAAIqD,WAAYrD,EAAIsD,YACjDQ,CACR,CACO,SAASpB,IACf1C,EAAM,KACNO,EAAe,KACfH,EAAoB,IACrB,CAxEAS,EAAkB,IAASkL,IAC1B,IAAIiD,GAAYjD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,GACrEkD,EAAexO,EAQnB,OAPAA,GAAYuO,EAAWjD,EAAKhK,OAC5BzB,EAAiB0N,GACjB1N,EAAiB,CAACuK,IAAoBA,MACvB7D,UAAY,EAC3B1G,EAAeyG,UAAY,EAC3BzG,EAAegF,mBAAqB7E,EACpCA,EAAWwO,EACJ5J,GAAM,EAGdxE,EAAkB,KAASkL,GAEP,GAAfA,EAAKhK,OACD,IAAImN,KAA0E,KAA1D,SAAVnD,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,KACxD,GAAfA,EAAKhK,OACN,IAAImN,OACRnD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,IAAMA,EAAK,IAAM,IAAM,IAC6B,KAAlF,YAAP,EAAVA,EAAK,IAAoC,SAAVA,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,KACzE,IAAfA,EAAKhK,OACN,IAAImN,OACRnD,EAAK,IAAM,KAAOA,EAAK,IAAM,KAAOA,EAAK,IAAM,GAAKA,EAAK,IAAM,IACoG,MAAxJ,IAAVA,EAAK,IAAc,gBAAkB,GAAe,cAAVA,EAAK,GAA+B,WAAVA,EAAK,GAA6B,SAAVA,EAAK,IAAkBA,EAAK,IAAM,KAAOA,EAAK,KAAO,GAAKA,EAAK,MAExJ,IAAImD,KAAK,WAuDX,MAAM1H,EAAS,IAAIhB,MAAM,KAChC,IAAK,IAAI/B,EAAI,EAAGA,EAAI,IAAKA,IACxB+C,EAAO/C,KAAO,KAAO0K,KAAKC,MAAM,MAAY,OAAJ3K,IAE5B,MAAA4K,EAAU/N,EACvB,IAAIyC,EAAiB,IAAIzC,EAAQ,CAAEP,YAAY,IACnC,MAACwB,EAASwB,EAAexB,OACxBkB,GAAiBM,EAAeN,eAChCuB,GAASjB,EAAexB,OACxB+M,GAAkB,CAC9BC,MAAO,EACPC,OAAQ,EACRC,cAAe,EACfC,YAAa,GAEd,IC1sCIC,GAIAC,GAAYC,GDssCZC,GAAW,IAAIC,aAAa,GAC5BC,GAAU,IAAI/M,WAAW6M,GAASjN,OAAQ,EAAG,GASjDvB,EAAQ2O,uBAAwB,ECntChC,IACCN,GAAc,IAAIO,WACD,CAAhB,MAAO/P,GAAS,CAElB,MAAMgQ,GAAkC,oBAAXpN,OACvBqN,GAAoBD,GACzB,SAASpO,GAAU,OAAOgB,OAAOsN,gBAAgBtO,EAAU,EAAGkB,WACzDqN,GAAYH,GAAgBpN,OAASE,WACrCsN,GAAkBJ,GAAgB,WAAc,WACtD,IAAInD,GAAQwD,GACRC,GAEAC,GADAjQ,GAAW,EAEXH,GAAiB,KACrB,MACMqQ,GAAc,kBACPC,GAAgBC,OAAO,aAC7B,MAAMC,WAAcxP,EAC1BC,YAAYC,GAIX,IAAI2B,EACA4N,EACAnP,EACArB,EANJyQ,MAAMxP,GACNc,KAAK2O,OAAS,EAMd,IAAIC,EAAaZ,GAAU3N,UAAUwO,UAAY,SAASxK,EAAQlG,GACjE,OAAOuM,GAAOmE,UAAUxK,EAAQlG,EAAUuM,GAAO1J,WAAa7C,EACjE,KAAOkP,KAAeA,GAAYyB,aAC/B,SAASzK,EAAQlG,GAChB,OAAOkP,GAAYyB,WAAWzK,EAAQqG,GAAO3E,SAAS5H,IAAW4Q,OACjE,EAEEC,EAAQhP,KACPd,IACJA,EAAU,CAAA,GACX,IAAI+P,EAAe/P,GAAWA,EAAQE,WAClC8P,EAAsBhQ,EAAQI,YAAcJ,EAAQiQ,eACpD5P,EAAsBL,EAAQK,oBAGlC,GAF2B,MAAvBA,IACHA,EAAsB2P,EAAsB,GAAK,GAC9C3P,EAAsB,KACzB,MAAM,IAAI0B,MAAM,sCACb/B,EAAQuL,iBAAwCtL,MAArBD,EAAQkQ,YACtCpP,KAAKoP,WAAY,GAElB,IAAIC,EAAmBnQ,EAAQmQ,iBACP,MAApBA,IACHA,EAAmBH,EAAsB,GAAK,IAC1ClP,KAAKV,YAAoC,GAAtBJ,EAAQT,aAC/BuB,KAAKV,WAAa,IAEnB,IAAIgQ,EAAoB/P,EAAsB,IAAO8P,EAAmB9P,EAAsB,GAC1FgQ,EAAgBhQ,EAAsB,GACtCiQ,EAAiBjQ,EAAsB8P,EAAmB,GAC9D,GAAIG,EAAiB,KACpB,MAAM,IAAIvO,MAAM,wDAEjB,IAAIwO,EAAoB,GACpBC,EAAmB,EACnBC,EAAuC,EAE3C3P,KAAK4P,KAAO5P,KAAK6P,OAAS,SAASrO,EAAOsO,GAwBzC,GAvBKpF,KACJA,GAAS,IAAIoD,GAAkB,MAC/BK,GAAazD,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQ,EAAG,OAClFpC,GAAW,GAEZiQ,GAAU1D,GAAOjL,OAAS,GACtB2O,GAAUjQ,GAAW,MAExBuM,GAAS,IAAIoD,GAAkBpD,GAAOjL,QACtC0O,GAAazD,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQ,EAAGmK,GAAOjL,SACzF2O,GAAU1D,GAAOjL,OAAS,GAC1BtB,GAAW,GAEXA,GAAYA,GAAW,EAAK,WAC7B0C,EAAQ1C,GACJ2R,EAAgBC,KAAqB5R,IAA6B,IAAhB2R,GACtD7R,EAAe+Q,EAAMvE,gBAAkB,IAAI1G,IAAQ,KAC/CiL,EAAMgB,eAAkC,iBAAVxO,GACjCxD,GAAiB,GACjBA,GAAeuD,KAAOsF,KAEtB7I,GAAiB,KAClBsB,EAAa0P,EAAM1P,WACfA,EAAY,CACXA,EAAWK,gBACdL,EAAa0P,EAAMrN,iBAAiBqN,EAAMtP,kBAC3C,IAAIF,EAAeF,EAAWE,cAAgB,EAC9C,GAAIA,EAAeD,EAElB,MAAM,IAAI0B,MAAM,qGAAuG3B,EAAWE,cAEnI,IAAKF,EAAW2Q,YAAa,CAE5B3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,MACvC,IAAK,IAAI/N,EAAI,EAAGA,EAAI3C,EAAc2C,IAAK,CACtC,IAAIgO,EAAO7Q,EAAW6C,GACtB,IAAKgO,EACJ,SACD,IAAIC,EAAgBC,EAAa/Q,EAAW2Q,YAC5C,IAAK,IAAI/H,EAAI,EAAG9F,EAAI+N,EAAK1Q,OAAQyI,EAAI9F,EAAG8F,IAAK,CAC5C,IAAIrE,EAAMsM,EAAKjI,GACfkI,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,OAElDG,EAAaD,CACb,CACDC,EAAW/B,IAAiBnM,EAAI,EAChC,CACDnC,KAAKsQ,0BAA4B9Q,CACjC,CACIyP,IACJ3P,EAAWiR,OAAS/Q,EAAe,GAEpC,CAGD,IAAIgR,EAFA/B,IACHA,GAAkB,GAEnB,IACKO,EAAMyB,cAAgBjP,GAA0B,iBAAVA,EACrCA,EAAMvC,cAAgBa,OAAQ4Q,EAAYlP,GACrCA,EAAMvC,cAAgB8E,KAAQG,MAAMgF,QAAQ1H,IAAW+L,GAAiBoD,MAAKC,GAAYpP,aAAiBoP,IAG5GhB,EAAKpO,GADXkP,EAAYlP,EAAMsB,OAAStB,EAAMsB,SAAWtB,GAG7CoO,EAAKpO,GACN,IAAIqP,EAAa7S,GAGjB,GAFIA,IACH8S,GAAajQ,EAAO+O,EAAM,GACvB3R,GAAgBA,EAAa8S,YAAa,CAC7C,IAAIA,EAAc9S,EAAa8S,YAAYC,MAAK,CAACtJ,EAAGC,IAAMD,EAAEiH,OAAShH,EAAEgH,OAAS,GAAK,IACjFxM,EAAI4O,EAAYtR,OAChBwR,GAAqB,EACzB,KAAOJ,GAAc1O,EAAI,GAAG,CAC3B,IAAI+O,EAAiBH,IAAc5O,GAAGwM,OAAS9N,EAC3CqQ,EAAkBL,EAAWM,gBAAkBtQ,IAAiC,IAAvBoQ,IAC5DA,EAAoB,GACjBC,EAAkBL,EAAW1S,SAAW0C,EACvCoQ,GAAqB,IACxBA,GAAqB,IAElBA,GAAqB,IAExB9C,GAAWiD,UAAUP,EAAW1S,SAAW0C,EAC1CsN,GAAWtJ,UAAUgM,EAAW1S,SAAW0C,GAASoQ,GACrDA,GAAqB,GAEtBJ,EAAaA,EAAWQ,SACxBlP,IAED,CACG8O,GAAqB,GAAKJ,GAE7B1C,GAAWiD,UAAUP,EAAW1S,SAAW0C,EAC1CsN,GAAWtJ,UAAUgM,EAAW1S,SAAW0C,GAASoQ,GAEtD9S,IAAiC,EAArB4S,EAAYtR,OACpBtB,GAAWiQ,IACdkD,EAASnT,IACV6Q,EAAML,OAASxQ,GACf,IAAIoT,EA24BT,SAAmBA,EAAYR,GAE9B,IAAIR,EACAiB,EAAsC,EAArBT,EAAYtR,OAC7BgS,EAAUF,EAAW9R,OAAS+R,EAClC,KAAOjB,EAASQ,EAAYW,OAAO,CAClC,IAAI/C,EAAS4B,EAAO5B,OAChBpM,EAAKgO,EAAOhO,GAChBgP,EAAWI,WAAWhD,EAAS6C,EAAgB7C,EAAQ8C,GACvDD,GAAkB,EAClB,IAAIrT,EAAWwQ,EAAS6C,EACxBD,EAAWpT,KAAc,IACzBoT,EAAWpT,KAAc,IACzBoT,EAAWpT,KAAcoE,GAAM,GAC/BgP,EAAWpT,KAAeoE,GAAM,GAAM,IACtCgP,EAAWpT,KAAeoE,GAAM,EAAK,IACrCgP,EAAWpT,KAAmB,IAALoE,EACzBkP,EAAU9C,CACV,CACD,OAAO4C,CACR,CA/5BsBK,CAAUlH,GAAO3E,SAASlF,EAAO1C,IAAW4S,GAE7D,OADA9S,EAAe,KACRsT,CACP,CAED,OADAvC,EAAML,OAASxQ,GACX2R,EAAgB+B,IACnBnH,GAAO7J,MAAQA,EACf6J,GAAO9J,IAAMzC,GACNuM,IAEDA,GAAO3E,SAASlF,EAAO1C,GA4B9B,CA3BC,MAAMN,GAEP,MADA2S,EAAgB3S,EACVA,CACV,CAAa,QACT,GAAIyB,IACHwS,IACIrD,GAAmBO,EAAMG,gBAAgB,CAC5C,IAAI3P,EAAeF,EAAWE,cAAgB,EAE1CuS,EAAerH,GAAO3E,SAASlF,EAAO1C,IACtC6T,GAAiBhD,EAAMiD,oBAAsBC,IAAmB5S,EAAY0P,GAChF,IAAKwB,EACJ,OAAwE,IAApExB,EAAMG,eAAe6C,EAAeA,EAAcG,cAE9CnD,EAAMY,KAAKpO,EAAOsO,IAE1Bd,EAAMsB,0BAA4B9Q,EAE9BkL,GAAOjL,OAAS,aAAYiL,GAAS,MAClCqH,EAER,CAGErH,GAAOjL,OAAS,aAAYiL,GAAS,MACrCoF,EAAgBsC,KACnBjU,GAAW0C,EACZ,CACJ,EACE,MAAMiR,EAAkB,KACnBnC,EAAuC,IAC1CA,IACD,IAAInQ,EAAeF,EAAWE,cAAgB,EAG9C,GAFIF,EAAWG,OAASD,IAAiByP,IACxC3P,EAAWG,OAASD,GACjBkQ,EAAmB,IAEtBpQ,EAAW2Q,YAAc,KACzBN,EAAuC,EACvCD,EAAmB,EACfD,EAAkBhQ,OAAS,IAC9BgQ,EAAoB,SACf,GAAIA,EAAkBhQ,OAAS,IAAMwP,EAAc,CACzD,IAAK,IAAI9M,EAAI,EAAGC,EAAIqN,EAAkBhQ,OAAQ0C,EAAIC,EAAGD,IACpDsN,EAAkBtN,GAAGmM,IAAiB,EAEvCmB,EAAoB,EACpB,GAEI4C,EAAa7Q,IAClB,IAAI/B,EAAS+B,EAAM/B,OACfA,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEb,IAAK,IAAIgE,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3ByN,EAAKpO,EAAMW,GACX,EAEIyN,EAAQpO,IACTrD,GAAWiQ,KACd1D,GAAS4G,EAASnT,KAEnB,IACIsB,EADAgJ,SAAcjH,EAElB,GAAa,WAATiH,EAAmB,CACtB,IAkCI6J,EAlCAC,EAAY/Q,EAAM/B,OACtB,GAAIzB,IAAkBuU,GAAa,GAAKA,EAAY,KAAQ,CAC3D,IAAKvU,GAAeuD,MAAQgR,GA5OT,MA4OuC,CACzD,IAAIC,EAIA3B,EAHA4B,GAAYzU,GAAe,GAAgC,EAA3BA,GAAe,GAAGyB,OAAazB,GAAe,GAAGyB,OAAS,GAAK,GAC/FtB,GAAWsU,EAAWrE,KACzB1D,GAAS4G,EAASnT,GAAWsU,IAE1BzU,GAAeG,UAClB0S,EAAa7S,GACb0M,GAAOvM,IAAY,IACnBA,IAAY,EACZuM,GAAOvM,MAAc,GACrBqU,EAAWrU,GAAW0C,EACtB1C,IAAY,EACZ2S,GAAajQ,EAAO+O,EAAM,GAC1BzB,GAAWuE,UAAUF,EAAW3R,EAAQ,EAAG1C,GAAW0C,EAAQ2R,KAE9D9H,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,GACrBqU,EAAWrU,GAAW0C,EACtB1C,IAAY,GAEbH,GAAiB,CAAC,GAAI,IACtBA,GAAeqT,SAAWR,EAC1B7S,GAAeuD,KAAO,EACtBvD,GAAeG,SAAWqU,CAC1B,CACD,IAAIG,EAAUtE,GAAY1H,KAAKnF,GAI/B,OAHAxD,GAAe2U,EAAU,EAAI,IAAMnR,EACnCkJ,GAAOvM,MAAc,SACrByR,EAAK+C,GAAWJ,EAAYA,EAE5B,CAIAD,EADGC,EAAY,GACF,EACHA,EAAY,IACT,EACHA,EAAY,MACT,EAEA,EAEd,IAAIE,EAAuB,EAAZF,EAIf,GAHIpU,GAAWsU,EAAWrE,KACzB1D,GAAS4G,EAASnT,GAAWsU,IAE1BF,EAAY,KAAS3D,EAAY,CACpC,IAAIzM,EAAGyQ,EAAIC,EAAIC,EAAc3U,GAAWmU,EACxC,IAAKnQ,EAAI,EAAGA,EAAIoQ,EAAWpQ,IAC1ByQ,EAAKpR,EAAMuR,WAAW5Q,GAClByQ,EAAK,IACRlI,GAAOoI,KAAiBF,EACdA,EAAK,MACflI,GAAOoI,KAAiBF,GAAM,EAAI,IAClClI,GAAOoI,KAAsB,GAALF,EAAY,KAElB,QAAZ,MAALA,IAC6C,QAAZ,OAAhCC,EAAKrR,EAAMuR,WAAW5Q,EAAI,MAE5ByQ,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,GACxC1Q,IACAuI,GAAOoI,KAAiBF,GAAM,GAAK,IACnClI,GAAOoI,KAAiBF,GAAM,GAAK,GAAO,IAC1ClI,GAAOoI,KAAiBF,GAAM,EAAI,GAAO,IACzClI,GAAOoI,KAAsB,GAALF,EAAY,MAEpClI,GAAOoI,KAAiBF,GAAM,GAAK,IACnClI,GAAOoI,KAAiBF,GAAM,EAAI,GAAO,IACzClI,GAAOoI,KAAsB,GAALF,EAAY,KAGtCnT,EAASqT,EAAc3U,GAAWmU,CACvC,MACK7S,EAASmP,EAAWpN,EAAOrD,GAAWmU,GAGnC7S,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,KACf6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GACXA,EAAS,OACf6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAEjB6S,EAAa,GAChB5H,GAAOiH,WAAWxT,GAAW,EAAGA,GAAW,EAAGA,GAAW,EAAIsB,GAE9DiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEbA,IAAYsB,CAChB,MAAU,GAAa,WAATgJ,EACV,GAAIjH,IAAU,IAAMA,EAEfA,EAAQ,IAASA,EAAQ,MAA4B,IAApBxB,KAAKvB,YAA0B+C,EAAQ,KAASxB,KAAKyQ,aACzF/F,GAAOvM,MAAcqD,EACXA,EAAQ,KAClBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,GACXA,EAAQ,OAClBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,GAAS,EAC9BkJ,GAAOvM,MAAsB,IAARqD,IAErBkJ,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUqD,GAC/BrD,IAAY,QAEP,GAAIqD,GAAS,IAAMA,EACrBA,IAAU,GACbkJ,GAAOvM,MAAc,IAAQqD,EACnBA,IAAU,KACpBkJ,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcqD,EAAQ,KACnBA,IAAU,OACpBkJ,GAAOvM,MAAc,IACrBgQ,GAAW6E,SAAS7U,GAAUqD,GAC9BrD,IAAY,IAEZuM,GAAOvM,MAAc,IACrBgQ,GAAW8E,SAAS9U,GAAUqD,GAC9BrD,IAAY,OAEP,CACN,IAAI6G,EACJ,IAAKA,EAAahF,KAAKgF,YAAc,GAAKxD,EAAQ,YAAeA,IAAU,WAAY,CAGtF,IAAI0R,EACJ,GAHAxI,GAAOvM,MAAc,IACrBgQ,GAAWgF,WAAWhV,GAAUqD,GAE5BwD,EAAa,IAEbkO,EAAW1R,EAAQ0D,GAA4B,IAAnBwF,GAAOvM,MAAqB,EAAMuM,GAAOvM,GAAW,IAAM,KAAQ,IAAO+U,EAExG,YADA/U,IAAY,GAGZA,IACD,CACDuM,GAAOvM,MAAc,IACrBgQ,GAAWiF,WAAWjV,GAAUqD,GAChCrD,IAAY,CACZ,MACK,GAAa,WAATsK,GAA8B,aAATA,EAC/B,GAAKjH,EAEA,CACJ,GAAIvD,EAAc,CACjB,IAAIoV,EAAUpV,EAAaiN,IAAI1J,GAC/B,GAAI6R,EAAS,CACZ,IAAKA,EAAQ9Q,GAAI,CAChB,IAAIwO,EAAc9S,EAAa8S,cAAgB9S,EAAa8S,YAAc,IAC1EsC,EAAQ9Q,GAAKwO,EAAYrP,KAAK2R,EAC9B,CAKD,OAJA3I,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUkV,EAAQ9Q,SACvCpE,IAAY,EAEZ,CACAF,EAAa+F,IAAIxC,EAAO,CAAEmN,OAAQxQ,GAAW0C,GAC9C,CACD,IAAI5B,EAAcuC,EAAMvC,YACxB,GAAIA,IAAgBa,OACnBwT,EAAY9R,QACN,GAAIvC,IAAgBiF,MAC1BmO,EAAU7Q,QACJ,GAAIvC,IAAgB8E,IAC1B,GAAI/D,KAAKuT,iBAAkB7I,GAAOvM,MAAc,QAC3C,EACJsB,EAAS+B,EAAMD,MACF,GACZmJ,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAEb,IAAK,IAAK0F,EAAK2P,KAAehS,EAC7BoO,EAAK/L,GACL+L,EAAK4D,EAEN,KACK,CACN,IAAK,IAAIrR,EAAI,EAAGC,EAAIkL,GAAW7N,OAAQ0C,EAAIC,EAAGD,IAAK,CAElD,GAAIX,aADiB+L,GAAiBpL,GACD,CACpC,IAAI0D,EAAYyH,GAAWnL,GAC3B,GAAI0D,EAAU4N,MAAO,CAChB5N,EAAU4C,OACbiC,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc0H,EAAU4C,KAC/BiC,GAAOvM,MAAc,GAEtB,IAAIuV,EAAc7N,EAAU4N,MAAMnT,KAAKN,KAAMwB,GAU7C,YATIkS,IAAgBlS,EACf0C,MAAMgF,QAAQ1H,GACjB6Q,EAAU7Q,GAEV8R,EAAY9R,GAGboO,EAAK8D,GAGN,CACD,IAII/Q,EAJAgR,EAAgBjJ,GAChBkJ,EAAoBzF,GACpB0F,EAAkB1V,GACtBuM,GAAS,KAET,IACC/H,EAASkD,EAAU+J,KAAKtP,KAAKN,KAAMwB,GAAQD,IAE1CmJ,GAASiJ,EACTA,EAAgB,KAChBxV,IAAYoD,EACRpD,GAAWiQ,IACdkD,EAASnT,IACH,CACNuM,UAAQyD,cAAYhQ,SAAUA,GAAWoD,KAExCqO,EASH,CARS,QAEL+D,IACHjJ,GAASiJ,EACTxF,GAAayF,EACbzV,GAAW0V,EACXzF,GAAU1D,GAAOjL,OAAS,GAE3B,CAMD,YALIkD,IACCA,EAAOlD,OAAStB,GAAWiQ,IAC9BkD,EAAS3O,EAAOlD,OAAStB,IAC1BA,GAAW2V,GAAmBnR,EAAQ+H,GAAQvM,GAAU0H,EAAU4C,OAGnE,CACD,CAED,GAAIvE,MAAMgF,QAAQ1H,GACjB6Q,EAAU7Q,OACJ,CAEN,GAAIA,EAAMsB,OAAQ,CACjB,MAAMiR,EAAOvS,EAAMsB,SAEnB,GAAIiR,IAASvS,EACZ,OAAOoO,EAAKmE,EACb,CAGD,GAAa,aAATtL,EACH,OAAOmH,EAAK5P,KAAKgU,eAAiBhU,KAAKgU,cAAcxS,IAGtD8R,EAAY9R,EACZ,CACD,CACD,MAvHAkJ,GAAOvM,MAAc,SAwHhB,GAAa,YAATsK,EACViC,GAAOvM,MAAcqD,EAAQ,IAAO,SAC9B,GAAa,WAATiH,EAAmB,CAC7B,GAAIjH,EAAQ,oBAAsBA,IAAU,mBAE3CkJ,GAAOvM,MAAc,IACrBgQ,GAAW8F,YAAY9V,GAAUqD,QAC3B,GAAIA,EAAQ,qBAAuBA,EAAQ,EAEjDkJ,GAAOvM,MAAc,IACrBgQ,GAAW+F,aAAa/V,GAAUqD,OAC5B,CAEN,IAAIxB,KAAKmU,mBAGF,IAAInU,KAAKoU,oBACf,OAAOxE,EAAKpO,EAAM6D,YACZ,GAAIrF,KAAKqU,oBAAsBrU,KAAKoP,UAAW,CACrD,IAEInL,EAFAqQ,EAAQ9S,EAAQ,EAAI8D,QAAQ,GAAKA,OAAO,GAG5C,GAAI9D,GAAS8D,OAAO,SAAagP,EAAO,CACvC,IAAIC,EAAOjP,OAAO,qBAAuBA,OAAO,GAC5CkP,EAAS,GACb,KACCA,EAAO9S,KAAKF,EAAQ+S,GACf/S,GAAS8D,OAAO,MAASgP,GAC9B9S,IAAU8D,OAAO,IAGlBrB,EAAQ,IAAItD,WAAW,IAAI8T,eAAeD,GAAQjU,QAClD0D,EAAMyQ,SACb,KAAa,CACN,IAAIC,EAASnT,EAAQ,EACjB6C,GAAUsQ,GAAUnT,EAAQA,GAAO6D,SAAS,IAOhD,GANIhB,EAAO5E,OAAS,EACnB4E,EAAS,IAAMA,EACLuQ,SAASvQ,EAAOwQ,OAAO,GAAI,KAAO,IAC5CxQ,EAAS,KAAOA,GAGbwJ,GACH5J,EAAQxD,OAAOC,KAAK2D,EAAQ,WACtB,CACNJ,EAAQ,IAAItD,WAAW0D,EAAO5E,OAAS,GACvC,IAAK,IAAI0C,EAAI,EAAGA,EAAI8B,EAAMxE,OAAQ0C,IACjC8B,EAAM9B,GAAKyS,SAASvQ,EAAOnC,MAAU,EAAJC,EAAW,EAAJA,EAAQ,GAAI,GAErD,CAED,GAAIwS,EACH,IAAK,IAAIxS,EAAI,EAAGA,EAAI8B,EAAMxE,OAAQ0C,IAAK8B,EAAM9B,IAAM8B,EAAM9B,EAE1D,CAKD,OAHI8B,EAAMxE,OAAStB,GAAWiQ,IAC7BkD,EAASrN,EAAMxE,OAAStB,SACzBA,GAAW2V,GAAmB7P,EAAOyG,GAAQvM,GAAU,IAE7D,CACM,MAAM,IAAIkF,WAAW7B,0LAGrB,CAlDAkJ,GAAOvM,MAAc,IACrBgQ,GAAWiF,WAAWjV,GAAUoH,OAAO/D,GAkDxC,CACDrD,IAAY,CAChB,KAAU,IAAa,cAATsK,EASV,MAAM,IAAIxH,MAAM,iBAAmBwH,GAR/BzI,KAAK8U,qBACRpK,GAAOvM,MAAc,KAErBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,EACrBuM,GAAOvM,MAAc,EAItB,GAGI4W,EAAoB/U,KAAKgV,iBAAmBhV,KAAKiV,sBAAwBjV,KAAKkV,WAAetR,IAElG,IAAIuM,EACJ,GAAInQ,KAAKkV,WAAY,CACpB/E,EAAO,GACP,IAAK,IAAItM,KAAOD,EACuB,mBAA1BA,EAAOuR,iBAAiCvR,EAAOuR,eAAetR,IACxE7D,KAAKkV,WAAW5L,SAAS1F,EAAOC,KACjCsM,EAAKzO,KAAKmC,EAEhB,MACIsM,EAAOrQ,OAAOqQ,KAAKvM,GAEpB,IAYIC,EAZApE,EAAS0Q,EAAK1Q,OAalB,GAZIA,EAAS,GACZiL,GAAOvM,MAAc,IAAOsB,EAClBA,EAAS,OACnBiL,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAcsB,GAAU,EAC/BiL,GAAOvM,MAAuB,IAATsB,IAErBiL,GAAOvM,MAAc,IACrBgQ,GAAWiD,UAAUjT,GAAUsB,GAC/BtB,IAAY,GAGT6B,KAAKiV,qBACR,IAAK,IAAI9S,EAAI,EAAGA,EAAI1C,EAAQ0C,IAAK,CAChC0B,EAAMsM,EAAKhO,GACX,IAAIiT,EAAM7P,OAAO1B,GACjB+L,EAAKyF,MAAMD,GAAOvR,EAAMuR,GACxBxF,EAAKhM,EAAOC,GACZ,MAGD,IAAK,IAAI1B,EAAI,EAAGA,EAAI1C,EAAQ0C,IAC3ByN,EAAK/L,EAAMsM,EAAKhO,IAChByN,EAAKhM,EAAOC,GAEb,EAEDD,IACA8G,GAAOvM,MAAc,IACrB,IAAImX,EAAenX,GAAW0C,EAC9B1C,IAAY,EACZ,IAAIoD,EAAO,EACX,IAAK,IAAIsC,KAAOD,GACsB,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,MACxE+L,EAAK/L,GACL+L,EAAKhM,EAAOC,IACZtC,KAGF,GAAIA,EAAO,MACV,MAAM,IAAIN,MAAM,yHAGjByJ,GAAO4K,IAAiBzU,GAASU,GAAQ,EACzCmJ,GAAO4K,EAAezU,GAAgB,IAAPU,CAAW,EAGrCgU,GAAkC,IAApBvV,KAAKvB,WAAuBsW,EAC/C7V,EAAQsW,qBAAuBlG,EAC/B1L,IACA,IAAIwM,EAEAqF,EAFgBpF,EAAa/Q,EAAW2Q,cAAgB3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,OAC/FoF,EAAenX,KAAa0C,EAEhC,IAAK,IAAIgD,KAAOD,EACf,GAAqC,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,GAAM,CAE9E,GADAuM,EAAiBC,EAAWxM,GACxBuM,EACHC,EAAaD,MACT,CAEJ,IAAID,EAAOrQ,OAAOqQ,KAAKvM,GACnB8R,EAAiBrF,EACrBA,EAAa/Q,EAAW2Q,YACxB,IAAI0F,EAAiB,EACrB,IAAK,IAAIxT,EAAI,EAAGC,EAAI+N,EAAK1Q,OAAQ0C,EAAIC,EAAGD,IAAK,CAC5C,IAAI0B,EAAMsM,EAAKhO,GACfiO,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,MACjDyF,KAEDtF,EAAaD,CACb,CACGkF,EAAezU,EAAQ,GAAK1C,IAE/BA,KACAyX,EAAUvF,EAAYF,EAAMwF,IAE5BE,EAAgBxF,EAAYF,EAAMmF,EAAcK,GACjDF,GAAY,EACZpF,EAAaqF,EAAe7R,EAC5B,CACD+L,EAAKhM,EAAOC,GACZ,CAEF,IAAK4R,EAAW,CACf,IAAIK,EAAWzF,EAAW/B,IACtBwH,EACHpL,GAAO4K,EAAezU,GAASiV,EAE/BD,EAAgBxF,EAAYvQ,OAAOqQ,KAAKvM,GAAS0R,EAAc,EAChE,GAED1R,IACA,IAAIwM,EAAgBC,EAAa/Q,EAAW2Q,cAAgB3Q,EAAW2Q,YAAcnQ,OAAOoQ,OAAO,OAC/FyF,EAAiB,EACrB,IAAK,IAAI9R,KAAOD,GAA6C,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,MAChGuM,EAAiBC,EAAWxM,GACvBuM,IACJA,EAAiBC,EAAWxM,GAAO/D,OAAOoQ,OAAO,MACjDyF,KAEDtF,EAAaD,GAEd,IAAI0F,EAAWzF,EAAW/B,IACtBwH,EACCA,GAAY,IAAQxG,GACvB5E,GAAOvM,MAA4C,IAAR,IAApB2X,GAAY,KACnCpL,GAAOvM,MAAc2X,GAAY,GAEjCpL,GAAOvM,MAAc2X,EAEtBF,EAAUvF,EAAYA,EAAW0F,UAAYjW,OAAOqQ,KAAKvM,GAAS+R,GAGnE,IAAK,IAAI9R,KAAOD,GACsB,mBAA1BA,EAAOuR,gBAAiCvR,EAAOuR,eAAetR,KACxE+L,EAAKhM,EAAOC,GACZ,EAIGmS,EAA4C,mBAAnBhW,KAAKvB,YAA4BuB,KAAKvB,WAE/D6U,EAAc0C,EAAmBpS,IACtCoS,EAAgBpS,GAAU2R,EAAY3R,GAAUmR,EAAiBnR,EAAO,EACrE2R,EAEE7E,EAAe9M,IACpB,IAAIqS,EAAcjH,EAAMyB,aAAa7M,EAAQ8G,GAAQ7J,EAAO1C,GAAUmB,EAAYgS,GAAU,CAAC9P,EAAOyU,EAAaC,KAChH,GAAIA,EACH,OAAOzH,GAAkB,EAC1BtQ,GAAW8X,EACX,IAAIE,EAAczL,GAGlB,OAFAkF,EAAKpO,GACLsQ,IACIqE,IAAgBzL,GACZ,CAAEvM,YAAUgQ,cAAYzD,WAEzBvM,EAAQ,IAEhB,GAAoB,IAAhB8X,EACH,OAAO3C,EAAY1P,GACpBzF,GAAW8X,CAAW,EAGjB3E,EAAY1Q,IACjB,IAAIwV,EACJ,GAAIxV,EAAM,SAAW,CAEpB,GAAKA,EAAMC,EAASoN,GACnB,MAAM,IAAIhN,MAAM,0DACjBmV,EAAUvJ,KAAKwJ,IAAIpI,GACsE,KAAxFpB,KAAKyJ,MAAMzJ,KAAK0J,KAAK3V,EAAMC,IAAUD,EAAM,SAAY,KAAO,GAAI,SAAY,MAC/E,MACAwV,EAAqE,GAAzDvJ,KAAK0J,IAAK3V,EAAMC,GAAU,EAAG6J,GAAOjL,OAAS,IAAM,KAAY,GAC5E,IAAI+W,EAAY,IAAI1I,GAAkBsI,GAUtC,OATAjI,GAAaqI,EAAUtY,WAAasY,EAAUtY,SAAW,IAAI4C,SAAS0V,EAAUjW,OAAQ,EAAG6V,IAC3FxV,EAAMiM,KAAKwJ,IAAIzV,EAAK8J,GAAOjL,QACvBiL,GAAO+L,KACV/L,GAAO+L,KAAKD,EAAW,EAAG3V,EAAOD,GAEjC4V,EAAUxS,IAAI0G,GAAOxI,MAAMrB,EAAOD,IACnCzC,IAAY0C,EACZA,EAAQ,EACRuN,GAAUoI,EAAU/W,OAAS,GACtBiL,GAAS8L,CAAS,EAEpBZ,EAAY,CAACvF,EAAYF,EAAMwF,KACpC,IAAIG,EAAWxW,EAAWiR,OACrBuF,IACJA,EAAW,IACRA,EAAWvG,GAAiBvP,KAAK0W,uBAAyB1W,KAAK0W,qBAAqBvG,IACvF2F,EAAWxW,EAAWqX,UAChBb,EAAWtG,IAChBsG,EAAWvG,GACZjQ,EAAWqX,UAAYb,EAAW,IAE9BA,GAAYtG,IACfsG,EAAWvG,GACZjQ,EAAWiR,OAASuF,EAAW,GAEhC,IAAIxT,EAAW6N,EAAK7N,SAAWwT,GAAY,IAAQxG,EAAqBwG,EAAW,IAAS,GAAK,EACjGzF,EAAW/B,IAAiBwH,EAC5BzF,EAAW0F,SAAW5F,EACtB7Q,EAAWwW,EAAW,IAAQ3F,EAE1B2F,EAAWvG,GACdY,EAAK9N,UAAW,EAChB/C,EAAWE,aAAesW,EAAW,GACrCrH,GAAkB,EACdnM,GAAY,GACfoI,GAAOvM,MAAkC,IAAR,GAAX2X,GACtBpL,GAAOvM,MAAcmE,GAErBoI,GAAOvM,MAAc2X,IAGlBxT,GAAY,GACfoI,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAkC,IAAR,GAAX2X,GACtBpL,GAAOvM,MAAcmE,IAErBoI,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc,IACrBuM,GAAOvM,MAAc2X,GAGlBH,IACHjG,GAAoBC,EAAuCgG,GAExDlG,EAAkBhQ,QAAU4P,IAC/BI,EAAkBmH,QAAQtI,IAAiB,GAC5CmB,EAAkB/N,KAAK2O,GACvBT,EAAKO,GACL,EAEI0F,EAAkB,CAACxF,EAAYF,EAAM0G,EAAiBlB,KAC3D,IAAImB,EAAapM,GACbqM,EAAe5Y,GACf6Y,EAAc5I,GACd6I,EAAYpW,EAChB6J,GAASwD,GACT/P,GAAW,EACX0C,EAAQ,EACH6J,KACJwD,GAAaxD,GAAS,IAAIoD,GAAkB,OAC7CM,GAAU1D,GAAOjL,OAAS,GAC1BmW,EAAUvF,EAAYF,EAAMwF,GAC5BzH,GAAaxD,GACb,IAAIwM,EAAe/Y,GAKnB,GAJAuM,GAASoM,EACT3Y,GAAW4Y,EACX3I,GAAU4I,EACVnW,EAAQoW,EACJC,EAAe,EAAG,CACrB,IAAIC,EAAShZ,GAAW+Y,EAAe,EACnCC,EAAS/I,IACZkD,EAAS6F,GACV,IAAIC,EAAoBP,EAAkBhW,EAC1C6J,GAAOiH,WAAWyF,EAAoBF,EAAcE,EAAoB,EAAGjZ,IAC3EuM,GAAO1G,IAAIkK,GAAWhM,MAAM,EAAGgV,GAAeE,GAC9CjZ,GAAWgZ,CACf,MACIzM,GAAOmM,EAAkBhW,GAASqN,GAAW,EAC7C,CAEF,CACDmJ,UAAU9W,GAETmK,GAASnK,EACTmK,GAAOxM,WAAawM,GAAOxM,SAAW,IAAI4C,SAAS4J,GAAOnK,OAAQmK,GAAO3J,WAAY2J,GAAO1J,aAC5FmN,GAAazD,GAAOxM,SACpBC,GAAW,CACX,CACGA,aAAUqD,GACbrD,GAAWqD,CACX,CACGrD,eACH,OAAOA,EACP,CACDmZ,kBACKtX,KAAKV,aACRU,KAAKV,WAAa,IACfU,KAAKuX,eACRvX,KAAKuX,aAAe,GACrB,EAwGF,SAASC,GAAeC,EAAYhP,EAAMiP,EAAkB7H,GAC3D,IAAIpQ,EAASgY,EAAWzW,WACxB,GAAIvB,EAAS,EAAI,IAAO,CACvB,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiB,EAAIjY,GAChDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,EAAS,CAChC,MAAQ,GAAIA,EAAS,EAAI,MAAS,CAChC,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiB,EAAIjY,GAChDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAesB,EAAS,GAAM,EACrCiL,EAAOvM,KAAesB,EAAS,EAAK,GACtC,KAAQ,CACN,IAAIiL,OAAEA,EAAMvM,SAAEA,EAAQgQ,WAAEA,GAAeuJ,EAAiB,EAAIjY,GAC5DiL,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAUsB,EAAS,GACxCtB,GAAY,CACZ,CACDuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsK,EAChBgP,EAAWlX,SAAQkX,EAAa,IAAI9W,WAAW8W,IACpD/M,EAAO1G,IAAI,IAAIrD,WAAW8W,EAAWlX,OAAQkX,EAAW1W,WAAY0W,EAAWzW,YAAa7C,EAC7F,CACA,SAASwZ,GAAYpX,EAAQmX,GAC5B,IAAIjY,EAASc,EAAOS,WACpB,IAAI0J,EAAQvM,EACZ,GAAIsB,EAAS,IAAO,CACnB,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiBjY,EAAS,GACrDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,CACvB,MAAQ,GAAIA,EAAS,MAAS,CAC5B,IAAIiL,OAAEA,EAAMvM,SAAEA,GAAauZ,EAAiBjY,EAAS,GACrDiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,EAC/BiL,EAAOvM,KAAuB,IAATsB,CACvB,KAAQ,CACN,IAAIiL,OAAEA,EAAMvM,SAAEA,EAAQgQ,WAAEA,GAAeuJ,EAAiBjY,EAAS,GACjEiL,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAUsB,GAC/BtB,GAAY,CACZ,CACDuM,EAAO1G,IAAIzD,EAAQpC,EACpB,CAEA,SAAS2V,GAAmBnR,EAAQ+H,EAAQvM,EAAUsK,GACrD,IAAIhJ,EAASkD,EAAOlD,OACpB,OAAQA,GACP,KAAK,EACJiL,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,EACJuM,EAAOvM,KAAc,IACrB,MACD,KAAK,GACJuM,EAAOvM,KAAc,IACrB,MACD,QACKsB,EAAS,KACZiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GACXA,EAAS,OACnBiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,EAC/BiL,EAAOvM,KAAuB,IAATsB,IAErBiL,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAcsB,GAAU,GAC/BiL,EAAOvM,KAAesB,GAAU,GAAM,IACtCiL,EAAOvM,KAAesB,GAAU,EAAK,IACrCiL,EAAOvM,KAAuB,IAATsB,GAMxB,OAHAiL,EAAOvM,KAAcsK,EACrBiC,EAAO1G,IAAIrB,EAAQxE,GACnBA,GAAYsB,CAEb,CAwBA,SAASqR,GAAajQ,EAAO+O,EAAMqB,GAClC,GAAIjT,GAAeyB,OAAS,EAAG,CAC9B0O,GAAWiD,UAAUpT,GAAeG,SAAW0C,EAAO1C,GAAW8S,EAAoBjT,GAAeG,SAAW0C,GAC/G7C,GAAemT,gBAAkBhT,GAAW0C,EAC5C,IAAI+W,EAAe5Z,GACnBA,GAAiB,KACjB4R,EAAKgI,EAAa,IAClBhI,EAAKgI,EAAa,GAClB,CACF,CAaA,SAAS1F,GAAkB5S,EAAY0P,GAOtC,OANA1P,EAAW6S,aAAgBtQ,IAC1B,IAAIgW,GAAchW,IAAwBmN,EAAMsB,2BAA6B,KAAOzO,EAAmBpC,OAGvG,OAFKoY,GACJ7I,EAAMrN,iBAAiBE,GACjBgW,CAAU,EAEXvY,CACR,CA5OAiO,GAAmB,CAAEX,KAAMjC,IAAK1J,MAAOwK,OAAQjL,YAAaV,OAAOgY,eAAenX,WAAWN,WAAWpB,YAA4B6B,SAAUnC,GAC9I2O,GAAa,CAAC,CACbsC,KAAKmI,EAAML,EAAkB9H,GAC5B,IAAIoI,EAAUD,EAAKE,UAAY,IAC/B,IAAKjY,KAAKkY,gBAA6C,IAA3BH,EAAKI,oBAA4BH,GAAW,GAAKA,EAAU,WAAa,CAEnG,IAAItN,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,GACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAU6Z,EAC/B,MAAM,GAAIA,EAAU,GAAKA,EAAU,WAAa,CAEhD,IAAItN,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,IACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAmC,IAAzB4Z,EAAKI,mBAAgCH,EAAU,IAAO,YAAgB,IACrG7J,EAAWiD,UAAUjT,EAAW,EAAG6Z,EACtC,MAAS,GAAI3C,MAAM2C,GAAU,CAC1B,GAAIhY,KAAKoY,cAER,OADAV,EAAiB,GACV9H,EAAK5P,KAAKoY,iBAGlB,IAAI1N,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,GACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GACxB,KAAS,CAEN,IAAIuM,OAAEA,EAAMyD,WAAEA,EAAUhQ,SAAEA,GAAYuZ,EAAiB,IACvDhN,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GACrBuM,EAAOvM,KAAc,IACrBgQ,EAAWiD,UAAUjT,EAAmC,IAAzB4Z,EAAKI,mBACpChK,EAAW8F,YAAY9V,EAAW,EAAGmH,OAAOuH,KAAKC,MAAMkL,IACvD,CACD,GACC,CACFpI,KAAK5L,EAAK0T,EAAkB9H,GAC3B,GAAI5P,KAAKqY,iBAER,OADAX,EAAiB,GACV9H,EAAK,CAAA,GAEb,IAAI3L,EAAQC,MAAMxD,KAAKsD,IACnB0G,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK3L,EACL,GACC,CACF2L,KAAK/R,EAAO6Z,EAAkB9H,GAC7B,IAAIlF,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK,CAAE/R,EAAMgB,KAAMhB,EAAMyF,QAASzF,EAAM2M,OACxC,GACC,CACFoF,KAAK0I,EAAOZ,EAAkB9H,GAC7B,IAAIlF,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB1X,KAAKoP,UAAY,EAAI,GAC5DpP,KAAKoP,YACR1E,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,IACrBuM,EAAOvM,KAAc,GAEtByR,EAAK,CAAE0I,EAAMpY,OAAQoY,EAAMC,OAC3B,GACC,CACF3I,KAAK4I,EAAad,GACb1X,KAAKoP,UACRoI,GAAegB,EAAa,GAAMd,GAElCC,GAAY9J,GAAgBpN,OAAOC,KAAK8X,GAAe,IAAI7X,WAAW6X,GAAcd,EACrF,GACC,CACF9H,KAAK6H,EAAYC,GAChB,IAAIzY,EAAcwY,EAAWxY,YACzBA,IAAgB+O,IAAahO,KAAKoP,UACrCoI,GAAeC,EAAYtM,EAAYsN,QAAQxZ,EAAYJ,MAAO6Y,GAElEC,GAAYF,EAAYC,EACzB,GACC,CACF9H,KAAK4I,EAAad,GACb1X,KAAKoP,UACRoI,GAAegB,EAAa,GAAMd,GAElCC,GAAY9J,GAAgBpN,OAAOC,KAAK8X,GAAe,IAAI7X,WAAW6X,GAAcd,EACrF,GACC,CACF9H,KAAKgD,EAAI8E,GACR,IAAIhN,OAAEA,EAAMvM,SAAEA,GAAYuZ,EAAiB,GAC3ChN,EAAOvM,GAAY,GACnB,IA+IFqQ,GAAMb,uBAAwB,EAE9B,IAAI+K,GAAe,IAAIlK,GAAM,CAAE/P,YAAY,IAC/B,MAACmR,GAAO8I,GAAa9I,KACpBC,GAAS6I,GAAa9I,KACtB+I,GAAUnK,IAGVvB,MAAEA,GAAKC,OAAEA,GAAMC,cAAEA,GAAaC,YAAEA,IAAgBJ,GAChD6E,GAAoB,IACpBO,GAAoB,KACpBrC,GAAsB,KChiCtB,MAAA6I,GA1CN,SAAqBC,EAAgB3Z,EAAU,IACpD,IAAK2Z,GAA4C,iBAAnBA,EAC5B,MAAM,IAAI5X,MAAM,8FAGlB,MAAM6X,EAAU,IAAI9Z,EAAQE,GAC5B,IAAIsE,EACJ,MAAMuV,EAAUlQ,IACd,IAAImQ,EAEAxV,IACFqF,EAAQpI,OAAOwY,OAAO,CAACzV,EAAYqF,IACnCrF,OAAarE,GAGf,IACE6Z,EAASF,EAAQ3X,eAAe0H,EAQjC,CAPC,MAAOqQ,GACP,IAAIA,EAAI1V,WAIN,MAAM0V,EAHN1V,EAAaqF,EAAM3G,MAAMgX,EAAI5X,cAC7B0X,EAASE,EAAI7X,MAIhB,CACD,OAAO2X,CAAM,EAGf,MAA+C,mBAApCH,EAAetK,OAAO4K,UACxB,YACL,IAAK,MAAM3X,KAASqX,QACVE,EAAOvX,EAElB,CAJM,GAKkD,mBAAzCqX,EAAetK,OAAO6K,eAC/B,kBACL,UAAW,MAAM5X,KAASqX,QAChBE,EAAOvX,EAElB,CAJM,QADF,CAOT,EAEa6X,GA5EN,SAAmBC,EAAgBpa,EAAU,IAClD,GAAKoa,GAA4C,iBAAnBA,EAEvB,IAA+C,mBAApCA,EAAe/K,OAAO4K,UACtC,OAQJ,UAAyBG,EAAgBpa,GACvC,MAAM8P,EAAQ,IAAIR,GAAMtP,GACxB,IAAK,MAAMsC,KAAS8X,QACZtK,EAAMY,KAAKpO,EAErB,CAbW+X,CAAaD,EAAgBpa,GAC/B,GAAmC,mBAAxBoa,EAAeE,MAAuE,mBAAzCF,EAAe/K,OAAO6K,eACnF,OAaJK,gBAAgCH,EAAgBpa,GAC9C,MAAM8P,EAAQ,IAAIR,GAAMtP,GACxB,UAAW,MAAMsC,KAAS8X,QAClBtK,EAAMY,KAAKpO,EAErB,CAlBWkY,CAAcJ,EAAgBpa,GAErC,MAAM,IAAI+B,MAAM,6FACjB,CAPC,MAAM,IAAIA,MAAM,yFAQpB,+ND8jCO,SAAsB4E,GAC5B,GAAIA,EAAU8T,MAAO,CACpB,IAAK9T,EAAU+J,OAAS/J,EAAU4N,MACjC,MAAM,IAAIxS,MAAM,2CACjB,GAAI4E,EAAU+J,OAAS/J,EAAU4C,KAChC,MAAM,IAAIxH,MAAM,kEACjBsM,GAAiBqM,QAAQ/T,EAAU8T,OACnCrM,GAAWsM,QAAQ/T,EACnB,ED2FK,SAAsBA,GACxBA,EAAU5F,OACb1B,EAAkBsH,EAAU4C,MAAQ5C,EAAU5F,OAE9C1B,EAAkBsH,EAAU4C,MAAQ5C,CACtC,CC/FCgU,CAAmBhU,EACpB,yGD1iByC,mBG9iBZ,2BHysCtB,SAAsBiU,GAC5BtM,GAAS,GAAKsM,EACd,IAAI7U,EAAaC,GAAsB,IAAbwI,GAAQ,KAAc,EAAMA,GAAQ,IAAM,GACpE,OAASzI,EAAa6U,GAAiBA,EAAgB,EAAI,IAAO,KAAS,GAAK7U,CACjF,+CG9sC0B"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/node.cjs b/node_modules/msgpackr/dist/node.cjs
new file mode 100644
index 0000000..a30e60b
--- /dev/null
+++ b/node_modules/msgpackr/dist/node.cjs
@@ -0,0 +1,2560 @@
+'use strict';
+
+var stream = require('stream');
+var module$1 = require('module');
+
+var decoder;
+try {
+	decoder = new TextDecoder();
+} catch(error) {}
+var src;
+var srcEnd;
+var position$1 = 0;
+const EMPTY_ARRAY = [];
+var strings = EMPTY_ARRAY;
+var stringPosition = 0;
+var currentUnpackr = {};
+var currentStructures;
+var srcString;
+var srcStringStart = 0;
+var srcStringEnd = 0;
+var bundledStrings$1;
+var referenceMap;
+var currentExtensions = [];
+var dataView;
+var defaultOptions = {
+	useRecords: false,
+	mapsAsObjects: true
+};
+class C1Type {}
+const C1 = new C1Type();
+C1.name = 'MessagePack 0xC1';
+var sequentialMode = false;
+var inlineObjectReadThreshold = 2;
+
+class Unpackr {
+	constructor(options) {
+		if (options) {
+			if (options.useRecords === false && options.mapsAsObjects === undefined)
+				options.mapsAsObjects = true;
+			if (options.sequential && options.trusted !== false) {
+				options.trusted = true;
+				if (!options.structures && options.useRecords != false) {
+					options.structures = [];
+					if (!options.maxSharedStructures)
+						options.maxSharedStructures = 0;
+				}
+			}
+			if (options.structures)
+				options.structures.sharedLength = options.structures.length;
+			else if (options.getStructures) {
+				(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+				options.structures.sharedLength = 0;
+			}
+			if (options.int64AsNumber) {
+				options.int64AsType = 'number';
+			}
+		}
+		Object.assign(this, options);
+	}
+	unpack(source, options) {
+		if (src) {
+			// re-entrant execution, save the state and restore it after we do this unpack
+			return saveState(() => {
+				clearSource();
+				return this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);
+			});
+		}
+		if (!source.buffer && source.constructor === ArrayBuffer)
+			source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+		if (typeof options === 'object') {
+			srcEnd = options.end || source.length;
+			position$1 = options.start || 0;
+		} else {
+			position$1 = 0;
+			srcEnd = options > -1 ? options : source.length;
+		}
+		stringPosition = 0;
+		srcStringEnd = 0;
+		srcString = null;
+		strings = EMPTY_ARRAY;
+		bundledStrings$1 = null;
+		src = source;
+		// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+		// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+		// new ones
+		try {
+			dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+		} catch(error) {
+			// if it doesn't have a buffer, maybe it is the wrong type of object
+			src = null;
+			if (source instanceof Uint8Array)
+				throw error;
+			throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+		}
+		if (this instanceof Unpackr) {
+			currentUnpackr = this;
+			if (this.structures) {
+				currentStructures = this.structures;
+				return checkedRead(options);
+			} else if (!currentStructures || currentStructures.length > 0) {
+				currentStructures = [];
+			}
+		} else {
+			currentUnpackr = defaultOptions;
+			if (!currentStructures || currentStructures.length > 0)
+				currentStructures = [];
+		}
+		return checkedRead(options);
+	}
+	unpackMultiple(source, forEach) {
+		let values, lastPosition = 0;
+		try {
+			sequentialMode = true;
+			let size = source.length;
+			let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+			if (forEach) {
+				if (forEach(value, lastPosition, position$1) === false) return;
+				while(position$1 < size) {
+					lastPosition = position$1;
+					if (forEach(checkedRead(), lastPosition, position$1) === false) {
+						return;
+					}
+				}
+			}
+			else {
+				values = [ value ];
+				while(position$1 < size) {
+					lastPosition = position$1;
+					values.push(checkedRead());
+				}
+				return values;
+			}
+		} catch(error) {
+			error.lastPosition = lastPosition;
+			error.values = values;
+			throw error;
+		} finally {
+			sequentialMode = false;
+			clearSource();
+		}
+	}
+	_mergeStructures(loadedStructures, existingStructures) {
+		if (this._onLoadedStructures)
+			loadedStructures = this._onLoadedStructures(loadedStructures);
+		loadedStructures = loadedStructures || [];
+		if (Object.isFrozen(loadedStructures))
+			loadedStructures = loadedStructures.map(structure => structure.slice(0));
+		for (let i = 0, l = loadedStructures.length; i < l; i++) {
+			let structure = loadedStructures[i];
+			if (structure) {
+				structure.isShared = true;
+				if (i >= 32)
+					structure.highByte = (i - 32) >> 5;
+			}
+		}
+		loadedStructures.sharedLength = loadedStructures.length;
+		for (let id in existingStructures || []) {
+			if (id >= 0) {
+				let structure = loadedStructures[id];
+				let existing = existingStructures[id];
+				if (existing) {
+					if (structure)
+						(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+					loadedStructures[id] = existing;
+				}
+			}
+		}
+		return this.structures = loadedStructures;
+	}
+	decode(source, options) {
+		return this.unpack(source, options);
+	}
+}
+function checkedRead(options) {
+	try {
+		if (!currentUnpackr.trusted && !sequentialMode) {
+			let sharedLength = currentStructures.sharedLength || 0;
+			if (sharedLength < currentStructures.length)
+				currentStructures.length = sharedLength;
+		}
+		let result;
+		if (currentUnpackr._readStruct && src[position$1] < 0x40 && src[position$1] >= 0x20) {
+			result = currentUnpackr._readStruct(src, position$1, srcEnd);
+			src = null; // dispose of this so that recursive unpack calls don't save state
+			if (!(options && options.lazy) && result)
+				result = result.toJSON();
+			position$1 = srcEnd;
+		} else
+			result = read();
+		if (bundledStrings$1) { // bundled strings to skip past
+			position$1 = bundledStrings$1.postBundlePosition;
+			bundledStrings$1 = null;
+		}
+		if (sequentialMode)
+			// we only need to restore the structures if there was an error, but if we completed a read,
+			// we can clear this out and keep the structures we read
+			currentStructures.restoreStructures = null;
+
+		if (position$1 == srcEnd) {
+			// finished reading this source, cleanup references
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			currentStructures = null;
+			src = null;
+			if (referenceMap)
+				referenceMap = null;
+		} else if (position$1 > srcEnd) {
+			// over read
+			throw new Error('Unexpected end of MessagePack data');
+		} else if (!sequentialMode) {
+			let jsonView;
+			try {
+				jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+			} catch(error) {
+				jsonView = '(JSON view not available ' + error + ')';
+			}
+			throw new Error('Data read, but end of buffer not reached ' + jsonView);
+		}
+		// else more to read, but we are reading sequentially, so don't clear source yet
+		return result;
+	} catch(error) {
+		if (currentStructures && currentStructures.restoreStructures)
+			restoreStructures();
+		clearSource();
+		if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position$1 > srcEnd) {
+			error.incomplete = true;
+		}
+		throw error;
+	}
+}
+
+function restoreStructures() {
+	for (let id in currentStructures.restoreStructures) {
+		currentStructures[id] = currentStructures.restoreStructures[id];
+	}
+	currentStructures.restoreStructures = null;
+}
+
+function read() {
+	let token = src[position$1++];
+	if (token < 0xa0) {
+		if (token < 0x80) {
+			if (token < 0x40)
+				return token;
+			else {
+				let structure = currentStructures[token & 0x3f] ||
+					currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+				if (structure) {
+					if (!structure.read) {
+						structure.read = createStructureReader(structure, token & 0x3f);
+					}
+					return structure.read();
+				} else
+					return token;
+			}
+		} else if (token < 0x90) {
+			// map
+			token -= 0x80;
+			if (currentUnpackr.mapsAsObjects) {
+				let object = {};
+				for (let i = 0; i < token; i++) {
+					let key = readKey();
+					if (key === '__proto__')
+						key = '__proto_';
+					object[key] = read();
+				}
+				return object;
+			} else {
+				let map = new Map();
+				for (let i = 0; i < token; i++) {
+					map.set(read(), read());
+				}
+				return map;
+			}
+		} else {
+			token -= 0x90;
+			let array = new Array(token);
+			for (let i = 0; i < token; i++) {
+				array[i] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(array);
+			return array;
+		}
+	} else if (token < 0xc0) {
+		// fixstr
+		let length = token - 0xa0;
+		if (srcStringEnd >= position$1) {
+			return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+		}
+		if (srcStringEnd == 0 && srcEnd < 140) {
+			// for small blocks, avoiding the overhead of the extract call is helpful
+			let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+			if (string != null)
+				return string;
+		}
+		return readFixedString(length);
+	} else {
+		let value;
+		switch (token) {
+			case 0xc0: return null;
+			case 0xc1:
+				if (bundledStrings$1) {
+					value = read(); // followed by the length of the string in characters (not bytes!)
+					if (value > 0)
+						return bundledStrings$1[1].slice(bundledStrings$1.position1, bundledStrings$1.position1 += value);
+					else
+						return bundledStrings$1[0].slice(bundledStrings$1.position0, bundledStrings$1.position0 -= value);
+				}
+				return C1; // "never-used", return special object to denote that
+			case 0xc2: return false;
+			case 0xc3: return true;
+			case 0xc4:
+				// bin 8
+				value = src[position$1++];
+				if (value === undefined)
+					throw new Error('Unexpected end of buffer');
+				return readBin(value);
+			case 0xc5:
+				// bin 16
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				return readBin(value);
+			case 0xc6:
+				// bin 32
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				return readBin(value);
+			case 0xc7:
+				// ext 8
+				return readExt(src[position$1++]);
+			case 0xc8:
+				// ext 16
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				return readExt(value);
+			case 0xc9:
+				// ext 32
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				return readExt(value);
+			case 0xca:
+				value = dataView.getFloat32(position$1);
+				if (currentUnpackr.useFloat32 > 2) {
+					// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+					let multiplier = mult10[((src[position$1] & 0x7f) << 1) | (src[position$1 + 1] >> 7)];
+					position$1 += 4;
+					return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+				}
+				position$1 += 4;
+				return value;
+			case 0xcb:
+				value = dataView.getFloat64(position$1);
+				position$1 += 8;
+				return value;
+			// uint handlers
+			case 0xcc:
+				return src[position$1++];
+			case 0xcd:
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				return value;
+			case 0xce:
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				return value;
+			case 0xcf:
+				if (currentUnpackr.int64AsType === 'number') {
+					value = dataView.getUint32(position$1) * 0x100000000;
+					value += dataView.getUint32(position$1 + 4);
+				} else if (currentUnpackr.int64AsType === 'string') {
+					value = dataView.getBigUint64(position$1).toString();
+				} else if (currentUnpackr.int64AsType === 'auto') {
+					value = dataView.getBigUint64(position$1);
+					if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+				} else
+					value = dataView.getBigUint64(position$1);
+				position$1 += 8;
+				return value;
+
+			// int handlers
+			case 0xd0:
+				return dataView.getInt8(position$1++);
+			case 0xd1:
+				value = dataView.getInt16(position$1);
+				position$1 += 2;
+				return value;
+			case 0xd2:
+				value = dataView.getInt32(position$1);
+				position$1 += 4;
+				return value;
+			case 0xd3:
+				if (currentUnpackr.int64AsType === 'number') {
+					value = dataView.getInt32(position$1) * 0x100000000;
+					value += dataView.getUint32(position$1 + 4);
+				} else if (currentUnpackr.int64AsType === 'string') {
+					value = dataView.getBigInt64(position$1).toString();
+				} else if (currentUnpackr.int64AsType === 'auto') {
+					value = dataView.getBigInt64(position$1);
+					if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+				} else
+					value = dataView.getBigInt64(position$1);
+				position$1 += 8;
+				return value;
+
+			case 0xd4:
+				// fixext 1
+				value = src[position$1++];
+				if (value == 0x72) {
+					return recordDefinition(src[position$1++] & 0x3f);
+				} else {
+					let extension = currentExtensions[value];
+					if (extension) {
+						if (extension.read) {
+							position$1++; // skip filler byte
+							return extension.read(read());
+						} else if (extension.noBuffer) {
+							position$1++; // skip filler byte
+							return extension();
+						} else
+							return extension(src.subarray(position$1, ++position$1));
+					} else
+						throw new Error('Unknown extension ' + value);
+				}
+			case 0xd5:
+				// fixext 2
+				value = src[position$1];
+				if (value == 0x72) {
+					position$1++;
+					return recordDefinition(src[position$1++] & 0x3f, src[position$1++]);
+				} else
+					return readExt(2);
+			case 0xd6:
+				// fixext 4
+				return readExt(4);
+			case 0xd7:
+				// fixext 8
+				return readExt(8);
+			case 0xd8:
+				// fixext 16
+				return readExt(16);
+			case 0xd9:
+			// str 8
+				value = src[position$1++];
+				if (srcStringEnd >= position$1) {
+					return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+				}
+				return readString8(value);
+			case 0xda:
+			// str 16
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				if (srcStringEnd >= position$1) {
+					return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+				}
+				return readString16(value);
+			case 0xdb:
+			// str 32
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				if (srcStringEnd >= position$1) {
+					return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+				}
+				return readString32(value);
+			case 0xdc:
+			// array 16
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				return readArray(value);
+			case 0xdd:
+			// array 32
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				return readArray(value);
+			case 0xde:
+			// map 16
+				value = dataView.getUint16(position$1);
+				position$1 += 2;
+				return readMap(value);
+			case 0xdf:
+			// map 32
+				value = dataView.getUint32(position$1);
+				position$1 += 4;
+				return readMap(value);
+			default: // negative int
+				if (token >= 0xe0)
+					return token - 0x100;
+				if (token === undefined) {
+					let error = new Error('Unexpected end of MessagePack data');
+					error.incomplete = true;
+					throw error;
+				}
+				throw new Error('Unknown MessagePack token ' + token);
+
+		}
+	}
+}
+const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+function createStructureReader(structure, firstId) {
+	function readObject() {
+		// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+		if (readObject.count++ > inlineObjectReadThreshold) {
+			let optimizedReadObject;
+			try {
+				optimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+					'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+			} catch(error) {
+				// in CF workers, the new Function call could begin to fail at any point in time
+				inlineObjectReadThreshold = Infinity; // disable going forward
+				return readObject(); // recursively try again
+			}
+			if (structure.highByte === 0)
+				structure.read = createSecondByteReader(firstId, structure.read);
+			return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+		}
+		let object = {};
+		for (let i = 0, l = structure.length; i < l; i++) {
+			let key = structure[i];
+			if (key === '__proto__')
+				key = '__proto_';
+			object[key] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(object);
+		return object;
+	}
+	readObject.count = 0;
+	if (structure.highByte === 0) {
+		return createSecondByteReader(firstId, readObject);
+	}
+	return readObject;
+}
+
+const createSecondByteReader = (firstId, read0) => {
+	return function() {
+		let highByte = src[position$1++];
+		if (highByte === 0)
+			return read0();
+		let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+		let structure = currentStructures[id] || loadStructures()[id];
+		if (!structure) {
+			throw new Error('Record id is not defined for ' + id);
+		}
+		if (!structure.read)
+			structure.read = createStructureReader(structure, firstId);
+		return structure.read();
+	};
+};
+
+function loadStructures() {
+	let loadedStructures = saveState(() => {
+		// save the state in case getStructures modifies our buffer
+		src = null;
+		return currentUnpackr.getStructures();
+	});
+	return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+}
+
+var readFixedString = readStringJS;
+var readString8 = readStringJS;
+var readString16 = readStringJS;
+var readString32 = readStringJS;
+exports.isNativeAccelerationEnabled = false;
+
+function setExtractor(extractStrings) {
+	exports.isNativeAccelerationEnabled = true;
+	readFixedString = readString(1);
+	readString8 = readString(2);
+	readString16 = readString(3);
+	readString32 = readString(5);
+	function readString(headerLength) {
+		return function readString(length) {
+			let string = strings[stringPosition++];
+			if (string == null) {
+				if (bundledStrings$1)
+					return readStringJS(length);
+				let byteOffset = src.byteOffset;
+				let extraction = extractStrings(position$1 - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);
+				if (typeof extraction == 'string') {
+					string = extraction;
+					strings = EMPTY_ARRAY;
+				} else {
+					strings = extraction;
+					stringPosition = 1;
+					srcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings
+					string = strings[0];
+					if (string === undefined)
+						throw new Error('Unexpected end of buffer');
+				}
+			}
+			let srcStringLength = string.length;
+			if (srcStringLength <= length) {
+				position$1 += length;
+				return string;
+			}
+			srcString = string;
+			srcStringStart = position$1;
+			srcStringEnd = position$1 + srcStringLength;
+			position$1 += length;
+			return string.slice(0, length); // we know we just want the beginning
+		};
+	}
+}
+function readStringJS(length) {
+	let result;
+	if (length < 16) {
+		if (result = shortStringInJS(length))
+			return result;
+	}
+	if (length > 64 && decoder)
+		return decoder.decode(src.subarray(position$1, position$1 += length));
+	const end = position$1 + length;
+	const units = [];
+	result = '';
+	while (position$1 < end) {
+		const byte1 = src[position$1++];
+		if ((byte1 & 0x80) === 0) {
+			// 1 byte
+			units.push(byte1);
+		} else if ((byte1 & 0xe0) === 0xc0) {
+			// 2 bytes
+			const byte2 = src[position$1++] & 0x3f;
+			const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+			// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+			if (codePoint < 0x80) {
+				units.push(0xFFFD); // replacement character
+			} else {
+				units.push(codePoint);
+			}
+		} else if ((byte1 & 0xf0) === 0xe0) {
+			// 3 bytes
+			const byte2 = src[position$1++] & 0x3f;
+			const byte3 = src[position$1++] & 0x3f;
+			const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+			// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+			// Also reject surrogates (0xD800-0xDFFF)
+			if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+				units.push(0xFFFD); // replacement character
+			} else {
+				units.push(codePoint);
+			}
+		} else if ((byte1 & 0xf8) === 0xf0) {
+			// 4 bytes
+			const byte2 = src[position$1++] & 0x3f;
+			const byte3 = src[position$1++] & 0x3f;
+			const byte4 = src[position$1++] & 0x3f;
+			let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+			// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+			// Also reject values > 0x10FFFF (maximum valid Unicode)
+			if (unit < 0x10000 || unit > 0x10FFFF) {
+				units.push(0xFFFD); // replacement character
+			} else if (unit > 0xffff) {
+				unit -= 0x10000;
+				units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+				unit = 0xdc00 | (unit & 0x3ff);
+				units.push(unit);
+			} else {
+				units.push(unit);
+			}
+		} else {
+			units.push(0xFFFD); // replacement character for invalid lead byte
+		}
+
+		if (units.length >= 0x1000) {
+			result += fromCharCode.apply(String, units);
+			units.length = 0;
+		}
+	}
+
+	if (units.length > 0) {
+		result += fromCharCode.apply(String, units);
+	}
+
+	return result;
+}
+
+function readArray(length) {
+	let array = new Array(length);
+	for (let i = 0; i < length; i++) {
+		array[i] = read();
+	}
+	if (currentUnpackr.freezeData)
+		return Object.freeze(array);
+	return array;
+}
+
+function readMap(length) {
+	if (currentUnpackr.mapsAsObjects) {
+		let object = {};
+		for (let i = 0; i < length; i++) {
+			let key = readKey();
+			if (key === '__proto__')
+				key = '__proto_';
+			object[key] = read();
+		}
+		return object;
+	} else {
+		let map = new Map();
+		for (let i = 0; i < length; i++) {
+			map.set(read(), read());
+		}
+		return map;
+	}
+}
+
+var fromCharCode = String.fromCharCode;
+function longStringInJS(length) {
+	let start = position$1;
+	let bytes = new Array(length);
+	for (let i = 0; i < length; i++) {
+		const byte = src[position$1++];
+		if ((byte & 0x80) > 0) {
+				position$1 = start;
+				return;
+			}
+			bytes[i] = byte;
+		}
+		return fromCharCode.apply(String, bytes);
+}
+function shortStringInJS(length) {
+	if (length < 4) {
+		if (length < 2) {
+			if (length === 0)
+				return '';
+			else {
+				let a = src[position$1++];
+				if ((a & 0x80) > 1) {
+					position$1 -= 1;
+					return;
+				}
+				return fromCharCode(a);
+			}
+		} else {
+			let a = src[position$1++];
+			let b = src[position$1++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+				position$1 -= 2;
+				return;
+			}
+			if (length < 3)
+				return fromCharCode(a, b);
+			let c = src[position$1++];
+			if ((c & 0x80) > 0) {
+				position$1 -= 3;
+				return;
+			}
+			return fromCharCode(a, b, c);
+		}
+	} else {
+		let a = src[position$1++];
+		let b = src[position$1++];
+		let c = src[position$1++];
+		let d = src[position$1++];
+		if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+			position$1 -= 4;
+			return;
+		}
+		if (length < 6) {
+			if (length === 4)
+				return fromCharCode(a, b, c, d);
+			else {
+				let e = src[position$1++];
+				if ((e & 0x80) > 0) {
+					position$1 -= 5;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e);
+			}
+		} else if (length < 8) {
+			let e = src[position$1++];
+			let f = src[position$1++];
+			if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+				position$1 -= 6;
+				return;
+			}
+			if (length < 7)
+				return fromCharCode(a, b, c, d, e, f);
+			let g = src[position$1++];
+			if ((g & 0x80) > 0) {
+				position$1 -= 7;
+				return;
+			}
+			return fromCharCode(a, b, c, d, e, f, g);
+		} else {
+			let e = src[position$1++];
+			let f = src[position$1++];
+			let g = src[position$1++];
+			let h = src[position$1++];
+			if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+				position$1 -= 8;
+				return;
+			}
+			if (length < 10) {
+				if (length === 8)
+					return fromCharCode(a, b, c, d, e, f, g, h);
+				else {
+					let i = src[position$1++];
+					if ((i & 0x80) > 0) {
+						position$1 -= 9;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i);
+				}
+			} else if (length < 12) {
+				let i = src[position$1++];
+				let j = src[position$1++];
+				if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+					position$1 -= 10;
+					return;
+				}
+				if (length < 11)
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+				let k = src[position$1++];
+				if ((k & 0x80) > 0) {
+					position$1 -= 11;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+			} else {
+				let i = src[position$1++];
+				let j = src[position$1++];
+				let k = src[position$1++];
+				let l = src[position$1++];
+				if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+					position$1 -= 12;
+					return;
+				}
+				if (length < 14) {
+					if (length === 12)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+					else {
+						let m = src[position$1++];
+						if ((m & 0x80) > 0) {
+							position$1 -= 13;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+					}
+				} else {
+					let m = src[position$1++];
+					let n = src[position$1++];
+					if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+						position$1 -= 14;
+						return;
+					}
+					if (length < 15)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+					let o = src[position$1++];
+					if ((o & 0x80) > 0) {
+						position$1 -= 15;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+				}
+			}
+		}
+	}
+}
+
+function readOnlyJSString() {
+	let token = src[position$1++];
+	let length;
+	if (token < 0xc0) {
+		// fixstr
+		length = token - 0xa0;
+	} else {
+		switch(token) {
+			case 0xd9:
+			// str 8
+				length = src[position$1++];
+				break;
+			case 0xda:
+			// str 16
+				length = dataView.getUint16(position$1);
+				position$1 += 2;
+				break;
+			case 0xdb:
+			// str 32
+				length = dataView.getUint32(position$1);
+				position$1 += 4;
+				break;
+			default:
+				throw new Error('Expected string');
+		}
+	}
+	return readStringJS(length);
+}
+
+
+function readBin(length) {
+	return currentUnpackr.copyBuffers ?
+		// specifically use the copying slice (not the node one)
+		Uint8Array.prototype.slice.call(src, position$1, position$1 += length) :
+		src.subarray(position$1, position$1 += length);
+}
+function readExt(length) {
+	let type = src[position$1++];
+	if (currentExtensions[type]) {
+		let end;
+		return currentExtensions[type](src.subarray(position$1, end = (position$1 += length)), (readPosition) => {
+			position$1 = readPosition;
+			try {
+				return read();
+			} finally {
+				position$1 = end;
+			}
+		});
+	}
+	else
+		throw new Error('Unknown extension type ' + type);
+}
+
+var keyCache = new Array(4096);
+function readKey() {
+	let length = src[position$1++];
+	if (length >= 0xa0 && length < 0xc0) {
+		// fixstr, potentially use key cache
+		length = length - 0xa0;
+		if (srcStringEnd >= position$1) // if it has been extracted, must use it (and faster anyway)
+			return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+		else if (!(srcStringEnd == 0 && srcEnd < 180))
+			return readFixedString(length);
+	} else { // not cacheable, go back and do a standard read
+		position$1--;
+		return asSafeString(read());
+	}
+	let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position$1) : length > 0 ? src[position$1] : 0)) & 0xfff;
+	let entry = keyCache[key];
+	let checkPosition = position$1;
+	let end = position$1 + length - 3;
+	let chunk;
+	let i = 0;
+	if (entry && entry.bytes == length) {
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			if (chunk != entry[i++]) {
+				checkPosition = 0x70000000;
+				break;
+			}
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			if (chunk != entry[i++]) {
+				checkPosition = 0x70000000;
+				break;
+			}
+		}
+		if (checkPosition === end) {
+			position$1 = checkPosition;
+			return entry.string;
+		}
+		end -= 3;
+		checkPosition = position$1;
+	}
+	entry = [];
+	keyCache[key] = entry;
+	entry.bytes = length;
+	while (checkPosition < end) {
+		chunk = dataView.getUint32(checkPosition);
+		entry.push(chunk);
+		checkPosition += 4;
+	}
+	end += 3;
+	while (checkPosition < end) {
+		chunk = src[checkPosition++];
+		entry.push(chunk);
+	}
+	// for small blocks, avoiding the overhead of the extract call is helpful
+	let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+	if (string != null)
+		return entry.string = string;
+	return entry.string = readFixedString(length);
+}
+
+function asSafeString(property) {
+	// protect against expensive (DoS) string conversions
+	if (typeof property === 'string') return property;
+	if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+	if (property == null) return property + '';
+	if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+		return property.flat().toString();
+	}
+	throw new Error(`Invalid property type for record: ${typeof property}`);
+}
+// the registration of the record definition extension (as "r")
+const recordDefinition = (id, highByte) => {
+	let structure = read().map(asSafeString); // ensure that all keys are strings and
+	// that the array is mutable
+	let firstByte = id;
+	if (highByte !== undefined) {
+		id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+		structure.highByte = highByte;
+	}
+	let existingStructure = currentStructures[id];
+	// If it is a shared structure, we need to restore any changes after reading.
+	// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+	// to the state prior to an incomplete read in order to properly resume.
+	if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+		(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+	}
+	currentStructures[id] = structure;
+	structure.read = createStructureReader(structure, firstByte);
+	return structure.read();
+};
+currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+currentExtensions[0].noBuffer = true;
+
+currentExtensions[0x42] = data => {
+	let headLength = (data.byteLength % 8) || 8;
+	let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+	for (let i = 1; i < headLength; i++) {
+		head <<= BigInt(8);
+		head += BigInt(data[i]);
+	}
+	if (data.byteLength !== headLength) {
+		let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+		let decode = (start, end) => {
+			let length = end - start;
+			if (length <= 40) {
+				let out = view.getBigUint64(start);
+				for (let i = start + 8; i < end; i += 8) {
+					out <<= BigInt(64);
+					out |= view.getBigUint64(i);
+				}
+				return out;
+			}
+			// if (length === 8) return view.getBigUint64(start)
+			let middle = start + (length >> 4 << 3);
+			let left = decode(start, middle);
+			let right = decode(middle, end);
+			return (left << BigInt((end - middle) * 8)) | right;
+		};
+		head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+	}
+	return head;
+};
+
+let errors = {
+	Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+};
+currentExtensions[0x65] = () => {
+	let data = read();
+	if (!errors[data[0]]) {
+		let error = Error(data[1], { cause: data[2] });
+		error.name = data[0];
+		return error;
+	}
+	return errors[data[0]](data[1], { cause: data[2] });
+};
+
+currentExtensions[0x69] = (data) => {
+	// id extension (for structured clones)
+	if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+	let id = dataView.getUint32(position$1 - 4);
+	if (!referenceMap)
+		referenceMap = new Map();
+	let token = src[position$1];
+	let target;
+	// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+	if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+		target = [];
+	else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+		target = new Map();
+	else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position$1 + 1] === 0x73)
+		target = new Set();
+	else
+		target = {};
+
+	let refEntry = { target }; // a placeholder object
+	referenceMap.set(id, refEntry);
+	let targetProperties = read(); // read the next value as the target object to id
+	if (!refEntry.used) {
+		// no cycle, can just use the returned read object
+		return refEntry.target = targetProperties; // replace the placeholder with the real one
+	} else {
+		// there is a cycle, so we have to assign properties to original target
+		Object.assign(target, targetProperties);
+	}
+
+	// copy over map/set entries if we're able to
+	if (target instanceof Map)
+		for (let [k, v] of targetProperties.entries()) target.set(k, v);
+	if (target instanceof Set)
+		for (let i of Array.from(targetProperties)) target.add(i);
+	return target;
+};
+
+currentExtensions[0x70] = (data) => {
+	// pointer extension (for structured clones)
+	if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+	let id = dataView.getUint32(position$1 - 4);
+	let refEntry = referenceMap.get(id);
+	refEntry.used = true;
+	return refEntry.target;
+};
+
+currentExtensions[0x73] = () => new Set(read());
+
+const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+let glbl = typeof globalThis === 'object' ? globalThis : window;
+currentExtensions[0x74] = (data) => {
+	let typeCode = data[0];
+	// we always have to slice to get a new ArrayBuffer that is aligned
+	let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+	let typedArrayName = typedArrays[typeCode];
+	if (!typedArrayName) {
+		if (typeCode === 16) return buffer;
+		if (typeCode === 17) return new DataView(buffer);
+		throw new Error('Could not find typed array for code ' + typeCode);
+	}
+	return new glbl[typedArrayName](buffer);
+};
+currentExtensions[0x78] = () => {
+	let data = read();
+	return new RegExp(data[0], data[1]);
+};
+const TEMP_BUNDLE = [];
+currentExtensions[0x62] = (data) => {
+	let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+	let dataPosition = position$1;
+	position$1 += dataSize - data.length;
+	bundledStrings$1 = TEMP_BUNDLE;
+	bundledStrings$1 = [readOnlyJSString(), readOnlyJSString()];
+	bundledStrings$1.position0 = 0;
+	bundledStrings$1.position1 = 0;
+	bundledStrings$1.postBundlePosition = position$1;
+	position$1 = dataPosition;
+	return read();
+};
+
+currentExtensions[0xff] = (data) => {
+	// 32-bit date extension
+	if (data.length == 4)
+		return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+	else if (data.length == 8)
+		return new Date(
+			((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+			((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+	else if (data.length == 12)
+		return new Date(
+			((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+			(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+	else
+		return new Date('invalid');
+};
+// registration of bulk record definition?
+// currentExtensions[0x52] = () =>
+
+function saveState(callback) {
+	if (currentUnpackr && currentUnpackr._onSaveState)
+		currentUnpackr._onSaveState();
+	let savedSrcEnd = srcEnd;
+	let savedPosition = position$1;
+	let savedStringPosition = stringPosition;
+	let savedSrcStringStart = srcStringStart;
+	let savedSrcStringEnd = srcStringEnd;
+	let savedSrcString = srcString;
+	let savedStrings = strings;
+	let savedReferenceMap = referenceMap;
+	let savedBundledStrings = bundledStrings$1;
+
+	// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+	let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+	let savedStructures = currentStructures;
+	let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+	let savedPackr = currentUnpackr;
+	let savedSequentialMode = sequentialMode;
+	let value = callback();
+	srcEnd = savedSrcEnd;
+	position$1 = savedPosition;
+	stringPosition = savedStringPosition;
+	srcStringStart = savedSrcStringStart;
+	srcStringEnd = savedSrcStringEnd;
+	srcString = savedSrcString;
+	strings = savedStrings;
+	referenceMap = savedReferenceMap;
+	bundledStrings$1 = savedBundledStrings;
+	src = savedSrc;
+	sequentialMode = savedSequentialMode;
+	currentStructures = savedStructures;
+	currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+	currentUnpackr = savedPackr;
+	dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+	return value;
+}
+function clearSource() {
+	src = null;
+	referenceMap = null;
+	currentStructures = null;
+}
+
+function addExtension$1(extension) {
+	if (extension.unpack)
+		currentExtensions[extension.type] = extension.unpack;
+	else
+		currentExtensions[extension.type] = extension;
+}
+
+const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+for (let i = 0; i < 256; i++) {
+	mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+}
+const Decoder = Unpackr;
+var defaultUnpackr = new Unpackr({ useRecords: false });
+const unpack = defaultUnpackr.unpack;
+const unpackMultiple = defaultUnpackr.unpackMultiple;
+const decode = defaultUnpackr.unpack;
+const FLOAT32_OPTIONS = {
+	NEVER: 0,
+	ALWAYS: 1,
+	DECIMAL_ROUND: 3,
+	DECIMAL_FIT: 4
+};
+let f32Array = new Float32Array(1);
+let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+function roundFloat32(float32Number) {
+	f32Array[0] = float32Number;
+	let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+	return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+}
+// Marker for downstream libraries (e.g. structon) to detect per-instance
+// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+// this._onSaveState).  See `checkedRead` for the dispatch.
+Unpackr.SUPPORTS_STRUCT_HOOKS = true;
+
+let textEncoder;
+try {
+	textEncoder = new TextEncoder();
+} catch (error) {}
+let extensions, extensionClasses;
+const hasNodeBuffer = typeof Buffer !== 'undefined';
+const ByteArrayAllocate = hasNodeBuffer ?
+	function(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;
+const ByteArray = hasNodeBuffer ? Buffer : Uint8Array;
+const MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;
+let target, keysTarget;
+let targetView;
+let position = 0;
+let safeEnd;
+let bundledStrings = null;
+const MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.
+const hasNonLatin = /[\u0080-\uFFFF]/;
+const RECORD_SYMBOL = Symbol('record-id');
+class Packr extends Unpackr {
+	constructor(options) {
+		super(options);
+		this.offset = 0;
+		let start;
+		let hasSharedUpdate;
+		let structures;
+		let referenceMap;
+		let encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {
+			return target.utf8Write(string, position, target.byteLength - position);
+		} : (textEncoder && textEncoder.encodeInto) ?
+			function(string, position) {
+				return textEncoder.encodeInto(string, target.subarray(position)).written;
+			} : false;
+
+		let packr = this;
+		if (!options)
+			options = {};
+		let isSequential = options && options.sequential;
+		let hasSharedStructures = options.structures || options.saveStructures;
+		let maxSharedStructures = options.maxSharedStructures;
+		if (maxSharedStructures == null)
+			maxSharedStructures = hasSharedStructures ? 32 : 0;
+		if (maxSharedStructures > 8160)
+			throw new Error('Maximum maxSharedStructure is 8160');
+		if (options.structuredClone && options.moreTypes == undefined) {
+			this.moreTypes = true;
+		}
+		let maxOwnStructures = options.maxOwnStructures;
+		if (maxOwnStructures == null)
+			maxOwnStructures = hasSharedStructures ? 32 : 64;
+		if (!this.structures && options.useRecords != false)
+			this.structures = [];
+		// two byte record ids for shared structures
+		let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
+		let sharedLimitId = maxSharedStructures + 0x40;
+		let maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;
+		if (maxStructureId > 8256) {
+			throw new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');
+		}
+		let recordIdsToRemove = [];
+		let transitionsCount = 0;
+		let serializationsSinceTransitionRebuild = 0;
+
+		this.pack = this.encode = function(value, encodeOptions) {
+			if (!target) {
+				target = new ByteArrayAllocate(8192);
+				targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));
+				position = 0;
+			}
+			safeEnd = target.length - 10;
+			if (safeEnd - position < 0x800) {
+				// don't start too close to the end,
+				target = new ByteArrayAllocate(target.length);
+				targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));
+				safeEnd = target.length - 10;
+				position = 0;
+			} else
+				position = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster
+			start = position;
+			if (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);
+			referenceMap = packr.structuredClone ? new Map() : null;
+			if (packr.bundleStrings && typeof value !== 'string') {
+				bundledStrings = [];
+				bundledStrings.size = Infinity; // force a new bundle start on first string
+			} else
+				bundledStrings = null;
+			structures = packr.structures;
+			if (structures) {
+				if (structures.uninitialized)
+					structures = packr._mergeStructures(packr.getStructures());
+				let sharedLength = structures.sharedLength || 0;
+				if (sharedLength > maxSharedStructures) {
+					//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
+					throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);
+				}
+				if (!structures.transitions) {
+					// rebuild our structure transitions
+					structures.transitions = Object.create(null);
+					for (let i = 0; i < sharedLength; i++) {
+						let keys = structures[i];
+						if (!keys)
+							continue;
+						let nextTransition, transition = structures.transitions;
+						for (let j = 0, l = keys.length; j < l; j++) {
+							let key = keys[j];
+							nextTransition = transition[key];
+							if (!nextTransition) {
+								nextTransition = transition[key] = Object.create(null);
+							}
+							transition = nextTransition;
+						}
+						transition[RECORD_SYMBOL] = i + 0x40;
+					}
+					this.lastNamedStructuresLength = sharedLength;
+				}
+				if (!isSequential) {
+					structures.nextId = sharedLength + 0x40;
+				}
+			}
+			if (hasSharedUpdate)
+				hasSharedUpdate = false;
+			let encodingError;
+			try {
+				if (packr._writeStruct && value && typeof value === 'object') {
+					if (value.constructor === Object) writeStruct(value); // simple object
+					else if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {
+						// allow user classes, if they don't need special handling (but do use toJSON if available)
+						writeStruct(value.toJSON ? value.toJSON() : value);
+					} else pack(value);
+				} else
+					pack(value);
+				let lastBundle = bundledStrings;
+				if (bundledStrings)
+					writeBundles(start, pack, 0);
+				if (referenceMap && referenceMap.idsToInsert) {
+					let idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);
+					let i = idsToInsert.length;
+					let incrementPosition = -1;
+					while (lastBundle && i > 0) {
+						let insertionPoint = idsToInsert[--i].offset + start;
+						if (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)
+							incrementPosition = 0;
+						if (insertionPoint > (lastBundle.position + start)) {
+							if (incrementPosition >= 0)
+								incrementPosition += 6;
+						} else {
+							if (incrementPosition >= 0) {
+								// update the bundle reference now
+								targetView.setUint32(lastBundle.position + start,
+									targetView.getUint32(lastBundle.position + start) + incrementPosition);
+								incrementPosition = -1; // reset
+							}
+							lastBundle = lastBundle.previous;
+							i++;
+						}
+					}
+					if (incrementPosition >= 0 && lastBundle) {
+						// update the bundle reference now
+						targetView.setUint32(lastBundle.position + start,
+							targetView.getUint32(lastBundle.position + start) + incrementPosition);
+					}
+					position += idsToInsert.length * 6;
+					if (position > safeEnd)
+						makeRoom(position);
+					packr.offset = position;
+					let serialized = insertIds(target.subarray(start, position), idsToInsert);
+					referenceMap = null;
+					return serialized;
+				}
+				packr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
+				if (encodeOptions & REUSE_BUFFER_MODE) {
+					target.start = start;
+					target.end = position;
+					return target;
+				}
+				return target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now
+			} catch(error) {
+				encodingError = error;
+				throw error;
+			} finally {
+				if (structures) {
+					resetStructures();
+					if (hasSharedUpdate && packr.saveStructures) {
+						let sharedLength = structures.sharedLength || 0;
+						// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
+						let returnBuffer = target.subarray(start, position);
+						let newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);
+						if (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time
+							if (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {
+								// get updated structures and try again if the update failed
+								return packr.pack(value, encodeOptions);
+							}
+							packr.lastNamedStructuresLength = sharedLength;
+							// don't keep large buffers around
+							if (target.length > 0x40000000) target = null;
+							return returnBuffer;
+						}
+					}
+				}
+				// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)
+				if (target.length > 0x40000000) target = null;
+				if (encodeOptions & RESET_BUFFER_MODE)
+					position = start;
+			}
+		};
+		const resetStructures = () => {
+			if (serializationsSinceTransitionRebuild < 10)
+				serializationsSinceTransitionRebuild++;
+			let sharedLength = structures.sharedLength || 0;
+			if (structures.length > sharedLength && !isSequential)
+				structures.length = sharedLength;
+			if (transitionsCount > 10000) {
+				// force a rebuild occasionally after a lot of transitions so it can get cleaned up
+				structures.transitions = null;
+				serializationsSinceTransitionRebuild = 0;
+				transitionsCount = 0;
+				if (recordIdsToRemove.length > 0)
+					recordIdsToRemove = [];
+			} else if (recordIdsToRemove.length > 0 && !isSequential) {
+				for (let i = 0, l = recordIdsToRemove.length; i < l; i++) {
+					recordIdsToRemove[i][RECORD_SYMBOL] = 0;
+				}
+				recordIdsToRemove = [];
+			}
+		};
+		const packArray = (value) => {
+			var length = value.length;
+			if (length < 0x10) {
+				target[position++] = 0x90 | length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xdc;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xdd;
+				targetView.setUint32(position, length);
+				position += 4;
+			}
+			for (let i = 0; i < length; i++) {
+				pack(value[i]);
+			}
+		};
+		const pack = (value) => {
+			if (position > safeEnd)
+				target = makeRoom(position);
+
+			var type = typeof value;
+			var length;
+			if (type === 'string') {
+				let strLength = value.length;
+				if (bundledStrings && strLength >= 4 && strLength < 0x1000) {
+					if ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {
+						let extStart;
+						let maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;
+						if (position + maxBytes > safeEnd)
+							target = makeRoom(position + maxBytes);
+						let lastBundle;
+						if (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle
+							lastBundle = bundledStrings;
+							target[position] = 0xc8; // ext 16
+							position += 3; // reserve for the writing bundle size
+							target[position++] = 0x62; // 'b'
+							extStart = position - start;
+							position += 4; // reserve for writing bundle reference
+							writeBundles(start, pack, 0); // write the last bundles
+							targetView.setUint16(extStart + start - 3, position - start - extStart);
+						} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)
+							target[position++] = 0xd6; // fixext 4
+							target[position++] = 0x62; // 'b'
+							extStart = position - start;
+							position += 4; // reserve for writing bundle reference
+						}
+						bundledStrings = ['', '']; // create new ones
+						bundledStrings.previous = lastBundle;
+						bundledStrings.size = 0;
+						bundledStrings.position = extStart;
+					}
+					let twoByte = hasNonLatin.test(value);
+					bundledStrings[twoByte ? 0 : 1] += value;
+					target[position++] = 0xc1;
+					pack(twoByte ? -strLength : strLength);
+					return;
+				}
+				let headerSize;
+				// first we estimate the header size, so we can write to the correct location
+				if (strLength < 0x20) {
+					headerSize = 1;
+				} else if (strLength < 0x100) {
+					headerSize = 2;
+				} else if (strLength < 0x10000) {
+					headerSize = 3;
+				} else {
+					headerSize = 5;
+				}
+				let maxBytes = strLength * 3;
+				if (position + maxBytes > safeEnd)
+					target = makeRoom(position + maxBytes);
+
+				if (strLength < 0x40 || !encodeUtf8) {
+					let i, c1, c2, strPosition = position + headerSize;
+					for (i = 0; i < strLength; i++) {
+						c1 = value.charCodeAt(i);
+						if (c1 < 0x80) {
+							target[strPosition++] = c1;
+						} else if (c1 < 0x800) {
+							target[strPosition++] = c1 >> 6 | 0xc0;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						} else if (
+							(c1 & 0xfc00) === 0xd800 &&
+							((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00
+						) {
+							c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+							i++;
+							target[strPosition++] = c1 >> 18 | 0xf0;
+							target[strPosition++] = c1 >> 12 & 0x3f | 0x80;
+							target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						} else {
+							target[strPosition++] = c1 >> 12 | 0xe0;
+							target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						}
+					}
+					length = strPosition - position - headerSize;
+				} else {
+					length = encodeUtf8(value, position + headerSize);
+				}
+
+				if (length < 0x20) {
+					target[position++] = 0xa0 | length;
+				} else if (length < 0x100) {
+					if (headerSize < 2) {
+						target.copyWithin(position + 2, position + 1, position + 1 + length);
+					}
+					target[position++] = 0xd9;
+					target[position++] = length;
+				} else if (length < 0x10000) {
+					if (headerSize < 3) {
+						target.copyWithin(position + 3, position + 2, position + 2 + length);
+					}
+					target[position++] = 0xda;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					if (headerSize < 5) {
+						target.copyWithin(position + 5, position + 3, position + 3 + length);
+					}
+					target[position++] = 0xdb;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				position += length;
+			} else if (type === 'number') {
+				if (value >>> 0 === value) {// positive integer, 32-bit or less
+					// positive uint
+					if (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {
+						target[position++] = value;
+					} else if (value < 0x100) {
+						target[position++] = 0xcc;
+						target[position++] = value;
+					} else if (value < 0x10000) {
+						target[position++] = 0xcd;
+						target[position++] = value >> 8;
+						target[position++] = value & 0xff;
+					} else {
+						target[position++] = 0xce;
+						targetView.setUint32(position, value);
+						position += 4;
+					}
+				} else if (value >> 0 === value) { // negative integer
+					if (value >= -0x20) {
+						target[position++] = 0x100 + value;
+					} else if (value >= -0x80) {
+						target[position++] = 0xd0;
+						target[position++] = value + 0x100;
+					} else if (value >= -0x8000) {
+						target[position++] = 0xd1;
+						targetView.setInt16(position, value);
+						position += 2;
+					} else {
+						target[position++] = 0xd2;
+						targetView.setInt32(position, value);
+						position += 4;
+					}
+				} else {
+					let useFloat32;
+					if ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {
+						target[position++] = 0xca;
+						targetView.setFloat32(position, value);
+						let xShifted;
+						if (useFloat32 < 4 ||
+								// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+								((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {
+							position += 4;
+							return;
+						} else
+							position--; // move back into position for writing a double
+					}
+					target[position++] = 0xcb;
+					targetView.setFloat64(position, value);
+					position += 8;
+				}
+			} else if (type === 'object' || type === 'function') {
+				if (!value)
+					target[position++] = 0xc0;
+				else {
+					if (referenceMap) {
+						let referee = referenceMap.get(value);
+						if (referee) {
+							if (!referee.id) {
+								let idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);
+								referee.id = idsToInsert.push(referee);
+							}
+							target[position++] = 0xd6; // fixext 4
+							target[position++] = 0x70; // "p" for pointer
+							targetView.setUint32(position, referee.id);
+							position += 4;
+							return;
+						} else
+							referenceMap.set(value, { offset: position - start });
+					}
+					let constructor = value.constructor;
+					if (constructor === Object) {
+						writeObject(value);
+					} else if (constructor === Array) {
+						packArray(value);
+					} else if (constructor === Map) {
+						if (this.mapAsEmptyObject) target[position++] = 0x80;
+						else {
+							length = value.size;
+							if (length < 0x10) {
+								target[position++] = 0x80 | length;
+							} else if (length < 0x10000) {
+								target[position++] = 0xde;
+								target[position++] = length >> 8;
+								target[position++] = length & 0xff;
+							} else {
+								target[position++] = 0xdf;
+								targetView.setUint32(position, length);
+								position += 4;
+							}
+							for (let [key, entryValue] of value) {
+								pack(key);
+								pack(entryValue);
+							}
+						}
+					} else {
+						for (let i = 0, l = extensions.length; i < l; i++) {
+							let extensionClass = extensionClasses[i];
+							if (value instanceof extensionClass) {
+								let extension = extensions[i];
+								if (extension.write) {
+									if (extension.type) {
+										target[position++] = 0xd4; // one byte "tag" extension
+										target[position++] = extension.type;
+										target[position++] = 0;
+									}
+									let writeResult = extension.write.call(this, value);
+									if (writeResult === value) { // avoid infinite recursion
+										if (Array.isArray(value)) {
+											packArray(value);
+										} else {
+											writeObject(value);
+										}
+									} else {
+										pack(writeResult);
+									}
+									return;
+								}
+								let currentTarget = target;
+								let currentTargetView = targetView;
+								let currentPosition = position;
+								target = null;
+								let result;
+								try {
+									result = extension.pack.call(this, value, (size) => {
+										// restore target and use it
+										target = currentTarget;
+										currentTarget = null;
+										position += size;
+										if (position > safeEnd)
+											makeRoom(position);
+										return {
+											target, targetView, position: position - size
+										};
+									}, pack);
+								} finally {
+									// restore current target information (unless already restored)
+									if (currentTarget) {
+										target = currentTarget;
+										targetView = currentTargetView;
+										position = currentPosition;
+										safeEnd = target.length - 10;
+									}
+								}
+								if (result) {
+									if (result.length + position > safeEnd)
+										makeRoom(result.length + position);
+									position = writeExtensionData(result, target, position, extension.type);
+								}
+								return;
+							}
+						}
+						// check isArray after extensions, because extensions can extend Array
+						if (Array.isArray(value)) {
+							packArray(value);
+						} else {
+							// use this as an alternate mechanism for expressing how to serialize
+							if (value.toJSON) {
+								const json = value.toJSON();
+								// if for some reason value.toJSON returns itself it'll loop forever
+								if (json !== value)
+									return pack(json);
+							}
+
+							// if there is a writeFunction, use it, otherwise just encode as undefined
+							if (type === 'function')
+								return pack(this.writeFunction && this.writeFunction(value));
+
+							// no extension found, write as plain object
+							writeObject(value);
+						}
+					}
+				}
+			} else if (type === 'boolean') {
+				target[position++] = value ? 0xc3 : 0xc2;
+			} else if (type === 'bigint') {
+				if (value < 0x8000000000000000 && value >= -0x8000000000000000) {
+					// use a signed int as long as it fits
+					target[position++] = 0xd3;
+					targetView.setBigInt64(position, value);
+				} else if (value < 0x10000000000000000 && value > 0) {
+					// if we can fit an unsigned int, use that
+					target[position++] = 0xcf;
+					targetView.setBigUint64(position, value);
+				} else {
+					// overflow
+					if (this.largeBigIntToFloat) {
+						target[position++] = 0xcb;
+						targetView.setFloat64(position, Number(value));
+					} else if (this.largeBigIntToString) {
+						return pack(value.toString());
+					} else if (this.useBigIntExtension || this.moreTypes) {
+						let empty = value < 0 ? BigInt(-1) : BigInt(0);
+
+						let array;
+						if (value >> BigInt(0x10000) === empty) {
+							let mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow
+							let chunks = [];
+							while (true) {
+								chunks.push(value & mask);
+								if ((value >> BigInt(63)) === empty) break;
+								value >>= BigInt(64);
+							}
+
+							array = new Uint8Array(new BigUint64Array(chunks).buffer);
+							array.reverse();
+						} else {
+							let invert = value < 0;
+							let string = (invert ? ~value : value).toString(16);
+							if (string.length % 2) {
+								string = '0' + string;
+							} else if (parseInt(string.charAt(0), 16) >= 8) {
+								string = '00' + string;
+							}
+
+							if (hasNodeBuffer) {
+								array = Buffer.from(string, 'hex');
+							} else {
+								array = new Uint8Array(string.length / 2);
+								for (let i = 0; i < array.length; i++) {
+									array[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);
+								}
+							}
+
+							if (invert) {
+								for (let i = 0; i < array.length; i++) array[i] = ~array[i];
+							}
+						}
+
+						if (array.length + position > safeEnd)
+							makeRoom(array.length + position);
+						position = writeExtensionData(array, target, position, 0x42);
+						return;
+					} else {
+						throw new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +
+							' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +
+							' largeBigIntToString to convert to string');
+					}
+				}
+				position += 8;
+			} else if (type === 'undefined') {
+				if (this.encodeUndefinedAsNil)
+					target[position++] = 0xc0;
+				else {
+					target[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite
+					target[position++] = 0;
+					target[position++] = 0;
+				}
+			} else {
+				throw new Error('Unknown type: ' + type);
+			}
+		};
+
+		const writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {
+			// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
+			let keys;
+			if (this.skipValues) {
+				keys = [];
+				for (let key in object) {
+					if ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&
+						!this.skipValues.includes(object[key]))
+						keys.push(key);
+				}
+			} else {
+				keys = Object.keys(object);
+			}
+			let length = keys.length;
+			if (length < 0x10) {
+				target[position++] = 0x80 | length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xde;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xdf;
+				targetView.setUint32(position, length);
+				position += 4;
+			}
+			let key;
+			if (this.coercibleKeyAsNumber) {
+				for (let i = 0; i < length; i++) {
+					key = keys[i];
+					let num = Number(key);
+					pack(isNaN(num) ? key : num);
+					pack(object[key]);
+				}
+
+			} else {
+				for (let i = 0; i < length; i++) {
+					pack(key = keys[i]);
+					pack(object[key]);
+				}
+			}
+		} :
+		(object) => {
+			target[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards
+			let objectOffset = position - start;
+			position += 2;
+			let size = 0;
+			for (let key in object) {
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					pack(key);
+					pack(object[key]);
+					size++;
+				}
+			}
+			if (size > 0xffff) {
+				throw new Error('Object is too large to serialize with fast 16-bit map size,' +
+				' use the "variableMapSize" option to serialize this object');
+			}
+			target[objectOffset++ + start] = size >> 8;
+			target[objectOffset + start] = size & 0xff;
+		};
+
+		const writeRecord = this.useRecords === false ? writePlainObject :
+		(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
+		(object) => {
+			let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+			let objectOffset = position++ - start;
+			let wroteKeys;
+			for (let key in object) {
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					nextTransition = transition[key];
+					if (nextTransition)
+						transition = nextTransition;
+					else {
+						// record doesn't exist, create full new record and insert it
+						let keys = Object.keys(object);
+						let lastTransition = transition;
+						transition = structures.transitions;
+						let newTransitions = 0;
+						for (let i = 0, l = keys.length; i < l; i++) {
+							let key = keys[i];
+							nextTransition = transition[key];
+							if (!nextTransition) {
+								nextTransition = transition[key] = Object.create(null);
+								newTransitions++;
+							}
+							transition = nextTransition;
+						}
+						if (objectOffset + start + 1 == position) {
+							// first key, so we don't need to insert, we can just write record directly
+							position--;
+							newRecord(transition, keys, newTransitions);
+						} else // otherwise we need to insert the record, moving existing data after the record
+							insertNewRecord(transition, keys, objectOffset, newTransitions);
+						wroteKeys = true;
+						transition = lastTransition[key];
+					}
+					pack(object[key]);
+				}
+			}
+			if (!wroteKeys) {
+				let recordId = transition[RECORD_SYMBOL];
+				if (recordId)
+					target[objectOffset + start] = recordId;
+				else
+					insertNewRecord(transition, Object.keys(object), objectOffset, 0);
+			}
+		} :
+		(object) => {
+			let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+			let newTransitions = 0;
+			for (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+				nextTransition = transition[key];
+				if (!nextTransition) {
+					nextTransition = transition[key] = Object.create(null);
+					newTransitions++;
+				}
+				transition = nextTransition;
+			}
+			let recordId = transition[RECORD_SYMBOL];
+			if (recordId) {
+				if (recordId >= 0x60 && useTwoByteRecords) {
+					target[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;
+					target[position++] = recordId >> 5;
+				} else
+					target[position++] = recordId;
+			} else {
+				newRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);
+			}
+			// now write the values
+			for (let key in object)
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					pack(object[key]);
+				}
+		};
+
+		// create reference to useRecords if useRecords is a function
+		const checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;
+
+		const writeObject = checkUseRecords ? (object) => {
+			checkUseRecords(object) ? writeRecord(object) : writePlainObject(object);
+		} : writeRecord;
+
+		const writeStruct = (object) => {
+			let newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {
+				if (notifySharedUpdate)
+					return hasSharedUpdate = true;
+				position = newPosition;
+				let startTarget = target;
+				pack(value);
+				resetStructures();
+				if (startTarget !== target) {
+					return { position, targetView, target }; // indicate the buffer was re-allocated
+				}
+				return position;
+			});
+			if (newPosition === 0) // bail and go to a msgpack object
+				return writeObject(object);
+			position = newPosition;
+		};
+
+		const makeRoom = (end) => {
+			let newSize;
+			if (end > 0x1000000) {
+				// special handling for really large buffers
+				if ((end - start) > MAX_BUFFER_SIZE)
+					throw new Error('Packed buffer would be larger than maximum buffer size');
+				newSize = Math.min(MAX_BUFFER_SIZE,
+					Math.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);
+			} else // faster handling for smaller buffers
+				newSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;
+			let newBuffer = new ByteArrayAllocate(newSize);
+			targetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));
+			end = Math.min(end, target.length);
+			if (target.copy)
+				target.copy(newBuffer, 0, start, end);
+			else
+				newBuffer.set(target.slice(start, end));
+			position -= start;
+			start = 0;
+			safeEnd = newBuffer.length - 10;
+			return target = newBuffer;
+		};
+		const newRecord = (transition, keys, newTransitions) => {
+			let recordId = structures.nextId;
+			if (!recordId)
+				recordId = 0x40;
+			if (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {
+				recordId = structures.nextOwnId;
+				if (!(recordId < maxStructureId))
+					recordId = sharedLimitId;
+				structures.nextOwnId = recordId + 1;
+			} else {
+				if (recordId >= maxStructureId)// cycle back around
+					recordId = sharedLimitId;
+				structures.nextId = recordId + 1;
+			}
+			let highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;
+			transition[RECORD_SYMBOL] = recordId;
+			transition.__keys__ = keys;
+			structures[recordId - 0x40] = keys;
+
+			if (recordId < sharedLimitId) {
+				keys.isShared = true;
+				structures.sharedLength = recordId - 0x3f;
+				hasSharedUpdate = true;
+				if (highByte >= 0) {
+					target[position++] = (recordId & 0x1f) + 0x60;
+					target[position++] = highByte;
+				} else {
+					target[position++] = recordId;
+				}
+			} else {
+				if (highByte >= 0) {
+					target[position++] = 0xd5; // fixext 2
+					target[position++] = 0x72; // "r" record defintion extension type
+					target[position++] = (recordId & 0x1f) + 0x60;
+					target[position++] = highByte;
+				} else {
+					target[position++] = 0xd4; // fixext 1
+					target[position++] = 0x72; // "r" record defintion extension type
+					target[position++] = recordId;
+				}
+
+				if (newTransitions)
+					transitionsCount += serializationsSinceTransitionRebuild * newTransitions;
+				// record the removal of the id, we can maintain our shared structure
+				if (recordIdsToRemove.length >= maxOwnStructures)
+					recordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones
+				recordIdsToRemove.push(transition);
+				pack(keys);
+			}
+		};
+		const insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {
+			let mainTarget = target;
+			let mainPosition = position;
+			let mainSafeEnd = safeEnd;
+			let mainStart = start;
+			target = keysTarget;
+			position = 0;
+			start = 0;
+			if (!target)
+				keysTarget = target = new ByteArrayAllocate(8192);
+			safeEnd = target.length - 10;
+			newRecord(transition, keys, newTransitions);
+			keysTarget = target;
+			let keysPosition = position;
+			target = mainTarget;
+			position = mainPosition;
+			safeEnd = mainSafeEnd;
+			start = mainStart;
+			if (keysPosition > 1) {
+				let newEnd = position + keysPosition - 1;
+				if (newEnd > safeEnd)
+					makeRoom(newEnd);
+				let insertionPosition = insertionOffset + start;
+				target.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);
+				target.set(keysTarget.slice(0, keysPosition), insertionPosition);
+				position = newEnd;
+			} else {
+				target[insertionOffset + start] = keysTarget[0];
+			}
+		};
+	}
+	useBuffer(buffer) {
+		// this means we are finished using our own buffer and we can write over it safely
+		target = buffer;
+		target.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));
+		targetView = target.dataView;
+		position = 0;
+	}
+	set position (value) {
+		position = value;
+	}
+	get position() {
+		return position;
+	}
+	clearSharedData() {
+		if (this.structures)
+			this.structures = [];
+		if (this.typedStructs)
+			this.typedStructs = [];
+	}
+}
+
+extensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];
+extensions = [{
+	pack(date, allocateForWrite, pack) {
+		let seconds = date.getTime() / 1000;
+		if ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {
+			// Timestamp 32
+			let { target, targetView, position} = allocateForWrite(6);
+			target[position++] = 0xd6;
+			target[position++] = 0xff;
+			targetView.setUint32(position, seconds);
+		} else if (seconds > 0 && seconds < 0x100000000) {
+			// Timestamp 64
+			let { target, targetView, position} = allocateForWrite(10);
+			target[position++] = 0xd7;
+			target[position++] = 0xff;
+			targetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));
+			targetView.setUint32(position + 4, seconds);
+		} else if (isNaN(seconds)) {
+			if (this.onInvalidDate) {
+				allocateForWrite(0);
+				return pack(this.onInvalidDate());
+			}
+			// Intentionally invalid timestamp
+			let { target, targetView, position} = allocateForWrite(3);
+			target[position++] = 0xd4;
+			target[position++] = 0xff;
+			target[position++] = 0xff;
+		} else {
+			// Timestamp 96
+			let { target, targetView, position} = allocateForWrite(15);
+			target[position++] = 0xc7;
+			target[position++] = 12;
+			target[position++] = 0xff;
+			targetView.setUint32(position, date.getMilliseconds() * 1000000);
+			targetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));
+		}
+	}
+}, {
+	pack(set, allocateForWrite, pack) {
+		if (this.setAsEmptyObject) {
+			allocateForWrite(0);
+			return pack({});
+		}
+		let array = Array.from(set);
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x73; // 's' for Set
+			target[position++] = 0;
+		}
+		pack(array);
+	}
+}, {
+	pack(error, allocateForWrite, pack) {
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x65; // 'e' for error
+			target[position++] = 0;
+		}
+		pack([ error.name, error.message, error.cause ]);
+	}
+}, {
+	pack(regex, allocateForWrite, pack) {
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x78; // 'x' for regeXp
+			target[position++] = 0;
+		}
+		pack([ regex.source, regex.flags ]);
+	}
+}, {
+	pack(arrayBuffer, allocateForWrite) {
+		if (this.moreTypes)
+			writeExtBuffer(arrayBuffer, 0x10, allocateForWrite);
+		else
+			writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+	}
+}, {
+	pack(typedArray, allocateForWrite) {
+		let constructor = typedArray.constructor;
+		if (constructor !== ByteArray && this.moreTypes)
+			writeExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);
+		else
+			writeBuffer(typedArray, allocateForWrite);
+	}
+}, {
+	pack(arrayBuffer, allocateForWrite) {
+		if (this.moreTypes)
+			writeExtBuffer(arrayBuffer, 0x11, allocateForWrite);
+		else
+			writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+	}
+}, {
+	pack(c1, allocateForWrite) { // specific 0xC1 object
+		let { target, position} = allocateForWrite(1);
+		target[position] = 0xc1;
+	}
+}];
+
+function writeExtBuffer(typedArray, type, allocateForWrite, encode) {
+	let length = typedArray.byteLength;
+	if (length + 1 < 0x100) {
+		var { target, position } = allocateForWrite(4 + length);
+		target[position++] = 0xc7;
+		target[position++] = length + 1;
+	} else if (length + 1 < 0x10000) {
+		var { target, position } = allocateForWrite(5 + length);
+		target[position++] = 0xc8;
+		target[position++] = (length + 1) >> 8;
+		target[position++] = (length + 1) & 0xff;
+	} else {
+		var { target, position, targetView } = allocateForWrite(7 + length);
+		target[position++] = 0xc9;
+		targetView.setUint32(position, length + 1); // plus one for the type byte
+		position += 4;
+	}
+	target[position++] = 0x74; // "t" for typed array
+	target[position++] = type;
+	if (!typedArray.buffer) typedArray = new Uint8Array(typedArray);
+	target.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);
+}
+function writeBuffer(buffer, allocateForWrite) {
+	let length = buffer.byteLength;
+	var target, position;
+	if (length < 0x100) {
+		var { target, position } = allocateForWrite(length + 2);
+		target[position++] = 0xc4;
+		target[position++] = length;
+	} else if (length < 0x10000) {
+		var { target, position } = allocateForWrite(length + 3);
+		target[position++] = 0xc5;
+		target[position++] = length >> 8;
+		target[position++] = length & 0xff;
+	} else {
+		var { target, position, targetView } = allocateForWrite(length + 5);
+		target[position++] = 0xc6;
+		targetView.setUint32(position, length);
+		position += 4;
+	}
+	target.set(buffer, position);
+}
+
+function writeExtensionData(result, target, position, type) {
+	let length = result.length;
+	switch (length) {
+		case 1:
+			target[position++] = 0xd4;
+			break;
+		case 2:
+			target[position++] = 0xd5;
+			break;
+		case 4:
+			target[position++] = 0xd6;
+			break;
+		case 8:
+			target[position++] = 0xd7;
+			break;
+		case 16:
+			target[position++] = 0xd8;
+			break;
+		default:
+			if (length < 0x100) {
+				target[position++] = 0xc7;
+				target[position++] = length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xc8;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xc9;
+				target[position++] = length >> 24;
+				target[position++] = (length >> 16) & 0xff;
+				target[position++] = (length >> 8) & 0xff;
+				target[position++] = length & 0xff;
+			}
+	}
+	target[position++] = type;
+	target.set(result, position);
+	position += length;
+	return position;
+}
+
+function insertIds(serialized, idsToInsert) {
+	// insert the ids that need to be referenced for structured clones
+	let nextId;
+	let distanceToMove = idsToInsert.length * 6;
+	let lastEnd = serialized.length - distanceToMove;
+	while (nextId = idsToInsert.pop()) {
+		let offset = nextId.offset;
+		let id = nextId.id;
+		serialized.copyWithin(offset + distanceToMove, offset, lastEnd);
+		distanceToMove -= 6;
+		let position = offset + distanceToMove;
+		serialized[position++] = 0xd6;
+		serialized[position++] = 0x69; // 'i'
+		serialized[position++] = id >> 24;
+		serialized[position++] = (id >> 16) & 0xff;
+		serialized[position++] = (id >> 8) & 0xff;
+		serialized[position++] = id & 0xff;
+		lastEnd = offset;
+	}
+	return serialized;
+}
+
+function writeBundles(start, pack, incrementPosition) {
+	if (bundledStrings.length > 0) {
+		targetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);
+		bundledStrings.stringsPosition = position - start;
+		let writeStrings = bundledStrings;
+		bundledStrings = null;
+		pack(writeStrings[0]);
+		pack(writeStrings[1]);
+	}
+}
+
+function addExtension(extension) {
+	if (extension.Class) {
+		if (!extension.pack && !extension.write)
+			throw new Error('Extension has no pack or write function');
+		if (extension.pack && !extension.type)
+			throw new Error('Extension has no type (numeric code to identify the extension)');
+		extensionClasses.unshift(extension.Class);
+		extensions.unshift(extension);
+	}
+	addExtension$1(extension);
+}
+function prepareStructures(structures, packr) {
+	structures.isCompatible = (existingStructures) => {
+		let compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);
+		if (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction
+			packr._mergeStructures(existingStructures);
+		return compatible;
+	};
+	return structures;
+}
+
+// Marker for downstream libraries (e.g. structon) to detect that this Packr
+// supports per-instance struct-encoding hooks (this._writeStruct,
+// this._prepareStructures).  See `pack` for the dispatch.
+Packr.SUPPORTS_STRUCT_HOOKS = true;
+
+let defaultPackr = new Packr({ useRecords: false });
+const pack = defaultPackr.pack;
+const encode = defaultPackr.pack;
+const Encoder = Packr;
+const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;
+const REUSE_BUFFER_MODE = 512;
+const RESET_BUFFER_MODE = 1024;
+const RESERVE_START_SPACE = 2048;
+
+class PackrStream extends stream.Transform {
+	constructor(options) {
+		if (!options)
+			options = {};
+		options.writableObjectMode = true;
+		super(options);
+		options.sequential = true;
+		this.packr = options.packr || new Packr(options);
+	}
+	_transform(value, encoding, callback) {
+		this.push(this.packr.pack(value));
+		callback();
+	}
+}
+
+class UnpackrStream extends stream.Transform {
+	constructor(options) {
+		if (!options)
+			options = {};
+		options.objectMode = true;
+		super(options);
+		options.structures = [];
+		this.maxIncompleteBufferSize = options.maxIncompleteBufferSize !== undefined ? options.maxIncompleteBufferSize : 0x4000000;
+		this.unpackr = options.unpackr || new Unpackr(options);
+	}
+	_transform(chunk, encoding, callback) {
+		if (this.incompleteBuffer) {
+			chunk = Buffer.concat([this.incompleteBuffer, chunk]);
+			this.incompleteBuffer = null;
+		}
+		let values;
+		try {
+			values = this.unpackr.unpackMultiple(chunk);
+		} catch(error) {
+			if (error.incomplete) {
+				let incompleteBuffer = chunk.slice(error.lastPosition);
+				if (incompleteBuffer.length > this.maxIncompleteBufferSize) {
+					this.incompleteBuffer = null;
+					return callback(new Error('Maximum incomplete buffer size exceeded'));
+				}
+				this.incompleteBuffer = incompleteBuffer;
+				values = error.values;
+			} else {
+				return callback(error);
+			}
+		}
+		for (let value of values || []) {
+			if (value === null)
+				value = this.getNullValue();
+			this.push(value);
+		}
+		callback();
+	}
+	getNullValue() {
+		return Symbol.for(null);
+	}
+}
+
+/**
+ * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
+ * If the argument is only Async Iterable, the return value will be an Async Iterable.
+ * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object
+ * @param {options} [options] - msgpackr pack options
+ * @returns {IterableIterator|Promise.<AsyncIterableIterator>}
+ */
+function packIter (objectIterator, options = {}) {
+  if (!objectIterator || typeof objectIterator !== 'object') {
+    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');
+  } else if (typeof objectIterator[Symbol.iterator] === 'function') {
+    return packIterSync(objectIterator, options);
+  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {
+    return packIterAsync(objectIterator, options);
+  } else {
+    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');
+  }
+}
+
+function * packIterSync (objectIterator, options) {
+  const packr = new Packr(options);
+  for (const value of objectIterator) {
+    yield packr.pack(value);
+  }
+}
+
+async function * packIterAsync (objectIterator, options) {
+  const packr = new Packr(options);
+  for await (const value of objectIterator) {
+    yield packr.pack(value);
+  }
+}
+
+/**
+ * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
+ * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
+ * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
+ * @param {object} [options] - unpackr options
+ * @returns {IterableIterator|Promise.<AsyncIterableIterator}
+ */
+function unpackIter (bufferIterator, options = {}) {
+  if (!bufferIterator || typeof bufferIterator !== 'object') {
+    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');
+  }
+
+  const unpackr = new Unpackr(options);
+  let incomplete;
+  const parser = (chunk) => {
+    let yields;
+    // if there's incomplete data from previous chunk, concatinate and try again
+    if (incomplete) {
+      chunk = Buffer.concat([incomplete, chunk]);
+      incomplete = undefined;
+    }
+
+    try {
+      yields = unpackr.unpackMultiple(chunk);
+    } catch (err) {
+      if (err.incomplete) {
+        incomplete = chunk.slice(err.lastPosition);
+        yields = err.values;
+      } else {
+        throw err;
+      }
+    }
+    return yields;
+  };
+
+  if (typeof bufferIterator[Symbol.iterator] === 'function') {
+    return (function * iter () {
+      for (const value of bufferIterator) {
+        yield * parser(value);
+      }
+    })();
+  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {
+    return (async function * iter () {
+      for await (const value of bufferIterator) {
+        yield * parser(value);
+      }
+    })();
+  }
+}
+const decodeIter = unpackIter;
+const encodeIter = packIter;
+
+const useRecords = false;
+const mapsAsObjects = true;
+
+const nativeAccelerationDisabled = process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED !== undefined && process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED.toLowerCase() === 'true';
+
+if (!nativeAccelerationDisabled) {
+	let extractor;
+	try {
+		if (typeof require == 'function')
+			extractor = require('msgpackr-extract');
+		else
+			extractor = module$1.createRequire((typeof document === 'undefined' ? new (require('u' + 'rl').URL)('file:' + __filename).href : (document.currentScript && document.currentScript.src || new URL('node.cjs', document.baseURI).href)))('msgpackr-extract');
+		if (extractor)
+			setExtractor(extractor.extractStrings);
+	} catch (error) {
+		// native module is optional
+	}
+}
+
+exports.ALWAYS = ALWAYS;
+exports.C1 = C1;
+exports.DECIMAL_FIT = DECIMAL_FIT;
+exports.DECIMAL_ROUND = DECIMAL_ROUND;
+exports.Decoder = Decoder;
+exports.DecoderStream = UnpackrStream;
+exports.Encoder = Encoder;
+exports.EncoderStream = PackrStream;
+exports.FLOAT32_OPTIONS = FLOAT32_OPTIONS;
+exports.NEVER = NEVER;
+exports.Packr = Packr;
+exports.PackrStream = PackrStream;
+exports.RESERVE_START_SPACE = RESERVE_START_SPACE;
+exports.RESET_BUFFER_MODE = RESET_BUFFER_MODE;
+exports.REUSE_BUFFER_MODE = REUSE_BUFFER_MODE;
+exports.Unpackr = Unpackr;
+exports.UnpackrStream = UnpackrStream;
+exports.addExtension = addExtension;
+exports.clearSource = clearSource;
+exports.decode = decode;
+exports.decodeIter = decodeIter;
+exports.encode = encode;
+exports.encodeIter = encodeIter;
+exports.mapsAsObjects = mapsAsObjects;
+exports.pack = pack;
+exports.roundFloat32 = roundFloat32;
+exports.unpack = unpack;
+exports.unpackMultiple = unpackMultiple;
+exports.useRecords = useRecords;
+//# sourceMappingURL=node.cjs.map
diff --git a/node_modules/msgpackr/dist/node.cjs.map b/node_modules/msgpackr/dist/node.cjs.map
new file mode 100644
index 0000000..ae2a570
--- /dev/null
+++ b/node_modules/msgpackr/dist/node.cjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"node.cjs","sources":["../unpack.js","../pack.js","../stream.js","../iterators.js","../node-index.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","import { Transform } from 'stream';\nimport { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\nvar DEFAULT_OPTIONS = {objectMode: true};\n\nexport class PackrStream extends Transform {\n\tconstructor(options) {\n\t\tif (!options)\n\t\t\toptions = {};\n\t\toptions.writableObjectMode = true;\n\t\tsuper(options);\n\t\toptions.sequential = true;\n\t\tthis.packr = options.packr || new Packr(options);\n\t}\n\t_transform(value, encoding, callback) {\n\t\tthis.push(this.packr.pack(value));\n\t\tcallback();\n\t}\n}\n\nexport class UnpackrStream extends Transform {\n\tconstructor(options) {\n\t\tif (!options)\n\t\t\toptions = {};\n\t\toptions.objectMode = true;\n\t\tsuper(options);\n\t\toptions.structures = [];\n\t\tthis.maxIncompleteBufferSize = options.maxIncompleteBufferSize !== undefined ? options.maxIncompleteBufferSize : 0x4000000;\n\t\tthis.unpackr = options.unpackr || new Unpackr(options);\n\t}\n\t_transform(chunk, encoding, callback) {\n\t\tif (this.incompleteBuffer) {\n\t\t\tchunk = Buffer.concat([this.incompleteBuffer, chunk]);\n\t\t\tthis.incompleteBuffer = null;\n\t\t}\n\t\tlet values;\n\t\ttry {\n\t\t\tvalues = this.unpackr.unpackMultiple(chunk);\n\t\t} catch(error) {\n\t\t\tif (error.incomplete) {\n\t\t\t\tlet incompleteBuffer = chunk.slice(error.lastPosition);\n\t\t\t\tif (incompleteBuffer.length > this.maxIncompleteBufferSize) {\n\t\t\t\t\tthis.incompleteBuffer = null;\n\t\t\t\t\treturn callback(new Error('Maximum incomplete buffer size exceeded'));\n\t\t\t\t}\n\t\t\t\tthis.incompleteBuffer = incompleteBuffer;\n\t\t\t\tvalues = error.values;\n\t\t\t} else {\n\t\t\t\treturn callback(error);\n\t\t\t}\n\t\t}\n\t\tfor (let value of values || []) {\n\t\t\tif (value === null)\n\t\t\t\tvalue = this.getNullValue();\n\t\t\tthis.push(value);\n\t\t}\n\t\tcallback();\n\t}\n\tgetNullValue() {\n\t\treturn Symbol.for(null);\n\t}\n}\n","import { Packr } from './pack.js';\nimport { Unpackr } from './unpack.js';\n\n/**\n * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer\n * If the argument is only Async Iterable, the return value will be an Async Iterable.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object\n * @param {options} [options] - msgpackr pack options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator>}\n */\nexport function packIter (objectIterator, options = {}) {\n  if (!objectIterator || typeof objectIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');\n  } else if (typeof objectIterator[Symbol.iterator] === 'function') {\n    return packIterSync(objectIterator, options);\n  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {\n    return packIterAsync(objectIterator, options);\n  } else {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');\n  }\n}\n\nfunction * packIterSync (objectIterator, options) {\n  const packr = new Packr(options);\n  for (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\nasync function * packIterAsync (objectIterator, options) {\n  const packr = new Packr(options);\n  for await (const value of objectIterator) {\n    yield packr.pack(value);\n  }\n}\n\n/**\n * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects\n * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.\n * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator\n * @param {object} [options] - unpackr options\n * @returns {IterableIterator|Promise.<AsyncIterableIterator}\n */\nexport function unpackIter (bufferIterator, options = {}) {\n  if (!bufferIterator || typeof bufferIterator !== 'object') {\n    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');\n  }\n\n  const unpackr = new Unpackr(options);\n  let incomplete;\n  const parser = (chunk) => {\n    let yields;\n    // if there's incomplete data from previous chunk, concatinate and try again\n    if (incomplete) {\n      chunk = Buffer.concat([incomplete, chunk]);\n      incomplete = undefined;\n    }\n\n    try {\n      yields = unpackr.unpackMultiple(chunk);\n    } catch (err) {\n      if (err.incomplete) {\n        incomplete = chunk.slice(err.lastPosition);\n        yields = err.values;\n      } else {\n        throw err;\n      }\n    }\n    return yields;\n  };\n\n  if (typeof bufferIterator[Symbol.iterator] === 'function') {\n    return (function * iter () {\n      for (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {\n    return (async function * iter () {\n      for await (const value of bufferIterator) {\n        yield * parser(value);\n      }\n    })();\n  }\n}\nexport const decodeIter = unpackIter;\nexport const encodeIter = packIter;","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { PackrStream, UnpackrStream, PackrStream as EncoderStream, UnpackrStream as DecoderStream } from './stream.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\nimport { setExtractor } from './unpack.js';\nimport { createRequire } from 'module';\n\nconst nativeAccelerationDisabled = process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED !== undefined && process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED.toLowerCase() === 'true';\n\nif (!nativeAccelerationDisabled) {\n\tlet extractor;\n\ttry {\n\t\tif (typeof require == 'function')\n\t\t\textractor = require('msgpackr-extract');\n\t\telse\n\t\t\textractor = createRequire(import.meta.url)('msgpackr-extract');\n\t\tif (extractor)\n\t\t\tsetExtractor(extractor.extractStrings);\n\t} catch (error) {\n\t\t// native module is optional\n\t}\n}"],"names":["position","bundledStrings","isNativeAccelerationEnabled","addExtension","unpackAddExtension","Transform","createRequire"],"mappings":";;;;;AAAA,IAAI,OAAO,CAAC;AACZ,IAAI;AACJ,CAAC,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;AAC7B,CAAC,CAAC,MAAM,KAAK,EAAE,EAAE;AACjB,IAAI,GAAG,CAAC;AACR,IAAI,MAAM,CAAC;AACX,IAAIA,UAAQ,GAAG,CAAC,CAAC;AAEjB,MAAM,WAAW,GAAG,EAAE,CAAC;AACvB,IAAI,OAAO,GAAG,WAAW,CAAC;AAC1B,IAAI,cAAc,GAAG,CAAC,CAAC;AACvB,IAAI,cAAc,GAAG,EAAE,CAAC;AACxB,IAAI,iBAAiB,CAAC;AACtB,IAAI,SAAS,CAAC;AACd,IAAI,cAAc,GAAG,CAAC,CAAC;AACvB,IAAI,YAAY,GAAG,CAAC,CAAC;AACrB,IAAIC,gBAAc,CAAC;AACnB,IAAI,YAAY,CAAC;AACjB,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC3B,IAAI,QAAQ,CAAC;AACb,IAAI,cAAc,GAAG;AACrB,CAAC,UAAU,EAAE,KAAK;AAClB,CAAC,aAAa,EAAE,IAAI;AACpB,CAAC,CAAC;AACK,MAAM,MAAM,CAAC,EAAE;AACV,MAAC,EAAE,GAAG,IAAI,MAAM,GAAG;AAC/B,EAAE,CAAC,IAAI,GAAG,kBAAkB,CAAC;AAC7B,IAAI,cAAc,GAAG,KAAK,CAAC;AAC3B,IAAI,yBAAyB,GAAG,CAAC,CAAC;AAElC;AACO,MAAM,OAAO,CAAC;AACrB,CAAC,WAAW,CAAC,OAAO,EAAE;AACtB,EAAE,IAAI,OAAO,EAAE;AACf,GAAG,IAAI,OAAO,CAAC,UAAU,KAAK,KAAK,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;AAC1E,IAAI,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;AACjC,GAAG,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE;AACxD,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;AAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK,EAAE;AAC5D,KAAK,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;AAC7B,KAAK,IAAI,CAAC,OAAO,CAAC,mBAAmB;AACrC,MAAM,OAAO,CAAC,mBAAmB,GAAG,CAAC,CAAC;AACtC,KAAK;AACL,IAAI;AACJ,GAAG,IAAI,OAAO,CAAC,UAAU;AACzB,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;AAChE,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE;AACnC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,CAAC;AACnD,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,CAAC;AACxC,IAAI;AACJ,GAAG,IAAI,OAAO,CAAC,aAAa,EAAE;AAC9B,IAAI,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC;AACnC,IAAI;AACJ,GAAG;AACH,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;AAC/B,EAAE;AACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;AACzB,EAAE,IAAI,GAAG,EAAE;AACX;AACA,GAAG,OAAO,SAAS,CAAC,MAAM;AAC1B,IAAI,WAAW,EAAE,CAAC;AAClB,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAChH,IAAI,CAAC,CAAC;AACN,GAAG;AACH,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;AAC1D,GAAG,MAAM,GAAG,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;AACzF,EAAE,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACnC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC;AACzC,GAAGD,UAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;AACjC,GAAG,MAAM;AACT,GAAGA,UAAQ,GAAG,CAAC,CAAC;AAChB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;AACnD,GAAG;AACH,EAAE,cAAc,GAAG,CAAC,CAAC;AACrB,EAAE,YAAY,GAAG,CAAC,CAAC;AACnB,EAAE,SAAS,GAAG,IAAI,CAAC;AACnB,EAAE,OAAO,GAAG,WAAW,CAAC;AACxB,EAAEC,gBAAc,GAAG,IAAI,CAAC;AACxB,EAAE,GAAG,GAAG,MAAM,CAAC;AACf;AACA;AACA;AACA,EAAE,IAAI;AACN,GAAG,QAAQ,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;AACvH,GAAG,CAAC,MAAM,KAAK,EAAE;AACjB;AACA,GAAG,GAAG,GAAG,IAAI,CAAC;AACd,GAAG,IAAI,MAAM,YAAY,UAAU;AACnC,IAAI,MAAM,KAAK,CAAC;AAChB,GAAG,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC;AAC3J,GAAG;AACH,EAAE,IAAI,IAAI,YAAY,OAAO,EAAE;AAC/B,GAAG,cAAc,GAAG,IAAI,CAAC;AACzB,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;AACxB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC;AACxC,IAAI,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;AAChC,IAAI,MAAM,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;AAClE,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC3B,IAAI;AACJ,GAAG,MAAM;AACT,GAAG,cAAc,GAAG,cAAc,CAAC;AACnC,GAAG,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;AACzD,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC3B,GAAG;AACH,EAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;AAC9B,EAAE;AACF,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;AACjC,EAAE,IAAI,MAAM,EAAE,YAAY,GAAG,CAAC,CAAC;AAC/B,EAAE,IAAI;AACN,GAAG,cAAc,GAAG,IAAI,CAAC;AACzB,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;AAC5B,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;AACtF,GAAG,IAAI,OAAO,EAAE;AAChB,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,YAAY,EAAED,UAAQ,CAAC,KAAK,KAAK,EAAE,OAAO;AACjE,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;AAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;AAC7B,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,YAAY,EAAEA,UAAQ,CAAC,KAAK,KAAK,EAAE;AACnE,MAAM,OAAO;AACb,MAAM;AACN,KAAK;AACL,IAAI;AACJ,QAAQ;AACR,IAAI,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC;AACvB,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;AAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;AAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;AAChC,KAAK;AACL,IAAI,OAAO,MAAM,CAAC;AAClB,IAAI;AACJ,GAAG,CAAC,MAAM,KAAK,EAAE;AACjB,GAAG,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC;AACrC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;AACzB,GAAG,MAAM,KAAK,CAAC;AACf,GAAG,SAAS;AACZ,GAAG,cAAc,GAAG,KAAK,CAAC;AAC1B,GAAG,WAAW,EAAE,CAAC;AACjB,GAAG;AACH,EAAE;AACF,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE;AACxD,EAAE,IAAI,IAAI,CAAC,mBAAmB;AAC9B,GAAG,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;AACjE,EAAE,gBAAgB,GAAG,gBAAgB,IAAI,EAAE,CAAC;AAC5C,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;AACvC,GAAG,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5E,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC3D,GAAG,IAAI,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AACvC,GAAG,IAAI,SAAS,EAAE;AAClB,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC9B,IAAI,IAAI,CAAC,IAAI,EAAE;AACf,KAAK,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;AACxC,IAAI;AACJ,GAAG;AACH,EAAE,gBAAgB,CAAC,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC;AAC1D,EAAE,KAAK,IAAI,EAAE,IAAI,kBAAkB,IAAI,EAAE,EAAE;AAC3C,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE;AAChB,IAAI,IAAI,SAAS,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;AACzC,IAAI,IAAI,QAAQ,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;AAC1C,IAAI,IAAI,QAAQ,EAAE;AAClB,KAAK,IAAI,SAAS;AAClB,MAAM,CAAC,gBAAgB,CAAC,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC;AACxG,KAAK,gBAAgB,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;AACrC,KAAK;AACL,IAAI;AACJ,GAAG;AACH,EAAE,OAAO,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;AAC5C,EAAE;AACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;AACzB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AACtC,EAAE;AACF,CAAC;AAIM,SAAS,WAAW,CAAC,OAAO,EAAE;AACrC,CAAC,IAAI;AACL,EAAE,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE;AAClD,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,YAAY,IAAI,CAAC,CAAC;AAC1D,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,MAAM;AAC9C,IAAI,iBAAiB,CAAC,MAAM,GAAG,YAAY,CAAC;AAC5C,GAAG;AACH,EAAE,IAAI,MAAM,CAAC;AACb,EAAE,IAAI,cAAc,CAAC,WAAW,IAAI,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,CAACA,UAAQ,CAAC,IAAI,IAAI,EAAE;AACnF,GAAG,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAEA,UAAQ,EAAE,MAAM,CAAC,CAAC;AAC9D,GAAG,GAAG,GAAG,IAAI,CAAC;AACd,GAAG,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM;AAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;AAC7B,GAAGA,UAAQ,GAAG,MAAM,CAAC;AACrB,GAAG;AACH,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;AACnB,EAAE,IAAIC,gBAAc,EAAE;AACtB,GAAGD,UAAQ,GAAGC,gBAAc,CAAC,kBAAkB,CAAC;AAChD,GAAGA,gBAAc,GAAG,IAAI,CAAC;AACzB,GAAG;AACH,EAAE,IAAI,cAAc;AACpB;AACA;AACA,GAAG,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC9C;AACA,EAAE,IAAID,UAAQ,IAAI,MAAM,EAAE;AAC1B;AACA,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;AAC/D,IAAI,iBAAiB,EAAE,CAAC;AACxB,GAAG,iBAAiB,GAAG,IAAI,CAAC;AAC5B,GAAG,GAAG,GAAG,IAAI,CAAC;AACd,GAAG,IAAI,YAAY;AACnB,IAAI,YAAY,GAAG,IAAI,CAAC;AACxB,GAAG,MAAM,IAAIA,UAAQ,GAAG,MAAM,EAAE;AAChC;AACA,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;AACzD,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE;AAC9B,GAAG,IAAI,QAAQ,CAAC;AAChB,GAAG,IAAI;AACP,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACnH,IAAI,CAAC,MAAM,KAAK,EAAE;AAClB,IAAI,QAAQ,GAAG,2BAA2B,GAAG,KAAK,GAAG,GAAG,CAAC;AACzD,IAAI;AACJ,GAAG,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,QAAQ,CAAC,CAAC;AAC3E,GAAG;AACH;AACA,EAAE,OAAO,MAAM,CAAC;AAChB,EAAE,CAAC,MAAM,KAAK,EAAE;AAChB,EAAE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;AAC9D,GAAG,iBAAiB,EAAE,CAAC;AACvB,EAAE,WAAW,EAAE,CAAC;AAChB,EAAE,IAAI,KAAK,YAAY,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,IAAIA,UAAQ,GAAG,MAAM,EAAE;AAChH,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;AAC3B,GAAG;AACH,EAAE,MAAM,KAAK,CAAC;AACd,EAAE;AACF,CAAC;AACD;AACA,SAAS,iBAAiB,GAAG;AAC7B,CAAC,KAAK,IAAI,EAAE,IAAI,iBAAiB,CAAC,iBAAiB,EAAE;AACrD,EAAE,iBAAiB,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;AAClE,EAAE;AACF,CAAC,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC5C,CAAC;AACD;AACO,SAAS,IAAI,GAAG;AACvB,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;AACnB,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE;AACpB,GAAG,IAAI,KAAK,GAAG,IAAI;AACnB,IAAI,OAAO,KAAK,CAAC;AACjB,QAAQ;AACR,IAAI,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC;AACnD,KAAK,cAAc,CAAC,aAAa,IAAI,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AACpE,IAAI,IAAI,SAAS,EAAE;AACnB,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;AAC1B,MAAM,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;AACtE,MAAM;AACN,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;AAC7B,KAAK;AACL,KAAK,OAAO,KAAK,CAAC;AAClB,IAAI;AACJ,GAAG,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;AAC3B;AACA,GAAG,KAAK,IAAI,IAAI,CAAC;AACjB,GAAG,IAAI,cAAc,CAAC,aAAa,EAAE;AACrC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC;AACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AACpC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;AACzB,KAAK,IAAI,GAAG,KAAK,WAAW;AAC5B,MAAM,GAAG,GAAG,UAAU,CAAC;AACvB,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;AAC1B,KAAK;AACL,IAAI,OAAO,MAAM,CAAC;AAClB,IAAI,MAAM;AACV,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AACxB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AACpC,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AAC7B,KAAK;AACL,IAAI,OAAO,GAAG,CAAC;AACf,IAAI;AACJ,GAAG,MAAM;AACT,GAAG,KAAK,IAAI,IAAI,CAAC;AACjB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;AAChC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AACnC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;AACtB,IAAI;AACJ,GAAG,IAAI,cAAc,CAAC,UAAU;AAChC,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAChC,GAAG,OAAO,KAAK,CAAC;AAChB,GAAG;AACH,EAAE,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;AAC1B;AACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;AAC5B,EAAE,IAAI,YAAY,IAAIA,UAAQ,EAAE;AAChC,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;AAC5F,GAAG;AACH,EAAE,IAAI,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;AACzC;AACA,GAAG,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;AAC/E,GAAG,IAAI,MAAM,IAAI,IAAI;AACrB,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG;AACH,EAAE,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;AACjC,EAAE,MAAM;AACR,EAAE,IAAI,KAAK,CAAC;AACZ,EAAE,QAAQ,KAAK;AACf,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ,IAAI,IAAIC,gBAAc,EAAE;AACxB,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;AACpB,KAAK,IAAI,KAAK,GAAG,CAAC;AAClB,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;AAClG;AACA,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;AAClG,KAAK;AACL,IAAI,OAAO,EAAE,CAAC;AACd,GAAG,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC;AAC3B,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,GAAG,CAACD,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,KAAK,KAAK,SAAS;AAC3B,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AACjD,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,OAAO,OAAO,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;AACpC,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;AAC1C,IAAI,IAAI,cAAc,CAAC,UAAU,GAAG,CAAC,EAAE;AACvC;AACA,KAAK,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACvF,KAAKA,UAAQ,IAAI,CAAC,CAAC;AACnB,KAAK,OAAO,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;AAChF,KAAK;AACL,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;AAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB;AACA,GAAG,KAAK,IAAI;AACZ,IAAI,OAAO,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,KAAK,IAAI;AACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;AACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;AACxD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;AAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;AACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;AACxD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;AACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;AAC7C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC3D,KAAK;AACL,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;AAC7C,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB;AACA;AACA,GAAG,KAAK,IAAI;AACZ,IAAI,OAAO,QAAQ,CAAC,OAAO,CAACA,UAAQ,EAAE,CAAC,CAAC;AACxC,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;AACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,KAAK,IAAI;AACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;AACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB,GAAG,KAAK,IAAI;AACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;AACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;AACvD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;AAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;AACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;AACvD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;AACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;AAC5C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC1F,KAAK;AACL,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;AAC5C,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,KAAK,CAAC;AACjB;AACA,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;AACvB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;AACrD,KAAK,MAAM;AACX,KAAK,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;AAC9C,KAAK,IAAI,SAAS,EAAE;AACpB,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE;AAC1B,OAAOA,UAAQ,EAAE,CAAC;AAClB,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;AACrC,OAAO,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;AACrC,OAAOA,UAAQ,EAAE,CAAC;AAClB,OAAO,OAAO,SAAS,EAAE,CAAC;AAC1B,OAAO;AACP,OAAO,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,EAAEA,UAAQ,CAAC,CAAC,CAAC;AAC5D,MAAM;AACN,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC;AACpD,KAAK;AACL,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;AAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;AACvB,KAAKA,UAAQ,EAAE,CAAC;AAChB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;AACtE,KAAK;AACL,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACvB,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACtB,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;AACtB,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC;AACvB,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;AAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;AAC7F,KAAK;AACL,IAAI,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;AAC9B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;AAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;AAC7F,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC/B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;AAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;AAC7F,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC/B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;AAC1B,GAAG;AACH,IAAI,IAAI,KAAK,IAAI,IAAI;AACrB,KAAK,OAAO,KAAK,GAAG,KAAK,CAAC;AAC1B,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;AAC7B,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;AACjE,KAAK,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;AAC7B,KAAK,MAAM,KAAK,CAAC;AACjB,KAAK;AACL,IAAI,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,CAAC;AAC1D;AACA,GAAG;AACH,EAAE;AACF,CAAC;AACD,MAAM,SAAS,GAAG,2BAA2B,CAAC;AAC9C,SAAS,qBAAqB,CAAC,SAAS,EAAE,OAAO,EAAE;AACnD,CAAC,SAAS,UAAU,GAAG;AACvB;AACA,EAAE,IAAI,UAAU,CAAC,KAAK,EAAE,GAAG,yBAAyB,EAAE;AACtD,GAAG,IAAI,mBAAmB,CAAC;AAC3B,GAAG,IAAI;AACP,IAAI,mBAAmB,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,GAAG,EAAE,2BAA2B,IAAI,cAAc,CAAC,UAAU,GAAG,eAAe,GAAG,EAAE,CAAC;AAC9I,KAAK,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,WAAW,GAAG,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;AAC9K,IAAI,CAAC,MAAM,KAAK,EAAE;AAClB;AACA,IAAI,yBAAyB,GAAG,QAAQ,CAAC;AACzC,IAAI,OAAO,UAAU,EAAE,CAAC;AACxB,IAAI;AACJ,GAAG,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC;AAC/B,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;AACrE,GAAG,OAAO,mBAAmB,EAAE,CAAC;AAChC,GAAG;AACH,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;AAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACpD,GAAG,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AAC1B,GAAG,IAAI,GAAG,KAAK,WAAW;AAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;AACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;AACxB,GAAG;AACH,EAAE,IAAI,cAAc,CAAC,UAAU;AAC/B,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAChC,EAAE,OAAO,MAAM,CAAC;AAChB,EAAE;AACF,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;AACtB,CAAC,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC,EAAE;AAC/B,EAAE,OAAO,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACrD,EAAE;AACF,CAAC,OAAO,UAAU,CAAC;AACnB,CAAC;AACD;AACA,MAAM,sBAAsB,GAAG,CAAC,OAAO,EAAE,KAAK,KAAK;AACnD,CAAC,OAAO,WAAW;AACnB,EAAE,IAAI,QAAQ,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AACjC,EAAE,IAAI,QAAQ,KAAK,CAAC;AACpB,GAAG,OAAO,KAAK,EAAE,CAAC;AAClB,EAAE,IAAI,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC;AACnF,EAAE,IAAI,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;AAChE,EAAE,IAAI,CAAC,SAAS,EAAE;AAClB,GAAG,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;AACzD,GAAG;AACH,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;AACrB,GAAG,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC9D,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;AAC1B,EAAE,CAAC;AACH,CAAC,CAAC;AACF;AACO,SAAS,cAAc,GAAG;AACjC,CAAC,IAAI,gBAAgB,GAAG,SAAS,CAAC,MAAM;AACxC;AACA,EAAE,GAAG,GAAG,IAAI,CAAC;AACb,EAAE,OAAO,cAAc,CAAC,aAAa,EAAE,CAAC;AACxC,EAAE,CAAC,CAAC;AACJ,CAAC,OAAO,iBAAiB,GAAG,cAAc,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;AACjG,CAAC;AACD;AACA,IAAI,eAAe,GAAG,YAAY,CAAC;AACnC,IAAI,WAAW,GAAG,YAAY,CAAC;AAC/B,IAAI,YAAY,GAAG,YAAY,CAAC;AAChC,IAAI,YAAY,GAAG,YAAY,CAAC;AACrBE,mCAA2B,GAAG,MAAM;AAC/C;AACO,SAAS,YAAY,CAAC,cAAc,EAAE;AAC7C,CAACA,mCAA2B,GAAG,IAAI,CAAC;AACpC,CAAC,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AACjC,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAC7B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC,SAAS,UAAU,CAAC,YAAY,EAAE;AACnC,EAAE,OAAO,SAAS,UAAU,CAAC,MAAM,EAAE;AACrC,GAAG,IAAI,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;AAC1C,GAAG,IAAI,MAAM,IAAI,IAAI,EAAE;AACvB,IAAI,IAAID,gBAAc;AACtB,KAAK,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;AACjC,IAAI,IAAI,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;AACpC,IAAI,IAAI,UAAU,GAAG,cAAc,CAACD,UAAQ,GAAG,YAAY,GAAG,UAAU,EAAE,MAAM,GAAG,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;AAC3G,IAAI,IAAI,OAAO,UAAU,IAAI,QAAQ,EAAE;AACvC,KAAK,MAAM,GAAG,UAAU,CAAC;AACzB,KAAK,OAAO,GAAG,WAAW,CAAC;AAC3B,KAAK,MAAM;AACX,KAAK,OAAO,GAAG,UAAU,CAAC;AAC1B,KAAK,cAAc,GAAG,CAAC,CAAC;AACxB,KAAK,YAAY,GAAG,CAAC,CAAC;AACtB,KAAK,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AACzB,KAAK,IAAI,MAAM,KAAK,SAAS;AAC7B,MAAM,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;AAClD,KAAK;AACL,IAAI;AACJ,GAAG,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;AACvC,GAAG,IAAI,eAAe,IAAI,MAAM,EAAE;AAClC,IAAIA,UAAQ,IAAI,MAAM,CAAC;AACvB,IAAI,OAAO,MAAM,CAAC;AAClB,IAAI;AACJ,GAAG,SAAS,GAAG,MAAM,CAAC;AACtB,GAAG,cAAc,GAAGA,UAAQ,CAAC;AAC7B,GAAG,YAAY,GAAGA,UAAQ,GAAG,eAAe,CAAC;AAC7C,GAAGA,UAAQ,IAAI,MAAM,CAAC;AACtB,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAClC,GAAG,CAAC;AACJ,EAAE;AACF,CAAC;AACD,SAAS,YAAY,CAAC,MAAM,EAAE;AAC9B,CAAC,IAAI,MAAM,CAAC;AACZ,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE;AAClB,EAAE,IAAI,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;AACtC,GAAG,OAAO,MAAM,CAAC;AACjB,EAAE;AACF,CAAC,IAAI,MAAM,GAAG,EAAE,IAAI,OAAO;AAC3B,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC,CAAC;AACpE,CAAC,MAAM,GAAG,GAAGA,UAAQ,GAAG,MAAM,CAAC;AAC/B,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;AAClB,CAAC,MAAM,GAAG,EAAE,CAAC;AACb,CAAC,OAAOA,UAAQ,GAAG,GAAG,EAAE;AACxB,EAAE,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAChC,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE;AAC5B;AACA,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACrB,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;AACtC;AACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;AACnD;AACA,GAAG,IAAI,SAAS,GAAG,IAAI,EAAE;AACzB,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACvB,IAAI,MAAM;AACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC1B,IAAI;AACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;AACtC;AACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;AACnE;AACA;AACA,GAAG,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;AAC1E,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACvB,IAAI,MAAM;AACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AAC1B,IAAI;AACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;AACtC;AACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACxC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;AACnF;AACA;AACA,GAAG,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,QAAQ,EAAE;AAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACvB,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,EAAE;AAC7B,IAAI,IAAI,IAAI,OAAO,CAAC;AACpB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC;AACjD,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;AACnC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrB,IAAI,MAAM;AACV,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrB,IAAI;AACJ,GAAG,MAAM;AACT,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,GAAG;AACH;AACA,EAAE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE;AAC9B,GAAG,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC/C,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;AACpB,GAAG;AACH,EAAE;AACF;AACA,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACvB,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC9C,EAAE;AACF;AACA,CAAC,OAAO,MAAM,CAAC;AACf,CAAC;AAWD;AACA,SAAS,SAAS,CAAC,MAAM,EAAE;AAC3B,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AAClC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;AACpB,EAAE;AACF,CAAC,IAAI,cAAc,CAAC,UAAU;AAC9B,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC,OAAO,KAAK,CAAC;AACd,CAAC;AACD;AACA,SAAS,OAAO,CAAC,MAAM,EAAE;AACzB,CAAC,IAAI,cAAc,CAAC,aAAa,EAAE;AACnC,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;AAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACnC,GAAG,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;AACvB,GAAG,IAAI,GAAG,KAAK,WAAW;AAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;AACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;AACxB,GAAG;AACH,EAAE,OAAO,MAAM,CAAC;AAChB,EAAE,MAAM;AACR,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACnC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;AAC3B,GAAG;AACH,EAAE,OAAO,GAAG,CAAC;AACb,EAAE;AACF,CAAC;AACD;AACA,IAAI,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;AACvC,SAAS,cAAc,CAAC,MAAM,EAAE;AAChC,CAAC,IAAI,KAAK,GAAGA,UAAQ,CAAC;AACtB,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AAClC,EAAE,MAAM,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC/B,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE;AACzB,IAAIA,UAAQ,GAAG,KAAK,CAAC;AACrB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AACnB,GAAG;AACH,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC3C,CAAC;AACD,SAAS,eAAe,CAAC,MAAM,EAAE;AACjC,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;AACjB,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;AAClB,GAAG,IAAI,MAAM,KAAK,CAAC;AACnB,IAAI,OAAO,EAAE,CAAC;AACd,QAAQ;AACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;AACnB,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;AAC3B,IAAI;AACJ,GAAG,MAAM;AACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,IAAI,MAAM,GAAG,CAAC;AACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAChC,GAAG;AACH,EAAE,MAAM;AACR,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC1B,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC5E,GAAGA,UAAQ,IAAI,CAAC,CAAC;AACjB,GAAG,OAAO;AACV,GAAG;AACH,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;AAClB,GAAG,IAAI,MAAM,KAAK,CAAC;AACnB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACpC,QAAQ;AACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;AACnB,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACvC,IAAI;AACJ,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;AACzB,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,IAAI,MAAM,GAAG,CAAC;AACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC5C,GAAG,MAAM;AACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC7E,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,OAAO;AACX,IAAI;AACJ,GAAG,IAAI,MAAM,GAAG,EAAE,EAAE;AACpB,IAAI,IAAI,MAAM,KAAK,CAAC;AACpB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACjD,SAAS;AACT,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACzB,MAAMA,UAAQ,IAAI,CAAC,CAAC;AACpB,MAAM,OAAO;AACb,MAAM;AACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,KAAK;AACL,IAAI,MAAM,IAAI,MAAM,GAAG,EAAE,EAAE;AAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC1C,KAAKA,UAAQ,IAAI,EAAE,CAAC;AACpB,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,IAAI,MAAM,GAAG,EAAE;AACnB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACvD,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACxB,KAAKA,UAAQ,IAAI,EAAE,CAAC;AACpB,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACzD,IAAI,MAAM;AACV,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC9E,KAAKA,UAAQ,IAAI,EAAE,CAAC;AACpB,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE;AACrB,KAAK,IAAI,MAAM,KAAK,EAAE;AACtB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9D,UAAU;AACV,MAAM,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC9B,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC1B,OAAOA,UAAQ,IAAI,EAAE,CAAC;AACtB,OAAO,OAAO;AACd,OAAO;AACP,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACjE,MAAM;AACN,KAAK,MAAM;AACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AAC3C,MAAMA,UAAQ,IAAI,EAAE,CAAC;AACrB,MAAM,OAAO;AACb,MAAM;AACN,KAAK,IAAI,MAAM,GAAG,EAAE;AACpB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACpE,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;AACzB,MAAMA,UAAQ,IAAI,EAAE,CAAC;AACrB,MAAM,OAAO;AACb,MAAM;AACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACtE,KAAK;AACL,IAAI;AACJ,GAAG;AACH,EAAE;AACF,CAAC;AACD;AACA,SAAS,gBAAgB,GAAG;AAC5B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,CAAC,IAAI,MAAM,CAAC;AACZ,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;AACnB;AACA,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;AACxB,EAAE,MAAM;AACR,EAAE,OAAO,KAAK;AACd,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC7B,IAAI,MAAM;AACV,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,MAAM;AACV,GAAG,KAAK,IAAI;AACZ;AACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;AAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,MAAM;AACV,GAAG;AACH,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;AACvC,GAAG;AACH,EAAE;AACF,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;AAC7B,CAAC;AACD;AACA;AACA,SAAS,OAAO,CAAC,MAAM,EAAE;AACzB,CAAC,OAAO,cAAc,CAAC,WAAW;AAClC;AACA,EAAE,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAEA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC;AACpE,EAAE,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC;AAC7C,CAAC;AACD,SAAS,OAAO,CAAC,MAAM,EAAE;AACzB,CAAC,IAAI,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC5B,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE;AAC9B,EAAE,IAAI,GAAG,CAAC;AACV,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,GAAG,IAAIA,UAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK;AACvG,GAAGA,UAAQ,GAAG,YAAY,CAAC;AAC3B,GAAG,IAAI;AACP,IAAI,OAAO,IAAI,EAAE,CAAC;AAClB,IAAI,SAAS;AACb,IAAIA,UAAQ,GAAG,GAAG,CAAC;AACnB,IAAI;AACJ,GAAG,CAAC,CAAC;AACL,EAAE;AACF;AACA,EAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,IAAI,CAAC,CAAC;AACpD,CAAC;AACD;AACA,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;AAC/B,SAAS,OAAO,GAAG;AACnB,CAAC,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;AAC9B,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;AACtC;AACA,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AACzB,EAAE,IAAI,YAAY,IAAIA,UAAQ;AAC9B,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;AAC5F,OAAO,IAAI,EAAE,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC;AAC/C,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;AAClC,EAAE,MAAM;AACR,EAAEA,UAAQ,EAAE,CAAC;AACb,EAAE,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;AAC9B,EAAE;AACF,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,CAACA,UAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;AAClH,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC3B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;AAC9B,CAAC,IAAI,GAAG,GAAGA,UAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;AACjC,CAAC,IAAI,KAAK,CAAC;AACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACX,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,EAAE;AACrC,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;AAC9B,GAAG,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;AAC7C,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;AAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;AAC/B,IAAI,MAAM;AACV,IAAI;AACJ,GAAG,aAAa,IAAI,CAAC,CAAC;AACtB,GAAG;AACH,EAAE,GAAG,IAAI,CAAC,CAAC;AACX,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;AAC9B,GAAG,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;AAChC,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;AAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;AAC/B,IAAI,MAAM;AACV,IAAI;AACJ,GAAG;AACH,EAAE,IAAI,aAAa,KAAK,GAAG,EAAE;AAC7B,GAAGA,UAAQ,GAAG,aAAa,CAAC;AAC5B,GAAG,OAAO,KAAK,CAAC,MAAM,CAAC;AACvB,GAAG;AACH,EAAE,GAAG,IAAI,CAAC,CAAC;AACX,EAAE,aAAa,GAAGA,UAAQ,CAAC;AAC3B,EAAE;AACF,CAAC,KAAK,GAAG,EAAE,CAAC;AACZ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AACvB,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;AACtB,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;AAC7B,EAAE,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;AAC5C,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACpB,EAAE,aAAa,IAAI,CAAC,CAAC;AACrB,EAAE;AACF,CAAC,GAAG,IAAI,CAAC,CAAC;AACV,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;AAC7B,EAAE,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;AAC/B,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACpB,EAAE;AACF;AACA,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;AAC7E,CAAC,IAAI,MAAM,IAAI,IAAI;AACnB,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;AAC/B,CAAC,OAAO,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;AAC/C,CAAC;AACD;AACA,SAAS,YAAY,CAAC,QAAQ,EAAE;AAChC;AACA,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC;AACnD,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,SAAS,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAC;AAC/H,CAAC,IAAI,QAAQ,IAAI,IAAI,EAAE,OAAO,QAAQ,GAAG,EAAE,CAAC;AAC5C,CAAC,IAAI,cAAc,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE;AACvK,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;AACpC,EAAE;AACF,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,kCAAkC,EAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC;AACD;AACA,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK;AAC3C,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AAC1C;AACA,CAAC,IAAI,SAAS,GAAG,EAAE,CAAC;AACpB,CAAC,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC7B,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;AAClE,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAChC,EAAE;AACF,CAAC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;AAC/C;AACA;AACA;AACA,CAAC,IAAI,iBAAiB,KAAK,iBAAiB,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE;AAC1E,EAAE,CAAC,iBAAiB,CAAC,iBAAiB,KAAK,iBAAiB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAC;AAC9G,EAAE;AACF,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;AACnC,CAAC,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;AAC9D,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;AACzB,CAAC,CAAC;AACF,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;AAChC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;AACrC;AACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;AAClC,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;AAC7C,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC/D,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;AACtC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;AACrB,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1B,EAAE;AACF,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;AACrC,EAAE,IAAI,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACzE,EAAE,IAAI,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK;AAC/B,GAAG,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;AAC5B,GAAG,IAAI,MAAM,IAAI,EAAE,EAAE;AACrB,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;AACvC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;AAC7C,KAAK,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;AACxB,KAAK,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;AACjC,KAAK;AACL,IAAI,OAAO,GAAG,CAAC;AACf,IAAI;AACJ;AACA,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3C,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACpC,GAAG,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AACnC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;AACvD,GAAG,CAAC;AACJ,EAAE,IAAI,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACpG,EAAE;AACF,CAAC,OAAO,IAAI,CAAC;AACb,CAAC,CAAC;AACF;AACA,IAAI,MAAM,GAAG;AACb,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,cAAc,KAAK,UAAU,GAAG,cAAc,GAAG,IAAI;AAC7J,CAAC,CAAC;AACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;AAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;AACnB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;AACvB,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACjD,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACvB,EAAE,OAAO,KAAK,CAAC;AACf,EAAE;AACF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD,CAAC,CAAC;AACF;AACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;AACpC;AACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC,IAAI,CAAC,YAAY;AAClB,EAAE,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;AAC3B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;AAC3B,CAAC,IAAI,MAAM,CAAC;AACZ;AACA,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AACpE,EAAE,MAAM,GAAG,EAAE,CAAC;AACd,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;AACzE,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;AACrB,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,KAAK,IAAI;AAC1G,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;AACrB;AACA,EAAE,MAAM,GAAG,EAAE,CAAC;AACd;AACA,CAAC,IAAI,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC;AAC3B,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;AAChC,CAAC,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;AAC/B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;AACrB;AACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;AAC5C,EAAE,MAAM;AACR;AACA,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAC1C,EAAE;AACF;AACA;AACA,CAAC,IAAI,MAAM,YAAY,GAAG;AAC1B,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClE,CAAC,IAAI,MAAM,YAAY,GAAG;AAC1B,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5D,CAAC,OAAO,MAAM,CAAC;AACf,CAAC,CAAC;AACF;AACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;AACpC;AACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;AACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AACrC,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;AACtB,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC;AACxB,CAAC,CAAC;AACF;AACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AAChD;AACO,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC;AACpK;AACA,IAAI,IAAI,GAAG,OAAO,UAAU,KAAK,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAC;AAChE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;AACpC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACxB;AACA,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D;AACA,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;AAC5C,CAAC,IAAI,CAAC,cAAc,EAAE;AACtB,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC;AACrC,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;AACnD,EAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,QAAQ,CAAC,CAAC;AACrE,EAAE;AACF,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AACzC,CAAC,CAAC;AACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;AAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;AACnB,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC,CAAC;AACF,MAAM,WAAW,GAAG,EAAE,CAAC;AACvB,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;AACpC,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC7E,CAAC,IAAI,YAAY,GAAGA,UAAQ,CAAC;AAC7B,CAACA,UAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;AACpC,CAACC,gBAAc,GAAG,WAAW,CAAC;AAC9B,CAACA,gBAAc,GAAG,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;AAC3D,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;AAC9B,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;AAC9B,CAACA,gBAAc,CAAC,kBAAkB,GAAGD,UAAQ,CAAC;AAC9C,CAACA,UAAQ,GAAG,YAAY,CAAC;AACzB,CAAC,OAAO,IAAI,EAAE,CAAC;AACf,CAAC,CAAC;AACF;AACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;AACpC;AACA,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AACrB,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AAC7F,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AAC1B,EAAE,OAAO,IAAI,IAAI;AACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO;AAClF,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;AAC9G,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;AAC3B,EAAE,OAAO,IAAI,IAAI;AACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO;AAC3E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;AAC9K;AACA,EAAE,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;AAC7B,CAAC,CAAC;AACF;AACA;AACA;AACA,SAAS,SAAS,CAAC,QAAQ,EAAE;AAC7B,CAAC,IAAI,cAAc,IAAI,cAAc,CAAC,YAAY;AAClD,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC;AAChC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC;AAC1B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;AAC9B,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;AAC1C,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;AAC1C,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;AACtC,CAAC,IAAI,cAAc,GAAG,SAAS,CAAC;AAChC,CAAC,IAAI,YAAY,GAAG,OAAO,CAAC;AAC5B,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;AACtC,CAAC,IAAI,mBAAmB,GAAGC,gBAAc,CAAC;AAC1C;AACA;AACA,CAAC,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACrD,CAAC,IAAI,eAAe,GAAG,iBAAiB,CAAC;AACzC,CAAC,IAAI,uBAAuB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;AACpF,CAAC,IAAI,UAAU,GAAG,cAAc,CAAC;AACjC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;AAC1C,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;AACxB,CAAC,MAAM,GAAG,WAAW,CAAC;AACtB,CAACD,UAAQ,GAAG,aAAa,CAAC;AAC1B,CAAC,cAAc,GAAG,mBAAmB,CAAC;AACtC,CAAC,cAAc,GAAG,mBAAmB,CAAC;AACtC,CAAC,YAAY,GAAG,iBAAiB,CAAC;AAClC,CAAC,SAAS,GAAG,cAAc,CAAC;AAC5B,CAAC,OAAO,GAAG,YAAY,CAAC;AACxB,CAAC,YAAY,GAAG,iBAAiB,CAAC;AAClC,CAACC,gBAAc,GAAG,mBAAmB,CAAC;AACtC,CAAC,GAAG,GAAG,QAAQ,CAAC;AAChB,CAAC,cAAc,GAAG,mBAAmB,CAAC;AACtC,CAAC,iBAAiB,GAAG,eAAe,CAAC;AACrC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,EAAE,GAAG,uBAAuB,CAAC,CAAC;AACnF,CAAC,cAAc,GAAG,UAAU,CAAC;AAC7B,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AACrE,CAAC,OAAO,KAAK,CAAC;AACd,CAAC;AACM,SAAS,WAAW,GAAG;AAC9B,CAAC,GAAG,GAAG,IAAI,CAAC;AACZ,CAAC,YAAY,GAAG,IAAI,CAAC;AACrB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC1B,CAAC;AACD;AACO,SAASE,cAAY,CAAC,SAAS,EAAE;AACxC,CAAC,IAAI,SAAS,CAAC,MAAM;AACrB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;AACvD;AACA,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;AAChD,CAAC;AACD;AACO,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;AACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAC9B,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;AACvD,CAAC;AACW,MAAC,OAAO,GAAG,QAAQ;AAC/B,IAAI,cAAc,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC5C,MAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,MAAC,cAAc,GAAG,cAAc,CAAC,eAAe;AAChD,MAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,MAAC,eAAe,GAAG;AAC/B,CAAC,KAAK,EAAE,CAAC;AACT,CAAC,MAAM,EAAE,CAAC;AACV,CAAC,aAAa,EAAE,CAAC;AACjB,CAAC,WAAW,EAAE,CAAC;AACf,EAAE;AACF,IAAI,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AACnC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7C,SAAS,YAAY,CAAC,aAAa,EAAE;AAC5C,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;AAC7B,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACzE,CAAC,OAAO,CAAC,CAAC,UAAU,GAAG,aAAa,IAAI,aAAa,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;AAC5F,CAAC;AACD;AACA;AACA;AACA,OAAO,CAAC,qBAAqB,GAAG,IAAI;;ACptCpC,IAAI,WAAW,CAAC;AAChB,IAAI;AACJ,CAAC,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;AACjC,CAAC,CAAC,OAAO,KAAK,EAAE,EAAE;AAClB,IAAI,UAAU,EAAE,gBAAgB,CAAC;AACjC,MAAM,aAAa,GAAG,OAAO,MAAM,KAAK,WAAW,CAAC;AACpD,MAAM,iBAAiB,GAAG,aAAa;AACvC,CAAC,SAAS,MAAM,EAAE,EAAE,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;AAC1E,MAAM,SAAS,GAAG,aAAa,GAAG,MAAM,GAAG,UAAU,CAAC;AACtD,MAAM,eAAe,GAAG,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;AACjE,IAAI,MAAM,EAAE,UAAU,CAAC;AACvB,IAAI,UAAU,CAAC;AACf,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjB,IAAI,OAAO,CAAC;AACZ,IAAI,cAAc,GAAG,IAAI,CAAC;AAC1B,MAAM,eAAe,GAAG,MAAM,CAAC;AAC/B,MAAM,WAAW,GAAG,iBAAiB,CAAC;AAC/B,MAAM,aAAa,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;AAC1C,MAAM,KAAK,SAAS,OAAO,CAAC;AACnC,CAAC,WAAW,CAAC,OAAO,EAAE;AACtB,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;AACjB,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AAElB,EAAE,IAAI,KAAK,CAAC;AACZ,EAAE,IAAI,eAAe,CAAC;AACtB,EAAE,IAAI,UAAU,CAAC;AACjB,EAAE,IAAI,YAAY,CAAC;AACnB,EAAE,IAAI,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;AAC9E,GAAG,OAAO,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;AAC3E,GAAG,GAAG,CAAC,WAAW,IAAI,WAAW,CAAC,UAAU;AAC5C,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;AAC9B,IAAI,OAAO,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;AAC7E,IAAI,GAAG,KAAK,CAAC;AACb;AACA,EAAE,IAAI,KAAK,GAAG,IAAI,CAAC;AACnB,EAAE,IAAI,CAAC,OAAO;AACd,GAAG,OAAO,GAAG,EAAE,CAAC;AAChB,EAAE,IAAI,YAAY,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC;AACnD,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,cAAc,CAAC;AACzE,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC;AACxD,EAAE,IAAI,mBAAmB,IAAI,IAAI;AACjC,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,EAAE,GAAG,CAAC,CAAC;AACtD,EAAE,IAAI,mBAAmB,GAAG,IAAI;AAChC,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;AACzD,EAAE,IAAI,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,EAAE;AACjE,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;AACzB,GAAG;AACH,EAAE,IAAI,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;AAClD,EAAE,IAAI,gBAAgB,IAAI,IAAI;AAC9B,GAAG,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,GAAG,EAAE,CAAC;AACpD,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK;AACrD,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;AACxB;AACA,EAAE,IAAI,iBAAiB,GAAG,mBAAmB,GAAG,EAAE,KAAK,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,CAAC,CAAC;AACpG,EAAE,IAAI,aAAa,GAAG,mBAAmB,GAAG,IAAI,CAAC;AACjD,EAAE,IAAI,cAAc,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,IAAI,CAAC;AACrE,EAAE,IAAI,cAAc,GAAG,IAAI,EAAE;AAC7B,GAAG,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;AAC3E,GAAG;AACH,EAAE,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC7B,EAAE,IAAI,gBAAgB,GAAG,CAAC,CAAC;AAC3B,EAAE,IAAI,oCAAoC,GAAG,CAAC,CAAC;AAC/C;AACA,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,KAAK,EAAE,aAAa,EAAE;AAC3D,GAAG,IAAI,CAAC,MAAM,EAAE;AAChB,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;AACzC,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAC7F,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjB,IAAI;AACJ,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;AAChC,GAAG,IAAI,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE;AACnC;AACA,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAClD,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;AACtG,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;AACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;AACjB,IAAI;AACJ,IAAI,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC;AAC3C,GAAG,KAAK,GAAG,QAAQ,CAAC;AACpB,GAAG,IAAI,aAAa,GAAG,mBAAmB,EAAE,QAAQ,KAAK,aAAa,GAAG,IAAI,CAAC,CAAC;AAC/E,GAAG,YAAY,GAAG,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;AAC3D,GAAG,IAAI,KAAK,CAAC,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACzD,IAAI,cAAc,GAAG,EAAE,CAAC;AACxB,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC;AACnC,IAAI;AACJ,IAAI,cAAc,GAAG,IAAI,CAAC;AAC1B,GAAG,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;AACjC,GAAG,IAAI,UAAU,EAAE;AACnB,IAAI,IAAI,UAAU,CAAC,aAAa;AAChC,KAAK,UAAU,GAAG,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;AAChE,IAAI,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;AACpD,IAAI,IAAI,YAAY,GAAG,mBAAmB,EAAE;AAC5C;AACA,KAAK,MAAM,IAAI,KAAK,CAAC,oGAAoG,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;AACrJ,KAAK;AACL,IAAI,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE;AACjC;AACA,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAClD,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;AAC5C,MAAM,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,MAAM,IAAI,CAAC,IAAI;AACf,OAAO,SAAS;AAChB,MAAM,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;AAC9D,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;AACxC,OAAO,IAAI,CAAC,cAAc,EAAE;AAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC/D,QAAQ;AACR,OAAO,UAAU,GAAG,cAAc,CAAC;AACnC,OAAO;AACP,MAAM,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;AAC3C,MAAM;AACN,KAAK,IAAI,CAAC,yBAAyB,GAAG,YAAY,CAAC;AACnD,KAAK;AACL,IAAI,IAAI,CAAC,YAAY,EAAE;AACvB,KAAK,UAAU,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,CAAC;AAC7C,KAAK;AACL,IAAI;AACJ,GAAG,IAAI,eAAe;AACtB,IAAI,eAAe,GAAG,KAAK,CAAC;AAC5B,GAAG,IAAI,aAAa,CAAC;AACrB,GAAG,IAAI;AACP,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AAClE,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;AAC1D,UAAU,IAAI,KAAK,CAAC,WAAW,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,YAAY,QAAQ,CAAC,EAAE;AACnI;AACA,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;AACzD,MAAM,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;AACxB,KAAK;AACL,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;AACjB,IAAI,IAAI,UAAU,GAAG,cAAc,CAAC;AACpC,IAAI,IAAI,cAAc;AACtB,KAAK,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AAClC,IAAI,IAAI,YAAY,IAAI,YAAY,CAAC,WAAW,EAAE;AAClD,KAAK,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC7F,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;AAChC,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC,CAAC;AAChC,KAAK,OAAO,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;AACjC,MAAM,IAAI,cAAc,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;AAC3D,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,eAAe,GAAG,KAAK,CAAC,IAAI,iBAAiB,KAAK,CAAC,CAAC;AAC3F,OAAO,iBAAiB,GAAG,CAAC,CAAC;AAC7B,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,EAAE;AAC1D,OAAO,IAAI,iBAAiB,IAAI,CAAC;AACjC,QAAQ,iBAAiB,IAAI,CAAC,CAAC;AAC/B,OAAO,MAAM;AACb,OAAO,IAAI,iBAAiB,IAAI,CAAC,EAAE;AACnC;AACA,QAAQ,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;AACxD,SAAS,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;AAChF,QAAQ,iBAAiB,GAAG,CAAC,CAAC,CAAC;AAC/B,QAAQ;AACR,OAAO,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC;AACxC,OAAO,CAAC,EAAE,CAAC;AACX,OAAO;AACP,MAAM;AACN,KAAK,IAAI,iBAAiB,IAAI,CAAC,IAAI,UAAU,EAAE;AAC/C;AACA,MAAM,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;AACtD,OAAO,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;AAC9E,MAAM;AACN,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;AACxC,KAAK,IAAI,QAAQ,GAAG,OAAO;AAC3B,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;AACzB,KAAK,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;AAC7B,KAAK,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;AAC/E,KAAK,YAAY,GAAG,IAAI,CAAC;AACzB,KAAK,OAAO,UAAU,CAAC;AACvB,KAAK;AACL,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;AAC5B,IAAI,IAAI,aAAa,GAAG,iBAAiB,EAAE;AAC3C,KAAK,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;AAC1B,KAAK,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC;AAC3B,KAAK,OAAO,MAAM,CAAC;AACnB,KAAK;AACL,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC5C,IAAI,CAAC,MAAM,KAAK,EAAE;AAClB,IAAI,aAAa,GAAG,KAAK,CAAC;AAC1B,IAAI,MAAM,KAAK,CAAC;AAChB,IAAI,SAAS;AACb,IAAI,IAAI,UAAU,EAAE;AACpB,KAAK,eAAe,EAAE,CAAC;AACvB,KAAK,IAAI,eAAe,IAAI,KAAK,CAAC,cAAc,EAAE;AAClD,MAAM,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;AACtD;AACA,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;AAC1D,MAAM,IAAI,aAAa,GAAG,CAAC,KAAK,CAAC,kBAAkB,IAAI,iBAAiB,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;AAC7F,MAAM,IAAI,CAAC,aAAa,EAAE;AAC1B,OAAO,IAAI,KAAK,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,CAAC,YAAY,CAAC,KAAK,KAAK,EAAE;AACtF;AACA,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;AAChD,QAAQ;AACR,OAAO,KAAK,CAAC,yBAAyB,GAAG,YAAY,CAAC;AACtD;AACA,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;AACrD,OAAO,OAAO,YAAY,CAAC;AAC3B,OAAO;AACP,MAAM;AACN,KAAK;AACL;AACA,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;AAClD,IAAI,IAAI,aAAa,GAAG,iBAAiB;AACzC,KAAK,QAAQ,GAAG,KAAK,CAAC;AACtB,IAAI;AACJ,GAAG,CAAC;AACJ,EAAE,MAAM,eAAe,GAAG,MAAM;AAChC,GAAG,IAAI,oCAAoC,GAAG,EAAE;AAChD,IAAI,oCAAoC,EAAE,CAAC;AAC3C,GAAG,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;AACnD,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,IAAI,CAAC,YAAY;AACxD,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,CAAC;AACrC,GAAG,IAAI,gBAAgB,GAAG,KAAK,EAAE;AACjC;AACA,IAAI,UAAU,CAAC,WAAW,GAAG,IAAI,CAAC;AAClC,IAAI,oCAAoC,GAAG,CAAC,CAAC;AAC7C,IAAI,gBAAgB,GAAG,CAAC,CAAC;AACzB,IAAI,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;AACpC,KAAK,iBAAiB,GAAG,EAAE,CAAC;AAC5B,IAAI,MAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE;AAC7D,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC9D,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;AAC7C,KAAK;AACL,IAAI,iBAAiB,GAAG,EAAE,CAAC;AAC3B,IAAI;AACJ,GAAG,CAAC;AACJ,EAAE,MAAM,SAAS,GAAG,CAAC,KAAK,KAAK;AAC/B,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AAC7B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;AACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;AACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACvC,IAAI,MAAM;AACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;AAClB,IAAI;AACJ,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACpC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACnB,IAAI;AACJ,GAAG,CAAC;AACJ,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;AAC1B,GAAG,IAAI,QAAQ,GAAG,OAAO;AACzB,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAChC;AACA,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;AAC3B,GAAG,IAAI,MAAM,CAAC;AACd,GAAG,IAAI,IAAI,KAAK,QAAQ,EAAE;AAC1B,IAAI,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;AACjC,IAAI,IAAI,cAAc,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,MAAM,EAAE;AAChE,KAAK,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,SAAS,IAAI,eAAe,EAAE;AAC/D,MAAM,IAAI,QAAQ,CAAC;AACnB,MAAM,IAAI,QAAQ,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;AAC5G,MAAM,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;AACvC,OAAO,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC9C,MAAM,IAAI,UAAU,CAAC;AACrB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;AACnC,OAAO,UAAU,GAAG,cAAc,CAAC;AACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;AAC/B,OAAO,QAAQ,IAAI,CAAC,CAAC;AACrB,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;AACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;AACrB,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACpC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC,CAAC;AAC/E,OAAO,MAAM;AACb,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;AACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;AACrB,OAAO;AACP,MAAM,cAAc,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAChC,MAAM,cAAc,CAAC,QAAQ,GAAG,UAAU,CAAC;AAC3C,MAAM,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;AAC9B,MAAM,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;AACzC,MAAM;AACN,KAAK,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3C,KAAK,cAAc,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;AAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,IAAI,CAAC,OAAO,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;AAC5C,KAAK,OAAO;AACZ,KAAK;AACL,IAAI,IAAI,UAAU,CAAC;AACnB;AACA,IAAI,IAAI,SAAS,GAAG,IAAI,EAAE;AAC1B,KAAK,UAAU,GAAG,CAAC,CAAC;AACpB,KAAK,MAAM,IAAI,SAAS,GAAG,KAAK,EAAE;AAClC,KAAK,UAAU,GAAG,CAAC,CAAC;AACpB,KAAK,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE;AACpC,KAAK,UAAU,GAAG,CAAC,CAAC;AACpB,KAAK,MAAM;AACX,KAAK,UAAU,GAAG,CAAC,CAAC;AACpB,KAAK;AACL,IAAI,IAAI,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;AACjC,IAAI,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;AACrC,KAAK,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC5C;AACA,IAAI,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;AACzC,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;AACxD,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;AACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,MAAM,IAAI,EAAE,GAAG,IAAI,EAAE;AACrB,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,CAAC;AAClC,OAAO,MAAM,IAAI,EAAE,GAAG,KAAK,EAAE;AAC7B,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;AAC9C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAChD,OAAO,MAAM;AACb,OAAO,CAAC,EAAE,GAAG,MAAM,MAAM,MAAM;AAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,MAAM;AAC3D,QAAQ;AACR,OAAO,EAAE,GAAG,OAAO,IAAI,CAAC,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC;AAC5D,OAAO,CAAC,EAAE,CAAC;AACX,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AACtD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAChD,OAAO,MAAM;AACb,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAChD,OAAO;AACP,MAAM;AACN,KAAK,MAAM,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;AAClD,KAAK,MAAM;AACX,KAAK,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;AACvD,KAAK;AACL;AACA,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;AACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;AACxC,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,EAAE;AAC/B,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;AACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AAC3E,MAAM;AACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;AACjC,KAAK,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AACjC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;AACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AAC3E,MAAM;AACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACtC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACxC,KAAK,MAAM;AACX,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;AACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;AAC3E,MAAM;AACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;AACnB,KAAK;AACL,IAAI,QAAQ,IAAI,MAAM,CAAC;AACvB,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;AACjC,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,KAAK,EAAE;AAC/B;AACA,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;AAC9G,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;AACjC,MAAM,MAAM,IAAI,KAAK,GAAG,KAAK,EAAE;AAC/B,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;AACjC,MAAM,MAAM,IAAI,KAAK,GAAG,OAAO,EAAE;AACjC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AACtC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;AACxC,MAAM,MAAM;AACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC5C,MAAM,QAAQ,IAAI,CAAC,CAAC;AACpB,MAAM;AACN,KAAK,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,EAAE;AACrC,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;AACzB,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;AACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;AAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;AACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;AAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;AACpB,MAAM,MAAM;AACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;AACpB,MAAM;AACN,KAAK,MAAM;AACX,KAAK,IAAI,UAAU,CAAC;AACpB,KAAK,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,GAAG,WAAW,IAAI,KAAK,IAAI,CAAC,UAAU,EAAE;AAC5F,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC7C,MAAM,IAAI,QAAQ,CAAC;AACnB,MAAM,IAAI,UAAU,GAAG,CAAC;AACxB;AACA,QAAQ,CAAC,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;AACzH,OAAO,QAAQ,IAAI,CAAC,CAAC;AACrB,OAAO,OAAO;AACd,OAAO;AACP,OAAO,QAAQ,EAAE,CAAC;AAClB,MAAM;AACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;AACnB,KAAK;AACL,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,UAAU,EAAE;AACxD,IAAI,IAAI,CAAC,KAAK;AACd,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,SAAS;AACT,KAAK,IAAI,YAAY,EAAE;AACvB,MAAM,IAAI,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC5C,MAAM,IAAI,OAAO,EAAE;AACnB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;AACxB,QAAQ,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,KAAK,YAAY,CAAC,WAAW,GAAG,EAAE,CAAC,CAAC;AACtF,QAAQ,OAAO,CAAC,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC/C,QAAQ;AACR,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACjC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;AAClD,OAAO,QAAQ,IAAI,CAAC,CAAC;AACrB,OAAO,OAAO;AACd,OAAO;AACP,OAAO,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;AAC7D,MAAM;AACN,KAAK,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;AACzC,KAAK,IAAI,WAAW,KAAK,MAAM,EAAE;AACjC,MAAM,WAAW,CAAC,KAAK,CAAC,CAAC;AACzB,MAAM,MAAM,IAAI,WAAW,KAAK,KAAK,EAAE;AACvC,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;AACvB,MAAM,MAAM,IAAI,WAAW,KAAK,GAAG,EAAE;AACrC,MAAM,IAAI,IAAI,CAAC,gBAAgB,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC3D,WAAW;AACX,OAAO,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;AAC3B,OAAO,IAAI,MAAM,GAAG,IAAI,EAAE;AAC1B,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;AAC3C,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AACpC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAClC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACzC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AAC3C,QAAQ,MAAM;AACd,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAClC,QAAQ,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC/C,QAAQ,QAAQ,IAAI,CAAC,CAAC;AACtB,QAAQ;AACR,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE;AAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC;AAClB,QAAQ,IAAI,CAAC,UAAU,CAAC,CAAC;AACzB,QAAQ;AACR,OAAO;AACP,MAAM,MAAM;AACZ,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACzD,OAAO,IAAI,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AAChD,OAAO,IAAI,KAAK,YAAY,cAAc,EAAE;AAC5C,QAAQ,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AACtC,QAAQ,IAAI,SAAS,CAAC,KAAK,EAAE;AAC7B,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE;AAC7B,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AACpC,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;AAC9C,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AACjC,UAAU;AACV,SAAS,IAAI,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC7D,SAAS,IAAI,WAAW,KAAK,KAAK,EAAE;AACpC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AACpC,WAAW,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5B,WAAW,MAAM;AACjB,WAAW,WAAW,CAAC,KAAK,CAAC,CAAC;AAC9B,WAAW;AACX,UAAU,MAAM;AAChB,UAAU,IAAI,CAAC,WAAW,CAAC,CAAC;AAC5B,UAAU;AACV,SAAS,OAAO;AAChB,SAAS;AACT,QAAQ,IAAI,aAAa,GAAG,MAAM,CAAC;AACnC,QAAQ,IAAI,iBAAiB,GAAG,UAAU,CAAC;AAC3C,QAAQ,IAAI,eAAe,GAAG,QAAQ,CAAC;AACvC,QAAQ,MAAM,GAAG,IAAI,CAAC;AACtB,QAAQ,IAAI,MAAM,CAAC;AACnB,QAAQ,IAAI;AACZ,SAAS,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,KAAK;AAC7D;AACA,UAAU,MAAM,GAAG,aAAa,CAAC;AACjC,UAAU,aAAa,GAAG,IAAI,CAAC;AAC/B,UAAU,QAAQ,IAAI,IAAI,CAAC;AAC3B,UAAU,IAAI,QAAQ,GAAG,OAAO;AAChC,WAAW,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAC9B,UAAU,OAAO;AACjB,WAAW,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;AACxD,WAAW,CAAC;AACZ,UAAU,EAAE,IAAI,CAAC,CAAC;AAClB,SAAS,SAAS;AAClB;AACA,SAAS,IAAI,aAAa,EAAE;AAC5B,UAAU,MAAM,GAAG,aAAa,CAAC;AACjC,UAAU,UAAU,GAAG,iBAAiB,CAAC;AACzC,UAAU,QAAQ,GAAG,eAAe,CAAC;AACrC,UAAU,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;AACvC,UAAU;AACV,SAAS;AACT,QAAQ,IAAI,MAAM,EAAE;AACpB,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;AAC/C,UAAU,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;AAC7C,SAAS,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;AACjF,SAAS;AACT,QAAQ,OAAO;AACf,QAAQ;AACR,OAAO;AACP;AACA,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AAChC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;AACxB,OAAO,MAAM;AACb;AACA,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;AACzB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;AACpC;AACA,QAAQ,IAAI,IAAI,KAAK,KAAK;AAC1B,SAAS,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3B,QAAQ;AACR;AACA;AACA,OAAO,IAAI,IAAI,KAAK,UAAU;AAC9B,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE;AACA;AACA,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;AAC1B,OAAO;AACP,MAAM;AACN,KAAK;AACL,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE;AAClC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;AAC7C,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;AACjC,IAAI,IAAI,KAAK,GAAG,kBAAkB,IAAI,KAAK,IAAI,CAAC,kBAAkB,EAAE;AACpE;AACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC7C,KAAK,MAAM,IAAI,KAAK,GAAG,mBAAmB,IAAI,KAAK,GAAG,CAAC,EAAE;AACzD;AACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,UAAU,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;AAC9C,KAAK,MAAM;AACX;AACA,KAAK,IAAI,IAAI,CAAC,kBAAkB,EAAE;AAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AACrD,MAAM,MAAM,IAAI,IAAI,CAAC,mBAAmB,EAAE;AAC1C,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;AACpC,MAAM,MAAM,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,SAAS,EAAE;AAC3D,MAAM,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD;AACA,MAAM,IAAI,KAAK,CAAC;AAChB,MAAM,IAAI,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE;AAC9C,OAAO,IAAI,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AAC1D,OAAO,IAAI,MAAM,GAAG,EAAE,CAAC;AACvB,OAAO,OAAO,IAAI,EAAE;AACpB,QAAQ,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;AAClC,QAAQ,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,EAAE,MAAM;AACnD,QAAQ,KAAK,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;AAC7B,QAAQ;AACR;AACA,OAAO,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;AACjE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACvB,OAAO,MAAM;AACb,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;AAC9B,OAAO,IAAI,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;AAC3D,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9B,QAAQ,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;AAC9B,QAAQ,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;AACvD,QAAQ,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;AAC/B,QAAQ;AACR;AACA,OAAO,IAAI,aAAa,EAAE;AAC1B,QAAQ,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;AAC3C,QAAQ,MAAM;AACd,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAClD,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC/C,SAAS,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AACjE,SAAS;AACT,QAAQ;AACR;AACA,OAAO,IAAI,MAAM,EAAE;AACnB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACpE,QAAQ;AACR,OAAO;AACP;AACA,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;AAC3C,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;AACzC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;AACnE,MAAM,OAAO;AACb,MAAM,MAAM;AACZ,MAAM,MAAM,IAAI,UAAU,CAAC,KAAK,GAAG,iEAAiE;AACpG,OAAO,+EAA+E;AACtF,OAAO,2CAA2C,CAAC,CAAC;AACpD,MAAM;AACN,KAAK;AACL,IAAI,QAAQ,IAAI,CAAC,CAAC;AAClB,IAAI,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE;AACpC,IAAI,IAAI,IAAI,CAAC,oBAAoB;AACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,SAAS;AACT,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AAC5B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AAC5B,KAAK;AACL,IAAI,MAAM;AACV,IAAI,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;AAC7C,IAAI;AACJ,GAAG,CAAC;AACJ;AACA,EAAE,MAAM,gBAAgB,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,KAAK;AAChH;AACA,GAAG,IAAI,IAAI,CAAC;AACZ,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;AACxB,IAAI,IAAI,GAAG,EAAE,CAAC;AACd,IAAI,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AAC5B,KAAK,IAAI,CAAC,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC;AACnF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC5C,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrB,KAAK;AACL,IAAI,MAAM;AACV,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC/B,IAAI;AACJ,GAAG,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;AAC5B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;AACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;AACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACvC,IAAI,MAAM;AACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;AAClB,IAAI;AACJ,GAAG,IAAI,GAAG,CAAC;AACX,GAAG,IAAI,IAAI,CAAC,oBAAoB,EAAE;AAClC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACnB,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;AAC3B,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;AAClC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,KAAK;AACL;AACA,IAAI,MAAM;AACV,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,KAAK,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,KAAK;AACL,IAAI;AACJ,GAAG;AACH,EAAE,CAAC,MAAM,KAAK;AACd,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,IAAI,YAAY,GAAG,QAAQ,GAAG,KAAK,CAAC;AACvC,GAAG,QAAQ,IAAI,CAAC,CAAC;AACjB,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;AAChB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACnF,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;AACf,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,KAAK,IAAI,EAAE,CAAC;AACZ,KAAK;AACL,IAAI;AACJ,GAAG,IAAI,IAAI,GAAG,MAAM,EAAE;AACtB,IAAI,MAAM,IAAI,KAAK,CAAC,6DAA6D;AACjF,IAAI,4DAA4D,CAAC,CAAC;AAClE,IAAI;AACJ,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;AAC9C,GAAG,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AAC9C,GAAG,CAAC;AACJ;AACA,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,KAAK,KAAK,GAAG,gBAAgB;AAClE,EAAE,CAAC,OAAO,CAAC,kBAAkB,IAAI,CAAC,iBAAiB;AACnD,EAAE,CAAC,MAAM,KAAK;AACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7G,GAAG,IAAI,YAAY,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC;AACzC,GAAG,IAAI,SAAS,CAAC;AACjB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACnF,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;AACtC,KAAK,IAAI,cAAc;AACvB,MAAM,UAAU,GAAG,cAAc,CAAC;AAClC,UAAU;AACV;AACA,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AACrC,MAAM,IAAI,cAAc,GAAG,UAAU,CAAC;AACtC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;AAC1C,MAAM,IAAI,cAAc,GAAG,CAAC,CAAC;AAC7B,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;AACxC,OAAO,IAAI,CAAC,cAAc,EAAE;AAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC/D,QAAQ,cAAc,EAAE,CAAC;AACzB,QAAQ;AACR,OAAO,UAAU,GAAG,cAAc,CAAC;AACnC,OAAO;AACP,MAAM,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,IAAI,QAAQ,EAAE;AAChD;AACA,OAAO,QAAQ,EAAE,CAAC;AAClB,OAAO,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;AACnD,OAAO;AACP,OAAO,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;AACvE,MAAM,SAAS,GAAG,IAAI,CAAC;AACvB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;AACvC,MAAM;AACN,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,KAAK;AACL,IAAI;AACJ,GAAG,IAAI,CAAC,SAAS,EAAE;AACnB,IAAI,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;AAC7C,IAAI,IAAI,QAAQ;AAChB,KAAK,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,QAAQ,CAAC;AAC7C;AACA,KAAK,eAAe,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;AACvE,IAAI;AACJ,GAAG;AACH,EAAE,CAAC,MAAM,KAAK;AACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC7G,GAAG,IAAI,cAAc,GAAG,CAAC,CAAC;AAC1B,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AAC1G,IAAI,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;AACrC,IAAI,IAAI,CAAC,cAAc,EAAE;AACzB,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC5D,KAAK,cAAc,EAAE,CAAC;AACtB,KAAK;AACL,IAAI,UAAU,GAAG,cAAc,CAAC;AAChC,IAAI;AACJ,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;AAC5C,GAAG,IAAI,QAAQ,EAAE;AACjB,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,iBAAiB,EAAE;AAC/C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;AAC7D,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC;AACxC,KAAK;AACL,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;AACnC,IAAI,MAAM;AACV,IAAI,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC;AACtF,IAAI;AACJ;AACA,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM;AACzB,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACnF,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;AACvB,KAAK;AACL,GAAG,CAAC;AACJ;AACA;AACA,EAAE,MAAM,eAAe,GAAG,OAAO,IAAI,CAAC,UAAU,IAAI,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;AAClF;AACA,EAAE,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,MAAM,KAAK;AACpD,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;AAC5E,GAAG,GAAG,WAAW,CAAC;AAClB;AACA,EAAE,MAAM,WAAW,GAAG,CAAC,MAAM,KAAK;AAClC,GAAG,IAAI,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,kBAAkB,KAAK;AAC3I,IAAI,IAAI,kBAAkB;AAC1B,KAAK,OAAO,eAAe,GAAG,IAAI,CAAC;AACnC,IAAI,QAAQ,GAAG,WAAW,CAAC;AAC3B,IAAI,IAAI,WAAW,GAAG,MAAM,CAAC;AAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;AAChB,IAAI,eAAe,EAAE,CAAC;AACtB,IAAI,IAAI,WAAW,KAAK,MAAM,EAAE;AAChC,KAAK,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAC7C,KAAK;AACL,IAAI,OAAO,QAAQ,CAAC;AACpB,IAAI,CAAC,CAAC;AACN,GAAG,IAAI,WAAW,KAAK,CAAC;AACxB,IAAI,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;AAC/B,GAAG,QAAQ,GAAG,WAAW,CAAC;AAC1B,GAAG,CAAC;AACJ;AACA,EAAE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK;AAC5B,GAAG,IAAI,OAAO,CAAC;AACf,GAAG,IAAI,GAAG,GAAG,SAAS,EAAE;AACxB;AACA,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,eAAe;AACvC,KAAK,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;AAC/E,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe;AACtC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,GAAG,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;AACrG,IAAI;AACJ,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;AAClF,GAAG,IAAI,SAAS,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;AAClD,GAAG,UAAU,GAAG,SAAS,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AACxG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;AACtC,GAAG,IAAI,MAAM,CAAC,IAAI;AAClB,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;AAC1C;AACA,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;AAC5C,GAAG,QAAQ,IAAI,KAAK,CAAC;AACrB,GAAG,KAAK,GAAG,CAAC,CAAC;AACb,GAAG,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;AACnC,GAAG,OAAO,MAAM,GAAG,SAAS,CAAC;AAC7B,GAAG,CAAC;AACJ,EAAE,MAAM,SAAS,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,KAAK;AAC1D,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC;AACpC,GAAG,IAAI,CAAC,QAAQ;AAChB,IAAI,QAAQ,GAAG,IAAI,CAAC;AACpB,GAAG,IAAI,QAAQ,GAAG,aAAa,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE;AAClG,IAAI,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC;AACpC,IAAI,IAAI,EAAE,QAAQ,GAAG,cAAc,CAAC;AACpC,KAAK,QAAQ,GAAG,aAAa,CAAC;AAC9B,IAAI,UAAU,CAAC,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;AACxC,IAAI,MAAM;AACV,IAAI,IAAI,QAAQ,IAAI,cAAc;AAClC,KAAK,QAAQ,GAAG,aAAa,CAAC;AAC9B,IAAI,UAAU,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC;AACrC,IAAI;AACJ,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,IAAI,iBAAiB,GAAG,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;AACtG,GAAG,UAAU,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;AACxC,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC;AAC9B,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACtC;AACA,GAAG,IAAI,QAAQ,GAAG,aAAa,EAAE;AACjC,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;AACzB,IAAI,UAAU,CAAC,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC;AAC9C,IAAI,eAAe,GAAG,IAAI,CAAC;AAC3B,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;AACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;AACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;AACnC,KAAK,MAAM;AACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;AACnC,KAAK;AACL,IAAI,MAAM;AACV,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;AACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;AACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;AACnC,KAAK,MAAM;AACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;AACnC,KAAK;AACL;AACA,IAAI,IAAI,cAAc;AACtB,KAAK,gBAAgB,IAAI,oCAAoC,GAAG,cAAc,CAAC;AAC/E;AACA,IAAI,IAAI,iBAAiB,CAAC,MAAM,IAAI,gBAAgB;AACpD,KAAK,iBAAiB,CAAC,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;AAClD,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AACvC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,IAAI;AACJ,GAAG,CAAC;AACJ,EAAE,MAAM,eAAe,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,eAAe,EAAE,cAAc,KAAK;AACjF,GAAG,IAAI,UAAU,GAAG,MAAM,CAAC;AAC3B,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;AAC/B,GAAG,IAAI,WAAW,GAAG,OAAO,CAAC;AAC7B,GAAG,IAAI,SAAS,GAAG,KAAK,CAAC;AACzB,GAAG,MAAM,GAAG,UAAU,CAAC;AACvB,GAAG,QAAQ,GAAG,CAAC,CAAC;AAChB,GAAG,KAAK,GAAG,CAAC,CAAC;AACb,GAAG,IAAI,CAAC,MAAM;AACd,IAAI,UAAU,GAAG,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;AACtD,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;AAChC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;AAC/C,GAAG,UAAU,GAAG,MAAM,CAAC;AACvB,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;AAC/B,GAAG,MAAM,GAAG,UAAU,CAAC;AACvB,GAAG,QAAQ,GAAG,YAAY,CAAC;AAC3B,GAAG,OAAO,GAAG,WAAW,CAAC;AACzB,GAAG,KAAK,GAAG,SAAS,CAAC;AACrB,GAAG,IAAI,YAAY,GAAG,CAAC,EAAE;AACzB,IAAI,IAAI,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,CAAC,CAAC;AAC7C,IAAI,IAAI,MAAM,GAAG,OAAO;AACxB,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;AACtB,IAAI,IAAI,iBAAiB,GAAG,eAAe,GAAG,KAAK,CAAC;AACpD,IAAI,MAAM,CAAC,UAAU,CAAC,iBAAiB,GAAG,YAAY,EAAE,iBAAiB,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzF,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,iBAAiB,CAAC,CAAC;AACrE,IAAI,QAAQ,GAAG,MAAM,CAAC;AACtB,IAAI,MAAM;AACV,IAAI,MAAM,CAAC,eAAe,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;AACpD,IAAI;AACJ,GAAG,CAAC;AACJ,EAAE;AACF,CAAC,SAAS,CAAC,MAAM,EAAE;AACnB;AACA,EAAE,MAAM,GAAG,MAAM,CAAC;AAClB,EAAE,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;AAC3G,EAAE,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC;AAC/B,EAAE,QAAQ,GAAG,CAAC,CAAC;AACf,EAAE;AACF,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,EAAE;AACtB,EAAE,QAAQ,GAAG,KAAK,CAAC;AACnB,EAAE;AACF,CAAC,IAAI,QAAQ,GAAG;AAChB,EAAE,OAAO,QAAQ,CAAC;AAClB,EAAE;AACF,CAAC,eAAe,GAAG;AACnB,EAAE,IAAI,IAAI,CAAC,UAAU;AACrB,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;AACxB,EAAE,IAAI,IAAI,CAAC,YAAY;AACvB,GAAG,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;AAC1B,EAAE;AACF,CAAC;AACD;AACA,gBAAgB,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,iBAAiB,QAAQ,EAAE,MAAM,EAAE,CAAC;AACvJ,UAAU,GAAG,CAAC;AACd,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE;AACpC,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;AACtC,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;AACtG;AACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;AAC3C,GAAG,MAAM,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;AACnD;AACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;AAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;AAC5G,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;AAC/C,GAAG,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE;AAC7B,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE;AAC3B,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;AACxB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;AACtC,IAAI;AACJ;AACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT;AACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;AAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC;AAC3B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,CAAC,CAAC;AACpE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACrE,GAAG;AACH,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE;AACnC,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE;AAC7B,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AACvB,GAAG,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;AACnB,GAAG;AACH,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;AACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AAC1B,GAAG;AACH,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AACd,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;AACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;AACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AAC1B,GAAG;AACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;AACnD,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;AACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;AACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;AAC1B,GAAG;AACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;AACtC,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;AACrC,EAAE,IAAI,IAAI,CAAC,SAAS;AACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;AACvD;AACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACzG,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,UAAU,EAAE,gBAAgB,EAAE;AACpC,EAAE,IAAI,WAAW,GAAG,UAAU,CAAC,WAAW,CAAC;AAC3C,EAAE,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS;AACjD,GAAG,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACvF;AACA,GAAG,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;AAC7C,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;AACrC,EAAE,IAAI,IAAI,CAAC,SAAS;AACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;AACvD;AACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;AACzG,EAAE;AACF,CAAC,EAAE;AACH,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE;AAC5B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;AAChD,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;AAC1B,EAAE;AACF,CAAC,CAAC,CAAC;AACH;AACA,SAAS,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE;AACpE,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC;AACpC,CAAC,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,EAAE;AACzB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;AAClC,EAAE,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE;AAClC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;AACzC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC;AAC3C,EAAE,MAAM;AACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;AACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;AAC7C,EAAE,QAAQ,IAAI,CAAC,CAAC;AAChB,EAAE;AACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC3B,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC3B,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;AACjE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;AACvG,CAAC;AACD,SAAS,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE;AAC/C,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC;AAChC,CAAC,IAAI,MAAM,EAAE,QAAQ,CAAC;AACtB,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;AACrB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;AAC9B,EAAE,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACnC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACrC,EAAE,MAAM;AACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACzC,EAAE,QAAQ,IAAI,CAAC,CAAC;AAChB,EAAE;AACF,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC9B,CAAC;AACD;AACA,SAAS,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;AAC5D,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AAC5B,CAAC,QAAQ,MAAM;AACf,EAAE,KAAK,CAAC;AACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT,EAAE,KAAK,CAAC;AACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT,EAAE,KAAK,CAAC;AACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT,EAAE,KAAK,CAAC;AACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT,EAAE,KAAK,EAAE;AACT,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC7B,GAAG,MAAM;AACT,EAAE;AACF,GAAG,IAAI,MAAM,GAAG,KAAK,EAAE;AACvB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;AAChC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;AAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACvC,IAAI,MAAM;AACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC;AACtC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC;AAC/C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC;AAC9C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;AACvC,IAAI;AACJ,EAAE;AACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AAC9B,CAAC,QAAQ,IAAI,MAAM,CAAC;AACpB,CAAC,OAAO,QAAQ,CAAC;AACjB,CAAC;AACD;AACA,SAAS,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE;AAC5C;AACA,CAAC,IAAI,MAAM,CAAC;AACZ,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;AAC7C,CAAC,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC;AAClD,CAAC,OAAO,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,EAAE;AACpC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;AAC7B,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;AACrB,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAClE,EAAE,cAAc,IAAI,CAAC,CAAC;AACtB,EAAE,IAAI,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC;AACzC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;AAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;AACpC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC;AAC7C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;AAC5C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;AACrC,EAAE,OAAO,GAAG,MAAM,CAAC;AACnB,EAAE;AACF,CAAC,OAAO,UAAU,CAAC;AACnB,CAAC;AACD;AACA,SAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE;AACtD,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,EAAE,UAAU,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,iBAAiB,GAAG,cAAc,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;AACxH,EAAE,cAAc,CAAC,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;AACpD,EAAE,IAAI,YAAY,GAAG,cAAc,CAAC;AACpC,EAAE,cAAc,GAAG,IAAI,CAAC;AACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;AACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;AACxB,EAAE;AACF,CAAC;AACD;AACO,SAAS,YAAY,CAAC,SAAS,EAAE;AACxC,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE;AACtB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK;AACzC,GAAG,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;AAC9D,EAAE,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI;AACvC,GAAG,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;AACrF,EAAE,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AAC5C,EAAE,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAChC,EAAE;AACF,CAACC,cAAkB,CAAC,SAAS,CAAC,CAAC;AAC/B,CAAC;AACD,SAAS,iBAAiB,CAAC,UAAU,EAAE,KAAK,EAAE;AAC9C,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,kBAAkB,KAAK;AACnD,EAAE,IAAI,UAAU,GAAG,CAAC,kBAAkB,KAAK,CAAC,KAAK,CAAC,yBAAyB,IAAI,CAAC,MAAM,kBAAkB,CAAC,MAAM,CAAC,CAAC;AACjH,EAAE,IAAI,CAAC,UAAU;AACjB,GAAG,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;AAC9C,EAAE,OAAO,UAAU,CAAC;AACpB,EAAE,CAAC;AACH,CAAC,OAAO,UAAU,CAAC;AACnB,CAAC;AACD;AACA;AACA;AACA;AACA,KAAK,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACnC;AACA,IAAI,YAAY,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AACxC,MAAC,IAAI,GAAG,YAAY,CAAC,KAAK;AAC1B,MAAC,MAAM,GAAG,YAAY,CAAC,KAAK;AAC5B,MAAC,OAAO,GAAG,MAAM;AAGjB,MAAC,EAAE,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,GAAG,gBAAgB;AACjE,MAAC,iBAAiB,GAAG,IAAI;AACzB,MAAC,iBAAiB,GAAG,KAAK;AAC1B,MAAC,mBAAmB,GAAG;;AChnC5B,MAAM,WAAW,SAASC,gBAAS,CAAC;AAC3C,CAAC,WAAW,CAAC,OAAO,EAAE;AACtB,EAAE,IAAI,CAAC,OAAO;AACd,GAAG,OAAO,GAAG,EAAE,CAAC;AAChB,EAAE,OAAO,CAAC,kBAAkB,GAAG,IAAI,CAAC;AACpC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;AACjB,EAAE,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;AAC5B,EAAE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AACnD,EAAE;AACF,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE;AACvC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACpC,EAAE,QAAQ,EAAE,CAAC;AACb,EAAE;AACF,CAAC;AACD;AACO,MAAM,aAAa,SAASA,gBAAS,CAAC;AAC7C,CAAC,WAAW,CAAC,OAAO,EAAE;AACtB,EAAE,IAAI,CAAC,OAAO;AACd,GAAG,OAAO,GAAG,EAAE,CAAC;AAChB,EAAE,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;AAC5B,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;AACjB,EAAE,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;AAC1B,EAAE,IAAI,CAAC,uBAAuB,GAAG,OAAO,CAAC,uBAAuB,KAAK,SAAS,GAAG,OAAO,CAAC,uBAAuB,GAAG,SAAS,CAAC;AAC7H,EAAE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;AACzD,EAAE;AACF,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE;AACvC,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE;AAC7B,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC,CAAC;AACzD,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;AAChC,GAAG;AACH,EAAE,IAAI,MAAM,CAAC;AACb,EAAE,IAAI;AACN,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;AAC/C,GAAG,CAAC,MAAM,KAAK,EAAE;AACjB,GAAG,IAAI,KAAK,CAAC,UAAU,EAAE;AACzB,IAAI,IAAI,gBAAgB,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;AAC3D,IAAI,IAAI,gBAAgB,CAAC,MAAM,GAAG,IAAI,CAAC,uBAAuB,EAAE;AAChE,KAAK,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;AAClC,KAAK,OAAO,QAAQ,CAAC,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC,CAAC;AAC3E,KAAK;AACL,IAAI,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;AAC7C,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;AAC1B,IAAI,MAAM;AACV,IAAI,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;AAC3B,IAAI;AACJ,GAAG;AACH,EAAE,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,EAAE,EAAE;AAClC,GAAG,IAAI,KAAK,KAAK,IAAI;AACrB,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;AAChC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACpB,GAAG;AACH,EAAE,QAAQ,EAAE,CAAC;AACb,EAAE;AACF,CAAC,YAAY,GAAG;AAChB,EAAE,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC1B,EAAE;AACF;;AC1DA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,QAAQ,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;AACxD,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;AAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,wFAAwF,CAAC,CAAC;AAC9G,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;AACpE,IAAI,OAAO,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;AACjD,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;AACtH,IAAI,OAAO,aAAa,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;AAClD,GAAG,MAAM;AACT,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;AAClH,GAAG;AACH,CAAC;AACD;AACA,WAAW,YAAY,EAAE,cAAc,EAAE,OAAO,EAAE;AAClD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AACnC,EAAE,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;AACtC,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5B,GAAG;AACH,CAAC;AACD;AACA,iBAAiB,aAAa,EAAE,cAAc,EAAE,OAAO,EAAE;AACzD,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AACnC,EAAE,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;AAC5C,IAAI,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5B,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,UAAU,EAAE,cAAc,EAAE,OAAO,GAAG,EAAE,EAAE;AAC1D,EAAE,IAAI,CAAC,cAAc,IAAI,OAAO,cAAc,KAAK,QAAQ,EAAE;AAC7D,IAAI,MAAM,IAAI,KAAK,CAAC,4FAA4F,CAAC,CAAC;AAClH,GAAG;AACH;AACA,EAAE,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;AACvC,EAAE,IAAI,UAAU,CAAC;AACjB,EAAE,MAAM,MAAM,GAAG,CAAC,KAAK,KAAK;AAC5B,IAAI,IAAI,MAAM,CAAC;AACf;AACA,IAAI,IAAI,UAAU,EAAE;AACpB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;AACjD,MAAM,UAAU,GAAG,SAAS,CAAC;AAC7B,KAAK;AACL;AACA,IAAI,IAAI;AACR,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;AAC7C,KAAK,CAAC,OAAO,GAAG,EAAE;AAClB,MAAM,IAAI,GAAG,CAAC,UAAU,EAAE;AAC1B,QAAQ,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AACnD,QAAQ,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;AAC5B,OAAO,MAAM;AACb,QAAQ,MAAM,GAAG,CAAC;AAClB,OAAO;AACP,KAAK;AACL,IAAI,OAAO,MAAM,CAAC;AAClB,GAAG,CAAC;AACJ;AACA,EAAE,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE;AAC7D,IAAI,OAAO,CAAC,WAAW,IAAI,IAAI;AAC/B,MAAM,KAAK,MAAM,KAAK,IAAI,cAAc,EAAE;AAC1C,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,OAAO;AACP,KAAK,GAAG,CAAC;AACT,GAAG,MAAM,IAAI,OAAO,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,UAAU,EAAE;AACzE,IAAI,OAAO,CAAC,iBAAiB,IAAI,IAAI;AACrC,MAAM,WAAW,MAAM,KAAK,IAAI,cAAc,EAAE;AAChD,QAAQ,QAAQ,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,OAAO;AACP,KAAK,GAAG,CAAC;AACT,GAAG;AACH,CAAC;AACW,MAAC,UAAU,GAAG,WAAW;AACzB,MAAC,UAAU,GAAG;;AClFd,MAAC,UAAU,GAAG,MAAM;AACpB,MAAC,aAAa,GAAG,KAAK;AAGlC;AACA,MAAM,0BAA0B,GAAG,OAAO,CAAC,GAAG,CAAC,qCAAqC,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC;AACjL;AACA,IAAI,CAAC,0BAA0B,EAAE;AACjC,CAAC,IAAI,SAAS,CAAC;AACf,CAAC,IAAI;AACL,EAAE,IAAI,OAAO,OAAO,IAAI,UAAU;AAClC,GAAG,SAAS,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;AAC3C;AACA,GAAG,SAAS,GAAGC,sBAAa,CAAC,mMAAe,CAAC,CAAC,kBAAkB,CAAC,CAAC;AAClE,EAAE,IAAI,SAAS;AACf,GAAG,YAAY,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;AAC1C,EAAE,CAAC,OAAO,KAAK,EAAE;AACjB;AACA,EAAE;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/test.js b/node_modules/msgpackr/dist/test.js
new file mode 100644
index 0000000..c17be4b
--- /dev/null
+++ b/node_modules/msgpackr/dist/test.js
@@ -0,0 +1,3725 @@
+(function (chai, stream, module, fs) {
+	'use strict';
+
+	var decoder;
+	try {
+		decoder = new TextDecoder();
+	} catch(error) {}
+	var src;
+	var srcEnd;
+	var position$1 = 0;
+	const EMPTY_ARRAY = [];
+	var strings = EMPTY_ARRAY;
+	var stringPosition = 0;
+	var currentUnpackr = {};
+	var currentStructures;
+	var srcString;
+	var srcStringStart = 0;
+	var srcStringEnd = 0;
+	var bundledStrings$1;
+	var referenceMap;
+	var currentExtensions = [];
+	var dataView;
+	var defaultOptions = {
+		useRecords: false,
+		mapsAsObjects: true
+	};
+	class C1Type {}
+	const C1 = new C1Type();
+	C1.name = 'MessagePack 0xC1';
+	var sequentialMode = false;
+	var inlineObjectReadThreshold = 2;
+
+	let Unpackr$1 = class Unpackr {
+		constructor(options) {
+			if (options) {
+				if (options.useRecords === false && options.mapsAsObjects === undefined)
+					options.mapsAsObjects = true;
+				if (options.sequential && options.trusted !== false) {
+					options.trusted = true;
+					if (!options.structures && options.useRecords != false) {
+						options.structures = [];
+						if (!options.maxSharedStructures)
+							options.maxSharedStructures = 0;
+					}
+				}
+				if (options.structures)
+					options.structures.sharedLength = options.structures.length;
+				else if (options.getStructures) {
+					(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+					options.structures.sharedLength = 0;
+				}
+				if (options.int64AsNumber) {
+					options.int64AsType = 'number';
+				}
+			}
+			Object.assign(this, options);
+		}
+		unpack(source, options) {
+			if (src) {
+				// re-entrant execution, save the state and restore it after we do this unpack
+				return saveState(() => {
+					clearSource();
+					return this ? this.unpack(source, options) : Unpackr$1.prototype.unpack.call(defaultOptions, source, options);
+				});
+			}
+			if (!source.buffer && source.constructor === ArrayBuffer)
+				source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+			if (typeof options === 'object') {
+				srcEnd = options.end || source.length;
+				position$1 = options.start || 0;
+			} else {
+				position$1 = 0;
+				srcEnd = options > -1 ? options : source.length;
+			}
+			stringPosition = 0;
+			srcStringEnd = 0;
+			srcString = null;
+			strings = EMPTY_ARRAY;
+			bundledStrings$1 = null;
+			src = source;
+			// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+			// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+			// new ones
+			try {
+				dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+			} catch(error) {
+				// if it doesn't have a buffer, maybe it is the wrong type of object
+				src = null;
+				if (source instanceof Uint8Array)
+					throw error;
+				throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+			}
+			if (this instanceof Unpackr$1) {
+				currentUnpackr = this;
+				if (this.structures) {
+					currentStructures = this.structures;
+					return checkedRead(options);
+				} else if (!currentStructures || currentStructures.length > 0) {
+					currentStructures = [];
+				}
+			} else {
+				currentUnpackr = defaultOptions;
+				if (!currentStructures || currentStructures.length > 0)
+					currentStructures = [];
+			}
+			return checkedRead(options);
+		}
+		unpackMultiple(source, forEach) {
+			let values, lastPosition = 0;
+			try {
+				sequentialMode = true;
+				let size = source.length;
+				let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+				if (forEach) {
+					if (forEach(value, lastPosition, position$1) === false) return;
+					while(position$1 < size) {
+						lastPosition = position$1;
+						if (forEach(checkedRead(), lastPosition, position$1) === false) {
+							return;
+						}
+					}
+				}
+				else {
+					values = [ value ];
+					while(position$1 < size) {
+						lastPosition = position$1;
+						values.push(checkedRead());
+					}
+					return values;
+				}
+			} catch(error) {
+				error.lastPosition = lastPosition;
+				error.values = values;
+				throw error;
+			} finally {
+				sequentialMode = false;
+				clearSource();
+			}
+		}
+		_mergeStructures(loadedStructures, existingStructures) {
+			if (this._onLoadedStructures)
+				loadedStructures = this._onLoadedStructures(loadedStructures);
+			loadedStructures = loadedStructures || [];
+			if (Object.isFrozen(loadedStructures))
+				loadedStructures = loadedStructures.map(structure => structure.slice(0));
+			for (let i = 0, l = loadedStructures.length; i < l; i++) {
+				let structure = loadedStructures[i];
+				if (structure) {
+					structure.isShared = true;
+					if (i >= 32)
+						structure.highByte = (i - 32) >> 5;
+				}
+			}
+			loadedStructures.sharedLength = loadedStructures.length;
+			for (let id in existingStructures || []) {
+				if (id >= 0) {
+					let structure = loadedStructures[id];
+					let existing = existingStructures[id];
+					if (existing) {
+						if (structure)
+							(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+						loadedStructures[id] = existing;
+					}
+				}
+			}
+			return this.structures = loadedStructures;
+		}
+		decode(source, options) {
+			return this.unpack(source, options);
+		}
+	};
+	function checkedRead(options) {
+		try {
+			if (!currentUnpackr.trusted && !sequentialMode) {
+				let sharedLength = currentStructures.sharedLength || 0;
+				if (sharedLength < currentStructures.length)
+					currentStructures.length = sharedLength;
+			}
+			let result;
+			if (currentUnpackr._readStruct && src[position$1] < 0x40 && src[position$1] >= 0x20) {
+				result = currentUnpackr._readStruct(src, position$1, srcEnd);
+				src = null; // dispose of this so that recursive unpack calls don't save state
+				if (!(options && options.lazy) && result)
+					result = result.toJSON();
+				position$1 = srcEnd;
+			} else
+				result = read();
+			if (bundledStrings$1) { // bundled strings to skip past
+				position$1 = bundledStrings$1.postBundlePosition;
+				bundledStrings$1 = null;
+			}
+			if (sequentialMode)
+				// we only need to restore the structures if there was an error, but if we completed a read,
+				// we can clear this out and keep the structures we read
+				currentStructures.restoreStructures = null;
+
+			if (position$1 == srcEnd) {
+				// finished reading this source, cleanup references
+				if (currentStructures && currentStructures.restoreStructures)
+					restoreStructures();
+				currentStructures = null;
+				src = null;
+				if (referenceMap)
+					referenceMap = null;
+			} else if (position$1 > srcEnd) {
+				// over read
+				throw new Error('Unexpected end of MessagePack data');
+			} else if (!sequentialMode) {
+				let jsonView;
+				try {
+					jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+				} catch(error) {
+					jsonView = '(JSON view not available ' + error + ')';
+				}
+				throw new Error('Data read, but end of buffer not reached ' + jsonView);
+			}
+			// else more to read, but we are reading sequentially, so don't clear source yet
+			return result;
+		} catch(error) {
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			clearSource();
+			if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position$1 > srcEnd) {
+				error.incomplete = true;
+			}
+			throw error;
+		}
+	}
+
+	function restoreStructures() {
+		for (let id in currentStructures.restoreStructures) {
+			currentStructures[id] = currentStructures.restoreStructures[id];
+		}
+		currentStructures.restoreStructures = null;
+	}
+
+	function read() {
+		let token = src[position$1++];
+		if (token < 0xa0) {
+			if (token < 0x80) {
+				if (token < 0x40)
+					return token;
+				else {
+					let structure = currentStructures[token & 0x3f] ||
+						currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+					if (structure) {
+						if (!structure.read) {
+							structure.read = createStructureReader(structure, token & 0x3f);
+						}
+						return structure.read();
+					} else
+						return token;
+				}
+			} else if (token < 0x90) {
+				// map
+				token -= 0x80;
+				if (currentUnpackr.mapsAsObjects) {
+					let object = {};
+					for (let i = 0; i < token; i++) {
+						let key = readKey();
+						if (key === '__proto__')
+							key = '__proto_';
+						object[key] = read();
+					}
+					return object;
+				} else {
+					let map = new Map();
+					for (let i = 0; i < token; i++) {
+						map.set(read(), read());
+					}
+					return map;
+				}
+			} else {
+				token -= 0x90;
+				let array = new Array(token);
+				for (let i = 0; i < token; i++) {
+					array[i] = read();
+				}
+				if (currentUnpackr.freezeData)
+					return Object.freeze(array);
+				return array;
+			}
+		} else if (token < 0xc0) {
+			// fixstr
+			let length = token - 0xa0;
+			if (srcStringEnd >= position$1) {
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			}
+			if (srcStringEnd == 0 && srcEnd < 140) {
+				// for small blocks, avoiding the overhead of the extract call is helpful
+				let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+				if (string != null)
+					return string;
+			}
+			return readFixedString(length);
+		} else {
+			let value;
+			switch (token) {
+				case 0xc0: return null;
+				case 0xc1:
+					if (bundledStrings$1) {
+						value = read(); // followed by the length of the string in characters (not bytes!)
+						if (value > 0)
+							return bundledStrings$1[1].slice(bundledStrings$1.position1, bundledStrings$1.position1 += value);
+						else
+							return bundledStrings$1[0].slice(bundledStrings$1.position0, bundledStrings$1.position0 -= value);
+					}
+					return C1; // "never-used", return special object to denote that
+				case 0xc2: return false;
+				case 0xc3: return true;
+				case 0xc4:
+					// bin 8
+					value = src[position$1++];
+					if (value === undefined)
+						throw new Error('Unexpected end of buffer');
+					return readBin(value);
+				case 0xc5:
+					// bin 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readBin(value);
+				case 0xc6:
+					// bin 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readBin(value);
+				case 0xc7:
+					// ext 8
+					return readExt(src[position$1++]);
+				case 0xc8:
+					// ext 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readExt(value);
+				case 0xc9:
+					// ext 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readExt(value);
+				case 0xca:
+					value = dataView.getFloat32(position$1);
+					if (currentUnpackr.useFloat32 > 2) {
+						// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+						let multiplier = mult10[((src[position$1] & 0x7f) << 1) | (src[position$1 + 1] >> 7)];
+						position$1 += 4;
+						return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+					}
+					position$1 += 4;
+					return value;
+				case 0xcb:
+					value = dataView.getFloat64(position$1);
+					position$1 += 8;
+					return value;
+				// uint handlers
+				case 0xcc:
+					return src[position$1++];
+				case 0xcd:
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xce:
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xcf:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getUint32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigUint64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigUint64(position$1);
+						if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigUint64(position$1);
+					position$1 += 8;
+					return value;
+
+				// int handlers
+				case 0xd0:
+					return dataView.getInt8(position$1++);
+				case 0xd1:
+					value = dataView.getInt16(position$1);
+					position$1 += 2;
+					return value;
+				case 0xd2:
+					value = dataView.getInt32(position$1);
+					position$1 += 4;
+					return value;
+				case 0xd3:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getInt32(position$1) * 0x100000000;
+						value += dataView.getUint32(position$1 + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigInt64(position$1).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigInt64(position$1);
+						if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigInt64(position$1);
+					position$1 += 8;
+					return value;
+
+				case 0xd4:
+					// fixext 1
+					value = src[position$1++];
+					if (value == 0x72) {
+						return recordDefinition(src[position$1++] & 0x3f);
+					} else {
+						let extension = currentExtensions[value];
+						if (extension) {
+							if (extension.read) {
+								position$1++; // skip filler byte
+								return extension.read(read());
+							} else if (extension.noBuffer) {
+								position$1++; // skip filler byte
+								return extension();
+							} else
+								return extension(src.subarray(position$1, ++position$1));
+						} else
+							throw new Error('Unknown extension ' + value);
+					}
+				case 0xd5:
+					// fixext 2
+					value = src[position$1];
+					if (value == 0x72) {
+						position$1++;
+						return recordDefinition(src[position$1++] & 0x3f, src[position$1++]);
+					} else
+						return readExt(2);
+				case 0xd6:
+					// fixext 4
+					return readExt(4);
+				case 0xd7:
+					// fixext 8
+					return readExt(8);
+				case 0xd8:
+					// fixext 16
+					return readExt(16);
+				case 0xd9:
+				// str 8
+					value = src[position$1++];
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString8(value);
+				case 0xda:
+				// str 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString16(value);
+				case 0xdb:
+				// str 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					if (srcStringEnd >= position$1) {
+						return srcString.slice(position$1 - srcStringStart, (position$1 += value) - srcStringStart);
+					}
+					return readString32(value);
+				case 0xdc:
+				// array 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readArray(value);
+				case 0xdd:
+				// array 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readArray(value);
+				case 0xde:
+				// map 16
+					value = dataView.getUint16(position$1);
+					position$1 += 2;
+					return readMap(value);
+				case 0xdf:
+				// map 32
+					value = dataView.getUint32(position$1);
+					position$1 += 4;
+					return readMap(value);
+				default: // negative int
+					if (token >= 0xe0)
+						return token - 0x100;
+					if (token === undefined) {
+						let error = new Error('Unexpected end of MessagePack data');
+						error.incomplete = true;
+						throw error;
+					}
+					throw new Error('Unknown MessagePack token ' + token);
+
+			}
+		}
+	}
+	const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+	function createStructureReader(structure, firstId) {
+		function readObject() {
+			// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+			if (readObject.count++ > inlineObjectReadThreshold) {
+				let optimizedReadObject;
+				try {
+					optimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+						'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+				} catch(error) {
+					// in CF workers, the new Function call could begin to fail at any point in time
+					inlineObjectReadThreshold = Infinity; // disable going forward
+					return readObject(); // recursively try again
+				}
+				if (structure.highByte === 0)
+					structure.read = createSecondByteReader(firstId, structure.read);
+				return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+			}
+			let object = {};
+			for (let i = 0, l = structure.length; i < l; i++) {
+				let key = structure[i];
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(object);
+			return object;
+		}
+		readObject.count = 0;
+		if (structure.highByte === 0) {
+			return createSecondByteReader(firstId, readObject);
+		}
+		return readObject;
+	}
+
+	const createSecondByteReader = (firstId, read0) => {
+		return function() {
+			let highByte = src[position$1++];
+			if (highByte === 0)
+				return read0();
+			let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+			let structure = currentStructures[id] || loadStructures()[id];
+			if (!structure) {
+				throw new Error('Record id is not defined for ' + id);
+			}
+			if (!structure.read)
+				structure.read = createStructureReader(structure, firstId);
+			return structure.read();
+		};
+	};
+
+	function loadStructures() {
+		let loadedStructures = saveState(() => {
+			// save the state in case getStructures modifies our buffer
+			src = null;
+			return currentUnpackr.getStructures();
+		});
+		return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+	}
+
+	var readFixedString = readStringJS;
+	var readString8 = readStringJS;
+	var readString16 = readStringJS;
+	var readString32 = readStringJS;
+
+	function setExtractor(extractStrings) {
+		readFixedString = readString(1);
+		readString8 = readString(2);
+		readString16 = readString(3);
+		readString32 = readString(5);
+		function readString(headerLength) {
+			return function readString(length) {
+				let string = strings[stringPosition++];
+				if (string == null) {
+					if (bundledStrings$1)
+						return readStringJS(length);
+					let byteOffset = src.byteOffset;
+					let extraction = extractStrings(position$1 - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);
+					if (typeof extraction == 'string') {
+						string = extraction;
+						strings = EMPTY_ARRAY;
+					} else {
+						strings = extraction;
+						stringPosition = 1;
+						srcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings
+						string = strings[0];
+						if (string === undefined)
+							throw new Error('Unexpected end of buffer');
+					}
+				}
+				let srcStringLength = string.length;
+				if (srcStringLength <= length) {
+					position$1 += length;
+					return string;
+				}
+				srcString = string;
+				srcStringStart = position$1;
+				srcStringEnd = position$1 + srcStringLength;
+				position$1 += length;
+				return string.slice(0, length); // we know we just want the beginning
+			};
+		}
+	}
+	function readStringJS(length) {
+		let result;
+		if (length < 16) {
+			if (result = shortStringInJS(length))
+				return result;
+		}
+		if (length > 64 && decoder)
+			return decoder.decode(src.subarray(position$1, position$1 += length));
+		const end = position$1 + length;
+		const units = [];
+		result = '';
+		while (position$1 < end) {
+			const byte1 = src[position$1++];
+			if ((byte1 & 0x80) === 0) {
+				// 1 byte
+				units.push(byte1);
+			} else if ((byte1 & 0xe0) === 0xc0) {
+				// 2 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+				// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+				if (codePoint < 0x80) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf0) === 0xe0) {
+				// 3 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+				// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+				// Also reject surrogates (0xD800-0xDFFF)
+				if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf8) === 0xf0) {
+				// 4 bytes
+				const byte2 = src[position$1++] & 0x3f;
+				const byte3 = src[position$1++] & 0x3f;
+				const byte4 = src[position$1++] & 0x3f;
+				let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+				// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+				// Also reject values > 0x10FFFF (maximum valid Unicode)
+				if (unit < 0x10000 || unit > 0x10FFFF) {
+					units.push(0xFFFD); // replacement character
+				} else if (unit > 0xffff) {
+					unit -= 0x10000;
+					units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+					unit = 0xdc00 | (unit & 0x3ff);
+					units.push(unit);
+				} else {
+					units.push(unit);
+				}
+			} else {
+				units.push(0xFFFD); // replacement character for invalid lead byte
+			}
+
+			if (units.length >= 0x1000) {
+				result += fromCharCode.apply(String, units);
+				units.length = 0;
+			}
+		}
+
+		if (units.length > 0) {
+			result += fromCharCode.apply(String, units);
+		}
+
+		return result;
+	}
+
+	function readArray(length) {
+		let array = new Array(length);
+		for (let i = 0; i < length; i++) {
+			array[i] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(array);
+		return array;
+	}
+
+	function readMap(length) {
+		if (currentUnpackr.mapsAsObjects) {
+			let object = {};
+			for (let i = 0; i < length; i++) {
+				let key = readKey();
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			return object;
+		} else {
+			let map = new Map();
+			for (let i = 0; i < length; i++) {
+				map.set(read(), read());
+			}
+			return map;
+		}
+	}
+
+	var fromCharCode = String.fromCharCode;
+	function longStringInJS(length) {
+		let start = position$1;
+		let bytes = new Array(length);
+		for (let i = 0; i < length; i++) {
+			const byte = src[position$1++];
+			if ((byte & 0x80) > 0) {
+					position$1 = start;
+					return;
+				}
+				bytes[i] = byte;
+			}
+			return fromCharCode.apply(String, bytes);
+	}
+	function shortStringInJS(length) {
+		if (length < 4) {
+			if (length < 2) {
+				if (length === 0)
+					return '';
+				else {
+					let a = src[position$1++];
+					if ((a & 0x80) > 1) {
+						position$1 -= 1;
+						return;
+					}
+					return fromCharCode(a);
+				}
+			} else {
+				let a = src[position$1++];
+				let b = src[position$1++];
+				if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+					position$1 -= 2;
+					return;
+				}
+				if (length < 3)
+					return fromCharCode(a, b);
+				let c = src[position$1++];
+				if ((c & 0x80) > 0) {
+					position$1 -= 3;
+					return;
+				}
+				return fromCharCode(a, b, c);
+			}
+		} else {
+			let a = src[position$1++];
+			let b = src[position$1++];
+			let c = src[position$1++];
+			let d = src[position$1++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+				position$1 -= 4;
+				return;
+			}
+			if (length < 6) {
+				if (length === 4)
+					return fromCharCode(a, b, c, d);
+				else {
+					let e = src[position$1++];
+					if ((e & 0x80) > 0) {
+						position$1 -= 5;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e);
+				}
+			} else if (length < 8) {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+					position$1 -= 6;
+					return;
+				}
+				if (length < 7)
+					return fromCharCode(a, b, c, d, e, f);
+				let g = src[position$1++];
+				if ((g & 0x80) > 0) {
+					position$1 -= 7;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g);
+			} else {
+				let e = src[position$1++];
+				let f = src[position$1++];
+				let g = src[position$1++];
+				let h = src[position$1++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+					position$1 -= 8;
+					return;
+				}
+				if (length < 10) {
+					if (length === 8)
+						return fromCharCode(a, b, c, d, e, f, g, h);
+					else {
+						let i = src[position$1++];
+						if ((i & 0x80) > 0) {
+							position$1 -= 9;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i);
+					}
+				} else if (length < 12) {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+						position$1 -= 10;
+						return;
+					}
+					if (length < 11)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+					let k = src[position$1++];
+					if ((k & 0x80) > 0) {
+						position$1 -= 11;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+				} else {
+					let i = src[position$1++];
+					let j = src[position$1++];
+					let k = src[position$1++];
+					let l = src[position$1++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+						position$1 -= 12;
+						return;
+					}
+					if (length < 14) {
+						if (length === 12)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+						else {
+							let m = src[position$1++];
+							if ((m & 0x80) > 0) {
+								position$1 -= 13;
+								return;
+							}
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+						}
+					} else {
+						let m = src[position$1++];
+						let n = src[position$1++];
+						if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+							position$1 -= 14;
+							return;
+						}
+						if (length < 15)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+						let o = src[position$1++];
+						if ((o & 0x80) > 0) {
+							position$1 -= 15;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+					}
+				}
+			}
+		}
+	}
+
+	function readOnlyJSString() {
+		let token = src[position$1++];
+		let length;
+		if (token < 0xc0) {
+			// fixstr
+			length = token - 0xa0;
+		} else {
+			switch(token) {
+				case 0xd9:
+				// str 8
+					length = src[position$1++];
+					break;
+				case 0xda:
+				// str 16
+					length = dataView.getUint16(position$1);
+					position$1 += 2;
+					break;
+				case 0xdb:
+				// str 32
+					length = dataView.getUint32(position$1);
+					position$1 += 4;
+					break;
+				default:
+					throw new Error('Expected string');
+			}
+		}
+		return readStringJS(length);
+	}
+
+
+	function readBin(length) {
+		return currentUnpackr.copyBuffers ?
+			// specifically use the copying slice (not the node one)
+			Uint8Array.prototype.slice.call(src, position$1, position$1 += length) :
+			src.subarray(position$1, position$1 += length);
+	}
+	function readExt(length) {
+		let type = src[position$1++];
+		if (currentExtensions[type]) {
+			let end;
+			return currentExtensions[type](src.subarray(position$1, end = (position$1 += length)), (readPosition) => {
+				position$1 = readPosition;
+				try {
+					return read();
+				} finally {
+					position$1 = end;
+				}
+			});
+		}
+		else
+			throw new Error('Unknown extension type ' + type);
+	}
+
+	var keyCache = new Array(4096);
+	function readKey() {
+		let length = src[position$1++];
+		if (length >= 0xa0 && length < 0xc0) {
+			// fixstr, potentially use key cache
+			length = length - 0xa0;
+			if (srcStringEnd >= position$1) // if it has been extracted, must use it (and faster anyway)
+				return srcString.slice(position$1 - srcStringStart, (position$1 += length) - srcStringStart);
+			else if (!(srcStringEnd == 0 && srcEnd < 180))
+				return readFixedString(length);
+		} else { // not cacheable, go back and do a standard read
+			position$1--;
+			return asSafeString(read());
+		}
+		let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position$1) : length > 0 ? src[position$1] : 0)) & 0xfff;
+		let entry = keyCache[key];
+		let checkPosition = position$1;
+		let end = position$1 + length - 3;
+		let chunk;
+		let i = 0;
+		if (entry && entry.bytes == length) {
+			while (checkPosition < end) {
+				chunk = dataView.getUint32(checkPosition);
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+				checkPosition += 4;
+			}
+			end += 3;
+			while (checkPosition < end) {
+				chunk = src[checkPosition++];
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+			}
+			if (checkPosition === end) {
+				position$1 = checkPosition;
+				return entry.string;
+			}
+			end -= 3;
+			checkPosition = position$1;
+		}
+		entry = [];
+		keyCache[key] = entry;
+		entry.bytes = length;
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			entry.push(chunk);
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			entry.push(chunk);
+		}
+		// for small blocks, avoiding the overhead of the extract call is helpful
+		let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+		if (string != null)
+			return entry.string = string;
+		return entry.string = readFixedString(length);
+	}
+
+	function asSafeString(property) {
+		// protect against expensive (DoS) string conversions
+		if (typeof property === 'string') return property;
+		if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+		if (property == null) return property + '';
+		if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+			return property.flat().toString();
+		}
+		throw new Error(`Invalid property type for record: ${typeof property}`);
+	}
+	// the registration of the record definition extension (as "r")
+	const recordDefinition = (id, highByte) => {
+		let structure = read().map(asSafeString); // ensure that all keys are strings and
+		// that the array is mutable
+		let firstByte = id;
+		if (highByte !== undefined) {
+			id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+			structure.highByte = highByte;
+		}
+		let existingStructure = currentStructures[id];
+		// If it is a shared structure, we need to restore any changes after reading.
+		// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+		// to the state prior to an incomplete read in order to properly resume.
+		if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+			(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+		}
+		currentStructures[id] = structure;
+		structure.read = createStructureReader(structure, firstByte);
+		return structure.read();
+	};
+	currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+	currentExtensions[0].noBuffer = true;
+
+	currentExtensions[0x42] = data => {
+		let headLength = (data.byteLength % 8) || 8;
+		let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+		for (let i = 1; i < headLength; i++) {
+			head <<= BigInt(8);
+			head += BigInt(data[i]);
+		}
+		if (data.byteLength !== headLength) {
+			let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+			let decode = (start, end) => {
+				let length = end - start;
+				if (length <= 40) {
+					let out = view.getBigUint64(start);
+					for (let i = start + 8; i < end; i += 8) {
+						out <<= BigInt(64);
+						out |= view.getBigUint64(i);
+					}
+					return out;
+				}
+				// if (length === 8) return view.getBigUint64(start)
+				let middle = start + (length >> 4 << 3);
+				let left = decode(start, middle);
+				let right = decode(middle, end);
+				return (left << BigInt((end - middle) * 8)) | right;
+			};
+			head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+		}
+		return head;
+	};
+
+	let errors = {
+		Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+	};
+	currentExtensions[0x65] = () => {
+		let data = read();
+		if (!errors[data[0]]) {
+			let error = Error(data[1], { cause: data[2] });
+			error.name = data[0];
+			return error;
+		}
+		return errors[data[0]](data[1], { cause: data[2] });
+	};
+
+	currentExtensions[0x69] = (data) => {
+		// id extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		if (!referenceMap)
+			referenceMap = new Map();
+		let token = src[position$1];
+		let target;
+		// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+		if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+			target = [];
+		else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+			target = new Map();
+		else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position$1 + 1] === 0x73)
+			target = new Set();
+		else
+			target = {};
+
+		let refEntry = { target }; // a placeholder object
+		referenceMap.set(id, refEntry);
+		let targetProperties = read(); // read the next value as the target object to id
+		if (!refEntry.used) {
+			// no cycle, can just use the returned read object
+			return refEntry.target = targetProperties; // replace the placeholder with the real one
+		} else {
+			// there is a cycle, so we have to assign properties to original target
+			Object.assign(target, targetProperties);
+		}
+
+		// copy over map/set entries if we're able to
+		if (target instanceof Map)
+			for (let [k, v] of targetProperties.entries()) target.set(k, v);
+		if (target instanceof Set)
+			for (let i of Array.from(targetProperties)) target.add(i);
+		return target;
+	};
+
+	currentExtensions[0x70] = (data) => {
+		// pointer extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position$1 - 4);
+		let refEntry = referenceMap.get(id);
+		refEntry.used = true;
+		return refEntry.target;
+	};
+
+	currentExtensions[0x73] = () => new Set(read());
+
+	const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+	let glbl = typeof globalThis === 'object' ? globalThis : window;
+	currentExtensions[0x74] = (data) => {
+		let typeCode = data[0];
+		// we always have to slice to get a new ArrayBuffer that is aligned
+		let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+		let typedArrayName = typedArrays[typeCode];
+		if (!typedArrayName) {
+			if (typeCode === 16) return buffer;
+			if (typeCode === 17) return new DataView(buffer);
+			throw new Error('Could not find typed array for code ' + typeCode);
+		}
+		return new glbl[typedArrayName](buffer);
+	};
+	currentExtensions[0x78] = () => {
+		let data = read();
+		return new RegExp(data[0], data[1]);
+	};
+	const TEMP_BUNDLE = [];
+	currentExtensions[0x62] = (data) => {
+		let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+		let dataPosition = position$1;
+		position$1 += dataSize - data.length;
+		bundledStrings$1 = TEMP_BUNDLE;
+		bundledStrings$1 = [readOnlyJSString(), readOnlyJSString()];
+		bundledStrings$1.position0 = 0;
+		bundledStrings$1.position1 = 0;
+		bundledStrings$1.postBundlePosition = position$1;
+		position$1 = dataPosition;
+		return read();
+	};
+
+	currentExtensions[0xff] = (data) => {
+		// 32-bit date extension
+		if (data.length == 4)
+			return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+		else if (data.length == 8)
+			return new Date(
+				((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+				((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+		else if (data.length == 12)
+			return new Date(
+				((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+				(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+		else
+			return new Date('invalid');
+	};
+	// registration of bulk record definition?
+	// currentExtensions[0x52] = () =>
+
+	function saveState(callback) {
+		if (currentUnpackr && currentUnpackr._onSaveState)
+			currentUnpackr._onSaveState();
+		let savedSrcEnd = srcEnd;
+		let savedPosition = position$1;
+		let savedStringPosition = stringPosition;
+		let savedSrcStringStart = srcStringStart;
+		let savedSrcStringEnd = srcStringEnd;
+		let savedSrcString = srcString;
+		let savedStrings = strings;
+		let savedReferenceMap = referenceMap;
+		let savedBundledStrings = bundledStrings$1;
+
+		// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+		let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+		let savedStructures = currentStructures;
+		let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+		let savedPackr = currentUnpackr;
+		let savedSequentialMode = sequentialMode;
+		let value = callback();
+		srcEnd = savedSrcEnd;
+		position$1 = savedPosition;
+		stringPosition = savedStringPosition;
+		srcStringStart = savedSrcStringStart;
+		srcStringEnd = savedSrcStringEnd;
+		srcString = savedSrcString;
+		strings = savedStrings;
+		referenceMap = savedReferenceMap;
+		bundledStrings$1 = savedBundledStrings;
+		src = savedSrc;
+		sequentialMode = savedSequentialMode;
+		currentStructures = savedStructures;
+		currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+		currentUnpackr = savedPackr;
+		dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+		return value;
+	}
+	function clearSource() {
+		src = null;
+		referenceMap = null;
+		currentStructures = null;
+	}
+
+	function addExtension$2(extension) {
+		if (extension.unpack)
+			currentExtensions[extension.type] = extension.unpack;
+		else
+			currentExtensions[extension.type] = extension;
+	}
+
+	const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+	for (let i = 0; i < 256; i++) {
+		mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+	}
+	var defaultUnpackr = new Unpackr$1({ useRecords: false });
+	const unpack$1 = defaultUnpackr.unpack;
+	const unpackMultiple$1 = defaultUnpackr.unpackMultiple;
+	defaultUnpackr.unpack;
+	const FLOAT32_OPTIONS = {
+		NEVER: 0,
+		ALWAYS: 1,
+		DECIMAL_ROUND: 3,
+		DECIMAL_FIT: 4
+	};
+	let f32Array = new Float32Array(1);
+	let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+	function roundFloat32$1(float32Number) {
+		f32Array[0] = float32Number;
+		let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+		return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+	}
+	// Marker for downstream libraries (e.g. structon) to detect per-instance
+	// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+	// this._onSaveState).  See `checkedRead` for the dispatch.
+	Unpackr$1.SUPPORTS_STRUCT_HOOKS = true;
+
+	let textEncoder;
+	try {
+		textEncoder = new TextEncoder();
+	} catch (error) {}
+	let extensions, extensionClasses;
+	const hasNodeBuffer = typeof Buffer !== 'undefined';
+	const ByteArrayAllocate = hasNodeBuffer ?
+		function(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;
+	const ByteArray = hasNodeBuffer ? Buffer : Uint8Array;
+	const MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;
+	let target, keysTarget;
+	let targetView;
+	let position = 0;
+	let safeEnd;
+	let bundledStrings = null;
+	const MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.
+	const hasNonLatin = /[\u0080-\uFFFF]/;
+	const RECORD_SYMBOL = Symbol('record-id');
+	let Packr$1 = class Packr extends Unpackr$1 {
+		constructor(options) {
+			super(options);
+			this.offset = 0;
+			let start;
+			let hasSharedUpdate;
+			let structures;
+			let referenceMap;
+			let encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {
+				return target.utf8Write(string, position, target.byteLength - position);
+			} : (textEncoder && textEncoder.encodeInto) ?
+				function(string, position) {
+					return textEncoder.encodeInto(string, target.subarray(position)).written;
+				} : false;
+
+			let packr = this;
+			if (!options)
+				options = {};
+			let isSequential = options && options.sequential;
+			let hasSharedStructures = options.structures || options.saveStructures;
+			let maxSharedStructures = options.maxSharedStructures;
+			if (maxSharedStructures == null)
+				maxSharedStructures = hasSharedStructures ? 32 : 0;
+			if (maxSharedStructures > 8160)
+				throw new Error('Maximum maxSharedStructure is 8160');
+			if (options.structuredClone && options.moreTypes == undefined) {
+				this.moreTypes = true;
+			}
+			let maxOwnStructures = options.maxOwnStructures;
+			if (maxOwnStructures == null)
+				maxOwnStructures = hasSharedStructures ? 32 : 64;
+			if (!this.structures && options.useRecords != false)
+				this.structures = [];
+			// two byte record ids for shared structures
+			let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
+			let sharedLimitId = maxSharedStructures + 0x40;
+			let maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;
+			if (maxStructureId > 8256) {
+				throw new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');
+			}
+			let recordIdsToRemove = [];
+			let transitionsCount = 0;
+			let serializationsSinceTransitionRebuild = 0;
+
+			this.pack = this.encode = function(value, encodeOptions) {
+				if (!target) {
+					target = new ByteArrayAllocate(8192);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));
+					position = 0;
+				}
+				safeEnd = target.length - 10;
+				if (safeEnd - position < 0x800) {
+					// don't start too close to the end,
+					target = new ByteArrayAllocate(target.length);
+					targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));
+					safeEnd = target.length - 10;
+					position = 0;
+				} else
+					position = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster
+				start = position;
+				if (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);
+				referenceMap = packr.structuredClone ? new Map() : null;
+				if (packr.bundleStrings && typeof value !== 'string') {
+					bundledStrings = [];
+					bundledStrings.size = Infinity; // force a new bundle start on first string
+				} else
+					bundledStrings = null;
+				structures = packr.structures;
+				if (structures) {
+					if (structures.uninitialized)
+						structures = packr._mergeStructures(packr.getStructures());
+					let sharedLength = structures.sharedLength || 0;
+					if (sharedLength > maxSharedStructures) {
+						//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
+						throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);
+					}
+					if (!structures.transitions) {
+						// rebuild our structure transitions
+						structures.transitions = Object.create(null);
+						for (let i = 0; i < sharedLength; i++) {
+							let keys = structures[i];
+							if (!keys)
+								continue;
+							let nextTransition, transition = structures.transitions;
+							for (let j = 0, l = keys.length; j < l; j++) {
+								let key = keys[j];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+								}
+								transition = nextTransition;
+							}
+							transition[RECORD_SYMBOL] = i + 0x40;
+						}
+						this.lastNamedStructuresLength = sharedLength;
+					}
+					if (!isSequential) {
+						structures.nextId = sharedLength + 0x40;
+					}
+				}
+				if (hasSharedUpdate)
+					hasSharedUpdate = false;
+				let encodingError;
+				try {
+					if (packr._writeStruct && value && typeof value === 'object') {
+						if (value.constructor === Object) writeStruct(value); // simple object
+						else if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {
+							// allow user classes, if they don't need special handling (but do use toJSON if available)
+							writeStruct(value.toJSON ? value.toJSON() : value);
+						} else pack(value);
+					} else
+						pack(value);
+					let lastBundle = bundledStrings;
+					if (bundledStrings)
+						writeBundles(start, pack, 0);
+					if (referenceMap && referenceMap.idsToInsert) {
+						let idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);
+						let i = idsToInsert.length;
+						let incrementPosition = -1;
+						while (lastBundle && i > 0) {
+							let insertionPoint = idsToInsert[--i].offset + start;
+							if (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)
+								incrementPosition = 0;
+							if (insertionPoint > (lastBundle.position + start)) {
+								if (incrementPosition >= 0)
+									incrementPosition += 6;
+							} else {
+								if (incrementPosition >= 0) {
+									// update the bundle reference now
+									targetView.setUint32(lastBundle.position + start,
+										targetView.getUint32(lastBundle.position + start) + incrementPosition);
+									incrementPosition = -1; // reset
+								}
+								lastBundle = lastBundle.previous;
+								i++;
+							}
+						}
+						if (incrementPosition >= 0 && lastBundle) {
+							// update the bundle reference now
+							targetView.setUint32(lastBundle.position + start,
+								targetView.getUint32(lastBundle.position + start) + incrementPosition);
+						}
+						position += idsToInsert.length * 6;
+						if (position > safeEnd)
+							makeRoom(position);
+						packr.offset = position;
+						let serialized = insertIds(target.subarray(start, position), idsToInsert);
+						referenceMap = null;
+						return serialized;
+					}
+					packr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
+					if (encodeOptions & REUSE_BUFFER_MODE) {
+						target.start = start;
+						target.end = position;
+						return target;
+					}
+					return target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now
+				} catch(error) {
+					encodingError = error;
+					throw error;
+				} finally {
+					if (structures) {
+						resetStructures();
+						if (hasSharedUpdate && packr.saveStructures) {
+							let sharedLength = structures.sharedLength || 0;
+							// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
+							let returnBuffer = target.subarray(start, position);
+							let newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);
+							if (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time
+								if (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {
+									// get updated structures and try again if the update failed
+									return packr.pack(value, encodeOptions);
+								}
+								packr.lastNamedStructuresLength = sharedLength;
+								// don't keep large buffers around
+								if (target.length > 0x40000000) target = null;
+								return returnBuffer;
+							}
+						}
+					}
+					// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)
+					if (target.length > 0x40000000) target = null;
+					if (encodeOptions & RESET_BUFFER_MODE)
+						position = start;
+				}
+			};
+			const resetStructures = () => {
+				if (serializationsSinceTransitionRebuild < 10)
+					serializationsSinceTransitionRebuild++;
+				let sharedLength = structures.sharedLength || 0;
+				if (structures.length > sharedLength && !isSequential)
+					structures.length = sharedLength;
+				if (transitionsCount > 10000) {
+					// force a rebuild occasionally after a lot of transitions so it can get cleaned up
+					structures.transitions = null;
+					serializationsSinceTransitionRebuild = 0;
+					transitionsCount = 0;
+					if (recordIdsToRemove.length > 0)
+						recordIdsToRemove = [];
+				} else if (recordIdsToRemove.length > 0 && !isSequential) {
+					for (let i = 0, l = recordIdsToRemove.length; i < l; i++) {
+						recordIdsToRemove[i][RECORD_SYMBOL] = 0;
+					}
+					recordIdsToRemove = [];
+				}
+			};
+			const packArray = (value) => {
+				var length = value.length;
+				if (length < 0x10) {
+					target[position++] = 0x90 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xdc;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdd;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				for (let i = 0; i < length; i++) {
+					pack(value[i]);
+				}
+			};
+			const pack = (value) => {
+				if (position > safeEnd)
+					target = makeRoom(position);
+
+				var type = typeof value;
+				var length;
+				if (type === 'string') {
+					let strLength = value.length;
+					if (bundledStrings && strLength >= 4 && strLength < 0x1000) {
+						if ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {
+							let extStart;
+							let maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;
+							if (position + maxBytes > safeEnd)
+								target = makeRoom(position + maxBytes);
+							let lastBundle;
+							if (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle
+								lastBundle = bundledStrings;
+								target[position] = 0xc8; // ext 16
+								position += 3; // reserve for the writing bundle size
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+								writeBundles(start, pack, 0); // write the last bundles
+								targetView.setUint16(extStart + start - 3, position - start - extStart);
+							} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x62; // 'b'
+								extStart = position - start;
+								position += 4; // reserve for writing bundle reference
+							}
+							bundledStrings = ['', '']; // create new ones
+							bundledStrings.previous = lastBundle;
+							bundledStrings.size = 0;
+							bundledStrings.position = extStart;
+						}
+						let twoByte = hasNonLatin.test(value);
+						bundledStrings[twoByte ? 0 : 1] += value;
+						target[position++] = 0xc1;
+						pack(twoByte ? -strLength : strLength);
+						return;
+					}
+					let headerSize;
+					// first we estimate the header size, so we can write to the correct location
+					if (strLength < 0x20) {
+						headerSize = 1;
+					} else if (strLength < 0x100) {
+						headerSize = 2;
+					} else if (strLength < 0x10000) {
+						headerSize = 3;
+					} else {
+						headerSize = 5;
+					}
+					let maxBytes = strLength * 3;
+					if (position + maxBytes > safeEnd)
+						target = makeRoom(position + maxBytes);
+
+					if (strLength < 0x40 || !encodeUtf8) {
+						let i, c1, c2, strPosition = position + headerSize;
+						for (i = 0; i < strLength; i++) {
+							c1 = value.charCodeAt(i);
+							if (c1 < 0x80) {
+								target[strPosition++] = c1;
+							} else if (c1 < 0x800) {
+								target[strPosition++] = c1 >> 6 | 0xc0;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else if (
+								(c1 & 0xfc00) === 0xd800 &&
+								((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00
+							) {
+								c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+								i++;
+								target[strPosition++] = c1 >> 18 | 0xf0;
+								target[strPosition++] = c1 >> 12 & 0x3f | 0x80;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							} else {
+								target[strPosition++] = c1 >> 12 | 0xe0;
+								target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+								target[strPosition++] = c1 & 0x3f | 0x80;
+							}
+						}
+						length = strPosition - position - headerSize;
+					} else {
+						length = encodeUtf8(value, position + headerSize);
+					}
+
+					if (length < 0x20) {
+						target[position++] = 0xa0 | length;
+					} else if (length < 0x100) {
+						if (headerSize < 2) {
+							target.copyWithin(position + 2, position + 1, position + 1 + length);
+						}
+						target[position++] = 0xd9;
+						target[position++] = length;
+					} else if (length < 0x10000) {
+						if (headerSize < 3) {
+							target.copyWithin(position + 3, position + 2, position + 2 + length);
+						}
+						target[position++] = 0xda;
+						target[position++] = length >> 8;
+						target[position++] = length & 0xff;
+					} else {
+						if (headerSize < 5) {
+							target.copyWithin(position + 5, position + 3, position + 3 + length);
+						}
+						target[position++] = 0xdb;
+						targetView.setUint32(position, length);
+						position += 4;
+					}
+					position += length;
+				} else if (type === 'number') {
+					if (value >>> 0 === value) {// positive integer, 32-bit or less
+						// positive uint
+						if (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {
+							target[position++] = value;
+						} else if (value < 0x100) {
+							target[position++] = 0xcc;
+							target[position++] = value;
+						} else if (value < 0x10000) {
+							target[position++] = 0xcd;
+							target[position++] = value >> 8;
+							target[position++] = value & 0xff;
+						} else {
+							target[position++] = 0xce;
+							targetView.setUint32(position, value);
+							position += 4;
+						}
+					} else if (value >> 0 === value) { // negative integer
+						if (value >= -0x20) {
+							target[position++] = 0x100 + value;
+						} else if (value >= -0x80) {
+							target[position++] = 0xd0;
+							target[position++] = value + 0x100;
+						} else if (value >= -0x8000) {
+							target[position++] = 0xd1;
+							targetView.setInt16(position, value);
+							position += 2;
+						} else {
+							target[position++] = 0xd2;
+							targetView.setInt32(position, value);
+							position += 4;
+						}
+					} else {
+						let useFloat32;
+						if ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {
+							target[position++] = 0xca;
+							targetView.setFloat32(position, value);
+							let xShifted;
+							if (useFloat32 < 4 ||
+									// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+									((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {
+								position += 4;
+								return;
+							} else
+								position--; // move back into position for writing a double
+						}
+						target[position++] = 0xcb;
+						targetView.setFloat64(position, value);
+						position += 8;
+					}
+				} else if (type === 'object' || type === 'function') {
+					if (!value)
+						target[position++] = 0xc0;
+					else {
+						if (referenceMap) {
+							let referee = referenceMap.get(value);
+							if (referee) {
+								if (!referee.id) {
+									let idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);
+									referee.id = idsToInsert.push(referee);
+								}
+								target[position++] = 0xd6; // fixext 4
+								target[position++] = 0x70; // "p" for pointer
+								targetView.setUint32(position, referee.id);
+								position += 4;
+								return;
+							} else
+								referenceMap.set(value, { offset: position - start });
+						}
+						let constructor = value.constructor;
+						if (constructor === Object) {
+							writeObject(value);
+						} else if (constructor === Array) {
+							packArray(value);
+						} else if (constructor === Map) {
+							if (this.mapAsEmptyObject) target[position++] = 0x80;
+							else {
+								length = value.size;
+								if (length < 0x10) {
+									target[position++] = 0x80 | length;
+								} else if (length < 0x10000) {
+									target[position++] = 0xde;
+									target[position++] = length >> 8;
+									target[position++] = length & 0xff;
+								} else {
+									target[position++] = 0xdf;
+									targetView.setUint32(position, length);
+									position += 4;
+								}
+								for (let [key, entryValue] of value) {
+									pack(key);
+									pack(entryValue);
+								}
+							}
+						} else {
+							for (let i = 0, l = extensions.length; i < l; i++) {
+								let extensionClass = extensionClasses[i];
+								if (value instanceof extensionClass) {
+									let extension = extensions[i];
+									if (extension.write) {
+										if (extension.type) {
+											target[position++] = 0xd4; // one byte "tag" extension
+											target[position++] = extension.type;
+											target[position++] = 0;
+										}
+										let writeResult = extension.write.call(this, value);
+										if (writeResult === value) { // avoid infinite recursion
+											if (Array.isArray(value)) {
+												packArray(value);
+											} else {
+												writeObject(value);
+											}
+										} else {
+											pack(writeResult);
+										}
+										return;
+									}
+									let currentTarget = target;
+									let currentTargetView = targetView;
+									let currentPosition = position;
+									target = null;
+									let result;
+									try {
+										result = extension.pack.call(this, value, (size) => {
+											// restore target and use it
+											target = currentTarget;
+											currentTarget = null;
+											position += size;
+											if (position > safeEnd)
+												makeRoom(position);
+											return {
+												target, targetView, position: position - size
+											};
+										}, pack);
+									} finally {
+										// restore current target information (unless already restored)
+										if (currentTarget) {
+											target = currentTarget;
+											targetView = currentTargetView;
+											position = currentPosition;
+											safeEnd = target.length - 10;
+										}
+									}
+									if (result) {
+										if (result.length + position > safeEnd)
+											makeRoom(result.length + position);
+										position = writeExtensionData(result, target, position, extension.type);
+									}
+									return;
+								}
+							}
+							// check isArray after extensions, because extensions can extend Array
+							if (Array.isArray(value)) {
+								packArray(value);
+							} else {
+								// use this as an alternate mechanism for expressing how to serialize
+								if (value.toJSON) {
+									const json = value.toJSON();
+									// if for some reason value.toJSON returns itself it'll loop forever
+									if (json !== value)
+										return pack(json);
+								}
+
+								// if there is a writeFunction, use it, otherwise just encode as undefined
+								if (type === 'function')
+									return pack(this.writeFunction && this.writeFunction(value));
+
+								// no extension found, write as plain object
+								writeObject(value);
+							}
+						}
+					}
+				} else if (type === 'boolean') {
+					target[position++] = value ? 0xc3 : 0xc2;
+				} else if (type === 'bigint') {
+					if (value < 0x8000000000000000 && value >= -0x8000000000000000) {
+						// use a signed int as long as it fits
+						target[position++] = 0xd3;
+						targetView.setBigInt64(position, value);
+					} else if (value < 0x10000000000000000 && value > 0) {
+						// if we can fit an unsigned int, use that
+						target[position++] = 0xcf;
+						targetView.setBigUint64(position, value);
+					} else {
+						// overflow
+						if (this.largeBigIntToFloat) {
+							target[position++] = 0xcb;
+							targetView.setFloat64(position, Number(value));
+						} else if (this.largeBigIntToString) {
+							return pack(value.toString());
+						} else if (this.useBigIntExtension || this.moreTypes) {
+							let empty = value < 0 ? BigInt(-1) : BigInt(0);
+
+							let array;
+							if (value >> BigInt(0x10000) === empty) {
+								let mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow
+								let chunks = [];
+								while (true) {
+									chunks.push(value & mask);
+									if ((value >> BigInt(63)) === empty) break;
+									value >>= BigInt(64);
+								}
+
+								array = new Uint8Array(new BigUint64Array(chunks).buffer);
+								array.reverse();
+							} else {
+								let invert = value < 0;
+								let string = (invert ? ~value : value).toString(16);
+								if (string.length % 2) {
+									string = '0' + string;
+								} else if (parseInt(string.charAt(0), 16) >= 8) {
+									string = '00' + string;
+								}
+
+								if (hasNodeBuffer) {
+									array = Buffer.from(string, 'hex');
+								} else {
+									array = new Uint8Array(string.length / 2);
+									for (let i = 0; i < array.length; i++) {
+										array[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);
+									}
+								}
+
+								if (invert) {
+									for (let i = 0; i < array.length; i++) array[i] = ~array[i];
+								}
+							}
+
+							if (array.length + position > safeEnd)
+								makeRoom(array.length + position);
+							position = writeExtensionData(array, target, position, 0x42);
+							return;
+						} else {
+							throw new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +
+								' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +
+								' largeBigIntToString to convert to string');
+						}
+					}
+					position += 8;
+				} else if (type === 'undefined') {
+					if (this.encodeUndefinedAsNil)
+						target[position++] = 0xc0;
+					else {
+						target[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite
+						target[position++] = 0;
+						target[position++] = 0;
+					}
+				} else {
+					throw new Error('Unknown type: ' + type);
+				}
+			};
+
+			const writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {
+				// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
+				let keys;
+				if (this.skipValues) {
+					keys = [];
+					for (let key in object) {
+						if ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&
+							!this.skipValues.includes(object[key]))
+							keys.push(key);
+					}
+				} else {
+					keys = Object.keys(object);
+				}
+				let length = keys.length;
+				if (length < 0x10) {
+					target[position++] = 0x80 | length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xde;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xdf;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				let key;
+				if (this.coercibleKeyAsNumber) {
+					for (let i = 0; i < length; i++) {
+						key = keys[i];
+						let num = Number(key);
+						pack(isNaN(num) ? key : num);
+						pack(object[key]);
+					}
+
+				} else {
+					for (let i = 0; i < length; i++) {
+						pack(key = keys[i]);
+						pack(object[key]);
+					}
+				}
+			} :
+			(object) => {
+				target[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards
+				let objectOffset = position - start;
+				position += 2;
+				let size = 0;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(key);
+						pack(object[key]);
+						size++;
+					}
+				}
+				if (size > 0xffff) {
+					throw new Error('Object is too large to serialize with fast 16-bit map size,' +
+					' use the "variableMapSize" option to serialize this object');
+				}
+				target[objectOffset++ + start] = size >> 8;
+				target[objectOffset + start] = size & 0xff;
+			};
+
+			const writeRecord = this.useRecords === false ? writePlainObject :
+			(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let objectOffset = position++ - start;
+				let wroteKeys;
+				for (let key in object) {
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						nextTransition = transition[key];
+						if (nextTransition)
+							transition = nextTransition;
+						else {
+							// record doesn't exist, create full new record and insert it
+							let keys = Object.keys(object);
+							let lastTransition = transition;
+							transition = structures.transitions;
+							let newTransitions = 0;
+							for (let i = 0, l = keys.length; i < l; i++) {
+								let key = keys[i];
+								nextTransition = transition[key];
+								if (!nextTransition) {
+									nextTransition = transition[key] = Object.create(null);
+									newTransitions++;
+								}
+								transition = nextTransition;
+							}
+							if (objectOffset + start + 1 == position) {
+								// first key, so we don't need to insert, we can just write record directly
+								position--;
+								newRecord(transition, keys, newTransitions);
+							} else // otherwise we need to insert the record, moving existing data after the record
+								insertNewRecord(transition, keys, objectOffset, newTransitions);
+							wroteKeys = true;
+							transition = lastTransition[key];
+						}
+						pack(object[key]);
+					}
+				}
+				if (!wroteKeys) {
+					let recordId = transition[RECORD_SYMBOL];
+					if (recordId)
+						target[objectOffset + start] = recordId;
+					else
+						insertNewRecord(transition, Object.keys(object), objectOffset, 0);
+				}
+			} :
+			(object) => {
+				let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+				let newTransitions = 0;
+				for (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					nextTransition = transition[key];
+					if (!nextTransition) {
+						nextTransition = transition[key] = Object.create(null);
+						newTransitions++;
+					}
+					transition = nextTransition;
+				}
+				let recordId = transition[RECORD_SYMBOL];
+				if (recordId) {
+					if (recordId >= 0x60 && useTwoByteRecords) {
+						target[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;
+						target[position++] = recordId >> 5;
+					} else
+						target[position++] = recordId;
+				} else {
+					newRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);
+				}
+				// now write the values
+				for (let key in object)
+					if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+						pack(object[key]);
+					}
+			};
+
+			// create reference to useRecords if useRecords is a function
+			const checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;
+
+			const writeObject = checkUseRecords ? (object) => {
+				checkUseRecords(object) ? writeRecord(object) : writePlainObject(object);
+			} : writeRecord;
+
+			const writeStruct = (object) => {
+				let newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {
+					if (notifySharedUpdate)
+						return hasSharedUpdate = true;
+					position = newPosition;
+					let startTarget = target;
+					pack(value);
+					resetStructures();
+					if (startTarget !== target) {
+						return { position, targetView, target }; // indicate the buffer was re-allocated
+					}
+					return position;
+				});
+				if (newPosition === 0) // bail and go to a msgpack object
+					return writeObject(object);
+				position = newPosition;
+			};
+
+			const makeRoom = (end) => {
+				let newSize;
+				if (end > 0x1000000) {
+					// special handling for really large buffers
+					if ((end - start) > MAX_BUFFER_SIZE)
+						throw new Error('Packed buffer would be larger than maximum buffer size');
+					newSize = Math.min(MAX_BUFFER_SIZE,
+						Math.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);
+				} else // faster handling for smaller buffers
+					newSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;
+				let newBuffer = new ByteArrayAllocate(newSize);
+				targetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));
+				end = Math.min(end, target.length);
+				if (target.copy)
+					target.copy(newBuffer, 0, start, end);
+				else
+					newBuffer.set(target.slice(start, end));
+				position -= start;
+				start = 0;
+				safeEnd = newBuffer.length - 10;
+				return target = newBuffer;
+			};
+			const newRecord = (transition, keys, newTransitions) => {
+				let recordId = structures.nextId;
+				if (!recordId)
+					recordId = 0x40;
+				if (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {
+					recordId = structures.nextOwnId;
+					if (!(recordId < maxStructureId))
+						recordId = sharedLimitId;
+					structures.nextOwnId = recordId + 1;
+				} else {
+					if (recordId >= maxStructureId)// cycle back around
+						recordId = sharedLimitId;
+					structures.nextId = recordId + 1;
+				}
+				let highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;
+				transition[RECORD_SYMBOL] = recordId;
+				transition.__keys__ = keys;
+				structures[recordId - 0x40] = keys;
+
+				if (recordId < sharedLimitId) {
+					keys.isShared = true;
+					structures.sharedLength = recordId - 0x3f;
+					hasSharedUpdate = true;
+					if (highByte >= 0) {
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = recordId;
+					}
+				} else {
+					if (highByte >= 0) {
+						target[position++] = 0xd5; // fixext 2
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = (recordId & 0x1f) + 0x60;
+						target[position++] = highByte;
+					} else {
+						target[position++] = 0xd4; // fixext 1
+						target[position++] = 0x72; // "r" record defintion extension type
+						target[position++] = recordId;
+					}
+
+					if (newTransitions)
+						transitionsCount += serializationsSinceTransitionRebuild * newTransitions;
+					// record the removal of the id, we can maintain our shared structure
+					if (recordIdsToRemove.length >= maxOwnStructures)
+						recordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones
+					recordIdsToRemove.push(transition);
+					pack(keys);
+				}
+			};
+			const insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {
+				let mainTarget = target;
+				let mainPosition = position;
+				let mainSafeEnd = safeEnd;
+				let mainStart = start;
+				target = keysTarget;
+				position = 0;
+				start = 0;
+				if (!target)
+					keysTarget = target = new ByteArrayAllocate(8192);
+				safeEnd = target.length - 10;
+				newRecord(transition, keys, newTransitions);
+				keysTarget = target;
+				let keysPosition = position;
+				target = mainTarget;
+				position = mainPosition;
+				safeEnd = mainSafeEnd;
+				start = mainStart;
+				if (keysPosition > 1) {
+					let newEnd = position + keysPosition - 1;
+					if (newEnd > safeEnd)
+						makeRoom(newEnd);
+					let insertionPosition = insertionOffset + start;
+					target.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);
+					target.set(keysTarget.slice(0, keysPosition), insertionPosition);
+					position = newEnd;
+				} else {
+					target[insertionOffset + start] = keysTarget[0];
+				}
+			};
+		}
+		useBuffer(buffer) {
+			// this means we are finished using our own buffer and we can write over it safely
+			target = buffer;
+			target.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));
+			targetView = target.dataView;
+			position = 0;
+		}
+		set position (value) {
+			position = value;
+		}
+		get position() {
+			return position;
+		}
+		clearSharedData() {
+			if (this.structures)
+				this.structures = [];
+			if (this.typedStructs)
+				this.typedStructs = [];
+		}
+	};
+
+	extensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];
+	extensions = [{
+		pack(date, allocateForWrite, pack) {
+			let seconds = date.getTime() / 1000;
+			if ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {
+				// Timestamp 32
+				let { target, targetView, position} = allocateForWrite(6);
+				target[position++] = 0xd6;
+				target[position++] = 0xff;
+				targetView.setUint32(position, seconds);
+			} else if (seconds > 0 && seconds < 0x100000000) {
+				// Timestamp 64
+				let { target, targetView, position} = allocateForWrite(10);
+				target[position++] = 0xd7;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));
+				targetView.setUint32(position + 4, seconds);
+			} else if (isNaN(seconds)) {
+				if (this.onInvalidDate) {
+					allocateForWrite(0);
+					return pack(this.onInvalidDate());
+				}
+				// Intentionally invalid timestamp
+				let { target, targetView, position} = allocateForWrite(3);
+				target[position++] = 0xd4;
+				target[position++] = 0xff;
+				target[position++] = 0xff;
+			} else {
+				// Timestamp 96
+				let { target, targetView, position} = allocateForWrite(15);
+				target[position++] = 0xc7;
+				target[position++] = 12;
+				target[position++] = 0xff;
+				targetView.setUint32(position, date.getMilliseconds() * 1000000);
+				targetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));
+			}
+		}
+	}, {
+		pack(set, allocateForWrite, pack) {
+			if (this.setAsEmptyObject) {
+				allocateForWrite(0);
+				return pack({});
+			}
+			let array = Array.from(set);
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x73; // 's' for Set
+				target[position++] = 0;
+			}
+			pack(array);
+		}
+	}, {
+		pack(error, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x65; // 'e' for error
+				target[position++] = 0;
+			}
+			pack([ error.name, error.message, error.cause ]);
+		}
+	}, {
+		pack(regex, allocateForWrite, pack) {
+			let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+			if (this.moreTypes) {
+				target[position++] = 0xd4;
+				target[position++] = 0x78; // 'x' for regeXp
+				target[position++] = 0;
+			}
+			pack([ regex.source, regex.flags ]);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x10, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(typedArray, allocateForWrite) {
+			let constructor = typedArray.constructor;
+			if (constructor !== ByteArray && this.moreTypes)
+				writeExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);
+			else
+				writeBuffer(typedArray, allocateForWrite);
+		}
+	}, {
+		pack(arrayBuffer, allocateForWrite) {
+			if (this.moreTypes)
+				writeExtBuffer(arrayBuffer, 0x11, allocateForWrite);
+			else
+				writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+		}
+	}, {
+		pack(c1, allocateForWrite) { // specific 0xC1 object
+			let { target, position} = allocateForWrite(1);
+			target[position] = 0xc1;
+		}
+	}];
+
+	function writeExtBuffer(typedArray, type, allocateForWrite, encode) {
+		let length = typedArray.byteLength;
+		if (length + 1 < 0x100) {
+			var { target, position } = allocateForWrite(4 + length);
+			target[position++] = 0xc7;
+			target[position++] = length + 1;
+		} else if (length + 1 < 0x10000) {
+			var { target, position } = allocateForWrite(5 + length);
+			target[position++] = 0xc8;
+			target[position++] = (length + 1) >> 8;
+			target[position++] = (length + 1) & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(7 + length);
+			target[position++] = 0xc9;
+			targetView.setUint32(position, length + 1); // plus one for the type byte
+			position += 4;
+		}
+		target[position++] = 0x74; // "t" for typed array
+		target[position++] = type;
+		if (!typedArray.buffer) typedArray = new Uint8Array(typedArray);
+		target.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);
+	}
+	function writeBuffer(buffer, allocateForWrite) {
+		let length = buffer.byteLength;
+		var target, position;
+		if (length < 0x100) {
+			var { target, position } = allocateForWrite(length + 2);
+			target[position++] = 0xc4;
+			target[position++] = length;
+		} else if (length < 0x10000) {
+			var { target, position } = allocateForWrite(length + 3);
+			target[position++] = 0xc5;
+			target[position++] = length >> 8;
+			target[position++] = length & 0xff;
+		} else {
+			var { target, position, targetView } = allocateForWrite(length + 5);
+			target[position++] = 0xc6;
+			targetView.setUint32(position, length);
+			position += 4;
+		}
+		target.set(buffer, position);
+	}
+
+	function writeExtensionData(result, target, position, type) {
+		let length = result.length;
+		switch (length) {
+			case 1:
+				target[position++] = 0xd4;
+				break;
+			case 2:
+				target[position++] = 0xd5;
+				break;
+			case 4:
+				target[position++] = 0xd6;
+				break;
+			case 8:
+				target[position++] = 0xd7;
+				break;
+			case 16:
+				target[position++] = 0xd8;
+				break;
+			default:
+				if (length < 0x100) {
+					target[position++] = 0xc7;
+					target[position++] = length;
+				} else if (length < 0x10000) {
+					target[position++] = 0xc8;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					target[position++] = 0xc9;
+					target[position++] = length >> 24;
+					target[position++] = (length >> 16) & 0xff;
+					target[position++] = (length >> 8) & 0xff;
+					target[position++] = length & 0xff;
+				}
+		}
+		target[position++] = type;
+		target.set(result, position);
+		position += length;
+		return position;
+	}
+
+	function insertIds(serialized, idsToInsert) {
+		// insert the ids that need to be referenced for structured clones
+		let nextId;
+		let distanceToMove = idsToInsert.length * 6;
+		let lastEnd = serialized.length - distanceToMove;
+		while (nextId = idsToInsert.pop()) {
+			let offset = nextId.offset;
+			let id = nextId.id;
+			serialized.copyWithin(offset + distanceToMove, offset, lastEnd);
+			distanceToMove -= 6;
+			let position = offset + distanceToMove;
+			serialized[position++] = 0xd6;
+			serialized[position++] = 0x69; // 'i'
+			serialized[position++] = id >> 24;
+			serialized[position++] = (id >> 16) & 0xff;
+			serialized[position++] = (id >> 8) & 0xff;
+			serialized[position++] = id & 0xff;
+			lastEnd = offset;
+		}
+		return serialized;
+	}
+
+	function writeBundles(start, pack, incrementPosition) {
+		if (bundledStrings.length > 0) {
+			targetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);
+			bundledStrings.stringsPosition = position - start;
+			let writeStrings = bundledStrings;
+			bundledStrings = null;
+			pack(writeStrings[0]);
+			pack(writeStrings[1]);
+		}
+	}
+
+	function addExtension$1(extension) {
+		if (extension.Class) {
+			if (!extension.pack && !extension.write)
+				throw new Error('Extension has no pack or write function');
+			if (extension.pack && !extension.type)
+				throw new Error('Extension has no type (numeric code to identify the extension)');
+			extensionClasses.unshift(extension.Class);
+			extensions.unshift(extension);
+		}
+		addExtension$2(extension);
+	}
+	function prepareStructures(structures, packr) {
+		structures.isCompatible = (existingStructures) => {
+			let compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);
+			if (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction
+				packr._mergeStructures(existingStructures);
+			return compatible;
+		};
+		return structures;
+	}
+
+	// Marker for downstream libraries (e.g. structon) to detect that this Packr
+	// supports per-instance struct-encoding hooks (this._writeStruct,
+	// this._prepareStructures).  See `pack` for the dispatch.
+	Packr$1.SUPPORTS_STRUCT_HOOKS = true;
+
+	let defaultPackr = new Packr$1({ useRecords: false });
+	const pack$1 = defaultPackr.pack;
+	defaultPackr.pack;
+	const REUSE_BUFFER_MODE = 512;
+	const RESET_BUFFER_MODE = 1024;
+	const RESERVE_START_SPACE = 2048;
+
+	const nativeAccelerationDisabled = process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED !== undefined && process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED.toLowerCase() === 'true';
+
+	if (!nativeAccelerationDisabled) {
+		let extractor;
+		try {
+			if (typeof require == 'function')
+				extractor = require('msgpackr-extract');
+			else
+				extractor = module.createRequire((document.currentScript && document.currentScript.src || new URL('test.js', document.baseURI).href))('msgpackr-extract');
+			if (extractor)
+				setExtractor(extractor.extractStrings);
+		} catch (error) {
+			// native module is optional
+		}
+	}
+
+	let allSampleData = [];
+	for (let i = 1; i < 6; i++) {
+		allSampleData.push(JSON.parse(fs.readFileSync(new URL(`./example${i > 1 ? i : ''}.json`, (document.currentScript && document.currentScript.src || new URL('test.js', document.baseURI).href)))));
+	}
+	allSampleData.push({
+		name: 'some other types',
+		date: new Date(),
+		empty: '',
+	});
+	const sampleData = allSampleData[3];
+	function tryRequire(module) {
+		try {
+			return require(module);
+		} catch(error) {
+			return {};
+		}
+	}
+	//if (typeof chai === 'undefined') { chai = require('chai') }
+	var assert = chai.assert;
+	//if (typeof msgpackr === 'undefined') { msgpackr = require('..') }
+	var Packr = Packr$1;
+	var Unpackr = Unpackr$1;
+	var unpack = unpack$1;
+	var unpackMultiple = unpackMultiple$1;
+	var roundFloat32 = roundFloat32$1;
+	var pack = pack$1;
+	var DECIMAL_FIT = FLOAT32_OPTIONS.DECIMAL_FIT;
+
+	var addExtension = addExtension$1;
+	var zlib = tryRequire('zlib');
+	zlib.deflateSync;
+	zlib.inflateSync;
+	zlib.brotliCompressSync;
+	zlib.brotliDecompressSync;
+	zlib.constants;
+
+	var ITERATIONS = 4000;
+
+	class ExtendArray extends Array {
+	}
+
+	class ExtendArray2 extends Array {
+	}
+
+	class ExtendArray3 extends Array {
+	}
+
+
+	class ExtendObject {
+	}
+
+
+	suite('msgpackr basic tests', function() {
+		test('pack/unpack data', function () {
+			var data = {
+				data: [
+					{a: 1, name: 'one', type: 'odd', isOdd: true},
+					{a: 2, name: 'two', type: 'even'},
+					{a: 3, name: 'three', type: 'odd', isOdd: true},
+					{a: 4, name: 'four', type: 'even'},
+					{a: 5, name: 'five', type: 'odd', isOdd: true},
+					{a: 6, name: 'six', type: 'even', isOdd: null}
+				],
+				description: 'some names',
+				types: ['odd', 'even'],
+				convertEnumToNum: [
+					{prop: 'test'},
+					{prop: 'test'},
+					{prop: 'test'},
+					{prop: 1},
+					{prop: 2},
+					{prop: [undefined]},
+					{prop: null}
+				]
+			};
+			let structures = [];
+			let packr = new Packr({structures});
+			var serialized = packr.pack(data);
+			serialized = packr.pack(data);
+			serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+
+		test('mixed structures', function () {
+			let data1 = {a: 1, b: 2, c: 3};
+			let data2 = {a: 1, b: 2, d: 4};
+			let data3 = {a: 1, b: 2, e: 5};
+			let structures = [];
+			let packr = new Packr({structures});
+			var serialized = packr.pack(data1);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data1);
+			var serialized = packr.pack(data2);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data2);
+			var serialized = packr.pack(data3);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data3);
+		});
+
+		test('mixed array', function () {
+			var data = [
+				'one',
+				'two',
+				'one',
+				10,
+				11,
+				null,
+				true,
+				'three',
+				'three',
+				'one', [
+					3, -5, -50, -400, 1.3, -5.3, true
+				]
+			];
+			let structures = [];
+			let packr = new Packr({structures});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('255 chars', function () {
+			const data = 'RRZG9A6I7xupPeOZhxcOcioFsuhszGOdyDUcbRf4Zef2kdPIfC9RaLO4jTM5JhuZvTsF09fbRHMGtqk7YAgu3vespeTe9l61ziZ6VrMnYu2CamK96wCkmz0VUXyqaiUoTPgzk414LS9yYrd5uh7w18ksJF5SlC2e91rukWvNqAZJjYN3jpkqHNOFchCwFrhbxq2Lrv1kSJPYCx9blRg2hGmYqTbElLTZHv20iNqwZeQbRMgSBPT6vnbCBPnOh1W';
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.equal(deserialized, data);
+		});
+		test('overlong UTF-8 string', function () {
+			const payload = Buffer.concat([
+				Buffer.from([0xa2]),         // msgpack fixstr, 2 bytes
+				Buffer.from([0xc0, 0xaf]),   // overlong "/"
+			]);
+
+			const result = unpack(payload);
+			assert.notEqual(result, '/');
+		});
+		test('use ArrayBuffer', function () {
+			const data = {prop: 'a test'};
+			var serialized = pack(data);
+			let ab = new ArrayBuffer(serialized.length);
+			let u8 = new Uint8Array(ab);
+			u8.set(serialized);
+			var deserialized = unpack(ab);
+			assert.deepEqual(deserialized, data);
+		});
+
+		for (let sampleData of allSampleData) {
+			let snippet = JSON.stringify(sampleData).slice(0, 20) + '...';
+			test('pack/unpack sample data ' + snippet, function () {
+				var data = sampleData;
+				var serialized = pack(data);
+				var deserialized = unpack(serialized);
+				assert.deepEqual(deserialized, data);
+				var serialized = pack(data);
+				var deserialized = unpack(serialized);
+				assert.deepEqual(deserialized, data);
+			});
+			test('pack/unpack sample data with Uint8Array encoding' + snippet, function () {
+				var data = sampleData;
+				var serialized = pack(data);
+				serialized = new Uint8Array(serialized);
+				var deserialized = unpack(serialized);
+				assert.deepEqual(deserialized, data);
+				var serialized = pack(data);
+				var deserialized = unpack(serialized);
+				assert.deepEqual(deserialized, data);
+			});
+			test('pack/unpack sample data with bundled strings ' + snippet, function () {
+				var data = sampleData;
+				let packr = new Packr({ /*structures,*/ useRecords: false, bundleStrings: true});
+				var serialized = packr.pack(data);
+				var deserialized = packr.unpack(serialized);
+				assert.deepEqual(deserialized, data);
+			});
+		}
+
+		test('pack/unpack sample data with useRecords function', function () {
+			var data = [
+				{id: 1, type: 1, labels: {a: 1, b: 2}},
+				{id: 2, type: 1, labels: {b: 1, c: 2}},
+				{id: 3, type: 1, labels: {d: 1, e: 2}}
+			];
+
+			var alternatives = [
+				{useRecords: false}, // 88 bytes
+				{useRecords: true}, // 58 bytes
+				{mapsAsObjects: true, useRecords: (v)=>!!v.id}, // 55 bytes
+				{mapsAsObjects: true, variableMapSize: true, useRecords: (v)=>!!v.id} // 49 bytes
+			];
+
+			for(let o of alternatives) {
+				let packr = new Packr(o);
+				var serialized = packr.pack(data);
+				var deserialized = packr.unpack(serialized);
+				assert.deepEqual(deserialized, data);
+			}
+		});
+
+		test('mapAsEmptyObject combination', function () {
+			const msgpackr = new Packr({ useRecords: false, encodeUndefinedAsNil: true, variableMapSize: true, mapAsEmptyObject: true, setAsEmptyObject: true  });
+
+			const map = new Map();
+			map.set('a', 1);
+			map.set('b', 2);
+			const set = new Set();
+			set.add('a');
+			set.add('b');
+			const input = { map, set };
+
+			const packed = msgpackr.pack(input);
+			const unpacked = msgpackr.unpack(packed);
+			assert.deepEqual(unpacked.map, {});
+			assert.deepEqual(unpacked.set, {});
+		});
+		test('pack/unpack numeric coercible keys', function () {
+			var data = { a: 1, 2: 'test', '-3.45': 'test2'};
+			let packr = new Packr({variableMapSize: true, coercibleKeyAsNumber: true, useRecords: false});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('pack/unpack empty data with bundled strings', function () {
+			var data = {};
+			let packr = new Packr({bundleStrings: true});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('pack/unpack large amount of chinese characters', function() {
+			const MSGPACK_OPTIONS = {bundleStrings: true};
+
+			const item = {
+				message: '你好你好你好你好你好你好你好你好你好', // some Chinese characters
+			};
+
+			testSize(100);
+			testSize(1000);
+			testSize(10000);
+			function testSize(size) {
+				const list = [];
+				for (let i = 0; i < size; i++) {
+					list.push({...item});
+				}
+
+				const packer = new Packr(MSGPACK_OPTIONS);
+				const unpacker = new Unpackr(MSGPACK_OPTIONS);
+				const encoded = packer.pack(list);
+				const decoded = unpacker.unpack(encoded);
+				assert.deepEqual(list, decoded);
+			}
+		});
+		test('pack/unpack sequential data', function () {
+			var data = {foo: 1, bar: 2};
+			let packr = new Packr({sequential: true});
+			let unpackr = new Unpackr({sequential: true});
+			var serialized = packr.pack(data);
+			var deserialized = unpackr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			var serialized = packr.pack(data);
+			var deserialized = unpackr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('pack/unpack with bundled strings and sequential', function () {
+			const options = {
+				bundleStrings: true,
+				sequential: true,
+			};
+
+			const packer = new Packr(options);
+			const unpacker = new Packr(options);
+
+			const data = {data: 42}; // key length >= 4
+
+			unpacker.unpackMultiple(Buffer.concat([
+				packer.pack(data),
+				packer.pack(data)
+			]));
+		});
+		if (typeof Buffer != 'undefined')
+		test('replace data', function(){
+			var data1 = {
+				data: [
+					{ a: 1, name: 'one', type: 'odd', isOdd: true, a: '13 characters' },
+					{ a: 2, name: 'two', type: 'even', a: '11 characte' },
+					{ a: 3, name: 'three', type: 'odd', isOdd: true, a: '12 character' },
+					{ a: 4, name: 'four', type: 'even', a: '9 charact'},
+					{ a: 5, name: 'five', type: 'odd', isOdd: true, a: '14 characters!' },
+					{ a: 6, name: 'six', type: 'even', isOdd: null }
+				],
+			};
+			var data2 = {
+				data: [
+					{ foo: 7, name: 'one', type: 'odd', isOdd: true },
+					{ foo: 8, name: 'two', type: 'even'},
+					{ foo: 9, name: 'three', type: 'odd', isOdd: true },
+					{ foo: 10, name: 'four', type: 'even'},
+					{ foo: 11, name: 'five', type: 'odd', isOdd: true },
+					{ foo: 12, name: 'six', type: 'even', isOdd: null }
+				],
+			};
+			var serialized1 = pack(data1);
+			var serialized2 = pack(data2);
+			var b = Buffer.alloc(8000);
+			serialized1.copy(b);
+			var deserialized1 = unpack(b, serialized1.length);
+			serialized2.copy(b);
+			var deserialized2 = unpack(b, serialized2.length);
+			assert.deepEqual(deserialized1, data1);
+			assert.deepEqual(deserialized2, data2);
+		});
+
+		test('compact 123', function() {
+			assert.equal(pack(123).length, 1);
+		});
+
+		test('BigInt', function() {
+			let packr = new Packr({ useBigIntExtension: true });
+			let data = {
+				a: 3333333333333333333333333333n,
+				b: 1234567890123456789012345678901234567890n,
+				c: -3333333333333333333333333333n,
+				d: -352523523642364364364264264264264264262642642n,
+				e: 0xffffffffffffffffffffffffffn,
+				f: -0xffffffffffffffffffffffffffn,
+				g: (1234n << 123n) ^ (5678n << 56n) ^ 890n,
+				h: (-1234n << 123n) ^ (5678n << 56n) ^ 890n,
+				i: (1234n << 1234n) ^ (5678n << 567n) ^ 890n,
+				j: (-1234n << 1234n) ^ (5678n << 567n) ^ 890n,
+				k: 0xdeadn << 0xbeefn,
+				l: -0xdeadn << 0xbeefn,
+				m: 11n << 0x11111n ^ 111n,
+				n: -11n << 0x11111n ^ 111n,
+				o: 12345678901234567890n,
+				p: -12345678901234567890n,
+				exp: [],
+				expexp: [],
+			};
+
+			for (let n = 1n; n.toString(16).length * 4 < 1500; n <<= 1n, n |= BigInt(Math.floor(Math.random() * 2))) {
+				data.exp.push(n, -n);
+			}
+
+			for (let n = 7n; n.toString(16).length * 4 < 150000; n *= n) {
+				data.expexp.push(n, -n);
+			}
+
+			let serialized = packr.pack(data);
+			let deserialized = packr.unpack(serialized);
+			assert.deepEqual(data, deserialized);
+		});
+
+
+		test('extended class pack/unpack', function(){
+			function Extended() {
+
+			}
+			Extended.prototype.getDouble = function() {
+				return this.value * 2;
+			};
+			var instance = new Extended();
+			instance.value = 4;
+			instance.string = 'decode this: ᾜ';
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			let packr = new Packr();
+			addExtension({
+				Class: Extended,
+				type: 11,
+				unpack: function(buffer) {
+					let e = new Extended();
+					let data = packr.unpack(buffer);
+					e.value = data[0];
+					e.string = data[1];
+					return e;
+				},
+				pack: function(instance) {
+					return packr.pack([instance.value, instance.string]);
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(data, deserialized);
+			assert.equal(deserialized.extendedInstance.getDouble(), 8);
+		});
+
+		test('extended Array class read/write', function(){
+			var instance = new ExtendArray();
+			instance.push(0);
+			instance.push(1);
+			instance.push(2);
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			addExtension({
+				Class: ExtendArray,
+				type: 12,
+				read: function(data) {
+					Object.setPrototypeOf(data, ExtendArray.prototype);
+					return data;
+				},
+				write: function(instance) {
+					return [...instance];
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), ExtendArray.prototype);
+			assert.deepEqual(data, deserialized);
+		});
+
+		test('unregistered extended Array class read/write', function(){
+			var instance = new ExtendArray2();
+			instance.push(0);
+			instance.push(1);
+			instance.push(2);
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Array.prototype);
+			assert.deepEqual(data, deserialized);
+		});
+
+
+		test('unregistered extended Object class read/write', function(){
+			var instance = new ExtendObject();
+			instance.test1 = "string";
+			instance.test2 = 3421321;
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Object.prototype);
+			assert.deepEqual(data, deserialized);
+		});
+
+		test('extended class pack/unpack custom size', function(){
+			function TestClass() {
+
+			}
+			addExtension({
+				Class: TestClass,
+				type: 0x01,
+				pack() {
+					return typeof Buffer != 'undefined' ? Buffer.alloc(256) : new Uint8Array(256);
+				},
+				unpack(data) {
+					return data.length;
+				}
+			});
+			let result = unpack(pack(new TestClass()));
+			assert.equal(result, 256);
+		});
+
+		test('extended class read/write', function(){
+			function Extended() {
+
+			}
+			Extended.prototype.getDouble = function() {
+				return this.value * 2;
+			};
+			var instance = new Extended();
+			instance.value = 4;
+			instance.string = 'decode this: ᾜ';
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			addExtension({
+				Class: Extended,
+				type: 12,
+				read: function(data) {
+					let e = new Extended();
+					e.value = data[0];
+					e.string = data[1];
+					return e;
+				},
+				write: function(instance) {
+					return [instance.value, instance.string];
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(data, deserialized);
+			assert.equal(deserialized.extendedInstance.getDouble(), 8);
+		});
+		test('extended class return self', function(){
+			function Extended() {
+
+			}
+			Extended.prototype.getDouble = function() {
+				return this.value * 2;
+			};
+			var instance = new Extended();
+			instance.value = 4;
+			instance.string = 'decode this: ᾜ';
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			addExtension({
+				Class: Extended,
+				type: 13,
+				read: function(data) {
+					Object.setPrototypeOf(data, Extended.prototype);
+					return data;
+				},
+				write: function(data) {
+					return data;
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(data, deserialized);
+			assert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Extended.prototype);
+			assert.equal(deserialized.extendedInstance.getDouble(), 8);
+		});
+		test('extended Array class return self', function(){
+			var instance = new ExtendArray3();
+			instance.push(0);
+			instance.push('has multi-byte: ᾜ');
+			var data = {
+				prop1: 'has multi-byte: ᾜ',
+				extendedInstance: instance,
+				prop2: 'more string',
+				num: 3,
+			};
+			new Packr();
+			addExtension({
+				Class: ExtendArray3,
+				type: 14,
+				read: function(data) {
+					Object.setPrototypeOf(data, ExtendArray3.prototype);
+					return data;
+				},
+				write: function(data) {
+					return data;
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(data, deserialized);
+			assert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), ExtendArray3.prototype);
+			assert.equal(deserialized.extendedInstance[0], 0);
+		});
+
+		test('extended class pack/unpack proxied', function(){
+			function Extended() {
+
+			}
+			Extended.prototype.__call__ = function(){
+				return this.value * 4;
+			};
+			Extended.prototype.getDouble = function() {
+				return this.value * 2;
+			};
+
+			var instance = function() { instance.__call__();/* callable stuff */ };
+			Object.setPrototypeOf(instance,Extended.prototype);
+
+			instance.value = 4;
+			var data = instance;
+
+			let packr = new Packr();
+			addExtension({
+				Class: Extended,
+				type: 15,
+				unpack: function(buffer) {
+					var e = function() { e.__call__(); };
+					Object.setPrototypeOf(e,Extended.prototype);
+					e.value = packr.unpack(buffer);
+					return e;
+				},
+				pack: function(instance) {
+					return packr.pack(instance.value);
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.equal(deserialized.getDouble(), 8);
+		});
+
+		test.skip('convert Date to string', function(){
+			var data = {
+				aDate: new Date(),
+			};
+			new Packr();
+			addExtension({
+				Class: Date,
+				write(date) {
+					return date.toString();
+				}
+			});
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.equal(deserialized.aDate, data.aDate.toString());
+		});
+		test('standard pack fails on circular reference with shared structures', function () {
+			var data = {};
+			data.self = data;
+			let structures = [];
+			let packr = new Packr({
+				structures,
+				saveStructures(structures) {
+				}
+			});
+			assert.throws(function () {
+				packr.pack(data);
+			});
+		});
+
+		test('proto handling', function() {
+			var objectWithProto = JSON.parse('{"__proto__":{"foo":3}}');
+			var decoded = unpack(pack(objectWithProto));
+			assert(!decoded.foo);
+			var objectsWithProto = [objectWithProto, objectWithProto, objectWithProto, objectWithProto, objectWithProto, objectWithProto];
+			let packr = new Packr();
+			var decoded = packr.unpack(packr.pack(objectsWithProto));
+			for (let object of decoded) {
+				assert(!decoded.foo);
+			}
+		});
+
+		test.skip('text decoder', function() {
+				let td = new TextDecoder('ISO-8859-15');
+				let b = Buffer.alloc(3);
+				for (var i = 0; i < 256; i++) {
+					b[0] = i;
+					b[1] = 0;
+					b[2] = 0;
+					let s = td.decode(b);
+					if (!require('msgpackr-extract').isOneByte(s)) {
+						console.log(i.toString(16), s.length);
+					}
+				}
+		});
+
+		test('moreTypes: Error with causes', function() {
+			const object = {
+				error: new Error('test'),
+				errorWithCause: new Error('test-1', { cause: new Error('test-2') }),
+				type: new TypeError(),
+				range: new RangeError('test', { cause: [1, 2] }),
+			};
+			const packr = new Packr({
+				moreTypes: true,
+			});
+
+			const serialized = packr.pack(object);
+			const deserialized = packr.unpack(serialized);
+			assert.equal(deserialized.error.message, object.error.message);
+			assert.equal(deserialized.error.cause, object.error.cause);
+			assert.equal(deserialized.errorWithCause.message, object.errorWithCause.message);
+			assert.equal(deserialized.errorWithCause.cause.message, object.errorWithCause.cause.message);
+			assert.equal(deserialized.errorWithCause.cause.cause, object.errorWithCause.cause.cause);
+			assert.equal(deserialized.type.message, object.type.message);
+			assert.equal(deserialized.range.message, object.range.message);
+			assert.deepEqual(deserialized.range.cause, object.range.cause);
+			assert(deserialized.error instanceof Error);
+			assert(deserialized.type instanceof TypeError);
+			assert(deserialized.range instanceof RangeError);
+		});
+
+		test('structured cloning: self reference', function() {
+			let object = {
+				test: 'string',
+				children: [
+					{ name: 'child' }
+				],
+				value: new ArrayBuffer(10)
+			};
+			let u8 = new Uint8Array(object.value);
+			u8[0] = 1;
+			u8[1] = 2;
+			object.self = object;
+			object.children[1] = object;
+			object.children[2] = object.children[0];
+			object.childrenAgain = object.children;
+			let packr = new Packr({
+				moreTypes: true,
+				structuredClone: true,
+			});
+			var serialized = packr.pack(object);
+			var deserialized = packr.unpack(serialized);
+			assert.equal(deserialized.self, deserialized);
+			assert.equal(deserialized.children[0].name, 'child');
+			assert.equal(deserialized.children[1], deserialized);
+			assert.equal(deserialized.children[0], deserialized.children[2]);
+			assert.equal(deserialized.children, deserialized.childrenAgain);
+			assert.equal(deserialized.value.constructor.name, 'ArrayBuffer');
+			u8 = new Uint8Array(deserialized.value);
+			assert.equal(u8[0], 1);
+			assert.equal(u8[1], 2);
+		});
+
+		test('structured cloning: self reference with more types', function() {
+			let set = new Set();
+			set.add(['hello', 1, 2, { map: new Map([[set, set], ['a', 'b']]) }]);
+
+			let packr = new Packr({
+				moreTypes: true,
+				structuredClone: true,
+			});
+			let serialized = packr.pack(set);
+			let deserialized = packr.unpack(serialized);
+			assert.equal(deserialized.constructor.name, 'Set');
+			let map = Array.from(deserialized)[0][3].map;
+			assert.equal(map.get(deserialized), deserialized);
+
+			let sizeTestMap = new Map();
+			for (let i = 0; i < 50; i++) {
+				sizeTestMap.set(i || sizeTestMap, sizeTestMap);
+				let deserialized = packr.unpack(packr.pack(sizeTestMap));
+				assert.equal(deserialized.size, i + 1);
+				assert(deserialized.has(deserialized));
+				assert(deserialized.has(i || deserialized));
+			}
+
+			let sizeTestSet = new Set();
+			for (let i = 0; i < 50; i++) {
+				sizeTestSet.add(i || sizeTestSet);
+				let deserialized = packr.unpack(packr.pack(sizeTestSet));
+				assert.equal(deserialized.size, i + 1);
+				assert(deserialized.has(deserialized));
+				assert(deserialized.has(i || deserialized));
+			}
+		});
+
+		test('structured cloning: types', function() {
+			let b = typeof Buffer != 'undefined' ? Buffer.alloc(20) : new Uint8Array(20);
+			let fa = new Float32Array(b.buffer, 8, 2);
+			fa[0] = 2.25;
+			fa[1] = 6;
+			let object = {
+				error: new Error('test'),
+				set: new Set(['a', 'b']),
+				regexp: /test/gi,
+				float32Array: fa,
+				uint16Array: new Uint16Array([3, 4]),
+				arrayBuffer: new Uint8Array([0xde, 0xad]).buffer,
+				dataView: new DataView(new Uint8Array([0xbe, 0xef]).buffer),
+			};
+			let packr = new Packr({
+				moreTypes: true,
+				structuredClone: true,
+			});
+			var serialized = packr.pack(object);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(Array.from(deserialized.set), Array.from(object.set));
+			assert.equal(deserialized.error.message, object.error.message);
+			assert.equal(deserialized.regexp.test('TEST'), true);
+			assert.equal(deserialized.float32Array.constructor.name, 'Float32Array');
+			assert.equal(deserialized.float32Array[0], 2.25);
+			assert.equal(deserialized.float32Array[1], 6);
+			assert.equal(deserialized.uint16Array.constructor.name, 'Uint16Array');
+			assert.equal(deserialized.uint16Array[0], 3);
+			assert.equal(deserialized.uint16Array[1], 4);
+			assert.equal(deserialized.arrayBuffer.constructor.name, 'ArrayBuffer');
+			assert.equal(new DataView(deserialized.arrayBuffer).getUint16(), 0xdead);
+			assert.equal(deserialized.dataView.constructor.name, 'DataView');
+			assert.equal(deserialized.dataView.getUint16(), 0xbeef);
+		});
+		test('big bundledStrings', function() {
+			const MSGPACK_OPTIONS = {bundleStrings: true};
+			const packer = new Packr(MSGPACK_OPTIONS);
+			const unpacker = new Unpackr(MSGPACK_OPTIONS);
+
+			const payload = {
+				output: [
+					{
+						url: 'https://www.example.com/',
+					},
+				],
+			};
+
+			for (let i = 0; i < 10000; i++) {
+				payload.output.push(payload.output[0]);
+			}
+			let deserialized = unpacker.unpack(packer.pack(payload));
+			assert.equal(deserialized.output[0].url, payload.output[0].url);
+		});
+		test('structured clone with bundled strings', function() {
+			const packer = new Packr({
+				structuredClone: true, // both options must be enabled
+				bundleStrings: true,
+			});
+
+			const v = {};
+
+			let shared = {
+				name1: v,
+				name2: v,
+			};
+
+			let deserialized = packer.unpack(packer.pack(shared));
+			assert.equal(deserialized.name1, deserialized.name2);
+
+			shared = {};
+			shared.aaaa = shared; // key length >= 4
+
+			deserialized = packer.unpack(packer.pack(shared));
+			assert.equal(deserialized.aaaa, deserialized);
+		});
+
+		test('object without prototype', function(){
+			var data = Object.create(null);
+			data.test = 3;
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+
+		test('object with __proto__', function(){
+			const data = { foo: 'bar', __proto__: { isAdmin: true } };
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, { foo: 'bar' });
+		});
+
+		test('separate instances', function() {
+			const packr = new Packr({
+				structures: [['m', 'e'], ['action', 'share']]
+			});
+			const packr2 = new Packr({
+				structures: [['m', 'e'], ['action', 'share']]
+			});
+			let packed = packr.pack([{m: 1, e: 2}, {action: 3, share: 4}]);
+			// also tried directly decoding this without the first Packr instance packed = new Uint8Array([0x92, 0x40, 0x01, 0x02, 0x41, 0x03, 0x04]);
+			console.log(packr2.unpack(packed));
+		});
+
+		test('many shared structures', function() {
+			let data = [];
+			for (let i = 0; i < 200; i++) {
+				data.push({['a' + i]: i});
+			}
+			let structures = [];
+			let savedStructures;
+			let packr = new Packr({
+				structures,
+				saveStructures(structures) {
+					savedStructures = structures;
+				}
+			});
+			var serializedWith32 = packr.pack(data);
+			assert.equal(savedStructures.length, 32);
+			var deserialized = packr.unpack(serializedWith32);
+			assert.deepEqual(deserialized, data);
+			structures = structures.slice(0, 32);
+			packr = new Packr({
+				structures,
+				maxSharedStructures: 100,
+				saveStructures(structures) {
+					savedStructures = structures;
+				}
+			});
+			deserialized = packr.unpack(serializedWith32);
+			assert.deepEqual(deserialized, data);
+			structures = structures.slice(0, 32);
+			packr = new Packr({
+				structures,
+				maxSharedStructures: 100,
+				saveStructures(structures) {
+					savedStructures = structures;
+				}
+			});
+			let serialized = packr.pack(data);
+			assert.equal(savedStructures.length, 100);
+			deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+
+			deserialized = packr.unpack(serializedWith32);
+			assert.deepEqual(deserialized, data);
+			assert.equal(savedStructures.length, 100);
+
+			deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			assert.equal(packr.structures.sharedLength, 100);
+		});
+		test('more shared structures', function() {
+			const structures = [];
+			for (let i = 0; i < 40; i++) {
+				structures.push(['a' + i]);
+			}
+			const structures2 = [...structures];
+			const packr = new Packr({
+				getStructures() {
+					return structures;
+				},
+				saveStructures(structures) {
+				},
+				maxSharedStructures: 100
+			});
+			const packr2 = new Packr({
+				getStructures() {
+					return structures2;
+				},
+				saveStructures(structures) {
+				},
+				maxSharedStructures: 100
+			});
+			const inputData = {a35: 35};
+			const buffer = packr.pack(inputData);
+			const outputData = packr2.decode(buffer);
+			assert.deepEqual(inputData, outputData);
+		});
+
+		test('big buffer', function() {
+			var size = 100000000;
+			var data = new Uint8Array(size).fill(1);
+			var packed = pack(data);
+			var unpacked = unpack(packed);
+			assert.equal(unpacked.length, size);
+		});
+
+		test('random strings', function(){
+			var data = [];
+			for (var i = 0; i < 2000; i++) {
+				var str = 'test';
+				while (Math.random() < 0.7 && str.length < 0x100000) {
+					str = str + String.fromCharCode(90/(Math.random() + 0.01)) + str;
+				}
+				data.push(str);
+			}
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+
+		test('map/date', function(){
+			var map = new Map();
+			map.set(4, 'four');
+			map.set('three', 3);
+
+
+			var data = {
+				map: map,
+				date: new Date(1532219539733),
+				farFutureDate: new Date(3532219539133),
+				fartherFutureDate: new Date('2106-08-05T18:48:20.323Z'),
+				ancient: new Date(-3532219539133),
+				invalidDate: new Date('invalid')
+			};
+			let packr = new Packr();
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.equal(deserialized.map.get(4), 'four');
+			assert.equal(deserialized.map.get('three'), 3);
+			assert.equal(deserialized.date.getTime(), 1532219539733);
+			assert.equal(deserialized.farFutureDate.getTime(), 3532219539133);
+			assert.equal(deserialized.fartherFutureDate.toISOString(), '2106-08-05T18:48:20.323Z');
+			assert.equal(deserialized.ancient.getTime(), -3532219539133);
+			assert.equal(deserialized.invalidDate.toString(), 'Invalid Date');
+		});
+		test('map/date with options', function(){
+			var map = new Map();
+			map.set(4, 'four');
+			map.set('three', 3);
+
+
+			var data = {
+				map: map,
+				date: new Date(1532219539011),
+				invalidDate: new Date('invalid')
+			};
+			let packr = new Packr({
+				mapsAsObjects: true,
+				useTimestamp32: true,
+				onInvalidDate: () => 'Custom invalid date'
+			});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.equal(deserialized.map[4], 'four');
+			assert.equal(deserialized.map.three, 3);
+			assert.equal(deserialized.date.getTime(), 1532219539000);
+			assert.equal(deserialized.invalidDate, 'Custom invalid date');
+		});
+		test('key caching', function() {
+			var data = {
+				foo: 2,
+				bar: 'test',
+				four: 4,
+				seven: 7,
+				foz: 3,
+			};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			// do multiple times to test caching
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('strings', function() {
+			var data = [''];
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			// do multiple times
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			data = 'decode this: ᾜ';
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			data = 'decode this that is longer but without any non-latin characters';
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('decimal float32', function() {
+			var data = {
+				a: 2.526,
+				b: 0.0035235,
+				c: 0.00000000000352501,
+				d: 3252.77,
+			};
+			let packr = new Packr({
+				useFloat32: DECIMAL_FIT
+			});
+			var serialized = packr.pack(data);
+			assert.equal(serialized.length, 32);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('int64/uint64 should be bigints by default', function() {
+			var data = {
+				a: 325283295382932843n
+			};
+
+			let packr = new Packr();
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized.a, 325283295382932843n);
+		});
+		test('bigint to float', function() {
+			var data = {
+				a: 325283295382932843n
+			};
+			let packr = new Packr({
+				int64AsType: 'number'
+			});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized.a, 325283295382932843);
+		});
+		test('int64AsNumber compatibility', function() {
+			// https://github.com/kriszyp/msgpackr/pull/85
+			var data = {
+				a: 325283295382932843n
+			};
+			let packr = new Packr({
+				int64AsNumber: true
+			});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized.a, 325283295382932843);
+		});
+		test('bigint to auto (float or bigint)', function() {
+			var data = {
+				a: -9007199254740993n,
+				b: -9007199254740992n,
+				c: 0n,
+				d: 9007199254740992n,
+				e: 9007199254740993n,
+			};
+			let packr = new Packr({
+				int64AsType: 'auto'
+			});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized.a, -9007199254740993n);
+			assert.deepEqual(deserialized.b, -9007199254740992);
+			assert.deepEqual(deserialized.c, 0);
+			assert.deepEqual(deserialized.d, 9007199254740992);
+			assert.deepEqual(deserialized.e, 9007199254740993n);
+		});
+		test('bigint to string', function() {
+			var data = {
+				a: 325283295382932843n,
+			};
+			let packr = new Packr({
+				int64AsType: 'string'
+			});
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized.a, '325283295382932843');
+		});
+		test('fixint should be one byte', function(){
+			let encoded = pack(123);
+			assert.equal(encoded.length, 1);
+		});
+		test('numbers', function(){
+			var data = {
+				bigEncodable: 48978578104322,
+				dateEpoch: 1530886513200,
+				realBig: 3432235352353255323,
+				decimal: 32.55234,
+				negative: -34.11,
+				exponential: 0.234e123,
+				tiny: 3.233e-120,
+				zero: 0,
+				//negativeZero: -0,
+				Infinity: Infinity
+			};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('bigint', function(){
+			var data = {
+				bigintSmall: 352n,
+				bigintSmallNegative: -333335252n,
+				bigintBig: 2n**64n - 1n, // biggest possible
+				bigintBigNegative: -(2n**63n), // largest negative
+				mixedWithNormal: 44,
+			};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+			var tooBigInt = {
+				tooBig: 2n**66n
+			};
+			assert.throws(function(){ serialized = pack(tooBigInt); });
+			let packr = new Packr({
+				largeBigIntToFloat: true
+			});
+			serialized = packr.pack(tooBigInt);
+			deserialized = unpack(serialized);
+			assert.isTrue(deserialized.tooBig > 2n**65n);
+
+			packr = new Packr({
+				largeBigIntToString: true
+			});
+			serialized = packr.pack(tooBigInt);
+			deserialized = unpack(serialized);
+			assert.equal(deserialized.tooBig, (2n**66n).toString());
+		});
+
+		test('roundFloat32', function() {
+			assert.equal(roundFloat32(0.00333000003), 0.00333);
+			assert.equal(roundFloat32(43.29999999993), 43.3);
+		});
+
+		test('buffers', function(){
+			var data = {
+				buffer1: new Uint8Array([2,3,4]),
+				buffer2: new Uint8Array(pack(sampleData))
+			};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+
+		test('notepack test', function() {
+			const data = {
+			  foo: 1,
+			  bar: [1, 2, 3, 4, 'abc', 'def'],
+			  foobar: {
+			    foo: true,
+			    bar: -2147483649,
+			    foobar: {
+			      foo: new Uint8Array([1, 2, 3, 4, 5]),
+			      bar: 1.5,
+			      foobar: [true, false, 'abcdefghijkmonpqrstuvwxyz']
+			    }
+			  }
+			};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			var deserialized = unpack(serialized);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+
+		test('arrays in map keys', function() {
+			const msgpackr = new Packr({ mapsAsObjects: true, allowArraysInMapKeys: true });
+
+			const map = new Map();
+			map.set([1, 2, 3], 1);
+			map.set([1, 2, ['foo', 3.14]], 2);
+
+			const packed = msgpackr.pack(map);
+			const unpacked = msgpackr.unpack(packed);
+			assert.deepEqual(unpacked, { '1,2,3': 1, '1,2,foo,3.14': 2 });
+		});
+
+		test('utf16 causing expansion', function() {
+			this.timeout(10000);
+			let data = {fixstr: 'ᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝ', str8:'ᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝ'};
+			var serialized = pack(data);
+			var deserialized = unpack(serialized);
+			assert.deepEqual(deserialized, data);
+		});
+		test('unpackMultiple', () => {
+			let values = unpackMultiple(new Uint8Array([1, 2, 3, 4]));
+			assert.deepEqual(values, [1, 2, 3, 4]);
+			values = [];
+			unpackMultiple(new Uint8Array([1, 2, 3, 4]), value => values.push(value));
+			assert.deepEqual(values, [1, 2, 3, 4]);
+		});
+
+		test('unpackMultiple with positions', () => {
+			let values = unpackMultiple(new Uint8Array([1, 2, 3, 4]));
+			assert.deepEqual(values, [1, 2, 3, 4]);
+			values = [];
+			unpackMultiple(new Uint8Array([1, 2, 3, 4]), (value,start,end) => values.push([value,start,end]));
+			assert.deepEqual(values, [[1,0,1], [2,1,2], [3,2,3], [4,3,4]]);
+		});
+
+		test('pack toJSON returning this', () => {
+			class Serializable {
+				someData = [1, 2, 3, 4];
+				toJSON() {
+					return this;
+				}
+			}
+			const serialized = pack(new Serializable);
+			const deserialized = unpack(serialized);
+			assert.deepStrictEqual(deserialized, { someData: [1, 2, 3, 4] });
+		});
+		test('skip values', function () {
+			var data = {
+				data: [
+					{ a: 1, name: 'one', type: 'odd', isOdd: true },
+					{ a: 2, name: 'two', type: 'even', isOdd: undefined },
+					{ a: 3, name: 'three', type: 'odd', isOdd: true },
+					{ a: 4, name: 'four', type: 'even', isOdd: null},
+					{ a: 5, name: 'five', type: 'odd', isOdd: true },
+					{ a: 6, name: 'six', type: 'even', isOdd: null }
+				],
+				description: 'some names',
+				types: ['odd', 'even'],
+				convertEnumToNum: [
+					{ prop: 'test' },
+					{ prop: 'test' },
+					{ prop: 'test' },
+					{ prop: 1 },
+					{ prop: 2 },
+					{ prop: [undefined, null] },
+					{ prop: null }
+				]
+			};
+			var expected = {
+				data: [
+					{ a: 1, name: 'one', type: 'odd', isOdd: true },
+					{ a: 2, name: 'two', type: 'even' },
+					{ a: 3, name: 'three', type: 'odd', isOdd: true },
+					{ a: 4, name: 'four', type: 'even', },
+					{ a: 5, name: 'five', type: 'odd', isOdd: true },
+					{ a: 6, name: 'six', type: 'even' }
+				],
+				description: 'some names',
+				types: ['odd', 'even'],
+				convertEnumToNum: [
+					{ prop: 'test' },
+					{ prop: 'test' },
+					{ prop: 'test' },
+					{ prop: 1 },
+					{ prop: 2 },
+					{ prop: [undefined, null] },
+					{}
+				]
+			};
+			let packr = new Packr({ useRecords: false, skipValues: [undefined, null] });
+			var serialized = packr.pack(data);
+			var deserialized = packr.unpack(serialized);
+			assert.deepEqual(deserialized, expected);
+		});
+	});
+	suite('msgpackr performance tests', function(){
+		test('performance JSON.parse', function() {
+			var data = sampleData;
+			this.timeout(10000);
+			var serialized = JSON.stringify(data);
+			console.log('JSON size', serialized.length);
+			for (var i = 0; i < ITERATIONS; i++) {
+				JSON.parse(serialized);
+			}
+		});
+		test('performance JSON.stringify', function() {
+			var data = sampleData;
+			this.timeout(10000);
+			for (var i = 0; i < ITERATIONS; i++) {
+				JSON.stringify(data);
+			}
+		});
+		test('performance unpack', function() {
+			var data = sampleData;
+			this.timeout(10000);
+			let structures = [];
+			var serialized = pack(data);
+			console.log('MessagePack size', serialized.length);
+			let packr = new Packr({ structures, bundleStrings: false });
+			var serialized = packr.pack(data);
+			console.log('msgpackr w/ record ext size', serialized.length);
+			for (var i = 0; i < ITERATIONS; i++) {
+				packr.unpack(serialized);
+			}
+		});
+		test('performance pack', function() {
+			var data = sampleData;
+			this.timeout(10000);
+			let structures = [];
+			let packr = new Packr({ structures, bundleStrings: false });
+			let buffer = typeof Buffer != 'undefined' ? Buffer.alloc(0x10000) : new Uint8Array(0x10000);
+
+			for (var i = 0; i < ITERATIONS; i++) {
+				//serialized = pack(data, { shared: sharedStructure })
+				packr.useBuffer(buffer);
+				packr.pack(data);
+				//var serializedGzip = deflateSync(serialized)
+			}
+			//console.log('serialized', serialized.length, global.propertyComparisons)
+		});
+	});
+
+})(chai, null, module, fs);
+//# sourceMappingURL=test.js.map
diff --git a/node_modules/msgpackr/dist/test.js.map b/node_modules/msgpackr/dist/test.js.map
new file mode 100644
index 0000000..861086d
--- /dev/null
+++ b/node_modules/msgpackr/dist/test.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"test.js","sources":["../unpack.js","../pack.js","../node-index.js","../tests/test.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n","import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';\nlet textEncoder;\ntry {\n\ttextEncoder = new TextEncoder();\n} catch (error) {}\nlet extensions, extensionClasses;\nconst hasNodeBuffer = typeof Buffer !== 'undefined';\nconst ByteArrayAllocate = hasNodeBuffer ?\n\tfunction(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;\nconst ByteArray = hasNodeBuffer ? Buffer : Uint8Array;\nconst MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;\nlet target, keysTarget;\nlet targetView;\nlet position = 0;\nlet safeEnd;\nlet bundledStrings = null;\nconst MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.\nconst hasNonLatin = /[\\u0080-\\uFFFF]/;\nexport const RECORD_SYMBOL = Symbol('record-id');\nexport class Packr extends Unpackr {\n\tconstructor(options) {\n\t\tsuper(options);\n\t\tthis.offset = 0;\n\t\tlet typeBuffer;\n\t\tlet start;\n\t\tlet hasSharedUpdate;\n\t\tlet structures;\n\t\tlet referenceMap;\n\t\tlet encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {\n\t\t\treturn target.utf8Write(string, position, target.byteLength - position);\n\t\t} : (textEncoder && textEncoder.encodeInto) ?\n\t\t\tfunction(string, position) {\n\t\t\t\treturn textEncoder.encodeInto(string, target.subarray(position)).written;\n\t\t\t} : false;\n\n\t\tlet packr = this;\n\t\tif (!options)\n\t\t\toptions = {};\n\t\tlet isSequential = options && options.sequential;\n\t\tlet hasSharedStructures = options.structures || options.saveStructures;\n\t\tlet maxSharedStructures = options.maxSharedStructures;\n\t\tif (maxSharedStructures == null)\n\t\t\tmaxSharedStructures = hasSharedStructures ? 32 : 0;\n\t\tif (maxSharedStructures > 8160)\n\t\t\tthrow new Error('Maximum maxSharedStructure is 8160');\n\t\tif (options.structuredClone && options.moreTypes == undefined) {\n\t\t\tthis.moreTypes = true;\n\t\t}\n\t\tlet maxOwnStructures = options.maxOwnStructures;\n\t\tif (maxOwnStructures == null)\n\t\t\tmaxOwnStructures = hasSharedStructures ? 32 : 64;\n\t\tif (!this.structures && options.useRecords != false)\n\t\t\tthis.structures = [];\n\t\t// two byte record ids for shared structures\n\t\tlet useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);\n\t\tlet sharedLimitId = maxSharedStructures + 0x40;\n\t\tlet maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;\n\t\tif (maxStructureId > 8256) {\n\t\t\tthrow new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');\n\t\t}\n\t\tlet recordIdsToRemove = [];\n\t\tlet transitionsCount = 0;\n\t\tlet serializationsSinceTransitionRebuild = 0;\n\n\t\tthis.pack = this.encode = function(value, encodeOptions) {\n\t\t\tif (!target) {\n\t\t\t\ttarget = new ByteArrayAllocate(8192);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));\n\t\t\t\tposition = 0;\n\t\t\t}\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tif (safeEnd - position < 0x800) {\n\t\t\t\t// don't start too close to the end,\n\t\t\t\ttarget = new ByteArrayAllocate(target.length);\n\t\t\t\ttargetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));\n\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\tposition = 0;\n\t\t\t} else\n\t\t\t\tposition = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster\n\t\t\tstart = position;\n\t\t\tif (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);\n\t\t\treferenceMap = packr.structuredClone ? new Map() : null;\n\t\t\tif (packr.bundleStrings && typeof value !== 'string') {\n\t\t\t\tbundledStrings = [];\n\t\t\t\tbundledStrings.size = Infinity; // force a new bundle start on first string\n\t\t\t} else\n\t\t\t\tbundledStrings = null;\n\t\t\tstructures = packr.structures;\n\t\t\tif (structures) {\n\t\t\t\tif (structures.uninitialized)\n\t\t\t\t\tstructures = packr._mergeStructures(packr.getStructures());\n\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\tif (sharedLength > maxSharedStructures) {\n\t\t\t\t\t//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids\n\t\t\t\t\tthrow new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);\n\t\t\t\t}\n\t\t\t\tif (!structures.transitions) {\n\t\t\t\t\t// rebuild our structure transitions\n\t\t\t\t\tstructures.transitions = Object.create(null);\n\t\t\t\t\tfor (let i = 0; i < sharedLength; i++) {\n\t\t\t\t\t\tlet keys = structures[i];\n\t\t\t\t\t\tif (!keys)\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\tlet nextTransition, transition = structures.transitions;\n\t\t\t\t\t\tfor (let j = 0, l = keys.length; j < l; j++) {\n\t\t\t\t\t\t\tlet key = keys[j];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttransition[RECORD_SYMBOL] = i + 0x40;\n\t\t\t\t\t}\n\t\t\t\t\tthis.lastNamedStructuresLength = sharedLength;\n\t\t\t\t}\n\t\t\t\tif (!isSequential) {\n\t\t\t\t\tstructures.nextId = sharedLength + 0x40;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (hasSharedUpdate)\n\t\t\t\thasSharedUpdate = false;\n\t\t\tlet encodingError;\n\t\t\ttry {\n\t\t\t\tif (packr._writeStruct && value && typeof value === 'object') {\n\t\t\t\t\tif (value.constructor === Object) writeStruct(value); // simple object\n\t\t\t\t\telse if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {\n\t\t\t\t\t\t// allow user classes, if they don't need special handling (but do use toJSON if available)\n\t\t\t\t\t\twriteStruct(value.toJSON ? value.toJSON() : value);\n\t\t\t\t\t} else pack(value);\n\t\t\t\t} else\n\t\t\t\t\tpack(value);\n\t\t\t\tlet lastBundle = bundledStrings;\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\twriteBundles(start, pack, 0);\n\t\t\t\tif (referenceMap && referenceMap.idsToInsert) {\n\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);\n\t\t\t\t\tlet i = idsToInsert.length;\n\t\t\t\t\tlet incrementPosition = -1;\n\t\t\t\t\twhile (lastBundle && i > 0) {\n\t\t\t\t\t\tlet insertionPoint = idsToInsert[--i].offset + start;\n\t\t\t\t\t\tif (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)\n\t\t\t\t\t\t\tincrementPosition = 0;\n\t\t\t\t\t\tif (insertionPoint > (lastBundle.position + start)) {\n\t\t\t\t\t\t\tif (incrementPosition >= 0)\n\t\t\t\t\t\t\t\tincrementPosition += 6;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (incrementPosition >= 0) {\n\t\t\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t\t\t\tincrementPosition = -1; // reset\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tlastBundle = lastBundle.previous;\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (incrementPosition >= 0 && lastBundle) {\n\t\t\t\t\t\t// update the bundle reference now\n\t\t\t\t\t\ttargetView.setUint32(lastBundle.position + start,\n\t\t\t\t\t\t\ttargetView.getUint32(lastBundle.position + start) + incrementPosition);\n\t\t\t\t\t}\n\t\t\t\t\tposition += idsToInsert.length * 6;\n\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\tpackr.offset = position;\n\t\t\t\t\tlet serialized = insertIds(target.subarray(start, position), idsToInsert);\n\t\t\t\t\treferenceMap = null;\n\t\t\t\t\treturn serialized;\n\t\t\t\t}\n\t\t\t\tpackr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially\n\t\t\t\tif (encodeOptions & REUSE_BUFFER_MODE) {\n\t\t\t\t\ttarget.start = start;\n\t\t\t\t\ttarget.end = position;\n\t\t\t\t\treturn target;\n\t\t\t\t}\n\t\t\t\treturn target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now\n\t\t\t} catch(error) {\n\t\t\t\tencodingError = error;\n\t\t\t\tthrow error;\n\t\t\t} finally {\n\t\t\t\tif (structures) {\n\t\t\t\t\tresetStructures();\n\t\t\t\t\tif (hasSharedUpdate && packr.saveStructures) {\n\t\t\t\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\t\t\t\t// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save\n\t\t\t\t\t\tlet returnBuffer = target.subarray(start, position);\n\t\t\t\t\t\tlet newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);\n\t\t\t\t\t\tif (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time\n\t\t\t\t\t\t\tif (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {\n\t\t\t\t\t\t\t\t// get updated structures and try again if the update failed\n\t\t\t\t\t\t\t\treturn packr.pack(value, encodeOptions);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tpackr.lastNamedStructuresLength = sharedLength;\n\t\t\t\t\t\t\t// don't keep large buffers around\n\t\t\t\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\t\t\t\treturn returnBuffer;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)\n\t\t\t\tif (target.length > 0x40000000) target = null;\n\t\t\t\tif (encodeOptions & RESET_BUFFER_MODE)\n\t\t\t\t\tposition = start;\n\t\t\t}\n\t\t};\n\t\tconst resetStructures = () => {\n\t\t\tif (serializationsSinceTransitionRebuild < 10)\n\t\t\t\tserializationsSinceTransitionRebuild++;\n\t\t\tlet sharedLength = structures.sharedLength || 0;\n\t\t\tif (structures.length > sharedLength && !isSequential)\n\t\t\t\tstructures.length = sharedLength;\n\t\t\tif (transitionsCount > 10000) {\n\t\t\t\t// force a rebuild occasionally after a lot of transitions so it can get cleaned up\n\t\t\t\tstructures.transitions = null;\n\t\t\t\tserializationsSinceTransitionRebuild = 0;\n\t\t\t\ttransitionsCount = 0;\n\t\t\t\tif (recordIdsToRemove.length > 0)\n\t\t\t\t\trecordIdsToRemove = [];\n\t\t\t} else if (recordIdsToRemove.length > 0 && !isSequential) {\n\t\t\t\tfor (let i = 0, l = recordIdsToRemove.length; i < l; i++) {\n\t\t\t\t\trecordIdsToRemove[i][RECORD_SYMBOL] = 0;\n\t\t\t\t}\n\t\t\t\trecordIdsToRemove = [];\n\t\t\t}\n\t\t};\n\t\tconst packArray = (value) => {\n\t\t\tvar length = value.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x90 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xdc;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdd;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\tpack(value[i]);\n\t\t\t}\n\t\t};\n\t\tconst pack = (value) => {\n\t\t\tif (position > safeEnd)\n\t\t\t\ttarget = makeRoom(position);\n\n\t\t\tvar type = typeof value;\n\t\t\tvar length;\n\t\t\tif (type === 'string') {\n\t\t\t\tlet strLength = value.length;\n\t\t\t\tif (bundledStrings && strLength >= 4 && strLength < 0x1000) {\n\t\t\t\t\tif ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {\n\t\t\t\t\t\tlet extStart;\n\t\t\t\t\t\tlet maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;\n\t\t\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\t\t\t\t\t\tlet lastBundle;\n\t\t\t\t\t\tif (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle\n\t\t\t\t\t\t\tlastBundle = bundledStrings;\n\t\t\t\t\t\t\ttarget[position] = 0xc8; // ext 16\n\t\t\t\t\t\t\tposition += 3; // reserve for the writing bundle size\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t\twriteBundles(start, pack, 0); // write the last bundles\n\t\t\t\t\t\t\ttargetView.setUint16(extStart + start - 3, position - start - extStart);\n\t\t\t\t\t\t} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x62; // 'b'\n\t\t\t\t\t\t\textStart = position - start;\n\t\t\t\t\t\t\tposition += 4; // reserve for writing bundle reference\n\t\t\t\t\t\t}\n\t\t\t\t\t\tbundledStrings = ['', '']; // create new ones\n\t\t\t\t\t\tbundledStrings.previous = lastBundle;\n\t\t\t\t\t\tbundledStrings.size = 0;\n\t\t\t\t\t\tbundledStrings.position = extStart;\n\t\t\t\t\t}\n\t\t\t\t\tlet twoByte = hasNonLatin.test(value);\n\t\t\t\t\tbundledStrings[twoByte ? 0 : 1] += value;\n\t\t\t\t\ttarget[position++] = 0xc1;\n\t\t\t\t\tpack(twoByte ? -strLength : strLength);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tlet headerSize;\n\t\t\t\t// first we estimate the header size, so we can write to the correct location\n\t\t\t\tif (strLength < 0x20) {\n\t\t\t\t\theaderSize = 1;\n\t\t\t\t} else if (strLength < 0x100) {\n\t\t\t\t\theaderSize = 2;\n\t\t\t\t} else if (strLength < 0x10000) {\n\t\t\t\t\theaderSize = 3;\n\t\t\t\t} else {\n\t\t\t\t\theaderSize = 5;\n\t\t\t\t}\n\t\t\t\tlet maxBytes = strLength * 3;\n\t\t\t\tif (position + maxBytes > safeEnd)\n\t\t\t\t\ttarget = makeRoom(position + maxBytes);\n\n\t\t\t\tif (strLength < 0x40 || !encodeUtf8) {\n\t\t\t\t\tlet i, c1, c2, strPosition = position + headerSize;\n\t\t\t\t\tfor (i = 0; i < strLength; i++) {\n\t\t\t\t\t\tc1 = value.charCodeAt(i);\n\t\t\t\t\t\tif (c1 < 0x80) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1;\n\t\t\t\t\t\t} else if (c1 < 0x800) {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 | 0xc0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else if (\n\t\t\t\t\t\t\t(c1 & 0xfc00) === 0xd800 &&\n\t\t\t\t\t\t\t((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tc1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 18 | 0xf0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 12 | 0xe0;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 >> 6 & 0x3f | 0x80;\n\t\t\t\t\t\t\ttarget[strPosition++] = c1 & 0x3f | 0x80;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tlength = strPosition - position - headerSize;\n\t\t\t\t} else {\n\t\t\t\t\tlength = encodeUtf8(value, position + headerSize);\n\t\t\t\t}\n\n\t\t\t\tif (length < 0x20) {\n\t\t\t\t\ttarget[position++] = 0xa0 | length;\n\t\t\t\t} else if (length < 0x100) {\n\t\t\t\t\tif (headerSize < 2) {\n\t\t\t\t\t\ttarget.copyWithin(position + 2, position + 1, position + 1 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xd9;\n\t\t\t\t\ttarget[position++] = length;\n\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\tif (headerSize < 3) {\n\t\t\t\t\t\ttarget.copyWithin(position + 3, position + 2, position + 2 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xda;\n\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t} else {\n\t\t\t\t\tif (headerSize < 5) {\n\t\t\t\t\t\ttarget.copyWithin(position + 5, position + 3, position + 3 + length);\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xdb;\n\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\tposition += 4;\n\t\t\t\t}\n\t\t\t\tposition += length;\n\t\t\t} else if (type === 'number') {\n\t\t\t\tif (value >>> 0 === value) {// positive integer, 32-bit or less\n\t\t\t\t\t// positive uint\n\t\t\t\t\tif (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x100) {\n\t\t\t\t\t\ttarget[position++] = 0xcc;\n\t\t\t\t\t\ttarget[position++] = value;\n\t\t\t\t\t} else if (value < 0x10000) {\n\t\t\t\t\t\ttarget[position++] = 0xcd;\n\t\t\t\t\t\ttarget[position++] = value >> 8;\n\t\t\t\t\t\ttarget[position++] = value & 0xff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xce;\n\t\t\t\t\t\ttargetView.setUint32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else if (value >> 0 === value) { // negative integer\n\t\t\t\t\tif (value >= -0x20) {\n\t\t\t\t\t\ttarget[position++] = 0x100 + value;\n\t\t\t\t\t} else if (value >= -0x80) {\n\t\t\t\t\t\ttarget[position++] = 0xd0;\n\t\t\t\t\t\ttarget[position++] = value + 0x100;\n\t\t\t\t\t} else if (value >= -0x8000) {\n\t\t\t\t\t\ttarget[position++] = 0xd1;\n\t\t\t\t\t\ttargetView.setInt16(position, value);\n\t\t\t\t\t\tposition += 2;\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttarget[position++] = 0xd2;\n\t\t\t\t\t\ttargetView.setInt32(position, value);\n\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet useFloat32;\n\t\t\t\t\tif ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {\n\t\t\t\t\t\ttarget[position++] = 0xca;\n\t\t\t\t\t\ttargetView.setFloat32(position, value);\n\t\t\t\t\t\tlet xShifted;\n\t\t\t\t\t\tif (useFloat32 < 4 ||\n\t\t\t\t\t\t\t\t// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\t\t\t\t((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\tposition--; // move back into position for writing a double\n\t\t\t\t\t}\n\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\ttargetView.setFloat64(position, value);\n\t\t\t\t\tposition += 8;\n\t\t\t\t}\n\t\t\t} else if (type === 'object' || type === 'function') {\n\t\t\t\tif (!value)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\tif (referenceMap) {\n\t\t\t\t\t\tlet referee = referenceMap.get(value);\n\t\t\t\t\t\tif (referee) {\n\t\t\t\t\t\t\tif (!referee.id) {\n\t\t\t\t\t\t\t\tlet idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);\n\t\t\t\t\t\t\t\treferee.id = idsToInsert.push(referee);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttarget[position++] = 0xd6; // fixext 4\n\t\t\t\t\t\t\ttarget[position++] = 0x70; // \"p\" for pointer\n\t\t\t\t\t\t\ttargetView.setUint32(position, referee.id);\n\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treferenceMap.set(value, { offset: position - start });\n\t\t\t\t\t}\n\t\t\t\t\tlet constructor = value.constructor;\n\t\t\t\t\tif (constructor === Object) {\n\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t} else if (constructor === Array) {\n\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t} else if (constructor === Map) {\n\t\t\t\t\t\tif (this.mapAsEmptyObject) target[position++] = 0x80;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tlength = value.size;\n\t\t\t\t\t\t\tif (length < 0x10) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t\t\t\t\t} else if (length < 0x10000) {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\t\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\t\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\t\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\t\t\t\t\tposition += 4;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tfor (let [key, entryValue] of value) {\n\t\t\t\t\t\t\t\tpack(key);\n\t\t\t\t\t\t\t\tpack(entryValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfor (let i = 0, l = extensions.length; i < l; i++) {\n\t\t\t\t\t\t\tlet extensionClass = extensionClasses[i];\n\t\t\t\t\t\t\tif (value instanceof extensionClass) {\n\t\t\t\t\t\t\t\tlet extension = extensions[i];\n\t\t\t\t\t\t\t\tif (extension.write) {\n\t\t\t\t\t\t\t\t\tif (extension.type) {\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0xd4; // one byte \"tag\" extension\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = extension.type;\n\t\t\t\t\t\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tlet writeResult = extension.write.call(this, value);\n\t\t\t\t\t\t\t\t\tif (writeResult === value) { // avoid infinite recursion\n\t\t\t\t\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tpack(writeResult);\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tlet currentTarget = target;\n\t\t\t\t\t\t\t\tlet currentTargetView = targetView;\n\t\t\t\t\t\t\t\tlet currentPosition = position;\n\t\t\t\t\t\t\t\ttarget = null;\n\t\t\t\t\t\t\t\tlet result;\n\t\t\t\t\t\t\t\ttry {\n\t\t\t\t\t\t\t\t\tresult = extension.pack.call(this, value, (size) => {\n\t\t\t\t\t\t\t\t\t\t// restore target and use it\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\tcurrentTarget = null;\n\t\t\t\t\t\t\t\t\t\tposition += size;\n\t\t\t\t\t\t\t\t\t\tif (position > safeEnd)\n\t\t\t\t\t\t\t\t\t\t\tmakeRoom(position);\n\t\t\t\t\t\t\t\t\t\treturn {\n\t\t\t\t\t\t\t\t\t\t\ttarget, targetView, position: position - size\n\t\t\t\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\t\t\t}, pack);\n\t\t\t\t\t\t\t\t} finally {\n\t\t\t\t\t\t\t\t\t// restore current target information (unless already restored)\n\t\t\t\t\t\t\t\t\tif (currentTarget) {\n\t\t\t\t\t\t\t\t\t\ttarget = currentTarget;\n\t\t\t\t\t\t\t\t\t\ttargetView = currentTargetView;\n\t\t\t\t\t\t\t\t\t\tposition = currentPosition;\n\t\t\t\t\t\t\t\t\t\tsafeEnd = target.length - 10;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (result) {\n\t\t\t\t\t\t\t\t\tif (result.length + position > safeEnd)\n\t\t\t\t\t\t\t\t\t\tmakeRoom(result.length + position);\n\t\t\t\t\t\t\t\t\tposition = writeExtensionData(result, target, position, extension.type);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// check isArray after extensions, because extensions can extend Array\n\t\t\t\t\t\tif (Array.isArray(value)) {\n\t\t\t\t\t\t\tpackArray(value);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// use this as an alternate mechanism for expressing how to serialize\n\t\t\t\t\t\t\tif (value.toJSON) {\n\t\t\t\t\t\t\t\tconst json = value.toJSON();\n\t\t\t\t\t\t\t\t// if for some reason value.toJSON returns itself it'll loop forever\n\t\t\t\t\t\t\t\tif (json !== value)\n\t\t\t\t\t\t\t\t\treturn pack(json);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// if there is a writeFunction, use it, otherwise just encode as undefined\n\t\t\t\t\t\t\tif (type === 'function')\n\t\t\t\t\t\t\t\treturn pack(this.writeFunction && this.writeFunction(value));\n\n\t\t\t\t\t\t\t// no extension found, write as plain object\n\t\t\t\t\t\t\twriteObject(value);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else if (type === 'boolean') {\n\t\t\t\ttarget[position++] = value ? 0xc3 : 0xc2;\n\t\t\t} else if (type === 'bigint') {\n\t\t\t\tif (value < 0x8000000000000000 && value >= -0x8000000000000000) {\n\t\t\t\t\t// use a signed int as long as it fits\n\t\t\t\t\ttarget[position++] = 0xd3;\n\t\t\t\t\ttargetView.setBigInt64(position, value);\n\t\t\t\t} else if (value < 0x10000000000000000 && value > 0) {\n\t\t\t\t\t// if we can fit an unsigned int, use that\n\t\t\t\t\ttarget[position++] = 0xcf;\n\t\t\t\t\ttargetView.setBigUint64(position, value);\n\t\t\t\t} else {\n\t\t\t\t\t// overflow\n\t\t\t\t\tif (this.largeBigIntToFloat) {\n\t\t\t\t\t\ttarget[position++] = 0xcb;\n\t\t\t\t\t\ttargetView.setFloat64(position, Number(value));\n\t\t\t\t\t} else if (this.largeBigIntToString) {\n\t\t\t\t\t\treturn pack(value.toString());\n\t\t\t\t\t} else if (this.useBigIntExtension || this.moreTypes) {\n\t\t\t\t\t\tlet empty = value < 0 ? BigInt(-1) : BigInt(0);\n\n\t\t\t\t\t\tlet array;\n\t\t\t\t\t\tif (value >> BigInt(0x10000) === empty) {\n\t\t\t\t\t\t\tlet mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow\n\t\t\t\t\t\t\tlet chunks = [];\n\t\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\t\tchunks.push(value & mask);\n\t\t\t\t\t\t\t\tif ((value >> BigInt(63)) === empty) break;\n\t\t\t\t\t\t\t\tvalue >>= BigInt(64);\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tarray = new Uint8Array(new BigUint64Array(chunks).buffer);\n\t\t\t\t\t\t\tarray.reverse();\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tlet invert = value < 0;\n\t\t\t\t\t\t\tlet string = (invert ? ~value : value).toString(16);\n\t\t\t\t\t\t\tif (string.length % 2) {\n\t\t\t\t\t\t\t\tstring = '0' + string;\n\t\t\t\t\t\t\t} else if (parseInt(string.charAt(0), 16) >= 8) {\n\t\t\t\t\t\t\t\tstring = '00' + string;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (hasNodeBuffer) {\n\t\t\t\t\t\t\t\tarray = Buffer.from(string, 'hex');\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tarray = new Uint8Array(string.length / 2);\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) {\n\t\t\t\t\t\t\t\t\tarray[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tif (invert) {\n\t\t\t\t\t\t\t\tfor (let i = 0; i < array.length; i++) array[i] = ~array[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (array.length + position > safeEnd)\n\t\t\t\t\t\t\tmakeRoom(array.length + position);\n\t\t\t\t\t\tposition = writeExtensionData(array, target, position, 0x42);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +\n\t\t\t\t\t\t\t' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +\n\t\t\t\t\t\t\t' largeBigIntToString to convert to string');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tposition += 8;\n\t\t\t} else if (type === 'undefined') {\n\t\t\t\tif (this.encodeUndefinedAsNil)\n\t\t\t\t\ttarget[position++] = 0xc0;\n\t\t\t\telse {\n\t\t\t\t\ttarget[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t\ttarget[position++] = 0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tthrow new Error('Unknown type: ' + type);\n\t\t\t}\n\t\t};\n\n\t\tconst writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {\n\t\t\t// this method is slightly slower, but generates \"preferred serialization\" (optimally small for smaller objects)\n\t\t\tlet keys;\n\t\t\tif (this.skipValues) {\n\t\t\t\tkeys = [];\n\t\t\t\tfor (let key in object) {\n\t\t\t\t\tif ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&\n\t\t\t\t\t\t!this.skipValues.includes(object[key]))\n\t\t\t\t\t\tkeys.push(key);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tkeys = Object.keys(object);\n\t\t\t}\n\t\t\tlet length = keys.length;\n\t\t\tif (length < 0x10) {\n\t\t\t\ttarget[position++] = 0x80 | length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xde;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xdf;\n\t\t\t\ttargetView.setUint32(position, length);\n\t\t\t\tposition += 4;\n\t\t\t}\n\t\t\tlet key;\n\t\t\tif (this.coercibleKeyAsNumber) {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tkey = keys[i];\n\t\t\t\t\tlet num = Number(key);\n\t\t\t\t\tpack(isNaN(num) ? key : num);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\tfor (let i = 0; i < length; i++) {\n\t\t\t\t\tpack(key = keys[i]);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\ttarget[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards\n\t\t\tlet objectOffset = position - start;\n\t\t\tposition += 2;\n\t\t\tlet size = 0;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(key);\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t\tsize++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (size > 0xffff) {\n\t\t\t\tthrow new Error('Object is too large to serialize with fast 16-bit map size,' +\n\t\t\t\t' use the \"variableMapSize\" option to serialize this object');\n\t\t\t}\n\t\t\ttarget[objectOffset++ + start] = size >> 8;\n\t\t\ttarget[objectOffset + start] = size & 0xff;\n\t\t};\n\n\t\tconst writeRecord = this.useRecords === false ? writePlainObject :\n\t\t(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet objectOffset = position++ - start;\n\t\t\tlet wroteKeys;\n\t\t\tfor (let key in object) {\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\tif (nextTransition)\n\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\telse {\n\t\t\t\t\t\t// record doesn't exist, create full new record and insert it\n\t\t\t\t\t\tlet keys = Object.keys(object);\n\t\t\t\t\t\tlet lastTransition = transition;\n\t\t\t\t\t\ttransition = structures.transitions;\n\t\t\t\t\t\tlet newTransitions = 0;\n\t\t\t\t\t\tfor (let i = 0, l = keys.length; i < l; i++) {\n\t\t\t\t\t\t\tlet key = keys[i];\n\t\t\t\t\t\t\tnextTransition = transition[key];\n\t\t\t\t\t\t\tif (!nextTransition) {\n\t\t\t\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\t\t\t\tnewTransitions++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\ttransition = nextTransition;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (objectOffset + start + 1 == position) {\n\t\t\t\t\t\t\t// first key, so we don't need to insert, we can just write record directly\n\t\t\t\t\t\t\tposition--;\n\t\t\t\t\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\t\t\t\t} else // otherwise we need to insert the record, moving existing data after the record\n\t\t\t\t\t\t\tinsertNewRecord(transition, keys, objectOffset, newTransitions);\n\t\t\t\t\t\twroteKeys = true;\n\t\t\t\t\t\ttransition = lastTransition[key];\n\t\t\t\t\t}\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!wroteKeys) {\n\t\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\t\tif (recordId)\n\t\t\t\t\ttarget[objectOffset + start] = recordId;\n\t\t\t\telse\n\t\t\t\t\tinsertNewRecord(transition, Object.keys(object), objectOffset, 0);\n\t\t\t}\n\t\t} :\n\t\t(object) => {\n\t\t\tlet nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));\n\t\t\tlet newTransitions = 0;\n\t\t\tfor (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\tnextTransition = transition[key];\n\t\t\t\tif (!nextTransition) {\n\t\t\t\t\tnextTransition = transition[key] = Object.create(null);\n\t\t\t\t\tnewTransitions++;\n\t\t\t\t}\n\t\t\t\ttransition = nextTransition;\n\t\t\t}\n\t\t\tlet recordId = transition[RECORD_SYMBOL];\n\t\t\tif (recordId) {\n\t\t\t\tif (recordId >= 0x60 && useTwoByteRecords) {\n\t\t\t\t\ttarget[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = recordId >> 5;\n\t\t\t\t} else\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t} else {\n\t\t\t\tnewRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);\n\t\t\t}\n\t\t\t// now write the values\n\t\t\tfor (let key in object)\n\t\t\t\tif (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {\n\t\t\t\t\tpack(object[key]);\n\t\t\t\t}\n\t\t};\n\n\t\t// create reference to useRecords if useRecords is a function\n\t\tconst checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;\n\n\t\tconst writeObject = checkUseRecords ? (object) => {\n\t\t\tcheckUseRecords(object) ? writeRecord(object) : writePlainObject(object);\n\t\t} : writeRecord;\n\n\t\tconst writeStruct = (object) => {\n\t\t\tlet newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {\n\t\t\t\tif (notifySharedUpdate)\n\t\t\t\t\treturn hasSharedUpdate = true;\n\t\t\t\tposition = newPosition;\n\t\t\t\tlet startTarget = target;\n\t\t\t\tpack(value);\n\t\t\t\tresetStructures();\n\t\t\t\tif (startTarget !== target) {\n\t\t\t\t\treturn { position, targetView, target }; // indicate the buffer was re-allocated\n\t\t\t\t}\n\t\t\t\treturn position;\n\t\t\t});\n\t\t\tif (newPosition === 0) // bail and go to a msgpack object\n\t\t\t\treturn writeObject(object);\n\t\t\tposition = newPosition;\n\t\t};\n\n\t\tconst makeRoom = (end) => {\n\t\t\tlet newSize;\n\t\t\tif (end > 0x1000000) {\n\t\t\t\t// special handling for really large buffers\n\t\t\t\tif ((end - start) > MAX_BUFFER_SIZE)\n\t\t\t\t\tthrow new Error('Packed buffer would be larger than maximum buffer size');\n\t\t\t\tnewSize = Math.min(MAX_BUFFER_SIZE,\n\t\t\t\t\tMath.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);\n\t\t\t} else // faster handling for smaller buffers\n\t\t\t\tnewSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;\n\t\t\tlet newBuffer = new ByteArrayAllocate(newSize);\n\t\t\ttargetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));\n\t\t\tend = Math.min(end, target.length);\n\t\t\tif (target.copy)\n\t\t\t\ttarget.copy(newBuffer, 0, start, end);\n\t\t\telse\n\t\t\t\tnewBuffer.set(target.slice(start, end));\n\t\t\tposition -= start;\n\t\t\tstart = 0;\n\t\t\tsafeEnd = newBuffer.length - 10;\n\t\t\treturn target = newBuffer;\n\t\t};\n\t\tconst newRecord = (transition, keys, newTransitions) => {\n\t\t\tlet recordId = structures.nextId;\n\t\t\tif (!recordId)\n\t\t\t\trecordId = 0x40;\n\t\t\tif (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {\n\t\t\t\trecordId = structures.nextOwnId;\n\t\t\t\tif (!(recordId < maxStructureId))\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextOwnId = recordId + 1;\n\t\t\t} else {\n\t\t\t\tif (recordId >= maxStructureId)// cycle back around\n\t\t\t\t\trecordId = sharedLimitId;\n\t\t\t\tstructures.nextId = recordId + 1;\n\t\t\t}\n\t\t\tlet highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;\n\t\t\ttransition[RECORD_SYMBOL] = recordId;\n\t\t\ttransition.__keys__ = keys;\n\t\t\tstructures[recordId - 0x40] = keys;\n\n\t\t\tif (recordId < sharedLimitId) {\n\t\t\t\tkeys.isShared = true;\n\t\t\t\tstructures.sharedLength = recordId - 0x3f;\n\t\t\t\thasSharedUpdate = true;\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (highByte >= 0) {\n\t\t\t\t\ttarget[position++] = 0xd5; // fixext 2\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = (recordId & 0x1f) + 0x60;\n\t\t\t\t\ttarget[position++] = highByte;\n\t\t\t\t} else {\n\t\t\t\t\ttarget[position++] = 0xd4; // fixext 1\n\t\t\t\t\ttarget[position++] = 0x72; // \"r\" record defintion extension type\n\t\t\t\t\ttarget[position++] = recordId;\n\t\t\t\t}\n\n\t\t\t\tif (newTransitions)\n\t\t\t\t\ttransitionsCount += serializationsSinceTransitionRebuild * newTransitions;\n\t\t\t\t// record the removal of the id, we can maintain our shared structure\n\t\t\t\tif (recordIdsToRemove.length >= maxOwnStructures)\n\t\t\t\t\trecordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones\n\t\t\t\trecordIdsToRemove.push(transition);\n\t\t\t\tpack(keys);\n\t\t\t}\n\t\t};\n\t\tconst insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {\n\t\t\tlet mainTarget = target;\n\t\t\tlet mainPosition = position;\n\t\t\tlet mainSafeEnd = safeEnd;\n\t\t\tlet mainStart = start;\n\t\t\ttarget = keysTarget;\n\t\t\tposition = 0;\n\t\t\tstart = 0;\n\t\t\tif (!target)\n\t\t\t\tkeysTarget = target = new ByteArrayAllocate(8192);\n\t\t\tsafeEnd = target.length - 10;\n\t\t\tnewRecord(transition, keys, newTransitions);\n\t\t\tkeysTarget = target;\n\t\t\tlet keysPosition = position;\n\t\t\ttarget = mainTarget;\n\t\t\tposition = mainPosition;\n\t\t\tsafeEnd = mainSafeEnd;\n\t\t\tstart = mainStart;\n\t\t\tif (keysPosition > 1) {\n\t\t\t\tlet newEnd = position + keysPosition - 1;\n\t\t\t\tif (newEnd > safeEnd)\n\t\t\t\t\tmakeRoom(newEnd);\n\t\t\t\tlet insertionPosition = insertionOffset + start;\n\t\t\t\ttarget.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);\n\t\t\t\ttarget.set(keysTarget.slice(0, keysPosition), insertionPosition);\n\t\t\t\tposition = newEnd;\n\t\t\t} else {\n\t\t\t\ttarget[insertionOffset + start] = keysTarget[0];\n\t\t\t}\n\t\t};\n\t}\n\tuseBuffer(buffer) {\n\t\t// this means we are finished using our own buffer and we can write over it safely\n\t\ttarget = buffer;\n\t\ttarget.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));\n\t\ttargetView = target.dataView;\n\t\tposition = 0;\n\t}\n\tset position (value) {\n\t\tposition = value;\n\t}\n\tget position() {\n\t\treturn position;\n\t}\n\tclearSharedData() {\n\t\tif (this.structures)\n\t\t\tthis.structures = [];\n\t\tif (this.typedStructs)\n\t\t\tthis.typedStructs = [];\n\t}\n}\n\nextensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];\nextensions = [{\n\tpack(date, allocateForWrite, pack) {\n\t\tlet seconds = date.getTime() / 1000;\n\t\tif ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 32\n\t\t\tlet { target, targetView, position} = allocateForWrite(6);\n\t\t\ttarget[position++] = 0xd6;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, seconds);\n\t\t} else if (seconds > 0 && seconds < 0x100000000) {\n\t\t\t// Timestamp 64\n\t\t\tlet { target, targetView, position} = allocateForWrite(10);\n\t\t\ttarget[position++] = 0xd7;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));\n\t\t\ttargetView.setUint32(position + 4, seconds);\n\t\t} else if (isNaN(seconds)) {\n\t\t\tif (this.onInvalidDate) {\n\t\t\t\tallocateForWrite(0);\n\t\t\t\treturn pack(this.onInvalidDate());\n\t\t\t}\n\t\t\t// Intentionally invalid timestamp\n\t\t\tlet { target, targetView, position} = allocateForWrite(3);\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttarget[position++] = 0xff;\n\t\t} else {\n\t\t\t// Timestamp 96\n\t\t\tlet { target, targetView, position} = allocateForWrite(15);\n\t\t\ttarget[position++] = 0xc7;\n\t\t\ttarget[position++] = 12;\n\t\t\ttarget[position++] = 0xff;\n\t\t\ttargetView.setUint32(position, date.getMilliseconds() * 1000000);\n\t\t\ttargetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));\n\t\t}\n\t}\n}, {\n\tpack(set, allocateForWrite, pack) {\n\t\tif (this.setAsEmptyObject) {\n\t\t\tallocateForWrite(0);\n\t\t\treturn pack({});\n\t\t}\n\t\tlet array = Array.from(set);\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x73; // 's' for Set\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack(array);\n\t}\n}, {\n\tpack(error, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x65; // 'e' for error\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ error.name, error.message, error.cause ]);\n\t}\n}, {\n\tpack(regex, allocateForWrite, pack) {\n\t\tlet { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);\n\t\tif (this.moreTypes) {\n\t\t\ttarget[position++] = 0xd4;\n\t\t\ttarget[position++] = 0x78; // 'x' for regeXp\n\t\t\ttarget[position++] = 0;\n\t\t}\n\t\tpack([ regex.source, regex.flags ]);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x10, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(typedArray, allocateForWrite) {\n\t\tlet constructor = typedArray.constructor;\n\t\tif (constructor !== ByteArray && this.moreTypes)\n\t\t\twriteExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(typedArray, allocateForWrite);\n\t}\n}, {\n\tpack(arrayBuffer, allocateForWrite) {\n\t\tif (this.moreTypes)\n\t\t\twriteExtBuffer(arrayBuffer, 0x11, allocateForWrite);\n\t\telse\n\t\t\twriteBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);\n\t}\n}, {\n\tpack(c1, allocateForWrite) { // specific 0xC1 object\n\t\tlet { target, position} = allocateForWrite(1);\n\t\ttarget[position] = 0xc1;\n\t}\n}];\n\nfunction writeExtBuffer(typedArray, type, allocateForWrite, encode) {\n\tlet length = typedArray.byteLength;\n\tif (length + 1 < 0x100) {\n\t\tvar { target, position } = allocateForWrite(4 + length);\n\t\ttarget[position++] = 0xc7;\n\t\ttarget[position++] = length + 1;\n\t} else if (length + 1 < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(5 + length);\n\t\ttarget[position++] = 0xc8;\n\t\ttarget[position++] = (length + 1) >> 8;\n\t\ttarget[position++] = (length + 1) & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(7 + length);\n\t\ttarget[position++] = 0xc9;\n\t\ttargetView.setUint32(position, length + 1); // plus one for the type byte\n\t\tposition += 4;\n\t}\n\ttarget[position++] = 0x74; // \"t\" for typed array\n\ttarget[position++] = type;\n\tif (!typedArray.buffer) typedArray = new Uint8Array(typedArray);\n\ttarget.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);\n}\nfunction writeBuffer(buffer, allocateForWrite) {\n\tlet length = buffer.byteLength;\n\tvar target, position;\n\tif (length < 0x100) {\n\t\tvar { target, position } = allocateForWrite(length + 2);\n\t\ttarget[position++] = 0xc4;\n\t\ttarget[position++] = length;\n\t} else if (length < 0x10000) {\n\t\tvar { target, position } = allocateForWrite(length + 3);\n\t\ttarget[position++] = 0xc5;\n\t\ttarget[position++] = length >> 8;\n\t\ttarget[position++] = length & 0xff;\n\t} else {\n\t\tvar { target, position, targetView } = allocateForWrite(length + 5);\n\t\ttarget[position++] = 0xc6;\n\t\ttargetView.setUint32(position, length);\n\t\tposition += 4;\n\t}\n\ttarget.set(buffer, position);\n}\n\nfunction writeExtensionData(result, target, position, type) {\n\tlet length = result.length;\n\tswitch (length) {\n\t\tcase 1:\n\t\t\ttarget[position++] = 0xd4;\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\ttarget[position++] = 0xd5;\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\ttarget[position++] = 0xd6;\n\t\t\tbreak;\n\t\tcase 8:\n\t\t\ttarget[position++] = 0xd7;\n\t\t\tbreak;\n\t\tcase 16:\n\t\t\ttarget[position++] = 0xd8;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (length < 0x100) {\n\t\t\t\ttarget[position++] = 0xc7;\n\t\t\t\ttarget[position++] = length;\n\t\t\t} else if (length < 0x10000) {\n\t\t\t\ttarget[position++] = 0xc8;\n\t\t\t\ttarget[position++] = length >> 8;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t} else {\n\t\t\t\ttarget[position++] = 0xc9;\n\t\t\t\ttarget[position++] = length >> 24;\n\t\t\t\ttarget[position++] = (length >> 16) & 0xff;\n\t\t\t\ttarget[position++] = (length >> 8) & 0xff;\n\t\t\t\ttarget[position++] = length & 0xff;\n\t\t\t}\n\t}\n\ttarget[position++] = type;\n\ttarget.set(result, position);\n\tposition += length;\n\treturn position;\n}\n\nfunction insertIds(serialized, idsToInsert) {\n\t// insert the ids that need to be referenced for structured clones\n\tlet nextId;\n\tlet distanceToMove = idsToInsert.length * 6;\n\tlet lastEnd = serialized.length - distanceToMove;\n\twhile (nextId = idsToInsert.pop()) {\n\t\tlet offset = nextId.offset;\n\t\tlet id = nextId.id;\n\t\tserialized.copyWithin(offset + distanceToMove, offset, lastEnd);\n\t\tdistanceToMove -= 6;\n\t\tlet position = offset + distanceToMove;\n\t\tserialized[position++] = 0xd6;\n\t\tserialized[position++] = 0x69; // 'i'\n\t\tserialized[position++] = id >> 24;\n\t\tserialized[position++] = (id >> 16) & 0xff;\n\t\tserialized[position++] = (id >> 8) & 0xff;\n\t\tserialized[position++] = id & 0xff;\n\t\tlastEnd = offset;\n\t}\n\treturn serialized;\n}\n\nfunction writeBundles(start, pack, incrementPosition) {\n\tif (bundledStrings.length > 0) {\n\t\ttargetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);\n\t\tbundledStrings.stringsPosition = position - start;\n\t\tlet writeStrings = bundledStrings;\n\t\tbundledStrings = null;\n\t\tpack(writeStrings[0]);\n\t\tpack(writeStrings[1]);\n\t}\n}\n\nexport function addExtension(extension) {\n\tif (extension.Class) {\n\t\tif (!extension.pack && !extension.write)\n\t\t\tthrow new Error('Extension has no pack or write function');\n\t\tif (extension.pack && !extension.type)\n\t\t\tthrow new Error('Extension has no type (numeric code to identify the extension)');\n\t\textensionClasses.unshift(extension.Class);\n\t\textensions.unshift(extension);\n\t}\n\tunpackAddExtension(extension);\n}\nfunction prepareStructures(structures, packr) {\n\tstructures.isCompatible = (existingStructures) => {\n\t\tlet compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);\n\t\tif (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction\n\t\t\tpackr._mergeStructures(existingStructures);\n\t\treturn compatible;\n\t};\n\treturn structures;\n}\n\n// Marker for downstream libraries (e.g. structon) to detect that this Packr\n// supports per-instance struct-encoding hooks (this._writeStruct,\n// this._prepareStructures).  See `pack` for the dispatch.\nPackr.SUPPORTS_STRUCT_HOOKS = true;\n\nlet defaultPackr = new Packr({ useRecords: false });\nexport const pack = defaultPackr.pack;\nexport const encode = defaultPackr.pack;\nexport const Encoder = Packr;\nexport { FLOAT32_OPTIONS } from './unpack.js';\nimport { FLOAT32_OPTIONS } from './unpack.js';\nexport const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;\nexport const REUSE_BUFFER_MODE = 512;\nexport const RESET_BUFFER_MODE = 1024;\nexport const RESERVE_START_SPACE = 2048;\n","export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';\nexport { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';\nexport { PackrStream, UnpackrStream, PackrStream as EncoderStream, UnpackrStream as DecoderStream } from './stream.js';\nexport { decodeIter, encodeIter } from './iterators.js';\nexport const useRecords = false;\nexport const mapsAsObjects = true;\nimport { setExtractor } from './unpack.js';\nimport { createRequire } from 'module';\n\nconst nativeAccelerationDisabled = process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED !== undefined && process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED.toLowerCase() === 'true';\n\nif (!nativeAccelerationDisabled) {\n\tlet extractor;\n\ttry {\n\t\tif (typeof require == 'function')\n\t\t\textractor = require('msgpackr-extract');\n\t\telse\n\t\t\textractor = createRequire(import.meta.url)('msgpackr-extract');\n\t\tif (extractor)\n\t\t\tsetExtractor(extractor.extractStrings);\n\t} catch (error) {\n\t\t// native module is optional\n\t}\n}","import chai from 'chai';\nimport * as msgpackr from '../node-index.js';\n//inspector.open(9229, null, true); debugger\nimport { readFileSync } from 'fs';\nlet allSampleData = [];\nfor (let i = 1; i < 6; i++) {\n\tallSampleData.push(JSON.parse(readFileSync(new URL(`./example${i > 1 ? i : ''}.json`, import.meta.url))));\n}\nallSampleData.push({\n\tname: 'some other types',\n\tdate: new Date(),\n\tempty: '',\n});\nconst sampleData = allSampleData[3];\nfunction tryRequire(module) {\n\ttry {\n\t\treturn require(module);\n\t} catch(error) {\n\t\treturn {};\n\t}\n}\n\nlet seed = 0;\nfunction random() {\n\tseed++;\n\tlet a = seed * 15485863;\n\treturn (a * a * a % 2038074743) / 2038074743;\n}\n//if (typeof chai === 'undefined') { chai = require('chai') }\nvar assert = chai.assert;\n//if (typeof msgpackr === 'undefined') { msgpackr = require('..') }\nvar Packr = msgpackr.Packr;\nvar Unpackr = msgpackr.Unpackr;\nvar unpack = msgpackr.unpack;\nvar unpackMultiple = msgpackr.unpackMultiple;\nvar roundFloat32 = msgpackr.roundFloat32;\nvar pack = msgpackr.pack;\nvar DECIMAL_FIT = msgpackr.FLOAT32_OPTIONS.DECIMAL_FIT;\n\nvar addExtension = msgpackr.addExtension;\nvar zlib = tryRequire('zlib');\nvar deflateSync = zlib.deflateSync;\nvar inflateSync = zlib.inflateSync;\nvar deflateSync = zlib.brotliCompressSync;\nvar inflateSync = zlib.brotliDecompressSync;\nvar constants = zlib.constants;\ntry {\n//\tvar { decode, encode } = require('msgpack-lite')\n} catch (error) {}\n\nvar ITERATIONS = 4000;\n\nclass ExtendArray extends Array {\n}\n\nclass ExtendArray2 extends Array {\n}\n\nclass ExtendArray3 extends Array {\n}\n\n\nclass ExtendObject {\n}\n\n\nsuite('msgpackr basic tests', function() {\n\ttest('pack/unpack data', function () {\n\t\tvar data = {\n\t\t\tdata: [\n\t\t\t\t{a: 1, name: 'one', type: 'odd', isOdd: true},\n\t\t\t\t{a: 2, name: 'two', type: 'even'},\n\t\t\t\t{a: 3, name: 'three', type: 'odd', isOdd: true},\n\t\t\t\t{a: 4, name: 'four', type: 'even'},\n\t\t\t\t{a: 5, name: 'five', type: 'odd', isOdd: true},\n\t\t\t\t{a: 6, name: 'six', type: 'even', isOdd: null}\n\t\t\t],\n\t\t\tdescription: 'some names',\n\t\t\ttypes: ['odd', 'even'],\n\t\t\tconvertEnumToNum: [\n\t\t\t\t{prop: 'test'},\n\t\t\t\t{prop: 'test'},\n\t\t\t\t{prop: 'test'},\n\t\t\t\t{prop: 1},\n\t\t\t\t{prop: 2},\n\t\t\t\t{prop: [undefined]},\n\t\t\t\t{prop: null}\n\t\t\t]\n\t\t};\n\t\tlet structures = [];\n\t\tlet packr = new Packr({structures});\n\t\tvar serialized = packr.pack(data);\n\t\tserialized = packr.pack(data);\n\t\tserialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\ttest('mixed structures', function () {\n\t\tlet data1 = {a: 1, b: 2, c: 3};\n\t\tlet data2 = {a: 1, b: 2, d: 4};\n\t\tlet data3 = {a: 1, b: 2, e: 5};\n\t\tlet structures = [];\n\t\tlet packr = new Packr({structures});\n\t\tvar serialized = packr.pack(data1);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data1);\n\t\tvar serialized = packr.pack(data2);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data2);\n\t\tvar serialized = packr.pack(data3);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data3);\n\t});\n\n\ttest('mixed array', function () {\n\t\tvar data = [\n\t\t\t'one',\n\t\t\t'two',\n\t\t\t'one',\n\t\t\t10,\n\t\t\t11,\n\t\t\tnull,\n\t\t\ttrue,\n\t\t\t'three',\n\t\t\t'three',\n\t\t\t'one', [\n\t\t\t\t3, -5, -50, -400, 1.3, -5.3, true\n\t\t\t]\n\t\t];\n\t\tlet structures = [];\n\t\tlet packr = new Packr({structures});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('255 chars', function () {\n\t\tconst data = 'RRZG9A6I7xupPeOZhxcOcioFsuhszGOdyDUcbRf4Zef2kdPIfC9RaLO4jTM5JhuZvTsF09fbRHMGtqk7YAgu3vespeTe9l61ziZ6VrMnYu2CamK96wCkmz0VUXyqaiUoTPgzk414LS9yYrd5uh7w18ksJF5SlC2e91rukWvNqAZJjYN3jpkqHNOFchCwFrhbxq2Lrv1kSJPYCx9blRg2hGmYqTbElLTZHv20iNqwZeQbRMgSBPT6vnbCBPnOh1W';\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.equal(deserialized, data);\n\t});\n\ttest('overlong UTF-8 string', function () {\n\t\tconst payload = Buffer.concat([\n\t\t\tBuffer.from([0xa2]),         // msgpack fixstr, 2 bytes\n\t\t\tBuffer.from([0xc0, 0xaf]),   // overlong \"/\"\n\t\t]);\n\n\t\tconst result = unpack(payload);\n\t\tassert.notEqual(result, '/');\n\t});\n\ttest('use ArrayBuffer', function () {\n\t\tconst data = {prop: 'a test'};\n\t\tvar serialized = pack(data);\n\t\tlet ab = new ArrayBuffer(serialized.length);\n\t\tlet u8 = new Uint8Array(ab);\n\t\tu8.set(serialized);\n\t\tvar deserialized = unpack(ab);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\tfor (let sampleData of allSampleData) {\n\t\tlet snippet = JSON.stringify(sampleData).slice(0, 20) + '...';\n\t\ttest('pack/unpack sample data ' + snippet, function () {\n\t\t\tvar data = sampleData;\n\t\t\tlet structures = [];\n\t\t\tvar serialized = pack(data);\n\t\t\tvar deserialized = unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t\tvar serialized = pack(data);\n\t\t\tvar deserialized = unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t});\n\t\ttest('pack/unpack sample data with Uint8Array encoding' + snippet, function () {\n\t\t\tvar data = sampleData;\n\t\t\tlet structures = [];\n\t\t\tvar serialized = pack(data);\n\t\t\tserialized = new Uint8Array(serialized);\n\t\t\tvar deserialized = unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t\tvar serialized = pack(data);\n\t\t\tvar deserialized = unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t});\n\t\ttest('pack/unpack sample data with bundled strings ' + snippet, function () {\n\t\t\tvar data = sampleData;\n\t\t\tlet packr = new Packr({ /*structures,*/ useRecords: false, bundleStrings: true});\n\t\t\tvar serialized = packr.pack(data);\n\t\t\tvar deserialized = packr.unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t});\n\t}\n\n\ttest('pack/unpack sample data with useRecords function', function () {\n\t\tvar data = [\n\t\t\t{id: 1, type: 1, labels: {a: 1, b: 2}},\n\t\t\t{id: 2, type: 1, labels: {b: 1, c: 2}},\n\t\t\t{id: 3, type: 1, labels: {d: 1, e: 2}}\n\t\t];\n\n\t\tvar alternatives = [\n\t\t\t{useRecords: false}, // 88 bytes\n\t\t\t{useRecords: true}, // 58 bytes\n\t\t\t{mapsAsObjects: true, useRecords: (v)=>!!v.id}, // 55 bytes\n\t\t\t{mapsAsObjects: true, variableMapSize: true, useRecords: (v)=>!!v.id} // 49 bytes\n\t\t];\n\n\t\tfor(let o of alternatives) {\n\t\t\tlet packr = new Packr(o);\n\t\t\tvar serialized = packr.pack(data);\n\t\t\tvar deserialized = packr.unpack(serialized);\n\t\t\tassert.deepEqual(deserialized, data);\n\t\t}\n\t});\n\n\ttest('mapAsEmptyObject combination', function () {\n\t\tconst msgpackr = new Packr({ useRecords: false, encodeUndefinedAsNil: true, variableMapSize: true, mapAsEmptyObject: true, setAsEmptyObject: true  });\n\n\t\tconst map = new Map();\n\t\tmap.set('a', 1);\n\t\tmap.set('b', 2);\n\t\tconst set = new Set();\n\t\tset.add('a');\n\t\tset.add('b');\n\t\tconst input = { map, set };\n\n\t\tconst packed = msgpackr.pack(input);\n\t\tconst unpacked = msgpackr.unpack(packed);\n\t\tassert.deepEqual(unpacked.map, {});\n\t\tassert.deepEqual(unpacked.set, {});\n\t});\n\ttest('pack/unpack numeric coercible keys', function () {\n\t\tvar data = { a: 1, 2: 'test', '-3.45': 'test2'};\n\t\tlet packr = new Packr({variableMapSize: true, coercibleKeyAsNumber: true, useRecords: false});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('pack/unpack empty data with bundled strings', function () {\n\t\tvar data = {};\n\t\tlet packr = new Packr({bundleStrings: true});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('pack/unpack large amount of chinese characters', function() {\n\t\tconst MSGPACK_OPTIONS = {bundleStrings: true};\n\n\t\tconst item = {\n\t\t\tmessage: '你好你好你好你好你好你好你好你好你好', // some Chinese characters\n\t\t};\n\n\t\ttestSize(100);\n\t\ttestSize(1000);\n\t\ttestSize(10000);\n\t\tfunction testSize(size) {\n\t\t\tconst list = [];\n\t\t\tfor (let i = 0; i < size; i++) {\n\t\t\t\tlist.push({...item});\n\t\t\t}\n\n\t\t\tconst packer = new Packr(MSGPACK_OPTIONS);\n\t\t\tconst unpacker = new Unpackr(MSGPACK_OPTIONS);\n\t\t\tconst encoded = packer.pack(list);\n\t\t\tconst decoded = unpacker.unpack(encoded);\n\t\t\tassert.deepEqual(list, decoded);\n\t\t}\n\t});\n\ttest('pack/unpack sequential data', function () {\n\t\tvar data = {foo: 1, bar: 2};\n\t\tlet packr = new Packr({sequential: true});\n\t\tlet unpackr = new Unpackr({sequential: true});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = unpackr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = unpackr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('pack/unpack with bundled strings and sequential', function () {\n\t\tconst options = {\n\t\t\tbundleStrings: true,\n\t\t\tsequential: true,\n\t\t};\n\n\t\tconst packer = new Packr(options);\n\t\tconst unpacker = new Packr(options);\n\n\t\tconst data = {data: 42}; // key length >= 4\n\n\t\tunpacker.unpackMultiple(Buffer.concat([\n\t\t\tpacker.pack(data),\n\t\t\tpacker.pack(data)\n\t\t]));\n\t});\n\tif (typeof Buffer != 'undefined')\n\ttest('replace data', function(){\n\t\tvar data1 = {\n\t\t\tdata: [\n\t\t\t\t{ a: 1, name: 'one', type: 'odd', isOdd: true, a: '13 characters' },\n\t\t\t\t{ a: 2, name: 'two', type: 'even', a: '11 characte' },\n\t\t\t\t{ a: 3, name: 'three', type: 'odd', isOdd: true, a: '12 character' },\n\t\t\t\t{ a: 4, name: 'four', type: 'even', a: '9 charact'},\n\t\t\t\t{ a: 5, name: 'five', type: 'odd', isOdd: true, a: '14 characters!' },\n\t\t\t\t{ a: 6, name: 'six', type: 'even', isOdd: null }\n\t\t\t],\n\t\t};\n\t\tvar data2 = {\n\t\t\tdata: [\n\t\t\t\t{ foo: 7, name: 'one', type: 'odd', isOdd: true },\n\t\t\t\t{ foo: 8, name: 'two', type: 'even'},\n\t\t\t\t{ foo: 9, name: 'three', type: 'odd', isOdd: true },\n\t\t\t\t{ foo: 10, name: 'four', type: 'even'},\n\t\t\t\t{ foo: 11, name: 'five', type: 'odd', isOdd: true },\n\t\t\t\t{ foo: 12, name: 'six', type: 'even', isOdd: null }\n\t\t\t],\n\t\t};\n\t\tvar serialized1 = pack(data1);\n\t\tvar serialized2 = pack(data2);\n\t\tvar b = Buffer.alloc(8000);\n\t\tserialized1.copy(b);\n\t\tvar deserialized1 = unpack(b, serialized1.length);\n\t\tserialized2.copy(b);\n\t\tvar deserialized2 = unpack(b, serialized2.length);\n\t\tassert.deepEqual(deserialized1, data1);\n\t\tassert.deepEqual(deserialized2, data2);\n\t});\n\n\ttest('compact 123', function() {\n\t\tassert.equal(pack(123).length, 1);\n\t});\n\n\ttest('BigInt', function() {\n\t\tlet packr = new Packr({ useBigIntExtension: true });\n\t\tlet data = {\n\t\t\ta: 3333333333333333333333333333n,\n\t\t\tb: 1234567890123456789012345678901234567890n,\n\t\t\tc: -3333333333333333333333333333n,\n\t\t\td: -352523523642364364364264264264264264262642642n,\n\t\t\te: 0xffffffffffffffffffffffffffn,\n\t\t\tf: -0xffffffffffffffffffffffffffn,\n\t\t\tg: (1234n << 123n) ^ (5678n << 56n) ^ 890n,\n\t\t\th: (-1234n << 123n) ^ (5678n << 56n) ^ 890n,\n\t\t\ti: (1234n << 1234n) ^ (5678n << 567n) ^ 890n,\n\t\t\tj: (-1234n << 1234n) ^ (5678n << 567n) ^ 890n,\n\t\t\tk: 0xdeadn << 0xbeefn,\n\t\t\tl: -0xdeadn << 0xbeefn,\n\t\t\tm: 11n << 0x11111n ^ 111n,\n\t\t\tn: -11n << 0x11111n ^ 111n,\n\t\t\to: 12345678901234567890n,\n\t\t\tp: -12345678901234567890n,\n\t\t\texp: [],\n\t\t\texpexp: [],\n\t\t};\n\n\t\tfor (let n = 1n; n.toString(16).length * 4 < 1500; n <<= 1n, n |= BigInt(Math.floor(Math.random() * 2))) {\n\t\t\tdata.exp.push(n, -n);\n\t\t}\n\n\t\tfor (let n = 7n; n.toString(16).length * 4 < 150000; n *= n) {\n\t\t\tdata.expexp.push(n, -n);\n\t\t}\n\n\t\tlet serialized = packr.pack(data);\n\t\tlet deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(data, deserialized);\n\t});\n\n\n\ttest('extended class pack/unpack', function(){\n\t\tfunction Extended() {\n\n\t\t}\n\t\tExtended.prototype.getDouble = function() {\n\t\t\treturn this.value * 2;\n\t\t};\n\t\tvar instance = new Extended();\n\t\tinstance.value = 4;\n\t\tinstance.string = 'decode this: ᾜ';\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: Extended,\n\t\t\ttype: 11,\n\t\t\tunpack: function(buffer) {\n\t\t\t\tlet e = new Extended();\n\t\t\t\tlet data = packr.unpack(buffer);\n\t\t\t\te.value = data[0];\n\t\t\t\te.string = data[1];\n\t\t\t\treturn e;\n\t\t\t},\n\t\t\tpack: function(instance) {\n\t\t\t\treturn packr.pack([instance.value, instance.string]);\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(data, deserialized);\n\t\tassert.equal(deserialized.extendedInstance.getDouble(), 8);\n\t});\n\n\ttest('extended Array class read/write', function(){\n\t\tvar instance = new ExtendArray();\n\t\tinstance.push(0);\n\t\tinstance.push(1);\n\t\tinstance.push(2);\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: ExtendArray,\n\t\t\ttype: 12,\n\t\t\tread: function(data) {\n\t\t\t\tObject.setPrototypeOf(data, ExtendArray.prototype);\n\t\t\t\treturn data;\n\t\t\t},\n\t\t\twrite: function(instance) {\n\t\t\t\treturn [...instance];\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), ExtendArray.prototype);\n\t\tassert.deepEqual(data, deserialized);\n\t});\n\n\ttest('unregistered extended Array class read/write', function(){\n\t\tvar instance = new ExtendArray2();\n\t\tinstance.push(0);\n\t\tinstance.push(1);\n\t\tinstance.push(2);\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Array.prototype);\n\t\tassert.deepEqual(data, deserialized);\n\t});\n\n\n\ttest('unregistered extended Object class read/write', function(){\n\t\tvar instance = new ExtendObject();\n\t\tinstance.test1 = \"string\";\n\t\tinstance.test2 = 3421321;\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Object.prototype);\n\t\tassert.deepEqual(data, deserialized);\n\t});\n\n\ttest('extended class pack/unpack custom size', function(){\n\t\tfunction TestClass() {\n\n\t\t}\n\t\taddExtension({\n\t\t\tClass: TestClass,\n\t\t\ttype: 0x01,\n\t\t\tpack() {\n\t\t\t\treturn typeof Buffer != 'undefined' ? Buffer.alloc(256) : new Uint8Array(256);\n\t\t\t},\n\t\t\tunpack(data) {\n\t\t\t\treturn data.length;\n\t\t\t}\n\t\t});\n\t\tlet result = unpack(pack(new TestClass()));\n\t\tassert.equal(result, 256);\n\t});\n\n\ttest('extended class read/write', function(){\n\t\tfunction Extended() {\n\n\t\t}\n\t\tExtended.prototype.getDouble = function() {\n\t\t\treturn this.value * 2;\n\t\t};\n\t\tvar instance = new Extended();\n\t\tinstance.value = 4;\n\t\tinstance.string = 'decode this: ᾜ';\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: Extended,\n\t\t\ttype: 12,\n\t\t\tread: function(data) {\n\t\t\t\tlet e = new Extended();\n\t\t\t\te.value = data[0];\n\t\t\t\te.string = data[1];\n\t\t\t\treturn e;\n\t\t\t},\n\t\t\twrite: function(instance) {\n\t\t\t\treturn [instance.value, instance.string];\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(data, deserialized);\n\t\tassert.equal(deserialized.extendedInstance.getDouble(), 8);\n\t});\n\ttest('extended class return self', function(){\n\t\tfunction Extended() {\n\n\t\t}\n\t\tExtended.prototype.getDouble = function() {\n\t\t\treturn this.value * 2;\n\t\t};\n\t\tvar instance = new Extended();\n\t\tinstance.value = 4;\n\t\tinstance.string = 'decode this: ᾜ';\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: Extended,\n\t\t\ttype: 13,\n\t\t\tread: function(data) {\n\t\t\t\tObject.setPrototypeOf(data, Extended.prototype);\n\t\t\t\treturn data;\n\t\t\t},\n\t\t\twrite: function(data) {\n\t\t\t\treturn data;\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(data, deserialized);\n\t\tassert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), Extended.prototype);\n\t\tassert.equal(deserialized.extendedInstance.getDouble(), 8);\n\t});\n\ttest('extended Array class return self', function(){\n\t\tvar instance = new ExtendArray3();\n\t\tinstance.push(0);\n\t\tinstance.push('has multi-byte: ᾜ');\n\t\tvar data = {\n\t\t\tprop1: 'has multi-byte: ᾜ',\n\t\t\textendedInstance: instance,\n\t\t\tprop2: 'more string',\n\t\t\tnum: 3,\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: ExtendArray3,\n\t\t\ttype: 14,\n\t\t\tread: function(data) {\n\t\t\t\tObject.setPrototypeOf(data, ExtendArray3.prototype);\n\t\t\t\treturn data;\n\t\t\t},\n\t\t\twrite: function(data) {\n\t\t\t\treturn data;\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(data, deserialized);\n\t\tassert.strictEqual(Object.getPrototypeOf(deserialized.extendedInstance), ExtendArray3.prototype);\n\t\tassert.equal(deserialized.extendedInstance[0], 0);\n\t});\n\n\ttest('extended class pack/unpack proxied', function(){\n\t\tfunction Extended() {\n\n\t\t}\n\t\tExtended.prototype.__call__ = function(){\n\t\t\treturn this.value * 4;\n\t\t};\n\t\tExtended.prototype.getDouble = function() {\n\t\t\treturn this.value * 2;\n\t\t};\n\n\t\tvar instance = function() { instance.__call__();/* callable stuff */ };\n\t\tObject.setPrototypeOf(instance,Extended.prototype);\n\n\t\tinstance.value = 4;\n\t\tvar data = instance;\n\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: Extended,\n\t\t\ttype: 15,\n\t\t\tunpack: function(buffer) {\n\t\t\t\tvar e = function() { e.__call__(); };\n\t\t\t\tObject.setPrototypeOf(e,Extended.prototype);\n\t\t\t\te.value = packr.unpack(buffer);\n\t\t\t\treturn e;\n\t\t\t},\n\t\t\tpack: function(instance) {\n\t\t\t\treturn packr.pack(instance.value);\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.equal(deserialized.getDouble(), 8);\n\t});\n\n\ttest.skip('convert Date to string', function(){\n\t\tvar data = {\n\t\t\taDate: new Date(),\n\t\t};\n\t\tlet packr = new Packr();\n\t\taddExtension({\n\t\t\tClass: Date,\n\t\t\twrite(date) {\n\t\t\t\treturn date.toString();\n\t\t\t}\n\t\t});\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.equal(deserialized.aDate, data.aDate.toString());\n\t});\n\ttest('standard pack fails on circular reference with shared structures', function () {\n\t\tvar data = {};\n\t\tdata.self = data;\n\t\tlet structures = [];\n\t\tlet savedStructures;\n\t\tlet packr = new Packr({\n\t\t\tstructures,\n\t\t\tsaveStructures(structures) {\n\t\t\t\tsavedStructures = structures;\n\t\t\t}\n\t\t});\n\t\tassert.throws(function () {\n\t\t\tpackr.pack(data);\n\t\t});\n\t});\n\n\ttest('proto handling', function() {\n\t\tvar objectWithProto = JSON.parse('{\"__proto__\":{\"foo\":3}}');\n\t\tvar decoded = unpack(pack(objectWithProto));\n\t\tassert(!decoded.foo);\n\t\tvar objectsWithProto = [objectWithProto, objectWithProto, objectWithProto, objectWithProto, objectWithProto, objectWithProto];\n\t\tlet packr = new Packr();\n\t\tvar decoded = packr.unpack(packr.pack(objectsWithProto));\n\t\tfor (let object of decoded) {\n\t\t\tassert(!decoded.foo);\n\t\t}\n\t});\n\n\ttest.skip('text decoder', function() {\n\t\t\tlet td = new TextDecoder('ISO-8859-15');\n\t\t\tlet b = Buffer.alloc(3);\n\t\t\tlet total = 0;\n\t\t\tfor (var i = 0; i < 256; i++) {\n\t\t\t\tb[0] = i;\n\t\t\t\tb[1] = 0;\n\t\t\t\tb[2] = 0;\n\t\t\t\tlet s = td.decode(b);\n\t\t\t\tif (!require('msgpackr-extract').isOneByte(s)) {\n\t\t\t\t\tconsole.log(i.toString(16), s.length);\n\t\t\t\t\ttotal++;\n\t\t\t\t}\n\t\t\t}\n\t});\n\n\ttest('moreTypes: Error with causes', function() {\n\t\tconst object = {\n\t\t\terror: new Error('test'),\n\t\t\terrorWithCause: new Error('test-1', { cause: new Error('test-2') }),\n\t\t\ttype: new TypeError(),\n\t\t\trange: new RangeError('test', { cause: [1, 2] }),\n\t\t};\n\t\tconst packr = new Packr({\n\t\t\tmoreTypes: true,\n\t\t});\n\n\t\tconst serialized = packr.pack(object);\n\t\tconst deserialized = packr.unpack(serialized);\n\t\tassert.equal(deserialized.error.message, object.error.message);\n\t\tassert.equal(deserialized.error.cause, object.error.cause);\n\t\tassert.equal(deserialized.errorWithCause.message, object.errorWithCause.message);\n\t\tassert.equal(deserialized.errorWithCause.cause.message, object.errorWithCause.cause.message);\n\t\tassert.equal(deserialized.errorWithCause.cause.cause, object.errorWithCause.cause.cause);\n\t\tassert.equal(deserialized.type.message, object.type.message);\n\t\tassert.equal(deserialized.range.message, object.range.message);\n\t\tassert.deepEqual(deserialized.range.cause, object.range.cause);\n\t\tassert(deserialized.error instanceof Error);\n\t\tassert(deserialized.type instanceof TypeError);\n\t\tassert(deserialized.range instanceof RangeError);\n\t});\n\n\ttest('structured cloning: self reference', function() {\n\t\tlet object = {\n\t\t\ttest: 'string',\n\t\t\tchildren: [\n\t\t\t\t{ name: 'child' }\n\t\t\t],\n\t\t\tvalue: new ArrayBuffer(10)\n\t\t};\n\t\tlet u8 = new Uint8Array(object.value);\n\t\tu8[0] = 1;\n\t\tu8[1] = 2;\n\t\tobject.self = object;\n\t\tobject.children[1] = object;\n\t\tobject.children[2] = object.children[0];\n\t\tobject.childrenAgain = object.children;\n\t\tlet packr = new Packr({\n\t\t\tmoreTypes: true,\n\t\t\tstructuredClone: true,\n\t\t});\n\t\tvar serialized = packr.pack(object);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.equal(deserialized.self, deserialized);\n\t\tassert.equal(deserialized.children[0].name, 'child');\n\t\tassert.equal(deserialized.children[1], deserialized);\n\t\tassert.equal(deserialized.children[0], deserialized.children[2]);\n\t\tassert.equal(deserialized.children, deserialized.childrenAgain);\n\t\tassert.equal(deserialized.value.constructor.name, 'ArrayBuffer');\n\t\tu8 = new Uint8Array(deserialized.value);\n\t\tassert.equal(u8[0], 1);\n\t\tassert.equal(u8[1], 2);\n\t});\n\n\ttest('structured cloning: self reference with more types', function() {\n\t\tlet set = new Set();\n\t\tset.add(['hello', 1, 2, { map: new Map([[set, set], ['a', 'b']]) }]);\n\n\t\tlet packr = new Packr({\n\t\t\tmoreTypes: true,\n\t\t\tstructuredClone: true,\n\t\t});\n\t\tlet serialized = packr.pack(set);\n\t\tlet deserialized = packr.unpack(serialized);\n\t\tassert.equal(deserialized.constructor.name, 'Set');\n\t\tlet map = Array.from(deserialized)[0][3].map;\n\t\tassert.equal(map.get(deserialized), deserialized);\n\n\t\tlet sizeTestMap = new Map();\n\t\tfor (let i = 0; i < 50; i++) {\n\t\t\tsizeTestMap.set(i || sizeTestMap, sizeTestMap);\n\t\t\tlet deserialized = packr.unpack(packr.pack(sizeTestMap));\n\t\t\tassert.equal(deserialized.size, i + 1);\n\t\t\tassert(deserialized.has(deserialized));\n\t\t\tassert(deserialized.has(i || deserialized));\n\t\t}\n\n\t\tlet sizeTestSet = new Set();\n\t\tfor (let i = 0; i < 50; i++) {\n\t\t\tsizeTestSet.add(i || sizeTestSet);\n\t\t\tlet deserialized = packr.unpack(packr.pack(sizeTestSet));\n\t\t\tassert.equal(deserialized.size, i + 1);\n\t\t\tassert(deserialized.has(deserialized));\n\t\t\tassert(deserialized.has(i || deserialized));\n\t\t}\n\t});\n\n\ttest('structured cloning: types', function() {\n\t\tlet b = typeof Buffer != 'undefined' ? Buffer.alloc(20) : new Uint8Array(20);\n\t\tlet fa = new Float32Array(b.buffer, 8, 2);\n\t\tfa[0] = 2.25;\n\t\tfa[1] = 6;\n\t\tlet object = {\n\t\t\terror: new Error('test'),\n\t\t\tset: new Set(['a', 'b']),\n\t\t\tregexp: /test/gi,\n\t\t\tfloat32Array: fa,\n\t\t\tuint16Array: new Uint16Array([3, 4]),\n\t\t\tarrayBuffer: new Uint8Array([0xde, 0xad]).buffer,\n\t\t\tdataView: new DataView(new Uint8Array([0xbe, 0xef]).buffer),\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tmoreTypes: true,\n\t\t\tstructuredClone: true,\n\t\t});\n\t\tvar serialized = packr.pack(object);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(Array.from(deserialized.set), Array.from(object.set));\n\t\tassert.equal(deserialized.error.message, object.error.message);\n\t\tassert.equal(deserialized.regexp.test('TEST'), true);\n\t\tassert.equal(deserialized.float32Array.constructor.name, 'Float32Array');\n\t\tassert.equal(deserialized.float32Array[0], 2.25);\n\t\tassert.equal(deserialized.float32Array[1], 6);\n\t\tassert.equal(deserialized.uint16Array.constructor.name, 'Uint16Array');\n\t\tassert.equal(deserialized.uint16Array[0], 3);\n\t\tassert.equal(deserialized.uint16Array[1], 4);\n\t\tassert.equal(deserialized.arrayBuffer.constructor.name, 'ArrayBuffer');\n\t\tassert.equal(new DataView(deserialized.arrayBuffer).getUint16(), 0xdead);\n\t\tassert.equal(deserialized.dataView.constructor.name, 'DataView');\n\t\tassert.equal(deserialized.dataView.getUint16(), 0xbeef);\n\t});\n\ttest('big bundledStrings', function() {\n\t\tconst MSGPACK_OPTIONS = {bundleStrings: true};\n\t\tconst packer = new Packr(MSGPACK_OPTIONS);\n\t\tconst unpacker = new Unpackr(MSGPACK_OPTIONS);\n\n\t\tconst payload = {\n\t\t\toutput: [\n\t\t\t\t{\n\t\t\t\t\turl: 'https://www.example.com/',\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\n\t\tfor (let i = 0; i < 10000; i++) {\n\t\t\tpayload.output.push(payload.output[0]);\n\t\t}\n\t\tlet deserialized = unpacker.unpack(packer.pack(payload));\n\t\tassert.equal(deserialized.output[0].url, payload.output[0].url);\n\t});\n\ttest('structured clone with bundled strings', function() {\n\t\tconst packer = new Packr({\n\t\t\tstructuredClone: true, // both options must be enabled\n\t\t\tbundleStrings: true,\n\t\t});\n\n\t\tconst v = {};\n\n\t\tlet shared = {\n\t\t\tname1: v,\n\t\t\tname2: v,\n\t\t};\n\n\t\tlet deserialized = packer.unpack(packer.pack(shared));\n\t\tassert.equal(deserialized.name1, deserialized.name2);\n\n\t\tshared = {};\n\t\tshared.aaaa = shared; // key length >= 4\n\n\t\tdeserialized = packer.unpack(packer.pack(shared));\n\t\tassert.equal(deserialized.aaaa, deserialized);\n\t});\n\n\ttest('object without prototype', function(){\n\t\tvar data = Object.create(null);\n\t\tdata.test = 3;\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\ttest('object with __proto__', function(){\n\t\tconst data = { foo: 'bar', __proto__: { isAdmin: true } };\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, { foo: 'bar' });\n\t});\n\n\ttest('separate instances', function() {\n\t\tconst packr = new Packr({\n\t\t\tstructures: [['m', 'e'], ['action', 'share']]\n\t\t});\n\t\tconst packr2 = new Packr({\n\t\t\tstructures: [['m', 'e'], ['action', 'share']]\n\t\t});\n\t\tlet packed = packr.pack([{m: 1, e: 2}, {action: 3, share: 4}]);\n\t\t// also tried directly decoding this without the first Packr instance packed = new Uint8Array([0x92, 0x40, 0x01, 0x02, 0x41, 0x03, 0x04]);\n\t\tconsole.log(packr2.unpack(packed));\n\t});\n\n\ttest('many shared structures', function() {\n\t\tlet data = [];\n\t\tfor (let i = 0; i < 200; i++) {\n\t\t\tdata.push({['a' + i]: i});\n\t\t}\n\t\tlet structures = [];\n\t\tlet savedStructures;\n\t\tlet packr = new Packr({\n\t\t\tstructures,\n\t\t\tsaveStructures(structures) {\n\t\t\t\tsavedStructures = structures;\n\t\t\t}\n\t\t});\n\t\tvar serializedWith32 = packr.pack(data);\n\t\tassert.equal(savedStructures.length, 32);\n\t\tvar deserialized = packr.unpack(serializedWith32);\n\t\tassert.deepEqual(deserialized, data);\n\t\tstructures = structures.slice(0, 32);\n\t\tpackr = new Packr({\n\t\t\tstructures,\n\t\t\tmaxSharedStructures: 100,\n\t\t\tsaveStructures(structures) {\n\t\t\t\tsavedStructures = structures;\n\t\t\t}\n\t\t});\n\t\tdeserialized = packr.unpack(serializedWith32);\n\t\tassert.deepEqual(deserialized, data);\n\t\tstructures = structures.slice(0, 32);\n\t\tpackr = new Packr({\n\t\t\tstructures,\n\t\t\tmaxSharedStructures: 100,\n\t\t\tsaveStructures(structures) {\n\t\t\t\tsavedStructures = structures;\n\t\t\t}\n\t\t});\n\t\tlet serialized = packr.pack(data);\n\t\tassert.equal(savedStructures.length, 100);\n\t\tdeserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\n\t\tdeserialized = packr.unpack(serializedWith32);\n\t\tassert.deepEqual(deserialized, data);\n\t\tassert.equal(savedStructures.length, 100);\n\n\t\tdeserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tassert.equal(packr.structures.sharedLength, 100);\n\t});\n\ttest('more shared structures', function() {\n\t\tconst structures = [];\n\t\tfor (let i = 0; i < 40; i++) {\n\t\t\tstructures.push(['a' + i]);\n\t\t}\n\t\tconst structures2 = [...structures];\n\t\tconst packr = new Packr({\n\t\t\tgetStructures() {\n\t\t\t\treturn structures;\n\t\t\t},\n\t\t\tsaveStructures(structures) {\n\t\t\t},\n\t\t\tmaxSharedStructures: 100\n\t\t});\n\t\tconst packr2 = new Packr({\n\t\t\tgetStructures() {\n\t\t\t\treturn structures2;\n\t\t\t},\n\t\t\tsaveStructures(structures) {\n\t\t\t},\n\t\t\tmaxSharedStructures: 100\n\t\t});\n\t\tconst inputData = {a35: 35};\n\t\tconst buffer = packr.pack(inputData);\n\t\tconst outputData = packr2.decode(buffer);\n\t\tassert.deepEqual(inputData, outputData);\n\t});\n\n\ttest('big buffer', function() {\n\t\tvar size = 100000000;\n\t\tvar data = new Uint8Array(size).fill(1);\n\t\tvar packed = pack(data);\n\t\tvar unpacked = unpack(packed);\n\t\tassert.equal(unpacked.length, size);\n\t});\n\n\ttest('random strings', function(){\n\t\tvar data = [];\n\t\tfor (var i = 0; i < 2000; i++) {\n\t\t\tvar str = 'test';\n\t\t\twhile (Math.random() < 0.7 && str.length < 0x100000) {\n\t\t\t\tstr = str + String.fromCharCode(90/(Math.random() + 0.01)) + str;\n\t\t\t}\n\t\t\tdata.push(str);\n\t\t}\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\ttest('map/date', function(){\n\t\tvar map = new Map();\n\t\tmap.set(4, 'four');\n\t\tmap.set('three', 3);\n\n\n\t\tvar data = {\n\t\t\tmap: map,\n\t\t\tdate: new Date(1532219539733),\n\t\t\tfarFutureDate: new Date(3532219539133),\n\t\t\tfartherFutureDate: new Date('2106-08-05T18:48:20.323Z'),\n\t\t\tancient: new Date(-3532219539133),\n\t\t\tinvalidDate: new Date('invalid')\n\t\t};\n\t\tlet packr = new Packr();\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.equal(deserialized.map.get(4), 'four');\n\t\tassert.equal(deserialized.map.get('three'), 3);\n\t\tassert.equal(deserialized.date.getTime(), 1532219539733);\n\t\tassert.equal(deserialized.farFutureDate.getTime(), 3532219539133);\n\t\tassert.equal(deserialized.fartherFutureDate.toISOString(), '2106-08-05T18:48:20.323Z');\n\t\tassert.equal(deserialized.ancient.getTime(), -3532219539133);\n\t\tassert.equal(deserialized.invalidDate.toString(), 'Invalid Date');\n\t});\n\ttest('map/date with options', function(){\n\t\tvar map = new Map();\n\t\tmap.set(4, 'four');\n\t\tmap.set('three', 3);\n\n\n\t\tvar data = {\n\t\t\tmap: map,\n\t\t\tdate: new Date(1532219539011),\n\t\t\tinvalidDate: new Date('invalid')\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tmapsAsObjects: true,\n\t\t\tuseTimestamp32: true,\n\t\t\tonInvalidDate: () => 'Custom invalid date'\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.equal(deserialized.map[4], 'four');\n\t\tassert.equal(deserialized.map.three, 3);\n\t\tassert.equal(deserialized.date.getTime(), 1532219539000);\n\t\tassert.equal(deserialized.invalidDate, 'Custom invalid date');\n\t});\n\ttest('key caching', function() {\n\t\tvar data = {\n\t\t\tfoo: 2,\n\t\t\tbar: 'test',\n\t\t\tfour: 4,\n\t\t\tseven: 7,\n\t\t\tfoz: 3,\n\t\t};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\t// do multiple times to test caching\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('strings', function() {\n\t\tvar data = [''];\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\t// do multiple times\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tdata = 'decode this: ᾜ';\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tdata = 'decode this that is longer but without any non-latin characters';\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('decimal float32', function() {\n\t\tvar data = {\n\t\t\ta: 2.526,\n\t\t\tb: 0.0035235,\n\t\t\tc: 0.00000000000352501,\n\t\t\td: 3252.77,\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tuseFloat32: DECIMAL_FIT\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tassert.equal(serialized.length, 32);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('int64/uint64 should be bigints by default', function() {\n\t\tvar data = {\n\t\t\ta: 325283295382932843n\n\t\t};\n\n\t\tlet packr = new Packr();\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized.a, 325283295382932843n);\n\t});\n\ttest('bigint to float', function() {\n\t\tvar data = {\n\t\t\ta: 325283295382932843n\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tint64AsType: 'number'\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized.a, 325283295382932843);\n\t});\n\ttest('int64AsNumber compatibility', function() {\n\t\t// https://github.com/kriszyp/msgpackr/pull/85\n\t\tvar data = {\n\t\t\ta: 325283295382932843n\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tint64AsNumber: true\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized.a, 325283295382932843);\n\t});\n\ttest('bigint to auto (float or bigint)', function() {\n\t\tvar data = {\n\t\t\ta: -9007199254740993n,\n\t\t\tb: -9007199254740992n,\n\t\t\tc: 0n,\n\t\t\td: 9007199254740992n,\n\t\t\te: 9007199254740993n,\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tint64AsType: 'auto'\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized.a, -9007199254740993n);\n\t\tassert.deepEqual(deserialized.b, -9007199254740992);\n\t\tassert.deepEqual(deserialized.c, 0);\n\t\tassert.deepEqual(deserialized.d, 9007199254740992);\n\t\tassert.deepEqual(deserialized.e, 9007199254740993n);\n\t});\n\ttest('bigint to string', function() {\n\t\tvar data = {\n\t\t\ta: 325283295382932843n,\n\t\t};\n\t\tlet packr = new Packr({\n\t\t\tint64AsType: 'string'\n\t\t});\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized.a, '325283295382932843');\n\t});\n\ttest('fixint should be one byte', function(){\n\t\tlet encoded = pack(123);\n\t\tassert.equal(encoded.length, 1);\n\t});\n\ttest('numbers', function(){\n\t\tvar data = {\n\t\t\tbigEncodable: 48978578104322,\n\t\t\tdateEpoch: 1530886513200,\n\t\t\trealBig: 3432235352353255323,\n\t\t\tdecimal: 32.55234,\n\t\t\tnegative: -34.11,\n\t\t\texponential: 0.234e123,\n\t\t\ttiny: 3.233e-120,\n\t\t\tzero: 0,\n\t\t\t//negativeZero: -0,\n\t\t\tInfinity: Infinity\n\t\t};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('bigint', function(){\n\t\tvar data = {\n\t\t\tbigintSmall: 352n,\n\t\t\tbigintSmallNegative: -333335252n,\n\t\t\tbigintBig: 2n**64n - 1n, // biggest possible\n\t\t\tbigintBigNegative: -(2n**63n), // largest negative\n\t\t\tmixedWithNormal: 44,\n\t\t};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t\tvar tooBigInt = {\n\t\t\ttooBig: 2n**66n\n\t\t};\n\t\tassert.throws(function(){ serialized = pack(tooBigInt); });\n\t\tlet packr = new Packr({\n\t\t\tlargeBigIntToFloat: true\n\t\t});\n\t\tserialized = packr.pack(tooBigInt);\n\t\tdeserialized = unpack(serialized);\n\t\tassert.isTrue(deserialized.tooBig > 2n**65n);\n\n\t\tpackr = new Packr({\n\t\t\tlargeBigIntToString: true\n\t\t});\n\t\tserialized = packr.pack(tooBigInt);\n\t\tdeserialized = unpack(serialized);\n\t\tassert.equal(deserialized.tooBig, (2n**66n).toString());\n\t});\n\n\ttest('roundFloat32', function() {\n\t\tassert.equal(roundFloat32(0.00333000003), 0.00333);\n\t\tassert.equal(roundFloat32(43.29999999993), 43.3);\n\t});\n\n\ttest('buffers', function(){\n\t\tvar data = {\n\t\t\tbuffer1: new Uint8Array([2,3,4]),\n\t\t\tbuffer2: new Uint8Array(pack(sampleData))\n\t\t};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\ttest('notepack test', function() {\n\t\tconst data = {\n\t\t  foo: 1,\n\t\t  bar: [1, 2, 3, 4, 'abc', 'def'],\n\t\t  foobar: {\n\t\t    foo: true,\n\t\t    bar: -2147483649,\n\t\t    foobar: {\n\t\t      foo: new Uint8Array([1, 2, 3, 4, 5]),\n\t\t      bar: 1.5,\n\t\t      foobar: [true, false, 'abcdefghijkmonpqrstuvwxyz']\n\t\t    }\n\t\t  }\n\t\t};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tvar deserialized = unpack(serialized);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\n\ttest('arrays in map keys', function() {\n\t\tconst msgpackr = new Packr({ mapsAsObjects: true, allowArraysInMapKeys: true });\n\n\t\tconst map = new Map();\n\t\tmap.set([1, 2, 3], 1);\n\t\tmap.set([1, 2, ['foo', 3.14]], 2);\n\n\t\tconst packed = msgpackr.pack(map);\n\t\tconst unpacked = msgpackr.unpack(packed);\n\t\tassert.deepEqual(unpacked, { '1,2,3': 1, '1,2,foo,3.14': 2 });\n\t});\n\n\ttest('utf16 causing expansion', function() {\n\t\tthis.timeout(10000);\n\t\tlet data = {fixstr: 'ᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝ', str8:'ᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝᾐᾑᾒᾓᾔᾕᾖᾗᾘᾙᾚᾛᾜᾝ'};\n\t\tvar serialized = pack(data);\n\t\tvar deserialized = unpack(serialized);\n\t\tassert.deepEqual(deserialized, data);\n\t});\n\ttest('unpackMultiple', () => {\n\t\tlet values = unpackMultiple(new Uint8Array([1, 2, 3, 4]));\n\t\tassert.deepEqual(values, [1, 2, 3, 4]);\n\t\tvalues = [];\n\t\tunpackMultiple(new Uint8Array([1, 2, 3, 4]), value => values.push(value));\n\t\tassert.deepEqual(values, [1, 2, 3, 4]);\n\t});\n\n\ttest('unpackMultiple with positions', () => {\n\t\tlet values = unpackMultiple(new Uint8Array([1, 2, 3, 4]));\n\t\tassert.deepEqual(values, [1, 2, 3, 4]);\n\t\tvalues = [];\n\t\tunpackMultiple(new Uint8Array([1, 2, 3, 4]), (value,start,end) => values.push([value,start,end]));\n\t\tassert.deepEqual(values, [[1,0,1], [2,1,2], [3,2,3], [4,3,4]]);\n\t});\n\n\ttest('pack toJSON returning this', () => {\n\t\tclass Serializable {\n\t\t\tsomeData = [1, 2, 3, 4];\n\t\t\ttoJSON() {\n\t\t\t\treturn this;\n\t\t\t}\n\t\t}\n\t\tconst serialized = pack(new Serializable);\n\t\tconst deserialized = unpack(serialized);\n\t\tassert.deepStrictEqual(deserialized, { someData: [1, 2, 3, 4] });\n\t});\n\ttest('skip values', function () {\n\t\tvar data = {\n\t\t\tdata: [\n\t\t\t\t{ a: 1, name: 'one', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 2, name: 'two', type: 'even', isOdd: undefined },\n\t\t\t\t{ a: 3, name: 'three', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 4, name: 'four', type: 'even', isOdd: null},\n\t\t\t\t{ a: 5, name: 'five', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 6, name: 'six', type: 'even', isOdd: null }\n\t\t\t],\n\t\t\tdescription: 'some names',\n\t\t\ttypes: ['odd', 'even'],\n\t\t\tconvertEnumToNum: [\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 1 },\n\t\t\t\t{ prop: 2 },\n\t\t\t\t{ prop: [undefined, null] },\n\t\t\t\t{ prop: null }\n\t\t\t]\n\t\t};\n\t\tvar expected = {\n\t\t\tdata: [\n\t\t\t\t{ a: 1, name: 'one', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 2, name: 'two', type: 'even' },\n\t\t\t\t{ a: 3, name: 'three', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 4, name: 'four', type: 'even', },\n\t\t\t\t{ a: 5, name: 'five', type: 'odd', isOdd: true },\n\t\t\t\t{ a: 6, name: 'six', type: 'even' }\n\t\t\t],\n\t\t\tdescription: 'some names',\n\t\t\ttypes: ['odd', 'even'],\n\t\t\tconvertEnumToNum: [\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 'test' },\n\t\t\t\t{ prop: 1 },\n\t\t\t\t{ prop: 2 },\n\t\t\t\t{ prop: [undefined, null] },\n\t\t\t\t{}\n\t\t\t]\n\t\t};\n\t\tlet packr = new Packr({ useRecords: false, skipValues: [undefined, null] });\n\t\tvar serialized = packr.pack(data);\n\t\tvar deserialized = packr.unpack(serialized);\n\t\tassert.deepEqual(deserialized, expected);\n\t});\n});\nsuite('msgpackr performance tests', function(){\n\ttest('performance JSON.parse', function() {\n\t\tvar data = sampleData;\n\t\tthis.timeout(10000);\n\t\tlet structures = [];\n\t\tvar serialized = JSON.stringify(data);\n\t\tconsole.log('JSON size', serialized.length);\n\t\tfor (var i = 0; i < ITERATIONS; i++) {\n\t\t\tvar deserialized = JSON.parse(serialized);\n\t\t}\n\t});\n\ttest('performance JSON.stringify', function() {\n\t\tvar data = sampleData;\n\t\tthis.timeout(10000);\n\t\tfor (var i = 0; i < ITERATIONS; i++) {\n\t\t\tvar serialized = JSON.stringify(data);\n\t\t}\n\t});\n\ttest('performance unpack', function() {\n\t\tvar data = sampleData;\n\t\tthis.timeout(10000);\n\t\tlet structures = [];\n\t\tvar serialized = pack(data);\n\t\tconsole.log('MessagePack size', serialized.length);\n\t\tlet packr = new Packr({ structures, bundleStrings: false });\n\t\tvar serialized = packr.pack(data);\n\t\tconsole.log('msgpackr w/ record ext size', serialized.length);\n\t\tfor (var i = 0; i < ITERATIONS; i++) {\n\t\t\tvar deserialized = packr.unpack(serialized);\n\t\t}\n\t});\n\ttest('performance pack', function() {\n\t\tvar data = sampleData;\n\t\tthis.timeout(10000);\n\t\tlet structures = [];\n\t\tlet packr = new Packr({ structures, bundleStrings: false });\n\t\tlet buffer = typeof Buffer != 'undefined' ? Buffer.alloc(0x10000) : new Uint8Array(0x10000);\n\n\t\tfor (var i = 0; i < ITERATIONS; i++) {\n\t\t\t//serialized = pack(data, { shared: sharedStructure })\n\t\t\tpackr.useBuffer(buffer);\n\t\t\tvar serialized = packr.pack(data);\n\t\t\t//var serializedGzip = deflateSync(serialized)\n\t\t}\n\t\t//console.log('serialized', serialized.length, global.propertyComparisons)\n\t});\n});\n"],"names":["position","bundledStrings","Unpackr","addExtension","unpack","unpackMultiple","roundFloat32","unpackAddExtension","Packr","pack","createRequire","readFileSync","msgpackr.Packr","msgpackr.Unpackr","msgpackr.unpack","msgpackr.unpackMultiple","msgpackr.roundFloat32","msgpackr.pack","msgpackr.FLOAT32_OPTIONS","msgpackr.addExtension"],"mappings":";;;CAAA,IAAI,OAAO,CAAC;CACZ,IAAI;CACJ,CAAC,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;CAC7B,CAAC,CAAC,MAAM,KAAK,EAAE,EAAE;CACjB,IAAI,GAAG,CAAC;CACR,IAAI,MAAM,CAAC;CACX,IAAIA,UAAQ,GAAG,CAAC,CAAC;CAEjB,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,IAAI,OAAO,GAAG,WAAW,CAAC;CAC1B,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,iBAAiB,CAAC;CACtB,IAAI,SAAS,CAAC;CACd,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,YAAY,GAAG,CAAC,CAAC;CACrB,IAAIC,gBAAc,CAAC;CACnB,IAAI,YAAY,CAAC;CACjB,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI,QAAQ,CAAC;CACb,IAAI,cAAc,GAAG;CACrB,CAAC,UAAU,EAAE,KAAK;CAClB,CAAC,aAAa,EAAE,IAAI;CACpB,CAAC,CAAC;CACK,MAAM,MAAM,CAAC,EAAE;CACf,MAAM,EAAE,GAAG,IAAI,MAAM,EAAE,CAAC;CAC/B,EAAE,CAAC,IAAI,GAAG,kBAAkB,CAAC;CAC7B,IAAI,cAAc,GAAG,KAAK,CAAC;CAC3B,IAAI,yBAAyB,GAAG,CAAC,CAAC;AAElC;iBACO,MAAM,OAAO,CAAC;CACrB,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,IAAI,OAAO,EAAE;CACf,GAAG,IAAI,OAAO,CAAC,UAAU,KAAK,KAAK,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;CAC1E,IAAI,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;CACjC,GAAG,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE;CACxD,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK,EAAE;CAC5D,KAAK,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;CAC7B,KAAK,IAAI,CAAC,OAAO,CAAC,mBAAmB;CACrC,MAAM,OAAO,CAAC,mBAAmB,GAAG,CAAC,CAAC;CACtC,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,UAAU;CACzB,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;CAChE,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE;CACnC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,CAAC;CACnD,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,aAAa,EAAE;CAC9B,IAAI,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,GAAG;CACH,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CAC/B,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,IAAI,GAAG,EAAE;CACX;CACA,GAAG,OAAO,SAAS,CAAC,MAAM;CAC1B,IAAI,WAAW,EAAE,CAAC;CAClB,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAGC,SAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAChH,IAAI,CAAC,CAAC;CACN,GAAG;CACH,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;CAC1D,GAAG,MAAM,GAAG,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;CACzF,EAAE,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;CACnC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC;CACzC,GAAGF,UAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;CACjC,GAAG,MAAM;CACT,GAAGA,UAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;CACnD,GAAG;CACH,EAAE,cAAc,GAAG,CAAC,CAAC;CACrB,EAAE,YAAY,GAAG,CAAC,CAAC;CACnB,EAAE,SAAS,GAAG,IAAI,CAAC;CACnB,EAAE,OAAO,GAAG,WAAW,CAAC;CACxB,EAAEC,gBAAc,GAAG,IAAI,CAAC;CACxB,EAAE,GAAG,GAAG,MAAM,CAAC;CACf;CACA;CACA;CACA,EAAE,IAAI;CACN,GAAG,QAAQ,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CACvH,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB;CACA,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,MAAM,YAAY,UAAU;CACnC,IAAI,MAAM,KAAK,CAAC;CAChB,GAAG,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC;CAC3J,GAAG;CACH,EAAE,IAAI,IAAI,YAAYC,SAAO,EAAE;CAC/B,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC;CACxC,IAAI,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAChC,IAAI,MAAM,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;CAClE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,cAAc,GAAG,cAAc,CAAC;CACnC,GAAG,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACzD,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;CACjC,EAAE,IAAI,MAAM,EAAE,YAAY,GAAG,CAAC,CAAC;CAC/B,EAAE,IAAI;CACN,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;CACtF,GAAG,IAAI,OAAO,EAAE;CAChB,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,YAAY,EAAEF,UAAQ,CAAC,KAAK,KAAK,EAAE,OAAO;CACjE,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,YAAY,EAAEA,UAAQ,CAAC,KAAK,KAAK,EAAE;CACnE,MAAM,OAAO;CACb,MAAM;CACN,KAAK;CACL,IAAI;CACJ,QAAQ;CACR,IAAI,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC;CACvB,IAAI,MAAMA,UAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAGA,UAAQ,CAAC;CAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CAChC,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB,GAAG,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC;CACrC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CACzB,GAAG,MAAM,KAAK,CAAC;CACf,GAAG,SAAS;CACZ,GAAG,cAAc,GAAG,KAAK,CAAC;CAC1B,GAAG,WAAW,EAAE,CAAC;CACjB,GAAG;CACH,EAAE;CACF,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE;CACxD,EAAE,IAAI,IAAI,CAAC,mBAAmB;CAC9B,GAAG,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;CACjE,EAAE,gBAAgB,GAAG,gBAAgB,IAAI,EAAE,CAAC;CAC5C,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;CACvC,GAAG,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC3D,GAAG,IAAI,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvC,GAAG,IAAI,SAAS,EAAE;CAClB,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,IAAI,IAAI,CAAC,IAAI,EAAE;CACf,KAAK,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG;CACH,EAAE,gBAAgB,CAAC,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC;CAC1D,EAAE,KAAK,IAAI,EAAE,IAAI,kBAAkB,IAAI,EAAE,EAAE;CAC3C,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE;CAChB,IAAI,IAAI,SAAS,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CACzC,IAAI,IAAI,QAAQ,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;CAC1C,IAAI,IAAI,QAAQ,EAAE;CAClB,KAAK,IAAI,SAAS;CAClB,MAAM,CAAC,gBAAgB,CAAC,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC;CACxG,KAAK,gBAAgB,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;CACrC,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,OAAO,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;CAC5C,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC,EAAE;CACF,EAAC;CAIM,SAAS,WAAW,CAAC,OAAO,EAAE;CACrC,CAAC,IAAI;CACL,EAAE,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE;CAClD,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,YAAY,IAAI,CAAC,CAAC;CAC1D,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,MAAM;CAC9C,IAAI,iBAAiB,CAAC,MAAM,GAAG,YAAY,CAAC;CAC5C,GAAG;CACH,EAAE,IAAI,MAAM,CAAC;CACb,EAAE,IAAI,cAAc,CAAC,WAAW,IAAI,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,CAACA,UAAQ,CAAC,IAAI,IAAI,EAAE;CACnF,GAAG,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAEA,UAAQ,EAAE,MAAM,CAAC,CAAC;CAC9D,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM;CAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;CAC7B,GAAGA,UAAQ,GAAG,MAAM,CAAC;CACrB,GAAG;CACH,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;CACnB,EAAE,IAAIC,gBAAc,EAAE;CACtB,GAAGD,UAAQ,GAAGC,gBAAc,CAAC,kBAAkB,CAAC;CAChD,GAAGA,gBAAc,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,cAAc;CACpB;CACA;CACA,GAAG,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC9C;CACA,EAAE,IAAID,UAAQ,IAAI,MAAM,EAAE;CAC1B;CACA,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC/D,IAAI,iBAAiB,EAAE,CAAC;CACxB,GAAG,iBAAiB,GAAG,IAAI,CAAC;CAC5B,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,YAAY;CACnB,IAAI,YAAY,GAAG,IAAI,CAAC;CACxB,GAAG,MAAM,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChC;CACA,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE;CAC9B,GAAG,IAAI,QAAQ,CAAC;CAChB,GAAG,IAAI;CACP,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;CACnH,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,QAAQ,GAAG,2BAA2B,GAAG,KAAK,GAAG,GAAG,CAAC;CACzD,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG;CACH;CACA,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,CAAC,MAAM,KAAK,EAAE;CAChB,EAAE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC9D,GAAG,iBAAiB,EAAE,CAAC;CACvB,EAAE,WAAW,EAAE,CAAC;CAChB,EAAE,IAAI,KAAK,YAAY,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,IAAIA,UAAQ,GAAG,MAAM,EAAE;CAChH,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC3B,GAAG;CACH,EAAE,MAAM,KAAK,CAAC;CACd,EAAE;CACF,CAAC;AACD;CACA,SAAS,iBAAiB,GAAG;CAC7B,CAAC,KAAK,IAAI,EAAE,IAAI,iBAAiB,CAAC,iBAAiB,EAAE;CACrD,EAAE,iBAAiB,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAClE,EAAE;CACF,CAAC,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC5C,CAAC;AACD;CACO,SAAS,IAAI,GAAG;CACvB,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE;CACpB,GAAG,IAAI,KAAK,GAAG,IAAI;CACnB,IAAI,OAAO,KAAK,CAAC;CACjB,QAAQ;CACR,IAAI,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC;CACnD,KAAK,cAAc,CAAC,aAAa,IAAI,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CACpE,IAAI,IAAI,SAAS,EAAE;CACnB,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;CAC1B,MAAM,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;CACtE,MAAM;CACN,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC7B,KAAK;CACL,KAAK,OAAO,KAAK,CAAC;CAClB,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC3B;CACA,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,cAAc,CAAC,aAAa,EAAE;CACrC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC;CACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACzB,KAAK,IAAI,GAAG,KAAK,WAAW;CAC5B,MAAM,GAAG,GAAG,UAAU,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CAC1B,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC7B,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACnC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACtB,IAAI;CACJ,GAAG,IAAI,cAAc,CAAC,UAAU;CAChC,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,OAAO,KAAK,CAAC;CAChB,GAAG;CACH,EAAE,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC1B;CACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CAC5B,EAAE,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAChC,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,GAAG;CACH,EAAE,IAAI,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;CACzC;CACA,GAAG,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC/E,GAAG,IAAI,MAAM,IAAI,IAAI;CACrB,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG;CACH,EAAE,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CACjC,EAAE,MAAM;CACR,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,QAAQ,KAAK;CACf,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,IAAIC,gBAAc,EAAE;CACxB,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;CACpB,KAAK,IAAI,KAAK,GAAG,CAAC;CAClB,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG;CACA,MAAM,OAAOA,gBAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAACA,gBAAc,CAAC,SAAS,EAAEA,gBAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG,KAAK;CACL,IAAI,OAAO,EAAE,CAAC;CACd,GAAG,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC;CAC3B,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACD,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,KAAK,SAAS;CAC3B,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CACjD,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACpC,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAI,IAAI,cAAc,CAAC,UAAU,GAAG,CAAC,EAAE;CACvC;CACA,KAAK,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAACA,UAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACvF,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAChF,KAAK;CACL,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACxD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACxD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC3D,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAACA,UAAQ,CAAC,CAAC;CAC7C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,QAAQ,CAAC,OAAO,CAACA,UAAQ,EAAE,CAAC,CAAC;CACxC,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,CAAC;CACxC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAACA,UAAQ,CAAC,GAAG,WAAW,CAAC;CACvD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACvD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC1F,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAACA,UAAQ,CAAC,CAAC;CAC5C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;CACrD,KAAK,MAAM;CACX,KAAK,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;CAC9C,KAAK,IAAI,SAAS,EAAE;CACpB,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE;CAC1B,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACrC,OAAO,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;CACrC,OAAOA,UAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,EAAE,CAAC;CAC1B,OAAO;CACP,OAAO,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,EAAEA,UAAQ,CAAC,CAAC,CAAC;CAC5D,MAAM;CACN,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC;CACpD,KAAK;CACL,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAKA,UAAQ,EAAE,CAAC;CAChB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAIA,UAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG;CACH,IAAI,IAAI,KAAK,IAAI,IAAI;CACrB,KAAK,OAAO,KAAK,GAAG,KAAK,CAAC;CAC1B,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;CAC7B,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACjE,KAAK,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC7B,KAAK,MAAM,KAAK,CAAC;CACjB,KAAK;CACL,IAAI,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,CAAC;AAC1D;CACA,GAAG;CACH,EAAE;CACF,CAAC;CACD,MAAM,SAAS,GAAG,2BAA2B,CAAC;CAC9C,SAAS,qBAAqB,CAAC,SAAS,EAAE,OAAO,EAAE;CACnD,CAAC,SAAS,UAAU,GAAG;CACvB;CACA,EAAE,IAAI,UAAU,CAAC,KAAK,EAAE,GAAG,yBAAyB,EAAE;CACtD,GAAG,IAAI,mBAAmB,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,mBAAmB,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,QAAQ,CAAC,GAAG,EAAE,2BAA2B,IAAI,cAAc,CAAC,UAAU,GAAG,eAAe,GAAG,EAAE,CAAC;CAC9I,KAAK,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,WAAW,GAAG,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;CAC9K,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB;CACA,IAAI,yBAAyB,GAAG,QAAQ,CAAC;CACzC,IAAI,OAAO,UAAU,EAAE,CAAC;CACxB,IAAI;CACJ,GAAG,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC;CAC/B,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACrE,GAAG,OAAO,mBAAmB,EAAE,CAAC;CAChC,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACpD,GAAG,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;CAC1B,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,IAAI,cAAc,CAAC,UAAU;CAC/B,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAChC,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE;CACF,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;CACtB,CAAC,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC,EAAE;CAC/B,EAAE,OAAO,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;CACrD,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,MAAM,sBAAsB,GAAG,CAAC,OAAO,EAAE,KAAK,KAAK;CACnD,CAAC,OAAO,WAAW;CACnB,EAAE,IAAI,QAAQ,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CACjC,EAAE,IAAI,QAAQ,KAAK,CAAC;CACpB,GAAG,OAAO,KAAK,EAAE,CAAC;CAClB,EAAE,IAAI,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC;CACnF,EAAE,IAAI,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;CAChE,EAAE,IAAI,CAAC,SAAS,EAAE;CAClB,GAAG,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;CACzD,GAAG;CACH,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;CACrB,GAAG,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;CAC9D,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC1B,EAAE,CAAC;CACH,CAAC,CAAC;AACF;CACO,SAAS,cAAc,GAAG;CACjC,CAAC,IAAI,gBAAgB,GAAG,SAAS,CAAC,MAAM;CACxC;CACA,EAAE,GAAG,GAAG,IAAI,CAAC;CACb,EAAE,OAAO,cAAc,CAAC,aAAa,EAAE,CAAC;CACxC,EAAE,CAAC,CAAC;CACJ,CAAC,OAAO,iBAAiB,GAAG,cAAc,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;CACjG,CAAC;AACD;CACA,IAAI,eAAe,GAAG,YAAY,CAAC;CACnC,IAAI,WAAW,GAAG,YAAY,CAAC;CAC/B,IAAI,YAAY,GAAG,YAAY,CAAC;CAChC,IAAI,YAAY,GAAG,YAAY,CAAC;AAEhC;CACO,SAAS,YAAY,CAAC,cAAc,EAAE;CAE7C,CAAC,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACjC,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC7B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC,SAAS,UAAU,CAAC,YAAY,EAAE;CACnC,EAAE,OAAO,SAAS,UAAU,CAAC,MAAM,EAAE;CACrC,GAAG,IAAI,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;CAC1C,GAAG,IAAI,MAAM,IAAI,IAAI,EAAE;CACvB,IAAI,IAAIC,gBAAc;CACtB,KAAK,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CACjC,IAAI,IAAI,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;CACpC,IAAI,IAAI,UAAU,GAAG,cAAc,CAACD,UAAQ,GAAG,YAAY,GAAG,UAAU,EAAE,MAAM,GAAG,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC3G,IAAI,IAAI,OAAO,UAAU,IAAI,QAAQ,EAAE;CACvC,KAAK,MAAM,GAAG,UAAU,CAAC;CACzB,KAAK,OAAO,GAAG,WAAW,CAAC;CAC3B,KAAK,MAAM;CACX,KAAK,OAAO,GAAG,UAAU,CAAC;CAC1B,KAAK,cAAc,GAAG,CAAC,CAAC;CACxB,KAAK,YAAY,GAAG,CAAC,CAAC;CACtB,KAAK,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;CACzB,KAAK,IAAI,MAAM,KAAK,SAAS;CAC7B,MAAM,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CAClD,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;CACvC,GAAG,IAAI,eAAe,IAAI,MAAM,EAAE;CAClC,IAAIA,UAAQ,IAAI,MAAM,CAAC;CACvB,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,SAAS,GAAG,MAAM,CAAC;CACtB,GAAG,cAAc,GAAGA,UAAQ,CAAC;CAC7B,GAAG,YAAY,GAAGA,UAAQ,GAAG,eAAe,CAAC;CAC7C,GAAGA,UAAQ,IAAI,MAAM,CAAC;CACtB,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAClC,GAAG,CAAC;CACJ,EAAE;CACF,CAAC;CACD,SAAS,YAAY,CAAC,MAAM,EAAE;CAC9B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE;CAClB,EAAE,IAAI,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;CACtC,GAAG,OAAO,MAAM,CAAC;CACjB,EAAE;CACF,CAAC,IAAI,MAAM,GAAG,EAAE,IAAI,OAAO;CAC3B,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC,CAAC;CACpE,CAAC,MAAM,GAAG,GAAGA,UAAQ,GAAG,MAAM,CAAC;CAC/B,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;CAClB,CAAC,MAAM,GAAG,EAAE,CAAC;CACb,CAAC,OAAOA,UAAQ,GAAG,GAAG,EAAE;CACxB,EAAE,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAChC,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE;CAC5B;CACA,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrB,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;CACnD;CACA,GAAG,IAAI,SAAS,GAAG,IAAI,EAAE;CACzB,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;CACnE;CACA;CACA,GAAG,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;CAC1E,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;CACnF;CACA;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,QAAQ,EAAE;CAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,EAAE;CAC7B,IAAI,IAAI,IAAI,OAAO,CAAC;CACpB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC;CACjD,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;CACnC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtB,GAAG;AACH;CACA,EAAE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE;CAC9B,GAAG,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC/C,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;CACpB,GAAG;CACH,EAAE;AACF;CACA,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;CACvB,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC9C,EAAE;AACF;CACA,CAAC,OAAO,MAAM,CAAC;CACf,CAAC;AAWD;CACA,SAAS,SAAS,CAAC,MAAM,EAAE;CAC3B,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACpB,EAAE;CACF,CAAC,IAAI,cAAc,CAAC,UAAU;CAC9B,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;AACD;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,cAAc,CAAC,aAAa,EAAE;CACnC,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACvB,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,MAAM;CACR,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,GAAG,CAAC;CACb,EAAE;CACF,CAAC;AACD;CACA,IAAI,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;CACvC,SAAS,cAAc,CAAC,MAAM,EAAE;CAChC,CAAC,IAAI,KAAK,GAAGA,UAAQ,CAAC;CACtB,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,MAAM,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC/B,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,IAAIA,UAAQ,GAAG,KAAK,CAAC;CACrB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;CACnB,GAAG;CACH,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,CAAC;CACD,SAAS,eAAe,CAAC,MAAM,EAAE;CACjC,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;CACjB,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,EAAE,CAAC;CACd,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAChC,GAAG;CACH,EAAE,MAAM;CACR,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC5E,GAAGA,UAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,OAAO;CACV,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpC,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,IAAI;CACJ,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;CACzB,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC1C,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC7E,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,EAAE,EAAE;CACpB,IAAI,IAAI,MAAM,KAAK,CAAC;CACpB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjD,SAAS;CACT,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpD,KAAK;CACL,IAAI,MAAM,IAAI,MAAM,GAAG,EAAE,EAAE;CAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1C,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE;CACnB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvD,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzD,IAAI,MAAM;CACV,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC9E,KAAKA,UAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE;CACrB,KAAK,IAAI,MAAM,KAAK,EAAE;CACtB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9D,UAAU;CACV,MAAM,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1B,OAAOA,UAAQ,IAAI,EAAE,CAAC;CACtB,OAAO,OAAO;CACd,OAAO;CACP,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjE,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC3C,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,IAAI,MAAM,GAAG,EAAE;CACpB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpE,KAAK,IAAI,CAAC,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAMA,UAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE;CACF,CAAC;AACD;CACA,SAAS,gBAAgB,GAAG;CAC5B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CACxB,EAAE,MAAM;CACR,EAAE,OAAO,KAAK;CACd,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC7B,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,CAAC;CAC1C,IAAIA,UAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG;CACH,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;CACvC,GAAG;CACH,EAAE;CACF,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CAC7B,CAAC;AACD;AACA;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,OAAO,cAAc,CAAC,WAAW;CAClC;CACA,EAAE,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAEA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC;CACpE,EAAE,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAEA,UAAQ,IAAI,MAAM,CAAC,CAAC;CAC7C,CAAC;CACD,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,IAAI,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC5B,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE;CAC9B,EAAE,IAAI,GAAG,CAAC;CACV,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAACA,UAAQ,EAAE,GAAG,IAAIA,UAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK;CACvG,GAAGA,UAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,OAAO,IAAI,EAAE,CAAC;CAClB,IAAI,SAAS;CACb,IAAIA,UAAQ,GAAG,GAAG,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE;CACF;CACA,EAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,IAAI,CAAC,CAAC;CACpD,CAAC;AACD;CACA,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;CAC/B,SAAS,OAAO,GAAG;CACnB,CAAC,IAAI,MAAM,GAAG,GAAG,CAACA,UAAQ,EAAE,CAAC,CAAC;CAC9B,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACtC;CACA,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACzB,EAAE,IAAI,YAAY,IAAIA,UAAQ;CAC9B,GAAG,OAAO,SAAS,CAAC,KAAK,CAACA,UAAQ,GAAG,cAAc,EAAE,CAACA,UAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,OAAO,IAAI,EAAE,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC;CAC/C,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CAClC,EAAE,MAAM;CACR,EAAEA,UAAQ,EAAE,CAAC;CACb,EAAE,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,CAACA,UAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAClH,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;CAC3B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAC9B,CAAC,IAAI,GAAG,GAAGA,UAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;CACjC,CAAC,IAAI,KAAK,CAAC;CACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACX,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,EAAE;CACrC,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC7C,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG,aAAa,IAAI,CAAC,CAAC;CACtB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAChC,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG;CACH,EAAE,IAAI,aAAa,KAAK,GAAG,EAAE;CAC7B,GAAGA,UAAQ,GAAG,aAAa,CAAC;CAC5B,GAAG,OAAO,KAAK,CAAC,MAAM,CAAC;CACvB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,aAAa,GAAGA,UAAQ,CAAC;CAC3B,EAAE;CACF,CAAC,KAAK,GAAG,EAAE,CAAC;CACZ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;CACvB,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;CACtB,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC5C,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE,aAAa,IAAI,CAAC,CAAC;CACrB,EAAE;CACF,CAAC,GAAG,IAAI,CAAC,CAAC;CACV,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAC/B,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE;CACF;CACA,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC7E,CAAC,IAAI,MAAM,IAAI,IAAI;CACnB,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CAC/B,CAAC,OAAO,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;CAC/C,CAAC;AACD;CACA,SAAS,YAAY,CAAC,QAAQ,EAAE;CAChC;CACA,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC;CACnD,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,SAAS,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAC;CAC/H,CAAC,IAAI,QAAQ,IAAI,IAAI,EAAE,OAAO,QAAQ,GAAG,EAAE,CAAC;CAC5C,CAAC,IAAI,cAAc,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE;CACvK,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;CACpC,EAAE;CACF,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,kCAAkC,EAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC;CACD;CACA,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK;CAC3C,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CAC1C;CACA,CAAC,IAAI,SAAS,GAAG,EAAE,CAAC;CACpB,CAAC,IAAI,QAAQ,KAAK,SAAS,EAAE;CAC7B,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CAClE,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;CAChC,EAAE;CACF,CAAC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAC/C;CACA;CACA;CACA,CAAC,IAAI,iBAAiB,KAAK,iBAAiB,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE;CAC1E,EAAE,CAAC,iBAAiB,CAAC,iBAAiB,KAAK,iBAAiB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAC;CAC9G,EAAE;CACF,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;CACnC,CAAC,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;CAC9D,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CACzB,CAAC,CAAC;CACF,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;CAChC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;AACrC;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;CAClC,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;CAC7C,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC/D,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACtC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;CACrB,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1B,EAAE;CACF,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;CACrC,EAAE,IAAI,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACzE,EAAE,IAAI,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,MAAM,IAAI,EAAE,EAAE;CACrB,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;CACvC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;CAC7C,KAAK,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CACxB,KAAK,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CACjC,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ;CACA,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;CAC3C,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACnC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;CACvD,GAAG,CAAC;CACJ,EAAE,IAAI,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACpG,EAAE;CACF,CAAC,OAAO,IAAI,CAAC;CACb,CAAC,CAAC;AACF;CACA,IAAI,MAAM,GAAG;CACb,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,cAAc,KAAK,UAAU,GAAG,cAAc,GAAG,IAAI;CAC7J,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;CACvB,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACjD,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,EAAE,OAAO,KAAK,CAAC;CACf,EAAE;CACF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACrD,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,CAAC,YAAY;CAClB,EAAE,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;CAC3B,CAAC,IAAI,KAAK,GAAG,GAAG,CAACA,UAAQ,CAAC,CAAC;CAC3B,CAAC,IAAI,MAAM,CAAC;CACZ;CACA,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACpE,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACzE,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAACA,UAAQ,GAAG,CAAC,CAAC,KAAK,IAAI;CAC1G,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB;CACA,EAAE,MAAM,GAAG,EAAE,CAAC;AACd;CACA,CAAC,IAAI,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;CAChC,CAAC,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;CAC/B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;CACrB;CACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CAC5C,EAAE,MAAM;CACR;CACA,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CAC1C,EAAE;AACF;CACA;CACA,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAClE,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC5D,CAAC,OAAO,MAAM,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAACA,UAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CACrC,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;CACtB,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC;CACxB,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AAChD;CACO,MAAM,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC;AACpK;CACA,IAAI,IAAI,GAAG,OAAO,UAAU,KAAK,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAC;CAChE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACxB;CACA,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D;CACA,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,CAAC,IAAI,CAAC,cAAc,EAAE;CACtB,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC;CACrC,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;CACnD,EAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,QAAQ,CAAC,CAAC;CACrE,EAAE;CACF,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;CACzC,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;CACF,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CAC7E,CAAC,IAAI,YAAY,GAAGA,UAAQ,CAAC;CAC7B,CAACA,UAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;CACpC,CAACC,gBAAc,GAAG,WAAW,CAAC;CAC9B,CAACA,gBAAc,GAAG,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;CAC3D,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAACA,gBAAc,CAAC,kBAAkB,GAAGD,UAAQ,CAAC;CAC9C,CAACA,UAAQ,GAAG,YAAY,CAAC;CACzB,CAAC,OAAO,IAAI,EAAE,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CACrB,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC7F,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CAC1B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO;CAClF,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9G,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;CAC3B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO;CAC3E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9K;CACA,EAAE,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;CAC7B,CAAC,CAAC;CACF;CACA;AACA;CACA,SAAS,SAAS,CAAC,QAAQ,EAAE;CAC7B,CAAC,IAAI,cAAc,IAAI,cAAc,CAAC,YAAY;CAClD,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC;CAChC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC;CAC1B,CAAC,IAAI,aAAa,GAAGA,UAAQ,CAAC;CAC9B,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,cAAc,GAAG,SAAS,CAAC;CAChC,CAAC,IAAI,YAAY,GAAG,OAAO,CAAC;CAC5B,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,mBAAmB,GAAGC,gBAAc,CAAC;AAC1C;CACA;CACA,CAAC,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACrD,CAAC,IAAI,eAAe,GAAG,iBAAiB,CAAC;CACzC,CAAC,IAAI,uBAAuB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;CACpF,CAAC,IAAI,UAAU,GAAG,cAAc,CAAC;CACjC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;CACxB,CAAC,MAAM,GAAG,WAAW,CAAC;CACtB,CAACD,UAAQ,GAAG,aAAa,CAAC;CAC1B,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAAC,SAAS,GAAG,cAAc,CAAC;CAC5B,CAAC,OAAO,GAAG,YAAY,CAAC;CACxB,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAACC,gBAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,GAAG,GAAG,QAAQ,CAAC;CAChB,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,iBAAiB,GAAG,eAAe,CAAC;CACrC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,EAAE,GAAG,uBAAuB,CAAC,CAAC;CACnF,CAAC,cAAc,GAAG,UAAU,CAAC;CAC7B,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;CACrE,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;CACM,SAAS,WAAW,GAAG;CAC9B,CAAC,GAAG,GAAG,IAAI,CAAC;CACZ,CAAC,YAAY,GAAG,IAAI,CAAC;CACrB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC1B,CAAC;AACD;CACO,SAASE,cAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,MAAM;CACrB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;CACvD;CACA,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;CAChD,CAAC;AACD;CACO,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;CACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CAC9B,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;CACvD,CAAC;CAED,IAAI,cAAc,GAAG,IAAID,SAAO,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;CACjD,MAAME,QAAM,GAAG,cAAc,CAAC,MAAM,CAAC;CACrC,MAAMC,gBAAc,GAAG,cAAc,CAAC,cAAc,CAAC;CACtC,cAAc,CAAC,OAAO;CACrC,MAAM,eAAe,GAAG;CAC/B,CAAC,KAAK,EAAE,CAAC;CACT,CAAC,MAAM,EAAE,CAAC;CACV,CAAC,aAAa,EAAE,CAAC;CACjB,CAAC,WAAW,EAAE,CAAC;CACf,CAAC,CAAC;CACF,IAAI,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;CACnC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7C,SAASC,cAAY,CAAC,aAAa,EAAE;CAC5C,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;CAC7B,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC,OAAO,CAAC,CAAC,UAAU,GAAG,aAAa,IAAI,aAAa,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAC5F,CAAC;CACD;CACA;CACA;AACAJ,UAAO,CAAC,qBAAqB,GAAG,IAAI;;CCptCpC,IAAI,WAAW,CAAC;CAChB,IAAI;CACJ,CAAC,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;CACjC,CAAC,CAAC,OAAO,KAAK,EAAE,EAAE;CAClB,IAAI,UAAU,EAAE,gBAAgB,CAAC;CACjC,MAAM,aAAa,GAAG,OAAO,MAAM,KAAK,WAAW,CAAC;CACpD,MAAM,iBAAiB,GAAG,aAAa;CACvC,CAAC,SAAS,MAAM,EAAE,EAAE,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,UAAU,CAAC;CAC1E,MAAM,SAAS,GAAG,aAAa,GAAG,MAAM,GAAG,UAAU,CAAC;CACtD,MAAM,eAAe,GAAG,aAAa,GAAG,WAAW,GAAG,UAAU,CAAC;CACjE,IAAI,MAAM,EAAE,UAAU,CAAC;CACvB,IAAI,UAAU,CAAC;CACf,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI,OAAO,CAAC;CACZ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,MAAM,eAAe,GAAG,MAAM,CAAC;CAC/B,MAAM,WAAW,GAAG,iBAAiB,CAAC;CAC/B,MAAM,aAAa,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;eAC1C,MAAM,KAAK,SAASA,SAAO,CAAC;CACnC,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;CACjB,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;CAElB,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,IAAI,eAAe,CAAC;CACtB,EAAE,IAAI,UAAU,CAAC;CACjB,EAAE,IAAI,YAAY,CAAC;CACnB,EAAE,IAAI,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,SAAS,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9E,GAAG,OAAO,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG,GAAG,CAAC,WAAW,IAAI,WAAW,CAAC,UAAU;CAC5C,GAAG,SAAS,MAAM,EAAE,QAAQ,EAAE;CAC9B,IAAI,OAAO,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;CAC7E,IAAI,GAAG,KAAK,CAAC;AACb;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,CAAC;CACnB,EAAE,IAAI,CAAC,OAAO;CACd,GAAG,OAAO,GAAG,EAAE,CAAC;CAChB,EAAE,IAAI,YAAY,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC;CACnD,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,cAAc,CAAC;CACzE,EAAE,IAAI,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,CAAC;CACxD,EAAE,IAAI,mBAAmB,IAAI,IAAI;CACjC,GAAG,mBAAmB,GAAG,mBAAmB,GAAG,EAAE,GAAG,CAAC,CAAC;CACtD,EAAE,IAAI,mBAAmB,GAAG,IAAI;CAChC,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,EAAE,IAAI,OAAO,CAAC,eAAe,IAAI,OAAO,CAAC,SAAS,IAAI,SAAS,EAAE;CACjE,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,CAAC;CAClD,EAAE,IAAI,gBAAgB,IAAI,IAAI;CAC9B,GAAG,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,GAAG,EAAE,CAAC;CACpD,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK;CACrD,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB;CACA,EAAE,IAAI,iBAAiB,GAAG,mBAAmB,GAAG,EAAE,KAAK,gBAAgB,GAAG,mBAAmB,GAAG,EAAE,CAAC,CAAC;CACpG,EAAE,IAAI,aAAa,GAAG,mBAAmB,GAAG,IAAI,CAAC;CACjD,EAAE,IAAI,cAAc,GAAG,mBAAmB,GAAG,gBAAgB,GAAG,IAAI,CAAC;CACrE,EAAE,IAAI,cAAc,GAAG,IAAI,EAAE;CAC7B,GAAG,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;CAC3E,GAAG;CACH,EAAE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC7B,EAAE,IAAI,gBAAgB,GAAG,CAAC,CAAC;CAC3B,EAAE,IAAI,oCAAoC,GAAG,CAAC,CAAC;AAC/C;CACA,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,SAAS,KAAK,EAAE,aAAa,EAAE;CAC3D,GAAG,IAAI,CAAC,MAAM,EAAE;CAChB,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACzC,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAC7F,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,IAAI,OAAO,GAAG,QAAQ,GAAG,KAAK,EAAE;CACnC;CACA,IAAI,MAAM,GAAG,IAAI,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAClD,IAAI,UAAU,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;CACtG,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;CACjB,IAAI;CACJ,IAAI,QAAQ,GAAG,CAAC,QAAQ,GAAG,CAAC,IAAI,UAAU,CAAC;CAC3C,GAAG,KAAK,GAAG,QAAQ,CAAC;CACpB,GAAG,IAAI,aAAa,GAAG,mBAAmB,EAAE,QAAQ,KAAK,aAAa,GAAG,IAAI,CAAC,CAAC;CAC/E,GAAG,YAAY,GAAG,KAAK,CAAC,eAAe,GAAG,IAAI,GAAG,EAAE,GAAG,IAAI,CAAC;CAC3D,GAAG,IAAI,KAAK,CAAC,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CACzD,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,cAAc,CAAC,IAAI,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,IAAI,cAAc,GAAG,IAAI,CAAC;CAC1B,GAAG,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;CACjC,GAAG,IAAI,UAAU,EAAE;CACnB,IAAI,IAAI,UAAU,CAAC,aAAa;CAChC,KAAK,UAAU,GAAG,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,CAAC;CAChE,IAAI,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACpD,IAAI,IAAI,YAAY,GAAG,mBAAmB,EAAE;CAC5C;CACA,KAAK,MAAM,IAAI,KAAK,CAAC,oGAAoG,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;CACrJ,KAAK;CACL,IAAI,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE;CACjC;CACA,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAClD,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;CAC5C,MAAM,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,CAAC,IAAI;CACf,OAAO,SAAS;CAChB,MAAM,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC9D,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,UAAU,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;CAC3C,MAAM;CACN,KAAK,IAAI,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACnD,KAAK;CACL,IAAI,IAAI,CAAC,YAAY,EAAE;CACvB,KAAK,UAAU,CAAC,MAAM,GAAG,YAAY,GAAG,IAAI,CAAC;CAC7C,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,eAAe;CACtB,IAAI,eAAe,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,aAAa,CAAC;CACrB,GAAG,IAAI;CACP,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;CAClE,KAAK,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1D,UAAU,IAAI,KAAK,CAAC,WAAW,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,IAAI,KAAK,YAAY,QAAQ,CAAC,EAAE;CACnI;CACA,MAAM,WAAW,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC;CACzD,MAAM,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC;CACxB,KAAK;CACL,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;CACjB,IAAI,IAAI,UAAU,GAAG,cAAc,CAAC;CACpC,IAAI,IAAI,cAAc;CACtB,KAAK,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CAClC,IAAI,IAAI,YAAY,IAAI,YAAY,CAAC,WAAW,EAAE;CAClD,KAAK,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7F,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;CAChC,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAChC,KAAK,OAAO,UAAU,IAAI,CAAC,GAAG,CAAC,EAAE;CACjC,MAAM,IAAI,cAAc,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;CAC3D,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,eAAe,GAAG,KAAK,CAAC,IAAI,iBAAiB,KAAK,CAAC,CAAC;CAC3F,OAAO,iBAAiB,GAAG,CAAC,CAAC;CAC7B,MAAM,IAAI,cAAc,IAAI,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,EAAE;CAC1D,OAAO,IAAI,iBAAiB,IAAI,CAAC;CACjC,QAAQ,iBAAiB,IAAI,CAAC,CAAC;CAC/B,OAAO,MAAM;CACb,OAAO,IAAI,iBAAiB,IAAI,CAAC,EAAE;CACnC;CACA,QAAQ,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACxD,SAAS,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAChF,QAAQ,iBAAiB,GAAG,CAAC,CAAC,CAAC;CAC/B,QAAQ;CACR,OAAO,UAAU,GAAG,UAAU,CAAC,QAAQ,CAAC;CACxC,OAAO,CAAC,EAAE,CAAC;CACX,OAAO;CACP,MAAM;CACN,KAAK,IAAI,iBAAiB,IAAI,CAAC,IAAI,UAAU,EAAE;CAC/C;CACA,MAAM,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK;CACtD,OAAO,UAAU,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,GAAG,KAAK,CAAC,GAAG,iBAAiB,CAAC,CAAC;CAC9E,MAAM;CACN,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CACxC,KAAK,IAAI,QAAQ,GAAG,OAAO;CAC3B,MAAM,QAAQ,CAAC,QAAQ,CAAC,CAAC;CACzB,KAAK,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC7B,KAAK,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;CAC/E,KAAK,YAAY,GAAG,IAAI,CAAC;CACzB,KAAK,OAAO,UAAU,CAAC;CACvB,KAAK;CACL,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;CAC5B,IAAI,IAAI,aAAa,GAAG,iBAAiB,EAAE;CAC3C,KAAK,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;CAC1B,KAAK,MAAM,CAAC,GAAG,GAAG,QAAQ,CAAC;CAC3B,KAAK,OAAO,MAAM,CAAC;CACnB,KAAK;CACL,IAAI,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC5C,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,aAAa,GAAG,KAAK,CAAC;CAC1B,IAAI,MAAM,KAAK,CAAC;CAChB,IAAI,SAAS;CACb,IAAI,IAAI,UAAU,EAAE;CACpB,KAAK,eAAe,EAAE,CAAC;CACvB,KAAK,IAAI,eAAe,IAAI,KAAK,CAAC,cAAc,EAAE;CAClD,MAAM,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACtD;CACA,MAAM,IAAI,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;CAC1D,MAAM,IAAI,aAAa,GAAG,CAAC,KAAK,CAAC,kBAAkB,IAAI,iBAAiB,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;CAC7F,MAAM,IAAI,CAAC,aAAa,EAAE;CAC1B,OAAO,IAAI,KAAK,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,CAAC,YAAY,CAAC,KAAK,KAAK,EAAE;CACtF;CACA,QAAQ,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;CAChD,QAAQ;CACR,OAAO,KAAK,CAAC,yBAAyB,GAAG,YAAY,CAAC;CACtD;CACA,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACrD,OAAO,OAAO,YAAY,CAAC;CAC3B,OAAO;CACP,MAAM;CACN,KAAK;CACL;CACA,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CAClD,IAAI,IAAI,aAAa,GAAG,iBAAiB;CACzC,KAAK,QAAQ,GAAG,KAAK,CAAC;CACtB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,MAAM;CAChC,GAAG,IAAI,oCAAoC,GAAG,EAAE;CAChD,IAAI,oCAAoC,EAAE,CAAC;CAC3C,GAAG,IAAI,YAAY,GAAG,UAAU,CAAC,YAAY,IAAI,CAAC,CAAC;CACnD,GAAG,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,IAAI,CAAC,YAAY;CACxD,IAAI,UAAU,CAAC,MAAM,GAAG,YAAY,CAAC;CACrC,GAAG,IAAI,gBAAgB,GAAG,KAAK,EAAE;CACjC;CACA,IAAI,UAAU,CAAC,WAAW,GAAG,IAAI,CAAC;CAClC,IAAI,oCAAoC,GAAG,CAAC,CAAC;CAC7C,IAAI,gBAAgB,GAAG,CAAC,CAAC;CACzB,IAAI,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACpC,KAAK,iBAAiB,GAAG,EAAE,CAAC;CAC5B,IAAI,MAAM,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE;CAC7D,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC9D,KAAK,iBAAiB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAC7C,KAAK;CACL,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,KAAK,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;CAC7B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACpC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,IAAI,GAAG,CAAC,KAAK,KAAK;CAC1B,GAAG,IAAI,QAAQ,GAAG,OAAO;CACzB,IAAI,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAChC;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,KAAK,CAAC;CAC3B,GAAG,IAAI,MAAM,CAAC;CACd,GAAG,IAAI,IAAI,KAAK,QAAQ,EAAE;CAC1B,IAAI,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;CACjC,IAAI,IAAI,cAAc,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,MAAM,EAAE;CAChE,KAAK,IAAI,CAAC,cAAc,CAAC,IAAI,IAAI,SAAS,IAAI,eAAe,EAAE;CAC/D,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,QAAQ,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;CAC5G,MAAM,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACvC,OAAO,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;CAC9C,MAAM,IAAI,UAAU,CAAC;CACrB,MAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;CACnC,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC/B,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;CACpC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,KAAK,GAAG,CAAC,EAAE,QAAQ,GAAG,KAAK,GAAG,QAAQ,CAAC,CAAC;CAC/E,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;CACnC,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO;CACP,MAAM,cAAc,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;CAChC,MAAM,cAAc,CAAC,QAAQ,GAAG,UAAU,CAAC;CAC3C,MAAM,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;CAC9B,MAAM,cAAc,CAAC,QAAQ,GAAG,QAAQ,CAAC;CACzC,MAAM;CACN,KAAK,IAAI,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CAC3C,KAAK,cAAc,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAC9C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,IAAI,CAAC,OAAO,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC;CAC5C,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,UAAU,CAAC;CACnB;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,EAAE;CAC1B,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,KAAK,EAAE;CAClC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM,IAAI,SAAS,GAAG,OAAO,EAAE;CACpC,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK,MAAM;CACX,KAAK,UAAU,GAAG,CAAC,CAAC;CACpB,KAAK;CACL,IAAI,IAAI,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;CACjC,IAAI,IAAI,QAAQ,GAAG,QAAQ,GAAG,OAAO;CACrC,KAAK,MAAM,GAAG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC;AAC5C;CACA,IAAI,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACzC,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CACxD,KAAK,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;CACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;CAC/B,MAAM,IAAI,EAAE,GAAG,IAAI,EAAE;CACrB,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,CAAC;CAClC,OAAO,MAAM,IAAI,EAAE,GAAG,KAAK,EAAE;CAC7B,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;CAC9C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,CAAC,EAAE,GAAG,MAAM,MAAM,MAAM;CAC/B,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,MAAM;CAC3D,QAAQ;CACR,OAAO,EAAE,GAAG,OAAO,IAAI,CAAC,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,MAAM,CAAC,CAAC;CAC5D,OAAO,CAAC,EAAE,CAAC;CACX,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CACtD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO,MAAM;CACb,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;CAC/C,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CACrD,OAAO,MAAM,CAAC,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;CAChD,OAAO;CACP,MAAM;CACN,KAAK,MAAM,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,CAAC;CAClD,KAAK,MAAM;CACX,KAAK,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;CACvD,KAAK;AACL;CACA,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACxC,KAAK,MAAM,IAAI,MAAM,GAAG,KAAK,EAAE;CAC/B,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CACjC,KAAK,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACjC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACtC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACxC,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE;CACzB,MAAM,MAAM,CAAC,UAAU,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;CAC3E,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,QAAQ,IAAI,MAAM,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,KAAK,CAAC,KAAK,KAAK,EAAE;CAC/B;CACA,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE;CAC9G,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,KAAK,EAAE;CAC/B,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC;CACjC,MAAM,MAAM,IAAI,KAAK,GAAG,OAAO,EAAE;CACjC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;CACtC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC;CACxC,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,EAAE;CACrC,KAAK,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CACzB,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC;CACzC,MAAM,MAAM,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,MAAM;CACZ,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC3C,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,UAAU,CAAC;CACpB,KAAK,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,KAAK,GAAG,WAAW,IAAI,KAAK,IAAI,CAAC,UAAU,EAAE;CAC5F,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,MAAM,IAAI,QAAQ,CAAC;CACnB,MAAM,IAAI,UAAU,GAAG,CAAC;CACxB;CACA,QAAQ,CAAC,CAAC,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,QAAQ,EAAE;CACzH,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,QAAQ,EAAE,CAAC;CAClB,MAAM;CACN,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC5C,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,UAAU,EAAE;CACxD,IAAI,IAAI,CAAC,KAAK;CACd,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,IAAI,YAAY,EAAE;CACvB,MAAM,IAAI,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;CAC5C,MAAM,IAAI,OAAO,EAAE;CACnB,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE;CACxB,QAAQ,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,KAAK,YAAY,CAAC,WAAW,GAAG,EAAE,CAAC,CAAC;CACtF,QAAQ,OAAO,CAAC,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;CAC/C,QAAQ;CACR,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACjC,OAAO,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;CAClD,OAAO,QAAQ,IAAI,CAAC,CAAC;CACrB,OAAO,OAAO;CACd,OAAO;CACP,OAAO,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,KAAK,EAAE,CAAC,CAAC;CAC7D,MAAM;CACN,KAAK,IAAI,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;CACzC,KAAK,IAAI,WAAW,KAAK,MAAM,EAAE;CACjC,MAAM,WAAW,CAAC,KAAK,CAAC,CAAC;CACzB,MAAM,MAAM,IAAI,WAAW,KAAK,KAAK,EAAE;CACvC,MAAM,SAAS,CAAC,KAAK,CAAC,CAAC;CACvB,MAAM,MAAM,IAAI,WAAW,KAAK,GAAG,EAAE;CACrC,MAAM,IAAI,IAAI,CAAC,gBAAgB,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3D,WAAW;CACX,OAAO,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;CAC3B,OAAO,IAAI,MAAM,GAAG,IAAI,EAAE;CAC1B,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CAC3C,QAAQ,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CACpC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACzC,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAClC,QAAQ,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC/C,QAAQ,QAAQ,IAAI,CAAC,CAAC;CACtB,QAAQ;CACR,OAAO,KAAK,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE;CAC5C,QAAQ,IAAI,CAAC,GAAG,CAAC,CAAC;CAClB,QAAQ,IAAI,CAAC,UAAU,CAAC,CAAC;CACzB,QAAQ;CACR,OAAO;CACP,MAAM,MAAM;CACZ,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACzD,OAAO,IAAI,cAAc,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,OAAO,IAAI,KAAK,YAAY,cAAc,EAAE;CAC5C,QAAQ,IAAI,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACtC,QAAQ,IAAI,SAAS,CAAC,KAAK,EAAE;CAC7B,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE;CAC7B,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACpC,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;CAC9C,UAAU,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CACjC,UAAU;CACV,SAAS,IAAI,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;CAC7D,SAAS,IAAI,WAAW,KAAK,KAAK,EAAE;CACpC,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CACpC,WAAW,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,WAAW,MAAM;CACjB,WAAW,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,WAAW;CACX,UAAU,MAAM;CAChB,UAAU,IAAI,CAAC,WAAW,CAAC,CAAC;CAC5B,UAAU;CACV,SAAS,OAAO;CAChB,SAAS;CACT,QAAQ,IAAI,aAAa,GAAG,MAAM,CAAC;CACnC,QAAQ,IAAI,iBAAiB,GAAG,UAAU,CAAC;CAC3C,QAAQ,IAAI,eAAe,GAAG,QAAQ,CAAC;CACvC,QAAQ,MAAM,GAAG,IAAI,CAAC;CACtB,QAAQ,IAAI,MAAM,CAAC;CACnB,QAAQ,IAAI;CACZ,SAAS,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,IAAI,KAAK;CAC7D;CACA,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,aAAa,GAAG,IAAI,CAAC;CAC/B,UAAU,QAAQ,IAAI,IAAI,CAAC;CAC3B,UAAU,IAAI,QAAQ,GAAG,OAAO;CAChC,WAAW,QAAQ,CAAC,QAAQ,CAAC,CAAC;CAC9B,UAAU,OAAO;CACjB,WAAW,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ,GAAG,IAAI;CACxD,WAAW,CAAC;CACZ,UAAU,EAAE,IAAI,CAAC,CAAC;CAClB,SAAS,SAAS;CAClB;CACA,SAAS,IAAI,aAAa,EAAE;CAC5B,UAAU,MAAM,GAAG,aAAa,CAAC;CACjC,UAAU,UAAU,GAAG,iBAAiB,CAAC;CACzC,UAAU,QAAQ,GAAG,eAAe,CAAC;CACrC,UAAU,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CACvC,UAAU;CACV,SAAS;CACT,QAAQ,IAAI,MAAM,EAAE;CACpB,SAAS,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC/C,UAAU,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CAC7C,SAAS,QAAQ,GAAG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACjF,SAAS;CACT,QAAQ,OAAO;CACf,QAAQ;CACR,OAAO;CACP;CACA,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;CAChC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CACxB,OAAO,MAAM;CACb;CACA,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE;CACzB,QAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;CACpC;CACA,QAAQ,IAAI,IAAI,KAAK,KAAK;CAC1B,SAAS,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;CAC3B,QAAQ;AACR;CACA;CACA,OAAO,IAAI,IAAI,KAAK,UAAU;CAC9B,QAAQ,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACrE;CACA;CACA,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC1B,OAAO;CACP,MAAM;CACN,KAAK;CACL,IAAI,MAAM,IAAI,IAAI,KAAK,SAAS,EAAE;CAClC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;CAC7C,IAAI,MAAM,IAAI,IAAI,KAAK,QAAQ,EAAE;CACjC,IAAI,IAAI,KAAK,GAAG,kBAAkB,IAAI,KAAK,IAAI,CAAC,kBAAkB,EAAE;CACpE;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC7C,KAAK,MAAM,IAAI,KAAK,GAAG,mBAAmB,IAAI,KAAK,GAAG,CAAC,EAAE;CACzD;CACA,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,UAAU,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;CAC9C,KAAK,MAAM;CACX;CACA,KAAK,IAAI,IAAI,CAAC,kBAAkB,EAAE;CAClC,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,MAAM,UAAU,CAAC,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;CACrD,MAAM,MAAM,IAAI,IAAI,CAAC,mBAAmB,EAAE;CAC1C,MAAM,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;CACpC,MAAM,MAAM,IAAI,IAAI,CAAC,kBAAkB,IAAI,IAAI,CAAC,SAAS,EAAE;CAC3D,MAAM,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;AACrD;CACA,MAAM,IAAI,KAAK,CAAC;CAChB,MAAM,IAAI,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE;CAC9C,OAAO,IAAI,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;CAC1D,OAAO,IAAI,MAAM,GAAG,EAAE,CAAC;CACvB,OAAO,OAAO,IAAI,EAAE;CACpB,QAAQ,MAAM,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CAClC,QAAQ,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,CAAC,MAAM,KAAK,EAAE,MAAM;CACnD,QAAQ,KAAK,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CAC7B,QAAQ;AACR;CACA,OAAO,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC;CACjE,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;CACvB,OAAO,MAAM;CACb,OAAO,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;CAC9B,OAAO,IAAI,MAAM,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;CAC3D,OAAO,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;CAC9B,QAAQ,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;CAC9B,QAAQ,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE;CACvD,QAAQ,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;CAC/B,QAAQ;AACR;CACA,OAAO,IAAI,aAAa,EAAE;CAC1B,QAAQ,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,QAAQ,MAAM;CACd,QAAQ,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAClD,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;CAC/C,SAAS,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CACjE,SAAS;CACT,QAAQ;AACR;CACA,OAAO,IAAI,MAAM,EAAE;CACnB,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CACpE,QAAQ;CACR,OAAO;AACP;CACA,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,OAAO;CAC3C,OAAO,QAAQ,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;CACzC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;CACnE,MAAM,OAAO;CACb,MAAM,MAAM;CACZ,MAAM,MAAM,IAAI,UAAU,CAAC,KAAK,GAAG,iEAAiE;CACpG,OAAO,+EAA+E;CACtF,OAAO,2CAA2C,CAAC,CAAC;CACpD,MAAM;CACN,KAAK;CACL,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM,IAAI,IAAI,KAAK,WAAW,EAAE;CACpC,IAAI,IAAI,IAAI,CAAC,oBAAoB;CACjC,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,SAAS;CACT,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC5B,KAAK;CACL,IAAI,MAAM;CACV,IAAI,MAAM,IAAI,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAAC;CAC7C,IAAI;CACJ,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,gBAAgB,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,MAAM,KAAK;CAChH;CACA,GAAG,IAAI,IAAI,CAAC;CACZ,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,IAAI,GAAG,EAAE,CAAC;CACd,IAAI,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC5B,KAAK,IAAI,CAAC,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC;CACnF,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;CAC5C,MAAM,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACrB,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CAC/B,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,MAAM,GAAG,IAAI,EAAE;CACtB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;CACvC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC3C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI;CACJ,GAAG,IAAI,GAAG,CAAC;CACX,GAAG,IAAI,IAAI,CAAC,oBAAoB,EAAE;CAClC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,KAAK,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;CAC3B,KAAK,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;CAClC,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;AACL;CACA,IAAI,MAAM;CACV,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACrC,KAAK,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACzB,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,IAAI,YAAY,GAAG,QAAQ,GAAG,KAAK,CAAC;CACvC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;CACf,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK,IAAI,EAAE,CAAC;CACZ,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,IAAI,GAAG,MAAM,EAAE;CACtB,IAAI,MAAM,IAAI,KAAK,CAAC,6DAA6D;CACjF,IAAI,4DAA4D,CAAC,CAAC;CAClE,IAAI;CACJ,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC;CAC9C,GAAG,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;CAC9C,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,KAAK,KAAK,GAAG,gBAAgB;CAClE,EAAE,CAAC,OAAO,CAAC,kBAAkB,IAAI,CAAC,iBAAiB;CACnD,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,YAAY,GAAG,QAAQ,EAAE,GAAG,KAAK,CAAC;CACzC,GAAG,IAAI,SAAS,CAAC;CACjB,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE;CAC3B,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACtC,KAAK,IAAI,cAAc;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC;CAClC,UAAU;CACV;CACA,MAAM,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACrC,MAAM,IAAI,cAAc,GAAG,UAAU,CAAC;CACtC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC;CAC1C,MAAM,IAAI,cAAc,GAAG,CAAC,CAAC;CAC7B,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACnD,OAAO,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACzB,OAAO,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACxC,OAAO,IAAI,CAAC,cAAc,EAAE;CAC5B,QAAQ,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC/D,QAAQ,cAAc,EAAE,CAAC;CACzB,QAAQ;CACR,OAAO,UAAU,GAAG,cAAc,CAAC;CACnC,OAAO;CACP,MAAM,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,IAAI,QAAQ,EAAE;CAChD;CACA,OAAO,QAAQ,EAAE,CAAC;CAClB,OAAO,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CACnD,OAAO;CACP,OAAO,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;CACvE,MAAM,SAAS,GAAG,IAAI,CAAC;CACvB,MAAM,UAAU,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;CACvC,MAAM;CACN,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,CAAC,SAAS,EAAE;CACnB,IAAI,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC7C,IAAI,IAAI,QAAQ;CAChB,KAAK,MAAM,CAAC,YAAY,GAAG,KAAK,CAAC,GAAG,QAAQ,CAAC;CAC7C;CACA,KAAK,eAAe,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;CACvE,IAAI;CACJ,GAAG;CACH,EAAE,CAAC,MAAM,KAAK;CACd,GAAG,IAAI,cAAc,EAAE,UAAU,GAAG,UAAU,CAAC,WAAW,KAAK,UAAU,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;CAC7G,GAAG,IAAI,cAAc,GAAG,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM,EAAE,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CAC1G,IAAI,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;CACrC,IAAI,IAAI,CAAC,cAAc,EAAE;CACzB,KAAK,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CAC5D,KAAK,cAAc,EAAE,CAAC;CACtB,KAAK;CACL,IAAI,UAAU,GAAG,cAAc,CAAC;CAChC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,aAAa,CAAC,CAAC;CAC5C,GAAG,IAAI,QAAQ,EAAE;CACjB,IAAI,IAAI,QAAQ,IAAI,IAAI,IAAI,iBAAiB,EAAE;CAC/C,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;CAC7D,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC;CACxC,KAAK;CACL,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,IAAI,MAAM;CACV,IAAI,SAAS,CAAC,UAAU,EAAE,UAAU,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,cAAc,CAAC,CAAC;CACtF,IAAI;CACJ;CACA,GAAG,KAAK,IAAI,GAAG,IAAI,MAAM;CACzB,IAAI,IAAI,OAAO,MAAM,CAAC,cAAc,KAAK,UAAU,IAAI,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;CACnF,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACvB,KAAK;CACL,GAAG,CAAC;AACJ;CACA;CACA,EAAE,MAAM,eAAe,GAAG,OAAO,IAAI,CAAC,UAAU,IAAI,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC;AAClF;CACA,EAAE,MAAM,WAAW,GAAG,eAAe,GAAG,CAAC,MAAM,KAAK;CACpD,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;CAC5E,GAAG,GAAG,WAAW,CAAC;AAClB;CACA,EAAE,MAAM,WAAW,GAAG,CAAC,MAAM,KAAK;CAClC,GAAG,IAAI,WAAW,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,WAAW,EAAE,kBAAkB,KAAK;CAC3I,IAAI,IAAI,kBAAkB;CAC1B,KAAK,OAAO,eAAe,GAAG,IAAI,CAAC;CACnC,IAAI,QAAQ,GAAG,WAAW,CAAC;CAC3B,IAAI,IAAI,WAAW,GAAG,MAAM,CAAC;CAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;CAChB,IAAI,eAAe,EAAE,CAAC;CACtB,IAAI,IAAI,WAAW,KAAK,MAAM,EAAE;CAChC,KAAK,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;CAC7C,KAAK;CACL,IAAI,OAAO,QAAQ,CAAC;CACpB,IAAI,CAAC,CAAC;CACN,GAAG,IAAI,WAAW,KAAK,CAAC;CACxB,IAAI,OAAO,WAAW,CAAC,MAAM,CAAC,CAAC;CAC/B,GAAG,QAAQ,GAAG,WAAW,CAAC;CAC1B,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK;CAC5B,GAAG,IAAI,OAAO,CAAC;CACf,GAAG,IAAI,GAAG,GAAG,SAAS,EAAE;CACxB;CACA,IAAI,IAAI,CAAC,GAAG,GAAG,KAAK,IAAI,eAAe;CACvC,KAAK,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;CAC/E,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,eAAe;CACtC,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,GAAG,GAAG,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;CACrG,IAAI;CACJ,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,KAAK,KAAK,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;CAClF,GAAG,IAAI,SAAS,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;CAClD,GAAG,UAAU,GAAG,SAAS,CAAC,QAAQ,KAAK,SAAS,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;CACxG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;CACtC,GAAG,IAAI,MAAM,CAAC,IAAI;CAClB,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;CAC1C;CACA,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;CAC5C,GAAG,QAAQ,IAAI,KAAK,CAAC;CACrB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;CACnC,GAAG,OAAO,MAAM,GAAG,SAAS,CAAC;CAC7B,GAAG,CAAC;CACJ,EAAE,MAAM,SAAS,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,KAAK;CAC1D,GAAG,IAAI,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC;CACpC,GAAG,IAAI,CAAC,QAAQ;CAChB,IAAI,QAAQ,GAAG,IAAI,CAAC;CACpB,GAAG,IAAI,QAAQ,GAAG,aAAa,IAAI,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE;CAClG,IAAI,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC;CACpC,IAAI,IAAI,EAAE,QAAQ,GAAG,cAAc,CAAC;CACpC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,SAAS,GAAG,QAAQ,GAAG,CAAC,CAAC;CACxC,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,cAAc;CAClC,KAAK,QAAQ,GAAG,aAAa,CAAC;CAC9B,IAAI,UAAU,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC;CACrC,IAAI;CACJ,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,IAAI,iBAAiB,GAAG,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;CACtG,GAAG,UAAU,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;CACxC,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,GAAG,UAAU,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACtC;CACA,GAAG,IAAI,QAAQ,GAAG,aAAa,EAAE;CACjC,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;CACzB,IAAI,UAAU,CAAC,YAAY,GAAG,QAAQ,GAAG,IAAI,CAAC;CAC9C,IAAI,eAAe,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;CACL,IAAI,MAAM;CACV,IAAI,IAAI,QAAQ,IAAI,CAAC,EAAE;CACvB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,IAAI,IAAI,CAAC;CACnD,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK,MAAM;CACX,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC/B,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC;CACnC,KAAK;AACL;CACA,IAAI,IAAI,cAAc;CACtB,KAAK,gBAAgB,IAAI,oCAAoC,GAAG,cAAc,CAAC;CAC/E;CACA,IAAI,IAAI,iBAAiB,CAAC,MAAM,IAAI,gBAAgB;CACpD,KAAK,iBAAiB,CAAC,KAAK,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;CAClD,IAAI,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;CACvC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;CACf,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,MAAM,eAAe,GAAG,CAAC,UAAU,EAAE,IAAI,EAAE,eAAe,EAAE,cAAc,KAAK;CACjF,GAAG,IAAI,UAAU,GAAG,MAAM,CAAC;CAC3B,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,IAAI,WAAW,GAAG,OAAO,CAAC;CAC7B,GAAG,IAAI,SAAS,GAAG,KAAK,CAAC;CACzB,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,KAAK,GAAG,CAAC,CAAC;CACb,GAAG,IAAI,CAAC,MAAM;CACd,IAAI,UAAU,GAAG,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;CACtD,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;CAChC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;CAC/C,GAAG,UAAU,GAAG,MAAM,CAAC;CACvB,GAAG,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC/B,GAAG,MAAM,GAAG,UAAU,CAAC;CACvB,GAAG,QAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,OAAO,GAAG,WAAW,CAAC;CACzB,GAAG,KAAK,GAAG,SAAS,CAAC;CACrB,GAAG,IAAI,YAAY,GAAG,CAAC,EAAE;CACzB,IAAI,IAAI,MAAM,GAAG,QAAQ,GAAG,YAAY,GAAG,CAAC,CAAC;CAC7C,IAAI,IAAI,MAAM,GAAG,OAAO;CACxB,KAAK,QAAQ,CAAC,MAAM,CAAC,CAAC;CACtB,IAAI,IAAI,iBAAiB,GAAG,eAAe,GAAG,KAAK,CAAC;CACpD,IAAI,MAAM,CAAC,UAAU,CAAC,iBAAiB,GAAG,YAAY,EAAE,iBAAiB,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;CACzF,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,iBAAiB,CAAC,CAAC;CACrE,IAAI,QAAQ,GAAG,MAAM,CAAC;CACtB,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,eAAe,GAAG,KAAK,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACpD,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE;CACF,CAAC,SAAS,CAAC,MAAM,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,MAAM,CAAC;CAClB,EAAE,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CAC3G,EAAE,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC;CAC/B,EAAE,QAAQ,GAAG,CAAC,CAAC;CACf,EAAE;CACF,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,EAAE;CACtB,EAAE,QAAQ,GAAG,KAAK,CAAC;CACnB,EAAE;CACF,CAAC,IAAI,QAAQ,GAAG;CAChB,EAAE,OAAO,QAAQ,CAAC;CAClB,EAAE;CACF,CAAC,eAAe,GAAG;CACnB,EAAE,IAAI,IAAI,CAAC,UAAU;CACrB,GAAG,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;CACxB,EAAE,IAAI,IAAI,CAAC,YAAY;CACvB,GAAG,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;CAC1B,EAAE;CACF,EAAC;AACD;CACA,gBAAgB,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,WAAW,iBAAiB,QAAQ,EAAE,MAAM,EAAE,CAAC;CACvJ,UAAU,GAAG,CAAC;CACd,CAAC,IAAI,CAAC,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACpC,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,CAAC;CACtC,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,KAAK,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACtG;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;CAC3C,GAAG,MAAM,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,WAAW,EAAE;CACnD;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC;CAC5G,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;CAC/C,GAAG,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE;CAC7B,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE;CAC3B,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACxB,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;CACtC,IAAI;CACJ;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAC7D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT;CACA,GAAG,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CAC9D,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC;CAC3B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,eAAe,EAAE,GAAG,OAAO,CAAC,CAAC;CACpE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CACrE,GAAG;CACH,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACnC,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE;CAC7B,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC;CACnB,GAAG;CACH,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;CACd,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACnD,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,IAAI,EAAE;CACrC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;CACrE,EAAE,IAAI,IAAI,CAAC,SAAS,EAAE;CACtB,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;CAC1B,GAAG;CACH,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;CACtC,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,UAAU,EAAE,gBAAgB,EAAE;CACpC,EAAE,IAAI,WAAW,GAAG,UAAU,CAAC,WAAW,CAAC;CAC3C,EAAE,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS;CACjD,GAAG,cAAc,CAAC,UAAU,EAAE,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACvF;CACA,GAAG,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;CAC7C,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,WAAW,EAAE,gBAAgB,EAAE;CACrC,EAAE,IAAI,IAAI,CAAC,SAAS;CACpB,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;CACvD;CACA,GAAG,WAAW,CAAC,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACzG,EAAE;CACF,CAAC,EAAE;CACH,CAAC,IAAI,CAAC,EAAE,EAAE,gBAAgB,EAAE;CAC5B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;CAC1B,EAAE;CACF,CAAC,CAAC,CAAC;AACH;CACA,SAAS,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE;CACpE,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC;CACpC,CAAC,IAAI,MAAM,GAAG,CAAC,GAAG,KAAK,EAAE;CACzB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;CAClC,EAAE,MAAM,IAAI,MAAM,GAAG,CAAC,GAAG,OAAO,EAAE;CAClC,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC;CACzC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC;CAC3C,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;CAC7C,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;CACjE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;CACvG,CAAC;CACD,SAAS,WAAW,CAAC,MAAM,EAAE,gBAAgB,EAAE;CAC/C,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC;CAChC,CAAC,IAAI,MAAM,EAAE,QAAQ,CAAC;CACtB,CAAC,IAAI,MAAM,GAAG,KAAK,EAAE;CACrB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAC9B,EAAE,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAC9B,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CAC1D,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACnC,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACrC,EAAE,MAAM;CACR,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;CACtE,EAAE,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC5B,EAAE,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CACzC,EAAE,QAAQ,IAAI,CAAC,CAAC;CAChB,EAAE;CACF,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC;AACD;CACA,SAAS,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE;CAC5D,CAAC,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,CAAC,QAAQ,MAAM;CACf,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,CAAC;CACR,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE,KAAK,EAAE;CACT,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7B,GAAG,MAAM;CACT,EAAE;CACF,GAAG,IAAI,MAAM,GAAG,KAAK,EAAE;CACvB,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;CAChC,IAAI,MAAM,IAAI,MAAM,GAAG,OAAO,EAAE;CAChC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;CACrC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI,MAAM;CACV,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC9B,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,IAAI,EAAE,CAAC;CACtC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC;CAC/C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC;CAC9C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,MAAM,GAAG,IAAI,CAAC;CACvC,IAAI;CACJ,EAAE;CACF,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAC3B,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CAC9B,CAAC,QAAQ,IAAI,MAAM,CAAC;CACpB,CAAC,OAAO,QAAQ,CAAC;CACjB,CAAC;AACD;CACA,SAAS,SAAS,CAAC,UAAU,EAAE,WAAW,EAAE;CAC5C;CACA,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;CAC7C,CAAC,IAAI,OAAO,GAAG,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC;CAClD,CAAC,OAAO,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,EAAE;CACpC,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;CAC7B,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC;CACrB,EAAE,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAClE,EAAE,cAAc,IAAI,CAAC,CAAC;CACtB,EAAE,IAAI,QAAQ,GAAG,MAAM,GAAG,cAAc,CAAC;CACzC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CAChC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;CACpC,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC;CAC7C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC;CAC5C,EAAE,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;CACrC,EAAE,OAAO,GAAG,MAAM,CAAC;CACnB,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,SAAS,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,iBAAiB,EAAE;CACtD,CAAC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;CAChC,EAAE,UAAU,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,GAAG,KAAK,EAAE,QAAQ,GAAG,iBAAiB,GAAG,cAAc,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;CACxH,EAAE,cAAc,CAAC,eAAe,GAAG,QAAQ,GAAG,KAAK,CAAC;CACpD,EAAE,IAAI,YAAY,GAAG,cAAc,CAAC;CACpC,EAAE,cAAc,GAAG,IAAI,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;CACxB,EAAE;CACF,CAAC;AACD;CACO,SAASC,cAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,KAAK,EAAE;CACtB,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK;CACzC,GAAG,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;CAC9D,EAAE,IAAI,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI;CACvC,GAAG,MAAM,IAAI,KAAK,CAAC,gEAAgE,CAAC,CAAC;CACrF,EAAE,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5C,EAAE,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;CAChC,EAAE;CACF,CAACI,cAAkB,CAAC,SAAS,CAAC,CAAC;CAC/B,CAAC;CACD,SAAS,iBAAiB,CAAC,UAAU,EAAE,KAAK,EAAE;CAC9C,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,kBAAkB,KAAK;CACnD,EAAE,IAAI,UAAU,GAAG,CAAC,kBAAkB,KAAK,CAAC,KAAK,CAAC,yBAAyB,IAAI,CAAC,MAAM,kBAAkB,CAAC,MAAM,CAAC,CAAC;CACjH,EAAE,IAAI,CAAC,UAAU;CACjB,GAAG,KAAK,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,CAAC;CAC9C,EAAE,OAAO,UAAU,CAAC;CACpB,EAAE,CAAC;CACH,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA;CACA;CACA;AACAC,QAAK,CAAC,qBAAqB,GAAG,IAAI,CAAC;AACnC;CACA,IAAI,YAAY,GAAG,IAAIA,OAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;CAC7C,MAAMC,MAAI,GAAG,YAAY,CAAC,IAAI,CAAC;CAChB,YAAY,CAAC,KAAK;CAKjC,MAAM,iBAAiB,GAAG,GAAG,CAAC;CAC9B,MAAM,iBAAiB,GAAG,IAAI,CAAC;CAC/B,MAAM,mBAAmB,GAAG,IAAI;;CC5mCvC,MAAM,0BAA0B,GAAG,OAAO,CAAC,GAAG,CAAC,qCAAqC,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC;AACjL;CACA,IAAI,CAAC,0BAA0B,EAAE;CACjC,CAAC,IAAI,SAAS,CAAC;CACf,CAAC,IAAI;CACL,EAAE,IAAI,OAAO,OAAO,IAAI,UAAU;CAClC,GAAG,SAAS,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;CAC3C;CACA,GAAG,SAAS,GAAGC,oBAAa,CAAC,mGAAe,CAAC,CAAC,kBAAkB,CAAC,CAAC;CAClE,EAAE,IAAI,SAAS;CACf,GAAG,YAAY,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;CAC1C,EAAE,CAAC,OAAO,KAAK,EAAE;CACjB;CACA,EAAE;CACF;;CCnBA,IAAI,aAAa,GAAG,EAAE,CAAC;CACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC5B,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAACC,eAAY,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,mGAAe,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3G,CAAC;CACD,aAAa,CAAC,IAAI,CAAC;CACnB,CAAC,IAAI,EAAE,kBAAkB;CACzB,CAAC,IAAI,EAAE,IAAI,IAAI,EAAE;CACjB,CAAC,KAAK,EAAE,EAAE;CACV,CAAC,CAAC,CAAC;CACH,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;CACpC,SAAS,UAAU,CAAC,MAAM,EAAE;CAC5B,CAAC,IAAI;CACL,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC;CACzB,EAAE,CAAC,MAAM,KAAK,EAAE;CAChB,EAAE,OAAO,EAAE,CAAC;CACZ,EAAE;CACF,CAAC;CAQD;CACA,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;CACzB;CACA,IAAI,KAAK,GAAGC,OAAc,CAAC;CAC3B,IAAI,OAAO,GAAGC,SAAgB,CAAC;CAC/B,IAAI,MAAM,GAAGC,QAAe,CAAC;CAC7B,IAAI,cAAc,GAAGC,gBAAuB,CAAC;CAC7C,IAAI,YAAY,GAAGC,cAAqB,CAAC;CACzC,IAAI,IAAI,GAAGC,MAAa,CAAC;CACzB,IAAI,WAAW,GAAGC,eAAwB,CAAC,WAAW,CAAC;AACvD;CACA,IAAI,YAAY,GAAGC,cAAqB,CAAC;CACzC,IAAI,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;CACZ,IAAI,CAAC,YAAY;CACjB,IAAI,CAAC,YAAY;CACjB,IAAI,CAAC,mBAAmB;CACxB,IAAI,CAAC,qBAAqB;CAC5B,IAAI,CAAC,UAAU;AAI/B;CACA,IAAI,UAAU,GAAG,IAAI,CAAC;AACtB;CACA,MAAM,WAAW,SAAS,KAAK,CAAC;CAChC,CAAC;AACD;CACA,MAAM,YAAY,SAAS,KAAK,CAAC;CACjC,CAAC;AACD;CACA,MAAM,YAAY,SAAS,KAAK,CAAC;CACjC,CAAC;AACD;AACA;CACA,MAAM,YAAY,CAAC;CACnB,CAAC;AACD;AACA;CACA,KAAK,CAAC,sBAAsB,EAAE,WAAW;CACzC,CAAC,IAAI,CAAC,kBAAkB,EAAE,YAAY;CACtC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,IAAI,EAAE;CACT,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;CACjD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC;CACrC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;CACnD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC;CACtC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC;CAClD,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;CAClD,IAAI;CACJ,GAAG,WAAW,EAAE,YAAY;CAC5B,GAAG,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;CACzB,GAAG,gBAAgB,EAAE;CACrB,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;CAClB,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;CAClB,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC;CAClB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACb,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACb,IAAI,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,CAAC;CACvB,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;CACtC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CAChC,EAAE,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CAChC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,kBAAkB,EAAE,YAAY;CACtC,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjC,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjC,EAAE,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjC,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;CACtC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;CACxC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;CACxC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;CACxC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,aAAa,EAAE,YAAY;CACjC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK;CACR,GAAG,KAAK;CACR,GAAG,KAAK;CACR,GAAG,EAAE;CACL,GAAG,EAAE;CACL,GAAG,IAAI;CACP,GAAG,IAAI;CACP,GAAG,OAAO;CACV,GAAG,OAAO;CACV,GAAG,KAAK,EAAE;CACV,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,IAAI;CACrC,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;CACtC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY;CAC/B,EAAE,MAAM,IAAI,GAAG,iQAAiQ,CAAC;CACjR,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACnC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,uBAAuB,EAAE,YAAY;CAC3C,EAAE,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;CAChC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;CACtB,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;CAC5B,GAAG,CAAC,CAAC;AACL;CACA,EAAE,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;CACjC,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC/B,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,iBAAiB,EAAE,YAAY;CACrC,EAAE,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;CAChC,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,EAAE,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;CAC9C,EAAE,IAAI,EAAE,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;CAC9B,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;CACrB,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;CAChC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,KAAK,IAAI,UAAU,IAAI,aAAa,EAAE;CACvC,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC;CAChE,EAAE,IAAI,CAAC,0BAA0B,GAAG,OAAO,EAAE,YAAY;CACzD,GAAG,IAAI,IAAI,GAAG,UAAU,CAAC;CAEzB,GAAG,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACzC,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACzC,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,CAAC,kDAAkD,GAAG,OAAO,EAAE,YAAY;CACjF,GAAG,IAAI,IAAI,GAAG,UAAU,CAAC;CAEzB,GAAG,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,UAAU,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC;CAC3C,GAAG,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACzC,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC/B,GAAG,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACzC,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,CAAC,+CAA+C,GAAG,OAAO,EAAE,YAAY;CAC9E,GAAG,IAAI,IAAI,GAAG,UAAU,CAAC;CACzB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,kBAAkB,UAAU,EAAE,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;CACpF,GAAG,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrC,GAAG,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC/C,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG,CAAC,CAAC;CACL,EAAE;AACF;CACA,CAAC,IAAI,CAAC,kDAAkD,EAAE,YAAY;CACtE,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzC,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,YAAY,GAAG;CACrB,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC;CACtB,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC;CACrB,GAAG,CAAC,aAAa,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;CACjD,GAAG,CAAC,aAAa,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;CACxE,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,IAAI,CAAC,IAAI,YAAY,EAAE;CAC7B,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;CAC5B,GAAG,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrC,GAAG,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC/C,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACxC,GAAG;CACH,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,8BAA8B,EAAE,YAAY;CAClD,EAAE,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,oBAAoB,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,GAAG,CAAC,CAAC;AACxJ;CACA,EAAE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;CAClB,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;CAClB,EAAE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CACf,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CACf,EAAE,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC7B;CACA,EAAE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACtC,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAC3C,EAAE,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;CACrC,EAAE,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;CACrC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,oCAAoC,EAAE,YAAY;CACxD,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;CAClD,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,eAAe,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC;CAChG,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,6CAA6C,EAAE,YAAY;CACjE,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;CAChB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC;CAC/C,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,gDAAgD,EAAE,WAAW;CACnE,EAAE,MAAM,eAAe,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;AAChD;CACA,EAAE,MAAM,IAAI,GAAG;CACf,GAAG,OAAO,EAAE,oBAAoB;CAChC,GAAG,CAAC;AACJ;CACA,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;CAChB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;CACjB,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;CAClB,EAAE,SAAS,QAAQ,CAAC,IAAI,EAAE;CAC1B,GAAG,MAAM,IAAI,GAAG,EAAE,CAAC;CACnB,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;CAClC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;CACzB,IAAI;AACJ;CACA,GAAG,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;CAC7C,GAAG,MAAM,QAAQ,GAAG,IAAI,OAAO,CAAC,eAAe,CAAC,CAAC;CACjD,GAAG,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrC,GAAG,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;CAC5C,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CACnC,GAAG;CACH,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,6BAA6B,EAAE,YAAY;CACjD,EAAE,IAAI,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;CAC9B,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;CAC5C,EAAE,IAAI,OAAO,GAAG,IAAI,OAAO,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;CAChD,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,iDAAiD,EAAE,YAAY;CACrE,EAAE,MAAM,OAAO,GAAG;CAClB,GAAG,aAAa,EAAE,IAAI;CACtB,GAAG,UAAU,EAAE,IAAI;CACnB,GAAG,CAAC;AACJ;CACA,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;CACpC,EAAE,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;AACtC;CACA,EAAE,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAC1B;CACA,EAAE,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC;CACxC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;CACpB,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;CACpB,GAAG,CAAC,CAAC,CAAC;CACN,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,OAAO,MAAM,IAAI,WAAW;CACjC,CAAC,IAAI,CAAC,cAAc,EAAE,UAAU;CAChC,EAAE,IAAI,KAAK,GAAG;CACd,GAAG,IAAI,EAAE;CACT,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,eAAe,EAAE;CACvE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,aAAa,EAAE;CACzD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,cAAc,EAAE;CACxE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,WAAW,CAAC;CACvD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,gBAAgB,EAAE;CACzE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE;CACpD,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG;CACd,GAAG,IAAI,EAAE;CACT,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACrD,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,CAAC;CACxC,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACvD,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC;CAC1C,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACvD,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE;CACvD,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;CAChC,EAAE,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;CAChC,EAAE,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;CAC7B,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACtB,EAAE,IAAI,aAAa,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACpD,EAAE,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACtB,EAAE,IAAI,aAAa,GAAG,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CACpD,EAAE,MAAM,CAAC,SAAS,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;CACzC,EAAE,MAAM,CAAC,SAAS,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;CACzC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW;CAChC,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CACpC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,QAAQ,EAAE,WAAW;CAC3B,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;CACtD,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,6BAA6B;CACnC,GAAG,CAAC,EAAE,yCAAyC;CAC/C,GAAG,CAAC,EAAE,CAAC,6BAA6B;CACpC,GAAG,CAAC,EAAE,CAAC,8CAA8C;CACrD,GAAG,CAAC,EAAE,6BAA6B;CACnC,GAAG,CAAC,EAAE,CAAC,6BAA6B;CACpC,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI;CAC7C,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,GAAG,IAAI;CAC9C,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI;CAC/C,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,IAAI;CAChD,GAAG,CAAC,EAAE,OAAO,IAAI,OAAO;CACxB,GAAG,CAAC,EAAE,CAAC,OAAO,IAAI,OAAO;CACzB,GAAG,CAAC,EAAE,GAAG,IAAI,QAAQ,GAAG,IAAI;CAC5B,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,QAAQ,GAAG,IAAI;CAC7B,GAAG,CAAC,EAAE,qBAAqB;CAC3B,GAAG,CAAC,EAAE,CAAC,qBAAqB;CAC5B,GAAG,GAAG,EAAE,EAAE;CACV,GAAG,MAAM,EAAE,EAAE;CACb,GAAG,CAAC;AACJ;CACA,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE;CAC3G,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACxB,GAAG;AACH;CACA,EAAE,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;CAC/D,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CAC3B,GAAG;AACH;CACA,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;AACA;CACA,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU;CAC9C,EAAE,SAAS,QAAQ,GAAG;AACtB;CACA,GAAG;CACH,EAAE,QAAQ,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;CAC5C,GAAG,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;CAChC,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;CACrB,EAAE,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CACrC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,QAAQ;CAClB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,MAAM,EAAE,SAAS,MAAM,EAAE;CAC5B,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;CAC3B,IAAI,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CACpC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACtB,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,IAAI,OAAO,CAAC,CAAC;CACb,IAAI;CACJ,GAAG,IAAI,EAAE,SAAS,QAAQ,EAAE;CAC5B,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;CACzD,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;CAC7D,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,iCAAiC,EAAE,UAAU;CACnD,EAAE,IAAI,QAAQ,GAAG,IAAI,WAAW,EAAE,CAAC;CACnC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,WAAW;CACrB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,IAAI,EAAE,SAAS,IAAI,EAAE;CACxB,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;CACvD,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,KAAK,EAAE,SAAS,QAAQ,EAAE;CAC7B,IAAI,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;CACzB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;CAClG,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,8CAA8C,EAAE,UAAU;CAChE,EAAE,IAAI,QAAQ,GAAG,IAAI,YAAY,EAAE,CAAC;CACpC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;CAC5F,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;AACA;CACA,CAAC,IAAI,CAAC,+CAA+C,EAAE,UAAU;CACjE,EAAE,IAAI,QAAQ,GAAG,IAAI,YAAY,EAAE,CAAC;CACpC,EAAE,QAAQ,CAAC,KAAK,GAAG,QAAQ,CAAC;CAC5B,EAAE,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC;CAC3B,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;CAC7F,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,wCAAwC,EAAE,UAAU;CAC1D,EAAE,SAAS,SAAS,GAAG;AACvB;CACA,GAAG;CACH,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,SAAS;CACnB,GAAG,IAAI,EAAE,IAAI;CACb,GAAG,IAAI,GAAG;CACV,IAAI,OAAO,OAAO,MAAM,IAAI,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;CAClF,IAAI;CACJ,GAAG,MAAM,CAAC,IAAI,EAAE;CAChB,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC;CACvB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC;CAC7C,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC5B,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU;CAC7C,EAAE,SAAS,QAAQ,GAAG;AACtB;CACA,GAAG;CACH,EAAE,QAAQ,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;CAC5C,GAAG,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;CAChC,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;CACrB,EAAE,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CACrC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,QAAQ;CAClB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,IAAI,EAAE,SAAS,IAAI,EAAE;CACxB,IAAI,IAAI,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC;CAC3B,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACtB,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,IAAI,OAAO,CAAC,CAAC;CACb,IAAI;CACJ,GAAG,KAAK,EAAE,SAAS,QAAQ,EAAE;CAC7B,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;CAC7C,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;CAC7D,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,4BAA4B,EAAE,UAAU;CAC9C,EAAE,SAAS,QAAQ,GAAG;AACtB;CACA,GAAG;CACH,EAAE,QAAQ,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;CAC5C,GAAG,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAC;CAChC,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;CACrB,EAAE,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CACrC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,QAAQ;CAClB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,IAAI,EAAE,SAAS,IAAI,EAAE;CACxB,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;CACpD,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,KAAK,EAAE,SAAS,IAAI,EAAE;CACzB,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;CAC/F,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,gBAAgB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;CAC7D,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,kCAAkC,EAAE,UAAU;CACpD,EAAE,IAAI,QAAQ,GAAG,IAAI,YAAY,EAAE,CAAC;CACpC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACnB,EAAE,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;CACrC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,mBAAmB;CAC7B,GAAG,gBAAgB,EAAE,QAAQ;CAC7B,GAAG,KAAK,EAAE,aAAa;CACvB,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,YAAY;CACtB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,IAAI,EAAE,SAAS,IAAI,EAAE;CACxB,IAAI,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;CACxD,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,KAAK,EAAE,SAAS,IAAI,EAAE;CACzB,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;CACnG,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACpD,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,oCAAoC,EAAE,UAAU;CACtD,EAAE,SAAS,QAAQ,GAAG;AACtB;CACA,GAAG;CACH,EAAE,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,UAAU;CAC1C,GAAG,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;CACzB,GAAG,CAAC;CACJ,EAAE,QAAQ,CAAC,SAAS,CAAC,SAAS,GAAG,WAAW;CAC5C,GAAG,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;CACzB,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,QAAQ,GAAG,WAAW,EAAE,QAAQ,CAAC,QAAQ,EAAE,CAAC,sBAAsB,CAAC;CACzE,EAAE,MAAM,CAAC,cAAc,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;AACrD;CACA,EAAE,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;CACrB,EAAE,IAAI,IAAI,GAAG,QAAQ,CAAC;AACtB;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,QAAQ;CAClB,GAAG,IAAI,EAAE,EAAE;CACX,GAAG,MAAM,EAAE,SAAS,MAAM,EAAE;CAC5B,IAAI,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;CACzC,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;CAChD,IAAI,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CACnC,IAAI,OAAO,CAAC,CAAC;CACb,IAAI;CACJ,GAAG,IAAI,EAAE,SAAS,QAAQ,EAAE;CAC5B,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;CACtC,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;CAC5C,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,EAAE,UAAU;CAC/C,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE;CACpB,GAAG,CAAC;CACJ,EAAc,IAAI,KAAK,GAAG;CAC1B,EAAE,YAAY,CAAC;CACf,GAAG,KAAK,EAAE,IAAI;CACd,GAAG,KAAK,CAAC,IAAI,EAAE;CACf,IAAI,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC1D,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,kEAAkE,EAAE,YAAY;CACtF,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;CAChB,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;CACnB,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CAEtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,UAAU;CACb,GAAG,cAAc,CAAC,UAAU,EAAE;CAE9B,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY;CAC5B,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpB,GAAG,CAAC,CAAC;CACL,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,gBAAgB,EAAE,WAAW;CACnC,EAAE,IAAI,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;CAC9D,EAAE,IAAI,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACvB,EAAE,IAAI,gBAAgB,GAAG,CAAC,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;CAChI,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;CAC1B,EAAE,IAAI,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;CAC3D,EAAE,KAAK,IAAI,MAAM,IAAI,OAAO,EAAE;CAC9B,GAAG,MAAM,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;CACxB,GAAG;CACH,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW;CACtC,GAAG,IAAI,EAAE,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAC;CAC3C,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;CAE3B,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CACjC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACb,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACb,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACb,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;CACzB,IAAI,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;CACnD,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;CAE3C,KAAK;CACL,IAAI;CACJ,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,8BAA8B,EAAE,WAAW;CACjD,EAAE,MAAM,MAAM,GAAG;CACjB,GAAG,KAAK,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;CAC3B,GAAG,cAAc,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;CACtE,GAAG,IAAI,EAAE,IAAI,SAAS,EAAE;CACxB,GAAG,KAAK,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;CACnD,GAAG,CAAC;CACJ,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;CAC1B,GAAG,SAAS,EAAE,IAAI;CAClB,GAAG,CAAC,CAAC;AACL;CACA,EAAE,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACxC,EAAE,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;CACjE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;CAC7D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,OAAO,EAAE,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;CACnF,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;CAC/F,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;CAC3F,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;CAC/D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;CACjE,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;CACjE,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,YAAY,CAAC,IAAI,YAAY,SAAS,CAAC,CAAC;CACjD,EAAE,MAAM,CAAC,YAAY,CAAC,KAAK,YAAY,UAAU,CAAC,CAAC;CACnD,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,oCAAoC,EAAE,WAAW;CACvD,EAAE,IAAI,MAAM,GAAG;CACf,GAAG,IAAI,EAAE,QAAQ;CACjB,GAAG,QAAQ,EAAE;CACb,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE;CACrB,IAAI;CACJ,GAAG,KAAK,EAAE,IAAI,WAAW,CAAC,EAAE,CAAC;CAC7B,GAAG,CAAC;CACJ,EAAE,IAAI,EAAE,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CACxC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACZ,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACZ,EAAE,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC;CACvB,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;CAC9B,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC;CACzC,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,SAAS,EAAE,IAAI;CAClB,GAAG,eAAe,EAAE,IAAI;CACxB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CACvD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;CACvD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;CACnE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,YAAY,CAAC,aAAa,CAAC,CAAC;CAClE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;CACnE,EAAE,EAAE,GAAG,IAAI,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACzB,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACzB,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,oDAAoD,EAAE,WAAW;CACvE,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACvE;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,SAAS,EAAE,IAAI;CAClB,GAAG,eAAe,EAAE,IAAI;CACxB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACnC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;CACrD,EAAE,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;CAC/C,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,YAAY,CAAC,CAAC;AACpD;CACA,EAAE,IAAI,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;CAC9B,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;CAC/B,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,WAAW,EAAE,WAAW,CAAC,CAAC;CAClD,GAAG,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;CAC5D,GAAG,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CAC1C,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;CAC1C,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;CAC/C,GAAG;AACH;CACA,EAAE,IAAI,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;CAC9B,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;CAC/B,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC;CACrC,GAAG,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;CAC5D,GAAG,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;CAC1C,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;CAC1C,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC;CAC/C,GAAG;CACH,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,2BAA2B,EAAE,WAAW;CAC9C,EAAE,IAAI,CAAC,GAAG,OAAO,MAAM,IAAI,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC;CAC/E,EAAE,IAAI,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;CACf,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CACZ,EAAE,IAAI,MAAM,GAAG;CACf,GAAG,KAAK,EAAE,IAAI,KAAK,CAAC,MAAM,CAAC;CAC3B,GAAG,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;CAC3B,GAAG,MAAM,EAAE,QAAQ;CACnB,GAAG,YAAY,EAAE,EAAE;CACnB,GAAG,WAAW,EAAE,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,GAAG,WAAW,EAAE,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM;CACnD,GAAG,QAAQ,EAAE,IAAI,QAAQ,CAAC,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;CAC9D,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,SAAS,EAAE,IAAI;CAClB,GAAG,eAAe,EAAE,IAAI;CACxB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;CACzE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;CACjE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;CACvD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;CAC3E,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;CACnD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;CACzE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC/C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC/C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;CACzE,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;CAC3E,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;CACnE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;CAC1D,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,oBAAoB,EAAE,WAAW;CACvC,EAAE,MAAM,eAAe,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;CAChD,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;CAC5C,EAAE,MAAM,QAAQ,GAAG,IAAI,OAAO,CAAC,eAAe,CAAC,CAAC;AAChD;CACA,EAAE,MAAM,OAAO,GAAG;CAClB,GAAG,MAAM,EAAE;CACX,IAAI;CACJ,KAAK,GAAG,EAAE,0BAA0B;CACpC,KAAK;CACL,IAAI;CACJ,GAAG,CAAC;AACJ;CACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CAClC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1C,GAAG;CACH,EAAE,IAAI,YAAY,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;CAC3D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;CAClE,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,uCAAuC,EAAE,WAAW;CAC1D,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC;CAC3B,GAAG,eAAe,EAAE,IAAI;CACxB,GAAG,aAAa,EAAE,IAAI;CACtB,GAAG,CAAC,CAAC;AACL;CACA,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;AACf;CACA,EAAE,IAAI,MAAM,GAAG;CACf,GAAG,KAAK,EAAE,CAAC;CACX,GAAG,KAAK,EAAE,CAAC;CACX,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACxD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;AACvD;CACA,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,EAAE,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC;AACvB;CACA,EAAE,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;CACpD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;CAChD,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,0BAA0B,EAAE,UAAU;CAC5C,EAAE,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;CACjC,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;CAChB,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU;CACzC,EAAE,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;CAC5D,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;CACjD,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,oBAAoB,EAAE,WAAW;CACvC,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;CAC1B,GAAG,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;CAChD,GAAG,CAAC,CAAC;CACL,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC;CAC3B,GAAG,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;CAChD,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;CACjE;CACA,EAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;CACrC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,wBAAwB,EAAE,WAAW;CAC3C,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;CAChB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CAChC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7B,GAAG;CACH,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,eAAe,CAAC;CACtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,UAAU;CACb,GAAG,cAAc,CAAC,UAAU,EAAE;CAC9B,IAAI,eAAe,GAAG,UAAU,CAAC;CACjC,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,gBAAgB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;CAC3C,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;CACpD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CACvC,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC;CACpB,GAAG,UAAU;CACb,GAAG,mBAAmB,EAAE,GAAG;CAC3B,GAAG,cAAc,CAAC,UAAU,EAAE;CAC9B,IAAI,eAAe,GAAG,UAAU,CAAC;CACjC,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;CACvC,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC;CACpB,GAAG,UAAU;CACb,GAAG,mBAAmB,EAAE,GAAG;CAC3B,GAAG,cAAc,CAAC,UAAU,EAAE;CAC9B,IAAI,eAAe,GAAG,UAAU,CAAC;CACjC,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CAC5C,EAAE,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AACvC;CACA,EAAE,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAC5C;CACA,EAAE,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;CACnD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,wBAAwB,EAAE,WAAW;CAC3C,EAAE,MAAM,UAAU,GAAG,EAAE,CAAC;CACxB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;CAC/B,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;CAC9B,GAAG;CACH,EAAE,MAAM,WAAW,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;CACtC,EAAE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;CAC1B,GAAG,aAAa,GAAG;CACnB,IAAI,OAAO,UAAU,CAAC;CACtB,IAAI;CACJ,GAAG,cAAc,CAAC,UAAU,EAAE;CAC9B,IAAI;CACJ,GAAG,mBAAmB,EAAE,GAAG;CAC3B,GAAG,CAAC,CAAC;CACL,EAAE,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC;CAC3B,GAAG,aAAa,GAAG;CACnB,IAAI,OAAO,WAAW,CAAC;CACvB,IAAI;CACJ,GAAG,cAAc,CAAC,UAAU,EAAE;CAC9B,IAAI;CACJ,GAAG,mBAAmB,EAAE,GAAG;CAC3B,GAAG,CAAC,CAAC;CACL,EAAE,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;CAC9B,EAAE,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CACvC,EAAE,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAC3C,EAAE,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;CAC1C,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW;CAC/B,EAAE,IAAI,IAAI,GAAG,SAAS,CAAC;CACvB,EAAE,IAAI,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CAC1C,EAAE,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC1B,EAAE,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;CAChC,EAAE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;CACtC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,gBAAgB,EAAE,UAAU;CAClC,EAAE,IAAI,IAAI,GAAG,EAAE,CAAC;CAChB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;CACjC,GAAG,IAAI,GAAG,GAAG,MAAM,CAAC;CACpB,GAAG,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,IAAI,GAAG,CAAC,MAAM,GAAG,QAAQ,EAAE;CACxD,IAAI,GAAG,GAAG,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;CACrE,IAAI;CACJ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CAClB,GAAG;CACH,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU;CAC5B,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CACrB,EAAE,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AACtB;AACA;CACA,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,GAAG,EAAE,GAAG;CACX,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC;CAChC,GAAG,aAAa,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC;CACzC,GAAG,iBAAiB,EAAE,IAAI,IAAI,CAAC,0BAA0B,CAAC;CAC1D,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC,aAAa,CAAC;CACpC,GAAG,WAAW,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC;CACnC,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;CAC1B,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAChD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;CACjD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,aAAa,CAAC,CAAC;CAC3D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,EAAE,EAAE,aAAa,CAAC,CAAC;CACpE,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,0BAA0B,CAAC,CAAC;CACzF,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC;CAC/D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,cAAc,CAAC,CAAC;CACpE,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,uBAAuB,EAAE,UAAU;CACzC,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CACrB,EAAE,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;AACtB;AACA;CACA,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,GAAG,EAAE,GAAG;CACX,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,aAAa,CAAC;CAChC,GAAG,WAAW,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC;CACnC,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,aAAa,EAAE,IAAI;CACtB,GAAG,cAAc,EAAE,IAAI;CACvB,GAAG,aAAa,EAAE,MAAM,qBAAqB;CAC7C,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAC5C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,aAAa,CAAC,CAAC;CAC3D,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,WAAW,EAAE,qBAAqB,CAAC,CAAC;CAChE,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW;CAChC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,GAAG,EAAE,MAAM;CACd,GAAG,IAAI,EAAE,CAAC;CACV,GAAG,KAAK,EAAE,CAAC;CACX,GAAG,GAAG,EAAE,CAAC;CACT,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC;CACA,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW;CAC5B,EAAE,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;CAClB,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC;CACA,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,IAAI,GAAG,gBAAgB,CAAC;CAC1B,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,IAAI,GAAG,iEAAiE,CAAC;CAC3E,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,iBAAiB,EAAE,WAAW;CACpC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,KAAK;CACX,GAAG,CAAC,EAAE,SAAS;CACf,GAAG,CAAC,EAAE,mBAAmB;CACzB,GAAG,CAAC,EAAE,OAAO;CACb,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,UAAU,EAAE,WAAW;CAC1B,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;CACtC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,2CAA2C,EAAE,WAAW;CAC9D,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,mBAAmB;CACzB,GAAG,CAAC;AACJ;CACA,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;CAC1B,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,mBAAmB,CAAC,CAAC;CACxD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,iBAAiB,EAAE,WAAW;CACpC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,mBAAmB;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,WAAW,EAAE,QAAQ;CACxB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;CACvD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,6BAA6B,EAAE,WAAW;CAChD;CACA,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,mBAAmB;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,aAAa,EAAE,IAAI;CACtB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC;CACvD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,kCAAkC,EAAE,WAAW;CACrD,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,CAAC,iBAAiB;CACxB,GAAG,CAAC,EAAE,CAAC,iBAAiB;CACxB,GAAG,CAAC,EAAE,EAAE;CACR,GAAG,CAAC,EAAE,iBAAiB;CACvB,GAAG,CAAC,EAAE,iBAAiB;CACvB,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,WAAW,EAAE,MAAM;CACtB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,iBAAiB,CAAC,CAAC;CACvD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,gBAAgB,CAAC,CAAC;CACtD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACtC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;CACrD,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;CACtD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,kBAAkB,EAAE,WAAW;CACrC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,CAAC,EAAE,mBAAmB;CACzB,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,WAAW,EAAE,QAAQ;CACxB,GAAG,CAAC,CAAC;CACL,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC;CACzD,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,2BAA2B,EAAE,UAAU;CAC7C,EAAE,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;CAC1B,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAClC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU;CAC3B,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,YAAY,EAAE,cAAc;CAC/B,GAAG,SAAS,EAAE,aAAa;CAC3B,GAAG,OAAO,EAAE,mBAAmB;CAC/B,GAAG,OAAO,EAAE,QAAQ;CACpB,GAAG,QAAQ,EAAE,CAAC,KAAK;CACnB,GAAG,WAAW,EAAE,SAAS;CACzB,GAAG,IAAI,EAAE,UAAU;CACnB,GAAG,IAAI,EAAE,CAAC;CACV;CACA,GAAG,QAAQ,EAAE,QAAQ;CACrB,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU;CAC1B,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,WAAW,EAAE,IAAI;CACpB,GAAG,mBAAmB,EAAE,CAAC,UAAU;CACnC,GAAG,SAAS,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE;CAC1B,GAAG,iBAAiB,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC;CAChC,GAAG,eAAe,EAAE,EAAE;CACtB,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,IAAI,SAAS,GAAG;CAClB,GAAG,MAAM,EAAE,EAAE,EAAE,GAAG;CAClB,GAAG,CAAC;CACJ,EAAE,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;CAC7D,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACxB,GAAG,kBAAkB,EAAE,IAAI;CAC3B,GAAG,CAAC,CAAC;CACL,EAAE,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CACrC,EAAE,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACpC,EAAE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;AAC/C;CACA,EAAE,KAAK,GAAG,IAAI,KAAK,CAAC;CACpB,GAAG,mBAAmB,EAAE,IAAI;CAC5B,GAAG,CAAC,CAAC;CACL,EAAE,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CACrC,EAAE,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACpC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;CAC1D,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW;CACjC,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC,CAAC;CACrD,EAAE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,EAAE,IAAI,CAAC,CAAC;CACnD,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU;CAC3B,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,OAAO,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACnC,GAAG,OAAO,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;CAC5C,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,eAAe,EAAE,WAAW;CAClC,EAAE,MAAM,IAAI,GAAG;CACf,IAAI,GAAG,EAAE,CAAC;CACV,IAAI,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC;CACnC,IAAI,MAAM,EAAE;CACZ,MAAM,GAAG,EAAE,IAAI;CACf,MAAM,GAAG,EAAE,CAAC,UAAU;CACtB,MAAM,MAAM,EAAE;CACd,QAAQ,GAAG,EAAE,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,QAAQ,GAAG,EAAE,GAAG;CAChB,QAAQ,MAAM,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,2BAA2B,CAAC;CAC1D,OAAO;CACP,KAAK;CACL,GAAG,CAAC;CACJ,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,oBAAoB,EAAE,WAAW;CACvC,EAAE,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,EAAE,aAAa,EAAE,IAAI,EAAE,oBAAoB,EAAE,IAAI,EAAE,CAAC,CAAC;AAClF;CACA,EAAE,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACxB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpC;CACA,EAAE,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACpC,EAAE,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAC3C,EAAE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;CAChE,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,yBAAyB,EAAE,WAAW;CAC5C,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;CACtB,EAAE,IAAI,IAAI,GAAG,CAAC,MAAM,EAAE,gBAAgB,EAAE,IAAI,CAAC,kOAAkO,CAAC,CAAC;CACjR,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,IAAI,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CACxC,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;CACvC,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,gBAAgB,EAAE,MAAM;CAC9B,EAAE,IAAI,MAAM,GAAG,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5D,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACzC,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,EAAE,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;CAC5E,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACzC,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,+BAA+B,EAAE,MAAM;CAC7C,EAAE,IAAI,MAAM,GAAG,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5D,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;CACzC,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,EAAE,cAAc,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CACpG,EAAE,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CACjE,EAAE,CAAC,CAAC;AACJ;CACA,CAAC,IAAI,CAAC,4BAA4B,EAAE,MAAM;CAC1C,EAAE,MAAM,YAAY,CAAC;CACrB,GAAG,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC3B,GAAG,MAAM,GAAG;CACZ,IAAI,OAAO,IAAI,CAAC;CAChB,IAAI;CACJ,GAAG;CACH,EAAE,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,YAAY,CAAC,CAAC;CAC5C,EAAE,MAAM,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;CAC1C,EAAE,MAAM,CAAC,eAAe,CAAC,YAAY,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;CACnE,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,aAAa,EAAE,YAAY;CACjC,EAAE,IAAI,IAAI,GAAG;CACb,GAAG,IAAI,EAAE;CACT,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACnD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE;CACzD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACrD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;CACpD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACpD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE;CACpD,IAAI;CACJ,GAAG,WAAW,EAAE,YAAY;CAC5B,GAAG,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;CACzB,GAAG,gBAAgB,EAAE;CACrB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;CACf,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;CACf,IAAI,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;CAC/B,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;CAClB,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,QAAQ,GAAG;CACjB,GAAG,IAAI,EAAE;CACT,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACnD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE;CACvC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACrD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG;CACzC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE;CACpD,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE;CACvC,IAAI;CACJ,GAAG,WAAW,EAAE,YAAY;CAC5B,GAAG,KAAK,EAAE,CAAC,KAAK,EAAE,MAAM,CAAC;CACzB,GAAG,gBAAgB,EAAE;CACrB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE;CACpB,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;CACf,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE;CACf,IAAI,EAAE,IAAI,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE;CAC/B,IAAI,EAAE;CACN,IAAI;CACJ,GAAG,CAAC;CACJ,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;CAC9E,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,IAAI,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;CAC9C,EAAE,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;CAC3C,EAAE,CAAC,CAAC;CACJ,CAAC,CAAC,CAAC;CACH,KAAK,CAAC,4BAA4B,EAAE,UAAU;CAC9C,CAAC,IAAI,CAAC,wBAAwB,EAAE,WAAW;CAC3C,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC;CACxB,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;CAEtB,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;CACxC,EAAE,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CAC9C,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACvC,GAAsB,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE;CAC7C,GAAG;CACH,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,4BAA4B,EAAE,WAAW;CAC/C,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC;CACxB,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;CACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACvC,GAAoB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;CACzC,GAAG;CACH,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,oBAAoB,EAAE,WAAW;CACvC,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC;CACxB,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;CACtB,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;CAC9B,EAAE,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CACrD,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC;CAC9D,EAAE,IAAI,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACpC,EAAE,OAAO,CAAC,GAAG,CAAC,6BAA6B,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;CAChE,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACvC,GAAsB,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE;CAC/C,GAAG;CACH,EAAE,CAAC,CAAC;CACJ,CAAC,IAAI,CAAC,kBAAkB,EAAE,WAAW;CACrC,EAAE,IAAI,IAAI,GAAG,UAAU,CAAC;CACxB,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;CACtB,EAAE,IAAI,UAAU,GAAG,EAAE,CAAC;CACtB,EAAE,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,UAAU,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC;CAC9D,EAAE,IAAI,MAAM,GAAG,OAAO,MAAM,IAAI,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;AAC9F;CACA,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACvC;CACA,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;CAC3B,GAAoB,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE;CACrC;CACA,GAAG;CACH;CACA,EAAE,CAAC,CAAC;CACJ,CAAC,CAAC;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/dist/unpack-no-eval.cjs b/node_modules/msgpackr/dist/unpack-no-eval.cjs
new file mode 100644
index 0000000..649eef1
--- /dev/null
+++ b/node_modules/msgpackr/dist/unpack-no-eval.cjs
@@ -0,0 +1,1266 @@
+(function (global, factory) {
+	typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+	typeof define === 'function' && define.amd ? define(['exports'], factory) :
+	(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.msgpackr = {}));
+})(this, (function (exports) { 'use strict';
+
+	var decoder;
+	try {
+		decoder = new TextDecoder();
+	} catch(error) {}
+	var src;
+	var srcEnd;
+	var position = 0;
+	const EMPTY_ARRAY = [];
+	var strings = EMPTY_ARRAY;
+	var stringPosition = 0;
+	var currentUnpackr = {};
+	var currentStructures;
+	var srcString;
+	var srcStringStart = 0;
+	var srcStringEnd = 0;
+	var bundledStrings;
+	var referenceMap;
+	var currentExtensions = [];
+	var dataView;
+	var defaultOptions = {
+		useRecords: false,
+		mapsAsObjects: true
+	};
+	class C1Type {}
+	const C1 = new C1Type();
+	C1.name = 'MessagePack 0xC1';
+	var sequentialMode = false;
+	var inlineObjectReadThreshold = 2;
+	var BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for
+
+	class Unpackr {
+		constructor(options) {
+			if (options) {
+				if (options.useRecords === false && options.mapsAsObjects === undefined)
+					options.mapsAsObjects = true;
+				if (options.sequential && options.trusted !== false) {
+					options.trusted = true;
+					if (!options.structures && options.useRecords != false) {
+						options.structures = [];
+						if (!options.maxSharedStructures)
+							options.maxSharedStructures = 0;
+					}
+				}
+				if (options.structures)
+					options.structures.sharedLength = options.structures.length;
+				else if (options.getStructures) {
+					(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+					options.structures.sharedLength = 0;
+				}
+				if (options.int64AsNumber) {
+					options.int64AsType = 'number';
+				}
+			}
+			Object.assign(this, options);
+		}
+		unpack(source, options) {
+			if (src) {
+				// re-entrant execution, save the state and restore it after we do this unpack
+				return saveState(() => {
+					clearSource();
+					return this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);
+				});
+			}
+			if (!source.buffer && source.constructor === ArrayBuffer)
+				source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+			if (typeof options === 'object') {
+				srcEnd = options.end || source.length;
+				position = options.start || 0;
+			} else {
+				position = 0;
+				srcEnd = options > -1 ? options : source.length;
+			}
+			stringPosition = 0;
+			srcStringEnd = 0;
+			srcString = null;
+			strings = EMPTY_ARRAY;
+			bundledStrings = null;
+			src = source;
+			// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+			// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+			// new ones
+			try {
+				dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+			} catch(error) {
+				// if it doesn't have a buffer, maybe it is the wrong type of object
+				src = null;
+				if (source instanceof Uint8Array)
+					throw error;
+				throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+			}
+			if (this instanceof Unpackr) {
+				currentUnpackr = this;
+				if (this.structures) {
+					currentStructures = this.structures;
+					return checkedRead(options);
+				} else if (!currentStructures || currentStructures.length > 0) {
+					currentStructures = [];
+				}
+			} else {
+				currentUnpackr = defaultOptions;
+				if (!currentStructures || currentStructures.length > 0)
+					currentStructures = [];
+			}
+			return checkedRead(options);
+		}
+		unpackMultiple(source, forEach) {
+			let values, lastPosition = 0;
+			try {
+				sequentialMode = true;
+				let size = source.length;
+				let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+				if (forEach) {
+					if (forEach(value, lastPosition, position) === false) return;
+					while(position < size) {
+						lastPosition = position;
+						if (forEach(checkedRead(), lastPosition, position) === false) {
+							return;
+						}
+					}
+				}
+				else {
+					values = [ value ];
+					while(position < size) {
+						lastPosition = position;
+						values.push(checkedRead());
+					}
+					return values;
+				}
+			} catch(error) {
+				error.lastPosition = lastPosition;
+				error.values = values;
+				throw error;
+			} finally {
+				sequentialMode = false;
+				clearSource();
+			}
+		}
+		_mergeStructures(loadedStructures, existingStructures) {
+			if (this._onLoadedStructures)
+				loadedStructures = this._onLoadedStructures(loadedStructures);
+			loadedStructures = loadedStructures || [];
+			if (Object.isFrozen(loadedStructures))
+				loadedStructures = loadedStructures.map(structure => structure.slice(0));
+			for (let i = 0, l = loadedStructures.length; i < l; i++) {
+				let structure = loadedStructures[i];
+				if (structure) {
+					structure.isShared = true;
+					if (i >= 32)
+						structure.highByte = (i - 32) >> 5;
+				}
+			}
+			loadedStructures.sharedLength = loadedStructures.length;
+			for (let id in existingStructures || []) {
+				if (id >= 0) {
+					let structure = loadedStructures[id];
+					let existing = existingStructures[id];
+					if (existing) {
+						if (structure)
+							(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+						loadedStructures[id] = existing;
+					}
+				}
+			}
+			return this.structures = loadedStructures;
+		}
+		decode(source, options) {
+			return this.unpack(source, options);
+		}
+	}
+	function getPosition() {
+		return position;
+	}
+	function checkedRead(options) {
+		try {
+			if (!currentUnpackr.trusted && !sequentialMode) {
+				let sharedLength = currentStructures.sharedLength || 0;
+				if (sharedLength < currentStructures.length)
+					currentStructures.length = sharedLength;
+			}
+			let result;
+			if (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {
+				result = currentUnpackr._readStruct(src, position, srcEnd);
+				src = null; // dispose of this so that recursive unpack calls don't save state
+				if (!(options && options.lazy) && result)
+					result = result.toJSON();
+				position = srcEnd;
+			} else
+				result = read();
+			if (bundledStrings) { // bundled strings to skip past
+				position = bundledStrings.postBundlePosition;
+				bundledStrings = null;
+			}
+			if (sequentialMode)
+				// we only need to restore the structures if there was an error, but if we completed a read,
+				// we can clear this out and keep the structures we read
+				currentStructures.restoreStructures = null;
+
+			if (position == srcEnd) {
+				// finished reading this source, cleanup references
+				if (currentStructures && currentStructures.restoreStructures)
+					restoreStructures();
+				currentStructures = null;
+				src = null;
+				if (referenceMap)
+					referenceMap = null;
+			} else if (position > srcEnd) {
+				// over read
+				throw new Error('Unexpected end of MessagePack data');
+			} else if (!sequentialMode) {
+				let jsonView;
+				try {
+					jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+				} catch(error) {
+					jsonView = '(JSON view not available ' + error + ')';
+				}
+				throw new Error('Data read, but end of buffer not reached ' + jsonView);
+			}
+			// else more to read, but we are reading sequentially, so don't clear source yet
+			return result;
+		} catch(error) {
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			clearSource();
+			if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {
+				error.incomplete = true;
+			}
+			throw error;
+		}
+	}
+
+	function restoreStructures() {
+		for (let id in currentStructures.restoreStructures) {
+			currentStructures[id] = currentStructures.restoreStructures[id];
+		}
+		currentStructures.restoreStructures = null;
+	}
+
+	function read() {
+		let token = src[position++];
+		if (token < 0xa0) {
+			if (token < 0x80) {
+				if (token < 0x40)
+					return token;
+				else {
+					let structure = currentStructures[token & 0x3f] ||
+						currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+					if (structure) {
+						if (!structure.read) {
+							structure.read = createStructureReader(structure, token & 0x3f);
+						}
+						return structure.read();
+					} else
+						return token;
+				}
+			} else if (token < 0x90) {
+				// map
+				token -= 0x80;
+				if (currentUnpackr.mapsAsObjects) {
+					let object = {};
+					for (let i = 0; i < token; i++) {
+						let key = readKey();
+						if (key === '__proto__')
+							key = '__proto_';
+						object[key] = read();
+					}
+					return object;
+				} else {
+					let map = new Map();
+					for (let i = 0; i < token; i++) {
+						map.set(read(), read());
+					}
+					return map;
+				}
+			} else {
+				token -= 0x90;
+				let array = new Array(token);
+				for (let i = 0; i < token; i++) {
+					array[i] = read();
+				}
+				if (currentUnpackr.freezeData)
+					return Object.freeze(array);
+				return array;
+			}
+		} else if (token < 0xc0) {
+			// fixstr
+			let length = token - 0xa0;
+			if (srcStringEnd >= position) {
+				return srcString.slice(position - srcStringStart, (position += length) - srcStringStart);
+			}
+			if (srcStringEnd == 0 && srcEnd < 140) {
+				// for small blocks, avoiding the overhead of the extract call is helpful
+				let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+				if (string != null)
+					return string;
+			}
+			return readFixedString(length);
+		} else {
+			let value;
+			switch (token) {
+				case 0xc0: return null;
+				case 0xc1:
+					if (bundledStrings) {
+						value = read(); // followed by the length of the string in characters (not bytes!)
+						if (value > 0)
+							return bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);
+						else
+							return bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);
+					}
+					return C1; // "never-used", return special object to denote that
+				case 0xc2: return false;
+				case 0xc3: return true;
+				case 0xc4:
+					// bin 8
+					value = src[position++];
+					if (value === undefined)
+						throw new Error('Unexpected end of buffer');
+					return readBin(value);
+				case 0xc5:
+					// bin 16
+					value = dataView.getUint16(position);
+					position += 2;
+					return readBin(value);
+				case 0xc6:
+					// bin 32
+					value = dataView.getUint32(position);
+					position += 4;
+					return readBin(value);
+				case 0xc7:
+					// ext 8
+					return readExt(src[position++]);
+				case 0xc8:
+					// ext 16
+					value = dataView.getUint16(position);
+					position += 2;
+					return readExt(value);
+				case 0xc9:
+					// ext 32
+					value = dataView.getUint32(position);
+					position += 4;
+					return readExt(value);
+				case 0xca:
+					value = dataView.getFloat32(position);
+					if (currentUnpackr.useFloat32 > 2) {
+						// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+						let multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];
+						position += 4;
+						return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+					}
+					position += 4;
+					return value;
+				case 0xcb:
+					value = dataView.getFloat64(position);
+					position += 8;
+					return value;
+				// uint handlers
+				case 0xcc:
+					return src[position++];
+				case 0xcd:
+					value = dataView.getUint16(position);
+					position += 2;
+					return value;
+				case 0xce:
+					value = dataView.getUint32(position);
+					position += 4;
+					return value;
+				case 0xcf:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getUint32(position) * 0x100000000;
+						value += dataView.getUint32(position + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigUint64(position).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigUint64(position);
+						if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigUint64(position);
+					position += 8;
+					return value;
+
+				// int handlers
+				case 0xd0:
+					return dataView.getInt8(position++);
+				case 0xd1:
+					value = dataView.getInt16(position);
+					position += 2;
+					return value;
+				case 0xd2:
+					value = dataView.getInt32(position);
+					position += 4;
+					return value;
+				case 0xd3:
+					if (currentUnpackr.int64AsType === 'number') {
+						value = dataView.getInt32(position) * 0x100000000;
+						value += dataView.getUint32(position + 4);
+					} else if (currentUnpackr.int64AsType === 'string') {
+						value = dataView.getBigInt64(position).toString();
+					} else if (currentUnpackr.int64AsType === 'auto') {
+						value = dataView.getBigInt64(position);
+						if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+					} else
+						value = dataView.getBigInt64(position);
+					position += 8;
+					return value;
+
+				case 0xd4:
+					// fixext 1
+					value = src[position++];
+					if (value == 0x72) {
+						return recordDefinition(src[position++] & 0x3f);
+					} else {
+						let extension = currentExtensions[value];
+						if (extension) {
+							if (extension.read) {
+								position++; // skip filler byte
+								return extension.read(read());
+							} else if (extension.noBuffer) {
+								position++; // skip filler byte
+								return extension();
+							} else
+								return extension(src.subarray(position, ++position));
+						} else
+							throw new Error('Unknown extension ' + value);
+					}
+				case 0xd5:
+					// fixext 2
+					value = src[position];
+					if (value == 0x72) {
+						position++;
+						return recordDefinition(src[position++] & 0x3f, src[position++]);
+					} else
+						return readExt(2);
+				case 0xd6:
+					// fixext 4
+					return readExt(4);
+				case 0xd7:
+					// fixext 8
+					return readExt(8);
+				case 0xd8:
+					// fixext 16
+					return readExt(16);
+				case 0xd9:
+				// str 8
+					value = src[position++];
+					if (srcStringEnd >= position) {
+						return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+					}
+					return readString8(value);
+				case 0xda:
+				// str 16
+					value = dataView.getUint16(position);
+					position += 2;
+					if (srcStringEnd >= position) {
+						return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+					}
+					return readString16(value);
+				case 0xdb:
+				// str 32
+					value = dataView.getUint32(position);
+					position += 4;
+					if (srcStringEnd >= position) {
+						return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+					}
+					return readString32(value);
+				case 0xdc:
+				// array 16
+					value = dataView.getUint16(position);
+					position += 2;
+					return readArray(value);
+				case 0xdd:
+				// array 32
+					value = dataView.getUint32(position);
+					position += 4;
+					return readArray(value);
+				case 0xde:
+				// map 16
+					value = dataView.getUint16(position);
+					position += 2;
+					return readMap(value);
+				case 0xdf:
+				// map 32
+					value = dataView.getUint32(position);
+					position += 4;
+					return readMap(value);
+				default: // negative int
+					if (token >= 0xe0)
+						return token - 0x100;
+					if (token === undefined) {
+						let error = new Error('Unexpected end of MessagePack data');
+						error.incomplete = true;
+						throw error;
+					}
+					throw new Error('Unknown MessagePack token ' + token);
+
+			}
+		}
+	}
+	const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+	function createStructureReader(structure, firstId) {
+		function readObject() {
+			// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+			if (readObject.count++ > inlineObjectReadThreshold) {
+				let optimizedReadObject;
+				try {
+					optimizedReadObject = structure.read = (new BlockedFunction ('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+						'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+				} catch(error) {
+					// in CF workers, the new BlockedFunction  call could begin to fail at any point in time
+					inlineObjectReadThreshold = Infinity; // disable going forward
+					return readObject(); // recursively try again
+				}
+				if (structure.highByte === 0)
+					structure.read = createSecondByteReader(firstId, structure.read);
+				return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+			}
+			let object = {};
+			for (let i = 0, l = structure.length; i < l; i++) {
+				let key = structure[i];
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(object);
+			return object;
+		}
+		readObject.count = 0;
+		if (structure.highByte === 0) {
+			return createSecondByteReader(firstId, readObject);
+		}
+		return readObject;
+	}
+
+	const createSecondByteReader = (firstId, read0) => {
+		return function() {
+			let highByte = src[position++];
+			if (highByte === 0)
+				return read0();
+			let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+			let structure = currentStructures[id] || loadStructures()[id];
+			if (!structure) {
+				throw new Error('Record id is not defined for ' + id);
+			}
+			if (!structure.read)
+				structure.read = createStructureReader(structure, firstId);
+			return structure.read();
+		};
+	};
+
+	function loadStructures() {
+		let loadedStructures = saveState(() => {
+			// save the state in case getStructures modifies our buffer
+			src = null;
+			return currentUnpackr.getStructures();
+		});
+		return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+	}
+
+	var readFixedString = readStringJS;
+	var readString8 = readStringJS;
+	var readString16 = readStringJS;
+	var readString32 = readStringJS;
+	exports.isNativeAccelerationEnabled = false;
+
+	function setExtractor(extractStrings) {
+		exports.isNativeAccelerationEnabled = true;
+		readFixedString = readString(1);
+		readString8 = readString(2);
+		readString16 = readString(3);
+		readString32 = readString(5);
+		function readString(headerLength) {
+			return function readString(length) {
+				let string = strings[stringPosition++];
+				if (string == null) {
+					if (bundledStrings)
+						return readStringJS(length);
+					let byteOffset = src.byteOffset;
+					let extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);
+					if (typeof extraction == 'string') {
+						string = extraction;
+						strings = EMPTY_ARRAY;
+					} else {
+						strings = extraction;
+						stringPosition = 1;
+						srcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings
+						string = strings[0];
+						if (string === undefined)
+							throw new Error('Unexpected end of buffer');
+					}
+				}
+				let srcStringLength = string.length;
+				if (srcStringLength <= length) {
+					position += length;
+					return string;
+				}
+				srcString = string;
+				srcStringStart = position;
+				srcStringEnd = position + srcStringLength;
+				position += length;
+				return string.slice(0, length); // we know we just want the beginning
+			};
+		}
+	}
+	function readStringJS(length) {
+		let result;
+		if (length < 16) {
+			if (result = shortStringInJS(length))
+				return result;
+		}
+		if (length > 64 && decoder)
+			return decoder.decode(src.subarray(position, position += length));
+		const end = position + length;
+		const units = [];
+		result = '';
+		while (position < end) {
+			const byte1 = src[position++];
+			if ((byte1 & 0x80) === 0) {
+				// 1 byte
+				units.push(byte1);
+			} else if ((byte1 & 0xe0) === 0xc0) {
+				// 2 bytes
+				const byte2 = src[position++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+				// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+				if (codePoint < 0x80) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf0) === 0xe0) {
+				// 3 bytes
+				const byte2 = src[position++] & 0x3f;
+				const byte3 = src[position++] & 0x3f;
+				const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+				// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+				// Also reject surrogates (0xD800-0xDFFF)
+				if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+					units.push(0xFFFD); // replacement character
+				} else {
+					units.push(codePoint);
+				}
+			} else if ((byte1 & 0xf8) === 0xf0) {
+				// 4 bytes
+				const byte2 = src[position++] & 0x3f;
+				const byte3 = src[position++] & 0x3f;
+				const byte4 = src[position++] & 0x3f;
+				let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+				// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+				// Also reject values > 0x10FFFF (maximum valid Unicode)
+				if (unit < 0x10000 || unit > 0x10FFFF) {
+					units.push(0xFFFD); // replacement character
+				} else if (unit > 0xffff) {
+					unit -= 0x10000;
+					units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+					unit = 0xdc00 | (unit & 0x3ff);
+					units.push(unit);
+				} else {
+					units.push(unit);
+				}
+			} else {
+				units.push(0xFFFD); // replacement character for invalid lead byte
+			}
+
+			if (units.length >= 0x1000) {
+				result += fromCharCode.apply(String, units);
+				units.length = 0;
+			}
+		}
+
+		if (units.length > 0) {
+			result += fromCharCode.apply(String, units);
+		}
+
+		return result;
+	}
+	function readString(source, start, length) {
+		let existingSrc = src;
+		src = source;
+		position = start;
+		try {
+			return readStringJS(length);
+		} finally {
+			src = existingSrc;
+		}
+	}
+
+	function readArray(length) {
+		let array = new Array(length);
+		for (let i = 0; i < length; i++) {
+			array[i] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(array);
+		return array;
+	}
+
+	function readMap(length) {
+		if (currentUnpackr.mapsAsObjects) {
+			let object = {};
+			for (let i = 0; i < length; i++) {
+				let key = readKey();
+				if (key === '__proto__')
+					key = '__proto_';
+				object[key] = read();
+			}
+			return object;
+		} else {
+			let map = new Map();
+			for (let i = 0; i < length; i++) {
+				map.set(read(), read());
+			}
+			return map;
+		}
+	}
+
+	var fromCharCode = String.fromCharCode;
+	function longStringInJS(length) {
+		let start = position;
+		let bytes = new Array(length);
+		for (let i = 0; i < length; i++) {
+			const byte = src[position++];
+			if ((byte & 0x80) > 0) {
+					position = start;
+					return;
+				}
+				bytes[i] = byte;
+			}
+			return fromCharCode.apply(String, bytes);
+	}
+	function shortStringInJS(length) {
+		if (length < 4) {
+			if (length < 2) {
+				if (length === 0)
+					return '';
+				else {
+					let a = src[position++];
+					if ((a & 0x80) > 1) {
+						position -= 1;
+						return;
+					}
+					return fromCharCode(a);
+				}
+			} else {
+				let a = src[position++];
+				let b = src[position++];
+				if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+					position -= 2;
+					return;
+				}
+				if (length < 3)
+					return fromCharCode(a, b);
+				let c = src[position++];
+				if ((c & 0x80) > 0) {
+					position -= 3;
+					return;
+				}
+				return fromCharCode(a, b, c);
+			}
+		} else {
+			let a = src[position++];
+			let b = src[position++];
+			let c = src[position++];
+			let d = src[position++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+				position -= 4;
+				return;
+			}
+			if (length < 6) {
+				if (length === 4)
+					return fromCharCode(a, b, c, d);
+				else {
+					let e = src[position++];
+					if ((e & 0x80) > 0) {
+						position -= 5;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e);
+				}
+			} else if (length < 8) {
+				let e = src[position++];
+				let f = src[position++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+					position -= 6;
+					return;
+				}
+				if (length < 7)
+					return fromCharCode(a, b, c, d, e, f);
+				let g = src[position++];
+				if ((g & 0x80) > 0) {
+					position -= 7;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g);
+			} else {
+				let e = src[position++];
+				let f = src[position++];
+				let g = src[position++];
+				let h = src[position++];
+				if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+					position -= 8;
+					return;
+				}
+				if (length < 10) {
+					if (length === 8)
+						return fromCharCode(a, b, c, d, e, f, g, h);
+					else {
+						let i = src[position++];
+						if ((i & 0x80) > 0) {
+							position -= 9;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i);
+					}
+				} else if (length < 12) {
+					let i = src[position++];
+					let j = src[position++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+						position -= 10;
+						return;
+					}
+					if (length < 11)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+					let k = src[position++];
+					if ((k & 0x80) > 0) {
+						position -= 11;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+				} else {
+					let i = src[position++];
+					let j = src[position++];
+					let k = src[position++];
+					let l = src[position++];
+					if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+						position -= 12;
+						return;
+					}
+					if (length < 14) {
+						if (length === 12)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+						else {
+							let m = src[position++];
+							if ((m & 0x80) > 0) {
+								position -= 13;
+								return;
+							}
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+						}
+					} else {
+						let m = src[position++];
+						let n = src[position++];
+						if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+							position -= 14;
+							return;
+						}
+						if (length < 15)
+							return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+						let o = src[position++];
+						if ((o & 0x80) > 0) {
+							position -= 15;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+					}
+				}
+			}
+		}
+	}
+
+	function readOnlyJSString() {
+		let token = src[position++];
+		let length;
+		if (token < 0xc0) {
+			// fixstr
+			length = token - 0xa0;
+		} else {
+			switch(token) {
+				case 0xd9:
+				// str 8
+					length = src[position++];
+					break;
+				case 0xda:
+				// str 16
+					length = dataView.getUint16(position);
+					position += 2;
+					break;
+				case 0xdb:
+				// str 32
+					length = dataView.getUint32(position);
+					position += 4;
+					break;
+				default:
+					throw new Error('Expected string');
+			}
+		}
+		return readStringJS(length);
+	}
+
+
+	function readBin(length) {
+		return currentUnpackr.copyBuffers ?
+			// specifically use the copying slice (not the node one)
+			Uint8Array.prototype.slice.call(src, position, position += length) :
+			src.subarray(position, position += length);
+	}
+	function readExt(length) {
+		let type = src[position++];
+		if (currentExtensions[type]) {
+			let end;
+			return currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {
+				position = readPosition;
+				try {
+					return read();
+				} finally {
+					position = end;
+				}
+			});
+		}
+		else
+			throw new Error('Unknown extension type ' + type);
+	}
+
+	var keyCache = new Array(4096);
+	function readKey() {
+		let length = src[position++];
+		if (length >= 0xa0 && length < 0xc0) {
+			// fixstr, potentially use key cache
+			length = length - 0xa0;
+			if (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)
+				return srcString.slice(position - srcStringStart, (position += length) - srcStringStart);
+			else if (!(srcStringEnd == 0 && srcEnd < 180))
+				return readFixedString(length);
+		} else { // not cacheable, go back and do a standard read
+			position--;
+			return asSafeString(read());
+		}
+		let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;
+		let entry = keyCache[key];
+		let checkPosition = position;
+		let end = position + length - 3;
+		let chunk;
+		let i = 0;
+		if (entry && entry.bytes == length) {
+			while (checkPosition < end) {
+				chunk = dataView.getUint32(checkPosition);
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+				checkPosition += 4;
+			}
+			end += 3;
+			while (checkPosition < end) {
+				chunk = src[checkPosition++];
+				if (chunk != entry[i++]) {
+					checkPosition = 0x70000000;
+					break;
+				}
+			}
+			if (checkPosition === end) {
+				position = checkPosition;
+				return entry.string;
+			}
+			end -= 3;
+			checkPosition = position;
+		}
+		entry = [];
+		keyCache[key] = entry;
+		entry.bytes = length;
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			entry.push(chunk);
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			entry.push(chunk);
+		}
+		// for small blocks, avoiding the overhead of the extract call is helpful
+		let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+		if (string != null)
+			return entry.string = string;
+		return entry.string = readFixedString(length);
+	}
+
+	function asSafeString(property) {
+		// protect against expensive (DoS) string conversions
+		if (typeof property === 'string') return property;
+		if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+		if (property == null) return property + '';
+		if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+			return property.flat().toString();
+		}
+		throw new Error(`Invalid property type for record: ${typeof property}`);
+	}
+	// the registration of the record definition extension (as "r")
+	const recordDefinition = (id, highByte) => {
+		let structure = read().map(asSafeString); // ensure that all keys are strings and
+		// that the array is mutable
+		let firstByte = id;
+		if (highByte !== undefined) {
+			id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+			structure.highByte = highByte;
+		}
+		let existingStructure = currentStructures[id];
+		// If it is a shared structure, we need to restore any changes after reading.
+		// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+		// to the state prior to an incomplete read in order to properly resume.
+		if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+			(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+		}
+		currentStructures[id] = structure;
+		structure.read = createStructureReader(structure, firstByte);
+		return structure.read();
+	};
+	currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+	currentExtensions[0].noBuffer = true;
+
+	currentExtensions[0x42] = data => {
+		let headLength = (data.byteLength % 8) || 8;
+		let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+		for (let i = 1; i < headLength; i++) {
+			head <<= BigInt(8);
+			head += BigInt(data[i]);
+		}
+		if (data.byteLength !== headLength) {
+			let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+			let decode = (start, end) => {
+				let length = end - start;
+				if (length <= 40) {
+					let out = view.getBigUint64(start);
+					for (let i = start + 8; i < end; i += 8) {
+						out <<= BigInt(64);
+						out |= view.getBigUint64(i);
+					}
+					return out;
+				}
+				// if (length === 8) return view.getBigUint64(start)
+				let middle = start + (length >> 4 << 3);
+				let left = decode(start, middle);
+				let right = decode(middle, end);
+				return (left << BigInt((end - middle) * 8)) | right;
+			};
+			head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+		}
+		return head;
+	};
+
+	let errors = {
+		Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+	};
+	currentExtensions[0x65] = () => {
+		let data = read();
+		if (!errors[data[0]]) {
+			let error = Error(data[1], { cause: data[2] });
+			error.name = data[0];
+			return error;
+		}
+		return errors[data[0]](data[1], { cause: data[2] });
+	};
+
+	currentExtensions[0x69] = (data) => {
+		// id extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position - 4);
+		if (!referenceMap)
+			referenceMap = new Map();
+		let token = src[position];
+		let target;
+		// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+		if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+			target = [];
+		else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+			target = new Map();
+		else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)
+			target = new Set();
+		else
+			target = {};
+
+		let refEntry = { target }; // a placeholder object
+		referenceMap.set(id, refEntry);
+		let targetProperties = read(); // read the next value as the target object to id
+		if (!refEntry.used) {
+			// no cycle, can just use the returned read object
+			return refEntry.target = targetProperties; // replace the placeholder with the real one
+		} else {
+			// there is a cycle, so we have to assign properties to original target
+			Object.assign(target, targetProperties);
+		}
+
+		// copy over map/set entries if we're able to
+		if (target instanceof Map)
+			for (let [k, v] of targetProperties.entries()) target.set(k, v);
+		if (target instanceof Set)
+			for (let i of Array.from(targetProperties)) target.add(i);
+		return target;
+	};
+
+	currentExtensions[0x70] = (data) => {
+		// pointer extension (for structured clones)
+		if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+		let id = dataView.getUint32(position - 4);
+		let refEntry = referenceMap.get(id);
+		refEntry.used = true;
+		return refEntry.target;
+	};
+
+	currentExtensions[0x73] = () => new Set(read());
+
+	const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+	let glbl = typeof globalThis === 'object' ? globalThis : window;
+	currentExtensions[0x74] = (data) => {
+		let typeCode = data[0];
+		// we always have to slice to get a new ArrayBuffer that is aligned
+		let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+		let typedArrayName = typedArrays[typeCode];
+		if (!typedArrayName) {
+			if (typeCode === 16) return buffer;
+			if (typeCode === 17) return new DataView(buffer);
+			throw new Error('Could not find typed array for code ' + typeCode);
+		}
+		return new glbl[typedArrayName](buffer);
+	};
+	currentExtensions[0x78] = () => {
+		let data = read();
+		return new RegExp(data[0], data[1]);
+	};
+	const TEMP_BUNDLE = [];
+	currentExtensions[0x62] = (data) => {
+		let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+		let dataPosition = position;
+		position += dataSize - data.length;
+		bundledStrings = TEMP_BUNDLE;
+		bundledStrings = [readOnlyJSString(), readOnlyJSString()];
+		bundledStrings.position0 = 0;
+		bundledStrings.position1 = 0;
+		bundledStrings.postBundlePosition = position;
+		position = dataPosition;
+		return read();
+	};
+
+	currentExtensions[0xff] = (data) => {
+		// 32-bit date extension
+		if (data.length == 4)
+			return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+		else if (data.length == 8)
+			return new Date(
+				((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+				((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+		else if (data.length == 12)
+			return new Date(
+				((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+				(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+		else
+			return new Date('invalid');
+	};
+	// registration of bulk record definition?
+	// currentExtensions[0x52] = () =>
+
+	function saveState(callback) {
+		if (currentUnpackr && currentUnpackr._onSaveState)
+			currentUnpackr._onSaveState();
+		let savedSrcEnd = srcEnd;
+		let savedPosition = position;
+		let savedStringPosition = stringPosition;
+		let savedSrcStringStart = srcStringStart;
+		let savedSrcStringEnd = srcStringEnd;
+		let savedSrcString = srcString;
+		let savedStrings = strings;
+		let savedReferenceMap = referenceMap;
+		let savedBundledStrings = bundledStrings;
+
+		// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+		let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+		let savedStructures = currentStructures;
+		let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+		let savedPackr = currentUnpackr;
+		let savedSequentialMode = sequentialMode;
+		let value = callback();
+		srcEnd = savedSrcEnd;
+		position = savedPosition;
+		stringPosition = savedStringPosition;
+		srcStringStart = savedSrcStringStart;
+		srcStringEnd = savedSrcStringEnd;
+		srcString = savedSrcString;
+		strings = savedStrings;
+		referenceMap = savedReferenceMap;
+		bundledStrings = savedBundledStrings;
+		src = savedSrc;
+		sequentialMode = savedSequentialMode;
+		currentStructures = savedStructures;
+		currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+		currentUnpackr = savedPackr;
+		dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+		return value;
+	}
+	function clearSource() {
+		src = null;
+		referenceMap = null;
+		currentStructures = null;
+	}
+
+	function addExtension(extension) {
+		if (extension.unpack)
+			currentExtensions[extension.type] = extension.unpack;
+		else
+			currentExtensions[extension.type] = extension;
+	}
+
+	const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+	for (let i = 0; i < 256; i++) {
+		mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+	}
+	const Decoder = Unpackr;
+	var defaultUnpackr = new Unpackr({ useRecords: false });
+	const unpack = defaultUnpackr.unpack;
+	const unpackMultiple = defaultUnpackr.unpackMultiple;
+	const decode = defaultUnpackr.unpack;
+	const FLOAT32_OPTIONS = {
+		NEVER: 0,
+		ALWAYS: 1,
+		DECIMAL_ROUND: 3,
+		DECIMAL_FIT: 4
+	};
+	let f32Array = new Float32Array(1);
+	let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+	function roundFloat32(float32Number) {
+		f32Array[0] = float32Number;
+		let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+		return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+	}
+	// Marker for downstream libraries (e.g. structon) to detect per-instance
+	// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+	// this._onSaveState).  See `checkedRead` for the dispatch.
+	Unpackr.SUPPORTS_STRUCT_HOOKS = true;
+
+	exports.C1 = C1;
+	exports.C1Type = C1Type;
+	exports.Decoder = Decoder;
+	exports.FLOAT32_OPTIONS = FLOAT32_OPTIONS;
+	exports.Unpackr = Unpackr;
+	exports.addExtension = addExtension;
+	exports.checkedRead = checkedRead;
+	exports.clearSource = clearSource;
+	exports.decode = decode;
+	exports.getPosition = getPosition;
+	exports.loadStructures = loadStructures;
+	exports.mult10 = mult10;
+	exports.read = read;
+	exports.readString = readString;
+	exports.roundFloat32 = roundFloat32;
+	exports.setExtractor = setExtractor;
+	exports.typedArrays = typedArrays;
+	exports.unpack = unpack;
+	exports.unpackMultiple = unpackMultiple;
+
+}));
+//# sourceMappingURL=unpack-no-eval.cjs.map
diff --git a/node_modules/msgpackr/dist/unpack-no-eval.cjs.map b/node_modules/msgpackr/dist/unpack-no-eval.cjs.map
new file mode 100644
index 0000000..ec960e3
--- /dev/null
+++ b/node_modules/msgpackr/dist/unpack-no-eval.cjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"unpack-no-eval.cjs","sources":["../unpack.js"],"sourcesContent":["var decoder;\ntry {\n\tdecoder = new TextDecoder();\n} catch(error) {}\nvar src;\nvar srcEnd;\nvar position = 0;\nvar alreadySet;\nconst EMPTY_ARRAY = [];\nvar strings = EMPTY_ARRAY;\nvar stringPosition = 0;\nvar currentUnpackr = {};\nvar currentStructures;\nvar srcString;\nvar srcStringStart = 0;\nvar srcStringEnd = 0;\nvar bundledStrings;\nvar referenceMap;\nvar currentExtensions = [];\nvar dataView;\nvar defaultOptions = {\n\tuseRecords: false,\n\tmapsAsObjects: true\n};\nexport class C1Type {}\nexport const C1 = new C1Type();\nC1.name = 'MessagePack 0xC1';\nvar sequentialMode = false;\nvar inlineObjectReadThreshold = 2;\nvar BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for\n\nexport class Unpackr {\n\tconstructor(options) {\n\t\tif (options) {\n\t\t\tif (options.useRecords === false && options.mapsAsObjects === undefined)\n\t\t\t\toptions.mapsAsObjects = true;\n\t\t\tif (options.sequential && options.trusted !== false) {\n\t\t\t\toptions.trusted = true;\n\t\t\t\tif (!options.structures && options.useRecords != false) {\n\t\t\t\t\toptions.structures = [];\n\t\t\t\t\tif (!options.maxSharedStructures)\n\t\t\t\t\t\toptions.maxSharedStructures = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (options.structures)\n\t\t\t\toptions.structures.sharedLength = options.structures.length;\n\t\t\telse if (options.getStructures) {\n\t\t\t\t(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures\n\t\t\t\toptions.structures.sharedLength = 0;\n\t\t\t}\n\t\t\tif (options.int64AsNumber) {\n\t\t\t\toptions.int64AsType = 'number';\n\t\t\t}\n\t\t}\n\t\tObject.assign(this, options);\n\t}\n\tunpack(source, options) {\n\t\tif (src) {\n\t\t\t// re-entrant execution, save the state and restore it after we do this unpack\n\t\t\treturn saveState(() => {\n\t\t\t\tclearSource();\n\t\t\t\treturn this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);\n\t\t\t});\n\t\t}\n\t\tif (!source.buffer && source.constructor === ArrayBuffer)\n\t\t\tsource = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);\n\t\tif (typeof options === 'object') {\n\t\t\tsrcEnd = options.end || source.length;\n\t\t\tposition = options.start || 0;\n\t\t} else {\n\t\t\tposition = 0;\n\t\t\tsrcEnd = options > -1 ? options : source.length;\n\t\t}\n\t\tstringPosition = 0;\n\t\tsrcStringEnd = 0;\n\t\tsrcString = null;\n\t\tstrings = EMPTY_ARRAY;\n\t\tbundledStrings = null;\n\t\tsrc = source;\n\t\t// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend\n\t\t// technique for getting data from a database where it can be copied into an existing buffer instead of creating\n\t\t// new ones\n\t\ttry {\n\t\t\tdataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));\n\t\t} catch(error) {\n\t\t\t// if it doesn't have a buffer, maybe it is the wrong type of object\n\t\t\tsrc = null;\n\t\t\tif (source instanceof Uint8Array)\n\t\t\t\tthrow error;\n\t\t\tthrow new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));\n\t\t}\n\t\tif (this instanceof Unpackr) {\n\t\t\tcurrentUnpackr = this;\n\t\t\tif (this.structures) {\n\t\t\t\tcurrentStructures = this.structures;\n\t\t\t\treturn checkedRead(options);\n\t\t\t} else if (!currentStructures || currentStructures.length > 0) {\n\t\t\t\tcurrentStructures = [];\n\t\t\t}\n\t\t} else {\n\t\t\tcurrentUnpackr = defaultOptions;\n\t\t\tif (!currentStructures || currentStructures.length > 0)\n\t\t\t\tcurrentStructures = [];\n\t\t}\n\t\treturn checkedRead(options);\n\t}\n\tunpackMultiple(source, forEach) {\n\t\tlet values, lastPosition = 0;\n\t\ttry {\n\t\t\tsequentialMode = true;\n\t\t\tlet size = source.length;\n\t\t\tlet value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);\n\t\t\tif (forEach) {\n\t\t\t\tif (forEach(value, lastPosition, position) === false) return;\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tif (forEach(checkedRead(), lastPosition, position) === false) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvalues = [ value ];\n\t\t\t\twhile(position < size) {\n\t\t\t\t\tlastPosition = position;\n\t\t\t\t\tvalues.push(checkedRead());\n\t\t\t\t}\n\t\t\t\treturn values;\n\t\t\t}\n\t\t} catch(error) {\n\t\t\terror.lastPosition = lastPosition;\n\t\t\terror.values = values;\n\t\t\tthrow error;\n\t\t} finally {\n\t\t\tsequentialMode = false;\n\t\t\tclearSource();\n\t\t}\n\t}\n\t_mergeStructures(loadedStructures, existingStructures) {\n\t\tif (this._onLoadedStructures)\n\t\t\tloadedStructures = this._onLoadedStructures(loadedStructures);\n\t\tloadedStructures = loadedStructures || [];\n\t\tif (Object.isFrozen(loadedStructures))\n\t\t\tloadedStructures = loadedStructures.map(structure => structure.slice(0));\n\t\tfor (let i = 0, l = loadedStructures.length; i < l; i++) {\n\t\t\tlet structure = loadedStructures[i];\n\t\t\tif (structure) {\n\t\t\t\tstructure.isShared = true;\n\t\t\t\tif (i >= 32)\n\t\t\t\t\tstructure.highByte = (i - 32) >> 5;\n\t\t\t}\n\t\t}\n\t\tloadedStructures.sharedLength = loadedStructures.length;\n\t\tfor (let id in existingStructures || []) {\n\t\t\tif (id >= 0) {\n\t\t\t\tlet structure = loadedStructures[id];\n\t\t\t\tlet existing = existingStructures[id];\n\t\t\t\tif (existing) {\n\t\t\t\t\tif (structure)\n\t\t\t\t\t\t(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;\n\t\t\t\t\tloadedStructures[id] = existing;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn this.structures = loadedStructures;\n\t}\n\tdecode(source, options) {\n\t\treturn this.unpack(source, options);\n\t}\n}\nexport function getPosition() {\n\treturn position;\n}\nexport function checkedRead(options) {\n\ttry {\n\t\tif (!currentUnpackr.trusted && !sequentialMode) {\n\t\t\tlet sharedLength = currentStructures.sharedLength || 0;\n\t\t\tif (sharedLength < currentStructures.length)\n\t\t\t\tcurrentStructures.length = sharedLength;\n\t\t}\n\t\tlet result;\n\t\tif (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {\n\t\t\tresult = currentUnpackr._readStruct(src, position, srcEnd);\n\t\t\tsrc = null; // dispose of this so that recursive unpack calls don't save state\n\t\t\tif (!(options && options.lazy) && result)\n\t\t\t\tresult = result.toJSON();\n\t\t\tposition = srcEnd;\n\t\t} else\n\t\t\tresult = read();\n\t\tif (bundledStrings) { // bundled strings to skip past\n\t\t\tposition = bundledStrings.postBundlePosition;\n\t\t\tbundledStrings = null;\n\t\t}\n\t\tif (sequentialMode)\n\t\t\t// we only need to restore the structures if there was an error, but if we completed a read,\n\t\t\t// we can clear this out and keep the structures we read\n\t\t\tcurrentStructures.restoreStructures = null;\n\n\t\tif (position == srcEnd) {\n\t\t\t// finished reading this source, cleanup references\n\t\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\t\trestoreStructures();\n\t\t\tcurrentStructures = null;\n\t\t\tsrc = null;\n\t\t\tif (referenceMap)\n\t\t\t\treferenceMap = null;\n\t\t} else if (position > srcEnd) {\n\t\t\t// over read\n\t\t\tthrow new Error('Unexpected end of MessagePack data');\n\t\t} else if (!sequentialMode) {\n\t\t\tlet jsonView;\n\t\t\ttry {\n\t\t\t\tjsonView = JSON.stringify(result, (_, value) => typeof value === \"bigint\" ? `${value}n` : value).slice(0, 100);\n\t\t\t} catch(error) {\n\t\t\t\tjsonView = '(JSON view not available ' + error + ')';\n\t\t\t}\n\t\t\tthrow new Error('Data read, but end of buffer not reached ' + jsonView);\n\t\t}\n\t\t// else more to read, but we are reading sequentially, so don't clear source yet\n\t\treturn result;\n\t} catch(error) {\n\t\tif (currentStructures && currentStructures.restoreStructures)\n\t\t\trestoreStructures();\n\t\tclearSource();\n\t\tif (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {\n\t\t\terror.incomplete = true;\n\t\t}\n\t\tthrow error;\n\t}\n}\n\nfunction restoreStructures() {\n\tfor (let id in currentStructures.restoreStructures) {\n\t\tcurrentStructures[id] = currentStructures.restoreStructures[id];\n\t}\n\tcurrentStructures.restoreStructures = null;\n}\n\nexport function read() {\n\tlet token = src[position++];\n\tif (token < 0xa0) {\n\t\tif (token < 0x80) {\n\t\t\tif (token < 0x40)\n\t\t\t\treturn token;\n\t\t\telse {\n\t\t\t\tlet structure = currentStructures[token & 0x3f] ||\n\t\t\t\t\tcurrentUnpackr.getStructures && loadStructures()[token & 0x3f];\n\t\t\t\tif (structure) {\n\t\t\t\t\tif (!structure.read) {\n\t\t\t\t\t\tstructure.read = createStructureReader(structure, token & 0x3f);\n\t\t\t\t\t}\n\t\t\t\t\treturn structure.read();\n\t\t\t\t} else\n\t\t\t\t\treturn token;\n\t\t\t}\n\t\t} else if (token < 0x90) {\n\t\t\t// map\n\t\t\ttoken -= 0x80;\n\t\t\tif (currentUnpackr.mapsAsObjects) {\n\t\t\t\tlet object = {};\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tlet key = readKey();\n\t\t\t\t\tif (key === '__proto__')\n\t\t\t\t\t\tkey = '__proto_';\n\t\t\t\t\tobject[key] = read();\n\t\t\t\t}\n\t\t\t\treturn object;\n\t\t\t} else {\n\t\t\t\tlet map = new Map();\n\t\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\t\tmap.set(read(), read());\n\t\t\t\t}\n\t\t\t\treturn map;\n\t\t\t}\n\t\t} else {\n\t\t\ttoken -= 0x90;\n\t\t\tlet array = new Array(token);\n\t\t\tfor (let i = 0; i < token; i++) {\n\t\t\t\tarray[i] = read();\n\t\t\t}\n\t\t\tif (currentUnpackr.freezeData)\n\t\t\t\treturn Object.freeze(array);\n\t\t\treturn array;\n\t\t}\n\t} else if (token < 0xc0) {\n\t\t// fixstr\n\t\tlet length = token - 0xa0;\n\t\tif (srcStringEnd >= position) {\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\t}\n\t\tif (srcStringEnd == 0 && srcEnd < 140) {\n\t\t\t// for small blocks, avoiding the overhead of the extract call is helpful\n\t\t\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\t\t\tif (string != null)\n\t\t\t\treturn string;\n\t\t}\n\t\treturn readFixedString(length);\n\t} else {\n\t\tlet value;\n\t\tswitch (token) {\n\t\t\tcase 0xc0: return null;\n\t\t\tcase 0xc1:\n\t\t\t\tif (bundledStrings) {\n\t\t\t\t\tvalue = read(); // followed by the length of the string in characters (not bytes!)\n\t\t\t\t\tif (value > 0)\n\t\t\t\t\t\treturn bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);\n\t\t\t\t\telse\n\t\t\t\t\t\treturn bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);\n\t\t\t\t}\n\t\t\t\treturn C1; // \"never-used\", return special object to denote that\n\t\t\tcase 0xc2: return false;\n\t\t\tcase 0xc3: return true;\n\t\t\tcase 0xc4:\n\t\t\t\t// bin 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value === undefined)\n\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc5:\n\t\t\t\t// bin 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc6:\n\t\t\t\t// bin 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readBin(value);\n\t\t\tcase 0xc7:\n\t\t\t\t// ext 8\n\t\t\t\treturn readExt(src[position++]);\n\t\t\tcase 0xc8:\n\t\t\t\t// ext 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xc9:\n\t\t\t\t// ext 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readExt(value);\n\t\t\tcase 0xca:\n\t\t\t\tvalue = dataView.getFloat32(position);\n\t\t\t\tif (currentUnpackr.useFloat32 > 2) {\n\t\t\t\t\t// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved\n\t\t\t\t\tlet multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];\n\t\t\t\t\tposition += 4;\n\t\t\t\t\treturn ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n\t\t\t\t}\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcb:\n\t\t\t\tvalue = dataView.getFloat64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\t\t\t// uint handlers\n\t\t\tcase 0xcc:\n\t\t\t\treturn src[position++];\n\t\t\tcase 0xcd:\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xce:\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xcf:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getUint32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\t\tif (value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigUint64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\t// int handlers\n\t\t\tcase 0xd0:\n\t\t\t\treturn dataView.getInt8(position++);\n\t\t\tcase 0xd1:\n\t\t\t\tvalue = dataView.getInt16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn value;\n\t\t\tcase 0xd2:\n\t\t\t\tvalue = dataView.getInt32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn value;\n\t\t\tcase 0xd3:\n\t\t\t\tif (currentUnpackr.int64AsType === 'number') {\n\t\t\t\t\tvalue = dataView.getInt32(position) * 0x100000000;\n\t\t\t\t\tvalue += dataView.getUint32(position + 4);\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'string') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position).toString();\n\t\t\t\t} else if (currentUnpackr.int64AsType === 'auto') {\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\t\tif (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);\n\t\t\t\t} else\n\t\t\t\t\tvalue = dataView.getBigInt64(position);\n\t\t\t\tposition += 8;\n\t\t\t\treturn value;\n\n\t\t\tcase 0xd4:\n\t\t\t\t// fixext 1\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f);\n\t\t\t\t} else {\n\t\t\t\t\tlet extension = currentExtensions[value];\n\t\t\t\t\tif (extension) {\n\t\t\t\t\t\tif (extension.read) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension.read(read());\n\t\t\t\t\t\t} else if (extension.noBuffer) {\n\t\t\t\t\t\t\tposition++; // skip filler byte\n\t\t\t\t\t\t\treturn extension();\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t\treturn extension(src.subarray(position, ++position));\n\t\t\t\t\t} else\n\t\t\t\t\t\tthrow new Error('Unknown extension ' + value);\n\t\t\t\t}\n\t\t\tcase 0xd5:\n\t\t\t\t// fixext 2\n\t\t\t\tvalue = src[position];\n\t\t\t\tif (value == 0x72) {\n\t\t\t\t\tposition++;\n\t\t\t\t\treturn recordDefinition(src[position++] & 0x3f, src[position++]);\n\t\t\t\t} else\n\t\t\t\t\treturn readExt(2);\n\t\t\tcase 0xd6:\n\t\t\t\t// fixext 4\n\t\t\t\treturn readExt(4);\n\t\t\tcase 0xd7:\n\t\t\t\t// fixext 8\n\t\t\t\treturn readExt(8);\n\t\t\tcase 0xd8:\n\t\t\t\t// fixext 16\n\t\t\t\treturn readExt(16);\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tvalue = src[position++];\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString8(value);\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString16(value);\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tif (srcStringEnd >= position) {\n\t\t\t\t\treturn srcString.slice(position - srcStringStart, (position += value) - srcStringStart);\n\t\t\t\t}\n\t\t\t\treturn readString32(value);\n\t\t\tcase 0xdc:\n\t\t\t// array 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xdd:\n\t\t\t// array 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readArray(value);\n\t\t\tcase 0xde:\n\t\t\t// map 16\n\t\t\t\tvalue = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\treturn readMap(value);\n\t\t\tcase 0xdf:\n\t\t\t// map 32\n\t\t\t\tvalue = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\treturn readMap(value);\n\t\t\tdefault: // negative int\n\t\t\t\tif (token >= 0xe0)\n\t\t\t\t\treturn token - 0x100;\n\t\t\t\tif (token === undefined) {\n\t\t\t\t\tlet error = new Error('Unexpected end of MessagePack data');\n\t\t\t\t\terror.incomplete = true;\n\t\t\t\t\tthrow error;\n\t\t\t\t}\n\t\t\t\tthrow new Error('Unknown MessagePack token ' + token);\n\n\t\t}\n\t}\n}\nconst validName = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\nfunction createStructureReader(structure, firstId) {\n\tfunction readObject() {\n\t\t// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function\n\t\tif (readObject.count++ > inlineObjectReadThreshold) {\n\t\t\tlet optimizedReadObject;\n\t\t\ttry {\n\t\t\t\toptimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +\n\t\t\t\t\t'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);\n\t\t\t} catch(error) {\n\t\t\t\t// in CF workers, the new Function call could begin to fail at any point in time\n\t\t\t\tinlineObjectReadThreshold = Infinity; // disable going forward\n\t\t\t\treturn readObject(); // recursively try again\n\t\t\t}\n\t\t\tif (structure.highByte === 0)\n\t\t\t\tstructure.read = createSecondByteReader(firstId, structure.read);\n\t\t\treturn optimizedReadObject(); // second byte is already read, if there is one so immediately read object\n\t\t}\n\t\tlet object = {};\n\t\tfor (let i = 0, l = structure.length; i < l; i++) {\n\t\t\tlet key = structure[i];\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\tif (currentUnpackr.freezeData)\n\t\t\treturn Object.freeze(object);\n\t\treturn object;\n\t}\n\treadObject.count = 0;\n\tif (structure.highByte === 0) {\n\t\treturn createSecondByteReader(firstId, readObject);\n\t}\n\treturn readObject;\n}\n\nconst createSecondByteReader = (firstId, read0) => {\n\treturn function() {\n\t\tlet highByte = src[position++];\n\t\tif (highByte === 0)\n\t\t\treturn read0();\n\t\tlet id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);\n\t\tlet structure = currentStructures[id] || loadStructures()[id];\n\t\tif (!structure) {\n\t\t\tthrow new Error('Record id is not defined for ' + id);\n\t\t}\n\t\tif (!structure.read)\n\t\t\tstructure.read = createStructureReader(structure, firstId);\n\t\treturn structure.read();\n\t};\n};\n\nexport function loadStructures() {\n\tlet loadedStructures = saveState(() => {\n\t\t// save the state in case getStructures modifies our buffer\n\t\tsrc = null;\n\t\treturn currentUnpackr.getStructures();\n\t});\n\treturn currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);\n}\n\nvar readFixedString = readStringJS;\nvar readString8 = readStringJS;\nvar readString16 = readStringJS;\nvar readString32 = readStringJS;\nexport let isNativeAccelerationEnabled = false;\n\nexport function setExtractor(extractStrings) {\n\tisNativeAccelerationEnabled = true;\n\treadFixedString = readString(1);\n\treadString8 = readString(2);\n\treadString16 = readString(3);\n\treadString32 = readString(5);\n\tfunction readString(headerLength) {\n\t\treturn function readString(length) {\n\t\t\tlet string = strings[stringPosition++];\n\t\t\tif (string == null) {\n\t\t\t\tif (bundledStrings)\n\t\t\t\t\treturn readStringJS(length);\n\t\t\t\tlet byteOffset = src.byteOffset;\n\t\t\t\tlet extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);\n\t\t\t\tif (typeof extraction == 'string') {\n\t\t\t\t\tstring = extraction;\n\t\t\t\t\tstrings = EMPTY_ARRAY;\n\t\t\t\t} else {\n\t\t\t\t\tstrings = extraction;\n\t\t\t\t\tstringPosition = 1;\n\t\t\t\t\tsrcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings\n\t\t\t\t\tstring = strings[0];\n\t\t\t\t\tif (string === undefined)\n\t\t\t\t\t\tthrow new Error('Unexpected end of buffer');\n\t\t\t\t}\n\t\t\t}\n\t\t\tlet srcStringLength = string.length;\n\t\t\tif (srcStringLength <= length) {\n\t\t\t\tposition += length;\n\t\t\t\treturn string;\n\t\t\t}\n\t\t\tsrcString = string;\n\t\t\tsrcStringStart = position;\n\t\t\tsrcStringEnd = position + srcStringLength;\n\t\t\tposition += length;\n\t\t\treturn string.slice(0, length); // we know we just want the beginning\n\t\t};\n\t}\n}\nfunction readStringJS(length) {\n\tlet result;\n\tif (length < 16) {\n\t\tif (result = shortStringInJS(length))\n\t\t\treturn result;\n\t}\n\tif (length > 64 && decoder)\n\t\treturn decoder.decode(src.subarray(position, position += length));\n\tconst end = position + length;\n\tconst units = [];\n\tresult = '';\n\twhile (position < end) {\n\t\tconst byte1 = src[position++];\n\t\tif ((byte1 & 0x80) === 0) {\n\t\t\t// 1 byte\n\t\t\tunits.push(byte1);\n\t\t} else if ((byte1 & 0xe0) === 0xc0) {\n\t\t\t// 2 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 6) | byte2;\n\t\t\t// Reject overlong encoding: 2-byte sequences must encode values >= 0x80\n\t\t\tif (codePoint < 0x80) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf0) === 0xe0) {\n\t\t\t// 3 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;\n\t\t\t// Reject overlong encoding: 3-byte sequences must encode values >= 0x800\n\t\t\t// Also reject surrogates (0xD800-0xDFFF)\n\t\t\tif (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else {\n\t\t\t\tunits.push(codePoint);\n\t\t\t}\n\t\t} else if ((byte1 & 0xf8) === 0xf0) {\n\t\t\t// 4 bytes\n\t\t\tconst byte2 = src[position++] & 0x3f;\n\t\t\tconst byte3 = src[position++] & 0x3f;\n\t\t\tconst byte4 = src[position++] & 0x3f;\n\t\t\tlet unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;\n\t\t\t// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000\n\t\t\t// Also reject values > 0x10FFFF (maximum valid Unicode)\n\t\t\tif (unit < 0x10000 || unit > 0x10FFFF) {\n\t\t\t\tunits.push(0xFFFD); // replacement character\n\t\t\t} else if (unit > 0xffff) {\n\t\t\t\tunit -= 0x10000;\n\t\t\t\tunits.push(((unit >>> 10) & 0x3ff) | 0xd800);\n\t\t\t\tunit = 0xdc00 | (unit & 0x3ff);\n\t\t\t\tunits.push(unit);\n\t\t\t} else {\n\t\t\t\tunits.push(unit);\n\t\t\t}\n\t\t} else {\n\t\t\tunits.push(0xFFFD); // replacement character for invalid lead byte\n\t\t}\n\n\t\tif (units.length >= 0x1000) {\n\t\t\tresult += fromCharCode.apply(String, units);\n\t\t\tunits.length = 0;\n\t\t}\n\t}\n\n\tif (units.length > 0) {\n\t\tresult += fromCharCode.apply(String, units);\n\t}\n\n\treturn result;\n}\nexport function readString(source, start, length) {\n\tlet existingSrc = src;\n\tsrc = source;\n\tposition = start;\n\ttry {\n\t\treturn readStringJS(length);\n\t} finally {\n\t\tsrc = existingSrc;\n\t}\n}\n\nfunction readArray(length) {\n\tlet array = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tarray[i] = read();\n\t}\n\tif (currentUnpackr.freezeData)\n\t\treturn Object.freeze(array);\n\treturn array;\n}\n\nfunction readMap(length) {\n\tif (currentUnpackr.mapsAsObjects) {\n\t\tlet object = {};\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tlet key = readKey();\n\t\t\tif (key === '__proto__')\n\t\t\t\tkey = '__proto_';\n\t\t\tobject[key] = read();\n\t\t}\n\t\treturn object;\n\t} else {\n\t\tlet map = new Map();\n\t\tfor (let i = 0; i < length; i++) {\n\t\t\tmap.set(read(), read());\n\t\t}\n\t\treturn map;\n\t}\n}\n\nvar fromCharCode = String.fromCharCode;\nfunction longStringInJS(length) {\n\tlet start = position;\n\tlet bytes = new Array(length);\n\tfor (let i = 0; i < length; i++) {\n\t\tconst byte = src[position++];\n\t\tif ((byte & 0x80) > 0) {\n\t\t\t\tposition = start;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tbytes[i] = byte;\n\t\t}\n\t\treturn fromCharCode.apply(String, bytes);\n}\nfunction shortStringInJS(length) {\n\tif (length < 4) {\n\t\tif (length < 2) {\n\t\t\tif (length === 0)\n\t\t\t\treturn '';\n\t\t\telse {\n\t\t\t\tlet a = src[position++];\n\t\t\t\tif ((a & 0x80) > 1) {\n\t\t\t\t\tposition -= 1;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a);\n\t\t\t}\n\t\t} else {\n\t\t\tlet a = src[position++];\n\t\t\tlet b = src[position++];\n\t\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0) {\n\t\t\t\tposition -= 2;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 3)\n\t\t\t\treturn fromCharCode(a, b);\n\t\t\tlet c = src[position++];\n\t\t\tif ((c & 0x80) > 0) {\n\t\t\t\tposition -= 3;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c);\n\t\t}\n\t} else {\n\t\tlet a = src[position++];\n\t\tlet b = src[position++];\n\t\tlet c = src[position++];\n\t\tlet d = src[position++];\n\t\tif ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {\n\t\t\tposition -= 4;\n\t\t\treturn;\n\t\t}\n\t\tif (length < 6) {\n\t\t\tif (length === 4)\n\t\t\t\treturn fromCharCode(a, b, c, d);\n\t\t\telse {\n\t\t\t\tlet e = src[position++];\n\t\t\t\tif ((e & 0x80) > 0) {\n\t\t\t\t\tposition -= 5;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e);\n\t\t\t}\n\t\t} else if (length < 8) {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0) {\n\t\t\t\tposition -= 6;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 7)\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f);\n\t\t\tlet g = src[position++];\n\t\t\tif ((g & 0x80) > 0) {\n\t\t\t\tposition -= 7;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\treturn fromCharCode(a, b, c, d, e, f, g);\n\t\t} else {\n\t\t\tlet e = src[position++];\n\t\t\tlet f = src[position++];\n\t\t\tlet g = src[position++];\n\t\t\tlet h = src[position++];\n\t\t\tif ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {\n\t\t\t\tposition -= 8;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (length < 10) {\n\t\t\t\tif (length === 8)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h);\n\t\t\t\telse {\n\t\t\t\t\tlet i = src[position++];\n\t\t\t\t\tif ((i & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 9;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i);\n\t\t\t\t}\n\t\t\t} else if (length < 12) {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0) {\n\t\t\t\t\tposition -= 10;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 11)\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j);\n\t\t\t\tlet k = src[position++];\n\t\t\t\tif ((k & 0x80) > 0) {\n\t\t\t\t\tposition -= 11;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k);\n\t\t\t} else {\n\t\t\t\tlet i = src[position++];\n\t\t\t\tlet j = src[position++];\n\t\t\t\tlet k = src[position++];\n\t\t\t\tlet l = src[position++];\n\t\t\t\tif ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {\n\t\t\t\t\tposition -= 12;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif (length < 14) {\n\t\t\t\t\tif (length === 12)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);\n\t\t\t\t\telse {\n\t\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\t\tif ((m & 0x80) > 0) {\n\t\t\t\t\t\t\tposition -= 13;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tlet m = src[position++];\n\t\t\t\t\tlet n = src[position++];\n\t\t\t\t\tif ((m & 0x80) > 0 || (n & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 14;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif (length < 15)\n\t\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);\n\t\t\t\t\tlet o = src[position++];\n\t\t\t\t\tif ((o & 0x80) > 0) {\n\t\t\t\t\t\tposition -= 15;\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\treturn fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction readOnlyJSString() {\n\tlet token = src[position++];\n\tlet length;\n\tif (token < 0xc0) {\n\t\t// fixstr\n\t\tlength = token - 0xa0;\n\t} else {\n\t\tswitch(token) {\n\t\t\tcase 0xd9:\n\t\t\t// str 8\n\t\t\t\tlength = src[position++];\n\t\t\t\tbreak;\n\t\t\tcase 0xda:\n\t\t\t// str 16\n\t\t\t\tlength = dataView.getUint16(position);\n\t\t\t\tposition += 2;\n\t\t\t\tbreak;\n\t\t\tcase 0xdb:\n\t\t\t// str 32\n\t\t\t\tlength = dataView.getUint32(position);\n\t\t\t\tposition += 4;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Expected string');\n\t\t}\n\t}\n\treturn readStringJS(length);\n}\n\n\nfunction readBin(length) {\n\treturn currentUnpackr.copyBuffers ?\n\t\t// specifically use the copying slice (not the node one)\n\t\tUint8Array.prototype.slice.call(src, position, position += length) :\n\t\tsrc.subarray(position, position += length);\n}\nfunction readExt(length) {\n\tlet type = src[position++];\n\tif (currentExtensions[type]) {\n\t\tlet end;\n\t\treturn currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {\n\t\t\tposition = readPosition;\n\t\t\ttry {\n\t\t\t\treturn read();\n\t\t\t} finally {\n\t\t\t\tposition = end;\n\t\t\t}\n\t\t});\n\t}\n\telse\n\t\tthrow new Error('Unknown extension type ' + type);\n}\n\nvar keyCache = new Array(4096);\nfunction readKey() {\n\tlet length = src[position++];\n\tif (length >= 0xa0 && length < 0xc0) {\n\t\t// fixstr, potentially use key cache\n\t\tlength = length - 0xa0;\n\t\tif (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)\n\t\t\treturn srcString.slice(position - srcStringStart, (position += length) - srcStringStart);\n\t\telse if (!(srcStringEnd == 0 && srcEnd < 180))\n\t\t\treturn readFixedString(length);\n\t} else { // not cacheable, go back and do a standard read\n\t\tposition--;\n\t\treturn asSafeString(read());\n\t}\n\tlet key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;\n\tlet entry = keyCache[key];\n\tlet checkPosition = position;\n\tlet end = position + length - 3;\n\tlet chunk;\n\tlet i = 0;\n\tif (entry && entry.bytes == length) {\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = dataView.getUint32(checkPosition);\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcheckPosition += 4;\n\t\t}\n\t\tend += 3;\n\t\twhile (checkPosition < end) {\n\t\t\tchunk = src[checkPosition++];\n\t\t\tif (chunk != entry[i++]) {\n\t\t\t\tcheckPosition = 0x70000000;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (checkPosition === end) {\n\t\t\tposition = checkPosition;\n\t\t\treturn entry.string;\n\t\t}\n\t\tend -= 3;\n\t\tcheckPosition = position;\n\t}\n\tentry = [];\n\tkeyCache[key] = entry;\n\tentry.bytes = length;\n\twhile (checkPosition < end) {\n\t\tchunk = dataView.getUint32(checkPosition);\n\t\tentry.push(chunk);\n\t\tcheckPosition += 4;\n\t}\n\tend += 3;\n\twhile (checkPosition < end) {\n\t\tchunk = src[checkPosition++];\n\t\tentry.push(chunk);\n\t}\n\t// for small blocks, avoiding the overhead of the extract call is helpful\n\tlet string = length < 16 ? shortStringInJS(length) : longStringInJS(length);\n\tif (string != null)\n\t\treturn entry.string = string;\n\treturn entry.string = readFixedString(length);\n}\n\nfunction asSafeString(property) {\n\t// protect against expensive (DoS) string conversions\n\tif (typeof property === 'string') return property;\n\tif (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();\n\tif (property == null) return property + '';\n\tif (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {\n\t\treturn property.flat().toString();\n\t}\n\tthrow new Error(`Invalid property type for record: ${typeof property}`);\n}\n// the registration of the record definition extension (as \"r\")\nconst recordDefinition = (id, highByte) => {\n\tlet structure = read().map(asSafeString); // ensure that all keys are strings and\n\t// that the array is mutable\n\tlet firstByte = id;\n\tif (highByte !== undefined) {\n\t\tid = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);\n\t\tstructure.highByte = highByte;\n\t}\n\tlet existingStructure = currentStructures[id];\n\t// If it is a shared structure, we need to restore any changes after reading.\n\t// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore\n\t// to the state prior to an incomplete read in order to properly resume.\n\tif (existingStructure && (existingStructure.isShared || sequentialMode)) {\n\t\t(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;\n\t}\n\tcurrentStructures[id] = structure;\n\tstructure.read = createStructureReader(structure, firstByte);\n\treturn structure.read();\n};\ncurrentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here\ncurrentExtensions[0].noBuffer = true;\n\ncurrentExtensions[0x42] = data => {\n\tlet headLength = (data.byteLength % 8) || 8;\n\tlet head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);\n\tfor (let i = 1; i < headLength; i++) {\n\t\thead <<= BigInt(8);\n\t\thead += BigInt(data[i]);\n\t}\n\tif (data.byteLength !== headLength) {\n\t\tlet view = new DataView(data.buffer, data.byteOffset, data.byteLength);\n\t\tlet decode = (start, end) => {\n\t\t\tlet length = end - start;\n\t\t\tif (length <= 40) {\n\t\t\t\tlet out = view.getBigUint64(start);\n\t\t\t\tfor (let i = start + 8; i < end; i += 8) {\n\t\t\t\t\tout <<= BigInt(64);\n\t\t\t\t\tout |= view.getBigUint64(i);\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// if (length === 8) return view.getBigUint64(start)\n\t\t\tlet middle = start + (length >> 4 << 3);\n\t\t\tlet left = decode(start, middle);\n\t\t\tlet right = decode(middle, end);\n\t\t\treturn (left << BigInt((end - middle) * 8)) | right;\n\t\t};\n\t\thead = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);\n\t}\n\treturn head;\n};\n\nlet errors = {\n\tError, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,\n};\ncurrentExtensions[0x65] = () => {\n\tlet data = read();\n\tif (!errors[data[0]]) {\n\t\tlet error = Error(data[1], { cause: data[2] });\n\t\terror.name = data[0];\n\t\treturn error;\n\t}\n\treturn errors[data[0]](data[1], { cause: data[2] });\n};\n\ncurrentExtensions[0x69] = (data) => {\n\t// id extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tif (!referenceMap)\n\t\treferenceMap = new Map();\n\tlet token = src[position];\n\tlet target;\n\t// TODO: handle any other types that can cycle and make the code more robust if there are other extensions\n\tif (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)\n\t\ttarget = [];\n\telse if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)\n\t\ttarget = new Map();\n\telse if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)\n\t\ttarget = new Set();\n\telse\n\t\ttarget = {};\n\n\tlet refEntry = { target }; // a placeholder object\n\treferenceMap.set(id, refEntry);\n\tlet targetProperties = read(); // read the next value as the target object to id\n\tif (!refEntry.used) {\n\t\t// no cycle, can just use the returned read object\n\t\treturn refEntry.target = targetProperties; // replace the placeholder with the real one\n\t} else {\n\t\t// there is a cycle, so we have to assign properties to original target\n\t\tObject.assign(target, targetProperties);\n\t}\n\n\t// copy over map/set entries if we're able to\n\tif (target instanceof Map)\n\t\tfor (let [k, v] of targetProperties.entries()) target.set(k, v);\n\tif (target instanceof Set)\n\t\tfor (let i of Array.from(targetProperties)) target.add(i);\n\treturn target;\n};\n\ncurrentExtensions[0x70] = (data) => {\n\t// pointer extension (for structured clones)\n\tif (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');\n\tlet id = dataView.getUint32(position - 4);\n\tlet refEntry = referenceMap.get(id);\n\trefEntry.used = true;\n\treturn refEntry.target;\n};\n\ncurrentExtensions[0x73] = () => new Set(read());\n\nexport const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');\n\nlet glbl = typeof globalThis === 'object' ? globalThis : window;\ncurrentExtensions[0x74] = (data) => {\n\tlet typeCode = data[0];\n\t// we always have to slice to get a new ArrayBuffer that is aligned\n\tlet buffer = Uint8Array.prototype.slice.call(data, 1).buffer;\n\n\tlet typedArrayName = typedArrays[typeCode];\n\tif (!typedArrayName) {\n\t\tif (typeCode === 16) return buffer;\n\t\tif (typeCode === 17) return new DataView(buffer);\n\t\tthrow new Error('Could not find typed array for code ' + typeCode);\n\t}\n\treturn new glbl[typedArrayName](buffer);\n};\ncurrentExtensions[0x78] = () => {\n\tlet data = read();\n\treturn new RegExp(data[0], data[1]);\n};\nconst TEMP_BUNDLE = [];\ncurrentExtensions[0x62] = (data) => {\n\tlet dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];\n\tlet dataPosition = position;\n\tposition += dataSize - data.length;\n\tbundledStrings = TEMP_BUNDLE;\n\tbundledStrings = [readOnlyJSString(), readOnlyJSString()];\n\tbundledStrings.position0 = 0;\n\tbundledStrings.position1 = 0;\n\tbundledStrings.postBundlePosition = position;\n\tposition = dataPosition;\n\treturn read();\n};\n\ncurrentExtensions[0xff] = (data) => {\n\t// 32-bit date extension\n\tif (data.length == 4)\n\t\treturn new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);\n\telse if (data.length == 8)\n\t\treturn new Date(\n\t\t\t((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +\n\t\t\t((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);\n\telse if (data.length == 12)\n\t\treturn new Date(\n\t\t\t((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +\n\t\t\t(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);\n\telse\n\t\treturn new Date('invalid');\n};\n// registration of bulk record definition?\n// currentExtensions[0x52] = () =>\n\nfunction saveState(callback) {\n\tif (currentUnpackr && currentUnpackr._onSaveState)\n\t\tcurrentUnpackr._onSaveState();\n\tlet savedSrcEnd = srcEnd;\n\tlet savedPosition = position;\n\tlet savedStringPosition = stringPosition;\n\tlet savedSrcStringStart = srcStringStart;\n\tlet savedSrcStringEnd = srcStringEnd;\n\tlet savedSrcString = srcString;\n\tlet savedStrings = strings;\n\tlet savedReferenceMap = referenceMap;\n\tlet savedBundledStrings = bundledStrings;\n\n\t// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)\n\tlet savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed\n\tlet savedStructures = currentStructures;\n\tlet savedStructuresContents = currentStructures.slice(0, currentStructures.length);\n\tlet savedPackr = currentUnpackr;\n\tlet savedSequentialMode = sequentialMode;\n\tlet value = callback();\n\tsrcEnd = savedSrcEnd;\n\tposition = savedPosition;\n\tstringPosition = savedStringPosition;\n\tsrcStringStart = savedSrcStringStart;\n\tsrcStringEnd = savedSrcStringEnd;\n\tsrcString = savedSrcString;\n\tstrings = savedStrings;\n\treferenceMap = savedReferenceMap;\n\tbundledStrings = savedBundledStrings;\n\tsrc = savedSrc;\n\tsequentialMode = savedSequentialMode;\n\tcurrentStructures = savedStructures;\n\tcurrentStructures.splice(0, currentStructures.length, ...savedStructuresContents);\n\tcurrentUnpackr = savedPackr;\n\tdataView = new DataView(src.buffer, src.byteOffset, src.byteLength);\n\treturn value;\n}\nexport function clearSource() {\n\tsrc = null;\n\treferenceMap = null;\n\tcurrentStructures = null;\n}\n\nexport function addExtension(extension) {\n\tif (extension.unpack)\n\t\tcurrentExtensions[extension.type] = extension.unpack;\n\telse\n\t\tcurrentExtensions[extension.type] = extension;\n}\n\nexport const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding\nfor (let i = 0; i < 256; i++) {\n\tmult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));\n}\nexport const Decoder = Unpackr;\nvar defaultUnpackr = new Unpackr({ useRecords: false });\nexport const unpack = defaultUnpackr.unpack;\nexport const unpackMultiple = defaultUnpackr.unpackMultiple;\nexport const decode = defaultUnpackr.unpack;\nexport const FLOAT32_OPTIONS = {\n\tNEVER: 0,\n\tALWAYS: 1,\n\tDECIMAL_ROUND: 3,\n\tDECIMAL_FIT: 4\n};\nlet f32Array = new Float32Array(1);\nlet u8Array = new Uint8Array(f32Array.buffer, 0, 4);\nexport function roundFloat32(float32Number) {\n\tf32Array[0] = float32Number;\n\tlet multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];\n\treturn ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;\n}\n// Marker for downstream libraries (e.g. structon) to detect per-instance\n// struct-decoding hooks (this._readStruct, this._onLoadedStructures,\n// this._onSaveState).  See `checkedRead` for the dispatch.\nUnpackr.SUPPORTS_STRUCT_HOOKS = true;\n"],"names":["isNativeAccelerationEnabled"],"mappings":";;;;;;CAAA,IAAI,OAAO,CAAC;CACZ,IAAI;CACJ,CAAC,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;CAC7B,CAAC,CAAC,MAAM,KAAK,EAAE,EAAE;CACjB,IAAI,GAAG,CAAC;CACR,IAAI,MAAM,CAAC;CACX,IAAI,QAAQ,GAAG,CAAC,CAAC;CAEjB,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,IAAI,OAAO,GAAG,WAAW,CAAC;CAC1B,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,cAAc,GAAG,EAAE,CAAC;CACxB,IAAI,iBAAiB,CAAC;CACtB,IAAI,SAAS,CAAC;CACd,IAAI,cAAc,GAAG,CAAC,CAAC;CACvB,IAAI,YAAY,GAAG,CAAC,CAAC;CACrB,IAAI,cAAc,CAAC;CACnB,IAAI,YAAY,CAAC;CACjB,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI,QAAQ,CAAC;CACb,IAAI,cAAc,GAAG;CACrB,CAAC,UAAU,EAAE,KAAK;CAClB,CAAC,aAAa,EAAE,IAAI;CACpB,CAAC,CAAC;CACK,MAAM,MAAM,CAAC,EAAE;AACV,OAAC,EAAE,GAAG,IAAI,MAAM,GAAG;CAC/B,EAAE,CAAC,IAAI,GAAG,kBAAkB,CAAC;CAC7B,IAAI,cAAc,GAAG,KAAK,CAAC;CAC3B,IAAI,yBAAyB,GAAG,CAAC,CAAC;CAClC,IAAI,eAAe,CAAC;AACpB;CACO,MAAM,OAAO,CAAC;CACrB,CAAC,WAAW,CAAC,OAAO,EAAE;CACtB,EAAE,IAAI,OAAO,EAAE;CACf,GAAG,IAAI,OAAO,CAAC,UAAU,KAAK,KAAK,IAAI,OAAO,CAAC,aAAa,KAAK,SAAS;CAC1E,IAAI,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;CACjC,GAAG,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE;CACxD,IAAI,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;CAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,IAAI,KAAK,EAAE;CAC5D,KAAK,OAAO,CAAC,UAAU,GAAG,EAAE,CAAC;CAC7B,KAAK,IAAI,CAAC,OAAO,CAAC,mBAAmB;CACrC,MAAM,OAAO,CAAC,mBAAmB,GAAG,CAAC,CAAC;CACtC,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,UAAU;CACzB,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC;CAChE,QAAQ,IAAI,OAAO,CAAC,aAAa,EAAE;CACnC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,CAAC;CACnD,IAAI,OAAO,CAAC,UAAU,CAAC,YAAY,GAAG,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG,IAAI,OAAO,CAAC,aAAa,EAAE;CAC9B,IAAI,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC;CACnC,IAAI;CACJ,GAAG;CACH,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;CAC/B,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,IAAI,GAAG,EAAE;CACX;CACA,GAAG,OAAO,SAAS,CAAC,MAAM;CAC1B,IAAI,WAAW,EAAE,CAAC;CAClB,IAAI,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;CAChH,IAAI,CAAC,CAAC;CACN,GAAG;CACH,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW;CAC1D,GAAG,MAAM,GAAG,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;CACzF,EAAE,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;CACnC,GAAG,MAAM,GAAG,OAAO,CAAC,GAAG,IAAI,MAAM,CAAC,MAAM,CAAC;CACzC,GAAG,QAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;CACjC,GAAG,MAAM;CACT,GAAG,QAAQ,GAAG,CAAC,CAAC;CAChB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;CACnD,GAAG;CACH,EAAE,cAAc,GAAG,CAAC,CAAC;CACrB,EAAE,YAAY,GAAG,CAAC,CAAC;CACnB,EAAE,SAAS,GAAG,IAAI,CAAC;CACnB,EAAE,OAAO,GAAG,WAAW,CAAC;CACxB,EAAE,cAAc,GAAG,IAAI,CAAC;CACxB,EAAE,GAAG,GAAG,MAAM,CAAC;CACf;CACA;CACA;CACA,EAAE,IAAI;CACN,GAAG,QAAQ,GAAG,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;CACvH,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB;CACA,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,MAAM,YAAY,UAAU;CACnC,IAAI,MAAM,KAAK,CAAC;CAChB,GAAG,MAAM,IAAI,KAAK,CAAC,kDAAkD,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,OAAO,MAAM,CAAC,CAAC,CAAC;CAC3J,GAAG;CACH,EAAE,IAAI,IAAI,YAAY,OAAO,EAAE;CAC/B,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,CAAC,UAAU,EAAE;CACxB,IAAI,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC;CACxC,IAAI,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAChC,IAAI,MAAM,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE;CAClE,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,cAAc,GAAG,cAAc,CAAC;CACnC,GAAG,IAAI,CAAC,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;CACzD,IAAI,iBAAiB,GAAG,EAAE,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,EAAE;CACjC,EAAE,IAAI,MAAM,EAAE,YAAY,GAAG,CAAC,CAAC;CAC/B,EAAE,IAAI;CACN,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;CAC5B,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;CACtF,GAAG,IAAI,OAAO,EAAE;CAChB,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,CAAC,KAAK,KAAK,EAAE,OAAO;CACjE,IAAI,MAAM,QAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAG,QAAQ,CAAC;CAC7B,KAAK,IAAI,OAAO,CAAC,WAAW,EAAE,EAAE,YAAY,EAAE,QAAQ,CAAC,KAAK,KAAK,EAAE;CACnE,MAAM,OAAO;CACb,MAAM;CACN,KAAK;CACL,IAAI;CACJ,QAAQ;CACR,IAAI,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC;CACvB,IAAI,MAAM,QAAQ,GAAG,IAAI,EAAE;CAC3B,KAAK,YAAY,GAAG,QAAQ,CAAC;CAC7B,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;CAChC,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,CAAC,MAAM,KAAK,EAAE;CACjB,GAAG,KAAK,CAAC,YAAY,GAAG,YAAY,CAAC;CACrC,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CACzB,GAAG,MAAM,KAAK,CAAC;CACf,GAAG,SAAS;CACZ,GAAG,cAAc,GAAG,KAAK,CAAC;CAC1B,GAAG,WAAW,EAAE,CAAC;CACjB,GAAG;CACH,EAAE;CACF,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,kBAAkB,EAAE;CACxD,EAAE,IAAI,IAAI,CAAC,mBAAmB;CAC9B,GAAG,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,gBAAgB,CAAC,CAAC;CACjE,EAAE,gBAAgB,GAAG,gBAAgB,IAAI,EAAE,CAAC;CAC5C,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC;CACvC,GAAG,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;CAC5E,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CAC3D,GAAG,IAAI,SAAS,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;CACvC,GAAG,IAAI,SAAS,EAAE;CAClB,IAAI,SAAS,CAAC,QAAQ,GAAG,IAAI,CAAC;CAC9B,IAAI,IAAI,CAAC,IAAI,EAAE;CACf,KAAK,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;CACxC,IAAI;CACJ,GAAG;CACH,EAAE,gBAAgB,CAAC,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC;CAC1D,EAAE,KAAK,IAAI,EAAE,IAAI,kBAAkB,IAAI,EAAE,EAAE;CAC3C,GAAG,IAAI,EAAE,IAAI,CAAC,EAAE;CAChB,IAAI,IAAI,SAAS,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;CACzC,IAAI,IAAI,QAAQ,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAC;CAC1C,IAAI,IAAI,QAAQ,EAAE;CAClB,KAAK,IAAI,SAAS;CAClB,MAAM,CAAC,gBAAgB,CAAC,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC;CACxG,KAAK,gBAAgB,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC;CACrC,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE,OAAO,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;CAC5C,EAAE;CACF,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE;CACzB,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACtC,EAAE;CACF,CAAC;CACM,SAAS,WAAW,GAAG;CAC9B,CAAC,OAAO,QAAQ,CAAC;CACjB,CAAC;CACM,SAAS,WAAW,CAAC,OAAO,EAAE;CACrC,CAAC,IAAI;CACL,EAAE,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,CAAC,cAAc,EAAE;CAClD,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,YAAY,IAAI,CAAC,CAAC;CAC1D,GAAG,IAAI,YAAY,GAAG,iBAAiB,CAAC,MAAM;CAC9C,IAAI,iBAAiB,CAAC,MAAM,GAAG,YAAY,CAAC;CAC5C,GAAG;CACH,EAAE,IAAI,MAAM,CAAC;CACb,EAAE,IAAI,cAAc,CAAC,WAAW,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE;CACnF,GAAG,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;CAC9D,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,MAAM;CAC3C,IAAI,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;CAC7B,GAAG,QAAQ,GAAG,MAAM,CAAC;CACrB,GAAG;CACH,GAAG,MAAM,GAAG,IAAI,EAAE,CAAC;CACnB,EAAE,IAAI,cAAc,EAAE;CACtB,GAAG,QAAQ,GAAG,cAAc,CAAC,kBAAkB,CAAC;CAChD,GAAG,cAAc,GAAG,IAAI,CAAC;CACzB,GAAG;CACH,EAAE,IAAI,cAAc;CACpB;CACA;CACA,GAAG,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;AAC9C;CACA,EAAE,IAAI,QAAQ,IAAI,MAAM,EAAE;CAC1B;CACA,GAAG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC/D,IAAI,iBAAiB,EAAE,CAAC;CACxB,GAAG,iBAAiB,GAAG,IAAI,CAAC;CAC5B,GAAG,GAAG,GAAG,IAAI,CAAC;CACd,GAAG,IAAI,YAAY;CACnB,IAAI,YAAY,GAAG,IAAI,CAAC;CACxB,GAAG,MAAM,IAAI,QAAQ,GAAG,MAAM,EAAE;CAChC;CACA,GAAG,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACzD,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE;CAC9B,GAAG,IAAI,QAAQ,CAAC;CAChB,GAAG,IAAI;CACP,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,KAAK,OAAO,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;CACnH,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB,IAAI,QAAQ,GAAG,2BAA2B,GAAG,KAAK,GAAG,GAAG,CAAC;CACzD,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,CAAC,2CAA2C,GAAG,QAAQ,CAAC,CAAC;CAC3E,GAAG;CACH;CACA,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,CAAC,MAAM,KAAK,EAAE;CAChB,EAAE,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,iBAAiB;CAC9D,GAAG,iBAAiB,EAAE,CAAC;CACvB,EAAE,WAAW,EAAE,CAAC;CAChB,EAAE,IAAI,KAAK,YAAY,UAAU,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,0BAA0B,CAAC,IAAI,QAAQ,GAAG,MAAM,EAAE;CAChH,GAAG,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC3B,GAAG;CACH,EAAE,MAAM,KAAK,CAAC;CACd,EAAE;CACF,CAAC;AACD;CACA,SAAS,iBAAiB,GAAG;CAC7B,CAAC,KAAK,IAAI,EAAE,IAAI,iBAAiB,CAAC,iBAAiB,EAAE;CACrD,EAAE,iBAAiB,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAClE,EAAE;CACF,CAAC,iBAAiB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC5C,CAAC;AACD;CACO,SAAS,IAAI,GAAG;CACvB,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB,EAAE,IAAI,KAAK,GAAG,IAAI,EAAE;CACpB,GAAG,IAAI,KAAK,GAAG,IAAI;CACnB,IAAI,OAAO,KAAK,CAAC;CACjB,QAAQ;CACR,IAAI,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,GAAG,IAAI,CAAC;CACnD,KAAK,cAAc,CAAC,aAAa,IAAI,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC;CACpE,IAAI,IAAI,SAAS,EAAE;CACnB,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE;CAC1B,MAAM,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;CACtE,MAAM;CACN,KAAK,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC7B,KAAK;CACL,KAAK,OAAO,KAAK,CAAC;CAClB,IAAI;CACJ,GAAG,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC3B;CACA,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,cAAc,CAAC,aAAa,EAAE;CACrC,IAAI,IAAI,MAAM,GAAG,EAAE,CAAC;CACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACzB,KAAK,IAAI,GAAG,KAAK,WAAW;CAC5B,MAAM,GAAG,GAAG,UAAU,CAAC;CACvB,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CAC1B,KAAK;CACL,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI,MAAM;CACV,IAAI,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACxB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACpC,KAAK,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC7B,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,IAAI,IAAI,CAAC;CACjB,GAAG,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;CACnC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACtB,IAAI;CACJ,GAAG,IAAI,cAAc,CAAC,UAAU;CAChC,IAAI,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAChC,GAAG,OAAO,KAAK,CAAC;CAChB,GAAG;CACH,EAAE,MAAM,IAAI,KAAK,GAAG,IAAI,EAAE;CAC1B;CACA,EAAE,IAAI,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CAC5B,EAAE,IAAI,YAAY,IAAI,QAAQ,EAAE;CAChC,GAAG,OAAO,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC,QAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,GAAG;CACH,EAAE,IAAI,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,EAAE;CACzC;CACA,GAAG,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC/E,GAAG,IAAI,MAAM,IAAI,IAAI;CACrB,IAAI,OAAO,MAAM,CAAC;CAClB,GAAG;CACH,EAAE,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CACjC,EAAE,MAAM;CACR,EAAE,IAAI,KAAK,CAAC;CACZ,EAAE,QAAQ,KAAK;CACf,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,EAAE;CACxB,KAAK,KAAK,GAAG,IAAI,EAAE,CAAC;CACpB,KAAK,IAAI,KAAK,GAAG,CAAC;CAClB,MAAM,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG;CACA,MAAM,OAAO,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,CAAC,SAAS,IAAI,KAAK,CAAC,CAAC;CAClG,KAAK;CACL,IAAI,OAAO,EAAE,CAAC;CACd,GAAG,KAAK,IAAI,EAAE,OAAO,KAAK,CAAC;CAC3B,GAAG,KAAK,IAAI,EAAE,OAAO,IAAI,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,KAAK,SAAS;CAC3B,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CACjD,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;CACpC,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;CAC1C,IAAI,IAAI,cAAc,CAAC,UAAU,GAAG,CAAC,EAAE;CACvC;CACA,KAAK,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACvF,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO,CAAC,CAAC,UAAU,GAAG,KAAK,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAChF,KAAK;CACL,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;CAC1C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;CACxD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACxD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;CAC7C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC3D,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;CAC7C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA;CACA,GAAG,KAAK,IAAI;CACZ,IAAI,OAAO,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;CACxC,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;CACxC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;CACxC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;CACjB,GAAG,KAAK,IAAI;CACZ,IAAI,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACjD,KAAK,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;CACvD,KAAK,KAAK,IAAI,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;CAC/C,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,QAAQ,EAAE;CACxD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;CACvD,KAAK,MAAM,IAAI,cAAc,CAAC,WAAW,KAAK,MAAM,EAAE;CACtD,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,KAAK,IAAI,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC1F,KAAK;CACL,KAAK,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,KAAK,CAAC;AACjB;CACA,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;CACrD,KAAK,MAAM;CACX,KAAK,IAAI,SAAS,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;CAC9C,KAAK,IAAI,SAAS,EAAE;CACpB,MAAM,IAAI,SAAS,CAAC,IAAI,EAAE;CAC1B,OAAO,QAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CACrC,OAAO,MAAM,IAAI,SAAS,CAAC,QAAQ,EAAE;CACrC,OAAO,QAAQ,EAAE,CAAC;CAClB,OAAO,OAAO,SAAS,EAAE,CAAC;CAC1B,OAAO;CACP,OAAO,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;CAC5D,MAAM;CACN,MAAM,MAAM,IAAI,KAAK,CAAC,oBAAoB,GAAG,KAAK,CAAC,CAAC;CACpD,KAAK;CACL,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;CAC1B,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE;CACvB,KAAK,QAAQ,EAAE,CAAC;CAChB,KAAK,OAAO,gBAAgB,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,KAAK,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;CACtB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,OAAO,OAAO,CAAC,EAAE,CAAC,CAAC;CACvB,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,YAAY,IAAI,QAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC,QAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC;CAC9B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAI,QAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC,QAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,IAAI,YAAY,IAAI,QAAQ,EAAE;CAClC,KAAK,OAAO,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC,QAAQ,IAAI,KAAK,IAAI,cAAc,CAAC,CAAC;CAC7F,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;CAC/B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC;CAC5B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;CAC1B,GAAG;CACH,IAAI,IAAI,KAAK,IAAI,IAAI;CACrB,KAAK,OAAO,KAAK,GAAG,KAAK,CAAC;CAC1B,IAAI,IAAI,KAAK,KAAK,SAAS,EAAE;CAC7B,KAAK,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;CACjE,KAAK,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC;CAC7B,KAAK,MAAM,KAAK,CAAC;CACjB,KAAK;CACL,IAAI,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,KAAK,CAAC,CAAC;AAC1D;CACA,GAAG;CACH,EAAE;CACF,CAAC;CACD,MAAM,SAAS,GAAG,2BAA2B,CAAC;CAC9C,SAAS,qBAAqB,CAAC,SAAS,EAAE,OAAO,EAAE;CACnD,CAAC,SAAS,UAAU,GAAG;CACvB;CACA,EAAE,IAAI,UAAU,CAAC,KAAK,EAAE,GAAG,yBAAyB,EAAE;CACtD,GAAG,IAAI,mBAAmB,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,mBAAmB,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,IAAI,eAAQ,EAAC,GAAG,EAAE,2BAA2B,IAAI,cAAc,CAAC,UAAU,GAAG,eAAe,GAAG,EAAE,CAAC;CAC9I,KAAK,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,WAAW,GAAG,cAAc,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;CAC9K,IAAI,CAAC,MAAM,KAAK,EAAE;CAClB;CACA,IAAI,yBAAyB,GAAG,QAAQ,CAAC;CACzC,IAAI,OAAO,UAAU,EAAE,CAAC;CACxB,IAAI;CACJ,GAAG,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC;CAC/B,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;CACrE,GAAG,OAAO,mBAAmB,EAAE,CAAC;CAChC,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;CACpD,GAAG,IAAI,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;CAC1B,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,IAAI,cAAc,CAAC,UAAU;CAC/B,GAAG,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;CAChC,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE;CACF,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC;CACtB,CAAC,IAAI,SAAS,CAAC,QAAQ,KAAK,CAAC,EAAE;CAC/B,EAAE,OAAO,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;CACrD,EAAE;CACF,CAAC,OAAO,UAAU,CAAC;CACnB,CAAC;AACD;CACA,MAAM,sBAAsB,GAAG,CAAC,OAAO,EAAE,KAAK,KAAK;CACnD,CAAC,OAAO,WAAW;CACnB,EAAE,IAAI,QAAQ,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CACjC,EAAE,IAAI,QAAQ,KAAK,CAAC;CACpB,GAAG,OAAO,KAAK,EAAE,CAAC;CAClB,EAAE,IAAI,EAAE,GAAG,OAAO,GAAG,EAAE,GAAG,EAAE,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,IAAI,QAAQ,IAAI,CAAC,CAAC,CAAC;CACnF,EAAE,IAAI,SAAS,GAAG,iBAAiB,CAAC,EAAE,CAAC,IAAI,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;CAChE,EAAE,IAAI,CAAC,SAAS,EAAE;CAClB,GAAG,MAAM,IAAI,KAAK,CAAC,+BAA+B,GAAG,EAAE,CAAC,CAAC;CACzD,GAAG;CACH,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI;CACrB,GAAG,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;CAC9D,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CAC1B,EAAE,CAAC;CACH,CAAC,CAAC;AACF;CACO,SAAS,cAAc,GAAG;CACjC,CAAC,IAAI,gBAAgB,GAAG,SAAS,CAAC,MAAM;CACxC;CACA,EAAE,GAAG,GAAG,IAAI,CAAC;CACb,EAAE,OAAO,cAAc,CAAC,aAAa,EAAE,CAAC;CACxC,EAAE,CAAC,CAAC;CACJ,CAAC,OAAO,iBAAiB,GAAG,cAAc,CAAC,gBAAgB,CAAC,gBAAgB,EAAE,iBAAiB,CAAC,CAAC;CACjG,CAAC;AACD;CACA,IAAI,eAAe,GAAG,YAAY,CAAC;CACnC,IAAI,WAAW,GAAG,YAAY,CAAC;CAC/B,IAAI,YAAY,GAAG,YAAY,CAAC;CAChC,IAAI,YAAY,GAAG,YAAY,CAAC;AACrBA,oCAA2B,GAAG,MAAM;AAC/C;CACO,SAAS,YAAY,CAAC,cAAc,EAAE;CAC7C,CAACA,mCAA2B,GAAG,IAAI,CAAC;CACpC,CAAC,eAAe,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CACjC,CAAC,WAAW,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC7B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;CAC9B,CAAC,SAAS,UAAU,CAAC,YAAY,EAAE;CACnC,EAAE,OAAO,SAAS,UAAU,CAAC,MAAM,EAAE;CACrC,GAAG,IAAI,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;CAC1C,GAAG,IAAI,MAAM,IAAI,IAAI,EAAE;CACvB,IAAI,IAAI,cAAc;CACtB,KAAK,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CACjC,IAAI,IAAI,UAAU,GAAG,GAAG,CAAC,UAAU,CAAC;CACpC,IAAI,IAAI,UAAU,GAAG,cAAc,CAAC,QAAQ,GAAG,YAAY,GAAG,UAAU,EAAE,MAAM,GAAG,UAAU,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC3G,IAAI,IAAI,OAAO,UAAU,IAAI,QAAQ,EAAE;CACvC,KAAK,MAAM,GAAG,UAAU,CAAC;CACzB,KAAK,OAAO,GAAG,WAAW,CAAC;CAC3B,KAAK,MAAM;CACX,KAAK,OAAO,GAAG,UAAU,CAAC;CAC1B,KAAK,cAAc,GAAG,CAAC,CAAC;CACxB,KAAK,YAAY,GAAG,CAAC,CAAC;CACtB,KAAK,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;CACzB,KAAK,IAAI,MAAM,KAAK,SAAS;CAC7B,MAAM,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;CAClD,KAAK;CACL,IAAI;CACJ,GAAG,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,CAAC;CACvC,GAAG,IAAI,eAAe,IAAI,MAAM,EAAE;CAClC,IAAI,QAAQ,IAAI,MAAM,CAAC;CACvB,IAAI,OAAO,MAAM,CAAC;CAClB,IAAI;CACJ,GAAG,SAAS,GAAG,MAAM,CAAC;CACtB,GAAG,cAAc,GAAG,QAAQ,CAAC;CAC7B,GAAG,YAAY,GAAG,QAAQ,GAAG,eAAe,CAAC;CAC7C,GAAG,QAAQ,IAAI,MAAM,CAAC;CACtB,GAAG,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;CAClC,GAAG,CAAC;CACJ,EAAE;CACF,CAAC;CACD,SAAS,YAAY,CAAC,MAAM,EAAE;CAC9B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,MAAM,GAAG,EAAE,EAAE;CAClB,EAAE,IAAI,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;CACtC,GAAG,OAAO,MAAM,CAAC;CACjB,EAAE;CACF,CAAC,IAAI,MAAM,GAAG,EAAE,IAAI,OAAO;CAC3B,EAAE,OAAO,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC;CACpE,CAAC,MAAM,GAAG,GAAG,QAAQ,GAAG,MAAM,CAAC;CAC/B,CAAC,MAAM,KAAK,GAAG,EAAE,CAAC;CAClB,CAAC,MAAM,GAAG,EAAE,CAAC;CACb,CAAC,OAAO,QAAQ,GAAG,GAAG,EAAE;CACxB,EAAE,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAChC,EAAE,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE;CAC5B;CACA,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACrB,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;CACnD;CACA,GAAG,IAAI,SAAS,GAAG,IAAI,EAAE;CACzB,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC;CACnE;CACA;CACA,GAAG,IAAI,SAAS,GAAG,KAAK,KAAK,SAAS,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM,CAAC,EAAE;CAC1E,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;CAC1B,IAAI;CACJ,GAAG,MAAM,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE;CACtC;CACA,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC;CACxC,GAAG,IAAI,IAAI,GAAG,CAAC,CAAC,KAAK,GAAG,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,KAAK,CAAC;CACnF;CACA;CACA,GAAG,IAAI,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,QAAQ,EAAE;CAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACvB,IAAI,MAAM,IAAI,IAAI,GAAG,MAAM,EAAE;CAC7B,IAAI,IAAI,IAAI,OAAO,CAAC;CACpB,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,KAAK,IAAI,MAAM,CAAC,CAAC;CACjD,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;CACnC,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI,MAAM;CACV,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;CACrB,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CACtB,GAAG;AACH;CACA,EAAE,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,EAAE;CAC9B,GAAG,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC/C,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;CACpB,GAAG;CACH,EAAE;AACF;CACA,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;CACvB,EAAE,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC9C,EAAE;AACF;CACA,CAAC,OAAO,MAAM,CAAC;CACf,CAAC;CACM,SAAS,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE;CAClD,CAAC,IAAI,WAAW,GAAG,GAAG,CAAC;CACvB,CAAC,GAAG,GAAG,MAAM,CAAC;CACd,CAAC,QAAQ,GAAG,KAAK,CAAC;CAClB,CAAC,IAAI;CACL,EAAE,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CAC9B,EAAE,SAAS;CACX,EAAE,GAAG,GAAG,WAAW,CAAC;CACpB,EAAE;CACF,CAAC;AACD;CACA,SAAS,SAAS,CAAC,MAAM,EAAE;CAC3B,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;CACpB,EAAE;CACF,CAAC,IAAI,cAAc,CAAC,UAAU;CAC9B,EAAE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;CAC9B,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;AACD;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,cAAc,CAAC,aAAa,EAAE;CACnC,EAAE,IAAI,MAAM,GAAG,EAAE,CAAC;CAClB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;CACvB,GAAG,IAAI,GAAG,KAAK,WAAW;CAC1B,IAAI,GAAG,GAAG,UAAU,CAAC;CACrB,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC;CACxB,GAAG;CACH,EAAE,OAAO,MAAM,CAAC;CAChB,EAAE,MAAM;CACR,EAAE,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;CACtB,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CACnC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;CAC3B,GAAG;CACH,EAAE,OAAO,GAAG,CAAC;CACb,EAAE;CACF,CAAC;AACD;CACA,IAAI,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC;CACvC,SAAS,cAAc,CAAC,MAAM,EAAE;CAChC,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC;CACtB,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;CAC/B,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;CAClC,EAAE,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC/B,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,IAAI,QAAQ,GAAG,KAAK,CAAC;CACrB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;CACnB,GAAG;CACH,EAAE,OAAO,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;CAC3C,CAAC;CACD,SAAS,eAAe,CAAC,MAAM,EAAE;CACjC,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;CACjB,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,EAAE,CAAC;CACd,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,CAAC,CAAC;CAC3B,IAAI;CACJ,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAChC,GAAG;CACH,EAAE,MAAM;CACR,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC1B,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC5E,GAAG,QAAQ,IAAI,CAAC,CAAC;CACjB,GAAG,OAAO;CACV,GAAG;CACH,EAAE,IAAI,MAAM,GAAG,CAAC,EAAE;CAClB,GAAG,IAAI,MAAM,KAAK,CAAC;CACnB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpC,QAAQ;CACR,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,IAAI;CACJ,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,EAAE;CACzB,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzC,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,CAAC;CACjB,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC1C,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACvB,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5C,GAAG,MAAM;CACT,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC3B,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC7E,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,OAAO;CACX,IAAI;CACJ,GAAG,IAAI,MAAM,GAAG,EAAE,EAAE;CACpB,IAAI,IAAI,MAAM,KAAK,CAAC;CACpB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjD,SAAS;CACT,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAM,QAAQ,IAAI,CAAC,CAAC;CACpB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpD,KAAK;CACL,IAAI,MAAM,IAAI,MAAM,GAAG,EAAE,EAAE;CAC3B,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1C,KAAK,QAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE;CACnB,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvD,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACxB,KAAK,QAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACzD,IAAI,MAAM;CACV,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC9E,KAAK,QAAQ,IAAI,EAAE,CAAC;CACpB,KAAK,OAAO;CACZ,KAAK;CACL,IAAI,IAAI,MAAM,GAAG,EAAE,EAAE;CACrB,KAAK,IAAI,MAAM,KAAK,EAAE;CACtB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC9D,UAAU;CACV,MAAM,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC9B,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC1B,OAAO,QAAQ,IAAI,EAAE,CAAC;CACtB,OAAO,OAAO;CACd,OAAO;CACP,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACjE,MAAM;CACN,KAAK,MAAM;CACX,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CAC3C,MAAM,QAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,IAAI,MAAM,GAAG,EAAE;CACpB,MAAM,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACpE,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE;CACzB,MAAM,QAAQ,IAAI,EAAE,CAAC;CACrB,MAAM,OAAO;CACb,MAAM;CACN,KAAK,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACtE,KAAK;CACL,IAAI;CACJ,GAAG;CACH,EAAE;CACF,CAAC;AACD;CACA,SAAS,gBAAgB,GAAG;CAC5B,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,CAAC,IAAI,MAAM,CAAC;CACZ,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE;CACnB;CACA,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;CACxB,EAAE,MAAM;CACR,EAAE,OAAO,KAAK;CACd,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CAC1C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG,KAAK,IAAI;CACZ;CACA,IAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;CAC1C,IAAI,QAAQ,IAAI,CAAC,CAAC;CAClB,IAAI,MAAM;CACV,GAAG;CACH,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;CACvC,GAAG;CACH,EAAE;CACF,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC;CAC7B,CAAC;AACD;AACA;CACA,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,OAAO,cAAc,CAAC,WAAW;CAClC;CACA,EAAE,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,IAAI,MAAM,CAAC;CACpE,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,IAAI,MAAM,CAAC,CAAC;CAC7C,CAAC;CACD,SAAS,OAAO,CAAC,MAAM,EAAE;CACzB,CAAC,IAAI,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC5B,CAAC,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE;CAC9B,EAAE,IAAI,GAAG,CAAC;CACV,EAAE,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,IAAI,QAAQ,IAAI,MAAM,CAAC,CAAC,EAAE,CAAC,YAAY,KAAK;CACvG,GAAG,QAAQ,GAAG,YAAY,CAAC;CAC3B,GAAG,IAAI;CACP,IAAI,OAAO,IAAI,EAAE,CAAC;CAClB,IAAI,SAAS;CACb,IAAI,QAAQ,GAAG,GAAG,CAAC;CACnB,IAAI;CACJ,GAAG,CAAC,CAAC;CACL,EAAE;CACF;CACA,EAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,IAAI,CAAC,CAAC;CACpD,CAAC;AACD;CACA,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;CAC/B,SAAS,OAAO,GAAG;CACnB,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC9B,CAAC,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,EAAE;CACtC;CACA,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACzB,EAAE,IAAI,YAAY,IAAI,QAAQ;CAC9B,GAAG,OAAO,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,cAAc,EAAE,CAAC,QAAQ,IAAI,MAAM,IAAI,cAAc,CAAC,CAAC;CAC5F,OAAO,IAAI,EAAE,YAAY,IAAI,CAAC,IAAI,MAAM,GAAG,GAAG,CAAC;CAC/C,GAAG,OAAO,eAAe,CAAC,MAAM,CAAC,CAAC;CAClC,EAAE,MAAM;CACR,EAAE,QAAQ,EAAE,CAAC;CACb,EAAE,OAAO,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;CAC9B,EAAE;CACF,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC;CAClH,CAAC,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;CAC3B,CAAC,IAAI,aAAa,GAAG,QAAQ,CAAC;CAC9B,CAAC,IAAI,GAAG,GAAG,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC;CACjC,CAAC,IAAI,KAAK,CAAC;CACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;CACX,CAAC,IAAI,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,EAAE;CACrC,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC7C,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG,aAAa,IAAI,CAAC,CAAC;CACtB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,OAAO,aAAa,GAAG,GAAG,EAAE;CAC9B,GAAG,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAChC,GAAG,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE;CAC5B,IAAI,aAAa,GAAG,UAAU,CAAC;CAC/B,IAAI,MAAM;CACV,IAAI;CACJ,GAAG;CACH,EAAE,IAAI,aAAa,KAAK,GAAG,EAAE;CAC7B,GAAG,QAAQ,GAAG,aAAa,CAAC;CAC5B,GAAG,OAAO,KAAK,CAAC,MAAM,CAAC;CACvB,GAAG;CACH,EAAE,GAAG,IAAI,CAAC,CAAC;CACX,EAAE,aAAa,GAAG,QAAQ,CAAC;CAC3B,EAAE;CACF,CAAC,KAAK,GAAG,EAAE,CAAC;CACZ,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;CACvB,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,CAAC;CACtB,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;CAC5C,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE,aAAa,IAAI,CAAC,CAAC;CACrB,EAAE;CACF,CAAC,GAAG,IAAI,CAAC,CAAC;CACV,CAAC,OAAO,aAAa,GAAG,GAAG,EAAE;CAC7B,EAAE,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC;CAC/B,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;CACpB,EAAE;CACF;CACA,CAAC,IAAI,MAAM,GAAG,MAAM,GAAG,EAAE,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;CAC7E,CAAC,IAAI,MAAM,IAAI,IAAI;CACnB,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;CAC/B,CAAC,OAAO,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;CAC/C,CAAC;AACD;CACA,SAAS,YAAY,CAAC,QAAQ,EAAE;CAChC;CACA,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC;CACnD,CAAC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,SAAS,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE,OAAO,QAAQ,CAAC,QAAQ,EAAE,CAAC;CAC/H,CAAC,IAAI,QAAQ,IAAI,IAAI,EAAE,OAAO,QAAQ,GAAG,EAAE,CAAC;CAC5C,CAAC,IAAI,cAAc,CAAC,oBAAoB,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,EAAE;CACvK,EAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;CACpC,EAAE;CACF,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,kCAAkC,EAAE,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC;CACD;CACA,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK;CAC3C,CAAC,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;CAC1C;CACA,CAAC,IAAI,SAAS,GAAG,EAAE,CAAC;CACpB,CAAC,IAAI,QAAQ,KAAK,SAAS,EAAE;CAC7B,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;CAClE,EAAE,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC;CAChC,EAAE;CACF,CAAC,IAAI,iBAAiB,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;CAC/C;CACA;CACA;CACA,CAAC,IAAI,iBAAiB,KAAK,iBAAiB,CAAC,QAAQ,IAAI,cAAc,CAAC,EAAE;CAC1E,EAAE,CAAC,iBAAiB,CAAC,iBAAiB,KAAK,iBAAiB,CAAC,iBAAiB,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,iBAAiB,CAAC;CAC9G,EAAE;CACF,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC;CACnC,CAAC,SAAS,CAAC,IAAI,GAAG,qBAAqB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;CAC9D,CAAC,OAAO,SAAS,CAAC,IAAI,EAAE,CAAC;CACzB,CAAC,CAAC;CACF,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC;CAChC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC;AACrC;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI;CAClC,CAAC,IAAI,UAAU,GAAG,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,CAAC;CAC7C,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC/D,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;CACtC,EAAE,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC;CACrB,EAAE,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CAC1B,EAAE;CACF,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,EAAE;CACrC,EAAE,IAAI,IAAI,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACzE,EAAE,IAAI,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,KAAK;CAC/B,GAAG,IAAI,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC;CAC5B,GAAG,IAAI,MAAM,IAAI,EAAE,EAAE;CACrB,IAAI,IAAI,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;CACvC,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;CAC7C,KAAK,GAAG,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;CACxB,KAAK,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;CACjC,KAAK;CACL,IAAI,OAAO,GAAG,CAAC;CACf,IAAI;CACJ;CACA,GAAG,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;CAC3C,GAAG,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;CACpC,GAAG,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;CACnC,GAAG,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,GAAG,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;CACvD,GAAG,CAAC;CACJ,EAAE,IAAI,GAAG,CAAC,IAAI,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;CACpG,EAAE;CACF,CAAC,OAAO,IAAI,CAAC;CACb,CAAC,CAAC;AACF;CACA,IAAI,MAAM,GAAG;CACb,CAAC,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,cAAc,KAAK,UAAU,GAAG,cAAc,GAAG,IAAI;CAC7J,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;CACvB,EAAE,IAAI,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACjD,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACvB,EAAE,OAAO,KAAK,CAAC;CACf,EAAE;CACF,CAAC,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;CACrD,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,CAAC,YAAY;CAClB,EAAE,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;CAC3B,CAAC,IAAI,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;CAC3B,CAAC,IAAI,MAAM,CAAC;CACZ;CACA,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACpE,EAAE,MAAM,GAAG,EAAE,CAAC;CACd,MAAM,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI;CACzE,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,KAAK,IAAI;CAC1G,EAAE,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;CACrB;CACA,EAAE,MAAM,GAAG,EAAE,CAAC;AACd;CACA,CAAC,IAAI,QAAQ,GAAG,EAAE,MAAM,EAAE,CAAC;CAC3B,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;CAChC,CAAC,IAAI,gBAAgB,GAAG,IAAI,EAAE,CAAC;CAC/B,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE;CACrB;CACA,EAAE,OAAO,QAAQ,CAAC,MAAM,GAAG,gBAAgB,CAAC;CAC5C,EAAE,MAAM;CACR;CACA,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;CAC1C,EAAE;AACF;CACA;CACA,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,gBAAgB,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAClE,CAAC,IAAI,MAAM,YAAY,GAAG;CAC1B,EAAE,KAAK,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAC5D,CAAC,OAAO,MAAM,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,cAAc,CAAC,eAAe,KAAK,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;CACzG,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;CAC3C,CAAC,IAAI,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;CACrC,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;CACtB,CAAC,OAAO,QAAQ,CAAC,MAAM,CAAC;CACxB,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;AAChD;AACY,OAAC,WAAW,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,GAAG,OAAO,EAAE;AACpK;CACA,IAAI,IAAI,GAAG,OAAO,UAAU,KAAK,QAAQ,GAAG,UAAU,GAAG,MAAM,CAAC;CAChE,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CACxB;CACA,CAAC,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D;CACA,CAAC,IAAI,cAAc,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;CAC5C,CAAC,IAAI,CAAC,cAAc,EAAE;CACtB,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,MAAM,CAAC;CACrC,EAAE,IAAI,QAAQ,KAAK,EAAE,EAAE,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;CACnD,EAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,QAAQ,CAAC,CAAC;CACrE,EAAE;CACF,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;CACzC,CAAC,CAAC;CACF,iBAAiB,CAAC,IAAI,CAAC,GAAG,MAAM;CAChC,CAAC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;CACnB,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;CACrC,CAAC,CAAC;CACF,MAAM,WAAW,GAAG,EAAE,CAAC;CACvB,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;CAC7E,CAAC,IAAI,YAAY,GAAG,QAAQ,CAAC;CAC7B,CAAC,QAAQ,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;CACpC,CAAC,cAAc,GAAG,WAAW,CAAC;CAC9B,CAAC,cAAc,GAAG,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAAE,CAAC,CAAC;CAC3D,CAAC,cAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAAC,cAAc,CAAC,SAAS,GAAG,CAAC,CAAC;CAC9B,CAAC,cAAc,CAAC,kBAAkB,GAAG,QAAQ,CAAC;CAC9C,CAAC,QAAQ,GAAG,YAAY,CAAC;CACzB,CAAC,OAAO,IAAI,EAAE,CAAC;CACf,CAAC,CAAC;AACF;CACA,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK;CACpC;CACA,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CACrB,EAAE,OAAO,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC7F,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;CAC1B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO;CAClF,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9G,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,EAAE;CAC3B,EAAE,OAAO,IAAI,IAAI;CACjB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,OAAO;CAC3E,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,eAAe,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;CAC9K;CACA,EAAE,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;CAC7B,CAAC,CAAC;CACF;CACA;AACA;CACA,SAAS,SAAS,CAAC,QAAQ,EAAE;CAC7B,CAAC,IAAI,cAAc,IAAI,cAAc,CAAC,YAAY;CAClD,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC;CAChC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC;CAC1B,CAAC,IAAI,aAAa,GAAG,QAAQ,CAAC;CAC9B,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,cAAc,GAAG,SAAS,CAAC;CAChC,CAAC,IAAI,YAAY,GAAG,OAAO,CAAC;CAC5B,CAAC,IAAI,iBAAiB,GAAG,YAAY,CAAC;CACtC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;AAC1C;CACA;CACA,CAAC,IAAI,QAAQ,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACrD,CAAC,IAAI,eAAe,GAAG,iBAAiB,CAAC;CACzC,CAAC,IAAI,uBAAuB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,CAAC,CAAC;CACpF,CAAC,IAAI,UAAU,GAAG,cAAc,CAAC;CACjC,CAAC,IAAI,mBAAmB,GAAG,cAAc,CAAC;CAC1C,CAAC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;CACxB,CAAC,MAAM,GAAG,WAAW,CAAC;CACtB,CAAC,QAAQ,GAAG,aAAa,CAAC;CAC1B,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAAC,SAAS,GAAG,cAAc,CAAC;CAC5B,CAAC,OAAO,GAAG,YAAY,CAAC;CACxB,CAAC,YAAY,GAAG,iBAAiB,CAAC;CAClC,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,GAAG,GAAG,QAAQ,CAAC;CAChB,CAAC,cAAc,GAAG,mBAAmB,CAAC;CACtC,CAAC,iBAAiB,GAAG,eAAe,CAAC;CACrC,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,MAAM,EAAE,GAAG,uBAAuB,CAAC,CAAC;CACnF,CAAC,cAAc,GAAG,UAAU,CAAC;CAC7B,CAAC,QAAQ,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;CACrE,CAAC,OAAO,KAAK,CAAC;CACd,CAAC;CACM,SAAS,WAAW,GAAG;CAC9B,CAAC,GAAG,GAAG,IAAI,CAAC;CACZ,CAAC,YAAY,GAAG,IAAI,CAAC;CACrB,CAAC,iBAAiB,GAAG,IAAI,CAAC;CAC1B,CAAC;AACD;CACO,SAAS,YAAY,CAAC,SAAS,EAAE;CACxC,CAAC,IAAI,SAAS,CAAC,MAAM;CACrB,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;CACvD;CACA,EAAE,iBAAiB,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;CAChD,CAAC;AACD;AACY,OAAC,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,EAAE;CACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;CAC9B,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;CACvD,CAAC;AACW,OAAC,OAAO,GAAG,QAAQ;CAC/B,IAAI,cAAc,GAAG,IAAI,OAAO,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC5C,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,cAAc,GAAG,cAAc,CAAC,eAAe;AAChD,OAAC,MAAM,GAAG,cAAc,CAAC,OAAO;AAChC,OAAC,eAAe,GAAG;CAC/B,CAAC,KAAK,EAAE,CAAC;CACT,CAAC,MAAM,EAAE,CAAC;CACV,CAAC,aAAa,EAAE,CAAC;CACjB,CAAC,WAAW,EAAE,CAAC;CACf,EAAE;CACF,IAAI,QAAQ,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;CACnC,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7C,SAAS,YAAY,CAAC,aAAa,EAAE;CAC5C,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;CAC7B,CAAC,IAAI,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;CACzE,CAAC,OAAO,CAAC,CAAC,UAAU,GAAG,aAAa,IAAI,aAAa,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,UAAU,CAAC;CAC5F,CAAC;CACD;CACA;CACA;CACA,OAAO,CAAC,qBAAqB,GAAG,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/msgpackr/index.d.cts b/node_modules/msgpackr/index.d.cts
new file mode 100644
index 0000000..bb0cfc3
--- /dev/null
+++ b/node_modules/msgpackr/index.d.cts
@@ -0,0 +1,93 @@
+export enum FLOAT32_OPTIONS {
+	NEVER = 0,
+	ALWAYS = 1,
+	DECIMAL_ROUND = 3,
+	DECIMAL_FIT = 4
+}
+
+export interface Options {
+	useFloat32?: FLOAT32_OPTIONS
+	useRecords?: boolean | ((value:any)=> boolean)
+	structures?: {}[]
+	moreTypes?: boolean
+	sequential?: boolean
+	structuredClone?: boolean
+	mapsAsObjects?: boolean
+	variableMapSize?: boolean
+	coercibleKeyAsNumber?: boolean
+	copyBuffers?: boolean
+	bundleStrings?: boolean
+	useTimestamp32?: boolean
+	largeBigIntToFloat?: boolean
+	largeBigIntToString?: boolean
+	useBigIntExtension?: boolean
+	encodeUndefinedAsNil?: boolean
+	maxSharedStructures?: number
+	maxOwnStructures?: number
+	mapAsEmptyObject?: boolean
+	setAsEmptyObject?: boolean
+	allowArraysInMapKeys?: boolean
+	writeFunction?: () => any
+	/** @deprecated use int64AsType: 'number' */
+	int64AsNumber?: boolean
+	int64AsType?: 'bigint' | 'number' | 'string'
+	shouldShareStructure?: (keys: string[]) => boolean
+	getStructures?(): {}[]
+	saveStructures?(structures: {}[]): boolean | void
+	onInvalidDate?: () => any
+}
+interface Extension {
+	Class?: Function
+	type?: number
+	pack?(value: any): Buffer | Uint8Array
+	unpack?(messagePack: Buffer | Uint8Array): any
+	read?(datum: any): any
+	write?(instance: any): any
+}
+export type UnpackOptions = { start?: number; end?: number; lazy?: boolean; } | number;
+export class Unpackr {
+	constructor(options?: Options)
+	unpack(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+	decode(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+	unpackMultiple(messagePack: Buffer | Uint8Array): any[]
+	unpackMultiple(messagePack: Buffer | Uint8Array, forEach: (value: any, start?: number, end?: number) => any): void
+}
+export class Decoder extends Unpackr {}
+export function unpack(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+export function unpackMultiple(messagePack: Buffer | Uint8Array): any[]
+export function unpackMultiple(messagePack: Buffer | Uint8Array, forEach: (value: any, start?: number, end?: number) => any): void
+export function decode(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+export function addExtension(extension: Extension): void
+export function clearSource(): void
+export function roundFloat32(float32Number: number): number
+export function decodeIter(bufferIterator: Iterable<Buffer | Uint8Array> | Iterator<Buffer | Uint8Array> | AsyncIterable<Buffer | Uint8Array> | AsyncIterator<Buffer | Uint8Array>, options?: Options): AsyncGenerator<any>
+export function encodeIter(objectIterator: Iterable<Buffer | Uint8Array> | Iterator<Buffer | Uint8Array> | AsyncIterable<Buffer | Uint8Array> | AsyncIterator<Buffer | Uint8Array>, options?: Options): IterableIterator<Buffer> | Promise<AsyncIterableIterator<Buffer>>
+export const C1: {}
+export let isNativeAccelerationEnabled: boolean
+
+export class Packr extends Unpackr {
+	offset: number;
+	position: number;
+	pack(value: any, encodeOptions?: number): Buffer
+	encode(value: any, encodeOptions?: number): Buffer
+	useBuffer(buffer: Buffer | Uint8Array): void;
+	clearSharedData(): void;
+}
+export class Encoder extends Packr {}
+export function pack(value: any, encodeOptions?: number): Buffer
+export function encode(value: any, encodeOptions?: number): Buffer
+
+export const REUSE_BUFFER_MODE: number;
+export const RESET_BUFFER_MODE: number;
+export const RESERVE_START_SPACE: number;
+
+import { Transform, Readable } from 'stream'
+
+export as namespace msgpackr;
+export class UnpackrStream extends Transform {
+	constructor(options?: Options | { highWaterMark: number, emitClose: boolean, allowHalfOpen: boolean })
+}
+export class PackrStream extends Transform {
+	constructor(options?: Options | { highWaterMark: number, emitClose: boolean, allowHalfOpen: boolean })
+}
+export { PackrStream as EncoderStream, UnpackrStream as DecoderStream };
\ No newline at end of file
diff --git a/node_modules/msgpackr/index.d.ts b/node_modules/msgpackr/index.d.ts
new file mode 100644
index 0000000..bb0cfc3
--- /dev/null
+++ b/node_modules/msgpackr/index.d.ts
@@ -0,0 +1,93 @@
+export enum FLOAT32_OPTIONS {
+	NEVER = 0,
+	ALWAYS = 1,
+	DECIMAL_ROUND = 3,
+	DECIMAL_FIT = 4
+}
+
+export interface Options {
+	useFloat32?: FLOAT32_OPTIONS
+	useRecords?: boolean | ((value:any)=> boolean)
+	structures?: {}[]
+	moreTypes?: boolean
+	sequential?: boolean
+	structuredClone?: boolean
+	mapsAsObjects?: boolean
+	variableMapSize?: boolean
+	coercibleKeyAsNumber?: boolean
+	copyBuffers?: boolean
+	bundleStrings?: boolean
+	useTimestamp32?: boolean
+	largeBigIntToFloat?: boolean
+	largeBigIntToString?: boolean
+	useBigIntExtension?: boolean
+	encodeUndefinedAsNil?: boolean
+	maxSharedStructures?: number
+	maxOwnStructures?: number
+	mapAsEmptyObject?: boolean
+	setAsEmptyObject?: boolean
+	allowArraysInMapKeys?: boolean
+	writeFunction?: () => any
+	/** @deprecated use int64AsType: 'number' */
+	int64AsNumber?: boolean
+	int64AsType?: 'bigint' | 'number' | 'string'
+	shouldShareStructure?: (keys: string[]) => boolean
+	getStructures?(): {}[]
+	saveStructures?(structures: {}[]): boolean | void
+	onInvalidDate?: () => any
+}
+interface Extension {
+	Class?: Function
+	type?: number
+	pack?(value: any): Buffer | Uint8Array
+	unpack?(messagePack: Buffer | Uint8Array): any
+	read?(datum: any): any
+	write?(instance: any): any
+}
+export type UnpackOptions = { start?: number; end?: number; lazy?: boolean; } | number;
+export class Unpackr {
+	constructor(options?: Options)
+	unpack(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+	decode(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+	unpackMultiple(messagePack: Buffer | Uint8Array): any[]
+	unpackMultiple(messagePack: Buffer | Uint8Array, forEach: (value: any, start?: number, end?: number) => any): void
+}
+export class Decoder extends Unpackr {}
+export function unpack(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+export function unpackMultiple(messagePack: Buffer | Uint8Array): any[]
+export function unpackMultiple(messagePack: Buffer | Uint8Array, forEach: (value: any, start?: number, end?: number) => any): void
+export function decode(messagePack: Buffer | Uint8Array, options?: UnpackOptions): any
+export function addExtension(extension: Extension): void
+export function clearSource(): void
+export function roundFloat32(float32Number: number): number
+export function decodeIter(bufferIterator: Iterable<Buffer | Uint8Array> | Iterator<Buffer | Uint8Array> | AsyncIterable<Buffer | Uint8Array> | AsyncIterator<Buffer | Uint8Array>, options?: Options): AsyncGenerator<any>
+export function encodeIter(objectIterator: Iterable<Buffer | Uint8Array> | Iterator<Buffer | Uint8Array> | AsyncIterable<Buffer | Uint8Array> | AsyncIterator<Buffer | Uint8Array>, options?: Options): IterableIterator<Buffer> | Promise<AsyncIterableIterator<Buffer>>
+export const C1: {}
+export let isNativeAccelerationEnabled: boolean
+
+export class Packr extends Unpackr {
+	offset: number;
+	position: number;
+	pack(value: any, encodeOptions?: number): Buffer
+	encode(value: any, encodeOptions?: number): Buffer
+	useBuffer(buffer: Buffer | Uint8Array): void;
+	clearSharedData(): void;
+}
+export class Encoder extends Packr {}
+export function pack(value: any, encodeOptions?: number): Buffer
+export function encode(value: any, encodeOptions?: number): Buffer
+
+export const REUSE_BUFFER_MODE: number;
+export const RESET_BUFFER_MODE: number;
+export const RESERVE_START_SPACE: number;
+
+import { Transform, Readable } from 'stream'
+
+export as namespace msgpackr;
+export class UnpackrStream extends Transform {
+	constructor(options?: Options | { highWaterMark: number, emitClose: boolean, allowHalfOpen: boolean })
+}
+export class PackrStream extends Transform {
+	constructor(options?: Options | { highWaterMark: number, emitClose: boolean, allowHalfOpen: boolean })
+}
+export { PackrStream as EncoderStream, UnpackrStream as DecoderStream };
\ No newline at end of file
diff --git a/node_modules/msgpackr/index.js b/node_modules/msgpackr/index.js
new file mode 100644
index 0000000..bb0ed0a
--- /dev/null
+++ b/node_modules/msgpackr/index.js
@@ -0,0 +1,5 @@
+export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';
+export { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';
+export { decodeIter, encodeIter } from './iterators.js';
+export const useRecords = false;
+export const mapsAsObjects = true;
diff --git a/node_modules/msgpackr/iterators.js b/node_modules/msgpackr/iterators.js
new file mode 100644
index 0000000..a7d897b
--- /dev/null
+++ b/node_modules/msgpackr/iterators.js
@@ -0,0 +1,87 @@
+import { Packr } from './pack.js';
+import { Unpackr } from './unpack.js';
+
+/**
+ * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
+ * If the argument is only Async Iterable, the return value will be an Async Iterable.
+ * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object
+ * @param {options} [options] - msgpackr pack options
+ * @returns {IterableIterator|Promise.<AsyncIterableIterator>}
+ */
+export function packIter (objectIterator, options = {}) {
+  if (!objectIterator || typeof objectIterator !== 'object') {
+    throw new Error('first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable');
+  } else if (typeof objectIterator[Symbol.iterator] === 'function') {
+    return packIterSync(objectIterator, options);
+  } else if (typeof objectIterator.then === 'function' || typeof objectIterator[Symbol.asyncIterator] === 'function') {
+    return packIterAsync(objectIterator, options);
+  } else {
+    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise');
+  }
+}
+
+function * packIterSync (objectIterator, options) {
+  const packr = new Packr(options);
+  for (const value of objectIterator) {
+    yield packr.pack(value);
+  }
+}
+
+async function * packIterAsync (objectIterator, options) {
+  const packr = new Packr(options);
+  for await (const value of objectIterator) {
+    yield packr.pack(value);
+  }
+}
+
+/**
+ * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
+ * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
+ * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
+ * @param {object} [options] - unpackr options
+ * @returns {IterableIterator|Promise.<AsyncIterableIterator}
+ */
+export function unpackIter (bufferIterator, options = {}) {
+  if (!bufferIterator || typeof bufferIterator !== 'object') {
+    throw new Error('first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise');
+  }
+
+  const unpackr = new Unpackr(options);
+  let incomplete;
+  const parser = (chunk) => {
+    let yields;
+    // if there's incomplete data from previous chunk, concatinate and try again
+    if (incomplete) {
+      chunk = Buffer.concat([incomplete, chunk]);
+      incomplete = undefined;
+    }
+
+    try {
+      yields = unpackr.unpackMultiple(chunk);
+    } catch (err) {
+      if (err.incomplete) {
+        incomplete = chunk.slice(err.lastPosition);
+        yields = err.values;
+      } else {
+        throw err;
+      }
+    }
+    return yields;
+  };
+
+  if (typeof bufferIterator[Symbol.iterator] === 'function') {
+    return (function * iter () {
+      for (const value of bufferIterator) {
+        yield * parser(value);
+      }
+    })();
+  } else if (typeof bufferIterator[Symbol.asyncIterator] === 'function') {
+    return (async function * iter () {
+      for await (const value of bufferIterator) {
+        yield * parser(value);
+      }
+    })();
+  }
+}
+export const decodeIter = unpackIter;
+export const encodeIter = packIter;
\ No newline at end of file
diff --git a/node_modules/msgpackr/node-index.js b/node_modules/msgpackr/node-index.js
new file mode 100644
index 0000000..3693452
--- /dev/null
+++ b/node_modules/msgpackr/node-index.js
@@ -0,0 +1,24 @@
+export { Packr, Encoder, addExtension, pack, encode, NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from './pack.js';
+export { Unpackr, Decoder, C1, unpack, unpackMultiple, decode, FLOAT32_OPTIONS, clearSource, roundFloat32, isNativeAccelerationEnabled } from './unpack.js';
+export { PackrStream, UnpackrStream, PackrStream as EncoderStream, UnpackrStream as DecoderStream } from './stream.js';
+export { decodeIter, encodeIter } from './iterators.js';
+export const useRecords = false;
+export const mapsAsObjects = true;
+import { setExtractor } from './unpack.js';
+import { createRequire } from 'module';
+
+const nativeAccelerationDisabled = process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED !== undefined && process.env.MSGPACKR_NATIVE_ACCELERATION_DISABLED.toLowerCase() === 'true';
+
+if (!nativeAccelerationDisabled) {
+	let extractor;
+	try {
+		if (typeof require == 'function')
+			extractor = require('msgpackr-extract');
+		else
+			extractor = createRequire(import.meta.url)('msgpackr-extract');
+		if (extractor)
+			setExtractor(extractor.extractStrings);
+	} catch (error) {
+		// native module is optional
+	}
+}
\ No newline at end of file
diff --git a/node_modules/msgpackr/pack.d.cts b/node_modules/msgpackr/pack.d.cts
new file mode 100644
index 0000000..0299f89
--- /dev/null
+++ b/node_modules/msgpackr/pack.d.cts
@@ -0,0 +1 @@
+export { Unpackr, Decoder, Packr, Encoder, pack, encode, unpack, decode, addExtension, FLOAT32_OPTIONS, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from '.'
diff --git a/node_modules/msgpackr/pack.d.ts b/node_modules/msgpackr/pack.d.ts
new file mode 100644
index 0000000..0299f89
--- /dev/null
+++ b/node_modules/msgpackr/pack.d.ts
@@ -0,0 +1 @@
+export { Unpackr, Decoder, Packr, Encoder, pack, encode, unpack, decode, addExtension, FLOAT32_OPTIONS, REUSE_BUFFER_MODE, RESET_BUFFER_MODE, RESERVE_START_SPACE } from '.'
diff --git a/node_modules/msgpackr/pack.js b/node_modules/msgpackr/pack.js
new file mode 100644
index 0000000..887ba68
--- /dev/null
+++ b/node_modules/msgpackr/pack.js
@@ -0,0 +1,1142 @@
+import { Unpackr, mult10, C1Type, typedArrays, addExtension as unpackAddExtension } from './unpack.js';
+let textEncoder;
+try {
+	textEncoder = new TextEncoder();
+} catch (error) {}
+let extensions, extensionClasses;
+const hasNodeBuffer = typeof Buffer !== 'undefined';
+const ByteArrayAllocate = hasNodeBuffer ?
+	function(length) { return Buffer.allocUnsafeSlow(length); } : Uint8Array;
+const ByteArray = hasNodeBuffer ? Buffer : Uint8Array;
+const MAX_BUFFER_SIZE = hasNodeBuffer ? 0x100000000 : 0x7fd00000;
+let target, keysTarget;
+let targetView;
+let position = 0;
+let safeEnd;
+let bundledStrings = null;
+const MAX_BUNDLE_SIZE = 0x5500; // maximum characters such that the encoded bytes fits in 16 bits.
+const hasNonLatin = /[\u0080-\uFFFF]/;
+export const RECORD_SYMBOL = Symbol('record-id');
+export class Packr extends Unpackr {
+	constructor(options) {
+		super(options);
+		this.offset = 0;
+		let typeBuffer;
+		let start;
+		let hasSharedUpdate;
+		let structures;
+		let referenceMap;
+		let encodeUtf8 = ByteArray.prototype.utf8Write ? function(string, position) {
+			return target.utf8Write(string, position, target.byteLength - position);
+		} : (textEncoder && textEncoder.encodeInto) ?
+			function(string, position) {
+				return textEncoder.encodeInto(string, target.subarray(position)).written;
+			} : false;
+
+		let packr = this;
+		if (!options)
+			options = {};
+		let isSequential = options && options.sequential;
+		let hasSharedStructures = options.structures || options.saveStructures;
+		let maxSharedStructures = options.maxSharedStructures;
+		if (maxSharedStructures == null)
+			maxSharedStructures = hasSharedStructures ? 32 : 0;
+		if (maxSharedStructures > 8160)
+			throw new Error('Maximum maxSharedStructure is 8160');
+		if (options.structuredClone && options.moreTypes == undefined) {
+			this.moreTypes = true;
+		}
+		let maxOwnStructures = options.maxOwnStructures;
+		if (maxOwnStructures == null)
+			maxOwnStructures = hasSharedStructures ? 32 : 64;
+		if (!this.structures && options.useRecords != false)
+			this.structures = [];
+		// two byte record ids for shared structures
+		let useTwoByteRecords = maxSharedStructures > 32 || (maxOwnStructures + maxSharedStructures > 64);
+		let sharedLimitId = maxSharedStructures + 0x40;
+		let maxStructureId = maxSharedStructures + maxOwnStructures + 0x40;
+		if (maxStructureId > 8256) {
+			throw new Error('Maximum maxSharedStructure + maxOwnStructure is 8192');
+		}
+		let recordIdsToRemove = [];
+		let transitionsCount = 0;
+		let serializationsSinceTransitionRebuild = 0;
+
+		this.pack = this.encode = function(value, encodeOptions) {
+			if (!target) {
+				target = new ByteArrayAllocate(8192);
+				targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, 8192));
+				position = 0;
+			}
+			safeEnd = target.length - 10;
+			if (safeEnd - position < 0x800) {
+				// don't start too close to the end,
+				target = new ByteArrayAllocate(target.length);
+				targetView = target.dataView || (target.dataView = new DataView(target.buffer, 0, target.length));
+				safeEnd = target.length - 10;
+				position = 0;
+			} else
+				position = (position + 7) & 0x7ffffff8; // Word align to make any future copying of this buffer faster
+			start = position;
+			if (encodeOptions & RESERVE_START_SPACE) position += (encodeOptions & 0xff);
+			referenceMap = packr.structuredClone ? new Map() : null;
+			if (packr.bundleStrings && typeof value !== 'string') {
+				bundledStrings = [];
+				bundledStrings.size = Infinity; // force a new bundle start on first string
+			} else
+				bundledStrings = null;
+			structures = packr.structures;
+			if (structures) {
+				if (structures.uninitialized)
+					structures = packr._mergeStructures(packr.getStructures());
+				let sharedLength = structures.sharedLength || 0;
+				if (sharedLength > maxSharedStructures) {
+					//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
+					throw new Error('Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to ' + structures.sharedLength);
+				}
+				if (!structures.transitions) {
+					// rebuild our structure transitions
+					structures.transitions = Object.create(null);
+					for (let i = 0; i < sharedLength; i++) {
+						let keys = structures[i];
+						if (!keys)
+							continue;
+						let nextTransition, transition = structures.transitions;
+						for (let j = 0, l = keys.length; j < l; j++) {
+							let key = keys[j];
+							nextTransition = transition[key];
+							if (!nextTransition) {
+								nextTransition = transition[key] = Object.create(null);
+							}
+							transition = nextTransition;
+						}
+						transition[RECORD_SYMBOL] = i + 0x40;
+					}
+					this.lastNamedStructuresLength = sharedLength;
+				}
+				if (!isSequential) {
+					structures.nextId = sharedLength + 0x40;
+				}
+			}
+			if (hasSharedUpdate)
+				hasSharedUpdate = false;
+			let encodingError;
+			try {
+				if (packr._writeStruct && value && typeof value === 'object') {
+					if (value.constructor === Object) writeStruct(value); // simple object
+					else if (value.constructor !== Map && !Array.isArray(value) && !extensionClasses.some(extClass => value instanceof extClass)) {
+						// allow user classes, if they don't need special handling (but do use toJSON if available)
+						writeStruct(value.toJSON ? value.toJSON() : value);
+					} else pack(value);
+				} else
+					pack(value);
+				let lastBundle = bundledStrings;
+				if (bundledStrings)
+					writeBundles(start, pack, 0);
+				if (referenceMap && referenceMap.idsToInsert) {
+					let idsToInsert = referenceMap.idsToInsert.sort((a, b) => a.offset > b.offset ? 1 : -1);
+					let i = idsToInsert.length;
+					let incrementPosition = -1;
+					while (lastBundle && i > 0) {
+						let insertionPoint = idsToInsert[--i].offset + start;
+						if (insertionPoint < (lastBundle.stringsPosition + start) && incrementPosition === -1)
+							incrementPosition = 0;
+						if (insertionPoint > (lastBundle.position + start)) {
+							if (incrementPosition >= 0)
+								incrementPosition += 6;
+						} else {
+							if (incrementPosition >= 0) {
+								// update the bundle reference now
+								targetView.setUint32(lastBundle.position + start,
+									targetView.getUint32(lastBundle.position + start) + incrementPosition);
+								incrementPosition = -1; // reset
+							}
+							lastBundle = lastBundle.previous;
+							i++;
+						}
+					}
+					if (incrementPosition >= 0 && lastBundle) {
+						// update the bundle reference now
+						targetView.setUint32(lastBundle.position + start,
+							targetView.getUint32(lastBundle.position + start) + incrementPosition);
+					}
+					position += idsToInsert.length * 6;
+					if (position > safeEnd)
+						makeRoom(position);
+					packr.offset = position;
+					let serialized = insertIds(target.subarray(start, position), idsToInsert);
+					referenceMap = null;
+					return serialized;
+				}
+				packr.offset = position; // update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
+				if (encodeOptions & REUSE_BUFFER_MODE) {
+					target.start = start;
+					target.end = position;
+					return target;
+				}
+				return target.subarray(start, position); // position can change if we call pack again in saveStructures, so we get the buffer now
+			} catch(error) {
+				encodingError = error;
+				throw error;
+			} finally {
+				if (structures) {
+					resetStructures();
+					if (hasSharedUpdate && packr.saveStructures) {
+						let sharedLength = structures.sharedLength || 0;
+						// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
+						let returnBuffer = target.subarray(start, position);
+						let newSharedData = (packr._prepareStructures || prepareStructures)(structures, packr);
+						if (!encodingError) { // TODO: If there is an encoding error, should make the structures as uninitialized so they get rebuilt next time
+							if (packr.saveStructures(newSharedData, newSharedData.isCompatible) === false) {
+								// get updated structures and try again if the update failed
+								return packr.pack(value, encodeOptions);
+							}
+							packr.lastNamedStructuresLength = sharedLength;
+							// don't keep large buffers around
+							if (target.length > 0x40000000) target = null;
+							return returnBuffer;
+						}
+					}
+				}
+				// don't keep large buffers around, they take too much memory and cause problems (limit at 1GB)
+				if (target.length > 0x40000000) target = null;
+				if (encodeOptions & RESET_BUFFER_MODE)
+					position = start;
+			}
+		};
+		const resetStructures = () => {
+			if (serializationsSinceTransitionRebuild < 10)
+				serializationsSinceTransitionRebuild++;
+			let sharedLength = structures.sharedLength || 0;
+			if (structures.length > sharedLength && !isSequential)
+				structures.length = sharedLength;
+			if (transitionsCount > 10000) {
+				// force a rebuild occasionally after a lot of transitions so it can get cleaned up
+				structures.transitions = null;
+				serializationsSinceTransitionRebuild = 0;
+				transitionsCount = 0;
+				if (recordIdsToRemove.length > 0)
+					recordIdsToRemove = [];
+			} else if (recordIdsToRemove.length > 0 && !isSequential) {
+				for (let i = 0, l = recordIdsToRemove.length; i < l; i++) {
+					recordIdsToRemove[i][RECORD_SYMBOL] = 0;
+				}
+				recordIdsToRemove = [];
+			}
+		};
+		const packArray = (value) => {
+			var length = value.length;
+			if (length < 0x10) {
+				target[position++] = 0x90 | length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xdc;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xdd;
+				targetView.setUint32(position, length);
+				position += 4;
+			}
+			for (let i = 0; i < length; i++) {
+				pack(value[i]);
+			}
+		};
+		const pack = (value) => {
+			if (position > safeEnd)
+				target = makeRoom(position);
+
+			var type = typeof value;
+			var length;
+			if (type === 'string') {
+				let strLength = value.length;
+				if (bundledStrings && strLength >= 4 && strLength < 0x1000) {
+					if ((bundledStrings.size += strLength) > MAX_BUNDLE_SIZE) {
+						let extStart;
+						let maxBytes = (bundledStrings[0] ? bundledStrings[0].length * 3 + bundledStrings[1].length : 0) + 10;
+						if (position + maxBytes > safeEnd)
+							target = makeRoom(position + maxBytes);
+						let lastBundle;
+						if (bundledStrings.position) { // here we use the 0x62 extension to write the last bundle and reserve space for the reference pointer to the next/current bundle
+							lastBundle = bundledStrings;
+							target[position] = 0xc8; // ext 16
+							position += 3; // reserve for the writing bundle size
+							target[position++] = 0x62; // 'b'
+							extStart = position - start;
+							position += 4; // reserve for writing bundle reference
+							writeBundles(start, pack, 0); // write the last bundles
+							targetView.setUint16(extStart + start - 3, position - start - extStart);
+						} else { // here we use the 0x62 extension just to reserve the space for the reference pointer to the bundle (will be updated once the bundle is written)
+							target[position++] = 0xd6; // fixext 4
+							target[position++] = 0x62; // 'b'
+							extStart = position - start;
+							position += 4; // reserve for writing bundle reference
+						}
+						bundledStrings = ['', '']; // create new ones
+						bundledStrings.previous = lastBundle;
+						bundledStrings.size = 0;
+						bundledStrings.position = extStart;
+					}
+					let twoByte = hasNonLatin.test(value);
+					bundledStrings[twoByte ? 0 : 1] += value;
+					target[position++] = 0xc1;
+					pack(twoByte ? -strLength : strLength);
+					return;
+				}
+				let headerSize;
+				// first we estimate the header size, so we can write to the correct location
+				if (strLength < 0x20) {
+					headerSize = 1;
+				} else if (strLength < 0x100) {
+					headerSize = 2;
+				} else if (strLength < 0x10000) {
+					headerSize = 3;
+				} else {
+					headerSize = 5;
+				}
+				let maxBytes = strLength * 3;
+				if (position + maxBytes > safeEnd)
+					target = makeRoom(position + maxBytes);
+
+				if (strLength < 0x40 || !encodeUtf8) {
+					let i, c1, c2, strPosition = position + headerSize;
+					for (i = 0; i < strLength; i++) {
+						c1 = value.charCodeAt(i);
+						if (c1 < 0x80) {
+							target[strPosition++] = c1;
+						} else if (c1 < 0x800) {
+							target[strPosition++] = c1 >> 6 | 0xc0;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						} else if (
+							(c1 & 0xfc00) === 0xd800 &&
+							((c2 = value.charCodeAt(i + 1)) & 0xfc00) === 0xdc00
+						) {
+							c1 = 0x10000 + ((c1 & 0x03ff) << 10) + (c2 & 0x03ff);
+							i++;
+							target[strPosition++] = c1 >> 18 | 0xf0;
+							target[strPosition++] = c1 >> 12 & 0x3f | 0x80;
+							target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						} else {
+							target[strPosition++] = c1 >> 12 | 0xe0;
+							target[strPosition++] = c1 >> 6 & 0x3f | 0x80;
+							target[strPosition++] = c1 & 0x3f | 0x80;
+						}
+					}
+					length = strPosition - position - headerSize;
+				} else {
+					length = encodeUtf8(value, position + headerSize);
+				}
+
+				if (length < 0x20) {
+					target[position++] = 0xa0 | length;
+				} else if (length < 0x100) {
+					if (headerSize < 2) {
+						target.copyWithin(position + 2, position + 1, position + 1 + length);
+					}
+					target[position++] = 0xd9;
+					target[position++] = length;
+				} else if (length < 0x10000) {
+					if (headerSize < 3) {
+						target.copyWithin(position + 3, position + 2, position + 2 + length);
+					}
+					target[position++] = 0xda;
+					target[position++] = length >> 8;
+					target[position++] = length & 0xff;
+				} else {
+					if (headerSize < 5) {
+						target.copyWithin(position + 5, position + 3, position + 3 + length);
+					}
+					target[position++] = 0xdb;
+					targetView.setUint32(position, length);
+					position += 4;
+				}
+				position += length;
+			} else if (type === 'number') {
+				if (value >>> 0 === value) {// positive integer, 32-bit or less
+					// positive uint
+					if (value < 0x20 || (value < 0x80 && this.useRecords === false) || (value < 0x40 && !this._writeStruct)) {
+						target[position++] = value;
+					} else if (value < 0x100) {
+						target[position++] = 0xcc;
+						target[position++] = value;
+					} else if (value < 0x10000) {
+						target[position++] = 0xcd;
+						target[position++] = value >> 8;
+						target[position++] = value & 0xff;
+					} else {
+						target[position++] = 0xce;
+						targetView.setUint32(position, value);
+						position += 4;
+					}
+				} else if (value >> 0 === value) { // negative integer
+					if (value >= -0x20) {
+						target[position++] = 0x100 + value;
+					} else if (value >= -0x80) {
+						target[position++] = 0xd0;
+						target[position++] = value + 0x100;
+					} else if (value >= -0x8000) {
+						target[position++] = 0xd1;
+						targetView.setInt16(position, value);
+						position += 2;
+					} else {
+						target[position++] = 0xd2;
+						targetView.setInt32(position, value);
+						position += 4;
+					}
+				} else {
+					let useFloat32;
+					if ((useFloat32 = this.useFloat32) > 0 && value < 0x100000000 && value >= -0x80000000) {
+						target[position++] = 0xca;
+						targetView.setFloat32(position, value);
+						let xShifted;
+						if (useFloat32 < 4 ||
+								// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+								((xShifted = value * mult10[((target[position] & 0x7f) << 1) | (target[position + 1] >> 7)]) >> 0) === xShifted) {
+							position += 4;
+							return;
+						} else
+							position--; // move back into position for writing a double
+					}
+					target[position++] = 0xcb;
+					targetView.setFloat64(position, value);
+					position += 8;
+				}
+			} else if (type === 'object' || type === 'function') {
+				if (!value)
+					target[position++] = 0xc0;
+				else {
+					if (referenceMap) {
+						let referee = referenceMap.get(value);
+						if (referee) {
+							if (!referee.id) {
+								let idsToInsert = referenceMap.idsToInsert || (referenceMap.idsToInsert = []);
+								referee.id = idsToInsert.push(referee);
+							}
+							target[position++] = 0xd6; // fixext 4
+							target[position++] = 0x70; // "p" for pointer
+							targetView.setUint32(position, referee.id);
+							position += 4;
+							return;
+						} else
+							referenceMap.set(value, { offset: position - start });
+					}
+					let constructor = value.constructor;
+					if (constructor === Object) {
+						writeObject(value);
+					} else if (constructor === Array) {
+						packArray(value);
+					} else if (constructor === Map) {
+						if (this.mapAsEmptyObject) target[position++] = 0x80;
+						else {
+							length = value.size;
+							if (length < 0x10) {
+								target[position++] = 0x80 | length;
+							} else if (length < 0x10000) {
+								target[position++] = 0xde;
+								target[position++] = length >> 8;
+								target[position++] = length & 0xff;
+							} else {
+								target[position++] = 0xdf;
+								targetView.setUint32(position, length);
+								position += 4;
+							}
+							for (let [key, entryValue] of value) {
+								pack(key);
+								pack(entryValue);
+							}
+						}
+					} else {
+						for (let i = 0, l = extensions.length; i < l; i++) {
+							let extensionClass = extensionClasses[i];
+							if (value instanceof extensionClass) {
+								let extension = extensions[i];
+								if (extension.write) {
+									if (extension.type) {
+										target[position++] = 0xd4; // one byte "tag" extension
+										target[position++] = extension.type;
+										target[position++] = 0;
+									}
+									let writeResult = extension.write.call(this, value);
+									if (writeResult === value) { // avoid infinite recursion
+										if (Array.isArray(value)) {
+											packArray(value);
+										} else {
+											writeObject(value);
+										}
+									} else {
+										pack(writeResult);
+									}
+									return;
+								}
+								let currentTarget = target;
+								let currentTargetView = targetView;
+								let currentPosition = position;
+								target = null;
+								let result;
+								try {
+									result = extension.pack.call(this, value, (size) => {
+										// restore target and use it
+										target = currentTarget;
+										currentTarget = null;
+										position += size;
+										if (position > safeEnd)
+											makeRoom(position);
+										return {
+											target, targetView, position: position - size
+										};
+									}, pack);
+								} finally {
+									// restore current target information (unless already restored)
+									if (currentTarget) {
+										target = currentTarget;
+										targetView = currentTargetView;
+										position = currentPosition;
+										safeEnd = target.length - 10;
+									}
+								}
+								if (result) {
+									if (result.length + position > safeEnd)
+										makeRoom(result.length + position);
+									position = writeExtensionData(result, target, position, extension.type);
+								}
+								return;
+							}
+						}
+						// check isArray after extensions, because extensions can extend Array
+						if (Array.isArray(value)) {
+							packArray(value);
+						} else {
+							// use this as an alternate mechanism for expressing how to serialize
+							if (value.toJSON) {
+								const json = value.toJSON();
+								// if for some reason value.toJSON returns itself it'll loop forever
+								if (json !== value)
+									return pack(json);
+							}
+
+							// if there is a writeFunction, use it, otherwise just encode as undefined
+							if (type === 'function')
+								return pack(this.writeFunction && this.writeFunction(value));
+
+							// no extension found, write as plain object
+							writeObject(value);
+						}
+					}
+				}
+			} else if (type === 'boolean') {
+				target[position++] = value ? 0xc3 : 0xc2;
+			} else if (type === 'bigint') {
+				if (value < 0x8000000000000000 && value >= -0x8000000000000000) {
+					// use a signed int as long as it fits
+					target[position++] = 0xd3;
+					targetView.setBigInt64(position, value);
+				} else if (value < 0x10000000000000000 && value > 0) {
+					// if we can fit an unsigned int, use that
+					target[position++] = 0xcf;
+					targetView.setBigUint64(position, value);
+				} else {
+					// overflow
+					if (this.largeBigIntToFloat) {
+						target[position++] = 0xcb;
+						targetView.setFloat64(position, Number(value));
+					} else if (this.largeBigIntToString) {
+						return pack(value.toString());
+					} else if (this.useBigIntExtension || this.moreTypes) {
+						let empty = value < 0 ? BigInt(-1) : BigInt(0);
+
+						let array;
+						if (value >> BigInt(0x10000) === empty) {
+							let mask = BigInt(0x10000000000000000) - BigInt(1); // literal would overflow
+							let chunks = [];
+							while (true) {
+								chunks.push(value & mask);
+								if ((value >> BigInt(63)) === empty) break;
+								value >>= BigInt(64);
+							}
+
+							array = new Uint8Array(new BigUint64Array(chunks).buffer);
+							array.reverse();
+						} else {
+							let invert = value < 0;
+							let string = (invert ? ~value : value).toString(16);
+							if (string.length % 2) {
+								string = '0' + string;
+							} else if (parseInt(string.charAt(0), 16) >= 8) {
+								string = '00' + string;
+							}
+
+							if (hasNodeBuffer) {
+								array = Buffer.from(string, 'hex');
+							} else {
+								array = new Uint8Array(string.length / 2);
+								for (let i = 0; i < array.length; i++) {
+									array[i] = parseInt(string.slice(i * 2, i * 2 + 2), 16);
+								}
+							}
+
+							if (invert) {
+								for (let i = 0; i < array.length; i++) array[i] = ~array[i];
+							}
+						}
+
+						if (array.length + position > safeEnd)
+							makeRoom(array.length + position);
+						position = writeExtensionData(array, target, position, 0x42);
+						return;
+					} else {
+						throw new RangeError(value + ' was too large to fit in MessagePack 64-bit integer format, use' +
+							' useBigIntExtension, or set largeBigIntToFloat to convert to float-64, or set' +
+							' largeBigIntToString to convert to string');
+					}
+				}
+				position += 8;
+			} else if (type === 'undefined') {
+				if (this.encodeUndefinedAsNil)
+					target[position++] = 0xc0;
+				else {
+					target[position++] = 0xd4; // a number of implementations use fixext1 with type 0, data 0 to denote undefined, so we follow suite
+					target[position++] = 0;
+					target[position++] = 0;
+				}
+			} else {
+				throw new Error('Unknown type: ' + type);
+			}
+		};
+
+		const writePlainObject = (this.variableMapSize || this.coercibleKeyAsNumber || this.skipValues) ? (object) => {
+			// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
+			let keys;
+			if (this.skipValues) {
+				keys = [];
+				for (let key in object) {
+					if ((typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) &&
+						!this.skipValues.includes(object[key]))
+						keys.push(key);
+				}
+			} else {
+				keys = Object.keys(object);
+			}
+			let length = keys.length;
+			if (length < 0x10) {
+				target[position++] = 0x80 | length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xde;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xdf;
+				targetView.setUint32(position, length);
+				position += 4;
+			}
+			let key;
+			if (this.coercibleKeyAsNumber) {
+				for (let i = 0; i < length; i++) {
+					key = keys[i];
+					let num = Number(key);
+					pack(isNaN(num) ? key : num);
+					pack(object[key]);
+				}
+
+			} else {
+				for (let i = 0; i < length; i++) {
+					pack(key = keys[i]);
+					pack(object[key]);
+				}
+			}
+		} :
+		(object) => {
+			target[position++] = 0xde; // always using map 16, so we can preallocate and set the length afterwards
+			let objectOffset = position - start;
+			position += 2;
+			let size = 0;
+			for (let key in object) {
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					pack(key);
+					pack(object[key]);
+					size++;
+				}
+			}
+			if (size > 0xffff) {
+				throw new Error('Object is too large to serialize with fast 16-bit map size,' +
+				' use the "variableMapSize" option to serialize this object');
+			}
+			target[objectOffset++ + start] = size >> 8;
+			target[objectOffset + start] = size & 0xff;
+		};
+
+		const writeRecord = this.useRecords === false ? writePlainObject :
+		(options.progressiveRecords && !useTwoByteRecords) ?  // this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
+		(object) => {
+			let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+			let objectOffset = position++ - start;
+			let wroteKeys;
+			for (let key in object) {
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					nextTransition = transition[key];
+					if (nextTransition)
+						transition = nextTransition;
+					else {
+						// record doesn't exist, create full new record and insert it
+						let keys = Object.keys(object);
+						let lastTransition = transition;
+						transition = structures.transitions;
+						let newTransitions = 0;
+						for (let i = 0, l = keys.length; i < l; i++) {
+							let key = keys[i];
+							nextTransition = transition[key];
+							if (!nextTransition) {
+								nextTransition = transition[key] = Object.create(null);
+								newTransitions++;
+							}
+							transition = nextTransition;
+						}
+						if (objectOffset + start + 1 == position) {
+							// first key, so we don't need to insert, we can just write record directly
+							position--;
+							newRecord(transition, keys, newTransitions);
+						} else // otherwise we need to insert the record, moving existing data after the record
+							insertNewRecord(transition, keys, objectOffset, newTransitions);
+						wroteKeys = true;
+						transition = lastTransition[key];
+					}
+					pack(object[key]);
+				}
+			}
+			if (!wroteKeys) {
+				let recordId = transition[RECORD_SYMBOL];
+				if (recordId)
+					target[objectOffset + start] = recordId;
+				else
+					insertNewRecord(transition, Object.keys(object), objectOffset, 0);
+			}
+		} :
+		(object) => {
+			let nextTransition, transition = structures.transitions || (structures.transitions = Object.create(null));
+			let newTransitions = 0;
+			for (let key in object) if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+				nextTransition = transition[key];
+				if (!nextTransition) {
+					nextTransition = transition[key] = Object.create(null);
+					newTransitions++;
+				}
+				transition = nextTransition;
+			}
+			let recordId = transition[RECORD_SYMBOL];
+			if (recordId) {
+				if (recordId >= 0x60 && useTwoByteRecords) {
+					target[position++] = ((recordId -= 0x60) & 0x1f) + 0x60;
+					target[position++] = recordId >> 5;
+				} else
+					target[position++] = recordId;
+			} else {
+				newRecord(transition, transition.__keys__ || Object.keys(object), newTransitions);
+			}
+			// now write the values
+			for (let key in object)
+				if (typeof object.hasOwnProperty !== 'function' || object.hasOwnProperty(key)) {
+					pack(object[key]);
+				}
+		};
+
+		// create reference to useRecords if useRecords is a function
+		const checkUseRecords = typeof this.useRecords == 'function' && this.useRecords;
+
+		const writeObject = checkUseRecords ? (object) => {
+			checkUseRecords(object) ? writeRecord(object) : writePlainObject(object);
+		} : writeRecord;
+
+		const writeStruct = (object) => {
+			let newPosition = packr._writeStruct(object, target, start, position, structures, makeRoom, (value, newPosition, notifySharedUpdate) => {
+				if (notifySharedUpdate)
+					return hasSharedUpdate = true;
+				position = newPosition;
+				let startTarget = target;
+				pack(value);
+				resetStructures();
+				if (startTarget !== target) {
+					return { position, targetView, target }; // indicate the buffer was re-allocated
+				}
+				return position;
+			});
+			if (newPosition === 0) // bail and go to a msgpack object
+				return writeObject(object);
+			position = newPosition;
+		};
+
+		const makeRoom = (end) => {
+			let newSize;
+			if (end > 0x1000000) {
+				// special handling for really large buffers
+				if ((end - start) > MAX_BUFFER_SIZE)
+					throw new Error('Packed buffer would be larger than maximum buffer size');
+				newSize = Math.min(MAX_BUFFER_SIZE,
+					Math.round(Math.max((end - start) * (end > 0x4000000 ? 1.25 : 2), 0x400000) / 0x1000) * 0x1000);
+			} else // faster handling for smaller buffers
+				newSize = ((Math.max((end - start) << 2, target.length - 1) >> 12) + 1) << 12;
+			let newBuffer = new ByteArrayAllocate(newSize);
+			targetView = newBuffer.dataView || (newBuffer.dataView = new DataView(newBuffer.buffer, 0, newSize));
+			end = Math.min(end, target.length);
+			if (target.copy)
+				target.copy(newBuffer, 0, start, end);
+			else
+				newBuffer.set(target.slice(start, end));
+			position -= start;
+			start = 0;
+			safeEnd = newBuffer.length - 10;
+			return target = newBuffer;
+		};
+		const newRecord = (transition, keys, newTransitions) => {
+			let recordId = structures.nextId;
+			if (!recordId)
+				recordId = 0x40;
+			if (recordId < sharedLimitId && this.shouldShareStructure && !this.shouldShareStructure(keys)) {
+				recordId = structures.nextOwnId;
+				if (!(recordId < maxStructureId))
+					recordId = sharedLimitId;
+				structures.nextOwnId = recordId + 1;
+			} else {
+				if (recordId >= maxStructureId)// cycle back around
+					recordId = sharedLimitId;
+				structures.nextId = recordId + 1;
+			}
+			let highByte = keys.highByte = recordId >= 0x60 && useTwoByteRecords ? (recordId - 0x60) >> 5 : -1;
+			transition[RECORD_SYMBOL] = recordId;
+			transition.__keys__ = keys;
+			structures[recordId - 0x40] = keys;
+
+			if (recordId < sharedLimitId) {
+				keys.isShared = true;
+				structures.sharedLength = recordId - 0x3f;
+				hasSharedUpdate = true;
+				if (highByte >= 0) {
+					target[position++] = (recordId & 0x1f) + 0x60;
+					target[position++] = highByte;
+				} else {
+					target[position++] = recordId;
+				}
+			} else {
+				if (highByte >= 0) {
+					target[position++] = 0xd5; // fixext 2
+					target[position++] = 0x72; // "r" record defintion extension type
+					target[position++] = (recordId & 0x1f) + 0x60;
+					target[position++] = highByte;
+				} else {
+					target[position++] = 0xd4; // fixext 1
+					target[position++] = 0x72; // "r" record defintion extension type
+					target[position++] = recordId;
+				}
+
+				if (newTransitions)
+					transitionsCount += serializationsSinceTransitionRebuild * newTransitions;
+				// record the removal of the id, we can maintain our shared structure
+				if (recordIdsToRemove.length >= maxOwnStructures)
+					recordIdsToRemove.shift()[RECORD_SYMBOL] = 0; // we are cycling back through, and have to remove old ones
+				recordIdsToRemove.push(transition);
+				pack(keys);
+			}
+		};
+		const insertNewRecord = (transition, keys, insertionOffset, newTransitions) => {
+			let mainTarget = target;
+			let mainPosition = position;
+			let mainSafeEnd = safeEnd;
+			let mainStart = start;
+			target = keysTarget;
+			position = 0;
+			start = 0;
+			if (!target)
+				keysTarget = target = new ByteArrayAllocate(8192);
+			safeEnd = target.length - 10;
+			newRecord(transition, keys, newTransitions);
+			keysTarget = target;
+			let keysPosition = position;
+			target = mainTarget;
+			position = mainPosition;
+			safeEnd = mainSafeEnd;
+			start = mainStart;
+			if (keysPosition > 1) {
+				let newEnd = position + keysPosition - 1;
+				if (newEnd > safeEnd)
+					makeRoom(newEnd);
+				let insertionPosition = insertionOffset + start;
+				target.copyWithin(insertionPosition + keysPosition, insertionPosition + 1, position);
+				target.set(keysTarget.slice(0, keysPosition), insertionPosition);
+				position = newEnd;
+			} else {
+				target[insertionOffset + start] = keysTarget[0];
+			}
+		};
+	}
+	useBuffer(buffer) {
+		// this means we are finished using our own buffer and we can write over it safely
+		target = buffer;
+		target.dataView || (target.dataView = new DataView(target.buffer, target.byteOffset, target.byteLength));
+		targetView = target.dataView;
+		position = 0;
+	}
+	set position (value) {
+		position = value;
+	}
+	get position() {
+		return position;
+	}
+	clearSharedData() {
+		if (this.structures)
+			this.structures = [];
+		if (this.typedStructs)
+			this.typedStructs = [];
+	}
+}
+
+extensionClasses = [ Date, Set, Error, RegExp, ArrayBuffer, Object.getPrototypeOf(Uint8Array.prototype).constructor /*TypedArray*/, DataView, C1Type ];
+extensions = [{
+	pack(date, allocateForWrite, pack) {
+		let seconds = date.getTime() / 1000;
+		if ((this.useTimestamp32 || date.getMilliseconds() === 0) && seconds >= 0 && seconds < 0x100000000) {
+			// Timestamp 32
+			let { target, targetView, position} = allocateForWrite(6);
+			target[position++] = 0xd6;
+			target[position++] = 0xff;
+			targetView.setUint32(position, seconds);
+		} else if (seconds > 0 && seconds < 0x100000000) {
+			// Timestamp 64
+			let { target, targetView, position} = allocateForWrite(10);
+			target[position++] = 0xd7;
+			target[position++] = 0xff;
+			targetView.setUint32(position, date.getMilliseconds() * 4000000 + ((seconds / 1000 / 0x100000000) >> 0));
+			targetView.setUint32(position + 4, seconds);
+		} else if (isNaN(seconds)) {
+			if (this.onInvalidDate) {
+				allocateForWrite(0);
+				return pack(this.onInvalidDate());
+			}
+			// Intentionally invalid timestamp
+			let { target, targetView, position} = allocateForWrite(3);
+			target[position++] = 0xd4;
+			target[position++] = 0xff;
+			target[position++] = 0xff;
+		} else {
+			// Timestamp 96
+			let { target, targetView, position} = allocateForWrite(15);
+			target[position++] = 0xc7;
+			target[position++] = 12;
+			target[position++] = 0xff;
+			targetView.setUint32(position, date.getMilliseconds() * 1000000);
+			targetView.setBigInt64(position + 4, BigInt(Math.floor(seconds)));
+		}
+	}
+}, {
+	pack(set, allocateForWrite, pack) {
+		if (this.setAsEmptyObject) {
+			allocateForWrite(0);
+			return pack({});
+		}
+		let array = Array.from(set);
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x73; // 's' for Set
+			target[position++] = 0;
+		}
+		pack(array);
+	}
+}, {
+	pack(error, allocateForWrite, pack) {
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x65; // 'e' for error
+			target[position++] = 0;
+		}
+		pack([ error.name, error.message, error.cause ]);
+	}
+}, {
+	pack(regex, allocateForWrite, pack) {
+		let { target, position} = allocateForWrite(this.moreTypes ? 3 : 0);
+		if (this.moreTypes) {
+			target[position++] = 0xd4;
+			target[position++] = 0x78; // 'x' for regeXp
+			target[position++] = 0;
+		}
+		pack([ regex.source, regex.flags ]);
+	}
+}, {
+	pack(arrayBuffer, allocateForWrite) {
+		if (this.moreTypes)
+			writeExtBuffer(arrayBuffer, 0x10, allocateForWrite);
+		else
+			writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+	}
+}, {
+	pack(typedArray, allocateForWrite) {
+		let constructor = typedArray.constructor;
+		if (constructor !== ByteArray && this.moreTypes)
+			writeExtBuffer(typedArray, typedArrays.indexOf(constructor.name), allocateForWrite);
+		else
+			writeBuffer(typedArray, allocateForWrite);
+	}
+}, {
+	pack(arrayBuffer, allocateForWrite) {
+		if (this.moreTypes)
+			writeExtBuffer(arrayBuffer, 0x11, allocateForWrite);
+		else
+			writeBuffer(hasNodeBuffer ? Buffer.from(arrayBuffer) : new Uint8Array(arrayBuffer), allocateForWrite);
+	}
+}, {
+	pack(c1, allocateForWrite) { // specific 0xC1 object
+		let { target, position} = allocateForWrite(1);
+		target[position] = 0xc1;
+	}
+}];
+
+function writeExtBuffer(typedArray, type, allocateForWrite, encode) {
+	let length = typedArray.byteLength;
+	if (length + 1 < 0x100) {
+		var { target, position } = allocateForWrite(4 + length);
+		target[position++] = 0xc7;
+		target[position++] = length + 1;
+	} else if (length + 1 < 0x10000) {
+		var { target, position } = allocateForWrite(5 + length);
+		target[position++] = 0xc8;
+		target[position++] = (length + 1) >> 8;
+		target[position++] = (length + 1) & 0xff;
+	} else {
+		var { target, position, targetView } = allocateForWrite(7 + length);
+		target[position++] = 0xc9;
+		targetView.setUint32(position, length + 1); // plus one for the type byte
+		position += 4;
+	}
+	target[position++] = 0x74; // "t" for typed array
+	target[position++] = type;
+	if (!typedArray.buffer) typedArray = new Uint8Array(typedArray);
+	target.set(new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength), position);
+}
+function writeBuffer(buffer, allocateForWrite) {
+	let length = buffer.byteLength;
+	var target, position;
+	if (length < 0x100) {
+		var { target, position } = allocateForWrite(length + 2);
+		target[position++] = 0xc4;
+		target[position++] = length;
+	} else if (length < 0x10000) {
+		var { target, position } = allocateForWrite(length + 3);
+		target[position++] = 0xc5;
+		target[position++] = length >> 8;
+		target[position++] = length & 0xff;
+	} else {
+		var { target, position, targetView } = allocateForWrite(length + 5);
+		target[position++] = 0xc6;
+		targetView.setUint32(position, length);
+		position += 4;
+	}
+	target.set(buffer, position);
+}
+
+function writeExtensionData(result, target, position, type) {
+	let length = result.length;
+	switch (length) {
+		case 1:
+			target[position++] = 0xd4;
+			break;
+		case 2:
+			target[position++] = 0xd5;
+			break;
+		case 4:
+			target[position++] = 0xd6;
+			break;
+		case 8:
+			target[position++] = 0xd7;
+			break;
+		case 16:
+			target[position++] = 0xd8;
+			break;
+		default:
+			if (length < 0x100) {
+				target[position++] = 0xc7;
+				target[position++] = length;
+			} else if (length < 0x10000) {
+				target[position++] = 0xc8;
+				target[position++] = length >> 8;
+				target[position++] = length & 0xff;
+			} else {
+				target[position++] = 0xc9;
+				target[position++] = length >> 24;
+				target[position++] = (length >> 16) & 0xff;
+				target[position++] = (length >> 8) & 0xff;
+				target[position++] = length & 0xff;
+			}
+	}
+	target[position++] = type;
+	target.set(result, position);
+	position += length;
+	return position;
+}
+
+function insertIds(serialized, idsToInsert) {
+	// insert the ids that need to be referenced for structured clones
+	let nextId;
+	let distanceToMove = idsToInsert.length * 6;
+	let lastEnd = serialized.length - distanceToMove;
+	while (nextId = idsToInsert.pop()) {
+		let offset = nextId.offset;
+		let id = nextId.id;
+		serialized.copyWithin(offset + distanceToMove, offset, lastEnd);
+		distanceToMove -= 6;
+		let position = offset + distanceToMove;
+		serialized[position++] = 0xd6;
+		serialized[position++] = 0x69; // 'i'
+		serialized[position++] = id >> 24;
+		serialized[position++] = (id >> 16) & 0xff;
+		serialized[position++] = (id >> 8) & 0xff;
+		serialized[position++] = id & 0xff;
+		lastEnd = offset;
+	}
+	return serialized;
+}
+
+function writeBundles(start, pack, incrementPosition) {
+	if (bundledStrings.length > 0) {
+		targetView.setUint32(bundledStrings.position + start, position + incrementPosition - bundledStrings.position - start);
+		bundledStrings.stringsPosition = position - start;
+		let writeStrings = bundledStrings;
+		bundledStrings = null;
+		pack(writeStrings[0]);
+		pack(writeStrings[1]);
+	}
+}
+
+export function addExtension(extension) {
+	if (extension.Class) {
+		if (!extension.pack && !extension.write)
+			throw new Error('Extension has no pack or write function');
+		if (extension.pack && !extension.type)
+			throw new Error('Extension has no type (numeric code to identify the extension)');
+		extensionClasses.unshift(extension.Class);
+		extensions.unshift(extension);
+	}
+	unpackAddExtension(extension);
+}
+function prepareStructures(structures, packr) {
+	structures.isCompatible = (existingStructures) => {
+		let compatible = !existingStructures || ((packr.lastNamedStructuresLength || 0) === existingStructures.length);
+		if (!compatible) // we want to merge these existing structures immediately since we already have it and we are in the right transaction
+			packr._mergeStructures(existingStructures);
+		return compatible;
+	};
+	return structures;
+}
+
+// Marker for downstream libraries (e.g. structon) to detect that this Packr
+// supports per-instance struct-encoding hooks (this._writeStruct,
+// this._prepareStructures).  See `pack` for the dispatch.
+Packr.SUPPORTS_STRUCT_HOOKS = true;
+
+let defaultPackr = new Packr({ useRecords: false });
+export const pack = defaultPackr.pack;
+export const encode = defaultPackr.pack;
+export const Encoder = Packr;
+export { FLOAT32_OPTIONS } from './unpack.js';
+import { FLOAT32_OPTIONS } from './unpack.js';
+export const { NEVER, ALWAYS, DECIMAL_ROUND, DECIMAL_FIT } = FLOAT32_OPTIONS;
+export const REUSE_BUFFER_MODE = 512;
+export const RESET_BUFFER_MODE = 1024;
+export const RESERVE_START_SPACE = 2048;
diff --git a/node_modules/msgpackr/package.json b/node_modules/msgpackr/package.json
new file mode 100644
index 0000000..ffa70fc
--- /dev/null
+++ b/node_modules/msgpackr/package.json
@@ -0,0 +1,104 @@
+{
+  "name": "msgpackr",
+  "author": "Kris Zyp",
+  "version": "2.0.1",
+  "description": "Ultra-fast MessagePack implementation with extensions for records and structured cloning",
+  "license": "MIT",
+  "types": "./index.d.ts",
+  "main": "./dist/node.cjs",
+  "module": "./index.js",
+  "react-native": "./index.js",
+  "keywords": [
+    "MessagePack",
+    "msgpack",
+    "performance",
+    "structured",
+    "clone"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/kriszyp/msgpackr"
+  },
+  "scripts": {
+    "benchmark": "node ./tests/benchmark.cjs",
+    "build": "rollup -c && cpy index.d.ts . --rename=index.d.cts && cpy pack.d.ts . --rename=pack.d.cts && cpy unpack.d.ts . --rename=unpack.d.cts",
+    "dry-run": "npm publish --dry-run",
+    "prepare": "npm run build",
+    "test": "mocha tests/test**.*js -u tdd --experimental-json-modules"
+  },
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": {
+        "require": "./index.d.cts",
+        "import": "./index.d.ts"
+      },
+      "browser": "./index.js",
+      "node": {
+        "require": "./dist/node.cjs",
+        "import": "./node-index.js"
+      },
+      "bun": {
+        "require": "./dist/node.cjs",
+        "import": "./node-index.js"
+      },
+      "default": "./index.js"
+    },
+    "./pack": {
+      "types": {
+        "require": "./pack.d.cts",
+        "import": "./pack.d.ts"
+      },
+      "browser": "./pack.js",
+      "node": {
+        "import": "./index.js",
+        "require": "./dist/node.cjs"
+      },
+      "bun": {
+        "import": "./index.js",
+        "require": "./dist/node.cjs"
+      },
+      "default": "./pack.js"
+    },
+    "./unpack": {
+      "types": {
+        "require": "./unpack.d.cts",
+        "import": "./unpack.d.ts"
+      },
+      "browser": "./unpack.js",
+      "node": {
+        "import": "./index.js",
+        "require": "./dist/node.cjs"
+      },
+      "bun": {
+        "import": "./index.js",
+        "require": "./dist/node.cjs"
+      },
+      "default": "./unpack.js"
+    },
+    "./unpack-no-eval": "./dist/unpack-no-eval.cjs",
+    "./index-no-eval": "./dist/index-no-eval.cjs"
+  },
+  "files": [
+    "/dist",
+    "*.md",
+    "/*.js",
+    "/*.ts",
+    "/*.cts"
+  ],
+  "optionalDependencies": {
+    "msgpackr-extract": "^3.0.2"
+  },
+  "devDependencies": {
+    "@rollup/plugin-json": "^5.0.1",
+    "@rollup/plugin-replace": "^5.0.1",
+    "@types/node": "latest",
+    "async": "^3",
+    "chai": "^4.3.4",
+    "cpy-cli": "^4.1.0",
+    "esm": "^3.2.25",
+    "mocha": "^10.1.0",
+    "rollup": "^3.2.5",
+    "@rollup/plugin-terser": "^0.1.0"
+  }
+}
diff --git a/node_modules/msgpackr/rollup.config.js b/node_modules/msgpackr/rollup.config.js
new file mode 100644
index 0000000..7da70fb
--- /dev/null
+++ b/node_modules/msgpackr/rollup.config.js
@@ -0,0 +1,88 @@
+import terser from '@rollup/plugin-terser';
+import json from "@rollup/plugin-json";
+import replace from "@rollup/plugin-replace";
+
+export default [
+    {
+        input: "node-index.js",
+        output: [
+            {
+                file: "dist/node.cjs",
+                format: "cjs",
+                sourcemap: true
+            }
+        ]
+    },
+    {
+        input: "index.js",
+        output: {
+            file: "dist/index.js",
+            format: "umd",
+            name: "msgpackr",
+            sourcemap: true
+        }
+    },
+    {
+        input: "index.js",
+        plugins: [
+            replace({ Function: 'BlockedFunction '})
+        ],
+        output: {
+            file: "dist/index-no-eval.cjs",
+            format: "umd",
+            name: "msgpackr",
+            sourcemap: true
+        },
+    },
+    {
+        input: "unpack.js",
+        plugins: [
+            replace({ Function: 'BlockedFunction '})
+        ],
+        output: {
+            file: "dist/unpack-no-eval.cjs",
+            format: "umd",
+            name: "msgpackr",
+            sourcemap: true
+        },
+    },
+    {
+        input: "index.js",
+        plugins: [
+            terser({})
+        ],
+        output: {
+            file: "dist/index.min.js",
+            format: "umd",
+            name: "msgpackr",
+            sourcemap: true
+        }
+    },
+    {
+        input: "index.js",
+        plugins: [
+            replace({ Function: 'BlockedFunction '}),
+            terser({})
+        ],
+        output: {
+            file: "dist/index-no-eval.min.js",
+            format: "umd",
+            name: "msgpackr",
+            sourcemap: true
+        }
+    },
+    {
+        input: "tests/test.js",
+        plugins: [json()],
+        external: ['chai', '../index.js'],
+        output: {
+            file: "dist/test.js",
+            format: "iife",
+            sourcemap: true,
+            globals: {
+                chai: 'chai',
+                './index.js': 'msgpackr',
+            },
+        }
+    }
+];
diff --git a/node_modules/msgpackr/stream.js b/node_modules/msgpackr/stream.js
new file mode 100644
index 0000000..ffbb1e7
--- /dev/null
+++ b/node_modules/msgpackr/stream.js
@@ -0,0 +1,62 @@
+import { Transform } from 'stream';
+import { Packr } from './pack.js';
+import { Unpackr } from './unpack.js';
+var DEFAULT_OPTIONS = {objectMode: true};
+
+export class PackrStream extends Transform {
+	constructor(options) {
+		if (!options)
+			options = {};
+		options.writableObjectMode = true;
+		super(options);
+		options.sequential = true;
+		this.packr = options.packr || new Packr(options);
+	}
+	_transform(value, encoding, callback) {
+		this.push(this.packr.pack(value));
+		callback();
+	}
+}
+
+export class UnpackrStream extends Transform {
+	constructor(options) {
+		if (!options)
+			options = {};
+		options.objectMode = true;
+		super(options);
+		options.structures = [];
+		this.maxIncompleteBufferSize = options.maxIncompleteBufferSize !== undefined ? options.maxIncompleteBufferSize : 0x4000000;
+		this.unpackr = options.unpackr || new Unpackr(options);
+	}
+	_transform(chunk, encoding, callback) {
+		if (this.incompleteBuffer) {
+			chunk = Buffer.concat([this.incompleteBuffer, chunk]);
+			this.incompleteBuffer = null;
+		}
+		let values;
+		try {
+			values = this.unpackr.unpackMultiple(chunk);
+		} catch(error) {
+			if (error.incomplete) {
+				let incompleteBuffer = chunk.slice(error.lastPosition);
+				if (incompleteBuffer.length > this.maxIncompleteBufferSize) {
+					this.incompleteBuffer = null;
+					return callback(new Error('Maximum incomplete buffer size exceeded'));
+				}
+				this.incompleteBuffer = incompleteBuffer;
+				values = error.values;
+			} else {
+				return callback(error);
+			}
+		}
+		for (let value of values || []) {
+			if (value === null)
+				value = this.getNullValue();
+			this.push(value);
+		}
+		callback();
+	}
+	getNullValue() {
+		return Symbol.for(null);
+	}
+}
diff --git a/node_modules/msgpackr/test-worker.js b/node_modules/msgpackr/test-worker.js
new file mode 100644
index 0000000..511ab56
--- /dev/null
+++ b/node_modules/msgpackr/test-worker.js
@@ -0,0 +1,3 @@
+setTimeout(() => {
+console.log('done');
+}, 10000);
\ No newline at end of file
diff --git a/node_modules/msgpackr/unpack.d.cts b/node_modules/msgpackr/unpack.d.cts
new file mode 100644
index 0000000..9b0e0ff
--- /dev/null
+++ b/node_modules/msgpackr/unpack.d.cts
@@ -0,0 +1,2 @@
+export { Unpackr, Decoder, unpack, unpackMultiple, decode,
+	addExtension, FLOAT32_OPTIONS, Options, Extension, clearSource, roundFloat32 } from '.'
diff --git a/node_modules/msgpackr/unpack.d.ts b/node_modules/msgpackr/unpack.d.ts
new file mode 100644
index 0000000..9b0e0ff
--- /dev/null
+++ b/node_modules/msgpackr/unpack.d.ts
@@ -0,0 +1,2 @@
+export { Unpackr, Decoder, unpack, unpackMultiple, decode,
+	addExtension, FLOAT32_OPTIONS, Options, Extension, clearSource, roundFloat32 } from '.'
diff --git a/node_modules/msgpackr/unpack.js b/node_modules/msgpackr/unpack.js
new file mode 100644
index 0000000..0a63b9f
--- /dev/null
+++ b/node_modules/msgpackr/unpack.js
@@ -0,0 +1,1238 @@
+var decoder;
+try {
+	decoder = new TextDecoder();
+} catch(error) {}
+var src;
+var srcEnd;
+var position = 0;
+var alreadySet;
+const EMPTY_ARRAY = [];
+var strings = EMPTY_ARRAY;
+var stringPosition = 0;
+var currentUnpackr = {};
+var currentStructures;
+var srcString;
+var srcStringStart = 0;
+var srcStringEnd = 0;
+var bundledStrings;
+var referenceMap;
+var currentExtensions = [];
+var dataView;
+var defaultOptions = {
+	useRecords: false,
+	mapsAsObjects: true
+};
+export class C1Type {}
+export const C1 = new C1Type();
+C1.name = 'MessagePack 0xC1';
+var sequentialMode = false;
+var inlineObjectReadThreshold = 2;
+var BlockedFunction; // we use search and replace to change the next call to BlockedFunction to avoid CSP issues for
+
+export class Unpackr {
+	constructor(options) {
+		if (options) {
+			if (options.useRecords === false && options.mapsAsObjects === undefined)
+				options.mapsAsObjects = true;
+			if (options.sequential && options.trusted !== false) {
+				options.trusted = true;
+				if (!options.structures && options.useRecords != false) {
+					options.structures = [];
+					if (!options.maxSharedStructures)
+						options.maxSharedStructures = 0;
+				}
+			}
+			if (options.structures)
+				options.structures.sharedLength = options.structures.length;
+			else if (options.getStructures) {
+				(options.structures = []).uninitialized = true; // this is what we use to denote an uninitialized structures
+				options.structures.sharedLength = 0;
+			}
+			if (options.int64AsNumber) {
+				options.int64AsType = 'number';
+			}
+		}
+		Object.assign(this, options);
+	}
+	unpack(source, options) {
+		if (src) {
+			// re-entrant execution, save the state and restore it after we do this unpack
+			return saveState(() => {
+				clearSource();
+				return this ? this.unpack(source, options) : Unpackr.prototype.unpack.call(defaultOptions, source, options);
+			});
+		}
+		if (!source.buffer && source.constructor === ArrayBuffer)
+			source = typeof Buffer !== 'undefined' ? Buffer.from(source) : new Uint8Array(source);
+		if (typeof options === 'object') {
+			srcEnd = options.end || source.length;
+			position = options.start || 0;
+		} else {
+			position = 0;
+			srcEnd = options > -1 ? options : source.length;
+		}
+		stringPosition = 0;
+		srcStringEnd = 0;
+		srcString = null;
+		strings = EMPTY_ARRAY;
+		bundledStrings = null;
+		src = source;
+		// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
+		// technique for getting data from a database where it can be copied into an existing buffer instead of creating
+		// new ones
+		try {
+			dataView = source.dataView || (source.dataView = new DataView(source.buffer, source.byteOffset, source.byteLength));
+		} catch(error) {
+			// if it doesn't have a buffer, maybe it is the wrong type of object
+			src = null;
+			if (source instanceof Uint8Array)
+				throw error;
+			throw new Error('Source must be a Uint8Array or Buffer but was a ' + ((source && typeof source == 'object') ? source.constructor.name : typeof source));
+		}
+		if (this instanceof Unpackr) {
+			currentUnpackr = this;
+			if (this.structures) {
+				currentStructures = this.structures;
+				return checkedRead(options);
+			} else if (!currentStructures || currentStructures.length > 0) {
+				currentStructures = [];
+			}
+		} else {
+			currentUnpackr = defaultOptions;
+			if (!currentStructures || currentStructures.length > 0)
+				currentStructures = [];
+		}
+		return checkedRead(options);
+	}
+	unpackMultiple(source, forEach) {
+		let values, lastPosition = 0;
+		try {
+			sequentialMode = true;
+			let size = source.length;
+			let value = this ? this.unpack(source, size) : defaultUnpackr.unpack(source, size);
+			if (forEach) {
+				if (forEach(value, lastPosition, position) === false) return;
+				while(position < size) {
+					lastPosition = position;
+					if (forEach(checkedRead(), lastPosition, position) === false) {
+						return;
+					}
+				}
+			}
+			else {
+				values = [ value ];
+				while(position < size) {
+					lastPosition = position;
+					values.push(checkedRead());
+				}
+				return values;
+			}
+		} catch(error) {
+			error.lastPosition = lastPosition;
+			error.values = values;
+			throw error;
+		} finally {
+			sequentialMode = false;
+			clearSource();
+		}
+	}
+	_mergeStructures(loadedStructures, existingStructures) {
+		if (this._onLoadedStructures)
+			loadedStructures = this._onLoadedStructures(loadedStructures);
+		loadedStructures = loadedStructures || [];
+		if (Object.isFrozen(loadedStructures))
+			loadedStructures = loadedStructures.map(structure => structure.slice(0));
+		for (let i = 0, l = loadedStructures.length; i < l; i++) {
+			let structure = loadedStructures[i];
+			if (structure) {
+				structure.isShared = true;
+				if (i >= 32)
+					structure.highByte = (i - 32) >> 5;
+			}
+		}
+		loadedStructures.sharedLength = loadedStructures.length;
+		for (let id in existingStructures || []) {
+			if (id >= 0) {
+				let structure = loadedStructures[id];
+				let existing = existingStructures[id];
+				if (existing) {
+					if (structure)
+						(loadedStructures.restoreStructures || (loadedStructures.restoreStructures = []))[id] = structure;
+					loadedStructures[id] = existing;
+				}
+			}
+		}
+		return this.structures = loadedStructures;
+	}
+	decode(source, options) {
+		return this.unpack(source, options);
+	}
+}
+export function getPosition() {
+	return position;
+}
+export function checkedRead(options) {
+	try {
+		if (!currentUnpackr.trusted && !sequentialMode) {
+			let sharedLength = currentStructures.sharedLength || 0;
+			if (sharedLength < currentStructures.length)
+				currentStructures.length = sharedLength;
+		}
+		let result;
+		if (currentUnpackr._readStruct && src[position] < 0x40 && src[position] >= 0x20) {
+			result = currentUnpackr._readStruct(src, position, srcEnd);
+			src = null; // dispose of this so that recursive unpack calls don't save state
+			if (!(options && options.lazy) && result)
+				result = result.toJSON();
+			position = srcEnd;
+		} else
+			result = read();
+		if (bundledStrings) { // bundled strings to skip past
+			position = bundledStrings.postBundlePosition;
+			bundledStrings = null;
+		}
+		if (sequentialMode)
+			// we only need to restore the structures if there was an error, but if we completed a read,
+			// we can clear this out and keep the structures we read
+			currentStructures.restoreStructures = null;
+
+		if (position == srcEnd) {
+			// finished reading this source, cleanup references
+			if (currentStructures && currentStructures.restoreStructures)
+				restoreStructures();
+			currentStructures = null;
+			src = null;
+			if (referenceMap)
+				referenceMap = null;
+		} else if (position > srcEnd) {
+			// over read
+			throw new Error('Unexpected end of MessagePack data');
+		} else if (!sequentialMode) {
+			let jsonView;
+			try {
+				jsonView = JSON.stringify(result, (_, value) => typeof value === "bigint" ? `${value}n` : value).slice(0, 100);
+			} catch(error) {
+				jsonView = '(JSON view not available ' + error + ')';
+			}
+			throw new Error('Data read, but end of buffer not reached ' + jsonView);
+		}
+		// else more to read, but we are reading sequentially, so don't clear source yet
+		return result;
+	} catch(error) {
+		if (currentStructures && currentStructures.restoreStructures)
+			restoreStructures();
+		clearSource();
+		if (error instanceof RangeError || error.message.startsWith('Unexpected end of buffer') || position > srcEnd) {
+			error.incomplete = true;
+		}
+		throw error;
+	}
+}
+
+function restoreStructures() {
+	for (let id in currentStructures.restoreStructures) {
+		currentStructures[id] = currentStructures.restoreStructures[id];
+	}
+	currentStructures.restoreStructures = null;
+}
+
+export function read() {
+	let token = src[position++];
+	if (token < 0xa0) {
+		if (token < 0x80) {
+			if (token < 0x40)
+				return token;
+			else {
+				let structure = currentStructures[token & 0x3f] ||
+					currentUnpackr.getStructures && loadStructures()[token & 0x3f];
+				if (structure) {
+					if (!structure.read) {
+						structure.read = createStructureReader(structure, token & 0x3f);
+					}
+					return structure.read();
+				} else
+					return token;
+			}
+		} else if (token < 0x90) {
+			// map
+			token -= 0x80;
+			if (currentUnpackr.mapsAsObjects) {
+				let object = {};
+				for (let i = 0; i < token; i++) {
+					let key = readKey();
+					if (key === '__proto__')
+						key = '__proto_';
+					object[key] = read();
+				}
+				return object;
+			} else {
+				let map = new Map();
+				for (let i = 0; i < token; i++) {
+					map.set(read(), read());
+				}
+				return map;
+			}
+		} else {
+			token -= 0x90;
+			let array = new Array(token);
+			for (let i = 0; i < token; i++) {
+				array[i] = read();
+			}
+			if (currentUnpackr.freezeData)
+				return Object.freeze(array);
+			return array;
+		}
+	} else if (token < 0xc0) {
+		// fixstr
+		let length = token - 0xa0;
+		if (srcStringEnd >= position) {
+			return srcString.slice(position - srcStringStart, (position += length) - srcStringStart);
+		}
+		if (srcStringEnd == 0 && srcEnd < 140) {
+			// for small blocks, avoiding the overhead of the extract call is helpful
+			let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+			if (string != null)
+				return string;
+		}
+		return readFixedString(length);
+	} else {
+		let value;
+		switch (token) {
+			case 0xc0: return null;
+			case 0xc1:
+				if (bundledStrings) {
+					value = read(); // followed by the length of the string in characters (not bytes!)
+					if (value > 0)
+						return bundledStrings[1].slice(bundledStrings.position1, bundledStrings.position1 += value);
+					else
+						return bundledStrings[0].slice(bundledStrings.position0, bundledStrings.position0 -= value);
+				}
+				return C1; // "never-used", return special object to denote that
+			case 0xc2: return false;
+			case 0xc3: return true;
+			case 0xc4:
+				// bin 8
+				value = src[position++];
+				if (value === undefined)
+					throw new Error('Unexpected end of buffer');
+				return readBin(value);
+			case 0xc5:
+				// bin 16
+				value = dataView.getUint16(position);
+				position += 2;
+				return readBin(value);
+			case 0xc6:
+				// bin 32
+				value = dataView.getUint32(position);
+				position += 4;
+				return readBin(value);
+			case 0xc7:
+				// ext 8
+				return readExt(src[position++]);
+			case 0xc8:
+				// ext 16
+				value = dataView.getUint16(position);
+				position += 2;
+				return readExt(value);
+			case 0xc9:
+				// ext 32
+				value = dataView.getUint32(position);
+				position += 4;
+				return readExt(value);
+			case 0xca:
+				value = dataView.getFloat32(position);
+				if (currentUnpackr.useFloat32 > 2) {
+					// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+					let multiplier = mult10[((src[position] & 0x7f) << 1) | (src[position + 1] >> 7)];
+					position += 4;
+					return ((multiplier * value + (value > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+				}
+				position += 4;
+				return value;
+			case 0xcb:
+				value = dataView.getFloat64(position);
+				position += 8;
+				return value;
+			// uint handlers
+			case 0xcc:
+				return src[position++];
+			case 0xcd:
+				value = dataView.getUint16(position);
+				position += 2;
+				return value;
+			case 0xce:
+				value = dataView.getUint32(position);
+				position += 4;
+				return value;
+			case 0xcf:
+				if (currentUnpackr.int64AsType === 'number') {
+					value = dataView.getUint32(position) * 0x100000000;
+					value += dataView.getUint32(position + 4);
+				} else if (currentUnpackr.int64AsType === 'string') {
+					value = dataView.getBigUint64(position).toString();
+				} else if (currentUnpackr.int64AsType === 'auto') {
+					value = dataView.getBigUint64(position);
+					if (value<=BigInt(2)<<BigInt(52)) value=Number(value);
+				} else
+					value = dataView.getBigUint64(position);
+				position += 8;
+				return value;
+
+			// int handlers
+			case 0xd0:
+				return dataView.getInt8(position++);
+			case 0xd1:
+				value = dataView.getInt16(position);
+				position += 2;
+				return value;
+			case 0xd2:
+				value = dataView.getInt32(position);
+				position += 4;
+				return value;
+			case 0xd3:
+				if (currentUnpackr.int64AsType === 'number') {
+					value = dataView.getInt32(position) * 0x100000000;
+					value += dataView.getUint32(position + 4);
+				} else if (currentUnpackr.int64AsType === 'string') {
+					value = dataView.getBigInt64(position).toString();
+				} else if (currentUnpackr.int64AsType === 'auto') {
+					value = dataView.getBigInt64(position);
+					if (value>=BigInt(-2)<<BigInt(52)&&value<=BigInt(2)<<BigInt(52)) value=Number(value);
+				} else
+					value = dataView.getBigInt64(position);
+				position += 8;
+				return value;
+
+			case 0xd4:
+				// fixext 1
+				value = src[position++];
+				if (value == 0x72) {
+					return recordDefinition(src[position++] & 0x3f);
+				} else {
+					let extension = currentExtensions[value];
+					if (extension) {
+						if (extension.read) {
+							position++; // skip filler byte
+							return extension.read(read());
+						} else if (extension.noBuffer) {
+							position++; // skip filler byte
+							return extension();
+						} else
+							return extension(src.subarray(position, ++position));
+					} else
+						throw new Error('Unknown extension ' + value);
+				}
+			case 0xd5:
+				// fixext 2
+				value = src[position];
+				if (value == 0x72) {
+					position++;
+					return recordDefinition(src[position++] & 0x3f, src[position++]);
+				} else
+					return readExt(2);
+			case 0xd6:
+				// fixext 4
+				return readExt(4);
+			case 0xd7:
+				// fixext 8
+				return readExt(8);
+			case 0xd8:
+				// fixext 16
+				return readExt(16);
+			case 0xd9:
+			// str 8
+				value = src[position++];
+				if (srcStringEnd >= position) {
+					return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+				}
+				return readString8(value);
+			case 0xda:
+			// str 16
+				value = dataView.getUint16(position);
+				position += 2;
+				if (srcStringEnd >= position) {
+					return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+				}
+				return readString16(value);
+			case 0xdb:
+			// str 32
+				value = dataView.getUint32(position);
+				position += 4;
+				if (srcStringEnd >= position) {
+					return srcString.slice(position - srcStringStart, (position += value) - srcStringStart);
+				}
+				return readString32(value);
+			case 0xdc:
+			// array 16
+				value = dataView.getUint16(position);
+				position += 2;
+				return readArray(value);
+			case 0xdd:
+			// array 32
+				value = dataView.getUint32(position);
+				position += 4;
+				return readArray(value);
+			case 0xde:
+			// map 16
+				value = dataView.getUint16(position);
+				position += 2;
+				return readMap(value);
+			case 0xdf:
+			// map 32
+				value = dataView.getUint32(position);
+				position += 4;
+				return readMap(value);
+			default: // negative int
+				if (token >= 0xe0)
+					return token - 0x100;
+				if (token === undefined) {
+					let error = new Error('Unexpected end of MessagePack data');
+					error.incomplete = true;
+					throw error;
+				}
+				throw new Error('Unknown MessagePack token ' + token);
+
+		}
+	}
+}
+const validName = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+function createStructureReader(structure, firstId) {
+	function readObject() {
+		// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
+		if (readObject.count++ > inlineObjectReadThreshold) {
+			let optimizedReadObject;
+			try {
+				optimizedReadObject = structure.read = (new Function('r', 'return function(){return ' + (currentUnpackr.freezeData ? 'Object.freeze' : '') +
+					'({' + structure.map(key => key === '__proto__' ? '__proto_:r()' : validName.test(key) ? key + ':r()' : ('[' + JSON.stringify(key) + ']:r()')).join(',') + '})}'))(read);
+			} catch(error) {
+				// in CF workers, the new Function call could begin to fail at any point in time
+				inlineObjectReadThreshold = Infinity; // disable going forward
+				return readObject(); // recursively try again
+			}
+			if (structure.highByte === 0)
+				structure.read = createSecondByteReader(firstId, structure.read);
+			return optimizedReadObject(); // second byte is already read, if there is one so immediately read object
+		}
+		let object = {};
+		for (let i = 0, l = structure.length; i < l; i++) {
+			let key = structure[i];
+			if (key === '__proto__')
+				key = '__proto_';
+			object[key] = read();
+		}
+		if (currentUnpackr.freezeData)
+			return Object.freeze(object);
+		return object;
+	}
+	readObject.count = 0;
+	if (structure.highByte === 0) {
+		return createSecondByteReader(firstId, readObject);
+	}
+	return readObject;
+}
+
+const createSecondByteReader = (firstId, read0) => {
+	return function() {
+		let highByte = src[position++];
+		if (highByte === 0)
+			return read0();
+		let id = firstId < 32 ? -(firstId + (highByte << 5)) : firstId + (highByte << 5);
+		let structure = currentStructures[id] || loadStructures()[id];
+		if (!structure) {
+			throw new Error('Record id is not defined for ' + id);
+		}
+		if (!structure.read)
+			structure.read = createStructureReader(structure, firstId);
+		return structure.read();
+	};
+};
+
+export function loadStructures() {
+	let loadedStructures = saveState(() => {
+		// save the state in case getStructures modifies our buffer
+		src = null;
+		return currentUnpackr.getStructures();
+	});
+	return currentStructures = currentUnpackr._mergeStructures(loadedStructures, currentStructures);
+}
+
+var readFixedString = readStringJS;
+var readString8 = readStringJS;
+var readString16 = readStringJS;
+var readString32 = readStringJS;
+export let isNativeAccelerationEnabled = false;
+
+export function setExtractor(extractStrings) {
+	isNativeAccelerationEnabled = true;
+	readFixedString = readString(1);
+	readString8 = readString(2);
+	readString16 = readString(3);
+	readString32 = readString(5);
+	function readString(headerLength) {
+		return function readString(length) {
+			let string = strings[stringPosition++];
+			if (string == null) {
+				if (bundledStrings)
+					return readStringJS(length);
+				let byteOffset = src.byteOffset;
+				let extraction = extractStrings(position - headerLength + byteOffset, srcEnd + byteOffset, src.buffer);
+				if (typeof extraction == 'string') {
+					string = extraction;
+					strings = EMPTY_ARRAY;
+				} else {
+					strings = extraction;
+					stringPosition = 1;
+					srcStringEnd = 1; // even if a utf-8 string was decoded, must indicate we are in the midst of extracted strings and can't skip strings
+					string = strings[0];
+					if (string === undefined)
+						throw new Error('Unexpected end of buffer');
+				}
+			}
+			let srcStringLength = string.length;
+			if (srcStringLength <= length) {
+				position += length;
+				return string;
+			}
+			srcString = string;
+			srcStringStart = position;
+			srcStringEnd = position + srcStringLength;
+			position += length;
+			return string.slice(0, length); // we know we just want the beginning
+		};
+	}
+}
+function readStringJS(length) {
+	let result;
+	if (length < 16) {
+		if (result = shortStringInJS(length))
+			return result;
+	}
+	if (length > 64 && decoder)
+		return decoder.decode(src.subarray(position, position += length));
+	const end = position + length;
+	const units = [];
+	result = '';
+	while (position < end) {
+		const byte1 = src[position++];
+		if ((byte1 & 0x80) === 0) {
+			// 1 byte
+			units.push(byte1);
+		} else if ((byte1 & 0xe0) === 0xc0) {
+			// 2 bytes
+			const byte2 = src[position++] & 0x3f;
+			const codePoint = ((byte1 & 0x1f) << 6) | byte2;
+			// Reject overlong encoding: 2-byte sequences must encode values >= 0x80
+			if (codePoint < 0x80) {
+				units.push(0xFFFD); // replacement character
+			} else {
+				units.push(codePoint);
+			}
+		} else if ((byte1 & 0xf0) === 0xe0) {
+			// 3 bytes
+			const byte2 = src[position++] & 0x3f;
+			const byte3 = src[position++] & 0x3f;
+			const codePoint = ((byte1 & 0x1f) << 12) | (byte2 << 6) | byte3;
+			// Reject overlong encoding: 3-byte sequences must encode values >= 0x800
+			// Also reject surrogates (0xD800-0xDFFF)
+			if (codePoint < 0x800 || (codePoint >= 0xD800 && codePoint <= 0xDFFF)) {
+				units.push(0xFFFD); // replacement character
+			} else {
+				units.push(codePoint);
+			}
+		} else if ((byte1 & 0xf8) === 0xf0) {
+			// 4 bytes
+			const byte2 = src[position++] & 0x3f;
+			const byte3 = src[position++] & 0x3f;
+			const byte4 = src[position++] & 0x3f;
+			let unit = ((byte1 & 0x07) << 0x12) | (byte2 << 0x0c) | (byte3 << 0x06) | byte4;
+			// Reject overlong encoding: 4-byte sequences must encode values >= 0x10000
+			// Also reject values > 0x10FFFF (maximum valid Unicode)
+			if (unit < 0x10000 || unit > 0x10FFFF) {
+				units.push(0xFFFD); // replacement character
+			} else if (unit > 0xffff) {
+				unit -= 0x10000;
+				units.push(((unit >>> 10) & 0x3ff) | 0xd800);
+				unit = 0xdc00 | (unit & 0x3ff);
+				units.push(unit);
+			} else {
+				units.push(unit);
+			}
+		} else {
+			units.push(0xFFFD); // replacement character for invalid lead byte
+		}
+
+		if (units.length >= 0x1000) {
+			result += fromCharCode.apply(String, units);
+			units.length = 0;
+		}
+	}
+
+	if (units.length > 0) {
+		result += fromCharCode.apply(String, units);
+	}
+
+	return result;
+}
+export function readString(source, start, length) {
+	let existingSrc = src;
+	src = source;
+	position = start;
+	try {
+		return readStringJS(length);
+	} finally {
+		src = existingSrc;
+	}
+}
+
+function readArray(length) {
+	let array = new Array(length);
+	for (let i = 0; i < length; i++) {
+		array[i] = read();
+	}
+	if (currentUnpackr.freezeData)
+		return Object.freeze(array);
+	return array;
+}
+
+function readMap(length) {
+	if (currentUnpackr.mapsAsObjects) {
+		let object = {};
+		for (let i = 0; i < length; i++) {
+			let key = readKey();
+			if (key === '__proto__')
+				key = '__proto_';
+			object[key] = read();
+		}
+		return object;
+	} else {
+		let map = new Map();
+		for (let i = 0; i < length; i++) {
+			map.set(read(), read());
+		}
+		return map;
+	}
+}
+
+var fromCharCode = String.fromCharCode;
+function longStringInJS(length) {
+	let start = position;
+	let bytes = new Array(length);
+	for (let i = 0; i < length; i++) {
+		const byte = src[position++];
+		if ((byte & 0x80) > 0) {
+				position = start;
+				return;
+			}
+			bytes[i] = byte;
+		}
+		return fromCharCode.apply(String, bytes);
+}
+function shortStringInJS(length) {
+	if (length < 4) {
+		if (length < 2) {
+			if (length === 0)
+				return '';
+			else {
+				let a = src[position++];
+				if ((a & 0x80) > 1) {
+					position -= 1;
+					return;
+				}
+				return fromCharCode(a);
+			}
+		} else {
+			let a = src[position++];
+			let b = src[position++];
+			if ((a & 0x80) > 0 || (b & 0x80) > 0) {
+				position -= 2;
+				return;
+			}
+			if (length < 3)
+				return fromCharCode(a, b);
+			let c = src[position++];
+			if ((c & 0x80) > 0) {
+				position -= 3;
+				return;
+			}
+			return fromCharCode(a, b, c);
+		}
+	} else {
+		let a = src[position++];
+		let b = src[position++];
+		let c = src[position++];
+		let d = src[position++];
+		if ((a & 0x80) > 0 || (b & 0x80) > 0 || (c & 0x80) > 0 || (d & 0x80) > 0) {
+			position -= 4;
+			return;
+		}
+		if (length < 6) {
+			if (length === 4)
+				return fromCharCode(a, b, c, d);
+			else {
+				let e = src[position++];
+				if ((e & 0x80) > 0) {
+					position -= 5;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e);
+			}
+		} else if (length < 8) {
+			let e = src[position++];
+			let f = src[position++];
+			if ((e & 0x80) > 0 || (f & 0x80) > 0) {
+				position -= 6;
+				return;
+			}
+			if (length < 7)
+				return fromCharCode(a, b, c, d, e, f);
+			let g = src[position++];
+			if ((g & 0x80) > 0) {
+				position -= 7;
+				return;
+			}
+			return fromCharCode(a, b, c, d, e, f, g);
+		} else {
+			let e = src[position++];
+			let f = src[position++];
+			let g = src[position++];
+			let h = src[position++];
+			if ((e & 0x80) > 0 || (f & 0x80) > 0 || (g & 0x80) > 0 || (h & 0x80) > 0) {
+				position -= 8;
+				return;
+			}
+			if (length < 10) {
+				if (length === 8)
+					return fromCharCode(a, b, c, d, e, f, g, h);
+				else {
+					let i = src[position++];
+					if ((i & 0x80) > 0) {
+						position -= 9;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i);
+				}
+			} else if (length < 12) {
+				let i = src[position++];
+				let j = src[position++];
+				if ((i & 0x80) > 0 || (j & 0x80) > 0) {
+					position -= 10;
+					return;
+				}
+				if (length < 11)
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j);
+				let k = src[position++];
+				if ((k & 0x80) > 0) {
+					position -= 11;
+					return;
+				}
+				return fromCharCode(a, b, c, d, e, f, g, h, i, j, k);
+			} else {
+				let i = src[position++];
+				let j = src[position++];
+				let k = src[position++];
+				let l = src[position++];
+				if ((i & 0x80) > 0 || (j & 0x80) > 0 || (k & 0x80) > 0 || (l & 0x80) > 0) {
+					position -= 12;
+					return;
+				}
+				if (length < 14) {
+					if (length === 12)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l);
+					else {
+						let m = src[position++];
+						if ((m & 0x80) > 0) {
+							position -= 13;
+							return;
+						}
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m);
+					}
+				} else {
+					let m = src[position++];
+					let n = src[position++];
+					if ((m & 0x80) > 0 || (n & 0x80) > 0) {
+						position -= 14;
+						return;
+					}
+					if (length < 15)
+						return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n);
+					let o = src[position++];
+					if ((o & 0x80) > 0) {
+						position -= 15;
+						return;
+					}
+					return fromCharCode(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o);
+				}
+			}
+		}
+	}
+}
+
+function readOnlyJSString() {
+	let token = src[position++];
+	let length;
+	if (token < 0xc0) {
+		// fixstr
+		length = token - 0xa0;
+	} else {
+		switch(token) {
+			case 0xd9:
+			// str 8
+				length = src[position++];
+				break;
+			case 0xda:
+			// str 16
+				length = dataView.getUint16(position);
+				position += 2;
+				break;
+			case 0xdb:
+			// str 32
+				length = dataView.getUint32(position);
+				position += 4;
+				break;
+			default:
+				throw new Error('Expected string');
+		}
+	}
+	return readStringJS(length);
+}
+
+
+function readBin(length) {
+	return currentUnpackr.copyBuffers ?
+		// specifically use the copying slice (not the node one)
+		Uint8Array.prototype.slice.call(src, position, position += length) :
+		src.subarray(position, position += length);
+}
+function readExt(length) {
+	let type = src[position++];
+	if (currentExtensions[type]) {
+		let end;
+		return currentExtensions[type](src.subarray(position, end = (position += length)), (readPosition) => {
+			position = readPosition;
+			try {
+				return read();
+			} finally {
+				position = end;
+			}
+		});
+	}
+	else
+		throw new Error('Unknown extension type ' + type);
+}
+
+var keyCache = new Array(4096);
+function readKey() {
+	let length = src[position++];
+	if (length >= 0xa0 && length < 0xc0) {
+		// fixstr, potentially use key cache
+		length = length - 0xa0;
+		if (srcStringEnd >= position) // if it has been extracted, must use it (and faster anyway)
+			return srcString.slice(position - srcStringStart, (position += length) - srcStringStart);
+		else if (!(srcStringEnd == 0 && srcEnd < 180))
+			return readFixedString(length);
+	} else { // not cacheable, go back and do a standard read
+		position--;
+		return asSafeString(read());
+	}
+	let key = ((length << 5) ^ (length > 1 ? dataView.getUint16(position) : length > 0 ? src[position] : 0)) & 0xfff;
+	let entry = keyCache[key];
+	let checkPosition = position;
+	let end = position + length - 3;
+	let chunk;
+	let i = 0;
+	if (entry && entry.bytes == length) {
+		while (checkPosition < end) {
+			chunk = dataView.getUint32(checkPosition);
+			if (chunk != entry[i++]) {
+				checkPosition = 0x70000000;
+				break;
+			}
+			checkPosition += 4;
+		}
+		end += 3;
+		while (checkPosition < end) {
+			chunk = src[checkPosition++];
+			if (chunk != entry[i++]) {
+				checkPosition = 0x70000000;
+				break;
+			}
+		}
+		if (checkPosition === end) {
+			position = checkPosition;
+			return entry.string;
+		}
+		end -= 3;
+		checkPosition = position;
+	}
+	entry = [];
+	keyCache[key] = entry;
+	entry.bytes = length;
+	while (checkPosition < end) {
+		chunk = dataView.getUint32(checkPosition);
+		entry.push(chunk);
+		checkPosition += 4;
+	}
+	end += 3;
+	while (checkPosition < end) {
+		chunk = src[checkPosition++];
+		entry.push(chunk);
+	}
+	// for small blocks, avoiding the overhead of the extract call is helpful
+	let string = length < 16 ? shortStringInJS(length) : longStringInJS(length);
+	if (string != null)
+		return entry.string = string;
+	return entry.string = readFixedString(length);
+}
+
+function asSafeString(property) {
+	// protect against expensive (DoS) string conversions
+	if (typeof property === 'string') return property;
+	if (typeof property === 'number' || typeof property === 'boolean' || typeof property === 'bigint') return property.toString();
+	if (property == null) return property + '';
+	if (currentUnpackr.allowArraysInMapKeys && Array.isArray(property) && property.flat().every(item => ['string', 'number', 'boolean', 'bigint'].includes(typeof item))) {
+		return property.flat().toString();
+	}
+	throw new Error(`Invalid property type for record: ${typeof property}`);
+}
+// the registration of the record definition extension (as "r")
+const recordDefinition = (id, highByte) => {
+	let structure = read().map(asSafeString); // ensure that all keys are strings and
+	// that the array is mutable
+	let firstByte = id;
+	if (highByte !== undefined) {
+		id = id < 32 ? -((highByte << 5) + id) : ((highByte << 5) + id);
+		structure.highByte = highByte;
+	}
+	let existingStructure = currentStructures[id];
+	// If it is a shared structure, we need to restore any changes after reading.
+	// Also in sequential mode, we may get incomplete reads and thus errors, and we need to restore
+	// to the state prior to an incomplete read in order to properly resume.
+	if (existingStructure && (existingStructure.isShared || sequentialMode)) {
+		(currentStructures.restoreStructures || (currentStructures.restoreStructures = []))[id] = existingStructure;
+	}
+	currentStructures[id] = structure;
+	structure.read = createStructureReader(structure, firstByte);
+	return structure.read();
+};
+currentExtensions[0] = () => {}; // notepack defines extension 0 to mean undefined, so use that as the default here
+currentExtensions[0].noBuffer = true;
+
+currentExtensions[0x42] = data => {
+	let headLength = (data.byteLength % 8) || 8;
+	let head = BigInt(data[0] & 0x80 ? data[0] - 0x100 : data[0]);
+	for (let i = 1; i < headLength; i++) {
+		head <<= BigInt(8);
+		head += BigInt(data[i]);
+	}
+	if (data.byteLength !== headLength) {
+		let view = new DataView(data.buffer, data.byteOffset, data.byteLength);
+		let decode = (start, end) => {
+			let length = end - start;
+			if (length <= 40) {
+				let out = view.getBigUint64(start);
+				for (let i = start + 8; i < end; i += 8) {
+					out <<= BigInt(64);
+					out |= view.getBigUint64(i);
+				}
+				return out;
+			}
+			// if (length === 8) return view.getBigUint64(start)
+			let middle = start + (length >> 4 << 3);
+			let left = decode(start, middle);
+			let right = decode(middle, end);
+			return (left << BigInt((end - middle) * 8)) | right;
+		};
+		head = (head << BigInt((view.byteLength - headLength) * 8)) | decode(headLength, view.byteLength);
+	}
+	return head;
+};
+
+let errors = {
+	Error, EvalError, RangeError, ReferenceError, SyntaxError, TypeError, URIError, AggregateError: typeof AggregateError === 'function' ? AggregateError : null,
+};
+currentExtensions[0x65] = () => {
+	let data = read();
+	if (!errors[data[0]]) {
+		let error = Error(data[1], { cause: data[2] });
+		error.name = data[0];
+		return error;
+	}
+	return errors[data[0]](data[1], { cause: data[2] });
+};
+
+currentExtensions[0x69] = (data) => {
+	// id extension (for structured clones)
+	if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+	let id = dataView.getUint32(position - 4);
+	if (!referenceMap)
+		referenceMap = new Map();
+	let token = src[position];
+	let target;
+	// TODO: handle any other types that can cycle and make the code more robust if there are other extensions
+	if (token >= 0x90 && token < 0xa0 || token == 0xdc || token == 0xdd)
+		target = [];
+	else if (token >= 0x80 && token < 0x90 || token == 0xde || token == 0xdf)
+		target = new Map();
+	else if ((token >= 0xc7 && token <= 0xc9 || token >= 0xd4 && token <= 0xd8) && src[position + 1] === 0x73)
+		target = new Set();
+	else
+		target = {};
+
+	let refEntry = { target }; // a placeholder object
+	referenceMap.set(id, refEntry);
+	let targetProperties = read(); // read the next value as the target object to id
+	if (!refEntry.used) {
+		// no cycle, can just use the returned read object
+		return refEntry.target = targetProperties; // replace the placeholder with the real one
+	} else {
+		// there is a cycle, so we have to assign properties to original target
+		Object.assign(target, targetProperties);
+	}
+
+	// copy over map/set entries if we're able to
+	if (target instanceof Map)
+		for (let [k, v] of targetProperties.entries()) target.set(k, v);
+	if (target instanceof Set)
+		for (let i of Array.from(targetProperties)) target.add(i);
+	return target;
+};
+
+currentExtensions[0x70] = (data) => {
+	// pointer extension (for structured clones)
+	if (currentUnpackr.structuredClone === false) throw new Error('Structured clone extension is disabled');
+	let id = dataView.getUint32(position - 4);
+	let refEntry = referenceMap.get(id);
+	refEntry.used = true;
+	return refEntry.target;
+};
+
+currentExtensions[0x73] = () => new Set(read());
+
+export const typedArrays = ['Int8','Uint8','Uint8Clamped','Int16','Uint16','Int32','Uint32','Float32','Float64','BigInt64','BigUint64'].map(type => type + 'Array');
+
+let glbl = typeof globalThis === 'object' ? globalThis : window;
+currentExtensions[0x74] = (data) => {
+	let typeCode = data[0];
+	// we always have to slice to get a new ArrayBuffer that is aligned
+	let buffer = Uint8Array.prototype.slice.call(data, 1).buffer;
+
+	let typedArrayName = typedArrays[typeCode];
+	if (!typedArrayName) {
+		if (typeCode === 16) return buffer;
+		if (typeCode === 17) return new DataView(buffer);
+		throw new Error('Could not find typed array for code ' + typeCode);
+	}
+	return new glbl[typedArrayName](buffer);
+};
+currentExtensions[0x78] = () => {
+	let data = read();
+	return new RegExp(data[0], data[1]);
+};
+const TEMP_BUNDLE = [];
+currentExtensions[0x62] = (data) => {
+	let dataSize = (data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3];
+	let dataPosition = position;
+	position += dataSize - data.length;
+	bundledStrings = TEMP_BUNDLE;
+	bundledStrings = [readOnlyJSString(), readOnlyJSString()];
+	bundledStrings.position0 = 0;
+	bundledStrings.position1 = 0;
+	bundledStrings.postBundlePosition = position;
+	position = dataPosition;
+	return read();
+};
+
+currentExtensions[0xff] = (data) => {
+	// 32-bit date extension
+	if (data.length == 4)
+		return new Date((data[0] * 0x1000000 + (data[1] << 16) + (data[2] << 8) + data[3]) * 1000);
+	else if (data.length == 8)
+		return new Date(
+			((data[0] << 22) + (data[1] << 14) + (data[2] << 6) + (data[3] >> 2)) / 1000000 +
+			((data[3] & 0x3) * 0x100000000 + data[4] * 0x1000000 + (data[5] << 16) + (data[6] << 8) + data[7]) * 1000);
+	else if (data.length == 12)
+		return new Date(
+			((data[0] << 24) + (data[1] << 16) + (data[2] << 8) + data[3]) / 1000000 +
+			(((data[4] & 0x80) ? -0x1000000000000 : 0) + data[6] * 0x10000000000 + data[7] * 0x100000000 + data[8] * 0x1000000 + (data[9] << 16) + (data[10] << 8) + data[11]) * 1000);
+	else
+		return new Date('invalid');
+};
+// registration of bulk record definition?
+// currentExtensions[0x52] = () =>
+
+function saveState(callback) {
+	if (currentUnpackr && currentUnpackr._onSaveState)
+		currentUnpackr._onSaveState();
+	let savedSrcEnd = srcEnd;
+	let savedPosition = position;
+	let savedStringPosition = stringPosition;
+	let savedSrcStringStart = srcStringStart;
+	let savedSrcStringEnd = srcStringEnd;
+	let savedSrcString = srcString;
+	let savedStrings = strings;
+	let savedReferenceMap = referenceMap;
+	let savedBundledStrings = bundledStrings;
+
+	// TODO: We may need to revisit this if we do more external calls to user code (since it could be slow)
+	let savedSrc = new Uint8Array(src.slice(0, srcEnd)); // we copy the data in case it changes while external data is processed
+	let savedStructures = currentStructures;
+	let savedStructuresContents = currentStructures.slice(0, currentStructures.length);
+	let savedPackr = currentUnpackr;
+	let savedSequentialMode = sequentialMode;
+	let value = callback();
+	srcEnd = savedSrcEnd;
+	position = savedPosition;
+	stringPosition = savedStringPosition;
+	srcStringStart = savedSrcStringStart;
+	srcStringEnd = savedSrcStringEnd;
+	srcString = savedSrcString;
+	strings = savedStrings;
+	referenceMap = savedReferenceMap;
+	bundledStrings = savedBundledStrings;
+	src = savedSrc;
+	sequentialMode = savedSequentialMode;
+	currentStructures = savedStructures;
+	currentStructures.splice(0, currentStructures.length, ...savedStructuresContents);
+	currentUnpackr = savedPackr;
+	dataView = new DataView(src.buffer, src.byteOffset, src.byteLength);
+	return value;
+}
+export function clearSource() {
+	src = null;
+	referenceMap = null;
+	currentStructures = null;
+}
+
+export function addExtension(extension) {
+	if (extension.unpack)
+		currentExtensions[extension.type] = extension.unpack;
+	else
+		currentExtensions[extension.type] = extension;
+}
+
+export const mult10 = new Array(147); // this is a table matching binary exponents to the multiplier to determine significant digit rounding
+for (let i = 0; i < 256; i++) {
+	mult10[i] = +('1e' + Math.floor(45.15 - i * 0.30103));
+}
+export const Decoder = Unpackr;
+var defaultUnpackr = new Unpackr({ useRecords: false });
+export const unpack = defaultUnpackr.unpack;
+export const unpackMultiple = defaultUnpackr.unpackMultiple;
+export const decode = defaultUnpackr.unpack;
+export const FLOAT32_OPTIONS = {
+	NEVER: 0,
+	ALWAYS: 1,
+	DECIMAL_ROUND: 3,
+	DECIMAL_FIT: 4
+};
+let f32Array = new Float32Array(1);
+let u8Array = new Uint8Array(f32Array.buffer, 0, 4);
+export function roundFloat32(float32Number) {
+	f32Array[0] = float32Number;
+	let multiplier = mult10[((u8Array[3] & 0x7f) << 1) | (u8Array[2] >> 7)];
+	return ((multiplier * float32Number + (float32Number > 0 ? 0.5 : -0.5)) >> 0) / multiplier;
+}
+// Marker for downstream libraries (e.g. structon) to detect per-instance
+// struct-decoding hooks (this._readStruct, this._onLoadedStructures,
+// this._onSaveState).  See `checkedRead` for the dispatch.
+Unpackr.SUPPORTS_STRUCT_HOOKS = true;
diff --git a/node_modules/node-abort-controller/.github/workflows/test.yml b/node_modules/node-abort-controller/.github/workflows/test.yml
new file mode 100644
index 0000000..b8782ca
--- /dev/null
+++ b/node_modules/node-abort-controller/.github/workflows/test.yml
@@ -0,0 +1,21 @@
+name: Test
+
+on:
+  push:
+    branches: ["master"]
+  pull_request:
+    branches: ["master"]
+
+jobs:
+  test:
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@v3
+      - name: Use Node.js 14.6.x
+        uses: actions/setup-node@v3
+        with:
+          node-version: 14.6.x
+          cache: "npm"
+      - run: npm ci
+      - run: npm test
diff --git a/node_modules/node-abort-controller/CHANGELOG.md b/node_modules/node-abort-controller/CHANGELOG.md
new file mode 100644
index 0000000..e1b7894
--- /dev/null
+++ b/node_modules/node-abort-controller/CHANGELOG.md
@@ -0,0 +1,40 @@
+# 3.0.0
+
+Removes default exports for AbortController. You must now import the `AbortController` object explicitly. This is a breaking change for some users relying on default exports. Upgrading to 3.0 is a one line change:
+
+```js
+// ES Modules Users
+// v2
+import AbortController from "node-abort-controller";
+
+// v3
+import { AbortController } from "node-abort-controller";
+
+// Common JS Users
+// v2
+const AbortController = require("node-abort-controller");
+
+// v3
+const { AbortController } = require("node-abort-controller");
+```
+
+Other changes:
+
+- Fix typos in docs
+- Update all dev dependencies to resolve deprecation warnings
+
+# 2.0.0
+
+- Export AbortSignal class. This is a non-breaking change for JavaScript users and almost surely a non-breaking change for TypeScript users but we are doing a major version bump to be safe.
+
+# 1.2.0
+
+- Remove dependency on lib.dom for types that was conflicting with NodeJS types
+
+# 1.1.0
+
+- Add proper EventTarget support to signal and `signal.onabort`
+
+# 1.0.4
+
+- Initial Stable Release
diff --git a/node_modules/node-abort-controller/LICENSE b/node_modules/node-abort-controller/LICENSE
new file mode 100644
index 0000000..aa8c39e
--- /dev/null
+++ b/node_modules/node-abort-controller/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2019 Steve Faulkner
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/node-abort-controller/README.md b/node_modules/node-abort-controller/README.md
new file mode 100644
index 0000000..d6724c3
--- /dev/null
+++ b/node_modules/node-abort-controller/README.md
@@ -0,0 +1,100 @@
+# node-abort-controller
+
+AbortController Polyfill for Node.JS based on EventEmitter for Node v14.6.x and below.
+
+Are you using Node 14.7.0 or above? You don't need this! [Node has `AbortController` and `AbortSignal` as builtin globals](https://nodejs.org/dist/latest/docs/api/globals.html#globals_class_abortcontroller). In Node versions >=14.7.0 and <15.4.0 you can access the experimental implementation using `--experimental-abortcontroller`.
+
+## Example Usage
+
+### Timing out `fetch`
+
+```javascript
+import fetch from "node-fetch";
+import { AbortController } from "node-abort-controller";
+
+const controller = new AbortController();
+const signal = controller.signal;
+
+await fetch("https:/www.google.com", { signal });
+
+// Abort fetch after 500ms. Effectively a timeout
+setTimeout(() => controller.abort(), 500);
+```
+
+### Re-usable `fetch` function with a built in timeout
+
+```javascript
+import { AbortController } from "node-abort-controller";
+import fetch from "node-fetch";
+
+const fetchWithTimeout = async (url = "") => {
+  const controller = new AbortController();
+  const { signal } = controller;
+
+  const timeout = setTimeout(() => {
+    controller.abort();
+  }, 5000);
+
+  const request = await fetch(url, { signal });
+
+  clearTimeout(timeout);
+
+  const result = await req.json();
+
+  return result;
+};
+```
+
+## Why would I need this?
+
+You might not need to! Generally speaking, there are three environments your JavaScript code can run in:
+
+- Node
+- Modern Browsers (Not Internet Explorer)
+- Legacy Browsers (Mostly Internet Explorer)
+
+For modern JS APIs, each environment would ideally get a polyfill:
+
+- only if it needs one
+- specific to the platform.
+
+In practice, this is hard. Tooling such as webpack and browserify are great at making sure stuff works out of the box in all environments. But it is quite easy to fail on both points above. In all likelyhood, you end up shipping less than ideal polyfills on platforms that don't even need them. So what is a developer to do? In the case of `fetch` and `AbortController` I've done the work for you. This is a guide to that work.
+
+If you are building a ...
+
+#### NodeJS library only supports Node 16 or above
+
+You don't need this library! [`AbortController` is now built into nodeJS ](https://nodejs.org/api/globals.html#globals_class_abortcontroller). Use that instead.
+
+#### Web Application running only in modern browsers
+
+You don't need a library! Close this tab. Uninstall this package.
+
+#### Web Application running in modern browsers AND NodeJS (such as a server side rendered JS app)
+
+Use _this package_ and [node-fetch](https://www.npmjs.com/package/node-fetch). It is minimally what you need.
+
+#### Web Application supporting legacy browsers AND NOT NodeJS
+
+Use [abort-controller](https://www.npmjs.com/package/abort-controller) and [whatwg-fetch](https://www.npmjs.com/package/whatwg-fetch). These are more complete polyfills that will work in all browser environments.
+
+#### Web Application supporting legacy browsers AND NodeJS
+
+Use [abort-controller](https://www.npmjs.com/package/abort-controller) and [cross-fetch](https://www.npmjs.com/package/cross-fetch). Same as above, except cross-fetch will polyfill correctly in both the browser and node.js
+
+#### NodeJS Library being consumed by other applications and using `fetch` internally
+
+Use _this package_ and [node-fetch](https://www.npmjs.com/package/node-fetch). It is the smallest and least opinionated combination for your end users. Application developers targeting Internet Exploer will need to polyfill `AbortController` and `fetch` on their own. But your library won't be forcing unecessary polyfills on developers who only target modern browsers.
+
+## Goals
+
+With the above guide in mind, this library has a very specific set of goals:
+
+1. Provide a minimal polyfill in node.js
+2. Do not provide a polyfill in any browser environment
+
+This is the ideal for _library authors_ who use `fetch` and `AbortController` internally and target _both_ browser and node developers.
+
+## Prior Art
+
+Thank you @mysticatea for https://github.com/mysticatea/abort-controller. It is a fantastic `AbortController` polyfill and ideal for many use cases.
diff --git a/node_modules/node-abort-controller/__tests__/abort-controller.js b/node_modules/node-abort-controller/__tests__/abort-controller.js
new file mode 100644
index 0000000..bf7e751
--- /dev/null
+++ b/node_modules/node-abort-controller/__tests__/abort-controller.js
@@ -0,0 +1,46 @@
+const { AbortController } = require("../index.js");
+
+describe("AbortController", function () {
+  it("should call abort handlers once", function () {
+    const controller = new AbortController();
+    const signal = controller.signal;
+    const handler = jest.fn();
+
+    expect(signal.onabort).toBeNull();
+    expect(signal.aborted).toBe(false);
+    expect(signal.reason).toBeUndefined();
+
+    signal.onabort = jest.fn();
+    signal.addEventListener("abort", handler);
+
+    controller.abort();
+
+    expect(signal.aborted).toBe(true);
+    expect(signal.reason).toEqual(new Error("AbortError"));
+    expect(handler).toBeCalledTimes(1);
+    expect(handler).toBeCalledWith({ type: "abort", target: signal });
+    expect(signal.onabort).toBeCalledTimes(1);
+    expect(signal.onabort).toBeCalledWith({ type: "abort", target: signal });
+
+    jest.clearAllMocks();
+    controller.abort();
+
+    expect(signal.aborted).toBe(true);
+    expect(signal.reason).toEqual(new Error("AbortError"));
+    expect(handler).not.toBeCalled();
+    expect(signal.onabort).not.toBeCalled();
+  });
+
+  it("should use custom abort reason", () => {
+    const controller = new AbortController();
+    const signal = controller.signal;
+    expect(signal.aborted).toBe(false);
+    expect(signal.reason).toBeUndefined();
+
+    const customReason = new Error("Custom Reason");
+    controller.abort(customReason);
+
+    expect(signal.aborted).toBe(true);
+    expect(signal.reason).toBe(customReason);
+  });
+});
diff --git a/node_modules/node-abort-controller/__tests__/abort-signal.js b/node_modules/node-abort-controller/__tests__/abort-signal.js
new file mode 100644
index 0000000..da45b7b
--- /dev/null
+++ b/node_modules/node-abort-controller/__tests__/abort-signal.js
@@ -0,0 +1,72 @@
+const { AbortController, AbortSignal } = require("../index.js");
+
+describe("AbortSignal", function () {
+  it("should implement EventTarget", function () {
+    const controller = new AbortController();
+    const signal = controller.signal;
+    const unusedHandler = jest.fn();
+    const handler = jest.fn();
+    const event = { type: "abort", target: signal };
+
+    signal.onabort = jest.fn();
+    signal.addEventListener("abort", handler);
+    signal.addEventListener("abort", unusedHandler);
+    signal.removeEventListener("abort", unusedHandler);
+
+    signal.dispatchEvent("abort", event);
+
+    expect(unusedHandler).not.toBeCalled();
+    expect(handler).toBeCalledTimes(1);
+    expect(handler).toBeCalledWith(event);
+    expect(signal.onabort).toBeCalledTimes(1);
+    expect(signal.onabort).toBeCalledWith(event);
+
+    jest.clearAllMocks();
+    signal.dispatchEvent("abort", event);
+
+    expect(unusedHandler).not.toBeCalled();
+    expect(handler).toBeCalledTimes(1);
+    expect(handler).toBeCalledWith(event);
+    expect(signal.onabort).toBeCalledTimes(1);
+    expect(signal.onabort).toBeCalledWith(event);
+
+    jest.clearAllMocks();
+    signal.dispatchEvent("unknown", event);
+
+    expect(unusedHandler).not.toBeCalled();
+    expect(handler).not.toBeCalled();
+    expect(signal.onabort).not.toBeCalled();
+  });
+
+  it("should implement throwIfAborted", function () {
+    const controller = new AbortController();
+    const signal = controller.signal;
+    expect(() => signal.throwIfAborted()).not.toThrowError();
+    controller.abort();
+    expect(() => signal.throwIfAborted()).toThrowError(new Error("AbortError"));
+  });
+});
+
+describe("Static methods", () => {
+  jest.useFakeTimers();
+  jest.spyOn(global, "setTimeout");
+
+  it("should implement abort", function () {
+    const signal = AbortSignal.abort();
+    expect(signal.aborted).toBe(true);
+    expect(signal.reason).toEqual(new Error("AbortError"));
+  });
+
+  it("should implement timeout", function () {
+    const signal = AbortSignal.timeout(1000);
+    expect(setTimeout).toHaveBeenCalledTimes(1);
+    expect(setTimeout).toHaveBeenLastCalledWith(expect.any(Function), 1000);
+    expect(signal.aborted).toBe(false);
+    expect(signal.reason).toBeUndefined();
+
+    jest.runAllTimers();
+
+    expect(signal.aborted).toBe(true);
+    expect(signal.reason).toEqual(new Error("TimeoutError"));
+  });
+});
diff --git a/node_modules/node-abort-controller/__tests__/browser.js b/node_modules/node-abort-controller/__tests__/browser.js
new file mode 100644
index 0000000..be537bd
--- /dev/null
+++ b/node_modules/node-abort-controller/__tests__/browser.js
@@ -0,0 +1,19 @@
+describe("AbortController in browser", function () {
+  // Mock AbortController
+  const mockedGlobalAbortController = jest.fn();
+
+  beforeAll(() => {
+    // Attach mocked AbortController to global
+    self.AbortController = mockedGlobalAbortController;
+  });
+
+  it("should call global abort controller", function () {
+    // Require module after global setup
+    const { AbortController } = require("../browser.js");
+
+    const controller = new AbortController();
+
+    expect(controller).toBeTruthy();
+    expect(mockedGlobalAbortController).toBeCalled();
+  });
+});
diff --git a/node_modules/node-abort-controller/__tests__/node-fetch.js b/node_modules/node-abort-controller/__tests__/node-fetch.js
new file mode 100644
index 0000000..3ef6dee
--- /dev/null
+++ b/node_modules/node-abort-controller/__tests__/node-fetch.js
@@ -0,0 +1,27 @@
+const { AbortController } = require("../index.js");
+const fetch = require("node-fetch");
+
+describe("node-fetch", function () {
+  it("should throw exception if aborted during the request", async function () {
+    expect.assertions(1);
+    try {
+      const controller = new AbortController();
+      const signal = controller.signal;
+      setTimeout(() => controller.abort(), 5);
+      await fetch("https://www.google.com/", { signal });
+    } catch (err) {
+      expect(err.name).toBe("AbortError");
+    }
+  });
+  it("should throw exception if passed an already aborted signal", async function () {
+    expect.assertions(1);
+    try {
+      const controller = new AbortController();
+      const signal = controller.signal;
+      controller.abort();
+      await fetch("https://www.google.com/", { signal });
+    } catch (err) {
+      expect(err.name).toBe("AbortError");
+    }
+  });
+});
diff --git a/node_modules/node-abort-controller/__tests__/whatwg-fetch.js b/node_modules/node-abort-controller/__tests__/whatwg-fetch.js
new file mode 100644
index 0000000..f194d86
--- /dev/null
+++ b/node_modules/node-abort-controller/__tests__/whatwg-fetch.js
@@ -0,0 +1,27 @@
+const { AbortController } = require("../index.js");
+const { fetch } = require("whatwg-fetch");
+
+describe("node-fetch", function () {
+  it("should throw exception if aborted during the request", async function () {
+    expect.assertions(1);
+    try {
+      const controller = new AbortController();
+      const signal = controller.signal;
+      setTimeout(() => controller.abort(), 5);
+      await fetch("https://www.google.com/", { signal });
+    } catch (err) {
+      expect(err.name).toBe("AbortError");
+    }
+  });
+  it("should throw exception if passed an already aborted signal", async function () {
+    expect.assertions(1);
+    try {
+      const controller = new AbortController();
+      const signal = controller.signal;
+      controller.abort();
+      await fetch("https://www.google.com/", { signal });
+    } catch (err) {
+      expect(err.name).toBe("AbortError");
+    }
+  });
+});
diff --git a/node_modules/node-abort-controller/browser.js b/node_modules/node-abort-controller/browser.js
new file mode 100644
index 0000000..af7cde2
--- /dev/null
+++ b/node_modules/node-abort-controller/browser.js
@@ -0,0 +1,22 @@
+'use strict'
+
+const _global =
+  typeof self !== 'undefined'
+    ? self
+    : typeof window !== 'undefined'
+    ? window
+    : /* otherwise */ undefined
+
+if (!_global) {
+  throw new Error(
+    `Unable to find global scope. Are you sure this is running in the browser?`
+  )
+}
+
+if (!_global.AbortController) {
+  throw new Error(
+    `Could not find "AbortController" in the global scope. You need to polyfill it first`
+  )
+}
+
+module.exports.AbortController = _global.AbortController
\ No newline at end of file
diff --git a/node_modules/node-abort-controller/index.d.ts b/node_modules/node-abort-controller/index.d.ts
new file mode 100644
index 0000000..8f19887
--- /dev/null
+++ b/node_modules/node-abort-controller/index.d.ts
@@ -0,0 +1,47 @@
+// `AbortSignal`,`AbortController` are defined here to prevent a dependency on the `dom` library which disagrees with node runtime.
+// The definition for `AbortSignal` is taken from @types/node-fetch (https://github.com/DefinitelyTyped/DefinitelyTyped) for
+// maximal compatibility with node-fetch.
+// Original node-fetch definitions are under MIT License.
+
+export class AbortSignal {
+  aborted: boolean;
+  reason?: any;
+
+  addEventListener: (
+    type: "abort",
+    listener: (this: AbortSignal, event: any) => any,
+    options?:
+      | boolean
+      | {
+          capture?: boolean;
+          once?: boolean;
+          passive?: boolean;
+        }
+  ) => void;
+
+  removeEventListener: (
+    type: "abort",
+    listener: (this: AbortSignal, event: any) => any,
+    options?:
+      | boolean
+      | {
+          capture?: boolean;
+        }
+  ) => void;
+
+  dispatchEvent: (event: any) => boolean;
+
+  onabort: null | ((this: AbortSignal, event: any) => void);
+
+  throwIfAborted(): void;
+
+  static abort(reason?: any): AbortSignal;
+
+  static timeout(time: number): AbortSignal;
+}
+
+export class AbortController {
+  signal: AbortSignal;
+
+  abort(reason?: any): void;
+}
diff --git a/node_modules/node-abort-controller/index.js b/node_modules/node-abort-controller/index.js
new file mode 100644
index 0000000..a001a75
--- /dev/null
+++ b/node_modules/node-abort-controller/index.js
@@ -0,0 +1,68 @@
+const { EventEmitter } = require("events");
+
+class AbortSignal {
+  constructor() {
+    this.eventEmitter = new EventEmitter();
+    this.onabort = null;
+    this.aborted = false;
+    this.reason = undefined;
+  }
+  toString() {
+    return "[object AbortSignal]";
+  }
+  get [Symbol.toStringTag]() {
+    return "AbortSignal";
+  }
+  removeEventListener(name, handler) {
+    this.eventEmitter.removeListener(name, handler);
+  }
+  addEventListener(name, handler) {
+    this.eventEmitter.on(name, handler);
+  }
+  dispatchEvent(type) {
+    const event = { type, target: this };
+    const handlerName = `on${type}`;
+
+    if (typeof this[handlerName] === "function") this[handlerName](event);
+
+    this.eventEmitter.emit(type, event);
+  }
+  throwIfAborted() {
+    if (this.aborted) {
+      throw this.reason;
+    }
+  }
+  static abort(reason) {
+    const controller = new AbortController();
+    controller.abort();
+    return controller.signal;
+  }
+  static timeout(time) {
+    const controller = new AbortController();
+    setTimeout(() => controller.abort(new Error("TimeoutError")), time);
+    return controller.signal;
+  }
+}
+class AbortController {
+  constructor() {
+    this.signal = new AbortSignal();
+  }
+  abort(reason) {
+    if (this.signal.aborted) return;
+
+    this.signal.aborted = true;
+
+    if (reason) this.signal.reason = reason;
+    else this.signal.reason = new Error("AbortError");
+
+    this.signal.dispatchEvent("abort");
+  }
+  toString() {
+    return "[object AbortController]";
+  }
+  get [Symbol.toStringTag]() {
+    return "AbortController";
+  }
+}
+
+module.exports = { AbortController, AbortSignal };
diff --git a/node_modules/node-abort-controller/package.json b/node_modules/node-abort-controller/package.json
new file mode 100644
index 0000000..8270822
--- /dev/null
+++ b/node_modules/node-abort-controller/package.json
@@ -0,0 +1,34 @@
+{
+  "name": "node-abort-controller",
+  "version": "3.1.1",
+  "description": "AbortController for Node based on EventEmitter",
+  "main": "index.js",
+  "browser": "browser.js",
+  "scripts": {
+    "test": "jest"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/southpolesteve/node-abort-controller.git"
+  },
+  "keywords": [
+    "AbortController",
+    "AbortSignal",
+    "fetch",
+    "polyfill"
+  ],
+  "author": "Steve Faulkner <southpolesteve@gmail.com>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/southpolesteve/node-abort-controller/issues"
+  },
+  "homepage": "https://github.com/southpolesteve/node-abort-controller#readme",
+  "devDependencies": {
+    "jest": "^27.2.4",
+    "node-fetch": "^2.6.5",
+    "whatwg-fetch": "^3.6.2"
+  },
+  "jest": {
+    "testEnvironment": "jsdom"
+  }
+}
diff --git a/node_modules/node-gyp-build-optional-packages/LICENSE b/node_modules/node-gyp-build-optional-packages/LICENSE
new file mode 100644
index 0000000..56fce08
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Mathias Buus
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/node_modules/node-gyp-build-optional-packages/README.md b/node_modules/node-gyp-build-optional-packages/README.md
new file mode 100644
index 0000000..f712ca6
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/README.md
@@ -0,0 +1,58 @@
+# node-gyp-build
+
+> Build tool and bindings loader for [`node-gyp`][node-gyp] that supports prebuilds.
+
+```
+npm install node-gyp-build
+```
+
+[![Test](https://github.com/prebuild/node-gyp-build/actions/workflows/test.yml/badge.svg)](https://github.com/prebuild/node-gyp-build/actions/workflows/test.yml)
+
+Use together with [`prebuildify`][prebuildify] to easily support prebuilds for your native modules.
+
+## Usage
+
+> **Note.** Prebuild names have changed in [`prebuildify@3`][prebuildify] and `node-gyp-build@4`. Please see the documentation below.
+
+`node-gyp-build` works similar to [`node-gyp build`][node-gyp] except that it will check if a build or prebuild is present before rebuilding your project.
+
+It's main intended use is as an npm install script and bindings loader for native modules that bundle prebuilds using [`prebuildify`][prebuildify].
+
+First add `node-gyp-build` as an install script to your native project
+
+``` js
+{
+  ...
+  "scripts": {
+    "install": "node-gyp-build"
+  }
+}
+```
+
+Then in your `index.js`, instead of using the [`bindings`](https://www.npmjs.com/package/bindings) module use `node-gyp-build` to load your binding.
+
+``` js
+var binding = require('node-gyp-build')(__dirname)
+```
+
+If you do these two things and bundle prebuilds with [`prebuildify`][prebuildify] your native module will work for most platforms
+without having to compile on install time AND will work in both node and electron without the need to recompile between usage.
+
+Users can override `node-gyp-build` and force compiling by doing `npm install --build-from-source`.
+
+Prebuilds will be attempted loaded from `MODULE_PATH/prebuilds/...` and then next `EXEC_PATH/prebuilds/...` (the latter allowing use with `zeit/pkg`)
+
+## Supported prebuild names
+
+If so desired you can bundle more specific flavors, for example `musl` builds to support Alpine, or targeting a numbered ARM architecture version.
+
+These prebuilds can be bundled in addition to generic prebuilds; `node-gyp-build` will try to find the most specific flavor first. Prebuild filenames are composed of _tags_. The runtime tag takes precedence, as does an `abi` tag over `napi`. For more details on tags, please see [`prebuildify`][prebuildify].
+
+Values for the `libc` and `armv` tags are auto-detected but can be overridden through the `LIBC` and `ARM_VERSION` environment variables, respectively.
+
+## License
+
+MIT
+
+[prebuildify]: https://github.com/prebuild/prebuildify
+[node-gyp]: https://www.npmjs.com/package/node-gyp
diff --git a/node_modules/node-gyp-build-optional-packages/bin.js b/node_modules/node-gyp-build-optional-packages/bin.js
new file mode 100755
index 0000000..598e35f
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/bin.js
@@ -0,0 +1,82 @@
+#!/usr/bin/env node
+
+var proc = require('child_process')
+var os = require('os')
+var path = require('path')
+
+if (!buildFromSource()) {
+  proc.exec('node-gyp-build-optional-packages-test', function (err, stdout, stderr) {
+    if (err) {
+      console.error(stderr)
+      console.error('The failure above indicates the primary issue with the native builds which are included for all' +
+         ' major platforms. Will now attempt to build the package locally in case this can be resolved by' +
+         ' re-compiling.')
+      preinstall()
+    }
+  })
+} else {
+  preinstall()
+}
+
+function build () {
+  var win32 = os.platform() === 'win32'
+  var args = [win32 ? 'node-gyp.cmd' : 'node-gyp', 'rebuild']
+
+  try {
+    var pkg = require('node-gyp/package.json')
+    args = [
+      process.execPath,
+      path.join(require.resolve('node-gyp/package.json'), '..', typeof pkg.bin === 'string' ? pkg.bin : pkg.bin['node-gyp']),
+      'rebuild'
+    ]
+  } catch (_) {}
+
+  proc.spawn(args[0], args.slice(1), { stdio: 'inherit', shell: win32, windowsHide: true }).on('exit', function (code) {
+    if (code || !process.argv[3]) process.exit(code)
+    exec(process.argv[3]).on('exit', function (code) {
+      process.exit(code)
+    })
+  })
+}
+
+function preinstall () {
+  if (!process.argv[2]) return build()
+  exec(process.argv[2]).on('exit', function (code) {
+    if (code) process.exit(code)
+    build()
+  })
+}
+
+function exec (cmd) {
+  if (process.platform !== 'win32') {
+    var shell = os.platform() === 'android' ? 'sh' : true
+    return proc.spawn(cmd, [], {
+      shell,
+      stdio: 'inherit'
+    })
+  }
+
+  return proc.spawn(cmd, [], {
+    windowsVerbatimArguments: true,
+    stdio: 'inherit',
+    shell: true,
+    windowsHide: true
+  })
+}
+
+function buildFromSource () {
+  return hasFlag('--build-from-source') || process.env.npm_config_build_from_source === 'true'
+}
+
+
+// TODO (next major): remove in favor of env.npm_config_* which works since npm
+// 0.1.8 while npm_config_argv will stop working in npm 7. See npm/rfcs#90
+function hasFlag (flag) {
+  if (!process.env.npm_config_argv) return false
+
+  try {
+    return JSON.parse(process.env.npm_config_argv).original.indexOf(flag) !== -1
+  } catch (_) {
+    return false
+  }
+}
diff --git a/node_modules/node-gyp-build-optional-packages/build-test.js b/node_modules/node-gyp-build-optional-packages/build-test.js
new file mode 100755
index 0000000..b6622a5
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/build-test.js
@@ -0,0 +1,19 @@
+#!/usr/bin/env node
+
+process.env.NODE_ENV = 'test'
+
+var path = require('path')
+var test = null
+
+try {
+  var pkg = require(path.join(process.cwd(), 'package.json'))
+  if (pkg.name && process.env[pkg.name.toUpperCase().replace(/-/g, '_')]) {
+    process.exit(0)
+  }
+  test = pkg.prebuild.test
+} catch (err) {
+  //  do nothing
+}
+
+if (test) require(path.join(process.cwd(), test))
+else require('./')()
diff --git a/node_modules/node-gyp-build-optional-packages/index.js b/node_modules/node-gyp-build-optional-packages/index.js
new file mode 100644
index 0000000..07eb14f
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/index.js
@@ -0,0 +1,6 @@
+const runtimeRequire = typeof __webpack_require__ === 'function' ? __non_webpack_require__ : require // eslint-disable-line
+if (typeof runtimeRequire.addon === 'function') { // if the platform supports native resolving prefer that
+  module.exports = runtimeRequire.addon.bind(runtimeRequire)
+} else { // else use the runtime version here
+  module.exports = require('./node-gyp-build.js')
+}
diff --git a/node_modules/node-gyp-build-optional-packages/node-gyp-build.js b/node_modules/node-gyp-build-optional-packages/node-gyp-build.js
new file mode 100644
index 0000000..a50bc4c
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/node-gyp-build.js
@@ -0,0 +1,236 @@
+var fs = require('fs')
+var path = require('path')
+var url = require('url')
+var os = require('os')
+// Workaround to fix webpack's build warnings: 'the request of a dependency is an expression'
+var runtimeRequire = typeof __webpack_require__ === 'function' ? __non_webpack_require__ : require // eslint-disable-line
+
+var vars = (process.config && process.config.variables) || {}
+var prebuildsOnly = !!process.env.PREBUILDS_ONLY
+var versions = process.versions
+var abi = versions.modules
+if (versions.deno || process.isBun) {
+  // both Deno and Bun made the very poor decision to shoot themselves in the foot and lie about support for ABI
+  // (which they do not have)
+  abi = 'unsupported'
+}
+var runtime = isElectron() ? 'electron' : (isNwjs() ? 'node-webkit' : 'node')
+var arch = process.env.npm_config_arch || os.arch()
+var platform = process.env.npm_config_platform || os.platform()
+var libc = process.env.LIBC || (isMusl(platform) ? 'musl' : 'glibc')
+
+var armv = process.env.ARM_VERSION || (arch === 'arm64' ? '8' : vars.arm_version) || ''
+var uv = (versions.uv || '').split('.')[0]
+
+module.exports = load
+
+function load (dir) {
+  return runtimeRequire(load.resolve(dir))
+}
+
+load.resolve = load.path = function (dir) {
+  dir = path.resolve(dir || '.')
+  var packageName = ''
+  var packageNameError
+  try {
+    packageName = runtimeRequire(path.join(dir, 'package.json')).name;
+    var varName = packageName.toUpperCase().replace(/-/g, '_')
+    if (process.env[varName + '_PREBUILD']) dir = process.env[varName + '_PREBUILD']
+  } catch (err) {
+    packageNameError = err;
+  }
+  if (!prebuildsOnly) {
+    var release = getFirst(path.join(dir, 'build/Release'), matchBuild)
+    if (release) return release
+
+    var debug = getFirst(path.join(dir, 'build/Debug'), matchBuild)
+    if (debug) return debug
+  }
+
+  var prebuild = resolve(dir)
+  if (prebuild) return prebuild
+
+  var nearby = resolve(path.dirname(process.execPath))
+  if (nearby) return nearby
+
+  var platformPackage = (packageName[0] == '@' ? '' : '@' + packageName + '/') + packageName + '-' + platform + '-' + arch
+  var packageResolutionError
+  try {
+    var prebuildPackage = path.dirname(require('module').createRequire(url.pathToFileURL(path.join(dir, 'package.json'))).resolve(platformPackage))
+    return resolveFile(prebuildPackage)
+  } catch(error) {
+    packageResolutionError = error
+  }
+
+  var target = [
+    'platform=' + platform,
+    'arch=' + arch,
+    'runtime=' + runtime,
+    'abi=' + abi,
+    'uv=' + uv,
+    armv ? 'armv=' + armv : '',
+    'libc=' + libc,
+    'node=' + process.versions.node,
+    process.versions.electron ? 'electron=' + process.versions.electron : '',
+    typeof __webpack_require__ === 'function' ? 'webpack=true' : '' // eslint-disable-line
+  ].filter(Boolean).join(' ')
+  let errMessage = 'No native build was found for ' + target + '\n    attempted loading from: ' + dir + ' and package:' +
+    ' ' + platformPackage + '\n';
+  if (packageNameError) {
+    errMessage += 'Error finding package.json: ' + packageNameError.message + '\n';
+  }
+  if (packageResolutionError) {
+    errMessage += 'Error resolving package: ' + packageResolutionError.message + '\n';
+  }
+  throw new Error(errMessage)
+
+  function resolve (dir) {
+    // Find matching "prebuilds/<platform>-<arch>" directory
+    var tuples = readdirSync(path.join(dir, 'prebuilds')).map(parseTuple)
+    var tuple = tuples.filter(matchTuple(platform, arch)).sort(compareTuples)[0]
+    if (!tuple) return
+    return resolveFile(path.join(dir, 'prebuilds', tuple.name))
+  }
+  function resolveFile (prebuilds) {
+    // Find most specific flavor first
+    var parsed = readdirSync(prebuilds).map(parseTags)
+    var candidates = parsed.filter(matchTags(runtime, abi))
+    var winner = candidates.sort(compareTags(runtime))[0]
+    if (winner) return path.join(prebuilds, winner.file)
+  }
+}
+
+function readdirSync (dir) {
+  try {
+    return fs.readdirSync(dir)
+  } catch (err) {
+    return []
+  }
+}
+
+function getFirst (dir, filter) {
+  var files = readdirSync(dir).filter(filter)
+  return files[0] && path.join(dir, files[0])
+}
+
+function matchBuild (name) {
+  return /\.node$/.test(name)
+}
+
+function parseTuple (name) {
+  // Example: darwin-x64+arm64
+  var arr = name.split('-')
+  if (arr.length !== 2) return
+
+  var platform = arr[0]
+  var architectures = arr[1].split('+')
+
+  if (!platform) return
+  if (!architectures.length) return
+  if (!architectures.every(Boolean)) return
+
+  return { name, platform, architectures }
+}
+
+function matchTuple (platform, arch) {
+  return function (tuple) {
+    if (tuple == null) return false
+    if (tuple.platform !== platform) return false
+    return tuple.architectures.includes(arch)
+  }
+}
+
+function compareTuples (a, b) {
+  // Prefer single-arch prebuilds over multi-arch
+  return a.architectures.length - b.architectures.length
+}
+
+function parseTags (file) {
+  var arr = file.split('.')
+  var extension = arr.pop()
+  var tags = { file: file, specificity: 0 }
+
+  if (extension !== 'node') return
+
+  for (var i = 0; i < arr.length; i++) {
+    var tag = arr[i]
+
+    if (tag === 'node' || tag === 'electron' || tag === 'node-webkit') {
+      tags.runtime = tag
+    } else if (tag === 'napi') {
+      tags.napi = true
+    } else if (tag.slice(0, 3) === 'abi') {
+      tags.abi = tag.slice(3)
+    } else if (tag.slice(0, 2) === 'uv') {
+      tags.uv = tag.slice(2)
+    } else if (tag.slice(0, 4) === 'armv') {
+      tags.armv = tag.slice(4)
+    } else if (tag === 'glibc' || tag === 'musl') {
+      tags.libc = tag
+    } else {
+      continue
+    }
+
+    tags.specificity++
+  }
+
+  return tags
+}
+
+function matchTags (runtime, abi) {
+  return function (tags) {
+    if (tags == null) return false
+    if (tags.runtime !== runtime && !runtimeAgnostic(tags)) return false
+    if (tags.abi !== abi && !tags.napi) return false
+    if (tags.uv && tags.uv !== uv) return false
+    if (tags.armv && tags.armv !== armv) return false
+    if (tags.libc && tags.libc !== libc) return false
+
+    return true
+  }
+}
+
+function runtimeAgnostic (tags) {
+  return tags.runtime === 'node' && tags.napi
+}
+
+function compareTags (runtime) {
+  // Precedence: non-agnostic runtime, abi over napi, then by specificity.
+  return function (a, b) {
+    if (a.runtime !== b.runtime) {
+      return a.runtime === runtime ? -1 : 1
+    } else if (a.abi !== b.abi) {
+      return a.abi ? -1 : 1
+    } else if (a.specificity !== b.specificity) {
+      return a.specificity > b.specificity ? -1 : 1
+    } else {
+      return 0
+    }
+  }
+}
+
+function isNwjs () {
+  return !!(process.versions && process.versions.nw)
+}
+
+function isElectron () {
+  if (process.versions && process.versions.electron) return true
+  if (process.env.ELECTRON_RUN_AS_NODE) return true
+  return typeof window !== 'undefined' && window.process && window.process.type === 'renderer'
+}
+
+function isMusl (platform) {
+  if (platform !== 'linux') return false;
+  const { familySync, MUSL } = require('detect-libc');
+  return familySync() === MUSL;
+}
+
+// Exposed for unit tests
+// TODO: move to lib
+load.parseTags = parseTags
+load.matchTags = matchTags
+load.compareTags = compareTags
+load.parseTuple = parseTuple
+load.matchTuple = matchTuple
+load.compareTuples = compareTuples
+
diff --git a/node_modules/node-gyp-build-optional-packages/optional.js b/node_modules/node-gyp-build-optional-packages/optional.js
new file mode 100755
index 0000000..8daa04a
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/optional.js
@@ -0,0 +1,7 @@
+#!/usr/bin/env node
+
+/*
+I am only useful as an install script to make node-gyp not compile for purely optional native deps
+*/
+
+process.exit(0)
diff --git a/node_modules/node-gyp-build-optional-packages/package.json b/node_modules/node-gyp-build-optional-packages/package.json
new file mode 100644
index 0000000..a7e81d9
--- /dev/null
+++ b/node_modules/node-gyp-build-optional-packages/package.json
@@ -0,0 +1,32 @@
+{
+  "name": "node-gyp-build-optional-packages",
+  "version": "5.2.2",
+  "description": "Build tool and bindings loader for node-gyp that supports prebuilds",
+  "main": "index.js",
+  "devDependencies": {
+    "array-shuffle": "^1.0.1",
+    "standard": "^14.0.0",
+    "tape": "^5.0.0"
+  },
+  "dependencies": {
+    "detect-libc": "^2.0.1"
+  },
+  "scripts": {
+    "test": "standard && node test"
+  },
+  "bin": {
+    "node-gyp-build-optional-packages": "./bin.js",
+    "node-gyp-build-optional-packages-optional": "./optional.js",
+    "node-gyp-build-optional-packages-test": "./build-test.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/prebuild/node-gyp-build.git"
+  },
+  "author": "Mathias Buus (@mafintosh)",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/prebuild/node-gyp-build/issues"
+  },
+  "homepage": "https://github.com/prebuild/node-gyp-build"
+}
diff --git a/node_modules/redis-errors/.npmignore b/node_modules/redis-errors/.npmignore
new file mode 100644
index 0000000..7eee456
--- /dev/null
+++ b/node_modules/redis-errors/.npmignore
@@ -0,0 +1,15 @@
+# IntelliJ project files
+.idea
+*.iml
+out
+gen
+
+# Irrelevant files and folders
+benchmark
+coverage
+test
+.travis.yml
+.gitignore
+*.log
+.vscode
+.codeclimate.yml
\ No newline at end of file
diff --git a/node_modules/redis-errors/LICENSE b/node_modules/redis-errors/LICENSE
new file mode 100644
index 0000000..14cc840
--- /dev/null
+++ b/node_modules/redis-errors/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Ruben Bridgewater
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/redis-errors/README.md b/node_modules/redis-errors/README.md
new file mode 100644
index 0000000..b470d29
--- /dev/null
+++ b/node_modules/redis-errors/README.md
@@ -0,0 +1,116 @@
+[![js-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg)](http://standardjs.com/)
+
+# redis-errors
+
+All error classes used in [node_redis](https://github.com/NodeRedis/node_redis)
+from v.3.0.0 are in here. They can be required as needed.
+
+## Install
+
+Install with [NPM](https://npmjs.org/):
+
+  npm install redis-errors
+
+## Usage
+
+```js
+const { ReplyError, InterruptError } = require('redis-errors');
+
+// Using async await
+try {
+  await client.set('foo') // Missing value
+} catch (err) {
+  if (err instanceof InterruptError) {
+    console.error('Command might have been processed')
+  }
+  if (err instanceof ReplyError) {
+    // ...
+  }
+  throw err
+}
+
+// Using callbacks
+client.set('foo', (err, res) => {
+  if (err) {
+    if (err instanceof InterruptError) {
+      // ...
+    }
+  }
+})
+```
+
+### Error classes
+
+All errors returned by NodeRedis use own Error classes. You can distinguish
+different errors easily by checking for these classes.
+
+To know what caused the error they might contain properties to know in more
+detail what happened.
+
+Each error contains a `message`, a `name` and a `stack` property. Please be aware
+that the stack might not be useful due to the async nature and is in those cases
+therefore limited to two frames.
+
+There might be more not yet documented properties as well. Please feel free to
+open a pull request to document those as well.
+
+#### RedisError
+
+`Properties`:
+
+Properties depend on the individual error.
+
+All errors returned by NodeRedis (client) are `RedisError`s.  
+Subclass of `Error`
+
+#### ReplyError
+
+`Properties`:
+
+* `args`: The arguments passed to the command.
+* `command`: The command name.
+* `code`: The `Redis` error code. Redis itself uses some internal error codes.
+
+All errors returned by Redis itself (server) will be a `ReplyError`.  
+Subclass of `RedisError`
+
+#### ParserError
+
+`Properties`:
+
+* `buffer`: The raw buffer input stringified.
+* `offset`: The character count where the parsing error occurred.
+
+Parsing errors are returned as `ParserError`.  
+Subclass of `RedisError`
+**Note:** If you encounter one of these please report that error including the
+attached `offset` and `buffer` properties!  
+
+#### AbortError
+
+`Properties`:
+
+* `args`: The arguments passed to the command.
+* `command`: The command name.
+
+If a command was not yet executed but rejected, it'll return a `AbortError`.  
+Subclass of `RedisError`
+
+#### InterruptError
+
+`Properties`:
+
+* `args`: The arguments passed to the command.
+* `command`: The command name.
+* `origin`: The original error that caused the interrupt
+
+All executed commands that could not fulfill (e.g. network drop while
+executing) return a `InterruptError`.  
+Subclass of `AbortError`  
+**Note:** Interrupt errors can happen for multiple reasons that are out of the
+scope of NodeRedis itself. There is nothing that can be done on library side
+to prevent those.
+
+## License
+
+[MIT](./LICENSE)
diff --git a/node_modules/redis-errors/index.js b/node_modules/redis-errors/index.js
new file mode 100644
index 0000000..84323b4
--- /dev/null
+++ b/node_modules/redis-errors/index.js
@@ -0,0 +1,7 @@
+'use strict'
+
+const Errors = process.version.charCodeAt(1) < 55 && process.version.charCodeAt(2) === 46
+  ? require('./lib/old') // Node.js < 7
+  : require('./lib/modern')
+
+module.exports = Errors
diff --git a/node_modules/redis-errors/lib/modern.js b/node_modules/redis-errors/lib/modern.js
new file mode 100644
index 0000000..0f1d1db
--- /dev/null
+++ b/node_modules/redis-errors/lib/modern.js
@@ -0,0 +1,59 @@
+'use strict'
+
+const assert = require('assert')
+
+class RedisError extends Error {
+  get name () {
+    return this.constructor.name
+  }
+}
+
+class ParserError extends RedisError {
+  constructor (message, buffer, offset) {
+    assert(buffer)
+    assert.strictEqual(typeof offset, 'number')
+
+    const tmp = Error.stackTraceLimit
+    Error.stackTraceLimit = 2
+    super(message)
+    Error.stackTraceLimit = tmp
+    this.offset = offset
+    this.buffer = buffer
+  }
+
+  get name () {
+    return this.constructor.name
+  }
+}
+
+class ReplyError extends RedisError {
+  constructor (message) {
+    const tmp = Error.stackTraceLimit
+    Error.stackTraceLimit = 2
+    super(message)
+    Error.stackTraceLimit = tmp
+  }
+  get name () {
+    return this.constructor.name
+  }
+}
+
+class AbortError extends RedisError {
+  get name () {
+    return this.constructor.name
+  }
+}
+
+class InterruptError extends AbortError {
+  get name () {
+    return this.constructor.name
+  }
+}
+
+module.exports = {
+  RedisError,
+  ParserError,
+  ReplyError,
+  AbortError,
+  InterruptError
+}
diff --git a/node_modules/redis-errors/lib/old.js b/node_modules/redis-errors/lib/old.js
new file mode 100644
index 0000000..76fc6de
--- /dev/null
+++ b/node_modules/redis-errors/lib/old.js
@@ -0,0 +1,119 @@
+'use strict'
+
+const assert = require('assert')
+const util = require('util')
+
+// RedisError
+
+function RedisError (message) {
+  Object.defineProperty(this, 'message', {
+    value: message || '',
+    configurable: true,
+    writable: true
+  })
+  Error.captureStackTrace(this, this.constructor)
+}
+
+util.inherits(RedisError, Error)
+
+Object.defineProperty(RedisError.prototype, 'name', {
+  value: 'RedisError',
+  configurable: true,
+  writable: true
+})
+
+// ParserError
+
+function ParserError (message, buffer, offset) {
+  assert(buffer)
+  assert.strictEqual(typeof offset, 'number')
+
+  Object.defineProperty(this, 'message', {
+    value: message || '',
+    configurable: true,
+    writable: true
+  })
+
+  const tmp = Error.stackTraceLimit
+  Error.stackTraceLimit = 2
+  Error.captureStackTrace(this, this.constructor)
+  Error.stackTraceLimit = tmp
+  this.offset = offset
+  this.buffer = buffer
+}
+
+util.inherits(ParserError, RedisError)
+
+Object.defineProperty(ParserError.prototype, 'name', {
+  value: 'ParserError',
+  configurable: true,
+  writable: true
+})
+
+// ReplyError
+
+function ReplyError (message) {
+  Object.defineProperty(this, 'message', {
+    value: message || '',
+    configurable: true,
+    writable: true
+  })
+  const tmp = Error.stackTraceLimit
+  Error.stackTraceLimit = 2
+  Error.captureStackTrace(this, this.constructor)
+  Error.stackTraceLimit = tmp
+}
+
+util.inherits(ReplyError, RedisError)
+
+Object.defineProperty(ReplyError.prototype, 'name', {
+  value: 'ReplyError',
+  configurable: true,
+  writable: true
+})
+
+// AbortError
+
+function AbortError (message) {
+  Object.defineProperty(this, 'message', {
+    value: message || '',
+    configurable: true,
+    writable: true
+  })
+  Error.captureStackTrace(this, this.constructor)
+}
+
+util.inherits(AbortError, RedisError)
+
+Object.defineProperty(AbortError.prototype, 'name', {
+  value: 'AbortError',
+  configurable: true,
+  writable: true
+})
+
+// InterruptError
+
+function InterruptError (message) {
+  Object.defineProperty(this, 'message', {
+    value: message || '',
+    configurable: true,
+    writable: true
+  })
+  Error.captureStackTrace(this, this.constructor)
+}
+
+util.inherits(InterruptError, AbortError)
+
+Object.defineProperty(InterruptError.prototype, 'name', {
+  value: 'InterruptError',
+  configurable: true,
+  writable: true
+})
+
+module.exports = {
+  RedisError,
+  ParserError,
+  ReplyError,
+  AbortError,
+  InterruptError
+}
diff --git a/node_modules/redis-errors/package.json b/node_modules/redis-errors/package.json
new file mode 100644
index 0000000..cdf45ba
--- /dev/null
+++ b/node_modules/redis-errors/package.json
@@ -0,0 +1,41 @@
+{
+  "name": "redis-errors",
+  "version": "1.2.0",
+  "description": "Error classes used in node_redis",
+  "main": "index.js",
+  "scripts": {
+    "test": "npm run coverage",
+    "lint": "standard --fix",
+    "posttest": "npm run lint && npm run coverage:check",
+    "coverage": "node ./node_modules/istanbul/lib/cli.js cover --preserve-comments ./node_modules/mocha/bin/_mocha -- -R spec",
+    "coverage:check": "node ./node_modules/istanbul/lib/cli.js check-coverage --statement 100"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/NodeRedis/redis-errors.git"
+  },
+  "keywords": [
+    "redis",
+    "javascript",
+    "node",
+    "error"
+  ],
+  "engines": {
+    "node": ">=4"
+  },
+  "devDependencies": {
+    "istanbul": "^0.4.0",
+    "mocha": "^3.1.2",
+    "standard": "^10.0.0"
+  },
+  "author": "Ruben Bridgewater",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/NodeRedis/redis-errors/issues"
+  },
+  "homepage": "https://github.com/NodeRedis/redis-errors#readme",
+  "directories": {
+    "test": "test",
+    "lib": "lib"
+  }
+}
diff --git a/node_modules/redis-parser/.npmignore b/node_modules/redis-parser/.npmignore
new file mode 100644
index 0000000..af7d371
--- /dev/null
+++ b/node_modules/redis-parser/.npmignore
@@ -0,0 +1,15 @@
+# IntelliJ project files
+.idea
+*.iml
+out
+gen
+
+# Unrelevant files and folders
+benchmark
+coverage
+test
+.travis.yml
+.gitignore
+*.log
+.vscode
+.codeclimate.yml
\ No newline at end of file
diff --git a/node_modules/redis-parser/LICENSE b/node_modules/redis-parser/LICENSE
new file mode 100644
index 0000000..39d23f8
--- /dev/null
+++ b/node_modules/redis-parser/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 NodeRedis
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/redis-parser/README.md b/node_modules/redis-parser/README.md
new file mode 100644
index 0000000..1d9c27d
--- /dev/null
+++ b/node_modules/redis-parser/README.md
@@ -0,0 +1,166 @@
+[![Build Status](https://travis-ci.org/NodeRedis/node-redis-parser.png?branch=master)](https://travis-ci.org/NodeRedis/node-redis-parser)
+[![Test Coverage](https://codeclimate.com/github/NodeRedis/node-redis-parser/badges/coverage.svg)](https://codeclimate.com/github/NodeRedis/node-redis-parser/coverage)
+[![js-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg)](http://standardjs.com/)
+
+# redis-parser
+
+A high performance javascript redis parser built for [node_redis](https://github.com/NodeRedis/node_redis) and [ioredis](https://github.com/luin/ioredis). Parses all [RESP](http://redis.io/topics/protocol) data.
+
+## Install
+
+Install with [NPM](https://npmjs.org/):
+
+    npm install redis-parser
+
+## Usage
+
+```js
+const Parser = require('redis-parser');
+
+const myParser = new Parser(options);
+```
+
+### Options
+
+* `returnReply`: *function*; mandatory
+* `returnError`: *function*; mandatory
+* `returnFatalError`: *function*; optional, defaults to the returnError function
+* `returnBuffers`: *boolean*; optional, defaults to false
+* `stringNumbers`: *boolean*; optional, defaults to false
+
+### Functions
+
+* `reset()`: reset the parser to it's initial state
+* `setReturnBuffers(boolean)`: set the returnBuffers option on/off without resetting the parser
+* `setStringNumbers(boolean)`: set the stringNumbers option on/off without resetting the parser
+
+### Error classes
+
+* `RedisError` sub class of Error
+* `ReplyError` sub class of RedisError
+* `ParserError` sub class of RedisError
+
+All Redis errors will be returned as `ReplyErrors` while a parser error is returned as `ParserError`.  
+All error classes can be imported by the npm `redis-errors` package.
+
+### Example
+
+```js
+const Parser = require("redis-parser");
+
+class Library {
+  returnReply(reply) { /* ... */ }
+  returnError(err) { /* ... */ }
+  returnFatalError(err) { /* ... */ }
+
+  streamHandler() {
+    this.stream.on('data', (buffer) => {
+      // Here the data (e.g. `Buffer.from('$5\r\nHello\r\n'`))
+      // is passed to the parser and the result is passed to
+      // either function depending on the provided data.
+      parser.execute(buffer);
+    });
+  }
+}
+
+const lib = new Library();
+
+const parser = new Parser({
+  returnReply(reply) {
+    lib.returnReply(reply);
+  },
+  returnError(err) {
+    lib.returnError(err);
+  },
+  returnFatalError(err) {
+    lib.returnFatalError(err);
+  }
+});
+```
+
+You do not have to use the returnFatalError function. Fatal errors will be returned in the normal error function in that case.
+
+And if you want to return buffers instead of strings, you can do this by adding the `returnBuffers` option.
+
+If you handle with big numbers that are to large for JS (Number.MAX_SAFE_INTEGER === 2^53 - 16) please use the `stringNumbers` option. That way all numbers are going to be returned as String and you can handle them safely.
+
+```js
+// Same functions as in the first example
+
+const parser = new Parser({
+  returnReply(reply) {
+    lib.returnReply(reply);
+  },
+  returnError(err) {
+    lib.returnError(err);
+  },
+  returnBuffers: true, // All strings are returned as Buffer e.g. <Buffer 48 65 6c 6c 6f>
+  stringNumbers: true // All numbers are returned as String
+});
+
+// The streamHandler as above
+```
+
+## Protocol errors
+
+To handle protocol errors (this is very unlikely to happen) gracefully you should add the returnFatalError option, reject any still running command (they might have been processed properly but the reply is just wrong), destroy the socket and reconnect. Note that while doing this no new command may be added, so all new commands have to be buffered in the meantime, otherwise a chunk might still contain partial data of a following command that was already processed properly but answered in the same chunk as the command that resulted in the protocol error.
+
+## Contribute
+
+The parser is highly optimized but there may still be further optimizations possible.
+
+    npm install
+    npm test
+    npm run benchmark
+
+Currently the benchmark compares the performance against the hiredis parser:
+
+    HIREDIS:   $ multiple chunks in a bulk string x 994,387 ops/sec ±0.22% (554 runs sampled)
+    JS PARSER: $ multiple chunks in a bulk string x 1,010,728 ops/sec ±0.28% (559 runs sampled)
+    HIREDIS BUF:   $ multiple chunks in a bulk string x 648,742 ops/sec ±0.80% (526 runs sampled)
+    JS PARSER BUF: $ multiple chunks in a bulk string x 1,728,849 ops/sec ±0.41% (555 runs sampled)
+
+    HIREDIS:   + multiple chunks in a string x 1,861,132 ops/sec ±0.18% (564 runs sampled)
+    JS PARSER: + multiple chunks in a string x 2,131,892 ops/sec ±0.31% (558 runs sampled)
+    HIREDIS BUF:   + multiple chunks in a string x 965,132 ops/sec ±0.58% (521 runs sampled)
+    JS PARSER BUF: + multiple chunks in a string x 2,304,482 ops/sec ±0.31% (559 runs sampled)
+
+    HIREDIS:   $ 4mb bulk string x 269 ops/sec ±0.56% (452 runs sampled)
+    JS PARSER: $ 4mb bulk string x 763 ops/sec ±0.25% (466 runs sampled)
+    HIREDIS BUF:   $ 4mb bulk string x 336 ops/sec ±0.59% (459 runs sampled)
+    JS PARSER BUF: $ 4mb bulk string x 994 ops/sec ±0.36% (482 runs sampled)
+
+    HIREDIS:   + simple string x 2,504,305 ops/sec ±0.19% (563 runs sampled)
+    JS PARSER: + simple string x 5,121,952 ops/sec ±0.30% (560 runs sampled)
+    HIREDIS BUF:   + simple string x 1,122,899 ops/sec ±0.52% (516 runs sampled)
+    JS PARSER BUF: + simple string x 5,907,323 ops/sec ±0.23% (562 runs sampled)
+
+    HIREDIS:   : integer x 2,461,376 ops/sec ±0.14% (561 runs sampled)
+    JS PARSER: : integer x 18,543,688 ops/sec ±0.19% (539 runs sampled)
+    JS PARSER STR: : integer x 14,149,305 ops/sec ±0.24% (561 runs sampled)
+
+    HIREDIS:   : big integer x 2,114,270 ops/sec ±0.15% (561 runs sampled)
+    JS PARSER: : big integer x 10,794,439 ops/sec ±0.25% (560 runs sampled)
+    JS PARSER STR: : big integer x 4,594,807 ops/sec ±0.24% (558 runs sampled)
+
+    HIREDIS:   * array x 45,597 ops/sec ±0.23% (565 runs sampled)
+    JS PARSER: * array x 68,396 ops/sec ±0.30% (563 runs sampled)
+    HIREDIS BUF:   * array x 14,726 ops/sec ±0.39% (498 runs sampled)
+    JS PARSER BUF: * array x 80,961 ops/sec ±0.25% (561 runs sampled)
+
+    HIREDIS:   * big nested array x 212 ops/sec ±0.17% (511 runs sampled)
+    JS PARSER: * big nested array x 243 ops/sec ±0.21% (496 runs sampled)
+    HIREDIS BUF:   * big nested array x 207 ops/sec ±0.37% (430 runs sampled)
+    JS PARSER BUF: * big nested array x 297 ops/sec ±1.10% (421 runs sampled)
+
+    HIREDIS:   - error x 168,761 ops/sec ±0.28% (559 runs sampled)
+    JS PARSER: - error x 424,257 ops/sec ±0.28% (557 runs sampled)
+
+    Platform info:
+    Ubuntu 17.04
+    Node.js 7.10.0
+    Intel(R) Core(TM) i7-5600U CPU
+
+## License
+
+[MIT](./LICENSE)
diff --git a/node_modules/redis-parser/changelog.md b/node_modules/redis-parser/changelog.md
new file mode 100644
index 0000000..551b9b5
--- /dev/null
+++ b/node_modules/redis-parser/changelog.md
@@ -0,0 +1,156 @@
+# Changelog
+
+## v.3.0.0 - 25 May, 2017
+
+Breaking Changes
+
+- Drop support for Node.js < 4
+- Removed support for hiredis completely
+
+Internals
+
+- Due to the changes to ES6 the error performance improved by factor 2-3x
+- Improved length calculation performance (bulk strings + arrays)
+
+Features
+
+- The parser now handles weird input graceful
+
+## v.2.6.0 - 03 Apr, 2017
+
+Internals
+
+- Use Buffer.allocUnsafe instead of new Buffer() with modern Node.js versions
+
+## v.2.5.0 - 11 Mar, 2017
+
+Features
+
+- Added a `ParserError` class to differentiate them to ReplyErrors. The class is also exported
+
+Bugfixes
+
+- All errors now show their error message again next to the error name in the stack trace
+- ParserErrors now show the offset and buffer attributes while being logged
+
+## v.2.4.1 - 05 Feb, 2017
+
+Bugfixes
+
+- Fixed minimal memory consumption overhead for chunked buffers
+
+## v.2.4.0 - 25 Jan, 2017
+
+Features
+
+- Added `reset` function to reset the parser to it's initial values
+- Added `setReturnBuffers` function to reset the returnBuffers option (Only for the JSParser)
+- Added `setStringNumbers` function to reset the stringNumbers option (Only for the JSParser)
+- All Errors are now of sub classes of the new `RedisError` class. It is also exported.
+- Improved bulk string chunked data handling performance
+
+Bugfixes
+
+- Parsing time for big nested arrays is now linear
+
+## v.2.3.0 - 25 Nov, 2016
+
+Features
+
+- Parsing time for big arrays (e.g. 4mb+) is now linear and works well for arbitrary array sizes
+
+This case is a magnitude faster than before
+
+    OLD STR: * big array x 1.09 ops/sec ±2.15% (7 runs sampled)
+    OLD BUF: * big array x 1.23 ops/sec ±2.67% (8 runs sampled)
+
+    NEW STR: * big array x 273 ops/sec ±2.09% (85 runs sampled)
+    NEW BUF: * big array x 259 ops/sec ±1.32% (85 runs sampled)
+    (~10mb array with 1000 entries)
+
+## v.2.2.0 - 18 Nov, 2016
+
+Features
+
+- Improve `stringNumbers` parsing performance by up to 100%
+
+Bugfixes
+
+- Do not unref the interval anymore due to issues with NodeJS
+
+## v.2.1.1 - 31 Oct, 2016
+
+Bugfixes
+
+- Remove erroneously added const to support Node.js 0.10
+
+## v.2.1.0 - 30 Oct, 2016
+
+Features
+
+- Improve parser errors by adding more detailed information to them
+- Accept manipulated Object.prototypes
+- Unref the interval if used
+
+## v.2.0.4 - 21 Jul, 2016
+
+Bugfixes
+
+- Fixed multi byte characters getting corrupted
+
+## v.2.0.3 - 17 Jun, 2016
+
+Bugfixes
+
+- Fixed parser not working with huge buffers (e.g. 300 MB)
+
+## v.2.0.2 - 08 Jun, 2016
+
+Bugfixes
+
+- Fixed parser with returnBuffers option returning corrupted data
+
+## v.2.0.1 - 04 Jun, 2016
+
+Bugfixes
+
+- Fixed multiple parsers working concurrently resulting in faulty data in some cases
+
+## v.2.0.0 - 29 May, 2016
+
+The javascript parser got completely rewritten by [Michael Diarmid](https://github.com/Salakar) and [Ruben Bridgewater](https://github.com/BridgeAR) and is now a lot faster than the hiredis parser.
+Therefore the hiredis parser was deprecated and should only be used for testing purposes and benchmarking comparison.
+
+All Errors returned by the parser are from now on of class ReplyError
+
+Features
+
+- Improved performance by up to 15x as fast as before
+- Improved options validation
+- Added ReplyError Class
+- Added parser benchmark
+- Switched default parser from hiredis to JS, no matter if hiredis is installed or not
+
+Removed
+
+- Deprecated hiredis support
+
+## v.1.3.0 - 27 Mar, 2016
+
+Features
+
+- Added `auto` as parser name option to check what parser is available
+- Non existing requested parsers falls back into auto mode instead of always choosing the JS parser
+
+## v.1.2.0 - 27 Mar, 2016
+
+Features
+
+- Added `stringNumbers` option to make sure all numbers are returned as string instead of a js number for precision
+- The parser is from now on going to print warnings if a parser is explicitly requested that does not exist and gracefully chooses the JS parser
+
+## v.1.1.0 - 26 Jan, 2016
+
+Features
+
+- The parser is from now on going to reset itself on protocol errors
diff --git a/node_modules/redis-parser/index.js b/node_modules/redis-parser/index.js
new file mode 100644
index 0000000..f5de376
--- /dev/null
+++ b/node_modules/redis-parser/index.js
@@ -0,0 +1,3 @@
+'use strict'
+
+module.exports = require('./lib/parser')
diff --git a/node_modules/redis-parser/lib/parser.js b/node_modules/redis-parser/lib/parser.js
new file mode 100644
index 0000000..5d2532a
--- /dev/null
+++ b/node_modules/redis-parser/lib/parser.js
@@ -0,0 +1,552 @@
+'use strict'
+
+const Buffer = require('buffer').Buffer
+const StringDecoder = require('string_decoder').StringDecoder
+const decoder = new StringDecoder()
+const errors = require('redis-errors')
+const ReplyError = errors.ReplyError
+const ParserError = errors.ParserError
+var bufferPool = Buffer.allocUnsafe(32 * 1024)
+var bufferOffset = 0
+var interval = null
+var counter = 0
+var notDecreased = 0
+
+/**
+ * Used for integer numbers only
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|number}
+ */
+function parseSimpleNumbers (parser) {
+  const length = parser.buffer.length - 1
+  var offset = parser.offset
+  var number = 0
+  var sign = 1
+
+  if (parser.buffer[offset] === 45) {
+    sign = -1
+    offset++
+  }
+
+  while (offset < length) {
+    const c1 = parser.buffer[offset++]
+    if (c1 === 13) { // \r\n
+      parser.offset = offset + 1
+      return sign * number
+    }
+    number = (number * 10) + (c1 - 48)
+  }
+}
+
+/**
+ * Used for integer numbers in case of the returnNumbers option
+ *
+ * Reading the string as parts of n SMI is more efficient than
+ * using a string directly.
+ *
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|string}
+ */
+function parseStringNumbers (parser) {
+  const length = parser.buffer.length - 1
+  var offset = parser.offset
+  var number = 0
+  var res = ''
+
+  if (parser.buffer[offset] === 45) {
+    res += '-'
+    offset++
+  }
+
+  while (offset < length) {
+    var c1 = parser.buffer[offset++]
+    if (c1 === 13) { // \r\n
+      parser.offset = offset + 1
+      if (number !== 0) {
+        res += number
+      }
+      return res
+    } else if (number > 429496728) {
+      res += (number * 10) + (c1 - 48)
+      number = 0
+    } else if (c1 === 48 && number === 0) {
+      res += 0
+    } else {
+      number = (number * 10) + (c1 - 48)
+    }
+  }
+}
+
+/**
+ * Parse a '+' redis simple string response but forward the offsets
+ * onto convertBufferRange to generate a string.
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|string|Buffer}
+ */
+function parseSimpleString (parser) {
+  const start = parser.offset
+  const buffer = parser.buffer
+  const length = buffer.length - 1
+  var offset = start
+
+  while (offset < length) {
+    if (buffer[offset++] === 13) { // \r\n
+      parser.offset = offset + 1
+      if (parser.optionReturnBuffers === true) {
+        return parser.buffer.slice(start, offset - 1)
+      }
+      return parser.buffer.toString('utf8', start, offset - 1)
+    }
+  }
+}
+
+/**
+ * Returns the read length
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|number}
+ */
+function parseLength (parser) {
+  const length = parser.buffer.length - 1
+  var offset = parser.offset
+  var number = 0
+
+  while (offset < length) {
+    const c1 = parser.buffer[offset++]
+    if (c1 === 13) {
+      parser.offset = offset + 1
+      return number
+    }
+    number = (number * 10) + (c1 - 48)
+  }
+}
+
+/**
+ * Parse a ':' redis integer response
+ *
+ * If stringNumbers is activated the parser always returns numbers as string
+ * This is important for big numbers (number > Math.pow(2, 53)) as js numbers
+ * are 64bit floating point numbers with reduced precision
+ *
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|number|string}
+ */
+function parseInteger (parser) {
+  if (parser.optionStringNumbers === true) {
+    return parseStringNumbers(parser)
+  }
+  return parseSimpleNumbers(parser)
+}
+
+/**
+ * Parse a '$' redis bulk string response
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|null|string}
+ */
+function parseBulkString (parser) {
+  const length = parseLength(parser)
+  if (length === undefined) {
+    return
+  }
+  if (length < 0) {
+    return null
+  }
+  const offset = parser.offset + length
+  if (offset + 2 > parser.buffer.length) {
+    parser.bigStrSize = offset + 2
+    parser.totalChunkSize = parser.buffer.length
+    parser.bufferCache.push(parser.buffer)
+    return
+  }
+  const start = parser.offset
+  parser.offset = offset + 2
+  if (parser.optionReturnBuffers === true) {
+    return parser.buffer.slice(start, offset)
+  }
+  return parser.buffer.toString('utf8', start, offset)
+}
+
+/**
+ * Parse a '-' redis error response
+ * @param {JavascriptRedisParser} parser
+ * @returns {ReplyError}
+ */
+function parseError (parser) {
+  var string = parseSimpleString(parser)
+  if (string !== undefined) {
+    if (parser.optionReturnBuffers === true) {
+      string = string.toString()
+    }
+    return new ReplyError(string)
+  }
+}
+
+/**
+ * Parsing error handler, resets parser buffer
+ * @param {JavascriptRedisParser} parser
+ * @param {number} type
+ * @returns {undefined}
+ */
+function handleError (parser, type) {
+  const err = new ParserError(
+    'Protocol error, got ' + JSON.stringify(String.fromCharCode(type)) + ' as reply type byte',
+    JSON.stringify(parser.buffer),
+    parser.offset
+  )
+  parser.buffer = null
+  parser.returnFatalError(err)
+}
+
+/**
+ * Parse a '*' redis array response
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|null|any[]}
+ */
+function parseArray (parser) {
+  const length = parseLength(parser)
+  if (length === undefined) {
+    return
+  }
+  if (length < 0) {
+    return null
+  }
+  const responses = new Array(length)
+  return parseArrayElements(parser, responses, 0)
+}
+
+/**
+ * Push a partly parsed array to the stack
+ *
+ * @param {JavascriptRedisParser} parser
+ * @param {any[]} array
+ * @param {number} pos
+ * @returns {undefined}
+ */
+function pushArrayCache (parser, array, pos) {
+  parser.arrayCache.push(array)
+  parser.arrayPos.push(pos)
+}
+
+/**
+ * Parse chunked redis array response
+ * @param {JavascriptRedisParser} parser
+ * @returns {undefined|any[]}
+ */
+function parseArrayChunks (parser) {
+  const tmp = parser.arrayCache.pop()
+  var pos = parser.arrayPos.pop()
+  if (parser.arrayCache.length) {
+    const res = parseArrayChunks(parser)
+    if (res === undefined) {
+      pushArrayCache(parser, tmp, pos)
+      return
+    }
+    tmp[pos++] = res
+  }
+  return parseArrayElements(parser, tmp, pos)
+}
+
+/**
+ * Parse redis array response elements
+ * @param {JavascriptRedisParser} parser
+ * @param {Array} responses
+ * @param {number} i
+ * @returns {undefined|null|any[]}
+ */
+function parseArrayElements (parser, responses, i) {
+  const bufferLength = parser.buffer.length
+  while (i < responses.length) {
+    const offset = parser.offset
+    if (parser.offset >= bufferLength) {
+      pushArrayCache(parser, responses, i)
+      return
+    }
+    const response = parseType(parser, parser.buffer[parser.offset++])
+    if (response === undefined) {
+      if (!(parser.arrayCache.length || parser.bufferCache.length)) {
+        parser.offset = offset
+      }
+      pushArrayCache(parser, responses, i)
+      return
+    }
+    responses[i] = response
+    i++
+  }
+
+  return responses
+}
+
+/**
+ * Called the appropriate parser for the specified type.
+ *
+ * 36: $
+ * 43: +
+ * 42: *
+ * 58: :
+ * 45: -
+ *
+ * @param {JavascriptRedisParser} parser
+ * @param {number} type
+ * @returns {*}
+ */
+function parseType (parser, type) {
+  switch (type) {
+    case 36:
+      return parseBulkString(parser)
+    case 43:
+      return parseSimpleString(parser)
+    case 42:
+      return parseArray(parser)
+    case 58:
+      return parseInteger(parser)
+    case 45:
+      return parseError(parser)
+    default:
+      return handleError(parser, type)
+  }
+}
+
+/**
+ * Decrease the bufferPool size over time
+ *
+ * Balance between increasing and decreasing the bufferPool.
+ * Decrease the bufferPool by 10% by removing the first 10% of the current pool.
+ * @returns {undefined}
+ */
+function decreaseBufferPool () {
+  if (bufferPool.length > 50 * 1024) {
+    if (counter === 1 || notDecreased > counter * 2) {
+      const minSliceLen = Math.floor(bufferPool.length / 10)
+      const sliceLength = minSliceLen < bufferOffset
+        ? bufferOffset
+        : minSliceLen
+      bufferOffset = 0
+      bufferPool = bufferPool.slice(sliceLength, bufferPool.length)
+    } else {
+      notDecreased++
+      counter--
+    }
+  } else {
+    clearInterval(interval)
+    counter = 0
+    notDecreased = 0
+    interval = null
+  }
+}
+
+/**
+ * Check if the requested size fits in the current bufferPool.
+ * If it does not, reset and increase the bufferPool accordingly.
+ *
+ * @param {number} length
+ * @returns {undefined}
+ */
+function resizeBuffer (length) {
+  if (bufferPool.length < length + bufferOffset) {
+    const multiplier = length > 1024 * 1024 * 75 ? 2 : 3
+    if (bufferOffset > 1024 * 1024 * 111) {
+      bufferOffset = 1024 * 1024 * 50
+    }
+    bufferPool = Buffer.allocUnsafe(length * multiplier + bufferOffset)
+    bufferOffset = 0
+    counter++
+    if (interval === null) {
+      interval = setInterval(decreaseBufferPool, 50)
+    }
+  }
+}
+
+/**
+ * Concat a bulk string containing multiple chunks
+ *
+ * Notes:
+ * 1) The first chunk might contain the whole bulk string including the \r
+ * 2) We are only safe to fully add up elements that are neither the first nor any of the last two elements
+ *
+ * @param {JavascriptRedisParser} parser
+ * @returns {String}
+ */
+function concatBulkString (parser) {
+  const list = parser.bufferCache
+  const oldOffset = parser.offset
+  var chunks = list.length
+  var offset = parser.bigStrSize - parser.totalChunkSize
+  parser.offset = offset
+  if (offset <= 2) {
+    if (chunks === 2) {
+      return list[0].toString('utf8', oldOffset, list[0].length + offset - 2)
+    }
+    chunks--
+    offset = list[list.length - 2].length + offset
+  }
+  var res = decoder.write(list[0].slice(oldOffset))
+  for (var i = 1; i < chunks - 1; i++) {
+    res += decoder.write(list[i])
+  }
+  res += decoder.end(list[i].slice(0, offset - 2))
+  return res
+}
+
+/**
+ * Concat the collected chunks from parser.bufferCache.
+ *
+ * Increases the bufferPool size beforehand if necessary.
+ *
+ * @param {JavascriptRedisParser} parser
+ * @returns {Buffer}
+ */
+function concatBulkBuffer (parser) {
+  const list = parser.bufferCache
+  const oldOffset = parser.offset
+  const length = parser.bigStrSize - oldOffset - 2
+  var chunks = list.length
+  var offset = parser.bigStrSize - parser.totalChunkSize
+  parser.offset = offset
+  if (offset <= 2) {
+    if (chunks === 2) {
+      return list[0].slice(oldOffset, list[0].length + offset - 2)
+    }
+    chunks--
+    offset = list[list.length - 2].length + offset
+  }
+  resizeBuffer(length)
+  const start = bufferOffset
+  list[0].copy(bufferPool, start, oldOffset, list[0].length)
+  bufferOffset += list[0].length - oldOffset
+  for (var i = 1; i < chunks - 1; i++) {
+    list[i].copy(bufferPool, bufferOffset)
+    bufferOffset += list[i].length
+  }
+  list[i].copy(bufferPool, bufferOffset, 0, offset - 2)
+  bufferOffset += offset - 2
+  return bufferPool.slice(start, bufferOffset)
+}
+
+class JavascriptRedisParser {
+  /**
+   * Javascript Redis Parser constructor
+   * @param {{returnError: Function, returnReply: Function, returnFatalError?: Function, returnBuffers: boolean, stringNumbers: boolean }} options
+   * @constructor
+   */
+  constructor (options) {
+    if (!options) {
+      throw new TypeError('Options are mandatory.')
+    }
+    if (typeof options.returnError !== 'function' || typeof options.returnReply !== 'function') {
+      throw new TypeError('The returnReply and returnError options have to be functions.')
+    }
+    this.setReturnBuffers(!!options.returnBuffers)
+    this.setStringNumbers(!!options.stringNumbers)
+    this.returnError = options.returnError
+    this.returnFatalError = options.returnFatalError || options.returnError
+    this.returnReply = options.returnReply
+    this.reset()
+  }
+
+  /**
+   * Reset the parser values to the initial state
+   *
+   * @returns {undefined}
+   */
+  reset () {
+    this.offset = 0
+    this.buffer = null
+    this.bigStrSize = 0
+    this.totalChunkSize = 0
+    this.bufferCache = []
+    this.arrayCache = []
+    this.arrayPos = []
+  }
+
+  /**
+   * Set the returnBuffers option
+   *
+   * @param {boolean} returnBuffers
+   * @returns {undefined}
+   */
+  setReturnBuffers (returnBuffers) {
+    if (typeof returnBuffers !== 'boolean') {
+      throw new TypeError('The returnBuffers argument has to be a boolean')
+    }
+    this.optionReturnBuffers = returnBuffers
+  }
+
+  /**
+   * Set the stringNumbers option
+   *
+   * @param {boolean} stringNumbers
+   * @returns {undefined}
+   */
+  setStringNumbers (stringNumbers) {
+    if (typeof stringNumbers !== 'boolean') {
+      throw new TypeError('The stringNumbers argument has to be a boolean')
+    }
+    this.optionStringNumbers = stringNumbers
+  }
+
+  /**
+   * Parse the redis buffer
+   * @param {Buffer} buffer
+   * @returns {undefined}
+   */
+  execute (buffer) {
+    if (this.buffer === null) {
+      this.buffer = buffer
+      this.offset = 0
+    } else if (this.bigStrSize === 0) {
+      const oldLength = this.buffer.length
+      const remainingLength = oldLength - this.offset
+      const newBuffer = Buffer.allocUnsafe(remainingLength + buffer.length)
+      this.buffer.copy(newBuffer, 0, this.offset, oldLength)
+      buffer.copy(newBuffer, remainingLength, 0, buffer.length)
+      this.buffer = newBuffer
+      this.offset = 0
+      if (this.arrayCache.length) {
+        const arr = parseArrayChunks(this)
+        if (arr === undefined) {
+          return
+        }
+        this.returnReply(arr)
+      }
+    } else if (this.totalChunkSize + buffer.length >= this.bigStrSize) {
+      this.bufferCache.push(buffer)
+      var tmp = this.optionReturnBuffers ? concatBulkBuffer(this) : concatBulkString(this)
+      this.bigStrSize = 0
+      this.bufferCache = []
+      this.buffer = buffer
+      if (this.arrayCache.length) {
+        this.arrayCache[0][this.arrayPos[0]++] = tmp
+        tmp = parseArrayChunks(this)
+        if (tmp === undefined) {
+          return
+        }
+      }
+      this.returnReply(tmp)
+    } else {
+      this.bufferCache.push(buffer)
+      this.totalChunkSize += buffer.length
+      return
+    }
+
+    while (this.offset < this.buffer.length) {
+      const offset = this.offset
+      const type = this.buffer[this.offset++]
+      const response = parseType(this, type)
+      if (response === undefined) {
+        if (!(this.arrayCache.length || this.bufferCache.length)) {
+          this.offset = offset
+        }
+        return
+      }
+
+      if (type === 45) {
+        this.returnError(response)
+      } else {
+        this.returnReply(response)
+      }
+    }
+
+    this.buffer = null
+  }
+}
+
+module.exports = JavascriptRedisParser
diff --git a/node_modules/redis-parser/package.json b/node_modules/redis-parser/package.json
new file mode 100644
index 0000000..0c3287b
--- /dev/null
+++ b/node_modules/redis-parser/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "redis-parser",
+  "version": "3.0.0",
+  "description": "Javascript Redis protocol (RESP) parser",
+  "main": "index.js",
+  "scripts": {
+    "test": "npm run coverage",
+    "benchmark": "node ./benchmark",
+    "lint": "standard --fix",
+    "posttest": "npm run lint && npm run coverage:check",
+    "coverage": "node ./node_modules/istanbul/lib/cli.js cover --preserve-comments ./node_modules/mocha/bin/_mocha -- -R spec",
+    "coverage:check": "node ./node_modules/istanbul/lib/cli.js check-coverage --branch 100 --statement 100"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/NodeRedis/node-redis-parser.git"
+  },
+  "keywords": [
+    "redis",
+    "protocol",
+    "parser",
+    "database",
+    "javascript",
+    "node",
+    "nodejs",
+    "resp",
+    "hiredis"
+  ],
+  "engines": {
+    "node": ">=4"
+  },
+  "dependencies": {
+    "redis-errors": "^1.0.0"
+  },
+  "devDependencies": {
+    "benchmark": "^2.1.0",
+    "codeclimate-test-reporter": "^0.4.0",
+    "hiredis": "^0.5.0",
+    "istanbul": "^0.4.0",
+    "mocha": "^3.1.2",
+    "standard": "^10.0.0"
+  },
+  "author": "Ruben Bridgewater",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/NodeRedis/node-redis-parser/issues"
+  },
+  "homepage": "https://github.com/NodeRedis/node-redis-parser#readme",
+  "directories": {
+    "test": "test",
+    "lib": "lib"
+  }
+}
diff --git a/node_modules/seedrandom/.coveralls.yml b/node_modules/seedrandom/.coveralls.yml
new file mode 100644
index 0000000..9160059
--- /dev/null
+++ b/node_modules/seedrandom/.coveralls.yml
@@ -0,0 +1 @@
+service_name: travis-ci
diff --git a/node_modules/seedrandom/.nvmrc b/node_modules/seedrandom/.nvmrc
new file mode 100644
index 0000000..1e8b314
--- /dev/null
+++ b/node_modules/seedrandom/.nvmrc
@@ -0,0 +1 @@
+6
diff --git a/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json b/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
new file mode 100644
index 0000000..63d7513
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
@@ -0,0 +1 @@
+{"/home/davidbau/git/seedrandom/seedrandom.js":{"path":"/home/davidbau/git/seedrandom/seedrandom.js","statementMap":{"0":{"start":{"line":25,"column":0},"end":{"line":253,"column":2}},"1":{"start":{"line":30,"column":12},"end":{"line":30,"column":15}},"2":{"start":{"line":31,"column":13},"end":{"line":31,"column":14}},"3":{"start":{"line":32,"column":13},"end":{"line":32,"column":15}},"4":{"start":{"line":33,"column":14},"end":{"line":33,"column":22}},"5":{"start":{"line":34,"column":17},"end":{"line":34,"column":40}},"6":{"start":{"line":35,"column":19},"end":{"line":35,"column":38}},"7":{"start":{"line":36,"column":15},"end":{"line":36,"column":31}},"8":{"start":{"line":37,"column":11},"end":{"line":37,"column":20}},"9":{"start":{"line":45,"column":12},"end":{"line":45,"column":14}},"10":{"start":{"line":46,"column":2},"end":{"line":46,"column":68}},"11":{"start":{"line":49,"column":18},"end":{"line":51,"column":48}},"12":{"start":{"line":54,"column":13},"end":{"line":54,"column":26}},"13":{"start":{"line":58,"column":13},"end":{"line":73,"column":3}},"14":{"start":{"line":59,"column":12},"end":{"line":59,"column":26}},"15":{"start":{"line":60,"column":12},"end":{"line":60,"column":22}},"16":{"start":{"line":61,"column":12},"end":{"line":61,"column":13}},"17":{"start":{"line":62,"column":4},"end":{"line":66,"column":5}},"18":{"start":{"line":63,"column":6},"end":{"line":63,"column":26}},"19":{"start":{"line":64,"column":6},"end":{"line":64,"column":17}},"20":{"start":{"line":65,"column":6},"end":{"line":65,"column":20}},"21":{"start":{"line":67,"column":4},"end":{"line":71,"column":5}},"22":{"start":{"line":68,"column":6},"end":{"line":68,"column":13}},"23":{"start":{"line":69,"column":6},"end":{"line":69,"column":13}},"24":{"start":{"line":70,"column":6},"end":{"line":70,"column":15}},"25":{"start":{"line":72,"column":4},"end":{"line":72,"column":23}},"26":{"start":{"line":75,"column":2},"end":{"line":75,"column":51}},"27":{"start":{"line":75,"column":28},"end":{"line":75,"column":49}},"28":{"start":{"line":76,"column":2},"end":{"line":76,"column":61}},"29":{"start":{"line":76,"column":28},"end":{"line":76,"column":59}},"30":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}},"31":{"start":{"line":80,"column":2},"end":{"line":80,"column":33}},"32":{"start":{"line":83,"column":2},"end":{"line":103,"column":17}},"33":{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},"34":{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},"35":{"start":{"line":87,"column":25},"end":{"line":87,"column":43}},"36":{"start":{"line":89,"column":10},"end":{"line":89,"column":60}},"37":{"start":{"line":89,"column":36},"end":{"line":89,"column":58}},"38":{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},"39":{"start":{"line":94,"column":28},"end":{"line":94,"column":49}},"40":{"start":{"line":94,"column":50},"end":{"line":94,"column":62}},"41":{"start":{"line":98,"column":13},"end":{"line":98,"column":25}},"42":{"start":{"line":117,"column":18},"end":{"line":117,"column":28}},"43":{"start":{"line":118,"column":11},"end":{"line":118,"column":15}},"44":{"start":{"line":118,"column":21},"end":{"line":118,"column":22}},"45":{"start":{"line":118,"column":28},"end":{"line":118,"column":43}},"46":{"start":{"line":118,"column":49},"end":{"line":118,"column":58}},"47":{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},"48":{"start":{"line":121,"column":17},"end":{"line":121,"column":34}},"49":{"start":{"line":124,"column":2},"end":{"line":126,"column":3}},"50":{"start":{"line":125,"column":4},"end":{"line":125,"column":15}},"51":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"52":{"start":{"line":128,"column":4},"end":{"line":128,"column":60}},"53":{"start":{"line":129,"column":4},"end":{"line":129,"column":13}},"54":{"start":{"line":133,"column":2},"end":{"line":146,"column":12}},"55":{"start":{"line":135,"column":15},"end":{"line":135,"column":16}},"56":{"start":{"line":136,"column":12},"end":{"line":136,"column":16}},"57":{"start":{"line":136,"column":22},"end":{"line":136,"column":26}},"58":{"start":{"line":136,"column":32},"end":{"line":136,"column":36}},"59":{"start":{"line":137,"column":4},"end":{"line":140,"column":5}},"60":{"start":{"line":138,"column":6},"end":{"line":138,"column":32}},"61":{"start":{"line":139,"column":6},"end":{"line":139,"column":78}},"62":{"start":{"line":141,"column":4},"end":{"line":141,"column":13}},"63":{"start":{"line":141,"column":14},"end":{"line":141,"column":23}},"64":{"start":{"line":142,"column":4},"end":{"line":142,"column":13}},"65":{"start":{"line":154,"column":2},"end":{"line":154,"column":12}},"66":{"start":{"line":155,"column":2},"end":{"line":155,"column":12}},"67":{"start":{"line":156,"column":2},"end":{"line":156,"column":20}},"68":{"start":{"line":157,"column":2},"end":{"line":157,"column":11}},"69":{"start":{"line":165,"column":15},"end":{"line":165,"column":17}},"70":{"start":{"line":165,"column":26},"end":{"line":165,"column":36}},"71":{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},"72":{"start":{"line":167,"column":4},"end":{"line":169,"column":5}},"73":{"start":{"line":168,"column":6},"end":{"line":168,"column":70}},"74":{"start":{"line":168,"column":12},"end":{"line":168,"column":55}},"75":{"start":{"line":171,"column":2},"end":{"line":171,"column":71}},"76":{"start":{"line":180,"column":19},"end":{"line":180,"column":28}},"77":{"start":{"line":180,"column":41},"end":{"line":180,"column":42}},"78":{"start":{"line":181,"column":2},"end":{"line":184,"column":3}},"79":{"start":{"line":182,"column":4},"end":{"line":183,"column":74}},"80":{"start":{"line":185,"column":2},"end":{"line":185,"column":23}},"81":{"start":{"line":194,"column":2},"end":{"line":208,"column":3}},"82":{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},"83":{"start":{"line":198,"column":6},"end":{"line":198,"column":23}},"84":{"start":{"line":200,"column":6},"end":{"line":200,"column":34}},"85":{"start":{"line":201,"column":6},"end":{"line":201,"column":62}},"86":{"start":{"line":203,"column":4},"end":{"line":203,"column":25}},"87":{"start":{"line":205,"column":18},"end":{"line":205,"column":34}},"88":{"start":{"line":206,"column":18},"end":{"line":206,"column":44}},"89":{"start":{"line":207,"column":4},"end":{"line":207,"column":71}},"90":{"start":{"line":216,"column":2},"end":{"line":216,"column":41}},"91":{"start":{"line":226,"column":0},"end":{"line":226,"column":28}},"92":{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},"93":{"start":{"line":233,"column":2},"end":{"line":233,"column":30}},"94":{"start":{"line":235,"column":2},"end":{"line":237,"column":17}},"95":{"start":{"line":236,"column":4},"end":{"line":236,"column":35}},"96":{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},"97":{"start":{"line":239,"column":2},"end":{"line":239,"column":44}},"98":{"start":{"line":239,"column":22},"end":{"line":239,"column":40}},"99":{"start":{"line":242,"column":2},"end":{"line":242,"column":38}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":25,"column":1},"end":{"line":25,"column":2}},"loc":{"start":{"line":25,"column":31},"end":{"line":247,"column":1}},"line":25},"1":{"name":"seedrandom","decl":{"start":{"line":44,"column":9},"end":{"line":44,"column":19}},"loc":{"start":{"line":44,"column":45},"end":{"line":104,"column":1}},"line":44},"2":{"name":"(anonymous_2)","decl":{"start":{"line":58,"column":13},"end":{"line":58,"column":14}},"loc":{"start":{"line":58,"column":24},"end":{"line":73,"column":3}},"line":58},"3":{"name":"(anonymous_3)","decl":{"start":{"line":75,"column":15},"end":{"line":75,"column":16}},"loc":{"start":{"line":75,"column":26},"end":{"line":75,"column":51}},"line":75},"4":{"name":"(anonymous_4)","decl":{"start":{"line":76,"column":15},"end":{"line":76,"column":16}},"loc":{"start":{"line":76,"column":26},"end":{"line":76,"column":61}},"line":76},"5":{"name":"(anonymous_5)","decl":{"start":{"line":84,"column":6},"end":{"line":84,"column":7}},"loc":{"start":{"line":84,"column":48},"end":{"line":99,"column":7}},"line":84},"6":{"name":"(anonymous_6)","decl":{"start":{"line":89,"column":23},"end":{"line":89,"column":24}},"loc":{"start":{"line":89,"column":34},"end":{"line":89,"column":60}},"line":89},"7":{"name":"ARC4","decl":{"start":{"line":116,"column":9},"end":{"line":116,"column":13}},"loc":{"start":{"line":116,"column":19},"end":{"line":147,"column":1}},"line":116},"8":{"name":"(anonymous_8)","decl":{"start":{"line":133,"column":10},"end":{"line":133,"column":11}},"loc":{"start":{"line":133,"column":26},"end":{"line":146,"column":3}},"line":133},"9":{"name":"copy","decl":{"start":{"line":153,"column":9},"end":{"line":153,"column":13}},"loc":{"start":{"line":153,"column":20},"end":{"line":158,"column":1}},"line":153},"10":{"name":"flatten","decl":{"start":{"line":164,"column":9},"end":{"line":164,"column":16}},"loc":{"start":{"line":164,"column":29},"end":{"line":172,"column":1}},"line":164},"11":{"name":"mixkey","decl":{"start":{"line":179,"column":9},"end":{"line":179,"column":15}},"loc":{"start":{"line":179,"column":27},"end":{"line":186,"column":1}},"line":179},"12":{"name":"autoseed","decl":{"start":{"line":193,"column":9},"end":{"line":193,"column":17}},"loc":{"start":{"line":193,"column":20},"end":{"line":209,"column":1}},"line":193},"13":{"name":"tostring","decl":{"start":{"line":215,"column":9},"end":{"line":215,"column":17}},"loc":{"start":{"line":215,"column":21},"end":{"line":217,"column":1}},"line":215},"14":{"name":"(anonymous_14)","decl":{"start":{"line":239,"column":9},"end":{"line":239,"column":10}},"loc":{"start":{"line":239,"column":20},"end":{"line":239,"column":42}},"line":239}},"branchMap":{"0":{"loc":{"start":{"line":46,"column":12},"end":{"line":46,"column":67}},"type":"cond-expr","locations":[{"start":{"line":46,"column":32},"end":{"line":46,"column":49}},{"start":{"line":46,"column":53},"end":{"line":46,"column":66}}],"line":46},"1":{"loc":{"start":{"line":46,"column":53},"end":{"line":46,"column":66}},"type":"binary-expr","locations":[{"start":{"line":46,"column":53},"end":{"line":46,"column":60}},{"start":{"line":46,"column":64},"end":{"line":46,"column":66}}],"line":46},"2":{"loc":{"start":{"line":50,"column":4},"end":{"line":51,"column":38}},"type":"cond-expr","locations":[{"start":{"line":50,"column":22},"end":{"line":50,"column":44}},{"start":{"line":51,"column":4},"end":{"line":51,"column":38}}],"line":50},"3":{"loc":{"start":{"line":51,"column":4},"end":{"line":51,"column":38}},"type":"cond-expr","locations":[{"start":{"line":51,"column":21},"end":{"line":51,"column":31}},{"start":{"line":51,"column":34},"end":{"line":51,"column":38}}],"line":51},"4":{"loc":{"start":{"line":83,"column":10},"end":{"line":99,"column":7}},"type":"binary-expr","locations":[{"start":{"line":83,"column":10},"end":{"line":83,"column":22}},{"start":{"line":83,"column":26},"end":{"line":83,"column":34}},{"start":{"line":84,"column":6},"end":{"line":99,"column":7}}],"line":83},"5":{"loc":{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},"type":"if","locations":[{"start":{"line":85,"column":8},"end":{"line":90,"column":9}},{"start":{"line":85,"column":8},"end":{"line":90,"column":9}}],"line":85},"6":{"loc":{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},"type":"if","locations":[{"start":{"line":87,"column":10},"end":{"line":87,"column":45}},{"start":{"line":87,"column":10},"end":{"line":87,"column":45}}],"line":87},"7":{"loc":{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},"type":"if","locations":[{"start":{"line":94,"column":8},"end":{"line":98,"column":25}},{"start":{"line":94,"column":8},"end":{"line":98,"column":25}}],"line":94},"8":{"loc":{"start":{"line":102,"column":2},"end":{"line":102,"column":55}},"type":"cond-expr","locations":[{"start":{"line":102,"column":24},"end":{"line":102,"column":38}},{"start":{"line":102,"column":42},"end":{"line":102,"column":54}}],"line":102},"9":{"loc":{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},"type":"if","locations":[{"start":{"line":121,"column":2},"end":{"line":121,"column":36}},{"start":{"line":121,"column":2},"end":{"line":121,"column":36}}],"line":121},"10":{"loc":{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},"type":"if","locations":[{"start":{"line":166,"column":2},"end":{"line":170,"column":3}},{"start":{"line":166,"column":2},"end":{"line":170,"column":3}}],"line":166},"11":{"loc":{"start":{"line":166,"column":6},"end":{"line":166,"column":30}},"type":"binary-expr","locations":[{"start":{"line":166,"column":6},"end":{"line":166,"column":11}},{"start":{"line":166,"column":15},"end":{"line":166,"column":30}}],"line":166},"12":{"loc":{"start":{"line":171,"column":10},"end":{"line":171,"column":69}},"type":"cond-expr","locations":[{"start":{"line":171,"column":26},"end":{"line":171,"column":32}},{"start":{"line":171,"column":35},"end":{"line":171,"column":69}}],"line":171},"13":{"loc":{"start":{"line":171,"column":35},"end":{"line":171,"column":69}},"type":"cond-expr","locations":[{"start":{"line":171,"column":53},"end":{"line":171,"column":56}},{"start":{"line":171,"column":59},"end":{"line":171,"column":69}}],"line":171},"14":{"loc":{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},"type":"if","locations":[{"start":{"line":196,"column":4},"end":{"line":202,"column":5}},{"start":{"line":196,"column":4},"end":{"line":202,"column":5}}],"line":196},"15":{"loc":{"start":{"line":196,"column":8},"end":{"line":196,"column":52}},"type":"binary-expr","locations":[{"start":{"line":196,"column":8},"end":{"line":196,"column":18}},{"start":{"line":196,"column":23},"end":{"line":196,"column":51}}],"line":196},"16":{"loc":{"start":{"line":201,"column":7},"end":{"line":201,"column":39}},"type":"binary-expr","locations":[{"start":{"line":201,"column":7},"end":{"line":201,"column":20}},{"start":{"line":201,"column":24},"end":{"line":201,"column":39}}],"line":201},"17":{"loc":{"start":{"line":206,"column":18},"end":{"line":206,"column":44}},"type":"binary-expr","locations":[{"start":{"line":206,"column":18},"end":{"line":206,"column":25}},{"start":{"line":206,"column":29},"end":{"line":206,"column":44}}],"line":206},"18":{"loc":{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},"type":"if","locations":[{"start":{"line":232,"column":0},"end":{"line":243,"column":1}},{"start":{"line":232,"column":0},"end":{"line":243,"column":1}}],"line":232},"19":{"loc":{"start":{"line":232,"column":4},"end":{"line":232,"column":49}},"type":"binary-expr","locations":[{"start":{"line":232,"column":4},"end":{"line":232,"column":31}},{"start":{"line":232,"column":35},"end":{"line":232,"column":49}}],"line":232},"20":{"loc":{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},"type":"if","locations":[{"start":{"line":238,"column":7},"end":{"line":243,"column":1}},{"start":{"line":238,"column":7},"end":{"line":243,"column":1}}],"line":238},"21":{"loc":{"start":{"line":238,"column":11},"end":{"line":238,"column":54}},"type":"binary-expr","locations":[{"start":{"line":238,"column":11},"end":{"line":238,"column":40}},{"start":{"line":238,"column":44},"end":{"line":238,"column":54}}],"line":238},"22":{"loc":{"start":{"line":250,"column":2},"end":{"line":250,"column":45}},"type":"cond-expr","locations":[{"start":{"line":250,"column":34},"end":{"line":250,"column":38}},{"start":{"line":250,"column":41},"end":{"line":250,"column":45}}],"line":250}},"s":{"0":6,"1":6,"2":6,"3":6,"4":6,"5":6,"6":6,"7":6,"8":6,"9":23,"10":23,"11":23,"12":23,"13":23,"14":3694,"15":3694,"16":3694,"17":3694,"18":3917,"19":3917,"20":3917,"21":3694,"22":9249,"23":9249,"24":9249,"25":3694,"26":23,"27":1025,"28":23,"29":4100001,"30":23,"31":23,"32":23,"33":20,"34":4,"35":2,"36":4,"37":2,"38":20,"39":1,"40":1,"41":19,"42":23,"43":23,"44":23,"45":23,"46":23,"47":23,"48":1,"49":23,"50":5888,"51":23,"52":5888,"53":5888,"54":23,"55":4108660,"56":4108660,"57":4108660,"58":4108660,"59":4108660,"60":16436073,"61":16436073,"62":4108660,"63":4108660,"64":4108660,"65":4,"66":4,"67":4,"68":4,"69":32,"70":32,"71":32,"72":4,"73":9,"74":9,"75":32,"76":52,"77":52,"78":52,"79":7735,"80":52,"81":4,"82":4,"83":3,"84":1,"85":1,"86":3,"87":1,"88":1,"89":1,"90":81,"91":6,"92":6,"93":6,"94":6,"95":6,"96":0,"97":0,"98":0,"99":0},"f":{"0":6,"1":23,"2":3694,"3":1025,"4":4100001,"5":20,"6":2,"7":23,"8":4108660,"9":4,"10":32,"11":52,"12":4,"13":81,"14":0},"b":{"0":[1,22],"1":[22,11],"2":[2,21],"3":[4,17],"4":[23,21,20],"5":[4,16],"6":[2,2],"7":[1,19],"8":[4,19],"9":[1,22],"10":[4,28],"11":[32,32],"12":[3,29],"13":[23,6],"14":[3,1],"15":[4,3],"16":[1,1],"17":[1,0],"18":[6,0],"19":[6,6],"20":[0,0],"21":[0,0],"22":[0,6]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"51713684804e6a2df630b16f82a817311168866e","contentHash":"8249b27b9573baed43d58f17ab1b4f20f9b703bbe06145f517fc6c05c6b6cfa4"},"/home/davidbau/git/seedrandom/lib/xor128.js":{"path":"/home/davidbau/git/seedrandom/lib/xor128.js","statementMap":{"0":{"start":{"line":4,"column":0},"end":{"line":79,"column":2}},"1":{"start":{"line":7,"column":11},"end":{"line":7,"column":15}},"2":{"start":{"line":7,"column":27},"end":{"line":7,"column":29}},"3":{"start":{"line":9,"column":2},"end":{"line":9,"column":11}},"4":{"start":{"line":10,"column":2},"end":{"line":10,"column":11}},"5":{"start":{"line":11,"column":2},"end":{"line":11,"column":11}},"6":{"start":{"line":12,"column":2},"end":{"line":12,"column":11}},"7":{"start":{"line":15,"column":2},"end":{"line":21,"column":4}},"8":{"start":{"line":16,"column":12},"end":{"line":16,"column":31}},"9":{"start":{"line":17,"column":4},"end":{"line":17,"column":16}},"10":{"start":{"line":18,"column":4},"end":{"line":18,"column":16}},"11":{"start":{"line":19,"column":4},"end":{"line":19,"column":16}},"12":{"start":{"line":20,"column":4},"end":{"line":20,"column":49}},"13":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"14":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"15":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"16":{"start":{"line":32,"column":2},"end":{"line":35,"column":3}},"17":{"start":{"line":32,"column":15},"end":{"line":32,"column":16}},"18":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"19":{"start":{"line":34,"column":4},"end":{"line":34,"column":14}},"20":{"start":{"line":39,"column":2},"end":{"line":39,"column":12}},"21":{"start":{"line":40,"column":2},"end":{"line":40,"column":12}},"22":{"start":{"line":41,"column":2},"end":{"line":41,"column":12}},"23":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"24":{"start":{"line":43,"column":2},"end":{"line":43,"column":11}},"25":{"start":{"line":47,"column":11},"end":{"line":47,"column":27}},"26":{"start":{"line":48,"column":14},"end":{"line":48,"column":32}},"27":{"start":{"line":49,"column":13},"end":{"line":49,"column":67}},"28":{"start":{"line":49,"column":26},"end":{"line":49,"column":65}},"29":{"start":{"line":50,"column":2},"end":{"line":57,"column":4}},"30":{"start":{"line":51,"column":4},"end":{"line":55,"column":27}},"31":{"start":{"line":52,"column":16},"end":{"line":52,"column":32}},"32":{"start":{"line":53,"column":16},"end":{"line":53,"column":47}},"33":{"start":{"line":54,"column":19},"end":{"line":54,"column":42}},"34":{"start":{"line":56,"column":4},"end":{"line":56,"column":18}},"35":{"start":{"line":58,"column":2},"end":{"line":58,"column":23}},"36":{"start":{"line":59,"column":2},"end":{"line":59,"column":20}},"37":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"38":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"39":{"start":{"line":61,"column":35},"end":{"line":61,"column":51}},"40":{"start":{"line":62,"column":4},"end":{"line":62,"column":52}},"41":{"start":{"line":62,"column":30},"end":{"line":62,"column":50}},"42":{"start":{"line":64,"column":2},"end":{"line":64,"column":14}},"43":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"44":{"start":{"line":68,"column":2},"end":{"line":68,"column":24}},"45":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"46":{"start":{"line":70,"column":2},"end":{"line":70,"column":38}},"47":{"start":{"line":70,"column":22},"end":{"line":70,"column":34}},"48":{"start":{"line":72,"column":2},"end":{"line":72,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":4,"column":1},"end":{"line":4,"column":2}},"loc":{"start":{"line":4,"column":34},"end":{"line":75,"column":1}},"line":4},"1":{"name":"XorGen","decl":{"start":{"line":6,"column":9},"end":{"line":6,"column":15}},"loc":{"start":{"line":6,"column":22},"end":{"line":36,"column":1}},"line":6},"2":{"name":"(anonymous_2)","decl":{"start":{"line":15,"column":12},"end":{"line":15,"column":13}},"loc":{"start":{"line":15,"column":23},"end":{"line":21,"column":3}},"line":15},"3":{"name":"copy","decl":{"start":{"line":38,"column":9},"end":{"line":38,"column":13}},"loc":{"start":{"line":38,"column":20},"end":{"line":44,"column":1}},"line":38},"4":{"name":"impl","decl":{"start":{"line":46,"column":9},"end":{"line":46,"column":13}},"loc":{"start":{"line":46,"column":26},"end":{"line":65,"column":1}},"line":46},"5":{"name":"(anonymous_5)","decl":{"start":{"line":49,"column":13},"end":{"line":49,"column":14}},"loc":{"start":{"line":49,"column":24},"end":{"line":49,"column":67}},"line":49},"6":{"name":"(anonymous_6)","decl":{"start":{"line":50,"column":16},"end":{"line":50,"column":17}},"loc":{"start":{"line":50,"column":27},"end":{"line":57,"column":3}},"line":50},"7":{"name":"(anonymous_7)","decl":{"start":{"line":62,"column":17},"end":{"line":62,"column":18}},"loc":{"start":{"line":62,"column":28},"end":{"line":62,"column":52}},"line":62},"8":{"name":"(anonymous_8)","decl":{"start":{"line":70,"column":9},"end":{"line":70,"column":10}},"loc":{"start":{"line":70,"column":20},"end":{"line":70,"column":36}},"line":70}},"branchMap":{"0":{"loc":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},{"start":{"line":23,"column":2},"end":{"line":29,"column":3}}],"line":23},"1":{"loc":{"start":{"line":48,"column":14},"end":{"line":48,"column":32}},"type":"binary-expr","locations":[{"start":{"line":48,"column":14},"end":{"line":48,"column":18}},{"start":{"line":48,"column":22},"end":{"line":48,"column":32}}],"line":48},"2":{"loc":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"type":"if","locations":[{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},{"start":{"line":60,"column":2},"end":{"line":63,"column":3}}],"line":60},"3":{"loc":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"type":"if","locations":[{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},{"start":{"line":61,"column":4},"end":{"line":61,"column":51}}],"line":61},"4":{"loc":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"type":"if","locations":[{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},{"start":{"line":67,"column":0},"end":{"line":73,"column":1}}],"line":67},"5":{"loc":{"start":{"line":67,"column":4},"end":{"line":67,"column":28}},"type":"binary-expr","locations":[{"start":{"line":67,"column":4},"end":{"line":67,"column":10}},{"start":{"line":67,"column":14},"end":{"line":67,"column":28}}],"line":67},"6":{"loc":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"type":"if","locations":[{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},{"start":{"line":69,"column":7},"end":{"line":73,"column":1}}],"line":69},"7":{"loc":{"start":{"line":69,"column":11},"end":{"line":69,"column":31}},"type":"binary-expr","locations":[{"start":{"line":69,"column":11},"end":{"line":69,"column":17}},{"start":{"line":69,"column":21},"end":{"line":69,"column":31}}],"line":69},"8":{"loc":{"start":{"line":77,"column":2},"end":{"line":77,"column":39}},"type":"binary-expr","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":29}},{"start":{"line":77,"column":33},"end":{"line":77,"column":39}}],"line":77},"9":{"loc":{"start":{"line":78,"column":2},"end":{"line":78,"column":41}},"type":"binary-expr","locations":[{"start":{"line":78,"column":2},"end":{"line":78,"column":31}},{"start":{"line":78,"column":35},"end":{"line":78,"column":41}}],"line":78}},"s":{"0":1,"1":3,"2":3,"3":3,"4":3,"5":3,"6":3,"7":3,"8":4105327,"9":4105327,"10":4105327,"11":4105327,"12":4105327,"13":3,"14":2,"15":1,"16":3,"17":3,"18":198,"19":198,"20":2,"21":2,"22":2,"23":2,"24":2,"25":3,"26":3,"27":3,"28":4102054,"29":3,"30":1025,"31":1025,"32":1025,"33":1025,"34":1025,"35":3,"36":3,"37":3,"38":2,"39":1,"40":2,"41":1,"42":3,"43":1,"44":1,"45":0,"46":0,"47":0,"48":0},"f":{"0":1,"1":3,"2":4105327,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,2],"2":[2,1],"3":[1,1],"4":[1,0],"5":[1,1],"6":[0,0],"7":[0,0],"8":[1,1],"9":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"42c805c53b8a22e4d141f90ddecc8031ba21211b","contentHash":"2bd5b1ea82454991d6453cdd05e909475478ffed8cf6dd0ce02556ae981256d8"},"/home/davidbau/git/seedrandom/lib/xorwow.js":{"path":"/home/davidbau/git/seedrandom/lib/xorwow.js","statementMap":{"0":{"start":{"line":4,"column":0},"end":{"line":84,"column":2}},"1":{"start":{"line":7,"column":11},"end":{"line":7,"column":15}},"2":{"start":{"line":7,"column":27},"end":{"line":7,"column":29}},"3":{"start":{"line":10,"column":2},"end":{"line":15,"column":4}},"4":{"start":{"line":11,"column":13},"end":{"line":11,"column":32}},"5":{"start":{"line":12,"column":4},"end":{"line":12,"column":16}},"6":{"start":{"line":12,"column":17},"end":{"line":12,"column":29}},"7":{"start":{"line":12,"column":30},"end":{"line":12,"column":42}},"8":{"start":{"line":12,"column":43},"end":{"line":12,"column":55}},"9":{"start":{"line":13,"column":4},"end":{"line":14,"column":58}},"10":{"start":{"line":17,"column":2},"end":{"line":17,"column":11}},"11":{"start":{"line":18,"column":2},"end":{"line":18,"column":11}},"12":{"start":{"line":19,"column":2},"end":{"line":19,"column":11}},"13":{"start":{"line":20,"column":2},"end":{"line":20,"column":11}},"14":{"start":{"line":21,"column":2},"end":{"line":21,"column":11}},"15":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"16":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"17":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"18":{"start":{"line":32,"column":2},"end":{"line":38,"column":3}},"19":{"start":{"line":32,"column":15},"end":{"line":32,"column":16}},"20":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"21":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"22":{"start":{"line":35,"column":6},"end":{"line":35,"column":37}},"23":{"start":{"line":37,"column":4},"end":{"line":37,"column":14}},"24":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"25":{"start":{"line":43,"column":2},"end":{"line":43,"column":12}},"26":{"start":{"line":44,"column":2},"end":{"line":44,"column":12}},"27":{"start":{"line":45,"column":2},"end":{"line":45,"column":12}},"28":{"start":{"line":46,"column":2},"end":{"line":46,"column":12}},"29":{"start":{"line":47,"column":2},"end":{"line":47,"column":12}},"30":{"start":{"line":48,"column":2},"end":{"line":48,"column":11}},"31":{"start":{"line":52,"column":11},"end":{"line":52,"column":27}},"32":{"start":{"line":53,"column":14},"end":{"line":53,"column":32}},"33":{"start":{"line":54,"column":13},"end":{"line":54,"column":67}},"34":{"start":{"line":54,"column":26},"end":{"line":54,"column":65}},"35":{"start":{"line":55,"column":2},"end":{"line":62,"column":4}},"36":{"start":{"line":56,"column":4},"end":{"line":60,"column":27}},"37":{"start":{"line":57,"column":16},"end":{"line":57,"column":32}},"38":{"start":{"line":58,"column":16},"end":{"line":58,"column":47}},"39":{"start":{"line":59,"column":19},"end":{"line":59,"column":42}},"40":{"start":{"line":61,"column":4},"end":{"line":61,"column":18}},"41":{"start":{"line":63,"column":2},"end":{"line":63,"column":23}},"42":{"start":{"line":64,"column":2},"end":{"line":64,"column":20}},"43":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"44":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"45":{"start":{"line":66,"column":35},"end":{"line":66,"column":51}},"46":{"start":{"line":67,"column":4},"end":{"line":67,"column":52}},"47":{"start":{"line":67,"column":30},"end":{"line":67,"column":50}},"48":{"start":{"line":69,"column":2},"end":{"line":69,"column":14}},"49":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"50":{"start":{"line":73,"column":2},"end":{"line":73,"column":24}},"51":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":38}},"53":{"start":{"line":75,"column":22},"end":{"line":75,"column":34}},"54":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":4,"column":1},"end":{"line":4,"column":2}},"loc":{"start":{"line":4,"column":34},"end":{"line":80,"column":1}},"line":4},"1":{"name":"XorGen","decl":{"start":{"line":6,"column":9},"end":{"line":6,"column":15}},"loc":{"start":{"line":6,"column":22},"end":{"line":39,"column":1}},"line":6},"2":{"name":"(anonymous_2)","decl":{"start":{"line":10,"column":12},"end":{"line":10,"column":13}},"loc":{"start":{"line":10,"column":23},"end":{"line":15,"column":3}},"line":10},"3":{"name":"copy","decl":{"start":{"line":41,"column":9},"end":{"line":41,"column":13}},"loc":{"start":{"line":41,"column":20},"end":{"line":49,"column":1}},"line":41},"4":{"name":"impl","decl":{"start":{"line":51,"column":9},"end":{"line":51,"column":13}},"loc":{"start":{"line":51,"column":26},"end":{"line":70,"column":1}},"line":51},"5":{"name":"(anonymous_5)","decl":{"start":{"line":54,"column":13},"end":{"line":54,"column":14}},"loc":{"start":{"line":54,"column":24},"end":{"line":54,"column":67}},"line":54},"6":{"name":"(anonymous_6)","decl":{"start":{"line":55,"column":16},"end":{"line":55,"column":17}},"loc":{"start":{"line":55,"column":27},"end":{"line":62,"column":3}},"line":55},"7":{"name":"(anonymous_7)","decl":{"start":{"line":67,"column":17},"end":{"line":67,"column":18}},"loc":{"start":{"line":67,"column":28},"end":{"line":67,"column":52}},"line":67},"8":{"name":"(anonymous_8)","decl":{"start":{"line":75,"column":9},"end":{"line":75,"column":10}},"loc":{"start":{"line":75,"column":20},"end":{"line":75,"column":36}},"line":75}},"branchMap":{"0":{"loc":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},{"start":{"line":23,"column":2},"end":{"line":29,"column":3}}],"line":23},"1":{"loc":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"type":"if","locations":[{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},{"start":{"line":34,"column":4},"end":{"line":36,"column":5}}],"line":34},"2":{"loc":{"start":{"line":53,"column":14},"end":{"line":53,"column":32}},"type":"binary-expr","locations":[{"start":{"line":53,"column":14},"end":{"line":53,"column":18}},{"start":{"line":53,"column":22},"end":{"line":53,"column":32}}],"line":53},"3":{"loc":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"type":"if","locations":[{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},{"start":{"line":65,"column":2},"end":{"line":68,"column":3}}],"line":65},"4":{"loc":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"type":"if","locations":[{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},{"start":{"line":66,"column":4},"end":{"line":66,"column":51}}],"line":66},"5":{"loc":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"type":"if","locations":[{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},{"start":{"line":72,"column":0},"end":{"line":78,"column":1}}],"line":72},"6":{"loc":{"start":{"line":72,"column":4},"end":{"line":72,"column":28}},"type":"binary-expr","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":10}},{"start":{"line":72,"column":14},"end":{"line":72,"column":28}}],"line":72},"7":{"loc":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"type":"if","locations":[{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},{"start":{"line":74,"column":7},"end":{"line":78,"column":1}}],"line":74},"8":{"loc":{"start":{"line":74,"column":11},"end":{"line":74,"column":31}},"type":"binary-expr","locations":[{"start":{"line":74,"column":11},"end":{"line":74,"column":17}},{"start":{"line":74,"column":21},"end":{"line":74,"column":31}}],"line":74},"9":{"loc":{"start":{"line":82,"column":2},"end":{"line":82,"column":39}},"type":"binary-expr","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":29}},{"start":{"line":82,"column":33},"end":{"line":82,"column":39}}],"line":82},"10":{"loc":{"start":{"line":83,"column":2},"end":{"line":83,"column":41}},"type":"binary-expr","locations":[{"start":{"line":83,"column":2},"end":{"line":83,"column":31}},{"start":{"line":83,"column":35},"end":{"line":83,"column":41}}],"line":83}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105327,"5":4105327,"6":4105327,"7":4105327,"8":4105327,"9":4105327,"10":3,"11":3,"12":3,"13":3,"14":3,"15":3,"16":2,"17":1,"18":3,"19":3,"20":198,"21":198,"22":3,"23":198,"24":2,"25":2,"26":2,"27":2,"28":2,"29":2,"30":2,"31":3,"32":3,"33":3,"34":4102054,"35":3,"36":1025,"37":1025,"38":1025,"39":1025,"40":1025,"41":3,"42":3,"43":3,"44":2,"45":1,"46":2,"47":1,"48":3,"49":1,"50":1,"51":0,"52":0,"53":0,"54":0},"f":{"0":1,"1":3,"2":4105327,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,195],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"279728a54e5ce9face1abbf1b1093f69bd5e2cef","contentHash":"870bba719eee59f28e0160645190fa7eda491db1be3c64600c523d0b510d2000"},"/home/davidbau/git/seedrandom/lib/xorshift7.js":{"path":"/home/davidbau/git/seedrandom/lib/xorshift7.js","statementMap":{"0":{"start":{"line":6,"column":0},"end":{"line":96,"column":2}},"1":{"start":{"line":9,"column":11},"end":{"line":9,"column":15}},"2":{"start":{"line":12,"column":2},"end":{"line":23,"column":4}},"3":{"start":{"line":14,"column":12},"end":{"line":14,"column":16}},"4":{"start":{"line":14,"column":22},"end":{"line":14,"column":26}},"5":{"start":{"line":15,"column":4},"end":{"line":15,"column":13}},"6":{"start":{"line":15,"column":14},"end":{"line":15,"column":29}},"7":{"start":{"line":15,"column":30},"end":{"line":15,"column":48}},"8":{"start":{"line":16,"column":4},"end":{"line":16,"column":23}},"9":{"start":{"line":16,"column":24},"end":{"line":16,"column":44}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":23}},"11":{"start":{"line":17,"column":24},"end":{"line":17,"column":43}},"12":{"start":{"line":18,"column":4},"end":{"line":18,"column":23}},"13":{"start":{"line":18,"column":24},"end":{"line":18,"column":42}},"14":{"start":{"line":19,"column":4},"end":{"line":19,"column":23}},"15":{"start":{"line":19,"column":24},"end":{"line":19,"column":42}},"16":{"start":{"line":19,"column":43},"end":{"line":19,"column":61}},"17":{"start":{"line":20,"column":4},"end":{"line":20,"column":13}},"18":{"start":{"line":21,"column":4},"end":{"line":21,"column":23}},"19":{"start":{"line":22,"column":4},"end":{"line":22,"column":13}},"20":{"start":{"line":26,"column":18},"end":{"line":26,"column":20}},"21":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"22":{"start":{"line":30,"column":6},"end":{"line":30,"column":22}},"23":{"start":{"line":33,"column":6},"end":{"line":33,"column":23}},"24":{"start":{"line":34,"column":6},"end":{"line":37,"column":7}},"25":{"start":{"line":35,"column":8},"end":{"line":36,"column":56}},"26":{"start":{"line":40,"column":4},"end":{"line":40,"column":35}},"27":{"start":{"line":40,"column":25},"end":{"line":40,"column":35}},"28":{"start":{"line":41,"column":4},"end":{"line":41,"column":42}},"29":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"30":{"start":{"line":42,"column":16},"end":{"line":42,"column":30}},"31":{"start":{"line":42,"column":36},"end":{"line":42,"column":45}},"32":{"start":{"line":44,"column":4},"end":{"line":44,"column":13}},"33":{"start":{"line":45,"column":4},"end":{"line":45,"column":13}},"34":{"start":{"line":48,"column":4},"end":{"line":50,"column":5}},"35":{"start":{"line":49,"column":6},"end":{"line":49,"column":16}},"36":{"start":{"line":53,"column":2},"end":{"line":53,"column":17}},"37":{"start":{"line":57,"column":2},"end":{"line":57,"column":20}},"38":{"start":{"line":58,"column":2},"end":{"line":58,"column":12}},"39":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"40":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"41":{"start":{"line":63,"column":20},"end":{"line":63,"column":39}},"42":{"start":{"line":64,"column":11},"end":{"line":64,"column":27}},"43":{"start":{"line":65,"column":14},"end":{"line":65,"column":32}},"44":{"start":{"line":66,"column":13},"end":{"line":66,"column":67}},"45":{"start":{"line":66,"column":26},"end":{"line":66,"column":65}},"46":{"start":{"line":67,"column":2},"end":{"line":74,"column":4}},"47":{"start":{"line":68,"column":4},"end":{"line":72,"column":27}},"48":{"start":{"line":69,"column":16},"end":{"line":69,"column":32}},"49":{"start":{"line":70,"column":16},"end":{"line":70,"column":47}},"50":{"start":{"line":71,"column":19},"end":{"line":71,"column":42}},"51":{"start":{"line":73,"column":4},"end":{"line":73,"column":18}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":23}},"53":{"start":{"line":76,"column":2},"end":{"line":76,"column":20}},"54":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"55":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"56":{"start":{"line":78,"column":17},"end":{"line":78,"column":33}},"57":{"start":{"line":79,"column":4},"end":{"line":79,"column":52}},"58":{"start":{"line":79,"column":30},"end":{"line":79,"column":50}},"59":{"start":{"line":81,"column":2},"end":{"line":81,"column":14}},"60":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"61":{"start":{"line":85,"column":2},"end":{"line":85,"column":24}},"62":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"63":{"start":{"line":87,"column":2},"end":{"line":87,"column":38}},"64":{"start":{"line":87,"column":22},"end":{"line":87,"column":34}},"65":{"start":{"line":89,"column":2},"end":{"line":89,"column":24}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":6,"column":1},"end":{"line":6,"column":2}},"loc":{"start":{"line":6,"column":34},"end":{"line":92,"column":1}},"line":6},"1":{"name":"XorGen","decl":{"start":{"line":8,"column":9},"end":{"line":8,"column":15}},"loc":{"start":{"line":8,"column":22},"end":{"line":54,"column":1}},"line":8},"2":{"name":"(anonymous_2)","decl":{"start":{"line":12,"column":12},"end":{"line":12,"column":13}},"loc":{"start":{"line":12,"column":23},"end":{"line":23,"column":3}},"line":12},"3":{"name":"init","decl":{"start":{"line":25,"column":11},"end":{"line":25,"column":15}},"loc":{"start":{"line":25,"column":26},"end":{"line":51,"column":3}},"line":25},"4":{"name":"copy","decl":{"start":{"line":56,"column":9},"end":{"line":56,"column":13}},"loc":{"start":{"line":56,"column":20},"end":{"line":60,"column":1}},"line":56},"5":{"name":"impl","decl":{"start":{"line":62,"column":9},"end":{"line":62,"column":13}},"loc":{"start":{"line":62,"column":26},"end":{"line":82,"column":1}},"line":62},"6":{"name":"(anonymous_6)","decl":{"start":{"line":66,"column":13},"end":{"line":66,"column":14}},"loc":{"start":{"line":66,"column":24},"end":{"line":66,"column":67}},"line":66},"7":{"name":"(anonymous_7)","decl":{"start":{"line":67,"column":16},"end":{"line":67,"column":17}},"loc":{"start":{"line":67,"column":27},"end":{"line":74,"column":3}},"line":67},"8":{"name":"(anonymous_8)","decl":{"start":{"line":79,"column":17},"end":{"line":79,"column":18}},"loc":{"start":{"line":79,"column":28},"end":{"line":79,"column":52}},"line":79},"9":{"name":"(anonymous_9)","decl":{"start":{"line":87,"column":9},"end":{"line":87,"column":10}},"loc":{"start":{"line":87,"column":20},"end":{"line":87,"column":36}},"line":87}},"branchMap":{"0":{"loc":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"type":"if","locations":[{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},{"start":{"line":28,"column":4},"end":{"line":38,"column":5}}],"line":28},"1":{"loc":{"start":{"line":41,"column":16},"end":{"line":41,"column":35}},"type":"binary-expr","locations":[{"start":{"line":41,"column":16},"end":{"line":41,"column":21}},{"start":{"line":41,"column":25},"end":{"line":41,"column":35}}],"line":41},"2":{"loc":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"type":"if","locations":[{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},{"start":{"line":42,"column":4},"end":{"line":42,"column":45}}],"line":42},"3":{"loc":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"type":"if","locations":[{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},{"start":{"line":63,"column":2},"end":{"line":63,"column":39}}],"line":63},"4":{"loc":{"start":{"line":65,"column":14},"end":{"line":65,"column":32}},"type":"binary-expr","locations":[{"start":{"line":65,"column":14},"end":{"line":65,"column":18}},{"start":{"line":65,"column":22},"end":{"line":65,"column":32}}],"line":65},"5":{"loc":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"type":"if","locations":[{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},{"start":{"line":77,"column":2},"end":{"line":80,"column":3}}],"line":77},"6":{"loc":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"type":"if","locations":[{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},{"start":{"line":78,"column":4},"end":{"line":78,"column":33}}],"line":78},"7":{"loc":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"type":"if","locations":[{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},{"start":{"line":84,"column":0},"end":{"line":90,"column":1}}],"line":84},"8":{"loc":{"start":{"line":84,"column":4},"end":{"line":84,"column":28}},"type":"binary-expr","locations":[{"start":{"line":84,"column":4},"end":{"line":84,"column":10}},{"start":{"line":84,"column":14},"end":{"line":84,"column":28}}],"line":84},"9":{"loc":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"type":"if","locations":[{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},{"start":{"line":86,"column":7},"end":{"line":90,"column":1}}],"line":86},"10":{"loc":{"start":{"line":86,"column":11},"end":{"line":86,"column":31}},"type":"binary-expr","locations":[{"start":{"line":86,"column":11},"end":{"line":86,"column":17}},{"start":{"line":86,"column":21},"end":{"line":86,"column":31}}],"line":86},"11":{"loc":{"start":{"line":94,"column":2},"end":{"line":94,"column":39}},"type":"binary-expr","locations":[{"start":{"line":94,"column":2},"end":{"line":94,"column":29}},{"start":{"line":94,"column":33},"end":{"line":94,"column":39}}],"line":94},"12":{"loc":{"start":{"line":95,"column":2},"end":{"line":95,"column":41}},"type":"binary-expr","locations":[{"start":{"line":95,"column":2},"end":{"line":95,"column":31}},{"start":{"line":95,"column":35},"end":{"line":95,"column":41}}],"line":95}},"s":{"0":1,"1":3,"2":3,"3":4105897,"4":4105897,"5":4105897,"6":4105897,"7":4105897,"8":4105897,"9":4105897,"10":4105897,"11":4105897,"12":4105897,"13":4105897,"14":4105897,"15":4105897,"16":4105897,"17":4105897,"18":4105897,"19":4105897,"20":3,"21":3,"22":2,"23":1,"24":1,"25":6,"26":3,"27":16,"28":3,"29":3,"30":2,"31":1,"32":3,"33":3,"34":3,"35":768,"36":3,"37":2,"38":2,"39":2,"40":3,"41":0,"42":3,"43":3,"44":3,"45":4102054,"46":3,"47":1025,"48":1025,"49":1025,"50":1025,"51":1025,"52":3,"53":3,"54":3,"55":2,"56":1,"57":2,"58":1,"59":3,"60":1,"61":1,"62":0,"63":0,"64":0,"65":0},"f":{"0":1,"1":3,"2":4105897,"3":3,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"b":{"0":[2,1],"1":[19,17],"2":[2,1],"3":[0,3],"4":[3,2],"5":[2,1],"6":[1,1],"7":[1,0],"8":[1,1],"9":[0,0],"10":[0,0],"11":[1,1],"12":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"131ac72069e0ca2a2df6aae06f4b2d31b91187b5","contentHash":"4aba94be2ce998b353804abdbf2962ed421abbc77501066348025b6fa45b856d"},"/home/davidbau/git/seedrandom/lib/xor4096.js":{"path":"/home/davidbau/git/seedrandom/lib/xor4096.js","statementMap":{"0":{"start":{"line":26,"column":0},"end":{"line":146,"column":2}},"1":{"start":{"line":29,"column":11},"end":{"line":29,"column":15}},"2":{"start":{"line":32,"column":2},"end":{"line":49,"column":4}},"3":{"start":{"line":33,"column":12},"end":{"line":33,"column":16}},"4":{"start":{"line":34,"column":12},"end":{"line":34,"column":16}},"5":{"start":{"line":34,"column":22},"end":{"line":34,"column":26}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":36}},"7":{"start":{"line":38,"column":4},"end":{"line":38,"column":26}},"8":{"start":{"line":39,"column":4},"end":{"line":39,"column":31}},"9":{"start":{"line":40,"column":4},"end":{"line":40,"column":17}},"10":{"start":{"line":41,"column":4},"end":{"line":41,"column":17}},"11":{"start":{"line":42,"column":4},"end":{"line":42,"column":18}},"12":{"start":{"line":43,"column":4},"end":{"line":43,"column":18}},"13":{"start":{"line":45,"column":4},"end":{"line":45,"column":21}},"14":{"start":{"line":46,"column":4},"end":{"line":46,"column":13}},"15":{"start":{"line":48,"column":4},"end":{"line":48,"column":38}},"16":{"start":{"line":52,"column":27},"end":{"line":52,"column":29}},"17":{"start":{"line":52,"column":39},"end":{"line":52,"column":42}},"18":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"19":{"start":{"line":55,"column":6},"end":{"line":55,"column":15}},"20":{"start":{"line":56,"column":6},"end":{"line":56,"column":18}},"21":{"start":{"line":59,"column":6},"end":{"line":59,"column":25}},"22":{"start":{"line":60,"column":6},"end":{"line":60,"column":12}},"23":{"start":{"line":61,"column":6},"end":{"line":61,"column":43}},"24":{"start":{"line":64,"column":4},"end":{"line":78,"column":5}},"25":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"26":{"start":{"line":66,"column":16},"end":{"line":66,"column":61}},"27":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"28":{"start":{"line":68,"column":19},"end":{"line":68,"column":25}},"29":{"start":{"line":69,"column":6},"end":{"line":69,"column":19}},"30":{"start":{"line":70,"column":6},"end":{"line":70,"column":20}},"31":{"start":{"line":71,"column":6},"end":{"line":71,"column":18}},"32":{"start":{"line":72,"column":6},"end":{"line":72,"column":20}},"33":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"34":{"start":{"line":74,"column":8},"end":{"line":74,"column":33}},"35":{"start":{"line":75,"column":8},"end":{"line":75,"column":36}},"36":{"start":{"line":76,"column":8},"end":{"line":76,"column":33}},"37":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"38":{"start":{"line":81,"column":6},"end":{"line":81,"column":47}},"39":{"start":{"line":86,"column":4},"end":{"line":86,"column":12}},"40":{"start":{"line":87,"column":4},"end":{"line":95,"column":5}},"41":{"start":{"line":88,"column":6},"end":{"line":88,"column":28}},"42":{"start":{"line":89,"column":6},"end":{"line":89,"column":33}},"43":{"start":{"line":90,"column":6},"end":{"line":90,"column":19}},"44":{"start":{"line":91,"column":6},"end":{"line":91,"column":19}},"45":{"start":{"line":92,"column":6},"end":{"line":92,"column":20}},"46":{"start":{"line":93,"column":6},"end":{"line":93,"column":20}},"47":{"start":{"line":94,"column":6},"end":{"line":94,"column":19}},"48":{"start":{"line":97,"column":4},"end":{"line":97,"column":13}},"49":{"start":{"line":98,"column":4},"end":{"line":98,"column":13}},"50":{"start":{"line":99,"column":4},"end":{"line":99,"column":13}},"51":{"start":{"line":102,"column":2},"end":{"line":102,"column":17}},"52":{"start":{"line":106,"column":2},"end":{"line":106,"column":12}},"53":{"start":{"line":107,"column":2},"end":{"line":107,"column":12}},"54":{"start":{"line":108,"column":2},"end":{"line":108,"column":20}},"55":{"start":{"line":109,"column":2},"end":{"line":109,"column":11}},"56":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"57":{"start":{"line":113,"column":20},"end":{"line":113,"column":39}},"58":{"start":{"line":114,"column":11},"end":{"line":114,"column":27}},"59":{"start":{"line":115,"column":14},"end":{"line":115,"column":32}},"60":{"start":{"line":116,"column":13},"end":{"line":116,"column":67}},"61":{"start":{"line":116,"column":26},"end":{"line":116,"column":65}},"62":{"start":{"line":117,"column":2},"end":{"line":124,"column":4}},"63":{"start":{"line":118,"column":4},"end":{"line":122,"column":27}},"64":{"start":{"line":119,"column":16},"end":{"line":119,"column":32}},"65":{"start":{"line":120,"column":16},"end":{"line":120,"column":47}},"66":{"start":{"line":121,"column":19},"end":{"line":121,"column":42}},"67":{"start":{"line":123,"column":4},"end":{"line":123,"column":18}},"68":{"start":{"line":125,"column":2},"end":{"line":125,"column":23}},"69":{"start":{"line":126,"column":2},"end":{"line":126,"column":20}},"70":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"71":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"72":{"start":{"line":128,"column":17},"end":{"line":128,"column":33}},"73":{"start":{"line":129,"column":4},"end":{"line":129,"column":52}},"74":{"start":{"line":129,"column":30},"end":{"line":129,"column":50}},"75":{"start":{"line":131,"column":2},"end":{"line":131,"column":14}},"76":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"77":{"start":{"line":135,"column":2},"end":{"line":135,"column":24}},"78":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"79":{"start":{"line":137,"column":2},"end":{"line":137,"column":38}},"80":{"start":{"line":137,"column":22},"end":{"line":137,"column":34}},"81":{"start":{"line":139,"column":2},"end":{"line":139,"column":22}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":26,"column":1},"end":{"line":26,"column":2}},"loc":{"start":{"line":26,"column":34},"end":{"line":142,"column":1}},"line":26},"1":{"name":"XorGen","decl":{"start":{"line":28,"column":9},"end":{"line":28,"column":15}},"loc":{"start":{"line":28,"column":22},"end":{"line":103,"column":1}},"line":28},"2":{"name":"(anonymous_2)","decl":{"start":{"line":32,"column":12},"end":{"line":32,"column":13}},"loc":{"start":{"line":32,"column":23},"end":{"line":49,"column":3}},"line":32},"3":{"name":"init","decl":{"start":{"line":51,"column":11},"end":{"line":51,"column":15}},"loc":{"start":{"line":51,"column":26},"end":{"line":100,"column":3}},"line":51},"4":{"name":"copy","decl":{"start":{"line":105,"column":9},"end":{"line":105,"column":13}},"loc":{"start":{"line":105,"column":20},"end":{"line":110,"column":1}},"line":105},"5":{"name":"impl","decl":{"start":{"line":112,"column":9},"end":{"line":112,"column":13}},"loc":{"start":{"line":112,"column":26},"end":{"line":132,"column":1}},"line":112},"6":{"name":"(anonymous_6)","decl":{"start":{"line":116,"column":13},"end":{"line":116,"column":14}},"loc":{"start":{"line":116,"column":24},"end":{"line":116,"column":67}},"line":116},"7":{"name":"(anonymous_7)","decl":{"start":{"line":117,"column":16},"end":{"line":117,"column":17}},"loc":{"start":{"line":117,"column":27},"end":{"line":124,"column":3}},"line":117},"8":{"name":"(anonymous_8)","decl":{"start":{"line":129,"column":17},"end":{"line":129,"column":18}},"loc":{"start":{"line":129,"column":28},"end":{"line":129,"column":52}},"line":129},"9":{"name":"(anonymous_9)","decl":{"start":{"line":137,"column":9},"end":{"line":137,"column":10}},"loc":{"start":{"line":137,"column":20},"end":{"line":137,"column":36}},"line":137}},"branchMap":{"0":{"loc":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"type":"if","locations":[{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},{"start":{"line":53,"column":4},"end":{"line":62,"column":5}}],"line":53},"1":{"loc":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"type":"if","locations":[{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},{"start":{"line":66,"column":6},"end":{"line":66,"column":61}}],"line":66},"2":{"loc":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"type":"if","locations":[{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},{"start":{"line":68,"column":6},"end":{"line":68,"column":25}}],"line":68},"3":{"loc":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"type":"if","locations":[{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},{"start":{"line":73,"column":6},"end":{"line":77,"column":7}}],"line":73},"4":{"loc":{"start":{"line":76,"column":12},"end":{"line":76,"column":32}},"type":"cond-expr","locations":[{"start":{"line":76,"column":23},"end":{"line":76,"column":28}},{"start":{"line":76,"column":31},"end":{"line":76,"column":32}}],"line":76},"5":{"loc":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"type":"if","locations":[{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},{"start":{"line":80,"column":4},"end":{"line":82,"column":5}}],"line":80},"6":{"loc":{"start":{"line":81,"column":9},"end":{"line":81,"column":33}},"type":"binary-expr","locations":[{"start":{"line":81,"column":9},"end":{"line":81,"column":13}},{"start":{"line":81,"column":17},"end":{"line":81,"column":28}},{"start":{"line":81,"column":32},"end":{"line":81,"column":33}}],"line":81},"7":{"loc":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"type":"if","locations":[{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},{"start":{"line":113,"column":2},"end":{"line":113,"column":39}}],"line":113},"8":{"loc":{"start":{"line":115,"column":14},"end":{"line":115,"column":32}},"type":"binary-expr","locations":[{"start":{"line":115,"column":14},"end":{"line":115,"column":18}},{"start":{"line":115,"column":22},"end":{"line":115,"column":32}}],"line":115},"9":{"loc":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"type":"if","locations":[{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},{"start":{"line":127,"column":2},"end":{"line":130,"column":3}}],"line":127},"10":{"loc":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"type":"if","locations":[{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},{"start":{"line":128,"column":4},"end":{"line":128,"column":33}}],"line":128},"11":{"loc":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"type":"if","locations":[{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},{"start":{"line":134,"column":0},"end":{"line":140,"column":1}}],"line":134},"12":{"loc":{"start":{"line":134,"column":4},"end":{"line":134,"column":28}},"type":"binary-expr","locations":[{"start":{"line":134,"column":4},"end":{"line":134,"column":10}},{"start":{"line":134,"column":14},"end":{"line":134,"column":28}}],"line":134},"13":{"loc":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"type":"if","locations":[{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},{"start":{"line":136,"column":7},"end":{"line":140,"column":1}}],"line":136},"14":{"loc":{"start":{"line":136,"column":11},"end":{"line":136,"column":31}},"type":"binary-expr","locations":[{"start":{"line":136,"column":11},"end":{"line":136,"column":17}},{"start":{"line":136,"column":21},"end":{"line":136,"column":31}}],"line":136},"15":{"loc":{"start":{"line":144,"column":2},"end":{"line":144,"column":39}},"type":"binary-expr","locations":[{"start":{"line":144,"column":2},"end":{"line":144,"column":29}},{"start":{"line":144,"column":33},"end":{"line":144,"column":39}}],"line":144},"16":{"loc":{"start":{"line":145,"column":2},"end":{"line":145,"column":41}},"type":"binary-expr","locations":[{"start":{"line":145,"column":2},"end":{"line":145,"column":31}},{"start":{"line":145,"column":35},"end":{"line":145,"column":41}}],"line":145}},"s":{"0":1,"1":3,"2":3,"3":4105129,"4":4105129,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":4105129,"10":4105129,"11":4105129,"12":4105129,"13":4105129,"14":4105129,"15":4105129,"16":3,"17":3,"18":3,"19":2,"20":2,"21":1,"22":1,"23":1,"24":3,"25":480,"26":160,"27":480,"28":3,"29":480,"30":480,"31":480,"32":480,"33":480,"34":384,"35":384,"36":384,"37":3,"38":0,"39":3,"40":3,"41":1536,"42":1536,"43":1536,"44":1536,"45":1536,"46":1536,"47":1536,"48":3,"49":3,"50":3,"51":3,"52":2,"53":2,"54":2,"55":2,"56":3,"57":0,"58":3,"59":3,"60":3,"61":4102054,"62":3,"63":1025,"64":1025,"65":1025,"66":1025,"67":1025,"68":3,"69":3,"70":3,"71":2,"72":1,"73":2,"74":1,"75":3,"76":1,"77":1,"78":0,"79":0,"80":0,"81":0},"f":{"0":1,"1":3,"2":4105129,"3":3,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"b":{"0":[2,1],"1":[160,320],"2":[3,477],"3":[384,96],"4":[0,384],"5":[0,3],"6":[0,0,0],"7":[0,3],"8":[3,2],"9":[2,1],"10":[1,1],"11":[1,0],"12":[1,1],"13":[0,0],"14":[0,0],"15":[1,1],"16":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"5de096409f62b3565b1ce6d3136eb46f59ce3abe","contentHash":"2e41775c8739abfedd52237d6d32ba6c6ccbf9e10e6721c3a313ec1d67788df4"},"/home/davidbau/git/seedrandom/lib/tychei.js":{"path":"/home/davidbau/git/seedrandom/lib/tychei.js","statementMap":{"0":{"start":{"line":5,"column":0},"end":{"line":101,"column":2}},"1":{"start":{"line":8,"column":11},"end":{"line":8,"column":15}},"2":{"start":{"line":8,"column":27},"end":{"line":8,"column":29}},"3":{"start":{"line":11,"column":2},"end":{"line":21,"column":4}},"4":{"start":{"line":12,"column":12},"end":{"line":12,"column":16}},"5":{"start":{"line":12,"column":22},"end":{"line":12,"column":26}},"6":{"start":{"line":12,"column":32},"end":{"line":12,"column":36}},"7":{"start":{"line":12,"column":42},"end":{"line":12,"column":46}},"8":{"start":{"line":13,"column":4},"end":{"line":13,"column":34}},"9":{"start":{"line":14,"column":4},"end":{"line":14,"column":20}},"10":{"start":{"line":15,"column":4},"end":{"line":15,"column":34}},"11":{"start":{"line":16,"column":4},"end":{"line":16,"column":20}},"12":{"start":{"line":17,"column":4},"end":{"line":17,"column":42}},"13":{"start":{"line":18,"column":4},"end":{"line":18,"column":27}},"14":{"start":{"line":19,"column":4},"end":{"line":19,"column":38}},"15":{"start":{"line":20,"column":4},"end":{"line":20,"column":30}},"16":{"start":{"line":39,"column":2},"end":{"line":39,"column":11}},"17":{"start":{"line":40,"column":2},"end":{"line":40,"column":11}},"18":{"start":{"line":41,"column":2},"end":{"line":41,"column":24}},"19":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"20":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"21":{"start":{"line":46,"column":4},"end":{"line":46,"column":36}},"22":{"start":{"line":47,"column":4},"end":{"line":47,"column":20}},"23":{"start":{"line":50,"column":4},"end":{"line":50,"column":20}},"24":{"start":{"line":54,"column":2},"end":{"line":57,"column":3}},"25":{"start":{"line":54,"column":15},"end":{"line":54,"column":16}},"26":{"start":{"line":55,"column":4},"end":{"line":55,"column":38}},"27":{"start":{"line":56,"column":4},"end":{"line":56,"column":14}},"28":{"start":{"line":61,"column":2},"end":{"line":61,"column":12}},"29":{"start":{"line":62,"column":2},"end":{"line":62,"column":12}},"30":{"start":{"line":63,"column":2},"end":{"line":63,"column":12}},"31":{"start":{"line":64,"column":2},"end":{"line":64,"column":12}},"32":{"start":{"line":65,"column":2},"end":{"line":65,"column":11}},"33":{"start":{"line":69,"column":11},"end":{"line":69,"column":27}},"34":{"start":{"line":70,"column":14},"end":{"line":70,"column":32}},"35":{"start":{"line":71,"column":13},"end":{"line":71,"column":67}},"36":{"start":{"line":71,"column":26},"end":{"line":71,"column":65}},"37":{"start":{"line":72,"column":2},"end":{"line":79,"column":4}},"38":{"start":{"line":73,"column":4},"end":{"line":77,"column":27}},"39":{"start":{"line":74,"column":16},"end":{"line":74,"column":32}},"40":{"start":{"line":75,"column":16},"end":{"line":75,"column":47}},"41":{"start":{"line":76,"column":19},"end":{"line":76,"column":42}},"42":{"start":{"line":78,"column":4},"end":{"line":78,"column":18}},"43":{"start":{"line":80,"column":2},"end":{"line":80,"column":23}},"44":{"start":{"line":81,"column":2},"end":{"line":81,"column":20}},"45":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"46":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"47":{"start":{"line":83,"column":35},"end":{"line":83,"column":51}},"48":{"start":{"line":84,"column":4},"end":{"line":84,"column":52}},"49":{"start":{"line":84,"column":30},"end":{"line":84,"column":50}},"50":{"start":{"line":86,"column":2},"end":{"line":86,"column":14}},"51":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"52":{"start":{"line":90,"column":2},"end":{"line":90,"column":24}},"53":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"54":{"start":{"line":92,"column":2},"end":{"line":92,"column":38}},"55":{"start":{"line":92,"column":22},"end":{"line":92,"column":34}},"56":{"start":{"line":94,"column":2},"end":{"line":94,"column":21}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":5,"column":1},"end":{"line":5,"column":2}},"loc":{"start":{"line":5,"column":34},"end":{"line":97,"column":1}},"line":5},"1":{"name":"XorGen","decl":{"start":{"line":7,"column":9},"end":{"line":7,"column":15}},"loc":{"start":{"line":7,"column":22},"end":{"line":58,"column":1}},"line":7},"2":{"name":"(anonymous_2)","decl":{"start":{"line":11,"column":12},"end":{"line":11,"column":13}},"loc":{"start":{"line":11,"column":23},"end":{"line":21,"column":3}},"line":11},"3":{"name":"copy","decl":{"start":{"line":60,"column":9},"end":{"line":60,"column":13}},"loc":{"start":{"line":60,"column":20},"end":{"line":66,"column":1}},"line":60},"4":{"name":"impl","decl":{"start":{"line":68,"column":9},"end":{"line":68,"column":13}},"loc":{"start":{"line":68,"column":26},"end":{"line":87,"column":1}},"line":68},"5":{"name":"(anonymous_5)","decl":{"start":{"line":71,"column":13},"end":{"line":71,"column":14}},"loc":{"start":{"line":71,"column":24},"end":{"line":71,"column":67}},"line":71},"6":{"name":"(anonymous_6)","decl":{"start":{"line":72,"column":16},"end":{"line":72,"column":17}},"loc":{"start":{"line":72,"column":27},"end":{"line":79,"column":3}},"line":72},"7":{"name":"(anonymous_7)","decl":{"start":{"line":84,"column":17},"end":{"line":84,"column":18}},"loc":{"start":{"line":84,"column":28},"end":{"line":84,"column":52}},"line":84},"8":{"name":"(anonymous_8)","decl":{"start":{"line":92,"column":9},"end":{"line":92,"column":10}},"loc":{"start":{"line":92,"column":20},"end":{"line":92,"column":36}},"line":92}},"branchMap":{"0":{"loc":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"type":"if","locations":[{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},{"start":{"line":44,"column":2},"end":{"line":51,"column":3}}],"line":44},"1":{"loc":{"start":{"line":70,"column":14},"end":{"line":70,"column":32}},"type":"binary-expr","locations":[{"start":{"line":70,"column":14},"end":{"line":70,"column":18}},{"start":{"line":70,"column":22},"end":{"line":70,"column":32}}],"line":70},"2":{"loc":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"type":"if","locations":[{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},{"start":{"line":82,"column":2},"end":{"line":85,"column":3}}],"line":82},"3":{"loc":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"type":"if","locations":[{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},{"start":{"line":83,"column":4},"end":{"line":83,"column":51}}],"line":83},"4":{"loc":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"type":"if","locations":[{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},{"start":{"line":89,"column":0},"end":{"line":95,"column":1}}],"line":89},"5":{"loc":{"start":{"line":89,"column":4},"end":{"line":89,"column":28}},"type":"binary-expr","locations":[{"start":{"line":89,"column":4},"end":{"line":89,"column":10}},{"start":{"line":89,"column":14},"end":{"line":89,"column":28}}],"line":89},"6":{"loc":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"type":"if","locations":[{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},{"start":{"line":91,"column":7},"end":{"line":95,"column":1}}],"line":91},"7":{"loc":{"start":{"line":91,"column":11},"end":{"line":91,"column":31}},"type":"binary-expr","locations":[{"start":{"line":91,"column":11},"end":{"line":91,"column":17}},{"start":{"line":91,"column":21},"end":{"line":91,"column":31}}],"line":91},"8":{"loc":{"start":{"line":99,"column":2},"end":{"line":99,"column":39}},"type":"binary-expr","locations":[{"start":{"line":99,"column":2},"end":{"line":99,"column":29}},{"start":{"line":99,"column":33},"end":{"line":99,"column":39}}],"line":99},"9":{"loc":{"start":{"line":100,"column":2},"end":{"line":100,"column":41}},"type":"binary-expr","locations":[{"start":{"line":100,"column":2},"end":{"line":100,"column":31}},{"start":{"line":100,"column":35},"end":{"line":100,"column":41}}],"line":100}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105195,"5":4105195,"6":4105195,"7":4105195,"8":4105195,"9":4105195,"10":4105195,"11":4105195,"12":4105195,"13":4105195,"14":4105195,"15":4105195,"16":3,"17":3,"18":3,"19":3,"20":3,"21":2,"22":2,"23":1,"24":3,"25":3,"26":66,"27":66,"28":2,"29":2,"30":2,"31":2,"32":2,"33":3,"34":3,"35":3,"36":4102054,"37":3,"38":1025,"39":1025,"40":1025,"41":1025,"42":1025,"43":3,"44":3,"45":3,"46":2,"47":1,"48":2,"49":1,"50":3,"51":1,"52":1,"53":0,"54":0,"55":0,"56":0},"f":{"0":1,"1":3,"2":4105195,"3":2,"4":3,"5":4102054,"6":1025,"7":1,"8":0},"b":{"0":[2,1],"1":[3,2],"2":[2,1],"3":[1,1],"4":[1,0],"5":[1,1],"6":[0,0],"7":[0,0],"8":[1,1],"9":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"3875c0e0fa564e9ae68114bde64afc883b7c9ca0","contentHash":"00c6380ad151ad19433a64fdc0b4051c1a7ee0af16dc43e971860cc64ce62b05"},"/home/davidbau/git/seedrandom/lib/alea.js":{"path":"/home/davidbau/git/seedrandom/lib/alea.js","statementMap":{"0":{"start":{"line":28,"column":0},"end":{"line":112,"column":2}},"1":{"start":{"line":31,"column":11},"end":{"line":31,"column":15}},"2":{"start":{"line":31,"column":24},"end":{"line":31,"column":30}},"3":{"start":{"line":33,"column":2},"end":{"line":38,"column":4}},"4":{"start":{"line":34,"column":12},"end":{"line":34,"column":59}},"5":{"start":{"line":35,"column":4},"end":{"line":35,"column":18}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":18}},"7":{"start":{"line":37,"column":4},"end":{"line":37,"column":38}},"8":{"start":{"line":41,"column":2},"end":{"line":41,"column":11}},"9":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"10":{"start":{"line":43,"column":2},"end":{"line":43,"column":20}},"11":{"start":{"line":44,"column":2},"end":{"line":44,"column":20}},"12":{"start":{"line":45,"column":2},"end":{"line":45,"column":22}},"13":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"14":{"start":{"line":46,"column":19},"end":{"line":46,"column":30}},"15":{"start":{"line":47,"column":2},"end":{"line":47,"column":22}},"16":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"17":{"start":{"line":48,"column":19},"end":{"line":48,"column":30}},"18":{"start":{"line":49,"column":2},"end":{"line":49,"column":22}},"19":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"20":{"start":{"line":50,"column":19},"end":{"line":50,"column":30}},"21":{"start":{"line":51,"column":2},"end":{"line":51,"column":14}},"22":{"start":{"line":55,"column":2},"end":{"line":55,"column":12}},"23":{"start":{"line":56,"column":2},"end":{"line":56,"column":14}},"24":{"start":{"line":57,"column":2},"end":{"line":57,"column":14}},"25":{"start":{"line":58,"column":2},"end":{"line":58,"column":14}},"26":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"27":{"start":{"line":63,"column":11},"end":{"line":63,"column":25}},"28":{"start":{"line":64,"column":14},"end":{"line":64,"column":32}},"29":{"start":{"line":65,"column":13},"end":{"line":65,"column":20}},"30":{"start":{"line":66,"column":2},"end":{"line":66,"column":67}},"31":{"start":{"line":66,"column":28},"end":{"line":66,"column":65}},"32":{"start":{"line":67,"column":2},"end":{"line":69,"column":4}},"33":{"start":{"line":68,"column":4},"end":{"line":68,"column":69}},"34":{"start":{"line":70,"column":2},"end":{"line":70,"column":20}},"35":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"36":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"37":{"start":{"line":72,"column":35},"end":{"line":72,"column":51}},"38":{"start":{"line":73,"column":4},"end":{"line":73,"column":52}},"39":{"start":{"line":73,"column":30},"end":{"line":73,"column":50}},"40":{"start":{"line":75,"column":2},"end":{"line":75,"column":14}},"41":{"start":{"line":79,"column":10},"end":{"line":79,"column":20}},"42":{"start":{"line":81,"column":13},"end":{"line":94,"column":3}},"43":{"start":{"line":82,"column":4},"end":{"line":82,"column":24}},"44":{"start":{"line":83,"column":4},"end":{"line":92,"column":5}},"45":{"start":{"line":83,"column":17},"end":{"line":83,"column":18}},"46":{"start":{"line":84,"column":6},"end":{"line":84,"column":30}},"47":{"start":{"line":85,"column":14},"end":{"line":85,"column":37}},"48":{"start":{"line":86,"column":6},"end":{"line":86,"column":18}},"49":{"start":{"line":87,"column":6},"end":{"line":87,"column":13}},"50":{"start":{"line":88,"column":6},"end":{"line":88,"column":13}},"51":{"start":{"line":89,"column":6},"end":{"line":89,"column":18}},"52":{"start":{"line":90,"column":6},"end":{"line":90,"column":13}},"53":{"start":{"line":91,"column":6},"end":{"line":91,"column":27}},"54":{"start":{"line":93,"column":4},"end":{"line":93,"column":46}},"55":{"start":{"line":96,"column":2},"end":{"line":96,"column":14}},"56":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"57":{"start":{"line":101,"column":2},"end":{"line":101,"column":24}},"58":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"59":{"start":{"line":103,"column":2},"end":{"line":103,"column":38}},"60":{"start":{"line":103,"column":22},"end":{"line":103,"column":34}},"61":{"start":{"line":105,"column":2},"end":{"line":105,"column":19}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":28,"column":1},"end":{"line":28,"column":2}},"loc":{"start":{"line":28,"column":34},"end":{"line":108,"column":1}},"line":28},"1":{"name":"Alea","decl":{"start":{"line":30,"column":9},"end":{"line":30,"column":13}},"loc":{"start":{"line":30,"column":20},"end":{"line":52,"column":1}},"line":30},"2":{"name":"(anonymous_2)","decl":{"start":{"line":33,"column":12},"end":{"line":33,"column":13}},"loc":{"start":{"line":33,"column":23},"end":{"line":38,"column":3}},"line":33},"3":{"name":"copy","decl":{"start":{"line":54,"column":9},"end":{"line":54,"column":13}},"loc":{"start":{"line":54,"column":20},"end":{"line":60,"column":1}},"line":54},"4":{"name":"impl","decl":{"start":{"line":62,"column":9},"end":{"line":62,"column":13}},"loc":{"start":{"line":62,"column":26},"end":{"line":76,"column":1}},"line":62},"5":{"name":"(anonymous_5)","decl":{"start":{"line":66,"column":15},"end":{"line":66,"column":16}},"loc":{"start":{"line":66,"column":26},"end":{"line":66,"column":67}},"line":66},"6":{"name":"(anonymous_6)","decl":{"start":{"line":67,"column":16},"end":{"line":67,"column":17}},"loc":{"start":{"line":67,"column":27},"end":{"line":69,"column":3}},"line":67},"7":{"name":"(anonymous_7)","decl":{"start":{"line":73,"column":17},"end":{"line":73,"column":18}},"loc":{"start":{"line":73,"column":28},"end":{"line":73,"column":52}},"line":73},"8":{"name":"Mash","decl":{"start":{"line":78,"column":9},"end":{"line":78,"column":13}},"loc":{"start":{"line":78,"column":16},"end":{"line":97,"column":1}},"line":78},"9":{"name":"(anonymous_9)","decl":{"start":{"line":81,"column":13},"end":{"line":81,"column":14}},"loc":{"start":{"line":81,"column":28},"end":{"line":94,"column":3}},"line":81},"10":{"name":"(anonymous_10)","decl":{"start":{"line":103,"column":9},"end":{"line":103,"column":10}},"loc":{"start":{"line":103,"column":20},"end":{"line":103,"column":36}},"line":103}},"branchMap":{"0":{"loc":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"type":"if","locations":[{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},{"start":{"line":46,"column":2},"end":{"line":46,"column":32}}],"line":46},"1":{"loc":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"type":"if","locations":[{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},{"start":{"line":48,"column":2},"end":{"line":48,"column":32}}],"line":48},"2":{"loc":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"type":"if","locations":[{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},{"start":{"line":50,"column":2},"end":{"line":50,"column":32}}],"line":50},"3":{"loc":{"start":{"line":64,"column":14},"end":{"line":64,"column":32}},"type":"binary-expr","locations":[{"start":{"line":64,"column":14},"end":{"line":64,"column":18}},{"start":{"line":64,"column":22},"end":{"line":64,"column":32}}],"line":64},"4":{"loc":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"type":"if","locations":[{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},{"start":{"line":71,"column":2},"end":{"line":74,"column":3}}],"line":71},"5":{"loc":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"type":"if","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},{"start":{"line":72,"column":4},"end":{"line":72,"column":51}}],"line":72},"6":{"loc":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"type":"if","locations":[{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},{"start":{"line":100,"column":0},"end":{"line":106,"column":1}}],"line":100},"7":{"loc":{"start":{"line":100,"column":4},"end":{"line":100,"column":28}},"type":"binary-expr","locations":[{"start":{"line":100,"column":4},"end":{"line":100,"column":10}},{"start":{"line":100,"column":14},"end":{"line":100,"column":28}}],"line":100},"8":{"loc":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"type":"if","locations":[{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},{"start":{"line":102,"column":7},"end":{"line":106,"column":1}}],"line":102},"9":{"loc":{"start":{"line":102,"column":11},"end":{"line":102,"column":31}},"type":"binary-expr","locations":[{"start":{"line":102,"column":11},"end":{"line":102,"column":17}},{"start":{"line":102,"column":21},"end":{"line":102,"column":31}}],"line":102},"10":{"loc":{"start":{"line":110,"column":2},"end":{"line":110,"column":39}},"type":"binary-expr","locations":[{"start":{"line":110,"column":2},"end":{"line":110,"column":29}},{"start":{"line":110,"column":33},"end":{"line":110,"column":39}}],"line":110},"11":{"loc":{"start":{"line":111,"column":2},"end":{"line":111,"column":41}},"type":"binary-expr","locations":[{"start":{"line":111,"column":2},"end":{"line":111,"column":31}},{"start":{"line":111,"column":35},"end":{"line":111,"column":41}}],"line":111}},"s":{"0":1,"1":3,"2":3,"3":3,"4":4105129,"5":4105129,"6":4105129,"7":4105129,"8":3,"9":3,"10":3,"11":3,"12":3,"13":3,"14":1,"15":3,"16":3,"17":3,"18":3,"19":3,"20":0,"21":3,"22":2,"23":2,"24":2,"25":2,"26":2,"27":3,"28":3,"29":3,"30":3,"31":1025,"32":3,"33":1025,"34":3,"35":3,"36":2,"37":1,"38":2,"39":1,"40":3,"41":3,"42":3,"43":18,"44":18,"45":18,"46":33,"47":33,"48":33,"49":33,"50":33,"51":33,"52":33,"53":33,"54":18,"55":3,"56":1,"57":1,"58":0,"59":0,"60":0,"61":0},"f":{"0":1,"1":3,"2":4105129,"3":2,"4":3,"5":1025,"6":1025,"7":1,"8":3,"9":18,"10":0},"b":{"0":[1,2],"1":[3,0],"2":[0,3],"3":[3,2],"4":[2,1],"5":[1,1],"6":[1,0],"7":[1,1],"8":[0,0],"9":[0,0],"10":[1,1],"11":[1,0]},"_coverageSchema":"43e27e138ebf9cfc5966b082cf9a028302ed4184","hash":"b70bcb8438fd8d93267e4355bb97ec0e15c51502","contentHash":"026d994d4bc0afeb3f977bb09d4e6284476ab12f7a5be78bdde751602626af54"}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json b/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
new file mode 100644
index 0000000..d596d96
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/processinfo/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json
@@ -0,0 +1 @@
+{"uuid":"f02e18a9-b1c7-4946-836e-c3dbfb9635a3","parent":null,"pid":8128,"argv":["/home/davidbau/.nvm/versions/node/v11.9.0/bin/node","/home/davidbau/git/seedrandom/node_modules/mocha/bin/_mocha","test/cryptotest.js","test/nodetest.js","test/prngtest.js"],"execArgv":[],"cwd":"/home/davidbau/git/seedrandom","time":1568716532937,"ppid":8121,"root":"23c2e786-6463-4b5a-9042-75ea3257640f","coverageFilename":"/home/davidbau/git/seedrandom/.nyc_output/f02e18a9-b1c7-4946-836e-c3dbfb9635a3.json","files":["/home/davidbau/git/seedrandom/seedrandom.js","/home/davidbau/git/seedrandom/lib/xor128.js","/home/davidbau/git/seedrandom/lib/xorwow.js","/home/davidbau/git/seedrandom/lib/xorshift7.js","/home/davidbau/git/seedrandom/lib/xor4096.js","/home/davidbau/git/seedrandom/lib/tychei.js","/home/davidbau/git/seedrandom/lib/alea.js"]}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.nyc_output/processinfo/index.json b/node_modules/seedrandom/.nyc_output/processinfo/index.json
new file mode 100644
index 0000000..f67865c
--- /dev/null
+++ b/node_modules/seedrandom/.nyc_output/processinfo/index.json
@@ -0,0 +1 @@
+{"processes":{"f02e18a9-b1c7-4946-836e-c3dbfb9635a3":{"parent":null,"children":[]}},"files":{"/home/davidbau/git/seedrandom/seedrandom.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xor128.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xorwow.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xorshift7.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/xor4096.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/tychei.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"],"/home/davidbau/git/seedrandom/lib/alea.js":["f02e18a9-b1c7-4946-836e-c3dbfb9635a3"]},"externalIds":{}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/.travis.yml b/node_modules/seedrandom/.travis.yml
new file mode 100644
index 0000000..6852ab1
--- /dev/null
+++ b/node_modules/seedrandom/.travis.yml
@@ -0,0 +1,8 @@
+language: node_js
+sudo: false
+node_js:
+- '7'
+- '8'
+- '9'
+- '10'
+- '11'
diff --git a/node_modules/seedrandom/Gruntfile.js b/node_modules/seedrandom/Gruntfile.js
new file mode 100644
index 0000000..41585ec
--- /dev/null
+++ b/node_modules/seedrandom/Gruntfile.js
@@ -0,0 +1,97 @@
+module.exports = function(grunt) {
+  "use strict";
+
+  grunt.initConfig({
+    pkg: grunt.file.readJSON("package.json"),
+    copy: {
+      browsertest: {
+        files: [
+          { expand: true, cwd: 'node_modules/qunit/qunit', src: 'qunit.*' ,
+            dest: 'test/lib'},
+          { expand: true, cwd: 'node_modules/requirejs', src: 'require.js',
+            dest: 'test/lib'}
+        ],
+      }
+    },
+    uglify: {
+      all: {
+        files: {
+          "<%= pkg.name %>.min.js": [ "<%= pkg.name %>.js" ],
+          "lib/alea.min.js": [ "lib/alea.js" ],
+          "lib/tychei.min.js": [ "lib/tychei.js" ],
+          "lib/xor4096.min.js": [ "lib/xor4096.js" ],
+          "lib/xorshift7.min.js": [ "lib/xorshift7.js" ],
+          "lib/xorwow.min.js": [ "lib/xorwow.js" ],
+          "lib/xor128.min.js": [ "lib/xor128.js" ]
+        },
+        options: {
+          preserveComments: false,
+          report: "min",
+          output: {
+            ascii_only: true
+          }
+        }
+      }
+    },
+    qunit: {
+      options: {
+        noGlobals: true,
+        httpBase: 'http://localhost:8192'
+      },
+      all: ["test/*.html"]
+    },
+    connect: {
+      server: {
+        options: {
+          port: 8192,
+          base: '.'
+        }
+      }
+    },
+    browserify: {
+      test: {
+        files: {
+          'test/browserified.js': ['test/nodetest.js'],
+        },
+        options: {
+          ignore: ['requirejs', 'process'],
+          alias: {
+            'assert': './test/qunitassert.js'
+          }
+        }
+      }
+    },
+    mocha_nyc: {
+      coverage: {
+        src: 'test/*test.js'
+      },
+      coveralls: {
+        src: 'test/*test.js',
+        options: {
+          coverage: true
+        }
+      }
+    },
+    release: {
+      options: {
+        bump: false
+      }
+    }
+  });
+
+  grunt.event.on('coverage', require('coveralls').handleInput);
+
+  grunt.loadNpmTasks('grunt-contrib-copy');
+  grunt.loadNpmTasks('grunt-contrib-connect');
+  grunt.loadNpmTasks('grunt-contrib-qunit');
+  grunt.loadNpmTasks('grunt-contrib-uglify');
+  grunt.loadNpmTasks('grunt-mocha-nyc');
+  grunt.loadNpmTasks('grunt-release');
+  grunt.loadNpmTasks('grunt-browserify');
+
+  grunt.registerTask("test", ["copy:browsertest", "browserify",
+                     "connect", "qunit", "mocha_nyc:coverage"]);
+  grunt.registerTask("default", ["uglify", "test"]);
+  grunt.registerTask("travis", ["default", "mocha_nyc:coveralls"]);
+};
+
diff --git a/node_modules/seedrandom/README.md b/node_modules/seedrandom/README.md
new file mode 100644
index 0000000..9518915
--- /dev/null
+++ b/node_modules/seedrandom/README.md
@@ -0,0 +1,322 @@
+seedrandom.js
+=============
+[![Build Status](https://travis-ci.org/davidbau/seedrandom.svg?branch=master)](https://travis-ci.org/davidbau/seedrandom)
+[![NPM version](https://badge.fury.io/js/seedrandom.svg)](http://badge.fury.io/js/seedrandom)
+[![Bower version](https://badge.fury.io/bo/seedrandom.svg)](http://badge.fury.io/bo/seedrandom)
+
+Seeded random number generator for JavaScript.
+
+Version 3.0.5
+
+Author: David Bau
+
+Date: 2019-09-14
+
+Can be used as a plain script, a Node.js module or an AMD module.
+
+
+Script tag usage
+----------------
+
+```html
+<script src="//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/seedrandom.min.js">
+</script>
+```
+
+```js
+// Make a predictable pseudorandom number generator.
+var myrng = new Math.seedrandom('hello.');
+console.log(myrng());                // Always 0.9282578795792454
+console.log(myrng());                // Always 0.3752569768646784
+
+// Use "quick" to get only 32 bits of randomness in a float.
+console.log(myrng.quick());          // Always 0.7316977467853576
+
+// Use "int32" to get a 32 bit (signed) integer
+console.log(myrng.int32());          // Always 1966374204
+
+// Calling seedrandom with no arguments creates an ARC4-based PRNG
+// that is autoseeded using the current time, dom state, and other
+// accumulated local entropy.
+var prng = new Math.seedrandom();
+console.log(prng());                // Reasonably unpredictable.
+
+// Seeds using the given explicit seed mixed with accumulated entropy.
+prng = new Math.seedrandom('added entropy.', { entropy: true });
+console.log(prng());                // As unpredictable as added entropy.
+
+// Warning: if you call Math.seedrandom without `new`, it replaces
+// Math.random with the predictable new Math.seedrandom(...), as follows:
+Math.seedrandom('hello.');
+console.log(Math.random());          // Always 0.9282578795792454
+console.log(Math.random());          // Always 0.3752569768646784
+
+```
+
+**Note**: calling `Math.seedrandom('constant')` without `new` will make
+`Math.random()` predictable globally, which is intended to be useful for
+derandomizing code for testing, but should not be done in a production library.
+If you need a local seeded PRNG, use `myrng = new Math.seedrandom('seed')`
+instead.  For example, [cryptico](https://www.npmjs.com/package/cryptico),
+an RSA encryption package, [uses the wrong form](
+https://github.com/wwwtyro/cryptico/blob/9291ece6/api.js#L264),
+and thus secretly makes `Math.random()` perfectly predictable.
+The cryptico library (and any other library that does this)
+should not be trusted in a security-sensitive application.
+
+
+Other Fast PRNG Algorithms
+--------------------------
+
+The package includes some other fast PRNGs.  To use Johannes Baagøe's
+extremely fast Alea PRNG:
+
+
+```html
+<script src="//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/lib/alea.min.js">
+</script>
+```
+
+```js
+// Use alea for Johannes Baagøe's clever and fast floating-point RNG.
+var arng = new alea('hello.');
+
+// By default provides 32 bits of randomness in a float.
+console.log(arng());               // Always 0.4783254903741181
+
+// Use "double" to get 56 bits of randomness.
+console.log(arng.double());        // Always 0.8297006866124559
+
+// Use "int32" to get a 32 bit (signed) integer.
+console.log(arng.int32());         // Always 1076136327
+```
+
+Besides alea, there are several other faster PRNGs available.
+Note that none of these fast PRNGs provide autoseeding: you
+need to provide your own seed (or use the default autoseeded
+seedrandom to make a seed).
+
+|PRNG name  | Time vs native | Period      | Author               |
+|-----------|----------------|-------------|----------------------|
+|`alea`     |  1.95 ns, 0.9x | ~2^116      | Baagøe               |
+|`xor128`   |  2.04 ns, 0.9x | 2^128-1     | Marsaglia            |
+|`tychei`   |  2.32 ns, 1.1x | ~2^127      | Neves/Araujo (ChaCha)|
+|`xorwow`   |  2.40 ns, 1.1x | 2^192-2^32  | Marsaglia            |
+|`xor4096`  |  2.40 ns, 1.1x | 2^4096-2^32 | Brent (xorgens)      |
+|`xorshift7`|  2.64 ns, 1.3x | 2^256-1     | Panneton/L'ecuyer    |
+|`quick`    |  3.80 ns, 1.8x | ~2^1600     | Bau (ARC4)           |
+
+(Timings were done on node v0.12.2 on a single-core Google Compute Engine
+instance.  `quick` is just the 32-bit version of the RC4-based PRNG
+originally packaged with seedrandom.)
+
+
+CJS / Node.js usage
+-------------------
+
+```
+npm install seedrandom
+```
+
+```js
+// Local PRNG: does not affect Math.random.
+var seedrandom = require('seedrandom');
+var rng = seedrandom('hello.');
+console.log(rng());                  // Always 0.9282578795792454
+
+// Global PRNG: set Math.random.
+seedrandom('hello.', { global: true });
+console.log(Math.random());          // Always 0.9282578795792454
+
+// Autoseeded ARC4-based PRNG.
+rng = seedrandom();
+console.log(rng());                  // Reasonably unpredictable.
+
+// Mixing accumulated entropy.
+rng = seedrandom('added entropy.', { entropy: true });
+console.log(rng());                  // As unpredictable as added entropy.
+
+// Using alternate algorithms, as listed above.
+var rng2 = seedrandom.xor4096('hello.')
+console.log(rng2());
+```
+
+Starting in version 3, when using via require('seedrandom'), the global
+`Math.seedrandom` is no longer available.
+
+
+Require.js usage
+----------------
+
+Similar to Node.js usage:
+
+```
+bower install seedrandom
+```
+
+```
+require(['seedrandom'], function(seedrandom) {
+  var rng = seedrandom('hello.');
+  console.log(rng());                  // Always 0.9282578795792454
+});
+```
+
+
+Network seeding
+---------------
+
+```html
+<script src=//cdnjs.cloudflare.com/ajax/libs/seedrandom/3.0.5/seedrandom.min.js>
+</script>
+<!-- Seeds using urandom bits from a server. -->
+<script src=//jsonlib.appspot.com/urandom?callback=Math.seedrandom>
+</script>
+
+<!-- Seeds mixing in random.org bits -->
+<script>
+(function(x, u, s){
+  try {
+    // Make a synchronous request to random.org.
+    x.open('GET', u, false);
+    x.send();
+    s = unescape(x.response.trim().replace(/^|\s/g, '%'));
+  } finally {
+    // Seed with the response, or autoseed on failure.
+    Math.seedrandom(s, !!s);
+  }
+})(new XMLHttpRequest, 'https://www.random.org/integers/' +
+  '?num=256&min=0&max=255&col=1&base=16&format=plain&rnd=new');
+</script>
+```
+
+Reseeding using user input
+--------------------------
+
+```js
+var seed = Math.seedrandom();        // Use prng with an automatic seed.
+document.write(Math.random());       // Pretty much unpredictable x.
+
+var rng = new Math.seedrandom(seed); // A new prng with the same seed.
+document.write(rng());               // Repeat the 'unpredictable' x.
+
+function reseed(event, count) {      // Define a custom entropy collector.
+  var t = [];
+  function w(e) {
+    t.push([e.pageX, e.pageY, +new Date]);
+    if (t.length < count) { return; }
+    document.removeEventListener(event, w);
+    Math.seedrandom(t, { entropy: true });
+  }
+  document.addEventListener(event, w);
+}
+reseed('mousemove', 100);            // Reseed after 100 mouse moves.
+```
+
+The "pass" option can be used to get both the prng and the seed.
+The following returns both an autoseeded prng and the seed as an object,
+without mutating Math.random:
+
+```js
+var obj = Math.seedrandom(null, { pass: function(prng, seed) {
+  return { random: prng, seed: seed };
+}});
+```
+
+
+Saving and Restoring PRNG state
+-------------------------------
+
+```js
+var seedrandom = Math.seedrandom;
+var saveable = seedrandom("secret-seed", {state: true});
+for (var j = 0; j < 1e5; ++j) saveable();
+var saved = saveable.state();
+var replica = seedrandom("", {state: saved});
+assert(replica() == saveable());
+```
+
+In normal use the prng is opaque and its internal state cannot be accessed.
+However, if the "state" option is specified, the prng gets a state() method
+that returns a plain object the can be used to reconstruct a prng later in
+the same state (by passing that saved object back as the state option).
+
+
+Version notes
+-------------
+
+The random number sequence is the same as version 1.0 for string seeds.
+
+* Version 2.0 changed the sequence for non-string seeds.
+* Version 2.1 speeds seeding and uses window.crypto to autoseed if present.
+* Version 2.2 alters non-crypto autoseeding to sweep up entropy from plugins.
+* Version 2.3 adds support for "new", module loading, and a null seed arg.
+* Version 2.3.1 adds a build environment, module packaging, and tests.
+* Version 2.3.4 fixes bugs on IE8, and switches to MIT license.
+* Version 2.3.6 adds a readable options object argument.
+* Version 2.3.10 adds support for node.js crypto (contributed by ctd1500).
+* Version 2.3.11 adds an option to load and save internal state.
+* Version 2.4.0 adds implementations of several other fast PRNGs.
+* Version 2.4.2 adds an implementation of Baagoe's very fast Alea PRNG.
+* Version 2.4.3 ignores nodejs crypto when under browserify.
+* Version 2.4.4 avoids strict mode problem with global this reference.
+* Version 3.0.1 removes Math.seedrandom for require('seedrandom') users.
+* Version 3.0.3 updates package.json for CDN entrypoints.
+* Version 3.0.5 removes eval to avoid triggering content-security policy.
+
+The standard ARC4 key scheduler cycles short keys, which means that
+seedrandom('ab') is equivalent to seedrandom('abab') and 'ababab'.
+Therefore it is a good idea to add a terminator to avoid trivial
+equivalences on short string seeds, e.g., Math.seedrandom(str + '\0').
+Starting with version 2.0, a terminator is added automatically for
+non-string seeds, so seeding with the number 111 is the same as seeding
+with '111\0'.
+
+When seedrandom() is called with zero args or a null seed, it uses a
+seed drawn from the browser crypto object if present.  If there is no
+crypto support, seedrandom() uses the current time, the native rng,
+and a walk of several DOM objects to collect a few bits of entropy.
+
+Each time the one- or two-argument forms of seedrandom are called,
+entropy from the passed seed is accumulated in a pool to help generate
+future seeds for the zero- and two-argument forms of seedrandom.
+
+On speed - This javascript implementation of Math.random() is several
+times slower than the built-in Math.random() because it is not native
+code, but that is typically fast enough.  Some details (timings on
+Chrome 25 on a 2010 vintage macbook):
+
+* seeded Math.random()          - avg less than 0.0002 milliseconds per call
+* seedrandom('explicit.')       - avg less than 0.2 milliseconds per call
+* seedrandom('explicit.', true) - avg less than 0.2 milliseconds per call
+* seedrandom() with crypto      - avg less than 0.2 milliseconds per call
+
+Autoseeding without crypto is somewhat slow, about 20-30 milliseconds on
+a 2012 windows 7 1.5ghz i5 laptop, as seen on Firefox 19, IE 10, and Opera.
+Seeded rng calls themselves are fast across these browsers, with slowest
+numbers on Opera at about 0.0005 ms per seeded Math.random().
+
+
+LICENSE (MIT)
+-------------
+
+Copyright 2019 David Bau.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
diff --git a/node_modules/seedrandom/bower.json b/node_modules/seedrandom/bower.json
new file mode 100644
index 0000000..8e62b3a
--- /dev/null
+++ b/node_modules/seedrandom/bower.json
@@ -0,0 +1,16 @@
+{
+  "name": "seedrandom",
+  "description": "Seeded random number generator for Javascript.",
+  "main": "seedrandom.js",
+  "license": "MIT",
+  "keywords": [
+    "random",
+    "seed",
+    "crypto"
+  ],
+  "ignore": [],
+  "devDependencies": {
+    "qunit": "latest",
+    "requirejs": "latest"
+  }
+}
diff --git a/node_modules/seedrandom/component.json b/node_modules/seedrandom/component.json
new file mode 100644
index 0000000..43fea29
--- /dev/null
+++ b/node_modules/seedrandom/component.json
@@ -0,0 +1,10 @@
+{
+  "name": "seedrandom",
+  "version": "3.0.0",
+  "description": "Seeded random number generator for Javascript",
+  "repository": "davidbau/seedrandom",
+  "main": "seedrandom.js",
+  "scripts": [ "seedrandom.js" ],
+  "keywords": [ "random", "seed", "crypto" ],
+  "license": "MIT"
+}
diff --git a/node_modules/seedrandom/coverage/coverage.json b/node_modules/seedrandom/coverage/coverage.json
new file mode 100644
index 0000000..9e9657b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/coverage.json
@@ -0,0 +1 @@
+{"/home/davidbau/git/seedrandom/seedrandom.js":{"path":"/home/davidbau/git/seedrandom/seedrandom.js","s":{"1":6,"2":6,"3":1,"4":23,"5":23,"6":23,"7":23,"8":23,"9":3694,"10":3694,"11":3918,"12":3918,"13":3918,"14":3694,"15":9252,"16":9252,"17":9252,"18":3694,"19":23,"20":1025,"21":23,"22":4100001,"23":23,"24":23,"25":23,"26":20,"27":4,"28":2,"29":4,"30":2,"31":20,"32":1,"33":1,"34":19,"35":1,"36":23,"37":23,"38":1,"39":23,"40":5888,"41":23,"42":5888,"43":5888,"44":23,"45":4108661,"46":4108661,"47":16436074,"48":16436074,"49":4108661,"50":4108661,"51":4108661,"52":1,"53":4,"54":4,"55":4,"56":4,"57":1,"58":174,"59":174,"60":8,"61":151,"62":151,"63":174,"64":1,"65":52,"66":52,"67":46040,"68":52,"69":1,"70":4,"71":4,"72":4,"73":3,"74":1,"75":1,"76":3,"77":1,"78":1,"79":1,"80":81,"81":6,"82":6,"83":6,"84":6,"85":6,"86":0,"87":0,"88":0,"89":0},"b":{"1":[1,22],"2":[22,11],"3":[2,21],"4":[4,17],"5":[23,21,20],"6":[4,16],"7":[2,2],"8":[1,19],"9":[4,19],"10":[1,22],"11":[8,166],"12":[174,56],"13":[8,166],"14":[29,137],"15":[3,1],"16":[4,3],"17":[1,1],"18":[1,0],"19":[6,0],"20":[6,6],"21":[0,0],"22":[0,0]},"f":{"1":6,"2":23,"3":3694,"4":1025,"5":4100001,"6":20,"7":2,"8":23,"9":4108661,"10":4,"11":174,"12":52,"13":4,"14":81,"15":0},"fnMap":{"1":{"name":"(anonymous_1)","line":25,"loc":{"start":{"line":25,"column":1},"end":{"line":25,"column":23}}},"2":{"name":"seedrandom","line":47,"loc":{"start":{"line":47,"column":0},"end":{"line":47,"column":45}}},"3":{"name":"(anonymous_3)","line":61,"loc":{"start":{"line":61,"column":13},"end":{"line":61,"column":24}}},"4":{"name":"(anonymous_4)","line":78,"loc":{"start":{"line":78,"column":15},"end":{"line":78,"column":26}}},"5":{"name":"(anonymous_5)","line":79,"loc":{"start":{"line":79,"column":15},"end":{"line":79,"column":26}}},"6":{"name":"(anonymous_6)","line":87,"loc":{"start":{"line":87,"column":6},"end":{"line":87,"column":48}}},"7":{"name":"(anonymous_7)","line":92,"loc":{"start":{"line":92,"column":23},"end":{"line":92,"column":34}}},"8":{"name":"ARC4","line":119,"loc":{"start":{"line":119,"column":0},"end":{"line":119,"column":19}}},"9":{"name":"(anonymous_9)","line":136,"loc":{"start":{"line":136,"column":10},"end":{"line":136,"column":26}}},"10":{"name":"copy","line":156,"loc":{"start":{"line":156,"column":0},"end":{"line":156,"column":20}}},"11":{"name":"flatten","line":167,"loc":{"start":{"line":167,"column":0},"end":{"line":167,"column":29}}},"12":{"name":"mixkey","line":182,"loc":{"start":{"line":182,"column":0},"end":{"line":182,"column":27}}},"13":{"name":"autoseed","line":196,"loc":{"start":{"line":196,"column":0},"end":{"line":196,"column":20}}},"14":{"name":"tostring","line":218,"loc":{"start":{"line":218,"column":0},"end":{"line":218,"column":21}}},"15":{"name":"(anonymous_15)","line":242,"loc":{"start":{"line":242,"column":9},"end":{"line":242,"column":20}}}},"statementMap":{"1":{"start":{"line":25,"column":0},"end":{"line":253,"column":2}},"2":{"start":{"line":32,"column":0},"end":{"line":41,"column":15}},"3":{"start":{"line":47,"column":0},"end":{"line":107,"column":1}},"4":{"start":{"line":48,"column":2},"end":{"line":48,"column":15}},"5":{"start":{"line":49,"column":2},"end":{"line":49,"column":68}},"6":{"start":{"line":52,"column":2},"end":{"line":54,"column":49}},"7":{"start":{"line":57,"column":2},"end":{"line":57,"column":27}},"8":{"start":{"line":61,"column":2},"end":{"line":76,"column":4}},"9":{"start":{"line":62,"column":4},"end":{"line":64,"column":14}},"10":{"start":{"line":65,"column":4},"end":{"line":69,"column":5}},"11":{"start":{"line":66,"column":6},"end":{"line":66,"column":26}},"12":{"start":{"line":67,"column":6},"end":{"line":67,"column":17}},"13":{"start":{"line":68,"column":6},"end":{"line":68,"column":20}},"14":{"start":{"line":70,"column":4},"end":{"line":74,"column":5}},"15":{"start":{"line":71,"column":6},"end":{"line":71,"column":13}},"16":{"start":{"line":72,"column":6},"end":{"line":72,"column":13}},"17":{"start":{"line":73,"column":6},"end":{"line":73,"column":15}},"18":{"start":{"line":75,"column":4},"end":{"line":75,"column":23}},"19":{"start":{"line":78,"column":2},"end":{"line":78,"column":51}},"20":{"start":{"line":78,"column":28},"end":{"line":78,"column":49}},"21":{"start":{"line":79,"column":2},"end":{"line":79,"column":61}},"22":{"start":{"line":79,"column":28},"end":{"line":79,"column":59}},"23":{"start":{"line":80,"column":2},"end":{"line":80,"column":21}},"24":{"start":{"line":83,"column":2},"end":{"line":83,"column":33}},"25":{"start":{"line":86,"column":2},"end":{"line":106,"column":17}},"26":{"start":{"line":88,"column":8},"end":{"line":93,"column":9}},"27":{"start":{"line":90,"column":10},"end":{"line":90,"column":45}},"28":{"start":{"line":90,"column":25},"end":{"line":90,"column":43}},"29":{"start":{"line":92,"column":10},"end":{"line":92,"column":60}},"30":{"start":{"line":92,"column":36},"end":{"line":92,"column":58}},"31":{"start":{"line":97,"column":8},"end":{"line":101,"column":25}},"32":{"start":{"line":97,"column":28},"end":{"line":97,"column":49}},"33":{"start":{"line":97,"column":50},"end":{"line":97,"column":62}},"34":{"start":{"line":101,"column":13},"end":{"line":101,"column":25}},"35":{"start":{"line":119,"column":0},"end":{"line":150,"column":1}},"36":{"start":{"line":120,"column":2},"end":{"line":121,"column":59}},"37":{"start":{"line":124,"column":2},"end":{"line":124,"column":36}},"38":{"start":{"line":124,"column":17},"end":{"line":124,"column":34}},"39":{"start":{"line":127,"column":2},"end":{"line":129,"column":3}},"40":{"start":{"line":128,"column":4},"end":{"line":128,"column":15}},"41":{"start":{"line":130,"column":2},"end":{"line":133,"column":3}},"42":{"start":{"line":131,"column":4},"end":{"line":131,"column":60}},"43":{"start":{"line":132,"column":4},"end":{"line":132,"column":13}},"44":{"start":{"line":136,"column":2},"end":{"line":149,"column":12}},"45":{"start":{"line":138,"column":4},"end":{"line":139,"column":37}},"46":{"start":{"line":140,"column":4},"end":{"line":143,"column":5}},"47":{"start":{"line":141,"column":6},"end":{"line":141,"column":32}},"48":{"start":{"line":142,"column":6},"end":{"line":142,"column":78}},"49":{"start":{"line":144,"column":4},"end":{"line":144,"column":13}},"50":{"start":{"line":144,"column":14},"end":{"line":144,"column":23}},"51":{"start":{"line":145,"column":4},"end":{"line":145,"column":13}},"52":{"start":{"line":156,"column":0},"end":{"line":161,"column":1}},"53":{"start":{"line":157,"column":2},"end":{"line":157,"column":12}},"54":{"start":{"line":158,"column":2},"end":{"line":158,"column":12}},"55":{"start":{"line":159,"column":2},"end":{"line":159,"column":20}},"56":{"start":{"line":160,"column":2},"end":{"line":160,"column":11}},"57":{"start":{"line":167,"column":0},"end":{"line":175,"column":1}},"58":{"start":{"line":168,"column":2},"end":{"line":168,"column":44}},"59":{"start":{"line":169,"column":2},"end":{"line":173,"column":3}},"60":{"start":{"line":170,"column":4},"end":{"line":172,"column":5}},"61":{"start":{"line":171,"column":6},"end":{"line":171,"column":70}},"62":{"start":{"line":171,"column":12},"end":{"line":171,"column":55}},"63":{"start":{"line":174,"column":2},"end":{"line":174,"column":71}},"64":{"start":{"line":182,"column":0},"end":{"line":189,"column":1}},"65":{"start":{"line":183,"column":2},"end":{"line":183,"column":43}},"66":{"start":{"line":184,"column":2},"end":{"line":187,"column":3}},"67":{"start":{"line":185,"column":4},"end":{"line":186,"column":74}},"68":{"start":{"line":188,"column":2},"end":{"line":188,"column":23}},"69":{"start":{"line":196,"column":0},"end":{"line":212,"column":1}},"70":{"start":{"line":197,"column":2},"end":{"line":211,"column":3}},"71":{"start":{"line":198,"column":4},"end":{"line":198,"column":12}},"72":{"start":{"line":199,"column":4},"end":{"line":205,"column":5}},"73":{"start":{"line":201,"column":6},"end":{"line":201,"column":23}},"74":{"start":{"line":203,"column":6},"end":{"line":203,"column":34}},"75":{"start":{"line":204,"column":6},"end":{"line":204,"column":62}},"76":{"start":{"line":206,"column":4},"end":{"line":206,"column":25}},"77":{"start":{"line":208,"column":4},"end":{"line":209,"column":45}},"78":{"start":{"line":210,"column":4},"end":{"line":210,"column":71}},"79":{"start":{"line":218,"column":0},"end":{"line":220,"column":1}},"80":{"start":{"line":219,"column":2},"end":{"line":219,"column":41}},"81":{"start":{"line":229,"column":0},"end":{"line":229,"column":28}},"82":{"start":{"line":235,"column":0},"end":{"line":246,"column":1}},"83":{"start":{"line":236,"column":2},"end":{"line":236,"column":30}},"84":{"start":{"line":238,"column":2},"end":{"line":240,"column":17}},"85":{"start":{"line":239,"column":4},"end":{"line":239,"column":35}},"86":{"start":{"line":241,"column":7},"end":{"line":246,"column":1}},"87":{"start":{"line":242,"column":2},"end":{"line":242,"column":44}},"88":{"start":{"line":242,"column":22},"end":{"line":242,"column":40}},"89":{"start":{"line":245,"column":2},"end":{"line":245,"column":38}}},"branchMap":{"1":{"line":49,"type":"cond-expr","locations":[{"start":{"line":49,"column":32},"end":{"line":49,"column":49}},{"start":{"line":49,"column":53},"end":{"line":49,"column":66}}]},"2":{"line":49,"type":"binary-expr","locations":[{"start":{"line":49,"column":53},"end":{"line":49,"column":60}},{"start":{"line":49,"column":64},"end":{"line":49,"column":66}}]},"3":{"line":53,"type":"cond-expr","locations":[{"start":{"line":53,"column":22},"end":{"line":53,"column":44}},{"start":{"line":54,"column":4},"end":{"line":54,"column":38}}]},"4":{"line":54,"type":"cond-expr","locations":[{"start":{"line":54,"column":21},"end":{"line":54,"column":31}},{"start":{"line":54,"column":34},"end":{"line":54,"column":38}}]},"5":{"line":86,"type":"binary-expr","locations":[{"start":{"line":86,"column":10},"end":{"line":86,"column":22}},{"start":{"line":86,"column":26},"end":{"line":86,"column":34}},{"start":{"line":87,"column":6},"end":{"line":102,"column":7}}]},"6":{"line":88,"type":"if","locations":[{"start":{"line":88,"column":8},"end":{"line":88,"column":8}},{"start":{"line":88,"column":8},"end":{"line":88,"column":8}}]},"7":{"line":90,"type":"if","locations":[{"start":{"line":90,"column":10},"end":{"line":90,"column":10}},{"start":{"line":90,"column":10},"end":{"line":90,"column":10}}]},"8":{"line":97,"type":"if","locations":[{"start":{"line":97,"column":8},"end":{"line":97,"column":8}},{"start":{"line":97,"column":8},"end":{"line":97,"column":8}}]},"9":{"line":105,"type":"cond-expr","locations":[{"start":{"line":105,"column":24},"end":{"line":105,"column":38}},{"start":{"line":105,"column":42},"end":{"line":105,"column":54}}]},"10":{"line":124,"type":"if","locations":[{"start":{"line":124,"column":2},"end":{"line":124,"column":2}},{"start":{"line":124,"column":2},"end":{"line":124,"column":2}}]},"11":{"line":169,"type":"if","locations":[{"start":{"line":169,"column":2},"end":{"line":169,"column":2}},{"start":{"line":169,"column":2},"end":{"line":169,"column":2}}]},"12":{"line":169,"type":"binary-expr","locations":[{"start":{"line":169,"column":6},"end":{"line":169,"column":11}},{"start":{"line":169,"column":15},"end":{"line":169,"column":30}}]},"13":{"line":174,"type":"cond-expr","locations":[{"start":{"line":174,"column":26},"end":{"line":174,"column":32}},{"start":{"line":174,"column":35},"end":{"line":174,"column":69}}]},"14":{"line":174,"type":"cond-expr","locations":[{"start":{"line":174,"column":53},"end":{"line":174,"column":56}},{"start":{"line":174,"column":59},"end":{"line":174,"column":69}}]},"15":{"line":199,"type":"if","locations":[{"start":{"line":199,"column":4},"end":{"line":199,"column":4}},{"start":{"line":199,"column":4},"end":{"line":199,"column":4}}]},"16":{"line":199,"type":"binary-expr","locations":[{"start":{"line":199,"column":8},"end":{"line":199,"column":18}},{"start":{"line":199,"column":23},"end":{"line":199,"column":51}}]},"17":{"line":204,"type":"binary-expr","locations":[{"start":{"line":204,"column":7},"end":{"line":204,"column":20}},{"start":{"line":204,"column":24},"end":{"line":204,"column":39}}]},"18":{"line":209,"type":"binary-expr","locations":[{"start":{"line":209,"column":18},"end":{"line":209,"column":25}},{"start":{"line":209,"column":29},"end":{"line":209,"column":44}}]},"19":{"line":235,"type":"if","locations":[{"start":{"line":235,"column":0},"end":{"line":235,"column":0}},{"start":{"line":235,"column":0},"end":{"line":235,"column":0}}]},"20":{"line":235,"type":"binary-expr","locations":[{"start":{"line":235,"column":4},"end":{"line":235,"column":31}},{"start":{"line":235,"column":35},"end":{"line":235,"column":49}}]},"21":{"line":241,"type":"if","locations":[{"start":{"line":241,"column":7},"end":{"line":241,"column":7}},{"start":{"line":241,"column":7},"end":{"line":241,"column":7}}]},"22":{"line":241,"type":"binary-expr","locations":[{"start":{"line":241,"column":11},"end":{"line":241,"column":40}},{"start":{"line":241,"column":44},"end":{"line":241,"column":54}}]}}},"/home/davidbau/git/seedrandom/lib/xor128.js":{"path":"/home/davidbau/git/seedrandom/lib/xor128.js","s":{"1":1,"2":1,"3":3,"4":3,"5":3,"6":3,"7":3,"8":3,"9":4105327,"10":4105327,"11":4105327,"12":4105327,"13":4105327,"14":3,"15":2,"16":1,"17":3,"18":198,"19":198,"20":1,"21":2,"22":2,"23":2,"24":2,"25":2,"26":1,"27":3,"28":4102054,"29":3,"30":1025,"31":1025,"32":1025,"33":3,"34":3,"35":3,"36":2,"37":1,"38":2,"39":1,"40":3,"41":1,"42":1,"43":0,"44":0,"45":0,"46":0},"b":{"1":[2,1],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"f":{"1":1,"2":3,"3":4105327,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":4,"loc":{"start":{"line":4,"column":1},"end":{"line":4,"column":34}}},"2":{"name":"XorGen","line":6,"loc":{"start":{"line":6,"column":0},"end":{"line":6,"column":22}}},"3":{"name":"(anonymous_3)","line":15,"loc":{"start":{"line":15,"column":12},"end":{"line":15,"column":23}}},"4":{"name":"copy","line":38,"loc":{"start":{"line":38,"column":0},"end":{"line":38,"column":20}}},"5":{"name":"impl","line":46,"loc":{"start":{"line":46,"column":0},"end":{"line":46,"column":26}}},"6":{"name":"(anonymous_6)","line":49,"loc":{"start":{"line":49,"column":13},"end":{"line":49,"column":24}}},"7":{"name":"(anonymous_7)","line":50,"loc":{"start":{"line":50,"column":16},"end":{"line":50,"column":27}}},"8":{"name":"(anonymous_8)","line":62,"loc":{"start":{"line":62,"column":17},"end":{"line":62,"column":28}}},"9":{"name":"(anonymous_9)","line":70,"loc":{"start":{"line":70,"column":9},"end":{"line":70,"column":20}}}},"statementMap":{"1":{"start":{"line":4,"column":0},"end":{"line":79,"column":2}},"2":{"start":{"line":6,"column":0},"end":{"line":36,"column":1}},"3":{"start":{"line":7,"column":2},"end":{"line":7,"column":30}},"4":{"start":{"line":9,"column":2},"end":{"line":9,"column":11}},"5":{"start":{"line":10,"column":2},"end":{"line":10,"column":11}},"6":{"start":{"line":11,"column":2},"end":{"line":11,"column":11}},"7":{"start":{"line":12,"column":2},"end":{"line":12,"column":11}},"8":{"start":{"line":15,"column":2},"end":{"line":21,"column":4}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":32}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":16}},"11":{"start":{"line":18,"column":4},"end":{"line":18,"column":16}},"12":{"start":{"line":19,"column":4},"end":{"line":19,"column":16}},"13":{"start":{"line":20,"column":4},"end":{"line":20,"column":49}},"14":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"15":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"16":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"17":{"start":{"line":32,"column":2},"end":{"line":35,"column":3}},"18":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"19":{"start":{"line":34,"column":4},"end":{"line":34,"column":14}},"20":{"start":{"line":38,"column":0},"end":{"line":44,"column":1}},"21":{"start":{"line":39,"column":2},"end":{"line":39,"column":12}},"22":{"start":{"line":40,"column":2},"end":{"line":40,"column":12}},"23":{"start":{"line":41,"column":2},"end":{"line":41,"column":12}},"24":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"25":{"start":{"line":43,"column":2},"end":{"line":43,"column":11}},"26":{"start":{"line":46,"column":0},"end":{"line":65,"column":1}},"27":{"start":{"line":47,"column":2},"end":{"line":49,"column":68}},"28":{"start":{"line":49,"column":26},"end":{"line":49,"column":65}},"29":{"start":{"line":50,"column":2},"end":{"line":57,"column":4}},"30":{"start":{"line":51,"column":4},"end":{"line":55,"column":27}},"31":{"start":{"line":52,"column":6},"end":{"line":54,"column":43}},"32":{"start":{"line":56,"column":4},"end":{"line":56,"column":18}},"33":{"start":{"line":58,"column":2},"end":{"line":58,"column":23}},"34":{"start":{"line":59,"column":2},"end":{"line":59,"column":20}},"35":{"start":{"line":60,"column":2},"end":{"line":63,"column":3}},"36":{"start":{"line":61,"column":4},"end":{"line":61,"column":51}},"37":{"start":{"line":61,"column":35},"end":{"line":61,"column":51}},"38":{"start":{"line":62,"column":4},"end":{"line":62,"column":52}},"39":{"start":{"line":62,"column":30},"end":{"line":62,"column":50}},"40":{"start":{"line":64,"column":2},"end":{"line":64,"column":14}},"41":{"start":{"line":67,"column":0},"end":{"line":73,"column":1}},"42":{"start":{"line":68,"column":2},"end":{"line":68,"column":24}},"43":{"start":{"line":69,"column":7},"end":{"line":73,"column":1}},"44":{"start":{"line":70,"column":2},"end":{"line":70,"column":38}},"45":{"start":{"line":70,"column":22},"end":{"line":70,"column":34}},"46":{"start":{"line":72,"column":2},"end":{"line":72,"column":21}}},"branchMap":{"1":{"line":23,"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":23,"column":2}},{"start":{"line":23,"column":2},"end":{"line":23,"column":2}}]},"2":{"line":48,"type":"binary-expr","locations":[{"start":{"line":48,"column":14},"end":{"line":48,"column":18}},{"start":{"line":48,"column":22},"end":{"line":48,"column":32}}]},"3":{"line":60,"type":"if","locations":[{"start":{"line":60,"column":2},"end":{"line":60,"column":2}},{"start":{"line":60,"column":2},"end":{"line":60,"column":2}}]},"4":{"line":61,"type":"if","locations":[{"start":{"line":61,"column":4},"end":{"line":61,"column":4}},{"start":{"line":61,"column":4},"end":{"line":61,"column":4}}]},"5":{"line":67,"type":"if","locations":[{"start":{"line":67,"column":0},"end":{"line":67,"column":0}},{"start":{"line":67,"column":0},"end":{"line":67,"column":0}}]},"6":{"line":67,"type":"binary-expr","locations":[{"start":{"line":67,"column":4},"end":{"line":67,"column":10}},{"start":{"line":67,"column":14},"end":{"line":67,"column":28}}]},"7":{"line":69,"type":"if","locations":[{"start":{"line":69,"column":7},"end":{"line":69,"column":7}},{"start":{"line":69,"column":7},"end":{"line":69,"column":7}}]},"8":{"line":69,"type":"binary-expr","locations":[{"start":{"line":69,"column":11},"end":{"line":69,"column":17}},{"start":{"line":69,"column":21},"end":{"line":69,"column":31}}]},"9":{"line":77,"type":"binary-expr","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":29}},{"start":{"line":77,"column":33},"end":{"line":77,"column":39}}]},"10":{"line":78,"type":"binary-expr","locations":[{"start":{"line":78,"column":2},"end":{"line":78,"column":31}},{"start":{"line":78,"column":35},"end":{"line":78,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xorwow.js":{"path":"/home/davidbau/git/seedrandom/lib/xorwow.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105327,"6":4105327,"7":4105327,"8":4105327,"9":4105327,"10":4105327,"11":3,"12":3,"13":3,"14":3,"15":3,"16":3,"17":2,"18":1,"19":3,"20":198,"21":198,"22":3,"23":198,"24":1,"25":2,"26":2,"27":2,"28":2,"29":2,"30":2,"31":2,"32":1,"33":3,"34":4102054,"35":3,"36":1025,"37":1025,"38":1025,"39":3,"40":3,"41":3,"42":2,"43":1,"44":2,"45":1,"46":3,"47":1,"48":1,"49":0,"50":0,"51":0,"52":0},"b":{"1":[2,1],"2":[3,195],"3":[3,2],"4":[2,1],"5":[1,1],"6":[1,0],"7":[1,1],"8":[0,0],"9":[0,0],"10":[1,1],"11":[1,0]},"f":{"1":1,"2":3,"3":4105327,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":4,"loc":{"start":{"line":4,"column":1},"end":{"line":4,"column":34}}},"2":{"name":"XorGen","line":6,"loc":{"start":{"line":6,"column":0},"end":{"line":6,"column":22}}},"3":{"name":"(anonymous_3)","line":10,"loc":{"start":{"line":10,"column":12},"end":{"line":10,"column":23}}},"4":{"name":"copy","line":41,"loc":{"start":{"line":41,"column":0},"end":{"line":41,"column":20}}},"5":{"name":"impl","line":51,"loc":{"start":{"line":51,"column":0},"end":{"line":51,"column":26}}},"6":{"name":"(anonymous_6)","line":54,"loc":{"start":{"line":54,"column":13},"end":{"line":54,"column":24}}},"7":{"name":"(anonymous_7)","line":55,"loc":{"start":{"line":55,"column":16},"end":{"line":55,"column":27}}},"8":{"name":"(anonymous_8)","line":67,"loc":{"start":{"line":67,"column":17},"end":{"line":67,"column":28}}},"9":{"name":"(anonymous_9)","line":75,"loc":{"start":{"line":75,"column":9},"end":{"line":75,"column":20}}}},"statementMap":{"1":{"start":{"line":4,"column":0},"end":{"line":84,"column":2}},"2":{"start":{"line":6,"column":0},"end":{"line":39,"column":1}},"3":{"start":{"line":7,"column":2},"end":{"line":7,"column":30}},"4":{"start":{"line":10,"column":2},"end":{"line":15,"column":4}},"5":{"start":{"line":11,"column":4},"end":{"line":11,"column":34}},"6":{"start":{"line":12,"column":4},"end":{"line":12,"column":16}},"7":{"start":{"line":12,"column":17},"end":{"line":12,"column":29}},"8":{"start":{"line":12,"column":30},"end":{"line":12,"column":42}},"9":{"start":{"line":12,"column":43},"end":{"line":12,"column":55}},"10":{"start":{"line":13,"column":4},"end":{"line":14,"column":58}},"11":{"start":{"line":17,"column":2},"end":{"line":17,"column":11}},"12":{"start":{"line":18,"column":2},"end":{"line":18,"column":11}},"13":{"start":{"line":19,"column":2},"end":{"line":19,"column":11}},"14":{"start":{"line":20,"column":2},"end":{"line":20,"column":11}},"15":{"start":{"line":21,"column":2},"end":{"line":21,"column":11}},"16":{"start":{"line":23,"column":2},"end":{"line":29,"column":3}},"17":{"start":{"line":25,"column":4},"end":{"line":25,"column":16}},"18":{"start":{"line":28,"column":4},"end":{"line":28,"column":20}},"19":{"start":{"line":32,"column":2},"end":{"line":38,"column":3}},"20":{"start":{"line":33,"column":4},"end":{"line":33,"column":38}},"21":{"start":{"line":34,"column":4},"end":{"line":36,"column":5}},"22":{"start":{"line":35,"column":6},"end":{"line":35,"column":37}},"23":{"start":{"line":37,"column":4},"end":{"line":37,"column":14}},"24":{"start":{"line":41,"column":0},"end":{"line":49,"column":1}},"25":{"start":{"line":42,"column":2},"end":{"line":42,"column":12}},"26":{"start":{"line":43,"column":2},"end":{"line":43,"column":12}},"27":{"start":{"line":44,"column":2},"end":{"line":44,"column":12}},"28":{"start":{"line":45,"column":2},"end":{"line":45,"column":12}},"29":{"start":{"line":46,"column":2},"end":{"line":46,"column":12}},"30":{"start":{"line":47,"column":2},"end":{"line":47,"column":12}},"31":{"start":{"line":48,"column":2},"end":{"line":48,"column":11}},"32":{"start":{"line":51,"column":0},"end":{"line":70,"column":1}},"33":{"start":{"line":52,"column":2},"end":{"line":54,"column":68}},"34":{"start":{"line":54,"column":26},"end":{"line":54,"column":65}},"35":{"start":{"line":55,"column":2},"end":{"line":62,"column":4}},"36":{"start":{"line":56,"column":4},"end":{"line":60,"column":27}},"37":{"start":{"line":57,"column":6},"end":{"line":59,"column":43}},"38":{"start":{"line":61,"column":4},"end":{"line":61,"column":18}},"39":{"start":{"line":63,"column":2},"end":{"line":63,"column":23}},"40":{"start":{"line":64,"column":2},"end":{"line":64,"column":20}},"41":{"start":{"line":65,"column":2},"end":{"line":68,"column":3}},"42":{"start":{"line":66,"column":4},"end":{"line":66,"column":51}},"43":{"start":{"line":66,"column":35},"end":{"line":66,"column":51}},"44":{"start":{"line":67,"column":4},"end":{"line":67,"column":52}},"45":{"start":{"line":67,"column":30},"end":{"line":67,"column":50}},"46":{"start":{"line":69,"column":2},"end":{"line":69,"column":14}},"47":{"start":{"line":72,"column":0},"end":{"line":78,"column":1}},"48":{"start":{"line":73,"column":2},"end":{"line":73,"column":24}},"49":{"start":{"line":74,"column":7},"end":{"line":78,"column":1}},"50":{"start":{"line":75,"column":2},"end":{"line":75,"column":38}},"51":{"start":{"line":75,"column":22},"end":{"line":75,"column":34}},"52":{"start":{"line":77,"column":2},"end":{"line":77,"column":21}}},"branchMap":{"1":{"line":23,"type":"if","locations":[{"start":{"line":23,"column":2},"end":{"line":23,"column":2}},{"start":{"line":23,"column":2},"end":{"line":23,"column":2}}]},"2":{"line":34,"type":"if","locations":[{"start":{"line":34,"column":4},"end":{"line":34,"column":4}},{"start":{"line":34,"column":4},"end":{"line":34,"column":4}}]},"3":{"line":53,"type":"binary-expr","locations":[{"start":{"line":53,"column":14},"end":{"line":53,"column":18}},{"start":{"line":53,"column":22},"end":{"line":53,"column":32}}]},"4":{"line":65,"type":"if","locations":[{"start":{"line":65,"column":2},"end":{"line":65,"column":2}},{"start":{"line":65,"column":2},"end":{"line":65,"column":2}}]},"5":{"line":66,"type":"if","locations":[{"start":{"line":66,"column":4},"end":{"line":66,"column":4}},{"start":{"line":66,"column":4},"end":{"line":66,"column":4}}]},"6":{"line":72,"type":"if","locations":[{"start":{"line":72,"column":0},"end":{"line":72,"column":0}},{"start":{"line":72,"column":0},"end":{"line":72,"column":0}}]},"7":{"line":72,"type":"binary-expr","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":10}},{"start":{"line":72,"column":14},"end":{"line":72,"column":28}}]},"8":{"line":74,"type":"if","locations":[{"start":{"line":74,"column":7},"end":{"line":74,"column":7}},{"start":{"line":74,"column":7},"end":{"line":74,"column":7}}]},"9":{"line":74,"type":"binary-expr","locations":[{"start":{"line":74,"column":11},"end":{"line":74,"column":17}},{"start":{"line":74,"column":21},"end":{"line":74,"column":31}}]},"10":{"line":82,"type":"binary-expr","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":29}},{"start":{"line":82,"column":33},"end":{"line":82,"column":39}}]},"11":{"line":83,"type":"binary-expr","locations":[{"start":{"line":83,"column":2},"end":{"line":83,"column":31}},{"start":{"line":83,"column":35},"end":{"line":83,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xorshift7.js":{"path":"/home/davidbau/git/seedrandom/lib/xorshift7.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105897,"6":4105897,"7":4105897,"8":4105897,"9":4105897,"10":4105897,"11":4105897,"12":4105897,"13":4105897,"14":4105897,"15":4105897,"16":4105897,"17":4105897,"18":4105897,"19":4105897,"20":4105897,"21":1,"22":3,"23":3,"24":2,"25":1,"26":1,"27":6,"28":3,"29":16,"30":3,"31":3,"32":2,"33":1,"34":3,"35":3,"36":3,"37":768,"38":3,"39":1,"40":2,"41":2,"42":2,"43":1,"44":3,"45":0,"46":3,"47":4102054,"48":3,"49":1025,"50":1025,"51":1025,"52":3,"53":3,"54":3,"55":2,"56":1,"57":2,"58":1,"59":3,"60":1,"61":1,"62":0,"63":0,"64":0,"65":0},"b":{"1":[2,1],"2":[19,17],"3":[2,1],"4":[0,3],"5":[3,2],"6":[2,1],"7":[1,1],"8":[1,0],"9":[1,1],"10":[0,0],"11":[0,0],"12":[1,1],"13":[1,0]},"f":{"1":1,"2":3,"3":4105897,"4":3,"5":2,"6":3,"7":4102054,"8":1025,"9":1,"10":0},"fnMap":{"1":{"name":"(anonymous_1)","line":6,"loc":{"start":{"line":6,"column":1},"end":{"line":6,"column":34}}},"2":{"name":"XorGen","line":8,"loc":{"start":{"line":8,"column":0},"end":{"line":8,"column":22}}},"3":{"name":"(anonymous_3)","line":12,"loc":{"start":{"line":12,"column":12},"end":{"line":12,"column":23}}},"4":{"name":"init","line":25,"loc":{"start":{"line":25,"column":2},"end":{"line":25,"column":26}}},"5":{"name":"copy","line":56,"loc":{"start":{"line":56,"column":0},"end":{"line":56,"column":20}}},"6":{"name":"impl","line":62,"loc":{"start":{"line":62,"column":0},"end":{"line":62,"column":26}}},"7":{"name":"(anonymous_7)","line":66,"loc":{"start":{"line":66,"column":13},"end":{"line":66,"column":24}}},"8":{"name":"(anonymous_8)","line":67,"loc":{"start":{"line":67,"column":16},"end":{"line":67,"column":27}}},"9":{"name":"(anonymous_9)","line":79,"loc":{"start":{"line":79,"column":17},"end":{"line":79,"column":28}}},"10":{"name":"(anonymous_10)","line":87,"loc":{"start":{"line":87,"column":9},"end":{"line":87,"column":20}}}},"statementMap":{"1":{"start":{"line":6,"column":0},"end":{"line":96,"column":2}},"2":{"start":{"line":8,"column":0},"end":{"line":54,"column":1}},"3":{"start":{"line":9,"column":2},"end":{"line":9,"column":16}},"4":{"start":{"line":12,"column":2},"end":{"line":23,"column":4}},"5":{"start":{"line":14,"column":4},"end":{"line":14,"column":36}},"6":{"start":{"line":15,"column":4},"end":{"line":15,"column":13}},"7":{"start":{"line":15,"column":14},"end":{"line":15,"column":29}},"8":{"start":{"line":15,"column":30},"end":{"line":15,"column":48}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":23}},"10":{"start":{"line":16,"column":24},"end":{"line":16,"column":44}},"11":{"start":{"line":17,"column":4},"end":{"line":17,"column":23}},"12":{"start":{"line":17,"column":24},"end":{"line":17,"column":43}},"13":{"start":{"line":18,"column":4},"end":{"line":18,"column":23}},"14":{"start":{"line":18,"column":24},"end":{"line":18,"column":42}},"15":{"start":{"line":19,"column":4},"end":{"line":19,"column":23}},"16":{"start":{"line":19,"column":24},"end":{"line":19,"column":42}},"17":{"start":{"line":19,"column":43},"end":{"line":19,"column":61}},"18":{"start":{"line":20,"column":4},"end":{"line":20,"column":13}},"19":{"start":{"line":21,"column":4},"end":{"line":21,"column":23}},"20":{"start":{"line":22,"column":4},"end":{"line":22,"column":13}},"21":{"start":{"line":25,"column":2},"end":{"line":51,"column":3}},"22":{"start":{"line":26,"column":4},"end":{"line":26,"column":21}},"23":{"start":{"line":28,"column":4},"end":{"line":38,"column":5}},"24":{"start":{"line":30,"column":6},"end":{"line":30,"column":22}},"25":{"start":{"line":33,"column":6},"end":{"line":33,"column":23}},"26":{"start":{"line":34,"column":6},"end":{"line":37,"column":7}},"27":{"start":{"line":35,"column":8},"end":{"line":36,"column":56}},"28":{"start":{"line":40,"column":4},"end":{"line":40,"column":35}},"29":{"start":{"line":40,"column":25},"end":{"line":40,"column":35}},"30":{"start":{"line":41,"column":4},"end":{"line":41,"column":42}},"31":{"start":{"line":42,"column":4},"end":{"line":42,"column":45}},"32":{"start":{"line":42,"column":16},"end":{"line":42,"column":30}},"33":{"start":{"line":42,"column":36},"end":{"line":42,"column":45}},"34":{"start":{"line":44,"column":4},"end":{"line":44,"column":13}},"35":{"start":{"line":45,"column":4},"end":{"line":45,"column":13}},"36":{"start":{"line":48,"column":4},"end":{"line":50,"column":5}},"37":{"start":{"line":49,"column":6},"end":{"line":49,"column":16}},"38":{"start":{"line":53,"column":2},"end":{"line":53,"column":17}},"39":{"start":{"line":56,"column":0},"end":{"line":60,"column":1}},"40":{"start":{"line":57,"column":2},"end":{"line":57,"column":20}},"41":{"start":{"line":58,"column":2},"end":{"line":58,"column":12}},"42":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"43":{"start":{"line":62,"column":0},"end":{"line":82,"column":1}},"44":{"start":{"line":63,"column":2},"end":{"line":63,"column":39}},"45":{"start":{"line":63,"column":20},"end":{"line":63,"column":39}},"46":{"start":{"line":64,"column":2},"end":{"line":66,"column":68}},"47":{"start":{"line":66,"column":26},"end":{"line":66,"column":65}},"48":{"start":{"line":67,"column":2},"end":{"line":74,"column":4}},"49":{"start":{"line":68,"column":4},"end":{"line":72,"column":27}},"50":{"start":{"line":69,"column":6},"end":{"line":71,"column":43}},"51":{"start":{"line":73,"column":4},"end":{"line":73,"column":18}},"52":{"start":{"line":75,"column":2},"end":{"line":75,"column":23}},"53":{"start":{"line":76,"column":2},"end":{"line":76,"column":20}},"54":{"start":{"line":77,"column":2},"end":{"line":80,"column":3}},"55":{"start":{"line":78,"column":4},"end":{"line":78,"column":33}},"56":{"start":{"line":78,"column":17},"end":{"line":78,"column":33}},"57":{"start":{"line":79,"column":4},"end":{"line":79,"column":52}},"58":{"start":{"line":79,"column":30},"end":{"line":79,"column":50}},"59":{"start":{"line":81,"column":2},"end":{"line":81,"column":14}},"60":{"start":{"line":84,"column":0},"end":{"line":90,"column":1}},"61":{"start":{"line":85,"column":2},"end":{"line":85,"column":24}},"62":{"start":{"line":86,"column":7},"end":{"line":90,"column":1}},"63":{"start":{"line":87,"column":2},"end":{"line":87,"column":38}},"64":{"start":{"line":87,"column":22},"end":{"line":87,"column":34}},"65":{"start":{"line":89,"column":2},"end":{"line":89,"column":24}}},"branchMap":{"1":{"line":28,"type":"if","locations":[{"start":{"line":28,"column":4},"end":{"line":28,"column":4}},{"start":{"line":28,"column":4},"end":{"line":28,"column":4}}]},"2":{"line":41,"type":"binary-expr","locations":[{"start":{"line":41,"column":16},"end":{"line":41,"column":21}},{"start":{"line":41,"column":25},"end":{"line":41,"column":35}}]},"3":{"line":42,"type":"if","locations":[{"start":{"line":42,"column":4},"end":{"line":42,"column":4}},{"start":{"line":42,"column":4},"end":{"line":42,"column":4}}]},"4":{"line":63,"type":"if","locations":[{"start":{"line":63,"column":2},"end":{"line":63,"column":2}},{"start":{"line":63,"column":2},"end":{"line":63,"column":2}}]},"5":{"line":65,"type":"binary-expr","locations":[{"start":{"line":65,"column":14},"end":{"line":65,"column":18}},{"start":{"line":65,"column":22},"end":{"line":65,"column":32}}]},"6":{"line":77,"type":"if","locations":[{"start":{"line":77,"column":2},"end":{"line":77,"column":2}},{"start":{"line":77,"column":2},"end":{"line":77,"column":2}}]},"7":{"line":78,"type":"if","locations":[{"start":{"line":78,"column":4},"end":{"line":78,"column":4}},{"start":{"line":78,"column":4},"end":{"line":78,"column":4}}]},"8":{"line":84,"type":"if","locations":[{"start":{"line":84,"column":0},"end":{"line":84,"column":0}},{"start":{"line":84,"column":0},"end":{"line":84,"column":0}}]},"9":{"line":84,"type":"binary-expr","locations":[{"start":{"line":84,"column":4},"end":{"line":84,"column":10}},{"start":{"line":84,"column":14},"end":{"line":84,"column":28}}]},"10":{"line":86,"type":"if","locations":[{"start":{"line":86,"column":7},"end":{"line":86,"column":7}},{"start":{"line":86,"column":7},"end":{"line":86,"column":7}}]},"11":{"line":86,"type":"binary-expr","locations":[{"start":{"line":86,"column":11},"end":{"line":86,"column":17}},{"start":{"line":86,"column":21},"end":{"line":86,"column":31}}]},"12":{"line":94,"type":"binary-expr","locations":[{"start":{"line":94,"column":2},"end":{"line":94,"column":29}},{"start":{"line":94,"column":33},"end":{"line":94,"column":39}}]},"13":{"line":95,"type":"binary-expr","locations":[{"start":{"line":95,"column":2},"end":{"line":95,"column":31}},{"start":{"line":95,"column":35},"end":{"line":95,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/xor4096.js":{"path":"/home/davidbau/git/seedrandom/lib/xor4096.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":4105129,"10":4105129,"11":4105129,"12":4105129,"13":4105129,"14":4105129,"15":4105129,"16":1,"17":3,"18":3,"19":2,"20":2,"21":1,"22":1,"23":1,"24":3,"25":480,"26":160,"27":480,"28":3,"29":480,"30":480,"31":480,"32":480,"33":480,"34":384,"35":384,"36":384,"37":3,"38":0,"39":3,"40":3,"41":1536,"42":1536,"43":1536,"44":1536,"45":1536,"46":1536,"47":1536,"48":3,"49":3,"50":3,"51":3,"52":1,"53":2,"54":2,"55":2,"56":2,"57":1,"58":3,"59":0,"60":3,"61":4102054,"62":3,"63":1025,"64":1025,"65":1025,"66":3,"67":3,"68":3,"69":2,"70":1,"71":2,"72":1,"73":3,"74":1,"75":1,"76":0,"77":0,"78":0,"79":0},"b":{"1":[2,1],"2":[160,320],"3":[3,477],"4":[384,96],"5":[0,384],"6":[0,3],"7":[0,0,0],"8":[0,3],"9":[3,2],"10":[2,1],"11":[1,1],"12":[1,0],"13":[1,1],"14":[0,0],"15":[0,0],"16":[1,1],"17":[1,0]},"f":{"1":1,"2":3,"3":4105129,"4":3,"5":2,"6":3,"7":4102054,"8":1025,"9":1,"10":0},"fnMap":{"1":{"name":"(anonymous_1)","line":26,"loc":{"start":{"line":26,"column":1},"end":{"line":26,"column":34}}},"2":{"name":"XorGen","line":28,"loc":{"start":{"line":28,"column":0},"end":{"line":28,"column":22}}},"3":{"name":"(anonymous_3)","line":32,"loc":{"start":{"line":32,"column":12},"end":{"line":32,"column":23}}},"4":{"name":"init","line":51,"loc":{"start":{"line":51,"column":2},"end":{"line":51,"column":26}}},"5":{"name":"copy","line":105,"loc":{"start":{"line":105,"column":0},"end":{"line":105,"column":20}}},"6":{"name":"impl","line":112,"loc":{"start":{"line":112,"column":0},"end":{"line":112,"column":26}}},"7":{"name":"(anonymous_7)","line":116,"loc":{"start":{"line":116,"column":13},"end":{"line":116,"column":24}}},"8":{"name":"(anonymous_8)","line":117,"loc":{"start":{"line":117,"column":16},"end":{"line":117,"column":27}}},"9":{"name":"(anonymous_9)","line":129,"loc":{"start":{"line":129,"column":17},"end":{"line":129,"column":28}}},"10":{"name":"(anonymous_10)","line":137,"loc":{"start":{"line":137,"column":9},"end":{"line":137,"column":20}}}},"statementMap":{"1":{"start":{"line":26,"column":0},"end":{"line":146,"column":2}},"2":{"start":{"line":28,"column":0},"end":{"line":103,"column":1}},"3":{"start":{"line":29,"column":2},"end":{"line":29,"column":16}},"4":{"start":{"line":32,"column":2},"end":{"line":49,"column":4}},"5":{"start":{"line":33,"column":4},"end":{"line":34,"column":33}},"6":{"start":{"line":36,"column":4},"end":{"line":36,"column":36}},"7":{"start":{"line":38,"column":4},"end":{"line":38,"column":26}},"8":{"start":{"line":39,"column":4},"end":{"line":39,"column":31}},"9":{"start":{"line":40,"column":4},"end":{"line":40,"column":17}},"10":{"start":{"line":41,"column":4},"end":{"line":41,"column":17}},"11":{"start":{"line":42,"column":4},"end":{"line":42,"column":18}},"12":{"start":{"line":43,"column":4},"end":{"line":43,"column":18}},"13":{"start":{"line":45,"column":4},"end":{"line":45,"column":21}},"14":{"start":{"line":46,"column":4},"end":{"line":46,"column":13}},"15":{"start":{"line":48,"column":4},"end":{"line":48,"column":38}},"16":{"start":{"line":51,"column":2},"end":{"line":100,"column":3}},"17":{"start":{"line":52,"column":4},"end":{"line":52,"column":43}},"18":{"start":{"line":53,"column":4},"end":{"line":62,"column":5}},"19":{"start":{"line":55,"column":6},"end":{"line":55,"column":15}},"20":{"start":{"line":56,"column":6},"end":{"line":56,"column":18}},"21":{"start":{"line":59,"column":6},"end":{"line":59,"column":25}},"22":{"start":{"line":60,"column":6},"end":{"line":60,"column":12}},"23":{"start":{"line":61,"column":6},"end":{"line":61,"column":43}},"24":{"start":{"line":64,"column":4},"end":{"line":78,"column":5}},"25":{"start":{"line":66,"column":6},"end":{"line":66,"column":61}},"26":{"start":{"line":66,"column":16},"end":{"line":66,"column":61}},"27":{"start":{"line":68,"column":6},"end":{"line":68,"column":25}},"28":{"start":{"line":68,"column":19},"end":{"line":68,"column":25}},"29":{"start":{"line":69,"column":6},"end":{"line":69,"column":19}},"30":{"start":{"line":70,"column":6},"end":{"line":70,"column":20}},"31":{"start":{"line":71,"column":6},"end":{"line":71,"column":18}},"32":{"start":{"line":72,"column":6},"end":{"line":72,"column":20}},"33":{"start":{"line":73,"column":6},"end":{"line":77,"column":7}},"34":{"start":{"line":74,"column":8},"end":{"line":74,"column":33}},"35":{"start":{"line":75,"column":8},"end":{"line":75,"column":36}},"36":{"start":{"line":76,"column":8},"end":{"line":76,"column":33}},"37":{"start":{"line":80,"column":4},"end":{"line":82,"column":5}},"38":{"start":{"line":81,"column":6},"end":{"line":81,"column":47}},"39":{"start":{"line":86,"column":4},"end":{"line":86,"column":12}},"40":{"start":{"line":87,"column":4},"end":{"line":95,"column":5}},"41":{"start":{"line":88,"column":6},"end":{"line":88,"column":28}},"42":{"start":{"line":89,"column":6},"end":{"line":89,"column":33}},"43":{"start":{"line":90,"column":6},"end":{"line":90,"column":19}},"44":{"start":{"line":91,"column":6},"end":{"line":91,"column":19}},"45":{"start":{"line":92,"column":6},"end":{"line":92,"column":20}},"46":{"start":{"line":93,"column":6},"end":{"line":93,"column":20}},"47":{"start":{"line":94,"column":6},"end":{"line":94,"column":19}},"48":{"start":{"line":97,"column":4},"end":{"line":97,"column":13}},"49":{"start":{"line":98,"column":4},"end":{"line":98,"column":13}},"50":{"start":{"line":99,"column":4},"end":{"line":99,"column":13}},"51":{"start":{"line":102,"column":2},"end":{"line":102,"column":17}},"52":{"start":{"line":105,"column":0},"end":{"line":110,"column":1}},"53":{"start":{"line":106,"column":2},"end":{"line":106,"column":12}},"54":{"start":{"line":107,"column":2},"end":{"line":107,"column":12}},"55":{"start":{"line":108,"column":2},"end":{"line":108,"column":20}},"56":{"start":{"line":109,"column":2},"end":{"line":109,"column":11}},"57":{"start":{"line":112,"column":0},"end":{"line":132,"column":1}},"58":{"start":{"line":113,"column":2},"end":{"line":113,"column":39}},"59":{"start":{"line":113,"column":20},"end":{"line":113,"column":39}},"60":{"start":{"line":114,"column":2},"end":{"line":116,"column":68}},"61":{"start":{"line":116,"column":26},"end":{"line":116,"column":65}},"62":{"start":{"line":117,"column":2},"end":{"line":124,"column":4}},"63":{"start":{"line":118,"column":4},"end":{"line":122,"column":27}},"64":{"start":{"line":119,"column":6},"end":{"line":121,"column":43}},"65":{"start":{"line":123,"column":4},"end":{"line":123,"column":18}},"66":{"start":{"line":125,"column":2},"end":{"line":125,"column":23}},"67":{"start":{"line":126,"column":2},"end":{"line":126,"column":20}},"68":{"start":{"line":127,"column":2},"end":{"line":130,"column":3}},"69":{"start":{"line":128,"column":4},"end":{"line":128,"column":33}},"70":{"start":{"line":128,"column":17},"end":{"line":128,"column":33}},"71":{"start":{"line":129,"column":4},"end":{"line":129,"column":52}},"72":{"start":{"line":129,"column":30},"end":{"line":129,"column":50}},"73":{"start":{"line":131,"column":2},"end":{"line":131,"column":14}},"74":{"start":{"line":134,"column":0},"end":{"line":140,"column":1}},"75":{"start":{"line":135,"column":2},"end":{"line":135,"column":24}},"76":{"start":{"line":136,"column":7},"end":{"line":140,"column":1}},"77":{"start":{"line":137,"column":2},"end":{"line":137,"column":38}},"78":{"start":{"line":137,"column":22},"end":{"line":137,"column":34}},"79":{"start":{"line":139,"column":2},"end":{"line":139,"column":22}}},"branchMap":{"1":{"line":53,"type":"if","locations":[{"start":{"line":53,"column":4},"end":{"line":53,"column":4}},{"start":{"line":53,"column":4},"end":{"line":53,"column":4}}]},"2":{"line":66,"type":"if","locations":[{"start":{"line":66,"column":6},"end":{"line":66,"column":6}},{"start":{"line":66,"column":6},"end":{"line":66,"column":6}}]},"3":{"line":68,"type":"if","locations":[{"start":{"line":68,"column":6},"end":{"line":68,"column":6}},{"start":{"line":68,"column":6},"end":{"line":68,"column":6}}]},"4":{"line":73,"type":"if","locations":[{"start":{"line":73,"column":6},"end":{"line":73,"column":6}},{"start":{"line":73,"column":6},"end":{"line":73,"column":6}}]},"5":{"line":76,"type":"cond-expr","locations":[{"start":{"line":76,"column":23},"end":{"line":76,"column":28}},{"start":{"line":76,"column":31},"end":{"line":76,"column":32}}]},"6":{"line":80,"type":"if","locations":[{"start":{"line":80,"column":4},"end":{"line":80,"column":4}},{"start":{"line":80,"column":4},"end":{"line":80,"column":4}}]},"7":{"line":81,"type":"binary-expr","locations":[{"start":{"line":81,"column":9},"end":{"line":81,"column":13}},{"start":{"line":81,"column":17},"end":{"line":81,"column":28}},{"start":{"line":81,"column":32},"end":{"line":81,"column":33}}]},"8":{"line":113,"type":"if","locations":[{"start":{"line":113,"column":2},"end":{"line":113,"column":2}},{"start":{"line":113,"column":2},"end":{"line":113,"column":2}}]},"9":{"line":115,"type":"binary-expr","locations":[{"start":{"line":115,"column":14},"end":{"line":115,"column":18}},{"start":{"line":115,"column":22},"end":{"line":115,"column":32}}]},"10":{"line":127,"type":"if","locations":[{"start":{"line":127,"column":2},"end":{"line":127,"column":2}},{"start":{"line":127,"column":2},"end":{"line":127,"column":2}}]},"11":{"line":128,"type":"if","locations":[{"start":{"line":128,"column":4},"end":{"line":128,"column":4}},{"start":{"line":128,"column":4},"end":{"line":128,"column":4}}]},"12":{"line":134,"type":"if","locations":[{"start":{"line":134,"column":0},"end":{"line":134,"column":0}},{"start":{"line":134,"column":0},"end":{"line":134,"column":0}}]},"13":{"line":134,"type":"binary-expr","locations":[{"start":{"line":134,"column":4},"end":{"line":134,"column":10}},{"start":{"line":134,"column":14},"end":{"line":134,"column":28}}]},"14":{"line":136,"type":"if","locations":[{"start":{"line":136,"column":7},"end":{"line":136,"column":7}},{"start":{"line":136,"column":7},"end":{"line":136,"column":7}}]},"15":{"line":136,"type":"binary-expr","locations":[{"start":{"line":136,"column":11},"end":{"line":136,"column":17}},{"start":{"line":136,"column":21},"end":{"line":136,"column":31}}]},"16":{"line":144,"type":"binary-expr","locations":[{"start":{"line":144,"column":2},"end":{"line":144,"column":29}},{"start":{"line":144,"column":33},"end":{"line":144,"column":39}}]},"17":{"line":145,"type":"binary-expr","locations":[{"start":{"line":145,"column":2},"end":{"line":145,"column":31}},{"start":{"line":145,"column":35},"end":{"line":145,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/tychei.js":{"path":"/home/davidbau/git/seedrandom/lib/tychei.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105195,"6":4105195,"7":4105195,"8":4105195,"9":4105195,"10":4105195,"11":4105195,"12":4105195,"13":4105195,"14":3,"15":3,"16":3,"17":3,"18":3,"19":2,"20":2,"21":1,"22":3,"23":66,"24":66,"25":1,"26":2,"27":2,"28":2,"29":2,"30":2,"31":1,"32":3,"33":4102054,"34":3,"35":1025,"36":1025,"37":1025,"38":3,"39":3,"40":3,"41":2,"42":1,"43":2,"44":1,"45":3,"46":1,"47":1,"48":0,"49":0,"50":0,"51":0},"b":{"1":[2,1],"2":[3,2],"3":[2,1],"4":[1,1],"5":[1,0],"6":[1,1],"7":[0,0],"8":[0,0],"9":[1,1],"10":[1,0]},"f":{"1":1,"2":3,"3":4105195,"4":2,"5":3,"6":4102054,"7":1025,"8":1,"9":0},"fnMap":{"1":{"name":"(anonymous_1)","line":5,"loc":{"start":{"line":5,"column":1},"end":{"line":5,"column":34}}},"2":{"name":"XorGen","line":7,"loc":{"start":{"line":7,"column":0},"end":{"line":7,"column":22}}},"3":{"name":"(anonymous_3)","line":11,"loc":{"start":{"line":11,"column":12},"end":{"line":11,"column":23}}},"4":{"name":"copy","line":60,"loc":{"start":{"line":60,"column":0},"end":{"line":60,"column":20}}},"5":{"name":"impl","line":68,"loc":{"start":{"line":68,"column":0},"end":{"line":68,"column":26}}},"6":{"name":"(anonymous_6)","line":71,"loc":{"start":{"line":71,"column":13},"end":{"line":71,"column":24}}},"7":{"name":"(anonymous_7)","line":72,"loc":{"start":{"line":72,"column":16},"end":{"line":72,"column":27}}},"8":{"name":"(anonymous_8)","line":84,"loc":{"start":{"line":84,"column":17},"end":{"line":84,"column":28}}},"9":{"name":"(anonymous_9)","line":92,"loc":{"start":{"line":92,"column":9},"end":{"line":92,"column":20}}}},"statementMap":{"1":{"start":{"line":5,"column":0},"end":{"line":101,"column":2}},"2":{"start":{"line":7,"column":0},"end":{"line":58,"column":1}},"3":{"start":{"line":8,"column":2},"end":{"line":8,"column":30}},"4":{"start":{"line":11,"column":2},"end":{"line":21,"column":4}},"5":{"start":{"line":12,"column":4},"end":{"line":12,"column":47}},"6":{"start":{"line":13,"column":4},"end":{"line":13,"column":34}},"7":{"start":{"line":14,"column":4},"end":{"line":14,"column":20}},"8":{"start":{"line":15,"column":4},"end":{"line":15,"column":34}},"9":{"start":{"line":16,"column":4},"end":{"line":16,"column":20}},"10":{"start":{"line":17,"column":4},"end":{"line":17,"column":42}},"11":{"start":{"line":18,"column":4},"end":{"line":18,"column":27}},"12":{"start":{"line":19,"column":4},"end":{"line":19,"column":38}},"13":{"start":{"line":20,"column":4},"end":{"line":20,"column":30}},"14":{"start":{"line":39,"column":2},"end":{"line":39,"column":11}},"15":{"start":{"line":40,"column":2},"end":{"line":40,"column":11}},"16":{"start":{"line":41,"column":2},"end":{"line":41,"column":24}},"17":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"18":{"start":{"line":44,"column":2},"end":{"line":51,"column":3}},"19":{"start":{"line":46,"column":4},"end":{"line":46,"column":36}},"20":{"start":{"line":47,"column":4},"end":{"line":47,"column":20}},"21":{"start":{"line":50,"column":4},"end":{"line":50,"column":20}},"22":{"start":{"line":54,"column":2},"end":{"line":57,"column":3}},"23":{"start":{"line":55,"column":4},"end":{"line":55,"column":38}},"24":{"start":{"line":56,"column":4},"end":{"line":56,"column":14}},"25":{"start":{"line":60,"column":0},"end":{"line":66,"column":1}},"26":{"start":{"line":61,"column":2},"end":{"line":61,"column":12}},"27":{"start":{"line":62,"column":2},"end":{"line":62,"column":12}},"28":{"start":{"line":63,"column":2},"end":{"line":63,"column":12}},"29":{"start":{"line":64,"column":2},"end":{"line":64,"column":12}},"30":{"start":{"line":65,"column":2},"end":{"line":65,"column":11}},"31":{"start":{"line":68,"column":0},"end":{"line":87,"column":1}},"32":{"start":{"line":69,"column":2},"end":{"line":71,"column":68}},"33":{"start":{"line":71,"column":26},"end":{"line":71,"column":65}},"34":{"start":{"line":72,"column":2},"end":{"line":79,"column":4}},"35":{"start":{"line":73,"column":4},"end":{"line":77,"column":27}},"36":{"start":{"line":74,"column":6},"end":{"line":76,"column":43}},"37":{"start":{"line":78,"column":4},"end":{"line":78,"column":18}},"38":{"start":{"line":80,"column":2},"end":{"line":80,"column":23}},"39":{"start":{"line":81,"column":2},"end":{"line":81,"column":20}},"40":{"start":{"line":82,"column":2},"end":{"line":85,"column":3}},"41":{"start":{"line":83,"column":4},"end":{"line":83,"column":51}},"42":{"start":{"line":83,"column":35},"end":{"line":83,"column":51}},"43":{"start":{"line":84,"column":4},"end":{"line":84,"column":52}},"44":{"start":{"line":84,"column":30},"end":{"line":84,"column":50}},"45":{"start":{"line":86,"column":2},"end":{"line":86,"column":14}},"46":{"start":{"line":89,"column":0},"end":{"line":95,"column":1}},"47":{"start":{"line":90,"column":2},"end":{"line":90,"column":24}},"48":{"start":{"line":91,"column":7},"end":{"line":95,"column":1}},"49":{"start":{"line":92,"column":2},"end":{"line":92,"column":38}},"50":{"start":{"line":92,"column":22},"end":{"line":92,"column":34}},"51":{"start":{"line":94,"column":2},"end":{"line":94,"column":21}}},"branchMap":{"1":{"line":44,"type":"if","locations":[{"start":{"line":44,"column":2},"end":{"line":44,"column":2}},{"start":{"line":44,"column":2},"end":{"line":44,"column":2}}]},"2":{"line":70,"type":"binary-expr","locations":[{"start":{"line":70,"column":14},"end":{"line":70,"column":18}},{"start":{"line":70,"column":22},"end":{"line":70,"column":32}}]},"3":{"line":82,"type":"if","locations":[{"start":{"line":82,"column":2},"end":{"line":82,"column":2}},{"start":{"line":82,"column":2},"end":{"line":82,"column":2}}]},"4":{"line":83,"type":"if","locations":[{"start":{"line":83,"column":4},"end":{"line":83,"column":4}},{"start":{"line":83,"column":4},"end":{"line":83,"column":4}}]},"5":{"line":89,"type":"if","locations":[{"start":{"line":89,"column":0},"end":{"line":89,"column":0}},{"start":{"line":89,"column":0},"end":{"line":89,"column":0}}]},"6":{"line":89,"type":"binary-expr","locations":[{"start":{"line":89,"column":4},"end":{"line":89,"column":10}},{"start":{"line":89,"column":14},"end":{"line":89,"column":28}}]},"7":{"line":91,"type":"if","locations":[{"start":{"line":91,"column":7},"end":{"line":91,"column":7}},{"start":{"line":91,"column":7},"end":{"line":91,"column":7}}]},"8":{"line":91,"type":"binary-expr","locations":[{"start":{"line":91,"column":11},"end":{"line":91,"column":17}},{"start":{"line":91,"column":21},"end":{"line":91,"column":31}}]},"9":{"line":99,"type":"binary-expr","locations":[{"start":{"line":99,"column":2},"end":{"line":99,"column":29}},{"start":{"line":99,"column":33},"end":{"line":99,"column":39}}]},"10":{"line":100,"type":"binary-expr","locations":[{"start":{"line":100,"column":2},"end":{"line":100,"column":31}},{"start":{"line":100,"column":35},"end":{"line":100,"column":41}}]}}},"/home/davidbau/git/seedrandom/lib/alea.js":{"path":"/home/davidbau/git/seedrandom/lib/alea.js","s":{"1":1,"2":1,"3":3,"4":3,"5":4105129,"6":4105129,"7":4105129,"8":4105129,"9":3,"10":3,"11":3,"12":3,"13":3,"14":3,"15":1,"16":3,"17":3,"18":3,"19":3,"20":3,"21":0,"22":3,"23":1,"24":2,"25":2,"26":2,"27":2,"28":2,"29":1,"30":3,"31":3,"32":1025,"33":3,"34":1025,"35":3,"36":3,"37":2,"38":1,"39":2,"40":1,"41":3,"42":1,"43":3,"44":3,"45":18,"46":18,"47":33,"48":33,"49":33,"50":33,"51":33,"52":33,"53":33,"54":33,"55":18,"56":3,"57":1,"58":1,"59":0,"60":0,"61":0,"62":0},"b":{"1":[1,2],"2":[3,0],"3":[0,3],"4":[3,2],"5":[2,1],"6":[1,1],"7":[1,0],"8":[1,1],"9":[0,0],"10":[0,0],"11":[1,1],"12":[1,0]},"f":{"1":1,"2":3,"3":4105129,"4":2,"5":3,"6":1025,"7":1025,"8":1,"9":3,"10":18,"11":0},"fnMap":{"1":{"name":"(anonymous_1)","line":28,"loc":{"start":{"line":28,"column":1},"end":{"line":28,"column":34}}},"2":{"name":"Alea","line":30,"loc":{"start":{"line":30,"column":0},"end":{"line":30,"column":20}}},"3":{"name":"(anonymous_3)","line":33,"loc":{"start":{"line":33,"column":12},"end":{"line":33,"column":23}}},"4":{"name":"copy","line":54,"loc":{"start":{"line":54,"column":0},"end":{"line":54,"column":20}}},"5":{"name":"impl","line":62,"loc":{"start":{"line":62,"column":0},"end":{"line":62,"column":26}}},"6":{"name":"(anonymous_6)","line":66,"loc":{"start":{"line":66,"column":15},"end":{"line":66,"column":26}}},"7":{"name":"(anonymous_7)","line":67,"loc":{"start":{"line":67,"column":16},"end":{"line":67,"column":27}}},"8":{"name":"(anonymous_8)","line":73,"loc":{"start":{"line":73,"column":17},"end":{"line":73,"column":28}}},"9":{"name":"Mash","line":78,"loc":{"start":{"line":78,"column":0},"end":{"line":78,"column":16}}},"10":{"name":"(anonymous_10)","line":81,"loc":{"start":{"line":81,"column":13},"end":{"line":81,"column":28}}},"11":{"name":"(anonymous_11)","line":103,"loc":{"start":{"line":103,"column":9},"end":{"line":103,"column":20}}}},"statementMap":{"1":{"start":{"line":28,"column":0},"end":{"line":112,"column":2}},"2":{"start":{"line":30,"column":0},"end":{"line":52,"column":1}},"3":{"start":{"line":31,"column":2},"end":{"line":31,"column":31}},"4":{"start":{"line":33,"column":2},"end":{"line":38,"column":4}},"5":{"start":{"line":34,"column":4},"end":{"line":34,"column":60}},"6":{"start":{"line":35,"column":4},"end":{"line":35,"column":18}},"7":{"start":{"line":36,"column":4},"end":{"line":36,"column":18}},"8":{"start":{"line":37,"column":4},"end":{"line":37,"column":38}},"9":{"start":{"line":41,"column":2},"end":{"line":41,"column":11}},"10":{"start":{"line":42,"column":2},"end":{"line":42,"column":20}},"11":{"start":{"line":43,"column":2},"end":{"line":43,"column":20}},"12":{"start":{"line":44,"column":2},"end":{"line":44,"column":20}},"13":{"start":{"line":45,"column":2},"end":{"line":45,"column":22}},"14":{"start":{"line":46,"column":2},"end":{"line":46,"column":32}},"15":{"start":{"line":46,"column":19},"end":{"line":46,"column":30}},"16":{"start":{"line":47,"column":2},"end":{"line":47,"column":22}},"17":{"start":{"line":48,"column":2},"end":{"line":48,"column":32}},"18":{"start":{"line":48,"column":19},"end":{"line":48,"column":30}},"19":{"start":{"line":49,"column":2},"end":{"line":49,"column":22}},"20":{"start":{"line":50,"column":2},"end":{"line":50,"column":32}},"21":{"start":{"line":50,"column":19},"end":{"line":50,"column":30}},"22":{"start":{"line":51,"column":2},"end":{"line":51,"column":14}},"23":{"start":{"line":54,"column":0},"end":{"line":60,"column":1}},"24":{"start":{"line":55,"column":2},"end":{"line":55,"column":12}},"25":{"start":{"line":56,"column":2},"end":{"line":56,"column":14}},"26":{"start":{"line":57,"column":2},"end":{"line":57,"column":14}},"27":{"start":{"line":58,"column":2},"end":{"line":58,"column":14}},"28":{"start":{"line":59,"column":2},"end":{"line":59,"column":11}},"29":{"start":{"line":62,"column":0},"end":{"line":76,"column":1}},"30":{"start":{"line":63,"column":2},"end":{"line":65,"column":21}},"31":{"start":{"line":66,"column":2},"end":{"line":66,"column":67}},"32":{"start":{"line":66,"column":28},"end":{"line":66,"column":65}},"33":{"start":{"line":67,"column":2},"end":{"line":69,"column":4}},"34":{"start":{"line":68,"column":4},"end":{"line":68,"column":69}},"35":{"start":{"line":70,"column":2},"end":{"line":70,"column":20}},"36":{"start":{"line":71,"column":2},"end":{"line":74,"column":3}},"37":{"start":{"line":72,"column":4},"end":{"line":72,"column":51}},"38":{"start":{"line":72,"column":35},"end":{"line":72,"column":51}},"39":{"start":{"line":73,"column":4},"end":{"line":73,"column":52}},"40":{"start":{"line":73,"column":30},"end":{"line":73,"column":50}},"41":{"start":{"line":75,"column":2},"end":{"line":75,"column":14}},"42":{"start":{"line":78,"column":0},"end":{"line":97,"column":1}},"43":{"start":{"line":79,"column":2},"end":{"line":79,"column":21}},"44":{"start":{"line":81,"column":2},"end":{"line":94,"column":4}},"45":{"start":{"line":82,"column":4},"end":{"line":82,"column":24}},"46":{"start":{"line":83,"column":4},"end":{"line":92,"column":5}},"47":{"start":{"line":84,"column":6},"end":{"line":84,"column":30}},"48":{"start":{"line":85,"column":6},"end":{"line":85,"column":38}},"49":{"start":{"line":86,"column":6},"end":{"line":86,"column":18}},"50":{"start":{"line":87,"column":6},"end":{"line":87,"column":13}},"51":{"start":{"line":88,"column":6},"end":{"line":88,"column":13}},"52":{"start":{"line":89,"column":6},"end":{"line":89,"column":18}},"53":{"start":{"line":90,"column":6},"end":{"line":90,"column":13}},"54":{"start":{"line":91,"column":6},"end":{"line":91,"column":27}},"55":{"start":{"line":93,"column":4},"end":{"line":93,"column":46}},"56":{"start":{"line":96,"column":2},"end":{"line":96,"column":14}},"57":{"start":{"line":100,"column":0},"end":{"line":106,"column":1}},"58":{"start":{"line":101,"column":2},"end":{"line":101,"column":24}},"59":{"start":{"line":102,"column":7},"end":{"line":106,"column":1}},"60":{"start":{"line":103,"column":2},"end":{"line":103,"column":38}},"61":{"start":{"line":103,"column":22},"end":{"line":103,"column":34}},"62":{"start":{"line":105,"column":2},"end":{"line":105,"column":19}}},"branchMap":{"1":{"line":46,"type":"if","locations":[{"start":{"line":46,"column":2},"end":{"line":46,"column":2}},{"start":{"line":46,"column":2},"end":{"line":46,"column":2}}]},"2":{"line":48,"type":"if","locations":[{"start":{"line":48,"column":2},"end":{"line":48,"column":2}},{"start":{"line":48,"column":2},"end":{"line":48,"column":2}}]},"3":{"line":50,"type":"if","locations":[{"start":{"line":50,"column":2},"end":{"line":50,"column":2}},{"start":{"line":50,"column":2},"end":{"line":50,"column":2}}]},"4":{"line":64,"type":"binary-expr","locations":[{"start":{"line":64,"column":14},"end":{"line":64,"column":18}},{"start":{"line":64,"column":22},"end":{"line":64,"column":32}}]},"5":{"line":71,"type":"if","locations":[{"start":{"line":71,"column":2},"end":{"line":71,"column":2}},{"start":{"line":71,"column":2},"end":{"line":71,"column":2}}]},"6":{"line":72,"type":"if","locations":[{"start":{"line":72,"column":4},"end":{"line":72,"column":4}},{"start":{"line":72,"column":4},"end":{"line":72,"column":4}}]},"7":{"line":100,"type":"if","locations":[{"start":{"line":100,"column":0},"end":{"line":100,"column":0}},{"start":{"line":100,"column":0},"end":{"line":100,"column":0}}]},"8":{"line":100,"type":"binary-expr","locations":[{"start":{"line":100,"column":4},"end":{"line":100,"column":10}},{"start":{"line":100,"column":14},"end":{"line":100,"column":28}}]},"9":{"line":102,"type":"if","locations":[{"start":{"line":102,"column":7},"end":{"line":102,"column":7}},{"start":{"line":102,"column":7},"end":{"line":102,"column":7}}]},"10":{"line":102,"type":"binary-expr","locations":[{"start":{"line":102,"column":11},"end":{"line":102,"column":17}},{"start":{"line":102,"column":21},"end":{"line":102,"column":31}}]},"11":{"line":110,"type":"binary-expr","locations":[{"start":{"line":110,"column":2},"end":{"line":110,"column":29}},{"start":{"line":110,"column":33},"end":{"line":110,"column":39}}]},"12":{"line":111,"type":"binary-expr","locations":[{"start":{"line":111,"column":2},"end":{"line":111,"column":31}},{"start":{"line":111,"column":35},"end":{"line":111,"column":41}}]}}}}
\ No newline at end of file
diff --git a/node_modules/seedrandom/coverage/lcov-report/base.css b/node_modules/seedrandom/coverage/lcov-report/base.css
new file mode 100644
index 0000000..f418035
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/base.css
@@ -0,0 +1,224 @@
+body, html {
+  margin:0; padding: 0;
+  height: 100%;
+}
+body {
+    font-family: Helvetica Neue, Helvetica, Arial;
+    font-size: 14px;
+    color:#333;
+}
+.small { font-size: 12px; }
+*, *:after, *:before {
+  -webkit-box-sizing:border-box;
+     -moz-box-sizing:border-box;
+          box-sizing:border-box;
+  }
+h1 { font-size: 20px; margin: 0;}
+h2 { font-size: 14px; }
+pre {
+    font: 12px/1.4 Consolas, "Liberation Mono", Menlo, Courier, monospace;
+    margin: 0;
+    padding: 0;
+    -moz-tab-size: 2;
+    -o-tab-size:  2;
+    tab-size: 2;
+}
+a { color:#0074D9; text-decoration:none; }
+a:hover { text-decoration:underline; }
+.strong { font-weight: bold; }
+.space-top1 { padding: 10px 0 0 0; }
+.pad2y { padding: 20px 0; }
+.pad1y { padding: 10px 0; }
+.pad2x { padding: 0 20px; }
+.pad2 { padding: 20px; }
+.pad1 { padding: 10px; }
+.space-left2 { padding-left:55px; }
+.space-right2 { padding-right:20px; }
+.center { text-align:center; }
+.clearfix { display:block; }
+.clearfix:after {
+  content:'';
+  display:block;
+  height:0;
+  clear:both;
+  visibility:hidden;
+  }
+.fl { float: left; }
+@media only screen and (max-width:640px) {
+  .col3 { width:100%; max-width:100%; }
+  .hide-mobile { display:none!important; }
+}
+
+.quiet {
+  color: #7f7f7f;
+  color: rgba(0,0,0,0.5);
+}
+.quiet a { opacity: 0.7; }
+
+.fraction {
+  font-family: Consolas, 'Liberation Mono', Menlo, Courier, monospace;
+  font-size: 10px;
+  color: #555;
+  background: #E8E8E8;
+  padding: 4px 5px;
+  border-radius: 3px;
+  vertical-align: middle;
+}
+
+div.path a:link, div.path a:visited { color: #333; }
+table.coverage {
+  border-collapse: collapse;
+  margin: 10px 0 0 0;
+  padding: 0;
+}
+
+table.coverage td {
+  margin: 0;
+  padding: 0;
+  vertical-align: top;
+}
+table.coverage td.line-count {
+    text-align: right;
+    padding: 0 5px 0 20px;
+}
+table.coverage td.line-coverage {
+    text-align: right;
+    padding-right: 10px;
+    min-width:20px;
+}
+
+table.coverage td span.cline-any {
+    display: inline-block;
+    padding: 0 5px;
+    width: 100%;
+}
+.missing-if-branch {
+    display: inline-block;
+    margin-right: 5px;
+    border-radius: 3px;
+    position: relative;
+    padding: 0 4px;
+    background: #333;
+    color: yellow;
+}
+
+.skip-if-branch {
+    display: none;
+    margin-right: 10px;
+    position: relative;
+    padding: 0 4px;
+    background: #ccc;
+    color: white;
+}
+.missing-if-branch .typ, .skip-if-branch .typ {
+    color: inherit !important;
+}
+.coverage-summary {
+  border-collapse: collapse;
+  width: 100%;
+}
+.coverage-summary tr { border-bottom: 1px solid #bbb; }
+.keyline-all { border: 1px solid #ddd; }
+.coverage-summary td, .coverage-summary th { padding: 10px; }
+.coverage-summary tbody { border: 1px solid #bbb; }
+.coverage-summary td { border-right: 1px solid #bbb; }
+.coverage-summary td:last-child { border-right: none; }
+.coverage-summary th {
+  text-align: left;
+  font-weight: normal;
+  white-space: nowrap;
+}
+.coverage-summary th.file { border-right: none !important; }
+.coverage-summary th.pct { }
+.coverage-summary th.pic,
+.coverage-summary th.abs,
+.coverage-summary td.pct,
+.coverage-summary td.abs { text-align: right; }
+.coverage-summary td.file { white-space: nowrap;  }
+.coverage-summary td.pic { min-width: 120px !important;  }
+.coverage-summary tfoot td { }
+
+.coverage-summary .sorter {
+    height: 10px;
+    width: 7px;
+    display: inline-block;
+    margin-left: 0.5em;
+    background: url(sort-arrow-sprite.png) no-repeat scroll 0 0 transparent;
+}
+.coverage-summary .sorted .sorter {
+    background-position: 0 -20px;
+}
+.coverage-summary .sorted-desc .sorter {
+    background-position: 0 -10px;
+}
+.status-line {  height: 10px; }
+/* yellow */
+.cbranch-no { background: yellow !important; color: #111; }
+/* dark red */
+.red.solid, .status-line.low, .low .cover-fill { background:#C21F39 }
+.low .chart { border:1px solid #C21F39 }
+.highlighted,
+.highlighted .cstat-no, .highlighted .fstat-no, .highlighted .cbranch-no{
+  background: #C21F39 !important;
+}
+/* medium red */
+.cstat-no, .fstat-no, .cbranch-no, .cbranch-no { background:#F6C6CE }
+/* light red */
+.low, .cline-no { background:#FCE1E5 }
+/* light green */
+.high, .cline-yes { background:rgb(230,245,208) }
+/* medium green */
+.cstat-yes { background:rgb(161,215,106) }
+/* dark green */
+.status-line.high, .high .cover-fill { background:rgb(77,146,33) }
+.high .chart { border:1px solid rgb(77,146,33) }
+/* dark yellow (gold) */
+.status-line.medium, .medium .cover-fill { background: #f9cd0b; }
+.medium .chart { border:1px solid #f9cd0b; }
+/* light yellow */
+.medium { background: #fff4c2; }
+
+.cstat-skip { background: #ddd; color: #111; }
+.fstat-skip { background: #ddd; color: #111 !important; }
+.cbranch-skip { background: #ddd !important; color: #111; }
+
+span.cline-neutral { background: #eaeaea; }
+
+.coverage-summary td.empty {
+    opacity: .5;
+    padding-top: 4px;
+    padding-bottom: 4px;
+    line-height: 1;
+    color: #888;
+}
+
+.cover-fill, .cover-empty {
+  display:inline-block;
+  height: 12px;
+}
+.chart {
+  line-height: 0;
+}
+.cover-empty {
+    background: white;
+}
+.cover-full {
+    border-right: none !important;
+}
+pre.prettyprint {
+    border: none !important;
+    padding: 0 !important;
+    margin: 0 !important;
+}
+.com { color: #999 !important; }
+.ignore-none { color: #999; font-weight: normal; }
+
+.wrapper {
+  min-height: 100%;
+  height: auto !important;
+  height: 100%;
+  margin: 0 auto -48px;
+}
+.footer, .push {
+  height: 48px;
+}
diff --git a/node_modules/seedrandom/coverage/lcov-report/block-navigation.js b/node_modules/seedrandom/coverage/lcov-report/block-navigation.js
new file mode 100644
index 0000000..c7ff5a5
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/block-navigation.js
@@ -0,0 +1,79 @@
+/* eslint-disable */
+var jumpToCode = (function init() {
+    // Classes of code we would like to highlight in the file view
+    var missingCoverageClasses = ['.cbranch-no', '.cstat-no', '.fstat-no'];
+
+    // Elements to highlight in the file listing view
+    var fileListingElements = ['td.pct.low'];
+
+    // We don't want to select elements that are direct descendants of another match
+    var notSelector = ':not(' + missingCoverageClasses.join('):not(') + ') > '; // becomes `:not(a):not(b) > `
+
+    // Selecter that finds elements on the page to which we can jump
+    var selector =
+        fileListingElements.join(', ') +
+        ', ' +
+        notSelector +
+        missingCoverageClasses.join(', ' + notSelector); // becomes `:not(a):not(b) > a, :not(a):not(b) > b`
+
+    // The NodeList of matching elements
+    var missingCoverageElements = document.querySelectorAll(selector);
+
+    var currentIndex;
+
+    function toggleClass(index) {
+        missingCoverageElements
+            .item(currentIndex)
+            .classList.remove('highlighted');
+        missingCoverageElements.item(index).classList.add('highlighted');
+    }
+
+    function makeCurrent(index) {
+        toggleClass(index);
+        currentIndex = index;
+        missingCoverageElements.item(index).scrollIntoView({
+            behavior: 'smooth',
+            block: 'center',
+            inline: 'center'
+        });
+    }
+
+    function goToPrevious() {
+        var nextIndex = 0;
+        if (typeof currentIndex !== 'number' || currentIndex === 0) {
+            nextIndex = missingCoverageElements.length - 1;
+        } else if (missingCoverageElements.length > 1) {
+            nextIndex = currentIndex - 1;
+        }
+
+        makeCurrent(nextIndex);
+    }
+
+    function goToNext() {
+        var nextIndex = 0;
+
+        if (
+            typeof currentIndex === 'number' &&
+            currentIndex < missingCoverageElements.length - 1
+        ) {
+            nextIndex = currentIndex + 1;
+        }
+
+        makeCurrent(nextIndex);
+    }
+
+    return function jump(event) {
+        switch (event.which) {
+            case 78: // n
+            case 74: // j
+                goToNext();
+                break;
+            case 66: // b
+            case 75: // k
+            case 80: // p
+                goToPrevious();
+                break;
+        }
+    };
+})();
+window.addEventListener('keydown', jumpToCode);
diff --git a/node_modules/seedrandom/coverage/lcov-report/index.html b/node_modules/seedrandom/coverage/lcov-report/index.html
new file mode 100644
index 0000000..6109d95
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/index.html
@@ -0,0 +1,110 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for All files</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="prettify.css" />
+    <link rel="stylesheet" href="base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      All files
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.21% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>439/471</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">73.2% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>142/194</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90.41% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>66/73</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.44% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>374/396</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="seedrandom"><a href="seedrandom/index.html">seedrandom</a></td>
+	<td data-value="96" class="pic high"><div class="chart"><div class="cover-fill" style="width: 96%;"></div><div class="cover-empty" style="width:4%;"></div></div></td>
+	<td data-value="96" class="pct high">96%</td>
+	<td data-value="100" class="abs high">96/100</td>
+	<td data-value="85.11" class="pct high">85.11%</td>
+	<td data-value="47" class="abs high">40/47</td>
+	<td data-value="93.33" class="pct high">93.33%</td>
+	<td data-value="15" class="abs high">14/15</td>
+	<td data-value="96.39" class="pct high">96.39%</td>
+	<td data-value="83" class="abs high">80/83</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="seedrandom/lib"><a href="seedrandom/lib/index.html">seedrandom/lib</a></td>
+	<td data-value="92.45" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.45" class="pct high">92.45%</td>
+	<td data-value="371" class="abs high">343/371</td>
+	<td data-value="69.39" class="pct medium">69.39%</td>
+	<td data-value="147" class="abs medium">102/147</td>
+	<td data-value="89.66" class="pct high">89.66%</td>
+	<td data-value="58" class="abs high">52/58</td>
+	<td data-value="93.93" class="pct high">93.93%</td>
+	<td data-value="313" class="abs high">294/313</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="sorter.js"></script>
+<script src="block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/prettify.css b/node_modules/seedrandom/coverage/lcov-report/prettify.css
new file mode 100644
index 0000000..b317a7c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/prettify.css
@@ -0,0 +1 @@
+.pln{color:#000}@media screen{.str{color:#080}.kwd{color:#008}.com{color:#800}.typ{color:#606}.lit{color:#066}.pun,.opn,.clo{color:#660}.tag{color:#008}.atn{color:#606}.atv{color:#080}.dec,.var{color:#606}.fun{color:red}}@media print,projection{.str{color:#060}.kwd{color:#006;font-weight:bold}.com{color:#600;font-style:italic}.typ{color:#404;font-weight:bold}.lit{color:#044}.pun,.opn,.clo{color:#440}.tag{color:#006;font-weight:bold}.atn{color:#404}.atv{color:#060}}pre.prettyprint{padding:2px;border:1px solid #888}ol.linenums{margin-top:0;margin-bottom:0}li.L0,li.L1,li.L2,li.L3,li.L5,li.L6,li.L7,li.L8{list-style-type:none}li.L1,li.L3,li.L5,li.L7,li.L9{background:#eee}
diff --git a/node_modules/seedrandom/coverage/lcov-report/prettify.js b/node_modules/seedrandom/coverage/lcov-report/prettify.js
new file mode 100644
index 0000000..b322523
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/prettify.js
@@ -0,0 +1,2 @@
+/* eslint-disable */
+window.PR_SHOULD_USE_CONTINUATION=true;(function(){var h=["break,continue,do,else,for,if,return,while"];var u=[h,"auto,case,char,const,default,double,enum,extern,float,goto,int,long,register,short,signed,sizeof,static,struct,switch,typedef,union,unsigned,void,volatile"];var p=[u,"catch,class,delete,false,import,new,operator,private,protected,public,this,throw,true,try,typeof"];var l=[p,"alignof,align_union,asm,axiom,bool,concept,concept_map,const_cast,constexpr,decltype,dynamic_cast,explicit,export,friend,inline,late_check,mutable,namespace,nullptr,reinterpret_cast,static_assert,static_cast,template,typeid,typename,using,virtual,where"];var x=[p,"abstract,boolean,byte,extends,final,finally,implements,import,instanceof,null,native,package,strictfp,super,synchronized,throws,transient"];var R=[x,"as,base,by,checked,decimal,delegate,descending,dynamic,event,fixed,foreach,from,group,implicit,in,interface,internal,into,is,lock,object,out,override,orderby,params,partial,readonly,ref,sbyte,sealed,stackalloc,string,select,uint,ulong,unchecked,unsafe,ushort,var"];var r="all,and,by,catch,class,else,extends,false,finally,for,if,in,is,isnt,loop,new,no,not,null,of,off,on,or,return,super,then,true,try,unless,until,when,while,yes";var w=[p,"debugger,eval,export,function,get,null,set,undefined,var,with,Infinity,NaN"];var s="caller,delete,die,do,dump,elsif,eval,exit,foreach,for,goto,if,import,last,local,my,next,no,our,print,package,redo,require,sub,undef,unless,until,use,wantarray,while,BEGIN,END";var I=[h,"and,as,assert,class,def,del,elif,except,exec,finally,from,global,import,in,is,lambda,nonlocal,not,or,pass,print,raise,try,with,yield,False,True,None"];var f=[h,"alias,and,begin,case,class,def,defined,elsif,end,ensure,false,in,module,next,nil,not,or,redo,rescue,retry,self,super,then,true,undef,unless,until,when,yield,BEGIN,END"];var H=[h,"case,done,elif,esac,eval,fi,function,in,local,set,then,until"];var A=[l,R,w,s+I,f,H];var e=/^(DIR|FILE|vector|(de|priority_)?queue|list|stack|(const_)?iterator|(multi)?(set|map)|bitset|u?(int|float)\d*)/;var C="str";var z="kwd";var j="com";var O="typ";var G="lit";var L="pun";var F="pln";var m="tag";var E="dec";var J="src";var P="atn";var n="atv";var N="nocode";var M="(?:^^\\.?|[+-]|\\!|\\!=|\\!==|\\#|\\%|\\%=|&|&&|&&=|&=|\\(|\\*|\\*=|\\+=|\\,|\\-=|\\->|\\/|\\/=|:|::|\\;|<|<<|<<=|<=|=|==|===|>|>=|>>|>>=|>>>|>>>=|\\?|\\@|\\[|\\^|\\^=|\\^\\^|\\^\\^=|\\{|\\||\\|=|\\|\\||\\|\\|=|\\~|break|case|continue|delete|do|else|finally|instanceof|return|throw|try|typeof)\\s*";function k(Z){var ad=0;var S=false;var ac=false;for(var V=0,U=Z.length;V<U;++V){var ae=Z[V];if(ae.ignoreCase){ac=true}else{if(/[a-z]/i.test(ae.source.replace(/\\u[0-9a-f]{4}|\\x[0-9a-f]{2}|\\[^ux]/gi,""))){S=true;ac=false;break}}}var Y={b:8,t:9,n:10,v:11,f:12,r:13};function ab(ah){var ag=ah.charCodeAt(0);if(ag!==92){return ag}var af=ah.charAt(1);ag=Y[af];if(ag){return ag}else{if("0"<=af&&af<="7"){return parseInt(ah.substring(1),8)}else{if(af==="u"||af==="x"){return parseInt(ah.substring(2),16)}else{return ah.charCodeAt(1)}}}}function T(af){if(af<32){return(af<16?"\\x0":"\\x")+af.toString(16)}var ag=String.fromCharCode(af);if(ag==="\\"||ag==="-"||ag==="["||ag==="]"){ag="\\"+ag}return ag}function X(am){var aq=am.substring(1,am.length-1).match(new RegExp("\\\\u[0-9A-Fa-f]{4}|\\\\x[0-9A-Fa-f]{2}|\\\\[0-3][0-7]{0,2}|\\\\[0-7]{1,2}|\\\\[\\s\\S]|-|[^-\\\\]","g"));var ak=[];var af=[];var ao=aq[0]==="^";for(var ar=ao?1:0,aj=aq.length;ar<aj;++ar){var ah=aq[ar];if(/\\[bdsw]/i.test(ah)){ak.push(ah)}else{var ag=ab(ah);var al;if(ar+2<aj&&"-"===aq[ar+1]){al=ab(aq[ar+2]);ar+=2}else{al=ag}af.push([ag,al]);if(!(al<65||ag>122)){if(!(al<65||ag>90)){af.push([Math.max(65,ag)|32,Math.min(al,90)|32])}if(!(al<97||ag>122)){af.push([Math.max(97,ag)&~32,Math.min(al,122)&~32])}}}}af.sort(function(av,au){return(av[0]-au[0])||(au[1]-av[1])});var ai=[];var ap=[NaN,NaN];for(var ar=0;ar<af.length;++ar){var at=af[ar];if(at[0]<=ap[1]+1){ap[1]=Math.max(ap[1],at[1])}else{ai.push(ap=at)}}var an=["["];if(ao){an.push("^")}an.push.apply(an,ak);for(var ar=0;ar<ai.length;++ar){var at=ai[ar];an.push(T(at[0]));if(at[1]>at[0]){if(at[1]+1>at[0]){an.push("-")}an.push(T(at[1]))}}an.push("]");return an.join("")}function W(al){var aj=al.source.match(new RegExp("(?:\\[(?:[^\\x5C\\x5D]|\\\\[\\s\\S])*\\]|\\\\u[A-Fa-f0-9]{4}|\\\\x[A-Fa-f0-9]{2}|\\\\[0-9]+|\\\\[^ux0-9]|\\(\\?[:!=]|[\\(\\)\\^]|[^\\x5B\\x5C\\(\\)\\^]+)","g"));var ah=aj.length;var an=[];for(var ak=0,am=0;ak<ah;++ak){var ag=aj[ak];if(ag==="("){++am}else{if("\\"===ag.charAt(0)){var af=+ag.substring(1);if(af&&af<=am){an[af]=-1}}}}for(var ak=1;ak<an.length;++ak){if(-1===an[ak]){an[ak]=++ad}}for(var ak=0,am=0;ak<ah;++ak){var ag=aj[ak];if(ag==="("){++am;if(an[am]===undefined){aj[ak]="(?:"}}else{if("\\"===ag.charAt(0)){var af=+ag.substring(1);if(af&&af<=am){aj[ak]="\\"+an[am]}}}}for(var ak=0,am=0;ak<ah;++ak){if("^"===aj[ak]&&"^"!==aj[ak+1]){aj[ak]=""}}if(al.ignoreCase&&S){for(var ak=0;ak<ah;++ak){var ag=aj[ak];var ai=ag.charAt(0);if(ag.length>=2&&ai==="["){aj[ak]=X(ag)}else{if(ai!=="\\"){aj[ak]=ag.replace(/[a-zA-Z]/g,function(ao){var ap=ao.charCodeAt(0);return"["+String.fromCharCode(ap&~32,ap|32)+"]"})}}}}return aj.join("")}var aa=[];for(var V=0,U=Z.length;V<U;++V){var ae=Z[V];if(ae.global||ae.multiline){throw new Error(""+ae)}aa.push("(?:"+W(ae)+")")}return new RegExp(aa.join("|"),ac?"gi":"g")}function a(V){var U=/(?:^|\s)nocode(?:\s|$)/;var X=[];var T=0;var Z=[];var W=0;var S;if(V.currentStyle){S=V.currentStyle.whiteSpace}else{if(window.getComputedStyle){S=document.defaultView.getComputedStyle(V,null).getPropertyValue("white-space")}}var Y=S&&"pre"===S.substring(0,3);function aa(ab){switch(ab.nodeType){case 1:if(U.test(ab.className)){return}for(var ae=ab.firstChild;ae;ae=ae.nextSibling){aa(ae)}var ad=ab.nodeName;if("BR"===ad||"LI"===ad){X[W]="\n";Z[W<<1]=T++;Z[(W++<<1)|1]=ab}break;case 3:case 4:var ac=ab.nodeValue;if(ac.length){if(!Y){ac=ac.replace(/[ \t\r\n]+/g," ")}else{ac=ac.replace(/\r\n?/g,"\n")}X[W]=ac;Z[W<<1]=T;T+=ac.length;Z[(W++<<1)|1]=ab}break}}aa(V);return{sourceCode:X.join("").replace(/\n$/,""),spans:Z}}function B(S,U,W,T){if(!U){return}var V={sourceCode:U,basePos:S};W(V);T.push.apply(T,V.decorations)}var v=/\S/;function o(S){var V=undefined;for(var U=S.firstChild;U;U=U.nextSibling){var T=U.nodeType;V=(T===1)?(V?S:U):(T===3)?(v.test(U.nodeValue)?S:V):V}return V===S?undefined:V}function g(U,T){var S={};var V;(function(){var ad=U.concat(T);var ah=[];var ag={};for(var ab=0,Z=ad.length;ab<Z;++ab){var Y=ad[ab];var ac=Y[3];if(ac){for(var ae=ac.length;--ae>=0;){S[ac.charAt(ae)]=Y}}var af=Y[1];var aa=""+af;if(!ag.hasOwnProperty(aa)){ah.push(af);ag[aa]=null}}ah.push(/[\0-\uffff]/);V=k(ah)})();var X=T.length;var W=function(ah){var Z=ah.sourceCode,Y=ah.basePos;var ad=[Y,F];var af=0;var an=Z.match(V)||[];var aj={};for(var ae=0,aq=an.length;ae<aq;++ae){var ag=an[ae];var ap=aj[ag];var ai=void 0;var am;if(typeof ap==="string"){am=false}else{var aa=S[ag.charAt(0)];if(aa){ai=ag.match(aa[1]);ap=aa[0]}else{for(var ao=0;ao<X;++ao){aa=T[ao];ai=ag.match(aa[1]);if(ai){ap=aa[0];break}}if(!ai){ap=F}}am=ap.length>=5&&"lang-"===ap.substring(0,5);if(am&&!(ai&&typeof ai[1]==="string")){am=false;ap=J}if(!am){aj[ag]=ap}}var ab=af;af+=ag.length;if(!am){ad.push(Y+ab,ap)}else{var al=ai[1];var ak=ag.indexOf(al);var ac=ak+al.length;if(ai[2]){ac=ag.length-ai[2].length;ak=ac-al.length}var ar=ap.substring(5);B(Y+ab,ag.substring(0,ak),W,ad);B(Y+ab+ak,al,q(ar,al),ad);B(Y+ab+ac,ag.substring(ac),W,ad)}}ah.decorations=ad};return W}function i(T){var W=[],S=[];if(T.tripleQuotedStrings){W.push([C,/^(?:\'\'\'(?:[^\'\\]|\\[\s\S]|\'{1,2}(?=[^\']))*(?:\'\'\'|$)|\"\"\"(?:[^\"\\]|\\[\s\S]|\"{1,2}(?=[^\"]))*(?:\"\"\"|$)|\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$))/,null,"'\""])}else{if(T.multiLineStrings){W.push([C,/^(?:\'(?:[^\\\']|\\[\s\S])*(?:\'|$)|\"(?:[^\\\"]|\\[\s\S])*(?:\"|$)|\`(?:[^\\\`]|\\[\s\S])*(?:\`|$))/,null,"'\"`"])}else{W.push([C,/^(?:\'(?:[^\\\'\r\n]|\\.)*(?:\'|$)|\"(?:[^\\\"\r\n]|\\.)*(?:\"|$))/,null,"\"'"])}}if(T.verbatimStrings){S.push([C,/^@\"(?:[^\"]|\"\")*(?:\"|$)/,null])}var Y=T.hashComments;if(Y){if(T.cStyleComments){if(Y>1){W.push([j,/^#(?:##(?:[^#]|#(?!##))*(?:###|$)|.*)/,null,"#"])}else{W.push([j,/^#(?:(?:define|elif|else|endif|error|ifdef|include|ifndef|line|pragma|undef|warning)\b|[^\r\n]*)/,null,"#"])}S.push([C,/^<(?:(?:(?:\.\.\/)*|\/?)(?:[\w-]+(?:\/[\w-]+)+)?[\w-]+\.h|[a-z]\w*)>/,null])}else{W.push([j,/^#[^\r\n]*/,null,"#"])}}if(T.cStyleComments){S.push([j,/^\/\/[^\r\n]*/,null]);S.push([j,/^\/\*[\s\S]*?(?:\*\/|$)/,null])}if(T.regexLiterals){var X=("/(?=[^/*])(?:[^/\\x5B\\x5C]|\\x5C[\\s\\S]|\\x5B(?:[^\\x5C\\x5D]|\\x5C[\\s\\S])*(?:\\x5D|$))+/");S.push(["lang-regex",new RegExp("^"+M+"("+X+")")])}var V=T.types;if(V){S.push([O,V])}var U=(""+T.keywords).replace(/^ | $/g,"");if(U.length){S.push([z,new RegExp("^(?:"+U.replace(/[\s,]+/g,"|")+")\\b"),null])}W.push([F,/^\s+/,null," \r\n\t\xA0"]);S.push([G,/^@[a-z_$][a-z_$@0-9]*/i,null],[O,/^(?:[@_]?[A-Z]+[a-z][A-Za-z_$@0-9]*|\w+_t\b)/,null],[F,/^[a-z_$][a-z_$@0-9]*/i,null],[G,new RegExp("^(?:0x[a-f0-9]+|(?:\\d(?:_\\d+)*\\d*(?:\\.\\d*)?|\\.\\d\\+)(?:e[+\\-]?\\d+)?)[a-z]*","i"),null,"0123456789"],[F,/^\\[\s\S]?/,null],[L,/^.[^\s\w\.$@\'\"\`\/\#\\]*/,null]);return g(W,S)}var K=i({keywords:A,hashComments:true,cStyleComments:true,multiLineStrings:true,regexLiterals:true});function Q(V,ag){var U=/(?:^|\s)nocode(?:\s|$)/;var ab=/\r\n?|\n/;var ac=V.ownerDocument;var S;if(V.currentStyle){S=V.currentStyle.whiteSpace}else{if(window.getComputedStyle){S=ac.defaultView.getComputedStyle(V,null).getPropertyValue("white-space")}}var Z=S&&"pre"===S.substring(0,3);var af=ac.createElement("LI");while(V.firstChild){af.appendChild(V.firstChild)}var W=[af];function ae(al){switch(al.nodeType){case 1:if(U.test(al.className)){break}if("BR"===al.nodeName){ad(al);if(al.parentNode){al.parentNode.removeChild(al)}}else{for(var an=al.firstChild;an;an=an.nextSibling){ae(an)}}break;case 3:case 4:if(Z){var am=al.nodeValue;var aj=am.match(ab);if(aj){var ai=am.substring(0,aj.index);al.nodeValue=ai;var ah=am.substring(aj.index+aj[0].length);if(ah){var ak=al.parentNode;ak.insertBefore(ac.createTextNode(ah),al.nextSibling)}ad(al);if(!ai){al.parentNode.removeChild(al)}}}break}}function ad(ak){while(!ak.nextSibling){ak=ak.parentNode;if(!ak){return}}function ai(al,ar){var aq=ar?al.cloneNode(false):al;var ao=al.parentNode;if(ao){var ap=ai(ao,1);var an=al.nextSibling;ap.appendChild(aq);for(var am=an;am;am=an){an=am.nextSibling;ap.appendChild(am)}}return aq}var ah=ai(ak.nextSibling,0);for(var aj;(aj=ah.parentNode)&&aj.nodeType===1;){ah=aj}W.push(ah)}for(var Y=0;Y<W.length;++Y){ae(W[Y])}if(ag===(ag|0)){W[0].setAttribute("value",ag)}var aa=ac.createElement("OL");aa.className="linenums";var X=Math.max(0,((ag-1))|0)||0;for(var Y=0,T=W.length;Y<T;++Y){af=W[Y];af.className="L"+((Y+X)%10);if(!af.firstChild){af.appendChild(ac.createTextNode("\xA0"))}aa.appendChild(af)}V.appendChild(aa)}function D(ac){var aj=/\bMSIE\b/.test(navigator.userAgent);var am=/\n/g;var al=ac.sourceCode;var an=al.length;var V=0;var aa=ac.spans;var T=aa.length;var ah=0;var X=ac.decorations;var Y=X.length;var Z=0;X[Y]=an;var ar,aq;for(aq=ar=0;aq<Y;){if(X[aq]!==X[aq+2]){X[ar++]=X[aq++];X[ar++]=X[aq++]}else{aq+=2}}Y=ar;for(aq=ar=0;aq<Y;){var at=X[aq];var ab=X[aq+1];var W=aq+2;while(W+2<=Y&&X[W+1]===ab){W+=2}X[ar++]=at;X[ar++]=ab;aq=W}Y=X.length=ar;var ae=null;while(ah<T){var af=aa[ah];var S=aa[ah+2]||an;var ag=X[Z];var ap=X[Z+2]||an;var W=Math.min(S,ap);var ak=aa[ah+1];var U;if(ak.nodeType!==1&&(U=al.substring(V,W))){if(aj){U=U.replace(am,"\r")}ak.nodeValue=U;var ai=ak.ownerDocument;var ao=ai.createElement("SPAN");ao.className=X[Z+1];var ad=ak.parentNode;ad.replaceChild(ao,ak);ao.appendChild(ak);if(V<S){aa[ah+1]=ak=ai.createTextNode(al.substring(W,S));ad.insertBefore(ak,ao.nextSibling)}}V=W;if(V>=S){ah+=2}if(V>=ap){Z+=2}}}var t={};function c(U,V){for(var S=V.length;--S>=0;){var T=V[S];if(!t.hasOwnProperty(T)){t[T]=U}else{if(window.console){console.warn("cannot override language handler %s",T)}}}}function q(T,S){if(!(T&&t.hasOwnProperty(T))){T=/^\s*</.test(S)?"default-markup":"default-code"}return t[T]}c(K,["default-code"]);c(g([],[[F,/^[^<?]+/],[E,/^<!\w[^>]*(?:>|$)/],[j,/^<\!--[\s\S]*?(?:-\->|$)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],[L,/^(?:<[%?]|[%?]>)/],["lang-",/^<xmp\b[^>]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-js",/^<script\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^<style\b[^>]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i]]),["default-markup","htm","html","mxml","xhtml","xml","xsl"]);c(g([[F,/^[\s]+/,null," \t\r\n"],[n,/^(?:\"[^\"]*\"?|\'[^\']*\'?)/,null,"\"'"]],[[m,/^^<\/?[a-z](?:[\w.:-]*\w)?|\/?>$/i],[P,/^(?!style[\s=]|on)[a-z](?:[\w:-]*\w)?/i],["lang-uq.val",/^=\s*([^>\'\"\s]*(?:[^>\'\"\s\/]|\/(?=\s)))/],[L,/^[=<>\/]+/],["lang-js",/^on\w+\s*=\s*\"([^\"]+)\"/i],["lang-js",/^on\w+\s*=\s*\'([^\']+)\'/i],["lang-js",/^on\w+\s*=\s*([^\"\'>\s]+)/i],["lang-css",/^style\s*=\s*\"([^\"]+)\"/i],["lang-css",/^style\s*=\s*\'([^\']+)\'/i],["lang-css",/^style\s*=\s*([^\"\'>\s]+)/i]]),["in.tag"]);c(g([],[[n,/^[\s\S]+/]]),["uq.val"]);c(i({keywords:l,hashComments:true,cStyleComments:true,types:e}),["c","cc","cpp","cxx","cyc","m"]);c(i({keywords:"null,true,false"}),["json"]);c(i({keywords:R,hashComments:true,cStyleComments:true,verbatimStrings:true,types:e}),["cs"]);c(i({keywords:x,cStyleComments:true}),["java"]);c(i({keywords:H,hashComments:true,multiLineStrings:true}),["bsh","csh","sh"]);c(i({keywords:I,hashComments:true,multiLineStrings:true,tripleQuotedStrings:true}),["cv","py"]);c(i({keywords:s,hashComments:true,multiLineStrings:true,regexLiterals:true}),["perl","pl","pm"]);c(i({keywords:f,hashComments:true,multiLineStrings:true,regexLiterals:true}),["rb"]);c(i({keywords:w,cStyleComments:true,regexLiterals:true}),["js"]);c(i({keywords:r,hashComments:3,cStyleComments:true,multilineStrings:true,tripleQuotedStrings:true,regexLiterals:true}),["coffee"]);c(g([],[[C,/^[\s\S]+/]]),["regex"]);function d(V){var U=V.langExtension;try{var S=a(V.sourceNode);var T=S.sourceCode;V.sourceCode=T;V.spans=S.spans;V.basePos=0;q(U,T)(V);D(V)}catch(W){if("console" in window){console.log(W&&W.stack?W.stack:W)}}}function y(W,V,U){var S=document.createElement("PRE");S.innerHTML=W;if(U){Q(S,U)}var T={langExtension:V,numberLines:U,sourceNode:S};d(T);return S.innerHTML}function b(ad){function Y(af){return document.getElementsByTagName(af)}var ac=[Y("pre"),Y("code"),Y("xmp")];var T=[];for(var aa=0;aa<ac.length;++aa){for(var Z=0,V=ac[aa].length;Z<V;++Z){T.push(ac[aa][Z])}}ac=null;var W=Date;if(!W.now){W={now:function(){return +(new Date)}}}var X=0;var S;var ab=/\blang(?:uage)?-([\w.]+)(?!\S)/;var ae=/\bprettyprint\b/;function U(){var ag=(window.PR_SHOULD_USE_CONTINUATION?W.now()+250:Infinity);for(;X<T.length&&W.now()<ag;X++){var aj=T[X];var ai=aj.className;if(ai.indexOf("prettyprint")>=0){var ah=ai.match(ab);var am;if(!ah&&(am=o(aj))&&"CODE"===am.tagName){ah=am.className.match(ab)}if(ah){ah=ah[1]}var al=false;for(var ak=aj.parentNode;ak;ak=ak.parentNode){if((ak.tagName==="pre"||ak.tagName==="code"||ak.tagName==="xmp")&&ak.className&&ak.className.indexOf("prettyprint")>=0){al=true;break}}if(!al){var af=aj.className.match(/\blinenums\b(?::(\d+))?/);af=af?af[1]&&af[1].length?+af[1]:true:false;if(af){Q(aj,af)}S={langExtension:ah,sourceNode:aj,numberLines:af};d(S)}}}if(X<T.length){setTimeout(U,250)}else{if(ad){ad()}}}U()}window.prettyPrintOne=y;window.prettyPrint=b;window.PR={createSimpleLexer:g,registerLangHandler:c,sourceDecorator:i,PR_ATTRIB_NAME:P,PR_ATTRIB_VALUE:n,PR_COMMENT:j,PR_DECLARATION:E,PR_KEYWORD:z,PR_LITERAL:G,PR_NOCODE:N,PR_PLAIN:F,PR_PUNCTUATION:L,PR_SOURCE:J,PR_STRING:C,PR_TAG:m,PR_TYPE:O}})();PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_DECLARATION,/^<!\w[^>]*(?:>|$)/],[PR.PR_COMMENT,/^<\!--[\s\S]*?(?:-\->|$)/],[PR.PR_PUNCTUATION,/^(?:<[%?]|[%?]>)/],["lang-",/^<\?([\s\S]+?)(?:\?>|$)/],["lang-",/^<%([\s\S]+?)(?:%>|$)/],["lang-",/^<xmp\b[^>]*>([\s\S]+?)<\/xmp\b[^>]*>/i],["lang-handlebars",/^<script\b[^>]*type\s*=\s*['"]?text\/x-handlebars-template['"]?\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-js",/^<script\b[^>]*>([\s\S]*?)(<\/script\b[^>]*>)/i],["lang-css",/^<style\b[^>]*>([\s\S]*?)(<\/style\b[^>]*>)/i],["lang-in.tag",/^(<\/?[a-z][^<>]*>)/i],[PR.PR_DECLARATION,/^{{[#^>/]?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{&?\s*[\w.][^}]*}}/],[PR.PR_DECLARATION,/^{{{>?\s*[\w.][^}]*}}}/],[PR.PR_COMMENT,/^{{![^}]*}}/]]),["handlebars","hbs"]);PR.registerLangHandler(PR.createSimpleLexer([[PR.PR_PLAIN,/^[ \t\r\n\f]+/,null," \t\r\n\f"]],[[PR.PR_STRING,/^\"(?:[^\n\r\f\\\"]|\\(?:\r\n?|\n|\f)|\\[\s\S])*\"/,null],[PR.PR_STRING,/^\'(?:[^\n\r\f\\\']|\\(?:\r\n?|\n|\f)|\\[\s\S])*\'/,null],["lang-css-str",/^url\(([^\)\"\']*)\)/i],[PR.PR_KEYWORD,/^(?:url|rgb|\!important|@import|@page|@media|@charset|inherit)(?=[^\-\w]|$)/i,null],["lang-css-kw",/^(-?(?:[_a-z]|(?:\\[0-9a-f]+ ?))(?:[_a-z0-9\-]|\\(?:\\[0-9a-f]+ ?))*)\s*:/i],[PR.PR_COMMENT,/^\/\*[^*]*\*+(?:[^\/*][^*]*\*+)*\//],[PR.PR_COMMENT,/^(?:<!--|-->)/],[PR.PR_LITERAL,/^(?:\d+|\d*\.\d+)(?:%|[a-z]+)?/i],[PR.PR_LITERAL,/^#(?:[0-9a-f]{3}){1,2}/i],[PR.PR_PLAIN,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i],[PR.PR_PUNCTUATION,/^[^\s\w\'\"]+/]]),["css"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_KEYWORD,/^-?(?:[_a-z]|(?:\\[\da-f]+ ?))(?:[_a-z\d\-]|\\(?:\\[\da-f]+ ?))*/i]]),["css-kw"]);PR.registerLangHandler(PR.createSimpleLexer([],[[PR.PR_STRING,/^[^\)\"\']+/]]),["css-str"]);
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html
new file mode 100644
index 0000000..7c99c88
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/index.html
@@ -0,0 +1,97 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../prettify.css" />
+    <link rel="stylesheet" href="../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../index.html">All files</a> seedrandom
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>96/100</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">85.11% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>40/47</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.33% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>14/15</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96.39% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>80/83</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="seedrandom.js"><a href="seedrandom.js.html">seedrandom.js</a></td>
+	<td data-value="96" class="pic high"><div class="chart"><div class="cover-fill" style="width: 96%;"></div><div class="cover-empty" style="width:4%;"></div></div></td>
+	<td data-value="96" class="pct high">96%</td>
+	<td data-value="100" class="abs high">96/100</td>
+	<td data-value="85.11" class="pct high">85.11%</td>
+	<td data-value="47" class="abs high">40/47</td>
+	<td data-value="93.33" class="pct high">93.33%</td>
+	<td data-value="15" class="abs high">14/15</td>
+	<td data-value="96.39" class="pct high">96.39%</td>
+	<td data-value="83" class="abs high">80/83</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../sorter.js"></script>
+<script src="../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html
new file mode 100644
index 0000000..584d7c2
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/alea.js.html
@@ -0,0 +1,411 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/alea.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> alea.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">91.94% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>57/62</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">66.67% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>16/24</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90.91% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>10/11</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.34% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>50/53</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-yes">33x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">18x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A port of an algorithm by Johannes Baagøe &lt;baagoe@baagoe.com&gt;, 2010
+// http://baagoe.com/en/RandomMusings/javascript/
+// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror
+// Original work is under MIT license -
+&nbsp;
+// Copyright (C) 2010 by Johannes Baagøe &lt;baagoe@baagoe.org&gt;
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+&nbsp;
+&nbsp;
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function Alea(seed) {
+  var me = this, mash = Mash();
+&nbsp;
+  me.next = function() {
+    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32
+    me.s0 = me.s1;
+    me.s1 = me.s2;
+    return me.s2 = t - (me.c = t | 0);
+  };
+&nbsp;
+  // Apply the seeding algorithm from Baagoe.
+  me.c = 1;
+  me.s0 = mash(' ');
+  me.s1 = mash(' ');
+  me.s2 = mash(' ');
+  me.s0 -= mash(seed);
+  if (me.s0 &lt; 0) { me.s0 += 1; }
+  me.s1 -= mash(seed);
+  <span class="missing-if-branch" title="else path not taken" >E</span>if (me.s1 &lt; 0) { me.s1 += 1; }
+  me.s2 -= mash(seed);
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (me.s2 &lt; 0) { <span class="cstat-no" title="statement not covered" >me.s2 += 1; </span>}
+  mash = null;
+}
+&nbsp;
+function copy(f, t) {
+  t.c = f.c;
+  t.s0 = f.s0;
+  t.s1 = f.s1;
+  t.s2 = f.s2;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new Alea(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = xg.next;
+  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }
+  prng.double = function() {
+    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53
+  };
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+function Mash() {
+  var n = 0xefc8249d;
+&nbsp;
+  var mash = function(data) {
+    data = String(data);
+    for (var i = 0; i &lt; data.length; i++) {
+      n += data.charCodeAt(i);
+      var h = 0.02519603282416938 * n;
+      n = h &gt;&gt;&gt; 0;
+      h -= n;
+      h *= n;
+      n = h &gt;&gt;&gt; 0;
+      h -= n;
+      n += h * 0x100000000; // 2^32
+    }
+    return (n &gt;&gt;&gt; 0) * 2.3283064365386963e-10; // 2^-32
+  };
+&nbsp;
+  return mash;
+}
+&nbsp;
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.alea = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html
new file mode 100644
index 0000000..4986a5b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/index.html
@@ -0,0 +1,162 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> seedrandom/lib
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.45% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>343/371</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">69.39% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>102/147</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">89.66% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>52/58</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.93% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>294/313</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<div class="pad1">
+<table class="coverage-summary">
+<thead>
+<tr>
+   <th data-col="file" data-fmt="html" data-html="true" class="file">File</th>
+   <th data-col="pic" data-type="number" data-fmt="html" data-html="true" class="pic"></th>
+   <th data-col="statements" data-type="number" data-fmt="pct" class="pct">Statements</th>
+   <th data-col="statements_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="branches" data-type="number" data-fmt="pct" class="pct">Branches</th>
+   <th data-col="branches_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="functions" data-type="number" data-fmt="pct" class="pct">Functions</th>
+   <th data-col="functions_raw" data-type="number" data-fmt="html" class="abs"></th>
+   <th data-col="lines" data-type="number" data-fmt="pct" class="pct">Lines</th>
+   <th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
+</tr>
+</thead>
+<tbody><tr>
+	<td class="file high" data-value="alea.js"><a href="alea.js.html">alea.js</a></td>
+	<td data-value="91.94" class="pic high"><div class="chart"><div class="cover-fill" style="width: 91%;"></div><div class="cover-empty" style="width:9%;"></div></div></td>
+	<td data-value="91.94" class="pct high">91.94%</td>
+	<td data-value="62" class="abs high">57/62</td>
+	<td data-value="66.67" class="pct medium">66.67%</td>
+	<td data-value="24" class="abs medium">16/24</td>
+	<td data-value="90.91" class="pct high">90.91%</td>
+	<td data-value="11" class="abs high">10/11</td>
+	<td data-value="94.34" class="pct high">94.34%</td>
+	<td data-value="53" class="abs high">50/53</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="tychei.js"><a href="tychei.js.html">tychei.js</a></td>
+	<td data-value="92.98" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.98" class="pct high">92.98%</td>
+	<td data-value="57" class="abs high">53/57</td>
+	<td data-value="70" class="pct medium">70%</td>
+	<td data-value="20" class="abs medium">14/20</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.75" class="pct high">93.75%</td>
+	<td data-value="48" class="abs high">45/48</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xor128.js"><a href="xor128.js.html">xor128.js</a></td>
+	<td data-value="91.84" class="pic high"><div class="chart"><div class="cover-fill" style="width: 91%;"></div><div class="cover-empty" style="width:9%;"></div></div></td>
+	<td data-value="91.84" class="pct high">91.84%</td>
+	<td data-value="49" class="abs high">45/49</td>
+	<td data-value="70" class="pct medium">70%</td>
+	<td data-value="20" class="abs medium">14/20</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.02" class="pct high">93.02%</td>
+	<td data-value="43" class="abs high">40/43</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xor4096.js"><a href="xor4096.js.html">xor4096.js</a></td>
+	<td data-value="92.68" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.68" class="pct high">92.68%</td>
+	<td data-value="82" class="abs high">76/82</td>
+	<td data-value="65.71" class="pct medium">65.71%</td>
+	<td data-value="35" class="abs medium">23/35</td>
+	<td data-value="90" class="pct high">90%</td>
+	<td data-value="10" class="abs high">9/10</td>
+	<td data-value="94.52" class="pct high">94.52%</td>
+	<td data-value="73" class="abs high">69/73</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xorshift7.js"><a href="xorshift7.js.html">xorshift7.js</a></td>
+	<td data-value="92.42" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.42" class="pct high">92.42%</td>
+	<td data-value="66" class="abs high">61/66</td>
+	<td data-value="73.08" class="pct medium">73.08%</td>
+	<td data-value="26" class="abs medium">19/26</td>
+	<td data-value="90" class="pct high">90%</td>
+	<td data-value="10" class="abs high">9/10</td>
+	<td data-value="94" class="pct high">94%</td>
+	<td data-value="50" class="abs high">47/50</td>
+	</tr>
+
+<tr>
+	<td class="file high" data-value="xorwow.js"><a href="xorwow.js.html">xorwow.js</a></td>
+	<td data-value="92.73" class="pic high"><div class="chart"><div class="cover-fill" style="width: 92%;"></div><div class="cover-empty" style="width:8%;"></div></div></td>
+	<td data-value="92.73" class="pct high">92.73%</td>
+	<td data-value="55" class="abs high">51/55</td>
+	<td data-value="72.73" class="pct medium">72.73%</td>
+	<td data-value="22" class="abs medium">16/22</td>
+	<td data-value="88.89" class="pct high">88.89%</td>
+	<td data-value="9" class="abs high">8/9</td>
+	<td data-value="93.48" class="pct high">93.48%</td>
+	<td data-value="46" class="abs high">43/46</td>
+	</tr>
+
+</tbody>
+</table>
+</div><div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html
new file mode 100644
index 0000000..29c3483
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/tychei.js.html
@@ -0,0 +1,378 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/tychei.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> tychei.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.98% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>53/57</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">70% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>14/20</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.75% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>45/48</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-yes">4105195x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">66x</span>
+<span class="cline-any cline-yes">66x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "Tyche-i" prng algorithm by
+// Samuel Neves and Filipe Araujo.
+// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var b = me.b, c = me.c, d = me.d, a = me.a;
+    b = (b &lt;&lt; 25) ^ (b &gt;&gt;&gt; 7) ^ c;
+    c = (c - d) | 0;
+    d = (d &lt;&lt; 24) ^ (d &gt;&gt;&gt; 8) ^ a;
+    a = (a - b) | 0;
+    me.b = b = (b &lt;&lt; 20) ^ (b &gt;&gt;&gt; 12) ^ c;
+    me.c = c = (c - d) | 0;
+    me.d = (d &lt;&lt; 16) ^ (c &gt;&gt;&gt; 16) ^ a;
+    return me.a = (a - b) | 0;
+  };
+&nbsp;
+  /* The following is non-inverted tyche, which has better internal
+   * bit diffusion, but which is about 25% slower than tyche-i in JS.
+  me.next = function() {
+    var a = me.a, b = me.b, c = me.c, d = me.d;
+    a = (me.a + me.b | 0) &gt;&gt;&gt; 0;
+    d = me.d ^ a; d = d &lt;&lt; 16 ^ d &gt;&gt;&gt; 16;
+    c = me.c + d | 0;
+    b = me.b ^ c; b = b &lt;&lt; 12 ^ d &gt;&gt;&gt; 20;
+    me.a = a = a + b | 0;
+    d = d ^ a; me.d = d = d &lt;&lt; 8 ^ d &gt;&gt;&gt; 24;
+    me.c = c = c + d | 0;
+    b = b ^ c;
+    return me.b = (b &lt;&lt; 7 ^ b &gt;&gt;&gt; 25);
+  }
+  */
+&nbsp;
+  me.a = 0;
+  me.b = 0;
+  me.c = 2654435769 | 0;
+  me.d = 1367130551;
+&nbsp;
+  if (seed === Math.floor(seed)) {
+    // Integer seed.
+    me.a = (seed / 0x100000000) | 0;
+    me.b = seed | 0;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 20; k++) {
+    me.b ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.a = f.a;
+  t.b = f.b;
+  t.c = f.c;
+  t.d = f.d;
+  return t;
+};
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.tychei = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html
new file mode 100644
index 0000000..77ec76f
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor128.js.html
@@ -0,0 +1,312 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xor128.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xor128.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">91.84% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>45/49</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">70% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>14/20</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.02% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>40/43</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xor128" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var t = me.x ^ (me.x &lt;&lt; 11);
+    me.x = me.y;
+    me.y = me.z;
+    me.z = me.w;
+    return me.w ^= (me.w &gt;&gt;&gt; 19) ^ t ^ (t &gt;&gt;&gt; 8);
+  };
+&nbsp;
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xor128 = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html
new file mode 100644
index 0000000..a9b085b
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xor4096.js.html
@@ -0,0 +1,507 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xor4096.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xor4096.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.68% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>76/82</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">65.71% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>23/35</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>9/10</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94.52% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>69/73</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a>
+<a name='L116'></a><a href='#L116'>116</a>
+<a name='L117'></a><a href='#L117'>117</a>
+<a name='L118'></a><a href='#L118'>118</a>
+<a name='L119'></a><a href='#L119'>119</a>
+<a name='L120'></a><a href='#L120'>120</a>
+<a name='L121'></a><a href='#L121'>121</a>
+<a name='L122'></a><a href='#L122'>122</a>
+<a name='L123'></a><a href='#L123'>123</a>
+<a name='L124'></a><a href='#L124'>124</a>
+<a name='L125'></a><a href='#L125'>125</a>
+<a name='L126'></a><a href='#L126'>126</a>
+<a name='L127'></a><a href='#L127'>127</a>
+<a name='L128'></a><a href='#L128'>128</a>
+<a name='L129'></a><a href='#L129'>129</a>
+<a name='L130'></a><a href='#L130'>130</a>
+<a name='L131'></a><a href='#L131'>131</a>
+<a name='L132'></a><a href='#L132'>132</a>
+<a name='L133'></a><a href='#L133'>133</a>
+<a name='L134'></a><a href='#L134'>134</a>
+<a name='L135'></a><a href='#L135'>135</a>
+<a name='L136'></a><a href='#L136'>136</a>
+<a name='L137'></a><a href='#L137'>137</a>
+<a name='L138'></a><a href='#L138'>138</a>
+<a name='L139'></a><a href='#L139'>139</a>
+<a name='L140'></a><a href='#L140'>140</a>
+<a name='L141'></a><a href='#L141'>141</a>
+<a name='L142'></a><a href='#L142'>142</a>
+<a name='L143'></a><a href='#L143'>143</a>
+<a name='L144'></a><a href='#L144'>144</a>
+<a name='L145'></a><a href='#L145'>145</a>
+<a name='L146'></a><a href='#L146'>146</a>
+<a name='L147'></a><a href='#L147'>147</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105129x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">480x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-yes">384x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-yes">1536x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.
+//
+// This fast non-cryptographic random number generator is designed for
+// use in Monte-Carlo algorithms. It combines a long-period xorshift
+// generator with a Weyl generator, and it passes all common batteries
+// of stasticial tests for randomness while consuming only a few nanoseconds
+// for each prng generated.  For background on the generator, see Brent's
+// paper: "Some long-period random number generators using shifts and xors."
+// http://arxiv.org/pdf/1004.3115v1.pdf
+//
+// Usage:
+//
+// var xor4096 = require('xor4096');
+// random = xor4096(1);                        // Seed with int32 or string.
+// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.
+// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.
+//
+// For nonzero numeric keys, this impelementation provides a sequence
+// identical to that by Brent's xorgens 3 implementaion in C.  This
+// implementation also provides for initalizing the generator with
+// string seeds, or for saving and restoring the state of the generator.
+//
+// On Chrome, this prng benchmarks about 2.1 times slower than
+// Javascript's built-in Math.random().
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var w = me.w,
+        X = me.X, i = me.i, t, v;
+    // Update Weyl generator.
+    me.w = w = (w + 0x61c88647) | 0;
+    // Update xor generator.
+    v = X[(i + 34) &amp; 127];
+    t = X[i = ((i + 1) &amp; 127)];
+    v ^= v &lt;&lt; 13;
+    t ^= t &lt;&lt; 17;
+    v ^= v &gt;&gt;&gt; 15;
+    t ^= t &gt;&gt;&gt; 12;
+    // Update Xor generator array state.
+    v = X[i] = v ^ t;
+    me.i = i;
+    // Result is the combination.
+    return (v + (w ^ (w &gt;&gt;&gt; 16))) | 0;
+  };
+&nbsp;
+  function init(me, seed) {
+    var t, v, i, j, w, X = [], limit = 128;
+    if (seed === (seed | 0)) {
+      // Numeric seeds initialize v, which is used to generates X.
+      v = seed;
+      seed = null;
+    } else {
+      // String seeds are mixed into v and X one character at a time.
+      seed = seed + '\0';
+      v = 0;
+      limit = Math.max(limit, seed.length);
+    }
+    // Initialize circular array and weyl value.
+    for (i = 0, j = -32; j &lt; limit; ++j) {
+      // Put the unicode characters into the array, and shuffle them.
+      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);
+      // After 32 shuffles, take v as the starting w value.
+      if (j === 0) w = v;
+      v ^= v &lt;&lt; 10;
+      v ^= v &gt;&gt;&gt; 15;
+      v ^= v &lt;&lt; 4;
+      v ^= v &gt;&gt;&gt; 13;
+      if (j &gt;= 0) {
+        w = (w + 0x61c88647) | 0;     // Weyl.
+        t = (X[j &amp; 127] ^= (v + w));  // Combine xor and weyl to init array.
+        i = (0 == t) ? <span class="branch-0 cbranch-no" title="branch not covered" >i + 1 </span>: 0;     // Count zeroes.
+      }
+    }
+    // We have detected all zeroes; make the key nonzero.
+    <span class="missing-if-branch" title="if path not taken" >I</span>if (i &gt;= 128) {
+<span class="cstat-no" title="statement not covered" >      X[(seed &amp;&amp; seed.length || 0) &amp; 127] = -1;</span>
+    }
+    // Run the generator 512 times to further mix the state before using it.
+    // Factoring this as a function slows the main generator, so it is just
+    // unrolled here.  The weyl generator is not advanced while warming up.
+    i = 127;
+    for (j = 4 * 128; j &gt; 0; --j) {
+      v = X[(i + 34) &amp; 127];
+      t = X[i = ((i + 1) &amp; 127)];
+      v ^= v &lt;&lt; 13;
+      t ^= t &lt;&lt; 17;
+      v ^= v &gt;&gt;&gt; 15;
+      t ^= t &gt;&gt;&gt; 12;
+      X[i] = v ^ t;
+    }
+    // Storing state as object members is faster than using closure variables.
+    me.w = w;
+    me.X = X;
+    me.i = i;
+  }
+&nbsp;
+  init(me, seed);
+}
+&nbsp;
+function copy(f, t) {
+  t.i = f.i;
+  t.w = f.w;
+  t.X = f.X.slice();
+  return t;
+};
+&nbsp;
+function impl(seed, opts) {
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (seed == null) <span class="cstat-no" title="statement not covered" >seed = +(new Date);</span>
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.X) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xor4096 = impl;</span>
+}
+&nbsp;
+})(
+  this,                                     // window object or global
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html
new file mode 100644
index 0000000..e50230c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorshift7.js.html
@@ -0,0 +1,360 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xorshift7.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xorshift7.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.42% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>61/66</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">73.08% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>19/26</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">90% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>9/10</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">94% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>47/50</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-yes">4105897x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">16x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">768x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xorshift7" algorithm by
+// François Panneton and Pierre L'ecuyer:
+// "On the Xorgshift Random Number Generators"
+// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this;
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    // Update xor generator.
+    var X = me.x, i = me.i, t, v, w;
+    t = X[i]; t ^= (t &gt;&gt;&gt; 7); v = t ^ (t &lt;&lt; 24);
+    t = X[(i + 1) &amp; 7]; v ^= t ^ (t &gt;&gt;&gt; 10);
+    t = X[(i + 3) &amp; 7]; v ^= t ^ (t &gt;&gt;&gt; 3);
+    t = X[(i + 4) &amp; 7]; v ^= t ^ (t &lt;&lt; 7);
+    t = X[(i + 7) &amp; 7]; t = t ^ (t &lt;&lt; 13); v ^= t ^ (t &lt;&lt; 9);
+    X[i] = v;
+    me.i = (i + 1) &amp; 7;
+    return v;
+  };
+&nbsp;
+  function init(me, seed) {
+    var j, w, X = [];
+&nbsp;
+    if (seed === (seed | 0)) {
+      // Seed state array using a 32-bit integer.
+      w = X[0] = seed;
+    } else {
+      // Seed state using a string.
+      seed = '' + seed;
+      for (j = 0; j &lt; seed.length; ++j) {
+        X[j &amp; 7] = (X[j &amp; 7] &lt;&lt; 15) ^
+            (seed.charCodeAt(j) + X[(j + 1) &amp; 7] &lt;&lt; 13);
+      }
+    }
+    // Enforce an array length of 8, not all zeroes.
+    while (X.length &lt; 8) X.push(0);
+    for (j = 0; j &lt; 8 &amp;&amp; X[j] === 0; ++j);
+    if (j == 8) w = X[7] = -1; else w = X[j];
+&nbsp;
+    me.x = X;
+    me.i = 0;
+&nbsp;
+    // Discard an initial 256 values.
+    for (j = 256; j &gt; 0; --j) {
+      me.next();
+    }
+  }
+&nbsp;
+  init(me, seed);
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x.slice();
+  t.i = f.i;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  <span class="missing-if-branch" title="if path not taken" >I</span>if (seed == null) <span class="cstat-no" title="statement not covered" >seed = +(new Date);</span>
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.x) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xorshift7 = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html
new file mode 100644
index 0000000..3c8d5a7
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/lib/xorwow.js.html
@@ -0,0 +1,327 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/lib/xorwow.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../../prettify.css" />
+    <link rel="stylesheet" href="../../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../../index.html">All files</a> / <a href="index.html">seedrandom/lib</a> xorwow.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">92.73% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>51/55</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">72.73% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>16/22</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">88.89% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>8/9</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.48% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>43/46</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-yes">4105327x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">198x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">4102054x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-yes">2x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">// A Javascript implementaion of the "xorwow" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+&nbsp;
+(function(global, module, define) {
+&nbsp;
+function XorGen(seed) {
+  var me = this, strseed = '';
+&nbsp;
+  // Set up generator function.
+  me.next = function() {
+    var t = (me.x ^ (me.x &gt;&gt;&gt; 2));
+    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;
+    return (me.d = (me.d + 362437 | 0)) +
+       (me.v = (me.v ^ (me.v &lt;&lt; 4)) ^ (t ^ (t &lt;&lt; 1))) | 0;
+  };
+&nbsp;
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+  me.v = 0;
+&nbsp;
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+&nbsp;
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k &lt; strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    if (k == strseed.length) {
+      me.d = me.x &lt;&lt; 10 ^ me.x &gt;&gt;&gt; 4;
+    }
+    me.next();
+  }
+}
+&nbsp;
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  t.v = f.v;
+  t.d = f.d;
+  return t;
+}
+&nbsp;
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts &amp;&amp; opts.state,
+      prng = function() { return (xg.next() &gt;&gt;&gt; 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() &gt;&gt;&gt; 11,
+          bot = (xg.next() &gt;&gt;&gt; 0) / 0x100000000,
+          result = (top + bot) / (1 &lt;&lt; 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+&nbsp;
+<span class="missing-if-branch" title="else path not taken" >E</span>if (module &amp;&amp; module.exports) {
+  module.exports = impl;
+} else <span class="cstat-no" title="statement not covered" >if (define &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return impl; </span>});</span>
+} else {
+<span class="cstat-no" title="statement not covered" >  this.xorwow = impl;</span>
+}
+&nbsp;
+})(
+  this,
+  (typeof module) == 'object' &amp;&amp; module,    // present in node.js
+  (typeof define) == 'function' &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >define </span>  // present with an AMD loader
+);
+&nbsp;
+&nbsp;
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../../sorter.js"></script>
+<script src="../../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html b/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html
new file mode 100644
index 0000000..ca72564
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/seedrandom/seedrandom.js.html
@@ -0,0 +1,828 @@
+<!doctype html>
+<html lang="en">
+<head>
+    <title>Code coverage report for seedrandom/seedrandom.js</title>
+    <meta charset="utf-8" />
+    <link rel="stylesheet" href="../prettify.css" />
+    <link rel="stylesheet" href="../base.css" />
+    <meta name="viewport" content="width=device-width, initial-scale=1">
+    <style type='text/css'>
+        .coverage-summary .sorter {
+            background-image: url(../sort-arrow-sprite.png);
+        }
+    </style>
+</head>
+<body>
+<div class='wrapper'>
+  <div class='pad1'>
+    <h1>
+      <a href="../index.html">All files</a> / <a href="index.html">seedrandom</a> seedrandom.js
+    </h1>
+    <div class='clearfix'>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96% </span>
+        <span class="quiet">Statements</span>
+        <span class='fraction'>96/100</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">85.11% </span>
+        <span class="quiet">Branches</span>
+        <span class='fraction'>40/47</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">93.33% </span>
+        <span class="quiet">Functions</span>
+        <span class='fraction'>14/15</span>
+      </div>
+      <div class='fl pad1y space-right2'>
+        <span class="strong">96.39% </span>
+        <span class="quiet">Lines</span>
+        <span class='fraction'>80/83</span>
+      </div>
+    </div>
+    <p class="quiet">
+      Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+    </p>
+  </div>
+  <div class='status-line high'></div>
+<pre><table class="coverage">
+<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
+<a name='L2'></a><a href='#L2'>2</a>
+<a name='L3'></a><a href='#L3'>3</a>
+<a name='L4'></a><a href='#L4'>4</a>
+<a name='L5'></a><a href='#L5'>5</a>
+<a name='L6'></a><a href='#L6'>6</a>
+<a name='L7'></a><a href='#L7'>7</a>
+<a name='L8'></a><a href='#L8'>8</a>
+<a name='L9'></a><a href='#L9'>9</a>
+<a name='L10'></a><a href='#L10'>10</a>
+<a name='L11'></a><a href='#L11'>11</a>
+<a name='L12'></a><a href='#L12'>12</a>
+<a name='L13'></a><a href='#L13'>13</a>
+<a name='L14'></a><a href='#L14'>14</a>
+<a name='L15'></a><a href='#L15'>15</a>
+<a name='L16'></a><a href='#L16'>16</a>
+<a name='L17'></a><a href='#L17'>17</a>
+<a name='L18'></a><a href='#L18'>18</a>
+<a name='L19'></a><a href='#L19'>19</a>
+<a name='L20'></a><a href='#L20'>20</a>
+<a name='L21'></a><a href='#L21'>21</a>
+<a name='L22'></a><a href='#L22'>22</a>
+<a name='L23'></a><a href='#L23'>23</a>
+<a name='L24'></a><a href='#L24'>24</a>
+<a name='L25'></a><a href='#L25'>25</a>
+<a name='L26'></a><a href='#L26'>26</a>
+<a name='L27'></a><a href='#L27'>27</a>
+<a name='L28'></a><a href='#L28'>28</a>
+<a name='L29'></a><a href='#L29'>29</a>
+<a name='L30'></a><a href='#L30'>30</a>
+<a name='L31'></a><a href='#L31'>31</a>
+<a name='L32'></a><a href='#L32'>32</a>
+<a name='L33'></a><a href='#L33'>33</a>
+<a name='L34'></a><a href='#L34'>34</a>
+<a name='L35'></a><a href='#L35'>35</a>
+<a name='L36'></a><a href='#L36'>36</a>
+<a name='L37'></a><a href='#L37'>37</a>
+<a name='L38'></a><a href='#L38'>38</a>
+<a name='L39'></a><a href='#L39'>39</a>
+<a name='L40'></a><a href='#L40'>40</a>
+<a name='L41'></a><a href='#L41'>41</a>
+<a name='L42'></a><a href='#L42'>42</a>
+<a name='L43'></a><a href='#L43'>43</a>
+<a name='L44'></a><a href='#L44'>44</a>
+<a name='L45'></a><a href='#L45'>45</a>
+<a name='L46'></a><a href='#L46'>46</a>
+<a name='L47'></a><a href='#L47'>47</a>
+<a name='L48'></a><a href='#L48'>48</a>
+<a name='L49'></a><a href='#L49'>49</a>
+<a name='L50'></a><a href='#L50'>50</a>
+<a name='L51'></a><a href='#L51'>51</a>
+<a name='L52'></a><a href='#L52'>52</a>
+<a name='L53'></a><a href='#L53'>53</a>
+<a name='L54'></a><a href='#L54'>54</a>
+<a name='L55'></a><a href='#L55'>55</a>
+<a name='L56'></a><a href='#L56'>56</a>
+<a name='L57'></a><a href='#L57'>57</a>
+<a name='L58'></a><a href='#L58'>58</a>
+<a name='L59'></a><a href='#L59'>59</a>
+<a name='L60'></a><a href='#L60'>60</a>
+<a name='L61'></a><a href='#L61'>61</a>
+<a name='L62'></a><a href='#L62'>62</a>
+<a name='L63'></a><a href='#L63'>63</a>
+<a name='L64'></a><a href='#L64'>64</a>
+<a name='L65'></a><a href='#L65'>65</a>
+<a name='L66'></a><a href='#L66'>66</a>
+<a name='L67'></a><a href='#L67'>67</a>
+<a name='L68'></a><a href='#L68'>68</a>
+<a name='L69'></a><a href='#L69'>69</a>
+<a name='L70'></a><a href='#L70'>70</a>
+<a name='L71'></a><a href='#L71'>71</a>
+<a name='L72'></a><a href='#L72'>72</a>
+<a name='L73'></a><a href='#L73'>73</a>
+<a name='L74'></a><a href='#L74'>74</a>
+<a name='L75'></a><a href='#L75'>75</a>
+<a name='L76'></a><a href='#L76'>76</a>
+<a name='L77'></a><a href='#L77'>77</a>
+<a name='L78'></a><a href='#L78'>78</a>
+<a name='L79'></a><a href='#L79'>79</a>
+<a name='L80'></a><a href='#L80'>80</a>
+<a name='L81'></a><a href='#L81'>81</a>
+<a name='L82'></a><a href='#L82'>82</a>
+<a name='L83'></a><a href='#L83'>83</a>
+<a name='L84'></a><a href='#L84'>84</a>
+<a name='L85'></a><a href='#L85'>85</a>
+<a name='L86'></a><a href='#L86'>86</a>
+<a name='L87'></a><a href='#L87'>87</a>
+<a name='L88'></a><a href='#L88'>88</a>
+<a name='L89'></a><a href='#L89'>89</a>
+<a name='L90'></a><a href='#L90'>90</a>
+<a name='L91'></a><a href='#L91'>91</a>
+<a name='L92'></a><a href='#L92'>92</a>
+<a name='L93'></a><a href='#L93'>93</a>
+<a name='L94'></a><a href='#L94'>94</a>
+<a name='L95'></a><a href='#L95'>95</a>
+<a name='L96'></a><a href='#L96'>96</a>
+<a name='L97'></a><a href='#L97'>97</a>
+<a name='L98'></a><a href='#L98'>98</a>
+<a name='L99'></a><a href='#L99'>99</a>
+<a name='L100'></a><a href='#L100'>100</a>
+<a name='L101'></a><a href='#L101'>101</a>
+<a name='L102'></a><a href='#L102'>102</a>
+<a name='L103'></a><a href='#L103'>103</a>
+<a name='L104'></a><a href='#L104'>104</a>
+<a name='L105'></a><a href='#L105'>105</a>
+<a name='L106'></a><a href='#L106'>106</a>
+<a name='L107'></a><a href='#L107'>107</a>
+<a name='L108'></a><a href='#L108'>108</a>
+<a name='L109'></a><a href='#L109'>109</a>
+<a name='L110'></a><a href='#L110'>110</a>
+<a name='L111'></a><a href='#L111'>111</a>
+<a name='L112'></a><a href='#L112'>112</a>
+<a name='L113'></a><a href='#L113'>113</a>
+<a name='L114'></a><a href='#L114'>114</a>
+<a name='L115'></a><a href='#L115'>115</a>
+<a name='L116'></a><a href='#L116'>116</a>
+<a name='L117'></a><a href='#L117'>117</a>
+<a name='L118'></a><a href='#L118'>118</a>
+<a name='L119'></a><a href='#L119'>119</a>
+<a name='L120'></a><a href='#L120'>120</a>
+<a name='L121'></a><a href='#L121'>121</a>
+<a name='L122'></a><a href='#L122'>122</a>
+<a name='L123'></a><a href='#L123'>123</a>
+<a name='L124'></a><a href='#L124'>124</a>
+<a name='L125'></a><a href='#L125'>125</a>
+<a name='L126'></a><a href='#L126'>126</a>
+<a name='L127'></a><a href='#L127'>127</a>
+<a name='L128'></a><a href='#L128'>128</a>
+<a name='L129'></a><a href='#L129'>129</a>
+<a name='L130'></a><a href='#L130'>130</a>
+<a name='L131'></a><a href='#L131'>131</a>
+<a name='L132'></a><a href='#L132'>132</a>
+<a name='L133'></a><a href='#L133'>133</a>
+<a name='L134'></a><a href='#L134'>134</a>
+<a name='L135'></a><a href='#L135'>135</a>
+<a name='L136'></a><a href='#L136'>136</a>
+<a name='L137'></a><a href='#L137'>137</a>
+<a name='L138'></a><a href='#L138'>138</a>
+<a name='L139'></a><a href='#L139'>139</a>
+<a name='L140'></a><a href='#L140'>140</a>
+<a name='L141'></a><a href='#L141'>141</a>
+<a name='L142'></a><a href='#L142'>142</a>
+<a name='L143'></a><a href='#L143'>143</a>
+<a name='L144'></a><a href='#L144'>144</a>
+<a name='L145'></a><a href='#L145'>145</a>
+<a name='L146'></a><a href='#L146'>146</a>
+<a name='L147'></a><a href='#L147'>147</a>
+<a name='L148'></a><a href='#L148'>148</a>
+<a name='L149'></a><a href='#L149'>149</a>
+<a name='L150'></a><a href='#L150'>150</a>
+<a name='L151'></a><a href='#L151'>151</a>
+<a name='L152'></a><a href='#L152'>152</a>
+<a name='L153'></a><a href='#L153'>153</a>
+<a name='L154'></a><a href='#L154'>154</a>
+<a name='L155'></a><a href='#L155'>155</a>
+<a name='L156'></a><a href='#L156'>156</a>
+<a name='L157'></a><a href='#L157'>157</a>
+<a name='L158'></a><a href='#L158'>158</a>
+<a name='L159'></a><a href='#L159'>159</a>
+<a name='L160'></a><a href='#L160'>160</a>
+<a name='L161'></a><a href='#L161'>161</a>
+<a name='L162'></a><a href='#L162'>162</a>
+<a name='L163'></a><a href='#L163'>163</a>
+<a name='L164'></a><a href='#L164'>164</a>
+<a name='L165'></a><a href='#L165'>165</a>
+<a name='L166'></a><a href='#L166'>166</a>
+<a name='L167'></a><a href='#L167'>167</a>
+<a name='L168'></a><a href='#L168'>168</a>
+<a name='L169'></a><a href='#L169'>169</a>
+<a name='L170'></a><a href='#L170'>170</a>
+<a name='L171'></a><a href='#L171'>171</a>
+<a name='L172'></a><a href='#L172'>172</a>
+<a name='L173'></a><a href='#L173'>173</a>
+<a name='L174'></a><a href='#L174'>174</a>
+<a name='L175'></a><a href='#L175'>175</a>
+<a name='L176'></a><a href='#L176'>176</a>
+<a name='L177'></a><a href='#L177'>177</a>
+<a name='L178'></a><a href='#L178'>178</a>
+<a name='L179'></a><a href='#L179'>179</a>
+<a name='L180'></a><a href='#L180'>180</a>
+<a name='L181'></a><a href='#L181'>181</a>
+<a name='L182'></a><a href='#L182'>182</a>
+<a name='L183'></a><a href='#L183'>183</a>
+<a name='L184'></a><a href='#L184'>184</a>
+<a name='L185'></a><a href='#L185'>185</a>
+<a name='L186'></a><a href='#L186'>186</a>
+<a name='L187'></a><a href='#L187'>187</a>
+<a name='L188'></a><a href='#L188'>188</a>
+<a name='L189'></a><a href='#L189'>189</a>
+<a name='L190'></a><a href='#L190'>190</a>
+<a name='L191'></a><a href='#L191'>191</a>
+<a name='L192'></a><a href='#L192'>192</a>
+<a name='L193'></a><a href='#L193'>193</a>
+<a name='L194'></a><a href='#L194'>194</a>
+<a name='L195'></a><a href='#L195'>195</a>
+<a name='L196'></a><a href='#L196'>196</a>
+<a name='L197'></a><a href='#L197'>197</a>
+<a name='L198'></a><a href='#L198'>198</a>
+<a name='L199'></a><a href='#L199'>199</a>
+<a name='L200'></a><a href='#L200'>200</a>
+<a name='L201'></a><a href='#L201'>201</a>
+<a name='L202'></a><a href='#L202'>202</a>
+<a name='L203'></a><a href='#L203'>203</a>
+<a name='L204'></a><a href='#L204'>204</a>
+<a name='L205'></a><a href='#L205'>205</a>
+<a name='L206'></a><a href='#L206'>206</a>
+<a name='L207'></a><a href='#L207'>207</a>
+<a name='L208'></a><a href='#L208'>208</a>
+<a name='L209'></a><a href='#L209'>209</a>
+<a name='L210'></a><a href='#L210'>210</a>
+<a name='L211'></a><a href='#L211'>211</a>
+<a name='L212'></a><a href='#L212'>212</a>
+<a name='L213'></a><a href='#L213'>213</a>
+<a name='L214'></a><a href='#L214'>214</a>
+<a name='L215'></a><a href='#L215'>215</a>
+<a name='L216'></a><a href='#L216'>216</a>
+<a name='L217'></a><a href='#L217'>217</a>
+<a name='L218'></a><a href='#L218'>218</a>
+<a name='L219'></a><a href='#L219'>219</a>
+<a name='L220'></a><a href='#L220'>220</a>
+<a name='L221'></a><a href='#L221'>221</a>
+<a name='L222'></a><a href='#L222'>222</a>
+<a name='L223'></a><a href='#L223'>223</a>
+<a name='L224'></a><a href='#L224'>224</a>
+<a name='L225'></a><a href='#L225'>225</a>
+<a name='L226'></a><a href='#L226'>226</a>
+<a name='L227'></a><a href='#L227'>227</a>
+<a name='L228'></a><a href='#L228'>228</a>
+<a name='L229'></a><a href='#L229'>229</a>
+<a name='L230'></a><a href='#L230'>230</a>
+<a name='L231'></a><a href='#L231'>231</a>
+<a name='L232'></a><a href='#L232'>232</a>
+<a name='L233'></a><a href='#L233'>233</a>
+<a name='L234'></a><a href='#L234'>234</a>
+<a name='L235'></a><a href='#L235'>235</a>
+<a name='L236'></a><a href='#L236'>236</a>
+<a name='L237'></a><a href='#L237'>237</a>
+<a name='L238'></a><a href='#L238'>238</a>
+<a name='L239'></a><a href='#L239'>239</a>
+<a name='L240'></a><a href='#L240'>240</a>
+<a name='L241'></a><a href='#L241'>241</a>
+<a name='L242'></a><a href='#L242'>242</a>
+<a name='L243'></a><a href='#L243'>243</a>
+<a name='L244'></a><a href='#L244'>244</a>
+<a name='L245'></a><a href='#L245'>245</a>
+<a name='L246'></a><a href='#L246'>246</a>
+<a name='L247'></a><a href='#L247'>247</a>
+<a name='L248'></a><a href='#L248'>248</a>
+<a name='L249'></a><a href='#L249'>249</a>
+<a name='L250'></a><a href='#L250'>250</a>
+<a name='L251'></a><a href='#L251'>251</a>
+<a name='L252'></a><a href='#L252'>252</a>
+<a name='L253'></a><a href='#L253'>253</a>
+<a name='L254'></a><a href='#L254'>254</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-yes">3917x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-yes">9249x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3694x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1025x</span>
+<span class="cline-any cline-yes">4100001x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">20x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">20x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">19x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-yes">5888x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">23x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">16436073x</span>
+<span class="cline-any cline-yes">16436073x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-yes">4108660x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-yes">9x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">32x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-yes">7735x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">52x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">4x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">3x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-yes">1x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">81x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-yes">6x</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-no">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span>
+<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">/*
+Copyright 2019 David Bau.
+&nbsp;
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+&nbsp;
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+&nbsp;
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+&nbsp;
+*/
+&nbsp;
+(function (global, pool, math) {
+//
+// The following constants are related to IEEE 754 limits.
+//
+&nbsp;
+var width = 256,        // each RC4 output is 0 &lt;= x &lt; 256
+    chunks = 6,         // at least six RC4 outputs for each double
+    digits = 52,        // there are 52 significant digits in a double
+    rngname = 'random', // rngname: name for Math.random and Math.seedrandom
+    startdenom = math.pow(width, chunks),
+    significance = math.pow(2, digits),
+    overflow = significance * 2,
+    mask = width - 1,
+    nodecrypto;         // node.js crypto module, initialized at the bottom.
+&nbsp;
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+function seedrandom(seed, options, callback) {
+  var key = [];
+  options = (options == true) ? { entropy: true } : (options || {});
+&nbsp;
+  // Flatten the seed string or build one from local entropy if needed.
+  var shortseed = mixkey(flatten(
+    options.entropy ? [seed, tostring(pool)] :
+    (seed == null) ? autoseed() : seed, 3), key);
+&nbsp;
+  // Use the seed to initialize an ARC4 generator.
+  var arc4 = new ARC4(key);
+&nbsp;
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+  var prng = function() {
+    var n = arc4.g(chunks),             // Start with a numerator n &lt; 2 ^ 48
+        d = startdenom,                 //   and denominator d = 2 ^ 48.
+        x = 0;                          //   and no 'extra last byte'.
+    while (n &lt; significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n &gt;= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x &gt;&gt;&gt;= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+&nbsp;
+  prng.int32 = function() { return arc4.g(4) | 0; }
+  prng.quick = function() { return arc4.g(4) / 0x100000000; }
+  prng.double = prng;
+&nbsp;
+  // Mix the randomness into accumulated entropy.
+  mixkey(tostring(arc4.S), pool);
+&nbsp;
+  // Calling convention: what to return as a function of prng, seed, is_math.
+  return (options.pass || callback ||
+      function(prng, seed, is_math_call, state) {
+        if (state) {
+          // Load the arc4 state from the given state if it has an S array.
+          if (state.S) { copy(state, arc4); }
+          // Only provide the .state method if requested via options.state.
+          prng.state = function() { return copy(arc4, {}); }
+        }
+&nbsp;
+        // If called as a method of Math (Math.seedrandom()), mutate
+        // Math.random because that is how seedrandom.js has worked since v1.0.
+        if (is_math_call) { math[rngname] = prng; return seed; }
+&nbsp;
+        // Otherwise, it is a newer calling convention, so return the
+        // prng directly.
+        else return prng;
+      })(
+  prng,
+  shortseed,
+  'global' in options ? options.global : (this == math),
+  options.state);
+}
+&nbsp;
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 &lt;= x &lt; (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 &lt;= x &lt; (width ^ count).
+//
+function ARC4(key) {
+  var t, keylen = key.length,
+      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];
+&nbsp;
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+&nbsp;
+  // Set up S using the standard key scheduling algorithm.
+  while (i &lt; width) {
+    s[i] = i++;
+  }
+  for (i = 0; i &lt; width; i++) {
+    s[i] = s[j = mask &amp; (j + key[i % keylen] + (t = s[i]))];
+    s[j] = t;
+  }
+&nbsp;
+  // The "g" method returns the next (count) outputs as one number.
+  (me.g = function(count) {
+    // Using instance members instead of closure state nearly doubles speed.
+    var t, r = 0,
+        i = me.i, j = me.j, s = me.S;
+    while (count--) {
+      t = s[i = mask &amp; (i + 1)];
+      r = r * width + s[mask &amp; ((s[i] = s[j = mask &amp; (j + t)]) + (s[j] = t))];
+    }
+    me.i = i; me.j = j;
+    return r;
+    // For robust unpredictability, the function call below automatically
+    // discards an initial batch of values.  This is called RC4-drop[256].
+    // See http://google.com/search?q=rsa+fluhrer+response&amp;btnI
+  })(width);
+}
+&nbsp;
+//
+// copy()
+// Copies internal state of ARC4 to or from a plain object.
+//
+function copy(f, t) {
+  t.i = f.i;
+  t.j = f.j;
+  t.S = f.S.slice();
+  return t;
+};
+&nbsp;
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+function flatten(obj, depth) {
+  var result = [], typ = (typeof obj), prop;
+  if (depth &amp;&amp; typ == 'object') {
+    for (prop in obj) {
+      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+    }
+  }
+  return (result.length ? result : typ == 'string' ? obj : obj + '\0');
+}
+&nbsp;
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+function mixkey(seed, key) {
+  var stringseed = seed + '', smear, j = 0;
+  while (j &lt; stringseed.length) {
+    key[mask &amp; j] =
+      mask &amp; ((smear ^= key[mask &amp; j] * 19) + stringseed.charCodeAt(j++));
+  }
+  return tostring(key);
+}
+&nbsp;
+//
+// autoseed()
+// Returns an object for autoseeding, using window.crypto and Node crypto
+// module if available.
+//
+function autoseed() {
+  try {
+    var out;
+    if (nodecrypto &amp;&amp; (out = nodecrypto.randomBytes)) {
+      // The use of 'out' to remember randomBytes makes tight minified code.
+      out = out(width);
+    } else {
+      out = new Uint8Array(width);
+      (global.crypto || global.msCrypto).getRandomValues(out);
+    }
+    return tostring(out);
+  } catch (e) {
+    var browser = global.navigator,
+        plugins = browser &amp;&amp; <span class="branch-1 cbranch-no" title="branch not covered" >browser.plugins;</span>
+    return [+new Date, global, plugins, global.screen, tostring(pool)];
+  }
+}
+&nbsp;
+//
+// tostring()
+// Converts an array of charcodes to a string
+//
+function tostring(a) {
+  return String.fromCharCode.apply(0, a);
+}
+&nbsp;
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to interfere with deterministic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+&nbsp;
+//
+// Nodejs and AMD support: export the implementation as a module using
+// either convention.
+//
+<span class="missing-if-branch" title="else path not taken" >E</span>if ((typeof module) == 'object' &amp;&amp; module.exports) {
+  module.exports = seedrandom;
+  // When in node.js, try using crypto package for autoseeding.
+  try {
+    nodecrypto = require('crypto');
+  } catch (ex) {}
+} else <span class="cstat-no" title="statement not covered" >if ((typeof define) == 'function' &amp;&amp; define.amd) {</span>
+<span class="cstat-no" title="statement not covered" >  define(<span class="fstat-no" title="function not covered" >fu</span>nction() { <span class="cstat-no" title="statement not covered" >return seedrandom; </span>});</span>
+} else {
+  // When included as a plain script, set up Math.seedrandom global.
+<span class="cstat-no" title="statement not covered" >  math['seed' + rngname] = seedrandom;</span>
+}
+&nbsp;
+&nbsp;
+// End anonymous scope, and pass initial values.
+})(
+  // global: `self` in browsers (including strict mode and web workers),
+  // otherwise `this` in Node and other environments
+  (typeof self !== 'undefined') ? <span class="branch-0 cbranch-no" title="branch not covered" >self </span>: this,
+  [],     // pool: entropy pool starts empty
+  Math    // math: package containing random, pow, and seedrandom
+);
+&nbsp;</pre></td></tr>
+</table></pre>
+<div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+  Code coverage
+  generated by <a href="https://istanbul.js.org/" target="_blank">istanbul</a> at Tue Sep 17 2019 06:35:34 GMT-0400 (Eastern Daylight Time)
+</div>
+</div>
+<script src="../prettify.js"></script>
+<script>
+window.onload = function () {
+        if (typeof prettyPrint === 'function') {
+            prettyPrint();
+        }
+};
+</script>
+<script src="../sorter.js"></script>
+<script src="../block-navigation.js"></script>
+</body>
+</html>
diff --git a/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png b/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png
new file mode 100644
index 0000000..03f704a
Binary files /dev/null and b/node_modules/seedrandom/coverage/lcov-report/sort-arrow-sprite.png differ
diff --git a/node_modules/seedrandom/coverage/lcov-report/sorter.js b/node_modules/seedrandom/coverage/lcov-report/sorter.js
new file mode 100644
index 0000000..16de10c
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov-report/sorter.js
@@ -0,0 +1,170 @@
+/* eslint-disable */
+var addSorting = (function() {
+    'use strict';
+    var cols,
+        currentSort = {
+            index: 0,
+            desc: false
+        };
+
+    // returns the summary table element
+    function getTable() {
+        return document.querySelector('.coverage-summary');
+    }
+    // returns the thead element of the summary table
+    function getTableHeader() {
+        return getTable().querySelector('thead tr');
+    }
+    // returns the tbody element of the summary table
+    function getTableBody() {
+        return getTable().querySelector('tbody');
+    }
+    // returns the th element for nth column
+    function getNthColumn(n) {
+        return getTableHeader().querySelectorAll('th')[n];
+    }
+
+    // loads all columns
+    function loadColumns() {
+        var colNodes = getTableHeader().querySelectorAll('th'),
+            colNode,
+            cols = [],
+            col,
+            i;
+
+        for (i = 0; i < colNodes.length; i += 1) {
+            colNode = colNodes[i];
+            col = {
+                key: colNode.getAttribute('data-col'),
+                sortable: !colNode.getAttribute('data-nosort'),
+                type: colNode.getAttribute('data-type') || 'string'
+            };
+            cols.push(col);
+            if (col.sortable) {
+                col.defaultDescSort = col.type === 'number';
+                colNode.innerHTML =
+                    colNode.innerHTML + '<span class="sorter"></span>';
+            }
+        }
+        return cols;
+    }
+    // attaches a data attribute to every tr element with an object
+    // of data values keyed by column name
+    function loadRowData(tableRow) {
+        var tableCols = tableRow.querySelectorAll('td'),
+            colNode,
+            col,
+            data = {},
+            i,
+            val;
+        for (i = 0; i < tableCols.length; i += 1) {
+            colNode = tableCols[i];
+            col = cols[i];
+            val = colNode.getAttribute('data-value');
+            if (col.type === 'number') {
+                val = Number(val);
+            }
+            data[col.key] = val;
+        }
+        return data;
+    }
+    // loads all row data
+    function loadData() {
+        var rows = getTableBody().querySelectorAll('tr'),
+            i;
+
+        for (i = 0; i < rows.length; i += 1) {
+            rows[i].data = loadRowData(rows[i]);
+        }
+    }
+    // sorts the table using the data for the ith column
+    function sortByIndex(index, desc) {
+        var key = cols[index].key,
+            sorter = function(a, b) {
+                a = a.data[key];
+                b = b.data[key];
+                return a < b ? -1 : a > b ? 1 : 0;
+            },
+            finalSorter = sorter,
+            tableBody = document.querySelector('.coverage-summary tbody'),
+            rowNodes = tableBody.querySelectorAll('tr'),
+            rows = [],
+            i;
+
+        if (desc) {
+            finalSorter = function(a, b) {
+                return -1 * sorter(a, b);
+            };
+        }
+
+        for (i = 0; i < rowNodes.length; i += 1) {
+            rows.push(rowNodes[i]);
+            tableBody.removeChild(rowNodes[i]);
+        }
+
+        rows.sort(finalSorter);
+
+        for (i = 0; i < rows.length; i += 1) {
+            tableBody.appendChild(rows[i]);
+        }
+    }
+    // removes sort indicators for current column being sorted
+    function removeSortIndicators() {
+        var col = getNthColumn(currentSort.index),
+            cls = col.className;
+
+        cls = cls.replace(/ sorted$/, '').replace(/ sorted-desc$/, '');
+        col.className = cls;
+    }
+    // adds sort indicators for current column being sorted
+    function addSortIndicators() {
+        getNthColumn(currentSort.index).className += currentSort.desc
+            ? ' sorted-desc'
+            : ' sorted';
+    }
+    // adds event listeners for all sorter widgets
+    function enableUI() {
+        var i,
+            el,
+            ithSorter = function ithSorter(i) {
+                var col = cols[i];
+
+                return function() {
+                    var desc = col.defaultDescSort;
+
+                    if (currentSort.index === i) {
+                        desc = !currentSort.desc;
+                    }
+                    sortByIndex(i, desc);
+                    removeSortIndicators();
+                    currentSort.index = i;
+                    currentSort.desc = desc;
+                    addSortIndicators();
+                };
+            };
+        for (i = 0; i < cols.length; i += 1) {
+            if (cols[i].sortable) {
+                // add the click event handler on the th so users
+                // dont have to click on those tiny arrows
+                el = getNthColumn(i).querySelector('.sorter').parentElement;
+                if (el.addEventListener) {
+                    el.addEventListener('click', ithSorter(i));
+                } else {
+                    el.attachEvent('onclick', ithSorter(i));
+                }
+            }
+        }
+    }
+    // adds sorting functionality to the UI
+    return function() {
+        if (!getTable()) {
+            return;
+        }
+        cols = loadColumns();
+        loadData();
+        addSortIndicators();
+        enableUI();
+    };
+})();
+
+window.addEventListener('load', addSorting);
diff --git a/node_modules/seedrandom/coverage/lcov.info b/node_modules/seedrandom/coverage/lcov.info
new file mode 100644
index 0000000..bf8175d
--- /dev/null
+++ b/node_modules/seedrandom/coverage/lcov.info
@@ -0,0 +1,799 @@
+TN:
+SF:/home/davidbau/git/seedrandom/seedrandom.js
+FN:25,(anonymous_0)
+FN:44,seedrandom
+FN:58,(anonymous_2)
+FN:75,(anonymous_3)
+FN:76,(anonymous_4)
+FN:84,(anonymous_5)
+FN:89,(anonymous_6)
+FN:116,ARC4
+FN:133,(anonymous_8)
+FN:153,copy
+FN:164,flatten
+FN:179,mixkey
+FN:193,autoseed
+FN:215,tostring
+FN:239,(anonymous_14)
+FNF:15
+FNH:14
+FNDA:6,(anonymous_0)
+FNDA:23,seedrandom
+FNDA:3694,(anonymous_2)
+FNDA:1025,(anonymous_3)
+FNDA:4100001,(anonymous_4)
+FNDA:20,(anonymous_5)
+FNDA:2,(anonymous_6)
+FNDA:23,ARC4
+FNDA:4108660,(anonymous_8)
+FNDA:4,copy
+FNDA:32,flatten
+FNDA:52,mixkey
+FNDA:4,autoseed
+FNDA:81,tostring
+FNDA:0,(anonymous_14)
+DA:25,6
+DA:30,6
+DA:31,6
+DA:32,6
+DA:33,6
+DA:34,6
+DA:35,6
+DA:36,6
+DA:37,6
+DA:45,23
+DA:46,23
+DA:49,23
+DA:54,23
+DA:58,23
+DA:59,3694
+DA:60,3694
+DA:61,3694
+DA:62,3694
+DA:63,3917
+DA:64,3917
+DA:65,3917
+DA:67,3694
+DA:68,9249
+DA:69,9249
+DA:70,9249
+DA:72,3694
+DA:75,1025
+DA:76,4100001
+DA:77,23
+DA:80,23
+DA:83,23
+DA:85,20
+DA:87,4
+DA:89,4
+DA:94,20
+DA:98,19
+DA:117,23
+DA:118,23
+DA:121,23
+DA:124,23
+DA:125,5888
+DA:127,23
+DA:128,5888
+DA:129,5888
+DA:133,23
+DA:135,4108660
+DA:136,4108660
+DA:137,4108660
+DA:138,16436073
+DA:139,16436073
+DA:141,4108660
+DA:142,4108660
+DA:154,4
+DA:155,4
+DA:156,4
+DA:157,4
+DA:165,32
+DA:166,32
+DA:167,4
+DA:168,9
+DA:171,32
+DA:180,52
+DA:181,52
+DA:182,7735
+DA:185,52
+DA:194,4
+DA:196,4
+DA:198,3
+DA:200,1
+DA:201,1
+DA:203,3
+DA:205,1
+DA:206,1
+DA:207,1
+DA:216,81
+DA:226,6
+DA:232,6
+DA:233,6
+DA:235,6
+DA:236,6
+DA:238,0
+DA:239,0
+DA:242,0
+LF:83
+LH:80
+BRDA:46,0,0,1
+BRDA:46,0,1,22
+BRDA:46,1,0,22
+BRDA:46,1,1,11
+BRDA:50,2,0,2
+BRDA:50,2,1,21
+BRDA:51,3,0,4
+BRDA:51,3,1,17
+BRDA:83,4,0,23
+BRDA:83,4,1,21
+BRDA:83,4,2,20
+BRDA:85,5,0,4
+BRDA:85,5,1,16
+BRDA:87,6,0,2
+BRDA:87,6,1,2
+BRDA:94,7,0,1
+BRDA:94,7,1,19
+BRDA:102,8,0,4
+BRDA:102,8,1,19
+BRDA:121,9,0,1
+BRDA:121,9,1,22
+BRDA:166,10,0,4
+BRDA:166,10,1,28
+BRDA:166,11,0,32
+BRDA:166,11,1,32
+BRDA:171,12,0,3
+BRDA:171,12,1,29
+BRDA:171,13,0,23
+BRDA:171,13,1,6
+BRDA:196,14,0,3
+BRDA:196,14,1,1
+BRDA:196,15,0,4
+BRDA:196,15,1,3
+BRDA:201,16,0,1
+BRDA:201,16,1,1
+BRDA:206,17,0,1
+BRDA:206,17,1,0
+BRDA:232,18,0,6
+BRDA:232,18,1,0
+BRDA:232,19,0,6
+BRDA:232,19,1,6
+BRDA:238,20,0,0
+BRDA:238,20,1,0
+BRDA:238,21,0,0
+BRDA:238,21,1,0
+BRDA:250,22,0,0
+BRDA:250,22,1,6
+BRF:47
+BRH:40
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/alea.js
+FN:28,(anonymous_0)
+FN:30,Alea
+FN:33,(anonymous_2)
+FN:54,copy
+FN:62,impl
+FN:66,(anonymous_5)
+FN:67,(anonymous_6)
+FN:73,(anonymous_7)
+FN:78,Mash
+FN:81,(anonymous_9)
+FN:103,(anonymous_10)
+FNF:11
+FNH:10
+FNDA:1,(anonymous_0)
+FNDA:3,Alea
+FNDA:4105129,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:1025,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:3,Mash
+FNDA:18,(anonymous_9)
+FNDA:0,(anonymous_10)
+DA:28,1
+DA:31,3
+DA:33,3
+DA:34,4105129
+DA:35,4105129
+DA:36,4105129
+DA:37,4105129
+DA:41,3
+DA:42,3
+DA:43,3
+DA:44,3
+DA:45,3
+DA:46,3
+DA:47,3
+DA:48,3
+DA:49,3
+DA:50,3
+DA:51,3
+DA:55,2
+DA:56,2
+DA:57,2
+DA:58,2
+DA:59,2
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,1025
+DA:67,3
+DA:68,1025
+DA:70,3
+DA:71,3
+DA:72,2
+DA:73,2
+DA:75,3
+DA:79,3
+DA:81,3
+DA:82,18
+DA:83,18
+DA:84,33
+DA:85,33
+DA:86,33
+DA:87,33
+DA:88,33
+DA:89,33
+DA:90,33
+DA:91,33
+DA:93,18
+DA:96,3
+DA:100,1
+DA:101,1
+DA:102,0
+DA:103,0
+DA:105,0
+LF:53
+LH:50
+BRDA:46,0,0,1
+BRDA:46,0,1,2
+BRDA:48,1,0,3
+BRDA:48,1,1,0
+BRDA:50,2,0,0
+BRDA:50,2,1,3
+BRDA:64,3,0,3
+BRDA:64,3,1,2
+BRDA:71,4,0,2
+BRDA:71,4,1,1
+BRDA:72,5,0,1
+BRDA:72,5,1,1
+BRDA:100,6,0,1
+BRDA:100,6,1,0
+BRDA:100,7,0,1
+BRDA:100,7,1,1
+BRDA:102,8,0,0
+BRDA:102,8,1,0
+BRDA:102,9,0,0
+BRDA:102,9,1,0
+BRDA:110,10,0,1
+BRDA:110,10,1,1
+BRDA:111,11,0,1
+BRDA:111,11,1,0
+BRF:24
+BRH:16
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/tychei.js
+FN:5,(anonymous_0)
+FN:7,XorGen
+FN:11,(anonymous_2)
+FN:60,copy
+FN:68,impl
+FN:71,(anonymous_5)
+FN:72,(anonymous_6)
+FN:84,(anonymous_7)
+FN:92,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105195,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:5,1
+DA:8,3
+DA:11,3
+DA:12,4105195
+DA:13,4105195
+DA:14,4105195
+DA:15,4105195
+DA:16,4105195
+DA:17,4105195
+DA:18,4105195
+DA:19,4105195
+DA:20,4105195
+DA:39,3
+DA:40,3
+DA:41,3
+DA:42,3
+DA:44,3
+DA:46,2
+DA:47,2
+DA:50,1
+DA:54,3
+DA:55,66
+DA:56,66
+DA:61,2
+DA:62,2
+DA:63,2
+DA:64,2
+DA:65,2
+DA:69,3
+DA:70,3
+DA:71,4102054
+DA:72,3
+DA:73,1025
+DA:74,1025
+DA:75,1025
+DA:76,1025
+DA:78,1025
+DA:80,3
+DA:81,3
+DA:82,3
+DA:83,2
+DA:84,2
+DA:86,3
+DA:89,1
+DA:90,1
+DA:91,0
+DA:92,0
+DA:94,0
+LF:48
+LH:45
+BRDA:44,0,0,2
+BRDA:44,0,1,1
+BRDA:70,1,0,3
+BRDA:70,1,1,2
+BRDA:82,2,0,2
+BRDA:82,2,1,1
+BRDA:83,3,0,1
+BRDA:83,3,1,1
+BRDA:89,4,0,1
+BRDA:89,4,1,0
+BRDA:89,5,0,1
+BRDA:89,5,1,1
+BRDA:91,6,0,0
+BRDA:91,6,1,0
+BRDA:91,7,0,0
+BRDA:91,7,1,0
+BRDA:99,8,0,1
+BRDA:99,8,1,1
+BRDA:100,9,0,1
+BRDA:100,9,1,0
+BRF:20
+BRH:14
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xor128.js
+FN:4,(anonymous_0)
+FN:6,XorGen
+FN:15,(anonymous_2)
+FN:38,copy
+FN:46,impl
+FN:49,(anonymous_5)
+FN:50,(anonymous_6)
+FN:62,(anonymous_7)
+FN:70,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105327,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:4,1
+DA:7,3
+DA:9,3
+DA:10,3
+DA:11,3
+DA:12,3
+DA:15,3
+DA:16,4105327
+DA:17,4105327
+DA:18,4105327
+DA:19,4105327
+DA:20,4105327
+DA:23,3
+DA:25,2
+DA:28,1
+DA:32,3
+DA:33,198
+DA:34,198
+DA:39,2
+DA:40,2
+DA:41,2
+DA:42,2
+DA:43,2
+DA:47,3
+DA:48,3
+DA:49,4102054
+DA:50,3
+DA:51,1025
+DA:52,1025
+DA:53,1025
+DA:54,1025
+DA:56,1025
+DA:58,3
+DA:59,3
+DA:60,3
+DA:61,2
+DA:62,2
+DA:64,3
+DA:67,1
+DA:68,1
+DA:69,0
+DA:70,0
+DA:72,0
+LF:43
+LH:40
+BRDA:23,0,0,2
+BRDA:23,0,1,1
+BRDA:48,1,0,3
+BRDA:48,1,1,2
+BRDA:60,2,0,2
+BRDA:60,2,1,1
+BRDA:61,3,0,1
+BRDA:61,3,1,1
+BRDA:67,4,0,1
+BRDA:67,4,1,0
+BRDA:67,5,0,1
+BRDA:67,5,1,1
+BRDA:69,6,0,0
+BRDA:69,6,1,0
+BRDA:69,7,0,0
+BRDA:69,7,1,0
+BRDA:77,8,0,1
+BRDA:77,8,1,1
+BRDA:78,9,0,1
+BRDA:78,9,1,0
+BRF:20
+BRH:14
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xor4096.js
+FN:26,(anonymous_0)
+FN:28,XorGen
+FN:32,(anonymous_2)
+FN:51,init
+FN:105,copy
+FN:112,impl
+FN:116,(anonymous_6)
+FN:117,(anonymous_7)
+FN:129,(anonymous_8)
+FN:137,(anonymous_9)
+FNF:10
+FNH:9
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105129,(anonymous_2)
+FNDA:3,init
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_6)
+FNDA:1025,(anonymous_7)
+FNDA:1,(anonymous_8)
+FNDA:0,(anonymous_9)
+DA:26,1
+DA:29,3
+DA:32,3
+DA:33,4105129
+DA:34,4105129
+DA:36,4105129
+DA:38,4105129
+DA:39,4105129
+DA:40,4105129
+DA:41,4105129
+DA:42,4105129
+DA:43,4105129
+DA:45,4105129
+DA:46,4105129
+DA:48,4105129
+DA:52,3
+DA:53,3
+DA:55,2
+DA:56,2
+DA:59,1
+DA:60,1
+DA:61,1
+DA:64,3
+DA:66,480
+DA:68,480
+DA:69,480
+DA:70,480
+DA:71,480
+DA:72,480
+DA:73,480
+DA:74,384
+DA:75,384
+DA:76,384
+DA:80,3
+DA:81,0
+DA:86,3
+DA:87,3
+DA:88,1536
+DA:89,1536
+DA:90,1536
+DA:91,1536
+DA:92,1536
+DA:93,1536
+DA:94,1536
+DA:97,3
+DA:98,3
+DA:99,3
+DA:102,3
+DA:106,2
+DA:107,2
+DA:108,2
+DA:109,2
+DA:113,3
+DA:114,3
+DA:115,3
+DA:116,4102054
+DA:117,3
+DA:118,1025
+DA:119,1025
+DA:120,1025
+DA:121,1025
+DA:123,1025
+DA:125,3
+DA:126,3
+DA:127,3
+DA:128,2
+DA:129,2
+DA:131,3
+DA:134,1
+DA:135,1
+DA:136,0
+DA:137,0
+DA:139,0
+LF:73
+LH:69
+BRDA:53,0,0,2
+BRDA:53,0,1,1
+BRDA:66,1,0,160
+BRDA:66,1,1,320
+BRDA:68,2,0,3
+BRDA:68,2,1,477
+BRDA:73,3,0,384
+BRDA:73,3,1,96
+BRDA:76,4,0,0
+BRDA:76,4,1,384
+BRDA:80,5,0,0
+BRDA:80,5,1,3
+BRDA:81,6,0,0
+BRDA:81,6,1,0
+BRDA:81,6,2,0
+BRDA:113,7,0,0
+BRDA:113,7,1,3
+BRDA:115,8,0,3
+BRDA:115,8,1,2
+BRDA:127,9,0,2
+BRDA:127,9,1,1
+BRDA:128,10,0,1
+BRDA:128,10,1,1
+BRDA:134,11,0,1
+BRDA:134,11,1,0
+BRDA:134,12,0,1
+BRDA:134,12,1,1
+BRDA:136,13,0,0
+BRDA:136,13,1,0
+BRDA:136,14,0,0
+BRDA:136,14,1,0
+BRDA:144,15,0,1
+BRDA:144,15,1,1
+BRDA:145,16,0,1
+BRDA:145,16,1,0
+BRF:35
+BRH:23
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xorshift7.js
+FN:6,(anonymous_0)
+FN:8,XorGen
+FN:12,(anonymous_2)
+FN:25,init
+FN:56,copy
+FN:62,impl
+FN:66,(anonymous_6)
+FN:67,(anonymous_7)
+FN:79,(anonymous_8)
+FN:87,(anonymous_9)
+FNF:10
+FNH:9
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105897,(anonymous_2)
+FNDA:3,init
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_6)
+FNDA:1025,(anonymous_7)
+FNDA:1,(anonymous_8)
+FNDA:0,(anonymous_9)
+DA:6,1
+DA:9,3
+DA:12,3
+DA:14,4105897
+DA:15,4105897
+DA:16,4105897
+DA:17,4105897
+DA:18,4105897
+DA:19,4105897
+DA:20,4105897
+DA:21,4105897
+DA:22,4105897
+DA:26,3
+DA:28,3
+DA:30,2
+DA:33,1
+DA:34,1
+DA:35,6
+DA:40,16
+DA:41,3
+DA:42,3
+DA:44,3
+DA:45,3
+DA:48,3
+DA:49,768
+DA:53,3
+DA:57,2
+DA:58,2
+DA:59,2
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,4102054
+DA:67,3
+DA:68,1025
+DA:69,1025
+DA:70,1025
+DA:71,1025
+DA:73,1025
+DA:75,3
+DA:76,3
+DA:77,3
+DA:78,2
+DA:79,2
+DA:81,3
+DA:84,1
+DA:85,1
+DA:86,0
+DA:87,0
+DA:89,0
+LF:50
+LH:47
+BRDA:28,0,0,2
+BRDA:28,0,1,1
+BRDA:41,1,0,19
+BRDA:41,1,1,17
+BRDA:42,2,0,2
+BRDA:42,2,1,1
+BRDA:63,3,0,0
+BRDA:63,3,1,3
+BRDA:65,4,0,3
+BRDA:65,4,1,2
+BRDA:77,5,0,2
+BRDA:77,5,1,1
+BRDA:78,6,0,1
+BRDA:78,6,1,1
+BRDA:84,7,0,1
+BRDA:84,7,1,0
+BRDA:84,8,0,1
+BRDA:84,8,1,1
+BRDA:86,9,0,0
+BRDA:86,9,1,0
+BRDA:86,10,0,0
+BRDA:86,10,1,0
+BRDA:94,11,0,1
+BRDA:94,11,1,1
+BRDA:95,12,0,1
+BRDA:95,12,1,0
+BRF:26
+BRH:19
+end_of_record
+TN:
+SF:/home/davidbau/git/seedrandom/lib/xorwow.js
+FN:4,(anonymous_0)
+FN:6,XorGen
+FN:10,(anonymous_2)
+FN:41,copy
+FN:51,impl
+FN:54,(anonymous_5)
+FN:55,(anonymous_6)
+FN:67,(anonymous_7)
+FN:75,(anonymous_8)
+FNF:9
+FNH:8
+FNDA:1,(anonymous_0)
+FNDA:3,XorGen
+FNDA:4105327,(anonymous_2)
+FNDA:2,copy
+FNDA:3,impl
+FNDA:4102054,(anonymous_5)
+FNDA:1025,(anonymous_6)
+FNDA:1,(anonymous_7)
+FNDA:0,(anonymous_8)
+DA:4,1
+DA:7,3
+DA:10,3
+DA:11,4105327
+DA:12,4105327
+DA:13,4105327
+DA:17,3
+DA:18,3
+DA:19,3
+DA:20,3
+DA:21,3
+DA:23,3
+DA:25,2
+DA:28,1
+DA:32,3
+DA:33,198
+DA:34,198
+DA:35,3
+DA:37,198
+DA:42,2
+DA:43,2
+DA:44,2
+DA:45,2
+DA:46,2
+DA:47,2
+DA:48,2
+DA:52,3
+DA:53,3
+DA:54,4102054
+DA:55,3
+DA:56,1025
+DA:57,1025
+DA:58,1025
+DA:59,1025
+DA:61,1025
+DA:63,3
+DA:64,3
+DA:65,3
+DA:66,2
+DA:67,2
+DA:69,3
+DA:72,1
+DA:73,1
+DA:74,0
+DA:75,0
+DA:77,0
+LF:46
+LH:43
+BRDA:23,0,0,2
+BRDA:23,0,1,1
+BRDA:34,1,0,3
+BRDA:34,1,1,195
+BRDA:53,2,0,3
+BRDA:53,2,1,2
+BRDA:65,3,0,2
+BRDA:65,3,1,1
+BRDA:66,4,0,1
+BRDA:66,4,1,1
+BRDA:72,5,0,1
+BRDA:72,5,1,0
+BRDA:72,6,0,1
+BRDA:72,6,1,1
+BRDA:74,7,0,0
+BRDA:74,7,1,0
+BRDA:74,8,0,0
+BRDA:74,8,1,0
+BRDA:82,9,0,1
+BRDA:82,9,1,1
+BRDA:83,10,0,1
+BRDA:83,10,1,0
+BRF:22
+BRH:16
+end_of_record
diff --git a/node_modules/seedrandom/index.js b/node_modules/seedrandom/index.js
new file mode 100644
index 0000000..513669a
--- /dev/null
+++ b/node_modules/seedrandom/index.js
@@ -0,0 +1,60 @@
+// A library of seedable RNGs implemented in Javascript.
+//
+// Usage:
+//
+// var seedrandom = require('seedrandom');
+// var random = seedrandom(1); // or any seed.
+// var x = random();       // 0 <= x < 1.  Every bit is random.
+// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.
+
+// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.
+// Period: ~2^116
+// Reported to pass all BigCrush tests.
+var alea = require('./lib/alea');
+
+// xor128, a pure xor-shift generator by George Marsaglia.
+// Period: 2^128-1.
+// Reported to fail: MatrixRank and LinearComp.
+var xor128 = require('./lib/xor128');
+
+// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.
+// Period: 2^192-2^32
+// Reported to fail: CollisionOver, SimpPoker, and LinearComp.
+var xorwow = require('./lib/xorwow');
+
+// xorshift7, by François Panneton and Pierre L'ecuyer, takes
+// a different approach: it adds robustness by allowing more shifts
+// than Marsaglia's original three.  It is a 7-shift generator
+// with 256 bits, that passes BigCrush with no systmatic failures.
+// Period 2^256-1.
+// No systematic BigCrush failures reported.
+var xorshift7 = require('./lib/xorshift7');
+
+// xor4096, by Richard Brent, is a 4096-bit xor-shift with a
+// very long period that also adds a Weyl generator. It also passes
+// BigCrush with no systematic failures.  Its long period may
+// be useful if you have many generators and need to avoid
+// collisions.
+// Period: 2^4128-2^32.
+// No systematic BigCrush failures reported.
+var xor4096 = require('./lib/xor4096');
+
+// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random
+// number generator derived from ChaCha, a modern stream cipher.
+// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+// Period: ~2^127
+// No systematic BigCrush failures reported.
+var tychei = require('./lib/tychei');
+
+// The original ARC4-based prng included in this library.
+// Period: ~2^1600
+var sr = require('./seedrandom');
+
+sr.alea = alea;
+sr.xor128 = xor128;
+sr.xorwow = xorwow;
+sr.xorshift7 = xorshift7;
+sr.xor4096 = xor4096;
+sr.tychei = tychei;
+
+module.exports = sr;
diff --git a/node_modules/seedrandom/lib/alea.js b/node_modules/seedrandom/lib/alea.js
new file mode 100644
index 0000000..478b956
--- /dev/null
+++ b/node_modules/seedrandom/lib/alea.js
@@ -0,0 +1,114 @@
+// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010
+// http://baagoe.com/en/RandomMusings/javascript/
+// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror
+// Original work is under MIT license -
+
+// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>
+//
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+//
+// The above copyright notice and this permission notice shall be included in
+// all copies or substantial portions of the Software.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+// THE SOFTWARE.
+
+
+
+(function(global, module, define) {
+
+function Alea(seed) {
+  var me = this, mash = Mash();
+
+  me.next = function() {
+    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32
+    me.s0 = me.s1;
+    me.s1 = me.s2;
+    return me.s2 = t - (me.c = t | 0);
+  };
+
+  // Apply the seeding algorithm from Baagoe.
+  me.c = 1;
+  me.s0 = mash(' ');
+  me.s1 = mash(' ');
+  me.s2 = mash(' ');
+  me.s0 -= mash(seed);
+  if (me.s0 < 0) { me.s0 += 1; }
+  me.s1 -= mash(seed);
+  if (me.s1 < 0) { me.s1 += 1; }
+  me.s2 -= mash(seed);
+  if (me.s2 < 0) { me.s2 += 1; }
+  mash = null;
+}
+
+function copy(f, t) {
+  t.c = f.c;
+  t.s0 = f.s0;
+  t.s1 = f.s1;
+  t.s2 = f.s2;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new Alea(seed),
+      state = opts && opts.state,
+      prng = xg.next;
+  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }
+  prng.double = function() {
+    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53
+  };
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+function Mash() {
+  var n = 0xefc8249d;
+
+  var mash = function(data) {
+    data = String(data);
+    for (var i = 0; i < data.length; i++) {
+      n += data.charCodeAt(i);
+      var h = 0.02519603282416938 * n;
+      n = h >>> 0;
+      h -= n;
+      h *= n;
+      n = h >>> 0;
+      h -= n;
+      n += h * 0x100000000; // 2^32
+    }
+    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32
+  };
+
+  return mash;
+}
+
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.alea = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/alea.min.js b/node_modules/seedrandom/lib/alea.min.js
new file mode 100644
index 0000000..be30a46
--- /dev/null
+++ b/node_modules/seedrandom/lib/alea.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function u(n){var t=this,e=function(){var s=4022871197;return function(n){n=String(n);for(var t=0;t<n.length;t++){var e=.02519603282416938*(s+=n.charCodeAt(t));e-=s=e>>>0,s=(e*=s)>>>0,s+=4294967296*(e-=s)}return 2.3283064365386963e-10*(s>>>0)}}();t.next=function(){var n=2091639*t.s0+2.3283064365386963e-10*t.c;return t.s0=t.s1,t.s1=t.s2,t.s2=n-(t.c=0|n)},t.c=1,t.s0=e(" "),t.s1=e(" "),t.s2=e(" "),t.s0-=e(n),t.s0<0&&(t.s0+=1),t.s1-=e(n),t.s1<0&&(t.s1+=1),t.s2-=e(n),t.s2<0&&(t.s2+=1),e=null}function o(n,t){return t.c=n.c,t.s0=n.s0,t.s1=n.s1,t.s2=n.s2,t}function s(n,t){var e=new u(n),s=t&&t.state,r=e.next;return r.int32=function(){return 4294967296*e.next()|0},r.double=function(){return r()+11102230246251565e-32*(2097152*r()|0)},r.quick=r,s&&("object"==typeof s&&o(s,e),r.state=function(){return o(e,{})}),r}t&&t.exports?t.exports=s:e&&e.amd?e(function(){return s}):this.alea=s}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/crypto.js b/node_modules/seedrandom/lib/crypto.js
new file mode 100644
index 0000000..18ee91f
--- /dev/null
+++ b/node_modules/seedrandom/lib/crypto.js
@@ -0,0 +1,11 @@
+// mimic a subset of node's crypto API for the browser
+
+function randomBytes(width) {
+  var out = new Uint8Array(width);
+  (global.crypto || global.msCrypto).getRandomValues(out);
+  return out;
+}
+
+module.exports = {
+  randomBytes: randomBytes
+}
diff --git a/node_modules/seedrandom/lib/tychei.js b/node_modules/seedrandom/lib/tychei.js
new file mode 100644
index 0000000..3d0ddd4
--- /dev/null
+++ b/node_modules/seedrandom/lib/tychei.js
@@ -0,0 +1,103 @@
+// A Javascript implementaion of the "Tyche-i" prng algorithm by
+// Samuel Neves and Filipe Araujo.
+// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  // Set up generator function.
+  me.next = function() {
+    var b = me.b, c = me.c, d = me.d, a = me.a;
+    b = (b << 25) ^ (b >>> 7) ^ c;
+    c = (c - d) | 0;
+    d = (d << 24) ^ (d >>> 8) ^ a;
+    a = (a - b) | 0;
+    me.b = b = (b << 20) ^ (b >>> 12) ^ c;
+    me.c = c = (c - d) | 0;
+    me.d = (d << 16) ^ (c >>> 16) ^ a;
+    return me.a = (a - b) | 0;
+  };
+
+  /* The following is non-inverted tyche, which has better internal
+   * bit diffusion, but which is about 25% slower than tyche-i in JS.
+  me.next = function() {
+    var a = me.a, b = me.b, c = me.c, d = me.d;
+    a = (me.a + me.b | 0) >>> 0;
+    d = me.d ^ a; d = d << 16 ^ d >>> 16;
+    c = me.c + d | 0;
+    b = me.b ^ c; b = b << 12 ^ d >>> 20;
+    me.a = a = a + b | 0;
+    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;
+    me.c = c = c + d | 0;
+    b = b ^ c;
+    return me.b = (b << 7 ^ b >>> 25);
+  }
+  */
+
+  me.a = 0;
+  me.b = 0;
+  me.c = 2654435769 | 0;
+  me.d = 1367130551;
+
+  if (seed === Math.floor(seed)) {
+    // Integer seed.
+    me.a = (seed / 0x100000000) | 0;
+    me.b = seed | 0;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 20; k++) {
+    me.b ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.a = f.a;
+  t.b = f.b;
+  t.c = f.c;
+  t.d = f.d;
+  return t;
+};
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.tychei = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/tychei.min.js b/node_modules/seedrandom/lib/tychei.min.js
new file mode 100644
index 0000000..fa24abb
--- /dev/null
+++ b/node_modules/seedrandom/lib/tychei.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var r=this,n="";r.next=function(){var t=r.b,n=r.c,e=r.d,o=r.a;return t=t<<25^t>>>7^n,n=n-e|0,e=e<<24^e>>>8^o,o=o-t|0,r.b=t=t<<20^t>>>12^n,r.c=n=n-e|0,r.d=e<<16^n>>>16^o,r.a=o-t|0},r.a=0,r.b=0,r.c=-1640531527,r.d=1367130551,t===Math.floor(t)?(r.a=t/4294967296|0,r.b=0|t):n+=t;for(var e=0;e<n.length+20;e++)r.b^=0|n.charCodeAt(e),r.next()}function c(t,n){return n.a=t.a,n.b=t.b,n.c=t.c,n.d=t.d,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&c(r,o),e.state=function(){return c(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.tychei=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xor128.js b/node_modules/seedrandom/lib/xor128.js
new file mode 100644
index 0000000..c461934
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor128.js
@@ -0,0 +1,81 @@
+// A Javascript implementaion of the "xor128" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+
+  // Set up generator function.
+  me.next = function() {
+    var t = me.x ^ (me.x << 11);
+    me.x = me.y;
+    me.y = me.z;
+    me.z = me.w;
+    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);
+  };
+
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xor128 = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/xor128.min.js b/node_modules/seedrandom/lib/xor128.min.js
new file mode 100644
index 0000000..bd60553
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor128.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var n=this,e="";n.x=0,n.y=0,n.z=0,n.w=0,n.next=function(){var t=n.x^n.x<<11;return n.x=n.y,n.y=n.z,n.z=n.w,n.w^=n.w>>>19^t^t>>>8},t===(0|t)?n.x=t:e+=t;for(var o=0;o<e.length+64;o++)n.x^=0|e.charCodeAt(o),n.next()}function i(t,n){return n.x=t.x,n.y=t.y,n.z=t.z,n.w=t.w,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&i(r,o),e.state=function(){return i(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.xor128=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xor4096.js b/node_modules/seedrandom/lib/xor4096.js
new file mode 100644
index 0000000..6adf19f
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor4096.js
@@ -0,0 +1,146 @@
+// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.
+//
+// This fast non-cryptographic random number generator is designed for
+// use in Monte-Carlo algorithms. It combines a long-period xorshift
+// generator with a Weyl generator, and it passes all common batteries
+// of stasticial tests for randomness while consuming only a few nanoseconds
+// for each prng generated.  For background on the generator, see Brent's
+// paper: "Some long-period random number generators using shifts and xors."
+// http://arxiv.org/pdf/1004.3115v1.pdf
+//
+// Usage:
+//
+// var xor4096 = require('xor4096');
+// random = xor4096(1);                        // Seed with int32 or string.
+// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.
+// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.
+//
+// For nonzero numeric keys, this impelementation provides a sequence
+// identical to that by Brent's xorgens 3 implementaion in C.  This
+// implementation also provides for initalizing the generator with
+// string seeds, or for saving and restoring the state of the generator.
+//
+// On Chrome, this prng benchmarks about 2.1 times slower than
+// Javascript's built-in Math.random().
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this;
+
+  // Set up generator function.
+  me.next = function() {
+    var w = me.w,
+        X = me.X, i = me.i, t, v;
+    // Update Weyl generator.
+    me.w = w = (w + 0x61c88647) | 0;
+    // Update xor generator.
+    v = X[(i + 34) & 127];
+    t = X[i = ((i + 1) & 127)];
+    v ^= v << 13;
+    t ^= t << 17;
+    v ^= v >>> 15;
+    t ^= t >>> 12;
+    // Update Xor generator array state.
+    v = X[i] = v ^ t;
+    me.i = i;
+    // Result is the combination.
+    return (v + (w ^ (w >>> 16))) | 0;
+  };
+
+  function init(me, seed) {
+    var t, v, i, j, w, X = [], limit = 128;
+    if (seed === (seed | 0)) {
+      // Numeric seeds initialize v, which is used to generates X.
+      v = seed;
+      seed = null;
+    } else {
+      // String seeds are mixed into v and X one character at a time.
+      seed = seed + '\0';
+      v = 0;
+      limit = Math.max(limit, seed.length);
+    }
+    // Initialize circular array and weyl value.
+    for (i = 0, j = -32; j < limit; ++j) {
+      // Put the unicode characters into the array, and shuffle them.
+      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);
+      // After 32 shuffles, take v as the starting w value.
+      if (j === 0) w = v;
+      v ^= v << 10;
+      v ^= v >>> 15;
+      v ^= v << 4;
+      v ^= v >>> 13;
+      if (j >= 0) {
+        w = (w + 0x61c88647) | 0;     // Weyl.
+        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.
+        i = (0 == t) ? i + 1 : 0;     // Count zeroes.
+      }
+    }
+    // We have detected all zeroes; make the key nonzero.
+    if (i >= 128) {
+      X[(seed && seed.length || 0) & 127] = -1;
+    }
+    // Run the generator 512 times to further mix the state before using it.
+    // Factoring this as a function slows the main generator, so it is just
+    // unrolled here.  The weyl generator is not advanced while warming up.
+    i = 127;
+    for (j = 4 * 128; j > 0; --j) {
+      v = X[(i + 34) & 127];
+      t = X[i = ((i + 1) & 127)];
+      v ^= v << 13;
+      t ^= t << 17;
+      v ^= v >>> 15;
+      t ^= t >>> 12;
+      X[i] = v ^ t;
+    }
+    // Storing state as object members is faster than using closure variables.
+    me.w = w;
+    me.X = X;
+    me.i = i;
+  }
+
+  init(me, seed);
+}
+
+function copy(f, t) {
+  t.i = f.i;
+  t.w = f.w;
+  t.X = f.X.slice();
+  return t;
+};
+
+function impl(seed, opts) {
+  if (seed == null) seed = +(new Date);
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.X) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xor4096 = impl;
+}
+
+})(
+  this,                                     // window object or global
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
diff --git a/node_modules/seedrandom/lib/xor4096.min.js b/node_modules/seedrandom/lib/xor4096.min.js
new file mode 100644
index 0000000..fee9f8a
--- /dev/null
+++ b/node_modules/seedrandom/lib/xor4096.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function o(n){var o=this;o.next=function(){var n,t,e=o.w,r=o.X,i=o.i;return o.w=e=e+1640531527|0,t=r[i+34&127],n=r[i=i+1&127],t^=t<<13,n^=n<<17,t^=t>>>15,n^=n>>>12,t=r[i]=t^n,o.i=i,t+(e^e>>>16)|0},function(n,t){var e,r,i,o,u,f=[],c=128;for(t===(0|t)?(r=t,t=null):(t+="\0",r=0,c=Math.max(c,t.length)),i=0,o=-32;o<c;++o)t&&(r^=t.charCodeAt((o+32)%t.length)),0===o&&(u=r),r^=r<<10,r^=r>>>15,r^=r<<4,r^=r>>>13,0<=o&&(u=u+1640531527|0,i=0==(e=f[127&o]^=r+u)?i+1:0);for(128<=i&&(f[127&(t&&t.length||0)]=-1),i=127,o=512;0<o;--o)r=f[i+34&127],e=f[i=i+1&127],r^=r<<13,e^=e<<17,r^=r>>>15,e^=e>>>12,f[i]=r^e;n.w=u,n.X=f,n.i=i}(o,n)}function u(n,t){return t.i=n.i,t.w=n.w,t.X=n.X.slice(),t}function r(n,t){null==n&&(n=+new Date);function e(){return(r.next()>>>0)/4294967296}var r=new o(n),i=t&&t.state;return e.double=function(){do{var n=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===n);return n},e.int32=r.next,e.quick=e,i&&(i.X&&u(i,r),e.state=function(){return u(r,{})}),e}t&&t.exports?t.exports=r:e&&e.amd?e(function(){return r}):this.xor4096=r}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xorshift7.js b/node_modules/seedrandom/lib/xorshift7.js
new file mode 100644
index 0000000..b7e5151
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorshift7.js
@@ -0,0 +1,97 @@
+// A Javascript implementaion of the "xorshift7" algorithm by
+// François Panneton and Pierre L'ecuyer:
+// "On the Xorgshift Random Number Generators"
+// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this;
+
+  // Set up generator function.
+  me.next = function() {
+    // Update xor generator.
+    var X = me.x, i = me.i, t, v, w;
+    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);
+    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);
+    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);
+    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);
+    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);
+    X[i] = v;
+    me.i = (i + 1) & 7;
+    return v;
+  };
+
+  function init(me, seed) {
+    var j, w, X = [];
+
+    if (seed === (seed | 0)) {
+      // Seed state array using a 32-bit integer.
+      w = X[0] = seed;
+    } else {
+      // Seed state using a string.
+      seed = '' + seed;
+      for (j = 0; j < seed.length; ++j) {
+        X[j & 7] = (X[j & 7] << 15) ^
+            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);
+      }
+    }
+    // Enforce an array length of 8, not all zeroes.
+    while (X.length < 8) X.push(0);
+    for (j = 0; j < 8 && X[j] === 0; ++j);
+    if (j == 8) w = X[7] = -1; else w = X[j];
+
+    me.x = X;
+    me.i = 0;
+
+    // Discard an initial 256 values.
+    for (j = 256; j > 0; --j) {
+      me.next();
+    }
+  }
+
+  init(me, seed);
+}
+
+function copy(f, t) {
+  t.x = f.x.slice();
+  t.i = f.i;
+  return t;
+}
+
+function impl(seed, opts) {
+  if (seed == null) seed = +(new Date);
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (state.x) copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xorshift7 = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
diff --git a/node_modules/seedrandom/lib/xorshift7.min.js b/node_modules/seedrandom/lib/xorshift7.min.js
new file mode 100644
index 0000000..c6db5f6
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorshift7.min.js
@@ -0,0 +1 @@
+!function(n,t,e){function o(n){var i=this;i.next=function(){var n,t,e=i.x,r=i.i;return n=e[r],t=(n^=n>>>7)^n<<24,t^=(n=e[r+1&7])^n>>>10,t^=(n=e[r+3&7])^n>>>3,t^=(n=e[r+4&7])^n<<7,n=e[r+7&7],t^=(n^=n<<13)^n<<9,e[r]=t,i.i=r+1&7,t},function(n,t){var e,r=[];if(t===(0|t))r[0]=t;else for(t=""+t,e=0;e<t.length;++e)r[7&e]=r[7&e]<<15^t.charCodeAt(e)+r[e+1&7]<<13;for(;r.length<8;)r.push(0);for(e=0;e<8&&0===r[e];++e);for(8==e?r[7]=-1:r[e],n.x=r,n.i=0,e=256;0<e;--e)n.next()}(i,n)}function u(n,t){return t.x=n.x.slice(),t.i=n.i,t}function r(n,t){null==n&&(n=+new Date);function e(){return(r.next()>>>0)/4294967296}var r=new o(n),i=t&&t.state;return e.double=function(){do{var n=((r.next()>>>11)+(r.next()>>>0)/4294967296)/(1<<21)}while(0===n);return n},e.int32=r.next,e.quick=e,i&&(i.x&&u(i,r),e.state=function(){return u(r,{})}),e}t&&t.exports?t.exports=r:e&&e.amd?e(function(){return r}):this.xorshift7=r}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/lib/xorwow.js b/node_modules/seedrandom/lib/xorwow.js
new file mode 100644
index 0000000..79d5e44
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorwow.js
@@ -0,0 +1,86 @@
+// A Javascript implementaion of the "xorwow" prng algorithm by
+// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper
+
+(function(global, module, define) {
+
+function XorGen(seed) {
+  var me = this, strseed = '';
+
+  // Set up generator function.
+  me.next = function() {
+    var t = (me.x ^ (me.x >>> 2));
+    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;
+    return (me.d = (me.d + 362437 | 0)) +
+       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;
+  };
+
+  me.x = 0;
+  me.y = 0;
+  me.z = 0;
+  me.w = 0;
+  me.v = 0;
+
+  if (seed === (seed | 0)) {
+    // Integer seed.
+    me.x = seed;
+  } else {
+    // String seed.
+    strseed += seed;
+  }
+
+  // Mix in string seed, then discard an initial batch of 64 values.
+  for (var k = 0; k < strseed.length + 64; k++) {
+    me.x ^= strseed.charCodeAt(k) | 0;
+    if (k == strseed.length) {
+      me.d = me.x << 10 ^ me.x >>> 4;
+    }
+    me.next();
+  }
+}
+
+function copy(f, t) {
+  t.x = f.x;
+  t.y = f.y;
+  t.z = f.z;
+  t.w = f.w;
+  t.v = f.v;
+  t.d = f.d;
+  return t;
+}
+
+function impl(seed, opts) {
+  var xg = new XorGen(seed),
+      state = opts && opts.state,
+      prng = function() { return (xg.next() >>> 0) / 0x100000000; };
+  prng.double = function() {
+    do {
+      var top = xg.next() >>> 11,
+          bot = (xg.next() >>> 0) / 0x100000000,
+          result = (top + bot) / (1 << 21);
+    } while (result === 0);
+    return result;
+  };
+  prng.int32 = xg.next;
+  prng.quick = prng;
+  if (state) {
+    if (typeof(state) == 'object') copy(state, xg);
+    prng.state = function() { return copy(xg, {}); }
+  }
+  return prng;
+}
+
+if (module && module.exports) {
+  module.exports = impl;
+} else if (define && define.amd) {
+  define(function() { return impl; });
+} else {
+  this.xorwow = impl;
+}
+
+})(
+  this,
+  (typeof module) == 'object' && module,    // present in node.js
+  (typeof define) == 'function' && define   // present with an AMD loader
+);
+
+
diff --git a/node_modules/seedrandom/lib/xorwow.min.js b/node_modules/seedrandom/lib/xorwow.min.js
new file mode 100644
index 0000000..be1c626
--- /dev/null
+++ b/node_modules/seedrandom/lib/xorwow.min.js
@@ -0,0 +1 @@
+!function(t,n,e){function u(t){var n=this,e="";n.next=function(){var t=n.x^n.x>>>2;return n.x=n.y,n.y=n.z,n.z=n.w,n.w=n.v,(n.d=n.d+362437|0)+(n.v=n.v^n.v<<4^t^t<<1)|0},n.x=0,n.y=0,n.z=0,n.w=0,t===((n.v=0)|t)?n.x=t:e+=t;for(var o=0;o<e.length+64;o++)n.x^=0|e.charCodeAt(o),o==e.length&&(n.d=n.x<<10^n.x>>>4),n.next()}function x(t,n){return n.x=t.x,n.y=t.y,n.z=t.z,n.w=t.w,n.v=t.v,n.d=t.d,n}function o(t,n){function e(){return(o.next()>>>0)/4294967296}var o=new u(t),r=n&&n.state;return e.double=function(){do{var t=((o.next()>>>11)+(o.next()>>>0)/4294967296)/(1<<21)}while(0===t);return t},e.int32=o.next,e.quick=e,r&&("object"==typeof r&&x(r,o),e.state=function(){return x(o,{})}),e}n&&n.exports?n.exports=o:e&&e.amd?e(function(){return o}):this.xorwow=o}(0,"object"==typeof module&&module,"function"==typeof define&&define);
\ No newline at end of file
diff --git a/node_modules/seedrandom/package.json b/node_modules/seedrandom/package.json
new file mode 100644
index 0000000..86aad13
--- /dev/null
+++ b/node_modules/seedrandom/package.json
@@ -0,0 +1,60 @@
+{
+  "name": "seedrandom",
+  "version": "3.0.5",
+  "description": "Seeded random number generator for Javascript.",
+  "main": "index.js",
+  "jsdelivr": "seedrandom.min.js",
+  "unpkg": "seedrandom.min.js",
+  "keywords": [
+    "seed",
+    "random",
+    "crypto"
+  ],
+  "scripts": {
+    "test": "grunt travis"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/davidbau/seedrandom.git"
+  },
+  "author": "David Bau",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/davidbau/seedrandom/issues"
+  },
+  "homepage": "http://davidbau.com/archives/2010/01/30/random_seeds_coded_hints_and_quintillions.html",
+  "config": {
+    "blanket": {
+      "pattern": [
+        "seedrandom.js",
+        "lib/alea.js",
+        "lib/xor128.js",
+        "lib/xorwow.js",
+        "lib/xorshift7.js",
+        "lib/tychei.js",
+        "lib/xor4096.js"
+      ]
+    }
+  },
+  "browser": {
+    "crypto": false
+  },
+  "devDependencies": {
+    "blanket": "latest",
+    "coveralls": "latest",
+    "grunt": "latest",
+    "grunt-browserify": "latest",
+    "grunt-release": "davidbau/grunt-release",
+    "grunt-cli": "latest",
+    "grunt-contrib-connect": "latest",
+    "grunt-contrib-copy": "latest",
+    "grunt-contrib-qunit": "latest",
+    "grunt-contrib-uglify": "latest",
+    "grunt-mocha-nyc": "latest",
+    "mocha": "latest",
+    "nyc": "latest",
+    "proxyquire": "latest",
+    "qunit": "latest",
+    "requirejs": "latest"
+  }
+}
diff --git a/node_modules/seedrandom/seedrandom.js b/node_modules/seedrandom/seedrandom.js
new file mode 100644
index 0000000..12d7ee1
--- /dev/null
+++ b/node_modules/seedrandom/seedrandom.js
@@ -0,0 +1,253 @@
+/*
+Copyright 2019 David Bau.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+*/
+
+(function (global, pool, math) {
+//
+// The following constants are related to IEEE 754 limits.
+//
+
+var width = 256,        // each RC4 output is 0 <= x < 256
+    chunks = 6,         // at least six RC4 outputs for each double
+    digits = 52,        // there are 52 significant digits in a double
+    rngname = 'random', // rngname: name for Math.random and Math.seedrandom
+    startdenom = math.pow(width, chunks),
+    significance = math.pow(2, digits),
+    overflow = significance * 2,
+    mask = width - 1,
+    nodecrypto;         // node.js crypto module, initialized at the bottom.
+
+//
+// seedrandom()
+// This is the seedrandom function described above.
+//
+function seedrandom(seed, options, callback) {
+  var key = [];
+  options = (options == true) ? { entropy: true } : (options || {});
+
+  // Flatten the seed string or build one from local entropy if needed.
+  var shortseed = mixkey(flatten(
+    options.entropy ? [seed, tostring(pool)] :
+    (seed == null) ? autoseed() : seed, 3), key);
+
+  // Use the seed to initialize an ARC4 generator.
+  var arc4 = new ARC4(key);
+
+  // This function returns a random double in [0, 1) that contains
+  // randomness in every bit of the mantissa of the IEEE 754 value.
+  var prng = function() {
+    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48
+        d = startdenom,                 //   and denominator d = 2 ^ 48.
+        x = 0;                          //   and no 'extra last byte'.
+    while (n < significance) {          // Fill up all significant digits by
+      n = (n + x) * width;              //   shifting numerator and
+      d *= width;                       //   denominator and generating a
+      x = arc4.g(1);                    //   new least-significant-byte.
+    }
+    while (n >= overflow) {             // To avoid rounding up, before adding
+      n /= 2;                           //   last byte, shift everything
+      d /= 2;                           //   right using integer math until
+      x >>>= 1;                         //   we have exactly the desired bits.
+    }
+    return (n + x) / d;                 // Form the number within [0, 1).
+  };
+
+  prng.int32 = function() { return arc4.g(4) | 0; }
+  prng.quick = function() { return arc4.g(4) / 0x100000000; }
+  prng.double = prng;
+
+  // Mix the randomness into accumulated entropy.
+  mixkey(tostring(arc4.S), pool);
+
+  // Calling convention: what to return as a function of prng, seed, is_math.
+  return (options.pass || callback ||
+      function(prng, seed, is_math_call, state) {
+        if (state) {
+          // Load the arc4 state from the given state if it has an S array.
+          if (state.S) { copy(state, arc4); }
+          // Only provide the .state method if requested via options.state.
+          prng.state = function() { return copy(arc4, {}); }
+        }
+
+        // If called as a method of Math (Math.seedrandom()), mutate
+        // Math.random because that is how seedrandom.js has worked since v1.0.
+        if (is_math_call) { math[rngname] = prng; return seed; }
+
+        // Otherwise, it is a newer calling convention, so return the
+        // prng directly.
+        else return prng;
+      })(
+  prng,
+  shortseed,
+  'global' in options ? options.global : (this == math),
+  options.state);
+}
+
+//
+// ARC4
+//
+// An ARC4 implementation.  The constructor takes a key in the form of
+// an array of at most (width) integers that should be 0 <= x < (width).
+//
+// The g(count) method returns a pseudorandom integer that concatenates
+// the next (count) outputs from ARC4.  Its return value is a number x
+// that is in the range 0 <= x < (width ^ count).
+//
+function ARC4(key) {
+  var t, keylen = key.length,
+      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];
+
+  // The empty key [] is treated as [0].
+  if (!keylen) { key = [keylen++]; }
+
+  // Set up S using the standard key scheduling algorithm.
+  while (i < width) {
+    s[i] = i++;
+  }
+  for (i = 0; i < width; i++) {
+    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];
+    s[j] = t;
+  }
+
+  // The "g" method returns the next (count) outputs as one number.
+  (me.g = function(count) {
+    // Using instance members instead of closure state nearly doubles speed.
+    var t, r = 0,
+        i = me.i, j = me.j, s = me.S;
+    while (count--) {
+      t = s[i = mask & (i + 1)];
+      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];
+    }
+    me.i = i; me.j = j;
+    return r;
+    // For robust unpredictability, the function call below automatically
+    // discards an initial batch of values.  This is called RC4-drop[256].
+    // See http://google.com/search?q=rsa+fluhrer+response&btnI
+  })(width);
+}
+
+//
+// copy()
+// Copies internal state of ARC4 to or from a plain object.
+//
+function copy(f, t) {
+  t.i = f.i;
+  t.j = f.j;
+  t.S = f.S.slice();
+  return t;
+};
+
+//
+// flatten()
+// Converts an object tree to nested arrays of strings.
+//
+function flatten(obj, depth) {
+  var result = [], typ = (typeof obj), prop;
+  if (depth && typ == 'object') {
+    for (prop in obj) {
+      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}
+    }
+  }
+  return (result.length ? result : typ == 'string' ? obj : obj + '\0');
+}
+
+//
+// mixkey()
+// Mixes a string seed into a key that is an array of integers, and
+// returns a shortened string seed that is equivalent to the result key.
+//
+function mixkey(seed, key) {
+  var stringseed = seed + '', smear, j = 0;
+  while (j < stringseed.length) {
+    key[mask & j] =
+      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));
+  }
+  return tostring(key);
+}
+
+//
+// autoseed()
+// Returns an object for autoseeding, using window.crypto and Node crypto
+// module if available.
+//
+function autoseed() {
+  try {
+    var out;
+    if (nodecrypto && (out = nodecrypto.randomBytes)) {
+      // The use of 'out' to remember randomBytes makes tight minified code.
+      out = out(width);
+    } else {
+      out = new Uint8Array(width);
+      (global.crypto || global.msCrypto).getRandomValues(out);
+    }
+    return tostring(out);
+  } catch (e) {
+    var browser = global.navigator,
+        plugins = browser && browser.plugins;
+    return [+new Date, global, plugins, global.screen, tostring(pool)];
+  }
+}
+
+//
+// tostring()
+// Converts an array of charcodes to a string
+//
+function tostring(a) {
+  return String.fromCharCode.apply(0, a);
+}
+
+//
+// When seedrandom.js is loaded, we immediately mix a few bits
+// from the built-in RNG into the entropy pool.  Because we do
+// not want to interfere with deterministic PRNG state later,
+// seedrandom will not call math.random on its own again after
+// initialization.
+//
+mixkey(math.random(), pool);
+
+//
+// Nodejs and AMD support: export the implementation as a module using
+// either convention.
+//
+if ((typeof module) == 'object' && module.exports) {
+  module.exports = seedrandom;
+  // When in node.js, try using crypto package for autoseeding.
+  try {
+    nodecrypto = require('crypto');
+  } catch (ex) {}
+} else if ((typeof define) == 'function' && define.amd) {
+  define(function() { return seedrandom; });
+} else {
+  // When included as a plain script, set up Math.seedrandom global.
+  math['seed' + rngname] = seedrandom;
+}
+
+
+// End anonymous scope, and pass initial values.
+})(
+  // global: `self` in browsers (including strict mode and web workers),
+  // otherwise `this` in Node and other environments
+  (typeof self !== 'undefined') ? self : this,
+  [],     // pool: entropy pool starts empty
+  Math    // math: package containing random, pow, and seedrandom
+);
diff --git a/node_modules/seedrandom/seedrandom.min.js b/node_modules/seedrandom/seedrandom.min.js
new file mode 100644
index 0000000..56e1afc
--- /dev/null
+++ b/node_modules/seedrandom/seedrandom.min.js
@@ -0,0 +1 @@
+!function(f,a,c){var s,l=256,p="random",d=c.pow(l,6),g=c.pow(2,52),y=2*g,h=l-1;function n(n,t,r){function e(){for(var n=u.g(6),t=d,r=0;n<g;)n=(n+r)*l,t*=l,r=u.g(1);for(;y<=n;)n/=2,t/=2,r>>>=1;return(n+r)/t}var o=[],i=j(function n(t,r){var e,o=[],i=typeof t;if(r&&"object"==i)for(e in t)try{o.push(n(t[e],r-1))}catch(n){}return o.length?o:"string"==i?t:t+"\0"}((t=1==t?{entropy:!0}:t||{}).entropy?[n,S(a)]:null==n?function(){try{var n;return s&&(n=s.randomBytes)?n=n(l):(n=new Uint8Array(l),(f.crypto||f.msCrypto).getRandomValues(n)),S(n)}catch(n){var t=f.navigator,r=t&&t.plugins;return[+new Date,f,r,f.screen,S(a)]}}():n,3),o),u=new m(o);return e.int32=function(){return 0|u.g(4)},e.quick=function(){return u.g(4)/4294967296},e.double=e,j(S(u.S),a),(t.pass||r||function(n,t,r,e){return e&&(e.S&&v(e,u),n.state=function(){return v(u,{})}),r?(c[p]=n,t):n})(e,i,"global"in t?t.global:this==c,t.state)}function m(n){var t,r=n.length,u=this,e=0,o=u.i=u.j=0,i=u.S=[];for(r||(n=[r++]);e<l;)i[e]=e++;for(e=0;e<l;e++)i[e]=i[o=h&o+n[e%r]+(t=i[e])],i[o]=t;(u.g=function(n){for(var t,r=0,e=u.i,o=u.j,i=u.S;n--;)t=i[e=h&e+1],r=r*l+i[h&(i[e]=i[o=h&o+t])+(i[o]=t)];return u.i=e,u.j=o,r})(l)}function v(n,t){return t.i=n.i,t.j=n.j,t.S=n.S.slice(),t}function j(n,t){for(var r,e=n+"",o=0;o<e.length;)t[h&o]=h&(r^=19*t[h&o])+e.charCodeAt(o++);return S(t)}function S(n){return String.fromCharCode.apply(0,n)}if(j(c.random(),a),"object"==typeof module&&module.exports){module.exports=n;try{s=require("crypto")}catch(n){}}else"function"==typeof define&&define.amd?define(function(){return n}):c["seed"+p]=n}("undefined"!=typeof self?self:this,[],Math);
\ No newline at end of file
diff --git a/node_modules/semver/LICENSE b/node_modules/semver/LICENSE
new file mode 100644
index 0000000..19129e3
--- /dev/null
+++ b/node_modules/semver/LICENSE
@@ -0,0 +1,15 @@
+The ISC License
+
+Copyright (c) Isaac Z. Schlueter and Contributors
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
+IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
diff --git a/node_modules/semver/README.md b/node_modules/semver/README.md
new file mode 100644
index 0000000..5e03abc
--- /dev/null
+++ b/node_modules/semver/README.md
@@ -0,0 +1,680 @@
+semver(1) -- The semantic versioner for npm
+===========================================
+
+## Install
+
+```bash
+npm install semver
+````
+
+## Usage
+
+As a node module:
+
+```js
+const semver = require('semver')
+
+semver.valid('1.2.3') // '1.2.3'
+semver.valid('a.b.c') // null
+semver.clean('  =v1.2.3   ') // '1.2.3'
+semver.satisfies('1.2.3', '1.x || >=2.5.0 || 5.0.0 - 7.2.3') // true
+semver.gt('1.2.3', '9.8.7') // false
+semver.lt('1.2.3', '9.8.7') // true
+semver.minVersion('>=1.0.0') // '1.0.0'
+semver.valid(semver.coerce('v2')) // '2.0.0'
+semver.valid(semver.coerce('42.6.7.9.3-alpha')) // '42.6.7'
+```
+
+You can also just load the module for the function that you care about if
+you'd like to minimize your footprint.
+
+```js
+// load the whole API at once in a single object
+const semver = require('semver')
+
+// or just load the bits you need
+// all of them listed here, just pick and choose what you want
+
+// classes
+const SemVer = require('semver/classes/semver')
+const Comparator = require('semver/classes/comparator')
+const Range = require('semver/classes/range')
+
+// functions for working with versions
+const semverParse = require('semver/functions/parse')
+const semverValid = require('semver/functions/valid')
+const semverClean = require('semver/functions/clean')
+const semverInc = require('semver/functions/inc')
+const semverDiff = require('semver/functions/diff')
+const semverMajor = require('semver/functions/major')
+const semverMinor = require('semver/functions/minor')
+const semverPatch = require('semver/functions/patch')
+const semverPrerelease = require('semver/functions/prerelease')
+const semverCompare = require('semver/functions/compare')
+const semverRcompare = require('semver/functions/rcompare')
+const semverCompareLoose = require('semver/functions/compare-loose')
+const semverCompareBuild = require('semver/functions/compare-build')
+const semverSort = require('semver/functions/sort')
+const semverRsort = require('semver/functions/rsort')
+const semverTruncate = require('semver/functions/truncate')
+
+// low-level comparators between versions
+const semverGt = require('semver/functions/gt')
+const semverLt = require('semver/functions/lt')
+const semverEq = require('semver/functions/eq')
+const semverNeq = require('semver/functions/neq')
+const semverGte = require('semver/functions/gte')
+const semverLte = require('semver/functions/lte')
+const semverCmp = require('semver/functions/cmp')
+const semverCoerce = require('semver/functions/coerce')
+
+// working with ranges
+const semverSatisfies = require('semver/functions/satisfies')
+const semverMaxSatisfying = require('semver/ranges/max-satisfying')
+const semverMinSatisfying = require('semver/ranges/min-satisfying')
+const semverToComparators = require('semver/ranges/to-comparators')
+const semverMinVersion = require('semver/ranges/min-version')
+const semverValidRange = require('semver/ranges/valid')
+const semverOutside = require('semver/ranges/outside')
+const semverGtr = require('semver/ranges/gtr')
+const semverLtr = require('semver/ranges/ltr')
+const semverIntersects = require('semver/ranges/intersects')
+const semverSimplifyRange = require('semver/ranges/simplify')
+const semverRangeSubset = require('semver/ranges/subset')
+```
+
+As a command-line utility:
+
+```
+$ semver -h
+
+A JavaScript implementation of the https://semver.org/ specification
+Copyright Isaac Z. Schlueter
+
+Usage: semver [options] <version> [<version> [...]]
+Prints valid versions sorted by SemVer precedence
+
+Options:
+-r --range <range>
+        Print versions that match the specified range.
+
+-i --increment [<level>]
+        Increment a version by the specified level.  Level can
+        be one of: major, minor, patch, premajor, preminor,
+        prepatch, prerelease, or release.  Default level is 'patch'.
+        Only one version may be specified.
+
+--preid <identifier>
+        Identifier to be used to prefix premajor, preminor,
+        prepatch or prerelease version increments.
+
+-l --loose
+        Interpret versions and ranges loosely
+
+-n <0|1|false>
+        Base number for prerelease identifier (default: 0).
+        Use false to omit the number altogether.
+
+-p --include-prerelease
+        Always include prerelease versions in range matching
+
+-c --coerce
+        Coerce a string into SemVer if possible
+        (does not imply --loose)
+
+--rtl
+        Coerce version strings right to left
+
+--ltr
+        Coerce version strings left to right (default)
+
+Program exits successfully if any valid version satisfies
+all supplied ranges, and prints all satisfying versions.
+
+If no satisfying versions are found, then exits failure.
+
+Versions are printed in ascending order, so supplying
+multiple versions to the utility will just sort them.
+```
+
+## Versions
+
+A "version" is described by the `v2.0.0` specification found at
+<https://semver.org/>.
+
+A leading `"="` or `"v"` character is stripped off and ignored.
+Support for stripping a leading "v" is kept for compatibility with `v1.0.0` of the SemVer
+specification but should not be used anymore.
+
+## Ranges
+
+A `version range` is a set of `comparators` that specify versions
+that satisfy the range.
+
+A `comparator` is composed of an `operator` and a `version`.  The set
+of primitive `operators` is:
+
+* `<` Less than
+* `<=` Less than or equal to
+* `>` Greater than
+* `>=` Greater than or equal to
+* `=` Equal.  If no operator is specified, then equality is assumed,
+  so this operator is optional but MAY be included.
+
+For example, the comparator `>=1.2.7` would match the versions
+`1.2.7`, `1.2.8`, `2.5.3`, and `1.3.9`, but not the versions `1.2.6`
+or `1.1.0`. The comparator `>1` is equivalent to `>=2.0.0` and
+would match the versions `2.0.0` and `3.1.0`, but not the versions
+`1.0.1` or `1.1.0`.
+
+Comparators can be joined by whitespace to form a `comparator set`,
+which is satisfied by the **intersection** of all of the comparators
+it includes.
+
+A range is composed of one or more comparator sets, joined by `||`.  A
+version matches a range if and only if every comparator in at least
+one of the `||`-separated comparator sets is satisfied by the version.
+
+For example, the range `>=1.2.7 <1.3.0` would match the versions
+`1.2.7`, `1.2.8`, and `1.2.99`, but not the versions `1.2.6`, `1.3.0`,
+or `1.1.0`.
+
+The range `1.2.7 || >=1.2.9 <2.0.0` would match the versions `1.2.7`,
+`1.2.9`, and `1.4.6`, but not the versions `1.2.8` or `2.0.0`.
+
+### Prerelease Tags
+
+If a version has a prerelease tag (for example, `1.2.3-alpha.3`) then
+it will only be allowed to satisfy comparator sets if at least one
+comparator with the same `[major, minor, patch]` tuple also has a
+prerelease tag.
+
+For example, the range `>1.2.3-alpha.3` would be allowed to match the
+version `1.2.3-alpha.7`, but it would *not* be satisfied by
+`3.4.5-alpha.9`, even though `3.4.5-alpha.9` is technically "greater
+than" `1.2.3-alpha.3` according to the SemVer sort rules.  The version
+range only accepts prerelease tags on the `1.2.3` version.
+Version `3.4.5` *would* satisfy the range because it does not have a
+prerelease flag, and `3.4.5` is greater than `1.2.3-alpha.7`.
+
+The purpose of this behavior is twofold.  First, prerelease versions
+frequently are updated very quickly, and contain many breaking changes
+that are (by the author's design) not yet fit for public consumption.
+Therefore, by default, they are excluded from range-matching
+semantics.
+
+Second, a user who has opted into using a prerelease version has
+indicated the intent to use *that specific* set of
+alpha/beta/rc versions.  By including a prerelease tag in the range,
+the user is indicating that they are aware of the risk.  However, it
+is still not appropriate to assume that they have opted into taking a
+similar risk on the *next* set of prerelease versions.
+
+Note that this behavior can be suppressed (treating all prerelease
+versions as if they were normal versions, for range-matching)
+by setting the `includePrerelease` flag on the options
+object to any
+[functions](https://github.com/npm/node-semver#functions) that do
+range matching.
+
+#### Prerelease Identifiers
+
+The method `.inc` takes an additional `identifier` string argument that
+will append the value of the string as a prerelease identifier:
+
+```javascript
+semver.inc('1.2.3', 'prerelease', 'beta')
+// '1.2.4-beta.0'
+```
+
+command-line example:
+
+```bash
+$ semver 1.2.3 -i prerelease --preid beta
+1.2.4-beta.0
+```
+
+Which then can be used to increment further:
+
+```bash
+$ semver 1.2.4-beta.0 -i prerelease
+1.2.4-beta.1
+```
+
+To get out of the prerelease phase, use the `release` option:
+
+```bash
+$ semver 1.2.4-beta.1 -i release
+1.2.4
+```
+
+#### Prerelease Identifier Base
+
+The method `.inc` takes an optional parameter 'identifierBase' string
+that will let you let your prerelease number as zero-based or one-based.
+Set to `false` to omit the prerelease number altogether.
+If you do not specify this parameter, it will default to zero-based.
+
+```javascript
+semver.inc('1.2.3', 'prerelease', 'beta', '1')
+// '1.2.4-beta.1'
+```
+
+```javascript
+semver.inc('1.2.3', 'prerelease', 'beta', false)
+// '1.2.4-beta'
+```
+
+command-line example:
+
+```bash
+$ semver 1.2.3 -i prerelease --preid beta -n 1
+1.2.4-beta.1
+```
+
+```bash
+$ semver 1.2.3 -i prerelease --preid beta -n false
+1.2.4-beta
+```
+
+### Advanced Range Syntax
+
+Advanced range syntax desugars to primitive comparators in
+deterministic ways.
+
+Advanced ranges may be combined in the same way as primitive
+comparators using white space or `||`.
+
+#### Hyphen Ranges `X.Y.Z - A.B.C`
+
+Specifies an inclusive set.
+
+* `1.2.3 - 2.3.4` := `>=1.2.3 <=2.3.4`
+
+If a partial version is provided as the first version in the inclusive
+range, then the missing pieces are replaced with zeroes.
+
+* `1.2 - 2.3.4` := `>=1.2.0 <=2.3.4`
+
+If a partial version is provided as the second version in the
+inclusive range, then all versions that start with the supplied parts
+of the tuple are accepted, but nothing that would be greater than the
+provided tuple parts.
+
+* `1.2.3 - 2.3` := `>=1.2.3 <2.4.0-0`
+* `1.2.3 - 2` := `>=1.2.3 <3.0.0-0`
+
+#### X-Ranges `1.2.x` `1.X` `1.2.*` `*`
+
+Any of `X`, `x`, or `*` may be used to "stand in" for one of the
+numeric values in the `[major, minor, patch]` tuple.
+
+* `*` := `>=0.0.0` (Any non-prerelease version satisfies, unless
+  `includePrerelease` is specified, in which case any version at all
+  satisfies)
+* `1.x` := `>=1.0.0 <2.0.0-0` (Matching major version)
+* `1.2.x` := `>=1.2.0 <1.3.0-0` (Matching major and minor versions)
+
+A partial version range is treated as an X-Range, so the special
+character is in fact optional.
+
+* `""` (empty string) := `*` := `>=0.0.0`
+* `1` := `1.x.x` := `>=1.0.0 <2.0.0-0`
+* `1.2` := `1.2.x` := `>=1.2.0 <1.3.0-0`
+
+#### Tilde Ranges `~1.2.3` `~1.2` `~1`
+
+Allows patch-level changes if a minor version is specified on the
+comparator.  Allows minor-level changes if not.
+
+* `~1.2.3` := `>=1.2.3 <1.(2+1).0` := `>=1.2.3 <1.3.0-0`
+* `~1.2` := `>=1.2.0 <1.(2+1).0` := `>=1.2.0 <1.3.0-0` (Same as `1.2.x`)
+* `~1` := `>=1.0.0 <(1+1).0.0` := `>=1.0.0 <2.0.0-0` (Same as `1.x`)
+* `~0.2.3` := `>=0.2.3 <0.(2+1).0` := `>=0.2.3 <0.3.0-0`
+* `~0.2` := `>=0.2.0 <0.(2+1).0` := `>=0.2.0 <0.3.0-0` (Same as `0.2.x`)
+* `~0` := `>=0.0.0 <(0+1).0.0` := `>=0.0.0 <1.0.0-0` (Same as `0.x`)
+* `~1.2.3-beta.2` := `>=1.2.3-beta.2 <1.3.0-0` Note that prereleases in
+  the `1.2.3` version will be allowed, if they are greater than or
+  equal to `beta.2`.  So, `1.2.3-beta.4` would be allowed, but
+  `1.2.4-beta.2` would not, because it is a prerelease of a
+  different `[major, minor, patch]` tuple.
+
+#### Caret Ranges `^1.2.3` `^0.2.5` `^0.0.4`
+
+Allows changes that do not modify the left-most non-zero element in the
+`[major, minor, patch]` tuple.  In other words, this allows patch and
+minor updates for versions `1.0.0` and above, patch updates for
+versions `0.X >=0.1.0`, and *no* updates for versions `0.0.X`.
+
+Many authors treat a `0.x` version as if the `x` were the major
+"breaking-change" indicator.
+
+Caret ranges are ideal when an author may make breaking changes
+between `0.2.4` and `0.3.0` releases, which is a common practice.
+However, it presumes that there will *not* be breaking changes between
+`0.2.4` and `0.2.5`.  It allows for changes that are presumed to be
+additive (but non-breaking), according to commonly observed practices.
+
+* `^1.2.3` := `>=1.2.3 <2.0.0-0`
+* `^0.2.3` := `>=0.2.3 <0.3.0-0`
+* `^0.0.3` := `>=0.0.3 <0.0.4-0`
+* `^1.2.3-beta.2` := `>=1.2.3-beta.2 <2.0.0-0` Note that prereleases in
+  the `1.2.3` version will be allowed, if they are greater than or
+  equal to `beta.2`.  So, `1.2.3-beta.4` would be allowed, but
+  `1.2.4-beta.2` would not, because it is a prerelease of a
+  different `[major, minor, patch]` tuple.
+* `^0.0.3-beta` := `>=0.0.3-beta <0.0.4-0`  Note that prereleases in the
+  `0.0.3` version *only* will be allowed, if they are greater than or
+  equal to `beta`.  So, `0.0.3-pr.2` would be allowed.
+
+When parsing caret ranges, a missing `patch` value desugars to the
+number `0`, but will allow flexibility within that value, even if the
+major and minor versions are both `0`.
+
+* `^1.2.x` := `>=1.2.0 <2.0.0-0`
+* `^0.0.x` := `>=0.0.0 <0.1.0-0`
+* `^0.0` := `>=0.0.0 <0.1.0-0`
+
+A missing `minor` and `patch` values will desugar to zero, but also
+allow flexibility within those values, even if the major version is
+zero.
+
+* `^1.x` := `>=1.0.0 <2.0.0-0`
+* `^0.x` := `>=0.0.0 <1.0.0-0`
+
+### Range Grammar
+
+Putting all this together, here is a Backus-Naur grammar for ranges,
+for the benefit of parser authors:
+
+```bnf
+range-set  ::= range ( logical-or range ) *
+logical-or ::= ( ' ' ) * '||' ( ' ' ) *
+range      ::= hyphen | simple ( ' ' simple ) * | ''
+hyphen     ::= partial ' - ' partial
+simple     ::= primitive | partial | tilde | caret
+primitive  ::= ( '<' | '>' | '>=' | '<=' | '=' ) partial
+partial    ::= xr ( '.' xr ( '.' xr qualifier ? )? )?
+xr         ::= 'x' | 'X' | '*' | nr
+nr         ::= '0' | ['1'-'9'] ( ['0'-'9'] ) *
+tilde      ::= '~' partial
+caret      ::= '^' partial
+qualifier  ::= ( '-' pre )? ( '+' build )?
+pre        ::= prepart ( '.' prepart ) *
+prepart    ::= nr | alphanumid
+build      ::= buildid ( '.' buildid ) *
+alphanumid ::= ( ['0'-'9'] ) * [-A-Za-z] [-0-9A-Za-z] *
+buildid    ::= [-0-9A-Za-z]+
+```
+
+Note: Prerelease identifiers (`pre`) use `nr` for numeric parts, which
+disallows leading zeros (e.g., `1.2.3-00` is invalid). Build metadata
+identifiers (`build`) allow any alphanumeric string including leading
+zeros (e.g., `1.2.3+00` is valid). This matches the
+[SemVer 2.0.0 specification](https://semver.org/#spec-item-9).
+
+## Functions
+
+All methods and classes take a final `options` object argument.  All
+options in this object are `false` by default.  The options supported
+are:
+
+- `loose`: Be more forgiving about not-quite-valid semver strings.
+  (Any resulting output will always be 100% strict compliant, of
+  course.)  For backwards compatibility reasons, if the `options`
+  argument is a boolean value instead of an object, it is interpreted
+  to be the `loose` param.
+- `includePrerelease`: Set to suppress the [default
+  behavior](https://github.com/npm/node-semver#prerelease-tags) of
+  excluding prerelease tagged versions from ranges unless they are
+  explicitly opted into.
+
+Strict-mode Comparators and Ranges will be strict about the SemVer
+strings that they parse.
+
+* `valid(v)`: Return the parsed version, or null if it's not valid.
+* `inc(v, releaseType, options, identifier, identifierBase)`: 
+  Return the version incremented by the release
+  type (`major`, `premajor`, `minor`, `preminor`, `patch`,
+  `prepatch`, `prerelease`, or `release`), or null if it's not valid
+  * `premajor` in one call will bump the version up to the next major
+    version and down to a prerelease of that major version.
+    `preminor`, and `prepatch` work the same way.
+  * If called from a non-prerelease version, `prerelease` will work the
+    same as `prepatch`. It increments the patch version and then makes a
+    prerelease. If the input version is already a prerelease it simply
+    increments it.
+  * `release` will remove any prerelease part of the version.
+  * `identifier` can be used to prefix `premajor`, `preminor`,
+    `prepatch`, or `prerelease` version increments. `identifierBase`
+    is the base to be used for the `prerelease` identifier.
+* `prerelease(v)`: Returns an array of prerelease components, or null
+  if none exist. Example: `prerelease('1.2.3-alpha.1') -> ['alpha', 1]`
+* `major(v)`: Return the major version number.
+* `minor(v)`: Return the minor version number.
+* `patch(v)`: Return the patch version number.
+* `intersects(r1, r2, loose)`: Return true if the two supplied ranges
+  or comparators intersect.
+* `parse(v)`: Attempt to parse a string as a semantic version, returning either
+  a `SemVer` object or `null`.
+* `truncate(v, releaseType)`: Return the version with components _lower_
+  than `releaseType` dropped off, e.g.:
+  * `major` removes build & prerelease info and sets minor & patch to 0.
+  * `minor` removes build & prerelease info, and sets patch to 0
+  * `patch` removes build & prerelease info
+  * All prerelease types remove build info only
+
+### Comparison
+
+* `gt(v1, v2)`: `v1 > v2`
+* `gte(v1, v2)`: `v1 >= v2`
+* `lt(v1, v2)`: `v1 < v2`
+* `lte(v1, v2)`: `v1 <= v2`
+* `eq(v1, v2)`: `v1 == v2` This is true if they're logically equivalent,
+  even if they're not the same string.  You already know how to
+  compare strings.
+* `neq(v1, v2)`: `v1 != v2` The opposite of `eq`.
+* `cmp(v1, comparator, v2)`: Pass in a comparison string, and it'll call
+  the corresponding function above.  `"==="` and `"!=="` do simple
+  string comparison, but are included for completeness.  Throws if an
+  invalid comparison string is provided.
+* `compare(v1, v2)`: Return `0` if `v1 == v2`, or `1` if `v1` is greater, or `-1` if
+  `v2` is greater.  Sorts in ascending order if passed to `Array.sort()`.
+* `rcompare(v1, v2)`: The reverse of `compare`.  Sorts an array of versions
+  in descending order when passed to `Array.sort()`.
+* `compareBuild(v1, v2)`: The same as `compare` but considers `build` when two versions
+  are equal.  Sorts in ascending order if passed to `Array.sort()`.
+* `compareLoose(v1, v2)`: Short for `compare(v1, v2, { loose: true })`.
+* `diff(v1, v2)`: Returns the difference between two versions by the release type
+  (`major`, `premajor`, `minor`, `preminor`, `patch`, `prepatch`, or `prerelease`),
+  or null if the versions are the same.
+
+### Sorting
+
+* `sort(versions)`: Returns a sorted array of versions based on the `compareBuild` 
+  function.
+* `rsort(versions)`: The reverse of `sort`. Returns an array of versions based on
+  the `compareBuild` function in descending order.
+
+### Comparators
+
+* `intersects(comparator)`: Return true if the comparators intersect
+
+### Ranges
+
+* `validRange(range)`: Return the valid range or null if it's not valid.
+* `satisfies(version, range)`: Return true if the version satisfies the
+  range.
+* `maxSatisfying(versions, range)`: Return the highest version in the list
+  that satisfies the range, or `null` if none of them do.
+* `minSatisfying(versions, range)`: Return the lowest version in the list
+  that satisfies the range, or `null` if none of them do.
+* `minVersion(range)`: Return the lowest version that can match
+  the given range.
+* `gtr(version, range)`: Return `true` if the version is greater than all the
+  versions possible in the range.
+* `ltr(version, range)`: Return `true` if the version is less than all the
+  versions possible in the range.
+* `outside(version, range, hilo)`: Return true if the version is outside
+  the bounds of the range in either the high or low direction.  The
+  `hilo` argument must be either the string `'>'` or `'<'`.  (This is
+  the function called by `gtr` and `ltr`.)
+* `intersects(range)`: Return true if any of the range comparators intersect.
+* `simplifyRange(versions, range)`: Return a "simplified" range that
+  matches the same items in the `versions` list as the range specified.  Note
+  that it does *not* guarantee that it would match the same versions in all
+  cases, only for the set of versions provided.  This is useful when
+  generating ranges by joining together multiple versions with `||`
+  programmatically, to provide the user with something a bit more
+  ergonomic.  If the provided range is shorter in string-length than the
+  generated range, then that is returned.
+* `subset(subRange, superRange)`: Return `true` if the `subRange` range is
+  entirely contained by the `superRange` range.
+
+Note that, since ranges may be non-contiguous, a version might not be
+greater than a range, less than a range, *or* satisfy a range!  For
+example, the range `1.2 <1.2.9 || >2.0.0` would have a hole from `1.2.9`
+until `2.0.0`, so version `1.2.10` would not be greater than the
+range (because `2.0.1` satisfies, which is higher), nor less than the
+range (since `1.2.8` satisfies, which is lower), and it also does not
+satisfy the range.
+
+If you want to know if a version satisfies or does not satisfy a
+range, use the `satisfies(version, range)` function.
+
+### Coercion
+
+* `coerce(version, options)`: Coerces a string to semver if possible
+
+This aims to provide a very forgiving translation of a non-semver string to
+semver. It looks for the first digit in a string and consumes all
+remaining characters which satisfy at least a partial semver (e.g., `1`,
+`1.2`, `1.2.3`) up to the max permitted length (256 characters).  Longer
+versions are simply truncated (`4.6.3.9.2-alpha2` becomes `4.6.3`).  All
+surrounding text is simply ignored (`v3.4 replaces v3.3.1` becomes
+`3.4.0`).  Only text which lacks digits will fail coercion (`version one`
+is not valid).  The maximum length for any semver component considered for
+coercion is 16 characters; longer components will be ignored
+(`10000000000000000.4.7.4` becomes `4.7.4`).  The maximum value for any
+semver component is `Number.MAX_SAFE_INTEGER || (2**53 - 1)`; higher value
+components are invalid (`9999999999999999.4.7.4` is likely invalid).
+
+If the `options.rtl` flag is set, then `coerce` will return the right-most
+coercible tuple that does not share an ending index with a longer coercible
+tuple.  For example, `1.2.3.4` will return `2.3.4` in rtl mode, not
+`4.0.0`.  `1.2.3/4` will return `4.0.0`, because the `4` is not a part of
+any other overlapping SemVer tuple.
+
+If the `options.includePrerelease` flag is set, then the `coerce` result will contain
+prerelease and build parts of a version.  For example, `1.2.3.4-rc.1+rev.2`
+will preserve prerelease `rc.1` and build `rev.2` in the result.
+
+### Clean
+
+* `clean(version)`: Clean a string to be a valid semver if possible
+
+This will return a cleaned and trimmed semver version. If the provided
+version is not valid a null will be returned. This does not work for
+ranges.
+
+ex.
+* `s.clean(' = v 2.1.5foo')`: `null`
+* `s.clean(' = v 2.1.5foo', { loose: true })`: `'2.1.5-foo'`
+* `s.clean(' = v 2.1.5-foo')`: `null`
+* `s.clean(' = v 2.1.5-foo', { loose: true })`: `'2.1.5-foo'`
+* `s.clean('=v2.1.5')`: `'2.1.5'`
+* `s.clean('  =v2.1.5')`: `'2.1.5'`
+* `s.clean('      2.1.5   ')`: `'2.1.5'`
+* `s.clean('~1.0.0')`: `null`
+
+## Constants
+
+As a convenience, helper constants are exported to provide information about what `node-semver` supports:
+
+### `RELEASE_TYPES`
+
+- major
+- premajor
+- minor
+- preminor
+- patch
+- prepatch
+- prerelease
+
+```
+const semver = require('semver');
+
+if (semver.RELEASE_TYPES.includes(arbitraryUserInput)) {
+  console.log('This is a valid release type!');
+} else {
+  console.warn('This is NOT a valid release type!');
+}
+```
+
+### `SEMVER_SPEC_VERSION`
+
+2.0.0
+
+```
+const semver = require('semver');
+
+console.log('We are currently using the semver specification version:', semver.SEMVER_SPEC_VERSION);
+```
+
+## Exported Modules
+
+<!--
+TODO: Make sure that all of these items are documented (classes aren't,
+eg), and then pull the module name into the documentation for that specific
+thing.
+-->
+
+You may pull in just the part of this semver utility that you need if you
+are sensitive to packing and tree-shaking concerns.  The main
+`require('semver')` export uses getter functions to lazily load the parts
+of the API that are used.
+
+The following modules are available:
+
+* `require('semver')`
+* `require('semver/classes')`
+* `require('semver/classes/comparator')`
+* `require('semver/classes/range')`
+* `require('semver/classes/semver')`
+* `require('semver/functions/clean')`
+* `require('semver/functions/cmp')`
+* `require('semver/functions/coerce')`
+* `require('semver/functions/compare')`
+* `require('semver/functions/compare-build')`
+* `require('semver/functions/compare-loose')`
+* `require('semver/functions/diff')`
+* `require('semver/functions/eq')`
+* `require('semver/functions/gt')`
+* `require('semver/functions/gte')`
+* `require('semver/functions/inc')`
+* `require('semver/functions/lt')`
+* `require('semver/functions/lte')`
+* `require('semver/functions/major')`
+* `require('semver/functions/minor')`
+* `require('semver/functions/neq')`
+* `require('semver/functions/parse')`
+* `require('semver/functions/patch')`
+* `require('semver/functions/prerelease')`
+* `require('semver/functions/rcompare')`
+* `require('semver/functions/rsort')`
+* `require('semver/functions/satisfies')`
+* `require('semver/functions/sort')`
+* `require('semver/functions/truncate')`
+* `require('semver/functions/valid')`
+* `require('semver/ranges/gtr')`
+* `require('semver/ranges/intersects')`
+* `require('semver/ranges/ltr')`
+* `require('semver/ranges/max-satisfying')`
+* `require('semver/ranges/min-satisfying')`
+* `require('semver/ranges/min-version')`
+* `require('semver/ranges/outside')`
+* `require('semver/ranges/simplify')`
+* `require('semver/ranges/subset')`
+* `require('semver/ranges/to-comparators')`
+* `require('semver/ranges/valid')`
+
diff --git a/node_modules/semver/bin/semver.js b/node_modules/semver/bin/semver.js
new file mode 100755
index 0000000..9ae8aad
--- /dev/null
+++ b/node_modules/semver/bin/semver.js
@@ -0,0 +1,195 @@
+#!/usr/bin/env node
+// Standalone semver comparison program.
+// Exits successfully and prints matching version(s) if
+// any supplied version is valid and passes all tests.
+
+'use strict'
+
+const argv = process.argv.slice(2)
+
+let versions = []
+
+const range = []
+
+let inc = null
+
+const version = require('../package.json').version
+
+let loose = false
+
+let includePrerelease = false
+
+let coerce = false
+
+let rtl = false
+
+let identifier
+
+let identifierBase
+
+const semver = require('../')
+const parseOptions = require('../internal/parse-options')
+
+let reverse = false
+
+let options = {}
+
+const main = () => {
+  if (!argv.length) {
+    return help()
+  }
+  while (argv.length) {
+    let a = argv.shift()
+    const indexOfEqualSign = a.indexOf('=')
+    if (indexOfEqualSign !== -1) {
+      const value = a.slice(indexOfEqualSign + 1)
+      a = a.slice(0, indexOfEqualSign)
+      argv.unshift(value)
+    }
+
+    switch (a) {
+      case '-rv': case '-rev': case '--rev': case '--reverse':
+        reverse = true
+        break
+      case '-l': case '--loose':
+        loose = true
+        break
+      case '-p': case '--include-prerelease':
+        includePrerelease = true
+        break
+      case '-v': case '--version':
+        versions.push(argv.shift())
+        break
+      case '-i': case '--inc': case '--increment':
+        if (semver.RELEASE_TYPES.includes(argv[0]) || (argv[0] === 'release')) {
+          inc = { value: argv.shift(), maybeErrantValue: null, option: a }
+        } else {
+          inc = { value: 'patch', maybeErrantValue: argv[0], option: a }
+        }
+        break
+      case '--preid':
+        identifier = argv.shift()
+        break
+      case '-r': case '--range':
+        range.push(argv.shift())
+        break
+      case '-n':
+        identifierBase = argv.shift()
+        if (identifierBase === 'false') {
+          identifierBase = false
+        }
+        break
+      case '-c': case '--coerce':
+        coerce = true
+        break
+      case '--rtl':
+        rtl = true
+        break
+      case '--ltr':
+        rtl = false
+        break
+      case '-h': case '--help': case '-?':
+        return help()
+      default:
+        versions.push(a)
+        break
+    }
+  }
+
+  options = parseOptions({ loose, includePrerelease, rtl })
+
+  if (
+    inc &&
+    versions.includes(inc.maybeErrantValue) &&
+    !semver.valid(inc.maybeErrantValue, options)
+  ) {
+    console.warn(`Invalid value for ${inc.option}; defaulting to 'patch'. This may become a failure in future major versions.`)
+  }
+
+  versions = versions.map((v) => {
+    return coerce ? (semver.coerce(v, options) || { version: v }).version : v
+  }).filter((v) => {
+    return semver.valid(v, options)
+  })
+  if (!versions.length) {
+    return fail()
+  }
+  if (inc && (versions.length !== 1 || range.length)) {
+    return failInc()
+  }
+
+  for (let i = 0, l = range.length; i < l; i++) {
+    versions = versions.filter((v) => {
+      return semver.satisfies(v, range[i], options)
+    })
+    if (!versions.length) {
+      return fail()
+    }
+  }
+  versions
+    .sort((a, b) => semver[reverse ? 'rcompare' : 'compare'](a, b, options))
+    .map(v => semver.clean(v, options))
+    .map(v => inc ? semver.inc(v, inc.value, options, identifier, identifierBase) : v)
+    .forEach(v => console.log(v))
+}
+
+const failInc = () => {
+  console.error('--inc can only be used on a single version with no range')
+  fail()
+}
+
+const fail = () => process.exit(1)
+
+const help = () => console.log(
+`SemVer ${version}
+
+A JavaScript implementation of the https://semver.org/ specification
+Copyright Isaac Z. Schlueter
+
+Usage: semver [options] <version> [<version> [...]]
+Prints valid versions sorted by SemVer precedence
+
+Options:
+-r --range <range>
+        Print versions that match the specified range.
+
+-i --increment [<level>]
+        Increment a version by the specified level.  Level can
+        be one of: major, minor, patch, premajor, preminor,
+        prepatch, prerelease, or release.  Default level is 'patch'.
+        Only one version may be specified.
+
+--preid <identifier>
+        Identifier to be used to prefix premajor, preminor,
+        prepatch or prerelease version increments.
+
+-l --loose
+        Interpret versions and ranges loosely
+
+-p --include-prerelease
+        Always include prerelease versions in range matching
+
+-c --coerce
+        Coerce a string into SemVer if possible
+        (does not imply --loose)
+
+--rtl
+        Coerce version strings right to left
+
+--ltr
+        Coerce version strings left to right (default)
+
+-n <base>
+        Base number to be used for the prerelease identifier.
+        Can be either 0 or 1, or false to omit the number altogether.
+        Defaults to 0.
+
+Program exits successfully if any valid version satisfies
+all supplied ranges, and prints all satisfying versions.
+
+If no satisfying versions are found, then exits failure.
+
+Versions are printed in ascending order, so supplying
+multiple versions to the utility will just sort them.`)
+
+main()
diff --git a/node_modules/semver/classes/comparator.js b/node_modules/semver/classes/comparator.js
new file mode 100644
index 0000000..647c1f0
--- /dev/null
+++ b/node_modules/semver/classes/comparator.js
@@ -0,0 +1,143 @@
+'use strict'
+
+const ANY = Symbol('SemVer ANY')
+// hoisted class for cyclic dependency
+class Comparator {
+  static get ANY () {
+    return ANY
+  }
+
+  constructor (comp, options) {
+    options = parseOptions(options)
+
+    if (comp instanceof Comparator) {
+      if (comp.loose === !!options.loose) {
+        return comp
+      } else {
+        comp = comp.value
+      }
+    }
+
+    comp = comp.trim().split(/\s+/).join(' ')
+    debug('comparator', comp, options)
+    this.options = options
+    this.loose = !!options.loose
+    this.parse(comp)
+
+    if (this.semver === ANY) {
+      this.value = ''
+    } else {
+      this.value = this.operator + this.semver.version
+    }
+
+    debug('comp', this)
+  }
+
+  parse (comp) {
+    const r = this.options.loose ? re[t.COMPARATORLOOSE] : re[t.COMPARATOR]
+    const m = comp.match(r)
+
+    if (!m) {
+      throw new TypeError(`Invalid comparator: ${comp}`)
+    }
+
+    this.operator = m[1] !== undefined ? m[1] : ''
+    if (this.operator === '=') {
+      this.operator = ''
+    }
+
+    // if it literally is just '>' or '' then allow anything.
+    if (!m[2]) {
+      this.semver = ANY
+    } else {
+      this.semver = new SemVer(m[2], this.options.loose)
+    }
+  }
+
+  toString () {
+    return this.value
+  }
+
+  test (version) {
+    debug('Comparator.test', version, this.options.loose)
+
+    if (this.semver === ANY || version === ANY) {
+      return true
+    }
+
+    if (typeof version === 'string') {
+      try {
+        version = new SemVer(version, this.options)
+      } catch (er) {
+        return false
+      }
+    }
+
+    return cmp(version, this.operator, this.semver, this.options)
+  }
+
+  intersects (comp, options) {
+    if (!(comp instanceof Comparator)) {
+      throw new TypeError('a Comparator is required')
+    }
+
+    if (this.operator === '') {
+      if (this.value === '') {
+        return true
+      }
+      return new Range(comp.value, options).test(this.value)
+    } else if (comp.operator === '') {
+      if (comp.value === '') {
+        return true
+      }
+      return new Range(this.value, options).test(comp.semver)
+    }
+
+    options = parseOptions(options)
+
+    // Special cases where nothing can possibly be lower
+    if (options.includePrerelease &&
+      (this.value === '<0.0.0-0' || comp.value === '<0.0.0-0')) {
+      return false
+    }
+    if (!options.includePrerelease &&
+      (this.value.startsWith('<0.0.0') || comp.value.startsWith('<0.0.0'))) {
+      return false
+    }
+
+    // Same direction increasing (> or >=)
+    if (this.operator.startsWith('>') && comp.operator.startsWith('>')) {
+      return true
+    }
+    // Same direction decreasing (< or <=)
+    if (this.operator.startsWith('<') && comp.operator.startsWith('<')) {
+      return true
+    }
+    // same SemVer and both sides are inclusive (<= or >=)
+    if (
+      (this.semver.version === comp.semver.version) &&
+      this.operator.includes('=') && comp.operator.includes('=')) {
+      return true
+    }
+    // opposite directions less than
+    if (cmp(this.semver, '<', comp.semver, options) &&
+      this.operator.startsWith('>') && comp.operator.startsWith('<')) {
+      return true
+    }
+    // opposite directions greater than
+    if (cmp(this.semver, '>', comp.semver, options) &&
+      this.operator.startsWith('<') && comp.operator.startsWith('>')) {
+      return true
+    }
+    return false
+  }
+}
+
+module.exports = Comparator
+
+const parseOptions = require('../internal/parse-options')
+const { safeRe: re, t } = require('../internal/re')
+const cmp = require('../functions/cmp')
+const debug = require('../internal/debug')
+const SemVer = require('./semver')
+const Range = require('./range')
diff --git a/node_modules/semver/classes/index.js b/node_modules/semver/classes/index.js
new file mode 100644
index 0000000..91c24ec
--- /dev/null
+++ b/node_modules/semver/classes/index.js
@@ -0,0 +1,7 @@
+'use strict'
+
+module.exports = {
+  SemVer: require('./semver.js'),
+  Range: require('./range.js'),
+  Comparator: require('./comparator.js'),
+}
diff --git a/node_modules/semver/classes/range.js b/node_modules/semver/classes/range.js
new file mode 100644
index 0000000..94629ce
--- /dev/null
+++ b/node_modules/semver/classes/range.js
@@ -0,0 +1,557 @@
+'use strict'
+
+const SPACE_CHARACTERS = /\s+/g
+
+// hoisted class for cyclic dependency
+class Range {
+  constructor (range, options) {
+    options = parseOptions(options)
+
+    if (range instanceof Range) {
+      if (
+        range.loose === !!options.loose &&
+        range.includePrerelease === !!options.includePrerelease
+      ) {
+        return range
+      } else {
+        return new Range(range.raw, options)
+      }
+    }
+
+    if (range instanceof Comparator) {
+      // just put it in the set and return
+      this.raw = range.value
+      this.set = [[range]]
+      this.formatted = undefined
+      return this
+    }
+
+    this.options = options
+    this.loose = !!options.loose
+    this.includePrerelease = !!options.includePrerelease
+
+    // First reduce all whitespace as much as possible so we do not have to rely
+    // on potentially slow regexes like \s*. This is then stored and used for
+    // future error messages as well.
+    this.raw = range.trim().replace(SPACE_CHARACTERS, ' ')
+
+    // First, split on ||
+    this.set = this.raw
+      .split('||')
+      // map the range to a 2d array of comparators
+      .map(r => this.parseRange(r.trim()))
+      // throw out any comparator lists that are empty
+      // this generally means that it was not a valid range, which is allowed
+      // in loose mode, but will still throw if the WHOLE range is invalid.
+      .filter(c => c.length)
+
+    if (!this.set.length) {
+      throw new TypeError(`Invalid SemVer Range: ${this.raw}`)
+    }
+
+    // if we have any that are not the null set, throw out null sets.
+    if (this.set.length > 1) {
+      // keep the first one, in case they're all null sets
+      const first = this.set[0]
+      this.set = this.set.filter(c => !isNullSet(c[0]))
+      if (this.set.length === 0) {
+        this.set = [first]
+      } else if (this.set.length > 1) {
+        // if we have any that are *, then the range is just *
+        for (const c of this.set) {
+          if (c.length === 1 && isAny(c[0])) {
+            this.set = [c]
+            break
+          }
+        }
+      }
+    }
+
+    this.formatted = undefined
+  }
+
+  get range () {
+    if (this.formatted === undefined) {
+      this.formatted = ''
+      for (let i = 0; i < this.set.length; i++) {
+        if (i > 0) {
+          this.formatted += '||'
+        }
+        const comps = this.set[i]
+        for (let k = 0; k < comps.length; k++) {
+          if (k > 0) {
+            this.formatted += ' '
+          }
+          this.formatted += comps[k].toString().trim()
+        }
+      }
+    }
+    return this.formatted
+  }
+
+  format () {
+    return this.range
+  }
+
+  toString () {
+    return this.range
+  }
+
+  parseRange (range) {
+    // memoize range parsing for performance.
+    // this is a very hot path, and fully deterministic.
+    const memoOpts =
+      (this.options.includePrerelease && FLAG_INCLUDE_PRERELEASE) |
+      (this.options.loose && FLAG_LOOSE)
+    const memoKey = memoOpts + ':' + range
+    const cached = cache.get(memoKey)
+    if (cached) {
+      return cached
+    }
+
+    const loose = this.options.loose
+    // `1.2.3 - 1.2.4` => `>=1.2.3 <=1.2.4`
+    const hr = loose ? re[t.HYPHENRANGELOOSE] : re[t.HYPHENRANGE]
+    range = range.replace(hr, hyphenReplace(this.options.includePrerelease))
+    debug('hyphen replace', range)
+
+    // `> 1.2.3 < 1.2.5` => `>1.2.3 <1.2.5`
+    range = range.replace(re[t.COMPARATORTRIM], comparatorTrimReplace)
+    debug('comparator trim', range)
+
+    // `~ 1.2.3` => `~1.2.3`
+    range = range.replace(re[t.TILDETRIM], tildeTrimReplace)
+    debug('tilde trim', range)
+
+    // `^ 1.2.3` => `^1.2.3`
+    range = range.replace(re[t.CARETTRIM], caretTrimReplace)
+    debug('caret trim', range)
+
+    // At this point, the range is completely trimmed and
+    // ready to be split into comparators.
+
+    let rangeList = range
+      .split(' ')
+      .map(comp => parseComparator(comp, this.options))
+      .join(' ')
+      .split(/\s+/)
+      // >=0.0.0 is equivalent to *
+      .map(comp => replaceGTE0(comp, this.options))
+
+    if (loose) {
+      // in loose mode, throw out any that are not valid comparators
+      rangeList = rangeList.filter(comp => {
+        debug('loose invalid filter', comp, this.options)
+        return !!comp.match(re[t.COMPARATORLOOSE])
+      })
+    }
+    debug('range list', rangeList)
+
+    // if any comparators are the null set, then replace with JUST null set
+    // if more than one comparator, remove any * comparators
+    // also, don't include the same comparator more than once
+    const rangeMap = new Map()
+    const comparators = rangeList.map(comp => new Comparator(comp, this.options))
+    for (const comp of comparators) {
+      if (isNullSet(comp)) {
+        return [comp]
+      }
+      rangeMap.set(comp.value, comp)
+    }
+    if (rangeMap.size > 1 && rangeMap.has('')) {
+      rangeMap.delete('')
+    }
+
+    const result = [...rangeMap.values()]
+    cache.set(memoKey, result)
+    return result
+  }
+
+  intersects (range, options) {
+    if (!(range instanceof Range)) {
+      throw new TypeError('a Range is required')
+    }
+
+    return this.set.some((thisComparators) => {
+      return (
+        isSatisfiable(thisComparators, options) &&
+        range.set.some((rangeComparators) => {
+          return (
+            isSatisfiable(rangeComparators, options) &&
+            thisComparators.every((thisComparator) => {
+              return rangeComparators.every((rangeComparator) => {
+                return thisComparator.intersects(rangeComparator, options)
+              })
+            })
+          )
+        })
+      )
+    })
+  }
+
+  // if ANY of the sets match ALL of its comparators, then pass
+  test (version) {
+    if (!version) {
+      return false
+    }
+
+    if (typeof version === 'string') {
+      try {
+        version = new SemVer(version, this.options)
+      } catch (er) {
+        return false
+      }
+    }
+
+    for (let i = 0; i < this.set.length; i++) {
+      if (testSet(this.set[i], version, this.options)) {
+        return true
+      }
+    }
+    return false
+  }
+}
+
+module.exports = Range
+
+const LRU = require('../internal/lrucache')
+const cache = new LRU()
+
+const parseOptions = require('../internal/parse-options')
+const Comparator = require('./comparator')
+const debug = require('../internal/debug')
+const SemVer = require('./semver')
+const {
+  safeRe: re,
+  t,
+  comparatorTrimReplace,
+  tildeTrimReplace,
+  caretTrimReplace,
+} = require('../internal/re')
+const { FLAG_INCLUDE_PRERELEASE, FLAG_LOOSE } = require('../internal/constants')
+
+const isNullSet = c => c.value === '<0.0.0-0'
+const isAny = c => c.value === ''
+
+// take a set of comparators and determine whether there
+// exists a version which can satisfy it
+const isSatisfiable = (comparators, options) => {
+  let result = true
+  const remainingComparators = comparators.slice()
+  let testComparator = remainingComparators.pop()
+
+  while (result && remainingComparators.length) {
+    result = remainingComparators.every((otherComparator) => {
+      return testComparator.intersects(otherComparator, options)
+    })
+
+    testComparator = remainingComparators.pop()
+  }
+
+  return result
+}
+
+// comprised of xranges, tildes, stars, and gtlt's at this point.
+// already replaced the hyphen ranges
+// turn into a set of JUST comparators.
+const parseComparator = (comp, options) => {
+  comp = comp.replace(re[t.BUILD], '')
+  debug('comp', comp, options)
+  comp = replaceCarets(comp, options)
+  debug('caret', comp)
+  comp = replaceTildes(comp, options)
+  debug('tildes', comp)
+  comp = replaceXRanges(comp, options)
+  debug('xrange', comp)
+  comp = replaceStars(comp, options)
+  debug('stars', comp)
+  return comp
+}
+
+const isX = id => !id || id.toLowerCase() === 'x' || id === '*'
+
+// ~, ~> --> * (any, kinda silly)
+// ~2, ~2.x, ~2.x.x, ~>2, ~>2.x ~>2.x.x --> >=2.0.0 <3.0.0-0
+// ~2.0, ~2.0.x, ~>2.0, ~>2.0.x --> >=2.0.0 <2.1.0-0
+// ~1.2, ~1.2.x, ~>1.2, ~>1.2.x --> >=1.2.0 <1.3.0-0
+// ~1.2.3, ~>1.2.3 --> >=1.2.3 <1.3.0-0
+// ~1.2.0, ~>1.2.0 --> >=1.2.0 <1.3.0-0
+// ~0.0.1 --> >=0.0.1 <0.1.0-0
+const replaceTildes = (comp, options) => {
+  return comp
+    .trim()
+    .split(/\s+/)
+    .map((c) => replaceTilde(c, options))
+    .join(' ')
+}
+
+const replaceTilde = (comp, options) => {
+  const r = options.loose ? re[t.TILDELOOSE] : re[t.TILDE]
+  return comp.replace(r, (_, M, m, p, pr) => {
+    debug('tilde', comp, _, M, m, p, pr)
+    let ret
+
+    if (isX(M)) {
+      ret = ''
+    } else if (isX(m)) {
+      ret = `>=${M}.0.0 <${+M + 1}.0.0-0`
+    } else if (isX(p)) {
+      // ~1.2 == >=1.2.0 <1.3.0-0
+      ret = `>=${M}.${m}.0 <${M}.${+m + 1}.0-0`
+    } else if (pr) {
+      debug('replaceTilde pr', pr)
+      ret = `>=${M}.${m}.${p}-${pr
+      } <${M}.${+m + 1}.0-0`
+    } else {
+      // ~1.2.3 == >=1.2.3 <1.3.0-0
+      ret = `>=${M}.${m}.${p
+      } <${M}.${+m + 1}.0-0`
+    }
+
+    debug('tilde return', ret)
+    return ret
+  })
+}
+
+// ^ --> * (any, kinda silly)
+// ^2, ^2.x, ^2.x.x --> >=2.0.0 <3.0.0-0
+// ^2.0, ^2.0.x --> >=2.0.0 <3.0.0-0
+// ^1.2, ^1.2.x --> >=1.2.0 <2.0.0-0
+// ^1.2.3 --> >=1.2.3 <2.0.0-0
+// ^1.2.0 --> >=1.2.0 <2.0.0-0
+// ^0.0.1 --> >=0.0.1 <0.0.2-0
+// ^0.1.0 --> >=0.1.0 <0.2.0-0
+const replaceCarets = (comp, options) => {
+  return comp
+    .trim()
+    .split(/\s+/)
+    .map((c) => replaceCaret(c, options))
+    .join(' ')
+}
+
+const replaceCaret = (comp, options) => {
+  debug('caret', comp, options)
+  const r = options.loose ? re[t.CARETLOOSE] : re[t.CARET]
+  const z = options.includePrerelease ? '-0' : ''
+  return comp.replace(r, (_, M, m, p, pr) => {
+    debug('caret', comp, _, M, m, p, pr)
+    let ret
+
+    if (isX(M)) {
+      ret = ''
+    } else if (isX(m)) {
+      ret = `>=${M}.0.0${z} <${+M + 1}.0.0-0`
+    } else if (isX(p)) {
+      if (M === '0') {
+        ret = `>=${M}.${m}.0${z} <${M}.${+m + 1}.0-0`
+      } else {
+        ret = `>=${M}.${m}.0${z} <${+M + 1}.0.0-0`
+      }
+    } else if (pr) {
+      debug('replaceCaret pr', pr)
+      if (M === '0') {
+        if (m === '0') {
+          ret = `>=${M}.${m}.${p}-${pr
+          } <${M}.${m}.${+p + 1}-0`
+        } else {
+          ret = `>=${M}.${m}.${p}-${pr
+          } <${M}.${+m + 1}.0-0`
+        }
+      } else {
+        ret = `>=${M}.${m}.${p}-${pr
+        } <${+M + 1}.0.0-0`
+      }
+    } else {
+      debug('no pr')
+      if (M === '0') {
+        if (m === '0') {
+          ret = `>=${M}.${m}.${p
+          }${z} <${M}.${m}.${+p + 1}-0`
+        } else {
+          ret = `>=${M}.${m}.${p
+          }${z} <${M}.${+m + 1}.0-0`
+        }
+      } else {
+        ret = `>=${M}.${m}.${p
+        } <${+M + 1}.0.0-0`
+      }
+    }
+
+    debug('caret return', ret)
+    return ret
+  })
+}
+
+const replaceXRanges = (comp, options) => {
+  debug('replaceXRanges', comp, options)
+  return comp
+    .split(/\s+/)
+    .map((c) => replaceXRange(c, options))
+    .join(' ')
+}
+
+const replaceXRange = (comp, options) => {
+  comp = comp.trim()
+  const r = options.loose ? re[t.XRANGELOOSE] : re[t.XRANGE]
+  return comp.replace(r, (ret, gtlt, M, m, p, pr) => {
+    debug('xRange', comp, ret, gtlt, M, m, p, pr)
+    const xM = isX(M)
+    const xm = xM || isX(m)
+    const xp = xm || isX(p)
+    const anyX = xp
+
+    if (gtlt === '=' && anyX) {
+      gtlt = ''
+    }
+
+    // if we're including prereleases in the match, then we need
+    // to fix this to -0, the lowest possible prerelease value
+    pr = options.includePrerelease ? '-0' : ''
+
+    if (xM) {
+      if (gtlt === '>' || gtlt === '<') {
+        // nothing is allowed
+        ret = '<0.0.0-0'
+      } else {
+        // nothing is forbidden
+        ret = '*'
+      }
+    } else if (gtlt && anyX) {
+      // we know patch is an x, because we have any x at all.
+      // replace X with 0
+      if (xm) {
+        m = 0
+      }
+      p = 0
+
+      if (gtlt === '>') {
+        // >1 => >=2.0.0
+        // >1.2 => >=1.3.0
+        gtlt = '>='
+        if (xm) {
+          M = +M + 1
+          m = 0
+          p = 0
+        } else {
+          m = +m + 1
+          p = 0
+        }
+      } else if (gtlt === '<=') {
+        // <=0.7.x is actually <0.8.0, since any 0.7.x should
+        // pass.  Similarly, <=7.x is actually <8.0.0, etc.
+        gtlt = '<'
+        if (xm) {
+          M = +M + 1
+        } else {
+          m = +m + 1
+        }
+      }
+
+      if (gtlt === '<') {
+        pr = '-0'
+      }
+
+      ret = `${gtlt + M}.${m}.${p}${pr}`
+    } else if (xm) {
+      ret = `>=${M}.0.0${pr} <${+M + 1}.0.0-0`
+    } else if (xp) {
+      ret = `>=${M}.${m}.0${pr
+      } <${M}.${+m + 1}.0-0`
+    }
+
+    debug('xRange return', ret)
+
+    return ret
+  })
+}
+
+// Because * is AND-ed with everything else in the comparator,
+// and '' means "any version", just remove the *s entirely.
+const replaceStars = (comp, options) => {
+  debug('replaceStars', comp, options)
+  // Looseness is ignored here.  star is always as loose as it gets!
+  return comp
+    .trim()
+    .replace(re[t.STAR], '')
+}
+
+const replaceGTE0 = (comp, options) => {
+  debug('replaceGTE0', comp, options)
+  return comp
+    .trim()
+    .replace(re[options.includePrerelease ? t.GTE0PRE : t.GTE0], '')
+}
+
+// This function is passed to string.replace(re[t.HYPHENRANGE])
+// M, m, patch, prerelease, build
+// 1.2 - 3.4.5 => >=1.2.0 <=3.4.5
+// 1.2.3 - 3.4 => >=1.2.0 <3.5.0-0 Any 3.4.x will do
+// 1.2 - 3.4 => >=1.2.0 <3.5.0-0
+// TODO build?
+const hyphenReplace = incPr => ($0,
+  from, fM, fm, fp, fpr, fb,
+  to, tM, tm, tp, tpr) => {
+  if (isX(fM)) {
+    from = ''
+  } else if (isX(fm)) {
+    from = `>=${fM}.0.0${incPr ? '-0' : ''}`
+  } else if (isX(fp)) {
+    from = `>=${fM}.${fm}.0${incPr ? '-0' : ''}`
+  } else if (fpr) {
+    from = `>=${from}`
+  } else {
+    from = `>=${from}${incPr ? '-0' : ''}`
+  }
+
+  if (isX(tM)) {
+    to = ''
+  } else if (isX(tm)) {
+    to = `<${+tM + 1}.0.0-0`
+  } else if (isX(tp)) {
+    to = `<${tM}.${+tm + 1}.0-0`
+  } else if (tpr) {
+    to = `<=${tM}.${tm}.${tp}-${tpr}`
+  } else if (incPr) {
+    to = `<${tM}.${tm}.${+tp + 1}-0`
+  } else {
+    to = `<=${to}`
+  }
+
+  return `${from} ${to}`.trim()
+}
+
+const testSet = (set, version, options) => {
+  for (let i = 0; i < set.length; i++) {
+    if (!set[i].test(version)) {
+      return false
+    }
+  }
+
+  if (version.prerelease.length && !options.includePrerelease) {
+    // Find the set of versions that are allowed to have prereleases
+    // For example, ^1.2.3-pr.1 desugars to >=1.2.3-pr.1 <2.0.0
+    // That should allow `1.2.3-pr.2` to pass.
+    // However, `1.2.4-alpha.notready` should NOT be allowed,
+    // even though it's within the range set by the comparators.
+    for (let i = 0; i < set.length; i++) {
+      debug(set[i].semver)
+      if (set[i].semver === Comparator.ANY) {
+        continue
+      }
+
+      if (set[i].semver.prerelease.length > 0) {
+        const allowed = set[i].semver
+        if (allowed.major === version.major &&
+            allowed.minor === version.minor &&
+            allowed.patch === version.patch) {
+          return true
+        }
+      }
+    }
+
+    // Version has a -pre, but it's not one of the ones we like.
+    return false
+  }
+
+  return true
+}
diff --git a/node_modules/semver/classes/semver.js b/node_modules/semver/classes/semver.js
new file mode 100644
index 0000000..92254be
--- /dev/null
+++ b/node_modules/semver/classes/semver.js
@@ -0,0 +1,333 @@
+'use strict'
+
+const debug = require('../internal/debug')
+const { MAX_LENGTH, MAX_SAFE_INTEGER } = require('../internal/constants')
+const { safeRe: re, t } = require('../internal/re')
+
+const parseOptions = require('../internal/parse-options')
+const { compareIdentifiers } = require('../internal/identifiers')
+class SemVer {
+  constructor (version, options) {
+    options = parseOptions(options)
+
+    if (version instanceof SemVer) {
+      if (version.loose === !!options.loose &&
+        version.includePrerelease === !!options.includePrerelease) {
+        return version
+      } else {
+        version = version.version
+      }
+    } else if (typeof version !== 'string') {
+      throw new TypeError(`Invalid version. Must be a string. Got type "${typeof version}".`)
+    }
+
+    if (version.length > MAX_LENGTH) {
+      throw new TypeError(
+        `version is longer than ${MAX_LENGTH} characters`
+      )
+    }
+
+    debug('SemVer', version, options)
+    this.options = options
+    this.loose = !!options.loose
+    // this isn't actually relevant for versions, but keep it so that we
+    // don't run into trouble passing this.options around.
+    this.includePrerelease = !!options.includePrerelease
+
+    const m = version.trim().match(options.loose ? re[t.LOOSE] : re[t.FULL])
+
+    if (!m) {
+      throw new TypeError(`Invalid Version: ${version}`)
+    }
+
+    this.raw = version
+
+    // these are actually numbers
+    this.major = +m[1]
+    this.minor = +m[2]
+    this.patch = +m[3]
+
+    if (this.major > MAX_SAFE_INTEGER || this.major < 0) {
+      throw new TypeError('Invalid major version')
+    }
+
+    if (this.minor > MAX_SAFE_INTEGER || this.minor < 0) {
+      throw new TypeError('Invalid minor version')
+    }
+
+    if (this.patch > MAX_SAFE_INTEGER || this.patch < 0) {
+      throw new TypeError('Invalid patch version')
+    }
+
+    // numberify any prerelease numeric ids
+    if (!m[4]) {
+      this.prerelease = []
+    } else {
+      this.prerelease = m[4].split('.').map((id) => {
+        if (/^[0-9]+$/.test(id)) {
+          const num = +id
+          if (num >= 0 && num < MAX_SAFE_INTEGER) {
+            return num
+          }
+        }
+        return id
+      })
+    }
+
+    this.build = m[5] ? m[5].split('.') : []
+    this.format()
+  }
+
+  format () {
+    this.version = `${this.major}.${this.minor}.${this.patch}`
+    if (this.prerelease.length) {
+      this.version += `-${this.prerelease.join('.')}`
+    }
+    return this.version
+  }
+
+  toString () {
+    return this.version
+  }
+
+  compare (other) {
+    debug('SemVer.compare', this.version, this.options, other)
+    if (!(other instanceof SemVer)) {
+      if (typeof other === 'string' && other === this.version) {
+        return 0
+      }
+      other = new SemVer(other, this.options)
+    }
+
+    if (other.version === this.version) {
+      return 0
+    }
+
+    return this.compareMain(other) || this.comparePre(other)
+  }
+
+  compareMain (other) {
+    if (!(other instanceof SemVer)) {
+      other = new SemVer(other, this.options)
+    }
+
+    if (this.major < other.major) {
+      return -1
+    }
+    if (this.major > other.major) {
+      return 1
+    }
+    if (this.minor < other.minor) {
+      return -1
+    }
+    if (this.minor > other.minor) {
+      return 1
+    }
+    if (this.patch < other.patch) {
+      return -1
+    }
+    if (this.patch > other.patch) {
+      return 1
+    }
+    return 0
+  }
+
+  comparePre (other) {
+    if (!(other instanceof SemVer)) {
+      other = new SemVer(other, this.options)
+    }
+
+    // NOT having a prerelease is > having one
+    if (this.prerelease.length && !other.prerelease.length) {
+      return -1
+    } else if (!this.prerelease.length && other.prerelease.length) {
+      return 1
+    } else if (!this.prerelease.length && !other.prerelease.length) {
+      return 0
+    }
+
+    let i = 0
+    do {
+      const a = this.prerelease[i]
+      const b = other.prerelease[i]
+      debug('prerelease compare', i, a, b)
+      if (a === undefined && b === undefined) {
+        return 0
+      } else if (b === undefined) {
+        return 1
+      } else if (a === undefined) {
+        return -1
+      } else if (a === b) {
+        continue
+      } else {
+        return compareIdentifiers(a, b)
+      }
+    } while (++i)
+  }
+
+  compareBuild (other) {
+    if (!(other instanceof SemVer)) {
+      other = new SemVer(other, this.options)
+    }
+
+    let i = 0
+    do {
+      const a = this.build[i]
+      const b = other.build[i]
+      debug('build compare', i, a, b)
+      if (a === undefined && b === undefined) {
+        return 0
+      } else if (b === undefined) {
+        return 1
+      } else if (a === undefined) {
+        return -1
+      } else if (a === b) {
+        continue
+      } else {
+        return compareIdentifiers(a, b)
+      }
+    } while (++i)
+  }
+
+  // preminor will bump the version up to the next minor release, and immediately
+  // down to pre-release. premajor and prepatch work the same way.
+  inc (release, identifier, identifierBase) {
+    if (release.startsWith('pre')) {
+      if (!identifier && identifierBase === false) {
+        throw new Error('invalid increment argument: identifier is empty')
+      }
+      // Avoid an invalid semver results
+      if (identifier) {
+        const match = `-${identifier}`.match(this.options.loose ? re[t.PRERELEASELOOSE] : re[t.PRERELEASE])
+        if (!match || match[1] !== identifier) {
+          throw new Error(`invalid identifier: ${identifier}`)
+        }
+      }
+    }
+
+    switch (release) {
+      case 'premajor':
+        this.prerelease.length = 0
+        this.patch = 0
+        this.minor = 0
+        this.major++
+        this.inc('pre', identifier, identifierBase)
+        break
+      case 'preminor':
+        this.prerelease.length = 0
+        this.patch = 0
+        this.minor++
+        this.inc('pre', identifier, identifierBase)
+        break
+      case 'prepatch':
+        // If this is already a prerelease, it will bump to the next version
+        // drop any prereleases that might already exist, since they are not
+        // relevant at this point.
+        this.prerelease.length = 0
+        this.inc('patch', identifier, identifierBase)
+        this.inc('pre', identifier, identifierBase)
+        break
+      // If the input is a non-prerelease version, this acts the same as
+      // prepatch.
+      case 'prerelease':
+        if (this.prerelease.length === 0) {
+          this.inc('patch', identifier, identifierBase)
+        }
+        this.inc('pre', identifier, identifierBase)
+        break
+      case 'release':
+        if (this.prerelease.length === 0) {
+          throw new Error(`version ${this.raw} is not a prerelease`)
+        }
+        this.prerelease.length = 0
+        break
+
+      case 'major':
+        // If this is a pre-major version, bump up to the same major version.
+        // Otherwise increment major.
+        // 1.0.0-5 bumps to 1.0.0
+        // 1.1.0 bumps to 2.0.0
+        if (
+          this.minor !== 0 ||
+          this.patch !== 0 ||
+          this.prerelease.length === 0
+        ) {
+          this.major++
+        }
+        this.minor = 0
+        this.patch = 0
+        this.prerelease = []
+        break
+      case 'minor':
+        // If this is a pre-minor version, bump up to the same minor version.
+        // Otherwise increment minor.
+        // 1.2.0-5 bumps to 1.2.0
+        // 1.2.1 bumps to 1.3.0
+        if (this.patch !== 0 || this.prerelease.length === 0) {
+          this.minor++
+        }
+        this.patch = 0
+        this.prerelease = []
+        break
+      case 'patch':
+        // If this is not a pre-release version, it will increment the patch.
+        // If it is a pre-release it will bump up to the same patch version.
+        // 1.2.0-5 patches to 1.2.0
+        // 1.2.0 patches to 1.2.1
+        if (this.prerelease.length === 0) {
+          this.patch++
+        }
+        this.prerelease = []
+        break
+      // This probably shouldn't be used publicly.
+      // 1.0.0 'pre' would become 1.0.0-0 which is the wrong direction.
+      case 'pre': {
+        const base = Number(identifierBase) ? 1 : 0
+
+        if (this.prerelease.length === 0) {
+          this.prerelease = [base]
+        } else {
+          let i = this.prerelease.length
+          while (--i >= 0) {
+            if (typeof this.prerelease[i] === 'number') {
+              this.prerelease[i]++
+              i = -2
+            }
+          }
+          if (i === -1) {
+            // didn't increment anything
+            if (identifier === this.prerelease.join('.') && identifierBase === false) {
+              throw new Error('invalid increment argument: identifier already exists')
+            }
+            this.prerelease.push(base)
+          }
+        }
+        if (identifier) {
+          // 1.2.0-beta.1 bumps to 1.2.0-beta.2,
+          // 1.2.0-beta.fooblz or 1.2.0-beta bumps to 1.2.0-beta.0
+          let prerelease = [identifier, base]
+          if (identifierBase === false) {
+            prerelease = [identifier]
+          }
+          if (compareIdentifiers(this.prerelease[0], identifier) === 0) {
+            if (isNaN(this.prerelease[1])) {
+              this.prerelease = prerelease
+            }
+          } else {
+            this.prerelease = prerelease
+          }
+        }
+        break
+      }
+      default:
+        throw new Error(`invalid increment argument: ${release}`)
+    }
+    this.raw = this.format()
+    if (this.build.length) {
+      this.raw += `+${this.build.join('.')}`
+    }
+    return this
+  }
+}
+
+module.exports = SemVer
diff --git a/node_modules/semver/functions/clean.js b/node_modules/semver/functions/clean.js
new file mode 100644
index 0000000..79703d6
--- /dev/null
+++ b/node_modules/semver/functions/clean.js
@@ -0,0 +1,8 @@
+'use strict'
+
+const parse = require('./parse')
+const clean = (version, options) => {
+  const s = parse(version.trim().replace(/^[=v]+/, ''), options)
+  return s ? s.version : null
+}
+module.exports = clean
diff --git a/node_modules/semver/functions/cmp.js b/node_modules/semver/functions/cmp.js
new file mode 100644
index 0000000..77487dc
--- /dev/null
+++ b/node_modules/semver/functions/cmp.js
@@ -0,0 +1,54 @@
+'use strict'
+
+const eq = require('./eq')
+const neq = require('./neq')
+const gt = require('./gt')
+const gte = require('./gte')
+const lt = require('./lt')
+const lte = require('./lte')
+
+const cmp = (a, op, b, loose) => {
+  switch (op) {
+    case '===':
+      if (typeof a === 'object') {
+        a = a.version
+      }
+      if (typeof b === 'object') {
+        b = b.version
+      }
+      return a === b
+
+    case '!==':
+      if (typeof a === 'object') {
+        a = a.version
+      }
+      if (typeof b === 'object') {
+        b = b.version
+      }
+      return a !== b
+
+    case '':
+    case '=':
+    case '==':
+      return eq(a, b, loose)
+
+    case '!=':
+      return neq(a, b, loose)
+
+    case '>':
+      return gt(a, b, loose)
+
+    case '>=':
+      return gte(a, b, loose)
+
+    case '<':
+      return lt(a, b, loose)
+
+    case '<=':
+      return lte(a, b, loose)
+
+    default:
+      throw new TypeError(`Invalid operator: ${op}`)
+  }
+}
+module.exports = cmp
diff --git a/node_modules/semver/functions/coerce.js b/node_modules/semver/functions/coerce.js
new file mode 100644
index 0000000..cfe0275
--- /dev/null
+++ b/node_modules/semver/functions/coerce.js
@@ -0,0 +1,62 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const parse = require('./parse')
+const { safeRe: re, t } = require('../internal/re')
+
+const coerce = (version, options) => {
+  if (version instanceof SemVer) {
+    return version
+  }
+
+  if (typeof version === 'number') {
+    version = String(version)
+  }
+
+  if (typeof version !== 'string') {
+    return null
+  }
+
+  options = options || {}
+
+  let match = null
+  if (!options.rtl) {
+    match = version.match(options.includePrerelease ? re[t.COERCEFULL] : re[t.COERCE])
+  } else {
+    // Find the right-most coercible string that does not share
+    // a terminus with a more left-ward coercible string.
+    // Eg, '1.2.3.4' wants to coerce '2.3.4', not '3.4' or '4'
+    // With includePrerelease option set, '1.2.3.4-rc' wants to coerce '2.3.4-rc', not '2.3.4'
+    //
+    // Walk through the string checking with a /g regexp
+    // Manually set the index so as to pick up overlapping matches.
+    // Stop when we get a match that ends at the string end, since no
+    // coercible string can be more right-ward without the same terminus.
+    const coerceRtlRegex = options.includePrerelease ? re[t.COERCERTLFULL] : re[t.COERCERTL]
+    let next
+    while ((next = coerceRtlRegex.exec(version)) &&
+        (!match || match.index + match[0].length !== version.length)
+    ) {
+      if (!match ||
+            next.index + next[0].length !== match.index + match[0].length) {
+        match = next
+      }
+      coerceRtlRegex.lastIndex = next.index + next[1].length + next[2].length
+    }
+    // leave it in a clean state
+    coerceRtlRegex.lastIndex = -1
+  }
+
+  if (match === null) {
+    return null
+  }
+
+  const major = match[2]
+  const minor = match[3] || '0'
+  const patch = match[4] || '0'
+  const prerelease = options.includePrerelease && match[5] ? `-${match[5]}` : ''
+  const build = options.includePrerelease && match[6] ? `+${match[6]}` : ''
+
+  return parse(`${major}.${minor}.${patch}${prerelease}${build}`, options)
+}
+module.exports = coerce
diff --git a/node_modules/semver/functions/compare-build.js b/node_modules/semver/functions/compare-build.js
new file mode 100644
index 0000000..99157cf
--- /dev/null
+++ b/node_modules/semver/functions/compare-build.js
@@ -0,0 +1,9 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const compareBuild = (a, b, loose) => {
+  const versionA = new SemVer(a, loose)
+  const versionB = new SemVer(b, loose)
+  return versionA.compare(versionB) || versionA.compareBuild(versionB)
+}
+module.exports = compareBuild
diff --git a/node_modules/semver/functions/compare-loose.js b/node_modules/semver/functions/compare-loose.js
new file mode 100644
index 0000000..7531634
--- /dev/null
+++ b/node_modules/semver/functions/compare-loose.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const compareLoose = (a, b) => compare(a, b, true)
+module.exports = compareLoose
diff --git a/node_modules/semver/functions/compare.js b/node_modules/semver/functions/compare.js
new file mode 100644
index 0000000..63d8090
--- /dev/null
+++ b/node_modules/semver/functions/compare.js
@@ -0,0 +1,7 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const compare = (a, b, loose) =>
+  new SemVer(a, loose).compare(new SemVer(b, loose))
+
+module.exports = compare
diff --git a/node_modules/semver/functions/diff.js b/node_modules/semver/functions/diff.js
new file mode 100644
index 0000000..c99ab51
--- /dev/null
+++ b/node_modules/semver/functions/diff.js
@@ -0,0 +1,60 @@
+'use strict'
+
+const parse = require('./parse.js')
+
+const diff = (version1, version2) => {
+  const v1 = parse(version1, null, true)
+  const v2 = parse(version2, null, true)
+  const comparison = v1.compare(v2)
+
+  if (comparison === 0) {
+    return null
+  }
+
+  const v1Higher = comparison > 0
+  const highVersion = v1Higher ? v1 : v2
+  const lowVersion = v1Higher ? v2 : v1
+  const highHasPre = !!highVersion.prerelease.length
+  const lowHasPre = !!lowVersion.prerelease.length
+
+  if (lowHasPre && !highHasPre) {
+    // Going from prerelease -> no prerelease requires some special casing
+
+    // If the low version has only a major, then it will always be a major
+    // Some examples:
+    // 1.0.0-1 -> 1.0.0
+    // 1.0.0-1 -> 1.1.1
+    // 1.0.0-1 -> 2.0.0
+    if (!lowVersion.patch && !lowVersion.minor) {
+      return 'major'
+    }
+
+    // If the main part has no difference
+    if (lowVersion.compareMain(highVersion) === 0) {
+      if (lowVersion.minor && !lowVersion.patch) {
+        return 'minor'
+      }
+      return 'patch'
+    }
+  }
+
+  // add the `pre` prefix if we are going to a prerelease version
+  const prefix = highHasPre ? 'pre' : ''
+
+  if (v1.major !== v2.major) {
+    return prefix + 'major'
+  }
+
+  if (v1.minor !== v2.minor) {
+    return prefix + 'minor'
+  }
+
+  if (v1.patch !== v2.patch) {
+    return prefix + 'patch'
+  }
+
+  // high and low are prereleases
+  return 'prerelease'
+}
+
+module.exports = diff
diff --git a/node_modules/semver/functions/eq.js b/node_modules/semver/functions/eq.js
new file mode 100644
index 0000000..5f0eead
--- /dev/null
+++ b/node_modules/semver/functions/eq.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const eq = (a, b, loose) => compare(a, b, loose) === 0
+module.exports = eq
diff --git a/node_modules/semver/functions/gt.js b/node_modules/semver/functions/gt.js
new file mode 100644
index 0000000..84a57dd
--- /dev/null
+++ b/node_modules/semver/functions/gt.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const gt = (a, b, loose) => compare(a, b, loose) > 0
+module.exports = gt
diff --git a/node_modules/semver/functions/gte.js b/node_modules/semver/functions/gte.js
new file mode 100644
index 0000000..7c52bdf
--- /dev/null
+++ b/node_modules/semver/functions/gte.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const gte = (a, b, loose) => compare(a, b, loose) >= 0
+module.exports = gte
diff --git a/node_modules/semver/functions/inc.js b/node_modules/semver/functions/inc.js
new file mode 100644
index 0000000..ff999e9
--- /dev/null
+++ b/node_modules/semver/functions/inc.js
@@ -0,0 +1,21 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+
+const inc = (version, release, options, identifier, identifierBase) => {
+  if (typeof (options) === 'string') {
+    identifierBase = identifier
+    identifier = options
+    options = undefined
+  }
+
+  try {
+    return new SemVer(
+      version instanceof SemVer ? version.version : version,
+      options
+    ).inc(release, identifier, identifierBase).version
+  } catch (er) {
+    return null
+  }
+}
+module.exports = inc
diff --git a/node_modules/semver/functions/lt.js b/node_modules/semver/functions/lt.js
new file mode 100644
index 0000000..2fb32a0
--- /dev/null
+++ b/node_modules/semver/functions/lt.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const lt = (a, b, loose) => compare(a, b, loose) < 0
+module.exports = lt
diff --git a/node_modules/semver/functions/lte.js b/node_modules/semver/functions/lte.js
new file mode 100644
index 0000000..da9ee8f
--- /dev/null
+++ b/node_modules/semver/functions/lte.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const lte = (a, b, loose) => compare(a, b, loose) <= 0
+module.exports = lte
diff --git a/node_modules/semver/functions/major.js b/node_modules/semver/functions/major.js
new file mode 100644
index 0000000..e6d08dc
--- /dev/null
+++ b/node_modules/semver/functions/major.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const major = (a, loose) => new SemVer(a, loose).major
+module.exports = major
diff --git a/node_modules/semver/functions/minor.js b/node_modules/semver/functions/minor.js
new file mode 100644
index 0000000..9e70ffd
--- /dev/null
+++ b/node_modules/semver/functions/minor.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const minor = (a, loose) => new SemVer(a, loose).minor
+module.exports = minor
diff --git a/node_modules/semver/functions/neq.js b/node_modules/semver/functions/neq.js
new file mode 100644
index 0000000..84326b7
--- /dev/null
+++ b/node_modules/semver/functions/neq.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const neq = (a, b, loose) => compare(a, b, loose) !== 0
+module.exports = neq
diff --git a/node_modules/semver/functions/parse.js b/node_modules/semver/functions/parse.js
new file mode 100644
index 0000000..d544d33
--- /dev/null
+++ b/node_modules/semver/functions/parse.js
@@ -0,0 +1,18 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const parse = (version, options, throwErrors = false) => {
+  if (version instanceof SemVer) {
+    return version
+  }
+  try {
+    return new SemVer(version, options)
+  } catch (er) {
+    if (!throwErrors) {
+      return null
+    }
+    throw er
+  }
+}
+
+module.exports = parse
diff --git a/node_modules/semver/functions/patch.js b/node_modules/semver/functions/patch.js
new file mode 100644
index 0000000..7675162
--- /dev/null
+++ b/node_modules/semver/functions/patch.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const patch = (a, loose) => new SemVer(a, loose).patch
+module.exports = patch
diff --git a/node_modules/semver/functions/prerelease.js b/node_modules/semver/functions/prerelease.js
new file mode 100644
index 0000000..b8fe1db
--- /dev/null
+++ b/node_modules/semver/functions/prerelease.js
@@ -0,0 +1,8 @@
+'use strict'
+
+const parse = require('./parse')
+const prerelease = (version, options) => {
+  const parsed = parse(version, options)
+  return (parsed && parsed.prerelease.length) ? parsed.prerelease : null
+}
+module.exports = prerelease
diff --git a/node_modules/semver/functions/rcompare.js b/node_modules/semver/functions/rcompare.js
new file mode 100644
index 0000000..8e1c222
--- /dev/null
+++ b/node_modules/semver/functions/rcompare.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compare = require('./compare')
+const rcompare = (a, b, loose) => compare(b, a, loose)
+module.exports = rcompare
diff --git a/node_modules/semver/functions/rsort.js b/node_modules/semver/functions/rsort.js
new file mode 100644
index 0000000..5d3d200
--- /dev/null
+++ b/node_modules/semver/functions/rsort.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compareBuild = require('./compare-build')
+const rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose))
+module.exports = rsort
diff --git a/node_modules/semver/functions/satisfies.js b/node_modules/semver/functions/satisfies.js
new file mode 100644
index 0000000..a0264a2
--- /dev/null
+++ b/node_modules/semver/functions/satisfies.js
@@ -0,0 +1,12 @@
+'use strict'
+
+const Range = require('../classes/range')
+const satisfies = (version, range, options) => {
+  try {
+    range = new Range(range, options)
+  } catch (er) {
+    return false
+  }
+  return range.test(version)
+}
+module.exports = satisfies
diff --git a/node_modules/semver/functions/sort.js b/node_modules/semver/functions/sort.js
new file mode 100644
index 0000000..edb24b1
--- /dev/null
+++ b/node_modules/semver/functions/sort.js
@@ -0,0 +1,5 @@
+'use strict'
+
+const compareBuild = require('./compare-build')
+const sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose))
+module.exports = sort
diff --git a/node_modules/semver/functions/truncate.js b/node_modules/semver/functions/truncate.js
new file mode 100644
index 0000000..8314e4e
--- /dev/null
+++ b/node_modules/semver/functions/truncate.js
@@ -0,0 +1,48 @@
+'use strict'
+
+const parse = require('./parse')
+const constants = require('../internal/constants')
+const SemVer = require('../classes/semver')
+
+const truncate = (version, truncation, options) => {
+  if (!constants.RELEASE_TYPES.includes(truncation)) {
+    return null
+  }
+
+  const clonedVersion = cloneInputVersion(version, options)
+  return clonedVersion && doTruncation(clonedVersion, truncation)
+}
+
+const cloneInputVersion = (version, options) => {
+  const versionStringToParse = (
+    version instanceof SemVer ? version.version : version
+  )
+
+  return parse(versionStringToParse, options)
+}
+
+const doTruncation = (version, truncation) => {
+  if (isPrerelease(truncation)) {
+    return version.version
+  }
+
+  version.prerelease = []
+
+  switch (truncation) {
+    case 'major':
+      version.minor = 0
+      version.patch = 0
+      break
+    case 'minor':
+      version.patch = 0
+      break
+  }
+
+  return version.format()
+}
+
+const isPrerelease = (type) => {
+  return type.startsWith('pre')
+}
+
+module.exports = truncate
diff --git a/node_modules/semver/functions/valid.js b/node_modules/semver/functions/valid.js
new file mode 100644
index 0000000..0db67ed
--- /dev/null
+++ b/node_modules/semver/functions/valid.js
@@ -0,0 +1,8 @@
+'use strict'
+
+const parse = require('./parse')
+const valid = (version, options) => {
+  const v = parse(version, options)
+  return v ? v.version : null
+}
+module.exports = valid
diff --git a/node_modules/semver/index.js b/node_modules/semver/index.js
new file mode 100644
index 0000000..bc1f608
--- /dev/null
+++ b/node_modules/semver/index.js
@@ -0,0 +1,93 @@
+'use strict'
+
+// just pre-load all the stuff that index.js lazily exports
+const internalRe = require('./internal/re')
+const constants = require('./internal/constants')
+const SemVer = require('./classes/semver')
+const identifiers = require('./internal/identifiers')
+const parse = require('./functions/parse')
+const valid = require('./functions/valid')
+const clean = require('./functions/clean')
+const inc = require('./functions/inc')
+const diff = require('./functions/diff')
+const major = require('./functions/major')
+const minor = require('./functions/minor')
+const patch = require('./functions/patch')
+const prerelease = require('./functions/prerelease')
+const compare = require('./functions/compare')
+const rcompare = require('./functions/rcompare')
+const compareLoose = require('./functions/compare-loose')
+const compareBuild = require('./functions/compare-build')
+const sort = require('./functions/sort')
+const rsort = require('./functions/rsort')
+const gt = require('./functions/gt')
+const lt = require('./functions/lt')
+const eq = require('./functions/eq')
+const neq = require('./functions/neq')
+const gte = require('./functions/gte')
+const lte = require('./functions/lte')
+const cmp = require('./functions/cmp')
+const coerce = require('./functions/coerce')
+const truncate = require('./functions/truncate')
+const Comparator = require('./classes/comparator')
+const Range = require('./classes/range')
+const satisfies = require('./functions/satisfies')
+const toComparators = require('./ranges/to-comparators')
+const maxSatisfying = require('./ranges/max-satisfying')
+const minSatisfying = require('./ranges/min-satisfying')
+const minVersion = require('./ranges/min-version')
+const validRange = require('./ranges/valid')
+const outside = require('./ranges/outside')
+const gtr = require('./ranges/gtr')
+const ltr = require('./ranges/ltr')
+const intersects = require('./ranges/intersects')
+const simplifyRange = require('./ranges/simplify')
+const subset = require('./ranges/subset')
+module.exports = {
+  parse,
+  valid,
+  clean,
+  inc,
+  diff,
+  major,
+  minor,
+  patch,
+  prerelease,
+  compare,
+  rcompare,
+  compareLoose,
+  compareBuild,
+  sort,
+  rsort,
+  gt,
+  lt,
+  eq,
+  neq,
+  gte,
+  lte,
+  cmp,
+  coerce,
+  truncate,
+  Comparator,
+  Range,
+  satisfies,
+  toComparators,
+  maxSatisfying,
+  minSatisfying,
+  minVersion,
+  validRange,
+  outside,
+  gtr,
+  ltr,
+  intersects,
+  simplifyRange,
+  subset,
+  SemVer,
+  re: internalRe.re,
+  src: internalRe.src,
+  tokens: internalRe.t,
+  SEMVER_SPEC_VERSION: constants.SEMVER_SPEC_VERSION,
+  RELEASE_TYPES: constants.RELEASE_TYPES,
+  compareIdentifiers: identifiers.compareIdentifiers,
+  rcompareIdentifiers: identifiers.rcompareIdentifiers,
+}
diff --git a/node_modules/semver/internal/constants.js b/node_modules/semver/internal/constants.js
new file mode 100644
index 0000000..6d1db91
--- /dev/null
+++ b/node_modules/semver/internal/constants.js
@@ -0,0 +1,37 @@
+'use strict'
+
+// Note: this is the semver.org version of the spec that it implements
+// Not necessarily the package version of this code.
+const SEMVER_SPEC_VERSION = '2.0.0'
+
+const MAX_LENGTH = 256
+const MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER ||
+/* istanbul ignore next */ 9007199254740991
+
+// Max safe segment length for coercion.
+const MAX_SAFE_COMPONENT_LENGTH = 16
+
+// Max safe length for a build identifier. The max length minus 6 characters for
+// the shortest version with a build 0.0.0+BUILD.
+const MAX_SAFE_BUILD_LENGTH = MAX_LENGTH - 6
+
+const RELEASE_TYPES = [
+  'major',
+  'premajor',
+  'minor',
+  'preminor',
+  'patch',
+  'prepatch',
+  'prerelease',
+]
+
+module.exports = {
+  MAX_LENGTH,
+  MAX_SAFE_COMPONENT_LENGTH,
+  MAX_SAFE_BUILD_LENGTH,
+  MAX_SAFE_INTEGER,
+  RELEASE_TYPES,
+  SEMVER_SPEC_VERSION,
+  FLAG_INCLUDE_PRERELEASE: 0b001,
+  FLAG_LOOSE: 0b010,
+}
diff --git a/node_modules/semver/internal/debug.js b/node_modules/semver/internal/debug.js
new file mode 100644
index 0000000..20d1e9d
--- /dev/null
+++ b/node_modules/semver/internal/debug.js
@@ -0,0 +1,11 @@
+'use strict'
+
+const debug = (
+  typeof process === 'object' &&
+  process.env &&
+  process.env.NODE_DEBUG &&
+  /\bsemver\b/i.test(process.env.NODE_DEBUG)
+) ? (...args) => console.error('SEMVER', ...args)
+  : () => {}
+
+module.exports = debug
diff --git a/node_modules/semver/internal/identifiers.js b/node_modules/semver/internal/identifiers.js
new file mode 100644
index 0000000..d053472
--- /dev/null
+++ b/node_modules/semver/internal/identifiers.js
@@ -0,0 +1,29 @@
+'use strict'
+
+const numeric = /^[0-9]+$/
+const compareIdentifiers = (a, b) => {
+  if (typeof a === 'number' && typeof b === 'number') {
+    return a === b ? 0 : a < b ? -1 : 1
+  }
+
+  const anum = numeric.test(a)
+  const bnum = numeric.test(b)
+
+  if (anum && bnum) {
+    a = +a
+    b = +b
+  }
+
+  return a === b ? 0
+    : (anum && !bnum) ? -1
+    : (bnum && !anum) ? 1
+    : a < b ? -1
+    : 1
+}
+
+const rcompareIdentifiers = (a, b) => compareIdentifiers(b, a)
+
+module.exports = {
+  compareIdentifiers,
+  rcompareIdentifiers,
+}
diff --git a/node_modules/semver/internal/lrucache.js b/node_modules/semver/internal/lrucache.js
new file mode 100644
index 0000000..b8bf526
--- /dev/null
+++ b/node_modules/semver/internal/lrucache.js
@@ -0,0 +1,42 @@
+'use strict'
+
+class LRUCache {
+  constructor () {
+    this.max = 1000
+    this.map = new Map()
+  }
+
+  get (key) {
+    const value = this.map.get(key)
+    if (value === undefined) {
+      return undefined
+    } else {
+      // Remove the key from the map and add it to the end
+      this.map.delete(key)
+      this.map.set(key, value)
+      return value
+    }
+  }
+
+  delete (key) {
+    return this.map.delete(key)
+  }
+
+  set (key, value) {
+    const deleted = this.delete(key)
+
+    if (!deleted && value !== undefined) {
+      // If cache is full, delete the least recently used item
+      if (this.map.size >= this.max) {
+        const firstKey = this.map.keys().next().value
+        this.delete(firstKey)
+      }
+
+      this.map.set(key, value)
+    }
+
+    return this
+  }
+}
+
+module.exports = LRUCache
diff --git a/node_modules/semver/internal/parse-options.js b/node_modules/semver/internal/parse-options.js
new file mode 100644
index 0000000..5295454
--- /dev/null
+++ b/node_modules/semver/internal/parse-options.js
@@ -0,0 +1,17 @@
+'use strict'
+
+// parse out just the options we care about
+const looseOption = Object.freeze({ loose: true })
+const emptyOpts = Object.freeze({ })
+const parseOptions = options => {
+  if (!options) {
+    return emptyOpts
+  }
+
+  if (typeof options !== 'object') {
+    return looseOption
+  }
+
+  return options
+}
+module.exports = parseOptions
diff --git a/node_modules/semver/internal/re.js b/node_modules/semver/internal/re.js
new file mode 100644
index 0000000..2ec2c22
--- /dev/null
+++ b/node_modules/semver/internal/re.js
@@ -0,0 +1,223 @@
+'use strict'
+
+const {
+  MAX_SAFE_COMPONENT_LENGTH,
+  MAX_SAFE_BUILD_LENGTH,
+  MAX_LENGTH,
+} = require('./constants')
+const debug = require('./debug')
+exports = module.exports = {}
+
+// The actual regexps go on exports.re
+const re = exports.re = []
+const safeRe = exports.safeRe = []
+const src = exports.src = []
+const safeSrc = exports.safeSrc = []
+const t = exports.t = {}
+let R = 0
+
+const LETTERDASHNUMBER = '[a-zA-Z0-9-]'
+
+// Replace some greedy regex tokens to prevent regex dos issues. These regex are
+// used internally via the safeRe object since all inputs in this library get
+// normalized first to trim and collapse all extra whitespace. The original
+// regexes are exported for userland consumption and lower level usage. A
+// future breaking change could export the safer regex only with a note that
+// all input should have extra whitespace removed.
+const safeRegexReplacements = [
+  ['\\s', 1],
+  ['\\d', MAX_LENGTH],
+  [LETTERDASHNUMBER, MAX_SAFE_BUILD_LENGTH],
+]
+
+const makeSafeRegex = (value) => {
+  for (const [token, max] of safeRegexReplacements) {
+    value = value
+      .split(`${token}*`).join(`${token}{0,${max}}`)
+      .split(`${token}+`).join(`${token}{1,${max}}`)
+  }
+  return value
+}
+
+const createToken = (name, value, isGlobal) => {
+  const safe = makeSafeRegex(value)
+  const index = R++
+  debug(name, index, value)
+  t[name] = index
+  src[index] = value
+  safeSrc[index] = safe
+  re[index] = new RegExp(value, isGlobal ? 'g' : undefined)
+  safeRe[index] = new RegExp(safe, isGlobal ? 'g' : undefined)
+}
+
+// The following Regular Expressions can be used for tokenizing,
+// validating, and parsing SemVer version strings.
+
+// ## Numeric Identifier
+// A single `0`, or a non-zero digit followed by zero or more digits.
+
+createToken('NUMERICIDENTIFIER', '0|[1-9]\\d*')
+createToken('NUMERICIDENTIFIERLOOSE', '\\d+')
+
+// ## Non-numeric Identifier
+// Zero or more digits, followed by a letter or hyphen, and then zero or
+// more letters, digits, or hyphens.
+
+createToken('NONNUMERICIDENTIFIER', `\\d*[a-zA-Z-]${LETTERDASHNUMBER}*`)
+
+// ## Main Version
+// Three dot-separated numeric identifiers.
+
+createToken('MAINVERSION', `(${src[t.NUMERICIDENTIFIER]})\\.` +
+                   `(${src[t.NUMERICIDENTIFIER]})\\.` +
+                   `(${src[t.NUMERICIDENTIFIER]})`)
+
+createToken('MAINVERSIONLOOSE', `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` +
+                        `(${src[t.NUMERICIDENTIFIERLOOSE]})\\.` +
+                        `(${src[t.NUMERICIDENTIFIERLOOSE]})`)
+
+// ## Pre-release Version Identifier
+// A numeric identifier, or a non-numeric identifier.
+// Non-numeric identifiers include numeric identifiers but can be longer.
+// Therefore non-numeric identifiers must go first.
+
+createToken('PRERELEASEIDENTIFIER', `(?:${src[t.NONNUMERICIDENTIFIER]
+}|${src[t.NUMERICIDENTIFIER]})`)
+
+createToken('PRERELEASEIDENTIFIERLOOSE', `(?:${src[t.NONNUMERICIDENTIFIER]
+}|${src[t.NUMERICIDENTIFIERLOOSE]})`)
+
+// ## Pre-release Version
+// Hyphen, followed by one or more dot-separated pre-release version
+// identifiers.
+
+createToken('PRERELEASE', `(?:-(${src[t.PRERELEASEIDENTIFIER]
+}(?:\\.${src[t.PRERELEASEIDENTIFIER]})*))`)
+
+createToken('PRERELEASELOOSE', `(?:-?(${src[t.PRERELEASEIDENTIFIERLOOSE]
+}(?:\\.${src[t.PRERELEASEIDENTIFIERLOOSE]})*))`)
+
+// ## Build Metadata Identifier
+// Any combination of digits, letters, or hyphens.
+
+createToken('BUILDIDENTIFIER', `${LETTERDASHNUMBER}+`)
+
+// ## Build Metadata
+// Plus sign, followed by one or more period-separated build metadata
+// identifiers.
+
+createToken('BUILD', `(?:\\+(${src[t.BUILDIDENTIFIER]
+}(?:\\.${src[t.BUILDIDENTIFIER]})*))`)
+
+// ## Full Version String
+// A main version, followed optionally by a pre-release version and
+// build metadata.
+
+// Note that the only major, minor, patch, and pre-release sections of
+// the version string are capturing groups.  The build metadata is not a
+// capturing group, because it should not ever be used in version
+// comparison.
+
+createToken('FULLPLAIN', `v?${src[t.MAINVERSION]
+}${src[t.PRERELEASE]}?${
+  src[t.BUILD]}?`)
+
+createToken('FULL', `^${src[t.FULLPLAIN]}$`)
+
+// like full, but allows v1.2.3 and =1.2.3, which people do sometimes.
+// also, 1.0.0alpha1 (prerelease without the hyphen) which is pretty
+// common in the npm registry.
+createToken('LOOSEPLAIN', `[v=\\s]*${src[t.MAINVERSIONLOOSE]
+}${src[t.PRERELEASELOOSE]}?${
+  src[t.BUILD]}?`)
+
+createToken('LOOSE', `^${src[t.LOOSEPLAIN]}$`)
+
+createToken('GTLT', '((?:<|>)?=?)')
+
+// Something like "2.*" or "1.2.x".
+// Note that "x.x" is a valid xRange identifier, meaning "any version"
+// Only the first item is strictly required.
+createToken('XRANGEIDENTIFIERLOOSE', `${src[t.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`)
+createToken('XRANGEIDENTIFIER', `${src[t.NUMERICIDENTIFIER]}|x|X|\\*`)
+
+createToken('XRANGEPLAIN', `[v=\\s]*(${src[t.XRANGEIDENTIFIER]})` +
+                   `(?:\\.(${src[t.XRANGEIDENTIFIER]})` +
+                   `(?:\\.(${src[t.XRANGEIDENTIFIER]})` +
+                   `(?:${src[t.PRERELEASE]})?${
+                     src[t.BUILD]}?` +
+                   `)?)?`)
+
+createToken('XRANGEPLAINLOOSE', `[v=\\s]*(${src[t.XRANGEIDENTIFIERLOOSE]})` +
+                        `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +
+                        `(?:\\.(${src[t.XRANGEIDENTIFIERLOOSE]})` +
+                        `(?:${src[t.PRERELEASELOOSE]})?${
+                          src[t.BUILD]}?` +
+                        `)?)?`)
+
+createToken('XRANGE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAIN]}$`)
+createToken('XRANGELOOSE', `^${src[t.GTLT]}\\s*${src[t.XRANGEPLAINLOOSE]}$`)
+
+// Coercion.
+// Extract anything that could conceivably be a part of a valid semver
+createToken('COERCEPLAIN', `${'(^|[^\\d])' +
+              '(\\d{1,'}${MAX_SAFE_COMPONENT_LENGTH}})` +
+              `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?` +
+              `(?:\\.(\\d{1,${MAX_SAFE_COMPONENT_LENGTH}}))?`)
+createToken('COERCE', `${src[t.COERCEPLAIN]}(?:$|[^\\d])`)
+createToken('COERCEFULL', src[t.COERCEPLAIN] +
+              `(?:${src[t.PRERELEASE]})?` +
+              `(?:${src[t.BUILD]})?` +
+              `(?:$|[^\\d])`)
+createToken('COERCERTL', src[t.COERCE], true)
+createToken('COERCERTLFULL', src[t.COERCEFULL], true)
+
+// Tilde ranges.
+// Meaning is "reasonably at or greater than"
+createToken('LONETILDE', '(?:~>?)')
+
+createToken('TILDETRIM', `(\\s*)${src[t.LONETILDE]}\\s+`, true)
+exports.tildeTrimReplace = '$1~'
+
+createToken('TILDE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAIN]}$`)
+createToken('TILDELOOSE', `^${src[t.LONETILDE]}${src[t.XRANGEPLAINLOOSE]}$`)
+
+// Caret ranges.
+// Meaning is "at least and backwards compatible with"
+createToken('LONECARET', '(?:\\^)')
+
+createToken('CARETTRIM', `(\\s*)${src[t.LONECARET]}\\s+`, true)
+exports.caretTrimReplace = '$1^'
+
+createToken('CARET', `^${src[t.LONECARET]}${src[t.XRANGEPLAIN]}$`)
+createToken('CARETLOOSE', `^${src[t.LONECARET]}${src[t.XRANGEPLAINLOOSE]}$`)
+
+// A simple gt/lt/eq thing, or just "" to indicate "any version"
+createToken('COMPARATORLOOSE', `^${src[t.GTLT]}\\s*(${src[t.LOOSEPLAIN]})$|^$`)
+createToken('COMPARATOR', `^${src[t.GTLT]}\\s*(${src[t.FULLPLAIN]})$|^$`)
+
+// An expression to strip any whitespace between the gtlt and the thing
+// it modifies, so that `> 1.2.3` ==> `>1.2.3`
+createToken('COMPARATORTRIM', `(\\s*)${src[t.GTLT]
+}\\s*(${src[t.LOOSEPLAIN]}|${src[t.XRANGEPLAIN]})`, true)
+exports.comparatorTrimReplace = '$1$2$3'
+
+// Something like `1.2.3 - 1.2.4`
+// Note that these all use the loose form, because they'll be
+// checked against either the strict or loose comparator form
+// later.
+createToken('HYPHENRANGE', `^\\s*(${src[t.XRANGEPLAIN]})` +
+                   `\\s+-\\s+` +
+                   `(${src[t.XRANGEPLAIN]})` +
+                   `\\s*$`)
+
+createToken('HYPHENRANGELOOSE', `^\\s*(${src[t.XRANGEPLAINLOOSE]})` +
+                        `\\s+-\\s+` +
+                        `(${src[t.XRANGEPLAINLOOSE]})` +
+                        `\\s*$`)
+
+// Star ranges basically just allow anything at all.
+createToken('STAR', '(<|>)?=?\\s*\\*')
+// >=0.0.0 is like a star
+createToken('GTE0', '^\\s*>=\\s*0\\.0\\.0\\s*$')
+createToken('GTE0PRE', '^\\s*>=\\s*0\\.0\\.0-0\\s*$')
diff --git a/node_modules/semver/package.json b/node_modules/semver/package.json
new file mode 100644
index 0000000..f8447c4
--- /dev/null
+++ b/node_modules/semver/package.json
@@ -0,0 +1,78 @@
+{
+  "name": "semver",
+  "version": "7.8.0",
+  "description": "The semantic version parser used by npm.",
+  "main": "index.js",
+  "scripts": {
+    "test": "tap",
+    "snap": "tap",
+    "lint": "npm run eslint",
+    "postlint": "template-oss-check",
+    "lintfix": "npm run eslint -- --fix",
+    "posttest": "npm run lint",
+    "template-oss-apply": "template-oss-apply --force",
+    "eslint": "eslint \"**/*.{js,cjs,ts,mjs,jsx,tsx}\""
+  },
+  "devDependencies": {
+    "@npmcli/eslint-config": "^6.0.0",
+    "@npmcli/template-oss": "5.0.0",
+    "benchmark": "^2.1.4",
+    "tap": "^16.0.0"
+  },
+  "license": "ISC",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/npm/node-semver.git"
+  },
+  "bin": {
+    "semver": "bin/semver.js"
+  },
+  "files": [
+    "bin/",
+    "lib/",
+    "classes/",
+    "functions/",
+    "internal/",
+    "ranges/",
+    "index.js",
+    "preload.js",
+    "range.bnf"
+  ],
+  "tap": {
+    "timeout": 30,
+    "coverage-map": "map.js",
+    "nyc-arg": [
+      "--exclude",
+      "tap-snapshots/**"
+    ]
+  },
+  "engines": {
+    "node": ">=10"
+  },
+  "author": "GitHub Inc.",
+  "templateOSS": {
+    "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
+    "version": "5.0.0",
+    "engines": ">=10",
+    "distPaths": [
+      "classes/",
+      "functions/",
+      "internal/",
+      "ranges/",
+      "index.js",
+      "preload.js",
+      "range.bnf"
+    ],
+    "allowPaths": [
+      "/classes/",
+      "/functions/",
+      "/internal/",
+      "/ranges/",
+      "/index.js",
+      "/preload.js",
+      "/range.bnf",
+      "/benchmarks"
+    ],
+    "publish": "true"
+  }
+}
diff --git a/node_modules/semver/preload.js b/node_modules/semver/preload.js
new file mode 100644
index 0000000..e6c47b9
--- /dev/null
+++ b/node_modules/semver/preload.js
@@ -0,0 +1,4 @@
+'use strict'
+
+// XXX remove in v8 or beyond
+module.exports = require('./index.js')
diff --git a/node_modules/semver/range.bnf b/node_modules/semver/range.bnf
new file mode 100644
index 0000000..a7a4bc3
--- /dev/null
+++ b/node_modules/semver/range.bnf
@@ -0,0 +1,17 @@
+range-set  ::= range ( logical-or range ) *
+logical-or ::= ( ' ' ) * '||' ( ' ' ) *
+range      ::= hyphen | simple ( ' ' simple ) * | ''
+hyphen     ::= partial ' - ' partial
+simple     ::= primitive | partial | tilde | caret
+primitive  ::= ( '<' | '>' | '>=' | '<=' | '=' ) partial
+partial    ::= xr ( '.' xr ( '.' xr qualifier ? )? )?
+xr         ::= 'x' | 'X' | '*' | nr
+nr         ::= '0' | [1-9] ( [0-9] ) *
+tilde      ::= '~' partial
+caret      ::= '^' partial
+qualifier  ::= ( '-' pre )? ( '+' build )?
+pre        ::= prepart ( '.' prepart ) *
+prepart    ::= nr | alphanumid
+build      ::= buildid ( '.' buildid ) *
+alphanumid ::= ( [0-9] ) * [A-Za-z-] [-0-9A-Za-z] *
+buildid    ::= [-0-9A-Za-z]+
diff --git a/node_modules/semver/ranges/gtr.js b/node_modules/semver/ranges/gtr.js
new file mode 100644
index 0000000..0e7601f
--- /dev/null
+++ b/node_modules/semver/ranges/gtr.js
@@ -0,0 +1,6 @@
+'use strict'
+
+// Determine if version is greater than all the versions possible in the range.
+const outside = require('./outside')
+const gtr = (version, range, options) => outside(version, range, '>', options)
+module.exports = gtr
diff --git a/node_modules/semver/ranges/intersects.js b/node_modules/semver/ranges/intersects.js
new file mode 100644
index 0000000..917be7e
--- /dev/null
+++ b/node_modules/semver/ranges/intersects.js
@@ -0,0 +1,9 @@
+'use strict'
+
+const Range = require('../classes/range')
+const intersects = (r1, r2, options) => {
+  r1 = new Range(r1, options)
+  r2 = new Range(r2, options)
+  return r1.intersects(r2, options)
+}
+module.exports = intersects
diff --git a/node_modules/semver/ranges/ltr.js b/node_modules/semver/ranges/ltr.js
new file mode 100644
index 0000000..aa5e568
--- /dev/null
+++ b/node_modules/semver/ranges/ltr.js
@@ -0,0 +1,6 @@
+'use strict'
+
+const outside = require('./outside')
+// Determine if version is less than all the versions possible in the range
+const ltr = (version, range, options) => outside(version, range, '<', options)
+module.exports = ltr
diff --git a/node_modules/semver/ranges/max-satisfying.js b/node_modules/semver/ranges/max-satisfying.js
new file mode 100644
index 0000000..01fe5ae
--- /dev/null
+++ b/node_modules/semver/ranges/max-satisfying.js
@@ -0,0 +1,27 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const Range = require('../classes/range')
+
+const maxSatisfying = (versions, range, options) => {
+  let max = null
+  let maxSV = null
+  let rangeObj = null
+  try {
+    rangeObj = new Range(range, options)
+  } catch (er) {
+    return null
+  }
+  versions.forEach((v) => {
+    if (rangeObj.test(v)) {
+      // satisfies(v, range, options)
+      if (!max || maxSV.compare(v) === -1) {
+        // compare(max, v, true)
+        max = v
+        maxSV = new SemVer(max, options)
+      }
+    }
+  })
+  return max
+}
+module.exports = maxSatisfying
diff --git a/node_modules/semver/ranges/min-satisfying.js b/node_modules/semver/ranges/min-satisfying.js
new file mode 100644
index 0000000..af89c8e
--- /dev/null
+++ b/node_modules/semver/ranges/min-satisfying.js
@@ -0,0 +1,26 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const Range = require('../classes/range')
+const minSatisfying = (versions, range, options) => {
+  let min = null
+  let minSV = null
+  let rangeObj = null
+  try {
+    rangeObj = new Range(range, options)
+  } catch (er) {
+    return null
+  }
+  versions.forEach((v) => {
+    if (rangeObj.test(v)) {
+      // satisfies(v, range, options)
+      if (!min || minSV.compare(v) === 1) {
+        // compare(min, v, true)
+        min = v
+        minSV = new SemVer(min, options)
+      }
+    }
+  })
+  return min
+}
+module.exports = minSatisfying
diff --git a/node_modules/semver/ranges/min-version.js b/node_modules/semver/ranges/min-version.js
new file mode 100644
index 0000000..09a65aa
--- /dev/null
+++ b/node_modules/semver/ranges/min-version.js
@@ -0,0 +1,63 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const Range = require('../classes/range')
+const gt = require('../functions/gt')
+
+const minVersion = (range, loose) => {
+  range = new Range(range, loose)
+
+  let minver = new SemVer('0.0.0')
+  if (range.test(minver)) {
+    return minver
+  }
+
+  minver = new SemVer('0.0.0-0')
+  if (range.test(minver)) {
+    return minver
+  }
+
+  minver = null
+  for (let i = 0; i < range.set.length; ++i) {
+    const comparators = range.set[i]
+
+    let setMin = null
+    comparators.forEach((comparator) => {
+      // Clone to avoid manipulating the comparator's semver object.
+      const compver = new SemVer(comparator.semver.version)
+      switch (comparator.operator) {
+        case '>':
+          if (compver.prerelease.length === 0) {
+            compver.patch++
+          } else {
+            compver.prerelease.push(0)
+          }
+          compver.raw = compver.format()
+          /* fallthrough */
+        case '':
+        case '>=':
+          if (!setMin || gt(compver, setMin)) {
+            setMin = compver
+          }
+          break
+        case '<':
+        case '<=':
+          /* Ignore maximum versions */
+          break
+        /* istanbul ignore next */
+        default:
+          throw new Error(`Unexpected operation: ${comparator.operator}`)
+      }
+    })
+    if (setMin && (!minver || gt(minver, setMin))) {
+      minver = setMin
+    }
+  }
+
+  if (minver && range.test(minver)) {
+    return minver
+  }
+
+  return null
+}
+module.exports = minVersion
diff --git a/node_modules/semver/ranges/outside.js b/node_modules/semver/ranges/outside.js
new file mode 100644
index 0000000..ca74421
--- /dev/null
+++ b/node_modules/semver/ranges/outside.js
@@ -0,0 +1,82 @@
+'use strict'
+
+const SemVer = require('../classes/semver')
+const Comparator = require('../classes/comparator')
+const { ANY } = Comparator
+const Range = require('../classes/range')
+const satisfies = require('../functions/satisfies')
+const gt = require('../functions/gt')
+const lt = require('../functions/lt')
+const lte = require('../functions/lte')
+const gte = require('../functions/gte')
+
+const outside = (version, range, hilo, options) => {
+  version = new SemVer(version, options)
+  range = new Range(range, options)
+
+  let gtfn, ltefn, ltfn, comp, ecomp
+  switch (hilo) {
+    case '>':
+      gtfn = gt
+      ltefn = lte
+      ltfn = lt
+      comp = '>'
+      ecomp = '>='
+      break
+    case '<':
+      gtfn = lt
+      ltefn = gte
+      ltfn = gt
+      comp = '<'
+      ecomp = '<='
+      break
+    default:
+      throw new TypeError('Must provide a hilo val of "<" or ">"')
+  }
+
+  // If it satisfies the range it is not outside
+  if (satisfies(version, range, options)) {
+    return false
+  }
+
+  // From now on, variable terms are as if we're in "gtr" mode.
+  // but note that everything is flipped for the "ltr" function.
+
+  for (let i = 0; i < range.set.length; ++i) {
+    const comparators = range.set[i]
+
+    let high = null
+    let low = null
+
+    comparators.forEach((comparator) => {
+      if (comparator.semver === ANY) {
+        comparator = new Comparator('>=0.0.0')
+      }
+      high = high || comparator
+      low = low || comparator
+      if (gtfn(comparator.semver, high.semver, options)) {
+        high = comparator
+      } else if (ltfn(comparator.semver, low.semver, options)) {
+        low = comparator
+      }
+    })
+
+    // If the edge version comparator has a operator then our version
+    // isn't outside it
+    if (high.operator === comp || high.operator === ecomp) {
+      return false
+    }
+
+    // If the lowest version comparator has an operator and our version
+    // is less than it then it isn't higher than the range
+    if ((!low.operator || low.operator === comp) &&
+        ltefn(version, low.semver)) {
+      return false
+    } else if (low.operator === ecomp && ltfn(version, low.semver)) {
+      return false
+    }
+  }
+  return true
+}
+
+module.exports = outside
diff --git a/node_modules/semver/ranges/simplify.js b/node_modules/semver/ranges/simplify.js
new file mode 100644
index 0000000..262732e
--- /dev/null
+++ b/node_modules/semver/ranges/simplify.js
@@ -0,0 +1,49 @@
+'use strict'
+
+// given a set of versions and a range, create a "simplified" range
+// that includes the same versions that the original range does
+// If the original range is shorter than the simplified one, return that.
+const satisfies = require('../functions/satisfies.js')
+const compare = require('../functions/compare.js')
+module.exports = (versions, range, options) => {
+  const set = []
+  let first = null
+  let prev = null
+  const v = versions.sort((a, b) => compare(a, b, options))
+  for (const version of v) {
+    const included = satisfies(version, range, options)
+    if (included) {
+      prev = version
+      if (!first) {
+        first = version
+      }
+    } else {
+      if (prev) {
+        set.push([first, prev])
+      }
+      prev = null
+      first = null
+    }
+  }
+  if (first) {
+    set.push([first, null])
+  }
+
+  const ranges = []
+  for (const [min, max] of set) {
+    if (min === max) {
+      ranges.push(min)
+    } else if (!max && min === v[0]) {
+      ranges.push('*')
+    } else if (!max) {
+      ranges.push(`>=${min}`)
+    } else if (min === v[0]) {
+      ranges.push(`<=${max}`)
+    } else {
+      ranges.push(`${min} - ${max}`)
+    }
+  }
+  const simplified = ranges.join(' || ')
+  const original = typeof range.raw === 'string' ? range.raw : String(range)
+  return simplified.length < original.length ? simplified : range
+}
diff --git a/node_modules/semver/ranges/subset.js b/node_modules/semver/ranges/subset.js
new file mode 100644
index 0000000..99f4321
--- /dev/null
+++ b/node_modules/semver/ranges/subset.js
@@ -0,0 +1,249 @@
+'use strict'
+
+const Range = require('../classes/range.js')
+const Comparator = require('../classes/comparator.js')
+const { ANY } = Comparator
+const satisfies = require('../functions/satisfies.js')
+const compare = require('../functions/compare.js')
+
+// Complex range `r1 || r2 || ...` is a subset of `R1 || R2 || ...` iff:
+// - Every simple range `r1, r2, ...` is a null set, OR
+// - Every simple range `r1, r2, ...` which is not a null set is a subset of
+//   some `R1, R2, ...`
+//
+// Simple range `c1 c2 ...` is a subset of simple range `C1 C2 ...` iff:
+// - If c is only the ANY comparator
+//   - If C is only the ANY comparator, return true
+//   - Else if in prerelease mode, return false
+//   - else replace c with `[>=0.0.0]`
+// - If C is only the ANY comparator
+//   - if in prerelease mode, return true
+//   - else replace C with `[>=0.0.0]`
+// - Let EQ be the set of = comparators in c
+// - If EQ is more than one, return true (null set)
+// - Let GT be the highest > or >= comparator in c
+// - Let LT be the lowest < or <= comparator in c
+// - If GT and LT, and GT.semver > LT.semver, return true (null set)
+// - If any C is a = range, and GT or LT are set, return false
+// - If EQ
+//   - If GT, and EQ does not satisfy GT, return true (null set)
+//   - If LT, and EQ does not satisfy LT, return true (null set)
+//   - If EQ satisfies every C, return true
+//   - Else return false
+// - If GT
+//   - If GT.semver is lower than any > or >= comp in C, return false
+//   - If GT is >=, and GT.semver does not satisfy every C, return false
+//   - If GT.semver has a prerelease, and not in prerelease mode
+//     - If no C has a prerelease and the GT.semver tuple, return false
+// - If LT
+//   - If LT.semver is greater than any < or <= comp in C, return false
+//   - If LT is <=, and LT.semver does not satisfy every C, return false
+//   - If LT.semver has a prerelease, and not in prerelease mode
+//     - If no C has a prerelease and the LT.semver tuple, return false
+// - Else return true
+
+const subset = (sub, dom, options = {}) => {
+  if (sub === dom) {
+    return true
+  }
+
+  sub = new Range(sub, options)
+  dom = new Range(dom, options)
+  let sawNonNull = false
+
+  OUTER: for (const simpleSub of sub.set) {
+    for (const simpleDom of dom.set) {
+      const isSub = simpleSubset(simpleSub, simpleDom, options)
+      sawNonNull = sawNonNull || isSub !== null
+      if (isSub) {
+        continue OUTER
+      }
+    }
+    // the null set is a subset of everything, but null simple ranges in
+    // a complex range should be ignored.  so if we saw a non-null range,
+    // then we know this isn't a subset, but if EVERY simple range was null,
+    // then it is a subset.
+    if (sawNonNull) {
+      return false
+    }
+  }
+  return true
+}
+
+const minimumVersionWithPreRelease = [new Comparator('>=0.0.0-0')]
+const minimumVersion = [new Comparator('>=0.0.0')]
+
+const simpleSubset = (sub, dom, options) => {
+  if (sub === dom) {
+    return true
+  }
+
+  if (sub.length === 1 && sub[0].semver === ANY) {
+    if (dom.length === 1 && dom[0].semver === ANY) {
+      return true
+    } else if (options.includePrerelease) {
+      sub = minimumVersionWithPreRelease
+    } else {
+      sub = minimumVersion
+    }
+  }
+
+  if (dom.length === 1 && dom[0].semver === ANY) {
+    if (options.includePrerelease) {
+      return true
+    } else {
+      dom = minimumVersion
+    }
+  }
+
+  const eqSet = new Set()
+  let gt, lt
+  for (const c of sub) {
+    if (c.operator === '>' || c.operator === '>=') {
+      gt = higherGT(gt, c, options)
+    } else if (c.operator === '<' || c.operator === '<=') {
+      lt = lowerLT(lt, c, options)
+    } else {
+      eqSet.add(c.semver)
+    }
+  }
+
+  if (eqSet.size > 1) {
+    return null
+  }
+
+  let gtltComp
+  if (gt && lt) {
+    gtltComp = compare(gt.semver, lt.semver, options)
+    if (gtltComp > 0) {
+      return null
+    } else if (gtltComp === 0 && (gt.operator !== '>=' || lt.operator !== '<=')) {
+      return null
+    }
+  }
+
+  // will iterate one or zero times
+  for (const eq of eqSet) {
+    if (gt && !satisfies(eq, String(gt), options)) {
+      return null
+    }
+
+    if (lt && !satisfies(eq, String(lt), options)) {
+      return null
+    }
+
+    for (const c of dom) {
+      if (!satisfies(eq, String(c), options)) {
+        return false
+      }
+    }
+
+    return true
+  }
+
+  let higher, lower
+  let hasDomLT, hasDomGT
+  // if the subset has a prerelease, we need a comparator in the superset
+  // with the same tuple and a prerelease, or it's not a subset
+  let needDomLTPre = lt &&
+    !options.includePrerelease &&
+    lt.semver.prerelease.length ? lt.semver : false
+  let needDomGTPre = gt &&
+    !options.includePrerelease &&
+    gt.semver.prerelease.length ? gt.semver : false
+  // exception: <1.2.3-0 is the same as <1.2.3
+  if (needDomLTPre && needDomLTPre.prerelease.length === 1 &&
+      lt.operator === '<' && needDomLTPre.prerelease[0] === 0) {
+    needDomLTPre = false
+  }
+
+  for (const c of dom) {
+    hasDomGT = hasDomGT || c.operator === '>' || c.operator === '>='
+    hasDomLT = hasDomLT || c.operator === '<' || c.operator === '<='
+    if (gt) {
+      if (needDomGTPre) {
+        if (c.semver.prerelease && c.semver.prerelease.length &&
+            c.semver.major === needDomGTPre.major &&
+            c.semver.minor === needDomGTPre.minor &&
+            c.semver.patch === needDomGTPre.patch) {
+          needDomGTPre = false
+        }
+      }
+      if (c.operator === '>' || c.operator === '>=') {
+        higher = higherGT(gt, c, options)
+        if (higher === c && higher !== gt) {
+          return false
+        }
+      } else if (gt.operator === '>=' && !satisfies(gt.semver, String(c), options)) {
+        return false
+      }
+    }
+    if (lt) {
+      if (needDomLTPre) {
+        if (c.semver.prerelease && c.semver.prerelease.length &&
+            c.semver.major === needDomLTPre.major &&
+            c.semver.minor === needDomLTPre.minor &&
+            c.semver.patch === needDomLTPre.patch) {
+          needDomLTPre = false
+        }
+      }
+      if (c.operator === '<' || c.operator === '<=') {
+        lower = lowerLT(lt, c, options)
+        if (lower === c && lower !== lt) {
+          return false
+        }
+      } else if (lt.operator === '<=' && !satisfies(lt.semver, String(c), options)) {
+        return false
+      }
+    }
+    if (!c.operator && (lt || gt) && gtltComp !== 0) {
+      return false
+    }
+  }
+
+  // if there was a < or >, and nothing in the dom, then must be false
+  // UNLESS it was limited by another range in the other direction.
+  // Eg, >1.0.0 <1.0.1 is still a subset of <2.0.0
+  if (gt && hasDomLT && !lt && gtltComp !== 0) {
+    return false
+  }
+
+  if (lt && hasDomGT && !gt && gtltComp !== 0) {
+    return false
+  }
+
+  // we needed a prerelease range in a specific tuple, but didn't get one
+  // then this isn't a subset.  eg >=1.2.3-pre is not a subset of >=1.0.0,
+  // because it includes prereleases in the 1.2.3 tuple
+  if (needDomGTPre || needDomLTPre) {
+    return false
+  }
+
+  return true
+}
+
+// >=1.2.3 is lower than >1.2.3
+const higherGT = (a, b, options) => {
+  if (!a) {
+    return b
+  }
+  const comp = compare(a.semver, b.semver, options)
+  return comp > 0 ? a
+    : comp < 0 ? b
+    : b.operator === '>' && a.operator === '>=' ? b
+    : a
+}
+
+// <=1.2.3 is higher than <1.2.3
+const lowerLT = (a, b, options) => {
+  if (!a) {
+    return b
+  }
+  const comp = compare(a.semver, b.semver, options)
+  return comp < 0 ? a
+    : comp > 0 ? b
+    : b.operator === '<' && a.operator === '<=' ? b
+    : a
+}
+
+module.exports = subset
diff --git a/node_modules/semver/ranges/to-comparators.js b/node_modules/semver/ranges/to-comparators.js
new file mode 100644
index 0000000..5be2519
--- /dev/null
+++ b/node_modules/semver/ranges/to-comparators.js
@@ -0,0 +1,10 @@
+'use strict'
+
+const Range = require('../classes/range')
+
+// Mostly just for testing and legacy API reasons
+const toComparators = (range, options) =>
+  new Range(range, options).set
+    .map(comp => comp.map(c => c.value).join(' ').trim().split(' '))
+
+module.exports = toComparators
diff --git a/node_modules/semver/ranges/valid.js b/node_modules/semver/ranges/valid.js
new file mode 100644
index 0000000..cc6b0e9
--- /dev/null
+++ b/node_modules/semver/ranges/valid.js
@@ -0,0 +1,13 @@
+'use strict'
+
+const Range = require('../classes/range')
+const validRange = (range, options) => {
+  try {
+    // Return '*' instead of '' so that truthiness works.
+    // This will throw if it's invalid anyway
+    return new Range(range, options).range || '*'
+  } catch (er) {
+    return null
+  }
+}
+module.exports = validRange
diff --git a/node_modules/standard-as-callback/LICENSE b/node_modules/standard-as-callback/LICENSE
new file mode 100644
index 0000000..d1c994e
--- /dev/null
+++ b/node_modules/standard-as-callback/LICENSE
@@ -0,0 +1,22 @@
+MIT License
+
+Copyright (c) 2018 Zihua Li
+Copyright (c) 2013-2017 Petka Antonov
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/standard-as-callback/README.md b/node_modules/standard-as-callback/README.md
new file mode 100644
index 0000000..4b52cd0
--- /dev/null
+++ b/node_modules/standard-as-callback/README.md
@@ -0,0 +1,33 @@
+# Standard asCallback
+A performant and standard (Bluebird) library that registers a node-style callback on a promise.
+
+[![Build Status](https://travis-ci.org/luin/asCallback.svg?branch=master)](https://travis-ci.org/luin/asCallback)
+
+## Install
+
+```
+$ npm install standard-as-callback
+```
+
+## Usage
+
+```javascript
+const asCallback = require('standard-as-callback')
+
+const promise = new Promise(function (resolve) {
+  setTimeout(function () {
+    resolve('hello world!')
+  }, 1000)
+})
+
+asCallback(promise, function callback (err, res) {
+  console.log(err, res) // null, 'hello world!'
+})
+```
+
+## Thanks
+
+Most code of this library are ported from the awesome Bluebird library.
+
+## License
+The MIT License.
diff --git a/node_modules/standard-as-callback/built/index.d.ts b/node_modules/standard-as-callback/built/index.d.ts
new file mode 100644
index 0000000..0d7e11f
--- /dev/null
+++ b/node_modules/standard-as-callback/built/index.d.ts
@@ -0,0 +1,5 @@
+import { CallbackFunction } from "./types";
+export interface IOptions {
+    spread: boolean;
+}
+export default function asCallback<T>(promise: Promise<T>, nodeback: CallbackFunction<T>, options?: IOptions): Promise<T>;
diff --git a/node_modules/standard-as-callback/built/index.js b/node_modules/standard-as-callback/built/index.js
new file mode 100644
index 0000000..7f4db27
--- /dev/null
+++ b/node_modules/standard-as-callback/built/index.js
@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const utils_1 = require("./utils");
+function throwLater(e) {
+    setTimeout(function () {
+        throw e;
+    }, 0);
+}
+function asCallback(promise, nodeback, options) {
+    if (typeof nodeback === "function") {
+        promise.then((val) => {
+            let ret;
+            if (options !== undefined &&
+                Object(options).spread &&
+                Array.isArray(val)) {
+                ret = utils_1.tryCatch(nodeback).apply(undefined, [null].concat(val));
+            }
+            else {
+                ret =
+                    val === undefined
+                        ? utils_1.tryCatch(nodeback)(null)
+                        : utils_1.tryCatch(nodeback)(null, val);
+            }
+            if (ret === utils_1.errorObj) {
+                throwLater(ret.e);
+            }
+        }, (cause) => {
+            if (!cause) {
+                const newReason = new Error(cause + "");
+                Object.assign(newReason, { cause });
+                cause = newReason;
+            }
+            const ret = utils_1.tryCatch(nodeback)(cause);
+            if (ret === utils_1.errorObj) {
+                throwLater(ret.e);
+            }
+        });
+    }
+    return promise;
+}
+exports.default = asCallback;
diff --git a/node_modules/standard-as-callback/built/types.d.ts b/node_modules/standard-as-callback/built/types.d.ts
new file mode 100644
index 0000000..94eaede
--- /dev/null
+++ b/node_modules/standard-as-callback/built/types.d.ts
@@ -0,0 +1 @@
+export declare type CallbackFunction<T> = ((err: null, val: T) => void) | ((err: Error) => void);
diff --git a/node_modules/standard-as-callback/built/types.js b/node_modules/standard-as-callback/built/types.js
new file mode 100644
index 0000000..c8ad2e5
--- /dev/null
+++ b/node_modules/standard-as-callback/built/types.js
@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
diff --git a/node_modules/standard-as-callback/built/utils.d.ts b/node_modules/standard-as-callback/built/utils.d.ts
new file mode 100644
index 0000000..b3fac29
--- /dev/null
+++ b/node_modules/standard-as-callback/built/utils.d.ts
@@ -0,0 +1,9 @@
+import { CallbackFunction } from "./types";
+export declare const errorObj: {
+    e: {};
+};
+declare function tryCatcher<T>(err: Error, val?: T): void | {
+    e: Error;
+};
+export declare function tryCatch<T>(fn: CallbackFunction<T>): typeof tryCatcher;
+export {};
diff --git a/node_modules/standard-as-callback/built/utils.js b/node_modules/standard-as-callback/built/utils.js
new file mode 100644
index 0000000..328c31e
--- /dev/null
+++ b/node_modules/standard-as-callback/built/utils.js
@@ -0,0 +1,23 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tryCatch = exports.errorObj = void 0;
+//Try catch is not supported in optimizing
+//compiler, so it is isolated
+exports.errorObj = { e: {} };
+let tryCatchTarget;
+function tryCatcher(err, val) {
+    try {
+        const target = tryCatchTarget;
+        tryCatchTarget = null;
+        return target.apply(this, arguments);
+    }
+    catch (e) {
+        exports.errorObj.e = e;
+        return exports.errorObj;
+    }
+}
+function tryCatch(fn) {
+    tryCatchTarget = fn;
+    return tryCatcher;
+}
+exports.tryCatch = tryCatch;
diff --git a/node_modules/standard-as-callback/package.json b/node_modules/standard-as-callback/package.json
new file mode 100644
index 0000000..7a71978
--- /dev/null
+++ b/node_modules/standard-as-callback/package.json
@@ -0,0 +1,40 @@
+{
+  "name": "standard-as-callback",
+  "version": "2.1.0",
+  "description": "A performant and standard (Bluebird) library that registers a node-style callback on a promise",
+  "main": "built/index.js",
+  "types": "built/index.d.ts",
+  "directories": {
+    "lib": "built"
+  },
+  "files": [
+    "built/"
+  ],
+  "scripts": {
+    "build": "rm -rf built && tsc",
+    "test": "npm run build && mocha",
+    "prepublishOnly": "npm test"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/luin/asCallback.git"
+  },
+  "keywords": [
+    "ascallback",
+    "nodeify",
+    "promise",
+    "bluebird"
+  ],
+  "author": "luin <i@zihua.li>",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/luin/asCallback/issues"
+  },
+  "homepage": "https://github.com/luin/asCallback#readme",
+  "devDependencies": {
+    "mocha": "^8.3.2",
+    "promise-timeout": "^1.3.0",
+    "sinon": "^9.2.4",
+    "typescript": "^4.2.3"
+  }
+}
diff --git a/node_modules/tiny-emitter/LICENSE b/node_modules/tiny-emitter/LICENSE
new file mode 100644
index 0000000..24f1024
--- /dev/null
+++ b/node_modules/tiny-emitter/LICENSE
@@ -0,0 +1,22 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Scott Corgan
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
diff --git a/node_modules/tiny-emitter/README.md b/node_modules/tiny-emitter/README.md
new file mode 100644
index 0000000..cd474cd
--- /dev/null
+++ b/node_modules/tiny-emitter/README.md
@@ -0,0 +1,88 @@
+# tiny-emitter
+
+A tiny (less than 1k) event emitter library.
+
+## Install
+
+### npm
+
+```
+npm install tiny-emitter --save
+```
+
+## Usage
+
+```js
+var Emitter = require('tiny-emitter');
+var emitter = new Emitter();
+
+emitter.on('some-event', function (arg1, arg2, arg3) {
+ //
+});
+
+emitter.emit('some-event', 'arg1 value', 'arg2 value', 'arg3 value');
+```
+
+Alternatively, you can skip the initialization step by requiring `tiny-emitter/instance` instead. This pulls in an already initialized emitter.
+
+```js
+var emitter = require('tiny-emitter/instance');
+
+emitter.on('some-event', function (arg1, arg2, arg3) {
+ //
+});
+
+emitter.emit('some-event', 'arg1 value', 'arg2 value', 'arg3 value');
+```
+
+## Instance Methods
+
+### on(event, callback[, context])
+
+Subscribe to an event
+
+* `event` - the name of the event to subscribe to
+* `callback` - the function to call when event is emitted
+* `context` - (OPTIONAL) - the context to bind the event callback to
+
+### once(event, callback[, context])
+
+Subscribe to an event only **once**
+
+* `event` - the name of the event to subscribe to
+* `callback` - the function to call when event is emitted
+* `context` - (OPTIONAL) - the context to bind the event callback to
+
+### off(event[, callback])
+
+Unsubscribe from an event or all events. If no callback is provided, it unsubscribes you from all events.
+
+* `event` - the name of the event to unsubscribe from
+* `callback` - the function used when binding to the event
+
+### emit(event[, arguments...])
+
+Trigger a named event
+
+* `event` - the event name to emit
+* `arguments...` - any number of arguments to pass to the event subscribers
+
+## Test and Build
+
+Build (Tests, Browserifies, and minifies)
+
+```
+npm install
+npm run build
+```
+
+Test
+
+```
+npm install
+npm test
+```
+
+## License
+
+[MIT](https://github.com/scottcorgan/tiny-emitter/blob/master/LICENSE)
diff --git a/node_modules/tiny-emitter/dist/tinyemitter.js b/node_modules/tiny-emitter/dist/tinyemitter.js
new file mode 100644
index 0000000..6e25e05
--- /dev/null
+++ b/node_modules/tiny-emitter/dist/tinyemitter.js
@@ -0,0 +1,71 @@
+(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.TinyEmitter = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
+function E () {
+  // Keep this empty so it's easier to inherit from
+  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)
+}
+
+E.prototype = {
+  on: function (name, callback, ctx) {
+    var e = this.e || (this.e = {});
+
+    (e[name] || (e[name] = [])).push({
+      fn: callback,
+      ctx: ctx
+    });
+
+    return this;
+  },
+
+  once: function (name, callback, ctx) {
+    var self = this;
+    function listener () {
+      self.off(name, listener);
+      callback.apply(ctx, arguments);
+    };
+
+    listener._ = callback
+    return this.on(name, listener, ctx);
+  },
+
+  emit: function (name) {
+    var data = [].slice.call(arguments, 1);
+    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();
+    var i = 0;
+    var len = evtArr.length;
+
+    for (i; i < len; i++) {
+      evtArr[i].fn.apply(evtArr[i].ctx, data);
+    }
+
+    return this;
+  },
+
+  off: function (name, callback) {
+    var e = this.e || (this.e = {});
+    var evts = e[name];
+    var liveEvents = [];
+
+    if (evts && callback) {
+      for (var i = 0, len = evts.length; i < len; i++) {
+        if (evts[i].fn !== callback && evts[i].fn._ !== callback)
+          liveEvents.push(evts[i]);
+      }
+    }
+
+    // Remove event from queue to prevent memory leak
+    // Suggested by https://github.com/lazd
+    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910
+
+    (liveEvents.length)
+      ? e[name] = liveEvents
+      : delete e[name];
+
+    return this;
+  }
+};
+
+module.exports = E;
+module.exports.TinyEmitter = E;
+
+},{}]},{},[1])(1)
+});
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/dist/tinyemitter.min.js b/node_modules/tiny-emitter/dist/tinyemitter.min.js
new file mode 100644
index 0000000..6340f09
--- /dev/null
+++ b/node_modules/tiny-emitter/dist/tinyemitter.min.js
@@ -0,0 +1 @@
+(function(e){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=e()}else if(typeof define==="function"&&define.amd){define([],e)}else{var n;if(typeof window!=="undefined"){n=window}else if(typeof global!=="undefined"){n=global}else if(typeof self!=="undefined"){n=self}else{n=this}n.TinyEmitter=e()}})(function(){var e,n,t;return function r(e,n,t){function i(o,u){if(!n[o]){if(!e[o]){var s=typeof require=="function"&&require;if(!u&&s)return s(o,!0);if(f)return f(o,!0);var a=new Error("Cannot find module '"+o+"'");throw a.code="MODULE_NOT_FOUND",a}var l=n[o]={exports:{}};e[o][0].call(l.exports,function(n){var t=e[o][1][n];return i(t?t:n)},l,l.exports,r,e,n,t)}return n[o].exports}var f=typeof require=="function"&&require;for(var o=0;o<t.length;o++)i(t[o]);return i}({1:[function(e,n,t){function r(){}r.prototype={on:function(e,n,t){var r=this.e||(this.e={});(r[e]||(r[e]=[])).push({fn:n,ctx:t});return this},once:function(e,n,t){var r=this;function i(){r.off(e,i);n.apply(t,arguments)}i._=n;return this.on(e,i,t)},emit:function(e){var n=[].slice.call(arguments,1);var t=((this.e||(this.e={}))[e]||[]).slice();var r=0;var i=t.length;for(r;r<i;r++){t[r].fn.apply(t[r].ctx,n)}return this},off:function(e,n){var t=this.e||(this.e={});var r=t[e];var i=[];if(r&&n){for(var f=0,o=r.length;f<o;f++){if(r[f].fn!==n&&r[f].fn._!==n)i.push(r[f])}}i.length?t[e]=i:delete t[e];return this}};n.exports=r;n.exports.TinyEmitter=r},{}]},{},[1])(1)});
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/index.d.ts b/node_modules/tiny-emitter/index.d.ts
new file mode 100644
index 0000000..6640610
--- /dev/null
+++ b/node_modules/tiny-emitter/index.d.ts
@@ -0,0 +1,6 @@
+export declare class TinyEmitter {
+  on(event: string, callback: Function, ctx?: any): this;
+  once(event: string, callback: Function, ctx?: any): this;
+  emit(event: string, ...args: any[]): this;
+  off(event: string, callback?: Function): this;
+}
\ No newline at end of file
diff --git a/node_modules/tiny-emitter/index.js b/node_modules/tiny-emitter/index.js
new file mode 100644
index 0000000..7ca4a60
--- /dev/null
+++ b/node_modules/tiny-emitter/index.js
@@ -0,0 +1,67 @@
+function E () {
+  // Keep this empty so it's easier to inherit from
+  // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)
+}
+
+E.prototype = {
+  on: function (name, callback, ctx) {
+    var e = this.e || (this.e = {});
+
+    (e[name] || (e[name] = [])).push({
+      fn: callback,
+      ctx: ctx
+    });
+
+    return this;
+  },
+
+  once: function (name, callback, ctx) {
+    var self = this;
+    function listener () {
+      self.off(name, listener);
+      callback.apply(ctx, arguments);
+    };
+
+    listener._ = callback
+    return this.on(name, listener, ctx);
+  },
+
+  emit: function (name) {
+    var data = [].slice.call(arguments, 1);
+    var evtArr = ((this.e || (this.e = {}))[name] || []).slice();
+    var i = 0;
+    var len = evtArr.length;
+
+    for (i; i < len; i++) {
+      evtArr[i].fn.apply(evtArr[i].ctx, data);
+    }
+
+    return this;
+  },
+
+  off: function (name, callback) {
+    var e = this.e || (this.e = {});
+    var evts = e[name];
+    var liveEvents = [];
+
+    if (evts && callback) {
+      for (var i = 0, len = evts.length; i < len; i++) {
+        if (evts[i].fn !== callback && evts[i].fn._ !== callback)
+          liveEvents.push(evts[i]);
+      }
+    }
+
+    // Remove event from queue to prevent memory leak
+    // Suggested by https://github.com/lazd
+    // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910
+
+    (liveEvents.length)
+      ? e[name] = liveEvents
+      : delete e[name];
+
+    return this;
+  }
+};
+
+module.exports = E;
+module.exports.TinyEmitter = E;
diff --git a/node_modules/tiny-emitter/instance.js b/node_modules/tiny-emitter/instance.js
new file mode 100644
index 0000000..6dcdba2
--- /dev/null
+++ b/node_modules/tiny-emitter/instance.js
@@ -0,0 +1,2 @@
+var E = require('./index.js');
+module.exports = new E();
diff --git a/node_modules/tiny-emitter/package.json b/node_modules/tiny-emitter/package.json
new file mode 100644
index 0000000..5da6335
--- /dev/null
+++ b/node_modules/tiny-emitter/package.json
@@ -0,0 +1,53 @@
+{
+  "name": "tiny-emitter",
+  "version": "2.1.0",
+  "description": "A tiny (less than 1k) event emitter library",
+  "main": "index.js",
+  "scripts": {
+    "test-node": "tape test/index.js | tap-format-spec",
+    "test": "testling | tap-format-spec",
+    "bundle": "node_modules/.bin/browserify index.js > dist/tinyemitter.js -s TinyEmitter && echo 'Bundled'",
+    "minify": "node_modules/.bin/uglifyjs dist/tinyemitter.js -o dist/tinyemitter.min.js -m && echo 'Minified'",
+    "build": "npm test && npm run bundle && npm run minify",
+    "size": "node_modules/.bin/uglifyjs index.js -o minified.js -m && ls -l && rm minified.js"
+  },
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/scottcorgan/tiny-emitter.git"
+  },
+  "keywords": [
+    "event",
+    "emitter",
+    "pubsub",
+    "tiny",
+    "events",
+    "bind"
+  ],
+  "author": "Scott Corgan",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/scottcorgan/tiny-emitter/issues"
+  },
+  "devDependencies": {
+    "@tap-format/spec": "0.2.0",
+    "browserify": "11.2.0",
+    "tape": "4.2.1",
+    "testling": "1.7.1",
+    "uglify-js": "2.5.0"
+  },
+  "testling": {
+    "files": [
+      "test/index.js"
+    ],
+    "browsers": [
+      "iexplore/10.0",
+      "iexplore/9.0",
+      "firefox/16..latest",
+      "chrome/22..latest",
+      "safari/5.1..latest",
+      "ipad/6.0..latest",
+      "iphone/6.0..latest",
+      "android-browser/4.2..latest"
+    ]
+  }
+}
diff --git a/node_modules/tiny-emitter/test/index.js b/node_modules/tiny-emitter/test/index.js
new file mode 100644
index 0000000..7f95f62
--- /dev/null
+++ b/node_modules/tiny-emitter/test/index.js
@@ -0,0 +1,217 @@
+var Emitter = require('../index');
+var emitter = require('../instance');
+var test = require('tape');
+
+test('subscribes to an event', function (t) {
+  var emitter = new Emitter();
+  emitter.on('test', function () {});
+
+  t.equal(emitter.e.test.length, 1, 'subscribed to event');
+  t.end();
+});
+
+test('subscribes to an event with context', function (t) {
+  var emitter = new Emitter();
+  var context = {
+    contextValue: true
+  };
+
+  emitter.on('test', function () {
+    t.ok(this.contextValue, 'is in context');
+    t.end();
+  }, context);
+
+  emitter.emit('test');
+});
+
+test('subscibes only once to an event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.once('test', function () {
+    t.notOk(emitter.e.test, 'removed event from list');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('keeps context when subscribed only once', function (t) {
+  var emitter = new Emitter();
+  var context = {
+    contextValue: true
+  };
+
+  emitter.once('test', function () {
+    t.ok(this.contextValue, 'is in context');
+    t.notOk(emitter.e.test, 'not subscribed anymore');
+    t.end();
+  }, context);
+
+  emitter.emit('test');
+});
+
+test('emits an event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function () {
+    t.ok(true, 'triggered event');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('passes all arguments to event listener', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function (arg1, arg2) {
+    t.equal(arg1, 'arg1', 'passed the first argument');
+    t.equal(arg2, 'arg2', 'passed the second argument');
+    t.end();
+  });
+
+  emitter.emit('test', 'arg1', 'arg2');
+});
+
+test('unsubscribes from all events with name', function (t) {
+  var emitter = new Emitter();
+  emitter.on('test', function () {
+    t.fail('should not get called');
+  });
+  emitter.off('test');
+  emitter.emit('test')
+
+  process.nextTick(function () {
+    t.end();
+  });
+});
+
+test('unsubscribes single event with name and callback', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('should not get called');
+  }
+
+  emitter.on('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test')
+
+  process.nextTick(function () {
+    t.end();
+  });
+});
+
+// Test added by https://github.com/lazd
+// From PR: https://github.com/scottcorgan/tiny-emitter/pull/6
+test('unsubscribes single event with name and callback when subscribed twice', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('should not get called');
+  };
+
+  emitter.on('test', fn);
+  emitter.on('test', fn);
+
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  process.nextTick(function () {
+    t.notOk(emitter.e['test'], 'removes all events');
+    t.end();
+  });
+});
+
+test('unsubscribes single event with name and callback when subscribed twice out of order', function (t) {
+  var emitter = new Emitter();
+  var calls = 0;
+  var fn = function () {
+    t.fail('should not get called');
+  };
+  var fn2 = function () {
+    calls++;
+  };
+
+  emitter.on('test', fn);
+  emitter.on('test', fn2);
+  emitter.on('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  process.nextTick(function () {
+    t.equal(calls, 1, 'callback was called');
+    t.end();
+  });
+});
+
+test('removes an event inside another event', function (t) {
+  var emitter = new Emitter();
+
+  emitter.on('test', function () {
+    t.equal(emitter.e.test.length, 1, 'event is still in list');
+
+    emitter.off('test');
+
+    t.notOk(emitter.e.test, 0, 'event is gone from list');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('event is emitted even if unsubscribed in the event callback', function (t) {
+  var emitter = new Emitter();
+  var calls = 0;
+  var fn = function () {
+    calls += 1;
+    emitter.off('test', fn);
+  };
+
+  emitter.on('test', fn);
+
+  emitter.on('test', function () {
+    calls += 1;
+  });
+
+  emitter.on('test', function () {
+    calls += 1;
+  });
+
+  process.nextTick(function () {
+    t.equal(calls, 3, 'all callbacks were called');
+    t.end();
+  });
+
+  emitter.emit('test');
+});
+
+test('calling off before any events added does nothing', function (t) {
+  var emitter = new Emitter();
+  emitter.off('test', function () {});
+  t.end();
+});
+
+test('emitting event that has not been subscribed to yet', function (t) {
+  var emitter = new Emitter();
+
+  emitter.emit('some-event', 'some message');
+  t.end();
+});
+
+test('unsubscribes single event with name and callback which was subscribed once', function (t) {
+  var emitter = new Emitter();
+  var fn = function () {
+    t.fail('event not unsubscribed');
+  }
+
+  emitter.once('test', fn);
+  emitter.off('test', fn);
+  emitter.emit('test');
+
+  t.end();
+});
+
+test('exports an instance', function (t) {
+  t.ok(emitter, 'exports an instance')
+  t.ok(emitter instanceof Emitter, 'an instance of the Emitter class');
+  t.end();
+});
diff --git a/node_modules/tiny-emitter/yarn.lock b/node_modules/tiny-emitter/yarn.lock
new file mode 100644
index 0000000..730a024
--- /dev/null
+++ b/node_modules/tiny-emitter/yarn.lock
@@ -0,0 +1,1857 @@
+# THIS IS AN AUTOGENERATED FILE. DO NOT EDIT THIS FILE DIRECTLY.
+# yarn lockfile v1
+
+
+"@tap-format/exit@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/exit/-/exit-0.2.0.tgz#b58736bc55d30802c012c5adfca51b47040310cd"
+  dependencies:
+    ramda "^0.18.0"
+    rx "^4.0.7"
+
+"@tap-format/failures@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/failures/-/failures-0.2.0.tgz#bb6f5edc3bc3c57c62885bc7c214cc7abdfc2a07"
+  dependencies:
+    chalk "^1.1.1"
+    diff "^2.2.1"
+    figures "^1.4.0"
+    ramda "^0.18.0"
+    rx "^4.0.7"
+
+"@tap-format/parser@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/parser/-/parser-0.2.0.tgz#bdc1d95e694781157593283bb3c3fec132a3115d"
+  dependencies:
+    duplexer "^0.1.1"
+    js-yaml "^3.4.6"
+    ramda "^0.18.0"
+    readable-stream "^2.0.4"
+    rx "^4.0.7"
+    rx-node "^1.0.1"
+    split "^1.0.0"
+
+"@tap-format/results@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/results/-/results-0.2.0.tgz#192d64ac41f146fa2722db1c0a22ed80478f54fd"
+  dependencies:
+    chalk "^1.1.1"
+    hirestime "^1.0.6"
+    pretty-ms "^2.1.0"
+    rx "^4.0.7"
+
+"@tap-format/spec@0.2.0":
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/@tap-format/spec/-/spec-0.2.0.tgz#93f7d2f0dcefe526b4776800b9bd7f80db5aaec7"
+  dependencies:
+    "@tap-format/exit" "0.2.0"
+    "@tap-format/failures" "0.2.0"
+    "@tap-format/parser" "0.2.0"
+    "@tap-format/results" "0.2.0"
+    chalk "^1.1.1"
+    figures "^1.4.0"
+    rx "^4.0.7"
+
+Base64@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/Base64/-/Base64-0.2.1.tgz#ba3a4230708e186705065e66babdd4c35cf60028"
+
+JSONStream@^1.0.3:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-1.3.2.tgz#c102371b6ec3a7cf3b847ca00c20bb0fce4c6dea"
+  dependencies:
+    jsonparse "^1.2.0"
+    through ">=2.2.7 <3"
+
+JSONStream@~0.6.4:
+  version "0.6.4"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-0.6.4.tgz#4b2c8063f8f512787b2375f7ee9db69208fa2dcb"
+  dependencies:
+    jsonparse "0.0.5"
+    through "~2.2.7"
+
+JSONStream@~0.7.1:
+  version "0.7.4"
+  resolved "https://registry.yarnpkg.com/JSONStream/-/JSONStream-0.7.4.tgz#734290e41511eea7c2cfe151fbf9a563a97b9786"
+  dependencies:
+    jsonparse "0.0.5"
+    through ">=2.2.7 <3"
+
+acorn-node@^1.2.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/acorn-node/-/acorn-node-1.3.0.tgz#5f86d73346743810ef1269b901dbcbded020861b"
+  dependencies:
+    acorn "^5.4.1"
+    xtend "^4.0.1"
+
+acorn@^2.7.0:
+  version "2.7.0"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-2.7.0.tgz#ab6e7d9d886aaca8b085bc3312b79a198433f0e7"
+
+acorn@^4.0.3:
+  version "4.0.13"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-4.0.13.tgz#105495ae5361d697bd195c825192e1ad7f253787"
+
+acorn@^5.2.1, acorn@^5.4.1:
+  version "5.4.1"
+  resolved "https://registry.yarnpkg.com/acorn/-/acorn-5.4.1.tgz#fdc58d9d17f4a4e98d102ded826a9b9759125102"
+
+amdefine@>=0.0.4:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/amdefine/-/amdefine-1.0.1.tgz#4a5282ac164729e93619bcfd3ad151f817ce91f5"
+
+ansi-regex@^2.0.0:
+  version "2.1.1"
+  resolved "https://registry.yarnpkg.com/ansi-regex/-/ansi-regex-2.1.1.tgz#c3b33ab5ee360d86e0e628f0468ae7ef27d654df"
+
+ansi-styles@^2.2.1:
+  version "2.2.1"
+  resolved "https://registry.yarnpkg.com/ansi-styles/-/ansi-styles-2.2.1.tgz#b432dd3358b634cf75e1e4664368240533c1ddbe"
+
+argparse@^1.0.7:
+  version "1.0.10"
+  resolved "https://registry.yarnpkg.com/argparse/-/argparse-1.0.10.tgz#bcd6791ea5ae09725e17e5ad988134cd40b3d911"
+  dependencies:
+    sprintf-js "~1.0.2"
+
+asn1.js@^4.0.0:
+  version "4.10.1"
+  resolved "https://registry.yarnpkg.com/asn1.js/-/asn1.js-4.10.1.tgz#b9c2bf5805f1e64aadeed6df3a2bfafb5a73f5a0"
+  dependencies:
+    bn.js "^4.0.0"
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+
+assert@~1.1.0:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/assert/-/assert-1.1.2.tgz#adaa04c46bb58c6dd1f294da3eb26e6228eb6e44"
+  dependencies:
+    util "0.10.3"
+
+assert@~1.3.0:
+  version "1.3.0"
+  resolved "https://registry.yarnpkg.com/assert/-/assert-1.3.0.tgz#03939a622582a812cc202320a0b9a56c9b815849"
+  dependencies:
+    util "0.10.3"
+
+astw@^2.0.0:
+  version "2.2.0"
+  resolved "https://registry.yarnpkg.com/astw/-/astw-2.2.0.tgz#7bd41784d32493987aeb239b6b4e1c57a873b917"
+  dependencies:
+    acorn "^4.0.3"
+
+async@~0.2.6:
+  version "0.2.10"
+  resolved "https://registry.yarnpkg.com/async/-/async-0.2.10.tgz#b6bbe0b0674b9d719708ca38de8c237cb526c3d1"
+
+balanced-match@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/balanced-match/-/balanced-match-1.0.0.tgz#89b4d199ab2bee49de164ea02b89ce462d71b767"
+
+base64-js@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/base64-js/-/base64-js-0.0.2.tgz#024f0f72afa25b75f9c0ee73cd4f55ec1bed9784"
+
+base64-js@0.0.8, base64-js@~0.0.4:
+  version "0.0.8"
+  resolved "https://registry.yarnpkg.com/base64-js/-/base64-js-0.0.8.tgz#1101e9544f4a76b1bc3b26d452ca96d7a35e7978"
+
+bn.js@^4.0.0, bn.js@^4.1.0, bn.js@^4.1.1, bn.js@^4.4.0:
+  version "4.11.8"
+  resolved "https://registry.yarnpkg.com/bn.js/-/bn.js-4.11.8.tgz#2cde09eb5ee341f484746bb0309b3253b1b1442f"
+
+bops@0.0.6:
+  version "0.0.6"
+  resolved "https://registry.yarnpkg.com/bops/-/bops-0.0.6.tgz#082d1d55fa01e60dbdc2ebc2dba37f659554cf3a"
+  dependencies:
+    base64-js "0.0.2"
+    to-utf8 "0.0.1"
+
+bouncy@~3.2.0:
+  version "3.2.2"
+  resolved "https://registry.yarnpkg.com/bouncy/-/bouncy-3.2.2.tgz#82ab4ad7beae05890eed54b9af3c45394b185dc7"
+  dependencies:
+    optimist "~0.3.5"
+    through "~2.3.4"
+
+brace-expansion@^1.0.0, brace-expansion@^1.1.7:
+  version "1.1.11"
+  resolved "https://registry.yarnpkg.com/brace-expansion/-/brace-expansion-1.1.11.tgz#3c7fcbf529d87226f3d2f52b966ff5271eb441dd"
+  dependencies:
+    balanced-match "^1.0.0"
+    concat-map "0.0.1"
+
+brorand@^1.0.1:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/brorand/-/brorand-1.1.0.tgz#12c25efe40a45e3c323eb8675a0a0ce57b22371f"
+
+browser-launcher@~0.3.2:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/browser-launcher/-/browser-launcher-0.3.5.tgz#d9a3663fa064d8155044991c00e61dbcb6730a16"
+  dependencies:
+    headless "~0.1.3"
+    merge "~1.0.0"
+    minimist "0.0.5"
+    mkdirp "~0.3.3"
+    plist "0.2.1"
+    xtend "^4.0.0"
+
+browser-pack@^5.0.0:
+  version "5.0.1"
+  resolved "https://registry.yarnpkg.com/browser-pack/-/browser-pack-5.0.1.tgz#4197719b20c6e0aaa09451c5111e53efb6fbc18d"
+  dependencies:
+    JSONStream "^1.0.3"
+    combine-source-map "~0.6.1"
+    defined "^1.0.0"
+    through2 "^1.0.0"
+    umd "^3.0.0"
+
+browser-pack@~2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/browser-pack/-/browser-pack-2.0.1.tgz#5d1c527f56c582677411c4db2a128648ff6bf150"
+  dependencies:
+    JSONStream "~0.6.4"
+    combine-source-map "~0.3.0"
+    through "~2.3.4"
+
+browser-resolve@^1.7.0, browser-resolve@^1.7.1:
+  version "1.11.2"
+  resolved "https://registry.yarnpkg.com/browser-resolve/-/browser-resolve-1.11.2.tgz#8ff09b0a2c421718a1051c260b32e48f442938ce"
+  dependencies:
+    resolve "1.1.7"
+
+browser-resolve@~1.2.1, browser-resolve@~1.2.4:
+  version "1.2.4"
+  resolved "https://registry.yarnpkg.com/browser-resolve/-/browser-resolve-1.2.4.tgz#59ae7820a82955ecd32f5fb7c468ac21c4723806"
+  dependencies:
+    resolve "0.6.3"
+
+browserify-aes@^1.0.0, browserify-aes@^1.0.4:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/browserify-aes/-/browserify-aes-1.1.1.tgz#38b7ab55edb806ff2dcda1a7f1620773a477c49f"
+  dependencies:
+    buffer-xor "^1.0.3"
+    cipher-base "^1.0.0"
+    create-hash "^1.1.0"
+    evp_bytestokey "^1.0.3"
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+browserify-cipher@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/browserify-cipher/-/browserify-cipher-1.0.0.tgz#9988244874bf5ed4e28da95666dcd66ac8fc363a"
+  dependencies:
+    browserify-aes "^1.0.4"
+    browserify-des "^1.0.0"
+    evp_bytestokey "^1.0.0"
+
+browserify-des@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/browserify-des/-/browserify-des-1.0.0.tgz#daa277717470922ed2fe18594118a175439721dd"
+  dependencies:
+    cipher-base "^1.0.1"
+    des.js "^1.0.0"
+    inherits "^2.0.1"
+
+browserify-rsa@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/browserify-rsa/-/browserify-rsa-4.0.1.tgz#21e0abfaf6f2029cf2fafb133567a701d4135524"
+  dependencies:
+    bn.js "^4.1.0"
+    randombytes "^2.0.1"
+
+browserify-sign@^4.0.0:
+  version "4.0.4"
+  resolved "https://registry.yarnpkg.com/browserify-sign/-/browserify-sign-4.0.4.tgz#aa4eb68e5d7b658baa6bf6a57e630cbd7a93d298"
+  dependencies:
+    bn.js "^4.1.1"
+    browserify-rsa "^4.0.0"
+    create-hash "^1.1.0"
+    create-hmac "^1.1.2"
+    elliptic "^6.0.0"
+    inherits "^2.0.1"
+    parse-asn1 "^5.0.0"
+
+browserify-zlib@~0.1.2:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/browserify-zlib/-/browserify-zlib-0.1.4.tgz#bb35f8a519f600e0fa6b8485241c979d0141fb2d"
+  dependencies:
+    pako "~0.2.0"
+
+browserify@11.2.0:
+  version "11.2.0"
+  resolved "https://registry.yarnpkg.com/browserify/-/browserify-11.2.0.tgz#a11bb9dd209d79572b813f7eeeaf828a5f5c0e4e"
+  dependencies:
+    JSONStream "^1.0.3"
+    assert "~1.3.0"
+    browser-pack "^5.0.0"
+    browser-resolve "^1.7.1"
+    browserify-zlib "~0.1.2"
+    buffer "^3.0.0"
+    builtins "~0.0.3"
+    commondir "0.0.1"
+    concat-stream "~1.4.1"
+    console-browserify "^1.1.0"
+    constants-browserify "~0.0.1"
+    crypto-browserify "^3.0.0"
+    defined "^1.0.0"
+    deps-sort "^1.3.7"
+    domain-browser "~1.1.0"
+    duplexer2 "~0.0.2"
+    events "~1.0.0"
+    glob "^4.0.5"
+    has "^1.0.0"
+    htmlescape "^1.1.0"
+    https-browserify "~0.0.0"
+    inherits "~2.0.1"
+    insert-module-globals "^6.4.1"
+    isarray "0.0.1"
+    labeled-stream-splicer "^1.0.0"
+    module-deps "^3.7.11"
+    os-browserify "~0.1.1"
+    parents "^1.0.1"
+    path-browserify "~0.0.0"
+    process "~0.11.0"
+    punycode "^1.3.2"
+    querystring-es3 "~0.2.0"
+    read-only-stream "^1.1.1"
+    readable-stream "^2.0.2"
+    resolve "^1.1.4"
+    shasum "^1.0.0"
+    shell-quote "~0.0.1"
+    stream-browserify "^2.0.0"
+    stream-http "^1.2.0"
+    string_decoder "~0.10.0"
+    subarg "^1.0.0"
+    syntax-error "^1.1.1"
+    through2 "^1.0.0"
+    timers-browserify "^1.0.1"
+    tty-browserify "~0.0.0"
+    url "~0.10.1"
+    util "~0.10.1"
+    vm-browserify "~0.0.1"
+    xtend "^4.0.0"
+
+browserify@3.x.x:
+  version "3.46.1"
+  resolved "https://registry.yarnpkg.com/browserify/-/browserify-3.46.1.tgz#2c2e4a7f2f408178e78c223b5b57b37c2185ad8e"
+  dependencies:
+    JSONStream "~0.7.1"
+    assert "~1.1.0"
+    browser-pack "~2.0.0"
+    browser-resolve "~1.2.1"
+    browserify-zlib "~0.1.2"
+    buffer "~2.1.4"
+    builtins "~0.0.3"
+    commondir "0.0.1"
+    concat-stream "~1.4.1"
+    console-browserify "~1.0.1"
+    constants-browserify "~0.0.1"
+    crypto-browserify "~1.0.9"
+    deep-equal "~0.1.0"
+    defined "~0.0.0"
+    deps-sort "~0.1.1"
+    derequire "~0.8.0"
+    domain-browser "~1.1.0"
+    duplexer "~0.1.1"
+    events "~1.0.0"
+    glob "~3.2.8"
+    http-browserify "~1.3.1"
+    https-browserify "~0.0.0"
+    inherits "~2.0.1"
+    insert-module-globals "~6.0.0"
+    module-deps "~2.0.0"
+    os-browserify "~0.1.1"
+    parents "~0.0.1"
+    path-browserify "~0.0.0"
+    process "^0.7.0"
+    punycode "~1.2.3"
+    querystring-es3 "0.2.0"
+    resolve "~0.6.1"
+    shallow-copy "0.0.1"
+    shell-quote "~0.0.1"
+    stream-browserify "~0.1.0"
+    stream-combiner "~0.0.2"
+    string_decoder "~0.0.0"
+    subarg "0.0.1"
+    syntax-error "~1.1.0"
+    through2 "~0.4.1"
+    timers-browserify "~1.0.1"
+    tty-browserify "~0.0.0"
+    umd "~2.0.0"
+    url "~0.10.1"
+    util "~0.10.1"
+    vm-browserify "~0.0.1"
+    xtend "^3.0.0"
+
+buffer-xor@^1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/buffer-xor/-/buffer-xor-1.0.3.tgz#26e61ed1422fb70dd42e6e36729ed51d855fe8d9"
+
+buffer@^3.0.0:
+  version "3.6.0"
+  resolved "https://registry.yarnpkg.com/buffer/-/buffer-3.6.0.tgz#a72c936f77b96bf52f5f7e7b467180628551defb"
+  dependencies:
+    base64-js "0.0.8"
+    ieee754 "^1.1.4"
+    isarray "^1.0.0"
+
+buffer@~2.1.4:
+  version "2.1.13"
+  resolved "https://registry.yarnpkg.com/buffer/-/buffer-2.1.13.tgz#c88838ebf79f30b8b4a707788470bea8a62c2355"
+  dependencies:
+    base64-js "~0.0.4"
+    ieee754 "~1.1.1"
+
+builtin-status-codes@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/builtin-status-codes/-/builtin-status-codes-1.0.0.tgz#30637ee262978ac07174e16d7f82f0ad06e085ad"
+
+builtins@~0.0.3:
+  version "0.0.7"
+  resolved "https://registry.yarnpkg.com/builtins/-/builtins-0.0.7.tgz#355219cd6cf18dbe7c01cc7fd2dce765cfdc549a"
+
+callsite@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/callsite/-/callsite-1.0.0.tgz#280398e5d664bd74038b6f0905153e6e8af1bc20"
+
+camelcase@^1.0.2:
+  version "1.2.1"
+  resolved "https://registry.yarnpkg.com/camelcase/-/camelcase-1.2.1.tgz#9bb5304d2e0b56698b2c758b08a3eaa9daa58a39"
+
+chalk@^1.1.1:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/chalk/-/chalk-1.1.3.tgz#a8115c55e4a702fe4d150abd3872822a7e09fc98"
+  dependencies:
+    ansi-styles "^2.2.1"
+    escape-string-regexp "^1.0.2"
+    has-ansi "^2.0.0"
+    strip-ansi "^3.0.0"
+    supports-color "^2.0.0"
+
+cipher-base@^1.0.0, cipher-base@^1.0.1, cipher-base@^1.0.3:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/cipher-base/-/cipher-base-1.0.4.tgz#8760e4ecc272f4c363532f926d874aae2c1397de"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+combine-source-map@~0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/combine-source-map/-/combine-source-map-0.3.0.tgz#d9e74f593d9cd43807312cb5d846d451efaa9eb7"
+  dependencies:
+    convert-source-map "~0.3.0"
+    inline-source-map "~0.3.0"
+    source-map "~0.1.31"
+
+combine-source-map@~0.6.1:
+  version "0.6.1"
+  resolved "https://registry.yarnpkg.com/combine-source-map/-/combine-source-map-0.6.1.tgz#9b4a09c316033d768e0f11e029fa2730e079ad96"
+  dependencies:
+    convert-source-map "~1.1.0"
+    inline-source-map "~0.5.0"
+    lodash.memoize "~3.0.3"
+    source-map "~0.4.2"
+
+commondir@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/commondir/-/commondir-0.0.1.tgz#89f00fdcd51b519c578733fec563e6a6da7f5be2"
+
+concat-map@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/concat-map/-/concat-map-0.0.1.tgz#d8a96bd77fd68df7793a73036a3ba0d5405d477b"
+
+concat-stream@~0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-0.1.1.tgz#d7f4e278b90cfc4f0f3ef77fe4c03b40eb3f7900"
+
+concat-stream@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-1.0.1.tgz#018b18bc1c7d073a2dc82aa48442341a2c4dd79f"
+  dependencies:
+    bops "0.0.6"
+
+concat-stream@~1.4.1, concat-stream@~1.4.5:
+  version "1.4.10"
+  resolved "https://registry.yarnpkg.com/concat-stream/-/concat-stream-1.4.10.tgz#acc3bbf5602cb8cc980c6ac840fa7d8603e3ef36"
+  dependencies:
+    inherits "~2.0.1"
+    readable-stream "~1.1.9"
+    typedarray "~0.0.5"
+
+console-browserify@^1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/console-browserify/-/console-browserify-1.1.0.tgz#f0241c45730a9fc6323b206dbf38edc741d0bb10"
+  dependencies:
+    date-now "^0.1.4"
+
+console-browserify@~1.0.1:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/console-browserify/-/console-browserify-1.0.3.tgz#d3898d2c3a93102f364197f8874b4f92b5286a8e"
+
+constants-browserify@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/constants-browserify/-/constants-browserify-0.0.1.tgz#92577db527ba6c4cf0a4568d84bc031f441e21f2"
+
+convert-source-map@~0.3.0:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-0.3.5.tgz#f1d802950af7dd2631a1febe0596550c86ab3190"
+
+convert-source-map@~1.1.0:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/convert-source-map/-/convert-source-map-1.1.3.tgz#4829c877e9fe49b3161f3bf3673888e204699860"
+
+core-util-is@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/core-util-is/-/core-util-is-1.0.2.tgz#b5fd54220aa2bc5ab57aab7140c940754503c1a7"
+
+create-ecdh@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/create-ecdh/-/create-ecdh-4.0.0.tgz#888c723596cdf7612f6498233eebd7a35301737d"
+  dependencies:
+    bn.js "^4.1.0"
+    elliptic "^6.0.0"
+
+create-hash@^1.1.0, create-hash@^1.1.2:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/create-hash/-/create-hash-1.1.3.tgz#606042ac8b9262750f483caddab0f5819172d8fd"
+  dependencies:
+    cipher-base "^1.0.1"
+    inherits "^2.0.1"
+    ripemd160 "^2.0.0"
+    sha.js "^2.4.0"
+
+create-hmac@^1.1.0, create-hmac@^1.1.2, create-hmac@^1.1.4:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/create-hmac/-/create-hmac-1.1.6.tgz#acb9e221a4e17bdb076e90657c42b93e3726cf06"
+  dependencies:
+    cipher-base "^1.0.3"
+    create-hash "^1.1.0"
+    inherits "^2.0.1"
+    ripemd160 "^2.0.0"
+    safe-buffer "^5.0.1"
+    sha.js "^2.4.8"
+
+crypto-browserify@^3.0.0:
+  version "3.12.0"
+  resolved "https://registry.yarnpkg.com/crypto-browserify/-/crypto-browserify-3.12.0.tgz#396cf9f3137f03e4b8e532c58f698254e00f80ec"
+  dependencies:
+    browserify-cipher "^1.0.0"
+    browserify-sign "^4.0.0"
+    create-ecdh "^4.0.0"
+    create-hash "^1.1.0"
+    create-hmac "^1.1.0"
+    diffie-hellman "^5.0.0"
+    inherits "^2.0.1"
+    pbkdf2 "^3.0.3"
+    public-encrypt "^4.0.0"
+    randombytes "^2.0.0"
+    randomfill "^1.0.3"
+
+crypto-browserify@~1.0.9:
+  version "1.0.9"
+  resolved "https://registry.yarnpkg.com/crypto-browserify/-/crypto-browserify-1.0.9.tgz#cc5449685dfb85eb11c9828acc7cb87ab5bbfcc0"
+
+date-now@^0.1.4:
+  version "0.1.4"
+  resolved "https://registry.yarnpkg.com/date-now/-/date-now-0.1.4.tgz#eaf439fd4d4848ad74e5cc7dbef200672b9e345b"
+
+decamelize@^1.0.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/decamelize/-/decamelize-1.2.0.tgz#f6534d15148269b20352e7bee26f501f9a191290"
+
+deep-equal@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-0.0.0.tgz#99679d3bbd047156fcd450d3d01eeb9068691e83"
+
+deep-equal@~0.1.0:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-0.1.2.tgz#b246c2b80a570a47c11be1d9bd1070ec878b87ce"
+
+deep-equal@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/deep-equal/-/deep-equal-1.0.1.tgz#f5d260292b660e084eff4cdbc9f08ad3247448b5"
+
+define-properties@^1.1.2:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/define-properties/-/define-properties-1.1.2.tgz#83a73f2fea569898fb737193c8f873caf6d45c94"
+  dependencies:
+    foreach "^2.0.5"
+    object-keys "^1.0.8"
+
+defined@^1.0.0, defined@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/defined/-/defined-1.0.0.tgz#c98d9bcef75674188e110969151199e39b1fa693"
+
+defined@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/defined/-/defined-0.0.0.tgz#f35eea7d705e933baf13b2f03b3f83d921403b3e"
+
+deps-sort@^1.3.7:
+  version "1.3.9"
+  resolved "https://registry.yarnpkg.com/deps-sort/-/deps-sort-1.3.9.tgz#29dfff53e17b36aecae7530adbbbf622c2ed1a71"
+  dependencies:
+    JSONStream "^1.0.3"
+    shasum "^1.0.0"
+    subarg "^1.0.0"
+    through2 "^1.0.0"
+
+deps-sort@~0.1.1:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/deps-sort/-/deps-sort-0.1.2.tgz#daa2fb614a17c9637d801e2f55339ae370f3611a"
+  dependencies:
+    JSONStream "~0.6.4"
+    minimist "~0.0.1"
+    through "~2.3.4"
+
+derequire@~0.8.0:
+  version "0.8.0"
+  resolved "https://registry.yarnpkg.com/derequire/-/derequire-0.8.0.tgz#c1f7f1da2cede44adede047378f03f444e9c4c0d"
+  dependencies:
+    esprima-fb "^3001.1.0-dev-harmony-fb"
+    esrefactor "~0.1.0"
+    estraverse "~1.5.0"
+
+des.js@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/des.js/-/des.js-1.0.0.tgz#c074d2e2aa6a8a9a07dbd61f9a15c2cd83ec8ecc"
+  dependencies:
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+
+detective@^4.0.0:
+  version "4.7.1"
+  resolved "https://registry.yarnpkg.com/detective/-/detective-4.7.1.tgz#0eca7314338442febb6d65da54c10bb1c82b246e"
+  dependencies:
+    acorn "^5.2.1"
+    defined "^1.0.0"
+
+detective@~3.1.0:
+  version "3.1.0"
+  resolved "https://registry.yarnpkg.com/detective/-/detective-3.1.0.tgz#77782444ab752b88ca1be2e9d0a0395f1da25eed"
+  dependencies:
+    escodegen "~1.1.0"
+    esprima-fb "3001.1.0-dev-harmony-fb"
+
+diff@^2.2.1:
+  version "2.2.3"
+  resolved "https://registry.yarnpkg.com/diff/-/diff-2.2.3.tgz#60eafd0d28ee906e4e8ff0a52c1229521033bf99"
+
+diffie-hellman@^5.0.0:
+  version "5.0.2"
+  resolved "https://registry.yarnpkg.com/diffie-hellman/-/diffie-hellman-5.0.2.tgz#b5835739270cfe26acf632099fded2a07f209e5e"
+  dependencies:
+    bn.js "^4.1.0"
+    miller-rabin "^4.0.0"
+    randombytes "^2.0.0"
+
+domain-browser@~1.1.0:
+  version "1.1.7"
+  resolved "https://registry.yarnpkg.com/domain-browser/-/domain-browser-1.1.7.tgz#867aa4b093faa05f1de08c06f4d7b21fdf8698bc"
+
+duplexer2@0.0.2, duplexer2@~0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/duplexer2/-/duplexer2-0.0.2.tgz#c614dcf67e2fb14995a91711e5a617e8a60a31db"
+  dependencies:
+    readable-stream "~1.1.9"
+
+duplexer@^0.1.1, duplexer@~0.1.1:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/duplexer/-/duplexer-0.1.1.tgz#ace6ff808c1ce66b57d1ebf97977acb02334cfc1"
+
+ecstatic@~0.4.5:
+  version "0.4.13"
+  resolved "https://registry.yarnpkg.com/ecstatic/-/ecstatic-0.4.13.tgz#9cb6eaffe211b9c84efb3f553cde2c3002717b29"
+  dependencies:
+    ent "0.0.x"
+    mime "1.2.x"
+    optimist "~0.3.5"
+
+elliptic@^6.0.0:
+  version "6.4.0"
+  resolved "https://registry.yarnpkg.com/elliptic/-/elliptic-6.4.0.tgz#cac9af8762c85836187003c8dfe193e5e2eae5df"
+  dependencies:
+    bn.js "^4.4.0"
+    brorand "^1.0.1"
+    hash.js "^1.0.0"
+    hmac-drbg "^1.0.0"
+    inherits "^2.0.1"
+    minimalistic-assert "^1.0.0"
+    minimalistic-crypto-utils "^1.0.0"
+
+ent@0.0.x, ent@~0.0.5:
+  version "0.0.7"
+  resolved "https://registry.yarnpkg.com/ent/-/ent-0.0.7.tgz#835d4e7f9e7a8d4921c692e9010ec976da5e9949"
+
+es-abstract@^1.5.0:
+  version "1.10.0"
+  resolved "https://registry.yarnpkg.com/es-abstract/-/es-abstract-1.10.0.tgz#1ecb36c197842a00d8ee4c2dfd8646bb97d60864"
+  dependencies:
+    es-to-primitive "^1.1.1"
+    function-bind "^1.1.1"
+    has "^1.0.1"
+    is-callable "^1.1.3"
+    is-regex "^1.0.4"
+
+es-to-primitive@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/es-to-primitive/-/es-to-primitive-1.1.1.tgz#45355248a88979034b6792e19bb81f2b7975dd0d"
+  dependencies:
+    is-callable "^1.1.1"
+    is-date-object "^1.0.1"
+    is-symbol "^1.0.1"
+
+escape-string-regexp@^1.0.2, escape-string-regexp@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/escape-string-regexp/-/escape-string-regexp-1.0.5.tgz#1b61c0562190a8dff6ae3bb2cf0200ca130b86d4"
+
+escodegen@~1.1.0:
+  version "1.1.0"
+  resolved "https://registry.yarnpkg.com/escodegen/-/escodegen-1.1.0.tgz#c663923f6e20aad48d0c0fa49f31c6d4f49360cf"
+  dependencies:
+    esprima "~1.0.4"
+    estraverse "~1.5.0"
+    esutils "~1.0.0"
+  optionalDependencies:
+    source-map "~0.1.30"
+
+escope@~0.0.13:
+  version "0.0.16"
+  resolved "https://registry.yarnpkg.com/escope/-/escope-0.0.16.tgz#418c7a0afca721dafe659193fd986283e746538f"
+  dependencies:
+    estraverse ">= 0.0.2"
+
+esprima-fb@3001.1.0-dev-harmony-fb, esprima-fb@^3001.1.0-dev-harmony-fb:
+  version "3001.1.0-dev-harmony-fb"
+  resolved "https://registry.yarnpkg.com/esprima-fb/-/esprima-fb-3001.0001.0000-dev-harmony-fb.tgz#b77d37abcd38ea0b77426bb8bc2922ce6b426411"
+
+esprima@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/esprima/-/esprima-4.0.0.tgz#4499eddcd1110e0b218bacf2fa7f7f59f55ca804"
+
+esprima@~1.0.2, esprima@~1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/esprima/-/esprima-1.0.4.tgz#9f557e08fc3b4d26ece9dd34f8fbf476b62585ad"
+
+esrefactor@~0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/esrefactor/-/esrefactor-0.1.0.tgz#d142795a282339ab81e936b5b7a21b11bf197b13"
+  dependencies:
+    escope "~0.0.13"
+    esprima "~1.0.2"
+    estraverse "~0.0.4"
+
+"estraverse@>= 0.0.2":
+  version "4.2.0"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-4.2.0.tgz#0dee3fed31fcd469618ce7342099fc1afa0bdb13"
+
+estraverse@~0.0.4:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-0.0.4.tgz#01a0932dfee574684a598af5a67c3bf9b6428db2"
+
+estraverse@~1.5.0:
+  version "1.5.1"
+  resolved "https://registry.yarnpkg.com/estraverse/-/estraverse-1.5.1.tgz#867a3e8e58a9f84618afb6c2ddbcd916b7cbaf71"
+
+esutils@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/esutils/-/esutils-1.0.0.tgz#8151d358e20c8acc7fb745e7472c0025fe496570"
+
+events@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/events/-/events-1.0.2.tgz#75849dcfe93d10fb057c30055afdbd51d06a8e24"
+
+evp_bytestokey@^1.0.0, evp_bytestokey@^1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/evp_bytestokey/-/evp_bytestokey-1.0.3.tgz#7fcbdb198dc71959432efe13842684e0525acb02"
+  dependencies:
+    md5.js "^1.3.4"
+    safe-buffer "^5.1.1"
+
+figures@^1.4.0:
+  version "1.7.0"
+  resolved "https://registry.yarnpkg.com/figures/-/figures-1.7.0.tgz#cbe1e3affcf1cd44b80cadfed28dc793a9701d2e"
+  dependencies:
+    escape-string-regexp "^1.0.5"
+    object-assign "^4.1.0"
+
+foreach@^2.0.5:
+  version "2.0.5"
+  resolved "https://registry.yarnpkg.com/foreach/-/foreach-2.0.5.tgz#0bee005018aeb260d0a3af3ae658dd0136ec1b99"
+
+function-bind@^1.0.2, function-bind@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.1.1.tgz#a56899d3ea3c9bab874bb9773b7c5ede92f4895d"
+
+function-bind@~1.0.2:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/function-bind/-/function-bind-1.0.2.tgz#c2873b69c5e6d7cefae47d2555172926c8c2e05e"
+
+glob@^4.0.5:
+  version "4.5.3"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-4.5.3.tgz#c6cb73d3226c1efef04de3c56d012f03377ee15f"
+  dependencies:
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "^2.0.1"
+    once "^1.3.0"
+
+glob@~3.2.1, glob@~3.2.8:
+  version "3.2.11"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-3.2.11.tgz#4a973f635b9190f715d10987d5c00fd2815ebe3d"
+  dependencies:
+    inherits "2"
+    minimatch "0.3"
+
+glob@~5.0.3:
+  version "5.0.15"
+  resolved "https://registry.yarnpkg.com/glob/-/glob-5.0.15.tgz#1bc936b9e02f4a603fcc222ecf7633d30b8b93b1"
+  dependencies:
+    inflight "^1.0.4"
+    inherits "2"
+    minimatch "2 || 3"
+    once "^1.3.0"
+    path-is-absolute "^1.0.0"
+
+has-ansi@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/has-ansi/-/has-ansi-2.0.0.tgz#34f5049ce1ecdf2b0649af3ef24e45ed35416d91"
+  dependencies:
+    ansi-regex "^2.0.0"
+
+has@^1.0.0, has@^1.0.1, has@~1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/has/-/has-1.0.1.tgz#8461733f538b0837c9361e39a9ab9e9704dc2f28"
+  dependencies:
+    function-bind "^1.0.2"
+
+hash-base@^2.0.0:
+  version "2.0.2"
+  resolved "https://registry.yarnpkg.com/hash-base/-/hash-base-2.0.2.tgz#66ea1d856db4e8a5470cadf6fce23ae5244ef2e1"
+  dependencies:
+    inherits "^2.0.1"
+
+hash-base@^3.0.0:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/hash-base/-/hash-base-3.0.4.tgz#5fc8686847ecd73499403319a6b0a3f3f6ae4918"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+hash.js@^1.0.0, hash.js@^1.0.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/hash.js/-/hash.js-1.1.3.tgz#340dedbe6290187151c1ea1d777a3448935df846"
+  dependencies:
+    inherits "^2.0.3"
+    minimalistic-assert "^1.0.0"
+
+headless@~0.1.3:
+  version "0.1.7"
+  resolved "https://registry.yarnpkg.com/headless/-/headless-0.1.7.tgz#6e62fae668947f88184d5c156ede7c5695a7e9c8"
+
+hirestime@^1.0.6:
+  version "1.0.7"
+  resolved "https://registry.yarnpkg.com/hirestime/-/hirestime-1.0.7.tgz#2d5271ea84356cec3f25da8c56a9402f8fc0a700"
+
+hmac-drbg@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/hmac-drbg/-/hmac-drbg-1.0.1.tgz#d2745701025a6c775a6c545793ed502fc0c649a1"
+  dependencies:
+    hash.js "^1.0.3"
+    minimalistic-assert "^1.0.0"
+    minimalistic-crypto-utils "^1.0.1"
+
+htmlescape@^1.1.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/htmlescape/-/htmlescape-1.1.1.tgz#3a03edc2214bca3b66424a3e7959349509cb0351"
+
+http-browserify@~1.3.1:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/http-browserify/-/http-browserify-1.3.2.tgz#b562c34479349a690d7a6597df495aefa8c604f5"
+  dependencies:
+    Base64 "~0.2.0"
+    inherits "~2.0.1"
+
+https-browserify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/https-browserify/-/https-browserify-0.0.1.tgz#3f91365cabe60b77ed0ebba24b454e3e09d95a82"
+
+ieee754@^1.1.4, ieee754@~1.1.1:
+  version "1.1.8"
+  resolved "https://registry.yarnpkg.com/ieee754/-/ieee754-1.1.8.tgz#be33d40ac10ef1926701f6f08a2d86fbfd1ad3e4"
+
+indexof@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/indexof/-/indexof-0.0.1.tgz#82dc336d232b9062179d05ab3293a66059fd435d"
+
+inflight@^1.0.4:
+  version "1.0.6"
+  resolved "https://registry.yarnpkg.com/inflight/-/inflight-1.0.6.tgz#49bd6331d7d02d0c09bc910a1075ba8165b56df9"
+  dependencies:
+    once "^1.3.0"
+    wrappy "1"
+
+inherits@2, inherits@^2.0.1, inherits@^2.0.3, inherits@~2.0.1, inherits@~2.0.3:
+  version "2.0.3"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.3.tgz#633c2c83e3da42a502f52466022480f4208261de"
+
+inherits@2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/inherits/-/inherits-2.0.1.tgz#b17d08d326b4423e568eff719f91b0b1cbdf69f1"
+
+inline-source-map@~0.3.0:
+  version "0.3.1"
+  resolved "https://registry.yarnpkg.com/inline-source-map/-/inline-source-map-0.3.1.tgz#a528b514e689fce90db3089e870d92f527acb5eb"
+  dependencies:
+    source-map "~0.3.0"
+
+inline-source-map@~0.5.0:
+  version "0.5.0"
+  resolved "https://registry.yarnpkg.com/inline-source-map/-/inline-source-map-0.5.0.tgz#4a4c5dd8e4fb5e9b3cda60c822dfadcaee66e0af"
+  dependencies:
+    source-map "~0.4.0"
+
+insert-module-globals@^6.4.1:
+  version "6.6.3"
+  resolved "https://registry.yarnpkg.com/insert-module-globals/-/insert-module-globals-6.6.3.tgz#20638e29a30f9ed1ca2e3a825fbc2cba5246ddfc"
+  dependencies:
+    JSONStream "^1.0.3"
+    combine-source-map "~0.6.1"
+    concat-stream "~1.4.1"
+    is-buffer "^1.1.0"
+    lexical-scope "^1.2.0"
+    process "~0.11.0"
+    through2 "^1.0.0"
+    xtend "^4.0.0"
+
+insert-module-globals@~6.0.0:
+  version "6.0.0"
+  resolved "https://registry.yarnpkg.com/insert-module-globals/-/insert-module-globals-6.0.0.tgz#ee8aeb9dee16819e33aa14588a558824af0c15dc"
+  dependencies:
+    JSONStream "~0.7.1"
+    concat-stream "~1.4.1"
+    lexical-scope "~1.1.0"
+    process "~0.6.0"
+    through "~2.3.4"
+    xtend "^3.0.0"
+
+is-buffer@^1.1.0:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/is-buffer/-/is-buffer-1.1.6.tgz#efaa2ea9daa0d7ab2ea13a97b2b8ad51fefbe8be"
+
+is-callable@^1.1.1, is-callable@^1.1.3:
+  version "1.1.3"
+  resolved "https://registry.yarnpkg.com/is-callable/-/is-callable-1.1.3.tgz#86eb75392805ddc33af71c92a0eedf74ee7604b2"
+
+is-date-object@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-date-object/-/is-date-object-1.0.1.tgz#9aa20eb6aeebbff77fbd33e74ca01b33581d3a16"
+
+is-finite@^1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/is-finite/-/is-finite-1.0.2.tgz#cc6677695602be550ef11e8b4aa6305342b6d0aa"
+  dependencies:
+    number-is-nan "^1.0.0"
+
+is-regex@^1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/is-regex/-/is-regex-1.0.4.tgz#5517489b547091b0930e095654ced25ee97e9491"
+  dependencies:
+    has "^1.0.1"
+
+is-symbol@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/is-symbol/-/is-symbol-1.0.1.tgz#3cc59f00025194b6ab2e38dbae6689256b660572"
+
+isarray@0.0.1, isarray@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/isarray/-/isarray-0.0.1.tgz#8a18acfca9a8f4177e09abfc6038939b05d1eedf"
+
+isarray@^1.0.0, isarray@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/isarray/-/isarray-1.0.0.tgz#bb935d48582cba168c06834957a54a3e07124f11"
+
+js-yaml@^3.4.6:
+  version "3.10.0"
+  resolved "https://registry.yarnpkg.com/js-yaml/-/js-yaml-3.10.0.tgz#2e78441646bd4682e963f22b6e92823c309c62dc"
+  dependencies:
+    argparse "^1.0.7"
+    esprima "^4.0.0"
+
+json-stable-stringify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/json-stable-stringify/-/json-stable-stringify-0.0.1.tgz#611c23e814db375527df851193db59dd2af27f45"
+  dependencies:
+    jsonify "~0.0.0"
+
+jsonify@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/jsonify/-/jsonify-0.0.0.tgz#2c74b6ee41d93ca51b7b5aaee8f503631d252a73"
+
+jsonparse@0.0.5:
+  version "0.0.5"
+  resolved "https://registry.yarnpkg.com/jsonparse/-/jsonparse-0.0.5.tgz#330542ad3f0a654665b778f3eb2d9a9fa507ac64"
+
+jsonparse@^1.2.0:
+  version "1.3.1"
+  resolved "https://registry.yarnpkg.com/jsonparse/-/jsonparse-1.3.1.tgz#3f4dae4a91fac315f71062f8521cc239f1366280"
+
+labeled-stream-splicer@^1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/labeled-stream-splicer/-/labeled-stream-splicer-1.0.2.tgz#4615331537784981e8fd264e1f3a434c4e0ddd65"
+  dependencies:
+    inherits "^2.0.1"
+    isarray "~0.0.1"
+    stream-splicer "^1.1.0"
+
+lexical-scope@^1.2.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/lexical-scope/-/lexical-scope-1.2.0.tgz#fcea5edc704a4b3a8796cdca419c3a0afaf22df4"
+  dependencies:
+    astw "^2.0.0"
+
+lexical-scope@~1.1.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/lexical-scope/-/lexical-scope-1.1.1.tgz#debac1067435f1359d90fcfd9e94bcb2ee47b2bf"
+  dependencies:
+    astw "^2.0.0"
+
+lodash.memoize@~3.0.3:
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/lodash.memoize/-/lodash.memoize-3.0.4.tgz#2dcbd2c287cbc0a55cc42328bd0c736150d53e3f"
+
+lru-cache@2:
+  version "2.7.3"
+  resolved "https://registry.yarnpkg.com/lru-cache/-/lru-cache-2.7.3.tgz#6d4524e8b955f95d4f5b58851ce21dd72fb4e952"
+
+md5.js@^1.3.4:
+  version "1.3.4"
+  resolved "https://registry.yarnpkg.com/md5.js/-/md5.js-1.3.4.tgz#e9bdbde94a20a5ac18b04340fc5764d5b09d901d"
+  dependencies:
+    hash-base "^3.0.0"
+    inherits "^2.0.1"
+
+merge@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/merge/-/merge-1.0.0.tgz#b443ab46d837c491e6222056ab0f7933ecb3568f"
+
+miller-rabin@^4.0.0:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/miller-rabin/-/miller-rabin-4.0.1.tgz#f080351c865b0dc562a8462966daa53543c78a4d"
+  dependencies:
+    bn.js "^4.0.0"
+    brorand "^1.0.1"
+
+mime@1.2.x:
+  version "1.2.11"
+  resolved "https://registry.yarnpkg.com/mime/-/mime-1.2.11.tgz#58203eed86e3a5ef17aed2b7d9ebd47f0a60dd10"
+
+minimalistic-assert@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/minimalistic-assert/-/minimalistic-assert-1.0.0.tgz#702be2dda6b37f4836bcb3f5db56641b64a1d3d3"
+
+minimalistic-crypto-utils@^1.0.0, minimalistic-crypto-utils@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/minimalistic-crypto-utils/-/minimalistic-crypto-utils-1.0.1.tgz#f6c00c1c0b082246e5c4d99dfb8c7c083b2b582a"
+
+minimatch@0.3:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-0.3.0.tgz#275d8edaac4f1bb3326472089e7949c8394699dd"
+  dependencies:
+    lru-cache "2"
+    sigmund "~1.0.0"
+
+"minimatch@2 || 3":
+  version "3.0.4"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-3.0.4.tgz#5166e286457f03306064be5497e8dbb0c3d32083"
+  dependencies:
+    brace-expansion "^1.1.7"
+
+minimatch@^2.0.1:
+  version "2.0.10"
+  resolved "https://registry.yarnpkg.com/minimatch/-/minimatch-2.0.10.tgz#8d087c39c6b38c001b97fca7ce6d0e1e80afbac7"
+  dependencies:
+    brace-expansion "^1.0.0"
+
+minimist@0.0.5:
+  version "0.0.5"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-0.0.5.tgz#d7aa327bcecf518f9106ac6b8f003fa3bcea8566"
+
+minimist@^1.1.0:
+  version "1.2.0"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-1.2.0.tgz#a35008b20f41383eec1fb914f4cd5df79a264284"
+
+minimist@~0.0.1, minimist@~0.0.7, minimist@~0.0.9:
+  version "0.0.10"
+  resolved "https://registry.yarnpkg.com/minimist/-/minimist-0.0.10.tgz#de3f98543dbf96082be48ad1a0c7cda836301dcf"
+
+mkdirp@~0.3.3:
+  version "0.3.5"
+  resolved "https://registry.yarnpkg.com/mkdirp/-/mkdirp-0.3.5.tgz#de3e5f8961c88c787ee1368df849ac4413eca8d7"
+
+module-deps@^3.7.11:
+  version "3.9.1"
+  resolved "https://registry.yarnpkg.com/module-deps/-/module-deps-3.9.1.tgz#ea75caf9199090d25b0d5512b5acacb96e7f87f3"
+  dependencies:
+    JSONStream "^1.0.3"
+    browser-resolve "^1.7.0"
+    concat-stream "~1.4.5"
+    defined "^1.0.0"
+    detective "^4.0.0"
+    duplexer2 "0.0.2"
+    inherits "^2.0.1"
+    parents "^1.0.0"
+    readable-stream "^1.1.13"
+    resolve "^1.1.3"
+    stream-combiner2 "~1.0.0"
+    subarg "^1.0.0"
+    through2 "^1.0.0"
+    xtend "^4.0.0"
+
+module-deps@~2.0.0:
+  version "2.0.6"
+  resolved "https://registry.yarnpkg.com/module-deps/-/module-deps-2.0.6.tgz#b999321c73ac33580f00712c0f3075fdca42563f"
+  dependencies:
+    JSONStream "~0.7.1"
+    browser-resolve "~1.2.4"
+    concat-stream "~1.4.5"
+    detective "~3.1.0"
+    duplexer2 "0.0.2"
+    inherits "~2.0.1"
+    minimist "~0.0.9"
+    parents "0.0.2"
+    readable-stream "^1.0.27-1"
+    resolve "~0.6.3"
+    stream-combiner "~0.1.0"
+    through2 "~0.4.1"
+
+number-is-nan@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/number-is-nan/-/number-is-nan-1.0.1.tgz#097b602b53422a522c1afb8790318336941a011d"
+
+object-assign@^4.1.0:
+  version "4.1.1"
+  resolved "https://registry.yarnpkg.com/object-assign/-/object-assign-4.1.1.tgz#2109adc7965887cfc05cbbd442cac8bfbb360863"
+
+object-inspect@~0.1.3:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-0.1.3.tgz#d05a65c2e34fe8225d9fda2e484e4e47b7e2f490"
+  dependencies:
+    tape "~1.0.4"
+
+object-inspect@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/object-inspect/-/object-inspect-1.0.2.tgz#a97885b553e575eb4009ebc09bdda9b1cd21979a"
+
+object-keys@^1.0.4, object-keys@^1.0.8:
+  version "1.0.11"
+  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-1.0.11.tgz#c54601778ad560f1142ce0e01bcca8b56d13426d"
+
+object-keys@~0.4.0:
+  version "0.4.0"
+  resolved "https://registry.yarnpkg.com/object-keys/-/object-keys-0.4.0.tgz#28a6aae7428dd2c3a92f3d95f21335dd204e0336"
+
+once@^1.3.0:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/once/-/once-1.4.0.tgz#583b1aa775961d4b113ac17d9c50baef9dd76bd1"
+  dependencies:
+    wrappy "1"
+
+optimist@~0.3.5:
+  version "0.3.7"
+  resolved "https://registry.yarnpkg.com/optimist/-/optimist-0.3.7.tgz#c90941ad59e4273328923074d2cf2e7cbc6ec0d9"
+  dependencies:
+    wordwrap "~0.0.2"
+
+optimist@~0.5.2:
+  version "0.5.2"
+  resolved "https://registry.yarnpkg.com/optimist/-/optimist-0.5.2.tgz#85c8c1454b3315e4a78947e857b1df033450bfbc"
+  dependencies:
+    wordwrap "~0.0.2"
+
+ordered-emitter@~0.1.0:
+  version "0.1.1"
+  resolved "https://registry.yarnpkg.com/ordered-emitter/-/ordered-emitter-0.1.1.tgz#aa20bdafbdcc1631834a350f68b4ef8eb34eed7b"
+
+os-browserify@~0.1.1:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/os-browserify/-/os-browserify-0.1.2.tgz#49ca0293e0b19590a5f5de10c7f265a617d8fe54"
+
+pako@~0.2.0:
+  version "0.2.9"
+  resolved "https://registry.yarnpkg.com/pako/-/pako-0.2.9.tgz#f3f7522f4ef782348da8161bad9ecfd51bf83a75"
+
+parents@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-0.0.2.tgz#67147826e497d40759aaf5ba4c99659b6034d302"
+
+parents@^1.0.0, parents@^1.0.1:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-1.0.1.tgz#fedd4d2bf193a77745fe71e371d73c3307d9c751"
+  dependencies:
+    path-platform "~0.11.15"
+
+parents@~0.0.1:
+  version "0.0.3"
+  resolved "https://registry.yarnpkg.com/parents/-/parents-0.0.3.tgz#fa212f024d9fa6318dbb6b4ce676c8be493b9c43"
+  dependencies:
+    path-platform "^0.0.1"
+
+parse-asn1@^5.0.0:
+  version "5.1.0"
+  resolved "https://registry.yarnpkg.com/parse-asn1/-/parse-asn1-5.1.0.tgz#37c4f9b7ed3ab65c74817b5f2480937fbf97c712"
+  dependencies:
+    asn1.js "^4.0.0"
+    browserify-aes "^1.0.0"
+    create-hash "^1.1.0"
+    evp_bytestokey "^1.0.0"
+    pbkdf2 "^3.0.3"
+
+parse-ms@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/parse-ms/-/parse-ms-1.0.1.tgz#56346d4749d78f23430ca0c713850aef91aa361d"
+
+path-browserify@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/path-browserify/-/path-browserify-0.0.0.tgz#a0b870729aae214005b7d5032ec2cbbb0fb4451a"
+
+path-is-absolute@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/path-is-absolute/-/path-is-absolute-1.0.1.tgz#174b9268735534ffbc7ace6bf53a5a9e1b5c5f5f"
+
+path-parse@^1.0.5:
+  version "1.0.5"
+  resolved "https://registry.yarnpkg.com/path-parse/-/path-parse-1.0.5.tgz#3c1adf871ea9cd6c9431b6ea2bd74a0ff055c4c1"
+
+path-platform@^0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/path-platform/-/path-platform-0.0.1.tgz#b5585d7c3c463d89aa0060d86611cf1afd617e2a"
+
+path-platform@~0.11.15:
+  version "0.11.15"
+  resolved "https://registry.yarnpkg.com/path-platform/-/path-platform-0.11.15.tgz#e864217f74c36850f0852b78dc7bf7d4a5721bf2"
+
+pbkdf2@^3.0.3:
+  version "3.0.14"
+  resolved "https://registry.yarnpkg.com/pbkdf2/-/pbkdf2-3.0.14.tgz#a35e13c64799b06ce15320f459c230e68e73bade"
+  dependencies:
+    create-hash "^1.1.2"
+    create-hmac "^1.1.4"
+    ripemd160 "^2.0.1"
+    safe-buffer "^5.0.1"
+    sha.js "^2.4.8"
+
+plist@0.2.1:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/plist/-/plist-0.2.1.tgz#f3a3de07885d773e66d8a96782f1bec28cf2b2d0"
+  dependencies:
+    sax "0.1.x"
+
+plur@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/plur/-/plur-1.0.0.tgz#db85c6814f5e5e5a3b49efc28d604fec62975156"
+
+pretty-ms@^2.1.0:
+  version "2.1.0"
+  resolved "https://registry.yarnpkg.com/pretty-ms/-/pretty-ms-2.1.0.tgz#4257c256df3fb0b451d6affaab021884126981dc"
+  dependencies:
+    is-finite "^1.0.1"
+    parse-ms "^1.0.0"
+    plur "^1.0.0"
+
+process-nextick-args@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/process-nextick-args/-/process-nextick-args-2.0.0.tgz#a37d732f4271b4ab1ad070d35508e8290788ffaa"
+
+process@^0.7.0:
+  version "0.7.0"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.7.0.tgz#c52208161a34adf3812344ae85d3e6150469389d"
+
+process@~0.11.0:
+  version "0.11.10"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.11.10.tgz#7332300e840161bda3e69a1d1d91a7d4bc16f182"
+
+process@~0.5.1:
+  version "0.5.2"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.5.2.tgz#1638d8a8e34c2f440a91db95ab9aeb677fc185cf"
+
+process@~0.6.0:
+  version "0.6.0"
+  resolved "https://registry.yarnpkg.com/process/-/process-0.6.0.tgz#7dd9be80ffaaedd4cb628f1827f1cbab6dc0918f"
+
+public-encrypt@^4.0.0:
+  version "4.0.0"
+  resolved "https://registry.yarnpkg.com/public-encrypt/-/public-encrypt-4.0.0.tgz#39f699f3a46560dd5ebacbca693caf7c65c18cc6"
+  dependencies:
+    bn.js "^4.1.0"
+    browserify-rsa "^4.0.0"
+    create-hash "^1.1.0"
+    parse-asn1 "^5.0.0"
+    randombytes "^2.0.1"
+
+punycode@1.3.2:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.3.2.tgz#9653a036fb7c1ee42342f2325cceefea3926c48d"
+
+punycode@^1.3.2:
+  version "1.4.1"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.4.1.tgz#c0d5a63b2718800ad8e1eb0fa5269c84dd41845e"
+
+punycode@~1.2.3:
+  version "1.2.4"
+  resolved "https://registry.yarnpkg.com/punycode/-/punycode-1.2.4.tgz#54008ac972aec74175def9cba6df7fa9d3918740"
+
+querystring-es3@0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/querystring-es3/-/querystring-es3-0.2.0.tgz#c365a08a69c443accfeb3a9deab35e3f0abaa476"
+
+querystring-es3@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/querystring-es3/-/querystring-es3-0.2.1.tgz#9ec61f79049875707d69414596fd907a4d711e73"
+
+querystring@0.2.0:
+  version "0.2.0"
+  resolved "https://registry.yarnpkg.com/querystring/-/querystring-0.2.0.tgz#b209849203bb25df820da756e747005878521620"
+
+ramda@^0.18.0:
+  version "0.18.0"
+  resolved "https://registry.yarnpkg.com/ramda/-/ramda-0.18.0.tgz#c6e3c5d4b9ab1f7906727fdeeb039152a85d4db3"
+
+randombytes@^2.0.0, randombytes@^2.0.1, randombytes@^2.0.5:
+  version "2.0.6"
+  resolved "https://registry.yarnpkg.com/randombytes/-/randombytes-2.0.6.tgz#d302c522948588848a8d300c932b44c24231da80"
+  dependencies:
+    safe-buffer "^5.1.0"
+
+randomfill@^1.0.3:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/randomfill/-/randomfill-1.0.4.tgz#c92196fc86ab42be983f1bf31778224931d61458"
+  dependencies:
+    randombytes "^2.0.5"
+    safe-buffer "^5.1.0"
+
+read-only-stream@^1.1.1:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/read-only-stream/-/read-only-stream-1.1.1.tgz#5da77c799ed1388d3ef88a18471bb5924f8a0ba1"
+  dependencies:
+    readable-stream "^1.0.31"
+    readable-wrap "^1.0.0"
+
+"readable-stream@>=1.1.13-1 <1.2.0-0", readable-stream@^1.0.27-1, readable-stream@^1.0.31, readable-stream@^1.1.13, readable-stream@^1.1.13-1, readable-stream@~1.1.9:
+  version "1.1.14"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-1.1.14.tgz#7cf4c54ef648e3813084c636dd2079e166c081d9"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.1"
+    isarray "0.0.1"
+    string_decoder "~0.10.x"
+
+readable-stream@^2.0.2, readable-stream@^2.0.4:
+  version "2.3.4"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-2.3.4.tgz#c946c3f47fa7d8eabc0b6150f4a12f69a4574071"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.3"
+    isarray "~1.0.0"
+    process-nextick-args "~2.0.0"
+    safe-buffer "~5.1.1"
+    string_decoder "~1.0.3"
+    util-deprecate "~1.0.1"
+
+readable-stream@~1.0.17:
+  version "1.0.34"
+  resolved "https://registry.yarnpkg.com/readable-stream/-/readable-stream-1.0.34.tgz#125820e34bc842d2f2aaafafe4c2916ee32c157c"
+  dependencies:
+    core-util-is "~1.0.0"
+    inherits "~2.0.1"
+    isarray "0.0.1"
+    string_decoder "~0.10.x"
+
+readable-wrap@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/readable-wrap/-/readable-wrap-1.0.0.tgz#3b5a211c631e12303a54991c806c17e7ae206bff"
+  dependencies:
+    readable-stream "^1.1.13-1"
+
+resolve@0.6.3, resolve@~0.6.1, resolve@~0.6.3:
+  version "0.6.3"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.6.3.tgz#dd957982e7e736debdf53b58a4dd91754575dd46"
+
+resolve@1.1.7:
+  version "1.1.7"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.1.7.tgz#203114d82ad2c5ed9e8e0411b3932875e889e97b"
+
+resolve@^1.1.3, resolve@^1.1.4:
+  version "1.5.0"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-1.5.0.tgz#1f09acce796c9a762579f31b2c1cc4c3cddf9f36"
+  dependencies:
+    path-parse "^1.0.5"
+
+resolve@~0.3.0:
+  version "0.3.1"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.3.1.tgz#34c63447c664c70598d1c9b126fc43b2a24310a4"
+
+resolve@~0.4.0:
+  version "0.4.3"
+  resolved "https://registry.yarnpkg.com/resolve/-/resolve-0.4.3.tgz#dcadad202e7cacc2467e3a38800211f42f9c13df"
+
+resumer@~0.0.0:
+  version "0.0.0"
+  resolved "https://registry.yarnpkg.com/resumer/-/resumer-0.0.0.tgz#f1e8f461e4064ba39e82af3cdc2a8c893d076759"
+  dependencies:
+    through "~2.3.4"
+
+rfile@~1.0, rfile@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/rfile/-/rfile-1.0.0.tgz#59708cf90ca1e74c54c3cfc5c36fdb9810435261"
+  dependencies:
+    callsite "~1.0.0"
+    resolve "~0.3.0"
+
+ripemd160@^2.0.0, ripemd160@^2.0.1:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/ripemd160/-/ripemd160-2.0.1.tgz#0f4584295c53a3628af7e6d79aca21ce57d1c6e7"
+  dependencies:
+    hash-base "^2.0.0"
+    inherits "^2.0.1"
+
+ruglify@~1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/ruglify/-/ruglify-1.0.0.tgz#dc8930e2a9544a274301cc9972574c0d0986b675"
+  dependencies:
+    rfile "~1.0"
+    uglify-js "~2.2"
+
+rx-node@^1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/rx-node/-/rx-node-1.0.2.tgz#151240725a79e857360ab06cc626799965e094de"
+  dependencies:
+    rx "*"
+
+rx@*, rx@^4.0.7:
+  version "4.1.0"
+  resolved "https://registry.yarnpkg.com/rx/-/rx-4.1.0.tgz#a5f13ff79ef3b740fe30aa803fb09f98805d4782"
+
+safe-buffer@^5.0.1, safe-buffer@^5.1.0, safe-buffer@^5.1.1, safe-buffer@~5.1.0, safe-buffer@~5.1.1:
+  version "5.1.1"
+  resolved "https://registry.yarnpkg.com/safe-buffer/-/safe-buffer-5.1.1.tgz#893312af69b2123def71f57889001671eeb2c853"
+
+sax@0.1.x:
+  version "0.1.5"
+  resolved "https://registry.yarnpkg.com/sax/-/sax-0.1.5.tgz#d1829a6120fa01665eb4dbff6c43f29fd6d61471"
+
+sha.js@^2.4.0, sha.js@^2.4.8, sha.js@~2.4.4:
+  version "2.4.10"
+  resolved "https://registry.yarnpkg.com/sha.js/-/sha.js-2.4.10.tgz#b1fde5cd7d11a5626638a07c604ab909cfa31f9b"
+  dependencies:
+    inherits "^2.0.1"
+    safe-buffer "^5.0.1"
+
+shallow-copy@0.0.1, shallow-copy@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/shallow-copy/-/shallow-copy-0.0.1.tgz#415f42702d73d810330292cc5ee86eae1a11a170"
+
+shasum@^1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/shasum/-/shasum-1.0.2.tgz#e7012310d8f417f4deb5712150e5678b87ae565f"
+  dependencies:
+    json-stable-stringify "~0.0.0"
+    sha.js "~2.4.4"
+
+shell-quote@~0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/shell-quote/-/shell-quote-0.0.1.tgz#1a41196f3c0333c482323593d6886ecf153dd986"
+
+shell-quote@~1.3.1:
+  version "1.3.3"
+  resolved "https://registry.yarnpkg.com/shell-quote/-/shell-quote-1.3.3.tgz#07b8826f427c052511e8b5627639e172596e8e4b"
+
+sigmund@~1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/sigmund/-/sigmund-1.0.1.tgz#3ff21f198cad2175f9f3b781853fd94d0d19b590"
+
+source-map@0.1.34:
+  version "0.1.34"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.1.34.tgz#a7cfe89aec7b1682c3b198d0acfb47d7d090566b"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.1.30, source-map@~0.1.31, source-map@~0.1.7:
+  version "0.1.43"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.1.43.tgz#c24bc146ca517c1471f5dacbe2571b2b7f9e3346"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.3.0:
+  version "0.3.0"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.3.0.tgz#8586fb9a5a005e5b501e21cd18b6f21b457ad1f9"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.4.0, source-map@~0.4.2:
+  version "0.4.4"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.4.4.tgz#eba4f5da9c0dc999de68032d8b4f76173652036b"
+  dependencies:
+    amdefine ">=0.0.4"
+
+source-map@~0.5.1:
+  version "0.5.7"
+  resolved "https://registry.yarnpkg.com/source-map/-/source-map-0.5.7.tgz#8a039d2d1021d22d1ea14c80d8ea468ba2ef3fcc"
+
+split@^1.0.0:
+  version "1.0.1"
+  resolved "https://registry.yarnpkg.com/split/-/split-1.0.1.tgz#605bd9be303aa59fb35f9229fbea0ddec9ea07d9"
+  dependencies:
+    through "2"
+
+split@~0.1.2:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/split/-/split-0.1.2.tgz#f0710744c453d551fc7143ead983da6014e336cc"
+  dependencies:
+    through "1"
+
+sprintf-js@~1.0.2:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/sprintf-js/-/sprintf-js-1.0.3.tgz#04e6926f662895354f3dd015203633b857297e2c"
+
+stream-browserify@^2.0.0:
+  version "2.0.1"
+  resolved "https://registry.yarnpkg.com/stream-browserify/-/stream-browserify-2.0.1.tgz#66266ee5f9bdb9940a4e4514cafb43bb71e5c9db"
+  dependencies:
+    inherits "~2.0.1"
+    readable-stream "^2.0.2"
+
+stream-browserify@~0.1.0:
+  version "0.1.3"
+  resolved "https://registry.yarnpkg.com/stream-browserify/-/stream-browserify-0.1.3.tgz#95cf1b369772e27adaf46352265152689c6c4be9"
+  dependencies:
+    inherits "~2.0.1"
+    process "~0.5.1"
+
+stream-combiner2@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/stream-combiner2/-/stream-combiner2-1.0.2.tgz#ba72a6b50cbfabfa950fc8bc87604bd01eb60671"
+  dependencies:
+    duplexer2 "~0.0.2"
+    through2 "~0.5.1"
+
+stream-combiner@~0.0.2:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/stream-combiner/-/stream-combiner-0.0.4.tgz#4d5e433c185261dde623ca3f44c586bcf5c4ad14"
+  dependencies:
+    duplexer "~0.1.1"
+
+stream-combiner@~0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/stream-combiner/-/stream-combiner-0.1.0.tgz#0dc389a3c203f8f4d56368f95dde52eb9269b5be"
+  dependencies:
+    duplexer "~0.1.1"
+    through "~2.3.4"
+
+stream-http@^1.2.0:
+  version "1.7.1"
+  resolved "https://registry.yarnpkg.com/stream-http/-/stream-http-1.7.1.tgz#d3d2a6e14c36a38b9dafb199aee7bbc570519978"
+  dependencies:
+    builtin-status-codes "^1.0.0"
+    foreach "^2.0.5"
+    indexof "0.0.1"
+    inherits "^2.0.1"
+    object-keys "^1.0.4"
+    xtend "^4.0.0"
+
+stream-splicer@^1.1.0:
+  version "1.3.2"
+  resolved "https://registry.yarnpkg.com/stream-splicer/-/stream-splicer-1.3.2.tgz#3c0441be15b9bf4e226275e6dc83964745546661"
+  dependencies:
+    indexof "0.0.1"
+    inherits "^2.0.1"
+    isarray "~0.0.1"
+    readable-stream "^1.1.13-1"
+    readable-wrap "^1.0.0"
+    through2 "^1.0.0"
+
+string.prototype.trim@^1.1.1:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/string.prototype.trim/-/string.prototype.trim-1.1.2.tgz#d04de2c89e137f4d7d206f086b5ed2fae6be8cea"
+  dependencies:
+    define-properties "^1.1.2"
+    es-abstract "^1.5.0"
+    function-bind "^1.0.2"
+
+string_decoder@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-0.0.1.tgz#f5472d0a8d1650ec823752d24e6fd627b39bf141"
+
+string_decoder@~0.10.0, string_decoder@~0.10.x:
+  version "0.10.31"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-0.10.31.tgz#62e203bc41766c6c28c9fc84301dab1c5310fa94"
+
+string_decoder@~1.0.3:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/string_decoder/-/string_decoder-1.0.3.tgz#0fc67d7c141825de94282dd536bec6b9bce860ab"
+  dependencies:
+    safe-buffer "~5.1.0"
+
+strip-ansi@^3.0.0:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/strip-ansi/-/strip-ansi-3.0.1.tgz#6a385fb8853d952d5ff05d0e8aaf94278dc63dcf"
+  dependencies:
+    ansi-regex "^2.0.0"
+
+subarg@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/subarg/-/subarg-0.0.1.tgz#3d56b07dacfbc45bbb63f7672b43b63e46368e3a"
+  dependencies:
+    minimist "~0.0.7"
+
+subarg@^1.0.0:
+  version "1.0.0"
+  resolved "https://registry.yarnpkg.com/subarg/-/subarg-1.0.0.tgz#f62cf17581e996b48fc965699f54c06ae268b8d2"
+  dependencies:
+    minimist "^1.1.0"
+
+supports-color@^2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/supports-color/-/supports-color-2.0.0.tgz#535d045ce6b6363fa40117084629995e9df324c7"
+
+syntax-error@^1.1.1:
+  version "1.4.0"
+  resolved "https://registry.yarnpkg.com/syntax-error/-/syntax-error-1.4.0.tgz#2d9d4ff5c064acb711594a3e3b95054ad51d907c"
+  dependencies:
+    acorn-node "^1.2.0"
+
+syntax-error@~1.1.0:
+  version "1.1.6"
+  resolved "https://registry.yarnpkg.com/syntax-error/-/syntax-error-1.1.6.tgz#b4549706d386cc1c1dc7c2423f18579b6cade710"
+  dependencies:
+    acorn "^2.7.0"
+
+tap-finished@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/tap-finished/-/tap-finished-0.0.1.tgz#08b5b543fdc04830290c6c561279552e71c4bd67"
+  dependencies:
+    tap-parser "~0.2.0"
+    through "~2.3.4"
+
+tap-parser@~0.2.0:
+  version "0.2.1"
+  resolved "https://registry.yarnpkg.com/tap-parser/-/tap-parser-0.2.1.tgz#8e1e823f2114ee21d032e2f31e4fb642a296f50b"
+  dependencies:
+    split "~0.1.2"
+
+tape@4.2.1:
+  version "4.2.1"
+  resolved "https://registry.yarnpkg.com/tape/-/tape-4.2.1.tgz#1a0ed63cc86bfaa84ebb3bb311f09d8520416216"
+  dependencies:
+    deep-equal "~1.0.0"
+    defined "~1.0.0"
+    function-bind "~1.0.2"
+    glob "~5.0.3"
+    has "~1.0.1"
+    inherits "~2.0.1"
+    object-inspect "~1.0.0"
+    resumer "~0.0.0"
+    string.prototype.trim "^1.1.1"
+    through "~2.3.4"
+
+tape@~1.0.4:
+  version "1.0.4"
+  resolved "https://registry.yarnpkg.com/tape/-/tape-1.0.4.tgz#e2e8e5c6dd3f00fdc2a5e4514f62fc221e59f9c4"
+  dependencies:
+    deep-equal "~0.0.0"
+    defined "~0.0.0"
+    jsonify "~0.0.0"
+    through "~2.3.4"
+
+testling@1.7.1:
+  version "1.7.1"
+  resolved "https://registry.yarnpkg.com/testling/-/testling-1.7.1.tgz#bfcfa877c8b15dd28d920692c03d8d64ca47874e"
+  dependencies:
+    bouncy "~3.2.0"
+    browser-launcher "~0.3.2"
+    browserify "3.x.x"
+    concat-stream "~1.0.0"
+    ecstatic "~0.4.5"
+    ent "~0.0.5"
+    glob "~3.2.1"
+    jsonify "~0.0.0"
+    object-inspect "~0.1.3"
+    optimist "~0.5.2"
+    resolve "~0.4.0"
+    shallow-copy "~0.0.0"
+    shell-quote "~1.3.1"
+    tap-finished "~0.0.0"
+    win-spawn "~2.0.0"
+    xhr-write-stream "~0.1.2"
+
+through2@^1.0.0:
+  version "1.1.1"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-1.1.1.tgz#0847cbc4449f3405574dbdccd9bb841b83ac3545"
+  dependencies:
+    readable-stream ">=1.1.13-1 <1.2.0-0"
+    xtend ">=4.0.0 <4.1.0-0"
+
+through2@~0.4.1:
+  version "0.4.2"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-0.4.2.tgz#dbf5866031151ec8352bb6c4db64a2292a840b9b"
+  dependencies:
+    readable-stream "~1.0.17"
+    xtend "~2.1.1"
+
+through2@~0.5.1:
+  version "0.5.1"
+  resolved "https://registry.yarnpkg.com/through2/-/through2-0.5.1.tgz#dfdd012eb9c700e2323fd334f38ac622ab372da7"
+  dependencies:
+    readable-stream "~1.0.17"
+    xtend "~3.0.0"
+
+through@1:
+  version "1.1.2"
+  resolved "https://registry.yarnpkg.com/through/-/through-1.1.2.tgz#344a5425a3773314ca7e0eb6512fbafaf76c0bfe"
+
+through@2, "through@>=2.2.7 <3", through@~2.3.4:
+  version "2.3.8"
+  resolved "https://registry.yarnpkg.com/through/-/through-2.3.8.tgz#0dd4c9ffaabc357960b1b724115d7e0e86a2e1f5"
+
+through@~2.2.7:
+  version "2.2.7"
+  resolved "https://registry.yarnpkg.com/through/-/through-2.2.7.tgz#6e8e21200191d4eb6a99f6f010df46aa1c6eb2bd"
+
+timers-browserify@^1.0.1:
+  version "1.4.2"
+  resolved "https://registry.yarnpkg.com/timers-browserify/-/timers-browserify-1.4.2.tgz#c9c58b575be8407375cb5e2462dacee74359f41d"
+  dependencies:
+    process "~0.11.0"
+
+timers-browserify@~1.0.1:
+  version "1.0.3"
+  resolved "https://registry.yarnpkg.com/timers-browserify/-/timers-browserify-1.0.3.tgz#ffba70c9c12eed916fd67318e629ac6f32295551"
+  dependencies:
+    process "~0.5.1"
+
+to-utf8@0.0.1:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/to-utf8/-/to-utf8-0.0.1.tgz#d17aea72ff2fba39b9e43601be7b3ff72e089852"
+
+tty-browserify@~0.0.0:
+  version "0.0.1"
+  resolved "https://registry.yarnpkg.com/tty-browserify/-/tty-browserify-0.0.1.tgz#3f05251ee17904dfd0677546670db9651682b811"
+
+typedarray@~0.0.5:
+  version "0.0.6"
+  resolved "https://registry.yarnpkg.com/typedarray/-/typedarray-0.0.6.tgz#867ac74e3864187b1d3d47d996a78ec5c8830777"
+
+uglify-js@2.5.0:
+  version "2.5.0"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.5.0.tgz#4ab5d65a4730ecb7a4fb62d3f499e2054d98fba1"
+  dependencies:
+    async "~0.2.6"
+    source-map "~0.5.1"
+    uglify-to-browserify "~1.0.0"
+    yargs "~3.5.4"
+
+uglify-js@~2.2:
+  version "2.2.5"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.2.5.tgz#a6e02a70d839792b9780488b7b8b184c095c99c7"
+  dependencies:
+    optimist "~0.3.5"
+    source-map "~0.1.7"
+
+uglify-js@~2.4.0:
+  version "2.4.24"
+  resolved "https://registry.yarnpkg.com/uglify-js/-/uglify-js-2.4.24.tgz#fad5755c1e1577658bb06ff9ab6e548c95bebd6e"
+  dependencies:
+    async "~0.2.6"
+    source-map "0.1.34"
+    uglify-to-browserify "~1.0.0"
+    yargs "~3.5.4"
+
+uglify-to-browserify@~1.0.0:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/uglify-to-browserify/-/uglify-to-browserify-1.0.2.tgz#6e0924d6bda6b5afe349e39a6d632850a0f882b7"
+
+umd@^3.0.0:
+  version "3.0.1"
+  resolved "https://registry.yarnpkg.com/umd/-/umd-3.0.1.tgz#8ae556e11011f63c2596708a8837259f01b3d60e"
+
+umd@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/umd/-/umd-2.0.0.tgz#749683b0d514728ae0e1b6195f5774afc0ad4f8f"
+  dependencies:
+    rfile "~1.0.0"
+    ruglify "~1.0.0"
+    through "~2.3.4"
+    uglify-js "~2.4.0"
+
+url@~0.10.1:
+  version "0.10.3"
+  resolved "https://registry.yarnpkg.com/url/-/url-0.10.3.tgz#021e4d9c7705f21bbf37d03ceb58767402774c64"
+  dependencies:
+    punycode "1.3.2"
+    querystring "0.2.0"
+
+util-deprecate@~1.0.1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/util-deprecate/-/util-deprecate-1.0.2.tgz#450d4dc9fa70de732762fbd2d4a28981419a0ccf"
+
+util@0.10.3, util@~0.10.1:
+  version "0.10.3"
+  resolved "https://registry.yarnpkg.com/util/-/util-0.10.3.tgz#7afb1afe50805246489e3db7fe0ed379336ac0f9"
+  dependencies:
+    inherits "2.0.1"
+
+vm-browserify@~0.0.1:
+  version "0.0.4"
+  resolved "https://registry.yarnpkg.com/vm-browserify/-/vm-browserify-0.0.4.tgz#5d7ea45bbef9e4a6ff65f95438e0a87c357d5a73"
+  dependencies:
+    indexof "0.0.1"
+
+win-spawn@~2.0.0:
+  version "2.0.0"
+  resolved "https://registry.yarnpkg.com/win-spawn/-/win-spawn-2.0.0.tgz#397a29130ec98d0aa0bc86baa4621393effd0b07"
+
+window-size@0.1.0:
+  version "0.1.0"
+  resolved "https://registry.yarnpkg.com/window-size/-/window-size-0.1.0.tgz#5438cd2ea93b202efa3a19fe8887aee7c94f9c9d"
+
+wordwrap@0.0.2:
+  version "0.0.2"
+  resolved "https://registry.yarnpkg.com/wordwrap/-/wordwrap-0.0.2.tgz#b79669bb42ecb409f83d583cad52ca17eaa1643f"
+
+wordwrap@~0.0.2:
+  version "0.0.3"
+  resolved "https://registry.yarnpkg.com/wordwrap/-/wordwrap-0.0.3.tgz#a3d5da6cd5c0bc0008d37234bbaf1bed63059107"
+
+wrappy@1:
+  version "1.0.2"
+  resolved "https://registry.yarnpkg.com/wrappy/-/wrappy-1.0.2.tgz#b5243d8f3ec1aa35f1364605bc0d1036e30ab69f"
+
+xhr-write-stream@~0.1.2:
+  version "0.1.2"
+  resolved "https://registry.yarnpkg.com/xhr-write-stream/-/xhr-write-stream-0.1.2.tgz#e357848e0d039b411fdd5b3bf81be47ee5ce26aa"
+  dependencies:
+    concat-stream "~0.1.0"
+    ordered-emitter "~0.1.0"
+
+"xtend@>=4.0.0 <4.1.0-0", xtend@^4.0.0, xtend@^4.0.1:
+  version "4.0.1"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-4.0.1.tgz#a5c6d532be656e23db820efb943a1f04998d63af"
+
+xtend@^3.0.0, xtend@~3.0.0:
+  version "3.0.0"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-3.0.0.tgz#5cce7407baf642cba7becda568111c493f59665a"
+
+xtend@~2.1.1:
+  version "2.1.2"
+  resolved "https://registry.yarnpkg.com/xtend/-/xtend-2.1.2.tgz#6efecc2a4dad8e6962c4901b337ce7ba87b5d28b"
+  dependencies:
+    object-keys "~0.4.0"
+
+yargs@~3.5.4:
+  version "3.5.4"
+  resolved "https://registry.yarnpkg.com/yargs/-/yargs-3.5.4.tgz#d8aff8f665e94c34bd259bdebd1bfaf0ddd35361"
+  dependencies:
+    camelcase "^1.0.2"
+    decamelize "^1.0.0"
+    window-size "0.1.0"
+    wordwrap "0.0.2"
diff --git a/node_modules/tslib/CopyrightNotice.txt b/node_modules/tslib/CopyrightNotice.txt
new file mode 100644
index 0000000..0e42542
--- /dev/null
+++ b/node_modules/tslib/CopyrightNotice.txt
@@ -0,0 +1,15 @@
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+
diff --git a/node_modules/tslib/LICENSE.txt b/node_modules/tslib/LICENSE.txt
new file mode 100644
index 0000000..bfe6430
--- /dev/null
+++ b/node_modules/tslib/LICENSE.txt
@@ -0,0 +1,12 @@
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
\ No newline at end of file
diff --git a/node_modules/tslib/README.md b/node_modules/tslib/README.md
new file mode 100644
index 0000000..290cc61
--- /dev/null
+++ b/node_modules/tslib/README.md
@@ -0,0 +1,164 @@
+# tslib
+
+This is a runtime library for [TypeScript](https://www.typescriptlang.org/) that contains all of the TypeScript helper functions.
+
+This library is primarily used by the `--importHelpers` flag in TypeScript.
+When using `--importHelpers`, a module that uses helper functions like `__extends` and `__assign` in the following emitted file:
+
+```ts
+var __assign = (this && this.__assign) || Object.assign || function(t) {
+    for (var s, i = 1, n = arguments.length; i < n; i++) {
+        s = arguments[i];
+        for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+            t[p] = s[p];
+    }
+    return t;
+};
+exports.x = {};
+exports.y = __assign({}, exports.x);
+
+```
+
+will instead be emitted as something like the following:
+
+```ts
+var tslib_1 = require("tslib");
+exports.x = {};
+exports.y = tslib_1.__assign({}, exports.x);
+```
+
+Because this can avoid duplicate declarations of things like `__extends`, `__assign`, etc., this means delivering users smaller files on average, as well as less runtime overhead.
+For optimized bundles with TypeScript, you should absolutely consider using `tslib` and `--importHelpers`.
+
+# Installing
+
+For the latest stable version, run:
+
+## npm
+
+```sh
+# TypeScript 3.9.2 or later
+npm install tslib
+
+# TypeScript 3.8.4 or earlier
+npm install tslib@^1
+
+# TypeScript 2.3.2 or earlier
+npm install tslib@1.6.1
+```
+
+## yarn
+
+```sh
+# TypeScript 3.9.2 or later
+yarn add tslib
+
+# TypeScript 3.8.4 or earlier
+yarn add tslib@^1
+
+# TypeScript 2.3.2 or earlier
+yarn add tslib@1.6.1
+```
+
+## bower
+
+```sh
+# TypeScript 3.9.2 or later
+bower install tslib
+
+# TypeScript 3.8.4 or earlier
+bower install tslib@^1
+
+# TypeScript 2.3.2 or earlier
+bower install tslib@1.6.1
+```
+
+## JSPM
+
+```sh
+# TypeScript 3.9.2 or later
+jspm install tslib
+
+# TypeScript 3.8.4 or earlier
+jspm install tslib@^1
+
+# TypeScript 2.3.2 or earlier
+jspm install tslib@1.6.1
+```
+
+# Usage
+
+Set the `importHelpers` compiler option on the command line:
+
+```
+tsc --importHelpers file.ts
+```
+
+or in your tsconfig.json:
+
+```json
+{
+    "compilerOptions": {
+        "importHelpers": true
+    }
+}
+```
+
+#### For bower and JSPM users
+
+You will need to add a `paths` mapping for `tslib`, e.g. For Bower users:
+
+```json
+{
+    "compilerOptions": {
+        "module": "amd",
+        "importHelpers": true,
+        "baseUrl": "./",
+        "paths": {
+            "tslib" : ["bower_components/tslib/tslib.d.ts"]
+        }
+    }
+}
+```
+
+For JSPM users:
+
+```json
+{
+    "compilerOptions": {
+        "module": "system",
+        "importHelpers": true,
+        "baseUrl": "./",
+        "paths": {
+            "tslib" : ["jspm_packages/npm/tslib@2.x.y/tslib.d.ts"]
+        }
+    }
+}
+```
+
+## Deployment
+
+- Choose your new version number
+- Set it in `package.json` and `bower.json`
+- Create a tag: `git tag [version]`
+- Push the tag: `git push --tags`
+- Create a [release in GitHub](https://github.com/microsoft/tslib/releases)
+- Run the [publish to npm](https://github.com/microsoft/tslib/actions?query=workflow%3A%22Publish+to+NPM%22) workflow
+
+Done.
+
+# Contribute
+
+There are many ways to [contribute](https://github.com/Microsoft/TypeScript/blob/master/CONTRIBUTING.md) to TypeScript.
+
+* [Submit bugs](https://github.com/Microsoft/TypeScript/issues) and help us verify fixes as they are checked in.
+* Review the [source code changes](https://github.com/Microsoft/TypeScript/pulls).
+* Engage with other TypeScript users and developers on [StackOverflow](http://stackoverflow.com/questions/tagged/typescript).
+* Join the [#typescript](http://twitter.com/#!/search/realtime/%23typescript) discussion on Twitter.
+* [Contribute bug fixes](https://github.com/Microsoft/TypeScript/blob/master/CONTRIBUTING.md).
+
+# Documentation
+
+* [Quick tutorial](http://www.typescriptlang.org/Tutorial)
+* [Programming handbook](http://www.typescriptlang.org/Handbook)
+* [Homepage](http://www.typescriptlang.org/)
diff --git a/node_modules/tslib/SECURITY.md b/node_modules/tslib/SECURITY.md
new file mode 100644
index 0000000..869fdfe
--- /dev/null
+++ b/node_modules/tslib/SECURITY.md
@@ -0,0 +1,41 @@
+<!-- BEGIN MICROSOFT SECURITY.MD V0.0.7 BLOCK -->
+
+## Security
+
+Microsoft takes the security of our software products and services seriously, which includes all source code repositories managed through our GitHub organizations, which include [Microsoft](https://github.com/Microsoft), [Azure](https://github.com/Azure), [DotNet](https://github.com/dotnet), [AspNet](https://github.com/aspnet), [Xamarin](https://github.com/xamarin), and [our GitHub organizations](https://opensource.microsoft.com/).
+
+If you believe you have found a security vulnerability in any Microsoft-owned repository that meets [Microsoft's definition of a security vulnerability](https://aka.ms/opensource/security/definition), please report it to us as described below.
+
+## Reporting Security Issues
+
+**Please do not report security vulnerabilities through public GitHub issues.**
+
+Instead, please report them to the Microsoft Security Response Center (MSRC) at [https://msrc.microsoft.com/create-report](https://aka.ms/opensource/security/create-report).
+
+If you prefer to submit without logging in, send email to [secure@microsoft.com](mailto:secure@microsoft.com).  If possible, encrypt your message with our PGP key; please download it from the [Microsoft Security Response Center PGP Key page](https://aka.ms/opensource/security/pgpkey).
+
+You should receive a response within 24 hours. If for some reason you do not, please follow up via email to ensure we received your original message. Additional information can be found at [microsoft.com/msrc](https://aka.ms/opensource/security/msrc). 
+
+Please include the requested information listed below (as much as you can provide) to help us better understand the nature and scope of the possible issue:
+
+  * Type of issue (e.g. buffer overflow, SQL injection, cross-site scripting, etc.)
+  * Full paths of source file(s) related to the manifestation of the issue
+  * The location of the affected source code (tag/branch/commit or direct URL)
+  * Any special configuration required to reproduce the issue
+  * Step-by-step instructions to reproduce the issue
+  * Proof-of-concept or exploit code (if possible)
+  * Impact of the issue, including how an attacker might exploit the issue
+
+This information will help us triage your report more quickly.
+
+If you are reporting for a bug bounty, more complete reports can contribute to a higher bounty award. Please visit our [Microsoft Bug Bounty Program](https://aka.ms/opensource/security/bounty) page for more details about our active programs.
+
+## Preferred Languages
+
+We prefer all communications to be in English.
+
+## Policy
+
+Microsoft follows the principle of [Coordinated Vulnerability Disclosure](https://aka.ms/opensource/security/cvd).
+
+<!-- END MICROSOFT SECURITY.MD BLOCK -->
diff --git a/node_modules/tslib/modules/index.d.ts b/node_modules/tslib/modules/index.d.ts
new file mode 100644
index 0000000..3244fab
--- /dev/null
+++ b/node_modules/tslib/modules/index.d.ts
@@ -0,0 +1,38 @@
+// Note: named reexports are used instead of `export *` because
+// TypeScript itself doesn't resolve the `export *` when checking
+// if a particular helper exists.
+export {
+  __extends,
+  __assign,
+  __rest,
+  __decorate,
+  __param,
+  __esDecorate,
+  __runInitializers,
+  __propKey,
+  __setFunctionName,
+  __metadata,
+  __awaiter,
+  __generator,
+  __exportStar,
+  __values,
+  __read,
+  __spread,
+  __spreadArrays,
+  __spreadArray,
+  __await,
+  __asyncGenerator,
+  __asyncDelegator,
+  __asyncValues,
+  __makeTemplateObject,
+  __importStar,
+  __importDefault,
+  __classPrivateFieldGet,
+  __classPrivateFieldSet,
+  __classPrivateFieldIn,
+  __createBinding,
+  __addDisposableResource,
+  __disposeResources,
+  __rewriteRelativeImportExtension,
+} from '../tslib.js';
+export * as default from '../tslib.js';
diff --git a/node_modules/tslib/modules/index.js b/node_modules/tslib/modules/index.js
new file mode 100644
index 0000000..c91f618
--- /dev/null
+++ b/node_modules/tslib/modules/index.js
@@ -0,0 +1,70 @@
+import tslib from '../tslib.js';
+const {
+    __extends,
+    __assign,
+    __rest,
+    __decorate,
+    __param,
+    __esDecorate,
+    __runInitializers,
+    __propKey,
+    __setFunctionName,
+    __metadata,
+    __awaiter,
+    __generator,
+    __exportStar,
+    __createBinding,
+    __values,
+    __read,
+    __spread,
+    __spreadArrays,
+    __spreadArray,
+    __await,
+    __asyncGenerator,
+    __asyncDelegator,
+    __asyncValues,
+    __makeTemplateObject,
+    __importStar,
+    __importDefault,
+    __classPrivateFieldGet,
+    __classPrivateFieldSet,
+    __classPrivateFieldIn,
+    __addDisposableResource,
+    __disposeResources,
+    __rewriteRelativeImportExtension,
+} = tslib;
+export {
+    __extends,
+    __assign,
+    __rest,
+    __decorate,
+    __param,
+    __esDecorate,
+    __runInitializers,
+    __propKey,
+    __setFunctionName,
+    __metadata,
+    __awaiter,
+    __generator,
+    __exportStar,
+    __createBinding,
+    __values,
+    __read,
+    __spread,
+    __spreadArrays,
+    __spreadArray,
+    __await,
+    __asyncGenerator,
+    __asyncDelegator,
+    __asyncValues,
+    __makeTemplateObject,
+    __importStar,
+    __importDefault,
+    __classPrivateFieldGet,
+    __classPrivateFieldSet,
+    __classPrivateFieldIn,
+    __addDisposableResource,
+    __disposeResources,
+    __rewriteRelativeImportExtension,
+};
+export default tslib;
diff --git a/node_modules/tslib/modules/package.json b/node_modules/tslib/modules/package.json
new file mode 100644
index 0000000..aafa0e4
--- /dev/null
+++ b/node_modules/tslib/modules/package.json
@@ -0,0 +1,3 @@
+{
+    "type": "module"
+}
\ No newline at end of file
diff --git a/node_modules/tslib/package.json b/node_modules/tslib/package.json
new file mode 100644
index 0000000..57d0578
--- /dev/null
+++ b/node_modules/tslib/package.json
@@ -0,0 +1,47 @@
+{
+    "name": "tslib",
+    "author": "Microsoft Corp.",
+    "homepage": "https://www.typescriptlang.org/",
+    "version": "2.8.1",
+    "license": "0BSD",
+    "description": "Runtime library for TypeScript helper functions",
+    "keywords": [
+        "TypeScript",
+        "Microsoft",
+        "compiler",
+        "language",
+        "javascript",
+        "tslib",
+        "runtime"
+    ],
+    "bugs": {
+        "url": "https://github.com/Microsoft/TypeScript/issues"
+    },
+    "repository": {
+        "type": "git",
+        "url": "https://github.com/Microsoft/tslib.git"
+    },
+    "main": "tslib.js",
+    "module": "tslib.es6.js",
+    "jsnext:main": "tslib.es6.js",
+    "typings": "tslib.d.ts",
+    "sideEffects": false,
+    "exports": {
+        ".": {
+            "module": {
+                "types": "./modules/index.d.ts",
+                "default": "./tslib.es6.mjs"
+            },
+            "import": {
+                "node": "./modules/index.js",
+                "default": {
+                    "types": "./modules/index.d.ts",
+                    "default": "./tslib.es6.mjs"
+                }
+            },
+            "default": "./tslib.js"
+        },
+        "./*": "./*",
+        "./": "./"
+    }
+}
diff --git a/node_modules/tslib/tslib.d.ts b/node_modules/tslib/tslib.d.ts
new file mode 100644
index 0000000..f23df55
--- /dev/null
+++ b/node_modules/tslib/tslib.d.ts
@@ -0,0 +1,460 @@
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+
+/**
+ * Used to shim class extends.
+ *
+ * @param d The derived class.
+ * @param b The base class.
+ */
+export declare function __extends(d: Function, b: Function): void;
+
+/**
+ * Copy the values of all of the enumerable own properties from one or more source objects to a
+ * target object. Returns the target object.
+ *
+ * @param t The target object to copy to.
+ * @param sources One or more source objects from which to copy properties
+ */
+export declare function __assign(t: any, ...sources: any[]): any;
+
+/**
+ * Performs a rest spread on an object.
+ *
+ * @param t The source value.
+ * @param propertyNames The property names excluded from the rest spread.
+ */
+export declare function __rest(t: any, propertyNames: (string | symbol)[]): any;
+
+/**
+ * Applies decorators to a target object
+ *
+ * @param decorators The set of decorators to apply.
+ * @param target The target object.
+ * @param key If specified, the own property to apply the decorators to.
+ * @param desc The property descriptor, defaults to fetching the descriptor from the target object.
+ * @experimental
+ */
+export declare function __decorate(decorators: Function[], target: any, key?: string | symbol, desc?: any): any;
+
+/**
+ * Creates an observing function decorator from a parameter decorator.
+ *
+ * @param paramIndex The parameter index to apply the decorator to.
+ * @param decorator The parameter decorator to apply. Note that the return value is ignored.
+ * @experimental
+ */
+export declare function __param(paramIndex: number, decorator: Function): Function;
+
+/**
+ * Applies decorators to a class or class member, following the native ECMAScript decorator specification.
+ * @param ctor For non-field class members, the class constructor. Otherwise, `null`.
+ * @param descriptorIn The `PropertyDescriptor` to use when unable to look up the property from `ctor`.
+ * @param decorators The decorators to apply
+ * @param contextIn The `DecoratorContext` to clone for each decorator application.
+ * @param initializers An array of field initializer mutation functions into which new initializers are written.
+ * @param extraInitializers An array of extra initializer functions into which new initializers are written.
+ */
+export declare function __esDecorate(ctor: Function | null, descriptorIn: object | null, decorators: Function[], contextIn: object, initializers: Function[] | null, extraInitializers: Function[]): void;
+
+/**
+ * Runs field initializers or extra initializers generated by `__esDecorate`.
+ * @param thisArg The `this` argument to use.
+ * @param initializers The array of initializers to evaluate.
+ * @param value The initial value to pass to the initializers.
+ */
+export declare function __runInitializers(thisArg: unknown, initializers: Function[], value?: any): any;
+
+/**
+ * Converts a computed property name into a `string` or `symbol` value.
+ */
+export declare function __propKey(x: any): string | symbol;
+
+/**
+ * Assigns the name of a function derived from the left-hand side of an assignment.
+ * @param f The function to rename.
+ * @param name The new name for the function.
+ * @param prefix A prefix (such as `"get"` or `"set"`) to insert before the name.
+ */
+export declare function __setFunctionName(f: Function, name: string | symbol, prefix?: string): Function;
+
+/**
+ * Creates a decorator that sets metadata.
+ *
+ * @param metadataKey The metadata key
+ * @param metadataValue The metadata value
+ * @experimental
+ */
+export declare function __metadata(metadataKey: any, metadataValue: any): Function;
+
+/**
+ * Converts a generator function into a pseudo-async function, by treating each `yield` as an `await`.
+ *
+ * @param thisArg The reference to use as the `this` value in the generator function
+ * @param _arguments The optional arguments array
+ * @param P The optional promise constructor argument, defaults to the `Promise` property of the global object.
+ * @param generator The generator function
+ */
+export declare function __awaiter(thisArg: any, _arguments: any, P: Function, generator: Function): any;
+
+/**
+ * Creates an Iterator object using the body as the implementation.
+ *
+ * @param thisArg The reference to use as the `this` value in the function
+ * @param body The generator state-machine based implementation.
+ *
+ * @see [./docs/generator.md]
+ */
+export declare function __generator(thisArg: any, body: Function): any;
+
+/**
+ * Creates bindings for all enumerable properties of `m` on `exports`
+ *
+ * @param m The source object
+ * @param o The `exports` object.
+ */
+export declare function __exportStar(m: any, o: any): void;
+
+/**
+ * Creates a value iterator from an `Iterable` or `ArrayLike` object.
+ *
+ * @param o The object.
+ * @throws {TypeError} If `o` is neither `Iterable`, nor an `ArrayLike`.
+ */
+export declare function __values(o: any): any;
+
+/**
+ * Reads values from an `Iterable` or `ArrayLike` object and returns the resulting array.
+ *
+ * @param o The object to read from.
+ * @param n The maximum number of arguments to read, defaults to `Infinity`.
+ */
+export declare function __read(o: any, n?: number): any[];
+
+/**
+ * Creates an array from iterable spread.
+ *
+ * @param args The Iterable objects to spread.
+ * @deprecated since TypeScript 4.2 - Use `__spreadArray`
+ */
+export declare function __spread(...args: any[][]): any[];
+
+/**
+ * Creates an array from array spread.
+ *
+ * @param args The ArrayLikes to spread into the resulting array.
+ * @deprecated since TypeScript 4.2 - Use `__spreadArray`
+ */
+export declare function __spreadArrays(...args: any[][]): any[];
+
+/**
+ * Spreads the `from` array into the `to` array.
+ *
+ * @param pack Replace empty elements with `undefined`.
+ */
+export declare function __spreadArray(to: any[], from: any[], pack?: boolean): any[];
+
+/**
+ * Creates an object that signals to `__asyncGenerator` that it shouldn't be yielded,
+ * and instead should be awaited and the resulting value passed back to the generator.
+ *
+ * @param v The value to await.
+ */
+export declare function __await(v: any): any;
+
+/**
+ * Converts a generator function into an async generator function, by using `yield __await`
+ * in place of normal `await`.
+ *
+ * @param thisArg The reference to use as the `this` value in the generator function
+ * @param _arguments The optional arguments array
+ * @param generator The generator function
+ */
+export declare function __asyncGenerator(thisArg: any, _arguments: any, generator: Function): any;
+
+/**
+ * Used to wrap a potentially async iterator in such a way so that it wraps the result
+ * of calling iterator methods of `o` in `__await` instances, and then yields the awaited values.
+ *
+ * @param o The potentially async iterator.
+ * @returns A synchronous iterator yielding `__await` instances on every odd invocation
+ *          and returning the awaited `IteratorResult` passed to `next` every even invocation.
+ */
+export declare function __asyncDelegator(o: any): any;
+
+/**
+ * Creates a value async iterator from an `AsyncIterable`, `Iterable` or `ArrayLike` object.
+ *
+ * @param o The object.
+ * @throws {TypeError} If `o` is neither `AsyncIterable`, `Iterable`, nor an `ArrayLike`.
+ */
+export declare function __asyncValues(o: any): any;
+
+/**
+ * Creates a `TemplateStringsArray` frozen object from the `cooked` and `raw` arrays.
+ *
+ * @param cooked The cooked possibly-sparse array.
+ * @param raw The raw string content.
+ */
+export declare function __makeTemplateObject(cooked: string[], raw: string[]): TemplateStringsArray;
+
+/**
+ * Used to shim default and named imports in ECMAScript Modules transpiled to CommonJS.
+ *
+ * ```js
+ * import Default, { Named, Other } from "mod";
+ * // or
+ * import { default as Default, Named, Other } from "mod";
+ * ```
+ *
+ * @param mod The CommonJS module exports object.
+ */
+export declare function __importStar<T>(mod: T): T;
+
+/**
+ * Used to shim default imports in ECMAScript Modules transpiled to CommonJS.
+ *
+ * ```js
+ * import Default from "mod";
+ * ```
+ *
+ * @param mod The CommonJS module exports object.
+ */
+export declare function __importDefault<T>(mod: T): T | { default: T };
+
+/**
+ * Emulates reading a private instance field.
+ *
+ * @param receiver The instance from which to read the private field.
+ * @param state A WeakMap containing the private field value for an instance.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ *
+ * @throws {TypeError} If `state` doesn't have an entry for `receiver`.
+ */
+export declare function __classPrivateFieldGet<T extends object, V>(
+    receiver: T,
+    state: { has(o: T): boolean, get(o: T): V | undefined },
+    kind?: "f"
+): V;
+
+/**
+ * Emulates reading a private static field.
+ *
+ * @param receiver The object from which to read the private static field.
+ * @param state The class constructor containing the definition of the static field.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The descriptor that holds the static field value.
+ *
+ * @throws {TypeError} If `receiver` is not `state`.
+ */
+export declare function __classPrivateFieldGet<T extends new (...args: any[]) => unknown, V>(
+    receiver: T,
+    state: T,
+    kind: "f",
+    f: { value: V }
+): V;
+
+/**
+ * Emulates evaluating a private instance "get" accessor.
+ *
+ * @param receiver The instance on which to evaluate the private "get" accessor.
+ * @param state A WeakSet used to verify an instance supports the private "get" accessor.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The "get" accessor function to evaluate.
+ *
+ * @throws {TypeError} If `state` doesn't have an entry for `receiver`.
+ */
+export declare function __classPrivateFieldGet<T extends object, V>(
+    receiver: T,
+    state: { has(o: T): boolean },
+    kind: "a",
+    f: () => V
+): V;
+
+/**
+ * Emulates evaluating a private static "get" accessor.
+ *
+ * @param receiver The object on which to evaluate the private static "get" accessor.
+ * @param state The class constructor containing the definition of the static "get" accessor.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The "get" accessor function to evaluate.
+ *
+ * @throws {TypeError} If `receiver` is not `state`.
+ */
+export declare function __classPrivateFieldGet<T extends new (...args: any[]) => unknown, V>(
+    receiver: T,
+    state: T,
+    kind: "a",
+    f: () => V
+): V;
+
+/**
+ * Emulates reading a private instance method.
+ *
+ * @param receiver The instance from which to read a private method.
+ * @param state A WeakSet used to verify an instance supports the private method.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The function to return as the private instance method.
+ *
+ * @throws {TypeError} If `state` doesn't have an entry for `receiver`.
+ */
+export declare function __classPrivateFieldGet<T extends object, V extends (...args: any[]) => unknown>(
+    receiver: T,
+    state: { has(o: T): boolean },
+    kind: "m",
+    f: V
+): V;
+
+/**
+ * Emulates reading a private static method.
+ *
+ * @param receiver The object from which to read the private static method.
+ * @param state The class constructor containing the definition of the static method.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The function to return as the private static method.
+ *
+ * @throws {TypeError} If `receiver` is not `state`.
+ */
+export declare function __classPrivateFieldGet<T extends new (...args: any[]) => unknown, V extends (...args: any[]) => unknown>(
+    receiver: T,
+    state: T,
+    kind: "m",
+    f: V
+): V;
+
+/**
+ * Emulates writing to a private instance field.
+ *
+ * @param receiver The instance on which to set a private field value.
+ * @param state A WeakMap used to store the private field value for an instance.
+ * @param value The value to store in the private field.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ *
+ * @throws {TypeError} If `state` doesn't have an entry for `receiver`.
+ */
+export declare function __classPrivateFieldSet<T extends object, V>(
+    receiver: T,
+    state: { has(o: T): boolean, set(o: T, value: V): unknown },
+    value: V,
+    kind?: "f"
+): V;
+
+/**
+ * Emulates writing to a private static field.
+ *
+ * @param receiver The object on which to set the private static field.
+ * @param state The class constructor containing the definition of the private static field.
+ * @param value The value to store in the private field.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The descriptor that holds the static field value.
+ *
+ * @throws {TypeError} If `receiver` is not `state`.
+ */
+export declare function __classPrivateFieldSet<T extends new (...args: any[]) => unknown, V>(
+    receiver: T,
+    state: T,
+    value: V,
+    kind: "f",
+    f: { value: V }
+): V;
+
+/**
+ * Emulates writing to a private instance "set" accessor.
+ *
+ * @param receiver The instance on which to evaluate the private instance "set" accessor.
+ * @param state A WeakSet used to verify an instance supports the private "set" accessor.
+ * @param value The value to store in the private accessor.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The "set" accessor function to evaluate.
+ *
+ * @throws {TypeError} If `state` doesn't have an entry for `receiver`.
+ */
+export declare function __classPrivateFieldSet<T extends object, V>(
+    receiver: T,
+    state: { has(o: T): boolean },
+    value: V,
+    kind: "a",
+    f: (v: V) => void
+): V;
+
+/**
+ * Emulates writing to a private static "set" accessor.
+ *
+ * @param receiver The object on which to evaluate the private static "set" accessor.
+ * @param state The class constructor containing the definition of the static "set" accessor.
+ * @param value The value to store in the private field.
+ * @param kind Either `"f"` for a field, `"a"` for an accessor, or `"m"` for a method.
+ * @param f The "set" accessor function to evaluate.
+ *
+ * @throws {TypeError} If `receiver` is not `state`.
+ */
+export declare function __classPrivateFieldSet<T extends new (...args: any[]) => unknown, V>(
+    receiver: T,
+    state: T,
+    value: V,
+    kind: "a",
+    f: (v: V) => void
+): V;
+
+/**
+ * Checks for the existence of a private field/method/accessor.
+ *
+ * @param state The class constructor containing the static member, or the WeakMap or WeakSet associated with a private instance member.
+ * @param receiver The object for which to test the presence of the private member.
+ */
+export declare function __classPrivateFieldIn(
+    state: (new (...args: any[]) => unknown) | { has(o: any): boolean },
+    receiver: unknown,
+): boolean;
+
+/**
+ * Creates a re-export binding on `object` with key `objectKey` that references `target[key]`.
+ *
+ * @param object The local `exports` object.
+ * @param target The object to re-export from.
+ * @param key The property key of `target` to re-export.
+ * @param objectKey The property key to re-export as. Defaults to `key`.
+ */
+export declare function __createBinding(object: object, target: object, key: PropertyKey, objectKey?: PropertyKey): void;
+
+/**
+ * Adds a disposable resource to a resource-tracking environment object.
+ * @param env A resource-tracking environment object.
+ * @param value Either a Disposable or AsyncDisposable object, `null`, or `undefined`.
+ * @param async When `true`, `AsyncDisposable` resources can be added. When `false`, `AsyncDisposable` resources cannot be added.
+ * @returns The {@link value} argument.
+ *
+ * @throws {TypeError} If {@link value} is not an object, or if either `Symbol.dispose` or `Symbol.asyncDispose` are not
+ * defined, or if {@link value} does not have an appropriate `Symbol.dispose` or `Symbol.asyncDispose` method.
+ */
+export declare function __addDisposableResource<T>(env: { stack: { value?: unknown, dispose?: Function, async: boolean }[]; error: unknown; hasError: boolean; }, value: T, async: boolean): T;
+
+/**
+ * Disposes all resources in a resource-tracking environment object.
+ * @param env A resource-tracking environment object.
+ * @returns A {@link Promise} if any resources in the environment were marked as `async` when added; otherwise, `void`.
+ *
+ * @throws {SuppressedError} if an error thrown during disposal would have suppressed a prior error from disposal or the
+ * error recorded in the resource-tracking environment object.
+ * @seealso {@link __addDisposableResource}
+ */
+export declare function __disposeResources(env: { stack: { value?: unknown, dispose?: Function, async: boolean }[]; error: unknown; hasError: boolean; }): any;
+
+/**
+ * Transforms a relative import specifier ending in a non-declaration TypeScript file extension to its JavaScript file extension counterpart.
+ * @param path The import specifier.
+ * @param preserveJsx Causes '*.tsx' to transform to '*.jsx' instead of '*.js'. Should be true when `--jsx` is set to `preserve`.
+ */
+export declare function __rewriteRelativeImportExtension(path: string, preserveJsx?: boolean): string;
\ No newline at end of file
diff --git a/node_modules/tslib/tslib.es6.html b/node_modules/tslib/tslib.es6.html
new file mode 100644
index 0000000..b122e41
--- /dev/null
+++ b/node_modules/tslib/tslib.es6.html
@@ -0,0 +1 @@
+<script src="tslib.es6.js"></script>
\ No newline at end of file
diff --git a/node_modules/tslib/tslib.es6.js b/node_modules/tslib/tslib.es6.js
new file mode 100644
index 0000000..6c1739b
--- /dev/null
+++ b/node_modules/tslib/tslib.es6.js
@@ -0,0 +1,402 @@
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
+
+var extendStatics = function(d, b) {
+    extendStatics = Object.setPrototypeOf ||
+        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+    return extendStatics(d, b);
+};
+
+export function __extends(d, b) {
+    if (typeof b !== "function" && b !== null)
+        throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+    extendStatics(d, b);
+    function __() { this.constructor = d; }
+    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+}
+
+export var __assign = function() {
+    __assign = Object.assign || function __assign(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
+        }
+        return t;
+    }
+    return __assign.apply(this, arguments);
+}
+
+export function __rest(s, e) {
+    var t = {};
+    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
+        t[p] = s[p];
+    if (s != null && typeof Object.getOwnPropertySymbols === "function")
+        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
+                t[p[i]] = s[p[i]];
+        }
+    return t;
+}
+
+export function __decorate(decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+}
+
+export function __param(paramIndex, decorator) {
+    return function (target, key) { decorator(target, key, paramIndex); }
+}
+
+export function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+    function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+    var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+    var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+    var _, done = false;
+    for (var i = decorators.length - 1; i >= 0; i--) {
+        var context = {};
+        for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+        for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+        context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+        var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+        if (kind === "accessor") {
+            if (result === void 0) continue;
+            if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+            if (_ = accept(result.get)) descriptor.get = _;
+            if (_ = accept(result.set)) descriptor.set = _;
+            if (_ = accept(result.init)) initializers.unshift(_);
+        }
+        else if (_ = accept(result)) {
+            if (kind === "field") initializers.unshift(_);
+            else descriptor[key] = _;
+        }
+    }
+    if (target) Object.defineProperty(target, contextIn.name, descriptor);
+    done = true;
+};
+
+export function __runInitializers(thisArg, initializers, value) {
+    var useValue = arguments.length > 2;
+    for (var i = 0; i < initializers.length; i++) {
+        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+    }
+    return useValue ? value : void 0;
+};
+
+export function __propKey(x) {
+    return typeof x === "symbol" ? x : "".concat(x);
+};
+
+export function __setFunctionName(f, name, prefix) {
+    if (typeof name === "symbol") name = name.description ? "[".concat(name.description, "]") : "";
+    return Object.defineProperty(f, "name", { configurable: true, value: prefix ? "".concat(prefix, " ", name) : name });
+};
+
+export function __metadata(metadataKey, metadataValue) {
+    if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(metadataKey, metadataValue);
+}
+
+export function __awaiter(thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+}
+
+export function __generator(thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+    return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            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;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+}
+
+export var __createBinding = Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+        desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+});
+
+export function __exportStar(m, o) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);
+}
+
+export function __values(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+}
+
+export function __read(o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+}
+
+/** @deprecated */
+export function __spread() {
+    for (var ar = [], i = 0; i < arguments.length; i++)
+        ar = ar.concat(__read(arguments[i]));
+    return ar;
+}
+
+/** @deprecated */
+export function __spreadArrays() {
+    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;
+    for (var r = Array(s), k = 0, i = 0; i < il; i++)
+        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)
+            r[k] = a[j];
+    return r;
+}
+
+export function __spreadArray(to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+}
+
+export function __await(v) {
+    return this instanceof __await ? (this.v = v, this) : new __await(v);
+}
+
+export function __asyncGenerator(thisArg, _arguments, generator) {
+    if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+    var g = generator.apply(thisArg, _arguments || []), i, q = [];
+    return i = Object.create((typeof AsyncIterator === "function" ? AsyncIterator : Object).prototype), verb("next"), verb("throw"), verb("return", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;
+    function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }
+    function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }
+    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
+    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
+    function fulfill(value) { resume("next", value); }
+    function reject(value) { resume("throw", value); }
+    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
+}
+
+export function __asyncDelegator(o) {
+    var i, p;
+    return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
+    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }
+}
+
+export function __asyncValues(o) {
+    if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+    var m = o[Symbol.asyncIterator], i;
+    return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
+    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
+    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
+}
+
+export function __makeTemplateObject(cooked, raw) {
+    if (Object.defineProperty) { Object.defineProperty(cooked, "raw", { value: raw }); } else { cooked.raw = raw; }
+    return cooked;
+};
+
+var __setModuleDefault = Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+};
+
+var ownKeys = function(o) {
+    ownKeys = Object.getOwnPropertyNames || function (o) {
+        var ar = [];
+        for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+        return ar;
+    };
+    return ownKeys(o);
+};
+
+export function __importStar(mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+    __setModuleDefault(result, mod);
+    return result;
+}
+
+export function __importDefault(mod) {
+    return (mod && mod.__esModule) ? mod : { default: mod };
+}
+
+export function __classPrivateFieldGet(receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+}
+
+export function __classPrivateFieldSet(receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+}
+
+export function __classPrivateFieldIn(state, receiver) {
+    if (receiver === null || (typeof receiver !== "object" && typeof receiver !== "function")) throw new TypeError("Cannot use 'in' operator on non-object");
+    return typeof state === "function" ? receiver === state : state.has(receiver);
+}
+
+export function __addDisposableResource(env, value, async) {
+    if (value !== null && value !== void 0) {
+        if (typeof value !== "object" && typeof value !== "function") throw new TypeError("Object expected.");
+        var dispose, inner;
+        if (async) {
+            if (!Symbol.asyncDispose) throw new TypeError("Symbol.asyncDispose is not defined.");
+            dispose = value[Symbol.asyncDispose];
+        }
+        if (dispose === void 0) {
+            if (!Symbol.dispose) throw new TypeError("Symbol.dispose is not defined.");
+            dispose = value[Symbol.dispose];
+            if (async) inner = dispose;
+        }
+        if (typeof dispose !== "function") throw new TypeError("Object not disposable.");
+        if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };
+        env.stack.push({ value: value, dispose: dispose, async: async });
+    }
+    else if (async) {
+        env.stack.push({ async: true });
+    }
+    return value;
+
+}
+
+var _SuppressedError = typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+    var e = new Error(message);
+    return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+};
+
+export function __disposeResources(env) {
+    function fail(e) {
+        env.error = env.hasError ? new _SuppressedError(e, env.error, "An error was suppressed during disposal.") : e;
+        env.hasError = true;
+    }
+    var r, s = 0;
+    function next() {
+        while (r = env.stack.pop()) {
+            try {
+                if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);
+                if (r.dispose) {
+                    var result = r.dispose.call(r.value);
+                    if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });
+                }
+                else s |= 1;
+            }
+            catch (e) {
+                fail(e);
+            }
+        }
+        if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();
+        if (env.hasError) throw env.error;
+    }
+    return next();
+}
+
+export function __rewriteRelativeImportExtension(path, preserveJsx) {
+    if (typeof path === "string" && /^\.\.?\//.test(path)) {
+        return path.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+?)?)\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {
+            return tsx ? preserveJsx ? ".jsx" : ".js" : d && (!ext || !cm) ? m : (d + ext + "." + cm.toLowerCase() + "js");
+        });
+    }
+    return path;
+}
+
+export default {
+    __extends: __extends,
+    __assign: __assign,
+    __rest: __rest,
+    __decorate: __decorate,
+    __param: __param,
+    __esDecorate: __esDecorate,
+    __runInitializers: __runInitializers,
+    __propKey: __propKey,
+    __setFunctionName: __setFunctionName,
+    __metadata: __metadata,
+    __awaiter: __awaiter,
+    __generator: __generator,
+    __createBinding: __createBinding,
+    __exportStar: __exportStar,
+    __values: __values,
+    __read: __read,
+    __spread: __spread,
+    __spreadArrays: __spreadArrays,
+    __spreadArray: __spreadArray,
+    __await: __await,
+    __asyncGenerator: __asyncGenerator,
+    __asyncDelegator: __asyncDelegator,
+    __asyncValues: __asyncValues,
+    __makeTemplateObject: __makeTemplateObject,
+    __importStar: __importStar,
+    __importDefault: __importDefault,
+    __classPrivateFieldGet: __classPrivateFieldGet,
+    __classPrivateFieldSet: __classPrivateFieldSet,
+    __classPrivateFieldIn: __classPrivateFieldIn,
+    __addDisposableResource: __addDisposableResource,
+    __disposeResources: __disposeResources,
+    __rewriteRelativeImportExtension: __rewriteRelativeImportExtension,
+};
diff --git a/node_modules/tslib/tslib.es6.mjs b/node_modules/tslib/tslib.es6.mjs
new file mode 100644
index 0000000..c17990a
--- /dev/null
+++ b/node_modules/tslib/tslib.es6.mjs
@@ -0,0 +1,401 @@
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+/* global Reflect, Promise, SuppressedError, Symbol, Iterator */
+
+var extendStatics = function(d, b) {
+  extendStatics = Object.setPrototypeOf ||
+      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+  return extendStatics(d, b);
+};
+
+export function __extends(d, b) {
+  if (typeof b !== "function" && b !== null)
+      throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+  extendStatics(d, b);
+  function __() { this.constructor = d; }
+  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+}
+
+export var __assign = function() {
+  __assign = Object.assign || function __assign(t) {
+      for (var s, i = 1, n = arguments.length; i < n; i++) {
+          s = arguments[i];
+          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
+      }
+      return t;
+  }
+  return __assign.apply(this, arguments);
+}
+
+export function __rest(s, e) {
+  var t = {};
+  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
+      t[p] = s[p];
+  if (s != null && typeof Object.getOwnPropertySymbols === "function")
+      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
+              t[p[i]] = s[p[i]];
+      }
+  return t;
+}
+
+export function __decorate(decorators, target, key, desc) {
+  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+  if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+  return c > 3 && r && Object.defineProperty(target, key, r), r;
+}
+
+export function __param(paramIndex, decorator) {
+  return function (target, key) { decorator(target, key, paramIndex); }
+}
+
+export function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+  function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+  var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+  var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+  var _, done = false;
+  for (var i = decorators.length - 1; i >= 0; i--) {
+      var context = {};
+      for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+      for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+      context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+      var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+      if (kind === "accessor") {
+          if (result === void 0) continue;
+          if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+          if (_ = accept(result.get)) descriptor.get = _;
+          if (_ = accept(result.set)) descriptor.set = _;
+          if (_ = accept(result.init)) initializers.unshift(_);
+      }
+      else if (_ = accept(result)) {
+          if (kind === "field") initializers.unshift(_);
+          else descriptor[key] = _;
+      }
+  }
+  if (target) Object.defineProperty(target, contextIn.name, descriptor);
+  done = true;
+};
+
+export function __runInitializers(thisArg, initializers, value) {
+  var useValue = arguments.length > 2;
+  for (var i = 0; i < initializers.length; i++) {
+      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+  }
+  return useValue ? value : void 0;
+};
+
+export function __propKey(x) {
+  return typeof x === "symbol" ? x : "".concat(x);
+};
+
+export function __setFunctionName(f, name, prefix) {
+  if (typeof name === "symbol") name = name.description ? "[".concat(name.description, "]") : "";
+  return Object.defineProperty(f, "name", { configurable: true, value: prefix ? "".concat(prefix, " ", name) : name });
+};
+
+export function __metadata(metadataKey, metadataValue) {
+  if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(metadataKey, metadataValue);
+}
+
+export function __awaiter(thisArg, _arguments, P, generator) {
+  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+  return new (P || (P = Promise))(function (resolve, reject) {
+      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+      function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+      step((generator = generator.apply(thisArg, _arguments || [])).next());
+  });
+}
+
+export function __generator(thisArg, body) {
+  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+  return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+  function verb(n) { return function (v) { return step([n, v]); }; }
+  function step(op) {
+      if (f) throw new TypeError("Generator is already executing.");
+      while (g && (g = 0, op[0] && (_ = 0)), _) try {
+          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;
+          if (y = 0, t) op = [op[0] & 2, t.value];
+          switch (op[0]) {
+              case 0: case 1: t = op; break;
+              case 4: _.label++; return { value: op[1], done: false };
+              case 5: _.label++; y = op[1]; op = [0]; continue;
+              case 7: op = _.ops.pop(); _.trys.pop(); continue;
+              default:
+                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                  if (t[2]) _.ops.pop();
+                  _.trys.pop(); continue;
+          }
+          op = body.call(thisArg, _);
+      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+  }
+}
+
+export var __createBinding = Object.create ? (function(o, m, k, k2) {
+  if (k2 === undefined) k2 = k;
+  var desc = Object.getOwnPropertyDescriptor(m, k);
+  if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+  }
+  Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+  if (k2 === undefined) k2 = k;
+  o[k2] = m[k];
+});
+
+export function __exportStar(m, o) {
+  for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);
+}
+
+export function __values(o) {
+  var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+  if (m) return m.call(o);
+  if (o && typeof o.length === "number") return {
+      next: function () {
+          if (o && i >= o.length) o = void 0;
+          return { value: o && o[i++], done: !o };
+      }
+  };
+  throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+}
+
+export function __read(o, n) {
+  var m = typeof Symbol === "function" && o[Symbol.iterator];
+  if (!m) return o;
+  var i = m.call(o), r, ar = [], e;
+  try {
+      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+  }
+  catch (error) { e = { error: error }; }
+  finally {
+      try {
+          if (r && !r.done && (m = i["return"])) m.call(i);
+      }
+      finally { if (e) throw e.error; }
+  }
+  return ar;
+}
+
+/** @deprecated */
+export function __spread() {
+  for (var ar = [], i = 0; i < arguments.length; i++)
+      ar = ar.concat(__read(arguments[i]));
+  return ar;
+}
+
+/** @deprecated */
+export function __spreadArrays() {
+  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;
+  for (var r = Array(s), k = 0, i = 0; i < il; i++)
+      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)
+          r[k] = a[j];
+  return r;
+}
+
+export function __spreadArray(to, from, pack) {
+  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+      if (ar || !(i in from)) {
+          if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+          ar[i] = from[i];
+      }
+  }
+  return to.concat(ar || Array.prototype.slice.call(from));
+}
+
+export function __await(v) {
+  return this instanceof __await ? (this.v = v, this) : new __await(v);
+}
+
+export function __asyncGenerator(thisArg, _arguments, generator) {
+  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+  var g = generator.apply(thisArg, _arguments || []), i, q = [];
+  return i = Object.create((typeof AsyncIterator === "function" ? AsyncIterator : Object).prototype), verb("next"), verb("throw"), verb("return", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;
+  function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }
+  function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }
+  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
+  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
+  function fulfill(value) { resume("next", value); }
+  function reject(value) { resume("throw", value); }
+  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
+}
+
+export function __asyncDelegator(o) {
+  var i, p;
+  return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
+  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }
+}
+
+export function __asyncValues(o) {
+  if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+  var m = o[Symbol.asyncIterator], i;
+  return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
+  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
+  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
+}
+
+export function __makeTemplateObject(cooked, raw) {
+  if (Object.defineProperty) { Object.defineProperty(cooked, "raw", { value: raw }); } else { cooked.raw = raw; }
+  return cooked;
+};
+
+var __setModuleDefault = Object.create ? (function(o, v) {
+  Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+  o["default"] = v;
+};
+
+var ownKeys = function(o) {
+  ownKeys = Object.getOwnPropertyNames || function (o) {
+    var ar = [];
+    for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+    return ar;
+  };
+  return ownKeys(o);
+};
+
+export function __importStar(mod) {
+  if (mod && mod.__esModule) return mod;
+  var result = {};
+  if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+  __setModuleDefault(result, mod);
+  return result;
+}
+
+export function __importDefault(mod) {
+  return (mod && mod.__esModule) ? mod : { default: mod };
+}
+
+export function __classPrivateFieldGet(receiver, state, kind, f) {
+  if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+  if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+  return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+}
+
+export function __classPrivateFieldSet(receiver, state, value, kind, f) {
+  if (kind === "m") throw new TypeError("Private method is not writable");
+  if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+  if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+  return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+}
+
+export function __classPrivateFieldIn(state, receiver) {
+  if (receiver === null || (typeof receiver !== "object" && typeof receiver !== "function")) throw new TypeError("Cannot use 'in' operator on non-object");
+  return typeof state === "function" ? receiver === state : state.has(receiver);
+}
+
+export function __addDisposableResource(env, value, async) {
+  if (value !== null && value !== void 0) {
+    if (typeof value !== "object" && typeof value !== "function") throw new TypeError("Object expected.");
+    var dispose, inner;
+    if (async) {
+      if (!Symbol.asyncDispose) throw new TypeError("Symbol.asyncDispose is not defined.");
+      dispose = value[Symbol.asyncDispose];
+    }
+    if (dispose === void 0) {
+      if (!Symbol.dispose) throw new TypeError("Symbol.dispose is not defined.");
+      dispose = value[Symbol.dispose];
+      if (async) inner = dispose;
+    }
+    if (typeof dispose !== "function") throw new TypeError("Object not disposable.");
+    if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };
+    env.stack.push({ value: value, dispose: dispose, async: async });
+  }
+  else if (async) {
+    env.stack.push({ async: true });
+  }
+  return value;
+}
+
+var _SuppressedError = typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+  var e = new Error(message);
+  return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+};
+
+export function __disposeResources(env) {
+  function fail(e) {
+    env.error = env.hasError ? new _SuppressedError(e, env.error, "An error was suppressed during disposal.") : e;
+    env.hasError = true;
+  }
+  var r, s = 0;
+  function next() {
+    while (r = env.stack.pop()) {
+      try {
+        if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);
+        if (r.dispose) {
+          var result = r.dispose.call(r.value);
+          if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });
+        }
+        else s |= 1;
+      }
+      catch (e) {
+        fail(e);
+      }
+    }
+    if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();
+    if (env.hasError) throw env.error;
+  }
+  return next();
+}
+
+export function __rewriteRelativeImportExtension(path, preserveJsx) {
+  if (typeof path === "string" && /^\.\.?\//.test(path)) {
+      return path.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+?)?)\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {
+          return tsx ? preserveJsx ? ".jsx" : ".js" : d && (!ext || !cm) ? m : (d + ext + "." + cm.toLowerCase() + "js");
+      });
+  }
+  return path;
+}
+
+export default {
+  __extends,
+  __assign,
+  __rest,
+  __decorate,
+  __param,
+  __esDecorate,
+  __runInitializers,
+  __propKey,
+  __setFunctionName,
+  __metadata,
+  __awaiter,
+  __generator,
+  __createBinding,
+  __exportStar,
+  __values,
+  __read,
+  __spread,
+  __spreadArrays,
+  __spreadArray,
+  __await,
+  __asyncGenerator,
+  __asyncDelegator,
+  __asyncValues,
+  __makeTemplateObject,
+  __importStar,
+  __importDefault,
+  __classPrivateFieldGet,
+  __classPrivateFieldSet,
+  __classPrivateFieldIn,
+  __addDisposableResource,
+  __disposeResources,
+  __rewriteRelativeImportExtension,
+};
diff --git a/node_modules/tslib/tslib.html b/node_modules/tslib/tslib.html
new file mode 100644
index 0000000..44c9ba5
--- /dev/null
+++ b/node_modules/tslib/tslib.html
@@ -0,0 +1 @@
+<script src="tslib.js"></script>
\ No newline at end of file
diff --git a/node_modules/tslib/tslib.js b/node_modules/tslib/tslib.js
new file mode 100644
index 0000000..5e12ace
--- /dev/null
+++ b/node_modules/tslib/tslib.js
@@ -0,0 +1,484 @@
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+/* global global, define, Symbol, Reflect, Promise, SuppressedError, Iterator */
+var __extends;
+var __assign;
+var __rest;
+var __decorate;
+var __param;
+var __esDecorate;
+var __runInitializers;
+var __propKey;
+var __setFunctionName;
+var __metadata;
+var __awaiter;
+var __generator;
+var __exportStar;
+var __values;
+var __read;
+var __spread;
+var __spreadArrays;
+var __spreadArray;
+var __await;
+var __asyncGenerator;
+var __asyncDelegator;
+var __asyncValues;
+var __makeTemplateObject;
+var __importStar;
+var __importDefault;
+var __classPrivateFieldGet;
+var __classPrivateFieldSet;
+var __classPrivateFieldIn;
+var __createBinding;
+var __addDisposableResource;
+var __disposeResources;
+var __rewriteRelativeImportExtension;
+(function (factory) {
+    var root = typeof global === "object" ? global : typeof self === "object" ? self : typeof this === "object" ? this : {};
+    if (typeof define === "function" && define.amd) {
+        define("tslib", ["exports"], function (exports) { factory(createExporter(root, createExporter(exports))); });
+    }
+    else if (typeof module === "object" && typeof module.exports === "object") {
+        factory(createExporter(root, createExporter(module.exports)));
+    }
+    else {
+        factory(createExporter(root));
+    }
+    function createExporter(exports, previous) {
+        if (exports !== root) {
+            if (typeof Object.create === "function") {
+                Object.defineProperty(exports, "__esModule", { value: true });
+            }
+            else {
+                exports.__esModule = true;
+            }
+        }
+        return function (id, v) { return exports[id] = previous ? previous(id, v) : v; };
+    }
+})
+(function (exporter) {
+    var extendStatics = Object.setPrototypeOf ||
+        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+
+    __extends = function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+
+    __assign = Object.assign || function (t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
+        }
+        return t;
+    };
+
+    __rest = function (s, e) {
+        var t = {};
+        for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
+            t[p] = s[p];
+        if (s != null && typeof Object.getOwnPropertySymbols === "function")
+            for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
+                if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
+                    t[p[i]] = s[p[i]];
+            }
+        return t;
+    };
+
+    __decorate = function (decorators, target, key, desc) {
+        var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+        if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+        else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+        return c > 3 && r && Object.defineProperty(target, key, r), r;
+    };
+
+    __param = function (paramIndex, decorator) {
+        return function (target, key) { decorator(target, key, paramIndex); }
+    };
+
+    __esDecorate = function (ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {
+        function accept(f) { if (f !== void 0 && typeof f !== "function") throw new TypeError("Function expected"); return f; }
+        var kind = contextIn.kind, key = kind === "getter" ? "get" : kind === "setter" ? "set" : "value";
+        var target = !descriptorIn && ctor ? contextIn["static"] ? ctor : ctor.prototype : null;
+        var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});
+        var _, done = false;
+        for (var i = decorators.length - 1; i >= 0; i--) {
+            var context = {};
+            for (var p in contextIn) context[p] = p === "access" ? {} : contextIn[p];
+            for (var p in contextIn.access) context.access[p] = contextIn.access[p];
+            context.addInitializer = function (f) { if (done) throw new TypeError("Cannot add initializers after decoration has completed"); extraInitializers.push(accept(f || null)); };
+            var result = (0, decorators[i])(kind === "accessor" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);
+            if (kind === "accessor") {
+                if (result === void 0) continue;
+                if (result === null || typeof result !== "object") throw new TypeError("Object expected");
+                if (_ = accept(result.get)) descriptor.get = _;
+                if (_ = accept(result.set)) descriptor.set = _;
+                if (_ = accept(result.init)) initializers.unshift(_);
+            }
+            else if (_ = accept(result)) {
+                if (kind === "field") initializers.unshift(_);
+                else descriptor[key] = _;
+            }
+        }
+        if (target) Object.defineProperty(target, contextIn.name, descriptor);
+        done = true;
+    };
+
+    __runInitializers = function (thisArg, initializers, value) {
+        var useValue = arguments.length > 2;
+        for (var i = 0; i < initializers.length; i++) {
+            value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);
+        }
+        return useValue ? value : void 0;
+    };
+
+    __propKey = function (x) {
+        return typeof x === "symbol" ? x : "".concat(x);
+    };
+
+    __setFunctionName = function (f, name, prefix) {
+        if (typeof name === "symbol") name = name.description ? "[".concat(name.description, "]") : "";
+        return Object.defineProperty(f, "name", { configurable: true, value: prefix ? "".concat(prefix, " ", name) : name });
+    };
+
+    __metadata = function (metadataKey, metadataValue) {
+        if (typeof Reflect === "object" && typeof Reflect.metadata === "function") return Reflect.metadata(metadataKey, metadataValue);
+    };
+
+    __awaiter = function (thisArg, _arguments, P, generator) {
+        function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+        return new (P || (P = Promise))(function (resolve, reject) {
+            function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+            function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+            function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+            step((generator = generator.apply(thisArg, _arguments || [])).next());
+        });
+    };
+
+    __generator = function (thisArg, body) {
+        var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
+        return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+        function verb(n) { return function (v) { return step([n, v]); }; }
+        function step(op) {
+            if (f) throw new TypeError("Generator is already executing.");
+            while (g && (g = 0, op[0] && (_ = 0)), _) try {
+                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;
+                if (y = 0, t) op = [op[0] & 2, t.value];
+                switch (op[0]) {
+                    case 0: case 1: t = op; break;
+                    case 4: _.label++; return { value: op[1], done: false };
+                    case 5: _.label++; y = op[1]; op = [0]; continue;
+                    case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                    default:
+                        if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                        if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                        if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                        if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                        if (t[2]) _.ops.pop();
+                        _.trys.pop(); continue;
+                }
+                op = body.call(thisArg, _);
+            } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+            if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+        }
+    };
+
+    __exportStar = function(m, o) {
+        for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);
+    };
+
+    __createBinding = Object.create ? (function(o, m, k, k2) {
+        if (k2 === undefined) k2 = k;
+        var desc = Object.getOwnPropertyDescriptor(m, k);
+        if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+            desc = { enumerable: true, get: function() { return m[k]; } };
+        }
+        Object.defineProperty(o, k2, desc);
+    }) : (function(o, m, k, k2) {
+        if (k2 === undefined) k2 = k;
+        o[k2] = m[k];
+    });
+
+    __values = function (o) {
+        var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+        if (m) return m.call(o);
+        if (o && typeof o.length === "number") return {
+            next: function () {
+                if (o && i >= o.length) o = void 0;
+                return { value: o && o[i++], done: !o };
+            }
+        };
+        throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+    };
+
+    __read = function (o, n) {
+        var m = typeof Symbol === "function" && o[Symbol.iterator];
+        if (!m) return o;
+        var i = m.call(o), r, ar = [], e;
+        try {
+            while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+        }
+        catch (error) { e = { error: error }; }
+        finally {
+            try {
+                if (r && !r.done && (m = i["return"])) m.call(i);
+            }
+            finally { if (e) throw e.error; }
+        }
+        return ar;
+    };
+
+    /** @deprecated */
+    __spread = function () {
+        for (var ar = [], i = 0; i < arguments.length; i++)
+            ar = ar.concat(__read(arguments[i]));
+        return ar;
+    };
+
+    /** @deprecated */
+    __spreadArrays = function () {
+        for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;
+        for (var r = Array(s), k = 0, i = 0; i < il; i++)
+            for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)
+                r[k] = a[j];
+        return r;
+    };
+
+    __spreadArray = function (to, from, pack) {
+        if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+            if (ar || !(i in from)) {
+                if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+                ar[i] = from[i];
+            }
+        }
+        return to.concat(ar || Array.prototype.slice.call(from));
+    };
+
+    __await = function (v) {
+        return this instanceof __await ? (this.v = v, this) : new __await(v);
+    };
+
+    __asyncGenerator = function (thisArg, _arguments, generator) {
+        if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+        var g = generator.apply(thisArg, _arguments || []), i, q = [];
+        return i = Object.create((typeof AsyncIterator === "function" ? AsyncIterator : Object).prototype), verb("next"), verb("throw"), verb("return", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;
+        function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }
+        function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }
+        function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
+        function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
+        function fulfill(value) { resume("next", value); }
+        function reject(value) { resume("throw", value); }
+        function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
+    };
+
+    __asyncDelegator = function (o) {
+        var i, p;
+        return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
+        function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }
+    };
+
+    __asyncValues = function (o) {
+        if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
+        var m = o[Symbol.asyncIterator], i;
+        return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
+        function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
+        function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
+    };
+
+    __makeTemplateObject = function (cooked, raw) {
+        if (Object.defineProperty) { Object.defineProperty(cooked, "raw", { value: raw }); } else { cooked.raw = raw; }
+        return cooked;
+    };
+
+    var __setModuleDefault = Object.create ? (function(o, v) {
+        Object.defineProperty(o, "default", { enumerable: true, value: v });
+    }) : function(o, v) {
+        o["default"] = v;
+    };
+
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+
+    __importStar = function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+
+    __importDefault = function (mod) {
+        return (mod && mod.__esModule) ? mod : { "default": mod };
+    };
+
+    __classPrivateFieldGet = function (receiver, state, kind, f) {
+        if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+        if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+        return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+    };
+
+    __classPrivateFieldSet = function (receiver, state, value, kind, f) {
+        if (kind === "m") throw new TypeError("Private method is not writable");
+        if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+        if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+        return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+    };
+
+    __classPrivateFieldIn = function (state, receiver) {
+        if (receiver === null || (typeof receiver !== "object" && typeof receiver !== "function")) throw new TypeError("Cannot use 'in' operator on non-object");
+        return typeof state === "function" ? receiver === state : state.has(receiver);
+    };
+
+    __addDisposableResource = function (env, value, async) {
+        if (value !== null && value !== void 0) {
+            if (typeof value !== "object" && typeof value !== "function") throw new TypeError("Object expected.");
+            var dispose, inner;
+            if (async) {
+                if (!Symbol.asyncDispose) throw new TypeError("Symbol.asyncDispose is not defined.");
+                dispose = value[Symbol.asyncDispose];
+            }
+            if (dispose === void 0) {
+                if (!Symbol.dispose) throw new TypeError("Symbol.dispose is not defined.");
+                dispose = value[Symbol.dispose];
+                if (async) inner = dispose;
+            }
+            if (typeof dispose !== "function") throw new TypeError("Object not disposable.");
+            if (inner) dispose = function() { try { inner.call(this); } catch (e) { return Promise.reject(e); } };
+            env.stack.push({ value: value, dispose: dispose, async: async });
+        }
+        else if (async) {
+            env.stack.push({ async: true });
+        }
+        return value;
+    };
+
+    var _SuppressedError = typeof SuppressedError === "function" ? SuppressedError : function (error, suppressed, message) {
+        var e = new Error(message);
+        return e.name = "SuppressedError", e.error = error, e.suppressed = suppressed, e;
+    };
+
+    __disposeResources = function (env) {
+        function fail(e) {
+            env.error = env.hasError ? new _SuppressedError(e, env.error, "An error was suppressed during disposal.") : e;
+            env.hasError = true;
+        }
+        var r, s = 0;
+        function next() {
+            while (r = env.stack.pop()) {
+                try {
+                    if (!r.async && s === 1) return s = 0, env.stack.push(r), Promise.resolve().then(next);
+                    if (r.dispose) {
+                        var result = r.dispose.call(r.value);
+                        if (r.async) return s |= 2, Promise.resolve(result).then(next, function(e) { fail(e); return next(); });
+                    }
+                    else s |= 1;
+                }
+                catch (e) {
+                    fail(e);
+                }
+            }
+            if (s === 1) return env.hasError ? Promise.reject(env.error) : Promise.resolve();
+            if (env.hasError) throw env.error;
+        }
+        return next();
+    };
+
+    __rewriteRelativeImportExtension = function (path, preserveJsx) {
+        if (typeof path === "string" && /^\.\.?\//.test(path)) {
+            return path.replace(/\.(tsx)$|((?:\.d)?)((?:\.[^./]+?)?)\.([cm]?)ts$/i, function (m, tsx, d, ext, cm) {
+                return tsx ? preserveJsx ? ".jsx" : ".js" : d && (!ext || !cm) ? m : (d + ext + "." + cm.toLowerCase() + "js");
+            });
+        }
+        return path;
+    };
+
+    exporter("__extends", __extends);
+    exporter("__assign", __assign);
+    exporter("__rest", __rest);
+    exporter("__decorate", __decorate);
+    exporter("__param", __param);
+    exporter("__esDecorate", __esDecorate);
+    exporter("__runInitializers", __runInitializers);
+    exporter("__propKey", __propKey);
+    exporter("__setFunctionName", __setFunctionName);
+    exporter("__metadata", __metadata);
+    exporter("__awaiter", __awaiter);
+    exporter("__generator", __generator);
+    exporter("__exportStar", __exportStar);
+    exporter("__createBinding", __createBinding);
+    exporter("__values", __values);
+    exporter("__read", __read);
+    exporter("__spread", __spread);
+    exporter("__spreadArrays", __spreadArrays);
+    exporter("__spreadArray", __spreadArray);
+    exporter("__await", __await);
+    exporter("__asyncGenerator", __asyncGenerator);
+    exporter("__asyncDelegator", __asyncDelegator);
+    exporter("__asyncValues", __asyncValues);
+    exporter("__makeTemplateObject", __makeTemplateObject);
+    exporter("__importStar", __importStar);
+    exporter("__importDefault", __importDefault);
+    exporter("__classPrivateFieldGet", __classPrivateFieldGet);
+    exporter("__classPrivateFieldSet", __classPrivateFieldSet);
+    exporter("__classPrivateFieldIn", __classPrivateFieldIn);
+    exporter("__addDisposableResource", __addDisposableResource);
+    exporter("__disposeResources", __disposeResources);
+    exporter("__rewriteRelativeImportExtension", __rewriteRelativeImportExtension);
+});
+
+0 && (module.exports = {
+    __extends: __extends,
+    __assign: __assign,
+    __rest: __rest,
+    __decorate: __decorate,
+    __param: __param,
+    __esDecorate: __esDecorate,
+    __runInitializers: __runInitializers,
+    __propKey: __propKey,
+    __setFunctionName: __setFunctionName,
+    __metadata: __metadata,
+    __awaiter: __awaiter,
+    __generator: __generator,
+    __exportStar: __exportStar,
+    __createBinding: __createBinding,
+    __values: __values,
+    __read: __read,
+    __spread: __spread,
+    __spreadArrays: __spreadArrays,
+    __spreadArray: __spreadArray,
+    __await: __await,
+    __asyncGenerator: __asyncGenerator,
+    __asyncDelegator: __asyncDelegator,
+    __asyncValues: __asyncValues,
+    __makeTemplateObject: __makeTemplateObject,
+    __importStar: __importStar,
+    __importDefault: __importDefault,
+    __classPrivateFieldGet: __classPrivateFieldGet,
+    __classPrivateFieldSet: __classPrivateFieldSet,
+    __classPrivateFieldIn: __classPrivateFieldIn,
+    __addDisposableResource: __addDisposableResource,
+    __disposeResources: __disposeResources,
+    __rewriteRelativeImportExtension: __rewriteRelativeImportExtension,
+});
diff --git a/node_modules/typed-function/LICENSE b/node_modules/typed-function/LICENSE
new file mode 100644
index 0000000..ce81010
--- /dev/null
+++ b/node_modules/typed-function/LICENSE
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2014-2024 Jos de Jong
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/node_modules/typed-function/README.md b/node_modules/typed-function/README.md
new file mode 100644
index 0000000..d05204e
--- /dev/null
+++ b/node_modules/typed-function/README.md
@@ -0,0 +1,605 @@
+# typed-function
+
+[![Version](https://img.shields.io/npm/v/typed-function.svg)](https://www.npmjs.com/package/typed-function)
+[![Downloads](https://img.shields.io/npm/dm/typed-function.svg)](https://www.npmjs.com/package/typed-function)
+[![Build Status](https://github.com/josdejong/typed-function/workflows/Node.js%20CI/badge.svg)](https://github.com/josdejong/typed-function/actions)
+
+Move type checking logic and type conversions outside of your function in a
+flexible, organized way. Automatically throw informative errors in case of
+wrong input arguments.
+
+
+## Features
+
+typed-function has the following features:
+
+- Runtime type-checking of input arguments.
+- Automatic type conversion of arguments.
+- Compose typed functions with multiple signatures.
+- Supports union types, any type, and variable arguments.
+- Detailed error messaging.
+
+Supported environments: node.js, Chrome, Firefox, Safari, Opera, IE11+.
+
+
+## Why?
+
+In JavaScript, functions can be called with any number and any type of arguments.
+When writing a function, the easiest way is to just assume that the function
+will be called with the correct input. This leaves the function's behavior on
+invalid input undefined. The function may throw some error, or worse,
+it may silently fail or return wrong results. Typical errors are
+*TypeError: undefined is not a function* or *TypeError: Cannot call method
+'request' of undefined*. These error messages are not very helpful. It can be
+hard to debug them, as they can be the result of a series of nested function
+calls manipulating and propagating invalid or incomplete data.
+
+Often, JavaScript developers add some basic type checking where it is important,
+using checks like `typeof fn === 'function'`, `date instanceof Date`, and
+`Array.isArray(arr)`. For functions supporting multiple signatures,
+the type checking logic can grow quite a bit, and distract from the actual
+logic of the function.
+
+For functions dealing with a considerable amount of type checking and conversion
+logic, or functions facing a public API, it can be very useful to use the
+`typed-function` module to handle the type-checking logic. This way:
+
+-   Users of the function get useful and consistent error messages when using
+    the function wrongly.
+-   The function cannot silently fail or silently give wrong results due to
+    invalid input.
+-   Correct type of input is assured inside the function. The function's code
+    becomes easier to understand as it only contains the actual function logic.
+    Lower level utility functions called by the type-checked function can
+    possibly be kept simpler as they don't need to do additional type checking.
+
+It's important however not to *overuse* type checking:
+
+-   Locking down the type of input that a function accepts can unnecessarily
+    limit its flexibility. Keep functions as flexible and forgiving as possible,
+    follow the
+    [robustness principle](http://en.wikipedia.org/wiki/Robustness_principle)
+    here: "be liberal in what you accept and conservative in what you send"
+    (Postel's law).
+-   There is no need to apply type checking to *all* functions. It may be
+    enough to apply type checking to one tier of public facing functions.
+-   There is a performance penalty involved for all type checking, so applying
+    it everywhere can unnecessarily worsen the performance.
+
+
+## Load
+
+Install via npm:
+
+    npm install typed-function
+
+
+## Usage
+
+Here are some usage examples. More examples are available in the
+[/examples](/examples) folder.
+
+```js
+import typed from 'typed-function'
+
+// create a typed function
+var fn1 = typed({
+  'number, string': function (a, b) {
+    return 'a is a number, b is a string';
+  }
+});
+
+// create a typed function with multiple types per argument (type union)
+var fn2 = typed({
+  'string, number | boolean': function (a, b) {
+    return 'a is a string, b is a number or a boolean';
+  }
+});
+
+// create a typed function with any type argument
+var fn3 = typed({
+  'string, any': function (a, b) {
+    return 'a is a string, b can be anything';
+  }
+});
+
+// create a typed function with multiple signatures
+var fn4 = typed({
+  'number': function (a) {
+    return 'a is a number';
+  },
+  'number, boolean': function (a, b) {
+    return 'a is a number, b is a boolean';
+  },
+  'number, number': function (a, b) {
+    return 'a is a number, b is a number';
+  }
+});
+
+// create a typed function from a plain function with signature
+function fnPlain (a, b) {
+  return 'a is a number, b is a string';
+}
+
+fnPlain.signature = 'number, string';
+var fn5 = typed(fnPlain);
+
+// use the functions
+console.log(fn1(2, 'foo'));      // outputs 'a is a number, b is a string'
+console.log(fn4(2));             // outputs 'a is a number'
+
+// calling the function with a non-supported type signature will throw an error
+try {
+  fn2('hello', 'world');
+} catch (err) {
+  console.log(err.toString());
+  // outputs:  TypeError: Unexpected type of argument.
+  //           Expected: number or boolean, actual: string, index: 1.
+}
+```
+
+
+## Types
+
+typed-function has the following built-in types:
+
+- `null`
+- `boolean`
+- `number`
+- `string`
+- `Function`
+- `Array`
+- `Date`
+- `RegExp`
+- `Object`
+
+The following type expressions are supported:
+
+- Multiple arguments: `string, number, Function`
+- Union types: `number | string`
+- Variable arguments: `...number`
+- Any type: `any`
+
+### Dispatch
+
+When a typed function is called, an implementation with a matching signature
+is called, where conversions may be applied to actual arguments in order to
+find a match.
+
+Among all matching signatures, the one to execute is chosen by the following
+preferences, in order of priority:
+
+* one that does not have an `...any` parameter
+* one with the fewest `any` parameters
+* one that does not use conversions to match a rest parameter
+* one with the fewest conversions needed to match overall
+* one with no rest parameter
+* If there's a rest parameter, the one with the most non-rest parameters
+* The one with the largest number of preferred parameters
+* The one with the earliest preferred parameter
+
+When this process gets to the point of comparing individual parameters,
+the preference between parameters is determined by the following, in
+priority order:
+
+* All specific types are preferred to the 'any' type
+* All directly matching types are preferred to conversions
+* Types earlier in the list of known types are preferred
+* Among conversions, ones earlier in the list are preferred
+
+If none of these aspects produces a preference, then in those contexts in
+which Array.sort is stable, the order implementations were listed when
+the typed-function was created breaks the tie. Otherwise the dispatch may
+select any of the "tied" implementations.
+
+## API
+
+### Construction
+
+```
+typed([name: string], ...Object.<string, function>|function)
+```
+A typed function can be constructed from an optional name and any number of
+(additional) arguments that supply the implementations for various
+signatures. Each of these further arguments must be one of the following:
+
+-   An object with one or multiple signatures, i.e. a plain object
+    with string keys, each of which names a signature, and functions as
+    the values of those keys.
+
+-   A previously constructed typed function, in which case all of its
+    signatures and corresponding implementations are merged into the new
+    typed function.
+
+-   A plain function with a `signature` property whose value is a string
+    giving that function's signature.
+
+The name, if specified, must be the first argument. If not specified, the new
+typed-function's name is inherited from the arguments it is composed from,
+as long as any that have names agree with one another.
+
+If the same signature is specified by the collection of arguments more than
+once with different implementations, an error will be thrown.
+
+#### Properties and methods of a typed function `fn`
+
+-   `fn.name : string`
+
+    The name of the typed function, if one was assigned at creation; otherwise,
+    the value of this property is the empty string.
+
+-   `fn.signatures : Object.<string, function>`
+
+    The value of this property is a plain object. Its keys are the string
+    signatures on which this typed function `fn` is directly defined
+    (without conversions). The value for each key is the function `fn`
+    will call when its arguments match that signature. This property may
+    differ from the similar object used to create the typed function,
+    in that the originally provided signatures are parsed into a canonical,
+    more usable form: union types are split into their constituents where
+    possible, whitespace in the signature strings is removed, etc.
+
+-   `fn.toString() : string`
+
+    Returns human-readable code showing exactly what the function does.
+    Mostly for debugging purposes.
+
+### Methods of the typed package
+
+-   `typed.convert(value: *, type: string) : *`
+
+    Convert a value to another type. Only applicable when conversions have
+    been added with `typed.addConversion()` and/or `typed.addConversions()`
+    (see below in the method list).
+    Example:
+    
+    ```js
+    typed.addConversion({
+      from: 'number',
+      to: 'string',
+      convert: function (x) {
+        return +x;
+      }
+    });
+    
+    var str = typed.convert(2.3, 'string'); // '2.3' 
+    ```
+
+-   `typed.create() : function`
+
+    Create a new, isolated instance of typed-function. Example:
+
+    ```js
+    import typed from 'typed-function.mjs';  // default instance
+    const typed2 = typed.create();           // a second instance
+    ```
+
+    This would allow you, for example, to have two different type hierarchies
+    for different purposes.
+
+-   `typed.resolve(fn: typed-function, argList: Array<any>): signature-object`
+
+    Find the specific signature and implementation that the typed function
+    `fn` will call if invoked on the argument list `argList`. Returns null if
+    there is no matching signature. The returned signature object has
+    properties `params`, `test`, `fn`, and `implementation`. The difference
+    between the last two properties is that `fn` is the original function
+    supplied at typed-function creation time, whereas `implementation` is
+    ready to be called on this specific argList, in that it will first
+    perform any necessary conversions and gather arguments up into "rest"
+    parameters as needed.
+
+    Thus, in the case that arguments `a0`,`a1`,`a2` (say) do match one of
+    the signatures of this typed function `fn`, then `fn(a0, a1, a2)`
+    (in a context in which `this` will be, say, `t`) does exactly the same
+    thing as
+
+    `typed.resolve(fn, [a0,a1,a2]).implementation.apply(t, [a0,a1,a2])`.
+
+    But `resolve` is useful if you want to interpose any other operation
+    (such as bookkeeping or additional custom error checking) between
+    signature selection and execution dispatch.
+
+-   `typed.findSignature(fn: typed-function, signature: string | Array, options: object) : signature-object`
+
+    Find the signature object (as returned by `typed.resolve` above), but
+    based on the specification of a signature (given either as a
+    comma-separated string of parameter types, or an Array of strings giving
+    the parameter types), rather than based on an example argument list.
+
+    The optional third argument, is a plain object giving options controlling
+    the search. Currently, the only implemented option is `exact`, which if
+    true (defaults to false), limits the search to exact type matches,
+    i.e. signatures for which no conversion functions need to be called in
+    order to apply the function.
+
+    Throws an error if the signature is not found.
+
+-   `typed.find(fn: typed-function, signature: string | Array, options: object) : function`
+
+    Convenience method that returns just the implementation from the
+    signature object produced by `typed.findSignature(fn, signature, options)`.
+    
+    For example:
+    
+    ```js
+    var fn = typed(...);
+    var f = typed.find(fn, ['number', 'string']);
+    var f = typed.find(fn, 'number, string', 'exact');
+    ```
+
+-   `typed.referTo(...string, callback: (resolvedFunctions: ...function) => function)`
+
+    Within the definition of a typed-function, resolve references to one or
+    multiple signatures of the typed-function itself. This looks like:
+
+    ```
+    typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {
+      // ... use the resolved signatures fn1, fn2, ...
+    });
+    ```
+
+    Example usage:
+
+    ```js
+    const fn = typed({
+      'number': function (value) {
+        return 'Input was a number: ' + value;
+      },
+      'boolean': function (value) {
+        return 'Input was a boolean: ' + value;
+      },
+      'string': typed.referTo('number', 'boolean', (fnNumber, fnBoolean) => {
+        return function fnString(value) {
+          // here we use the signatures of the typed-function directly:
+          if (value === 'true') {
+            return fnBoolean(true);
+          }
+          if (value === 'false') {
+            return fnBoolean(false);
+          }
+          return fnNumber(parseFloat(value));
+        }
+      })
+    });
+    ```
+
+    See also `typed.referToSelf(callback)`.
+
+-   `typed.referToSelf(callback: (self) => function)`
+
+    Refer to the typed-function itself. This can be used for recursive calls.
+    Calls to self will incur the overhead of fully re-dispatching the
+    typed-function. If the signature that needs to be invoked is already known,
+    you can use `typed.referTo(...)` instead for better performance.
+
+    > In `typed-function@2` it was possible to use `this(...)` to reference the typed-function itself. In `typed-function@v3`, such usage is replaced with the `typed.referTo(...)` and `typed.referToSelf(...)` methods. Typed-functions are unbound in `typed-function@v3` and can be bound to another context if needed.
+
+-   `typed.isTypedFunction(entity: any): boolean`
+
+    Return true if the given entity appears to be a typed function
+    (created by any instance of typed-function), and false otherwise. It
+    tests for the presence of a particular property on the entity,
+    and so could be deceived by another object with the same property, although
+    the property is chosen so that's unlikely to happen unintentionally.
+
+-   `typed.addType(type: {name: string, test: function, [, beforeObjectTest=true]): void`
+
+    Add a new type. A type object contains a name and a test function.
+    The order of the types determines in which order function arguments are 
+    type-checked, so for performance it's important to put the most used types 
+    first. Also, if one type is contained in another, it should likely precede
+    it in the type order so that it won't be masked in type testing.
+    
+    Example:
+    
+    ```js
+    function Person(...) {
+      ...
+    }
+    
+    Person.prototype.isPerson = true;
+
+    typed.addType({
+      name: 'Person',
+      test: function (x) {
+        return x && x.isPerson === true;
+      }
+    });
+    ```
+
+    By default, the new type will be inserted before the `Object` test
+    because the `Object` test also matches arrays and classes and hence
+    `typed-function` would never reach the new type. When `beforeObjectTest`
+    is `false`, the new type will be added at the end of all tests.
+
+-   `typed.addTypes(types: TypeDef[] [, before = 'any']): void`
+
+    Adds an list of new types. Each entry of the `types` array is an object
+    like the `type` argument to `typed.addType`. The optional `before` argument
+    is similar to `typed.addType` as well, except it should be the name of an
+    arbitrary type that has already been added (rather than just a boolean flag)
+
+-   `typed.clear(): void`
+
+    Removes all types and conversions from the typed instance. Note that any
+    typed-functions created before a call to `clear` will still operate, but
+    they may prouce unintelligible messages in case of type mismatch errors.
+
+-   `typed.addConversion(conversion: {from: string, to: string, convert: function}, options?: { override: boolean }) : void`
+
+    Add a new conversion.
+    
+    ```js
+    typed.addConversion({
+      from: 'boolean',
+      to: 'number',
+      convert: function (x) {
+        return +x;
+    });
+    ```
+
+    Note that any typed functions created before this conversion is added will
+    not have their arguments undergo this new conversion automatically, so it is
+    best to add all of your desired automatic conversions before defining any
+    typed functions.
+
+-   `typed.addConversions(conversions: ConversionDef[], options?: { override: boolean }): void`
+
+    Convenience method that adds a list of conversions. Each element in the
+    `conversions` array should be an object like the `conversion` argument of
+    `typed.addConversion`.
+
+-   `typed.removeConversion(conversion: ConversionDef): void`
+
+    Removes a single existing conversion. An error is thrown if there is no
+    conversion from and to the given types with a strictly equal convert
+    function as supplied in this call.
+
+-   `typed.clearConversions(): void`
+
+    Removes all conversions from the typed instance (leaving the types alone).
+
+-   `typed.createError(name: string, args: Array.<any>, signatures: Array.<Signature>): TypeError`
+
+    Generates a custom error object reporting the problem with calling
+    the typed function of the given `name` with the given `signatures` on the
+    actual arguments `args`. Note the error object has an extra property `data`
+    giving the details of the problem. This method is primarily useful in
+    writing your own handler for a type mismatch (see the `typed.onMismatch`
+    property below), in case you have tried to recover but end up deciding
+    you want to throw the error that the default handler would have.
+
+### Properties
+
+-   `typed.onMismatch: function`
+
+    The handler called when a typed-function call fails to match with any
+    of its signatures. The handler is called with three arguments: the name
+    of the typed function being called, the actual argument list, and an array
+    of the signatures for the typed function being called. (Each signature is
+    an object with property 'signature' giving the actual signature and\
+    property 'fn' giving the raw function for that signature.) The default
+    value of `onMismatch` is `typed.throwMismatchError`.
+
+    This can be useful if you have a collection of functions and have common
+    behavior for any invalid call. For example, you might just want to log
+    the problem and continue:
+
+    ```
+    const myErrorLog = [];
+    typed.onMismatch = (name, args, signatures) => {
+      myErrorLog.push(`Invalid call of ${name} with ${args.length} arguments.`);
+      return null;
+    };
+    typed.sqrt(9); // assuming definition as above, will return 3
+    typed.sqrt([]); // no error will be thrown; will return null.
+    console.log(`There have been ${myErrorLog.length} invalid calls.`)
+    ```
+
+    Note that there is only one `onMismatch` handler at a time; assigning a
+    new value discards the previous handler. To restore the default behavior,
+    just assign `typed.onMismatch = typed.throwMismatchError`.
+
+    Finally note that this handler fires whenever _any_ typed function call
+    does not match any of its signatures. You can in effect define such a
+    "handler" for a _single_ typed function by simply specifying an
+    implementation for the `...` signature:
+
+    ```
+    const lenOrNothing = typed({
+      string: s => s.length,
+      '...': () => 0
+    });
+    console.log(lenOrNothing('Hello, world!')) // Output: 13
+    console.log(lenOrNothing(57, 'varieties')) // Output: 0
+    ```
+
+-   `typed.warnAgainstDeprecatedThis: boolean`
+
+    Since `typed-function` v3, self-referencing a typed function using
+    `this(...)` or `this.signatures` has been deprecated and replaced with
+    the functions `typed.referTo` and `typed.referToSelf`. By default, all
+    function bodies will be scanned against this deprecated usage pattern and
+    an error will be thrown when encountered. To disable this validation step,
+    change this option to `false`.
+
+### Recursion
+
+The `this` keyword can be used to self-reference the typed-function:
+
+```js
+var sqrt = typed({
+  'number': function (value) {
+    return Math.sqrt(value);
+  },
+  'string': function (value) {
+    // on the following line we self reference the typed-function using "this"
+    return this(parseInt(value, 10));
+  }
+});
+
+// use the typed function
+console.log(sqrt('9')); // output: 3
+```
+
+
+## Roadmap
+
+### Version 4
+
+- Extend function signatures:
+  - Optional arguments like `'[number], array'` or like `number=, array`
+  - Nullable arguments like `'?Object'`
+- Allow conversions to fail (for example string to number is not always
+  possible). Call this `fallible` or `optional`?
+
+### Version 5
+
+- Extend function signatures:
+  - Constants like `'"linear" | "cubic"'`, `'0..10'`, etc.
+  - Object definitions like `'{name: string, age: number}'`
+  - Object definitions like `'Object.<string, Person>'`
+  - Array definitions like `'Array.<Person>'`
+- Improve performance of both generating a typed function as well as
+  the performance and memory footprint of a typed function.
+
+
+## Test
+
+To test the library, run:
+
+    npm test
+
+
+## Code style and linting
+
+The library is using the [standardjs](https://standardjs.com/) coding style.
+
+To test the code style, run:
+
+    npm run lint
+
+To automatically fix most of the styling issues, run:
+
+    npm run format
+
+
+## Publish
+
+1. Describe the changes in `HISTORY.md`
+2. Increase the version number in `package.json`
+3. Test and build:
+    ```
+    npm install
+    npm run build-and-test
+    ```
+4. Verify whether the generated output works correctly by opening
+   `./test/browserEsmBuild.html` in your browser. 
+5. Commit the changes
+6. Merge `develop` into `master`, and push `master`
+7. Create a git tag, and push this
+8. publish the library:
+    ```
+    npm publish
+    ```
diff --git a/node_modules/typed-function/lib/esm/typed-function.mjs b/node_modules/typed-function/lib/esm/typed-function.mjs
new file mode 100644
index 0000000..fd6bd73
--- /dev/null
+++ b/node_modules/typed-function/lib/esm/typed-function.mjs
@@ -0,0 +1,1946 @@
+function ok() {
+  return true;
+}
+function notOk() {
+  return false;
+}
+function undef() {
+  return undefined;
+}
+const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';
+
+/**
+ * @typedef {{
+ *   params: Param[],
+ *   fn: function,
+ *   test: function,
+ *   implementation: function
+ * }} Signature
+ *
+ * @typedef {{
+ *   types: Type[],
+ *   hasAny: boolean,
+ *   hasConversion: boolean,
+ *   restParam: boolean
+ * }} Param
+ *
+ * @typedef {{
+ *   name: string,
+ *   typeIndex: number,
+ *   test: function,
+ *   isAny: boolean,
+ *   conversion?: ConversionDef,
+ *   conversionIndex: number,
+ * }} Type
+ *
+ * @typedef {{
+ *   from: string,
+ *   to: string,
+ *   convert: function (*) : *
+ * }} ConversionDef
+ *
+ * @typedef {{
+ *   name: string,
+ *   test: function(*) : boolean,
+ *   isAny?: boolean
+ * }} TypeDef
+ */
+
+/**
+ * @returns {() => function}
+ */
+function create() {
+  // data type tests
+
+  /**
+   * Returns true if the argument is a non-null "plain" object
+   */
+  function isPlainObject(x) {
+    return typeof x === 'object' && x !== null && x.constructor === Object;
+  }
+  const _types = [{
+    name: 'number',
+    test: function (x) {
+      return typeof x === 'number';
+    }
+  }, {
+    name: 'string',
+    test: function (x) {
+      return typeof x === 'string';
+    }
+  }, {
+    name: 'boolean',
+    test: function (x) {
+      return typeof x === 'boolean';
+    }
+  }, {
+    name: 'Function',
+    test: function (x) {
+      return typeof x === 'function';
+    }
+  }, {
+    name: 'Array',
+    test: Array.isArray
+  }, {
+    name: 'Date',
+    test: function (x) {
+      return x instanceof Date;
+    }
+  }, {
+    name: 'RegExp',
+    test: function (x) {
+      return x instanceof RegExp;
+    }
+  }, {
+    name: 'Object',
+    test: isPlainObject
+  }, {
+    name: 'null',
+    test: function (x) {
+      return x === null;
+    }
+  }, {
+    name: 'undefined',
+    test: function (x) {
+      return x === undefined;
+    }
+  }];
+  const anyType = {
+    name: 'any',
+    test: ok,
+    isAny: true
+  };
+
+  // Data structures to track the types. As these are local variables in
+  // create(), each typed universe will get its own copy, but the variables
+  // will only be accessible through the (closures of the) functions supplied
+  // as properties of the typed object, not directly.
+  // These will be initialized in clear() below
+  let typeMap; // primary store of all types
+  let typeList; // Array of just type names, for the sake of ordering
+
+  // And similar data structures for the type conversions:
+  let nConversions = 0;
+  // the actual conversions are stored on a property of the destination types
+
+  // This is a temporary object, will be replaced with a function at the end
+  let typed = {
+    createCount: 0
+  };
+
+  /**
+   * Takes a type name and returns the corresponding official type object
+   * for that type.
+   *
+   * @param {string} typeName
+   * @returns {TypeDef} type
+   */
+  function findType(typeName) {
+    const type = typeMap.get(typeName);
+    if (type) {
+      return type;
+    }
+    // Remainder is error handling
+    let message = 'Unknown type "' + typeName + '"';
+    const name = typeName.toLowerCase();
+    let otherName;
+    for (otherName of typeList) {
+      if (otherName.toLowerCase() === name) {
+        message += '. Did you mean "' + otherName + '" ?';
+        break;
+      }
+    }
+    throw new TypeError(message);
+  }
+
+  /**
+   * Adds an array `types` of type definitions to this typed instance.
+   * Each type definition should be an object with properties:
+   * 'name' - a string giving the name of the type; 'test' - function
+   * returning a boolean that tests membership in the type; and optionally
+   * 'isAny' - true only for the 'any' type.
+   *
+   * The second optional argument, `before`, gives the name of a type that
+   * these types should be added before. The new types are added in the
+   * order specified.
+   * @param {TypeDef[]} types
+   * @param {string | boolean} [beforeSpec='any'] before
+   */
+  function addTypes(types) {
+    let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';
+    const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;
+    const newTypes = [];
+    for (let i = 0; i < types.length; ++i) {
+      if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {
+        throw new TypeError('Object with properties {name: string, test: function} expected');
+      }
+      const typeName = types[i].name;
+      if (typeMap.has(typeName)) {
+        throw new TypeError('Duplicate type name "' + typeName + '"');
+      }
+      newTypes.push(typeName);
+      typeMap.set(typeName, {
+        name: typeName,
+        test: types[i].test,
+        isAny: types[i].isAny,
+        index: beforeIndex + i,
+        conversionsTo: [] // Newly added type can't have any conversions to it
+      });
+    }
+    // update the typeList
+    const affectedTypes = typeList.slice(beforeIndex);
+    typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);
+    // Fix the indices
+    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {
+      typeMap.get(typeList[i]).index = i;
+    }
+  }
+
+  /**
+   * Removes all types and conversions from this typed instance.
+   * May cause previously constructed typed-functions to throw
+   * strange errors when they are called with types that do not
+   * match any of their signatures.
+   */
+  function clear() {
+    typeMap = new Map();
+    typeList = [];
+    nConversions = 0;
+    addTypes([anyType], false);
+  }
+
+  // initialize the types to the default list
+  clear();
+  addTypes(_types);
+
+  /**
+   * Removes all conversions, leaving the types alone.
+   */
+  function clearConversions() {
+    let typeName;
+    for (typeName of typeList) {
+      typeMap.get(typeName).conversionsTo = [];
+    }
+    nConversions = 0;
+  }
+
+  /**
+   * Find the type names that match a value.
+   * @param {*} value
+   * @return {string[]} Array of names of types for which
+   *                  the type test matches the value.
+   */
+  function findTypeNames(value) {
+    const matches = typeList.filter(name => {
+      const type = typeMap.get(name);
+      return !type.isAny && type.test(value);
+    });
+    if (matches.length) {
+      return matches;
+    }
+    return ['any'];
+  }
+
+  /**
+   * Check if an entity is a typed function created by any instance
+   * @param {any} entity
+   * @returns {boolean}
+   */
+  function isTypedFunction(entity) {
+    return entity && typeof entity === 'function' && '_typedFunctionData' in entity;
+  }
+
+  /**
+   * Find a specific signature from a (composed) typed function, for example:
+   *
+   *   typed.findSignature(fn, ['number', 'string'])
+   *   typed.findSignature(fn, 'number, string')
+   *   typed.findSignature(fn, 'number,string', {exact: true})
+   *
+   * This function findSignature will by default return the best match to
+   * the given signature, possibly employing type conversions.
+   *
+   * The (optional) third argument is a plain object giving options
+   * controlling the signature search. Currently the only implemented
+   * option is `exact`: if specified as true (default is false), only
+   * exact matches will be returned (i.e. signatures for which `fn` was
+   * directly defined). Note that a (possibly different) type matching
+   * `any`, or one or more instances of TYPE matching `...TYPE` are
+   * considered exact matches in this regard, as no conversions are used.
+   *
+   * This function returns a "signature" object, as does `typed.resolve()`,
+   * which is a plain object with four keys: `params` (the array of parameters
+   * for this signature), `fn` (the originally supplied function for this
+   * signature), `test` (a generated function that determines if an argument
+   * list matches this signature, and `implementation` (the function to call
+   * on a matching argument list, that performs conversions if necessary and
+   * then calls the originally supplied function).
+   *
+   * @param {Function} fn                   A typed-function
+   * @param {string | string[]} signature
+   *     Signature to be found, can be an array or a comma separated string.
+   * @param {object} options  Controls the signature search as documented
+   * @return {{ params: Param[], fn: function, test: function, implementation: function }}
+   *     Returns the matching signature, or throws an error when no signature
+   *     is found.
+   */
+  function findSignature(fn, signature, options) {
+    if (!isTypedFunction(fn)) {
+      throw new TypeError(NOT_TYPED_FUNCTION);
+    }
+
+    // Canonicalize input
+    const exact = options && options.exact;
+    const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;
+    const params = parseSignature(stringSignature);
+    const canonicalSignature = stringifyParams(params);
+
+    // First hope we get lucky and exactly match a signature
+    if (!exact || canonicalSignature in fn.signatures) {
+      // OK, we can check the internal signatures
+      const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);
+      if (match) {
+        return match;
+      }
+    }
+
+    // Oh well, we did not; so we have to go back and check the parameters
+    // one by one, in order to catch things like `any` and rest params.
+    // Note here we can assume there is at least one parameter, because
+    // the empty signature would have matched successfully above.
+    const nParams = params.length;
+    let remainingSignatures;
+    if (exact) {
+      remainingSignatures = [];
+      let name;
+      for (name in fn.signatures) {
+        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));
+      }
+    } else {
+      remainingSignatures = fn._typedFunctionData.signatures;
+    }
+    for (let i = 0; i < nParams; ++i) {
+      const want = params[i];
+      const filteredSignatures = [];
+      let possibility;
+      for (possibility of remainingSignatures) {
+        const have = getParamAtIndex(possibility.params, i);
+        if (!have || want.restParam && !have.restParam) {
+          continue;
+        }
+        if (!have.hasAny) {
+          // have to check all of the wanted types are available
+          const haveTypes = paramTypeSet(have);
+          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {
+            continue;
+          }
+        }
+        // OK, this looks good
+        filteredSignatures.push(possibility);
+      }
+      remainingSignatures = filteredSignatures;
+      if (remainingSignatures.length === 0) break;
+    }
+    // Return the first remaining signature that was totally matched:
+    let candidate;
+    for (candidate of remainingSignatures) {
+      if (candidate.params.length <= nParams) {
+        return candidate;
+      }
+    }
+    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');
+  }
+
+  /**
+   * Find the proper function to call for a specific signature from
+   * a (composed) typed function, for example:
+   *
+   *   typed.find(fn, ['number', 'string'])
+   *   typed.find(fn, 'number, string')
+   *   typed.find(fn, 'number,string', {exact: true})
+   *
+   * This function find will by default return the best match to
+   * the given signature, possibly employing type conversions (and returning
+   * a function that will perform those conversions as needed). The
+   * (optional) third argument is a plain object giving options contolling
+   * the signature search. Currently only the option `exact` is implemented,
+   * which defaults to "false". If `exact` is specified as true, then only
+   * exact matches will be returned (i.e. signatures for which `fn` was
+   * directly defined). Uses of `any` and `...TYPE` are considered exact if
+   * no conversions are necessary to apply the corresponding function.
+   *
+   * @param {Function} fn                   A typed-function
+   * @param {string | string[]} signature
+   *     Signature to be found, can be an array or a comma separated string.
+   * @param {object} options  Controls the signature match as documented
+   * @return {function}
+   *     Returns the function to call for the given signature, or throws an
+   *     error if no match is found.
+   */
+  function find(fn, signature, options) {
+    return findSignature(fn, signature, options).implementation;
+  }
+
+  /**
+   * Convert a given value to another data type, specified by type name.
+   *
+   * @param {*} value
+   * @param {string} typeName
+   */
+  function convert(value, typeName) {
+    // check conversion is needed
+    const type = findType(typeName);
+    if (type.test(value)) {
+      return value;
+    }
+    const conversions = type.conversionsTo;
+    if (conversions.length === 0) {
+      throw new Error('There are no conversions to ' + typeName + ' defined.');
+    }
+    for (let i = 0; i < conversions.length; i++) {
+      const fromType = findType(conversions[i].from);
+      if (fromType.test(value)) {
+        return conversions[i].convert(value);
+      }
+    }
+    throw new Error('Cannot convert ' + value + ' to ' + typeName);
+  }
+
+  /**
+   * Stringify parameters in a normalized way
+   * @param {Param[]} params
+   * @param {string} [','] separator
+   * @return {string}
+   */
+  function stringifyParams(params) {
+    let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';
+    return params.map(p => p.name).join(separator);
+  }
+
+  /**
+   * Parse a parameter, like "...number | boolean"
+   * @param {string} param
+   * @return {Param} param
+   */
+  function parseParam(param) {
+    const restParam = param.indexOf('...') === 0;
+    const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';
+    const typeDefs = types.split('|').map(s => findType(s.trim()));
+    let hasAny = false;
+    let paramName = restParam ? '...' : '';
+    const exactTypes = typeDefs.map(function (type) {
+      hasAny = type.isAny || hasAny;
+      paramName += type.name + '|';
+      return {
+        name: type.name,
+        typeIndex: type.index,
+        test: type.test,
+        isAny: type.isAny,
+        conversion: null,
+        conversionIndex: -1
+      };
+    });
+    return {
+      types: exactTypes,
+      name: paramName.slice(0, -1),
+      // remove trailing '|' from above
+      hasAny,
+      hasConversion: false,
+      restParam
+    };
+  }
+
+  /**
+   * Expands a parsed parameter with the types available from currently
+   * defined conversions.
+   * @param {Param} param
+   * @return {Param} param
+   */
+  function expandParam(param) {
+    const typeNames = param.types.map(t => t.name);
+    const matchingConversions = availableConversions(typeNames);
+    let hasAny = param.hasAny;
+    let newName = param.name;
+    const convertibleTypes = matchingConversions.map(function (conversion) {
+      const type = findType(conversion.from);
+      hasAny = type.isAny || hasAny;
+      newName += '|' + conversion.from;
+      return {
+        name: conversion.from,
+        typeIndex: type.index,
+        test: type.test,
+        isAny: type.isAny,
+        conversion,
+        conversionIndex: conversion.index
+      };
+    });
+    return {
+      types: param.types.concat(convertibleTypes),
+      name: newName,
+      hasAny,
+      hasConversion: convertibleTypes.length > 0,
+      restParam: param.restParam
+    };
+  }
+
+  /**
+   * Return the set of type names in a parameter.
+   * Caches the result for efficiency
+   *
+   * @param {Param} param
+   * @return {Set<string>} typenames
+   */
+  function paramTypeSet(param) {
+    if (!param.typeSet) {
+      param.typeSet = new Set();
+      param.types.forEach(type => param.typeSet.add(type.name));
+    }
+    return param.typeSet;
+  }
+
+  /**
+   * Parse a signature with comma separated parameters,
+   * like "number | boolean, ...string"
+   *
+   * @param {string} signature
+   * @return {Param[]} params
+   */
+  function parseSignature(rawSignature) {
+    const params = [];
+    if (typeof rawSignature !== 'string') {
+      throw new TypeError('Signatures must be strings');
+    }
+    const signature = rawSignature.trim();
+    if (signature === '') {
+      return params;
+    }
+    const rawParams = signature.split(',');
+    for (let i = 0; i < rawParams.length; ++i) {
+      const parsedParam = parseParam(rawParams[i].trim());
+      if (parsedParam.restParam && i !== rawParams.length - 1) {
+        throw new SyntaxError('Unexpected rest parameter "' + rawParams[i] + '": ' + 'only allowed for the last parameter');
+      }
+      // if invalid, short-circuit (all the types may have been filtered)
+      if (parsedParam.types.length === 0) {
+        return null;
+      }
+      params.push(parsedParam);
+    }
+    return params;
+  }
+
+  /**
+   * Test whether a set of params contains a restParam
+   * @param {Param[]} params
+   * @return {boolean} Returns true when the last parameter is a restParam
+   */
+  function hasRestParam(params) {
+    const param = last(params);
+    return param ? param.restParam : false;
+  }
+
+  /**
+   * Create a type test for a single parameter, which can have one or multiple
+   * types.
+   * @param {Param} param
+   * @return {function(x: *) : boolean} Returns a test function
+   */
+  function compileTest(param) {
+    if (!param || param.types.length === 0) {
+      // nothing to do
+      return ok;
+    } else if (param.types.length === 1) {
+      return findType(param.types[0].name).test;
+    } else if (param.types.length === 2) {
+      const test0 = findType(param.types[0].name).test;
+      const test1 = findType(param.types[1].name).test;
+      return function or(x) {
+        return test0(x) || test1(x);
+      };
+    } else {
+      // param.types.length > 2
+      const tests = param.types.map(function (type) {
+        return findType(type.name).test;
+      });
+      return function or(x) {
+        for (let i = 0; i < tests.length; i++) {
+          if (tests[i](x)) {
+            return true;
+          }
+        }
+        return false;
+      };
+    }
+  }
+
+  /**
+   * Create a test for all parameters of a signature
+   * @param {Param[]} params
+   * @return {function(args: Array<*>) : boolean}
+   */
+  function compileTests(params) {
+    let tests, test0, test1;
+    if (hasRestParam(params)) {
+      // variable arguments like '...number'
+      tests = initial(params).map(compileTest);
+      const varIndex = tests.length;
+      const lastTest = compileTest(last(params));
+      const testRestParam = function (args) {
+        for (let i = varIndex; i < args.length; i++) {
+          if (!lastTest(args[i])) {
+            return false;
+          }
+        }
+        return true;
+      };
+      return function testArgs(args) {
+        for (let i = 0; i < tests.length; i++) {
+          if (!tests[i](args[i])) {
+            return false;
+          }
+        }
+        return testRestParam(args) && args.length >= varIndex + 1;
+      };
+    } else {
+      // no variable arguments
+      if (params.length === 0) {
+        return function testArgs(args) {
+          return args.length === 0;
+        };
+      } else if (params.length === 1) {
+        test0 = compileTest(params[0]);
+        return function testArgs(args) {
+          return test0(args[0]) && args.length === 1;
+        };
+      } else if (params.length === 2) {
+        test0 = compileTest(params[0]);
+        test1 = compileTest(params[1]);
+        return function testArgs(args) {
+          return test0(args[0]) && test1(args[1]) && args.length === 2;
+        };
+      } else {
+        // arguments.length > 2
+        tests = params.map(compileTest);
+        return function testArgs(args) {
+          for (let i = 0; i < tests.length; i++) {
+            if (!tests[i](args[i])) {
+              return false;
+            }
+          }
+          return args.length === tests.length;
+        };
+      }
+    }
+  }
+
+  /**
+   * Find the parameter at a specific index of a Params list.
+   * Handles rest parameters.
+   * @param {Param[]} params
+   * @param {number} index
+   * @return {Param | null} Returns the matching parameter when found,
+   *                        null otherwise.
+   */
+  function getParamAtIndex(params, index) {
+    return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;
+  }
+
+  /**
+   * Get all type names of a parameter
+   * @param {Params[]} params
+   * @param {number} index
+   * @return {string[]} Returns an array with type names
+   */
+  function getTypeSetAtIndex(params, index) {
+    const param = getParamAtIndex(params, index);
+    if (!param) {
+      return new Set();
+    }
+    return paramTypeSet(param);
+  }
+
+  /**
+   * Test whether a type is an exact type or conversion
+   * @param {Type} type
+   * @return {boolean} Returns true when
+   */
+  function isExactType(type) {
+    return type.conversion === null || type.conversion === undefined;
+  }
+
+  /**
+   * Helper function for creating error messages: create an array with
+   * all available types on a specific argument index.
+   * @param {Signature[]} signatures
+   * @param {number} index
+   * @return {string[]} Returns an array with available types
+   */
+  function mergeExpectedParams(signatures, index) {
+    const typeSet = new Set();
+    signatures.forEach(signature => {
+      const paramSet = getTypeSetAtIndex(signature.params, index);
+      let name;
+      for (name of paramSet) {
+        typeSet.add(name);
+      }
+    });
+    return typeSet.has('any') ? ['any'] : Array.from(typeSet);
+  }
+
+  /**
+   * Create
+   * @param {string} name             The name of the function
+   * @param {array.<*>} args          The actual arguments passed to the function
+   * @param {Signature[]} signatures  A list with available signatures
+   * @return {TypeError} Returns a type error with additional data
+   *                     attached to it in the property `data`
+   */
+  function createError(name, args, signatures) {
+    let err, expected;
+    const _name = name || 'unnamed';
+
+    // test for wrong type at some index
+    let matchingSignatures = signatures;
+    let index;
+    for (index = 0; index < args.length; index++) {
+      const nextMatchingDefs = [];
+      matchingSignatures.forEach(signature => {
+        const param = getParamAtIndex(signature.params, index);
+        const test = compileTest(param);
+        if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {
+          nextMatchingDefs.push(signature);
+        }
+      });
+      if (nextMatchingDefs.length === 0) {
+        // no matching signatures anymore, throw error "wrong type"
+        expected = mergeExpectedParams(matchingSignatures, index);
+        if (expected.length > 0) {
+          const actualTypes = findTypeNames(args[index]);
+          err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');
+          err.data = {
+            category: 'wrongType',
+            fn: _name,
+            index,
+            actual: actualTypes,
+            expected
+          };
+          return err;
+        }
+      } else {
+        matchingSignatures = nextMatchingDefs;
+      }
+    }
+
+    // test for too few arguments
+    const lengths = matchingSignatures.map(function (signature) {
+      return hasRestParam(signature.params) ? Infinity : signature.params.length;
+    });
+    if (args.length < Math.min.apply(null, lengths)) {
+      expected = mergeExpectedParams(matchingSignatures, index);
+      err = new TypeError('Too few arguments in function ' + _name + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');
+      err.data = {
+        category: 'tooFewArgs',
+        fn: _name,
+        index: args.length,
+        expected
+      };
+      return err;
+    }
+
+    // test for too many arguments
+    const maxLength = Math.max.apply(null, lengths);
+    if (args.length > maxLength) {
+      err = new TypeError('Too many arguments in function ' + _name + ' (expected: ' + maxLength + ', actual: ' + args.length + ')');
+      err.data = {
+        category: 'tooManyArgs',
+        fn: _name,
+        index: args.length,
+        expectedLength: maxLength
+      };
+      return err;
+    }
+
+    // Generic error
+    const argTypes = [];
+    for (let i = 0; i < args.length; ++i) {
+      argTypes.push(findTypeNames(args[i]).join('|'));
+    }
+    err = new TypeError('Arguments of type "' + argTypes.join(', ') + '" do not match any of the defined signatures of function ' + _name + '.');
+    err.data = {
+      category: 'mismatch',
+      actual: argTypes
+    };
+    return err;
+  }
+
+  /**
+   * Find the lowest index of all types of a parameter
+   * @param {Param} param
+   * @return {number} Returns the index of the lowest type in typed.types
+   */
+  function getLowestTypeIndex(param) {
+    let min = typeList.length + 1;
+    for (let i = 0; i < param.types.length; i++) {
+      min = Math.min(min, param.types[i].typeIndex);
+    }
+    return min;
+  }
+
+  /**
+   * Find the lowest index of the conversion of all types of the parameter
+   * having a conversion
+   * @param {Param} param
+   * @return {number} Returns the lowest index of the conversions of this type
+   */
+  function getLowestConversionIndex(param) {
+    let min = nConversions + 1;
+    for (let i = 0; i < param.types.length; i++) {
+      if (!isExactType(param.types[i])) {
+        min = Math.min(min, param.types[i].conversionIndex);
+      }
+    }
+    return min;
+  }
+
+  /**
+   * Compare two params. The return value is a number that is
+   * negative when param1 should be considered first, positive
+   * when param2 should be considered first, and zero when the
+   * params are indistinguishable. Primarily as a debugging aid,
+   * the value is always less than one in absolute value, and
+   * a smaller absolute value indicates a less important distinction
+   * between the parameters.
+   * @param {Param} param1
+   * @param {Param} param2
+   * @return {number} negative, positive, or zero depending on whether
+   *                  param1 should be ordered before, after, or equivalently
+   *                  to param2
+   */
+  function compareParams(param1, param2) {
+    // We compare a number of metrics on a param in turn:
+    // 1) 'any' parameters are the least preferred
+    if (param1.hasAny) {
+      if (!param2.hasAny) {
+        return 0.1;
+      }
+    } else if (param2.hasAny) {
+      return -0.1;
+    }
+
+    // 2) Prefer non-rest to rest parameters
+    if (param1.restParam) {
+      if (!param2.restParam) {
+        return 0.01;
+      }
+    } else if (param2.restParam) {
+      return -0.01;
+    }
+
+    // 3) Prefer lower type index:
+    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);
+    if (typeDiff < 0) {
+      return -0.001;
+    }
+    if (typeDiff > 0) {
+      return 0.001;
+    }
+
+    // 4) Prefer exact type match to conversions, with a strength that
+    //    grows with the conversion index
+    const conv1 = getLowestConversionIndex(param1);
+    const conv2 = getLowestConversionIndex(param2);
+    if (param1.hasConversion) {
+      if (!param2.hasConversion) {
+        return (1 + conv1) * 0.000001;
+      }
+    } else if (param2.hasConversion) {
+      return -(1 + conv2) * 0.000001;
+    }
+
+    // 5) Prefer lower conversion index
+    const convDiff = conv1 - conv2;
+    if (convDiff < 0) {
+      return -0.0000001;
+    }
+    if (convDiff > 0) {
+      return 0.0000001;
+    }
+
+    // Don't have a basis for preference
+    return 0;
+  }
+
+  /**
+   * Compare two signatures. The result is a number that is negative
+   * when the first signature should be preferred to the second, positive
+   * when the second signature should be preferred, and zero in case the
+   * two signatures are essentially equivalent. Primarily as a debugging
+   * aid, a larger absolute value indicates a more "important" difference.
+   *
+   * @param {Signature} signature1
+   * @param {Signature} signature2
+   * @return {number} returns a negative number when signature1 must get a
+   *                  lower index than signature2, a positive number when the
+   *                  opposite holds, or zero when both are equivalent.
+   */
+  function compareSignatures(signature1, signature2) {
+    const pars1 = signature1.params;
+    const pars2 = signature2.params;
+    const last1 = last(pars1);
+    const last2 = last(pars2);
+    const hasRest1 = hasRestParam(pars1);
+    const hasRest2 = hasRestParam(pars2);
+    // We compare a number of metrics on signatures in turn:
+    // 1) An "any rest param" is least preferred
+    if (hasRest1 && last1.hasAny) {
+      if (!hasRest2 || !last2.hasAny) {
+        return 10000000;
+      }
+    } else if (hasRest2 && last2.hasAny) {
+      return -10000000;
+    }
+
+    // 2) Minimize the number of 'any' parameters
+    let any1 = 0;
+    let conv1 = 0;
+    let par;
+    for (par of pars1) {
+      if (par.hasAny) ++any1;
+      if (par.hasConversion) ++conv1;
+    }
+    let any2 = 0;
+    let conv2 = 0;
+    for (par of pars2) {
+      if (par.hasAny) ++any2;
+      if (par.hasConversion) ++conv2;
+    }
+    if (any1 !== any2) {
+      return (any1 - any2) * 1000000;
+    }
+
+    // 3) A conversion rest param is less preferred
+    if (hasRest1 && last1.hasConversion) {
+      if (!hasRest2 || !last2.hasConversion) {
+        return 100000;
+      }
+    } else if (hasRest2 && last2.hasConversion) {
+      return -100000;
+    }
+
+    // 4) Minimize the number of conversions
+    if (conv1 !== conv2) {
+      return (conv1 - conv2) * 10000;
+    }
+
+    // 5) Prefer no rest param
+    if (hasRest1) {
+      if (!hasRest2) {
+        return 1000;
+      }
+    } else if (hasRest2) {
+      return -1000;
+    }
+
+    // 6) Prefer shorter with rest param, longer without
+    const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);
+    if (lengthCriterion !== 0) {
+      return lengthCriterion;
+    }
+
+    // Signatures are identical in each of the above metrics.
+    // In particular, they are the same length.
+    // We can therefore compare the parameters one by one.
+    // First we count which signature has more preferred parameters.
+    const comparisons = [];
+    let tc = 0;
+    for (let i = 0; i < pars1.length; ++i) {
+      const thisComparison = compareParams(pars1[i], pars2[i]);
+      comparisons.push(thisComparison);
+      tc += thisComparison;
+    }
+    if (tc !== 0) {
+      return (tc < 0 ? -10 : 10) + tc;
+    }
+
+    // They have the same number of preferred parameters, so go by the
+    // earliest parameter in which we have a preference.
+    // In other words, dispatch is driven somewhat more by earlier
+    // parameters than later ones.
+    let c;
+    let bonus = 9;
+    const decrement = bonus / (comparisons.length + 1);
+    for (c of comparisons) {
+      if (c !== 0) {
+        return (c < 0 ? -bonus : bonus) + c;
+      }
+      bonus -= decrement;
+    }
+
+    // It's a tossup:
+    return 0;
+  }
+
+  /**
+   * Produce a list of all conversions from distinct types to one of
+   * the given types.
+   *
+   * @param {string[]} typeNames
+   * @return {ConversionDef[]} Returns the conversions that are available
+   *                        resulting in any given type (if any)
+   */
+  function availableConversions(typeNames) {
+    if (typeNames.length === 0) {
+      return [];
+    }
+    const types = typeNames.map(findType);
+    if (typeNames.length === 1) return types[0].conversionsTo;
+
+    // Here, for each type that occurs as the from-type of any conversion
+    // to any of the types found, we must select the conversion of
+    // lowest index from that type. So first collect the types.
+    const knownTypes = new Set(typeNames);
+    const convertibleTypes = new Set();
+    for (let i = 0; i < types.length; ++i) {
+      for (const match of types[i].conversionsTo) {
+        if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);
+      }
+    }
+
+    // Now get the lowest-index conversion for each type
+    const matches = [];
+    for (const typeName of convertibleTypes) {
+      let bestIndex = nConversions + 1;
+      let bestConversion = null;
+      for (let i = 0; i < types.length; ++i) {
+        for (const match of types[i].conversionsTo) {
+          if (match.from === typeName && match.index < bestIndex) {
+            bestIndex = match.index;
+            bestConversion = match;
+          }
+        }
+      }
+      matches.push(bestConversion);
+    }
+    return matches;
+  }
+
+  /**
+   * Preprocess arguments before calling the original function:
+   * - if needed convert the parameters
+   * - in case of rest parameters, move the rest parameters into an Array
+   * @param {Param[]} params
+   * @param {function} fn
+   * @return {function} Returns fn or a wrapped function if needed. If it
+   *                    has conversions, the function will be named to indicate
+   *                    what conversions are occurring.
+   */
+  function compileArgsPreprocessing(params, fn) {
+    let fnConvert = fn;
+
+    // TODO: can we make this wrapper function smarter/simpler?
+
+    let name = '';
+    if (params.some(p => p.hasConversion)) {
+      const restParam = hasRestParam(params);
+      const compiledConversions = params.map(compileArgConversion);
+      name = compiledConversions.map(conv => conv.name).join(';');
+      fnConvert = function convertArgs() {
+        const args = [];
+        const last = restParam ? arguments.length - 1 : arguments.length;
+        for (let i = 0; i < last; i++) {
+          args[i] = compiledConversions[i](arguments[i]);
+        }
+        if (restParam) {
+          args[last] = arguments[last].map(compiledConversions[last]);
+        }
+        return fn.apply(this, args);
+      };
+    }
+    let fnPreprocess = fnConvert;
+    if (hasRestParam(params)) {
+      const offset = params.length - 1;
+      fnPreprocess = function preprocessRestParams() {
+        return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));
+      };
+    }
+    if (name) Object.defineProperty(fnPreprocess, 'name', {
+      value: name
+    });
+    return fnPreprocess;
+  }
+
+  /**
+   * Compile conversion for a parameter to the right type
+   * @param {Param} param
+   * @return {function} Returns the wrapped function that will convert arguments
+   *
+   */
+  function compileArgConversion(param) {
+    let test0, test1, conversion0, conversion1;
+    const tests = [];
+    const conversions = [];
+    let name = '';
+    param.types.forEach(function (type) {
+      if (type.conversion) {
+        name += type.conversion.from + '~>' + type.conversion.to + ',';
+        tests.push(findType(type.conversion.from).test);
+        conversions.push(type.conversion.convert);
+      }
+    });
+    if (name) name = name.slice(0, -1);else name = 'pass';
+
+    // create optimized conversion functions depending on the number of conversions
+    let convertor = arg => arg;
+    switch (conversions.length) {
+      case 0:
+        break;
+      case 1:
+        test0 = tests[0];
+        conversion0 = conversions[0];
+        convertor = function convertArg(arg) {
+          if (test0(arg)) {
+            return conversion0(arg);
+          }
+          return arg;
+        };
+        break;
+      case 2:
+        test0 = tests[0];
+        test1 = tests[1];
+        conversion0 = conversions[0];
+        conversion1 = conversions[1];
+        convertor = function convertArg(arg) {
+          if (test0(arg)) {
+            return conversion0(arg);
+          }
+          if (test1(arg)) {
+            return conversion1(arg);
+          }
+          return arg;
+        };
+        break;
+      default:
+        convertor = function convertArg(arg) {
+          for (let i = 0; i < conversions.length; i++) {
+            if (tests[i](arg)) {
+              return conversions[i](arg);
+            }
+          }
+          return arg;
+        };
+    }
+    Object.defineProperty(convertor, 'name', {
+      value: name
+    });
+    return convertor;
+  }
+
+  /**
+   * Split params with union types in to separate params.
+   *
+   * For example:
+   *
+   *     splitParams([['Array', 'Object'], ['string', 'RegExp'])
+   *     // returns:
+   *     // [
+   *     //   ['Array', 'string'],
+   *     //   ['Array', 'RegExp'],
+   *     //   ['Object', 'string'],
+   *     //   ['Object', 'RegExp']
+   *     // ]
+   *
+   * @param {Param[]} params
+   * @return {Param[]}
+   */
+  function splitParams(params) {
+    function _splitParams(params, index, paramsSoFar) {
+      if (index < params.length) {
+        const param = params[index];
+        let resultingParams = [];
+        if (param.restParam) {
+          // split the types of a rest parameter in two:
+          // one with only exact types, and one with exact types and conversions
+          const exactTypes = param.types.filter(isExactType);
+          if (exactTypes.length < param.types.length) {
+            resultingParams.push({
+              types: exactTypes,
+              name: '...' + exactTypes.map(t => t.name).join('|'),
+              hasAny: exactTypes.some(t => t.isAny),
+              hasConversion: false,
+              restParam: true
+            });
+          }
+          resultingParams.push(param);
+        } else {
+          // split all the types of a regular parameter into one type per param
+          resultingParams = param.types.map(function (type) {
+            return {
+              types: [type],
+              name: type.name,
+              hasAny: type.isAny,
+              hasConversion: type.conversion,
+              restParam: false
+            };
+          });
+        }
+
+        // recurse over the groups with types
+        return flatMap(resultingParams, function (nextParam) {
+          return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));
+        });
+      } else {
+        // we've reached the end of the parameters.
+        return [paramsSoFar];
+      }
+    }
+    return _splitParams(params, 0, []);
+  }
+
+  /**
+   * Test whether two param lists represent conflicting signatures
+   * @param {Param[]} params1
+   * @param {Param[]} params2
+   * @return {boolean} Returns true when the signatures conflict, false otherwise.
+   */
+  function conflicting(params1, params2) {
+    const ii = Math.max(params1.length, params2.length);
+    for (let i = 0; i < ii; i++) {
+      const typeSet1 = getTypeSetAtIndex(params1, i);
+      const typeSet2 = getTypeSetAtIndex(params2, i);
+      let overlap = false;
+      let name;
+      for (name of typeSet2) {
+        if (typeSet1.has(name)) {
+          overlap = true;
+          break;
+        }
+      }
+      if (!overlap) {
+        return false;
+      }
+    }
+    const len1 = params1.length;
+    const len2 = params2.length;
+    const restParam1 = hasRestParam(params1);
+    const restParam2 = hasRestParam(params2);
+    return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;
+  }
+
+  /**
+   * Helper function for `resolveReferences` that returns a copy of
+   * functionList wihe any prior resolutions cleared out, in case we are
+   * recycling signatures from a prior typed function construction.
+   *
+   * @param {Array.<function|typed-reference>} functionList
+   * @return {Array.<function|typed-reference>}
+   */
+  function clearResolutions(functionList) {
+    return functionList.map(fn => {
+      if (isReferToSelf(fn)) {
+        return referToSelf(fn.referToSelf.callback);
+      }
+      if (isReferTo(fn)) {
+        return makeReferTo(fn.referTo.references, fn.referTo.callback);
+      }
+      return fn;
+    });
+  }
+
+  /**
+   * Take a list of references, a list of functions functionList, and a
+   * signatureMap indexing signatures into functionList, and return
+   * the list of resolutions, or a false-y value if they don't all
+   * resolve in a valid way (yet).
+   *
+   * @param {string[]} references
+   * @param {Array<function|typed-reference} functionList
+   * @param {Object.<string, integer>} signatureMap
+   * @return {function[] | false} resolutions
+   */
+  function collectResolutions(references, functionList, signatureMap) {
+    const resolvedReferences = [];
+    let reference;
+    for (reference of references) {
+      let resolution = signatureMap[reference];
+      if (typeof resolution !== 'number') {
+        throw new TypeError('No definition for referenced signature "' + reference + '"');
+      }
+      resolution = functionList[resolution];
+      if (typeof resolution !== 'function') {
+        return false;
+      }
+      resolvedReferences.push(resolution);
+    }
+    return resolvedReferences;
+  }
+
+  /**
+   * Resolve any references in the functionList for the typed function
+   * itself. The signatureMap tells which index in the functionList a
+   * given signature should be mapped to (for use in resolving typed.referTo)
+   * and self provides the destions of a typed.referToSelf.
+   *
+   * @param {Array<function | typed-reference-object>} functionList
+   * @param {Object.<string, function>} signatureMap
+   * @param {function} self  The typed-function itself
+   * @return {Array<function>} The list of resolved functions
+   */
+  function resolveReferences(functionList, signatureMap, self) {
+    const resolvedFunctions = clearResolutions(functionList);
+    const isResolved = new Array(resolvedFunctions.length).fill(false);
+    let leftUnresolved = true;
+    while (leftUnresolved) {
+      leftUnresolved = false;
+      let nothingResolved = true;
+      for (let i = 0; i < resolvedFunctions.length; ++i) {
+        if (isResolved[i]) continue;
+        const fn = resolvedFunctions[i];
+        if (isReferToSelf(fn)) {
+          resolvedFunctions[i] = fn.referToSelf.callback(self);
+          // Preserve reference in case signature is reused someday:
+          resolvedFunctions[i].referToSelf = fn.referToSelf;
+          isResolved[i] = true;
+          nothingResolved = false;
+        } else if (isReferTo(fn)) {
+          const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);
+          if (resolvedReferences) {
+            resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);
+            // Preserve reference in case signature is reused someday:
+            resolvedFunctions[i].referTo = fn.referTo;
+            isResolved[i] = true;
+            nothingResolved = false;
+          } else {
+            leftUnresolved = true;
+          }
+        }
+      }
+      if (nothingResolved && leftUnresolved) {
+        throw new SyntaxError('Circular reference detected in resolving typed.referTo');
+      }
+    }
+    return resolvedFunctions;
+  }
+
+  /**
+   * Validate whether any of the function bodies contains a self-reference
+   * usage like `this(...)` or `this.signatures`. This self-referencing is
+   * deprecated since typed-function v3. It has been replaced with
+   * the functions typed.referTo and typed.referToSelf.
+   * @param {Object.<string, function>} signaturesMap
+   */
+  function validateDeprecatedThis(signaturesMap) {
+    // TODO: remove this deprecation warning logic some day (it's introduced in v3)
+
+    // match occurrences like 'this(' and 'this.signatures'
+    const deprecatedThisRegex = /\bthis(\(|\.signatures\b)/;
+    Object.keys(signaturesMap).forEach(signature => {
+      const fn = signaturesMap[signature];
+      if (deprecatedThisRegex.test(fn.toString())) {
+        throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');
+      }
+    });
+  }
+
+  /**
+   * Create a typed function
+   * @param {String} name               The name for the typed function
+   * @param {Object.<string, function>} rawSignaturesMap
+   *                                    An object with one or
+   *                                    multiple signatures as key, and the
+   *                                    function corresponding to the
+   *                                    signature as value.
+   * @return {function}  Returns the created typed function.
+   */
+  function createTypedFunction(name, rawSignaturesMap) {
+    typed.createCount++;
+    if (Object.keys(rawSignaturesMap).length === 0) {
+      throw new SyntaxError('No signatures provided');
+    }
+    if (typed.warnAgainstDeprecatedThis) {
+      validateDeprecatedThis(rawSignaturesMap);
+    }
+
+    // Main processing loop for signatures
+    const parsedParams = [];
+    const originalFunctions = [];
+    const signaturesMap = {};
+    const preliminarySignatures = []; // may have duplicates from conversions
+    let signature;
+    for (signature in rawSignaturesMap) {
+      // A) Protect against polluted Object prototype:
+      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {
+        continue;
+      }
+      // B) Parse the signature
+      const params = parseSignature(signature);
+      if (!params) continue;
+      // C) Check for conflicts
+      parsedParams.forEach(function (pp) {
+        if (conflicting(pp, params)) {
+          throw new TypeError('Conflicting signatures "' + stringifyParams(pp) + '" and "' + stringifyParams(params) + '".');
+        }
+      });
+      parsedParams.push(params);
+      // D) Store the provided function and add conversions
+      const functionIndex = originalFunctions.length;
+      originalFunctions.push(rawSignaturesMap[signature]);
+      const conversionParams = params.map(expandParam);
+      // E) Split the signatures and collect them up
+      let sp;
+      for (sp of splitParams(conversionParams)) {
+        const spName = stringifyParams(sp);
+        preliminarySignatures.push({
+          params: sp,
+          name: spName,
+          fn: functionIndex
+        });
+        if (sp.every(p => !p.hasConversion)) {
+          signaturesMap[spName] = functionIndex;
+        }
+      }
+    }
+    preliminarySignatures.sort(compareSignatures);
+
+    // Note the forward reference to theTypedFn
+    const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);
+
+    // Fill in the proper function for each signature
+    let s;
+    for (s in signaturesMap) {
+      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {
+        signaturesMap[s] = resolvedFunctions[signaturesMap[s]];
+      }
+    }
+    const signatures = [];
+    const internalSignatureMap = new Map(); // benchmarks faster than object
+    for (s of preliminarySignatures) {
+      // Note it's only safe to eliminate duplicates like this
+      // _after_ the signature sorting step above; otherwise we might
+      // remove the wrong one.
+      if (!internalSignatureMap.has(s.name)) {
+        s.fn = resolvedFunctions[s.fn];
+        signatures.push(s);
+        internalSignatureMap.set(s.name, s);
+      }
+    }
+
+    // we create a highly optimized checks for the first couple of signatures with max 2 arguments
+    const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);
+    const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);
+    const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);
+    const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);
+    const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);
+    const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);
+    const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;
+
+    // compile the tests
+    for (let i = 0; i < signatures.length; ++i) {
+      signatures[i].test = compileTests(signatures[i].params);
+    }
+    const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;
+    const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;
+    const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;
+    const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;
+    const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;
+    const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;
+    const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;
+    const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;
+    const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;
+    const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;
+    const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;
+    const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;
+
+    // compile the functions
+    for (let i = 0; i < signatures.length; ++i) {
+      signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);
+    }
+    const fn0 = ok0 ? signatures[0].implementation : undef;
+    const fn1 = ok1 ? signatures[1].implementation : undef;
+    const fn2 = ok2 ? signatures[2].implementation : undef;
+    const fn3 = ok3 ? signatures[3].implementation : undef;
+    const fn4 = ok4 ? signatures[4].implementation : undef;
+    const fn5 = ok5 ? signatures[5].implementation : undef;
+    const len0 = ok0 ? signatures[0].params.length : -1;
+    const len1 = ok1 ? signatures[1].params.length : -1;
+    const len2 = ok2 ? signatures[2].params.length : -1;
+    const len3 = ok3 ? signatures[3].params.length : -1;
+    const len4 = ok4 ? signatures[4].params.length : -1;
+    const len5 = ok5 ? signatures[5].params.length : -1;
+
+    // simple and generic, but also slow
+    const iStart = allOk ? 6 : 0;
+    const iEnd = signatures.length;
+    // de-reference ahead for execution speed:
+    const tests = signatures.map(s => s.test);
+    const fns = signatures.map(s => s.implementation);
+    const generic = function generic() {
+      'use strict';
+
+      for (let i = iStart; i < iEnd; i++) {
+        if (tests[i](arguments)) {
+          return fns[i].apply(this, arguments);
+        }
+      }
+      return typed.onMismatch(name, arguments, signatures);
+    };
+
+    // create the typed function
+    // fast, specialized version. Falls back to the slower, generic one if needed
+    function theTypedFn(arg0, arg1) {
+      'use strict';
+
+      if (arguments.length === len0 && test00(arg0) && test01(arg1)) {
+        return fn0.apply(this, arguments);
+      }
+      if (arguments.length === len1 && test10(arg0) && test11(arg1)) {
+        return fn1.apply(this, arguments);
+      }
+      if (arguments.length === len2 && test20(arg0) && test21(arg1)) {
+        return fn2.apply(this, arguments);
+      }
+      if (arguments.length === len3 && test30(arg0) && test31(arg1)) {
+        return fn3.apply(this, arguments);
+      }
+      if (arguments.length === len4 && test40(arg0) && test41(arg1)) {
+        return fn4.apply(this, arguments);
+      }
+      if (arguments.length === len5 && test50(arg0) && test51(arg1)) {
+        return fn5.apply(this, arguments);
+      }
+      return generic.apply(this, arguments);
+    }
+
+    // attach name the typed function
+    try {
+      Object.defineProperty(theTypedFn, 'name', {
+        value: name
+      });
+    } catch (err) {
+      // old browsers do not support Object.defineProperty and some don't support setting the name property
+      // the function name is not essential for the functioning, it's mostly useful for debugging,
+      // so it's fine to have unnamed functions.
+    }
+
+    // attach signatures to the function.
+    // This property is close to the original collection of signatures
+    // used to create the typed-function, just with unions split:
+    theTypedFn.signatures = signaturesMap;
+
+    // Store internal data for functions like resolve, find, etc.
+    // Also serves as the flag that this is a typed-function
+    theTypedFn._typedFunctionData = {
+      signatures,
+      signatureMap: internalSignatureMap
+    };
+    return theTypedFn;
+  }
+
+  /**
+   * Action to take on mismatch
+   * @param {string} name      Name of function that was attempted to be called
+   * @param {Array} args       Actual arguments to the call
+   * @param {Array} signatures Known signatures of the named typed-function
+   */
+  function _onMismatch(name, args, signatures) {
+    throw createError(name, args, signatures);
+  }
+
+  /**
+   * Return all but the last items of an array or function Arguments
+   * @param {Array | Arguments} arr
+   * @return {Array}
+   */
+  function initial(arr) {
+    return slice(arr, 0, arr.length - 1);
+  }
+
+  /**
+   * return the last item of an array or function Arguments
+   * @param {Array | Arguments} arr
+   * @return {*}
+   */
+  function last(arr) {
+    return arr[arr.length - 1];
+  }
+
+  /**
+   * Slice an array or function Arguments
+   * @param {Array | Arguments | IArguments} arr
+   * @param {number} start
+   * @param {number} [end]
+   * @return {Array}
+   */
+  function slice(arr, start, end) {
+    return Array.prototype.slice.call(arr, start, end);
+  }
+
+  /**
+   * Return the first item from an array for which test(arr[i]) returns true
+   * @param {Array} arr
+   * @param {function} test
+   * @return {* | undefined} Returns the first matching item
+   *                         or undefined when there is no match
+   */
+  function findInArray(arr, test) {
+    for (let i = 0; i < arr.length; i++) {
+      if (test(arr[i])) {
+        return arr[i];
+      }
+    }
+    return undefined;
+  }
+
+  /**
+   * Flat map the result invoking a callback for every item in an array.
+   * https://gist.github.com/samgiles/762ee337dff48623e729
+   * @param {Array} arr
+   * @param {function} callback
+   * @return {Array}
+   */
+  function flatMap(arr, callback) {
+    return Array.prototype.concat.apply([], arr.map(callback));
+  }
+
+  /**
+   * Create a reference callback to one or multiple signatures
+   *
+   * Syntax:
+   *
+   *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {
+   *       // ...
+   *     })
+   *
+   * @returns {{referTo: {references: string[], callback}}}
+   */
+  function referTo() {
+    const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));
+    const callback = last(arguments);
+    if (typeof callback !== 'function') {
+      throw new TypeError('Callback function expected as last argument');
+    }
+    return makeReferTo(references, callback);
+  }
+  function makeReferTo(references, callback) {
+    return {
+      referTo: {
+        references,
+        callback
+      }
+    };
+  }
+
+  /**
+   * Create a reference callback to the typed-function itself
+   *
+   * @param {(self: function) => function} callback
+   * @returns {{referToSelf: { callback: function }}}
+   */
+  function referToSelf(callback) {
+    if (typeof callback !== 'function') {
+      throw new TypeError('Callback function expected as first argument');
+    }
+    return {
+      referToSelf: {
+        callback
+      }
+    };
+  }
+
+  /**
+   * Test whether something is a referTo object, holding a list with reference
+   * signatures and a callback.
+   *
+   * @param {Object | function} objectOrFn
+   * @returns {boolean}
+   */
+  function isReferTo(objectOrFn) {
+    return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';
+  }
+
+  /**
+   * Test whether something is a referToSelf object, holding a callback where
+   * to pass `self`.
+   *
+   * @param {Object | function} objectOrFn
+   * @returns {boolean}
+   */
+  function isReferToSelf(objectOrFn) {
+    return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';
+  }
+
+  /**
+   * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw
+   * an error in case (C).
+   *
+   * @param { string | undefined } nameSoFar
+   * @param { string | undefined } newName
+   * @returns { string } updated name
+   */
+  function checkName(nameSoFar, newName) {
+    if (!nameSoFar) {
+      return newName;
+    }
+    if (newName && newName !== nameSoFar) {
+      const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');
+      err.data = {
+        actual: newName,
+        expected: nameSoFar
+      };
+      throw err;
+    }
+    return nameSoFar;
+  }
+
+  /**
+   * Retrieve the implied name from an object with signature keys
+   * and function values, checking whether all value names match
+   *
+   * @param { {string: function} } obj
+   */
+  function getObjectName(obj) {
+    let name;
+    for (const key in obj) {
+      // Only pay attention to own properties, and only if their values
+      // are typed functions or functions with a signature property
+      if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {
+        name = checkName(name, obj[key].name);
+      }
+    }
+    return name;
+  }
+
+  /**
+   * Copy all of the signatures from the second argument into the first,
+   * which is modified by side effect, checking for conflicts
+   *
+   * @param {Object.<string, function|typed-reference>} dest
+   * @param {Object.<string, function|typed-reference>} source
+   */
+  function mergeSignatures(dest, source) {
+    let key;
+    for (key in source) {
+      if (Object.prototype.hasOwnProperty.call(source, key)) {
+        if (key in dest) {
+          if (source[key] !== dest[key]) {
+            const err = new Error('Signature "' + key + '" is defined twice');
+            err.data = {
+              signature: key,
+              sourceFunction: source[key],
+              destFunction: dest[key]
+            };
+            throw err;
+          }
+          // else: both signatures point to the same function, that's fine
+        }
+        dest[key] = source[key];
+      }
+    }
+  }
+  const saveTyped = typed;
+
+  /**
+   * Originally the main function was a typed function itself, but then
+   * it might not be able to generate error messages if the client
+   * replaced the type system with different names.
+   *
+   * Main entry: typed([name], functions/objects with signatures...)
+   *
+   * Assembles and returns a new typed-function from the given items
+   * that provide signatures and implementations, each of which may be
+   * * a plain object mapping (string) signatures to implementing functions,
+   * * a previously constructed typed function, or
+   * * any other single function with a string-valued property `signature`.
+    * The name of the resulting typed-function will be given by the
+   * string-valued name argument if present, or if not, by the name
+   * of any of the arguments that have one, as long as any that do are
+   * consistent with each other. If no name is specified, the name will be
+   * an empty string.
+   *
+   * @param {string} maybeName [optional]
+   * @param {(function|object)[]} signature providers
+   * @returns {typed-function}
+   */
+  typed = function (maybeName) {
+    const named = typeof maybeName === 'string';
+    const start = named ? 1 : 0;
+    let name = named ? maybeName : '';
+    const allSignatures = {};
+    for (let i = start; i < arguments.length; ++i) {
+      const item = arguments[i];
+      let theseSignatures = {};
+      let thisName;
+      if (typeof item === 'function') {
+        thisName = item.name;
+        if (typeof item.signature === 'string') {
+          // Case 1: Ordinary function with a string 'signature' property
+          theseSignatures[item.signature] = item;
+        } else if (isTypedFunction(item)) {
+          // Case 2: Existing typed function
+          theseSignatures = item.signatures;
+        }
+      } else if (isPlainObject(item)) {
+        // Case 3: Plain object, assume keys = signatures, values = functions
+        theseSignatures = item;
+        if (!named) {
+          thisName = getObjectName(item);
+        }
+      }
+      if (Object.keys(theseSignatures).length === 0) {
+        const err = new TypeError('Argument to \'typed\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');
+        err.data = {
+          index: i,
+          argument: item
+        };
+        throw err;
+      }
+      if (!named) {
+        name = checkName(name, thisName);
+      }
+      mergeSignatures(allSignatures, theseSignatures);
+    }
+    return createTypedFunction(name || '', allSignatures);
+  };
+  typed.create = create;
+  typed.createCount = saveTyped.createCount;
+  typed.onMismatch = _onMismatch;
+  typed.throwMismatchError = _onMismatch;
+  typed.createError = createError;
+  typed.clear = clear;
+  typed.clearConversions = clearConversions;
+  typed.addTypes = addTypes;
+  typed._findType = findType; // For unit testing only
+  typed.referTo = referTo;
+  typed.referToSelf = referToSelf;
+  typed.convert = convert;
+  typed.findSignature = findSignature;
+  typed.find = find;
+  typed.isTypedFunction = isTypedFunction;
+  typed.warnAgainstDeprecatedThis = true;
+
+  /**
+   * add a type (convenience wrapper for typed.addTypes)
+   * @param {{name: string, test: function}} type
+   * @param {boolean} [beforeObjectTest=true]
+   *                          If true, the new test will be inserted before
+   *                          the test with name 'Object' (if any), since
+   *                          tests for Object match Array and classes too.
+   */
+  typed.addType = function (type, beforeObjectTest) {
+    let before = 'any';
+    if (beforeObjectTest !== false && typeMap.has('Object')) {
+      before = 'Object';
+    }
+    typed.addTypes([type], before);
+  };
+
+  /**
+   * Verify that the ConversionDef conversion has a valid format.
+   *
+   * @param {conversionDef} conversion
+   * @return {void}
+   * @throws {TypeError|SyntaxError}
+   */
+  function _validateConversion(conversion) {
+    if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {
+      throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');
+    }
+    if (conversion.to === conversion.from) {
+      throw new SyntaxError('Illegal to define conversion from "' + conversion.from + '" to itself.');
+    }
+  }
+
+  /**
+   * Add a conversion
+   *
+   * @param {ConversionDef} conversion
+   * @param {{override: boolean}} [options]
+   * @returns {void}
+   * @throws {TypeError}
+   */
+  typed.addConversion = function (conversion) {
+    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {
+      override: false
+    };
+    _validateConversion(conversion);
+    const to = findType(conversion.to);
+    const existing = to.conversionsTo.find(other => other.from === conversion.from);
+    if (existing) {
+      if (options && options.override) {
+        typed.removeConversion({
+          from: existing.from,
+          to: conversion.to,
+          convert: existing.convert
+        });
+      } else {
+        throw new Error('There is already a conversion from "' + conversion.from + '" to "' + to.name + '"');
+      }
+    }
+    to.conversionsTo.push({
+      from: conversion.from,
+      to: to.name,
+      convert: conversion.convert,
+      index: nConversions++
+    });
+  };
+
+  /**
+   * Convenience wrapper to call addConversion on each conversion in a list.
+   *
+   * @param {ConversionDef[]} conversions
+   * @param {{override: boolean}} [options]
+   * @returns {void}
+   * @throws {TypeError}
+   */
+  typed.addConversions = function (conversions, options) {
+    conversions.forEach(conversion => typed.addConversion(conversion, options));
+  };
+
+  /**
+   * Remove the specified conversion. The format is the same as for
+   * addConversion, and the convert function must match or an error
+   * is thrown.
+   *
+   * @param {{from: string, to: string, convert: function}} conversion
+   * @returns {void}
+   * @throws {TypeError|SyntaxError|Error}
+   */
+  typed.removeConversion = function (conversion) {
+    _validateConversion(conversion);
+    const to = findType(conversion.to);
+    const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);
+    if (!existingConversion) {
+      throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);
+    }
+    if (existingConversion.convert !== conversion.convert) {
+      throw new Error('Conversion to remove does not match existing conversion');
+    }
+    const index = to.conversionsTo.indexOf(existingConversion);
+    to.conversionsTo.splice(index, 1);
+  };
+
+  /**
+   * Produce the specific signature that a typed function
+   * will execute on the given arguments. Here, a "signature" is an
+   * object with properties 'params', 'test', 'fn', and 'implementation'.
+   * This last property is a function that converts params as necessary
+   * and then calls 'fn'. Returns null if there is no matching signature.
+   * @param {typed-function} tf
+   * @param {any[]} argList
+   * @returns {{params: string, test: function, fn: function, implementation: function}}
+   */
+  typed.resolve = function (tf, argList) {
+    if (!isTypedFunction(tf)) {
+      throw new TypeError(NOT_TYPED_FUNCTION);
+    }
+    const sigs = tf._typedFunctionData.signatures;
+    for (let i = 0; i < sigs.length; ++i) {
+      if (sigs[i].test(argList)) {
+        return sigs[i];
+      }
+    }
+    return null;
+  };
+  return typed;
+}
+export default create();
+//# sourceMappingURL=typed-function.mjs.map
\ No newline at end of file
diff --git a/node_modules/typed-function/lib/esm/typed-function.mjs.map b/node_modules/typed-function/lib/esm/typed-function.mjs.map
new file mode 100644
index 0000000..174d702
--- /dev/null
+++ b/node_modules/typed-function/lib/esm/typed-function.mjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"typed-function.mjs","names":["ok","notOk","undef","undefined","NOT_TYPED_FUNCTION","create","isPlainObject","x","constructor","Object","_types","name","test","Array","isArray","Date","RegExp","anyType","isAny","typeMap","typeList","nConversions","typed","createCount","findType","typeName","type","get","message","toLowerCase","otherName","TypeError","addTypes","types","beforeSpec","arguments","length","beforeIndex","index","newTypes","i","has","push","set","conversionsTo","affectedTypes","slice","concat","clear","Map","clearConversions","findTypeNames","value","matches","filter","isTypedFunction","entity","findSignature","fn","signature","options","exact","stringSignature","join","params","parseSignature","canonicalSignature","stringifyParams","signatures","match","_typedFunctionData","signatureMap","nParams","remainingSignatures","want","filteredSignatures","possibility","have","getParamAtIndex","restParam","hasAny","haveTypes","paramTypeSet","some","wtype","candidate","find","implementation","convert","conversions","Error","fromType","from","separator","map","p","parseParam","param","indexOf","typeDefs","split","s","trim","paramName","exactTypes","typeIndex","conversion","conversionIndex","hasConversion","expandParam","typeNames","t","matchingConversions","availableConversions","newName","convertibleTypes","typeSet","Set","forEach","add","rawSignature","rawParams","parsedParam","SyntaxError","hasRestParam","last","compileTest","test0","test1","or","tests","compileTests","initial","varIndex","lastTest","testRestParam","args","testArgs","getTypeSetAtIndex","isExactType","mergeExpectedParams","paramSet","createError","err","expected","_name","matchingSignatures","nextMatchingDefs","actualTypes","data","category","actual","lengths","Infinity","Math","min","apply","maxLength","max","expectedLength","argTypes","getLowestTypeIndex","getLowestConversionIndex","compareParams","param1","param2","typeDiff","conv1","conv2","convDiff","compareSignatures","signature1","signature2","pars1","pars2","last1","last2","hasRest1","hasRest2","any1","par","any2","lengthCriterion","comparisons","tc","thisComparison","c","bonus","decrement","knownTypes","bestIndex","bestConversion","compileArgsPreprocessing","fnConvert","compiledConversions","compileArgConversion","conv","convertArgs","fnPreprocess","offset","preprocessRestParams","defineProperty","conversion0","conversion1","to","convertor","arg","convertArg","splitParams","_splitParams","paramsSoFar","resultingParams","flatMap","nextParam","conflicting","params1","params2","ii","typeSet1","typeSet2","overlap","len1","len2","restParam1","restParam2","clearResolutions","functionList","isReferToSelf","referToSelf","callback","isReferTo","makeReferTo","referTo","references","collectResolutions","resolvedReferences","reference","resolution","resolveReferences","self","resolvedFunctions","isResolved","fill","leftUnresolved","nothingResolved","validateDeprecatedThis","signaturesMap","deprecatedThisRegex","keys","toString","createTypedFunction","rawSignaturesMap","warnAgainstDeprecatedThis","parsedParams","originalFunctions","preliminarySignatures","prototype","hasOwnProperty","call","pp","functionIndex","conversionParams","sp","spName","every","sort","theTypedFn","internalSignatureMap","ok0","ok1","ok2","ok3","ok4","ok5","allOk","test00","test10","test20","test30","test40","test50","test01","test11","test21","test31","test41","test51","fn0","fn1","fn2","fn3","fn4","fn5","len0","len3","len4","len5","iStart","iEnd","fns","generic","onMismatch","arg0","arg1","_onMismatch","arr","start","end","findInArray","objectOrFn","checkName","nameSoFar","getObjectName","obj","key","mergeSignatures","dest","source","sourceFunction","destFunction","saveTyped","maybeName","named","allSignatures","item","theseSignatures","thisName","argument","throwMismatchError","_findType","addType","beforeObjectTest","before","_validateConversion","addConversion","override","existing","other","removeConversion","addConversions","existingConversion","splice","resolve","tf","argList","sigs"],"sources":["../../src/typed-function.mjs"],"sourcesContent":["function ok () {\n  return true\n}\n\nfunction notOk () {\n  return false\n}\n\nfunction undef () {\n  return undefined\n}\n\nconst NOT_TYPED_FUNCTION = 'Argument is not a typed-function.'\n\n/**\n * @typedef {{\n *   params: Param[],\n *   fn: function,\n *   test: function,\n *   implementation: function\n * }} Signature\n *\n * @typedef {{\n *   types: Type[],\n *   hasAny: boolean,\n *   hasConversion: boolean,\n *   restParam: boolean\n * }} Param\n *\n * @typedef {{\n *   name: string,\n *   typeIndex: number,\n *   test: function,\n *   isAny: boolean,\n *   conversion?: ConversionDef,\n *   conversionIndex: number,\n * }} Type\n *\n * @typedef {{\n *   from: string,\n *   to: string,\n *   convert: function (*) : *\n * }} ConversionDef\n *\n * @typedef {{\n *   name: string,\n *   test: function(*) : boolean,\n *   isAny?: boolean\n * }} TypeDef\n */\n\n/**\n * @returns {() => function}\n */\nfunction create () {\n  // data type tests\n\n  /**\n   * Returns true if the argument is a non-null \"plain\" object\n   */\n  function isPlainObject (x) {\n    return typeof x === 'object' && x !== null && x.constructor === Object\n  }\n\n  const _types = [\n    { name: 'number', test: function (x) { return typeof x === 'number' } },\n    { name: 'string', test: function (x) { return typeof x === 'string' } },\n    { name: 'boolean', test: function (x) { return typeof x === 'boolean' } },\n    { name: 'Function', test: function (x) { return typeof x === 'function' } },\n    { name: 'Array', test: Array.isArray },\n    { name: 'Date', test: function (x) { return x instanceof Date } },\n    { name: 'RegExp', test: function (x) { return x instanceof RegExp } },\n    { name: 'Object', test: isPlainObject },\n    { name: 'null', test: function (x) { return x === null } },\n    { name: 'undefined', test: function (x) { return x === undefined } }\n  ]\n\n  const anyType = {\n    name: 'any',\n    test: ok,\n    isAny: true\n  }\n\n  // Data structures to track the types. As these are local variables in\n  // create(), each typed universe will get its own copy, but the variables\n  // will only be accessible through the (closures of the) functions supplied\n  // as properties of the typed object, not directly.\n  // These will be initialized in clear() below\n  let typeMap // primary store of all types\n  let typeList // Array of just type names, for the sake of ordering\n\n  // And similar data structures for the type conversions:\n  let nConversions = 0\n  // the actual conversions are stored on a property of the destination types\n\n  // This is a temporary object, will be replaced with a function at the end\n  let typed = { createCount: 0 }\n\n  /**\n   * Takes a type name and returns the corresponding official type object\n   * for that type.\n   *\n   * @param {string} typeName\n   * @returns {TypeDef} type\n   */\n  function findType (typeName) {\n    const type = typeMap.get(typeName)\n    if (type) {\n      return type\n    }\n    // Remainder is error handling\n    let message = 'Unknown type \"' + typeName + '\"'\n    const name = typeName.toLowerCase()\n    let otherName\n    for (otherName of typeList) {\n      if (otherName.toLowerCase() === name) {\n        message += '. Did you mean \"' + otherName + '\" ?'\n        break\n      }\n    }\n    throw new TypeError(message)\n  }\n\n  /**\n   * Adds an array `types` of type definitions to this typed instance.\n   * Each type definition should be an object with properties:\n   * 'name' - a string giving the name of the type; 'test' - function\n   * returning a boolean that tests membership in the type; and optionally\n   * 'isAny' - true only for the 'any' type.\n   *\n   * The second optional argument, `before`, gives the name of a type that\n   * these types should be added before. The new types are added in the\n   * order specified.\n   * @param {TypeDef[]} types\n   * @param {string | boolean} [beforeSpec='any'] before\n   */\n  function addTypes (types, beforeSpec = 'any') {\n    const beforeIndex = beforeSpec\n      ? findType(beforeSpec).index\n      : typeList.length\n    const newTypes = []\n    for (let i = 0; i < types.length; ++i) {\n      if (!types[i] || typeof types[i].name !== 'string' ||\n        typeof types[i].test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected')\n      }\n      const typeName = types[i].name\n      if (typeMap.has(typeName)) {\n        throw new TypeError('Duplicate type name \"' + typeName + '\"')\n      }\n      newTypes.push(typeName)\n      typeMap.set(typeName, {\n        name: typeName,\n        test: types[i].test,\n        isAny: types[i].isAny,\n        index: beforeIndex + i,\n        conversionsTo: [] // Newly added type can't have any conversions to it\n      })\n    }\n    // update the typeList\n    const affectedTypes = typeList.slice(beforeIndex)\n    typeList =\n      typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes)\n    // Fix the indices\n    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n      typeMap.get(typeList[i]).index = i\n    }\n  }\n\n  /**\n   * Removes all types and conversions from this typed instance.\n   * May cause previously constructed typed-functions to throw\n   * strange errors when they are called with types that do not\n   * match any of their signatures.\n   */\n  function clear () {\n    typeMap = new Map()\n    typeList = []\n    nConversions = 0\n    addTypes([anyType], false)\n  }\n\n  // initialize the types to the default list\n  clear()\n  addTypes(_types)\n\n  /**\n   * Removes all conversions, leaving the types alone.\n   */\n  function clearConversions () {\n    let typeName\n    for (typeName of typeList) {\n      typeMap.get(typeName).conversionsTo = []\n    }\n    nConversions = 0\n  }\n\n  /**\n   * Find the type names that match a value.\n   * @param {*} value\n   * @return {string[]} Array of names of types for which\n   *                  the type test matches the value.\n   */\n  function findTypeNames (value) {\n    const matches = typeList.filter(name => {\n      const type = typeMap.get(name)\n      return !type.isAny && type.test(value)\n    })\n    if (matches.length) {\n      return matches\n    }\n    return ['any']\n  }\n\n  /**\n   * Check if an entity is a typed function created by any instance\n   * @param {any} entity\n   * @returns {boolean}\n   */\n  function isTypedFunction (entity) {\n    return entity && typeof entity === 'function' &&\n      '_typedFunctionData' in entity\n  }\n\n  /**\n   * Find a specific signature from a (composed) typed function, for example:\n   *\n   *   typed.findSignature(fn, ['number', 'string'])\n   *   typed.findSignature(fn, 'number, string')\n   *   typed.findSignature(fn, 'number,string', {exact: true})\n   *\n   * This function findSignature will by default return the best match to\n   * the given signature, possibly employing type conversions.\n   *\n   * The (optional) third argument is a plain object giving options\n   * controlling the signature search. Currently the only implemented\n   * option is `exact`: if specified as true (default is false), only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Note that a (possibly different) type matching\n   * `any`, or one or more instances of TYPE matching `...TYPE` are\n   * considered exact matches in this regard, as no conversions are used.\n   *\n   * This function returns a \"signature\" object, as does `typed.resolve()`,\n   * which is a plain object with four keys: `params` (the array of parameters\n   * for this signature), `fn` (the originally supplied function for this\n   * signature), `test` (a generated function that determines if an argument\n   * list matches this signature, and `implementation` (the function to call\n   * on a matching argument list, that performs conversions if necessary and\n   * then calls the originally supplied function).\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature search as documented\n   * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n   *     Returns the matching signature, or throws an error when no signature\n   *     is found.\n   */\n  function findSignature (fn, signature, options) {\n    if (!isTypedFunction(fn)) {\n      throw new TypeError(NOT_TYPED_FUNCTION)\n    }\n\n    // Canonicalize input\n    const exact = options && options.exact\n    const stringSignature = Array.isArray(signature)\n      ? signature.join(',')\n      : signature\n    const params = parseSignature(stringSignature)\n    const canonicalSignature = stringifyParams(params)\n\n    // First hope we get lucky and exactly match a signature\n    if (!exact || canonicalSignature in fn.signatures) {\n      // OK, we can check the internal signatures\n      const match =\n        fn._typedFunctionData.signatureMap.get(canonicalSignature)\n      if (match) {\n        return match\n      }\n    }\n\n    // Oh well, we did not; so we have to go back and check the parameters\n    // one by one, in order to catch things like `any` and rest params.\n    // Note here we can assume there is at least one parameter, because\n    // the empty signature would have matched successfully above.\n    const nParams = params.length\n    let remainingSignatures\n    if (exact) {\n      remainingSignatures = []\n      let name\n      for (name in fn.signatures) {\n        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name))\n      }\n    } else {\n      remainingSignatures = fn._typedFunctionData.signatures\n    }\n    for (let i = 0; i < nParams; ++i) {\n      const want = params[i]\n      const filteredSignatures = []\n      let possibility\n      for (possibility of remainingSignatures) {\n        const have = getParamAtIndex(possibility.params, i)\n        if (!have || (want.restParam && !have.restParam)) {\n          continue\n        }\n        if (!have.hasAny) {\n          // have to check all of the wanted types are available\n          const haveTypes = paramTypeSet(have)\n          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n            continue\n          }\n        }\n        // OK, this looks good\n        filteredSignatures.push(possibility)\n      }\n      remainingSignatures = filteredSignatures\n      if (remainingSignatures.length === 0) break\n    }\n    // Return the first remaining signature that was totally matched:\n    let candidate\n    for (candidate of remainingSignatures) {\n      if (candidate.params.length <= nParams) {\n        return candidate\n      }\n    }\n\n    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))')\n  }\n\n  /**\n   * Find the proper function to call for a specific signature from\n   * a (composed) typed function, for example:\n   *\n   *   typed.find(fn, ['number', 'string'])\n   *   typed.find(fn, 'number, string')\n   *   typed.find(fn, 'number,string', {exact: true})\n   *\n   * This function find will by default return the best match to\n   * the given signature, possibly employing type conversions (and returning\n   * a function that will perform those conversions as needed). The\n   * (optional) third argument is a plain object giving options contolling\n   * the signature search. Currently only the option `exact` is implemented,\n   * which defaults to \"false\". If `exact` is specified as true, then only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Uses of `any` and `...TYPE` are considered exact if\n   * no conversions are necessary to apply the corresponding function.\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature match as documented\n   * @return {function}\n   *     Returns the function to call for the given signature, or throws an\n   *     error if no match is found.\n   */\n  function find (fn, signature, options) {\n    return findSignature(fn, signature, options).implementation\n  }\n\n  /**\n   * Convert a given value to another data type, specified by type name.\n   *\n   * @param {*} value\n   * @param {string} typeName\n   */\n  function convert (value, typeName) {\n    // check conversion is needed\n    const type = findType(typeName)\n    if (type.test(value)) {\n      return value\n    }\n    const conversions = type.conversionsTo\n    if (conversions.length === 0) {\n      throw new Error(\n        'There are no conversions to ' + typeName + ' defined.')\n    }\n    for (let i = 0; i < conversions.length; i++) {\n      const fromType = findType(conversions[i].from)\n      if (fromType.test(value)) {\n        return conversions[i].convert(value)\n      }\n    }\n\n    throw new Error('Cannot convert ' + value + ' to ' + typeName)\n  }\n\n  /**\n   * Stringify parameters in a normalized way\n   * @param {Param[]} params\n   * @param {string} [','] separator\n   * @return {string}\n   */\n  function stringifyParams (params, separator = ',') {\n    return params.map(p => p.name).join(separator)\n  }\n\n  /**\n   * Parse a parameter, like \"...number | boolean\"\n   * @param {string} param\n   * @return {Param} param\n   */\n  function parseParam (param) {\n    const restParam = param.indexOf('...') === 0\n    const types = (!restParam)\n      ? param\n      : (param.length > 3)\n          ? param.slice(3)\n          : 'any'\n\n    const typeDefs = types.split('|').map(s => findType(s.trim()))\n\n    let hasAny = false\n    let paramName = restParam ? '...' : ''\n\n    const exactTypes = typeDefs.map(function (type) {\n      hasAny = type.isAny || hasAny\n      paramName += type.name + '|'\n\n      return {\n        name: type.name,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion: null,\n        conversionIndex: -1\n      }\n    })\n\n    return {\n      types: exactTypes,\n      name: paramName.slice(0, -1), // remove trailing '|' from above\n      hasAny,\n      hasConversion: false,\n      restParam\n    }\n  }\n\n  /**\n   * Expands a parsed parameter with the types available from currently\n   * defined conversions.\n   * @param {Param} param\n   * @return {Param} param\n   */\n  function expandParam (param) {\n    const typeNames = param.types.map(t => t.name)\n    const matchingConversions = availableConversions(typeNames)\n    let hasAny = param.hasAny\n    let newName = param.name\n\n    const convertibleTypes = matchingConversions.map(function (conversion) {\n      const type = findType(conversion.from)\n      hasAny = type.isAny || hasAny\n      newName += '|' + conversion.from\n\n      return {\n        name: conversion.from,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion,\n        conversionIndex: conversion.index\n      }\n    })\n\n    return {\n      types: param.types.concat(convertibleTypes),\n      name: newName,\n      hasAny,\n      hasConversion: convertibleTypes.length > 0,\n      restParam: param.restParam\n    }\n  }\n\n  /**\n   * Return the set of type names in a parameter.\n   * Caches the result for efficiency\n   *\n   * @param {Param} param\n   * @return {Set<string>} typenames\n   */\n  function paramTypeSet (param) {\n    if (!param.typeSet) {\n      param.typeSet = new Set()\n      param.types.forEach(type => param.typeSet.add(type.name))\n    }\n    return param.typeSet\n  }\n\n  /**\n   * Parse a signature with comma separated parameters,\n   * like \"number | boolean, ...string\"\n   *\n   * @param {string} signature\n   * @return {Param[]} params\n   */\n  function parseSignature (rawSignature) {\n    const params = []\n    if (typeof rawSignature !== 'string') {\n      throw new TypeError('Signatures must be strings')\n    }\n    const signature = rawSignature.trim()\n    if (signature === '') {\n      return params\n    }\n\n    const rawParams = signature.split(',')\n    for (let i = 0; i < rawParams.length; ++i) {\n      const parsedParam = parseParam(rawParams[i].trim())\n      if (parsedParam.restParam && (i !== rawParams.length - 1)) {\n        throw new SyntaxError(\n          'Unexpected rest parameter \"' + rawParams[i] + '\": ' +\n          'only allowed for the last parameter')\n      }\n      // if invalid, short-circuit (all the types may have been filtered)\n      if (parsedParam.types.length === 0) {\n        return null\n      }\n      params.push(parsedParam)\n    }\n\n    return params\n  }\n\n  /**\n   * Test whether a set of params contains a restParam\n   * @param {Param[]} params\n   * @return {boolean} Returns true when the last parameter is a restParam\n   */\n  function hasRestParam (params) {\n    const param = last(params)\n    return param ? param.restParam : false\n  }\n\n  /**\n   * Create a type test for a single parameter, which can have one or multiple\n   * types.\n   * @param {Param} param\n   * @return {function(x: *) : boolean} Returns a test function\n   */\n  function compileTest (param) {\n    if (!param || param.types.length === 0) {\n      // nothing to do\n      return ok\n    } else if (param.types.length === 1) {\n      return findType(param.types[0].name).test\n    } else if (param.types.length === 2) {\n      const test0 = findType(param.types[0].name).test\n      const test1 = findType(param.types[1].name).test\n      return function or (x) {\n        return test0(x) || test1(x)\n      }\n    } else { // param.types.length > 2\n      const tests = param.types.map(function (type) {\n        return findType(type.name).test\n      })\n      return function or (x) {\n        for (let i = 0; i < tests.length; i++) {\n          if (tests[i](x)) {\n            return true\n          }\n        }\n        return false\n      }\n    }\n  }\n\n  /**\n   * Create a test for all parameters of a signature\n   * @param {Param[]} params\n   * @return {function(args: Array<*>) : boolean}\n   */\n  function compileTests (params) {\n    let tests, test0, test1\n\n    if (hasRestParam(params)) {\n      // variable arguments like '...number'\n      tests = initial(params).map(compileTest)\n      const varIndex = tests.length\n      const lastTest = compileTest(last(params))\n      const testRestParam = function (args) {\n        for (let i = varIndex; i < args.length; i++) {\n          if (!lastTest(args[i])) {\n            return false\n          }\n        }\n        return true\n      }\n\n      return function testArgs (args) {\n        for (let i = 0; i < tests.length; i++) {\n          if (!tests[i](args[i])) {\n            return false\n          }\n        }\n        return testRestParam(args) && (args.length >= varIndex + 1)\n      }\n    } else {\n      // no variable arguments\n      if (params.length === 0) {\n        return function testArgs (args) {\n          return args.length === 0\n        }\n      } else if (params.length === 1) {\n        test0 = compileTest(params[0])\n        return function testArgs (args) {\n          return test0(args[0]) && args.length === 1\n        }\n      } else if (params.length === 2) {\n        test0 = compileTest(params[0])\n        test1 = compileTest(params[1])\n        return function testArgs (args) {\n          return test0(args[0]) && test1(args[1]) && args.length === 2\n        }\n      } else { // arguments.length > 2\n        tests = params.map(compileTest)\n        return function testArgs (args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false\n            }\n          }\n          return args.length === tests.length\n        }\n      }\n    }\n  }\n\n  /**\n   * Find the parameter at a specific index of a Params list.\n   * Handles rest parameters.\n   * @param {Param[]} params\n   * @param {number} index\n   * @return {Param | null} Returns the matching parameter when found,\n   *                        null otherwise.\n   */\n  function getParamAtIndex (params, index) {\n    return index < params.length\n      ? params[index]\n      : hasRestParam(params) ? last(params) : null\n  }\n\n  /**\n   * Get all type names of a parameter\n   * @param {Params[]} params\n   * @param {number} index\n   * @return {string[]} Returns an array with type names\n   */\n  function getTypeSetAtIndex (params, index) {\n    const param = getParamAtIndex(params, index)\n    if (!param) {\n      return new Set()\n    }\n    return paramTypeSet(param)\n  }\n\n  /**\n   * Test whether a type is an exact type or conversion\n   * @param {Type} type\n   * @return {boolean} Returns true when\n   */\n  function isExactType (type) {\n    return type.conversion === null || type.conversion === undefined\n  }\n\n  /**\n   * Helper function for creating error messages: create an array with\n   * all available types on a specific argument index.\n   * @param {Signature[]} signatures\n   * @param {number} index\n   * @return {string[]} Returns an array with available types\n   */\n  function mergeExpectedParams (signatures, index) {\n    const typeSet = new Set()\n    signatures.forEach(signature => {\n      const paramSet = getTypeSetAtIndex(signature.params, index)\n      let name\n      for (name of paramSet) {\n        typeSet.add(name)\n      }\n    })\n\n    return typeSet.has('any') ? ['any'] : Array.from(typeSet)\n  }\n\n  /**\n   * Create\n   * @param {string} name             The name of the function\n   * @param {array.<*>} args          The actual arguments passed to the function\n   * @param {Signature[]} signatures  A list with available signatures\n   * @return {TypeError} Returns a type error with additional data\n   *                     attached to it in the property `data`\n   */\n  function createError (name, args, signatures) {\n    let err, expected\n    const _name = name || 'unnamed'\n\n    // test for wrong type at some index\n    let matchingSignatures = signatures\n    let index\n    for (index = 0; index < args.length; index++) {\n      const nextMatchingDefs = []\n      matchingSignatures.forEach(signature => {\n        const param = getParamAtIndex(signature.params, index)\n        const test = compileTest(param)\n        if ((index < signature.params.length ||\n          hasRestParam(signature.params)) &&\n          test(args[index])) {\n          nextMatchingDefs.push(signature)\n        }\n      })\n\n      if (nextMatchingDefs.length === 0) {\n        // no matching signatures anymore, throw error \"wrong type\"\n        expected = mergeExpectedParams(matchingSignatures, index)\n        if (expected.length > 0) {\n          const actualTypes = findTypeNames(args[index])\n\n          err = new TypeError('Unexpected type of argument in function ' + _name +\n            ' (expected: ' + expected.join(' or ') +\n            ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')')\n          err.data = {\n            category: 'wrongType',\n            fn: _name,\n            index,\n            actual: actualTypes,\n            expected\n          }\n          return err\n        }\n      } else {\n        matchingSignatures = nextMatchingDefs\n      }\n    }\n\n    // test for too few arguments\n    const lengths = matchingSignatures.map(function (signature) {\n      return hasRestParam(signature.params)\n        ? Infinity\n        : signature.params.length\n    })\n    if (args.length < Math.min.apply(null, lengths)) {\n      expected = mergeExpectedParams(matchingSignatures, index)\n      err = new TypeError('Too few arguments in function ' + _name +\n        ' (expected: ' + expected.join(' or ') +\n        ', index: ' + args.length + ')')\n      err.data = {\n        category: 'tooFewArgs',\n        fn: _name,\n        index: args.length,\n        expected\n      }\n      return err\n    }\n\n    // test for too many arguments\n    const maxLength = Math.max.apply(null, lengths)\n    if (args.length > maxLength) {\n      err = new TypeError('Too many arguments in function ' + _name +\n        ' (expected: ' + maxLength + ', actual: ' + args.length + ')')\n      err.data = {\n        category: 'tooManyArgs',\n        fn: _name,\n        index: args.length,\n        expectedLength: maxLength\n      }\n      return err\n    }\n\n    // Generic error\n    const argTypes = []\n    for (let i = 0; i < args.length; ++i) {\n      argTypes.push(findTypeNames(args[i]).join('|'))\n    }\n    err = new TypeError('Arguments of type \"' + argTypes.join(', ') +\n      '\" do not match any of the defined signatures of function ' + _name + '.')\n    err.data = {\n      category: 'mismatch',\n      actual: argTypes\n    }\n    return err\n  }\n\n  /**\n   * Find the lowest index of all types of a parameter\n   * @param {Param} param\n   * @return {number} Returns the index of the lowest type in typed.types\n   */\n  function getLowestTypeIndex (param) {\n    let min = typeList.length + 1\n\n    for (let i = 0; i < param.types.length; i++) {\n      min = Math.min(min, param.types[i].typeIndex)\n    }\n\n    return min\n  }\n\n  /**\n   * Find the lowest index of the conversion of all types of the parameter\n   * having a conversion\n   * @param {Param} param\n   * @return {number} Returns the lowest index of the conversions of this type\n   */\n  function getLowestConversionIndex (param) {\n    let min = nConversions + 1\n\n    for (let i = 0; i < param.types.length; i++) {\n      if (!isExactType(param.types[i])) {\n        min = Math.min(min, param.types[i].conversionIndex)\n      }\n    }\n\n    return min\n  }\n\n  /**\n   * Compare two params. The return value is a number that is\n   * negative when param1 should be considered first, positive\n   * when param2 should be considered first, and zero when the\n   * params are indistinguishable. Primarily as a debugging aid,\n   * the value is always less than one in absolute value, and\n   * a smaller absolute value indicates a less important distinction\n   * between the parameters.\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} negative, positive, or zero depending on whether\n   *                  param1 should be ordered before, after, or equivalently\n   *                  to param2\n   */\n  function compareParams (param1, param2) {\n    // We compare a number of metrics on a param in turn:\n    // 1) 'any' parameters are the least preferred\n    if (param1.hasAny) {\n      if (!param2.hasAny) {\n        return 0.1\n      }\n    } else if (param2.hasAny) {\n      return -0.1\n    }\n\n    // 2) Prefer non-rest to rest parameters\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 0.01\n      }\n    } else if (param2.restParam) {\n      return -0.01\n    }\n\n    // 3) Prefer lower type index:\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2)\n    if (typeDiff < 0) {\n      return -0.001\n    }\n    if (typeDiff > 0) {\n      return 0.001\n    }\n\n    // 4) Prefer exact type match to conversions, with a strength that\n    //    grows with the conversion index\n    const conv1 = getLowestConversionIndex(param1)\n    const conv2 = getLowestConversionIndex(param2)\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return (1 + conv1) * 0.000001\n      }\n    } else if (param2.hasConversion) {\n      return -(1 + conv2) * 0.000001\n    }\n\n    // 5) Prefer lower conversion index\n    const convDiff = conv1 - conv2\n    if (convDiff < 0) {\n      return -0.0000001\n    }\n    if (convDiff > 0) {\n      return 0.0000001\n    }\n\n    // Don't have a basis for preference\n    return 0\n  }\n\n  /**\n   * Compare two signatures. The result is a number that is negative\n   * when the first signature should be preferred to the second, positive\n   * when the second signature should be preferred, and zero in case the\n   * two signatures are essentially equivalent. Primarily as a debugging\n   * aid, a larger absolute value indicates a more \"important\" difference.\n   *\n   * @param {Signature} signature1\n   * @param {Signature} signature2\n   * @return {number} returns a negative number when signature1 must get a\n   *                  lower index than signature2, a positive number when the\n   *                  opposite holds, or zero when both are equivalent.\n   */\n  function compareSignatures (signature1, signature2) {\n    const pars1 = signature1.params\n    const pars2 = signature2.params\n    const last1 = last(pars1)\n    const last2 = last(pars2)\n    const hasRest1 = hasRestParam(pars1)\n    const hasRest2 = hasRestParam(pars2)\n    // We compare a number of metrics on signatures in turn:\n    // 1) An \"any rest param\" is least preferred\n    if (hasRest1 && last1.hasAny) {\n      if (!hasRest2 || !last2.hasAny) {\n        return 10000000\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -10000000\n    }\n\n    // 2) Minimize the number of 'any' parameters\n    let any1 = 0\n    let conv1 = 0\n    let par\n    for (par of pars1) {\n      if (par.hasAny) ++any1\n      if (par.hasConversion) ++conv1\n    }\n    let any2 = 0\n    let conv2 = 0\n    for (par of pars2) {\n      if (par.hasAny) ++any2\n      if (par.hasConversion) ++conv2\n    }\n    if (any1 !== any2) {\n      return (any1 - any2) * 1000000\n    }\n\n    // 3) A conversion rest param is less preferred\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 100000\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -100000\n    }\n\n    // 4) Minimize the number of conversions\n    if (conv1 !== conv2) {\n      return (conv1 - conv2) * 10000\n    }\n\n    // 5) Prefer no rest param\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1000\n      }\n    } else if (hasRest2) {\n      return -1000\n    }\n\n    // 6) Prefer shorter with rest param, longer without\n    const lengthCriterion =\n      (pars1.length - pars2.length) * (hasRest1 ? -100 : 100)\n    if (lengthCriterion !== 0) {\n      return lengthCriterion\n    }\n\n    // Signatures are identical in each of the above metrics.\n    // In particular, they are the same length.\n    // We can therefore compare the parameters one by one.\n    // First we count which signature has more preferred parameters.\n    const comparisons = []\n    let tc = 0\n    for (let i = 0; i < pars1.length; ++i) {\n      const thisComparison = compareParams(pars1[i], pars2[i])\n      comparisons.push(thisComparison)\n      tc += thisComparison\n    }\n    if (tc !== 0) {\n      return ((tc < 0) ? -10 : 10) + tc\n    }\n\n    // They have the same number of preferred parameters, so go by the\n    // earliest parameter in which we have a preference.\n    // In other words, dispatch is driven somewhat more by earlier\n    // parameters than later ones.\n    let c\n    let bonus = 9\n    const decrement = bonus / (comparisons.length + 1)\n    for (c of comparisons) {\n      if (c !== 0) {\n        return ((c < 0) ? -bonus : bonus) + c\n      }\n      bonus -= decrement\n    }\n\n    // It's a tossup:\n    return 0\n  }\n\n  /**\n   * Produce a list of all conversions from distinct types to one of\n   * the given types.\n   *\n   * @param {string[]} typeNames\n   * @return {ConversionDef[]} Returns the conversions that are available\n   *                        resulting in any given type (if any)\n   */\n  function availableConversions (typeNames) {\n    if (typeNames.length === 0) {\n      return []\n    }\n    const types = typeNames.map(findType)\n    if (typeNames.length === 1) return types[0].conversionsTo\n\n    // Here, for each type that occurs as the from-type of any conversion\n    // to any of the types found, we must select the conversion of\n    // lowest index from that type. So first collect the types.\n    const knownTypes = new Set(typeNames)\n    const convertibleTypes = new Set()\n    for (let i = 0; i < types.length; ++i) {\n      for (const match of types[i].conversionsTo) {\n        if (!knownTypes.has(match.from)) convertibleTypes.add(match.from)\n      }\n    }\n\n    // Now get the lowest-index conversion for each type\n    const matches = []\n    for (const typeName of convertibleTypes) {\n      let bestIndex = nConversions + 1\n      let bestConversion = null\n      for (let i = 0; i < types.length; ++i) {\n        for (const match of types[i].conversionsTo) {\n          if (match.from === typeName && match.index < bestIndex) {\n            bestIndex = match.index\n            bestConversion = match\n          }\n        }\n      }\n      matches.push(bestConversion)\n    }\n\n    return matches\n  }\n\n  /**\n   * Preprocess arguments before calling the original function:\n   * - if needed convert the parameters\n   * - in case of rest parameters, move the rest parameters into an Array\n   * @param {Param[]} params\n   * @param {function} fn\n   * @return {function} Returns fn or a wrapped function if needed. If it\n   *                    has conversions, the function will be named to indicate\n   *                    what conversions are occurring.\n   */\n  function compileArgsPreprocessing (params, fn) {\n    let fnConvert = fn\n\n    // TODO: can we make this wrapper function smarter/simpler?\n\n    let name = ''\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params)\n      const compiledConversions = params.map(compileArgConversion)\n      name = compiledConversions.map(conv => conv.name).join(';')\n      fnConvert = function convertArgs () {\n        const args = []\n        const last = restParam ? arguments.length - 1 : arguments.length\n        for (let i = 0; i < last; i++) {\n          args[i] = compiledConversions[i](arguments[i])\n        }\n        if (restParam) {\n          args[last] = arguments[last].map(compiledConversions[last])\n        }\n\n        return fn.apply(this, args)\n      }\n    }\n\n    let fnPreprocess = fnConvert\n    if (hasRestParam(params)) {\n      const offset = params.length - 1\n\n      fnPreprocess = function preprocessRestParams () {\n        return fnConvert.apply(this,\n          slice(arguments, 0, offset).concat([slice(arguments, offset)]))\n      }\n    }\n    if (name) Object.defineProperty(fnPreprocess, 'name', { value: name })\n    return fnPreprocess\n  }\n\n  /**\n   * Compile conversion for a parameter to the right type\n   * @param {Param} param\n   * @return {function} Returns the wrapped function that will convert arguments\n   *\n   */\n  function compileArgConversion (param) {\n    let test0, test1, conversion0, conversion1\n    const tests = []\n    const conversions = []\n    let name = ''\n    param.types.forEach(function (type) {\n      if (type.conversion) {\n        name += type.conversion.from + '~>' + type.conversion.to + ','\n        tests.push(findType(type.conversion.from).test)\n        conversions.push(type.conversion.convert)\n      }\n    })\n    if (name) name = name.slice(0, -1)\n    else name = 'pass'\n\n    // create optimized conversion functions depending on the number of conversions\n    let convertor = arg => arg\n    switch (conversions.length) {\n      case 0: break\n      case 1:\n        test0 = tests[0]\n        conversion0 = conversions[0]\n        convertor = function convertArg (arg) {\n          if (test0(arg)) {\n            return conversion0(arg)\n          }\n          return arg\n        }\n        break\n      case 2:\n        test0 = tests[0]\n        test1 = tests[1]\n        conversion0 = conversions[0]\n        conversion1 = conversions[1]\n        convertor = function convertArg (arg) {\n          if (test0(arg)) {\n            return conversion0(arg)\n          }\n          if (test1(arg)) {\n            return conversion1(arg)\n          }\n          return arg\n        }\n        break\n      default:\n        convertor = function convertArg (arg) {\n          for (let i = 0; i < conversions.length; i++) {\n            if (tests[i](arg)) {\n              return conversions[i](arg)\n            }\n          }\n          return arg\n        }\n    }\n    Object.defineProperty(convertor, 'name', { value: name })\n    return convertor\n  }\n\n  /**\n   * Split params with union types in to separate params.\n   *\n   * For example:\n   *\n   *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n   *     // returns:\n   *     // [\n   *     //   ['Array', 'string'],\n   *     //   ['Array', 'RegExp'],\n   *     //   ['Object', 'string'],\n   *     //   ['Object', 'RegExp']\n   *     // ]\n   *\n   * @param {Param[]} params\n   * @return {Param[]}\n   */\n  function splitParams (params) {\n    function _splitParams (params, index, paramsSoFar) {\n      if (index < params.length) {\n        const param = params[index]\n        let resultingParams = []\n\n        if (param.restParam) {\n          // split the types of a rest parameter in two:\n          // one with only exact types, and one with exact types and conversions\n          const exactTypes = param.types.filter(isExactType)\n          if (exactTypes.length < param.types.length) {\n            resultingParams.push({\n              types: exactTypes,\n              name: '...' + exactTypes.map(t => t.name).join('|'),\n              hasAny: exactTypes.some(t => t.isAny),\n              hasConversion: false,\n              restParam: true\n            })\n          }\n          resultingParams.push(param)\n        } else {\n          // split all the types of a regular parameter into one type per param\n          resultingParams = param.types.map(function (type) {\n            return {\n              types: [type],\n              name: type.name,\n              hasAny: type.isAny,\n              hasConversion: type.conversion,\n              restParam: false\n            }\n          })\n        }\n\n        // recurse over the groups with types\n        return flatMap(resultingParams, function (nextParam) {\n          return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]))\n        })\n      } else {\n        // we've reached the end of the parameters.\n        return [paramsSoFar]\n      }\n    }\n\n    return _splitParams(params, 0, [])\n  }\n\n  /**\n   * Test whether two param lists represent conflicting signatures\n   * @param {Param[]} params1\n   * @param {Param[]} params2\n   * @return {boolean} Returns true when the signatures conflict, false otherwise.\n   */\n  function conflicting (params1, params2) {\n    const ii = Math.max(params1.length, params2.length)\n\n    for (let i = 0; i < ii; i++) {\n      const typeSet1 = getTypeSetAtIndex(params1, i)\n      const typeSet2 = getTypeSetAtIndex(params2, i)\n      let overlap = false\n      let name\n      for (name of typeSet2) {\n        if (typeSet1.has(name)) {\n          overlap = true\n          break\n        }\n      }\n      if (!overlap) {\n        return false\n      }\n    }\n\n    const len1 = params1.length\n    const len2 = params2.length\n    const restParam1 = hasRestParam(params1)\n    const restParam2 = hasRestParam(params2)\n\n    return restParam1\n      ? restParam2 ? (len1 === len2) : (len2 >= len1)\n      : restParam2 ? (len1 >= len2) : (len1 === len2)\n  }\n\n  /**\n   * Helper function for `resolveReferences` that returns a copy of\n   * functionList wihe any prior resolutions cleared out, in case we are\n   * recycling signatures from a prior typed function construction.\n   *\n   * @param {Array.<function|typed-reference>} functionList\n   * @return {Array.<function|typed-reference>}\n   */\n  function clearResolutions (functionList) {\n    return functionList.map(fn => {\n      if (isReferToSelf(fn)) {\n        return referToSelf(fn.referToSelf.callback)\n      }\n      if (isReferTo(fn)) {\n        return makeReferTo(fn.referTo.references, fn.referTo.callback)\n      }\n      return fn\n    })\n  }\n\n  /**\n   * Take a list of references, a list of functions functionList, and a\n   * signatureMap indexing signatures into functionList, and return\n   * the list of resolutions, or a false-y value if they don't all\n   * resolve in a valid way (yet).\n   *\n   * @param {string[]} references\n   * @param {Array<function|typed-reference} functionList\n   * @param {Object.<string, integer>} signatureMap\n   * @return {function[] | false} resolutions\n   */\n  function collectResolutions (references, functionList, signatureMap) {\n    const resolvedReferences = []\n    let reference\n    for (reference of references) {\n      let resolution = signatureMap[reference]\n      if (typeof resolution !== 'number') {\n        throw new TypeError(\n          'No definition for referenced signature \"' + reference + '\"')\n      }\n      resolution = functionList[resolution]\n      if (typeof resolution !== 'function') {\n        return false\n      }\n      resolvedReferences.push(resolution)\n    }\n    return resolvedReferences\n  }\n\n  /**\n   * Resolve any references in the functionList for the typed function\n   * itself. The signatureMap tells which index in the functionList a\n   * given signature should be mapped to (for use in resolving typed.referTo)\n   * and self provides the destions of a typed.referToSelf.\n   *\n   * @param {Array<function | typed-reference-object>} functionList\n   * @param {Object.<string, function>} signatureMap\n   * @param {function} self  The typed-function itself\n   * @return {Array<function>} The list of resolved functions\n   */\n  function resolveReferences (functionList, signatureMap, self) {\n    const resolvedFunctions = clearResolutions(functionList)\n    const isResolved = new Array(resolvedFunctions.length).fill(false)\n    let leftUnresolved = true\n    while (leftUnresolved) {\n      leftUnresolved = false\n      let nothingResolved = true\n      for (let i = 0; i < resolvedFunctions.length; ++i) {\n        if (isResolved[i]) continue\n        const fn = resolvedFunctions[i]\n\n        if (isReferToSelf(fn)) {\n          resolvedFunctions[i] = fn.referToSelf.callback(self)\n          // Preserve reference in case signature is reused someday:\n          resolvedFunctions[i].referToSelf = fn.referToSelf\n          isResolved[i] = true\n          nothingResolved = false\n        } else if (isReferTo(fn)) {\n          const resolvedReferences = collectResolutions(\n            fn.referTo.references, resolvedFunctions, signatureMap)\n          if (resolvedReferences) {\n            resolvedFunctions[i] =\n              fn.referTo.callback.apply(this, resolvedReferences)\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referTo = fn.referTo\n            isResolved[i] = true\n            nothingResolved = false\n          } else {\n            leftUnresolved = true\n          }\n        }\n      }\n\n      if (nothingResolved && leftUnresolved) {\n        throw new SyntaxError(\n          'Circular reference detected in resolving typed.referTo')\n      }\n    }\n\n    return resolvedFunctions\n  }\n\n  /**\n   * Validate whether any of the function bodies contains a self-reference\n   * usage like `this(...)` or `this.signatures`. This self-referencing is\n   * deprecated since typed-function v3. It has been replaced with\n   * the functions typed.referTo and typed.referToSelf.\n   * @param {Object.<string, function>} signaturesMap\n   */\n  function validateDeprecatedThis (signaturesMap) {\n    // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n    // match occurrences like 'this(' and 'this.signatures'\n    const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/\n\n    Object.keys(signaturesMap).forEach(signature => {\n      const fn = signaturesMap[signature]\n\n      if (deprecatedThisRegex.test(fn.toString())) {\n        throw new SyntaxError('Using `this` to self-reference a function ' +\n          'is deprecated since typed-function@3. ' +\n          'Use typed.referTo and typed.referToSelf instead.')\n      }\n    })\n  }\n\n  /**\n   * Create a typed function\n   * @param {String} name               The name for the typed function\n   * @param {Object.<string, function>} rawSignaturesMap\n   *                                    An object with one or\n   *                                    multiple signatures as key, and the\n   *                                    function corresponding to the\n   *                                    signature as value.\n   * @return {function}  Returns the created typed function.\n   */\n  function createTypedFunction (name, rawSignaturesMap) {\n    typed.createCount++\n\n    if (Object.keys(rawSignaturesMap).length === 0) {\n      throw new SyntaxError('No signatures provided')\n    }\n\n    if (typed.warnAgainstDeprecatedThis) {\n      validateDeprecatedThis(rawSignaturesMap)\n    }\n\n    // Main processing loop for signatures\n    const parsedParams = []\n    const originalFunctions = []\n    const signaturesMap = {}\n    const preliminarySignatures = [] // may have duplicates from conversions\n    let signature\n    for (signature in rawSignaturesMap) {\n      // A) Protect against polluted Object prototype:\n      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n        continue\n      }\n      // B) Parse the signature\n      const params = parseSignature(signature)\n      if (!params) continue\n      // C) Check for conflicts\n      parsedParams.forEach(function (pp) {\n        if (conflicting(pp, params)) {\n          throw new TypeError('Conflicting signatures \"' +\n            stringifyParams(pp) + '\" and \"' +\n            stringifyParams(params) + '\".')\n        }\n      })\n      parsedParams.push(params)\n      // D) Store the provided function and add conversions\n      const functionIndex = originalFunctions.length\n      originalFunctions.push(rawSignaturesMap[signature])\n      const conversionParams = params.map(expandParam)\n      // E) Split the signatures and collect them up\n      let sp\n      for (sp of splitParams(conversionParams)) {\n        const spName = stringifyParams(sp)\n        preliminarySignatures.push(\n          { params: sp, name: spName, fn: functionIndex })\n        if (sp.every(p => !p.hasConversion)) {\n          signaturesMap[spName] = functionIndex\n        }\n      }\n    }\n\n    preliminarySignatures.sort(compareSignatures)\n\n    // Note the forward reference to theTypedFn\n    const resolvedFunctions =\n      resolveReferences(originalFunctions, signaturesMap, theTypedFn)\n\n    // Fill in the proper function for each signature\n    let s\n    for (s in signaturesMap) {\n      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n        signaturesMap[s] = resolvedFunctions[signaturesMap[s]]\n      }\n    }\n    const signatures = []\n    const internalSignatureMap = new Map() // benchmarks faster than object\n    for (s of preliminarySignatures) {\n      // Note it's only safe to eliminate duplicates like this\n      // _after_ the signature sorting step above; otherwise we might\n      // remove the wrong one.\n      if (!internalSignatureMap.has(s.name)) {\n        s.fn = resolvedFunctions[s.fn]\n        signatures.push(s)\n        internalSignatureMap.set(s.name, s)\n      }\n    }\n\n    // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n    const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params)\n    const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params)\n    const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params)\n    const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params)\n    const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params)\n    const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params)\n    const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5\n\n    // compile the tests\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].test = compileTests(signatures[i].params)\n    }\n\n    const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk\n    const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk\n    const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk\n    const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk\n    const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk\n    const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk\n\n    const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk\n    const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk\n    const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk\n    const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk\n    const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk\n    const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk\n\n    // compile the functions\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].implementation =\n        compileArgsPreprocessing(signatures[i].params, signatures[i].fn)\n    }\n\n    const fn0 = ok0 ? signatures[0].implementation : undef\n    const fn1 = ok1 ? signatures[1].implementation : undef\n    const fn2 = ok2 ? signatures[2].implementation : undef\n    const fn3 = ok3 ? signatures[3].implementation : undef\n    const fn4 = ok4 ? signatures[4].implementation : undef\n    const fn5 = ok5 ? signatures[5].implementation : undef\n\n    const len0 = ok0 ? signatures[0].params.length : -1\n    const len1 = ok1 ? signatures[1].params.length : -1\n    const len2 = ok2 ? signatures[2].params.length : -1\n    const len3 = ok3 ? signatures[3].params.length : -1\n    const len4 = ok4 ? signatures[4].params.length : -1\n    const len5 = ok5 ? signatures[5].params.length : -1\n\n    // simple and generic, but also slow\n    const iStart = allOk ? 6 : 0\n    const iEnd = signatures.length\n    // de-reference ahead for execution speed:\n    const tests = signatures.map(s => s.test)\n    const fns = signatures.map(s => s.implementation)\n    const generic = function generic () {\n      'use strict'\n\n      for (let i = iStart; i < iEnd; i++) {\n        if (tests[i](arguments)) {\n          return fns[i].apply(this, arguments)\n        }\n      }\n\n      return typed.onMismatch(name, arguments, signatures)\n    }\n\n    // create the typed function\n    // fast, specialized version. Falls back to the slower, generic one if needed\n    function theTypedFn (arg0, arg1) {\n      'use strict'\n\n      if (arguments.length === len0 && test00(arg0) && test01(arg1)) { return fn0.apply(this, arguments) }\n      if (arguments.length === len1 && test10(arg0) && test11(arg1)) { return fn1.apply(this, arguments) }\n      if (arguments.length === len2 && test20(arg0) && test21(arg1)) { return fn2.apply(this, arguments) }\n      if (arguments.length === len3 && test30(arg0) && test31(arg1)) { return fn3.apply(this, arguments) }\n      if (arguments.length === len4 && test40(arg0) && test41(arg1)) { return fn4.apply(this, arguments) }\n      if (arguments.length === len5 && test50(arg0) && test51(arg1)) { return fn5.apply(this, arguments) }\n\n      return generic.apply(this, arguments)\n    }\n\n    // attach name the typed function\n    try {\n      Object.defineProperty(theTypedFn, 'name', { value: name })\n    } catch (err) {\n      // old browsers do not support Object.defineProperty and some don't support setting the name property\n      // the function name is not essential for the functioning, it's mostly useful for debugging,\n      // so it's fine to have unnamed functions.\n    }\n\n    // attach signatures to the function.\n    // This property is close to the original collection of signatures\n    // used to create the typed-function, just with unions split:\n    theTypedFn.signatures = signaturesMap\n\n    // Store internal data for functions like resolve, find, etc.\n    // Also serves as the flag that this is a typed-function\n    theTypedFn._typedFunctionData = {\n      signatures,\n      signatureMap: internalSignatureMap\n    }\n\n    return theTypedFn\n  }\n\n  /**\n   * Action to take on mismatch\n   * @param {string} name      Name of function that was attempted to be called\n   * @param {Array} args       Actual arguments to the call\n   * @param {Array} signatures Known signatures of the named typed-function\n   */\n  function _onMismatch (name, args, signatures) {\n    throw createError(name, args, signatures)\n  }\n\n  /**\n   * Return all but the last items of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {Array}\n   */\n  function initial (arr) {\n    return slice(arr, 0, arr.length - 1)\n  }\n\n  /**\n   * return the last item of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {*}\n   */\n  function last (arr) {\n    return arr[arr.length - 1]\n  }\n\n  /**\n   * Slice an array or function Arguments\n   * @param {Array | Arguments | IArguments} arr\n   * @param {number} start\n   * @param {number} [end]\n   * @return {Array}\n   */\n  function slice (arr, start, end) {\n    return Array.prototype.slice.call(arr, start, end)\n  }\n\n  /**\n   * Return the first item from an array for which test(arr[i]) returns true\n   * @param {Array} arr\n   * @param {function} test\n   * @return {* | undefined} Returns the first matching item\n   *                         or undefined when there is no match\n   */\n  function findInArray (arr, test) {\n    for (let i = 0; i < arr.length; i++) {\n      if (test(arr[i])) {\n        return arr[i]\n      }\n    }\n    return undefined\n  }\n\n  /**\n   * Flat map the result invoking a callback for every item in an array.\n   * https://gist.github.com/samgiles/762ee337dff48623e729\n   * @param {Array} arr\n   * @param {function} callback\n   * @return {Array}\n   */\n  function flatMap (arr, callback) {\n    return Array.prototype.concat.apply([], arr.map(callback))\n  }\n\n  /**\n   * Create a reference callback to one or multiple signatures\n   *\n   * Syntax:\n   *\n   *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n   *       // ...\n   *     })\n   *\n   * @returns {{referTo: {references: string[], callback}}}\n   */\n  function referTo () {\n    const references =\n      initial(arguments).map(s => stringifyParams(parseSignature(s)))\n    const callback = last(arguments)\n\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as last argument')\n    }\n\n    return makeReferTo(references, callback)\n  }\n\n  function makeReferTo (references, callback) {\n    return { referTo: { references, callback } }\n  }\n\n  /**\n   * Create a reference callback to the typed-function itself\n   *\n   * @param {(self: function) => function} callback\n   * @returns {{referToSelf: { callback: function }}}\n   */\n  function referToSelf (callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as first argument')\n    }\n\n    return { referToSelf: { callback } }\n  }\n\n  /**\n   * Test whether something is a referTo object, holding a list with reference\n   * signatures and a callback.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferTo (objectOrFn) {\n    return objectOrFn &&\n      typeof objectOrFn.referTo === 'object' &&\n      Array.isArray(objectOrFn.referTo.references) &&\n      typeof objectOrFn.referTo.callback === 'function'\n  }\n\n  /**\n   * Test whether something is a referToSelf object, holding a callback where\n   * to pass `self`.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferToSelf (objectOrFn) {\n    return objectOrFn &&\n      typeof objectOrFn.referToSelf === 'object' &&\n      typeof objectOrFn.referToSelf.callback === 'function'\n  }\n\n  /**\n   * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n   * an error in case (C).\n   *\n   * @param { string | undefined } nameSoFar\n   * @param { string | undefined } newName\n   * @returns { string } updated name\n   */\n  function checkName (nameSoFar, newName) {\n    if (!nameSoFar) {\n      return newName\n    }\n    if (newName && newName !== nameSoFar) {\n      const err = new Error('Function names do not match (expected: ' +\n        nameSoFar + ', actual: ' + newName + ')')\n      err.data = { actual: newName, expected: nameSoFar }\n      throw err\n    }\n    return nameSoFar\n  }\n\n  /**\n   * Retrieve the implied name from an object with signature keys\n   * and function values, checking whether all value names match\n   *\n   * @param { {string: function} } obj\n   */\n  function getObjectName (obj) {\n    let name\n    for (const key in obj) {\n      // Only pay attention to own properties, and only if their values\n      // are typed functions or functions with a signature property\n      if (Object.prototype.hasOwnProperty.call(obj, key) &&\n        (isTypedFunction(obj[key]) ||\n          typeof obj[key].signature === 'string')) {\n        name = checkName(name, obj[key].name)\n      }\n    }\n    return name\n  }\n\n  /**\n   * Copy all of the signatures from the second argument into the first,\n   * which is modified by side effect, checking for conflicts\n   *\n   * @param {Object.<string, function|typed-reference>} dest\n   * @param {Object.<string, function|typed-reference>} source\n   */\n  function mergeSignatures (dest, source) {\n    let key\n    for (key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        if (key in dest) {\n          if (source[key] !== dest[key]) {\n            const err = new Error('Signature \"' + key + '\" is defined twice')\n            err.data = {\n              signature: key,\n              sourceFunction: source[key],\n              destFunction: dest[key]\n            }\n            throw err\n          }\n          // else: both signatures point to the same function, that's fine\n        }\n        dest[key] = source[key]\n      }\n    }\n  }\n\n  const saveTyped = typed\n\n  /**\n   * Originally the main function was a typed function itself, but then\n   * it might not be able to generate error messages if the client\n   * replaced the type system with different names.\n   *\n   * Main entry: typed([name], functions/objects with signatures...)\n   *\n   * Assembles and returns a new typed-function from the given items\n   * that provide signatures and implementations, each of which may be\n   * * a plain object mapping (string) signatures to implementing functions,\n   * * a previously constructed typed function, or\n   * * any other single function with a string-valued property `signature`.\n\n   * The name of the resulting typed-function will be given by the\n   * string-valued name argument if present, or if not, by the name\n   * of any of the arguments that have one, as long as any that do are\n   * consistent with each other. If no name is specified, the name will be\n   * an empty string.\n   *\n   * @param {string} maybeName [optional]\n   * @param {(function|object)[]} signature providers\n   * @returns {typed-function}\n   */\n  typed = function (maybeName) {\n    const named = typeof maybeName === 'string'\n    const start = named ? 1 : 0\n    let name = named ? maybeName : ''\n    const allSignatures = {}\n    for (let i = start; i < arguments.length; ++i) {\n      const item = arguments[i]\n      let theseSignatures = {}\n      let thisName\n      if (typeof item === 'function') {\n        thisName = item.name\n        if (typeof item.signature === 'string') {\n          // Case 1: Ordinary function with a string 'signature' property\n          theseSignatures[item.signature] = item\n        } else if (isTypedFunction(item)) {\n          // Case 2: Existing typed function\n          theseSignatures = item.signatures\n        }\n      } else if (isPlainObject(item)) {\n        // Case 3: Plain object, assume keys = signatures, values = functions\n        theseSignatures = item\n        if (!named) {\n          thisName = getObjectName(item)\n        }\n      }\n\n      if (Object.keys(theseSignatures).length === 0) {\n        const err = new TypeError(\n          'Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' +\n          'nor an object with signatures as keys and functions as values.')\n        err.data = { index: i, argument: item }\n        throw err\n      }\n\n      if (!named) {\n        name = checkName(name, thisName)\n      }\n      mergeSignatures(allSignatures, theseSignatures)\n    }\n\n    return createTypedFunction(name || '', allSignatures)\n  }\n\n  typed.create = create\n  typed.createCount = saveTyped.createCount\n  typed.onMismatch = _onMismatch\n  typed.throwMismatchError = _onMismatch\n  typed.createError = createError\n  typed.clear = clear\n  typed.clearConversions = clearConversions\n  typed.addTypes = addTypes\n  typed._findType = findType // For unit testing only\n  typed.referTo = referTo\n  typed.referToSelf = referToSelf\n  typed.convert = convert\n  typed.findSignature = findSignature\n  typed.find = find\n  typed.isTypedFunction = isTypedFunction\n  typed.warnAgainstDeprecatedThis = true\n\n  /**\n   * add a type (convenience wrapper for typed.addTypes)\n   * @param {{name: string, test: function}} type\n   * @param {boolean} [beforeObjectTest=true]\n   *                          If true, the new test will be inserted before\n   *                          the test with name 'Object' (if any), since\n   *                          tests for Object match Array and classes too.\n   */\n  typed.addType = function (type, beforeObjectTest) {\n    let before = 'any'\n    if (beforeObjectTest !== false && typeMap.has('Object')) {\n      before = 'Object'\n    }\n    typed.addTypes([type], before)\n  }\n\n  /**\n   * Verify that the ConversionDef conversion has a valid format.\n   *\n   * @param {conversionDef} conversion\n   * @return {void}\n   * @throws {TypeError|SyntaxError}\n   */\n  function _validateConversion (conversion) {\n    if (!conversion ||\n      typeof conversion.from !== 'string' ||\n      typeof conversion.to !== 'string' ||\n      typeof conversion.convert !== 'function') {\n      throw new TypeError('Object with properties {from: string, to: string, convert: function} expected')\n    }\n    if (conversion.to === conversion.from) {\n      throw new SyntaxError(\n        'Illegal to define conversion from \"' + conversion.from +\n        '\" to itself.')\n    }\n  }\n\n  /**\n   * Add a conversion\n   *\n   * @param {ConversionDef} conversion\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversion = function (conversion, options = { override: false }) {\n    _validateConversion(conversion)\n\n    const to = findType(conversion.to)\n    const existing = to.conversionsTo.find((other) => other.from === conversion.from)\n\n    if (existing) {\n      if (options && options.override) {\n        typed.removeConversion({ from: existing.from, to: conversion.to, convert: existing.convert })\n      } else {\n        throw new Error(\n          'There is already a conversion from \"' + conversion.from + '\" to \"' +\n          to.name + '\"')\n      }\n    }\n\n    to.conversionsTo.push({\n      from: conversion.from,\n      to: to.name,\n      convert: conversion.convert,\n      index: nConversions++\n    })\n  }\n\n  /**\n   * Convenience wrapper to call addConversion on each conversion in a list.\n   *\n   * @param {ConversionDef[]} conversions\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversions = function (conversions, options) {\n    conversions.forEach(conversion => typed.addConversion(conversion, options))\n  }\n\n  /**\n   * Remove the specified conversion. The format is the same as for\n   * addConversion, and the convert function must match or an error\n   * is thrown.\n   *\n   * @param {{from: string, to: string, convert: function}} conversion\n   * @returns {void}\n   * @throws {TypeError|SyntaxError|Error}\n   */\n  typed.removeConversion = function (conversion) {\n    _validateConversion(conversion)\n    const to = findType(conversion.to)\n    const existingConversion =\n      findInArray(to.conversionsTo, c => (c.from === conversion.from))\n    if (!existingConversion) {\n      throw new Error(\n        'Attempt to remove nonexistent conversion from ' + conversion.from +\n        ' to ' + conversion.to)\n    }\n    if (existingConversion.convert !== conversion.convert) {\n      throw new Error(\n        'Conversion to remove does not match existing conversion')\n    }\n    const index = to.conversionsTo.indexOf(existingConversion)\n    to.conversionsTo.splice(index, 1)\n  }\n\n  /**\n   * Produce the specific signature that a typed function\n   * will execute on the given arguments. Here, a \"signature\" is an\n   * object with properties 'params', 'test', 'fn', and 'implementation'.\n   * This last property is a function that converts params as necessary\n   * and then calls 'fn'. Returns null if there is no matching signature.\n   * @param {typed-function} tf\n   * @param {any[]} argList\n   * @returns {{params: string, test: function, fn: function, implementation: function}}\n   */\n  typed.resolve = function (tf, argList) {\n    if (!isTypedFunction(tf)) {\n      throw new TypeError(NOT_TYPED_FUNCTION)\n    }\n    const sigs = tf._typedFunctionData.signatures\n    for (let i = 0; i < sigs.length; ++i) {\n      if (sigs[i].test(argList)) {\n        return sigs[i]\n      }\n    }\n    return null\n  }\n\n  return typed\n}\n\nexport default create()\n"],"mappings":"AAAA,SAASA,EAAEA,CAAA,EAAI;EACb,OAAO,IAAI;AACb;AAEA,SAASC,KAAKA,CAAA,EAAI;EAChB,OAAO,KAAK;AACd;AAEA,SAASC,KAAKA,CAAA,EAAI;EAChB,OAAOC,SAAS;AAClB;AAEA,MAAMC,kBAAkB,GAAG,mCAAmC;;AAE9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,SAASC,MAAMA,CAAA,EAAI;EACjB;;EAEA;AACF;AACA;EACE,SAASC,aAAaA,CAAEC,CAAC,EAAE;IACzB,OAAO,OAAOA,CAAC,KAAK,QAAQ,IAAIA,CAAC,KAAK,IAAI,IAAIA,CAAC,CAACC,WAAW,KAAKC,MAAM;EACxE;EAEA,MAAMC,MAAM,GAAG,CACb;IAAEC,IAAI,EAAE,QAAQ;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAO,OAAOA,CAAC,KAAK,QAAQ;IAAC;EAAE,CAAC,EACvE;IAAEI,IAAI,EAAE,QAAQ;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAO,OAAOA,CAAC,KAAK,QAAQ;IAAC;EAAE,CAAC,EACvE;IAAEI,IAAI,EAAE,SAAS;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAO,OAAOA,CAAC,KAAK,SAAS;IAAC;EAAE,CAAC,EACzE;IAAEI,IAAI,EAAE,UAAU;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAO,OAAOA,CAAC,KAAK,UAAU;IAAC;EAAE,CAAC,EAC3E;IAAEI,IAAI,EAAE,OAAO;IAAEC,IAAI,EAAEC,KAAK,CAACC;EAAQ,CAAC,EACtC;IAAEH,IAAI,EAAE,MAAM;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAOA,CAAC,YAAYQ,IAAI;IAAC;EAAE,CAAC,EACjE;IAAEJ,IAAI,EAAE,QAAQ;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAOA,CAAC,YAAYS,MAAM;IAAC;EAAE,CAAC,EACrE;IAAEL,IAAI,EAAE,QAAQ;IAAEC,IAAI,EAAEN;EAAc,CAAC,EACvC;IAAEK,IAAI,EAAE,MAAM;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAOA,CAAC,KAAK,IAAI;IAAC;EAAE,CAAC,EAC1D;IAAEI,IAAI,EAAE,WAAW;IAAEC,IAAI,EAAE,SAAAA,CAAUL,CAAC,EAAE;MAAE,OAAOA,CAAC,KAAKJ,SAAS;IAAC;EAAE,CAAC,CACrE;EAED,MAAMc,OAAO,GAAG;IACdN,IAAI,EAAE,KAAK;IACXC,IAAI,EAAEZ,EAAE;IACRkB,KAAK,EAAE;EACT,CAAC;;EAED;EACA;EACA;EACA;EACA;EACA,IAAIC,OAAO,EAAC;EACZ,IAAIC,QAAQ,EAAC;;EAEb;EACA,IAAIC,YAAY,GAAG,CAAC;EACpB;;EAEA;EACA,IAAIC,KAAK,GAAG;IAAEC,WAAW,EAAE;EAAE,CAAC;;EAE9B;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,QAAQA,CAAEC,QAAQ,EAAE;IAC3B,MAAMC,IAAI,GAAGP,OAAO,CAACQ,GAAG,CAACF,QAAQ,CAAC;IAClC,IAAIC,IAAI,EAAE;MACR,OAAOA,IAAI;IACb;IACA;IACA,IAAIE,OAAO,GAAG,gBAAgB,GAAGH,QAAQ,GAAG,GAAG;IAC/C,MAAMd,IAAI,GAAGc,QAAQ,CAACI,WAAW,CAAC,CAAC;IACnC,IAAIC,SAAS;IACb,KAAKA,SAAS,IAAIV,QAAQ,EAAE;MAC1B,IAAIU,SAAS,CAACD,WAAW,CAAC,CAAC,KAAKlB,IAAI,EAAE;QACpCiB,OAAO,IAAI,kBAAkB,GAAGE,SAAS,GAAG,KAAK;QACjD;MACF;IACF;IACA,MAAM,IAAIC,SAAS,CAACH,OAAO,CAAC;EAC9B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASI,QAAQA,CAAEC,KAAK,EAAsB;IAAA,IAApBC,UAAU,GAAAC,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAhC,SAAA,GAAAgC,SAAA,MAAG,KAAK;IAC1C,MAAME,WAAW,GAAGH,UAAU,GAC1BV,QAAQ,CAACU,UAAU,CAAC,CAACI,KAAK,GAC1BlB,QAAQ,CAACgB,MAAM;IACnB,MAAMG,QAAQ,GAAG,EAAE;IACnB,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGP,KAAK,CAACG,MAAM,EAAE,EAAEI,CAAC,EAAE;MACrC,IAAI,CAACP,KAAK,CAACO,CAAC,CAAC,IAAI,OAAOP,KAAK,CAACO,CAAC,CAAC,CAAC7B,IAAI,KAAK,QAAQ,IAChD,OAAOsB,KAAK,CAACO,CAAC,CAAC,CAAC5B,IAAI,KAAK,UAAU,EAAE;QACrC,MAAM,IAAImB,SAAS,CAAC,gEAAgE,CAAC;MACvF;MACA,MAAMN,QAAQ,GAAGQ,KAAK,CAACO,CAAC,CAAC,CAAC7B,IAAI;MAC9B,IAAIQ,OAAO,CAACsB,GAAG,CAAChB,QAAQ,CAAC,EAAE;QACzB,MAAM,IAAIM,SAAS,CAAC,uBAAuB,GAAGN,QAAQ,GAAG,GAAG,CAAC;MAC/D;MACAc,QAAQ,CAACG,IAAI,CAACjB,QAAQ,CAAC;MACvBN,OAAO,CAACwB,GAAG,CAAClB,QAAQ,EAAE;QACpBd,IAAI,EAAEc,QAAQ;QACdb,IAAI,EAAEqB,KAAK,CAACO,CAAC,CAAC,CAAC5B,IAAI;QACnBM,KAAK,EAAEe,KAAK,CAACO,CAAC,CAAC,CAACtB,KAAK;QACrBoB,KAAK,EAAED,WAAW,GAAGG,CAAC;QACtBI,aAAa,EAAE,EAAE,CAAC;MACpB,CAAC,CAAC;IACJ;IACA;IACA,MAAMC,aAAa,GAAGzB,QAAQ,CAAC0B,KAAK,CAACT,WAAW,CAAC;IACjDjB,QAAQ,GACNA,QAAQ,CAAC0B,KAAK,CAAC,CAAC,EAAET,WAAW,CAAC,CAACU,MAAM,CAACR,QAAQ,CAAC,CAACQ,MAAM,CAACF,aAAa,CAAC;IACvE;IACA,KAAK,IAAIL,CAAC,GAAGH,WAAW,GAAGE,QAAQ,CAACH,MAAM,EAAEI,CAAC,GAAGpB,QAAQ,CAACgB,MAAM,EAAE,EAAEI,CAAC,EAAE;MACpErB,OAAO,CAACQ,GAAG,CAACP,QAAQ,CAACoB,CAAC,CAAC,CAAC,CAACF,KAAK,GAAGE,CAAC;IACpC;EACF;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASQ,KAAKA,CAAA,EAAI;IAChB7B,OAAO,GAAG,IAAI8B,GAAG,CAAC,CAAC;IACnB7B,QAAQ,GAAG,EAAE;IACbC,YAAY,GAAG,CAAC;IAChBW,QAAQ,CAAC,CAACf,OAAO,CAAC,EAAE,KAAK,CAAC;EAC5B;;EAEA;EACA+B,KAAK,CAAC,CAAC;EACPhB,QAAQ,CAACtB,MAAM,CAAC;;EAEhB;AACF;AACA;EACE,SAASwC,gBAAgBA,CAAA,EAAI;IAC3B,IAAIzB,QAAQ;IACZ,KAAKA,QAAQ,IAAIL,QAAQ,EAAE;MACzBD,OAAO,CAACQ,GAAG,CAACF,QAAQ,CAAC,CAACmB,aAAa,GAAG,EAAE;IAC1C;IACAvB,YAAY,GAAG,CAAC;EAClB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAAS8B,aAAaA,CAAEC,KAAK,EAAE;IAC7B,MAAMC,OAAO,GAAGjC,QAAQ,CAACkC,MAAM,CAAC3C,IAAI,IAAI;MACtC,MAAMe,IAAI,GAAGP,OAAO,CAACQ,GAAG,CAAChB,IAAI,CAAC;MAC9B,OAAO,CAACe,IAAI,CAACR,KAAK,IAAIQ,IAAI,CAACd,IAAI,CAACwC,KAAK,CAAC;IACxC,CAAC,CAAC;IACF,IAAIC,OAAO,CAACjB,MAAM,EAAE;MAClB,OAAOiB,OAAO;IAChB;IACA,OAAO,CAAC,KAAK,CAAC;EAChB;;EAEA;AACF;AACA;AACA;AACA;EACE,SAASE,eAAeA,CAAEC,MAAM,EAAE;IAChC,OAAOA,MAAM,IAAI,OAAOA,MAAM,KAAK,UAAU,IAC3C,oBAAoB,IAAIA,MAAM;EAClC;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,aAAaA,CAAEC,EAAE,EAAEC,SAAS,EAAEC,OAAO,EAAE;IAC9C,IAAI,CAACL,eAAe,CAACG,EAAE,CAAC,EAAE;MACxB,MAAM,IAAI3B,SAAS,CAAC3B,kBAAkB,CAAC;IACzC;;IAEA;IACA,MAAMyD,KAAK,GAAGD,OAAO,IAAIA,OAAO,CAACC,KAAK;IACtC,MAAMC,eAAe,GAAGjD,KAAK,CAACC,OAAO,CAAC6C,SAAS,CAAC,GAC5CA,SAAS,CAACI,IAAI,CAAC,GAAG,CAAC,GACnBJ,SAAS;IACb,MAAMK,MAAM,GAAGC,cAAc,CAACH,eAAe,CAAC;IAC9C,MAAMI,kBAAkB,GAAGC,eAAe,CAACH,MAAM,CAAC;;IAElD;IACA,IAAI,CAACH,KAAK,IAAIK,kBAAkB,IAAIR,EAAE,CAACU,UAAU,EAAE;MACjD;MACA,MAAMC,KAAK,GACTX,EAAE,CAACY,kBAAkB,CAACC,YAAY,CAAC5C,GAAG,CAACuC,kBAAkB,CAAC;MAC5D,IAAIG,KAAK,EAAE;QACT,OAAOA,KAAK;MACd;IACF;;IAEA;IACA;IACA;IACA;IACA,MAAMG,OAAO,GAAGR,MAAM,CAAC5B,MAAM;IAC7B,IAAIqC,mBAAmB;IACvB,IAAIZ,KAAK,EAAE;MACTY,mBAAmB,GAAG,EAAE;MACxB,IAAI9D,IAAI;MACR,KAAKA,IAAI,IAAI+C,EAAE,CAACU,UAAU,EAAE;QAC1BK,mBAAmB,CAAC/B,IAAI,CAACgB,EAAE,CAACY,kBAAkB,CAACC,YAAY,CAAC5C,GAAG,CAAChB,IAAI,CAAC,CAAC;MACxE;IACF,CAAC,MAAM;MACL8D,mBAAmB,GAAGf,EAAE,CAACY,kBAAkB,CAACF,UAAU;IACxD;IACA,KAAK,IAAI5B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgC,OAAO,EAAE,EAAEhC,CAAC,EAAE;MAChC,MAAMkC,IAAI,GAAGV,MAAM,CAACxB,CAAC,CAAC;MACtB,MAAMmC,kBAAkB,GAAG,EAAE;MAC7B,IAAIC,WAAW;MACf,KAAKA,WAAW,IAAIH,mBAAmB,EAAE;QACvC,MAAMI,IAAI,GAAGC,eAAe,CAACF,WAAW,CAACZ,MAAM,EAAExB,CAAC,CAAC;QACnD,IAAI,CAACqC,IAAI,IAAKH,IAAI,CAACK,SAAS,IAAI,CAACF,IAAI,CAACE,SAAU,EAAE;UAChD;QACF;QACA,IAAI,CAACF,IAAI,CAACG,MAAM,EAAE;UAChB;UACA,MAAMC,SAAS,GAAGC,YAAY,CAACL,IAAI,CAAC;UACpC,IAAIH,IAAI,CAACzC,KAAK,CAACkD,IAAI,CAACC,KAAK,IAAI,CAACH,SAAS,CAACxC,GAAG,CAAC2C,KAAK,CAACzE,IAAI,CAAC,CAAC,EAAE;YACxD;UACF;QACF;QACA;QACAgE,kBAAkB,CAACjC,IAAI,CAACkC,WAAW,CAAC;MACtC;MACAH,mBAAmB,GAAGE,kBAAkB;MACxC,IAAIF,mBAAmB,CAACrC,MAAM,KAAK,CAAC,EAAE;IACxC;IACA;IACA,IAAIiD,SAAS;IACb,KAAKA,SAAS,IAAIZ,mBAAmB,EAAE;MACrC,IAAIY,SAAS,CAACrB,MAAM,CAAC5B,MAAM,IAAIoC,OAAO,EAAE;QACtC,OAAOa,SAAS;MAClB;IACF;IAEA,MAAM,IAAItD,SAAS,CAAC,kCAAkC,IAAI2B,EAAE,CAAC/C,IAAI,IAAI,SAAS,CAAC,GAAG,GAAG,GAAGwD,eAAe,CAACH,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;EAC/H;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASsB,IAAIA,CAAE5B,EAAE,EAAEC,SAAS,EAAEC,OAAO,EAAE;IACrC,OAAOH,aAAa,CAACC,EAAE,EAAEC,SAAS,EAAEC,OAAO,CAAC,CAAC2B,cAAc;EAC7D;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASC,OAAOA,CAAEpC,KAAK,EAAE3B,QAAQ,EAAE;IACjC;IACA,MAAMC,IAAI,GAAGF,QAAQ,CAACC,QAAQ,CAAC;IAC/B,IAAIC,IAAI,CAACd,IAAI,CAACwC,KAAK,CAAC,EAAE;MACpB,OAAOA,KAAK;IACd;IACA,MAAMqC,WAAW,GAAG/D,IAAI,CAACkB,aAAa;IACtC,IAAI6C,WAAW,CAACrD,MAAM,KAAK,CAAC,EAAE;MAC5B,MAAM,IAAIsD,KAAK,CACb,8BAA8B,GAAGjE,QAAQ,GAAG,WAAW,CAAC;IAC5D;IACA,KAAK,IAAIe,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiD,WAAW,CAACrD,MAAM,EAAEI,CAAC,EAAE,EAAE;MAC3C,MAAMmD,QAAQ,GAAGnE,QAAQ,CAACiE,WAAW,CAACjD,CAAC,CAAC,CAACoD,IAAI,CAAC;MAC9C,IAAID,QAAQ,CAAC/E,IAAI,CAACwC,KAAK,CAAC,EAAE;QACxB,OAAOqC,WAAW,CAACjD,CAAC,CAAC,CAACgD,OAAO,CAACpC,KAAK,CAAC;MACtC;IACF;IAEA,MAAM,IAAIsC,KAAK,CAAC,iBAAiB,GAAGtC,KAAK,GAAG,MAAM,GAAG3B,QAAQ,CAAC;EAChE;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAAS0C,eAAeA,CAAEH,MAAM,EAAmB;IAAA,IAAjB6B,SAAS,GAAA1D,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAhC,SAAA,GAAAgC,SAAA,MAAG,GAAG;IAC/C,OAAO6B,MAAM,CAAC8B,GAAG,CAACC,CAAC,IAAIA,CAAC,CAACpF,IAAI,CAAC,CAACoD,IAAI,CAAC8B,SAAS,CAAC;EAChD;;EAEA;AACF;AACA;AACA;AACA;EACE,SAASG,UAAUA,CAAEC,KAAK,EAAE;IAC1B,MAAMlB,SAAS,GAAGkB,KAAK,CAACC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;IAC5C,MAAMjE,KAAK,GAAI,CAAC8C,SAAS,GACrBkB,KAAK,GACJA,KAAK,CAAC7D,MAAM,GAAG,CAAC,GACb6D,KAAK,CAACnD,KAAK,CAAC,CAAC,CAAC,GACd,KAAK;IAEb,MAAMqD,QAAQ,GAAGlE,KAAK,CAACmE,KAAK,CAAC,GAAG,CAAC,CAACN,GAAG,CAACO,CAAC,IAAI7E,QAAQ,CAAC6E,CAAC,CAACC,IAAI,CAAC,CAAC,CAAC,CAAC;IAE9D,IAAItB,MAAM,GAAG,KAAK;IAClB,IAAIuB,SAAS,GAAGxB,SAAS,GAAG,KAAK,GAAG,EAAE;IAEtC,MAAMyB,UAAU,GAAGL,QAAQ,CAACL,GAAG,CAAC,UAAUpE,IAAI,EAAE;MAC9CsD,MAAM,GAAGtD,IAAI,CAACR,KAAK,IAAI8D,MAAM;MAC7BuB,SAAS,IAAI7E,IAAI,CAACf,IAAI,GAAG,GAAG;MAE5B,OAAO;QACLA,IAAI,EAAEe,IAAI,CAACf,IAAI;QACf8F,SAAS,EAAE/E,IAAI,CAACY,KAAK;QACrB1B,IAAI,EAAEc,IAAI,CAACd,IAAI;QACfM,KAAK,EAAEQ,IAAI,CAACR,KAAK;QACjBwF,UAAU,EAAE,IAAI;QAChBC,eAAe,EAAE,CAAC;MACpB,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;MACL1E,KAAK,EAAEuE,UAAU;MACjB7F,IAAI,EAAE4F,SAAS,CAACzD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;MAAE;MAC9BkC,MAAM;MACN4B,aAAa,EAAE,KAAK;MACpB7B;IACF,CAAC;EACH;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAAS8B,WAAWA,CAAEZ,KAAK,EAAE;IAC3B,MAAMa,SAAS,GAAGb,KAAK,CAAChE,KAAK,CAAC6D,GAAG,CAACiB,CAAC,IAAIA,CAAC,CAACpG,IAAI,CAAC;IAC9C,MAAMqG,mBAAmB,GAAGC,oBAAoB,CAACH,SAAS,CAAC;IAC3D,IAAI9B,MAAM,GAAGiB,KAAK,CAACjB,MAAM;IACzB,IAAIkC,OAAO,GAAGjB,KAAK,CAACtF,IAAI;IAExB,MAAMwG,gBAAgB,GAAGH,mBAAmB,CAAClB,GAAG,CAAC,UAAUY,UAAU,EAAE;MACrE,MAAMhF,IAAI,GAAGF,QAAQ,CAACkF,UAAU,CAACd,IAAI,CAAC;MACtCZ,MAAM,GAAGtD,IAAI,CAACR,KAAK,IAAI8D,MAAM;MAC7BkC,OAAO,IAAI,GAAG,GAAGR,UAAU,CAACd,IAAI;MAEhC,OAAO;QACLjF,IAAI,EAAE+F,UAAU,CAACd,IAAI;QACrBa,SAAS,EAAE/E,IAAI,CAACY,KAAK;QACrB1B,IAAI,EAAEc,IAAI,CAACd,IAAI;QACfM,KAAK,EAAEQ,IAAI,CAACR,KAAK;QACjBwF,UAAU;QACVC,eAAe,EAAED,UAAU,CAACpE;MAC9B,CAAC;IACH,CAAC,CAAC;IAEF,OAAO;MACLL,KAAK,EAAEgE,KAAK,CAAChE,KAAK,CAACc,MAAM,CAACoE,gBAAgB,CAAC;MAC3CxG,IAAI,EAAEuG,OAAO;MACblC,MAAM;MACN4B,aAAa,EAAEO,gBAAgB,CAAC/E,MAAM,GAAG,CAAC;MAC1C2C,SAAS,EAAEkB,KAAK,CAAClB;IACnB,CAAC;EACH;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,YAAYA,CAAEe,KAAK,EAAE;IAC5B,IAAI,CAACA,KAAK,CAACmB,OAAO,EAAE;MAClBnB,KAAK,CAACmB,OAAO,GAAG,IAAIC,GAAG,CAAC,CAAC;MACzBpB,KAAK,CAAChE,KAAK,CAACqF,OAAO,CAAC5F,IAAI,IAAIuE,KAAK,CAACmB,OAAO,CAACG,GAAG,CAAC7F,IAAI,CAACf,IAAI,CAAC,CAAC;IAC3D;IACA,OAAOsF,KAAK,CAACmB,OAAO;EACtB;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASnD,cAAcA,CAAEuD,YAAY,EAAE;IACrC,MAAMxD,MAAM,GAAG,EAAE;IACjB,IAAI,OAAOwD,YAAY,KAAK,QAAQ,EAAE;MACpC,MAAM,IAAIzF,SAAS,CAAC,4BAA4B,CAAC;IACnD;IACA,MAAM4B,SAAS,GAAG6D,YAAY,CAAClB,IAAI,CAAC,CAAC;IACrC,IAAI3C,SAAS,KAAK,EAAE,EAAE;MACpB,OAAOK,MAAM;IACf;IAEA,MAAMyD,SAAS,GAAG9D,SAAS,CAACyC,KAAK,CAAC,GAAG,CAAC;IACtC,KAAK,IAAI5D,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiF,SAAS,CAACrF,MAAM,EAAE,EAAEI,CAAC,EAAE;MACzC,MAAMkF,WAAW,GAAG1B,UAAU,CAACyB,SAAS,CAACjF,CAAC,CAAC,CAAC8D,IAAI,CAAC,CAAC,CAAC;MACnD,IAAIoB,WAAW,CAAC3C,SAAS,IAAKvC,CAAC,KAAKiF,SAAS,CAACrF,MAAM,GAAG,CAAE,EAAE;QACzD,MAAM,IAAIuF,WAAW,CACnB,6BAA6B,GAAGF,SAAS,CAACjF,CAAC,CAAC,GAAG,KAAK,GACpD,qCAAqC,CAAC;MAC1C;MACA;MACA,IAAIkF,WAAW,CAACzF,KAAK,CAACG,MAAM,KAAK,CAAC,EAAE;QAClC,OAAO,IAAI;MACb;MACA4B,MAAM,CAACtB,IAAI,CAACgF,WAAW,CAAC;IAC1B;IAEA,OAAO1D,MAAM;EACf;;EAEA;AACF;AACA;AACA;AACA;EACE,SAAS4D,YAAYA,CAAE5D,MAAM,EAAE;IAC7B,MAAMiC,KAAK,GAAG4B,IAAI,CAAC7D,MAAM,CAAC;IAC1B,OAAOiC,KAAK,GAAGA,KAAK,CAAClB,SAAS,GAAG,KAAK;EACxC;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAAS+C,WAAWA,CAAE7B,KAAK,EAAE;IAC3B,IAAI,CAACA,KAAK,IAAIA,KAAK,CAAChE,KAAK,CAACG,MAAM,KAAK,CAAC,EAAE;MACtC;MACA,OAAOpC,EAAE;IACX,CAAC,MAAM,IAAIiG,KAAK,CAAChE,KAAK,CAACG,MAAM,KAAK,CAAC,EAAE;MACnC,OAAOZ,QAAQ,CAACyE,KAAK,CAAChE,KAAK,CAAC,CAAC,CAAC,CAACtB,IAAI,CAAC,CAACC,IAAI;IAC3C,CAAC,MAAM,IAAIqF,KAAK,CAAChE,KAAK,CAACG,MAAM,KAAK,CAAC,EAAE;MACnC,MAAM2F,KAAK,GAAGvG,QAAQ,CAACyE,KAAK,CAAChE,KAAK,CAAC,CAAC,CAAC,CAACtB,IAAI,CAAC,CAACC,IAAI;MAChD,MAAMoH,KAAK,GAAGxG,QAAQ,CAACyE,KAAK,CAAChE,KAAK,CAAC,CAAC,CAAC,CAACtB,IAAI,CAAC,CAACC,IAAI;MAChD,OAAO,SAASqH,EAAEA,CAAE1H,CAAC,EAAE;QACrB,OAAOwH,KAAK,CAACxH,CAAC,CAAC,IAAIyH,KAAK,CAACzH,CAAC,CAAC;MAC7B,CAAC;IACH,CAAC,MAAM;MAAE;MACP,MAAM2H,KAAK,GAAGjC,KAAK,CAAChE,KAAK,CAAC6D,GAAG,CAAC,UAAUpE,IAAI,EAAE;QAC5C,OAAOF,QAAQ,CAACE,IAAI,CAACf,IAAI,CAAC,CAACC,IAAI;MACjC,CAAC,CAAC;MACF,OAAO,SAASqH,EAAEA,CAAE1H,CAAC,EAAE;QACrB,KAAK,IAAIiC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,KAAK,CAAC9F,MAAM,EAAEI,CAAC,EAAE,EAAE;UACrC,IAAI0F,KAAK,CAAC1F,CAAC,CAAC,CAACjC,CAAC,CAAC,EAAE;YACf,OAAO,IAAI;UACb;QACF;QACA,OAAO,KAAK;MACd,CAAC;IACH;EACF;;EAEA;AACF;AACA;AACA;AACA;EACE,SAAS4H,YAAYA,CAAEnE,MAAM,EAAE;IAC7B,IAAIkE,KAAK,EAAEH,KAAK,EAAEC,KAAK;IAEvB,IAAIJ,YAAY,CAAC5D,MAAM,CAAC,EAAE;MACxB;MACAkE,KAAK,GAAGE,OAAO,CAACpE,MAAM,CAAC,CAAC8B,GAAG,CAACgC,WAAW,CAAC;MACxC,MAAMO,QAAQ,GAAGH,KAAK,CAAC9F,MAAM;MAC7B,MAAMkG,QAAQ,GAAGR,WAAW,CAACD,IAAI,CAAC7D,MAAM,CAAC,CAAC;MAC1C,MAAMuE,aAAa,GAAG,SAAAA,CAAUC,IAAI,EAAE;QACpC,KAAK,IAAIhG,CAAC,GAAG6F,QAAQ,EAAE7F,CAAC,GAAGgG,IAAI,CAACpG,MAAM,EAAEI,CAAC,EAAE,EAAE;UAC3C,IAAI,CAAC8F,QAAQ,CAACE,IAAI,CAAChG,CAAC,CAAC,CAAC,EAAE;YACtB,OAAO,KAAK;UACd;QACF;QACA,OAAO,IAAI;MACb,CAAC;MAED,OAAO,SAASiG,QAAQA,CAAED,IAAI,EAAE;QAC9B,KAAK,IAAIhG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,KAAK,CAAC9F,MAAM,EAAEI,CAAC,EAAE,EAAE;UACrC,IAAI,CAAC0F,KAAK,CAAC1F,CAAC,CAAC,CAACgG,IAAI,CAAChG,CAAC,CAAC,CAAC,EAAE;YACtB,OAAO,KAAK;UACd;QACF;QACA,OAAO+F,aAAa,CAACC,IAAI,CAAC,IAAKA,IAAI,CAACpG,MAAM,IAAIiG,QAAQ,GAAG,CAAE;MAC7D,CAAC;IACH,CAAC,MAAM;MACL;MACA,IAAIrE,MAAM,CAAC5B,MAAM,KAAK,CAAC,EAAE;QACvB,OAAO,SAASqG,QAAQA,CAAED,IAAI,EAAE;UAC9B,OAAOA,IAAI,CAACpG,MAAM,KAAK,CAAC;QAC1B,CAAC;MACH,CAAC,MAAM,IAAI4B,MAAM,CAAC5B,MAAM,KAAK,CAAC,EAAE;QAC9B2F,KAAK,GAAGD,WAAW,CAAC9D,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,SAASyE,QAAQA,CAAED,IAAI,EAAE;UAC9B,OAAOT,KAAK,CAACS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAIA,IAAI,CAACpG,MAAM,KAAK,CAAC;QAC5C,CAAC;MACH,CAAC,MAAM,IAAI4B,MAAM,CAAC5B,MAAM,KAAK,CAAC,EAAE;QAC9B2F,KAAK,GAAGD,WAAW,CAAC9D,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9BgE,KAAK,GAAGF,WAAW,CAAC9D,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,SAASyE,QAAQA,CAAED,IAAI,EAAE;UAC9B,OAAOT,KAAK,CAACS,IAAI,CAAC,CAAC,CAAC,CAAC,IAAIR,KAAK,CAACQ,IAAI,CAAC,CAAC,CAAC,CAAC,IAAIA,IAAI,CAACpG,MAAM,KAAK,CAAC;QAC9D,CAAC;MACH,CAAC,MAAM;QAAE;QACP8F,KAAK,GAAGlE,MAAM,CAAC8B,GAAG,CAACgC,WAAW,CAAC;QAC/B,OAAO,SAASW,QAAQA,CAAED,IAAI,EAAE;UAC9B,KAAK,IAAIhG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,KAAK,CAAC9F,MAAM,EAAEI,CAAC,EAAE,EAAE;YACrC,IAAI,CAAC0F,KAAK,CAAC1F,CAAC,CAAC,CAACgG,IAAI,CAAChG,CAAC,CAAC,CAAC,EAAE;cACtB,OAAO,KAAK;YACd;UACF;UACA,OAAOgG,IAAI,CAACpG,MAAM,KAAK8F,KAAK,CAAC9F,MAAM;QACrC,CAAC;MACH;IACF;EACF;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAAS0C,eAAeA,CAAEd,MAAM,EAAE1B,KAAK,EAAE;IACvC,OAAOA,KAAK,GAAG0B,MAAM,CAAC5B,MAAM,GACxB4B,MAAM,CAAC1B,KAAK,CAAC,GACbsF,YAAY,CAAC5D,MAAM,CAAC,GAAG6D,IAAI,CAAC7D,MAAM,CAAC,GAAG,IAAI;EAChD;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAAS0E,iBAAiBA,CAAE1E,MAAM,EAAE1B,KAAK,EAAE;IACzC,MAAM2D,KAAK,GAAGnB,eAAe,CAACd,MAAM,EAAE1B,KAAK,CAAC;IAC5C,IAAI,CAAC2D,KAAK,EAAE;MACV,OAAO,IAAIoB,GAAG,CAAC,CAAC;IAClB;IACA,OAAOnC,YAAY,CAACe,KAAK,CAAC;EAC5B;;EAEA;AACF;AACA;AACA;AACA;EACE,SAAS0C,WAAWA,CAAEjH,IAAI,EAAE;IAC1B,OAAOA,IAAI,CAACgF,UAAU,KAAK,IAAI,IAAIhF,IAAI,CAACgF,UAAU,KAAKvG,SAAS;EAClE;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASyI,mBAAmBA,CAAExE,UAAU,EAAE9B,KAAK,EAAE;IAC/C,MAAM8E,OAAO,GAAG,IAAIC,GAAG,CAAC,CAAC;IACzBjD,UAAU,CAACkD,OAAO,CAAC3D,SAAS,IAAI;MAC9B,MAAMkF,QAAQ,GAAGH,iBAAiB,CAAC/E,SAAS,CAACK,MAAM,EAAE1B,KAAK,CAAC;MAC3D,IAAI3B,IAAI;MACR,KAAKA,IAAI,IAAIkI,QAAQ,EAAE;QACrBzB,OAAO,CAACG,GAAG,CAAC5G,IAAI,CAAC;MACnB;IACF,CAAC,CAAC;IAEF,OAAOyG,OAAO,CAAC3E,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG5B,KAAK,CAAC+E,IAAI,CAACwB,OAAO,CAAC;EAC3D;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAAS0B,WAAWA,CAAEnI,IAAI,EAAE6H,IAAI,EAAEpE,UAAU,EAAE;IAC5C,IAAI2E,GAAG,EAAEC,QAAQ;IACjB,MAAMC,KAAK,GAAGtI,IAAI,IAAI,SAAS;;IAE/B;IACA,IAAIuI,kBAAkB,GAAG9E,UAAU;IACnC,IAAI9B,KAAK;IACT,KAAKA,KAAK,GAAG,CAAC,EAAEA,KAAK,GAAGkG,IAAI,CAACpG,MAAM,EAAEE,KAAK,EAAE,EAAE;MAC5C,MAAM6G,gBAAgB,GAAG,EAAE;MAC3BD,kBAAkB,CAAC5B,OAAO,CAAC3D,SAAS,IAAI;QACtC,MAAMsC,KAAK,GAAGnB,eAAe,CAACnB,SAAS,CAACK,MAAM,EAAE1B,KAAK,CAAC;QACtD,MAAM1B,IAAI,GAAGkH,WAAW,CAAC7B,KAAK,CAAC;QAC/B,IAAI,CAAC3D,KAAK,GAAGqB,SAAS,CAACK,MAAM,CAAC5B,MAAM,IAClCwF,YAAY,CAACjE,SAAS,CAACK,MAAM,CAAC,KAC9BpD,IAAI,CAAC4H,IAAI,CAAClG,KAAK,CAAC,CAAC,EAAE;UACnB6G,gBAAgB,CAACzG,IAAI,CAACiB,SAAS,CAAC;QAClC;MACF,CAAC,CAAC;MAEF,IAAIwF,gBAAgB,CAAC/G,MAAM,KAAK,CAAC,EAAE;QACjC;QACA4G,QAAQ,GAAGJ,mBAAmB,CAACM,kBAAkB,EAAE5G,KAAK,CAAC;QACzD,IAAI0G,QAAQ,CAAC5G,MAAM,GAAG,CAAC,EAAE;UACvB,MAAMgH,WAAW,GAAGjG,aAAa,CAACqF,IAAI,CAAClG,KAAK,CAAC,CAAC;UAE9CyG,GAAG,GAAG,IAAIhH,SAAS,CAAC,0CAA0C,GAAGkH,KAAK,GACpE,cAAc,GAAGD,QAAQ,CAACjF,IAAI,CAAC,MAAM,CAAC,GACtC,YAAY,GAAGqF,WAAW,CAACrF,IAAI,CAAC,KAAK,CAAC,GAAG,WAAW,GAAGzB,KAAK,GAAG,GAAG,CAAC;UACrEyG,GAAG,CAACM,IAAI,GAAG;YACTC,QAAQ,EAAE,WAAW;YACrB5F,EAAE,EAAEuF,KAAK;YACT3G,KAAK;YACLiH,MAAM,EAAEH,WAAW;YACnBJ;UACF,CAAC;UACD,OAAOD,GAAG;QACZ;MACF,CAAC,MAAM;QACLG,kBAAkB,GAAGC,gBAAgB;MACvC;IACF;;IAEA;IACA,MAAMK,OAAO,GAAGN,kBAAkB,CAACpD,GAAG,CAAC,UAAUnC,SAAS,EAAE;MAC1D,OAAOiE,YAAY,CAACjE,SAAS,CAACK,MAAM,CAAC,GACjCyF,QAAQ,GACR9F,SAAS,CAACK,MAAM,CAAC5B,MAAM;IAC7B,CAAC,CAAC;IACF,IAAIoG,IAAI,CAACpG,MAAM,GAAGsH,IAAI,CAACC,GAAG,CAACC,KAAK,CAAC,IAAI,EAAEJ,OAAO,CAAC,EAAE;MAC/CR,QAAQ,GAAGJ,mBAAmB,CAACM,kBAAkB,EAAE5G,KAAK,CAAC;MACzDyG,GAAG,GAAG,IAAIhH,SAAS,CAAC,gCAAgC,GAAGkH,KAAK,GAC1D,cAAc,GAAGD,QAAQ,CAACjF,IAAI,CAAC,MAAM,CAAC,GACtC,WAAW,GAAGyE,IAAI,CAACpG,MAAM,GAAG,GAAG,CAAC;MAClC2G,GAAG,CAACM,IAAI,GAAG;QACTC,QAAQ,EAAE,YAAY;QACtB5F,EAAE,EAAEuF,KAAK;QACT3G,KAAK,EAAEkG,IAAI,CAACpG,MAAM;QAClB4G;MACF,CAAC;MACD,OAAOD,GAAG;IACZ;;IAEA;IACA,MAAMc,SAAS,GAAGH,IAAI,CAACI,GAAG,CAACF,KAAK,CAAC,IAAI,EAAEJ,OAAO,CAAC;IAC/C,IAAIhB,IAAI,CAACpG,MAAM,GAAGyH,SAAS,EAAE;MAC3Bd,GAAG,GAAG,IAAIhH,SAAS,CAAC,iCAAiC,GAAGkH,KAAK,GAC3D,cAAc,GAAGY,SAAS,GAAG,YAAY,GAAGrB,IAAI,CAACpG,MAAM,GAAG,GAAG,CAAC;MAChE2G,GAAG,CAACM,IAAI,GAAG;QACTC,QAAQ,EAAE,aAAa;QACvB5F,EAAE,EAAEuF,KAAK;QACT3G,KAAK,EAAEkG,IAAI,CAACpG,MAAM;QAClB2H,cAAc,EAAEF;MAClB,CAAC;MACD,OAAOd,GAAG;IACZ;;IAEA;IACA,MAAMiB,QAAQ,GAAG,EAAE;IACnB,KAAK,IAAIxH,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGgG,IAAI,CAACpG,MAAM,EAAE,EAAEI,CAAC,EAAE;MACpCwH,QAAQ,CAACtH,IAAI,CAACS,aAAa,CAACqF,IAAI,CAAChG,CAAC,CAAC,CAAC,CAACuB,IAAI,CAAC,GAAG,CAAC,CAAC;IACjD;IACAgF,GAAG,GAAG,IAAIhH,SAAS,CAAC,qBAAqB,GAAGiI,QAAQ,CAACjG,IAAI,CAAC,IAAI,CAAC,GAC7D,2DAA2D,GAAGkF,KAAK,GAAG,GAAG,CAAC;IAC5EF,GAAG,CAACM,IAAI,GAAG;MACTC,QAAQ,EAAE,UAAU;MACpBC,MAAM,EAAES;IACV,CAAC;IACD,OAAOjB,GAAG;EACZ;;EAEA;AACF;AACA;AACA;AACA;EACE,SAASkB,kBAAkBA,CAAEhE,KAAK,EAAE;IAClC,IAAI0D,GAAG,GAAGvI,QAAQ,CAACgB,MAAM,GAAG,CAAC;IAE7B,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyD,KAAK,CAAChE,KAAK,CAACG,MAAM,EAAEI,CAAC,EAAE,EAAE;MAC3CmH,GAAG,GAAGD,IAAI,CAACC,GAAG,CAACA,GAAG,EAAE1D,KAAK,CAAChE,KAAK,CAACO,CAAC,CAAC,CAACiE,SAAS,CAAC;IAC/C;IAEA,OAAOkD,GAAG;EACZ;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASO,wBAAwBA,CAAEjE,KAAK,EAAE;IACxC,IAAI0D,GAAG,GAAGtI,YAAY,GAAG,CAAC;IAE1B,KAAK,IAAImB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyD,KAAK,CAAChE,KAAK,CAACG,MAAM,EAAEI,CAAC,EAAE,EAAE;MAC3C,IAAI,CAACmG,WAAW,CAAC1C,KAAK,CAAChE,KAAK,CAACO,CAAC,CAAC,CAAC,EAAE;QAChCmH,GAAG,GAAGD,IAAI,CAACC,GAAG,CAACA,GAAG,EAAE1D,KAAK,CAAChE,KAAK,CAACO,CAAC,CAAC,CAACmE,eAAe,CAAC;MACrD;IACF;IAEA,OAAOgD,GAAG;EACZ;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASQ,aAAaA,CAAEC,MAAM,EAAEC,MAAM,EAAE;IACtC;IACA;IACA,IAAID,MAAM,CAACpF,MAAM,EAAE;MACjB,IAAI,CAACqF,MAAM,CAACrF,MAAM,EAAE;QAClB,OAAO,GAAG;MACZ;IACF,CAAC,MAAM,IAAIqF,MAAM,CAACrF,MAAM,EAAE;MACxB,OAAO,CAAC,GAAG;IACb;;IAEA;IACA,IAAIoF,MAAM,CAACrF,SAAS,EAAE;MACpB,IAAI,CAACsF,MAAM,CAACtF,SAAS,EAAE;QACrB,OAAO,IAAI;MACb;IACF,CAAC,MAAM,IAAIsF,MAAM,CAACtF,SAAS,EAAE;MAC3B,OAAO,CAAC,IAAI;IACd;;IAEA;IACA,MAAMuF,QAAQ,GAAGL,kBAAkB,CAACG,MAAM,CAAC,GAAGH,kBAAkB,CAACI,MAAM,CAAC;IACxE,IAAIC,QAAQ,GAAG,CAAC,EAAE;MAChB,OAAO,CAAC,KAAK;IACf;IACA,IAAIA,QAAQ,GAAG,CAAC,EAAE;MAChB,OAAO,KAAK;IACd;;IAEA;IACA;IACA,MAAMC,KAAK,GAAGL,wBAAwB,CAACE,MAAM,CAAC;IAC9C,MAAMI,KAAK,GAAGN,wBAAwB,CAACG,MAAM,CAAC;IAC9C,IAAID,MAAM,CAACxD,aAAa,EAAE;MACxB,IAAI,CAACyD,MAAM,CAACzD,aAAa,EAAE;QACzB,OAAO,CAAC,CAAC,GAAG2D,KAAK,IAAI,QAAQ;MAC/B;IACF,CAAC,MAAM,IAAIF,MAAM,CAACzD,aAAa,EAAE;MAC/B,OAAO,EAAE,CAAC,GAAG4D,KAAK,CAAC,GAAG,QAAQ;IAChC;;IAEA;IACA,MAAMC,QAAQ,GAAGF,KAAK,GAAGC,KAAK;IAC9B,IAAIC,QAAQ,GAAG,CAAC,EAAE;MAChB,OAAO,CAAC,SAAS;IACnB;IACA,IAAIA,QAAQ,GAAG,CAAC,EAAE;MAChB,OAAO,SAAS;IAClB;;IAEA;IACA,OAAO,CAAC;EACV;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,iBAAiBA,CAAEC,UAAU,EAAEC,UAAU,EAAE;IAClD,MAAMC,KAAK,GAAGF,UAAU,CAAC3G,MAAM;IAC/B,MAAM8G,KAAK,GAAGF,UAAU,CAAC5G,MAAM;IAC/B,MAAM+G,KAAK,GAAGlD,IAAI,CAACgD,KAAK,CAAC;IACzB,MAAMG,KAAK,GAAGnD,IAAI,CAACiD,KAAK,CAAC;IACzB,MAAMG,QAAQ,GAAGrD,YAAY,CAACiD,KAAK,CAAC;IACpC,MAAMK,QAAQ,GAAGtD,YAAY,CAACkD,KAAK,CAAC;IACpC;IACA;IACA,IAAIG,QAAQ,IAAIF,KAAK,CAAC/F,MAAM,EAAE;MAC5B,IAAI,CAACkG,QAAQ,IAAI,CAACF,KAAK,CAAChG,MAAM,EAAE;QAC9B,OAAO,QAAQ;MACjB;IACF,CAAC,MAAM,IAAIkG,QAAQ,IAAIF,KAAK,CAAChG,MAAM,EAAE;MACnC,OAAO,CAAC,QAAQ;IAClB;;IAEA;IACA,IAAImG,IAAI,GAAG,CAAC;IACZ,IAAIZ,KAAK,GAAG,CAAC;IACb,IAAIa,GAAG;IACP,KAAKA,GAAG,IAAIP,KAAK,EAAE;MACjB,IAAIO,GAAG,CAACpG,MAAM,EAAE,EAAEmG,IAAI;MACtB,IAAIC,GAAG,CAACxE,aAAa,EAAE,EAAE2D,KAAK;IAChC;IACA,IAAIc,IAAI,GAAG,CAAC;IACZ,IAAIb,KAAK,GAAG,CAAC;IACb,KAAKY,GAAG,IAAIN,KAAK,EAAE;MACjB,IAAIM,GAAG,CAACpG,MAAM,EAAE,EAAEqG,IAAI;MACtB,IAAID,GAAG,CAACxE,aAAa,EAAE,EAAE4D,KAAK;IAChC;IACA,IAAIW,IAAI,KAAKE,IAAI,EAAE;MACjB,OAAO,CAACF,IAAI,GAAGE,IAAI,IAAI,OAAO;IAChC;;IAEA;IACA,IAAIJ,QAAQ,IAAIF,KAAK,CAACnE,aAAa,EAAE;MACnC,IAAI,CAACsE,QAAQ,IAAI,CAACF,KAAK,CAACpE,aAAa,EAAE;QACrC,OAAO,MAAM;MACf;IACF,CAAC,MAAM,IAAIsE,QAAQ,IAAIF,KAAK,CAACpE,aAAa,EAAE;MAC1C,OAAO,CAAC,MAAM;IAChB;;IAEA;IACA,IAAI2D,KAAK,KAAKC,KAAK,EAAE;MACnB,OAAO,CAACD,KAAK,GAAGC,KAAK,IAAI,KAAK;IAChC;;IAEA;IACA,IAAIS,QAAQ,EAAE;MACZ,IAAI,CAACC,QAAQ,EAAE;QACb,OAAO,IAAI;MACb;IACF,CAAC,MAAM,IAAIA,QAAQ,EAAE;MACnB,OAAO,CAAC,IAAI;IACd;;IAEA;IACA,MAAMI,eAAe,GACnB,CAACT,KAAK,CAACzI,MAAM,GAAG0I,KAAK,CAAC1I,MAAM,KAAK6I,QAAQ,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;IACzD,IAAIK,eAAe,KAAK,CAAC,EAAE;MACzB,OAAOA,eAAe;IACxB;;IAEA;IACA;IACA;IACA;IACA,MAAMC,WAAW,GAAG,EAAE;IACtB,IAAIC,EAAE,GAAG,CAAC;IACV,KAAK,IAAIhJ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqI,KAAK,CAACzI,MAAM,EAAE,EAAEI,CAAC,EAAE;MACrC,MAAMiJ,cAAc,GAAGtB,aAAa,CAACU,KAAK,CAACrI,CAAC,CAAC,EAAEsI,KAAK,CAACtI,CAAC,CAAC,CAAC;MACxD+I,WAAW,CAAC7I,IAAI,CAAC+I,cAAc,CAAC;MAChCD,EAAE,IAAIC,cAAc;IACtB;IACA,IAAID,EAAE,KAAK,CAAC,EAAE;MACZ,OAAO,CAAEA,EAAE,GAAG,CAAC,GAAI,CAAC,EAAE,GAAG,EAAE,IAAIA,EAAE;IACnC;;IAEA;IACA;IACA;IACA;IACA,IAAIE,CAAC;IACL,IAAIC,KAAK,GAAG,CAAC;IACb,MAAMC,SAAS,GAAGD,KAAK,IAAIJ,WAAW,CAACnJ,MAAM,GAAG,CAAC,CAAC;IAClD,KAAKsJ,CAAC,IAAIH,WAAW,EAAE;MACrB,IAAIG,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,CAAEA,CAAC,GAAG,CAAC,GAAI,CAACC,KAAK,GAAGA,KAAK,IAAID,CAAC;MACvC;MACAC,KAAK,IAAIC,SAAS;IACpB;;IAEA;IACA,OAAO,CAAC;EACV;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAAS3E,oBAAoBA,CAAEH,SAAS,EAAE;IACxC,IAAIA,SAAS,CAAC1E,MAAM,KAAK,CAAC,EAAE;MAC1B,OAAO,EAAE;IACX;IACA,MAAMH,KAAK,GAAG6E,SAAS,CAAChB,GAAG,CAACtE,QAAQ,CAAC;IACrC,IAAIsF,SAAS,CAAC1E,MAAM,KAAK,CAAC,EAAE,OAAOH,KAAK,CAAC,CAAC,CAAC,CAACW,aAAa;;IAEzD;IACA;IACA;IACA,MAAMiJ,UAAU,GAAG,IAAIxE,GAAG,CAACP,SAAS,CAAC;IACrC,MAAMK,gBAAgB,GAAG,IAAIE,GAAG,CAAC,CAAC;IAClC,KAAK,IAAI7E,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGP,KAAK,CAACG,MAAM,EAAE,EAAEI,CAAC,EAAE;MACrC,KAAK,MAAM6B,KAAK,IAAIpC,KAAK,CAACO,CAAC,CAAC,CAACI,aAAa,EAAE;QAC1C,IAAI,CAACiJ,UAAU,CAACpJ,GAAG,CAAC4B,KAAK,CAACuB,IAAI,CAAC,EAAEuB,gBAAgB,CAACI,GAAG,CAAClD,KAAK,CAACuB,IAAI,CAAC;MACnE;IACF;;IAEA;IACA,MAAMvC,OAAO,GAAG,EAAE;IAClB,KAAK,MAAM5B,QAAQ,IAAI0F,gBAAgB,EAAE;MACvC,IAAI2E,SAAS,GAAGzK,YAAY,GAAG,CAAC;MAChC,IAAI0K,cAAc,GAAG,IAAI;MACzB,KAAK,IAAIvJ,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGP,KAAK,CAACG,MAAM,EAAE,EAAEI,CAAC,EAAE;QACrC,KAAK,MAAM6B,KAAK,IAAIpC,KAAK,CAACO,CAAC,CAAC,CAACI,aAAa,EAAE;UAC1C,IAAIyB,KAAK,CAACuB,IAAI,KAAKnE,QAAQ,IAAI4C,KAAK,CAAC/B,KAAK,GAAGwJ,SAAS,EAAE;YACtDA,SAAS,GAAGzH,KAAK,CAAC/B,KAAK;YACvByJ,cAAc,GAAG1H,KAAK;UACxB;QACF;MACF;MACAhB,OAAO,CAACX,IAAI,CAACqJ,cAAc,CAAC;IAC9B;IAEA,OAAO1I,OAAO;EAChB;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAAS2I,wBAAwBA,CAAEhI,MAAM,EAAEN,EAAE,EAAE;IAC7C,IAAIuI,SAAS,GAAGvI,EAAE;;IAElB;;IAEA,IAAI/C,IAAI,GAAG,EAAE;IACb,IAAIqD,MAAM,CAACmB,IAAI,CAACY,CAAC,IAAIA,CAAC,CAACa,aAAa,CAAC,EAAE;MACrC,MAAM7B,SAAS,GAAG6C,YAAY,CAAC5D,MAAM,CAAC;MACtC,MAAMkI,mBAAmB,GAAGlI,MAAM,CAAC8B,GAAG,CAACqG,oBAAoB,CAAC;MAC5DxL,IAAI,GAAGuL,mBAAmB,CAACpG,GAAG,CAACsG,IAAI,IAAIA,IAAI,CAACzL,IAAI,CAAC,CAACoD,IAAI,CAAC,GAAG,CAAC;MAC3DkI,SAAS,GAAG,SAASI,WAAWA,CAAA,EAAI;QAClC,MAAM7D,IAAI,GAAG,EAAE;QACf,MAAMX,IAAI,GAAG9C,SAAS,GAAG5C,SAAS,CAACC,MAAM,GAAG,CAAC,GAAGD,SAAS,CAACC,MAAM;QAChE,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqF,IAAI,EAAErF,CAAC,EAAE,EAAE;UAC7BgG,IAAI,CAAChG,CAAC,CAAC,GAAG0J,mBAAmB,CAAC1J,CAAC,CAAC,CAACL,SAAS,CAACK,CAAC,CAAC,CAAC;QAChD;QACA,IAAIuC,SAAS,EAAE;UACbyD,IAAI,CAACX,IAAI,CAAC,GAAG1F,SAAS,CAAC0F,IAAI,CAAC,CAAC/B,GAAG,CAACoG,mBAAmB,CAACrE,IAAI,CAAC,CAAC;QAC7D;QAEA,OAAOnE,EAAE,CAACkG,KAAK,CAAC,IAAI,EAAEpB,IAAI,CAAC;MAC7B,CAAC;IACH;IAEA,IAAI8D,YAAY,GAAGL,SAAS;IAC5B,IAAIrE,YAAY,CAAC5D,MAAM,CAAC,EAAE;MACxB,MAAMuI,MAAM,GAAGvI,MAAM,CAAC5B,MAAM,GAAG,CAAC;MAEhCkK,YAAY,GAAG,SAASE,oBAAoBA,CAAA,EAAI;QAC9C,OAAOP,SAAS,CAACrC,KAAK,CAAC,IAAI,EACzB9G,KAAK,CAACX,SAAS,EAAE,CAAC,EAAEoK,MAAM,CAAC,CAACxJ,MAAM,CAAC,CAACD,KAAK,CAACX,SAAS,EAAEoK,MAAM,CAAC,CAAC,CAAC,CAAC;MACnE,CAAC;IACH;IACA,IAAI5L,IAAI,EAAEF,MAAM,CAACgM,cAAc,CAACH,YAAY,EAAE,MAAM,EAAE;MAAElJ,KAAK,EAAEzC;IAAK,CAAC,CAAC;IACtE,OAAO2L,YAAY;EACrB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASH,oBAAoBA,CAAElG,KAAK,EAAE;IACpC,IAAI8B,KAAK,EAAEC,KAAK,EAAE0E,WAAW,EAAEC,WAAW;IAC1C,MAAMzE,KAAK,GAAG,EAAE;IAChB,MAAMzC,WAAW,GAAG,EAAE;IACtB,IAAI9E,IAAI,GAAG,EAAE;IACbsF,KAAK,CAAChE,KAAK,CAACqF,OAAO,CAAC,UAAU5F,IAAI,EAAE;MAClC,IAAIA,IAAI,CAACgF,UAAU,EAAE;QACnB/F,IAAI,IAAIe,IAAI,CAACgF,UAAU,CAACd,IAAI,GAAG,IAAI,GAAGlE,IAAI,CAACgF,UAAU,CAACkG,EAAE,GAAG,GAAG;QAC9D1E,KAAK,CAACxF,IAAI,CAAClB,QAAQ,CAACE,IAAI,CAACgF,UAAU,CAACd,IAAI,CAAC,CAAChF,IAAI,CAAC;QAC/C6E,WAAW,CAAC/C,IAAI,CAAChB,IAAI,CAACgF,UAAU,CAAClB,OAAO,CAAC;MAC3C;IACF,CAAC,CAAC;IACF,IAAI7E,IAAI,EAAEA,IAAI,GAAGA,IAAI,CAACmC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAC7BnC,IAAI,GAAG,MAAM;;IAElB;IACA,IAAIkM,SAAS,GAAGC,GAAG,IAAIA,GAAG;IAC1B,QAAQrH,WAAW,CAACrD,MAAM;MACxB,KAAK,CAAC;QAAE;MACR,KAAK,CAAC;QACJ2F,KAAK,GAAGG,KAAK,CAAC,CAAC,CAAC;QAChBwE,WAAW,GAAGjH,WAAW,CAAC,CAAC,CAAC;QAC5BoH,SAAS,GAAG,SAASE,UAAUA,CAAED,GAAG,EAAE;UACpC,IAAI/E,KAAK,CAAC+E,GAAG,CAAC,EAAE;YACd,OAAOJ,WAAW,CAACI,GAAG,CAAC;UACzB;UACA,OAAOA,GAAG;QACZ,CAAC;QACD;MACF,KAAK,CAAC;QACJ/E,KAAK,GAAGG,KAAK,CAAC,CAAC,CAAC;QAChBF,KAAK,GAAGE,KAAK,CAAC,CAAC,CAAC;QAChBwE,WAAW,GAAGjH,WAAW,CAAC,CAAC,CAAC;QAC5BkH,WAAW,GAAGlH,WAAW,CAAC,CAAC,CAAC;QAC5BoH,SAAS,GAAG,SAASE,UAAUA,CAAED,GAAG,EAAE;UACpC,IAAI/E,KAAK,CAAC+E,GAAG,CAAC,EAAE;YACd,OAAOJ,WAAW,CAACI,GAAG,CAAC;UACzB;UACA,IAAI9E,KAAK,CAAC8E,GAAG,CAAC,EAAE;YACd,OAAOH,WAAW,CAACG,GAAG,CAAC;UACzB;UACA,OAAOA,GAAG;QACZ,CAAC;QACD;MACF;QACED,SAAS,GAAG,SAASE,UAAUA,CAAED,GAAG,EAAE;UACpC,KAAK,IAAItK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiD,WAAW,CAACrD,MAAM,EAAEI,CAAC,EAAE,EAAE;YAC3C,IAAI0F,KAAK,CAAC1F,CAAC,CAAC,CAACsK,GAAG,CAAC,EAAE;cACjB,OAAOrH,WAAW,CAACjD,CAAC,CAAC,CAACsK,GAAG,CAAC;YAC5B;UACF;UACA,OAAOA,GAAG;QACZ,CAAC;IACL;IACArM,MAAM,CAACgM,cAAc,CAACI,SAAS,EAAE,MAAM,EAAE;MAAEzJ,KAAK,EAAEzC;IAAK,CAAC,CAAC;IACzD,OAAOkM,SAAS;EAClB;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,WAAWA,CAAEhJ,MAAM,EAAE;IAC5B,SAASiJ,YAAYA,CAAEjJ,MAAM,EAAE1B,KAAK,EAAE4K,WAAW,EAAE;MACjD,IAAI5K,KAAK,GAAG0B,MAAM,CAAC5B,MAAM,EAAE;QACzB,MAAM6D,KAAK,GAAGjC,MAAM,CAAC1B,KAAK,CAAC;QAC3B,IAAI6K,eAAe,GAAG,EAAE;QAExB,IAAIlH,KAAK,CAAClB,SAAS,EAAE;UACnB;UACA;UACA,MAAMyB,UAAU,GAAGP,KAAK,CAAChE,KAAK,CAACqB,MAAM,CAACqF,WAAW,CAAC;UAClD,IAAInC,UAAU,CAACpE,MAAM,GAAG6D,KAAK,CAAChE,KAAK,CAACG,MAAM,EAAE;YAC1C+K,eAAe,CAACzK,IAAI,CAAC;cACnBT,KAAK,EAAEuE,UAAU;cACjB7F,IAAI,EAAE,KAAK,GAAG6F,UAAU,CAACV,GAAG,CAACiB,CAAC,IAAIA,CAAC,CAACpG,IAAI,CAAC,CAACoD,IAAI,CAAC,GAAG,CAAC;cACnDiB,MAAM,EAAEwB,UAAU,CAACrB,IAAI,CAAC4B,CAAC,IAAIA,CAAC,CAAC7F,KAAK,CAAC;cACrC0F,aAAa,EAAE,KAAK;cACpB7B,SAAS,EAAE;YACb,CAAC,CAAC;UACJ;UACAoI,eAAe,CAACzK,IAAI,CAACuD,KAAK,CAAC;QAC7B,CAAC,MAAM;UACL;UACAkH,eAAe,GAAGlH,KAAK,CAAChE,KAAK,CAAC6D,GAAG,CAAC,UAAUpE,IAAI,EAAE;YAChD,OAAO;cACLO,KAAK,EAAE,CAACP,IAAI,CAAC;cACbf,IAAI,EAAEe,IAAI,CAACf,IAAI;cACfqE,MAAM,EAAEtD,IAAI,CAACR,KAAK;cAClB0F,aAAa,EAAElF,IAAI,CAACgF,UAAU;cAC9B3B,SAAS,EAAE;YACb,CAAC;UACH,CAAC,CAAC;QACJ;;QAEA;QACA,OAAOqI,OAAO,CAACD,eAAe,EAAE,UAAUE,SAAS,EAAE;UACnD,OAAOJ,YAAY,CAACjJ,MAAM,EAAE1B,KAAK,GAAG,CAAC,EAAE4K,WAAW,CAACnK,MAAM,CAAC,CAACsK,SAAS,CAAC,CAAC,CAAC;QACzE,CAAC,CAAC;MACJ,CAAC,MAAM;QACL;QACA,OAAO,CAACH,WAAW,CAAC;MACtB;IACF;IAEA,OAAOD,YAAY,CAACjJ,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;EACpC;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASsJ,WAAWA,CAAEC,OAAO,EAAEC,OAAO,EAAE;IACtC,MAAMC,EAAE,GAAG/D,IAAI,CAACI,GAAG,CAACyD,OAAO,CAACnL,MAAM,EAAEoL,OAAO,CAACpL,MAAM,CAAC;IAEnD,KAAK,IAAII,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiL,EAAE,EAAEjL,CAAC,EAAE,EAAE;MAC3B,MAAMkL,QAAQ,GAAGhF,iBAAiB,CAAC6E,OAAO,EAAE/K,CAAC,CAAC;MAC9C,MAAMmL,QAAQ,GAAGjF,iBAAiB,CAAC8E,OAAO,EAAEhL,CAAC,CAAC;MAC9C,IAAIoL,OAAO,GAAG,KAAK;MACnB,IAAIjN,IAAI;MACR,KAAKA,IAAI,IAAIgN,QAAQ,EAAE;QACrB,IAAID,QAAQ,CAACjL,GAAG,CAAC9B,IAAI,CAAC,EAAE;UACtBiN,OAAO,GAAG,IAAI;UACd;QACF;MACF;MACA,IAAI,CAACA,OAAO,EAAE;QACZ,OAAO,KAAK;MACd;IACF;IAEA,MAAMC,IAAI,GAAGN,OAAO,CAACnL,MAAM;IAC3B,MAAM0L,IAAI,GAAGN,OAAO,CAACpL,MAAM;IAC3B,MAAM2L,UAAU,GAAGnG,YAAY,CAAC2F,OAAO,CAAC;IACxC,MAAMS,UAAU,GAAGpG,YAAY,CAAC4F,OAAO,CAAC;IAExC,OAAOO,UAAU,GACbC,UAAU,GAAIH,IAAI,KAAKC,IAAI,GAAKA,IAAI,IAAID,IAAK,GAC7CG,UAAU,GAAIH,IAAI,IAAIC,IAAI,GAAKD,IAAI,KAAKC,IAAK;EACnD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,gBAAgBA,CAAEC,YAAY,EAAE;IACvC,OAAOA,YAAY,CAACpI,GAAG,CAACpC,EAAE,IAAI;MAC5B,IAAIyK,aAAa,CAACzK,EAAE,CAAC,EAAE;QACrB,OAAO0K,WAAW,CAAC1K,EAAE,CAAC0K,WAAW,CAACC,QAAQ,CAAC;MAC7C;MACA,IAAIC,SAAS,CAAC5K,EAAE,CAAC,EAAE;QACjB,OAAO6K,WAAW,CAAC7K,EAAE,CAAC8K,OAAO,CAACC,UAAU,EAAE/K,EAAE,CAAC8K,OAAO,CAACH,QAAQ,CAAC;MAChE;MACA,OAAO3K,EAAE;IACX,CAAC,CAAC;EACJ;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASgL,kBAAkBA,CAAED,UAAU,EAAEP,YAAY,EAAE3J,YAAY,EAAE;IACnE,MAAMoK,kBAAkB,GAAG,EAAE;IAC7B,IAAIC,SAAS;IACb,KAAKA,SAAS,IAAIH,UAAU,EAAE;MAC5B,IAAII,UAAU,GAAGtK,YAAY,CAACqK,SAAS,CAAC;MACxC,IAAI,OAAOC,UAAU,KAAK,QAAQ,EAAE;QAClC,MAAM,IAAI9M,SAAS,CACjB,0CAA0C,GAAG6M,SAAS,GAAG,GAAG,CAAC;MACjE;MACAC,UAAU,GAAGX,YAAY,CAACW,UAAU,CAAC;MACrC,IAAI,OAAOA,UAAU,KAAK,UAAU,EAAE;QACpC,OAAO,KAAK;MACd;MACAF,kBAAkB,CAACjM,IAAI,CAACmM,UAAU,CAAC;IACrC;IACA,OAAOF,kBAAkB;EAC3B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,iBAAiBA,CAAEZ,YAAY,EAAE3J,YAAY,EAAEwK,IAAI,EAAE;IAC5D,MAAMC,iBAAiB,GAAGf,gBAAgB,CAACC,YAAY,CAAC;IACxD,MAAMe,UAAU,GAAG,IAAIpO,KAAK,CAACmO,iBAAiB,CAAC5M,MAAM,CAAC,CAAC8M,IAAI,CAAC,KAAK,CAAC;IAClE,IAAIC,cAAc,GAAG,IAAI;IACzB,OAAOA,cAAc,EAAE;MACrBA,cAAc,GAAG,KAAK;MACtB,IAAIC,eAAe,GAAG,IAAI;MAC1B,KAAK,IAAI5M,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGwM,iBAAiB,CAAC5M,MAAM,EAAE,EAAEI,CAAC,EAAE;QACjD,IAAIyM,UAAU,CAACzM,CAAC,CAAC,EAAE;QACnB,MAAMkB,EAAE,GAAGsL,iBAAiB,CAACxM,CAAC,CAAC;QAE/B,IAAI2L,aAAa,CAACzK,EAAE,CAAC,EAAE;UACrBsL,iBAAiB,CAACxM,CAAC,CAAC,GAAGkB,EAAE,CAAC0K,WAAW,CAACC,QAAQ,CAACU,IAAI,CAAC;UACpD;UACAC,iBAAiB,CAACxM,CAAC,CAAC,CAAC4L,WAAW,GAAG1K,EAAE,CAAC0K,WAAW;UACjDa,UAAU,CAACzM,CAAC,CAAC,GAAG,IAAI;UACpB4M,eAAe,GAAG,KAAK;QACzB,CAAC,MAAM,IAAId,SAAS,CAAC5K,EAAE,CAAC,EAAE;UACxB,MAAMiL,kBAAkB,GAAGD,kBAAkB,CAC3ChL,EAAE,CAAC8K,OAAO,CAACC,UAAU,EAAEO,iBAAiB,EAAEzK,YAAY,CAAC;UACzD,IAAIoK,kBAAkB,EAAE;YACtBK,iBAAiB,CAACxM,CAAC,CAAC,GAClBkB,EAAE,CAAC8K,OAAO,CAACH,QAAQ,CAACzE,KAAK,CAAC,IAAI,EAAE+E,kBAAkB,CAAC;YACrD;YACAK,iBAAiB,CAACxM,CAAC,CAAC,CAACgM,OAAO,GAAG9K,EAAE,CAAC8K,OAAO;YACzCS,UAAU,CAACzM,CAAC,CAAC,GAAG,IAAI;YACpB4M,eAAe,GAAG,KAAK;UACzB,CAAC,MAAM;YACLD,cAAc,GAAG,IAAI;UACvB;QACF;MACF;MAEA,IAAIC,eAAe,IAAID,cAAc,EAAE;QACrC,MAAM,IAAIxH,WAAW,CACnB,wDAAwD,CAAC;MAC7D;IACF;IAEA,OAAOqH,iBAAiB;EAC1B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASK,sBAAsBA,CAAEC,aAAa,EAAE;IAC9C;;IAEA;IACA,MAAMC,mBAAmB,GAAG,2BAA2B;IAEvD9O,MAAM,CAAC+O,IAAI,CAACF,aAAa,CAAC,CAAChI,OAAO,CAAC3D,SAAS,IAAI;MAC9C,MAAMD,EAAE,GAAG4L,aAAa,CAAC3L,SAAS,CAAC;MAEnC,IAAI4L,mBAAmB,CAAC3O,IAAI,CAAC8C,EAAE,CAAC+L,QAAQ,CAAC,CAAC,CAAC,EAAE;QAC3C,MAAM,IAAI9H,WAAW,CAAC,4CAA4C,GAChE,wCAAwC,GACxC,kDAAkD,CAAC;MACvD;IACF,CAAC,CAAC;EACJ;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAAS+H,mBAAmBA,CAAE/O,IAAI,EAAEgP,gBAAgB,EAAE;IACpDrO,KAAK,CAACC,WAAW,EAAE;IAEnB,IAAId,MAAM,CAAC+O,IAAI,CAACG,gBAAgB,CAAC,CAACvN,MAAM,KAAK,CAAC,EAAE;MAC9C,MAAM,IAAIuF,WAAW,CAAC,wBAAwB,CAAC;IACjD;IAEA,IAAIrG,KAAK,CAACsO,yBAAyB,EAAE;MACnCP,sBAAsB,CAACM,gBAAgB,CAAC;IAC1C;;IAEA;IACA,MAAME,YAAY,GAAG,EAAE;IACvB,MAAMC,iBAAiB,GAAG,EAAE;IAC5B,MAAMR,aAAa,GAAG,CAAC,CAAC;IACxB,MAAMS,qBAAqB,GAAG,EAAE,EAAC;IACjC,IAAIpM,SAAS;IACb,KAAKA,SAAS,IAAIgM,gBAAgB,EAAE;MAClC;MACA,IAAI,CAAClP,MAAM,CAACuP,SAAS,CAACC,cAAc,CAACC,IAAI,CAACP,gBAAgB,EAAEhM,SAAS,CAAC,EAAE;QACtE;MACF;MACA;MACA,MAAMK,MAAM,GAAGC,cAAc,CAACN,SAAS,CAAC;MACxC,IAAI,CAACK,MAAM,EAAE;MACb;MACA6L,YAAY,CAACvI,OAAO,CAAC,UAAU6I,EAAE,EAAE;QACjC,IAAI7C,WAAW,CAAC6C,EAAE,EAAEnM,MAAM,CAAC,EAAE;UAC3B,MAAM,IAAIjC,SAAS,CAAC,0BAA0B,GAC5CoC,eAAe,CAACgM,EAAE,CAAC,GAAG,SAAS,GAC/BhM,eAAe,CAACH,MAAM,CAAC,GAAG,IAAI,CAAC;QACnC;MACF,CAAC,CAAC;MACF6L,YAAY,CAACnN,IAAI,CAACsB,MAAM,CAAC;MACzB;MACA,MAAMoM,aAAa,GAAGN,iBAAiB,CAAC1N,MAAM;MAC9C0N,iBAAiB,CAACpN,IAAI,CAACiN,gBAAgB,CAAChM,SAAS,CAAC,CAAC;MACnD,MAAM0M,gBAAgB,GAAGrM,MAAM,CAAC8B,GAAG,CAACe,WAAW,CAAC;MAChD;MACA,IAAIyJ,EAAE;MACN,KAAKA,EAAE,IAAItD,WAAW,CAACqD,gBAAgB,CAAC,EAAE;QACxC,MAAME,MAAM,GAAGpM,eAAe,CAACmM,EAAE,CAAC;QAClCP,qBAAqB,CAACrN,IAAI,CACxB;UAAEsB,MAAM,EAAEsM,EAAE;UAAE3P,IAAI,EAAE4P,MAAM;UAAE7M,EAAE,EAAE0M;QAAc,CAAC,CAAC;QAClD,IAAIE,EAAE,CAACE,KAAK,CAACzK,CAAC,IAAI,CAACA,CAAC,CAACa,aAAa,CAAC,EAAE;UACnC0I,aAAa,CAACiB,MAAM,CAAC,GAAGH,aAAa;QACvC;MACF;IACF;IAEAL,qBAAqB,CAACU,IAAI,CAAC/F,iBAAiB,CAAC;;IAE7C;IACA,MAAMsE,iBAAiB,GACrBF,iBAAiB,CAACgB,iBAAiB,EAAER,aAAa,EAAEoB,UAAU,CAAC;;IAEjE;IACA,IAAIrK,CAAC;IACL,KAAKA,CAAC,IAAIiJ,aAAa,EAAE;MACvB,IAAI7O,MAAM,CAACuP,SAAS,CAACC,cAAc,CAACC,IAAI,CAACZ,aAAa,EAAEjJ,CAAC,CAAC,EAAE;QAC1DiJ,aAAa,CAACjJ,CAAC,CAAC,GAAG2I,iBAAiB,CAACM,aAAa,CAACjJ,CAAC,CAAC,CAAC;MACxD;IACF;IACA,MAAMjC,UAAU,GAAG,EAAE;IACrB,MAAMuM,oBAAoB,GAAG,IAAI1N,GAAG,CAAC,CAAC,EAAC;IACvC,KAAKoD,CAAC,IAAI0J,qBAAqB,EAAE;MAC/B;MACA;MACA;MACA,IAAI,CAACY,oBAAoB,CAAClO,GAAG,CAAC4D,CAAC,CAAC1F,IAAI,CAAC,EAAE;QACrC0F,CAAC,CAAC3C,EAAE,GAAGsL,iBAAiB,CAAC3I,CAAC,CAAC3C,EAAE,CAAC;QAC9BU,UAAU,CAAC1B,IAAI,CAAC2D,CAAC,CAAC;QAClBsK,oBAAoB,CAAChO,GAAG,CAAC0D,CAAC,CAAC1F,IAAI,EAAE0F,CAAC,CAAC;MACrC;IACF;;IAEA;IACA,MAAMuK,GAAG,GAAGxM,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAM6M,GAAG,GAAGzM,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAM8M,GAAG,GAAG1M,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAM+M,GAAG,GAAG3M,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAMgN,GAAG,GAAG5M,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAMiN,GAAG,GAAG7M,UAAU,CAAC,CAAC,CAAC,IAAIA,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,IAAI,CAAC,IAAI,CAACwF,YAAY,CAACxD,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC;IACpG,MAAMkN,KAAK,GAAGN,GAAG,IAAIC,GAAG,IAAIC,GAAG,IAAIC,GAAG,IAAIC,GAAG,IAAIC,GAAG;;IAEpD;IACA,KAAK,IAAIzO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4B,UAAU,CAAChC,MAAM,EAAE,EAAEI,CAAC,EAAE;MAC1C4B,UAAU,CAAC5B,CAAC,CAAC,CAAC5B,IAAI,GAAGuH,YAAY,CAAC/D,UAAU,CAAC5B,CAAC,CAAC,CAACwB,MAAM,CAAC;IACzD;IAEA,MAAMmN,MAAM,GAAGP,GAAG,GAAG9I,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMmR,MAAM,GAAGP,GAAG,GAAG/I,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMoR,MAAM,GAAGP,GAAG,GAAGhJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMqR,MAAM,GAAGP,GAAG,GAAGjJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMsR,MAAM,GAAGP,GAAG,GAAGlJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMuR,MAAM,GAAGP,GAAG,GAAGnJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IAEjE,MAAMwR,MAAM,GAAGb,GAAG,GAAG9I,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAMyR,MAAM,GAAGb,GAAG,GAAG/I,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAM0R,MAAM,GAAGb,GAAG,GAAGhJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAM2R,MAAM,GAAGb,GAAG,GAAGjJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAM4R,MAAM,GAAGb,GAAG,GAAGlJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;IACjE,MAAM6R,MAAM,GAAGb,GAAG,GAAGnJ,WAAW,CAAC1D,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG/D,KAAK;;IAEjE;IACA,KAAK,IAAIuC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG4B,UAAU,CAAChC,MAAM,EAAE,EAAEI,CAAC,EAAE;MAC1C4B,UAAU,CAAC5B,CAAC,CAAC,CAAC+C,cAAc,GAC1ByG,wBAAwB,CAAC5H,UAAU,CAAC5B,CAAC,CAAC,CAACwB,MAAM,EAAEI,UAAU,CAAC5B,CAAC,CAAC,CAACkB,EAAE,CAAC;IACpE;IAEA,MAAMqO,GAAG,GAAGnB,GAAG,GAAGxM,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IACtD,MAAM8R,GAAG,GAAGnB,GAAG,GAAGzM,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IACtD,MAAM+R,GAAG,GAAGnB,GAAG,GAAG1M,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IACtD,MAAMgS,GAAG,GAAGnB,GAAG,GAAG3M,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IACtD,MAAMiS,GAAG,GAAGnB,GAAG,GAAG5M,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IACtD,MAAMkS,GAAG,GAAGnB,GAAG,GAAG7M,UAAU,CAAC,CAAC,CAAC,CAACmB,cAAc,GAAGrF,KAAK;IAEtD,MAAMmS,IAAI,GAAGzB,GAAG,GAAGxM,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;IACnD,MAAMyL,IAAI,GAAGgD,GAAG,GAAGzM,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;IACnD,MAAM0L,IAAI,GAAGgD,GAAG,GAAG1M,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;IACnD,MAAMkQ,IAAI,GAAGvB,GAAG,GAAG3M,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;IACnD,MAAMmQ,IAAI,GAAGvB,GAAG,GAAG5M,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;IACnD,MAAMoQ,IAAI,GAAGvB,GAAG,GAAG7M,UAAU,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC5B,MAAM,GAAG,CAAC,CAAC;;IAEnD;IACA,MAAMqQ,MAAM,GAAGvB,KAAK,GAAG,CAAC,GAAG,CAAC;IAC5B,MAAMwB,IAAI,GAAGtO,UAAU,CAAChC,MAAM;IAC9B;IACA,MAAM8F,KAAK,GAAG9D,UAAU,CAAC0B,GAAG,CAACO,CAAC,IAAIA,CAAC,CAACzF,IAAI,CAAC;IACzC,MAAM+R,GAAG,GAAGvO,UAAU,CAAC0B,GAAG,CAACO,CAAC,IAAIA,CAAC,CAACd,cAAc,CAAC;IACjD,MAAMqN,OAAO,GAAG,SAASA,OAAOA,CAAA,EAAI;MAClC,YAAY;;MAEZ,KAAK,IAAIpQ,CAAC,GAAGiQ,MAAM,EAAEjQ,CAAC,GAAGkQ,IAAI,EAAElQ,CAAC,EAAE,EAAE;QAClC,IAAI0F,KAAK,CAAC1F,CAAC,CAAC,CAACL,SAAS,CAAC,EAAE;UACvB,OAAOwQ,GAAG,CAACnQ,CAAC,CAAC,CAACoH,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;QACtC;MACF;MAEA,OAAOb,KAAK,CAACuR,UAAU,CAAClS,IAAI,EAAEwB,SAAS,EAAEiC,UAAU,CAAC;IACtD,CAAC;;IAED;IACA;IACA,SAASsM,UAAUA,CAAEoC,IAAI,EAAEC,IAAI,EAAE;MAC/B,YAAY;;MAEZ,IAAI5Q,SAAS,CAACC,MAAM,KAAKiQ,IAAI,IAAIlB,MAAM,CAAC2B,IAAI,CAAC,IAAIrB,MAAM,CAACsB,IAAI,CAAC,EAAE;QAAE,OAAOhB,GAAG,CAACnI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MACnG,IAAIA,SAAS,CAACC,MAAM,KAAKyL,IAAI,IAAIuD,MAAM,CAAC0B,IAAI,CAAC,IAAIpB,MAAM,CAACqB,IAAI,CAAC,EAAE;QAAE,OAAOf,GAAG,CAACpI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MACnG,IAAIA,SAAS,CAACC,MAAM,KAAK0L,IAAI,IAAIuD,MAAM,CAACyB,IAAI,CAAC,IAAInB,MAAM,CAACoB,IAAI,CAAC,EAAE;QAAE,OAAOd,GAAG,CAACrI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MACnG,IAAIA,SAAS,CAACC,MAAM,KAAKkQ,IAAI,IAAIhB,MAAM,CAACwB,IAAI,CAAC,IAAIlB,MAAM,CAACmB,IAAI,CAAC,EAAE;QAAE,OAAOb,GAAG,CAACtI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MACnG,IAAIA,SAAS,CAACC,MAAM,KAAKmQ,IAAI,IAAIhB,MAAM,CAACuB,IAAI,CAAC,IAAIjB,MAAM,CAACkB,IAAI,CAAC,EAAE;QAAE,OAAOZ,GAAG,CAACvI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MACnG,IAAIA,SAAS,CAACC,MAAM,KAAKoQ,IAAI,IAAIhB,MAAM,CAACsB,IAAI,CAAC,IAAIhB,MAAM,CAACiB,IAAI,CAAC,EAAE;QAAE,OAAOX,GAAG,CAACxI,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;MAAC;MAEnG,OAAOyQ,OAAO,CAAChJ,KAAK,CAAC,IAAI,EAAEzH,SAAS,CAAC;IACvC;;IAEA;IACA,IAAI;MACF1B,MAAM,CAACgM,cAAc,CAACiE,UAAU,EAAE,MAAM,EAAE;QAAEtN,KAAK,EAAEzC;MAAK,CAAC,CAAC;IAC5D,CAAC,CAAC,OAAOoI,GAAG,EAAE;MACZ;MACA;MACA;IAAA;;IAGF;IACA;IACA;IACA2H,UAAU,CAACtM,UAAU,GAAGkL,aAAa;;IAErC;IACA;IACAoB,UAAU,CAACpM,kBAAkB,GAAG;MAC9BF,UAAU;MACVG,YAAY,EAAEoM;IAChB,CAAC;IAED,OAAOD,UAAU;EACnB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASsC,WAAWA,CAAErS,IAAI,EAAE6H,IAAI,EAAEpE,UAAU,EAAE;IAC5C,MAAM0E,WAAW,CAACnI,IAAI,EAAE6H,IAAI,EAAEpE,UAAU,CAAC;EAC3C;;EAEA;AACF;AACA;AACA;AACA;EACE,SAASgE,OAAOA,CAAE6K,GAAG,EAAE;IACrB,OAAOnQ,KAAK,CAACmQ,GAAG,EAAE,CAAC,EAAEA,GAAG,CAAC7Q,MAAM,GAAG,CAAC,CAAC;EACtC;;EAEA;AACF;AACA;AACA;AACA;EACE,SAASyF,IAAIA,CAAEoL,GAAG,EAAE;IAClB,OAAOA,GAAG,CAACA,GAAG,CAAC7Q,MAAM,GAAG,CAAC,CAAC;EAC5B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASU,KAAKA,CAAEmQ,GAAG,EAAEC,KAAK,EAAEC,GAAG,EAAE;IAC/B,OAAOtS,KAAK,CAACmP,SAAS,CAAClN,KAAK,CAACoN,IAAI,CAAC+C,GAAG,EAAEC,KAAK,EAAEC,GAAG,CAAC;EACpD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,WAAWA,CAAEH,GAAG,EAAErS,IAAI,EAAE;IAC/B,KAAK,IAAI4B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyQ,GAAG,CAAC7Q,MAAM,EAAEI,CAAC,EAAE,EAAE;MACnC,IAAI5B,IAAI,CAACqS,GAAG,CAACzQ,CAAC,CAAC,CAAC,EAAE;QAChB,OAAOyQ,GAAG,CAACzQ,CAAC,CAAC;MACf;IACF;IACA,OAAOrC,SAAS;EAClB;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASiN,OAAOA,CAAE6F,GAAG,EAAE5E,QAAQ,EAAE;IAC/B,OAAOxN,KAAK,CAACmP,SAAS,CAACjN,MAAM,CAAC6G,KAAK,CAAC,EAAE,EAAEqJ,GAAG,CAACnN,GAAG,CAACuI,QAAQ,CAAC,CAAC;EAC5D;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,OAAOA,CAAA,EAAI;IAClB,MAAMC,UAAU,GACdrG,OAAO,CAACjG,SAAS,CAAC,CAAC2D,GAAG,CAACO,CAAC,IAAIlC,eAAe,CAACF,cAAc,CAACoC,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMgI,QAAQ,GAAGxG,IAAI,CAAC1F,SAAS,CAAC;IAEhC,IAAI,OAAOkM,QAAQ,KAAK,UAAU,EAAE;MAClC,MAAM,IAAItM,SAAS,CAAC,6CAA6C,CAAC;IACpE;IAEA,OAAOwM,WAAW,CAACE,UAAU,EAAEJ,QAAQ,CAAC;EAC1C;EAEA,SAASE,WAAWA,CAAEE,UAAU,EAAEJ,QAAQ,EAAE;IAC1C,OAAO;MAAEG,OAAO,EAAE;QAAEC,UAAU;QAAEJ;MAAS;IAAE,CAAC;EAC9C;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASD,WAAWA,CAAEC,QAAQ,EAAE;IAC9B,IAAI,OAAOA,QAAQ,KAAK,UAAU,EAAE;MAClC,MAAM,IAAItM,SAAS,CAAC,8CAA8C,CAAC;IACrE;IAEA,OAAO;MAAEqM,WAAW,EAAE;QAAEC;MAAS;IAAE,CAAC;EACtC;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,SAASA,CAAE+E,UAAU,EAAE;IAC9B,OAAOA,UAAU,IACf,OAAOA,UAAU,CAAC7E,OAAO,KAAK,QAAQ,IACtC3N,KAAK,CAACC,OAAO,CAACuS,UAAU,CAAC7E,OAAO,CAACC,UAAU,CAAC,IAC5C,OAAO4E,UAAU,CAAC7E,OAAO,CAACH,QAAQ,KAAK,UAAU;EACrD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASF,aAAaA,CAAEkF,UAAU,EAAE;IAClC,OAAOA,UAAU,IACf,OAAOA,UAAU,CAACjF,WAAW,KAAK,QAAQ,IAC1C,OAAOiF,UAAU,CAACjF,WAAW,CAACC,QAAQ,KAAK,UAAU;EACzD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASiF,SAASA,CAAEC,SAAS,EAAErM,OAAO,EAAE;IACtC,IAAI,CAACqM,SAAS,EAAE;MACd,OAAOrM,OAAO;IAChB;IACA,IAAIA,OAAO,IAAIA,OAAO,KAAKqM,SAAS,EAAE;MACpC,MAAMxK,GAAG,GAAG,IAAIrD,KAAK,CAAC,yCAAyC,GAC7D6N,SAAS,GAAG,YAAY,GAAGrM,OAAO,GAAG,GAAG,CAAC;MAC3C6B,GAAG,CAACM,IAAI,GAAG;QAAEE,MAAM,EAAErC,OAAO;QAAE8B,QAAQ,EAAEuK;MAAU,CAAC;MACnD,MAAMxK,GAAG;IACX;IACA,OAAOwK,SAAS;EAClB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASC,aAAaA,CAAEC,GAAG,EAAE;IAC3B,IAAI9S,IAAI;IACR,KAAK,MAAM+S,GAAG,IAAID,GAAG,EAAE;MACrB;MACA;MACA,IAAIhT,MAAM,CAACuP,SAAS,CAACC,cAAc,CAACC,IAAI,CAACuD,GAAG,EAAEC,GAAG,CAAC,KAC/CnQ,eAAe,CAACkQ,GAAG,CAACC,GAAG,CAAC,CAAC,IACxB,OAAOD,GAAG,CAACC,GAAG,CAAC,CAAC/P,SAAS,KAAK,QAAQ,CAAC,EAAE;QAC3ChD,IAAI,GAAG2S,SAAS,CAAC3S,IAAI,EAAE8S,GAAG,CAACC,GAAG,CAAC,CAAC/S,IAAI,CAAC;MACvC;IACF;IACA,OAAOA,IAAI;EACb;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASgT,eAAeA,CAAEC,IAAI,EAAEC,MAAM,EAAE;IACtC,IAAIH,GAAG;IACP,KAAKA,GAAG,IAAIG,MAAM,EAAE;MAClB,IAAIpT,MAAM,CAACuP,SAAS,CAACC,cAAc,CAACC,IAAI,CAAC2D,MAAM,EAAEH,GAAG,CAAC,EAAE;QACrD,IAAIA,GAAG,IAAIE,IAAI,EAAE;UACf,IAAIC,MAAM,CAACH,GAAG,CAAC,KAAKE,IAAI,CAACF,GAAG,CAAC,EAAE;YAC7B,MAAM3K,GAAG,GAAG,IAAIrD,KAAK,CAAC,aAAa,GAAGgO,GAAG,GAAG,oBAAoB,CAAC;YACjE3K,GAAG,CAACM,IAAI,GAAG;cACT1F,SAAS,EAAE+P,GAAG;cACdI,cAAc,EAAED,MAAM,CAACH,GAAG,CAAC;cAC3BK,YAAY,EAAEH,IAAI,CAACF,GAAG;YACxB,CAAC;YACD,MAAM3K,GAAG;UACX;UACA;QACF;QACA6K,IAAI,CAACF,GAAG,CAAC,GAAGG,MAAM,CAACH,GAAG,CAAC;MACzB;IACF;EACF;EAEA,MAAMM,SAAS,GAAG1S,KAAK;;EAEvB;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EAEEA,KAAK,GAAG,SAAAA,CAAU2S,SAAS,EAAE;IAC3B,MAAMC,KAAK,GAAG,OAAOD,SAAS,KAAK,QAAQ;IAC3C,MAAMf,KAAK,GAAGgB,KAAK,GAAG,CAAC,GAAG,CAAC;IAC3B,IAAIvT,IAAI,GAAGuT,KAAK,GAAGD,SAAS,GAAG,EAAE;IACjC,MAAME,aAAa,GAAG,CAAC,CAAC;IACxB,KAAK,IAAI3R,CAAC,GAAG0Q,KAAK,EAAE1Q,CAAC,GAAGL,SAAS,CAACC,MAAM,EAAE,EAAEI,CAAC,EAAE;MAC7C,MAAM4R,IAAI,GAAGjS,SAAS,CAACK,CAAC,CAAC;MACzB,IAAI6R,eAAe,GAAG,CAAC,CAAC;MACxB,IAAIC,QAAQ;MACZ,IAAI,OAAOF,IAAI,KAAK,UAAU,EAAE;QAC9BE,QAAQ,GAAGF,IAAI,CAACzT,IAAI;QACpB,IAAI,OAAOyT,IAAI,CAACzQ,SAAS,KAAK,QAAQ,EAAE;UACtC;UACA0Q,eAAe,CAACD,IAAI,CAACzQ,SAAS,CAAC,GAAGyQ,IAAI;QACxC,CAAC,MAAM,IAAI7Q,eAAe,CAAC6Q,IAAI,CAAC,EAAE;UAChC;UACAC,eAAe,GAAGD,IAAI,CAAChQ,UAAU;QACnC;MACF,CAAC,MAAM,IAAI9D,aAAa,CAAC8T,IAAI,CAAC,EAAE;QAC9B;QACAC,eAAe,GAAGD,IAAI;QACtB,IAAI,CAACF,KAAK,EAAE;UACVI,QAAQ,GAAGd,aAAa,CAACY,IAAI,CAAC;QAChC;MACF;MAEA,IAAI3T,MAAM,CAAC+O,IAAI,CAAC6E,eAAe,CAAC,CAACjS,MAAM,KAAK,CAAC,EAAE;QAC7C,MAAM2G,GAAG,GAAG,IAAIhH,SAAS,CACvB,iCAAiC,GAAGS,CAAC,GAAG,8BAA8B,GACtE,gEAAgE,CAAC;QACnEuG,GAAG,CAACM,IAAI,GAAG;UAAE/G,KAAK,EAAEE,CAAC;UAAE+R,QAAQ,EAAEH;QAAK,CAAC;QACvC,MAAMrL,GAAG;MACX;MAEA,IAAI,CAACmL,KAAK,EAAE;QACVvT,IAAI,GAAG2S,SAAS,CAAC3S,IAAI,EAAE2T,QAAQ,CAAC;MAClC;MACAX,eAAe,CAACQ,aAAa,EAAEE,eAAe,CAAC;IACjD;IAEA,OAAO3E,mBAAmB,CAAC/O,IAAI,IAAI,EAAE,EAAEwT,aAAa,CAAC;EACvD,CAAC;EAED7S,KAAK,CAACjB,MAAM,GAAGA,MAAM;EACrBiB,KAAK,CAACC,WAAW,GAAGyS,SAAS,CAACzS,WAAW;EACzCD,KAAK,CAACuR,UAAU,GAAGG,WAAW;EAC9B1R,KAAK,CAACkT,kBAAkB,GAAGxB,WAAW;EACtC1R,KAAK,CAACwH,WAAW,GAAGA,WAAW;EAC/BxH,KAAK,CAAC0B,KAAK,GAAGA,KAAK;EACnB1B,KAAK,CAAC4B,gBAAgB,GAAGA,gBAAgB;EACzC5B,KAAK,CAACU,QAAQ,GAAGA,QAAQ;EACzBV,KAAK,CAACmT,SAAS,GAAGjT,QAAQ,EAAC;EAC3BF,KAAK,CAACkN,OAAO,GAAGA,OAAO;EACvBlN,KAAK,CAAC8M,WAAW,GAAGA,WAAW;EAC/B9M,KAAK,CAACkE,OAAO,GAAGA,OAAO;EACvBlE,KAAK,CAACmC,aAAa,GAAGA,aAAa;EACnCnC,KAAK,CAACgE,IAAI,GAAGA,IAAI;EACjBhE,KAAK,CAACiC,eAAe,GAAGA,eAAe;EACvCjC,KAAK,CAACsO,yBAAyB,GAAG,IAAI;;EAEtC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEtO,KAAK,CAACoT,OAAO,GAAG,UAAUhT,IAAI,EAAEiT,gBAAgB,EAAE;IAChD,IAAIC,MAAM,GAAG,KAAK;IAClB,IAAID,gBAAgB,KAAK,KAAK,IAAIxT,OAAO,CAACsB,GAAG,CAAC,QAAQ,CAAC,EAAE;MACvDmS,MAAM,GAAG,QAAQ;IACnB;IACAtT,KAAK,CAACU,QAAQ,CAAC,CAACN,IAAI,CAAC,EAAEkT,MAAM,CAAC;EAChC,CAAC;;EAED;AACF;AACA;AACA;AACA;AACA;AACA;EACE,SAASC,mBAAmBA,CAAEnO,UAAU,EAAE;IACxC,IAAI,CAACA,UAAU,IACb,OAAOA,UAAU,CAACd,IAAI,KAAK,QAAQ,IACnC,OAAOc,UAAU,CAACkG,EAAE,KAAK,QAAQ,IACjC,OAAOlG,UAAU,CAAClB,OAAO,KAAK,UAAU,EAAE;MAC1C,MAAM,IAAIzD,SAAS,CAAC,+EAA+E,CAAC;IACtG;IACA,IAAI2E,UAAU,CAACkG,EAAE,KAAKlG,UAAU,CAACd,IAAI,EAAE;MACrC,MAAM,IAAI+B,WAAW,CACnB,qCAAqC,GAAGjB,UAAU,CAACd,IAAI,GACvD,cAAc,CAAC;IACnB;EACF;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEtE,KAAK,CAACwT,aAAa,GAAG,UAAUpO,UAAU,EAAiC;IAAA,IAA/B9C,OAAO,GAAAzB,SAAA,CAAAC,MAAA,QAAAD,SAAA,QAAAhC,SAAA,GAAAgC,SAAA,MAAG;MAAE4S,QAAQ,EAAE;IAAM,CAAC;IACvEF,mBAAmB,CAACnO,UAAU,CAAC;IAE/B,MAAMkG,EAAE,GAAGpL,QAAQ,CAACkF,UAAU,CAACkG,EAAE,CAAC;IAClC,MAAMoI,QAAQ,GAAGpI,EAAE,CAAChK,aAAa,CAAC0C,IAAI,CAAE2P,KAAK,IAAKA,KAAK,CAACrP,IAAI,KAAKc,UAAU,CAACd,IAAI,CAAC;IAEjF,IAAIoP,QAAQ,EAAE;MACZ,IAAIpR,OAAO,IAAIA,OAAO,CAACmR,QAAQ,EAAE;QAC/BzT,KAAK,CAAC4T,gBAAgB,CAAC;UAAEtP,IAAI,EAAEoP,QAAQ,CAACpP,IAAI;UAAEgH,EAAE,EAAElG,UAAU,CAACkG,EAAE;UAAEpH,OAAO,EAAEwP,QAAQ,CAACxP;QAAQ,CAAC,CAAC;MAC/F,CAAC,MAAM;QACL,MAAM,IAAIE,KAAK,CACb,sCAAsC,GAAGgB,UAAU,CAACd,IAAI,GAAG,QAAQ,GACnEgH,EAAE,CAACjM,IAAI,GAAG,GAAG,CAAC;MAClB;IACF;IAEAiM,EAAE,CAAChK,aAAa,CAACF,IAAI,CAAC;MACpBkD,IAAI,EAAEc,UAAU,CAACd,IAAI;MACrBgH,EAAE,EAAEA,EAAE,CAACjM,IAAI;MACX6E,OAAO,EAAEkB,UAAU,CAAClB,OAAO;MAC3BlD,KAAK,EAAEjB,YAAY;IACrB,CAAC,CAAC;EACJ,CAAC;;EAED;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEC,KAAK,CAAC6T,cAAc,GAAG,UAAU1P,WAAW,EAAE7B,OAAO,EAAE;IACrD6B,WAAW,CAAC6B,OAAO,CAACZ,UAAU,IAAIpF,KAAK,CAACwT,aAAa,CAACpO,UAAU,EAAE9C,OAAO,CAAC,CAAC;EAC7E,CAAC;;EAED;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEtC,KAAK,CAAC4T,gBAAgB,GAAG,UAAUxO,UAAU,EAAE;IAC7CmO,mBAAmB,CAACnO,UAAU,CAAC;IAC/B,MAAMkG,EAAE,GAAGpL,QAAQ,CAACkF,UAAU,CAACkG,EAAE,CAAC;IAClC,MAAMwI,kBAAkB,GACtBhC,WAAW,CAACxG,EAAE,CAAChK,aAAa,EAAE8I,CAAC,IAAKA,CAAC,CAAC9F,IAAI,KAAKc,UAAU,CAACd,IAAK,CAAC;IAClE,IAAI,CAACwP,kBAAkB,EAAE;MACvB,MAAM,IAAI1P,KAAK,CACb,gDAAgD,GAAGgB,UAAU,CAACd,IAAI,GAClE,MAAM,GAAGc,UAAU,CAACkG,EAAE,CAAC;IAC3B;IACA,IAAIwI,kBAAkB,CAAC5P,OAAO,KAAKkB,UAAU,CAAClB,OAAO,EAAE;MACrD,MAAM,IAAIE,KAAK,CACb,yDAAyD,CAAC;IAC9D;IACA,MAAMpD,KAAK,GAAGsK,EAAE,CAAChK,aAAa,CAACsD,OAAO,CAACkP,kBAAkB,CAAC;IAC1DxI,EAAE,CAAChK,aAAa,CAACyS,MAAM,CAAC/S,KAAK,EAAE,CAAC,CAAC;EACnC,CAAC;;EAED;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEhB,KAAK,CAACgU,OAAO,GAAG,UAAUC,EAAE,EAAEC,OAAO,EAAE;IACrC,IAAI,CAACjS,eAAe,CAACgS,EAAE,CAAC,EAAE;MACxB,MAAM,IAAIxT,SAAS,CAAC3B,kBAAkB,CAAC;IACzC;IACA,MAAMqV,IAAI,GAAGF,EAAE,CAACjR,kBAAkB,CAACF,UAAU;IAC7C,KAAK,IAAI5B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGiT,IAAI,CAACrT,MAAM,EAAE,EAAEI,CAAC,EAAE;MACpC,IAAIiT,IAAI,CAACjT,CAAC,CAAC,CAAC5B,IAAI,CAAC4U,OAAO,CAAC,EAAE;QACzB,OAAOC,IAAI,CAACjT,CAAC,CAAC;MAChB;IACF;IACA,OAAO,IAAI;EACb,CAAC;EAED,OAAOlB,KAAK;AACd;AAEA,eAAejB,MAAM,CAAC,CAAC","ignoreList":[]}
\ No newline at end of file
diff --git a/node_modules/typed-function/lib/umd/package.json b/node_modules/typed-function/lib/umd/package.json
new file mode 100644
index 0000000..5bbefff
--- /dev/null
+++ b/node_modules/typed-function/lib/umd/package.json
@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}
diff --git a/node_modules/typed-function/lib/umd/typed-function.js b/node_modules/typed-function/lib/umd/typed-function.js
new file mode 100644
index 0000000..db60e05
--- /dev/null
+++ b/node_modules/typed-function/lib/umd/typed-function.js
@@ -0,0 +1,1954 @@
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+  typeof define === 'function' && define.amd ? define(factory) :
+  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.typed = factory());
+})(this, (function () { 'use strict';
+
+  function ok() {
+    return true;
+  }
+  function notOk() {
+    return false;
+  }
+  function undef() {
+    return undefined;
+  }
+  const NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';
+
+  /**
+   * @typedef {{
+   *   params: Param[],
+   *   fn: function,
+   *   test: function,
+   *   implementation: function
+   * }} Signature
+   *
+   * @typedef {{
+   *   types: Type[],
+   *   hasAny: boolean,
+   *   hasConversion: boolean,
+   *   restParam: boolean
+   * }} Param
+   *
+   * @typedef {{
+   *   name: string,
+   *   typeIndex: number,
+   *   test: function,
+   *   isAny: boolean,
+   *   conversion?: ConversionDef,
+   *   conversionIndex: number,
+   * }} Type
+   *
+   * @typedef {{
+   *   from: string,
+   *   to: string,
+   *   convert: function (*) : *
+   * }} ConversionDef
+   *
+   * @typedef {{
+   *   name: string,
+   *   test: function(*) : boolean,
+   *   isAny?: boolean
+   * }} TypeDef
+   */
+
+  /**
+   * @returns {() => function}
+   */
+  function create() {
+    // data type tests
+
+    /**
+     * Returns true if the argument is a non-null "plain" object
+     */
+    function isPlainObject(x) {
+      return typeof x === 'object' && x !== null && x.constructor === Object;
+    }
+    const _types = [{
+      name: 'number',
+      test: function (x) {
+        return typeof x === 'number';
+      }
+    }, {
+      name: 'string',
+      test: function (x) {
+        return typeof x === 'string';
+      }
+    }, {
+      name: 'boolean',
+      test: function (x) {
+        return typeof x === 'boolean';
+      }
+    }, {
+      name: 'Function',
+      test: function (x) {
+        return typeof x === 'function';
+      }
+    }, {
+      name: 'Array',
+      test: Array.isArray
+    }, {
+      name: 'Date',
+      test: function (x) {
+        return x instanceof Date;
+      }
+    }, {
+      name: 'RegExp',
+      test: function (x) {
+        return x instanceof RegExp;
+      }
+    }, {
+      name: 'Object',
+      test: isPlainObject
+    }, {
+      name: 'null',
+      test: function (x) {
+        return x === null;
+      }
+    }, {
+      name: 'undefined',
+      test: function (x) {
+        return x === undefined;
+      }
+    }];
+    const anyType = {
+      name: 'any',
+      test: ok,
+      isAny: true
+    };
+
+    // Data structures to track the types. As these are local variables in
+    // create(), each typed universe will get its own copy, but the variables
+    // will only be accessible through the (closures of the) functions supplied
+    // as properties of the typed object, not directly.
+    // These will be initialized in clear() below
+    let typeMap; // primary store of all types
+    let typeList; // Array of just type names, for the sake of ordering
+
+    // And similar data structures for the type conversions:
+    let nConversions = 0;
+    // the actual conversions are stored on a property of the destination types
+
+    // This is a temporary object, will be replaced with a function at the end
+    let typed = {
+      createCount: 0
+    };
+
+    /**
+     * Takes a type name and returns the corresponding official type object
+     * for that type.
+     *
+     * @param {string} typeName
+     * @returns {TypeDef} type
+     */
+    function findType(typeName) {
+      const type = typeMap.get(typeName);
+      if (type) {
+        return type;
+      }
+      // Remainder is error handling
+      let message = 'Unknown type "' + typeName + '"';
+      const name = typeName.toLowerCase();
+      let otherName;
+      for (otherName of typeList) {
+        if (otherName.toLowerCase() === name) {
+          message += '. Did you mean "' + otherName + '" ?';
+          break;
+        }
+      }
+      throw new TypeError(message);
+    }
+
+    /**
+     * Adds an array `types` of type definitions to this typed instance.
+     * Each type definition should be an object with properties:
+     * 'name' - a string giving the name of the type; 'test' - function
+     * returning a boolean that tests membership in the type; and optionally
+     * 'isAny' - true only for the 'any' type.
+     *
+     * The second optional argument, `before`, gives the name of a type that
+     * these types should be added before. The new types are added in the
+     * order specified.
+     * @param {TypeDef[]} types
+     * @param {string | boolean} [beforeSpec='any'] before
+     */
+    function addTypes(types) {
+      let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';
+      const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;
+      const newTypes = [];
+      for (let i = 0; i < types.length; ++i) {
+        if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {
+          throw new TypeError('Object with properties {name: string, test: function} expected');
+        }
+        const typeName = types[i].name;
+        if (typeMap.has(typeName)) {
+          throw new TypeError('Duplicate type name "' + typeName + '"');
+        }
+        newTypes.push(typeName);
+        typeMap.set(typeName, {
+          name: typeName,
+          test: types[i].test,
+          isAny: types[i].isAny,
+          index: beforeIndex + i,
+          conversionsTo: [] // Newly added type can't have any conversions to it
+        });
+      }
+      // update the typeList
+      const affectedTypes = typeList.slice(beforeIndex);
+      typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);
+      // Fix the indices
+      for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {
+        typeMap.get(typeList[i]).index = i;
+      }
+    }
+
+    /**
+     * Removes all types and conversions from this typed instance.
+     * May cause previously constructed typed-functions to throw
+     * strange errors when they are called with types that do not
+     * match any of their signatures.
+     */
+    function clear() {
+      typeMap = new Map();
+      typeList = [];
+      nConversions = 0;
+      addTypes([anyType], false);
+    }
+
+    // initialize the types to the default list
+    clear();
+    addTypes(_types);
+
+    /**
+     * Removes all conversions, leaving the types alone.
+     */
+    function clearConversions() {
+      let typeName;
+      for (typeName of typeList) {
+        typeMap.get(typeName).conversionsTo = [];
+      }
+      nConversions = 0;
+    }
+
+    /**
+     * Find the type names that match a value.
+     * @param {*} value
+     * @return {string[]} Array of names of types for which
+     *                  the type test matches the value.
+     */
+    function findTypeNames(value) {
+      const matches = typeList.filter(name => {
+        const type = typeMap.get(name);
+        return !type.isAny && type.test(value);
+      });
+      if (matches.length) {
+        return matches;
+      }
+      return ['any'];
+    }
+
+    /**
+     * Check if an entity is a typed function created by any instance
+     * @param {any} entity
+     * @returns {boolean}
+     */
+    function isTypedFunction(entity) {
+      return entity && typeof entity === 'function' && '_typedFunctionData' in entity;
+    }
+
+    /**
+     * Find a specific signature from a (composed) typed function, for example:
+     *
+     *   typed.findSignature(fn, ['number', 'string'])
+     *   typed.findSignature(fn, 'number, string')
+     *   typed.findSignature(fn, 'number,string', {exact: true})
+     *
+     * This function findSignature will by default return the best match to
+     * the given signature, possibly employing type conversions.
+     *
+     * The (optional) third argument is a plain object giving options
+     * controlling the signature search. Currently the only implemented
+     * option is `exact`: if specified as true (default is false), only
+     * exact matches will be returned (i.e. signatures for which `fn` was
+     * directly defined). Note that a (possibly different) type matching
+     * `any`, or one or more instances of TYPE matching `...TYPE` are
+     * considered exact matches in this regard, as no conversions are used.
+     *
+     * This function returns a "signature" object, as does `typed.resolve()`,
+     * which is a plain object with four keys: `params` (the array of parameters
+     * for this signature), `fn` (the originally supplied function for this
+     * signature), `test` (a generated function that determines if an argument
+     * list matches this signature, and `implementation` (the function to call
+     * on a matching argument list, that performs conversions if necessary and
+     * then calls the originally supplied function).
+     *
+     * @param {Function} fn                   A typed-function
+     * @param {string | string[]} signature
+     *     Signature to be found, can be an array or a comma separated string.
+     * @param {object} options  Controls the signature search as documented
+     * @return {{ params: Param[], fn: function, test: function, implementation: function }}
+     *     Returns the matching signature, or throws an error when no signature
+     *     is found.
+     */
+    function findSignature(fn, signature, options) {
+      if (!isTypedFunction(fn)) {
+        throw new TypeError(NOT_TYPED_FUNCTION);
+      }
+
+      // Canonicalize input
+      const exact = options && options.exact;
+      const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;
+      const params = parseSignature(stringSignature);
+      const canonicalSignature = stringifyParams(params);
+
+      // First hope we get lucky and exactly match a signature
+      if (!exact || canonicalSignature in fn.signatures) {
+        // OK, we can check the internal signatures
+        const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);
+        if (match) {
+          return match;
+        }
+      }
+
+      // Oh well, we did not; so we have to go back and check the parameters
+      // one by one, in order to catch things like `any` and rest params.
+      // Note here we can assume there is at least one parameter, because
+      // the empty signature would have matched successfully above.
+      const nParams = params.length;
+      let remainingSignatures;
+      if (exact) {
+        remainingSignatures = [];
+        let name;
+        for (name in fn.signatures) {
+          remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));
+        }
+      } else {
+        remainingSignatures = fn._typedFunctionData.signatures;
+      }
+      for (let i = 0; i < nParams; ++i) {
+        const want = params[i];
+        const filteredSignatures = [];
+        let possibility;
+        for (possibility of remainingSignatures) {
+          const have = getParamAtIndex(possibility.params, i);
+          if (!have || want.restParam && !have.restParam) {
+            continue;
+          }
+          if (!have.hasAny) {
+            // have to check all of the wanted types are available
+            const haveTypes = paramTypeSet(have);
+            if (want.types.some(wtype => !haveTypes.has(wtype.name))) {
+              continue;
+            }
+          }
+          // OK, this looks good
+          filteredSignatures.push(possibility);
+        }
+        remainingSignatures = filteredSignatures;
+        if (remainingSignatures.length === 0) break;
+      }
+      // Return the first remaining signature that was totally matched:
+      let candidate;
+      for (candidate of remainingSignatures) {
+        if (candidate.params.length <= nParams) {
+          return candidate;
+        }
+      }
+      throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');
+    }
+
+    /**
+     * Find the proper function to call for a specific signature from
+     * a (composed) typed function, for example:
+     *
+     *   typed.find(fn, ['number', 'string'])
+     *   typed.find(fn, 'number, string')
+     *   typed.find(fn, 'number,string', {exact: true})
+     *
+     * This function find will by default return the best match to
+     * the given signature, possibly employing type conversions (and returning
+     * a function that will perform those conversions as needed). The
+     * (optional) third argument is a plain object giving options contolling
+     * the signature search. Currently only the option `exact` is implemented,
+     * which defaults to "false". If `exact` is specified as true, then only
+     * exact matches will be returned (i.e. signatures for which `fn` was
+     * directly defined). Uses of `any` and `...TYPE` are considered exact if
+     * no conversions are necessary to apply the corresponding function.
+     *
+     * @param {Function} fn                   A typed-function
+     * @param {string | string[]} signature
+     *     Signature to be found, can be an array or a comma separated string.
+     * @param {object} options  Controls the signature match as documented
+     * @return {function}
+     *     Returns the function to call for the given signature, or throws an
+     *     error if no match is found.
+     */
+    function find(fn, signature, options) {
+      return findSignature(fn, signature, options).implementation;
+    }
+
+    /**
+     * Convert a given value to another data type, specified by type name.
+     *
+     * @param {*} value
+     * @param {string} typeName
+     */
+    function convert(value, typeName) {
+      // check conversion is needed
+      const type = findType(typeName);
+      if (type.test(value)) {
+        return value;
+      }
+      const conversions = type.conversionsTo;
+      if (conversions.length === 0) {
+        throw new Error('There are no conversions to ' + typeName + ' defined.');
+      }
+      for (let i = 0; i < conversions.length; i++) {
+        const fromType = findType(conversions[i].from);
+        if (fromType.test(value)) {
+          return conversions[i].convert(value);
+        }
+      }
+      throw new Error('Cannot convert ' + value + ' to ' + typeName);
+    }
+
+    /**
+     * Stringify parameters in a normalized way
+     * @param {Param[]} params
+     * @param {string} [','] separator
+     * @return {string}
+     */
+    function stringifyParams(params) {
+      let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';
+      return params.map(p => p.name).join(separator);
+    }
+
+    /**
+     * Parse a parameter, like "...number | boolean"
+     * @param {string} param
+     * @return {Param} param
+     */
+    function parseParam(param) {
+      const restParam = param.indexOf('...') === 0;
+      const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';
+      const typeDefs = types.split('|').map(s => findType(s.trim()));
+      let hasAny = false;
+      let paramName = restParam ? '...' : '';
+      const exactTypes = typeDefs.map(function (type) {
+        hasAny = type.isAny || hasAny;
+        paramName += type.name + '|';
+        return {
+          name: type.name,
+          typeIndex: type.index,
+          test: type.test,
+          isAny: type.isAny,
+          conversion: null,
+          conversionIndex: -1
+        };
+      });
+      return {
+        types: exactTypes,
+        name: paramName.slice(0, -1),
+        // remove trailing '|' from above
+        hasAny,
+        hasConversion: false,
+        restParam
+      };
+    }
+
+    /**
+     * Expands a parsed parameter with the types available from currently
+     * defined conversions.
+     * @param {Param} param
+     * @return {Param} param
+     */
+    function expandParam(param) {
+      const typeNames = param.types.map(t => t.name);
+      const matchingConversions = availableConversions(typeNames);
+      let hasAny = param.hasAny;
+      let newName = param.name;
+      const convertibleTypes = matchingConversions.map(function (conversion) {
+        const type = findType(conversion.from);
+        hasAny = type.isAny || hasAny;
+        newName += '|' + conversion.from;
+        return {
+          name: conversion.from,
+          typeIndex: type.index,
+          test: type.test,
+          isAny: type.isAny,
+          conversion,
+          conversionIndex: conversion.index
+        };
+      });
+      return {
+        types: param.types.concat(convertibleTypes),
+        name: newName,
+        hasAny,
+        hasConversion: convertibleTypes.length > 0,
+        restParam: param.restParam
+      };
+    }
+
+    /**
+     * Return the set of type names in a parameter.
+     * Caches the result for efficiency
+     *
+     * @param {Param} param
+     * @return {Set<string>} typenames
+     */
+    function paramTypeSet(param) {
+      if (!param.typeSet) {
+        param.typeSet = new Set();
+        param.types.forEach(type => param.typeSet.add(type.name));
+      }
+      return param.typeSet;
+    }
+
+    /**
+     * Parse a signature with comma separated parameters,
+     * like "number | boolean, ...string"
+     *
+     * @param {string} signature
+     * @return {Param[]} params
+     */
+    function parseSignature(rawSignature) {
+      const params = [];
+      if (typeof rawSignature !== 'string') {
+        throw new TypeError('Signatures must be strings');
+      }
+      const signature = rawSignature.trim();
+      if (signature === '') {
+        return params;
+      }
+      const rawParams = signature.split(',');
+      for (let i = 0; i < rawParams.length; ++i) {
+        const parsedParam = parseParam(rawParams[i].trim());
+        if (parsedParam.restParam && i !== rawParams.length - 1) {
+          throw new SyntaxError('Unexpected rest parameter "' + rawParams[i] + '": ' + 'only allowed for the last parameter');
+        }
+        // if invalid, short-circuit (all the types may have been filtered)
+        if (parsedParam.types.length === 0) {
+          return null;
+        }
+        params.push(parsedParam);
+      }
+      return params;
+    }
+
+    /**
+     * Test whether a set of params contains a restParam
+     * @param {Param[]} params
+     * @return {boolean} Returns true when the last parameter is a restParam
+     */
+    function hasRestParam(params) {
+      const param = last(params);
+      return param ? param.restParam : false;
+    }
+
+    /**
+     * Create a type test for a single parameter, which can have one or multiple
+     * types.
+     * @param {Param} param
+     * @return {function(x: *) : boolean} Returns a test function
+     */
+    function compileTest(param) {
+      if (!param || param.types.length === 0) {
+        // nothing to do
+        return ok;
+      } else if (param.types.length === 1) {
+        return findType(param.types[0].name).test;
+      } else if (param.types.length === 2) {
+        const test0 = findType(param.types[0].name).test;
+        const test1 = findType(param.types[1].name).test;
+        return function or(x) {
+          return test0(x) || test1(x);
+        };
+      } else {
+        // param.types.length > 2
+        const tests = param.types.map(function (type) {
+          return findType(type.name).test;
+        });
+        return function or(x) {
+          for (let i = 0; i < tests.length; i++) {
+            if (tests[i](x)) {
+              return true;
+            }
+          }
+          return false;
+        };
+      }
+    }
+
+    /**
+     * Create a test for all parameters of a signature
+     * @param {Param[]} params
+     * @return {function(args: Array<*>) : boolean}
+     */
+    function compileTests(params) {
+      let tests, test0, test1;
+      if (hasRestParam(params)) {
+        // variable arguments like '...number'
+        tests = initial(params).map(compileTest);
+        const varIndex = tests.length;
+        const lastTest = compileTest(last(params));
+        const testRestParam = function (args) {
+          for (let i = varIndex; i < args.length; i++) {
+            if (!lastTest(args[i])) {
+              return false;
+            }
+          }
+          return true;
+        };
+        return function testArgs(args) {
+          for (let i = 0; i < tests.length; i++) {
+            if (!tests[i](args[i])) {
+              return false;
+            }
+          }
+          return testRestParam(args) && args.length >= varIndex + 1;
+        };
+      } else {
+        // no variable arguments
+        if (params.length === 0) {
+          return function testArgs(args) {
+            return args.length === 0;
+          };
+        } else if (params.length === 1) {
+          test0 = compileTest(params[0]);
+          return function testArgs(args) {
+            return test0(args[0]) && args.length === 1;
+          };
+        } else if (params.length === 2) {
+          test0 = compileTest(params[0]);
+          test1 = compileTest(params[1]);
+          return function testArgs(args) {
+            return test0(args[0]) && test1(args[1]) && args.length === 2;
+          };
+        } else {
+          // arguments.length > 2
+          tests = params.map(compileTest);
+          return function testArgs(args) {
+            for (let i = 0; i < tests.length; i++) {
+              if (!tests[i](args[i])) {
+                return false;
+              }
+            }
+            return args.length === tests.length;
+          };
+        }
+      }
+    }
+
+    /**
+     * Find the parameter at a specific index of a Params list.
+     * Handles rest parameters.
+     * @param {Param[]} params
+     * @param {number} index
+     * @return {Param | null} Returns the matching parameter when found,
+     *                        null otherwise.
+     */
+    function getParamAtIndex(params, index) {
+      return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;
+    }
+
+    /**
+     * Get all type names of a parameter
+     * @param {Params[]} params
+     * @param {number} index
+     * @return {string[]} Returns an array with type names
+     */
+    function getTypeSetAtIndex(params, index) {
+      const param = getParamAtIndex(params, index);
+      if (!param) {
+        return new Set();
+      }
+      return paramTypeSet(param);
+    }
+
+    /**
+     * Test whether a type is an exact type or conversion
+     * @param {Type} type
+     * @return {boolean} Returns true when
+     */
+    function isExactType(type) {
+      return type.conversion === null || type.conversion === undefined;
+    }
+
+    /**
+     * Helper function for creating error messages: create an array with
+     * all available types on a specific argument index.
+     * @param {Signature[]} signatures
+     * @param {number} index
+     * @return {string[]} Returns an array with available types
+     */
+    function mergeExpectedParams(signatures, index) {
+      const typeSet = new Set();
+      signatures.forEach(signature => {
+        const paramSet = getTypeSetAtIndex(signature.params, index);
+        let name;
+        for (name of paramSet) {
+          typeSet.add(name);
+        }
+      });
+      return typeSet.has('any') ? ['any'] : Array.from(typeSet);
+    }
+
+    /**
+     * Create
+     * @param {string} name             The name of the function
+     * @param {array.<*>} args          The actual arguments passed to the function
+     * @param {Signature[]} signatures  A list with available signatures
+     * @return {TypeError} Returns a type error with additional data
+     *                     attached to it in the property `data`
+     */
+    function createError(name, args, signatures) {
+      let err, expected;
+      const _name = name || 'unnamed';
+
+      // test for wrong type at some index
+      let matchingSignatures = signatures;
+      let index;
+      for (index = 0; index < args.length; index++) {
+        const nextMatchingDefs = [];
+        matchingSignatures.forEach(signature => {
+          const param = getParamAtIndex(signature.params, index);
+          const test = compileTest(param);
+          if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {
+            nextMatchingDefs.push(signature);
+          }
+        });
+        if (nextMatchingDefs.length === 0) {
+          // no matching signatures anymore, throw error "wrong type"
+          expected = mergeExpectedParams(matchingSignatures, index);
+          if (expected.length > 0) {
+            const actualTypes = findTypeNames(args[index]);
+            err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');
+            err.data = {
+              category: 'wrongType',
+              fn: _name,
+              index,
+              actual: actualTypes,
+              expected
+            };
+            return err;
+          }
+        } else {
+          matchingSignatures = nextMatchingDefs;
+        }
+      }
+
+      // test for too few arguments
+      const lengths = matchingSignatures.map(function (signature) {
+        return hasRestParam(signature.params) ? Infinity : signature.params.length;
+      });
+      if (args.length < Math.min.apply(null, lengths)) {
+        expected = mergeExpectedParams(matchingSignatures, index);
+        err = new TypeError('Too few arguments in function ' + _name + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');
+        err.data = {
+          category: 'tooFewArgs',
+          fn: _name,
+          index: args.length,
+          expected
+        };
+        return err;
+      }
+
+      // test for too many arguments
+      const maxLength = Math.max.apply(null, lengths);
+      if (args.length > maxLength) {
+        err = new TypeError('Too many arguments in function ' + _name + ' (expected: ' + maxLength + ', actual: ' + args.length + ')');
+        err.data = {
+          category: 'tooManyArgs',
+          fn: _name,
+          index: args.length,
+          expectedLength: maxLength
+        };
+        return err;
+      }
+
+      // Generic error
+      const argTypes = [];
+      for (let i = 0; i < args.length; ++i) {
+        argTypes.push(findTypeNames(args[i]).join('|'));
+      }
+      err = new TypeError('Arguments of type "' + argTypes.join(', ') + '" do not match any of the defined signatures of function ' + _name + '.');
+      err.data = {
+        category: 'mismatch',
+        actual: argTypes
+      };
+      return err;
+    }
+
+    /**
+     * Find the lowest index of all types of a parameter
+     * @param {Param} param
+     * @return {number} Returns the index of the lowest type in typed.types
+     */
+    function getLowestTypeIndex(param) {
+      let min = typeList.length + 1;
+      for (let i = 0; i < param.types.length; i++) {
+        min = Math.min(min, param.types[i].typeIndex);
+      }
+      return min;
+    }
+
+    /**
+     * Find the lowest index of the conversion of all types of the parameter
+     * having a conversion
+     * @param {Param} param
+     * @return {number} Returns the lowest index of the conversions of this type
+     */
+    function getLowestConversionIndex(param) {
+      let min = nConversions + 1;
+      for (let i = 0; i < param.types.length; i++) {
+        if (!isExactType(param.types[i])) {
+          min = Math.min(min, param.types[i].conversionIndex);
+        }
+      }
+      return min;
+    }
+
+    /**
+     * Compare two params. The return value is a number that is
+     * negative when param1 should be considered first, positive
+     * when param2 should be considered first, and zero when the
+     * params are indistinguishable. Primarily as a debugging aid,
+     * the value is always less than one in absolute value, and
+     * a smaller absolute value indicates a less important distinction
+     * between the parameters.
+     * @param {Param} param1
+     * @param {Param} param2
+     * @return {number} negative, positive, or zero depending on whether
+     *                  param1 should be ordered before, after, or equivalently
+     *                  to param2
+     */
+    function compareParams(param1, param2) {
+      // We compare a number of metrics on a param in turn:
+      // 1) 'any' parameters are the least preferred
+      if (param1.hasAny) {
+        if (!param2.hasAny) {
+          return 0.1;
+        }
+      } else if (param2.hasAny) {
+        return -0.1;
+      }
+
+      // 2) Prefer non-rest to rest parameters
+      if (param1.restParam) {
+        if (!param2.restParam) {
+          return 0.01;
+        }
+      } else if (param2.restParam) {
+        return -0.01;
+      }
+
+      // 3) Prefer lower type index:
+      const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);
+      if (typeDiff < 0) {
+        return -1e-3;
+      }
+      if (typeDiff > 0) {
+        return 0.001;
+      }
+
+      // 4) Prefer exact type match to conversions, with a strength that
+      //    grows with the conversion index
+      const conv1 = getLowestConversionIndex(param1);
+      const conv2 = getLowestConversionIndex(param2);
+      if (param1.hasConversion) {
+        if (!param2.hasConversion) {
+          return (1 + conv1) * 0.000001;
+        }
+      } else if (param2.hasConversion) {
+        return -(1 + conv2) * 0.000001;
+      }
+
+      // 5) Prefer lower conversion index
+      const convDiff = conv1 - conv2;
+      if (convDiff < 0) {
+        return -1e-7;
+      }
+      if (convDiff > 0) {
+        return 0.0000001;
+      }
+
+      // Don't have a basis for preference
+      return 0;
+    }
+
+    /**
+     * Compare two signatures. The result is a number that is negative
+     * when the first signature should be preferred to the second, positive
+     * when the second signature should be preferred, and zero in case the
+     * two signatures are essentially equivalent. Primarily as a debugging
+     * aid, a larger absolute value indicates a more "important" difference.
+     *
+     * @param {Signature} signature1
+     * @param {Signature} signature2
+     * @return {number} returns a negative number when signature1 must get a
+     *                  lower index than signature2, a positive number when the
+     *                  opposite holds, or zero when both are equivalent.
+     */
+    function compareSignatures(signature1, signature2) {
+      const pars1 = signature1.params;
+      const pars2 = signature2.params;
+      const last1 = last(pars1);
+      const last2 = last(pars2);
+      const hasRest1 = hasRestParam(pars1);
+      const hasRest2 = hasRestParam(pars2);
+      // We compare a number of metrics on signatures in turn:
+      // 1) An "any rest param" is least preferred
+      if (hasRest1 && last1.hasAny) {
+        if (!hasRest2 || !last2.hasAny) {
+          return 10000000;
+        }
+      } else if (hasRest2 && last2.hasAny) {
+        return -1e7;
+      }
+
+      // 2) Minimize the number of 'any' parameters
+      let any1 = 0;
+      let conv1 = 0;
+      let par;
+      for (par of pars1) {
+        if (par.hasAny) ++any1;
+        if (par.hasConversion) ++conv1;
+      }
+      let any2 = 0;
+      let conv2 = 0;
+      for (par of pars2) {
+        if (par.hasAny) ++any2;
+        if (par.hasConversion) ++conv2;
+      }
+      if (any1 !== any2) {
+        return (any1 - any2) * 1000000;
+      }
+
+      // 3) A conversion rest param is less preferred
+      if (hasRest1 && last1.hasConversion) {
+        if (!hasRest2 || !last2.hasConversion) {
+          return 100000;
+        }
+      } else if (hasRest2 && last2.hasConversion) {
+        return -1e5;
+      }
+
+      // 4) Minimize the number of conversions
+      if (conv1 !== conv2) {
+        return (conv1 - conv2) * 10000;
+      }
+
+      // 5) Prefer no rest param
+      if (hasRest1) {
+        if (!hasRest2) {
+          return 1000;
+        }
+      } else if (hasRest2) {
+        return -1e3;
+      }
+
+      // 6) Prefer shorter with rest param, longer without
+      const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);
+      if (lengthCriterion !== 0) {
+        return lengthCriterion;
+      }
+
+      // Signatures are identical in each of the above metrics.
+      // In particular, they are the same length.
+      // We can therefore compare the parameters one by one.
+      // First we count which signature has more preferred parameters.
+      const comparisons = [];
+      let tc = 0;
+      for (let i = 0; i < pars1.length; ++i) {
+        const thisComparison = compareParams(pars1[i], pars2[i]);
+        comparisons.push(thisComparison);
+        tc += thisComparison;
+      }
+      if (tc !== 0) {
+        return (tc < 0 ? -10 : 10) + tc;
+      }
+
+      // They have the same number of preferred parameters, so go by the
+      // earliest parameter in which we have a preference.
+      // In other words, dispatch is driven somewhat more by earlier
+      // parameters than later ones.
+      let c;
+      let bonus = 9;
+      const decrement = bonus / (comparisons.length + 1);
+      for (c of comparisons) {
+        if (c !== 0) {
+          return (c < 0 ? -bonus : bonus) + c;
+        }
+        bonus -= decrement;
+      }
+
+      // It's a tossup:
+      return 0;
+    }
+
+    /**
+     * Produce a list of all conversions from distinct types to one of
+     * the given types.
+     *
+     * @param {string[]} typeNames
+     * @return {ConversionDef[]} Returns the conversions that are available
+     *                        resulting in any given type (if any)
+     */
+    function availableConversions(typeNames) {
+      if (typeNames.length === 0) {
+        return [];
+      }
+      const types = typeNames.map(findType);
+      if (typeNames.length === 1) return types[0].conversionsTo;
+
+      // Here, for each type that occurs as the from-type of any conversion
+      // to any of the types found, we must select the conversion of
+      // lowest index from that type. So first collect the types.
+      const knownTypes = new Set(typeNames);
+      const convertibleTypes = new Set();
+      for (let i = 0; i < types.length; ++i) {
+        for (const match of types[i].conversionsTo) {
+          if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);
+        }
+      }
+
+      // Now get the lowest-index conversion for each type
+      const matches = [];
+      for (const typeName of convertibleTypes) {
+        let bestIndex = nConversions + 1;
+        let bestConversion = null;
+        for (let i = 0; i < types.length; ++i) {
+          for (const match of types[i].conversionsTo) {
+            if (match.from === typeName && match.index < bestIndex) {
+              bestIndex = match.index;
+              bestConversion = match;
+            }
+          }
+        }
+        matches.push(bestConversion);
+      }
+      return matches;
+    }
+
+    /**
+     * Preprocess arguments before calling the original function:
+     * - if needed convert the parameters
+     * - in case of rest parameters, move the rest parameters into an Array
+     * @param {Param[]} params
+     * @param {function} fn
+     * @return {function} Returns fn or a wrapped function if needed. If it
+     *                    has conversions, the function will be named to indicate
+     *                    what conversions are occurring.
+     */
+    function compileArgsPreprocessing(params, fn) {
+      let fnConvert = fn;
+
+      // TODO: can we make this wrapper function smarter/simpler?
+
+      let name = '';
+      if (params.some(p => p.hasConversion)) {
+        const restParam = hasRestParam(params);
+        const compiledConversions = params.map(compileArgConversion);
+        name = compiledConversions.map(conv => conv.name).join(';');
+        fnConvert = function convertArgs() {
+          const args = [];
+          const last = restParam ? arguments.length - 1 : arguments.length;
+          for (let i = 0; i < last; i++) {
+            args[i] = compiledConversions[i](arguments[i]);
+          }
+          if (restParam) {
+            args[last] = arguments[last].map(compiledConversions[last]);
+          }
+          return fn.apply(this, args);
+        };
+      }
+      let fnPreprocess = fnConvert;
+      if (hasRestParam(params)) {
+        const offset = params.length - 1;
+        fnPreprocess = function preprocessRestParams() {
+          return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));
+        };
+      }
+      if (name) Object.defineProperty(fnPreprocess, 'name', {
+        value: name
+      });
+      return fnPreprocess;
+    }
+
+    /**
+     * Compile conversion for a parameter to the right type
+     * @param {Param} param
+     * @return {function} Returns the wrapped function that will convert arguments
+     *
+     */
+    function compileArgConversion(param) {
+      let test0, test1, conversion0, conversion1;
+      const tests = [];
+      const conversions = [];
+      let name = '';
+      param.types.forEach(function (type) {
+        if (type.conversion) {
+          name += type.conversion.from + '~>' + type.conversion.to + ',';
+          tests.push(findType(type.conversion.from).test);
+          conversions.push(type.conversion.convert);
+        }
+      });
+      if (name) name = name.slice(0, -1);else name = 'pass';
+
+      // create optimized conversion functions depending on the number of conversions
+      let convertor = arg => arg;
+      switch (conversions.length) {
+        case 0:
+          break;
+        case 1:
+          test0 = tests[0];
+          conversion0 = conversions[0];
+          convertor = function convertArg(arg) {
+            if (test0(arg)) {
+              return conversion0(arg);
+            }
+            return arg;
+          };
+          break;
+        case 2:
+          test0 = tests[0];
+          test1 = tests[1];
+          conversion0 = conversions[0];
+          conversion1 = conversions[1];
+          convertor = function convertArg(arg) {
+            if (test0(arg)) {
+              return conversion0(arg);
+            }
+            if (test1(arg)) {
+              return conversion1(arg);
+            }
+            return arg;
+          };
+          break;
+        default:
+          convertor = function convertArg(arg) {
+            for (let i = 0; i < conversions.length; i++) {
+              if (tests[i](arg)) {
+                return conversions[i](arg);
+              }
+            }
+            return arg;
+          };
+      }
+      Object.defineProperty(convertor, 'name', {
+        value: name
+      });
+      return convertor;
+    }
+
+    /**
+     * Split params with union types in to separate params.
+     *
+     * For example:
+     *
+     *     splitParams([['Array', 'Object'], ['string', 'RegExp'])
+     *     // returns:
+     *     // [
+     *     //   ['Array', 'string'],
+     *     //   ['Array', 'RegExp'],
+     *     //   ['Object', 'string'],
+     *     //   ['Object', 'RegExp']
+     *     // ]
+     *
+     * @param {Param[]} params
+     * @return {Param[]}
+     */
+    function splitParams(params) {
+      function _splitParams(params, index, paramsSoFar) {
+        if (index < params.length) {
+          const param = params[index];
+          let resultingParams = [];
+          if (param.restParam) {
+            // split the types of a rest parameter in two:
+            // one with only exact types, and one with exact types and conversions
+            const exactTypes = param.types.filter(isExactType);
+            if (exactTypes.length < param.types.length) {
+              resultingParams.push({
+                types: exactTypes,
+                name: '...' + exactTypes.map(t => t.name).join('|'),
+                hasAny: exactTypes.some(t => t.isAny),
+                hasConversion: false,
+                restParam: true
+              });
+            }
+            resultingParams.push(param);
+          } else {
+            // split all the types of a regular parameter into one type per param
+            resultingParams = param.types.map(function (type) {
+              return {
+                types: [type],
+                name: type.name,
+                hasAny: type.isAny,
+                hasConversion: type.conversion,
+                restParam: false
+              };
+            });
+          }
+
+          // recurse over the groups with types
+          return flatMap(resultingParams, function (nextParam) {
+            return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));
+          });
+        } else {
+          // we've reached the end of the parameters.
+          return [paramsSoFar];
+        }
+      }
+      return _splitParams(params, 0, []);
+    }
+
+    /**
+     * Test whether two param lists represent conflicting signatures
+     * @param {Param[]} params1
+     * @param {Param[]} params2
+     * @return {boolean} Returns true when the signatures conflict, false otherwise.
+     */
+    function conflicting(params1, params2) {
+      const ii = Math.max(params1.length, params2.length);
+      for (let i = 0; i < ii; i++) {
+        const typeSet1 = getTypeSetAtIndex(params1, i);
+        const typeSet2 = getTypeSetAtIndex(params2, i);
+        let overlap = false;
+        let name;
+        for (name of typeSet2) {
+          if (typeSet1.has(name)) {
+            overlap = true;
+            break;
+          }
+        }
+        if (!overlap) {
+          return false;
+        }
+      }
+      const len1 = params1.length;
+      const len2 = params2.length;
+      const restParam1 = hasRestParam(params1);
+      const restParam2 = hasRestParam(params2);
+      return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;
+    }
+
+    /**
+     * Helper function for `resolveReferences` that returns a copy of
+     * functionList wihe any prior resolutions cleared out, in case we are
+     * recycling signatures from a prior typed function construction.
+     *
+     * @param {Array.<function|typed-reference>} functionList
+     * @return {Array.<function|typed-reference>}
+     */
+    function clearResolutions(functionList) {
+      return functionList.map(fn => {
+        if (isReferToSelf(fn)) {
+          return referToSelf(fn.referToSelf.callback);
+        }
+        if (isReferTo(fn)) {
+          return makeReferTo(fn.referTo.references, fn.referTo.callback);
+        }
+        return fn;
+      });
+    }
+
+    /**
+     * Take a list of references, a list of functions functionList, and a
+     * signatureMap indexing signatures into functionList, and return
+     * the list of resolutions, or a false-y value if they don't all
+     * resolve in a valid way (yet).
+     *
+     * @param {string[]} references
+     * @param {Array<function|typed-reference} functionList
+     * @param {Object.<string, integer>} signatureMap
+     * @return {function[] | false} resolutions
+     */
+    function collectResolutions(references, functionList, signatureMap) {
+      const resolvedReferences = [];
+      let reference;
+      for (reference of references) {
+        let resolution = signatureMap[reference];
+        if (typeof resolution !== 'number') {
+          throw new TypeError('No definition for referenced signature "' + reference + '"');
+        }
+        resolution = functionList[resolution];
+        if (typeof resolution !== 'function') {
+          return false;
+        }
+        resolvedReferences.push(resolution);
+      }
+      return resolvedReferences;
+    }
+
+    /**
+     * Resolve any references in the functionList for the typed function
+     * itself. The signatureMap tells which index in the functionList a
+     * given signature should be mapped to (for use in resolving typed.referTo)
+     * and self provides the destions of a typed.referToSelf.
+     *
+     * @param {Array<function | typed-reference-object>} functionList
+     * @param {Object.<string, function>} signatureMap
+     * @param {function} self  The typed-function itself
+     * @return {Array<function>} The list of resolved functions
+     */
+    function resolveReferences(functionList, signatureMap, self) {
+      const resolvedFunctions = clearResolutions(functionList);
+      const isResolved = new Array(resolvedFunctions.length).fill(false);
+      let leftUnresolved = true;
+      while (leftUnresolved) {
+        leftUnresolved = false;
+        let nothingResolved = true;
+        for (let i = 0; i < resolvedFunctions.length; ++i) {
+          if (isResolved[i]) continue;
+          const fn = resolvedFunctions[i];
+          if (isReferToSelf(fn)) {
+            resolvedFunctions[i] = fn.referToSelf.callback(self);
+            // Preserve reference in case signature is reused someday:
+            resolvedFunctions[i].referToSelf = fn.referToSelf;
+            isResolved[i] = true;
+            nothingResolved = false;
+          } else if (isReferTo(fn)) {
+            const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);
+            if (resolvedReferences) {
+              resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);
+              // Preserve reference in case signature is reused someday:
+              resolvedFunctions[i].referTo = fn.referTo;
+              isResolved[i] = true;
+              nothingResolved = false;
+            } else {
+              leftUnresolved = true;
+            }
+          }
+        }
+        if (nothingResolved && leftUnresolved) {
+          throw new SyntaxError('Circular reference detected in resolving typed.referTo');
+        }
+      }
+      return resolvedFunctions;
+    }
+
+    /**
+     * Validate whether any of the function bodies contains a self-reference
+     * usage like `this(...)` or `this.signatures`. This self-referencing is
+     * deprecated since typed-function v3. It has been replaced with
+     * the functions typed.referTo and typed.referToSelf.
+     * @param {Object.<string, function>} signaturesMap
+     */
+    function validateDeprecatedThis(signaturesMap) {
+      // TODO: remove this deprecation warning logic some day (it's introduced in v3)
+
+      // match occurrences like 'this(' and 'this.signatures'
+      const deprecatedThisRegex = /\bthis(\(|\.signatures\b)/;
+      Object.keys(signaturesMap).forEach(signature => {
+        const fn = signaturesMap[signature];
+        if (deprecatedThisRegex.test(fn.toString())) {
+          throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');
+        }
+      });
+    }
+
+    /**
+     * Create a typed function
+     * @param {String} name               The name for the typed function
+     * @param {Object.<string, function>} rawSignaturesMap
+     *                                    An object with one or
+     *                                    multiple signatures as key, and the
+     *                                    function corresponding to the
+     *                                    signature as value.
+     * @return {function}  Returns the created typed function.
+     */
+    function createTypedFunction(name, rawSignaturesMap) {
+      typed.createCount++;
+      if (Object.keys(rawSignaturesMap).length === 0) {
+        throw new SyntaxError('No signatures provided');
+      }
+      if (typed.warnAgainstDeprecatedThis) {
+        validateDeprecatedThis(rawSignaturesMap);
+      }
+
+      // Main processing loop for signatures
+      const parsedParams = [];
+      const originalFunctions = [];
+      const signaturesMap = {};
+      const preliminarySignatures = []; // may have duplicates from conversions
+      let signature;
+      for (signature in rawSignaturesMap) {
+        // A) Protect against polluted Object prototype:
+        if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {
+          continue;
+        }
+        // B) Parse the signature
+        const params = parseSignature(signature);
+        if (!params) continue;
+        // C) Check for conflicts
+        parsedParams.forEach(function (pp) {
+          if (conflicting(pp, params)) {
+            throw new TypeError('Conflicting signatures "' + stringifyParams(pp) + '" and "' + stringifyParams(params) + '".');
+          }
+        });
+        parsedParams.push(params);
+        // D) Store the provided function and add conversions
+        const functionIndex = originalFunctions.length;
+        originalFunctions.push(rawSignaturesMap[signature]);
+        const conversionParams = params.map(expandParam);
+        // E) Split the signatures and collect them up
+        let sp;
+        for (sp of splitParams(conversionParams)) {
+          const spName = stringifyParams(sp);
+          preliminarySignatures.push({
+            params: sp,
+            name: spName,
+            fn: functionIndex
+          });
+          if (sp.every(p => !p.hasConversion)) {
+            signaturesMap[spName] = functionIndex;
+          }
+        }
+      }
+      preliminarySignatures.sort(compareSignatures);
+
+      // Note the forward reference to theTypedFn
+      const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);
+
+      // Fill in the proper function for each signature
+      let s;
+      for (s in signaturesMap) {
+        if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {
+          signaturesMap[s] = resolvedFunctions[signaturesMap[s]];
+        }
+      }
+      const signatures = [];
+      const internalSignatureMap = new Map(); // benchmarks faster than object
+      for (s of preliminarySignatures) {
+        // Note it's only safe to eliminate duplicates like this
+        // _after_ the signature sorting step above; otherwise we might
+        // remove the wrong one.
+        if (!internalSignatureMap.has(s.name)) {
+          s.fn = resolvedFunctions[s.fn];
+          signatures.push(s);
+          internalSignatureMap.set(s.name, s);
+        }
+      }
+
+      // we create a highly optimized checks for the first couple of signatures with max 2 arguments
+      const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);
+      const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);
+      const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);
+      const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);
+      const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);
+      const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);
+      const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;
+
+      // compile the tests
+      for (let i = 0; i < signatures.length; ++i) {
+        signatures[i].test = compileTests(signatures[i].params);
+      }
+      const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;
+      const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;
+      const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;
+      const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;
+      const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;
+      const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;
+      const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;
+      const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;
+      const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;
+      const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;
+      const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;
+      const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;
+
+      // compile the functions
+      for (let i = 0; i < signatures.length; ++i) {
+        signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);
+      }
+      const fn0 = ok0 ? signatures[0].implementation : undef;
+      const fn1 = ok1 ? signatures[1].implementation : undef;
+      const fn2 = ok2 ? signatures[2].implementation : undef;
+      const fn3 = ok3 ? signatures[3].implementation : undef;
+      const fn4 = ok4 ? signatures[4].implementation : undef;
+      const fn5 = ok5 ? signatures[5].implementation : undef;
+      const len0 = ok0 ? signatures[0].params.length : -1;
+      const len1 = ok1 ? signatures[1].params.length : -1;
+      const len2 = ok2 ? signatures[2].params.length : -1;
+      const len3 = ok3 ? signatures[3].params.length : -1;
+      const len4 = ok4 ? signatures[4].params.length : -1;
+      const len5 = ok5 ? signatures[5].params.length : -1;
+
+      // simple and generic, but also slow
+      const iStart = allOk ? 6 : 0;
+      const iEnd = signatures.length;
+      // de-reference ahead for execution speed:
+      const tests = signatures.map(s => s.test);
+      const fns = signatures.map(s => s.implementation);
+      const generic = function generic() {
+
+        for (let i = iStart; i < iEnd; i++) {
+          if (tests[i](arguments)) {
+            return fns[i].apply(this, arguments);
+          }
+        }
+        return typed.onMismatch(name, arguments, signatures);
+      };
+
+      // create the typed function
+      // fast, specialized version. Falls back to the slower, generic one if needed
+      function theTypedFn(arg0, arg1) {
+
+        if (arguments.length === len0 && test00(arg0) && test01(arg1)) {
+          return fn0.apply(this, arguments);
+        }
+        if (arguments.length === len1 && test10(arg0) && test11(arg1)) {
+          return fn1.apply(this, arguments);
+        }
+        if (arguments.length === len2 && test20(arg0) && test21(arg1)) {
+          return fn2.apply(this, arguments);
+        }
+        if (arguments.length === len3 && test30(arg0) && test31(arg1)) {
+          return fn3.apply(this, arguments);
+        }
+        if (arguments.length === len4 && test40(arg0) && test41(arg1)) {
+          return fn4.apply(this, arguments);
+        }
+        if (arguments.length === len5 && test50(arg0) && test51(arg1)) {
+          return fn5.apply(this, arguments);
+        }
+        return generic.apply(this, arguments);
+      }
+
+      // attach name the typed function
+      try {
+        Object.defineProperty(theTypedFn, 'name', {
+          value: name
+        });
+      } catch (err) {
+        // old browsers do not support Object.defineProperty and some don't support setting the name property
+        // the function name is not essential for the functioning, it's mostly useful for debugging,
+        // so it's fine to have unnamed functions.
+      }
+
+      // attach signatures to the function.
+      // This property is close to the original collection of signatures
+      // used to create the typed-function, just with unions split:
+      theTypedFn.signatures = signaturesMap;
+
+      // Store internal data for functions like resolve, find, etc.
+      // Also serves as the flag that this is a typed-function
+      theTypedFn._typedFunctionData = {
+        signatures,
+        signatureMap: internalSignatureMap
+      };
+      return theTypedFn;
+    }
+
+    /**
+     * Action to take on mismatch
+     * @param {string} name      Name of function that was attempted to be called
+     * @param {Array} args       Actual arguments to the call
+     * @param {Array} signatures Known signatures of the named typed-function
+     */
+    function _onMismatch(name, args, signatures) {
+      throw createError(name, args, signatures);
+    }
+
+    /**
+     * Return all but the last items of an array or function Arguments
+     * @param {Array | Arguments} arr
+     * @return {Array}
+     */
+    function initial(arr) {
+      return slice(arr, 0, arr.length - 1);
+    }
+
+    /**
+     * return the last item of an array or function Arguments
+     * @param {Array | Arguments} arr
+     * @return {*}
+     */
+    function last(arr) {
+      return arr[arr.length - 1];
+    }
+
+    /**
+     * Slice an array or function Arguments
+     * @param {Array | Arguments | IArguments} arr
+     * @param {number} start
+     * @param {number} [end]
+     * @return {Array}
+     */
+    function slice(arr, start, end) {
+      return Array.prototype.slice.call(arr, start, end);
+    }
+
+    /**
+     * Return the first item from an array for which test(arr[i]) returns true
+     * @param {Array} arr
+     * @param {function} test
+     * @return {* | undefined} Returns the first matching item
+     *                         or undefined when there is no match
+     */
+    function findInArray(arr, test) {
+      for (let i = 0; i < arr.length; i++) {
+        if (test(arr[i])) {
+          return arr[i];
+        }
+      }
+      return undefined;
+    }
+
+    /**
+     * Flat map the result invoking a callback for every item in an array.
+     * https://gist.github.com/samgiles/762ee337dff48623e729
+     * @param {Array} arr
+     * @param {function} callback
+     * @return {Array}
+     */
+    function flatMap(arr, callback) {
+      return Array.prototype.concat.apply([], arr.map(callback));
+    }
+
+    /**
+     * Create a reference callback to one or multiple signatures
+     *
+     * Syntax:
+     *
+     *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {
+     *       // ...
+     *     })
+     *
+     * @returns {{referTo: {references: string[], callback}}}
+     */
+    function referTo() {
+      const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));
+      const callback = last(arguments);
+      if (typeof callback !== 'function') {
+        throw new TypeError('Callback function expected as last argument');
+      }
+      return makeReferTo(references, callback);
+    }
+    function makeReferTo(references, callback) {
+      return {
+        referTo: {
+          references,
+          callback
+        }
+      };
+    }
+
+    /**
+     * Create a reference callback to the typed-function itself
+     *
+     * @param {(self: function) => function} callback
+     * @returns {{referToSelf: { callback: function }}}
+     */
+    function referToSelf(callback) {
+      if (typeof callback !== 'function') {
+        throw new TypeError('Callback function expected as first argument');
+      }
+      return {
+        referToSelf: {
+          callback
+        }
+      };
+    }
+
+    /**
+     * Test whether something is a referTo object, holding a list with reference
+     * signatures and a callback.
+     *
+     * @param {Object | function} objectOrFn
+     * @returns {boolean}
+     */
+    function isReferTo(objectOrFn) {
+      return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';
+    }
+
+    /**
+     * Test whether something is a referToSelf object, holding a callback where
+     * to pass `self`.
+     *
+     * @param {Object | function} objectOrFn
+     * @returns {boolean}
+     */
+    function isReferToSelf(objectOrFn) {
+      return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';
+    }
+
+    /**
+     * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw
+     * an error in case (C).
+     *
+     * @param { string | undefined } nameSoFar
+     * @param { string | undefined } newName
+     * @returns { string } updated name
+     */
+    function checkName(nameSoFar, newName) {
+      if (!nameSoFar) {
+        return newName;
+      }
+      if (newName && newName !== nameSoFar) {
+        const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');
+        err.data = {
+          actual: newName,
+          expected: nameSoFar
+        };
+        throw err;
+      }
+      return nameSoFar;
+    }
+
+    /**
+     * Retrieve the implied name from an object with signature keys
+     * and function values, checking whether all value names match
+     *
+     * @param { {string: function} } obj
+     */
+    function getObjectName(obj) {
+      let name;
+      for (const key in obj) {
+        // Only pay attention to own properties, and only if their values
+        // are typed functions or functions with a signature property
+        if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {
+          name = checkName(name, obj[key].name);
+        }
+      }
+      return name;
+    }
+
+    /**
+     * Copy all of the signatures from the second argument into the first,
+     * which is modified by side effect, checking for conflicts
+     *
+     * @param {Object.<string, function|typed-reference>} dest
+     * @param {Object.<string, function|typed-reference>} source
+     */
+    function mergeSignatures(dest, source) {
+      let key;
+      for (key in source) {
+        if (Object.prototype.hasOwnProperty.call(source, key)) {
+          if (key in dest) {
+            if (source[key] !== dest[key]) {
+              const err = new Error('Signature "' + key + '" is defined twice');
+              err.data = {
+                signature: key,
+                sourceFunction: source[key],
+                destFunction: dest[key]
+              };
+              throw err;
+            }
+            // else: both signatures point to the same function, that's fine
+          }
+          dest[key] = source[key];
+        }
+      }
+    }
+    const saveTyped = typed;
+
+    /**
+     * Originally the main function was a typed function itself, but then
+     * it might not be able to generate error messages if the client
+     * replaced the type system with different names.
+     *
+     * Main entry: typed([name], functions/objects with signatures...)
+     *
+     * Assembles and returns a new typed-function from the given items
+     * that provide signatures and implementations, each of which may be
+     * * a plain object mapping (string) signatures to implementing functions,
+     * * a previously constructed typed function, or
+     * * any other single function with a string-valued property `signature`.
+      * The name of the resulting typed-function will be given by the
+     * string-valued name argument if present, or if not, by the name
+     * of any of the arguments that have one, as long as any that do are
+     * consistent with each other. If no name is specified, the name will be
+     * an empty string.
+     *
+     * @param {string} maybeName [optional]
+     * @param {(function|object)[]} signature providers
+     * @returns {typed-function}
+     */
+    typed = function (maybeName) {
+      const named = typeof maybeName === 'string';
+      const start = named ? 1 : 0;
+      let name = named ? maybeName : '';
+      const allSignatures = {};
+      for (let i = start; i < arguments.length; ++i) {
+        const item = arguments[i];
+        let theseSignatures = {};
+        let thisName;
+        if (typeof item === 'function') {
+          thisName = item.name;
+          if (typeof item.signature === 'string') {
+            // Case 1: Ordinary function with a string 'signature' property
+            theseSignatures[item.signature] = item;
+          } else if (isTypedFunction(item)) {
+            // Case 2: Existing typed function
+            theseSignatures = item.signatures;
+          }
+        } else if (isPlainObject(item)) {
+          // Case 3: Plain object, assume keys = signatures, values = functions
+          theseSignatures = item;
+          if (!named) {
+            thisName = getObjectName(item);
+          }
+        }
+        if (Object.keys(theseSignatures).length === 0) {
+          const err = new TypeError('Argument to \'typed\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');
+          err.data = {
+            index: i,
+            argument: item
+          };
+          throw err;
+        }
+        if (!named) {
+          name = checkName(name, thisName);
+        }
+        mergeSignatures(allSignatures, theseSignatures);
+      }
+      return createTypedFunction(name || '', allSignatures);
+    };
+    typed.create = create;
+    typed.createCount = saveTyped.createCount;
+    typed.onMismatch = _onMismatch;
+    typed.throwMismatchError = _onMismatch;
+    typed.createError = createError;
+    typed.clear = clear;
+    typed.clearConversions = clearConversions;
+    typed.addTypes = addTypes;
+    typed._findType = findType; // For unit testing only
+    typed.referTo = referTo;
+    typed.referToSelf = referToSelf;
+    typed.convert = convert;
+    typed.findSignature = findSignature;
+    typed.find = find;
+    typed.isTypedFunction = isTypedFunction;
+    typed.warnAgainstDeprecatedThis = true;
+
+    /**
+     * add a type (convenience wrapper for typed.addTypes)
+     * @param {{name: string, test: function}} type
+     * @param {boolean} [beforeObjectTest=true]
+     *                          If true, the new test will be inserted before
+     *                          the test with name 'Object' (if any), since
+     *                          tests for Object match Array and classes too.
+     */
+    typed.addType = function (type, beforeObjectTest) {
+      let before = 'any';
+      if (beforeObjectTest !== false && typeMap.has('Object')) {
+        before = 'Object';
+      }
+      typed.addTypes([type], before);
+    };
+
+    /**
+     * Verify that the ConversionDef conversion has a valid format.
+     *
+     * @param {conversionDef} conversion
+     * @return {void}
+     * @throws {TypeError|SyntaxError}
+     */
+    function _validateConversion(conversion) {
+      if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {
+        throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');
+      }
+      if (conversion.to === conversion.from) {
+        throw new SyntaxError('Illegal to define conversion from "' + conversion.from + '" to itself.');
+      }
+    }
+
+    /**
+     * Add a conversion
+     *
+     * @param {ConversionDef} conversion
+     * @param {{override: boolean}} [options]
+     * @returns {void}
+     * @throws {TypeError}
+     */
+    typed.addConversion = function (conversion) {
+      let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {
+        override: false
+      };
+      _validateConversion(conversion);
+      const to = findType(conversion.to);
+      const existing = to.conversionsTo.find(other => other.from === conversion.from);
+      if (existing) {
+        if (options && options.override) {
+          typed.removeConversion({
+            from: existing.from,
+            to: conversion.to,
+            convert: existing.convert
+          });
+        } else {
+          throw new Error('There is already a conversion from "' + conversion.from + '" to "' + to.name + '"');
+        }
+      }
+      to.conversionsTo.push({
+        from: conversion.from,
+        to: to.name,
+        convert: conversion.convert,
+        index: nConversions++
+      });
+    };
+
+    /**
+     * Convenience wrapper to call addConversion on each conversion in a list.
+     *
+     * @param {ConversionDef[]} conversions
+     * @param {{override: boolean}} [options]
+     * @returns {void}
+     * @throws {TypeError}
+     */
+    typed.addConversions = function (conversions, options) {
+      conversions.forEach(conversion => typed.addConversion(conversion, options));
+    };
+
+    /**
+     * Remove the specified conversion. The format is the same as for
+     * addConversion, and the convert function must match or an error
+     * is thrown.
+     *
+     * @param {{from: string, to: string, convert: function}} conversion
+     * @returns {void}
+     * @throws {TypeError|SyntaxError|Error}
+     */
+    typed.removeConversion = function (conversion) {
+      _validateConversion(conversion);
+      const to = findType(conversion.to);
+      const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);
+      if (!existingConversion) {
+        throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);
+      }
+      if (existingConversion.convert !== conversion.convert) {
+        throw new Error('Conversion to remove does not match existing conversion');
+      }
+      const index = to.conversionsTo.indexOf(existingConversion);
+      to.conversionsTo.splice(index, 1);
+    };
+
+    /**
+     * Produce the specific signature that a typed function
+     * will execute on the given arguments. Here, a "signature" is an
+     * object with properties 'params', 'test', 'fn', and 'implementation'.
+     * This last property is a function that converts params as necessary
+     * and then calls 'fn'. Returns null if there is no matching signature.
+     * @param {typed-function} tf
+     * @param {any[]} argList
+     * @returns {{params: string, test: function, fn: function, implementation: function}}
+     */
+    typed.resolve = function (tf, argList) {
+      if (!isTypedFunction(tf)) {
+        throw new TypeError(NOT_TYPED_FUNCTION);
+      }
+      const sigs = tf._typedFunctionData.signatures;
+      for (let i = 0; i < sigs.length; ++i) {
+        if (sigs[i].test(argList)) {
+          return sigs[i];
+        }
+      }
+      return null;
+    };
+    return typed;
+  }
+  var typedFunction = create();
+
+  return typedFunction;
+
+}));
+//# sourceMappingURL=typed-function.js.map
diff --git a/node_modules/typed-function/lib/umd/typed-function.js.map b/node_modules/typed-function/lib/umd/typed-function.js.map
new file mode 100644
index 0000000..52908a0
--- /dev/null
+++ b/node_modules/typed-function/lib/umd/typed-function.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"typed-function.js","sources":["../esm/typed-function.mjs"],"sourcesContent":["function ok() {\n  return true;\n}\nfunction notOk() {\n  return false;\n}\nfunction undef() {\n  return undefined;\n}\nconst NOT_TYPED_FUNCTION = 'Argument is not a typed-function.';\n\n/**\n * @typedef {{\n *   params: Param[],\n *   fn: function,\n *   test: function,\n *   implementation: function\n * }} Signature\n *\n * @typedef {{\n *   types: Type[],\n *   hasAny: boolean,\n *   hasConversion: boolean,\n *   restParam: boolean\n * }} Param\n *\n * @typedef {{\n *   name: string,\n *   typeIndex: number,\n *   test: function,\n *   isAny: boolean,\n *   conversion?: ConversionDef,\n *   conversionIndex: number,\n * }} Type\n *\n * @typedef {{\n *   from: string,\n *   to: string,\n *   convert: function (*) : *\n * }} ConversionDef\n *\n * @typedef {{\n *   name: string,\n *   test: function(*) : boolean,\n *   isAny?: boolean\n * }} TypeDef\n */\n\n/**\n * @returns {() => function}\n */\nfunction create() {\n  // data type tests\n\n  /**\n   * Returns true if the argument is a non-null \"plain\" object\n   */\n  function isPlainObject(x) {\n    return typeof x === 'object' && x !== null && x.constructor === Object;\n  }\n  const _types = [{\n    name: 'number',\n    test: function (x) {\n      return typeof x === 'number';\n    }\n  }, {\n    name: 'string',\n    test: function (x) {\n      return typeof x === 'string';\n    }\n  }, {\n    name: 'boolean',\n    test: function (x) {\n      return typeof x === 'boolean';\n    }\n  }, {\n    name: 'Function',\n    test: function (x) {\n      return typeof x === 'function';\n    }\n  }, {\n    name: 'Array',\n    test: Array.isArray\n  }, {\n    name: 'Date',\n    test: function (x) {\n      return x instanceof Date;\n    }\n  }, {\n    name: 'RegExp',\n    test: function (x) {\n      return x instanceof RegExp;\n    }\n  }, {\n    name: 'Object',\n    test: isPlainObject\n  }, {\n    name: 'null',\n    test: function (x) {\n      return x === null;\n    }\n  }, {\n    name: 'undefined',\n    test: function (x) {\n      return x === undefined;\n    }\n  }];\n  const anyType = {\n    name: 'any',\n    test: ok,\n    isAny: true\n  };\n\n  // Data structures to track the types. As these are local variables in\n  // create(), each typed universe will get its own copy, but the variables\n  // will only be accessible through the (closures of the) functions supplied\n  // as properties of the typed object, not directly.\n  // These will be initialized in clear() below\n  let typeMap; // primary store of all types\n  let typeList; // Array of just type names, for the sake of ordering\n\n  // And similar data structures for the type conversions:\n  let nConversions = 0;\n  // the actual conversions are stored on a property of the destination types\n\n  // This is a temporary object, will be replaced with a function at the end\n  let typed = {\n    createCount: 0\n  };\n\n  /**\n   * Takes a type name and returns the corresponding official type object\n   * for that type.\n   *\n   * @param {string} typeName\n   * @returns {TypeDef} type\n   */\n  function findType(typeName) {\n    const type = typeMap.get(typeName);\n    if (type) {\n      return type;\n    }\n    // Remainder is error handling\n    let message = 'Unknown type \"' + typeName + '\"';\n    const name = typeName.toLowerCase();\n    let otherName;\n    for (otherName of typeList) {\n      if (otherName.toLowerCase() === name) {\n        message += '. Did you mean \"' + otherName + '\" ?';\n        break;\n      }\n    }\n    throw new TypeError(message);\n  }\n\n  /**\n   * Adds an array `types` of type definitions to this typed instance.\n   * Each type definition should be an object with properties:\n   * 'name' - a string giving the name of the type; 'test' - function\n   * returning a boolean that tests membership in the type; and optionally\n   * 'isAny' - true only for the 'any' type.\n   *\n   * The second optional argument, `before`, gives the name of a type that\n   * these types should be added before. The new types are added in the\n   * order specified.\n   * @param {TypeDef[]} types\n   * @param {string | boolean} [beforeSpec='any'] before\n   */\n  function addTypes(types) {\n    let beforeSpec = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'any';\n    const beforeIndex = beforeSpec ? findType(beforeSpec).index : typeList.length;\n    const newTypes = [];\n    for (let i = 0; i < types.length; ++i) {\n      if (!types[i] || typeof types[i].name !== 'string' || typeof types[i].test !== 'function') {\n        throw new TypeError('Object with properties {name: string, test: function} expected');\n      }\n      const typeName = types[i].name;\n      if (typeMap.has(typeName)) {\n        throw new TypeError('Duplicate type name \"' + typeName + '\"');\n      }\n      newTypes.push(typeName);\n      typeMap.set(typeName, {\n        name: typeName,\n        test: types[i].test,\n        isAny: types[i].isAny,\n        index: beforeIndex + i,\n        conversionsTo: [] // Newly added type can't have any conversions to it\n      });\n    }\n    // update the typeList\n    const affectedTypes = typeList.slice(beforeIndex);\n    typeList = typeList.slice(0, beforeIndex).concat(newTypes).concat(affectedTypes);\n    // Fix the indices\n    for (let i = beforeIndex + newTypes.length; i < typeList.length; ++i) {\n      typeMap.get(typeList[i]).index = i;\n    }\n  }\n\n  /**\n   * Removes all types and conversions from this typed instance.\n   * May cause previously constructed typed-functions to throw\n   * strange errors when they are called with types that do not\n   * match any of their signatures.\n   */\n  function clear() {\n    typeMap = new Map();\n    typeList = [];\n    nConversions = 0;\n    addTypes([anyType], false);\n  }\n\n  // initialize the types to the default list\n  clear();\n  addTypes(_types);\n\n  /**\n   * Removes all conversions, leaving the types alone.\n   */\n  function clearConversions() {\n    let typeName;\n    for (typeName of typeList) {\n      typeMap.get(typeName).conversionsTo = [];\n    }\n    nConversions = 0;\n  }\n\n  /**\n   * Find the type names that match a value.\n   * @param {*} value\n   * @return {string[]} Array of names of types for which\n   *                  the type test matches the value.\n   */\n  function findTypeNames(value) {\n    const matches = typeList.filter(name => {\n      const type = typeMap.get(name);\n      return !type.isAny && type.test(value);\n    });\n    if (matches.length) {\n      return matches;\n    }\n    return ['any'];\n  }\n\n  /**\n   * Check if an entity is a typed function created by any instance\n   * @param {any} entity\n   * @returns {boolean}\n   */\n  function isTypedFunction(entity) {\n    return entity && typeof entity === 'function' && '_typedFunctionData' in entity;\n  }\n\n  /**\n   * Find a specific signature from a (composed) typed function, for example:\n   *\n   *   typed.findSignature(fn, ['number', 'string'])\n   *   typed.findSignature(fn, 'number, string')\n   *   typed.findSignature(fn, 'number,string', {exact: true})\n   *\n   * This function findSignature will by default return the best match to\n   * the given signature, possibly employing type conversions.\n   *\n   * The (optional) third argument is a plain object giving options\n   * controlling the signature search. Currently the only implemented\n   * option is `exact`: if specified as true (default is false), only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Note that a (possibly different) type matching\n   * `any`, or one or more instances of TYPE matching `...TYPE` are\n   * considered exact matches in this regard, as no conversions are used.\n   *\n   * This function returns a \"signature\" object, as does `typed.resolve()`,\n   * which is a plain object with four keys: `params` (the array of parameters\n   * for this signature), `fn` (the originally supplied function for this\n   * signature), `test` (a generated function that determines if an argument\n   * list matches this signature, and `implementation` (the function to call\n   * on a matching argument list, that performs conversions if necessary and\n   * then calls the originally supplied function).\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature search as documented\n   * @return {{ params: Param[], fn: function, test: function, implementation: function }}\n   *     Returns the matching signature, or throws an error when no signature\n   *     is found.\n   */\n  function findSignature(fn, signature, options) {\n    if (!isTypedFunction(fn)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    }\n\n    // Canonicalize input\n    const exact = options && options.exact;\n    const stringSignature = Array.isArray(signature) ? signature.join(',') : signature;\n    const params = parseSignature(stringSignature);\n    const canonicalSignature = stringifyParams(params);\n\n    // First hope we get lucky and exactly match a signature\n    if (!exact || canonicalSignature in fn.signatures) {\n      // OK, we can check the internal signatures\n      const match = fn._typedFunctionData.signatureMap.get(canonicalSignature);\n      if (match) {\n        return match;\n      }\n    }\n\n    // Oh well, we did not; so we have to go back and check the parameters\n    // one by one, in order to catch things like `any` and rest params.\n    // Note here we can assume there is at least one parameter, because\n    // the empty signature would have matched successfully above.\n    const nParams = params.length;\n    let remainingSignatures;\n    if (exact) {\n      remainingSignatures = [];\n      let name;\n      for (name in fn.signatures) {\n        remainingSignatures.push(fn._typedFunctionData.signatureMap.get(name));\n      }\n    } else {\n      remainingSignatures = fn._typedFunctionData.signatures;\n    }\n    for (let i = 0; i < nParams; ++i) {\n      const want = params[i];\n      const filteredSignatures = [];\n      let possibility;\n      for (possibility of remainingSignatures) {\n        const have = getParamAtIndex(possibility.params, i);\n        if (!have || want.restParam && !have.restParam) {\n          continue;\n        }\n        if (!have.hasAny) {\n          // have to check all of the wanted types are available\n          const haveTypes = paramTypeSet(have);\n          if (want.types.some(wtype => !haveTypes.has(wtype.name))) {\n            continue;\n          }\n        }\n        // OK, this looks good\n        filteredSignatures.push(possibility);\n      }\n      remainingSignatures = filteredSignatures;\n      if (remainingSignatures.length === 0) break;\n    }\n    // Return the first remaining signature that was totally matched:\n    let candidate;\n    for (candidate of remainingSignatures) {\n      if (candidate.params.length <= nParams) {\n        return candidate;\n      }\n    }\n    throw new TypeError('Signature not found (signature: ' + (fn.name || 'unnamed') + '(' + stringifyParams(params, ', ') + '))');\n  }\n\n  /**\n   * Find the proper function to call for a specific signature from\n   * a (composed) typed function, for example:\n   *\n   *   typed.find(fn, ['number', 'string'])\n   *   typed.find(fn, 'number, string')\n   *   typed.find(fn, 'number,string', {exact: true})\n   *\n   * This function find will by default return the best match to\n   * the given signature, possibly employing type conversions (and returning\n   * a function that will perform those conversions as needed). The\n   * (optional) third argument is a plain object giving options contolling\n   * the signature search. Currently only the option `exact` is implemented,\n   * which defaults to \"false\". If `exact` is specified as true, then only\n   * exact matches will be returned (i.e. signatures for which `fn` was\n   * directly defined). Uses of `any` and `...TYPE` are considered exact if\n   * no conversions are necessary to apply the corresponding function.\n   *\n   * @param {Function} fn                   A typed-function\n   * @param {string | string[]} signature\n   *     Signature to be found, can be an array or a comma separated string.\n   * @param {object} options  Controls the signature match as documented\n   * @return {function}\n   *     Returns the function to call for the given signature, or throws an\n   *     error if no match is found.\n   */\n  function find(fn, signature, options) {\n    return findSignature(fn, signature, options).implementation;\n  }\n\n  /**\n   * Convert a given value to another data type, specified by type name.\n   *\n   * @param {*} value\n   * @param {string} typeName\n   */\n  function convert(value, typeName) {\n    // check conversion is needed\n    const type = findType(typeName);\n    if (type.test(value)) {\n      return value;\n    }\n    const conversions = type.conversionsTo;\n    if (conversions.length === 0) {\n      throw new Error('There are no conversions to ' + typeName + ' defined.');\n    }\n    for (let i = 0; i < conversions.length; i++) {\n      const fromType = findType(conversions[i].from);\n      if (fromType.test(value)) {\n        return conversions[i].convert(value);\n      }\n    }\n    throw new Error('Cannot convert ' + value + ' to ' + typeName);\n  }\n\n  /**\n   * Stringify parameters in a normalized way\n   * @param {Param[]} params\n   * @param {string} [','] separator\n   * @return {string}\n   */\n  function stringifyParams(params) {\n    let separator = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ',';\n    return params.map(p => p.name).join(separator);\n  }\n\n  /**\n   * Parse a parameter, like \"...number | boolean\"\n   * @param {string} param\n   * @return {Param} param\n   */\n  function parseParam(param) {\n    const restParam = param.indexOf('...') === 0;\n    const types = !restParam ? param : param.length > 3 ? param.slice(3) : 'any';\n    const typeDefs = types.split('|').map(s => findType(s.trim()));\n    let hasAny = false;\n    let paramName = restParam ? '...' : '';\n    const exactTypes = typeDefs.map(function (type) {\n      hasAny = type.isAny || hasAny;\n      paramName += type.name + '|';\n      return {\n        name: type.name,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion: null,\n        conversionIndex: -1\n      };\n    });\n    return {\n      types: exactTypes,\n      name: paramName.slice(0, -1),\n      // remove trailing '|' from above\n      hasAny,\n      hasConversion: false,\n      restParam\n    };\n  }\n\n  /**\n   * Expands a parsed parameter with the types available from currently\n   * defined conversions.\n   * @param {Param} param\n   * @return {Param} param\n   */\n  function expandParam(param) {\n    const typeNames = param.types.map(t => t.name);\n    const matchingConversions = availableConversions(typeNames);\n    let hasAny = param.hasAny;\n    let newName = param.name;\n    const convertibleTypes = matchingConversions.map(function (conversion) {\n      const type = findType(conversion.from);\n      hasAny = type.isAny || hasAny;\n      newName += '|' + conversion.from;\n      return {\n        name: conversion.from,\n        typeIndex: type.index,\n        test: type.test,\n        isAny: type.isAny,\n        conversion,\n        conversionIndex: conversion.index\n      };\n    });\n    return {\n      types: param.types.concat(convertibleTypes),\n      name: newName,\n      hasAny,\n      hasConversion: convertibleTypes.length > 0,\n      restParam: param.restParam\n    };\n  }\n\n  /**\n   * Return the set of type names in a parameter.\n   * Caches the result for efficiency\n   *\n   * @param {Param} param\n   * @return {Set<string>} typenames\n   */\n  function paramTypeSet(param) {\n    if (!param.typeSet) {\n      param.typeSet = new Set();\n      param.types.forEach(type => param.typeSet.add(type.name));\n    }\n    return param.typeSet;\n  }\n\n  /**\n   * Parse a signature with comma separated parameters,\n   * like \"number | boolean, ...string\"\n   *\n   * @param {string} signature\n   * @return {Param[]} params\n   */\n  function parseSignature(rawSignature) {\n    const params = [];\n    if (typeof rawSignature !== 'string') {\n      throw new TypeError('Signatures must be strings');\n    }\n    const signature = rawSignature.trim();\n    if (signature === '') {\n      return params;\n    }\n    const rawParams = signature.split(',');\n    for (let i = 0; i < rawParams.length; ++i) {\n      const parsedParam = parseParam(rawParams[i].trim());\n      if (parsedParam.restParam && i !== rawParams.length - 1) {\n        throw new SyntaxError('Unexpected rest parameter \"' + rawParams[i] + '\": ' + 'only allowed for the last parameter');\n      }\n      // if invalid, short-circuit (all the types may have been filtered)\n      if (parsedParam.types.length === 0) {\n        return null;\n      }\n      params.push(parsedParam);\n    }\n    return params;\n  }\n\n  /**\n   * Test whether a set of params contains a restParam\n   * @param {Param[]} params\n   * @return {boolean} Returns true when the last parameter is a restParam\n   */\n  function hasRestParam(params) {\n    const param = last(params);\n    return param ? param.restParam : false;\n  }\n\n  /**\n   * Create a type test for a single parameter, which can have one or multiple\n   * types.\n   * @param {Param} param\n   * @return {function(x: *) : boolean} Returns a test function\n   */\n  function compileTest(param) {\n    if (!param || param.types.length === 0) {\n      // nothing to do\n      return ok;\n    } else if (param.types.length === 1) {\n      return findType(param.types[0].name).test;\n    } else if (param.types.length === 2) {\n      const test0 = findType(param.types[0].name).test;\n      const test1 = findType(param.types[1].name).test;\n      return function or(x) {\n        return test0(x) || test1(x);\n      };\n    } else {\n      // param.types.length > 2\n      const tests = param.types.map(function (type) {\n        return findType(type.name).test;\n      });\n      return function or(x) {\n        for (let i = 0; i < tests.length; i++) {\n          if (tests[i](x)) {\n            return true;\n          }\n        }\n        return false;\n      };\n    }\n  }\n\n  /**\n   * Create a test for all parameters of a signature\n   * @param {Param[]} params\n   * @return {function(args: Array<*>) : boolean}\n   */\n  function compileTests(params) {\n    let tests, test0, test1;\n    if (hasRestParam(params)) {\n      // variable arguments like '...number'\n      tests = initial(params).map(compileTest);\n      const varIndex = tests.length;\n      const lastTest = compileTest(last(params));\n      const testRestParam = function (args) {\n        for (let i = varIndex; i < args.length; i++) {\n          if (!lastTest(args[i])) {\n            return false;\n          }\n        }\n        return true;\n      };\n      return function testArgs(args) {\n        for (let i = 0; i < tests.length; i++) {\n          if (!tests[i](args[i])) {\n            return false;\n          }\n        }\n        return testRestParam(args) && args.length >= varIndex + 1;\n      };\n    } else {\n      // no variable arguments\n      if (params.length === 0) {\n        return function testArgs(args) {\n          return args.length === 0;\n        };\n      } else if (params.length === 1) {\n        test0 = compileTest(params[0]);\n        return function testArgs(args) {\n          return test0(args[0]) && args.length === 1;\n        };\n      } else if (params.length === 2) {\n        test0 = compileTest(params[0]);\n        test1 = compileTest(params[1]);\n        return function testArgs(args) {\n          return test0(args[0]) && test1(args[1]) && args.length === 2;\n        };\n      } else {\n        // arguments.length > 2\n        tests = params.map(compileTest);\n        return function testArgs(args) {\n          for (let i = 0; i < tests.length; i++) {\n            if (!tests[i](args[i])) {\n              return false;\n            }\n          }\n          return args.length === tests.length;\n        };\n      }\n    }\n  }\n\n  /**\n   * Find the parameter at a specific index of a Params list.\n   * Handles rest parameters.\n   * @param {Param[]} params\n   * @param {number} index\n   * @return {Param | null} Returns the matching parameter when found,\n   *                        null otherwise.\n   */\n  function getParamAtIndex(params, index) {\n    return index < params.length ? params[index] : hasRestParam(params) ? last(params) : null;\n  }\n\n  /**\n   * Get all type names of a parameter\n   * @param {Params[]} params\n   * @param {number} index\n   * @return {string[]} Returns an array with type names\n   */\n  function getTypeSetAtIndex(params, index) {\n    const param = getParamAtIndex(params, index);\n    if (!param) {\n      return new Set();\n    }\n    return paramTypeSet(param);\n  }\n\n  /**\n   * Test whether a type is an exact type or conversion\n   * @param {Type} type\n   * @return {boolean} Returns true when\n   */\n  function isExactType(type) {\n    return type.conversion === null || type.conversion === undefined;\n  }\n\n  /**\n   * Helper function for creating error messages: create an array with\n   * all available types on a specific argument index.\n   * @param {Signature[]} signatures\n   * @param {number} index\n   * @return {string[]} Returns an array with available types\n   */\n  function mergeExpectedParams(signatures, index) {\n    const typeSet = new Set();\n    signatures.forEach(signature => {\n      const paramSet = getTypeSetAtIndex(signature.params, index);\n      let name;\n      for (name of paramSet) {\n        typeSet.add(name);\n      }\n    });\n    return typeSet.has('any') ? ['any'] : Array.from(typeSet);\n  }\n\n  /**\n   * Create\n   * @param {string} name             The name of the function\n   * @param {array.<*>} args          The actual arguments passed to the function\n   * @param {Signature[]} signatures  A list with available signatures\n   * @return {TypeError} Returns a type error with additional data\n   *                     attached to it in the property `data`\n   */\n  function createError(name, args, signatures) {\n    let err, expected;\n    const _name = name || 'unnamed';\n\n    // test for wrong type at some index\n    let matchingSignatures = signatures;\n    let index;\n    for (index = 0; index < args.length; index++) {\n      const nextMatchingDefs = [];\n      matchingSignatures.forEach(signature => {\n        const param = getParamAtIndex(signature.params, index);\n        const test = compileTest(param);\n        if ((index < signature.params.length || hasRestParam(signature.params)) && test(args[index])) {\n          nextMatchingDefs.push(signature);\n        }\n      });\n      if (nextMatchingDefs.length === 0) {\n        // no matching signatures anymore, throw error \"wrong type\"\n        expected = mergeExpectedParams(matchingSignatures, index);\n        if (expected.length > 0) {\n          const actualTypes = findTypeNames(args[index]);\n          err = new TypeError('Unexpected type of argument in function ' + _name + ' (expected: ' + expected.join(' or ') + ', actual: ' + actualTypes.join(' | ') + ', index: ' + index + ')');\n          err.data = {\n            category: 'wrongType',\n            fn: _name,\n            index,\n            actual: actualTypes,\n            expected\n          };\n          return err;\n        }\n      } else {\n        matchingSignatures = nextMatchingDefs;\n      }\n    }\n\n    // test for too few arguments\n    const lengths = matchingSignatures.map(function (signature) {\n      return hasRestParam(signature.params) ? Infinity : signature.params.length;\n    });\n    if (args.length < Math.min.apply(null, lengths)) {\n      expected = mergeExpectedParams(matchingSignatures, index);\n      err = new TypeError('Too few arguments in function ' + _name + ' (expected: ' + expected.join(' or ') + ', index: ' + args.length + ')');\n      err.data = {\n        category: 'tooFewArgs',\n        fn: _name,\n        index: args.length,\n        expected\n      };\n      return err;\n    }\n\n    // test for too many arguments\n    const maxLength = Math.max.apply(null, lengths);\n    if (args.length > maxLength) {\n      err = new TypeError('Too many arguments in function ' + _name + ' (expected: ' + maxLength + ', actual: ' + args.length + ')');\n      err.data = {\n        category: 'tooManyArgs',\n        fn: _name,\n        index: args.length,\n        expectedLength: maxLength\n      };\n      return err;\n    }\n\n    // Generic error\n    const argTypes = [];\n    for (let i = 0; i < args.length; ++i) {\n      argTypes.push(findTypeNames(args[i]).join('|'));\n    }\n    err = new TypeError('Arguments of type \"' + argTypes.join(', ') + '\" do not match any of the defined signatures of function ' + _name + '.');\n    err.data = {\n      category: 'mismatch',\n      actual: argTypes\n    };\n    return err;\n  }\n\n  /**\n   * Find the lowest index of all types of a parameter\n   * @param {Param} param\n   * @return {number} Returns the index of the lowest type in typed.types\n   */\n  function getLowestTypeIndex(param) {\n    let min = typeList.length + 1;\n    for (let i = 0; i < param.types.length; i++) {\n      min = Math.min(min, param.types[i].typeIndex);\n    }\n    return min;\n  }\n\n  /**\n   * Find the lowest index of the conversion of all types of the parameter\n   * having a conversion\n   * @param {Param} param\n   * @return {number} Returns the lowest index of the conversions of this type\n   */\n  function getLowestConversionIndex(param) {\n    let min = nConversions + 1;\n    for (let i = 0; i < param.types.length; i++) {\n      if (!isExactType(param.types[i])) {\n        min = Math.min(min, param.types[i].conversionIndex);\n      }\n    }\n    return min;\n  }\n\n  /**\n   * Compare two params. The return value is a number that is\n   * negative when param1 should be considered first, positive\n   * when param2 should be considered first, and zero when the\n   * params are indistinguishable. Primarily as a debugging aid,\n   * the value is always less than one in absolute value, and\n   * a smaller absolute value indicates a less important distinction\n   * between the parameters.\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} negative, positive, or zero depending on whether\n   *                  param1 should be ordered before, after, or equivalently\n   *                  to param2\n   */\n  function compareParams(param1, param2) {\n    // We compare a number of metrics on a param in turn:\n    // 1) 'any' parameters are the least preferred\n    if (param1.hasAny) {\n      if (!param2.hasAny) {\n        return 0.1;\n      }\n    } else if (param2.hasAny) {\n      return -0.1;\n    }\n\n    // 2) Prefer non-rest to rest parameters\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 0.01;\n      }\n    } else if (param2.restParam) {\n      return -0.01;\n    }\n\n    // 3) Prefer lower type index:\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n    if (typeDiff < 0) {\n      return -0.001;\n    }\n    if (typeDiff > 0) {\n      return 0.001;\n    }\n\n    // 4) Prefer exact type match to conversions, with a strength that\n    //    grows with the conversion index\n    const conv1 = getLowestConversionIndex(param1);\n    const conv2 = getLowestConversionIndex(param2);\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return (1 + conv1) * 0.000001;\n      }\n    } else if (param2.hasConversion) {\n      return -(1 + conv2) * 0.000001;\n    }\n\n    // 5) Prefer lower conversion index\n    const convDiff = conv1 - conv2;\n    if (convDiff < 0) {\n      return -0.0000001;\n    }\n    if (convDiff > 0) {\n      return 0.0000001;\n    }\n\n    // Don't have a basis for preference\n    return 0;\n  }\n\n  /**\n   * Compare two signatures. The result is a number that is negative\n   * when the first signature should be preferred to the second, positive\n   * when the second signature should be preferred, and zero in case the\n   * two signatures are essentially equivalent. Primarily as a debugging\n   * aid, a larger absolute value indicates a more \"important\" difference.\n   *\n   * @param {Signature} signature1\n   * @param {Signature} signature2\n   * @return {number} returns a negative number when signature1 must get a\n   *                  lower index than signature2, a positive number when the\n   *                  opposite holds, or zero when both are equivalent.\n   */\n  function compareSignatures(signature1, signature2) {\n    const pars1 = signature1.params;\n    const pars2 = signature2.params;\n    const last1 = last(pars1);\n    const last2 = last(pars2);\n    const hasRest1 = hasRestParam(pars1);\n    const hasRest2 = hasRestParam(pars2);\n    // We compare a number of metrics on signatures in turn:\n    // 1) An \"any rest param\" is least preferred\n    if (hasRest1 && last1.hasAny) {\n      if (!hasRest2 || !last2.hasAny) {\n        return 10000000;\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -10000000;\n    }\n\n    // 2) Minimize the number of 'any' parameters\n    let any1 = 0;\n    let conv1 = 0;\n    let par;\n    for (par of pars1) {\n      if (par.hasAny) ++any1;\n      if (par.hasConversion) ++conv1;\n    }\n    let any2 = 0;\n    let conv2 = 0;\n    for (par of pars2) {\n      if (par.hasAny) ++any2;\n      if (par.hasConversion) ++conv2;\n    }\n    if (any1 !== any2) {\n      return (any1 - any2) * 1000000;\n    }\n\n    // 3) A conversion rest param is less preferred\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 100000;\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -100000;\n    }\n\n    // 4) Minimize the number of conversions\n    if (conv1 !== conv2) {\n      return (conv1 - conv2) * 10000;\n    }\n\n    // 5) Prefer no rest param\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1000;\n      }\n    } else if (hasRest2) {\n      return -1000;\n    }\n\n    // 6) Prefer shorter with rest param, longer without\n    const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -100 : 100);\n    if (lengthCriterion !== 0) {\n      return lengthCriterion;\n    }\n\n    // Signatures are identical in each of the above metrics.\n    // In particular, they are the same length.\n    // We can therefore compare the parameters one by one.\n    // First we count which signature has more preferred parameters.\n    const comparisons = [];\n    let tc = 0;\n    for (let i = 0; i < pars1.length; ++i) {\n      const thisComparison = compareParams(pars1[i], pars2[i]);\n      comparisons.push(thisComparison);\n      tc += thisComparison;\n    }\n    if (tc !== 0) {\n      return (tc < 0 ? -10 : 10) + tc;\n    }\n\n    // They have the same number of preferred parameters, so go by the\n    // earliest parameter in which we have a preference.\n    // In other words, dispatch is driven somewhat more by earlier\n    // parameters than later ones.\n    let c;\n    let bonus = 9;\n    const decrement = bonus / (comparisons.length + 1);\n    for (c of comparisons) {\n      if (c !== 0) {\n        return (c < 0 ? -bonus : bonus) + c;\n      }\n      bonus -= decrement;\n    }\n\n    // It's a tossup:\n    return 0;\n  }\n\n  /**\n   * Produce a list of all conversions from distinct types to one of\n   * the given types.\n   *\n   * @param {string[]} typeNames\n   * @return {ConversionDef[]} Returns the conversions that are available\n   *                        resulting in any given type (if any)\n   */\n  function availableConversions(typeNames) {\n    if (typeNames.length === 0) {\n      return [];\n    }\n    const types = typeNames.map(findType);\n    if (typeNames.length === 1) return types[0].conversionsTo;\n\n    // Here, for each type that occurs as the from-type of any conversion\n    // to any of the types found, we must select the conversion of\n    // lowest index from that type. So first collect the types.\n    const knownTypes = new Set(typeNames);\n    const convertibleTypes = new Set();\n    for (let i = 0; i < types.length; ++i) {\n      for (const match of types[i].conversionsTo) {\n        if (!knownTypes.has(match.from)) convertibleTypes.add(match.from);\n      }\n    }\n\n    // Now get the lowest-index conversion for each type\n    const matches = [];\n    for (const typeName of convertibleTypes) {\n      let bestIndex = nConversions + 1;\n      let bestConversion = null;\n      for (let i = 0; i < types.length; ++i) {\n        for (const match of types[i].conversionsTo) {\n          if (match.from === typeName && match.index < bestIndex) {\n            bestIndex = match.index;\n            bestConversion = match;\n          }\n        }\n      }\n      matches.push(bestConversion);\n    }\n    return matches;\n  }\n\n  /**\n   * Preprocess arguments before calling the original function:\n   * - if needed convert the parameters\n   * - in case of rest parameters, move the rest parameters into an Array\n   * @param {Param[]} params\n   * @param {function} fn\n   * @return {function} Returns fn or a wrapped function if needed. If it\n   *                    has conversions, the function will be named to indicate\n   *                    what conversions are occurring.\n   */\n  function compileArgsPreprocessing(params, fn) {\n    let fnConvert = fn;\n\n    // TODO: can we make this wrapper function smarter/simpler?\n\n    let name = '';\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params);\n      const compiledConversions = params.map(compileArgConversion);\n      name = compiledConversions.map(conv => conv.name).join(';');\n      fnConvert = function convertArgs() {\n        const args = [];\n        const last = restParam ? arguments.length - 1 : arguments.length;\n        for (let i = 0; i < last; i++) {\n          args[i] = compiledConversions[i](arguments[i]);\n        }\n        if (restParam) {\n          args[last] = arguments[last].map(compiledConversions[last]);\n        }\n        return fn.apply(this, args);\n      };\n    }\n    let fnPreprocess = fnConvert;\n    if (hasRestParam(params)) {\n      const offset = params.length - 1;\n      fnPreprocess = function preprocessRestParams() {\n        return fnConvert.apply(this, slice(arguments, 0, offset).concat([slice(arguments, offset)]));\n      };\n    }\n    if (name) Object.defineProperty(fnPreprocess, 'name', {\n      value: name\n    });\n    return fnPreprocess;\n  }\n\n  /**\n   * Compile conversion for a parameter to the right type\n   * @param {Param} param\n   * @return {function} Returns the wrapped function that will convert arguments\n   *\n   */\n  function compileArgConversion(param) {\n    let test0, test1, conversion0, conversion1;\n    const tests = [];\n    const conversions = [];\n    let name = '';\n    param.types.forEach(function (type) {\n      if (type.conversion) {\n        name += type.conversion.from + '~>' + type.conversion.to + ',';\n        tests.push(findType(type.conversion.from).test);\n        conversions.push(type.conversion.convert);\n      }\n    });\n    if (name) name = name.slice(0, -1);else name = 'pass';\n\n    // create optimized conversion functions depending on the number of conversions\n    let convertor = arg => arg;\n    switch (conversions.length) {\n      case 0:\n        break;\n      case 1:\n        test0 = tests[0];\n        conversion0 = conversions[0];\n        convertor = function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          return arg;\n        };\n        break;\n      case 2:\n        test0 = tests[0];\n        test1 = tests[1];\n        conversion0 = conversions[0];\n        conversion1 = conversions[1];\n        convertor = function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          if (test1(arg)) {\n            return conversion1(arg);\n          }\n          return arg;\n        };\n        break;\n      default:\n        convertor = function convertArg(arg) {\n          for (let i = 0; i < conversions.length; i++) {\n            if (tests[i](arg)) {\n              return conversions[i](arg);\n            }\n          }\n          return arg;\n        };\n    }\n    Object.defineProperty(convertor, 'name', {\n      value: name\n    });\n    return convertor;\n  }\n\n  /**\n   * Split params with union types in to separate params.\n   *\n   * For example:\n   *\n   *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n   *     // returns:\n   *     // [\n   *     //   ['Array', 'string'],\n   *     //   ['Array', 'RegExp'],\n   *     //   ['Object', 'string'],\n   *     //   ['Object', 'RegExp']\n   *     // ]\n   *\n   * @param {Param[]} params\n   * @return {Param[]}\n   */\n  function splitParams(params) {\n    function _splitParams(params, index, paramsSoFar) {\n      if (index < params.length) {\n        const param = params[index];\n        let resultingParams = [];\n        if (param.restParam) {\n          // split the types of a rest parameter in two:\n          // one with only exact types, and one with exact types and conversions\n          const exactTypes = param.types.filter(isExactType);\n          if (exactTypes.length < param.types.length) {\n            resultingParams.push({\n              types: exactTypes,\n              name: '...' + exactTypes.map(t => t.name).join('|'),\n              hasAny: exactTypes.some(t => t.isAny),\n              hasConversion: false,\n              restParam: true\n            });\n          }\n          resultingParams.push(param);\n        } else {\n          // split all the types of a regular parameter into one type per param\n          resultingParams = param.types.map(function (type) {\n            return {\n              types: [type],\n              name: type.name,\n              hasAny: type.isAny,\n              hasConversion: type.conversion,\n              restParam: false\n            };\n          });\n        }\n\n        // recurse over the groups with types\n        return flatMap(resultingParams, function (nextParam) {\n          return _splitParams(params, index + 1, paramsSoFar.concat([nextParam]));\n        });\n      } else {\n        // we've reached the end of the parameters.\n        return [paramsSoFar];\n      }\n    }\n    return _splitParams(params, 0, []);\n  }\n\n  /**\n   * Test whether two param lists represent conflicting signatures\n   * @param {Param[]} params1\n   * @param {Param[]} params2\n   * @return {boolean} Returns true when the signatures conflict, false otherwise.\n   */\n  function conflicting(params1, params2) {\n    const ii = Math.max(params1.length, params2.length);\n    for (let i = 0; i < ii; i++) {\n      const typeSet1 = getTypeSetAtIndex(params1, i);\n      const typeSet2 = getTypeSetAtIndex(params2, i);\n      let overlap = false;\n      let name;\n      for (name of typeSet2) {\n        if (typeSet1.has(name)) {\n          overlap = true;\n          break;\n        }\n      }\n      if (!overlap) {\n        return false;\n      }\n    }\n    const len1 = params1.length;\n    const len2 = params2.length;\n    const restParam1 = hasRestParam(params1);\n    const restParam2 = hasRestParam(params2);\n    return restParam1 ? restParam2 ? len1 === len2 : len2 >= len1 : restParam2 ? len1 >= len2 : len1 === len2;\n  }\n\n  /**\n   * Helper function for `resolveReferences` that returns a copy of\n   * functionList wihe any prior resolutions cleared out, in case we are\n   * recycling signatures from a prior typed function construction.\n   *\n   * @param {Array.<function|typed-reference>} functionList\n   * @return {Array.<function|typed-reference>}\n   */\n  function clearResolutions(functionList) {\n    return functionList.map(fn => {\n      if (isReferToSelf(fn)) {\n        return referToSelf(fn.referToSelf.callback);\n      }\n      if (isReferTo(fn)) {\n        return makeReferTo(fn.referTo.references, fn.referTo.callback);\n      }\n      return fn;\n    });\n  }\n\n  /**\n   * Take a list of references, a list of functions functionList, and a\n   * signatureMap indexing signatures into functionList, and return\n   * the list of resolutions, or a false-y value if they don't all\n   * resolve in a valid way (yet).\n   *\n   * @param {string[]} references\n   * @param {Array<function|typed-reference} functionList\n   * @param {Object.<string, integer>} signatureMap\n   * @return {function[] | false} resolutions\n   */\n  function collectResolutions(references, functionList, signatureMap) {\n    const resolvedReferences = [];\n    let reference;\n    for (reference of references) {\n      let resolution = signatureMap[reference];\n      if (typeof resolution !== 'number') {\n        throw new TypeError('No definition for referenced signature \"' + reference + '\"');\n      }\n      resolution = functionList[resolution];\n      if (typeof resolution !== 'function') {\n        return false;\n      }\n      resolvedReferences.push(resolution);\n    }\n    return resolvedReferences;\n  }\n\n  /**\n   * Resolve any references in the functionList for the typed function\n   * itself. The signatureMap tells which index in the functionList a\n   * given signature should be mapped to (for use in resolving typed.referTo)\n   * and self provides the destions of a typed.referToSelf.\n   *\n   * @param {Array<function | typed-reference-object>} functionList\n   * @param {Object.<string, function>} signatureMap\n   * @param {function} self  The typed-function itself\n   * @return {Array<function>} The list of resolved functions\n   */\n  function resolveReferences(functionList, signatureMap, self) {\n    const resolvedFunctions = clearResolutions(functionList);\n    const isResolved = new Array(resolvedFunctions.length).fill(false);\n    let leftUnresolved = true;\n    while (leftUnresolved) {\n      leftUnresolved = false;\n      let nothingResolved = true;\n      for (let i = 0; i < resolvedFunctions.length; ++i) {\n        if (isResolved[i]) continue;\n        const fn = resolvedFunctions[i];\n        if (isReferToSelf(fn)) {\n          resolvedFunctions[i] = fn.referToSelf.callback(self);\n          // Preserve reference in case signature is reused someday:\n          resolvedFunctions[i].referToSelf = fn.referToSelf;\n          isResolved[i] = true;\n          nothingResolved = false;\n        } else if (isReferTo(fn)) {\n          const resolvedReferences = collectResolutions(fn.referTo.references, resolvedFunctions, signatureMap);\n          if (resolvedReferences) {\n            resolvedFunctions[i] = fn.referTo.callback.apply(this, resolvedReferences);\n            // Preserve reference in case signature is reused someday:\n            resolvedFunctions[i].referTo = fn.referTo;\n            isResolved[i] = true;\n            nothingResolved = false;\n          } else {\n            leftUnresolved = true;\n          }\n        }\n      }\n      if (nothingResolved && leftUnresolved) {\n        throw new SyntaxError('Circular reference detected in resolving typed.referTo');\n      }\n    }\n    return resolvedFunctions;\n  }\n\n  /**\n   * Validate whether any of the function bodies contains a self-reference\n   * usage like `this(...)` or `this.signatures`. This self-referencing is\n   * deprecated since typed-function v3. It has been replaced with\n   * the functions typed.referTo and typed.referToSelf.\n   * @param {Object.<string, function>} signaturesMap\n   */\n  function validateDeprecatedThis(signaturesMap) {\n    // TODO: remove this deprecation warning logic some day (it's introduced in v3)\n\n    // match occurrences like 'this(' and 'this.signatures'\n    const deprecatedThisRegex = /\\bthis(\\(|\\.signatures\\b)/;\n    Object.keys(signaturesMap).forEach(signature => {\n      const fn = signaturesMap[signature];\n      if (deprecatedThisRegex.test(fn.toString())) {\n        throw new SyntaxError('Using `this` to self-reference a function ' + 'is deprecated since typed-function@3. ' + 'Use typed.referTo and typed.referToSelf instead.');\n      }\n    });\n  }\n\n  /**\n   * Create a typed function\n   * @param {String} name               The name for the typed function\n   * @param {Object.<string, function>} rawSignaturesMap\n   *                                    An object with one or\n   *                                    multiple signatures as key, and the\n   *                                    function corresponding to the\n   *                                    signature as value.\n   * @return {function}  Returns the created typed function.\n   */\n  function createTypedFunction(name, rawSignaturesMap) {\n    typed.createCount++;\n    if (Object.keys(rawSignaturesMap).length === 0) {\n      throw new SyntaxError('No signatures provided');\n    }\n    if (typed.warnAgainstDeprecatedThis) {\n      validateDeprecatedThis(rawSignaturesMap);\n    }\n\n    // Main processing loop for signatures\n    const parsedParams = [];\n    const originalFunctions = [];\n    const signaturesMap = {};\n    const preliminarySignatures = []; // may have duplicates from conversions\n    let signature;\n    for (signature in rawSignaturesMap) {\n      // A) Protect against polluted Object prototype:\n      if (!Object.prototype.hasOwnProperty.call(rawSignaturesMap, signature)) {\n        continue;\n      }\n      // B) Parse the signature\n      const params = parseSignature(signature);\n      if (!params) continue;\n      // C) Check for conflicts\n      parsedParams.forEach(function (pp) {\n        if (conflicting(pp, params)) {\n          throw new TypeError('Conflicting signatures \"' + stringifyParams(pp) + '\" and \"' + stringifyParams(params) + '\".');\n        }\n      });\n      parsedParams.push(params);\n      // D) Store the provided function and add conversions\n      const functionIndex = originalFunctions.length;\n      originalFunctions.push(rawSignaturesMap[signature]);\n      const conversionParams = params.map(expandParam);\n      // E) Split the signatures and collect them up\n      let sp;\n      for (sp of splitParams(conversionParams)) {\n        const spName = stringifyParams(sp);\n        preliminarySignatures.push({\n          params: sp,\n          name: spName,\n          fn: functionIndex\n        });\n        if (sp.every(p => !p.hasConversion)) {\n          signaturesMap[spName] = functionIndex;\n        }\n      }\n    }\n    preliminarySignatures.sort(compareSignatures);\n\n    // Note the forward reference to theTypedFn\n    const resolvedFunctions = resolveReferences(originalFunctions, signaturesMap, theTypedFn);\n\n    // Fill in the proper function for each signature\n    let s;\n    for (s in signaturesMap) {\n      if (Object.prototype.hasOwnProperty.call(signaturesMap, s)) {\n        signaturesMap[s] = resolvedFunctions[signaturesMap[s]];\n      }\n    }\n    const signatures = [];\n    const internalSignatureMap = new Map(); // benchmarks faster than object\n    for (s of preliminarySignatures) {\n      // Note it's only safe to eliminate duplicates like this\n      // _after_ the signature sorting step above; otherwise we might\n      // remove the wrong one.\n      if (!internalSignatureMap.has(s.name)) {\n        s.fn = resolvedFunctions[s.fn];\n        signatures.push(s);\n        internalSignatureMap.set(s.name, s);\n      }\n    }\n\n    // we create a highly optimized checks for the first couple of signatures with max 2 arguments\n    const ok0 = signatures[0] && signatures[0].params.length <= 2 && !hasRestParam(signatures[0].params);\n    const ok1 = signatures[1] && signatures[1].params.length <= 2 && !hasRestParam(signatures[1].params);\n    const ok2 = signatures[2] && signatures[2].params.length <= 2 && !hasRestParam(signatures[2].params);\n    const ok3 = signatures[3] && signatures[3].params.length <= 2 && !hasRestParam(signatures[3].params);\n    const ok4 = signatures[4] && signatures[4].params.length <= 2 && !hasRestParam(signatures[4].params);\n    const ok5 = signatures[5] && signatures[5].params.length <= 2 && !hasRestParam(signatures[5].params);\n    const allOk = ok0 && ok1 && ok2 && ok3 && ok4 && ok5;\n\n    // compile the tests\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].test = compileTests(signatures[i].params);\n    }\n    const test00 = ok0 ? compileTest(signatures[0].params[0]) : notOk;\n    const test10 = ok1 ? compileTest(signatures[1].params[0]) : notOk;\n    const test20 = ok2 ? compileTest(signatures[2].params[0]) : notOk;\n    const test30 = ok3 ? compileTest(signatures[3].params[0]) : notOk;\n    const test40 = ok4 ? compileTest(signatures[4].params[0]) : notOk;\n    const test50 = ok5 ? compileTest(signatures[5].params[0]) : notOk;\n    const test01 = ok0 ? compileTest(signatures[0].params[1]) : notOk;\n    const test11 = ok1 ? compileTest(signatures[1].params[1]) : notOk;\n    const test21 = ok2 ? compileTest(signatures[2].params[1]) : notOk;\n    const test31 = ok3 ? compileTest(signatures[3].params[1]) : notOk;\n    const test41 = ok4 ? compileTest(signatures[4].params[1]) : notOk;\n    const test51 = ok5 ? compileTest(signatures[5].params[1]) : notOk;\n\n    // compile the functions\n    for (let i = 0; i < signatures.length; ++i) {\n      signatures[i].implementation = compileArgsPreprocessing(signatures[i].params, signatures[i].fn);\n    }\n    const fn0 = ok0 ? signatures[0].implementation : undef;\n    const fn1 = ok1 ? signatures[1].implementation : undef;\n    const fn2 = ok2 ? signatures[2].implementation : undef;\n    const fn3 = ok3 ? signatures[3].implementation : undef;\n    const fn4 = ok4 ? signatures[4].implementation : undef;\n    const fn5 = ok5 ? signatures[5].implementation : undef;\n    const len0 = ok0 ? signatures[0].params.length : -1;\n    const len1 = ok1 ? signatures[1].params.length : -1;\n    const len2 = ok2 ? signatures[2].params.length : -1;\n    const len3 = ok3 ? signatures[3].params.length : -1;\n    const len4 = ok4 ? signatures[4].params.length : -1;\n    const len5 = ok5 ? signatures[5].params.length : -1;\n\n    // simple and generic, but also slow\n    const iStart = allOk ? 6 : 0;\n    const iEnd = signatures.length;\n    // de-reference ahead for execution speed:\n    const tests = signatures.map(s => s.test);\n    const fns = signatures.map(s => s.implementation);\n    const generic = function generic() {\n      'use strict';\n\n      for (let i = iStart; i < iEnd; i++) {\n        if (tests[i](arguments)) {\n          return fns[i].apply(this, arguments);\n        }\n      }\n      return typed.onMismatch(name, arguments, signatures);\n    };\n\n    // create the typed function\n    // fast, specialized version. Falls back to the slower, generic one if needed\n    function theTypedFn(arg0, arg1) {\n      'use strict';\n\n      if (arguments.length === len0 && test00(arg0) && test01(arg1)) {\n        return fn0.apply(this, arguments);\n      }\n      if (arguments.length === len1 && test10(arg0) && test11(arg1)) {\n        return fn1.apply(this, arguments);\n      }\n      if (arguments.length === len2 && test20(arg0) && test21(arg1)) {\n        return fn2.apply(this, arguments);\n      }\n      if (arguments.length === len3 && test30(arg0) && test31(arg1)) {\n        return fn3.apply(this, arguments);\n      }\n      if (arguments.length === len4 && test40(arg0) && test41(arg1)) {\n        return fn4.apply(this, arguments);\n      }\n      if (arguments.length === len5 && test50(arg0) && test51(arg1)) {\n        return fn5.apply(this, arguments);\n      }\n      return generic.apply(this, arguments);\n    }\n\n    // attach name the typed function\n    try {\n      Object.defineProperty(theTypedFn, 'name', {\n        value: name\n      });\n    } catch (err) {\n      // old browsers do not support Object.defineProperty and some don't support setting the name property\n      // the function name is not essential for the functioning, it's mostly useful for debugging,\n      // so it's fine to have unnamed functions.\n    }\n\n    // attach signatures to the function.\n    // This property is close to the original collection of signatures\n    // used to create the typed-function, just with unions split:\n    theTypedFn.signatures = signaturesMap;\n\n    // Store internal data for functions like resolve, find, etc.\n    // Also serves as the flag that this is a typed-function\n    theTypedFn._typedFunctionData = {\n      signatures,\n      signatureMap: internalSignatureMap\n    };\n    return theTypedFn;\n  }\n\n  /**\n   * Action to take on mismatch\n   * @param {string} name      Name of function that was attempted to be called\n   * @param {Array} args       Actual arguments to the call\n   * @param {Array} signatures Known signatures of the named typed-function\n   */\n  function _onMismatch(name, args, signatures) {\n    throw createError(name, args, signatures);\n  }\n\n  /**\n   * Return all but the last items of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {Array}\n   */\n  function initial(arr) {\n    return slice(arr, 0, arr.length - 1);\n  }\n\n  /**\n   * return the last item of an array or function Arguments\n   * @param {Array | Arguments} arr\n   * @return {*}\n   */\n  function last(arr) {\n    return arr[arr.length - 1];\n  }\n\n  /**\n   * Slice an array or function Arguments\n   * @param {Array | Arguments | IArguments} arr\n   * @param {number} start\n   * @param {number} [end]\n   * @return {Array}\n   */\n  function slice(arr, start, end) {\n    return Array.prototype.slice.call(arr, start, end);\n  }\n\n  /**\n   * Return the first item from an array for which test(arr[i]) returns true\n   * @param {Array} arr\n   * @param {function} test\n   * @return {* | undefined} Returns the first matching item\n   *                         or undefined when there is no match\n   */\n  function findInArray(arr, test) {\n    for (let i = 0; i < arr.length; i++) {\n      if (test(arr[i])) {\n        return arr[i];\n      }\n    }\n    return undefined;\n  }\n\n  /**\n   * Flat map the result invoking a callback for every item in an array.\n   * https://gist.github.com/samgiles/762ee337dff48623e729\n   * @param {Array} arr\n   * @param {function} callback\n   * @return {Array}\n   */\n  function flatMap(arr, callback) {\n    return Array.prototype.concat.apply([], arr.map(callback));\n  }\n\n  /**\n   * Create a reference callback to one or multiple signatures\n   *\n   * Syntax:\n   *\n   *     typed.referTo(signature1, signature2, ..., function callback(fn1, fn2, ...) {\n   *       // ...\n   *     })\n   *\n   * @returns {{referTo: {references: string[], callback}}}\n   */\n  function referTo() {\n    const references = initial(arguments).map(s => stringifyParams(parseSignature(s)));\n    const callback = last(arguments);\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as last argument');\n    }\n    return makeReferTo(references, callback);\n  }\n  function makeReferTo(references, callback) {\n    return {\n      referTo: {\n        references,\n        callback\n      }\n    };\n  }\n\n  /**\n   * Create a reference callback to the typed-function itself\n   *\n   * @param {(self: function) => function} callback\n   * @returns {{referToSelf: { callback: function }}}\n   */\n  function referToSelf(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('Callback function expected as first argument');\n    }\n    return {\n      referToSelf: {\n        callback\n      }\n    };\n  }\n\n  /**\n   * Test whether something is a referTo object, holding a list with reference\n   * signatures and a callback.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferTo(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referTo === 'object' && Array.isArray(objectOrFn.referTo.references) && typeof objectOrFn.referTo.callback === 'function';\n  }\n\n  /**\n   * Test whether something is a referToSelf object, holding a callback where\n   * to pass `self`.\n   *\n   * @param {Object | function} objectOrFn\n   * @returns {boolean}\n   */\n  function isReferToSelf(objectOrFn) {\n    return objectOrFn && typeof objectOrFn.referToSelf === 'object' && typeof objectOrFn.referToSelf.callback === 'function';\n  }\n\n  /**\n   * Check if name is (A) new, (B) a match, or (C) a mismatch; and throw\n   * an error in case (C).\n   *\n   * @param { string | undefined } nameSoFar\n   * @param { string | undefined } newName\n   * @returns { string } updated name\n   */\n  function checkName(nameSoFar, newName) {\n    if (!nameSoFar) {\n      return newName;\n    }\n    if (newName && newName !== nameSoFar) {\n      const err = new Error('Function names do not match (expected: ' + nameSoFar + ', actual: ' + newName + ')');\n      err.data = {\n        actual: newName,\n        expected: nameSoFar\n      };\n      throw err;\n    }\n    return nameSoFar;\n  }\n\n  /**\n   * Retrieve the implied name from an object with signature keys\n   * and function values, checking whether all value names match\n   *\n   * @param { {string: function} } obj\n   */\n  function getObjectName(obj) {\n    let name;\n    for (const key in obj) {\n      // Only pay attention to own properties, and only if their values\n      // are typed functions or functions with a signature property\n      if (Object.prototype.hasOwnProperty.call(obj, key) && (isTypedFunction(obj[key]) || typeof obj[key].signature === 'string')) {\n        name = checkName(name, obj[key].name);\n      }\n    }\n    return name;\n  }\n\n  /**\n   * Copy all of the signatures from the second argument into the first,\n   * which is modified by side effect, checking for conflicts\n   *\n   * @param {Object.<string, function|typed-reference>} dest\n   * @param {Object.<string, function|typed-reference>} source\n   */\n  function mergeSignatures(dest, source) {\n    let key;\n    for (key in source) {\n      if (Object.prototype.hasOwnProperty.call(source, key)) {\n        if (key in dest) {\n          if (source[key] !== dest[key]) {\n            const err = new Error('Signature \"' + key + '\" is defined twice');\n            err.data = {\n              signature: key,\n              sourceFunction: source[key],\n              destFunction: dest[key]\n            };\n            throw err;\n          }\n          // else: both signatures point to the same function, that's fine\n        }\n        dest[key] = source[key];\n      }\n    }\n  }\n  const saveTyped = typed;\n\n  /**\n   * Originally the main function was a typed function itself, but then\n   * it might not be able to generate error messages if the client\n   * replaced the type system with different names.\n   *\n   * Main entry: typed([name], functions/objects with signatures...)\n   *\n   * Assembles and returns a new typed-function from the given items\n   * that provide signatures and implementations, each of which may be\n   * * a plain object mapping (string) signatures to implementing functions,\n   * * a previously constructed typed function, or\n   * * any other single function with a string-valued property `signature`.\n    * The name of the resulting typed-function will be given by the\n   * string-valued name argument if present, or if not, by the name\n   * of any of the arguments that have one, as long as any that do are\n   * consistent with each other. If no name is specified, the name will be\n   * an empty string.\n   *\n   * @param {string} maybeName [optional]\n   * @param {(function|object)[]} signature providers\n   * @returns {typed-function}\n   */\n  typed = function (maybeName) {\n    const named = typeof maybeName === 'string';\n    const start = named ? 1 : 0;\n    let name = named ? maybeName : '';\n    const allSignatures = {};\n    for (let i = start; i < arguments.length; ++i) {\n      const item = arguments[i];\n      let theseSignatures = {};\n      let thisName;\n      if (typeof item === 'function') {\n        thisName = item.name;\n        if (typeof item.signature === 'string') {\n          // Case 1: Ordinary function with a string 'signature' property\n          theseSignatures[item.signature] = item;\n        } else if (isTypedFunction(item)) {\n          // Case 2: Existing typed function\n          theseSignatures = item.signatures;\n        }\n      } else if (isPlainObject(item)) {\n        // Case 3: Plain object, assume keys = signatures, values = functions\n        theseSignatures = item;\n        if (!named) {\n          thisName = getObjectName(item);\n        }\n      }\n      if (Object.keys(theseSignatures).length === 0) {\n        const err = new TypeError('Argument to \\'typed\\' at index ' + i + ' is not a (typed) function, ' + 'nor an object with signatures as keys and functions as values.');\n        err.data = {\n          index: i,\n          argument: item\n        };\n        throw err;\n      }\n      if (!named) {\n        name = checkName(name, thisName);\n      }\n      mergeSignatures(allSignatures, theseSignatures);\n    }\n    return createTypedFunction(name || '', allSignatures);\n  };\n  typed.create = create;\n  typed.createCount = saveTyped.createCount;\n  typed.onMismatch = _onMismatch;\n  typed.throwMismatchError = _onMismatch;\n  typed.createError = createError;\n  typed.clear = clear;\n  typed.clearConversions = clearConversions;\n  typed.addTypes = addTypes;\n  typed._findType = findType; // For unit testing only\n  typed.referTo = referTo;\n  typed.referToSelf = referToSelf;\n  typed.convert = convert;\n  typed.findSignature = findSignature;\n  typed.find = find;\n  typed.isTypedFunction = isTypedFunction;\n  typed.warnAgainstDeprecatedThis = true;\n\n  /**\n   * add a type (convenience wrapper for typed.addTypes)\n   * @param {{name: string, test: function}} type\n   * @param {boolean} [beforeObjectTest=true]\n   *                          If true, the new test will be inserted before\n   *                          the test with name 'Object' (if any), since\n   *                          tests for Object match Array and classes too.\n   */\n  typed.addType = function (type, beforeObjectTest) {\n    let before = 'any';\n    if (beforeObjectTest !== false && typeMap.has('Object')) {\n      before = 'Object';\n    }\n    typed.addTypes([type], before);\n  };\n\n  /**\n   * Verify that the ConversionDef conversion has a valid format.\n   *\n   * @param {conversionDef} conversion\n   * @return {void}\n   * @throws {TypeError|SyntaxError}\n   */\n  function _validateConversion(conversion) {\n    if (!conversion || typeof conversion.from !== 'string' || typeof conversion.to !== 'string' || typeof conversion.convert !== 'function') {\n      throw new TypeError('Object with properties {from: string, to: string, convert: function} expected');\n    }\n    if (conversion.to === conversion.from) {\n      throw new SyntaxError('Illegal to define conversion from \"' + conversion.from + '\" to itself.');\n    }\n  }\n\n  /**\n   * Add a conversion\n   *\n   * @param {ConversionDef} conversion\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversion = function (conversion) {\n    let options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n      override: false\n    };\n    _validateConversion(conversion);\n    const to = findType(conversion.to);\n    const existing = to.conversionsTo.find(other => other.from === conversion.from);\n    if (existing) {\n      if (options && options.override) {\n        typed.removeConversion({\n          from: existing.from,\n          to: conversion.to,\n          convert: existing.convert\n        });\n      } else {\n        throw new Error('There is already a conversion from \"' + conversion.from + '\" to \"' + to.name + '\"');\n      }\n    }\n    to.conversionsTo.push({\n      from: conversion.from,\n      to: to.name,\n      convert: conversion.convert,\n      index: nConversions++\n    });\n  };\n\n  /**\n   * Convenience wrapper to call addConversion on each conversion in a list.\n   *\n   * @param {ConversionDef[]} conversions\n   * @param {{override: boolean}} [options]\n   * @returns {void}\n   * @throws {TypeError}\n   */\n  typed.addConversions = function (conversions, options) {\n    conversions.forEach(conversion => typed.addConversion(conversion, options));\n  };\n\n  /**\n   * Remove the specified conversion. The format is the same as for\n   * addConversion, and the convert function must match or an error\n   * is thrown.\n   *\n   * @param {{from: string, to: string, convert: function}} conversion\n   * @returns {void}\n   * @throws {TypeError|SyntaxError|Error}\n   */\n  typed.removeConversion = function (conversion) {\n    _validateConversion(conversion);\n    const to = findType(conversion.to);\n    const existingConversion = findInArray(to.conversionsTo, c => c.from === conversion.from);\n    if (!existingConversion) {\n      throw new Error('Attempt to remove nonexistent conversion from ' + conversion.from + ' to ' + conversion.to);\n    }\n    if (existingConversion.convert !== conversion.convert) {\n      throw new Error('Conversion to remove does not match existing conversion');\n    }\n    const index = to.conversionsTo.indexOf(existingConversion);\n    to.conversionsTo.splice(index, 1);\n  };\n\n  /**\n   * Produce the specific signature that a typed function\n   * will execute on the given arguments. Here, a \"signature\" is an\n   * object with properties 'params', 'test', 'fn', and 'implementation'.\n   * This last property is a function that converts params as necessary\n   * and then calls 'fn'. Returns null if there is no matching signature.\n   * @param {typed-function} tf\n   * @param {any[]} argList\n   * @returns {{params: string, test: function, fn: function, implementation: function}}\n   */\n  typed.resolve = function (tf, argList) {\n    if (!isTypedFunction(tf)) {\n      throw new TypeError(NOT_TYPED_FUNCTION);\n    }\n    const sigs = tf._typedFunctionData.signatures;\n    for (let i = 0; i < sigs.length; ++i) {\n      if (sigs[i].test(argList)) {\n        return sigs[i];\n      }\n    }\n    return null;\n  };\n  return typed;\n}\nexport default create();\n//# sourceMappingURL=typed-function.mjs.map"],"names":[],"mappings":";;;;;;EAAA,SAAS,EAAE,GAAG;EACd,EAAE,OAAO,IAAI;EACb;EACA,SAAS,KAAK,GAAG;EACjB,EAAE,OAAO,KAAK;EACd;EACA,SAAS,KAAK,GAAG;EACjB,EAAE,OAAO,SAAS;EAClB;EACA,MAAM,kBAAkB,GAAG,mCAAmC;;EAE9D;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;;EAEA;EACA;EACA;EACA,SAAS,MAAM,GAAG;EAClB;;EAEA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,CAAC,EAAE;EAC5B,IAAI,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,WAAW,KAAK,MAAM;EAC1E,EAAE;EACF,EAAE,MAAM,MAAM,GAAG,CAAC;EAClB,IAAI,IAAI,EAAE,QAAQ;EAClB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,OAAO,CAAC,KAAK,QAAQ;EAClC,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,QAAQ;EAClB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,OAAO,CAAC,KAAK,QAAQ;EAClC,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,SAAS;EACnB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,OAAO,CAAC,KAAK,SAAS;EACnC,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,UAAU;EACpB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,OAAO,CAAC,KAAK,UAAU;EACpC,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,OAAO;EACjB,IAAI,IAAI,EAAE,KAAK,CAAC;EAChB,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,MAAM;EAChB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,CAAC,YAAY,IAAI;EAC9B,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,QAAQ;EAClB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,CAAC,YAAY,MAAM;EAChC,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,QAAQ;EAClB,IAAI,IAAI,EAAE;EACV,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,MAAM;EAChB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,CAAC,KAAK,IAAI;EACvB,IAAI;EACJ,GAAG,EAAE;EACL,IAAI,IAAI,EAAE,WAAW;EACrB,IAAI,IAAI,EAAE,UAAU,CAAC,EAAE;EACvB,MAAM,OAAO,CAAC,KAAK,SAAS;EAC5B,IAAI;EACJ,GAAG,CAAC;EACJ,EAAE,MAAM,OAAO,GAAG;EAClB,IAAI,IAAI,EAAE,KAAK;EACf,IAAI,IAAI,EAAE,EAAE;EACZ,IAAI,KAAK,EAAE;EACX,GAAG;;EAEH;EACA;EACA;EACA;EACA;EACA,EAAE,IAAI,OAAO,CAAC;EACd,EAAE,IAAI,QAAQ,CAAC;;EAEf;EACA,EAAE,IAAI,YAAY,GAAG,CAAC;EACtB;;EAEA;EACA,EAAE,IAAI,KAAK,GAAG;EACd,IAAI,WAAW,EAAE;EACjB,GAAG;;EAEH;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,QAAQ,CAAC,QAAQ,EAAE;EAC9B,IAAI,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;EACtC,IAAI,IAAI,IAAI,EAAE;EACd,MAAM,OAAO,IAAI;EACjB,IAAI;EACJ;EACA,IAAI,IAAI,OAAO,GAAG,gBAAgB,GAAG,QAAQ,GAAG,GAAG;EACnD,IAAI,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE;EACvC,IAAI,IAAI,SAAS;EACjB,IAAI,KAAK,SAAS,IAAI,QAAQ,EAAE;EAChC,MAAM,IAAI,SAAS,CAAC,WAAW,EAAE,KAAK,IAAI,EAAE;EAC5C,QAAQ,OAAO,IAAI,kBAAkB,GAAG,SAAS,GAAG,KAAK;EACzD,QAAQ;EACR,MAAM;EACN,IAAI;EACJ,IAAI,MAAM,IAAI,SAAS,CAAC,OAAO,CAAC;EAChC,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,QAAQ,CAAC,KAAK,EAAE;EAC3B,IAAI,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK;EAC9F,IAAI,MAAM,WAAW,GAAG,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM;EACjF,IAAI,MAAM,QAAQ,GAAG,EAAE;EACvB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC3C,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,EAAE;EACjG,QAAQ,MAAM,IAAI,SAAS,CAAC,gEAAgE,CAAC;EAC7F,MAAM;EACN,MAAM,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI;EACpC,MAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;EACjC,QAAQ,MAAM,IAAI,SAAS,CAAC,uBAAuB,GAAG,QAAQ,GAAG,GAAG,CAAC;EACrE,MAAM;EACN,MAAM,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;EAC7B,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE;EAC5B,QAAQ,IAAI,EAAE,QAAQ;EACtB,QAAQ,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI;EAC3B,QAAQ,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK;EAC7B,QAAQ,KAAK,EAAE,WAAW,GAAG,CAAC;EAC9B,QAAQ,aAAa,EAAE,EAAE;EACzB,OAAO,CAAC;EACR,IAAI;EACJ;EACA,IAAI,MAAM,aAAa,GAAG,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC;EACrD,IAAI,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC;EACpF;EACA,IAAI,KAAK,IAAI,CAAC,GAAG,WAAW,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC1E,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;EACxC,IAAI;EACJ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,KAAK,GAAG;EACnB,IAAI,OAAO,GAAG,IAAI,GAAG,EAAE;EACvB,IAAI,QAAQ,GAAG,EAAE;EACjB,IAAI,YAAY,GAAG,CAAC;EACpB,IAAI,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC;EAC9B,EAAE;;EAEF;EACA,EAAE,KAAK,EAAE;EACT,EAAE,QAAQ,CAAC,MAAM,CAAC;;EAElB;EACA;EACA;EACA,EAAE,SAAS,gBAAgB,GAAG;EAC9B,IAAI,IAAI,QAAQ;EAChB,IAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE;EAC/B,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,aAAa,GAAG,EAAE;EAC9C,IAAI;EACJ,IAAI,YAAY,GAAG,CAAC;EACpB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,KAAK,EAAE;EAChC,IAAI,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI;EAC5C,MAAM,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;EACpC,MAAM,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;EAC5C,IAAI,CAAC,CAAC;EACN,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE;EACxB,MAAM,OAAO,OAAO;EACpB,IAAI;EACJ,IAAI,OAAO,CAAC,KAAK,CAAC;EAClB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,eAAe,CAAC,MAAM,EAAE;EACnC,IAAI,OAAO,MAAM,IAAI,OAAO,MAAM,KAAK,UAAU,IAAI,oBAAoB,IAAI,MAAM;EACnF,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE;EACjD,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;EAC9B,MAAM,MAAM,IAAI,SAAS,CAAC,kBAAkB,CAAC;EAC7C,IAAI;;EAEJ;EACA,IAAI,MAAM,KAAK,GAAG,OAAO,IAAI,OAAO,CAAC,KAAK;EAC1C,IAAI,MAAM,eAAe,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;EACtF,IAAI,MAAM,MAAM,GAAG,cAAc,CAAC,eAAe,CAAC;EAClD,IAAI,MAAM,kBAAkB,GAAG,eAAe,CAAC,MAAM,CAAC;;EAEtD;EACA,IAAI,IAAI,CAAC,KAAK,IAAI,kBAAkB,IAAI,EAAE,CAAC,UAAU,EAAE;EACvD;EACA,MAAM,MAAM,KAAK,GAAG,EAAE,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,kBAAkB,CAAC;EAC9E,MAAM,IAAI,KAAK,EAAE;EACjB,QAAQ,OAAO,KAAK;EACpB,MAAM;EACN,IAAI;;EAEJ;EACA;EACA;EACA;EACA,IAAI,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM;EACjC,IAAI,IAAI,mBAAmB;EAC3B,IAAI,IAAI,KAAK,EAAE;EACf,MAAM,mBAAmB,GAAG,EAAE;EAC9B,MAAM,IAAI,IAAI;EACd,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC,UAAU,EAAE;EAClC,QAAQ,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;EAC9E,MAAM;EACN,IAAI,CAAC,MAAM;EACX,MAAM,mBAAmB,GAAG,EAAE,CAAC,kBAAkB,CAAC,UAAU;EAC5D,IAAI;EACJ,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,EAAE;EACtC,MAAM,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC;EAC5B,MAAM,MAAM,kBAAkB,GAAG,EAAE;EACnC,MAAM,IAAI,WAAW;EACrB,MAAM,KAAK,WAAW,IAAI,mBAAmB,EAAE;EAC/C,QAAQ,MAAM,IAAI,GAAG,eAAe,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;EAC3D,QAAQ,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;EACxD,UAAU;EACV,QAAQ;EACR,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;EAC1B;EACA,UAAU,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC;EAC9C,UAAU,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE;EACpE,YAAY;EACZ,UAAU;EACV,QAAQ;EACR;EACA,QAAQ,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC;EAC5C,MAAM;EACN,MAAM,mBAAmB,GAAG,kBAAkB;EAC9C,MAAM,IAAI,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE;EAC5C,IAAI;EACJ;EACA,IAAI,IAAI,SAAS;EACjB,IAAI,KAAK,SAAS,IAAI,mBAAmB,EAAE;EAC3C,MAAM,IAAI,SAAS,CAAC,MAAM,CAAC,MAAM,IAAI,OAAO,EAAE;EAC9C,QAAQ,OAAO,SAAS;EACxB,MAAM;EACN,IAAI;EACJ,IAAI,MAAM,IAAI,SAAS,CAAC,kCAAkC,IAAI,EAAE,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,GAAG,GAAG,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC;EACjI,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE;EACxC,IAAI,OAAO,aAAa,CAAC,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,cAAc;EAC/D,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE;EACpC;EACA,IAAI,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;EACnC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;EAC1B,MAAM,OAAO,KAAK;EAClB,IAAI;EACJ,IAAI,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa;EAC1C,IAAI,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE;EAClC,MAAM,MAAM,IAAI,KAAK,CAAC,8BAA8B,GAAG,QAAQ,GAAG,WAAW,CAAC;EAC9E,IAAI;EACJ,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACjD,MAAM,MAAM,QAAQ,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;EACpD,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;EAChC,QAAQ,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;EAC5C,MAAM;EACN,IAAI;EACJ,IAAI,MAAM,IAAI,KAAK,CAAC,iBAAiB,GAAG,KAAK,GAAG,MAAM,GAAG,QAAQ,CAAC;EAClE,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,eAAe,CAAC,MAAM,EAAE;EACnC,IAAI,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,GAAG;EAC3F,IAAI,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;EAClD,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,UAAU,CAAC,KAAK,EAAE;EAC7B,IAAI,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;EAChD,IAAI,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK;EAChF,IAAI,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;EAClE,IAAI,IAAI,MAAM,GAAG,KAAK;EACtB,IAAI,IAAI,SAAS,GAAG,SAAS,GAAG,KAAK,GAAG,EAAE;EAC1C,IAAI,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE;EACpD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM;EACnC,MAAM,SAAS,IAAI,IAAI,CAAC,IAAI,GAAG,GAAG;EAClC,MAAM,OAAO;EACb,QAAQ,IAAI,EAAE,IAAI,CAAC,IAAI;EACvB,QAAQ,SAAS,EAAE,IAAI,CAAC,KAAK;EAC7B,QAAQ,IAAI,EAAE,IAAI,CAAC,IAAI;EACvB,QAAQ,KAAK,EAAE,IAAI,CAAC,KAAK;EACzB,QAAQ,UAAU,EAAE,IAAI;EACxB,QAAQ,eAAe,EAAE;EACzB,OAAO;EACP,IAAI,CAAC,CAAC;EACN,IAAI,OAAO;EACX,MAAM,KAAK,EAAE,UAAU;EACvB,MAAM,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;EAClC;EACA,MAAM,MAAM;EACZ,MAAM,aAAa,EAAE,KAAK;EAC1B,MAAM;EACN,KAAK;EACL,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,KAAK,EAAE;EAC9B,IAAI,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAClD,IAAI,MAAM,mBAAmB,GAAG,oBAAoB,CAAC,SAAS,CAAC;EAC/D,IAAI,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM;EAC7B,IAAI,IAAI,OAAO,GAAG,KAAK,CAAC,IAAI;EAC5B,IAAI,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,GAAG,CAAC,UAAU,UAAU,EAAE;EAC3E,MAAM,MAAM,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC;EAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,MAAM;EACnC,MAAM,OAAO,IAAI,GAAG,GAAG,UAAU,CAAC,IAAI;EACtC,MAAM,OAAO;EACb,QAAQ,IAAI,EAAE,UAAU,CAAC,IAAI;EAC7B,QAAQ,SAAS,EAAE,IAAI,CAAC,KAAK;EAC7B,QAAQ,IAAI,EAAE,IAAI,CAAC,IAAI;EACvB,QAAQ,KAAK,EAAE,IAAI,CAAC,KAAK;EACzB,QAAQ,UAAU;EAClB,QAAQ,eAAe,EAAE,UAAU,CAAC;EACpC,OAAO;EACP,IAAI,CAAC,CAAC;EACN,IAAI,OAAO;EACX,MAAM,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC;EACjD,MAAM,IAAI,EAAE,OAAO;EACnB,MAAM,MAAM;EACZ,MAAM,aAAa,EAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC;EAChD,MAAM,SAAS,EAAE,KAAK,CAAC;EACvB,KAAK;EACL,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,YAAY,CAAC,KAAK,EAAE;EAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;EACxB,MAAM,KAAK,CAAC,OAAO,GAAG,IAAI,GAAG,EAAE;EAC/B,MAAM,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;EAC/D,IAAI;EACJ,IAAI,OAAO,KAAK,CAAC,OAAO;EACxB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,cAAc,CAAC,YAAY,EAAE;EACxC,IAAI,MAAM,MAAM,GAAG,EAAE;EACrB,IAAI,IAAI,OAAO,YAAY,KAAK,QAAQ,EAAE;EAC1C,MAAM,MAAM,IAAI,SAAS,CAAC,4BAA4B,CAAC;EACvD,IAAI;EACJ,IAAI,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE;EACzC,IAAI,IAAI,SAAS,KAAK,EAAE,EAAE;EAC1B,MAAM,OAAO,MAAM;EACnB,IAAI;EACJ,IAAI,MAAM,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC;EAC1C,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC/C,MAAM,MAAM,WAAW,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;EACzD,MAAM,IAAI,WAAW,CAAC,SAAS,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE;EAC/D,QAAQ,MAAM,IAAI,WAAW,CAAC,6BAA6B,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,qCAAqC,CAAC;EAC3H,MAAM;EACN;EACA,MAAM,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;EAC1C,QAAQ,OAAO,IAAI;EACnB,MAAM;EACN,MAAM,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;EAC9B,IAAI;EACJ,IAAI,OAAO,MAAM;EACjB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,YAAY,CAAC,MAAM,EAAE;EAChC,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;EAC9B,IAAI,OAAO,KAAK,GAAG,KAAK,CAAC,SAAS,GAAG,KAAK;EAC1C,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,KAAK,EAAE;EAC9B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;EAC5C;EACA,MAAM,OAAO,EAAE;EACf,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;EACzC,MAAM,OAAO,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI;EAC/C,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;EACzC,MAAM,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI;EACtD,MAAM,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI;EACtD,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC,EAAE;EAC5B,QAAQ,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;EACnC,MAAM,CAAC;EACP,IAAI,CAAC,MAAM;EACX;EACA,MAAM,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE;EACpD,QAAQ,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI;EACvC,MAAM,CAAC,CAAC;EACR,MAAM,OAAO,SAAS,EAAE,CAAC,CAAC,EAAE;EAC5B,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EAC/C,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;EAC3B,YAAY,OAAO,IAAI;EACvB,UAAU;EACV,QAAQ;EACR,QAAQ,OAAO,KAAK;EACpB,MAAM,CAAC;EACP,IAAI;EACJ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,YAAY,CAAC,MAAM,EAAE;EAChC,IAAI,IAAI,KAAK,EAAE,KAAK,EAAE,KAAK;EAC3B,IAAI,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE;EAC9B;EACA,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC;EAC9C,MAAM,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM;EACnC,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;EAChD,MAAM,MAAM,aAAa,GAAG,UAAU,IAAI,EAAE;EAC5C,QAAQ,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACrD,UAAU,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;EAClC,YAAY,OAAO,KAAK;EACxB,UAAU;EACV,QAAQ;EACR,QAAQ,OAAO,IAAI;EACnB,MAAM,CAAC;EACP,MAAM,OAAO,SAAS,QAAQ,CAAC,IAAI,EAAE;EACrC,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EAC/C,UAAU,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;EAClC,YAAY,OAAO,KAAK;EACxB,UAAU;EACV,QAAQ;EACR,QAAQ,OAAO,aAAa,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,CAAC;EACjE,MAAM,CAAC;EACP,IAAI,CAAC,MAAM;EACX;EACA,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;EAC/B,QAAQ,OAAO,SAAS,QAAQ,CAAC,IAAI,EAAE;EACvC,UAAU,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC;EAClC,QAAQ,CAAC;EACT,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;EACtC,QAAQ,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;EACtC,QAAQ,OAAO,SAAS,QAAQ,CAAC,IAAI,EAAE;EACvC,UAAU,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;EACpD,QAAQ,CAAC;EACT,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;EACtC,QAAQ,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;EACtC,QAAQ,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;EACtC,QAAQ,OAAO,SAAS,QAAQ,CAAC,IAAI,EAAE;EACvC,UAAU,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;EACtE,QAAQ,CAAC;EACT,MAAM,CAAC,MAAM;EACb;EACA,QAAQ,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC;EACvC,QAAQ,OAAO,SAAS,QAAQ,CAAC,IAAI,EAAE;EACvC,UAAU,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACjD,YAAY,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;EACpC,cAAc,OAAO,KAAK;EAC1B,YAAY;EACZ,UAAU;EACV,UAAU,OAAO,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;EAC7C,QAAQ,CAAC;EACT,MAAM;EACN,IAAI;EACJ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,eAAe,CAAC,MAAM,EAAE,KAAK,EAAE;EAC1C,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI;EAC7F,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE;EAC5C,IAAI,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC;EAChD,IAAI,IAAI,CAAC,KAAK,EAAE;EAChB,MAAM,OAAO,IAAI,GAAG,EAAE;EACtB,IAAI;EACJ,IAAI,OAAO,YAAY,CAAC,KAAK,CAAC;EAC9B,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,IAAI,EAAE;EAC7B,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;EACpE,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,mBAAmB,CAAC,UAAU,EAAE,KAAK,EAAE;EAClD,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE;EAC7B,IAAI,UAAU,CAAC,OAAO,CAAC,SAAS,IAAI;EACpC,MAAM,MAAM,QAAQ,GAAG,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC;EACjE,MAAM,IAAI,IAAI;EACd,MAAM,KAAK,IAAI,IAAI,QAAQ,EAAE;EAC7B,QAAQ,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;EACzB,MAAM;EACN,IAAI,CAAC,CAAC;EACN,IAAI,OAAO,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;EAC7D,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE;EAC/C,IAAI,IAAI,GAAG,EAAE,QAAQ;EACrB,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,SAAS;;EAEnC;EACA,IAAI,IAAI,kBAAkB,GAAG,UAAU;EACvC,IAAI,IAAI,KAAK;EACb,IAAI,KAAK,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;EAClD,MAAM,MAAM,gBAAgB,GAAG,EAAE;EACjC,MAAM,kBAAkB,CAAC,OAAO,CAAC,SAAS,IAAI;EAC9C,QAAQ,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC;EAC9D,QAAQ,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC;EACvC,QAAQ,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;EACtG,UAAU,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC;EAC1C,QAAQ;EACR,MAAM,CAAC,CAAC;EACR,MAAM,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE;EACzC;EACA,QAAQ,QAAQ,GAAG,mBAAmB,CAAC,kBAAkB,EAAE,KAAK,CAAC;EACjE,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;EACjC,UAAU,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;EACxD,UAAU,GAAG,GAAG,IAAI,SAAS,CAAC,0CAA0C,GAAG,KAAK,GAAG,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,YAAY,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,WAAW,GAAG,KAAK,GAAG,GAAG,CAAC;EAC/L,UAAU,GAAG,CAAC,IAAI,GAAG;EACrB,YAAY,QAAQ,EAAE,WAAW;EACjC,YAAY,EAAE,EAAE,KAAK;EACrB,YAAY,KAAK;EACjB,YAAY,MAAM,EAAE,WAAW;EAC/B,YAAY;EACZ,WAAW;EACX,UAAU,OAAO,GAAG;EACpB,QAAQ;EACR,MAAM,CAAC,MAAM;EACb,QAAQ,kBAAkB,GAAG,gBAAgB;EAC7C,MAAM;EACN,IAAI;;EAEJ;EACA,IAAI,MAAM,OAAO,GAAG,kBAAkB,CAAC,GAAG,CAAC,UAAU,SAAS,EAAE;EAChE,MAAM,OAAO,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM;EAChF,IAAI,CAAC,CAAC;EACN,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;EACrD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,kBAAkB,EAAE,KAAK,CAAC;EAC/D,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,gCAAgC,GAAG,KAAK,GAAG,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,WAAW,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;EAC9I,MAAM,GAAG,CAAC,IAAI,GAAG;EACjB,QAAQ,QAAQ,EAAE,YAAY;EAC9B,QAAQ,EAAE,EAAE,KAAK;EACjB,QAAQ,KAAK,EAAE,IAAI,CAAC,MAAM;EAC1B,QAAQ;EACR,OAAO;EACP,MAAM,OAAO,GAAG;EAChB,IAAI;;EAEJ;EACA,IAAI,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC;EACnD,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS,EAAE;EACjC,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,iCAAiC,GAAG,KAAK,GAAG,cAAc,GAAG,SAAS,GAAG,YAAY,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;EACpI,MAAM,GAAG,CAAC,IAAI,GAAG;EACjB,QAAQ,QAAQ,EAAE,aAAa;EAC/B,QAAQ,EAAE,EAAE,KAAK;EACjB,QAAQ,KAAK,EAAE,IAAI,CAAC,MAAM;EAC1B,QAAQ,cAAc,EAAE;EACxB,OAAO;EACP,MAAM,OAAO,GAAG;EAChB,IAAI;;EAEJ;EACA,IAAI,MAAM,QAAQ,GAAG,EAAE;EACvB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC1C,MAAM,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;EACrD,IAAI;EACJ,IAAI,GAAG,GAAG,IAAI,SAAS,CAAC,qBAAqB,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,2DAA2D,GAAG,KAAK,GAAG,GAAG,CAAC;EAChJ,IAAI,GAAG,CAAC,IAAI,GAAG;EACf,MAAM,QAAQ,EAAE,UAAU;EAC1B,MAAM,MAAM,EAAE;EACd,KAAK;EACL,IAAI,OAAO,GAAG;EACd,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,kBAAkB,CAAC,KAAK,EAAE;EACrC,IAAI,IAAI,GAAG,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC;EACjC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACjD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;EACnD,IAAI;EACJ,IAAI,OAAO,GAAG;EACd,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,wBAAwB,CAAC,KAAK,EAAE;EAC3C,IAAI,IAAI,GAAG,GAAG,YAAY,GAAG,CAAC;EAC9B,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACjD,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;EACxC,QAAQ,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC;EAC3D,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,GAAG;EACd,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE;EACzC;EACA;EACA,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE;EACvB,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;EAC1B,QAAQ,OAAO,GAAG;EAClB,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE;EAC9B,MAAM,OAAO,IAAI;EACjB,IAAI;;EAEJ;EACA,IAAI,IAAI,MAAM,CAAC,SAAS,EAAE;EAC1B,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE;EAC7B,QAAQ,OAAO,IAAI;EACnB,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,SAAS,EAAE;EACjC,MAAM,OAAO,KAAK;EAClB,IAAI;;EAEJ;EACA,IAAI,MAAM,QAAQ,GAAG,kBAAkB,CAAC,MAAM,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC;EAC5E,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE;EACtB,MAAM,OAAO,KAAM;EACnB,IAAI;EACJ,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE;EACtB,MAAM,OAAO,KAAK;EAClB,IAAI;;EAEJ;EACA;EACA,IAAI,MAAM,KAAK,GAAG,wBAAwB,CAAC,MAAM,CAAC;EAClD,IAAI,MAAM,KAAK,GAAG,wBAAwB,CAAC,MAAM,CAAC;EAClD,IAAI,IAAI,MAAM,CAAC,aAAa,EAAE;EAC9B,MAAM,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE;EACjC,QAAQ,OAAO,CAAC,CAAC,GAAG,KAAK,IAAI,QAAQ;EACrC,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,aAAa,EAAE;EACrC,MAAM,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,GAAG,QAAQ;EACpC,IAAI;;EAEJ;EACA,IAAI,MAAM,QAAQ,GAAG,KAAK,GAAG,KAAK;EAClC,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE;EACtB,MAAM,OAAO,KAAU;EACvB,IAAI;EACJ,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE;EACtB,MAAM,OAAO,SAAS;EACtB,IAAI;;EAEJ;EACA,IAAI,OAAO,CAAC;EACZ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,iBAAiB,CAAC,UAAU,EAAE,UAAU,EAAE;EACrD,IAAI,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM;EACnC,IAAI,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM;EACnC,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;EAC7B,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;EAC7B,IAAI,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC;EACxC,IAAI,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC;EACxC;EACA;EACA,IAAI,IAAI,QAAQ,IAAI,KAAK,CAAC,MAAM,EAAE;EAClC,MAAM,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;EACtC,QAAQ,OAAO,QAAQ;EACvB,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,QAAQ,IAAI,KAAK,CAAC,MAAM,EAAE;EACzC,MAAM,OAAO,IAAS;EACtB,IAAI;;EAEJ;EACA,IAAI,IAAI,IAAI,GAAG,CAAC;EAChB,IAAI,IAAI,KAAK,GAAG,CAAC;EACjB,IAAI,IAAI,GAAG;EACX,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE;EACvB,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,IAAI;EAC5B,MAAM,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,KAAK;EACpC,IAAI;EACJ,IAAI,IAAI,IAAI,GAAG,CAAC;EAChB,IAAI,IAAI,KAAK,GAAG,CAAC;EACjB,IAAI,KAAK,GAAG,IAAI,KAAK,EAAE;EACvB,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,EAAE,IAAI;EAC5B,MAAM,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,KAAK;EACpC,IAAI;EACJ,IAAI,IAAI,IAAI,KAAK,IAAI,EAAE;EACvB,MAAM,OAAO,CAAC,IAAI,GAAG,IAAI,IAAI,OAAO;EACpC,IAAI;;EAEJ;EACA,IAAI,IAAI,QAAQ,IAAI,KAAK,CAAC,aAAa,EAAE;EACzC,MAAM,IAAI,CAAC,QAAQ,IAAI,CAAC,KAAK,CAAC,aAAa,EAAE;EAC7C,QAAQ,OAAO,MAAM;EACrB,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,QAAQ,IAAI,KAAK,CAAC,aAAa,EAAE;EAChD,MAAM,OAAO,IAAO;EACpB,IAAI;;EAEJ;EACA,IAAI,IAAI,KAAK,KAAK,KAAK,EAAE;EACzB,MAAM,OAAO,CAAC,KAAK,GAAG,KAAK,IAAI,KAAK;EACpC,IAAI;;EAEJ;EACA,IAAI,IAAI,QAAQ,EAAE;EAClB,MAAM,IAAI,CAAC,QAAQ,EAAE;EACrB,QAAQ,OAAO,IAAI;EACnB,MAAM;EACN,IAAI,CAAC,MAAM,IAAI,QAAQ,EAAE;EACzB,MAAM,OAAO,IAAK;EAClB,IAAI;;EAEJ;EACA,IAAI,MAAM,eAAe,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,KAAK,QAAQ,GAAG,IAAI,GAAG,GAAG,CAAC;EACnF,IAAI,IAAI,eAAe,KAAK,CAAC,EAAE;EAC/B,MAAM,OAAO,eAAe;EAC5B,IAAI;;EAEJ;EACA;EACA;EACA;EACA,IAAI,MAAM,WAAW,GAAG,EAAE;EAC1B,IAAI,IAAI,EAAE,GAAG,CAAC;EACd,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC3C,MAAM,MAAM,cAAc,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;EAC9D,MAAM,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC;EACtC,MAAM,EAAE,IAAI,cAAc;EAC1B,IAAI;EACJ,IAAI,IAAI,EAAE,KAAK,CAAC,EAAE;EAClB,MAAM,OAAO,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE;EACrC,IAAI;;EAEJ;EACA;EACA;EACA;EACA,IAAI,IAAI,CAAC;EACT,IAAI,IAAI,KAAK,GAAG,CAAC;EACjB,IAAI,MAAM,SAAS,GAAG,KAAK,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;EACtD,IAAI,KAAK,CAAC,IAAI,WAAW,EAAE;EAC3B,MAAM,IAAI,CAAC,KAAK,CAAC,EAAE;EACnB,QAAQ,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,IAAI,CAAC;EAC3C,MAAM;EACN,MAAM,KAAK,IAAI,SAAS;EACxB,IAAI;;EAEJ;EACA,IAAI,OAAO,CAAC;EACZ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,oBAAoB,CAAC,SAAS,EAAE;EAC3C,IAAI,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;EAChC,MAAM,OAAO,EAAE;EACf,IAAI;EACJ,IAAI,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;EACzC,IAAI,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa;;EAE7D;EACA;EACA;EACA,IAAI,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC;EACzC,IAAI,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAE;EACtC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC3C,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE;EAClD,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;EACzE,MAAM;EACN,IAAI;;EAEJ;EACA,IAAI,MAAM,OAAO,GAAG,EAAE;EACtB,IAAI,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE;EAC7C,MAAM,IAAI,SAAS,GAAG,YAAY,GAAG,CAAC;EACtC,MAAM,IAAI,cAAc,GAAG,IAAI;EAC/B,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC7C,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE;EACpD,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,KAAK,GAAG,SAAS,EAAE;EAClE,YAAY,SAAS,GAAG,KAAK,CAAC,KAAK;EACnC,YAAY,cAAc,GAAG,KAAK;EAClC,UAAU;EACV,QAAQ;EACR,MAAM;EACN,MAAM,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC;EAClC,IAAI;EACJ,IAAI,OAAO,OAAO;EAClB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,wBAAwB,CAAC,MAAM,EAAE,EAAE,EAAE;EAChD,IAAI,IAAI,SAAS,GAAG,EAAE;;EAEtB;;EAEA,IAAI,IAAI,IAAI,GAAG,EAAE;EACjB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,EAAE;EAC3C,MAAM,MAAM,SAAS,GAAG,YAAY,CAAC,MAAM,CAAC;EAC5C,MAAM,MAAM,mBAAmB,GAAG,MAAM,CAAC,GAAG,CAAC,oBAAoB,CAAC;EAClE,MAAM,IAAI,GAAG,mBAAmB,CAAC,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACjE,MAAM,SAAS,GAAG,SAAS,WAAW,GAAG;EACzC,QAAQ,MAAM,IAAI,GAAG,EAAE;EACvB,QAAQ,MAAM,IAAI,GAAG,SAAS,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM;EACxE,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;EACvC,UAAU,IAAI,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;EACxD,QAAQ;EACR,QAAQ,IAAI,SAAS,EAAE;EACvB,UAAU,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;EACrE,QAAQ;EACR,QAAQ,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC;EACnC,MAAM,CAAC;EACP,IAAI;EACJ,IAAI,IAAI,YAAY,GAAG,SAAS;EAChC,IAAI,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE;EAC9B,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC;EACtC,MAAM,YAAY,GAAG,SAAS,oBAAoB,GAAG;EACrD,QAAQ,OAAO,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;EACpG,MAAM,CAAC;EACP,IAAI;EACJ,IAAI,IAAI,IAAI,EAAE,MAAM,CAAC,cAAc,CAAC,YAAY,EAAE,MAAM,EAAE;EAC1D,MAAM,KAAK,EAAE;EACb,KAAK,CAAC;EACN,IAAI,OAAO,YAAY;EACvB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,oBAAoB,CAAC,KAAK,EAAE;EACvC,IAAI,IAAI,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW;EAC9C,IAAI,MAAM,KAAK,GAAG,EAAE;EACpB,IAAI,MAAM,WAAW,GAAG,EAAE;EAC1B,IAAI,IAAI,IAAI,GAAG,EAAE;EACjB,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE;EACxC,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE;EAC3B,QAAQ,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,GAAG;EACtE,QAAQ,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EACvD,QAAQ,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC;EACjD,MAAM;EACN,IAAI,CAAC,CAAC;EACN,IAAI,IAAI,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG,MAAM;;EAEzD;EACA,IAAI,IAAI,SAAS,GAAG,GAAG,IAAI,GAAG;EAC9B,IAAI,QAAQ,WAAW,CAAC,MAAM;EAC9B,MAAM,KAAK,CAAC;EACZ,QAAQ;EACR,MAAM,KAAK,CAAC;EACZ,QAAQ,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;EACxB,QAAQ,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC;EACpC,QAAQ,SAAS,GAAG,SAAS,UAAU,CAAC,GAAG,EAAE;EAC7C,UAAU,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;EAC1B,YAAY,OAAO,WAAW,CAAC,GAAG,CAAC;EACnC,UAAU;EACV,UAAU,OAAO,GAAG;EACpB,QAAQ,CAAC;EACT,QAAQ;EACR,MAAM,KAAK,CAAC;EACZ,QAAQ,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;EACxB,QAAQ,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;EACxB,QAAQ,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC;EACpC,QAAQ,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC;EACpC,QAAQ,SAAS,GAAG,SAAS,UAAU,CAAC,GAAG,EAAE;EAC7C,UAAU,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;EAC1B,YAAY,OAAO,WAAW,CAAC,GAAG,CAAC;EACnC,UAAU;EACV,UAAU,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;EAC1B,YAAY,OAAO,WAAW,CAAC,GAAG,CAAC;EACnC,UAAU;EACV,UAAU,OAAO,GAAG;EACpB,QAAQ,CAAC;EACT,QAAQ;EACR,MAAM;EACN,QAAQ,SAAS,GAAG,SAAS,UAAU,CAAC,GAAG,EAAE;EAC7C,UAAU,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACvD,YAAY,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;EAC/B,cAAc,OAAO,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;EACxC,YAAY;EACZ,UAAU;EACV,UAAU,OAAO,GAAG;EACpB,QAAQ,CAAC;EACT;EACA,IAAI,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE;EAC7C,MAAM,KAAK,EAAE;EACb,KAAK,CAAC;EACN,IAAI,OAAO,SAAS;EACpB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,MAAM,EAAE;EAC/B,IAAI,SAAS,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE;EACtD,MAAM,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE;EACjC,QAAQ,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;EACnC,QAAQ,IAAI,eAAe,GAAG,EAAE;EAChC,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE;EAC7B;EACA;EACA,UAAU,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC;EAC5D,UAAU,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE;EACtD,YAAY,eAAe,CAAC,IAAI,CAAC;EACjC,cAAc,KAAK,EAAE,UAAU;EAC/B,cAAc,IAAI,EAAE,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;EACjE,cAAc,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC;EACnD,cAAc,aAAa,EAAE,KAAK;EAClC,cAAc,SAAS,EAAE;EACzB,aAAa,CAAC;EACd,UAAU;EACV,UAAU,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC;EACrC,QAAQ,CAAC,MAAM;EACf;EACA,UAAU,eAAe,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE;EAC5D,YAAY,OAAO;EACnB,cAAc,KAAK,EAAE,CAAC,IAAI,CAAC;EAC3B,cAAc,IAAI,EAAE,IAAI,CAAC,IAAI;EAC7B,cAAc,MAAM,EAAE,IAAI,CAAC,KAAK;EAChC,cAAc,aAAa,EAAE,IAAI,CAAC,UAAU;EAC5C,cAAc,SAAS,EAAE;EACzB,aAAa;EACb,UAAU,CAAC,CAAC;EACZ,QAAQ;;EAER;EACA,QAAQ,OAAO,OAAO,CAAC,eAAe,EAAE,UAAU,SAAS,EAAE;EAC7D,UAAU,OAAO,YAAY,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;EACjF,QAAQ,CAAC,CAAC;EACV,MAAM,CAAC,MAAM;EACb;EACA,QAAQ,OAAO,CAAC,WAAW,CAAC;EAC5B,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;EACtC,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE;EACzC,IAAI,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC;EACvD,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;EACjC,MAAM,MAAM,QAAQ,GAAG,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC;EACpD,MAAM,MAAM,QAAQ,GAAG,iBAAiB,CAAC,OAAO,EAAE,CAAC,CAAC;EACpD,MAAM,IAAI,OAAO,GAAG,KAAK;EACzB,MAAM,IAAI,IAAI;EACd,MAAM,KAAK,IAAI,IAAI,QAAQ,EAAE;EAC7B,QAAQ,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;EAChC,UAAU,OAAO,GAAG,IAAI;EACxB,UAAU;EACV,QAAQ;EACR,MAAM;EACN,MAAM,IAAI,CAAC,OAAO,EAAE;EACpB,QAAQ,OAAO,KAAK;EACpB,MAAM;EACN,IAAI;EACJ,IAAI,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM;EAC/B,IAAI,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM;EAC/B,IAAI,MAAM,UAAU,GAAG,YAAY,CAAC,OAAO,CAAC;EAC5C,IAAI,MAAM,UAAU,GAAG,YAAY,CAAC,OAAO,CAAC;EAC5C,IAAI,OAAO,UAAU,GAAG,UAAU,GAAG,IAAI,KAAK,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,UAAU,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI;EAC7G,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,gBAAgB,CAAC,YAAY,EAAE;EAC1C,IAAI,OAAO,YAAY,CAAC,GAAG,CAAC,EAAE,IAAI;EAClC,MAAM,IAAI,aAAa,CAAC,EAAE,CAAC,EAAE;EAC7B,QAAQ,OAAO,WAAW,CAAC,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC;EACnD,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;EACzB,QAAQ,OAAO,WAAW,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC;EACtE,MAAM;EACN,MAAM,OAAO,EAAE;EACf,IAAI,CAAC,CAAC;EACN,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,kBAAkB,CAAC,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE;EACtE,IAAI,MAAM,kBAAkB,GAAG,EAAE;EACjC,IAAI,IAAI,SAAS;EACjB,IAAI,KAAK,SAAS,IAAI,UAAU,EAAE;EAClC,MAAM,IAAI,UAAU,GAAG,YAAY,CAAC,SAAS,CAAC;EAC9C,MAAM,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE;EAC1C,QAAQ,MAAM,IAAI,SAAS,CAAC,0CAA0C,GAAG,SAAS,GAAG,GAAG,CAAC;EACzF,MAAM;EACN,MAAM,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC;EAC3C,MAAM,IAAI,OAAO,UAAU,KAAK,UAAU,EAAE;EAC5C,QAAQ,OAAO,KAAK;EACpB,MAAM;EACN,MAAM,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;EACzC,IAAI;EACJ,IAAI,OAAO,kBAAkB;EAC7B,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,iBAAiB,CAAC,YAAY,EAAE,YAAY,EAAE,IAAI,EAAE;EAC/D,IAAI,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,YAAY,CAAC;EAC5D,IAAI,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;EACtE,IAAI,IAAI,cAAc,GAAG,IAAI;EAC7B,IAAI,OAAO,cAAc,EAAE;EAC3B,MAAM,cAAc,GAAG,KAAK;EAC5B,MAAM,IAAI,eAAe,GAAG,IAAI;EAChC,MAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EACzD,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE;EAC3B,QAAQ,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC;EACvC,QAAQ,IAAI,aAAa,CAAC,EAAE,CAAC,EAAE;EAC/B,UAAU,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC;EAC9D;EACA,UAAU,iBAAiB,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,WAAW;EAC3D,UAAU,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;EAC9B,UAAU,eAAe,GAAG,KAAK;EACjC,QAAQ,CAAC,MAAM,IAAI,SAAS,CAAC,EAAE,CAAC,EAAE;EAClC,UAAU,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,iBAAiB,EAAE,YAAY,CAAC;EAC/G,UAAU,IAAI,kBAAkB,EAAE;EAClC,YAAY,iBAAiB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,kBAAkB,CAAC;EACtF;EACA,YAAY,iBAAiB,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO;EACrD,YAAY,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI;EAChC,YAAY,eAAe,GAAG,KAAK;EACnC,UAAU,CAAC,MAAM;EACjB,YAAY,cAAc,GAAG,IAAI;EACjC,UAAU;EACV,QAAQ;EACR,MAAM;EACN,MAAM,IAAI,eAAe,IAAI,cAAc,EAAE;EAC7C,QAAQ,MAAM,IAAI,WAAW,CAAC,wDAAwD,CAAC;EACvF,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,iBAAiB;EAC5B,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,sBAAsB,CAAC,aAAa,EAAE;EACjD;;EAEA;EACA,IAAI,MAAM,mBAAmB,GAAG,2BAA2B;EAC3D,IAAI,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,SAAS,IAAI;EACpD,MAAM,MAAM,EAAE,GAAG,aAAa,CAAC,SAAS,CAAC;EACzC,MAAM,IAAI,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE;EACnD,QAAQ,MAAM,IAAI,WAAW,CAAC,4CAA4C,GAAG,wCAAwC,GAAG,kDAAkD,CAAC;EAC3K,MAAM;EACN,IAAI,CAAC,CAAC;EACN,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,mBAAmB,CAAC,IAAI,EAAE,gBAAgB,EAAE;EACvD,IAAI,KAAK,CAAC,WAAW,EAAE;EACvB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;EACpD,MAAM,MAAM,IAAI,WAAW,CAAC,wBAAwB,CAAC;EACrD,IAAI;EACJ,IAAI,IAAI,KAAK,CAAC,yBAAyB,EAAE;EACzC,MAAM,sBAAsB,CAAC,gBAAgB,CAAC;EAC9C,IAAI;;EAEJ;EACA,IAAI,MAAM,YAAY,GAAG,EAAE;EAC3B,IAAI,MAAM,iBAAiB,GAAG,EAAE;EAChC,IAAI,MAAM,aAAa,GAAG,EAAE;EAC5B,IAAI,MAAM,qBAAqB,GAAG,EAAE,CAAC;EACrC,IAAI,IAAI,SAAS;EACjB,IAAI,KAAK,SAAS,IAAI,gBAAgB,EAAE;EACxC;EACA,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,gBAAgB,EAAE,SAAS,CAAC,EAAE;EAC9E,QAAQ;EACR,MAAM;EACN;EACA,MAAM,MAAM,MAAM,GAAG,cAAc,CAAC,SAAS,CAAC;EAC9C,MAAM,IAAI,CAAC,MAAM,EAAE;EACnB;EACA,MAAM,YAAY,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE;EACzC,QAAQ,IAAI,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE;EACrC,UAAU,MAAM,IAAI,SAAS,CAAC,0BAA0B,GAAG,eAAe,CAAC,EAAE,CAAC,GAAG,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;EAC5H,QAAQ;EACR,MAAM,CAAC,CAAC;EACR,MAAM,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC;EAC/B;EACA,MAAM,MAAM,aAAa,GAAG,iBAAiB,CAAC,MAAM;EACpD,MAAM,iBAAiB,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;EACzD,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC;EACtD;EACA,MAAM,IAAI,EAAE;EACZ,MAAM,KAAK,EAAE,IAAI,WAAW,CAAC,gBAAgB,CAAC,EAAE;EAChD,QAAQ,MAAM,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC;EAC1C,QAAQ,qBAAqB,CAAC,IAAI,CAAC;EACnC,UAAU,MAAM,EAAE,EAAE;EACpB,UAAU,IAAI,EAAE,MAAM;EACtB,UAAU,EAAE,EAAE;EACd,SAAS,CAAC;EACV,QAAQ,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE;EAC7C,UAAU,aAAa,CAAC,MAAM,CAAC,GAAG,aAAa;EAC/C,QAAQ;EACR,MAAM;EACN,IAAI;EACJ,IAAI,qBAAqB,CAAC,IAAI,CAAC,iBAAiB,CAAC;;EAEjD;EACA,IAAI,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,iBAAiB,EAAE,aAAa,EAAE,UAAU,CAAC;;EAE7F;EACA,IAAI,IAAI,CAAC;EACT,IAAI,KAAK,CAAC,IAAI,aAAa,EAAE;EAC7B,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,EAAE;EAClE,QAAQ,aAAa,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;EAC9D,MAAM;EACN,IAAI;EACJ,IAAI,MAAM,UAAU,GAAG,EAAE;EACzB,IAAI,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAE,CAAC;EAC3C,IAAI,KAAK,CAAC,IAAI,qBAAqB,EAAE;EACrC;EACA;EACA;EACA,MAAM,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;EAC7C,QAAQ,CAAC,CAAC,EAAE,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;EACtC,QAAQ,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;EAC1B,QAAQ,oBAAoB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;EAC3C,MAAM;EACN,IAAI;;EAEJ;EACA,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EACxG,IAAI,MAAM,KAAK,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG;;EAExD;EACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAChD,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;EAC7D,IAAI;EACJ,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;EACrE,IAAI,MAAM,MAAM,GAAG,GAAG,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;;EAErE;EACA,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAChD,MAAM,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;EACrG,IAAI;EACJ,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK;EAC1D,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;EACvD,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;EACvD,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;EACvD,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;EACvD,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;EACvD,IAAI,MAAM,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE;;EAEvD;EACA,IAAI,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC;EAChC,IAAI,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM;EAClC;EACA,IAAI,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;EAC7C,IAAI,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,cAAc,CAAC;EACrD,IAAI,MAAM,OAAO,GAAG,SAAS,OAAO,GAAG;;EAGvC,MAAM,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;EAC1C,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE;EACjC,UAAU,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EAC9C,QAAQ;EACR,MAAM;EACN,MAAM,OAAO,KAAK,CAAC,UAAU,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,CAAC;EAC1D,IAAI,CAAC;;EAEL;EACA;EACA,IAAI,SAAS,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE;;EAGpC,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE;EACrE,QAAQ,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EACzC,MAAM;EACN,MAAM,OAAO,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC;EAC3C,IAAI;;EAEJ;EACA,IAAI,IAAI;EACR,MAAM,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE;EAChD,QAAQ,KAAK,EAAE;EACf,OAAO,CAAC;EACR,IAAI,CAAC,CAAC,OAAO,GAAG,EAAE;EAClB;EACA;EACA;EACA,IAAI;;EAEJ;EACA;EACA;EACA,IAAI,UAAU,CAAC,UAAU,GAAG,aAAa;;EAEzC;EACA;EACA,IAAI,UAAU,CAAC,kBAAkB,GAAG;EACpC,MAAM,UAAU;EAChB,MAAM,YAAY,EAAE;EACpB,KAAK;EACL,IAAI,OAAO,UAAU;EACrB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE;EAC/C,IAAI,MAAM,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC;EAC7C,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,OAAO,CAAC,GAAG,EAAE;EACxB,IAAI,OAAO,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;EACxC,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE;EACrB,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;EAC9B,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;EAClC,IAAI,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC;EACtD,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,GAAG,EAAE,IAAI,EAAE;EAClC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;EACzC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;EACxB,QAAQ,OAAO,GAAG,CAAC,CAAC,CAAC;EACrB,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,SAAS;EACpB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE;EAClC,IAAI,OAAO,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;EAC9D,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,OAAO,GAAG;EACrB,IAAI,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;EACtF,IAAI,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;EACpC,IAAI,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE;EACxC,MAAM,MAAM,IAAI,SAAS,CAAC,6CAA6C,CAAC;EACxE,IAAI;EACJ,IAAI,OAAO,WAAW,CAAC,UAAU,EAAE,QAAQ,CAAC;EAC5C,EAAE;EACF,EAAE,SAAS,WAAW,CAAC,UAAU,EAAE,QAAQ,EAAE;EAC7C,IAAI,OAAO;EACX,MAAM,OAAO,EAAE;EACf,QAAQ,UAAU;EAClB,QAAQ;EACR;EACA,KAAK;EACL,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,WAAW,CAAC,QAAQ,EAAE;EACjC,IAAI,IAAI,OAAO,QAAQ,KAAK,UAAU,EAAE;EACxC,MAAM,MAAM,IAAI,SAAS,CAAC,8CAA8C,CAAC;EACzE,IAAI;EACJ,IAAI,OAAO;EACX,MAAM,WAAW,EAAE;EACnB,QAAQ;EACR;EACA,KAAK;EACL,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,SAAS,CAAC,UAAU,EAAE;EACjC,IAAI,OAAO,UAAU,IAAI,OAAO,UAAU,CAAC,OAAO,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,OAAO,UAAU,CAAC,OAAO,CAAC,QAAQ,KAAK,UAAU;EACpK,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,UAAU,EAAE;EACrC,IAAI,OAAO,UAAU,IAAI,OAAO,UAAU,CAAC,WAAW,KAAK,QAAQ,IAAI,OAAO,UAAU,CAAC,WAAW,CAAC,QAAQ,KAAK,UAAU;EAC5H,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,SAAS,CAAC,SAAS,EAAE,OAAO,EAAE;EACzC,IAAI,IAAI,CAAC,SAAS,EAAE;EACpB,MAAM,OAAO,OAAO;EACpB,IAAI;EACJ,IAAI,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,EAAE;EAC1C,MAAM,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,yCAAyC,GAAG,SAAS,GAAG,YAAY,GAAG,OAAO,GAAG,GAAG,CAAC;EACjH,MAAM,GAAG,CAAC,IAAI,GAAG;EACjB,QAAQ,MAAM,EAAE,OAAO;EACvB,QAAQ,QAAQ,EAAE;EAClB,OAAO;EACP,MAAM,MAAM,GAAG;EACf,IAAI;EACJ,IAAI,OAAO,SAAS;EACpB,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,aAAa,CAAC,GAAG,EAAE;EAC9B,IAAI,IAAI,IAAI;EACZ,IAAI,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE;EAC3B;EACA;EACA,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC,EAAE;EACnI,QAAQ,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;EAC7C,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,IAAI;EACf,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE;EACzC,IAAI,IAAI,GAAG;EACX,IAAI,KAAK,GAAG,IAAI,MAAM,EAAE;EACxB,MAAM,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;EAC7D,QAAQ,IAAI,GAAG,IAAI,IAAI,EAAE;EACzB,UAAU,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE;EACzC,YAAY,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,aAAa,GAAG,GAAG,GAAG,oBAAoB,CAAC;EAC7E,YAAY,GAAG,CAAC,IAAI,GAAG;EACvB,cAAc,SAAS,EAAE,GAAG;EAC5B,cAAc,cAAc,EAAE,MAAM,CAAC,GAAG,CAAC;EACzC,cAAc,YAAY,EAAE,IAAI,CAAC,GAAG;EACpC,aAAa;EACb,YAAY,MAAM,GAAG;EACrB,UAAU;EACV;EACA,QAAQ;EACR,QAAQ,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;EAC/B,MAAM;EACN,IAAI;EACJ,EAAE;EACF,EAAE,MAAM,SAAS,GAAG,KAAK;;EAEzB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,GAAG,UAAU,SAAS,EAAE;EAC/B,IAAI,MAAM,KAAK,GAAG,OAAO,SAAS,KAAK,QAAQ;EAC/C,IAAI,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC;EAC/B,IAAI,IAAI,IAAI,GAAG,KAAK,GAAG,SAAS,GAAG,EAAE;EACrC,IAAI,MAAM,aAAa,GAAG,EAAE;EAC5B,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EACnD,MAAM,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC;EAC/B,MAAM,IAAI,eAAe,GAAG,EAAE;EAC9B,MAAM,IAAI,QAAQ;EAClB,MAAM,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;EACtC,QAAQ,QAAQ,GAAG,IAAI,CAAC,IAAI;EAC5B,QAAQ,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,EAAE;EAChD;EACA,UAAU,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI;EAChD,QAAQ,CAAC,MAAM,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE;EAC1C;EACA,UAAU,eAAe,GAAG,IAAI,CAAC,UAAU;EAC3C,QAAQ;EACR,MAAM,CAAC,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;EACtC;EACA,QAAQ,eAAe,GAAG,IAAI;EAC9B,QAAQ,IAAI,CAAC,KAAK,EAAE;EACpB,UAAU,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC;EACxC,QAAQ;EACR,MAAM;EACN,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;EACrD,QAAQ,MAAM,GAAG,GAAG,IAAI,SAAS,CAAC,iCAAiC,GAAG,CAAC,GAAG,8BAA8B,GAAG,gEAAgE,CAAC;EAC5K,QAAQ,GAAG,CAAC,IAAI,GAAG;EACnB,UAAU,KAAK,EAAE,CAAC;EAClB,UAAU,QAAQ,EAAE;EACpB,SAAS;EACT,QAAQ,MAAM,GAAG;EACjB,MAAM;EACN,MAAM,IAAI,CAAC,KAAK,EAAE;EAClB,QAAQ,IAAI,GAAG,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC;EACxC,MAAM;EACN,MAAM,eAAe,CAAC,aAAa,EAAE,eAAe,CAAC;EACrD,IAAI;EACJ,IAAI,OAAO,mBAAmB,CAAC,IAAI,IAAI,EAAE,EAAE,aAAa,CAAC;EACzD,EAAE,CAAC;EACH,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM;EACvB,EAAE,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW;EAC3C,EAAE,KAAK,CAAC,UAAU,GAAG,WAAW;EAChC,EAAE,KAAK,CAAC,kBAAkB,GAAG,WAAW;EACxC,EAAE,KAAK,CAAC,WAAW,GAAG,WAAW;EACjC,EAAE,KAAK,CAAC,KAAK,GAAG,KAAK;EACrB,EAAE,KAAK,CAAC,gBAAgB,GAAG,gBAAgB;EAC3C,EAAE,KAAK,CAAC,QAAQ,GAAG,QAAQ;EAC3B,EAAE,KAAK,CAAC,SAAS,GAAG,QAAQ,CAAC;EAC7B,EAAE,KAAK,CAAC,OAAO,GAAG,OAAO;EACzB,EAAE,KAAK,CAAC,WAAW,GAAG,WAAW;EACjC,EAAE,KAAK,CAAC,OAAO,GAAG,OAAO;EACzB,EAAE,KAAK,CAAC,aAAa,GAAG,aAAa;EACrC,EAAE,KAAK,CAAC,IAAI,GAAG,IAAI;EACnB,EAAE,KAAK,CAAC,eAAe,GAAG,eAAe;EACzC,EAAE,KAAK,CAAC,yBAAyB,GAAG,IAAI;;EAExC;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,CAAC,OAAO,GAAG,UAAU,IAAI,EAAE,gBAAgB,EAAE;EACpD,IAAI,IAAI,MAAM,GAAG,KAAK;EACtB,IAAI,IAAI,gBAAgB,KAAK,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;EAC7D,MAAM,MAAM,GAAG,QAAQ;EACvB,IAAI;EACJ,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;EAClC,EAAE,CAAC;;EAEH;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,SAAS,mBAAmB,CAAC,UAAU,EAAE;EAC3C,IAAI,IAAI,CAAC,UAAU,IAAI,OAAO,UAAU,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,UAAU,CAAC,EAAE,KAAK,QAAQ,IAAI,OAAO,UAAU,CAAC,OAAO,KAAK,UAAU,EAAE;EAC7I,MAAM,MAAM,IAAI,SAAS,CAAC,+EAA+E,CAAC;EAC1G,IAAI;EACJ,IAAI,IAAI,UAAU,CAAC,EAAE,KAAK,UAAU,CAAC,IAAI,EAAE;EAC3C,MAAM,MAAM,IAAI,WAAW,CAAC,qCAAqC,GAAG,UAAU,CAAC,IAAI,GAAG,cAAc,CAAC;EACrG,IAAI;EACJ,EAAE;;EAEF;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,CAAC,aAAa,GAAG,UAAU,UAAU,EAAE;EAC9C,IAAI,IAAI,OAAO,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG;EACtF,MAAM,QAAQ,EAAE;EAChB,KAAK;EACL,IAAI,mBAAmB,CAAC,UAAU,CAAC;EACnC,IAAI,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;EACtC,IAAI,MAAM,QAAQ,GAAG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,CAAC;EACnF,IAAI,IAAI,QAAQ,EAAE;EAClB,MAAM,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,EAAE;EACvC,QAAQ,KAAK,CAAC,gBAAgB,CAAC;EAC/B,UAAU,IAAI,EAAE,QAAQ,CAAC,IAAI;EAC7B,UAAU,EAAE,EAAE,UAAU,CAAC,EAAE;EAC3B,UAAU,OAAO,EAAE,QAAQ,CAAC;EAC5B,SAAS,CAAC;EACV,MAAM,CAAC,MAAM;EACb,QAAQ,MAAM,IAAI,KAAK,CAAC,sCAAsC,GAAG,UAAU,CAAC,IAAI,GAAG,QAAQ,GAAG,EAAE,CAAC,IAAI,GAAG,GAAG,CAAC;EAC5G,MAAM;EACN,IAAI;EACJ,IAAI,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC;EAC1B,MAAM,IAAI,EAAE,UAAU,CAAC,IAAI;EAC3B,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI;EACjB,MAAM,OAAO,EAAE,UAAU,CAAC,OAAO;EACjC,MAAM,KAAK,EAAE,YAAY;EACzB,KAAK,CAAC;EACN,EAAE,CAAC;;EAEH;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,CAAC,cAAc,GAAG,UAAU,WAAW,EAAE,OAAO,EAAE;EACzD,IAAI,WAAW,CAAC,OAAO,CAAC,UAAU,IAAI,KAAK,CAAC,aAAa,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;EAC/E,EAAE,CAAC;;EAEH;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,CAAC,gBAAgB,GAAG,UAAU,UAAU,EAAE;EACjD,IAAI,mBAAmB,CAAC,UAAU,CAAC;EACnC,IAAI,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;EACtC,IAAI,MAAM,kBAAkB,GAAG,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,CAAC;EAC7F,IAAI,IAAI,CAAC,kBAAkB,EAAE;EAC7B,MAAM,MAAM,IAAI,KAAK,CAAC,gDAAgD,GAAG,UAAU,CAAC,IAAI,GAAG,MAAM,GAAG,UAAU,CAAC,EAAE,CAAC;EAClH,IAAI;EACJ,IAAI,IAAI,kBAAkB,CAAC,OAAO,KAAK,UAAU,CAAC,OAAO,EAAE;EAC3D,MAAM,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC;EAChF,IAAI;EACJ,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,kBAAkB,CAAC;EAC9D,IAAI,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;EACrC,EAAE,CAAC;;EAEH;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,EAAE,KAAK,CAAC,OAAO,GAAG,UAAU,EAAE,EAAE,OAAO,EAAE;EACzC,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;EAC9B,MAAM,MAAM,IAAI,SAAS,CAAC,kBAAkB,CAAC;EAC7C,IAAI;EACJ,IAAI,MAAM,IAAI,GAAG,EAAE,CAAC,kBAAkB,CAAC,UAAU;EACjD,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;EAC1C,MAAM,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;EACjC,QAAQ,OAAO,IAAI,CAAC,CAAC,CAAC;EACtB,MAAM;EACN,IAAI;EACJ,IAAI,OAAO,IAAI;EACf,EAAE,CAAC;EACH,EAAE,OAAO,KAAK;EACd;AACA,sBAAe,MAAM,EAAE;;;;;;;;"}
\ No newline at end of file
diff --git a/node_modules/typed-function/package.json b/node_modules/typed-function/package.json
new file mode 100644
index 0000000..761fc74
--- /dev/null
+++ b/node_modules/typed-function/package.json
@@ -0,0 +1,65 @@
+{
+  "name": "typed-function",
+  "version": "4.2.2",
+  "description": "Type checking for JavaScript functions",
+  "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
+  "contributors": [
+    "Glen Whitney (https://github.com/gwhitney)",
+    "Luke Gumbley (https://github.com/luke-gumbley)"
+  ],
+  "homepage": "https://github.com/josdejong/typed-function",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/josdejong/typed-function.git"
+  },
+  "keywords": [
+    "typed",
+    "function",
+    "arguments",
+    "compose",
+    "types"
+  ],
+  "type": "module",
+  "main": "lib/umd/typed-function.js",
+  "module": "lib/esm/typed-function.mjs",
+  "browser": "lib/umd/typed-function.js",
+  "scripts": {
+    "test": "mocha test --recursive",
+    "test:lib": "mocha test test-lib --recursive",
+    "build": "npm-run-all build:**",
+    "build:clean": "del-cli lib",
+    "build:esm": "babel src --out-dir lib/esm --out-file-extension .mjs --source-maps --config-file ./babel.config.json",
+    "build:umd": "rollup lib/esm/typed-function.mjs --format umd --name 'typed' --sourcemap --output.file lib/umd/typed-function.js && cpy tools/cjs/package.json lib/umd --flat",
+    "build-and-test": "npm run lint && npm run build && npm run test:lib",
+    "lint": "eslint --cache src/**/*.mjs test/**/*.mjs test-lib/**/*.mjs",
+    "format": "npm run lint -- --fix",
+    "coverage": "c8 --reporter=lcov --reporter=text-summary mocha test --recursive && echo \"\nCoverage report is available at ./coverage/lcov-report/index.html\"",
+    "prepublishOnly": "npm run build-and-test"
+  },
+  "engines": {
+    "node": ">= 18"
+  },
+  "devDependencies": {
+    "@babel/cli": "7.28.3",
+    "@babel/preset-env": "7.28.5",
+    "benchmark": "2.1.4",
+    "c8": "10.1.3",
+    "cpy-cli": "6.0.0",
+    "del-cli": "6.0.0",
+    "eslint": "8.57.1",
+    "eslint-config-standard": "17.1.0",
+    "eslint-plugin-import": "2.32.0",
+    "eslint-plugin-n": "16.6.2",
+    "eslint-plugin-promise": "6.6.0",
+    "mocha": "11.7.5",
+    "npm-run-all": "4.1.5",
+    "pad-right": "0.2.2",
+    "rollup": "4.53.3"
+  },
+  "files": [
+    "README.md",
+    "LICENSE.md",
+    "lib"
+  ],
+  "license": "MIT"
+}
diff --git a/package-lock.json b/package-lock.json
new file mode 100644
index 0000000..d17104a
--- /dev/null
+++ b/package-lock.json
@@ -0,0 +1,795 @@
+{
+  "name": "eventbuzz-chatbot",
+  "version": "1.0.0",
+  "lockfileVersion": 3,
+  "requires": true,
+  "packages": {
+    "": {
+      "name": "eventbuzz-chatbot",
+      "version": "1.0.0",
+      "dependencies": {
+        "@hapi/hapi": "^21.3.0",
+        "bullmq": "^5.34.5",
+        "dotenv": "^16.3.1",
+        "ioredis": "^5.4.2",
+        "mathjs": "^14.0.1"
+      }
+    },
+    "node_modules/@babel/runtime": {
+      "version": "7.29.7",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.29.7.tgz",
+      "integrity": "sha512-Nq8OhGWiZIZGV6hLHoyAKLLcJihP/xFeBMGJoUrxTX2psI8dCifzLhZISFb+VWS3wFMRDmCGw5R+dOySCqPLhw==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@hapi/accept": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/accept/-/accept-6.0.3.tgz",
+      "integrity": "sha512-p72f9k56EuF0n3MwlBNThyVE5PXX40g+aQh+C/xbKrfzahM2Oispv3AXmOIU51t3j77zay1qrX7IIziZXspMlw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/ammo": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/ammo/-/ammo-6.0.1.tgz",
+      "integrity": "sha512-pmL+nPod4g58kXrMcsGLp05O2jF4P2Q3GiL8qYV7nKYEh3cGf+rV4P5Jyi2Uq0agGhVU63GtaSAfBEZOlrJn9w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/b64": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/b64/-/b64-6.0.1.tgz",
+      "integrity": "sha512-ZvjX4JQReUmBheeCq+S9YavcnMMHWqx3S0jHNXWIM1kQDxB9cyfSycpVvjfrKcIS8Mh5N3hmu/YKo4Iag9g2Kw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/boom": {
+      "version": "10.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/boom/-/boom-10.0.1.tgz",
+      "integrity": "sha512-ERcCZaEjdH3OgSJlyjVk8pHIFeus91CjKP3v+MpgBNp5IvGzP2l/bRiD78nqYcKPaZdbKkK5vDBVPd2ohHBlsA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/bounce": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/bounce/-/bounce-3.0.2.tgz",
+      "integrity": "sha512-d0XmlTi3H9HFDHhQLjg4F4auL1EY3Wqj7j7/hGDhFFe6xAbnm3qiGrXeT93zZnPH8gH+SKAFYiRzu26xkXcH3g==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/bourne": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/@hapi/bourne/-/bourne-3.0.0.tgz",
+      "integrity": "sha512-Waj1cwPXJDucOib4a3bAISsKJVb15MKi9IvmTI/7ssVEm6sywXGjVJDhl6/umt1pK1ZS7PacXU3A1PmFKHEZ2w==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/call": {
+      "version": "9.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/call/-/call-9.0.1.tgz",
+      "integrity": "sha512-uPojQRqEL1GRZR4xXPqcLMujQGaEpyVPRyBlD8Pp5rqgIwLhtveF9PkixiKru2THXvuN8mUrLeet5fqxKAAMGg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/catbox": {
+      "version": "12.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/catbox/-/catbox-12.1.1.tgz",
+      "integrity": "sha512-hDqYB1J+R0HtZg4iPH3LEnldoaBsar6bYp0EonBmNQ9t5CO+1CqgCul2ZtFveW1ReA5SQuze9GPSU7/aecERhw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/podium": "^5.0.0",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/catbox-memory": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/catbox-memory/-/catbox-memory-6.0.2.tgz",
+      "integrity": "sha512-H1l4ugoFW/ZRkqeFrIo8p1rWN0PA4MDTfu4JmcoNDvnY975o29mqoZblqFTotxNHlEkMPpIiIBJTV+Mbi+aF0g==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/content": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/content/-/content-6.0.2.tgz",
+      "integrity": "sha512-OKyCOTjNR1hftwSjk9ueyAQTw8AwapvzBrPIWMGn39vhR5PmqLdYFmLc35bsSBye7gSMnlkXfc679bUdMIcRyQ==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.0"
+      }
+    },
+    "node_modules/@hapi/cryptiles": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/cryptiles/-/cryptiles-6.0.3.tgz",
+      "integrity": "sha512-r6VKalpbMHz4ci3gFjFysBmhwCg70RpYZy6OkjEpdXzAYnYFX5XsW7n4YMJvuIYpnMwLxGUjK/cBhA7X3JDvXw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/file": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/@hapi/file/-/file-3.0.0.tgz",
+      "integrity": "sha512-w+lKW+yRrLhJu620jT3y+5g2mHqnKfepreykvdOcl9/6up8GrQQn+l3FRTsjHTKbkbfQFkuksHpdv2EcpKcJ4Q==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/hapi": {
+      "version": "21.4.9",
+      "resolved": "https://registry.npmjs.org/@hapi/hapi/-/hapi-21.4.9.tgz",
+      "integrity": "sha512-YnecZOVx2AD08VvPl0ZaFS0MjEHqg+InGRmBRli731ct+VwI++dpu3BIYA1Z4SMr6HUAnpyvbQ1aq5woe3fBWg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/accept": "^6.0.3",
+        "@hapi/ammo": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bounce": "^3.0.2",
+        "@hapi/call": "^9.0.1",
+        "@hapi/catbox": "^12.1.1",
+        "@hapi/catbox-memory": "^6.0.2",
+        "@hapi/heavy": "^8.0.1",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/mimos": "^7.0.1",
+        "@hapi/podium": "^5.0.2",
+        "@hapi/shot": "^6.0.2",
+        "@hapi/somever": "^4.1.1",
+        "@hapi/statehood": "^8.2.1",
+        "@hapi/subtext": "^8.1.3",
+        "@hapi/teamwork": "^6.0.1",
+        "@hapi/topo": "^6.0.2",
+        "@hapi/validate": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=14.15.0"
+      }
+    },
+    "node_modules/@hapi/heavy": {
+      "version": "8.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/heavy/-/heavy-8.0.1.tgz",
+      "integrity": "sha512-gBD/NANosNCOp6RsYTsjo2vhr5eYA3BEuogk6cxY0QdhllkkTaJFYtTXv46xd6qhBVMbMMqcSdtqey+UQU3//w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/hoek": {
+      "version": "11.0.7",
+      "resolved": "https://registry.npmjs.org/@hapi/hoek/-/hoek-11.0.7.tgz",
+      "integrity": "sha512-HV5undWkKzcB4RZUusqOpcgxOaq6VOAH7zhhIr2g3G8NF/MlFO75SjOr2NfuSx0Mh40+1FqCkagKLJRykUWoFQ==",
+      "license": "BSD-3-Clause"
+    },
+    "node_modules/@hapi/iron": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/iron/-/iron-7.0.1.tgz",
+      "integrity": "sha512-tEZnrOujKpS6jLKliyWBl3A9PaE+ppuL/+gkbyPPDb/l2KSKQyH4lhMkVb+sBhwN+qaxxlig01JRqB8dk/mPxQ==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/b64": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/cryptiles": "^6.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/mimos": {
+      "version": "7.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/mimos/-/mimos-7.0.1.tgz",
+      "integrity": "sha512-b79V+BrG0gJ9zcRx1VGcCI6r6GEzzZUgiGEJVoq5gwzuB2Ig9Cax8dUuBauQCFKvl2YWSWyOc8mZ8HDaJOtkew==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "mime-db": "^1.52.0"
+      }
+    },
+    "node_modules/@hapi/nigel": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/nigel/-/nigel-5.0.1.tgz",
+      "integrity": "sha512-uv3dtYuB4IsNaha+tigWmN8mQw/O9Qzl5U26Gm4ZcJVtDdB1AVJOwX3X5wOX+A07qzpEZnOMBAm8jjSqGsU6Nw==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/vise": "^5.0.1"
+      },
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/pez": {
+      "version": "6.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/pez/-/pez-6.1.1.tgz",
+      "integrity": "sha512-yg2OS1tC0S1sHXvhUtWsfRn6lrKl9jKtRhZ+EI0woOW/gqX5vM2PZ1459ypCvCYDRLJ9nIyueeEH5MJV1ZDqIg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/b64": "^6.0.1",
+        "@hapi/boom": "^10.0.1",
+        "@hapi/content": "^6.0.1",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/nigel": "^5.0.1"
+      }
+    },
+    "node_modules/@hapi/podium": {
+      "version": "5.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/podium/-/podium-5.0.2.tgz",
+      "integrity": "sha512-T7gf2JYHQQfEfewTQFbsaXoZxSvuXO/QBIGljucUQ/lmPnTTNAepoIKOakWNVWvo2fMEDjycu77r8k6dhreqHA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/teamwork": "^6.0.0",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/shot": {
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/@hapi/shot/-/shot-6.0.3.tgz",
+      "integrity": "sha512-xKmKONUE5AxUNK+EQCSCz35UpPq4cSy6wRCFvMLCDHdyPeXsmAvwxvU4OemGqpWHtAQHyCPjnDbm/fEU9O6l/w==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/somever": {
+      "version": "4.1.1",
+      "resolved": "https://registry.npmjs.org/@hapi/somever/-/somever-4.1.1.tgz",
+      "integrity": "sha512-lt3QQiDDOVRatS0ionFDNrDIv4eXz58IibQaZQDOg4DqqdNme8oa0iPWcE0+hkq/KTeBCPtEOjDOBKBKwDumVg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/bounce": "^3.0.1",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/statehood": {
+      "version": "8.2.1",
+      "resolved": "https://registry.npmjs.org/@hapi/statehood/-/statehood-8.2.1.tgz",
+      "integrity": "sha512-xf72TG/QINW26jUu+uL5H+crE1o8GplIgfPWwPZhnAGJzetIVAQEQYvzq+C0aEVHg5/lMMtQ+L9UryuSa5Yjkg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bounce": "^3.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/cryptiles": "^6.0.1",
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/iron": "^7.0.1",
+        "@hapi/validate": "^2.0.1"
+      }
+    },
+    "node_modules/@hapi/subtext": {
+      "version": "8.1.3",
+      "resolved": "https://registry.npmjs.org/@hapi/subtext/-/subtext-8.1.3.tgz",
+      "integrity": "sha512-WTpEZQjBP3UJ3gGunNl3w5Ao1EOJsuu2vttZ2KEcG+csSLxc0dI6VIkl2md2jDlHiQ2ARAoqdSUScy05A/NHtA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/content": "^6.0.2",
+        "@hapi/file": "^3.0.0",
+        "@hapi/hoek": "^11.0.7",
+        "@hapi/pez": "^6.1.1",
+        "@hapi/wreck": "^18.1.1"
+      }
+    },
+    "node_modules/@hapi/teamwork": {
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/teamwork/-/teamwork-6.0.1.tgz",
+      "integrity": "sha512-52OXRslUfYwXAOG8k58f2h2ngXYQGP0x5RPOo+eWA/FtyLgHjGMrE3+e9LSXP/0q2YfHAK5wj9aA9DTy1K+kyQ==",
+      "license": "BSD-3-Clause",
+      "engines": {
+        "node": ">=14.0.0"
+      }
+    },
+    "node_modules/@hapi/topo": {
+      "version": "6.0.2",
+      "resolved": "https://registry.npmjs.org/@hapi/topo/-/topo-6.0.2.tgz",
+      "integrity": "sha512-KR3rD5inZbGMrHmgPxsJ9dbi6zEK+C3ZwUwTa+eMwWLz7oijWUTWD2pMSNNYJAU6Qq+65NkxXjqHr/7LM2Xkqg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/validate": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/validate/-/validate-2.0.1.tgz",
+      "integrity": "sha512-NZmXRnrSLK8MQ9y/CMqE9WSspgB9xA41/LlYR0k967aSZebWr4yNrpxIbov12ICwKy4APSlWXZga9jN5p6puPA==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2",
+        "@hapi/topo": "^6.0.1"
+      }
+    },
+    "node_modules/@hapi/vise": {
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/@hapi/vise/-/vise-5.0.1.tgz",
+      "integrity": "sha512-XZYWzzRtINQLedPYlIkSkUr7m5Ddwlu99V9elh8CSygXstfv3UnWIXT0QD+wmR0VAG34d2Vx3olqcEhRRoTu9A==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@hapi/wreck": {
+      "version": "18.1.2",
+      "resolved": "https://registry.npmjs.org/@hapi/wreck/-/wreck-18.1.2.tgz",
+      "integrity": "sha512-3dMnV2pfhQiyEqu8DL3VBmxkdLiRDiiUDuG79Dp+UK1gL9ZxAfDOUhB6k3D5MLqcgJJ1IARyGFhwoc1NITr/pg==",
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@hapi/boom": "^10.0.1",
+        "@hapi/bourne": "^3.0.0",
+        "@hapi/hoek": "^11.0.2"
+      }
+    },
+    "node_modules/@ioredis/commands": {
+      "version": "1.10.0",
+      "resolved": "https://registry.npmjs.org/@ioredis/commands/-/commands-1.10.0.tgz",
+      "integrity": "sha512-UmeW7z4LfctwoQ5wkhVzgq8tXkreED2xZGpX+Bg+zA+WJFZCT6c062AfCK/Dfk81xZnnwdhJCUMkitihRaoC2Q==",
+      "license": "MIT"
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-darwin-arm64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-darwin-arm64/-/msgpackr-extract-darwin-arm64-3.0.4.tgz",
+      "integrity": "sha512-LCkGo6JDfaBhgST7UpPWgNgLINpcpabaHfyz5OBx75nUYxBsaEPxjnyNjWpeb/xBup/682QnBfRBy2/LvPutZQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ]
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-darwin-x64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-darwin-x64/-/msgpackr-extract-darwin-x64-3.0.4.tgz",
+      "integrity": "sha512-zExlW9zUJKZH/tOtVMttwjKa4Xm/3KcNjnE3dPN92uCktwavMxpgCA3MoJK/DOnTWsQgo224OaST27/mPNAf+w==",
+      "cpu": [
+        "x64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "darwin"
+      ]
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-linux-arm": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-linux-arm/-/msgpackr-extract-linux-arm-3.0.4.tgz",
+      "integrity": "sha512-Tg3yX65f5GbtXLkrYEHE5oibZG9epyYWas7FogTTEJeDEF9JlXJzKgXaNhT3UXlTOeA+AfZpYZYZ0uPj7Cfquw==",
+      "cpu": [
+        "arm"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-linux-arm64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-linux-arm64/-/msgpackr-extract-linux-arm64-3.0.4.tgz",
+      "integrity": "sha512-dgX0P/9wGPJeHFBG+ZmhgE6bmtMt7NP5CRBGyyktpopdk/mW4POnrpQsSLtKI1dwpc+pPLuXHDh6vvskyQE/sw==",
+      "cpu": [
+        "arm64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-linux-x64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-linux-x64/-/msgpackr-extract-linux-x64-3.0.4.tgz",
+      "integrity": "sha512-8TNXMEjJc3QEy7R/x1INhgiU+XakDAFUzBhaz7+Rbrs8NH5UQeHQxxmzsSBJGyV6I1jW79undiQm8tOI+D+8FQ==",
+      "cpu": [
+        "x64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@msgpackr-extract/msgpackr-extract-win32-x64": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/@msgpackr-extract/msgpackr-extract-win32-x64/-/msgpackr-extract-win32-x64-3.0.4.tgz",
+      "integrity": "sha512-CmCXPQrkbwExx3j946/PtHWHbYJiCRBRDl4BlkRQcJB/YOwQxJRTpoo7aTsortjgoJ1x7opzTSxn7C+ASSLVjQ==",
+      "cpu": [
+        "x64"
+      ],
+      "license": "MIT",
+      "optional": true,
+      "os": [
+        "win32"
+      ]
+    },
+    "node_modules/bullmq": {
+      "version": "5.77.6",
+      "resolved": "https://registry.npmjs.org/bullmq/-/bullmq-5.77.6.tgz",
+      "integrity": "sha512-WCpSoCD4vWyRD+btOsFrO7iBGInrTgG155gTZCV8qY0Yex2KtsbVtFERx6V1WZ2xWl/5ZxnLar8Z8ufnS4f5jg==",
+      "license": "MIT",
+      "dependencies": {
+        "cron-parser": "4.9.0",
+        "ioredis": "5.10.1",
+        "msgpackr": "2.0.1",
+        "node-abort-controller": "3.1.1",
+        "semver": "7.8.0",
+        "tslib": "2.8.1"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "peerDependencies": {
+        "redis": ">=5.0.0"
+      },
+      "peerDependenciesMeta": {
+        "redis": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/bullmq/node_modules/@ioredis/commands": {
+      "version": "1.5.1",
+      "resolved": "https://registry.npmjs.org/@ioredis/commands/-/commands-1.5.1.tgz",
+      "integrity": "sha512-JH8ZL/ywcJyR9MmJ5BNqZllXNZQqQbnVZOqpPQqE1vHiFgAw4NHbvE0FOduNU8IX9babitBT46571OnPTT0Zcw==",
+      "license": "MIT"
+    },
+    "node_modules/bullmq/node_modules/ioredis": {
+      "version": "5.10.1",
+      "resolved": "https://registry.npmjs.org/ioredis/-/ioredis-5.10.1.tgz",
+      "integrity": "sha512-HuEDBTI70aYdx1v6U97SbNx9F1+svQKBDo30o0b9fw055LMepzpOOd0Ccg9Q6tbqmBSJaMuY0fB7yw9/vjBYCA==",
+      "license": "MIT",
+      "dependencies": {
+        "@ioredis/commands": "1.5.1",
+        "cluster-key-slot": "^1.1.0",
+        "debug": "^4.3.4",
+        "denque": "^2.1.0",
+        "lodash.defaults": "^4.2.0",
+        "lodash.isarguments": "^3.1.0",
+        "redis-errors": "^1.2.0",
+        "redis-parser": "^3.0.0",
+        "standard-as-callback": "^2.1.0"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/ioredis"
+      }
+    },
+    "node_modules/cluster-key-slot": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/cluster-key-slot/-/cluster-key-slot-1.1.1.tgz",
+      "integrity": "sha512-rwHwUfXL40Chm1r08yrhU3qpUvdVlgkKNeyeGPOxnW8/SyVDvgRaed/Uz54AqWNaTCAThlj6QAs3TZcKI0xDEw==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/complex.js": {
+      "version": "2.4.3",
+      "resolved": "https://registry.npmjs.org/complex.js/-/complex.js-2.4.3.tgz",
+      "integrity": "sha512-UrQVSUur14tNX6tiP4y8T4w4FeJAX3bi2cIv0pu/DTLFNxoq7z2Yh83Vfzztj6Px3X/lubqQ9IrPp7Bpn6p4MQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/cron-parser": {
+      "version": "4.9.0",
+      "resolved": "https://registry.npmjs.org/cron-parser/-/cron-parser-4.9.0.tgz",
+      "integrity": "sha512-p0SaNjrHOnQeR8/VnfGbmg9te2kfyYSQ7Sc/j/6DtPL3JQvKxmjO9TSjNFpujqV3vEYYBvNNvXSxzyksBWAx1Q==",
+      "license": "MIT",
+      "dependencies": {
+        "luxon": "^3.2.1"
+      },
+      "engines": {
+        "node": ">=12.0.0"
+      }
+    },
+    "node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "license": "MIT",
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/decimal.js": {
+      "version": "10.6.0",
+      "resolved": "https://registry.npmjs.org/decimal.js/-/decimal.js-10.6.0.tgz",
+      "integrity": "sha512-YpgQiITW3JXGntzdUmyUR1V812Hn8T1YVXhCu+wO3OpS4eU9l4YdD3qjyiKdV6mvV29zapkMeD390UVEf2lkUg==",
+      "license": "MIT"
+    },
+    "node_modules/denque": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/denque/-/denque-2.1.0.tgz",
+      "integrity": "sha512-HVQE3AAb/pxF8fQAoiqpvg9i3evqug3hoiwakOyZAwJm+6vZehbkYXZ0l4JxS+I3QxM97v5aaRNhj8v5oBhekw==",
+      "license": "Apache-2.0",
+      "engines": {
+        "node": ">=0.10"
+      }
+    },
+    "node_modules/detect-libc": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/detect-libc/-/detect-libc-2.1.2.tgz",
+      "integrity": "sha512-Btj2BOOO83o3WyH59e8MgXsxEQVcarkUOpEYrubB0urwnN10yQ364rsiByU11nZlqWYZm05i/of7io4mzihBtQ==",
+      "license": "Apache-2.0",
+      "optional": true,
+      "engines": {
+        "node": ">=8"
+      }
+    },
+    "node_modules/dotenv": {
+      "version": "16.6.1",
+      "resolved": "https://registry.npmjs.org/dotenv/-/dotenv-16.6.1.tgz",
+      "integrity": "sha512-uBq4egWHTcTt33a72vpSG0z3HnPuIl6NqYcTrKEg2azoEyl2hpW0zqlxysq2pK9HlDIHyHyakeYaYnSAwd8bow==",
+      "license": "BSD-2-Clause",
+      "engines": {
+        "node": ">=12"
+      },
+      "funding": {
+        "url": "https://dotenvx.com"
+      }
+    },
+    "node_modules/escape-latex": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/escape-latex/-/escape-latex-1.2.0.tgz",
+      "integrity": "sha512-nV5aVWW1K0wEiUIEdZ4erkGGH8mDxGyxSeqPzRNtWP7ataw+/olFObw7hujFWlVjNsaDFw5VZ5NzVSIqRgfTiw==",
+      "license": "MIT"
+    },
+    "node_modules/fraction.js": {
+      "version": "5.3.4",
+      "resolved": "https://registry.npmjs.org/fraction.js/-/fraction.js-5.3.4.tgz",
+      "integrity": "sha512-1X1NTtiJphryn/uLQz3whtY6jK3fTqoE3ohKs0tT+Ujr1W59oopxmoEh7Lu5p6vBaPbgoM0bzveAW4Qi5RyWDQ==",
+      "license": "MIT",
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/ioredis": {
+      "version": "5.11.0",
+      "resolved": "https://registry.npmjs.org/ioredis/-/ioredis-5.11.0.tgz",
+      "integrity": "sha512-EZBErytyVovD8f6pDfG3Kb37N6Y3lmDA9NNj+4+IP13CzzHGeX+OyeRM2Um13khRzoBSzzL+5lVnCX8V2RLeMg==",
+      "license": "MIT",
+      "dependencies": {
+        "@ioredis/commands": "1.10.0",
+        "cluster-key-slot": "1.1.1",
+        "debug": "4.4.3",
+        "denque": "2.1.0",
+        "redis-errors": "1.2.0",
+        "redis-parser": "3.0.0",
+        "standard-as-callback": "2.1.0"
+      },
+      "engines": {
+        "node": ">=12.22.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/ioredis"
+      }
+    },
+    "node_modules/javascript-natural-sort": {
+      "version": "0.7.1",
+      "resolved": "https://registry.npmjs.org/javascript-natural-sort/-/javascript-natural-sort-0.7.1.tgz",
+      "integrity": "sha512-nO6jcEfZWQXDhOiBtG2KvKyEptz7RVbpGP4vTD2hLBdmNQSsCiicO2Ioinv6UI4y9ukqnBpy+XZ9H6uLNgJTlw==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.defaults": {
+      "version": "4.2.0",
+      "resolved": "https://registry.npmjs.org/lodash.defaults/-/lodash.defaults-4.2.0.tgz",
+      "integrity": "sha512-qjxPLHd3r5DnsdGacqOMU6pb/avJzdh9tFX2ymgoZE27BmjXrNy/y4LoaiTeAb+O3gL8AfpJGtqfX/ae2leYYQ==",
+      "license": "MIT"
+    },
+    "node_modules/lodash.isarguments": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/lodash.isarguments/-/lodash.isarguments-3.1.0.tgz",
+      "integrity": "sha512-chi4NHZlZqZD18a0imDHnZPrDeBbTtVN7GXMwuGdRH9qotxAjYs3aVLKc7zNOG9eddR5Ksd8rvFEBc9SsggPpg==",
+      "license": "MIT"
+    },
+    "node_modules/luxon": {
+      "version": "3.7.2",
+      "resolved": "https://registry.npmjs.org/luxon/-/luxon-3.7.2.tgz",
+      "integrity": "sha512-vtEhXh/gNjI9Yg1u4jX/0YVPMvxzHuGgCm6tC5kZyb08yjGWGnqAjGJvcXbqQR2P3MyMEFnRbpcdFS6PBcLqew==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/mathjs": {
+      "version": "14.9.1",
+      "resolved": "https://registry.npmjs.org/mathjs/-/mathjs-14.9.1.tgz",
+      "integrity": "sha512-xhqv8Xjf+caWG3WlaPekg4v8QFOR3D5+8ycfcjMcPcnCNDgAONQLaLfyGgrggJrcHx2yUGCpACRpiD4GmXwX+Q==",
+      "license": "Apache-2.0",
+      "dependencies": {
+        "@babel/runtime": "^7.26.10",
+        "complex.js": "^2.2.5",
+        "decimal.js": "^10.4.3",
+        "escape-latex": "^1.2.0",
+        "fraction.js": "^5.2.1",
+        "javascript-natural-sort": "^0.7.1",
+        "seedrandom": "^3.0.5",
+        "tiny-emitter": "^2.1.0",
+        "typed-function": "^4.2.1"
+      },
+      "bin": {
+        "mathjs": "bin/cli.js"
+      },
+      "engines": {
+        "node": ">= 18"
+      }
+    },
+    "node_modules/mime-db": {
+      "version": "1.54.0",
+      "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.54.0.tgz",
+      "integrity": "sha512-aU5EJuIN2WDemCcAp2vFBfp/m4EAhWJnUNSSw0ixs7/kXbd6Pg64EmwJkNdFhB8aWt1sH2CTXrLxo/iAGV3oPQ==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.6"
+      }
+    },
+    "node_modules/ms": {
+      "version": "2.1.3",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz",
+      "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==",
+      "license": "MIT"
+    },
+    "node_modules/msgpackr": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/msgpackr/-/msgpackr-2.0.1.tgz",
+      "integrity": "sha512-9J+tqTEsbHqY8YohazYgty7LgerFIWxvMLpUjqETSmjHojtJm2WnX2kK/2a1fLI7CO7ERP1YSEUXMucz4j+yBA==",
+      "license": "MIT",
+      "optionalDependencies": {
+        "msgpackr-extract": "^3.0.2"
+      }
+    },
+    "node_modules/msgpackr-extract": {
+      "version": "3.0.4",
+      "resolved": "https://registry.npmjs.org/msgpackr-extract/-/msgpackr-extract-3.0.4.tgz",
+      "integrity": "sha512-4kmO/MdyUIkLIvTPr8VHLil4AtoKIoniWPIEk5+CDy0xnWC84azhSFmuJ7PxZdsYtiP5kEeQsORAVIeMgxT+Hw==",
+      "hasInstallScript": true,
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "node-gyp-build-optional-packages": "5.2.2"
+      },
+      "bin": {
+        "download-msgpackr-prebuilds": "bin/download-prebuilds.js"
+      },
+      "optionalDependencies": {
+        "@msgpackr-extract/msgpackr-extract-darwin-arm64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-darwin-x64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-arm": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-arm64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-linux-x64": "3.0.4",
+        "@msgpackr-extract/msgpackr-extract-win32-x64": "3.0.4"
+      }
+    },
+    "node_modules/node-abort-controller": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/node-abort-controller/-/node-abort-controller-3.1.1.tgz",
+      "integrity": "sha512-AGK2yQKIjRuqnc6VkX2Xj5d+QW8xZ87pa1UK6yA6ouUyuxfHuMP6umE5QK7UmTeOAymo+Zx1Fxiuw9rVx8taHQ==",
+      "license": "MIT"
+    },
+    "node_modules/node-gyp-build-optional-packages": {
+      "version": "5.2.2",
+      "resolved": "https://registry.npmjs.org/node-gyp-build-optional-packages/-/node-gyp-build-optional-packages-5.2.2.tgz",
+      "integrity": "sha512-s+w+rBWnpTMwSFbaE0UXsRlg7hU4FjekKU4eyAih5T8nJuNZT1nNsskXpxmeqSK9UzkBl6UgRlnKc8hz8IEqOw==",
+      "license": "MIT",
+      "optional": true,
+      "dependencies": {
+        "detect-libc": "^2.0.1"
+      },
+      "bin": {
+        "node-gyp-build-optional-packages": "bin.js",
+        "node-gyp-build-optional-packages-optional": "optional.js",
+        "node-gyp-build-optional-packages-test": "build-test.js"
+      }
+    },
+    "node_modules/redis-errors": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/redis-errors/-/redis-errors-1.2.0.tgz",
+      "integrity": "sha512-1qny3OExCf0UvUV/5wpYKf2YwPcOqXzkwKKSmKHiE6ZMQs5heeE/c8eXK+PNllPvmjgAbfnsbpkGZWy8cBpn9w==",
+      "license": "MIT",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/redis-parser": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/redis-parser/-/redis-parser-3.0.0.tgz",
+      "integrity": "sha512-DJnGAeenTdpMEH6uAJRK/uiyEIH9WVsUmoLwzudwGJUwZPp80PDBWPHXSAGNPwNvIXAbe7MSUB1zQFugFml66A==",
+      "license": "MIT",
+      "dependencies": {
+        "redis-errors": "^1.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/seedrandom": {
+      "version": "3.0.5",
+      "resolved": "https://registry.npmjs.org/seedrandom/-/seedrandom-3.0.5.tgz",
+      "integrity": "sha512-8OwmbklUNzwezjGInmZ+2clQmExQPvomqjL7LFqOYqtmuxRgQYqOD3mHaU+MvZn5FLUeVxVfQjwLZW/n/JFuqg==",
+      "license": "MIT"
+    },
+    "node_modules/semver": {
+      "version": "7.8.0",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-7.8.0.tgz",
+      "integrity": "sha512-AcM7dV/5ul4EekoQ29Agm5vri8JNqRyj39o0qpX6vDF2GZrtutZl5RwgD1XnZjiTAfncsJhMI48QQH3sN87YNA==",
+      "license": "ISC",
+      "bin": {
+        "semver": "bin/semver.js"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/standard-as-callback": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/standard-as-callback/-/standard-as-callback-2.1.0.tgz",
+      "integrity": "sha512-qoRRSyROncaz1z0mvYqIE4lCd9p2R90i6GxW3uZv5ucSu8tU7B5HXUP1gG8pVZsYNVaXjk8ClXHPttLyxAL48A==",
+      "license": "MIT"
+    },
+    "node_modules/tiny-emitter": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/tiny-emitter/-/tiny-emitter-2.1.0.tgz",
+      "integrity": "sha512-NB6Dk1A9xgQPMoGqC5CVXn123gWyte215ONT5Pp5a0yt4nlEoO1ZWeCwpncaekPHXO60i47ihFnZPiRPjRMq4Q==",
+      "license": "MIT"
+    },
+    "node_modules/tslib": {
+      "version": "2.8.1",
+      "resolved": "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz",
+      "integrity": "sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w==",
+      "license": "0BSD"
+    },
+    "node_modules/typed-function": {
+      "version": "4.2.2",
+      "resolved": "https://registry.npmjs.org/typed-function/-/typed-function-4.2.2.tgz",
+      "integrity": "sha512-VwaXim9Gp1bngi/q3do8hgttYn2uC3MoT/gfuMWylnj1IeZBUAyPddHZlo1K05BDoj8DYPpMdiHqH1dDYdJf2A==",
+      "license": "MIT",
+      "engines": {
+        "node": ">= 18"
+      }
+    }
+  }
+}
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..59b882e
--- /dev/null
+++ b/package.json
@@ -0,0 +1,24 @@
+{
+  "name": "eventbuzz-chatbot",
+  "version": "1.0.0",
+  "description": "EventBuzz WhatsApp concierge webhook and workers",
+  "main": "server.js",
+  "scripts": {
+    "start": "node server.js",
+    "dev": "node scripts/dev-all.js",
+    "dev:server": "node --watch server.js",
+    "dev:inbound": "node --watch workers/inbound.js",
+    "dev:ingest": "node --watch workers/ingest.js",
+    "dev:purge": "node --watch workers/purge.js",
+    "worker:inbound": "node workers/inbound.js",
+    "worker:ingest": "node workers/ingest.js",
+    "worker:purge": "node workers/purge.js"
+  },
+  "dependencies": {
+    "@hapi/hapi": "^21.3.0",
+    "bullmq": "^5.34.5",
+    "dotenv": "^16.3.1",
+    "ioredis": "^5.4.2",
+    "mathjs": "^14.0.1"
+  }
+}
diff --git a/scripts/dev-all.js b/scripts/dev-all.js
new file mode 100644
index 0000000..cf59946
--- /dev/null
+++ b/scripts/dev-all.js
@@ -0,0 +1,62 @@
+#!/usr/bin/env node
+/**
+ * Starts webhook API + ingest + inbound workers in one terminal.
+ * Purge worker is not started here (scheduled job; use npm run dev:purge if needed).
+ */
+const { spawn } = require('child_process');
+const path = require('path');
+
+const root = path.join(__dirname, '..');
+
+require('dotenv').config({ path: path.join(root, '.env') });
+require('dotenv').config({ path: path.join(root, '../backend/.env') });
+
+/** @type {import('child_process').ChildProcess[]} */
+const children = [];
+
+function run(name, script) {
+  const child = spawn(process.execPath, ['--watch', script], {
+    cwd: root,
+    env: process.env,
+    stdio: ['inherit', 'pipe', 'pipe'],
+  });
+
+  const prefix = `[${name}]`;
+  child.stdout?.on('data', (chunk) => {
+    for (const line of String(chunk).split('\n')) {
+      if (line) process.stdout.write(`${prefix} ${line}\n`);
+    }
+  });
+  child.stderr?.on('data', (chunk) => {
+    for (const line of String(chunk).split('\n')) {
+      if (line) process.stderr.write(`${prefix} ${line}\n`);
+    }
+  });
+
+  child.on('exit', (code, signal) => {
+    if (signal === 'SIGTERM' || signal === 'SIGINT') return;
+    console.error(`${prefix} exited with code ${code ?? signal}`);
+    shutdown(typeof code === 'number' ? code : 1);
+  });
+
+  children.push(child);
+  return child;
+}
+
+function shutdown(exitCode = 0) {
+  for (const child of children) {
+    if (!child.killed) child.kill('SIGTERM');
+  }
+  setTimeout(() => process.exit(exitCode), 300);
+}
+
+process.on('SIGINT', () => {
+  console.log('\nShutting down chatbot dev processes…');
+  shutdown(0);
+});
+process.on('SIGTERM', () => shutdown(0));
+
+console.log('Starting chatbot API + ingest + inbound workers (Ctrl+C to stop all)…\n');
+run('api', 'server.js');
+run('ingest', 'workers/ingest.js');
+run('inbound', 'workers/inbound.js');
diff --git a/server.js b/server.js
new file mode 100644
index 0000000..32394d5
--- /dev/null
+++ b/server.js
@@ -0,0 +1,17 @@
+require('dotenv').config();
+const path = require('path');
+require('dotenv').config({ path: path.join(__dirname, '../backend/.env') });
+
+const start = async () => {
+  const app = require('./src/app');
+  try {
+    await app.initialize();
+    await app.start();
+    console.log(`Chatbot server running at: ${app.info.uri}`);
+  } catch (err) {
+    console.error('Failed to start chatbot server:', err);
+    process.exit(1);
+  }
+};
+
+start();
diff --git a/src/app.js b/src/app.js
new file mode 100644
index 0000000..45205e7
--- /dev/null
+++ b/src/app.js
@@ -0,0 +1,33 @@
+const Hapi = require('@hapi/hapi');
+const { connectDB } = require('./config/database');
+const webhookRoutes = require('./routes/webhook.routes');
+
+const createServer = async () => {
+  const server = Hapi.server({
+    port: process.env.PORT || 3020,
+    host: process.env.HOST || 'localhost',
+    routes: {
+      payload: { maxBytes: 10 * 1024 * 1024 },
+    },
+  });
+
+  server.route(webhookRoutes);
+  return server;
+};
+
+const app = {
+  _server: null,
+  async initialize() {
+    await connectDB();
+    this._server = await createServer();
+  },
+  async start() {
+    if (!this._server) await this.initialize();
+    await this._server.start();
+  },
+  get info() {
+    return this._server ? this._server.info : null;
+  },
+};
+
+module.exports = app;
diff --git a/src/config/database.js b/src/config/database.js
new file mode 100644
index 0000000..c404df9
--- /dev/null
+++ b/src/config/database.js
@@ -0,0 +1,2 @@
+/** Use backend mongoose singleton — do not require('mongoose') from chatbot/node_modules. */
+module.exports = require('../../../backend/src/config/database');
diff --git a/src/config/queue.js b/src/config/queue.js
new file mode 100644
index 0000000..9862eab
--- /dev/null
+++ b/src/config/queue.js
@@ -0,0 +1,19 @@
+const {
+  getBullMQConnection,
+  verifyRedisConnection,
+} = require('../../../backend/src/config/redisConnection');
+
+const QUEUE_PREFIX = process.env.CONCIERGE_QUEUE_PREFIX || 'eventbuzz:concierge:';
+
+function getRedisConnection() {
+  return getBullMQConnection();
+}
+
+module.exports = {
+  QUEUE_PREFIX,
+  getRedisConnection,
+  verifyRedisConnection,
+  INBOUND_QUEUE: 'whatsapp-inbound-processor',
+  INGEST_QUEUE: 'concierge-ingest',
+  PURGE_QUEUE: 'concierge-purge',
+};
diff --git a/src/prompts/concierge.js b/src/prompts/concierge.js
new file mode 100644
index 0000000..a725d51
--- /dev/null
+++ b/src/prompts/concierge.js
@@ -0,0 +1,33 @@
+function buildConciergeSystemPrompt(eventName) {
+  return `You are the virtual concierge for the event "${eventName || 'this event'}". Speak like a helpful human agent.
+
+CRITICAL UX RULES:
+- Never mention “context”, “provided context”, “documents”, “pages”, “knowledge base”, "event facts", or internal systems.
+- Do not tell visitors to “check the website/page”. If they need a link, give the link only when you actually have it.
+- Treat the “Event facts” block (if present) as the ground truth. Do not contradict it even if the user mentions a different city.
+- If the user mentions another city/place different from the event city, assume they are asking about visiting it (a side trip) unless they explicitly ask “where is the event”. Do NOT accuse them of a mix-up.
+- Only provide recommendations for another city/place if it is clearly relevant/nearby for this event. Use this rule of thumb:
+  - Allowed if the place is mentioned in the event information you have (e.g., nearby cities/tours listed for the event), OR it is the same city as the event.
+  - Otherwise, politely steer back: ask if they meant places near the event city, and offer suggestions for the event city instead.
+
+What to help with:
+- Event-related questions: agenda/sessions, speakers, venue, timings, registration, logistics, travel basics around the venue/city.
+
+Answering policy:
+- If you have event-specific facts, answer directly and clearly.
+- If the user asks how to register and you have a registration link in the Event facts, provide the link directly.
+- If the user asks how to register but you do NOT have an explicit registration link or explicit registration instructions, do NOT guess steps or requirements. Ask one clarifying question (e.g., “Are you registering online or on-site?”) or say you don’t have the exact registration process and can share the official registration link if provided.
+- If you do NOT have event-specific facts, still help with general guidance when appropriate (e.g., how to get from an airport to a location in a city: taxi/Metro, typical steps, what to ask the driver, safety tips).
+- For “food / places to visit / things to do” questions about another city, give a helpful, general answer about that city and (optionally) add one short line anchoring back to the event city for planning (“If you’re attending in <eventCity>, Satara is about … away” only if you are confident; otherwise just keep it general).
+- If the user asks something unrelated to the event or pure chit-chat, politely decline and steer back to event help.
+
+Guardrails:
+- Never make up event-specific details (exact address, session list, speaker bio, ticket prices, schedule) unless you are sure.
+- Don’t claim real-time browsing or live verification.
+- Ask at most ONE clarifying question when needed (e.g., which airport, arrival time, budget).
+- Keep replies concise (aim under 400 characters), friendly, and action-oriented.`;
+}
+
+module.exports = {
+  buildConciergeSystemPrompt,
+};
diff --git a/src/routes/webhook.routes.js b/src/routes/webhook.routes.js
new file mode 100644
index 0000000..9037b82
--- /dev/null
+++ b/src/routes/webhook.routes.js
@@ -0,0 +1,60 @@
+const { Queue } = require('bullmq');
+const { getRedisConnection, QUEUE_PREFIX, INBOUND_QUEUE } = require('../config/queue');
+
+let inboundQueue;
+
+function getInboundQueue() {
+  if (!inboundQueue) {
+    inboundQueue = new Queue(INBOUND_QUEUE, {
+      connection: getRedisConnection(),
+      prefix: QUEUE_PREFIX,
+    });
+  }
+  return inboundQueue;
+}
+
+const verifyToken = () => process.env.META_WHATSAPP_WEBHOOK_VERIFY_TOKEN || '';
+
+module.exports = [
+  {
+    method: 'GET',
+    path: '/health',
+    options: { auth: false },
+    handler: () => ({ status: 'ok', service: 'eventbuzz-chatbot' }),
+  },
+  {
+    method: 'GET',
+    path: '/webhook/whatsapp',
+    options: { auth: false },
+    handler: (request, h) => {
+      const mode = request.query['hub.mode'];
+      const token = request.query['hub.verify_token'];
+      const challenge = request.query['hub.challenge'];
+      if (mode === 'subscribe' && token === verifyToken()) {
+        return h.response(challenge).code(200);
+      }
+      return h.response('Forbidden').code(403);
+    },
+  },
+  {
+    method: 'POST',
+    path: '/webhook/whatsapp',
+    options: { auth: false },
+    handler: async (request, h) => {
+      const payload = request.payload;
+      const value = payload?.entry?.[0]?.changes?.[0]?.value;
+      if (value?.messages?.[0]) {
+        await getInboundQueue().add(
+          'process-message',
+          {
+            phoneId: value.metadata?.phone_number_id,
+            messageData: value.messages[0],
+            profileName: value.contacts?.[0]?.profile?.name || 'Visitor',
+          },
+          { removeOnComplete: 200, removeOnFail: 500 },
+        );
+      }
+      return h.response('OK').code(200);
+    },
+  },
+];
diff --git a/src/services/conciergeInbound.js b/src/services/conciergeInbound.js
new file mode 100644
index 0000000..927ca0f
--- /dev/null
+++ b/src/services/conciergeInbound.js
@@ -0,0 +1,233 @@
+const ConciergeBot = require('../../../backend/src/models/ConciergeBot');
+const ChatSubscriber = require('../../../backend/src/models/ChatSubscriber');
+const Participant = require('../../../backend/src/models/Participant');
+const Event = require('../../../backend/src/models/Event');
+const {
+  getOrgWhatsAppCredentials,
+  sendTextMessage,
+  sendInteractiveButtons,
+} = require('../../../backend/src/utils/metaWhatsApp');
+const { executeLocalRAG } = require('./conciergeRag');
+const { interpolateConciergeGreeting } = require('../../../backend/src/utils/conciergeGreeting');
+
+const GUEST_PROTECTED_KEYWORDS = [
+  'ticket',
+  'my seat',
+  'badge',
+  'schedule',
+  'my registration',
+  'check in',
+  'check-in',
+];
+
+function isGuestProtectedQuery(text) {
+  const lower = String(text || '').toLowerCase();
+  return GUEST_PROTECTED_KEYWORDS.some((k) => lower.includes(k));
+}
+
+async function findParticipantForEvent(eventId, organizationId, input) {
+  const raw = String(input || '').trim();
+  if (!raw) return null;
+  const phoneDigits = raw.replace(/\D/g, '');
+  const email = raw.includes('@') ? raw.toLowerCase() : null;
+
+  const event = await Event.findById(eventId).lean();
+  const q = { tenantOrganization: organizationId, 'eventMemberships.event': eventId };
+  if (email) q.email = email;
+  else if (phoneDigits.length >= 8) q.phone = new RegExp(phoneDigits.slice(-10));
+  else if (event?.joinCode && raw.toUpperCase() === String(event.joinCode).toUpperCase()) {
+    const byCode = await Participant.findOne({
+      tenantOrganization: organizationId,
+      'eventMemberships.event': eventId,
+    }).lean();
+    return byCode;
+  } else return null;
+
+  return Participant.findOne(q).lean();
+}
+
+async function getCreds(bot) {
+  return getOrgWhatsAppCredentials(String(bot.organization));
+}
+
+async function sendWelcomeFork(bot, creds, phone, profileName, eventName) {
+  const buttons = [{ id: 'action_connect_ticket', title: 'Connect ticket' }];
+  if (bot.registration?.allowGuestSkip !== false) {
+    buttons.push({ id: 'action_guest_explore', title: 'Browse as guest' });
+  }
+  const body = interpolateConciergeGreeting(bot.greeting?.message, { profileName, eventName });
+  if (buttons.length === 1) {
+    await sendTextMessage(creds.phoneNumberId, creds.accessToken, phone, body);
+    await sendTextMessage(
+      creds.phoneNumberId,
+      creds.accessToken,
+      phone,
+      'Reply with your ticket email, phone, or event code to continue.',
+    );
+  } else {
+    await sendInteractiveButtons(creds.phoneNumberId, creds.accessToken, phone, body, buttons);
+  }
+}
+
+/**
+ * @param {{ phoneId: string, messageData: object, profileName: string }} jobData
+ */
+async function processInboundMessage(jobData) {
+  const { phoneId, messageData, profileName } = jobData;
+  const userPhone = String(messageData.from || '').replace(/\D/g, '');
+  const incomingRawText = messageData.text?.body?.trim() || '';
+  const interactiveId =
+    messageData.interactive?.button_reply?.id ||
+    messageData.interactive?.list_reply?.id ||
+    '';
+
+  const bot = await ConciergeBot.findOne({
+    wabaPhoneNumberId: String(phoneId),
+    enabled: true,
+    status: 'ACTIVE',
+  }).populate('event', 'name joinCode organization');
+  if (!bot) return;
+
+  const eventId = bot.event._id || bot.event;
+  const eventName = bot.event.name || 'Event';
+  const creds = await getCreds(bot);
+  if (!creds?.accessToken || !creds.phoneNumberId) {
+    console.warn('[inbound] WhatsApp credentials missing for org', bot.organization);
+    return;
+  }
+
+  let subscriber = await ChatSubscriber.findOne({ eventId, phoneNumber: userPhone });
+  const existingParticipant = await findParticipantForEvent(
+    eventId,
+    bot.organization,
+    userPhone,
+  );
+
+  if (!subscriber) {
+    subscriber = await ChatSubscriber.create({
+      eventId,
+      phoneNumber: userPhone,
+      sessionState: 'WELCOME_FORK',
+      attendeeId: existingParticipant?._id || null,
+    });
+
+    if (existingParticipant) {
+      subscriber.sessionState = 'MAIN_MENU';
+      await subscriber.save();
+      await sendTextMessage(
+        creds.phoneNumberId,
+        creds.accessToken,
+        userPhone,
+        `Welcome back, ${profileName}! You're linked to your registration. Ask me anything about the event.`,
+      );
+      return;
+    }
+
+    if (bot.greeting?.enabled !== false) {
+      await sendWelcomeFork(bot, creds, userPhone, profileName, eventName);
+      return;
+    }
+
+    if (bot.registration?.promptIfUnregistered === false) {
+      subscriber.sessionState = 'MAIN_MENU';
+      subscriber.metaContext = subscriber.metaContext || {};
+      subscriber.metaContext.guestModeEnabled = true;
+      await subscriber.save();
+      await sendTextMessage(
+        creds.phoneNumberId,
+        creds.accessToken,
+        userPhone,
+        `Hi ${profileName}! Ask me anything about ${eventName}.`,
+      );
+      return;
+    }
+
+    await sendWelcomeFork(bot, creds, userPhone, profileName, eventName);
+    return;
+  }
+
+  if (interactiveId === 'action_connect_ticket') {
+    subscriber.sessionState = 'AWAITING_TICKET';
+    await subscriber.save();
+    await sendTextMessage(
+      creds.phoneNumberId,
+      creds.accessToken,
+      userPhone,
+      'Please type your Event Buzz ticket ID, registered email, or phone number.',
+    );
+    return;
+  }
+
+  if (interactiveId === 'action_guest_explore') {
+    subscriber.sessionState = 'MAIN_MENU';
+    subscriber.metaContext = subscriber.metaContext || {};
+    subscriber.metaContext.guestModeEnabled = true;
+    await subscriber.save();
+    await sendTextMessage(
+      creds.phoneNumberId,
+      creds.accessToken,
+      userPhone,
+      `You're browsing as a guest. Ask about venue, Wi-Fi, or general event info.`,
+    );
+    return;
+  }
+
+  if (subscriber.sessionState === 'AWAITING_TICKET' && incomingRawText) {
+    const match = await findParticipantForEvent(eventId, bot.organization, incomingRawText);
+    if (match) {
+      subscriber.attendeeId = match._id;
+      subscriber.sessionState = 'MAIN_MENU';
+      subscriber.metaContext = subscriber.metaContext || {};
+      subscriber.metaContext.guestModeEnabled = false;
+      await subscriber.save();
+      await sendTextMessage(
+        creds.phoneNumberId,
+        creds.accessToken,
+        userPhone,
+        'Account validated! Your digital check-in access is ready.',
+      );
+    } else {
+      const buttons = [{ id: 'action_connect_ticket', title: 'Re-try ticket' }];
+      if (bot.registration?.allowGuestSkip !== false) {
+        buttons.push({ id: 'action_guest_explore', title: 'Browse as guest' });
+      }
+      await sendInteractiveButtons(
+        creds.phoneNumberId,
+        creds.accessToken,
+        userPhone,
+        'Ticket lookup failed. Please re-enter your code or choose guest access.',
+        buttons,
+      );
+    }
+    return;
+  }
+
+  if (subscriber.sessionState === 'WELCOME_FORK') {
+    await sendWelcomeFork(bot, creds, userPhone, profileName, eventName);
+    return;
+  }
+
+  const guestMode = subscriber.metaContext?.guestModeEnabled && !subscriber.attendeeId;
+  if (guestMode && isGuestProtectedQuery(incomingRawText)) {
+    await sendTextMessage(
+      creds.phoneNumberId,
+      creds.accessToken,
+      userPhone,
+      'That information requires registration. Use "Connect ticket" to link your account.',
+    );
+    return;
+  }
+
+  if (!incomingRawText) return;
+
+  const includeEventDetails = bot.knowledge?.includeEventDetails !== false;
+  const answer = await executeLocalRAG(eventId, incomingRawText, eventName, { includeEventDetails });
+  const reply =
+    answer ||
+    "I don't have that in my knowledge base yet. Please check with event staff or try another question.";
+  await sendTextMessage(creds.phoneNumberId, creds.accessToken, userPhone, reply);
+}
+
+module.exports = {
+  processInboundMessage,
+};
diff --git a/src/services/conciergeRag.js b/src/services/conciergeRag.js
new file mode 100644
index 0000000..a047304
--- /dev/null
+++ b/src/services/conciergeRag.js
@@ -0,0 +1,116 @@
+const { dot, norm } = require('mathjs');
+const { embedTexts } = require('../../../backend/src/utils/bedrockEmbed');
+const {
+  createBedrockClient,
+  getBedrockConfig,
+  buildModelIdCandidates,
+  isInvalidModelError,
+} = require('../../../backend/src/utils/bedrockClient');
+const { converse, responseText } = require('../../../backend/src/utils/bedrockConverse');
+const { buildConciergeSystemPrompt } = require('../prompts/concierge');
+const ContextChunk = require('../../../backend/src/models/ContextChunk');
+const KnowledgeSource = require('../../../backend/src/models/KnowledgeSource');
+const Event = require('../../../backend/src/models/Event');
+const { registrationHref } = require('../../../backend/src/utils/micrositeBuild');
+
+function cosineSimilarity(a, b) {
+  const na = norm(a);
+  const nb = norm(b);
+  if (!na || !nb) return 0;
+  return dot(a, b) / (na * nb);
+}
+
+async function buildEventFactsBlock(eventId) {
+  const event = await Event.findById(eventId)
+    .select('name startDate endDate location locationType virtualLink website.folder website.registrationUrl website.registrationFormId')
+    .lean();
+  if (!event) return '';
+  const lines = [];
+  const push = (label, value) => {
+    if (value != null && String(value).trim()) lines.push(`${label}: ${String(value).trim()}`);
+  };
+  push('Event name', event.name);
+  if (event.startDate) push('Start date', new Date(event.startDate).toISOString());
+  if (event.endDate) push('End date', new Date(event.endDate).toISOString());
+  push('City/Location', event.location);
+  push('Location type', event.locationType);
+  push('Virtual link', event.virtualLink);
+  const regUrl = registrationHref(event, event.website);
+  if (regUrl) push('Registration URL', regUrl);
+  const slug = event.website?.folder ? String(event.website.folder).trim() : '';
+  if (slug) push('Microsite slug', slug);
+  return lines.length ? `Event facts (ground truth):\n${lines.join('\n')}\n\n` : '';
+}
+
+/**
+ * @param {string} eventId
+ * @param {string} userQuery
+ * @param {string} eventName
+ * @param {{ includeEventDetails?: boolean }} [options]
+ */
+async function executeLocalRAG(eventId, userQuery, eventName, options = {}) {
+  const includeEventDetails = options.includeEventDetails !== false;
+  const { embeddings, modelId: embedModelId } = await embedTexts([userQuery]);
+  const queryEmbedding = embeddings[0];
+  if (!queryEmbedding?.length) return null;
+
+  const chunkFilter = {
+    eventId,
+    isActive: true,
+    $or: [
+      { embeddingModel: embedModelId },
+      { embeddingModel: { $in: [null, ''] } },
+      { embeddingModel: { $exists: false } },
+    ],
+  };
+
+  if (!includeEventDetails) {
+    const eventSource = await KnowledgeSource.findOne({ eventId, type: 'event' }).select('_id').lean();
+    if (eventSource) {
+      chunkFilter.sourceId = { $ne: eventSource._id };
+    }
+  }
+
+  const activeEventChunks = await ContextChunk.find(chunkFilter).lean();
+  if (!activeEventChunks.length) return null;
+
+  const ranked = activeEventChunks
+    .map((chunk) => ({
+      text: chunk.rawText,
+      score: cosineSimilarity(queryEmbedding, chunk.embedding),
+    }))
+    .sort((a, b) => b.score - a.score)
+    .slice(0, 3);
+
+  const contextBlock = ranked.map((c) => c.text).join('\n\n');
+  const { region, modelId: configuredId } = getBedrockConfig();
+  const client = createBedrockClient(region);
+  const system = buildConciergeSystemPrompt(eventName);
+  const eventFacts = await buildEventFactsBlock(eventId);
+
+  for (const modelId of buildModelIdCandidates(configuredId)) {
+    try {
+      const response = await converse(client, modelId, {
+        system: [{ text: system }],
+        messages: [
+          {
+            role: 'user',
+            content: [
+              {
+                text: `${eventFacts}Context:\n${contextBlock}\n\nQuestion: ${userQuery}`,
+              },
+            ],
+          },
+        ],
+      });
+      return responseText(response);
+    } catch (err) {
+      if (!isInvalidModelError(err)) throw err;
+    }
+  }
+  return null;
+}
+
+module.exports = {
+  executeLocalRAG,
+};
diff --git a/workers/inbound.js b/workers/inbound.js
new file mode 100644
index 0000000..025204e
--- /dev/null
+++ b/workers/inbound.js
@@ -0,0 +1,49 @@
+const path = require('path');
+require('dotenv').config({ path: path.join(__dirname, '../.env') });
+require('dotenv').config({ path: path.join(__dirname, '../../backend/.env') });
+
+const { Worker } = require('bullmq');
+const { connectDB } = require('../src/config/database');
+const { getRedisConnection, verifyRedisConnection, QUEUE_PREFIX, INBOUND_QUEUE } = require('../src/config/queue');
+
+function attachWorkerErrors(worker, label) {
+  worker.on('error', (err) => {
+    console.error(`[${label}] Redis/BullMQ error:`, err.message);
+    if (err.code === 'ECONNRESET') {
+      console.error(
+        `[${label}] Connection reset — if using DigitalOcean Redis, ensure REDIS_URL uses rediss:// or REDIS_TLS=true`,
+      );
+    }
+  });
+}
+
+async function main() {
+  await connectDB();
+  await verifyRedisConnection();
+
+  const { processInboundMessage } = require('../src/services/conciergeInbound');
+
+  const worker = new Worker(
+    INBOUND_QUEUE,
+    async (job) => {
+      await processInboundMessage(job.data);
+    },
+    {
+      connection: getRedisConnection(),
+      prefix: QUEUE_PREFIX,
+      concurrency: 5,
+    },
+  );
+
+  worker.on('failed', (job, err) => {
+    console.error('[inbound] failed', job?.id, err.message);
+  });
+  attachWorkerErrors(worker, 'inbound');
+
+  console.log('[inbound] worker started');
+}
+
+main().catch((e) => {
+  console.error(e);
+  process.exit(1);
+});
diff --git a/workers/ingest.js b/workers/ingest.js
new file mode 100644
index 0000000..b179896
--- /dev/null
+++ b/workers/ingest.js
@@ -0,0 +1,55 @@
+const path = require('path');
+require('dotenv').config({ path: path.join(__dirname, '../.env') });
+require('dotenv').config({ path: path.join(__dirname, '../../backend/.env') });
+
+const { Worker } = require('bullmq');
+const { connectDB } = require('../src/config/database');
+const { getRedisConnection, verifyRedisConnection, QUEUE_PREFIX, INGEST_QUEUE } = require('../src/config/queue');
+
+function attachWorkerErrors(worker, label) {
+  worker.on('error', (err) => {
+    console.error(`[${label}] Redis/BullMQ error:`, err.message);
+    if (err.code === 'ECONNRESET') {
+      console.error(
+        `[${label}] Connection reset — if using DigitalOcean Redis, ensure REDIS_URL uses rediss:// or REDIS_TLS=true`,
+      );
+    }
+  });
+}
+
+async function main() {
+  await connectDB();
+  await verifyRedisConnection();
+
+  const { runConciergeIngest } = require('../../backend/src/utils/conciergeIngest');
+
+  const worker = new Worker(
+    INGEST_QUEUE,
+    async (job) => {
+      const { sourceId } = job.data;
+      console.log('[ingest] processing', sourceId);
+      const result = await runConciergeIngest(sourceId);
+      console.log('[ingest] done', sourceId, result);
+      return result;
+    },
+    {
+      connection: getRedisConnection(),
+      prefix: QUEUE_PREFIX,
+      concurrency: 2,
+      lockDuration: 900000,
+      stalledInterval: 120000,
+    },
+  );
+
+  worker.on('failed', (job, err) => {
+    console.error('[ingest] failed', job?.id, err.message);
+  });
+  attachWorkerErrors(worker, 'ingest');
+
+  console.log('[ingest] worker started');
+}
+
+main().catch((e) => {
+  console.error(e);
+  process.exit(1);
+});
diff --git a/workers/purge.js b/workers/purge.js
new file mode 100644
index 0000000..656cbae
--- /dev/null
+++ b/workers/purge.js
@@ -0,0 +1,76 @@
+const path = require('path');
+require('dotenv').config({ path: path.join(__dirname, '../.env') });
+require('dotenv').config({ path: path.join(__dirname, '../../backend/.env') });
+
+const { Worker, Queue } = require('bullmq');
+const { connectDB } = require('../src/config/database');
+const { getRedisConnection, QUEUE_PREFIX, PURGE_QUEUE } = require('../src/config/queue');
+
+async function executeDataPurge() {
+  const Event = require('../../backend/src/models/Event');
+  const ConciergeBot = require('../../backend/src/models/ConciergeBot');
+  const KnowledgeSource = require('../../backend/src/models/KnowledgeSource');
+  const ContextChunk = require('../../backend/src/models/ContextChunk');
+  const ChatSubscriber = require('../../backend/src/models/ChatSubscriber');
+
+  const thresholdDate = new Date();
+  thresholdDate.setDate(thresholdDate.getDate() - 7);
+
+  const expiredEvents = await Event.find({
+    endDate: { $lt: thresholdDate },
+  }).select('_id');
+
+  const eventIds = expiredEvents.map((e) => e._id);
+  if (!eventIds.length) return { purged: 0 };
+
+  const bots = await ConciergeBot.find({
+    event: { $in: eventIds },
+    status: { $ne: 'ARCHIVED' },
+  });
+
+  for (const bot of bots) {
+    const eventId = bot.event;
+    await ContextChunk.deleteMany({ eventId });
+    await KnowledgeSource.deleteMany({ eventId });
+    await ChatSubscriber.deleteMany({ eventId });
+    bot.status = 'ARCHIVED';
+    bot.lastPurgedAt = new Date();
+    await bot.save();
+    console.log(`[purge] archived bot for event ${eventId}`);
+  }
+
+  return { purged: bots.length };
+}
+
+async function main() {
+  await connectDB();
+
+  const connection = getRedisConnection();
+  const queue = new Queue(PURGE_QUEUE, { connection, prefix: QUEUE_PREFIX });
+
+  await queue.add(
+    'daily-purge',
+    {},
+    {
+      repeat: { pattern: '0 2 * * *', tz: 'UTC' },
+      jobId: 'concierge-daily-purge',
+    },
+  );
+
+  const worker = new Worker(
+    PURGE_QUEUE,
+    async () => executeDataPurge(),
+    { connection, prefix: QUEUE_PREFIX },
+  );
+
+  worker.on('completed', (job, result) => {
+    console.log('[purge] completed', job.id, result);
+  });
+
+  console.log('[purge] worker started (daily 02:00 UTC)');
+}
+
+main().catch((e) => {
+  console.error(e);
+  process.exit(1);
+});